[
  {
    "path": ".gitignore",
    "content": "*.sln\r\n*.userprefs\r\n*.pidb\r\n*.svd\r\n*.suo\r\n*.user\r\n*.booproj\r\nAssets/data.zip\r\nAssets/version.ver\r\nAssets/Slua/LuaObject/*\r\nAssets/StreamingAssets/*.ab\r\nAssets/StreamingAssets/*.manifest\r\nAssets/StreamingAssets/*.meta\r\n/Library\r\n/Library/FailedAssetImports.txt\r\n/Library/cache/\r\n/Library/previews/\r\n/Library/ScriptAssemblies\r\n/obj\r\n/Temp\r\n.DS_Store\r\n.DS_Store?\r\nehthumbs.db\r\nThumbs.db\r\n*.swp\r\n*.Trashes\r\nExportedObj/\r\nTemp/\r\n\r\n*~\r\n\r\n/Assembly-CSharp.csproj\r\n\r\n/Assembly-CSharp-vs.csproj\r\n"
  },
  {
    "path": "Assembly-CSharp-Editor.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\r\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\r\n  <PropertyGroup>\r\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\r\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\r\n    <ProductVersion>10.0.20506</ProductVersion>\r\n    <SchemaVersion>2.0</SchemaVersion>\r\n    <RootNamespace></RootNamespace>\r\n    <ProjectGuid>{491050FB-DB9F-41A2-4FA7-0F02E64E726C}</ProjectGuid>\r\n    <OutputType>Library</OutputType>\r\n    <AppDesignerFolder>Properties</AppDesignerFolder>\r\n    <AssemblyName>Assembly-CSharp-Editor</AssemblyName>\r\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\r\n    <FileAlignment>512</FileAlignment>\r\n    <BaseDirectory>Assets</BaseDirectory>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\r\n    <DebugSymbols>true</DebugSymbols>\r\n    <DebugType>full</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\bin\\Debug\\</OutputPath>\r\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_6_OR_NEWER;UNITY_5_6_0;UNITY_5_6;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_PVR_GI;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_RUNTIME_NAVMESH_BUILDING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;ENABLE_NATIVE_ARRAY;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;ENABLE_VIDEO;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;NET_2_0_SUBSET;ENABLE_PROFILER;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;ENABLE_NATIVE_ARRAY_CHECKS;UNITY_TEAM_LICENSE;CROSS_PLATFORM_INPUT</DefineConstants>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <NoWarn>0169</NoWarn>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>true</Optimize>\r\n    <OutputPath>Temp\\bin\\Release\\</OutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <NoWarn>0169</NoWarn>\r\n  </PropertyGroup>\r\n  <ItemGroup>\r\n    <Reference Include=\"System\" />\r\n    <Reference Include=\"System.XML\" />\r\n    <Reference Include=\"System.Core\" />\r\n    <Reference Include=\"System.Runtime.Serialization\" />\r\n    <Reference Include=\"System.Xml.Linq\" />\r\n    <Reference Include=\"UnityEngine\">\r\n      <HintPath>D:/Unity5.6/Editor/Data/Managed/UnityEngine.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor\">\r\n      <HintPath>D:/Unity5.6/Editor/Data/Managed/UnityEditor.dll</HintPath>\r\n    </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n     <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportAssetBundles.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportConfigWindow.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFont.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFontReader.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMGlyph.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmBetterList.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmByteReader.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmFontEditor.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\Helper.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\I18nExporter\\I18nExporter.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\MakeDebugFile.cs\" />\r\n     <Compile Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\TexturePackerImporter.cs\" />\r\n     <Compile Include=\"Assets\\Slua\\Editor\\CustomEditor.cs\" />\r\n     <Compile Include=\"Assets\\Slua\\Editor\\CustomExport.cs\" />\r\n     <Compile Include=\"Assets\\Slua\\Editor\\LuaCodeGen.cs\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\r\n     <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\r\n     <None Include=\"Assets\\Game\\Resources\\config.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\r\n     <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\new_coroutine.txt\" />\r\n <Reference Include=\"UnityEditor.Advertisements\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/Advertisements/Editor/UnityEditor.Advertisements.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.UI\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/GUISystem/UnityEngine.UI.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.UI\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/GUISystem/Editor/UnityEditor.UI.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.Networking\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/Networking/UnityEngine.Networking.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.Networking\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/Networking/Editor/UnityEditor.Networking.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.TestRunner\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TestRunner/Editor/UnityEditor.TestRunner.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.TestRunner\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TestRunner/UnityEngine.TestRunner.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"nunit.framework\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TestRunner/nunit.framework.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.TreeEditor\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TreeEditor/Editor/UnityEditor.TreeEditor.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.Analytics\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityAnalytics/UnityEngine.Analytics.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.Analytics\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityAnalytics/Editor/UnityEditor.Analytics.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.HoloLens\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityHoloLens/Editor/UnityEditor.HoloLens.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.HoloLens\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityHoloLens/RuntimeEditor/UnityEngine.HoloLens.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.Purchasing\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityPurchasing/Editor/UnityEditor.Purchasing.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.VR\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityVR/Editor/UnityEditor.VR.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.VR\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityVR/RuntimeEditor/UnityEngine.VR.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.Graphs\">\r\n <HintPath>D:/Unity5.6/Editor/Data/Managed/UnityEditor.Graphs.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.Android.Extensions\">\r\n <HintPath>D:/Unity5.6/Editor/Data/PlaybackEngines/AndroidPlayer/UnityEditor.Android.Extensions.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEditor.WindowsStandalone.Extensions\">\r\n <HintPath>D:/Unity5.6/Editor/Data/PlaybackEngines/windowsstandalonesupport/UnityEditor.WindowsStandalone.Extensions.dll</HintPath>\r\n </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <ProjectReference Include=\"Assembly-CSharp-firstpass.csproj\">\r\n      <Project>{E1D36826-B1F4-0A49-5C98-A82920DD91E8}</Project>      <Name>Assembly-CSharp-firstpass</Name>    </ProjectReference>\r\n    <ProjectReference Include=\"Assembly-CSharp.csproj\">\r\n      <Project>{637C5E20-0C4C-D436-F010-B1A7A7E1ED5A}</Project>      <Name>Assembly-CSharp</Name>    </ProjectReference>\r\n  </ItemGroup>\r\n  <Import Project=\"$(MSBuildToolsPath)\\Microsoft.CSharp.targets\" />\r\n  <!-- To modify your build process, add your task inside one of the targets below and uncomment it. \r\n       Other similar extension points exist, see Microsoft.Common.targets.\r\n  <Target Name=\"BeforeBuild\">\r\n  </Target>\r\n  <Target Name=\"AfterBuild\">\r\n  </Target>\r\n  -->\r\n  \r\n</Project>\r\n"
  },
  {
    "path": "Assembly-CSharp-firstpass.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\r\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\r\n  <PropertyGroup>\r\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\r\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\r\n    <ProductVersion>10.0.20506</ProductVersion>\r\n    <SchemaVersion>2.0</SchemaVersion>\r\n    <RootNamespace></RootNamespace>\r\n    <ProjectGuid>{E1D36826-B1F4-0A49-5C98-A82920DD91E8}</ProjectGuid>\r\n    <OutputType>Library</OutputType>\r\n    <AppDesignerFolder>Properties</AppDesignerFolder>\r\n    <AssemblyName>Assembly-CSharp-firstpass</AssemblyName>\r\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\r\n    <FileAlignment>512</FileAlignment>\r\n    <BaseDirectory>Assets</BaseDirectory>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\r\n    <DebugSymbols>true</DebugSymbols>\r\n    <DebugType>full</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\bin\\Debug\\</OutputPath>\r\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_6_OR_NEWER;UNITY_5_6_0;UNITY_5_6;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_PVR_GI;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_RUNTIME_NAVMESH_BUILDING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;ENABLE_NATIVE_ARRAY;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;ENABLE_VIDEO;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;NET_2_0_SUBSET;ENABLE_PROFILER;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;ENABLE_NATIVE_ARRAY_CHECKS;UNITY_TEAM_LICENSE;CROSS_PLATFORM_INPUT</DefineConstants>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <NoWarn>0169</NoWarn>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>true</Optimize>\r\n    <OutputPath>Temp\\bin\\Release\\</OutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <NoWarn>0169</NoWarn>\r\n  </PropertyGroup>\r\n  <ItemGroup>\r\n    <Reference Include=\"System\" />\r\n    <Reference Include=\"System.XML\" />\r\n    <Reference Include=\"System.Core\" />\r\n    <Reference Include=\"System.Runtime.Serialization\" />\r\n    <Reference Include=\"System.Xml.Linq\" />\r\n    <Reference Include=\"UnityEngine\">\r\n      <HintPath>D:/Unity5.6/Editor/Data/Managed/UnityEngine.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor\">\r\n      <HintPath>D:/Unity5.6/Editor/Data/Managed/UnityEditor.dll</HintPath>\r\n    </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n     <Compile Include=\"Assets\\Plugins\\ILeanTween.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\LTDescr.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\LeanAudio.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\LeanTween.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ByteArray.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Coroutine.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Helper.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Logger.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdDLL.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdMeta.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaArray.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaByteArray.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLL.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLLWrapper.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_basetype.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_overload.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaState.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvr.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvrGameObject.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaValueType.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaVarObject.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ObjectCache.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\SLuaSetting.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Timer.cs\" />\r\n     <Compile Include=\"Assets\\Plugins\\Slua_Managed\\WeakDictionary.cs\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\r\n     <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\r\n     <None Include=\"Assets\\Game\\Resources\\config.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\r\n     <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\r\n     <None Include=\"Assets\\Slua\\Resources\\new_coroutine.txt\" />\r\n <Reference Include=\"UnityEngine.UI\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/GUISystem/UnityEngine.UI.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.Networking\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/Networking/UnityEngine.Networking.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.TestRunner\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TestRunner/UnityEngine.TestRunner.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"nunit.framework\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/TestRunner/nunit.framework.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.Analytics\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityAnalytics/UnityEngine.Analytics.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.HoloLens\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityHoloLens/RuntimeEditor/UnityEngine.HoloLens.dll</HintPath>\r\n </Reference>\r\n <Reference Include=\"UnityEngine.VR\">\r\n <HintPath>D:/Unity5.6/Editor/Data/UnityExtensions/Unity/UnityVR/RuntimeEditor/UnityEngine.VR.dll</HintPath>\r\n </Reference>\r\n  </ItemGroup>\r\n  <Import Project=\"$(MSBuildToolsPath)\\Microsoft.CSharp.targets\" />\r\n  <!-- To modify your build process, add your task inside one of the targets below and uncomment it. \r\n       Other similar extension points exist, see Microsoft.Common.targets.\r\n  <Target Name=\"BeforeBuild\">\r\n  </Target>\r\n  <Target Name=\"AfterBuild\">\r\n  </Target>\r\n  -->\r\n  \r\n</Project>\r\n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LClass.lua",
    "content": "local LDeclare = require \"Base/LGlobal\"\nlocal L_VERSION = require \"Base/LVersion\"\n\n-- The hold all class type.\nlocal __LClassTypeList = {}\n\n-- The inherit class function.\nlocal function __LClass(TypeName, SuperType)\n    -- Create new class type.\n    local ClassType = {}\n\n    -- Set class type property.\n    ClassType.TypeName = TypeName\n    ClassType.SuperType = SuperType\n    ClassType.ctor = false\n    ClassType.dtor = false\n\n    -- The new alloc function of this class.\n    ClassType.new = function (...)\n        -- Create a new object first and set metatable.\n        local Obj = {}\n\n        -- Give a tostring method.\n        Obj.ToString = function (self)\n            if not self.__InstanceName then\n                local str = tostring(self)\n                local _, _, addr = string.find(str, \"table%s*:%s*(0?[xX]?%x+)\")\n                self.__InstanceName = ClassType.TypeName .. \":\" .. addr\n            end\n\n            return self.__InstanceName\n        end\n\n        -- Get class type name.\n        Obj.GetType = function (self)\n            return ClassType.TypeName\n        end\n\n        -- Do constructor recursively.\n        local CreateObj = function (Class, Object, ...)\n            local Create\n            Create = function (c, ...)\n                if c.SuperType then\n                    Create(c.SuperType, ...)\n                end\n\n                if c.ctor then\n                    c.ctor(Object, ...)\n                end\n            end\n\n            Create(Class, ...)\n        end\n\n        -- Do destructor recursively.\n        local ReleaseObj = function (Class, Object)\n            local Release\n            Release = function (c)\n                if c.dtor then\n                    c.dtor(Object)\n                end\n\n                if c.SuperType then\n                    Release(c.SuperType)\n                end\n            end\n\n            Release(Class)\n        end\n\n        -- Do the destructor by lua version.\n        if L_VERSION < L_VERSION_520 then\n            -- Create a empty userdata with empty metatable.\n            -- And mark gc method for destructor.\n            local Proxy = newproxy(true)\n            getmetatable(Proxy).__gc = function (o)\n                ReleaseObj(ClassType, Obj)\n            end\n\n            -- Hold the one and only reference to the proxy userdata.\n            Obj.__gc = Proxy\n\n            -- Set metatable.\n            setmetatable(Obj, {__index = __LClassTypeList[ClassType]})\n        else\n            -- Directly set __gc field of the metatable for destructor of this object.\n            setmetatable(Obj, \n            {\n                __index = __LClassTypeList[ClassType],\n\n                __gc = function (o)\n                    ReleaseObj(ClassType, o)\n                end\n            })\n        end\n\n        -- Do constructor for this object.\n        CreateObj(ClassType, Obj, ...)\n        return Obj\n    end\n\n    -- Give a ToString method.\n    ClassType.ToString = function (self)\n        return self.TypeName\n    end\n\n    -- The super class type of this class.\n    if SuperType then\n        ClassType.super = setmetatable({}, \n        {\n            __index = function (t, k)\n                local Func = __LClassTypeList[SuperType][k]\n                if \"function\" == type(Func) then\n                    t[k] = Func\n                    return Func\n                else\n                    error(\"Accessing super class field are not allowed!\")\n                end\n            end\n        })\n    end\n\n    -- Virtual table.\n    local Vtbl = {}\n    __LClassTypeList[ClassType] = Vtbl\n \n    -- Set index and new index of ClassType, and provide a default create method.\n    setmetatable(ClassType,\n    {\n        __index = function (t, k)\n            return Vtbl[k]\n        end,\n\n        __newindex = function (t, k, v)\n            Vtbl[k] = v\n        end,\n\n        __call = function (self, ...)\n            return ClassType.new(...)\n        end\n    })\n \n    -- To copy super class things that this class not have.\n    if SuperType then\n        setmetatable(Vtbl,\n        {\n            __index = function (t, k)\n                local Ret = __LClassTypeList[SuperType][k]\n                Vtbl[k] = Ret\n                return Ret\n            end\n        })\n    end \n \n    return ClassType\nend\n\n-- Set into global.\nif (not LIsDeclared(\"LClass\")) or (not LClass) then\n    LDeclare(\"LClass\", __LClass)\nend\n\n-- Return this.\nreturn __LClass"
  },
  {
    "path": "Assets/Game/@Lua/Base/LClass.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 6a6a6fdea17b444c2b029fac5aad800e\ntimeCreated: 1462415445\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LGlobal.lua",
    "content": "--\n-- Lua global definition file.\n--\n-- @filename  LGlobal.lua\n\n-- The declared global name.\nlocal DeclaredNames = {}\n\n-- The internal global variable table check method.\nlocal function __inner_declare(Name, InitValue)\n    if not rawget(_G, Name) then\n        rawset(_G, Name, InitValue or false)\n    else\n        error(\"You have already declared global : \" .. Name, 2)\n    end\n    \n    DeclaredNames[Name] = true\n    return _G[Name]\nend\n\n-- The internal global variable table index method.\nlocal function __inner_declare_index(t, k)\n    if not DeclaredNames[k] then\n        error(\"Attempt to access an undeclared global variable : \" .. k, 2)\n    end\n\n    return nil\nend\n\nlocal ignore_global = {protobuf=true}\n\n-- The internal global variable table newindex method.\nlocal function __inner_declare_newindex(t, k, v)\n    if (not DeclaredNames[k]) and (ignore_global[k] == nil) then\n        error(\"Attempt to write an undeclared global variable : \" .. k, 2)\n    else\n        rawset(t, k, v)\n    end\nend\n\n-- The global variable declare function.\nlocal function __Declare(Name, InitValue)\n    local ok, res = pcall(__inner_declare, Name, InitValue)\n    if not ok then\n        print(debug.traceback(res, 2))\n        return nil\n    else\n        return res\n    end\nend\n\n\n-- Check if a global variable is declared.\nlocal function __IsDeclared(Name)\n    if DeclaredNames[Name] or rawget(_G, Name) then\n        return true\n    else\n        return false\n    end\nend\n\n-- Set \"Declare\" into global.\nif (not __IsDeclared(\"LDeclare\")) or (not LDeclare) then\n    __Declare(\"LDeclare\", __Declare)\nend\n\n-- Set \"IsDeclared\" into global.\nif (not __IsDeclared(\"LIsDeclared\")) or (not LIsDeclared) then\n    __Declare(\"LIsDeclared\", __IsDeclared)\nend\n\n-- Set limit to define global variables.\nsetmetatable(_G,\n{\n    __index = function (t, k)\n        local ok, res = pcall(__inner_declare_index, t, k)\n        if not ok then\n            print(debug.traceback(res, 2))\n        end\n\n        return nil\n    end,\n\n    __newindex = function (t, k, v)\n        local ok, res = pcall(__inner_declare_newindex, t, k, v)\n        if not ok then\n            print(debug.traceback(res, 2))\n        end\n    end\n})\n\n-- Return this.\nreturn __Declare\n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LGlobal.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 58057dc8c9be442b79b1538261f96691\ntimeCreated: 1462415445\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LMessage.lua",
    "content": "-- 通用事件派发器 static class\n--[[\n    eg: LMessage:addEvent(\n            \"eventName\", \n            function(data) \n                print(data[1], data[2], data[3])  --1, 2, 3\n            end\n        )\n        LMessage:dispatchEvent(\"eventName\", {1, 2, 3})\n]]\n\nLEventData = LDeclare(\"LEventData\", LClass(\"LEventData\"))\nLEventData.name = \"\"\nLEventData.listener = nil\nLEventData.target = nil\n\nfunction LEventData:create()\n    return LEventData.new()\nend\n\n\nLMessage = LDeclare(\"LMessage\", LClass(\"LMessage\"))\n\nLMessage._eventDict = {}\n\n--[[\n    注册事件\n    @param eventName 事件名\n    @param listener 回调函数\n    @param target 注册者(类似使用target:listener())\n]]\nfunction LMessage:addEvent(eventName, listener, target)\n\n    assert(type(eventName) == \"string\" or eventName ~= \"\", \"invalid event name\")\n\n    if not listener then\n        return\n    end\n\n    local listeners = LMessage._eventDict[eventName] or {}\n    LMessage._eventDict[eventName] = listeners\n\n    for _, v in ipairs(listeners) do\n        if v.listener == listener then\n            return\n        end\n    end\n\n    local event = LEventData:create()\n    event.listener = listener\n    event.name = eventName\n    event.target = target\n\n    table.insert(listeners, event)\n\nend\n\nfunction LMessage:removeEvent(eventName, listener)\n    local listeners = LMessage._eventDict[eventName]\n    if not listeners then\n        return\n    end\n\n    -- local event\n\n    -- local i = 1\n    -- while i < #listeners do\n    --     if event.listener == listener then\n    --         table.remove(listeners, i)\n    --         break\n    --     end\n    -- end\n    \n    for i, event in ipairs(listeners) do\n        if event.listener == listener then\n            table.remove(listeners, i)\n            break\n        end\n    end\nend\n\nfunction LMessage:dispatchEvent(eventName, data)\n    local listeners = LMessage._eventDict[eventName]\n    if not listeners then\n        return\n    end\n\n    for _, v in ipairs(listeners) do\n        local callback = v.listener\n        if v.target then\n            callback(v.target, data)\n        else\n            callback(data)\n        end\n    end\n\nend\n\nfunction LMessage:removeAllEvent(eventName)\n    LMessage._eventDict[eventName] = nil\nend\n\nfunction LMessage:hasEvent(eventName, listener)\n    local listeners = LMessage._eventDict[eventName]\n    if not listeners then\n        return false\n    end\n\n    for _, event in ipairs(listeners) do\n        if event.listener == listener then\n            return true\n        end\n    end\n\n    return false\n\nend\n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LMessage.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 7f77f5b899c594fe0a121e7b58246c93\ntimeCreated: 1462415445\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LVersion.lua",
    "content": "--\n-- Lua version parse file.\n--\n-- @filename  Version.lua\n\n-- Get global declare.\nlocal LDeclare = require \"Base/LGlobal\"\n\n-- Get current version number.\nlocal _, _, majorv, minorv, rev = string.find(_VERSION, \"(%d).(%d)[.]?([%d]?)\")\nlocal VersionNumber = tonumber(majorv) * 100 + tonumber(minorv) * 10 + (((string.len(rev) == 0) and 0) or tonumber(rev))\n\n-- Declare current version number.\nLDeclare(\"L_VERSION\", VersionNumber)\n\n-- Declare lua history version number.\nLDeclare(\"L_VERSION_510\", 510)\nLDeclare(\"L_VERSION_520\", 520)\nLDeclare(\"L_VERSION_530\", 530)\n\nreturn L_VERSION\n"
  },
  {
    "path": "Assets/Game/@Lua/Base/LVersion.lua.meta",
    "content": "fileFormatVersion: 2\nguid: e6df6eb1d202744a29816e09916a7fb1\ntimeCreated: 1462415445\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Base.meta",
    "content": "fileFormatVersion: 2\nguid: 605851e052326450ab145e03567794ac\nfolderAsset: yes\ntimeCreated: 1462415445\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/EventNames.lua",
    "content": "-- 事件\nlocal EventNames = {}\n\nEventNames.CHARACTOR_HP = \"EventNames.CHARACTOR_HP\"\nEventNames.STATUS_STATE = \"EventNames.STATUS_STATE\"\nEventNames.GAME_STATE = \"EventNames.GAME_STATE\"\nEventNames.MSG_PROTO = \"EventNames.MSG_PROTO\"\n\nEventNames.NET_CONNECT = \"EventNames.NET_CONNECT\"\nEventNames.NET_DISCONNECT = \"EventNames.NET_DISCONNECT\"\n\nEventNames.BATTLE_PLAYER_CHANGE = \"EventNames.BATTLE_PLAYER_CHANGE\"\nEventNames.BATTLE_CAMERA_MOVE = \"EventNames.BATTLE_CAMERA_MOVE\"\nEventNames.BATTLE_PLAYER_MOVE = \"EventNames.BATTLE_PLAYER_MOVE\"\nEventNames.BATTLE_PLAYER_ATTACK = \"EventNames.BATTLE_PLAYER_ATTACK\"\nEventNames.BATTLE_PLAYER_RELOAD = \"EventNames.BATTLE_PLAYER_RELOAD\"\nEventNames.BATTLE_ENEMY_HURT = \"EventNames.BATTLE_ENEMY_HURT\"\nEventNames.BATTLE_ENEMY_DIE = \"EventNames.BATTLE_ENEMY_DIE\"\nEventNames.BATTLE_ENEMY_NUM = \"EventNames.BATTLE_ENEMY_NUM\"\nEventNames.BATTLE_ENEMY_HEADSHOT = \"EventNames.BATTLE_ENEMY_HEADSHOT\"\nEventNames.BATTLE_ENEMY_CREATE = \"EventNames.BATTLE_ENEMY_CREATE\"\nEventNames.BATTLE_PLAYER_HP = \"EventNames.BATTLE_PLAYER_HP\"\nEventNames.BATTLE_CHARACTOR_DIE = \"EventNames.BATTLE_CHARACTOR_DIE\"\nEventNames.BATTLE_WEAPON_AIM = \"EventNames.BATTLE_WEAPON_AIM\"\nEventNames.BATTLE_WEAPON_SHELL = \"EventNames.BATTLE_WEAPON_SHELL\"\nEventNames.BATTLE_SHOW_SHELL = \"EventNames.BATTLE_SHOW_SHELL\"\nEventNames.BATTLE_MAINUI_ENEMYNUM = \"EventNames.BATTLE_MAINUI_ENEMYNUM\"\nEventNames.BATTLE_RESULT = \"EventNames.BATTLE_RESULT\"\n\nLDeclare(\"EventNames\", EventNames)\n\nreturn EventNames"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/EventNames.lua.meta",
    "content": "fileFormatVersion: 2\nguid: c5a4821ebe5123f4eba8af7e62ce46f5\ntimeCreated: 1470564833\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/MsgId.lua",
    "content": "local MsgId = {}\r\n\r\nMsgId.hello = 1;\r\nMsgId.registerApp = 2;\r\nMsgId.broadcastApp = 3;\r\nMsgId.updateApp = 4;\r\nMsgId.webAppCmd = 1000;\r\nMsgId.adminAppCmd = 1001;\r\n\r\n\r\n\r\nLDeclare(\"MsgId\", MsgId)\r\nreturn MsgId"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/MsgId.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 24d1a143c37794c4ab1439e8cfbb95b7\ntimeCreated: 1470562462\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/NetworkManager.lua",
    "content": "-- 网络管理\r\nlocal NetworkManager = LDeclare(\"NetworkManager\", LClass(\"NetworkManager\"))\r\nNetworkManager._instance = nil\r\nNetworkManager._netWork = nil\r\n\r\nfunction NetworkManager:GetInstance()\r\n\r\n\tif NetworkManager._instance == nil then\r\n\t\tNetworkManager._instance = NetworkManager()\r\n\t\tNetworkManager._instance:init()\r\n\tend\r\n\r\n\treturn NetworkManager._instance\r\nend\r\n\r\nfunction NetworkManager:init()\r\n\r\n    require \"Lib/protobuf/protobuf\"\r\n\r\n    -- self.ip = \"192.168.1.39\"\r\n    -- self.port = 20096\r\n    self.ip = \"localhost\"\r\n    self.port = 9001\r\n\r\n\tself._netWork = Network.GetInstance()\r\n\tself._netWork.onConnect = function(isConn)\r\n\t \tprint(\"onConnect:\" , isConn);\r\n\r\n\t \tself.isConn = isConn\r\n\t\t-- local component_hello = {\r\n\t\t-- \tappId = 123,\r\n\t\t-- \tappType = 12345,\r\n\t\t-- \tgroupId = 15615\r\n\t\t-- }\r\n\r\n\t\t-- self:send(MsgId.hello,component_hello)\r\n\t \tLMessage:dispatchEvent(EventNames.NET_CONNECT,isConn)\r\n\tend\r\n\r\n\tself._netWork.onHandleMessage = function(msgId,packet)\r\n\t\tprint(\"onHandleMessage\")\r\n\t\tlocal decode = protobuf.decode(string.format(\"component.component_%s\",self.msgIdsName[msgId]),packet)\r\n\t\tLMessage:dispatchEvent(EventNames.MSG_PROTO,{id=msgId,obj=decode})\r\n\tend\r\n\r\n\tself._netWork.onDisconnect = function()\r\n\t\tprint(\"onDisconnect\")\r\n\t\tself.isConn = false\r\n\r\n\t\tLMessage:dispatchEvent(EventNames.NET_DISCONNECT)\r\n\tend\r\n\r\n\tself:proto()\r\n\r\n\tself._netWork:connect(self.ip, self.port);\r\nend\r\n\r\nfunction NetworkManager:proto()\r\n\r\n\tself.msgIdsName = {}\r\n\tfor name,id in pairs(MsgId) do\r\n\t\tself.msgIdsName[id] = name\r\n\tend\r\n\r\n\tself.protoFile = \"masterd\"\r\n\r\n\tlocal buffer = self._netWork:GetProtoBytes(self.protoFile)\r\n\tprotobuf.register(buffer)\r\nend\r\n\r\nfunction NetworkManager:send(msgId,protoObj)\r\n\t\r\n\tif self._netWork:valid() and self.isConn then\r\n\r\n\t\tlocal code = protobuf.encode(string.format(\"component.component_%s\",self.msgIdsName[msgId]),protoObj)\r\n\t\tself._netWork:send(msgId,code)\r\n\tend\r\nend\r\n\r\n\r\nreturn NetworkManager"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/NetworkManager.lua.meta",
    "content": "fileFormatVersion: 2\nguid: a31fce2e14bc9c545ae091b69ab912d0\ntimeCreated: 1470562129\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/Util.lua",
    "content": "local Util = {}\r\n\r\n-- 清空子节点\r\nUtil.removeAllChild = function(gameObject)\r\n\t\r\n\tlocal len = gameObject.transform.childCount\r\n\tlocal obj = nil\r\n\tfor i=0,len-1 do\r\n\t\tobj = gameObject.transform:GetChild(i).gameObject\r\n\t\tObject.Destroy(obj)\r\n\tend\r\n\r\nend\r\n\r\n-- 切割字符串\r\nUtil.split = function(s, p)\r\n    local rt= {}\r\n    string.gsub(s, '[^'..p..']+', function(w) table.insert(rt, w) end )\r\n    return rt\r\nend\r\n\r\n-- 用标签获取组件参数\r\nUtil.GetComponentWithFlag = function(obj,flag,otype)\r\n\tif obj == nil then return end\r\n\t\r\n\tlocal links = obj:GetComponents(Link)\r\n\tfor v in Slua.iter(links) do\r\n\t\tif v.flag == flag then\r\n\r\n\t\t\tif otype then\r\n\t\t\t\treturn v.target:GetComponent(otype)\r\n\t\t\tend\r\n\t\t\treturn v.target\r\n\t\tend\r\n\tend\r\n\treturn nil\r\nend\r\n\r\nUtil.FindComponentFlag = function(obj,str)\r\n\tlocal links = obj:GetComponents(Link)\r\n\tfor v in Slua.iter(links) do\r\n\t\tlocal a,b = string.find(v.flag,str)\r\n\t\tif a ~=nil and b ~=nil then\r\n\t\t\treturn string.sub(v.flag,b+1)\r\n\t\tend \r\n\tend\r\n\treturn nil\r\nend\r\n\r\nUtil.AnimatorIsPlaying = function(animator,name)\r\n\tlocal ret = false\r\n\tif name then\r\n\t\tlocal stateInfo = animator:GetCurrentAnimatorStateInfo(0);\r\n\t    if stateInfo:IsName(\"Base Layer.\".. name) and stateInfo.normalizedTime < 1 then\r\n\t\t\tret = true\r\n\t\tend\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nLDeclare(\"Util\", Util)\r\n\r\nreturn Util"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/Util.lua.meta",
    "content": "fileFormatVersion: 2\nguid: abe1c3fb2a5fd79489c65338eef894e9\ntimeCreated: 1470562129\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/i18n.lua",
    "content": "local i18n = {}\n--# main.lua\ni18n[\"1001\"] = \"初始化游戏\"\ni18n[\"1002\"] = \"初始化需要一点点时间(%d/100)\"\n\nLDeclare(\"i18n\", i18n)\nreturn i18n\n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common/i18n.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 92cbb1004d9363c4e9be2a66ae20d256\ntimeCreated: 1480475203\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Common.meta",
    "content": "fileFormatVersion: 2\nguid: 0ed788816d573da438a8f44208f496c8\nfolderAsset: yes\ntimeCreated: 1470562129\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/MsgBox.lua",
    "content": "-- 消息窗\r\nlocal MsgBox = LDeclare(\"MsgBox\", LClass(\"MsgBox\"))\r\n\r\nfunction MsgBox:Start()\r\n\r\n\tprint(\"MsgBox Start\")\r\n\r\n\r\n\tself.btn_close = self.gameObject.transform:Find(\"btn_close\"):GetComponent(Button)\r\n\tself.btn_close.onClick:AddListener(function()\r\n\t\tself.gameObject:GetComponent(Image).sprite = nil\r\n\r\n\t\tLWindowManager.GetInstance():popWindow(\"Prefabs/MsgBox.prefab\")\r\n\r\n\r\n\tend)\r\nend\r\n\r\nfunction MsgBox:OnDestroy()\r\n\r\n\tLLoadBundle.GetInstance():UnloadBundles({\r\n\t\t\"atlas-face_png.ab\",\r\n\t\t\"scenes-first_unity.ab\",\r\n\t\t\"prefabs-msgbox_prefab.ab\"})\r\nend\r\n\r\nreturn MsgBox"
  },
  {
    "path": "Assets/Game/@Lua/Game/MsgBox.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 6ef219370e84c734cacd4bdc6d2d217e\ntimeCreated: 1471161314\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Proto/masterd.bytes",
    "content": "\n\u0005\n\rmasterd.proto\u0012\tcomponent\"B\n\u000fcomponent_hello\u0012\r\n\u0005appId\u0018\u0001 \u0002(\r\u0012\u000f\n\u0007appType\u0018\u0002 \u0002(\r\u0012\u000f\n\u0007groupId\u0018\u0003 \u0002(\r\"\u0001\n\u0016component_broadcastApp\u0012\n\n\u0002id\u0018\u0001 \u0002(\r\u0012\f\n\u0004type\u0018\u0002 \u0002(\r\u0012\r\n\u0005state\u0018\u0003 \u0002(\r\u0012\u0014\n\finternaladdr\u0018\u0004 \u0002(\r\u0012\u0014\n\finternalport\u0018\u0005 \u0002(\r\u0012\u0014\n\fexternaladdr\u0018\u0006 \u0002(\r\u0012\u0014\n\fexternalport\u0018\u0007 \u0002(\r\u0012\u0011\n\tprocessid\u0018\b \u0002(\r\u0012\u000f\n\u0007groupid\u0018\t \u0002(\r\u0012\u0012\n\nexternaddr\u0018\n \u0002(\t\u0012\u0012\n\nexternport\u0018\u000b \u0002(\r\"\u0001\n\u0015component_registerApp\u0012\n\n\u0002id\u0018\u0001 \u0002(\r\u0012\f\n\u0004type\u0018\u0002 \u0002(\r\u0012\u000f\n\u0007groupid\u0018\u0003 \u0002(\r\u0012\u0014\n\finternaladdr\u0018\u0004 \u0002(\r\u0012\u0014\n\finternalport\u0018\u0005 \u0002(\r\u0012\u0014\n\fexternaladdr\u0018\u0006 \u0002(\r\u0012\u0014\n\fexternalport\u0018\u0007 \u0002(\r\u0012\u0012\n\nexternaddr\u0018\b \u0002(\t\u0012\u0012\n\nexternport\u0018\t \u0002(\r\"=\n\u0013component_updateApp\u0012\n\n\u0002id\u0018\u0001 \u0001(\r\u0012\f\n\u0004type\u0018\u0002 \u0001(\r\u0012\f\n\u0004load\u0018\u0003 \u0001(\r*f\n\u0005msgId\u0012\t\n\u0005hello\u0010\u0001\u0012\u000f\n\u000bregisterApp\u0010\u0002\u0012\u0010\n\fbroadcastApp\u0010\u0003\u0012\r\n\tupdateApp\u0010\u0004\u0012\u000e\n\twebAppCmd\u0010\u0007\u0012\u0010\n\u000badminAppCmd\u0010\u0007"
  },
  {
    "path": "Assets/Game/@Lua/Game/Proto/masterd.bytes.meta",
    "content": "fileFormatVersion: 2\nguid: 222d8d82c180a3441b9b433d7bc13b4b\ntimeCreated: 1470564399\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game/Proto.meta",
    "content": "fileFormatVersion: 2\nguid: 4f1ae7b788560ec4a8a806b06b1f2136\nfolderAsset: yes\ntimeCreated: 1470561899\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Game.meta",
    "content": "fileFormatVersion: 2\nguid: feb7d35f0122c7242a31bf2903ceb061\nfolderAsset: yes\ntimeCreated: 1470561899\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Lib/protobuf/parser.lua",
    "content": "-----------------------\r\n-- simple proto parser\r\n-----------------------\r\n\r\nlocal lpeg = require \"lpeg\"\r\nlocal P = lpeg.P\r\nlocal S = lpeg.S\r\nlocal R = lpeg.R\r\nlocal C = lpeg.C\r\nlocal Ct = lpeg.Ct\r\nlocal Cg = lpeg.Cg\r\nlocal Cc = lpeg.Cc\r\nlocal V = lpeg.V\r\n\r\nlocal next = next\r\nlocal error = error\r\nlocal tonumber = tonumber\r\nlocal pairs = pairs\r\nlocal ipairs = ipairs\r\nlocal rawset = rawset\r\nlocal tinsert = table.insert\r\nlocal smatch = string.match\r\nlocal sbyte = string.byte\r\n\r\nlocal internal_type = {\r\n\tdouble = \"TYPE_DOUBLE\",\r\n\tfloat = \"TYPE_FLOAT\",\r\n\tuint64 = \"TYPE_UINT64\",\r\n\tint = \"TYPE_INT32\",\r\n\tint32 = \"TYPE_INT32\",\r\n\tint64 = \"TYPE_INT64\",\r\n\tfixed64 = \"TYPE_FIXED64\",\r\n\tfixed32 = \"TYPE_FIXED32\",\r\n\tbool = \"TYPE_BOOL\",\r\n\tstring = \"TYPE_STRING\",\r\n\tbytes = \"TYPE_BYTES\",\r\n\tuint32 = \"TYPE_UINT32\",\r\n\tsfixed32 = \"TYPE_SFIXED32\",\r\n\tsfixed64 = \"TYPE_SFIXED64\",\r\n\tsint32 = \"TYPE_SINT32\",\r\n\tsint64 = \"TYPE_SINT64\",\r\n}\r\n\r\nlocal function count_lines(_,pos, parser_state)\r\n\tif parser_state.pos < pos then\r\n\t\tparser_state.line = parser_state.line + 1\r\n\t\tparser_state.pos = pos\r\n\tend\r\n\treturn pos\r\nend\r\n\r\nlocal exception = lpeg.Cmt( lpeg.Carg(1) , function ( _ , pos, parser_state)\r\n\terror( \"syntax error at [\" .. (parser_state.file or \"\") ..\"] (\" .. parser_state.line ..\")\" )\r\n\treturn pos\r\nend)\r\n\r\nlocal eof = P(-1)\r\nlocal newline = lpeg.Cmt((P\"\\n\" + \"\\r\\n\") * lpeg.Carg(1) ,count_lines)\r\nlocal line_comment = \"//\" * (1 - newline) ^0 * (newline + eof)\r\nlocal blank = S\" \\t\" + newline + line_comment\r\nlocal blank0 = blank ^ 0\r\nlocal blanks = blank ^ 1\r\nlocal alpha = R\"az\" + R\"AZ\" + \"_\"\r\nlocal alnum = alpha + R\"09\"\r\nlocal str_c = (1 - S(\"\\\\\\\"\")) + P(\"\\\\\") * 1\r\nlocal str = P\"\\\"\" * C(str_c^0) * \"\\\"\"\r\nlocal dotname = (\".\" * alpha * alnum ^ 0) ^ 0\r\nlocal typename = C(alpha * alnum ^ 0 * dotname)\r\nlocal name = C(alpha * alnum ^ 0)\r\nlocal filename = P\"\\\"\" * C((alnum + \"/\" + \".\" + \"-\")^1) * \"\\\"\"\r\nlocal id = R\"09\" ^ 1 / tonumber + \"max\" * Cc(-1)\r\nlocal bool = \"true\" * Cc(true) + \"false\" * Cc(false)\r\nlocal value = str + bool + name + id\r\nlocal patterns = {}\r\n\r\nlocal enum_item = Cg(name * blank0 * \"=\" * blank0 * id * blank0 * \";\" * blank0)\r\n\r\nlocal function insert(tbl, k,v)\r\n\ttinsert(tbl, { name = k , number = v })\r\n\treturn tbl\r\nend\r\n\r\npatterns.ENUM = Ct(Cg(\"enum\",\"type\") * blanks * Cg(typename,\"name\") * blank0 *\r\n\t\"{\" * blank0 *\r\n\t\tCg(lpeg.Cf(Ct\"\" * enum_item^1 , insert),\"value\")\r\n\t* \"}\" * blank0)\r\n\r\nlocal prefix_field = P\"required\" * Cc\"LABEL_REQUIRED\" +\r\n\tP\"optional\" * Cc\"LABEL_OPTIONAL\" +\r\n\tP\"repeated\" * Cc\"LABEL_REPEATED\"\r\nlocal postfix_pair = blank0 * Cg(name * blank0 * \"=\" * blank0 * value * blank0)\r\nlocal postfix_pair_2 = blank0 * \",\" * postfix_pair\r\nlocal postfix_field = \"[\" * postfix_pair * postfix_pair_2^0 * blank0 * \"]\"\r\nlocal options = lpeg.Cf(Ct\"\" * postfix_field , rawset) ^ -1\r\n\r\nlocal function setoption(t, options)\r\n\tif next(options) then\r\n\t\tt.options = options\r\n\tend\r\n\treturn t\r\nend\r\n\r\nlocal message_field = lpeg.Cf (\r\n\tCt(\tCg(prefix_field,\"label\") * blanks *\r\n\t\tCg(typename,\"type_name\") * blanks *\r\n\t\tCg(name,\"name\") * blank0 * \"=\" * blank0 *\r\n\t\tCg(id,\"number\")\r\n\t\t) * blank0 * options ,\r\n\t\tsetoption) * blank0 * \";\" * blank0\r\n\r\nlocal extensions = Ct(\r\n\tCg(\"extensions\" , \"type\") * blanks *\r\n\tCg(id,\"start\") * blanks * \"to\" * blanks *\r\n\tCg(id,\"end\") * blank0 * \";\" * blank0\r\n\t)\r\n\r\npatterns.EXTEND = Ct(\r\n\tCg(\"extend\", \"type\") * blanks *\r\n\tCg(typename, \"name\") * blank0 * \"{\" * blank0 *\r\n\tCg(Ct((message_field) ^ 1),\"extension\") * \"}\" * blank0\r\n\t)\r\n\r\npatterns.MESSAGE = P { Ct(\r\n\tCg(\"message\",\"type\") * blanks *\r\n\tCg(typename,\"name\") * blank0 * \"{\" * blank0 *\r\n\tCg(Ct((message_field + patterns.ENUM + extensions + patterns.EXTEND + V(1)) ^ 0),\"items\") * \"}\" * blank0\r\n\t) }\r\n\r\npatterns.OPTION = Ct(\r\n\tCg(\"option\" , \"type\") * blanks *\r\n\tCg(name, \"name\") * blank0 * \"=\" * blank0 *\r\n\tCg(value, \"value\")\r\n\t) * blank0 * \";\" * blank0\r\n\r\npatterns.IMPORT = Ct( Cg(\"import\" , \"type\") * blanks * Cg(filename, \"name\") ) * blank0 * \";\" * blank0\r\n\r\npatterns.PACKAGE = Ct( Cg(\"package\", \"type\") * blanks * Cg(typename, \"name\") ) * blank0 * \";\" * blank0\r\n\r\nlocal proto_tbl = { \"PROTO\" }\r\n\r\ndo\r\n\tlocal k, v = next(patterns)\r\n\tlocal p = V(k)\r\n\tproto_tbl[k] = v\r\n\tfor k,v in next , patterns , k do\r\n\t\tproto_tbl[k] = v\r\n\t\tp = p + V(k)\r\n\tend\r\n\tproto_tbl.PROTO = Ct(blank0 * p ^ 1)\r\nend\r\n\r\nlocal proto = P(proto_tbl)\r\n\r\nlocal deal = {}\r\n\r\nfunction deal:import(v)\r\n\tself.dependency = self.dependency or {}\r\n\ttinsert(self.dependency , v.name)\r\nend\r\n\r\nfunction deal:package(v)\r\n\tself.package = v.name\r\nend\r\n\r\nfunction deal:enum(v)\r\n\tself.enum_type = self.enum_type or {}\r\n\ttinsert(self.enum_type , v)\r\nend\r\n\r\nfunction deal:option(v)\r\n\tself.options = self.options or {}\r\n\tself.options[v.name] = v.value\r\nend\r\n\r\nfunction deal:extend(v)\r\n\tself.extension = self.extension or {}\r\n\tlocal extendee = v.name\r\n\tfor _,v in ipairs(v.extension) do\r\n\t\tv.extendee = extendee\r\n\t\tv.type = internal_type[v.type_name]\r\n\t\tif v.type then\r\n\t\t\tv.type_name = nil\r\n\t\tend\r\n\t\ttinsert(self.extension , v)\r\n\tend\r\nend\r\n\r\nfunction deal:extensions(v)\r\n\tself.extension_range = self.extension_range or {}\r\n\ttinsert(self.extension_range, v)\r\nend\r\n\r\nlocal function _add_nested_message(self, item)\r\n\tif item.type == nil then\r\n\t\titem.type = internal_type[item.type_name]\r\n\t\tif item.type then\r\n\t\t\titem.type_name = nil\r\n\t\tend\r\n\t\tself.field = self.field or {}\r\n\t\ttinsert(self.field, item)\r\n\telse\r\n\t\tlocal f = deal[item.type]\r\n\t\titem.type = nil\r\n\t\tf(self , item)\r\n\tend\r\nend\r\n\r\nfunction deal:message(v)\r\n\tself.nested_type = self.nested_type or {}\r\n\tlocal m = { name = v.name }\r\n\ttinsert(self.nested_type , m)\r\n\tfor _,v in ipairs(v.items) do\r\n\t\t_add_nested_message(m, v)\r\n\tend\r\nend\r\n\r\nlocal function fix(r)\r\n\tlocal p = {}\r\n\tfor _,v in ipairs(r) do\r\n\t\tlocal f = deal[v.type]\r\n\t\tv.type = nil\r\n\t\tf(p , v)\r\n\tend\r\n\r\n\tp.message_type = p.nested_type\r\n\tp.nested_type = nil\r\n\r\n\treturn p\r\nend\r\n\r\n--- fix message name\r\n\r\nlocal NULL = {}\r\n\r\nlocal function _match_name(namespace , n , all)\r\n\tif sbyte(n) == 46 then\r\n\t\treturn n\r\n\tend\r\n\r\n\trepeat\r\n\t\tlocal name = namespace .. \".\" .. n\r\n\t\tif all[name] then\r\n\t\t\treturn name\r\n\t\tend\r\n\t\tnamespace = smatch(namespace,\"(.*)%.[%w_]+$\")\r\n\tuntil namespace == nil\r\nend\r\n\r\nlocal function _fix_field(namespace , field, all)\r\n\tlocal type_name = field.type_name\r\n\tif type_name == \"\" then\r\n\t\tfield.type_name = nil\r\n\t\treturn\r\n\telseif type_name == nil then\r\n\t\treturn\r\n\tend\r\n\r\n\tlocal full_name = assert(_match_name(namespace, field.type_name, all) , field.type_name , all)\r\n\r\n\tfield.type_name = full_name\r\n\tfield.type = all[full_name]\r\n\r\n\tlocal options = field.options\r\n\tif options then\r\n\t\tif options.default then\r\n\t\t\tfield.default_value = tostring(options.default)\r\n\t\t\toptions.default = nil\r\n\t\tend\r\n\t\tif next(options) == nil then\r\n\t\t\tfield.options = nil\r\n\t\tend\r\n\tend\r\nend\r\n\r\nlocal function _fix_extension(namespace, ext, all)\r\n\tfor _,field in ipairs(ext or NULL) do\r\n\t\tfield.extendee = assert(_match_name(namespace, field.extendee,all),field.extendee)\r\n\t\t_fix_field(namespace , field , all)\r\n\tend\r\nend\r\n\r\nlocal function _fix_message(msg , all)\r\n\tfor _,field in ipairs(msg.field or NULL) do\r\n\t\t_fix_field(assert(all[msg],msg.name) , field , all)\r\n\tend\r\n\tfor _,nest in ipairs(msg.nested_type or NULL) do\r\n\t\t_fix_message(nest , all)\r\n\tend\r\n\t_fix_extension(all[msg] , msg.extension , all)\r\nend\r\n\r\nlocal function _fix_typename(file , all)\r\n\tfor _,message in ipairs(file.message_type or NULL) do\r\n\t\t_fix_message(message , all)\r\n\tend\r\n\t_fix_extension(file.package , file.extension , all)\r\nend\r\n\r\n--- merge messages\r\n\r\nlocal function _enum_fullname(prefix, enum , all)\r\n\tlocal fullname\r\n\tif sbyte(enum.name) == 46 then\r\n\t\tfullname = enum.name\r\n\telse\r\n\t\tfullname = prefix .. \".\" .. enum.name\r\n\tend\r\n\tall[fullname] = \"TYPE_ENUM\"\r\n\tall[enum] = fullname\r\nend\r\n\r\nlocal function _message_fullname(prefix , msg , all)\r\n\tlocal fullname\r\n\tif sbyte(msg.name) == 46 then\r\n\t\tfullname = msg.name\r\n\telse\r\n\t\tfullname = prefix .. \".\" .. msg.name\r\n\tend\r\n\tall[fullname] = \"TYPE_MESSAGE\"\r\n\tall[msg] = fullname\r\n\tfor _,nest in ipairs(msg.nested_type or NULL) do\r\n\t\t_message_fullname(fullname , nest , all)\r\n\tend\r\n\tfor _,enum in ipairs(msg.enum_type or NULL) do\r\n\t\t_enum_fullname(fullname , enum , all)\r\n\tend\r\nend\r\n\r\nlocal function _gen_fullname(file , all)\r\n\tlocal prefix = \"\"\r\n\tif file.package then\r\n\t\tprefix = \".\" .. file.package\r\n\tend\r\n\tfor _,message in ipairs(file.message_type or NULL) do\r\n\t\t_message_fullname(prefix , message , all)\r\n\tend\r\n\tfor _,enum in ipairs(file.enum_type or NULL) do\r\n\t\t_enum_fullname(prefix , enum , all)\r\n\tend\r\nend\r\n\r\n--- parser\r\n\r\nlocal parser = {}\r\n\r\nlocal function parser_one(text,filename)\r\n\tlocal state = { file = filename, pos = 0, line = 1 }\r\n\tlocal r = lpeg.match(proto * -1 + exception , text , 1, state )\r\n\tlocal t = fix(r)\r\n\treturn t\r\nend\r\n\r\nfunction parser.parser(text,filename)\r\n\tlocal t = parser_one(text,filename)\r\n\tlocal all = {}\r\n\t_gen_fullname(t,all)\r\n\t_fix_typename(t , all)\r\n\treturn t\r\nend\r\n\r\nlocal pb = require \"protobuf\"\r\n\r\nfunction parser.register(fileset , path)\r\n\tlocal all = {}\r\n\tlocal files = {}\r\n\tif type(fileset) == \"string\" then\r\n\t\tfileset = { fileset }\r\n\tend\r\n\tfor _, filename in ipairs(fileset) do\r\n\t\tlocal fullname\r\n\t\tif path then\r\n\t\t\tfullname = path .. \"/\" .. filename\r\n\t\telse\r\n\t\t\tfullname = filename\r\n\t\tend\r\n\t\tlocal f = assert(io.open(fullname , \"r\"))\r\n\t\tlocal buffer = f:read \"*a\"\r\n\t\tf:close()\r\n\t\tlocal t = parser_one(buffer,filename)\r\n\t\t_gen_fullname(t,all)\r\n\t\tt.name = filename\r\n\t\ttinsert(files , t)\r\n\tend\r\n\tfor _,file in ipairs(files) do\r\n\t\t_fix_typename(file,all)\r\n\tend\r\n\r\n\tlocal pbencode = pb.encode(\"google.protobuf.FileDescriptorSet\" , { file = files })\r\n\r\n\tif pbencode == nil then\r\n\t\terror(pb.lasterror())\r\n\tend\r\n\tpb.register(pbencode)\r\n\treturn files\r\nend\r\n\r\nreturn parser"
  },
  {
    "path": "Assets/Game/@Lua/Lib/protobuf/parser.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 6cd0b0e903f425e47800ac1108158e4e\ntimeCreated: 1467076000\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Lib/protobuf/protobuf.lua",
    "content": "local c = require \"protobuf.c\"\r\n\r\nlocal setmetatable = setmetatable\r\nlocal type = type\r\nlocal table = table\r\nlocal assert = assert\r\nlocal pairs = pairs\r\nlocal ipairs = ipairs\r\nlocal string = string\r\nlocal print = print\r\nlocal io = io\r\nlocal tinsert = table.insert\r\nlocal rawget = rawget\r\n\r\nmodule \"protobuf\"\r\n\r\nlocal _pattern_cache = {}\r\n\r\n-- skynet clear\r\nlocal P = c._env_new()\r\nlocal GC = c._gc(P)\r\n\r\nfunction lasterror()\r\n\treturn c._last_error(P)\r\nend\r\n\r\nlocal decode_type_cache = {}\r\nlocal _R_meta = {}\r\n\r\nfunction _R_meta:__index(key)\r\n\tlocal v = decode_type_cache[self._CType][key](self, key)\r\n\tself[key] = v\r\n\treturn v\r\nend\r\n\r\nlocal _reader = {}\r\n\r\nfunction _reader:int(key)\r\n\treturn c._rmessage_integer(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:real(key)\r\n\treturn c._rmessage_real(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:string(key)\r\n\treturn c._rmessage_string(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:bool(key)\r\n\treturn c._rmessage_integer(self._CObj , key , 0) ~= 0\r\nend\r\n\r\nfunction _reader:message(key, message_type)\r\n\tlocal rmessage = c._rmessage_message(self._CObj , key , 0)\r\n\tif rmessage then\r\n\t\tlocal v = {\r\n\t\t\t_CObj = rmessage,\r\n\t\t\t_CType = message_type,\r\n\t\t\t_Parent = self,\r\n\t\t}\r\n\t\treturn setmetatable( v , _R_meta )\r\n\tend\r\nend\r\n\r\nfunction _reader:int32(key)\r\n\treturn c._rmessage_int32(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:int64(key)\r\n\treturn c._rmessage_int64(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:int52(key)\r\n\treturn c._rmessage_int52(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:uint52(key)\r\n\treturn c._rmessage_uint52(self._CObj , key , 0)\r\nend\r\n\r\nfunction _reader:int_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_integer(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:real_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_real(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:string_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_string(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:bool_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_integer(cobj , key , i) ~= 0)\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:message_repeated(key, message_type)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\tlocal m = {\r\n\t\t\t_CObj = c._rmessage_message(cobj , key , i),\r\n\t\t\t_CType = message_type,\r\n\t\t\t_Parent = self,\r\n\t\t}\r\n\t\ttinsert(ret, setmetatable( m , _R_meta ))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:int32_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_int32(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:int64_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_int64(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:int52_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_int52(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\nfunction _reader:uint52_repeated(key)\r\n\tlocal cobj = self._CObj\r\n\tlocal n = c._rmessage_size(cobj , key)\r\n\tlocal ret = {}\r\n\tfor i=0,n-1 do\r\n\t\ttinsert(ret,  c._rmessage_uint52(cobj , key , i))\r\n\tend\r\n\treturn ret\r\nend\r\n\r\n_reader[1] = function(msg) return _reader.int end\r\n_reader[2] = function(msg) return _reader.real end\r\n_reader[3] = function(msg) return _reader.bool end\r\n_reader[4] = function(msg) return _reader.string end\r\n_reader[5] = function(msg) return _reader.string end\r\n_reader[6] = function(msg)\r\n\tlocal message = _reader.message\r\n\treturn\tfunction(self,key)\r\n\t\t\treturn message(self, key, msg)\r\n\t\tend\r\nend\r\n_reader[7] = function(msg) return _reader.int64 end\r\n_reader[8] = function(msg) return _reader.int32 end\r\n_reader[9] = _reader[5]\r\n_reader[10] = function(msg) return _reader.int52 end\r\n_reader[11] = function(msg) return _reader.uint52 end\r\n\r\n_reader[128+1] = function(msg) return _reader.int_repeated end\r\n_reader[128+2] = function(msg) return _reader.real_repeated end\r\n_reader[128+3] = function(msg) return _reader.bool_repeated end\r\n_reader[128+4] = function(msg) return _reader.string_repeated end\r\n_reader[128+5] = function(msg) return _reader.string_repeated end\r\n_reader[128+6] = function(msg)\r\n\tlocal message = _reader.message_repeated\r\n\treturn\tfunction(self,key)\r\n\t\t\treturn message(self, key, msg)\r\n\t\tend\r\nend\r\n_reader[128+7] = function(msg) return _reader.int64_repeated end\r\n_reader[128+8] = function(msg) return _reader.int32_repeated end\r\n_reader[128+9] = _reader[128+5]\r\n_reader[128+10] = function(msg) return _reader.int52_repeated end\r\n_reader[128+11] = function(msg) return _reader.uint52_repeated end\r\n\r\nlocal _decode_type_meta = {}\r\n\r\nfunction _decode_type_meta:__index(key)\r\n\tlocal t, msg = c._env_type(P, self._CType, key)\r\n\tlocal func = assert(_reader[t],key)(msg)\r\n\tself[key] = func\r\n\treturn func\r\nend\r\n\r\nsetmetatable(decode_type_cache , {\r\n\t__index = function(self, key)\r\n\t\tlocal v = setmetatable({ _CType = key } , _decode_type_meta)\r\n\t\tself[key] = v\r\n\t\treturn v\r\n\tend\r\n})\r\n\r\nlocal function decode_message( message , buffer, length)\r\n\tlocal rmessage = c._rmessage_new(P, message, buffer, length)\r\n\tif rmessage then\r\n\t\tlocal self = {\r\n\t\t\t_CObj = rmessage,\r\n\t\t\t_CType = message,\r\n\t\t}\r\n\t\tc._add_rmessage(GC,rmessage)\r\n\t\treturn setmetatable( self , _R_meta )\r\n\tend\r\nend\r\n\r\n----------- encode ----------------\r\n\r\nlocal encode_type_cache = {}\r\n\r\nlocal function encode_message(CObj, message_type, t)\r\n\tlocal type = encode_type_cache[message_type]\r\n\tfor k,v in pairs(t) do\r\n\t\tlocal func = type[k]\r\n\t\tfunc(CObj, k , v)\r\n\tend\r\nend\r\n\r\nlocal _writer = {\r\n\tint = c._wmessage_integer,\r\n\treal = c._wmessage_real,\r\n\tenum = c._wmessage_string,\r\n\tstring = c._wmessage_string,\r\n\tint64 = c._wmessage_int64,\r\n\tint32 = c._wmessage_int32,\r\n\tint52 = c._wmessage_int52,\r\n\tuint52 = c._wmessage_uint52,\r\n}\r\n\r\nfunction _writer:bool(k,v)\r\n\tc._wmessage_integer(self, k, v and 1 or 0)\r\nend\r\n\r\nfunction _writer:message(k, v , message_type)\r\n\tlocal submessage = c._wmessage_message(self, k)\r\n\tencode_message(submessage, message_type, v)\r\nend\r\n\r\nfunction _writer:int_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_integer(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:real_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_real(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:bool_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_integer(self, k, v and 1 or 0)\r\n\tend\r\nend\r\n\r\nfunction _writer:string_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_string(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:message_repeated(k,v, message_type)\r\n\tfor _,v in ipairs(v) do\r\n\t\tlocal submessage = c._wmessage_message(self, k)\r\n\t\tencode_message(submessage, message_type, v)\r\n\tend\r\nend\r\n\r\nfunction _writer:int32_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_int32(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:int64_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_int64(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:int52_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_int52(self,k,v)\r\n\tend\r\nend\r\n\r\nfunction _writer:uint52_repeated(k,v)\r\n\tfor _,v in ipairs(v) do\r\n\t\tc._wmessage_uint52(self,k,v)\r\n\tend\r\nend\r\n\r\n_writer[1] = function(msg) return _writer.int end\r\n_writer[2] = function(msg) return _writer.real end\r\n_writer[3] = function(msg) return _writer.bool end\r\n_writer[4] = function(msg) return _writer.string end\r\n_writer[5] = function(msg) return _writer.string end\r\n_writer[6] = function(msg)\r\n\tlocal message = _writer.message\r\n\treturn\tfunction(self,key , v)\r\n\t\t\treturn message(self, key, v, msg)\r\n\t\tend\r\nend\r\n_writer[7] = function(msg) return _writer.int64 end\r\n_writer[8] = function(msg) return _writer.int32 end\r\n_writer[9] = _writer[5]\r\n_writer[10] = function(msg) return _writer.int52 end\r\n_writer[11] = function(msg) return _writer.uint52 end\r\n\r\n_writer[128+1] = function(msg) return _writer.int_repeated end\r\n_writer[128+2] = function(msg) return _writer.real_repeated end\r\n_writer[128+3] = function(msg) return _writer.bool_repeated end\r\n_writer[128+4] = function(msg) return _writer.string_repeated end\r\n_writer[128+5] = function(msg) return _writer.string_repeated end\r\n_writer[128+6] = function(msg)\r\n\tlocal message = _writer.message_repeated\r\n\treturn\tfunction(self,key, v)\r\n\t\t\treturn message(self, key, v, msg)\r\n\t\tend\r\nend\r\n_writer[128+7] = function(msg) return _writer.int64_repeated end\r\n_writer[128+8] = function(msg) return _writer.int32_repeated end\r\n_writer[128+9] = _writer[128+5]\r\n_writer[128+10] = function(msg) return _writer.int52_repeated end\r\n_writer[128+11] = function(msg) return _writer.uint52_repeated end\r\n\r\nlocal _encode_type_meta = {}\r\n\r\nfunction _encode_type_meta:__index(key)\r\n\tlocal t, msg = c._env_type(P, self._CType, key)\r\n\tlocal func = assert(_writer[t],key)(msg)\r\n\tself[key] = func\r\n\treturn func\r\nend\r\n\r\nsetmetatable(encode_type_cache , {\r\n\t__index = function(self, key)\r\n\t\tlocal v = setmetatable({ _CType = key } , _encode_type_meta)\r\n\t\tself[key] = v\r\n\t\treturn v\r\n\tend\r\n})\r\n\r\nfunction encode( message, t , func , ...)\r\n\tlocal encoder = c._wmessage_new(P, message)\r\n\tassert(encoder ,  message)\r\n\tencode_message(encoder, message, t)\r\n\tif func then\r\n\t\tlocal buffer, len = c._wmessage_buffer(encoder)\r\n\t\tlocal ret = func(buffer, len, ...)\r\n\t\tc._wmessage_delete(encoder)\r\n\t\treturn ret\r\n\telse\r\n\t\tlocal s = c._wmessage_buffer_string(encoder)\r\n\t\tc._wmessage_delete(encoder)\r\n\t\treturn s\r\n\tend\r\nend\r\n\r\n--------- unpack ----------\r\n\r\nlocal _pattern_type = {\r\n\t[1] = {\"%d\",\"i\"},\r\n\t[2] = {\"%F\",\"r\"},\r\n\t[3] = {\"%d\",\"b\"},\r\n\t[4] = {\"%d\",\"i\"},\r\n\t[5] = {\"%s\",\"s\"},\r\n\t[6] = {\"%s\",\"m\"},\r\n\t[7] = {\"%D\",\"x\"},\r\n\t[8] = {\"%d\",\"p\"},\r\n\t[10] =  {\"%D\",\"d\"},\r\n\t[11] =  {\"%D\",\"u\"},\r\n\t[128+1] = {\"%a\",\"I\"},\r\n\t[128+2] = {\"%a\",\"R\"},\r\n\t[128+3] = {\"%a\",\"B\"},\r\n\t[128+4] = {\"%a\",\"I\"},\r\n\t[128+5] = {\"%a\",\"S\"},\r\n\t[128+6] = {\"%a\",\"M\"},\r\n\t[128+7] = {\"%a\",\"X\"},\r\n\t[128+8] = {\"%a\",\"P\"},\r\n\t[128+10] = {\"%a\", \"D\" },\r\n\t[128+11] = {\"%a\", \"U\" },\r\n}\r\n\r\n_pattern_type[9] = _pattern_type[5]\r\n_pattern_type[128+9] = _pattern_type[128+5]\r\n\r\n\r\nlocal function _pattern_create(pattern)\r\n\tlocal iter = string.gmatch(pattern,\"[^ ]+\")\r\n\tlocal message = iter()\r\n\tlocal cpat = {}\r\n\tlocal lua = {}\r\n\tfor v in iter do\r\n\t\tlocal tidx = c._env_type(P, message, v)\r\n\t\tlocal t = _pattern_type[tidx]\r\n\t\tassert(t,tidx)\r\n\t\ttinsert(cpat,v .. \" \" .. t[1])\r\n\t\ttinsert(lua,t[2])\r\n\tend\r\n\tlocal cobj = c._pattern_new(P, message , \"@\" .. table.concat(cpat,\" \"))\r\n\tif cobj == nil then\r\n\t\treturn\r\n\tend\r\n\tc._add_pattern(GC, cobj)\r\n\tlocal pat = {\r\n\t\tCObj = cobj,\r\n\t\tformat = table.concat(lua),\r\n\t\tsize = 0\r\n\t}\r\n\tpat.size = c._pattern_size(pat.format)\r\n\r\n\treturn pat\r\nend\r\n\r\nsetmetatable(_pattern_cache, {\r\n\t__index = function(t, key)\r\n\t\tlocal v = _pattern_create(key)\r\n\t\tt[key] = v\r\n\t\treturn v\r\n\tend\r\n})\r\n\r\nfunction unpack(pattern, buffer, length)\r\n\tlocal pat = _pattern_cache[pattern]\r\n\treturn c._pattern_unpack(pat.CObj , pat.format, pat.size, buffer, length)\r\nend\r\n\r\nfunction pack(pattern, ...)\r\n\tlocal pat = _pattern_cache[pattern]\r\n\treturn c._pattern_pack(pat.CObj, pat.format, pat.size , ...)\r\nend\r\n\r\nfunction check(typename , field)\r\n\tif field == nil then\r\n\t\treturn c._env_type(P,typename)\r\n\telse\r\n\t\treturn c._env_type(P,typename,field) ~=0\r\n\tend\r\nend\r\n\r\n--------------\r\n\r\nlocal default_cache = {}\r\n\r\n-- todo : clear default_cache, v._CObj\r\n\r\nlocal function default_table(typename)\r\n\tlocal v = default_cache[typename]\r\n\tif v then\r\n\t\treturn v\r\n\tend\r\n\r\n\tv = { __index = assert(decode_message(typename , \"\")) }\r\n\r\n\tdefault_cache[typename]  = v\r\n\treturn v\r\nend\r\n\r\nlocal decode_message_mt = {}\r\n\r\nlocal function decode_message_cb(typename, buffer)\r\n\treturn setmetatable ( { typename, buffer } , decode_message_mt)\r\nend\r\n\r\nfunction decode(typename, buffer, length)\r\n\tlocal ret = {}\r\n\tlocal ok = c._decode(P, decode_message_cb , ret , typename, buffer, length)\r\n\tif ok then\r\n\t\treturn setmetatable(ret , default_table(typename))\r\n\telse\r\n\t\treturn false , c._last_error(P)\r\n\tend\r\nend\r\n\r\nlocal function expand(tbl)\r\n\tlocal typename = rawget(tbl , 1)\r\n\tlocal buffer = rawget(tbl , 2)\r\n\ttbl[1] , tbl[2] = nil , nil\r\n\tassert(c._decode(P, decode_message_cb , tbl , typename, buffer), typename)\r\n\tsetmetatable(tbl , default_table(typename))\r\nend\r\n\r\nfunction decode_message_mt.__index(tbl, key)\r\n\texpand(tbl)\r\n\treturn tbl[key]\r\nend\r\n\r\nfunction decode_message_mt.__pairs(tbl)\r\n\texpand(tbl)\r\n\treturn pairs(tbl)\r\nend\r\n\r\nlocal function set_default(typename, tbl)\r\n\tfor k,v in pairs(tbl) do\r\n\t\tif type(v) == \"table\" then\r\n\t\t\tlocal t, msg = c._env_type(P, typename, k)\r\n\t\t\tif t == 6 then\r\n\t\t\t\tset_default(msg, v)\r\n\t\t\telseif t == 128+6 then\r\n\t\t\t\tfor _,v in ipairs(v) do\r\n\t\t\t\t\tset_default(msg, v)\r\n\t\t\t\tend\r\n\t\t\tend\r\n\t\tend\r\n\tend\r\n\treturn setmetatable(tbl , default_table(typename))\r\nend\r\n\r\nfunction register( buffer)\r\n\tc._env_register(P, buffer)\r\nend\r\n\r\nfunction register_file(filename)\r\n\tlocal f = assert(io.open(filename , \"rb\"))\r\n\tlocal buffer = f:read \"*a\"\r\n\tc._env_register(P, buffer)\r\n\tf:close()\r\nend\r\n\r\nfunction enum_id(enum_type, enum_name)\r\n\treturn c._env_enum_id(P, enum_type, enum_name)\r\nend\r\n\r\nfunction extract(tbl)\r\n    local typename = rawget(tbl , 1)\r\n    local buffer = rawget(tbl , 2)\r\n    if type(typename) == \"string\" and type(buffer) == \"string\" then\r\n        if check(typename) then\r\n            expand(tbl)\r\n        end\r\n    end\r\n\r\n    for k, v in pairs(tbl) do\r\n        if type(v) == \"table\" then\r\n            extract(v)\r\n        end\r\n    end\r\nend\r\n\r\ndefault=set_default\r\n"
  },
  {
    "path": "Assets/Game/@Lua/Lib/protobuf/protobuf.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 17335bd7728baf44eb90e5b885018eb6\ntimeCreated: 1467076000\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Lib/protobuf.meta",
    "content": "fileFormatVersion: 2\nguid: 7b27e103ca4e7a94db4809d5490bdfbb\nfolderAsset: yes\ntimeCreated: 1467076000\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/Lib.meta",
    "content": "fileFormatVersion: 2\nguid: 7837997a641ac9e42afe5dc7bb600f7c\nfolderAsset: yes\ntimeCreated: 1470561898\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/import.lua",
    "content": "require \"Base/LGlobal\"\nrequire \"Base/LVersion\"\nrequire \"Base/LClass\"\nrequire \"Base/LMessage\"\n\nrequire \"Game/Common/i18n\"\nrequire \"Game/Common/Util\"\nrequire \"Game/Common/MsgId\"\nrequire \"Game/Common/EventNames\"\nrequire \"Game/Common/NetworkManager\"\n\nrequire \"Game/MsgBox\""
  },
  {
    "path": "Assets/Game/@Lua/import.lua.meta",
    "content": "fileFormatVersion: 2\nguid: 77ef4bedebd064ab598b56673ae4559f\ntimeCreated: 1463891082\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua/main.lua",
    "content": "import \"UnityEngine\"\nimport \"UnityEngine.Object\"\nimport \"UnityEngine.UI\"\nimport \"UnityEngine.SceneManagement\"\nimport \"Lui\"\nrequire \"import\"\n\nlocal function main() \n\tprint(i18n[\"1001\"])\n\n\t-- NetworkManager:GetInstance()\n\n\tLLoadBundle.GetInstance():LoadAllBundles({\n\t\t\"scenes-first_unity.ab\",\n\t\t\"scenes-second_unity.ab\",\n\t\t\"atlas-num_png.ab\",\n\t\t\"atlas-face_png.ab\",\n\t\t\"atlas-common_png.ab\",\n\t\t\"prefabs-msgbox_prefab.ab\",\n\t\t\"prefabs-windowgridview_prefab.ab\",\n\t\t\"prefabs-list_cell_prefab.ab\",\n\t\t\"prefabs-grid_cell_prefab.ab\",\n\t\t\"prefabs-page_cell_prefab.ab\"\n\t},function()\n\n\t\tlocal lab_progress = GameObject.Find(\"lab_progress\"):GetComponent(Text)\n\n\t\tLWindowManager:GetInstance():LoadSceneAsync(\"first\",function( p )\n\t\t\tlab_progress.text = string.format(i18n[\"1002\"],p)\n\t\tend)\n\n\tend,nil)\n\nend\n\n-- Declare global function.\nLDeclare(\"main\", main)\n\nreturn main\n"
  },
  {
    "path": "Assets/Game/@Lua/main.lua.meta",
    "content": "fileFormatVersion: 2\nguid: d6e78b7e14bb27f4f9a3f16365b75394\ntimeCreated: 1474776353\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/@Lua.meta",
    "content": "fileFormatVersion: 2\nguid: c08388a38d2a3d14db7bc4768cc0c13f\nfolderAsset: yes\ntimeCreated: 1455897199\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/AssetBundleMaker/ExportAssetBundles.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEditor;\r\nusing UnityEngine.Events;\r\nusing System.IO;\r\nusing System.Text;\r\nusing System.Collections.Generic;\r\n\r\npublic class ExportAssetBundles : Editor\r\n{\r\n    public static void Run()\r\n    {\r\n        MakeDebugFile.CopyLuaTxt();\r\n        CreateAssetBundles();\r\n        // CreateZipFile();\r\n        CreateVersionFile();\r\n        AssetDatabase.Refresh();\r\n    }\r\n\r\n    public static void CreateAssetBundles()\r\n    {\r\n\r\n        Helper.forEachHandle(Application.dataPath + \"/StreamingAssets\", new List<string> { \"ab\", \"manifest\" }, (string filename) =>\r\n        {\r\n            string assetPath = filename.Replace(Application.dataPath, \"Assets\");\r\n            AssetDatabase.DeleteAsset(assetPath);\r\n        });\r\n\r\n        string[] paths = new string[] { \"Audios\", \"Prefabs\", \"Atlas\", \"@Lua\", \"Scenes\" };\r\n        List<AssetBundleBuild> buildMap = new List<AssetBundleBuild>();\r\n\r\n        foreach (string path in paths)\r\n        {\r\n\r\n            string basePath = Application.dataPath + \"/Game/Resources/\" + path;\r\n\r\n            if (path.StartsWith(\"@\"))\r\n            {\r\n\r\n                List<string> list = new List<string>();\r\n                Helper.forEachHandle(basePath, null, (string filename) => {\r\n                    string assetPath = filename.Replace(Application.dataPath, \"Assets\");\r\n                    list.Add(assetPath);\r\n                });\r\n                AssetBundleBuild build = new AssetBundleBuild();\r\n                build.assetBundleName = path + \".ab\";\r\n                build.assetNames = list.ToArray();\r\n                buildMap.Add(build);\r\n\r\n            }\r\n            else {\r\n\r\n                Helper.forEachHandle(basePath, null, (string filename) => {\r\n                    string assetPath = filename.Replace(Application.dataPath, \"Assets\");\r\n                    string baseName = assetPath.Substring(22);\r\n                    AssetBundleBuild build = new AssetBundleBuild();\r\n                    build.assetBundleName = baseName.Replace('.', '_').Replace(Path.DirectorySeparatorChar, '-') + \".ab\";\r\n                    build.assetNames = new string[] { assetPath };\r\n                    buildMap.Add(build);\r\n                });\r\n            }\r\n        }\r\n        BuildPipeline.BuildAssetBundles(Application.streamingAssetsPath, buildMap.ToArray(),\r\n            BuildAssetBundleOptions.DeterministicAssetBundle |\r\n            BuildAssetBundleOptions.DisableWriteTypeTree |\r\n            BuildAssetBundleOptions.ChunkBasedCompression, ExportConfigWindow.BUILD_TARGET);\r\n        //删除临时lua文件\r\n        AssetDatabase.DeleteAsset(\"Assets/Game/Resources/@Lua\");\r\n    }\r\n\r\n    static void CreateVersionFile()\r\n    {\r\n        string resPath = ExportConfigWindow.EXPORT_OUT_PATH + Path.DirectorySeparatorChar;\r\n        StringBuilder versions = new StringBuilder();\r\n\r\n        // string zipPath = resPath + LGameConfig.UPDATE_FILE_ZIP;\r\n        // if (!File.Exists(zipPath))\r\n        // {\r\n        //     Debug.LogWarning(\"热更zip包不存在\");\r\n        //     return;\r\n        // }\r\n\r\n        Helper.forEachHandle(Application.dataPath + \"/StreamingAssets\", new List<string> { \"ab\" }, (string filename) =>\r\n        {\r\n            string baseName = Path.GetFileName(filename);\r\n            string md5 = ExportAssetBundles.MD5File(filename);\r\n            versions.Append(baseName).Append(\",\").Append(md5).Append(\"\\n\");\r\n        });\r\n\r\n        // string md5 = ExportAssetBundles.MD5File(zipPath);\r\n        // versions.Append(LGameConfig.UPDATE_FILE_ZIP).Append(\",\").Append(md5);\r\n\r\n        // 生成配置文件  \r\n        FileStream stream = new FileStream(resPath + \"version.ver\", FileMode.Create);\r\n        byte[] data = Encoding.UTF8.GetBytes(versions.ToString());\r\n        stream.Write(data, 0, data.Length);\r\n        stream.Flush();\r\n        stream.Close();\r\n\r\n        Debug.Log(\" 版本文件： \" + resPath + \"version.ver\");\r\n    }\r\n\r\n    // static void CreateZipFile()\r\n    // {\r\n    //     string srcPath = Application.streamingAssetsPath;\r\n    //     string outPath = ExportConfigWindow.EXPORT_OUT_PATH + Path.DirectorySeparatorChar;\r\n\r\n    //     Helper.forEachHandle(srcPath, new List<string>() { \"meta\" }, (string filename) =>\r\n    //     {\r\n    //         File.Delete(@filename);\r\n    //     });\r\n\r\n    //     if (!Directory.Exists(srcPath))\r\n    //     {\r\n    //         Directory.CreateDirectory(srcPath);\r\n    //     }\r\n    //     LUtil.PackFiles(outPath + LGameConfig.UPDATE_FILE_ZIP, srcPath);\r\n\r\n    //     Debug.Log(\" 热更zip包： \" + outPath + LGameConfig.UPDATE_FILE_ZIP);\r\n    // }\r\n\r\n    public static string MD5File(string file)\r\n    {\r\n        try\r\n        {\r\n            FileStream fs = new FileStream(file, FileMode.Open);\r\n            System.Security.Cryptography.MD5 md5 = new System.Security.Cryptography.MD5CryptoServiceProvider();\r\n            byte[] retVal = md5.ComputeHash(fs);\r\n            fs.Close();\r\n            StringBuilder sb = new StringBuilder();\r\n            for (int i = 0; i < retVal.Length; i++)\r\n            {\r\n                sb.Append(retVal[i].ToString(\"x2\"));\r\n            }\r\n            return sb.ToString();\r\n        }\r\n        catch (System.Exception ex)\r\n        {\r\n            throw new System.Exception(\"md5file() fail, error:\" + ex.Message);\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Editor/AssetBundleMaker/ExportAssetBundles.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 80073506afe2099489208d71e7a56249\ntimeCreated: 1470452693\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/AssetBundleMaker/ExportConfigWindow.cs",
    "content": "﻿using UnityEngine;\nusing UnityEditor;\nusing System.Collections;\n\npublic class ExportConfigWindow : EditorWindow\n{\n\tpublic static string EXPORT_OUT_PATH = Application.dataPath;\n    public static BuildTarget BUILD_TARGET = BuildTarget.StandaloneWindows;\n\n    [MenuItem(\"Tools/HotFix Config\")]\n    static void Init()\n    {\n#if UNITY_STANDALONE_WIN\n        BUILD_TARGET = BuildTarget.StandaloneWindows;\n#elif UNITY_ANDROID\n        BUILD_TARGET = BuildTarget.Android;\n#elif UNITY_ANDROID\n\t\tBUILD_TARGET = BuildTarget.iPhone;\n#elif UNITY_STANDALONE_OSX\n\t\tBUILD_TARGET = BuildTarget.StandaloneOSXUniversal;\n#endif\n        // Get existing open window or if none, make a new one:\n        ExportConfigWindow window = (ExportConfigWindow)EditorWindow.GetWindow(typeof(ExportConfigWindow), true, \"Hotfix\");\n        window.Show();\n    }\n\n    void OnGUI()\n    {\n        GUILayout.Label(\"build target\", EditorStyles.boldLabel);\n        BUILD_TARGET = (BuildTarget)EditorGUILayout.EnumPopup(\"Target\", BUILD_TARGET);\n\n        if (GUILayout.Button(\"run\"))\n        {\n            EditorApplication.delayCall += ExportAssetBundles.Run;\n        }\n    }\n\n}\n"
  },
  {
    "path": "Assets/Game/Editor/AssetBundleMaker/ExportConfigWindow.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c2b5ca7dbd1c50444862028209d360b4\ntimeCreated: 1470452693\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/AssetBundleMaker.meta",
    "content": "fileFormatVersion: 2\nguid: 6ed52869528c7934aaebf7de26dd0e77\nfolderAsset: yes\ntimeCreated: 1470552333\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMFont.cs",
    "content": "//----------------------------------------------\n//            NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\nusing System.Collections.Generic;\n\n/// <summary>\n/// BMFont reader. C# implementation of http://www.angelcode.com/products/bmfont/\n/// </summary>\n\n[System.Serializable]\npublic class BMFont\n{\n\t[HideInInspector][SerializeField] int mSize = 16;\t\t\t// How much to move the cursor when moving to the next line\n\t[HideInInspector][SerializeField] int mBase = 0;\t\t\t// Offset from the top of the line to the base of each character\n\t[HideInInspector][SerializeField] int mWidth = 0;\t\t\t// Original width of the texture\n\t[HideInInspector][SerializeField] int mHeight = 0;\t\t\t// Original height of the texture\n\t[HideInInspector][SerializeField] string mSpriteName;\n\n\t// List of serialized glyphs\n\t[HideInInspector][SerializeField] List<BMGlyph> mSaved = new List<BMGlyph>();\n\n\t// Actual glyphs that we'll be working with are stored in a dictionary, making the lookup faster\n\tDictionary<int, BMGlyph> mDict = new Dictionary<int, BMGlyph>();\n\n\t/// <summary>\n\t/// Whether the font can be used.\n\t/// </summary>\n\n\tpublic bool isValid { get { return (mSaved.Count > 0); } }\n\n\t/// <summary>\n\t/// Size of this font (for example 32 means 32 pixels).\n\t/// </summary>\n\n\tpublic int charSize { get { return mSize; } set { mSize = value; } }\n\n\t/// <summary>\n\t/// Base offset applied to characters.\n\t/// </summary>\n\n\tpublic int baseOffset { get { return mBase; } set { mBase = value; } }\n\n\t/// <summary>\n\t/// Original width of the texture.\n\t/// </summary>\n\n\tpublic int texWidth { get { return mWidth; } set { mWidth = value; } }\n\n\t/// <summary>\n\t/// Original height of the texture.\n\t/// </summary>\n\n\tpublic int texHeight { get { return mHeight; } set { mHeight = value; } }\n\n\t/// <summary>\n\t/// Number of valid glyphs.\n\t/// </summary>\n\n\tpublic int glyphCount { get { return isValid ? mSaved.Count : 0; } }\n\n\t/// <summary>\n\t/// Original name of the sprite that the font is expecting to find (usually the name of the texture).\n\t/// </summary>\n\n\tpublic string spriteName { get { return mSpriteName; } set { mSpriteName = value; } }\n\n\t/// <summary>\n\t/// Access to BMFont's entire set of glyphs.\n\t/// </summary>\n\n\tpublic List<BMGlyph> glyphs { get { return mSaved; } }\n\n\t/// <summary>\n\t/// Helper function that retrieves the specified glyph, creating it if necessary.\n\t/// </summary>\n\n\tpublic BMGlyph GetGlyph (int index, bool createIfMissing)\n\t{\n\t\t// Get the requested glyph\n\t\tBMGlyph glyph = null;\n\n\t\tif (mDict.Count == 0)\n\t\t{\n\t\t\t// Populate the dictionary for faster access\n\t\t\tfor (int i = 0, imax = mSaved.Count; i < imax; ++i)\n\t\t\t{\n\t\t\t\tBMGlyph bmg = mSaved[i];\n\t\t\t\tmDict.Add(bmg.index, bmg);\n\t\t\t}\n\t\t}\n\n\t\t// Saved check is here so that the function call is not needed if it's true\n\t\tif (!mDict.TryGetValue(index, out glyph) && createIfMissing)\n\t\t{\n\t\t\tglyph = new BMGlyph();\n\t\t\tglyph.index = index;\n\t\t\tmSaved.Add(glyph);\n\t\t\tmDict.Add(index, glyph);\n\t\t}\n\t\treturn glyph;\n\t}\n\n\t/// <summary>\n\t/// Retrieve the specified glyph, if it's present.\n\t/// </summary>\n\n\tpublic BMGlyph GetGlyph (int index) { return GetGlyph(index, false); }\n\n\t/// <summary>\n\t/// Clear the glyphs.\n\t/// </summary>\n\n\tpublic void Clear ()\n\t{\n\t\tmDict.Clear();\n\t\tmSaved.Clear();\n\t}\n\n\t/// <summary>\n\t/// Trim the glyphs, ensuring that they will never go past the specified bounds.\n\t/// </summary>\n\n\tpublic void Trim (int xMin, int yMin, int xMax, int yMax)\n\t{\n\t\tif (isValid)\n\t\t{\n\t\t\tfor (int i = 0, imax = mSaved.Count; i < imax; ++i)\n\t\t\t{\n\t\t\t\tBMGlyph glyph = mSaved[i];\n\t\t\t\tif (glyph != null) glyph.Trim(xMin, yMin, xMax, yMax);\n\t\t\t}\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMFont.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 94cc67aca494b1943a7a0f51b581441d\ntimeCreated: 1463716780\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMFontReader.cs",
    "content": "//----------------------------------------------\n//            NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\nusing UnityEditor;\nusing System.Text;\n\n/// <summary>\n/// Helper class that takes care of loading BMFont's glyph information from the specified byte array.\n/// This functionality is not a part of BMFont anymore because Flash export option can't handle System.IO functions.\n/// </summary>\n\npublic static class BMFontReader\n{\n\t/// <summary>\n\t/// Helper function that retrieves the string value of the key=value pair.\n\t/// </summary>\n\n\tstatic string GetString (string s)\n\t{\n\t\tint idx = s.IndexOf('=');\n\t\treturn (idx == -1) ? \"\" : s.Substring(idx + 1);\n\t}\n\n\t/// <summary>\n\t/// Helper function that retrieves the integer value of the key=value pair.\n\t/// </summary>\n\n\tstatic int GetInt (string s)\n\t{\n\t\tint val = 0;\n\t\tstring text = GetString(s);\n#if UNITY_FLASH\n\t\ttry { val = int.Parse(text); } catch (System.Exception) { }\n#else\n\t\tint.TryParse(text, out val);\n#endif\n\t\treturn val;\n\t}\n\n\t/// <summary>\n\t/// Reload the font data.\n\t/// </summary>\n\n\tstatic public void Load (BMFont font, string name, byte[] bytes)\n\t{\n\t\tfont.Clear();\n\n\t\tif (bytes != null)\n\t\t{\n\t\t\tBmByteReader reader = new BmByteReader(bytes);\n\t\t\tchar[] separator = new char[] { ' ' };\n\n\t\t\twhile (reader.canRead)\n\t\t\t{\n\t\t\t\tstring line = reader.ReadLine();\n\t\t\t\tif (string.IsNullOrEmpty(line)) break;\n\t\t\t\tstring[] split = line.Split(separator, System.StringSplitOptions.RemoveEmptyEntries);\n\t\t\t\tint len = split.Length;\n\n\t\t\t\tif (split[0] == \"char\")\n\t\t\t\t{\n\t\t\t\t\t// Expected data style:\n\t\t\t\t\t// char id=13 x=506 y=62 width=3 height=3 xoffset=-1 yoffset=50 xadvance=0 page=0 chnl=15\n\n\t\t\t\t\tint channel = (len > 10) ? GetInt(split[10]) : 15;\n\n\t\t\t\t\tif (len > 9 && GetInt(split[9]) > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tDebug.LogError(\"Your font was exported with more than one texture. Only one texture is supported by NGUI.\\n\" +\n\t\t\t\t\t\t\t\"You need to re-export your font, enlarging the texture's dimensions until everything fits into just one texture.\");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (len > 8)\n\t\t\t\t\t{\n\t\t\t\t\t\tint id = GetInt(split[1]);\n\t\t\t\t\t\tBMGlyph glyph = font.GetGlyph(id, true);\n\n\t\t\t\t\t\tif (glyph != null)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tglyph.x\t\t\t= GetInt(split[2]);\n\t\t\t\t\t\t\tglyph.y\t\t\t= GetInt(split[3]);\n\t\t\t\t\t\t\tglyph.width\t\t= GetInt(split[4]);\n\t\t\t\t\t\t\tglyph.height\t= GetInt(split[5]);\n\t\t\t\t\t\t\tglyph.offsetX\t= GetInt(split[6]);\n\t\t\t\t\t\t\tglyph.offsetY\t= GetInt(split[7]);\n\t\t\t\t\t\t\tglyph.advance\t= GetInt(split[8]);\n\t\t\t\t\t\t\tglyph.channel\t= channel;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse Debug.Log(\"Char: \" + split[1] + \" (\" + id + \") is NULL\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tDebug.LogError(\"Unexpected number of entries for the 'char' field (\" + name + \", \" + split.Length + \"):\\n\" + line);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (split[0] == \"kerning\")\n\t\t\t\t{\n\t\t\t\t\t// Expected data style:\n\t\t\t\t\t// kerning first=84 second=244 amount=-5 \n\n\t\t\t\t\tif (len > 3)\n\t\t\t\t\t{\n\t\t\t\t\t\tint first  = GetInt(split[1]);\n\t\t\t\t\t\tint second = GetInt(split[2]);\n\t\t\t\t\t\tint amount = GetInt(split[3]);\n\n\t\t\t\t\t\tBMGlyph glyph = font.GetGlyph(second, true);\n\t\t\t\t\t\tif (glyph != null) glyph.SetKerning(first, amount);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tDebug.LogError(\"Unexpected number of entries for the 'kerning' field (\" +\n\t\t\t\t\t\t\tname + \", \" + split.Length + \"):\\n\" + line);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (split[0] == \"common\")\n\t\t\t\t{\n\t\t\t\t\t// Expected data style:\n\t\t\t\t\t// common lineHeight=64 base=51 scaleW=512 scaleH=512 pages=1 packed=0 alphaChnl=1 redChnl=4 greenChnl=4 blueChnl=4\n\n\t\t\t\t\tif (len > 5)\n\t\t\t\t\t{\n\t\t\t\t\t\tfont.charSize\t= GetInt(split[1]);\n\t\t\t\t\t\tfont.baseOffset = GetInt(split[2]);\n\t\t\t\t\t\tfont.texWidth\t= GetInt(split[3]);\n\t\t\t\t\t\tfont.texHeight\t= GetInt(split[4]);\n\n\t\t\t\t\t\tint pages = GetInt(split[5]);\n\n\t\t\t\t\t\tif (pages != 1)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tDebug.LogError(\"Font '\" + name + \"' must be created with only 1 texture, not \" + pages);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tDebug.LogError(\"Unexpected number of entries for the 'common' field (\" +\n\t\t\t\t\t\t\tname + \", \" + split.Length + \"):\\n\" + line);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (split[0] == \"page\")\n\t\t\t\t{\n\t\t\t\t\t// Expected data style:\n\t\t\t\t\t// page id=0 file=\"textureName.png\"\n\n\t\t\t\t\tif (len > 2)\n\t\t\t\t\t{\n\t\t\t\t\t\tfont.spriteName = GetString(split[2]).Replace(\"\\\"\", \"\");\n\t\t\t\t\t\tfont.spriteName = font.spriteName.Replace(\".png\", \"\");\n\t\t\t\t\t\tfont.spriteName = font.spriteName.Replace(\".tga\", \"\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMFontReader.cs.meta",
    "content": "fileFormatVersion: 2\nguid: a9fc0907767cc05448abe2c012b90c22\ntimeCreated: 1463716780\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMGlyph.cs",
    "content": "﻿//----------------------------------------------\n//            NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\nusing System.Collections.Generic;\n\n/// <summary>\n/// Glyph structure used by BMFont. For more information see http://www.angelcode.com/products/bmfont/\n/// </summary>\n\n[System.Serializable]\npublic class BMGlyph\n{\n\tpublic int index;\t// Index of this glyph (used by BMFont)\n\tpublic int x;\t\t// Offset from the left side of the texture to the left side of the glyph\n\tpublic int y;\t\t// Offset from the top of the texture to the top of the glyph\n\tpublic int width;\t// Glyph's width in pixels\n\tpublic int height;\t// Glyph's height in pixels\n\tpublic int offsetX;\t// Offset to apply to the cursor's left position before drawing this glyph\n\tpublic int offsetY; // Offset to apply to the cursor's top position before drawing this glyph\n\tpublic int advance;\t// How much to move the cursor after printing this character\n\tpublic int channel;\t// Channel mask (in most cases this will be 15 (RGBA, 1+2+4+8)\n\tpublic List<int> kerning;\n\n\t/// <summary>\n\t/// Retrieves the special amount by which to adjust the cursor position, given the specified previous character.\n\t/// </summary>\n\n\tpublic int GetKerning (int previousChar)\n\t{\n\t\tif (kerning != null && previousChar != 0)\n\t\t{\n\t\t\tfor (int i = 0, imax = kerning.Count; i < imax; i += 2)\n\t\t\t\tif (kerning[i] == previousChar)\n\t\t\t\t\treturn kerning[i + 1];\n\t\t}\n\t\treturn 0;\n\t}\n\n\t/// <summary>\n\t/// Add a new kerning entry to the character (or adjust an existing one).\n\t/// </summary>\n\n\tpublic void SetKerning (int previousChar, int amount)\n\t{\n\t\tif (kerning == null) kerning = new List<int>();\n\n\t\tfor (int i = 0; i < kerning.Count; i += 2)\n\t\t{\n\t\t\tif (kerning[i] == previousChar)\n\t\t\t{\n\t\t\t\tkerning[i + 1] = amount;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tkerning.Add(previousChar);\n\t\tkerning.Add(amount);\n\t}\n\n\t/// <summary>\n\t/// Trim the glyph, given the specified minimum and maximum dimensions in pixels.\n\t/// </summary>\n\n\tpublic void Trim (int xMin, int yMin, int xMax, int yMax)\n\t{\n\t\tint x1 = x + width;\n\t\tint y1 = y + height;\n\n\t\tif (x < xMin)\n\t\t{\n\t\t\tint offset = xMin - x;\n\t\t\tx += offset;\n\t\t\twidth -= offset;\n\t\t\toffsetX += offset;\n\t\t}\n\n\t\tif (y < yMin)\n\t\t{\n\t\t\tint offset = yMin - y;\n\t\t\ty += offset;\n\t\t\theight -= offset;\n\t\t\toffsetY += offset;\n\t\t}\n\n\t\tif (x1 > xMax) width  -= x1 - xMax;\n\t\tif (y1 > yMax) height -= y1 - yMax;\n\t}\n}\n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BMGlyph.cs.meta",
    "content": "fileFormatVersion: 2\nguid: a523ba19da28a9c4fbda283c3433d53d\ntimeCreated: 1463716780\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmBetterList.cs",
    "content": "//----------------------------------------------\n//            NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\nusing System.Collections.Generic;\nusing System.Diagnostics;\n\n/// <summary>\n/// This improved version of the System.Collections.Generic.List that doesn't release the buffer on Clear(),\n/// resulting in better performance and less garbage collection.\n/// PRO: BetterList performs faster than List when you Add and Remove items (although slower if you remove from the beginning).\n/// CON: BetterList performs worse when sorting the list. If your operations involve sorting, use the standard List instead.\n/// </summary>\n\npublic class BmBetterList<T>\n{\n#if UNITY_FLASH\n\n\tList<T> mList = new List<T>();\n\t\n\t/// <summary>\n\t/// Direct access to the buffer. Note that you should not use its 'Length' parameter, but instead use BetterList.size.\n\t/// </summary>\n\t\n\tpublic T this[int i]\n\t{\n\t\tget { return mList[i]; }\n\t\tset { mList[i] = value; }\n\t}\n\t\n\t/// <summary>\n\t/// Compatibility with the non-flash syntax.\n\t/// </summary>\n\t\n\tpublic List<T> buffer { get { return mList; } }\n\n\t/// <summary>\n\t/// Direct access to the buffer's size. Note that it's only public for speed and efficiency. You shouldn't modify it.\n\t/// </summary>\n\n\tpublic int size { get { return mList.Count; } }\n\n\t/// <summary>\n\t/// For 'foreach' functionality.\n\t/// </summary>\n\n\tpublic IEnumerator<T> GetEnumerator () { return mList.GetEnumerator(); }\n\n\t/// <summary>\n\t/// Clear the array by resetting its size to zero. Note that the memory is not actually released.\n\t/// </summary>\n\n\tpublic void Clear () { mList.Clear(); }\n\n\t/// <summary>\n\t/// Clear the array and release the used memory.\n\t/// </summary>\n\n\tpublic void Release () { mList.Clear(); }\n\n\t/// <summary>\n\t/// Add the specified item to the end of the list.\n\t/// </summary>\n\n\tpublic void Add (T item) { mList.Add(item); }\n\n\t/// <summary>\n\t/// Insert an item at the specified index, pushing the entries back.\n\t/// </summary>\n\n\tpublic void Insert (int index, T item)\n\t{\n\t\tif (index > -1 && index < mList.Count) mList.Insert(index, item);\n\t\telse mList.Add(item);\n\t}\n\n\t/// <summary>\n\t/// Returns 'true' if the specified item is within the list.\n\t/// </summary>\n\n\tpublic bool Contains (T item) { return mList.Contains(item); }\n\n\t/// <summary>\n\t/// Return the index of the specified item.\n\t/// </summary>\n\n\tpublic int IndexOf (T item) { return mList.IndexOf(item); }\n\n\t/// <summary>\n\t/// Remove the specified item from the list. Note that RemoveAt() is faster and is advisable if you already know the index.\n\t/// </summary>\n\n\tpublic bool Remove (T item) { return mList.Remove(item); }\n\n\t/// <summary>\n\t/// Remove an item at the specified index.\n\t/// </summary>\n\n\tpublic void RemoveAt (int index) { mList.RemoveAt(index); }\n\n\t/// <summary>\n\t/// Remove an item from the end.\n\t/// </summary>\n\n\tpublic T Pop ()\n\t{\n\t\tif (buffer != null && size != 0)\n\t\t{\n\t\t\tT val = buffer[mList.Count - 1];\n\t\t\tmList.RemoveAt(mList.Count - 1);\n\t\t\treturn val;\n\t\t}\n\t\treturn default(T);\n\t}\n\n\t/// <summary>\n\t/// Mimic List's ToArray() functionality, except that in this case the list is resized to match the current size.\n\t/// </summary>\n\n\tpublic T[] ToArray () { return mList.ToArray(); }\n\n\t/// <summary>\n\t/// List.Sort equivalent.\n\t/// </summary>\n\n\tpublic void Sort (System.Comparison<T> comparer) { mList.Sort(comparer); }\n\n#else\n\n\t/// <summary>\n\t/// Direct access to the buffer. Note that you should not use its 'Length' parameter, but instead use BetterList.size.\n\t/// </summary>\n\n\tpublic T[] buffer;\n\n\t/// <summary>\n\t/// Direct access to the buffer's size. Note that it's only public for speed and efficiency. You shouldn't modify it.\n\t/// </summary>\n\n\tpublic int size = 0;\n\n\t/// <summary>\n\t/// For 'foreach' functionality.\n\t/// </summary>\n\n\t[DebuggerHidden]\n\t[DebuggerStepThrough]\n\tpublic IEnumerator<T> GetEnumerator ()\n\t{\n\t\tif (buffer != null)\n\t\t{\n\t\t\tfor (int i = 0; i < size; ++i)\n\t\t\t{\n\t\t\t\tyield return buffer[i];\n\t\t\t}\n\t\t}\n\t}\n\t\n\t/// <summary>\n\t/// Convenience function. I recommend using .buffer instead.\n\t/// </summary>\n\n\t[DebuggerHidden]\n\tpublic T this[int i]\n\t{\n\t\tget { return buffer[i]; }\n\t\tset { buffer[i] = value; }\n\t}\n\n\t/// <summary>\n\t/// Helper function that expands the size of the array, maintaining the content.\n\t/// </summary>\n\n\tvoid AllocateMore ()\n\t{\n\t\tT[] newList = (buffer != null) ? new T[Mathf.Max(buffer.Length << 1, 32)] : new T[32];\n\t\tif (buffer != null && size > 0) buffer.CopyTo(newList, 0);\n\t\tbuffer = newList;\n\t}\n\n\t/// <summary>\n\t/// Trim the unnecessary memory, resizing the buffer to be of 'Length' size.\n\t/// Call this function only if you are sure that the buffer won't need to resize anytime soon.\n\t/// </summary>\n\n\tvoid Trim ()\n\t{\n\t\tif (size > 0)\n\t\t{\n\t\t\tif (size < buffer.Length)\n\t\t\t{\n\t\t\t\tT[] newList = new T[size];\n\t\t\t\tfor (int i = 0; i < size; ++i) newList[i] = buffer[i];\n\t\t\t\tbuffer = newList;\n\t\t\t}\n\t\t}\n\t\telse buffer = null;\n\t}\n\n\t/// <summary>\n\t/// Clear the array by resetting its size to zero. Note that the memory is not actually released.\n\t/// </summary>\n\n\tpublic void Clear () { size = 0; }\n\n\t/// <summary>\n\t/// Clear the array and release the used memory.\n\t/// </summary>\n\n\tpublic void Release () { size = 0; buffer = null; }\n\n\t/// <summary>\n\t/// Add the specified item to the end of the list.\n\t/// </summary>\n\n\tpublic void Add (T item)\n\t{\n\t\tif (buffer == null || size == buffer.Length) AllocateMore();\n\t\tbuffer[size++] = item;\n\t}\n\n\t/// <summary>\n\t/// Insert an item at the specified index, pushing the entries back.\n\t/// </summary>\n\n\tpublic void Insert (int index, T item)\n\t{\n\t\tif (buffer == null || size == buffer.Length) AllocateMore();\n\n\t\tif (index > -1 && index < size)\n\t\t{\n\t\t\tfor (int i = size; i > index; --i) buffer[i] = buffer[i - 1];\n\t\t\tbuffer[index] = item;\n\t\t\t++size;\n\t\t}\n\t\telse Add(item);\n\t}\n\n\t/// <summary>\n\t/// Returns 'true' if the specified item is within the list.\n\t/// </summary>\n\n\tpublic bool Contains (T item)\n\t{\n\t\tif (buffer == null) return false;\n\t\tfor (int i = 0; i < size; ++i) if (buffer[i].Equals(item)) return true;\n\t\treturn false;\n\t}\n\n\t/// <summary>\n\t/// Return the index of the specified item.\n\t/// </summary>\n\n\tpublic int IndexOf (T item)\n\t{\n\t\tif (buffer == null) return -1;\n\t\tfor (int i = 0; i < size; ++i) if (buffer[i].Equals(item)) return i;\n\t\treturn -1;\n\t}\n\n\t/// <summary>\n\t/// Remove the specified item from the list. Note that RemoveAt() is faster and is advisable if you already know the index.\n\t/// </summary>\n\n\tpublic bool Remove (T item)\n\t{\n\t\tif (buffer != null)\n\t\t{\n\t\t\tEqualityComparer<T> comp = EqualityComparer<T>.Default;\n\n\t\t\tfor (int i = 0; i < size; ++i)\n\t\t\t{\n\t\t\t\tif (comp.Equals(buffer[i], item))\n\t\t\t\t{\n\t\t\t\t\t--size;\n\t\t\t\t\tbuffer[i] = default(T);\n\t\t\t\t\tfor (int b = i; b < size; ++b) buffer[b] = buffer[b + 1];\n\t\t\t\t\tbuffer[size] = default(T);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t/// <summary>\n\t/// Remove an item at the specified index.\n\t/// </summary>\n\n\tpublic void RemoveAt (int index)\n\t{\n\t\tif (buffer != null && index > -1 && index < size)\n\t\t{\n\t\t\t--size;\n\t\t\tbuffer[index] = default(T);\n\t\t\tfor (int b = index; b < size; ++b) buffer[b] = buffer[b + 1];\n\t\t\tbuffer[size] = default(T);\n\t\t}\n\t}\n\n\t/// <summary>\n\t/// Remove an item from the end.\n\t/// </summary>\n\n\tpublic T Pop ()\n\t{\n\t\tif (buffer != null && size != 0)\n\t\t{\n\t\t\tT val = buffer[--size];\n\t\t\tbuffer[size] = default(T);\n\t\t\treturn val;\n\t\t}\n\t\treturn default(T);\n\t}\n\n\t/// <summary>\n\t/// Mimic List's ToArray() functionality, except that in this case the list is resized to match the current size.\n\t/// </summary>\n\n\tpublic T[] ToArray () { Trim(); return buffer; }\n\n\t//class Comparer : System.Collections.IComparer\n\t//{\n\t//    public System.Comparison<T> func;\n\t//    public int Compare (object x, object y) { return func((T)x, (T)y); }\n\t//}\n\n\t//Comparer mComp = new Comparer();\n\n\t/// <summary>\n\t/// List.Sort equivalent. Doing Array.Sort causes GC allocations.\n\t/// </summary>\n\n\t//public void Sort (System.Comparison<T> comparer)\n\t//{\n\t//    if (size > 0)\n\t//    {\n\t//        mComp.func = comparer;\n\t//        System.Array.Sort(buffer, 0, size, mComp);\n\t//    }\n\t//}\n\n\t/// <summary>\n\t/// List.Sort equivalent. Manual sorting causes no GC allocations.\n\t/// </summary>\n\n\t[DebuggerHidden]\n\t[DebuggerStepThrough]\n\tpublic void Sort (CompareFunc comparer)\n\t{\n\t\tint start = 0;\n\t\tint max = size - 1;\n\t\tbool changed = true;\n\n\t\twhile (changed)\n\t\t{\n\t\t\tchanged = false;\n\n\t\t\tfor (int i = start; i < max; ++i)\n\t\t\t{\n\t\t\t\t// Compare the two values\n\t\t\t\tif (comparer(buffer[i], buffer[i + 1]) > 0)\n\t\t\t\t{\n\t\t\t\t\t// Swap the values\n\t\t\t\t\tT temp = buffer[i];\n\t\t\t\t\tbuffer[i] = buffer[i + 1];\n\t\t\t\t\tbuffer[i + 1] = temp;\n\t\t\t\t\tchanged = true;\n\t\t\t\t}\n\t\t\t\telse if (!changed)\n\t\t\t\t{\n\t\t\t\t\t// Nothing has changed -- we can start here next time\n\t\t\t\t\tstart = (i == 0) ? 0 : i - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/// <summary>\n\t/// Comparison function should return -1 if left is less than right, 1 if left is greater than right, and 0 if they match.\n\t/// </summary>\n\n\tpublic delegate int CompareFunc (T left, T right);\n#endif\n}\n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmBetterList.cs.meta",
    "content": "fileFormatVersion: 2\nguid: d6ab7ca414bf6644983a7ca1041e1118\ntimeCreated: 1463752738\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmByteReader.cs",
    "content": "//----------------------------------------------\n//            NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\nusing System.Text;\nusing System.Collections.Generic;\nusing System.IO;\n\n/// <summary>\n/// MemoryStream.ReadLine has an interesting oddity: it doesn't always advance the stream's position by the correct amount:\n/// http://social.msdn.microsoft.com/Forums/en-AU/Vsexpressvcs/thread/b8f7837b-e396-494e-88e1-30547fcf385f\n/// Solution? Custom line reader with the added benefit of not having to use streams at all.\n/// </summary>\n\npublic class BmByteReader\n{\n\tbyte[] mBuffer;\n\tint mOffset = 0;\n\n\tpublic BmByteReader (byte[] bytes) { mBuffer = bytes; }\n\tpublic BmByteReader (TextAsset asset) { mBuffer = asset.bytes; }\n\n\t/// <summary>\n\t/// Read the contents of the specified file and return a Byte Reader to work with.\n\t/// </summary>\n\n\tstatic public BmByteReader Open (string path)\n\t{\n#if UNITY_EDITOR || (!UNITY_FLASH && !NETFX_CORE && !UNITY_WP8 && !UNITY_WP_8_1)\n\t\tFileStream fs = File.OpenRead(path);\n\n\t\tif (fs != null)\n\t\t{\n\t\t\tfs.Seek(0, SeekOrigin.End);\n\t\t\tbyte[] buffer = new byte[fs.Position];\n\t\t\tfs.Seek(0, SeekOrigin.Begin);\n\t\t\tfs.Read(buffer, 0, buffer.Length);\n\t\t\tfs.Close();\n\t\t\treturn new BmByteReader(buffer);\n\t\t}\n#endif\n\t\treturn null;\n\t}\n\n\t/// <summary>\n\t/// Whether the buffer is readable.\n\t/// </summary>\n\n\tpublic bool canRead { get { return (mBuffer != null && mOffset < mBuffer.Length); } }\n\n\t/// <summary>\n\t/// Read a single line from the buffer.\n\t/// </summary>\n\n\tstatic string ReadLine (byte[] buffer, int start, int count)\n\t{\n#if UNITY_FLASH\n\t\t// Encoding.UTF8 is not supported in Flash :(\n\t\tStringBuilder sb = new StringBuilder();\n\n\t\tint max = start + count;\n\n\t\tfor (int i = start; i < max; ++i)\n\t\t{\n\t\t\tbyte byte0 = buffer[i];\n\n\t\t\tif ((byte0 & 128) == 0)\n\t\t\t{\n\t\t\t\t// If an UCS fits 7 bits, its coded as 0xxxxxxx. This makes ASCII character represented by themselves\n\t\t\t\tsb.Append((char)byte0);\n\t\t\t}\n\t\t\telse if ((byte0 & 224) == 192)\n\t\t\t{\n\t\t\t\t// If an UCS fits 11 bits, it is coded as 110xxxxx 10xxxxxx\n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte1 = buffer[i];\n\t\t\t\tint ch = (byte0 & 31) << 6;\n\t\t\t\tch |= (byte1 & 63);\n\t\t\t\tsb.Append((char)ch);\n\t\t\t}\n\t\t\telse if ((byte0 & 240) == 224)\n\t\t\t{\n\t\t\t\t// If an UCS fits 16 bits, it is coded as 1110xxxx 10xxxxxx 10xxxxxx\n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte1 = buffer[i];\n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte2 = buffer[i];\n\n\t\t\t\tif (byte0 == 0xEF && byte1 == 0xBB && byte2 == 0xBF)\n\t\t\t\t{\n\t\t\t\t\t// Byte Order Mark -- generally the first 3 bytes in a Windows-saved UTF-8 file. Skip it.\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint ch = (byte0 & 15) << 12;\n\t\t\t\t\tch |= (byte1 & 63) << 6;\n\t\t\t\t\tch |= (byte2 & 63);\n\t\t\t\t\tsb.Append((char)ch);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((byte0 & 248) == 240)\n\t\t\t{\n\t\t\t\t// If an UCS fits 21 bits, it is coded as 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx \n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte1 = buffer[i];\n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte2 = buffer[i];\n\t\t\t\tif (++i == count) break;\n\t\t\t\tbyte byte3 = buffer[i];\n\n\t\t\t\tint ch = (byte0 & 7) << 18;\n\t\t\t\tch |= (byte1 & 63) << 12;\n\t\t\t\tch |= (byte2 & 63) << 6;\n\t\t\t\tch |= (byte3 & 63);\n\t\t\t\tsb.Append((char)ch);\n\t\t\t}\n\t\t}\n\t\treturn sb.ToString();\n#else\n\t\treturn Encoding.UTF8.GetString(buffer, start, count);\n#endif\n\t}\n\n\t/// <summary>\n\t/// Read a single line from the buffer.\n\t/// </summary>\n\n\tpublic string ReadLine () { return ReadLine(true); }\n\n\t/// <summary>\n\t/// Read a single line from the buffer.\n\t/// </summary>\n\n\tpublic string ReadLine (bool skipEmptyLines)\n\t{\n\t\tint max = mBuffer.Length;\n\n\t\t// Skip empty characters\n\t\tif (skipEmptyLines)\n\t\t{\n\t\t\twhile (mOffset < max && mBuffer[mOffset] < 32) ++mOffset;\n\t\t}\n\n\t\tint end = mOffset;\n\n\t\tif (end < max)\n\t\t{\n\t\t\tfor (; ; )\n\t\t\t{\n\t\t\t\tif (end < max)\n\t\t\t\t{\n\t\t\t\t\tint ch = mBuffer[end++];\n\t\t\t\t\tif (ch != '\\n' && ch != '\\r') continue;\n\t\t\t\t}\n\t\t\t\telse ++end;\n\n\t\t\t\tstring line = ReadLine(mBuffer, mOffset, end - mOffset - 1);\n\t\t\t\tmOffset = end;\n\t\t\t\treturn line;\n\t\t\t}\n\t\t}\n\t\tmOffset = max;\n\t\treturn null;\n\t}\n\n\t/// <summary>\n\t/// Assume that the entire file is a collection of key/value pairs.\n\t/// </summary>\n\n\tpublic Dictionary<string, string> ReadDictionary ()\n\t{\n\t\tDictionary<string, string> dict = new Dictionary<string, string>();\n\t\tchar[] separator = new char[] { '=' };\n\n\t\twhile (canRead)\n\t\t{\n\t\t\tstring line = ReadLine();\n\t\t\tif (line == null) break;\n\t\t\tif (line.StartsWith(\"//\")) continue;\n\n#if UNITY_FLASH\n\t\t\tstring[] split = line.Split(separator, System.StringSplitOptions.RemoveEmptyEntries);\n#else\n\t\t\tstring[] split = line.Split(separator, 2, System.StringSplitOptions.RemoveEmptyEntries);\n#endif\n\n\t\t\tif (split.Length == 2)\n\t\t\t{\n\t\t\t\tstring key = split[0].Trim();\n\t\t\t\tstring val = split[1].Trim().Replace(\"\\\\n\", \"\\n\");\n\t\t\t\tdict[key] = val;\n\t\t\t}\n\t\t}\n\t\treturn dict;\n\t}\n\n\tstatic BmBetterList<string> mTemp = new BmBetterList<string>();\n\n\t/// <summary>\n\t/// Read a single line of Comma-Separated Values from the file.\n\t/// </summary>\n\n\tpublic BmBetterList<string> ReadCSV ()\n\t{\n\t\tmTemp.Clear();\n\t\tstring line = \"\";\n\t\tbool insideQuotes = false;\n\t\tint wordStart = 0;\n\n\t\twhile (canRead)\n\t\t{\n\t\t\tif (insideQuotes)\n\t\t\t{\n\t\t\t\tstring s = ReadLine(false);\n\t\t\t\tif (s == null) return null;\n\t\t\t\ts = s.Replace(\"\\\\n\", \"\\n\");\n\t\t\t\tline += \"\\n\" + s;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tline = ReadLine(true);\n\t\t\t\tif (line == null) return null;\n\t\t\t\tline = line.Replace(\"\\\\n\", \"\\n\");\n\t\t\t\twordStart = 0;\n\t\t\t}\n\n\t\t\tfor (int i = wordStart, imax = line.Length; i < imax; ++i)\n\t\t\t{\n\t\t\t\tchar ch = line[i];\n\n\t\t\t\tif (ch == ',')\n\t\t\t\t{\n\t\t\t\t\tif (!insideQuotes)\n\t\t\t\t\t{\n\t\t\t\t\t\tmTemp.Add(line.Substring(wordStart, i - wordStart));\n\t\t\t\t\t\twordStart = i + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (ch == '\"')\n\t\t\t\t{\n\t\t\t\t\tif (insideQuotes)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (i + 1 >= imax)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmTemp.Add(line.Substring(wordStart, i - wordStart).Replace(\"\\\"\\\"\", \"\\\"\"));\n\t\t\t\t\t\t\treturn mTemp;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (line[i + 1] != '\"')\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmTemp.Add(line.Substring(wordStart, i - wordStart).Replace(\"\\\"\\\"\", \"\\\"\"));\n\t\t\t\t\t\t\tinsideQuotes = false;\n\n\t\t\t\t\t\t\tif (line[i + 1] == ',')\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t++i;\n\t\t\t\t\t\t\t\twordStart = i + 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse ++i;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\twordStart = i + 1;\n\t\t\t\t\t\tinsideQuotes = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (wordStart < line.Length)\n\t\t\t{\n\t\t\t\tif (insideQuotes) continue;\n\t\t\t\tmTemp.Add(line.Substring(wordStart, line.Length - wordStart));\n\t\t\t}\n\t\t\treturn mTemp;\n\t\t}\n\t\treturn null;\n\t}\n}\n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmByteReader.cs.meta",
    "content": "fileFormatVersion: 2\nguid: f40e2da786f71024e92246ddf360eb32\ntimeCreated: 1463752697\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmFontEditor.cs",
    "content": "﻿using UnityEngine;\nusing UnityEditor;\n\npublic class BmFontEditor : EditorWindow\n{\n    [MenuItem(\"Tools/BMFont Maker\")]\n    static public void OpenBMFontMaker()\n    {\n        EditorWindow.GetWindow<BmFontEditor>(false, \"BMFont Maker\", true).Show();\n    }\n\n    [SerializeField]\n    private Font targetFont;\n    [SerializeField]\n    private TextAsset fntData;\n    [SerializeField]\n    private Material fontMaterial;\n    [SerializeField]\n    private Texture2D fontTexture;\n\n    private BMFont bmFont = new BMFont();\n\n    public BmFontEditor()\n    {\n    }\n\n    void OnGUI()\n    {\n        targetFont = EditorGUILayout.ObjectField(\"Target Font\", targetFont, typeof(Font), false) as Font;\n        fntData = EditorGUILayout.ObjectField(\"Fnt Data\", fntData, typeof(TextAsset), false) as TextAsset;\n        fontMaterial = EditorGUILayout.ObjectField(\"Font Material\", fontMaterial, typeof(Material), false) as Material;\n        fontTexture = EditorGUILayout.ObjectField(\"Font Texture\", fontTexture, typeof(Texture2D), false) as Texture2D;\n\n        if (GUILayout.Button(\"Create BMFont\"))\n        {\n            BMFontReader.Load(bmFont, fntData.name, fntData.bytes); // 借用NGUI封装的读取类\n            CharacterInfo[] characterInfo = new CharacterInfo[bmFont.glyphs.Count];\n            for (int i = 0; i < bmFont.glyphs.Count; i++)\n            {\n                BMGlyph bmInfo = bmFont.glyphs[i];\n                CharacterInfo info = new CharacterInfo();\n                info.index = bmInfo.index;\n                info.uv.x = (float)bmInfo.x / (float)bmFont.texWidth;\n                info.uv.y = 1 - (float)bmInfo.y / (float)bmFont.texHeight;\n                info.uv.width = (float)bmInfo.width / (float)bmFont.texWidth;\n                info.uv.height = -1f * (float)bmInfo.height / (float)bmFont.texHeight;\n                info.vert.x = 0;\n                info.vert.y = -(float)bmInfo.height;\n                info.vert.width = (float)bmInfo.width;\n                info.vert.height = (float)bmInfo.height;\n                info.width = (float)bmInfo.advance;\n                characterInfo[i] = info;\n            }\n            targetFont.characterInfo = characterInfo;\n            if (fontMaterial)\n            {\n                fontMaterial.mainTexture = fontTexture;\n            }\n            targetFont.material = fontMaterial;\n            fontMaterial.shader = Shader.Find(\"UI/Default\");//这一行很关键，如果用standard的shader，放到Android手机上，第一次加载会很慢\n\n            Debug.Log(\"create font <\" + targetFont.name + \"> success\");\n            Close();\n        }\n    }\n}"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker/BmFontEditor.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 209ec617b615f1e45b6ff6819281ecec\ntimeCreated: 1470452693\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/BmfontMaker.meta",
    "content": "fileFormatVersion: 2\nguid: be5b5ab2f2e32e64d870debcd5ccc7b2\nfolderAsset: yes\ntimeCreated: 1470552281\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/Helper.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.Events;\r\nusing System.Collections.Generic;\r\nusing System.Security.Cryptography;\r\nusing System.IO;\r\nusing System.Text;\r\nusing System;\r\n\r\npublic class Helper\r\n{\r\n    public static string RunCmd(string command, string args, string workDir)\r\n    {\r\n        //例Process\r\n        System.Diagnostics.Process p = new System.Diagnostics.Process();\r\n        p.StartInfo.FileName = command;           //确定程序名\r\n        p.StartInfo.Arguments = args;    //确定程式命令行\r\n        p.StartInfo.WorkingDirectory = workDir; //工作目录\r\n        p.StartInfo.UseShellExecute = false;        //Shell的使用\r\n        p.StartInfo.RedirectStandardInput = true;   //重定向输入\r\n        p.StartInfo.RedirectStandardOutput = true; //重定向输出\r\n        p.StartInfo.RedirectStandardError = true;   //重定向输出错误\r\n        p.StartInfo.CreateNoWindow = true;          //设置置不显示示窗口\r\n        p.Start();\r\n        return p.StandardOutput.ReadToEnd();        //输出出流取得命令行结果果\r\n    }\r\n\r\n    public static void CopyDirectory(string sourceDirName, string destDirName)\r\n    {\r\n        try\r\n        {\r\n            if (!Directory.Exists(destDirName))\r\n            {\r\n                Directory.CreateDirectory(destDirName);\r\n                File.SetAttributes(destDirName, File.GetAttributes(sourceDirName));\r\n            }\r\n\r\n            if (destDirName[destDirName.Length - 1] != Path.DirectorySeparatorChar)\r\n                destDirName = destDirName + Path.DirectorySeparatorChar;\r\n\r\n            string[] files = Directory.GetFiles(sourceDirName);\r\n            foreach (string file in files)\r\n            {\r\n                //if (File.Exists(destDirName + Path.GetFileName(file)))\r\n                //    continue;\r\n                File.Copy(file, destDirName + Path.GetFileName(file), true);\r\n                File.SetAttributes(destDirName + Path.GetFileName(file), FileAttributes.Normal);\r\n            }\r\n\r\n            string[] dirs = Directory.GetDirectories(sourceDirName);\r\n            foreach (string dir in dirs)\r\n            {\r\n                CopyDirectory(dir, destDirName + Path.GetFileName(dir));\r\n            }\r\n        }\r\n        catch (System.Exception ex)\r\n        {\r\n            Debug.LogError(ex.Message);\r\n        }\r\n    }\r\n\r\n    public static void forEachHandle(string path, List<string> matchExts, UnityAction<string> handle)\r\n    {\r\n        string[] names = Directory.GetFiles(path);\r\n        string[] dirs = Directory.GetDirectories(path);\r\n        foreach (string filename in names)\r\n        {\r\n            if (filename.EndsWith(\"meta\") || string.IsNullOrEmpty(Path.GetFileNameWithoutExtension(filename)))\r\n                continue;\r\n\r\n            string[] name_splits = filename.Split('.');\r\n            string ext = name_splits[name_splits.Length - 1];\r\n            if (matchExts == null)\r\n            {\r\n                handle.Invoke(filename);\r\n            }\r\n            else if (matchExts.Contains(ext))\r\n            {\r\n                handle.Invoke(filename);\r\n            }\r\n        }\r\n\r\n        foreach (string dir in dirs)\r\n        {\r\n            forEachHandle(dir, matchExts, handle);\r\n        }\r\n    }\r\n\r\n    \r\n}\r\n"
  },
  {
    "path": "Assets/Game/Editor/Helper.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 196a3b7fa2c6e604c89974a2810ade0a\ntimeCreated: 1474773601\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/I18nExporter/I18nExporter.cs",
    "content": "﻿using UnityEngine;\r\nusing System.Collections.Generic;\r\nusing UnityEditor;\r\nusing System.IO;\r\nusing System.Text;\r\n// 国际化 导出\r\npublic class I18nExporter : Editor\r\n{\r\n    private static Dictionary<string, Dictionary<string, string>> _markDatas;\r\n    private static Dictionary<string, string> _markFiles;\r\n    private static List<string> ignorePath;\r\n    private static int _markId;\r\n    private static string _outputPath;\r\n\r\n    [MenuItem(\"Tools/I18n Export\")]\r\n    public static void Run()\r\n    {\r\n        Load();\r\n        Scan();\r\n        Export();\r\n    }\r\n\r\n    private static void Load()\r\n    {\r\n        _outputPath = Application.dataPath + \"/Game/@Lua/Game/Common/i18n.lua\";\r\n        ignorePath = new List<string>()\r\n        {\r\n            \"i18n.lua\"\r\n        };\r\n\r\n        if (File.Exists(_outputPath))\r\n        {\r\n            _markDatas = new Dictionary<string, Dictionary<string, string>>();\r\n            _markFiles = new Dictionary<string, string>();\r\n\r\n            StreamReader sr = new StreamReader(_outputPath, Encoding.UTF8);\r\n            string line;\r\n            Dictionary<string, string> markDic = null;\r\n            while ((line = sr.ReadLine()) != null)\r\n            {\r\n                if (line.StartsWith(\"i18n[\"))\r\n                {\r\n                    int startIdx = line.LastIndexOf(\"i18n[\\\"\") + 6;\r\n                    int endIdx = line.IndexOf(\"\\\"]\");\r\n                    string key = line.Substring(startIdx, endIdx - startIdx);\r\n\r\n                    startIdx = line.LastIndexOf(\"= \\\"\") + 3;\r\n                    endIdx = line.LastIndexOf(\"\\\"\");\r\n                    string value = line.Substring(startIdx, endIdx - startIdx);\r\n                    markDic.Add(value,string.Format(\"i18n[\\\"{0}\\\"]\",key));\r\n\r\n                    _markId = Mathf.Max(_markId, int.Parse(key));\r\n                }\r\n                else if (line.StartsWith(\"--# \"))\r\n                {\r\n                    int startIdx = line.IndexOf(\"--# \") + 4;\r\n                    int endIdx = line.LastIndexOf(\".lua\") + 4;\r\n                    string fileName = line.Substring(startIdx, endIdx - startIdx);\r\n\r\n                    _markDatas.Add(fileName, new Dictionary<string, string>());\r\n                    markDic = _markDatas[fileName];\r\n                }\r\n            }\r\n            sr.Close();\r\n            sr.Dispose();\r\n        }\r\n        else\r\n        {\r\n            _markDatas = new Dictionary<string, Dictionary<string, string>>();\r\n            _markFiles = new Dictionary<string, string>();\r\n            _markId = 1000;\r\n        }\r\n    }\r\n\r\n    private static void Scan()\r\n    {\r\n        Helper.forEachHandle(Application.dataPath + \"/Game/@Lua\", new List<string> { \"lua\" }, (string filePath) =>\r\n        {\r\n            string basePath = Path.GetFileName(filePath);\r\n            if (ignorePath.Contains(basePath)) return;\r\n\r\n            Dictionary<string, string> markDic = null; //标记字典\r\n            if (!_markDatas.ContainsKey(basePath))\r\n            {\r\n                markDic = new Dictionary<string, string>();\r\n                _markDatas.Add(basePath, markDic);\r\n            }\r\n            else\r\n            {\r\n                markDic = _markDatas[basePath];\r\n            }\r\n\r\n            using (StreamReader sr = new StreamReader(filePath, Encoding.UTF8))\r\n            {\r\n                string line;\r\n                StringBuilder content = new StringBuilder();\r\n                while ((line = sr.ReadLine()) != null)\r\n                {\r\n                    StringBuilder newLine = new StringBuilder();\r\n                    StringBuilder markKey = new StringBuilder();\r\n                    bool isMarking = false;\r\n                    char[] chars = line.ToCharArray();\r\n                    for (int i = 0; i < chars.Length; i++)\r\n                    {\r\n                        char c = chars[i];\r\n                        bool _isReset = false;\r\n                        if (c == '\"' && chars[i - 1] != '\\\\')\r\n                        {\r\n                            isMarking = !isMarking;\r\n                            if (isMarking == false) //结束标记\r\n                            {\r\n                                string markKeyString = markKey.ToString();\r\n                                \r\n                                if (isChinese(markKeyString))\r\n                                {\r\n                                    string holder = getHolder(basePath, markKeyString);\r\n                                    if (!markDic.ContainsKey(markKeyString))\r\n                                        markDic.Add(markKeyString, holder);\r\n\r\n                                    newLine.Append(holder);\r\n                                    _isReset = true;\r\n                                }\r\n                                else //不是中文\r\n                                {\r\n                                    newLine.Append('\"').Append(markKeyString);\r\n                                }\r\n                                markKey = new StringBuilder(); //清空\r\n                            }\r\n                        }\r\n                        else\r\n                        {\r\n                            if (isMarking)\r\n                            {\r\n                                markKey.Append(c);\r\n                            }\r\n                        }\r\n                        if (!isMarking && !_isReset)\r\n                        {\r\n                            newLine.Append(c);\r\n                        }\r\n                    }\r\n                    content.Append(newLine).Append('\\n');\r\n                }\r\n\r\n                if (markDic.Count > 0)\r\n                {\r\n                    _markFiles.Add(filePath, content.ToString());\r\n                }\r\n                sr.Close();\r\n            }\r\n        });\r\n\r\n    }\r\n\r\n    private static void Export()\r\n    {\r\n        StringBuilder i18n = new StringBuilder();\r\n        i18n.Append(\"local i18n = {}\\n\");\r\n\r\n        foreach (string fileName in _markDatas.Keys)\r\n        {\r\n            if(_markDatas[fileName].Count > 0)\r\n            {\r\n                i18n.AppendFormat(\"--# {0}\\n\", fileName);\r\n            }\r\n            foreach(string chinese in _markDatas[fileName].Keys)\r\n            {\r\n                i18n.AppendFormat(\"{0} = \\\"{1}\\\"\\n\", _markDatas[fileName][chinese], chinese);\r\n            }\r\n        }\r\n        i18n.Append(\"\\nLDeclare(\\\"i18n\\\", i18n)\\n\");\r\n        i18n.Append(\"return i18n\\n\");\r\n\r\n        using (FileStream fs = new FileStream(_outputPath, FileMode.Create))\r\n        {\r\n            StreamWriter sw = new StreamWriter(fs);\r\n            sw.Write(i18n.ToString());\r\n            sw.Flush();\r\n            sw.Close();\r\n            fs.Close();\r\n        }\r\n\r\n        foreach (string filePath in _markFiles.Keys)\r\n        {\r\n            using (FileStream fs = new FileStream(filePath, FileMode.Create))\r\n            {\r\n                StreamWriter sw = new StreamWriter(fs);\r\n                sw.Write(_markFiles[filePath]);\r\n                sw.Flush();\r\n                sw.Close();\r\n                fs.Close();\r\n            }  \r\n        }\r\n\r\n        AssetDatabase.Refresh();\r\n        Debug.Log(\"导出完成 \" + _outputPath);\r\n    }\r\n\r\n    private static string getHolder(string fileName ,string chinese)\r\n    {\r\n        Dictionary<string, string> dic = _markDatas[fileName];\r\n        if (!dic.ContainsKey(chinese))\r\n        {\r\n            _markId++;\r\n            dic.Add(chinese,string.Format(\"i18n[\\\"{0}\\\"]\",_markId.ToString()));\r\n        }\r\n        return dic[chinese];\r\n    }\r\n\r\n    private static bool isChinese(string text)\r\n    {\r\n        bool hasChinese = false;\r\n        char[] c = text.ToCharArray();\r\n        int len = c.Length;\r\n        for (int i = 0; i < len; i++)\r\n        {\r\n            if (c[i] >= 0x4e00 && c[i] <= 0x9fbb)\r\n            {\r\n                hasChinese = true;\r\n                break;\r\n            }\r\n        }\r\n        return hasChinese;\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Editor/I18nExporter/I18nExporter.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c2b26f6664b1b7945aa35eb2065410f4\ntimeCreated: 1479285206\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/I18nExporter.meta",
    "content": "fileFormatVersion: 2\nguid: 9c4941af0a98cb545b673822c2777637\nfolderAsset: yes\ntimeCreated: 1479526088\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/MakeDebugFile.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.Events;\r\nusing System.Collections.Generic;\r\nusing UnityEditor;\r\nusing System.IO;\r\nusing System;\r\n\r\npublic class MakeDebugFile : Editor\r\n{\r\n    public static string luajitPath = Application.dataPath + \"/../build/luajit-2.0.4/src\";\r\n\r\n    //[MenuItem(\"Tools/Copy\")]\r\n    public static void CopyLuaTxt() {\r\n\r\n        string fromUrl = Application.dataPath + \"/Game/@Lua\";\r\n        string toUrl = Application.dataPath + \"/Game/Resources/@Lua\";\r\n\r\n\t\tAssetDatabase.DeleteAsset (\"Assets/Game/Resources/@Lua\");\r\n        Directory.CreateDirectory(toUrl);\r\n\r\n\t\tCopyAndChangeDirectory(fromUrl, toUrl,new List<string>{\".lua\"});\r\n        AssetDatabase.Refresh();\r\n        Debug.Log(\"copy finish:\" + toUrl);\r\n    }\r\n\r\n    //[MenuItem(\"Tools/test\")]\r\n    //public static void Test()\r\n    //{\r\n    //    TextAsset textAsset = AssetDatabase.LoadAssetAtPath<TextAsset>(\"Assets/test.txt\");\r\n\r\n    //    byte[] encrypts = LUtil.AESEncrypt(textAsset.bytes,LGameConfig.EncryptKey32,\"1234567890123456\");\r\n    //    byte[] content = LUtil.AESDecrypt(encrypts, LGameConfig.EncryptKey32, \"1234567890123456\");\r\n\r\n    //    Debug.Log(System.Text.Encoding.UTF8.GetString(content));\r\n    //}\r\n\r\n    [MenuItem(\"Tools/Edit Atlas Suffix\")]\r\n    public static void EditAtlasSuffix()\r\n    {\r\n        string basePath = Application.dataPath + \"/Game/Resources/Atlas\";\r\n        Helper.forEachHandle(basePath, new List<string>{\"txt\",\"tpsheet\"}, (string path) =>\r\n        {\r\n\t\t\t\t\r\n            string[] name_splits = path.Split('.');\r\n            string ext = name_splits[name_splits.Length - 1];\r\n            if(ext == \"tpsheet\")\r\n            {\r\n                File.Move(name_splits[0] + \".tpsheet\", name_splits[0] + \".txt\");\r\n            }\r\n            else\r\n            {\r\n                File.Move(name_splits[0] + \".txt\", name_splits[0] + \".tpsheet\");\r\n            }\r\n        });\r\n        AssetDatabase.Refresh();\r\n        Debug.Log(\"Atlas后缀修改完成\");\r\n    }\r\n\r\n\tpublic static void CopyAndChangeDirectory(string sourceDirName, string destDirName,List<string> exts)\r\n    {\r\n        try\r\n        {\r\n            if (!Directory.Exists(destDirName))\r\n            {\r\n                Directory.CreateDirectory(destDirName);\r\n                File.SetAttributes(destDirName, File.GetAttributes(sourceDirName));\r\n            }\r\n\r\n            if (destDirName[destDirName.Length - 1] != Path.DirectorySeparatorChar)\r\n                destDirName = destDirName + Path.DirectorySeparatorChar;\r\n\r\n            string[] files = Directory.GetFiles(sourceDirName);\r\n            foreach (string file in files)\r\n            {\r\n                //if (File.Exists(destDirName + Path.GetFileName(file)))\r\n                //    continue;\r\n\t\t\t\tif (file.EndsWith(\"meta\"))\r\n                    continue;\r\n\r\n                string destFileName = destDirName + Path.GetFileName(file);\r\n                if (exts.Contains(Path.GetExtension(file)))\r\n                {\r\n                    if (LGameConfig.GetInstance().isEncrypt)\r\n                    {\r\n                        destFileName = destDirName + Path.GetFileNameWithoutExtension(file) + \".bytes\";\r\n                        //luajit\r\n                        Helper.RunCmd(luajitPath + \"/luajit.exe\", string.Format(\"-b {0} {1}\", file, destFileName), luajitPath);\r\n                        ////encrypt\r\n\r\n                        //FileStream fr = new FileStream(destFileName, FileMode.Open);\r\n                        //byte[] encryptStrs = new byte[fr.Length];\r\n                        //fr.Read(encryptStrs, 0, encryptStrs.Length);\r\n                        //fr.Close();\r\n\r\n                        //FileStream fs = new FileStream(destFileName, FileMode.Create);\r\n                        //fs.Write(encryptStrs, 0, encryptStrs.Length);\r\n                        //fs.Flush();\r\n                        //fs.Close();\r\n                    }\r\n                    else\r\n                    {\r\n                        destFileName = destDirName + Path.GetFileNameWithoutExtension(file) + \".txt\";\r\n                        File.Copy(file, destFileName, true);\r\n                    }\r\n                }\r\n                else\r\n                {\r\n                    File.Copy(file, destFileName, true);\r\n                }\r\n                File.SetAttributes(destFileName, FileAttributes.Normal);\r\n            }\r\n\r\n            string[] dirs = Directory.GetDirectories(sourceDirName);\r\n            foreach (string dir in dirs)\r\n            {\r\n\t\t\t\tCopyAndChangeDirectory(dir, destDirName + Path.GetFileName(dir),exts);\r\n            }\r\n        }\r\n        catch (Exception ex)\r\n        {\r\n            Debug.Log(ex.Message);\r\n        }\r\n    }\r\n\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Editor/MakeDebugFile.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 5bb958e901dce9145a21802afa3038c0\ntimeCreated: 1470478793\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/TexturePackerImporter/SettingsTexturePackerImporter.txt",
    "content": "version: 2\r\nimportPivots: 1\r\ntpsheetFileNames:\r\n- Assets/codeandweb.com/Example/SpriteSheet/sprites.tpsheet\r\ntextureFileNames:\r\n- Assets/codeandweb.com/Example/SpriteSheet/sprites.png\r\nnormalmapFileNames:\r\n- Assets/codeandweb.com/Example/SpriteSheet/sprites_n.png\r\n"
  },
  {
    "path": "Assets/Game/Editor/TexturePackerImporter/SettingsTexturePackerImporter.txt.meta",
    "content": "fileFormatVersion: 2\nguid: df6f73f5fa571dd48b8c6bd40825fa11\ntimeCreated: 1475288740\nlicenseType: Free\nTextScriptImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/TexturePackerImporter/TexturePackerImporter.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEditor;\r\nusing System.IO;\r\nusing System.Text;\r\nusing System.Collections.Generic;\r\n\r\npublic class TexturePackerImporter : Editor {\r\n\r\n    [MenuItem(\"Tools/Atlas Build\")]\r\n    public static void Build()\r\n    {\r\n        CreateAtlas();\r\n        MakeSprites();\r\n    }\r\n\r\n    protected static void CreateAtlas()\r\n    {\r\n        //选择并设置TP命令行的参数和参数值\r\n        string args = \" --sheet {0}.png --data {1}.txt --format unity-texture2d --trim-mode None --pack-mode Best  --algorithm MaxRects --max-size 2048 --size-constraints POT  --disable-rotation --scale 1 {2}\";\r\n        string inputPath = string.Format(\"{0}/Game/Images\", Application.dataPath);//小图目录\r\n\r\n        string[] paths = Directory.GetDirectories(inputPath);\r\n        foreach(string path in paths)\r\n        {\r\n            StringBuilder sb = new StringBuilder(\"\");\r\n            string[] files = Directory.GetFiles(path);\r\n            foreach(string file in files)\r\n            {\r\n                if(file.EndsWith(\".png\") || file.EndsWith(\".jpg\"))\r\n                {\r\n                    sb.Append(file);\r\n                    sb.Append(\" \");\r\n                }\r\n            }\r\n            string name = Path.GetFileName(path);\r\n            string sheetPath = string.Format(\"{0}/Game/Resources/Atlas/{1}\", Application.dataPath, name);//用TP打包好的图集存放目录\r\n            Helper.RunCmd(\"D:/TexturePacker/bin/TexturePacker.exe\", string.Format(args, sheetPath, sheetPath, sb.ToString()), \"\");\r\n            Debug.Log(\"生成图集:\" + sheetPath);\r\n        }\r\n        AssetDatabase.Refresh();\r\n    }\r\n\r\n    protected static void MakeSprites()\r\n    {\r\n        string atlasPath = string.Format(\"{0}/Game/Resources/Atlas\", Application.dataPath);\r\n        string[] files = Directory.GetFiles(atlasPath);\r\n        foreach(string file in files)\r\n        {\r\n            if (file.EndsWith(\".txt\"))\r\n            {\r\n                Texture2D texture = AssetDatabase.LoadAssetAtPath<Texture2D>(file.Replace(Application.dataPath, \"Assets\").Split('.')[0] + \".png\");\r\n                TextAsset textAsset = AssetDatabase.LoadAssetAtPath<TextAsset>(file.Replace(Application.dataPath, \"Assets\"));\r\n                string[] lineArray = textAsset.text.Split(new char[] { '\\n' });\r\n\r\n                Dictionary<string, Vector4> tIpterMap = new Dictionary<string, Vector4>();\r\n                TextureImporter asetImp = GetTextureIpter(texture);\r\n                SaveBoreder(tIpterMap, asetImp);\r\n                \r\n                List<SpriteMetaData> metaDatas = new List<SpriteMetaData>();\r\n                for (int i = 0; i < lineArray.Length; i++)\r\n                {\r\n                    if ((lineArray[i].IndexOf('#') == -1) && (lineArray[i].IndexOf(':') == -1))\r\n                    {\r\n                        lineArray[i] = lineArray[i].Replace(\"\\r\", \"\");\r\n                        if ((lineArray[i] != \"\"))\r\n                        {\r\n                            string[] str = lineArray[i].Split(new char[] { ';' });\r\n\r\n                            SpriteMetaData metaData = new SpriteMetaData();\r\n                            metaData.name = str[0];\r\n                            metaData.rect = new Rect(\r\n                                float.Parse(str[1]),\r\n                                float.Parse(str[2]),\r\n                                float.Parse(str[3]),\r\n                                float.Parse(str[4]));\r\n                            metaData.pivot = new Vector2(0.5f, 0.5f);\r\n                            if (tIpterMap.ContainsKey(metaData.name)) //保存九宫格数据\r\n                            {\r\n                                metaData.border = tIpterMap[metaData.name];\r\n                            }\r\n                            metaDatas.Add(metaData);\r\n                        }\r\n                    }\r\n                }\r\n                asetImp.spritesheet = metaDatas.ToArray();\r\n                asetImp.textureType = TextureImporterType.Sprite;\r\n                asetImp.spriteImportMode = SpriteImportMode.Multiple;\r\n                asetImp.mipmapEnabled = false;\r\n                asetImp.SaveAndReimport();\r\n\r\n                AssetDatabase.DeleteAsset(file.Replace(Application.dataPath, \"Assets\"));\r\n            } \r\n        }\r\n    }\r\n\r\n    //如果这张图集已经拉好了9宫格，需要先保存起来\r\n    protected static void SaveBoreder(Dictionary<string, Vector4> tIpterMap, TextureImporter tIpter)\r\n    {\r\n        for (int i = 0, size = tIpter.spritesheet.Length; i < size; i++)\r\n        {\r\n            tIpterMap.Add(tIpter.spritesheet[i].name, tIpter.spritesheet[i].border);\r\n        }\r\n    }\r\n\r\n    protected static TextureImporter GetTextureIpter(Texture2D texture)\r\n    {\r\n        TextureImporter textureIpter = null;\r\n        string impPath = AssetDatabase.GetAssetPath(texture);\r\n        textureIpter = TextureImporter.GetAtPath(impPath) as TextureImporter;\r\n        return textureIpter;\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Editor/TexturePackerImporter/TexturePackerImporter.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 1164d51e0c6d5ec4cabeb4c8a1ad7399\ntimeCreated: 1475288614\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor/TexturePackerImporter.meta",
    "content": "fileFormatVersion: 2\nguid: 5e7cbf6a101751b46a61ec6fcdaf74a8\nfolderAsset: yes\ntimeCreated: 1470452684\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Editor.meta",
    "content": "fileFormatVersion: 2\nguid: cbec7ab89fb11e547abc9b009e8ffef3\nfolderAsset: yes\ntimeCreated: 1451462546\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/common/ctlv_bg.png.meta",
    "content": "fileFormatVersion: 2\nguid: d8d4e984467472f41ba638b478aeff80\ntimeCreated: 1475290841\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/common/ctlv_joy.png.meta",
    "content": "fileFormatVersion: 2\nguid: ad8ffcca49584c04cab19fe55e06f829\ntimeCreated: 1475290841\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/common/img_cat.png.meta",
    "content": "fileFormatVersion: 2\nguid: 9ab0257ab97f5e24e8e941e0db884c2b\ntimeCreated: 1475290841\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/common/progress_bar.jpg.meta",
    "content": "fileFormatVersion: 2\nguid: df8f3cb38bf73464e8dd48c7eddebf7f\ntimeCreated: 1478518828\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  spriteTessellationDetail: -1\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    serializedVersion: 2\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/common.meta",
    "content": "fileFormatVersion: 2\nguid: b2b3ac64d2468e840890d907dac9674a\nfolderAsset: yes\ntimeCreated: 1475290770\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0101.png.meta",
    "content": "fileFormatVersion: 2\nguid: 27b5249286dedcb4f8472da72324028f\ntimeCreated: 1475290651\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0102.png.meta",
    "content": "fileFormatVersion: 2\nguid: 48feb112c2d43c343a11a6969b8d511f\ntimeCreated: 1475290651\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0103.png.meta",
    "content": "fileFormatVersion: 2\nguid: 769bafe28f6138946b8b96ba364d2d10\ntimeCreated: 1475290651\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0201.png.meta",
    "content": "fileFormatVersion: 2\nguid: ff9c9677a194d3f46b85fd3289ab6f6f\ntimeCreated: 1475290748\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0202.png.meta",
    "content": "fileFormatVersion: 2\nguid: 90c4c47701f497847899ee4acf198361\ntimeCreated: 1475290748\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face/0203.png.meta",
    "content": "fileFormatVersion: 2\nguid: 1bfa89fb2f4b81b46a8b18d31c50d2b2\ntimeCreated: 1475290747\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/face.meta",
    "content": "fileFormatVersion: 2\nguid: d49f9a80226fb2d43889709c0ddb1998\nfolderAsset: yes\ntimeCreated: 1475290679\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/+.png.meta",
    "content": "fileFormatVersion: 2\nguid: ee4d297ad55eb6642be52b8ad7ce597f\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/-.png.meta",
    "content": "fileFormatVersion: 2\nguid: b73574b7669bab942b875279e4e01fd4\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/0.png.meta",
    "content": "fileFormatVersion: 2\nguid: 448be106794026d4891045dead0b0c10\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/1.png.meta",
    "content": "fileFormatVersion: 2\nguid: bb2a46b41f14fd043b2a15cc3afa89a5\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/2.png.meta",
    "content": "fileFormatVersion: 2\nguid: a920a31557130fd4392ed11cc4f5cde4\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/3.png.meta",
    "content": "fileFormatVersion: 2\nguid: f78572fbf789e764ab689fdb9a6678a5\ntimeCreated: 1475288827\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/4.png.meta",
    "content": "fileFormatVersion: 2\nguid: effdadaa3f670864aa1a1ad924b2c84c\ntimeCreated: 1475288827\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/5.png.meta",
    "content": "fileFormatVersion: 2\nguid: bedb6fccbfc4ada4795c4974b5e1d5d1\ntimeCreated: 1475288826\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/6.png.meta",
    "content": "fileFormatVersion: 2\nguid: 0137ba463e7d2af4185c175cbb5d7ef9\ntimeCreated: 1475288825\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/7.png.meta",
    "content": "fileFormatVersion: 2\nguid: 007f51b12131499408d8eb1e966f4a13\ntimeCreated: 1475288824\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/8.png.meta",
    "content": "fileFormatVersion: 2\nguid: 1e442073bd5a83540831526cf6b8ffba\ntimeCreated: 1475288825\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num/9.png.meta",
    "content": "fileFormatVersion: 2\nguid: 3ea6ceaf13333284abeb18992f0d00da\ntimeCreated: 1475288825\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName: {}\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: -1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: -1\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images/num.meta",
    "content": "fileFormatVersion: 2\nguid: 61bceac2d08e72a43927a6ca2b73ceda\nfolderAsset: yes\ntimeCreated: 1475288820\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Images.meta",
    "content": "fileFormatVersion: 2\nguid: 5e1f5b75292887f448e6bc8a4d02f65d\nfolderAsset: yes\ntimeCreated: 1475288778\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Models/CubeMap.mat.meta",
    "content": "fileFormatVersion: 2\nguid: d57775a52c3b77a4fa822d2cbe1b6e28\ntimeCreated: 1470559566\nlicenseType: Free\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Models/CubeMap.shader",
    "content": "﻿Shader \"Example/CubeMap\" {\n\tProperties{\n\t\t_MainTex(\"Texture\",2D) = \"white\" {}\n\t\t_BumpMap(\"Bumpmap\",2D) = \"bump\" {}\n\t\t_Cube(\"Cubemap\",CUBE) = \"\" {}\n\t}\n\tSubShader{\n\t\tTags {\"RenderType\"=\"Opaque\"}\n\t\tCGPROGRAM\n#pragma surface surf Lambert\n\t\tstruct Input {\n\t\t\tfloat2 uv_BumpMap;\n\t\t\tfloat2 uv_MainTex;\n\t\t\tfloat3 worldRefl;\n\t\t\tINTERNAL_DATA\n\t\t};\n\t\tsampler2D _MainTex;\n\t\tsampler2D _BumpMap;\n\t\tsamplerCUBE _Cube;\n\n\t\tvoid surf(Input IN, inout SurfaceOutput o) {\n\t\t\to.Albedo = tex2D(_MainTex, IN.uv_MainTex) * 0.5; \n\t\t\to.Normal = UnpackNormal(tex2D(_BumpMap, IN.uv_BumpMap));\n\t\t\to.Emission = texCUBE(_Cube, WorldReflectionVector(IN,o.Normal));\n\t\t}\n\t\tENDCG\n\t}\n\tFallback \"Diffuse\"\n}\n"
  },
  {
    "path": "Assets/Game/Models/CubeMap.shader.meta",
    "content": "fileFormatVersion: 2\nguid: df77af1b98a2cfc4faf9c1f500bf7f4e\ntimeCreated: 1470559566\nlicenseType: Free\nShaderImporter:\n  defaultTextures: []\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/TeddyBear_color.mat.meta",
    "content": "fileFormatVersion: 2\r\nguid: 5170bca6033460448afb5938543ca8b1\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/TeddyBear_color.tga.meta",
    "content": "fileFormatVersion: 2\r\nguid: 13ec991b6199ff54085108d33af49c79\r\nTextureImporter:\r\n  fileIDToRecycleName: {}\r\n  serializedVersion: 2\r\n  mipmaps:\r\n    mipMapMode: 0\r\n    enableMipMap: 1\r\n    linearTexture: 0\r\n    correctGamma: 0\r\n    fadeOut: 0\r\n    borderMipMap: 0\r\n    mipMapFadeDistanceStart: 1\r\n    mipMapFadeDistanceEnd: 3\r\n  bumpmap:\r\n    convertToNormalMap: 0\r\n    externalNormalMap: 0\r\n    heightScale: .25\r\n    normalMapFilter: 0\r\n  isReadable: 0\r\n  grayScaleToAlpha: 0\r\n  generateCubemap: 0\r\n  cubemapConvolution: 0\r\n  cubemapConvolutionSteps: 8\r\n  cubemapConvolutionExponent: 1.5\r\n  seamlessCubemap: 0\r\n  textureFormat: -1\r\n  maxTextureSize: 256\r\n  textureSettings:\r\n    filterMode: -1\r\n    aniso: -1\r\n    mipBias: -1\r\n    wrapMode: -1\r\n  nPOTScale: 1\r\n  lightmap: 0\r\n  rGBM: 0\r\n  compressionQuality: 50\r\n  allowsAlphaSplitting: 0\r\n  spriteMode: 0\r\n  spriteExtrude: 1\r\n  spriteMeshType: 1\r\n  alignment: 0\r\n  spritePivot: {x: .5, y: .5}\r\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\r\n  spritePixelsToUnits: 100\r\n  alphaIsTransparency: 0\r\n  textureType: -1\r\n  buildTargetSettings: []\r\n  spriteSheet:\r\n    sprites: []\r\n  spritePackingTag: \r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/Teddy_DIF.mat.meta",
    "content": "fileFormatVersion: 2\r\nguid: ed769c2e0ccae0f4c95e3494f3bdbecf\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/Teddy_DIF.psd.meta",
    "content": "fileFormatVersion: 2\r\nguid: e03df07cc0e635c449f2d796328840ad\r\nTextureImporter:\r\n  fileIDToRecycleName: {}\r\n  serializedVersion: 2\r\n  mipmaps:\r\n    mipMapMode: 0\r\n    enableMipMap: 1\r\n    linearTexture: 0\r\n    correctGamma: 0\r\n    fadeOut: 0\r\n    borderMipMap: 0\r\n    mipMapFadeDistanceStart: 1\r\n    mipMapFadeDistanceEnd: 3\r\n  bumpmap:\r\n    convertToNormalMap: 0\r\n    externalNormalMap: 0\r\n    heightScale: .25\r\n    normalMapFilter: 0\r\n  isReadable: 0\r\n  grayScaleToAlpha: 0\r\n  generateCubemap: 0\r\n  cubemapConvolution: 0\r\n  cubemapConvolutionSteps: 8\r\n  cubemapConvolutionExponent: 1.5\r\n  seamlessCubemap: 0\r\n  textureFormat: -1\r\n  maxTextureSize: 256\r\n  textureSettings:\r\n    filterMode: -1\r\n    aniso: -1\r\n    mipBias: -1\r\n    wrapMode: -1\r\n  nPOTScale: 1\r\n  lightmap: 0\r\n  rGBM: 0\r\n  compressionQuality: 50\r\n  allowsAlphaSplitting: 0\r\n  spriteMode: 0\r\n  spriteExtrude: 1\r\n  spriteMeshType: 1\r\n  alignment: 0\r\n  spritePivot: {x: .5, y: .5}\r\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\r\n  spritePixelsToUnits: 100\r\n  alphaIsTransparency: 0\r\n  textureType: -1\r\n  buildTargetSettings: []\r\n  spriteSheet:\r\n    sprites: []\r\n  spritePackingTag: \r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/Teddy_Eye.mat.meta",
    "content": "fileFormatVersion: 2\r\nguid: f5b7e16e3bc986144bb38e058ac7516b\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials/Teddy_Eye.psd.meta",
    "content": "fileFormatVersion: 2\r\nguid: d7540a3a54457354bb75b58f978f763c\r\nTextureImporter:\r\n  fileIDToRecycleName: {}\r\n  serializedVersion: 2\r\n  mipmaps:\r\n    mipMapMode: 0\r\n    enableMipMap: 1\r\n    linearTexture: 0\r\n    correctGamma: 0\r\n    fadeOut: 0\r\n    borderMipMap: 0\r\n    mipMapFadeDistanceStart: 1\r\n    mipMapFadeDistanceEnd: 3\r\n  bumpmap:\r\n    convertToNormalMap: 0\r\n    externalNormalMap: 0\r\n    heightScale: .25\r\n    normalMapFilter: 0\r\n  isReadable: 0\r\n  grayScaleToAlpha: 0\r\n  generateCubemap: 0\r\n  cubemapConvolution: 0\r\n  cubemapConvolutionSteps: 8\r\n  cubemapConvolutionExponent: 1.5\r\n  seamlessCubemap: 0\r\n  textureFormat: -1\r\n  maxTextureSize: 64\r\n  textureSettings:\r\n    filterMode: -1\r\n    aniso: -1\r\n    mipBias: -1\r\n    wrapMode: -1\r\n  nPOTScale: 1\r\n  lightmap: 0\r\n  rGBM: 0\r\n  compressionQuality: 50\r\n  allowsAlphaSplitting: 0\r\n  spriteMode: 0\r\n  spriteExtrude: 1\r\n  spriteMeshType: 1\r\n  alignment: 0\r\n  spritePivot: {x: .5, y: .5}\r\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\r\n  spritePixelsToUnits: 100\r\n  alphaIsTransparency: 0\r\n  textureType: -1\r\n  buildTargetSettings: []\r\n  spriteSheet:\r\n    sprites: []\r\n  spritePackingTag: \r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Materials.meta",
    "content": "fileFormatVersion: 2\r\nguid: 5fe267c58209a394b8d6b55e791e2051\r\nfolderAsset: yes\r\ntimeCreated: 1451461408\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Teddy.controller.meta",
    "content": "fileFormatVersion: 2\r\nguid: 17ca7bb459b01f2489da46de7962d709\r\ntimeCreated: 1451883534\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/Teddy.fbx.meta",
    "content": "fileFormatVersion: 2\r\nguid: 5eb27fd0b014c9847ad0ce07b511ac21\r\ntimeCreated: 1451461409\r\nlicenseType: Free\r\nModelImporter:\r\n  serializedVersion: 18\r\n  fileIDToRecycleName:\r\n    100000: Bip001\r\n    100002: Bip001 Footsteps\r\n    100004: Bip001 Head\r\n    100006: Bip001 HeadNub\r\n    100008: Bip001 L Calf\r\n    100010: Bip001 L Clavicle\r\n    100012: Bip001 L Finger0\r\n    100014: Bip001 L Finger0Nub\r\n    100016: Bip001 L Foot\r\n    100018: Bip001 L Forearm\r\n    100020: Bip001 L Hand\r\n    100022: Bip001 L Thigh\r\n    100024: Bip001 L Toe0\r\n    100026: Bip001 L Toe01\r\n    100028: Bip001 L Toe02\r\n    100030: Bip001 L Toe0Nub\r\n    100032: Bip001 L UpperArm\r\n    100034: Bip001 Neck\r\n    100036: Bip001 Pelvis\r\n    100038: Bip001 R Calf\r\n    100040: Bip001 R Clavicle\r\n    100042: Bip001 R Finger0\r\n    100044: Bip001 R Finger0Nub\r\n    100046: Bip001 R Foot\r\n    100048: Bip001 R Forearm\r\n    100050: Bip001 R Hand\r\n    100052: Bip001 R Thigh\r\n    100054: Bip001 R Toe0\r\n    100056: Bip001 R Toe01\r\n    100058: Bip001 R Toe02\r\n    100060: Bip001 R Toe0Nub\r\n    100062: Bip001 R UpperArm\r\n    100064: Bip001 Spine\r\n    100066: Bip001 Spine1\r\n    100068: Bip001 Spine2\r\n    100070: Bip001 Spine3\r\n    100072: Eye_Left\r\n    100074: Eye_Right\r\n    100076: //RootNode\r\n    100078: Teddy_Body\r\n    400000: Bip001\r\n    400002: Bip001 Footsteps\r\n    400004: Bip001 Head\r\n    400006: Bip001 HeadNub\r\n    400008: Bip001 L Calf\r\n    400010: Bip001 L Clavicle\r\n    400012: Bip001 L Finger0\r\n    400014: Bip001 L Finger0Nub\r\n    400016: Bip001 L Foot\r\n    400018: Bip001 L Forearm\r\n    400020: Bip001 L Hand\r\n    400022: Bip001 L Thigh\r\n    400024: Bip001 L Toe0\r\n    400026: Bip001 L Toe01\r\n    400028: Bip001 L Toe02\r\n    400030: Bip001 L Toe0Nub\r\n    400032: Bip001 L UpperArm\r\n    400034: Bip001 Neck\r\n    400036: Bip001 Pelvis\r\n    400038: Bip001 R Calf\r\n    400040: Bip001 R Clavicle\r\n    400042: Bip001 R Finger0\r\n    400044: Bip001 R Finger0Nub\r\n    400046: Bip001 R Foot\r\n    400048: Bip001 R Forearm\r\n    400050: Bip001 R Hand\r\n    400052: Bip001 R Thigh\r\n    400054: Bip001 R Toe0\r\n    400056: Bip001 R Toe01\r\n    400058: Bip001 R Toe02\r\n    400060: Bip001 R Toe0Nub\r\n    400062: Bip001 R UpperArm\r\n    400064: Bip001 Spine\r\n    400066: Bip001 Spine1\r\n    400068: Bip001 Spine2\r\n    400070: Bip001 Spine3\r\n    400072: Eye_Left\r\n    400074: Eye_Right\r\n    400076: //RootNode\r\n    400078: Teddy_Body\r\n    4300000: Eye_Left\r\n    4300002: Eye_Right\r\n    4300004: Teddy_Body\r\n    7400000: run\r\n    7400002: atk\r\n    7400004: idle\r\n    9500000: //RootNode\r\n    13700000: Eye_Left\r\n    13700002: Eye_Right\r\n    13700004: Teddy_Body\r\n  materials:\r\n    importMaterials: 1\r\n    materialName: 0\r\n    materialSearch: 1\r\n  animations:\r\n    legacyGenerateAnimations: 4\r\n    bakeSimulation: 0\r\n    optimizeGameObjects: 0\r\n    motionNodeName: \r\n    animationImportErrors: \r\n    animationImportWarnings: \r\n    animationRetargetingWarnings: \r\n    animationDoRetargetingWarnings: 0\r\n    animationCompression: 1\r\n    animationRotationError: .5\r\n    animationPositionError: .5\r\n    animationScaleError: .5\r\n    animationWrapMode: 0\r\n    extraExposedTransformPaths: []\r\n    clipAnimations:\r\n    - serializedVersion: 16\r\n      name: run\r\n      takeName: Take 001\r\n      firstFrame: 0\r\n      lastFrame: 25\r\n      wrapMode: 0\r\n      orientationOffsetY: 0\r\n      level: 0\r\n      cycleOffset: 0\r\n      loop: 0\r\n      loopTime: 0\r\n      loopBlend: 0\r\n      loopBlendOrientation: 0\r\n      loopBlendPositionY: 0\r\n      loopBlendPositionXZ: 0\r\n      keepOriginalOrientation: 0\r\n      keepOriginalPositionY: 1\r\n      keepOriginalPositionXZ: 0\r\n      heightFromFeet: 0\r\n      mirror: 0\r\n      bodyMask: 01000000010000000100000001000000010000000100000001000000010000000100000001000000010000000100000001000000\r\n      curves: []\r\n      events: []\r\n      transformMask:\r\n      - path: \r\n        weight: 1\r\n      - path: Bip001\r\n        weight: 1\r\n      - path: Bip001/Bip001 Footsteps\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02/Bip001 L Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02/Bip001 R Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head/Bip001 HeadNub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0/Bip001 L Finger0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0/Bip001 R Finger0Nub\r\n        weight: 1\r\n      - path: Eye_Left\r\n        weight: 1\r\n      - path: Eye_Right\r\n        weight: 1\r\n      - path: Teddy_Body\r\n        weight: 1\r\n      maskType: 0\r\n      maskSource: {instanceID: 0}\r\n    - serializedVersion: 16\r\n      name: atk\r\n      takeName: Take 001\r\n      firstFrame: 25\r\n      lastFrame: 60\r\n      wrapMode: 0\r\n      orientationOffsetY: 0\r\n      level: 0\r\n      cycleOffset: 0\r\n      loop: 0\r\n      loopTime: 0\r\n      loopBlend: 0\r\n      loopBlendOrientation: 0\r\n      loopBlendPositionY: 0\r\n      loopBlendPositionXZ: 0\r\n      keepOriginalOrientation: 0\r\n      keepOriginalPositionY: 1\r\n      keepOriginalPositionXZ: 0\r\n      heightFromFeet: 0\r\n      mirror: 0\r\n      bodyMask: 01000000010000000100000001000000010000000100000001000000010000000100000001000000010000000100000001000000\r\n      curves: []\r\n      events: []\r\n      transformMask:\r\n      - path: \r\n        weight: 1\r\n      - path: Bip001\r\n        weight: 1\r\n      - path: Bip001/Bip001 Footsteps\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02/Bip001 L Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02/Bip001 R Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head/Bip001 HeadNub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0/Bip001 L Finger0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0/Bip001 R Finger0Nub\r\n        weight: 1\r\n      - path: Eye_Left\r\n        weight: 1\r\n      - path: Eye_Right\r\n        weight: 1\r\n      - path: Teddy_Body\r\n        weight: 1\r\n      maskType: 0\r\n      maskSource: {instanceID: 0}\r\n    - serializedVersion: 16\r\n      name: idle\r\n      takeName: Take 001\r\n      firstFrame: 60\r\n      lastFrame: 75\r\n      wrapMode: 0\r\n      orientationOffsetY: 0\r\n      level: 0\r\n      cycleOffset: 0\r\n      loop: 0\r\n      loopTime: 1\r\n      loopBlend: 0\r\n      loopBlendOrientation: 0\r\n      loopBlendPositionY: 0\r\n      loopBlendPositionXZ: 0\r\n      keepOriginalOrientation: 0\r\n      keepOriginalPositionY: 1\r\n      keepOriginalPositionXZ: 0\r\n      heightFromFeet: 0\r\n      mirror: 0\r\n      bodyMask: 01000000010000000100000001000000010000000100000001000000010000000100000001000000010000000100000001000000\r\n      curves: []\r\n      events: []\r\n      transformMask:\r\n      - path: \r\n        weight: 1\r\n      - path: Bip001\r\n        weight: 1\r\n      - path: Bip001/Bip001 Footsteps\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 L Thigh/Bip001 L Calf/Bip001\r\n          L Foot/Bip001 L Toe0/Bip001 L Toe01/Bip001 L Toe02/Bip001 L Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 R Thigh/Bip001 R Calf/Bip001\r\n          R Foot/Bip001 R Toe0/Bip001 R Toe01/Bip001 R Toe02/Bip001 R Toe0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 Head/Bip001 HeadNub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 L Clavicle/Bip001 L UpperArm/Bip001 L Forearm/Bip001\r\n          L Hand/Bip001 L Finger0/Bip001 L Finger0Nub\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0\r\n        weight: 1\r\n      - path: Bip001/Bip001 Pelvis/Bip001 Spine/Bip001 Spine1/Bip001 Spine2/Bip001\r\n          Spine3/Bip001 Neck/Bip001 R Clavicle/Bip001 R UpperArm/Bip001 R Forearm/Bip001\r\n          R Hand/Bip001 R Finger0/Bip001 R Finger0Nub\r\n        weight: 1\r\n      - path: Eye_Left\r\n        weight: 1\r\n      - path: Eye_Right\r\n        weight: 1\r\n      - path: Teddy_Body\r\n        weight: 1\r\n      maskType: 0\r\n      maskSource: {instanceID: 0}\r\n    isReadable: 1\r\n  meshes:\r\n    lODScreenPercentages: []\r\n    globalScale: 100\r\n    meshCompression: 0\r\n    addColliders: 0\r\n    importBlendShapes: 1\r\n    swapUVChannels: 0\r\n    generateSecondaryUV: 0\r\n    useFileUnits: 1\r\n    optimizeMeshForGPU: 1\r\n    keepQuads: 0\r\n    weldVertices: 1\r\n    secondaryUVAngleDistortion: 8\r\n    secondaryUVAreaDistortion: 15.000001\r\n    secondaryUVHardAngle: 88\r\n    secondaryUVPackMargin: 4\r\n    useFileScale: 1\r\n  tangentSpace:\r\n    normalSmoothAngle: 60\r\n    splitTangentsAcrossUV: 1\r\n    normalImportMode: 0\r\n    tangentImportMode: 1\r\n  importAnimation: 1\r\n  copyAvatar: 0\r\n  humanDescription:\r\n    human: []\r\n    skeleton: []\r\n    armTwist: .5\r\n    foreArmTwist: .5\r\n    upperLegTwist: .5\r\n    legTwist: .5\r\n    armStretch: .0500000007\r\n    legStretch: .0500000007\r\n    feetSpacing: 0\r\n    rootMotionBoneName: \r\n    hasTranslationDoF: 0\r\n  lastHumanDescriptionAvatarSource: {instanceID: 0}\r\n  animationType: 2\r\n  humanoidOversampling: 1\r\n  additionalBone: 0\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy/TeddyBear.fbx.meta",
    "content": "fileFormatVersion: 2\r\nguid: 51305fd23db2d994d9ee372ceac378c3\r\ntimeCreated: 1451461409\r\nlicenseType: Free\r\nModelImporter:\r\n  serializedVersion: 18\r\n  fileIDToRecycleName:\r\n    100000: ChestJoint01\r\n    100002: HeadJoint01\r\n    100004: HipJoint01\r\n    100006: Left_AnkleJoint01\r\n    100008: Left_ArmJoint01\r\n    100010: Left_ElbowJoint01\r\n    100012: Left_KneeJoint01\r\n    100014: Left_ShoulderJoint01\r\n    100016: Left_ThighJoint01\r\n    100018: Left_ToeJoint01\r\n    100020: Left_WristJoint01\r\n    100022: Right_AnkleJoint01\r\n    100024: Right_ArmJoint01\r\n    100026: Right_ElbowJoint01\r\n    100028: Right_KneeJoint01\r\n    100030: Right_ShoulderJoint01\r\n    100032: Right_ThighJoint01\r\n    100034: Right_ToeJoint01\r\n    100036: Right_WristJoint01\r\n    100038: RootJoint01\r\n    100040: Teddy_Bear\r\n    100042: //RootNode\r\n    400000: ChestJoint01\r\n    400002: HeadJoint01\r\n    400004: HipJoint01\r\n    400006: Left_AnkleJoint01\r\n    400008: Left_ArmJoint01\r\n    400010: Left_ElbowJoint01\r\n    400012: Left_KneeJoint01\r\n    400014: Left_ShoulderJoint01\r\n    400016: Left_ThighJoint01\r\n    400018: Left_ToeJoint01\r\n    400020: Left_WristJoint01\r\n    400022: Right_AnkleJoint01\r\n    400024: Right_ArmJoint01\r\n    400026: Right_ElbowJoint01\r\n    400028: Right_KneeJoint01\r\n    400030: Right_ShoulderJoint01\r\n    400032: Right_ThighJoint01\r\n    400034: Right_ToeJoint01\r\n    400036: Right_WristJoint01\r\n    400038: RootJoint01\r\n    400040: Teddy_Bear\r\n    400042: //RootNode\r\n    4300000: Teddy_Bear\r\n    9500000: //RootNode\r\n    13700000: Teddy_Bear\r\n  materials:\r\n    importMaterials: 1\r\n    materialName: 0\r\n    materialSearch: 1\r\n  animations:\r\n    legacyGenerateAnimations: 4\r\n    bakeSimulation: 0\r\n    optimizeGameObjects: 0\r\n    motionNodeName: \r\n    animationImportErrors: \r\n    animationImportWarnings: \r\n    animationRetargetingWarnings: \r\n    animationDoRetargetingWarnings: 0\r\n    animationCompression: 1\r\n    animationRotationError: .5\r\n    animationPositionError: .5\r\n    animationScaleError: .5\r\n    animationWrapMode: 0\r\n    extraExposedTransformPaths: []\r\n    clipAnimations: []\r\n    isReadable: 1\r\n  meshes:\r\n    lODScreenPercentages: []\r\n    globalScale: 1\r\n    meshCompression: 0\r\n    addColliders: 0\r\n    importBlendShapes: 1\r\n    swapUVChannels: 0\r\n    generateSecondaryUV: 0\r\n    useFileUnits: 1\r\n    optimizeMeshForGPU: 1\r\n    keepQuads: 0\r\n    weldVertices: 1\r\n    secondaryUVAngleDistortion: 8\r\n    secondaryUVAreaDistortion: 15.000001\r\n    secondaryUVHardAngle: 88\r\n    secondaryUVPackMargin: 4\r\n    useFileScale: 1\r\n  tangentSpace:\r\n    normalSmoothAngle: 60\r\n    splitTangentsAcrossUV: 1\r\n    normalImportMode: 0\r\n    tangentImportMode: 1\r\n  importAnimation: 1\r\n  copyAvatar: 0\r\n  humanDescription:\r\n    human: []\r\n    skeleton: []\r\n    armTwist: .5\r\n    foreArmTwist: .5\r\n    upperLegTwist: .5\r\n    legTwist: .5\r\n    armStretch: .0500000007\r\n    legStretch: .0500000007\r\n    feetSpacing: 0\r\n    rootMotionBoneName: \r\n    hasTranslationDoF: 0\r\n  lastHumanDescriptionAvatarSource: {instanceID: 0}\r\n  animationType: 2\r\n  humanoidOversampling: 1\r\n  additionalBone: 0\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Models/Teddy.meta",
    "content": "fileFormatVersion: 2\nguid: a66a4f61606a24dd3816d8e90d3a4c84\nfolderAsset: yes\ntimeCreated: 1474243881\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Models/cubemap.jpg.meta",
    "content": "fileFormatVersion: 2\nguid: 879a814d4a496da44ade1bc4d510e583\ntimeCreated: 1470559565\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName:\n    8900000: generatedCubemap\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 1\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 6\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: 1\n  nPOTScale: 1\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 0\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 0\n  textureType: 3\n  buildTargetSettings: []\n  spriteSheet:\n    sprites: []\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Models.meta",
    "content": "fileFormatVersion: 2\nguid: 2fe00afb39194574f811581265ac548e\nfolderAsset: yes\ntimeCreated: 1470558010\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Atlas/common.png.meta",
    "content": "fileFormatVersion: 2\nguid: 70d5c8ff6242c9b4eb6cb9c65da6ffec\ntimeCreated: 1479526118\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName:\n    21300000: ctlv_bg\n    21300002: ctlv_joy\n    21300004: img_cat\n    21300006: progress_bar\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 0\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: 1\n  nPOTScale: 0\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 2\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 1\n  spriteTessellationDetail: -1\n  textureType: 8\n  buildTargetSettings: []\n  spriteSheet:\n    serializedVersion: 2\n    sprites:\n    - serializedVersion: 2\n      name: ctlv_bg\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 486\n        width: 128\n        height: 128\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: ctlv_joy\n      rect:\n        serializedVersion: 2\n        x: 444\n        y: 970\n        width: 52\n        height: 52\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: img_cat\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 616\n        width: 440\n        height: 406\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: progress_bar\n      rect:\n        serializedVersion: 2\n        x: 444\n        y: 927\n        width: 17\n        height: 41\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Atlas/face.png.meta",
    "content": "fileFormatVersion: 2\nguid: 5bf4e6476f9fdb540aa7b291191d6902\ntimeCreated: 1479526119\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName:\n    21300000: 0101\n    21300002: 0102\n    21300004: 0103\n    21300006: 0201\n    21300008: 0202\n    21300010: 0203\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 0\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: 1\n  nPOTScale: 0\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 2\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 1\n  spriteTessellationDetail: -1\n  textureType: 8\n  buildTargetSettings: []\n  spriteSheet:\n    serializedVersion: 2\n    sprites:\n    - serializedVersion: 2\n      name: 0101\n      rect:\n        serializedVersion: 2\n        x: 43\n        y: 89\n        width: 38\n        height: 37\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0102\n      rect:\n        serializedVersion: 2\n        x: 42\n        y: 48\n        width: 38\n        height: 37\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0103\n      rect:\n        serializedVersion: 2\n        x: 41\n        y: 7\n        width: 38\n        height: 37\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0201\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 5\n        width: 37\n        height: 39\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0202\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 46\n        width: 38\n        height: 39\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0203\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 87\n        width: 39\n        height: 39\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Atlas/num.png.meta",
    "content": "fileFormatVersion: 2\nguid: 205b5b726328cb34e85eafe453d86ae7\ntimeCreated: 1479526119\nlicenseType: Free\nTextureImporter:\n  fileIDToRecycleName:\n    21300000: +\n    21300002: '-'\n    21300004: 0\n    21300006: 1\n    21300008: 2\n    21300010: 3\n    21300012: 4\n    21300014: 5\n    21300016: 6\n    21300018: 7\n    21300020: 8\n    21300022: 9\n  serializedVersion: 2\n  mipmaps:\n    mipMapMode: 0\n    enableMipMap: 0\n    linearTexture: 0\n    correctGamma: 0\n    fadeOut: 0\n    borderMipMap: 0\n    mipMapFadeDistanceStart: 1\n    mipMapFadeDistanceEnd: 3\n  bumpmap:\n    convertToNormalMap: 0\n    externalNormalMap: 0\n    heightScale: 0.25\n    normalMapFilter: 0\n  isReadable: 0\n  grayScaleToAlpha: 0\n  generateCubemap: 0\n  cubemapConvolution: 0\n  cubemapConvolutionSteps: 7\n  cubemapConvolutionExponent: 1.5\n  seamlessCubemap: 0\n  textureFormat: -1\n  maxTextureSize: 2048\n  textureSettings:\n    filterMode: -1\n    aniso: -1\n    mipBias: -1\n    wrapMode: 1\n  nPOTScale: 0\n  lightmap: 0\n  rGBM: 0\n  compressionQuality: 50\n  allowsAlphaSplitting: 0\n  spriteMode: 2\n  spriteExtrude: 1\n  spriteMeshType: 1\n  alignment: 0\n  spritePivot: {x: 0.5, y: 0.5}\n  spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n  spritePixelsToUnits: 100\n  alphaIsTransparency: 1\n  spriteTessellationDetail: -1\n  textureType: 8\n  buildTargetSettings: []\n  spriteSheet:\n    serializedVersion: 2\n    sprites:\n    - serializedVersion: 2\n      name: +\n      rect:\n        serializedVersion: 2\n        x: 45\n        y: 106\n        width: 42\n        height: 42\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: '-'\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 23\n        width: 39\n        height: 20\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 0\n      rect:\n        serializedVersion: 2\n        x: 45\n        y: 150\n        width: 40\n        height: 51\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 1\n      rect:\n        serializedVersion: 2\n        x: 87\n        y: 154\n        width: 31\n        height: 49\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 2\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 45\n        width: 43\n        height: 50\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 3\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 97\n        width: 41\n        height: 51\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 4\n      rect:\n        serializedVersion: 2\n        x: 47\n        y: 3\n        width: 41\n        height: 49\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 5\n      rect:\n        serializedVersion: 2\n        x: 47\n        y: 54\n        width: 40\n        height: 50\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 6\n      rect:\n        serializedVersion: 2\n        x: 45\n        y: 203\n        width: 40\n        height: 51\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 7\n      rect:\n        serializedVersion: 2\n        x: 87\n        y: 205\n        width: 37\n        height: 49\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 8\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 150\n        width: 41\n        height: 51\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    - serializedVersion: 2\n      name: 9\n      rect:\n        serializedVersion: 2\n        x: 2\n        y: 203\n        width: 41\n        height: 51\n      alignment: 0\n      pivot: {x: 0.5, y: 0.5}\n      border: {x: 0, y: 0, z: 0, w: 0}\n      outline: []\n      tessellationDetail: -1\n    outline: []\n  spritePackingTag: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Atlas.meta",
    "content": "fileFormatVersion: 2\nguid: 1234bb5c43cd5a043a28fd3a9b0be90f\nfolderAsset: yes\ntimeCreated: 1470452684\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/dungeon01.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 8dbd1e03c988b466b852e3c213eeb461\ntimeCreated: 1473296946\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/dungeon02.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: da5b1bf15a14c46ee871f8e12d327142\ntimeCreated: 1473296947\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect2.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 319014ba08d754385bdd849aa9a29567\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_bombPattern.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 0ebb5d2a52b5f42e5a7249e415ed0fbe\ntimeCreated: 1473296943\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_buttonClick.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 37aa1cc8f3b4c432eadf1c2dfccc7bea\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_clearPattern.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 484c67a70616d4650ac14756d57425b3\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_game_fail.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 17a41cc94d9094b40851ebf214613dfd\ntimeCreated: 1473296943\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_game_pass.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 2eb0b7e50b0dc48019e981d19c147dd9\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_ice.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 1892b6eb574c24e4a80aab733f2933a4\ntimeCreated: 1473296943\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_noclear.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 84f17252894a24abaaeff2b54ed95827\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_timewarning.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 9e5eb50190f324dbc9e397d6abfc2381\ntimeCreated: 1473296946\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/effect_unswap.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 6f4f592f0d9eb44c39fe687de94206d2\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/endgame.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 02ec4f2831d9646c5be607156743fe35\ntimeCreated: 1473296943\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy1_down 1.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: de49e13493a7c4d8989560d86606945c\ntimeCreated: 1473296947\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy1_down.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: d7c5ae8add6f24ef7b5075f77940b600\ntimeCreated: 1473296946\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy2_down 1.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 6bd87f4c748304d5b82b472e2a3686fc\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy2_down.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: 298ee82a478c74798bab40524cb660e7\ntimeCreated: 1473296944\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy2_out 1.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: afedb81c9dd854260a9c1fb80d53ed05\ntimeCreated: 1473296946\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy2_out.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: f0cc27073ee724b13a5bf8f9656560b0\ntimeCreated: 1473296948\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy3_down 1.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: f00612b8d5a454ce3b25236aab3c4a30\ntimeCreated: 1473296948\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios/enemy3_down.mp3.meta",
    "content": "fileFormatVersion: 2\nguid: c0bc75c264fbe4461a72d62d17f8f4ec\ntimeCreated: 1473296946\nlicenseType: Free\nAudioImporter:\n  serializedVersion: 6\n  defaultSettings:\n    loadType: 0\n    sampleRateSetting: 0\n    sampleRateOverride: 44100\n    compressionFormat: 1\n    quality: 1\n    conversionMode: 0\n  platformSettingOverrides: {}\n  forceToMono: 0\n  normalize: 1\n  preloadAudioData: 1\n  loadInBackground: 0\n  3D: 1\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Audios.meta",
    "content": "fileFormatVersion: 2\nguid: b0ec83e06ce574c03b787170c33a09b1\nfolderAsset: yes\ntimeCreated: 1473211413\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/MsgBox.prefab.meta",
    "content": "fileFormatVersion: 2\r\nguid: 24b7bba068d3d424eaf9b4f21b16b049\r\ntimeCreated: 1451470029\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/Teddy.prefab.meta",
    "content": "fileFormatVersion: 2\nguid: 569be71afa6ba4476b8594abe3b6ee39\ntimeCreated: 1474634941\nlicenseType: Free\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/WindowGridView.prefab.meta",
    "content": "fileFormatVersion: 2\r\nguid: c2e2551d2b5cfff4daad7ab7451d013f\r\ntimeCreated: 1451532866\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/grid_cell.prefab.meta",
    "content": "fileFormatVersion: 2\r\nguid: 624e758ff2c454b4ab9bb9ecca8c731b\r\ntimeCreated: 1451057882\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/list_cell.prefab.meta",
    "content": "fileFormatVersion: 2\r\nguid: 9d0b87f5fc08d4e9caff6aac5c944ecc\r\ntimeCreated: 1451053085\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/page_cell.prefab.meta",
    "content": "fileFormatVersion: 2\r\nguid: 4ab0713d48118415d9e9b6caa6eb2887\r\ntimeCreated: 1451052288\r\nlicenseType: Free\r\nNativeFormatImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/scorl_test.prefab.meta",
    "content": "fileFormatVersion: 2\nguid: 82a09130a2210442b8e527444426c941\ntimeCreated: 1473297055\nlicenseType: Free\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs/tbl_test.prefab.meta",
    "content": "fileFormatVersion: 2\nguid: 03ca883b53ff4eb4899d25acbc6c154f\ntimeCreated: 1475312520\nlicenseType: Free\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Prefabs.meta",
    "content": "fileFormatVersion: 2\nguid: 50fcb62bf8eeb0e44a520e87654c6b2d\nfolderAsset: yes\ntimeCreated: 1470558010\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scenes/first.unity.meta",
    "content": "fileFormatVersion: 2\r\nguid: fbb49926c06e840f085b1db2cc451b53\r\ntimeCreated: 1449290794\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scenes/second.unity.meta",
    "content": "fileFormatVersion: 2\nguid: c3296db35bcf4034085f297866ad8039\ntimeCreated: 1470559565\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scenes/start.unity.meta",
    "content": "fileFormatVersion: 2\nguid: f3d8e904190f75d4191b5484059644d3\ntimeCreated: 1470559565\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scenes.meta",
    "content": "fileFormatVersion: 2\r\nguid: 6792e0cca877345cc8b3a5eb872f959d\r\nfolderAsset: yes\r\ntimeCreated: 1449290812\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/Firstui.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.UI;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.SceneManagement;\r\nusing Lui;\r\n\r\npublic class Firstui : MonoBehaviour\r\n{\r\n    public Button btn_grid;\r\n    public Button btn_trans;\r\n    public Button btn_guide;\r\n    public LControlView ctrlView;\r\n    public LTableView tblView;\r\n    public LScrollView scrolView;\r\n    public LRichText rtfView;\r\n    public LPageView pageView;\r\n    public LListView listView;\r\n    public LGridView gridView;\r\n\tpublic LProgress progView;\r\n    public LExpandListView expandView;\r\n    public LTableView tbl_drag;\r\n    public GameObject dragSelect;\r\n    public GameObject panel_root;\r\n\r\n    private LWindowManager _wm;\r\n\r\n    void Start()\r\n    {\r\n        _wm = LWindowManager.GetInstance();\r\n\r\n        btn_grid.onClick.AddListener(() =>\r\n        {\r\n            object[] list = new object[]{ 123,\"测试内容\" };\r\n            _wm.runWindow(\"Prefabs/WindowGridView.prefab\", WindowHierarchy.Normal, list);\r\n        });\r\n\r\n        btn_trans.onClick.AddListener(() =>\r\n        {\r\n            _wm.LoadSceneAsync(\"second\",(float p)=>\r\n            {\r\n                Debug.Log(\"进度 \" + p);\r\n            });\r\n        });\r\n\r\n        btn_guide.onClick.AddListener(() =>\r\n        {\r\n            bool isBlock = panel_root.GetComponent<CanvasGroup>().blocksRaycasts;\r\n            panel_root.GetComponent<CanvasGroup>().blocksRaycasts = !isBlock;\r\n            Text textComp = btn_guide.transform.FindChild(\"Text\").gameObject.GetComponent<Text>();\r\n            textComp.text = isBlock ? \"关闭遮罩\" : \"开启遮罩\";\r\n        });\r\n\r\n        ctrlView.onControlHandler = (float ox, float oy,bool isFinish) =>\r\n        {\r\n            //Debug.Log(string.Format(\"offsetX={0} offsetY={1}\", ox, oy));\r\n        };\r\n\r\n        scrolView.onMoveCompleteHandler = () =>\r\n        {\r\n            Debug.Log(\" scrolView.onMoveCompleteHandler \");\r\n        };\r\n        \r\n        tblView.cellsSize = new Vector2(150, 40);\r\n        tblView.GetComponent<RectTransform>().sizeDelta = new Vector2(150, 40 * 5);\r\n        tblView.cellsCount = 100;\r\n        tblView.SetCellHandle((int idx, GameObject obj) =>\r\n        {\r\n            obj.GetComponent<Text>().text = idx.ToString();\r\n        });\r\n        tblView.reloadData();\r\n\r\n        //rtfView.insertElement(\"hello world!!\", Color.blue, 25, true, false, Color.blue, \"数据\");\r\n        //rtfView.insertElement(\"测试文本内容!!\", Color.red, 15, false, true, Color.blue, \"\");\r\n        //rtfView.insertElement(\"Atlas/face/01\", 5f, \"\");\r\n        //rtfView.insertElement(\"The article comes from the point of the examination\", Color.green, 15, true, false, Color.blue, \"\");\r\n        //\t\trtfView.insertElement(\"Atlas/face/0201.png\", \"\");\r\n        //rtfView.insertElement(1);\r\n        //rtfView.insertElement(\"outline and newline\", Color.yellow, 20, false, true, Color.blue, \"\");\r\n        rtfView.parseRichDefaultString(\r\n            \"<lab txt=\\\"hello world!!\\\" color=#ffff00 data=数据 />\"+\r\n            \"<lab txt=\\\"测试文本内容\\\" isUnderLine=true size=40/><anim path=Atlas/face/01 fps=5.0/>\"+\r\n            \"<newline /><img path=Atlas/face/0201/>\"+\r\n            \"<lab txt=\\\"The article comes from the point of the \\\" color=#ff0000 />\"+\r\n            \"<lab txt=\\\"Examination\\\" color=#ff0000 isOutLine=true/>\");\r\n        rtfView.onClickHandler = (string data) =>\r\n        {\r\n            Debug.Log(\"data \" + data);\r\n        };\r\n        //rtfView.reloadData();\r\n\r\n        pageView.cellsSize = new Vector2(150, 100);\r\n        pageView.cellsCount = 14;\r\n        pageView.SetCellHandle((int idx,GameObject obj) =>\r\n        {\r\n            obj.transform.FindChild(\"Text\").GetComponent<Text>().text = idx.ToString();\r\n        });\r\n        pageView.onPageChangedHandler = (int pageIdx) =>\r\n        {\r\n            Debug.Log(\"page \" + pageIdx);\r\n        };\r\n        pageView.reloadData();\r\n\r\n        listView.limitNum = 10; //not must to set limitNum\r\n        for (int i = 0; i < 30; i++)\r\n        {\r\n            GameObject item = listView.dequeueItem(1);\r\n            item.GetComponent<RectTransform>().sizeDelta = new Vector2(100, 40 + Random.Range(0, 40));\r\n            item.GetComponent<Text>().text = i.ToString();\r\n            listView.insertNodeAtLast(item,1);\r\n        }\r\n        listView.reloadData();\r\n\r\n        expandView.nodeNum = 20;\r\n        expandView.nodeItemNum = 1;\r\n        expandView.prepare();\r\n        expandView.expand(0);\r\n        expandView.expand(1);\r\n        expandView.reloadData();\r\n\r\n        gridView.cellsSize = new Vector2(100, 100);\r\n        gridView.cols = 4;\r\n        gridView.cellsCount = 100;\r\n        gridView.SetCellHandle((int idx,GameObject obj) =>\r\n        {\r\n            obj.GetComponent<Text>().text = idx.ToString();\r\n        });\r\n        gridView.reloadData();\r\n\r\n\t\tprogView.setValue (10);\r\n\t\tprogView.startProgress (80, 1.0f);\r\n\r\n        tbl_drag.onPickBeginHandler = (GameObject obj) => {\r\n            dragSelect.SetActive(true);\r\n            dragSelect.transform.position = obj.transform.position;\r\n            dragSelect.transform.Find(\"sprite\").GetComponent<Image>().sprite = obj.GetComponent<Image>().sprite;\r\n        };\r\n\r\n        tbl_drag.onPickIngHandler = (Vector3 position) => {\r\n            dragSelect.transform.position = position;\r\n        };\r\n\r\n        tbl_drag.onPickEndHandler = (GameObject obj) =>\r\n        {\r\n            dragSelect.SetActive(false);\r\n            GameObject dragTarget = null;\r\n            for (int i = 0; i < 3; i++)\r\n            {\r\n                GameObject drag = GameObject.Find(\"drag\" + (i + 1));\r\n                if (Vector2.Distance(drag.transform.position, dragSelect.transform.position) < 50)\r\n                {\r\n                    dragTarget = drag;\r\n                    break;\r\n                }\r\n            }\r\n            if (dragTarget != null)\r\n            {\r\n                Sprite oldSprite = obj.GetComponent<Image>().sprite;\r\n                obj.GetComponent<Image>().sprite = dragTarget.transform.Find(\"sprite\").GetComponent<Image>().sprite;\r\n                dragTarget.transform.Find(\"sprite\").GetComponent<Image>().sprite = oldSprite;\r\n            }\r\n        };\r\n\r\n        tbl_drag.SetCellHandle((int idx, GameObject obj) =>\r\n        {\r\n\r\n        });\r\n        tbl_drag.reloadData();\r\n\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/Firstui.cs.meta",
    "content": "fileFormatVersion: 2\r\nguid: cebf28ad0381a9948ac7d7b861f6f763\r\ntimeCreated: 1451279137\r\nlicenseType: Free\r\nMonoImporter:\r\n  serializedVersion: 2\r\n  defaultReferences: []\r\n  executionOrder: 0\r\n  icon: {instanceID: 0}\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/Secondui.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.UI;\r\nusing Lui;\r\n\r\npublic class Secondui : MonoBehaviour {\r\n\r\n    public Button btn_msg;\r\n    public Button btn_trans;\r\n    public Button btn_anim;\r\n    public Button btn_clean;\r\n\tpublic LTouchView touch_view;\r\n    private LWindowManager _wm;\r\n    protected Animator _teddyAnim;\r\n\r\n    void Start() {\r\n\t\t\r\n        _wm = LWindowManager.GetInstance();\r\n        _teddyAnim = GameObject.Find(\"Teddy\").GetComponent<Animator>();\r\n\r\n        btn_msg.onClick.AddListener(() =>\r\n        {\r\n\t\t\tLLoadBundle.GetInstance().LoadAllBundles(new string[]{ \r\n\t\t\t\t\"prefabs-msgbox_prefab.ab\",\r\n\t\t\t\t\"atlas-face_png.ab\" },()=>\r\n\t\t\t{\r\n\t\t\t\t_wm.runWindow(\"Prefabs/MsgBox.prefab\", WindowHierarchy.Normal);\r\n\t\t\t});\r\n        });\r\n\r\n        btn_trans.onClick.AddListener(() =>\r\n        {\r\n\t\t\tLLoadBundle.GetInstance().LoadAllBundles(new string[]{\r\n                \"atlas-face_png.ab\"},()=>\r\n\t\t\t{\r\n    \t\t\t_wm.LoadScene(\"first\");\r\n\t\t\t});\r\n        });\r\n\r\n        btn_anim.onClick.AddListener(() =>\r\n        {\r\n            _teddyAnim.SetBool(\"run_idle\", false);\r\n            _teddyAnim.SetBool(\"idle_run\", true);\r\n        });\r\n\r\n        btn_clean.onClick.AddListener(() =>\r\n        {\r\n            _teddyAnim.SetBool(\"idle_run\", false);\r\n            _teddyAnim.SetBool(\"run_idle\", true);\r\n        });\r\n\r\n\t\ttouch_view.onClickHandler2D = (GameObject obj) => {\r\n\t\t\tDebug.Log(obj.name);\r\n\t\t};\r\n\t}\r\n\r\n\tvoid OnLevelWasLoaded(int level){\r\n\t\t//remove first textures\r\n\t\tLLoadBundle.GetInstance().UnloadBundles( new string[]{\r\n            \"atlas-face_png.ab\"\r\n        });\r\n\t}\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/Secondui.cs.meta",
    "content": "fileFormatVersion: 2\r\nguid: ad3ebd9f68084764693da16070044427\r\ntimeCreated: 1451278800\r\nlicenseType: Free\r\nMonoImporter:\r\n  serializedVersion: 2\r\n  defaultReferences: []\r\n  executionOrder: 0\r\n  icon: {instanceID: 0}\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/WindowGridView.cs",
    "content": "﻿using UnityEngine;\nusing UnityEngine.UI;\nusing System.Collections;\nusing System.Collections.Generic;\nusing Lui;\n\npublic class WindowGridView : LWindowBase\n{\n    public Button btn_close;\n    public LGridPageView gridPageView;\n    private LWindowManager wm;\n\n    public WindowGridView()\n    {\n        this.disposeType = WindowDispose.Normal;\n    }\n\n    void Start()\n    {\n        btn_close.onClick.AddListener(() =>\n        {\n            LWindowManager wm = LWindowManager.GetInstance();\n            wm.popWindow(this);\n        });\n\n        gridPageView.cellsSize = new Vector2(400, 400);\n        gridPageView.cols = 4;\n        gridPageView.rows = 4;\n        gridPageView.gridCellsCount = 100;\n        gridPageView.gridCellsSize = new Vector2(100, 100);\n        gridPageView.SetCellHandle((int idx,GameObject obj) =>\n        {\n            obj.GetComponent<Text>().text = idx.ToString();\n        });\n        gridPageView.reloadData();\n    }\n\n    public override void Open(object[] list)\n    {\n        base.Open(list);\n        if (list!=null)\n        {\n            foreach (var item in list)\n            {\n                Debug.Log(\"数据:\"+item.ToString());\n            }\n        }\n    }\n\n    public override void Close()\n    {\n        base.Close();\n    }\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo/WindowGridView.cs.meta",
    "content": "fileFormatVersion: 2\r\nguid: c8877e477c64e7f4883ce6c85912f424\r\ntimeCreated: 1451377646\r\nlicenseType: Free\r\nMonoImporter:\r\n  serializedVersion: 2\r\n  defaultReferences: []\r\n  executionOrder: 0\r\n  icon: {instanceID: 0}\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Demo.meta",
    "content": "fileFormatVersion: 2\r\nguid: 5204e3f0979e37b439aa6ae6a2a9b923\r\nfolderAsset: yes\r\ntimeCreated: 1451377644\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/Game.cs",
    "content": "﻿using SLua;\r\nusing System.IO;\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.UI;\r\n\r\n[CustomLuaClassAttribute]\r\npublic class Game : MonoBehaviour\r\n{\r\n    private static LuaSvr _l;\r\n\r\n    public UnityAction<int> onProgressHandler;\r\n\r\n    void Start()\r\n    {\r\n        Application.targetFrameRate = LGameConfig.DEFAULT_FRAME_RATE;\r\n\r\n        if (_l == null)\r\n        {\r\n\t\t\tif (LGameConfig.GetInstance().isDebug)\r\n            {\r\n\t\t\t\tLuaState.loaderDelegate = loadFileWithSuffix;\r\n            }else\r\n            {\r\n\t\t\t\tLuaState.loaderDelegate = loadLuaWithAb;\r\n            }\r\n            _l = new LuaSvr();\r\n            _l.init(tick, complete);\r\n        }\r\n        else\r\n        {\r\n            complete();\r\n        }\r\n    }\r\n\r\n    public static LuaSvr GetLuaSvr()\r\n    {\r\n        return _l;\r\n    }\r\n\r\n    void tick(int p)\r\n    {\r\n        if (onProgressHandler != null)\r\n        {\r\n            onProgressHandler.Invoke(p);\r\n        }\r\n    }\r\n\r\n    protected byte[] loadFileWithSuffix(string strFile)\r\n    {\r\n        if (string.IsNullOrEmpty(strFile))\r\n        {\r\n            return null;\r\n        }\r\n\r\n        strFile.Replace(\".\", \"/\");\r\n\r\n        strFile += LGameConfig.FILE_AFFIX_LUA;\r\n\r\n        string dir = strFile.StartsWith(\"Config\") ? LGameConfig.CONFIG_CATAGORY_LUA : LGameConfig.DATA_CATAGORY_LUA;\r\n        string strLuaPath = dir + Path.DirectorySeparatorChar + strFile;\r\n        string strFullPath = LGameConfig.GetInstance().GetLoadUrl(strLuaPath);\r\n        // Read from file.\r\n        LArchiveBinFile cArc = new LArchiveBinFile();\r\n        if (!cArc.Open(strFullPath, FileMode.Open, FileAccess.Read))\r\n        {\r\n            return null;\r\n        }\r\n\r\n        if (!cArc.IsValid())\r\n        {\r\n            return null;\r\n        }\r\n\r\n        int nContentLength = (int)cArc.GetStream().Length;\r\n        byte[] aContents = new byte[nContentLength];\r\n        cArc.ReadBuffer(ref aContents, nContentLength);\r\n        cArc.Close();\r\n\r\n        return aContents;\r\n    }\r\n\r\n    protected byte[] loadLuaWithAb(string strFile)\r\n    {\r\n        string ext = LGameConfig.GetInstance().isEncrypt ? \".bytes\" : \".txt\";\r\n        TextAsset asset = null;\r\n        if (strFile.StartsWith(\"Config\"))\r\n        {\r\n            asset = LLoadBundle.GetInstance().LoadAsset<TextAsset>(\"@luaconfig.ab\", \"@LuaConfig/\" + strFile + ext);\r\n        }\r\n        else\r\n        {\r\n            asset = LLoadBundle.GetInstance().LoadAsset<TextAsset>(\"@lua.ab\", \"@Lua/\" + strFile + ext);\r\n        }\r\n        if (asset == null) return null;\r\n        //if (LGameConfig.GetInstance().isEncrypt)\r\n        //    return LUtil.AESDecrypt(asset.bytes, LGameConfig.EncryptKey32, LGameConfig.EncryptKey16);\r\n//        else\r\n            return asset.bytes;\r\n    }\r\n\r\n    void complete()\r\n    {\r\n        if (LGameConfig.GetInstance().isShowFps)\r\n        {\r\n            LFPSView.Show();\r\n        }\r\n\r\n        if (!LGameConfig.GetInstance().isDebug) //生产环境\r\n        {\r\n\t\t\tif (LGameConfig.GetInstance ().isHotFix) {\r\n                GameObject canvas = GameObject.Find(\"Canvas\");\r\n                Text lab_unzip = null;\r\n                if (canvas.transform.Find(\"prog\"))\r\n                {\r\n                    canvas.transform.Find(\"prog\").gameObject.SetActive(true);\r\n                    lab_unzip = canvas.transform.Find(\"prog/lab_unzip\").GetComponent<Text>();\r\n                }\r\n                \r\n\t\t\t\tGameObject obj = new GameObject ();\r\n\t\t\t\tobj.name = \"ResUpdate\";\r\n\t\t\t\tLResUpdate resUpdate = obj.AddComponent<LResUpdate> ();\r\n                resUpdate.onUnzipProgressHandler = (int step) =>{\r\n                    if(lab_unzip)\r\n                        lab_unzip.text = step.ToString();\r\n                    Debug.Log(\" unzip \"+step);\r\n                };\r\n\t\t\t\tresUpdate.onCompleteHandler = () => {\r\n\t\t\t\t\tDestroy (obj);\r\n                    LLoadBundle.GetInstance().LoadAllBundles(new string[] { \"@lua.ab\",\"@luaconfig.ab\" }, () =>\r\n                    {\r\n                        _l.start(\"main\");\r\n                    });\r\n                };\r\n\t\t\t\tresUpdate.checkUpdate ();\r\n\t\t\t} else {\r\n\t\t\t\tLLoadBundle.GetInstance ().LoadAllBundles (new string[] { \"@lua.ab\",\"@luaconfig.ab\" },()=>\r\n                {\r\n\t\t\t\t\t_l.start (\"main\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n        }\r\n        else //PC端开发\r\n        {\r\n            _l.start(\"main\");\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/Game.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 1e64327fc1db0624eb9e033e2ad943d5\ntimeCreated: 1462326417\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LArchiveBin.cs",
    "content": "﻿using UnityEngine;\r\nusing System;\r\nusing System.IO;\r\nusing System.Text;\r\n\r\npublic class LArchiveBin  {\r\n\r\n    // buff size\r\n    public readonly int TX_BUFSIZE = 8;\r\n\r\n    // file stream\r\n    protected Stream m_cStream = null;\r\n\r\n    // open flag\r\n    protected bool m_bOpen = false;\r\n\r\n    /**\r\n     * Constructor.\r\n     * @param void.\r\n     * @return void.\r\n     */\r\n    public LArchiveBin()\r\n    {\r\n    }\r\n\r\n    /**\r\n     * Get the stream of this archive.\r\n     * @param void.\r\n     * @return - Stream, currently used stream.\r\n     */\r\n    public Stream GetStream()\r\n    {\r\n        return m_cStream;\r\n    }\r\n\r\n    /**\r\n     * Get if this archive is valid.\r\n     * @param void.\r\n     * @return - bool - true if valid, otherwise false.\r\n     */\r\n    public bool IsValid()\r\n    {\r\n        return (null != m_cStream && m_bOpen) ? true : false;\r\n    }\r\n\r\n    /**\r\n     * Write buffer.\r\n     * @param string strText - Text value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadBuffer(ref byte[] aBuff, int nBuffSize)\r\n    {\r\n        m_cStream.Read(aBuff, 0, nBuffSize);\r\n        return aBuff.Length;\r\n    }\r\n\r\n    /**\r\n     * Read bool.\r\n     * @param ref bool bValue - Bool value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadBool(ref bool bValue)\r\n    {\r\n        byte yValue = 0;\r\n        ReadInt8(ref yValue);\r\n        bValue = (0 == yValue) ? false : true;\r\n\r\n        return sizeof(byte);\r\n    }\r\n\r\n    /**\r\n     * Read string.\r\n     * @param ref string strText - Text value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadString(ref string strValue)\r\n    {\r\n        return ReadString(ref strValue, false);\r\n    }\r\n\r\n    /**\r\n     * Read string.\r\n     * @param ref string strText - Text value.\r\n     * @param bool bUnicode - Is unicode or not.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadString(ref string strValue, bool bUnicode)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        if (bUnicode)\r\n        {\r\n            byte[] aBuff = new byte[TX_BUFSIZE * 8];\r\n            m_cStream.Read(aBuff, 0, sizeof(int));\r\n            int nStrLen = BitConverter.ToInt32(aBuff, 0);\r\n\r\n            // check buff size\r\n            if (nStrLen > TX_BUFSIZE)\r\n            {\r\n                aBuff = new byte[nStrLen];\r\n            }\r\n\r\n            m_cStream.Read(aBuff, 0, nStrLen);\r\n            strValue = Encoding.Unicode.GetString(aBuff, 0, nStrLen);\r\n            return nStrLen;\r\n        }\r\n        else\r\n        {\r\n            byte[] aBuff = new byte[TX_BUFSIZE * 8];\r\n            m_cStream.Read(aBuff, 0, sizeof(int));\r\n            int nStrLen = BitConverter.ToInt32(aBuff, 0);\r\n\r\n            // check buff size\r\n            if (nStrLen > TX_BUFSIZE)\r\n            {\r\n                aBuff = new byte[nStrLen];\r\n            }\r\n\r\n            m_cStream.Read(aBuff, 0, nStrLen);\r\n            strValue = Encoding.ASCII.GetString(aBuff, 0, nStrLen);\r\n            return nStrLen;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Read float.\r\n     * @param float nValue - Float value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadFloat(ref float fValue)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(float));\r\n        fValue = BitConverter.ToSingle(aBuff, 0);\r\n\r\n        return sizeof(float);\r\n    }\r\n\r\n    /**\r\n     * Read double.\r\n     * @param double dValue - Double value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadDouble(ref double dValue)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 4];\r\n        m_cStream.Read(aBuff, 0, sizeof(double));\r\n        dValue = BitConverter.ToDouble(aBuff, 0);\r\n\r\n        return sizeof(double);\r\n    }\r\n\r\n    /**\r\n     * Read int8.\r\n     * @param char n8Value - Char value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadInt8(ref byte n8Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(byte));\r\n        n8Value = aBuff[0];\r\n\r\n        return sizeof(byte);\r\n    }\r\n\r\n    /**\r\n     * Read int32.\r\n     * @param int nValue - int32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadInt16(ref Int16 n16Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(Int16));\r\n        n16Value = BitConverter.ToInt16(aBuff, 0);\r\n\r\n        return sizeof(Int16);\r\n    }\r\n\r\n    /**\r\n     * Read uint32.\r\n     * @param UInt32 nValue - uint32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadUInt16(ref UInt16 u16Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(UInt16));\r\n        u16Value = BitConverter.ToUInt16(aBuff, 0);\r\n\r\n        return sizeof(UInt16);\r\n    }\r\n\r\n    /**\r\n     * Read int32.\r\n     * @param int nValue - int32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadInt32(ref int nValue)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(int));\r\n        nValue = BitConverter.ToInt32(aBuff, 0);\r\n\r\n        return sizeof(int);\r\n    }\r\n\r\n    /**\r\n     * Read uint32.\r\n     * @param UInt32 nValue - uint32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadUInt32(ref UInt32 u32Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 2];\r\n        m_cStream.Read(aBuff, 0, sizeof(UInt32));\r\n        u32Value = BitConverter.ToUInt32(aBuff, 0);\r\n\r\n        return sizeof(UInt32);\r\n    }\r\n\r\n    /**\r\n     * Read int32.\r\n     * @param int nValue - Int64 n64Value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadInt64(ref Int64 n64Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 4];\r\n        m_cStream.Read(aBuff, 0, sizeof(Int64));\r\n        n64Value = BitConverter.ToInt64(aBuff, 0);\r\n\r\n        return sizeof(Int64);\r\n    }\r\n\r\n    /**\r\n     * Read uint32.\r\n     * @param UInt32 nValue - UInt64 dw64Value.\r\n     * @return - Data size.\r\n     */\r\n    public int ReadUInt64(ref UInt64 dw64Value)\r\n    {\r\n        byte[] aBuff = new byte[TX_BUFSIZE * 4];\r\n        m_cStream.Read(aBuff, 0, sizeof(UInt64));\r\n        dw64Value = BitConverter.ToUInt64(aBuff, 0);\r\n\r\n        return sizeof(UInt64);\r\n    }\r\n\r\n    /**\r\n     * Write buffer.\r\n     * @param string strText - Text value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteBuffer(byte[] aBuff)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        m_cStream.Write(aBuff, 0, aBuff.Length);\r\n        return aBuff.Length;\r\n    }\r\n\r\n    /**\r\n     * Write bool value.\r\n     * @param bool bValue - bool value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteBool(bool bValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte yValue = (byte)(bValue ? 1 : 0);\r\n        return WriteInt8(yValue);\r\n    }\r\n\r\n    /**\r\n     * Write string.\r\n     * @param string strText - Text value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteString(string strValue)\r\n    {\r\n        return WriteString(strValue, false);\r\n    }\r\n\r\n    /**\r\n     * Write string.\r\n     * @param string strText - Text value.\r\n     * @param bool bUnicode - Is unicode or not.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteString(string strValue, bool bUnicode)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        if (bUnicode)\r\n        {\r\n            // Write string length.\r\n            byte[] aLength = BitConverter.GetBytes(strValue.Length * sizeof(char));\r\n            m_cStream.Write(aLength, 0, sizeof(int));\r\n\r\n            // Write string.\r\n            byte[] aString = Encoding.Unicode.GetBytes(strValue);\r\n            m_cStream.Write(aString, 0, strValue.Length * sizeof(char));\r\n            return (strValue.Length * sizeof(char) + sizeof(int));\r\n        }\r\n        else\r\n        {\r\n            // Write string length.\r\n            byte[] aLength = BitConverter.GetBytes(strValue.Length);\r\n            m_cStream.Write(aLength, 0, sizeof(int));\r\n\r\n            // Write string.\r\n            byte[] aString = Encoding.ASCII.GetBytes(strValue);\r\n            m_cStream.Write(aString, 0, strValue.Length);\r\n            return (strValue.Length + sizeof(int));\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Write float.\r\n     * @param float nValue - Float value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteFloat(float fValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aInt32 = BitConverter.GetBytes(fValue);\r\n        m_cStream.Write(aInt32, 0, sizeof(float));\r\n        return sizeof(float);\r\n    }\r\n\r\n    /**\r\n     * Write double.\r\n     * @param double dValue - Double value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteDouble(double dValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aInt32 = BitConverter.GetBytes(dValue);\r\n        m_cStream.Write(aInt32, 0, sizeof(double));\r\n        return sizeof(double);\r\n    }\r\n\r\n    /**\r\n     * Write int8.\r\n     * @param byte n8Value - Byte n8Value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteInt8(byte n8Value)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aBuff = { n8Value };\r\n        m_cStream.Write(aBuff, 0, sizeof(byte));\r\n        return sizeof(byte);\r\n    }\r\n\r\n    /**\r\n     * Write int16.\r\n     * @param Int16 nValue - Int16 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteInt16(Int16 nValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aInt16 = BitConverter.GetBytes(nValue);\r\n        m_cStream.Write(aInt16, 0, sizeof(Int16));\r\n        return sizeof(Int16);\r\n    }\r\n\r\n    /**\r\n     * Write uint16.\r\n     * @param UInt16 nValue - UInt16 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteUInt16(UInt16 nValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aUInt16 = BitConverter.GetBytes(nValue);\r\n        m_cStream.Write(aUInt16, 0, sizeof(UInt16));\r\n        return sizeof(UInt16);\r\n    }\r\n\r\n    /**\r\n     * Write int32.\r\n     * @param int nValue - int32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteInt32(int nValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aInt32 = BitConverter.GetBytes(nValue);\r\n        m_cStream.Write(aInt32, 0, sizeof(Int32));\r\n        return sizeof(Int32);\r\n    }\r\n\r\n    /**\r\n     * Write uint32.\r\n     * @param UInt32 nValue - uint32 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteUInt32(UInt32 nValue)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aUInt32 = BitConverter.GetBytes(nValue);\r\n        m_cStream.Write(aUInt32, 0, sizeof(UInt32));\r\n        return sizeof(UInt32);\r\n    }\r\n\r\n    /**\r\n     * Write int64.\r\n     * @param Int64 n64Value - int64 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteInt64(Int64 n64Value)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aInt64 = BitConverter.GetBytes(n64Value);\r\n        m_cStream.Write(aInt64, 0, sizeof(Int64));\r\n        return sizeof(Int64);\r\n    }\r\n\r\n    /**\r\n     * Write uint64.\r\n     * @param UInt64 dw64Value - uint64 value.\r\n     * @return - Data size.\r\n     */\r\n    public int WriteUInt64(UInt64 dw64Value)\r\n    {\r\n        if (!IsValid())\r\n        {\r\n            return 0;\r\n        }\r\n\r\n        byte[] aUInt64 = BitConverter.GetBytes(dw64Value);\r\n        m_cStream.Write(aUInt64, 0, sizeof(UInt64));\r\n        return sizeof(UInt64);\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LArchiveBin.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 03b9753422ec3b143a5cc69b81fa9343\ntimeCreated: 1455897062\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LArchiveBinFile.cs",
    "content": "﻿using System.IO;\r\nusing System;\r\n\r\npublic class LArchiveBinFile : LArchiveBin {\r\n\r\n    /**\r\n     * open file.\r\n     * @param void.\r\n     * @return void.\r\n     */\r\n    public bool Open(string strFileName, FileMode eMode, FileAccess eAccess)\r\n    {\r\n        if (string.IsNullOrEmpty(strFileName))\r\n        {\r\n            return false;\r\n        }\r\n\r\n        if ((FileMode.Open == eMode) && !File.Exists(strFileName))\r\n        {\r\n            return false;\r\n        }\r\n\r\n        try\r\n        {\r\n            m_cStream = new FileStream(strFileName, eMode, eAccess);\r\n        }\r\n        catch (Exception cEx)\r\n        {\r\n            Console.Write(cEx.Message);\r\n        }\r\n\r\n        if (null == m_cStream)\r\n        {\r\n            return false;\r\n        }\r\n\r\n        m_bOpen = true;\r\n        return true;\r\n    }\r\n\r\n    /**\r\n     * Close this stream.\r\n     * @param void.\r\n     * @return bool - true if success, otherwise false.\r\n     */\r\n    public bool Close()\r\n    {\r\n        if (null == m_cStream)\r\n        {\r\n            m_bOpen = false;\r\n            return false;\r\n        }\r\n\r\n        m_cStream.Close();\r\n        m_bOpen = false;\r\n        return true;\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LArchiveBinFile.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 1b7dbb05460093847b32c5c3c3409b5f\ntimeCreated: 1455895084\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LGameConfig.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.Events;\r\nusing System.IO;\r\nusing System.Xml;\r\nusing SLua;\r\n\r\n[CustomLuaClass]\r\npublic class LGameConfig\r\n{\r\n    // The config file path.\r\n    public static readonly string CONFIG_FILE = \"config\";\r\n    // The lua data folder name.\r\n    public static readonly string DATA_CATAGORY_LUA = \"@Lua\";\r\n    // The lua config folder name.\r\n    public static readonly string CONFIG_CATAGORY_LUA = \"@LuaConfig\";\r\n\r\n    public static readonly string ASSETBUNDLE_AFFIX = \".ab\";\r\n    // The lua file affix.\r\n    public static readonly string FILE_AFFIX_LUA = \".lua\";\r\n    // The lua files zip name.\r\n    public static readonly string UPDATE_FILE_ZIP = \"data.zip\";\r\n    // asset load base format\r\n\tpublic static readonly string ASSET_BASE_FORMAT = \"Assets/Game/Resources/{0}\";\r\n    // 32 bytes encrypt key\r\n    public static string EncryptKey32 = \"12345678901234567890123456789012\";\r\n    // 16 bytes encrypt key\r\n    public static string EncryptKey16 = \"1234567890123456\";\r\n    // is activate debug\r\n    public bool isDebug = true;\r\n    // is pack lua files in app\r\n    public bool isHotFix = true;\r\n    // is show frame rate\r\n    public bool isShowFps = true;\r\n    // is use luajit & encode \r\n    public bool isEncrypt = true;\r\n    // remote server resource url\r\n    public string SERVER_RES_URL = \"\";\r\n\r\n    public string SERVER_ADDRESS_IP = \"\";\r\n    public string SERVER_ADDRESS_PORT = \"\";\r\n    // game default target frame rate\r\n    public static int DEFAULT_FRAME_RATE = 60;\r\n\r\n    // The local file url prefix. (For assetbundle.)\r\n#if UNITY_EDITOR_WIN || UNITY_STANDALONE_WIN\r\n    public static readonly string LOCAL_URL_PREFIX = \"file:///\";\r\n#else\r\n\tpublic static readonly string LOCAL_URL_PREFIX = \"file://\";\r\n#endif\r\n\r\n    // The asset path in persistent asset path.\r\n    private string m_strPersistAssetPath = string.Empty;\r\n\r\n    // The asset path in streaming asset path.\r\n    private string m_strStreamAssetPath = string.Empty;\r\n\r\n    // The asset path in caching path.\r\n    private string m_strCachingAssetPath = string.Empty;\r\n\r\n    // The global instance.\r\n    private static LGameConfig m_cInstance = null;\r\n    // open debug view\r\n    public UnityAction openGmViewFunc;\r\n    public UnityAction<string , string , LogType > logCollectFunc;\r\n\r\n    [DoNotToLua]\r\n    public void HandleLog(string message, string stackTrace, LogType type)\r\n    {\r\n        if (logCollectFunc != null)\r\n        {\r\n            logCollectFunc.Invoke(message, string.Format(stackTrace), type);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Constructor.\r\n     * \r\n     * @param void.\r\n     * @return void.\r\n     */\r\n    private LGameConfig()\r\n    {\r\n        LoadConfig();\r\n    }\r\n\r\n    /**\r\n     * Destructor.\r\n     * \r\n     * @param void.\r\n     * @return void.\r\n     */\r\n    ~LGameConfig()\r\n    {\r\n        m_cInstance = null;\r\n    }\r\n\r\n    public static LGameConfig GetInstance()\r\n    {\r\n        if (null == m_cInstance)\r\n        {\r\n            m_cInstance = new LGameConfig();\r\n        }\r\n        return m_cInstance;\r\n    }\r\n\r\n    // Get persistent assets path.\r\n    public string PersistentAssetsPath\r\n    {\r\n        get\r\n        {\r\n            if (string.IsNullOrEmpty(m_strPersistAssetPath))\r\n            {\r\n                m_strPersistAssetPath = Application.persistentDataPath + Path.DirectorySeparatorChar;\r\n            }\r\n\r\n            return m_strPersistAssetPath;\r\n        }\r\n    }\r\n\r\n    // Get streaming assets path.\r\n    public string StreamingAssetsPath\r\n    {\r\n        get\r\n        {\r\n            if (string.IsNullOrEmpty(m_strStreamAssetPath))\r\n            {\r\n                m_strStreamAssetPath = Application.streamingAssetsPath + Path.DirectorySeparatorChar;\r\n            }\r\n\r\n            return m_strStreamAssetPath;\r\n        }\r\n    }\r\n\r\n    // Get caching assets path.\r\n    public string CachingAssetsPath\r\n    {\r\n        get\r\n        {\r\n            if (string.IsNullOrEmpty(m_strCachingAssetPath))\r\n            {\r\n                m_strCachingAssetPath = Application.temporaryCachePath + Path.DirectorySeparatorChar;\r\n            }\r\n\r\n            return m_strCachingAssetPath;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Get the final load url.\r\n     * \r\n     * @param string strPathName - The path name of the file with dir except the base url.\r\n     * @return string - The final full url load string.\r\n     */\r\n    public string GetLoadUrl(string strPathName)\r\n    {\r\n        string strFilePath = PersistentAssetsPath + strPathName;\r\n\r\n        if (File.Exists(strFilePath) && (!this.isDebug))\r\n        {\r\n            return strFilePath;\r\n        }\r\n        else\r\n        {\r\n            strFilePath = Application.dataPath + \"/Game/\" + strPathName;\r\n            return strFilePath;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Get the final load url for directory.\r\n     * \r\n     * @param string strPathName - The path dir name of the file with dir except the base url.\r\n     * @return string - The final full url load string for the path dir.\r\n     */\r\n    public string GetLoadUrlForDir(string strPathName)\r\n    {\r\n        string strFilePath = PersistentAssetsPath + strPathName;\r\n        if (Directory.Exists(strFilePath))\r\n        {\r\n            return strFilePath;\r\n        }\r\n        else\r\n        {\r\n            strFilePath = StreamingAssetsPath + strPathName;\r\n            return strFilePath;\r\n        }\r\n    }\r\n\r\n\tpublic static string GetABNameWithAtlasPath(string path){\r\n\t\treturn string.Format(\"{0}{1}\", path.Replace ('/', '-').Replace ('.', '_').ToLower(),ASSETBUNDLE_AFFIX);\r\n\t}\r\n\r\n    private void LoadConfig()\r\n    {\r\n        TextAsset textAsset = Resources.Load<TextAsset>(CONFIG_FILE);\r\n        if (textAsset)\r\n        {\r\n            XmlDocument doc = new XmlDocument();\r\n            doc.LoadXml(textAsset.text);    //加载Xml文件  \r\n\r\n            XmlElement rootElem = doc.DocumentElement;   //获取根节点  \r\n\r\n            XmlNodeList debugs = rootElem.GetElementsByTagName(\"Debug\");\r\n            isDebug = debugs[0].InnerText == \"1\";\r\n\r\n            XmlNodeList resUrls = rootElem.GetElementsByTagName(\"ResUrl\");\r\n            SERVER_RES_URL = resUrls[0].InnerText;\r\n\r\n\t\t\tXmlNodeList hotFix = rootElem.GetElementsByTagName(\"HotFix\");\r\n\t\t\tisHotFix = hotFix[0].InnerText == \"1\";\r\n\r\n            XmlNodeList showFps = rootElem.GetElementsByTagName(\"ShowFps\");\r\n            isShowFps = showFps[0].InnerText == \"1\";\r\n\r\n            XmlNodeList encrypt = rootElem.GetElementsByTagName(\"Encrypt\");\r\n            isEncrypt = encrypt[0].InnerText == \"1\";\r\n\r\n            XmlNodeList ip = rootElem.GetElementsByTagName(\"Ip\");\r\n            SERVER_ADDRESS_IP = ip[0].InnerText;\r\n\r\n            XmlNodeList port = rootElem.GetElementsByTagName(\"Port\");\r\n            SERVER_ADDRESS_PORT = port[0].InnerText;\r\n        }\r\n    }\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LGameConfig.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 0b6447a53af63924190cab30b737edfa\ntimeCreated: 1455894973\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLoadBundle.cs",
    "content": "﻿using UnityEngine;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.Events;\r\nusing System.IO;\r\nusing SLua;\r\n\r\n[CustomLuaClass]\r\npublic class LLoadBundle : MonoBehaviour\r\n{\r\n    private Dictionary<string, AssetBundle> bundles;\r\n    private static LLoadBundle _instance;\r\n    private Dictionary<string, Sprite[]> spritesCache;\r\n    private Dictionary<string, Object> tplCache;\r\n\r\n    public AssetBundle GetBundleByName(string name)\r\n    {\r\n        AssetBundle b;\r\n        bundles.TryGetValue(name, out b);\r\n        return b;\r\n    }\r\n\r\n    private LLoadBundle()\r\n    {\r\n        bundles = new Dictionary<string, AssetBundle>();\r\n        spritesCache = new Dictionary<string, Sprite[]>();\r\n        tplCache = new Dictionary<string , Object>();\r\n    }\r\n\r\n    public static LLoadBundle GetInstance()\r\n    {\r\n        if (_instance == null)\r\n        {\r\n            GameObject obj = new GameObject();\r\n            DontDestroyOnLoad(obj);\r\n            obj.name = \"LLoadBundle\";\r\n            _instance = obj.AddComponent<LLoadBundle>();\r\n        }\r\n        return _instance;\r\n    }\r\n\r\n    public void LoadAllBundles(string[] bundle_names, UnityAction callFunc,UnityAction<int> progressFunc=null)\r\n    {\r\n        if (LGameConfig.GetInstance().isDebug)\r\n        {\r\n            callFunc.Invoke();\r\n        }\r\n        else\r\n        {\r\n            StartCoroutine(Load(bundle_names, callFunc,progressFunc));\r\n        }\r\n    }\r\n\r\n    IEnumerator Load(string[] bundle_names, UnityAction callFunc,UnityAction<int> progressFunc=null)\r\n    {\r\n        int len = bundle_names.Length;\r\n\r\n        for (int i = 0; i < len; i++)\r\n        {\r\n            string name = bundle_names[i];\r\n            if (!bundles.ContainsKey(name))\r\n            {\r\n                using (WWW asset = new WWW(LResUpdate.LOCAL_RES_URL + name))\r\n                {\r\n                    Debug.Log(\"bundle name:\"+name);\r\n                    yield return asset;\r\n\r\n                    if (string.IsNullOrEmpty (asset.error)) {\r\n\r\n                        bundles.Add(name, asset.assetBundle);\r\n                        asset.Dispose();\r\n                        if(progressFunc!=null)\r\n                            progressFunc.Invoke(i+1);\r\n                    }else{\r\n                         Debug.Log(\"bundle error:\"+name+\" \"+asset.error);\r\n                    }\r\n                }\r\n            }\r\n\r\n\t\t\tif (i == len - 1)\r\n\t\t\t{\r\n\t\t\t\tcallFunc();\r\n\t\t\t}\r\n        }\r\n    }\r\n\r\n    public Object LoadAsset(string bundleName, string assetName)\r\n    {   \r\n        string key = string.Format(\"{0}_{1}\",bundleName,assetName);\r\n        if(tplCache.ContainsKey(key)){\r\n            return tplCache[key];\r\n        }else{\r\n            Object tpl = LoadAsset<Object>(bundleName, assetName);\r\n            if( tpl == null){\r\n                Debug.LogWarning(\"asset not exist! \"+bundleName+\" \"+assetName);\r\n                return null;\r\n            }\r\n            tplCache.Add(key,tpl);\r\n        }\r\n        return tplCache[key];\r\n    }\r\n\r\n    public Object[] LoadAllAsset(string bundleName, string assetName)\r\n    {\r\n        return LoadAllAsset<Object>(bundleName, assetName);\r\n    }\r\n\r\n    public T LoadAsset<T>(string bundleName, string assetName) where T : Object \r\n    {\r\n        T prefab = null;\r\n        if (LGameConfig.GetInstance().isDebug)\r\n        {\r\n            assetName = assetName.Split('.')[0];\r\n\t\t\tprefab = Resources.Load<T>(assetName);\r\n        }\r\n        else\r\n        {\r\n            AssetBundle b;\r\n            bundles.TryGetValue(bundleName, out b);\r\n            if (b != null)\r\n            {\r\n//\t\t\t\tDebug.Log(string.Format(LGameConfig.ASSET_BASE_FORMAT, assetName));\r\n\t\t\t\tprefab = b.LoadAsset<T>(string.Format(LGameConfig.ASSET_BASE_FORMAT, assetName));\r\n            }else{\r\n                Debug.Log(\"bundle not exist! : \"+bundleName);\r\n            }\r\n        }\r\n        return prefab;\r\n    }\r\n\r\n    public T[] LoadAllAsset<T>(string bundleName, string assetName) where T : Object\r\n    {\r\n        T[] prefabs = null;\r\n        if (LGameConfig.GetInstance().isDebug)\r\n        {\r\n            assetName = assetName.Split('.')[0];\r\n            prefabs = Resources.LoadAll<T>(assetName);\r\n        }\r\n        else\r\n        {\r\n            AssetBundle b;\r\n            bundles.TryGetValue(bundleName, out b);\r\n            if (b != null)\r\n            {\r\n                prefabs = b.LoadAllAssets<T>();\r\n            }\r\n        }\r\n        return prefabs;\r\n    }\r\n\r\n    public Sprite[] GetSpritesByName(string bundlePath,string assetName)\r\n    {   \r\n\t\tstring key = bundlePath;\r\n        if(spritesCache.ContainsKey(key))\r\n        {\r\n            return spritesCache[key];\r\n        }else{\r\n\r\n            if (LGameConfig.GetInstance().isDebug)\r\n            {\r\n                Sprite[] sprites = Resources.LoadAll<Sprite>(bundlePath);\r\n\t\t\t\tspritesCache.Add(key,sprites);\r\n            }\r\n            else\r\n            {\r\n                string bundleName = LGameConfig.GetABNameWithAtlasPath(bundlePath.Split('.')[0] +\".png\");\r\n                AssetBundle assetBundle = this.GetBundleByName(bundleName);\r\n                if (assetBundle)\r\n                {\r\n                    Sprite[] sprites = assetBundle.LoadAllAssets<Sprite>();\r\n\t\t\t\t\tspritesCache.Add(key,sprites);\r\n                }\r\n            }\r\n\r\n\t\t\tList<Sprite> _arr = new List<Sprite>();\r\n\t\t\tSprite[] _sprites = spritesCache[key];\r\n\t\t\tforeach (Sprite s in _sprites) {\r\n\t\t\t\tif (s.name.StartsWith(assetName))\r\n\t\t\t\t{\r\n\t\t\t\t\t_arr.Add(s);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn _arr.ToArray();\r\n        }\r\n    }\r\n\r\n    public Sprite GetSpriteByName(string bundlePath, string assetName)\r\n    {\r\n        Sprite[] sprites = GetSpritesByName(bundlePath, assetName);\r\n        return sprites.Length > 0 ? sprites[0] : null;\r\n    }\r\n\r\n    public void UnloadBundles(string[] bundle_names)\r\n    {\r\n        for (int i = 0; i < bundle_names.Length; i++)\r\n        {\r\n            AssetBundle b;\r\n            bundles.TryGetValue(bundle_names[i], out b);\r\n            if (b != null)\r\n            {\r\n\t\t\t\tb.Unload(true);\r\n                bundles.Remove(bundle_names[i]);\r\n            }\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLoadBundle.cs.meta",
    "content": "fileFormatVersion: 2\nguid: fb2278992915ffc48af7ebc05c0a638d\ntimeCreated: 1462714778\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaBehaviourBase.cs",
    "content": "﻿using UnityEngine;\r\nusing SLua;\r\nusing UnityEngine.EventSystems;\r\n\r\n[CustomLuaClass]\r\npublic class LLuaBehaviourBase : MonoBehaviour {\r\n\r\n\tpublic string className;\r\n\t// Is ready or not.\r\n\tprotected bool m_bReady = false;\r\n\r\n    // The lua behavior.\r\n    protected LLuaBehaviourInterface m_cBehavior = new LLuaBehaviourInterface();\r\n\r\n\t// The awake method.\r\n\tvoid Awake()\r\n\t{\r\n\t\tif (className == string.Empty)\r\n\t\t{\r\n\t\t\tDebug.LogWarning(\"lua class name Invalid:\"+gameObject.name);\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t// Directly creat a lua class instance to associate with this monobehavior.\r\n\t\tif (!CreateClassInstance(className) || !m_bReady)\r\n\t\t{\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tm_cBehavior.Awake();\r\n\t}\r\n\r\n\t// Use this for initialization\r\n\tvoid Start()\r\n\t{\r\n\t\tif (m_bReady)\r\n\t\t{\r\n\t\t\tm_cBehavior.Start();\r\n\t\t}\r\n\t}\r\n\r\n\t// Update is called once per frame\r\n\tvoid Update()\r\n\t{\r\n\t\tif (m_bReady)\r\n\t\t{\r\n\t\t\tm_cBehavior.Update();\r\n\t\t}\r\n\t}\r\n\r\n\t// The destroy event.\r\n\tvoid OnDestroy()\r\n\t{\r\n\t\tif (m_bReady)\r\n\t\t{\r\n\t\t\tm_cBehavior.OnDestroy();\r\n\t\t}\r\n\t}\r\n\r\n\t// void LateUpdate()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.LateUpdate();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void FixedUpdate()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.FixedUpdate();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnAnimatorIK(int nLayerIndex)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnAnimatorIK(nLayerIndex);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnAnimatorMove()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnAnimatorMove();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnApplicationFocus(bool bFocusStatus)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnApplicationFocus(bFocusStatus);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnApplicationPause(bool bPauseStatus)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnApplicationPause(bPauseStatus);\r\n\t// \t}\r\n\t// }\r\n\r\n\tvoid OnApplicationQuit()\r\n\t{\r\n\t\tif (m_bReady)\r\n\t\t{\r\n\t\t\tm_cBehavior.OnApplicationQuit();\r\n\t\t}\r\n\t}\r\n\r\n\t// void OnBecameInvisible()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnBecameInvisible();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnBecameVisible()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnBecameVisible();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionEnter(Collision cCollision)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionEnter(cCollision);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionEnter2D(Collision2D cCollision2D)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionEnter2D(cCollision2D);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionExit(Collision cCollisionInfo)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionExit(cCollisionInfo);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionExit2D(Collision2D cCollision2DInfo)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionExit2D(cCollision2DInfo);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionStay(Collision cCollisionInfo)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionStay(cCollisionInfo);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnCollisionStay2D(Collision2D cCollision2DInfo)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnCollisionStay2D(cCollision2DInfo);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnControllerColliderHit(ControllerColliderHit cHit)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnControllerColliderHit(cHit);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnDisable()\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnDisable();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEnable()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEnable();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnJointBreak(float fBreakForce)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnJointBreak(fBreakForce);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnLevelWasLoaded(int nLevel)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnLevelWasLoaded(nLevel);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseDown()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseDown();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseDrag()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseDrag();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseEnter()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseEnter();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseExit()\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseExit();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseOver()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseOver();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseUp()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseUp();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnMouseUpAsButton()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnMouseUpAsButton();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnParticleCollision(GameObject cOtherObj)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnParticleCollision(cOtherObj);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnPostRender()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnPostRender();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnPreCull()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnPreCull();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnPreRender()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnPreRender();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnRenderImage(RenderTexture cSrc, RenderTexture cDst)\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnRenderImage(cSrc, cDst);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnRenderObject()\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnRenderObject();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTransformChildrenChanged()\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTransformChildrenChanged();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTransformParentChanged()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTransformParentChanged();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerEnter(Collider cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerEnter(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerEnter2D(Collider2D cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerEnter2D(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerExit(Collider cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerExit(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerExit2D(Collider2D cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerExit2D(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerStay(Collider cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerStay(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnTriggerStay2D(Collider2D cOther)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnTriggerStay2D(cOther);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnValidate()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnValidate();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnWillRenderObject()\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnWillRenderObject();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// [DoNotToLua]\r\n\t// public void OnPointerClick(PointerEventData data)\r\n\t// {\r\n\t// \tif(m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnPointerClick(data);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEventAnim()\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEventAnim();\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEventAnimInt(int i)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEventAnimInt(i);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEventAnimFloat(float f)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEventAnimFloat(f);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEventAnimString(string s)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEventAnimString(s);\r\n\t// \t}\r\n\t// }\r\n\r\n\t// void OnEventAnimObject(object o)\r\n\t// {\r\n\t// \tif (m_bReady)\r\n\t// \t{\r\n\t// \t\tm_cBehavior.OnEventAnimObject(o);\r\n\t// \t}\r\n\t// }\r\n\r\n\t/**\r\n     * Get the lua class instance (Actually a lua table).\r\n     * \r\n     * @param void.\r\n     * @return LuaTable - The class instance table..\r\n     */\r\n\tpublic LuaTable GetInstance()\r\n\t{\r\n\t\treturn m_cBehavior.GetChunk();\r\n\t}\r\n\r\n\t/**\r\n     * Create a lua class instance for monobehavior instead of do a file.\r\n     * \r\n     * @param string strFile - The lua class name.\r\n     * @return bool - true if success, otherwise false.\r\n     */\r\n\tprivate bool CreateClassInstance(string strClassName)\r\n\t{\r\n\t\tif (!m_cBehavior.CreateClassInstance(strClassName))\r\n\t\t{\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t// Init variables.\r\n\t\tm_cBehavior.SetData(\"this\", this);\r\n\t\tm_cBehavior.SetData(\"transform\", transform);\r\n\t\tm_cBehavior.SetData(\"gameObject\", gameObject);\r\n\r\n\t\tm_bReady = true;\r\n\t\treturn true;\r\n\t}\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaBehaviourBase.cs.meta",
    "content": "fileFormatVersion: 2\nguid: fb406b9fd24cd0649bca482338310f87\ntimeCreated: 1455937516\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaBehaviourInterface.cs",
    "content": "﻿using UnityEngine;\nusing SLua;\nusing System.Collections;\nusing UnityEngine.EventSystems;\n\n// The lua behavior base class.\npublic class LLuaBehaviourInterface\n{\n\t// The callback method name.\n\tprivate static readonly string AWAKE = \"Awake\";\n\tprivate static readonly string LATE_UPDATE = \"LateUpdate\";\n\tprivate static readonly string FIXED_UPDATE = \"FixedUpdate\";\n\tprivate static readonly string ON_ANIMATOR_IK = \"OnAnimatorIK\";\n\tprivate static readonly string ON_ANIMATOR_MOVE = \"OnAnimatorMove\";\n\tprivate static readonly string ON_APPLICATION_FOCUS = \"OnApplicationFocus\";\n\tprivate static readonly string ON_APPLICATION_PAUSE = \"OnApplicationPause\";\n\tprivate static readonly string ON_APPLICATION_QUIT = \"OnApplicationQuit\";\n\t//private static readonly string ON_AUDIO_FILTER_READ = \"OnAudioFilterRead\";\t// Skip.\n\tprivate static readonly string ON_BECAME_INVISIBLE = \"OnBecameInvisible\";\n\tprivate static readonly string ON_BECAME_VISIBLE = \"OnBecameVisible\";\n\tprivate static readonly string ON_COLLISION_ENTER = \"OnCollisionEnter\";\n\tprivate static readonly string ON_COLLISION_ENTER_2D = \"OnCollisionEnter2D\";\n\tprivate static readonly string ON_COLLISION_EXIT = \"OnCollisionExit\";\n\tprivate static readonly string ON_COLLISION_EXIT_2D = \"OnCollisionExit2D\";\n\tprivate static readonly string ON_COLLISION_STAY = \"OnCollisionStay\";\n\tprivate static readonly string ON_COLLISION_STAY_2D = \"OnCollisionStay2D\";\n\t//private static readonly string ON_CONNECTED_SERVER = \"OnConnectedToServer\";\t// Skip.\n\tprivate static readonly string ON_CONTROLLER_COLLIDER_HIT = \"OnControllerColliderHit\";\n\tprivate static readonly string ON_DESTROY = \"OnDestroy\";\n\tprivate static readonly string ON_DISABLE = \"OnDisable\";\n\t//private static readonly string ON_DISCONNECTED_FROM_SERVER = \"OnDisconnectedFromServer\";\t// Skip.\n\t//private static readonly string ON_DRAW_GIZMOS = \"OnDrawGizmos\";\t// Skip.\n\t//private static readonly string ON_DRAW_GIZMOS_SELECTED = \"OnDrawGizmosSelected\";\t// Skip.\n\tprivate static readonly string ON_ENABLE = \"OnEnable\";\n\t//private static readonly string ON_FAILED_TO_CONNECT = \"OnFailedToConnect\";\t// Skip.\n\t//private static readonly string ON_FAILED_TO_CONNECT_MASTER_SERVER = \"OnFailedToConnectToMasterServer\";\t// Skip\n\t//private static readonly string ON_GUI = \"OnGUI\";\t// Skip.\n\tprivate static readonly string ON_JOINT_BREAK = \"OnJointBreak\";\n\tprivate static readonly string ON_LEVEL_WAS_LOADED = \"OnLevelWasLoaded\";\n\t//private static readonly string ON_MASTER_SERVER_EVENT = \"OnMasterServerEvent\";\t// Skip.\n\tprivate static readonly string ON_MOUSE_DOWN = \"OnMouseDown\";\n\tprivate static readonly string ON_MOUSE_DRAG = \"OnMouseDrag\";\n\tprivate static readonly string ON_MOUSE_ENTER = \"OnMouseEnter\";\n\tprivate static readonly string ON_MOUSE_EXIT = \"OnMouseExit\";\n\tprivate static readonly string ON_MOUSE_OVER = \"OnMouseOver\";\n\tprivate static readonly string ON_MOUSE_UP = \"OnMouseUp\";\n\tprivate static readonly string ON_MOUSE_UP_AS_BUTTON = \"OnMouseUpAsButton\";\n\t//private static readonly string ON_NETWORK_INSTANTIATE = \"OnNetworkInstantiate\";\t// Skip.\n\tprivate static readonly string ON_PARTICLE_COLLISION = \"OnParticleCollision\";\n\t//private static readonly string ON_PLAYER_CONNECTED = \"OnPlayerConnected\";\t// Skip.\n\t//private static readonly string ON_PLAYER_DISCONNECTED = \"OnPlayerDisconnected\";\t// Skip.\n\tprivate static readonly string ON_POST_RENDER = \"OnPostRender\";\n\tprivate static readonly string ON_PRE_CULL = \"OnPreCull\";\n\tprivate static readonly string ON_PRE_RENDER = \"OnPreRender\";\n\tprivate static readonly string ON_RENDER_IMAGE = \"OnRenderImage\";\n\tprivate static readonly string ON_RENDER_OBJECT = \"OnRenderObject\";\n\t//private static readonly string ON_SERIALIZE_NETWORK_VIEW = \"OnSerializeNetworkView\";\t// Skip.\n\t//private static readonly string ON_SERVER_INITIALIZED = \"OnServerInitialized\";\t// Skip.\n\tprivate static readonly string ON_TRANSFORM_CHILDREN_CHANGED = \"OnTransformChildrenChanged\";\n\tprivate static readonly string ON_TRANSFORM_PARENT_CHANGED = \"OnTransformParentChanged\";\n\tprivate static readonly string ON_TRIGGER_ENTER = \"OnTriggerEnter\";\n\tprivate static readonly string ON_TRIGGER_ENTER_2D = \"OnTriggerEnter2D\";\n\tprivate static readonly string ON_TRIGGER_EXIT = \"OnTriggerExit\";\n\tprivate static readonly string ON_TRIGGER_EXIT_2D = \"OnTriggerExit2D\";\n\tprivate static readonly string ON_TRIGGER_STAY = \"OnTriggerStay\";\n\tprivate static readonly string ON_TRIGGER_STAY_2D = \"OnTriggerStay2D\";\n\tprivate static readonly string ON_VALIDATE = \"OnValidate\";\n\tprivate static readonly string ON_WILL_RENDER_OBJECT = \"OnWillRenderObject\";\n\t//private static readonly string RESET = \"Reset\";\t// Skip.\n\tprivate static readonly string START = \"Start\";\n\tprivate static readonly string UPDATE = \"Update\";\n\tprivate static readonly string ON_POINTER_CLICK = \"OnPointerClick\";\n    //custom\n    private static readonly string ON_EVENT_ANIM = \"OnEventAnim\";\n    private static readonly string ON_EVENT_ANIM_INT = \"OnEventAnimInt\";\n    private static readonly string ON_EVENT_ANIM_FLOAT = \"OnEventAnimFloat\";\n    private static readonly string ON_EVENT_ANIM_STRING = \"OnEventAnimString\";\n    private static readonly string ON_EVENT_ANIM_OBJECT = \"OnEventAnimObject\";\n    private static readonly string ON_WINDOW_OPEN = \"Open\";\n    private static readonly string ON_WINDOW_CLOSE = \"Close\";\n\n    // The function for monobehavior callback event.\n    private LuaFunction m_cAwakeFunc = null;\n\tprivate LuaFunction m_cLateUpdateFunc = null;\n\tprivate LuaFunction m_cFixedUpdateFunc = null;\n\tprivate LuaFunction m_cOnAnimatorIKFunc = null;\n\tprivate LuaFunction m_cOnAnimatorMoveFunc = null;\n\tprivate LuaFunction m_cOnApplicationFocusFunc = null;\n\tprivate LuaFunction m_cOnApplicationPauseFunc = null;\n\tprivate LuaFunction m_cOnApplicationQuitFunc = null;\n\tprivate LuaFunction m_cOnBecameInvisibleFunc = null;\n\tprivate LuaFunction m_cOnBecameVisibleFunc = null;\n\tprivate LuaFunction m_cOnCollisionEnterFunc = null;\n\tprivate LuaFunction m_cOnCollisionEnter2DFunc = null;\n\tprivate LuaFunction m_cOnCollisionExitFunc = null;\n\tprivate LuaFunction m_cOnCollisionExit2DFunc = null;\n\tprivate LuaFunction m_cOnCollisionStayFunc = null;\n\tprivate LuaFunction m_cOnCollisionStay2DFunc = null;\n\tprivate LuaFunction m_cOnControllerColliderHitFunc = null;\n\tprivate LuaFunction m_cOnDestroy = null;\n\tprivate LuaFunction m_cOnDisableFunc = null;\n\tprivate LuaFunction m_cOnEnableFunc = null;\n\tprivate LuaFunction m_cOnJointBreakFunc = null;\n\tprivate LuaFunction m_cOnLevelWasLoadedFunc = null;\n\tprivate LuaFunction m_cOnMouseDownFunc = null;\n\tprivate LuaFunction m_cOnMouseDragFunc = null;\n\tprivate LuaFunction m_cOnMouseEnterFunc = null;\n\tprivate LuaFunction m_cOnMouseExitFunc = null;\n\tprivate LuaFunction m_cOnMouseOverFunc = null;\n\tprivate LuaFunction m_cOnMouseUpFunc = null;\n\tprivate LuaFunction m_cOnMouseUpAsButtonFunc = null;\n\tprivate LuaFunction m_cOnParticleCollisionFunc = null;\n\tprivate LuaFunction m_cOnPostRenderFunc = null;\n\tprivate LuaFunction m_cOnPreCullFunc = null;\n\tprivate LuaFunction m_cOnPreRenderFunc = null;\n\tprivate LuaFunction m_cOnRenderImageFunc = null;\n\tprivate LuaFunction m_cOnRenderObjectFunc = null;\n\tprivate LuaFunction m_cOnTransformChildrenChangedFunc = null;\n\tprivate LuaFunction m_cOnTransformParentChangedFunc = null;\n\tprivate LuaFunction m_cOnTriggerEnterFunc = null;\n\tprivate LuaFunction m_cOnTriggerEnter2DFunc = null;\n\tprivate LuaFunction m_cOnTriggerExitFunc = null;\n\tprivate LuaFunction m_cOnTriggerExit2DFunc = null;\n\tprivate LuaFunction m_cOnTriggerStayFunc = null;\n\tprivate LuaFunction m_cOnTriggerStay2DFunc = null;\n\tprivate LuaFunction m_cOnValidateFunc = null;\n\tprivate LuaFunction m_cOnWillRenderObjectFunc = null;\n\tprivate LuaFunction m_cStartFunc = null;\n\tprivate LuaFunction m_cUpdateFunc = null;\n\tprivate LuaFunction m_cOnPointerClick = null;\n    //custom\n    private LuaFunction m_cOnEventAnim = null;\n    private LuaFunction m_cOnEventAnimInt = null;\n    private LuaFunction m_cOnEventAnimFloat = null;\n    private LuaFunction m_cOnEventAnimString = null;\n    private LuaFunction m_cOnEventAnimObject = null;\n    private LuaFunction m_cOnWindowOpen = null;\n    private LuaFunction m_cOnWindowClose = null;\n\n    // The lua table operator of this behavior.\n    private LLuaTable m_cLuaTableOpt = null;\n\n\t/**\n     * Constructor.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic LLuaBehaviourInterface()\n\t{\n\t}\n\n\t/**\n     * Destructor.\n     * \n     * @param void.\n     * @return void.\n     */\n\t~LLuaBehaviourInterface()\n\t{\n\t}\n\n\t/**\n     * Awake method.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void Awake()\n\t{\n\t\tCallMethod(ref m_cAwakeFunc, AWAKE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Late update method.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void LateUpdate()\n\t{\n\t\tCallMethod(ref m_cLateUpdateFunc, LATE_UPDATE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Fixed update method.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void FixedUpdate()\n\t{\n\t\tCallMethod(ref m_cFixedUpdateFunc, FIXED_UPDATE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\n\t/**\n     * Callback for setting up animation IK (inverse kinematics).\n     * \n     * @param int nLayerIndex - The layer index.\n     * @return void.\n     */\n\tpublic void OnAnimatorIK(int nLayerIndex)\n\t{\n\t\tCallMethod(ref m_cOnAnimatorIKFunc, ON_ANIMATOR_IK, m_cLuaTableOpt.GetChunk(), nLayerIndex);\n\t}\n\n\t/**\n     * Callback for processing animation movements for modifying root motion.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnAnimatorMove()\n\t{\n\t\tCallMethod(ref m_cOnAnimatorMoveFunc, ON_ANIMATOR_MOVE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Sent to all game objects when the player gets or loses focus.\n     * \n     * @param bool bFocusStatus - The focus status.\n     * @return void.\n     */\n\tpublic void OnApplicationFocus(bool bFocusStatus)\n\t{\n\t\tCallMethod(ref m_cOnApplicationFocusFunc, ON_APPLICATION_FOCUS, m_cLuaTableOpt.GetChunk(), bFocusStatus);\n\t}\n\n\t/**\n     * Sent to all game objects when the player pauses.\n     * \n     * @param bool bPauseStatus - The pause status.\n     * @return void.\n     */\n\tpublic void OnApplicationPause(bool bPauseStatus)\n\t{\n\t\tCallMethod(ref m_cOnApplicationPauseFunc, ON_APPLICATION_PAUSE, m_cLuaTableOpt.GetChunk(), bPauseStatus);\n\t}\n\n\t/**\n     * Sent to all game objects before the application is quit.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnApplicationQuit()\n\t{\n\t\tCallMethod(ref m_cOnApplicationQuitFunc, ON_APPLICATION_QUIT, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnBecameInvisible is called when the renderer is no longer visible by any camera.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnBecameInvisible()\n\t{\n\t\tCallMethod(ref m_cOnBecameInvisibleFunc, ON_BECAME_INVISIBLE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnBecameVisible is called when the renderer became visible by any camera.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnBecameVisible()\n\t{\n\t\tCallMethod(ref m_cOnBecameVisibleFunc, ON_BECAME_VISIBLE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnCollisionEnter is called when this collider/rigidbody has begun touching another rigidbody/collider.\n     * \n     * @param Collision cCollision - The collison.\n     * @return void.\n     */\n\tpublic void OnCollisionEnter(Collision cCollision)\n\t{\n\t\tCallMethod(ref m_cOnCollisionEnterFunc, ON_COLLISION_ENTER, m_cLuaTableOpt.GetChunk(), cCollision);\n\t}\n\n\t/**\n     * Sent when an incoming collider makes contact with this object's collider (2D physics only).\n     * \n     * @param Collision2D cCollision2D - The collison for 2d.\n     * @return void.\n     */\n\tpublic void OnCollisionEnter2D(Collision2D cCollision2D)\n\t{\n\t\tCallMethod(ref m_cOnCollisionEnter2DFunc, ON_COLLISION_ENTER_2D, m_cLuaTableOpt.GetChunk(), cCollision2D);\n\t}\n\n\t/**\n     * OnCollisionExit is called when this collider/rigidbody has stopped touching another rigidbody/collider.\n     * \n     * @param Collision2D cCollisionInfo - The collison info.\n     * @return void.\n     */\n\tpublic void OnCollisionExit(Collision cCollisionInfo)\n\t{\n\t\tCallMethod(ref m_cOnCollisionExitFunc, ON_COLLISION_EXIT, m_cLuaTableOpt.GetChunk(), cCollisionInfo);\n\t}\n\n\t/**\n     * Sent when a collider on another object stops touching this object's collider (2D physics only).\n     * \n     * @param Collision2D cCollision2DInfo - The collison info for 2d.\n     * @return void.\n     */\n\tpublic void OnCollisionExit2D(Collision2D cCollision2DInfo)\n\t{\n\t\tCallMethod(ref m_cOnCollisionExit2DFunc, ON_COLLISION_EXIT_2D, m_cLuaTableOpt.GetChunk(), cCollision2DInfo);\n\t}\n\n\t/**\n     * OnCollisionStay is called once per frame for every collider/rigidbody that is touching rigidbody/collider.\n     * \n     * @param Collision cCollisionInfo - The collison info.\n     * @return void.\n     */\n\tpublic void OnCollisionStay(Collision cCollisionInfo)\n\t{\n\t\tCallMethod(ref m_cOnCollisionStayFunc, ON_COLLISION_STAY, m_cLuaTableOpt.GetChunk(), cCollisionInfo);\n\t}\n\n\t/**\n     * Sent each frame where a collider on another object is touching this object's collider (2D physics only).\n     * \n     * @param Collision2D cCollision2DInfo - The collison info for 2d.\n     * @return void.\n     */\n\tpublic void OnCollisionStay2D(Collision2D cCollision2DInfo)\n\t{\n\t\tCallMethod(ref m_cOnCollisionStay2DFunc, ON_COLLISION_STAY_2D, m_cLuaTableOpt.GetChunk(), cCollision2DInfo);\n\t}\n\n\t/**\n     * OnControllerColliderHit is called when the controller hits a collider while performing a Move.\n     * \n     * @param ControllerColliderHit cHit - The hit info.\n     * @return void.\n     */\n\tpublic void OnControllerColliderHit(ControllerColliderHit cHit)\n\t{\n\t\tCallMethod(ref m_cOnControllerColliderHitFunc, ON_CONTROLLER_COLLIDER_HIT, m_cLuaTableOpt.GetChunk(), cHit);\n\t}\n\n\t/**\n     * On destroy method.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnDestroy()\n\t{\n\t\tCallMethod(ref m_cOnDestroy, ON_DESTROY, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * This function is called when the behaviour becomes disabled () or inactive.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnDisable()\n\t{\n\t\tCallMethod(ref m_cOnDisableFunc, ON_DISABLE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * This function is called when the object becomes enabled and active.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnEnable()\n\t{\n\t\tCallMethod(ref m_cOnEnableFunc, ON_ENABLE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Called when a joint attached to the same game object broke.\n     * \n     * @param float fBreakForce - The break force.\n     * @return void.\n     */\n\tpublic void OnJointBreak(float fBreakForce)\n\t{\n\t\tCallMethod(ref m_cOnJointBreakFunc, ON_JOINT_BREAK, m_cLuaTableOpt.GetChunk(), fBreakForce);\n\t}\n\n\t/**\n     * This function is called after a new level was loaded.\n     * \n     * @param int nLevel - The loaded level.\n     * @return void.\n     */\n\tpublic void OnLevelWasLoaded(int nLevel)\n\t{\n\t\tCallMethod(ref m_cOnLevelWasLoadedFunc, ON_LEVEL_WAS_LOADED, m_cLuaTableOpt.GetChunk(), nLevel);\n\t}\n\n\t/**\n     * OnMouseDown is called when the user has pressed the mouse button while over the GUIElement or Collider.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseDown()\n\t{\n\t\tCallMethod(ref m_cOnMouseDownFunc, ON_MOUSE_DOWN, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnMouseDrag is called when the user has clicked on a GUIElement or Collider and is still holding down the mouse.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseDrag()\n\t{\n\t\tCallMethod(ref m_cOnMouseDragFunc, ON_MOUSE_DRAG, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Called when the mouse enters the GUIElement or Collider.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseEnter()\n\t{\n\t\tCallMethod(ref m_cOnMouseEnterFunc, ON_MOUSE_ENTER, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Called when the mouse is not any longer over the GUIElement or Collider.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseExit()\n\t{\n\t\tCallMethod(ref m_cOnMouseExitFunc, ON_MOUSE_EXIT, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Called every frame while the mouse is over the GUIElement or Collider.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseOver()\n\t{\n\t\tCallMethod(ref m_cOnMouseOverFunc, ON_MOUSE_OVER, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnMouseUp is called when the user has released the mouse button.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseUp()\n\t{\n\t\tCallMethod(ref m_cOnMouseUpFunc, ON_MOUSE_UP, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnMouseUpAsButton is only called when the mouse is released over the same GUIElement or Collider as it was pressed.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnMouseUpAsButton()\n\t{\n\t\tCallMethod(ref m_cOnMouseUpAsButtonFunc, ON_MOUSE_UP_AS_BUTTON, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnParticleCollision is called when a particle hits a collider.\n     * This can be used to apply damage to a game object when hit by particles.\n     * \n     * @param GameObject cOtherObj - The other particle game object.\n     * @return void.\n     */\n\tpublic void OnParticleCollision(GameObject cOtherObj)\n\t{\n\t\tCallMethod(ref m_cOnParticleCollisionFunc, ON_PARTICLE_COLLISION, m_cLuaTableOpt.GetChunk(), cOtherObj);\n\t}\n\n\t/**\n     * OnPostRender is called after a camera finished rendering the scene.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnPostRender()\n\t{\n\t\tCallMethod(ref m_cOnPostRenderFunc, ON_POST_RENDER, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnPreCull is called before a camera culls the scene.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnPreCull()\n\t{\n\t\tCallMethod(ref m_cOnPreCullFunc, ON_PRE_CULL, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnPreRender is called before a camera starts rendering the scene.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnPreRender()\n\t{\n\t\tCallMethod(ref m_cOnPreRenderFunc, ON_PRE_RENDER, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnRenderImage is called after all rendering is complete to render image.\n     * \n     * @param RenderTexture cSrc - The source render texture.\n     * @param RenderTexture cDst - The destination render texture.\n     * @return void.\n     */\n\tpublic void OnRenderImage(RenderTexture cSrc, RenderTexture cDst)\n\t{\n\t\tCallMethod(ref m_cOnRenderImageFunc, ON_RENDER_IMAGE, m_cLuaTableOpt.GetChunk(), cSrc, cDst);\n\t}\n\n\t/**\n     * OnRenderObject is called after camera has rendered the scene.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnRenderObject()\n\t{\n\t\tCallMethod(ref m_cOnRenderObjectFunc, ON_RENDER_OBJECT, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * This function is called when the list of children of the transform of the GameObject has changed.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnTransformChildrenChanged()\n\t{\n\t\tCallMethod(ref m_cOnTransformChildrenChangedFunc, ON_TRANSFORM_CHILDREN_CHANGED, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * This function is called when the parent property of the transform of the GameObject has changed.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnTransformParentChanged()\n\t{\n\t\tCallMethod(ref m_cOnTransformParentChangedFunc, ON_TRANSFORM_PARENT_CHANGED, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnTriggerEnter is called when the Collider other enters the trigger.\n     * \n     * @param Collider cOther - The other collider.\n     * @return void.\n     */\n\tpublic void OnTriggerEnter(Collider cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerEnterFunc, ON_TRIGGER_ENTER, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * Sent when another object enters a trigger collider attached to this object (2D physics only).\n     * \n     * @param Collider2D cOther - The other collider for 2d.\n     * @return void.\n     */\n\tpublic void OnTriggerEnter2D(Collider2D cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerEnter2DFunc, ON_TRIGGER_ENTER_2D, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * OnTriggerExit is called when the Collider other has stopped touching the trigger.\n     * \n     * @param Collider cOther - The other collider.\n     * @return void.\n     */\n\tpublic void OnTriggerExit(Collider cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerExitFunc, ON_TRIGGER_EXIT, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * Sent when another object leaves a trigger collider attached to this object (2D physics only).\n     * \n     * @param Collider2D cOther - The other collider for 2d.\n     * @return void.\n     */\n\tpublic void OnTriggerExit2D(Collider2D cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerExit2DFunc, ON_TRIGGER_EXIT_2D, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * OnTriggerStay is called once per frame for every Collider other that is touching the trigger.\n     * \n     * @param Collider2D cOther - The other collider.\n     * @return void.\n     */\n\tpublic void OnTriggerStay(Collider cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerStayFunc, ON_TRIGGER_STAY, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * Sent each frame where another object is within a trigger collider attached to this object (2D physics only).\n     * \n     * @param Collider2D cOther - The other collider for 2d.\n     * @return void.\n     */\n\tpublic void OnTriggerStay2D(Collider2D cOther)\n\t{\n\t\tCallMethod(ref m_cOnTriggerStay2DFunc, ON_TRIGGER_STAY_2D, m_cLuaTableOpt.GetChunk(), cOther);\n\t}\n\n\t/**\n     * This function is called when the script is loaded or a value is changed in the inspector (Called in the editor only).\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnValidate()\n\t{\n\t\tCallMethod(ref m_cOnValidateFunc, ON_VALIDATE, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * OnWillRenderObject is called once for each camera if the object is visible.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void OnWillRenderObject()\n\t{\n\t\tCallMethod(ref m_cOnWillRenderObjectFunc, ON_WILL_RENDER_OBJECT, m_cLuaTableOpt.GetChunk());\n\t}\n\n\tpublic void OnPointerClick(PointerEventData eventData)\n\t{\n\t\tCallMethod (ref m_cOnPointerClick, ON_POINTER_CLICK, m_cLuaTableOpt.GetChunk (),eventData);\n\t}\n\n\t/**\n     * Start method, this is the main entry.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void Start()\n\t{\n\t\tCallMethod(ref m_cStartFunc, START, m_cLuaTableOpt.GetChunk());\n\t}\n\n\t/**\n     * Update method.\n     * \n     * @param void.\n     * @return void.\n     */\n\tpublic void Update()\n\t{\n\t\tCallMethod(ref m_cUpdateFunc, UPDATE, m_cLuaTableOpt.GetChunk());\n\t}\n\n    public void OnEventAnim()\n    {\n        CallMethod(ref m_cOnEventAnim, ON_EVENT_ANIM, m_cLuaTableOpt.GetChunk());\n    }\n\n    public void OnEventAnimInt(int i)\n    {\n        CallMethod(ref m_cOnEventAnimInt, ON_EVENT_ANIM_INT, m_cLuaTableOpt.GetChunk(),i);\n    }\n\n    public void OnEventAnimFloat(float f)\n    {\n        CallMethod(ref m_cOnEventAnimFloat, ON_EVENT_ANIM_FLOAT, m_cLuaTableOpt.GetChunk(),f);\n    }\n\n    public void OnEventAnimString(string s)\n    {\n        CallMethod(ref m_cOnEventAnimString, ON_EVENT_ANIM_STRING, m_cLuaTableOpt.GetChunk(),s);\n    }\n\n    public void OnEventAnimObject(object o)\n    {\n        CallMethod(ref m_cOnEventAnimObject, ON_EVENT_ANIM_OBJECT, m_cLuaTableOpt.GetChunk(),o);\n    }\n\n    public void OnWindowOpen(object[] objs)\n    {\n        CallMethod(ref m_cOnWindowOpen, ON_WINDOW_OPEN, m_cLuaTableOpt.GetChunk(), objs);\n    }\n\n    public void OnWindowClose()\n    {\n        CallMethod(ref m_cOnWindowClose, ON_WINDOW_CLOSE, m_cLuaTableOpt.GetChunk());\n    }\n\n    /**\n     * Load an lua file.\n     * \n     * @param string strFile - The file name without extension.\n     * @return bool - true if success, otherwise false.\n     */\n    public bool DoFile(string strFile)\n\t{\n\t\tif (string.IsNullOrEmpty(strFile))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Try to do file.\n\t\ttry\n\t\t{\n\t\t\t// The lua file return the table itself.\n\t\t\tobject cChunk = Game.GetLuaSvr().luaState.doFile(strFile);\n\t\t\tif ((null == cChunk) || !(cChunk is LuaTable))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// Remember lua table.\n\t\t\tm_cLuaTableOpt = new LLuaTable((LuaTable)cChunk);\n\t\t\treturn true;\n\t\t}\n\t\tcatch (System.Exception e)\n\t\t{\n\t\t\tDebug.LogError(LUtil.FormatException(e));\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n     * Create a lua class instance for monobehavior instead of do a file.\n     * \n     * @param string strFile - The lua class name.\n     * @return bool - true if success, otherwise false.\n     */\n\tpublic bool CreateClassInstance(string strClassName)\n\t{\n\t\tif (string.IsNullOrEmpty(strClassName))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t// Try to get global lua class.\n\t\ttry\n\t\t{\n\t\t\t// Get class first.\n\t\t\tLuaTable cClsTable = (LuaTable)Game.GetLuaSvr().luaState[strClassName];\n\t\t\tif (null == cClsTable)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// Get \"new\" method of the lua class to create instance.\n\t\t\tLuaFunction cNew = (LuaFunction)cClsTable[\"new\"];\n\t\t\tif (null == cNew)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// We choose no default init parameter for constructor.\n\t\t\tobject cInsChunk = cNew.call();\n\t\t\tif (null == cInsChunk)\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// If we create instance ok, use it as table.\n\t\t\tm_cLuaTableOpt = new LLuaTable((LuaTable)cInsChunk);\n\t\t\treturn true;\n\t\t}\n\t\tcatch (System.Exception e)\n\t\t{\n\t\t\tDebug.LogError(LUtil.FormatException(e));\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n     * Get the lua code chunk holder (lua table).\n     * \n     * @param void.\n     * @return YwLuaTable - The chunk table holder.\n     */\n\tpublic LLuaTable GetChunkHolder()\n\t{\n\t\treturn m_cLuaTableOpt;\n\t}\n\n\t/**\n     * Get the lua code chunk (table).\n     * \n     * @param void.\n     * @return LuaTable - The chunk table.\n     */\n\tpublic LuaTable GetChunk()\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.GetChunk();\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * \n     * @param string strName - The key name of the table.\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(string strName, object cValue)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tm_cLuaTableOpt.SetData(strName, cValue);\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * This is used to set an array data to an sub-table.\n     * \n     * @param string strName - The key name of the sub-table.\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(string strName, object[] cArrayValue)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tm_cLuaTableOpt.SetData(strName, cArrayValue);\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * \n     * @param int nIndex - The index of the table. (Start from 1.).\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(int nIndex, object cValue)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tm_cLuaTableOpt.SetData(nIndex, cValue);\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * This is used to set an array data to an sub-table.\n     * \n     * @param int nIndex - The index of the sub-table. (Start from 1.)\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(int nIndex, object[] cArrayValue)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tm_cLuaTableOpt.SetData(nIndex, cArrayValue);\n\t}\n\n\t/**\n     * Get lua data from a lua table, used to communiate with other lua files.\n     * \n     * @param string strName - The key name of the table.\n     * @return object cValue - The value associated to the key.\n     */\n\tpublic object GetData(string strName)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.GetData(strName);\n\t}\n\n\t/**\n     * Get lua data from a lua table, used to communiate with other lua files.\n     * \n     * @param int nIndex - The index of the table.\n     * @return object cValue - The value associated to the key.\n     */\n\tpublic object GetData(int nIndex)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.GetData(nIndex);\n\t}\n\n\t/**\n     * Call a lua method.\n     * \n     * @param out LuaFunction cFunc - The out function. If it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @return object - The number of result.\n     */\n\tpublic object CallMethod(ref LuaFunction cFunc, string strFunc)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.CallMethod(ref cFunc, strFunc);\n\t}\n\n\t/**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cFunc - The out function. If it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam - The param.\n     * @return object - The number of result.\n     */\n\tpublic object CallMethod(ref LuaFunction cFunc, string strFunc, object cParam)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.CallMethod(ref cFunc, strFunc, cParam);\n\t}\n\n\t/**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cFunc - The out function. If it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam1 - The first param.\n     * @param object cParam2 - The second param.\n     * @return object - The number of result.\n     */\n\tpublic object CallMethod(ref LuaFunction cFunc, string strFunc, object cParam1, object cParam2)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.CallMethod(ref cFunc, strFunc, cParam1, cParam2);\n\t}\n\n\t/**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cFunc - The out function. If it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam1 - The first param.\n     * @param object cParam2 - The second param.\n     * @param object cParam3 - The third param.\n     * @return object - The number of result.\n     */\n\tpublic object CallMethod(ref LuaFunction cFunc, string strFunc, object cParam1, object cParam2, object cParam3)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.CallMethod(ref cFunc, strFunc, cParam1, cParam2, cParam3);\n\t}\n\n\t/**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cFunc - The out function. If it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param params object[] aParams - The params.\n     * @return object - The number of result.\n     */\n\tpublic object CallMethod(ref LuaFunction cFunc, string strFunc, params object[] aParams)\n\t{\n\t\tif (null == m_cLuaTableOpt)\n\t\t{\n\t\t\treturn null;\n\t\t}\n\n\t\treturn m_cLuaTableOpt.CallMethod(ref cFunc, strFunc, aParams);\n\t}\n}\n\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaBehaviourInterface.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 7d09a01b226facd47af10c9877fad629\ntimeCreated: 1455934227\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaTable.cs",
    "content": "using UnityEngine;\nusing SLua;\nusing System.Collections;\nusing System;\n\n// The lua table operator base class.\npublic class LLuaTable\n{\n    // The lua table of this behavior.\n    private LuaTable m_cLuaTable = null;\n\n    /**\n     * Constructor.\n     * \n     * @param void.\n     * @return void.\n     */\n    public LLuaTable(LuaTable cTable)\n    {\n        m_cLuaTable = cTable;\n    }\n    \n    /**\n     * Destructor.\n     * \n     * @param void.\n     * @return void.\n     */\n    ~LLuaTable()\n    {\n\t\t// Dispose table.\n\t\tif (null != m_cLuaTable)\n\t\t{\n\t\t\tm_cLuaTable.Dispose();\n\t\t\tm_cLuaTable = null;\n\t\t}\n    }\n\n\t// Get if this lua table is valid.\n\t// true if valid, false is invalid.\n\tpublic bool Valid\n\t{\n\t\tget\n\t\t{\n\t\t\treturn (null != m_cLuaTable) && (null != LuaState.main);\n\t\t}\n\t}\n\n    /**\n     * Get the lua code chunk (table).\n     * \n     * @param void.\n     * @return LuaTable - The chunk table.\n     */\n    public LuaTable GetChunk()\n    {\n\t\treturn Valid ? m_cLuaTable : null;\n    }\n\n    /**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * \n     * @param string strName - The key name of the table.\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n    public void SetData(string strName, object cValue)\n    {\n        if (!Valid || string.IsNullOrEmpty(strName))\n        {\n\t\t\treturn;\n        }\n\n\t\tm_cLuaTable[strName] = cValue;\n    }\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * This is used to set an array data to an sub-table.\n     * \n     * @param string strName - The key name of the sub-table.\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(string strName, object[] cArrayValue)\n\t{\n\t\tif (!Valid)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tif (string.IsNullOrEmpty(strName) || (null == cArrayValue) || (0 == cArrayValue.Length))\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tLuaTable cSubTable = (LuaTable)m_cLuaTable[strName];\n\t\tif (null == cSubTable)\n\t\t{\n\t\t\treturn;\n\t\t}\n\n\t\tint nLength = cArrayValue.Length;\n\t\tfor (int i = 0; i < nLength; i++)\n\t\t{\n\t\t\tcSubTable[i + 1] = cArrayValue[i];\n\t\t}\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * \n     * @param int nIndex - The index of the table. (Start from 1.).\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(int nIndex, object cValue)\n\t{\n\t\tif (!Valid || (nIndex < 1))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tm_cLuaTable[nIndex] = cValue;\n\t}\n\n\t/**\n     * Set lua data to a lua table, used to communiate with other lua files.\n     * This is used to set an array data to an sub-table.\n     * \n     * @param int nIndex - The index of the sub-table. (Start from 1.)\n     * @param object cValue - The value associated to the key.\n     * @return void.\n     */\n\tpublic void SetData(int nIndex, object[] cArrayValue)\n\t{\n\t\tif (!Valid)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tif ((nIndex < 1) || (null == cArrayValue) || (0 == cArrayValue.Length))\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tLuaTable cSubTable = (LuaTable)m_cLuaTable[nIndex];\n\t\tif (null == cSubTable)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint nLength = cArrayValue.Length;\n\t\tfor (int i = 0; i < nLength; i++)\n\t\t{\n\t\t\tcSubTable[i + 1] = cArrayValue[i];\n\t\t}\n\t}\n\n\t/**\n     * Get lua data from a lua table, used to communiate with other lua files.\n     * \n     * @param string strName - The key name of the table.\n     * @return object cValue - The value associated to the key.\n     */\n\tpublic object GetData(string strName)\n\t{\n\t\tif (!Valid || string.IsNullOrEmpty(strName))\n\t\t{\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\treturn m_cLuaTable[strName];\n\t}\n\n\t/**\n     * Get lua data from a lua table, used to communiate with other lua files.\n     * \n     * @param int nIndex - The index of the table.\n     * @return object cValue - The value associated to the key.\n     */\n\tpublic object GetData(int nIndex)\n\t{\n\t\tif (!Valid || (nIndex < 1))\n\t\t{\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\treturn m_cLuaTable[nIndex];\n\t}\n\n    /**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cResFunc - The result of the function, if the lua function calls ok, if it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @return object - The number of result.\n     */\n    public object CallMethod(ref LuaFunction cResFunc, string strFunc)\n    {\n        // Check function first.\n        if (null == cResFunc)\n        {\n            // Check params.\n            if (string.IsNullOrEmpty(strFunc))\n            {\n                return null;\n            }\n\n            // Check table.\n\t\t\tif (!Valid)\n            {\n                return null;\n            }\n\n            // Check function.\n            object cFuncObj = m_cLuaTable[strFunc];\n            if ((null == cFuncObj) || !(cFuncObj is LuaFunction))\n            {\n                return null;\n            }\n            \n            // Get function.\n            cResFunc = (LuaFunction)cFuncObj;\n            if (null == cResFunc)\n            {\n                return null;\n            }\n        }\n        \n        // Try to call this method.\n        try\n        {\n            return cResFunc.call();\n        }\n        catch (Exception e)\n        {\n            Debug.LogError(LUtil.FormatException(e));\n            cResFunc = null;\n            return null;\n        }\n    }\n\n    /**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cResFunc - The result of the function, if the lua function calls ok, if it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam - The param.\n     * @return object - The returned value.\n     */\n    public object CallMethod(ref LuaFunction cResFunc, string strFunc, object cParam)\n    {\n        // Check function first.\n        if (null == cResFunc)\n        {\n            // Check params.\n            if (string.IsNullOrEmpty(strFunc))\n            {\n                return null;\n            }\n            \n            // Check table.\n\t\t\tif (!Valid)\n            {\n                return null;\n            }\n            \n            // Check function.\n            object cFuncObj = m_cLuaTable[strFunc];\n            if ((null == cFuncObj) || !(cFuncObj is LuaFunction))\n            {\n                return null;\n            }\n            \n            // Get function.\n            cResFunc = (LuaFunction)cFuncObj;\n            if (null == cResFunc)\n            {\n                return null;\n            }\n        }\n        \n        // Try to call this method.\n        try\n        {\n            return cResFunc.call(cParam);\n        }\n        catch (Exception e)\n        {\n            Debug.LogError(LUtil.FormatException(e));\n            cResFunc = null;\n            return null;\n        }\n    }\n\n    /**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cResFunc - The result of the function, if the lua function calls ok, if it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam1 - The first param.\n     * @param object cParam2 - The second param.\n     * @return object - The number of result.\n     */\n    public object CallMethod(ref LuaFunction cResFunc, string strFunc, object cParam1, object cParam2)\n    {\n        // Check function first.\n        if (null == cResFunc)\n        {\n            // Check params.\n            if (string.IsNullOrEmpty(strFunc))\n            {\n                return null;\n            }\n            \n            // Check table.\n\t\t\tif (!Valid)\n            {\n                return null;\n            }\n            \n            // Check function.\n            object cFuncObj = m_cLuaTable[strFunc];\n            if ((null == cFuncObj) || !(cFuncObj is LuaFunction))\n            {\n                return null;\n            }\n            \n            // Get function.\n            cResFunc = (LuaFunction)cFuncObj;\n            if (null == cResFunc)\n            {\n                return null;\n            }\n        }\n        \n        // Try to call this method.\n        try\n        {\n            return cResFunc.call(cParam1, cParam2);\n        }\n        catch (Exception e)\n        {\n            Debug.LogError(LUtil.FormatException(e));\n            cResFunc = null;\n            return null;\n        }\n    }\n\n    /**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cResFunc - The result of the function, if the lua function calls ok, if it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param object cParam1 - The first param.\n     * @param object cParam2 - The second param.\n     * @param object cParam3 - The third param.\n     * @return object - The number of result.\n     */\n    public object CallMethod(ref LuaFunction cResFunc, string strFunc, object cParam1, object cParam2, object cParam3)\n    {\n        // Check function first.\n        if (null == cResFunc)\n        {\n            // Check params.\n            if (string.IsNullOrEmpty(strFunc))\n            {\n                return null;\n            }\n            \n            // Check table.\n\t\t\tif (!Valid)\n            {\n                return null;\n            }\n            \n            // Check function.\n            object cFuncObj = m_cLuaTable[strFunc];\n            if ((null == cFuncObj) || !(cFuncObj is LuaFunction))\n            {\n                return null;\n            }\n            \n            // Get function.\n            cResFunc = (LuaFunction)cFuncObj;\n            if (null == cResFunc)\n            {\n                return null;\n            }\n        }\n        \n        // Try to call this method.\n        try\n        {\n            return cResFunc.call(cParam1, cParam2, cParam3);\n        }\n        catch (Exception e)\n        {\n            Debug.LogError(LUtil.FormatException(e));\n            cResFunc = null;\n            return null;\n        }\n    }\n\n    /**\n     * Call a lua method.\n     * \n     * @param ref LuaFunction cResFunc - The result of the function, if the lua function calls ok, if it is not null, will call it instead of look up from table by strFunc.\n     * @param string strFunc - The function name.\n     * @param params object[] aParams - The params.\n     * @return object - The number of result.\n     */\n    public object CallMethod(ref LuaFunction cResFunc, string strFunc, params object[] aParams)\n    {\n        // Check function first.\n        if (null == cResFunc)\n        {\n            // Check params.\n            if (string.IsNullOrEmpty(strFunc))\n            {\n                return null;\n            }\n            \n            // Check table.\n\t\t\tif (!Valid)\n            {\n                return null;\n            }\n            \n            // Check function.\n            object cFuncObj = m_cLuaTable[strFunc];\n            if ((null == cFuncObj) || !(cFuncObj is LuaFunction))\n            {\n                return null;\n            }\n            \n            // Get function.\n            cResFunc = (LuaFunction)cFuncObj;\n            if (null == cResFunc)\n            {\n                return null;\n            }\n        }\n        \n        // Try to call this method.\n        try\n        {\n            if (null == aParams)\n            {\n                return cResFunc.call();\n            }\n            else\n            {\n                return cResFunc.call(aParams);\n            }\n        }\n        catch (Exception e)\n        {\n            Debug.LogError(LUtil.FormatException(e));\n            cResFunc = null;\n            return null;\n        }\n    }\n}\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LLuaTable.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 220eea2e59317704da5c5cc8262843e6\ntimeCreated: 1455934558\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LResUpdate.cs",
    "content": "﻿using UnityEngine;\r\nusing UnityEngine.Events;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\n// using ICSharpCode.SharpZipLib.Zip;\r\nusing System.Text;\r\nusing System.IO;\r\nusing System;\r\nusing SLua;\r\n\r\n[CustomLuaClassAttribute]\r\npublic class LResUpdate : MonoBehaviour\r\n{\r\n    public static readonly string VERSION_FILE = \"version.ver\";\r\n\r\n    private Dictionary<string, string> LocalResVersion;\r\n    private Dictionary<string, string> ServerResVersion;\r\n    private List<string> NeedDownFiles;\r\n    private bool NeedUpdateLocalVersionFile = false;\r\n    private int doneCount;\r\n\r\n    public UnityAction onCompleteHandler;\r\n    public HandleUnzipProgress onUnzipProgressHandler;\r\n\r\n    public static string LOCAL_RES_URL\r\n    {\r\n        get\r\n        {\r\n            if (!LGameConfig.GetInstance().isDebug && LGameConfig.GetInstance().isHotFix)\r\n            {\r\n                return LGameConfig.LOCAL_URL_PREFIX + Application.persistentDataPath + Path.DirectorySeparatorChar;\r\n            }\r\n            else {\r\n#if UNITY_STANDALONE_WIN\r\n\t\t\t\treturn \"file://\" + Application.dataPath + \"/StreamingAssets/\";  \r\n#elif UNITY_ANDROID\r\n                    return Application.streamingAssetsPath + Path.DirectorySeparatorChar;\r\n#elif UNITY_IPHONE\r\n                    return \"file://\"+Application.streamingAssetsPath+ Path.DirectorySeparatorChar;  \r\n#else\r\n                    return string.Empty;  \r\n#endif\r\n            }\r\n        }\r\n    }\r\n\r\n    public static string LOCAL_RES_PATH\r\n    {\r\n        get\r\n        {\r\n            return Application.persistentDataPath + Path.DirectorySeparatorChar;\r\n        }\r\n    }\r\n\r\n    public void checkUpdate()\r\n    {\r\n        Debug.Log(\"开始热更\");\r\n        //初始化  \r\n        LocalResVersion = new Dictionary<string, string>();\r\n        ServerResVersion = new Dictionary<string, string>();\r\n        NeedDownFiles = new List<string>();\r\n\r\n        Debug.Log(\"客户端ver:\" + LOCAL_RES_URL + VERSION_FILE);\r\n        //加载本地version配置  \r\n        StartCoroutine(DownLoad(LOCAL_RES_URL + VERSION_FILE, delegate (WWW localVersion)\r\n        {\r\n            //保存本地的version  \r\n            ParseVersionFile(localVersion.text, LocalResVersion);\r\n            Debug.Log(\"服务端ver:\" + LGameConfig.GetInstance().SERVER_RES_URL + Path.DirectorySeparatorChar + VERSION_FILE);\r\n            //加载服务端version配置  \r\n            StartCoroutine(this.DownLoad(LGameConfig.GetInstance().SERVER_RES_URL + Path.DirectorySeparatorChar + VERSION_FILE, delegate (WWW serverVersion)\r\n            {\r\n                //保存服务端version  \r\n                ParseVersionFile(serverVersion.text, ServerResVersion);\r\n                //计算出需要重新加载的资源  \r\n                CompareVersion();\r\n                //加载需要更新的资源  \r\n                DownLoadRes();\r\n            }));\r\n        }));\r\n    }\r\n\r\n    //依次加载需要更新的资源  \r\n    private void DownLoadRes()\r\n    {\r\n        if (NeedDownFiles.Count == 0)\r\n        {\r\n            UpdateLocalVersionFile();\r\n            return;\r\n        }\r\n\r\n        string file = NeedDownFiles[0];\r\n        NeedDownFiles.RemoveAt(0);\r\n\r\n        StartCoroutine(this.DownLoad(LGameConfig.GetInstance().SERVER_RES_URL + Path.DirectorySeparatorChar + file, delegate (WWW w)\r\n        {\r\n            //将下载的资源替换本地就的资源  \r\n            ReplaceLocalRes(file, w.bytes,()=> {\r\n                DownLoadRes();\r\n            });\r\n        }));\r\n    }\r\n\r\n    private void ReplaceLocalRes(string fileName, byte[] data,UnityAction onComplete)\r\n    {\r\n        string filePath = LOCAL_RES_PATH + fileName;\r\n\r\n        FileStream stream = new FileStream(filePath, FileMode.Create);\r\n        stream.Write(data, 0, data.Length);\r\n        stream.Flush();\r\n        stream.Close();\r\n\r\n        //如果是更新包\r\n        // if (fileName == LGameConfig.UPDATE_FILE_ZIP)\r\n        // {\r\n        //     //LUtil.UnpackFiles(filePath, LOCAL_RES_PATH);\r\n        //     StartCoroutine(UnpackFiles(filePath, LOCAL_RES_PATH,() =>\r\n        //     {\r\n        //         File.Delete(filePath);\r\n        //         onComplete.Invoke();\r\n        //     }));\r\n        // }\r\n        // else\r\n            onComplete.Invoke();\r\n\r\n    }\r\n\r\n    // public IEnumerator UnpackFiles(string file, string dir, UnityAction onComplete)\r\n    // {\r\n    //     if (!Directory.Exists(dir))\r\n    //         Directory.CreateDirectory(dir);\r\n\r\n    //     ZipInputStream s = new ZipInputStream(File.OpenRead(file));\r\n\r\n    //     ZipEntry theEntry;\r\n    //     while ((theEntry = s.GetNextEntry()) != null)\r\n    //     {\r\n    //         string directoryName = Path.GetDirectoryName(theEntry.Name);\r\n    //         string fileName = Path.GetFileName(theEntry.Name);\r\n\r\n    //         if (directoryName != string.Empty)\r\n    //             Directory.CreateDirectory(dir + directoryName);\r\n\r\n    //         if (fileName != string.Empty)\r\n    //         {\r\n    //             FileStream streamWriter = File.Create(dir + theEntry.Name);\r\n\r\n    //             int size = 2048;\r\n    //             byte[] data = new byte[2048];\r\n    //             while (true)\r\n    //             {\r\n    //                 size = s.Read(data, 0, data.Length);\r\n    //                 if (size > 0)\r\n    //                 {\r\n    //                     streamWriter.Write(data, 0, size);\r\n    //                 }\r\n    //                 else\r\n    //                 {\r\n    //                     break;\r\n    //                 }\r\n    //             }\r\n    //             doneCount++;\r\n    //             if( onUnzipProgressHandler != null)\r\n    //                 onUnzipProgressHandler.Invoke(doneCount);\r\n\r\n    //             streamWriter.Close();\r\n    //             yield return new WaitForEndOfFrame();\r\n    //         }\r\n    //     }\r\n    //     onComplete.Invoke();\r\n    //     try {\r\n    //         s.Close();\r\n    //     }\r\n    //     catch (Exception e)\r\n    //     {\r\n    //         Debug.LogError(LUtil.FormatException(e));\r\n    //     }\r\n    // }\r\n\r\n    //显示资源\r\n    private /*IEnumerator*/ void Complate()\r\n    {\r\n        //using (WWW asset = new WWW(LOCAL_RES_URL + \"newRes.assetbundle\"))\r\n        //{\r\n        //    yield return asset;\r\n\r\n        //    string code = asset.assetBundle.LoadAsset<TextAsset>(\"newLua\").text;\r\n        //    LuaSvr l = Game.GetInstance().getLuaSvr();\r\n        //    l.luaState.doString(code);\r\n        //    asset.Dispose();\r\n        //}\r\n\r\n        //using (WWW scene = new WWW(LOCAL_RES_URL + \"newScene.unity3d\"))\r\n        //{\r\n        //    yield return scene;\r\n        //    AssetBundle b = scene.assetBundle; //不要注释这句!!!不然加载不了场景（坑到爆炸\r\n        //    SceneManager.LoadScene(\"myScene\");\r\n        //    scene.Dispose();\r\n        //}\r\n\r\n        if (onCompleteHandler != null)\r\n        {\r\n            onCompleteHandler.Invoke();\r\n        }\r\n        Debug.Log(\"热更完成\");\r\n    }\r\n\r\n    //更新本地的version配置  \r\n    private void UpdateLocalVersionFile()\r\n    {\r\n        if (NeedUpdateLocalVersionFile)\r\n        {\r\n            StringBuilder versions = new StringBuilder();\r\n            var e = ServerResVersion.GetEnumerator();\r\n            while (e.MoveNext())\r\n            {\r\n                versions.Append(e.Current.Key).Append(\",\").Append(e.Current.Value).Append(\"\\n\");\r\n            }\r\n\r\n            FileStream stream = new FileStream(LOCAL_RES_PATH + VERSION_FILE, FileMode.Create);\r\n            byte[] data = Encoding.UTF8.GetBytes(versions.ToString());\r\n            stream.Write(data, 0, data.Length);\r\n            stream.Flush();\r\n            stream.Close();\r\n\r\n            Debug.Log(\"更新版本号\");\r\n        }\r\n        //加载显示对象  \r\n        //StartCoroutine(Complate());\r\n        Complate();\r\n    }\r\n\r\n    private void CompareVersion()\r\n    {\r\n        foreach (var version in ServerResVersion)\r\n        {\r\n            string fileName = version.Key;\r\n            string serverMd5 = version.Value;\r\n\r\n            //新增的资源  \r\n            if (!LocalResVersion.ContainsKey(fileName))\r\n            {\r\n                Debug.Log(\"需更新：\" + fileName);\r\n                NeedDownFiles.Add(fileName);\r\n            }\r\n            else\r\n            {\r\n                //需要替换的资源  \r\n                string localMd5;\r\n                LocalResVersion.TryGetValue(fileName, out localMd5);\r\n                if (!serverMd5.Equals(localMd5))\r\n                {\r\n                    Debug.Log(\"需更新：\" + fileName);\r\n                    NeedDownFiles.Add(fileName);\r\n                }\r\n            }\r\n        }\r\n\r\n        //本次有更新，同时更新本地的version.ver  \r\n        NeedUpdateLocalVersionFile = NeedDownFiles.Count > 0;\r\n    }\r\n\r\n    private void ParseVersionFile(string content, Dictionary<string, string> dict)\r\n    {\r\n        if (content == null || content.Length == 0)\r\n        {\r\n            return;\r\n        }\r\n        string[] items = content.Split(new char[] { '\\n' });\r\n\t\tint itemsLen = items.Length;\r\n        for(int i=0;i < itemsLen; i++ )\r\n        {\r\n            string[] info = items[i].Split(new char[] { ',' });\r\n            if (info != null && info.Length == 2)\r\n            {\r\n                dict.Add(info[0], info[1]);\r\n            }\r\n        }\r\n\r\n    }\r\n\r\n    private IEnumerator DownLoad(string url, HandleFinishDownload finishFun)\r\n    {\r\n        WWW www = new WWW(url);\r\n        yield return www;\r\n        if (finishFun != null)\r\n        {\r\n            finishFun(www);\r\n        }\r\n        www.Dispose();\r\n    }\r\n\r\n    public delegate void HandleFinishDownload(WWW www);\r\n    public delegate void HandleUnzipProgress(int step); \r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LResUpdate.cs.meta",
    "content": "fileFormatVersion: 2\nguid: db38fd50e4b385c458a9d2c440dc91e4\ntimeCreated: 1462326418\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LUtil.cs",
    "content": "﻿using System;\r\nusing System.Text.RegularExpressions;\r\n// using ICSharpCode.SharpZipLib.Zip;\r\nusing System.IO;\r\nusing UnityEngine;\r\nusing System.Security.Cryptography;\r\nusing System.Text;\r\nusing SLua;\r\n\r\n[CustomLuaClassAttribute]\r\npublic class LUtil {\r\n\r\n    /**\r\n     * Format a exception string.\r\n     * \r\n     * @param System.Exception e - The exception object.\r\n     * @return string - The result.\r\n     */\r\n\t[DoNotToLua]\r\n    public static string FormatException(System.Exception e)\r\n    {\r\n        string strSource = string.IsNullOrEmpty(e.Source) ? \"<no source>\" : e.Source.Substring(0, e.Source.Length - 2);\r\n        return string.Format(\"{0}\\nLua (at {2})\", e.Message, string.Empty, strSource);\r\n    }\r\n\r\n //    //zip压缩\r\n\t// [DoNotToLua]\r\n //    public static void PackFiles(string filename, string directory)\r\n //    {\r\n //        try\r\n //        {\r\n //            FastZip fz = new FastZip();\r\n //            fz.CreateEmptyDirectories = true;\r\n //            fz.CreateZip(filename, directory, true, \"\");\r\n //            fz = null;\r\n //        }\r\n //        catch (Exception e)\r\n //        {\r\n //            Debug.LogError(FormatException(e));\r\n //        }\r\n //    }\r\n\r\n //    //zip解压\r\n\t// [DoNotToLua]\r\n //    public static bool UnpackFiles(string file, string dir)\r\n //    {\r\n //        try\r\n //        {\r\n //            if (!Directory.Exists(dir))\r\n //                Directory.CreateDirectory(dir);\r\n\r\n //            ZipInputStream s = new ZipInputStream(File.OpenRead(file));\r\n\r\n //            ZipEntry theEntry;\r\n //            while ((theEntry = s.GetNextEntry()) != null)\r\n //            {\r\n\r\n //                string directoryName = Path.GetDirectoryName(theEntry.Name);\r\n //                string fileName = Path.GetFileName(theEntry.Name);\r\n\r\n //                if (directoryName != String.Empty)\r\n //                    Directory.CreateDirectory(dir + directoryName);\r\n\r\n //                if (fileName != String.Empty)\r\n //                {\r\n //                    FileStream streamWriter = File.Create(dir + theEntry.Name);\r\n\r\n //                    int size = 2048;\r\n //                    byte[] data = new byte[2048];\r\n //                    while (true)\r\n //                    {\r\n //                        size = s.Read(data, 0, data.Length);\r\n //                        if (size > 0)\r\n //                        {\r\n //                            streamWriter.Write(data, 0, size);\r\n //                        }\r\n //                        else\r\n //                        {\r\n //                            break;\r\n //                        }\r\n //                    }\r\n\r\n //                    streamWriter.Close();\r\n //                }\r\n //            }\r\n //            s.Close();\r\n //            return true;\r\n //        }\r\n //        catch (Exception e)\r\n //        {\r\n //            Debug.LogError(FormatException(e));\r\n //        }\r\n //        return false;\r\n //    }\r\n\r\n\r\n    /// <summary>  \r\n    /// AES加密  \r\n    /// </summary>  \r\n    /// <param name=\"Data\">被加密的明文</param>  \r\n    /// <param name=\"Key\">密钥</param>  \r\n    /// <param name=\"Vector\">向量</param>  \r\n    /// <returns>密文</returns>  \r\n    public static Byte[] AESEncrypt(Byte[] Data, String Key, String Vector)\r\n    {\r\n        Byte[] bKey = new Byte[32];\r\n        Array.Copy(Encoding.UTF8.GetBytes(Key.PadRight(bKey.Length)), bKey, bKey.Length);\r\n        Byte[] bVector = new Byte[16];\r\n        Array.Copy(Encoding.UTF8.GetBytes(Vector.PadRight(bVector.Length)), bVector, bVector.Length);\r\n        Byte[] Cryptograph = null; // 加密后的密文  \r\n        Rijndael Aes = Rijndael.Create();\r\n        try\r\n        {\r\n            // 开辟一块内存流  \r\n            using (MemoryStream Memory = new MemoryStream())\r\n            {\r\n                // 把内存流对象包装成加密流对象  \r\n                using (CryptoStream Encryptor = new CryptoStream(Memory,\r\n                 Aes.CreateEncryptor(bKey, bVector),\r\n                 CryptoStreamMode.Write))\r\n                {\r\n                    // 明文数据写入加密流  \r\n                    Encryptor.Write(Data, 0, Data.Length);\r\n                    Encryptor.FlushFinalBlock();\r\n\r\n                    Cryptograph = Memory.ToArray();\r\n                }\r\n            }\r\n        }\r\n        catch\r\n        {\r\n            Cryptograph = null;\r\n        }\r\n        return Cryptograph;\r\n    }\r\n\r\n    /// <summary>  \r\n    /// AES解密  \r\n    /// </summary>  \r\n    /// <param name=\"Data\">被解密的密文</param>  \r\n    /// <param name=\"Key\">密钥</param>  \r\n    /// <param name=\"Vector\">向量</param>  \r\n    /// <returns>明文</returns>  \r\n    public static Byte[] AESDecrypt(Byte[] Data, String Key, String Vector)\r\n    {\r\n        Byte[] bKey = new Byte[32];\r\n        Array.Copy(Encoding.UTF8.GetBytes(Key.PadRight(bKey.Length)), bKey, bKey.Length);\r\n        Byte[] bVector = new Byte[16];\r\n        Array.Copy(Encoding.UTF8.GetBytes(Vector.PadRight(bVector.Length)), bVector, bVector.Length);\r\n\r\n        Byte[] original = null; // 解密后的明文  \r\n\r\n        Rijndael Aes = Rijndael.Create();\r\n        try\r\n        {\r\n            // 开辟一块内存流，存储密文  \r\n            using (MemoryStream Memory = new MemoryStream(Data))\r\n            {\r\n                // 把内存流对象包装成加密流对象  \r\n                using (CryptoStream Decryptor = new CryptoStream(Memory,\r\n                Aes.CreateDecryptor(bKey, bVector),\r\n                CryptoStreamMode.Read))\r\n                {\r\n                    // 明文存储区  \r\n                    using (MemoryStream originalMemory = new MemoryStream())\r\n                    {\r\n                        Byte[] Buffer = new Byte[1024];\r\n                        Int32 readBytes = 0;\r\n                        while ((readBytes = Decryptor.Read(Buffer, 0, Buffer.Length)) > 0)\r\n                        {\r\n                            originalMemory.Write(Buffer, 0, readBytes);\r\n                        }\r\n\r\n                        original = originalMemory.ToArray();\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        catch\r\n        {\r\n            original = null;\r\n        }\r\n        return original;\r\n    }\r\n\r\n\r\n    // If currently build platform is windows.\r\n    public static bool Windows\r\n\t{\r\n\t\t#if UNITY_STANDALONE_WIN\r\n\t\tget { return true; }\r\n\t\t#else\r\n\t\tget { return false; }\r\n\t\t#endif\r\n\t}\r\n\r\n\t// If currently build platform is osx.\r\n\tpublic static bool OSX\r\n\t{\r\n\t\t#if UNITY_STANDALONE_OSX\r\n\t\tget { return true; }\r\n\t\t#else\r\n\t\tget { return false; }\r\n\t\t#endif\r\n\t}\r\n\r\n\t// If currently build platform is iphone.\r\n\tpublic static bool iPhone\r\n\t{\r\n\t\t#if UNITY_IPHONE\r\n\t\tget { return true; }\r\n\t\t#else\r\n\t\tget { return false; }\r\n\t\t#endif\r\n\t}\r\n\r\n\t// If currently build platform is android.\r\n\tpublic static bool Android\r\n\t{\r\n\t\t#if UNITY_ANDROID\r\n\t\tget { return true; }\r\n\t\t#else\r\n\t\tget { return false; }\r\n\t\t#endif\r\n\t}\r\n\r\n    /// <summary>\r\n    /// 获取当前时间戳\r\n    /// </summary>\r\n    /// <param name=\"bflag\">为真时获取10位时间戳,为假时获取13位时间戳.</param>\r\n    /// <returns></returns>\r\n    public static long GetTimeStamp(bool bflag = true)\r\n    {\r\n        TimeSpan ts = DateTime.UtcNow - new DateTime(1970, 1, 1, 0, 0, 0, 0);\r\n        long ret;\r\n        if (bflag)\r\n            ret = Convert.ToInt64(ts.TotalSeconds);\r\n        else\r\n            ret = Convert.ToInt64(ts.TotalMilliseconds);\r\n        return ret;\r\n    }\r\n\r\n    static DateTime dtStart = TimeZone.CurrentTimeZone.ToLocalTime(new DateTime(1970, 1, 1));\r\n    public static string NormalizeTimpstamp0(long timpStamp)\r\n    {\r\n        long unixTime = timpStamp * 10000000L;\r\n        TimeSpan toNow = new TimeSpan(unixTime);\r\n        DateTime dt = dtStart.Add(toNow);\r\n        return dt.ToString(\"yyyy-MM-dd\");\r\n    }\r\n\r\n\r\n    /// <summary>\r\n    /// 时钟式倒计时\r\n    /// </summary>\r\n    /// <param name=\"second\"></param>\r\n    /// <returns></returns>\r\n    public string GetSecondString(int second)\r\n    {\r\n        return string.Format(\"{0:D2}\", second / 3600) + string.Format(\"{0:D2}\", second % 3600 / 60) + \":\" + string.Format(\"{0:D2}\", second % 60);\r\n    }\r\n\r\n    /// 将Unix时间戳转换为DateTime类型时间\r\n    /// </summary>\r\n    /// <param name=\"d\">double 型数字</param>\r\n    /// <returns>DateTime</returns>\r\n    public static System.DateTime ConvertIntDateTime(double d)\r\n    {\r\n        System.DateTime time = System.DateTime.MinValue;\r\n        System.DateTime startTime = TimeZone.CurrentTimeZone.ToLocalTime(new System.DateTime(1970, 1, 1, 0, 0, 0));\r\n        Debug.Log(startTime);\r\n        time = startTime.AddSeconds(d);\r\n        return time;\r\n    }\r\n\r\n    /// <summary>\r\n    /// 将c# DateTime时间格式转换为Unix时间戳格式\r\n    /// </summary>\r\n    /// <param name=\"time\">时间</param>\r\n    /// <returns>double</returns>\r\n    public static double ConvertDateTimeInt(System.DateTime time)\r\n    {\r\n        double intResult = 0;\r\n        System.DateTime startTime = TimeZone.CurrentTimeZone.ToLocalTime(new System.DateTime(1970, 1, 1));\r\n        intResult = (time - startTime).TotalSeconds;\r\n        return intResult;\r\n    }\r\n\r\n\r\n    /// <summary>\r\n    /// 日期转换成unix时间戳\r\n    /// </summary>\r\n    /// <param name=\"dateTime\"></param>\r\n    /// <returns></returns>\r\n    public static long DateTimeToUnixTimestamp(DateTime dateTime)\r\n    {\r\n        var start = new DateTime(1970, 1, 1, 0, 0, 0, dateTime.Kind);\r\n        return Convert.ToInt64((dateTime - start).TotalSeconds);\r\n    }\r\n\r\n    /// <summary>\r\n    /// unix时间戳转换成日期\r\n    /// </summary>\r\n    /// <param name=\"unixTimeStamp\">时间戳（秒）</param>\r\n    /// <returns></returns>\r\n    public static DateTime UnixTimestampToDateTime(DateTime target, long timestamp)\r\n    {\r\n        DateTime start = new DateTime(1970, 1, 1, 0, 0, 0, target.Kind);\r\n        return start.AddSeconds(timestamp);\r\n    }\r\n\r\n    public static Color StringToColor(string color)\r\n    {\r\n        int red, green, blue = 0;\r\n        char[] rgb;\r\n        color = color.TrimStart('#');\r\n        color = Regex.Replace(color.ToLower(), \"[g-zG-Z]\", \"\");\r\n        switch (color.Length)\r\n        {\r\n            case 3:\r\n                rgb = color.ToCharArray();\r\n                red = Convert.ToInt32(rgb[0].ToString() + rgb[0].ToString(), 16);\r\n                green = Convert.ToInt32(rgb[1].ToString() + rgb[1].ToString(), 16);\r\n                blue = Convert.ToInt32(rgb[2].ToString() + rgb[2].ToString(), 16);\r\n                return new Color(red/255.0f, green/255.0f, blue/255.0f, 1);\r\n            case 6:\r\n                rgb = color.ToCharArray();\r\n                red = Convert.ToInt32(rgb[0].ToString() + rgb[1].ToString(), 16);\r\n                green = Convert.ToInt32(rgb[2].ToString() + rgb[3].ToString(), 16);\r\n                blue = Convert.ToInt32(rgb[4].ToString() + rgb[5].ToString(), 16);\r\n                return new Color(red/255.0f, green/255.0f, blue/255.0f,1);\r\n            default:\r\n                return Color.white;\r\n        }\r\n    }\r\n\r\n\tpublic static int[] ints(int i){\r\n\t\treturn new int[] { i };\r\n\t}\r\n\r\n    public static void removeAllChild(Transform tran)\r\n    {\r\n        int len = tran.childCount;\r\n        int childLen = tran.childCount;\r\n        for (int i = 0; i < childLen; i++)\r\n        {\r\n            Transform child = tran.GetChild(0);\r\n#if UNITY_EDITOR\r\n            UnityEngine.Object.DestroyImmediate(child.gameObject);\r\n#else\r\n            UnityEngine.Object.Destroy(child.gameObject);\r\n#endif\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase/LUtil.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 7c081dfb205e25d40bd8ea1e543b294b\ntimeCreated: 1463798881\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LBase.meta",
    "content": "fileFormatVersion: 2\nguid: 8f20a696712a96d43b5715b6c1384f66\nfolderAsset: yes\ntimeCreated: 1463888634\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LButton.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\nusing System.Collections;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 按钮\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LButton : MonoBehaviour, IPointerDownHandler, IPointerUpHandler,IPointerExitHandler\r\n    {\r\n        public const float LONGPRESS_TIME = 0.5f;\r\n        public UnityAction onLongClickHandler;\r\n        public UnityAction onLongClickUpdate;\r\n        protected bool _isRunning;\r\n        public UnityAction onPointerDown;\r\n        public UnityAction onPointerUp;\r\n        public UnityAction onPointerExit;\r\n\r\n        public LButton()\r\n        {\r\n            _isRunning = false;\r\n        }\r\n\r\n\t\t[SLua.DoNotToLua]\r\n        public void OnPointerDown(PointerEventData eventData)\r\n        {\r\n            \r\n            Invoke(\"executeLongClickHandler\", LONGPRESS_TIME);\r\n            if (onPointerDown != null)\r\n            {\r\n                onPointerDown.Invoke();\r\n            }\r\n        }\r\n\r\n\t\t[SLua.DoNotToLua]\r\n        public void OnPointerUp(PointerEventData eventData)\r\n        {\r\n            _isRunning = false;\r\n            CancelInvoke();\r\n            if (onPointerUp != null)\r\n            {\r\n                onPointerUp.Invoke();\r\n            }\r\n        }\r\n\r\n\t\t[SLua.DoNotToLua]\r\n        public void OnPointerExit(PointerEventData eventData)\r\n        {\r\n            _isRunning = false;\r\n            CancelInvoke();\r\n            if (onPointerExit != null)\r\n            {\r\n                onPointerExit.Invoke();\r\n            }\r\n        }\r\n\r\n        protected void executeLongClickHandler()\r\n        {\r\n            _isRunning = true;\r\n            if (onLongClickHandler != null)\r\n            {\r\n                onLongClickHandler.Invoke();\r\n            }\r\n        }\r\n        \r\n        void Update()\r\n        {\r\n            if (_isRunning && onLongClickUpdate != null)\r\n            {\r\n                onLongClickUpdate.Invoke();\r\n            }\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LButton.cs.meta",
    "content": "fileFormatVersion: 2\nguid: d6ec0a5376f5eaf4287991f28dd42a1a\ntimeCreated: 1451892420\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LControlView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 摇杆\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LControlView : MonoBehaviour, IPointerDownHandler, IPointerUpHandler, IDragHandler\r\n    {\r\n        public float MOVE_TIME = 0.5f;\r\n\t\tpublic float BG_FLOW_SPEED = 8f;\r\n\r\n        public Vector2 centerPoint;\r\n        public int radius;\r\n        public int radiusBg;\r\n\t\tpublic float flowDis;\r\n        public bool relocateWithAnimation;\r\n        public GameObject joyStick;\r\n        public GameObject joyBg;\r\n\t\tpublic GameObject rotateBg;\r\n\t\tprivate Vector2 _dragPoint;\r\n\t\tprivate bool _isDraging;\r\n\r\n        private Vector2 _lastPoint;\r\n        public UnityAction<float, float,bool> onControlHandler;\r\n        public UnityAction<bool> onControlChangeHandler;\r\n\r\n        public LControlView()\r\n        {\r\n            this.radius = 150;\r\n            this.radiusBg = 140;\r\n\t\t\tthis.flowDis = 65;\r\n            this.centerPoint = Vector2.zero;\r\n            this._lastPoint = Vector2.zero;\r\n            this.relocateWithAnimation = true;\r\n        }\r\n\r\n\t\t[SLua.DoNotToLua]\r\n        public void OnPointerDown(PointerEventData eventData)\r\n        {\r\n            stopAnimateUpdate();\r\n            Vector2 point = transform.InverseTransformPoint(eventData.position);\r\n            if (joyStick)\r\n            {\r\n                if (eventData.pointerEnter == joyStick)\r\n                {\r\n                    onExecuteEventHandle(false);\r\n                }\r\n            }\r\n            else\r\n            {\r\n                _lastPoint = point;\r\n                onExecuteEventHandle(false);\r\n            }\r\n\t\t\tif (onControlChangeHandler != null) {\r\n\t\t\t\tonControlChangeHandler.Invoke(true);\r\n\t\t\t}\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnDrag(PointerEventData eventData)\r\n        {\r\n            if (joyStick)\r\n            {\r\n                Vector2 point = transform.InverseTransformPoint(eventData.position);\r\n                float dis = Vector3.Distance(centerPoint, point);\r\n                joyStick.transform.localPosition = dis < radius ? point : new Vector2(\r\n                    ((point.x - centerPoint.x) / dis) * radius + centerPoint.x,\r\n                    ((point.y - centerPoint.y) / dis) * radius + centerPoint.y);\r\n            }\r\n            else\r\n            {\r\n                Vector2 point = transform.InverseTransformPoint(eventData.position);\r\n                float dis = Vector3.Distance(centerPoint, point);\r\n                _lastPoint = dis < radius ? point : new Vector2(\r\n                    ((point.x - centerPoint.x) / dis) * radius + centerPoint.x,\r\n                    ((point.y - centerPoint.y) / dis) * radius + centerPoint.y);\r\n            }\r\n\t\r\n\t\t\t\r\n\t\t\tif (rotateBg) {\r\n                rotateBg.SetActive(true);\r\n\t\t\t\tVector2 point = joyStick.transform.localPosition;\r\n\t\t\t\tVector2 toPos = point;\r\n\t\t\t\tVector2 fromPos = centerPoint;\r\n\t\t\t\tfloat angle = Mathf.Rad2Deg * Mathf.Atan ((fromPos.y - toPos.y) / (fromPos.x - toPos.x));\r\n\t\t\t\tif(fromPos.x - toPos.x < 0.0f){\r\n\t\t\t\t\tangle = angle - 90;\r\n\t\t\t\t}else{\r\n\t\t\t\t\tangle = angle + 90;\r\n\t\t\t\t}\r\n\t\t\t\trotateBg.transform.rotation = Quaternion.Euler (0, 0, angle);\r\n\t\t\t}\r\n\r\n\t\t\t_isDraging = true;\r\n\t\t\t_dragPoint = eventData.position;\r\n\r\n            onExecuteEventHandle(false);\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnPointerUp(PointerEventData eventData)\r\n        {\r\n\t\t\t_isDraging = false;\r\n\r\n            if (joyStick)\r\n            {\r\n                if (!relocateWithAnimation)\r\n                {\r\n                    onExecuteEventHandle(true);\r\n                }\r\n                relocateJoystick(relocateWithAnimation);\r\n            }\r\n            else\r\n            {\r\n                onExecuteEventHandle(true);\r\n            }\r\n\t\t\t\t\r\n\t\t\tif (onControlChangeHandler != null) {\r\n\t\t\t\tonControlChangeHandler.Invoke (false);\r\n\t\t\t}\r\n\r\n            if(rotateBg)\r\n            {\r\n                rotateBg.SetActive(false);\r\n            }\r\n        }\r\n\r\n        protected void relocateJoystick(bool anim)\r\n        {\r\n            if (anim)\r\n            {\r\n                LeanTween.move(joyStick, transform.TransformPoint(centerPoint), MOVE_TIME)\r\n                    .setOnUpdate((float val) => { onExecuteEventHandle(false); })\r\n                    .setOnComplete(() => { onExecuteEventHandle(true); });\r\n                    \r\n            }\r\n            else\r\n            {\r\n                joyStick.transform.localPosition = centerPoint;\r\n            }\r\n        }\r\n\r\n        protected void stopAnimateUpdate()\r\n        {\r\n            if (joyStick)\r\n            {\r\n                LeanTween.cancel(joyStick);\r\n            }\r\n            if(joyBg)\r\n            {\r\n                LeanTween.cancel(joyBg);\r\n            }\r\n        }\r\n\r\n\t\tvoid LateUpdate(){\r\n\t\t\t\r\n\t\t\tif (joyBg ) {\r\n\r\n\t\t\t\tif (_isDraging) {\r\n\t\t\t\t\tVector2 point = transform.InverseTransformPoint (_dragPoint);\r\n\t\t\t\t\tfloat dis = Vector3.Distance (centerPoint, point);\r\n\t\t\t\t\tif (dis >= radiusBg) {\r\n\r\n\t\t\t\t\t\tVector3 targetPos = new Vector2 (\r\n\t\t\t\t\t\t\t((point.x - centerPoint.x) / dis) * radiusBg + centerPoint.x,\r\n\t\t\t\t\t\t\t((point.y - centerPoint.y) / dis) * radiusBg + centerPoint.y);\r\n\t\t\t\t\t\tVector3 offset = targetPos - joyBg.transform.localPosition;\r\n\r\n\t\t\t\t\t\tif ( Vector2.Distance(joyBg.transform.localPosition,targetPos) < flowDis)\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\tjoyBg.transform.localPosition += (offset * Time.deltaTime * BG_FLOW_SPEED);\r\n\t\t\t\t\t} else {\r\n\r\n\t\t\t\t\t\tVector3 targetWorldPos = joyStick.transform.position;\r\n\t\t\t\t\t\tVector3 bgWorldPos = joyBg.transform.position;\r\n\t\t\t\t\t\tVector3 offset = targetWorldPos - bgWorldPos;\r\n\r\n\t\t\t\t\t\tif ( Vector2.Distance(joyBg.transform.position,targetWorldPos) < flowDis)\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\tjoyBg.transform.position += offset * Time.deltaTime * BG_FLOW_SPEED;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\t\r\n\t\t\t\t\tVector3 targetWorldPos = joyStick.transform.position;\r\n\t\t\t\t\tVector3 bgWorldPos = joyBg.transform.position;\r\n\t\t\t\t\tVector3 offset = targetWorldPos - bgWorldPos;\r\n\r\n\t\t\t\t\tif ( Vector2.Distance(joyBg.transform.position,targetWorldPos) < 0.01)\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\tjoyBg.transform.position += offset * Time.deltaTime * BG_FLOW_SPEED;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n        void onExecuteEventHandle(bool isFinish)\r\n        {\r\n            if (onControlHandler == null)\r\n            {\r\n                return;\r\n            }\r\n\r\n            if (joyStick)\r\n            {\r\n                Vector2 v = joyStick.transform.localPosition;\r\n\t\t\t\tVector2 offset = (v - centerPoint).normalized;\r\n                onControlHandler.Invoke(offset.x , offset.y , isFinish);\r\n            }\r\n            else\r\n            {\r\n\t\t\t\tVector2 offset = (_lastPoint - centerPoint).normalized;\r\n                onControlHandler.Invoke(offset.x , offset.y , isFinish);\r\n            }\r\n        }\r\n    }\r\n\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LControlView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 7e34fc3cafa660d4b83b2ca79dbd94cf\ntimeCreated: 1450354509\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LDragView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{   \r\n    [SLua.CustomLuaClass]\r\n    public class LDragView : MonoBehaviour, IBeginDragHandler, IEndDragHandler, IDragHandler\r\n    {\r\n        public UnityAction<Vector2> onBeginDrag;\r\n        public UnityAction<Vector2> onDrag;\r\n        public UnityAction<Vector2> onEndDrag;\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnBeginDrag(PointerEventData eventData)\r\n        {\r\n            if(onBeginDrag!=null)\r\n                onBeginDrag.Invoke(eventData.position);\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnDrag(PointerEventData eventData)\r\n        {\r\n            if(onDrag!=null)\r\n                onDrag.Invoke(eventData.position);\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnEndDrag(PointerEventData eventData)\r\n        {\r\n            if(onEndDrag!=null)\r\n                onEndDrag.Invoke(eventData.position);\r\n        }\r\n    }\r\n\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LDragView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 941cb5e4ad79c794cad327e0400cb8a9\ntimeCreated: 1484563108\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LExpandListView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\n\r\nnamespace Lui\r\n{\r\n    [SLua.CustomLuaClass]\r\n    public class LExpandListView : LScrollView\r\n    {\r\n        protected List<LExpandNode> _expandableNodeList;\r\n        public int nodeNum;\r\n        public int nodeItemNum;\r\n\r\n        public GameObject cell_tpl;\r\n        public GameObject cell_sub_tpl;\r\n\r\n        public LExpandListView()\r\n        {\r\n            direction = ScrollDirection.VERTICAL;\r\n            _expandableNodeList = new List<LExpandNode>();\r\n        }\r\n\r\n        public void expand(int idx)\r\n        {\r\n            _expandableNodeList[idx].setExpanded(true);\r\n        }\r\n\r\n        public void collapse(int idx)\r\n        {\r\n            _expandableNodeList[idx].setExpanded(false);\r\n        }\r\n\r\n        public void insertExpandableNodeAtLast(LExpandNode node)\r\n        {\r\n            if (node == null)\r\n            {\r\n                Debug.LogWarning(\"insert node is null\");\r\n                return;\r\n            }\r\n\r\n            _expandableNodeList.Add(node);\r\n            node.transform.SetParent(container.transform);\r\n        }\r\n\r\n        public void insertExpandableNodeAtFront(LExpandNode node)\r\n        {\r\n            if (node == null)\r\n            {\r\n                Debug.LogWarning(\"insert node is null\");\r\n                return;\r\n            }\r\n\r\n            _expandableNodeList.Insert(0, node);\r\n            node.transform.SetParent(container.transform);\r\n        }\r\n\r\n        public void removeExpandNode(LExpandNode node)\r\n        {\r\n            if (node == null)\r\n            {\r\n                Debug.LogWarning(\"insert node is null\");\r\n                return;\r\n            }\r\n\r\n            if (_expandableNodeList.Count == 0) return;\r\n            _expandableNodeList.Remove(node);\r\n        }\r\n\r\n        public void removeExpandNodeAtIndex(int idx)\r\n        {\r\n            if (_expandableNodeList.Count == 0) return;\r\n            _expandableNodeList.RemoveAt(idx);\r\n            Destroy(_expandableNodeList[idx]);\r\n        }\r\n\r\n        public void removeLastExpandNode()\r\n        {\r\n            if (_expandableNodeList.Count == 0) return;\r\n            _expandableNodeList.RemoveAt(_expandableNodeList.Count - 1);\r\n            Destroy(_expandableNodeList[_expandableNodeList.Count - 1]);\r\n        }\r\n\r\n        public void removeFrontExpandNode()\r\n        {\r\n            if (_expandableNodeList.Count == 0) return;\r\n            _expandableNodeList.RemoveAt(0);\r\n            Destroy(_expandableNodeList[0]);\r\n        }\r\n\r\n        public void removeAllExpandNodes()\r\n        {\r\n            if (_expandableNodeList.Count == 0) return;\r\n\t\t\tint len = _expandableNodeList.Count;\r\n            for(int i=0;i<len; i++)\r\n            {\r\n                Destroy(_expandableNodeList[i].gameObject);\r\n            }\r\n            _expandableNodeList.Clear();\r\n        }\r\n\r\n        public List<LExpandNode> getExpandableNodes()\r\n        {\r\n            return _expandableNodeList;\r\n        }\r\n\r\n        public int getExpandableNodeCount()\r\n        {\r\n            return _expandableNodeList.Count;\r\n        }\r\n\r\n        public LExpandNode getExpandableNodeAtIndex(int idx)\r\n        {\r\n            return _expandableNodeList[idx];\r\n        }\r\n\r\n        public void updateNodesPosition()\r\n        {\r\n            if (_expandableNodeList.Count == 0) return;\r\n\r\n            float allNodesHeight = 0.0f;\r\n            int nodeLen = _expandableNodeList.Count;\r\n            for(int i=0;i< nodeLen; i++)\r\n            {\r\n                LExpandNode node = _expandableNodeList[i];\r\n                allNodesHeight += node.gameObject.GetComponent<RectTransform>().rect.height;\r\n\r\n                if (node.isExpanded())\r\n                {\r\n                    List<GameObject> nodeItems = node.getExpandableNodeItemList();\r\n                    int len = nodeItems.Count;\r\n                    if (len > 0)\r\n                    {\r\n                        for(int _i=0;_i<len;_i++)\r\n                        {\r\n\t\t\t\t\t\t\tGameObject obj = nodeItems[_i];\r\n                            obj.SetActive(true);\r\n                            allNodesHeight += obj.GetComponent<RectTransform>().rect.height;\r\n                        }\r\n                    }\r\n                }\r\n                else\r\n                {\r\n                    List<GameObject> nodeItems = node.getExpandableNodeItemList();\r\n\t\t\t\t\tint len = nodeItems.Count;\r\n                    if (len > 0)\r\n                    {\r\n                        for(int _i=0;_i<len;_i++)\r\n                        {\r\n                            nodeItems[_i].SetActive(false);\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n\r\n            Rect rect = GetComponent<RectTransform>().rect;\r\n            allNodesHeight = Mathf.Max(allNodesHeight, rect.height);\r\n            setContainerSize(new Vector2(rect.width, allNodesHeight));\r\n\r\n            for (int i = 0; i < nodeLen; i++)\r\n            {\r\n                LExpandNode node = _expandableNodeList[i];\r\n                RectTransform rtran = node.gameObject.GetComponent<RectTransform>();\r\n                allNodesHeight = allNodesHeight - rtran.rect.height;\r\n\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = new Vector2(0, 0);\r\n                rtran.anchorMin = new Vector2(0, 0);\r\n                node.transform.SetParent(container.transform);\r\n                node.transform.localPosition = new Vector2(0, allNodesHeight);\r\n                node.transform.localScale = new Vector3(1, 1, 1);\r\n\r\n                if (node.isExpanded())\r\n                {\r\n                    List<GameObject> itemLists = node.getExpandableNodeItemList();\r\n                    for(int j = 0; j < itemLists.Count; j++)\r\n                    {\r\n                        RectTransform _rtran = itemLists[j].GetComponent<RectTransform>();\r\n                        allNodesHeight = allNodesHeight - _rtran.rect.height;\r\n\r\n                        _rtran.pivot = Vector2.zero;\r\n                        _rtran.anchorMax = new Vector2(0, 0);\r\n                        _rtran.anchorMin = new Vector2(0, 0);\r\n                        itemLists[j].transform.SetParent(container.transform);\r\n                        itemLists[j].transform.localPosition = new Vector2(0, allNodesHeight);\r\n                        itemLists[j].transform.localScale = new Vector3(1, 1, 1);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        public void prepare()\r\n        {\r\n            if (nodeNum > 0)\r\n            {\r\n                if (cell_tpl == null) { \r\n                    cell_tpl = transform.Find(\"container/cell_tpl\").gameObject;\r\n                }\r\n                if (cell_sub_tpl == null){\r\n                    cell_sub_tpl = transform.Find(\"container/cell_sub_tpl\").gameObject;\r\n                }\r\n                cell_tpl.SetActive(false);\r\n                cell_sub_tpl.SetActive(false);\r\n                \r\n                for (int i = 0; i < nodeNum; i++)\r\n                {\r\n                    GameObject nodeObj = Instantiate(cell_tpl);\r\n                    nodeObj.SetActive(true);\r\n                    nodeObj.transform.SetParent(container.transform);\r\n                    LExpandNode node = nodeObj.AddComponent<LExpandNode>();\r\n                    node.tpl = cell_sub_tpl;\r\n                    node.prepare(nodeItemNum);\r\n                    insertExpandableNodeAtLast(node);\r\n                }\r\n            }\r\n        }\r\n\r\n        public void reloadData()\r\n        {\r\n            if(direction != ScrollDirection.VERTICAL)\r\n            {\r\n                Debug.LogWarning(\"LExpandListView should be Vertical\");\r\n                return;\r\n            }\r\n            float oldHeight = container.GetComponent<RectTransform>().rect.height;\r\n            updateNodesPosition();\r\n\r\n            float newHeight = container.GetComponent<RectTransform>().rect.height - oldHeight;\r\n            setContentOffset(getContentOffset() - new Vector2(0, newHeight));\r\n            relocateContainer();\r\n        }\r\n\r\n    }\r\n\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LExpandListView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 2add4b83e9680b2408158f0b77a530ff\ntimeCreated: 1482831210\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LExpandNode.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.Events;\r\n\r\n\r\nnamespace Lui { \r\n\r\n    [SLua.CustomLuaClass]\r\n    public class LExpandNode : MonoBehaviour\r\n    {\r\n        protected bool _expanded;\r\n        protected int _idx;\r\n        protected List<GameObject> _expandNodeItemList;\r\n        [HideInInspector]\r\n        public GameObject tpl;\r\n\r\n        public LExpandNode()\r\n        {\r\n            _idx = -1;\r\n            _expanded = false;\r\n            _expandNodeItemList = new List<GameObject>();\r\n        }\r\n\r\n        public void insertItemNodeAtLast(GameObject obj)\r\n        {\r\n            if (obj == null)\r\n            {\r\n                Debug.LogWarning(\"insert obj is null\");\r\n                return;\r\n            }\r\n\r\n            _expandNodeItemList.Add(obj);\r\n        }\r\n\r\n        public void insertItemNodeAtFront(GameObject obj)\r\n        {\r\n            if (obj == null)\r\n            {\r\n                Debug.LogWarning(\"insert obj is null\");\r\n                return;\r\n            }\r\n\r\n            _expandNodeItemList.Insert(0, obj);\r\n        }\r\n\r\n        public void removeItemNode(GameObject obj)\r\n        {\r\n            if (obj == null)\r\n            {\r\n                Debug.LogWarning(\"remove obj is null\");\r\n                return;\r\n            }\r\n            if (_expandNodeItemList.Count == 0) return;\r\n\r\n            _expandNodeItemList.Remove(obj);\r\n            Destroy(obj);\r\n        }\r\n\r\n        public void removeItemNodeAtIndex(int idx)\r\n        {\r\n            if (_expandNodeItemList.Count == 0) return;\r\n            _expandNodeItemList.RemoveAt(idx);\r\n            Destroy(_expandNodeItemList[idx]);\r\n        }\r\n\r\n        public GameObject getItemNodeAtIndex(int idx)\r\n        {\r\n            if (_expandNodeItemList.Count == 0) return null;\r\n            return _expandNodeItemList[idx];\r\n        }\r\n\r\n        public void removeAllItemNodes()\r\n        {\r\n            if (_expandNodeItemList.Count == 0) return;\r\n\t\t\tint len = _expandNodeItemList.Count;\r\n            for (int i=0;i<len;i++)\r\n            {\r\n                Destroy(_expandNodeItemList[i]);\r\n            }\r\n            _expandNodeItemList.Clear();\r\n        }\r\n\r\n        public void setExpanded(bool value)\r\n        {\r\n            _expanded = value;\r\n        }\r\n\r\n        public bool isExpanded()\r\n        {\r\n            return _expanded;\r\n        }\r\n\r\n        public List<GameObject> getExpandableNodeItemList()\r\n        {\r\n            return _expandNodeItemList;\r\n        }\r\n\r\n        public void prepare(int itemNums)\r\n        {\r\n            removeAllItemNodes();\r\n\r\n            for (int i = 0; i < itemNums; i++) {\r\n                GameObject obj = Instantiate(this.tpl);\r\n                obj.transform.SetParent(this.transform.parent);\r\n                insertItemNodeAtLast(obj);\r\n            }\r\n        }\r\n\r\n        //public void setOnClick(string path,UnityAction<LExpandNode> cb)\r\n        //{\r\n\r\n        //}\r\n\r\n    }\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LExpandNode.cs.meta",
    "content": "fileFormatVersion: 2\nguid: dd6731833af457c4cbda2c6859745a6e\ntimeCreated: 1482831210\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LFPSView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Profiling;\r\nusing System.Collections;\r\n\r\n[SLua.CustomLuaClass]\r\npublic class LFPSView : MonoBehaviour\r\n{\r\n\tprivate static LFPSView _instance;\r\n\r\n\tpublic static LFPSView Show()\r\n\t{\r\n\t\tif (_instance == null)\r\n\t\t{\r\n\t\t\tGameObject obj = new GameObject();\r\n\t\t\tobj.name = \"LFPSView\";\r\n\t\t\t_instance = obj.AddComponent<LFPSView>();\r\n\t\t\tDontDestroyOnLoad(obj);\r\n\t\t}\r\n\t\treturn _instance;\r\n\t}\r\n\r\n\tvoid Start()\r\n\t{\r\n\t\ttimeleft = updateInterval;\r\n        OnMemoryGUI = true;\r\n\t}\r\n\tvoid Update()\r\n\t{\r\n\t\tUpdateUsed();\r\n\t\tUpdateFPS();\r\n\t}\r\n\t//Memory\r\n\tprivate string sUserMemory;\r\n\tprivate string s;\r\n\tpublic bool OnMemoryGUI;\r\n\tprivate uint MonoUsedM;\r\n\tprivate uint AllMemory;\r\n\t[Range(0, 100)]\r\n\tpublic int MaxMonoUsedM = 50;\r\n\t[Range(0, 400)]\r\n\tpublic int MaxAllMemory = 200;\r\n\tvoid UpdateUsed()\r\n\t{\r\n\t\tsUserMemory = \"\";\r\n\t\tMonoUsedM = Profiler.GetMonoUsedSize() / 1000000;\r\n\t\tAllMemory = Profiler.GetTotalAllocatedMemory() / 1000000;\r\n\r\n\r\n\t\tsUserMemory += \"used: \" + MonoUsedM + \"M \";\r\n\t\tsUserMemory += \"all: \" + AllMemory + \"M \";\r\n\t\tsUserMemory += \"left: \" + Profiler.GetTotalUnusedReservedMemory() / 1000000 + \"M \";\r\n\r\n\r\n\t\t// s = \"\";\r\n\t\t// s += \" MonoHeap:\" + Profiler.GetMonoHeapSize() / 1000 + \"k\";\r\n\t\t// s += \" MonoUsed:\" + Profiler.GetMonoUsedSize() / 1000 + \"k\";\r\n\t\t// s += \" Allocated:\" + Profiler.GetTotalAllocatedMemory() / 1000 + \"k\";\r\n\t\t// s += \" Reserved:\" + Profiler.GetTotalReservedMemory() / 1000 + \"k\";\r\n\t\t// s += \" UnusedReserved:\" + Profiler.GetTotalUnusedReservedMemory() / 1000 + \"k\";\r\n\t\t// s += \" UsedHeap:\" + Profiler.usedHeapSize / 1000 + \"k\";\r\n\t}\r\n\r\n\r\n\t//FPS\r\n\tfloat updateInterval = 0.5f;\r\n\tprivate float accum = 0.0f;\r\n\tprivate float frames = 0;\r\n\tprivate float timeleft;\r\n\tprivate float fps;\r\n\tprivate string FPSAAA;\r\n\t[Range(0, 150)]\r\n\tpublic int MaxFPS;\r\n\tvoid UpdateFPS()\r\n\t{\r\n\t\ttimeleft -= Time.deltaTime;\r\n\t\taccum += Time.timeScale / Time.deltaTime;\r\n\t\t++frames;\r\n\r\n\r\n\t\tif (timeleft <= 0.0)\r\n\t\t{\r\n\t\t\tfps = accum / frames;\r\n\t\t\tFPSAAA = \"fps: \" + fps.ToString(\"f2\") + \" \";\r\n\t\t\ttimeleft = updateInterval;\r\n\t\t\taccum = 0.0f;\r\n\t\t\tframes = 0;\r\n\t\t}\r\n\t}\r\n\tvoid OnGUI()\r\n\t{\r\n\t\tif (OnMemoryGUI) {\r\n\r\n            GUIStyle style = new GUIStyle();\r\n            style.normal.textColor = Color.white;\r\n            style.fontSize = 30;\r\n\r\n\t\t\tGUI.color = new Color (1, 1, 1);\r\n\t\t\tGUI.Label (new Rect (0, 0, 200, 60), FPSAAA + sUserMemory,style);\r\n\t\t}\r\n\t}\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LFPSView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: d74b20e60f13ece4490066a84d0800f9\ntimeCreated: 1463994988\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LGridPageView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    public class LGridPageViewPage : LTableViewCell\r\n    {\r\n        public List<LGridPageViewCell> gridCells { get; protected set; }\r\n        public LGridPageViewPage()\r\n        {\r\n            gridCells = new List<LGridPageViewCell>();\r\n            node = new GameObject();\r\n        }\r\n    }\r\n\r\n    public class LGridPageViewCell : LTableViewCell\r\n    {\r\n\r\n    }\r\n\r\n    /// <summary>\r\n    /// 网格翻页\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LGridPageView : LTableView\r\n    {\r\n        public int gridCellsCount;\r\n        public int cols;\r\n        public int rows;\r\n\r\n        public int pageIndex { get; protected set; }\r\n        public UnityAction<int> onPageChangedHandler;\r\n        public Vector2 gridCellsSize;\r\n        protected int _cellsMaxCountInPage;\r\n        protected List<Vector2> _gridCellsPosition;\r\n        public void SetCellHandle(UnityAction<int, GameObject> act)\r\n        {\r\n            onCellHandle = act;\r\n        }\r\n\r\n        public LGridPageView()\r\n        {\r\n            this.gridCellsCount = 0;\r\n            this.cols = 0;\r\n            this.rows = 0;\r\n            this.pageIndex = 0;\r\n            this.gridCellsSize = Vector2.zero;\r\n            autoRelocateSpeed = LTableView.AUTO_RELOCATE_SPPED;\r\n            _gridCellsPosition = new List<Vector2>();\r\n        }\r\n\r\n        public void updateGridCellsPosition()\r\n        {\r\n            float x = 0.0f;\r\n            float y = GetComponent<RectTransform>().rect.height - gridCellsSize.y;\r\n\r\n            for (int i = 0; i < _cellsMaxCountInPage; ++i )\r\n            {\r\n                if ( i!= 0 && i % cols == 0)\r\n                {\r\n                    x = 0;\r\n                    y = y - gridCellsSize.y;\r\n                }\r\n                _gridCellsPosition.Add(new Vector2(x, y));\r\n                x += gridCellsSize.x;\r\n            }\r\n        }\r\n\r\n        public void updatePageCount()\r\n        {\r\n            _cellsMaxCountInPage = cols * rows;\r\n            if (gridCellsCount % _cellsMaxCountInPage == 0)\r\n            {\r\n                cellsCount = gridCellsCount / _cellsMaxCountInPage;\r\n            }\r\n            else\r\n            {\r\n                cellsCount = gridCellsCount / _cellsMaxCountInPage + 1;\r\n            }\r\n        }\r\n\r\n        public override void reloadData()\r\n        {\r\n            updatePageCount();\r\n            updateGridCellsPosition();\r\n            base.reloadData();\r\n        }\r\n\r\n        protected override void onScrolling()\r\n        {\r\n            if (gridCellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            base.onScrolling();\r\n\r\n            Vector2 pageIdxOffset = default(Vector2);\r\n            RectTransform rtran = GetComponent<RectTransform>();\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    pageIdxOffset = getContentOffset() - new Vector2(rtran.rect.width / 2, 0);\r\n                    break;\r\n                case ScrollDirection.VERTICAL:\r\n                    pageIdxOffset = getContentOffset() + new Vector2(0, rtran.rect.height / 2);\r\n                    break;\r\n                default:\r\n                    break;\r\n            }\r\n\r\n            int page = cellBeginIndexFromOffset(pageIdxOffset);\r\n            if (page != pageIndex)\r\n            {\r\n                pageIndex = page;\r\n                if (onPageChangedHandler != null)\r\n                {\r\n                    onPageChangedHandler.Invoke(pageIndex);\r\n                }\r\n            }\r\n        }\r\n\r\n        protected override void updateCellByAdapter(int page)\r\n        {\r\n\r\n            LGridPageViewPage pageCell = (LGridPageViewPage)dequeueCell();\r\n            if (pageCell == null)\r\n            {\r\n                pageCell = new LGridPageViewPage();\r\n\r\n                List<LGridPageViewCell> gridCells = pageCell.gridCells;\r\n                int beginIdx = page * _cellsMaxCountInPage;\r\n                int endIdx = beginIdx + _cellsMaxCountInPage;\r\n\r\n                for (int idx = beginIdx, i = 0; idx < endIdx;++idx,++i )\r\n                {\r\n                    LGridPageViewCell cell = null;\r\n                    if (idx < gridCellsCount)\r\n                    {\r\n                        cell = _onGridDataSourceAdapterHandler(null, idx);\r\n                        RectTransform rtran = cell.node.GetComponent<RectTransform>();\r\n                        rtran.pivot = Vector2.zero;\r\n                        rtran.sizeDelta = gridCellsSize;\r\n                        cell.idx = idx;\r\n                        cell.node.SetActive(true);\r\n                        cell.node.transform.SetParent(pageCell.node.transform);\r\n                        cell.node.transform.localPosition = _gridCellsPosition[i];\r\n                        cell.node.transform.localScale = new Vector2(1, 1);\r\n                        gridCells.Add(cell);\r\n                    }\r\n                    else\r\n                    {\r\n                        cell = _onGridDataSourceAdapterHandler(null, INVALID_INDEX);\r\n                        RectTransform rtran = cell.node.GetComponent<RectTransform>();\r\n                        rtran.pivot = Vector2.zero;\r\n                        cell.idx = INVALID_INDEX;\r\n                        cell.node.SetActive(false);\r\n                        cell.node.transform.SetParent(pageCell.node.transform);\r\n                        cell.node.transform.localPosition = _gridCellsPosition[i];\r\n                        cell.node.transform.localScale = new Vector2(1, 1);\r\n                        gridCells.Add(cell);\r\n                    }\r\n                }\r\n            }\r\n            else\r\n            {\r\n                List<LGridPageViewCell> gridCells = pageCell.gridCells;\r\n                int beginIdx = page * _cellsMaxCountInPage;\r\n                int endIdx = beginIdx + _cellsMaxCountInPage;\r\n\r\n                for (int idx = beginIdx, i = 0; idx < endIdx; ++idx, ++i)\r\n                {\r\n                    LGridPageViewCell cell = gridCells[i];\r\n                    if (idx < gridCellsCount)\r\n                    {\r\n                        cell.idx = idx;\r\n                        cell = _onGridDataSourceAdapterHandler(cell, idx);\r\n                        cell.node.SetActive(true);\r\n                    }\r\n                    else\r\n                    {\r\n                        cell.idx = INVALID_INDEX;\r\n                        cell.reset();\r\n                        cell = _onGridDataSourceAdapterHandler(cell, INVALID_INDEX);\r\n                        cell.node.SetActive(false);\r\n                    }\r\n                }\r\n            }\r\n\r\n            pageCell.idx = page;\r\n            RectTransform tran = pageCell.node.GetComponent<RectTransform>();\r\n            switch(direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    tran.pivot = Vector2.zero;\r\n                    break;\r\n                default:\r\n                    tran.pivot = new Vector2(0, 1);\r\n                    break;\r\n            }\r\n\r\n            tran.sizeDelta = cellsSize;\r\n            pageCell.node.SetActive(true);\r\n            pageCell.node.transform.SetParent(container.transform);\r\n            pageCell.node.transform.localScale = new Vector2(1, 1);\r\n            pageCell.node.transform.localPosition = cellPositionFromIndex(page);\r\n            insertSortableCell(pageCell, page);\r\n            indices.Add(page, 1);\r\n        }\r\n\r\n        protected LGridPageViewCell _onGridDataSourceAdapterHandler(LGridPageViewCell cell, int idx)\r\n        {\r\n            if (cell == null)\r\n            {\r\n                cell = new LGridPageViewCell();\r\n\r\n\r\n                if (cell_tpl != null)\r\n                    cell.node = (GameObject)Instantiate(cell_tpl);\r\n                else\r\n                    cell.node = (GameObject)Instantiate(transform.Find(\"container/cell_tpl\").gameObject);\r\n            }\r\n            cell.node.SetActive(idx != LScrollView.INVALID_INDEX);\r\n\r\n            if(onCellHandle != null)\r\n            {\r\n                onCellHandle.Invoke(idx, cell.node);\r\n            }\r\n            return cell;\r\n        }\r\n\r\n        public void setPageChangedHandler(UnityAction<int> action)\r\n        {\r\n            onPageChangedHandler = action;\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LGridPageView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c52e6ad8d48e15c4b87338a5bf66e0eb\ntimeCreated: 1451049160\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LGridView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\nusing System;\r\nusing System.Collections;\r\n\r\nnamespace Lui\r\n{\r\n    public class LGridViewCell : LTableViewCell\r\n    {\r\n        public int row;\r\n    }\r\n        \r\n    /// <summary>\r\n    /// 网格\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LGridView : LScrollView\r\n    {\r\n        public Vector2 cellsSize;\r\n        public int cellsCount;\r\n        public int cols;\r\n        public bool autoRelocate;\r\n\t\tpublic bool isAsyncOnce;\r\n        public GameObject cell_tpl;\r\n\r\n        protected int _rows;\r\n        protected List<LGridViewCell> _cellsUsed;\r\n        protected List<LGridViewCell> _cellsFreed;\r\n        protected List<Vector2> _positions;\r\n        protected Dictionary<int, int> _indices;\r\n        protected UnityAction<int, GameObject> onCellHandle;\r\n        public void SetCellHandle(UnityAction<int, GameObject> act)\r\n        {\r\n            onCellHandle = act;\r\n        }\r\n\r\n        public LGridView()\r\n        {\r\n            cellsCount = 0;\r\n            cellsSize = Vector2.zero;\r\n            cols = 0;\r\n            _rows = 0;\r\n            direction = ScrollDirection.VERTICAL;\r\n            _cellsUsed = new List<LGridViewCell>();\r\n            _cellsFreed = new List<LGridViewCell>();\r\n            _positions = new List<Vector2>();\r\n            _indices = new Dictionary<int, int>();\r\n        }\r\n\r\n        public void removeAllFromUsed()\r\n        {\r\n\t\t\tint len = _cellsUsed.Count;\r\n            for (int i = 0;i<len ;i++)\r\n            {\r\n                Destroy(_cellsUsed[i].node);\r\n            }\r\n            _cellsUsed.Clear();\r\n        }\r\n\r\n        public void removeAllFromFreed()\r\n        {\r\n\t\t\tint len = _cellsFreed.Count;\r\n            for (int i = 0;i<len ;i++)\r\n            {\r\n                Destroy(_cellsFreed[i].node);\r\n            }\r\n            _cellsFreed.Clear();\r\n        }\r\n\r\n        public void insertSortableCell(LGridViewCell cell, int idx)\r\n        {\r\n            if (_cellsUsed.Count == 0)\r\n            {\r\n                _cellsUsed.Add(cell);\r\n            }\r\n            else\r\n            {\r\n                for (int i = 0; i < _cellsUsed.Count; i++)\r\n                {\r\n                    if (_cellsUsed[i].idx > idx)\r\n                    {\r\n                        _cellsUsed.Insert(i, cell);\r\n                        return;\r\n                    }\r\n                }\r\n                _cellsUsed.Add(cell);\r\n                return;\r\n            }\r\n        }\r\n\r\n        protected Vector2 cellPositionFromIndex(int idx)\r\n        {\r\n            if (idx == LScrollView.INVALID_INDEX)\r\n            {\r\n                return _positions[0];\r\n            }\r\n            return _positions[idx];\r\n        }\r\n\r\n        public void updateCellAtIndex(int idx, int row)\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            LGridViewCell cell = _onDataSourceAdapterHandler(dequeueCell(), idx);\r\n            cell.idx = idx;\r\n            cell.row = row;\r\n            RectTransform rtran = cell.node.GetComponent<RectTransform>();\r\n            rtran.pivot = new Vector2(0, 1);\r\n            rtran.sizeDelta = cellsSize;\r\n            cell.node.SetActive(true);\r\n            cell.node.transform.SetParent(container.transform);\r\n            cell.node.transform.localPosition = cellPositionFromIndex(idx);\r\n            cell.node.transform.localScale = new Vector3(1, 1, 1);\r\n            insertSortableCell(cell, idx);\r\n\r\n            _indices.Add(idx, 1);\r\n        }\r\n\r\n        protected int cellBeginRowFromOffset(Vector2 offset)\r\n        {\r\n            float ofy = offset.y + container.GetComponent<RectTransform>().rect.height;\r\n            float xos = ofy - GetComponent<RectTransform>().rect.height;\r\n            int row = (int)(xos / cellsSize.y);\r\n\r\n            row = Mathf.Max(row, 0);\r\n            row = Mathf.Min((int)_rows - 1, row);\r\n\r\n            return (int)row;\r\n        }\r\n\r\n        protected int cellEndRowFromOffset(Vector2 offset)\r\n        {\r\n            float ofy = offset.y + container.GetComponent<RectTransform>().rect.height;\r\n            int row = (int)(ofy / cellsSize.y);\r\n\r\n            row = Mathf.Max(row, 0);\r\n            row = Mathf.Min((int)_rows - 1, row);\r\n\r\n            return (int)row;\r\n        }\r\n\r\n        protected int cellFirstIndexFromRow(int row)\r\n        {\r\n            return cols * row;\r\n        }\r\n\r\n        protected void updatePositions()\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n            RectTransform rtran = GetComponent<RectTransform>();\r\n\r\n            _rows = cellsCount % cols == 0 ? cellsCount / cols : cellsCount / cols + 1;\r\n            float height = Mathf.Max(_rows * cellsSize.y, rtran.rect.height);\r\n            float width = cols * cellsSize.x;\r\n            setContainerSize(new Vector2(width, height));\r\n\r\n            float nx = 0.0f;\r\n            float ny = height;\r\n\r\n            for (int idx = 0; idx < cellsCount; ++idx)\r\n            {\r\n                if (idx != 0 && idx % cols == 0)\r\n                {\r\n                    nx = 0.0f;\r\n                    ny = ny - cellsSize.y;\r\n                }\r\n                _positions.Add(new Vector2(nx, ny));\r\n                nx += cellsSize.x;\r\n            }\r\n        }\r\n\r\n        public List<LGridViewCell> getCells()\r\n        {\r\n            List<LGridViewCell> ret = new List<LGridViewCell>();\r\n            for (int i = 0; i < _cellsUsed.Count; i++)\r\n            {\r\n                ret.Add(_cellsUsed[i]);\r\n            }\r\n            return ret;\r\n        }\r\n\r\n        public LGridViewCell cellAtIndex(int idx)\r\n        {\r\n            if (!_indices.ContainsKey(idx))\r\n            {\r\n                return null;\r\n            }\r\n            for (int i = 0; i < _cellsUsed.Count; i++)\r\n            {\r\n                if (_cellsUsed[i].idx == idx)\r\n                {\r\n                    return _cellsUsed[i];\r\n                }\r\n            }\r\n            return null;\r\n        }\r\n\r\n        protected LGridViewCell dequeueCell()\r\n        {\r\n            LGridViewCell cell = null;\r\n            if (_cellsFreed.Count == 0)\r\n            {\r\n                return null;\r\n            }\r\n            else\r\n            {\r\n                cell = _cellsFreed[0];\r\n                _cellsFreed.RemoveAt(0);\r\n            }\r\n            return cell;\r\n        }\r\n\r\n        public void reloadData()\r\n        {\r\n\t\t\tif (_cellsUsed.Count > 0) \r\n\t\t\t{\r\n                for (int i = 0; i < _cellsUsed.Count; i++)\r\n                {\r\n                    LGridViewCell cell = _cellsUsed[i];\r\n                    _cellsFreed.Add(cell);\r\n                    cell.reset();\r\n                    cell.node.SetActive(false);\r\n                }\r\n                _cellsUsed.Clear();\r\n            }\r\n\r\n            Transform tran = transform.Find(\"container/cell_tpl\");\r\n            if(tran!=null){\r\n                tran.gameObject.SetActive(false);\r\n            }\r\n            try\r\n            {\r\n                _indices.Clear();\r\n                _positions.Clear();\r\n                updatePositions();\r\n                setContentOffsetToTop();\r\n                onScrolling();\r\n            }\r\n            catch(Exception e)\r\n            {\r\n                Debug.Log(e);\r\n            }\r\n            \r\n            relocateContainer();\r\n        }\r\n\r\n        protected override void onScrolling()\r\n        {\r\n\t\t\tbase.onScrolling ();\r\n\r\n            int beginRow = 0, endRow = 0;\r\n            beginRow = cellBeginRowFromOffset(getContentOffset());\r\n            endRow = cellEndRowFromOffset(getContentOffset());\r\n\r\n            while (_cellsUsed.Count > 0)\r\n            {\r\n                LGridViewCell cell = _cellsUsed[0];\r\n                int row = cell.row;\r\n                int idx = cell.idx;\r\n\r\n                if (row < beginRow)\r\n                {\r\n                    _indices.Remove(idx);\r\n                    _cellsUsed.Remove(cell);\r\n                    _cellsFreed.Add(cell);\r\n                    cell.reset();\r\n                    //cell.node.transform.SetParent(null);\r\n                    cell.node.SetActive(false);\r\n                }\r\n                else\r\n                {\r\n                    break;\r\n                }\r\n            }\r\n\r\n            while (_cellsUsed.Count > 0)\r\n            {\r\n                LGridViewCell cell = _cellsUsed[_cellsUsed.Count - 1];\r\n                int row = cell.row;\r\n                int idx = cell.idx;\r\n\r\n                if (row > endRow && row < _rows)\r\n                {\r\n                    _indices.Remove(idx);\r\n                    _cellsUsed.Remove(cell);\r\n\t\t\t\t\t_cellsFreed.Add(cell);\r\n                    cell.reset();\r\n                    //cell.node.transform.SetParent(null);\r\n                    cell.node.SetActive(false);\r\n                }\r\n                else\r\n                {\r\n                    break;\r\n                }\r\n            }\r\n\r\n\t\t\tif (isAsyncOnce) {\r\n\t\t\t\tStopAllCoroutines ();\r\n\t\t\t\tStartCoroutine (_onScrollingAsync (beginRow, endRow));\r\n\t\t\t} else {\r\n\r\n\t\t\t\tfor (int row = beginRow; row <= endRow && row < _rows; ++row) {\r\n\t\t\t\t\tint cellBeginIndex = cellFirstIndexFromRow (row);\r\n\t\t\t\t\tint cellEndIndex = cellBeginIndex + cols;\r\n\r\n\t\t\t\t\tfor (int idx = cellBeginIndex; idx < cellEndIndex && idx < cellsCount; ++idx) {\r\n\t\t\t\t\t\tif (_indices.ContainsKey (idx)) {\r\n\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tupdateCellAtIndex (idx, row);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n        }\r\n\t\t\t\r\n\t\tIEnumerator _onScrollingAsync(int beginRow,int endRow){\r\n\r\n\t\t\tfor (int row = beginRow; row <= endRow && row < _rows; ++row)\r\n\t\t\t{\r\n\t\t\t\tint cellBeginIndex = cellFirstIndexFromRow(row);\r\n\t\t\t\tint cellEndIndex = cellBeginIndex + cols;\r\n\r\n\t\t\t\tfor (int idx = cellBeginIndex; idx < cellEndIndex && idx < cellsCount; ++idx)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (_indices.ContainsKey(idx))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tupdateCellAtIndex(idx, row);\r\n\t\t\t\t\tyield return new WaitForEndOfFrame();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tisAsyncOnce = false;\r\n\t\t}\r\n\r\n        protected override void onDraggingScrollEnded()\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            if (autoRelocate)\r\n            {\r\n                Vector2 offset = getContentOffset();\r\n                int row = cellBeginRowFromOffset(offset);\r\n                Vector2 pointA = cellPositionFromIndex(cellFirstIndexFromRow(row));\r\n                Vector2 pointB = new Vector2(0, pointA.y - cellsSize.y);\r\n                Vector2 contentPoint = new Vector2(0, GetComponent<RectTransform>().rect.height);\r\n                offset = offset - contentPoint;\r\n                pointA.x = 0;\r\n\r\n                float distanceA = Vector2.Distance(offset, -pointA);\r\n                float distanceB = Vector2.Distance(offset, -pointB);\r\n\r\n                if (distanceA < distanceB)\r\n                {\r\n                    float duration = Mathf.Abs(distanceA) / LTableView.AUTO_RELOCATE_SPPED;\r\n                    setContentOffsetInDuration(-pointA + contentPoint, duration);\r\n                }\r\n                else\r\n                {\r\n                    float duration = Mathf.Abs(distanceB) / LTableView.AUTO_RELOCATE_SPPED;\r\n                    setContentOffsetInDuration(-pointB + contentPoint, duration);\r\n                }\r\n            }\r\n\r\n            base.onDraggingScrollEnded();\r\n        }\r\n\r\n        protected LGridViewCell _onDataSourceAdapterHandler(LGridViewCell cell, int idx)\r\n        {\r\n            if (cell == null)\r\n            {\r\n                cell = new LGridViewCell();\r\n\t\t\t\tif (cell_tpl != null)\r\n\t\t\t\t\tcell.node = (GameObject)Instantiate (cell_tpl);\r\n\t\t\t\telse {\r\n\t\t\t\t\tTransform tpl = transform.Find (\"container/cell_tpl\");\r\n\t\t\t\t\tif (tpl) {\r\n\t\t\t\t\t\tcell.node = (GameObject)Instantiate (tpl.gameObject);\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tDebug.LogWarning(\"模板为空\");\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n            }\r\n            if(onCellHandle != null)\r\n            {\r\n                onCellHandle.Invoke(idx, cell.node);\r\n            }\r\n            return cell;\r\n        }\r\n\r\n    }\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LGridView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 5d5632768e283584696053695f60af68\ntimeCreated: 1450926459\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LHUDSort.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\nusing UnityEngine;\nusing System.Collections.Generic;\nusing System.Collections;\nusing SLua;\n\n[CustomLuaClass]\npublic class LHUDSort : MonoBehaviour {\n\n    private List<Transform> list;\r\n\r\n    // Use this for initialization\r\n    void Start () {\r\n        list = new List<Transform>();\r\n    }\r\n\r\n    // Update is called once per frame\r\n    void Update () {\r\n\r\n        list.Clear();\r\n\r\n        foreach(Transform t in transform)\r\n        {\r\n            if (t.gameObject.GetComponent<LHUDView>() != null)\r\n            {\r\n                list.Add(t);\r\n            }\r\n        }\r\n\r\n        list.Sort((a, b) =>\r\n        {\r\n            return (int)((a.position.z - b.position.z) * 1000);\r\n        });\r\n\t\t\r\n\t\tint len = list.Count;\r\n        for (int i = 0; i < len; i++)\r\n        {\r\n            list[i].transform.SetSiblingIndex(i);\r\n        }\r\n    }\n}\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LHUDSort.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 0539c5e78915d0141a5dd228dc6ce6b7\ntimeCreated: 1463744568\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LHUDView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing SLua;\r\n\r\n[CustomLuaClass]\r\npublic class LHUDView : MonoBehaviour {\r\n\r\n    public Transform target;\r\n    public Vector3 offset = new Vector3(0, 1, 0);\r\n\r\n    void Update()\r\n    {\r\n        if (target != null)\r\n        {\r\n            transform.position = Camera.main.WorldToScreenPoint(target.position + offset);\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LHUDView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: fdeca989205b3eb45a1bbb970eba926d\ntimeCreated: 1463742991\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LInputfield.cs",
    "content": "﻿/****************************************************************************\nCopyright (c) 2015 Lingjijian\n\nCreated by Lingjijian on 2015\n\n342854406@qq.com\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n****************************************************************************/\nusing System.Collections;\nusing System.Collections.Generic;\nusing UnityEngine.UI;\nusing UnityEngine;\nusing UnityEngine.EventSystems;\n\npublic class LInputfield : MonoBehaviour,IPointerClickHandler {\n\t\t\n\tprivate Vector3 originPos;\n\tpublic Transform container;\n\tprivate bool _isPoping;\n\tprivate bool _isFocus;\n\tprivate float offsetY = 0.0f;\n\n\tvoid Start(){\n\t\tif(container == null){\n\t\t\tcontainer = this.transform;\n\t\t}\n\n\t\toriginPos = container.position;\n\t\tGetComponent<InputField> ().onEndEdit.AddListener ((string input) => {\n\t\t\t_isFocus = false;\n\t\t\t_isPoping = false;\n\t\t\tcontainer.position = new Vector3(container.position.x,container.position.y - offsetY,0);\n\t\t});\n\t}\n\n\tpublic static int GetKeyboardHeight()\n\t{\n\t\t#if !UNITY_EDITOR\n\t\t#if UNITY_ANDROID\n\t\tusing(AndroidJavaClass UnityClass = new AndroidJavaClass(\"com.unity3d.player.UnityPlayer\"))\n\t\t{\n\t\t\tAndroidJavaObject View = UnityClass.GetStatic<AndroidJavaObject>(\"currentActivity\").Get<AndroidJavaObject>(\"mUnityPlayer\").Call<AndroidJavaObject>(\"getView\");\n\n\t\t\tusing(AndroidJavaObject Rct = new AndroidJavaObject(\"android.graphics.Rect\"))\n\t\t\t{\n\t\t\tView.Call(\"getWindowVisibleDisplayFrame\", Rct);\n\n\t\t\treturn Screen.height - Rct.Call<int>(\"height\");\n\t\t\t}\n\t\t}\n\t\t#elif UNITY_IOS\n\t\t\treturn (int)TouchScreenKeyboard.area.height;\n\t\t#endif\n\t\t#else\n\t\t\treturn 0;\n\t\t#endif\n\t}\n\n\tvoid Update(){\n\t\tif (_isFocus) {\n\t\t\tif (GetKeyboardHeight () > 0 && _isPoping == false) {\n\t\t\t\t_isPoping = true;\n\n\t\t\t\tfloat targetHeight = GetKeyboardHeight() + 130;\n\t\t\t\tif(transform.position.y < targetHeight){\n\t\t\t\t\toffsetY = targetHeight - transform.position.y;\n\t\t\t\t\tcontainer.position = new Vector3(container.position.x,container.position.y + offsetY,0);\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\n\tpublic void OnPointerClick(PointerEventData eventData)\n\t{\n\t\t_isFocus = true;\n\t}\n\t\t\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LInputfield.cs.meta",
    "content": "fileFormatVersion: 2\nguid: edd338e4669884341885e30ffed49f0b\ntimeCreated: 1500007726\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LLabelAtlas.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.UI;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 缓存结构\r\n    /// </summary>\r\n    class LCacheElement : Object\r\n    {\r\n        public bool isUse;\r\n        public GameObject node;\r\n        public LCacheElement(GameObject node)\r\n        {\r\n            this.node = node;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 图集字\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LLabelAtlas : MonoBehaviour\r\n    {\r\n        public string text;\r\n        public string atlas;\r\n        public string prefix;\r\n        private Sprite[] sprites;\r\n        Dictionary<string, Sprite> _spriteMap;\r\n        List<LCacheElement> _cacheImg;\r\n        public float lineSpacing;\r\n\r\n\t\tpublic TextAlignment align;\r\n\r\n        public LLabelAtlas()\r\n        {\r\n\t\t\talign = TextAlignment.Left;\r\n            _cacheImg = new List<LCacheElement>();\r\n            _spriteMap = new Dictionary<string, Sprite>();\r\n        }\r\n\r\n        void Start()\r\n        {\r\n            reload();\r\n        }\r\n\r\n        public void reload()\r\n        {\r\n            if (text != \"\")\r\n            {\r\n\t\t\t\tsprites = LLoadBundle.GetInstance().GetSpritesByName(atlas,prefix);\r\n                loadTexture();\r\n                render();\r\n            }\r\n        }\r\n\r\n        protected void loadTexture()\r\n        {\r\n            _spriteMap.Clear();\r\n            for (int i = 0; i < sprites.Length; i++)\r\n            {\r\n                _spriteMap.Add(sprites[i].name, sprites[i]);\r\n            }\r\n        }\r\n\r\n        protected void render()\r\n        {\r\n            //reset\r\n\t\t\tint _len = _cacheImg.Count;\r\n            for (int i=0;i< _len; i++)\r\n            {\r\n                _cacheImg[i].isUse = false;\r\n\t\t\t\t_cacheImg [i].node.SetActive (false);\r\n            }\r\n\r\n            char[] chars = text.ToCharArray();\r\n            int len = chars.Length;\r\n\r\n\t\t\tfloat preWidth = 0;\r\n\t\t\tfloat preHeight = 0;\r\n\t\t\tList<Image> imgs = new List<Image> ();\r\n            for (int i = 0; i < len; i++ )\r\n            {\r\n                string key = chars[i].ToString();\r\n\t\t\t\tif (_spriteMap.ContainsKey(prefix+key))\r\n                {\r\n                    GameObject img = getCacheImage();\r\n                    Image imgCom = img.GetComponent<Image>();\r\n\t\t\t\t\timgCom.sprite = _spriteMap[prefix+key];\r\n                    img.transform.SetParent(this.transform);\r\n\t\t\t\t\timg.SetActive (true);\r\n                    img.transform.localScale = new Vector3(1, 1, 1);\r\n\t\t\t\t\tfloat space = i == len - 1 ? 0 : lineSpacing;\r\n\t\t\t\t\tpreWidth += imgCom.sprite.textureRect.width + space;\r\n\t\t\t\t\timgs.Add (imgCom);\r\n                }\r\n            }\r\n           \r\n\t\t\tfloat offsetX = 0;\r\n\t\t\tRectTransform rtran = gameObject.GetComponent<RectTransform>();\r\n\r\n\t\t\tif (align == TextAlignment.Left) {\r\n\t\t\t\tfor(int i =0;i<imgs.Count;i++){\r\n\t\t\t\t\tImage img = imgs[i];\r\n\t\t\t\t\tfloat space = i == imgs.Count - 1 ? 0 : lineSpacing;\r\n\t\t\t\t\timg.transform.localPosition = new Vector2 (offsetX,0);\r\n\t\t\t\t\toffsetX += img.sprite.textureRect.width + space; \r\n\t\t\t\t\tpreHeight = Mathf.Max (img.sprite.textureRect.height, preHeight);\r\n\t\t\t\t}\r\n\t\t\t\trtran.pivot = Vector2.zero;\r\n\t\t\t} else if (align == TextAlignment.Center) {\r\n\t\t\t\tfor(int i =0;i<imgs.Count;i++){\r\n\t\t\t\t\tImage img = imgs[i];\r\n\t\t\t\t\tfloat space = i == imgs.Count - 1 ? 0 : lineSpacing;\r\n\t\t\t\t\timg.transform.localPosition = new Vector2 (-preWidth / 2 + offsetX, 0);\r\n\t\t\t\t\toffsetX += img.sprite.textureRect.width + space;\r\n\t\t\t\t\tpreHeight = Mathf.Max (img.sprite.textureRect.height, preHeight);\r\n\t\t\t\t}\r\n\t\t\t\trtran.pivot = new Vector2(0.5f,0f);\r\n\t\t\t} else if (align == TextAlignment.Right) {\r\n\t\t\t\tfor(int i =0;i<imgs.Count;i++){\r\n\t\t\t\t\tImage img = imgs[i];\r\n\t\t\t\t\tfloat space = i == imgs.Count - 1 ? 0 : lineSpacing;\r\n\t\t\t\t\timg.transform.localPosition = new Vector2 (-preWidth + offsetX, 0);\r\n\t\t\t\t\toffsetX += img.sprite.textureRect.width + space;\r\n\t\t\t\t\tpreHeight = Mathf.Max (img.sprite.textureRect.height, preHeight);\r\n\t\t\t\t}\r\n\t\t\t\trtran.pivot = new Vector2(1f,0f);\r\n\t\t\t}\r\n\t\t\trtran.sizeDelta = new Vector2(preWidth, preHeight);\r\n        }\r\n\r\n        protected GameObject getCacheImage()\r\n        {\r\n            GameObject ret = null;\r\n            int len = _cacheImg.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                LCacheElement cacheElem = _cacheImg[i];\r\n                if (cacheElem.isUse == false)\r\n                {\r\n                    cacheElem.isUse = true;\r\n                    ret = cacheElem.node;\r\n                    break;\r\n                }\r\n            }\r\n            if (ret == null)\r\n            {\r\n                ret = new GameObject();\r\n                ret.AddComponent<Image>();\r\n                ContentSizeFitter fit = ret.AddComponent<ContentSizeFitter>();\r\n                fit.verticalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n                fit.horizontalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n\r\n                RectTransform rtran = ret.GetComponent<RectTransform>();\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = new Vector2(0, 0);\r\n                rtran.anchorMin = new Vector2(0, 0);\r\n\r\n                LCacheElement cacheElem = new LCacheElement(ret);\r\n                cacheElem.isUse = true;\r\n                _cacheImg.Add(cacheElem);\r\n            }\r\n            return ret;\r\n        } \r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LLabelAtlas.cs.meta",
    "content": "fileFormatVersion: 2\nguid: e59f2195d96a75041b68e277339116a8\ntimeCreated: 1462857053\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LListView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 列表项\r\n    /// </summary>\r\n    public class LListNode\r\n    {\r\n        public GameObject obj;\r\n        public int tpl_id;\r\n        public LListNode(GameObject obj, int tpl_id)\r\n        {\r\n            this.obj = obj;\r\n            this.tpl_id = tpl_id;\r\n        }\r\n    }\r\n\r\n\r\n    /// <summary>\r\n    /// 列表\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LListView : LScrollView\r\n    {\r\n        public static Vector2 HorizontalNodeAnchorPoint = Vector2.zero;\r\n        public static Vector2 VerticalNodeAnchorPoint = Vector2.zero;\r\n\r\n        public int limitNum;\r\n        protected float _layoutIndexSize;\r\n        public List<LListNode> nodeList { get; protected set; }\r\n        public Dictionary<int, List<LListNode>> freeDic { get; protected set; }\r\n\r\n        public LListView()\r\n        {\r\n            this.limitNum = 0;\r\n            this._layoutIndexSize = 0;\r\n            this.direction = ScrollDirection.VERTICAL;\r\n            this.nodeList = new List<LListNode>();\r\n            this.freeDic = new Dictionary<int, List<LListNode>>();\r\n        }\r\n\r\n        public GameObject getNodeAtIndex(int idx)\r\n        {\r\n\t\t\tfor (int i = 0; i < nodeList.Count; i++) {\r\n\t\t\t\tif (i == idx) {\r\n\t\t\t\t\treturn nodeList [i].obj;\r\n\t\t\t\t}\r\n\t\t\t}\r\n            return null;\r\n        }\r\n\r\n        public int getIndexByObject(GameObject obj)\r\n        {\r\n            for (int i = 0; i < nodeList.Count; i++) {\r\n                if (obj == nodeList [i].obj) {\r\n                    return i;\r\n                }\r\n            }\r\n            return -1;\r\n        }\r\n\r\n        public void insertNodeAtLast(GameObject node, int tpl_id)\r\n        {\r\n            if (node != null)\r\n            {\r\n                nodeList.Add(new LListNode(node,tpl_id));\r\n            }\r\n            else\r\n            {\r\n                Debug.Log(\"LListView::insertNodeAtLast node is null\");\r\n            }\r\n            if (limitNum > 0)\r\n            {\r\n                checkRecycleItem();\r\n            }\r\n        }\r\n\r\n        public void insertNodeAtFront(GameObject node, int tpl_id)\r\n        {\r\n            if (node != null)\r\n            {\r\n                nodeList.Insert(0, new LListNode(node, tpl_id));\r\n            }\r\n            else\r\n            {\r\n                Debug.Log(\"LListView::insertNodeAtFront node is null\");\r\n            }\r\n            if (limitNum > 0)\r\n            {\r\n                checkRecycleItem();\r\n            }\r\n        }\r\n\r\n        public void insertNode(GameObject node, int tpl_id,int idx)\r\n        {\r\n            if (idx >= nodeList.Count)\r\n            {\r\n                insertNodeAtLast(node, tpl_id);\r\n                return;\r\n            }\r\n            nodeList.Insert(idx, new LListNode(node, tpl_id));\r\n            if (limitNum > 0)\r\n            {\r\n                checkRecycleItem();\r\n            }\r\n        }\r\n\r\n        public void removeNodeAtIndex(int idx)\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n            if(limitNum > 0)\r\n            {\r\n                LListNode node = nodeList[idx];\r\n                pushFreePool(node);\r\n            }else\r\n            {\r\n                Object.Destroy(nodeList[idx].obj);\r\n            }\r\n            nodeList.RemoveAt(idx);\r\n        }\r\n\r\n        public void removeNode(GameObject node)\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            LListNode del = null;\r\n            foreach(LListNode elem in nodeList)\r\n            {\r\n                if(elem.obj == node)\r\n                {\r\n                    del = elem;\r\n                    nodeList.Remove(elem);\r\n                    break;\r\n                }\r\n            }\r\n            if(limitNum > 0)\r\n            {\r\n                pushFreePool(del);\r\n            }\r\n            else\r\n            {\r\n                Object.Destroy(node);\r\n            }\r\n        }\r\n\r\n        public void removeFrontNode()\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            if (limitNum > 0)\r\n            {\r\n                pushFreePool(nodeList[0]);\r\n            }else\r\n            {\r\n                Object.Destroy(nodeList[0].obj);\r\n            }\r\n            nodeList.RemoveAt(0);\r\n        }\r\n\r\n        public void removeLastNode()\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n            if (limitNum > 0)\r\n            {\r\n                pushFreePool(nodeList[nodeList.Count - 1]);\r\n            }\r\n            else\r\n            {\r\n                Object.Destroy(nodeList[nodeList.Count - 1].obj);\r\n            }    \r\n            nodeList.RemoveAt(nodeList.Count - 1);\r\n        }\r\n\r\n        public void removeAllNodes()\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n            for (int i = 0; i < nodeList.Count; i++)\r\n            {\r\n                if(limitNum > 0)\r\n                {\r\n                    pushFreePool(nodeList[i]);\r\n                }else\r\n                {\r\n                    Object.Destroy(nodeList[i].obj);\r\n                }\r\n            }\r\n            nodeList.Clear();\r\n        }\r\n\r\n        protected void updateNodesPosition()\r\n        {\r\n            if (nodeList.Count == 0)\r\n            {\r\n                return;\r\n            }\r\n            _layoutIndexSize = 0;\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    {\r\n                        GameObject obj = null;\r\n                        for (int i = 0; i < nodeList.Count;i++ )\r\n                        {\r\n                            obj = nodeList[i].obj;\r\n                            obj.GetComponent<RectTransform>().pivot = HorizontalNodeAnchorPoint;\r\n                            obj.transform.SetParent(container.transform);\r\n                            obj.transform.localScale = new Vector3(1, 1,1);\r\n                            obj.transform.localPosition = new Vector2(_layoutIndexSize, 0);\r\n                            _layoutIndexSize += obj.GetComponent<RectTransform>().rect.width;\r\n                        }\r\n                    }\r\n                    break;\r\n                case ScrollDirection.VERTICAL:\r\n                    {\r\n                        float allNodesSize = 0;\r\n                        GameObject obj = null;\r\n                        for (int i = 0; i < nodeList.Count; i++)\r\n                        {\r\n                            obj = nodeList[i].obj;\r\n                            allNodesSize += obj.GetComponent<RectTransform>().rect.height;\r\n                        }\r\n\r\n                        _layoutIndexSize = allNodesSize;\r\n                        RectTransform rtran = GetComponent<RectTransform>();\r\n                        allNodesSize = Mathf.Max(rtran.rect.height, allNodesSize);\r\n                        setContainerSize(new Vector2(rtran.rect.width, allNodesSize));\r\n\r\n                        for (int i = 0; i < nodeList.Count; i++)\r\n                        {\r\n                            obj = nodeList[i].obj;\r\n                            allNodesSize -= obj.GetComponent<RectTransform>().rect.height;\r\n                            obj.GetComponent<RectTransform>().pivot = VerticalNodeAnchorPoint;\r\n                            obj.transform.SetParent(container.transform);\r\n                            obj.transform.localScale = new Vector3(1, 1,1);\r\n                            obj.transform.localPosition = new Vector2(0, allNodesSize);\r\n                        }\r\n                    }\r\n                    break;\r\n                default:\r\n                    break;\r\n            }\r\n        }\r\n\r\n        public void reloadData()\r\n        {\r\n            if (direction == ScrollDirection.VERTICAL)\r\n            {\r\n                RectTransform rtran = GetComponent<RectTransform>();\r\n                float oldHeight = rtran.rect.height;\r\n                updateNodesPosition();\r\n                float newHeight = rtran.rect.height - oldHeight;\r\n                setContentOffset(getContentOffset() - new Vector2(0, newHeight));\r\n            }\r\n            else\r\n            {\r\n                updateNodesPosition();\r\n            }\r\n\r\n            //unactive all tpl cell\r\n            for(int i = 0; i < 10; i++)\r\n            {\r\n                Transform tran = transform.Find(\"container/cell_tpl\" + i);\r\n                if (tran != null) {\r\n                    tran.gameObject.SetActive(false);\r\n                }\r\n            }\r\n\r\n            relocateContainer();\r\n        }\r\n\r\n        protected override void onScrolling()\r\n        {\r\n            base.onScrolling();\r\n\r\n            Vector2 worldPos = transform.position;\r\n            Rect rect = transform.GetComponent<RectTransform>().rect;\r\n            float resolution = Screen.height / 720.0f;\r\n\r\n            foreach(LListNode node in nodeList)\r\n            {\r\n                if(node.obj.transform.position.y < worldPos.y - 300 * resolution ||\r\n                    node.obj.transform.position.y > worldPos.y + rect.height + 300 * resolution)\r\n                {\r\n                    node.obj.SetActive(false);\r\n                }else\r\n                {\r\n                    node.obj.SetActive(true);\r\n                }\r\n            }\r\n        }\r\n\r\n\t\tpublic void scrollToCell (GameObject cell,float duration)\r\n\t\t{\r\n\t\t\tVector2 cellPos = cell.transform.localPosition;\r\n\t\t\tif (direction == ScrollDirection.HORIZONTAL) {\r\n\t\t\t\tcellPos = new Vector2 (cellPos.x * -1, 0); \r\n\t\t\t} else if (direction == ScrollDirection.VERTICAL) {\r\n\t\t\t\tcellPos = new Vector2 (0, cellPos.y * -1); \r\n\t\t\t}\r\n\t\t\tsetContentOffsetInDuration(cellPos,duration);\r\n\t\t}\r\n\r\n        protected void checkRecycleItem()\r\n        {\r\n            if (limitNum > 0)\r\n            {\r\n                if (nodeList.Count > limitNum)\r\n                {\r\n                    int count = nodeList.Count - limitNum;\r\n                    GameObject obj = null;\r\n                    for(int i=0;i<count;i++){\r\n                        removeFrontNode();\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        private void pushFreePool(LListNode node)\r\n        {\r\n            if (!freeDic.ContainsKey(node.tpl_id))\r\n                freeDic.Add(node.tpl_id, new List<LListNode>());\r\n\r\n            freeDic[node.tpl_id].Add(node);\r\n            node.obj.SetActive(false);\r\n        }\r\n\r\n        private LListNode popFreePool(int id)\r\n        {\r\n            if (!freeDic.ContainsKey(id))\r\n                freeDic.Add(id, new List<LListNode>());\r\n            LListNode node = null;\r\n\r\n            if (freeDic[id].Count > 0) {\r\n                node = freeDic[id][0];\r\n                freeDic[id].RemoveAt(0);\r\n                node.obj.SetActive(true);\r\n            }\r\n            return node;\r\n        }\r\n\r\n        public GameObject dequeueItem(int id)\r\n        {\r\n            GameObject ret = null;\r\n            if(limitNum > 0){\r\n                LListNode node = popFreePool(id);\r\n                if (node != null) ret = node.obj;\r\n            }\r\n\r\n            if (ret == null)\r\n            {\r\n                ret = Instantiate(transform.Find(\"container/cell_tpl\"+id).gameObject);\r\n                ret.SetActive(true);\r\n            }\r\n            return ret;\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LListView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 3d5763cd1334196469a49d1e8dbcfc05\ntimeCreated: 1451049160\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LMacros.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nnamespace Lui\r\n{\r\n    public delegate void LAction();\r\n    public delegate void LAction<T0>(T0 arg0);\r\n    public delegate void LAction<T0, T1>(T0 arg0, T1 arg1);\r\n\r\n    public delegate T0 LDataSourceAdapter<T0, T1>(T0 arg0, T1 arg1);\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LMacros.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 9fe4a981e2984824c80fa9712476c287\ntimeCreated: 1462857053\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LMovieClip.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.UI;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 序列帧动画\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n\tpublic class LMovieClip : MonoBehaviour\r\n    {\r\n        public float fps = 15f;\r\n\t\tpublic bool isPlayOnwake = false;\r\n\t\tpublic string path;\r\n\r\n        protected Image _comImage;\r\n        protected SpriteRenderer _comSprender;\r\n        protected float _time;\r\n        protected int _frameLenght;\r\n        protected bool _isPlaying = false;\r\n\t\tprotected int _currentIndex = 0;\r\n        protected Sprite[] _spriteArr;\r\n\r\n        // Use this for initialization\r\n        void Start()\r\n        {\r\n            _comImage = gameObject.GetComponent<Image>();\r\n            _comSprender = gameObject.GetComponent<SpriteRenderer>();\r\n\r\n\t\t\tif (isPlayOnwake) {\r\n\t\t\t\tloadTexture ();\r\n\t\t\t\tplay ();\r\n\t\t\t}\r\n        }\r\n\r\n\t\tpublic void loadTexture()\r\n\t\t{\r\n\t\t\t//if (_spriteArr == null) {\r\n\t            //load textures\r\n\t            string atlasPath = System.IO.Path.GetDirectoryName(path);\r\n\t            string assetName = System.IO.Path.GetFileNameWithoutExtension(path);\r\n\t\t\tSprite[] sprites = LLoadBundle.GetInstance().GetSpritesByName(atlasPath, assetName);\r\n\t            Dictionary<string, Sprite> dic = new Dictionary<string, Sprite>();\r\n\t            int len = sprites.Length;\r\n\t            for (int i=0;i< len;i++)\r\n\t            {\r\n\t                Sprite s = sprites[i];\r\n\t                if (s.name.StartsWith(assetName))\r\n\t                {\r\n\t                    dic.Add(s.name, s);\r\n\t                }\r\n\t            }\r\n\t            int idx = 1;\r\n\t            List<Sprite> list = new List<Sprite>();\r\n\t            while (dic.ContainsKey(assetName + idx.ToString(\"D2\")))\r\n\t            {\r\n\t                list.Add(dic[assetName + idx.ToString(\"D2\")]);\r\n\t                idx++;\r\n\t            }\r\n\t            _frameLenght = list.Count;\r\n\t            _spriteArr = list.ToArray();\r\n\t\t\t\t_currentIndex = 0;\r\n\t\t\t//}\r\n        }\r\n\r\n        void Update()\r\n        {\r\n            if (_isPlaying)\r\n            {\r\n                drawAnimation();\r\n            }\r\n        }\r\n\r\n        // Update is called once per frame\r\n        protected void drawAnimation()\r\n        {\r\n            if(_comImage)\r\n                _comImage.sprite = _spriteArr[_currentIndex];\r\n            else if(_comSprender)\r\n                _comSprender.sprite = _spriteArr[_currentIndex];\r\n\r\n\r\n            if (_currentIndex < _frameLenght)\r\n            {\r\n                _time += Time.deltaTime;\r\n                if (_time >= 1.0f / fps)\r\n                {\r\n\t\t\t\t\t_currentIndex++;\r\n                    _time = 0;\r\n                    if (_currentIndex == _frameLenght)\r\n                    {\r\n                        _currentIndex = 0;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n\r\n        public void play()\r\n        {\r\n            _isPlaying = true;\r\n        }\r\n\r\n        public void stop()\r\n        {\r\n            _isPlaying = false;\r\n            _currentIndex = 0;\r\n            // _comImage.sprite = _spriteArr[0];\r\n        }\r\n\r\n        public void pause()\r\n        {\r\n            _isPlaying = false;\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LMovieClip.cs.meta",
    "content": "fileFormatVersion: 2\nguid: e76aa81b6b69fba4b879a8809d3f67c2\ntimeCreated: 1462857053\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LPageView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    /// <summary>\r\n    /// 翻页\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LPageView : LTableView\r\n    {\r\n        public int pageIndex { get; protected set; }\r\n        public UnityAction<int> onPageChangedHandler;\r\n        public void SetCellHandle(UnityAction<int, GameObject> act)\r\n        {\r\n            onCellHandle = act;\r\n        }\r\n\r\n        protected override void onScrolling()\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n            base.onScrolling();\r\n\r\n            Vector2 pageIdxOffset = default(Vector2);\r\n            RectTransform rtran = GetComponent<RectTransform>();\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    pageIdxOffset = getContentOffset() - new Vector2(rtran.rect.width / 2, 0);\r\n                    break;\r\n                case ScrollDirection.VERTICAL:\r\n                    pageIdxOffset = getContentOffset() + new Vector2(0, rtran.rect.height / 2);\r\n                    break;\r\n                default:\r\n                    break;\r\n            }\r\n\r\n            int page = cellBeginIndexFromOffset(pageIdxOffset);\r\n            if (page != pageIndex)\r\n            {\r\n                pageIndex = page;\r\n                if (onPageChangedHandler != null)\r\n                {\r\n                    onPageChangedHandler.Invoke(pageIndex);\r\n                }\r\n            }\r\n            \r\n        }\r\n\r\n        public override void updateCellAtIndex(int idx)\r\n        {\r\n            LTableViewCell cell = _onDataSourceAdapterHandler(dequeueCell(), idx);\r\n            if (cell == null)\r\n            {\r\n                Debug.LogError(\"cell can not be NULL\");\r\n            }\r\n            cell.idx = idx;\r\n\r\n            RectTransform rtran = cell.node.GetComponent<RectTransform>();\r\n            switch(direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    rtran.pivot = new Vector2(0,0);\r\n                    break;\r\n                default:\r\n                    rtran.pivot = new Vector2(0,1);\r\n                    break;\r\n            }\r\n\r\n            rtran.sizeDelta = cellsSize;\r\n            cell.node.SetActive(true);\r\n            cell.node.transform.SetParent(container.transform);\r\n            cell.node.transform.localScale = new Vector3(1, 1,1);\r\n            cell.node.transform.localPosition = cellPositionFromIndex(idx);\r\n            insertSortableCell(cell,idx);\r\n            indices.Add(idx,1);\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LPageView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: afb443db76ce97f449bd339d012435bf\ntimeCreated: 1451049160\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LPickMark.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n\t[SLua.CustomLuaClass]\r\n\tpublic class LPickMark : MonoBehaviour,IPointerDownHandler {\r\n\r\n\t    public Lui.LTableView tableView;\r\n\t    public string param;\r\n\r\n\t    public void OnPointerDown(PointerEventData eventData)\r\n\t    {\r\n\t        tableView.curPickObj = gameObject;\r\n\t    }\r\n\t}\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LPickMark.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 87fa17c2b35b5c549b810ca67dcf0f58\ntimeCreated: 1484788526\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LProgress.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n\tpublic enum ProgressLabStyle\r\n\t{\r\n\t    Normal,\r\n\t    Value\r\n\t}\r\n\r\n\t[SLua.CustomLuaClass]\r\n\tpublic class LProgress : MonoBehaviour {\r\n\r\n\t\tpublic float maxValue;\r\n\t\tpublic float minValue;\r\n\t\tprivate float _value;\r\n\t\tpublic RectMask2D mask;\r\n\t\tpublic Text label;\r\n\t\tprivate bool _isStartProgress;\r\n\t\tprivate float _arrivePercentage;\r\n\t\tprivate float _startProgressStep;\r\n\t\tpublic UnityAction onProgress;\r\n\t\tpublic UnityAction onProgressEnd;\r\n\t    public ProgressLabStyle style;\r\n\t    protected float _width;\r\n\t    protected float _height;\r\n\r\n\t    public LProgress()\r\n\t\t{\r\n\t\t\tmaxValue = 100;\r\n\t\t\tminValue = 0;\r\n\t\t\t_value = 15;\r\n\t\t\t_isStartProgress = false;\r\n\t\t\t_arrivePercentage = 0;\r\n\t\t\t_startProgressStep = 0;\r\n\t\t\tstyle = ProgressLabStyle.Normal;\r\n\t\t}\r\n\r\n\t    public void setValue(float value)\r\n\t\t{\r\n\t\t\tthis._value = Mathf.Min(maxValue, Mathf.Max(minValue, value));\r\n\t        mask.GetComponent<RectTransform>().sizeDelta = new Vector2(\r\n\t        \tGetComponent<RectTransform>().rect.width * getPercentage(), \r\n\t        \tGetComponent<RectTransform>().rect.height);\r\n\t        mask.gameObject.SetActive(_value != 0);\r\n\t        if (label)\r\n\t        {\r\n\t        \tif(style == ProgressLabStyle.Normal){\r\n\t        \t\tlabel.text = (this._value / maxValue * 100).ToString(\"0.0\") + \"%\";\r\n\t    \t\t}else if(style == ProgressLabStyle.Value){\r\n\t    \t\t\tlabel.text = string.Format(\"{0}/{1}\",this._value,maxValue);\r\n\t    \t\t}\r\n\t           \r\n\t        }\r\n\t\t}\r\n\r\n\t\tpublic float getValue()\r\n\t\t{\r\n\t\t\treturn _value;\r\n\t\t}\r\n\r\n\t\tpublic float getPercentage()\r\n\t\t{\r\n\t\t\treturn (_value - minValue) / (maxValue - minValue); \r\n\t\t}\r\n\r\n\t\tpublic void startProgress(float value,float step)\r\n\t\t{\r\n\t\t\tif (value <= minValue && value >= maxValue) {\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\t_arrivePercentage = (value - minValue) / (maxValue - minValue);\r\n\t\t\t_startProgressStep = step;\r\n\t\t\t_isStartProgress = true;\r\n\t\t}\r\n\r\n\t\tvoid Update()\r\n\t\t{\r\n\t\t\tif (_isStartProgress) {\r\n\t\t\t\t_value = _value + _startProgressStep;\r\n\t\t\t\tfloat perc = getPercentage ();\r\n\t            mask.GetComponent<RectTransform>().sizeDelta = new Vector2(\r\n\t            \tGetComponent<RectTransform>().rect.width * perc, \r\n\t            \tGetComponent<RectTransform>().rect.height);\r\n\t            \r\n\t            if (label) {\r\n\t                if (style == ProgressLabStyle.Normal)\r\n\t                {\r\n\t                    label.text = (perc * 100).ToString(\"0.0\") + \"%\";\r\n\t                }\r\n\t                else if (style == ProgressLabStyle.Value)\r\n\t                {\r\n\t                    label.text = string.Format(\"{0}/{1}\", this._value, maxValue);\r\n\t                }\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (perc < _arrivePercentage) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (onProgress!=null)\r\n\t\t\t\t\t\tonProgress.Invoke ();\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tif (onProgressEnd!=null)\r\n\t\t\t\t\t\tonProgressEnd.Invoke ();\r\n\t\t\t\t\t_isStartProgress = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LProgress.cs.meta",
    "content": "fileFormatVersion: 2\nguid: cddd080bfa6292d4aba1305ce7eeda47\ntimeCreated: 1479796445\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LRichText.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n\r\n    public enum RichType\r\n    {\r\n        TEXT,\r\n        IMAGE,\r\n        ANIM,\r\n        NEWLINE,\r\n    }\r\n\r\n    public enum RichAlignType\r\n    {\r\n        DESIGN_CENTER,\r\n        LEFT_TOP,\r\n    }\r\n\r\n    class LRichElement : Object\r\n    {\r\n        public RichType type { get; protected set; }\r\n        public Color color { get; protected set; }\r\n        public string data { get; protected set; }\r\n    }\r\n    /// <summary>\r\n    /// 文本元素\r\n    /// </summary>\r\n    class LRichElementText : LRichElement\r\n    {\r\n        public string txt { get; protected set; }\r\n        public bool isUnderLine { get; protected set; }\r\n        public bool isOutLine { get; protected set; }\r\n        public int fontSize { get; protected set; }\r\n        public Color outLineColor { get; protected set; }\r\n\r\n        public LRichElementText(Color color, string txt, int fontSize, bool isUnderLine, bool isOutLine,Color outLineColor, string data)\r\n        {\r\n            this.type = RichType.TEXT;\r\n            this.color = color;\r\n            this.txt = txt;\r\n            this.fontSize = fontSize;\r\n            this.isUnderLine = isUnderLine;\r\n            this.isOutLine = isOutLine;\r\n            this.outLineColor = outLineColor;\r\n            this.data = data;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 图片元素\r\n    /// </summary>\r\n    class LRichElementImage : LRichElement\r\n    {\r\n        public string path { get; protected set; }\r\n\r\n        public LRichElementImage(string path, string data)\r\n        {\r\n            this.type = RichType.IMAGE;\r\n            this.path = path;\r\n            this.data = data;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 动画元素\r\n    /// </summary>\r\n    class LRichElementAnim : LRichElement\r\n    {\r\n        public string path { get; protected set; }\r\n        public float fs { get; protected set; }\r\n\r\n        public LRichElementAnim(string path, float fs, string data)\r\n        {\r\n            this.type = RichType.ANIM;\r\n            this.path = path;\r\n            this.data = data;\r\n            this.fs = fs;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 换行元素\r\n    /// </summary>\r\n    class LRichElementNewline : LRichElement\r\n    {\r\n        public LRichElementNewline()\r\n        {\r\n            this.type = RichType.NEWLINE;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 缓存结构\r\n    /// </summary>\r\n    class LRichCacheElement : Object\r\n    {\r\n        public bool isUse;\r\n        public GameObject node;\r\n        public LRichCacheElement(GameObject node)\r\n        {\r\n            this.node = node;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 渲染结构\r\n    /// </summary>\r\n    struct LRenderElement\r\n    {\r\n        public RichType type;\r\n        public string strChar;\r\n        public int width;\r\n        public int height;\r\n        public bool isOutLine;\r\n        public bool isUnderLine;\r\n        public Color outLineColor;\r\n        public Font font;\r\n        public int fontSize;\r\n        public Color color;\r\n        public string data;\r\n        public string path;\r\n        public float fs;\r\n        public bool isNewLine;\r\n        public Vector2 pos;\r\n\r\n        public LRenderElement Clone()\r\n        {\r\n            LRenderElement cloneOjb;\r\n            cloneOjb.type = this.type;\r\n            cloneOjb.strChar = this.strChar;\r\n            cloneOjb.width = this.width;\r\n            cloneOjb.height = this.height;\r\n            cloneOjb.isOutLine = this.isOutLine;\r\n            cloneOjb.isUnderLine = this.isUnderLine;\r\n            cloneOjb.outLineColor = this.outLineColor;\r\n            cloneOjb.font = this.font;\r\n            cloneOjb.fontSize = this.fontSize;\r\n            cloneOjb.color = this.color;\r\n            cloneOjb.data = this.data;\r\n            cloneOjb.path = this.path;\r\n            cloneOjb.fs = this.fs;\r\n            cloneOjb.isNewLine = this.isNewLine;\r\n            cloneOjb.pos = this.pos;\r\n            return cloneOjb;\r\n        }\r\n\r\n\t\tpublic bool isSameStyle(LRenderElement elem)\r\n\t\t{\r\n\t\t\treturn (this.color \t\t\t== elem.color &&\r\n\t\t\t\t    this.isOutLine \t\t== elem.isOutLine &&\r\n\t\t\t\t\tthis.isUnderLine \t== elem.isUnderLine &&\r\n                    this.outLineColor   == elem.outLineColor &&\r\n                    this.font \t\t\t== elem.font &&\r\n\t\t\t\t\tthis.fontSize \t\t== elem.fontSize &&\r\n\t\t\t\t\tthis.data \t\t\t== elem.data);\r\n\t\t}\r\n    }\r\n\r\n    /// <summary>\r\n    /// 富文本\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LRichText : MonoBehaviour, IPointerClickHandler\r\n    {\r\n        public RichAlignType alignType;\r\n        public int verticalSpace;\r\n        public int maxLineWidth;\r\n        public Font font;\r\n\r\n        public UnityAction<string> onClickHandler;\r\n        public int realLineHeight { get; protected set; }\r\n        public int realLineWidth { get; protected set; }\r\n\r\n        List<LRichElement> _richElements;\r\n        List<LRenderElement> _elemRenderArr;\r\n        List<LRichCacheElement> _cacheLabElements;\r\n        List<LRichCacheElement> _cacheImgElements;\r\n        List<LRichCacheElement> _cacheFramAnimElements;\r\n        Dictionary<GameObject, string> _objectDataMap;\r\n        //custom content parser setting\r\n        public int defaultLabSize = 20;\r\n        public string defaultLabColor = \"#ff00ff\";\r\n        public bool raycastTarget = false;\r\n\r\n        public void removeAllElements()\r\n        {\r\n            int len = _cacheLabElements.Count;\r\n            for (int i=0;i< len;i++)\r\n            {\r\n                _cacheLabElements[i].isUse = false;\r\n                _cacheLabElements[i].node.gameObject.SetActive(false);\r\n            }\r\n            len = _cacheImgElements.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                _cacheImgElements[i].isUse = false;\r\n                _cacheImgElements[i].node.gameObject.SetActive(false);\r\n            }\r\n            len = _cacheFramAnimElements.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                _cacheFramAnimElements[i].isUse = false;\r\n                _cacheFramAnimElements[i].node.gameObject.SetActive(false);\r\n            }\r\n            _elemRenderArr.Clear();\r\n            _objectDataMap.Clear();\r\n        }\r\n\r\n        public void insertElement(string txt, Color color, int fontSize, bool isUnderLine, bool isOutLine, Color outLineColor, string data)\r\n        {\r\n            _richElements.Add(new LRichElementText(color, txt, fontSize, isUnderLine, isOutLine, outLineColor, data));\r\n        }\r\n\r\n        public void insertElement(string path, float fp, string data)\r\n        {\r\n            _richElements.Add(new LRichElementAnim(path, fp, data));\r\n        }\r\n\r\n        public void insertElement(string path, string data)\r\n        {\r\n            _richElements.Add(new LRichElementImage(path, data));\r\n        }\r\n\r\n        public void insertElement(int newline)\r\n        {\r\n            _richElements.Add(new LRichElementNewline());\r\n        }\r\n\r\n        public LRichText()\r\n        {\r\n            this.alignType = RichAlignType.LEFT_TOP;\r\n            this.verticalSpace = 0;\r\n            this.maxLineWidth = 300;\r\n\r\n            _richElements = new List<LRichElement>();\r\n            _elemRenderArr = new List<LRenderElement>();\r\n            _cacheLabElements = new List<LRichCacheElement>();\r\n            _cacheImgElements = new List<LRichCacheElement>();\r\n            _cacheFramAnimElements = new List<LRichCacheElement>();\r\n            _objectDataMap = new Dictionary<GameObject, string>();\r\n        }\r\n\r\n        public void reloadData()\r\n        {\r\n            this.removeAllElements();\r\n\r\n            RectTransform rtran = this.GetComponent<RectTransform>();\r\n            //align\r\n            if (alignType == RichAlignType.DESIGN_CENTER)\r\n            {\r\n                rtran.GetComponent<RectTransform>().pivot = new Vector2(0.5f, 0.5f);\r\n\r\n            }\r\n            else if (alignType == RichAlignType.LEFT_TOP)\r\n            {\r\n                rtran.GetComponent<RectTransform>().pivot = new Vector2(0f, 1f);\r\n            }\r\n\r\n            int len = _richElements.Count;\r\n            for (int i =0;i< len;i++)\r\n            {\r\n                LRichElement elem = _richElements[i];\r\n                if (elem.type == RichType.TEXT)\r\n                {\r\n                    LRichElementText elemText = elem as LRichElementText;\r\n                    char[] _charArr = elemText.txt.ToCharArray();\r\n                    TextGenerator gen = new TextGenerator();\r\n\r\n                    foreach (char strChar in _charArr)\r\n                    {\r\n                        LRenderElement rendElem = new LRenderElement();\r\n                        rendElem.type = RichType.TEXT;\r\n                        rendElem.strChar = strChar.ToString();\r\n                        rendElem.isOutLine = elemText.isOutLine;\r\n                        rendElem.isUnderLine = elemText.isUnderLine;\r\n                        rendElem.outLineColor = elemText.outLineColor;\r\n                        rendElem.font = this.font;\r\n                        rendElem.fontSize = elemText.fontSize;\r\n                        rendElem.data = elemText.data;\r\n                        rendElem.color = elemText.color;\r\n\r\n                        TextGenerationSettings setting = new TextGenerationSettings();\r\n                        setting.font = this.font;\r\n                        setting.fontSize = elemText.fontSize;\r\n                        setting.lineSpacing = 0;\r\n                        setting.scaleFactor = 1;\r\n                        setting.verticalOverflow = VerticalWrapMode.Overflow;\r\n                        setting.horizontalOverflow = HorizontalWrapMode.Overflow;\r\n\r\n                        rendElem.width = (int)gen.GetPreferredWidth(rendElem.strChar, setting);\r\n                        rendElem.height = (int)gen.GetPreferredHeight(rendElem.strChar, setting);\r\n                        _elemRenderArr.Add(rendElem);\r\n                    }\r\n                }\r\n                else if (elem.type == RichType.IMAGE)\r\n                {\r\n                    LRichElementImage elemImg = elem as LRichElementImage;\r\n                    LRenderElement rendElem = new LRenderElement();\r\n                    rendElem.type = RichType.IMAGE;\r\n                    rendElem.path = elemImg.path;\r\n                    rendElem.data = elemImg.data;\r\n\r\n\t\t\t\t\tstring atlas = System.IO.Path.GetDirectoryName(rendElem.path);\r\n\t\t\t\t\tstring spname = System.IO.Path.GetFileName(rendElem.path);\r\n\r\n                    Sprite sp = LLoadBundle.GetInstance().GetSpriteByName(atlas, spname);\r\n                    rendElem.width = (int)sp.rect.size.x;\r\n                    rendElem.height = (int)sp.rect.size.y;\r\n                    _elemRenderArr.Add(rendElem);\r\n                }\r\n                else if (elem.type == RichType.ANIM)\r\n                {\r\n                    LRichElementAnim elemAnim = elem as LRichElementAnim;\r\n                    LRenderElement rendElem = new LRenderElement();\r\n                    rendElem.type = RichType.ANIM;\r\n                    rendElem.path = elemAnim.path;\r\n                    rendElem.data = elemAnim.data;\r\n                    rendElem.fs = elemAnim.fs;\r\n\r\n                    string atlas = System.IO.Path.GetDirectoryName(rendElem.path);\r\n                    string spname = System.IO.Path.GetFileName(rendElem.path);\r\n\r\n                    Sprite sp = LLoadBundle.GetInstance().GetSpriteByName(atlas, spname);\r\n                    rendElem.width = (int)sp.rect.size.x;\r\n                    rendElem.height = (int)sp.rect.size.y;\r\n                    _elemRenderArr.Add(rendElem);\r\n                }\r\n                else if (elem.type == RichType.NEWLINE)\r\n                {\r\n                    LRenderElement rendElem = new LRenderElement();\r\n                    rendElem.isNewLine = true;\r\n                    rendElem.type = RichType.NEWLINE;\r\n                    _elemRenderArr.Add(rendElem);\r\n                }\r\n            }\r\n\r\n            _richElements.Clear();\r\n\r\n            formatRenderers();\r\n        }\r\n\r\n        protected void formatRenderers()\r\n        {\r\n            int oneLine = 0;\r\n            int lines = 1;\r\n            bool isReplaceInSpace = false;\r\n            int len = _elemRenderArr.Count;\r\n\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                isReplaceInSpace = false;\r\n                LRenderElement elem = _elemRenderArr[i];\r\n                if (elem.isNewLine) // new line\r\n                {\r\n                    oneLine = 0;\r\n                    lines++;\r\n                    elem.width = 10;\r\n                    elem.height = 27;\r\n                    elem.pos = new Vector2(oneLine, -lines * 27);\r\n\r\n                }\r\n                else //other elements\r\n                {\r\n                    if (oneLine + elem.width > maxLineWidth)\r\n                    {\r\n                        if (elem.type == RichType.TEXT)\r\n                        {\r\n                            if (isChinese(elem.strChar) || elem.strChar == \" \")\r\n                            {\r\n                                oneLine = 0;\r\n                                lines++;\r\n\r\n                                elem.pos = new Vector2(oneLine, -lines * 27);\r\n                                oneLine = elem.width;\r\n                            }\r\n                            else // en\r\n                            {\r\n                                int spaceIdx = 0;\r\n                                int idx = i;\r\n                                while (idx > 0)\r\n                                {\r\n                                    idx--;\r\n                                    if (_elemRenderArr[idx].strChar == \" \" &&\r\n                                        _elemRenderArr[idx].pos.y == _elemRenderArr[i - 1].pos.y) // just for the same line\r\n                                    {\r\n                                        spaceIdx = idx;\r\n                                        break;\r\n                                    }\r\n                                }\r\n                                // can't find space , force new line\r\n                                if (spaceIdx == 0)\r\n                                {\r\n                                    oneLine = 0;\r\n                                    lines++;\r\n                                    elem.pos = new Vector2(oneLine, -lines * 27);\r\n                                    oneLine = elem.width;\r\n                                }\r\n                                else\r\n                                {\r\n                                    oneLine = 0;\r\n                                    lines++;\r\n                                    isReplaceInSpace = true; //reset cuting words position\r\n\r\n                                    for (int _i = spaceIdx + 1; _i <= i; ++_i)\r\n                                    {\r\n                                        LRenderElement _elem = _elemRenderArr[_i];\r\n                                        _elem.pos = new Vector2(oneLine, -lines * 27);\r\n                                        oneLine += _elem.width;\r\n\r\n                                        _elemRenderArr[_i] = _elem;\r\n                                    }\r\n                                }\r\n                            }\r\n                        }\r\n                        else if (elem.type == RichType.ANIM || elem.type == RichType.IMAGE)\r\n                        {\r\n                            lines++;\r\n                            elem.pos = new Vector2(0, -lines * 27);\r\n                            oneLine = elem.width;\r\n                        }\r\n                    }\r\n                    else\r\n                    {\r\n                        elem.pos = new Vector2(oneLine, -lines * 27);\r\n                        oneLine += elem.width;\r\n                    }\r\n                }\r\n                if (isReplaceInSpace == false)\r\n                {\r\n                    _elemRenderArr[i] = elem;\r\n                }\r\n            }\r\n            //sort all lines\r\n            Dictionary<int, List<LRenderElement>> rendElemLineMap = new Dictionary<int, List<LRenderElement>>();\r\n            List<int> lineKeyList = new List<int>();\r\n            len = _elemRenderArr.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                LRenderElement elem = _elemRenderArr[i];\r\n                List<LRenderElement> lineList;\r\n\r\n                if (!rendElemLineMap.ContainsKey((int)elem.pos.y))\r\n                {\r\n                    lineList = new List<LRenderElement>();\r\n                    rendElemLineMap[(int)elem.pos.y] = lineList;\r\n                }\r\n                rendElemLineMap[(int)elem.pos.y].Add(elem);\r\n            }\r\n            // all lines in arr\r\n            List<List<LRenderElement>> rendLineArrs = new List<List<LRenderElement>>();\r\n            var e = rendElemLineMap.GetEnumerator();\r\n            while (e.MoveNext())\r\n            {\r\n                lineKeyList.Add(-1 * e.Current.Key);\r\n            }\r\n            lineKeyList.Sort();\r\n            len = lineKeyList.Count;\r\n\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                int posY = -1 * lineKeyList[i];\r\n                string lineString = \"\";\r\n                LRenderElement _lastEleme = rendElemLineMap[posY][0];\r\n                LRenderElement _lastDiffStartEleme = rendElemLineMap[posY][0];\r\n                if (rendElemLineMap[posY].Count > 0)\r\n                {\r\n                    List<LRenderElement> lineElemArr = new List<LRenderElement>();\r\n\r\n                    int _len2 = rendElemLineMap[posY].Count;\r\n                    for (int _i = 0; _i < _len2; _i++)\r\n                    {\r\n                        LRenderElement elem = rendElemLineMap[posY][_i];\r\n                        if (_lastEleme.type == RichType.TEXT && elem.type == RichType.TEXT)\r\n                        {\r\n\t\t\t\t\t\t\tif (_lastEleme.isSameStyle(elem))\r\n                            {\r\n\t\t\t\t\t\t\t\t// the same style can mergin one element\r\n                                lineString += elem.strChar;\r\n                            }\r\n                            else // diff style\r\n                            {\r\n                                if (_lastDiffStartEleme.type == RichType.TEXT)\r\n                                {\r\n                                    LRenderElement _newElem = _lastDiffStartEleme.Clone();\r\n                                    _newElem.strChar = lineString;\r\n                                    lineElemArr.Add(_newElem);\r\n\r\n                                    _lastDiffStartEleme = elem;\r\n                                    lineString = elem.strChar;\r\n                                }\r\n                            }\r\n                        }\r\n                        else if (elem.type == RichType.IMAGE || elem.type == RichType.ANIM || elem.type == RichType.NEWLINE)\r\n                        {\r\n                            //interrupt\r\n                            if (_lastDiffStartEleme.type == RichType.TEXT)\r\n                            {\r\n                                LRenderElement _newEleme = _lastDiffStartEleme.Clone();\r\n                                _newEleme.strChar = lineString;\r\n                                lineString = \"\";\r\n                                lineElemArr.Add(_newEleme);\r\n                            }\r\n                            lineElemArr.Add(elem);\r\n\r\n                        }\r\n                        else if (_lastEleme.type != RichType.TEXT)\r\n                        {\r\n                            //interrupt\r\n                            _lastDiffStartEleme = elem;\r\n                            if (elem.type == RichType.TEXT)\r\n                            {\r\n                                lineString = elem.strChar;\r\n                            }\r\n                        }\r\n                        _lastEleme = elem;\r\n                    }\r\n                    // the last elementText\r\n                    if (_lastDiffStartEleme.type == RichType.TEXT)\r\n                    {\r\n                        LRenderElement _newElem = _lastDiffStartEleme.Clone();\r\n                        _newElem.strChar = lineString;\r\n                        lineElemArr.Add(_newElem);\r\n                    }\r\n                    rendLineArrs.Add(lineElemArr);\r\n                }\r\n            }\r\n\r\n            // offset position\r\n            int _offsetLineY = 0;\r\n            realLineHeight = 0;\r\n            len = rendLineArrs.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                List<LRenderElement> _lines = rendLineArrs[i];\r\n                int _lineHeight = 0;\r\n                int _len3 = _lines.Count;\r\n                for (int _i=0;_i< _len3; _i++)\r\n                {\r\n                    _lineHeight = Mathf.Max(this.verticalSpace,Mathf.Max(_lineHeight, _lines[_i].height));\r\n                }\r\n\r\n                realLineHeight += _lineHeight;\r\n                _offsetLineY += (_lineHeight - 27);\r\n\r\n                for (int j = 0; j < _len3; j++)\r\n                {\r\n                    LRenderElement elem = _lines[j];\r\n                    elem.pos = new Vector2(elem.pos.x, elem.pos.y - _offsetLineY);\r\n                    realLineHeight = Mathf.Max(realLineHeight, (int)Mathf.Abs(elem.pos.y));\r\n                    _lines[j] = elem;\r\n                }\r\n                rendLineArrs[i] = _lines;\r\n            }\r\n\r\n            // place all position\r\n            realLineWidth = 0;\r\n            GameObject obj = null;\r\n            int _len = rendLineArrs.Count;\r\n            for (int i = 0; i < _len; i++)\r\n            {\r\n                int _lineWidth = 0;\r\n                int _leng = rendLineArrs[i].Count;\r\n                for (int j = 0; j < _leng; j++)\r\n                {\r\n                    LRenderElement elem = rendLineArrs[i][j];\r\n                    if (elem.type != RichType.NEWLINE)\r\n                    {\r\n                        if (elem.type == RichType.TEXT)\r\n                        {\r\n                            obj = getCacheLabel();\r\n                            makeLabel(obj, elem);\r\n                            _lineWidth += (int)obj.GetComponent<Text>().preferredWidth;\r\n                        }\r\n                        else if (elem.type == RichType.IMAGE)\r\n                        {\r\n                            obj = getCacheImage(true);\r\n                            makeImage(obj, elem);\r\n                            _lineWidth += (int)obj.GetComponent<Image>().preferredWidth;\r\n                        }\r\n                        else if (elem.type == RichType.ANIM)\r\n                        {\r\n                            obj = getCacheFramAnim();\r\n                            makeFramAnim(obj, elem);\r\n                            _lineWidth += elem.width;\r\n                        }\r\n                        obj.SetActive(true);\r\n                        obj.transform.SetParent(transform);\r\n                        obj.transform.localPosition = new Vector2(elem.pos.x, elem.pos.y /*+ realLineHeight*/);\r\n                        obj.transform.localScale = new Vector3(1, 1,1);\r\n                        _objectDataMap[obj] = elem.data;\r\n                    }\r\n                }\r\n                realLineWidth = Mathf.Max(_lineWidth, realLineWidth);\r\n            }\r\n\r\n            RectTransform rtran = this.GetComponent<RectTransform>();\r\n            //align\r\n            if (alignType == RichAlignType.DESIGN_CENTER)\r\n            {\r\n                rtran.sizeDelta = new Vector2(maxLineWidth, realLineHeight);\r\n\r\n            }\r\n            else if (alignType == RichAlignType.LEFT_TOP)\r\n            {\r\n                rtran.sizeDelta = new Vector2(realLineWidth, realLineHeight);\r\n            }\r\n        }\r\n\r\n        void makeLabel(GameObject lab, LRenderElement elem)\r\n        {\r\n            Text comText = lab.GetComponent<Text>();\r\n            if (comText != null)\r\n            {\r\n                comText.text = elem.strChar;\r\n                comText.font = elem.font;\r\n                comText.fontSize = elem.fontSize;\r\n                comText.fontStyle = FontStyle.Normal;\r\n                comText.color = elem.color;\r\n                comText.lineSpacing = 0;\r\n                comText.raycastTarget = this.raycastTarget;\r\n            }\r\n\r\n            Outline outline = lab.GetComponent<Outline>();\r\n            if (elem.isOutLine)\r\n            {\r\n                if (outline == null)\r\n                {\r\n                    outline = lab.AddComponent<Outline>();\r\n                    outline.effectColor = elem.outLineColor;\r\n                }\r\n            }\r\n            else {\r\n                if (outline)\r\n                {\r\n                    Destroy(outline);\r\n                }\r\n            }\r\n\r\n            if (elem.isUnderLine)\r\n            {\r\n                GameObject underLine = getCacheImage(false);\r\n                Image underImg = underLine.GetComponent<Image>();\r\n                underImg.color = elem.color;\r\n                underImg.GetComponent<RectTransform>().sizeDelta = new Vector2(comText.preferredWidth, 1);\r\n                underLine.SetActive(true);\r\n                underLine.transform.SetParent(transform);\r\n                underLine.transform.localScale = new Vector3(1, 1,1);\r\n                underLine.transform.localPosition = new Vector2(elem.pos.x, elem.pos.y);\r\n                comText.raycastTarget = true;\r\n            }\r\n        }\r\n\r\n        void makeImage(GameObject img, LRenderElement elem)\r\n        {\r\n            Image comImage = img.GetComponent<Image>();\r\n            if (comImage != null)\r\n            {\r\n\t\t\t\tstring atlas = System.IO.Path.GetDirectoryName(elem.path);\r\n\t\t\t\tstring spname = System.IO.Path.GetFileName(elem.path);\r\n                Sprite sp = LLoadBundle.GetInstance().GetSpriteByName(atlas, spname);\r\n                comImage.sprite = sp;\r\n                comImage.raycastTarget = this.raycastTarget;\r\n            }\r\n        }\r\n\r\n        void makeFramAnim(GameObject anim, LRenderElement elem)\r\n        {\r\n            LMovieClip comFram = anim.GetComponent<LMovieClip>();\r\n            if (comFram != null)\r\n            {\r\n                comFram.path = elem.path;\r\n                comFram.fps = elem.fs;\r\n                comFram.loadTexture();\r\n                comFram.play();\r\n                comFram.GetComponent<Image>().raycastTarget = this.raycastTarget;\r\n            }\r\n        }\r\n\r\n        protected GameObject getCacheLabel()\r\n        {\r\n            GameObject ret = null;\r\n            int len = _cacheLabElements.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                LRichCacheElement cacheElem = _cacheLabElements[i];\r\n                if (cacheElem.isUse == false)\r\n                {\r\n                    cacheElem.isUse = true;\r\n                    ret = cacheElem.node;\r\n                    break;\r\n                }\r\n            }\r\n            if (ret == null)\r\n            {\r\n                ret = new GameObject();\r\n                ret.AddComponent<Text>();\r\n                ContentSizeFitter fit = ret.AddComponent<ContentSizeFitter>();\r\n                fit.verticalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n                fit.horizontalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n\r\n                RectTransform rtran = ret.GetComponent<RectTransform>();\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = new Vector2(0, 1);\r\n                rtran.anchorMin = new Vector2(0, 1);\r\n\r\n                LRichCacheElement cacheElem = new LRichCacheElement(ret);\r\n                cacheElem.isUse = true;\r\n                _cacheLabElements.Add(cacheElem);\r\n            }\r\n            return ret;\r\n        }\r\n\r\n        protected GameObject getCacheImage(bool isFitSize)\r\n        {\r\n            GameObject ret = null;\r\n            int len = _cacheImgElements.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                LRichCacheElement cacheElem = _cacheImgElements[i];\r\n                if (cacheElem.isUse == false)\r\n                {\r\n                    cacheElem.isUse = true;\r\n                    ret = cacheElem.node;\r\n                    break;\r\n                }\r\n            }\r\n            if (ret == null)\r\n            {\r\n                ret = new GameObject();\r\n                ret.AddComponent<Image>();\r\n                ContentSizeFitter fit = ret.AddComponent<ContentSizeFitter>();\r\n                fit.verticalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n                fit.horizontalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n\r\n                RectTransform rtran = ret.GetComponent<RectTransform>();\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = new Vector2(0, 1);\r\n                rtran.anchorMin = new Vector2(0, 1);\r\n\r\n                LRichCacheElement cacheElem = new LRichCacheElement(ret);\r\n                cacheElem.isUse = true;\r\n                _cacheImgElements.Add(cacheElem);\r\n            }\r\n            ContentSizeFitter fitCom = ret.GetComponent<ContentSizeFitter>();\r\n            fitCom.enabled = isFitSize;\r\n            return ret;\r\n        }\r\n\r\n        protected GameObject getCacheFramAnim()\r\n        {\r\n            GameObject ret = null;\r\n            int len = _cacheFramAnimElements.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                LRichCacheElement cacheElem = _cacheFramAnimElements[i];\r\n                if (cacheElem.isUse == false)\r\n                {\r\n                    cacheElem.isUse = true;\r\n                    ret = cacheElem.node;\r\n                    break;\r\n                }\r\n            }\r\n            if (ret == null)\r\n            {\r\n                ret = new GameObject();\r\n                ret.AddComponent<Image>();\r\n                ContentSizeFitter fit = ret.AddComponent<ContentSizeFitter>();\r\n                fit.verticalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n                fit.horizontalFit = ContentSizeFitter.FitMode.PreferredSize;\r\n\r\n                RectTransform rtran = ret.GetComponent<RectTransform>();\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = new Vector2(0, 1);\r\n                rtran.anchorMin = new Vector2(0, 1);\r\n\r\n                ret.AddComponent<LMovieClip>();\r\n\r\n                LRichCacheElement cacheElem = new LRichCacheElement(ret);\r\n                cacheElem.isUse = true;\r\n                _cacheFramAnimElements.Add(cacheElem);\r\n            }\r\n            return ret;\r\n        }\r\n\r\n        protected bool isChinese(string text)\r\n        {\r\n            bool hasChinese = false;\r\n            // char[] c = text.ToCharArray();\r\n            // int len = c.Length;\r\n            // for (int i = 0; i < len; i++)\r\n            // {\r\n            //     if (c[i] >= 0x4e00 && c[i] <= 0x9fbb)\r\n            //     {\r\n            //         hasChinese = true;\r\n            //         break;\r\n            //     }\r\n            // }\r\n            for(int i=0;i<text.Length;i++)\r\n            {\r\n                if((int)text[i] > 127)\r\n                    hasChinese = true;\r\n            }\r\n            return hasChinese;\r\n        }\r\n\r\n        public void OnPointerClick(PointerEventData data)\r\n        {\r\n            if (_objectDataMap.ContainsKey(data.pointerEnter))\r\n            {\r\n                if ((onClickHandler != null) && (_objectDataMap[data.pointerEnter] != \"\"))\r\n                {\r\n                    onClickHandler.Invoke(_objectDataMap[data.pointerEnter]);\r\n                }\r\n            }\r\n        }\r\n//---------------------parse rich element content from string----------------------------------------\r\n        private string[] SaftSplite(string content, char separater)\r\n        {\r\n            List<string> arr = new List<string>();\r\n            char[] charArr = content.ToCharArray();\r\n            bool strFlag = false;\r\n            List<char> line = new List<char>();\r\n            for (int i =0;i< charArr.Length; i++)\r\n            {\r\n                if((charArr[i] == '\"') && (charArr[i-1] != '\\\\')) //string start\r\n                {\r\n                    strFlag = !strFlag;\r\n                }\r\n                if(charArr[i] == separater)\r\n                {\r\n                    if (!strFlag)\r\n                    {\r\n                        arr.Add(new string(line.ToArray()));\r\n                        line.Clear();\r\n                    }\r\n                    else\r\n                    {\r\n                        line.Add(charArr[i]);\r\n                    }\r\n                }\r\n                else\r\n                {\r\n                    line.Add(charArr[i]);\r\n                }\r\n            }\r\n            if(line.Count > 0)\r\n            {\r\n                arr.Add(new string(line.ToArray()));\r\n            }\r\n            return arr.ToArray();\r\n        }\r\n\r\n        public void parseRichElemString(string content, UnityAction<string, Dictionary<string, string>> handleFunc)\r\n        {\r\n            List<string> elemStrs = new List<string>();\r\n\r\n            int startIndex = 0;\r\n            elemStrs = executeParseRichElem(elemStrs, content, startIndex);\r\n\r\n            int len = elemStrs.Count;\r\n            for (int i = 0; i < len; i++)\r\n            {\r\n                string flag = elemStrs[i].Substring(0, elemStrs[i].IndexOf(\" \"));\r\n                string paramStr = elemStrs[i].Substring(elemStrs[i].IndexOf(\" \") + 1);\r\n                string[] paramArr = SaftSplite(paramStr,' ');\r\n\r\n                Dictionary<string, string> param = new Dictionary<string, string>();\r\n                int paramArrLen = paramArr.Length;\r\n                for (int j = 0; j < paramArrLen; j++)\r\n                {\r\n                    string[] paramObj = SaftSplite(paramArr[j], '=');\r\n                    string left = paramObj[0].Trim();\r\n                    string right = paramObj[1].Trim();\r\n\r\n                    if (right.EndsWith(\"\\\"\") && right.StartsWith(\"\\\"\"))\r\n                    {\r\n                        param.Add(left, right.Trim('\"'));\r\n                    }\r\n                    else\r\n                    {\r\n                        param.Add(left, right);\r\n                    }\r\n                }\r\n                handleFunc.Invoke(flag, param);\r\n            }\r\n        }\r\n\r\n        private List<string> executeParseRichElem(List<string> result, string content, int startIndex)\r\n        {\r\n            bool hasMatch = false;\r\n            int matchIndex = content.IndexOf(\"<\", startIndex);\r\n            if (matchIndex != -1)\r\n            {\r\n                result.Add(string.Format(\"lab txt=\\\"{0}\\\"\", content.Substring(startIndex, matchIndex - startIndex))); //match head\r\n                startIndex = matchIndex;\r\n\r\n                matchIndex = content.IndexOf(\"/>\", startIndex);\r\n                if (matchIndex != -1)\r\n                {\r\n                    hasMatch = true;\r\n                    result.Add(content.Substring(startIndex + 1, matchIndex - (startIndex + 1))); //match tail\r\n                    startIndex = matchIndex + 2;\r\n                }\r\n            }\r\n\r\n            if (hasMatch)\r\n            {\r\n                return executeParseRichElem(result, content, startIndex);\r\n            }\r\n            else\r\n            {\r\n                result.Add(string.Format(\"lab txt=\\\"{0}\\\"\", content.Substring(startIndex, content.Length - startIndex)));\r\n                return result;\r\n            }\r\n        }\r\n\r\n        public void parseRichDefaultString(string content, UnityAction<string, Dictionary<string, string>> specHandleFunc=null)\r\n        {\r\n            parseRichElemString(content, (flag, param) =>\r\n            {\r\n                if (flag == \"lab\")\r\n                {\r\n                    this.insertElement(\r\n                        param.ContainsKey(\"txt\") ? param[\"txt\"] : \"\",\r\n                        LUtil.StringToColor(param.ContainsKey(\"color\") ? param[\"color\"] : defaultLabColor),\r\n                        param.ContainsKey(\"size\") ? System.Convert.ToInt32(param[\"size\"]) : defaultLabSize,\r\n                        param.ContainsKey(\"isUnderLine\") ? System.Convert.ToBoolean(param[\"isUnderLine\"]) : false,\r\n                        param.ContainsKey(\"isOutLine\") ? System.Convert.ToBoolean(param[\"isOutLine\"]) : false,\r\n                        LUtil.StringToColor(param.ContainsKey(\"outLineColor\") ? param[\"outLineColor\"] : \"#000000\"),\r\n                        param.ContainsKey(\"data\") ? param[\"data\"] : \"\"\r\n                        );\r\n                }else if(flag == \"img\")\r\n                {\r\n                    this.insertElement(\r\n                         param.ContainsKey(\"path\") ? param[\"path\"] : \"\",\r\n                         param.ContainsKey(\"data\") ? param[\"data\"] : \"\");\r\n                }else if(flag == \"anim\")\r\n                {\r\n                    this.insertElement(param[\"path\"],\r\n                         param.ContainsKey(\"fps\") ? System.Convert.ToSingle(param[\"fps\"]) : 15f,\r\n                         param.ContainsKey(\"data\") ? param[\"data\"] : \"\");\r\n                }else if(flag == \"newline\")\r\n                {\r\n                    this.insertElement(1);\r\n                }\r\n                else\r\n                {\r\n                    if(specHandleFunc != null) specHandleFunc.Invoke(flag, param);\r\n                }\r\n            });\r\n            this.reloadData();\r\n        }\r\n    }\r\n\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LRichText.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 563e79a78667cb84eb5293cae3069236\ntimeCreated: 1449631255\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LScrollView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    public enum ScrollDirection\r\n    {\r\n        HORIZONTAL,\r\n        VERTICAL,\r\n        BOTH\r\n    }\r\n    /// <summary>\r\n    /// 滑块\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n\tpublic class LScrollView : MonoBehaviour, IBeginDragHandler, IDragHandler , IEndDragHandler\r\n    {\r\n        public static int INVALID_INDEX = -1;\r\n        public static float RELOCATE_DURATION = 0.2f;\r\n        public static float AUTO_RELOCATE_SPPED = 100.0f;\r\n        public static float INERTANCE_SPEED = 0.96f;\r\n\t\tpublic static float RESISTANCE_SPEED = 0.8f;\r\n        protected float autoRelocateSpeed;\r\n        \r\n        public bool bounceable;\r\n        protected GameObject container;\r\n        public ScrollDirection direction;\r\n        private Vector2 lastMovePoint;\r\n        private Vector2 maxOffset;\r\n        private Vector2 minOffset;\r\n        protected Vector2 scrollDistance;\r\n        public bool dragable;\r\n        private bool _isPicking;\r\n        public bool pickEnable;\r\n\t\tpublic bool inertanceEnable;\r\n\t\tprivate float _scrollPerc;\r\n\t\tprivate bool _isInertanceFinish;\r\n\t\tprivate bool _isDraging;\r\n\t\tprivate bool _hasDragBegin;\r\n        [HideInInspector]\r\n        public GameObject curPickObj;\r\n\r\n        public delegate T0 LDataSourceAdapter<T0, T1>(T0 arg0, T1 arg1);\r\n        public UnityAction onMoveCompleteHandler;\r\n        public UnityAction<float> onScrollingHandler;\r\n        public UnityAction onScrollBeginHandler;\r\n        public UnityAction onDraggingScrollEndedHandler;\r\n        public UnityAction<GameObject> onPickBeginHandler;\r\n        public UnityAction<Vector3> onPickIngHandler;\r\n        public UnityAction<GameObject> onPickEndHandler;\r\n\r\n        public LScrollView()\r\n        {\r\n            autoRelocateSpeed = AUTO_RELOCATE_SPPED;\r\n            direction = ScrollDirection.BOTH;\r\n            lastMovePoint = Vector2.zero;\r\n            bounceable = true;\r\n            scrollDistance = Vector2.zero;\r\n            dragable = true;\r\n            maxOffset = Vector2.zero;\r\n            minOffset = Vector2.zero;\r\n        }\r\n\r\n        void Awake()\r\n        {\r\n            container = transform.Find(\"container\").gameObject;\r\n\r\n            updateLimitOffset();\r\n\r\n            RectTransform rtran = container.GetComponent<RectTransform>();\r\n            rtran.pivot = Vector2.zero;\r\n            rtran.anchorMax = Vector2.zero;\r\n            rtran.anchorMin = Vector2.zero;\r\n\r\n            rtran = GetComponent<RectTransform>();\r\n            rtran.pivot = Vector2.zero;\r\n            rtran.anchorMax = Vector2.zero;\r\n            rtran.anchorMin = Vector2.zero;\r\n        }\r\n\r\n        public void setContainerSize(Vector2 size)\r\n        {\r\n            Vector2 cs = GetComponent<RectTransform>().rect.size;\r\n            int width = Mathf.Max((int)cs.x, (int)size.x);\r\n            int height = Mathf.Max((int)cs.y, (int)size.y);\r\n\r\n            container.GetComponent<RectTransform>().sizeDelta = new Vector2(width, height);\r\n            updateLimitOffset();\r\n        }\r\n\r\n        protected void updateLimitOffset()\r\n        {\r\n            Vector2 size = GetComponent<RectTransform>().rect.size;\r\n            Vector2 innSize = container.GetComponent<RectTransform>().rect.size;\r\n            maxOffset.x = 0;\r\n            minOffset.x = size.x - innSize.x;\r\n\r\n            maxOffset.y = 0;\r\n            minOffset.y = size.y - innSize.y;\r\n\r\n            if (direction == ScrollDirection.HORIZONTAL)\r\n            {\r\n                minOffset.y = 0;\r\n            }else if (direction == ScrollDirection.VERTICAL)\r\n            {\r\n                minOffset.x = 0;\r\n            }\r\n        }\r\n\t\t\r\n\t\tpublic void Update()\r\n        {\r\n\t\t\tif (_hasDragBegin == false)\r\n\t\t\t\treturn;\r\n\t\t\tif (_isDraging) return;\r\n            if (inertanceEnable)\r\n            {\r\n                Vector2 offset = getContentOffset() + scrollDistance;\r\n                if (validateOffset(ref offset)){\r\n\t\t\t\t\tif (Mathf.Abs (scrollDistance.x) >= 1f || Mathf.Abs (scrollDistance.y) >= 1f) {\r\n\t\t\t\t\t\tscrollDistance *= RESISTANCE_SPEED;\r\n\t\t\t\t\t\tsetContentOffsetWithoutCheck (getContentOffset () + scrollDistance);\r\n\r\n\t\t\t\t\t\t_isInertanceFinish = false;\r\n\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (!_isInertanceFinish) {\r\n\t\t\t\t\t\t\t_isInertanceFinish = true;\r\n\r\n\t\t\t\t\t\t\trelocateContainerWithoutCheck(offset);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}else{\r\n\t\t\t\t\tif (Mathf.Abs (scrollDistance.x) >= 1f || Mathf.Abs (scrollDistance.y) >= 1f) {\r\n\t\t\t\t\t\tscrollDistance *= INERTANCE_SPEED;\r\n\t\t\t\t\t\tsetContentOffsetWithoutCheck (getContentOffset () + scrollDistance);\r\n\r\n\t\t\t\t\t\t_isInertanceFinish = false;\r\n\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (!_isInertanceFinish) {\r\n\t\t\t\t\t\t\t_isInertanceFinish = true;\r\n\r\n\t\t\t\t\t\t\tonDraggingScrollEnded ();\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n            }\r\n        }\r\n\t\t\t\r\n\t\t\r\n\t\tpublic void OnBeginDrag(PointerEventData eventData)\r\n        {\r\n            if(_isDraging) return;\r\n\t\t\t_hasDragBegin = true;\r\n\r\n            Vector2 point = transform.InverseTransformPoint(eventData.position);\r\n            if (dragable)\r\n            {\r\n                lastMovePoint = point;\r\n\r\n\t\t\t\tscrollDistance = Vector2.zero;\r\n\t\t\t\t_isDraging = true;\r\n                LeanTween.cancel(container);\r\n                \r\n                onScrollBegin();\r\n                onScrolling();\r\n            }\r\n\r\n            if (pickEnable)\r\n            {\r\n                _isPicking = false;\r\n            }\r\n        }\r\n\r\n        \r\n        public void OnDrag(PointerEventData eventData)\r\n        {\r\n            if (pickEnable && _isPicking)\r\n            {\r\n                if (onPickIngHandler != null)\r\n                    onPickIngHandler.Invoke(eventData.position);\r\n                return;\r\n            }\r\n                \r\n            Vector2 point = transform.InverseTransformPoint(eventData.position);\r\n            if (dragable)\r\n            {\r\n                scrollDistance = point - lastMovePoint;\r\n                lastMovePoint = point;\r\n\r\n                if(pickEnable && (Mathf.Abs(scrollDistance.y) > Mathf.Abs(scrollDistance.x)))\r\n                {\r\n                    _isPicking = true;\r\n                    if (onPickBeginHandler != null)\r\n                    {\r\n                        onPickBeginHandler.Invoke(curPickObj);\r\n                    }\r\n                    return;\r\n                }\r\n\r\n                switch (direction)\r\n                {\r\n                    case ScrollDirection.HORIZONTAL:\r\n                        scrollDistance.y = 0;\r\n                        break;\r\n                    case ScrollDirection.VERTICAL:\r\n                        scrollDistance.x = 0;\r\n                        break;\r\n                    default:\r\n                        break;\r\n                }\r\n\r\n\t\t\t\tVector2 vec = getContentOffset () + scrollDistance;\r\n\t\t\t\tif (validateOffset (ref vec)) {\r\n\t\t\t\t\tif (direction == ScrollDirection.VERTICAL) {\r\n\t\t\t\t\t\tscrollDistance.y *= 0.2f;\r\n\t\t\t\t\t} else if (direction == ScrollDirection.HORIZONTAL) {\r\n\t\t\t\t\t\tscrollDistance.x *= 0.2f;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n                setContentOffsetWithoutCheck(getContentOffset() + scrollDistance);\r\n            }\r\n        }\r\n\r\n        \r\n\t\tpublic void OnEndDrag(PointerEventData eventData)\r\n        {\r\n            if (dragable)\r\n            {\r\n\t\t\t\t_isDraging = false;\r\n\r\n                Vector2 offset = getContentOffset();\r\n                if (validateOffset(ref offset))\r\n                {\r\n                    relocateContainerWithoutCheck(offset);\r\n                }\r\n                else\r\n                {\r\n\t\t\t\t\tif(!inertanceEnable)\r\n                    \tonDraggingScrollEnded();\r\n                }\r\n            }\r\n\r\n            if (pickEnable)\r\n            {\r\n                _isPicking = false;\r\n\r\n                if (onPickEndHandler != null)\r\n                    onPickEndHandler.Invoke(curPickObj);\r\n\r\n                curPickObj = null;\r\n            }\r\n        }\r\n\r\n        protected void relocateContainerWithoutCheck(Vector2 offset)\r\n        {\r\n            setContentOffsetEaseInWithoutCheck(offset, RELOCATE_DURATION);\r\n        }\r\n\r\n        protected void relocateContainer()\r\n        {\r\n            Vector2 offset = getContentOffset();\r\n            if (validateOffset(ref offset))\r\n            {\r\n                setContentOffsetEaseInWithoutCheck(offset, RELOCATE_DURATION);\r\n            }\r\n        }\r\n\r\n        protected void setContentOffsetEaseInWithoutCheck(Vector2 offset, float duration)\r\n        {\r\n            LeanTween.cancel(container);\r\n            LeanTween.moveLocal(container, offset, duration)\r\n                .setEase(LeanTweenType.easeInQuad)\r\n                .setOnUpdate((float val) => { onScrolling(); })\r\n                .setOnComplete(onMoveComplete);\r\n                \r\n            onScrolling();\r\n        }\r\n\r\n        protected void setContentOffsetEaseIn(Vector2 offset, float duration, float rate)\r\n        {\r\n            validateOffset(ref offset);\r\n            \r\n            setContentOffsetEaseInWithoutCheck(offset, duration);\r\n        }\r\n\r\n        public void setContentOffset(Vector2 offset)\r\n        {\r\n\t\t\tvalidateOffset (ref offset);\r\n\r\n            container.transform.localPosition = offset;\r\n\t\t\tonScrolling();\r\n        }\r\n\r\n        public void setContentOffsetWithoutCheck(Vector2 offset)\r\n        {\r\n            container.transform.localPosition = offset;\r\n            onScrolling();\r\n        }\r\n\r\n        public void setContentOffsetToTop()\r\n        {\r\n            if (direction == ScrollDirection.VERTICAL)\r\n            {\r\n                Vector2 point = new Vector2(0, -(container.GetComponent<RectTransform>().rect.height - GetComponent<RectTransform>().rect.height));\r\n                setContentOffset(point);\r\n            }\r\n        }\r\n\r\n        public void setContentOffsetToBottom()\r\n        {\r\n            if (direction == ScrollDirection.VERTICAL)\r\n            {\r\n                setContentOffset(maxOffset);\r\n            }\r\n        }\r\n\r\n        public void setContentOffsetToRight()\r\n        {\r\n\t        if( direction == ScrollDirection.HORIZONTAL )\r\n\t        {\r\n\t\t        setContentOffset(minOffset);\r\n\t        }\r\n        }\r\n\r\n        public void setContentOffsetToLeft()\r\n        {\r\n            if (direction == ScrollDirection.HORIZONTAL )\r\n\t        {\r\n\t\t        setContentOffset(maxOffset);\r\n\t        }\r\n        }\r\n\r\n        public void setContentOffsetInDuration(Vector2 offset, float duration)\r\n        {\r\n            if (bounceable)\r\n            {\r\n                validateOffset(ref offset);\r\n            }\r\n            setContentOffsetInDurationWithoutCheck(offset, duration);\r\n        }\r\n\r\n        public void setContentOffsetInDurationWithoutCheck(Vector2 offset, float duration)\r\n        {\r\n\t\t\tLeanTween.cancel (container);\r\n            LeanTween.moveLocal(container, offset, duration)\r\n                .setOnUpdate((float val) => { onScrolling(); })\r\n                .setOnComplete(onMoveComplete);\r\n            \r\n            onScrolling();\r\n        }\r\n\r\n        protected bool validateOffset(ref Vector2 point)\r\n        {\r\n            float x = point.x, y = point.y;\r\n            x = Mathf.Max(x, minOffset.x);\r\n            x = Mathf.Min(x, maxOffset.x);\r\n            y = Mathf.Max(y, minOffset.y);\r\n            y = Mathf.Min(y, maxOffset.y);\r\n\r\n            if (point.x != x || point.y != y)\r\n            {\r\n                point.x = x;\r\n                point.y = y;\r\n                return true;\r\n            }\r\n\r\n            point.x = x;\r\n            point.y = y;\r\n            return false;\r\n        }\r\n\r\n\t\tprotected bool validateOffsetBounce(Vector2 point)\r\n\t\t{\r\n\t\t\tfloat ratio = Screen.height / 720.0f;\r\n\t\t\tfloat x = point.x, y = point.y;\r\n\t\t\tx = Mathf.Max(x, minOffset.x - 100 * ratio);\r\n\t\t\tx = Mathf.Min(x, maxOffset.x + 100 * ratio);\r\n\t\t\ty = Mathf.Max(y, minOffset.y - 100 * ratio);\r\n\t\t\ty = Mathf.Min(y, maxOffset.y + 100 * ratio);\r\n\r\n\t\t\tif (point.x != x || point.y != y)\r\n\t\t\t{\r\n\t\t\t\t//point.x = x;\r\n\t\t\t\t//point.y = y;\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\r\n\t\t\t//point.x = x;\r\n\t\t\t//point.y = y;\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n        public Vector2 getContentOffset()\r\n        {\r\n            return container.transform.localPosition;\r\n        }\r\n\r\n        protected void onMoveComplete()\r\n        {\r\n            if (onMoveCompleteHandler != null)\r\n            {\r\n                onMoveCompleteHandler.Invoke();\r\n            }\r\n        }\r\n\r\n        protected virtual void onScrolling()\r\n\t\t{\r\n\t\t\tthis._scrollPerc = 0.0f;\r\n\t\t\tif (direction == ScrollDirection.HORIZONTAL) {\r\n\t\t\t\tfloat width = this.GetComponent<RectTransform>().rect.width;\r\n                float containerWidth = container.GetComponent<RectTransform> ().rect.width;\r\n\t\t\t\tthis._scrollPerc = containerWidth - width == 0 ? 0 : -container.transform.localPosition.y / (containerWidth - width);\r\n\r\n\t\t\t} else if(direction == ScrollDirection.VERTICAL) {\r\n\t\t\t\t\r\n                float height = this.GetComponent<RectTransform>().rect.height;\r\n                float containerHeight = container.GetComponent<RectTransform> ().rect.height;\r\n\t\t\t\tthis._scrollPerc = containerHeight - height == 0 ? 0 : -container.transform.localPosition.y / (containerHeight - height);\r\n\t\t\t}\r\n\t\t\tif (onScrollingHandler!=null)\r\n\t\t\t\tonScrollingHandler.Invoke (this._scrollPerc);\r\n        }\r\n\r\n        protected virtual void onScrollBegin()\r\n        {\r\n            if (onScrollBeginHandler !=null)\r\n            {\r\n                onScrollBeginHandler.Invoke();\r\n            }\r\n        }\r\n\r\n        protected virtual void onDraggingScrollEnded()\r\n        {\r\n            if (onDraggingScrollEndedHandler!=null)\r\n            {\r\n                onDraggingScrollEndedHandler.Invoke();\r\n            }\r\n        }\r\n\r\n    }\r\n\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LScrollView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 0cb3196efe477284198d818640d5b48b\ntimeCreated: 1450443473\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LSlider.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\nCreated by Lingjijian on 2015\r\n342854406@qq.com\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    [SLua.CustomLuaClass]\r\n    public class LSlider : LProgress, IDragHandler,IPointerDownHandler,IPointerUpHandler\r\n    {\r\n\r\n        public Image block;\r\n        \r\n        public UnityAction<PointerEventData> onPointerDownHandle;\r\n        public UnityAction<PointerEventData> onPointerUpHandle;\r\n        public UnityAction onValueChangeHandle;\r\n\r\n        void Start()\r\n        {\r\n            _width = GetComponent<RectTransform>().rect.width;\r\n            _height = GetComponent<RectTransform>().rect.height;\r\n        }\r\n\r\n        public void OnDrag(PointerEventData eventData)\r\n        {\r\n            Vector3 point = validSlidePoint(transform.InverseTransformPoint(eventData.position));\r\n\r\n            if (onProgress != null)\r\n                onProgress.Invoke();\r\n\r\n            setValue((point.x + _width / 2) / _width * maxValue);\r\n        }\r\n\r\n        public void OnPointerDown(PointerEventData data)\r\n        {\r\n            if (onPointerDownHandle != null)\r\n            {\r\n                onPointerDownHandle.Invoke(data);\r\n            }\r\n        }\r\n\r\n        public void OnPointerUp(PointerEventData data)\r\n        {\r\n            if (onPointerUpHandle != null)\r\n            {\r\n                onPointerUpHandle.Invoke(data);\r\n            }\r\n        }\r\n\r\n        private Vector3 validSlidePoint(Vector2 point)\r\n        {\r\n            return new Vector3(Mathf.Max(-_width / 2, Mathf.Min(_width / 2, point.x)), 0.0f, 0.0f);\r\n        }\r\n\r\n        public void setValue(float value)\r\n        {\r\n            base.setValue(value);\r\n            block.transform.localPosition = validSlidePoint(new Vector2(-_width/2 + _width * getPercentage(),0));\r\n\r\n            if(onValueChangeHandle!=null)\r\n                onValueChangeHandle.Invoke();\r\n        }\r\n    }\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LSlider.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c998e5ceaf875bd43967105ba68a8285\ntimeCreated: 1479796445\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LSwitch.cs",
    "content": "﻿/****************************************************************************\nCopyright (c) 2015 Lingjijian\n\nCreated by Lingjijian on 2015\n\n342854406@qq.com\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n****************************************************************************/\nusing UnityEngine;\nusing UnityEngine.Events;\nusing UnityEngine.EventSystems;\nusing UnityEngine.UI;\n\nnamespace Lui\n{\n\t[SLua.CustomLuaClass]\n\tpublic class LSwitch : MonoBehaviour,IPointerDownHandler, IPointerUpHandler, IDragHandler {\n\n\t\tpublic GameObject bar;\n\t\tprivate Vector2 _p1;\n\t\tprivate Vector2 _p2;\n\t\tprivate bool _value;\n\t\tprivate Vector2 _lastPoint;\n\t\tpublic UnityAction<bool> onValueHandler;\n\n\t\tvoid Start()\n\t\t{\n\t\t\t_p1 = bar.transform.localPosition;\n\t\t\t_p2 = new Vector2 (-_p1.x, _p1.y);\n\t\t}\n\n\t\t[SLua.DoNotToLua]\n\t\tpublic void OnPointerDown(PointerEventData eventData)\n\t\t{\n\t\t\t_lastPoint = eventData.position;\n\t\t}\n\n\t\t[SLua.DoNotToLua]\n\t\tpublic void OnPointerUp(PointerEventData eventData)\n\t\t{\n\t\t\tLeanTween.cancel (bar);\n\t\t\tif (bar.transform.localPosition.x <= 0) {\n\t\t\t\tLeanTween.moveLocalX (bar, _p1.x, 0.1f).setOnComplete(()=>{\n\t\t\t\t\t_value = false;\n\t\t\t\t\tif(onValueHandler!=null) onValueHandler.Invoke(_value);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tLeanTween.moveLocalX (bar, _p2.x, 0.1f).setOnComplete(()=>{\n\t\t\t\t\t_value = true;\n\t\t\t\t\tif(onValueHandler!=null) onValueHandler.Invoke(_value);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\t[SLua.DoNotToLua]\n\t\tpublic void OnDrag(PointerEventData eventData)\n\t\t{\n\t\t\tVector2 offset = (eventData.position - _lastPoint);\n\t\t\t_lastPoint = eventData.position;\n\n\t\t\tVector2 pos = bar.transform.localPosition;\n\t\t\tpos += new Vector2 (offset.x, 0);\n\n\t\t\tif (Mathf.Abs (pos.x) <= Mathf.Abs (_p1.x)) {\n\t\t\t\tbar.transform.localPosition = pos;\n\t\t\t}\n\t\t}\n\n\t\tpublic void setValue(bool value)\n\t\t{\n\t\t\t_value = value;\n\t\t\tbar.transform.localPosition = value ? _p1 : _p2;\n\t\t}\n\t}\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LSwitch.cs.meta",
    "content": "fileFormatVersion: 2\nguid: a4adddbef149d0742a41771183ee2756\ntimeCreated: 1500378509\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LTableView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections.Generic;\r\nusing System.Security;\r\nusing UnityEngine.UI;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\n\r\nnamespace Lui\r\n{\r\n    public class LTableViewCell\r\n    {\r\n        public int idx;\r\n        protected GameObject _node;\r\n        public GameObject node\r\n        {\r\n            get { return _node; }\r\n            set { \r\n                _node = value;\r\n                RectTransform rtran = _node.GetComponent<RectTransform>();\r\n                if (rtran == null)\r\n                {\r\n                    rtran = _node.AddComponent<RectTransform>();\r\n                }\r\n                rtran.pivot = Vector2.zero;\r\n                rtran.anchorMax = Vector2.zero;\r\n                rtran.anchorMin = Vector2.zero;\r\n            }\r\n        }\r\n        public void reset()\r\n        {\r\n            idx = LScrollView.INVALID_INDEX;\r\n        }\r\n    }\r\n\r\n    /// <summary>\r\n    /// 复用列表\r\n    /// </summary>\r\n    [SLua.CustomLuaClass]\r\n    public class LTableView : LScrollView\r\n    {\r\n        public int cellsCount;\r\n        public Vector2 cellsSize;\r\n        public bool autoRelocate;\r\n        public GameObject cell_tpl;\r\n\r\n        protected List<LTableViewCell> cellsUsed;\r\n        protected List<LTableViewCell> cellsFreed;\r\n        protected List<float> positions;\r\n        protected Dictionary<int, int> indices;\r\n        protected UnityAction<int,GameObject> onCellHandle;\r\n        public void SetCellHandle(UnityAction<int, GameObject> act)\r\n        {\r\n            onCellHandle = act;\r\n        }\r\n\r\n        public LTableView()\r\n        {\r\n            cellsCount = 0;\r\n            cellsSize = Vector2.zero;\r\n            direction = ScrollDirection.HORIZONTAL;\r\n            autoRelocate = false;\r\n\r\n            cellsUsed = new List<LTableViewCell>();\r\n            cellsFreed = new List<LTableViewCell>();\r\n            positions = new List<float>();\r\n            indices = new Dictionary<int, int>();\r\n        }\r\n\r\n        public virtual void reloadData()\r\n        {\r\n            for (int i = 0; i < cellsUsed.Count;i++ )\r\n            {\r\n                LTableViewCell cell = cellsUsed[i];\r\n                cellsFreed.Add(cell);\r\n                //cell.node.transform.SetParent(null);\r\n                cell.node.SetActive(false);\r\n                cell.reset();\r\n            }\r\n\r\n            Transform tran = transform.Find(\"container/cell_tpl\");\r\n            if(tran!=null){\r\n                tran.gameObject.SetActive(false);\r\n            }\r\n\r\n            cellsUsed.Clear();\r\n            indices.Clear();\r\n            positions.Clear();\r\n            updatePositions();\r\n            setContentOffsetToTop();\r\n            onScrolling();\r\n            relocateContainer();\r\n        }\r\n\r\n        public void removeAllFromUsed()\r\n        {\r\n\t\t\tint len = cellsUsed.Count;\r\n            for (int i=0;i<len;i++)\r\n            {\r\n                Destroy(cellsUsed[i].node);\r\n            }\r\n            cellsUsed.Clear();\r\n        }\r\n\r\n        public void removeAllFromFreed()\r\n        {\r\n\t\t\tint len = cellsFreed.Count;\r\n            for (int i=0;i<len;i++)\r\n            {\r\n                Destroy(cellsFreed[i].node);\r\n            }\r\n            cellsFreed.Clear();\r\n        }\r\n\r\n        protected override void onScrolling()\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            int beginIdx = 0, endIdx = 0;\r\n            beginIdx = cellBeginIndexFromOffset(getContentOffset());\r\n            endIdx = cellEndIndexFromOffset(getContentOffset());\r\n\r\n            while (cellsUsed.Count > 0)\r\n            {\r\n                LTableViewCell cell = cellsUsed[0];\r\n                int idx = cell.idx;\r\n\r\n                if (idx < beginIdx)\r\n                {\r\n                    indices.Remove(idx);\r\n                    cellsUsed.Remove(cell);\r\n                    cellsFreed.Add(cell);\r\n                    cell.reset();\r\n                    \r\n                    cell.node.SetActive(false);\r\n                }\r\n                else\r\n                {\r\n                    break;\r\n                }\r\n            }\r\n\r\n            while (cellsUsed.Count > 0)\r\n            {\r\n                LTableViewCell cell = cellsUsed[cellsUsed.Count - 1];\r\n                int idx = cell.idx;\r\n\r\n                if (idx > endIdx && idx < cellsCount)\r\n                {\r\n                    indices.Remove(idx);\r\n                    cellsUsed.RemoveAt(cellsUsed.Count - 1);\r\n                    cellsFreed.Add(cell);\r\n                    cell.reset();\r\n                    cell.node.SetActive(false);\r\n                }\r\n                else\r\n                {\r\n                    break;\r\n                }\r\n            }\r\n\r\n            for (int idx = beginIdx; idx <= endIdx && idx < cellsCount; ++idx)\r\n            {\r\n                if (indices.ContainsKey(idx))\r\n                {\r\n                    continue;\r\n                }\r\n                updateCellByAdapter(idx);\r\n            }\r\n\r\n            base.onScrolling();\r\n        }\r\n\r\n        protected void updatePositions()\r\n        {\r\n            if (direction == ScrollDirection.HORIZONTAL)\r\n            {\r\n                setContainerSize(new Vector2(cellsSize.x * cellsCount, cellsSize.y));\r\n                for (int i = 0; i < cellsCount;i++ )\r\n                {\r\n                    positions.Add(cellsSize.x * i);\r\n                }\r\n            }\r\n            else\r\n            {\r\n                float height = cellsSize.y * cellsCount;\r\n                setContainerSize(new Vector2(cellsSize.x, height));\r\n                height = Mathf.Max(height, GetComponent<RectTransform>().rect.height);\r\n                for (int i = cellsCount - 1; i >= 0;--i )\r\n                {\r\n                    positions.Add(height);\r\n                    height -= cellsSize.y;\r\n                }\r\n            }\r\n        }\r\n\r\n        protected override void onDraggingScrollEnded()\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return;\r\n            }\r\n\r\n            if (autoRelocate)\r\n            {\r\n                Vector2 offset = getContentOffset();\r\n                int idx = cellBeginIndexFromOffset(offset);\r\n                Vector2 pointA = cellPositionFromIndex(idx);\r\n\r\n                if (direction == ScrollDirection.HORIZONTAL)\r\n                {\r\n                    Vector2 pointB = new Vector2(pointA.x + cellsSize.x, 0);\r\n                    float distanceA = Vector2.Distance(offset, -pointA);\r\n                    float distanceB = Vector2.Distance(offset, -pointB);\r\n\r\n                    if (distanceA < distanceB)\r\n                    {\r\n                        float duration = Mathf.Abs(distanceA) / autoRelocateSpeed;\r\n                        setContentOffsetInDuration(-pointA, duration);\r\n                    }\r\n                    else\r\n                    {\r\n                        float duration = Mathf.Abs(distanceB) / autoRelocateSpeed;\r\n                        setContentOffsetInDuration(-pointB, duration);\r\n                    }\r\n                }\r\n                else\r\n                {\r\n                    Vector2 pointB = new Vector2(0, pointA.y - cellsSize.y);\r\n                    Vector2 contentPoint = new Vector2(0, GetComponent<RectTransform>().rect.height);\r\n                    offset = offset - contentPoint;\r\n                    float distanceA = Vector2.Distance(offset, -pointA);\r\n                    float distanceB = Vector2.Distance(offset, -pointB);\r\n\r\n                    if (distanceA < distanceB)\r\n                    {\r\n                        float duration = Mathf.Abs(distanceA) / autoRelocateSpeed;\r\n                        setContentOffsetInDuration(-pointA + contentPoint, duration);\r\n                    }\r\n                    else\r\n                    {\r\n                        float duration = Mathf.Abs(distanceB) / autoRelocateSpeed;\r\n                        setContentOffsetInDuration(-pointB + contentPoint, duration);\r\n                    }\r\n                }\r\n            }\r\n\r\n            base.onDraggingScrollEnded();\r\n        }\r\n\r\n        protected LTableViewCell dequeueCell()\r\n        {\r\n            LTableViewCell cell = null;\r\n            if (cellsFreed.Count == 0)\r\n            {\r\n                return null;\r\n            }\r\n            else\r\n            {\r\n                cell = cellsFreed[cellsFreed.Count - 1];\r\n                cellsFreed.Remove(cell);\r\n            }\r\n            return cell;\r\n        }\r\n\r\n        protected int cellBeginIndexFromOffset(Vector2 offset)\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return LScrollView.INVALID_INDEX;\r\n            }\r\n\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    {\r\n                        float xos = -offset.x;\r\n                        int idx = (int)(xos / cellsSize.x);\r\n\r\n                        idx = Mathf.Max(idx, 0);\r\n                        idx = Mathf.Min((int)cellsCount-1,idx);\r\n                        return (int)idx;\r\n                    }\r\n                default:\r\n                    {\r\n                        float ofy = offset.y + container.GetComponent<RectTransform>().rect.height;\r\n                        float xos = ofy - GetComponent<RectTransform>().rect.height;\r\n                        int idx = (int)(xos / cellsSize.y);\r\n\r\n                        idx = Mathf.Max(idx, 0);\r\n                        idx = Mathf.Min((int)cellsCount - 1, idx);\r\n                        return (int)idx;\r\n                    }\r\n            }\r\n        }\r\n\r\n        protected int cellEndIndexFromOffset(Vector2 offset)\r\n        {\r\n            if (cellsCount == 0)\r\n            {\r\n                return LScrollView.INVALID_INDEX;\r\n            }\r\n\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    {\r\n                        float xos = -(offset.x + -GetComponent<RectTransform>().rect.width);\r\n                        int idx = (int)(xos / cellsSize.x);\r\n\r\n                        idx = Mathf.Max(idx, 0);\r\n                        idx = Mathf.Min((int)cellsCount - 1, idx);\r\n\r\n                        return (int)idx;\r\n                    }\r\n                default:\r\n                    {\r\n                        float ofy = offset.y + container.GetComponent<RectTransform>().rect.height;\r\n                        int idx = (int)(ofy / cellsSize.y);\r\n\r\n                        idx = Mathf.Max(idx, 0);\r\n                        idx = Mathf.Min((int)cellsCount - 1, idx);\r\n\r\n                        return (int)idx;\r\n                    }\r\n            }\r\n        }\r\n\r\n\t\tpublic Vector2 cellPositionFromIndex(int idx)\r\n        {\r\n            if (idx == LScrollView.INVALID_INDEX)\r\n            {\r\n                return Vector2.zero;\r\n            }\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    {\r\n                        return new Vector2(positions[idx], 0);\r\n                    }\r\n                default:\r\n                    {\r\n                        return new Vector2(0, positions[idx]);\r\n                    }\r\n            }\r\n        }\r\n\r\n        protected void insertSortableCell(LTableViewCell cell, int idx)\r\n        {\r\n            if (cellsUsed.Count == 0)\r\n            {\r\n                cellsUsed.Add(cell);\r\n            }\r\n            else\r\n            {\r\n                for (int i = 0; i < cellsUsed.Count; i++ )\r\n                {\r\n                    if (cellsUsed[i].idx > idx)\r\n                    {\r\n                        cellsUsed.Insert(i, cell);\r\n                        return;\r\n                    }\r\n                }\r\n                cellsUsed.Add(cell);\r\n            }\r\n        }\r\n\r\n\t\tpublic void scrollToIdx(int idx,float duration){\r\n\r\n\t\t\tVector2 cellPos = cellPositionFromIndex (idx);\r\n\t\t\tif (direction == ScrollDirection.HORIZONTAL) {\r\n\t\t\t\tcellPos = new Vector2 (cellPos.x * -1, 0); \r\n\t\t\t} else if (direction == ScrollDirection.VERTICAL) {\r\n\t\t\t\tfloat totalHeight = cellsSize.y * cellsCount;\r\n\t\t\t\tcellPos = new Vector2 (0,  (idx + 1) * cellsSize.y - totalHeight ); \r\n\t\t\t}\r\n\t\t\tsetContentOffsetInDuration(cellPos,duration);\r\n\t\t}\r\n\r\n        public LTableViewCell cellAtIndex(int idx)\r\n        {\r\n            if (!indices.ContainsKey(idx))\r\n            {\r\n                return null;\r\n            }\r\n            for (int i = 0; i < cellsUsed.Count; i++)\r\n            {\r\n                if (cellsUsed[i].idx == idx)\r\n                {\r\n                    return cellsUsed[i];\r\n                }\r\n            }\r\n            return null;\r\n        }\r\n\r\n        protected virtual void updateCellByAdapter(int idx )\r\n        {\r\n            LTableViewCell cell = _onDataSourceAdapterHandler(dequeueCell(), idx);\r\n            if (cell == null)\r\n            {\r\n                Debug.LogError(\"cell can not be NULL\");\r\n            }\r\n            cell.idx = idx;\r\n            RectTransform rtran = cell.node.GetComponent<RectTransform>();\r\n            switch (direction)\r\n            {\r\n                case ScrollDirection.HORIZONTAL:\r\n                    rtran.pivot = Vector2.zero;\r\n                    break;\r\n                default:\r\n                    rtran.pivot = new Vector2(0, 1);\r\n                    break;\r\n            }\r\n\r\n            rtran.sizeDelta = cellsSize;\r\n            cell.node.SetActive(true);\r\n            cell.node.transform.SetParent(container.transform);\r\n            cell.node.transform.localScale = new Vector3(1,1,1);\r\n            cell.node.transform.localPosition = cellPositionFromIndex(idx);\r\n\r\n            insertSortableCell(cell, idx);\r\n            if(!indices.ContainsKey(idx))\r\n                indices.Add(idx, 1);\r\n        }\r\n\r\n        public virtual void updateCellAtIndex(int idx)\r\n        {\r\n            foreach(LTableViewCell cell in cellsUsed)\r\n            {\r\n                if(cell.idx == idx){\r\n                    onCellHandle.Invoke(idx, cell.node);\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n\r\n        protected LTableViewCell _onDataSourceAdapterHandler(LTableViewCell cell, int idx)\r\n        {\r\n            if (cell == null)\r\n            {\r\n                cell = new LTableViewCell();\r\n                if (cell_tpl != null)\r\n                    cell.node = (GameObject)Instantiate(cell_tpl);\r\n                else\r\n                    cell.node = (GameObject)Instantiate(transform.Find(\"container/cell_tpl\").gameObject);\r\n            }\r\n            if(onCellHandle != null)\r\n            {\r\n                onCellHandle.Invoke(idx, cell.node);\r\n            }\r\n            return cell;\r\n        }\r\n    }\r\n}"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LTableView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: ebaedf9fc07250b42961e2f5822aaaac\ntimeCreated: 1450839324\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LTouchView.cs",
    "content": "﻿/****************************************************************************\r\nCopyright (c) 2015 Lingjijian\r\n\r\nCreated by Lingjijian on 2015\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n****************************************************************************/\r\nusing UnityEngine;\r\nusing System.Collections;\r\nusing UnityEngine.Events;\r\nusing UnityEngine.EventSystems;\r\nusing UnityEngine.UI;\r\n\r\nnamespace Lui\r\n{\r\n    [SLua.CustomLuaClass]\r\n    public class LTouchView : MonoBehaviour , IPointerDownHandler, IPointerUpHandler, IDragHandler\r\n    {\r\n        public UnityAction<Vector2> onMoveBeginHandler;\r\n        public UnityAction<Vector2> onMoveHandler;\r\n        public UnityAction<Vector2> onMoveEndHandler;\r\n        public UnityAction<GameObject> onClickHandler2D;\r\n        public UnityAction<Vector2> onClickHandler;\r\n        private Vector2 _lastPoint;\r\n\t\tprivate Collider2D _lastTarget;\r\n\t\tprivate bool _hasCancel;\r\n\r\n        public LTouchView()\r\n        {\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnPointerDown(PointerEventData eventData)\r\n        {\r\n            _lastPoint = eventData.position;\r\n\t\t\t_lastTarget = null;\r\n\t\t\t_hasCancel = false;\r\n\r\n\r\n            if(onMoveBeginHandler != null)\r\n            {\r\n                onMoveBeginHandler.Invoke(eventData.position);\r\n            }\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnDrag(PointerEventData eventData)\r\n        {\r\n            Vector2 offset = eventData.position - _lastPoint;\r\n            _lastPoint = eventData.position;\r\n\t\t\t_hasCancel = true;\r\n\r\n\t\t\tif (onMoveHandler != null)\r\n            {\r\n\t\t\t\tonMoveHandler.Invoke(offset);\r\n            }\r\n        }\r\n\r\n        [SLua.DoNotToLua]\r\n        public void OnPointerUp(PointerEventData eventData)\r\n        {\r\n            Vector3 worldPos = Vector3.zero;\r\n#if UNITY_STANDALONE_WIN || UNITY_STANDALONE_OSX\r\n            worldPos = Camera.main.ScreenToWorldPoint (Input.mousePosition);\r\n#else\r\n            worldPos = Camera.main.ScreenToWorldPoint (eventData.position);\r\n#endif\r\n            if (onMoveEndHandler != null && _hasCancel)\r\n            {\r\n                onMoveEndHandler.Invoke(worldPos);\r\n            }\r\n\r\n            if (onClickHandler != null && (_hasCancel == false))\r\n            {\r\n                onClickHandler.Invoke(worldPos);\r\n            }\r\n        }\r\n    }\r\n\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LTouchView.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 3d48b2e38f99cad459b4603ab21cbe29\ntimeCreated: 1470452693\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LogCollect.cs",
    "content": "﻿using System.Collections.Generic;\nusing UnityEngine;\nusing UnityEngine.Events;\n\n    /// <summary>  \n    /// A console to display Unity's debug logs in-game.  \n    /// </summary>  \n    public class LogCollect : MonoBehaviour\n    {\n        struct Log  \n        {  \n            public string message;  \n            public string stackTrace;  \n            public LogType type;  \n        }  \n \n        #region Inspector Settings  \n  \n        /// <summary>  \n        /// The hotkey to show and hide the console window.  \n        /// </summary>  \n        public KeyCode toggleKey = KeyCode.BackQuote;  \n  \n        /// <summary>  \n        /// Whether to open the window by shaking the device (mobile-only).  \n        /// </summary>  \n        public bool shakeToOpen = true;  \n  \n        /// <summary>  \n        /// The (squared) acceleration above which the window should open.  \n        /// </summary>  \n        public float shakeAcceleration = 3f;  \n  \n        /// <summary>  \n        /// Whether to only keep a certain number of logs.  \n        ///  \n        /// Setting this can be helpful if memory usage is a concern.  \n        /// </summary>  \n        public bool restrictLogCount = false;  \n  \n        /// <summary>  \n        /// Number of logs to keep before removing old ones.  \n        /// </summary>  \n        public int maxLogs = 1000;\n\n        public string gmCmd = \"command\";\n\n        public UnityAction<string> onSendCmd;\n\n        #endregion\n  \n        readonly List<Log> logs = new List<Log>();  \n        Vector2 scrollPosition;  \n        bool visible;  \n        bool collapse;  \n  \n        // Visual elements:  \n  \n        static readonly Dictionary<LogType, Color> logTypeColors = new Dictionary<LogType, Color>  \n        {  \n            { LogType.Assert, Color.white },  \n            { LogType.Error, Color.red },  \n            { LogType.Exception, Color.red },  \n            { LogType.Log, Color.white },  \n            { LogType.Warning, Color.yellow },  \n        };  \n  \n        const string windowTitle = \"Console\";  \n        const int margin = 20;  \n        static readonly GUIContent clearLabel = new GUIContent(\"清屏\", \"Clear the contents of the console.\");  \n        static readonly GUIContent collapseLabel = new GUIContent(\"折叠\", \"Hide repeated messages.\");  \n  \n        readonly Rect titleBarRect = new Rect(0, 0, 10000, 20);  \n        Rect windowRect = new Rect(margin, margin, Screen.width - (margin * 2), Screen.height - (margin * 2));  \n  \n        void OnEnable()  \n        {  \n#if UNITY_5\n            Application.logMessageReceived += HandleLog;  \n#else\n            Application.RegisterLogCallback(HandleLog);  \n#endif\n        }  \n  \n        void OnDisable()  \n        {  \n#if UNITY_5\n            Application.logMessageReceived -= HandleLog;  \n#else\n            Application.RegisterLogCallback(null);  \n#endif\n        }  \n  \n        void Update()  \n        {  \n            if (Input.GetKeyDown(toggleKey))  \n            {  \n                visible = !visible;  \n            }  \n  \n            if (shakeToOpen && Input.acceleration.sqrMagnitude > shakeAcceleration)  \n            {\n                visible = true;  \n            }  \n        }  \n  \n        void OnGUI()  \n        {  \n            if (!visible)  \n            {  \n                return;  \n            }  \n  \n            windowRect = GUILayout.Window(123456, windowRect, DrawConsoleWindow, windowTitle);  \n        }  \n  \n        /// <summary>  \n        /// Displays a window that lists the recorded logs.  \n        /// </summary>  \n        /// <param name=\"windowID\">Window ID.</param>  \n        void DrawConsoleWindow(int windowID)  \n        {  \n            DrawLogsList();  \n            DrawToolbar();  \n  \n            // Allow the window to be dragged by its title bar.  \n            GUI.DragWindow(titleBarRect);  \n        }  \n  \n        /// <summary>  \n        /// Displays a scrollable list of logs.  \n        /// </summary>  \n        void DrawLogsList()  \n        {  \n            scrollPosition = GUILayout.BeginScrollView(scrollPosition);  \n  \n            // Iterate through the recorded logs.  \n            for (var i = 0; i < logs.Count; i++)  \n            {  \n                var log = logs[i];  \n  \n                // Combine identical messages if collapse option is chosen.  \n                if (collapse && i > 0)  \n                {  \n                    var previousMessage = logs[i - 1].message;  \n  \n                    if (log.message == previousMessage)  \n                    {  \n                        continue;  \n                    }  \n                }\n\n            GUIStyle style = new GUIStyle();\n            style.normal.textColor = logTypeColors[log.type];\n            style.fontSize = 30;\n            GUILayout.Label(log.message, style);  \n            }  \n  \n            GUILayout.EndScrollView();  \n  \n            // Ensure GUI colour is reset before drawing other components.  \n            GUI.contentColor = Color.white;  \n        }  \n  \n        /// <summary>  \n        /// Displays options for filtering and changing the logs list.  \n        /// </summary>  \n        void DrawToolbar()  \n        {  \n            GUILayout.BeginHorizontal();\n\n            GUIStyle style = new GUIStyle();\n            style.normal.textColor = Color.white;\n            style.fontSize = 30;\n\n            if (GUILayout.Button(clearLabel, style))  \n            {  \n                logs.Clear();  \n            }\n\n            gmCmd = GUILayout.TextField(gmCmd, style);\n\n            if (GUILayout.Button(\"发送\", style))\n            {\n                if(onSendCmd!=null)\n                {\n                    onSendCmd.Invoke(gmCmd);\n                }\n            }\n\n            if (GUILayout.Button(collapseLabel, style)) \n            {  \n                collapse = !collapse;\n            }\n  \n            if (GUILayout.Button(\"关闭\", style))  \n            {  \n                visible = false;\n            }\n\n            GUILayout.EndHorizontal();  \n        }  \n  \n\n\n        /// <summary>  \n        /// Records a log from the log callback.  \n        /// </summary>  \n        /// <param name=\"message\">Message.</param>  \n        /// <param name=\"stackTrace\">Trace of where the message came from.</param>  \n        /// <param name=\"type\">Type of message (error, exception, warning, assert).</param>  \n        void HandleLog(string message, string stackTrace, LogType type)  \n        {  \n            logs.Add(new Log  \n            {  \n                message = message,  \n                stackTrace = stackTrace,  \n                type = type,  \n            });  \n  \n            TrimExcessLogs();  \n        }  \n  \n        /// <summary>  \n        /// Removes old logs that exceed the maximum number allowed.  \n        /// </summary>  \n        void TrimExcessLogs()  \n        {  \n            if (!restrictLogCount)  \n            {  \n                return;  \n            }  \n  \n            var amountToRemove = Mathf.Max(logs.Count - maxLogs, 0);  \n  \n            if (amountToRemove == 0)  \n            {  \n                return;  \n            }  \n  \n            logs.RemoveRange(0, amountToRemove);  \n        }  \n    }\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget/LogCollect.cs.meta",
    "content": "fileFormatVersion: 2\nguid: f7cc234c7b8a4394c92a595d312eab12\ntimeCreated: 1497623748\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWidget.meta",
    "content": "fileFormatVersion: 2\r\nguid: a7178ed46bba71b4d91aad593285f63e\r\nfolderAsset: yes\r\ntimeCreated: 1451538126\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWindow/LWindowBase.cs",
    "content": "﻿using UnityEngine;\r\nusing SLua;\r\nusing System.Collections;\r\n\r\n[CustomLuaClass]\r\npublic class LWindowBase : LLuaBehaviourBase\r\n{\r\n    public WindowDispose disposeType;\r\n    public WindowHierarchy hierarchy;\r\n\r\n    public LWindowBase()\r\n    {\r\n        this.disposeType = WindowDispose.Delay;\r\n    }\r\n\r\n    [DoNotToLua]\r\n    public virtual void Open(object[] list)\r\n    {\r\n        if (m_bReady)\r\n        {\r\n            m_cBehavior.OnWindowOpen(list);\r\n        }\r\n    }\r\n\r\n    [DoNotToLua]\r\n    public virtual void Close()\r\n    {\r\n        if (m_bReady)\r\n        {\r\n            m_cBehavior.OnWindowClose();\r\n        }\r\n    }\r\n}\r\n\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWindow/LWindowBase.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 8789dcda559ded9418a6e4e5c6b8b719\ntimeCreated: 1451274746\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWindow/LWindowManager.cs",
    "content": "﻿using UnityEngine;\nusing System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing UnityEngine.SceneManagement;\nusing UnityEngine.Events;\nusing SLua;\n\n[CustomLuaClass]\npublic enum WindowHierarchy\n{\n    Normal,\n    Message,\n    Suspend\n}\n\n[CustomLuaClass]\npublic enum WindowDispose\n{\n    Cache,\n    Delay,\n    Normal\n}\n\n/// <summary>\n/// 窗体管理\n/// </summary>\n[CustomLuaClass]\npublic class LWindowManager : MonoBehaviour\n\n{\n    protected float recycleDuration;\n    protected float disposeDuration;\n\n    protected Dictionary<WindowHierarchy, List<LWindowBase>> runningWindows;\n    protected Dictionary<WindowHierarchy, GameObject> hierarchys;\n    protected Dictionary<string, LWindowBase> cacheWindows;\n    protected Dictionary<string, LWindowBase> delayDisposeWindows;\n    protected Dictionary<LWindowBase, float> delayWindowsTimes;\n    public GameObject canvas { get; private set; }\n    private static LWindowManager _instance;\n    private AsyncOperation _sceneAsync;\n    private uint _nowProcess;\n    public UnityAction<float> onProgressAsyncScene;\n\n    public LWindowManager()\n    {\n        runningWindows = new Dictionary<WindowHierarchy, List<LWindowBase>>();\n        hierarchys = new Dictionary<WindowHierarchy, GameObject>();\n        cacheWindows = new Dictionary<string, LWindowBase>();\n        delayDisposeWindows = new Dictionary<string, LWindowBase>();\n        delayWindowsTimes = new Dictionary<LWindowBase, float>();\n\n        recycleDuration = 2;\n        disposeDuration = 60;\n\n        foreach (int item in Enum.GetValues(typeof(WindowHierarchy)))\n        {\n            string eVal = item.ToString();\n            runningWindows.Add((WindowHierarchy)int.Parse(eVal), new List<LWindowBase>());\n        }\n    }\n\n    void OnDestroy()\n    {\n        CancelInvoke();\n    }\n\n    public static LWindowManager GetInstance()\n    {\n        if (_instance == null)\n        {\n            GameObject obj = new GameObject();\n            obj.name = \"LWindowManager\";\n            _instance = obj.AddComponent<LWindowManager>();\n        }\n        return _instance;\n    }\n\n    void Awake()\n    {\n        canvas = GameObject.Find(\"Canvas\");\n        if (canvas != null)\n        {\n            foreach (int item in Enum.GetValues(typeof(WindowHierarchy)))\n            {\n                string eKey = Enum.GetName(typeof(WindowHierarchy), item);\n                string eVal = item.ToString();\n\n                GameObject layer = new GameObject();\n                layer.name = \"Layer_\" + eKey;\n                layer.transform.SetParent(canvas.transform);\n                layer.transform.localScale = new Vector3(1, 1, 1);\n                layer.transform.localPosition = Vector3.zero;\n\n                RectTransform rtran = layer.GetComponent<RectTransform>();\n                if (rtran == null)\n                {\n                    rtran = layer.AddComponent<RectTransform>();\n                }\n                rtran.pivot = new Vector2(0.5f, 0.5f);\n                rtran.anchorMin = new Vector2(0, 0);\n                rtran.anchorMax = new Vector2(1, 1);\n                rtran.offsetMax = new Vector2(0, 0);\n                rtran.offsetMin = new Vector2(0, 0);\n\n                hierarchys.Add((WindowHierarchy)int.Parse(eVal), layer);\n            }\n        }\n        else\n        {\n            Debug.LogWarning(\"can't find [Canvas]\");\n        }\n\n        InvokeRepeating(\"checkRecycle\", 0, recycleDuration);\n    }\n\n    protected void checkRecycle()\n    {\n        List<LWindowBase> recycles = new List<LWindowBase>();\n        foreach (var item in delayDisposeWindows)\n        {\n            if (!isRunning(item.Value.name) && Time.time - delayWindowsTimes[item.Value] >= disposeDuration)\n            {\n                recycles.Add(item.Value);\n            }\n        }\n        while (true)\n        {\n            if (recycles.Count == 0)\n                break;\n\n            LWindowBase win = recycles[0];\n            delayWindowsTimes.Remove(win);\n            delayDisposeWindows.Remove(win.name);\n            recycles.RemoveAt(0);\n            Destroy(win.gameObject);\n            Debug.Log(string.Format(\"Destroy Window [{0}]\", win.name));\n        }\n    }\n\n    public void LoadScene(string name)\n    {\n        SceneManager.LoadScene(name);\n    }\n\n    public void LoadSceneAsync(string name, UnityAction<float> onProgressFunc)\n    {\n        StartCoroutine(onLoadSceneAsync(name, onProgressFunc));\n    }\n\n    void Update()\n    {\n        if (_sceneAsync != null)\n        {\n            uint progress;\n            if (_sceneAsync.progress < 0.9f)\n            {\n                progress = (uint)(_sceneAsync.progress * 100);\n            }\n            else\n            {\n                progress = 100;\n            }\n            if(_nowProcess < progress)\n                _nowProcess++;\n            if (onProgressAsyncScene != null)\n                onProgressAsyncScene.Invoke(_nowProcess);\n            if(_nowProcess == 100)\n                _sceneAsync.allowSceneActivation = true;\n        }\n    }\n\n    private IEnumerator onLoadSceneAsync(string name, UnityAction<float> onProgressFunc)\n    {\n        _nowProcess = 0;\n        onProgressAsyncScene = onProgressFunc;\n        _sceneAsync = SceneManager.LoadSceneAsync(name);\n        _sceneAsync.allowSceneActivation = false;\n\n        yield return _sceneAsync;\n    }\n\n    protected LWindowBase loadWindow(string name)\n    {\n        LWindowBase ret = null;\n        if (cacheWindows.ContainsKey(name))\n        {\n            ret = cacheWindows[name];\n        }\n        else if (delayDisposeWindows.ContainsKey(name))\n        {\n            ret = delayDisposeWindows[name];\n        }\n        else\n        {\n\t\t\tstring abName = LGameConfig.GetABNameWithAtlasPath (name);\n\t\t\tGameObject res = LLoadBundle.GetInstance().LoadAsset<GameObject>(abName, name);\n            GameObject obj = Instantiate(res);\n\n            obj.name = name;\n            obj.GetComponent<RectTransform>().sizeDelta = canvas.GetComponent<RectTransform>().rect.size;\n            ret = obj.GetComponent<LWindowBase>();\n            if (ret) ret.name = obj.name;\n        }\n        return ret;\n    }\n\n    public void runWindow(string name, WindowHierarchy e, object[] list = null)\n    {\n        if (isRunning(name))\n        {\n            return;\n        }\n        LWindowBase win = loadWindow(name);\n\n        if (win != null)\n        {\n            win.hierarchy = e;\n            win.gameObject.transform.SetParent(hierarchys[e].transform);\n            win.gameObject.transform.localScale = new Vector3(1, 1,1);\n            win.gameObject.transform.localPosition = Vector3.zero;\n            win.Open(list);\n\n            runningWindows[e].Add(win);\n\n            if (win.disposeType == WindowDispose.Delay)\n            {\n                delayDisposeWindows[name] = win;\n                delayWindowsTimes[win] = Time.time;\n            }\n            else if (win.disposeType == WindowDispose.Cache)\n            {\n                cacheWindows.Add(name, win);\n            }\n        }\n    }\n\n    public LWindowBase seekWindow(string name)\n    {\n        LWindowBase ret = null;\n        foreach (var item in runningWindows)\n        {\n            foreach (var iitem in item.Value)\n            {\n                if (iitem.name == name)\n                {\n                    ret = iitem;\n                    break;\n                }\n            }\n        }\n        return ret;\n    }\n\n    public void popWindow(string name)\n    {\n        LWindowBase win = seekWindow(name);\n        popWindow(win);\n    }\n\n    public void popWindow(LWindowBase win)\n    {\n        if (win != null)\n        {\n            runningWindows[win.hierarchy].Remove(win);\n            win.Close();\n\n            if (win.disposeType == WindowDispose.Cache)\n            {\n                win.gameObject.transform.SetParent(null);\n            }\n            else if (win.disposeType == WindowDispose.Normal)\n            {\n                cacheWindows.Remove(win.name);\n                delayDisposeWindows.Remove(win.name);\n                delayWindowsTimes.Remove(win);\n                Destroy(win.gameObject);\n                Debug.Log(string.Format(\"Destroy Window [{0}]\", win.name));\n            }\n            else if (win.disposeType == WindowDispose.Delay)\n            {\n                win.gameObject.transform.SetParent(null);\n            }\n        }\n    }\n\n    public void popAllWindow()\n    {\n        foreach (int item in Enum.GetValues(typeof(WindowHierarchy)))\n        {\n            string eVal = item.ToString();\n            popAllWindow((WindowHierarchy)int.Parse(eVal));\n        }\n    }\n\n    public void popAllWindow(WindowHierarchy e)\n    {\n        while (true)\n        {\n            if (runningWindows[e].Count == 0)\n                break;\n            popWindow(runningWindows[e][0]);\n        }\n    }\n\n    public void removeCachedWindow(string name)\n    {\n        popWindow(name);\n        cacheWindows.Remove(name);\n    }\n\n    public void removeAllCachedWindow()\n    {\n        foreach (var item in cacheWindows)\n        {\n            popWindow(item.Value);\n        }\n        cacheWindows.Clear();\n    }\n\n    public bool isRunning(string name)\n    {\n        bool ret = false;\n        foreach (var item in runningWindows)\n        {\n            foreach (var iitem in item.Value)\n            {\n                if (iitem.name == name)\n                {\n                    ret = true;\n                    break;\n                }\n            }\n        }\n        return ret;\n    }\n}\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWindow/LWindowManager.cs.meta",
    "content": "fileFormatVersion: 2\nguid: d322906cb5903be4681bc54a5dc64592\ntimeCreated: 1451274748\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/LWindow.meta",
    "content": "fileFormatVersion: 2\r\nguid: 650823ca0a85043479bc37ebb407c164\r\nfolderAsset: yes\r\ntimeCreated: 1451131015\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/Network.cs",
    "content": "﻿using UnityEngine;\r\nusing System;\r\nusing SLua;\r\nusing System.IO;  \r\nusing System.Threading;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\n\r\n[CustomLuaClass]\r\npublic class LNetwork : MonoBehaviour\r\n{\r\n    private static LNetwork _instance;\r\n    public Action<bool> onConnect;\r\n    public Action onDisconnect;\r\n\tpublic Action<int, ByteArray,bool> onHandleMessage;\r\n    private Dictionary<string, ByteArray> _protoBytes;\r\n\r\n\tprotected bool _isOnConn;\r\n\tprotected bool _isOnDisConn;\r\n\tprivate bool _connParam;\r\n\tprivate NetworkInterface inter;\r\n\r\n\tpublic struct MsgProto\r\n\t{\r\n\t\tpublic int msgId;\r\n\t\tpublic ByteArray packet;\r\n\t\tpublic bool isEncrypt;\r\n\t}\r\n\r\n    public LNetwork()\r\n    {\r\n        _protoBytes = new Dictionary<string, ByteArray>();\r\n    }\r\n\r\n    public static LNetwork GetInstance()\r\n    {\r\n        if (_instance == null)\r\n        {\r\n            GameObject obj = new GameObject();\r\n            obj.name = \"LNetwork\";\r\n            DontDestroyOnLoad(obj);\r\n            _instance = obj.AddComponent<LNetwork>();\r\n        }\r\n        return _instance;\r\n    }\r\n\r\n\tpublic void Awake()\r\n\t{\r\n\t\tinter = new NetworkInterface (OnConnect, OnHandleMessage);\r\n\t}\r\n\r\n    public ByteArray GetProtoBytes(string file)\r\n    {\r\n        if (!_protoBytes.ContainsKey(file))\r\n        {\r\n           \r\n            if (LGameConfig.GetInstance().isDebug)\r\n            {\r\n                LArchiveBinFile cArc = new LArchiveBinFile();\r\n                string strFullPath = LGameConfig.GetInstance().GetLoadUrl(LGameConfig.DATA_CATAGORY_LUA + \"/Game/Proto/\" + file + \".bytes\");\r\n\r\n                if (!cArc.Open(strFullPath, System.IO.FileMode.Open, System.IO.FileAccess.Read))\r\n                {\r\n                    return null;\r\n                }\r\n\r\n                if (!cArc.IsValid())\r\n                {\r\n                    return null;\r\n                }\r\n                int nContentLength = (int)cArc.GetStream().Length;\r\n                byte[] aContents = new byte[nContentLength];\r\n                cArc.ReadBuffer(ref aContents, nContentLength);\r\n                cArc.Close();\r\n                _protoBytes.Add(file, new ByteArray(aContents));\r\n            }\r\n            else\r\n            {\r\n                TextAsset asset = LLoadBundle.GetInstance().LoadAsset<TextAsset>(\"@lua.ab\", \"@Lua/Game/Proto/\" + file + \".bytes\");\r\n                _protoBytes.Add(file, new ByteArray(asset.bytes));\r\n            }\r\n        }\r\n        \r\n        return _protoBytes[file];\r\n    }\r\n\r\n\tpublic void Update()\r\n\t{\r\n\t\tinter.process();\r\n\t}\r\n\r\n    public void connect(string ip, int port)\r\n    {\r\n\r\n\t\tinter.connectTo (ip, port, null);\r\n    }\r\n\r\n\tpublic void send(int msgid, ByteArray content,bool isEncrypt)\r\n    {\r\n\t\tbyte[] data = content.GetData();\r\n        byte[] packet = new byte[data.Length + 1 + 4 + 4];\r\n\r\n        packet[0] = isEncrypt ? (byte)1 : (byte)0;\r\n\r\n\t\tbyte[] msgIdBytes = BitConverter.GetBytes(msgid);\r\n\t\tArray.Reverse (msgIdBytes);\r\n\t\tBuffer.BlockCopy(msgIdBytes, 0, packet, 1, msgIdBytes.Length);\r\n\r\n\t\tbyte[] msgLenBytes = BitConverter.GetBytes(data.Length);\r\n\t\tArray.Reverse (msgLenBytes);\r\n\t\tBuffer.BlockCopy(msgLenBytes, 0, packet, 1+4, msgLenBytes.Length);\r\n\r\n\t\tBuffer.BlockCopy(data, 0, packet, 1+4+4, data.Length);\r\n\r\n\t\tinter.Send (packet);\r\n    }\r\n\r\n    public bool valid()\r\n    {\r\n\t\treturn inter.valid();\r\n    }\r\n    \r\n    public void close()\r\n    {\r\n\t\tinter.Close();\r\n    }\r\n\r\n    private void OnConnect(bool isConn)\r\n    {\r\n\t\tif(onConnect!= null)\r\n\t\t\tonConnect.Invoke(isConn);\r\n    }\r\n\t\t\r\n\tprivate void OnHandleMessage(int msgId,ByteArray packet,bool isEncrypt)\r\n    {\r\n\t\tif (onHandleMessage != null)\r\n\t\t\tonHandleMessage.Invoke(msgId, packet,isEncrypt);\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/Network.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 419dd26884b738541b56dc07952d413b\ntimeCreated: 1470452693\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/NetworkInterface.cs",
    "content": "﻿\r\nusing UnityEngine;\r\nusing System;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing System.IO;\r\nusing System.Net;\r\nusing System.Net.Sockets;\r\n\r\n\r\n    public enum SocketErrorType\r\n    {\r\n        SocketException,\r\n        Exception\r\n    }\r\n    public class NetworkInterface\r\n    {\r\n        public const int MAX_BUFFER_SIZE = 65535;\r\n        public const int MAX_PACKETS_PER_FRAME = 200;\r\n        public const float CONNECT_TIME_OUT = 25;\r\n\r\n        public delegate void ConnectCallback(string ip, int port, bool success, SocketErrorType errorType, object userData);\r\n        public class ConnectState\r\n        {\r\n            public bool success = true;\r\n            public string connectIP = \"\";\r\n            public int connectPort = 0;\r\n            public ConnectCallback connectCB = null;\r\n            public object userData = null;\r\n            public Socket socket = null;\r\n            public NetworkInterface networkInterface = null;\r\n            public SocketErrorType errorType;\r\n            public string error = \"\";\r\n        }\r\n        protected TCPClientWorker m_tcpWorker;\r\n        private Socket m_socket;\r\n\r\n        \r\n        public int gateType = 0;   // 0 login  1 game\r\n\r\n        private string ip = \"\";\r\n        private int port = 0;\r\n        public bool connectCallbackFlag = false;\r\n        public bool Connecting { get; set; }\r\n\t\tprivate static Action<bool> OnConn;\r\n\t\tprivate static Action<int,SLua.ByteArray,bool> OnDataReceive;\r\n\t\tpublic NetworkInterface(Action<bool> onConn,Action<int,SLua.ByteArray,bool> onDataReceive)\r\n        {\r\n            this.Connecting = false;\r\n\t\t\tNetworkInterface.OnConn = onConn;\r\n\t\t\tNetworkInterface.OnDataReceive = onDataReceive;\r\n        }\r\n        \r\n        public bool valid()\r\n        {\r\n            if ((this.m_socket != null) && (this.m_socket.Connected == true) && m_tcpWorker != null && m_tcpWorker.SocketValid)\r\n            {\r\n                return true;\r\n            }\r\n            return false;\r\n        }\r\n\r\n        public void Close()\r\n        {\r\n            if (this.m_socket != null)\r\n            {\r\n                try\r\n                {\r\n                    this.m_socket.Shutdown(SocketShutdown.Both);\r\n                    this.m_socket.Close();\r\n                    this.m_socket = null;\r\n                }\r\n                catch (Exception ex)\r\n                {\r\n\t\t\t\tUnityEngine.Debug.LogFormat(\"Close Exception: {0}\",ex.ToString());\r\n                }\r\n            }\r\n            if (m_tcpWorker != null)\r\n            {\r\n                m_tcpWorker.Close();\r\n                m_tcpWorker = null;\r\n            }\r\n        }\r\n\r\n        public void Send(byte[] data)\r\n        {\r\n            if (m_tcpWorker != null)\r\n                m_tcpWorker.Push(data);\r\n        }\r\n\r\n        public void connectTo(string ip, int port, object userData)\r\n        {\r\n            if (valid())\r\n                throw new InvalidOperationException(\"Have already connected!\");\r\n            string newip = ip;\r\n            #if UNITY_IOS\r\n\t\t\tnewip = NtUniSdk.Unity3d.SdkU3d.getIpStr(ip);\r\n\t\t\tIPAddress[] addrIps = Dns.GetHostAddresses(newip);\r\n\t\t\tAddressFamily ipTypes = addrIps[0].AddressFamily;\r\n            m_socket = new Socket(ipTypes, SocketType.Stream, ProtocolType.Tcp);\r\n            LoggerHelper.Warning(\"IpTypes = {0}\",ipTypes);\r\n            #else\r\n            m_socket = new Socket(AddressFamily.InterNetwork, SocketType.Stream, ProtocolType.Tcp);\r\n            #endif\r\n            \r\n            m_socket.SetSocketOption(System.Net.Sockets.SocketOptionLevel.Socket, SocketOptionName.ReceiveBuffer, MAX_BUFFER_SIZE);\r\n            m_socket.NoDelay = true;\r\n            ConnectState state = new ConnectState();\r\n            this.ip = newip;\r\n            this.port = port;\r\n            state.connectIP = newip;\r\n            state.connectPort = port;\r\n            state.userData = userData;\r\n            state.socket = m_socket;\r\n            state.networkInterface = this;\r\n\r\n            UnityEngine.Debug.Log(\"connect to \" + newip + \":\" + port);\r\n            try\r\n            {\r\n                m_socket.BeginConnect(new IPEndPoint(IPAddress.Parse(newip), port), new AsyncCallback(connectCB), state);\r\n                connectCallbackFlag = false;\r\n\t\t\t\tLNetwork.GetInstance().StartCoroutine(waitForConnect(state));\r\n                this.Connecting = true;\r\n            }\r\n            catch (SocketException e)\r\n            {\r\n\t\t\tUnityEngine.Debug.LogFormat(\"connectTo error: {0}\", e.ToString());\r\n                state.errorType = SocketErrorType.SocketException;\r\n                state.error = e.ToString();\r\n                state.success = false;\r\n                _onConnectStatus(state);\r\n            }\r\n            catch (Exception e)\r\n            {\r\n\t\t\tUnityEngine.Debug.LogFormat(\"connectTo error: {0}\", e.ToString());\r\n                state.errorType = SocketErrorType.Exception;\r\n                state.error = e.ToString();\r\n                state.success = false;\r\n                _onConnectStatus(state);\r\n            }\r\n        }\r\n\r\n        public void reconnectTo(object userData)\r\n        {\r\n            connectTo(ip, port, userData);\r\n        }\r\n\r\n        private IEnumerator waitForConnect(ConnectState state)\r\n        {\r\n            float connectTimeAcc = 0.0f;\r\n            bool connectTimeout = false;\r\n            while (!state.networkInterface.connectCallbackFlag)\r\n            {\r\n                // 等待异步连接返回\r\n                connectTimeAcc += Time.deltaTime;\r\n                if (connectTimeAcc > CONNECT_TIME_OUT)\r\n                {\r\n                    connectTimeout = true;\r\n                    break;\r\n                }\r\n                yield return null;\r\n            }\r\n            if (connectTimeout)\r\n            {\r\n                state.error = \"connect timeout\";\r\n                state.errorType = SocketErrorType.SocketException;\r\n                state.success = false;\r\n                _onConnectStatus(state);\r\n            }\r\n            else\r\n            {\r\n                _onConnectStatus(state);\r\n            }\r\n        }\r\n        private static IEnumerator CheckNetworkStateLoop(NetworkInterface networkInterface)\r\n        {\r\n            if (networkInterface.valid())\r\n                yield return null;\r\n            // 网络断开，回调接口\r\n        }\r\n        private static void _onConnectStatus(ConnectState state)\r\n        {\r\n            NetworkInterface networkInterface = state.networkInterface;\r\n            networkInterface.Connecting = false;\r\n            if (state.success)\r\n            {\r\n                // 创建发送和接收进程开始接收数据\r\n                networkInterface.startTcpWorker();\r\n                // 启动协程判断网络是否断开\r\n\t\t\t\tLNetwork.GetInstance().StartCoroutine(CheckNetworkStateLoop(networkInterface));\r\n            }\r\n            else\r\n            {\r\n                networkInterface.Close();\r\n                UnityEngine.Debug.Log(\"connect error: \" + state.error);\r\n            }\r\n\t\tif (NetworkInterface.OnConn != null)\r\n\t\t\tNetworkInterface.OnConn.Invoke (state.success);\r\n            //EventDispatcher.Instance.TriggerEvent<bool, NetworkInterface.ConnectState>(EventIdType.ConnectSuccess, state.success, state);\r\n        }\r\n        private static void connectCB(IAsyncResult ar)\r\n        {\r\n            UnityEngine.Debug.Log(\"connectCB...........\");\r\n            ConnectState state = null;\r\n            try\r\n            {\r\n                state = (ConnectState)ar.AsyncState;\r\n                state.socket.EndConnect(ar);\r\n            }\r\n            catch (SocketException e)\r\n            {\r\n                state.errorType = SocketErrorType.SocketException;\r\n                state.error = e.ToString();\r\n                state.success = false;\r\n            }\r\n            catch (Exception e)\r\n            {\r\n                state.errorType = SocketErrorType.Exception;\r\n                state.error = e.ToString();\r\n                state.success = false;\r\n            }\r\n            state.networkInterface.connectCallbackFlag = true;\r\n        }\r\n\r\n        private void startTcpWorker()\r\n        {\r\n            if (gateType == 1)\r\n            { // 连游戏节点，设置超时时间为30s\r\n                m_socket.ReceiveTimeout = 30000;\r\n            }\r\n            m_tcpWorker = new TCPClientWorker(m_socket);\r\n            \r\n        }\r\n\r\n        public void process()\r\n        {\r\n            int hasRecieved = 0;\r\n            while (hasRecieved < MAX_PACKETS_PER_FRAME)\r\n            {\r\n                if (m_tcpWorker == null)\r\n                    return;\r\n                \r\n                byte[] data = m_tcpWorker.Recv();\r\n                if (data == null || data.Length == 0)\r\n                {\r\n                    // check network state\r\n                    break;\r\n                }\r\n                else\r\n                {\r\n\t\t\t\t    if (NetworkInterface.OnDataReceive != null)\r\n                    {\r\n\t\t\t\t\t\tbool isEncrypt = BitConverter.ToBoolean(data,0);\r\n\t\t\t\t\t\tint msgid = BitConverter.ToInt32(data,1);\r\n\t\t\t\t\t\tint nLength = BitConverter.ToInt32(data, 1 + 4);\r\n\r\n\t\t\t\t\t\tbyte[] packet = new byte[nLength];\r\n\t\t\t\t\t\tBuffer.BlockCopy(data, 4 + 4 + 1, packet, 0, nLength);\r\n\r\n\t\t\t\t\t\tNetworkInterface.OnDataReceive(msgid,new SLua.ByteArray(packet),isEncrypt);\r\n                        \r\n                    }\r\n                    hasRecieved++;\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/NetworkInterface.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 5dbcbe9c980fb2b44a3c22e6b79d2a1f\ntimeCreated: 1493531995\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/Reactor.cs",
    "content": "﻿using System;\nusing System.Net;\nusing System.Net.Sockets;\nusing UnityEngine;\nusing SLua;\n\n//namespace AppEngine\n//{\n    public class Reactor\n    {\n        private Socket socket_ = null;\n\n        private byte[] rbuffer_;\n        private int rwpos_ = 0;\n        private int flags = 0;\n\n        private byte[] wbuffer_;\n        private int wwpos_ = 0;\n\n        private bool sending = false;\n        private Action<bool> callback_;\n        private Action disconnect_;\n\t\tprivate Action<ushort,ByteArray> handleMessage_;\n        private Action<bool> connectResult_;\n\n        private string ipaddr_;\n        private int port_;\n\n        enum STATUS\n        {\n            CLOSED = 0,\n            CONNECTING = 1,\n            CONNECTED = 2,\n        }\n\n        private STATUS status_ = STATUS.CLOSED;\n        private static UInt32 READBUFF_SIZE = 1024000;\n        private static UInt32 WRITEBUFF_SIZE = 81920;\n\n\t\tpublic Reactor(Action<bool> callback, Action disconnect, Action<ushort,ByteArray> handleMessage)\n        {\n            rbuffer_ = new byte[READBUFF_SIZE];\n            rwpos_ = 0;\n\n            wbuffer_ = new byte[WRITEBUFF_SIZE];\n            wwpos_ = 0;\n\n            callback_ = callback;\n            disconnect_ = disconnect;\n            handleMessage_ = handleMessage;\n        }\n\n        public void connect(string ip, int port)\n        {\n            ipaddr_ = ip;\n            port_ = port;\n\n            connect();\n        }\n\n        public void connect()\n        {\n            rbuffer_ = new byte[READBUFF_SIZE];\n            rwpos_ = 0;\n\n            wbuffer_ = new byte[WRITEBUFF_SIZE];\n            wwpos_ = 0;\n\n            flags = 0;\n            status_ = 0;\n\n            var addrs = Dns.GetHostAddresses(ipaddr_);\n\n            foreach(var a in addrs)\n            {\n                Debug.LogFormat(\"parse dns({0}) => {1}\", ipaddr_, a.ToString());\n            }\n\n            int index = 0;\n            connectResult_ = (bool result) => \n            {\n                if (result)\n                    callback_(true);\n                else\n                {\n                    IPAddress addr = null;\n                    if (index < addrs.Length)\n                    {\n                        addr = addrs[index++];\n                        if (addr != null && addr.AddressFamily == AddressFamily.InterNetwork || addr.AddressFamily == AddressFamily.InterNetworkV6)\n                        {\n                            socket_ = new Socket(addr.AddressFamily, SocketType.Stream, ProtocolType.Tcp);\n                            socket_.NoDelay = true;\n                            socket_.Blocking = false;\n\n                            Debug.LogFormat(\"send buffer size {0}\", socket_.SendBufferSize);\n\n                            sending = false;\n\n                            Debug.LogFormat(\"connect to {0}:{1} r{2} w{3}\", addr.ToString(), port_, READBUFF_SIZE, WRITEBUFF_SIZE);\n\n                            try\n                            {\n                                status_ = STATUS.CONNECTING;\n                                socket_.Connect(new IPEndPoint(addr, port_));\n                                if (socket_.Connected)\n                                {\n                                    status_ = STATUS.CONNECTED;\n                                    callback_(true);\n                                    return;\n                                }\n                            }\n                            catch (SocketException e)\n                            {\n                                if (e.SocketErrorCode != SocketError.WouldBlock &&\n                                    e.SocketErrorCode != SocketError.InProgress)\n                                {\n                                    Debug.LogFormat(\"connect to {0}:{1} error:{2}\", addr, port_, e.Message);\n                                    connectResult_(false);\n                                }\n                            }\n                        }\n                    }\n                    else\n                    {\n                        callback_(false);\n                    }\n                }\n            };\n            connectResult_(false);\n        }\n\n        public bool valid()\n        {\n            return socket_ != null && socket_.Connected == true;\n        }\n\n        public void close()\n        {\n            if (valid())\n            {\n                socket_.Shutdown(SocketShutdown.Both);\n                socket_ = null;\n            }\n        }\n\n        public void send(byte[] data)\n        {\n            if (!valid()) return;\n\n            if (!sending)\n            {\n                int bytes = 0;\n                try\n                {\n                    bytes = socket_.Send(data);\n                    if (bytes != data.Length)\n                    {\n                        Array.Copy(data, bytes, wbuffer_, wwpos_, data.Length - bytes);\n                        wwpos_ += data.Length - bytes;\n                        sending = true;\n                        //Debug.LogFormat(\"socket.send block {0}<==>{1} wwpos=>{2}\", bytes, data.Length, wwpos_);\n                    }\n                    else\n                    {\n                    //Debug.LogFormat(\"socket.send success {0}<==>{1} wwpos=>{2}\", bytes, data.Length, wwpos_);\n                }\n                }\n                catch(SocketException e)\n                {\n                    if (e.SocketErrorCode == SocketError.WouldBlock ||\n                        e.SocketErrorCode == SocketError.TryAgain)\n                    {\n                        Array.Copy(data, bytes, wbuffer_, wwpos_, data.Length - bytes);\n                        wwpos_ += data.Length - bytes;\n                        sending = true;\n                    Debug.LogFormat(\"socket.send ex block {0}<==>{1} wwpos=>{2} {3}\", bytes, data.Length, wwpos_, e.Message);\n                }\n                else\n                    {\n                        Debug.LogFormat(\"socket.send exception==>{0}\", e.Message);\n                    }\n                }\n            }\n        }\n\n        public void Poll()\n        {\n            if (socket_ != null && status_ > 0)\n            {\n            if (status_ == STATUS.CONNECTING)\n                {\n                    /*if (socket_.Poll(0, SelectMode.SelectError))\n                    {\n                        status_ = STATUS.CLOSED;\n                        object o = socket_.GetSocketOption(SocketOptionLevel.Socket, SocketOptionName.Error);\n                        Debug.LogFormat(\"connect SelectError {0}\", o.ToString);\n                        socket_.Close();\n                        callback_(false);\n                    }\n                    else */if (socket_.Poll(0, SelectMode.SelectWrite))\n                    {\n                        if (socket_.Connected)\n                        {\n                            status_ = STATUS.CONNECTED;\n                            //callback_(true);\n                            connectResult_(true);\n                            object o = socket_.GetSocketOption(SocketOptionLevel.Socket, SocketOptionName.Error);\n                            Debug.LogFormat(\"connect SelectError {0}\", o);\n                        }\n                        else\n                        {\n                            object o = socket_.GetSocketOption(SocketOptionLevel.Socket, SocketOptionName.Error);\n                            Debug.LogFormat(\"connect SelectError {0}\", o);\n                            status_ = STATUS.CLOSED;\n                            socket_.Close();\n                            connectResult_(false);\n                        }\n                    }\n                }\n                else if (status_ == STATUS.CONNECTED)\n                {\n                    if (socket_.Poll(0, SelectMode.SelectRead))\n                    {\n                    try\n                        {\n                            do\n                            {\n                                int bytesRead = socket_.Receive(rbuffer_, (int)rwpos_, (int)(rbuffer_.Length - rwpos_), SocketFlags.None);\n                                if (bytesRead > 0)\n                                {\n                                    rwpos_ += bytesRead;\n\n                                    splitPacket();\n                                }\n                                else\n                                {\n                                    Debug.LogFormat(\"PacketReceiver::onRecv(): recv bytes : {0}\", bytesRead);\n                                    socket_.Close();\n                                    status_ = STATUS.CLOSED;\n                                    if (disconnect_ != null)\n                                        disconnect_();\n                                    break;\n                                }\n                            } while (socket_ != null && socket_.Available > 0);\n                        }\n                        catch (SocketException e)\n                        {\n                            if (e.SocketErrorCode == SocketError.WouldBlock ||\n                                e.SocketErrorCode == SocketError.TryAgain)\n                            {\n                                Debug.LogFormat(\"socket recv block \");\n                            }\n                            else\n                            {\n                                Debug.LogFormat(\"PacketReceiver::onRecv(): {0}\", e.Message);\n                                socket_.Close();\n                                status_ = STATUS.CLOSED;\n                                if (disconnect_ != null)\n                                    disconnect_();\n                            }\n                        }\n                    }\n\n                    if (socket_ != null && socket_.Connected && sending && socket_.Poll(0, SelectMode.SelectWrite))\n                    {\n                        int bytes = 0;\n\n                        try\n                        {\n                            bytes = socket_.Send(wbuffer_, wwpos_, SocketFlags.None);\n                            if (bytes == wwpos_)\n                            {\n                                sending = false;\n                                wwpos_ = 0;\n                                //Debug.LogFormat(\"send complete {0}\", bytes);\n                            }\n                            else\n                            {\n                                Array.Copy(wbuffer_, bytes, wbuffer_, 0, wwpos_ - bytes);\n                                wwpos_ -= bytes;\n                                //Debug.LogFormat(\"socket.send exx1 block {0}<==>{1} {2}\", bytes, wwpos_);\n                            }\n                        }\n                        catch (SocketException e)\n                        {\n                            if (e.SocketErrorCode == SocketError.WouldBlock ||\n                                e.SocketErrorCode == SocketError.TryAgain)\n                            {\n                                Array.Copy(wbuffer_, bytes, wbuffer_, 0, wwpos_ - bytes);\n                                wwpos_ -= bytes;\n                                //Debug.LogFormat(\"socket.send exx block {0}<==>{1} {2}\", bytes, wwpos_, e.Message);\n                            }\n                            else\n                            {\n                                //Debug.LogFormat(\"socket.send exception==>{0}\", e.Message);\n                            }\n                        }\n                    }\n                }\n            }\n        }\n\n        void splitPacket()\n        {\n            int length = rwpos_;\n\n            int rpos = 0;\n            do\n            {\n                if (length >= 4)\n                {\n                    ushort msgid = BitConverter.ToUInt16(rbuffer_, (int)rpos);\n                    uint msglen = BitConverter.ToUInt16(rbuffer_, (int)rpos + 2);\n\n                    ushort headlen = 4;\n\n                    if (msglen == 0xffff)\n                    {\n                        msglen = BitConverter.ToUInt32(rbuffer_, (int)rpos + 4);\n                        headlen += 4;\n                    }\n\n                    if (length - headlen >= msglen)\n                    {\n                        byte[] packet = new byte[msglen];\n                        Array.Copy(rbuffer_, rpos + headlen, packet, 0, msglen);\n\n                    //Message.handleMessage(msgid, packet);\n\t\t\t\t\thandleMessage_(msgid, new ByteArray(packet));\n\n                    rpos += (int)(headlen + msglen);\n                        length -= (int)(headlen + msglen);\n\n                    //Debug.LogFormat(\"recv packet {0}:{1}\", msgid, msglen);\n                }\n                    else\n                    {\n                    //Debug.LogFormat(\"splitPacket data length < msglen {0}:{1}>{2}\", msgid, msglen, length - headlen);\n                    break;\n                    }\n                }\n                else\n                {\n                //Debug.LogFormat(\"splitPacket data length {0} < 4\", length);\n                break;\n                }\n            } while (true);\n\n            if (length == 0)\n            {\n                rwpos_ = 0;\n            }\n            else\n            {\n                Array.Copy(rbuffer_, rpos, rbuffer_, 0, length);\n                rwpos_ = length;\n            }\n        }\n    }\n//}\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/Reactor.cs.meta",
    "content": "fileFormatVersion: 2\nguid: de44edbbf5c8b124bad84be3c1ff5b6f\ntimeCreated: 1470452694\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/ServerProxy.cs",
    "content": "﻿#region 模块信息\r\n\r\n/*----------------------------------------------------------------\r\n// 模块名：ServerProxy\r\n// 创建者：liwenfeng\r\n// 修改者列表：\r\n// 创建日期：2014.7.31\r\n// 模块描述：远程服务代理类\r\n//----------------------------------------------------------------*/\r\n\r\n#endregion\r\n/*\r\nusing System;\r\nusing System.Collections.Generic;\r\nusing System.IO;\r\nusing System.Net;\r\nusing System.Net.Sockets;\r\nusing ProtoBuf;\r\nusing ProtoBuf.Meta;\r\nusing UnityEngine;\r\n\r\nnamespace Game.Util\r\n{\r\n    public enum ReconnectType\r\n    {\r\n        background,\r\n        foreground\r\n    }\r\n    /// <summary>\r\n    /// 远程服务控制类。\r\n    /// </summary>\r\n    public class ServerProxy\r\n    {\r\n        public class ProtocolAtom : IComparable\r\n        {\r\n            public Int32 msg_id;\r\n            public Int32 count;\r\n            public Int32 traffic;\r\n            public int CompareTo(object obj)\r\n            {\r\n                ProtocolAtom b = (ProtocolAtom)obj;\r\n                if (this.traffic > b.traffic)\r\n                    return 0;\r\n                return 1;\r\n            }\r\n        }\r\n        private static ServerProxy mInstance;\r\n        protected NetworkInterface networkInterface;\r\n\r\n        protected int m_SerialNumber = 0;  // 前端消息序列号，通过心跳发送给服务器，服务器通过对比上一个序列号，从缓存队列中移除已被前端接收的消息\r\n        protected short m_MessageSerial = 0;  // 消息的序列号, 0 - 65535, 每发送一个消息递增加1, 用于服务器判断是否处理过，也用于判断中间是否存在消息丢失\r\n        public int totalSend = 0;\r\n        protected Queue<byte[]> m_MsgSaved = new Queue<byte[]>(); // 消息缓存队列\r\n        private bool reconnectFlag = false;  // 是否在重连的标志\r\n\r\n        private bool encode = false;   // 消息是否加密\r\n        private RC4Crypto encoder = new RC4Crypto();\r\n        private RC4Crypto decoder = new RC4Crypto();\r\n\r\n        public Action OnNetworkEnable;   // 恢复网络回调\r\n        public Action OnNetworkDisable;  // 网络不可连接回调\r\n\r\n        private long loginKey;\r\n        protected const int MSGID_LENGTH = 4;\r\n        private const int   RESERVE_SIZE = 2;\r\n        static Dictionary<Int32, Type> msgType = new Dictionary<Int32, Type>();\r\n\r\n        public bool collect = false;\r\n        public long collectTime = 0;\r\n        public Dictionary<Int32, ProtocolAtom> ProtocolCollect = new Dictionary<Int32, ProtocolAtom>();\r\n        \r\n        /// <summary>\r\n        /// 控制类实例。\r\n        /// </summary>\r\n        public static ServerProxy Instance\r\n        {\r\n            get\r\n            {\r\n                if (mInstance == null)\r\n                    mInstance = new ServerProxy();\r\n                return mInstance;\r\n            }\r\n        }\r\n        public void StartProtocolCollect()\r\n        {\r\n            ProtocolCollect.Clear();\r\n            collect = true;\r\n            collectTime = TimeHelper.TimeNow();\r\n        }\r\n        public void StopProtocolCollect()\r\n        {\r\n            collect = false;\r\n        }\r\n        public void PrintProtocolCollect()\r\n        {\r\n            if (!collect)\r\n                return;\r\n            string aiPointFile = Application.dataPath + \"/../ProtocolCollect.txt\";\r\n            double total = 0;\r\n            using (Stream stream = new FileStream(aiPointFile, FileMode.Create, FileAccess.Write))\r\n            {\r\n                List<ProtocolAtom> list = new List<ProtocolAtom>();\r\n                foreach (var atom in ProtocolCollect)\r\n                {\r\n                    list.Add((ProtocolAtom)atom.Value);\r\n                }\r\n                list.Sort();\r\n                string line;\r\n                for(int i = 0;i < list.Count; i++)\r\n                {\r\n                    total += list[i].traffic;\r\n                    line = string.Format(\"msg_id: {0}, count: {1}, traffic: {2}, mean: {3}\\n\", list[i].msg_id, list[i].count, list[i].traffic, list[i].traffic/list[i].count);\r\n                    stream.Write(System.Text.Encoding.Default.GetBytes(line), 0, line.Length);\r\n                }\r\n                total = total/1000.0f;\r\n                line = string.Format(\"total traffic: {0} k, mean: {1} k/s\", total, total*1000/(TimeHelper.TimeNow()-collectTime));\r\n                stream.Write(System.Text.Encoding.Default.GetBytes(line), 0, line.Length);\r\n            }\r\n        }\r\n        public NetworkInterface NetworkInterface\r\n        {\r\n            get { return networkInterface; }\r\n            set \r\n            { \r\n                networkInterface = value;\r\n            }\r\n        }\r\n        public int SerialNumber\r\n        {\r\n            get { return m_SerialNumber; }\r\n            set { m_SerialNumber = value; }\r\n        }\r\n        public ServerProxy()\r\n        {\r\n            networkInterface = new NetworkInterface();\r\n            networkInterface.OnDataReceive = OnDataReceive;\r\n            //EventDispatcher.Instance.AddEventListener(EventIdType.OnApplicationQuit, OnApplicationQuit);\r\n        }\r\n        public bool Encode\r\n        {\r\n            get { return encode; }\r\n            set { encode = value; }\r\n        }\r\n        public void SetKey(string pass)\r\n        {\r\n            encoder.SetKey(pass);\r\n            decoder.SetKey(pass);\r\n        }\r\n        public bool Connected\r\n        {\r\n            get\r\n            {\r\n                return networkInterface == null? false : networkInterface.valid();\r\n            }\r\n        }\r\n\r\n        /// <summary>\r\n        /// 限制了每帧 收包的数量。 \r\n        /// </summary>\r\n        private const ushort MAX_PACKETS_PER_FRAME = 5;\r\n        protected const int MAX_MSG_SAVED = 30;   // 最多缓冲的消息个数\r\n\r\n        private bool networkAvail = false;\r\n        public void Disconnect()\r\n        {\r\n            encode = false;\r\n            networkAvail = false;\r\n            if (networkInterface != null)\r\n                networkInterface.Close();\r\n            EventDispatcher.Instance.TriggerEvent(EventIdType.StopHeartBeatTimer);\r\n            LoggerHelper.Debug(\"disconnect.............\");\r\n        }\r\n\r\n        /// <summary>\r\n        /// 调用远程方法。\r\n        /// </summary>\r\n        public void SendMsg<T>(Int32 msgId, T data)\r\n        {\r\n            if (msgId != 10710 && msgId != 10100 && msgId != 10101)\r\n            {\r\n                LoggerHelper.Debug(\"----send:\" + msgId + \"----\");\r\n            }\r\n            try\r\n            {\r\n                byte[] result = packMessage<T>(msgId, data);\r\n                m_MessageSerial += 1;\r\n                totalSend += 1;\r\n                m_MsgSaved.Enqueue(result);  // 把消息缓存起来，直到收到服务器确认消息才从缓存中移除\r\n                if (!reconnectFlag)\r\n                {\r\n                    if (encode)\r\n                    {\r\n                        byte[] result1 = encoder.EncryptEx(result);\r\n                        networkInterface.Send(result1); // 进入发送队列等待发送\r\n                    }\r\n                    else\r\n                    {\r\n                        networkInterface.Send(result); // 进入发送队列等待发送\r\n                    }\r\n                }\r\n            }\r\n            catch (Exception ex)\r\n            {\r\n                LoggerHelper.Error(\"send msg error: \" + msgId + \" \" + ex.Message);\r\n            }\r\n        }\r\n\r\n        public void RawSendMsg<T>(Int32 msgId, T data)\r\n        {\r\n            byte[] result = packMessage<T>(msgId, data);\r\n            networkInterface.Send(result);\r\n        }\r\n\r\n        public void ResendSavedMsg()\r\n        {\r\n            Queue<byte[]>.Enumerator enumerator = m_MsgSaved.GetEnumerator();\r\n            while (enumerator.MoveNext())\r\n            {\r\n                if (encode)\r\n                {\r\n                    byte[] result = encoder.EncryptEx(enumerator.Current);\r\n                    networkInterface.Send(result);\r\n                }\r\n                else\r\n                {\r\n                    networkInterface.Send(enumerator.Current);\r\n                }\r\n            }\r\n        }\r\n        public void SavedMsgDequeue(int Count)\r\n        {\r\n            if (Count > 0 && m_MsgSaved.Count >= Count)\r\n            {\r\n                while (Count > 0)\r\n                {\r\n                    m_MsgSaved.Dequeue();\r\n                    Count--;\r\n                }\r\n            }\r\n        }\r\n        public void ClearSavedMsg()\r\n        {\r\n            m_MsgSaved.Clear();\r\n            m_MsgSaved.TrimExcess();\r\n        }\r\n        public void ResetMessageSerial()\r\n        {\r\n            m_MessageSerial = 0;\r\n            totalSend = 0;\r\n        }\r\n\r\n        private void CheckNetwork()\r\n        {\r\n            if (reconnectFlag)\r\n                return;\r\n            if (networkInterface.valid())\r\n            {\r\n                return;\r\n            }\r\n            else\r\n            {\r\n                Disconnect();\r\n                EventDispatcher.Instance.TriggerEvent(EventIdType.NetworkDisconnect, networkInterface);\r\n            }\r\n        }\r\n\r\n        public void Release()\r\n        {\r\n            LoggerHelper.Debug(\"ServerProxy Release\");\r\n            networkInterface.Close();\r\n        }\r\n        public void StartReceiveMsg()\r\n        {\r\n            networkAvail = true;\r\n        }\r\n        public void StopReceiveMsg()\r\n        {\r\n            networkAvail = false;\r\n        }\r\n        public bool ReConnectFlag\r\n        {\r\n            set {reconnectFlag = value;}\r\n        }\r\n        public void Update()\r\n        {\r\n            if (networkAvail && networkInterface != null)\r\n            {\r\n                CheckNetwork();\r\n                networkInterface.process();\r\n            }\r\n        }\r\n\r\n        public void OnDataReceive(byte[] data)\r\n        {\r\n            try\r\n            {\r\n                Int32 msg_id;\r\n                object msg;\r\n                if (encode)\r\n                {\r\n                    byte[] result = decoder.DecryptEx(data);\r\n                    msg = unPackMessage(result, out msg_id);\r\n                }\r\n                else\r\n                {\r\n                    msg = unPackMessage(data, out msg_id);\r\n                }\r\n                if (!reconnectFlag)\r\n                    m_SerialNumber++;\r\n                EventDispatcher.Instance.TriggerEvent<object>(msg_id, msg);\r\n            }\r\n            catch (Exception ex)\r\n            {\r\n                LoggerHelper.Except(ex);\r\n            }\r\n        }\r\n        private void OnApplicationQuit()\r\n        {\r\n            Release();\r\n        }\r\n        /// <summary>\r\n        /// 打包消息， TODO: 加密\r\n        /// </summary>\r\n        private byte[] packMessage<T>(Int32 msgId, T data)\r\n        {\r\n            MemoryStream streamBuff = new MemoryStream();\r\n            Serializer.Serialize<T>(streamBuff, data);\r\n            byte[] msg_id_bytes = BitConverter.GetBytes(IPAddress.HostToNetworkOrder(msgId));\r\n            byte[] serial_bytes = BitConverter.GetBytes(IPAddress.HostToNetworkOrder(m_MessageSerial));\r\n            // 计算消息长度\r\n            byte[] result = new byte[RESERVE_SIZE + serial_bytes.Length + msg_id_bytes.Length + streamBuff.Length];\r\n\r\n            if (result.Length > 2048)\r\n            {\r\n                LoggerHelper.Error(\"message large, id={0}, len={1} k\", msgId, result.Length / 1024.0f);\r\n            }\r\n            // 添加序列号\r\n            Buffer.BlockCopy(serial_bytes, 0, result, RESERVE_SIZE, serial_bytes.Length);\r\n            // 添加协议id\r\n            Buffer.BlockCopy(msg_id_bytes, 0, result, RESERVE_SIZE + serial_bytes.Length, msg_id_bytes.Length);\r\n\r\n            Buffer.BlockCopy(streamBuff.GetBuffer(), 0, result, RESERVE_SIZE + serial_bytes.Length + msg_id_bytes.Length,\r\n                    (int)streamBuff.Length);\r\n            return result;\r\n        }\r\n        /// <summary>\r\n        /// 消息解包， TODO: 解密\r\n        /// </summary>\r\n        private object unPackMessage(byte[] data, out Int32 msg_id)\r\n        {\r\n            msg_id = IPAddress.NetworkToHostOrder(BitConverter.ToInt32(data, RESERVE_SIZE));\r\n            int msg_type = msg_id / 100;\r\n            if (msg_id != 10710 && msg_id != 10101 && msg_id != 10100 && msg_id != 10201 && msg_id != 10208 && msg_type != 101 && msg_type != 106)\r\n            {\r\n                LoggerHelper.Debug(\"----receive:\" + msg_id + \"----\");\r\n            }\r\n            Type type;\r\n            if (!ServerProxy.msgType.TryGetValue(msg_id, out type))\r\n            {\r\n                type = typeof(ServerProxy).Assembly.GetType(\"msg.MSGS\" + msg_id);\r\n                ServerProxy.msgType.Add(msg_id, type);\r\n            }\r\n            if (collect)\r\n            {\r\n                ProtocolAtom atom;\r\n                if (!ProtocolCollect.TryGetValue(msg_id, out atom))\r\n                {\r\n                    atom = new ProtocolAtom();\r\n                    atom.msg_id = msg_id;\r\n                    ProtocolCollect.Add(msg_id, atom);\r\n                }\r\n                atom.count += 1;\r\n                atom.traffic += data.Length;\r\n            }\r\n            MemoryStream streamBuff = new MemoryStream(data, MSGID_LENGTH + RESERVE_SIZE, data.Length - RESERVE_SIZE - MSGID_LENGTH);\r\n            streamBuff.Position = 0;\r\n            object msg = RuntimeTypeModel.Default.Deserialize(streamBuff, null, type);\r\n            return msg;\r\n        }\r\n    }\r\n}\r\n*/"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/ServerProxy.cs.meta",
    "content": "fileFormatVersion: 2\nguid: b6decdc115bc3a343af597061288bcbd\ntimeCreated: 1493531995\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/TCPClientWorker.cs",
    "content": "﻿// 模块名   :  TCPClientWorker\r\n// 创建者   :  liwenfeng\r\n// 创建日期 :  2014-7-31\r\n// 描    述 :  客户端网络接收类\r\n\r\nusing System;\r\nusing System.Collections;\r\nusing System.Collections.Generic;\r\nusing System.IO;\r\nusing System.Net;\r\nusing System.Net.Sockets;\r\nusing System.Threading;\r\n\r\n\r\n    /// <summary>\r\n    ///TCP Client 类，用于异步收发包\r\n    ///做了并包处理\r\n    ///使用 .net TcpClient 实现\r\n    /// </summary>\r\n    public class TCPClientWorker\r\n    {\r\n        private readonly Queue<byte[]> m_sendQueue = new Queue<byte[]>();\r\n        private readonly Queue<byte[]> m_recvQueue = new Queue<byte[]>();\r\n        private const int MAX_SEND_BUFFER_SIZE = 4096;\r\n        private const int MAX_RECV_BUFFER_SIZE = 65535;\r\n\r\n        private const int HEAD_LENGTH = 4;\r\n\r\n        private readonly byte[] m_sendBuffer;\r\n        private byte[] m_sendLargeBuffer;\r\n        private readonly byte[] m_recvBuffer;\r\n        private int m_nRecvBufferSize = 0;\r\n        private Socket m_socket = null;\r\n\r\n        /// <summary>\r\n        /// 异步读取数据线程。\r\n        /// </summary>\r\n        private Thread m_receiveThread;\r\n\r\n        /// <summary>\r\n        /// 异步发送数据线程。\r\n        /// </summary>\r\n        private Thread m_sendThread;\r\n        /// <summary>\r\n        /// 接收数据队列同步锁。\r\n        /// </summary>\r\n        private readonly object m_recvQueueLocker = new object();\r\n\r\n        /// <summary>\r\n        /// 发送数据队列同步锁。\r\n        /// </summary>\r\n        private readonly object m_sendQueueLocker = new object();\r\n\r\n        /// <summary>\r\n        /// 网络通信同步锁。\r\n        /// </summary>\r\n        private readonly object m_tcpClientLocker = new object();\r\n\r\n        /// <summary>\r\n        /// 读取流数据量标记\r\n        /// </summary>\r\n        private Int32 bytesRead;\r\n\r\n        private bool m_asynSendSwitch = true;\r\n\r\n        public bool SocketValid = true;\r\n        public TCPClientWorker(Socket socket)\r\n        {\r\n            m_socket = socket;\r\n            this.m_sendBuffer = new byte[MAX_SEND_BUFFER_SIZE];\r\n            this.m_recvBuffer = new byte[MAX_RECV_BUFFER_SIZE];\r\n            StartSendThread();\r\n            StartReceiveThread();\r\n        }\r\n\r\n        private Thread StartReceiveThread()\r\n        {\r\n            UnityEngine.Debug.Log(\"start receive thread.........\");\r\n            m_receiveThread = new Thread(new ThreadStart(DoReceive));\r\n            m_receiveThread.IsBackground = true;\r\n            m_receiveThread.Start();\r\n            return m_receiveThread;\r\n        }\r\n\r\n        /// <summary>\r\n        /// 启动异步发送线程\r\n        /// </summary>\r\n        private Thread StartSendThread() {\r\n            UnityEngine.Debug.Log(\"start send thread.........\");\r\n            m_sendThread = new Thread(new ThreadStart(this.AsynSend));\r\n            m_sendThread.IsBackground = true;\r\n\r\n            if (!m_sendThread.IsAlive)\r\n            {\r\n                UnityEngine.Debug.Log(\"Start AsynSend: \" + this.m_asynSendSwitch);\r\n                m_sendThread.Start();\r\n            }\r\n            return m_sendThread;\r\n        }\r\n\r\n        /// <summary>\r\n        /// 提供给上层的发送函数。 仅将数据放入发送队列\r\n        /// </summary>\r\n        /// <param name=\"bytes\"></param>\r\n        public void Push(byte[] bytes)\r\n        {\r\n            lock (this.m_sendQueueLocker)\r\n                this.m_sendQueue.Enqueue(bytes);\r\n        }\r\n\r\n        /// <summary>\r\n        ///提供给上层的接受函数， 仅从接受队列获取一个数据包\r\n        ///空队列返回 null\r\n        /// </summary>\r\n        /// <returns></returns>\r\n        public byte[] Recv()\r\n        {\r\n            if (this.m_recvQueue.Count > 0)\r\n            {\r\n                byte[] res;\r\n                lock (this.m_recvQueueLocker)\r\n                    res = this.m_recvQueue.Dequeue();\r\n                return res;\r\n            }\r\n            else\r\n            {\r\n                return null;\r\n            }\r\n        }\r\n        /// <summary>\r\n        /// 关闭链接，由主线程调用\r\n        /// </summary>\r\n        public void Close()\r\n        {\r\n            // 清除发送消息队列\r\n            lock (this.m_sendQueueLocker)\r\n            {\r\n                this.m_sendQueue.Clear();\r\n                this.m_sendQueue.TrimExcess();\r\n            }\r\n            this.m_asynSendSwitch = false; //关闭发送死循环\r\n            this.m_sendThread = null;\r\n            this.m_receiveThread = null;\r\n            GC.Collect();\r\n        }\r\n        /// <summary>\r\n        /// 启动线程发送数据。\r\n        /// </summary>\r\n        private void AsynSend()\r\n        {\r\n            while (this.m_asynSendSwitch)\r\n            {\r\n                this.DoSend();\r\n                Thread.Sleep(20);\r\n            }\r\n        }\r\n\r\n        /// <summary>\r\n        /// 每帧调用， 发送数据。\r\n        /// 并包处理\r\n        /// </summary>\r\n        private void DoSend()\r\n        {\r\n            if ((this.m_socket == null) || (this.m_socket.Connected == false))\r\n            {\r\n                return;\r\n            }\r\n            int nTotalLength = 0;\r\n            int npack = 0;\r\n            // 并包\r\n            lock (this.m_sendQueueLocker)\r\n            {\r\n                while ((nTotalLength < MAX_SEND_BUFFER_SIZE) && this.m_sendQueue.Count > 0)\r\n                {\r\n                    byte[] packet = this.m_sendQueue.Peek();\r\n                    if (nTotalLength + HEAD_LENGTH + packet.Length < MAX_SEND_BUFFER_SIZE)\r\n                    {\r\n\t\t\t\t\t/*\r\n                        //message struct: length(4 bytes), reserve(2 bytes), packet data\r\n                        //packet data:  serial(2 bytes), msg data[msg_id(4 bytes), protobuff data]\r\n                        byte[] length = BitConverter.GetBytes(IPAddress.HostToNetworkOrder(packet.Length));\r\n                        length.CopyTo(this.m_sendBuffer, nTotalLength);\r\n                        nTotalLength += HEAD_LENGTH;\r\n                        packet.CopyTo(this.m_sendBuffer, nTotalLength);\r\n                        nTotalLength += packet.Length;\r\n\t\t\t\t\t*/\r\n\t\t\t\t\tBuffer.BlockCopy (packet, 0, this.m_sendBuffer, nTotalLength,packet.Length);\r\n\t\t\t\t\t\tnTotalLength += packet.Length;\r\n                        this.m_sendQueue.Dequeue();\r\n                        npack++;\r\n                    }\r\n                    else if (npack == 0)\r\n                    {\r\n                        m_sendLargeBuffer = new byte[HEAD_LENGTH + packet.Length];\r\n                        /*\r\n\t\t\t\t\t\tbyte[] length = BitConverter.GetBytes(IPAddress.HostToNetworkOrder(packet.Length));\r\n                        length.CopyTo(m_sendLargeBuffer, nTotalLength);\r\n                        nTotalLength += HEAD_LENGTH;\r\n                        packet.CopyTo(m_sendLargeBuffer, nTotalLength);\r\n                        nTotalLength += packet.Length;\r\n                        */\r\n\t\t\t\t\tBuffer.BlockCopy (packet, 0, m_sendLargeBuffer, nTotalLength,packet.Length);\r\n\t\t\t\t\t\tnTotalLength += packet.Length;\r\n                        this.m_sendQueue.Dequeue();\r\n                    }\r\n                    else\r\n                    {\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n            if (nTotalLength > 0)\r\n            {\r\n                // 发送数据\r\n                try\r\n                {\r\n                    int ret;\r\n                    if (nTotalLength < MAX_SEND_BUFFER_SIZE)\r\n                    {\r\n                        ret = this.m_socket.Send(this.m_sendBuffer, 0, nTotalLength, SocketFlags.None);\r\n                    }\r\n                    else\r\n                    {\r\n                        ret = this.m_socket.Send(this.m_sendLargeBuffer, 0, nTotalLength, SocketFlags.None);\r\n                    }\r\n                    if (ret != nTotalLength)\r\n                    {\r\n\t\t\t\t\tUnityEngine.Debug.LogFormat(\"socket send data, len={0}, send_len={1}\", nTotalLength, ret);\r\n                    }\r\n                }\r\n                catch (Exception)\r\n                {\r\n                    SocketValid = false;\r\n                }\r\n            }\r\n        }\r\n\r\n        private void DoReceive()\r\n        {\r\n            int zero_count = 0;\r\n            int timeout = 0;\r\n            //读取流\r\n            do\r\n            {\r\n                this.bytesRead = 0;\r\n                try\r\n                {\r\n                    int size = MAX_RECV_BUFFER_SIZE - this.m_nRecvBufferSize;\r\n                    if (size > 0)\r\n                    {\r\n                        this.bytesRead = this.m_socket.Receive(this.m_recvBuffer,\r\n                                this.m_nRecvBufferSize, size, SocketFlags.None);\r\n                        this.m_nRecvBufferSize += this.bytesRead;\r\n                        if (this.bytesRead == 0)\r\n                        {\r\n                            //读的长度为0\r\n                            zero_count++;\r\n                            if (zero_count < 3)\r\n                            {\r\n                                this.bytesRead = 1;\r\n                            }\r\n                        }\r\n                        else\r\n                        {\r\n                            timeout = 0;\r\n                            zero_count = 0;\r\n                        }\r\n                    }\r\n                    else\r\n                    {\r\n                        this.bytesRead = 1; //缓存不够时继续循环，后面会对缓存数据进行处理\r\n\t\t\t\t\t\tUnityEngine.Debug.Log(\"buffer not enough\");\r\n                    }\r\n                    this.SplitPackets();\r\n                }\r\n                catch (SocketException e)\r\n                {\r\n                    if (e.SocketErrorCode == System.Net.Sockets.SocketError.TimedOut && timeout < 1)\r\n                    {\r\n\t\t\t\t\tUnityEngine.Debug.LogFormat(\"socket timeout {0}\", timeout);\r\n                        timeout++;\r\n                        this.bytesRead = 1;\r\n                    }\r\n                }\r\n                catch (Exception)\r\n                {\r\n                    this.bytesRead = 0;\r\n                }\r\n            }\r\n            while (this.bytesRead > 0);\r\n            SocketValid = false;\r\n\t\t\tUnityEngine.Debug.Log(\"DataReceive Thread Exit........\");\r\n        }\r\n\r\n        /// <summary>\r\n        /// 从RecvBuffer 中切分出多个Packets, 不足一个 Packet 的部分， 存留在 Buffer 中留待下次Split\r\n        /// </summary>\r\n        private void SplitPackets()\r\n        {\r\n            int offset = 0;\r\n            while (this.m_nRecvBufferSize > HEAD_LENGTH)\r\n            {\r\n\t\t\t\tint nLength = BitConverter.ToInt32(this.m_recvBuffer, offset + 1 + 4);\r\n                //offset += HEAD_LENGTH;\r\n                //int nLength = IPAddress.NetworkToHostOrder(len);\r\n                //UnityEngine.Debug.Log(\"receive msg, length: \" + nLength);\r\n                if (this.m_nRecvBufferSize >= nLength + 4 +  HEAD_LENGTH + 1)\r\n                {\r\n                    int packageLength = nLength + 4 +4 + 1;\r\n\t\t\t\t\tbyte[] packet = new byte[packageLength];\r\n\t\t\t\t\tBuffer.BlockCopy(this.m_recvBuffer, offset, packet, 0, packageLength);\r\n                    lock (this.m_recvQueueLocker) //此处理为独立线程处理，需加锁，否则会出现丢包\r\n                    {\r\n                        this.m_recvQueue.Enqueue(packet);\r\n                    }\r\n\t\t\t\t\tthis.m_nRecvBufferSize -= packageLength;\r\n\t\t\t\t\toffset += packageLength;\r\n                }\r\n                else\r\n                {\r\n                    //offset -= HEAD_LENGTH; //需要调整偏移\r\n                    break;\r\n                }\r\n            }\r\n            // 整理 RecvBuffer， 将buffer内容前移\r\n            Buffer.BlockCopy(this.m_recvBuffer, offset, this.m_recvBuffer, 0,\r\n                    this.m_nRecvBufferSize);\r\n        }\r\n    }\r\n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net/TCPClientWorker.cs.meta",
    "content": "fileFormatVersion: 2\nguid: f576bfd2e3ff40841a213b088c161184\ntimeCreated: 1493531995\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts/Net.meta",
    "content": "fileFormatVersion: 2\nguid: 7e8566cce6509274ab3fd2d8e1a2727f\nfolderAsset: yes\ntimeCreated: 1470452684\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources/Scripts.meta",
    "content": "fileFormatVersion: 2\r\nguid: ee728a4ba567f4a55a657599fe6c2022\r\nfolderAsset: yes\r\ntimeCreated: 1449290835\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game/Resources/config.txt",
    "content": "<Root>\n\t<Debug>1</Debug>\n\t<HotFix>0</HotFix>\n\t<ShowFps>1</ShowFps>\n\t<Encrypt>1</Encrypt>\n\t<ResUrl>http://192.168.1.100/down</ResUrl>\n\t<Ip>127.0.0.1</Ip>\n\t<Port>6666</Port>\n</Root>"
  },
  {
    "path": "Assets/Game/Resources/config.txt.meta",
    "content": "fileFormatVersion: 2\nguid: d32ff4667e75e2445bd887ceb547b066\ntimeCreated: 1463972294\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Game/Resources.meta",
    "content": "fileFormatVersion: 2\r\nguid: 2c3ff3c1907a94a5aa1d9ca4f5662f29\r\nfolderAsset: yes\r\ntimeCreated: 1449290807\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Game.meta",
    "content": "fileFormatVersion: 2\r\nguid: f674dbce76d0dd24e90870e3129a3f20\r\nfolderAsset: yes\r\ntimeCreated: 1454504597\r\nlicenseType: Free\r\nDefaultImporter:\r\n  userData: \r\n  assetBundleName: \r\n  assetBundleVariant: \r\n"
  },
  {
    "path": "Assets/Plugins/Android/libs/armeabi-v7a/libslua.so.meta",
    "content": "fileFormatVersion: 2\nguid: 3654b3b9ebee86c49ab7023264352051\ntimeCreated: 1427439047\nlicenseType: Free\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Android:\n      enabled: 1\n      settings:\n        CPU: ARMv7\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 0\n      settings:\n        DefaultValueInitialized: true\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Android/libs/armeabi-v7a.meta",
    "content": "fileFormatVersion: 2\nguid: 7e868fbf0916e5540b24a2f0bb6e0159\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Android/libs/x86/libslua.so.meta",
    "content": "fileFormatVersion: 2\nguid: 80385fd472b086344b371d1f955460ee\ntimeCreated: 1427439047\nlicenseType: Free\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Android:\n      enabled: 1\n      settings:\n        CPU: x86\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 0\n      settings:\n        DefaultValueInitialized: true\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Android/libs/x86.meta",
    "content": "fileFormatVersion: 2\nguid: 4e09bad7e14d4054d82460e37ee8899e\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Android/libs.meta",
    "content": "fileFormatVersion: 2\nguid: 5966093daaa6df049bfd35f4fcb4fbb4\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Android.meta",
    "content": "fileFormatVersion: 2\nguid: 61b173472593f4b86a97155985750ac2\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/ILeanTween.cs",
    "content": "﻿using System;\nusing UnityEngine;\n\npublic interface ILeanTween\n{\n\tvoid removeTween( int i, int uniqueId);\n\tvoid removeTween( int i );\n\tVector3[] add(Vector3[] a, Vector3 b);\n\tfloat closestRot( float from, float to );\n\tvoid cancelAll();\n\tvoid cancelAll(bool callComplete);\n\tvoid cancel( GameObject gameObject );\n\tvoid cancel( GameObject gameObject, bool callOnComplete );\n\tvoid cancel( GameObject gameObject, int uniqueId );\n\tvoid cancel( LTRect ltRect, int uniqueId );\n\tvoid cancel( int uniqueId );\n\tvoid cancel( int uniqueId, bool callOnComplete );\n\tLTDescr descr( int uniqueId );\n\tLTDescr description( int uniqueId );\n\tLTDescr[] descriptions(GameObject gameObject = null);\n\tvoid pause( int uniqueId );\n\tvoid pause( GameObject gameObject );\n\tvoid pauseAll();\n\tvoid resumeAll();\n\tvoid resume( int uniqueId );\n\tvoid resume( GameObject gameObject );\n\tbool isTweening( GameObject gameObject = null );\n\tbool isTweening( int uniqueId );\n\tbool isTweening( LTRect ltRect );\n\tvoid drawBezierPath(Vector3 a, Vector3 b, Vector3 c, Vector3 d, float arrowSize = 0.0f, Transform arrowTransform = null);\n\tLTDescr options(LTDescr seed);\n\tLTDescr options();\n\tGameObject tweenEmpty { get; }\n\tLTDescr alpha(GameObject gameObject, float to, float time);\n\tLTDescr alpha(LTRect ltRect, float to, float time);\n\tLTDescr alphaVertex(GameObject gameObject, float to, float time);\n\tLTDescr color(GameObject gameObject, Color to, float time);\n\tLTDescr delayedCall( float delayTime, Action callback);\n\tLTDescr delayedCall( float delayTime, Action<object> callback);\n\tLTDescr delayedCall( GameObject gameObject, float delayTime, Action callback);\n\tLTDescr delayedCall( GameObject gameObject, float delayTime, Action<object> callback);\n\tLTDescr destroyAfter( LTRect rect, float delayTime);\n\tLTDescr move(GameObject gameObject, Vector3 to, float time);\n\tLTDescr move(GameObject gameObject, Vector2 to, float time);\n\tLTDescr move(GameObject gameObject, Vector3[] to, float time);\n\tLTDescr move(GameObject gameObject, LTBezierPath to, float time);\n\tLTDescr move(GameObject gameObject, LTSpline to, float time);\n\tLTDescr moveSpline(GameObject gameObject, Vector3[] to, float time);\n\tLTDescr moveSplineLocal(GameObject gameObject, Vector3[] to, float time);\n\tLTDescr move(LTRect ltRect, Vector2 to, float time);\n\tLTDescr moveMargin(LTRect ltRect, Vector2 to, float time);\n\tLTDescr moveX(GameObject gameObject, float to, float time);\n\tLTDescr moveY(GameObject gameObject, float to, float time);\n\tLTDescr moveZ(GameObject gameObject, float to, float time);\n\tLTDescr moveLocal(GameObject gameObject, Vector3 to, float time);\n\tLTDescr moveLocal(GameObject gameObject, Vector3[] to, float time);\n\tLTDescr moveLocalX(GameObject gameObject, float to, float time);\n\tLTDescr moveLocalY(GameObject gameObject, float to, float time);\n\tLTDescr moveLocalZ(GameObject gameObject, float to, float time);\n\tLTDescr moveLocal(GameObject gameObject, LTBezierPath to, float time);\n\tLTDescr moveLocal(GameObject gameObject, LTSpline to, float time);\n\tLTDescr move(GameObject gameObject, Transform to, float time);\n\tLTDescr rotate(GameObject gameObject, Vector3 to, float time);\n\tLTDescr rotate(LTRect ltRect, float to, float time);\n\tLTDescr rotateLocal(GameObject gameObject, Vector3 to, float time);\n\tLTDescr rotateX(GameObject gameObject, float to, float time);\n\tLTDescr rotateY(GameObject gameObject, float to, float time);\n\tLTDescr rotateZ(GameObject gameObject, float to, float time);\n\tLTDescr rotateAround(GameObject gameObject, Vector3 axis, float add, float time);\n\tLTDescr rotateAroundLocal(GameObject gameObject, Vector3 axis, float add, float time);\n\tLTDescr scale(GameObject gameObject, Vector3 to, float time);\n\tLTDescr scale(LTRect ltRect, Vector2 to, float time);\n\tLTDescr scaleX(GameObject gameObject, float to, float time);\n\tLTDescr scaleY(GameObject gameObject, float to, float time);\n\tLTDescr scaleZ(GameObject gameObject, float to, float time);\n\tLTDescr value(GameObject gameObject, float from, float to, float time);\n\tLTDescr value(GameObject gameObject, Vector2 from, Vector2 to, float time);\n\tLTDescr value(GameObject gameObject, Vector3 from, Vector3 to, float time);\n\tLTDescr value(GameObject gameObject, Color from, Color to, float time);\n\tLTDescr value(GameObject gameObject, Action<float> callOnUpdate, float from, float to, float time);\n\tLTDescr value(GameObject gameObject, Action<float, float> callOnUpdateRatio, float from, float to, float time);\n\tLTDescr value(GameObject gameObject, Action<Color> callOnUpdate, Color from, Color to, float time);\n\tLTDescr value(GameObject gameObject, Action<Vector2> callOnUpdate, Vector2 from, Vector2 to, float time);\n\tLTDescr value(GameObject gameObject, Action<Vector3> callOnUpdate, Vector3 from, Vector3 to, float time);\n\tLTDescr value(GameObject gameObject, Action<float,object> callOnUpdate, float from, float to, float time);\n\tLTDescr delayedSound( AudioClip audio, Vector3 pos, float volume );\n\tLTDescr delayedSound( GameObject gameObject, AudioClip audio, Vector3 pos, float volume );\n\n\t\t\n\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\tLTDescr play(RectTransform rectTransform, UnityEngine.Sprite[] sprites);\n\tLTDescr textAlpha(RectTransform rectTransform, float to, float time);\n\tLTDescr textColor(RectTransform rectTransform, Color to, float time);\n\tLTDescr move(RectTransform rectTrans, Vector3 to, float time);\n\tLTDescr moveX(RectTransform rectTrans, float to, float time);\n\tLTDescr moveY(RectTransform rectTrans, float to, float time);\n\tLTDescr moveZ(RectTransform rectTrans, float to, float time);\n\tLTDescr rotate(RectTransform rectTrans, float to, float time);\n\tLTDescr rotateAround(RectTransform rectTrans, Vector3 axis, float to, float time);\n\tLTDescr rotateAroundLocal(RectTransform rectTrans, Vector3 axis, float to, float time);\n\tLTDescr scale(RectTransform rectTrans, Vector3 to, float time);\n\tLTDescr alpha(RectTransform rectTrans, float to, float time);\n\tLTDescr color(RectTransform rectTrans, Color to, float time);\n\t#endif\n}\n\n"
  },
  {
    "path": "Assets/Plugins/ILeanTween.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 6d4e3a5bf10fd814ab6910a889e71826\ntimeCreated: 1494228456\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/LTDescr.cs",
    "content": "﻿using System;\nusing UnityEngine;\n\npublic interface LTDescr\n{\n\tbool toggle { get; set; }\n\tbool useEstimatedTime { get; set; }\n\tbool useFrames { get; set; }\n\tbool useManualTime { get; set; }\n\tbool hasInitiliazed { get; set; }\n\tbool hasPhysics { get; set; }\n\tbool onCompleteOnRepeat { get; set; }\n\tbool onCompleteOnStart { get; set; }\n\tfloat passed { get; set; }\n\tfloat delay { get; set; }\n\tfloat time { get; set; }\n\tfloat lastVal { get; set; }\n\tint loopCount { get; set; }\n\tuint counter { get; set; }\n\tfloat direction { get; set; }\n\tfloat directionLast { get; set; }\n\tfloat overshoot { get; set; }\n\tfloat period { get; set; }\n\tbool destroyOnComplete { get; set; }\n\tTransform trans { get; set; }\n\tTransform toTrans { get; set; }\n\tLTRect ltRect { get; set; }\n\tVector3 from { get; set; }\n\tVector3 to { get; set; }\n\tVector3 diff { get; set; }\n\tVector3 point { get; set; }\n\tVector3 axis { get; set; }\n\tQuaternion origRotation { get; set; }\n\tLTBezierPath path { get; set; }\n\tLTSpline spline { get; set; }\n\tTweenAction type { get; set; }\n\tLeanTweenType tweenType { get; set; }\n\tAnimationCurve animationCurve { get; set; }\n\tLeanTweenType loopType { get; set; }\n\tbool hasUpdateCallback { get; set; }\n\tAction<float> onUpdateFloat { get; set; }\n    Action<float,float> onUpdateFloatRatio { get; set; }\n\tAction<float,object> onUpdateFloatObject { get; set; }\n\tAction<Vector2> onUpdateVector2 { get; set; }\n\tAction<Vector3> onUpdateVector3 { get; set; }\n\tAction<Vector3,object> onUpdateVector3Object { get; set; }\n\tAction<Color> onUpdateColor { get; set; }\n\tAction onComplete { get; set; }\n\tAction<object> onCompleteObject { get; set; }\n\tobject onCompleteParam { get; set; }\n\tobject onUpdateParam { get; set; }\n\tAction onStart { get; set; }\n\t[System.Obsolete(\"Use 'LeanTween.cancel( id )' instead\")]\n\tLTDescr cancel(UnityEngine.GameObject gameObject);\n\tvoid cleanup();\n\tint uniqueId { get; }\n\tint id { get; }\n\tvoid init();\n\tLTDescr pause();\n\tvoid reset();\n\tLTDescr resume();\n\tLTDescr setAudio(object audio);\n\tLTDescr setAxis(UnityEngine.Vector3 axis);\n\tLTDescr setDelay(float delay);\n\tLTDescr setDestroyOnComplete(bool doesDestroy);\n\tLTDescr setDiff(UnityEngine.Vector3 diff);\n\tLTDescr setDirection(float direction);\n\tLTDescr setEase(LeanTweenType easeType);\n\tLTDescr setEase(UnityEngine.AnimationCurve easeCurve);\n\tLTDescr setFrom(float from);\n\tLTDescr setFrom(UnityEngine.Vector3 from);\n\tLTDescr setFromColor(UnityEngine.Color col);\n\tLTDescr setHasInitialized(bool has);\n\tLTDescr setId(uint id);\n\tLTDescr setIgnoreTimeScale(bool useUnScaledTime);\n\tLTDescr setLoopClamp();\n\tLTDescr setLoopClamp(int loops);\n\tLTDescr setLoopCount(int loopCount);\n\tLTDescr setLoopOnce();\n\tLTDescr setLoopPingPong();\n\tLTDescr setLoopPingPong(int loops);\n\tLTDescr setLoopType(LeanTweenType loopType);\n\tLTDescr setOnComplete(Action onComplete);\n\tLTDescr setOnComplete(Action<object> onComplete);\n\tLTDescr setOnComplete(Action<object> onComplete, object onCompleteParam);\n\tLTDescr setOnCompleteOnRepeat(bool isOn);\n\tLTDescr setOnCompleteOnStart(bool isOn);\n\tLTDescr setOnCompleteParam(object onCompleteParam);\n\tLTDescr setOnStart(Action onStart);\n\tLTDescr setOnUpdate(Action<float, object> onUpdate, object onUpdateParam = null);\n\tLTDescr setOnUpdate(Action<float> onUpdate);\n\tLTDescr setOnUpdate(Action<UnityEngine.Color> onUpdate);\n\tLTDescr setOnUpdate(Action<UnityEngine.Vector2> onUpdate, object onUpdateParam = null);\n\tLTDescr setOnUpdate(Action<UnityEngine.Vector3, object> onUpdate, object onUpdateParam = null);\n\tLTDescr setOnUpdate(Action<UnityEngine.Vector3> onUpdate, object onUpdateParam = null);\n\tLTDescr setOnUpdateColor(Action<UnityEngine.Color> onUpdate);\n\tLTDescr setOnUpdateObject(Action<float, object> onUpdate);\n\tLTDescr setOnUpdateParam(object onUpdateParam);\n\tLTDescr setOnUpdateRatio(Action<float, float> onUpdate);\n\tLTDescr setOnUpdateVector2(Action<UnityEngine.Vector2> onUpdate);\n\tLTDescr setOnUpdateVector3(Action<UnityEngine.Vector3> onUpdate);\n\tLTDescr setOrientToPath(bool doesOrient);\n\tLTDescr setOrientToPath2d(bool doesOrient2d);\n\tLTDescr setOvershoot(float overshoot);\n\tLTDescr setPath(LTBezierPath path);\n\tLTDescr setPeriod(float period);\n\tLTDescr setPoint(UnityEngine.Vector3 point);\n\tLTDescr setRect(LTRect rect);\n\tLTDescr setRect(UnityEngine.Rect rect);\n\tLTDescr setRepeat(int repeat);\n\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\tLTDescr setRect(UnityEngine.RectTransform rect);\n\tLTDescr setSprites(UnityEngine.Sprite[] sprites);\n\tLTDescr setFrameRate(float frameRate);\n\t#endif\n\tLTDescr setTime(float time);\n\tLTDescr setTo(UnityEngine.Transform to);\n\tLTDescr setTo(UnityEngine.Vector3 to);\n\tLTDescr setUseEstimatedTime(bool useEstimatedTime);\n\tLTDescr setUseFrames(bool useFrames);\n\tLTDescr setUseManualTime(bool useManualTime);\n\tstring ToString();\n}\n\n"
  },
  {
    "path": "Assets/Plugins/LTDescr.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 76f6a2d3084e1784297b7ccd7667d503\ntimeCreated: 1494228456\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/LeanAudio.cs",
    "content": "\nusing UnityEngine;\nusing System.Collections.Generic;\n\npublic class LeanAudioStream {\n\n\tpublic int position = 0;\n\n\tpublic AudioClip audioClip;\n\tpublic float[] audioArr;\n\n\tpublic LeanAudioStream( float[] audioArr ){\n\t\tthis.audioArr = audioArr;\n\t}\n\n\tpublic void OnAudioRead(float[] data) {\n        int count = 0;\n        while (count < data.Length) {\n            data[count] = audioArr[this.position];\n            position++;\n            count++;\n        }\n    }\n\n    public void OnAudioSetPosition(int newPosition) {\n    \tthis.position = newPosition;   \n    }\n}\n\n/**\n* Create Audio dynamically and easily playback\n*\n* @class LeanAudio\n* @constructor\n*/\npublic class LeanAudio : object {\n\n\tpublic static float MIN_FREQEUNCY_PERIOD = 0.000115f;\n\tpublic static int PROCESSING_ITERATIONS_MAX = 50000;\n\tpublic static float[] generatedWaveDistances;\n\tpublic static int generatedWaveDistancesCount = 0;\n\n\tprivate static float[] longList;\n\n\tpublic static LeanAudioOptions options(){\n\t\tif(generatedWaveDistances==null){\n\t\t\tgeneratedWaveDistances = new float[ PROCESSING_ITERATIONS_MAX ];\n\t\t\tlongList = new float[ PROCESSING_ITERATIONS_MAX ];\n\t\t}\n\t\treturn new LeanAudioOptions();\n\t}\n\n\tpublic static LeanAudioStream createAudioStream( AnimationCurve volume, AnimationCurve frequency, LeanAudioOptions options = null ){\n\t\tif(options==null)\n\t\t\toptions = new LeanAudioOptions();\n\n\t\toptions.useSetData = false;\n\n\t\tint generatedWavePtsLength = createAudioWave( volume, frequency, options);\n\t\tcreateAudioFromWave( generatedWavePtsLength, options );\n\n\t\treturn options.stream;\n\t}\n\n\t/**\n\t* Create dynamic audio from a set of Animation Curves and other options.\n\t* \n\t* @method createAudio\n\t* @param {AnimationCurve} volumeCurve:AnimationCurve describing the shape of the audios volume (from 0-1). The length of the audio is dicated by the end value here.\n\t* @param {AnimationCurve} frequencyCurve:AnimationCurve describing the width of the oscillations between the sound waves in seconds. Large numbers mean a lower note, while higher numbers mean a tighter frequency and therefor a higher note. Values are usually between 0.01 and 0.000001 (or smaller)\n\t* @param {LeanAudioOptions} options:LeanAudioOptions You can pass any other values in here like vibrato or the frequency you would like the sound to be encoded at. See <a href=\"LeanAudioOptions.html\">LeanAudioOptions</a> for more details.\n\t* @return {AudioClip} AudioClip of the procedurally generated audio\n\t* @example\n\t* AnimationCurve volumeCurve = new AnimationCurve( new Keyframe(0f, 1f, 0f, -1f), new Keyframe(1f, 0f, -1f, 0f));<br>\n\t* AnimationCurve frequencyCurve = new AnimationCurve( new Keyframe(0f, 0.003f, 0f, 0f), new Keyframe(1f, 0.003f, 0f, 0f));<br>\n\t* AudioClip audioClip = LeanAudio.createAudio(volumeCurve, frequencyCurve, LeanAudio.options().setVibrato( new Vector3[]{ new Vector3(0.32f,0f,0f)} ));<br>\n\t*/\n\tpublic static AudioClip createAudio( AnimationCurve volume, AnimationCurve frequency, LeanAudioOptions options = null ){\n\t\tif(options==null)\n\t\t\toptions = new LeanAudioOptions();\n\t\t\n\t\tint generatedWavePtsLength = createAudioWave( volume, frequency, options);\n\t\t// Debug.Log(\"generatedWavePtsLength:\"+generatedWavePtsLength);\n\t\treturn createAudioFromWave( generatedWavePtsLength, options );\n\t}\n\n\tprivate static int createAudioWave( AnimationCurve volume, AnimationCurve frequency, LeanAudioOptions options ){\n\t\tfloat time = volume[ volume.length - 1 ].time;\n\t\tint listLength = 0;\n\t\t// List<float> list = new List<float>();\n\n\t\t// generatedWaveDistances = new List<float>();\n\t\t// float[] vibratoValues = new float[ vibrato.Length ];\n\t\tfloat passed = 0f;\n\t\tfor(int i = 0; i < PROCESSING_ITERATIONS_MAX; i++){\n\t\t\tfloat f = frequency.Evaluate(passed);\n\t\t\tif(f<MIN_FREQEUNCY_PERIOD)\n\t\t\t\tf = MIN_FREQEUNCY_PERIOD;\n\t\t\tfloat height = volume.Evaluate(passed + 0.5f*f);\n\t\t\tif(options.vibrato!=null){\n\t\t\t\tfor(int j=0; j<options.vibrato.Length; j++){\n\t\t\t\t\tfloat peakMulti = Mathf.Abs( Mathf.Sin( 1.5708f + passed * (1f/options.vibrato[j][0]) * Mathf.PI ) );\n\t\t\t\t\tfloat diff = (1f-options.vibrato[j][1]);\n\t\t\t\t\tpeakMulti = options.vibrato[j][1] + diff*peakMulti;\n\t\t\t\t\theight *= peakMulti;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\t// Debug.Log(\"i:\"+i+\" f:\"+f+\" passed:\"+passed+\" height:\"+height+\" time:\"+time);\n\t\t\tif(passed + 0.5f*f>=time)\n\t\t\t\tbreak;\n\t\t\tif(listLength >= PROCESSING_ITERATIONS_MAX-1){\n\t\t\t\tDebug.LogError(\"LeanAudio has reached it's processing cap. To avoid this error increase the number of iterations ex: LeanAudio.PROCESSING_ITERATIONS_MAX = \"+(PROCESSING_ITERATIONS_MAX*2));\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\t\tgeneratedWaveDistances[ listLength / 2 ] = f;\n\t\t\t\t//generatedWaveDistances.Add( f );\n\t\t\t\tpassed += f;\n\n\t\t\t\t//list.Add( passed );\n\t\t\t\t//list.Add( i%2==0 ? -height : height );\n\n\t\t\t\tlongList[ listLength ] = passed;\n\t\t\t\tlongList[ listLength + 1 ] = i%2==0 ? -height : height;\n\t\t\t}\n\n\t\t\t\n\n\t\t\tlistLength += 2;\n\t\t\t\n\t\t}\n\n\t\tlistLength += -2;\n\t\tgeneratedWaveDistancesCount = listLength / 2;\n\t\t/*float[] wave = new float[ listLength ];\n\t\tfor(int i = 0; i < wave.Length; i++){\n\t\t\twave[i] = longList[i];\n\t\t}*/\n\t\treturn listLength;\n\t}\n\n\tprivate static AudioClip createAudioFromWave( int waveLength, LeanAudioOptions options ){\n\t\tfloat time = longList[ waveLength - 2 ];\n\t\tfloat[] audioArr = new float[ (int)(options.frequencyRate*time) ];\n\n\t\tint waveIter = 0;\n\t\tfloat subWaveDiff = longList[waveIter];\n\t\tfloat subWaveTimeLast = 0f;\n\t\tfloat subWaveTime = longList[waveIter];\n\t\tfloat waveHeight = longList[waveIter+1];\n\t\tfor(int i = 0; i < audioArr.Length; i++){\n\t\t\tfloat passedTime = (float)i / (float)options.frequencyRate;\n\t\t\tif(passedTime > longList[waveIter] ){\n\t\t\t\tsubWaveTimeLast = longList[waveIter];\n\t\t\t\twaveIter += 2;\n\t\t\t\tsubWaveDiff = longList[waveIter] - longList[waveIter-2];\n\t\t\t\twaveHeight = longList[waveIter+1];\n\t\t\t\t// Debug.Log(\"passed wave i:\"+i);\n\t\t\t}\n\t\t\tsubWaveTime = passedTime - subWaveTimeLast;\n\t\t\tfloat ratioElapsed = subWaveTime / subWaveDiff;\n\n\t\t\tfloat value = Mathf.Sin( ratioElapsed * Mathf.PI );\n\t\t\t//if(i<25)\n\t\t\t//\tDebug.Log(\"passedTime:\"+passedTime+\" value:\"+value+\" ratioElapsed:\"+ratioElapsed+\" subWaveTime:\"+subWaveTime+\" subWaveDiff:\"+subWaveDiff);\n\t\t\t\n\t\t\tvalue *= waveHeight;\n\n\t\t\taudioArr[i] = value;\n\t\t\t// Debug.Log(\"pt:\"+pt+\" i:\"+i+\" val:\"+audioArr[i]+\" len:\"+audioArr.Length);\n\t\t}\n\n\t\t\n\t\tint lengthSamples = audioArr.Length;\n\t\t\n\t\t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2 || UNITY_4_3 || UNITY_4_5 || UNITY_4_6\n\t\tbool is3dSound = false;\n\t\tAudioClip audioClip = AudioClip.Create(\"Generated Audio\", lengthSamples, 1, options.frequencyRate, is3dSound, false);\n\t\t#else\n\t\tAudioClip audioClip = null;\n\t\tif(options.useSetData){\n\t\t\taudioClip = AudioClip.Create(\"Generated Audio\", lengthSamples, 1, options.frequencyRate, false, null, OnAudioSetPosition);\n\t\t\taudioClip.SetData(audioArr, 0);\n\t\t}else{\n\t\t\toptions.stream = new LeanAudioStream(audioArr);\n\t\t\tDebug.Log(\"len:\"+audioArr.Length+\" lengthSamples:\"+lengthSamples+\" freqRate:\"+options.frequencyRate);\n\t\t\taudioClip = AudioClip.Create(\"Generated Audio\", lengthSamples, 1, options.frequencyRate, false, options.stream.OnAudioRead, options.stream.OnAudioSetPosition);\n\t\t\toptions.stream.audioClip = audioClip;\n\t\t}\n\t\t\n\t\t#endif\n\n\t\treturn audioClip;\n\t}\n\n\tprivate static void OnAudioSetPosition(int newPosition) {\n        \n    }\n\n\tpublic static AudioClip generateAudioFromCurve( AnimationCurve curve, int frequencyRate = 44100 ){\n\t\tfloat curveTime = curve[ curve.length - 1 ].time;\n\t\tfloat time = curveTime;\n\t\tfloat[] audioArr = new float[ (int)(frequencyRate*time) ];\n\n\t\t// Debug.Log(\"curveTime:\"+curveTime+\" AudioSettings.outputSampleRate:\"+AudioSettings.outputSampleRate);\n\t\tfor(int i = 0; i < audioArr.Length; i++){\n\t\t\tfloat pt = (float)i / (float)frequencyRate;\n\t\t\taudioArr[i] = curve.Evaluate( pt );\n\t\t\t// Debug.Log(\"pt:\"+pt+\" i:\"+i+\" val:\"+audioArr[i]+\" len:\"+audioArr.Length);\n\t\t}\n\n\t\tint lengthSamples = audioArr.Length;//(int)( (float)frequencyRate * curveTime );\n\t\t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2 || UNITY_4_3 || UNITY_4_5 || UNITY_4_6\n\t\tbool is3dSound = false;\n\t\tAudioClip audioClip = AudioClip.Create(\"Generated Audio\", lengthSamples, 1, frequencyRate, is3dSound, false);\n\t\t#else\n\t\tAudioClip audioClip = AudioClip.Create(\"Generated Audio\", lengthSamples, 1, frequencyRate, false);\n\t\t#endif\n\t\taudioClip.SetData(audioArr, 0);\n\n\t\treturn audioClip;\n\t}\n\n\tpublic static void play( AudioClip audio ){\n\t\tplayClipAt( audio, Vector3.zero ); \n\t}\n\n\tpublic static void play( AudioClip audio, Vector3 pos ){\n\t\tplayClipAt( audio, pos ); \n\t}\n\n\tpublic static void play( AudioClip audio, Vector3 pos, float volume ){\n\t\t// Debug.Log(\"audio length:\"+audio.length);\n\t\tAudioSource audioSource = playClipAt(audio, pos);\n\t\taudioSource.minDistance = 1f;\n\t\t//audioSource.pitch = pitch;\n\t\taudioSource.volume = volume;\n\t}\n\n\tpublic static AudioSource playClipAt( AudioClip clip, Vector3 pos ) {\n\t\tGameObject tempGO = new GameObject(); // create the temp object\n\t\ttempGO.transform.position = pos; // set its position\n\t\tAudioSource aSource = tempGO.AddComponent<AudioSource>(); // add an audio source\n\t\taSource.clip = clip; // define the clip\n\t\taSource.Play(); // start the sound\n\t\tGameObject.Destroy(tempGO, clip.length); // destroy object after clip duration\n\t\treturn aSource; // return the AudioSource reference\n\t}\n\n\tpublic static void printOutAudioClip( AudioClip audioClip, ref AnimationCurve curve, float scaleX = 1f ){\n\t\t// Debug.Log(\"Audio channels:\"+audioClip.channels+\" frequency:\"+audioClip.frequency+\" length:\"+audioClip.length+\" samples:\"+audioClip.samples);\n\t\tfloat[] samples = new float[audioClip.samples * audioClip.channels];\n        audioClip.GetData(samples, 0);\n        int i = 0;\n\n        Keyframe[] frames = new Keyframe[samples.Length];\n        while (i < samples.Length) {\n           frames[i] = new Keyframe( (float)i * scaleX, samples[i] );\n           ++i;\n        }\n        curve = new AnimationCurve( frames );\n\t}\n}\n\n\n/**\n* Pass in options to LeanAudio\n*\n* @class LeanAudioOptions\n* @constructor\n*/\npublic class LeanAudioOptions : object {\n\tpublic Vector3[] vibrato;\n\tpublic int frequencyRate = 44100;\n\n\tpublic bool useSetData = true;\n\tpublic LeanAudioStream stream;\n\n\tpublic LeanAudioOptions(){}\n\n\t/**\n\t* Set the frequency for the audio is encoded. 44100 is CD quality, but you can usually get away with much lower (or use a lower amount to get a more 8-bit sound).\n\t* \n\t* @method setFrequency\n\t* @param {int} frequencyRate:int of the frequency you wish to encode the AudioClip at\n\t* @return {LeanAudioOptions} LeanAudioOptions describing optional values\n\t* @example\n\t* AnimationCurve volumeCurve = new AnimationCurve( new Keyframe(0f, 1f, 0f, -1f), new Keyframe(1f, 0f, -1f, 0f));<br>\n\t* AnimationCurve frequencyCurve = new AnimationCurve( new Keyframe(0f, 0.003f, 0f, 0f), new Keyframe(1f, 0.003f, 0f, 0f));<br>\n\t* AudioClip audioClip = LeanAudio.createAudio(volumeCurve, frequencyCurve, LeanAudio.options().setVibrato( new Vector3[]{ new Vector3(0.32f,0f,0f)} ).setFrequency(12100) );<br>\n\t*/\n\tpublic LeanAudioOptions setFrequency( int frequencyRate ){\n\t\tthis.frequencyRate = frequencyRate;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set details about the shape of the curve by adding vibrato waves through it. You can add as many as you want to sculpt out more detail in the sound wave.\n\t* \n\t* @method setVibrato\n\t* @param {Vector3[]} vibratoArray:Vector3[] The first value is the period in seconds that you wish to have the vibrato wave fluctuate at. The second value is the minimum height you wish the vibrato wave to dip down to (default is zero). The third is reserved for future effects.\n\t* @return {LeanAudioOptions} LeanAudioOptions describing optional values\n\t* @example\n\t* AnimationCurve volumeCurve = new AnimationCurve( new Keyframe(0f, 1f, 0f, -1f), new Keyframe(1f, 0f, -1f, 0f));<br>\n\t* AnimationCurve frequencyCurve = new AnimationCurve( new Keyframe(0f, 0.003f, 0f, 0f), new Keyframe(1f, 0.003f, 0f, 0f));<br>\n\t* AudioClip audioClip = LeanAudio.createAudio(volumeCurve, frequencyCurve, LeanAudio.options().setVibrato( new Vector3[]{ new Vector3(0.32f,0.3f,0f)} ).setFrequency(12100) );<br>\n\t*/\n\tpublic LeanAudioOptions setVibrato( Vector3[] vibrato ){\n\t\tthis.vibrato = vibrato;\n\t\treturn this;\n\t}\n}\n\n\n"
  },
  {
    "path": "Assets/Plugins/LeanAudio.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 10d72beb1d4e90d40856983fe541a6d5\ntimeCreated: 1494228456\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/LeanTween.cs",
    "content": "// Copyright (c) 2015 Russell Savage - Dented Pixel\n// \n// LeanTween version 2.32 - http://dentedpixel.com/developer-diary/\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n/*\nTERMS OF USE - EASING EQUATIONS#\nOpen source under the BSD License.\nCopyright (c)2001 Robert Penner\nAll rights reserved.\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\nRedistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\nRedistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\nNeither the name of the author nor the names of contributors may be used to endorse or promote products derived from this software without specific prior written permission.\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n\n/**\n* Pass this to the \"ease\" parameter, to get a different easing behavior<br><br>\n* <strong>Example: </strong><br>LeanTween.rotateX(gameObject, 270.0f, 1.5f).setEase(LeanTweenType.easeInBack);\n*\n* @class LeanTweenType\n*/\n\n/**\n* @property {integer} linear\n*/\n/**\n* @property {integer} easeOutQuad\n*/\n/**\n* @property {integer} easeInQuad\n*/\n/**\n* @property {integer} easeInOutQuad\n*/\n/**\n* @property {integer} easeInCubic\n*/\n/**\n* @property {integer} easeOutCubic\n*/\n/**\n* @property {integer} easeInOutCubic\n*/\n/**\n* @property {integer} easeInQuart\n*/\n/**\n* @property {integer} easeOutQuart\n*/\n/**\n* @property {integer} easeInOutQuart\n*/\n/**\n* @property {integer} easeInQuint\n*/\n/**\n* @property {integer} easeOutQuint\n*/\n/**\n* @property {integer} easeInOutQuint\n*/\n/**\n* @property {integer} easeInSine\n*/\n/**\n* @property {integer} easeOutSine\n*/\n/**\n* @property {integer} easeInOutSine\n*/\n/**\n* @property {integer} easeInExpo\n*/\n/**\n* @property {integer} easeOutExpo\n*/\n/**\n* @property {integer} easeInOutExpo\n*/\n/**\n* @property {integer} easeInCirc\n*/\n/**\n* @property {integer} easeOutCirc\n*/\n/**\n* @property {integer} easeInOutCirc\n*/\n/**\n* @property {integer} easeInBounce\n*/\n/**\n* @property {integer} easeOutBounce\n*/\n/**\n* @property {integer} easeInOutBounce\n*/\n/**\n* @property {integer} easeInBack\n*/\n/**\n* @property {integer} easeOutBack\n*/\n/**\n* @property {integer} easeInOutBack\n*/\n/**\n* @property {integer} easeInElastic\n*/\n/**\n* @property {integer} easeOutElastic\n*/\n/**\n* @property {integer} easeInOutElastic\n*/\n/**\n* @property {integer} punch\n*/\nusing UnityEngine;\nusing System;\nusing System.Collections.Generic;\nusing SLua;\n\npublic enum TweenAction{\n\tMOVE_X,\n\tMOVE_Y,\n\tMOVE_Z,\n\tMOVE_LOCAL_X,\n\tMOVE_LOCAL_Y,\n\tMOVE_LOCAL_Z,\n\tMOVE_CURVED,\n\tMOVE_CURVED_LOCAL,\n\tMOVE_SPLINE,\n\tMOVE_SPLINE_LOCAL,\n\tSCALE_X,\n\tSCALE_Y,\n\tSCALE_Z,\n\tROTATE_X,\n\tROTATE_Y,\n\tROTATE_Z,\n\tROTATE_AROUND,\n\tROTATE_AROUND_LOCAL,\n\tCANVAS_ROTATEAROUND,\n\tCANVAS_ROTATEAROUND_LOCAL,\n\tCANVAS_PLAYSPRITE,\n\tALPHA,\n    TEXT_ALPHA,\n    CANVAS_ALPHA,\n    CANVASGROUP_ALPHA,\n    ALPHA_VERTEX,\n\tCOLOR,\n\tCALLBACK_COLOR,\n    TEXT_COLOR,\n\tCANVAS_COLOR,\n\tCANVAS_MOVE_X,\n\tCANVAS_MOVE_Y,\n\tCANVAS_MOVE_Z,\n\tCALLBACK,\n\tMOVE,\n\tMOVE_LOCAL,\n\tMOVE_TO_TRANSFORM,\n\tROTATE,\n\tROTATE_LOCAL,\n\tSCALE,\n\tVALUE3,\n\tGUI_MOVE,\n\tGUI_MOVE_MARGIN,\n\tGUI_SCALE,\n\tGUI_ALPHA,\n\tGUI_ROTATE,\n\tDELAYED_SOUND,\n\tCANVAS_MOVE,\n\tCANVAS_SCALE,\n}\n\npublic enum LeanTweenType{\n\tnotUsed, linear, easeOutQuad, easeInQuad, easeInOutQuad, easeInCubic, easeOutCubic, easeInOutCubic, easeInQuart, easeOutQuart, easeInOutQuart, \n\teaseInQuint, easeOutQuint, easeInOutQuint, easeInSine, easeOutSine, easeInOutSine, easeInExpo, easeOutExpo, easeInOutExpo, easeInCirc, easeOutCirc, easeInOutCirc, \n\teaseInBounce, easeOutBounce, easeInOutBounce, easeInBack, easeOutBack, easeInOutBack, easeInElastic, easeOutElastic, easeInOutElastic, easeSpring, easeShake, punch, once, clamp, pingPong, animationCurve\n}\n\n/**\n* Internal Representation of a Tween<br>\n* <br>\n* This class represents all of the optional parameters you can pass to a method (it also represents the internal representation of the tween).<br><br>\n* <strong id='optional'>Optional Parameters</strong> are passed at the end of every method:<br> \n* <br>\n* &nbsp;&nbsp;<i>Example:</i><br>\n* &nbsp;&nbsp;LeanTween.moveX( gameObject, 1f, 1f).setEase( <a href=\"LeanTweenType.html\">LeanTweenType</a>.easeInQuad ).setDelay(1f);<br>\n* <br>\n* You can pass the optional parameters in any order, and chain on as many as you wish.<br>\n* You can also <strong>pass parameters at a later time</strong> by saving a reference to what is returned.<br>\n* <br>\n* Retrieve a <strong>unique id</strong> for the tween by using the \"id\" property. You can pass this to LeanTween.pause, LeanTween.resume, LeanTween.cancel, LeanTween.isTweening methods<br>\n* <br>\n* &nbsp;&nbsp;<h4>Example:</h4>\n* &nbsp;&nbsp;int id = LeanTween.moveX(gameObject, 1f, 3f).id;<br>\n* <div style=\"color:gray\">&nbsp;&nbsp;// pause a specific tween</div>\n* &nbsp;&nbsp;LeanTween.pause(id);<br>\n* <div style=\"color:gray\">&nbsp;&nbsp;// resume later</div>\n* &nbsp;&nbsp;LeanTween.resume(id);<br>\n* <div style=\"color:gray\">&nbsp;&nbsp;// check if it is tweening before kicking of a new tween</div>\n* &nbsp;&nbsp;if( LeanTween.isTweening( id ) ){<br>\n* &nbsp;&nbsp; &nbsp;&nbsp;\tLeanTween.cancel( id );<br>\n* &nbsp;&nbsp; &nbsp;&nbsp;\tLeanTween.moveZ(gameObject, 10f, 3f);<br>\n* &nbsp;&nbsp;}<br>\n* @class LTDescr\n* @constructor\n*/\n\n[SLua.CustomLuaClass]\npublic class LTDescrImpl : LTDescr {\n\tpublic bool toggle { get; set; }\n\tpublic bool useEstimatedTime { get; set; }\n\tpublic bool useFrames { get; set; }\n\tpublic bool useManualTime { get; set; }\n\tpublic bool hasInitiliazed { get; set; }\n\tpublic bool hasPhysics { get; set; }\n\tpublic bool onCompleteOnRepeat { get; set; }\n\tpublic bool onCompleteOnStart { get; set; }\n\tpublic float passed { get; set; }\n\tpublic float delay { get; set; }\n\tpublic float time { get; set; }\n\tpublic float lastVal { get; set; }\n\tprivate uint _id;\n\tpublic int loopCount { get; set; }\n\tpublic uint counter { get; set; }\n\tpublic float direction { get; set; }\n\tpublic float directionLast { get; set; }\n\tpublic float overshoot { get; set; }\n\tpublic float period { get; set; }\n\tpublic bool destroyOnComplete { get; set; }\n\tpublic Transform trans { get; set; }\n\tpublic Transform toTrans { get; set; }\n\tpublic LTRect ltRect { get; set; }\n\tinternal Vector3 fromInternal;\n\tpublic Vector3 from { get { return this.fromInternal; } set { this.fromInternal = value; } }\n\tinternal Vector3 toInternal;\n\tpublic Vector3 to { get { return this.toInternal; } set { this.toInternal = value; } }\n\tinternal Vector3 diffInternal;\n\tpublic Vector3 diff { get { return this.diffInternal; } set { this.diffInternal = value; } }\n\tpublic Vector3 point { get; set; }\n\tpublic Vector3 axis { get; set; }\n\tpublic Quaternion origRotation { get; set; }\n\tpublic LTBezierPath path { get; set; }\n\tpublic LTSpline spline { get; set; }\n\tpublic TweenAction type { get; set; }\n\tpublic LeanTweenType tweenType { get; set; }\n\tpublic AnimationCurve animationCurve { get; set; }\n\tpublic LeanTweenType loopType { get; set; }\n\tpublic bool hasUpdateCallback { get; set; }\n\tpublic Action<float> onUpdateFloat { get; set; }\n    public Action<float,float> onUpdateFloatRatio { get; set; }\n\tpublic Action<float,object> onUpdateFloatObject { get; set; }\n\tpublic Action<Vector2> onUpdateVector2 { get; set; }\n\tpublic Action<Vector3> onUpdateVector3 { get; set; }\n\tpublic Action<Vector3,object> onUpdateVector3Object { get; set; }\n\tpublic Action<Color> onUpdateColor { get; set; }\n\tpublic Action onComplete { get; set; }\n\tpublic Action<object> onCompleteObject { get; set; }\n\tpublic object onCompleteParam { get; set; }\n\tpublic object onUpdateParam { get; set; }\n\tpublic Action onStart { get; set; }\n\n\t#if LEANTWEEN_1\n\tpublic Hashtable optional;\n\t#endif\n\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\tpublic RectTransform rectTransform;\n    public UnityEngine.UI.Text uiText;\n    public UnityEngine.UI.Image uiImage;\n    public UnityEngine.Sprite[] sprites;\n\t#endif\n\n\tprivate static uint global_counter = 0;\n\n    public override string ToString(){\n\t\treturn (trans!=null ? \"gameObject:\"+trans.gameObject : \"gameObject:null\")+\" toggle:\"+toggle+\" passed:\"+passed+\" time:\"+time+\" delay:\"+delay+\" direction:\"+direction+\" from:\"+from+\" to:\"+to+\" type:\"+type+\" ease:\"+tweenType+\" useEstimatedTime:\"+useEstimatedTime+\" id:\"+id+\" hasInitiliazed:\"+hasInitiliazed;\n\t}\n\n\tpublic LTDescrImpl(){\n\n\t}\n\n\t[System.Obsolete(\"Use 'LeanTween.cancel( id )' instead\")]\n\tpublic LTDescr cancel( GameObject gameObject ){\n\t\t// Debug.Log(\"canceling id:\"+this._id+\" this.uniqueId:\"+this.uniqueId+\" go:\"+this.trans.gameObject);\n\t\tif(gameObject==this.trans.gameObject)\n\t\t\tLeanTween.removeTween((int)this._id, this.uniqueId);\n\t\treturn this;\n\t}\n\n\t/*[System.Obsolete(\"Use 'LeanTween.cancel( id )' instead\")]\n\tpublic LTDescr cancel(){\n\t\t// Debug.Log(\"canceling id:\"+this._id+\" this.uniqueId:\"+this.uniqueId+\" go:\"+this.trans.gameObject);\n\t\tLeanTween.removeTween((int)this._id);\n\t\treturn this;\n\t}*/\n\n\tpublic int uniqueId{\n\t\tget{ \n\t\t\tuint toId = _id | counter << 16;\n\n\t\t\t/*uint backId = toId & 0xFFFF;\n\t\t\tuint backCounter = toId >> 16;\n\t\t\tif(_id!=backId || backCounter!=counter){\n\t\t\t\tDebug.LogError(\"BAD CONVERSION toId:\"+_id);\n\t\t\t}*/\n\n\t\t\treturn (int)toId;\n\t\t}\n\t}\n\n\tpublic int id{\n\t\tget{ \n\t\t\treturn uniqueId;\n\t\t}\n\t}\n\n\tpublic void reset(){\n\t\tthis.toggle = true;\n\t\t#if LEANTWEEN_1\n\t\tthis.optional = null;\n\t\t#endif\n\t\tthis.trans = null;\n\t\tthis.passed = this.delay = this.lastVal = 0.0f;\n\t\tthis.hasUpdateCallback = this.useEstimatedTime = this.useFrames = this.hasInitiliazed = this.onCompleteOnRepeat = this.destroyOnComplete = this.onCompleteOnStart = this.useManualTime = false;\n\t\tthis.animationCurve = null;\n\t\tthis.tweenType = LeanTweenType.linear;\n\t\tthis.loopType = LeanTweenType.once;\n\t\tthis.loopCount = 0;\n\t\tthis.direction = this.directionLast = this.overshoot = 1.0f;\n\t\tthis.period = 0.3f;\n\t\tthis.point = Vector3.zero;\n\t\tcleanup();\n\t\t\n\t\tglobal_counter++;\n\t\tif(global_counter>0x8000)\n\t\t\tglobal_counter = 0;\n\t}\n\n\tpublic void cleanup(){\n\t\tthis.onUpdateFloat = null;\n        this.onUpdateFloatRatio = null;\n\t\tthis.onUpdateVector2 = null;\n\t\tthis.onUpdateVector3 = null;\n\t\tthis.onUpdateFloatObject = null;\n\t\tthis.onUpdateVector3Object = null;\n\t\tthis.onUpdateColor = null;\n\t\tthis.onComplete = null;\n\t\tthis.onCompleteObject = null;\n\t\tthis.onCompleteParam = null;\n\t\tthis.onStart = null;\n\t\t\n\t\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\t\tthis.rectTransform = null;\n\t    this.uiText = null;\n\t   \tthis.uiImage = null;\n\t    this.sprites = null;\n\t\t#endif\n\t}\n\n\t// This method is only for internal use\n\tpublic void init(){\n\t\tthis.hasInitiliazed = true;\n\n\t\tif (this.onStart != null){\n            this.onStart();\n        }\t\t \t\n\n\t\t// Initialize From Values\n\t\tswitch(this.type){\n\t\t\tcase TweenAction.MOVE:\n\t\t\tcase TweenAction.MOVE_TO_TRANSFORM:\n\t\t\t\tthis.from = trans.position; break;\n\t\t\tcase TweenAction.MOVE_X:\n\t\t\t\tthis.fromInternal.x = trans.position.x; break;\n\t\t\tcase TweenAction.MOVE_Y:\n\t\t\t\tthis.fromInternal.x = trans.position.y; break;\n\t\t\tcase TweenAction.MOVE_Z:\n\t\t\t\tthis.fromInternal.x = trans.position.z; break;\n\t\t\tcase TweenAction.MOVE_LOCAL_X:\n\t\t\t\tthis.fromInternal.x = trans.localPosition.x; break;\n\t\t\tcase TweenAction.MOVE_LOCAL_Y:\n\t\t\t\tthis.fromInternal.x = trans.localPosition.y; break;\n\t\t\tcase TweenAction.MOVE_LOCAL_Z:\n\t\t\t\tthis.fromInternal.x = trans.localPosition.z; break;\n\t\t\tcase TweenAction.SCALE_X:\n\t\t\t\tthis.fromInternal.x = trans.localScale.x; break;\n\t\t\tcase TweenAction.SCALE_Y:\n\t\t\t\tthis.fromInternal.x = trans.localScale.y; break;\n\t\t\tcase TweenAction.SCALE_Z:\n\t\t\t\tthis.fromInternal.x = trans.localScale.z; break;\n\t\t\tcase TweenAction.ALPHA:\n\t\t\t\t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2\n\t\t\t\t\tif(trans.gameObject.renderer){\n\t\t\t\t\t\tthis.fromInternal.x = trans.gameObject.renderer.material.color.a;\n\t\t\t\t\t}else if(trans.childCount>0){\n\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t\t\t\t\t\tif(child.gameObject.renderer!=null){\n\t\t\t\t\t\t\t\tColor col = child.gameObject.renderer.material.color;\n\t\t\t\t\t\t\t\tthis.fromInternal.x = col.a;\n\t\t\t\t\t\t\t\tbreak;\n\t    \t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\t\n\t\t\t\t#else\n\t\t\t\t\tSpriteRenderer ren = trans.gameObject.GetComponent<SpriteRenderer>();\n\t\t\t\t\tif(ren!=null){\n\t\t\t\t\t\tthis.fromInternal.x = ren.color.a;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(trans.gameObject.GetComponent<Renderer>()!=null && trans.gameObject.GetComponent<Renderer>().material.HasProperty(\"_Color\")){\n\t\t\t\t\t\t\tthis.fromInternal.x = trans.gameObject.GetComponent<Renderer>().material.color.a;\n\t\t\t\t\t\t}else if(trans.gameObject.GetComponent<Renderer>()!=null && trans.gameObject.GetComponent<Renderer>().material.HasProperty(\"_TintColor\")){\n\t\t\t\t\t\t\tColor col = trans.gameObject.GetComponent<Renderer>().material.GetColor(\"_TintColor\");\n\t\t\t\t\t\t\tthis.fromInternal.x = col.a;\n\t\t\t\t\t\t}else if(trans.childCount>0){\n\t\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t\t\t\t\t\t\tif(child.gameObject.GetComponent<Renderer>()!=null){\n\t\t\t\t\t\t\t\t\tColor col = child.gameObject.GetComponent<Renderer>().material.color;\n\t\t\t\t\t\t\t\t\tthis.fromInternal.x = col.a;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t#endif\n\t\t\tcase TweenAction.MOVE_LOCAL:\n\t\t\t\tthis.from = trans.localPosition; break;\n\t\t\tcase TweenAction.MOVE_CURVED:\n\t\t\tcase TweenAction.MOVE_CURVED_LOCAL:\n\t\t\tcase TweenAction.MOVE_SPLINE:\n\t\t\tcase TweenAction.MOVE_SPLINE_LOCAL:\n\t\t\t\tthis.fromInternal.x = 0; break;\n\t\t\tcase TweenAction.ROTATE:\n\t\t\t\tthis.from = trans.eulerAngles; \n\t\t\t\tthis.to = new Vector3(LeanTween.closestRot( this.fromInternal.x, this.toInternal.x), LeanTween.closestRot( this.from.y, this.to.y), LeanTween.closestRot( this.from.z, this.to.z));\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_X:\n\t\t\t\tthis.fromInternal.x = trans.eulerAngles.x; \n\t\t\t\tthis.toInternal.x = LeanTween.closestRot( this.fromInternal.x, this.toInternal.x);\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_Y:\n\t\t\t\tthis.fromInternal.x = trans.eulerAngles.y; \n\t\t\t\tthis.toInternal.x = LeanTween.closestRot( this.fromInternal.x, this.toInternal.x);\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_Z:\n\t\t\t\tthis.fromInternal.x = trans.eulerAngles.z; \n\t\t\t\tthis.toInternal.x = LeanTween.closestRot( this.fromInternal.x, this.toInternal.x);\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_AROUND:\n\t\t\t\tthis.lastVal = 0.0f; // optional[\"last\"]\n\t\t\t\tthis.fromInternal.x = 0.0f;\n\t\t\t\tthis.origRotation = trans.rotation; // optional[\"origRotation\"\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_AROUND_LOCAL:\n\t\t\t\tthis.lastVal = 0.0f; // optional[\"last\"]\n\t\t\t\tthis.fromInternal.x = 0.0f;\n\t\t\t\tthis.origRotation = trans.localRotation; // optional[\"origRotation\"\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.ROTATE_LOCAL:\n\t\t\t\tthis.from = trans.localEulerAngles; \n\t\t\t\tthis.to = new Vector3(LeanTween.closestRot( this.fromInternal.x, this.toInternal.x), LeanTween.closestRot( this.from.y, this.to.y), LeanTween.closestRot( this.from.z, this.to.z));\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.SCALE:\n\t\t\t\tthis.from = trans.localScale; break;\n\t\t\tcase TweenAction.GUI_MOVE:\n\t\t\t\tthis.from = new Vector3(this.ltRect.rect.x, this.ltRect.rect.y, 0); break;\n\t\t\tcase TweenAction.GUI_MOVE_MARGIN:\n\t\t\t\tthis.from = new Vector2(this.ltRect.margin.x, this.ltRect.margin.y); break;\n\t\t\tcase TweenAction.GUI_SCALE:\n\t\t\t\tthis.from = new Vector3(this.ltRect.rect.width, this.ltRect.rect.height, 0); break;\n\t\t\tcase TweenAction.GUI_ALPHA:\n\t\t\t\tthis.fromInternal.x = this.ltRect.alpha; break;\n\t\t\tcase TweenAction.GUI_ROTATE:\n\t\t\t\tif(this.ltRect.rotateEnabled==false){\n\t\t\t\t\tthis.ltRect.rotateEnabled = true;\n\t\t\t\t\tthis.ltRect.resetForRotation();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tthis.fromInternal.x = this.ltRect.rotation; break;\n\t\t\tcase TweenAction.ALPHA_VERTEX:\n\t\t\t\tthis.fromInternal.x = trans.GetComponent<MeshFilter>().mesh.colors32[0].a;\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.CALLBACK:\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.CALLBACK_COLOR:\n\t\t\t\tthis.diff = new Vector3(1.0f,0.0f,0.0f);\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.COLOR:\n\t\t\t\t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2\n\t\t\t\t\tif(trans.gameObject.renderer){\n\t\t\t\t\t\tColor col = trans.gameObject.renderer.material.color;\n\t\t\t\t\t\tthis.setFromColor( col );\n\t\t\t\t\t}else if(trans.childCount>0){\n\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t\t\t\t\t\tif(child.gameObject.renderer!=null){\n\t\t\t\t\t\t\t\tColor col = child.gameObject.renderer.material.color;\n\t\t\t\t\t\t\t\tthis.setFromColor( col );\n\t\t\t\t\t\t\t\tbreak;\n\t    \t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t#else\n\t\t\t\t\tSpriteRenderer renColor = trans.gameObject.GetComponent<SpriteRenderer>();\n                    if(renColor!=null){\n                        Color col = renColor.color;\n                        this.setFromColor( col );\n                    }else{\n                        if(trans.gameObject.GetComponent<Renderer>()!=null && trans.gameObject.GetComponent<Renderer>().material.HasProperty(\"_Color\")){\n\t\t\t\t\t\t\tColor col = trans.gameObject.GetComponent<Renderer>().material.color;\n\t\t\t\t\t\t\tthis.setFromColor( col );\n\t\t\t\t\t\t}else if(trans.gameObject.GetComponent<Renderer>()!=null && trans.gameObject.GetComponent<Renderer>().material.HasProperty(\"_TintColor\")){\n\t\t\t\t\t\t\tColor col = trans.gameObject.GetComponent<Renderer>().material.GetColor (\"_TintColor\");\n\t\t\t\t\t\t\tthis.setFromColor( col );\n\t\t\t\t\t\t}else if(trans.childCount>0){\n\t\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t\t\t\t\t\t\tif(child.gameObject.GetComponent<Renderer>()!=null){\n\t\t\t\t\t\t\t\t\tColor col = child.gameObject.GetComponent<Renderer>().material.color;\n\t\t\t\t\t\t\t\t\tthis.setFromColor( col );\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n                    }\n\t\t\t\t#endif\n\t\t\t\tbreak;\n\t\t\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\t\t\tcase TweenAction.CANVAS_ALPHA:\n\t\t\t\tthis.uiImage = trans.gameObject.GetComponent<UnityEngine.UI.Image>();\n                if(this.uiImage != null)\n\t                this.fromInternal.x = this.uiImage.color.a;\n                break;\n            case TweenAction.CANVAS_COLOR:\n                this.uiImage = trans.gameObject.GetComponent<UnityEngine.UI.Image>();\n                if(this.uiImage != null)\n\t               this.setFromColor( this.uiImage.color );\n                break;\n            case TweenAction.CANVASGROUP_ALPHA:\n\t\t\t\tthis.fromInternal.x = trans.gameObject.GetComponent<CanvasGroup>().alpha;\n                break;\n            case TweenAction.TEXT_ALPHA:\n                this.uiText = trans.gameObject.GetComponent<UnityEngine.UI.Text>();\n                if (this.uiText != null)\n                    this.fromInternal.x = this.uiText.color.a;\n                break;\n            case TweenAction.TEXT_COLOR:\n                this.uiText = trans.gameObject.GetComponent<UnityEngine.UI.Text>();\n                if (this.uiText != null)\n                    this.setFromColor( this.uiText.color );\n                break;\n\t\t\tcase TweenAction.CANVAS_MOVE:\n\t\t\t\tthis.fromInternal = this.rectTransform.anchoredPosition3D; break;\n\t\t\tcase TweenAction.CANVAS_MOVE_X:\n\t\t\t\tthis.fromInternal.x = this.rectTransform.anchoredPosition3D.x; break;\n\t\t\tcase TweenAction.CANVAS_MOVE_Y:\n\t\t\t\tthis.fromInternal.x = this.rectTransform.anchoredPosition3D.y; break;\n\t\t\tcase TweenAction.CANVAS_MOVE_Z:\n\t\t\t\tthis.fromInternal.x = this.rectTransform.anchoredPosition3D.z; break;\n\t\t\tcase TweenAction.CANVAS_ROTATEAROUND:\n\t\t\tcase TweenAction.CANVAS_ROTATEAROUND_LOCAL:\n\t\t\t\tthis.lastVal = 0.0f;\n\t\t\t\tthis.fromInternal.x = 0.0f;\n\t\t\t\tthis.origRotation = this.rectTransform.rotation;\n\t\t\t\tbreak;\n\t\t\tcase TweenAction.CANVAS_SCALE:\n\t\t\t\tthis.from = this.rectTransform.localScale; break;\n\t\t\tcase TweenAction.CANVAS_PLAYSPRITE:\n\t\t\t\tthis.uiImage = trans.gameObject.GetComponent<UnityEngine.UI.Image>();\n\t\t\t\tthis.fromInternal.x = 0f;\n\t\t\t\tbreak;\n\t\t\t#endif\n\t\t}\n        if(this.type!=TweenAction.CALLBACK_COLOR && this.type!=TweenAction.COLOR && this.type!=TweenAction.TEXT_COLOR && this.type!=TweenAction.CANVAS_COLOR)\n\t\t\tthis.diff = this.to - this.from;\n\t\tif(this.onCompleteOnStart){\n\t\t\tif(this.onComplete!=null){\n\t\t\t\tthis.onComplete();\n\t\t\t}else if(this.onCompleteObject!=null){\n\t\t\t\tthis.onCompleteObject(this.onCompleteParam);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic LTDescr setFromColor( Color col ){\n\t\tthis.from = new Vector3(0.0f, col.a, 0.0f);\n\t\tthis.diff = new Vector3(1.0f,0.0f,0.0f);\n\t\tthis.axis = new Vector3( col.r, col.g, col.b );\n\t\treturn this;\n\t}\n\n\t/**\n\t* Pause a tween\n\t* \n\t* @method pause\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t*/\n\tpublic LTDescr pause(){\n\t\tif(this.direction != 0.0f){ // check if tween is already paused\n        \tthis.directionLast =  this.direction;\n            this.direction = 0.0f;\n        }\n\n        return this;\n\t}\n\n\t/**\n\t* Resume a paused tween\n\t* \n\t* @method resume\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t*/\n\tpublic LTDescr resume(){\n\t\tthis.direction = this.directionLast;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setAxis( Vector3 axis ){\n\t\tthis.axis = axis;\n\t\treturn this;\n\t}\n\t\n\t/**\n\t* Delay the start of a tween\n\t* \n\t* @method setDelay\n\t* @param {float} float time The time to complete the tween in\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setDelay( 1.5f );\n\t*/\n\tpublic LTDescr setDelay( float delay ){\n\t\tif(this.useEstimatedTime){\n\t\t\tthis.delay = delay;\n\t\t}else{\n\t\t\tthis.delay = delay;//*Time.timeScale;\n\t\t}\n\t\t\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the type of easing used for the tween. <br>\n\t* <ul><li><a href=\"LeanTweenType.html\">List of all the ease types</a>.</li>\n\t* <li><a href=\"http://www.robertpenner.com/easing/easing_demo.html\">This page helps visualize the different easing equations</a></li>\n\t* </ul>\n\t* \n\t* @method setEase\n\t* @param {LeanTweenType} easeType:LeanTweenType the easing type to use\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setEase( LeanTweenType.easeInBounce );\n\t*/\n\tpublic LTDescr setEase( LeanTweenType easeType ){\n\t\tthis.tweenType = easeType;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set how far past a tween will overshoot  for certain ease types (compatible:  easeInBack, easeInOutBack, easeOutBack, easeOutElastic, easeInElastic, easeInOutElastic). <br>\n\t* @method setOvershoot\n\t* @param {float} overshoot:float how far past the destination it will go before settling in\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setEase( LeanTweenType.easeOutBack ).setOvershoot(2f);\n\t*/\n\tpublic LTDescr setOvershoot( float overshoot ){\n\t\tthis.overshoot = overshoot;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set how short the iterations are for certain ease types (compatible: easeOutElastic, easeInElastic, easeInOutElastic). <br>\n\t* @method setPeriod\n\t* @param {float} period:float how short the iterations are that the tween will animate at (default 0.3f)\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setEase( LeanTweenType.easeOutElastic ).setPeriod(0.3f);\n\t*/\n\tpublic LTDescr setPeriod( float period ){\n\t\tthis.period = period;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the type of easing used for the tween with a custom curve. <br>\n\t* @method setEase (AnimationCurve)\n\t* @param {AnimationCurve} easeDefinition:AnimationCurve an <a href=\"http://docs.unity3d.com/Documentation/ScriptReference/AnimationCurve.html\" target=\"_blank\">AnimationCure</a> that describes the type of easing you want, this is great for when you want a unique type of movement\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setEase( LeanTweenType.easeInBounce );\n\t*/\n\tpublic LTDescr setEase( AnimationCurve easeCurve ){\n\t\tthis.animationCurve = easeCurve;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the end that the GameObject is tweening towards\n\t* @method setTo\n\t* @param {Vector3} to:Vector3 point at which you want the tween to reach\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LTDescr descr = LeanTween.move( cube, Vector3.up, new Vector3(1f,3f,0f), 1.0f ).setEase( LeanTweenType.easeInOutBounce );<br>\n\t* // Later your want to change your destination or your destiation is constantly moving<br>\n\t* descr.setTo( new Vector3(5f,10f,3f); );<br>\n\t*/\n\tpublic LTDescr setTo( Vector3 to ){\n\t\tif(this.hasInitiliazed){\n\t\t\tthis.to = to;\n\t\t\tthis.diff = to - this.from;\n\t\t}else{\n\t\t\tthis.to = to;\n\t\t}\n\t\t\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setTo( Transform to ){\n\t\tthis.toTrans = to;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setFrom( Vector3 from ){\n\t\tif(this.trans)\n\t\t\tthis.init();\n\t\tthis.from = from;\n\t\t// this.hasInitiliazed = true; // this is set, so that the \"from\" value isn't overwritten later on when the tween starts\n\t\tthis.diff = this.to - this.from;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setFrom( float from ){\n\t\treturn setFrom( new Vector3(from, 0f, 0f) );\n\t}\n\n\tpublic LTDescr setDiff( Vector3 diff ){\n\t\tthis.diff = diff;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setHasInitialized( bool has ){\n\t\tthis.hasInitiliazed = has;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setId( uint id ){\n\t\tthis._id = id;\n\t\tthis.counter = global_counter;\n\t\t// Debug.Log(\"Global counter:\"+global_counter);\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the finish time of the tween\n\t* @method setTime\n\t* @param {float} finishTime:float the length of time in seconds you wish the tween to complete in\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* int tweenId = LeanTween.moveX(gameObject, 5f, 2.0f ).id;<br>\n\t* // Later<br>\n\t* LTDescr descr = description( tweenId );<br>\n\t* descr.setTime( 1f );<br>\n\t*/\n\tpublic LTDescr setTime( float time ){\n\t\tfloat passedTimeRatio = this.passed / this.time;\n\t\tthis.passed = time * passedTimeRatio;\n\t\tthis.time = time;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the tween to repeat a number of times.\n\t* @method setRepeat\n\t* @param {int} repeatNum:int the number of times to repeat the tween. -1 to repeat infinite times\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setRepeat( 10 ).setLoopPingPong();\n\t*/\n\tpublic LTDescr setRepeat( int repeat ){\n\t\tthis.loopCount = repeat;\n\t\tif((repeat>1 && this.loopType == LeanTweenType.once) || (repeat < 0 && this.loopType == LeanTweenType.once)){\n\t\t\tthis.loopType = LeanTweenType.clamp;\n\t\t}\n\t\tif(this.type==TweenAction.CALLBACK || this.type==TweenAction.CALLBACK_COLOR){\n\t\t\tthis.setOnCompleteOnRepeat(true);\n\t\t}\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setLoopType( LeanTweenType loopType ){\n\t\tthis.loopType = loopType;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setUseEstimatedTime( bool useEstimatedTime ){\n\t\tthis.useEstimatedTime = useEstimatedTime;\n\t\treturn this;\n\t}\n\t\n\t/**\n\t* Set ignore time scale when tweening an object when you want the animation to be time-scale independent (ignores the Time.timeScale value). Great for pause screens, when you want all other action to be stopped (or slowed down)\n\t* @method setIgnoreTimeScale\n\t* @param {bool} useUnScaledTime:bool whether to use the unscaled time or not\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setRepeat( 2 ).setIgnoreTimeScale( true );\n\t*/\n\tpublic LTDescr setIgnoreTimeScale( bool useUnScaledTime ){\n\t\tthis.useEstimatedTime = useUnScaledTime;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Use frames when tweening an object, when you don't want the animation to be time-frame independent...\n\t* @method setUseFrames\n\t* @param {bool} useFrames:bool whether to use estimated time or not\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setRepeat( 2 ).setUseFrames( true );\n\t*/\n\tpublic LTDescr setUseFrames( bool useFrames ){\n\t\tthis.useFrames = useFrames;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setUseManualTime( bool useManualTime ){\n\t\tthis.useManualTime = useManualTime;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setLoopCount( int loopCount ){\n\t\tthis.loopCount = loopCount;\n\t\treturn this;\n\t}\n\n\t/**\n\t* No looping involved, just run once (the default)\n\t* @method setLoopOnce\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setLoopOnce();\n\t*/\n\tpublic LTDescr setLoopOnce(){ this.loopType = LeanTweenType.once; return this; }\n\n\t/**\n\t* When the animation gets to the end it starts back at where it began\n\t* @method setLoopClamp\n\t* @param {int} loops:int (defaults to -1) how many times you want the loop to happen (-1 for an infinite number of times)\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setLoopClamp( 2 );\n\t*/\n\tpublic LTDescr setLoopClamp(){ \n\t\tthis.loopType = LeanTweenType.clamp; \n\t\tif(this.loopCount==0)\n\t\t\tthis.loopCount = -1;\n\t\treturn this;\n\t}\n\tpublic LTDescr setLoopClamp( int loops ){ \n\t\tthis.loopCount = loops;\n\t\treturn this;\n\t}\n\n\t/**\n\t* When the animation gets to the end it then tweens back to where it started (and on, and on)\n\t* @method setLoopPingPong\n\t* @param {int} loops:int (defaults to -1) how many times you want the loop to happen in both directions (-1 for an infinite number of times). Passing a value of 1 will cause the object to go towards and back from it's destination once.\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setLoopPingPong( 2 );\n\t*/\n\tpublic LTDescr setLoopPingPong(){\n\t\tthis.loopType = LeanTweenType.pingPong;\n\t\tif(this.loopCount==0)\n\t\t\tthis.loopCount = -1;\n\t\treturn this; \n\t}\n\tpublic LTDescr setLoopPingPong( int loops ) { \n\t\tthis.loopType = LeanTweenType.pingPong;\n        this.loopCount = loops == -1 ? loops : loops * 2;\n\t\treturn this; \n\t}\n\n\t/**\n\t* Have a method called when the tween finishes\n\t* @method setOnComplete\n\t* @param {Action} onComplete:Action the method that should be called when the tween is finished ex: tweenFinished(){ }\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnComplete( tweenFinished );\n\t*/\n\tpublic LTDescr setOnComplete( Action onComplete ){\n\t\tthis.onComplete = onComplete;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Have a method called when the tween finishes\n\t* @method setOnComplete (object)\n\t* @param {Action<object>} onComplete:Action<object> the method that should be called when the tween is finished ex: tweenFinished( object myObj ){ }\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnComplete( tweenFinished );\n\t*/\n\tpublic LTDescr setOnComplete( Action<object> onComplete ){\n\t\tthis.onCompleteObject = onComplete;\n\t\treturn this;\n\t}\n\tpublic LTDescr setOnComplete( Action<object> onComplete, object onCompleteParam ){\n\t\tthis.onCompleteObject = onComplete;\n\t\tif(onCompleteParam!=null)\n\t\t\tthis.onCompleteParam = onCompleteParam;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Pass an object to along with the onComplete Function\n\t* @method setOnCompleteParam\n\t* @param {object} onComplete:object an object that \n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.delayedCall(1.5f, enterMiniGameStart).setOnCompleteParam( new object[]{\"\"+5} );<br><br>\n\t* void enterMiniGameStart( object val ){<br>\n    * &nbsp;object[] arr = (object [])val;<br>\n    * &nbsp;int lvl = int.Parse((string)arr[0]);<br>\n    * }<br>\n\t*/\n\tpublic LTDescr setOnCompleteParam( object onCompleteParam ){\n\t\tthis.onCompleteParam = onCompleteParam;\n\t\treturn this;\n\t}\n\n\n\t/**\n\t* Have a method called on each frame that the tween is being animated (passes a float value)\n\t* @method setOnUpdate\n\t* @param {Action<float>} onUpdate:Action<float> a method that will be called on every frame with the float value of the tweened object\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnUpdate( tweenMoved );<br>\n\t* <br>\n\t* void tweenMoved( float val ){ }<br>\n\t*/\n\tpublic LTDescr setOnUpdate( Action<float> onUpdate ){\n\t\tthis.onUpdateFloat = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n    public LTDescr setOnUpdateRatio(Action<float,float> onUpdate)\n    {\n        this.onUpdateFloatRatio = onUpdate;\n        this.hasUpdateCallback = true;\n        return this;\n    }\n\t\n\tpublic LTDescr setOnUpdateObject( Action<float,object> onUpdate ){\n\t\tthis.onUpdateFloatObject = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n\tpublic LTDescr setOnUpdateVector2( Action<Vector2> onUpdate ){\n\t\tthis.onUpdateVector2 = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n\tpublic LTDescr setOnUpdateVector3( Action<Vector3> onUpdate ){\n\t\tthis.onUpdateVector3 = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n\tpublic LTDescr setOnUpdateColor( Action<Color> onUpdate ){\n\t\tthis.onUpdateColor = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n\n\t#if !UNITY_FLASH\n\n\tpublic LTDescr setOnUpdate( Action<Color> onUpdate ){\n\t\tthis.onUpdateColor = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Have a method called on each frame that the tween is being animated (passes a float value and a object)\n\t* @method setOnUpdate (object)\n\t* @param {Action<float,object>} onUpdate:Action<float,object> a method that will be called on every frame with the float value of the tweened object, and an object of the person's choosing\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnUpdate( tweenMoved ).setOnUpdateParam( myObject );<br>\n\t* <br>\n\t* void tweenMoved( float val, object obj ){ }<br>\n\t*/\n\tpublic LTDescr setOnUpdate( Action<float,object> onUpdate, object onUpdateParam = null ){\n\t\tthis.onUpdateFloatObject = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\tif(onUpdateParam!=null)\n\t\t\tthis.onUpdateParam = onUpdateParam;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setOnUpdate( Action<Vector3,object> onUpdate, object onUpdateParam = null ){\n\t\tthis.onUpdateVector3Object = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\tif(onUpdateParam!=null)\n\t\t\tthis.onUpdateParam = onUpdateParam;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setOnUpdate( Action<Vector2> onUpdate, object onUpdateParam = null ){\n\t\tthis.onUpdateVector2 = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\tif(onUpdateParam!=null)\n\t\t\tthis.onUpdateParam = onUpdateParam;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Have a method called on each frame that the tween is being animated (passes a float value)\n\t* @method setOnUpdate (Vector3)\n\t* @param {Action<Vector3>} onUpdate:Action<Vector3> a method that will be called on every frame with the float value of the tweened object\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnUpdate( tweenMoved );<br>\n\t* <br>\n\t* void tweenMoved( Vector3 val ){ }<br>\n\t*/\n\tpublic LTDescr setOnUpdate( Action<Vector3> onUpdate, object onUpdateParam = null ){\n\t\tthis.onUpdateVector3 = onUpdate;\n\t\tthis.hasUpdateCallback = true;\n\t\tif(onUpdateParam!=null)\n\t\t\tthis.onUpdateParam = onUpdateParam;\n\t\treturn this;\n\t}\n\t#endif\n\t\n\n\t/**\n\t* Have an object passed along with the onUpdate method\n\t* @method setOnUpdateParam\n\t* @param {object} onUpdateParam:object an object that will be passed along with the onUpdate method\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnUpdate( tweenMoved ).setOnUpdateParam( myObject );<br>\n\t* <br>\n\t* void tweenMoved( float val, object obj ){ }<br>\n\t*/\n\tpublic LTDescr setOnUpdateParam( object onUpdateParam ){\n\t\tthis.onUpdateParam = onUpdateParam;\n\t\treturn this;\n\t}\n\n\t/**\n\t* While tweening along a curve, set this property to true, to be perpendicalur to the path it is moving upon\n\t* @method setOrientToPath\n\t* @param {bool} doesOrient:bool whether the gameobject will orient to the path it is animating along\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.move( ltLogo, path, 1.0f ).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true).setAxis(Vector3.forward);<br>\n\t*/\n\tpublic LTDescr setOrientToPath( bool doesOrient ){\n\t\tif(this.type==TweenAction.MOVE_CURVED || this.type==TweenAction.MOVE_CURVED_LOCAL){\n\t\t\tif(this.path==null)\n\t\t\t\tthis.path = new LTBezierPath();\n\t\t\tthis.path.orientToPath = doesOrient;\n\t\t}else{\n\t\t\tthis.spline.orientToPath = doesOrient;\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t* While tweening along a curve, set this property to true, to be perpendicalur to the path it is moving upon\n\t* @method setOrientToPath2d\n\t* @param {bool} doesOrient:bool whether the gameobject will orient to the path it is animating along\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.move( ltLogo, path, 1.0f ).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true).setAxis(Vector3.forward);<br>\n\t*/\n\tpublic LTDescr setOrientToPath2d( bool doesOrient2d ){\n\t\tsetOrientToPath(doesOrient2d);\n\t\tif(this.type==TweenAction.MOVE_CURVED || this.type==TweenAction.MOVE_CURVED_LOCAL){\n\t\t\tthis.path.orientToPath2d = doesOrient2d;\n\t\t}else{\n\t\t\tthis.spline.orientToPath2d = doesOrient2d;\n\t\t}\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setRect( LTRect rect ){\n\t\tthis.ltRect = rect;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setRect( Rect rect ){\n\t\tthis.ltRect = new LTRect(rect);\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setPath( LTBezierPath path ){\n\t\tthis.path = path;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the point at which the GameObject will be rotated around\n\t* @method setPoint\n\t* @param {Vector3} point:Vector3 point at which you want the object to rotate around (local space)\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.rotateAround( cube, Vector3.up, 360.0f, 1.0f ) .setPoint( new Vector3(1f,0f,0f) ) .setEase( LeanTweenType.easeInOutBounce );<br>\n\t*/\n\tpublic LTDescr setPoint( Vector3 point ){\n\t\tthis.point = point;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setDestroyOnComplete( bool doesDestroy ){\n\t\tthis.destroyOnComplete = doesDestroy;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setAudio( object audio ){\n\t\tthis.onCompleteParam = audio;\n\t\treturn this;\n\t}\n\t\n\t/**\n\t* Set the onComplete method to be called at the end of every loop cycle (also applies to the delayedCall method)\n\t* @method setOnCompleteOnRepeat\n\t* @param {bool} isOn:bool does call onComplete on every loop cycle\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.delayedCall(gameObject,0.3f, delayedMethod).setRepeat(4).setOnCompleteOnRepeat(true);\n\t*/\n\tpublic LTDescr setOnCompleteOnRepeat( bool isOn ){\n\t\tthis.onCompleteOnRepeat = isOn;\n\t\treturn this;\n\t}\n\n\t/**\n\t* Set the onComplete method to be called at the beginning of the tween (it will still be called when it is completed as well)\n\t* @method setOnCompleteOnStart\n\t* @param {bool} isOn:bool does call onComplete at the start of the tween\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* LeanTween.delayedCall(gameObject, 2f, ()=>{<br> // Flash an object 5 times\n\t* &nbsp;LeanTween.alpha(gameObject, 0f, 1f);<br>\n\t* &nbsp;LeanTween.alpha(gameObject, 1f, 0f).setDelay(1f);<br>\n\t* }).setOnCompleteOnStart(true).setRepeat(5);<br>\n\t*/\n\tpublic LTDescr setOnCompleteOnStart( bool isOn ){\n\t\tthis.onCompleteOnStart = isOn;\n\t\treturn this;\n\t}\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\tpublic LTDescr setRect( RectTransform rect ){\n\t\tthis.rectTransform = rect;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setSprites( UnityEngine.Sprite[] sprites ){\n\t\tthis.sprites = sprites;\n\t\treturn this;\n\t}\n\n\tpublic LTDescr setFrameRate( float frameRate ){\n\t\tthis.time = this.sprites.Length / frameRate;\n\t\treturn this;\n\t}\n#endif\n\t\n\t/**\n\t* Have a method called when the tween starts\n\t* @method setOnStart ()\n\t* @param {Action<>} onStart:Action<> the method that should be called when the tween is starting ex: tweenStarted( ){ }\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n\t* <i>C#:</i><br>\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnStart( ()=>{ Debug.Log(\"I started!\"); });\n\t* <i>Javascript:</i><br>\n\t* LeanTween.moveX(gameObject, 5f, 2.0f ).setOnStart( function(){ Debug.Log(\"I started!\"); } );\n\t*/\n\tpublic LTDescr setOnStart( Action onStart ){\n        this.onStart = onStart;\n        return this;\n    }\n\n    /**\n\t* Set the direction of a tween -1f for backwards 1f for forwards (currently only bezier and spline paths are supported)\n\t* @method setDirection ()\n\t* @param {float} direction:float the direction that the tween should run, -1f for backwards 1f for forwards\n\t* @return {LTDescr} LTDescr an object that distinguishes the tween\n\t* @example\n    * LeanTween.moveSpline(gameObject, new Vector3[]{new Vector3(0f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,1f)}, 1.5f).setDirection(-1f);<br>\n\t*/\n\n    public LTDescr setDirection( float direction ){\n    \tif(this.direction!=-1f && this.direction!=1f){\n    \t\tDebug.LogWarning(\"You have passed an incorrect direction of '\"+direction+\"', direction must be -1f or 1f\");\n    \t\treturn this;\n    \t}\n\n    \tif(this.direction!=direction){\n\t    \t// Debug.Log(\"reverse path:\"+this.path+\" spline:\"+this.spline);\n\t    \tif(this.path!=null){\n\t    \t\tthis.path = new LTBezierPath( LTUtility.reverse( this.path.pts ) );\n\t\t\t}else if(this.spline!=null){\n\t\t\t\tthis.spline = new LTSpline( LTUtility.reverse( this.spline.pts ) );\n\t\t\t}\n\t\t}\n    \t\n    \treturn this;\n    }\n}\n\npublic class LTUtility {\n\n\n\tpublic static Vector3[] reverse( Vector3[] arr ){\n\t\t\n\t\tint k = arr.Length - 1;\n\t\tfor(int i=0;i<=(arr.Length/2);i++)\n\t\t{\n\t\t   Vector3 temp = arr[i];\n\t\t   arr[i]=arr[k];\n\t\t   arr[k]=temp;\n\t\t   k--;\n\t\t}\n\n\t\treturn arr;\n\t}\n}\n\n/**\n* LeanTween is an efficient tweening engine for Unity3d<br><br>\n* <a href=\"#index\">Index of All Methods</a> | <a href=\"LTDescr.html\">Optional Paramaters that can be passed</a><br><br>\n* <strong id='optional'>Optional Parameters</strong> are passed at the end of every method<br> \n* <br>\n* <i>Example:</i><br>\n* LeanTween.moveX( gameObject, 1f, 1f).setEase( <a href=\"LeanTweenType.html\">LeanTweenType</a>.easeInQuad ).setDelay(1f);<br>\n* <br>\n* You can pass the optional parameters in any order, and chain on as many as you wish!<br><br>\n* You can also modify this tween later, just save the unique id of the tween.<br>\n* <h4>Example:</h4>\n* int id = LeanTween.moveX(gameObject, 1f, 1f).id;<br>\n* <a href=\"LTDescr.html\">LTDescr</a> d = LeanTween.<a href=\"#method_LeanTween.descr\">descr</a>( id );<br><br>\n* if(d!=null){ <span style=\"color:gray\">// if the tween has already finished it will return null</span><br>\n* <span style=\"color:gray\">&nbsp;&nbsp; // change some parameters</span><br>\n* &nbsp;&nbsp; d.setOnComplete( onCompleteFunc ).setEase( <a href=\"LeanTweenType.html\">LeanTweenType</a>.easeInOutBack );<br>\n* }\n*\n* @class LeanTween\n*/\n\n[CustomLuaClass]\npublic class LeanTween : MonoBehaviour {\n\npublic static bool throwErrors = true;\npublic static float tau = Mathf.PI*2.0f; \n\nprivate static LTDescrImpl[] tweens;\nprivate static int[] tweensFinished;\nprivate static LTDescrImpl tween;\nprivate static int tweenMaxSearch = -1;\nprivate static int maxTweens = 400;\nprivate static int frameRendered= -1;\nprivate static GameObject _tweenEmpty;\nprivate static float dtEstimated = -1f;\npublic static float dtManual;\n#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2 || UNITY_4_3 || UNITY_4_5\nprivate static float previousRealTime;\n#endif\nprivate static float dt;\nprivate static float dtActual;\nprivate static int i;\nprivate static int j;\nprivate static int finishedCnt;\nprivate static AnimationCurve punch = new AnimationCurve( new Keyframe(0.0f, 0.0f ), new Keyframe(0.112586f, 0.9976035f ), new Keyframe(0.3120486f, -0.1720615f ), new Keyframe(0.4316337f, 0.07030682f ), new Keyframe(0.5524869f, -0.03141804f ), new Keyframe(0.6549395f, 0.003909959f ), new Keyframe(0.770987f, -0.009817753f ), new Keyframe(0.8838775f, 0.001939224f ), new Keyframe(1.0f, 0.0f ) );\nprivate static AnimationCurve shake = new AnimationCurve( new Keyframe(0f, 0f), new Keyframe(0.25f, 1f), new Keyframe(0.75f, -1f), new Keyframe(1f, 0f) ) ;\n\npublic static void init(){\n\tinit(maxTweens);\n}\n\npublic static int maxSearch{\n\tget{ \n\t\treturn tweenMaxSearch;\n\t}\n}\n\npublic static int tweensRunning{\n\tget{ \n\t\tint count = 0;\n\t\tfor (int i = 0; i <= tweenMaxSearch; i++){\n\t        if (tweens[i].toggle){\n\t            count++;\n\t        }\n\t    }\n\t\treturn count;\n\t}\n}\n\n/**\n* This line is optional. Here you can specify the maximum number of tweens you will use (the default is 400).  This must be called before any use of LeanTween is made for it to be effective.\n* \n* @method LeanTween.init\n* @param {integer} maxSimultaneousTweens:int The maximum number of tweens you will use, make sure you don't go over this limit, otherwise the code will throw an error\n* @example\n*   LeanTween.init( 800 );\n*/\npublic static void init(int maxSimultaneousTweens){\n\tif(tweens==null){\n\t\tmaxTweens = maxSimultaneousTweens;\n\t\ttweens = new LTDescrImpl[maxTweens];\n\t\ttweensFinished = new int[maxTweens];\n\t\t_tweenEmpty = new GameObject();\n\t\t_tweenEmpty.name = \"~LeanTween\";\n\t\t_tweenEmpty.AddComponent(typeof(LeanTween));\n\t\t_tweenEmpty.isStatic = true;\n\t\t#if !UNITY_EDITOR\n\t\t_tweenEmpty.hideFlags = HideFlags.HideAndDontSave;\n\t\t#endif\n\t\tDontDestroyOnLoad( _tweenEmpty );\n\t\tfor(int i = 0; i < maxTweens; i++){\n\t\t\ttweens[i] = new LTDescrImpl();\n\t\t}\n\t}\n}\n\npublic static void reset(){\n\tfor (int i = 0; i <= tweenMaxSearch; i++){\n        tweens[i].toggle = false;\n    }\n\ttweens = null;\n\tDestroy(_tweenEmpty);\n}\n\npublic void Update(){\n\tLeanTween.update();\n}\n\npublic void OnLevelWasLoaded( int lvl ){\n\t// Debug.Log(\"reseting gui\");\n\tLTGUI.reset();\n}\n\nprivate static Transform trans;\nprivate static float timeTotal;\nprivate static TweenAction tweenAction;\nprivate static float ratioPassed;\nprivate static float from;\n//private static float to = 1.0f;\nprivate static float val;\nprivate static bool isTweenFinished;\nprivate static int maxTweenReached;\nprivate static Vector3 newVect;\nprivate static GameObject target;\nprivate static GameObject customTarget;\n\npublic static void update() {\n\tif(frameRendered != Time.frameCount){ // make sure update is only called once per frame\n\t\tinit();\n\n\t\t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2 || UNITY_4_3 || UNITY_4_5\n\t\tdtEstimated = Time.realtimeSinceStartup - previousRealTime;\n\t\tif(dtEstimated>0.2f) // a catch put in, when at the start sometimes this number can grow unrealistically large\n\t\t\tdtEstimated = 0.2f;\n\t\tpreviousRealTime = Time.realtimeSinceStartup;\n\t\t#else\n\t\tif(dtEstimated<0f){\n\t\t\tdtEstimated = 0f;\n\t\t}else{\n\t\t\tdtEstimated = Time.unscaledDeltaTime;\n\t\t}\n\t\t// Debug.Log(\"Time.unscaledDeltaTime:\"+Time.unscaledDeltaTime);\n\t\t#endif\n\n\t\tdtActual = Time.deltaTime;\n\t\tmaxTweenReached = 0;\n\t\tfinishedCnt = 0;\n\t\t// if(tweenMaxSearch>1500)\n\t\t// Debug.Log(\"tweenMaxSearch:\"+tweenMaxSearch +\" maxTweens:\"+maxTweens);\n\t\tfor( int i = 0; i <= tweenMaxSearch && i < maxTweens; i++){\n\t\t\t\n\t\t\t//if(i==0 && tweens[i].toggle)\n\t\t\t//\tDebug.Log(\"tweens[\"+i+\"]\"+tweens[i]+\" dt:\"+dt);\n\t\t\tif(tweens[i].toggle){\n\t\t\t\tmaxTweenReached = i;\n\t\t\t\ttween = tweens[i];\n\t\t\t\ttrans = tween.trans;\n\t\t\t\ttimeTotal = tween.time;\n\t\t\t\ttweenAction = tween.type;\n\n\t\t\t\t/*if(trans.gameObject.name==\"Main Camera\"){\n\t\t\t\t\tDebug.Log(\"main tween:\"+tween+\" i:\"+i);\n\t\t\t\t}*/\n\t\t\t\t \n\t\t\t\tif( tween.useEstimatedTime ){\n\t\t\t\t\tdt = dtEstimated;\n\t\t\t\t}else if( tween.useFrames ){\n\t\t\t\t\tdt = 1;\n\t\t\t\t}else if( tween.useManualTime ){\n\t\t\t\t\tdt = dtManual;\n\t\t\t\t}else if(tween.direction==0f){\n\t\t\t\t\tdt = 0f;\n\t\t\t\t}else{\n\t\t\t\t\tdt = dtActual;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(trans==null){\n\t\t\t\t\tremoveTween(i);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t// Debug.Log(\"i:\"+i+\" tween:\"+tween+\" dt:\"+dt);\n\n\t\t\t\tif (tweenAction == TweenAction.MOVE_TO_TRANSFORM) {\n                    tween.to = tween.toTrans.position;\n                    tween.diff = tween.to - tween.from;\n                }\n\t\t\t\t\n\t\t\t\t// Check for tween finished\n\t\t\t\tisTweenFinished = false;\n\t\t\t\tif(tween.delay<=0){\n\t\t\t\t\tif((tween.passed + dt > tween.time && tween.direction > 0.0f )){\n\t\t\t\t\t\t// Debug.Log(\"i:\"+i+\" passed:\"+tween.passed+\" dt:\"+dt+\" time:\"+tween.time+\" dir:\"+tween.direction);\n\t\t\t\t\t\tisTweenFinished = true;\n\t\t\t\t\t\ttween.passed = tween.time; // Set to the exact end time so that it can finish tween exactly on the end value\n\t\t\t\t\t}else if(tween.direction<0.0f && tween.passed - dt < 0.0f){\n\t\t\t\t\t\tisTweenFinished = true;\n\t\t\t\t\t\ttween.passed = Mathf.Epsilon;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!tween.hasInitiliazed && ((tween.passed==0.0 && tween.delay==0.0) || tween.passed>0.0) ){\n\t\t\t\t\ttween.init();\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(tween.delay<=0){\n\t\t\t\t\t// Move Values\n\t\t\t\t\tif(timeTotal<=0f){\n\t\t\t\t\t\t//Debug.LogError(\"time total is zero Time.timeScale:\"+Time.timeScale+\" useEstimatedTime:\"+tween.useEstimatedTime);\n\t\t\t\t\t\tratioPassed = 1f;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tratioPassed = tween.passed / timeTotal;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(ratioPassed>1.0f){\n\t\t\t\t\t\tratioPassed = 1.0f;\n\t\t\t\t\t}else if(ratioPassed<0f){\n\t\t\t\t\t\tratioPassed = 0f;\n\t\t\t\t\t}\n\t\t\t\t\t// Debug.Log(\"action:\"+tweenAction+\" ratioPassed:\"+ratioPassed + \" timeTotal:\" + timeTotal + \" tween.passed:\"+ tween.passed +\" dt:\"+dt);\n\t\t\t\t\t\n\t\t\t\t\tif(tweenAction>=TweenAction.MOVE_X && tweenAction<TweenAction.MOVE){\n\t\t\t\t\t\tif(tween.animationCurve!=null){\n\t\t\t\t\t\t\tval = tweenOnCurve(tween, ratioPassed);\n\t\t\t\t\t\t}else {\n\t\t\t\t\t\t\tswitch( tween.tweenType ){\n\t\t\t\t\t\t\t\tcase LeanTweenType.linear:\n\t\t\t\t\t\t\t\t\tval = tween.from.x + tween.diff.x * ratioPassed; break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuad:\n\t\t\t\t\t\t\t\t\tval = easeOutQuadOpt(tween.from.x, tween.diff.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuad:\n\t\t\t\t\t\t\t\t\tval = easeInQuadOpt(tween.from.x, tween.diff.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuad:\n\t\t\t\t\t\t\t\t\tval = easeInOutQuadOpt(tween.from.x, tween.diff.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInCubic:\n\t\t\t\t\t\t\t\t\tval = easeInCubic(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutCubic:\n\t\t\t\t\t\t\t\t\tval = easeOutCubic(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutCubic:\n\t\t\t\t\t\t\t\t\tval = easeInOutCubic(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuart:\n\t\t\t\t\t\t\t\t\tval = easeInQuart(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuart:\n\t\t\t\t\t\t\t\t\tval = easeOutQuart(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuart:\n\t\t\t\t\t\t\t\t\tval = easeInOutQuart(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuint:\n\t\t\t\t\t\t\t\t\tval = easeInQuint(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuint:\n\t\t\t\t\t\t\t\t\tval = easeOutQuint(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuint:\n\t\t\t\t\t\t\t\t\tval = easeInOutQuint(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInSine:\n\t\t\t\t\t\t\t\t\tval = easeInSine(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutSine:\n\t\t\t\t\t\t\t\t\tval = easeOutSine(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutSine:\n\t\t\t\t\t\t\t\t\tval = easeInOutSine(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInExpo:\n\t\t\t\t\t\t\t\t\tval = easeInExpo(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutExpo:\n\t\t\t\t\t\t\t\t\tval = easeOutExpo(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutExpo:\n\t\t\t\t\t\t\t\t\tval = easeInOutExpo(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInCirc:\n\t\t\t\t\t\t\t\t\tval = easeInCirc(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutCirc:\n\t\t\t\t\t\t\t\t\tval = easeOutCirc(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutCirc:\n\t\t\t\t\t\t\t\t\tval = easeInOutCirc(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInBounce:\n\t\t\t\t\t\t\t\t\tval = easeInBounce(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutBounce:\n\t\t\t\t\t\t\t\t\tval = easeOutBounce(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutBounce:\n\t\t\t\t\t\t\t\t\tval = easeInOutBounce(tween.from.x, tween.to.x, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInBack:\n\t\t\t\t\t\t\t\t\tval = easeInBack(tween.from.x, tween.to.x, ratioPassed, tween.overshoot); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutBack:\n\t\t\t\t\t\t\t\t\tval = easeOutBack(tween.from.x, tween.to.x, ratioPassed, tween.overshoot); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutBack:\n\t\t\t\t\t\t\t\t\tval = easeInOutBack(tween.from.x, tween.to.x, ratioPassed, tween.overshoot); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInElastic:\n\t\t\t\t\t\t\t\t\tval = easeInElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutElastic:\n\t\t\t\t\t\t\t\t\tval = easeOutElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutElastic:\n\t\t\t\t\t\t\t\t\tval = easeInOutElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period); break;\n                                case LeanTweenType.punch:\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeShake:\n\t\t\t\t\t\t\t\t\tif(tween.tweenType==LeanTweenType.punch){\n\t\t\t\t\t\t\t\t\t\ttween.animationCurve = LeanTween.punch;\n\t\t\t\t\t\t\t\t\t}else if(tween.tweenType==LeanTweenType.easeShake){\n\t\t\t\t\t\t\t\t\t\ttween.animationCurve = LeanTween.shake;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\ttween.toInternal.x = tween.from.x + tween.to.x;\n\t\t\t\t\t\t\t\t\ttween.diffInternal.x = tween.to.x - tween.from.x;\n\t\t\t\t\t\t\t\t\tval = tweenOnCurve(tween, ratioPassed); break;\n\t\t\t\t\t\t\t\tcase LeanTweenType.easeSpring:\n\t\t\t\t\t\t\t\t\tval = spring(tween.from.x, tween.to.x, ratioPassed); break;\n                                default:\n                                    {\n                                        val = tween.from.x + tween.diff.x * ratioPassed; break;\n                                    }\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Debug.Log(\"from:\"+from+\" val:\"+val+\" ratioPassed:\"+ratioPassed);\n\t\t\t\t\t\tif(tweenAction==TweenAction.MOVE_X){\n\t\t\t\t\t\t\ttrans.position=new Vector3( val,trans.position.y,trans.position.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_Y){\n\t\t\t\t\t\t\ttrans.position =new Vector3( trans.position.x,val,trans.position.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_Z){\n\t\t\t\t\t\t\ttrans.position=new Vector3( trans.position.x,trans.position.y,val);\n\t\t\t\t\t\t}if(tweenAction==TweenAction.MOVE_LOCAL_X){\n\t\t\t\t\t\t\ttrans.localPosition=new Vector3( val,trans.localPosition.y,trans.localPosition.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_LOCAL_Y){\n\t\t\t\t\t\t\ttrans.localPosition=new Vector3( trans.localPosition.x,val,trans.localPosition.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_LOCAL_Z){\n\t\t\t\t\t\t\ttrans.localPosition=new Vector3( trans.localPosition.x,trans.localPosition.y,val);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_CURVED){\n\t\t\t\t\t\t\tif(tween.path.orientToPath){\n\t\t\t\t\t\t\t\tif(tween.path.orientToPath2d){\n\t\t\t\t\t\t\t\t\ttween.path.place2d( trans, val );\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\ttween.path.place( trans, val );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\ttrans.position = tween.path.point( val );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Debug.Log(\"val:\"+val+\" trans.position:\"+trans.position + \" 0:\"+ tween.curves[0] +\" 1:\"+tween.curves[1] +\" 2:\"+tween.curves[2] +\" 3:\"+tween.curves[3]);\n\t\t\t\t\t\t}else if((TweenAction)tweenAction==TweenAction.MOVE_CURVED_LOCAL){\n\t\t\t\t\t\t\tif(tween.path.orientToPath){\n\t\t\t\t\t\t\t\tif(tween.path.orientToPath2d){\n\t\t\t\t\t\t\t\t\ttween.path.placeLocal2d( trans, val );\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\ttween.path.placeLocal( trans, val );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\ttrans.localPosition = tween.path.point( val );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Debug.Log(\"val:\"+val+\" trans.position:\"+trans.position);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_SPLINE){\n\t\t\t\t\t\t\tif(tween.spline.orientToPath){\n\t\t\t\t\t\t\t\tif(tween.spline.orientToPath2d){\n\t\t\t\t\t\t\t\t\ttween.spline.place2d( trans, val );\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\ttween.spline.place( trans, val );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\ttrans.position = tween.spline.point( val );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.MOVE_SPLINE_LOCAL){\n\t\t\t\t\t\t\tif(tween.spline.orientToPath){\n\t\t\t\t\t\t\t\tif(tween.spline.orientToPath2d){\n\t\t\t\t\t\t\t\t\ttween.spline.placeLocal2d( trans, val );\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\ttween.spline.placeLocal( trans, val );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\ttrans.localPosition = tween.spline.point( val );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.SCALE_X){\n\t\t\t\t\t\t\ttrans.localScale=new Vector3(val, trans.localScale.y,trans.localScale.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.SCALE_Y){\n\t\t\t\t\t\t\ttrans.localScale=new Vector3( trans.localScale.x,val,trans.localScale.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.SCALE_Z){\n\t\t\t\t\t\t\ttrans.localScale=new Vector3(trans.localScale.x,trans.localScale.y,val);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.ROTATE_X){\n\t\t\t\t\t    \ttrans.eulerAngles=new Vector3(val, trans.eulerAngles.y,trans.eulerAngles.z);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE_Y){\n\t\t\t\t\t    \ttrans.eulerAngles=new Vector3(trans.eulerAngles.x,val,trans.eulerAngles.z);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE_Z){\n\t\t\t\t\t    \ttrans.eulerAngles=new Vector3(trans.eulerAngles.x,trans.eulerAngles.y,val);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE_AROUND){\n\t\t\t\t\t\t\tVector3 origPos = trans.localPosition;\n\t\t\t\t\t\t\tVector3 rotateAroundPt = (Vector3)trans.TransformPoint( tween.point );\n\t\t\t    \t\t\ttrans.RotateAround(rotateAroundPt, tween.axis, -val);\n\t\t\t    \t\t\tVector3 diff = origPos - trans.localPosition;\n\t\t\t    \t\t\t\n\t\t\t    \t\t\ttrans.localPosition = origPos - diff; // Subtract the amount the object has been shifted over by the rotate, to get it back to it's orginal position\n\t\t\t    \t\t\ttrans.rotation = tween.origRotation;\n\n\t\t\t    \t\t\trotateAroundPt = (Vector3)trans.TransformPoint( tween.point );\n\t\t\t\t    \t\ttrans.RotateAround(rotateAroundPt, tween.axis, val);\n\n\t\t\t\t    \t\t//GameObject cubeMarker = GameObject.Find(\"TweenRotatePoint\");\n\t\t\t    \t\t\t//cubeMarker.transform.position = rotateAroundPt;\n\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE_AROUND_LOCAL){\n\t\t\t\t\t\t\tVector3 origPos = trans.localPosition;\n\t\t\t    \t\t\ttrans.RotateAround((Vector3)trans.TransformPoint( tween.point ), trans.TransformDirection(tween.axis), -val);\n\t\t\t    \t\t\tVector3 diff = origPos - trans.localPosition;\n\t\t\t    \t\t\t\n\t\t\t    \t\t\ttrans.localPosition = origPos - diff; // Subtract the amount the object has been shifted over by the rotate, to get it back to it's orginal position\n\t\t\t    \t\t\ttrans.localRotation = tween.origRotation;\n\t\t\t    \t\t\tVector3 rotateAroundPt = (Vector3)trans.TransformPoint( tween.point );\n\t\t\t    \t\t\ttrans.RotateAround(rotateAroundPt, trans.TransformDirection(tween.axis), val);\n\n\t\t\t    \t\t\t//GameObject cubeMarker = GameObject.Find(\"TweenRotatePoint\");\n\t\t\t    \t\t\t//cubeMarker.transform.position = rotateAroundPt;\n\t\t    \t\t\t\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ALPHA){\n\t\t\t\t\t    \t#if UNITY_3_5 || UNITY_4_0 || UNITY_4_0_1 || UNITY_4_1 || UNITY_4_2\n\n\t\t\t\t\t    \tif(trans.gameObject.renderer){\n\t\t\t\t\t\t\t\tforeach(Material mat in trans.gameObject.renderer.materials){\n\t        \t\t\t\t\t\tmat.color = new Color( mat.color.r, mat.color.g, mat.color.b, val);\n\t    \t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(trans.childCount>0){\n\t\t\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t\t\t\t\t\t\t\tif(child.gameObject.renderer!=null){\n\t\t\t\t\t\t\t\t\t\tforeach(Material mat in child.gameObject.renderer.materials){\n\t\t\t        \t\t\t\t\t\tmat.color = new Color( mat.color.r, mat.color.g, mat.color.b, val);\n\t\t\t    \t\t\t\t\t\t}\n\t\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t#else\n\n\t\t\t\t\t\t\tSpriteRenderer ren = trans.gameObject.GetComponent<SpriteRenderer>();\n\n\t\t\t\t\t\t\tif(ren!=null){\n\t\t\t\t\t\t\t\tren.color = new Color( ren.color.r, ren.color.g, ren.color.b, val);\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tif(trans.gameObject.GetComponent<Renderer>()!=null){\n\t\t\t\t\t\t\t\t\tforeach(Material mat in trans.gameObject.GetComponent<Renderer>().materials){\n\t\t\t\t\t\t\t\t\t\tif(mat.HasProperty(\"_Color\")){\n\t\t\t        \t\t\t\t\t\tmat.color = new Color( mat.color.r, mat.color.g, mat.color.b, val);\n\t\t        \t\t\t\t\t\t}else if(mat.HasProperty(\"_TintColor\")){\n\t\t        \t\t\t\t\t\t\tColor col = mat.GetColor (\"_TintColor\");\n\t\t\t\t\t\t\t\t\t\t\tmat.SetColor(\"_TintColor\", new Color( col.r, col.g, col.b, val));\n\t\t        \t\t\t\t\t\t}\n\t\t    \t\t\t\t\t\t}\n\t\t    \t\t\t\t\t}\n\t    \t\t\t\t\t\tif(trans.childCount>0){\n\t    \t\t\t\t\t\t\tforeach (Transform child in trans) {\n\t    \t\t\t\t\t\t\t\tif(child.gameObject.GetComponent<Renderer>()!=null){\n\t\t    \t\t\t\t\t\t\t\tforeach(Material mat in child.gameObject.GetComponent<Renderer>().materials){\n\t\t    \t\t\t\t\t\t\t\t\tmat.color = new Color( mat.color.r, mat.color.g, mat.color.b, val);\n\t\t\t\t    \t\t\t\t\t\t}\n\t\t\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t    \t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n    \t\t\t\t\t\t#endif\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.ALPHA_VERTEX){\n\t\t\t\t\t\t\tMesh mesh = trans.GetComponent<MeshFilter>().mesh;\n\t\t\t\t\t\t\tVector3[] vertices = mesh.vertices;\n\t\t\t\t\t\t\tColor32[] colors = new Color32[vertices.Length];\n\t\t\t\t\t\t\tColor32 c = mesh.colors32[0];\n\t\t\t\t\t\t\tc = new Color( c.r, c.g, c.b, val);\n\t\t\t\t\t\t\tfor (int k= 0; k < vertices.Length; k++) {\n\t\t\t\t\t\t\t\tcolors[k] = c;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmesh.colors32 = colors;\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.COLOR || tweenAction==TweenAction.CALLBACK_COLOR){\n\t\t\t\t\t\t\tColor toColor = tweenColor(tween, val);\n\n\t\t\t\t\t\t\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2\n\t\t\t\t\t\t\tSpriteRenderer ren = trans.gameObject.GetComponent<SpriteRenderer>();\n\t\t\t\t\t\t\tif(ren!=null){\n\t\t\t\t\t\t\t\tren.color = toColor;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t#endif\n\t\t\t\t\t\t\t\t// Debug.Log(\"val:\"+val+\" tween:\"+tween+\" tween.diff:\"+tween.diff);\n\t\t\t\t\t\t\t\tif(tweenAction==TweenAction.COLOR){\n\t\t\t\t\t\t\t\t\tif(trans.gameObject.GetComponent<Renderer>()!=null){\n\t\t\t\t\t\t\t\t\t\tforeach(Material mat in trans.gameObject.GetComponent<Renderer>().materials){\n\t\t\t        \t\t\t\t\t\tmat.color = toColor;\n\t\t\t    \t\t\t\t\t\t}\n\t\t\t    \t\t\t\t\t}\n\t\t\t    \t\t\t\t\tif(trans.childCount>0){\n\t\t    \t\t\t\t\t\t\tforeach (Transform child in trans) {\n\t\t    \t\t\t\t\t\t\t\tif(child.gameObject.GetComponent<Renderer>()!=null){\n\t\t\t    \t\t\t\t\t\t\t\tforeach(Material mat in child.gameObject.GetComponent<Renderer>().materials){\n\t\t\t\t\t        \t\t\t\t\t\tmat.color = toColor;\n\t\t\t\t\t    \t\t\t\t\t\t}\n\t\t\t\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t    \t\t\t\t\t\t}\n\t\t\t    \t\t\t\t}\n\t\t\t    \t\t\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2\n\t\t\t    \t\t\t}\n\t\t\t    \t\t\t#endif\n\t\t    \t\t\t\tif(dt!=0f && tween.onUpdateColor!=null){\n\t\t\t\t\t\t\t\ttween.onUpdateColor(toColor);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n                        else if (tweenAction == TweenAction.CANVAS_ALPHA){\n                            Color c = tween.uiImage.color;\n                            c.a = val;\n                            tween.uiImage.color = c;\n                        }\n                        else if (tweenAction == TweenAction.CANVAS_COLOR){\n                            Color toColor = tweenColor(tween, val);\n                            tween.uiImage.color = toColor;\n                            if (dt!=0f && tween.onUpdateColor != null){\n                                tween.onUpdateColor(toColor);\n                            }\n                        }\n                        else if (tweenAction == TweenAction.CANVASGROUP_ALPHA){\n                        \tCanvasGroup canvasGroup = tween.trans.GetComponent<CanvasGroup>();\n                            canvasGroup.alpha = val;\n                        }\n                        else if (tweenAction == TweenAction.TEXT_ALPHA){\n                        \ttextAlphaRecursive( trans, val );\n                        }\n                        else if (tweenAction == TweenAction.TEXT_COLOR){\n                            Color toColor = tweenColor(tween, val);\n                            tween.uiText.color = toColor;\n                        \tif (dt!=0f && tween.onUpdateColor != null){\n                                tween.onUpdateColor(toColor);\n                            }\n                            if(trans.childCount>0){\n    \t\t\t\t\t\t\tforeach (Transform child in trans) {\n    \t\t\t\t\t\t\t\tUnityEngine.UI.Text uiText = child.gameObject.GetComponent<UnityEngine.UI.Text>();\n    \t\t\t\t\t\t\t\tif(uiText!=null){\n\t    \t\t\t\t\t\t\t\tuiText.color = toColor;\n\t\t\t    \t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n    \t\t\t\t\t\t}\n                        }\n\t\t\t\t\t\telse if(tweenAction==TweenAction.CANVAS_ROTATEAROUND){\n\t\t\t\t\t\t\t// figure out how much the rotation has shifted the object over\n\t\t\t    \t\t\tRectTransform rect = tween.rectTransform;\n\t\t\t    \t\t\tVector3 origPos = rect.localPosition;\n\t\t\t    \t\t\trect.RotateAround((Vector3)rect.TransformPoint( tween.point ), tween.axis, -val);\n\t\t\t    \t\t\tVector3 diff = origPos - rect.localPosition;\n\t\t\t    \t\t\t\n\t\t\t    \t\t\trect.localPosition = origPos - diff; // Subtract the amount the object has been shifted over by the rotate, to get it back to it's orginal position\n\t\t\t    \t\t\trect.rotation = tween.origRotation;\n\t\t\t\t    \t\trect.RotateAround((Vector3)rect.TransformPoint( tween.point ), tween.axis, val);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.CANVAS_ROTATEAROUND_LOCAL){\n\t\t\t\t\t\t\t// figure out how much the rotation has shifted the object over\n\t\t\t    \t\t\tRectTransform rect = tween.rectTransform;\n\t\t\t    \t\t\tVector3 origPos = rect.localPosition;\n\t\t\t    \t\t\trect.RotateAround((Vector3)rect.TransformPoint( tween.point ), rect.TransformDirection(tween.axis), -val);\n\t\t\t    \t\t\tVector3 diff = origPos - rect.localPosition;\n\t\t\t    \t\t\t\n\t\t\t    \t\t\trect.localPosition = origPos - diff; // Subtract the amount the object has been shifted over by the rotate, to get it back to it's orginal position\n\t\t\t    \t\t\trect.rotation = tween.origRotation;\n\t\t\t\t    \t\trect.RotateAround((Vector3)rect.TransformPoint( tween.point ), rect.TransformDirection(tween.axis), val);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.CANVAS_PLAYSPRITE){\n\t\t\t\t\t\t\tint frame = (int)Mathf.Round( val );\n\t\t\t\t\t\t\t// Debug.Log(\"frame:\"+frame+\" val:\"+val);\n\t\t\t\t\t\t\ttween.uiImage.sprite = tween.sprites[ frame ];\n\t\t\t\t\t    }else if(tweenAction==TweenAction.CANVAS_MOVE_X){\n\t\t\t\t\t    \tVector3 current = tween.rectTransform.anchoredPosition3D;\n\t\t\t\t\t\t\ttween.rectTransform.anchoredPosition3D = new Vector3(val, current.y, current.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.CANVAS_MOVE_Y){\n\t\t\t\t\t    \tVector3 current = tween.rectTransform.anchoredPosition3D;\n\t\t\t\t\t\t\ttween.rectTransform.anchoredPosition3D = new Vector3(current.x, val, current.z);\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.CANVAS_MOVE_Z){\n\t\t\t\t\t    \tVector3 current = tween.rectTransform.anchoredPosition3D;\n\t\t\t\t\t\t\ttween.rectTransform.anchoredPosition3D = new Vector3(current.x, current.y, val);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t#endif\n\t\t\t\t\t\t\n\t\t\t\t\t}else if(tweenAction>=TweenAction.MOVE){\n\t\t\t\t\t\t//\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(tween.animationCurve!=null){\n\t\t\t\t\t\t\tnewVect = tweenOnCurveVector(tween, ratioPassed);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(tween.tweenType == LeanTweenType.linear){\n\t\t\t\t\t\t\t\tnewVect = new Vector3( tween.from.x + tween.diff.x * ratioPassed, tween.from.y + tween.diff.y * ratioPassed, tween.from.z + tween.diff.z * ratioPassed);\n\t\t\t\t\t\t\t}else if(tween.tweenType >= LeanTweenType.linear){\n\t\t\t\t\t\t\t\tswitch(tween.tweenType){\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuad:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutQuadOpt(tween.from.x, tween.diff.x, ratioPassed), easeOutQuadOpt(tween.from.y, tween.diff.y, ratioPassed), easeOutQuadOpt(tween.from.z, tween.diff.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuad:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInQuadOpt(tween.from.x, tween.diff.x, ratioPassed), easeInQuadOpt(tween.from.y, tween.diff.y, ratioPassed), easeInQuadOpt(tween.from.z, tween.diff.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuad:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutQuadOpt(tween.from.x, tween.diff.x, ratioPassed), easeInOutQuadOpt(tween.from.y, tween.diff.y, ratioPassed), easeInOutQuadOpt(tween.from.z, tween.diff.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInCubic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInCubic(tween.from.x, tween.to.x, ratioPassed), easeInCubic(tween.from.y, tween.to.y, ratioPassed), easeInCubic(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutCubic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutCubic(tween.from.x, tween.to.x, ratioPassed), easeOutCubic(tween.from.y, tween.to.y, ratioPassed), easeOutCubic(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutCubic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutCubic(tween.from.x, tween.to.x, ratioPassed), easeInOutCubic(tween.from.y, tween.to.y, ratioPassed), easeInOutCubic(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuart:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInQuart(tween.from.x, tween.to.x, ratioPassed), easeInQuart(tween.from.y, tween.to.y, ratioPassed), easeInQuart(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuart:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutQuart(tween.from.x, tween.to.x, ratioPassed), easeOutQuart(tween.from.y, tween.to.y, ratioPassed), easeOutQuart(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuart:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutQuart(tween.from.x, tween.to.x, ratioPassed), easeInOutQuart(tween.from.y, tween.to.y, ratioPassed), easeInOutQuart(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInQuint:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInQuint(tween.from.x, tween.to.x, ratioPassed), easeInQuint(tween.from.y, tween.to.y, ratioPassed), easeInQuint(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutQuint:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutQuint(tween.from.x, tween.to.x, ratioPassed), easeOutQuint(tween.from.y, tween.to.y, ratioPassed), easeOutQuint(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutQuint:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutQuint(tween.from.x, tween.to.x, ratioPassed), easeInOutQuint(tween.from.y, tween.to.y, ratioPassed), easeInOutQuint(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInSine:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInSine(tween.from.x, tween.to.x, ratioPassed), easeInSine(tween.from.y, tween.to.y, ratioPassed), easeInSine(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutSine:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutSine(tween.from.x, tween.to.x, ratioPassed), easeOutSine(tween.from.y, tween.to.y, ratioPassed), easeOutSine(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutSine:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutSine(tween.from.x, tween.to.x, ratioPassed), easeInOutSine(tween.from.y, tween.to.y, ratioPassed), easeInOutSine(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInExpo:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInExpo(tween.from.x, tween.to.x, ratioPassed), easeInExpo(tween.from.y, tween.to.y, ratioPassed), easeInExpo(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutExpo:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutExpo(tween.from.x, tween.to.x, ratioPassed), easeOutExpo(tween.from.y, tween.to.y, ratioPassed), easeOutExpo(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutExpo:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutExpo(tween.from.x, tween.to.x, ratioPassed), easeInOutExpo(tween.from.y, tween.to.y, ratioPassed), easeInOutExpo(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInCirc:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInCirc(tween.from.x, tween.to.x, ratioPassed), easeInCirc(tween.from.y, tween.to.y, ratioPassed), easeInCirc(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutCirc:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutCirc(tween.from.x, tween.to.x, ratioPassed), easeOutCirc(tween.from.y, tween.to.y, ratioPassed), easeOutCirc(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutCirc:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutCirc(tween.from.x, tween.to.x, ratioPassed), easeInOutCirc(tween.from.y, tween.to.y, ratioPassed), easeInOutCirc(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInBounce:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInBounce(tween.from.x, tween.to.x, ratioPassed), easeInBounce(tween.from.y, tween.to.y, ratioPassed), easeInBounce(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutBounce:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutBounce(tween.from.x, tween.to.x, ratioPassed), easeOutBounce(tween.from.y, tween.to.y, ratioPassed), easeOutBounce(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutBounce:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutBounce(tween.from.x, tween.to.x, ratioPassed), easeInOutBounce(tween.from.y, tween.to.y, ratioPassed), easeInOutBounce(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInBack:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInBack(tween.from.x, tween.to.x, ratioPassed), easeInBack(tween.from.y, tween.to.y, ratioPassed), easeInBack(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutBack:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutBack(tween.from.x, tween.to.x, ratioPassed, tween.overshoot), easeOutBack(tween.from.y, tween.to.y, ratioPassed, tween.overshoot), easeOutBack(tween.from.z, tween.to.z, ratioPassed, tween.overshoot)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutBack:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutBack(tween.from.x, tween.to.x, ratioPassed, tween.overshoot), easeInOutBack(tween.from.y, tween.to.y, ratioPassed, tween.overshoot), easeInOutBack(tween.from.z, tween.to.z, ratioPassed, tween.overshoot)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInElastic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period), easeInElastic(tween.from.y, tween.to.y, ratioPassed, tween.overshoot, tween.period), easeInElastic(tween.from.z, tween.to.z, ratioPassed, tween.overshoot, tween.period)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeOutElastic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeOutElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period), easeOutElastic(tween.from.y, tween.to.y, ratioPassed, tween.overshoot, tween.period), easeOutElastic(tween.from.z, tween.to.z, ratioPassed, tween.overshoot, tween.period)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeInOutElastic:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(easeInOutElastic(tween.from.x, tween.to.x, ratioPassed, tween.overshoot, tween.period), easeInOutElastic(tween.from.y, tween.to.y, ratioPassed, tween.overshoot, tween.period), easeInOutElastic(tween.from.z, tween.to.z, ratioPassed, tween.overshoot, tween.period)); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.punch:\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeShake:\n\t\t\t\t\t\t\t\t\t\tif(tween.tweenType==LeanTweenType.punch){\n\t\t\t\t\t\t\t\t\t\t\ttween.animationCurve = LeanTween.punch;\n\t\t\t\t\t\t\t\t\t\t}else if(tween.tweenType==LeanTweenType.easeShake){\n\t\t\t\t\t\t\t\t\t\t\ttween.animationCurve = LeanTween.shake;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\ttween.toInternal = tween.from + tween.to;\n\t\t\t\t\t\t\t\t\t\ttween.diff = tween.to - tween.from;\n\t\t\t\t\t\t\t\t\t\tif(tweenAction==TweenAction.ROTATE || tweenAction==TweenAction.ROTATE_LOCAL){\n\t\t\t\t\t\t\t\t\t\t\ttween.to = new Vector3(closestRot(tween.from.x, tween.to.x), closestRot(tween.from.y, tween.to.y), closestRot(tween.from.z, tween.to.z));\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tnewVect = tweenOnCurveVector(tween, ratioPassed); break;\n\t\t\t\t\t\t\t\t\tcase LeanTweenType.easeSpring:\n\t\t\t\t\t\t\t\t\t\tnewVect = new Vector3(spring(tween.from.x, tween.to.x, ratioPassed), spring(tween.from.y, tween.to.y, ratioPassed), spring(tween.from.z, tween.to.z, ratioPassed)); break;\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tnewVect = new Vector3( tween.from.x + tween.diff.x * ratioPassed, tween.from.y + tween.diff.y * ratioPassed, tween.from.z + tween.diff.z * ratioPassed);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t \n\t\t\t\t\t\tif(tweenAction==TweenAction.MOVE){\n\t\t\t\t\t\t\ttrans.position = newVect;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.MOVE_LOCAL){\n\t\t\t\t\t\t\ttrans.localPosition = newVect;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.MOVE_TO_TRANSFORM){\n\t\t\t\t\t\t\ttrans.position = newVect;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE){\n\t\t\t\t\t    \t/*if(tween.hasPhysics){\n\t\t\t\t\t    \t\ttrans.gameObject.rigidbody.MoveRotation(Quaternion.Euler( newVect ));\n\t\t\t\t    \t\t}else{*/\n\t\t\t\t    \t\t\ttrans.eulerAngles = newVect;\n\t\t\t\t    \t\t// }\n\t\t\t\t\t    }else if(tweenAction==TweenAction.ROTATE_LOCAL){\n\t\t\t\t\t    \ttrans.localEulerAngles = newVect;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.SCALE){\n\t\t\t\t\t    \ttrans.localScale = newVect;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.GUI_MOVE){\n\t\t\t\t\t    \ttween.ltRect.rect = new Rect( newVect.x, newVect.y, tween.ltRect.rect.width, tween.ltRect.rect.height);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.GUI_MOVE_MARGIN){\n\t\t\t\t\t    \ttween.ltRect.margin = new Vector2(newVect.x, newVect.y);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.GUI_SCALE){\n\t\t\t\t\t    \ttween.ltRect.rect = new Rect( tween.ltRect.rect.x, tween.ltRect.rect.y, newVect.x, newVect.y);\n\t\t\t\t\t    }else if(tweenAction==TweenAction.GUI_ALPHA){\n\t\t\t\t\t    \ttween.ltRect.alpha = newVect.x;\n\t\t\t\t\t    }else if(tweenAction==TweenAction.GUI_ROTATE){\n\t\t\t\t\t    \ttween.ltRect.rotation = newVect.x;\n\t\t\t\t\t    }\n\t\t\t\t\t    #if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\t\t\t\t\t\telse if(tweenAction==TweenAction.CANVAS_MOVE){\n\t\t\t\t\t\t\ttween.rectTransform.anchoredPosition3D = newVect;\n\t\t\t\t\t\t}else if(tweenAction==TweenAction.CANVAS_SCALE){\n\t\t\t\t\t\t\ttween.rectTransform.localScale = newVect;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t#endif\n\t\t\t\t\t}\n\t\t\t\t\t// Debug.Log(\"tween.delay:\"+tween.delay + \" tween.passed:\"+tween.passed + \" tweenAction:\"+tweenAction + \" to:\"+newVect+\" axis:\"+tween.axis);\n\n\t\t\t\t\tif(dt!=0f && tween.hasUpdateCallback){\n\t\t\t\t\t\tif(tween.onUpdateFloat!=null){\n\t\t\t\t\t\t\ttween.onUpdateFloat(val);\n\t\t\t\t\t\t}\n                        if (tween.onUpdateFloatRatio != null){\n                            tween.onUpdateFloatRatio(val,ratioPassed);\n                        }else if(tween.onUpdateFloatObject!=null){\n\t\t\t\t\t\t\ttween.onUpdateFloatObject(val, tween.onUpdateParam);\n\t\t\t\t\t\t}else if(tween.onUpdateVector3Object!=null){\n\t\t\t\t\t\t\ttween.onUpdateVector3Object(newVect, tween.onUpdateParam);\n\t\t\t\t\t\t}else if(tween.onUpdateVector3!=null){\n\t\t\t\t\t\t\ttween.onUpdateVector3(newVect);\n\t\t\t\t\t\t}else if(tween.onUpdateVector2!=null){\n\t\t\t\t\t\t\ttween.onUpdateVector2(new Vector2(newVect.x,newVect.y));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t#if LEANTWEEN_1\n\t\t\t\t\telse if(tween.optional!=null){ // LeanTween 1.x legacy stuff\n\t\t\t\t\t\tvar onUpdate = tween.optional[\"onUpdate\"];\n\t\t\t\t\t\tif(onUpdate!=null){\n\t\t\t\t\t\t\tHashtable updateParam = (Hashtable)tween.optional[\"onUpdateParam\"];\n\t\t\t\t\t\t\tif((TweenAction)tweenAction==TweenAction.VALUE3){\n\t\t\t\t\t\t\t\tif(onUpdate.GetType() == typeof(string)){\n\t\t\t\t\t\t\t\t\tstring onUpdateS = onUpdate as string;\n\t\t\t\t\t\t\t\t\tcustomTarget = tween.optional[\"onUpdateTarget\"]!=null ? tween.optional[\"onUpdateTarget\"] as GameObject : trans.gameObject;\n\t\t\t\t\t\t\t\t\tcustomTarget.BroadcastMessage( onUpdateS, newVect );\n\t\t\t\t\t\t\t\t}else if(onUpdate.GetType() == typeof(System.Action<Vector3, Hashtable>)){\n\t\t\t\t\t\t\t\t\tSystem.Action<Vector3, Hashtable> onUpdateA = (System.Action<Vector3, Hashtable>)onUpdate;\n\t\t\t\t\t\t\t\t\tonUpdateA(newVect, updateParam);\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\tSystem.Action<Vector3> onUpdateA = (System.Action<Vector3>)onUpdate;\n\t\t\t\t\t\t\t\t\tonUpdateA(newVect);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tif(onUpdate.GetType() == typeof(string)){\n\t\t\t\t\t\t\t\t\tstring onUpdateS = onUpdate as string;\n\t\t\t\t\t\t\t\t\tif (tween.optional[\"onUpdateTarget\"]!=null){\n\t\t\t\t\t\t\t\t\t\tcustomTarget = tween.optional[\"onUpdateTarget\"] as GameObject;\n\t\t\t\t\t\t\t\t\t\tcustomTarget.BroadcastMessage( onUpdateS, val );\n\t\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\t\ttrans.gameObject.BroadcastMessage( onUpdateS, val );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}else if(onUpdate.GetType() == typeof(System.Action<float, Hashtable>)){\n\t\t\t\t\t\t\t\t\tSystem.Action<float, Hashtable> onUpdateA = (System.Action<float, Hashtable>)onUpdate;\n\t\t\t\t\t\t\t\t\tonUpdateA(val, updateParam);\n\t\t\t\t\t\t\t\t}else if(onUpdate.GetType() == typeof(System.Action<Vector3>)){\n\t\t\t\t\t\t\t\t\tSystem.Action<Vector3> onUpdateA = (System.Action<Vector3>)onUpdate;\n\t\t\t\t\t\t\t\t\tonUpdateA( newVect );\n\t\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\tSystem.Action<float> onUpdateA = (System.Action<float>)onUpdate;\n\t\t\t\t\t\t\t\t\tonUpdateA(val);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t#endif\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(isTweenFinished){\n\t\t\t\t\tif(tween.loopType==LeanTweenType.once || tween.loopCount==1){\n\t\t\t\t\t\ttweensFinished[finishedCnt] = i;\n\t\t\t\t\t\tfinishedCnt++;\n\n\t\t\t\t\t\t//Debug.Log(\"finished tween:\"+i+\" tween:\"+tween);\n\t\t\t\t\t\tif(tweenAction==TweenAction.GUI_ROTATE)\n\t\t\t\t\t\t\ttween.ltRect.rotateFinished = true;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(tweenAction==TweenAction.DELAYED_SOUND){\n\t\t\t\t\t\t\tAudioSource.PlayClipAtPoint((AudioClip)tween.onCompleteParam, tween.to, tween.from.x);\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif((tween.loopCount<0 && tween.type==TweenAction.CALLBACK) || tween.onCompleteOnRepeat){\n\t\t\t\t\t\t\tif(tweenAction==TweenAction.DELAYED_SOUND){\n\t\t\t\t\t\t\t\tAudioSource.PlayClipAtPoint((AudioClip)tween.onCompleteParam, tween.to, tween.from.x);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(tween.onComplete!=null){\n\t\t\t\t\t\t\t\ttween.onComplete();\n\t\t\t\t\t\t\t}else if(tween.onCompleteObject!=null){\n\t\t\t\t\t\t\t\ttween.onCompleteObject(tween.onCompleteParam);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(tween.loopCount>=1){\n\t\t\t\t\t\t\ttween.loopCount--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Debug.Log(\"tween.loopType:\"+tween.loopType+\" tween.loopCount:\"+tween.loopCount+\" passed:\"+tween.passed);\n\t\t\t\t\t\tif(tween.loopType==LeanTweenType.pingPong){\n\t\t\t\t\t\t\ttween.direction = 0.0f-(tween.direction);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\ttween.passed = Mathf.Epsilon;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else if(tween.delay<=0f){\n\t\t\t\t\ttween.passed += dt*tween.direction;\n\t\t\t\t}else{\n\t\t\t\t\ttween.delay -= dt;\n\t\t\t\t\t// Debug.Log(\"dt:\"+dt+\" tween:\"+i+\" tween:\"+tween);\n\t\t\t\t\tif(tween.delay<0f){\n\t\t\t\t\t\ttween.passed = 0.0f;//-tween.delay\n\t\t\t\t\t\ttween.delay = 0.0f;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Debug.Log(\"maxTweenReached:\"+maxTweenReached);\n\t\ttweenMaxSearch = maxTweenReached;\n\t\tframeRendered = Time.frameCount;\n\n\t\tfor(int i = 0; i < finishedCnt; i++){\n\t\t\tj = tweensFinished[i];\n\t\t\ttween = tweens[ j ];\n\t\n\t\t\t// logError(\"removing tween:\"+tween);\n\t\t\tif(tween.onComplete!=null){\n\t\t\t\tSystem.Action onComplete = tween.onComplete;\n\t\t\t\t//logError(\"removing tween for j:\"+j+\" tween:\"+tween);\n\t\t\t\tremoveTween(j);\n\t\t\t\t//tween.cleanup();\n\t\t\t\tonComplete();\n\t\t\t\t\n\t\t\t}else if(tween.onCompleteObject!=null){\n\t\t\t\tSystem.Action<object> onCompleteObject = tween.onCompleteObject;\n\t\t\t\tobject onCompleteParam = tween.onCompleteParam;\n\t\t\t\tremoveTween(j);\n\t\t\t\t//tween.cleanup();\n\t\t\t\tonCompleteObject(onCompleteParam);\n\t\t\t}\n\t\t\t#if LEANTWEEN_1\n\t\t\telse if(tween.optional!=null){\n\t\t\t\tSystem.Action callback=null;\n\t\t\t\tSystem.Action<object> callbackWithParam = null;\n\t\t\t\tstring callbackS=string.Empty;\n\t\t\t\tobject callbackParam=null;\n\t\t\t\tHashtable optional = tween.optional;\n\t\t\t\tif(tween.optional!=null && tween.trans){\n\t\t\t\t\tif(tween.optional[\"onComplete\"]!=null){\n\t\t\t\t\t\tcallbackParam = tween.optional[\"onCompleteParam\"];\n\t\t\t\t\t\tif(tween.optional[\"onComplete\"].GetType()==typeof(string)){\n\t\t\t\t\t\t\tcallbackS = tween.optional[\"onComplete\"] as string;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(callbackParam!=null){\n\t\t\t\t\t\t\t\tcallbackWithParam = (System.Action<object>)tween.optional[\"onComplete\"];\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tcallback = (System.Action)tween.optional[\"onComplete\"];\t\n\t\t\t\t\t\t\t\tif(callback==null)\n\t\t\t\t\t\t\t\t\tDebug.LogWarning(\"callback was not converted\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tremoveTween(j);\n\t\t\t\tif(callbackWithParam!=null){\n\t\t\t\t\tcallbackWithParam( callbackParam );\n\t\t\t\t}else if(callback!=null){\n\t\t\t\t\tcallback();\n\t\t\t\t}else if(callbackS!=string.Empty){\n\t\t\t\t\tif (optional[\"onCompleteTarget\"]!=null){\n\t\t\t\t\t\tcustomTarget = optional[\"onCompleteTarget\"] as GameObject;\n\t\t\t\t\t\tif(callbackParam!=null) customTarget.BroadcastMessage ( callbackS, callbackParam );\n\t\t\t\t\t\telse customTarget.BroadcastMessage( callbackS );\n\t\t\t\t\t}else{\n\t\t\t\t\t\tif(callbackParam!=null) trans.gameObject.BroadcastMessage ( callbackS, callbackParam );\n\t\t\t\t\t\telse trans.gameObject.BroadcastMessage( callbackS );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t#endif\n\t\t\telse{\n\t\t\t\tremoveTween(j);\n\t\t\t\t//tween.cleanup();\n\t\t\t}\n\t\t}\n\n\t}\n}\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\nprivate static void textAlphaRecursive( Transform trans, float val ){\n\tUnityEngine.UI.Text uiText = trans.gameObject.GetComponent<UnityEngine.UI.Text>();\n\tif(uiText!=null){\n\t\tColor c = uiText.color;\n        c.a = val;\n        uiText.color = c;\n\t}\n\tif(trans.childCount>0){\n\t\tforeach (Transform child in trans) {\n\t\t\ttextAlphaRecursive(child, val);\n\t\t}\n\t}\n}\n#endif\n\nprivate static Color tweenColor( LTDescrImpl tween, float val ){\n\tVector3 diff3 = tween.point - tween.axis;\n\tfloat diffAlpha = tween.to.y - tween.from.y;\n\treturn new Color(tween.axis.x + diff3.x*val, tween.axis.y + diff3.y*val, tween.axis.z + diff3.z*val, tween.from.y + diffAlpha*val);\n}\n\npublic static void removeTween( int i, int uniqueId){ // Only removes the tween if the unique id matches\n\tif(tweens[i].uniqueId==uniqueId){\n\t\tremoveTween( i );\n\t}\n}\n\n// This method is only used internally! Do not call this from your scripts. To cancel a tween use LeanTween.cancel\npublic static void removeTween( int i ){\n\tif(tweens[i].toggle){\n\t\ttweens[i].toggle = false;\n\t\t//logError(\"Removing tween[\"+i+\"]:\"+tweens[i]);\n\t\tif(tweens[i].destroyOnComplete){\n\t\t\t//Debug.Log(\"destroying tween.type:\"+tween.type);\n\t\t\tif(tweens[i].ltRect!=null){\n\t\t\t//\tDebug.Log(\"destroy i:\"+i+\" id:\"+tweens[i].ltRect.id);\n\t\t\t\tLTGUI.destroy( tweens[i].ltRect.id );\n\t\t\t}else{ // check if equal to tweenEmpty\n\t\t\t\tif(tweens[i].trans!=null && tweens[i].trans.gameObject!=_tweenEmpty){\n\t\t\t\t\tDestroy(tweens[i].trans.gameObject);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ttweens[i].cleanup();\n\t\t//tweens[i].optional = null;\n\t\tstartSearch = i;\n\t\t//Debug.Log(\"start search reset:\"+startSearch + \" i:\"+i+\" tweenMaxSearch:\"+tweenMaxSearch);\n\t\tif(i+1>=tweenMaxSearch){\n\t\t\t//Debug.Log(\"reset to zero\");\n\t\t\tstartSearch = 0;\n\t\t\t//tweenMaxSearch--;\n\t\t}\n\t}\n}\n\npublic static Vector3[] add(Vector3[] a, Vector3 b){\n\tVector3[] c = new Vector3[ a.Length ];\n\tfor(i=0; i<a.Length; i++){\n\t\tc[i] = a[i] + b;\n\t}\n\n\treturn c;\n}\n\npublic static float closestRot( float from, float to ){\n\tfloat minusWhole = 0 - (360 - to);\n\tfloat plusWhole = 360 + to;\n\tfloat toDiffAbs = Mathf.Abs( to-from );\n\tfloat minusDiff = Mathf.Abs(minusWhole-from);\n\tfloat plusDiff = Mathf.Abs(plusWhole-from);\n\tif( toDiffAbs < minusDiff && toDiffAbs < plusDiff ){\n\t\treturn to;\n\t}else {\n\t\tif(minusDiff < plusDiff){\n\t\t\treturn minusWhole;\n\t\t}else{\n\t\t\treturn plusWhole;\n\t\t}\n\t}\n}\n\n/**\n* Cancels all tweens \n* \n* @method LeanTween.cancelAll\n* @param {bool} callComplete:bool (optional) if true, then the all onCompletes will run before canceling\n* @example LeanTween.cancelAll(true); <br>\n*/\npublic static void cancelAll(){\n\tcancelAll(false);\n}\npublic static void cancelAll(bool callComplete){\n    init();\n    for (int i = 0; i <= tweenMaxSearch; i++)\n    {\n        if (tweens[i].trans != null){\n            if (callComplete && tweens[i].onComplete != null)\n                tweens[i].onComplete();\n            removeTween(i);\n        }\n    }\n}\n\n/**\n* Cancel all tweens that are currently targeting the gameObject\n* \n* @method LeanTween.cancel\n* @param {GameObject} gameObject:GameObject gameObject whose tweens you wish to cancel\n* @param {bool} callOnComplete:bool (optional) whether to call the onComplete method before canceling\n* @example LeanTween.move( gameObject, new Vector3(0f,1f,2f), 1f); <br>\n* LeanTween.cancel( gameObject );\n*/\npublic static void cancel( GameObject gameObject ){\n\tcancel( gameObject, false);\n}\npublic static void cancel( GameObject gameObject, bool callOnComplete ){\n\tinit();\n\tTransform trans = gameObject.transform;\n\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].toggle && tweens[i].trans==trans){\n            if (callOnComplete && tweens[i].onComplete != null)\n                tweens[i].onComplete();\n\t\t\tremoveTween(i);\n\t\t}\n\t}\n}\n\npublic static void cancel( GameObject gameObject, int uniqueId ){\n\tif(uniqueId>=0){\n\t\tinit();\n\t\tint backId = uniqueId & 0xFFFF;\n\t\tint backCounter = uniqueId >> 16;\n\t\t// Debug.Log(\"uniqueId:\"+uniqueId+ \" id:\"+backId +\" counter:\"+backCounter + \" setCounter:\"+ tweens[backId].counter + \" tweens[id].type:\"+tweens[backId].type);\n\t\tif(tweens[backId].trans==null || (tweens[backId].trans.gameObject == gameObject && tweens[backId].counter==backCounter))\n\t\t\tremoveTween((int)backId);\n\t}\n}\n\npublic static void cancel( LTRect ltRect, int uniqueId ){\n\tif(uniqueId>=0){\n\t\tinit();\n\t\tint backId = uniqueId & 0xFFFF;\n\t\tint backCounter = uniqueId >> 16;\n\t\t// Debug.Log(\"uniqueId:\"+uniqueId+ \" id:\"+backId +\" action:\"+(TweenAction)backType + \" tweens[id].type:\"+tweens[backId].type);\n\t\tif(tweens[backId].ltRect == ltRect && tweens[backId].counter==backCounter)\n\t\t\tremoveTween((int)backId);\n\t}\n}\n\n/**\n* Cancel a specific tween with the provided id\n* \n* @method LeanTween.cancel\n* @param {int} id:int unique id that represents that tween\n* @param {bool} callOnComplete:int (optional) whether to call the onComplete method before canceling\n* @example int id = LeanTween.move( gameObject, new Vector3(0f,1f,2f), 1f).id; <br>\n* LeanTween.cancel( id );\n*/\npublic static void cancel( int uniqueId ){\n\tcancel( uniqueId, false);\n}\npublic static void cancel( int uniqueId, bool callOnComplete ){\n\tif(uniqueId>=0){\n\t\tinit();\n\t\tint backId = uniqueId & 0xFFFF;\n\t\tint backCounter = uniqueId >> 16;\n\t\t// Debug.Log(\"uniqueId:\"+uniqueId+ \" id:\"+backId +\" action:\"+(TweenAction)backType + \" tweens[id].type:\"+tweens[backId].type);\n\t\tif(tweens[backId].counter==backCounter){\n\t\t\tif(callOnComplete && tweens[backId].onComplete != null)\n                tweens[backId].onComplete();\n\t\t\tremoveTween((int)backId);\n\t\t}\n\t}\n}\n\n/**\n* Retrieve a tweens LTDescr object to modify\n* \n* @method LeanTween.descr\n* @param {int} id:int unique id that represents that tween\n* @example int id = LeanTween.move( gameObject, new Vector3(0f,1f,2f), 1f).setOnComplete( oldMethod ).id; <br><br>\n* <div style=\"color:gray\">// later I want decide I want to change onComplete method </div>\n* LTDescr descr = LeanTween.descr( id );<br>\n* if(descr!=null) <span style=\"color:gray\">// if the tween has already finished it will come back null</span><br>\n* &nbsp;&nbsp;descr.setOnComplete( newMethod );<br>\n*/\npublic static LTDescr descr( int uniqueId ){\n\tint backId = uniqueId & 0xFFFF;\n\tint backCounter = uniqueId >> 16;\n\n\tif(tweens[backId]!=null && tweens[backId].uniqueId == uniqueId && tweens[backId].counter==backCounter)\n\t\treturn tweens[backId];\n\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].uniqueId == uniqueId && tweens[i].counter==backCounter)\n\t\t\treturn tweens[i];\n\t}\n\treturn null;\n}\n\npublic static LTDescr description( int uniqueId ){\n\treturn descr( uniqueId );\n}\n\n/**\n* Retrieve a tweens LTDescr object(s) to modify\n* \n* @method LeanTween.descriptions\n* @param {GameObject} id:GameObject object whose tween descriptions you want to retrieve\n* @example LeanTween.move( gameObject, new Vector3(0f,1f,2f), 1f).setOnComplete( oldMethod ); <br><br>\n* <div style=\"color:gray\">// later I want decide I want to change onComplete method </div>\n* LTDescr[] descr = LeanTween.descriptions( gameObject );<br>\n* if(descr.Length>0) <span style=\"color:gray\">// make sure there is a valid description for this target</span><br>\n* &nbsp;&nbsp;descr[0].setOnComplete( newMethod );<span style=\"color:gray\">// in this case we only ever expect there to be one tween on this object</span><br>\n*/\npublic static LTDescr[] descriptions(GameObject gameObject = null) {\n        if (gameObject == null) return null;\n\n        List<LTDescr> descrs = new List<LTDescr>();\n        Transform trans = gameObject.transform;\n        for (int i = 0; i <= tweenMaxSearch; i++) {\n            if (tweens[i].toggle && tweens[i].trans == trans)\n                descrs.Add( tweens[i] );\n        }\n        return descrs.ToArray();\n    }\n\n[System.Obsolete(\"Use 'pause( id )' instead\")]\npublic static void pause( GameObject gameObject, int uniqueId ){\n\tpause( uniqueId );\n}\n\n/**\n* Pause all tweens for a GameObject\n* \n* @method LeanTween.pause\n* @param {int} id:int Id of the tween you want to pause\n* @example \n* int id = LeanTween.moveX(gameObject, 5, 1.0).id<br>\n* LeanTween.pause( id );<br>\n* // Later....<br>\n* LeanTween.resume( id );\n*/\npublic static void pause( int uniqueId ){\n\tint backId = uniqueId & 0xFFFF;\n\tint backCounter = uniqueId >> 16;\n\tif(tweens[backId].counter==backCounter){\n\t\ttweens[backId].pause();\n\t}\n}\n\n/**\n* Pause all tweens for a GameObject\n* \n* @method LeanTween.pause\n* @param {GameObject} gameObject:GameObject GameObject whose tweens you want to pause\n*/\npublic static void pause( GameObject gameObject ){\n\tTransform trans = gameObject.transform;\n\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].trans==trans){\n\t\t\ttweens[i].pause();\n\t\t}\n\t}\n}\n\n/**\n* Pause all active tweens\n* \n* @method LeanTween.pauseAll\n*/\npublic static void pauseAll(){\n\tinit();\n    for (int i = 0; i <= tweenMaxSearch; i++){\n        tweens[i].pause();\n    }\n}\n\n/**\n* Resume all active tweens\n* \n* @method LeanTween.resumeAll\n*/\npublic static void resumeAll(){\n\tinit();\n    for (int i = 0; i <= tweenMaxSearch; i++){\n        tweens[i].resume();\n    }\n}\n\n[System.Obsolete(\"Use 'resume( id )' instead\")]\npublic static void resume( GameObject gameObject, int uniqueId ){\n\tresume( uniqueId );\n}\n\n/**\n* Resume a specific tween\n* \n* @method LeanTween.resume\n* @param {int} id:int Id of the tween you want to resume\n* @example \n* int id = LeanTween.moveX(gameObject, 5, 1.0).id<br>\n* LeanTween.pause( id );<br>\n* // Later....<br>\n* LeanTween.resume( id );\n*/\npublic static void resume( int uniqueId ){\n\tint backId = uniqueId & 0xFFFF;\n\tint backCounter = uniqueId >> 16;\n\tif(tweens[backId].counter==backCounter){\n\t\ttweens[backId].resume();\n\t}\n}\n\n/**\n* Resume all the tweens on a GameObject\n* \n* @method LeanTween.resume\n* @param {GameObject} gameObject:GameObject GameObject whose tweens you want to resume\n*/\npublic static void resume( GameObject gameObject ){\n\tTransform trans = gameObject.transform;\n\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].trans==trans)\n\t\t\ttweens[i].resume();\n\t}\n}\n\n/**\n* Test whether or not a tween is active on a GameObject\n* \n* @method LeanTween.isTweening\n* @param {GameObject} gameObject:GameObject GameObject that you want to test if it is tweening\n*/\npublic static bool isTweening( GameObject gameObject = null ){\n\tif(gameObject==null){\n\t\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\t\tif(tweens[i].toggle)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\tTransform trans = gameObject.transform;\n\tfor(int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].toggle && tweens[i].trans==trans)\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\n/**\n* Test whether or not a tween is active or not\n* \n* @method LeanTween.isTweening\n* @param {GameObject} id:int id of the tween that you want to test if it is tweening\n* @example\n* int id = LeanTween.moveX(gameObject, 1f, 3f).id;<br>\n* if(LeanTween.isTweening( id ))<br>\n* &nbsp;&nbsp; &nbsp;&nbsp;Debug.Log(\"I am tweening!\");<br>\n*/\t\npublic static bool isTweening( int uniqueId ){\n\tint backId = uniqueId & 0xFFFF;\n\tint backCounter = uniqueId >> 16;\n\tif (backId < 0 || backId >= maxTweens) return false;\n\t// Debug.Log(\"tweens[backId].counter:\"+tweens[backId].counter+\" backCounter:\"+backCounter +\" toggle:\"+tweens[backId].toggle);\n\tif(tweens[backId].counter==backCounter && tweens[backId].toggle){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\npublic static bool isTweening( LTRect ltRect ){\n\tfor( int i = 0; i <= tweenMaxSearch; i++){\n\t\tif(tweens[i].toggle && tweens[i].ltRect==ltRect)\n\t\t\treturn true;\n\t}\n\treturn false;\n}\n\npublic static void drawBezierPath(Vector3 a, Vector3 b, Vector3 c, Vector3 d, float arrowSize = 0.0f, Transform arrowTransform = null){\n    Vector3 last = a;\n    Vector3 p;\n    Vector3 aa = (-a + 3*(b-c) + d);\n\tVector3 bb = 3*(a+c) - 6*b;\n\tVector3 cc = 3*(b-a);\n\t\n\tfloat t;\n\n\tif(arrowSize>0.0f){\n\t\tVector3 beforePos = arrowTransform.position;\n\t\tQuaternion beforeQ = arrowTransform.rotation;\n\t\tfloat distanceTravelled = 0f;\n\n\t\tfor(float k = 1.0f; k <= 120.0f; k++){\n\t    \tt = k / 120.0f;\n\t    \tp = ((aa* t + (bb))* t + cc)* t + a;\n\t\t    Gizmos.DrawLine(last, p);\n\t    \tdistanceTravelled += (p-last).magnitude;\n\t\t    if(distanceTravelled>1f){\n\t\t    \tdistanceTravelled = distanceTravelled - 1f;\n\t\t\t\t/*float deltaY = p.y - last.y;\n\t\t\t\tfloat deltaX = p.x - last.x;\n\t\t\t\tfloat ang = Mathf.Atan(deltaY / deltaX);\n\t\t\t\tVector3 arrow = p + new Vector3( Mathf.Cos(ang+2.5f), Mathf.Sin(ang+2.5f), 0f)*0.5f;\n\t\t\t\tGizmos.DrawLine(p, arrow);\n\t\t\t\tarrow = p + new Vector3( Mathf.Cos(ang+-2.5f), Mathf.Sin(ang+-2.5f), 0f)*0.5f;\n\t\t\t\tGizmos.DrawLine(p, arrow);*/\n\n\t\t\t\tarrowTransform.position = p;\n\t\t\t\tarrowTransform.LookAt( last, Vector3.forward );\n\t\t\t\tVector3 to = arrowTransform.TransformDirection(Vector3.right);\n\t\t\t\t// Debug.Log(\"to:\"+to+\" tweenEmpty.transform.position:\"+arrowTransform.position);\n\t\t\t\tVector3 back = (last-p);\n\t\t\t\tback = back.normalized;\n\t\t\t\tGizmos.DrawLine(p, p + (to + back)*arrowSize);\n\t\t\t\tto = arrowTransform.TransformDirection(-Vector3.right);\n\t\t\t\tGizmos.DrawLine(p, p + (to + back)*arrowSize);\n\t\t    }\n\t\t    last = p;\n\t\t}\n\n\t\tarrowTransform.position = beforePos;\n\t\tarrowTransform.rotation = beforeQ;\n\t}else{\n\t\tfor(float k = 1.0f; k <= 30.0f; k++){\n\t    \tt = k / 30.0f;\n\t    \tp = ((aa* t + (bb))* t + cc)* t + a;\n\t\t    Gizmos.DrawLine(last, p);\n\t\t    last = p;\n\t\t}\n\t}\n}\n\npublic static object logError( string error ){\n\tif(throwErrors) Debug.LogError(error); else Debug.Log(error);\n\treturn null;\n}\n\n// LeanTween 2.0 Methods\n\npublic static LTDescr options(LTDescr seed){ Debug.LogError(\"error this function is no longer used\"); return null; }\npublic static LTDescr options(){\n\tinit();\n\t\n\tbool found = false;\n\tfor(j=0, i = startSearch; j < maxTweens; i++){\n\t\tif(i>=maxTweens-1)\n\t\t\ti = 0;\n\t\tif(tweens[i].toggle==false){\n\t\t\tif(i+1>tweenMaxSearch)\n\t\t\t\ttweenMaxSearch = i+1;\n\t\t\tstartSearch = i + 1;\n\t\t\tfound = true;\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tj++;\n\t\tif(j >= maxTweens)\n\t\t\treturn logError(\"LeanTween - You have run out of available spaces for tweening. To avoid this error increase the number of spaces to available for tweening when you initialize the LeanTween class ex: LeanTween.init( \"+(maxTweens*2)+\" );\") as LTDescr;\n\t}\n\tif(found==false)\n\t\tlogError(\"no available tween found!\");\n\t\n\t// Debug.Log(\"new tween with i:\"+i+\" counter:\"+tweens[i].counter+\" tweenMaxSearch:\"+tweenMaxSearch+\" tween:\"+tweens[i]);\n\ttweens[i].reset();\n\ttweens[i].setId( (uint)i );\n\n\treturn tweens[i];\n}\n\npublic static GameObject tweenEmpty{\n\tget{\n\t\tinit(maxTweens);\n\t\treturn _tweenEmpty;\n\t}\n}\n\npublic static int startSearch = 0;\npublic static LTDescr d;\n\nprivate static LTDescr pushNewTween( GameObject gameObject, Vector3 to, float time, TweenAction tweenAction, LTDescr tween ){\n\tinit(maxTweens);\n\tif(gameObject==null || tween==null)\n\t\treturn null;\n\n\ttween.trans = gameObject.transform;\n\ttween.to = to;\n\ttween.time = time;\n\ttween.type = tweenAction;\n\t//tween.hasPhysics = gameObject.rigidbody!=null;\n\t\n\treturn tween;\n}\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n/**\n* Play a sequence of images on a Unity UI Object\n* \n* @method LeanTween.play\n* @param {RectTransform} rectTransform:RectTransform RectTransform that you want to play the sequence of sprites on\n* @param {Sprite[]} sprites:Sprite[] Sequence of sprites to be played\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.play(gameObject.GetComponent<RectTransform>(), sprites).setLoopPingPong();\n*/\t\npublic static LTDescr play(RectTransform rectTransform, UnityEngine.Sprite[] sprites){\n\tfloat defaultFrameRate = 0.25f;\n\tfloat time = defaultFrameRate * sprites.Length;\n\treturn pushNewTween(rectTransform.gameObject, new Vector3((float)sprites.Length - 1.0f,0,0), time, TweenAction.CANVAS_PLAYSPRITE, options().setSprites( sprites ).setRepeat(-1));\n}\n#endif\n\n/**\n* Fade a gameobject's material to a certain alpha value. The material's shader needs to support alpha. <a href=\"http://owlchemylabs.com/content/\">Owl labs has some excellent efficient shaders</a>.\n* \n* @method LeanTween.alpha\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to fade\n* @param {float} to:float the final alpha value (0-1)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.alpha(gameObject, 1f, 1f) .setDelay(1f);\n*/\npublic static LTDescr alpha(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ALPHA, options() );\n}\n\n/**\n* Fade a GUI Object\n* \n* @method LeanTween.alpha\n* @param {LTRect} ltRect:LTRect LTRect that you wish to fade\n* @param {float} to:float the final alpha value (0-1)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.alpha(ltRect, 1f, 1f) .setEase(LeanTweenType.easeInCirc);\n*/\t\npublic static LTDescr alpha(LTRect ltRect, float to, float time){\n\tltRect.alphaEnabled = true;\n\treturn pushNewTween( tweenEmpty, new Vector3(to,0f,0f), time, TweenAction.GUI_ALPHA, options().setRect( ltRect ) );\n}\n\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n/**\n* Fade a Unity UI Object\n* \n* @method LeanTween.alphaText\n* @param {RectTransform} rectTransform:RectTransform RectTransform associated with the Text Component you wish to fade\n* @param {float} to:float the final alpha value (0-1)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.alphaText(gameObject.GetComponent&lt;RectTransform&gt;(), 1f, 1f) .setEase(LeanTweenType.easeInCirc);\n*/\t\npublic static LTDescr textAlpha(RectTransform rectTransform, float to, float time){\n    return pushNewTween(rectTransform.gameObject, new Vector3(to,0,0), time, TweenAction.TEXT_ALPHA, options());\n}\npublic static LTDescr alphaText(RectTransform rectTransform, float to, float time){\n    return pushNewTween(rectTransform.gameObject, new Vector3(to,0,0), time, TweenAction.TEXT_ALPHA, options());\n}\n\n/**\n* Fade a Unity UI Canvas Group\n* \n* @method LeanTween.alphaCanvas\n* @param {RectTransform} rectTransform:RectTransform RectTransform that the CanvasGroup is attached to\n* @param {float} to:float the final alpha value (0-1)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.alphaCanvas(gameObject.GetComponent&lt;RectTransform&gt;(), 0f, 1f) .setLoopPingPong();\n*/\t\npublic static LTDescr alphaCanvas(CanvasGroup canvasGroup, float to, float time){\n    return pushNewTween(canvasGroup.gameObject, new Vector3(to,0,0), time, TweenAction.CANVASGROUP_ALPHA, options());\n}\n#endif\n\n/**\n* This works by tweening the vertex colors directly.<br>\n<br>\nVertex-based coloring is useful because you avoid making a copy of your\nobject's material for each instance that needs a different color.<br>\n<br>\nA shader that supports vertex colors is required for it to work\n(for example the shaders in Mobile/Particles/)\n* \n* @method LeanTween.alphaVertex\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to alpha\n* @param {float} to:float The alpha value you wish to tween to\n* @param {float} time:float The time with which to delay before calling the function\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr alphaVertex(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0f,0f), time, TweenAction.ALPHA_VERTEX, options() );\n}\n\n/**\n* Change a gameobject's material to a certain color value. The material's shader needs to support color tinting. <a href=\"http://owlchemylabs.com/content/\">Owl labs has some excellent efficient shaders</a>.\n* \n* @method LeanTween.color\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to change the color\n* @param {Color} to:Color the final color value ex: Color.Red, new Color(1.0f,1.0f,0.0f,0.8f)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.color(gameObject, Color.yellow, 1f) .setDelay(1f);\n*/\npublic static LTDescr color(GameObject gameObject, Color to, float time){\n\treturn pushNewTween( gameObject, new Vector3(1.0f, to.a, 0.0f), time, TweenAction.COLOR, options().setPoint( new Vector3(to.r, to.g, to.b) ) );\n}\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n/**\n* Change the color a Unity UI Object\n* \n* @method LeanTween.colorText\n* @param {RectTransform} rectTransform:RectTransform RectTransform attached to the Text Component whose color you want to change\n* @param {Color} to:Color the final alpha value ex: Color.Red, new Color(1.0f,1.0f,0.0f,0.8f)\n* @param {float} time:float The time with which to fade the object\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* LeanTween.colorText(gameObject.GetComponent&lt;RectTransform&gt;(), Color.yellow, 1f) .setDelay(1f);\n*/\npublic static LTDescr textColor(RectTransform rectTransform, Color to, float time){\n    return pushNewTween(rectTransform.gameObject, new Vector3(1.0f, to.a, 0.0f), time, TweenAction.TEXT_COLOR, options().setPoint(new Vector3(to.r, to.g, to.b)));\n}\npublic static LTDescr colorText(RectTransform rectTransform, Color to, float time){\n    return pushNewTween(rectTransform.gameObject, new Vector3(1.0f, to.a, 0.0f), time, TweenAction.TEXT_COLOR, options().setPoint(new Vector3(to.r, to.g, to.b)));\n}\n#endif\n\npublic static LTDescr delayedCall( float delayTime, Action callback){\n\treturn pushNewTween( tweenEmpty, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setOnComplete(callback) );\n}\n\npublic static LTDescr delayedCall( float delayTime, Action<object> callback){\n\treturn pushNewTween( tweenEmpty, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setOnComplete(callback) );\n}\n\npublic static LTDescr delayedCall( GameObject gameObject, float delayTime, Action callback){\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setOnComplete(callback) );\n}\n\npublic static LTDescr delayedCall( GameObject gameObject, float delayTime, Action<object> callback){\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setOnComplete(callback) );\n}\n\npublic static LTDescr destroyAfter( LTRect rect, float delayTime){\n\treturn pushNewTween( tweenEmpty, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setRect( rect ).setDestroyOnComplete(true) );\n}\n\n/*public static LTDescr delayedCall(GameObject gameObject, float delayTime, string callback){\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, options().setOnComplete( callback ) );\n}*/\n\n/**\n* Move a GameObject to a certain location\n* \n* @method LeanTween.move\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Vector3} vec:Vector3 to The final positin with which to move to\n* @param {float} time:float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.move(gameObject, new Vector3(0f,-3f,5f), 2.0f) .setEase( LeanTweenType.easeOutQuad );\n*/\npublic static LTDescr move(GameObject gameObject, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.MOVE, options() );\n}\npublic static LTDescr move(GameObject gameObject, Vector2 to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to.x, to.y, gameObject.transform.position.z), time, TweenAction.MOVE, options() );\n}\n\n\n/**\n* Move a GameObject along a set of bezier curves\n* \n* @method LeanTween.move\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Vector3[]} path:Vector3[] A set of points that define the curve(s) ex: Point1,Handle2,Handle1,Point2,...\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Javascript:</i><br>\n* LeanTween.move(gameObject, [Vector3(0,0,0),Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,1)], 2.0) .setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br><br>\n* <i>C#:</i><br>\n* LeanTween.move(gameObject, new Vector3[]{new Vector3(0f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,1f)}, 1.5f).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);;<br>\n*/\t\npublic static LTDescr move(GameObject gameObject, Vector3[] to, float time){\n\td = options();\n\tif(d.path==null)\n\t\td.path = new LTBezierPath( to );\n\telse \n\t\td.path.setPoints( to );\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_CURVED, d );\n}\n\npublic static LTDescr move(GameObject gameObject, LTBezierPath to, float time) {\n    d = options();\n    d.path = to;\n\n    return pushNewTween(gameObject, new Vector3(1.0f, 0.0f, 0.0f), time, TweenAction.MOVE_CURVED, d);\n}\n\npublic static LTDescr move(GameObject gameObject, LTSpline to, float time) {\n\td = options();\n\td.spline = to;\n\n\treturn pushNewTween(gameObject, new Vector3(1.0f, 0.0f, 0.0f), time, TweenAction.MOVE_SPLINE, d);\n}\n\n/**\n* Move a GameObject through a set of points\n* \n* @method LeanTween.moveSpline\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Vector3[]} path:Vector3[] A set of points that define the curve(s) ex: ControlStart,Pt1,Pt2,Pt3,.. ..ControlEnd<br>Note: The first and last item just define the angle of the end points, they are not actually used in the spline path itself. If you do not care about the angle you can jus set the first two items and last two items as the same value.\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Javascript:</i><br>\n* LeanTween.moveSpline(gameObject, [Vector3(0,0,0),Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,1)], 2.0) .setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br><br>\n* <i>C#:</i><br>\n* LeanTween.moveSpline(gameObject, new Vector3[]{new Vector3(0f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,1f)}, 1.5f).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br>\n*/\npublic static LTDescr moveSpline(GameObject gameObject, Vector3[] to, float time){\n\td = options();\n\td.spline = new LTSpline( to );\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_SPLINE, d );\n}\n\n/**\n* Move a GameObject through a set of points, in local space\n* \n* @method LeanTween.moveSplineLocal\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Vector3[]} path:Vector3[] A set of points that define the curve(s) ex: ControlStart,Pt1,Pt2,Pt3,.. ..ControlEnd\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Javascript:</i><br>\n* LeanTween.moveSpline(gameObject, [Vector3(0,0,0),Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,1)], 2.0) .setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br><br>\n* <i>C#:</i><br>\n* LeanTween.moveSpline(gameObject, new Vector3[]{new Vector3(0f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,0f),new Vector3(1f,0f,1f)}, 1.5f).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br>\n*/\npublic static LTDescr moveSplineLocal(GameObject gameObject, Vector3[] to, float time){\n\td = options();\n\td.spline = new LTSpline( to );\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_SPLINE_LOCAL, d );\n}\n\n/**\n* Move a GUI Element to a certain location\n* \n* @method LeanTween.move (GUI)\n* @param {LTRect} ltRect:LTRect ltRect LTRect object that you wish to move\n* @param {Vector2} vec:Vector2 to The final position with which to move to (pixel coordinates)\n* @param {float} time:float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr move(LTRect ltRect, Vector2 to, float time){\n\treturn pushNewTween( tweenEmpty, to, time, TweenAction.GUI_MOVE, options().setRect( ltRect ) );\n}\n\npublic static LTDescr moveMargin(LTRect ltRect, Vector2 to, float time){\n\treturn pushNewTween( tweenEmpty, to, time, TweenAction.GUI_MOVE_MARGIN, options().setRect( ltRect ) );\n}\n\n/**\n* Move a GameObject along the x-axis\n* \n* @method LeanTween.moveX\n* @param {GameObject} gameObject:GameObject gameObject Gameobject that you wish to move\n* @param {float} to:float to The final position with which to move to\n* @param {float} time:float time The time to complete the move in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr moveX(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_X, options() );\n}\n\n/**\n* Move a GameObject along the y-axis\n* \n* @method LeanTween.moveY\n* @param {GameObject} GameObject gameObject Gameobject that you wish to move\n* @param {float} float to The final position with which to move to\n* @param {float} float time The time to complete the move in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr moveY(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_Y, options() );\n}\n\n/**\n* Move a GameObject along the z-axis\n* \n* @method LeanTween.moveZ\n* @param {GameObject} GameObject gameObject Gameobject that you wish to move\n* @param {float} float to The final position with which to move to\n* @param {float} float time The time to complete the move in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr moveZ(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_Z, options() );\n}\n\n/**\n* Move a GameObject to a certain location relative to the parent transform. \n* \n* @method LeanTween.moveLocal\n* @param {GameObject} GameObject gameObject Gameobject that you wish to rotate\n* @param {Vector3} Vector3 to The final positin with which to move to\n* @param {float} float time The time to complete the tween in\n* @param {Hashtable} Hashtable optional Hashtable where you can pass <a href=\"#optional\">optional items</a>.\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr moveLocal(GameObject gameObject, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.MOVE_LOCAL, options() );\n}\n\n/**\n* Move a GameObject along a set of bezier curves, in local space\n* \n* @method LeanTween.moveLocal\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Vector3[]} path:Vector3[] A set of points that define the curve(s) ex: Point1,Handle1,Handle2,Point2,...\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Javascript:</i><br>\n* LeanTween.move(gameObject, [Vector3(0,0,0),Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,1)], 2.0).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br><br>\n* <i>C#:</i><br>\n* LeanTween.move(gameObject, new Vector3[]{Vector3(0f,0f,0f),Vector3(1f,0f,0f),Vector3(1f,0f,0f),Vector3(1f,0f,1f)}).setEase(LeanTweenType.easeOutQuad).setOrientToPath(true);<br>\n*/\npublic static LTDescr moveLocal(GameObject gameObject, Vector3[] to, float time){\n\td = options();\n\tif(d.path==null)\n\t\td.path = new LTBezierPath( to );\n\telse \n\t\td.path.setPoints( to );\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_CURVED_LOCAL, d );\n}\n\npublic static LTDescr moveLocalX(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_X, options() );\n}\n\npublic static LTDescr moveLocalY(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_Y, options() );\n}\n\npublic static LTDescr moveLocalZ(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_Z, options() );\n}\n\npublic static LTDescr moveLocal(GameObject gameObject, LTBezierPath to, float time) {\n\td = options();\n\td.path = to;\n\n\treturn pushNewTween(gameObject, new Vector3(1.0f, 0.0f, 0.0f), time, TweenAction.MOVE_CURVED_LOCAL, d);\n}\npublic static LTDescr moveLocal(GameObject gameObject, LTSpline to, float time) {\n\td = options();\n\td.spline = to;\n \t\t \n\treturn pushNewTween(gameObject, new Vector3(1.0f, 0.0f, 0.0f), time, TweenAction.MOVE_SPLINE_LOCAL, d);\n}\n\n/**\n* Move a GameObject to another transform\n* \n* @method LeanTween.move\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to move\n* @param {Transform} destination:Transform Transform whose position the tween will finally end on\n* @param {float} time:float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.move(gameObject, anotherTransform, 2.0f) .setEase( LeanTweenType.easeOutQuad );\n*/\npublic static LTDescr move(GameObject gameObject, Transform to, float time)\n{\n    return pushNewTween(gameObject, Vector3.zero, time, TweenAction.MOVE_TO_TRANSFORM, options().setTo(to) );\n}\n\n/**\n* Rotate a GameObject, to values are in passed in degrees\n* \n* @method LeanTween.rotate\n* @param {GameObject} GameObject gameObject Gameobject that you wish to rotate\n* @param {Vector3} Vector3 to The final rotation with which to rotate to\n* @param {float} float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.rotate(cube, new Vector3(180f,30f,0f), 1.5f);\n*/\n\npublic static LTDescr rotate(GameObject gameObject, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.ROTATE, options() );\n}\n\n/**\n* Rotate a GUI element (using an LTRect object), to a value that is in degrees\n* \n* @method LeanTween.rotate\n* @param {LTRect} ltRect:LTRect LTRect that you wish to rotate\n* @param {float} to:float The final rotation with which to rotate to\n* @param {float} time:float The time to complete the tween in\n* @param {Array} optional:Array Object Array where you can pass <a href=\"#optional\">optional items</a>.\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example \n* if(GUI.Button(buttonRect.rect, \"Rotate\"))<br>\n*\tLeanTween.rotate( buttonRect4, 150.0f, 1.0f).setEase(LeanTweenType.easeOutElastic);<br>\n* GUI.matrix = Matrix4x4.identity;<br>\n*/\npublic static LTDescr rotate(LTRect ltRect, float to, float time){\n\treturn pushNewTween( tweenEmpty, new Vector3(to,0f,0f), time, TweenAction.GUI_ROTATE, options().setRect( ltRect ) );\n}\n\n/**\n* Rotate a GameObject in the objects local space (on the transforms localEulerAngles object)\n* \n* @method LeanTween.rotateLocal\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to rotate\n* @param {Vector3} to:Vector3 The final rotation with which to rotate to\n* @param {float} time:float The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr rotateLocal(GameObject gameObject, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.ROTATE_LOCAL, options() );\n}\n\n/**\n* Rotate a GameObject only on the X axis\n* \n* @method LeanTween.rotateX\n* @param {GameObject} GameObject Gameobject that you wish to rotate\n* @param {float} to:float The final x-axis rotation with which to rotate\n* @param {float} time:float The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr rotateX(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_X, options() );\n}\n\n/**\n* Rotate a GameObject only on the Y axis\n* \n* @method LeanTween.rotateY\n* @param {GameObject} GameObject Gameobject that you wish to rotate\n* @param {float} to:float The final y-axis rotation with which to rotate\n* @param {float} time:float The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr rotateY(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_Y, options() );\n}\n\n/**\n* Rotate a GameObject only on the Z axis\n* \n* @method LeanTween.rotateZ\n* @param {GameObject} GameObject Gameobject that you wish to rotate\n* @param {float} to:float The final z-axis rotation with which to rotate\n* @param {float} time:float The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr rotateZ(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_Z, options() );\n}\n\n/**\n* Rotate a GameObject around a certain Axis (the best method to use when you want to rotate beyond 180 degrees)\n* \n* @method LeanTween.rotateAround\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to rotate\n* @param {Vector3} vec:Vector3 axis in which to rotate around ex: Vector3.up\n* @param {float} degrees:float the degrees in which to rotate\n* @param {float} time:float time The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example:</i><br>\n* LeanTween.rotateAround ( gameObject, Vector3.left, 90f,  1f );\n*/\npublic static LTDescr rotateAround(GameObject gameObject, Vector3 axis, float add, float time){\n\treturn pushNewTween( gameObject, new Vector3(add,0f,0f), time, TweenAction.ROTATE_AROUND, options().setAxis(axis) );\n}\n\n/**\n* Rotate a GameObject around a certain Axis in Local Space (the best method to use when you want to rotate beyond 180 degrees)\n* \n* @method LeanTween.rotateAroundLocal\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to rotate\n* @param {Vector3} vec:Vector3 axis in which to rotate around ex: Vector3.up\n* @param {float} degrees:float the degrees in which to rotate\n* @param {float} time:float time The time to complete the rotation in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example:</i><br>\n* LeanTween.rotateAround ( gameObject, Vector3.left, 90f,  1f );\n*/\npublic static LTDescr rotateAroundLocal(GameObject gameObject, Vector3 axis, float add, float time){\n\treturn pushNewTween( gameObject, new Vector3(add,0f,0f), time, TweenAction.ROTATE_AROUND_LOCAL, options().setAxis(axis) );\n}\n\n/**\n* Scale a GameObject to a certain size\n* \n* @method LeanTween.scale\n* @param {GameObject} gameObject:GameObject gameObject Gameobject that you wish to scale\n* @param {Vector3} vec:Vector3 to The size with which to tween to\n* @param {float} time:float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr scale(GameObject gameObject, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.SCALE, options() );\n}\n\t\n/**\n* Scale a GUI Element to a certain width and height\n* \n* @method LeanTween.scale (GUI)\n* @param {LTRect} LTRect ltRect LTRect object that you wish to move\n* @param {Vector2} Vector2 to The final width and height to scale to (pixel based)\n* @param {float} float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* var bRect:LTRect = new LTRect( 0, 0, 100, 50 );<br>\n* LeanTween.scale( bRect, Vector2(bRect.rect.width, bRect.rect.height) * 1.3, 0.25 ).setEase(LeanTweenType.easeOutBounce);<br>\n* function OnGUI(){<br>\n* &nbsp; if(GUI.Button(bRect.rect, \"Scale\")){ }<br>\n* }<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LTRect bRect = new LTRect( 0f, 0f, 100f, 50f );<br>\n* LeanTween.scale( bRect, new Vector2(150f,75f), 0.25f ).setEase(LeanTweenType.easeOutBounce);<br>\n* void OnGUI(){<br>\n* &nbsp; if(GUI.Button(bRect.rect, \"Scale\")){ }<br>\n* }<br>\n*/\npublic static LTDescr scale(LTRect ltRect, Vector2 to, float time){\n\treturn pushNewTween( tweenEmpty, to, time, TweenAction.GUI_SCALE, options().setRect( ltRect ) );\n}\n\n/**\n* Scale a GameObject to a certain size along the x-axis only\n* \n* @method LeanTween.scaleX\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to scale\n* @param {float} scaleTo:float the size with which to scale to\n* @param {float} time:float the time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr scaleX(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_X, options() );\n}\n\n/**\n* Scale a GameObject to a certain size along the y-axis only\n* \n* @method LeanTween.scaleY\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to scale\n* @param {float} scaleTo:float the size with which to scale to\n* @param {float} time:float the time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr scaleY(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_Y, options() );\n}\n\n/**\n* Scale a GameObject to a certain size along the z-axis only\n* \n* @method LeanTween.scaleZ\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to scale\n* @param {float} scaleTo:float the size with which to scale to\n* @param {float} time:float the time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr scaleZ(GameObject gameObject, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_Z, options());\n}\n\n/**\n* Tween any particular value (float)\n* \n* @method LeanTween.value (float)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {float} from:float The original value to start the tween from\n* @param {Vector3} to:float The final float with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, 1f, 5f, 5f).setOnUpdate( function( val:float ){ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, 1f, 5f, 5f).setOnUpdate( (float val)=>{ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n*/\npublic static LTDescr value(GameObject gameObject, float from, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, options().setFrom( new Vector3(from,0,0) ) );\n}\n\n/**\n* Tween any particular value (Vector2)\n* \n* @method LeanTween.value (Vector2)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Vector2} from:Vector2 The original value to start the tween from\n* @param {Vector3} to:Vector2 The final Vector2 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, new Vector2(1f,0f), new Vector3(5f,0f), 5f).setOnUpdate( function( val:Vector2 ){ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, new Vector3(1f,0f), new Vector3(5f,0f), 5f).setOnUpdate( (Vector2 val)=>{ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n*/\npublic static LTDescr value(GameObject gameObject, Vector2 from, Vector2 to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to.x,to.y,0), time, TweenAction.VALUE3, options().setTo( new Vector3(to.x,to.y,0f) ).setFrom( new Vector3(from.x,from.y,0) ) );\n}\n\n/**\n* Tween any particular value (Vector3)\n* \n* @method LeanTween.value (Vector3)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Vector3} from:Vector3 The original value to start the tween from\n* @param {Vector3} to:Vector3 The final Vector3 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, new Vector3(1f,0f,0f), new Vector3(5f,0f,0f), 5f).setOnUpdate( function( val:Vector3 ){ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, new Vector3(1f,0f,0f), new Vector3(5f,0f,0f), 5f).setOnUpdate( (Vector3 val)=>{ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n*/\npublic static LTDescr value(GameObject gameObject, Vector3 from, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.VALUE3, options().setFrom( from ) );\n}\n\n/**\n* Tween any particular value (Color)\n* \n* @method LeanTween.value (Color)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Color} from:Color The original value to start the tween from\n* @param {Color} to:Color The final Color with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, Color.red, Color.yellow, 5f).setOnUpdate( function( val:Color ){ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, Color.red, Color.yellow, 5f).setOnUpdate( (Color val)=>{ <br>\n* &nbsp;Debug.Log(\"tweened val:\"+val);<br>\n* } );<br>\n*/\npublic static LTDescr value(GameObject gameObject, Color from, Color to, float time){\n\treturn pushNewTween( gameObject, new Vector3(1f, to.a, 0f), time, TweenAction.CALLBACK_COLOR, options().setPoint( new Vector3(to.r, to.g, to.b) )\n\t\t.setFromColor(from).setHasInitialized(false)\n\t);\n}\n\n/**\n* Tween any particular value, it does not need to be tied to any particular type or GameObject\n* \n* @method LeanTween.value (float)\n* @param {GameObject} GameObject gameObject GameObject with which to tie the tweening with. This is only used when you need to cancel this tween, it does not actually perform any operations on this gameObject\n* @param {Action<float>} callOnUpdate:Action<float> The function that is called on every Update frame, this function needs to accept a float value ex: function updateValue( float val ){ }\n* @param {float} float from The original value to start the tween from\n* @param {float} float to The value to end the tween on\n* @param {float} float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, updateValueExampleCallback, 180f, 270f, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* function updateValueExampleCallback( val:float ){<br>\n* &nbsp; Debug.Log(\"tweened value:\"+val+\" set this to whatever variable you are tweening...\");<br>\n* }<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, updateValueExampleCallback, 180f, 270f, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* void updateValueExampleCallback( float val ){<br>\n* &nbsp; Debug.Log(\"tweened value:\"+val+\" set this to whatever variable you are tweening...\");<br>\n* }<br>\n*/\n\npublic static LTDescr value(GameObject gameObject, Action<float> callOnUpdate, float from, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, options().setTo( new Vector3(to,0,0) ).setFrom( new Vector3(from,0,0) ).setOnUpdate(callOnUpdate) );\n}\n\n/**\n* Tweens any float value, it does not need to be tied to any particular type or GameObject\n* \n* @method LeanTween.value (float)\n* @param {GameObject} GameObject gameObject GameObject with which to tie the tweening with. This is only used when you need to cancel this tween, it does not actually perform any operations on this gameObject\n* @param {Action<float, float>} callOnUpdateRatio:Action<float,float> Function that's called every Update frame. It must accept two float values ex: function updateValue( float val, float ratio){ }\n* @param {float} float from The original value to start the tween from\n* @param {float} float to The value to end the tween on\n* @param {float} float time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, updateValueExampleCallback, 180f, 270f, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* function updateValueExampleCallback( val:float, ratio:float ){<br>\n* &nbsp; Debug.Log(\"tweened value:\"+val+\" percent complete:\"+ratio*100);<br>\n* }<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, updateValueExampleCallback, 180f, 270f, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* void updateValueExampleCallback( float val, float ratio ){<br>\n* &nbsp; Debug.Log(\"tweened value:\"+val+\" percent complete:\"+ratio*100);<br>\n* }<br>\n*/\n\npublic static LTDescr value(GameObject gameObject, Action<float, float> callOnUpdateRatio, float from, float to, float time) {\n    return pushNewTween(gameObject, new Vector3(to, 0, 0), time, TweenAction.CALLBACK, options().setTo(new Vector3(to, 0, 0)).setFrom(new Vector3(from, 0, 0)).setOnUpdateRatio(callOnUpdateRatio));\n}\n\n/**\n* Tween from one color to another\n* \n* @method LeanTween.value (Color)\n* @param {GameObject} GameObject gameObject GameObject with which to tie the tweening with. This is only used when you need to cancel this tween, it does not actually perform any operations on this gameObject\n* @param {Action<Color>} callOnUpdate:Action<Color> The function that is called on every Update frame, this function needs to accept a color value ex: function updateValue( Color val ){ }\n* @param {Color} Color from The original value to start the tween from\n* @param {Color} Color to The value to end the tween on\n* @param {Color} Color time The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example\n* <i>Example Javascript: </i><br>\n* LeanTween.value( gameObject, updateValueExampleCallback, Color.red, Color.green, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* function updateValueExampleCallback( val:Color ){<br>\n* &nbsp; Debug.Log(\"tweened color:\"+val+\" set this to whatever variable you are tweening...\");<br>\n* }<br>\n* <br>\n* <i>Example C#: </i> <br>\n* LeanTween.value( gameObject, updateValueExampleCallback, Color.red, Color.green, 1f).setEase(LeanTweenType.easeOutElastic);<br>\n* void updateValueExampleCallback( Color val ){<br>\n* &nbsp; Debug.Log(\"tweened color:\"+val+\" set this to whatever variable you are tweening...\");<br>\n* }<br>\n*/\n\npublic static LTDescr value(GameObject gameObject, Action<Color> callOnUpdate, Color from, Color to, float time){\n\treturn pushNewTween( gameObject, new Vector3(1.0f,to.a,0.0f), time, TweenAction.CALLBACK_COLOR, options().setPoint( new Vector3(to.r, to.g, to.b) )\n\t\t.setAxis( new Vector3(from.r, from.g, from.b) ).setFrom( new Vector3(0.0f, from.a, 0.0f) ).setHasInitialized(false).setOnUpdateColor(callOnUpdate) );\n}\n\n/**\n* Tween any particular value (Vector2), this could be used to tween an arbitrary value like offset property\n* \n* @method LeanTween.value (Vector2)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Action<Vector2>} callOnUpdate:Action<Vector2> The function that is called on every Update frame, this function needs to accept a float value ex: function updateValue( Vector3 val ){ }\n* @param {float} from:Vector2 The original value to start the tween from\n* @param {Vector2} to:Vector2 The final Vector3 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr value(GameObject gameObject, Action<Vector2> callOnUpdate, Vector2 from, Vector2 to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to.x,to.y,0f), time, TweenAction.VALUE3, options().setTo( new Vector3(to.x,to.y,0f) ).setFrom( new Vector3(from.x,from.y,0f) ).setOnUpdateVector2(callOnUpdate) );\n}\n\n/**\n* Tween any particular value (Vector3), this could be used to tween an arbitrary property that uses a Vector\n* \n* @method LeanTween.value (Vector3)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Action<Vector3>} callOnUpdate:Action<Vector3> The function that is called on every Update frame, this function needs to accept a float value ex: function updateValue( Vector3 val ){ }\n* @param {float} from:Vector3 The original value to start the tween from\n* @param {Vector3} to:Vector3 The final Vector3 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr value(GameObject gameObject, Action<Vector3> callOnUpdate, Vector3 from, Vector3 to, float time){\n\treturn pushNewTween( gameObject, to, time, TweenAction.VALUE3, options().setTo( to ).setFrom( from ).setOnUpdateVector3(callOnUpdate) );\n}\n\n/**\n* Tween any particular value (float)\n* \n* @method LeanTween.value (float,object)\n* @param {GameObject} gameObject:GameObject Gameobject that you wish to attach the tween to\n* @param {Action<float,object>} callOnUpdate:Action<float,object> The function that is called on every Update frame, this function needs to accept a float value ex: function updateValue( Vector3 val, object obj ){ }\n* @param {float} from:float The original value to start the tween from\n* @param {Vector3} to:float The final Vector3 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n*/\npublic static LTDescr value(GameObject gameObject, Action<float,object> callOnUpdate, float from, float to, float time){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, options().setTo( new Vector3(to,0,0) ).setFrom( new Vector3(from,0,0) ).setOnUpdate(callOnUpdate, gameObject) );\n}\n\npublic static LTDescr delayedSound( AudioClip audio, Vector3 pos, float volume ){\n\t//Debug.LogError(\"Delay sound??\");\n\treturn pushNewTween( tweenEmpty, pos, 0f, TweenAction.DELAYED_SOUND, options().setTo( pos ).setFrom( new Vector3(volume,0,0) ).setAudio( audio ) );\n}\n\npublic static LTDescr delayedSound( GameObject gameObject, AudioClip audio, Vector3 pos, float volume ){\n\t//Debug.LogError(\"Delay sound??\");\n\treturn pushNewTween( gameObject, pos, 0f, TweenAction.DELAYED_SOUND, options().setTo( pos ).setFrom( new Vector3(volume,0,0) ).setAudio( audio ) );\n}\n\n#if !UNITY_3_5 && !UNITY_4_0 && !UNITY_4_0_1 && !UNITY_4_1 && !UNITY_4_2 && !UNITY_4_3 && !UNITY_4_5\n\n/**\n* Move a RectTransform object (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.move (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {Vector3} to:Vector3 The final Vector3 with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.move(gameObject.GetComponent&lt;RectTransform&gt;(), new Vector3(200f,-100f,0f), 1f).setDelay(1f);\n*/\npublic static LTDescr move(RectTransform rectTrans, Vector3 to, float time){\n\treturn pushNewTween( rectTrans.gameObject, to, time, TweenAction.CANVAS_MOVE, options().setRect( rectTrans ) );\n}\n\n/**\n* Move a RectTransform object affecting x-axis only (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.moveX (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final x location with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.moveX(gameObject.GetComponent&lt;RectTransform&gt;(), 200f, 1f).setDelay(1f);\n*/\npublic static LTDescr moveX(RectTransform rectTrans, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_MOVE_X, options().setRect( rectTrans ) );\n}\n\n/**\n* Move a RectTransform object affecting y-axis only (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.moveY (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final y location with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.moveY(gameObject.GetComponent&lt;RectTransform&gt;(), 200f, 1f).setDelay(1f);\n*/\npublic static LTDescr moveY(RectTransform rectTrans, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_MOVE_Y, options().setRect( rectTrans ) );\n}\n\n/**\n* Move a RectTransform object affecting z-axis only (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.moveZ (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final x location with which to tween to\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.moveZ(gameObject.GetComponent&lt;RectTransform&gt;(), 200f, 1f).setDelay(1f);\n*/\npublic static LTDescr moveZ(RectTransform rectTrans, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_MOVE_Z, options().setRect( rectTrans ) );\n}\n\n/**\n* Rotate a RectTransform object (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.rotate (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The degree with which to rotate the RectTransform\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.rotate(gameObject.GetComponent&lt;RectTransform&gt;(), 90f, 1f).setDelay(1f);\n*/\npublic static LTDescr rotate(RectTransform rectTrans, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_ROTATEAROUND, options().setRect( rectTrans ).setAxis(Vector3.forward) );\n}\n\n/**\n* Rotate a RectTransform object (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.rotateAround (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {Vector3} axis:Vector3 The axis in which to rotate the RectTransform (Vector3.forward is most commonly used)\n* @param {float} to:float The degree with which to rotate the RectTransform\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.rotateAround(gameObject.GetComponent&lt;RectTransform&gt;(), Vector3.forward, 90f, 1f).setDelay(1f);\n*/\npublic static LTDescr rotateAround(RectTransform rectTrans, Vector3 axis, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_ROTATEAROUND, options().setRect( rectTrans ).setAxis(axis) );\n}\n\n/**\n* Rotate a RectTransform object around it's local axis (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.rotateAroundLocal (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {Vector3} axis:Vector3 The local axis in which to rotate the RectTransform (Vector3.forward is most commonly used)\n* @param {float} to:float The degree with which to rotate the RectTransform\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.rotateAroundLocal(gameObject.GetComponent&lt;RectTransform&gt;(), Vector3.forward, 90f, 1f).setDelay(1f);\n*/\npublic static LTDescr rotateAroundLocal(RectTransform rectTrans, Vector3 axis, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_ROTATEAROUND_LOCAL, options().setRect( rectTrans ).setAxis(axis) );\n}\n\n/**\n* Rotate a RectTransform object (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.scale (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final Vector3 with which to tween to (localScale)\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.scale(gameObject.GetComponent&lt;RectTransform&gt;(), gameObject.GetComponent&lt;RectTransform&gt;().localScale*2f, 1f).setDelay(1f);\n*/\npublic static LTDescr scale(RectTransform rectTrans, Vector3 to, float time){\n\treturn pushNewTween( rectTrans.gameObject, to, time, TweenAction.CANVAS_SCALE, options().setRect( rectTrans ) );\n}\n\n/**\n* Alpha an Image Component attached to a RectTransform (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.alpha (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final Vector3 with which to tween to (localScale)\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.alpha(gameObject.GetComponent&lt;RectTransform&gt;(), 0.5f, 1f).setDelay(1f);\n*/\npublic static LTDescr alpha(RectTransform rectTrans, float to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(to,0f,0f), time, TweenAction.CANVAS_ALPHA, options().setRect( rectTrans ) );\n}\n\n/**\n* Change the Color of an Image Component attached to a RectTransform (used in Unity GUI in 4.6+, for Buttons, Panel, Scrollbar, etc...)\n* \n* @method LeanTween.alpha (RectTransform)\n* @param {RectTransform} rectTrans:RectTransform RectTransform that you wish to attach the tween to\n* @param {float} to:float The final Vector3 with which to tween to (localScale)\n* @param {float} time:float The time to complete the tween in\n* @return {LTDescr} LTDescr an object that distinguishes the tween\n* @example LeanTween.color(gameObject.GetComponent&lt;RectTransform&gt;(), 0.5f, 1f).setDelay(1f);\n*/\npublic static LTDescr color(RectTransform rectTrans, Color to, float time){\n\treturn pushNewTween( rectTrans.gameObject, new Vector3(1.0f, to.a, 0.0f), time, TweenAction.CANVAS_COLOR, options().setRect( rectTrans ).setPoint( new Vector3(to.r, to.g, to.b) ) );\n}\n\n#endif\n\n#if LEANTWEEN_1\n// LeanTween 1.x Methods\n\npublic static Hashtable h( object[] arr ){\n\tif(arr.Length%2==1){\n\t\tlogError(\"LeanTween - You have attempted to create a Hashtable with an odd number of values.\");\n\t\treturn null;\n\t}\n\tHashtable hash = new Hashtable();\n\tfor(i = 0; i < arr.Length; i += 2){\n\t\thash.Add(arr[i] as string, arr[i+1]);\n\t}\n\t\n\treturn hash;\n}\n\nprivate static int idFromUnique( int uniqueId ){\n\treturn uniqueId & 0xFFFF;\n}\n\nprivate static int pushNewTween( GameObject gameObject, Vector3 to, float time, TweenAction tweenAction, Hashtable optional ){\n\tinit(maxTweens);\n\tif(gameObject==null)\n\t\treturn -1;\n\t\n\tj = 0;\n\tfor(i = startSearch; j < maxTweens; i++){\n\t\tif(i>=maxTweens-1)\n\t\t\ti = 0;\n\t\tif(tweens[i].toggle==false){\n\t\t\tif(i+1>tweenMaxSearch)\n\t\t\t\ttweenMaxSearch = i+1;\n\t\t\tstartSearch = i + 1;\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tj++;\n\t\tif(j>=maxTweens){\n\t\t\tlogError(\"LeanTween - You have run out of available spaces for tweening. To avoid this error increase the number of spaces to available for tweening when you initialize the LeanTween class ex: LeanTween.init( \"+(maxTweens*2)+\" );\");\n\t\t\treturn -1;\n\t\t}\n\t}\n\tLTDescr tween = tweens[i];\n\ttween.toggle = true;\n\ttween.reset();\n\ttween.trans = gameObject.transform;\n\ttween.to = to;\n\ttween.time = time;\n\ttween.type = tweenAction;\n\ttween.optional = optional;\n\ttween.setId( (uint)i );\n\t//tween.hasPhysics = gameObject.rigidbody!=null;\n\n\tif(optional!=null){\n        var ease = optional[\"ease\"];\n        //LeanTweenType ease;\n\t\tvar optionsNotUsed = 0;\n\t\tif(ease!=null) {\n            tween.tweenType = LeanTweenType.linear;\n\t\t\tif( ease.GetType() ==typeof( LeanTweenType) ){\n                tween.tweenType = (LeanTweenType)ease;// Enum.Parse(typeof(LeanTweenType), optional[\"ease\"].ToString());\n\t\t\t} else if(ease.GetType() == typeof(AnimationCurve)){\n\t\t\t\ttween.animationCurve = optional[\"ease\"] as AnimationCurve;\n\t\t\t} else{\n\t\t\t\tstring func = optional[\"ease\"].ToString();\n\t\t\t\tif(func.Equals(\"easeOutQuad\")){\n\t\t\t\t\ttween.tweenType = LeanTweenType.easeOutQuad;\n\t\t\t\t}else if(func.Equals(\"easeInQuad\")){\n\t\t\t\t\ttween.tweenType = LeanTweenType.easeInQuad;\n\t\t\t\t}else if(func.Equals(\"easeInOutQuad\")){\n\t\t\t\t\ttween.tweenType = LeanTweenType.easeInOutQuad;\n\t\t\t\t}\n\t\t\t}\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"rect\"]!=null){\n\t\t\ttween.ltRect = (LTRect)optional[\"rect\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"path\"]!=null){\n\t\t\ttween.path = (LTBezierPath)optional[\"path\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"delay\"]!=null){\n\t\t\ttween.delay = (float)optional[\"delay\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"useEstimatedTime\"]!=null){\n\t\t\ttween.useEstimatedTime =(bool) optional[\"useEstimatedTime\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"useFrames\"]!=null){\n\t\t\ttween.useFrames =(bool) optional[\"useFrames\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"loopType\"]!=null){\n\t\t\ttween.loopType = (LeanTweenType)optional[\"loopType\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"repeat\"]!=null){\n\t\t\ttween.loopCount = (int)optional[\"repeat\"];\n\t\t\tif(tween.loopType==LeanTweenType.once)\n\t\t\t\ttween.loopType = LeanTweenType.clamp;\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"point\"]!=null){\n\t\t\ttween.point = (Vector3)optional[\"point\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional[\"axis\"]!=null){\n\t\t\ttween.axis = (Vector3)optional[\"axis\"];\n\t\t\toptionsNotUsed++;\n\t\t}\n\t\tif(optional.Count <= optionsNotUsed)\n\t\t\ttween.optional = null;  // nothing else is used with the extra piece, so set to null\n\t}else{\n\t\ttween.optional = null;\n\t}\n\t//Debug.Log(\"pushing new tween[\"+i+\"]:\"+tweens[i]);\n\t\n\treturn tweens[i].uniqueId;\n}\n\npublic static int value(string callOnUpdate, float from, float to, float time, Hashtable optional){\n\treturn value( tweenEmpty, callOnUpdate, from, to, time, optional );\n}\npublic static int value(GameObject gameObject, string callOnUpdate, float from, float to, float time){\n\treturn value(gameObject, callOnUpdate, from, to, time, new Hashtable()); \n}\npublic static int value(GameObject gameObject, string callOnUpdate, float from, float to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int value(GameObject gameObject, Action<float> callOnUpdate, float from, float to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int value(GameObject gameObject, Action<float,Hashtable> callOnUpdate, float from, float to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int value(GameObject gameObject,string callOnUpdate, float from, float to, float time, Hashtable optional){\n\tif(optional==null || optional.Count == 0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, optional ) );\n\ttweens[id].from = new Vector3(from,0,0);\n\treturn id;\n}\npublic static int value(GameObject gameObject,Action<float> callOnUpdate, float from, float to, float time, Hashtable optional){\n\tif(optional==null || optional.Count == 0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, optional ) );\n\ttweens[id].from = new Vector3(from,0,0);\n\treturn id;\n}\npublic static int value(GameObject gameObject,Action<float,Hashtable> callOnUpdate, float from, float to, float time, Hashtable optional){\n\tif(optional==null || optional.Count == 0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.CALLBACK, optional ) );\n\ttweens[id].from = new Vector3(from,0,0);\n\treturn id;\n}\npublic static int value(GameObject gameObject, String callOnUpdate, Vector3 from, Vector3 to, float time, Hashtable optional){\n\tif(optional==null || optional.Count==0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, to, time, TweenAction.VALUE3, optional ) );\n\ttweens[id].from = from;\n\treturn id;\n}\npublic static int value(GameObject gameObject, String callOnUpdate, Vector3 from, Vector3 to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int value(GameObject gameObject, System.Action<Vector3> callOnUpdate, Vector3 from, Vector3 to, float time, Hashtable optional){\n\tif(optional==null || optional.Count==0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, to, time, TweenAction.VALUE3, optional ) );\n\ttweens[id].from = from;\n\treturn id;\n}\npublic static int value(GameObject gameObject, System.Action<Vector3,Hashtable> callOnUpdate, Vector3 from, Vector3 to, float time, Hashtable optional){\n\tif(optional==null || optional.Count==0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"onUpdate\"] = callOnUpdate;\n\tint id = idFromUnique( pushNewTween( gameObject, to, time, TweenAction.VALUE3, optional ) );\n\ttweens[id].from = from;\n\treturn id;\n}\npublic static int value(GameObject gameObject, System.Action<Vector3> callOnUpdate, Vector3 from, Vector3 to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int value(GameObject gameObject, System.Action<Vector3,Hashtable> callOnUpdate, Vector3 from, Vector3 to, float time, object[] optional){\n\treturn value(gameObject, callOnUpdate, from, to, time, h(optional)); \n}\npublic static int rotate(GameObject gameObject, Vector3 to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, to, time, TweenAction.ROTATE, optional );\n}\npublic static int rotate(GameObject gameObject, Vector3 to, float time, object[] optional){\n\treturn rotate( gameObject, to, time, h( optional ) );\n}\npublic static int rotate(LTRect ltRect, float to, float time, Hashtable optional){\n\tinit();\n\tif( optional==null || optional.Count == 0 )\n\t\toptional = new Hashtable();\n\n\toptional[\"rect\"] = ltRect;\n\treturn pushNewTween( tweenEmpty, new Vector3(to,0f,0f), time, TweenAction.GUI_ROTATE, optional );\n}\npublic static int rotate(LTRect ltRect, float to, float time, object[] optional){\n\treturn rotate( ltRect, to, time, h(optional) );\n}\npublic static int rotateX(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_X, optional );\n}\npublic static int rotateX(GameObject gameObject, float to, float time, object[] optional){\n\treturn rotateX( gameObject, to, time, h(optional) );\n}\npublic static int rotateY(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_Y, optional );\n}\npublic static int rotateY(GameObject gameObject, float to, float time, object[] optional){\n\treturn rotateY( gameObject, to, time, h(optional) );\n}\npublic static int rotateZ(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ROTATE_Z, optional );\n}\npublic static int rotateZ(GameObject gameObject, float to, float time, object[] optional){\n\treturn rotateZ( gameObject, to, time, h(optional) );\n}\npublic static int rotateLocal(GameObject gameObject, Vector3 to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, to, time, TweenAction.ROTATE_LOCAL, optional );\n}\npublic static int rotateLocal(GameObject gameObject, Vector3 to, float time, object[] optional){\n\treturn rotateLocal( gameObject, to, time, h(optional) );\n}\npublic static int rotateAround(GameObject gameObject, Vector3 axis, float add, float time, Hashtable optional){\n\tif(optional==null || optional.Count==0)\n\t\toptional = new Hashtable();\n\t\t\n\toptional[\"axis\"] = axis;\n\tif(optional[\"point\"]==null)\n\t\toptional[\"point\"] = Vector3.zero;\n\n\treturn pushNewTween( gameObject, new Vector3(add,0f,0f), time, TweenAction.ROTATE_AROUND, optional );\n}\npublic static int rotateAround(GameObject gameObject, Vector3 axis, float add, float time, object[] optional){\n\treturn rotateAround(gameObject, axis, add, time, h(optional));\n}\npublic static int moveX(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_X, optional );\n}\npublic static int moveX(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveX( gameObject, to, time, h(optional) );\n}\npublic static int moveY(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_Y, optional );\n}\npublic static int moveY(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveY( gameObject, to, time, h(optional) );\n}\npublic static int moveZ(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_Z, optional );\n}\npublic static int moveZ(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveZ( gameObject, to, time, h(optional) );\n}\npublic static int move(GameObject gameObject, Vector3 to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, to, time, TweenAction.MOVE, optional );\n}\npublic static int move(GameObject gameObject, Vector3 to, float time, object[] optional){\n\treturn move( gameObject, to, time, LeanTween.h( optional ) );\n}\npublic static int move(GameObject gameObject, Vector3[] to, float time, Hashtable optional){\n\tif(to.Length<4){\n\t\tstring errorMsg = \"LeanTween - When passing values for a vector path, you must pass four or more values!\";\n\t\tif(throwErrors) Debug.LogError(errorMsg); else Debug.Log(errorMsg);\n\t\treturn -1;\n\t}\n\tif(to.Length%4!=0){\n\t\tstring errorMsg2 = \"LeanTween - When passing values for a vector path, they must be in sets of four: controlPoint1, controlPoint2, endPoint2, controlPoint2, controlPoint2...\";\n\t\tif(throwErrors) Debug.LogError(errorMsg2); else Debug.Log(errorMsg2);\n\t\treturn -1;\n\t}\n\n\tinit();\n\tif( optional==null || optional.Count == 0 )\n\t\toptional = new Hashtable();\n\n\tLTBezierPath ltPath = new LTBezierPath( to );\n\tif(optional[\"orientToPath\"]!=null)\n\t\tltPath.orientToPath = true;\n\toptional[\"path\"] = ltPath;\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_CURVED, optional );\n}\npublic static int move(GameObject gameObject, Vector3[] to, float time, object[] optional){\n\treturn move( gameObject, to, time, LeanTween.h( optional ) );\n}\n\npublic static int move(LTRect ltRect, Vector2 to, float time, Hashtable optional){\n\tinit();\n\tif( optional==null || optional.Count == 0 )\n\t\toptional = new Hashtable();\n\n\toptional[\"rect\"] = ltRect;\n\treturn pushNewTween( tweenEmpty, to, time, TweenAction.GUI_MOVE, optional );\n}\npublic static int move(LTRect ltRect, Vector3 to, float time, object[] optional){\n\treturn move( ltRect, to, time, LeanTween.h( optional ) );\n}\n\t\npublic static int moveLocal(GameObject gameObject, Vector3 to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, to, time, TweenAction.MOVE_LOCAL, optional );\n}\npublic static int moveLocal(GameObject gameObject, Vector3 to, float time, object[] optional){\n\treturn moveLocal( gameObject, to, time, LeanTween.h( optional ) );\n}\n\npublic static int moveLocal(GameObject gameObject, Vector3[] to, float time, Hashtable optional){\n\tif(to.Length<4){\n\t\tstring errorMsg = \"LeanTween - When passing values for a vector path, you must pass four or more values!\";\n\t\tif(throwErrors) Debug.LogError(errorMsg); else Debug.Log(errorMsg);\n\t\treturn -1;\n\t}\n\tif(to.Length%4!=0){\n\t\tstring errorMsg2 = \"LeanTween - When passing values for a vector path, they must be in sets of four: controlPoint1, controlPoint2, endPoint2, controlPoint2, controlPoint2...\";\n\t\tif(throwErrors) Debug.LogError(errorMsg2); else Debug.Log(errorMsg2);\n\t\treturn -1;\n\t}\n\n\tinit();\n\tif( optional == null )\n\t\toptional = new Hashtable();\n\n\tLTBezierPath ltPath = new LTBezierPath( to );\n\tif(optional[\"orientToPath\"]!=null)\n\t\tltPath.orientToPath = true;\n\toptional[\"path\"] = ltPath;\n\n\treturn pushNewTween( gameObject, new Vector3(1.0f,0.0f,0.0f), time, TweenAction.MOVE_CURVED_LOCAL, optional );\n}\npublic static int moveLocal(GameObject gameObject, Vector3[] to, float time,object[] optional){\n\treturn moveLocal( gameObject, to, time, LeanTween.h( optional ) );\n}\npublic static int moveLocalX(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_X, optional );\n}\npublic static int moveLocalX(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveLocalX( gameObject, to, time, h(optional) );\n}\npublic static int moveLocalY(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_Y, optional );\n}\npublic static int moveLocalY(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveLocalY( gameObject, to, time, h(optional) );\n}\npublic static int moveLocalZ(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.MOVE_LOCAL_Z, optional );\n}\npublic static int moveLocalZ(GameObject gameObject, float to, float time, object[] optional){\n\treturn moveLocalZ( gameObject, to, time, h(optional) );\n}\npublic static int scale(GameObject gameObject, Vector3 to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, to, time, TweenAction.SCALE, optional );\n}\npublic static int scale(GameObject gameObject, Vector3 to, float time, object[] optional){\n\treturn scale( gameObject, to, time, h(optional) );\n}\npublic static int scale(LTRect ltRect,Vector2 to, float time, Hashtable optional)\n{ \n\tinit();\n\tif( optional==null || optional.Count == 0 )\n\t\toptional = new Hashtable();\n\n\toptional[\"rect\"] = ltRect;\n\treturn pushNewTween( tweenEmpty, to, time, TweenAction.GUI_SCALE, optional );\n}\npublic static int scale(LTRect ltRect, Vector2 to, float time, object[] optional){\n\treturn scale( ltRect, to, time, h(optional) );\n}\npublic static int alpha(LTRect ltRect, float to, float time, Hashtable optional){\n\tinit();\n\tif( optional==null || optional.Count == 0 )\n\t\toptional = new Hashtable();\n\n\tltRect.alphaEnabled = true;\n\toptional[\"rect\"] = ltRect;\n\treturn pushNewTween( tweenEmpty, new Vector3(to,0f,0f), time, TweenAction.GUI_ALPHA, optional );\n}\npublic static int alpha(LTRect ltRect, float to, float time, object[] optional){\n\treturn alpha( ltRect, to, time, h(optional) );\n}\npublic static int scaleX(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_X, optional );\n}\npublic static int scaleX(GameObject gameObject, float to, float time, object[] optional){\n\treturn scaleX( gameObject, to, time, h(optional) );\n}\npublic static int scaleY(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_Y, optional );\n}\npublic static int scaleY(GameObject gameObject, float to, float time, object[] optional){\n\treturn scaleY( gameObject, to, time, h(optional) );\n}\npublic static int scaleZ(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.SCALE_Z, optional );\n}\npublic static int scaleZ(GameObject gameObject, float to, float time, object[] optional){\n\treturn scaleZ( gameObject, to, time, h(optional) );\n}\npublic static int delayedCall( float delayTime, string callback, Hashtable optional ){\n\tinit();\n\treturn delayedCall( tweenEmpty, delayTime, callback, optional );\n}\npublic static int delayedCall( float delayTime, Action callback, object[] optional){\n\tinit();\n\treturn delayedCall( tweenEmpty, delayTime, callback, h(optional) );\n}\npublic static int delayedCall( GameObject gameObject, float delayTime, string callback, object[] optional){\n\treturn delayedCall( gameObject, delayTime, callback, h(optional) );\n}\npublic static int delayedCall( GameObject gameObject, float delayTime, Action callback, object[] optional){\n\treturn delayedCall( gameObject, delayTime, callback, h(optional) );\n}\npublic static int delayedCall( GameObject gameObject, float delayTime, string callback, Hashtable optional){\n\tif(optional==null || optional.Count == 0)\n\t\toptional = new Hashtable();\n\toptional[\"onComplete\"] = callback;\n\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, optional );\n}\npublic static int delayedCall( GameObject gameObject, float delayTime, Action callback, Hashtable optional){\n\tif(optional==null)\n\t\toptional = new Hashtable();\n\toptional[\"onComplete\"] = callback;\n\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, optional );\n}\npublic static int delayedCall( GameObject gameObject, float delayTime, Action<object> callback, Hashtable optional){\n\tif(optional==null)\n\t\toptional = new Hashtable();\n\toptional[\"onComplete\"] = callback;\n\n\treturn pushNewTween( gameObject, Vector3.zero, delayTime, TweenAction.CALLBACK, optional );\n}\npublic static int alpha(GameObject gameObject, float to, float time, Hashtable optional){\n\treturn pushNewTween( gameObject, new Vector3(to,0,0), time, TweenAction.ALPHA, optional );\n}\npublic static int alpha(GameObject gameObject, float to, float time, object[] optional){\n\treturn alpha(gameObject, to, time, h(optional)); \n}\n#endif\n\n// Tweening Functions - Thanks to Robert Penner and GFX47\n\nprivate static float tweenOnCurve( LTDescrImpl tweenDescr, float ratioPassed ){\n\t// Debug.Log(\"single ratio:\"+ratioPassed+\" tweenDescr.animationCurve.Evaluate(ratioPassed):\"+tweenDescr.animationCurve.Evaluate(ratioPassed));\n\treturn tweenDescr.from.x + (tweenDescr.diff.x) * tweenDescr.animationCurve.Evaluate(ratioPassed);\n}\n\nprivate static Vector3 tweenOnCurveVector( LTDescrImpl tweenDescr, float ratioPassed ){\n\treturn\tnew Vector3(tweenDescr.from.x + (tweenDescr.diff.x) * tweenDescr.animationCurve.Evaluate(ratioPassed),\n\t\t\t\t\t\ttweenDescr.from.y + (tweenDescr.diff.y) * tweenDescr.animationCurve.Evaluate(ratioPassed),\n\t\t\t\t\t\ttweenDescr.from.z + (tweenDescr.diff.z) * tweenDescr.animationCurve.Evaluate(ratioPassed) );\n}\n\nprivate static float easeOutQuadOpt( float start, float diff, float ratioPassed ){\n\treturn -diff * ratioPassed * (ratioPassed - 2) + start;\n}\n\nprivate static float easeInQuadOpt( float start, float diff, float ratioPassed ){\n\treturn diff * ratioPassed * ratioPassed + start;\n}\n\nprivate static float easeInOutQuadOpt( float start, float diff, float ratioPassed ){\n\tratioPassed /= .5f;\n\tif (ratioPassed < 1) return diff / 2 * ratioPassed * ratioPassed + start;\n\tratioPassed--;\n\treturn -diff / 2 * (ratioPassed * (ratioPassed - 2) - 1) + start;\n}\n\nprivate static float linear(float start, float end, float val){\n\treturn Mathf.Lerp(start, end, val);\n}\n\nprivate static float clerp(float start, float end, float val){\n\tfloat min = 0.0f;\n\tfloat max = 360.0f;\n\tfloat half = Mathf.Abs((max - min) / 2.0f);\n\tfloat retval = 0.0f;\n\tfloat diff = 0.0f;\n\tif ((end - start) < -half){\n\t\tdiff = ((max - start) + end) * val;\n\t\tretval = start + diff;\n\t}else if ((end - start) > half){\n\t\tdiff = -((max - end) + start) * val;\n\t\tretval = start + diff;\n\t}else retval = start + (end - start) * val;\n\treturn retval;\n}\n\nprivate static float spring(float start, float end, float val ){\n\tval = Mathf.Clamp01(val);\n\tval = (Mathf.Sin(val * Mathf.PI * (0.2f + 2.5f * val * val * val)) * Mathf.Pow(1f - val, 2.2f ) + val) * (1f + (1.2f * (1f - val) ));\n\treturn start + (end - start) * val;\n}\n\nprivate static float easeInQuad(float start, float end, float val){\n\tend -= start;\n\treturn end * val * val + start;\n}\n\nprivate static float easeOutQuad(float start, float end, float val){\n\tend -= start;\n\treturn -end * val * (val - 2) + start;\n}\n\nprivate static float easeInOutQuad(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return end / 2 * val * val + start;\n\tval--;\n\treturn -end / 2 * (val * (val - 2) - 1) + start;\n}\n\nprivate static float easeInCubic(float start, float end, float val){\n\tend -= start;\n\treturn end * val * val * val + start;\n}\n\nprivate static float easeOutCubic(float start, float end, float val){\n\tval--;\n\tend -= start;\n\treturn end * (val * val * val + 1) + start;\n}\n\nprivate static float easeInOutCubic(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return end / 2 * val * val * val + start;\n\tval -= 2;\n\treturn end / 2 * (val * val * val + 2) + start;\n}\n\nprivate static float easeInQuart(float start, float end, float val){\n\tend -= start;\n\treturn end * val * val * val * val + start;\n}\n\nprivate static float easeOutQuart(float start, float end, float val){\n\tval--;\n\tend -= start;\n\treturn -end * (val * val * val * val - 1) + start;\n}\n\nprivate static float easeInOutQuart(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return end / 2 * val * val * val * val + start;\n\tval -= 2;\n\treturn -end / 2 * (val * val * val * val - 2) + start;\n}\n\nprivate static float easeInQuint(float start, float end, float val){\n\tend -= start;\n\treturn end * val * val * val * val * val + start;\n}\n\nprivate static float easeOutQuint(float start, float end, float val){\n\tval--;\n\tend -= start;\n\treturn end * (val * val * val * val * val + 1) + start;\n}\n\nprivate static float easeInOutQuint(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return end / 2 * val * val * val * val * val + start;\n\tval -= 2;\n\treturn end / 2 * (val * val * val * val * val + 2) + start;\n}\n\nprivate static float easeInSine(float start, float end, float val){\n\tend -= start;\n\treturn -end * Mathf.Cos(val / 1 * (Mathf.PI / 2)) + end + start;\n}\n\nprivate static float easeOutSine(float start, float end, float val){\n\tend -= start;\n\treturn end * Mathf.Sin(val / 1 * (Mathf.PI / 2)) + start;\n}\n\nprivate static float easeInOutSine(float start, float end, float val){\n\tend -= start;\n\treturn -end / 2 * (Mathf.Cos(Mathf.PI * val / 1) - 1) + start;\n}\n\nprivate static float easeInExpo(float start, float end, float val){\n\tend -= start;\n\treturn end * Mathf.Pow(2, 10 * (val / 1 - 1)) + start;\n}\n\nprivate static float easeOutExpo(float start, float end, float val){\n\tend -= start;\n\treturn end * (-Mathf.Pow(2, -10 * val / 1) + 1) + start;\n}\n\nprivate static float easeInOutExpo(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return end / 2 * Mathf.Pow(2, 10 * (val - 1)) + start;\n\tval--;\n\treturn end / 2 * (-Mathf.Pow(2, -10 * val) + 2) + start;\n}\n\nprivate static float easeInCirc(float start, float end, float val){\n\tend -= start;\n\treturn -end * (Mathf.Sqrt(1 - val * val) - 1) + start;\n}\n\nprivate static float easeOutCirc(float start, float end, float val){\n\tval--;\n\tend -= start;\n\treturn end * Mathf.Sqrt(1 - val * val) + start;\n}\n\nprivate static float easeInOutCirc(float start, float end, float val){\n\tval /= .5f;\n\tend -= start;\n\tif (val < 1) return -end / 2 * (Mathf.Sqrt(1 - val * val) - 1) + start;\n\tval -= 2;\n\treturn end / 2 * (Mathf.Sqrt(1 - val * val) + 1) + start;\n}\n\nprivate static float easeInBounce(float start, float end, float val){\n\tend -= start;\n\tfloat d = 1f;\n\treturn end - easeOutBounce(0, end, d-val) + start;\n}\n\nprivate static float easeOutBounce(float start, float end, float val){\n\tval /= 1f;\n\tend -= start;\n\tif (val < (1 / 2.75f)){\n\t\treturn end * (7.5625f * val * val) + start;\n\t}else if (val < (2 / 2.75f)){\n\t\tval -= (1.5f / 2.75f);\n\t\treturn end * (7.5625f * (val) * val + .75f) + start;\n\t}else if (val < (2.5 / 2.75)){\n\t\tval -= (2.25f / 2.75f);\n\t\treturn end * (7.5625f * (val) * val + .9375f) + start;\n\t}else{\n\t\tval -= (2.625f / 2.75f);\n\t\treturn end * (7.5625f * (val) * val + .984375f) + start;\n\t}\n}\n\n/*private static float easeOutBounce( float start, float end, float val, float overshoot = 1.0f ){\n\tend -= start;\n\tfloat baseAmt = 2.75f * overshoot;\n\tfloat baseAmt2 = baseAmt * baseAmt;\n\tDebug.Log(\"val:\"+val); // 1f, 0.75f, 0.5f, 0.25f, 0.125f\n\tif (val < ((baseAmt-(baseAmt - 1f)) / baseAmt)){ // 0.36\n\t\treturn end * (baseAmt2 * val * val) + start; // 1 - 1/1\n\n\t}else if (val < ((baseAmt-0.75f) / baseAmt)){ // .72\n\t\tval -= ((baseAmt-(baseAmt - 1f - 0.5f)) / baseAmt); // 1.25f\n\t\treturn end * (baseAmt2 * val * val + .75f) + start; // 1 - 1/(4)\n\n\t}else if (val < ((baseAmt-(baseAmt - 1f - 0.5f - 0.25f)) / baseAmt)){ // .909\n\t\tval -= ((baseAmt-0.5f) / baseAmt); // 0.5\n\t\treturn end * (baseAmt2 * val * val + .9375f) + start; // 1 - 1/(4*4)\n\n\t}else{ // x\n\t\t// Debug.Log(\"else val:\"+val);\n\t\tval -= ((baseAmt-0.125f) / baseAmt); // 0.125\n\t\treturn end * (baseAmt2 * val * val + .984375f) + start; // 1 - 1/(4*4*4)\n\n\t}\n}*/\n\nprivate static float easeInOutBounce(float start, float end, float val){\n\tend -= start;\n\tfloat d= 1f;\n\tif (val < d/2) return easeInBounce(0, end, val*2) * 0.5f + start;\n\telse return easeOutBounce(0, end, val*2-d) * 0.5f + end*0.5f + start;\n}\n\nprivate static float easeInBack(float start, float end, float val, float overshoot = 1.0f){\n\tend -= start;\n\tval /= 1;\n\tfloat s= 1.70158f * overshoot;\n\treturn end * (val) * val * ((s + 1) * val - s) + start;\n}\n\nprivate static float easeOutBack(float start, float end, float val, float overshoot = 1.0f){\n\tfloat s = 1.70158f * overshoot;\n\tend -= start;\n\tval = (val / 1) - 1;\n\treturn end * ((val) * val * ((s + 1) * val + s) + 1) + start;\n}\n\nprivate static float easeInOutBack(float start, float end, float val, float overshoot = 1.0f){\n\tfloat s = 1.70158f * overshoot;\n\tend -= start;\n\tval /= .5f;\n\tif ((val) < 1){\n\t\ts *= (1.525f) * overshoot;\n\t\treturn end / 2 * (val * val * (((s) + 1) * val - s)) + start;\n\t}\n\tval -= 2;\n\ts *= (1.525f) * overshoot;\n\treturn end / 2 * ((val) * val * (((s) + 1) * val + s) + 2) + start;\n}\n\nprivate static float easeInElastic(float start, float end, float val, float overshoot = 1.0f, float period = 0.3f){\n\tend -= start;\n\t\n\tfloat p = period;\n\tfloat s = 0f;\n\tfloat a = 0f;\n\t\n\tif (val == 0f) return start;\n\n\tif (val == 1f) return start + end;\n\t\n\tif (a == 0f || a < Mathf.Abs(end)){\n\t\ta = end;\n\t\ts = p / 4f;\n\t}else{\n\t\ts = p / (2f * Mathf.PI) * Mathf.Asin(end / a);\n\t}\n\t\n\tif(overshoot>1f && val>0.6f )\n\t\tovershoot = 1f + ((1f-val) / 0.4f * (overshoot-1f));\n\t// Debug.Log(\"ease in elastic val:\"+val+\" a:\"+a+\" overshoot:\"+overshoot);\n\n\tval = val-1f;\n\treturn start-(a * Mathf.Pow(2f, 10f * val) * Mathf.Sin((val - s) * (2f * Mathf.PI) / p)) * overshoot;\n}\t\t\n\nprivate static float easeOutElastic(float start, float end, float val, float overshoot = 1.0f, float period = 0.3f){\n\tend -= start;\n\t\n\tfloat p = period;\n\tfloat s = 0f;\n\tfloat a = 0f;\n\t\n\tif (val == 0f) return start;\n\t\n\t// Debug.Log(\"ease out elastic val:\"+val+\" a:\"+a);\n\tif (val == 1f) return start + end;\n\t\n\tif (a == 0f || a < Mathf.Abs(end)){\n\t\ta = end;\n\t\ts = p / 4f;\n\t}else{\n\t\ts = p / (2f * Mathf.PI) * Mathf.Asin(end / a);\n\t}\n\tif(overshoot>1f && val<0.4f )\n\t\tovershoot = 1f + (val / 0.4f * (overshoot-1f));\n\t// Debug.Log(\"ease out elastic val:\"+val+\" a:\"+a+\" overshoot:\"+overshoot);\n\t\n\treturn start + end + a * Mathf.Pow(2f, -10f * val) * Mathf.Sin((val - s) * (2f * Mathf.PI) / p) * overshoot;\n}\t\t\n\nprivate static float easeInOutElastic(float start, float end, float val, float overshoot = 1.0f, float period = 0.3f)\n{\n\tend -= start;\n\t\n\tfloat p = period;\n\tfloat s = 0f;\n\tfloat a = 0f;\n\t\n\tif (val == 0f) return start;\n\t\n\tval = val / (1f/2f);\n\tif (val == 2f) return start + end;\n\t\n\tif (a == 0f || a < Mathf.Abs(end)){\n\t\ta = end;\n\t\ts = p / 4f;\n\t}else{\n\t\ts = p / (2f * Mathf.PI) * Mathf.Asin(end / a);\n\t}\n\t\n\tif(overshoot>1f){\n\t\tif( val<0.2f ){\n\t\t\tovershoot = 1f + (val / 0.2f * (overshoot-1f));\n\t\t}else if( val > 0.8f ){\n\t\t\tovershoot = 1f + ((1f-val) / 0.2f * (overshoot-1f));\n\t\t}\n\t}\n\n\tif (val < 1f){\n\t\tval = val-1f;\n\t\treturn start - 0.5f * (a * Mathf.Pow(2f, 10f * val) * Mathf.Sin((val - s) * (2f * Mathf.PI) / p)) * overshoot;\n\t}\n\tval = val-1f;\n\treturn end + start + a * Mathf.Pow(2f, -10f * val) * Mathf.Sin((val - s) * (2f * Mathf.PI) / p) * 0.5f * overshoot;\n}\n\n// LeanTween Listening/Dispatch\n\nprivate static System.Action<LTEvent>[] eventListeners;\nprivate static GameObject[] goListeners;\nprivate static int eventsMaxSearch = 0;\npublic static int EVENTS_MAX = 10;\npublic static int LISTENERS_MAX = 10;\nprivate static int INIT_LISTENERS_MAX = LISTENERS_MAX;\n\npublic static void addListener( int eventId, System.Action<LTEvent> callback ){\n\taddListener(tweenEmpty, eventId, callback);\n}\n\n/**\n* Add a listener method to be called when the appropriate LeanTween.dispatchEvent is called\n*\n* @method LeanTween.addListener\n* @param {GameObject} caller:GameObject the gameObject the listener is attached to\n* @param {int} eventId:int a unique int that describes the event (best to use an enum)\n* @param {System.Action<LTEvent>} callback:System.Action<LTEvent> the method to call when the event has been dispatched\n* @example\n* LeanTween.addListener(gameObject, (int)MyEvents.JUMP, jumpUp);<br>\n* <br>\n* void jumpUp( LTEvent e ){ Debug.Log(\"jump!\"); }<br>\n*/\npublic static void addListener( GameObject caller, int eventId, System.Action<LTEvent> callback ){\n\tif(eventListeners==null){\n\t\tINIT_LISTENERS_MAX = LISTENERS_MAX;\n\t\teventListeners = new System.Action<LTEvent>[ EVENTS_MAX * LISTENERS_MAX ];\n\t\tgoListeners = new GameObject[ EVENTS_MAX * LISTENERS_MAX ];\n\t}\n\t// Debug.Log(\"searching for an empty space for:\"+caller + \" eventid:\"+event);\n\tfor(i = 0; i < INIT_LISTENERS_MAX; i++){\n\t\tint point = eventId*INIT_LISTENERS_MAX + i;\n\t\tif(goListeners[ point ]==null || eventListeners[ point ]==null){\n\t\t\teventListeners[ point ] = callback;\n\t\t\tgoListeners[ point ] = caller;\n\t\t\tif(i>=eventsMaxSearch)\n\t\t\t\teventsMaxSearch = i+1;\n\t\t\t// Debug.Log(\"adding event for:\"+caller.name);\n\n\t\t\treturn;\n\t\t}\n\t\t#if UNITY_FLASH\n\t\tif(goListeners[ point ] == caller && System.Object.ReferenceEquals( eventListeners[ point ], callback)){  \n\t\t\t// Debug.Log(\"This event is already being listened for.\");\n\t\t\treturn;\n\t\t}\n\t\t#else\n\t\tif(goListeners[ point ] == caller && System.Object.Equals( eventListeners[ point ], callback)){  \n\t\t\t// Debug.Log(\"This event is already being listened for.\");\n\t\t\treturn;\n\t\t}\n\t\t#endif\n\t}\n\tDebug.LogError(\"You ran out of areas to add listeners, consider increasing INIT_LISTENERS_MAX, ex: LeanTween.INIT_LISTENERS_MAX = \"+(INIT_LISTENERS_MAX*2));\n}\n\npublic static bool removeListener( int eventId, System.Action<LTEvent> callback ){\n\treturn removeListener( tweenEmpty, eventId, callback);\n}\n\n/**\n* Remove an event listener you have added\n* @method LeanTween.removeListener\n* @param {GameObject} caller:GameObject the gameObject the listener is attached to\n* @param {int} eventId:int a unique int that describes the event (best to use an enum)\n* @param {System.Action<LTEvent>} callback:System.Action<LTEvent> the method that was specified to call when the event has been dispatched\n* @example\n* LeanTween.removeListener(gameObject, (int)MyEvents.JUMP, jumpUp);<br>\n* <br>\n* void jumpUp( LTEvent e ){ }<br>\n*/\npublic static bool removeListener( GameObject caller, int eventId, System.Action<LTEvent> callback ){\n\tfor(i = 0; i < eventsMaxSearch; i++){\n\t\tint point = eventId*INIT_LISTENERS_MAX + i;\n\t\t#if UNITY_FLASH\n\t\tif(goListeners[ point ] == caller && System.Object.ReferenceEquals( eventListeners[ point ], callback) ){\n\t\t#else\n\t\tif(goListeners[ point ] == caller && System.Object.Equals( eventListeners[ point ], callback) ){\n\t\t#endif\n\t\t\teventListeners[ point ] = null;\n\t\t\tgoListeners[ point ] = null;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/**\n* Tell the added listeners that you are dispatching the event\n* @method LeanTween.dispatchEvent\n* @param {int} eventId:int a unique int that describes the event (best to use an enum)\n* @example\n* LeanTween.dispatchEvent( (int)MyEvents.JUMP );<br>\n*/\npublic static void dispatchEvent( int eventId ){\n\tdispatchEvent( eventId, null);\n}\n\n/**\n* Tell the added listeners that you are dispatching the event\n* @method LeanTween.dispatchEvent\n* @param {int} eventId:int a unique int that describes the event (best to use an enum)\n* @param {object} data:object Pass data to the listener, access it from the listener with *.data on the LTEvent object\n* @example\n* LeanTween.dispatchEvent( (int)MyEvents.JUMP, transform );<br>\n* <br>\n* void jumpUp( LTEvent e ){<br>\n* &nbsp; Transform tran = (Transform)e.data;<br>\n* }<br>\n*/\npublic static void dispatchEvent( int eventId, object data ){\n\tfor(int k = 0; k < eventsMaxSearch; k++){\n\t\tint point = eventId*INIT_LISTENERS_MAX + k;\n\t\tif(eventListeners[ point ]!=null){\n\t\t\tif(goListeners[point]){\n\t\t\t\teventListeners[ point ]( new LTEvent(eventId, data) );\n\t\t\t}else{\n\t\t\t\teventListeners[ point ] = null;\n\t\t\t}\n\t\t}\n\t}\n}\n\n} // End LeanTween class\n\npublic class LTBezier {\n\tpublic float length;\n\n\tprivate Vector3 a;\n\tprivate Vector3 aa;\n\tprivate Vector3 bb;\n\tprivate Vector3 cc;\n\tprivate float len;\n\tprivate float[] arcLengths;\n\n\tpublic LTBezier(Vector3 a, Vector3 b, Vector3 c, Vector3 d, float precision){\n\t\tthis.a = a;\n\t    aa = (-a + 3*(b-c) + d);\n\t    bb = 3*(a+c) - 6*b;\n\t    cc = 3*(b-a);\n\n\t    this.len = 1.0f / precision;\n\t    arcLengths = new float[(int)this.len + (int)1];\n\t    arcLengths[0] = 0;\n\n\t    Vector3 ov = a;\n\t    Vector3 v;\n\t    float clen = 0.0f;\n\t    for(int i = 1; i <= this.len; i++) {\n\t        v = bezierPoint(i * precision);\n\t        clen += (ov - v).magnitude;\n\t        this.arcLengths[i] = clen;\n\t        ov = v;\n\t    }\n\t    this.length = clen;\n\t}\n\n    private float map(float u) {\n        float targetLength = u * this.arcLengths[(int)this.len];\n        int low = 0;\n        int high = (int)this.len;\n        int index = 0;\n        while (low < high) {\n            index = low + ((int)((high - low) / 2.0f) | 0);\n            if (this.arcLengths[index] < targetLength) {\n                low = index + 1;\n            } else {\n                high = index;\n            }\n        }\n        if(this.arcLengths[index] > targetLength)\n            index--;\n        if(index<0)\n        \tindex = 0;\n\n        return (index + (targetLength - arcLengths[index]) / (arcLengths[index + 1] - arcLengths[index])) / this.len;\n    }\n\n   \tprivate Vector3 bezierPoint(float t){\n\t    return ((aa* t + (bb))* t + cc)* t + a;\n\t}\n\n    public Vector3 point(float t){ \n    \treturn bezierPoint( map(t) ); \n    }\n}\n\n/**\n* Manually animate along a bezier path with this class\n* @class LTBezierPath\n* @constructor\n* @param {Vector3 Array} pts A set of points that define one or many bezier paths (the paths should be passed in multiples of 4, which correspond to each individual bezier curve)\n* @example \n* LTBezierPath ltPath = new LTBezierPath( new Vector3[] { new Vector3(0f,0f,0f),new Vector3(1f,0f,0f), new Vector3(1f,0f,0f), new Vector3(1f,1f,0f)} );<br><br>\n* LeanTween.move(lt, ltPath.vec3, 4.0f).setOrientToPath(true).setDelay(1f).setEase(LeanTweenType.easeInOutQuad); // animate <br>\n* Vector3 pt = ltPath.point( 0.6f ); // retrieve a point along the path\n*/\npublic class LTBezierPath {\n\tpublic Vector3[] pts;\n\tpublic float length;\n\tpublic bool orientToPath;\n\tpublic bool orientToPath2d;\n\n\tprivate LTBezier[] beziers;\n\tprivate float[] lengthRatio;\n\tprivate int currentBezier=0,previousBezier=0;\n\n\tpublic LTBezierPath(){ }\n\tpublic LTBezierPath( Vector3[] pts_ ){\n\t\tsetPoints( pts_ );\n\t}\n\n\tpublic void setPoints( Vector3[] pts_ ){\n\t\tif(pts_.Length<4)\n\t\t\tLeanTween.logError( \"LeanTween - When passing values for a vector path, you must pass four or more values!\" );\n\t\tif(pts_.Length%4!=0)\n\t\t\tLeanTween.logError( \"LeanTween - When passing values for a vector path, they must be in sets of four: controlPoint1, controlPoint2, endPoint2, controlPoint2, controlPoint2...\" );\n\n\t\tpts = pts_;\n\t\t\n\t\tint k = 0;\n\t\tbeziers = new LTBezier[ pts.Length / 4 ];\n\t\tlengthRatio = new float[ beziers.Length ];\n\t\tint i;\n\t\tlength = 0;\n\t\tfor(i = 0; i < pts.Length; i+=4){\n\t\t\tbeziers[k] = new LTBezier(pts[i+0],pts[i+2],pts[i+1],pts[i+3],0.05f);\n\t\t\tlength += beziers[k].length;\n\t\t\tk++;\n\t\t}\n\t\t// Debug.Log(\"beziers.Length:\"+beziers.Length + \" beziers:\"+beziers);\n\t\tfor(i = 0; i < beziers.Length; i++){\n\t\t\tlengthRatio[i] = beziers[i].length / length;\n\t\t}\n\t}\n\n\t/**\n\t* Retrieve a point along a path\n\t* \n\t* @method point\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @return {Vector3} Vector3 position of the point along the path\n\t* @example\n\t* transform.position = ltPath.point( 0.6f );\n\t*/\n\tpublic Vector3 point( float ratio ){\n\t\tfloat added = 0.0f;\n\t\tfor(int i = 0; i < lengthRatio.Length; i++){\n\t\t\tadded += lengthRatio[i];\n\t\t\tif(added >= ratio)\n\t\t\t\treturn beziers[i].point( (ratio-(added-lengthRatio[i])) / lengthRatio[i] );\n\t\t}\n\t\treturn beziers[lengthRatio.Length-1].point( 1.0f );\n\t}\n\n\tpublic void place2d( Transform transform, float ratio ){\n\t\ttransform.position = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f){\n\t\t\tVector3 v3Dir = point( ratio ) - transform.position;\n\t\t\tfloat angle = Mathf.Atan2(v3Dir.y, v3Dir.x) * Mathf.Rad2Deg;\n\t\t\ttransform.eulerAngles = new Vector3(0, 0, angle);\n\t\t}\n\t}\n\n\tpublic void placeLocal2d( Transform transform, float ratio ){\n\t\ttransform.localPosition = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f){\n\t\t\tVector3 v3Dir = transform.parent.TransformPoint( point( ratio ) ) - transform.localPosition;\n\t\t\tfloat angle = Mathf.Atan2(v3Dir.y, v3Dir.x) * Mathf.Rad2Deg;\n\t\t\ttransform.eulerAngles = new Vector3(0, 0, angle);\n\t\t}\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path (facing the direction perpendicular to the path)\n\t* \n\t* @method place\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @example\n\t* ltPath.place( transform, 0.6f );\n\t*/\n\tpublic void place( Transform transform, float ratio ){\n\t\tplace( transform, ratio, Vector3.up );\n\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path, with it facing a certain direction perpendicular to the path\n\t* \n\t* @method place\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @param {Vector3} rotation:Vector3 the direction in which to place the transform ex: Vector3.up\n\t* @example\n\t* ltPath.place( transform, 0.6f, Vector3.left );\n\t*/\n\tpublic void place( Transform transform, float ratio, Vector3 worldUp ){\n\t\ttransform.position = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f)\n\t\t\ttransform.LookAt( point( ratio ), worldUp );\n\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path (facing the direction perpendicular to the path) - Local Space, not world-space\n\t* \n\t* @method placeLocal\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @example\n\t* ltPath.placeLocal( transform, 0.6f );\n\t*/\n\tpublic void placeLocal( Transform transform, float ratio ){\n\t\tplaceLocal( transform, ratio, Vector3.up );\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path, with it facing a certain direction perpendicular to the path - Local Space, not world-space\n\t* \n\t* @method placeLocal\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @param {Vector3} rotation:Vector3 the direction in which to place the transform ex: Vector3.up\n\t* @example\n\t* ltPath.placeLocal( transform, 0.6f, Vector3.left );\n\t*/\n\tpublic void placeLocal( Transform transform, float ratio, Vector3 worldUp ){\n\t\tratio = getRationInOneRange (ratio);\n\t\ttransform.localPosition = point( ratio );\n\t\tratio = getRationInOneRange (ratio + 0.001f);\n\t\tif(ratio<=1.0f)\n\t\t\ttransform.LookAt( transform.parent.TransformPoint( point( ratio ) ), worldUp );\n\t}\n\n\tpublic float getRationInOneRange(float ratio){\n\t\tif (ratio >= 0.0f && ratio <= 1.0f) {\n\t\t\treturn ratio;\n\t\t} else if (ratio < 0.0f) {\n\t\t\treturn Mathf.Ceil(ratio) - ratio;\t//if -1.4 => it returns 0.4\n\t\t} else {\n\t\t\treturn ratio - Mathf.Floor(ratio);\t//if 1.4 => it return 0.4\n\t\t}\n\t}\n\n\tpublic void gizmoDraw(float t = -1.0f)\n    {\n        Vector3 prevPt = point(0);\n\n        for (int i = 1; i <= 120; i++)\n        {\n            float pm = (float)i / 120f;\n            Vector3 currPt2 = point(pm);\n            //Gizmos.color = new Color(UnityEngine.Random.Range(0f,1f),UnityEngine.Random.Range(0f,1f),UnityEngine.Random.Range(0f,1f),1);\n            Gizmos.color = (previousBezier == currentBezier) ? Color.magenta : Color.grey;\n            Gizmos.DrawLine(currPt2, prevPt);\n            prevPt = currPt2;\n            previousBezier = currentBezier;\n        }\n    }\n}\n\n/**\n* Animate along a set of points that need to be in the format: controlPoint, point1, point2.... pointLast, endControlPoint\n* @class LTSpline\n* @constructor\n* @param {Vector3 Array} pts A set of points that define the points the path will pass through (starting with starting control point, and ending with a control point)\n* @example \n* LTSpline ltSpline = new LTSpline( new Vector3[] { new Vector3(0f,0f,0f),new Vector3(0f,0f,0f), new Vector3(0f,0.5f,0f), new Vector3(1f,1f,0f), new Vector3(1f,1f,0f)} );<br><br>\n* LeanTween.moveSpline(lt, ltSpline.vec3, 4.0f).setOrientToPath(true).setDelay(1f).setEase(LeanTweenType.easeInOutQuad); // animate <br>\n* Vector3 pt = ltSpline.point( 0.6f ); // retrieve a point along the path\n*/\n[System.Serializable]\npublic class LTSpline {\n\tpublic static int DISTANCE_COUNT = 30; // increase for a more accurate constant speed\n\tpublic static int SUBLINE_COUNT = 50; // increase for a more accurate smoothing of the curves into lines\n\n\tpublic Vector3[] pts;\n\tpublic Vector3[] ptsAdj;\n\tpublic int ptsAdjLength;\n\tpublic bool orientToPath;\n\tpublic bool orientToPath2d;\n\tprivate int numSections;\n\tprivate int currPt;\n\tprivate float totalLength;\n\t\n\tpublic LTSpline(params Vector3[] pts) {\n\t\t// Debug.Log(\"pts.Length:\"+pts.Length);\n\t\tif(pts.Length<4){\n\t\t\tLeanTween.logError( \"LeanTween - When passing values for a spline path, you must pass four or more values!\" );\n\t\t\treturn;\n\t\t}\n\n\t\tthis.pts = new Vector3[pts.Length];\n\t\tSystem.Array.Copy(pts, this.pts, pts.Length);\n\n\t\tnumSections = pts.Length - 3;\n\n\t\tfloat minSegment = float.PositiveInfinity;\n\t\tVector3 earlierPoint = this.pts[1];\n\t\tfloat totalDistance = 0f;\n\t\tfor(int i=2; i < this.pts.Length-2; i++){\n\t\t\tfloat pointDistance = Vector3.Distance(this.pts[i], earlierPoint);\n\t\t\tif(pointDistance < minSegment){\n\t\t\t\tminSegment = pointDistance;\n\t\t\t}\n\n\t\t\ttotalDistance += pointDistance;\n\t\t}\n\n\t\tfloat minPrecision = minSegment / SUBLINE_COUNT; // number of subdivisions in each segment\n\t\tint precision = (int)Mathf.Ceil(totalDistance / minPrecision) * DISTANCE_COUNT;\n\t\tif(precision<=1) // precision has to be greater than zero\n\t\t\tprecision = 2;\n\n\t\tptsAdj = new Vector3[ precision ];\n\t\tearlierPoint = interp( 0f );\n\t\tint num = 0;\n\t\tfor(int i = 0; i < precision; i++){\n\t\t\tfloat fract = ((float)(i+1f)) / precision;\n\t\t\tVector3 point = interp( fract );\n\t\t\tfloat dist = Vector3.Distance(point, earlierPoint);\n\t\t\tif(dist>=minPrecision){\n\t\t\t\tptsAdj[num] = point;\n\n\t\t\t\tearlierPoint = point;\n\t\t\t\t// Debug.Log(\"fract:\"+fract+\" point:\"+point);\n\t\t\t\tnum++;\n\t\t\t}\n\t\t}\n\t\t// make sure there is a point at the very end\n\t\t/*num++;\n\t\tVector3 endPoint = interp( 1f );\n\t\tptsAdj[num] = endPoint;*/\n\t\t// Debug.Log(\"fract 1f endPoint:\"+endPoint);\n\n\t\tptsAdjLength = num;\n\t\t// Debug.Log(\"map 1f:\"+map(1f)+\" end:\"+ptsAdj[ ptsAdjLength-1 ]);\n\n\t\t// Debug.Log(\"ptsAdjLength:\"+ptsAdjLength+\" minPrecision:\"+minPrecision+\" precision:\"+precision);\n\n\t}\n\n\tpublic Vector3 map( float u ){\n\t\tif(u>=1f)\n\t\t\treturn pts[ pts.Length - 2];\n\t\tfloat t = u * (ptsAdjLength-1);\n\t\tint first = (int)Mathf.Floor( t );\n\t\tint next = (int)Mathf.Ceil( t );\n\n\t\tif(first<0)\n\t\t\tfirst = 0;\n\n\t\tVector3 val = ptsAdj[ first ];\n\n\n\t\tVector3 nextVal = ptsAdj[ next ];\n\t\tfloat diff = t - first;\n\n\t\t// Debug.Log(\"u:\"+u+\" val:\"+val +\" nextVal:\"+nextVal+\" diff:\"+diff+\" first:\"+first+\" next:\"+next);\n\n\t\tval = val + (nextVal - val) * diff;\n\n\t\treturn val;\n\t}\n\t\n\tpublic Vector3 interp(float t) {\n\t\tcurrPt = Mathf.Min(Mathf.FloorToInt(t * (float) numSections), numSections - 1);\n\t\tfloat u = t * (float) numSections - (float) currPt;\n\t\t\t\t\n\t\t//Debug.Log(\"currPt:\"+currPt+\" numSections:\"+numSections+\" pts.Length :\"+pts.Length );\n\t\tVector3 a = pts[currPt];\n\t\tVector3 b = pts[currPt + 1];\n\t\tVector3 c = pts[currPt + 2];\n\t\tVector3 d = pts[currPt + 3];\n\t\t\n\t\treturn .5f * (\n\t\t\t(-a + 3f * b - 3f * c + d) * (u * u * u)\n\t\t\t+ (2f * a - 5f * b + 4f * c - d) * (u * u)\n\t\t\t+ (-a + c) * u\n\t\t\t+ 2f * b\n\t\t);\n\t}\n\n\t/**\n\t* Retrieve a point along a path\n\t* \n\t* @method point\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @return {Vector3} Vector3 position of the point along the path\n\t* @example\n\t* transform.position = ltSpline.point( 0.6f );\n\t*/\n\tpublic Vector3 point( float ratio ){\n\t\tfloat t = ratio>1f?1f:ratio;\n\n\t\treturn map(t);\n\t}\n\n\tpublic void place2d( Transform transform, float ratio ){\n\t\ttransform.position = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f){\n\t\t\tVector3 v3Dir = point( ratio ) - transform.position;\n\t\t\tfloat angle = Mathf.Atan2(v3Dir.y, v3Dir.x) * Mathf.Rad2Deg;\n\t\t\ttransform.eulerAngles = new Vector3(0, 0, angle);\n\t\t}\n\t}\n\n\tpublic void placeLocal2d( Transform transform, float ratio ){\n\t\ttransform.localPosition = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f){\n\t\t\tVector3 v3Dir = transform.parent.TransformPoint( point( ratio ) ) - transform.localPosition;\n\t\t\tfloat angle = Mathf.Atan2(v3Dir.y, v3Dir.x) * Mathf.Rad2Deg;\n\t\t\ttransform.eulerAngles = new Vector3(0, 0, angle);\n\t\t}\n\t}\n\n\n\t/**\n\t* Place an object along a certain point on the path (facing the direction perpendicular to the path)\n\t* \n\t* @method place\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @example\n\t* ltPath.place( transform, 0.6f );\n\t*/\n\tpublic void place( Transform transform, float ratio ){\n\t\tplace(transform, ratio, Vector3.up);\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path, with it facing a certain direction perpendicular to the path\n\t* \n\t* @method place\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @param {Vector3} rotation:Vector3 the direction in which to place the transform ex: Vector3.up\n\t* @example\n\t* ltPath.place( transform, 0.6f, Vector3.left );\n\t*/\n\tpublic void place( Transform transform, float ratio, Vector3 worldUp ){\n\t\ttransform.position = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f)\n\t\t\ttransform.LookAt( point( ratio ), worldUp );\n\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path (facing the direction perpendicular to the path) - Local Space, not world-space\n\t* \n\t* @method placeLocal\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @example\n\t* ltPath.placeLocal( transform, 0.6f );\n\t*/\n\tpublic void placeLocal( Transform transform, float ratio ){\n\t\tplaceLocal( transform, ratio, Vector3.up );\n\t}\n\n\t/**\n\t* Place an object along a certain point on the path, with it facing a certain direction perpendicular to the path - Local Space, not world-space\n\t* \n\t* @method placeLocal\n\t* @param {Transform} transform:Transform the transform of the object you wish to place along the path\n\t* @param {float} ratio:float ratio of the point along the path you wish to receive (0-1)\n\t* @param {Vector3} rotation:Vector3 the direction in which to place the transform ex: Vector3.up\n\t* @example\n\t* ltPath.placeLocal( transform, 0.6f, Vector3.left );\n\t*/\n\tpublic void placeLocal( Transform transform, float ratio, Vector3 worldUp ){\n\t\ttransform.localPosition = point( ratio );\n\t\tratio += 0.001f;\n\t\tif(ratio<=1.0f)\n\t\t\ttransform.LookAt( transform.parent.TransformPoint( point( ratio ) ), worldUp );\n\t}\n\t\n\tpublic void gizmoDraw(float t = -1.0f) {\n\t\t\n\t\t\tVector3 prevPt = point(0);\n\t\t\t\n\t\t\tfor (int i = 1; i <= 120; i++) {\n\t\t\t\tfloat pm = (float) i / 120f;\n\t\t\t\tVector3 currPt2 = point(pm);\n\t\t\t\t//Gizmos.color = new Color(UnityEngine.Random.Range(0f,1f),UnityEngine.Random.Range(0f,1f),UnityEngine.Random.Range(0f,1f),1);\n\t\t\t\tGizmos.DrawLine(currPt2, prevPt);\n\t\t\t\tprevPt = currPt2;\n\t\t\t}\n\t\n\t}\n\n\t/*public Vector3 Velocity(float t) {\n\t\tt = map( t );\n\n\t\tint numSections = pts.Length - 3;\n\t\tint currPt = Mathf.Min(Mathf.FloorToInt(t * (float) numSections), numSections - 1);\n\t\tfloat u = t * (float) numSections - (float) currPt;\n\t\t\t\t\n\t\tVector3 a = pts[currPt];\n\t\tVector3 b = pts[currPt + 1];\n\t\tVector3 c = pts[currPt + 2];\n\t\tVector3 d = pts[currPt + 3];\n\n\t\treturn 1.5f * (-a + 3f * b - 3f * c + d) * (u * u)\n\t\t\t\t+ (2f * a -5f * b + 4f * c - d) * u\n\t\t\t\t+ .5f * c - .5f * a;\n\t}*/\n}\n\n/**\n* Animate GUI Elements by creating this object and passing the *.rect variable to the GUI method<br><br>\n* <strong>Example Javascript: </strong><br>var bRect:LTRect = new LTRect( 0, 0, 100, 50 );<br>\n* LeanTween.scale( bRect, Vector2(bRect.rect.width, bRect.rect.height) * 1.3, 0.25 );<br>\n* function OnGUI(){<br>\n* &nbsp; if(GUI.Button(bRect.rect, \"Scale\")){ }<br>\n* }<br>\n* <br>\n* <strong>Example C#: </strong> <br>\n* LTRect bRect = new LTRect( 0f, 0f, 100f, 50f );<br>\n* LeanTween.scale( bRect, new Vector2(150f,75f), 0.25f );<br>\n* void OnGUI(){<br>\n* &nbsp; if(GUI.Button(bRect.rect, \"Scale\")){ }<br>\n* }<br>\n*\n* @class LTRect\n* @constructor\n* @param {float} x:float X location\n* @param {float} y:float Y location\n* @param {float} width:float Width\n* @param {float} height:float Height\n* @param {float} alpha:float (Optional) initial alpha amount (0-1)\n* @param {float} rotation:float (Optional) initial rotation in degrees (0-360) \n*/\n\n[System.Serializable]\npublic class LTRect : System.Object{\n\t/**\n\t* Pass this value to the GUI Methods\n\t* \n\t* @property rect\n\t* @type {Rect} rect:Rect Rect object that controls the positioning and size\n\t*/\n\tpublic Rect _rect;\n\tpublic float alpha = 1f;\n\tpublic float rotation;\n\tpublic Vector2 pivot;\n\tpublic Vector2 margin;\n\tpublic Rect relativeRect = new Rect(0f,0f,float.PositiveInfinity,float.PositiveInfinity);\n\n\tpublic bool rotateEnabled;\n\t[HideInInspector]\n\tpublic bool rotateFinished;\n\tpublic bool alphaEnabled;\n\tpublic string labelStr;\n\tpublic LTGUI.Element_Type type;\n\tpublic GUIStyle style;\n\tpublic bool useColor = false;\n\tpublic Color color = Color.white;\n\tpublic bool fontScaleToFit;\n\tpublic bool useSimpleScale;\n\tpublic bool sizeByHeight;\n\n\tpublic Texture texture;\n\n\tprivate int _id = -1;\n\t[HideInInspector]\n\tpublic int counter;\n\n\tpublic static bool colorTouched;\n\n\tpublic LTRect(){\n\t\treset();\n\t\tthis.rotateEnabled = this.alphaEnabled = true;\n\t\t_rect = new Rect(0f,0f,1f,1f);\n\t}\n\n\tpublic LTRect(Rect rect){\n\t\t_rect = rect;\n\t\treset();\n\t}\n\n\tpublic LTRect(float x, float y, float width, float height){\n\t\t_rect = new Rect(x,y,width,height);\n\t\tthis.alpha = 1.0f;\n\t\tthis.rotation = 0.0f;\n\t\tthis.rotateEnabled = this.alphaEnabled = false;\n\t}\n\n\tpublic LTRect(float x, float y, float width, float height, float alpha){\n\t\t_rect = new Rect(x,y,width,height);\n\t\tthis.alpha = alpha;\n\t\tthis.rotation = 0.0f;\n\t\tthis.rotateEnabled = this.alphaEnabled = false;\n\t}\n\n\tpublic LTRect(float x, float y, float width, float height, float alpha, float rotation){\n\t\t_rect = new Rect(x,y,width,height);\n\t\tthis.alpha = alpha;\n\t\tthis.rotation = rotation;\n\t\tthis.rotateEnabled = this.alphaEnabled = false;\n\t\tif(rotation!=0.0f){\n\t\t\tthis.rotateEnabled = true;\n\t\t\tresetForRotation();\n\t\t}\n\t}\n\n\tpublic bool hasInitiliazed{\n\t\tget{ \n\t\t\treturn _id!=-1;\n\t\t}\n\t}\n\n\tpublic int id{\n\t\tget{ \n\t\t\tint toId = _id | counter << 16;\n\n\t\t\t/*uint backId = toId & 0xFFFF;\n\t\t\tuint backCounter = toId >> 16;\n\t\t\tif(_id!=backId || backCounter!=counter){\n\t\t\t\tDebug.LogError(\"BAD CONVERSION toId:\"+_id);\n\t\t\t}*/\n\n\t\t\treturn toId;\n\t\t}\n\t} \n\n\tpublic void setId( int id, int counter){\n\t\tthis._id = id;\n\t\tthis.counter = counter;\n\t}\n\n\tpublic void reset(){\n\t\tthis.alpha = 1.0f;\n\t\tthis.rotation = 0.0f;\n\t\tthis.rotateEnabled = this.alphaEnabled = false;\n\t\tthis.margin = Vector2.zero;\n\t\tthis.sizeByHeight = false;\n\t\tthis.useColor = false;\n\t}\n\n\tpublic void resetForRotation(){\n\t\tVector3 scale = new Vector3(GUI.matrix[0,0], GUI.matrix[1,1], GUI.matrix[2,2]);\n        if(pivot==Vector2.zero){\n            pivot = new Vector2((_rect.x+((_rect.width)*0.5f )) * scale.x + GUI.matrix[0,3], (_rect.y+((_rect.height)*0.5f )) * scale.y + GUI.matrix[1,3]);\n        }\n\t}\n\n\tpublic float x{\n\t\tget{ return _rect.x; }\n\t\tset{ _rect.x = value; }\n\t}\n\n\tpublic float y{\n\t\tget{ return _rect.y; }\n\t\tset{ _rect.y = value; }\n\t}\n\n\tpublic float width{\n\t\tget{ return _rect.width; }\n\t\tset{ _rect.width = value; }\n\t}\n\n\tpublic float height{\n\t\tget{ return _rect.height; }\n\t\tset{ _rect.height = value; }\n\t}\n\n\tpublic Rect rect{\n\n\t\tget{\n\t\t\tif(colorTouched){\n\t\t\t\tcolorTouched = false;\n\t\t\t\tGUI.color = new Color(GUI.color.r,GUI.color.g,GUI.color.b,1.0f);\n\t\t\t}\n\t\t\tif(rotateEnabled){\n\t\t\t\t if(rotateFinished){\n                    rotateFinished = false;\n                    rotateEnabled = false;\n                    //this.rotation = 0.0f;\n                    pivot = Vector2.zero;\n                }else{\n                    GUIUtility.RotateAroundPivot(rotation, pivot);\n                }\n\t\t\t}\n\t\t\tif(alphaEnabled){\n\t\t\t\tGUI.color = new Color(GUI.color.r,GUI.color.g,GUI.color.b,alpha);\n\t\t\t\tcolorTouched = true;\n\t\t\t}\n\t\t\tif(fontScaleToFit){\n\t\t\t\tif(this.useSimpleScale){\n\t\t\t\t\tstyle.fontSize = (int)(_rect.height*this.relativeRect.height);\n\t\t\t\t}else{\n\t\t\t\t\tstyle.fontSize = (int)_rect.height;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn _rect;\n\t\t}\n\n\t\tset{\n\t\t\t_rect = value;\n\t\t}\t\n\t}\n\n\tpublic LTRect setStyle( GUIStyle style ){\n\t\tthis.style = style;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setFontScaleToFit( bool fontScaleToFit ){\n\t\tthis.fontScaleToFit = fontScaleToFit;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setColor( Color color ){\n\t\tthis.color = color;\n\t\tthis.useColor = true;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setAlpha( float alpha ){\n\t\tthis.alpha = alpha;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setLabel( String str ){\n\t\tthis.labelStr = str;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setUseSimpleScale( bool useSimpleScale, Rect relativeRect){\n\t\tthis.useSimpleScale = useSimpleScale;\n\t\tthis.relativeRect = relativeRect;\n\t\treturn this;\n\t}\n\n\tpublic LTRect setUseSimpleScale( bool useSimpleScale){\n\t\tthis.useSimpleScale = useSimpleScale;\n\t\tthis.relativeRect = new Rect(0f,0f,Screen.width,Screen.height);\n\t\treturn this;\n\t}\n\n\tpublic LTRect setSizeByHeight( bool sizeByHeight){\n\t\tthis.sizeByHeight = sizeByHeight;\n\t\treturn this;\n\t}\n\n\tpublic override string ToString(){\n\t\treturn \"x:\"+_rect.x+\" y:\"+_rect.y+\" width:\"+_rect.width+\" height:\"+_rect.height;\n\t}\n}\n\n/**\n* Object that describes the event to an event listener\n* @class LTEvent\n* @constructor\n* @param {object} data:object Data that has been passed from the dispatchEvent method\n*/\npublic class LTEvent {\n\tpublic int id;\n\tpublic object data;\n\n\tpublic LTEvent(int id, object data){\n\t\tthis.id = id;\n\t\tthis.data = data;\n\t}\n}\n\npublic class LTGUI {\n\tpublic static int RECT_LEVELS = 5;\n\tpublic static int RECTS_PER_LEVEL = 10;\n\tpublic static int BUTTONS_MAX = 24;\n\n\tprivate static LTRect[] levels;\n\tprivate static int[] levelDepths;\n\tprivate static Rect[] buttons;\n\tprivate static int[] buttonLevels;\n\tprivate static int[] buttonLastFrame;\n\tprivate static LTRect r;\n\tprivate static Color color = Color.white;\n\tprivate static bool isGUIEnabled = false;\n\tprivate static int global_counter = 0;\n\n\tpublic enum Element_Type{\n\t\tTexture,\n\t\tLabel\n\t}\n\n\tpublic static void init(){\n\t\tif(levels==null){\n\t\t\tlevels = new LTRect[RECT_LEVELS*RECTS_PER_LEVEL];\n\t\t\tlevelDepths = new int[RECT_LEVELS];\n\t\t}\n\t}\n\n\tpublic static void initRectCheck(){\n\t\tif(buttons==null){\n\t\t\tbuttons = new Rect[BUTTONS_MAX];\n\t\t\tbuttonLevels = new int[BUTTONS_MAX];\n\t\t\tbuttonLastFrame = new int[BUTTONS_MAX];\n\t\t\tfor(int i = 0; i < buttonLevels.Length; i++){\n\t\t\t\tbuttonLevels[i] = -1;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void reset(){\n\t\tif(isGUIEnabled){\n\t\t\tisGUIEnabled = false;\n\t\t\tfor(int i = 0; i < levels.Length; i++){\n\t\t\t\tlevels[i] = null;\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < levelDepths.Length; i++){\n\t\t\t\tlevelDepths[i] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static void update( int updateLevel ){\n\t\tif(isGUIEnabled){\n\t\t\tinit();\n\t\t\tif(levelDepths[updateLevel]>0){\n\t\t\t\tcolor = GUI.color;\n\t\t\t\tint baseI = updateLevel*RECTS_PER_LEVEL;\n\t\t\t\tint maxLoop = baseI + levelDepths[updateLevel];// RECTS_PER_LEVEL;//;\n\t\t\t\t\n\t\t\t\tfor(int i = baseI; i < maxLoop; i++){\n\t\t\t\t\tr = levels[i];\n\t\t\t\t\t// Debug.Log(\"r:\"+r+\" i:\"+i);\n\t\t\t\t\tif(r!=null /*&& checkOnScreen(r.rect)*/){\n\t\t\t\t\t\t//Debug.Log(\"label:\"+r.labelStr+\" textColor:\"+r.style.normal.textColor);\n\t\t\t\t\t\tif(r.useColor)\n\t\t\t\t\t\t\tGUI.color = r.color;\n\t\t\t\t\t\tif(r.type == Element_Type.Label){\n\t\t\t\t\t\t\tif(r.style!=null)\n\t\t\t\t\t\t\t\tGUI.skin.label = r.style;\n\t\t\t\t\t\t\tif(r.useSimpleScale){\n\t\t\t\t\t\t\t\tGUI.Label( new Rect((r.rect.x + r.margin.x + r.relativeRect.x)*r.relativeRect.width, (r.rect.y + r.margin.y + r.relativeRect.y)*r.relativeRect.height, r.rect.width*r.relativeRect.width, r.rect.height*r.relativeRect.height), r.labelStr );\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tGUI.Label( new Rect(r.rect.x + r.margin.x, r.rect.y + r.margin.y, r.rect.width, r.rect.height), r.labelStr );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else if(r.type == Element_Type.Texture && r.texture!=null){\n\t\t\t\t\t\t\tVector2 size = r.useSimpleScale ? new Vector2(0f, r.rect.height*r.relativeRect.height) : new Vector2(r.rect.width, r.rect.height);\n\t\t\t\t\t\t\tif(r.sizeByHeight){\n\t\t\t\t\t\t\t\tsize.x = (float)r.texture.width/(float)r.texture.height * size.y;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(r.useSimpleScale){\n\t\t\t\t\t\t\t\tGUI.DrawTexture( new Rect((r.rect.x + r.margin.x + r.relativeRect.x)*r.relativeRect.width, (r.rect.y + r.margin.y + r.relativeRect.y)*r.relativeRect.height, size.x, size.y), r.texture );\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tGUI.DrawTexture( new Rect(r.rect.x + r.margin.x, r.rect.y + r.margin.y, size.x, size.y), r.texture );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tGUI.color = color;\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic static bool checkOnScreen(Rect rect){\n\t\tbool offLeft = rect.x + rect.width < 0f;\n\t\tbool offRight = rect.x > Screen.width;\n\t\tbool offBottom = rect.y > Screen.height;\n\t\tbool offTop = rect.y + rect.height < 0f;\n\n\t\treturn !(offLeft || offRight || offBottom || offTop);\n\t}\n\n\tpublic static void destroy( int id ){\n\t\tint backId = id & 0xFFFF;\n\t\tint backCounter = id >> 16;\n\t\tif(id>=0 && levels[backId]!=null && levels[backId].hasInitiliazed && levels[backId].counter==backCounter)\n\t\t\tlevels[backId] = null;\n\t}\n\n\tpublic static void destroyAll( int depth ){ // clears all gui elements on depth\n\t\tint maxLoop = depth*RECTS_PER_LEVEL + RECTS_PER_LEVEL;\n\t\tfor(int i = depth*RECTS_PER_LEVEL; levels!=null && i < maxLoop; i++){\n\t\t\tlevels[i] = null;\n\t\t}\n\t}\n\n\tpublic static LTRect label( Rect rect, string label, int depth){\n\t\treturn LTGUI.label(new LTRect(rect), label, depth);\n\t}\n\n\tpublic static LTRect label( LTRect rect, string label, int depth){\n\t\trect.type = Element_Type.Label;\n\t\trect.labelStr = label;\n\t\treturn element(rect, depth);\n\t}\n\n\tpublic static LTRect texture( Rect rect, Texture texture, int depth){\n\t\treturn LTGUI.texture( new LTRect(rect), texture, depth);\n\t}\n\n\tpublic static LTRect texture( LTRect rect, Texture texture, int depth){\n\t\trect.type = Element_Type.Texture;\n\t\trect.texture = texture;\n\t\treturn element(rect, depth);\n\t}\n\n\tpublic static LTRect element( LTRect rect, int depth){\n\t\tisGUIEnabled = true;\n\t\tinit();\n\t\tint maxLoop = depth*RECTS_PER_LEVEL + RECTS_PER_LEVEL;\n\t\tint k = 0;\n\t\tif(rect!=null){\n\t\t\tdestroy(rect.id);\n\t\t}\n\t\tif(rect.type==LTGUI.Element_Type.Label && rect.style!=null){\n\t\t\tif(rect.style.normal.textColor.a<=0f){\n\t\t\t\tDebug.LogWarning(\"Your GUI normal color has an alpha of zero, and will not be rendered.\");\n\t\t\t}\n\t\t}\n\t\tif(rect.relativeRect.width==float.PositiveInfinity){\n\t\t\trect.relativeRect = new Rect(0f,0f,Screen.width,Screen.height);\n\t\t}\n\t\tfor(int i = depth*RECTS_PER_LEVEL; i < maxLoop; i++){\n\t\t\tr = levels[i];\n\t\t\tif(r==null){\n\t\t\t\tr = rect;\n\t\t\t\tr.rotateEnabled = true;\n\t\t\t\tr.alphaEnabled = true;\n\t\t\t\tr.setId( i, global_counter );\n\t\t\t\tlevels[i] = r;\n\t\t\t\t// Debug.Log(\"k:\"+k+ \" maxDepth:\"+levelDepths[depth]);\n\t\t\t\tif(k>=levelDepths[depth]){\n\t\t\t\t\tlevelDepths[depth] = k + 1;\n\t\t\t\t}\n\t\t\t\tglobal_counter++;\n\t\t\t\treturn r;\n\t\t\t}\n\t\t\tk++;\n\t\t}\n\n\t\tDebug.LogError(\"You ran out of GUI Element spaces\");\n\n\t\treturn null;\n\t}\n\n\tpublic static bool hasNoOverlap( Rect rect, int depth ){\n\t\tinitRectCheck();\n\t\tbool hasNoOverlap = true;\n\t\tbool wasAddedToList = false;\n\t\tfor(int i = 0; i < buttonLevels.Length; i++){\n\t\t\t// Debug.Log(\"buttonLastFrame[\"+i+\"]:\"+buttonLastFrame[i]);\n\t\t\t//Debug.Log(\"buttonLevels[\"+i+\"]:\"+buttonLevels[i]);\n\t\t\tif(buttonLevels[i]>=0){\n\t\t\t\t//Debug.Log(\"buttonLastFrame[\"+i+\"]:\"+buttonLastFrame[i]+\" Time.frameCount:\"+Time.frameCount);\n\t\t\t\tif( buttonLastFrame[i] + 1 < Time.frameCount ){ // It has to have been visible within the current, or\n\t\t\t\t\tbuttonLevels[i] = -1;\n\t\t\t\t\t// Debug.Log(\"resetting i:\"+i);\n\t\t\t\t}else{\n\t\t\t\t\t//if(buttonLevels[i]>=0)\n\t\t\t\t\t//\t Debug.Log(\"buttonLevels[\"+i+\"]:\"+buttonLevels[i]);\n\t\t\t\t\tif(buttonLevels[i]>depth){\n\t\t\t\t\t\t/*if(firstTouch().x > 0){\n\t\t\t\t\t\t\tDebug.Log(\"buttons[\"+i+\"]:\"+buttons[i] + \" firstTouch:\");\n\t\t\t\t\t\t\tDebug.Log(firstTouch());\n\t\t\t\t\t\t\tDebug.Log(buttonLevels[i]);\n\t\t\t\t\t\t}*/\n\t\t\t\t\t\tif(pressedWithinRect( buttons[i] )){\n\t\t\t\t\t\t\thasNoOverlap = false; // there is an overlapping button that is higher\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(wasAddedToList==false && buttonLevels[i]<0){\n\t\t\t\twasAddedToList = true;\n\t\t\t\tbuttonLevels[i] = depth;\n\t\t\t\tbuttons[i] = rect;\n\t\t\t\tbuttonLastFrame[i] = Time.frameCount;\n\t\t\t}\n\t\t}\n\n\t\treturn hasNoOverlap;\n\t}\n\n\tpublic static bool pressedWithinRect( Rect rect ){\n\t\tVector2 vec2 = firstTouch();\n\t\tif(vec2.x<0f)\n\t\t\treturn false;\n\t\tfloat vecY = Screen.height-vec2.y;\n\t\treturn (vec2.x > rect.x && vec2.x < rect.x + rect.width && vecY > rect.y && vecY < rect.y + rect.height);\n\t}\n\n\tpublic static bool checkWithinRect(Vector2 vec2, Rect rect){\n\t\tvec2.y = Screen.height-vec2.y;\n\t\treturn (vec2.x > rect.x && vec2.x < rect.x + rect.width && vec2.y > rect.y && vec2.y < rect.y + rect.height);\n\t}\n\n\tpublic static Vector2 firstTouch(){\n\t\tif(Input.touchCount>0){\n\t\t\treturn Input.touches[0].position;\n\t\t}else if(Input.GetMouseButton(0)){\n\t\t\treturn Input.mousePosition;\n\t\t}\n\n\t\treturn new Vector2(Mathf.NegativeInfinity,Mathf.NegativeInfinity);\n\t}\n\n}\n"
  },
  {
    "path": "Assets/Plugins/LeanTween.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 45490621455f70b47921798fdaa0c6dc\ntimeCreated: 1494228456\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/ByteArray.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n\tusing System;\n\n\tpublic class ByteArray\n\t{\n\t\tstatic void ReAlloc (ref byte[] ba, int pos, int size)\n\t\t{\n\t\t\tif (ba.Length < (pos + size)) {\n\t\t\t\tArray.Resize<byte> (ref ba, (int)(ba.Length + size + 1024));\n\t\t\t}\n\t\t}\n\n\t\tprivate byte[] data_;\n\t\tprivate int pos_;\n\n\t\tpublic ByteArray() {\n\t\t\tdata_ = new byte[32];\n\t\t\tpos_ = 0;\n\t\t}\n\n\t\tpublic ByteArray(byte[] data) {\n\t\t\tSetData (data);\n\t\t}\n\n\t\tpublic void SetData (byte[] data)\n\t\t{\n\t\t\tdata_ = data;\n\t\t\tpos_ = 0;\n\t\t}\n\n\t\tpublic void SetData (byte[] data, int len, int pos)\n\t\t{\n\t\t\tdata_ = data;\n\t\t\tpos_ = pos;\n\t\t}\n\n\t\tpublic void Clear ()\n\t\t{\n\t\t\tpos_ = 0;\n\t\t}\n\n\t\tpublic int Length {\n\t\t\tget {\n\t\t\t\treturn data_.Length;\n\t\t\t}\n\t\t}\n\n\t\tpublic int Position {\n\t\t\tget {\n\t\t\t\treturn pos_;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tpos_ = value;\n\t\t\t}\n\t\t}\n\n\t\tpublic byte[] GetData ()\n\t\t{\n\t\t\treturn data_;\n\t\t}\n\n\t\tpublic bool ReadBool ()\n\t\t{\n\t\t\treturn (ReadByte () == 1 ? true : false);\n\t\t}\n\n\t\tpublic int ReadInt ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 4;\n\t\t\treturn BitConverter.ToInt32 (data_, oldPos);\n\t\t}\n\n\t\tpublic uint ReadUInt ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 4;\n\t\t\treturn BitConverter.ToUInt32 (data_, oldPos);\n\t\t}\n\n\t\tpublic sbyte ReadChar ()\n\t\t{\n\t\t\treturn ReadSByte ();\n\t\t}\n\n\t\tpublic byte ReadUChar ()\n\t\t{\n\t\t\treturn ReadByte ();\n\t\t}\n\n\t\tpublic byte ReadByte ()\n\t\t{\n\t\t\treturn data_ [pos_++];\n\t\t}\n\n\t\tpublic void Read (ref byte[] arr)\n\t\t{        \n\t\t\tfor (int i = 0; i < arr.Length; ++i) {\n\t\t\t\tarr [i] = data_ [pos_++];\n\t\t\t}\n\t\t}\n\n\t\tpublic sbyte ReadSByte ()\n\t\t{\n\t\t\tif (data_ [pos_] > 127)\n\t\t\t\treturn (sbyte)(data_ [pos_++] - 256);\n\t\t\telse\n\t\t\t\treturn (sbyte)(data_ [pos_++]);\n\t\t}\n\n\t\tpublic short ReadShort ()\n\t\t{\n\t\t\treturn ReadInt16 ();\n\t\t}\n\n\t\tpublic ushort ReadUShort ()\n\t\t{\n\t\t\treturn ReadUInt16 ();\n\t\t}\n\n\t\tpublic short ReadInt16 ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 2;\n\t\t\treturn BitConverter.ToInt16 (data_, oldPos);\n\t\t\t;\n\t\t}\n\n\t\tpublic ushort ReadUInt16 ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 2;\n\t\t\treturn BitConverter.ToUInt16 (data_, oldPos);\n\t\t}\n\n\t\tpublic Int64 ReadInt64 ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 8;\n\t\t\treturn BitConverter.ToInt64 (data_, oldPos);\n\t\t}\n\n\t\tpublic float ReadFloat ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 4;\n\t\t\treturn BitConverter.ToSingle (data_, oldPos);\n\t\t}\n\n\t\tpublic double ReadDouble ()\n\t\t{\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += 8;\n\t\t\treturn BitConverter.ToDouble (data_, oldPos);\n\t\t}\n\n\t\tpublic string ReadString ()\n\t\t{\n\t\t\tint len = (int)ReadVarInt ();\n\t\t\tint oldPos = pos_;\n\t\t\tpos_ += len;\n\t\t\treturn System.Text.UTF8Encoding.UTF8.GetString (data_, oldPos, len);\n\t\t}\n\n\t\tpublic void WriteByteArray (ByteArray v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void WriteBool (bool v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void WriteInt (int v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (ByteArray v)\n\t\t{\n\t\t\tif (v != null) {\n\t\t\t\tReAlloc (ref data_, pos_, v.Position);\n\t\t\t\tbyte[] arr = v.GetData ();\n\t\t\t\tarr.CopyTo (data_, pos_);\n\t\t\t}\n\t\t}\n\n\t\tpublic void Write (bool v)\n\t\t{\n\t\t\tWrite (Convert.ToByte (v));\n\t\t}\n\n\t\tpublic void Write (int v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 4);\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t\tpos_ += 4;\n\t\t}\n\n\t\tpublic void Write (uint v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 4);\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t\tpos_ += 4;\n\t\t}\n\n\t\tpublic void WriteUInt (uint v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (char v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 1);\n\t\t\tdata_ [pos_] = (byte)v;\n\t\t\tpos_++;\n\t\t}\n\n\t\tpublic void WriteChar (sbyte v)\n\t\t{\n\t\t\tWriteSByte (v);\n\t\t}\n\n\t\tpublic void Write (byte[] arr)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, arr.Length);\n\t\t\tforeach (byte v in arr) {\n\t\t\t\tdata_ [pos_++] = v;\n\t\t\t}\n\t\t}\n\n\t\tpublic void Write (byte v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 1);\n\t\t\tdata_ [pos_] = v;\n\t\t\tpos_++;\n\t\t}\n\n\t\tpublic void WriteByte (byte v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void WriteUChar (byte v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (sbyte v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 1);\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t\tpos_++;\n\t\t}\n\n\t\tpublic void WriteSByte (sbyte v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (short v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 2);\n\t\t\tdata_ [pos_] = (byte)(v & 0xff);\n\t\t\tpos_++;\n\t\t\tdata_ [pos_] = (byte)(v >> 8);\n\t\t\tpos_++;\n\t\t}\n\n\t\tpublic void Write (ushort v)\n\t\t{\n\t\t\tWrite ((short)v);\n\t\t}\n\n\t\tpublic void WriteUShort (ushort v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void WriteShort (short v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (float v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 4);\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t\tpos_ += 4;\n\t\t}\n\n\t\tpublic void WriteFloat (float v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (double v)\n\t\t{\n\t\t\tReAlloc (ref data_, pos_, 8);\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t\tpos_ += 8;\n\t\t}\n\n\t\tpublic void WriteNum (double v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void Write (string v)\n\t\t{\n\t\t\tbyte[] bytes = System.Text.Encoding.UTF8.GetBytes (v);\n\t\t\tint len = bytes.Length;\n\t\t\tWriteVarInt (bytes.Length);\n\t\t\tReAlloc (ref data_, pos_, len);\n\t\t\tbytes.CopyTo (data_, pos_);\n\t\t\tpos_ += len;\n\t\t}\n\n\t\tpublic void WriteString (string v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic void WriteUInt (uint v, int pos)\n\t\t{\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos);\n\t\t}\n\n\t\tpublic void Write (Int64 v)\n\t\t{\n\t\t\tBitConverter.GetBytes (v).CopyTo (data_, pos_);\n\t\t}\n\n\t\tpublic void WriteInt64 (Int64 v)\n\t\t{\n\t\t\tWrite (v);\n\t\t}\n\n\t\tpublic Int64 ReadVarInt ()\n\t\t{\n\t\t\tbyte ch = ReadByte ();\n\t\t\tInt64 v = ch & 0x7f;\n\t\t\tint shift = 7;\n\t\t\twhile ((ch & 0x80) > 0 && pos_<data_.Length-1) {\n\t\t\t\tch = ReadByte ();\n\t\t\t\tv |= (((Int64)(ch & 0x7f)) << shift);\n\t\t\t\tshift += 7;\n\t\t\t}\n\n\t\t\treturn v;\n\t\t}\n\n\t\tpublic void WriteVarInt (Int64 v)\n\t\t{\n\t\t\tUInt64 uv = (UInt64)v;\n\t\t\twhile (uv >= 0x80) {\n\t\t\t\tWriteByte ((byte)(uv | 0x80));\n\t\t\t\tuv >>= 7;\n\t\t\t}\n\n\t\t\tWriteByte ((byte)uv);\n\t\t}\n\t}\n}"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/ByteArray.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 434761f202b484faa8edafb8bcaf07d2\ntimeCreated: 1489293723\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Coroutine.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n#if !SLUA_STANDALONE\nnamespace SLua\n{\n\tusing UnityEngine;\n\tusing System.Collections;\n\tusing SLua;\n\tusing System;\n\n\tpublic class LuaCoroutine : LuaObject\n\t{\n\n\t\tstatic MonoBehaviour mb;\n\n\t\tstatic public void reg(IntPtr l, MonoBehaviour m)\n\t\t{\n\t\t\tmb = m;\n\t\t\treg(l, Yieldk, \"UnityEngine\");\n\n\t\t\tstring yield =\n@\"\nlocal Yield = UnityEngine.Yieldk\n\nuCoroutine = uCoroutine or {}\n\nuCoroutine.create = function(x)\n\n\tlocal co = coroutine.create(x)\n\tcoroutine.resume(co)\n\treturn co\n\nend\n\nuCoroutine.yield = function(x)\n\n\tlocal co, ismain = coroutine.running()\n\tif ismain then error('Can not yield in main thread') end\n\n\tif type(x) == 'thread' and coroutine.status(x) ~= 'dead' then\n\t\trepeat\n\t\t\tYield(nil, function() coroutine.resume(co) end)\n\t\t\tcoroutine.yield()\n\t\tuntil coroutine.status(x) == 'dead'\n\telse\n\t\tYield(x, function() coroutine.resume(co) end)\n\t\tcoroutine.yield()\n\tend\n\nend\n\n-- backward compatibility of older versions\nUnityEngine.Yield = uCoroutine.yield\n\";\n\t\t\tLuaState.get(l).doString(yield);\n\t\t}\n\n\t\t[MonoPInvokeCallback(typeof(LuaCSFunction))]\n\t\tstatic public int Yieldk(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tif (LuaDLL.lua_pushthread(l) == 1)\n\t\t\t\t{\n\t\t\t\t\treturn error(l, \"should put Yield call into lua coroutine.\");\n\t\t\t\t}\n\t\t\t\tobject y = checkObj(l, 1);\n\t\t\t\tLuaFunction f;\n\t\t\t\tcheckType(l, 2, out f);\n\n\t\t\t\tmb.StartCoroutine(yieldReturn(y, f));\n\t\t\t\tpushValue(l, true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\tstatic public IEnumerator yieldReturn(object y, LuaFunction f)\n\t\t{\n\t\t\tif (y is IEnumerator)\n\t\t\t\tyield return mb.StartCoroutine((IEnumerator)y);\n\t\t\telse\n\t\t\t\tyield return y;\n\t\t\tf.call();\n\t\t}\n\n\t}\n}\n#endif\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Coroutine.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 4b8788d2fe23d5449963f2c4c5cbc21f\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Helper.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n\tusing System.Collections;\n\tusing System;\n\tusing System.Reflection;\n\n    public class Helper : LuaObject\n\t{\n\n\t\tstatic string classfunc = @\"\nlocal getmetatable = getmetatable\nlocal function Class(base,static,instance)\n\n    local mt = getmetatable(base)\n\n    local class = static or {}\n    setmetatable(class, \n        {\n            __index = base,\n            __call = function(...)\n                local r = mt.__call(...)\n                local ret = instance or {}\n\n                local ins_ret = setmetatable(\n                    {\n                        __base = r,\n                    },\n\n                    {\n                        __index = function(t, k)\n                            local ret_field\n                            ret_field = ret[k]\n                            if nil == ret_field then\n                                ret_field = r[k]\n                            end\n\n                            return ret_field\n                        end,\n\n                        __newindex = function(t,k,v)\n                            if not pcall(function() r[k]=v end) then\n                                rawset(t,k,v)\n                            end\n                        end,\n                    })\n\n                if ret.ctor then\n                    ret.ctor(ins_ret, ...)\n                end\n\n                return ins_ret\n            end,\n        }\n    )\n    return class\nend\nreturn Class\n\";\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int _iter(IntPtr l)\n\t\t{\n\t\t\tobject obj = checkObj(l, LuaDLL.lua_upvalueindex(1));\n\t\t\tIEnumerator it = (IEnumerator)obj;\n\t\t\tif (it.MoveNext())\n\t\t\t{\n\t\t\t\tpushVar(l, it.Current);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (obj is IDisposable)\n\t\t\t\t\t(obj as IDisposable).Dispose();\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int iter(IntPtr l)\n\t\t{\n\t\t\tobject o = checkObj(l, 1);\n\t\t\tif (o is IEnumerable)\n\t\t\t{\n\t\t\t\tIEnumerable e = o as IEnumerable;\n\t\t\t\tIEnumerator iter = e.GetEnumerator();\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushLightObject(l, iter);\n\t\t\t\tLuaDLL.lua_pushcclosure(l, _iter, 1);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\treturn error(l,\"passed in object isn't enumerable\");\n\t\t}\n\n        /// <summary>\n        /// Create standard System.Action\n        /// </summary>\n        /// <param name=\"l\"></param>\n        /// <returns></returns>\n        [MonoPInvokeCallbackAttribute(typeof (LuaCSFunction))]\n        public static int CreateAction(IntPtr l)\n        {\n            try\n            {\n\n                LuaFunction func;\n                checkType(l, 1, out func);\n                var action = new Action(() =>\n                {\n                    func.call();\n\n                });\n                pushValue(l, true);\n                pushVar(l, action);\n                return 2;\n            }\n            catch (Exception e)\n            {\n                return error(l, e);\n            }\n\n        }\n\n        [MonoPInvokeCallbackAttribute(typeof (LuaCSFunction))]\n\t\tstatic public int CreateClass(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tstring cls;\n\t\t\t\tcheckType(l, 1, out cls);\n\t\t\t\tType t = LuaObject.FindType(cls);\n\t\t\t\tif (t == null)\n\t\t\t\t{\n\t\t\t\t\treturn error(l, string.Format(\"Can't find {0} to create\", cls));\n\t\t\t\t}\n\n\t\t\t\tConstructorInfo[] cis = t.GetConstructors();\n\t\t\t\tConstructorInfo target = null;\n\t\t\t\tfor (int n = 0; n < cis.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tConstructorInfo ci = cis[n];\n\t\t\t\t\tif (matchType(l, LuaDLL.lua_gettop(l), 2, ci.GetParameters()))\n\t\t\t\t\t{\n\t\t\t\t\t\ttarget = ci;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (target != null)\n\t\t\t\t{\n\t\t\t\t\tParameterInfo[] pis = target.GetParameters();\n\t\t\t\t\tobject[] args = new object[pis.Length];\n\t\t\t\t\tfor (int n = 0; n < pis.Length; n++)\n\t\t\t\t\t\targs[n] = changeType(checkVar(l, n + 2), pis[n].ParameterType);\n\n\t\t\t\t\tobject ret = target.Invoke(args);\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\tpushVar(l, ret);\n\t\t\t\t\treturn 2;\n\t\t\t\t}\n\t\t\t\tpushValue(l, true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l,e);\n\t\t\t}\n\t\t}\n\n\n\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int GetClass(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tstring cls;\n\t\t\t\tcheckType(l, 1, out cls);\n\t\t\t\tType t = LuaObject.FindType(cls);\n\t\t\t\tif (t == null)\n\t\t\t\t{\n\t\t\t\t\treturn error(l, \"Can't find {0} to create\", cls);\n\t\t\t\t}\n\n\t\t\t\tLuaClassObject co = new LuaClassObject(t);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tLuaObject.pushObject(l,co);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t//convert lua binary string to c# byte[]\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int ToBytes(IntPtr l){\n\t\t\ttry{\n\t\t\t\tbyte[] bytes = null;\n\t\t\t\tcheckBinaryString(l,1,out bytes);\n\t\t\t\tpushValue(l,true);\n\t\t\t\tLuaObject.pushObject(l,bytes);\n\t\t\t\treturn 2;\n\n\t\t\t}catch(System.Exception e){\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public new int ToString(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tobject o = checkObj(l, 1);\n\t\t\t\tif (o == null)\n\t\t\t\t{\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\t\t\treturn 2;\n\t\t\t\t}\n\n\t\t\t\tpushValue(l, true);\n\t\t\t\tif (o is byte[])\n\t\t\t\t{\n\t\t\t\t\tbyte[] b = (byte[])o;\n\t\t\t\t\tLuaDLL.lua_pushlstring(l, b, b.Length);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpushValue(l, o.ToString());\n\t\t\t\t}\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int MakeArray(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType t;\n\t\t\t\tcheckType (l,1,out t);\n\t\t\t\tLuaDLL.luaL_checktype(l, 2, LuaTypes.LUA_TTABLE);\n\t\t\t\tint n = LuaDLL.lua_rawlen(l, 2);\n\t\t\t\tArray array=Array.CreateInstance(t,n);\n\t\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_rawgeti(l, 2, k + 1);\n\t\t\t\t    var obj = checkVar(l, -1);\n\t\t\t\t\tarray.SetValue(changeType(obj, t), k);\n\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t}\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushValue(l, array);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\t\t\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int As(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tif (!isTypeTable(l, 2))\n\t\t\t\t{\n\t\t\t\t\treturn error(l, \"No matched type of param 2\");\n\t\t\t\t}\n\t\t\t\tstring meta = LuaDLL.lua_tostring(l, -1);\n\t\t\t\tLuaDLL.luaL_getmetatable(l, meta);\n\t\t\t\tLuaDLL.lua_setmetatable(l, 1);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tLuaDLL.lua_pushvalue(l, 1);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int IsNull(IntPtr l)\n        {\n\t\t\ttry\n\t\t\t{\n\t\t\t\tLuaTypes t = LuaDLL.lua_type(l, 1);\n\t\t\t\tpushValue(l, true);\n\n\t\t\t\tif (t == LuaTypes.LUA_TNIL)\n\t\t\t\t{\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t}\n\t\t\t\t// LUA_TUSERDATA or LUA_TTABLE(Class inherited from Unity Native)\n\t\t\t\telse if (t == LuaTypes.LUA_TUSERDATA || isLuaClass(l, 1))\n\t\t\t\t{\n\t\t\t\t\tobject o = checkObj(l, 1);\n#if !SLUA_STANDALONE\n\t\t\t\t\tif( o is UnityEngine.Object )\n\t\t\t\t\t{\n\t\t\t\t\t\tpushValue(l, ((UnityEngine.Object)o)==null);\n\t\t\t\t\t}\n\t\t\t\t\telse\n#endif\n\t\t\t\t\t\tpushValue(l, o.Equals(null));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tpushValue(l, false);\n\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n        }\n\n        static LuaOut luaOut = new LuaOut();\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int get_out(IntPtr l)\n        {\n\t\t\tpushValue(l, true);\n            pushLightObject(l, luaOut);\n            return 2;\n        }\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int get_version(IntPtr l)\n\t\t{\n\t\t\tpushValue(l, true);\n\t\t\tpushValue(l, VersionNumber);\n\t\t\treturn 2;\n\t\t}\n\n        static public void reg(IntPtr l)\n\t\t{\n            getTypeTable(l, \"Slua\");\n            addMember(l, CreateAction, false);\n            addMember(l, CreateClass, false);\n            addMember(l, GetClass, false);\n            addMember(l, iter, false);\n            addMember(l, ToString, false);\n            addMember(l, As, false);\n            addMember(l, IsNull, false);\n            addMember(l, MakeArray, false);\n            addMember(l, ToBytes, false);\n            addMember(l, \"out\", get_out, null, false);\n            addMember(l, \"version\", get_version, null, false);\n\n\t\t\tLuaFunction func = LuaState.get(l).doString(classfunc) as LuaFunction;\n\t\t\tfunc.push(l);\n\t\t\tLuaDLL.lua_setfield(l, -3, \"Class\");\n\n\n            createTypeMetatable(l, null, typeof(Helper));\n        }\n    }\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Helper.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 79a808d57285e484caa6df1514a0f3c0\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Logger.cs",
    "content": "\r\n\r\nusing System;\r\n\r\nnamespace SLua\r\n{\r\n\r\n    /// <summary>\r\n    /// A bridge between UnityEngine.Debug.LogXXX and standalone.LogXXX\r\n    /// </summary>\r\n    public class Logger\r\n    {\r\n        public enum Level\r\n        {\r\n            Debug,\r\n            Warning,\r\n            Error\r\n        }\r\n        public static Action<Level, string> LogAction;\r\n#if !SLUA_STANDALONE\r\n        private static UnityEngine.Object FindScriptByMsg(string msg)\r\n        {\r\n#if UNITY_EDITOR\r\n            int idx = msg.IndexOf(\":\");\r\n            if (idx < 0) return null;\r\n            string filename = msg.Substring(0, idx);\r\n            idx = filename.LastIndexOf(\"/\");\r\n            if (idx >= 0) filename = filename.Substring(idx + 1);\r\n            string[] guids = UnityEditor.AssetDatabase.FindAssets(filename);\r\n            filename = filename + \".txt\";\r\n            for (int i = 0; i < guids.Length; i++)\r\n            {\r\n                string path = UnityEditor.AssetDatabase.GUIDToAssetPath(guids[i]);\r\n                if(System.IO.Path.GetFileName(path).Equals(filename))\r\n                {\r\n                    return UnityEditor.AssetDatabase.LoadAssetAtPath<UnityEngine.Object>(path);\r\n                }\r\n            }\r\n#endif\r\n            return null;\r\n        }\r\n#endif\r\n\r\n        public static void Log(string msg)\r\n        {\r\n            if (LogAction != null)\r\n            {\r\n                LogAction(Level.Debug, msg);\r\n                return;\r\n            }\r\n\r\n#if !SLUA_STANDALONE\r\n            UnityEngine.Debug.Log(msg);\r\n#else\r\n            Console.WriteLine(msg);\r\n#endif \r\n        }\r\n        public static void LogError(string msg, bool hasStacktrace = false)\r\n        {\r\n            if (LogAction != null)\r\n            {\r\n                LogAction(Level.Error, msg);\r\n                return;\r\n            }\r\n\r\n#if !SLUA_STANDALONE\r\n            if(hasStacktrace)\r\n            {\r\n                // Disable Stacktrace so we can jump\r\n                var Type = UnityEngine.Application.GetStackTraceLogType(UnityEngine.LogType.Error);\r\n                UnityEngine.Application.SetStackTraceLogType(UnityEngine.LogType.Error, UnityEngine.StackTraceLogType.None);\r\n                UnityEngine.Debug.LogError(msg, FindScriptByMsg(msg));\r\n                UnityEngine.Application.SetStackTraceLogType(UnityEngine.LogType.Error, Type);\r\n            }\r\n            else\r\n            \tUnityEngine.Debug.LogError(msg);\r\n#else\r\n            Console.WriteLine(msg);\r\n#endif\r\n        }\r\n\r\n\t\tpublic static void LogWarning(string msg)\r\n\t\t{\r\n            if (LogAction != null)\r\n            {\r\n                LogAction(Level.Warning, msg);\r\n                return;\r\n            }\r\n\r\n#if !SLUA_STANDALONE\r\n\t\t\tUnityEngine.Debug.LogWarning(msg);\r\n#else\r\n            Console.WriteLine(msg);\r\n#endif\r\n\t\t}\r\n    }\r\n\r\n\r\n}"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Logger.cs.meta",
    "content": "fileFormatVersion: 2\nguid: ef0ab90919648f047bdecb8eee9a5b83\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Lua3rdDLL.cs",
    "content": "using System.Collections.Generic;\nusing System;\nusing System.IO;\nusing System.Linq;\nusing System.Reflection;\n#if !SLUA_STANDALONE\nusing UnityEngine;\n#endif\n\nnamespace SLua{\n\tpublic static class Lua3rdDLL{\n\t\tstatic Dictionary<string, LuaCSFunction> DLLRegFuncs = new Dictionary<string, LuaCSFunction>();\n\t\t\n\t\tstatic Lua3rdDLL(){\n\t\t\t// LuaSocketDLL.Reg(DLLRegFuncs);\n\t\t}\n\t\t\n\t\tpublic static void open(IntPtr L){\n\t\t\tvar typenames = Lua3rdMeta.Instance.typesWithAttribtues;\n\t\t\tvar assemblys = AppDomain.CurrentDomain.GetAssemblies();\n\t\t\tAssembly assembly = null;\n\t\t\tforeach(var ass in assemblys){\n\t\t\t\tif(ass.GetName().Name == \"Assembly-CSharp\"){\n\t\t\t\t\tassembly = ass;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(assembly != null){\n\t\t\t\tforeach(var typename in typenames){\n\t\t\t\t\tvar type = assembly.GetType(typename);\n\t\t\t\t\tvar methods = type.GetMethods(BindingFlags.Static|BindingFlags.Public);\n\t\t\t\t\tforeach(var method in methods){\n\t\t\t\t\t\tvar attr = System.Attribute.GetCustomAttribute(method,typeof(LualibRegAttribute)) as LualibRegAttribute;\n\t\t\t\t\t\tif(attr != null){\n\t\t\t\t\t\t\tvar csfunc = Delegate.CreateDelegate(typeof(LuaCSFunction),method) as LuaCSFunction;\n\t\t\t\t\t\t\tDLLRegFuncs.Add(attr.luaName,csfunc);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(DLLRegFuncs.Count == 0){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tLuaDLL.lua_getglobal(L, \"package\");\n\t\t\tLuaDLL.lua_getfield(L, -1, \"preload\");\n\t\t\tforeach (KeyValuePair<string, LuaCSFunction> pair in DLLRegFuncs) {\n\t\t\t\tLuaDLL.lua_pushcfunction (L, pair.Value);\n\t\t\t\tLuaDLL.lua_setfield(L, -2, pair.Key);\n\t\t\t}\n\t\t\t\n\t\t\tLuaDLL.lua_settop(L, 0);\n\t\t}\n\n\n\t\t[AttributeUsage(AttributeTargets.Method)]\n\t\tpublic class LualibRegAttribute:System.Attribute{\n\n\t\t\tpublic string luaName;\n\t\t\tpublic LualibRegAttribute(string luaName){\n\t\t\t\tthis.luaName = luaName;\n\t\t\t}\n\t\t}\n\t}\n\n}"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Lua3rdDLL.cs.meta",
    "content": "fileFormatVersion: 2\nguid: b87097bdd644c4646891b1b3514f4c53\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Lua3rdMeta.cs",
    "content": "﻿using System.Collections.Generic;\nusing System;\nusing System.Linq;\nusing System.Reflection;\n#if !SLUA_STANDALONE\nusing UnityEngine;\n#endif\nusing System.IO;\n\nnamespace SLua{\n\n\tpublic class Lua3rdMeta\n\t#if !SLUA_STANDALONE\n\t\t:ScriptableObject\n\t#endif\n\t{\n\t\t/// <summary>\n\t\t///Cache class types here those contain 3rd dll attribute.\n\t\t/// </summary>\n\t\tpublic List<string> typesWithAttribtues = new List<string>();\n\n\t\tvoid OnEnable(){\n\t\t\t#if !SLUA_STANDALONE\n\t\t\tthis.hideFlags = HideFlags.NotEditable;\n\t\t\t#endif\n\t\t}\n\t\t#if UNITY_EDITOR\n\n\t\tpublic void ReBuildTypes(){\n\t\t\ttypesWithAttribtues.Clear();\n\t\t\tAssembly assembly = null;\n\t\t\tforeach(var assem in AppDomain.CurrentDomain.GetAssemblies()){\n\t\t\t\tif(assem.GetName().Name == \"Assembly-CSharp\"){\n\t\t\t\t\tassembly = assem;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(assembly != null){\n\t\t\t\tvar types = assembly.GetExportedTypes();\n\t\t\t\tforeach(var type in types){\n\t\t\t\t\tvar methods = type.GetMethods(BindingFlags.Public|BindingFlags.Static);\n\t\t\t\t\tforeach(var method in methods){\n\t\t\t\t\t\tif(method.IsDefined(typeof(Lua3rdDLL.LualibRegAttribute),false)){\n\t\t\t\t\t\t\ttypesWithAttribtues.Add(type.FullName);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t} \n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t#endif\n\t\tprivate static Lua3rdMeta _instance=null;\n\t\tpublic static Lua3rdMeta Instance{\n\t\t\tget{\n\t\t\t\t#if !SLUA_STANDALONE\n\t\t\t\tif(_instance == null){\n\t\t\t\t\t_instance = Resources.Load<Lua3rdMeta>(\"lua3rdmeta\");\n\t\t\t\t}\n\n\t\t\t\t#if UNITY_EDITOR\n\t\t\t\tif(_instance == null){\n\t\t\t\t\t_instance = ScriptableObject.CreateInstance<Lua3rdMeta>();\n\t\t\t\t\tstring path = \"Assets/Slua/Resources\";\n\t\t\t\t\tif(!Directory.Exists(path)){\n\t\t\t\t\t\tDirectory.CreateDirectory(path);\n\t\t\t\t\t}\n\t\t\t\t\tUnityEditor.AssetDatabase.CreateAsset(_instance,Path.Combine(path,\"lua3rdmeta.asset\"));\n\t\t\t\t}\n\n\t\t\t\t#endif\n\t\t\t\t#endif\n\t\t\t\treturn _instance;\n\t\t\t}\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Lua3rdMeta.cs.meta",
    "content": "fileFormatVersion: 2\nguid: b51a3b5f40c08405ca2dfb572d3558c0\ntimeCreated: 1451443061\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaArray.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\nnamespace SLua\n{\n#if !SLUA_STANDALONE\n\tusing UnityEngine;\n#endif\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n\tusing System;\n\tusing System.Reflection;\n\tusing System.Runtime.InteropServices;\n\n\tclass LuaArray : LuaObject\n\t{\n\n\n\t\tstatic int toTable(IntPtr l,Array o)\n\t\t{\n\n\t\t\tif (o == null)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tLuaDLL.lua_createtable(l, o.Length, 0);\n\t\t\tfor (int n = 0; n < o.Length; n++)\n\t\t\t{\n\t\t\t\tpushVar(l, o.GetValue(n));\n\t\t\t\tLuaDLL.lua_rawseti(l, -2, n + 1);\n\t\t\t}\n\t\t\treturn 1;\n\t\t}\n\n\t\tstatic int length(IntPtr l,Array a)\n\t\t{\n\t\t\tpushValue(l, a.Length);\n\t\t\treturn 1;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int len(IntPtr l)\n\t\t{\n\t\t\tArray a = (Array)checkSelf(l);\n\t\t\tpushValue(l, a.Length);\n\t\t\treturn 1;\n\t\t}\n\n\t\tdelegate int ArrayPropFunction(IntPtr l, Array a);\n\n\t\tstatic Dictionary<string, ArrayPropFunction> propMethod = new Dictionary<string, ArrayPropFunction>();\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaIndex(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tArray a=(Array)checkSelf(l);\n\t\t\t\tif (LuaDLL.lua_type(l, 2) == LuaTypes.LUA_TSTRING)\n\t\t\t\t{\n\t\t\t\t\tstring mn;\n\t\t\t\t\tcheckType(l, 2, out mn);\n\t\t\t\t\tArrayPropFunction fun;\n\t\t\t\t\tif (propMethod.TryGetValue(mn, out fun))\n\t\t\t\t\t{\n\t\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\t\treturn fun(l, a) + 1;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tthrow new Exception(\"Can't find property named \" + mn);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint i;\n\t\t\t\t\tcheckType(l, 2, out i);\n\t\t\t\t\tassert(i>0,\"index base 1\");\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\tpushVar(l, a.GetValue(i-1));\n\t\t\t\t\treturn 2;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaNewIndex(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tArray a = (Array)checkSelf(l);\n\t\t\t\tint i;\n\t\t\t\tcheckType(l, 2, out i);\n\t\t\t\tassert(i>0,\"index base 1\");\n\t\t\t\tobject o=checkVar(l, 3);\n\t\t\t\tType et = a.GetType().GetElementType();\n\t\t\t\ta.SetValue(changeType(o,et), i-1);\n\t\t\t\treturn ok(l);\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int tostring(IntPtr l)\n\t\t{\n\t\t\tArray a = (Array)checkSelf(l);\n\t\t\tpushValue(l, string.Format(\"Array<{0}>\",a.GetType().GetElementType().Name));\n\t\t\treturn 1;\n\t\t}\n\n\t\tstatic new public void init(IntPtr l)\n\t\t{\n\n\t\t\tpropMethod[\"Table\"] = toTable;\n\t\t\tpropMethod[\"Length\"] = length;\n\n\t\t\tLuaDLL.lua_createtable(l, 0, 5);\n\t\t\tpushValue(l, luaIndex);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__index\");\n\t\t\tpushValue(l, luaNewIndex);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__newindex\");\n\t\t\tLuaDLL.lua_pushcfunction(l, lua_gc);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__gc\");\n\t\t\tLuaDLL.lua_pushcfunction(l, tostring);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__tostring\");\n\t\t\tLuaDLL.lua_pushcfunction(l, len);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__len\");\n\n\t\t\tLuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX, \"LuaArray\");\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaArray.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 7195878f2fbc1d346ba311cc09c9b7c6\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaByteArray.cs",
    "content": "﻿using System;\nusing SLua;\nusing System.Collections.Generic;\npublic class Lua_SLua_ByteArray : LuaObject {\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int constructor(IntPtr l) {\n\t\ttry {\n\t\t\tint argc = LuaDLL.lua_gettop(l);\n\t\t\tif(argc==1) {\n\t\t\t\tSLua.ByteArray o;\n\t\t\t\to = new SLua.ByteArray();\n\t\t\t\tpushValue(l,true);\n\t\t\t\tpushValue(l,o);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\telse if(argc==2) {\n\t\t\t\tSLua.ByteArray o;\n\t\t\t\tSystem.Byte[] a1;\n\t\t\t\tcheckArray(l,2,out a1);\n\t\t\t\to=new SLua.ByteArray(a1);\n\t\t\t\tpushValue(l,true);\n\t\t\t\tpushValue(l,o);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tpushValue(l,false);\n\t\t\tLuaDLL.lua_pushstring(l,\"No matched override function to call\");\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int SetData(IntPtr l) {\n\t\ttry {\n\t\t\tint argc = LuaDLL.lua_gettop(l);\n\t\t\tif(argc==2){\n\t\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\t\tSystem.Byte[] a1;\n\t\t\t\tcheckArray(l,2,out a1);\n\t\t\t\tself.SetData(a1);\n\t\t\t\tpushValue(l,true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse if(argc==4){\n\t\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\t\tSystem.Byte[] a1;\n\t\t\t\tcheckArray(l,2,out a1);\n\t\t\t\tSystem.Int32 a2;\n\t\t\t\tcheckType(l,3,out a2);\n\t\t\t\tSystem.Int32 a3;\n\t\t\t\tcheckType(l,4,out a3);\n\t\t\t\tself.SetData(a1,a2,a3);\n\t\t\t\tpushValue(l,true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tpushValue(l,false);\n\t\t\tLuaDLL.lua_pushstring(l,\"No matched override function to call\");\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int Clear(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tself.Clear();\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int GetData(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.GetData();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadBool(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadBool();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadInt(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadInt();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadUInt(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadUInt();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadChar(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadChar();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadUChar(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadUChar();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadByte(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadByte();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int Read(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Byte[] a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.Read(ref a1);\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,a1);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadSByte(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadSByte();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadShort(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadShort();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadUShort(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadUShort();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadInt16(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadInt16();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadUInt16(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadUInt16();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadInt64(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadInt64();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadFloat(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadFloat();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadDouble(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadDouble();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadString(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadString();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteByteArray(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSLua.ByteArray a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteByteArray(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteBool(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Boolean a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteBool(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteInt(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Int32 a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteInt(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteUInt(IntPtr l) {\n\t\ttry {\n\t\t\tint argc = LuaDLL.lua_gettop(l);\n\t\t\tif(argc==2){\n\t\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\t\tSystem.UInt32 a1;\n\t\t\t\tcheckType(l,2,out a1);\n\t\t\t\tself.WriteUInt(a1);\n\t\t\t\tpushValue(l,true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse if(argc==3){\n\t\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\t\tSystem.UInt32 a1;\n\t\t\t\tcheckType(l,2,out a1);\n\t\t\t\tSystem.Int32 a2;\n\t\t\t\tcheckType(l,3,out a2);\n\t\t\t\tself.WriteUInt(a1,a2);\n\t\t\t\tpushValue(l,true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tpushValue(l,false);\n\t\t\tLuaDLL.lua_pushstring(l,\"No matched override function to call\");\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteChar(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.SByte a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteChar(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteByte(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Byte a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteByte(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteUChar(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Byte a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteUChar(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteSByte(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.SByte a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteSByte(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteUShort(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.UInt16 a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteUShort(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteShort(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Int16 a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteShort(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteFloat(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Single a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteFloat(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteNum(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Double a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteNum(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteString(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.String a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteString(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteInt64(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Int64 a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteInt64(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int ReadVarInt(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tvar ret=self.ReadVarInt();\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,ret);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int WriteVarInt(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tSystem.Int64 a1;\n\t\t\tcheckType(l,2,out a1);\n\t\t\tself.WriteVarInt(a1);\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int get_Length(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,self.Length);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int get_Position(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tpushValue(l,true);\n\t\t\tpushValue(l,self.Position);\n\t\t\treturn 2;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int set_Position(IntPtr l) {\n\t\ttry {\n\t\t\tSLua.ByteArray self=(SLua.ByteArray)checkSelf(l);\n\t\t\tint v;\n\t\t\tcheckType(l,2,out v);\n\t\t\tself.Position=v;\n\t\t\tpushValue(l,true);\n\t\t\treturn 1;\n\t\t}\n\t\tcatch(Exception e) {\n\t\t\treturn error(l,e);\n\t\t}\n\t}\n\tstatic public void reg(IntPtr l) {\n\t\tgetTypeTable(l,\"Slua.ByteArray\");\n\t\taddMember (l, SetData);\n\t\taddMember(l,ReadBool);\n\t\taddMember(l,ReadInt);\n\t\taddMember(l,ReadUInt);\n\t\taddMember(l,ReadChar);\n\t\taddMember(l,ReadUChar);\n\t\taddMember(l,ReadByte);\n\t\taddMember(l,Read);\n\t\taddMember(l,ReadSByte);\n\t\taddMember(l,ReadShort);\n\t\taddMember(l,ReadUShort);\n\t\taddMember(l,ReadInt16);\n\t\taddMember(l,ReadUInt16);\n\t\taddMember(l,ReadInt64);\n\t\taddMember(l,ReadFloat);\n\t\taddMember(l,ReadDouble);\n\t\taddMember(l,ReadString);\n\t\taddMember(l,WriteByteArray);\n\t\taddMember(l,WriteBool);\n\t\taddMember(l,WriteInt);\n\t\taddMember(l,WriteUInt);\n\t\taddMember(l,WriteChar);\n\t\taddMember(l,WriteByte);\n\t\taddMember(l,WriteUChar);\n\t\taddMember(l,WriteSByte);\n\t\taddMember(l,WriteUShort);\n\t\taddMember(l,WriteShort);\n\t\taddMember(l,WriteFloat);\n\t\taddMember(l,WriteNum);\n\t\taddMember(l,WriteString);\n\t\taddMember(l,WriteInt64);\n\t\taddMember(l,ReadVarInt);\n\t\taddMember(l,WriteVarInt);\n\t\taddMember(l,\"Length\",get_Length,null,true);\n\t\taddMember(l,\"Position\",get_Position,set_Position,true);\n\t\tcreateTypeMetatable(l,constructor, typeof(SLua.ByteArray));\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaByteArray.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 1af564863887f4aa7b047e90bfebec15\ntimeCreated: 1489294104\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaDLL.cs",
    "content": "using System;\r\nusing System.Runtime.InteropServices;\r\n\r\nnamespace SLua\r\n{\r\n#pragma warning disable 414\r\n    public class MonoPInvokeCallbackAttribute : System.Attribute\r\n    {\r\n        private Type type;\r\n        public MonoPInvokeCallbackAttribute(Type t)\r\n        {\r\n            type = t;\r\n        }\r\n    }\r\n#pragma warning restore 414\r\n\r\n    public enum LuaTypes : int\r\n    {\r\n        LUA_TNONE = -1,\r\n        LUA_TNIL = 0,\r\n        LUA_TBOOLEAN = 1,\r\n        LUA_TLIGHTUSERDATA = 2,\r\n        LUA_TNUMBER = 3,\r\n        LUA_TSTRING = 4,\r\n        LUA_TTABLE = 5,\r\n        LUA_TFUNCTION = 6,\r\n        LUA_TUSERDATA = 7,\r\n        LUA_TTHREAD = 8,\r\n    }\r\n\r\n    public enum LuaGCOptions\r\n    {\r\n        LUA_GCSTOP = 0,\r\n        LUA_GCRESTART = 1,\r\n        LUA_GCCOLLECT = 2,\r\n        LUA_GCCOUNT = 3,\r\n        LUA_GCCOUNTB = 4,\r\n        LUA_GCSTEP = 5,\r\n        LUA_GCSETPAUSE = 6,\r\n        LUA_GCSETSTEPMUL = 7,\r\n    }\r\n\r\n    public enum LuaThreadStatus : int\r\n    {\r\n        LUA_YIELD = 1,\r\n        LUA_ERRRUN = 2,\r\n        LUA_ERRSYNTAX = 3,\r\n        LUA_ERRMEM = 4,\r\n        LUA_ERRERR = 5,\r\n    }\r\n\r\n    public sealed class LuaIndexes\r\n    {\r\n#if LUA_5_3\n        // for lua5.3\n        public static int LUA_REGISTRYINDEX = -1000000 - 1000;\n#else\r\n        // for lua5.1 or luajit\r\n        public static int LUA_REGISTRYINDEX = -10000;\r\n        public static int LUA_GLOBALSINDEX = -10002;\r\n#endif\r\n    }\r\n\r\n    [StructLayout(LayoutKind.Sequential)]\r\n    public struct ReaderInfo\r\n    {\r\n        public String chunkData;\r\n        public bool finished;\r\n    }\r\n\r\n#if UNITY_EDITOR_WIN || UNITY_STANDALONE_WIN\r\n    [UnmanagedFunctionPointer(CallingConvention.Cdecl)]\r\n    public delegate int LuaCSFunction(IntPtr luaState);\r\n#else\n\tpublic delegate int LuaCSFunction(IntPtr luaState);\n#endif\r\n\r\n    public delegate string LuaChunkReader(IntPtr luaState, ref ReaderInfo data, ref uint size);\r\n\r\n    public delegate int LuaFunctionCallback(IntPtr luaState);\r\n    public class LuaDLL\r\n    {\r\n        public static int LUA_MULTRET = -1;\r\n#if UNITY_IPHONE && !UNITY_EDITOR\n\t\tconst string LUADLL = \"__Internal\";\n#else\r\n        const string LUADLL = \"slua\";\r\n#endif\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_openextlibs(IntPtr L);\r\n\r\n        // Thread Funcs\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_tothread(IntPtr L, int index);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_xmove(IntPtr from, IntPtr to, int n);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr lua_newthread(IntPtr L);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_status(IntPtr L);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_pushthread(IntPtr L);\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_gc(IntPtr luaState, LuaGCOptions what, int data);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr lua_typename(IntPtr luaState, int type);\r\n        public static string lua_typenamestr(IntPtr luaState, LuaTypes type)\r\n        {\r\n            IntPtr p = lua_typename(luaState, (int)type);\r\n            return Marshal.PtrToStringAnsi(p);\r\n        }\r\n        public static string luaL_typename(IntPtr luaState, int stackPos)\r\n        {\r\n            return LuaDLL.lua_typenamestr(luaState, LuaDLL.lua_type(luaState, stackPos));\r\n        }\r\n\r\n        public static bool lua_isfunction(IntPtr luaState, int stackPos)\r\n        {\r\n            return lua_type(luaState, stackPos) == LuaTypes.LUA_TFUNCTION;\r\n        }\r\n\r\n        public static bool lua_islightuserdata(IntPtr luaState, int stackPos)\r\n        {\r\n            return lua_type(luaState, stackPos) == LuaTypes.LUA_TLIGHTUSERDATA;\r\n        }\r\n\r\n        public static bool lua_istable(IntPtr luaState, int stackPos)\r\n        {\r\n            return lua_type(luaState, stackPos) == LuaTypes.LUA_TTABLE;\r\n        }\r\n\r\n        public static bool lua_isthread(IntPtr luaState, int stackPos)\r\n        {\r\n            return lua_type(luaState, stackPos) == LuaTypes.LUA_TTHREAD;\r\n        }\r\n\r\n        [Obsolete]\r\n        public static void luaL_error(IntPtr luaState, string message)\r\n        {\r\n            //LuaDLL.lua_pushstring(luaState, message);\r\n            //LuaDLL.lua_error(luaState);\r\n        }\r\n\r\n        [Obsolete]\r\n        public static void luaL_error(IntPtr luaState, string fmt, params object[] args)\r\n        {\r\n            //string str = string.Format(fmt, args);\r\n            //luaL_error(luaState, str);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern string luaL_gsub(IntPtr luaState, string str, string pattern, string replacement);\r\n\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_isuserdata(IntPtr luaState, int stackPos);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_rawequal(IntPtr luaState, int stackPos1, int stackPos2);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_setfield(IntPtr luaState, int stackPos, string name);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaL_callmeta(IntPtr luaState, int stackPos, string name);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr luaL_newstate();\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_close(IntPtr luaState);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaL_openlibs(IntPtr luaState);\r\n\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaL_loadstring(IntPtr luaState, string chunk);\r\n        public static int luaL_dostring(IntPtr luaState, string chunk)\r\n        {\r\n            int result = LuaDLL.luaL_loadstring(luaState, chunk);\r\n            if (result != 0)\r\n                return result;\r\n\r\n            return LuaDLL.lua_pcall(luaState, 0, -1, 0);\r\n        }\r\n        public static int lua_dostring(IntPtr luaState, string chunk)\r\n        {\r\n            return LuaDLL.luaL_dostring(luaState, chunk);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_createtable(IntPtr luaState, int narr, int nrec);\r\n        public static void lua_newtable(IntPtr luaState)\r\n        {\r\n            LuaDLL.lua_createtable(luaState, 0, 0);\r\n        }\r\n\r\n#if LUA_5_3\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_getglobal(IntPtr luaState, string name);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_setglobal(IntPtr luaState, string name);\n\n        public static void lua_insert(IntPtr luaState, int newTop)\n        {\n            lua_rotate(luaState, newTop, 1);\n        }\n\n        public static void lua_pushglobaltable(IntPtr l)\n        {\n            lua_rawgeti(l, LuaIndexes.LUA_REGISTRYINDEX, 2); \n        }\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int lua_rotate(IntPtr luaState, int index, int n);\n\n        public static int lua_rawlen(IntPtr luaState, int stackPos)\n\t\t{\n\t\t\treturn LuaDLLWrapper.luaS_rawlen(luaState, stackPos);\n\t\t}\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int luaL_loadbufferx(IntPtr luaState, byte[] buff, int size, string name, IntPtr x);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int lua_callk(IntPtr luaState, int nArgs, int nResults,int ctx,IntPtr k);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int lua_pcallk(IntPtr luaState, int nArgs, int nResults, int errfunc,int ctx,IntPtr k);\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern int luaS_pcall(IntPtr luaState, int nArgs, int nResults, int errfunc);\n\t\t\n\t\tpublic static int lua_call(IntPtr luaState, int nArgs, int nResults)\n        {\n            return lua_callk(luaState, nArgs, nResults, 0, IntPtr.Zero);\n        }\n\n        public static int lua_pcall(IntPtr luaState, int nArgs, int nResults, int errfunc)\n        {\n\t\t\treturn luaS_pcall(luaState, nArgs, nResults, errfunc);\n        }\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern double lua_tonumberx(IntPtr luaState, int index, IntPtr x);\n        public static double lua_tonumber(IntPtr luaState, int index)\n        {\n            return lua_tonumberx(luaState, index, IntPtr.Zero);\n        }        \n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern Int64 lua_tointegerx(IntPtr luaState, int index,IntPtr x);\n        public static int lua_tointeger(IntPtr luaState, int index)\n        {\n            return (int)lua_tointegerx(luaState, index, IntPtr.Zero);\n        }\n\n\n        public static int luaL_loadbuffer(IntPtr luaState, byte[] buff, int size, string name)\n        {\n            return luaL_loadbufferx(luaState, buff, size, name, IntPtr.Zero);\n        }\n\n        public static void lua_remove(IntPtr l, int idx)\n        {\n            lua_rotate(l, (idx), -1);\n            lua_pop(l, 1);\n        }\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_rawgeti(IntPtr luaState, int tableIndex, Int64 index);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_rawseti(IntPtr luaState, int tableIndex, Int64 index);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_pushinteger(IntPtr luaState, Int64 i);\n\n        public static Int64 luaL_checkinteger(IntPtr luaState, int stackPos) {\n\t\t\tluaL_checktype(luaState, stackPos, LuaTypes.LUA_TNUMBER);\n\t\t\treturn lua_tointegerx(luaState, stackPos, IntPtr.Zero);\n\t\t}\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern int luaS_yield(IntPtr luaState,int nrets);\n\n\t\tpublic static int lua_yield(IntPtr luaState,int nrets) {\n\t\t\treturn luaS_yield(luaState,nrets);\n\t\t}\n\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_resume(IntPtr L, IntPtr from, int narg);\n        public static int lua_resume(IntPtr L, int narg)\r\n        {\r\n            return lua_resume(L, IntPtr.Zero, narg);\r\n        }\r\n\n\t\tpublic static void lua_replace(IntPtr luaState, int index) {\n\t\t\tlua_copy(luaState, -1, (index));\n\t\t\tlua_pop(luaState, 1);\n\t\t}\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern void lua_copy(IntPtr luaState,int from,int toidx);\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_isinteger(IntPtr luaState, int p);\n\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_compare(IntPtr luaState, int index1, int index2, int op);\n\t\t\n\t\tpublic static int lua_equal(IntPtr luaState, int index1, int index2)\n\t\t{\n\t\t\treturn lua_compare(luaState, index1, index2, 0);\n\t\t}\n\n#else\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_resume(IntPtr L, int narg);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_lessthan(IntPtr luaState, int stackPos1, int stackPos2);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_getfenv(IntPtr luaState, int stackPos);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_yield(IntPtr L, int nresults);\r\n\r\n        public static void lua_getglobal(IntPtr luaState, string name)\r\n        {\r\n            LuaDLL.lua_pushstring(luaState, name);\r\n            LuaDLL.lua_gettable(luaState, LuaIndexes.LUA_GLOBALSINDEX);\r\n        }\r\n\r\n        public static void lua_setglobal(IntPtr luaState, string name)\r\n        {\r\n            LuaDLL.lua_pushstring(luaState, name);\r\n            LuaDLL.lua_insert(luaState, -2);\r\n            LuaDLL.lua_settable(luaState, LuaIndexes.LUA_GLOBALSINDEX);\r\n        }\r\n\r\n        public static void lua_pushglobaltable(IntPtr l)\r\n        {\r\n            LuaDLL.lua_pushvalue(l, LuaIndexes.LUA_GLOBALSINDEX);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_insert(IntPtr luaState, int newTop);\r\n\r\n        public static int lua_rawlen(IntPtr luaState, int stackPos)\r\n        {\r\n            return LuaDLLWrapper.luaS_objlen(luaState, stackPos);\r\n        }\r\n\r\n        public static int lua_strlen(IntPtr luaState, int stackPos)\r\n        {\r\n            return lua_rawlen(luaState, stackPos);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_call(IntPtr luaState, int nArgs, int nResults);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_pcall(IntPtr luaState, int nArgs, int nResults, int errfunc);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern double lua_tonumber(IntPtr luaState, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_tointeger(IntPtr luaState, int index);\r\n\r\n        public static int luaL_loadbuffer(IntPtr luaState, byte[] buff, int size, string name)\r\n        {\r\n            return LuaDLLWrapper.luaLS_loadbuffer(luaState, buff, size, name);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_remove(IntPtr luaState, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_rawgeti(IntPtr luaState, int tableIndex, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_rawseti(IntPtr luaState, int tableIndex, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushinteger(IntPtr luaState, IntPtr i);\r\n\r\n        public static void lua_pushinteger(IntPtr luaState, int i)\r\n        {\r\n            lua_pushinteger(luaState, (IntPtr)i);\r\n        }\r\n\r\n        public static int luaL_checkinteger(IntPtr luaState, int stackPos)\r\n        {\r\n            luaL_checktype(luaState, stackPos, LuaTypes.LUA_TNUMBER);\r\n            return lua_tointeger(luaState, stackPos);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_replace(IntPtr luaState, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_setfenv(IntPtr luaState, int stackPos);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_equal(IntPtr luaState, int index1, int index2);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaL_loadfile(IntPtr luaState, string filename);\r\n#endif\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_settop(IntPtr luaState, int newTop);\r\n        public static void lua_pop(IntPtr luaState, int amount)\r\n        {\r\n            LuaDLL.lua_settop(luaState, -(amount) - 1);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_gettable(IntPtr luaState, int index);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_rawget(IntPtr luaState, int index);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_settable(IntPtr luaState, int index);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_rawset(IntPtr luaState, int index);\r\n\r\n#if LUA_5_3\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n\t\tpublic static extern void lua_setmetatable(IntPtr luaState, int objIndex);\n#else\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_setmetatable(IntPtr luaState, int objIndex);\r\n#endif\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_getmetatable(IntPtr luaState, int objIndex);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushvalue(IntPtr luaState, int index);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_gettop(IntPtr luaState);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern LuaTypes lua_type(IntPtr luaState, int index);\r\n        public static bool lua_isnil(IntPtr luaState, int index)\r\n        {\r\n            return (LuaDLL.lua_type(luaState, index) == LuaTypes.LUA_TNIL);\r\n        }\r\n\r\n        public static bool lua_isnumber(IntPtr luaState, int index)\r\n        {\r\n            return LuaDLLWrapper.lua_isnumber(luaState, index) > 0;\r\n        }\r\n        public static bool lua_isboolean(IntPtr luaState, int index)\r\n        {\r\n            return LuaDLL.lua_type(luaState, index) == LuaTypes.LUA_TBOOLEAN;\r\n        }\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaL_ref(IntPtr luaState, int registryIndex);\r\n\r\n\r\n        public static void lua_getref(IntPtr luaState, int reference)\r\n        {\r\n            LuaDLL.lua_rawgeti(luaState, LuaIndexes.LUA_REGISTRYINDEX, reference);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaL_unref(IntPtr luaState, int registryIndex, int reference);\r\n        public static void lua_unref(IntPtr luaState, int reference)\r\n        {\r\n            LuaDLL.luaL_unref(luaState, LuaIndexes.LUA_REGISTRYINDEX, reference);\r\n        }\r\n\r\n        public static bool lua_isstring(IntPtr luaState, int index)\r\n        {\r\n            return LuaDLLWrapper.lua_isstring(luaState, index) > 0;\r\n        }\r\n\r\n        public static bool lua_iscfunction(IntPtr luaState, int index)\r\n        {\r\n            return LuaDLLWrapper.lua_iscfunction(luaState, index) > 0;\r\n        }\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushnil(IntPtr luaState);\r\n\r\n        public static void luaL_checktype(IntPtr luaState, int p, LuaTypes t)\r\n        {\r\n            LuaTypes ct = LuaDLL.lua_type(luaState, p);\r\n            if (ct != t)\r\n            {\r\n                throw new Exception(string.Format(\"arg {0} expect {1}, got {2}\", p, lua_typenamestr(luaState, t), lua_typenamestr(luaState, ct)));\r\n            }\r\n        }\r\n\r\n        public static void lua_pushcfunction(IntPtr luaState, LuaCSFunction function)\r\n        {\r\n#if SLUA_STANDALONE\r\n            // Add all LuaCSFunction or they will be GC collected!  (problem at windows, .net framework 4.5, `CallbackOnCollectedDelegated` exception)\r\n            GCHandle.Alloc(function);\r\n#endif\r\n            IntPtr fn = Marshal.GetFunctionPointerForDelegate(function);\r\n            lua_pushcclosure(luaState, fn, 0);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr lua_tocfunction(IntPtr luaState, int index);\r\n\r\n\r\n        public static bool lua_toboolean(IntPtr luaState, int index)\r\n        {\r\n            return LuaDLLWrapper.lua_toboolean(luaState, index) > 0;\r\n        }\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr luaS_tolstring32(IntPtr luaState, int index, out int strLen);\r\n\r\n        public static string lua_tostring(IntPtr luaState, int index)\r\n        {\r\n            int strlen;\r\n\r\n            IntPtr str = luaS_tolstring32(luaState, index, out strlen); // fix il2cpp 64 bit\r\n\r\n            if (str != IntPtr.Zero)\r\n            {\r\n                return Marshal.PtrToStringAnsi(str, strlen);\r\n            }\r\n            return null;\r\n        }\r\n\r\n\t\tpublic static byte[] lua_tobytes(IntPtr luaState, int index)\r\n\t\t{\r\n\t\t\tint strlen;\r\n\r\n\t\t\tIntPtr str = luaS_tolstring32(luaState, index, out strlen); // fix il2cpp 64 bit\r\n\r\n\t\t\tif (str != IntPtr.Zero)\r\n\t\t\t{\r\n\t\t\t\tbyte[] bytes = new byte[strlen];\r\n\t\t\t\tMarshal.Copy(str, bytes,0,strlen);\r\n\t\t\t\treturn bytes;\r\n\t\t\t}\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr lua_atpanic(IntPtr luaState, LuaCSFunction panicf);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushnumber(IntPtr luaState, double number);\r\n\r\n        public static void lua_pushboolean(IntPtr luaState, bool value)\r\n        {\r\n            LuaDLLWrapper.lua_pushboolean(luaState, value ? 1 : 0);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushstring(IntPtr luaState, string str);\r\n\r\n        public static void lua_pushlstring(IntPtr luaState, byte[] str, int size)\r\n        {\r\n            LuaDLLWrapper.luaS_pushlstring(luaState, str, size);\r\n        }\r\n\r\n\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaL_newmetatable(IntPtr luaState, string meta);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_getfield(IntPtr luaState, int stackPos, string meta);\r\n        public static void luaL_getmetatable(IntPtr luaState, string meta)\r\n        {\r\n            LuaDLL.lua_getfield(luaState, LuaIndexes.LUA_REGISTRYINDEX, meta);\r\n        }\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr luaL_checkudata(IntPtr luaState, int stackPos, string meta);\r\n\r\n        public static bool luaL_getmetafield(IntPtr luaState, int stackPos, string field)\r\n        {\r\n            return LuaDLLWrapper.luaL_getmetafield(luaState, stackPos, field) > 0;\r\n        }\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_load(IntPtr luaState, LuaChunkReader chunkReader, ref ReaderInfo data, string chunkName);\r\n\r\n\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_error(IntPtr luaState);\r\n\r\n        public static bool lua_checkstack(IntPtr luaState, int extra)\r\n        {\r\n            return LuaDLLWrapper.lua_checkstack(luaState, extra) > 0;\r\n        }\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int lua_next(IntPtr luaState, int index);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushlightuserdata(IntPtr luaState, IntPtr udata);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaL_where(IntPtr luaState, int level);\r\n\r\n        public static double luaL_checknumber(IntPtr luaState, int stackPos)\r\n        {\r\n            luaL_checktype(luaState, stackPos, LuaTypes.LUA_TNUMBER);\r\n            return lua_tonumber(luaState, stackPos);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_concat(IntPtr luaState, int n);\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_newuserdata(IntPtr luaState, int val);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_rawnetobj(IntPtr luaState, int obj);\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern IntPtr lua_touserdata(IntPtr luaState, int index);\r\n\r\n        public static int lua_absindex(IntPtr luaState, int index)\r\n        {\r\n            return index > 0 ? index : lua_gettop(luaState) + index + 1;\r\n        }\r\n\r\n        public static int lua_upvalueindex(int i)\r\n        {\r\n#if LUA_5_3\n            return LuaIndexes.LUA_REGISTRYINDEX - i;\n#else\r\n            return LuaIndexes.LUA_GLOBALSINDEX - i;\r\n#endif\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void lua_pushcclosure(IntPtr l, IntPtr f, int nup);\r\n\r\n        public static void lua_pushcclosure(IntPtr l, LuaCSFunction f, int nup)\r\n        {\r\n#if SLUA_STANDALONE\r\n            // Add all LuaCSFunction or they will be GC collected!  (problem at windows, .net framework 4.5, `CallbackOnCollectedDelegated` exception)\r\n            GCHandle.Alloc(f);\r\n#endif\r\n            IntPtr fn = Marshal.GetFunctionPointerForDelegate(f);\r\n            lua_pushcclosure(l, fn, nup);\r\n        }\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkVector2(IntPtr l, int p, out float x, out float y);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkVector3(IntPtr l, int p, out float x, out float y, out float z);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkVector4(IntPtr l, int p, out float x, out float y, out float z, out float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkQuaternion(IntPtr l, int p, out float x, out float y, out float z, out float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkColor(IntPtr l, int p, out float x, out float y, out float z, out float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_pushVector2(IntPtr l, float x, float y);\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_pushVector3(IntPtr l, float x, float y, float z);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_pushVector4(IntPtr l, float x, float y, float z, float w);\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_pushQuaternion(IntPtr l, float x, float y, float z, float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_pushColor(IntPtr l, float x, float y, float z, float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern void luaS_setDataVec(IntPtr l, int p, float x, float y, float z, float w);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_checkluatype(IntPtr l, int p, string t);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_pushobject(IntPtr l, int index, string t, bool gco, int cref);\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_getcacheud(IntPtr l, int index, int cref);\r\n\r\n\r\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\r\n        public static extern int luaS_subclassof(IntPtr l, int index, string t);\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaDLL.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 65ffd36d393c7be4eaf8adaf63805a23\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaDLLWrapper.cs",
    "content": "﻿namespace SLua\n{\n    using System;\n    using System.Runtime.InteropServices;\n    using System.Reflection;\n    using System.Collections;\n    using System.Text;\n    using System.Security;\n\n\n\n    /**     Modify Record:\n     \n    lua_xmove：        return void\n    //lua_gc：           LuaDLLWrapper： enum->int。 \n      \n    lua_objlen：　　   lua 5.1：  luaS_objlen　size_t->int\n    lua_rawlen:        lua 5.3：  luaS_rawlen　size_t->int\n     \n    lua_setmetatable： lua 5.1 return int\n                       lua 5.3 return void\n     \n    //lua_type：         LuaDLLWrapper：  return int->enum\n    lua_isnumber：　   LuaDLLWrapper：　return bool->int  \n    lua_isstring:      LuaDLLWrapper：　return bool->int\n    lua_iscfunction:   LuaDLLWrapper：　return bool->int\n \n    lua_call:          5.1 return int->void\n     \n    lua_toboolean:     LuaDLLWrapper：   return bool->int\n     \n    lua_atpanic:       return void->intptr \n     \n    lua_pushboolean:   LuaDLLWrapper： bool ->int\n    lua_pushlstring:   LuaDLLWrapper: luaS_pushlstring. size_t->int\n\n    luaL_getmetafield:  LuaDLLWrapper: return bool->int\n    luaL_loadbuffe:     LuaDLLWrapper  luaLS_loadbuffer  size_t  CharSet\n     \n    lua_error:         return void->int\n    lua_checkstack：　　LuaDLLWrapper　return bool->int\n\n\n    **/\n\n    public class LuaDLLWrapper\n    {\n\n#if UNITY_IPHONE && !UNITY_EDITOR\n\tconst string LUADLL = \"__Internal\";\n#else\n\tconst string LUADLL = \"slua\";\n#endif\n\n#if LUA_5_3\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int luaS_rawlen(IntPtr luaState, int index);\n#else\n\t\t[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int luaS_objlen(IntPtr luaState, int stackPos);\n#endif\n\n\n        //[DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        //public static extern int lua_gc(IntPtr luaState, int what, int data);\n\n        //[DllImport(LUADLL,CallingConvention=CallingConvention.Cdecl)]\n        //public static extern int lua_type(IntPtr luaState, int index);\n\n        [DllImport(LUADLL,CallingConvention=CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_isnumber(IntPtr luaState, int index);\n\n\n        [DllImport(LUADLL,CallingConvention=CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_isstring(IntPtr luaState, int index);\n\n        [DllImport(LUADLL,CallingConvention=CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_iscfunction(IntPtr luaState, int index);\n\n        [DllImport(LUADLL,CallingConvention=CallingConvention.Cdecl)]\n\t\tpublic static extern int lua_toboolean(IntPtr luaState, int index);\n\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void lua_pushboolean(IntPtr luaState, int value);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern void luaS_pushlstring(IntPtr luaState, byte[] str, int size);\n\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int luaL_getmetafield(IntPtr luaState, int stackPos, string field);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int luaLS_loadbuffer(IntPtr luaState, byte[] buff, int size, string name);\n\n        [DllImport(LUADLL, CallingConvention = CallingConvention.Cdecl)]\n        public static extern int lua_checkstack(IntPtr luaState, int extra);\n    }\n\n\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaDLLWrapper.cs.meta",
    "content": "fileFormatVersion: 2\nguid: f424e2219e43bc547848ec3c1f6500ea\ntimeCreated: 1428479694\nlicenseType: Pro\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject.cs",
    "content": "// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n\n#if !SLUA_STANDALONE\n\tusing UnityEngine;\n#endif\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n\tusing System;\n\tusing System.Reflection;\n\tusing System.Runtime.InteropServices;\n\n\t[AttributeUsage(AttributeTargets.Class | AttributeTargets.Enum | AttributeTargets.Struct)]\n\tpublic class CustomLuaClassAttribute : System.Attribute\n\t{\n\t\tpublic CustomLuaClassAttribute()\n\t\t{\n\t\t\t//\n\t\t}\n\t}\n\n\tpublic class DoNotToLuaAttribute : System.Attribute\n\t{\n\t\tpublic DoNotToLuaAttribute()\n\t\t{\n\t\t\t//\n\t\t}\n\t}\n\n\tpublic class LuaBinderAttribute : System.Attribute\n\t{\n\t\tpublic int order;\n\t\tpublic LuaBinderAttribute(int order)\n\t\t{\n\t\t\tthis.order = order;\n\t\t}\n\t}\n\n\t[AttributeUsage(AttributeTargets.Method)]\n\tpublic class StaticExportAttribute : System.Attribute\n\t{\n\t\tpublic StaticExportAttribute()\n\t\t{\n\t\t\t//\n\t\t}\n\t}\n\n\t[AttributeUsage(AttributeTargets.Method)]\n\tpublic class LuaOverrideAttribute : System.Attribute {\n\t\tpublic string fn;\n\t\tpublic LuaOverrideAttribute(string fn) {\n\t\t\tthis.fn = fn;\n\t\t}\n\t}\n\n\tpublic class OverloadLuaClassAttribute : System.Attribute {\n\t\tpublic OverloadLuaClassAttribute(Type target) {\n\t\t\ttargetType = target;\n\t\t}\n\t\tpublic Type targetType;\n\t}\n\n    public class LuaOut { }\n\n\tpublic partial class LuaObject\n\t{\n\n\t\tstatic protected LuaCSFunction lua_gc = new LuaCSFunction(luaGC);\n\t\tstatic protected LuaCSFunction lua_add = new LuaCSFunction(luaAdd);\n\t\tstatic protected LuaCSFunction lua_sub = new LuaCSFunction(luaSub);\n\t\tstatic protected LuaCSFunction lua_mul = new LuaCSFunction(luaMul);\n\t\tstatic protected LuaCSFunction lua_div = new LuaCSFunction(luaDiv);\n\t\tstatic protected LuaCSFunction lua_unm = new LuaCSFunction(luaUnm);\n\t\tstatic protected LuaCSFunction lua_eq = new LuaCSFunction(luaEq);\n        static protected LuaCSFunction lua_lt = new LuaCSFunction(luaLt);\n        static protected LuaCSFunction lua_le = new LuaCSFunction(luaLe);\n        static protected LuaCSFunction lua_tostring = new LuaCSFunction(ToString);\n\t\tconst string DelgateTable = \"__LuaDelegate\";\n\n\t\tstatic protected LuaFunction newindex_func;\n\t\tstatic protected LuaFunction index_func;\n\n\t\tdelegate void PushVarDelegate(IntPtr l, object o);\n\t\tstatic Dictionary<Type, PushVarDelegate> typePushMap = new Dictionary<Type, PushVarDelegate>();\n\n\t\tinternal const int VersionNumber = 0x1201;\n\n\t\tpublic static void init(IntPtr l)\n\t\t{\n\t\t\tstring newindexfun = @\"\n\nlocal getmetatable=getmetatable\nlocal rawget=rawget\nlocal error=error\nlocal type=type\nlocal function newindex(ud,k,v)\n    local t=getmetatable(ud)\n    repeat\n        local h=rawget(t,k)\n        if h then\n\t\t\tif h[2] then\n\t\t\t\th[2](ud,v)\n\t            return\n\t\t\telse\n\t\t\t\terror('property '..k..' is read only')\n\t\t\tend\n        end\n        t=rawget(t,'__parent')\n    until t==nil\n    error('can not find '..k)\nend\n\nreturn newindex\n\";\n\n\t\t\tstring indexfun = @\"\nlocal type=type\nlocal error=error\nlocal rawget=rawget\nlocal getmetatable=getmetatable\nlocal function index(ud,k)\n    local t=getmetatable(ud)\n    repeat\n        local fun=rawget(t,k)\n        local tp=type(fun)\n        if tp=='function' then\n            return fun\n        elseif tp=='table' then\n\t\t\tlocal f=fun[1]\n\t\t\tif f then\n\t\t\t\treturn f(ud)\n\t\t\telse\n\t\t\t\terror('property '..k..' is write only')\n\t\t\tend\n        end\n        t = rawget(t,'__parent')\n    until t==nil\n    error('Can not find '..k)\nend\n\nreturn index\n\";\n\t\t\tLuaState L = LuaState.get(l);\n\t\t\tnewindex_func = (LuaFunction)L.doString(newindexfun);\n\t\t\tindex_func = (LuaFunction)L.doString(indexfun);\n\n\t\t\t// object method\n\t\t\tLuaDLL.lua_createtable(l, 0, 4);\n\t\t\taddMember(l, ToString);\n\t\t\taddMember(l, GetHashCode);\n\t\t\taddMember(l, Equals);\n\t\t\taddMember (l, GetType);\n\t\t\tLuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX, \"__luabaseobject\");\n\n\t\t\tLuaArray.init(l);\n\t\t\tLuaVarObject.init(l);\n\n\t\t\tLuaDLL.lua_newtable(l);\n\t\t\tLuaDLL.lua_setglobal(l, DelgateTable);\n\n\n\t\t\tsetupPushVar();\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int ToString(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tobject obj = checkVar(l, 1);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushValue(l, obj.ToString());\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int GetHashCode(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tobject obj = checkVar(l, 1);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushValue(l, obj.GetHashCode());\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int Equals(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tobject obj = checkVar(l, 1);\n\t\t\t\tobject other = checkVar(l, 2);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushValue(l, obj.Equals(other));\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int GetType(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tobject obj = checkVar(l, 1);\n\t\t\t\tpushValue(l, true);\n\t\t\t\tpushObject(l, obj.GetType());\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\tstatic void setupPushVar()\n\t\t{\n\t\t\ttypePushMap[typeof(float)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushnumber(L, (float)o);\n\t\t\t};\n\t\t\ttypePushMap[typeof(double)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushnumber(L, (double)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(int)] =\n\t\t\t\t(IntPtr L, object o) =>\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pushinteger(L, (int)o);\n\t\t\t\t};\n\n\t\t\ttypePushMap[typeof(uint)] =\n\t\t\t\t(IntPtr L, object o) =>\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pushnumber(L, Convert.ToUInt32(o));\n\t\t\t\t};\n\n\t\t\ttypePushMap[typeof(short)] =\n\t\t\t\t(IntPtr L, object o) =>\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pushinteger(L, (short)o);\n\t\t\t\t};\n\n\t\t\ttypePushMap[typeof(ushort)] =\n\t\t\t   (IntPtr L, object o) =>\n\t\t\t   {\n\t\t\t\t   LuaDLL.lua_pushinteger(L, (ushort)o);\n\t\t\t   };\n\n\t\t\ttypePushMap[typeof(sbyte)] =\n\t\t\t   (IntPtr L, object o) =>\n\t\t\t   {\n\t\t\t\t   LuaDLL.lua_pushinteger(L, (sbyte)o);\n\t\t\t   };\n\n\t\t\ttypePushMap[typeof(byte)] =\n\t\t\t   (IntPtr L, object o) =>\n\t\t\t   {\n\t\t\t\t   LuaDLL.lua_pushinteger(L, (byte)o);\n\t\t\t   };\n\n\n\t\t\ttypePushMap[typeof(Int64)] =\n\t\t\t\ttypePushMap[typeof(UInt64)] =\n\t\t\t\t(IntPtr L, object o) =>\n\t\t\t\t{\n#if LUA_5_3\n\t\t\t\t\tLuaDLL.lua_pushinteger(L, (long)o);\n#else\n\t\t\t\t\tLuaDLL.lua_pushnumber(L, System.Convert.ToDouble(o));\n#endif\n\t\t\t\t};\n\n\t\t\ttypePushMap[typeof(string)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushstring(L, (string)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(bool)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushboolean(L, (bool)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(LuaTable)] =\n\t\t\t\ttypePushMap[typeof(LuaFunction)] =\n                typePushMap[typeof(LuaThread)] =\n                (IntPtr L, object o) =>\n\t\t\t\t{\n\t\t\t\t\t((LuaVar)o).push(L);\n\t\t\t\t};\n#if !SLUA_STANDALONE\n\t\t\ttypePushMap[typeof(Vector3)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (Vector3)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(Vector2)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (Vector2)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(Vector4)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (Vector4)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(Quaternion)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (Quaternion)o);\n\t\t\t};\n\n\t\t\ttypePushMap[typeof(Color)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (Color)o);\n\t\t\t};\n#endif\n\n\t\t\ttypePushMap[typeof(LuaCSFunction)] = (IntPtr L, object o) =>\n\t\t\t{\n\t\t\t\tpushValue(L, (LuaCSFunction)o);\n\t\t\t};\n\t\t}\n\n\t\tstatic int getOpFunction(IntPtr l, string f, string tip)\n\t\t{\n\t\t\tint err = pushTry(l);\n\t\t\tcheckLuaObject(l, 1);\n\n\t\t\twhile (!LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_getfield(l, -1, f);\n\t\t\t\tif (!LuaDLL.lua_isnil(l, -1))\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_remove(l, -2);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tLuaDLL.lua_pop(l, 1); //pop nil\n\t\t\t\tLuaDLL.lua_getfield(l, -1, \"__parent\");\n\t\t\t\tLuaDLL.lua_remove(l, -2); //pop base\n\t\t\t}\n\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\tthrow new Exception(string.Format(\"No {0} operator\", tip));\n\t\t\t}\n\t\t\treturn err;\n\t\t}\n\n\t\tstatic int luaOp(IntPtr l, string f, string tip)\n\t\t{\n\t\t\tint err = getOpFunction(l, f, tip);\n\t\t\tLuaDLL.lua_pushvalue(l, 1);\n\t\t\tLuaDLL.lua_pushvalue(l, 2);\n\t\t\tif (LuaDLL.lua_pcall(l, 2, 1, err) != 0)\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\tLuaDLL.lua_remove(l, err);\n\t\t\tpushValue(l, true);\n\t\t\tLuaDLL.lua_insert(l, -2);\n\t\t\treturn 2;\n\t\t}\n\n\n\t\tstatic int luaUnaryOp(IntPtr l, string f, string tip)\n\t\t{\n\t\t\tint err = getOpFunction(l, f, tip);\n\t\t\tLuaDLL.lua_pushvalue(l, 1);\n\t\t\tif (LuaDLL.lua_pcall(l, 1, 1, err) != 0)\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\tLuaDLL.lua_remove(l, err);\n\t\t\tpushValue(l, true);\n\t\t\tLuaDLL.lua_insert(l, -2);\n\t\t\treturn 2;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaAdd(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_Addition\", \"add\");\n\t\t\t}\n\t\t\tcatch(Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaSub(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_Subtraction\", \"sub\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaMul(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_Multiply\", \"mul\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaDiv(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_Division\", \"div\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaUnm(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaUnaryOp(l, \"op_UnaryNegation\", \"unm\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaEq(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_Equality\", \"eq\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n\t\t}\n\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int luaLt(IntPtr l)\n        {\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_LessThan\", \"lt\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n        }\n\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int luaLe(IntPtr l)\n        {\n\t\t\ttry\n\t\t\t{\n\t\t\t\treturn luaOp(l, \"op_LessThanOrEqual\", \"le\");\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn error(l, e);\n\t\t\t}\n        }\n\n\t\tpublic static void getEnumTable(IntPtr l, string t)\n\t\t{\n\t\t\tnewTypeTable(l, t);\n\t\t}\n\n\t\tpublic static void getTypeTable(IntPtr l, string t)\n\t\t{\n\t\t\tnewTypeTable(l, t);\n\t\t\t// for static\n\t\t\tLuaDLL.lua_newtable(l);\n\t\t\t// for instance\n\t\t\tLuaDLL.lua_newtable(l);\n\t\t}\n\n\t\tpublic static void newTypeTable(IntPtr l, string name)\n\t\t{\n\t\t\tstring[] subt = name.Split('.');\n\n\t\t\tLuaDLL.lua_pushglobaltable(l);\n\n\t\t\tforeach(string t in subt)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushstring(l, t);\n\t\t\t\tLuaDLL.lua_rawget(l, -2);\n\t\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t\tLuaDLL.lua_createtable(l, 0, 0);\n\t\t\t\t\tLuaDLL.lua_pushstring(l, t);\n\t\t\t\t\tLuaDLL.lua_pushvalue(l, -2);\n\t\t\t\t\tLuaDLL.lua_rawset(l, -4);\n\t\t\t\t}\n\t\t\t\tLuaDLL.lua_remove(l, -2);\n\t\t\t}\n\t\t}\n\n\t\tpublic static void createTypeMetatable(IntPtr l, Type self)\n\t\t{\n\t\t\tcreateTypeMetatable(l, null, self, null);\n\t\t}\n\n\t\tpublic static void createTypeMetatable(IntPtr l, LuaCSFunction con, Type self)\n\t\t{\n\t\t\tcreateTypeMetatable(l, con, self, null);\n\t\t}\n\n        static void checkMethodValid(LuaCSFunction f)\n        {\n#if UNITY_EDITOR\n            if (f != null && !Attribute.IsDefined(f.Method, typeof(MonoPInvokeCallbackAttribute)))\n            {\n\t\t\t\tLogger.LogError(string.Format(\"MonoPInvokeCallbackAttribute not defined for LuaCSFunction {0}.\", f.Method));\n            }\n#endif\n        }\n\n\t\tpublic static void createTypeMetatable(IntPtr l, LuaCSFunction con, Type self, Type parent)\n\t\t{\n\t\t\tcheckMethodValid(con);\n\n\t\t\t// set parent\n\t\t\tbool parentSet = false;\n\t\t\tLuaDLL.lua_pushstring(l, \"__parent\");\n\t\t\twhile (parent != null && parent != typeof(object) && parent != typeof(ValueType))\n\t\t\t{\n\t\t\t\tLuaDLL.luaL_getmetatable(l, ObjectCache.getAQName(parent));\n\t\t\t\t// if parentType is not exported to lua\n\t\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t\tparent = parent.BaseType;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_rawset(l, -3);\n\n\t\t\t\t\tLuaDLL.lua_pushstring(l, \"__parent\");\n\t\t\t\t\tLuaDLL.luaL_getmetatable(l, parent.FullName);\n\t\t\t\t\tLuaDLL.lua_rawset(l, -4);\n\n\t\t\t\t\tparentSet = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!parentSet)\n\t\t\t{\n\t\t\t\tLuaDLL.luaL_getmetatable(l, \"__luabaseobject\");\n\t\t\t\tLuaDLL.lua_rawset(l, -3);\n\t\t\t}\n\n\t\t\tcompleteInstanceMeta(l, self);\n\t\t\tcompleteTypeMeta(l, con, self);\n\n\t\t\tLuaDLL.lua_pop(l, 1); // pop type Table\n\t\t}\n\n\t\tstatic void completeTypeMeta(IntPtr l, LuaCSFunction con, Type self)\n\t\t{\n\n\t\t\tLuaDLL.lua_pushstring(l, ObjectCache.getAQName(self));\n\t\t\tLuaDLL.lua_setfield(l, -3, \"__fullname\");\n\n\t\t\tindex_func.push(l);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__index\");\n\n\t\t\tnewindex_func.push(l);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__newindex\");\n\n\t\t\tif (con == null) con = noConstructor;\n\n\t\t\tpushValue(l, con);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__call\");\n\n\t\t\tLuaDLL.lua_pushcfunction(l, typeToString);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__tostring\");\n\n\t\t\tLuaDLL.lua_pushvalue(l, -1);\n\t\t\tLuaDLL.lua_setmetatable(l, -3);\n\n\t\t\tLuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX, self.FullName);\n\t\t}\n\n\t\tprivate static void completeInstanceMeta(IntPtr l, Type self)\n\t\t{\n\t\t\tLuaDLL.lua_pushstring(l, \"__typename\");\n\t\t\tLuaDLL.lua_pushstring(l, self.Name);\n\t\t\tLuaDLL.lua_rawset(l, -3);\n\n\t\t\t// for instance\n\t\t\tindex_func.push(l);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__index\");\n\n\t\t\tnewindex_func.push(l);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__newindex\");\n\n\t\t\tpushValue(l, lua_add);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__add\");\n\t\t\tpushValue(l, lua_sub);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__sub\");\n\t\t\tpushValue(l, lua_mul);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__mul\");\n\t\t\tpushValue(l, lua_div);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__div\");\n\t\t\tpushValue(l, lua_unm);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__unm\");\n\t\t\tpushValue(l, lua_eq);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__eq\");\n            pushValue(l, lua_le);\n            LuaDLL.lua_setfield(l, -2, \"__le\");\n            pushValue(l, lua_lt);\n            LuaDLL.lua_setfield(l, -2, \"__lt\");\n\t\t\tpushValue(l, lua_tostring);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__tostring\");\n\n\t\t\tLuaDLL.lua_pushcfunction(l, lua_gc);\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__gc\");\n\n\t\t\tif (self.IsValueType && isImplByLua(self))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushvalue(l, -1);\n                LuaDLL.lua_setglobal(l, self.FullName + \".Instance\");\n\t\t\t}\n\t\t\tLuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX,  ObjectCache.getAQName(self));\n\t\t}\n\n\n\t\tpublic static bool isImplByLua(Type t)\n\t\t{\n#if !SLUA_STANDALONE\n\t\t\treturn t == typeof(Color)\n\t\t\t\t|| t == typeof(Vector2)\n\t\t\t\t|| t == typeof(Vector3)\n\t\t\t\t|| t == typeof(Vector4)\n\t\t\t\t|| t == typeof(Quaternion);\n#else\n\t\t    return false;\n#endif\n\t\t}\n\n\n\t\tpublic static void reg(IntPtr l, LuaCSFunction func, string ns)\n\t\t{\n            checkMethodValid(func);\n\n            newTypeTable(l, ns);\n\t\t\tpushValue(l, func);\n\t\t\tLuaDLL.lua_setfield(l, -2, func.Method.Name);\n\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t}\n\n\t\tprotected static void addMember(IntPtr l, LuaCSFunction func)\n\t\t{\n            checkMethodValid(func);\n\n\t\t\tpushValue(l, func);\n\t\t\tstring name = func.Method.Name;\n\t\t\tif (name.EndsWith(\"_s\"))\n\t\t\t{\n\t\t\t\tname = name.Substring(0, name.Length - 2);\n\t\t\t\tLuaDLL.lua_setfield(l, -3, name);\n\t\t\t}\n\t\t\telse\n\t\t\t\tLuaDLL.lua_setfield(l, -2, name);\n\t\t}\n\n\t\tprotected static void addMember(IntPtr l, LuaCSFunction func, bool instance)\n\t\t{\n            checkMethodValid(func);\n\n\t\t\tpushValue(l, func);\n\t\t\tstring name = func.Method.Name;\n\t\t\tLuaDLL.lua_setfield(l, instance ? -2 : -3, name);\n\t\t}\n\n\t\tprotected static void addMember(IntPtr l, string name, LuaCSFunction get, LuaCSFunction set, bool instance)\n\t\t{\n            checkMethodValid(get);\n            checkMethodValid(set);\n\n            int t = instance ? -2 : -3;\n\n\t\t\tLuaDLL.lua_createtable(l, 2, 0);\n\t\t\tif (get == null)\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\telse\n\t\t\t\tpushValue(l, get);\n\t\t\tLuaDLL.lua_rawseti(l, -2, 1);\n\n\t\t\tif (set == null)\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\telse\n\t\t\t\tpushValue(l, set);\n\t\t\tLuaDLL.lua_rawseti(l, -2, 2);\n\n\t\t\tLuaDLL.lua_setfield(l, t, name);\n\t\t}\n\n\t\tprotected static void addMember(IntPtr l, int v, string name)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, v);\n\t\t\tLuaDLL.lua_setfield(l, -2, name);\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int luaGC(IntPtr l)\n\t\t{\n\t\t\tint index = LuaDLL.luaS_rawnetobj(l, 1);\n\t\t\tif (index > 0)\n\t\t\t{\n\t\t\t\tObjectCache t = ObjectCache.get(l);\n\t\t\t\tt.gc(index);\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n#if !SLUA_STANDALONE\n        static internal void gc(IntPtr l,int p,UnityEngine.Object o)\n        {\n            // set ud's metatable is nil avoid gc again\n            LuaDLL.lua_pushnil(l);\n            LuaDLL.lua_setmetatable(l, p);\n\n            ObjectCache t = ObjectCache.get(l);\n            t.gc(o);\n        }\n#endif\n\n\t\tstatic public void checkLuaObject(IntPtr l, int p)\n\t\t{\n\t\t\tLuaDLL.lua_getmetatable(l, p);\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\tthrow new Exception(\"expect luaobject as first argument\");\n\t\t\t}\n\t\t}\n\n\t\tpublic static void pushObject(IntPtr l, object o)\n\t\t{\n\t\t\tObjectCache oc = ObjectCache.get(l);\n\t\t\toc.push(l, o);\n\t\t}\n\n\t\tpublic static void pushObject(IntPtr l, Array o)\n\t\t{\n\t\t\tObjectCache oc = ObjectCache.get(l);\n\t\t\toc.push(l, o);\n\t\t}\n\n\t\t// lightobj is non-exported object used for re-get from c#, not for lua\n\t\tpublic static void pushLightObject(IntPtr l, object t)\n\t\t{\n\t\t\tObjectCache oc = ObjectCache.get(l);\n\t\t\toc.push(l, t, false);\n\t\t}\n\n\t\tstatic private int errorRef = 0;\n\n\t\tpublic static int pushTry(IntPtr l)\n\t\t{\n\t\t\tif (!LuaState.get(l).isMainThread())\n\t\t\t{\n\t\t\t\tLogger.LogError(\"Can't call lua function in bg thread\");\n\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\tif (errorRef == 0) {\n\t\t\t\tLuaDLL.lua_pushcfunction (l, LuaState.errorFunc);\n\t\t\t\tLuaDLL.lua_pushvalue (l, -1);\n\t\t\t\terrorRef = LuaDLL.luaL_ref (l, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t\t} else {\n\t\t\t\tLuaDLL.lua_getref(l,errorRef);\n\t\t\t}\n\t\t\treturn LuaDLL.lua_gettop(l);\n\t\t}\n\n\n\t\tpublic static bool matchType(IntPtr l, int p, LuaTypes lt, Type t)\n\t\t{\n\t\t\tif (t == typeof(object))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (t == typeof(Type) && isTypeTable(l, p))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if (t == typeof(char[]) || t==typeof(byte[]))\n\t\t\t{\n\t\t\t\treturn lt == LuaTypes.LUA_TSTRING;\n\t\t\t}\n\n\t\t\tswitch (lt)\n\t\t\t{\n                case LuaTypes.LUA_TNIL:\n                    return !t.IsValueType && !t.IsPrimitive;\n\t\t\t\tcase LuaTypes.LUA_TNUMBER:\n#if LUA_5_3\n\t\t\t\t\tif (LuaDLL.lua_isinteger(l, p) > 0)\n\t\t\t\t\t\treturn (t.IsPrimitive && t != typeof(float) && t != typeof(double)) || t.IsEnum;\n\t\t\t\t\telse\n\t\t\t\t\t\treturn t == typeof(float) || t == typeof(double);\n#else\n\t\t\t\t\treturn t.IsPrimitive || t.IsEnum;\n#endif\n\t\t\t\tcase LuaTypes.LUA_TUSERDATA:\n\t\t\t\t\tobject o = checkObj (l, p);\n\t\t\t\t\tType ot = o.GetType ();\n\t\t\t\t\treturn ot == t || ot.IsSubclassOf (t) || t.IsAssignableFrom (ot);\n\t\t\t\tcase LuaTypes.LUA_TSTRING:\n\t\t\t\t\treturn t == typeof(string);\n\t\t\t\tcase LuaTypes.LUA_TBOOLEAN:\n\t\t\t\t\treturn t == typeof(bool);\n\t\t\t\tcase LuaTypes.LUA_TTABLE:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (t == typeof(LuaTable) || t.IsArray)\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\telse if (t.IsValueType)\n\t\t\t\t\t\t\treturn true;//luaTypeCheck(l, p, t.Name);\n\t\t\t\t\t\telse if (LuaDLL.luaS_subclassof(l, p, t.Name) == 1)\n\t\t\t\t\t\t\treturn true;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TFUNCTION:\n\t\t\t\t\treturn t == typeof(LuaFunction) || t.BaseType == typeof(MulticastDelegate);\n                case LuaTypes.LUA_TTHREAD:\n                    return t == typeof(LuaThread);\n\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\tpublic static bool isTypeTable(IntPtr l, int p)\n\t\t{\n\t\t\tif (LuaDLL.lua_type(l, p) != LuaTypes.LUA_TTABLE)\n\t\t\t\treturn false;\n\t\t\tLuaDLL.lua_pushstring(l, \"__fullname\");\n\t\t\tLuaDLL.lua_rawget(l, p);\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static bool isLuaClass(IntPtr l, int p)\n\t\t{\n\t\t\treturn LuaDLL.luaS_subclassof(l, p, null) == 1;\n\t\t}\n\n\t\tstatic bool isLuaValueType(IntPtr l, int p)\n\t\t{\n\t\t\treturn LuaDLL.luaS_checkluatype(l, p, null) == 1;\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int p, Type t1)\n\t\t{\n\t\t\tLuaTypes t = LuaDLL.lua_type(l, p);\n\t\t\treturn matchType(l, p, t, t1);\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int total, int from, Type t1)\n\t\t{\n\t\t\tif (total - from + 1 != 1)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1);\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int total, int from, Type t1, Type t2)\n\t\t{\n\t\t\tif (total - from + 1 != 2)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2);\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int total, int from, Type t1, Type t2, Type t3)\n\t\t{\n\t\t\tif (total - from + 1 != 3)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3);\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4)\n\t\t{\n\t\t\tif (total - from + 1 != 4)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4);\n\t\t}\n\n\t\tpublic static bool matchType(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5)\n\t\t{\n\t\t\tif (total - from + 1 != 5)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5);\n\t\t}\n\n\t\tpublic static bool matchType\n\t\t\t(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5,Type t6)\n\t\t{\n\t\t\tif (total - from + 1 != 6)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5)\n\t\t\t\t&& matchType(l, from + 5, t6);\n\t\t}\n\n\t\tpublic static bool matchType\n\t\t\t(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5,Type t6,Type t7)\n\t\t{\n\t\t\tif (total - from + 1 != 7)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5)\n\t\t\t\t&& matchType(l, from + 5, t6)\n\t\t\t\t&& matchType(l, from + 6, t7);\n\t\t}\n\n\t\tpublic static bool matchType\n\t\t\t(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5,Type t6,Type t7,Type t8)\n\t\t{\n\t\t\tif (total - from + 1 != 8)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5)\n\t\t\t\t&& matchType(l, from + 5, t6)\n\t\t\t\t&& matchType(l, from + 6, t7)\n\t\t\t\t&& matchType(l, from + 7, t8);\n\t\t}\n\n\n\t\tpublic static bool matchType\n\t\t\t(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5,Type t6,Type t7,Type t8,Type t9)\n\t\t{\n\t\t\tif (total - from + 1 != 9)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5)\n\t\t\t\t&& matchType(l, from + 5, t6)\n\t\t\t\t&& matchType(l, from + 6, t7)\n\t\t\t\t&& matchType(l, from + 7, t8)\n\t\t\t\t&& matchType(l, from + 8, t9);\n\t\t}\n\n\t\tpublic static bool matchType\n\t\t\t(IntPtr l, int total, int from, Type t1, Type t2, Type t3, Type t4, Type t5,Type t6,Type t7,Type t8,Type t9,Type t10)\n\t\t{\n\t\t\tif (total - from + 1 != 10)\n\t\t\t\treturn false;\n\n\t\t\treturn matchType(l, from, t1) && matchType(l, from + 1, t2) && matchType(l, from + 2, t3) && matchType(l, from + 3, t4)\n\t\t\t\t&& matchType(l, from + 4, t5)\n\t\t\t\t\t&& matchType(l, from + 5, t6)\n\t\t\t\t\t&& matchType(l, from + 6, t7)\n\t\t\t\t\t&& matchType(l, from + 7, t8)\n\t\t\t\t\t&& matchType(l, from + 8, t9)\n\t\t\t\t\t&& matchType(l, from + 9, t10);\n\t\t}\n\n        public static bool matchType(IntPtr l, int total, int from, params Type[] t)\n        {\n            if (total - from + 1 != t.Length)\n                return false;\n\n            for (int i = 0; i < t.Length; ++i)\n            {\n                if (!matchType(l, from + i, t[i]))\n                    return false;\n            }\n\n            return true;\n        }\n\n        public static bool matchType(IntPtr l, int total, int from, ParameterInfo[] pars)\n\t\t{\n\t\t\tif (total - from + 1 != pars.Length)\n\t\t\t\treturn false;\n\n\t\t\tfor (int n = 0; n < pars.Length; n++)\n\t\t\t{\n\t\t\t\tint p = n + from;\n\t\t\t\tLuaTypes t = LuaDLL.lua_type(l, p);\n\t\t\t\tif (!matchType(l, p, t, pars[n].ParameterType))\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool luaTypeCheck(IntPtr l, int p, string t)\n\t\t{\n\t\t\treturn LuaDLL.luaS_checkluatype(l, p, t) != 0;\n\t\t}\n\n\t\tstatic LuaDelegate newDelegate(IntPtr l, int p)\n\t\t{\n\t\t\tLuaState state = LuaState.get(l);\n\n\t\t\tLuaDLL.lua_pushvalue(l, p); // push function\n\n\t\t\tint fref = LuaDLL.luaL_ref(l, LuaIndexes.LUA_REGISTRYINDEX); // new ref function\n\t\t\tLuaDelegate f = new LuaDelegate(l, fref);\n\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\tLuaDLL.lua_pushinteger(l, fref);\n\t\t\tLuaDLL.lua_settable(l, -3); // __LuaDelegate[func]= fref\n\t\t\tstate.delgateMap[fref] = f;\n\t\t\treturn f;\n\t\t}\n\n\t\tstatic public void removeDelgate(IntPtr l, int r)\n\t\t{\n\t\t\tLuaDLL.lua_getglobal(l, DelgateTable);\n\t\t\tLuaDLL.lua_getref(l, r); // push key\n\t\t\tLuaDLL.lua_pushnil(l); // push nil value\n\t\t\tLuaDLL.lua_settable(l, -3); // remove function from __LuaDelegate table\n\t\t\tLuaDLL.lua_pop(l, 1); // pop __LuaDelegate\n\t\t}\n\n\t\tstatic public object checkObj(IntPtr l, int p)\n\t\t{\n\t\t\tObjectCache oc = ObjectCache.get(l);\n\t\t\treturn oc.get(l, p);\n\t\t}\n\n\t\tstatic public bool checkArray<T>(IntPtr l, int p, out T[] ta)\n\t\t{\n\t\t\tif (LuaDLL.lua_type(l, p) == LuaTypes.LUA_TTABLE)\n\t\t\t{\n\t\t\t\tint n = LuaDLL.lua_rawlen(l, p);\n\t\t\t\tta = new T[n];\n\t\t\t\tfor (int k = 0; k < n; k++)\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_rawgeti(l, p, k + 1);\n\t\t\t\t\tta[k]=(T)Convert.ChangeType(checkVar(l, -1),typeof(T));\n\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tArray array = checkObj(l, p) as Array;\n\t\t\t\tif (array == null)\n\t\t\t\t\tthrow new ArgumentException (\"expect array\");\n\t\t\t\tta = array as T[];\n\t\t\t\treturn ta!=null;\n\t\t\t}\n\t\t}\n\n\t\tstatic public bool checkParams<T>(IntPtr l, int p, out T[] pars) where T:class\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new T[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new T[0];\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkValueParams<T>(IntPtr l, int p, out T[] pars) where T : struct\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new T[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckValueType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new T[0];\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkParams(IntPtr l, int p, out float[] pars)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new float[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new float[0];\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkParams(IntPtr l, int p, out int[] pars)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new int[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new int[0];\n\t\t\treturn true;\n\t\t}\n\n\n\n\t\tstatic public bool checkParams(IntPtr l, int p, out string[] pars)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new string[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new string[0];\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkParams(IntPtr l, int p, out char[] pars)\n\t\t{\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TSTRING);\n\t\t\tstring s;\n\t\t\tcheckType(l, p, out s);\n\t\t\tpars = s.ToCharArray();\n\t\t\treturn true;\n\t\t}\n\n        static public object checkVar(IntPtr l, int p, Type t)\n        {\n\t\t\tobject obj = checkVar(l, p);\n            try\n            {\n                if (t.IsEnum)\n                {\n                    // double to int\n                    var number = Convert.ChangeType(obj, typeof(int));\n                    return Enum.ToObject(t, number);\n                }\n\n\t\t\t\tobject convertObj = null;\n\t\t\t\tif(obj!=null) {\n\t                if (t.IsInstanceOfType(obj))\n\t                {\n\t                    convertObj = obj; // if t is parent of obj, ignore change type\n\t                }\n\t                else\n\t                {\n\t                    convertObj = Convert.ChangeType(obj, t);\n\t                }\n\t\t\t\t}\n                return obj == null ? null : convertObj;\n            }\n            catch(Exception e) {\n\t\t\t\tthrow new Exception(string.Format(\"parameter {0} expected {1}, got {2}, exception: {3}\", p, t.Name, obj == null ? \"null\" : obj.GetType().Name, e.Message));\n            }\n        }\n\n\t\tstatic public object checkVar(IntPtr l, int p)\n\t\t{\n\t\t\tLuaTypes type = LuaDLL.lua_type(l, p);\n\t\t\tswitch (type)\n\t\t\t{\n\t\t\t\tcase LuaTypes.LUA_TNUMBER:\n\t\t\t\t\t{\n\t\t\t\t\t\treturn LuaDLL.lua_tonumber(l, p);\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TSTRING:\n\t\t\t\t\t{\n\t\t\t\t\t\treturn LuaDLL.lua_tostring(l, p);\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TBOOLEAN:\n\t\t\t\t\t{\n\t\t\t\t\t\treturn LuaDLL.lua_toboolean(l, p);\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TFUNCTION:\n\t\t\t\t\t{\n\t\t\t\t\t\tLuaFunction v;\n\t\t\t\t\t\tLuaObject.checkType(l, p, out v);\n\t\t\t\t\t\treturn v;\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TTABLE:\n\t\t\t\t\t{\n\t\t\t\t\t\tif (isLuaValueType(l, p))\n\t\t\t\t\t\t{\n#if !SLUA_STANDALONE\n\t\t\t\t\t\t\tif (luaTypeCheck(l, p, \"Vector2\"))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tVector2 v;\n\t\t\t\t\t\t\t\tcheckType(l, p, out v);\n\t\t\t\t\t\t\t\treturn v;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (luaTypeCheck(l, p, \"Vector3\"))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tVector3 v;\n\t\t\t\t\t\t\t\tcheckType(l, p, out v);\n\t\t\t\t\t\t\t\treturn v;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (luaTypeCheck(l, p, \"Vector4\"))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tVector4 v;\n\t\t\t\t\t\t\t\tcheckType(l, p, out v);\n\t\t\t\t\t\t\t\treturn v;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (luaTypeCheck(l, p, \"Quaternion\"))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tQuaternion v;\n\t\t\t\t\t\t\t\tcheckType(l, p, out v);\n\t\t\t\t\t\t\t\treturn v;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (luaTypeCheck(l, p, \"Color\"))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tColor c;\n\t\t\t\t\t\t\t\tcheckType(l, p, out c);\n\t\t\t\t\t\t\t\treturn c;\n\t\t\t\t\t\t\t}\n#endif\n\t\t\t\t\t\t\tLogger.LogError(\"unknown lua value type\");\n\t\t\t\t\t\t\treturn null;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (isLuaClass(l, p))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturn checkObj(l, p);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tLuaTable v;\n\t\t\t\t\t\t\tcheckType(l,p,out v);\n\t\t\t\t\t\t\treturn v;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\tcase LuaTypes.LUA_TUSERDATA:\n\t\t\t\t\treturn LuaObject.checkObj(l, p);\n                case LuaTypes.LUA_TTHREAD:\n                    {\n                        LuaThread lt;\n                        LuaObject.checkType(l, p, out lt);\n                        return lt;\n                    }\n\t\t\t\tdefault:\n\t\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\n\t\tpublic static void pushValue(IntPtr l, object o)\n\t\t{\n\t\t\tpushVar(l, o);\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, Array a)\n\t\t{\n\t\t\tpushObject(l, a);\n\t\t}\n\n\t\tpublic static void pushVar(IntPtr l, object o)\n\t\t{\n\t\t\tif (o == null)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\t\treturn;\n\t\t\t}\n\n\n\t\t\tType t = o.GetType();\n\n\n\t\t\tPushVarDelegate push;\n\t\t\tif (typePushMap.TryGetValue(t, out push))\n\t\t\t\tpush(l, o);\n\t\t\telse if (t.IsEnum)\n\t\t\t{\n\t\t\t\tpushEnum(l, Convert.ToInt32(o));\n\t\t\t}\n\t\t\telse if (t.IsArray)\n\t\t\t\tpushObject(l, (Array)o);\n\t\t\telse\n\t\t\t\tpushObject(l, o);\n\n\t\t}\n\n\n\n\t\tpublic static T checkSelf<T>(IntPtr l)\n\t\t{\n\t\t\tobject o = checkObj(l, 1);\n\t\t\tif (o != null)\n\t\t\t{\n\t\t\t\treturn (T)o;\n\t\t\t}\n\t\t\tthrow new Exception(\"arg 1 expect self, but get null\");\n\t\t}\n\n\t\tpublic static object checkSelf(IntPtr l)\n\t\t{\n\t\t\tobject o = checkObj(l, 1);\n\t\t\tif (o == null)\n\t\t\t\tthrow new Exception(\"expect self, but get null\");\n\t\t\treturn o;\n\t\t}\n\n\t\tpublic static void setBack(IntPtr l, object o)\n\t\t{\n\t\t\tObjectCache t = ObjectCache.get(l);\n\t\t\tt.setBack(l, 1, o);\n\t\t}\n\n#if !SLUA_STANDALONE\n\t\tpublic static void setBack(IntPtr l, Vector3 v)\n\t\t{\n\t\t\tLuaDLL.luaS_setDataVec(l, 1, v.x, v.y, v.z, float.NaN);\n\t\t}\n\n\t\tpublic static void setBack(IntPtr l, Vector2 v)\n\t\t{\n\t\t\tLuaDLL.luaS_setDataVec(l, 1, v.x, v.y, float.NaN, float.NaN);\n\t\t}\n\n\t\tpublic static void setBack(IntPtr l, Vector4 v)\n\t\t{\n\t\t\tLuaDLL.luaS_setDataVec(l, 1, v.x, v.y, v.z, v.w);\n\t\t}\n\n\t\tpublic static void setBack(IntPtr l, Quaternion v)\n\t\t{\n\t\t\tLuaDLL.luaS_setDataVec(l, 1, v.x, v.y, v.z, v.w);\n\t\t}\n\n        public static void setBack(IntPtr l, Color v)\n        {\n            LuaDLL.luaS_setDataVec(l, 1, v.r, v.g, v.b, v.a);\n        }\n#endif\n\n        public static int extractFunction(IntPtr l, int p)\n\t\t{\n\t\t\tint op = 0;\n\t\t\tLuaTypes t = LuaDLL.lua_type(l, p);\n\t\t\tswitch (t)\n\t\t\t{\n\t\t\t\tcase LuaTypes.LUA_TNIL:\n\t\t\t\tcase LuaTypes.LUA_TUSERDATA:\n\t\t\t\t\top = 0;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase LuaTypes.LUA_TTABLE:\n\n\t\t\t\t\tLuaDLL.lua_rawgeti(l, p, 1);\n\t\t\t\t\tLuaDLL.lua_pushstring(l, \"+=\");\n\t\t\t\t\tif (LuaDLL.lua_rawequal(l, -1, -2) == 1)\n\t\t\t\t\t\top = 1;\n\t\t\t\t\telse\n\t\t\t\t\t\top = 2;\n\n\t\t\t\t\tLuaDLL.lua_pop(l, 2);\n\t\t\t\t\tLuaDLL.lua_rawgeti(l, p, 2);\n\t\t\t\t\tbreak;\n\t\t\t\tcase LuaTypes.LUA_TFUNCTION:\n\t\t\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tthrow new Exception(\"expect valid Delegate\");\n\t\t\t}\n\t\t\treturn op;\n\t\t}\n\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int noConstructor(IntPtr l)\n\t\t{\n\t\t\treturn error(l, \"Can't new this object\");\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int typeToString(IntPtr l)\n\t\t{\n\t\t\tLuaDLL.lua_pushstring (l, \"__fullname\");\n\t\t\tLuaDLL.lua_rawget (l, -2);\n\t\t\treturn 1;\n\t\t}\n\n\t\tstatic public int error(IntPtr l,Exception e)\n\t\t{\n\t\t\tLuaDLL.lua_pushboolean(l, false);\n\t\t\tLuaDLL.lua_pushstring(l, e.ToString());\n\t\t\treturn 2;\n\t\t}\n\n\t\tstatic public int error(IntPtr l, string err)\n\t\t{\n\t\t\tLuaDLL.lua_pushboolean(l, false);\n\t\t\tLuaDLL.lua_pushstring(l, err);\n\t\t\treturn 2;\n\t\t}\n\n\t\tstatic public int error(IntPtr l, string err, params object[] args)\n\t\t{\n\t\t\terr = string.Format(err, args);\n\t\t\tLuaDLL.lua_pushboolean(l, false);\n\t\t\tLuaDLL.lua_pushstring(l, err);\n\t\t\treturn 2;\n\t\t}\n\n\t\tstatic public int ok(IntPtr l)\n\t\t{\n\t\t\tLuaDLL.lua_pushboolean(l, true);\n\t\t\treturn 1;\n\t\t}\n\n\t\tstatic public int ok(IntPtr l, int retCount)\n\t\t{\n\t\t\tLuaDLL.lua_pushboolean(l, true);\n\t\t\tLuaDLL.lua_insert(l, -(retCount + 1));\n\t\t\treturn retCount + 1;\n\t\t}\n\n\t\tstatic public void assert(bool cond,string err) {\n\t\t\tif(!cond) throw new Exception(err);\n\t\t}\n\n        /// <summary>\n        /// Change Type, alternative for Convert.ChangeType, but has exception handling\n        /// change fail, return origin value directly, useful for some LuaVarObject value assign\n        /// </summary>\n        /// <param name=\"obj\"></param>\n        /// <param name=\"t\"></param>\n        /// <returns></returns>\n\t    static public object changeType(object obj, Type t)\n        {\n            if (t == typeof (object)) return obj;\n            if (obj.GetType() == t) return obj;\n\n            try\n            {\n                return Convert.ChangeType(obj, t);\n            }\n            catch\n            {\n                return obj;\n            }\n\t    }\n\t}\n\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c3e10330570bc6e499fd43003c34a514\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject_basetype.cs",
    "content": "// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nusing System.Collections;\nusing System.Collections.Generic;\nusing System;\nusing System.Reflection;\nusing System.Runtime.InteropServices;\nnamespace SLua\n{\n\n/* https://msdn.microsoft.com/zh-cn/library/s1ax56ch.aspx\n * \n * null\t\t\t\t\t\t\t\tLUA_TNIL\n * Value Types:\n * \tenum\n * \tstruct:\n * \t\tNumeric types: \n *\t \t\tIntegral Types: \t\tLUA_TNUMBER\n * \t\t\t\tsbyte  = SByte\n * \t\t\t\tbyte   = Byte\n * \t\t\t\tchar   = Char\n * \t\t\t\tshort  = Int16\n * \t\t\t\tushort = UInt16\n * \t\t\t\tint\t   = Int32\n * \t\t\t\tuint   = UInt32\n * \t\t\t\tlong   = Int64\n * \t\t\t\tulong  = UInt64\n * \t\t\tFloating-Point Types: \tLUA_TNUMBER\n * \t\t\t\tfloat  = Single\n * \t\t\t\tdouble = Double\n * \t\tbool = Boolean\t\t\t\tLUA_TBOOLEAN\n * \t\tUser defined structs\t\tLUA_TTABLE(Vector...) || non_cached@LUA_TUSERDATA\n * Reference Types:\n *  string\t\t\t\t\t\t\tLUA_TSTRING\n * \tdelegate\t\t\t\t\t\tLUA_TFUNCTION\n * \tclass、System.Type\t\t\t\tLUA_TTABLE || cached@LUA_TUSERDATA\n * \tobject\t\t\t\t\t\t\tcached@LUA_TUSERDATA\n *  char[]\t\t\t\t\t\t\tLUA_TSTRING\n * \tT[]\t\t\t\t\t\t\t\tLUA_TTABLE limit support\n *  interface, dynamic \t\t\t\tunsupport\n * IntPtr\t\t\t\t\t\t\tLUA_TLIGHTUSERDATA\n * \n * \n * every type should implement: \n * \t\tpublic static bool checkType(IntPtr l, int p, out T v)\n *\t\tpublic static void pushValue(IntPtr l, T v)\n * \n*/\t\n\tpublic partial class LuaObject\n\t{\n#region enum\n\t\tstatic public bool checkEnum<T>(IntPtr l, int p, out T o) where T : struct\n\t\t{\n\t\t\tint i = (int) LuaDLL.luaL_checkinteger (l, p);\n\t\t\to = (T)Enum.ToObject(typeof(T), i);\n\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushEnum(IntPtr l, int e)\n\t\t{\n\t\t\tpushValue(l, e);\n\t\t}\n#endregion\n\n#region Integral Types\n\t#region sbyte\n\t\tpublic static bool checkType(IntPtr l, int p, out sbyte v)\n\t\t{\n\t\t\tv = (sbyte)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, sbyte v)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, v);\n\t\t}\n\n\t#endregion\n\n\t\t#region byte\n\t\tstatic public bool checkType(IntPtr l, int p, out byte v)\n\t\t{\n\t\t\tv = (byte)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, byte i)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, i);\n\t\t}\n\n\t\t// why doesn't have a checkArray<byte[]> function accept lua string?\n\t\t// I think you should did a Buffer class to wrap byte[] pass/accept between mono and lua vm\n\t\t#endregion\n\n\t\t#region char\n\t\tstatic public bool checkType(IntPtr l, int p,out char c)\n\t\t{\n\t\t\tc = (char)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, char v)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, v);\n\t\t}\n\n\t\tstatic public bool checkArray(IntPtr l, int p, out char[] pars)\n\t\t{\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TSTRING);\n\t\t\tstring s;\n\t\t\tcheckType(l, p, out s);\n\t\t\tpars = s.ToCharArray();\n\t\t\treturn true;\n\t\t}\n\t\t#endregion\n\n\t\t#region short\n\t\tstatic public bool checkType(IntPtr l, int p, out short v)\n\t\t{\n\t\t\tv = (short)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, short i)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, i);\n\t\t}\n\t\t#endregion\n\n\t\t#region ushort\n\t\tstatic public bool checkType(IntPtr l, int p, out ushort v)\n\t\t{\n\t\t\tv = (ushort)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n                \n\t\tpublic static void pushValue(IntPtr l, ushort v)\n\t\t{\n\t\t    LuaDLL.lua_pushinteger(l, v);\n\t\t}\n               \n\t\t#endregion\n\n\t\t#region int\n\t\tstatic public bool checkType(IntPtr l, int p, out int v)\n\t\t{\n\t\t\tv = (int)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n                \n\t\tpublic static void pushValue(IntPtr l, int i)\n\t\t{\n\t\t\tLuaDLL.lua_pushinteger(l, i);\n\t\t}\n\t\t\n\t\t#endregion\n\t\t\n\t\t#region uint\n\t\tstatic public bool checkType(IntPtr l, int p, out uint v)\n\t\t{\n\t\t\tv = (uint)LuaDLL.luaL_checkinteger(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, uint o)\n\t\t{\n\t\t\tLuaDLL.lua_pushnumber(l, o);\n\t\t}\n\t\t#endregion\n\n\t\t#region long\n\t\tstatic public bool checkType(IntPtr l, int p, out long v)\n\t\t{\n#if LUA_5_3\n            v = (long)LuaDLL.luaL_checkinteger(l, p);\n#else\n\t\t\tv = (long)LuaDLL.luaL_checknumber(l, p);\n#endif\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, long i)\n\t\t{\n#if LUA_5_3\n            LuaDLL.lua_pushinteger(l,i);\n#else\n\t\t\tLuaDLL.lua_pushnumber(l, i);\n#endif\n\t\t}\n\t\t\n\t\t#endregion\n\n\t\t#region ulong\n\t\tstatic public bool checkType(IntPtr l, int p, out ulong v)\n\t\t{\n#if LUA_5_3\n\t\t\tv = (ulong)LuaDLL.luaL_checkinteger(l, p);\n#else\n\t\t\tv = (ulong)LuaDLL.luaL_checknumber(l, p);\n#endif\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, ulong o)\n\t\t{\n\t\t\t#if LUA_5_3\n\t\t\tLuaDLL.lua_pushinteger(l, (long)o);\n\t\t\t#else\n\t\t\tLuaDLL.lua_pushnumber(l, o);\n\t\t\t#endif\n\t\t}\n\t\t#endregion\n\t\t\n\n#endregion\n\n#region Floating-Point Types\n\t\t#region float\n\t\tpublic static bool checkType(IntPtr l, int p, out float v)\n\t\t{\n\t\t\tv = (float)LuaDLL.luaL_checknumber(l, p);\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, float o)\n\t\t{\n\t\t\tLuaDLL.lua_pushnumber(l, o);\n\t\t}\n\t\t\n\t\t#endregion\n\n\t\t#region double\n\t\tstatic public bool checkType(IntPtr l, int p, out double v)\n\t\t{\n\t\t\tv = LuaDLL.luaL_checknumber(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, double d)\n\t\t{\n\t\t\tLuaDLL.lua_pushnumber(l, d);\n\t\t}\n\t\t\n\t\t#endregion\n#endregion\n\n\t\t#region bool\n\t\tstatic public bool checkType(IntPtr l, int p, out bool v)\n\t\t{\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TBOOLEAN);\n\t\t\tv = LuaDLL.lua_toboolean(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, bool b)\n\t\t{\n\t\t\tLuaDLL.lua_pushboolean(l, b);\n\t\t}\n\t\n\t\t#endregion\n\n\t\t#region string\n\t\tstatic public bool checkType(IntPtr l, int p, out string v)\n\t\t{\n\t\t\tif(LuaDLL.lua_isuserdata(l,p)>0)\n\t\t\t{\n\t\t\t\tobject o = checkObj(l, p);\n\t\t\t\tif (o is string)\n\t\t\t\t{\n\t\t\t\t\tv = o as string;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (LuaDLL.lua_isstring(l, p))\n\t\t\t{\n\t\t\t\tv = LuaDLL.lua_tostring(l, p);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t\tv = null;\n\t\t\treturn false;\n\t\t}\n\n\t\tstatic public bool checkBinaryString(IntPtr l,int p,out byte[] bytes){\n\t\t\tif(LuaDLL.lua_isstring(l,p)){\n\t\t\t\tbytes = LuaDLL.lua_tobytes(l, p);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tbytes = null;\n\t\t\treturn false;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, string s)\n\t\t{\n\t\t\tLuaDLL.lua_pushstring(l, s);\n\t\t}\n\t\t\n\n\t\t#endregion\n\n\t\t#region IntPtr\n\t\tstatic public bool checkType(IntPtr l, int p, out IntPtr v)\n\t\t{\n\t\t\tv = LuaDLL.lua_touserdata(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t#endregion\n\n\t\t#region LuaType\n\t\tstatic public bool checkType(IntPtr l, int p, out LuaDelegate f)\n\t\t{\n\t\t\tLuaState state = LuaState.get(l);\n\n\t\t\tp = LuaDLL.lua_absindex(l, p);\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TFUNCTION);\n\n\t\t\tLuaDLL.lua_getglobal(l, DelgateTable);\n\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\tLuaDLL.lua_gettable(l, -2); // find function in __LuaDelegate table\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{ // not found\n\t\t\t\tLuaDLL.lua_pop(l, 1); // pop nil\n\t\t\t\tf = newDelegate(l, p);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint fref = LuaDLL.lua_tointeger(l, -1);\n\t\t\t\tLuaDLL.lua_pop(l, 1); // pop ref value;\n\t\t\t\tf = state.delgateMap[fref];\n\t\t\t\tif (f == null)\n\t\t\t\t{\n\t\t\t\t\tf = newDelegate(l, p);\n\t\t\t\t}\n\t\t\t}\n\t\t\tLuaDLL.lua_pop(l, 1); // pop DelgateTable\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tstatic public bool checkType(IntPtr l, int p, out LuaThread lt)\n\t\t{\n\t\t\tif (LuaDLL.lua_isnil(l, p))\n\t\t\t{\n\t\t\t\tlt = null;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TTHREAD);\n\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\tint fref = LuaDLL.luaL_ref(l, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t\tlt = new LuaThread(l, fref);\n\t\t\treturn true;\n\t\t}\n\n        static public bool checkType(IntPtr l, int p, out LuaFunction f)\n\t\t{\n\t\t\tif (LuaDLL.lua_isnil(l, p))\n\t\t\t{\n\t\t\t\tf = null;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TFUNCTION);\n\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\tint fref = LuaDLL.luaL_ref(l, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t\tf = new LuaFunction(l, fref);\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkType(IntPtr l, int p, out LuaTable t)\n\t\t{\n\t\t\tif (LuaDLL.lua_isnil(l, p))\n\t\t\t{\n\t\t\t\tt = null;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tLuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TTABLE);\n\t\t\tLuaDLL.lua_pushvalue(l, p);\n\t\t\tint fref = LuaDLL.luaL_ref(l, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t\tt = new LuaTable(l, fref);\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, LuaCSFunction f)\n\t\t{\n\t\t\tLuaState.pushcsfunction (l, f);\n\t\t}\n\t\t\n\t\tpublic static void pushValue(IntPtr l, LuaTable t)\n\t\t{\n\t\t\tif (t == null)\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\telse\n\t\t\t\tt.push(l);\n\t\t}\n\t\t#endregion\n\n\t\t#region Type\n\t\tprivate static Type MonoType = typeof(Type).GetType();\n\n\t\tpublic static Type FindType(string qualifiedTypeName) \n\t\t{\n\t\t\tType t = Type.GetType(qualifiedTypeName);\n\n\t\t\tif (t != null)\n\t\t\t{\n\t\t\t\treturn t;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tAssembly[] Assemblies = AppDomain.CurrentDomain.GetAssemblies();\n\t\t\t\tfor (int n = 0; n < Assemblies.Length;n++ )\n\t\t\t\t{\n\t\t\t\t\tAssembly asm = Assemblies[n];\n\t\t\t\t\tt = asm.GetType(qualifiedTypeName);\n\t\t\t\t\tif (t != null)\n\t\t\t\t\t\treturn t;\n\t\t\t\t}\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Type t)\n\t\t{\n\t\t\tstring tname = null;\n\t\t\tLuaTypes lt = LuaDLL.lua_type(l, p);\n            switch (lt)\n            {\n                case LuaTypes.LUA_TUSERDATA:\n                    object o = checkObj(l, p);\n                    if (o.GetType() != MonoType)\n                        throw new Exception(string.Format(\"{0} expect Type, got {1}\", p, o.GetType().Name));\n                    t = (Type)o;\n\t\t\t\t\treturn true;\n                case LuaTypes.LUA_TTABLE:\n                    LuaDLL.lua_pushstring(l, \"__type\");\n                    LuaDLL.lua_rawget(l, p);\n                    if (!LuaDLL.lua_isnil(l, -1))\n                    {\n                        t = (Type)checkObj(l, -1);\n                        LuaDLL.lua_pop(l, 1);\n                        return true;\n                    }\n                    else\n                    {\n                        LuaDLL.lua_pushstring(l, \"__fullname\");\n                        LuaDLL.lua_rawget(l, p);\n                        tname = LuaDLL.lua_tostring(l, -1);\n                        LuaDLL.lua_pop(l, 2);\n                    }\n                    break;\n\n                case LuaTypes.LUA_TSTRING:\n                    checkType(l, p, out tname);\n                    break;\n            }\n\n\t\t\tif (tname == null)\n\t\t\t\tthrow new Exception(\"expect string or type table\");\n\n\t\t\tt = LuaObject.FindType(tname);\n            if (t != null && lt==LuaTypes.LUA_TTABLE)\n            {\n                LuaDLL.lua_pushstring(l, \"__type\");\n\t\t\t\tpushLightObject(l, t);\n                LuaDLL.lua_rawset(l, p);\n            }\n\t\t\treturn t != null;\n\t\t}\n\t\t#endregion\n\n\t\t#region struct\n\t\tstatic public bool checkValueType<T>(IntPtr l, int p, out T v) where T:struct\n\t\t{\n\t\t\tv = (T) checkObj(l, p);\n\t\t\treturn true;\n\t\t}\n\t\t#endregion\n\n\t\tstatic public bool checkNullable<T>(IntPtr l, int p, out Nullable<T> v) where T : struct\n\t\t{\n\t\t\tif (LuaDLL.lua_isnil(l, p))\n\t\t\t\tv = null;\n\t\t\telse\n\t\t\t{\n\t\t\t\tobject o=checkVar(l, p, typeof(T));\n\t\t\t\tif (o == null) v = null;\n\t\t\t\telse v = new Nullable<T>((T)o);\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\t#region object\n\t\tstatic public bool checkType<T>(IntPtr l, int p, out T o) where T:class\n\t\t{\n\t\t\tobject obj = checkVar(l, p);\n\t\t\tif (obj == null)\n\t\t\t{\n\t\t\t\to = null;\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\to = obj as T;\n\t\t\tif (o == null)\n\t\t\t\tthrow new Exception(string.Format(\"arg {0} is not type of {1}\", p, typeof(T).Name));\n\n\t\t\treturn true;\n\t\t}\n\t\t#endregion\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject_basetype.cs.meta",
    "content": "fileFormatVersion: 2\nguid: a0acddae4da724dcab4ad4ee0c0a97ca\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject_overload.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n#if !SLUA_STANDALONE\nnamespace SLua\n{\n\tusing UnityEngine;\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n\tusing System;\n\tusing System.Reflection;\n\tusing System.Runtime.InteropServices;\n\n\tpublic partial class LuaObject\n\t{\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Vector4 v)\n\t\t{\n\t\t\tfloat x, y, z, w;\n\t\t\tif(LuaDLL.luaS_checkVector4(l, p, out x, out y, out z, out w)!=0)\n\t\t\t\tthrow new Exception(string.Format(\"Invalid vector4 argument at {0}\", p));\n\t\t\tv = new Vector4(x, y, z, w);\n\t\t\treturn true;\n\t\t}\n\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Vector3 v)\n\t\t{\n\t\t\tfloat x, y, z;\n\t\t\tif(LuaDLL.luaS_checkVector3(l, p, out x, out y, out z)!=0)\n\t\t\t\tthrow new Exception(string.Format(\"Invalid vector3 argument at {0}\", p));\n\t\t\tv = new Vector3(x, y, z);\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Vector2 v)\n\t\t{\n\t\t\tfloat x, y;\n\t\t\tif(LuaDLL.luaS_checkVector2(l, p, out x, out y)!=0)\n\t\t\t\tthrow new Exception(string.Format(\"Invalid vector2 argument at {0}\", p));\n\t\t\tv = new Vector2(x, y);\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Quaternion q)\n\t\t{\n\t\t\tfloat x, y, z, w;\n\t\t\tif(LuaDLL.luaS_checkQuaternion(l, p, out x, out y, out z, out w)!=0)\n\t\t\t\tthrow new Exception(string.Format(\"Invalid quaternion argument at {0}\", p));\n\t\t\tq = new Quaternion(x, y, z, w);\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkType(IntPtr l, int p, out Color c)\n\t\t{\n\t\t\tfloat x, y, z, w;\n\t\t\tif (LuaDLL.lua_type (l, p) == LuaTypes.LUA_TUSERDATA) {\n\t\t\t\tobject o = checkObj(l,p);\n\t\t\t\tif(o is Color32) {\n\t\t\t\t\tc = (Color32)o;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tthrow new Exception(string.Format(\"Invalid color argument at {0}\", p));\n\t\t\t}\n\t\t\tif (LuaDLL.luaS_checkColor(l, p, out x, out y, out z, out w) != 0)\n\t\t\t\tthrow new Exception(string.Format(\"Invalid color argument at {0}\", p));\n\t\t\tc = new Color(x, y, z, w);\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkType(IntPtr l, int p, out LayerMask lm)\n\t\t{\n\t\t\tint v;\n\t\t\tcheckType(l, p, out v);\n\t\t\tlm = v;\n\t\t\treturn true;\n\t\t}\n\n\t\tstatic public bool checkParams(IntPtr l, int p, out Vector2[] pars)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\tif (top - p >= 0)\n\t\t\t{\n\t\t\t\tpars = new Vector2[top - p + 1];\n\t\t\t\tfor (int n = p, k = 0; n <= top; n++, k++)\n\t\t\t\t{\n\t\t\t\t\tcheckType(l, n, out pars[k]);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tpars = new Vector2[0];\n\t\t\treturn true;\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, RaycastHit2D r)\n\t\t{\n\t\t\tpushObject(l, r);\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, RaycastHit r)\n\t\t{\n\t\t\tpushObject(l, r);\n\t\t}\n\n        public static void pushValue(IntPtr l, UnityEngine.AnimationState o)\n        {\n            if (o == null)\n                LuaDLL.lua_pushnil(l);\n            else\n                pushObject(l, o);\n        }\n\n        public static void pushValue(IntPtr l, UnityEngine.Object o)\n\t\t{\n\t\t\tif (o == null)\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\telse\n\t\t\t\tpushObject(l, o);\n\t\t}\n\t\n\t\tpublic static void pushValue(IntPtr l, Quaternion o)\n\t\t{\n\t\t\tLuaDLL.luaS_pushQuaternion(l, o.x, o.y, o.z, o.w);\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, Vector2 o)\n\t\t{\n\t\t\tLuaDLL.luaS_pushVector2(l, o.x, o.y);\n\t\t}\n\n\n\n\t\tpublic static void pushValue(IntPtr l, Vector3 o)\n\t\t{\n\t\t\tLuaDLL.luaS_pushVector3(l, o.x, o.y, o.z);\n\t\t}\n\n\n\n\t\tpublic static void pushValue(IntPtr l, Vector4 o)\n\t\t{\n\t\t\tLuaDLL.luaS_pushVector4(l, o.x, o.y, o.z, o.w);\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, Color o)\n\t\t{\n\t\t\tLuaDLL.luaS_pushColor(l, o.r, o.g, o.b, o.a);\n\t\t}\n\n\t\tpublic static void pushValue(IntPtr l, Color32 c32) {\n\t\t\tpushObject(l, c32); \n\t\t}\n\t}\n}\n#endif"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaObject_overload.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 67c9d7596571b7d46b0cae425f7f0a29\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaState.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\nnamespace SLua\n{\n\tusing System;\n\tusing System.Collections.Generic;\n\tusing System.Collections;\n\tusing System.IO;\n\tusing System.Text;\n\tusing System.Runtime.InteropServices;\n#if !SLUA_STANDALONE\n    using UnityEngine;\n#endif\n\tabstract public class LuaVar : IDisposable\n\t{\n\t\tprotected LuaState state = null;\n\t\tprotected int valueref = 0;\n\n\n\n\t\tpublic IntPtr L\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn state.L;\n\t\t\t}\n\t\t}\n\n\t\tpublic int Ref\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn valueref;\n\t\t\t}\n\t\t}\n\n\t\tpublic LuaVar()\n\t\t{\n\t\t\tstate = null;\n\t\t}\n\n\t\tpublic LuaVar(LuaState l, int r)\n\t\t{\n\t\t\tstate = l;\n\t\t\tvalueref = r;\n\t\t}\n\n\t\tpublic LuaVar(IntPtr l, int r)\n\t\t{\n\t\t\tstate = LuaState.get(l);\n\t\t\tvalueref = r;\n\t\t}\n\n\t\t~LuaVar()\n\t\t{\n\t\t\tDispose(false);\n\t\t}\n\n\t\tpublic void Dispose()\n\t\t{\n\t\t\tDispose(true);\n\t\t\tGC.SuppressFinalize(this);\n\t\t}\n\n\t\tpublic virtual void Dispose(bool disposeManagedResources)\n\t\t{\n\t\t\tif (valueref != 0)\n\t\t\t{\n\t\t\t\tLuaState.UnRefAction act = (IntPtr l, int r) =>\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_unref(l, r);\n\t\t\t\t};\n\t\t\t\tstate.gcRef(act, valueref);\n\t\t\t\tvalueref = 0;\n\t\t\t}\n\t\t}\n\n\t\tpublic void push(IntPtr l)\n\t\t{\n\t\t\tLuaDLL.lua_getref(l, valueref);\n\t\t}\n\n\t\tpublic override int GetHashCode()\n\t\t{\n\t\t\treturn base.GetHashCode();\n\t\t}\n\n\t\tpublic override bool Equals(object obj)\n\t\t{\n\t\t\tif (obj is LuaVar)\n\t\t\t{\n\t\t\t\treturn this == (LuaVar)obj;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\tpublic static bool operator ==(LuaVar x, LuaVar y)\n\t\t{\n\t\t\tif ((object)x == null || (object)y == null)\n\t\t\t\treturn (object)x == (object)y;\n\n\t\t\treturn Equals(x, y) == 1;\n\t\t}\n\n\t\tpublic static bool operator !=(LuaVar x, LuaVar y)\n\t\t{\n\t\t\tif ((object)x == null || (object)y == null)\n\t\t\t\treturn (object)x != (object)y;\n\n\t\t\treturn Equals(x, y) != 1;\n\t\t}\n\n\t\tstatic int Equals(LuaVar x, LuaVar y)\n\t\t{\n\t\t\tx.push(x.L);\n\t\t\ty.push(x.L);\n\t\t\tint ok = LuaDLL.lua_equal(x.L, -1, -2);\n\t\t\tLuaDLL.lua_pop(x.L, 2);\n\t\t\treturn ok;\n\t\t}\n\t}\n\n\tpublic class LuaThread : LuaVar\n\t{\n\t\tpublic LuaThread(IntPtr l, int r)\n\t\t\t: base(l, r)\n\t\t{ }\n\t}\n\n\tpublic class LuaDelegate : LuaFunction\n\t{\n\t\tpublic object d;\n\n\t\tpublic LuaDelegate(IntPtr l, int r)\n\t\t\t: base(l, r)\n\t\t{\n\t\t}\n\n\t\tpublic override void Dispose(bool disposeManagedResources)\n\t\t{\n\t\t\tif (valueref != 0)\n\t\t\t{\n\t\t\t\tLuaState.UnRefAction act = (IntPtr l, int r) =>\n\t\t\t\t{\n\t\t\t\t\tLuaObject.removeDelgate(l, r);\n\t\t\t\t\tLuaDLL.lua_unref(l, r);\n\t\t\t\t};\n\t\t\t\tstate.gcRef(act, valueref);\n\t\t\t\tvalueref = 0;\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tpublic class LuaFunction : LuaVar\n\t{\n\t\tpublic LuaFunction(LuaState l, int r)\n\t\t\t: base(l, r)\n\t\t{\n\t\t}\n\n\t\tpublic LuaFunction(IntPtr l, int r)\n\t\t\t: base(l, r)\n\t\t{\n\t\t}\n\n\t\tpublic bool pcall(int nArgs, int errfunc)\n\t\t{\n\n\t\t\tif (!state.isMainThread())\n\t\t\t{\n\t\t\t\tLogger.LogError(\"Can't call lua function in bg thread\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tLuaDLL.lua_getref(L, valueref);\n\n\t\t\tif (!LuaDLL.lua_isfunction(L, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t\t\tthrow new Exception(\"Call invalid function.\");\n\t\t\t}\n\n\t\t\tLuaDLL.lua_insert(L, -nArgs - 1);\n\t\t\tif (LuaDLL.lua_pcall(L, nArgs, -1, errfunc) != 0)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tbool innerCall(int nArgs, int errfunc)\n\t\t{\n\t\t\tbool ret = pcall(nArgs, errfunc);\n\t\t\tLuaDLL.lua_remove(L, errfunc);\n\t\t\treturn ret;\n\t\t}\n\n\n\t\tpublic object call()\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\t\t\tif (innerCall(0, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic object call(params object[] args)\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\n\t\t\tfor (int n = 0; args != null && n < args.Length; n++)\n\t\t\t{\n\t\t\t\tLuaObject.pushVar(L, args[n]);\n\t\t\t}\n\n\t\t\tif (innerCall(args != null ? args.Length : 0, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic object call(object a1)\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\n\t\t\tLuaObject.pushVar(state.L, a1);\n\t\t\tif (innerCall(1, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\n\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic object call(LuaTable self, params object[] args)\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\n\t\t\tLuaObject.pushVar(L, self);\n\n\t\t\tfor (int n = 0; args != null && n < args.Length; n++)\n\t\t\t{\n\t\t\t\tLuaObject.pushVar(L, args[n]);\n\t\t\t}\n\n\t\t\tif (innerCall((args != null ? args.Length : 0)+1, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic object call(object a1, object a2)\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\n\t\t\tLuaObject.pushVar(state.L, a1);\n\t\t\tLuaObject.pushVar(state.L, a2);\n\t\t\tif (innerCall(2, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic object call(object a1, object a2, object a3)\n\t\t{\n\t\t\tint error = LuaObject.pushTry(state.L);\n\n\t\t\tLuaObject.pushVar(state.L, a1);\n\t\t\tLuaObject.pushVar(state.L, a2);\n\t\t\tLuaObject.pushVar(state.L, a3);\n\t\t\tif (innerCall(3, error))\n\t\t\t{\n\t\t\t\treturn state.topObjects(error - 1);\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\n\t\t// you can add call method with specific type rather than object type to avoid gc alloc, like\n\t\t// public object call(int a1,float a2,string a3,object a4)\n\t\t\n\t\t// using specific type to avoid type boxing/unboxing\n\t}\n\n\tpublic class LuaTable : LuaVar, IEnumerable<LuaTable.TablePair>\n\t{\n\n\n\t\tpublic struct TablePair\n\t\t{\n\t\t\tpublic object key;\n\t\t\tpublic object value;\n\t\t}\n\t\tpublic LuaTable(IntPtr l, int r)\n\t\t\t: base(l, r)\n\t\t{\n\t\t}\n\n\t\tpublic LuaTable(LuaState l, int r)\n\t\t\t: base(l, r)\n\t\t{\n\t\t}\n\n\t\tpublic LuaTable(LuaState state)\n\t\t\t: base(state, 0)\n\t\t{\n\n\t\t\tLuaDLL.lua_newtable(L);\n\t\t\tvalueref = LuaDLL.luaL_ref(L, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t}\n\t\tpublic object this[string key]\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn state.getObject(valueref, key);\n\t\t\t}\n\n\t\t\tset\n\t\t\t{\n\t\t\t\tstate.setObject(valueref, key, value);\n\t\t\t}\n\t\t}\n\n\t\tpublic object this[int index]\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn state.getObject(valueref, index);\n\t\t\t}\n\n\t\t\tset\n\t\t\t{\n\t\t\t\tstate.setObject(valueref, index, value);\n\t\t\t}\n\t\t}\n\n\t\tpublic object invoke(string func, params object[] args)\n\t\t{\n\t\t\tLuaFunction f = (LuaFunction)this[func];\n\t\t\tif (f != null)\n\t\t\t{\n\t\t\t\treturn f.call(args);\n\t\t\t}\n\t\t\tthrow new Exception(string.Format(\"Can't find {0} function\", func));\n\t\t}\n\n\t\tpublic int length()\n\t\t{\n\t\t\tint n = LuaDLL.lua_gettop(L);\n\t\t\tpush(L);\n\t\t\tint l = LuaDLL.lua_rawlen(L, -1);\n\t\t\tLuaDLL.lua_settop(L, n);\n\t\t\treturn l;\n\t\t}\n\n\t\tpublic class Enumerator : IEnumerator<TablePair>, IDisposable\n\t\t{\n\t\t\tLuaTable t;\n\t\t\tint indext = -1;\n\t\t\tTablePair current = new TablePair();\n\t\t\tint iterPhase = 0;\n\n\t\t\tpublic Enumerator(LuaTable table)\n\t\t\t{\n\t\t\t\tt = table;\n\t\t\t\tReset();\n\t\t\t}\n\n\t\t\tpublic bool MoveNext()\n\t\t\t{\n\t\t\t\tif (indext < 0)\n\t\t\t\t\treturn false;\n\n\t\t\t\tif (iterPhase == 0)\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pushnil(t.L);\n\t\t\t\t\titerPhase = 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tLuaDLL.lua_pop(t.L, 1);\n\n\t\t\t\tbool ret = LuaDLL.lua_next(t.L, indext) > 0;\n\t\t\t\tif (!ret) iterPhase = 2;\n\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\tpublic void Reset()\n\t\t\t{\n\t\t\t\tLuaDLL.lua_getref(t.L, t.Ref);\n\t\t\t\tindext = LuaDLL.lua_gettop(t.L);\n\t\t\t}\n\n\t\t\tpublic void Dispose()\n\t\t\t{\n\t\t\t\tif (iterPhase == 1)\n\t\t\t\t\tLuaDLL.lua_pop(t.L, 2);\n\n\t\t\t\tLuaDLL.lua_remove(t.L, indext);\n\t\t\t}\n\n\t\t\tpublic TablePair Current\n\t\t\t{\n\t\t\t\tget\n\t\t\t\t{\n\t\t\t\t\tcurrent.key = LuaObject.checkVar(t.L, -2);\n\t\t\t\t\tcurrent.value = LuaObject.checkVar(t.L, -1);\n\t\t\t\t\treturn current;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tobject IEnumerator.Current\n\t\t\t{\n\t\t\t\tget\n\t\t\t\t{\n\t\t\t\t\treturn Current;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic IEnumerator<TablePair> GetEnumerator()\n\t\t{\n\t\t\treturn new LuaTable.Enumerator(this);\n\t\t}\n\n\t\tIEnumerator IEnumerable.GetEnumerator()\n\t\t{\n\t\t\treturn GetEnumerator();\n\t\t}\n\n\t}\n\n\n\n\n\n\tpublic class LuaState : IDisposable\n\t{\n\t\tIntPtr l_;\n\t\tint mainThread = 0;\n\t\tinternal WeakDictionary<int, LuaDelegate> delgateMap = new WeakDictionary<int, LuaDelegate>();\n\n\t\tpublic IntPtr L\n\t\t{\n\t\t\tget\n\t\t\t{\n\n\t\t\t\tif (!isMainThread())\n\t\t\t\t{\n\t\t\t\t\tLogger.LogError(\"Can't access lua in bg thread\");\n\t\t\t\t\tthrow new Exception(\"Can't access lua in bg thread\");\n\t\t\t\t}\n\n\t\t\t\tif (l_ == IntPtr.Zero)\n\t\t\t\t{\n\t\t\t\t\tLogger.LogError(\"LuaState had been destroyed, can't used yet\");\n\t\t\t\t\tthrow new Exception(\"LuaState had been destroyed, can't used yet\");\n\t\t\t\t}\n\n\t\t\t\treturn l_;\n\t\t\t}\n\t\t\tset\n\t\t\t{\n\t\t\t\tl_ = value;\n\t\t\t}\n\t\t}\n\n\t\tpublic IntPtr handle\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn L;\n\t\t\t}\n\t\t}\n\n\t\tpublic delegate byte[] LoaderDelegate(string fn);\n\t\tpublic delegate void OutputDelegate(string msg);\n\n\t\tstatic public LoaderDelegate loaderDelegate;\n\t\tstatic public OutputDelegate logDelegate;\n\t\tstatic public OutputDelegate errorDelegate;\n\n\n\t\tpublic delegate void UnRefAction(IntPtr l, int r);\n\t\tstruct UnrefPair\n\t\t{\n\t\t\tpublic UnRefAction act;\n\t\t\tpublic int r;\n\t\t}\n\t\tQueue<UnrefPair> refQueue;\n\t\tpublic int PCallCSFunctionRef = 0;\n\n\n\t\tpublic static LuaState main;\n\t\tstatic Dictionary<IntPtr, LuaState> statemap = new Dictionary<IntPtr, LuaState>();\n\t\tstatic IntPtr oldptr = IntPtr.Zero;\n\t\tstatic LuaState oldstate = null;\n\t\tstatic public LuaCSFunction errorFunc = new LuaCSFunction(errorReport);\n\n\t\tpublic bool isMainThread()\n\t\t{\n\t\t\treturn System.Threading.Thread.CurrentThread.ManagedThreadId == mainThread;\n\t\t}\n\n\t\tstatic public LuaState get(IntPtr l)\n\t\t{\n\t\t\tif (l == oldptr)\n\t\t\t\treturn oldstate;\n\n\t\t\tLuaState ls;\n\t\t\tif (statemap.TryGetValue(l, out ls))\n\t\t\t{\n\t\t\t\toldptr = l;\n\t\t\t\toldstate = ls;\n\t\t\t\treturn ls;\n\t\t\t}\n\n\t\t\tLuaDLL.lua_getglobal(l, \"__main_state\");\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tIntPtr nl = LuaDLL.lua_touserdata(l, -1);\n\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\tif (nl != l)\n\t\t\t\treturn get(nl);\n\t\t\treturn null;\n\t\t}\n\n\t\tpublic LuaState()\n\t\t{\n\t\t\tmainThread = System.Threading.Thread.CurrentThread.ManagedThreadId;\n\n\t\t\tL = LuaDLL.luaL_newstate();\n\t\t\tstatemap[L] = this;\n\t\t\tif (main == null) main = this;\n\n\t\t\trefQueue = new Queue<UnrefPair>();\n\t\t\tObjectCache.make(L);\n\n\t\t\tLuaDLL.lua_atpanic(L, panicCallback);\n\n\t\t\tLuaDLL.luaL_openlibs(L);\n\n\t\t\tstring PCallCSFunction = @\"\nlocal assert = assert\nlocal function check(ok,...)\n\tassert(ok, ...)\n\treturn ...\nend\nreturn function(cs_func)\n\treturn function(...)\n\t\treturn check(cs_func(...))\n\tend\nend\n\";\n\n\t\t\tLuaDLL.lua_dostring(L, PCallCSFunction);\n\t\t\tPCallCSFunctionRef = LuaDLL.luaL_ref(L, LuaIndexes.LUA_REGISTRYINDEX);\n\n\t\t\tpcall(L, init);\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic int init(IntPtr L)\n\t\t{\n\t\t\tLuaDLL.lua_pushlightuserdata(L, L);\n\t\t\tLuaDLL.lua_setglobal(L, \"__main_state\");\n\n\t\t\tLuaDLL.lua_pushcfunction(L, print);\n\t\t\tLuaDLL.lua_setglobal(L, \"print\");\n\n\t\t\tLuaDLL.lua_pushcfunction(L, pcall);\n\t\t\tLuaDLL.lua_setglobal(L, \"pcall\");\n\n\t\t\tpushcsfunction(L, import);\n\t\t\tLuaDLL.lua_setglobal(L, \"import\");\n\n\n\t\t\tstring resumefunc = @\"\nlocal resume = coroutine.resume\nlocal function check(co, ok, err, ...)\n\tif not ok then UnityEngine.Debug.LogError(debug.traceback(co,err)) end\n\treturn ok, err, ...\nend\ncoroutine.resume=function(co,...)\n\treturn check(co, resume(co,...))\nend\n\";\n\n\t\t\t// overload resume function for report error\n\t\t\tLuaState.get(L).doString(resumefunc);\n\n#if UNITY_ANDROID\n\t\t\t// fix android performance drop with JIT on according to luajit mailist post\n\t\t\tLuaState.get(L).doString(\"if jit then require('jit.opt').start('sizemcode=256','maxmcode=256') for i=1,1000 do end end\");\n#endif\n\n\t\t\tpushcsfunction(L, dofile);\n\t\t\tLuaDLL.lua_setglobal(L, \"dofile\");\n\n\t\t\tpushcsfunction(L, loadfile);\n\t\t\tLuaDLL.lua_setglobal(L, \"loadfile\");\n\n\t\t\tpushcsfunction(L, loader);\n\t\t\tint loaderFunc = LuaDLL.lua_gettop(L);\n\n\t\t\tLuaDLL.lua_getglobal(L, \"package\");\n#if LUA_5_3\n\t\t\tLuaDLL.lua_getfield(L, -1, \"searchers\");\n#else\n\t\t\tLuaDLL.lua_getfield(L, -1, \"loaders\");\n#endif\n\t\t\tint loaderTable = LuaDLL.lua_gettop(L);\n\n\t\t\t// Shift table elements right\n\t\t\tfor (int e = LuaDLL.lua_rawlen(L, loaderTable) + 1; e > 2; e--)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_rawgeti(L, loaderTable, e - 1);\n\t\t\t\tLuaDLL.lua_rawseti(L, loaderTable, e);\n\t\t\t}\n\t\t\tLuaDLL.lua_pushvalue(L, loaderFunc);\n\t\t\tLuaDLL.lua_rawseti(L, loaderTable, 2);\n\t\t\tLuaDLL.lua_settop(L, 0);\n\t\t\treturn 0;\n\t\t}\n\n\t\tpublic void Close()\n\t\t{\n\t\t\tif (L != IntPtr.Zero)\n\t\t\t{\n\t\t\t\tif (LuaState.main == this)\n\t\t\t\t{\n\t\t\t\t\tLogger.Log(\"Finalizing Lua State.\");\n\t\t\t\t\t// be careful, if you close lua vm, make sure you don't use lua state again,\n\t\t\t\t\t// comment this line as default for avoid unexpected crash.\n\t\t\t\t\tLuaDLL.lua_close(L);\n\n\t\t\t\t\tObjectCache.del(L);\n\t\t\t\t\tObjectCache.clear();\n\n\t\t\t\t\tstatemap.Clear();\n\t\t\t\t\toldptr = IntPtr.Zero;\n\t\t\t\t\toldstate = null;\n\t\t\t\t\tL = IntPtr.Zero;\n\n\t\t\t\t\tLuaState.main = null;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tpublic void Dispose()\n\t\t{\n\t\t\tDispose(true);\n\t\t\tSystem.GC.Collect();\n\t\t\tSystem.GC.WaitForPendingFinalizers();\n\t\t}\n\n\t\tpublic virtual void Dispose(bool dispose)\n\t\t{\n\t\t\tif (dispose)\n\t\t\t{\n\t\t\t\tClose();\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tpublic static int errorReport(IntPtr L)\n\t\t{\n\t\t\tLuaDLL.lua_getglobal(L, \"debug\");\n\t\t\tLuaDLL.lua_getfield(L, -1, \"traceback\");\n\t\t\tLuaDLL.lua_pushvalue(L, 1);\n\t\t\tLuaDLL.lua_pushnumber(L, 2);\n\t\t\tLuaDLL.lua_call(L, 2, 1);\n\t\t\tLuaDLL.lua_remove(L, -2);\n            string error = LuaDLL.lua_tostring(L, -1);\n\t\t\tLuaDLL.lua_pop(L, 1);\n\n            Logger.LogError(error, true);\n            if (errorDelegate != null)\n            {\n                errorDelegate(error);\n            }\n\n            return 0;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int import(IntPtr l)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tLuaDLL.luaL_checktype(l, 1, LuaTypes.LUA_TSTRING);\n\t\t\t\tstring str = LuaDLL.lua_tostring(l, 1);\n\n\t\t\t\tstring[] ns = str.Split('.');\n\n\t\t\t\tLuaDLL.lua_pushglobaltable(l);\n\n\t\t\t\tfor (int n = 0; n < ns.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_getfield(l, -1, ns[n]);\n\t\t\t\t\tif (!LuaDLL.lua_istable(l, -1))\n\t\t\t\t\t{\n\t\t\t\t\t\treturn LuaObject.error(l, \"expect {0} is type table\", ns);\n\t\t\t\t\t}\n\t\t\t\t\tLuaDLL.lua_remove(l, -2);\n\t\t\t\t}\n\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\t\twhile (LuaDLL.lua_next(l, -2) != 0)\n\t\t\t\t{\n\t\t\t\t\tstring key = LuaDLL.lua_tostring(l, -2);\n\t\t\t\t\tLuaDLL.lua_getglobal(l, key);\n\t\t\t\t\tif (!LuaDLL.lua_isnil(l, -1))\n\t\t\t\t\t{\n\t\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t\t\treturn LuaObject.error(l, \"{0} had existed, import can't overload it.\", key);\n\t\t\t\t\t}\n\t\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\t\tLuaDLL.lua_setglobal(l, key);\n\t\t\t\t}\n\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\n\t\t\t\tLuaObject.pushValue(l, true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn LuaObject.error(l, e);\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int pcall(IntPtr L)\n\t\t{\n\t\t\tint status;\n\t\t\tif (LuaDLL.lua_type(L, 1) != LuaTypes.LUA_TFUNCTION)\n\t\t\t{\n\t\t\t\treturn LuaObject.error(L, \"arg 1 expect function\");\n\t\t\t}\n\t\t\tLuaDLL.luaL_checktype(L, 1, LuaTypes.LUA_TFUNCTION);\n\t\t\tstatus = LuaDLL.lua_pcall(L, LuaDLL.lua_gettop(L) - 1, LuaDLL.LUA_MULTRET, 0);\n\t\t\tLuaDLL.lua_pushboolean(L, (status == 0));\n\t\t\tLuaDLL.lua_insert(L, 1);\n\t\t\treturn LuaDLL.lua_gettop(L);  /* return status + all results */\n\t\t}\n\n\t\tinternal static void pcall(IntPtr l, LuaCSFunction f)\n\t\t{\n\t\t\tint err = LuaObject.pushTry(l);\n\t\t\tLuaDLL.lua_pushcfunction(l, f);\n\t\t\tif (LuaDLL.lua_pcall(l, 0, 0, err) != 0)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t}\n\t\t\tLuaDLL.lua_remove(l, err);\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int print(IntPtr L)\n\t\t{\n\t\t\tint n = LuaDLL.lua_gettop(L);\n\t\t\tstring s = \"\";\n\n\t\t\tLuaDLL.lua_getglobal(L, \"tostring\");\n\n\t\t\tfor (int i = 1; i <= n; i++)\n\t\t\t{\n\t\t\t\tif (i > 1)\n\t\t\t\t{\n\t\t\t\t\ts += \"    \";\n\t\t\t\t}\n\n\t\t\t\tLuaDLL.lua_pushvalue(L, -1);\n\t\t\t\tLuaDLL.lua_pushvalue(L, i);\n\n\t\t\t\tLuaDLL.lua_call(L, 1, 1);\n\t\t\t\ts += LuaDLL.lua_tostring(L, -1);\n\t\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t\t}\n\t\t\tLuaDLL.lua_settop(L, n);\n\t\t\tLogger.Log(s);\n\t\t\tif (logDelegate != null)\n\t\t\t{\n\t\t\t\tlogDelegate(s);\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int loadfile(IntPtr L)\n\t\t{\n\t\t\tloader(L);\n\n\t\t\tif (LuaDLL.lua_isnil(L, -1))\n\t\t\t{\n\t\t\t\tstring fileName = LuaDLL.lua_tostring(L, 1);\n\t\t\t\treturn LuaObject.error(L, \"Can't find {0}\", fileName);\n\t\t\t}\n\t\t\treturn 2;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int dofile(IntPtr L)\n\t\t{\n\t\t\tint n = LuaDLL.lua_gettop(L);\n\n\t\t\tloader(L);\n\t\t\tif (!LuaDLL.lua_toboolean(L, -2))\n\t\t\t{\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (LuaDLL.lua_isnil(L, -1))\n\t\t\t\t{\n\t\t\t\t\tstring fileName = LuaDLL.lua_tostring(L, 1);\n\t\t\t\t\treturn LuaObject.error(L, \"Can't find {0}\", fileName);\n\t\t\t\t}\n\t\t\t\tint k = LuaDLL.lua_gettop(L);\n\t\t\t\tLuaDLL.lua_call(L, 0, LuaDLL.LUA_MULTRET);\n\t\t\t\tk = LuaDLL.lua_gettop(L);\n\t\t\t\treturn k - n;\n\t\t\t}\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tstatic public int panicCallback(IntPtr l)\n\t\t{\n\t\t\tstring reason = string.Format(\"unprotected error in call to Lua API ({0})\", LuaDLL.lua_tostring(l, -1));\n\t\t\tthrow new Exception(reason);\n\t\t}\n\n\t\tstatic public void pushcsfunction(IntPtr L, LuaCSFunction function)\n\t\t{\n\t\t\tLuaDLL.lua_getref(L, get(L).PCallCSFunctionRef);\n\t\t\tLuaDLL.lua_pushcclosure(L, function, 0);\n\t\t\tLuaDLL.lua_call(L, 1, 1);\n\t\t}\n\n\t\tpublic object doString(string str)\n\t\t{\n\t\t\tbyte[] bytes = Encoding.UTF8.GetBytes(str);\n\n\t\t\tobject obj;\n\t\t\tif (doBuffer(bytes, \"temp buffer\", out obj))\n\t\t\t\treturn obj;\n\t\t\treturn null; ;\n\t\t}\n\n\t\tpublic object doString(string str, string chunkname)\n\t\t{\n\t\t\tbyte[] bytes = Encoding.UTF8.GetBytes(str);\n\n\t\t\tobject obj;\n\t\t\tif (doBuffer(bytes, chunkname, out obj))\n\t\t\t\treturn obj;\n\t\t\treturn null; ;\n\t\t}\n\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tinternal static int loader(IntPtr L)\n\t\t{\n\t\t\tstring fileName = LuaDLL.lua_tostring(L, 1);\n\t\t\tbyte[] bytes = loadFile(fileName);\n\t\t\tif (bytes != null)\n\t\t\t{\n\t\t\t\tif (LuaDLL.luaL_loadbuffer(L, bytes, bytes.Length, \"@\" + fileName) == 0)\n\t\t\t\t{\n\t\t\t\t\tLuaObject.pushValue(L, true);\n\t\t\t\t\tLuaDLL.lua_insert(L, -2);\n\t\t\t\t\treturn 2;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstring errstr = LuaDLL.lua_tostring(L, -1);\n\t\t\t\t\treturn LuaObject.error(L, errstr);\n\t\t\t\t}\n\t\t\t}\n\t\t\tLuaObject.pushValue(L, true);\n\t\t\tLuaDLL.lua_pushnil(L);\n\t\t\treturn 2;\n\t\t}\n\n\t\tpublic object doFile(string fn)\n\t\t{\n\t\t\tbyte[] bytes = loadFile(fn);\n\t\t\tif (bytes == null)\n\t\t\t{\n\t\t\t\tLogger.LogError(string.Format(\"Can't find {0}\", fn));\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tobject obj;\n\t\t\tif (doBuffer(bytes, \"@\" + fn, out obj))\n\t\t\t\treturn obj;\n\t\t\treturn null;\n\t\t}\n\n\t    /// <summary>\n\t    /// Ensure remove BOM from bytes\n\t    /// </summary>\n\t    /// <param name=\"bytes\"></param>\n\t    /// <returns></returns>\n\t    public static byte[] CleanUTF8Bom(byte[] bytes)\n\t    {\n            if (bytes.Length > 3 && bytes[0] == 0xEF && bytes[1] == 0xBB && bytes[2] == 0xBF)\n            {\n                var oldBytes = bytes;\n                bytes = new byte[bytes.Length - 3];\n                Array.Copy(oldBytes, 3, bytes, 0, bytes.Length);\n            }\n            return bytes;\n\t    }\n\n\t\tpublic bool doBuffer(byte[] bytes, string fn, out object ret)\n        {        \n            // ensure no utf-8 bom, LuaJIT can read BOM, but Lua cannot!\n\t\t    bytes = CleanUTF8Bom(bytes);\n            ret = null;\n\t\t\tint errfunc = LuaObject.pushTry(L);\n\t\t\tif (LuaDLL.luaL_loadbuffer(L, bytes, bytes.Length, fn) == 0)\n\t\t\t{\n\t\t\t\tif (LuaDLL.lua_pcall(L, 0, LuaDLL.LUA_MULTRET, errfunc) != 0)\n\t\t\t\t{\n\t\t\t\t\tLuaDLL.lua_pop(L, 2);\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tLuaDLL.lua_remove(L, errfunc); // pop error function\n\t\t\t\tret = topObjects(errfunc - 1);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tstring err = LuaDLL.lua_tostring(L, -1);\n\t\t\tLuaDLL.lua_pop(L, 2);\n\t\t\tthrow new Exception(err);\n\t\t}\n\n\t\tinternal static byte[] loadFile(string fn)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tbyte[] bytes;\n\t\t\t\tif (loaderDelegate != null)\n\t\t\t\t\tbytes = loaderDelegate(fn);\n\t\t\t\telse\n\t\t\t\t{\n#if !SLUA_STANDALONE\n\t\t\t\t\tfn = fn.Replace(\".\", \"/\");\n\t\t\t\t\tTextAsset asset = (TextAsset)Resources.Load(fn);\n\t\t\t\t\tif (asset == null)\n\t\t\t\t\t\treturn null;\n\t\t\t\t\tbytes = asset.bytes;\n#else\n\t\t\t\t    bytes = File.ReadAllBytes(fn);\n#endif\n\t\t\t\t}\n\t\t\t\treturn bytes;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tthrow new Exception(e.Message);\n\t\t\t}\n\t\t}\n\n\n\t\tinternal object getObject(string key)\n\t\t{\n\t\t\tLuaDLL.lua_pushglobaltable(L);\n\t\t\tobject o = getObject(key.Split(new char[] { '.' }));\n\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t\treturn o;\n\t\t}\n\n\t\tinternal void setObject(string key, object v)\n\t\t{\n\t\t\tLuaDLL.lua_pushglobaltable(L);\n\t\t\tsetObject(key.Split(new char[] { '.' }), v);\n\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t}\n\n\t\tinternal object getObject(string[] remainingPath)\n\t\t{\n\t\t\tobject returnValue = null;\n\t\t\tfor (int i = 0; i < remainingPath.Length; i++)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushstring(L, remainingPath[i]);\n\t\t\t\tLuaDLL.lua_gettable(L, -2);\n\t\t\t\treturnValue = this.getObject(L, -1);\n\t\t\t\tLuaDLL.lua_remove(L, -2);\n\t\t\t\tif (returnValue == null) break;\n\t\t\t}\n\t\t\treturn returnValue;\n\t\t}\n\n\n\t\tinternal object getObject(int reference, string field)\n\t\t{\n\t\t\tint oldTop = LuaDLL.lua_gettop(L);\n\t\t\tLuaDLL.lua_getref(L, reference);\n\t\t\tobject returnValue = getObject(field.Split(new char[] { '.' }));\n\t\t\tLuaDLL.lua_settop(L, oldTop);\n\t\t\treturn returnValue;\n\t\t}\n\n\t\tinternal object getObject(int reference, int index)\n\t\t{\n\t\t\tif (index >= 1) {\n\t\t\t\tLuaDLL.lua_getref (L, reference);\n\t\t\t\tLuaDLL.lua_rawgeti (L, -1, index);\n\t\t\t\tobject returnValue = getObject (L, -1);\n\t\t\t\tLuaDLL.lua_pop (L, 1);\n\t\t\t\treturn returnValue;\n\t\t\t} else {\n\t\t\t\tLuaDLL.lua_getref (L, reference);\n\t\t\t\tLuaDLL.lua_pushinteger (L, index);\n\t\t\t\tLuaDLL.lua_gettable (L, -2);\n\t\t\t\tobject returnValue = getObject (L, -1);\n\t\t\t\tLuaDLL.lua_pop (L, 1);\n\t\t\t\treturn returnValue;\n\t\t\t}\n\t\t}\n\n\t\tinternal object getObject(int reference, object field)\n\t\t{\n\t\t\tint oldTop = LuaDLL.lua_gettop(L);\n\t\t\tLuaDLL.lua_getref(L, reference);\n\t\t\tLuaObject.pushObject(L, field);\n\t\t\tLuaDLL.lua_gettable(L, -2);\n\t\t\tobject returnValue = getObject(L, -1);\n\t\t\tLuaDLL.lua_settop(L, oldTop);\n\t\t\treturn returnValue;\n\t\t}\n\n\t\tinternal void setObject(string[] remainingPath, object o)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(L);\n\t\t\tfor (int i = 0; i < remainingPath.Length - 1; i++)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushstring(L, remainingPath[i]);\n\t\t\t\tLuaDLL.lua_gettable(L, -2);\n\t\t\t}\n\t\t\tLuaDLL.lua_pushstring(L, remainingPath[remainingPath.Length - 1]);\n\t\t\tLuaObject.pushVar(L, o);\n\t\t\tLuaDLL.lua_settable(L, -3);\n\t\t\tLuaDLL.lua_settop(L, top);\n\t\t}\n\n\n\t\tinternal void setObject(int reference, string field, object o)\n\t\t{\n\t\t\tint oldTop = LuaDLL.lua_gettop(L);\n\t\t\tLuaDLL.lua_getref(L, reference);\n\t\t\tsetObject(field.Split(new char[] { '.' }), o);\n\t\t\tLuaDLL.lua_settop(L, oldTop);\n\t\t}\n\n\t\tinternal void setObject(int reference, int index, object o)\n\t\t{\n\t\t\tif (index >= 1) {\n\t\t\t\tLuaDLL.lua_getref (L, reference);\n\t\t\t\tLuaObject.pushVar (L, o);\n\t\t\t\tLuaDLL.lua_rawseti (L, -2, index);\n\t\t\t\tLuaDLL.lua_pop (L, 1);\n\t\t\t} else {\n\t\t\t\tLuaDLL.lua_getref (L, reference);\n\t\t\t\tLuaDLL.lua_pushinteger (L, index);\n\t\t\t\tLuaObject.pushVar (L, o);\n\t\t\t\tLuaDLL.lua_settable (L, -3);\n\t\t\t\tLuaDLL.lua_pop (L, 1);\n\t\t\t}\n\t\t}\n\n\t\tinternal void setObject(int reference, object field, object o)\n\t\t{\n\t\t\tint oldTop = LuaDLL.lua_gettop(L);\n\t\t\tLuaDLL.lua_getref(L, reference);\n\t\t\tLuaObject.pushObject(L, field);\n\t\t\tLuaObject.pushObject(L, o);\n\t\t\tLuaDLL.lua_settable(L, -3);\n\t\t\tLuaDLL.lua_settop(L, oldTop);\n\t\t}\n\n\t\tinternal object topObjects(int from)\n\t\t{\n\t\t\tint top = LuaDLL.lua_gettop(L);\n\t\t\tint nArgs = top - from;\n\t\t\tif (nArgs == 0)\n\t\t\t\treturn null;\n\t\t\telse if (nArgs == 1)\n\t\t\t{\n\t\t\t\tobject o = LuaObject.checkVar(L, top);\n\t\t\t\tLuaDLL.lua_pop(L, 1);\n\t\t\t\treturn o;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tobject[] o = new object[nArgs];\n\t\t\t\tfor (int n = 1; n <= nArgs; n++)\n\t\t\t\t{\n\t\t\t\t\to[n - 1] = LuaObject.checkVar(L, from + n);\n\n\t\t\t\t}\n\t\t\t\tLuaDLL.lua_settop(L, from);\n\t\t\t\treturn o;\n\t\t\t}\n\t\t}\n\n\t\tobject getObject(IntPtr l, int p)\n\t\t{\n\t\t\tp = LuaDLL.lua_absindex(l, p);\n\t\t\treturn LuaObject.checkVar(l, p);\n\t\t}\n\n\t\tpublic LuaFunction getFunction(string key)\n\t\t{\n\t\t\treturn (LuaFunction)this[key];\n\t\t}\n\n\t\tpublic LuaTable getTable(string key)\n\t\t{\n\t\t\treturn (LuaTable)this[key];\n\t\t}\n\n\n\t\tpublic object this[string path]\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn this.getObject(path);\n\t\t\t}\n\t\t\tset\n\t\t\t{\n\t\t\t\tthis.setObject(path, value);\n\t\t\t}\n\t\t}\n\n\t\tpublic void gcRef(UnRefAction act, int r)\n\t\t{\n\t\t\tUnrefPair u = new UnrefPair();\n\t\t\tu.act = act;\n\t\t\tu.r = r;\n\t\t\tlock (refQueue)\n\t\t\t{\n\t\t\t\trefQueue.Enqueue(u);\n\t\t\t}\n\t\t}\n\n\t\tpublic void checkRef()\n\t\t{\n\t\t\tint cnt = 0;\n\t\t\t// fix il2cpp lock issue on iOS\n\t\t\tlock (refQueue)\n\t\t\t{\n\t\t\t\tcnt = refQueue.Count;\n\t\t\t}\n\n\t\t\tvar l = L;\n\t\t\tfor (int n = 0; n < cnt; n++)\n\t\t\t{\n\t\t\t\tUnrefPair u;\n\t\t\t\tlock (refQueue)\n\t\t\t\t{\n\t\t\t\t\tu = refQueue.Dequeue();\n\t\t\t\t}\n\t\t\t\tu.act(l, u.r);\n\t\t\t}\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaState.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 62daeee0fd05f124fa9dd011d4c45985\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaSvr.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n// uncomment this will use static binder(class BindCustom/BindUnity), \n// init will not use reflection to speed up the speed\n//#define USE_STATIC_BINDER  \n\nnamespace SLua\n{\n\tusing System;\n\tusing System.Threading;\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n\tusing System.Reflection;\n\t#if !SLUA_STANDALONE\n\tusing UnityEngine;\n\tusing Debug = UnityEngine.Debug;\n\t#endif\n\n\tpublic enum LuaSvrFlag {\n\t\tLSF_BASIC = 0,\n\t\tLSF_EXTLIB = 1,\n\t\tLSF_3RDDLL = 2\n\t};\n\n\tpublic class LuaSvr \n\t{\n\t\tpublic LuaState luaState;\n\t\t#if !SLUA_STANDALONE\n\t\tprotected static LuaSvrGameObject lgo;\n\t\t#endif\n\t\tint errorReported = 0;\n\t\tpublic bool inited = false;\n\n\t\tpublic LuaSvr()\n\t\t{\n\t\t\tLuaState luaState = new LuaState();\n\t\t\tthis.luaState = luaState;\n\t\t}\n\n\t\tList<Action<IntPtr>> collectBindInfo() {\n\n\t\t\tList<Action<IntPtr>> list = new List<Action<IntPtr>>();\n\n\t\t\t#if !SLUA_STANDALONE\n\t\t\t#if !USE_STATIC_BINDER\n\t\t\tAssembly[] ams = AppDomain.CurrentDomain.GetAssemblies();\n\n\t\t\tList<Type> bindlist = new List<Type>();\n\t\t\tfor (int n = 0; n < ams.Length;n++ )\n\t\t\t{\n\t\t\t\tAssembly a = ams[n];\n\t\t\t\tType[] ts = null;\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tts = a.GetExportedTypes();\n\t\t\t\t}\n\t\t\t\tcatch\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor (int k = 0; k < ts.Length; k++)\n\t\t\t\t{\n\t\t\t\t\tType t = ts[k];\n\t\t\t\t\tif (t.IsDefined(typeof(LuaBinderAttribute), false))\n\t\t\t\t\t{\n\t\t\t\t\t\tbindlist.Add(t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbindlist.Sort(new System.Comparison<Type>((Type a, Type b) => {\n\t\t\t\tLuaBinderAttribute la = System.Attribute.GetCustomAttribute( a, typeof(LuaBinderAttribute) ) as LuaBinderAttribute;\n\t\t\t\tLuaBinderAttribute lb = System.Attribute.GetCustomAttribute( b, typeof(LuaBinderAttribute) ) as LuaBinderAttribute;\n\n\t\t\t\treturn la.order.CompareTo(lb.order);\n\t\t\t}));\n\n\t\t\tfor (int n = 0; n < bindlist.Count; n++)\n\t\t\t{\n\t\t\t\tType t = bindlist[n];\n\t\t\t\tvar sublist = (Action<IntPtr>[])t.GetMethod(\"GetBindList\").Invoke(null, null);\n\t\t\t\tlist.AddRange(sublist);\n\t\t\t}\n\t\t\t#else\n\t\t\tvar assemblyName = \"Assembly-CSharp\";\n\t\t\tAssembly assembly = Assembly.Load(assemblyName);\n\t\t\tlist.AddRange(getBindList(assembly,\"SLua.BindUnity\"));\n\t\t\tlist.AddRange(getBindList(assembly,\"SLua.BindUnityUI\"));\n\t\t\tlist.AddRange(getBindList(assembly,\"SLua.BindDll\"));\n\t\t\tlist.AddRange(getBindList(assembly,\"SLua.BindCustom\"));\n\t\t\t#endif\n\t\t\t#endif\n\n\t\t\treturn list;\n\n\t\t}\n\n\n\t\tprotected void doBind(IntPtr L)\n\t\t{\n\t\t\tvar list = collectBindInfo ();\n\n\t\t\tint count = list.Count;\n\t\t\tfor (int n = 0; n < count; n++)\n\t\t\t{\n\t\t\t\tAction<IntPtr> action = list[n];\n\t\t\t\taction(L);\n\t\t\t}\n\t\t}\n\n\n\n\t\tprivate IEnumerator doBind(IntPtr L,Action<int> _tick,Action complete)\n\t\t{\n\t\t\tAction<int> tick = (int p) => {\n\t\t\t\tif (_tick != null)\n\t\t\t\t\t_tick (p);\n\t\t\t};\n\n\t\t\ttick (0);\n\t\t\tvar list = collectBindInfo ();\n\n\t\t\ttick (2);\n\n\t\t\tint bindProgress = 2;\n\t\t\tint lastProgress = bindProgress;\n\t\t\tfor (int n = 0; n < list.Count; n++)\n\t\t\t{\n\t\t\t\tAction<IntPtr> action = list[n];\n\t\t\t\taction(L);\n\t\t\t\tbindProgress = (int)(((float)n / list.Count) * 98.0) + 2;\n\t\t\t\tif (_tick!=null && lastProgress != bindProgress && bindProgress % 5 == 0) {\n\t\t\t\t\ttick (bindProgress);\n\t\t\t\t\tyield return null;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttick (100);\n\t\t\tcomplete ();\n\t\t}\n\n\t\tAction<IntPtr>[] getBindList(Assembly assembly,string ns) {\n\t\t\tType t=assembly.GetType(ns);\n\t\t\tif(t!=null)\n\t\t\t\treturn (Action<IntPtr>[]) t.GetMethod(\"GetBindList\").Invoke(null, null);\n\t\t\treturn new Action<IntPtr>[0];\n\t\t}\n\n        protected void doinit(IntPtr L,LuaSvrFlag flag)\n\t\t{\n\t\t\t#if !SLUA_STANDALONE\n\t\t\tLuaTimer.reg(L);\n\t\t\t#if UNITY_EDITOR\n\t\t\tif (UnityEditor.EditorApplication.isPlaying)\n\t\t\t#endif\n\t\t\t\tLuaCoroutine.reg(L, lgo);\n\t\t\t#endif\n\t\t\tLua_SLua_ByteArray.reg (L);\n\t\t\tHelper.reg(L);\n\t\t\tLuaValueType.reg(L);\n\n\t\t\tif((flag&LuaSvrFlag.LSF_EXTLIB)!=0)\n\t\t\t\tLuaDLL.luaS_openextlibs(L);\n\t\t\tif((flag&LuaSvrFlag.LSF_3RDDLL)!=0)\n\t\t\t\tLua3rdDLL.open(L);\n\n\t\t\t#if !SLUA_STANDALONE\n\t\t\t#if UNITY_EDITOR\n\t\t\tif (UnityEditor.EditorApplication.isPlaying)\n\t\t\t{\n\t\t\t#endif\n\t\t\t\tlgo.state = luaState;\n\t\t\t\tlgo.onUpdate = this.tick;\n\t\t\t\tlgo.init();\n\t\t\t#if UNITY_EDITOR\n\t\t\t}\n\n\t\t\t#endif\n\t\t\t#endif\n\n\t\t\tinited = true;\n\t\t}\n\n        protected void checkTop(IntPtr L)\n\t\t{\n\t\t\tif (LuaDLL.lua_gettop(luaState.L) != errorReported)\n\t\t\t{\n\t\t\t\tLogger.LogError(\"Some function not remove temp value from lua stack. You should fix it.\");\n\t\t\t\terrorReported = LuaDLL.lua_gettop(luaState.L);\n\t\t\t}\n\t\t}\n\n\t\tpublic void init(Action<int> tick,Action complete,LuaSvrFlag flag=LuaSvrFlag.LSF_BASIC)\n\t\t{\n\t\t\t#if !SLUA_STANDALONE\n\t\t\tif (lgo == null\n\t\t\t#if UNITY_EDITOR\n\t\t\t\t&& UnityEditor.EditorApplication.isPlaying\n\t\t\t#endif\n\t\t\t)\n\t\t\t{\n\t\t\t\tGameObject go = new GameObject(\"LuaSvrProxy\");\n\t\t\t\tlgo = go.AddComponent<LuaSvrGameObject>();\n\t\t\t\tGameObject.DontDestroyOnLoad(go);\n\n\t\t\t}\n\t\t\t#endif\n\t\t\tIntPtr L = luaState.L;\n\t\t\tLuaObject.init(L);\n\n\t\t\t#if SLUA_STANDALONE\n\t\t\tdoBind(L);\n\t\t\tdoinit(L, flag);\n\t\t\tcomplete();\n\t\t\tcheckTop(L);\n\t\t\t#else\n\n\n\t\t\t#if UNITY_EDITOR\n\t\t\tif (!UnityEditor.EditorApplication.isPlaying)\n\t\t\t{\n\t\t\t\tdoBind(L);\n\t\t\t\tdoinit(L, flag);\n\t\t\t\tcomplete();\n\t\t\t\tcheckTop(L);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t#endif\n\t\t\t\tlgo.StartCoroutine(doBind(L,tick, () =>\n\t\t\t\t\t{\n\t\t\t\t\t\tdoinit(L, flag);\n\t\t\t\t\t\tcomplete();\n\t\t\t\t\t\tcheckTop(L);\n\t\t\t\t\t}));\n\t\t\t#if UNITY_EDITOR\n\t\t\t}\n\t\t\t#endif\n\t\t\t#endif\n\t\t}\n\n\t\tpublic object start(string main)\n\t\t{\n\t\t\tif (main != null)\n\t\t\t{\n\t\t\t\tluaState.doFile(main);\n\t\t\t\tLuaFunction func = (LuaFunction)luaState[\"main\"];\n\t\t\t\tif(func!=null)\n\t\t\t\t\treturn func.call();\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\n\t\t// You should call this function periodically by yourself in STANDALONE mode\n\t\t#if SLUA_STANDALONE\n\t\tpublic \n\t\t#endif\n\t\tvoid tick()\n\t\t{\n\t\t\tif (!inited)\n\t\t\t\treturn;\n\n\t\t\tif (LuaDLL.lua_gettop(luaState.L) != errorReported)\n\t\t\t{\n\t\t\t\terrorReported = LuaDLL.lua_gettop(luaState.L);\n\t\t\t\tLogger.LogError(string.Format(\"Some function not remove temp value({0}) from lua stack. You should fix it.\",LuaDLL.luaL_typename(luaState.L,errorReported)));\n\t\t\t}\n\n\t\t\tluaState.checkRef();\n\t\t\t#if !SLUA_STANDALONE\n\t\t\tLuaTimer.tick(Time.deltaTime);\n\t\t\t#endif\n\t\t}\n\n\t}\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaSvr.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 5eb3a136ce8cd9242ba7b6ff1a170d24\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaSvrGameObject.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n#if !SLUA_STANDALONE\nnamespace SLua\n{\n\tusing UnityEngine;\n\tusing System.Collections;\n\tusing SLua;\n\tusing System;\n\tusing System.Net;\n\tusing System.Net.Sockets;\n\tusing System.IO;\n\n\tpublic class LuaSvrGameObject : MonoBehaviour\n\t{\n\n\t\tpublic LuaState state;\n\t\tpublic Action onUpdate;\n\n\t\tvoid OnDestroy()\n\t\t{\n\t\t\tif (state != null)\n\t\t\t{\n\t\t\t\t\n\t\t\t\t// state is disposed by editorapplication if in the Editor\n\t\t\t\t// state isn't disposed in App because that all resources will be disposed by app on process exit.\n\t\t\t}\n\t\t}\n\n\t\tpublic void init() {\n\t\t\t\n\t\t}\n\n\n\t\tvoid Update()\n\t\t{\n\t\t\tif (onUpdate != null) onUpdate();\n\n\t\t}\n\n\t\t\n\t}\n}\n#endif"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaSvrGameObject.cs.meta",
    "content": "fileFormatVersion: 2\nguid: bbeb72ba7c754064b8983a2ebc1dbeae\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 9999\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaValueType.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n    using System;\n    class LuaValueType : LuaObject\n    {\n#if !LUA_5_3 && !SLUA_STANDALONE\n        static string script = @\"\nif not UnityEngine or not UnityEngine.Vector2 then\n    print('No static code gen yet, ignore `LuaValueType:reg` !!! ')\n    return\nend\nlocal setmetatable=setmetatable\nlocal getmetatable=getmetatable\nlocal type=type\nlocal clamp=clamp\nlocal acos=math.acos\nlocal sin=math.sin\nlocal cos=math.cos\nlocal sqrt=math.sqrt\nlocal error=error\nlocal min=math.min\nlocal max=math.max\nlocal abs=math.abs\nlocal pow=math.pow\nlocal Time=UnityEngine.Time\n\nlocal ToAngle=57.29578\nlocal ToRad=0.01745329\nlocal Epsilon=0.00001\nlocal Infinite=1/0\nlocal Sqrt2=0.7071067811865475244008443621048490\nlocal PI=3.14159265358979323846264338327950\n\nlocal function clamp(v,min,max)\n\tmin = min or 0\n\tmax = max or 1\n\treturn v>max and max or (v<min and min or v)\nend\n\nlocal function  lerpf(a,b,t)\n\tt=clamp(t,0,1)\n\treturn a+(b-a)*t\nend\n\nlocal function inherite(cls,base)\n\tfor k,v in pairs(getmetatable(base)) do\n\t\tif not cls[k] and k:sub(1,2)~='__' and  k:sub(1,1)>='A' and k:sub(1,1)<='Z' then\n\t\t\tcls[k]=v\n\t\tend\n\tend\nend\n\nlocal Matrix3x3={}\nlocal Vector3\n\ndo\n\n\tfunction Matrix3x3.SetAt(m,row,col,v)\n\t\tm[row*3+col+1]=v\n\tend\n\n\tfunction Matrix3x3.New()\n\t\tlocal r={1,0,0,0,1,0,0,0,1}\n\t\tsetmetatable(r,Matrix3x3)\n\t\treturn r\n\tend\n\n\tfunction Matrix3x3.__tostring(m)\n\t\treturn string.format('Matrix3x3(%f,%f,%f,%f,%f,%f,%f,%f,%f)'\n\t\t\t,m[1],m[2],m[3]\n\t\t\t,m[4],m[5],m[6]\n\t\t\t,m[7],m[8],m[9])\n\tend\n\n\tfunction Matrix3x3.SetAxisAngle(m,axis,rad)\n\t\t-- This function contributed by Erich Boleyn (erich@uruk.org) */\n\t\t-- This function used from the Mesa OpenGL code (matrix.c)  */\n\t\tlocal s, c\n\t\tlocal vx, vy, vz, xx, yy, zz, xy, yz, zx, xs, ys, zs, one_c\n\n\t\ts = sin (rad)\n\t\tc = cos (rad)\n\n\t\tvx = axis[1]\n\t\tvy = axis[2]\n\t\tvz = axis[3]\n\n\t\txx = vx * vx\n\t\tyy = vy * vy\n\t\tzz = vz * vz\n\t\txy = vx * vy\n\t\tyz = vy * vz\n\t\tzx = vz * vx\n\t\txs = vx * s\n\t\tys = vy * s\n\t\tzs = vz * s\n\t\tone_c = 1.0 - c\n\t\tlocal Set=Matrix3x3.SetAt\n\t\tSet(m,0,0, (one_c * xx) + c )\n\t\tSet(m,1,0, (one_c * xy) - zs)\n\t\tSet(m,2,0, (one_c * zx) + ys)\n\t\tSet(m,0,1, (one_c * xy) + zs)\n\t\tSet(m,1,1, (one_c * yy) + c )\n\t\tSet(m,2,1, (one_c * yz) - xs)\n\t\tSet(m,0,2, (one_c * zx) - ys)\n\t\tSet(m,1,2, (one_c * yz) + xs)\n\t\tSet(m,2,2, (one_c * zz) + c )\n\tend\n\n\tfunction Matrix3x3.Mul(m,v)\n\t\tlocal res=Vector3.New(0,0,0)\n\t\tres[1] = m[1] * v[1] + m[4] * v[2] + m[7] * v[3]\n\t\tres[2] = m[2] * v[1] + m[5] * v[2] + m[8] * v[3]\n\t\tres[3] = m[3] * v[1] + m[6] * v[2] + m[9] * v[3]\n\t\treturn res\n\tend\n\n\tfunction Matrix3x3:SetIdentity()\n\t\tself[1],self[2],self[3]=1,0,0\n\t\tself[4],self[5],self[6]=0,1,0\n\t\tself[7],self[8],self[9]=0,0,1\n\tend\n\n\tfunction Matrix3x3:SetOrthoNormal( x,y,z )\n\t\tself[1],self[2],self[3]=x[1],y[1],z[1]\n\t\tself[4],self[5],self[6]=x[2],y[2],z[2]\n\t\tself[7],self[8],self[9]=x[3],y[3],z[3]\n\tend\nend\n\ndo\n\tlocal Raw=UnityEngine.Vector3\n\tVector3={__typename='Vector3',__raw=Raw}\n\tlocal T=Vector3\n\tlocal I={__typename='Vector3'}\n\t_G['UnityEngine.Vector3.Instance']=I\n\tUnityEngine.Vector3=Vector3\n\tlocal get={}\n\tlocal set={}\n\n\tVector3.__index = function(t,k)\n\t\tlocal f=rawget(Vector3,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tVector3.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\n\tVector3.New=function (x,y,z)\n\t\tlocal v={x or 0,y or 0,z or 0}\n\t\tsetmetatable(v,I)\n\t\treturn v\n\tend\n\n\tVector3.__call = function(t,x,y,z)\n\t\treturn Vector3.New(x,y,z)\n\tend\n\n\tI.__index = function(t,k)\n\t\tlocal f=rawget(I,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tI.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\tI.__eq = function(a,b)\n\t\treturn abs(a[1]-b[1])<Epsilon\n\t\t \tand abs(a[2]-b[2])<Epsilon\n\t\t \tand abs(a[3]-b[3])<Epsilon\n\tend\n\n\tI.__unm = function(a)\n\t\tlocal ca=Vector3.New(-a[1],-a[2],-a[3])\n\t\treturn ca\n\tend\n\n\n\tI.__tostring = function(self)\n\t\treturn string.format('Vector3(%f,%f,%f)',self[1],self[2],self[3])\n\tend\n\n\tI.__mul = function(a,b)\n\t\tlocal ta=type(a)\n\t\tlocal tb=type(b)\n\t\tif ta=='table' and tb=='number' then\n\t\t\treturn Vector3.New(a[1]*b,a[2]*b,a[3]*b)\n\t\telseif ta=='number' and tb=='table' then\n\t\t\treturn Vector3.New(a*b[1],a*b[2],a*b[3])\n\t\telse\n\t\t\terror(string.format('unexpect type of arguments, got %s,%s',ta,tb))\n\t\tend\n\tend\n\n\tI.__add = function(a,b)\n\t\treturn Vector3.New(a[1]+b[1],a[2]+b[2],a[3]+b[3])\n\tend\n\n\tI.__sub = function(a,b)\n\t\treturn Vector3.New(a[1]-b[1],a[2]-b[2],a[3]-b[3])\n\tend\n\n\tI.__div = function(a,b)\n\t\treturn Vector3.New(a[1]/b,a[2]/b,a[3]/b)\n\tend\n\n\tfunction Vector3.Mul(self,b)\n\t\tself[1],self[2],self[3]=self[1]*b,self[2]*b,self[3]*b\n\tend\n\n\tfunction Vector3.Add(self,b)\n\t\tself[1],self[2],self[3]=self[1]+b[1],self[2]+b[2],self[3]+b[3]\n\tend\n\n\tfunction Vector3.Sub(self,b)\n\t\tself[1],self[2],self[3]=self[1]-b[1],self[2]-b[2],self[3]-b[3]\n\tend\n\n\tfunction Vector3.Div(self,b)\n\t\tself[1],self[2],self[3]=self[1]/b,self[2]/b,self[3]/b\n\tend\n\n\n\tfunction get.back() return Vector3.New(0,0,-1) end\n\tfunction get.down() return Vector3.New(0,-1,0) end\n\tfunction get.forward() return Vector3.New(0,0,1) end\n\tfunction get.left() return Vector3.New(-1,0,0) end\n\tfunction get.one() return Vector3.New(1,1,1) end\n\tfunction get.right() return Vector3.New(1,0,0) end\n\tfunction get.up() return Vector3.New(0,1,0) end\n\tfunction get.zero() return Vector3.New(0,0,0) end\n\n\tfunction get:x() return self[1] end\n\tfunction get:y() return self[2] end\n\tfunction get:z() return self[3] end\n\tfunction set:x(v) self[1]=v end\n\tfunction set:y(v) self[2]=v end\n\tfunction set:z(v) self[3]=v end\n\tfunction get:magnitude() return Vector3.Magnitude(self) end\n\tfunction get:sqrMagnitude() return Vector3.SqrMagnitude(self) end\n\tfunction get:normalized() \n\t\treturn Vector3.Normalize(self)\n\tend\n\n\n\tfunction Vector3:Clone()\n\t\treturn Vector3.New(self[1],self[2],self[3])\n\tend\n\t\t\n\tfunction I:Set(x,y,z)\t\n\t\tself[1],self[2],self[3]=x or 0,y or 0,z or 0\n\tend\n\n\tfunction I:ToString()\n\t\treturn self:__tostring()\n\tend\n\n\tfunction Vector3.Angle(a,b)\n\t\tlocal dot = Vector3.Dot(Vector3.Normalize(a), Vector3.Normalize(b))\n\t\treturn acos(dot)*ToAngle\n\tend\n\n\tfunction Vector3.Normalized(v)\n\t\tlocal m = Vector3.Magnitude(v)\n\t\tif m==1 then\n\t\t\treturn v\n\t\telseif m>Epsilon then\n\t\t\tv[1],v[2],v[3]=v[1]/m,v[2]/m,v[3]/m\n\t\telse\n\t\t\tv:Set(0,0,0)\n\t\tend\n\tend\n\n    function Vector3.Normalize(v)\n        local v=Vector3.Clone(v)\n        Vector3.Normalized(v)\n        return v\n\tend\n\n\tfunction I:Normalize()\n\t\tVector3.Normalized(self)\n\tend\n\n\tfunction Vector3.Magnitude(v)\n\t\tlocal v= sqrt(v[1]^2+v[2]^2+v[3]^2)\n\t\treturn v\n\tend\n\n\tfunction Vector3.SqrMagnitude(v)\n\t\tlocal v= v[1]^2+v[2]^2+v[3]^2\n\t\treturn v\n\tend\n\n\tfunction Vector3.Dot(a,b)\n\t\tlocal v= a[1]*b[1] + a[2]*b[2] + a[3]*b[3]\n\t\treturn v\n\tend\n\n\tfunction Vector3.Cross(a,b)\n\t\treturn Vector3.New((a[2] * b[3]) - (a[3] * b[2])\n\t\t\t, (a[3] * b[1]) - (a[1] * b[3])\n\t\t\t, (a[1] * b[2]) - (a[2] * b[1]))\n\tend\n\n\tfunction Vector3.OrthoNormalVector(n)\n\t\tlocal res=Vector3.New(0,0,0)\n\t\tif abs(n[3]) > Sqrt2 then\n\t\t\tlocal a = n[2]^2 + n[3]^2\n\t\t\tlocal k = 1 / sqrt (a)\n\t\t\tres[1],res[2],res[3] = 0,-n[3]*k,n[2]*k\n\t\telse\n\t\t\tlocal a = n[1]^2 + n[2]^2\n\t\t\tlocal k = 1 / sqrt (a)\n\t\t\tres[1],res[2],res[3] = -n[2]*k,n[1]*k,0\n\t\tend\n\t\treturn res\n\tend\n\n\tfunction Vector3.Slerp(a,b,t)\n\t\tif t<=0 then return Vector3.Clone(a) end\n\t\tif t>=1 then return Vector3.Clone(b) end\n\n\t\tlocal ma=Vector3.Magnitude(a)\n\t\tlocal mb=Vector3.Magnitude(b)\n\t\tif ma<Epsilon or mb<Epsilon then\n\t\t\treturn Vector3.Lerp(a,b,t)\n\t\tend\n\n\t\tlocal dot=Vector3.Dot(a,b)/(ma*mb)\n\t\tif dot>1-Epsilon then\n\t\t\treturn Vector3.Lerp(a,b,t)\n\t\telseif dot<-1+Epsilon then\n\t\t\tlocal lerpedMagnitude = lerpf (ma, mb, t)\n\t\t\tlocal na = I.__div(a,ma)\n\t\t\tlocal axis = Vector3.OrthoNormalVector(na)\n\t\t\tlocal m=Matrix3x3.New()\n\t\t\tMatrix3x3.SetAxisAngle(m,axis,PI*t)\n\t\t\tlocal slerped = Matrix3x3.Mul(m,na)\n\t\t\tVector3.Mul(slerped,lerpedMagnitude)\n\t\t\treturn slerped\n\t\telse\n\t\t\tlocal lerpedMagnitude = lerpf (ma, mb, t)\n\t\t\tlocal axis = Vector3.Cross(a,b)\n\t\t\tlocal na = a/ma\n\t\t\tVector3.Normalized(axis)\n\t\t\tlocal angle=acos(dot)*t\n\t\t\tlocal m=Matrix3x3.New()\n\t\t\tMatrix3x3.SetAxisAngle(m,axis,angle)\n\t\t\tlocal slerped = Matrix3x3.Mul(m,na)\n\t\t\tVector3.Mul(slerped,lerpedMagnitude)\n\t\t\treturn slerped\n\t\tend\n\tend\n\n\tfunction Vector3.Lerp(a,b,t)\n\t\treturn Vector3.New(a[1]+(b[1]-a[1])*t\n\t\t\t,a[2]+(b[2]-a[2])*t\n\t\t\t,a[3]+(b[3]-a[3])*t\n\t\t)\n\tend\n\n\tfunction Vector3.Min(a,b)\n\t\treturn Vector3.New(min(a[1],b[1])\n\t\t\t,min(a[2],b[2])\n\t\t\t,min(a[3],b[3]))\n\tend\n\n\tfunction Vector3.Max(a,b)\n\t\treturn Vector3.New(max(a[1],b[1])\n\t\t\t,max(a[2],b[2])\n\t\t\t,max(a[3],b[3]))\n\tend\n\n\tfunction Vector3.MoveTowards(a,b,adv)\n\t\tlocal v = I.__sub(b,a)\n\t\tlocal m = Vector3.Magnitude(v)\n\t\tif m>adv and m~=0 then\n\t\t\tVector3.Div(v,m)\n\t\t\tVector3.Mul(v,adv)\n\t\t\tVector3.Add(v,a)\n\t\t\treturn v\n\t\tend\n\t\treturn Vector3.Clone(b)\n\tend\n\n\tlocal function ClampedMove(a,b,mag)\n\t\tlocal delta = b-a\n\t\tif delta > 0 then\n\t\t\treturn a + min (delta, mag)\n\t\telse\n\t\t\treturn a - min (-delta, mag)\n\t\tend\n\tend\n\n\tfunction Vector3.RotateTowards(a,b,angleMove,mag)\n\t\tlocal ma = Vector3.Magnitude(a)\n\t\tlocal mb = Vector3.Magnitude (b)\n\t\t\n\t\tif ma > Epsilon and mb > Epsilon then\n\t\t\tlocal na = a / ma\n\t\t\tlocal nb = b / mb\n\t\t\t\n\t\t\tlocal dot = Vector3.Dot(na, nb)\n\t\t\tif dot > 1.0 - Epsilon then\n\t\t\t\treturn Vector3.MoveTowards (a, b, mag)\n\t\t\telseif dot < -1.0 + Epsilon then\n\t\t\t\tlocal axis = Vector3.OrthoNormalVector(na)\n\t\t\t\tlocal m=Matrix3x3.New()\n\t\t\t\tMatrix3x3.SetAxisAngle(m, axis, angleMove)\n\t\t\t\tlocal rotated = Matrix3x3.Mul(m,na)\n\t\t\t\tVector3.Mul(rotated,ClampedMove(ma, mb, mag))\n\t\t\t\treturn rotated\n\t\t\telse\n\t\t\t\tlocal angle = acos(dot);\n\t\t\t\tlocal axis = Vector3.Cross(na, nb)\n\t\t\t\tVector3.Normalized(axis)\n\t\t\t\tlocal m=Matrix3x3.New()\n\t\t\t\tMatrix3x3.SetAxisAngle(m,axis, min(angleMove, angle))\n\t\t\t\tlocal rotated = Matrix3x3.Mul(m,na)\n\t\t\t\tVector3.Mul(rotated,ClampedMove(ma, mb, mag))\n\t\t\t\treturn rotated\n\t\t\tend\n\t\telse\n\t\t\treturn Vector3.MoveTowards (a,b,mag)\n\t\tend\n\tend\n\n\tfunction Vector3.Distance(a,b)\n\t\ta=Vector3.Clone(a)\n\t\tVector3.Sub(a,b)\n\t\treturn Vector3.Magnitude(a)\n\tend\n\n\tfunction Vector3.OrthoNormalize(u,v,w)\n\t\tVector3.Normalized(u)\n\n\t\tlocal dot0 = Vector3.Dot(u,v)\n\t\tlocal tu=Vector3.Clone(u)\n\t\tVector3.Mul(tu,dot0)\n\t\tVector3.Sub(v,tu)\n\t\tVector3.Normalized(v)\n\n\t\tif w then\n\t\t\tlocal dot1 = Vector3.Dot(v,w)\n\t\t\tlocal dot0 = Vector3.Dot(u,w)\n\t\t\tlocal tw=I.__mul(u,dot0)\n\t\t\tlocal tv=I.__mul(v,dot1)\n\t\t\tVector3.Add(tv,tw)\n\t\t\tVector3.Sub(w,tv)\n\t\t\tVector3.Normalized(w)\n\t\tend\n\tend\n\n\tfunction Vector3.Scale(a,b)\n\t\treturn Vector3.New(a[1]*b[1],a[2]*b[2],a[3]*b[3])\n\tend\n\n\tfunction I:Scale( self,b )\n\t\treturn Vector3.Scale(self,b)\n\tend\n\n\t-- code copy from reflactor of UnityEgnine\n\tfunction Vector3.SmoothDamp(current,target,currentVelocity,smoothTime,maxSpeed,deltaTime)\n\t\tlocal deltaTime = deltaTime or Time.deltaTime\n\t\tlocal maxSpeed = maxSpeed or Infinite\n\t\tsmoothTime = max(Epsilon,smoothTime)\n\t\tlocal float num = 2 / smoothTime\n\t    local float num2 = num * deltaTime\n\t    local float num3 = 1 / (((1 + num2) + ((0.48 * num2) * num2)) + (((0.235 * num2) * num2) * num2))\n\t    local vector = current - target;\n\t    local vector2 = target\n\t    local maxLength = maxSpeed * smoothTime\n\t    vector = Vector3.ClampMagnitude(vector, maxLength)\n\t    target = current - vector\n\t    local vector3 = currentVelocity +  vector * deltaTime * num\n\t    local newv = currentVelocity -  vector3 * num3 * num\n\t    local vector4 = target + (vector + vector3) * num3\n\t    if Vector3.Dot(vector2 - current, vector4 - vector2) > 0 then\n\t        vector4 = vector2\n\t        newv = (vector4 - vector2) / deltaTime\n\t    end\n\t    currentVelocity:Set(newv.x,newv.y,newv.z)\n\t    return vector4,currentVelocity\n\tend\n\n\t-- code copy from reflactor of UnityEgnine\n\tfunction Vector3.ClampMagnitude(vector,maxLength)\n\t    if Vector3.SqrMagnitude(vector) > (maxLength^2) then\n\t        return vector.normalized * maxLength\n\t    end\n\t    return Vector3.Clone(vector)\n\tend\n\n\tfunction Vector3.Reflect(dir,nml)\n\t\tlocal dot=Vector3.Dot(nml,dir)*-2\n\t\tlocal v=I.__mul(nml,dot)\n\t\tVector3.Add(v,dir)\n\t\treturn v\n\tend\n\n\t-- code copy from reflactor of UnityEgnine\n\tfunction Vector3.ProjectOnPlane(vector,planeNormal)\n\t\treturn vector - Vector3.Project(vector, planeNormal)\n\tend\n\n\t-- code copy from reflactor of UnityEgnine\n\tfunction Vector3.Project( vector,normal )\n\t\tlocal num = Vector3.Dot(normal, normal)\n\t    if num < Epsilon then\n\t        return Vector3.zero\n\t    end\n\t    return (normal * Vector3.Dot(vector, normal)) / num\n\tend\n\n\tinherite(Vector3,Raw)\n\tsetmetatable(Vector3,Vector3)\nend\n\ndo\n\n\n\tlocal Raw=UnityEngine.Color\n\tlocal Color={__typename='Color',__raw=Raw}\n\t_G['UnityEngine.Color.Instance']=Color\n\tUnityEngine.Color=Color\n\tlocal get={}\n\tlocal set={}\n\n\tColor.__index = function(t,k)\n\t\tlocal f=rawget(Color,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tColor.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\tColor.__tostring = function(self)\n\t\treturn string.format('Color(%f,%f,%f,%f)',self[1],self[2],self[3],self[4])\n\tend\n\n\n\tfunction Color.New(r,g,b,a)\n\t\ta=a or 1\n\t\tlocal c={r or 0,g or 0,b or 0,a or 0}\n\t\tsetmetatable(c,Color)\n\t\treturn c\n\tend\n\n\tfunction Color.__call(t,r,g,b,a)\n\t\treturn Color.New(r,g,b,a)\n\tend\n\n\tfunction Color.__add(a,b)\n\t\treturn Color.New(a[1]+b[1],a[2]+b[2],a[3]+b[3],a[4]+b[4])\n\tend\n\n\tfunction Color.__sub(a,b)\n\t\treturn Color.New(a[1]-b[1],a[2]-b[2],a[3]-b[3],a[4]-b[4])\n\tend\n\n\tfunction Color.__mul( a,b )\n\t\tif type(a)=='number' then\n\t\t\treturn Color.New(a*b[1],a*b[2],a*b[3],a*b[4])\n\t\telseif type(b)=='number' then\n\t\t\treturn Color.New(a[1]*b,a[2]*b,a[3]*b,a[4]*b)\n\t\telse\n\t\t\treturn Color.New(a[1]*b[1],a[2]*b[2],a[3]*b[3],a[4]*b[4])\n\t\tend\n\tend\n\n\tfunction Color.__div( a,b )\n\t\treturn Color.New(a[1]/b,a[2]/b,a[3]/b,a[4]/b)\n\tend\n\n\tfunction Color.__eq( a,b )\n\t\treturn a[1]==b[1] and a[2]==b[2] and a[3]==b[3] and a[4]==b[4]\n\tend\n\n\tlocal function ToLinear(value)\n\t\tif value <= 0.04045 then\n\t\t\treturn value / 12.92\n\t\telseif value < 1.0 then\n\t\t\treturn pow((value + 0.055)/1.055, 2.4)\n\t\telse\n\t\t\treturn pow(value, 2.4)\n\t\tend\n\tend\n\n\tlocal function ToGamma(value)\n\t\tif value <= 0.0 then\n\t\t\treturn 0.0\n\t\telseif value <= 0.0031308 then\n\t\t\treturn 12.92 * value\n\t\telseif value <= 1.0 then\n\t\t\treturn 1.055 * pow(value, 0.41666) - 0.055\n\t\telse\n\t\t\treturn pow(value, 0.41666)\n\t\tend\n\tend\n\n\tfunction get.red() return Color.New(1,0,0,1) end\n\tfunction get.green() return Color.New(0,1,0,1) end\n\tfunction get.blue() return Color.New(0,0,1,1) end\n\tfunction get.white() return Color.New(1,1,1,1) end\n\tfunction get.black() return Color.New(0,0,0,1) end\n\tfunction get.yellow() return Color.New(1, 0.9215686, 0.01568628, 1) end\n\tfunction get.cyan() return Color.New(0,1,1,1) end\n\tfunction get.magenta() return Color.New(1,0,1,1) end\n\tfunction get.gray() return Color.New(0.5,0.5,0.5,1) end\n\tfunction get.grey() return Color.New(0.5,0.5,0.5,1) end\n\tfunction get.clear() return Color.New(0,0,0,0) end\n\tfunction get:grayscale() return (0.299 * self[1]) + (0.587 * self[2]) + (0.114 * self[3]) end\n\tfunction get:linear() \n\t\treturn Color.New(ToLinear(self[1]),ToLinear(self[2]),ToLinear(self[3]),self[4]) \n\tend\n\tfunction get:gamma() \n\t\treturn Color.New(ToGamma(self[1]),ToGamma(self[2]),ToGamma(self[3]),self[4]) \n\tend\n\tfunction get:r() return self[1]\tend\n\tfunction get:g() return self[2]\tend\n\tfunction get:b() return self[3]\tend\n\tfunction get:a() return self[4]\tend\n\tfunction set:r(v) self[1]=v\tend\n\tfunction set:g(v) self[2]=v\tend\n\tfunction set:b(v) self[3]=v\tend\n\tfunction set:a(v) self[4]=v\tend\n\n\tfunction Color.Lerp( a,b,t )\n\t\tt=clamp(t)\n\t\treturn Color.New( lerpf(a[1],b[1],t),lerpf(a[2],b[2],t),lerpf(a[3],b[3],t),lerpf(a[4],b[4],t) )\n\tend\n\n\n\tinherite(Color,Raw)\n\tsetmetatable(Color,Color)\n\nend\n\ndo\n\tlocal Raw=UnityEngine.Vector2\n\tlocal Vector2={__typename='Vector2',__raw=Raw}\n\t_G['UnityEngine.Vector2.Instance']=Vector2\n\tUnityEngine.Vector2=Vector2\n\tlocal get={}\n\tlocal set={}\n\n\tVector2.__index = function(t,k)\n\t\tlocal f=rawget(Vector2,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tVector2.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\tVector2.__tostring = function(self)\n\t\treturn string.format('Vector2(%f,%f)',self[1],self[2])\n\tend\n\n\tfunction Vector2.New(x,y)\n\t\tlocal v={x or 0,y or 0}\n\t\tsetmetatable(v,Vector2)\n\t\treturn v\n\tend\n\n\tfunction Vector2.__call(t,x,y)\n\t\treturn Vector2.New(x,y)\n\tend\n\n\tfunction Vector2.__add( a,b )\n\t\treturn Vector2.New(a[1]+b[1],a[2]+b[2])\n\tend\n\n\tfunction Vector2.__sub( a,b )\n\t\treturn Vector2.New(a[1]-b[1],a[2]-b[2])\n\tend\n\n\tfunction Vector2.__eq( a,b )\n\t\treturn abs(a[1]-b[1])<Epsilon\n\t\t \tand abs(a[2]-b[2])<Epsilon\n\tend\n\n\tfunction Vector2.__mul( a,b )\n\t\treturn Vector2.New(a[1]*b,a[2]*b)\n\tend\n\n\tfunction Vector2.__div( a,b )\n\t\treturn Vector2.New(a[1]/b,a[2]/b)\n\tend\n\n\tfunction Vector2.__unm( a )\n\t\treturn Vector2.New(-a[1],-a[2])\n\tend\n\n\tfunction get.one() return Vector2.New(1,1) end\n\tfunction get.zero() return Vector2.New(0,0) end\n\tfunction get.up() return Vector2.New(0,1) end\n\tfunction get.down() return Vector2.New(0,-1) end\n\tfunction get.right() return Vector2.New(1,0) end\n\tfunction get.left() return Vector2.New(-1,0) end\n\tfunction get:magnitude() return sqrt(self[1]^2+self[2]^2) end\n\tfunction get:sqrMagnitude() return self[1]^2+self[2]^2 end\n\tfunction get:normalized() \n\t\tlocal m = self.magnitude\n\t\treturn Vector2.New(self[1]/m,self[2]/m)\n\tend\n\tfunction get:x() return self[1] end\n\tfunction get:y() return self[2] end\n\tfunction set:x(v) self[1]=v\tend\n\tfunction set:y(v) self[2]=v\tend\n\n\tinherite(Vector2,Raw)\n\n\tfunction Vector2.Normalize( v )\n\t\tlocal m = Vector2.Magnitude(v)\n\t\tv[1],v[2]=v[1]/m,v[2]/m\n\tend\n\n\tfunction Vector2.Magnitude( v )\n\t\treturn sqrt(v[1]^2+v[2]^2)\n\tend\n\n\tfunction Vector2:Set( x,y )\n\t\tself[1],self[2]=x,y\n\tend\n\n\tfunction Vector2:ToString( )\n\t\treturn Vector2.__tostring(self)\n\tend\n\n\tsetmetatable(Vector2,Vector2)\nend\n\ndo\n\tlocal Raw=UnityEngine.Vector4\n\tlocal Vector4={__typename='Vector4',__raw=Raw}\n\t_G['UnityEngine.Vector4.Instance']=Vector4\n\tUnityEngine.Vector4=Vector4\n\tlocal get={}\n\tlocal set={}\n\n\tVector4.__index = function(t,k)\n\t\tlocal f=rawget(Vector4,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tVector4.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\tVector4.__tostring = function(self)\n\t\treturn string.format('Vector4(%f,%f,%f,%f)',self[1],self[2],self[3],self[4])\n\tend\n\n\tfunction Vector4.New(x,y,z,w)\n\t\tlocal v={x or 0,y or 0,z or 0,w or 0}\n\t\tsetmetatable(v,Vector4)\n\t\treturn v\n\tend\n\n\tfunction Vector4.__call(t,x,y,z,w)\n\t\treturn Vector4.New(x,y,z,w)\n\tend\n\n\tfunction Vector4.__add( a,b )\n\t\treturn Vector4.New(a[1]+b[1],a[2]+b[2],a[3]+b[3],a[4]+b[4])\n\tend\n\n\tfunction Vector4.__sub( a,b )\n\t\treturn Vector4.New(a[1]-b[1],a[2]-b[2],a[3]-b[3],a[4]-b[4])\n\tend\n\n\tfunction Vector4.__eq( a,b )\n\t\treturn abs(a[1]-b[1])<Epsilon\n\t\t \tand abs(a[2]-b[2])<Epsilon\n\t\t \tand abs(a[3]-b[3])<Epsilon\n\t\t \tand abs(a[4]-b[4])<Epsilon\n\tend\n\n\tfunction Vector4.__mul( a,b )\n\t\treturn Vector4.New(a[1]*b,a[2]*b,a[3]*b,a[4]*b)\n\tend\n\n\tfunction Vector4.__div( a,b )\n\t\treturn Vector4.New(a[1]/b,a[2]/b,a[3]/b,a[4]/b)\n\tend\n\n\tfunction Vector4.__unm( a )\n\t\treturn Vector4.New(-a[1],-a[2],-a[3],-a[4])\n\tend\n\n\tfunction get.one() return Vector4.New(1,1,1,1) end\n\tfunction get.zero() return Vector4.New(0,0,0,0) end\n\tfunction get:x() return self[1]\tend\n\tfunction get:y() return self[2]\tend\n\tfunction get:z() return self[3]\tend\n\tfunction get:w() return self[4]\tend\n\tfunction get:magnitude() return sqrt(self[1]^2+self[2]^2+self[3]^2+self[4]^2) end\n\tfunction get:sqrMagnitude() return self[1]^2+self[2]^2+self[3]^2+self[4]^2 end\n\tfunction get:normalized() \n\t\tlocal m = self.magnitude\n\t\treturn Vector4.New(self[1]/m,self[2]/m,self[3]/m,self[4]/m)\n\tend\n\tfunction set:x(v) self[1]=v\tend\n\tfunction set:y(v) self[2]=v\tend\n\tfunction set:z(v) self[3]=v\tend\n\tfunction set:w(v) self[4]=v\tend\n\n\tfunction Vector4:Set( x,y,z,w )\n\t\tself[1],self[2],self[3],self[4]=x,y,z,w\n\tend\n\n\tfunction Vector4:ToString( ... )\n\t\treturn Vector4.__tostring(self)\n\tend\n\n\tinherite(Vector4,Raw)\n\n\tsetmetatable(Vector4,Vector4)\nend\n\ndo\n\tlocal Raw=UnityEngine.Quaternion\n\tlocal Inst=_G['UnityEngine.Quaternion.Instance']\n\tlocal Quaternion={__typename='Quaternion',__raw=Raw}\n\t_G['UnityEngine.Quaternion.Instance']=Quaternion\n\tUnityEngine.Quaternion=Quaternion\n\tlocal get={}\n\tlocal set={}\n\n\tQuaternion.__index = function(t,k)\n\t\tlocal f=rawget(Quaternion,k)\n\t\tif f then return f end\n\t\tlocal f=rawget(get,k)\n\t\tif f then return f(t) end\n\t\terror('Not found '..k)\n\tend\n\n\tQuaternion.__newindex = function(t,k,v)\n\t\tlocal f=rawget(set,k)\n\t\tif f then return f(t,v) end\n\t\terror('Not found '..k)\n\tend\n\n\tQuaternion.__tostring = function(self)\n\t\treturn string.format('Quaternion(%f,%f,%f,%f)',self[1],self[2],self[3],self[4])\n\tend\n\n\tQuaternion.__div = function(a,b)\n\t\treturn Quaternion.New(a[1]/b,a[2]/b,a[3]/b,a[4]/b)\n\tend\n\n\t-- reflector code\n\tQuaternion.__mul = function(a,b,target)\n\t\tif getmetatable(b).__typename=='Vector3' then\n\t\t\t    local vector=Vector3.New(0,0,0)\n\t\t\t    local num = a[1] * 2\n\t\t\t    local num2 = a[2] * 2\n\t\t\t    local num3 = a[3] * 2\n\t\t\t    local num4 = a[1] * num\n\t\t\t    local num5 = a[2] * num2\n\t\t\t    local num6 = a[3] * num3\n\t\t\t    local num7 = a[1] * num2\n\t\t\t    local num8 = a[1] * num3\n\t\t\t    local num9 = a[2] * num3\n\t\t\t    local num10 = a.w * num\n\t\t\t    local num11 = a.w * num2\n\t\t\t    local num12 = a.w * num3\n\t\t\t    vector[1] = (((1 - (num5 + num6)) * b[1]) + ((num7 - num12) * b[2])) + ((num8 + num11) * b[3])\n\t\t\t    vector[2] = (((num7 + num12) * b[1]) + ((1 - (num4 + num6)) * b[2])) + ((num9 - num10) * b[3])\n\t\t\t    vector[3] = (((num8 - num11) * b[1]) + ((num9 + num10) * b[2])) + ((1 - (num4 + num5)) * b[3])\n\t\t\t    return vector\n\t\telse\n\t\t\tlocal x,y,z,w =\n\t\t\t\t(((a[4] * b[1]) + (a[1] * b[4])) + (a[2] * b[3])) - (a[3] * b[2]),\n\t\t\t \t(((a[4] * b[2]) + (a[2] * b[4])) + (a[3] * b[1])) - (a[1] * b[3]),\n\t\t\t \t(((a[4] * b[3]) + (a[3] * b[4])) + (a[1] * b[2])) - (a[2] * b[1]),\n\t\t\t \t(((a[4] * b[4]) - (a[1] * b[1])) - (a[2] * b[2])) - (a[3] * b[3])\n\n\t\t\t if target then\n\t\t\t \ttarget[1],target[2],target[3],target[4]=x,y,z,w\n\t\t\t else\n\t\t\t \treturn Quaternion.New(x,y,z,w)\n\t\t\t end\n\t\tend\n\tend\n\n\tfunction Quaternion.Mul(a,b)\n\t\treturn Quaternion.__mul(a,b,a)\n\tend\n\n\t-- reflector code\n\tQuaternion.__eq = function(a,b)\n\t\treturn Quaternion.Dot(a,b)>0.999999\n\tend\n\n\n\tfunction Quaternion.New(x,y,z,w)\n\t\tlocal q={x or 0,y or 0,z or 0,w or 0}\n\t\tsetmetatable(q,Quaternion)\n\t\treturn q\n\tend\n\n\tfunction Quaternion.__call(t,x,y,z,w)\n\t\treturn Quaternion.New(x,y,z,w)\n\tend\n\n\tfunction get.identity() return Quaternion.New(0,0,0,1)\tend\n\tfunction get:x() return self[1]\tend\n\tfunction get:y() return self[2]\tend\n\tfunction get:z() return self[3]\tend\n\tfunction get:w() return self[4]\tend\n\tfunction set:x(v) self[1]=v\tend\n\tfunction set:y(v) self[2]=v\tend\n\tfunction set:z(v) self[3]=v\tend\n\tfunction set:w(v) self[4]=v\tend\n\n\tfunction get:eulerAngles() return Inst.eulerAngles[1](self) end\n\tfunction set:eulerAngles(v) Inst.eulerAngles[2](self,v) end\n\n\tfunction Quaternion:Set(x,y,z,w)\n\t\tself[1],self[2],self[3],self[4]=x,y,z,w\n\tend\n\n\tfunction Quaternion:Clone()\n\t\treturn Quaternion.New(self[1],self[2],self[3],self[4])\n\tend\n\n\tfunction Quaternion:ToAngleAxis()\n\t\tlocal angle = acos(self[4])*2\n\t\tif abs(angle-0)<Epsilon then\n\t\t\treturn angle,Vector3.New(1,0,0)\n\t\tend\n\t\tlocal div = 1/sqrt(1-self[4]^2)\n\t\treturn angle,Vector3.New(self[1]*div,self[2]*div,self[3]*div)\n\tend\n\n\t--TODO\n\tfunction Quaternion:SetFromToRotation(from,to)\n\t\tInst.SetFromToRotation(self,from,to)\n\tend\n\n\t--TODO\n\tfunction Quaternion:SetLookRotation(view,up)\n\t\tup = up or Vector3.up\n\t\tInst.SetLookRotation(self,view,up)\n\tend\n\n\tinherite(Quaternion,Raw)\n\n\tfunction Quaternion.Euler( x,y,z )\n\t\tif type(x)=='table' then\n\t\t\tx,y,z=x[1],x[2],x[3]\n\t\tend\n\t\tx,y,z=x*ToRad*0.5,y*ToRad*0.5,z*ToRad*0.5\n\n\t\tlocal cX=cos(x)\n\t\tlocal sX=sin(x)\n\t\tlocal cY=cos(y)\n\t\tlocal sY=sin(y)\n\t\tlocal cZ=cos(z)\n\t\tlocal sZ=sin(z)\n\t\t\n\t\tlocal qX=Quaternion.New(sX, 0, 0, cX)\n\t\tlocal qY=Quaternion.New(0, sY, 0, cY)\n\t\tlocal qZ=Quaternion.New(0, 0.0, sZ, cZ)\n\t\t\n\t\tQuaternion.Mul(qY,qX)\n\t\tQuaternion.Mul(qY,qZ)\n\t\treturn qY\n\tend\n\n\t-- code from reflector unityengine\n\tfunction Quaternion.Dot( a,b )\n\t\treturn a[1] * b[1] + a[2] * b[2] + a[3] * b[3] + a[4] * b[4]\n\tend\n\n\tfunction Quaternion.Normalize(q)\n\t\tq=Quaternion.Clone(q)\n\t\tlocal m=Quaternion.Dot(q,q)\n\t\tq[1],q[2],q[3],q[4]=q[1]/m,q[2]/m,q[3]/m,q[4]/m\n\t\treturn q\n\tend\n\n\tfunction Quaternion.Lerp( q1,q2,t )\n\t\tlocal tmpQuat=Quaternion.New(0,0,0,1)\n\t\tif Quaternion.Dot(q1, q2) < 0 then\n\t\t\ttmpQuat:Set(q1[1] + t * (-q2[1] - q1[1]),\n\t\t\t            q1[2] + t * (-q2[2] - q1[2]),\n\t\t\t            q1[3] + t * (-q2[3] - q1[3]),\n\t\t\t            q1[4] + t * (-q2[4] - q1[4]))\n\t\telse\n\t\t\ttmpQuat:Set(q1[1] + t * (q2[1] - q1[1]),\n\t\t\t            q1[2] + t * (q2[2] - q1[2]),\n\t\t\t            q1[3] + t * (q2[3] - q1[3]),\n\t\t\t            q1[4] + t * (q2[4] - q1[4]))\n\t\tend\n\t\treturn Quaternion.Normalize(tmpQuat)\n\tend\n\n\t-- code from unityengine\n\tfunction Quaternion.Slerp( q1,q2,t )\n\t\tt=clamp(t)\n\t\tlocal dot = Quaternion.Dot( q1, q2 )\n\t\tlocal tmpQuat=Quaternion.New(0,0,0,1)\n\t\tif dot < 0 then\n\t\t\tdot = -dot\n\t\t\ttmpQuat:Set( -q2[1],-q2[2],-q2[3],-q2[4] )\n\t\telse\n\t\t\ttmpQuat = q2\n\t\tend\n\n\t\t\n\t\tif dot < 0.95 then\n\t\t\tlocal angle = acos(dot)\n\t\t\tlocal sinadiv, sinat, sinaomt\n\t\t\tsinadiv = 1/sin(angle)\n\t\t\tsinat   = sin(angle*t)\n\t\t\tsinaomt = sin(angle*(1-t))\n\t\t\ttmpQuat:Set( (q1[1]*sinaomt+tmpQuat[1]*sinat)*sinadiv,\n\t\t\t\t     (q1[2]*sinaomt+tmpQuat[2]*sinat)*sinadiv,\n\t\t\t\t     (q1[3]*sinaomt+tmpQuat[3]*sinat)*sinadiv, \n\t\t\t\t     (q1[4]*sinaomt+tmpQuat[4]*sinat)*sinadiv  )\n\t\t\treturn tmpQuat\n\t\telse\n\t\t\treturn Quaternion.Lerp(q1,tmpQuat,t)\n\t\tend\n\tend\n\n\tsetmetatable(Quaternion,Quaternion)\nend\n\n\";\n#endif\n        public static void reg(IntPtr l)\n        {\n#if !LUA_5_3 && !SLUA_STANDALONE\n            // lua implemented valuetype isn't faster than raw under non-jit.\n\t\t\tLuaState.get(l).doString(script,\"ValueTypeScript\");\n#endif\n        }\n    }\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaValueType.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 9eb49e35ce65fa54ca031503cef0894a\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaVarObject.cs",
    "content": "﻿// The MIT License (MIT)\r\n\r\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\r\n// \r\n// Permission is hereby granted, free of charge, to any person obtaining a copy\r\n// of this software and associated documentation files (the \"Software\"), to deal\r\n// in the Software without restriction, including without limitation the rights\r\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n// copies of the Software, and to permit persons to whom the Software is\r\n// furnished to do so, subject to the following conditions:\r\n// \r\n// The above copyright notice and this permission notice shall be included in\r\n// all copies or substantial portions of the Software.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n// THE SOFTWARE.\r\n\r\n\r\nnamespace SLua\r\n{\r\n    using System.Collections;\r\n    using System.Collections.Generic;\r\n    using System;\r\n    using System.Reflection;\r\n    using System.Runtime.InteropServices;\r\n\r\n    // Try to avoid using this class for not export class\r\n    // This class use reflection and not completed, you should write your code for your purpose.\r\n    class LuaVarObject : LuaObject\r\n    {\r\n\r\n        /// <summary>\r\n        /// A cache list of MemberInfo, for reflection optimize\r\n        /// </summary>\r\n        static Dictionary<Type, Dictionary<string, List<MemberInfo>>> cachedMemberInfos = new Dictionary<Type, Dictionary<string, List<MemberInfo>>>();\r\n\r\n        class MethodWrapper\r\n        {\r\n            object self;\r\n            IList<MemberInfo> mis;\r\n            public MethodWrapper(object self, IList<MemberInfo> mi)\r\n            {\r\n                this.self = self;\r\n                this.mis = mi;\r\n            }\r\n\r\n            bool matchType(IntPtr l, int p, LuaTypes lt, Type t)\r\n            {\r\n                if (t.IsPrimitive && t != typeof(bool))\r\n                    return lt == LuaTypes.LUA_TNUMBER;\r\n\r\n                if (t == typeof(bool))\r\n                    return lt == LuaTypes.LUA_TBOOLEAN;\r\n\r\n                if (t == typeof(string))\r\n                    return lt == LuaTypes.LUA_TSTRING;\r\n\r\n                switch (lt)\r\n                {\r\n                    case LuaTypes.LUA_TFUNCTION:\r\n                        return t == typeof(LuaFunction) || t.BaseType == typeof(MulticastDelegate);\r\n                    case LuaTypes.LUA_TTABLE:\r\n                        return t == typeof(LuaTable) || LuaObject.luaTypeCheck(l, p, t.Name);\r\n                    default:\r\n                        return lt == LuaTypes.LUA_TUSERDATA || t == typeof(object);\r\n                }\r\n            }\r\n\r\n            object checkVar(IntPtr l, int p, Type t)\r\n            {\r\n                string tn = t.Name;\r\n\r\n                switch (tn)\r\n                {\r\n                    case \"String\":\r\n                        {\r\n                            string str;\r\n                            if (checkType(l, p, out str))\r\n                                return str;\r\n                        }\r\n                        break;\r\n                    case \"Decimal\":\r\n                        return (decimal)LuaDLL.lua_tonumber(l, p);\r\n                    case \"Int64\":\r\n                        return (long)LuaDLL.lua_tonumber(l, p);\r\n                    case \"UInt64\":\r\n                        return (ulong)LuaDLL.lua_tonumber(l, p);\r\n                    case \"Int32\":\r\n                        return (int)LuaDLL.lua_tointeger(l, p);\r\n                    case \"UInt32\":\r\n                        return (uint)LuaDLL.lua_tointeger(l, p);\r\n                    case \"Single\":\r\n                        return (float)LuaDLL.lua_tonumber(l, p);\r\n                    case \"Double\":\r\n                        return (double)LuaDLL.lua_tonumber(l, p);\r\n                    case \"Boolean\":\r\n                        return (bool)LuaDLL.lua_toboolean(l, p);\r\n                    case \"Byte\":\r\n                        return (byte)LuaDLL.lua_tointeger(l, p);\r\n                    case \"UInt16\":\r\n                        return (ushort)LuaDLL.lua_tointeger(l, p);\r\n                    case \"Int16\":\r\n                        return (short)LuaDLL.lua_tointeger(l, p);\r\n                    default:\r\n                        // Enum convert\r\n                        if (t.IsEnum)\r\n                        {\r\n                            var num = LuaDLL.lua_tointeger(l, p);\r\n                            return Enum.ToObject(t, num);\r\n                        }\r\n                        return LuaObject.checkVar(l, p);\r\n                }\r\n                return null;\r\n            }\r\n\r\n            internal bool matchType(IntPtr l, int from, ParameterInfo[] pis, bool isstatic)\r\n            {\r\n                int top = LuaDLL.lua_gettop(l);\r\n                from = isstatic ? from : from + 1;\r\n\r\n                if (top - from + 1 != pis.Length)\r\n                    return false;\r\n\r\n                for (int n = 0; n < pis.Length; n++)\r\n                {\r\n                    int p = n + from;\r\n                    LuaTypes t = LuaDLL.lua_type(l, p);\r\n                    if (!matchType(l, p, t, pis[n].ParameterType))\r\n                        return false;\r\n                }\r\n                return true;\r\n            }\r\n\r\n            public int invoke(IntPtr l)\r\n            {\r\n                for (int k = 0; k < mis.Count; k++)\r\n                {\r\n                    MethodInfo m = (MethodInfo)mis[k];\r\n                    if (matchType(l, 2, m.GetParameters(), m.IsStatic))\r\n                    {\r\n                        return forceInvoke(l, m);\r\n                    }\r\n                }\r\n                // cannot find best match function, try call first one\r\n                return forceInvoke(l, mis[0] as MethodInfo);\r\n                //return error(l, \"Can't find valid overload function {0} to invoke or parameter type mis-matched.\", mis[0].Name);\r\n            }\r\n\r\n            /// <summary>\r\n            /// invoke a C# method without match check\r\n            /// </summary>\r\n            /// <param name=\"l\"></param>\r\n            /// <param name=\"m\"></param>\r\n            /// <returns></returns>\r\n\t\t\tprivate int forceInvoke(IntPtr l, MethodInfo m)\r\n\t\t\t{\r\n\t\t\t\tobject[] args;\r\n\t\t\t\tcheckArgs(l, 1, m, out args);\r\n\t\t\t\tobject ret = m.Invoke(m.IsStatic ? null : self, args);\r\n\t\t\t\tvar pis = m.GetParameters();\r\n\t\t\t\tpushValue(l, true);\r\n\t\t\t\tif (ret != null)\r\n\t\t\t\t{\r\n\t\t\t\t\tpushVar(l, ret);\r\n\t\t\t\t\tint ct = 2;\r\n\t\t\t\t\tfor (int i = 0; i < pis.Length; ++i) {\r\n\t\t\t\t\t\tvar pi = pis[i];\r\n\t\t\t\t\t\tif (pi.ParameterType.IsByRef || pi.IsOut) {\r\n\t\t\t\t\t\t\tpushValue(l, args[i]);\r\n\t\t\t\t\t\t\t++ct;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn ct;\r\n\t\t\t\t}\r\n\t\t\t\treturn 1;\r\n\t\t\t}\r\n\r\n            public void checkArgs(IntPtr l, int from, MethodInfo m, out object[] args)\r\n            {\r\n                ParameterInfo[] ps = m.GetParameters();\r\n                args = new object[ps.Length];\r\n                int k = 0;\r\n                from = m.IsStatic ? from + 1 : from + 2;\r\n\r\n                for (int n = from; n <= LuaDLL.lua_gettop(l); n++, k++)\r\n                {\r\n                    if (k + 1 > ps.Length)\r\n                        break;\r\n                    args[k] = checkVar(l, n, ps[k].ParameterType);\r\n                }\r\n            }\r\n        }\r\n\r\n\r\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\r\n        static public int luaIndex(IntPtr l)\r\n        {\r\n            try\r\n            {\r\n                ObjectCache oc = ObjectCache.get(l);\r\n                object self = oc.get(l, 1);\r\n\r\n                LuaTypes t = LuaDLL.lua_type(l, 2);\r\n                switch (t)\r\n                {\r\n                    case LuaTypes.LUA_TSTRING:\r\n                        return indexString(l, self, LuaDLL.lua_tostring(l, 2));\r\n                    case LuaTypes.LUA_TNUMBER:\r\n                        return indexInt(l, self, LuaDLL.lua_tointeger(l, 2));\r\n                    default:\r\n                        return indexObject(l, self, checkObj(l, 2));\r\n                }\r\n            }\r\n            catch (Exception e)\r\n            {\r\n                return error(l, e);\r\n            }\r\n        }\r\n\r\n        static int indexObject(IntPtr l, object self, object key)\r\n        {\r\n\r\n            if (self is IDictionary)\r\n            {\r\n                var dict = self as IDictionary;\r\n                \r\n                object v = dict[key];\r\n                pushValue(l, true);\r\n                pushVar(l, v);\r\n                return 2;\r\n            }\r\n            return 0;\r\n\r\n        }\r\n\r\n        static Type getType(object o)\r\n        {\r\n            if (o is LuaClassObject)\r\n                return (o as LuaClassObject).GetClsType();\r\n            return o.GetType();\r\n        }\r\n\r\n        static int indexString(IntPtr l, object self, string key)\r\n        {\r\n            Type t = getType(self);\r\n\r\n            if (self is IDictionary)\r\n            {\r\n                if (t.IsGenericType && t.GetGenericArguments()[0] != typeof(string))\r\n                {\r\n                    goto IndexProperty;\r\n                }\r\n                object v = (self as IDictionary)[key];\r\n                if (v != null)\r\n                {\r\n                    pushValue(l, true);\r\n                    pushVar(l, v);\r\n                    return 2;\r\n                }\r\n            }\r\n\r\n            IndexProperty:\r\n\r\n            var mis = GetCacheMembers(t, key);\r\n            if (mis == null || mis.Count == 0)\r\n            {\r\n                return error(l, \"Can't find \" + key);\r\n            }\r\n\r\n            pushValue(l, true);\r\n            MemberInfo mi = mis[0];\r\n            switch (mi.MemberType)\r\n            {\r\n                case MemberTypes.Property:\r\n                    PropertyInfo p = (PropertyInfo)mi;\r\n                    MethodInfo get = p.GetGetMethod(true);\r\n                    pushVar(l, get.Invoke(self, null));\r\n                    break;\r\n                case MemberTypes.Field:\r\n                    FieldInfo f = (FieldInfo)mi;\r\n                    pushVar(l, f.GetValue(self));\r\n                    break;\r\n                case MemberTypes.Method:\r\n                    LuaCSFunction ff = new MethodWrapper(self, mis).invoke;\r\n                    pushObject(l, ff);\r\n                    break;\r\n                case MemberTypes.Event:\r\n                    break;\r\n                default:\r\n                    return 1;\r\n            }\r\n\r\n            return 2;\r\n\r\n        }\r\n\r\n        /// <summary>\r\n        /// Collect Type Members, including base type\r\n        /// </summary>\r\n        /// <param name=\"type\"></param>\r\n        /// <param name=\"key\"></param>\r\n        /// <param name=\"memberList\"></param>\r\n        static void CollectTypeMembers(Type type, ref Dictionary<string, List<MemberInfo>> membersMap)\r\n        {\r\n            var mems = type.GetMembers(BindingFlags.Static | BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.DeclaredOnly); // GetMembers can get basetType's members, but GetMember cannot\r\n            for (var i = 0; i < mems.Length; i++)\r\n            {\r\n                var mem = mems[i];\r\n                List<MemberInfo> members;\r\n                if (!membersMap.TryGetValue(mem.Name, out members))\r\n                {\r\n                    members = membersMap[mem.Name] = new List<MemberInfo>();\r\n                }\r\n                members.Add(mem);\r\n            }\r\n            if (type.BaseType != null)\r\n            {\r\n                CollectTypeMembers(type.BaseType, ref membersMap);\r\n            }\r\n\r\n        }\r\n        /// <summary>\r\n        /// Get Member from Type, use reflection, use cache Dictionary\r\n        /// </summary>\r\n        /// <param name=\"type\"></param>\r\n        /// <param name=\"key\"></param>\r\n        /// <returns></returns>\r\n        static IList<MemberInfo> GetCacheMembers(Type type, string key)\r\n        {\r\n            Dictionary<string, List<MemberInfo>> cache;\r\n            if (!cachedMemberInfos.TryGetValue(type, out cache))\r\n            {\r\n                cachedMemberInfos[type] = cache = new Dictionary<string, List<MemberInfo>>();\r\n                // Get Member including all parent fields\r\n                CollectTypeMembers(type, ref cache);\r\n            }\r\n            return cache[key];\r\n        }\r\n\r\n        static int newindexString(IntPtr l, object self, string key)\r\n        {\r\n            if (self is IDictionary)\r\n            {\r\n                var dictType = getType(self);\r\n                var valueType = dictType.GetGenericArguments()[1];\r\n                (self as IDictionary)[key] = checkVar(l, 3, valueType);\r\n                return ok(l);\r\n            }\r\n\r\n            Type t = getType(self);\r\n            //MemberInfo[] mis = t.GetMember(key, BindingFlags.Static | BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic);\r\n            //if (mis.Length == 0)\r\n            //{\r\n            //    return error(l, \"Can't find \" + key);\r\n            //}\r\n\r\n            var mis = GetCacheMembers(t, key);\r\n            if (mis == null || mis.Count == 0)\r\n            {\r\n                return error(l, \"Can't find \" + key);\r\n            }\r\n            MemberInfo mi = mis[0];\r\n            switch (mi.MemberType)\r\n            {\r\n                case MemberTypes.Property:\r\n                    {\r\n                        PropertyInfo p = (PropertyInfo)mi;\r\n                        MethodInfo set = p.GetSetMethod(true);\r\n                        var value = checkVar(l, 3, p.PropertyType);\r\n                        set.Invoke(self, new object[] { value });\r\n                        break;\r\n                    }\r\n                case MemberTypes.Field:\r\n                    {\r\n                        FieldInfo f = (FieldInfo)mi;\r\n                        var value = checkVar(l, 3, f.FieldType);\r\n                        f.SetValue(self, value);\r\n                        break;\r\n                    }\r\n                case MemberTypes.Method:\r\n                    return error(l, \"Method can't set\");\r\n                case MemberTypes.Event:\r\n                    return error(l, \"Event can't set\");\r\n\r\n            }\r\n            return ok(l);\r\n        }\r\n\r\n\r\n        static int indexInt(IntPtr l, object self, int index)\r\n        {\r\n            Type type = getType(self);\r\n            if (self is IList)\r\n            {\r\n                pushValue(l, true);\r\n                pushVar(l, (self as IList)[index]);\r\n                return 2;\r\n            }\r\n            else if (self is IDictionary)\r\n            {\r\n                var dict = (IDictionary)self;// as IDictionary;\r\n                //support enumerate key\r\n                object dictKey = index;\r\n                if (type.IsGenericType)\r\n                {\r\n                    Type keyType = type.GetGenericArguments()[0];\r\n\r\n                    if (keyType.IsEnum)\r\n                    {\r\n                        pushValue(l, true);\r\n                        pushVar(l, dict[Enum.Parse(keyType, dictKey.ToString())]);\r\n                        return 2;\r\n                    }\r\n\r\n                    dictKey = changeType(dictKey, keyType); // if key is not int but ushort/uint,  IDictionary will cannot find the key and return null!\r\n                }\r\n                \r\n                pushValue(l, true);\r\n                pushVar(l, dict[dictKey]);\r\n                return 2;\r\n            }\r\n            return 0;\r\n        }\r\n\r\n        static int newindexInt(IntPtr l, object self, int index)\r\n        {\r\n            Type type = getType(self);\r\n            if (self is IList)\r\n            {\r\n                if (type.IsGenericType)\r\n                {\r\n                    Type t = type.GetGenericArguments()[0];\r\n                    (self as IList)[index] = changeType(checkVar(l, 3), t);\r\n                }\r\n                else\r\n                    (self as IList)[index] = checkVar(l, 3);\r\n            }\r\n            else if (self is IDictionary)\r\n            {\r\n                Type keyType = type.GetGenericArguments()[0];\r\n                object dictKey = index;\r\n                dictKey = changeType(dictKey, keyType); // if key is not int but ushort/uint,  IDictionary will cannot find the key and return null!\r\n\r\n                if (type.IsGenericType)\r\n                {\r\n                    Type t = type.GetGenericArguments()[1];\r\n                    (self as IDictionary)[dictKey] = changeType(checkVar(l, 3), t);\r\n                }\r\n                else\r\n                    (self as IDictionary)[dictKey] = checkVar(l, 3);\r\n            }\r\n\r\n            pushValue(l, true);\r\n            return 1;\r\n        }\r\n\r\n        static int newindexObject(IntPtr l, object self, object k, object v)\r\n        {\r\n            if (self is IDictionary)\r\n            {\r\n                var dict = self as IDictionary;\r\n                var dictType = getType(self);\r\n                var valueType = dictType.GetGenericArguments()[1];\r\n\r\n                var key = k;\r\n                var value = changeType(v, valueType);\r\n                dict[key] = value;\r\n            }\r\n            return ok(l);\r\n        }\r\n\r\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\r\n        static public int luaNewIndex(IntPtr l)\r\n        {\r\n            try\r\n            {\r\n                ObjectCache oc = ObjectCache.get(l);\r\n                object self = oc.get(l, 1);\r\n\r\n                LuaTypes t = LuaDLL.lua_type(l, 2);\r\n                switch (t)\r\n                {\r\n                    case LuaTypes.LUA_TSTRING:\r\n                        return newindexString(l, self, LuaDLL.lua_tostring(l, 2));\r\n                    case LuaTypes.LUA_TNUMBER:\r\n                        return newindexInt(l, self, LuaDLL.lua_tointeger(l, 2));\r\n                    default:\r\n                        return newindexObject(l, self, checkVar(l, 2), checkVar(l, 3));\r\n                }\r\n            }\r\n            catch (Exception e)\r\n            {\r\n                return error(l, e);\r\n            }\r\n        }\r\n\r\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\r\n        static public int methodWrapper(IntPtr l)\r\n        {\r\n            try\r\n            {\r\n                ObjectCache oc = ObjectCache.get(l);\r\n                LuaCSFunction func = (LuaCSFunction)oc.get(l, 1);\r\n                return func(l);\r\n            }\r\n            catch (Exception e)\r\n            {\r\n                return error(l, e);\r\n            }\r\n        }\r\n\r\n        static new public void init(IntPtr l)\r\n        {\r\n            LuaDLL.lua_createtable(l, 0, 3);\r\n            pushValue(l, luaIndex);\r\n            LuaDLL.lua_setfield(l, -2, \"__index\");\r\n            pushValue(l, luaNewIndex);\r\n            LuaDLL.lua_setfield(l, -2, \"__newindex\");\r\n            LuaDLL.lua_pushcfunction(l, lua_gc);\r\n            LuaDLL.lua_setfield(l, -2, \"__gc\");\r\n            LuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX, \"LuaVarObject\");\r\n\r\n            LuaDLL.lua_createtable(l, 0, 1);\r\n            pushValue(l, methodWrapper);\r\n            LuaDLL.lua_setfield(l, -2, \"__call\");\r\n            LuaDLL.lua_setfield(l, LuaIndexes.LUA_REGISTRYINDEX, ObjectCache.getAQName(typeof(LuaCSFunction)));\r\n        }\r\n    }\r\n\r\n    class LuaClassObject\r\n    {\r\n        Type cls;\r\n\r\n        public LuaClassObject(Type t)\r\n        {\r\n            cls = t;\r\n        }\r\n\r\n        public Type GetClsType()\r\n        {\r\n            return cls;\r\n        }\r\n    }\r\n}\r\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/LuaVarObject.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 99134f2c79521c04e9ca31bc724dfe6a\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/ObjectCache.cs",
    "content": "// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nusing System.Runtime.CompilerServices;\n\nnamespace SLua\n{\n\tusing System;\n\tusing System.Runtime.InteropServices;\n\tusing System.Collections.Generic;\n\tusing System.Runtime.CompilerServices;\n\n\tpublic class ObjectCache\n\t{\n\t\tstatic Dictionary<IntPtr, ObjectCache> multiState = new Dictionary<IntPtr, ObjectCache>();\n\n\t\tstatic IntPtr oldl = IntPtr.Zero;\n\t\tstatic internal ObjectCache oldoc = null;\n\n\t\tpublic static ObjectCache get(IntPtr l)\n\t\t{\n\t\t\tif (oldl == l)\n\t\t\t\treturn oldoc;\n\t\t\tObjectCache oc;\n\t\t\tif (multiState.TryGetValue(l, out oc))\n\t\t\t{\n\t\t\t\toldl = l;\n\t\t\t\toldoc = oc;\n\t\t\t\treturn oc;\n\t\t\t}\n\n\t\t\tLuaDLL.lua_getglobal(l, \"__main_state\");\n\t\t\tif (LuaDLL.lua_isnil(l, -1))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tIntPtr nl = LuaDLL.lua_touserdata(l, -1);\n\t\t\tLuaDLL.lua_pop(l, 1);\n\t\t\tif (nl != l)\n\t\t\t\treturn get(nl);\n\t\t\treturn null;\n\t\t}\n\n\t\tclass ObjSlot\n\t\t{\n\t\t\tpublic int freeslot;\n\t\t\tpublic object v;\n\t\t\tpublic ObjSlot(int slot, object o)\n\t\t\t{\n\t\t\t\tfreeslot = slot;\n\t\t\t\tv = o;\n\t\t\t}\n\t\t}\n\n#if SPEED_FREELIST\n\t\tclass FreeList : List<ObjSlot>\n\t\t{\n\t\t\tpublic FreeList()\n\t\t\t{\n\t\t\t\tthis.Add(new ObjSlot(0, null));\n\t\t\t}\n\n\t\t\tpublic int add(object o)\n\t\t\t{\n\t\t\t\tObjSlot free = this[0];\n\t\t\t\tif (free.freeslot == 0)\n\t\t\t\t{\n\t\t\t\t\tAdd(new ObjSlot(this.Count, o));\n\t\t\t\t\treturn this.Count - 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint slot = free.freeslot;\n\t\t\t\t\tfree.freeslot = this[slot].freeslot;\n\t\t\t\t\tthis[slot].v = o;\n\t\t\t\t\tthis[slot].freeslot = slot;\n\t\t\t\t\treturn slot;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpublic void del(int i)\n\t\t\t{\n\t\t\t\tObjSlot free = this[0];\n\t\t\t\tthis[i].freeslot = free.freeslot;\n\t\t\t\tthis[i].v = null;\n\t\t\t\tfree.freeslot = i;\n\t\t\t}\n\n\t\t\tpublic bool get(int i, out object o)\n\t\t\t{\n\t\t\t\tif (i < 1 || i > this.Count)\n\t\t\t\t{\n\t\t\t\t\tthrow new ArgumentOutOfRangeException();\n\t\t\t\t}\n\n\t\t\t\tObjSlot slot = this[i];\n\t\t\t\to = slot.v;\n\t\t\t\treturn o != null;\n\t\t\t}\n\n\t\t\tpublic object get(int i)\n\t\t\t{\n\t\t\t\tobject o;\n\t\t\t\tif (get(i, out o))\n\t\t\t\t\treturn o;\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tpublic void set(int i, object o)\n\t\t\t{\n\t\t\t\tthis[i].v = o;\n\t\t\t}\n\t\t}\n#else\n\n\t\tclass FreeList : Dictionary<int, object>\n\t\t{\n\t\t\tprivate int id = 1;\n\t\t\tpublic int add(object o)\n\t\t\t{\n\t\t\t\tAdd(id, o);\n\t\t\t\treturn id++;\n\t\t\t}\n\n\t\t\tpublic void del(int i)\n\t\t\t{\n\t\t\t\tthis.Remove(i);\n\t\t\t}\n\n\t\t\tpublic bool get(int i, out object o)\n\t\t\t{\n\t\t\t\treturn TryGetValue(i, out o);\n\t\t\t}\n\n\t\t\tpublic object get(int i)\n\t\t\t{\n\t\t\t\tobject o;\n\t\t\t\tif (TryGetValue(i, out o))\n\t\t\t\t\treturn o;\n\t\t\t\treturn null;\n\t\t\t}\n\n\t\t\tpublic void set(int i, object o)\n\t\t\t{\n\t\t\t\tthis[i] = o;\n\t\t\t}\n\t\t}\n\n#endif\n\n\t\tFreeList cache = new FreeList();\n        public class ObjEqualityComparer : IEqualityComparer<object>\n        {\n            public new bool Equals(object x, object y)\n            {\n\n                return ReferenceEquals(x, y);\n            }\n\n            public int GetHashCode(object obj)\n            {\n                return RuntimeHelpers.GetHashCode(obj);\n            }\n        }\n\n\t\tDictionary<object, int> objMap = new Dictionary<object, int>(new ObjEqualityComparer());\n\t\tint udCacheRef = 0;\n\n\n\t\tpublic ObjectCache(IntPtr l)\n\t\t{\n\t\t\tLuaDLL.lua_newtable(l);\n\t\t\tLuaDLL.lua_newtable(l);\n\t\t\tLuaDLL.lua_pushstring(l, \"v\");\n\t\t\tLuaDLL.lua_setfield(l, -2, \"__mode\");\n\t\t\tLuaDLL.lua_setmetatable(l, -2);\n\t\t\tudCacheRef = LuaDLL.luaL_ref(l, LuaIndexes.LUA_REGISTRYINDEX);\n\t\t}\n\n\n\t\tstatic public void clear()\n\t\t{\n\n\t\t\toldl = IntPtr.Zero;\n\t\t\toldoc = null;\n\n\t\t}\n\t\tinternal static void del(IntPtr l)\n\t\t{\n\t\t\tmultiState.Remove(l);\n\t\t}\n\n\t\tinternal static void make(IntPtr l)\n\t\t{\n\t\t\tObjectCache oc = new ObjectCache(l);\n\t\t\tmultiState[l] = oc;\n\t\t\toldl = l;\n\t\t\toldoc = oc;\n\t\t}\n\n        public int size()\n        {\n            return objMap.Count;\n        }\n\n\t\tinternal void gc(int index)\n\t\t{\n\t\t\tobject o;\n\t\t\tif (cache.get(index, out o))\n\t\t\t{\n\t\t\t\tint oldindex;\n\t\t\t\tif (isGcObject(o) && objMap.TryGetValue(o,out oldindex) && oldindex==index)\n\t\t\t\t{\n\t\t\t\t\tobjMap.Remove(o);\n\t\t\t\t}\n\t\t\t\tcache.del(index);\n\t\t\t}\n\t\t}\n#if !SLUA_STANDALONE\n        internal void gc(UnityEngine.Object o)\n        {\n            int index;\n            if(objMap.TryGetValue(o, out index))\n            {\n                objMap.Remove(o);\n                cache.del(index);\n            }\n        }\n#endif\n\n\t\tinternal int add(object o)\n\t\t{\n\t\t\tint objIndex = cache.add(o);\n\t\t\tif (isGcObject(o))\n\t\t\t{\n\t\t\t\tobjMap[o] = objIndex;\n\t\t\t}\n\t\t\treturn objIndex;\n\t\t}\n\n\t\tinternal object get(IntPtr l, int p)\n\t\t{\n\n\t\t\tint index = LuaDLL.luaS_rawnetobj(l, p);\n\t\t\tobject o;\n\t\t\tif (index != -1 && cache.get(index, out o))\n\t\t\t{\n\t\t\t\treturn o;\n\t\t\t}\n\t\t\treturn null;\n\n\t\t}\n\n\t\tinternal void setBack(IntPtr l, int p, object o)\n\t\t{\n\n\t\t\tint index = LuaDLL.luaS_rawnetobj(l, p);\n\t\t\tif (index != -1)\n\t\t\t{\n\t\t\t\tcache.set(index, o);\n\t\t\t}\n\n\t\t}\n\n\t\tinternal void push(IntPtr l, object o)\n\t\t{\n\t\t\tpush(l, o, true);\n\t\t}\n\n\t\tinternal void push(IntPtr l, Array o)\n\t\t{\n\t\t\tint index = allocID (l, o);\n\t\t\tif (index < 0)\n\t\t\t\treturn;\n\n\t\t\tLuaDLL.luaS_pushobject(l, index, \"LuaArray\", true, udCacheRef);\n\t\t}\n\n\t\tinternal int allocID(IntPtr l,object o) {\n\n\t\t\tint index = -1;\n\n\t\t\tif (o == null)\n\t\t\t{\n\t\t\t\tLuaDLL.lua_pushnil(l);\n\t\t\t\treturn index;\n\t\t\t}\n\n\t\t\tbool gco = isGcObject(o);\n\t\t\tbool found = gco && objMap.TryGetValue(o, out index);\n\t\t\tif (found)\n\t\t\t{\n\t\t\t\tif (LuaDLL.luaS_getcacheud(l, index, udCacheRef) == 1)\n\t\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tindex = add(o);\n\t\t\treturn index;\n\t\t}\n\n\t\tinternal void push(IntPtr l, object o, bool checkReflect)\n\t\t{\n\t\t\t\n\t\t\tint index = allocID (l, o);\n\t\t\tif (index < 0)\n\t\t\t\treturn;\n\n\t\t\tbool gco = isGcObject(o);\n\n#if SLUA_CHECK_REFLECTION\n\t\t\tint isReflect = LuaDLL.luaS_pushobject(l, index, getAQName(o), gco, udCacheRef);\n\t\t\tif (isReflect != 0 && checkReflect)\n\t\t\t{\n\t\t\t\tLogger.LogWarning(string.Format(\"{0} not exported, using reflection instead\", o.ToString()));\n\t\t\t}\n#else\n\t\t\tLuaDLL.luaS_pushobject(l, index, getAQName(o), gco, udCacheRef);\n#endif\n\n\t\t}\n\n\t\tstatic Dictionary<Type, string> aqnameMap = new Dictionary<Type, string>();\n\t\tstatic string getAQName(object o)\n\t\t{\n\t\t\tType t = o.GetType();\n\t\t\treturn getAQName(t);\n\t\t}\n\n\t\tinternal static string getAQName(Type t)\n\t\t{\n\t\t\tstring name;\n\t\t\tif (aqnameMap.TryGetValue(t, out name))\n\t\t\t{\n\t\t\t\treturn name;\n\t\t\t}\n\t\t\tname = t.AssemblyQualifiedName;\n\t\t\taqnameMap[t] = name;\n\t\t\treturn name;\n\t\t}\n\n\n\t\tbool isGcObject(object obj)\n\t\t{\n\t\t\treturn obj.GetType().IsValueType == false;\n\t\t}\n\t}\n}\n\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/ObjectCache.cs.meta",
    "content": "fileFormatVersion: 2\nguid: db802782d21a2cb4f99e0b7785cd279c\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/SLuaSetting.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nusing System.Collections;\n#if UNITY_EDITOR\nusing UnityEditor;\n#endif\n#if !SLUA_STANDALONE\nusing UnityEngine;\n#endif\n\nnamespace SLua{\n\tpublic enum EOL{\n\t\tNative,\n\t\tCRLF,\n\t\tCR,\n\t\tLF,\n\t}\n\n\tpublic class SLuaSetting \n#if !SLUA_STANDALONE\n        : ScriptableObject\n#endif\n    {\n\n\t\tpublic EOL eol = EOL.Native;\n\t\tpublic bool exportExtensionMethod = true;\n\t\tpublic string UnityEngineGeneratePath = \"Assets/Slua/LuaObject/\";\n\n\t\t// public int debugPort=10240;\n\t\t// public string debugIP=\"0.0.0.0\"; // no longer debugger built-in\n\n\t\tprivate static SLuaSetting _instance=null;\n\t\tpublic static SLuaSetting Instance{\n\t\t\tget{\n#if !SLUA_STANDALONE\n\t\t\t\tif(_instance == null){\n\t\t\t\t\t_instance = Resources.Load<SLuaSetting>(\"setting\");\n\n#if UNITY_EDITOR\n\t\t\t\t\tif(_instance == null){\n\t\t\t\t\t\t_instance =  SLuaSetting.CreateInstance<SLuaSetting>();\n\t\t\t\t\t\tAssetDatabase.CreateAsset(_instance,\"Assets/Slua/Resources/setting.asset\");\n\t\t\t\t\t}\n#endif\n\n\t\t\t\t}\n#endif\n\t\t\t\treturn _instance;\n\t\t\t}\n\t\t}\n\n#if UNITY_EDITOR && !SLUA_STANDALONE\n\t\t[MenuItem(\"SLua/Setting\")]\n\t\tpublic static void Open(){\n\t\t\tSelection.activeObject = Instance;\n\t\t}\n#endif\n\n\t}\n\n}\n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/SLuaSetting.cs.meta",
    "content": "fileFormatVersion: 2\nguid: aa35f0feac8a2f2459bb9b0f11233a7e\ntimeCreated: 1449026073\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Timer.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n\tusing System;\n\tusing System.Collections.Generic;\n\t\n\tpublic class LuaTimer : LuaObject\n\t{\n\t\tclass Timer\n\t\t{\n\t\t\tinternal int sn;\n\t\t\tinternal int cycle;\n\t\t\tinternal int deadline;\n\t\t\tinternal Func<int, bool> handler;\n\t\t\tinternal bool delete;\n\t\t\tinternal LinkedList<Timer> container;\n\t\t}\n\t\tclass Wheel\n\t\t{\n\t\t\tinternal static int dial_scale = 256;\n\t\t\tinternal int head;\n\t\t\tinternal LinkedList<Timer>[] vecDial;\n\t\t\tinternal int dialSize;\n\t\t\tinternal int timeRange;\n\t\t\tinternal Wheel nextWheel;\n\t\t\tinternal Wheel(int dialSize)\n\t\t\t{\n\t\t\t\tthis.dialSize = dialSize;\n\t\t\t\tthis.timeRange = dialSize * dial_scale;\n\t\t\t\tthis.head = 0;\n\t\t\t\tthis.vecDial = new LinkedList<Timer>[dial_scale];\n\t\t\t\tfor (int i = 0; i < dial_scale; ++i)\n\t\t\t\t{\n\t\t\t\t\tthis.vecDial[i] = new LinkedList<Timer>();\n\t\t\t\t}\n\t\t\t}\n\t\t\tinternal LinkedList<Timer> nextDial()\n\t\t\t{\n\t\t\t\treturn vecDial[head++];\n\t\t\t}\n\t\t\tinternal void add(int delay, Timer tm)\n\t\t\t{\n\t\t\t\tvar container = vecDial[(head + (delay - (dialSize - jiffies_msec)) / dialSize) % dial_scale];\n\t\t\t\tcontainer.AddLast(tm);\n\t\t\t\ttm.container = container;\n\t\t\t}\n\t\t}\n\t\tstatic int nextSn = 0;\n\t\tstatic int jiffies_msec = 20;\n\t\tstatic float jiffies_sec = jiffies_msec * .001f;\n\t\tstatic Wheel[] wheels;\n\t\tstatic float pileSecs;\n\t\tstatic float nowTime;\n\t\tstatic Dictionary<int, Timer> mapSnTimer;\n\t\tstatic LinkedList<Timer> executeTimers;\n\t\t\n\t\tstatic int intpow(int n, int m)\n\t\t{\n\t\t\tint ret = 1;\n\t\t\tfor (int i = 0; i < m; ++i)\n\t\t\t\tret *= n;\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tstatic void innerAdd(int deadline, Timer tm)\n\t\t{\n\t\t\ttm.deadline = deadline;\n\t\t\tint delay = Math.Max(0, deadline - now());\n\t\t\tWheel suitableWheel = wheels[wheels.Length - 1];\n\t\t\tfor (int i = 0; i < wheels.Length; ++i)\n\t\t\t{\n\t\t\t\tvar wheel = wheels[i];\n\t\t\t\tif (delay < wheel.timeRange)\n\t\t\t\t{\n\t\t\t\t\tsuitableWheel = wheel;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsuitableWheel.add(delay, tm);\n\t\t}\n\t\t\n\t\tstatic void innerDel(Timer tm)\n\t\t{\n\t\t\tinnerDel(tm, true);\n\t\t}\n\t\t\n\t\tstatic void innerDel(Timer tm,bool removeFromMap)\n\t\t{\n\t\t\ttm.delete = true;\n\t\t\tif (tm.container != null)\n\t\t\t{\n\t\t\t\ttm.container.Remove(tm);\n\t\t\t\ttm.container = null;\n\t\t\t}\n\t\t\tif (removeFromMap) mapSnTimer.Remove(tm.sn);\n\t\t}\n\t\t\n\t\tstatic int now()\n\t\t{\n\t\t\treturn (int)(nowTime * 1000);\n\t\t}\n\t\t\n\t\tinternal static void tick(float deltaTime)\n\t\t{\n\t\t\tnowTime += deltaTime;\n\t\t\tpileSecs += deltaTime;\n\t\t\tint cycle = 0;\n\t\t\twhile (pileSecs >= jiffies_sec)\n\t\t\t{\n\t\t\t\tpileSecs -= jiffies_sec;\n\t\t\t\tcycle++;\n\t\t\t}\n\t\t\tfor (int i = 0; i < cycle; ++i)\n\t\t\t{\n\t\t\t\tvar timers = wheels[0].nextDial();\n\t\t\t\tLinkedListNode<Timer> node = timers.First;\n\t\t\t\tfor (int j = 0; j < timers.Count; ++j)\n\t\t\t\t{\n\t\t\t\t\tvar tm = node.Value;\n\t\t\t\t\texecuteTimers.AddLast(tm);\n\t\t\t\t\tnode = node.Next;\n\t\t\t\t}\n\t\t\t\ttimers.Clear();\n\t\t\t\t\n\t\t\t\tfor (int j = 0; j < wheels.Length; ++j)\n\t\t\t\t{\n\t\t\t\t\tvar wheel = wheels[j];\n\t\t\t\t\tif (wheel.head == Wheel.dial_scale)\n\t\t\t\t\t{\n\t\t\t\t\t\twheel.head = 0;\n\t\t\t\t\t\tif (wheel.nextWheel != null)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tvar tms = wheel.nextWheel.nextDial();\n\t\t\t\t\t\t\tLinkedListNode<Timer> tmsNode = tms.First;\n\t\t\t\t\t\t\tfor (int k = 0; k < tms.Count; ++k)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tvar tm = tmsNode.Value;\n\t\t\t\t\t\t\t\tif (tm.delete)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tmapSnTimer.Remove(tm.sn);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tinnerAdd(tm.deadline, tm);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\ttmsNode = tmsNode.Next;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttms.Clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\twhile (executeTimers.Count > 0)\n\t\t\t{\n\t\t\t\tvar tm = executeTimers.First.Value;\n\t\t\t\texecuteTimers.Remove(tm);\n\t\t\t\tif (!tm.delete && tm.handler(tm.sn) && tm.cycle > 0)\n\t\t\t\t{\n\t\t\t\t\tinnerAdd(now() + tm.cycle, tm);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmapSnTimer.Remove(tm.sn);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tstatic void init()\n\t\t{\n\t\t\twheels = new Wheel[4];\n\t\t\tfor (int i = 0; i < 4; ++i)\n\t\t\t{\n\t\t\t\twheels[i] = new Wheel(jiffies_msec * intpow(Wheel.dial_scale, i));\n\t\t\t\tif (i > 0)\n\t\t\t\t{\n\t\t\t\t\twheels[i - 1].nextWheel = wheels[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tmapSnTimer = new Dictionary<int, Timer>();\n\t\t\texecuteTimers = new LinkedList<Timer>();\n\t\t}\n\t\t\n\t\tstatic int fetchSn()\n\t\t{\n\t\t\treturn ++nextSn;\n\t\t}\n\t\t\n\t\tinternal static int add(int delay, Action<int> handler)\n\t\t{\n\t\t\treturn add(delay, 0, (int sn) =>\n\t\t\t           {\n\t\t\t\thandler(sn);\n\t\t\t\treturn false;\n\t\t\t});\n\t\t}\n\t\t\n\t\tinternal static int add(int delay, int cycle, Func<int, bool> handler)\n\t\t{\n\t\t\tTimer tm = new Timer();\n\t\t\ttm.sn = fetchSn();\n\t\t\ttm.cycle = cycle;\n\t\t\ttm.handler = handler;\n\t\t\tmapSnTimer[tm.sn] = tm;\n\t\t\tinnerAdd(now() + delay, tm);\n\t\t\treturn tm.sn;\n\t\t}\n\t\t\n\t\tinternal static void del(int sn)\n\t\t{\n\t\t\tTimer tm;\n\t\t\tif (mapSnTimer.TryGetValue(sn, out tm))\n\t\t\t{\n\t\t\t\tinnerDel(tm);\n\t\t\t}\n\t\t}\n\t\t\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tpublic static int Delete(IntPtr l)\n\t\t{\n\t\t\ttry{\n\t\t\t\tint id;\n\t\t\t\tcheckType(l, 1, out id);\n\t\t\t\tdel(id);\n\t\t\t\treturn ok(l);\n\t\t\t}catch(Exception e)\n\t\t\t{\n\t\t\t\treturn LuaObject.error(l, e);\n\t\t\t}\n\t\t}\n\t\t\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tpublic static int Add(IntPtr l)\n\t\t{\n\t\t\ttry{\n\t\t\t\tint top = LuaDLL.lua_gettop(l);\n\t\t\t\tif (top == 2)\n\t\t\t\t{\n\t\t\t\t\tint delay;\n\t\t\t\t\tcheckType(l, 1, out delay);\n\t\t\t\t\tLuaDelegate ld;\n\t\t\t\t\tcheckType(l, 2, out ld);\n\t\t\t\t\tAction<int> ua;\n\t\t\t\t\tif (ld.d != null)\n\t\t\t\t\t\tua = (Action<int>)ld.d;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tIntPtr ml = LuaState.get(l).L;\n\t\t\t\t\t\tua = (int id) =>\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint error = pushTry(ml);\n\t\t\t\t\t\t\tpushValue(ml, id);\n\t\t\t\t\t\t\tld.pcall(1, error);\n\t\t\t\t\t\t\tLuaDLL.lua_settop(ml, error - 1);\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t\tld.d = ua;\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\tpushValue(l, add(delay, ua));\n\t\t\t\t\treturn 2;\n\t\t\t\t}\n\t\t\t\telse if (top == 3)\n\t\t\t\t{\n\t\t\t\t\tint delay, cycle;\n\t\t\t\t\tcheckType(l, 1, out delay);\n\t\t\t\t\tcheckType(l, 2, out cycle);\n\t\t\t\t\tLuaDelegate ld;\n\t\t\t\t\tcheckType(l, 3, out ld);\n\t\t\t\t\tFunc<int, bool> ua;\n\t\t\t\t\t\n\t\t\t\t\tif (ld.d != null)\n\t\t\t\t\t\tua = (Func<int, bool>)ld.d;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tIntPtr ml = LuaState.get(l).L;\n\t\t\t\t\t\tua = (int id) =>\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint error = pushTry(ml);\n\t\t\t\t\t\t\tpushValue(ml, id);\n\t\t\t\t\t\t\tld.pcall(1, error);\n\t\t\t\t\t\t\tbool ret = LuaDLL.lua_toboolean(ml, -1);\n\t\t\t\t\t\t\tLuaDLL.lua_settop(ml, error - 1);\n\t\t\t\t\t\t\treturn ret;\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t\tld.d = ua;\n\t\t\t\t\tpushValue(l, true);\n\t\t\t\t\tpushValue(l, add(delay, cycle, ua));\n\t\t\t\t\treturn 2;\n\t\t\t\t}\n\t\t\t\treturn LuaObject.error(l,\"Argument error\");\n\t\t\t}catch(Exception e)\n\t\t\t{\n\t\t\t\treturn LuaObject.error(l, e);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tpublic static int DeleteAll(IntPtr l)\n\t\t{\n\t\t\tif (mapSnTimer == null) return 0;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tforeach (var t in mapSnTimer)\n\t\t\t\t{\n\t\t\t\t\tinnerDel(t.Value, false);\n\t\t\t\t}\n\t\t\t\tmapSnTimer.Clear();\n\t\t\t\t\n\t\t\t\tpushValue(l, true);\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\treturn LuaObject.error(l, e);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\tstatic public void reg(IntPtr l)\n\t\t{\n\t\t\tinit();\n\t\t\tgetTypeTable(l, \"LuaTimer\");\n\t\t\taddMember(l, Add, false);\n\t\t\taddMember(l, Delete, false);\n\t\t\taddMember(l, DeleteAll, false);\n\t\t\tcreateTypeMetatable(l, typeof(LuaTimer));\n\t\t}\n\t}\n\t\n}"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/Timer.cs.meta",
    "content": "fileFormatVersion: 2\nguid: da187042c429ccc4ba59078d71f63ce2\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/WeakDictionary.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\nnamespace SLua\n{\n\tusing System;\n\tusing System.Collections.Generic;\n\n\tpublic class WeakDictionary<K, V>\n\t{\n\t\tDictionary<K, WeakReference> _dict = new Dictionary<K, WeakReference>();\n\n\t\tpublic V this[K key]\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tWeakReference w = _dict[key];\n\t\t\t\tif (w.IsAlive)\n\t\t\t\t\treturn (V)w.Target;\n\t\t\t\treturn default(V);\n\t\t\t}\n\n\t\t\tset\n\t\t\t{\n\t\t\t\tAdd(key, value);\n\t\t\t}\n\t\t}\n\n\n\t\tICollection<K> Keys\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn _dict.Keys;\n\t\t\t}\n\t\t}\n\t\tICollection<V> Values\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tList<V> l = new List<V>();\n\t\t\t\tforeach (K key in _dict.Keys)\n\t\t\t\t{\n\t\t\t\t\tl.Add((V)_dict[key].Target);\n\t\t\t\t}\n\t\t\t\treturn l;\n\t\t\t}\n\t\t}\n\n\t\tvoid Add(K key, V value)\n\t\t{\n\t\t\tif (_dict.ContainsKey(key))\n\t\t\t{\n\t\t\t\tif (_dict[key].IsAlive)\n\t\t\t\t\tthrow new ArgumentException(\"key exists\");\n\n\t\t\t\t_dict[key].Target = value;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tWeakReference w = new WeakReference(value);\n\t\t\t\t_dict.Add(key, w);\n\t\t\t}\n\t\t}\n\n\t\tbool ContainsKey(K key)\n\t\t{\n\t\t\treturn _dict.ContainsKey(key);\n\t\t}\n\t\tbool Remove(K key)\n\t\t{\n\t\t\treturn _dict.Remove(key);\n\t\t}\n\t\tbool TryGetValue(K key, out V value)\n\t\t{\n\t\t\tWeakReference w;\n\t\t\tif (_dict.TryGetValue(key, out w))\n\t\t\t{\n\t\t\t\tvalue = (V)w.Target;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tvalue = default(V);\n\t\t\treturn false;\n\n\t\t}\n\t}\n}"
  },
  {
    "path": "Assets/Plugins/Slua_Managed/WeakDictionary.cs.meta",
    "content": "fileFormatVersion: 2\nguid: fe67559fdd76f4618a6a0fd2e68f6dd2\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/Slua_Managed.meta",
    "content": "fileFormatVersion: 2\nguid: 01ba541dcfc83462093fd9106b9777dc\nfolderAsset: yes\ntimeCreated: 1448162194\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/iOS/libslua.a.meta",
    "content": "fileFormatVersion: 2\nguid: 7c2326b2c7072439b83de606173799b8\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 0\n      settings:\n        DefaultValueInitialized: true\n    iOS:\n      enabled: 1\n      settings: {}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/iOS.meta",
    "content": "fileFormatVersion: 2\nguid: 059e5317bf3d04c0094c797779d2ac58\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/slua.bundle/Contents/Info.plist",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\n<plist version=\"1.0\">\n<dict>\n\t<key>BuildMachineOSBuild</key>\n\t<string>16D32</string>\n\t<key>CFBundleDevelopmentRegion</key>\n\t<string>en</string>\n\t<key>CFBundleExecutable</key>\n\t<string>slua</string>\n\t<key>CFBundleIdentifier</key>\n\t<string>com.sineysoft.slua</string>\n\t<key>CFBundleInfoDictionaryVersion</key>\n\t<string>6.0</string>\n\t<key>CFBundleName</key>\n\t<string>slua</string>\n\t<key>CFBundlePackageType</key>\n\t<string>BNDL</string>\n\t<key>CFBundleShortVersionString</key>\n\t<string>1.0</string>\n\t<key>CFBundleSignature</key>\n\t<string>????</string>\n\t<key>CFBundleSupportedPlatforms</key>\n\t<array>\n\t\t<string>MacOSX</string>\n\t</array>\n\t<key>CFBundleVersion</key>\n\t<string>1</string>\n\t<key>DTCompiler</key>\n\t<string>com.apple.compilers.llvm.clang.1_0</string>\n\t<key>DTPlatformBuild</key>\n\t<string>8C1002</string>\n\t<key>DTPlatformVersion</key>\n\t<string>GM</string>\n\t<key>DTSDKBuild</key>\n\t<string>16C58</string>\n\t<key>DTSDKName</key>\n\t<string>macosx10.12</string>\n\t<key>DTXcode</key>\n\t<string>0821</string>\n\t<key>DTXcodeBuild</key>\n\t<string>8C1002</string>\n\t<key>NSHumanReadableCopyright</key>\n\t<string>Copyright © 2015年 Pang Weiwei. All rights reserved.</string>\n</dict>\n</plist>\n"
  },
  {
    "path": "Assets/Plugins/slua.bundle/Contents/Info.plist.meta",
    "content": "fileFormatVersion: 2\nguid: a9b9792a5bf544ee18dfaf9f43096607\ntimeCreated: 1489473364\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/slua.bundle/Contents/MacOS/slua.meta",
    "content": "fileFormatVersion: 2\nguid: 6e0fefe972e4a4c98b28753982a87602\ntimeCreated: 1489473364\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/slua.bundle/Contents/MacOS.meta",
    "content": "fileFormatVersion: 2\nguid: 9c458265895694c1fa8e7a4a5c52c2fc\nfolderAsset: yes\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/slua.bundle/Contents.meta",
    "content": "fileFormatVersion: 2\nguid: 72200f543539f40b787628eaa4f1db29\nfolderAsset: yes\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/slua.bundle.meta",
    "content": "fileFormatVersion: 2\nguid: 520a99e6b3adc4a3798cda88b0dee08a\nfolderAsset: yes\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  isOverridable: 0\n  platformData:\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 1\n      settings:\n        DefaultValueInitialized: true\n    OSXIntel:\n      enabled: 1\n      settings: {}\n    OSXIntel64:\n      enabled: 1\n      settings: {}\n    OSXUniversal:\n      enabled: 1\n      settings: {}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/x64/slua.dll.meta",
    "content": "fileFormatVersion: 2\nguid: 54a4981d121af354582d78a7d07e9d57\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Android:\n      enabled: 0\n      settings:\n        CPU: AnyCPU\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 1\n      settings:\n        CPU: x86_64\n        DefaultValueInitialized: true\n        OS: Windows\n    Linux:\n      enabled: 1\n      settings:\n        CPU: None\n    Linux64:\n      enabled: 1\n      settings:\n        CPU: x86_64\n    LinuxUniversal:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    OSXIntel:\n      enabled: 1\n      settings:\n        CPU: None\n    OSXIntel64:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    OSXUniversal:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    WP8:\n      enabled: 0\n      settings:\n        CPU: AnyCPU\n        DontProcess: False\n        PlaceholderPath: \n    Win:\n      enabled: 0\n      settings:\n        CPU: None\n    Win64:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    WindowsStoreApps:\n      enabled: 0\n      settings:\n        CPU: AnyCPU\n        DontProcess: False\n        PlaceholderPath: \n        SDK: AnySDK\n    iOS:\n      enabled: 0\n      settings:\n        CompileFlags: \n        FrameworkDependencies: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/x64/slua.so.meta",
    "content": "fileFormatVersion: 2\nguid: 7bc76cf4314f84ca5affd5d3f247c3d4\ntimeCreated: 1452501679\nlicenseType: Free\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Android:\n      enabled: 0\n      settings:\n        CPU: AnyCPU\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 0\n      settings:\n        CPU: x86_64\n        DefaultValueInitialized: true\n        OS: AnyOS\n    Linux:\n      enabled: 0\n      settings:\n        CPU: None\n    Linux64:\n      enabled: 1\n      settings:\n        CPU: x86_64\n    LinuxUniversal:\n      enabled: 0\n      settings:\n        CPU: x86_64\n    OSXIntel:\n      enabled: 0\n      settings:\n        CPU: None\n    OSXIntel64:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    OSXUniversal:\n      enabled: 0\n      settings:\n        CPU: x86_64\n    Win:\n      enabled: 0\n      settings:\n        CPU: None\n    Win64:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    iOS:\n      enabled: 0\n      settings:\n        CompileFlags: \n        FrameworkDependencies: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/x64.meta",
    "content": "fileFormatVersion: 2\nguid: 6ac20236b407be2419f92e3457666400\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins/x86/slua.dll.meta",
    "content": "fileFormatVersion: 2\nguid: 933ad28db81956c42b21aba2189b98a7\ntimeCreated: 1438844001\nlicenseType: Free\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Android:\n      enabled: 0\n      settings:\n        CPU: AnyCPU\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 1\n      settings:\n        CPU: x86\n        DefaultValueInitialized: true\n        OS: Windows\n    Linux:\n      enabled: 1\n      settings:\n        CPU: x86\n    Linux64:\n      enabled: 0\n      settings:\n        CPU: None\n    LinuxUniversal:\n      enabled: 1\n      settings:\n        CPU: x86\n    OSXIntel:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    OSXIntel64:\n      enabled: 0\n      settings:\n        CPU: None\n    OSXUniversal:\n      enabled: 1\n      settings:\n        CPU: x86\n    Win:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    Win64:\n      enabled: 0\n      settings:\n        CPU: None\n    iOS:\n      enabled: 0\n      settings:\n        CompileFlags: \n        FrameworkDependencies: \n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/x86/slua.so.meta",
    "content": "fileFormatVersion: 2\nguid: acb29abed2a1f435e92905fd3bf7177e\ntimeCreated: 1452501679\nlicenseType: Free\nPluginImporter:\n  serializedVersion: 1\n  iconMap: {}\n  executionOrder: {}\n  isPreloaded: 0\n  platformData:\n    Any:\n      enabled: 0\n      settings: {}\n    Editor:\n      enabled: 0\n      settings:\n        CPU: x86\n        DefaultValueInitialized: true\n    Linux:\n      enabled: 1\n      settings:\n        CPU: x86\n    Linux64:\n      enabled: 0\n      settings:\n        CPU: None\n    LinuxUniversal:\n      enabled: 0\n      settings:\n        CPU: x86\n    OSXIntel:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    OSXIntel64:\n      enabled: 0\n      settings:\n        CPU: None\n    OSXUniversal:\n      enabled: 0\n      settings:\n        CPU: x86\n    Win:\n      enabled: 1\n      settings:\n        CPU: AnyCPU\n    Win64:\n      enabled: 0\n      settings:\n        CPU: None\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Plugins/x86.meta",
    "content": "fileFormatVersion: 2\nguid: 93acf31abffccad49a0246feb2b42132\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Plugins.meta",
    "content": "fileFormatVersion: 2\nguid: 6f88cd0212a23cf4288c49b0b31d28b3\nfolderAsset: yes\ntimeCreated: 1468465489\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/README",
    "content": "\nAssetBundle Manager and AssetBundle Samples\n\nThis Project and its Assets are designed to work with the AssetBundle Manager lesson, which can be found on the official Unity \"Learn\" site here:\nhttp://http://unity3d.com/learn/tutorials/modules/intermediate/editor/assetbundles\n\nThe intent of the AssetBundle Manager is to provide a High-Level API and a set of Editor Utilities to build, test and use AssetBundles in a refined workflow, rather than using Unity's Low-Level AssetBundle API directly.\n\nDependencies between AssetBundles are tracked in a single \"Manifest\" AssetBundle. This Manifest holds information about all of the AssetBundles built for a particular target platform and allows access to all their content and dependencies at runtime. Using the AssetBundle Manager will make it possible to download all the Asset Bundles with Asset dependencies automatically from a base url or simulated location.\n\nThe AssetBundle Manager provides a High-Level API for working with AssetBundles. The AssetBundle Manager will take care of loading AssetBundles and their associated Asset Dependencies.\n\tInitialize()\n\t\tInitializes the AssetBundle manifest object.\n\tLoadAssetAsync()\n\t\tLoads a given asset from a given AssetBundle and handles all the dependencies.\n\tLoadLevelAsync()\n\t\tLoads a given scene from a given AssetBundle and handles all the dependencies.\n\tLoadDependencies()\n\t\tLoads all the dependent AssetBundles for a given AssetBundle.\n\tBaseDownloadingURL\n\t\tSets the base downloading url which is used for automatic downloading dependencies.\n\tSimulateAssetBundleInEditor\n\t\tSets Simulation Mode in the Editor.\n\tVariants\n\t\tSets the active variant.\n\tRemapVariantName()\n\t\tResolves the correct AssetBundle according to the active variant.\n\nThe AssetBundle Manager provides a set of Editor Utilities to help build, test and use AssetBundles.\n\t\"Simulation Mode\" is used to control AssetBundle simulation in the Editor.\n\t\tWhen Simulation Mode is enabled AssetBundles are simulated based on the current build target.\n\t\tWhen Simulation Mode is enabled the Editor is in play mode, AssetBundles can be \"used\" as if built and deployed without actually building them.\n\t\tPlease Note: AssetBundle Variants are not compatible with Simulation Mode.\n\t\"Build AssetBundles\" builds the currently Assigned AssetBundles for the current target platform.\n\t\tAssetBundles are optimized for each target platform.\n\t\tBuild AssetBundles will build the currently Assigned AssetBundles for the current target platform and place them in a default directory.\n\t\tThe current default directory will be the \"AssetBundles\" folder on the root level of the project.\n\t\tAssetBundles will be sorted within this default folder by build target.\n\t\t(See BuildScript.BuildAssetBundles() for more information.)\n\t\"Local AssetBundle Server\" will create a local server allowing access to AssetBundles built and stored in a default directory from local test applications and the Editor.\n\t\tBuild AssetBundles will build the currently Assigned AssetBundles for the current target platform and place them in a default directory. (see above)\n\t\tWhen Local AssetBundle Server is enabled, projects running in the Editor or applications that can access the Editor on the local network, can access AssetBundles stored in the default folder through the Local AssetBundle Server.\n\t\tWith the Local AssetBundle Server it is possible to test the AssetBundle workflow of a project without having to deploy built AssetBundles before testing.\n\nThere are three basic scenes in the \"AssetBundleSample/Scenes\" folder:\n\t\"AssetLoader\" demonstrates how to load a normal asset from AssetBundles.\n\t\tThis scene is driven by the LoadAssets.cs script.\n\t\"SceneLoader\" demonstrates how to load a scene from AssetBundles.\n\t\tThis scene is driven by the LoadScenes.cs script.\n\t\"VariantLoader\" demonstrates how to load AssetBundle Variants.\n\t\tThis scene is driven by the LoadVariants.cs script.\n\t\tAssetBundle Variants are used to remap for different dependent Assets to objects as required.\n\t\tAssetBundle Variants use the same AssetBundle Name and are identified by their AssetBundle Variant name.\n\t\tThis will create AssetBundles with the same name but with a variant extension; e.g.: myassets.hd and myassets.sd.\n\t\tIn the demo, the AssetBundles will be built using the AssetBundle Name and Variant Name.\n\t\t\t\"MyAssets-HD\" folder into \"variant/myassets.hd\" AssetBundle.\n\t\t\t\"MyAssets-SD\" folder into \"variant/myassets.sd\" AssetBundle.\n\t\tFor AssetBundle Variants to work, the hierarchy structure and content names of the AssetBundle Variants must be identical.\n\t\tThe Assets in \"MyAssets-HD\" and \"MyAssets-SD\" will have the exactly same internal IDs, so they can be switched out arbitrarily with each other as required.\n\t\tHere the file extension \"hd\" and \"sd\" are what we call variants. You can change the active variant which is on LoadVariants.cs.\n\t\tPlease also refer to AssetBundleManager.RemapVariantName() to see how to resolve the correct AssetBundle according to the active variant.\n\t\tIn this demo, we also build:\n\t\t\t\"Variant-Scene\" into \"variants/variant-scene\" AssetBundle which depends on variant AssetBundle.\n\t\tReminder: AssetBundle variant is not compatible with the Editor simulation.\n\n"
  },
  {
    "path": "Assets/README.meta",
    "content": "fileFormatVersion: 2\nguid: c3b40152453be6e4987a4b3b2e973430\ntimeCreated: 1438096914\nlicenseType: Store\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Editor/CustomEditor.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\nusing System;\nusing UnityEditor;\nusing UnityEngine;\nusing SLua;\n\nnamespace SLua\n{\n\t[CustomEditor(typeof(LuaSvrGameObject))]\n\tpublic class LuaSvrEditor : Editor\n\t{\n\t\tpublic override void OnInspectorGUI()\n\t\t{\n\t\t\tLuaSvrGameObject myTarget = (LuaSvrGameObject)target;\n\t\t\tint bytes = LuaDLL.lua_gc(myTarget.state.L, LuaGCOptions.LUA_GCCOUNT, 0);\n\t\t\tEditorGUILayout.LabelField(\"Memory(Kb)\", bytes.ToString());\n\t\t\tif (GUILayout.Button(\"Lua GC\"))\n\t\t\t{\n\t\t\t\tLuaDLL.lua_gc(myTarget.state.L, LuaGCOptions.LUA_GCCOLLECT, 0);\n\t\t\t}\n\t\t}\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/Editor/CustomEditor.cs.meta",
    "content": "fileFormatVersion: 2\nguid: adca803bf3fe6c34f9d70091e49c5ef3\ntimeCreated: 1444205452\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Editor/CustomExport.cs",
    "content": "﻿// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n    using System.Collections.Generic;\n    using System;\n\n    public class CustomExport\n    {\n        public static void OnGetAssemblyToGenerateExtensionMethod(out List<string> list) {\n            list = new List<string> {\n                \"Assembly-CSharp\",\n            };\n        }\n\n        public static void OnAddCustomClass(LuaCodeGen.ExportGenericDelegate add)\n        {\n\t\t\t// below lines only used for demostrate how to add custom class to export, can be delete on your app\n\n            add(typeof(System.Func<int>), null);\n            add(typeof(System.Action<int, string>), null);\n            add(typeof(System.Action<int, Dictionary<int, object>>), null);\n            add(typeof(List<int>), \"ListInt\");\n            add(typeof(Dictionary<int, string>), \"DictIntStr\");\n            add(typeof(string), \"String\");\n            \n            // add your custom class here\n            // add( type, typename)\n            // type is what you want to export\n            // typename used for simplify generic type name or rename, like List<int> named to \"ListInt\", if not a generic type keep typename as null or rename as new type name\n        }\n\n        public static void OnAddCustomAssembly(ref List<string> list)\n        {\n            // add your custom assembly here\n            // you can build a dll for 3rd library like ngui titled assembly name \"NGUI\", put it in Assets folder\n            // add its name into list, slua will generate all exported interface automatically for you\n\n            //list.Add(\"NGUI\");\n        }\n\n        public static HashSet<string> OnAddCustomNamespace()\n        {\n            return new HashSet<string>\n            {\n                //\"NLuaTest.Mock\"\n            };\n        }\n\n        // if uselist return a white list, don't check noUseList(black list) again\n        public static void OnGetUseList(out List<string> list)\n        {\n            list = new List<string>\n            {\n                //\"UnityEngine.GameObject\",\n            };\n        }\n\n        public static List<string> FunctionFilterList = new List<string>()\n        {\n            \"UIWidget.showHandles\",\n            \"UIWidget.showHandlesWithMoveTool\",\n        };\n        // black list if white list not given\n        public static void OnGetNoUseList(out List<string> list)\n        {\n            list = new List<string>\n            {      \n                \"HideInInspector\",\n                \"ExecuteInEditMode\",\n                \"AddComponentMenu\",\n                \"ContextMenu\",\n                \"RequireComponent\",\n                \"DisallowMultipleComponent\",\n                \"SerializeField\",\n                \"AssemblyIsEditorAssembly\",\n                \"Attribute\", \n                \"Types\",\n                \"UnitySurrogateSelector\",\n                \"TrackedReference\",\n                \"TypeInferenceRules\",\n                \"FFTWindow\",\n                \"RPC\",\n                \"Network\",\n                \"MasterServer\",\n                \"BitStream\",\n                \"HostData\",\n                \"ConnectionTesterStatus\",\n                \"GUI\",\n                \"EventType\",\n                \"EventModifiers\",\n                \"FontStyle\",\n                \"TextAlignment\",\n                \"TextEditor\",\n                \"TextEditorDblClickSnapping\",\n                \"TextGenerator\",\n                \"TextClipping\",\n                \"Gizmos\",\n                \"ADBannerView\",\n                \"ADInterstitialAd\",            \n                \"Android\",\n                \"Tizen\",\n                \"jvalue\",\n                \"iPhone\",\n                \"iOS\",\n                \"Windows\",\n                \"CalendarIdentifier\",\n                \"CalendarUnit\",\n                \"CalendarUnit\",\n                \"ClusterInput\",\n                \"FullScreenMovieControlMode\",\n                \"FullScreenMovieScalingMode\",\n                \"Handheld\",\n                \"LocalNotification\",\n                \"NotificationServices\",\n                \"RemoteNotificationType\",      \n                \"RemoteNotification\",\n                \"SamsungTV\",\n                \"TextureCompressionQuality\",\n                \"TouchScreenKeyboardType\",\n                \"TouchScreenKeyboard\",\n                \"MovieTexture\",\n                \"UnityEngineInternal\",\n                \"Terrain\",                            \n                \"Tree\",\n                \"SplatPrototype\",\n                \"DetailPrototype\",\n                \"DetailRenderMode\",\n                \"MeshSubsetCombineUtility\",\n                \"AOT\",\n                \"Social\",\n                \"Enumerator\",       \n                \"SendMouseEvents\",               \n                \"Cursor\",\n                \"Flash\",\n                \"ActionScript\",\n                \"OnRequestRebuild\",\n                \"Ping\",\n                \"ShaderVariantCollection\",\n                \"SimpleJson.Reflection\",\n                \"CoroutineTween\",\n                \"GraphicRebuildTracker\",\n                \"Advertisements\",\n                \"UnityEditor\",\n\t\t\t    \"WSA\",\n\t\t\t    \"EventProvider\",\n\t\t\t    \"Apple\",\n\t\t\t    \"ClusterInput\",\n\t\t\t\t\"Motion\",\n                \"UnityEngine.UI.ReflectionMethodsCache\",\n                \"Collections.NativeLeakDetection\",\n                \"UnityEngine.Light\",\n            };\n        }\n    }\n}"
  },
  {
    "path": "Assets/Slua/Editor/CustomExport.cs.meta",
    "content": "fileFormatVersion: 2\nguid: c6675404a3f79e74782a24980dcc8e5e\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Editor/LuaCodeGen.cs",
    "content": "// The MIT License (MIT)\n\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nnamespace SLua\n{\n\tusing UnityEngine;\n\tusing System.Collections;\n\tusing System.Collections.Generic;\n    using System.Linq;\n\tusing System.IO;\n\tusing System;\n\tusing System.Reflection;\n\tusing UnityEditor;\n\tusing System.Text;\n\tusing System.Text.RegularExpressions;\n\tusing System.Runtime.CompilerServices;\n\n\tpublic interface ICustomExportPost { }\n\n\n    public class LuaCodeGen : MonoBehaviour\n\t{\n\t\tstatic public string GenPath = SLuaSetting.Instance.UnityEngineGeneratePath;\n        static public string WrapperName = \"sluaWrapper.dll\";\n        public delegate void ExportGenericDelegate(Type t, string ns);\n\t\t\n        static bool autoRefresh = true;\n\n        static bool IsCompiling {\n\t\t\tget {\n\t\t\t\tif (EditorApplication.isCompiling) {\n                    Debug.Log(\"Unity Editor is compiling, please wait.\");\n\t\t\t\t}\n\t\t\t\treturn EditorApplication.isCompiling;\n\t\t\t}\n\t\t}\n\t\t \n\t\t[InitializeOnLoad]\n\t\tpublic class Startup\n\t\t{\n\t\t\tstatic bool isPlaying=false;\n\t\t\tstatic Startup()\n\t\t\t{\n\t\t\t\tEditorApplication.update += Update;\n\t\t\t\t// use this delegation to ensure dispose luavm at last\n\t\t\t\tEditorApplication.playmodeStateChanged+=()=>{\n\t\t\t\t\t\n\t\t\t\t\tif(isPlaying==true && EditorApplication.isPlaying==false) {\n\t\t\t\t\t\tif(LuaState.main!=null) LuaState.main.Dispose();\n\t\t\t\t\t}\n\n\t\t\t\t\tisPlaying=EditorApplication.isPlaying;\n\t\t\t\t};\n\t\t\t} \n\n\n\t\t\tstatic void Update(){\n\t\t\t\tEditorApplication.update -= Update;\n\t\t\t\tLua3rdMeta.Instance.ReBuildTypes();\n\n                // Remind user to generate lua interface code\n\t\t\t    var remindGenerate = !EditorPrefs.HasKey(\"SLUA_REMIND_GENERTE_LUA_INTERFACE\") || EditorPrefs.GetBool(\"SLUA_REMIND_GENERTE_LUA_INTERFACE\");\n                bool ok = System.IO.Directory.Exists(GenPath + \"Unity\") || System.IO.File.Exists(GenPath + WrapperName);\n\t\t\t\tif (!ok && remindGenerate)\n\t\t\t\t{\n\t\t\t\t    if (EditorUtility.DisplayDialog(\"Slua\", \"Not found lua interface for Unity, generate it now?\", \"Generate\", \"No\"))\n\t\t\t\t    {\n\t\t\t\t        GenerateAll();\n\t\t\t\t    }\n\t\t\t\t    else\n\t\t\t\t    {\n\t\t\t\t        if (!EditorUtility.DisplayDialog(\"Slua\", \"Remind you next time when no lua interface found for Unity?\", \"OK\",\n\t\t\t\t            \"Don't remind me next time!\"))\n\t\t\t\t        {\n                            EditorPrefs.SetBool(\"SLUA_REMIND_GENERTE_LUA_INTERFACE\", false);\n\t\t\t\t        }\n\t\t\t\t        else\n\t\t\t\t        {\n\t\t\t\t            \n                            EditorPrefs.SetBool(\"SLUA_REMIND_GENERTE_LUA_INTERFACE\", true);\n\t\t\t\t        }\n\t\t\t\t        \n\t\t\t\t    }\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t\n\t\t[MenuItem(\"SLua/All/Make\")]\n\t\tstatic public void GenerateAll()\n\t\t{\n            autoRefresh = false;\n            Generate();\n\t\t\tGenerateUI();\n            GenerateAds();\n\t\t\tCustom();\n\t\t\tGenerate3rdDll();\n            autoRefresh = true;\n            AssetDatabase.Refresh();\n        }\n\n\t\tstatic bool filterType(Type t, List<string> noUseList, List<string> uselist)\n\t\t{\n\t\t\tif (t.IsDefined (typeof(CompilerGeneratedAttribute),false)) {\n\t\t\t\tDebug.Log (t.Name + \" is filtered out\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\t// check type in uselist\n\t\t\tstring fullName = t.FullName;\n\t\t\tif (uselist != null && uselist.Count > 0)\n\t\t\t{\n\t\t\t\treturn uselist.Contains(fullName);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// check type not in nouselist\n\t\t\t\tforeach (string str in noUseList)\n\t\t\t\t{\n\t\t\t\t\tif (fullName.Contains(str))\n\t\t\t\t\t{\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n        [MenuItem(\"SLua/Unity/Make UnityEngine\")]\n        static public void Generate()\n        {\n            GenerateFor(\"UnityEngine\", \"Unity/\", 0, \"BindUnity\");\n        }\n\n        [MenuItem(\"SLua/Unity/Make UnityEngine.UI\")]\n        static public void GenerateUI()\n        {\n            GenerateFor(\"UnityEngine.UI\", \"Unity/\", 1, \"BindUnityUI\");\n        }\n\n        [MenuItem(\"SLua/Unity/Make UnityEngine.Advertisements\")]\n        static public void GenerateAds()\n        {\n            GenerateFor(\"UnityEngine.Advertisements\", \"Unity/\", 2, \"BindUnityAds\");\n        }\n\n        static public void GenerateFor(string asemblyName, string genAtPath, int genOrder, string bindMethod)\n        {\n            if (IsCompiling)\n            {\n                return;\n            }\n\n            Assembly assembly;\n            try { assembly = Assembly.Load(asemblyName); }\n            catch (Exception) { return; }\n\n            Type[] types = assembly.GetExportedTypes();\n\n            List<string> uselist;\n            List<string> noUseList;\n\n            CustomExport.OnGetNoUseList(out noUseList);\n            CustomExport.OnGetUseList(out uselist);\n\n            // Get use and nouse list from custom export.\n            object[] aCustomExport = new object[1];\n            InvokeEditorMethod<ICustomExportPost>(\"OnGetUseList\", ref aCustomExport);\n            if (null != aCustomExport[0])\n            {\n                if (null != uselist)\n                {\n                    uselist.AddRange((List<string>)aCustomExport[0]);\n                }\n                else\n                {\n                    uselist = (List<string>)aCustomExport[0];\n                }\n            }\n\n            aCustomExport[0] = null;\n            InvokeEditorMethod<ICustomExportPost>(\"OnGetNoUseList\", ref aCustomExport);\n            if (null != aCustomExport[0])\n            {\n                if ((null != noUseList))\n                {\n                    noUseList.AddRange((List<string>)aCustomExport[0]);\n                }\n                else\n                {\n                    noUseList = (List<string>)aCustomExport[0];\n                }\n            }\n\n            List<Type> exports = new List<Type>();\n            string path = GenPath + genAtPath;\n            foreach (Type t in types)\n            {\n                if (filterType(t, noUseList, uselist) && Generate(t, path))\n                    exports.Add(t);\n            }\n\n            GenerateBind(exports, bindMethod, genOrder, path);\n            if (autoRefresh)\n                AssetDatabase.Refresh();\n            Debug.Log(\"Generate interface finished: \" + asemblyName);\n        }\n\n\t\tstatic String FixPathName(string path) {\n\t\t\tif(path.EndsWith(\"\\\\\") || path.EndsWith(\"/\")) {\n\t\t\t\treturn path.Substring(0,path.Length-1);\n\t\t\t}\n\t\t\treturn path;\n\t\t}\n\t\t\n\t\t[MenuItem(\"SLua/Unity/Clear Unity and UI\")]\n\t\tstatic public void ClearUnity()\n\t\t{\n\t\t\tclear(new string[] { GenPath+\"Unity\" });\n\t\t\tDebug.Log(\"Clear Unity & UI complete.\");\n\t\t}\n\t\t\n\t\t[MenuItem(\"SLua/Custom/Make\")]\n\t\tstatic public void Custom()\n\t\t{\n\t\t\tif (IsCompiling) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tList<Type> exports = new List<Type>();\n            string path = GenPath + \"Custom/\";\n\t\t\t\n\t\t\tif (!Directory.Exists(path))\n\t\t\t{\n\t\t\t\tDirectory.CreateDirectory(path);\n\t\t\t}\n\t\t\t\n\t\t\tExportGenericDelegate fun = (Type t, string ns) =>\n\t\t\t{\n\t\t\t\tif (Generate(t, ns, path))\n\t\t\t\t\texports.Add(t);\n\t\t\t};\n\n            HashSet<string> namespaces = CustomExport.OnAddCustomNamespace();\n\n            // Add custom namespaces.\n            object[] aCustomExport = null;\n            List<object> aCustomNs = LuaCodeGen.InvokeEditorMethod<ICustomExportPost>(\"OnAddCustomNamespace\", ref aCustomExport);\n            foreach (object cNsSet in aCustomNs)\n            {\n                foreach (string strNs in (HashSet<string>)cNsSet)\n                {\n                    namespaces.Add(strNs);\n                }\n            }\n\n            Assembly assembly;\n            Type[] types;\n\n            try {\n                // export plugin-dll\n                assembly = Assembly.Load(\"Assembly-CSharp-firstpass\");\n                types = assembly.GetExportedTypes();\n                foreach (Type t in types)\n                {\n                    if (t.IsDefined(typeof(CustomLuaClassAttribute), false) || namespaces.Contains(t.Namespace))\n                    {\n                        fun(t, null);\n                    }\n                }\n            }\n            catch(Exception){}\n\n            // export self-dll\n            assembly = Assembly.Load(\"Assembly-CSharp\");\n            types = assembly.GetExportedTypes();\n            foreach (Type t in types)\n            {\n                if (t.IsDefined(typeof(CustomLuaClassAttribute), false) || namespaces.Contains(t.Namespace))\n                {\n                    fun(t, null);\n                }\n            }\n\n            CustomExport.OnAddCustomClass(fun);\n\n            //detect interface ICustomExportPost,and call OnAddCustomClass\n            aCustomExport = new object[] { fun };\n\t\t\tInvokeEditorMethod<ICustomExportPost>(\"OnAddCustomClass\", ref aCustomExport);\n\n\t\t\tGenerateBind(exports, \"BindCustom\", 3, path);\n            if(autoRefresh)\n\t\t\t    AssetDatabase.Refresh();\n\t\t\t\n\t\t\tDebug.Log(\"Generate custom interface finished\");\n\t\t}\n\n\t\tstatic public List<object> InvokeEditorMethod<T>(string methodName, ref object[] parameters)\n        {\n            List<object> aReturn = new List<object>();\n            System.Reflection.Assembly editorAssembly = System.Reflection.Assembly.Load(\"Assembly-CSharp-Editor\");\n\t\t\tType[] editorTypes = editorAssembly.GetExportedTypes();\n\t\t\tforeach (Type t in editorTypes)\n\t\t\t{\n\t\t\t\tif(typeof(T).IsAssignableFrom(t))\n                {\n\t\t\t\t\tSystem.Reflection.MethodInfo method =  t.GetMethod(methodName,System.Reflection.BindingFlags.Static | System.Reflection.BindingFlags.Public);\n                    if (method != null)\n                    {\n                        object cRes = method.Invoke(null, parameters);\n                        if (null != cRes)\n                        {\n                            aReturn.Add(cRes);\n                        }\n                    }\n\t\t\t\t}\n\t\t\t}\n\n            return aReturn;\n\t\t}\n\n        static public List<object> GetEditorField<T>(string strFieldName)\n        {\n            List<object> aReturn = new List<object>();\n            System.Reflection.Assembly cEditorAssembly = System.Reflection.Assembly.Load(\"Assembly-CSharp-Editor\");\n            Type[] aEditorTypes = cEditorAssembly.GetExportedTypes();\n            foreach (Type t in aEditorTypes)\n            {\n                if (typeof(T).IsAssignableFrom(t))\n                {\n                    FieldInfo cField = t.GetField(strFieldName, BindingFlags.Static | BindingFlags.Public);\n                    if (null != cField)\n                    {\n                        object cValue = cField.GetValue(t);\n                        if (null != cValue)\n                        {\n                            aReturn.Add(cValue);\n                        }\n                    }\n                }\n            }\n\n            return aReturn;\n        }\n\n\t\t[MenuItem(\"SLua/3rdDll/Make\")]\n\t\tstatic public void Generate3rdDll()\n\t\t{\n\t\t\tif (IsCompiling) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tList<Type> cust = new List<Type>();\n\t\t\tList<string> assemblyList = new List<string>();\n\t\t\tCustomExport.OnAddCustomAssembly(ref assemblyList);\n\n            //detect interface ICustomExportPost,and call OnAddCustomAssembly\n            object[] aCustomExport = new object[] { assemblyList };\n            InvokeEditorMethod<ICustomExportPost>(\"OnAddCustomAssembly\", ref aCustomExport);\n\n\t\t\tforeach (string assemblyItem in assemblyList)\n\t\t\t{\n\t\t\t\tAssembly assembly = Assembly.Load(assemblyItem);\n\t\t\t\tType[] types = assembly.GetExportedTypes();\n\t\t\t\tforeach (Type t in types)\n\t\t\t\t{\n\t\t\t\t\tcust.Add(t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (cust.Count > 0)\n\t\t\t{\n\t\t\t\tList<Type> exports = new List<Type>();\n\t\t\t\tstring path = GenPath + \"Dll/\";\n\t\t\t\tif (!Directory.Exists(path))\n\t\t\t\t{\n\t\t\t\t\tDirectory.CreateDirectory(path);\n\t\t\t\t}\n\t\t\t\tforeach (Type t in cust)\n\t\t\t\t{\n\t\t\t\t\tif (Generate(t,path))\n\t\t\t\t\t\texports.Add(t);\n\t\t\t\t}\n\t\t\t\tGenerateBind(exports, \"BindDll\", 2, path);\n                if(autoRefresh)\n\t\t\t\t    AssetDatabase.Refresh();\n\t\t\t\tDebug.Log(\"Generate 3rdDll interface finished\");\n\t\t\t}\n\t\t}\n\t\t[MenuItem(\"SLua/3rdDll/Clear\")]\n\t\tstatic public void Clear3rdDll()\n\t\t{\n\t\t\tclear(new string[] { GenPath + \"Dll\" });\n\t\t\tDebug.Log(\"Clear AssemblyDll complete.\");\n\t\t}\n\t\t[MenuItem(\"SLua/Custom/Clear\")]\n\t\tstatic public void ClearCustom()\n\t\t{\n\t\t\tclear(new string[] { GenPath + \"Custom\" });\n\t\t\tDebug.Log(\"Clear custom complete.\");\n\t\t}\n\t\t\n\t\t[MenuItem(\"SLua/All/Clear\")]\n\t\tstatic public void ClearALL()\n\t\t{\n\t\t\tclear(new string[] { Path.GetDirectoryName(GenPath) });\n\t\t\tDebug.Log(\"Clear all complete.\");\n\t\t}\n\n        [MenuItem(\"SLua/Compile LuaObject To DLL\")]\n        static public void CompileDLL()\n        {\n            #region scripts\n            List<string> scripts = new List<string>();\n            string[] guids = AssetDatabase.FindAssets(\"t:Script\", new string[1] { Path.GetDirectoryName(GenPath) }).Distinct().ToArray();\n            int guidCount = guids.Length;\n            for (int i = 0; i < guidCount; i++)\n            {\n                // path may contains space\n                string path = \"\\\"\" + AssetDatabase.GUIDToAssetPath(guids[i]) + \"\\\"\";\n                if(!scripts.Contains(path))\n                    scripts.Add(path); \n            }\n\n            if (scripts.Count == 0)\n            {\n                Debug.LogError(\"No Scripts\");\n                return;\n            }\n            #endregion\n\n            #region libraries\n            List<string> libraries = new List<string>();\n            string[] referenced = new string[] { \"UnityEngine\", \"UnityEngine.UI\" };\n            string projectPath = Path.GetFullPath(Application.dataPath+\"/..\").Replace(\"\\\\\", \"/\");\n            // http://stackoverflow.com/questions/52797/how-do-i-get-the-path-of-the-assembly-the-code-is-in\n            foreach (var assem in AppDomain.CurrentDomain.GetAssemblies())\n            {\n                UriBuilder uri = new UriBuilder(assem.CodeBase);\n                string path = Uri.UnescapeDataString(uri.Path).Replace(\"\\\\\", \"/\");\n                string name = Path.GetFileNameWithoutExtension(path);\n                // ignore dll for Editor\n                if ((path.StartsWith(projectPath) && !path.Contains(\"/Editor/\") && !path.Contains(\"CSharp-Editor\"))\n                    || referenced.Contains(name))\n                {\n                    libraries.Add(path);\n                }\n            }\n            #endregion\n\t\t\t\n            #region mono compile            \n            string editorData = EditorApplication.applicationContentsPath;\n#if UNITY_EDITOR_OSX && !UNITY_5_4_OR_NEWER\n\t\t\teditorData += \"/Frameworks\";\n#endif\n            List<string> arg = new List<string>();\n            arg.Add(\"/target:library\");\n            arg.Add(string.Format(\"/out:\\\"{0}\\\"\", WrapperName));\n            arg.Add(string.Format(\"/r:\\\"{0}\\\"\", string.Join(\";\", libraries.ToArray())));\n            arg.AddRange(scripts);\n\n            const string ArgumentFile = \"LuaCodeGen.txt\";\n            File.WriteAllLines(ArgumentFile, arg.ToArray());\n            \n\t\t\tEnvironment.SetEnvironmentVariable (\"MONO_PATH\", editorData+\"/Mono/lib/mono/unity\");\n\t\t\tEnvironment.SetEnvironmentVariable (\"MONO_CFG_DIR\", editorData+\"/Mono/etc\");\n\t\t\tstring mono = editorData+ \"/Mono/bin/mono\";\n#if UNITY_EDITOR_WIN\n            mono += \".exe\";\n#endif\n\t\t\tstring smcs = editorData + \"/Mono/lib/mono/unity/smcs.exe\";\n\t\t\t// wrapping since we may have space\n#if UNITY_EDITOR_WIN\n            mono = \"\\\"\" + mono + \"\\\"\";\n#endif\n            smcs = \"\\\"\" + smcs + \"\\\"\";\n            #endregion\n\n            #region execute bash\n            StringBuilder output = new StringBuilder();\n            StringBuilder error = new StringBuilder();\n            bool success = false;\n            try\n            {\n                var process = new System.Diagnostics.Process();\n                process.StartInfo.FileName = mono;\n                process.StartInfo.Arguments = smcs + \" @\" + ArgumentFile;\n                process.StartInfo.UseShellExecute = false;\n                process.StartInfo.RedirectStandardOutput = true;\n                process.StartInfo.RedirectStandardError = true;\n\n                using (var outputWaitHandle = new System.Threading.AutoResetEvent(false))\n                using (var errorWaitHandle = new System.Threading.AutoResetEvent(false))\n                {\n                    process.OutputDataReceived += (sender, e) =>\n                    {\n                        if (e.Data == null)\n                        {\n                            outputWaitHandle.Set();\n                        }\n                        else\n                        {\n                            output.AppendLine(e.Data);\n                        }\n                    };\n                    process.ErrorDataReceived += (sender, e) =>\n                    {\n                        if (e.Data == null)\n                        {\n                            errorWaitHandle.Set();\n                        }\n                        else\n                        {\n                            error.AppendLine(e.Data);\n                        }\n                    };\n                    // http://stackoverflow.com/questions/139593/processstartinfo-hanging-on-waitforexit-why\n                    process.Start();\n\n                    process.BeginOutputReadLine();\n                    process.BeginErrorReadLine();\n\n                    const int timeout = 300;\n                    if (process.WaitForExit(timeout * 1000) &&\n                        outputWaitHandle.WaitOne(timeout * 1000) &&\n                        errorWaitHandle.WaitOne(timeout * 1000))\n                    {\n                        success = (process.ExitCode == 0);\n                    }\n                }\n            }\n            catch (System.Exception ex)\n            {\n                Debug.LogError(ex);\n            }\n            #endregion\n\n            Debug.Log(output.ToString());\n            if (success)\n            {\n                Directory.Delete(GenPath, true);\n                Directory.CreateDirectory(GenPath);\n\t\t\t\tFile.Move (WrapperName, GenPath + WrapperName);\n\t\t\t\t// AssetDatabase.Refresh();\n                File.Delete(ArgumentFile);\n            }\n            else\n            {\n                Debug.LogError(error.ToString());\n            }            \n        }\n\n        static void clear(string[] paths)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tforeach (string path in paths)\n\t\t\t\t{\n\t\t\t\t\tSystem.IO.Directory.Delete(path, true);\n\t\t\t\t\tAssetDatabase.DeleteAsset(path);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch\n\t\t\t{\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tAssetDatabase.Refresh();\n\t\t}\n\t\t\n\t\tstatic bool Generate(Type t, string path)\n\t\t{\n\t\t\treturn Generate(t, null, path);\n\t\t}\n\t\t\n\t\tstatic bool Generate(Type t, string ns, string path)\n\t\t{\n\t\t\tif (t.IsInterface)\n\t\t\t\treturn false;\n\t\t\t\n\t\t\tCodeGenerator cg = new CodeGenerator();\n\t\t\tcg.givenNamespace = ns;\n            cg.path = path;\n\t\t\treturn cg.Generate(t);\n\t\t}\n\t\t\n\t\tstatic void GenerateBind(List<Type> list, string name, int order,string path)\n\t\t{\n\t\t\t// delete wrapper dll\n\t\t\tSystem.IO.File.Delete(GenPath + WrapperName);\n\n\t\t\tCodeGenerator cg = new CodeGenerator();\n            cg.path = path;\n\t\t\tcg.GenerateBind(list, name, order);\n\t\t}\n\t\t\n\t}\n\t\n\tclass CodeGenerator\n\t{\n\t\tstatic List<string> memberFilter = new List<string>\n        {\n            \"AnimationClip.averageDuration\",\n            \"AnimationClip.averageAngularSpeed\",\n            \"AnimationClip.averageSpeed\",\n            \"AnimationClip.apparentSpeed\",\n            \"AnimationClip.isLooping\",\n            \"AnimationClip.isAnimatorMotion\",\n            \"AnimationClip.isHumanMotion\",\n            \"AnimatorOverrideController.PerformOverrideClipListCleanup\",\n            \"Caching.SetNoBackupFlag\",\n            \"Caching.ResetNoBackupFlag\",\n            \"Light.areaSize\",\n            \"Security.GetChainOfTrustValue\",\n            \"Texture2D.alphaIsTransparency\",\n            \"WWW.movie\",\n            \"WebCamTexture.MarkNonReadable\",\n            \"WebCamTexture.isReadable\",\n            // i don't know why below 2 functions missed in iOS platform\n            \"*.OnRebuildRequested\",\n            // il2cpp not exixts\n            \"Application.ExternalEval\",\n            \"GameObject.networkView\",\n            \"Component.networkView\",\n            // unity5\n            \"AnimatorControllerParameter.name\",\n            \"Input.IsJoystickPreconfigured\",\n            \"Resources.LoadAssetAtPath\",\n#if UNITY_4_6\n\t\t\t\"Motion.ValidateIfRetargetable\",\n\t\t\t\"Motion.averageDuration\",\n\t\t\t\"Motion.averageAngularSpeed\",\n\t\t\t\"Motion.averageSpeed\",\n\t\t\t\"Motion.apparentSpeed\",\n\t\t\t\"Motion.isLooping\",\n\t\t\t\"Motion.isAnimatorMotion\",\n\t\t\t\"Motion.isHumanMotion\",\n#endif\n\n\t\t\t\"Light.lightmappingMode\",\n\t\t\t\"MonoBehaviour.runInEditMode\",\n\t\t\t\"MonoBehaviour.useGUILayout\",\n\t\t\t\"PlayableGraph.CreateScriptPlayable\",\n        };\n\n\n\t\tstatic void FilterSpecMethods(out Dictionary<Type,List<MethodInfo>> dic, out Dictionary<Type,Type> overloadedClass){\n\t\t\tdic = new Dictionary<Type, List<MethodInfo>>();\n\t\t\toverloadedClass = new Dictionary<Type, Type> ();\n\t\t\tList<string> asems;\n\t\t\tCustomExport.OnGetAssemblyToGenerateExtensionMethod(out asems);\n\n            // Get list from custom export.\n            object[] aCustomExport = new object[1];\n            LuaCodeGen.InvokeEditorMethod<ICustomExportPost>(\"OnGetAssemblyToGenerateExtensionMethod\", ref aCustomExport);\n            if (null != aCustomExport[0])\n            {\n                if (null != asems)\n                {\n                    asems.AddRange((List<string>)aCustomExport[0]);\n                }\n                else\n                {\n                    asems = (List<string>)aCustomExport[0];\n                }\n            }\n\n            foreach (string assstr in asems)\n\t\t\t{\n\t\t\t\tAssembly assembly = Assembly.Load(assstr);\n\t\t\t\tforeach (Type type in assembly.GetExportedTypes())\n\t\t\t\t{\n\t\t\t\t\tif (type.IsSealed && !type.IsGenericType && !type.IsNested)\n\t\t\t\t\t{\n\t\t\t\t\t\tMethodInfo[] methods = type.GetMethods(BindingFlags.Static | BindingFlags.Public);\n\t\t\t\t\t\tforeach (MethodInfo _method in methods)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tMethodInfo method = tryFixGenericMethod(_method);\n                            if (IsExtensionMethod(method))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tType extendedType = method.GetParameters()[0].ParameterType;\n\t\t\t\t\t\t\t\tif (!dic.ContainsKey(extendedType))\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tdic.Add(extendedType, new List<MethodInfo>());\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdic[extendedType].Add(method);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\n\t\t\t\t\tif (type.IsDefined(typeof(OverloadLuaClassAttribute),false)) {\n\t\t\t\t\t\tOverloadLuaClassAttribute olc = type.GetCustomAttributes (typeof(OverloadLuaClassAttribute), false)[0] as OverloadLuaClassAttribute;\n\t\t\t\t\t\tif (olc != null) {\n\t\t\t\t\t\t\tif (overloadedClass.ContainsKey (olc.targetType))\n\t\t\t\t\t\t\t\tthrow new Exception (\"Can't overload class more than once\");\n\t\t\t\t\t\t\toverloadedClass.Add (olc.targetType, type);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tstatic bool IsExtensionMethod(MethodBase method){\n\t\t\treturn method.IsDefined(typeof(System.Runtime.CompilerServices.ExtensionAttribute),false);\n\t\t}\n\n\n\n\t\tstatic Dictionary<System.Type,List<MethodInfo>> extensionMethods;\n\t\tstatic Dictionary<Type,Type> overloadedClass;\n\n\t\tstatic CodeGenerator(){\n\t\t\tFilterSpecMethods(out extensionMethods,out overloadedClass);\n\t\t}\n\n\t\tHashSet<string> funcname = new HashSet<string>();\n\t\tDictionary<string, bool> directfunc = new Dictionary<string, bool>();\n\t\t\n\t\tpublic string givenNamespace;\n        public string path;\n\t\tpublic bool includeExtension = SLuaSetting.Instance.exportExtensionMethod;\n\t\tpublic EOL eol = SLuaSetting.Instance.eol;\n\n\t\tclass PropPair\n\t\t{\n\t\t\tpublic string get = \"null\";\n\t\t\tpublic string set = \"null\";\n\t\t\tpublic bool isInstance = true;\n\t\t}\n\t\tDictionary<string, PropPair> propname = new Dictionary<string, PropPair>();\n\t\t\n\t\tint indent = 0;\n\n\t\tpublic void GenerateBind(List<Type> list, string name, int order)\n\t\t{\n\t\t\tHashSet<Type> exported = new HashSet<Type>();\n\t\t\tstring f = System.IO.Path.Combine(path , name + \".cs\");\n\t\t\tStreamWriter file = new StreamWriter(f, false, Encoding.UTF8);\n\t\t\tfile.NewLine = NewLine;\n\t\t\tWrite(file, \"using System;\");\n\t\t\tWrite(file, \"using System.Collections.Generic;\");\n\t\t\tWrite(file, \"namespace SLua {\");\n\t\t\tWrite(file, \"[LuaBinder({0})]\", order);\n\t\t\tWrite(file, \"public class {0} {{\", name);\n\t\t\tWrite(file, \"public static Action<IntPtr>[] GetBindList() {\");\n\t\t\tWrite(file, \"Action<IntPtr>[] list= {\");\n\t\t\tforeach (Type t in list)\n\t\t\t{\n\t\t\t\tWriteBindType(file, t, list, exported);\n\t\t\t}\n\t\t\tWrite(file, \"};\");\n\t\t\tWrite(file, \"return list;\");\n\t\t\tWrite(file, \"}\");\n\t\t\tWrite(file, \"}\");\n\t\t\tWrite(file, \"}\");\n\t\t\tfile.Close();\n\t\t}\n\n\t\tvoid WriteBindType(StreamWriter file, Type t, List<Type> exported, HashSet<Type> binded)\n\t\t{\n\t\t\tif (t == null || binded.Contains(t) || !exported.Contains(t))\n\t\t\t\treturn;\n\n\t\t\tWriteBindType(file, t.BaseType, exported, binded);\n\t\t\tWrite(file, \"{0}.reg,\", ExportName(t), binded);\n\t\t\tbinded.Add(t);\n\t\t}\n\n\t\tpublic string DelegateExportFilename(string path, Type t)\n\t\t{\n\t\t\tstring f;\n\t\t\tif (t.IsGenericType)\n\t\t\t{\n\t\t\t\tf = path + string.Format(\"Lua{0}_{1}.cs\", _Name(GenericBaseName(t)), _Name(GenericName(t)));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tf = path + \"LuaDelegate_\" + _Name(t.FullName) + \".cs\";\n\t\t\t}\n\t\t\treturn f;\n\t\t}\n\t\t\n\t\t\n\t\tpublic bool Generate(Type t)\n\t\t{\n\t\t\tif (!Directory.Exists(path))\n\t\t\t{\n\t\t\t\tDirectory.CreateDirectory(path);\n\t\t\t}\n\t\t\t\n\t\t\tif (!t.IsGenericTypeDefinition && (!IsObsolete(t) && t != typeof(YieldInstruction) && t != typeof(Coroutine))\n\t\t\t    || (t.BaseType != null && t.BaseType == typeof(System.MulticastDelegate)))\n\t\t\t{\n\n\t\t\t\tif (t.IsNested && t.DeclaringType.IsPublic == false)\n\t\t\t\t\treturn false;\n\n\t\t\t\tif (t.IsEnum)\n\t\t\t\t{\n\t\t\t\t\tStreamWriter file = Begin(t);\n\t\t\t\t\tWriteHead(t, file);\n\t\t\t\t\tRegEnumFunction(t, file);\n\t\t\t\t\tEnd(file);\n\t\t\t\t}\n\t\t\t\telse if (t.BaseType == typeof(System.MulticastDelegate))\n\t\t\t\t{\n\t\t\t\t\tif (t.ContainsGenericParameters)\n\t\t\t\t\t\treturn false;\n\n\t\t\t\t\tstring f = DelegateExportFilename(path, t);\n\n\t\t\t\t\tStreamWriter file = new StreamWriter(f, false, Encoding.UTF8);\n\t\t\t\t\tfile.NewLine = NewLine;\n\t\t\t\t\tWriteDelegate(t, file);\n\t\t\t\t\tfile.Close();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfuncname.Clear();\n\t\t\t\t\tpropname.Clear();\n\t\t\t\t\tdirectfunc.Clear();\n\t\t\t\t\t\n\t\t\t\t\tStreamWriter file = Begin(t);\n\t\t\t\t\tWriteHead(t, file);\n\t\t\t\t\tWriteConstructor(t, file);\n\t\t\t\t\tWriteFunction(t, file,false);\n\t\t\t\t\tWriteFunction(t, file, true);\n\t\t\t\t\tWriteField(t, file);\n\t\t\t\t\tRegFunction(t, file);\n\t\t\t\t\tEnd(file);\n\t\t\t\t\t\n\t\t\t\t\tif (t.BaseType != null && t.BaseType.Name.Contains(\"UnityEvent`\"))\n\t\t\t\t\t{\n\t\t\t\t\t\tstring basename = \"LuaUnityEvent_\" + _Name(GenericName(t.BaseType)) + \".cs\";\n\t\t\t\t\t\tstring f = path + basename;\n\t\t\t\t\t\tstring checkf = LuaCodeGen.GenPath + \"Unity/\" + basename;\n\t\t\t\t\t\tif (!File.Exists(checkf)) // if had exported\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfile = new StreamWriter(f, false, Encoding.UTF8);\n\t\t\t\t\t\t\tfile.NewLine = NewLine;\n\t\t\t\t\t\t\tWriteEvent(t, file);\n\t\t\t\t\t\t\tfile.Close();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\n\t\tvoid WriteDelegate(Type t, StreamWriter file)\n\t\t{\n\t\t\tstring temp = @\"\nusing System;\nusing System.Collections.Generic;\n\nnamespace SLua\n{\n    public partial class LuaDelegation : LuaObject\n    {\n\n        static internal int checkDelegate(IntPtr l,int p,out $FN ua) {\n            int op = extractFunction(l,p);\n\t\t\tif(LuaDLL.lua_isnil(l,p)) {\n\t\t\t\tua=null;\n\t\t\t\treturn op;\n\t\t\t}\n            else if (LuaDLL.lua_isuserdata(l, p)==1)\n            {\n                ua = ($FN)checkObj(l, p);\n                return op;\n            }\n            LuaDelegate ld;\n            checkType(l, -1, out ld);\n\t\t\tLuaDLL.lua_pop(l,1);\n            if(ld.d!=null)\n            {\n                ua = ($FN)ld.d;\n                return op;\n            }\n\t\t\t\n\t\t\tl = LuaState.get(l).L;\n            ua = ($ARGS) =>\n            {\n                int error = pushTry(l);\n\";\n\t\t\t\n\t\t\ttemp = temp.Replace(\"$TN\", t.Name);\n\t\t\ttemp = temp.Replace(\"$FN\", SimpleType(t));\n\t\t\tMethodInfo mi = t.GetMethod(\"Invoke\");\n\t\t\tList<int> outindex = new List<int>();\n\t\t\tList<int> refindex = new List<int>();\n\t\t\ttemp = temp.Replace(\"$ARGS\", ArgsList(mi, ref outindex, ref refindex));\n\t\t\tWrite(file, temp);\n\t\t\t\n\t\t\tthis.indent = 4;\n\t\t\t\n\t\t\tfor (int n = 0; n < mi.GetParameters().Length; n++)\n\t\t\t{\n\t\t\t\tif (!outindex.Contains(n))\n\t\t\t\t\tWrite(file, \"pushValue(l,a{0});\", n + 1);\n\t\t\t}\n\t\t\t\n\t\t\tWrite(file, \"ld.pcall({0}, error);\", mi.GetParameters().Length - outindex.Count);\n\n\t\t\tint offset = 0;\n\t\t\tif (mi.ReturnType != typeof(void))\n\t\t\t{\n\t\t\t\toffset = 1;\n\t\t\t\tWriteValueCheck(file, mi.ReturnType, offset, \"ret\", \"error+\");\n\t\t\t}\n\t\t\t\n\t\t\tforeach (int i in outindex)\n\t\t\t{\n\t\t\t\tstring a = string.Format(\"a{0}\", i + 1);\n\t\t\t\tWriteCheckType(file, mi.GetParameters()[i].ParameterType, i + offset, a, \"error+\");\n\t\t\t}\n\t\t\t\n\t\t\tforeach (int i in refindex)\n\t\t\t{\n\t\t\t\tstring a = string.Format(\"a{0}\", i + 1);\n\t\t\t\tWriteCheckType(file, mi.GetParameters()[i].ParameterType, i + offset, a, \"error+\");\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tWrite(file, \"LuaDLL.lua_settop(l, error-1);\");\n\t\t\tif (mi.ReturnType != typeof(void))\n\t\t\t\tWrite(file, \"return ret;\");\n\t\t\t\n\t\t\tWrite(file, \"};\");\n\t\t\tWrite(file, \"ld.d=ua;\");\n\t\t\tWrite(file, \"return op;\");\n\t\t\tWrite(file, \"}\");\n\t\t\tWrite(file, \"}\");\n\t\t\tWrite(file, \"}\");\n\t\t}\n\t\t\n\t\tstring ArgsList(MethodInfo m, ref List<int> outindex, ref List<int> refindex)\n\t\t{\n\t\t\tstring str = \"\";\n\t\t\tParameterInfo[] pars = m.GetParameters();\n\t\t\tfor (int n = 0; n < pars.Length; n++)\n\t\t\t{\n\t\t\t\tstring t = SimpleType(pars[n].ParameterType);\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tParameterInfo p = pars[n];\n\t\t\t\tif (p.ParameterType.IsByRef && p.IsOut)\n\t\t\t\t{\n\t\t\t\t\tstr += string.Format(\"out {0} a{1}\", t, n + 1);\n\t\t\t\t\toutindex.Add(n);\n\t\t\t\t}\n\t\t\t\telse if (p.ParameterType.IsByRef)\n\t\t\t\t{\n\t\t\t\t\tstr += string.Format(\"ref {0} a{1}\", t, n + 1);\n\t\t\t\t\trefindex.Add(n);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tstr += string.Format(\"{0} a{1}\", t, n + 1);\n\t\t\t\tif (n < pars.Length - 1)\n\t\t\t\t\tstr += \",\";\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t\n\t\tvoid tryMake(Type t)\n\t\t{\n\n\t\t\tif (t.BaseType == typeof(System.MulticastDelegate))\n\t\t\t{\n\t\t\t\tCodeGenerator cg = new CodeGenerator();\n\t\t\t\tif (File.Exists(cg.DelegateExportFilename(LuaCodeGen.GenPath + \"Unity/\", t)))\n\t\t\t\t\treturn;\n                cg.path = this.path;\n\t\t\t\tcg.Generate(t);\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid WriteEvent(Type t, StreamWriter file)\n\t\t{\n\t\t\tstring temp = @\"\nusing System;\nusing System.Collections.Generic;\n\nnamespace SLua\n{\n    public class LuaUnityEvent_$CLS : LuaObject\n    {\n\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int AddListener(IntPtr l)\n        {\n            try\n            {\n                UnityEngine.Events.UnityEvent<$GN> self = checkSelf<UnityEngine.Events.UnityEvent<$GN>>(l);\n                UnityEngine.Events.UnityAction<$GN> a1;\n                checkType(l, 2, out a1);\n                self.AddListener(a1);\n\t\t\t\tpushValue(l,true);\n                return 1;\n            }\n            catch (Exception e)\n            {\n\t\t\t\treturn error(l,e);\n            }\n        }\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int RemoveListener(IntPtr l)\n        {\n            try\n            {\n                UnityEngine.Events.UnityEvent<$GN> self = checkSelf<UnityEngine.Events.UnityEvent<$GN>>(l);\n                UnityEngine.Events.UnityAction<$GN> a1;\n                checkType(l, 2, out a1);\n                self.RemoveListener(a1);\n\t\t\t\tpushValue(l,true);\n                return 1;\n            }\n            catch (Exception e)\n            {\n                return error(l,e);\n            }\n        }\n        [MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n        static public int Invoke(IntPtr l)\n        {\n            try\n            {\n                UnityEngine.Events.UnityEvent<$GN> self = checkSelf<UnityEngine.Events.UnityEvent<$GN>>(l);\n\" + \n                \n\t\t\t\tGenericCallDecl(t.BaseType)\n\n\n+ @\"\n\t\t\t\tpushValue(l,true);\n                return 1;\n            }\n            catch (Exception e)\n            {\n                return error(l,e);\n            }\n        }\n        static public void reg(IntPtr l)\n        {\n            getTypeTable(l, typeof(LuaUnityEvent_$CLS).FullName);\n            addMember(l, AddListener);\n            addMember(l, RemoveListener);\n            addMember(l, Invoke);\n            createTypeMetatable(l, null, typeof(LuaUnityEvent_$CLS), typeof(UnityEngine.Events.UnityEventBase));\n        }\n\n        static bool checkType(IntPtr l,int p,out UnityEngine.Events.UnityAction<$GN> ua) {\n            LuaDLL.luaL_checktype(l, p, LuaTypes.LUA_TFUNCTION);\n            LuaDelegate ld;\n            checkType(l, p, out ld);\n            if (ld.d != null)\n            {\n                ua = (UnityEngine.Events.UnityAction<$GN>)ld.d;\n                return true;\n            }\n\t\t\tl = LuaState.get(l).L;\n            ua = ($ARGS) =>\n            {\n                int error = pushTry(l);\n                $PUSHVALUES\n                ld.pcall($GENERICCOUNT, error);\n                LuaDLL.lua_settop(l,error - 1);\n            };\n            ld.d = ua;\n            return true;\n        }\n    }\n}\";\n\t\t\t\n\t\t\t\n\t\t\ttemp = temp.Replace(\"$CLS\", _Name(GenericName(t.BaseType)));\n\t\t\ttemp = temp.Replace(\"$FNAME\", FullName(t));\n\t\t\ttemp = temp.Replace(\"$GN\", GenericName(t.BaseType,\",\"));\n\t\t\ttemp = temp.Replace(\"$ARGS\", ArgsDecl(t.BaseType));\n\t\t\ttemp = temp.Replace(\"$PUSHVALUES\", PushValues(t.BaseType));\n\t\t\ttemp = temp.Replace (\"$GENERICCOUNT\", t.BaseType.GetGenericArguments ().Length.ToString());\n\t\t\tWrite(file, temp);\n\t\t}\n\n\t\tstring GenericCallDecl(Type t) {\n\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType[] tt = t.GetGenericArguments();\n\t\t\t\tstring ret = \"\";\n\t\t\t\tstring args = \"\";\n\t\t\t\tfor (int n = 0; n < tt.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tstring dt = SimpleType(tt[n]);\n\t\t\t\t\tret+=string.Format(\"\t\t\t\t{0} a{1};\",dt,n)+NewLine;\n                    //ret+=string.Format(\"\t\t\t\tcheckType(l,{0},out a{1});\",n+2,n)+NewLine;\n                    ret += \"\t\t\t\t\" + GetCheckType(tt[n], n + 2, \"a\" + n) + NewLine;\n                    args +=(\"a\"+n);\n\t\t\t\t\tif (n < tt.Length - 1) args += \",\";\n\t\t\t\t}\n\t\t\t\tret+=string.Format(\"\t\t\t\tself.Invoke({0});\",args)+NewLine;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tDebug.Log(e.ToString());\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\n        string GetCheckType(Type t, int n, string v = \"v\", string prefix = \"\")\n        {\n            if (t.IsEnum)\n            {\n                return string.Format(\"checkEnum(l,{2}{0},out {1});\", n, v, prefix);\n            }\n            else if (t.BaseType == typeof(System.MulticastDelegate))\n            {\n                return string.Format(\"int op=LuaDelegation.checkDelegate(l,{2}{0},out {1});\", n, v, prefix);\n            }\n            else if (IsValueType(t))\n            {\n                if (t.IsGenericType && t.GetGenericTypeDefinition() == typeof(Nullable<>))\n                    return string.Format(\"checkNullable(l,{2}{0},out {1});\", n, v, prefix);\n                else\n                    return string.Format(\"checkValueType(l,{2}{0},out {1});\", n, v, prefix);\n            }\n            else if (t.IsArray)\n            {\n                return string.Format(\"checkArray(l,{2}{0},out {1});\", n, v, prefix);\n            }\n            else\n            {\n                return string.Format(\"checkType(l,{2}{0},out {1});\", n, v, prefix);\n            }\n        }\n\n        string PushValues(Type t) {\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType[] tt = t.GetGenericArguments();\n\t\t\t\tstring ret = \"\";\n\t\t\t\tfor (int n = 0; n < tt.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tret+=(\"pushValue(l,v\"+n+\");\");\n\t\t\t\t}\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tDebug.Log(e.ToString());\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\n\t\tstring ArgsDecl(Type t)\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType[] tt = t.GetGenericArguments();\n\t\t\t\tstring ret = \"\";\n\t\t\t\tfor (int n = 0; n < tt.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tstring dt = SimpleType(tt[n]);\n\t\t\t\t\tdt+=(\" v\"+n);\n\t\t\t\t\tret += dt;\n\t\t\t\t\tif (n < tt.Length - 1)\n\t\t\t\t\t\tret += \",\";\n\t\t\t\t}\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tDebug.Log(e.ToString());\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid RegEnumFunction(Type t, StreamWriter file)\n\t\t{\n\t\t\t// Write export function\n\t\t\tWrite(file, \"static public void reg(IntPtr l) {\");\n\t\t\tWrite(file, \"getEnumTable(l,\\\"{0}\\\");\", string.IsNullOrEmpty(givenNamespace) ? FullName(t) : givenNamespace);\n\n\t\t\tforeach (string name in Enum.GetNames (t))\n\t\t\t{\n\t\t\t\tWrite(file, \"addMember(l,{0},\\\"{1}\\\");\", Convert.ToInt32(Enum.Parse(t, name)), name);\n\t\t\t}\n\t\t\t\n\t\t\tWrite(file, \"LuaDLL.lua_pop(l, 1);\");\n\t\t\tWrite(file, \"}\");\n\t\t}\n\t\t\n\t\t\n\t\tStreamWriter Begin(Type t)\n\t\t{\n\t\t\tstring clsname = ExportName(t);\n\t\t\tstring f = path + clsname + \".cs\";\n\t\t\tStreamWriter file = new StreamWriter(f, false, Encoding.UTF8);\n\t\t\tfile.NewLine = NewLine;\n\t\t\treturn file;\n\t\t}\n\t\t\n\t\tprivate void End(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"}\");\n\t\t\tfile.Flush();\n\t\t\tfile.Close();\n\t\t}\n\t\t\n\t\tprivate void WriteHead(Type t, StreamWriter file)\n\t\t{\n\t\t\tHashSet<string> nsset=new HashSet<string>();\n\t\t\tWrite(file, \"using System;\"); \n\t\t\tWrite(file, \"using SLua;\"); \n\t\t\tWrite(file, \"using System.Collections.Generic;\"); \n\t\t\tnsset.Add(\"System\");\n\t\t\tnsset.Add(\"SLua\");\n\t\t\tnsset.Add(\"System.Collections.Generic\");\n\t\t\tWriteExtraNamespace(file,t, nsset);\n#if UNITY_5_3_OR_NEWER\n\t\t\tWrite (file, \"[UnityEngine.Scripting.Preserve]\");\n#endif\n\t\t\tWrite(file, \"public class {0} : LuaObject {{\", ExportName(t));\n\t\t}\n\n\t\t// add namespace for extension method\n\t\tvoid WriteExtraNamespace(StreamWriter file,Type t, HashSet<string> nsset) {\n\t\t\tList<MethodInfo> lstMI;\n\t\t\tif(extensionMethods.TryGetValue(t,out lstMI)) {\n\t\t\t\tforeach(MethodInfo m in lstMI) {\n\t\t\t\t\t// if not writed\n\t\t\t\t\tif(!string.IsNullOrEmpty(m.ReflectedType.Namespace) && !nsset.Contains(m.ReflectedType.Namespace)) {\n\t\t\t\t\t\tWrite(file,\"using {0};\",m.ReflectedType.Namespace);\n\t\t\t\t\t\tnsset.Add(m.ReflectedType.Namespace);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprivate void WriteFunction(Type t, StreamWriter file, bool writeStatic = false)\n\t\t{\n\t\t\tBindingFlags bf = BindingFlags.Public | BindingFlags.DeclaredOnly;\n\t\t\tif (writeStatic)\n\t\t\t\tbf |= BindingFlags.Static;\n\t\t\telse\n\t\t\t\tbf |= BindingFlags.Instance;\n\t\t\t\n\t\t\tMethodInfo[] members = t.GetMethods(bf);\n\t\t\tList<MethodInfo> methods = new List<MethodInfo>();\n\t\t\tforeach (MethodInfo mi in members) \n\t\t\t\tmethods.Add(tryFixGenericMethod(mi));\n\n\t\t\tif (!writeStatic && this.includeExtension){\n\t\t\t\tif(extensionMethods.ContainsKey(t)){\n\t\t\t\t\tmethods.AddRange(extensionMethods[t]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tforeach (MethodInfo mi in methods)\n\t\t\t{\n\t\t\t\tbool instanceFunc;\n\t\t\t\tif (writeStatic && isPInvoke(mi, out instanceFunc))\n\t\t\t\t{\n\t\t\t\t\tdirectfunc.Add(t.FullName + \".\" + mi.Name, instanceFunc);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tstring fn = writeStatic ? staticName(mi.Name) : mi.Name;\n\t\t\t\tif (mi.MemberType == MemberTypes.Method\n\t\t\t\t    && !IsObsolete(mi)\n\t\t\t\t    && !DontExport(mi)\n\t\t\t\t    && !funcname.Contains(fn)\n\t\t\t\t    && isUsefullMethod(mi)\n\t\t\t\t    && !MemberInFilter(t, mi))\n\t\t\t\t{\n\t\t\t\t\tWriteFunctionDec(file, fn);\n\t\t\t\t\tWriteFunctionImpl(file, mi, t, bf);\n\t\t\t\t\tfuncname.Add(fn);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbool isPInvoke(MethodInfo mi, out bool instanceFunc)\n\t\t{\n\t\t\tif (mi.IsDefined(typeof(MonoPInvokeCallbackAttribute), false))\n\t\t\t{\n\t\t\t\tinstanceFunc = !mi.IsDefined(typeof(StaticExportAttribute), false);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tinstanceFunc = true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tstring staticName(string name)\n\t\t{\n\t\t\tif (name.StartsWith(\"op_\"))\n\t\t\t\treturn name;\n\t\t\treturn name + \"_s\";\n\t\t}\n\t\t\n\t\t\n\t\tbool MemberInFilter(Type t, MemberInfo mi)\n\t\t{\n\t\t\treturn memberFilter.Contains(t.Name + \".\" + mi.Name) || memberFilter.Contains(\"*.\" + mi.Name);\n\t\t}\n\t\t\n\t\tbool IsObsolete(MemberInfo t)\n\t\t{\n\t\t\treturn t.IsDefined(typeof(ObsoleteAttribute), false);\n\t\t}\n\n\t\tstring NewLine{\n\t\t\tget{\n\t\t\t\tswitch(eol){\n\t\t\t\tcase EOL.Native:\n\t\t\t\t\treturn System.Environment.NewLine;\n\t\t\t\tcase EOL.CRLF:\n\t\t\t\t\treturn \"\\r\\n\";\n\t\t\t\tcase EOL.CR:\n\t\t\t\t\treturn \"\\r\";\n\t\t\t\tcase EOL.LF:\n\t\t\t\t\treturn \"\\n\";\n\t\t\t\tdefault:\n\t\t\t\t\treturn \"\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbool hasOverloadedVersion(Type t,ref string f) {\n\t\t\tType ot;\n\t\t\tif (overloadedClass.TryGetValue (t, out ot)) {\n\t\t\t\tMethodInfo mi = ot.GetMethod (f, BindingFlags.Static | BindingFlags.Public | BindingFlags.Instance | BindingFlags.DeclaredOnly);\n\t\t\t\tif (mi != null && mi.IsDefined(typeof(MonoPInvokeCallbackAttribute),false)) {\n\t\t\t\t\tf = FullName (ot) + \".\" + f;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\tvoid RegFunction(Type t, StreamWriter file)\n\t\t{\n#if UNITY_5_3_OR_NEWER\n\t\t\tWrite (file, \"[UnityEngine.Scripting.Preserve]\");\n#endif\n\n\t\t\t// Write export function\n\t\t\tWrite(file, \"static public void reg(IntPtr l) {\");\n\t\t\t\n\t\t\tif (t.BaseType != null && t.BaseType.Name.Contains(\"UnityEvent`\"))\n\t\t\t{\n\t\t\t\tWrite(file, \"LuaUnityEvent_{1}.reg(l);\", FullName(t), _Name((GenericName(t.BaseType))));\n\t\t\t}\n\t\t\t\n\t\t\tWrite(file, \"getTypeTable(l,\\\"{0}\\\");\", string.IsNullOrEmpty(givenNamespace) ? FullName(t) : givenNamespace);\n\t\t\tforeach (string i in funcname)\n\t\t\t{\n\t\t\t\tstring f = i;\n\t\t\t\tif (hasOverloadedVersion (t, ref f))\n\t\t\t\t\tWrite (file, \"addMember(l,{0});\", f);\n\t\t\t\telse\n\t\t\t\t\tWrite(file, \"addMember(l,{0});\", f);\n\t\t\t}\n\t\t\tforeach (string f in directfunc.Keys)\n\t\t\t{\n\t\t\t\tbool instance = directfunc[f];\n\t\t\t\tWrite(file, \"addMember(l,{0},{1});\", f, instance ? \"true\" : \"false\");\n\t\t\t}\n\t\t\t\n\t\t\tforeach (string f in propname.Keys)\n\t\t\t{\n\t\t\t\tPropPair pp = propname[f];\n\t\t\t\tWrite(file, \"addMember(l,\\\"{0}\\\",{1},{2},{3});\", f, pp.get, pp.set, pp.isInstance ? \"true\" : \"false\");\n\t\t\t}\n\t\t\tif (t.BaseType != null && !CutBase(t.BaseType))\n\t\t\t{\n\t\t\t\tif (t.BaseType.Name.Contains(\"UnityEvent`\"))\n\t\t\t\t\tWrite(file, \"createTypeMetatable(l,{2}, typeof({0}),typeof(LuaUnityEvent_{1}));\", TypeDecl(t), _Name(GenericName(t.BaseType)), constructorOrNot(t));\n\t\t\t\telse\n\t\t\t\t\tWrite(file, \"createTypeMetatable(l,{2}, typeof({0}),typeof({1}));\", TypeDecl(t), TypeDecl(t.BaseType), constructorOrNot(t));\n\t\t\t}\n\t\t\telse\n\t\t\t\tWrite(file, \"createTypeMetatable(l,{1}, typeof({0}));\", TypeDecl(t), constructorOrNot(t));\n\t\t\tWrite(file, \"}\");\n\t\t}\n\t\t\n\t\tstring constructorOrNot(Type t)\n\t\t{\n\t\t\tConstructorInfo[] cons = GetValidConstructor(t);\n\t\t\tif (cons.Length > 0 || t.IsValueType)\n\t\t\t\treturn \"constructor\";\n\t\t\treturn \"null\";\n\t\t}\n\t\t\n\t\tbool CutBase(Type t)\n\t\t{\n\t\t\tif (t.FullName.StartsWith(\"System.Object\"))\n\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tvoid WriteSet(StreamWriter file, Type t, string cls, string fn, bool isstatic = false,bool canread = true)\n\t\t{\n\t\t\tif (t.BaseType == typeof(MulticastDelegate))\n\t\t\t{\n\t\t\t\tif (isstatic)\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"if(op==0) {0}.{1}=v;\", cls, fn);\n\t\t\t\t\tif(canread){\n\t\t\t\t\t\tWrite(file, \"else if(op==1) {0}.{1}+=v;\", cls, fn);\n\t\t\t\t\t\tWrite(file, \"else if(op==2) {0}.{1}-=v;\", cls, fn);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"if(op==0) self.{0}=v;\", fn);\n\t\t\t\t\tif(canread){\n\t\t\t\t\t\tWrite(file, \"else if(op==1) self.{0}+=v;\", fn);\n\t\t\t\t\t\tWrite(file, \"else if(op==2) self.{0}-=v;\", fn);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (isstatic)\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"{0}.{1}=v;\", cls, fn);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"self.{0}=v;\", fn);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n        readonly static string[] keywords = { \"abstract\", \"as\", \"base\", \"bool\", \"break\", \"byte\", \"case\", \"catch\", \"char\", \"checked\", \"class\", \"const\", \"continue\", \"decimal\", \"default\", \"delegate\", \"do\", \"double\", \"else\", \"enum\", \"event\", \"explicit\", \"extern\", \"false\", \"finally\", \"fixed\", \"float\", \"for\", \"foreach\", \"goto\", \"if\", \"implicit\", \"in\", \"int\", \"interface\", \"internal\", \"is\", \"lock\", \"long\", \"namespace\", \"new\", \"null\", \"object\", \"operator\", \"out\", \"override\", \"params\", \"private\", \"protected\", \"public\", \"readonly\", \"ref\", \"return\", \"sbyte\", \"sealed\", \"short\", \"sizeof\", \"stackalloc\", \"static\", \"string\", \"struct\", \"switch\", \"this\", \"throw\", \"true\", \"try\", \"typeof\", \"uint\", \"ulong\", \"unchecked\", \"unsafe\", \"ushort\", \"using\", \"virtual\", \"void\", \"volatile\", \"while\" };\n\n        static string NormalName(string name)\n        {\n            if (Array.BinarySearch<string>(keywords, name) >= 0)\n            {\n                return \"@\" + name;\n            }\n            return name;\n        }\n\n        private void WriteField(Type t, StreamWriter file)\n\t\t{\n\t\t\t// Write field set/get\n\t\t\t\n\t\t\tFieldInfo[] fields = t.GetFields(BindingFlags.Static | BindingFlags.Public | BindingFlags.Instance | BindingFlags.DeclaredOnly);\n\t\t\tforeach (FieldInfo fi in fields)\n\t\t\t{\n\t\t\t\tif (DontExport(fi) || IsObsolete(fi))\n\t\t\t\t\tcontinue;\n\t\t\t\t\n\t\t\t\tPropPair pp = new PropPair();\n\t\t\t\tpp.isInstance = !fi.IsStatic;\n\t\t\t\t\n\t\t\t\tif (fi.FieldType.BaseType != typeof(MulticastDelegate))\n\t\t\t\t{\n\t\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\t\tWrite(file, \"static public int get_{0}(IntPtr l) {{\", fi.Name);\n\t\t\t\t\tWriteTry(file);\n\t\t\t\t\t\n\t\t\t\t\tif (fi.IsStatic)\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\tWritePushValue(fi.FieldType, file, string.Format(\"{0}.{1}\", TypeDecl(t), NormalName(fi.Name)));\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\tWritePushValue(fi.FieldType, file, string.Format(\"self.{0}\", NormalName(fi.Name)));\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\n\t\t\t\t\tpp.get = \"get_\" + fi.Name;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tif (!fi.IsLiteral && !fi.IsInitOnly)\n\t\t\t\t{\n\t\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\t\tWrite(file, \"static public int set_{0}(IntPtr l) {{\", fi.Name);\n\t\t\t\t\tWriteTry(file);\n\t\t\t\t\tif (fi.IsStatic)\n\t\t\t\t\t{\n\t\t\t\t\t\tWrite(file, \"{0} v;\", TypeDecl(fi.FieldType));\n\t\t\t\t\t\tWriteCheckType(file, fi.FieldType, 2);\n\t\t\t\t\t\tWriteSet(file, fi.FieldType, TypeDecl(t), NormalName(fi.Name), true);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\t\t\tWrite(file, \"{0} v;\", TypeDecl(fi.FieldType));\n\t\t\t\t\t\tWriteCheckType(file, fi.FieldType, 2);\n\t\t\t\t\t\tWriteSet(file, fi.FieldType, t.FullName, NormalName(fi.Name));\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (t.IsValueType && !fi.IsStatic)\n\t\t\t\t\t\tWrite(file, \"setBack(l,self);\");\n\t\t\t\t\tWriteOk(file);\n\t\t\t\t\tWrite(file, \"return 1;\");\n\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\n\t\t\t\t\tpp.set = \"set_\" + fi.Name;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tpropname.Add(fi.Name, pp);\n\t\t\t\ttryMake(fi.FieldType);\n\t\t\t}\n\t\t\t//for this[]\n\t\t\tList<PropertyInfo> getter = new List<PropertyInfo>();\n\t\t\tList<PropertyInfo> setter = new List<PropertyInfo>();\n\t\t\t// Write property set/get\n\t\t\tPropertyInfo[] props = t.GetProperties(BindingFlags.Static | BindingFlags.Public | BindingFlags.Instance | BindingFlags.DeclaredOnly);\n\t\t\tforeach (PropertyInfo fi in props)\n\t\t\t{\n\t\t\t\t//if (fi.Name == \"Item\" || IsObsolete(fi) || MemberInFilter(t,fi) || DontExport(fi))\n\t\t\t\tif (IsObsolete(fi) || MemberInFilter(t, fi) || DontExport(fi))\n\t\t\t\t\tcontinue;\n\t\t\t\tif (fi.Name == \"Item\"\n\t\t\t\t    || (t.Name == \"String\" && fi.Name == \"Chars\")) // for string[]\n\t\t\t\t{\n\t\t\t\t\t//for this[]\n\t\t\t\t\tif (!fi.GetGetMethod().IsStatic && fi.GetIndexParameters().Length == 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (fi.CanRead && !IsNotSupport(fi.PropertyType))\n\t\t\t\t\t\t\tgetter.Add(fi);\n\t\t\t\t\t\tif (fi.CanWrite && fi.GetSetMethod() != null)\n\t\t\t\t\t\t\tsetter.Add(fi);\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tPropPair pp = new PropPair();\n\t\t\t\tbool isInstance = true;\n\t\t\t\t\n\t\t\t\tif (fi.CanRead && fi.GetGetMethod() != null)\n\t\t\t\t{\n\t\t\t\t\tif (!IsNotSupport(fi.PropertyType))\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\t\t\tWrite(file, \"static public int get_{0}(IntPtr l) {{\", fi.Name);\n\t\t\t\t\t\tWriteTry(file);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (fi.GetGetMethod().IsStatic)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tisInstance = false;\n\t\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\t\tWritePushValue(fi.PropertyType, file, string.Format(\"{0}.{1}\", TypeDecl(t), NormalName(fi.Name)));\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\t\tWritePushValue(fi.PropertyType, file, string.Format(\"self.{0}\", NormalName(fi.Name)));\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\tpp.get = \"get_\" + fi.Name;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (fi.CanWrite && fi.GetSetMethod() != null)\n\t\t\t\t{\n\t\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\t\tWrite(file, \"static public int set_{0}(IntPtr l) {{\", fi.Name);\n\t\t\t\t\tWriteTry(file);\n\t\t\t\t\tif (fi.GetSetMethod().IsStatic)\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteValueCheck(file, fi.PropertyType, 2);\n\t\t\t\t\t\tWriteSet(file, fi.PropertyType, TypeDecl(t), NormalName(fi.Name), true,fi.CanRead);\n\t\t\t\t\t\tisInstance = false;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\t\t\tWriteValueCheck(file, fi.PropertyType, 2);\n\t\t\t\t\t\tWriteSet(file, fi.PropertyType, TypeDecl(t), NormalName(fi.Name),false,fi.CanRead);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (t.IsValueType)\n\t\t\t\t\t\tWrite(file, \"setBack(l,self);\");\n\t\t\t\t\tWriteOk(file);\n\t\t\t\t\tWrite(file, \"return 1;\");\n\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\tpp.set = \"set_\" + fi.Name;\n\t\t\t\t}\n\t\t\t\tpp.isInstance = isInstance;\n\t\t\t\t\n\t\t\t\tpropname.Add(fi.Name, pp);\n\t\t\t\ttryMake(fi.PropertyType);\n\t\t\t}\n\t\t\t//for this[]\n\t\t\tWriteItemFunc(t, file, getter, setter);\n\t\t}\n\t\tvoid WriteItemFunc(Type t, StreamWriter file, List<PropertyInfo> getter, List<PropertyInfo> setter)\n\t\t{\n\t\t\t\n\t\t\t//Write property this[] set/get\n\t\t\tif (getter.Count > 0)\n\t\t\t{\n\t\t\t\t//get\n\t\t\t\tbool first_get = true;\n\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\tWrite(file, \"static public int getItem(IntPtr l) {\");\n\t\t\t\tWriteTry(file);\n\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\tif (getter.Count == 1)\n\t\t\t\t{\n\t\t\t\t\tPropertyInfo _get = getter[0];\n\t\t\t\t\tParameterInfo[] infos = _get.GetIndexParameters();\n\t\t\t\t\tWriteValueCheck(file, infos[0].ParameterType, 2, \"v\");\n\t\t\t\t\tWrite(file, \"var ret = self[v];\");\n\t\t\t\t\tWriteOk(file);\n\t\t\t\t\tWritePushValue(_get.PropertyType, file, \"ret\");\n\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"LuaTypes t = LuaDLL.lua_type(l, 2);\");\n\t\t\t\t\tfor (int i = 0; i < getter.Count; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tPropertyInfo fii = getter[i];\n\t\t\t\t\t\tParameterInfo[] infos = fii.GetIndexParameters();\n\t\t\t\t\t\tWrite(file, \"{0}(matchType(l,2,t,typeof({1}))){{\", first_get ? \"if\" : \"else if\", infos[0].ParameterType);\n\t\t\t\t\t\tWriteValueCheck(file, infos[0].ParameterType, 2, \"v\");\n\t\t\t\t\t\tWrite(file, \"var ret = self[v];\");\n\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\tWritePushValue(fii.PropertyType, file, \"ret\");\n\t\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\tfirst_get = false;\n\t\t\t\t\t}\n\t\t\t\t\tWriteNotMatch (file, \"getItem\");\n\t\t\t\t}\n\t\t\t\tWriteCatchExecption(file);\n\t\t\t\tWrite(file, \"}\");\n\t\t\t\tfuncname.Add(\"getItem\");\n\t\t\t}\n\t\t\tif (setter.Count > 0)\n\t\t\t{\n\t\t\t\tbool first_set = true;\n\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\tWrite(file, \"static public int setItem(IntPtr l) {\");\n\t\t\t\tWriteTry(file);\n\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\tif (setter.Count == 1)\n\t\t\t\t{\n\t\t\t\t\tPropertyInfo _set = setter[0];\n\t\t\t\t\tParameterInfo[] infos = _set.GetIndexParameters();\n\t\t\t\t\tWriteValueCheck(file, infos[0].ParameterType, 2);\n\t\t\t\t\tWriteValueCheck(file, _set.PropertyType, 3, \"c\");\n\t\t\t\t\tWrite(file, \"self[v]=c;\");\n\t\t\t\t\tWriteOk(file);\n\t\t\t\t\tWrite(file, \"return 1;\");\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tWrite(file, \"LuaTypes t = LuaDLL.lua_type(l, 2);\");\n\t\t\t\t\tfor (int i = 0; i < setter.Count; i++)\n\t\t\t\t\t{\n\t\t\t\t\t\tPropertyInfo fii = setter[i];\n\t\t\t\t\t\tif (t.BaseType != typeof(MulticastDelegate))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tParameterInfo[] infos = fii.GetIndexParameters();\n\t\t\t\t\t\t\tWrite(file, \"{0}(matchType(l,2,t,typeof({1}))){{\", first_set ? \"if\" : \"else if\", infos[0].ParameterType);\n\t\t\t\t\t\t\tWriteValueCheck(file, infos[0].ParameterType, 2, \"v\");\n\t\t\t\t\t\t\tWriteValueCheck(file, fii.PropertyType, 3, \"c\");\n\t\t\t\t\t\t\tWrite(file, \"self[v]=c;\");\n\t\t\t\t\t\t\tWriteOk(file);\n\t\t\t\t\t\t\tWrite(file, \"return 1;\");\n\t\t\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\t\tfirst_set = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (t.IsValueType)\n\t\t\t\t\t\t\tWrite(file, \"setBack(l,self);\");\n\t\t\t\t\t}\n\t\t\t\t\tWriteNotMatch (file, \"setItem\");\n\t\t\t\t}\n\t\t\t\tWriteCatchExecption(file);\n\t\t\t\tWrite(file, \"}\");\n\t\t\t\tfuncname.Add(\"setItem\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid WriteTry(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"try {\");\n\t\t}\n\t\t\n\t\tvoid WriteCatchExecption(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"}\");\n\t\t\tWrite(file, \"catch(Exception e) {\");\n\t\t\tWrite(file, \"return error(l,e);\");\n\t\t\tWrite(file, \"}\");\n\t\t}\n\t\t\n\t\tvoid WriteCheckType(StreamWriter file, Type t, int n, string v = \"v\", string nprefix = \"\")\n\t\t{\n\t\t\tif (t.IsEnum)\n\t\t\t\tWrite(file, \"checkEnum(l,{2}{0},out {1});\", n, v, nprefix);\n\t\t\telse if (t.BaseType == typeof(System.MulticastDelegate))\n\t\t\t\tWrite(file, \"int op=LuaDelegation.checkDelegate(l,{2}{0},out {1});\", n, v, nprefix);\n\t\t\telse if (IsValueType(t))\n                if (t.IsGenericType && t.GetGenericTypeDefinition() == typeof(Nullable<>))\n                    Write(file, \"checkNullable(l,{2}{0},out {1});\", n, v, nprefix);\n                else\n                    Write(file, \"checkValueType(l,{2}{0},out {1});\", n, v, nprefix);\n\t\t\telse if (t.IsArray)\n\t\t\t\tWrite(file, \"checkArray(l,{2}{0},out {1});\", n, v, nprefix);\n\t\t\telse\n\t\t\t\tWrite(file, \"checkType(l,{2}{0},out {1});\", n, v, nprefix);\n\t\t}\n\t\t\n\t\tvoid WriteValueCheck(StreamWriter file, Type t, int n, string v = \"v\", string nprefix = \"\")\n\t\t{\n\t\t\tWrite(file, \"{0} {1};\", SimpleType(t), v);\n\t\t\tWriteCheckType(file, t, n, v, nprefix);\n\t\t}\n\t\t\n\t\tprivate void WriteFunctionAttr(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\");\n#if UNITY_5_3_OR_NEWER\n\t\t\tWrite (file, \"[UnityEngine.Scripting.Preserve]\");\n#endif\n\t\t}\n\t\t\n\t\tConstructorInfo[] GetValidConstructor(Type t)\n\t\t{\n\t\t\tList<ConstructorInfo> ret = new List<ConstructorInfo>();\n\t\t\tif (t.GetConstructor(Type.EmptyTypes) == null && t.IsAbstract && t.IsSealed)\n\t\t\t\treturn ret.ToArray();\n\t\t\tif (t.IsAbstract)\n\t\t\t\treturn ret.ToArray();\n\t\t\tif (t.BaseType != null && t.BaseType.Name == \"MonoBehaviour\")\n\t\t\t\treturn ret.ToArray();\n\t\t\t\n\t\t\tConstructorInfo[] cons = t.GetConstructors(BindingFlags.Instance | BindingFlags.Public);\n\t\t\tforeach (ConstructorInfo ci in cons)\n\t\t\t{\n\t\t\t\tif (!IsObsolete(ci) && !DontExport(ci) && !ContainUnsafe(ci))\n\t\t\t\t\tret.Add(ci);\n\t\t\t}\n\t\t\treturn ret.ToArray();\n\t\t}\n\t\t\n\t\tbool ContainUnsafe(MethodBase mi)\n\t\t{\n\t\t\tforeach (ParameterInfo p in mi.GetParameters())\n\t\t\t{\n\t\t\t\tif (p.ParameterType.FullName.Contains(\"*\"))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tbool DontExport(MemberInfo mi)\n\t\t{\n\t\t    var methodString = string.Format(\"{0}.{1}\", mi.DeclaringType, mi.Name);\n\t\t    if (CustomExport.FunctionFilterList.Contains(methodString))\n\t\t        return true;\n            // directly ignore any components .ctor\n            if (mi.DeclaringType.IsSubclassOf(typeof(UnityEngine.Component)))\n            {\n                if (mi.MemberType == MemberTypes.Constructor)\n                {\n                    return true;\n                }\n            }\n\n            // Check in custom export function filter list.\n            List<object> aFuncFilterList = LuaCodeGen.GetEditorField<ICustomExportPost>(\"FunctionFilterList\");\n            foreach (object aFilterList in aFuncFilterList)\n            {\n                if (((List<string>)aFilterList).Contains(methodString))\n                {\n                    return true;\n                }\n            }\n\n\t\t\treturn mi.IsDefined(typeof(DoNotToLuaAttribute), false);\n\t\t}\n\t\t\n\t\t\n\t\tprivate void WriteConstructor(Type t, StreamWriter file)\n\t\t{\n\t\t\tConstructorInfo[] cons = GetValidConstructor(t);\n\t\t\tif (cons.Length > 0)\n\t\t\t{\n\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\tWrite(file, \"static public int constructor(IntPtr l) {\");\n\t\t\t\tWriteTry(file);\n\t\t\t\tif (cons.Length > 1)\n\t\t\t\t\tWrite(file, \"int argc = LuaDLL.lua_gettop(l);\");\n\t\t\t\tWrite(file, \"{0} o;\", TypeDecl(t));\n\t\t\t\tbool first = true;\n\t\t\t\tfor (int n = 0; n < cons.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tConstructorInfo ci = cons[n];\n\t\t\t\t\tParameterInfo[] pars = ci.GetParameters();\n\t\t\t\t\t\n\t\t\t\t\tif (cons.Length > 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (isUniqueArgsCount(cons, ci))\n\t\t\t\t\t\t\tWrite(file, \"{0}(argc=={1}){{\", first ? \"if\" : \"else if\", ci.GetParameters().Length + 1);\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tWrite(file, \"{0}(matchType(l,argc,2{1})){{\", first ? \"if\" : \"else if\", TypeDecl(pars));\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor (int k = 0; k < pars.Length; k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tParameterInfo p = pars[k];\n\t\t\t\t\t\tbool hasParams = p.IsDefined(typeof(ParamArrayAttribute), false);\n\t\t\t\t\t\tCheckArgument(file, p.ParameterType, k, 2, p.IsOut, hasParams);\n\t\t\t\t\t}\n\t\t\t\t\tWrite(file, \"o=new {0}({1});\", TypeDecl(t), FuncCall(ci));\n\t\t\t\t\tWriteOk(file);\n\t\t\t\t\tif (t.Name == \"String\") // if export system.string, push string as ud not lua string\n\t\t\t\t\t\tWrite(file, \"pushObject(l,o);\");\n\t\t\t\t\telse\n\t\t\t\t\t\tWrite(file, \"pushValue(l,o);\");\n\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t\tif (cons.Length == 1)\n\t\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\tfirst = false;\n\t\t\t\t}\n\n\t\t\t\tif (cons.Length > 1)\n\t\t\t\t{\n\t\t\t\t\tif(t.IsValueType)\n\t\t\t\t\t{\n\t\t\t\t\t\tWrite(file, \"{0}(argc=={1}){{\", first ? \"if\" : \"else if\", 0);\n\t\t\t\t\t\tWrite(file, \"o=new {0}();\", FullName(t));\n\t\t\t\t\t\tWrite(file, \"pushValue(l,true);\");\n\t\t\t\t\t\tWrite(file, \"pushObject(l,o);\");\n\t\t\t\t\t\tWrite(file, \"return 2;\");\n\t\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t}\n\n\t\t\t\t\tWrite(file, \"return error(l,\\\"New object failed.\\\");\");\n\t\t\t\t\tWriteCatchExecption(file);\n\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (t.IsValueType) // default constructor\n\t\t\t{\n\t\t\t\tWriteFunctionAttr(file);\n\t\t\t\tWrite(file, \"static public int constructor(IntPtr l) {\");\n\t\t\t\tWriteTry(file);\n\t\t\t\tWrite(file, \"{0} o;\", FullName(t));\n\t\t\t\tWrite(file, \"o=new {0}();\", FullName(t));\n\t\t\t\tWriteReturn(file,\"o\");\n\t\t\t\tWriteCatchExecption(file);\n\t\t\t\tWrite(file, \"}\");\n\t\t\t}\n\t\t}\n\n\t\tvoid WriteOk(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"pushValue(l,true);\");\n\t\t}\n\t\tvoid WriteBad(StreamWriter file)\n\t\t{\n\t\t\tWrite(file, \"pushValue(l,false);\");\n\t\t}\n\n\t\tvoid WriteError(StreamWriter file, string err)\n\t\t{\n\t\t\tWriteBad(file);\n\t\t\tWrite(file, \"LuaDLL.lua_pushstring(l,\\\"{0}\\\");\",err);\n\t\t\tWrite(file, \"return 2;\");\n\t\t}\n\n\t\tvoid WriteReturn(StreamWriter file, string val)\n\t\t{\n\t\t\tWrite(file, \"pushValue(l,true);\");\n\t\t\tWrite(file, \"pushValue(l,{0});\",val);\n\t\t\tWrite(file, \"return 2;\");\n\t\t}\n\t\t\n\t\tbool IsNotSupport(Type t)\n\t\t{\n\t\t\tif (t.IsSubclassOf(typeof(Delegate)))\n\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tstring[] prefix = new string[] { \"System.Collections.Generic\" };\n\t\tstring RemoveRef(string s, bool removearray = true)\n\t\t{\n\t\t\tif (s.EndsWith(\"&\")) s = s.Substring(0, s.Length - 1);\n\t\t\tif (s.EndsWith(\"[]\") && removearray) s = s.Substring(0, s.Length - 2);\n\t\t\tif (s.StartsWith(prefix[0])) s = s.Substring(prefix[0].Length + 1, s.Length - prefix[0].Length - 1);\n\t\t\t\n\t\t\ts = s.Replace(\"+\", \".\");\n\t\t\tif (s.Contains(\"`\"))\n\t\t\t{\n\t\t\t\tstring regstr = @\"`\\d\";\n\t\t\t\tRegex r = new Regex(regstr, RegexOptions.None);\n\t\t\t\ts = r.Replace(s, \"\");\n\t\t\t\ts = s.Replace(\"[\", \"<\");\n\t\t\t\ts = s.Replace(\"]\", \">\");\n\t\t\t}\n\t\t\treturn s;\n\t\t}\n\t\t\n\t\tstring GenericBaseName(Type t)\n\t\t{\n\t\t\tstring n = t.FullName;\n\t\t\tif (n.IndexOf('[') > 0)\n\t\t\t{\n\t\t\t\tn = n.Substring(0, n.IndexOf('['));\n\t\t\t}\n\t\t\treturn n.Replace(\"+\", \".\");\n\t\t}\n\t\tstring GenericName(Type t,string sep=\"_\")\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType[] tt = t.GetGenericArguments();\n\t\t\t\tstring ret = \"\";\n\t\t\t\tfor (int n = 0; n < tt.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tstring dt = SimpleType(tt[n]);\n\t\t\t\t\tret += dt;\n\t\t\t\t\tif (n < tt.Length - 1)\n\t\t\t\t\t\tret += sep;\n\t\t\t\t}\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tDebug.Log(e.ToString());\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t}\n\t\t\n\t\tstring _Name(string n)\n\t\t{\n\t\t\tstring ret = \"\";\n\t\t\tfor (int i = 0; i < n.Length; i++)\n\t\t\t{\n\t\t\t\tif (char.IsLetterOrDigit(n[i]))\n\t\t\t\t\tret += n[i];\n\t\t\t\telse\n\t\t\t\t\tret += \"_\";\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\t\t\n\t\tstring TypeDecl(ParameterInfo[] pars,int paraOffset = 0)\n\t\t{\n\t\t\tstring ret = \"\";\n\t\t\tfor (int n = paraOffset; n < pars.Length; n++)\n\t\t\t{\n\t\t\t\tret += \",typeof(\";\n                if (pars[n].IsOut)\n                    ret += \"LuaOut\";\n                else\n\t\t\t\t    ret += SimpleType(pars[n].ParameterType);\n\t\t\t\tret += \")\";\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\t// fill Generic Parameters if needed\n\t\tstring MethodDecl(MethodInfo m)\n\t\t{\n\t\t\tif (m.IsGenericMethod)\n\t\t\t{\n\t\t\t\tstring parameters = \"\";\n\t\t\t\tbool first = true;\n\t\t\t\tforeach (Type genericType in m.GetGenericArguments())\n\t\t\t\t{\n\t\t\t\t\tif (first)\n\t\t\t\t\t\tfirst = false;\n\t\t\t\t\telse\n\t\t\t\t\t\tparameters += \",\";\n\t\t\t\t\tparameters += genericType.ToString();\n\n\t\t\t\t}\n\t\t\t\treturn string.Format(\"{0}<{1}>\", m.Name, parameters);\n\t\t\t}\n\t\t\telse\n\t\t\t\treturn m.Name;\n\t\t}\n\n\t\t// try filling generic parameters\n\t\tstatic MethodInfo tryFixGenericMethod(MethodInfo method)\n\t\t{\n\t\t\tif (!method.ContainsGenericParameters)\n\t\t\t\treturn method;\n\n\t\t\ttry\n\t\t\t{\n\t\t\t\tType[] genericTypes = method.GetGenericArguments();\n\t\t\t\tfor (int j = 0; j < genericTypes.Length; j++)\n\t\t\t\t{\n\t\t\t\t\tType[] contraints = genericTypes[j].GetGenericParameterConstraints();\n\t\t\t\t\tif (contraints != null && contraints.Length == 1 && contraints[0] != typeof(ValueType))\n\t\t\t\t\t\tgenericTypes[j] = contraints[0];\n\t\t\t\t\telse\n\t\t\t\t\t\treturn method;\n\t\t\t\t}\n\t\t\t\t// only fixed here\n\t\t\t\treturn method.MakeGenericMethod(genericTypes);\n\t\t\t}\n\t\t\tcatch (Exception e)\n\t\t\t{\n\t\t\t\tDebug.LogError(e);\n\t\t\t}\n\t\t\treturn method;\n\t\t}\n\n\t\tbool isUsefullMethod(MethodInfo method)\n\t\t{\n\t\t\tif (method.Name != \"GetType\" && method.Name != \"GetHashCode\" && method.Name != \"Equals\" &&\n\t\t\t    method.Name != \"ToString\" && method.Name != \"Clone\" &&\n\t\t\t    method.Name != \"GetEnumerator\" && method.Name != \"CopyTo\" &&\n\t\t\t    method.Name != \"op_Implicit\" && method.Name != \"op_Explicit\" &&\n\t\t\t    !method.Name.StartsWith(\"get_\", StringComparison.Ordinal) &&\n\t\t\t    !method.Name.StartsWith(\"set_\", StringComparison.Ordinal) &&\n\t\t\t    !method.Name.StartsWith(\"add_\", StringComparison.Ordinal) &&\n\t\t\t    !IsObsolete(method) && !method.ContainsGenericParameters  &&\n\t\t\t\tmethod.ToString() != \"Int32 Clamp(Int32, Int32, Int32)\" &&\n\t\t\t    !method.Name.StartsWith(\"remove_\", StringComparison.Ordinal))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tvoid WriteFunctionDec(StreamWriter file, string name)\n\t\t{\n\t\t\tWriteFunctionAttr(file);\n\t\t\tWrite(file, \"static public int {0}(IntPtr l) {{\", name);\n\t\t\t\n\t\t}\n\t\t\n\t\tMethodBase[] GetMethods(Type t, string name, BindingFlags bf)\n\t\t{\n\n\t\t\tList<MethodBase> methods = new List<MethodBase>();\n\n\t\t\tif(this.includeExtension && ((bf&BindingFlags.Instance) == BindingFlags.Instance)){\n\t\t\t\tif(extensionMethods.ContainsKey(t)){\n\t\t\t\t\tforeach(MethodInfo m in extensionMethods[t]){\n\t\t\t\t\t\tif(m.Name == name \n\t\t\t\t\t\t   && !IsObsolete(m)\n\t\t\t\t\t\t   && !DontExport(m)\n\t\t\t\t\t\t   && isUsefullMethod(m)){\n\t\t\t\t\t\t\tmethods.Add(m);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tMemberInfo[] cons = t.GetMember(name, bf);\n\t\t\tforeach (MemberInfo _m in cons)\n\t\t\t{\n\t\t\t\tMemberInfo m = _m;\n\t\t\t\tif (m.MemberType == MemberTypes.Method) m = tryFixGenericMethod((MethodInfo)m);\n\t\t\t\tif (m.MemberType == MemberTypes.Method\n\t\t\t\t    && !IsObsolete(m)\n\t\t\t\t    && !DontExport(m)\n\t\t\t\t    && isUsefullMethod((MethodInfo)m))\n\t\t\t\t\tmethods.Add((MethodBase)m);\n\t\t\t}\n            methods.Sort((a, b) =>\n           {\n               return a.GetParameters().Length - b.GetParameters().Length;\n           });\n\t\t\treturn methods.ToArray();\n\n\t\t}\n\n\t\tvoid WriteNotMatch(StreamWriter file,string fn) {\n\t\t\tWriteError(file, string.Format(\"No matched override function {0} to call\",fn));\n\t\t}\n\t\t\n\t\tvoid WriteFunctionImpl(StreamWriter file, MethodInfo m, Type t, BindingFlags bf)\n\t\t{\n\t\t\tWriteTry(file);\n\t\t\tMethodBase[] cons = GetMethods(t, m.Name, bf);\n\n\t\t\tDictionary<string,MethodInfo> overridedMethods = null;\n\n\t\t\tif (cons.Length == 1) // no override function\n\t\t\t{\n\t\t\t\tif (isUsefullMethod(m) && !m.ReturnType.ContainsGenericParameters && !m.ContainsGenericParameters) // don't support generic method\n\t\t\t\t\tWriteFunctionCall(m, file, t,bf);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tWriteNotMatch (file, m.Name);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse // 2 or more override function\n\t\t\t{\n\n\t\t\t\tWrite(file, \"int argc = LuaDLL.lua_gettop(l);\");\n\t\t\t\t\n\t\t\t\tbool first = true;\n\t\t\t\tfor (int n = 0; n < cons.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tif (cons[n].MemberType == MemberTypes.Method)\n\t\t\t\t\t{\n\t\t\t\t\t\tMethodInfo mi = cons[n] as MethodInfo;\n\n\t\t\t\t\t\tif (mi.IsDefined (typeof(LuaOverrideAttribute), false)) {\n\t\t\t\t\t\t\tif (overridedMethods == null)\n\t\t\t\t\t\t\t\toverridedMethods = new Dictionary<string,MethodInfo> ();\n\n\t\t\t\t\t\t\tLuaOverrideAttribute attr = mi.GetCustomAttributes (typeof(LuaOverrideAttribute), false)[0] as LuaOverrideAttribute;\n\t\t\t\t\t\t\tstring fn = attr.fn;\n\t\t\t\t\t\t\tif(overridedMethods.ContainsKey(fn))\n\t\t\t\t\t\t\t\tthrow new Exception(string.Format(\"Found function with same name {0}\",fn));\t\n\t\t\t\t\t\t\toverridedMethods.Add (fn,mi);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tParameterInfo[] pars = mi.GetParameters();\n\t\t\t\t\t\tif (isUsefullMethod(mi)\n\t\t\t\t\t\t    && !mi.ReturnType.ContainsGenericParameters\n\t\t\t\t\t\t    /*&& !ContainGeneric(pars)*/) // don't support generic method\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tbool isExtension = IsExtensionMethod(mi) && (bf & BindingFlags.Instance) == BindingFlags.Instance;\n\t\t\t\t\t\t\tif (isUniqueArgsCount(cons, mi))\n\t\t\t\t\t\t\t\tWrite(file, \"{0}(argc=={1}){{\", first ? \"if\" : \"else if\", mi.IsStatic ? mi.GetParameters().Length : mi.GetParameters().Length + 1);\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\tWrite(file, \"{0}(matchType(l,argc,{1}{2})){{\", first ? \"if\" : \"else if\", mi.IsStatic&&!isExtension ? 1 : 2, TypeDecl(pars,isExtension?1:0));\n\t\t\t\t\t\t\tWriteFunctionCall(mi, file, t,bf);\n\t\t\t\t\t\t\tWrite(file, \"}\");\n\t\t\t\t\t\t\tfirst = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tWriteNotMatch (file, m.Name);\n\t\t\t}\n\t\t\tWriteCatchExecption(file);\n\t\t\tWrite(file, \"}\");\n\n\t\t\tWriteOverridedMethod (file,overridedMethods,t,bf);\n\t\t}\n\n\t\tvoid WriteOverridedMethod(StreamWriter file,Dictionary<string,MethodInfo> methods,Type t,BindingFlags bf) {\n\t\t\tif (methods == null)\n\t\t\t\treturn;\n\n\t\t\tforeach (var pair in methods) {\n\t\t\t\tstring fn = pair.Value.IsStatic ? staticName (pair.Key) : pair.Key;\n\t\t\t\tWriteSimpleFunction (file,fn,pair.Value,t,bf);\n\t\t\t\tfuncname.Add(fn);\n\t\t\t}\n\n\t\t}\n\n\t\tvoid WriteSimpleFunction(StreamWriter file,string fn,MethodInfo mi,Type t,BindingFlags bf) {\n\t\t\tWriteFunctionDec(file, fn);\n\t\t\tWriteTry(file);\n\t\t\tWriteFunctionCall (mi, file, t, bf);\n\t\t\tWriteCatchExecption(file);\n\t\t\tWrite(file, \"}\");\n\t\t}\n\n        int GetMethodArgc(MethodBase mi)\n        {\n            bool isExtension = IsExtensionMethod(mi);\n            if (isExtension)\n                return mi.GetParameters().Length - 1;\n            return mi.GetParameters().Length;\n        }\n\n        bool isUniqueArgsCount(MethodBase[] cons, MethodBase mi)\n        {\n            int argcLength = GetMethodArgc(mi);\n            foreach (MethodBase member in cons)\n            {\n                MethodBase m = (MethodBase)member;\n                if (m == mi)\n                    continue;\n                if (argcLength == GetMethodArgc(m))\n                    return false;\n            }\n            return true;\n        }\n\n        void WriteCheckSelf(StreamWriter file, Type t)\n\t\t{\n\t\t\tif (t.IsValueType)\n\t\t\t{\n\t\t\t\tWrite(file, \"{0} self;\", TypeDecl(t));\n\t\t\t\tif(IsBaseType(t))\n\t\t\t\t\tWrite(file, \"checkType(l,1,out self);\");\n\t\t\t\telse\n\t\t\t\t\tWrite(file, \"checkValueType(l,1,out self);\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tWrite(file, \"{0} self=({0})checkSelf(l);\", TypeDecl(t));\n\t\t}\n\n\n\t\tprivate void WriteFunctionCall(MethodInfo m, StreamWriter file, Type t,BindingFlags bf)\n\t\t{\n\n\t\t\tbool isExtension = IsExtensionMethod(m) && (bf&BindingFlags.Instance) == BindingFlags.Instance;\n\t\t\tbool hasref = false;\n\t\t\tParameterInfo[] pars = m.GetParameters();\n\n\n\t\t\tint argIndex = 1;\n\t\t\tint parOffset = 0;\n\t\t\tif (!m.IsStatic )\n\t\t\t{\n\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\targIndex++;\n\t\t\t}\n\t\t\telse if(isExtension){\n\t\t\t\tWriteCheckSelf(file, t);\n\t\t\t\tparOffset ++;\n\t\t\t}\n\t\t\tfor (int n = parOffset; n < pars.Length; n++)\n\t\t\t{\n\t\t\t\tParameterInfo p = pars[n];\n\t\t\t\tstring pn = p.ParameterType.Name;\n\t\t\t\tif (pn.EndsWith(\"&\"))\n\t\t\t\t{\n\t\t\t\t\thasref = true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tbool hasParams = p.IsDefined(typeof(ParamArrayAttribute), false);\n\t\t\t\tCheckArgument(file, p.ParameterType, n, argIndex, p.IsOut, hasParams);\n\t\t\t}\n\t\t\t\n\t\t\tstring ret = \"\";\n\t\t\tif (m.ReturnType != typeof(void))\n\t\t\t{\n\t\t\t\tret = \"var ret=\";\n\t\t\t}\n\t\t\t\n\t\t\tif (m.IsStatic && !isExtension)\n\t\t\t{\n\t\t\t\tif (m.Name == \"op_Multiply\")\n\t\t\t\t\tWrite(file, \"{0}a1*a2;\", ret);\n\t\t\t\telse if (m.Name == \"op_Subtraction\")\n\t\t\t\t\tWrite(file, \"{0}a1-a2;\", ret);\n\t\t\t\telse if (m.Name == \"op_Addition\")\n\t\t\t\t\tWrite(file, \"{0}a1+a2;\", ret);\n\t\t\t\telse if (m.Name == \"op_Division\")\n\t\t\t\t\tWrite(file, \"{0}a1/a2;\", ret);\n\t\t\t\telse if (m.Name == \"op_UnaryNegation\")\n\t\t\t\t\tWrite(file, \"{0}-a1;\", ret);\n\t\t\t\telse if (m.Name == \"op_UnaryPlus\")\n\t\t\t\t\tWrite(file, \"{0}+a1;\", ret);\n\t\t\t\telse if (m.Name == \"op_Equality\")\n\t\t\t\t\tWrite(file, \"{0}(a1==a2);\", ret);\n\t\t\t\telse if (m.Name == \"op_Inequality\")\n\t\t\t\t\tWrite(file, \"{0}(a1!=a2);\", ret);\n\t\t\t\telse if (m.Name == \"op_LessThan\")\n\t\t\t\t\tWrite(file, \"{0}(a1<a2);\", ret);\n\t\t\t\telse if (m.Name == \"op_GreaterThan\")\n\t\t\t\t\tWrite(file, \"{0}(a2<a1);\", ret);\n\t\t\t\telse if (m.Name == \"op_LessThanOrEqual\")\n\t\t\t\t\tWrite(file, \"{0}(a1<=a2);\", ret);\n\t\t\t\telse if (m.Name == \"op_GreaterThanOrEqual\")\n\t\t\t\t\tWrite(file, \"{0}(a2<=a1);\", ret);\n\t\t\t\telse{\n\t\t\t\t\tWrite(file, \"{3}{2}.{0}({1});\", MethodDecl(m), FuncCall(m), TypeDecl(t), ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tWrite(file, \"{2}self.{0}({1});\", MethodDecl(m), FuncCall(m,parOffset), ret);\n\t\t\t}\n\n\t\t\tWriteOk(file);\n\t\t\tint retcount = 1;\n\t\t\tif (m.ReturnType != typeof(void))\n\t\t\t{\n\t\t\t\t\n\t\t\t\tWritePushValue(m.ReturnType, file);\n\t\t\t\tretcount = 2;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t// push out/ref value for return value\n\t\t\tif (hasref)\n\t\t\t{\n\t\t\t\tfor (int n = 0; n < pars.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tParameterInfo p = pars[n];\n\t\t\t\t\t\n\t\t\t\t\tif (p.ParameterType.IsByRef)\n\t\t\t\t\t{\n\t\t\t\t\t\tWritePushValue(p.ParameterType, file, string.Format(\"a{0}\", n + 1));\n\t\t\t\t\t\tretcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (t.IsValueType && m.ReturnType == typeof(void) && !m.IsStatic)\n\t\t\t\tWrite(file, \"setBack(l,self);\");\n\t\t\t\n\t\t\tWrite(file, \"return {0};\", retcount);\n\t\t}\n\n\t\tstring SimpleType(Type t)\n\t\t{\n\t\t\t\n\t\t\tstring tn = t.Name;\n\t\t\tswitch (tn)\n\t\t\t{\n\t\t\tcase \"Single\":\n\t\t\t\treturn \"float\";\n\t\t\tcase \"String\":\n\t\t\t\treturn \"string\";\n\t\t\tcase \"Double\":\n\t\t\t\treturn \"double\";\n\t\t\tcase \"Boolean\":\n\t\t\t\treturn \"bool\";\n\t\t\tcase \"Int32\":\n\t\t\t\treturn \"int\";\n\t\t\tcase \"Object\":\n\t\t\t\treturn FullName(t);\n\t\t\tdefault:\n\t\t\t\ttn = TypeDecl(t);\n\t\t\t\ttn = tn.Replace(\"System.Collections.Generic.\", \"\");\n\t\t\t\ttn = tn.Replace(\"System.Object\", \"object\");\n\t\t\t\treturn tn;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid WritePushValue(Type t, StreamWriter file)\n\t\t{\n\t\t\tif (t.IsEnum)\n\t\t\t\tWrite(file, \"pushEnum(l,(int)ret);\");\n\t\t\telse\n\t\t\t\tWrite(file, \"pushValue(l,ret);\");\n\t\t}\n\t\t\n\t\tvoid WritePushValue(Type t, StreamWriter file, string ret)\n\t\t{\n\t\t\tif (t.IsEnum)\n\t\t\t\tWrite(file, \"pushEnum(l,(int){0});\", ret);\n\t\t\telse\n\t\t\t\tWrite(file, \"pushValue(l,{0});\", ret);\n\t\t}\n\t\t\n\t\t\n\t\tvoid Write(StreamWriter file, string fmt, params object[] args)\n\t\t{\n\n\t\t\tfmt = System.Text.RegularExpressions.Regex.Replace(fmt, @\"\\r\\n?|\\n|\\r\", NewLine);\n\n\t\t\tif (fmt.StartsWith(\"}\")) indent--;\n\t\t\t\n\t\t\tfor (int n = 0; n < indent; n++)\n\t\t\t\tfile.Write(\"\\t\");\n\t\t\t\n\t\t\t\n\t\t\tif (args.Length == 0)\n\t\t\t\tfile.WriteLine(fmt);\n\t\t\telse\n\t\t\t{\n\t\t\t\tstring line = string.Format(fmt, args);\n\t\t\t\tfile.WriteLine(line);\n\t\t\t}\n\t\t\t\n\t\t\tif (fmt.EndsWith(\"{\")) indent++;\n\t\t}\n\t\t\n\t\tprivate void CheckArgument(StreamWriter file, Type t, int n, int argstart, bool isout, bool isparams)\n\t\t{\n\t\t\tWrite(file, \"{0} a{1};\", TypeDecl(t), n + 1);\n\t\t\t\n\t\t\tif (!isout)\n\t\t\t{\n\t\t\t\tif (t.IsEnum)\n\t\t\t\t\tWrite(file, \"checkEnum(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\telse if (t.BaseType == typeof(System.MulticastDelegate))\n\t\t\t\t{\n\t\t\t\t\ttryMake(t);\n\t\t\t\t\tWrite(file, \"LuaDelegation.checkDelegate(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\t}\n\t\t\t\telse if (isparams)\n\t\t\t\t{\n\t\t\t\t\tif(t.GetElementType().IsValueType && !IsBaseType(t.GetElementType()))\n\t\t\t\t\t\tWrite(file, \"checkValueParams(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\t\telse\n\t\t\t\t\t\tWrite(file, \"checkParams(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\t}\n\t\t\t\telse if(t.IsArray)\n\t\t\t\t\tWrite(file, \"checkArray(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\telse if (IsValueType(t)) {\n\t\t\t\t\tif (t.IsGenericType && t.GetGenericTypeDefinition() == typeof(Nullable<>))\n\t\t\t\t\t\tWrite(file, \"checkNullable(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\t\telse\n\t\t\t\t\t\tWrite(file, \"checkValueType(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tWrite(file, \"checkType(l,{0},out a{1});\", n + argstart, n + 1);\n\t\t\t}\n\t\t}\n\n\t\tbool IsValueType(Type t)\n\t\t{\n\t\t\treturn t.BaseType == typeof(ValueType) && !IsBaseType(t);\n\t\t}\n\n\t\tbool IsBaseType(Type t)\n\t\t{\n\t\t\tif (t.IsByRef) {\n\t\t\t\tt = t.GetElementType();\n\t\t\t}\n\t\t\treturn t.IsPrimitive || LuaObject.isImplByLua(t);\n\t\t}\n\t\t\n\t\tstring FullName(string str)\n\t\t{\n\t\t\tif (str == null)\n\t\t\t{\n\t\t\t\tthrow new NullReferenceException();\n\t\t\t}\n\t\t\treturn RemoveRef(str.Replace(\"+\", \".\"));\n\t\t}\n\t\t\n\t\tstring TypeDecl(Type t)\n\t\t{\n\t\t\tif (t.IsGenericType)\n\t\t\t{\n\t\t\t\tstring ret = GenericBaseName(t);\n\t\t\t\t\n\t\t\t\tstring gs = \"\";\n\t\t\t\tgs += \"<\";\n\t\t\t\tType[] types = t.GetGenericArguments();\n\t\t\t\tfor (int n = 0; n < types.Length; n++)\n\t\t\t\t{\n\t\t\t\t\tgs += TypeDecl(types[n]);\n\t\t\t\t\tif (n < types.Length - 1)\n\t\t\t\t\t\tgs += \",\";\n\t\t\t\t}\n\t\t\t\tgs += \">\";\n\t\t\t\t\n\t\t\t\tret = Regex.Replace(ret, @\"`\\d\", gs);\n\t\t\t\t\n\t\t\t\treturn ret;\n\t\t\t}\n\t\t\tif (t.IsArray)\n\t\t\t{\n\t\t\t\treturn TypeDecl(t.GetElementType()) + \"[]\";\n\t\t\t}\n\t\t\telse\n\t\t\t\treturn RemoveRef(t.ToString(), false);\n\t\t}\n\t\t\n\t\tstring ExportName(Type t)\n\t\t{\n\t\t\tif (t.IsGenericType)\n\t\t\t{\n\t\t\t\treturn string.Format(\"Lua_{0}_{1}\", _Name(GenericBaseName(t)), _Name(GenericName(t)));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tstring name = RemoveRef(t.FullName, true);\n\t\t\t\tname = \"Lua_\" + name;\n\t\t\t\treturn name.Replace(\".\", \"_\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tstring FullName(Type t)\n\t\t{\n\t\t\tif (t.FullName == null)\n\t\t\t{\n\t\t\t\tDebug.Log(t.Name);\n\t\t\t\treturn t.Name;\n\t\t\t}\n\t\t\treturn FullName(t.FullName);\n\t\t}\n\t\t\n\t\tstring FuncCall(MethodBase m,int parOffset = 0)\n\t\t{\n\t\t\t\n\t\t\tstring str = \"\";\n\t\t\tParameterInfo[] pars = m.GetParameters();\n\t\t\tfor (int n = parOffset; n < pars.Length; n++)\n\t\t\t{\n\t\t\t\tParameterInfo p = pars[n];\n\t\t\t\tif (p.ParameterType.IsByRef && p.IsOut)\n\t\t\t\t\tstr += string.Format(\"out a{0}\", n + 1);\n\t\t\t\telse if (p.ParameterType.IsByRef)\n\t\t\t\t\tstr += string.Format(\"ref a{0}\", n + 1);\n\t\t\t\telse\n\t\t\t\t\tstr += string.Format(\"a{0}\", n + 1);\n\t\t\t\tif (n < pars.Length - 1)\n\t\t\t\t\tstr += \",\";\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\t\t\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/Editor/LuaCodeGen.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 9203a8b4886c536408b8955d598d785a\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Editor.meta",
    "content": "fileFormatVersion: 2\nguid: 01275b95f897d4e4d92974844c7df478\nfolderAsset: yes\ntimeCreated: 1448110222\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/LuaObject.meta",
    "content": "fileFormatVersion: 2\nguid: 9e7c653cf4ca77b4bab3123764423a51\nfolderAsset: yes\ntimeCreated: 1500378407\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Resources/Particle System.prefab.meta",
    "content": "fileFormatVersion: 2\nguid: 46519b464b3064b4daf5e43a24257a75\nNativeFormatImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/circle/circle.txt",
    "content": "\nimport \"UnityEngine\"\n\nif not UnityEngine.GameObject or not  UnityEngine.UI then\n\terror(\"Click Make/All to generate lua wrap file\")\nend\n\nlocal pi=math.pi\nlocal class={}\n\nfunction main()\n\tlocal slider = GameObject.Find(\"Canvas/Slider\"):GetComponent(UI.Slider)\n\tlocal counttxt = GameObject.Find(\"Canvas/Count\"):GetComponent(UI.Text)\n\tslider.onValueChanged:AddListener(\n\t\tfunction(v)\n\t\t\tclass:init(v)\n\t\t\tcounttxt.text=string.format(\"cube:%d\",v)\n\t\tend\n\t)\n\t\n\tclass.root = GameObject(\"root\")\n\tclass.ftext = GameObject.Find(\"Canvas/Text\"):GetComponent(UI.Text)\n\tclass.r=10\n\tclass.cubes={}\n\tclass.t=0\n\tclass.f=0\n\tclass.framet=0\n\tclass.max=0\n\t\n\tclass:init()\n\treturn class\nend\n\nfunction class:init(count)\n\n\tfor _,v in ipairs(self.cubes) do\n\t\tGameObject.Destroy(v[1])\n\tend\n\n\tself.cubes={}\n\tself.max=count or 400\n\t\n\tlocal P = Resources.Load(\"Particle System\")\n\t\n\tself.colors={Color.red,Color.blue,Color.green,Color.cyan,Color.grey,Color.white,Color.yellow,Color.magenta,Color.black}\n\n\tfor i=0,self.max do\n\t\tlocal cube = GameObject.CreatePrimitive(PrimitiveType.Cube)\n\t\tcube.transform.position = Vector3(math.cos(i/self.max*pi*2)*self.r,math.sin( i/self.max*pi*2)*self.r,0)\n\t\tcube.transform:SetParent(self.root.transform)\n\t\tlocal mat=cube:GetComponent(Renderer).material\n\n\t\tlocal box=cube:GetComponent(BoxCollider)\n\t\tGameObject.Destroy(box)\n\t\t\n\t\tlocal p = GameObject.Instantiate(P,Vector3.zero,Quaternion.identity)\n\t\tp.transform:SetParent( cube.transform )\n\n\t\tmat.color=self.colors[math.random(#self.colors)]\n\t\ttable.insert(self.cubes,{cube,mat})\n\tend\nend\n\nfunction class:update() -- gc alloc is zero\n\t\n\tfor i,v in ipairs(self.cubes) do\n\t\tlocal offset = i%2==1 and 5 or -5\n\t\tlocal r = self.r+math.sin(Time.time)*offset\n\t\tlocal angle= i%2==1 and Time.time or -Time.time\n\t\tlocal base=Vector3(math.cos(i/self.max*pi*2+angle)*r,\n\t\t\tmath.sin(i/self.max*pi*2+angle)*r,0)\n\n\t\tv[1].transform.position = base\n\t\t--v[2].color=self.colors[math.random(#self.colors)]\n\tend\n\n\tif not self.fogStart or self.t>1 then\n\t\tself.fogStart=Time.time\n\t\tself.bgCurrent = Camera.main.backgroundColor\n\t\tself.bgColor=self.colors[math.random(#self.colors)]\n\tend\n\n\tself.t=(Time.time-self.fogStart)/10\n\tCamera.main.backgroundColor = Color.Lerp(self.bgCurrent,self.bgColor,self.t)\n\n\t--calc fps\n\tself.f=self.f+1\n\tself.framet=self.framet+Time.deltaTime\n\tif self.framet>=1 then\n\t\tself.ftext.text=string.format(\"fps:%d\",self.f)\n\t\tself.f=0\n\t\tself.framet=self.framet-1\n\tend\nend"
  },
  {
    "path": "Assets/Slua/Resources/circle/circle.txt.meta",
    "content": "fileFormatVersion: 2\nguid: 00d8d5f1dace2d5418fd3ecad436351c\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/circle.meta",
    "content": "fileFormatVersion: 2\nguid: 2288b4c7a3df820499ff61198e58f084\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/custom.txt",
    "content": "\nMonoBehaviour = UnityEngine.MonoBehaviour\nGameObject = UnityEngine.MonoBehaviour\n\nfunction main()\n\n\n\tlocal s,c=Custom.staticCustom();\n\tprint(s,c)\n\n\tlocal a,b,x=c:instanceCustom()\n\tprint(a,b,x)\n\n\t-- Type parameter can be pass in as string/type table\n\tprint(c:getTypeName(\"UnityEngine.MonoBehaviour,UnityEngine\"))\n\tprint(c:getTypeName(MonoBehaviour))\n\tprint(c:getTypeName(Custom))\n\tprint(c:getTypeName(c:GetType()))\n\n\t-- Test getItem setItem\n\tprint(\"---<\"..c:getItem(\"test\"))\n\tc:setItem(\"test\",10)\n\tprint(\"-->\"..c:getItem(\"test\"))\n\tc:setItem(\"test\",100)\n\tprint(\"-->\"..c:getItem(\"test\"))\nend"
  },
  {
    "path": "Assets/Slua/Resources/custom.txt.meta",
    "content": "fileFormatVersion: 2\nguid: ea76646ddfca4404a8693c9159647d22\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/delegate.txt",
    "content": "\n\n\nfunction xx()\n\tprint(2,path,flag)\n\t--multi return for out flag parameter\n\treturn true,\"http://www.sineysoft.com\",1,32,11\nend\n\n\nself={}\n\nfunction self.func()\n\tprint(\"callback from func\")\n\treturn 520\nend\n\nfunction self.action(a,b)\n\tprint(\"callback from action\")\n\tprint(a,b)\nend\n\nfunction self.actionD()\n\treturn function(a,b)\n\t\tprint(\"callback from actionD\")\n\t\t-- here you can access self\n\t\tprint(self,a,b)\n\tend\nend\n\n\nfunction main()\n\t\n\tDeleg.d=function(path)\n\t\tprint(1,path)\n\t\t--multi return for out flag parameter\n\t\treturn true,\"http://www.sineysoft.com\",1\n\tend\n\n\t-- add handler\n\tDeleg.d={\"+=\",xx}\n\n\tDeleg.s=function(path,go)\n\t\tprint(path,go.name)\n\tend\n\n\t-- call delegation\n\tDeleg.callD()\n\n\t-- remove handler\n\tDeleg.d={\"-=\",xx}\n\n\tDeleg.callD()\n\n\t-- remove all\n\tDeleg.d=nil\n\tDeleg.s=nil\n\n\t-- call delegation again\n\tDeleg.callD()\t\n\n\n\tDeleg.testFunc( self.func )\n\tDeleg.testAction( self.action )\n\n\t-- add\n\tDeleg.daction = {\"+=\",self.actionD()}\n\tDeleg.callDAction()\n\n\tprint(\"delegate removed\")\n\t\n\t-- remove\n\tDeleg.daction = {\"-=\",self.actionD()}\n\tDeleg.callDAction()\n\n\t-- out modifier\n\n\tlocal f = Deleg.getFunc(function(i,s)\n\t\tprint(i,s)\n\t\treturn true\n\tend)\n\n\t-- passed as parameter again\n\tlocal f2= Deleg.getFunc(f)\n\n\tassert(f==f2)\n\n\n\t-- test more than 1 deletegates\n\tDeleg.setcallback2(function(a)\n\t\tassert(a==1)\n\t\tprint(a)\n\tend,\n\tfunction(b)\n\t\tassert(b==\"hello\")\n\t\tprint(b)\n\tend\n\t)\n\n\tDeleg.setcallback2(function(a)\n\t\tassert(a==1)\n\t\tprint(a)\n\tend,nil)\n\n\tDeleg.setcallback2(nil,function(b)\n\t\tassert(b==\"hello\")\n\t\tprint(b)\n\tend)\nend\n\n\n"
  },
  {
    "path": "Assets/Slua/Resources/delegate.txt.meta",
    "content": "fileFormatVersion: 2\nguid: 92b8fcc6e21a446bbbb4dfc3a36c3a75\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/lua3rdmeta.asset.meta",
    "content": "fileFormatVersion: 2\nguid: ef20d18b575309b43a93bb708e071807\ntimeCreated: 1486654200\nlicenseType: Pro\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Resources/main.txt",
    "content": "local somemodule = require 'module.some'\nimport \"UnityEngine\"\nif not UnityEngine.GameObject then\n\terror(\"Click Make/All to generate lua wrap file\")\nend\n\n\nMyGameObject=Slua.Class(GameObject,\n\tnil,\n\t{\n\t\tAddComponent=function(self,t)\n\t\t\tprint \"overloaded AddComponent\"\n\t\t\tself.__base:AddComponent(t)\n\t\tend,\n\t}\t\n)\n\nfunction testArray()\n\tlocal x=GameObject(\"TestArray\")\n\tlocal c=x:AddComponent(UnityEngine.RectTransform)\n\tlocal a=Slua.MakeArray(\"UnityEngine.Vector3\",{Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,0),Vector3(1,0,0)})\n\tc:GetLocalCorners(a)\n\tfor v in Slua.iter(a) do\n\t\tprint(v)\n\tend\n\t\n\tlocal a=Slua.MakeArray(\"System.Int16\",{1,2,3,4})\n\tfor v in Slua.iter(a) do\n\t\tprint(v)\n\tend\n\t\n\tHelloWorld.int16Array(a)\n\tHelloWorld.int16Array({1,2,3,4})\nend\n\nfunction testNullable()\n\tHelloWorld.nullf(1)\n\tHelloWorld.nullf()\nend\n\nlocal function click(...)\n\tprint(\"fuck\")\nend\n\nfunction main()\n\t-- Cache unpack function.\n\tlocal unpack = (unpack and unpack) or table.unpack\n\n\t-- test split of System.String\n\tlocal x=String(\"a,b,c,d/e/f/g\")\n\tprint(unpack(x:Split(\",/\",0).Table))\n\tprint(unpack(x:Split({\",\",\"/\"},0).Table))\n\t\n\ttestArray()\n\ttestNullable()\n\t\n\n\tlocal t=dofile('module/some')\n\tassert(type(t)=='table')\n\tassert(t.add(1,2)==3)\n\n\tlocal fu=loadfile('module/some')\n\tassert(type(fu)=='function')\n\n\tif jit then\n\t\tprint(\"using luajit \",jit.version,jit.arch)\n\t\tlocal ffi=require 'ffi'\n\t\tprint(ffi)\n\telse\n\t\tprint(\"using lua\")\n\tend\n\n\t-- test override function\n\tHelloWorld.AFuncByDouble(1);\n\n\t-- test custom component\n\tlocal x=UnityEngine.GameObject(\"OoOo\")\n\tx:AddComponent(SLuaTest)\n\tlocal c=x:GetComponent(SLuaTest)\n\tprint(\"test monobehaviour\",c, c.transform, c:GetType().Name)\n\tassert(c.gameObject.name==\"OoOo\")\n\tlocal c=x:GetComponent(UnityEngine.BoxCollider)\n\tassert(c==null)\n\n\tlocal ll=XXList() -- it's List<int>\n\tll:Add(1)\n\tprint(ll.Count)\n\n\tlocal x=MyGameObject(\"MyGameObject\")\n\tx:AddComponent(SphereCollider)\n\tHelloWorld.ofunc(x)\n\n\t-- test value type\n\tlocal x=Vector3(3,3,3)\n\tx:Normalize()\n\tprint(x.x,x.y,x.z)\n\tx=-x\n\tprint(x.x,x.y,x.z)\n\n\tlocal c=Color(1,1,1,1)\n\tprint(\"color\",c.r)\n\tlocal fs=foostruct()\n\tfs.mode=1\n\tfs.x=11.1\n\tassert(fs.mode==1)\n\n\t-- test module require\n\tprint(somemodule.add(2,3))\n\n\tlocal go = GameObject.Find(\"Canvas/Button\")\n\tlocal btn = go:GetComponent(\"Button\")\n\n\tlocal Canvas = GameObject.Find(\"Canvas\")\n\t-- foreach\n\tfor t in Slua.iter(Canvas.transform) do\n\t\tprint(\"foreach transorm\",t)\n\tend\n\t\n\t-- bytes return byte[]\n\tlocal data = HelloWorld.bytes()\n\tdata[1]=11\n\tprint(\"data type \",type(data),#data,data.Table[1],data,data[1],data[2])\n\n\t-- test bytearray object wity array\n\tlocal ba = Slua.ByteArray(data)\n\n\tdata = Slua.ToString(data)\n\tprint(\"data type \",type(data),data)\n\n\n\tprint('Construct bytearray object',ba)\n\tprint(ba:ReadByte(),ba:ReadByte())\n\tassert(ba.Length==4)\n\tassert(ba.Position==2)\n\tassert(ba:ReadByte()==53)\n\n\t-- construct new byte array\n\tlocal ba = Slua.ByteArray()\n\tba:WriteByte(11)\n\tba:WriteByte(22)\n\tba:WriteVarInt(1024)\n\tba.Position=0\n\tassert(ba:ReadByte()==11)\n\tassert(ba:ReadByte()==22)\n\tassert(ba:ReadVarInt()==1024)\n\n\n\t-- get out parameter\n\tlocal ok,hitinfo = Physics.Raycast(Vector3(0,0,0),Vector3(0,0,1),Slua.out)\n\tprint(\"Physics Hitinfo\",ok,hitinfo)\n\t\n\tlocal clickCount=0\n\tbtn.onClick:AddListener(function()\n\t\tlocal go = GameObject.Find(\"Canvas/Text\")\n\t\tlocal label = go:GetComponent(\"Text\")\n\t\tclickCount=clickCount+1\n\t\tlabel.text=\"hello world \" ..tostring(clickCount)\n\n\tend)\n\n\tbtn.onClick:AddListener(click)\n\t\n\n\tlocal go = GameObject.Find(\"Canvas/Panel2\"):GetComponent(\"ScrollRect\")\n\tlocal go2 = GameObject.Find(\"Canvas/Panel2\"):GetComponent(\"ScrollRect\")\n\tassert(go==go2)\n\n\tgo.onValueChanged:AddListener(function(v)\n\t\tprint(\"scroll value changed\",v.x,v.y)\n\tend)\n\n\tlocal cube = GameObject.CreatePrimitive(UnityEngine.PrimitiveType.Cube)\n\tlocal cube2 = GameObject.CreatePrimitive(UnityEngine.PrimitiveType.Cube)\n\tlocal mat = cube:GetComponent(Renderer).material\n\tmat.color=Color.red\n\n\tcube.name=\"Script cube\"\n\tcube2.name=\"Script cube2\"\n\n\tcube.transform:SetParent(cube2.transform)\n\n\tlocal pos = Vector3(10,10,10)+Vector3(1,1,1)\n\tcube.transform.position = pos\n\tcube.transform.localScale = Vector3(10,10,10)\n\tprint(\"cube==cube2\",cube==cube2)\n\tassert(cube.transform==cube.transform)\n\n\tLuaTimer.Add(0,20,function(id)\n\t\tcube.transform.localScale = Vector3(10,10,10)*(0.1+math.sin(Time.time))\n\t\tcube2.transform.position = Vector3(math.sin(Time.time)*5,0,0)\n\t\tcube.transform.localRotation = Quaternion.Euler(0,0,math.sin(Time.time)*90)\n\t\treturn true\n\tend)\n\t\n\tprint(UnityEngine.PrimitiveType.Cube,type(UnityEngine.PrimitiveType.Cube))\n\n\n\tprint(\"LogCallback occured\",n)\n\n\tlocal c=coroutine.create(function()\n\n\t\tprint \"coroutine start\"\n\n\t\tYield(WaitForSeconds(2))\n\t\tprint \"coroutine WaitForSeconds 2\"\n\n\t\tlocal www = WWW(\"http://www.sineysoft.com\")\n\t\tYield(www)\n\t\tprint(#Slua.ToString(www.bytes))\n\n\t\tlocal y = HelloWorld()\n\t\tlocal y = y:y()\n\t\tYield(y)\n\t\tprint(\"Yield ok\")\n\tend)\n\tcoroutine.resume(c)\n\n\t-- test lua table\n\tHelloWorld.setv({name=\"yes\",value=12,[-2]=\"siney\",[0]=\"no\"})\n\tlocal t=HelloWorld.getv()\n\tfor k,v in pairs(t) do\n\t\tprint(\"table value\",k,v)\n\tend\n\n\t-- test overload func\n\tHelloWorld.ofunc(GameObject)\n\tHelloWorld.ofunc(cube)\n\n\t-- test variant number args\n\tHelloWorld.func6(\"aa\",1,2)\n\tHelloWorld.func6(\"aa\",1,2,3,\"bb\")\n\tHelloWorld.func6(\"aa\",1,2,3,\"bb\",true,false)\n\tHelloWorld.func6(\"aa\")\n\tlocal ss=String(\"bb\")\n\tHelloWorld.func6(ss,1,2) -- func6 accpet system.string as 1st parameter, you can pass \"xx\" or String(\"xx\")\n\tassert(ss~=\"bb\") -- bb is luastring, ss is System.String\n\t\n\t-- test luafunction\n\tlocal h=HelloWorld()\n\th:func7(abc)\n\th.cc = Color32(255,0,0,255)\n\tprint(\"Hellor world color\",h.cc)\nend\n\nfunction abc()\n\tprint(\"call func7 callback\")\nend\n\nfunction foo(a,b,c)\n\treturn a,b,c,\"slua\"\nend\n\nfunction str()\n\treturn \"slua\"\nend\n\nreturn 1,2,3\n"
  },
  {
    "path": "Assets/Slua/Resources/main.txt.meta",
    "content": "fileFormatVersion: 2\nguid: b06e65704d4084031840f3c314c899d4\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/module/some.txt",
    "content": "\nlocal t={}\n\nfunction t.add(a,b)\n\treturn a+b\nend\n\nreturn t"
  },
  {
    "path": "Assets/Slua/Resources/module/some.txt.meta",
    "content": "fileFormatVersion: 2\nguid: 9042cf6044ebb4158a02f204cdba4243\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/module.meta",
    "content": "fileFormatVersion: 2\nguid: 834878ab3e1c94f4b96309e564533914\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/new_coroutine.txt",
    "content": "function main()\n\treturn function (obj)\n\t\tif NewCoroutine.MyMethod == nil then \n\t\t\tprint(\"please export the class to lua at first.\")\n\t\t\treturn \n\t\tend\n\t\tprint(\"lua got object\", obj)\n\t\tobj:StartCoroutine(function ()\n\t\t\twhile true do \n\t\t\t\tprint(\"**** start new coroutine in coroutine *****\")\n\t\t\t\tobj:StartCoroutine(function ()\n\t\t\t\t\tprint(\"directly supported lua coroutine. frameCount:\", UnityEngine.Time.frameCount)\n\t\t\t\t\tcoroutine.yield(nil)\n\t\t\t\t\tprint(\"yield one frame. frameCount:\", UnityEngine.Time.frameCount)\n\n\t\t\t\t\tcoroutine.yield(NewCoroutine.MyMethod(\"message from lua, run a c# coroutine and wait for 2 seconds\", 2, function ()\n\t\t\t\t\t\tprint(\"run after and invoked by c# coroutine\")\n\t\t\t\t\tend))\n\n\t\t\t\t\tprint(\"wait for another 3 seconds by UnityEngine.WaitForSeconds\")\n\t\t\t\t\tcoroutine.yield(UnityEngine.WaitForSeconds(3))\n\n\t\t\t\t\tprint(\"end of lua coroutine\")\n\t\t\t\tend)\n\t\t\t\tcoroutine.yield(UnityEngine.WaitForSeconds(10))\n\t\t\tend\n\t\tend)\n\t\tprint(\"code after StartCoroutine\")\n\tend\nend\n"
  },
  {
    "path": "Assets/Slua/Resources/new_coroutine.txt.meta",
    "content": "fileFormatVersion: 2\nguid: bce8ef7dcc3494bfb830ad6da30c00a5\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/perf.txt",
    "content": "\nif not UnityEngine.GameObject then\n\terror(\"Click Make/All to generate lua wrap file\")\nend\n\nlocal Vector3 = UnityEngine.Vector3\nlocal GameObject = UnityEngine.GameObject\nlocal Profiler = UnityEngine.Profiler\nlocal Time = UnityEngine.Time\nlocal Matrix4x4 = UnityEngine.Matrix4x4\nlocal Texture2D = UnityEngine.Texture2D\nlocal Quaternion = UnityEngine.Quaternion\nlocal SkinnedMeshRenderer = UnityEngine.SkinnedMeshRenderer\n\nfunction main()\n\tprint(jit and \"jit on\" or \"jit off, pls run test with luajit\")\nend\n\nlocal cube = GameObject(\"Script cube\")\n\n\nfunction test1()\n\tlocal transform = cube.transform\n\tlocal start = os.clock()\n\tfor i=1,200000 do\n        transform.position=transform.position\n\tend\n\tprint(\"test1/lua \" .. (os.clock() - start));\nend\n\nfunction test2()\n\tlocal transform=cube.transform\n\tlocal start = os.clock()\n\tfor i=1,200000 do\n\t\ttransform:Rotate(Vector3.up, 90)\n\tend\n\tprint(\"test2/lua \" .. (os.clock() - start));\nend\n\nfunction test3()\n\tlocal start = os.clock()\n\tfor i=1,2000000 do \n\t\tlocal v = Vector3(i,i,i)\n\t\tVector3.Normalize(v)\n\tend\n\tprint(\"test3/lua \" .. (os.clock() - start));\nend\n\nfunction test4()\n\tlocal t = cube.transform\n\tlocal v = Vector3.one\n\tlocal start = os.clock()\n\tfor i=1,200000 do\n\t\tlocal v = GameObject()\t\n\tend\n\tprint(\"test4/lua \" .. (os.clock() - start));\nend\n\n\nfunction test5()\n\tlocal v = cube.transform.position\n\tlocal start = os.clock()\n\tfor i=1,20000 do\n\t\tlocal v = GameObject()\n\t\tv:AddComponent(SkinnedMeshRenderer)\n\t\tlocal c=v:GetComponent(SkinnedMeshRenderer)\n\t\tc.castShadows=false\n\t\tc.receiveShadows=false\n\tend\n\tprint(\"test5/lua \" .. (os.clock() - start));\nend\n\nfunction test6()\n\tlocal transform=cube.transform\n\tlocal start = os.clock()\n\tfor i=1,200000 do\n\t\tlocal t=Quaternion.Euler(100,100,100)\n\t\tlocal q=Quaternion.Slerp(Quaternion.identity,t,0.5)\n\tend\n\tprint(\"test6/lua jit  \" .. (os.clock() - start));\nend\n\nfunction test7()\n\tlocal transform=cube.transform\n\tlocal Quaternion = (jit and Quaternion.__raw) or Quaternion\n\tlocal start = os.clock()\n\tfor i=1,200000 do\n\t\tlocal t=Quaternion.Euler(100,100,100)\n\t\tlocal q=Quaternion.Slerp(Quaternion.identity,t,0.5)\n\tend\n\tprint(\"test6/lua non-jit  \" .. (os.clock() - start));\nend\n"
  },
  {
    "path": "Assets/Slua/Resources/perf.txt.meta",
    "content": "fileFormatVersion: 2\nguid: ac649526e54a34d74b2b01753255576d\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/setting.asset.meta",
    "content": "fileFormatVersion: 2\nguid: 7794661c73f0c91488177e3a0b02decc\ntimeCreated: 1486729492\nlicenseType: Pro\nNativeFormatImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Resources/valuetype.txt",
    "content": "-- unit test\nfunction main()\n\n\n\n\tlocal Vector3 = UnityEngine.Vector3\n\tlocal Quaternion = UnityEngine.Quaternion\n\tlocal v=Vector3(0,0,0)+Vector3.one*2/2\n\tassert(v.y==1)\n\tv.y=2\n\tassert(v.x==1)\n\tassert(v.y==2)\n\tassert(v.y==2 and v[2]==2)\n\tlocal x1=Vector3.RotateTowards(Vector3.up,Vector3.right,0.45,0.2)\n\tlocal x2=Vector3.__raw.RotateTowards(Vector3.up,Vector3.right,0.45,0.2)\n\tprint(x1,x2)\n\tassert(x1==x2)\n\n\tlocal v1=2*Vector3(1,2,3)\n\tlocal v2=Vector3(1,2,3)*2\n\tprint(\"2*Vector\",v1,v2)\n\tassert(v1==v2)\n\n\tlocal v=Vector3(2,0,0)\n\tv:Set(3,0,0)\n\tassert(v.x==v[1] and v.x==3)\n\tv:Normalize()\n\tlocal v2=Vector3.Normalize(v)\n\tassert(v.x==1 and v2==v)\n\n\tlocal dir = (Vector3.up - Vector3.zero).normalized\n\tassert(dir==Vector3.up)\n\n\tlocal v1=Vector3.MoveTowards(Vector3.zero,Vector3.one,0.3)\n\tlocal v2=Vector3.__raw.MoveTowards(Vector3.zero,Vector3.one,0.3)\n\tassert(v1==v2)\n\tassert(-v1+v2==Vector3.zero)\n\n\tlocal n1,t1=Vector3(0.5,1,1),Vector3(1,0.5,0.5)\n\tVector3.OrthoNormalize(n1,t1)\n\tlocal n2,t2=Vector3(0.5,1,1),Vector3(1,0.5,0.5)\n\tn2,t2=Vector3.__raw.OrthoNormalize(n2,t2)\n\tprint(n1,n2,t1,t2)\n\tassert(n1==n2)\n\tassert(t1==t2)\n\n\tlocal n1,t1,b1=Vector3(0.5,1,1),Vector3(1,0.5,0.5),Vector3(1,2,0)\n\tVector3.OrthoNormalize(n1,t1,b1)\n\tlocal n2,t2,b2=Vector3(0.5,1,1),Vector3(1,0.5,0.5),Vector3(1,2,0)\n\tn2,t2,b2=Vector3.__raw.OrthoNormalize(n2,t2,b2)\n\tprint(n1,n2,t1,t2,b1,b2)\n\tassert(n1==n2)\n\tassert(t1==t2)\n\tassert(b1==b2)\n\n\tlocal currentV=Vector3(0,0.1,0)\n\tlocal v4=Vector3.SmoothDamp(Vector3.zero,Vector3.up,currentV,5)\n\tprint(v4,currentV)\n\n\tlocal r=Vector3.Reflect(Vector3(0.5,0.5,0),Vector3.up)\n\tlocal r2=Vector3.__raw.Reflect(Vector3(0.5,0.5,0),Vector3.up)\n\tprint(r,r2)\n\tassert(r==r2)\n\n\tlocal r=Vector3.ProjectOnPlane(Vector3(0.5,0.5,0),Vector3.up)\n\tlocal r2=Vector3.__raw.ProjectOnPlane(Vector3(0.5,0.5,0),Vector3.up)\n\tprint(r,r2)\n\tassert(r==r2)\n\n\tlocal r=Vector3.Slerp(Vector3.up,Vector3.zero,0.5)\n\tlocal r2=Vector3.__raw.Slerp(Vector3.up,Vector3.zero,0.5)\n\tassert(r==r2)\n\n\tlocal r=Vector3.Slerp(Vector3.up,Vector3(0.5,-1,0),0.1)\n\tlocal r2=Vector3.__raw.Slerp(Vector3.up,Vector3(0.5,-1,0),0.1)\n\tassert(r==r2)\n\n\tlocal st=os.clock()\n\tfor i=1,200000 do\n\t\tlocal r=Vector3.Slerp(Vector3.up,Vector3.down,0.1)\n\tend\n\tprint(\"slerp time\",os.clock()-st)\n\tlocal st=os.clock()\n\tfor i=1,200000 do\n\t\tlocal r2=Vector3.__raw.Slerp(Vector3.up,Vector3.down,0.1)\n\tend\n\tprint(\"slerp raw time\",os.clock()-st)\n\n\tlocal r=Vector3.RotateTowards(Vector3.up,Vector3.down,0.1,0.1)\n\tlocal r2=Vector3.__raw.RotateTowards(Vector3.up,Vector3.down,0.1,0.1)\n\tprint(r,r2)\n\tassert(r==r2)\n\n\tlocal Color=UnityEngine.Color\n\n\tlocal r=Color.red\n\tprint(r,r.linear,r.gamma)\n\n\tlocal r=Color(0.2,0.8,1,1)\n\tprint(r,r.linear,r.gamma)\n\n\tr.r=1\n\tassert(r.r==1 and r[1]==1)\n\n\tlocal r = Color.Lerp(Color.clear,Color.white,0.3)\n\tprint(r)\n\tassert(r==Color(0.3,0.3,0.3,0.3))\n\n\tlocal r = Quaternion.Euler(30,30,30)\n\tprint(r)\n\tlocal Inst=_G['UnityEngine.Quaternion.Instance']\n\tlocal r1,r2=r:ToAngleAxis()\n\tlocal r3,r4=Inst.ToAngleAxis(r)\n\tprint(\"ToAngleAxis\",r1,r2,r3,r4)\n\tassert(r1==r3 and r2==r4)\n\tr:SetFromToRotation(Vector3.up,Vector3.right)\n\tprint(r,r.x,r.y,r.z,r.w)\n\tr:SetLookRotation(Vector3.back,Vector3.up)\n\tprint(r)\n\tlocal r=Quaternion.Dot(Quaternion(1,0,0,1),Quaternion(0.5,0,0,1))\n\tprint(\"dot of q\",r)\n\tlocal r=Quaternion(1,0,0,1)*Quaternion(0.5,0,0,1)\n\tprint(\"mul q\",r)\n\tlocal v=r*Vector3.up\n\tprint(\"mul q,v\",v)\n\n\tlocal r=Quaternion.Euler(30,30,30)\n\tlocal r2=Quaternion.__raw.Euler(30,30,30)\n\tassert(r==r2)\n\tprint(\"xxx\",r2.eulerAngles)\n\tr2.eulerAngles=Vector3(40,40,40)\n\tprint(\"yyy\",r2.eulerAngles)\n\n\tlocal Vector2 = UnityEngine.Vector2\n\tlocal r = Vector2.one\n\tassert(r==Vector2(1,1))\n\tassert(Vector2.Dot(Vector2.one,Vector2(0.5,0.5))==1)\n\tlocal r=Vector2.Lerp(Vector2.zero,Vector2.one,0.3)\n\tassert(r==Vector2(1,1)*0.3)\n\tprint(r.normalized)\n\n\tVector2.Normalize(r)\nend"
  },
  {
    "path": "Assets/Slua/Resources/valuetype.txt.meta",
    "content": "fileFormatVersion: 2\nguid: eb40bd6c45f7a254ebd5f2fe0df61eb3\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources/varobj.txt",
    "content": "GameObject = UnityEngine.GameObject\n\nfunction main()\n\n\t-- List<>,Dictionay<> not exported\n\t-- so return as LuaVarObject\n\t-- varobj access via reflection, try to avoid using non exported class\n\n\tlocal obj = HelloWorld()\n\n\tlocal list = obj:getList()\n\tprint(list.Count) -- call var's property\n\t\n\tfor i=3,10 do\n\t\tlist:Add(GameObject(tostring(i)))\n\tend\n\n\tlist[5] = GameObject(\"Replaced 5\")\n\n\t-- list index based 0 not 1\n\tfor i=0,9 do\n\t\tprint(i,list[i],list[i].name) -- access item by index\n\tend\n\n\n\n\tprint(\"List count\",list.Count) -- call var's property\n\n\n\n\tlocal dict = obj:foo()\n\n\tfor i=1,10 do\n\t\tdict:Add(tostring(i),GameObject(\"dict\"..i)) -- add k,v to Dictionary<string,GameObject>\n\tend\n\tdict[\"hello\"] = GameObject(\"world\")\n\n\tprint(\"Dict count\",dict.Count)\n\n\tfor v in Slua.iter(dict) do\n\t\tprint(\"for each\",v)\n\tend\n\n\tlocal dict2 = obj:too()\n\tdict2[list[5]]=\"xxx\"\n\n\tprint(dict2.Count)\n\n\t-- now we simple benchmark varobj\n\tlocal t = os.clock()\n\tfor i=1,200000 do\n\t\tlocal a = dict.Count\n\tend\n\tprint(\"Var obj prop get 200k, take time:\",os.clock()-t)\n\t-- you see, varobj is slow, use exported class instead\n\n\t-- create class used reflection\n\tlocal go=Slua.CreateClass(\"UnityEngine.GameObject,UnityEngine\",\"VarGameObject\")\n\tprint(go.name)\n\tlocal array=Slua.CreateClass(\"System.Collections.ArrayList\",10)\n\tprint(array.Capacity)\n\tarray:Add(\"slua\")\n\tarray:Add(\"unity\")\n\tprint(array.Count,array[0],array[1])\n\n\n\tlocal cls=Slua.GetClass(\"UnityEngine.Vector3,UnityEngine\")\n\tlocal cc=cls.one\n\tcc=cls.Normalize(cc)\n\tprint(cc.x,cc.y,cc.z)\n\n\tlocal r=Slua.CreateClass(\"Ref\")\n\tr.depth=10\n\tprint(r,r.depth)\nend\n\n\n"
  },
  {
    "path": "Assets/Slua/Resources/varobj.txt.meta",
    "content": "fileFormatVersion: 2\nguid: b1be2f8c0bc5d4252b89b265bee33481\nTextScriptImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Resources.meta",
    "content": "fileFormatVersion: 2\nguid: 8e1e1b5ec1b058e4aa861a7d95ea3fac\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/Source/LuaThreadWrapper.cs",
    "content": "using System;\nusing System.Collections;\n\nnamespace SLua\n{\n    using UnityEngine;\n\n    public class LuaThreadWrapper : LuaVar\n    {\n        private IntPtr _thread;\n        \n        public LuaThreadWrapper(LuaFunction func)\n         : base()\n        {\n            Debug.LogFormat(\"LuaThreadWrapper.ctor/1: {0}\", LuaDLL.lua_gettop(func.L));\n            state = LuaState.get(func.L); // why do not give access of state?\n            _thread = LuaDLL.lua_newthread(func.L);\n            valueref = LuaDLL.luaL_ref(func.L, LuaIndexes.LUA_REGISTRYINDEX);\n            func.push(func.L);\n            LuaDLL.lua_xmove(func.L, _thread, 1);\n            Debug.LogFormat(\"LuaThreadWrapper.ctor/2: {0}\", LuaDLL.lua_gettop(func.L));\n        }\n\n        ~LuaThreadWrapper()\n        {\n            Debug.Log(\"~LuaThreadWrapper\");\n            Dispose(false);\n        }\n\n\t\tpublic override void Dispose(bool disposeManagedResources)\n        {\n            base.Dispose(disposeManagedResources);\n            _thread = IntPtr.Zero;\n        }\n\n        public bool EqualsTo(IntPtr L)\n        {\n            return _thread == L;\n        }\n\n        private object TopObjects(int nArgs)\n        {\n            if (nArgs == 0)\n                return null;\n            else if (nArgs == 1)\n            {\n                object o = LuaObject.checkVar(_thread, -1);\n                return o;\n            }\n            else\n            {\n                object[] o = new object[nArgs];\n                for (int n = 1; n <= nArgs; n++)\n                {\n                    o[n - 1] = LuaObject.checkVar(_thread, n);\n                }\n                return o;\n            }\n        }\n\n        /// 返回true继续执行, false无法继续执行\n        public bool Resume(out object retVal)\n        {\n            if (_thread == IntPtr.Zero)\n            {\n                SLua.Logger.LogError(\"thread: already disposed?\");\n                retVal = null;\n                return false;\n            }\n            var status = LuaDLL.lua_status(_thread); // LUA_OK = 0\n            if (status != 0 && status != (int)LuaThreadStatus.LUA_YIELD)\n            {\n                SLua.Logger.LogError(\"thread: wrong status ?= \" + status);\n                retVal = null;\n                return false;\n            }\n            //var debug_top = LuaDLL.lua_gettop(_thread);\n            var result = LuaDLL.lua_resume(_thread, 0);\n            if (result != (int)LuaThreadStatus.LUA_YIELD)\n            {\n                if (result != 0)\n                {\n                    string error = LuaDLL.lua_tostring(_thread, -1);\n                    SLua.Logger.LogError(string.Format(\"wrong result ?= {0} err: {1}\", result, error));\n                }\n                retVal = null;\n                return false;\n            }\n            var nArgsFromYield = LuaDLL.lua_gettop(_thread);\n            //Debug.LogFormat(\"thread debug {0} {1}\", debug_top, nArgsFromYield);\n            retVal = TopObjects(nArgsFromYield); //?? top is thread self, but remove after yield??\n            return true;\n        }\n    }\n}\n"
  },
  {
    "path": "Assets/Slua/Source/LuaThreadWrapper.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 6e6051dbdd7ab45caa51fd5ac35b3e3b\ntimeCreated: 1485227058\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Source/UnityExtension.cs",
    "content": "using System.Collections;\nnamespace SLua\n{\n    using UnityEngine;\n\n    // 没搞明白为什么放在 Plugins/Slua_Managed 目录下无法将扩展函数导入到 MonoBehaviour 类中\n    // 所以先放在 SLua/Source 目录中\n    public static class UnityExtension\n    {\n        public static void StartCoroutine(this MonoBehaviour mb, LuaFunction func)\n        {\n            mb.StartCoroutine(LuaCoroutine(func));\n        }\n\n        internal static IEnumerator LuaCoroutine(LuaFunction func)\n        {\n            var thread = new LuaThreadWrapper(func);\n            while (true)\n            {\n                object obj;\n                if (!thread.Resume(out obj))\n                {\n                    yield break;\n                }\n                yield return obj;\n            }\n        }\n    }\n}"
  },
  {
    "path": "Assets/Slua/Source/UnityExtension.cs.meta",
    "content": "fileFormatVersion: 2\nguid: ecae7f0c696984335bf342b3f8ab6e80\ntimeCreated: 1485227058\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/Source.meta",
    "content": "fileFormatVersion: 2\nguid: 7ac22682e2dc84e7c9954de0fd8cb150\nfolderAsset: yes\ntimeCreated: 1485227058\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/example/Circle.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\n\npublic class Circle : MonoBehaviour {\n\n\n\tLuaSvr svr;\n\tLuaTable self;\n\tLuaFunction update;\n\tvoid Start () {\n\t\tsvr = new LuaSvr();\n\t\tsvr.init(null, () =>\n\t\t{\n\t\t\tself = (LuaTable)svr.start(\"circle/circle\");\n\t\t\tupdate = (LuaFunction)self[\"update\"];\n\t\t});\n\t}\n\t\n\tvoid Update () {\n\t\tif(update!=null) update.call(self);\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/Circle.cs.meta",
    "content": "fileFormatVersion: 2\nguid: bcb74a59a133f9840ad3d01bcb50d671\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/Custom.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing System.Collections.Generic;\nusing SLua;\nusing System;\n\n[CustomLuaClassAttribute]\npublic class Custom : MonoBehaviour\n{\n\n\tint v = 520;\n\tstatic string vs = \"xiaoming & hanmeimei\";\n\tLuaSvr l;\n\tstatic Custom c;\n\tvoid Start()\n\t{\n\t\tc = this;\n\t\tl = new LuaSvr();\n\t\tl.init(null, () =>\n\t\t{\n\t\t\tl.start(\"custom\");\n\t\t});\n\t}\n\n\t// Update is called once per frame\n\tvoid Update()\n\t{\n\n\t}\n\n\t// this exported function don't generate stub code if it had MonoPInvokeCallbackAttribute attribute, only register it\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\tstatic public int instanceCustom(IntPtr l)\n\t{\n\t\tCustom self = (Custom)LuaObject.checkSelf(l);\n\t\tLuaObject.pushValue(l, true);\n\t\tLuaDLL.lua_pushstring(l, \"xiaoming\");\n\t\tLuaDLL.lua_pushstring(l, \"hanmeimei\");\n\t\tLuaDLL.lua_pushinteger(l, self.v);\n\t\treturn 4;\n\t}\n\n\t// this exported function don't generate stub code, only register it\n\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t[StaticExport]\n\tstatic public int staticCustom(IntPtr l)\n\t{\n\t\tLuaObject.pushValue(l, true);\n\t\tLuaDLL.lua_pushstring(l, vs);\n\t\tLuaObject.pushObject(l, c);\n\t\treturn 3;\n\t}\n\tpublic int this[string key]\n\t{\n\t\tget\n\t\t{\n\t\t\tif (key == \"test\")\n\t\t\t\treturn v;\n\t\t\treturn 0;\n\t\t}\n\t\tset\n\t\t{\n\t\t\tif (key == \"test\")\n\t\t\t{\n\t\t\t\tv = value;\n\t\t\t}\n\t\t}\n\t}\n\tpublic string getTypeName(Type t)\n\t{\n\t\treturn t.Name;\n\t}\n}\n\n\nnamespace SLua {\n\t\n\t[OverloadLuaClass(typeof(GameObject))]\n\tpublic class MyGameObject : LuaObject {\n\t\t[MonoPInvokeCallbackAttribute(typeof(LuaCSFunction))]\n\t\tpublic static int Find_s(IntPtr l) {\n\t\t\tUnityEngine.Debug.Log (\"GameObject.Find overloaded my MyGameObject.Find\");\n\t\t\ttry {\n\t\t\t\tSystem.String a1;\n\t\t\t\tcheckType(l,1,out a1);\n\t\t\t\tvar ret=UnityEngine.GameObject.Find(a1);\n\t\t\t\tpushValue(l,true);\n\t\t\t\tpushValue(l,ret);\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t\tcatch(Exception e) {\n\t\t\t\treturn error(l,e);\n\t\t\t}\n\t\t}\n\t}\n\n}"
  },
  {
    "path": "Assets/Slua/example/Custom.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 31c9125ea6e6bf241b759f79d8be46d3\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/Deleg.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\nusing System;\nusing System.Collections.Generic;\n\n[CustomLuaClassAttribute]\npublic class Deleg : MonoBehaviour\n{\n\n\n\tpublic delegate bool GetBundleInfoDelegate(string path, out string url, out int ver);\n\tpublic delegate void SimpleDelegate(string path, GameObject g);\n\n\tstatic public GetBundleInfoDelegate d;\n\tstatic public SimpleDelegate s;\n\n\tstatic public GetBundleInfoDelegate dx\n\t{\n\t\tget\n\t\t{\n\t\t\treturn d;\n\t\t}\n\t\tset\n\t\t{\n\t\t\td = value;\n\t\t}\n\t}\n\n\tLuaSvr l;\n\t// Use this for initialization\n\tvoid Start()\n\t{\n\t\tl = new LuaSvr();\n\t\tl.init(null,()=>{\n\t\t\tl.start(\"delegate\");\n\t\t});\n\t}\n\n\tstatic public void callD()\n\t{\n\t\tstring url;\n\t\tint ver;\n\t\tif (d != null)\n\t\t{\n\t\t\tbool ret = d(\"/path\", out url, out ver);\n\t\t\tDebug.Log(string.Format(\"{0},{1},{2}\", ret, url, ver));\n\t\t}\n\t\tif (s != null)\n\t\t\ts(\"GameObject\", new GameObject(\"SimpleDelegate\"));\n\t}\n\n\tstatic public void setcallback2(Action<int> a, Action<string> b)\n\t{\n\t\tif(a!=null) a(1);\n\t\tif(b!=null) b(\"hello\");\n\t}\n\n\tpublic static void testFunc(Func<int> f)\n\t{\n\t\tDebug.Log(string.Format(\"Func return {0}\", f()));\n\t}\n\n\tpublic static void testAction(Action<int, string> f)\n\t{\n\t\tf(1024, \"caoliu\");\n\t}\n\n\tpublic static void testDAction(Action<int, Dictionary<int, object>> f)\n\t{\n\t\tf(1024, new Dictionary<int, object>());\n\n\t}\n\n\tpublic static void callDAction()\n\t{\n\t\tif (daction != null)\n\t\t\tdaction(2048, new Dictionary<int, object>());\n\t}\n\n\tpublic static Action<int, Dictionary<int, object>> daction;\n\n\tpublic static Func<int, string, bool> getFunc(Func<int, string, bool> f)\n\t{\n\t\treturn f;\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/Deleg.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 0ec061a58d4bc5841a8dd573c80cbc35\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/HelloWorld.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing System.Collections.Generic;\nusing SLua;\nusing System;\n\n#if UNITY_5_5_OR_NEWER\nusing UnityEngine.Profiling;\n#endif\n\n[CustomLuaClass]\npublic struct foostruct\n{\n\tpublic float x, y, z,w;\n\tpublic int mode;\n}\n\n[CustomLuaClass]\npublic class FloatEvent : UnityEngine.Events.UnityEvent<float>\n{\n\tpublic FloatEvent() { }\n}\n\n[CustomLuaClass]\npublic class ListViewEvent : UnityEngine.Events.UnityEvent<int,string> {\n\t\n}\n\n[CustomLuaClass]\npublic class SLuaTest : MonoBehaviour {\n\tpublic FloatEvent intevent;\n}\n\n[CustomLuaClass]\npublic class XXList : List<int> { }\n\n[CustomLuaClass]\nabstract public class AbsClass {\n\n\t// this constructor should not been exported for test\n\tpublic AbsClass() {\n\t}\n\n\tpublic int x;\n}\n\n\npublic class Ref\n{\n    int mDepth;\n    public int depth\n    {\n        get\n        {\n            return mDepth;\n        }\n        set {\n            mDepth = value;\n        }\n    }\n}\n\n[CustomLuaClass]\npublic class HelloWorld\n{\n\tpublic Color32 cc;\n\n\tpublic UnityEngine.Events.UnityAction someAct;\n\tstatic public void say()\n\t{\n\t\tDebug.Log(\"hello world\");\n\t}\n\n\tstatic public byte[] bytes()\n\t{\n\t\treturn new byte[] { 51, 52, 53, 53 };\n\t}\n\n\tstatic public void int16Array(Int16[] array) {\n\t\tforeach(Int16 i in array) {\n\t\t\tDebug.Log(\"output int16 \"+i);\n\t\t}\n\t}\n\n\tstatic public Vector3[] vectors()\n\t{\n\t\treturn new Vector3[] { Vector3.one, Vector3.zero, Vector3.up };\n\t}\n\n\tstatic public void nullf(int? a=null) {\n\t\tif (a == null)\n\t\t\tDebug.Log(\"null\");\n\t\telse\n\t\t\tDebug.Log(a);\n\t}\n\n\tpublic IEnumerator y()\n\t{\n\t\tWWW www = new WWW(\"http://news.163.com\");\n\t\tyield return www;\n\t\tDebug.Log(\"yield good\");\n\t}\n\n\n\tpublic Dictionary<string, GameObject> foo()\n\t{\n\t\treturn new Dictionary<string, GameObject>();\n\t}\n\n\tpublic Dictionary<string, GameObject>[] foos()\n\t{\n\t\treturn new Dictionary<string, GameObject>[]{};\n\t}\n\n\tpublic int gos(Dictionary<string, GameObject>[] x)\n\t{\n\t\treturn x.Length;\n\t}\n\n\tpublic Dictionary<GameObject, string> too()\n\t{\n\t\treturn new Dictionary<GameObject, string>();\n\t}\n\n\tpublic List<GameObject> getList()\n\t{\n\t\treturn new List<GameObject> { new GameObject(\"1\"), new GameObject(\"2\") };\n\t}\n\n\tstatic public void setv(LuaTable t)\n\t{\n\t\tDebug.Log (\"negative index test \" + t [-2]);\n\t\tDebug.Log (\"zero index test \" + t [0]);\n\t\t\n\t\tforeach (LuaTable.TablePair pair in t)\n\t\t{\n\t\t\tDebug.Log(string.Format(\"foreach LuaTable {0}-{1}\", pair.key, pair.value));\n\t\t\tbreak;\n\t\t}\n\n\t\tvar iter = t.GetEnumerator();\n\t\twhile(iter.MoveNext()) {\n\t\t\tvar pair = iter.Current;\n\t\t\tDebug.Log(string.Format(\"foreach LuaTable {0}-{1}\", pair.key, pair.value));\n\t\t\tbreak;\n\t\t}\n\t\titer.Dispose();\n\n\t}\n\n\tstatic public LuaTable getv()\n\t{\n\t\tLuaTable t = new LuaTable(LuaState.main);\n\t\tt[\"name\"] = \"xiaoming\";\n\t\tt[1] = \"a\";\n\t\tt[2] = \"b\";\n\n\t\tt[\"xxx\"] = new LuaTable(LuaState.main);\n\t\t((LuaTable)t[\"xxx\"])[\"yyy\"] = 1;\n\t\treturn t;\n\t}\n\n\tpublic object this[string path]\n\t{\n\t\tget\n\t\t{\n\t\t\tDebug.Log (\"get by string key\");\n\t\t\treturn \"value\";\n\t\t}\n\t\tset\n\t\t{\n\t\t\tDebug.Log (\"set by string key\");\n\t\t}\n\t}\n\n\tpublic object this[int index]\n\t{\n\t\tget\n\t\t{\n\t\t\tDebug.Log (\"get by int key\");\t\n\t\t\treturn \"int value\";\n\t\t}\n\t\tset\n\t\t{\n\t\t\tDebug.Log (\"set by int key\");\t\n\t\t}\n\t}\n\n\n\n\tstatic public void ofunc(Type t)\n\t{\n\t\tDebug.Log(t.Name);\n\t}\n\n\tstatic public void ofunc(GameObject go)\n\t{\n\t\tDebug.Log(go.name);\n\t}\n\n\tstatic public void AFunc(int a) {\n\t\tDebug.Log (\"AFunc with int\");\n\t}\n\n\tstatic public void AFunc(float a) {\n\t\tDebug.Log (\"AFunc with float\");\n\t}\n\n\tstatic public void AFunc(string a) {\n\t\tDebug.Log (\"AFunc with string\");\n\t}\n\n\t[LuaOverride(\"AFuncByDouble\")]\n\tstatic public void AFunc(double a) {\n\t\tDebug.Log (\"AFunc with double\");\n\t}\n\n\n\n\n\t// this function exported, but get error to call\n\t// generic function not support\n\tpublic void generic<T>()\n\t{\n\t\tDebug.Log(typeof(T).Name);\n\t}\n\n\tpublic void perf()\n\t{\n\t\tProfiler.BeginSample(\"create 1000000 vector3/cs\");\n\t\tfor (int n = 0; n < 1000000; n++)\n\t\t{\n\t\t\tVector3 v = new Vector3(n, n, n);\n\t\t\tv.Normalize();\n\t\t}\n\t\tProfiler.EndSample();\n\t}\n\n\tstatic public void testvec3(Vector3 v)\n\t{\n\t\tDebug.Log(string.Format(\"vec3 {0},{1},{2}\", v.x, v.y, v.z));\n\t}\n\n\tstatic public void testset(GameObject go)\n\t{\n\t\tTransform t = go.transform;\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tt.position = t.position;\n\t\t}\n\t}\n\n\tstatic public void test2(GameObject go)\n\t{\n\t\tVector3 v = Vector3.one;\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tv.Normalize();\n\t\t}\n\t}\n\n\tstatic public void test3(GameObject go)\n\t{\n\t\tVector3 v = Vector3.one;\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tv = Vector3.Normalize(v);\n\t\t}\n\t}\n\n\tstatic public void test4(GameObject go)\n\t{\n\t\tVector3 v = Vector3.one;\n\t\tTransform t = go.transform;\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tt.position = v;\n\t\t}\n\t}\n\n\tstatic public Vector3 test5(GameObject go)\n\t{\n\t\tVector3 v = Vector3.zero;\n\t\tfor (int i = 0; i < 200000; i++)\n\t\t{\n\t\t\tv = new Vector3(i, i, i);\n\t\t}\n\t\treturn v;\n\t}\n\n\t// test variant number for arguments passed in\n\tstatic public void func6(string str, params object[] args)\n\t{\n\t\tDebug.Log(str);\n\t\tfor (int n = 0; n < args.Length; n++)\n\t\t{\n\t\t\tDebug.Log(args[n]);\n\t\t}\n\t}\n\n\tLuaFunction f;\n\tpublic void func7(LuaFunction func)\n\t{\n\t\tf = func;\n\t\tf.call();\n\t}\n\n\tpublic void func7(int a)\n\t{\n\t\tDebug.Log(a);\n\t}\n\n\t[DoNotToLua]\n\tstatic public void dontexport()\n\t{\n\n\t}\n\n\t[DoNotToLua]\n\tpublic int a;\n\n\t[DoNotToLua]\n\tpublic int A\n\t{\n\t\tget\n\t\t{\n\t\t\treturn a;\n\t\t}\n\t}\n\n\tinternal int b;\n\n    public void func8(List<int> result)\n    {\n        result.Add(1);\n    }\n}\n\npublic static class ExtensionTest\n{\n    static List<int> result = new List<int>();\n\tpublic static List<int> func8(this HelloWorld helloWorld)\n    {\n        helloWorld.func8(result);\n        return result;\n    }\n}"
  },
  {
    "path": "Assets/Slua/example/HelloWorld.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 3d1764420688e104093fb072bdf08d81\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/Main.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\nusing UnityEngine.UI;\nusing System.Collections.Generic;\n\npublic class Main : MonoBehaviour\n{\n\n\tLuaSvr l;\n\tpublic Text logText;\n\tint progress=0;\n\t// Use this for initialization\n\tvoid Start()\n\t{\n#if UNITY_5\n\t\tApplication.logMessageReceived += this.log;\n#else\n\t\tApplication.RegisterLogCallback(this.log);\n#endif\n\n\t\tl = new LuaSvr();\n\t\tl.init(tick,complete,LuaSvrFlag.LSF_BASIC|LuaSvrFlag.LSF_EXTLIB);\n\t}\n\n\tvoid log(string cond, string trace, LogType lt)\n\t{\n\t\tlogText.text += (cond + \"\\n\");\n\n\t}\n\n\tvoid tick(int p)\n\t{\n\t\tprogress = p;\n\t}\n\n\tvoid complete()\n\t{\n\t\tl.start(\"main\");\n\t\tobject o = l.luaState.getFunction(\"foo\").call(1, 2, 3);\n\t\tobject[] array = (object[])o;\n\t\tfor (int n = 0; n < array.Length; n++)\n\t\t\tDebug.Log(array[n]);\n\n\t\tstring s = (string)l.luaState.getFunction(\"str\").call(new object[0]);\n\t\tDebug.Log(s);\n\t}\n\n\tvoid OnGUI()\n\t{\n\t\tif(progress!=100)\n\t\t\tGUI.Label(new Rect(0, 0, 100, 50), string.Format(\"Loading {0}%\", progress));\n\t}\n\n}\n"
  },
  {
    "path": "Assets/Slua/example/Main.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 69e6b39f9d654bf488e47ba4cd959d66\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/NewCoroutine.cs",
    "content": "using System.Collections;\nusing UnityEngine;\nusing SLua;\n\n[CustomLuaClass]\npublic class NewCoroutine : MonoBehaviour\n{\n    public static IEnumerator MyMethod(string test, float time, LuaFunction func)\n    {\n        Debug.Log(test);\n        yield return new WaitForSeconds(time);\n        func.call();\n    }\n\n\tvoid Start () {\n\t\tvar svr = new LuaSvr();\n\t\tsvr.init(null, () =>\n\t\t{\n            var func = (LuaFunction)svr.start(\"new_coroutine\");\n\t\t\t\n            func.call(this);\n\t\t});\n\t}\n\t\n}"
  },
  {
    "path": "Assets/Slua/example/NewCoroutine.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 17fc1d827aac8409c96d14bd31df7921\ntimeCreated: 1485224691\nlicenseType: Free\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/example/Perf.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\npublic class Perf : MonoBehaviour\n{\n\n\tLuaSvr l;\n\t// Use this for initialization\n\tvoid Start()\n\t{\n\t\tvar startMem = System.GC.GetTotalMemory (true);\n\n\t\tvar start = Time.realtimeSinceStartup;\n\t\tl = new LuaSvr();\n\t\tl.init(null, () =>\n\t\t{\n\t\t\tDebug.Log (\"start cost: \" + (Time.realtimeSinceStartup - start));\n\n\t\t\tvar endMem = System.GC.GetTotalMemory (true);\n\t\t\tDebug.Log (\"startMem: \" + startMem + \", endMem: \" + endMem + \", \" + \"cost mem: \" + (endMem - startMem));\n\t\t\tl.start(\"perf\");\n\t\t});\n\n#if UNITY_5\n\t\tApplication.logMessageReceived += this.log;\n#else\n\t\tApplication.RegisterLogCallback(this.log);\n#endif\n\t}\n\n\tstring logText = \"\";\n\tvoid log(string cond, string trace, LogType lt)\n\t{\n\t\tlogText += cond;\n\t\tlogText += \"\\n\";\n\t}\n\n\tvoid OnGUI()\n\t{\n\t\tif (!l.inited)\n\t\t\treturn;\n\n\t\tif (GUI.Button(new Rect(10, 10, 120, 50), \"Test1\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test1\").call();\n\t\t}\n\n\t\tif (GUI.Button(new Rect(10, 100, 120, 50), \"Test2\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test2\").call();\n\t\t}\n\n\t\tif (GUI.Button(new Rect(10, 200, 120, 50), \"Test3\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test3\").call();\n\t\t}\n\n\t\tif (GUI.Button(new Rect(10, 300, 120, 50), \"Test4\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test4\").call();\n\t\t}\n\n\t\tif (GUI.Button(new Rect(200, 10, 120, 50), \"Test5\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test5\").call();\n\t\t}\n\n        if (GUI.Button(new Rect(200, 100, 120, 50), \"Test6 jit\"))\n        {\n            logText = \"\";\n            l.luaState.getFunction(\"test6\").call();\n        }\n\n\t\tif (GUI.Button(new Rect(200, 200, 120, 50), \"Test6 non-jit\"))\n\t\t{\n\t\t\tlogText = \"\";\n\t\t\tl.luaState.getFunction(\"test7\").call();\n\t\t}\n\n        if (GUI.Button(new Rect(10, 400, 300, 50), \"Click here for detail(in Chinese)\"))\n\t\t{\n\t\t\tApplication.OpenURL(\"http://www.sineysoft.com/post/164\");\n\t\t}\n\n\t\tGUI.Label(new Rect(400, 200, 300, 50), logText);\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/Perf.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 75b1d7d95dd94e043937ce3ec6a595a8\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/ValueType.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\n\npublic class ValueType : MonoBehaviour {\n\n    LuaSvr l;\n\t// Use this for initialization\n\tvoid Start () {\n        l = new LuaSvr();\n\t\tl.init(null, () =>\n\t\t{\n\t\t\tl.start(\"valuetype\");\n\t\t});\n\t}\n\t\n\t// Update is called once per frame\n\tvoid Update () {\n\t\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/ValueType.cs.meta",
    "content": "fileFormatVersion: 2\nguid: d88b6f775d921e94f9491723e9ebbb34\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/VarObj.cs",
    "content": "﻿using UnityEngine;\nusing System.Collections;\nusing SLua;\npublic class VarObj : MonoBehaviour\n{\n\n\tLuaSvr l;\n\t// Use this for initialization\n\tvoid Start()\n\t{\n\t\tl = new LuaSvr();\n\t\tl.init(null, () =>\n\t\t{\n\t\t\tl.start(\"varobj\");\n\t\t});\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/VarObj.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 1d7c17d3da04ce148b351d2885fbdd1f\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/circle.unity.meta",
    "content": "fileFormatVersion: 2\nguid: e342655a13b0dc744bf9414ace1f457e\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/custom.unity.meta",
    "content": "fileFormatVersion: 2\nguid: 494552c9c47c0a3458be1853dac9ca41\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/delegate.unity.meta",
    "content": "fileFormatVersion: 2\nguid: 02c6940fb02066b4199cb2c5c19266ee\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/main.unity.meta",
    "content": "fileFormatVersion: 2\nguid: bcdf4ea251478da408d0dc89fa5cc01b\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/new_coroutine.unity.meta",
    "content": "fileFormatVersion: 2\nguid: 68a97d5568b2148a1b9aaa14cc4f6f07\ntimeCreated: 1485226756\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "Assets/Slua/example/performance_test.unity.meta",
    "content": "fileFormatVersion: 2\nguid: d46d030affdc0ee4bb582467a17e5686\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/test/README.md",
    "content": "## Run tests\n* export namespace \"NLuaTest.Mock\" (uncomment in CustomExport.cs::OnAddCustomNamespace)\n* Slua -> Custom -> make\n* run test.unity"
  },
  {
    "path": "Assets/Slua/example/test/README.md.meta",
    "content": "fileFormatVersion: 2\nguid: 00d01fa32a01940a4831e420ce4e80c1\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/test/TestLua.cs",
    "content": "/*\nNLua License\n--------------------\n\nNLua is licensed under the terms of the MIT license reproduced below.\nThis mean that NLua is free software and can be used for both academic and\ncommercial purposes at absolutely no cost.\n\n===============================================================================\n\nCopyright (C) 2013 - Vinicius Jarina (viniciusjarina@gmail.com)\nCopyright (C) 2012 Megax <http://megax.yeahunter.hu/>\nCopyright (C) 2003-2005 Fabio Mascarenhas de Queiroz.\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n===============================================================================\n*/\n\n//note: this should be cleaned up and replaced with moq mocks where possible\n\nnamespace NLuaTest.Mock\n{\n\tusing System;\n\tusing System.Threading;\n\tusing System.Diagnostics;\n\tusing System.Reflection;\n\tusing SLua;\n\tusing Debug = UnityEngine.Debug;\n\t\n\tpublic class parameter\n\t{\n\t\tpublic string field1 = \"parameter-field1\";\n\t}\n\t\n\tpublic class UnicodeClass{\n\t\tpublic static readonly char UnicodeChar = '\\uE007';\n\t\tpublic static string UnicodeString\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\treturn Convert.ToString (UnicodeChar);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t#if MONOTOUCH\n\t[Preserve (AllMembers = true)]\n\t#endif\n\tpublic class master\n\t{\n\t\tpublic static string read()\n\t\t{\n\t\t\treturn \"test-master\";\n\t\t}\n\n\t\tpublic static string read( parameter test )\n\t\t{\n\t\t\treturn test.field1;\n\t\t}\n\t}\n\n\t#if MONOTOUCH\n\t[Preserve (AllMembers = true)]\n\t#endif\n\tpublic class testClass3 : master \n\t{\n\t\tpublic String strData;\n\t\tpublic int intData;\n\t\tpublic static string read2()\n\t\t{\n\t\t\treturn \"test\";\n\t\t}\n\n\t\tpublic static string read( int test )\n\t\t{\n\t\t\treturn \"int-test\";\n\t\t}\n\t}\n\n\t#if MONOTOUCH\n\t[Preserve (AllMembers = true)]\n\t#endif\n\tpublic class TestCaseName {\n\t\tpublic string name = \"name\";\n\t\tpublic string Name {\n\t\t\tget {\n\t\t\t\treturn \"**\" + name + \"**\";\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\t#if MONOTOUCH\n\t\t[Preserve (AllMembers = true)]\n\t#endif\n\tpublic class Vector\n\t{\n\t\tpublic double x;\n\t\tpublic double y;\n\t\tpublic static Vector operator * (float k, Vector v)\n\t\t{\n\t\t\tvar r = new Vector ();\n\t\t\tr.x = v.x * k;\n\t\t\tr.y = v.y * k;\n\t\t\treturn r;\n\t\t}\n\n\t\tpublic static Vector operator * (Vector v, float k)\n\t\t{\n\t\t\tvar r = new Vector ();\n\t\t\tr.x = v.x * k;\n\t\t\tr.y = v.y * k;\n\t\t\treturn r;\n\t\t}\n\n\t\tpublic void Func ()\n\t\t{\n\t\t\tDebug.Log (\"Func\");\n\t\t}\n\t}\n\n\tpublic static class VectorExtension\n\t{\n\t\tpublic static double Length (this Vector v)\n\t\t{\n\t\t\treturn v.x * v.x + v.y * v.y;\n\t\t}\n\t}\n\t\n\tpublic class DefaultElementModel\n\t{  \n\t\tpublic Action<double> DrawMe{ get; set; }  \n\t}  \n\t\n\t/*\n     * Delegates used for testing Lua function -> delegate translation\n     */\n\tpublic delegate int TestDelegate1 (int a, int b);\n\t\n\tpublic delegate int TestDelegate2 (int a, out int b);\n\t\n\tpublic delegate void TestDelegate3 (int a, ref int b);\n\t\n\tpublic delegate TestClass TestDelegate4 (int a, int b);\n\t\n\tpublic delegate int TestDelegate5 (TestClass a, TestClass b);\n\t\n\tpublic delegate int TestDelegate6 (int a, out TestClass b);\n\t\n\tpublic delegate void TestDelegate7 (int a, ref TestClass b);\n\t\n\t/* Delegate Lua-handlers */\n\t\n//\tclass LuaTestDelegate1Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tint CallFunction (int a, int b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a, b };\n//\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\n//\t\t\tobject ret = base.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\treturn (int)ret;\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate2Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tint CallFunction (int a, out int b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, 0 };\n//\t\t\tobject [] inArgs = new object [] { a };\n//\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\n//\t\t\tobject ret = base.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\tb = (int)args [1];\n//\t\t\treturn (int)ret;\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate3Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tvoid CallFunction (int a, ref int b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a, b };\n//\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\n//\t\t\tbase.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\tb = (int)args [1];\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate4Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tTestClass CallFunction (int a, int b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a, b };\n//\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\n//\t\t\tobject ret = base.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\treturn (TestClass)ret;\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate5Handler : NLua.Method.LuaDelegate\n//\t{\t\n//\t\tint CallFunction (TestClass a, TestClass b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a, b };\n//\t\t\tint [] outArgs = new int [] {  };\n//\t\t\t\n//\t\t\tobject ret = base.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\treturn (int)ret;\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate6Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tint CallFunction (int a, ref TestClass b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a };\n//\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\n//\t\t\tobject ret = base.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\tb = (TestClass)args [1];\n//\t\t\treturn (int)ret;\n//\t\t}\n//\t}\n//\t\n//\tclass LuaTestDelegate7Handler : NLua.Method.LuaDelegate\n//\t{\n//\t\tvoid CallFunction (int a, ref TestClass b)\n//\t\t{\n//\t\t\tobject [] args = new object [] { a, b };\n//\t\t\tobject [] inArgs = new object [] { a , b};\n//\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\n//\t\t\tbase.CallFunction (args, inArgs, outArgs);\n//\t\t\t\n//\t\t\tb = (TestClass)args [1];\n//\t\t}\n//\t}\n\t\n\t\n\t/*\n     * Interface used for testing Lua table -> interface translation\n     */\n\tpublic interface ITest\n\t{\n\t\tint intProp {\n\t\t\tget;\n\t\t\tset;\n\t\t}\n\t\t\n\t\tTestClass refProp {\n\t\t\tget;\n\t\t\tset;\n\t\t}\n\t\t\n\t\tint test1 (int a, int b);\n\t\t\n\t\tint test2 (int a, out int b);\n\t\t\n\t\tvoid test3 (int a, ref int b);\n\t\t\n\t\tTestClass test4 (int a, int b);\n\t\t\n\t\tint test5 (TestClass a, TestClass b);\n\t\t\n\t\tint test6 (int a, out TestClass b);\n\t\t\n\t\tvoid test7 (int a, ref TestClass b);\n\t}\n\t\n\tpublic interface IFoo1\n\t{\n\t\tint foo ();\n\t}\n\t\n\tpublic interface IFoo2\n\t{\n\t\tint foo ();\n\t}\n\t\n\tclass MyClass\n\t{\n\t\tpublic int Func1 ()\n\t\t{\n\t\t\treturn 1;\n\t\t}\n\t}\n\t\n\t/// <summary>\n\t/// Use to test threading\n\t/// </summary>\n\tclass DoWorkClass\n\t{\n\t\t\n\t\tpublic void DoWork ()\n\t\t{\n\t\t\t\n\t\t\t//simulate work by sleeping\n\t\t\t//Debug.Log(\"Started to do work on thread: \" + Thread.CurrentThread.ManagedThreadId);\n\t\t\tThread.Sleep (new Random ().Next (0, 1000));\n\t\t\t//Debug.Log(\"Finished work on thread: \" + Thread.CurrentThread.ManagedThreadId);\n\t\t}\n\t}\n\t\n\t/// <summary>\n\t/// test structure passing\n\t/// </summary>\n\tpublic struct TestStruct\n\t{\n\t\tpublic TestStruct(float val)\n\t\t{\n\t\t\tv = val;\n\t\t}\n\t\t\n\t\tpublic float v;\n\t\t\n\t\tpublic float val\n\t\t{\n\t\t\tget { return v; }\n\t\t\tset { v = value; }\n\t\t}\n\t}\n\t\n\t/// <summary>\n\t/// test enum\n\t/// </summary>\n\tpublic enum TestEnum\n\t{\n\t\tValueA,\n\t\tValueB\n\t}\n\t\n\t/// <summary>\n\t/// Generic class with generic and non-generic methods\n\t/// </summary>\n\t/// <typeparam name=\"T\"></typeparam>\n\tpublic class TestClassGeneric<T>\n\t{\n\t\tprivate object _PassedValue;\n\t\tprivate bool _RegularMethodSuccess;\n\t\t\n\t\tpublic bool RegularMethodSuccess {\n\t\t\tget { return _RegularMethodSuccess; }\n\t\t}\n\t\t\n\t\tprivate bool _GenericMethodSuccess;\n\t\t\n\t\tpublic bool GenericMethodSuccess {\n\t\t\tget { return _GenericMethodSuccess; }\n\t\t}\n\t\t\n\t\tpublic void GenericMethod (T value)\n\t\t{\n\t\t\t_PassedValue = value;\n\t\t\t_GenericMethodSuccess = true;\n\t\t}\n\t\t\n\t\tpublic void RegularMethod ()\n\t\t{\n\t\t\t_RegularMethodSuccess = true;\n\t\t}\n\t\t\n\t\t/// <summary>\n\t\t/// Returns true if the generic method was successfully passed a matching value\n\t\t/// </summary>\n\t\t/// <param name=\"value\"></param>\n\t\t/// <returns></returns>\n\t\tpublic bool Validate (T value)\n\t\t{\n\t\t\treturn value.Equals (_PassedValue);\n\t\t}\n\t}\n\t\n\t/// <summary>\n\t/// Normal class containing a generic method\n\t/// </summary>\n\tpublic class TestClassWithGenericMethod\n\t{\n\t\tprivate object _PassedValue;\n\t\t\n\t\tpublic object PassedValue {\n\t\t\tget { return _PassedValue; }\n\t\t}\n\t\t\n\t\tprivate bool _GenericMethodSuccess;\n\t\t\n\t\tpublic bool GenericMethodSuccess {\n\t\t\tget { return _GenericMethodSuccess; }\n\t\t}\n\t\t\n\t\tpublic void GenericMethod<T> (T value)\n\t\t{\n\t\t\t_PassedValue = value;\n\t\t\t_GenericMethodSuccess = true;\n\t\t}\n\t\t\n\t\tinternal bool Validate<T> (T value)\n\t\t{\n\t\t\treturn value.Equals (_PassedValue);\n\t\t}\n\t}\n\t\n\tpublic class TestClass2\n\t{\n\t\tpublic static int func (int x, int y)\n\t\t{\n\t\t\treturn x + y;\n\t\t}\n\t\t\n\t\tpublic int funcInstance (int x, int y)\n\t\t{\n\t\t\treturn x + y;\n\t\t}\n\t}\n\t\n\t/*\n\t * Sample class used in several test cases to check if\n\t * Lua scripts are accessing objects correctly\n\t */\n\tpublic class TestClass : IFoo1, IFoo2\n\t{\n\t\tpublic int val;\n\t\tprivate string strVal;\n\t\t\n\t\tpublic TestClass ()\n\t\t{\n\t\t\tval = 0;\n\t\t}\n\t\t\n\t\tpublic TestClass (int val)\n\t\t{\n\t\t\tthis.val = val;\n\t\t}\n\t\t\n\t\tpublic TestClass (string val)\n\t\t{\n\t\t\tthis.strVal = val;\n\t\t}\n\t\t\n\t\tpublic static TestClass makeFromString (String str)\n\t\t{\n\t\t\treturn new TestClass (str);\n\t\t}\n\t\t\n//\t\tbool? nb2 = null;\n//\t\t\n//\t\tpublic bool? NullableBool {\n//\t\t\tget { return nb2; }\n//\t\t\tset { nb2 = value; }\n//\t\t}\n\t\t\n\t\tTestStruct s = new TestStruct ();\n\t\t\n\t\tpublic TestStruct Struct {\n\t\t\tget { return s; }\n\t\t\tset { s = (TestStruct)value; }\n\t\t}\n\t\t\n\t\tpublic int testval {\n\t\t\tget {\n\t\t\t\treturn this.val;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tthis.val = value;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic string teststrval {\n\t\t\tget {\n\t\t\t\treturn this.strVal;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tthis.strVal = value;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic int this [int index] {\n\t\t\tget { return 1; }\n\t\t\tset { }\n\t\t}\n\t\t\n\t\tpublic int this [string index] {\n\t\t\tget { return 1; }\n\t\t\tset { }\n\t\t}\n\t\t\n//\t\tpublic TimeSpan? NullableMethod (TimeSpan? input)\n//\t\t{\n//\t\t\treturn input;\n//\t\t}\n//\t\t\n//\t\tpublic int? NullableMethod2 (int? input)\n//\t\t{\n//\t\t\treturn input;\n//\t\t}\n\t\t\n\t\tpublic object TestLuaFunction (LuaFunction func)\n\t\t{\n\t\t\tif (func != null) {\n\t\t\t\treturn func.call (1, 2);\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\tpublic int sum (int x, int y)\n\t\t{\n\t\t\treturn x + y;\n\t\t}\n\t\t\n\t\tpublic void setVal (int newVal)\n\t\t{\n\t\t\tval = newVal;\n\t\t}\n\t\t\n\t\tpublic void setVal (string newVal)\n\t\t{\n\t\t\tstrVal = newVal;\n\t\t}\n\t\t\n\t\tpublic int getVal ()\n\t\t{\n\t\t\treturn val;\n\t\t}\n\t\t\n\t\tpublic string getStrVal ()\n\t\t{\n\t\t\treturn strVal;\n\t\t}\n\t\t\n\t\tpublic int outVal (out int val)\n\t\t{\n\t\t\tval = 5;\n\t\t\treturn 3;\n\t\t}\n\t\t\n\t\tpublic int outVal (out int val, int val2)\n\t\t{\n\t\t\tval = 5;\n\t\t\treturn val2;\n\t\t}\n\t\t\n\t\tpublic int outVal (int val, ref int val2)\n\t\t{\n\t\t\tval2 = val + val2;\n\t\t\treturn val;\n\t\t}\n\t\t\n\t\tpublic int outValMutiple (int arg, out string arg2, out string arg3)\n\t\t{\n\t\t\targ2 = Guid.NewGuid ().ToString ();\n\t\t\targ3 = Guid.NewGuid ().ToString ();\n\t\t\t\n\t\t\treturn arg;\n\t\t}\n\t\t\n\t\tpublic int callDelegate1 (TestDelegate1 del)\n\t\t{\n\t\t\treturn del (2, 3);\n\t\t}\n\t\t\n\t\tpublic int callDelegate2 (TestDelegate2 del)\n\t\t{\n\t\t\tint a = 3;\n\t\t\tint b = del (2, out a);\n\t\t\treturn a + b;\n\t\t}\n\t\t\n\t\tpublic int callDelegate3 (TestDelegate3 del)\n\t\t{\n\t\t\tint a = 3;\n\t\t\tdel (2, ref a);\n\t\t\t//Debug.Log(a);\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic int callDelegate4 (TestDelegate4 del)\n\t\t{\n\t\t\treturn del (2, 3).testval;\n\t\t}\n\t\t\n\t\tpublic int callDelegate5 (TestDelegate5 del)\n\t\t{\n\t\t\treturn del (new TestClass (2), new TestClass (3));\n\t\t}\n\t\t\n\t\tpublic int callDelegate6 (TestDelegate6 del)\n\t\t{\n\t\t\tTestClass test = new TestClass ();\n\t\t\tint a = del (2, out test);\n\t\t\treturn a + test.testval;\n\t\t}\n\t\t\n\t\tpublic int callDelegate7 (TestDelegate7 del)\n\t\t{\n\t\t\tTestClass test = new TestClass (3);\n\t\t\tdel (2, ref test);\n\t\t\treturn test.testval;\n\t\t}\n\t\t\n\t\tpublic int callInterface1 (ITest itest)\n\t\t{\n\t\t\treturn itest.test1 (2, 3);\n\t\t}\n\t\t\n\t\tpublic int callInterface2 (ITest itest)\n\t\t{\n\t\t\tint a = 3;\n\t\t\tint b = itest.test2 (2, out a);\n\t\t\treturn a + b;\n\t\t}\n\t\t\n\t\tpublic int callInterface3 (ITest itest)\n\t\t{\n\t\t\tint a = 3;\n\t\t\titest.test3 (2, ref a);\n\t\t\t//Debug.Log(a);\n\t\t\treturn a;\n\t\t}\n\t\t\n\t\tpublic int callInterface4 (ITest itest)\n\t\t{\n\t\t\treturn itest.test4 (2, 3).testval;\n\t\t}\n\t\t\n\t\tpublic int callInterface5 (ITest itest)\n\t\t{\n\t\t\treturn itest.test5 (new TestClass (2), new TestClass (3));\n\t\t}\n\t\t\n\t\tpublic int callInterface6 (ITest itest)\n\t\t{\n\t\t\tTestClass test = new TestClass ();\n\t\t\tint a = itest.test6 (2, out test);\n\t\t\treturn a + test.testval;\n\t\t}\n\t\t\n\t\tpublic int callInterface7 (ITest itest)\n\t\t{\n\t\t\tTestClass test = new TestClass (3);\n\t\t\titest.test7 (2, ref test);\n\t\t\treturn test.testval;\n\t\t}\n\t\t\n\t\tpublic int callInterface8 (ITest itest)\n\t\t{\n\t\t\titest.intProp = 3;\n\t\t\treturn itest.intProp;\n\t\t}\n\t\t\n\t\tpublic int callInterface9 (ITest itest)\n\t\t{\n\t\t\titest.refProp = new TestClass (3);\n\t\t\treturn itest.refProp.testval;\n\t\t}\n\t\t\n\t\tpublic void exceptionMethod ()\n\t\t{\n\t\t\tthrow new Exception (\"exception test\");\n\t\t}\n\t\t\n\t\tpublic virtual int overridableMethod (int x, int y)\n\t\t{\n\t\t\treturn x + y;\n\t\t}\n\t\t\n\t\tpublic static int callOverridable (TestClass test, int x, int y)\n\t\t{\n\t\t\treturn test.overridableMethod (x, y);\n\t\t}\n\t\t\n\t\tint IFoo1.foo ()\n\t\t{\n\t\t\treturn 3;\n\t\t}\n\t\t\n\t\tpublic int foo ()\n\t\t{\n\t\t\treturn 5;\n\t\t}\n\t\t\n\t\tprivate void _PrivateMethod ()\n\t\t{\n\t\t\tDebug.Log (\"Private method called\");\n\t\t}\n\t\t\n\t\tpublic int MethodOverload ()\n\t\t{\n\t\t\tDebug.Log (\"Method with no params\");\n\t\t\treturn 1;\n\t\t}\n\t\t\n\t\tpublic int MethodOverload (TestClass testClass)\n\t\t{\n\t\t\tDebug.Log (\"Method with testclass param\");\n\t\t\treturn 2;\n\t\t}\n\n\t\tpublic int MethodOverload (Type type)\n\t\t{\n\t\t\tDebug.Log (\"Method with testclass param\");\n\t\t\treturn 3;\n\t\t}\n\t\t\n\t\tpublic int MethodOverload (int i, int j, int k)\n\t\t{\n\t\t\tDebug.Log (\"Overload without out param: \" + i + \", \" + j + \", \" + k);\n\t\t\treturn 4;\n\t\t}\n\t\t\n\t\tpublic int MethodOverload (int i, int j, out int k)\n\t\t{\n\t\t\tk = 5;\n\t\t\tDebug.Log (\"Overload with out param\" + i + \", \" + j);\n\t\t\treturn 5;\n\t\t}\n\t\t\n\t\tpublic void Print(object format,params object[] args)\n\t\t{\n\t\t\t//just for test,this is not printf implements\n\t\t\tvar output = format.ToString() + \"\\t\";\n\t\t\tforeach(var msg in args)\n\t\t\t{\n\t\t\t\toutput += msg.ToString() + \"\\t\";\n\t\t\t}\n\t\t\tDebug.Log(output);\n\t\t}\n\t\t\n\t\tstatic public int MethodWithParams (int a, params int[] others) {\n\t\t\tDebug.Log (a);\n\t\t\tint i = 0;\n\t\t\tforeach (int val in others) {\n\t\t\t\tDebug.Log (val);\n\t\t\t\ti++;\n\t\t\t}\n\t\t\treturn i;\n\t\t}\n\n\t\tpublic bool TestType(Type t)\n\t\t{\n\t\t\treturn this.GetType() == t;\n\t\t}\n\t}\n\t\n\tpublic class TestClassWithOverloadedMethod\n\t{\n\t\tpublic int CallsToStringFunc {get;set;}\n\t\tpublic int CallsToIntFunc {get;set;}\n\t\tpublic void Func (string param)\n\t\t{\n\t\t\tCallsToStringFunc++;\n\t\t}\n\t\t\n\t\tpublic void Func (int param)\n\t\t{\n\t\t\tCallsToIntFunc++;\n\t\t}\n\t\t\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/test/TestLua.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 8c465f2bd458f4cfdbaa43196a245446\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/test/test.cs",
    "content": "﻿/*\nNLua License\n--------------------\n\nNLua is licensed under the terms of the MIT license reproduced below.\nThis mean that NLua is free software and can be used for both academic and\ncommercial purposes at absolutely no cost.\n\n===============================================================================\n\nCopyright (C) 2013 - Vinicius Jarina (viniciusjarina@gmail.com)\nCopyright (C) 2012 Megax <http://megax.yeahunter.hu/>\nCopyright (C) 2003-2005 Fabio Mascarenhas de Queiroz.\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n===============================================================================\n*/\n\nusing UnityEngine;\nusing System.Collections.Generic;\nusing System.Collections;\nusing System.Reflection;\nusing System.Threading;\nusing System;\nusing SLua;\nusing NLuaTest.Mock;\n\nclass Assert{\n\tpublic static void True(bool v)\n\t{\n\t\tIsTrue(v);\n\t}\n\tpublic static void IsTrue(bool v)\n\t{\n\t\tif (!v) {\n\t\t\tthrow new Exception(\"not true\");\n\t\t}\n\t}\n\n\tpublic static void AreEqual(object a, object b, string extra = \"\")\n\t{\n\t\tif (!object.Equals(a,b)) {\n\t\t\tthrow new Exception(a + \" != \" + b + \", \" + extra);\n\t\t}\n\t}\n\n\tpublic static void AreNotEqual(object a, object b)\n\t{\n\t\tif (object.Equals (a, b)) {\n\t\t\tthrow new Exception(a + \" == \" + b);\n\t\t}\n\t}\n}\npublic class test : MonoBehaviour {\n\n\tprivate LuaSvr l;\n\tvoid Start()\n\t{\n\t\tl = new LuaSvr();\n\t\tl.init(null, () =>{\n\t\t\tLuaTests t = new LuaTests();\n\t\t\tt.lua = l.luaState;\n\t\t\tt.lua.doString (\"TestClass=NLuaTest.Mock.TestClass\");\n\n\t\t\tMethodInfo[] methods = t.GetType().GetMethods(BindingFlags.Instance | BindingFlags.Public | BindingFlags.DeclaredOnly);\n\n\t\t\tint pass = 0;\n\t\t\tint failed = 0;\n\n\t\t\tint i = 0;\n\t\t\tforeach(MethodInfo m in methods)\n\t\t\t{\n\t\t\t\t++i;\n\t\t\t\ttry{\n\t\t\t\t\tDebug.Log(\"start test: \" + m.Name);\n\t\t\t\t\tm.Invoke(t, null);\n\t\t\t\t\t++pass;\n\t\t\t\t}catch(Exception e)\n\t\t\t\t{\n\t\t\t\t\t++failed;\n\t\t\t\t\tDebug.LogError(\"[\" + i + \"] test failed: \" + m.Name + \", e: \"  + e);\n\t\t\t\t}\n\t\t\t}\n\t\t\tDebug.Log(\"test done. pass: \" + pass + \", failed: \" + failed);\n\t\t});\n\t}\n\n\t\n\tpublic class LuaTests\n\t{\n\t\tpublic LuaState lua;\n\n\t\t/*\n        * Tests capturing an exception\n        */\n\t\tpublic void ThrowException ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"err,errMsg=pcall(test.exceptionMethod,test)\");\n\t\t\tAssert.AreEqual (false , lua [\"err\"]);\n\n//\t\t\tException errMsg = (Exception)lua [\"errMsg\"];\n\n//\t\t\tAssert.AreNotEqual (null, errMsg.InnerException);\n//\t\t\tAssert.AreEqual (\"exception test\", errMsg.InnerException.Message);\n\t\t}\n\t\t\n\t\t/*\n\t\t* Tests passing a LuaFunction\n\t\t*/\n\t\tpublic void CallLuaFunction()\n\t\t{\n\t\t\tlua.doString (\"function someFunc(v1,v2) return v1 + v2 end\");\n\t\t\tlua [\"funcObject\"] = lua.getFunction (\"someFunc\");\n\n\t\t\tlua.doString (\"b = TestClass():TestLuaFunction(funcObject)\");\n\t\t\tAssert.AreEqual (3d, lua [\"b\"]);\n\n//\t\t\tlua.doString (\"a = TestClass():TestLuaFunction(nil)\");\n//\t\t\tAssert.AreEqual (null, lua [\"a\"]);\n\t\t}\n\t\t\n\t\t/*\n        * Tests capturing an exception\n        */\n//\t\tpublic void ThrowUncaughtException ()\n//\t\t{\n//\t\t\n//\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\t\n//\t\t\ttry {\n//\t\t\t\tlua.doString (\"test:exceptionMethod()\");\n//\t\t\t\t//failed\n//\t\t\t\tAssert.AreEqual(false, true);\n//\t\t\t} catch (Exception) {\n//\t\t\t\t//passed\n//\t\t\t\tAssert.AreEqual (true, true);\n//\t\t\t}\n//\t\t}\n\t\t\n\t\t\n\t\t/*\n        * Tests nullable fields\n        */\n//\t\tpublic void TestNullable ()\n//\t\t{\n//\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\tlua.doString (\"val=test.NullableBool\");\n//\t\t\tAssert.AreEqual (null, (object)lua [\"val\"]);\n//\t\t\tlua.doString (\"test.NullableBool = true\");\n//\t\t\tlua.doString (\"val=test.NullableBool\");\n//\t\t\tAssert.AreEqual (true, lua [\"val\"]);\n//\t\t}\n\t\t\n\t\t/*\n        * Tests structure assignment\n        */\n\t\tpublic void TestStructs ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"TestStruct=NLuaTest.Mock.TestStruct\");\n\t\t\tlua.doString (\"struct=TestStruct(2)\");\n\t\t\tlua.doString (\"test.Struct = struct\");\n\t\t\tlua.doString (\"val=test.Struct.val\");\n\t\t\tAssert.AreEqual (2d, (double)lua [\"val\"]);\n\t\t}\n\n\t\t/*\n\t\t* Tests structure creation via the default constructor\n\t\t*/\n//\t\tpublic void TestStructDefaultConstructor ()\n//\t\t{\n//\t\t\tlua.doString (\"TestStruct=NLuaTest.Mock.TestStruct\");\n//\t\t\tlua.doString (\"struct=TestStruct()\");\n//\t\t\tAssert.AreEqual (new TestStruct(), (TestStruct)lua [\"struct\"]);\n//\t\t}\n\n\t\tpublic void TestStructHashesEqual()\n\t\t{\n\t\t\tlua.doString(\"TestStruct=NLuaTest.Mock.TestStruct\");\n\t\t\tlua.doString(\"struct1=TestStruct(0)\");\n\t\t\tlua.doString(\"struct2=TestStruct(0)\");\n\t\t\tlua.doString(\"struct2.val=1\");\n\t\t\tAssert.AreEqual(0d, (double)lua[\"struct1.val\"]);\n\t\t}\n\n\t\tpublic void TestEnumEqual()\n\t\t{\n\t\t\tlua.doString(\"TestEnum=NLuaTest.Mock.TestEnum\");\n\t\t\tlua.doString(\"enum1=TestEnum.ValueA\");\n\t\t\tlua.doString(\"enum2=TestEnum.ValueB\");\n\t\t\tAssert.AreEqual(true, (bool)lua.doString(\"return enum1 ~= enum2\"));\n\t\t\tAssert.AreEqual(false, (bool)lua.doString(\"return enum1 == enum2\"));\n\t\t}\n\n\t\tpublic void TestMethodOverloads ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a1 = test:MethodOverload()\");\n\t\t\tlua.doString (\"a2 = test:MethodOverload(test)\");\n\t\t\tlua.doString (\"a3 = test:MethodOverload(TestClass)\");\n\t\t\tlua.doString (\"a31 = test:MethodOverload(test:GetType())\");\n\t\t\tlua.doString (\"a32 = test:MethodOverload(NLuaTest.Mock.TestClass2():GetType())\");\n\t\t\tlua.doString (\"a4 = test:MethodOverload(1,1,1)\");\n\t\t\tlua.doString (\"a5, i = test:MethodOverload(2,2,Slua.out)\\r\\n\");\n\t\t\tAssert.AreEqual(1d, lua[\"a1\"]);\n\t\t\tAssert.AreEqual(2d, lua[\"a2\"]);\n\t\t\tAssert.AreEqual(3d, lua[\"a3\"]);\n\t\t\tAssert.AreEqual(3d, lua[\"a31\"]);\n\t\t\tAssert.AreEqual(3d, lua[\"a32\"]);\n\t\t\tAssert.AreEqual(4d, lua[\"a4\"]);\n\t\t\tAssert.AreEqual(5d, lua[\"a5\"]);\n\t\t\tAssert.AreEqual(5d, lua[\"i\"]);\n\n\t\t}\n\n\t\tpublic void TestDispose ()\n\t\t{\n\t\t\tSystem.GC.Collect ();\n\t\t\tlong startingMem = System.Diagnostics.Process.GetCurrentProcess ().WorkingSet64;\n\t\t\t\n\t\t\tfor (int i = 0; i < 100; i++) {\n\t\t\t\t\n\t\t\t\t\t_Calc (lua, i);\n\t\t\t}\n\t\t\t\n\t\t\t//TODO: make this test assert so that it is useful\n\t\t\tDebug.Log (\"Was using \" + (startingMem / 1024 / 1024) + \"MB, now using: \" + (System.Diagnostics.Process.GetCurrentProcess ().WorkingSet64 / 1024 / 1024) + \"MB\");\n\t\t}\n\t\t\n\t\tprivate void _Calc (LuaState lua, int i)\n\t\t{\n\t\t\tlua.doString (\n\t\t\t\t\"sqrt = math.sqrt;\" +\n\t\t\t\t\"sqr = function(x) return math.pow(x,2); end;\" +\n\t\t\t\t\"log = math.log;\" +\n\t\t\t\t\"log10 = math.log10;\" +\n\t\t\t\t\"exp = math.exp;\" +\n\t\t\t\t\"sin = math.sin;\" +\n\t\t\t\t\"cos = math.cos;\" +\n\t\t\t\t\"tan = math.tan;\" +\n\t\t\t\t\"abs = math.abs;\"\n\t\t\t\t);\n\t\t\tlua.doString (\"function calcVP(a,b) return a+b end\");\n\t\t\tLuaFunction lf = lua.getFunction (\"calcVP\");\n\t\t\tlf.call (i, 20);\n\t\t}\n\t\t\n\n\t\t// public void TestThreading ()\n\t\t// {\n\t\t// \tobject lua_locker = new object ();\n\t\t// \tDoWorkClass doWork = new DoWorkClass ();\n\t\t// \t\n\t\t// \tbool failureDetected = false;\n\t\t// \tint completed = 0;\n\t\t// \tint iterations = 10;\n\t\t// \t\n\t\t// \tfor (int i = 0; i < iterations; i++) {\n\t\t// \t\tThreadPool.QueueUserWorkItem (new WaitCallback (delegate (object o) {\n\t\t// \t\t\ttry {\n\t\t// \t\t\t\tlock (lua_locker) {\n\t\t// \t\t\t\t\tlua.doString (\"dowork()\");\n\t\t// \t\t\t\t}\n\t\t// \t\t\t} catch (Exception e) {\n\t\t// \t\t\t\tConsole.Write (e);\n\t\t// \t\t\t\tfailureDetected = true;\n\t\t// \t\t\t}\n\t\t// \t\t\t\n\t\t// \t\t\tcompleted++;\n\t\t// \t\t}));\n\t\t// \t}\n\t\t// \t\n\t\t// \twhile (completed < iterations && !failureDetected)\n\t\t// \t\tThread.Sleep (50);\n\t\t// \t\n\t\t// \tAssert.AreEqual (false, failureDetected);\n\t\t// }\n\t\t\n\t\t// public void TestPrivateMethod ()\n\t\t// {\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \t\n\t\t// \ttry {\n\t\t// \t\tlua.doString (\"test:_PrivateMethod()\");\n\t\t// \t} catch {\n\t\t// \t\tAssert.AreEqual (true, true);\n\t\t// \t\treturn;\n\t\t// \t}\n\t\t// \t\n\t\t// \tAssert.AreEqual(true, false);\n\t\t// }\n\n//\t\t/*\n//       * Tests functions\n//       */\n//\t\tpublic void TestFunctions ()\n//\t\t{\n//\t\t\tlua.RegisterFunction (\"p\", null, typeof(System.Console).GetMethod (\"WriteLine\", new Type [] { typeof(String) }));\n//\t\t\t/// Lua command that works (prints to console)\n//\t\t\tlua.doString (\"p('Foo')\");\n//\t\t\t/// Yet this works...\n//\t\t\tlua.doString (\"string.gsub('some string', '(%w+)', function(s) p(s) end)\");\n//\t\t\t/// This fails if you don't fix Lua5.1 lstrlib.c/add_value to treat LUA_TUSERDATA the same as LUA_FUNCTION\n//\t\t\tlua.doString (\"string.gsub('some string', '(%w+)', p)\");\n//\t\t}\n//\t\t\n//\t\t\n\t\t/*\n        * Tests making an object from a Lua table and calling one of\n        * methods the table overrides.\n        */\n\t\t// public void LuaTableOverridedMethod ()\n\t\t// {\n\t\t// \tlua.doString (\"test={}\");\n\t\t// \tlua.doString (\"function test:overridableMethod(x,y) return x*y; end\");\n\t\t// \tlua.doString (\"luanet.make_object(test,'NLuaTest.Mock.TestClass')\");\n\t\t// \tlua.doString (\"a=TestClass.callOverridable(test,2,3)\");\n\t\t// \tint a = (int)lua[\"a\"];\n\t\t// \tlua.doString (\"luanet.free_object(test)\");\n\t\t// \tAssert.AreEqual (6, a);\n\t\t// }\n\t\t\n\t\t\n\t\t/*\n        * Tests making an object from a Lua table and calling a method\n        * the table does not override.\n        */\n//\t\tpublic void LuaTableInheritedMethod ()\n//\t\t{\n//\t\t\tlua.doString (\"test={}\");\n//\t\t\tlua.doString (\"function test:overridableMethod(x,y) return x*y; end\");\n//\t\t\tlua.doString (\"luanet.make_object(test,'NLuaTest.Mock.TestClass')\");\n//\t\t\tlua.doString (\"test:setVal(3)\");\n//\t\t\tlua.doString (\"a=test.testval\");\n//\t\t\tint a = (int)lua[\"a\"];\n//\t\t\tlua.doString (\"luanet.free_object(test)\");\n//\t\t\tAssert.AreEqual (3, a);\n//\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n\n\t\t/// <summary>\n\t\t/// Basic multiply method which expects 2 floats\n\t\t/// </summary>\n\t\t/// <param name=\"val\"></param>\n\t\t/// <param name=\"val2\"></param>\n\t\t/// <returns></returns>\n\t\tprivate float _TestException (float val, float val2)\n\t\t{\n\t\t\treturn val * val2;\n\t\t}\n\t\t\n//\t\tclass LuaEventArgsHandler : NLua.Method.LuaDelegate\n//\t\t{\n//\t\t\tvoid CallFunction (object sender, EventArgs eventArgs)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {sender, eventArgs };\n//\t\t\t\tobject [] inArgs = new object [] { sender, eventArgs };\n//\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\tbase.CallFunction (args, inArgs, outArgs);\n//\t\t\t}\n//\t\t}\n//\t\t\n\n//\t\tpublic void TestEventException ()\n//\t\t{\n//\t\t\t\n//\t\t\t\t//Register a C# function\n//\t\t\t\tMethodInfo testException = this.GetType ().GetMethod (\"_TestException\", BindingFlags.NonPublic | BindingFlags.Public | BindingFlags.DeclaredOnly | BindingFlags.Instance, null, new Type [] {\n//\t\t\t\t\ttypeof(float),\n//\t\t\t\t\ttypeof(float)\n//\t\t\t\t}, null);\n//\t\t\t\tlua.RegisterFunction (\"Multiply\", this, testException);\n//\t\t\t\tlua.RegisterLuaDelegateType (typeof(EventHandler<EventArgs>), typeof(LuaEventArgsHandler));\n//\t\t\t\t//create the lua event handler code for the entity\n//\t\t\t\t//includes the bad code!\n//\t\t\t\tlua.doString (\"function OnClick(sender, eventArgs)\\r\\n\" +\n//\t\t\t\t              \"--Multiply expects 2 floats, but instead receives 2 strings\\r\\n\" +\n//\t\t\t\t              \"Multiply(asd, es)\\r\\n\" +\n//\t\t\t\t              \"end\");\n//\t\t\t\t//create the lua event handler code for the entity\n//\t\t\t\t//good code\n//\t\t\t\t//lua.doString(\"function OnClick(sender, eventArgs)\\r\\n\" +\n//\t\t\t\t//              \"--Multiply expects 2 floats\\r\\n\" +\n//\t\t\t\t//              \"Multiply(2, 50)\\r\\n\" +\n//\t\t\t\t//            \"end\");\n//\t\t\t\t//Create the event handler script\n//\t\t\t\tlua.doString (\"function SubscribeEntity(e)\\r\\ne.Clicked:Add(OnClick)\\r\\nend\");\n//\t\t\t\t//Create the entity object\n//\t\t\t\tEntity entity = new Entity ();\n//\t\t\t\t//Register the entity object with the event handler inside lua\n//\t\t\t\tLuaFunction lf = lua.getFunction (\"SubscribeEntity\");\n//\t\t\t\tlf.Call (new object [1] { entity });\n//\t\t\t\t\n//\t\t\t\ttry {\n//\t\t\t\t\t//Cause the event to be fired\n//\t\t\t\t\tentity.Click ();\n//\t\t\t\t\t//failed\n//\t\t\t\t\tAssert.AreEqual(true, false);\n//\t\t\t\t} catch (LuaException) {\n//\t\t\t\t\t//passed\n//\t\t\t\t\tAssert.AreEqual (true, true);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t}\n//\t\t\n\n\t\tpublic void TestExceptionWithChunkOverload ()\n\t\t{\t\t\t\n\t\t\ttry {\n\t\t\t\tlua.doString (\"thiswillthrowanerror\", \"MyChunk\");\n\t\t\t} catch (Exception e) {\n\t\t\t\tAssert.AreEqual (true, e.Message.StartsWith (\"[string \\\"MyChunk\\\"]\"));\n\t\t\t}\n\t\t}\n//\t\t\n\n//\t\tpublic void TestGenerics ()\n//\t\t{\n//\t\t\t//Im not sure support for generic classes is possible to implement, see: http://msdn.microsoft.com/en-us/library/system.reflection.methodinfo.containsgenericparameters.aspx\n//\t\t\t//specifically the line that says: \"If the ContainsGenericParameters property returns true, the method cannot be invoked\"\n//\t\t\t//TestClassGeneric<string> genericClass = new TestClassGeneric<string>();\n//\t\t\t//lua.RegisterFunction(\"genericMethod\", genericClass, typeof(TestClassGeneric<>).GetMethod(\"GenericMethod\"));\n//\t\t\t//lua.RegisterFunction(\"regularMethod\", genericClass, typeof(TestClassGeneric<>).GetMethod(\"RegularMethod\"));\n//\t\t\t\n//\t\t\t\tTestClassWithGenericMethod classWithGenericMethod = new TestClassWithGenericMethod ();\n//\t\t\t\t\n//\t\t\t\t////////////////////////////////////////////////////////////////////////////\n//\t\t\t\t/// ////////////////////////////////////////////////////////////////////////\n//\t\t\t\t///  IMPORTANT: Use generic method with the type you will call or generic methods will fail with iOS\n//\t\t\t\t/// ////////////////////////////////////////////////////////////////////////\n//\t\t\t\tclassWithGenericMethod.GenericMethod<double>(99.0);\n//\t\t\t\tclassWithGenericMethod.GenericMethod<TestClass>(new TestClass (99));\n//\t\t\t\t////////////////////////////////////////////////////////////////////////////\n//\t\t\t\t/// ////////////////////////////////////////////////////////////////////////\n//\t\t\t\t\n//\t\t\t\tlua.RegisterFunction (\"genericMethod2\", classWithGenericMethod, typeof(TestClassWithGenericMethod).GetMethod (\"GenericMethod\"));\n//\t\t\t\t\n//\t\t\t\ttry {\n//\t\t\t\t\tlua.doString (\"genericMethod2(100)\");\n//\t\t\t\t} catch {\n//\t\t\t\t}\n//\t\t\t\t\n//\t\t\t\tAssert.AreEqual (true, classWithGenericMethod.GenericMethodSuccess);\n//\t\t\t\tAssert.AreEqual (true, classWithGenericMethod.Validate<double> (100)); //note the gotcha: numbers are all being passed to generic methods as doubles\n//\t\t\t\t\n//\t\t\t\ttry {\n//\t\t\t\t\t\n//\t\t\t\t\t\n//\t\t\t\t\tlua.doString (\"test=TestClass(56)\");\n//\t\t\t\t\tlua.doString (\"genericMethod2(test)\");\n//\t\t\t\t} catch {\n//\t\t\t\t}\n//\t\t\t\t\n//\t\t\t\tAssert.AreEqual (true, classWithGenericMethod.GenericMethodSuccess);\n//\t\t\t\tAssert.AreEqual (56, (classWithGenericMethod.PassedValue as TestClass).val);\n//\t\t\t}\n//\t\t}\n//\t\t\n\n//\t\tpublic void RegisterFunctionStressTest ()\n//\t\t{\n//\t\t\tconst int Count = 200;  // it seems to work with 41\n//\t\t\t\n//\t\t\t\tMyClass t = new MyClass ();\n//\t\t\t\t\n//\t\t\t\tfor (int i = 1; i < Count - 1; ++i) {\n//\t\t\t\t\tlua.RegisterFunction (\"func\" + i, t, typeof(MyClass).GetMethod (\"Func1\"));\n//\t\t\t\t}\n//\t\t\t\t\n//\t\t\t\tlua.RegisterFunction (\"func\" + (Count - 1), t, typeof(MyClass).GetMethod (\"Func1\"));\n//\t\t\t\tlua.doString (\"print(func1())\");\n//\t\t\t}\n//\t\t}\n//\t\t\n\n\t\tpublic void TestMultipleOutParameters ()\n\t\t{\t\t\t\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"a,b,c=netobj:outValMutiple(2)\");\n\t\t\tAssert.AreEqual (2d, lua[\"a\"]);\n\t\t\tAssert.AreNotEqual (null, lua[\"b\"]);\n\t\t\tAssert.AreNotEqual (null, lua[\"c\"]);\n\t\t}\n\t\t\n\n\t\t// public void TestLoadStringLeak ()\n\t\t// {\n\t\t// \t//Test to prevent stack overflow\n\t\t// \t//See: http://code.google.com/p/nlua/issues/detail?id=5\n\t\t// \t//number of iterations to test\n\t\t// \tint count = 1000;\n\t\t// \tfor (int i = 0; i < count; i++) {\n\t\t// \t\tlua.LoadString (\"abc = 'def'\", string.Empty);\n\t\t// \t}\n\t\t// \t//any thrown exceptions cause the test run to fail\n\t\t// }\n\t\t\n\n\t\t// public void TestLoadFileLeak ()\n\t\t// {\n\t\t// \t//Test to prevent stack overflow\n\t\t// \t//See: http://code.google.com/p/nlua/issues/detail?id=5\n\t\t// \t//number of iterations to test\n\t\t// \tint count = 1000;\n\t\t// \tfor (int i = 0; i < count; i++) {\n\t\t// \t\tlua.LoadFile (Environment.CurrentDirectory + System.IO.Path.DirectorySeparatorChar + \"test.lua\");\n\t\t// \t}\n\t\t// \t//any thrown exceptions cause the test run to fail\n\t\t// }\n\t\t\n\n//\t\tpublic void TestRegisterFunction ()\n//\t\t{\n//\t\t\t\tlua.RegisterFunction (\"func1\", null, typeof(TestClass2).GetMethod (\"func\"));\n//\t\t\t\tobject[] vals1 = lua.getFunction (\"func1\").Call (2, 3);\n//\t\t\t\tAssert.AreEqual (5.0f, Convert.ToSingle (vals1 [0]));\n//\t\t\t\tTestClass2 obj = new TestClass2 ();\n//\t\t\t\tlua.RegisterFunction (\"func2\", obj, typeof(TestClass2).GetMethod (\"funcInstance\"));\n//\t\t\t\tvals1 = lua.getFunction (\"func2\").Call (2, 3);\n//\t\t\t\tAssert.AreEqual (5.0f, Convert.ToSingle (vals1 [0]));\n//\t\t\t}\n//\t\t}\n//\t\t\n//\t\t/*\n//\t\t * Tests passing a null object as a parameter to a\n//\t\t * method that accepts a nullable.\n//\t\t */\n//\t\tpublic void TestNullableParameter ()\n//\t\t{\n//\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\tlua.doString (\"a = test:NullableMethod(nil)\");\n//\t\t\tAssert.AreEqual (null, lua [\"a\"]);\n//\t\t\tlua [\"timeVal\"] = TimeSpan.FromSeconds (5);\n//\t\t\tlua.doString (\"b = test:NullableMethod(timeVal)\");\n//\t\t\tAssert.AreEqual (TimeSpan.FromSeconds (5), lua [\"b\"]);\n//\t\t\tlua.doString (\"d = test:NullableMethod2(2)\");\n//\t\t\tAssert.AreEqual (2, lua [\"d\"]);\n//\t\t\tlua.doString (\"c = test:NullableMethod2(nil)\");\n//\t\t\tAssert.AreEqual (null, lua [\"c\"]);\n//\t\t}\n\t\t\n\t\t/*\n        * Tests if DoString is correctly returning values\n        */\n\n\t\tpublic void DoString ()\n\t\t{\n\t\t\tobject[] res = (object[])lua.doString (\"a=2\\nreturn a,3\");\n\t\t\t//Debug.Log(\"a=\"+res[0]+\", b=\"+res[1]);\n\t\t\tAssert.AreEqual (res [0], 2d);\n\t\t\tAssert.AreEqual (res [1], 3d);\n\t\t}\n\n\t\t/*\n        * Tests getting of global numeric variables\n        */\n\t\tpublic void GetGlobalNumber ()\n\t\t{\n\t\t\tlua.doString (\"a=2\");\n\t\t\tAssert.AreEqual (lua[\"a\"], 2d);\n\t\t}\n\n\t\t/*\n        * Tests setting of global numeric variables\n        */\n\t\tpublic void SetGlobalNumber ()\n\t\t{\n\t\t\tlua.doString (\"a=2\");\n\t\t\tlua [\"a\"] = 3;\n\t\t\tAssert.AreEqual (lua [\"a\"], 3d);\n\t\t}\n\t\t/*\n        * Tests getting of numeric variables from tables\n        * by specifying variable path\n        */\n\t\tpublic void GetNumberInTable ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], 2d);\n\t\t}\n\n\t\t/*\n        * Tests setting of numeric variables from tables\n        * by specifying variable path\n        */\n\n\t\tpublic void SetNumberInTable ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tlua [\"a.b.c\"] = 3;\n\t\t\tAssert.AreEqual (lua [\"a.b.c\"], 3d);\n\t\t}\n\n\t\t/*\n        * Tests getting of global string variables\n        */\n\n\t\tpublic void GetGlobalString ()\n\t\t{\n\t\t\tlua.doString (\"a=\\\"test\\\"\");\n\t\t\tAssert.AreEqual (lua[\"a\"], \"test\");\n\t\t}\n\t\t/*\n        * Tests setting of global string variables\n        */\n\n\t\tpublic void SetGlobalString ()\n\t\t{\t\t\n\t\t\tlua.doString (\"a=\\\"test\\\"\");\n\t\t\tlua [\"a\"] = \"new test\";\n\t\t\tAssert.AreEqual (lua [\"a\"], \"new test\");\n\t\t}\n\n\t\t/*\n        * Tests getting of string variables from tables\n        * by specifying variable path\n        */\n\t\tpublic void GetStringInTable ()\n\t\t{\n\t\t\t\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], \"test\");\n\t\t}\n\n\t\t/*\n        * Tests setting of string variables from tables\n        * by specifying variable path\n        */\n\t\tpublic void SetStringInTable ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tlua [\"a.b.c\"] = \"new test\";\n\t\t\tAssert.AreEqual (lua [\"a.b.c\"], \"new test\");\n\t\t}\n\t\t\n\t\t/*\n        * Tests getting and setting of global table variables\n        */\n\t\tpublic void GetAndSetTable ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=2}}\\nb={c=3}\");\n\t\t\tLuaTable tab = lua.getTable (\"b\");\n\t\t\tlua [\"a.b\"] = tab;\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], 3d);\n\t\t}\n\n\t\t/*\n        * Tests getting of numeric field of a table\n        */\n\t\tpublic void GetTableNumericField1 ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a.b\");\n\t\t\tdouble num = (double)tab [\"c\"];\n\t\t\tAssert.AreEqual (num, 2d);\n\t\t}\n\n\t\t/*\n        * Tests getting of numeric field of a table\n        * (the field is inside a subtable)\n        */\n\t\tpublic void GetTableNumericField2 ()\n\t\t{\t\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a\");\n\t\t\tdouble num = (double)tab [\"b.c\"];\n\t\t\t//Debug.Log(\"a.b.c=\"+num);\n\t\t\tAssert.AreEqual (num, 2d);\n\t\t}\n\t\t\n\t\t/*\n        * Tests setting of numeric field of a table\n        */\n\t\tpublic void SetTableNumericField1 ()\n\t\t{\t\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a.b\");\n\t\t\ttab [\"c\"] = 3;\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], 3d);\n\t\t}\n\t\t\n\t\t/*\n        * Tests setting of numeric field of a table\n        * (the field is inside a subtable)\n        */\n\t\tpublic void SetTableNumericField2 ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=2}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a\");\n\t\t\ttab [\"b.c\"] = 3;\n\t\t\tAssert.AreEqual (tab [\"b.c\"], 3d);\n\t\t}\n\t\t\n\t\t/*\n        * Tests getting of string field of a table\n        */\n\t\tpublic void GetTableStringField1 ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a.b\");\n\t\t\tstring str = (string)tab [\"c\"];\n\t\t\tAssert.AreEqual (str, \"test\");\n\t\t}\n\n\t\t/*\n        * Tests getting of string field of a table\n        * (the field is inside a subtable)\n        */\n\t\tpublic void GetTableStringField2 ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a\");\n\t\t\tstring str = (string)tab [\"b.c\"];\n\t\t\t//Debug.Log(\"a.b.c=\"+str);\n\t\t\tAssert.AreEqual (str, \"test\");\n\t\t}\n\n\t\t/*\n        * Tests setting of string field of a table\n        */\n\t\tpublic void SetTableStringField1 ()\n\t\t{\t\t\t\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a.b\");\n\t\t\ttab [\"c\"] = \"new test\";\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], \"new test\");\n\t\t}\n\t\t\n\t\t/*\n        * Tests setting of string field of a table\n        * (the field is inside a subtable)\n        */\n\t\tpublic void SetTableStringField2 ()\n\t\t{\t\t\t\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a\");\n\t\t\ttab [\"b.c\"] = \"new test\";\n\t\t\tAssert.AreEqual (lua[\"a.b.c\"], \"new test\");\n\t\t}\n\n\t\t/*\n        * Tests calling of a global function with zero arguments\n        */\n\t\tpublic void CallGlobalFunctionNoArgs ()\n\t\t{\t\t\n\t\t\tlua.doString (\"a=2\\nfunction f()\\na=3\\nend\");\n\t\t\tlua.getFunction (\"f\").call ();\n\t\t\tAssert.AreEqual (lua[\"a\"], 3d);\n\t\t}\n\n\t\t/*\n        * Tests calling of a global function with one argument\n        */\n\t\tpublic void CallGlobalFunctionOneArg ()\n\t\t{\t\t\t\n\t\t\tlua.doString (\"a=2\\nfunction f(x)\\na=a+x\\nend\");\n\t\t\tlua.getFunction (\"f\").call (1);\n\t\t\tAssert.AreEqual (lua[\"a\"], 3d);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of a global function with two arguments\n        */\n\t\tpublic void CallGlobalFunctionTwoArgs ()\n\t\t{\n\t\t\tlua.doString (\"a=2\\nfunction f(x,y)\\na=x+y\\nend\");\n\t\t\tlua.getFunction (\"f\").call (1, 3);\n\t\t\t//Debug.Log(\"a=\"+num);\n\t\t\tAssert.AreEqual (lua[\"a\"], 4d);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of a global function that returns one value\n        */\n\t\tpublic void CallGlobalFunctionOneReturn ()\n\t\t{\n\t\t\tlua.doString (\"function f(x)\\nreturn x+2\\nend\");\n\t\t\tobject ret = lua.getFunction (\"f\").call (3);\n\t\t\tAssert.AreEqual (5d, ret);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of a global function that returns two values\n        */\n\t\tpublic void CallGlobalFunctionTwoReturns ()\n\t\t{\n\t\t\tlua.doString (\"function f(x,y)\\nreturn x,x+y\\nend\");\n\t\t\tobject[] ret = (object[])lua.getFunction (\"f\").call (3, 2);\n\t\t\t//Debug.Log(\"ret=\"+ret[0]+\",\"+ret[1]);\n\t\t\tAssert.AreEqual (2, ret.Length);\n\t\t\tAssert.AreEqual (3d, (double)ret [0]);\n\t\t\tAssert.AreEqual (5d, (double)ret [1]);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of a function inside a table\n        */\n\t\tpublic void CallTableFunctionTwoReturns ()\n\t\t{\n\t\t\tlua.doString (\"a={}\\nfunction a.f(x,y)\\nreturn x,x+y\\nend\");\n\t\t\tobject[] ret = (object[])lua.getFunction (\"a.f\").call (3, 2);\n\t\t\t//Debug.Log(\"ret=\"+ret[0]+\",\"+ret[1]);\n\t\t\tAssert.AreEqual (2, ret.Length);\n\t\t\tAssert.AreEqual (3d, (double)ret [0]);\n\t\t\tAssert.AreEqual (5d, (double)ret [1]);\n\t\t}\n\t\t\n\t\t/*\n        * Tests setting of a global variable to a CLR object value\n        */\n\t\tpublic void SetGlobalObject ()\n\t\t{\t\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.testval = 4;\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tobject o = lua [\"netobj\"];\n\t\t\tAssert.AreEqual (true, o is TestClass);\n\t\t\tTestClass t2 = (TestClass)lua [\"netobj\"];\n\t\t\tAssert.AreEqual (t2.testval, 4);\n\t\t\tAssert.AreEqual (t1 , t2);\n\t\t}\n\n\t\t/*\n\t\t* Tests if CLR object is being correctly collected by Lua\n\t\t*/\n\t\tpublic void GarbageCollection()\n\t\t{\n\t\t\tObjectCache oc = ObjectCache.get(lua.L);\n\t\t\tDictionary<object, int> objMap = (Dictionary<object, int>)oc.GetType ()\n\t\t\t\t.GetField (\"objMap\", BindingFlags.Instance| BindingFlags.NonPublic).GetValue(oc);\n\t\t\tAssert.True(objMap != null);\n\n\t        TestClass t1 = new TestClass();\n\t        t1.testval = 4;\n\t        lua[\"netobj\"] = t1;\n\t        \n\t\t\tAssert.True(objMap.ContainsKey(t1));\n\t        \n\t\t\tlua.doString(\"netobj=nil;collectgarbage();\");\n\n\t\t\tAssert.True(!objMap.ContainsKey(t1));\n\t\t }\n\n\t\t/*\n        * Tests setting of a table field to a CLR object value\n        */\n\t\tpublic void SetTableObjectField1 ()\n\t\t{\n\t\t\tlua.doString (\"a={b={c=\\\"test\\\"}}\");\n\t\t\tLuaTable tab = lua.getTable (\"a.b\");\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.testval = 4;\n\t\t\ttab [\"c\"] = t1;\n\t\t\tTestClass t2 = (TestClass)lua [\"a.b.c\"];\n\t\t\t//Debug.Log(\"a.b.c=\"+t2.testval);\n\t\t\tAssert.AreEqual (4, t2.testval);\n\t\t\tAssert.AreEqual (t1 , t2);\n\t\t}\n\t\t\n\t\t/*\n        * Tests reading and writing of an object's field\n        */\n\t\tpublic void AccessObjectField ()\n\t\t{\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.val = 4;\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"var=netobj.val\");\n\t\t\tdouble var = (double)lua [\"var\"];\n\t\t\tAssert.AreEqual (4d, var);\n\t\t\tlua.doString (\"netobj.val=3\");\n\t\t\tAssert.AreEqual (3, t1.val);\n\t\t}\n\t\t\n\t\t/*\n        * Tests reading and writing of an object's non-indexed\n        * property\n        */\n\t\tpublic void AccessObjectProperty ()\n\t\t{\t\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.testval = 4;\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"var=netobj.testval\");\n\t\t\tdouble var = (double)lua [\"var\"];\n\t\t\t//Debug.Log(\"value from Lua=\"+var);\n\t\t\tAssert.AreEqual (4d, var);\n\t\t\tlua.doString (\"netobj.testval=3\");\n\t\t\tAssert.AreEqual (3, t1.testval);\n\t\t\t//Debug.Log(\"new val (from Lua)=\"+t1.testval);\n\t\t}\n\n\t\tpublic void AccessObjectStringProperty ()\n\t\t{\t\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.teststrval = \"This is a string test\";\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"var=netobj.teststrval\");\n\t\t\tstring var = (string)lua [\"var\"];\n\t\t\t\n\t\t\tAssert.AreEqual (\"This is a string test\", var);\n\t\t\tlua.doString (\"netobj.teststrval='Another String'\");\n\t\t\tAssert.AreEqual (\"Another String\", t1.teststrval);\n\t\t\t//Debug.Log(\"new val (from Lua)=\"+t1.testval);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of an object's method with no overloads\n        */\n\t\tpublic void CallObjectMethod ()\n\t\t{\t\t\t\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tt1.testval = 4;\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"netobj:setVal(3)\");\n\t\t\tAssert.AreEqual (3, t1.testval);\n\t\t\t//Debug.Log(\"new val(from C#)=\"+t1.testval);\n\t\t\tlua.doString (\"val=netobj:getVal()\");\n\t\t\tAssert.AreEqual (3d, lua[\"val\"]);\n\t\t\t//Debug.Log(\"new val(from Lua)=\"+val);\n\t\t}\n\t\t\n\t\t/*\n        * Tests calling of an object's method with overloading\n        */\n\t\tpublic void CallObjectMethodByType ()\n\t\t{\n\t\t\tTestClass t1 = new TestClass ();\n\t\t\tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"netobj:setVal('str')\");\n\t\t\tAssert.AreEqual (\"str\", t1.getStrVal ());\n\t\t\t//Debug.Log(\"new val(from C#)=\"+t1.getStrVal());\n\t\t}\n\n\t\t/*\n        * Tests calling of an object's method with no overloading\n        * and out parameters\n        */\n\t\t public void CallObjectMethodOutParam ()\n\t\t {\n\t\t \tTestClass t1 = new TestClass ();\n\t\t \tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"a,b=netobj:outVal(Slua.out)\");\n\t\t \tAssert.AreEqual (3d, lua[\"a\"]);\n\t\t \tAssert.AreEqual (5d, lua[\"b\"]);\n\t\t \t//Debug.Log(\"function returned (from lua)=\"+a+\",\"+b);\n\t\t }\n\n\t\t/*\n        * Tests calling of an object's method with overloading and\n        * out params\n        */\n\t\t public void CallObjectMethodOverloadedOutParam ()\n\t\t {\t\t\t\n\t\t \tTestClass t1 = new TestClass ();\n\t\t \tlua [\"netobj\"] = t1;\n\t\t\tlua.doString (\"a,b=netobj:outVal(Slua.out, 2)\");\n\t\t \tAssert.AreEqual (2d, lua[\"a\"]);\n\t\t \tAssert.AreEqual (5d, lua[\"b\"]);\n\t\t \t//Debug.Log(\"function returned (from lua)=\"+a+\",\"+b);\n\t\t }\n\n\t\t/*\n        * Tests calling of an object's method with ref params\n        */\n\t\t public void CallObjectMethodByRefParam ()\n\t\t {\t\t\t\n\t\t \tTestClass t1 = new TestClass ();\n\t\t \tlua [\"netobj\"] = t1;\n\t\t \tlua.doString (\"a,b=netobj:outVal(2,3)\");\n\t\t \tAssert.AreEqual (2d, lua[\"a\"]);\n\t\t \tAssert.AreEqual (5d, lua[\"b\"]);\n\t\t }\n\n\t\t/*\n        * Tests calling of two versions of an object's method that have\n        * the same name and signature but implement different interfaces\n        */\n//\t\t public void CallObjectMethodDistinctInterfaces ()\n//\t\t {\n//\t\t \tTestClass t1 = new TestClass ();\n//\t\t \tlua [\"netobj\"] = t1;\n//\t\t \tlua.doString (\"a=netobj:foo()\");\n//\t\t \tlua.doString (\"b=netobj['NLuaTest.Mock.IFoo1.foo']\");\n//\t\t \tAssert.AreEqual (5d, lua[\"a\"]);\n//\t\t \tAssert.AreEqual (1d, lua[\"b\"]);\n//\t\t }\n\n\t\t/*\n        * Tests instantiating an object with no-argument constructor\n        */\n\t\tpublic void CreateNetObjectNoArgsCons ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"test:setVal(3)\");\n\t\t\tTestClass test = (TestClass)lua.doString (\"return test\");\n\t\t\t//Debug.Log(\"returned: \"+test.testval);\n\t\t\tAssert.AreEqual (3, test.testval);\n\t\t}\n\t\t\n\t\t/*\n        * Tests instantiating an object with one-argument constructor\n        */\n\t\tpublic void CreateNetObjectOneArgCons ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass(3)\");\n\t\t\tTestClass test = (TestClass)lua.doString (\"return test\");\n\t\t\t//Debug.Log(\"returned: \"+test.testval);\n\t\t\tAssert.AreEqual (3, test.testval);\n\t\t}\n\t\t\n\t\t/*\n        * Tests instantiating an object with overloaded constructor\n        */\n\t\tpublic void CreateNetObjectOverloadedCons ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass('str')\");\n\t\t\tTestClass test = (TestClass)lua.doString (\"return test\");\n\t\t\t//Debug.Log(\"returned: \"+test.getStrVal());\n\t\t\tAssert.AreEqual (\"str\", test.getStrVal ());\n\t\t}\n\t\t\n\t\t/*\n        * Tests getting item of a CLR array\n        */\n\t\tpublic void ReadArrayField ()\n\t\t{\n\t\t\tstring[] arr = new string [] { \"str1\", \"str2\", \"str3\" };\n\t\t\tlua [\"netobj\"] = arr;\n\t\t\tlua.doString (\"val=netobj[1]\");\n\t\t\tAssert.AreEqual (\"str2\", lua[\"val\"]);\n\t\t\t//Debug.Log(\"new val(from array to Lua)=\"+val);\n\t\t}\n\n\t\t/*\n        * Tests setting item of a CLR array\n        */\n\t\tpublic void WriteArrayField ()\n\t\t{\t\t\t\n\t\t\tstring[] arr = new string [] { \"str1\", \"str2\", \"str3\" };\n\t\t\tlua [\"netobj\"] = arr;\n\t\t\tlua.doString (\"netobj[1]='test'\");\n\t\t\tAssert.AreEqual (\"test\", arr [1]);\n\t\t\t//Debug.Log(\"new val(from Lua to array)=\"+arr[1]);\n\t\t}\n\t\t\n\t\t/*\n        * Tests creating a new CLR array\n        */\n//\t\t public void CreateArray ()\n//\t\t {\n//\t\t \tlua.doString (\"arr=TestClass[3]\");\n//\t\t \tlua.doString (\"for i=0,2 do arr[i]=TestClass(i+1) end\");\n//\t\t \tTestClass[] arr = (TestClass[])lua [\"arr\"];\n//\t\t \tAssert.AreEqual (arr[1].testval, 2);\n//\t\t }\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with value-type arguments\n        */\n\t\tpublic void LuaDelegateValueTypes ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x,y) return x+y; end\");\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a=test:callDelegate1(func)\");\n\t\t\tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with value-type arguments and out params\n        */\n\t\tpublic void LuaDelegateValueTypesOutParam ()\n\t\t{\t\t\t\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x) return x,x*2; end\");\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a=test:callDelegate2(func)\");\n\t\t\tAssert.AreEqual (6d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with value-type arguments and ref params\n        * \n        */\n\t\tpublic void LuaDelegateValueTypesByRefParam ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x,y) return x+y; end\");\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a=test:callDelegate3(func)\");\n\t\t\tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with value-type arguments that returns a reference type\n        */\n\t\tpublic void LuaDelegateValueTypesReturnReferenceType ()\n\t\t{\t\t\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x,y) return TestClass(x+y); end\");\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a=test:callDelegate4(func)\");\n\t\t\tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with reference type arguments\n        */\n\t\tpublic void LuaDelegateReferenceTypes ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x,y) return x.testval+y.testval; end\");\n\t\t\tlua.doString (\"a=test:callDelegate5(func)\");\n\t\t\tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\t\t\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with reference type arguments and an out param\n        */\n\t\tpublic void LuaDelegateReferenceTypesOutParam ()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x) return x,TestClass(x*2); end\");\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"a=test:callDelegate6(func)\");\n\t\t\tAssert.AreEqual (6d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n\n\t\t/*\n        * Tests passing a Lua function to a delegate\n        * with reference type arguments and a ref param\n        */\n\t\tpublic void LuaDelegateReferenceTypesByRefParam ()\n\t\t{\t\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"function func(x,y) return TestClass(x+y.testval); end\");\n\t\t\tlua.doString (\"a=test:callDelegate7(func)\");\n\t\t\tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t\t//Debug.Log(\"delegate returned: \"+a);\n\t\t}\n//\t\t\n//\t\t\n//\t\t/*\n//        * Tests passing a Lua table as an interface and\n//        * calling one of its methods with value-type params\n//        */\n\n//\t\tpublic void NLuaAAValueTypes ()\n//\t\t{\n//\t\t\t\n//\t\t\t\tlua.RegisterLuaClassType (typeof(ITest), typeof(LuaITestClassHandler));\n//\t\t\t\t\n//\t\t\t\t\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:test1(x,y) return x+y; end\");\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"a=test:callInterface1(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (5, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t\t}\n//\t\t}\n\t\t/*\n        * Tests passing a Lua table as an interface and\n        * calling one of its methods with value-type params\n        * and an out param\n        */\n\t\t// public void NLuaValueTypesOutParam ()\n\t\t// {\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"itest={}\");\n\t\t// \tlua.doString (\"function itest:test2(x) return x,x*2; end\");\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"a=test:callInterface2(itest)\");\n\t\t// \tAssert.AreEqual (6d, lua[\"a\"]);\n\t\t// \t\t//Debug.Log(\"interface returned: \"+a);\n\t\t// }\n\n\t\t/*\n        * Tests passing a Lua table as an interface and\n        * calling one of its methods with value-type params\n        * and a ref param\n        */\n\t\t// public void NLuaValueTypesByRefParam ()\n\t\t// {\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"itest={}\");\n\t\t// \tlua.doString (\"function itest:test3(x,y) return x+y; end\");\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"a=test:callInterface3(itest)\");\n\t\t// \tAssert.AreEqual (5d, lua[\"a\"]);\n\t\t// \t//Debug.Log(\"interface returned: \"+a);\n\t\t// }\n\n\t\t/*\n        * Tests passing a Lua table as an interface and\n        * calling one of its methods with value-type params\n        * returning a reference type param\n        */\n\t\t// public void NLuaValueTypesReturnReferenceType ()\n\t\t// {\n\t\t// \t\t\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"itest={}\");\n\t\t// \tlua.doString (\"function itest:test4(x,y) return TestClass(x+y); end\");\n\t\t// \tlua.doString (\"test=TestClass()\");\n\t\t// \tlua.doString (\"a=test:callInterface4(itest)\");\n\t\t// \tint a = (int)lua[\"a\"];\n\t\t// \tAssert.AreEqual (5, a);\n\t\t// \t//Debug.Log(\"interface returned: \"+a);\n\t\t// }\n\n//\t\t /*\n//        * Tests passing a Lua table as an interface and\n//        * calling one of its methods with reference type params\n//        */\n//\t\tpublic void NLuaReferenceTypes ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:test5(x,y) return x.testval+y.testval; end\");\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"a=test:callInterface5(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (5, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n\n//\t\t /*\n//        * Tests passing a Lua table as an interface and\n//        * calling one of its methods with reference type params\n//        * and an out param\n//        */\n//\t\tpublic void NLuaReferenceTypesOutParam ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:test6(x) return x,TestClass(x*2); end\");\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"a=test:callInterface6(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (6, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n\n//\t\t/*\n//        * Tests passing a Lua table as an interface and\n//        * calling one of its methods with reference type params\n//        * and a ref param\n//        */\n//\t\tpublic void NLuaReferenceTypesByRefParam ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:test7(x,y) return TestClass(x+y.testval); end\");\n//\t\t\t\tlua.doString (\"a=test:callInterface7(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (5, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n//\t\t\n//\t\t\n//\t\t#region LUA_BOILERPLATE_CLASS\n//\t\t/*** This class is used to bind the .NET world with the Lua world, this boilerplate code is pratically the same, get values call Lua function return value back,\n//        * this class is usually dynamic generated using System.Reflection.Emit, but this will not work on iOS. */\n//\t\t\n//\t\tclass LuaTestClassHandler: TestClass, ILuaGeneratedType\n//\t\t{\n//\t\t\tpublic LuaTable __luaInterface_luaTable;\n//\t\t\tpublic Type[][] __luaInterface_returnTypes;\n//\t\t\t\n//\t\t\tpublic LuaTestClassHandler (LuaTable luaTable, Type[][] returnTypes)\n//\t\t\t{\n//\t\t\t\t__luaInterface_luaTable = luaTable;\n//\t\t\t\t__luaInterface_returnTypes = returnTypes;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic LuaTable LuaInterfaceGetLuaTable ()\n//\t\t\t{\n//\t\t\t\treturn __luaInterface_luaTable;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic override int overridableMethod (int x, int y)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\tx,\n//\t\t\t\t\ty\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\tx,\n//\t\t\t\t\ty\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [0];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"overridableMethod\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\treturn (int)ret;\n//\t\t\t}\n//\t\t}\n//\t\t\n//\t\tclass LuaITestClassHandler : ILuaGeneratedType, ITest\n//\t\t{\n//\t\t\tpublic LuaTable __luaInterface_luaTable;\n//\t\t\tpublic Type[][] __luaInterface_returnTypes;\n//\t\t\t\n//\t\t\tpublic LuaITestClassHandler (LuaTable luaTable, Type[][] returnTypes)\n//\t\t\t{\n//\t\t\t\t__luaInterface_luaTable = luaTable;\n//\t\t\t\t__luaInterface_returnTypes = returnTypes;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic LuaTable LuaInterfaceGetLuaTable ()\n//\t\t\t{\n//\t\t\t\treturn __luaInterface_luaTable;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic int intProp {\n//\t\t\t\tget {\n//\t\t\t\t\tobject [] args = new object [] { __luaInterface_luaTable };\n//\t\t\t\t\tobject [] inArgs = new object [] { __luaInterface_luaTable };\n//\t\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [0];\n//\t\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"get_intProp\");\n//\t\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\t\treturn (int)ret;\n//\t\t\t\t}\n//\t\t\t\tset {\n//\t\t\t\t\tint i = value;\n//\t\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t\t__luaInterface_luaTable ,\n//\t\t\t\t\t\ti\n//\t\t\t\t\t};\n//\t\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\t\ti\n//\t\t\t\t\t};\n//\t\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [1];\n//\t\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"set_intProp\");\n//\t\t\t\t\tNLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic TestClass refProp {\n//\t\t\t\tget {\n//\t\t\t\t\tobject [] args = new object [] { __luaInterface_luaTable };\n//\t\t\t\t\tobject [] inArgs = new object [] { __luaInterface_luaTable };\n//\t\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [2];\n//\t\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"get_refProp\");\n//\t\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\t\treturn (TestClass)ret;\n//\t\t\t\t}\n//\t\t\t\tset {\n//\t\t\t\t\tTestClass test = value;\n//\t\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t\t__luaInterface_luaTable ,\n//\t\t\t\t\t\ttest\n//\t\t\t\t\t};\n//\t\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\t\ttest\n//\t\t\t\t\t};\n//\t\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [3];\n//\t\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"set_refProp\");\n//\t\t\t\t\tNLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\t}\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic int test1 (int a, int b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [4];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test1\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\treturn (int)ret;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic int test2 (int a, out int b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\t0\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [5];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test2\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\tb = (int)args [1];\n//\t\t\t\treturn (int)ret;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic void test3 (int a, ref int b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [6];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test3\");\n//\t\t\t\tNLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\tb = (int)args [1];\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic TestClass test4 (int a, int b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [7];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test4\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\treturn (TestClass)ret;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic int test5 (TestClass a, TestClass b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [8];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test5\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\treturn (int)ret;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic int test6 (int a, out TestClass b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tnull\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { 1};\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [9];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test6\");\n//\t\t\t\tobject ret = NLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\tb = (TestClass)args [1];\n//\t\t\t\t\n//\t\t\t\treturn (int)ret;\n//\t\t\t}\n//\t\t\t\n//\t\t\tpublic void test7 (int a, ref TestClass b)\n//\t\t\t{\n//\t\t\t\tobject [] args = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tobject [] inArgs = new object [] {\n//\t\t\t\t\t__luaInterface_luaTable,\n//\t\t\t\t\ta,\n//\t\t\t\t\tb\n//\t\t\t\t};\n//\t\t\t\tint [] outArgs = new int [] { 1 };\n//\t\t\t\tType [] returnTypes = __luaInterface_returnTypes [10];\n//\t\t\t\tLuaFunction function = NLua.Method.LuaClassHelper.GetTableFunction (__luaInterface_luaTable, \"test7\");\n//\t\t\t\tNLua.Method.LuaClassHelper.CallFunction (function, args, returnTypes, inArgs, outArgs);\n//\t\t\t\tb = (TestClass)args [1];\n//\t\t\t}\n//\t\t}\n//\t\t#endregion\n//\t\t\n//\t\t/*\n//        * Tests passing a Lua table as an interface and\n//        * accessing one of its value-type properties\n//        */\n//\t\tpublic void NLuaValueProperty ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:get_intProp() return itest.int_prop; end\");\n//\t\t\t\tlua.doString (\"function itest:set_intProp(val) itest.int_prop=val; end\");\n//\t\t\t\tlua.doString (\"a=test:callInterface8(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (3, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n\n//\t\t /*\n//        * Tests passing a Lua table as an interface and\n//        * accessing one of its reference type properties\n//        */\n//\t\tpublic void NLuaReferenceProperty ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"itest={}\");\n//\t\t\t\tlua.doString (\"function itest:get_refProp() return TestClass(itest.int_prop); end\");\n//\t\t\t\tlua.doString (\"function itest:set_refProp(val) itest.int_prop=val.testval; end\");\n//\t\t\t\tlua.doString (\"a=test:callInterface9(itest)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tAssert.AreEqual (3, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t}\n//\t\t\n//\t\t\n//\t\t/*\n//        * Tests making an object from a Lua table and calling the base\n//        * class version of one of the methods the table overrides.\n//        */\n//\t\tpublic void LuaTableBaseMethod ()\n//\t\t{\n//\t\t\t\tlua.RegisterLuaClassType (typeof(TestClass), typeof(LuaTestClassHandler));\t\t\n//\t\t\t\tlua.doString (\"test={}\");\n//\t\t\t\tlua.doString (\"function test:overridableMethod(x,y) print(self[base]); return 6 end\");\n//\t\t\t\tlua.doString (\"luanet.make_object(test,'NLuaTest.Mock.TestClass')\");\n//\t\t\t\tlua.doString (\"a=TestClass.callOverridable(test,2,3)\");\n//\t\t\t\tint a = (int)lua[\"a\"];\n//\t\t\t\tlua.doString (\"luanet.free_object(test)\");\n//\t\t\t\tAssert.AreEqual (6, a);\n//\t\t\t\t//                 \n//\t\t\t\t//                 lua.doString(\"TestClass=NLuaTest.Mock.TestClass')\");\n//\t\t\t\t//                 lua.doString(\"test={}\");\n//\t\t\t\t//\n//\t\t\t\t//                 lua.doString(\"luanet.make_object(test,'NLuaTest.Mock.TestClass')\");\n//\t\t\t\t//                              lua.doString (\"function test.overridableMethod(test,x,y) return 2*test.base.overridableMethod(test,x,y); end\");\n//\t\t\t\t//                 lua.doString(\"a=TestClass.callOverridable(test,2,3)\");\n//\t\t\t\t//                 int a = (int)lua.GetNumber(\"a\");\n//\t\t\t\t//                 lua.doString(\"luanet.free_object(test)\");\n//\t\t\t\t//                 Assert.AreEqual(10, a);\n//\t\t\t\t//Debug.Log(\"interface returned: \"+a);\n//\t\t\t}\n//\t\t}\n//\t\t/*\n//        * Tests getting an object's method by its signature\n//        * (from object)\n//        */\n\n//\t\tpublic void GetMethodBySignatureFromObj ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"setMethod=luanet.get_method_bysig(test,'setVal','System.String')\");\n//\t\t\t\tlua.doString (\"setMethod('test')\");\n//\t\t\t\tTestClass test = (TestClass)lua [\"test\"];\n//\t\t\t\tAssert.AreEqual (\"test\", test.getStrVal ());\n//\t\t\t\t//Debug.Log(\"interface returned: \"+test.getStrVal());\n//\t\t\t}\n//\t\t}\n\n//\t\t/*\n//        * Tests getting an object's method by its signature\n//        * (from type)\n//        */\n//\t\tpublic void GetMethodBySignatureFromType ()\n//\t\t{\n//\t\t\t\tlua.doString (\"test=TestClass()\");\n//\t\t\t\tlua.doString (\"setMethod=luanet.get_method_bysig(TestClass,'setVal','System.String')\");\n//\t\t\t\tlua.doString (\"setMethod(test,'test')\");\n//\t\t\t\tTestClass test = (TestClass)lua [\"test\"];\n//\t\t\t\tAssert.AreEqual (\"test\", test.getStrVal ());\n//\t\t\t\t//Debug.Log(\"interface returned: \"+test.getStrVal());\n//\t\t}\n//\t\t/*\n//        * Tests getting a type's method by its signature\n//        */\n\n//\t\tpublic void GetStaticMethodBySignature ()\n//\t\t{\n//\t\t\t\tlua.doString (\"make_method=luanet.get_method_bysig(TestClass,'makeFromString','System.String')\");\n//\t\t\t\tlua.doString (\"test=make_method('test')\");\n//\t\t\t\tTestClass test = (TestClass)lua [\"test\"];\n//\t\t\t\tAssert.AreEqual (\"test\", test.getStrVal ());\n//\t\t\t\t//Debug.Log(\"interface returned: \"+test.getStrVal());\n//\t\t}\n\n//\t\t/*\n//        * Tests getting an object's constructor by its signature\n//        */\n//\t\tpublic void GetConstructorBySignature ()\n//\t\t{\t\t\n//\t\t\t\tlua.doString (\"test_cons=luanet.get_constructor_bysig(TestClass,'System.String')\");\n//\t\t\t\tlua.doString (\"test=test_cons('test')\");\n//\t\t\t\tTestClass test = (TestClass)lua [\"test\"];\n//\t\t\t\tAssert.AreEqual (\"test\", test.getStrVal ());\n//\t\t\t\t//Debug.Log(\"interface returned: \"+test.getStrVal());\n//\t\t\t}\n//\t\t}\n//\t\t\n\n\t\tpublic void TestVarargs()\n\t\t{\n\t\t\tlua.doString (\"test=TestClass()\");\n\t\t\tlua.doString (\"test:Print('this will pass')\");\n\t\t\tlua.doString (\"test:Print('this will ','fail')\");\n\t\t}\n\n\t\t// public void TestCtype ()\n\t\t// {\n\t\t// \t\n\t\t// \tlua.doString (\"import'System'\");\n\t\t// \tvar x  = lua.doString (\"return luanet.ctype(String)\");\n\t\t// \tAssert.AreEqual (x, typeof(String), \"#1 String ctype test\");\n\t\t// }\n\t\t\n\n\t\tpublic void TestPrintChars ()\n\t\t{\n\t\t\tlua.doString (@\"print(\"\"waüäq?=()[&]ß\"\")\");\n\t\t\tAssert.IsTrue (true);\n\t\t}\n\n\t\tpublic void TestUnicodeChars ()\n\t\t{\n\t\t\tlua.doString (\"UnicodeClass = NLuaTest.Mock.UnicodeClass\");\n\t\t\tlua.doString (\"res = UnicodeClass.UnicodeString\");\n\t\t\tstring res = (string)lua [\"res\"];\n\t\t\t\n\t\t\tAssert.AreEqual (UnicodeClass.UnicodeString, res);\n\t\t}\n\n\t\t// public void TestCoroutine ()\n\t\t// {\n\t\t// \tlua.doString (\n\t\t// \t\t\"func = NLuaTest.Mock.TestClass2.func;\" +\n\t\t// \t\t\"function yielder() \" +\n\t\t// \t\t\t\"a=1;\" +\n\t\t// \t\t\t\"coroutine.yield();\" +\n\t\t// \t\t\t\"func(3,2);\" +\n\t\t// \t\t\t\"coroutine.yield();\" + // This line triggers System.NullReferenceException\n\t\t// \t\t\t\"a=2;\" +\n\t\t// \t\t\t\"coroutine.yield();\" +\n\t\t// \t\t\"end;\" +\n\t\t// \t\t\"co_routine = coroutine.create(yielder);\" +\n\t\t// \t\t\"while coroutine.resume(co_routine) do end;\");\n\t\t// \t//Debug.Log(\"a=\"+num);\n\t\t// \tAssert.AreEqual (lua[\"a\"], 2d);\n\t\t// }\n\n//\t\tpublic void TestDebugHook ()\n//\t\t{\n//\t\t\tint [] lines = { 1, 2, 1, 3 };\n//\t\t\tint line = 0;\n//\t\t\t\tlua.DebugHook += (sender,args) => {\n//\t\t\t\t\tAssert.AreEqual (args.LuaDebug.currentline,lines [line]);\n//\t\t\t\t\tline ++;\n//\t\t\t\t};\n//\t\t\t\tlua.SetDebugHook (NLua.Event.EventMasks.LUA_MASKLINE, 0);\n//\t\t\t\t\n//\t\t\t\tlua.doString (@\"function testing_hooks() return 10 end\n//\t\t\t\t\t\t\tval = testing_hooks() \n//\t\t\t\t\t\t\tval = val + 1\");\n//\t\t}\n//\t\t\n\n//\t\tpublic void TestKeyWithDots ()\n//\t\t{\t\t\t\n//\t\t\tlua.doString (@\"g_dot = {} \n//\t\t\t\t\t\t g_dot['key.with.dot'] = 42\");\n//\t\t\t\n//\t\t\tAssert.AreEqual (42, (int)(double)lua [\"g_dot.key\\\\.with\\\\.dot\"]);\n//\t\t}\n\t\t\n//\t\tpublic void TestOperatorAdd ()\n//\t\t{\n//\t\t\tvar a = new System.Numerics.Complex (10, 0);\n//\t\t\tvar b = new System.Numerics.Complex (0, 3);\n//\t\t\tvar x = a + b;\n//\t\t\t\n//\t\t\tlua [\"a\"] = a;\n//\t\t\tlua [\"b\"] = b;\n//\t\t\tvar res = lua.doString (@\"return a + b\");\n//\t\t\tAssert.AreEqual (x, res);\n//\t\t}\n//\n//\t\tpublic void TestOperatorMinus ()\n//\t\t{\t\n//\t\t\tvar a = new System.Numerics.Complex (10, 0);\n//\t\t\tvar b = new System.Numerics.Complex (0, 3);\n//\t\t\tvar x = a - b;\n//\t\t\t\n//\t\t\tlua [\"a\"] = a;\n//\t\t\tlua [\"b\"] = b;\n//\t\t\tvar res = lua.doString (@\"return a - b\") ;\n//\t\t\tAssert.AreEqual (x, res);\n//\t\t}\n//\t\t\n//\t\tpublic void TestOperatorMultiply ()\n//\t\t{\n//\t\t\tvar a = new System.Numerics.Complex (10, 0);\n//\t\t\tvar b = new System.Numerics.Complex (0, 3);\n//\t\t\tvar x = a * b;\n//\t\t\t\n//\t\t\tlua [\"a\"] = a;\n//\t\t\tlua [\"b\"] = b;\n//\t\t\tvar res = lua.doString (@\"return a * b\") ;\n//\t\t\tAssert.AreEqual (x, res);\n//\t\t}\n//\t\t\n//\t\tpublic void TestOperatorEqual ()\n//\t\t{\t\t\t\n//\t\t\tvar a = new System.Numerics.Complex (10, 0);\n//\t\t\tvar b = new System.Numerics.Complex (0, 3);\n//\t\t\tvar x = a == b;\n//\t\t\t\n//\t\t\tlua [\"a\"] = a;\n//\t\t\tlua [\"b\"] = b;\n//\t\t\tvar res = lua.doString (@\"return a == b\");\n//\t\t\tAssert.AreEqual (x, res);\n//\t\t}\n//\t\t\n//\n//\t\tpublic void TestOperatorNotEqual ()\n//\t\t{\n//\t\t\tvar a = new System.Numerics.Complex (10, 0);\n//\t\t\tvar b = new System.Numerics.Complex (0, 3);\n//\t\t\tvar x = a != b;\n//\t\t\t\n//\t\t\tlua [\"a\"] = a;\n//\t\t\tlua [\"b\"] = b;\n//\t\t\tvar res = lua.doString (@\"return a ~= b\") ;\n//\t\t\tAssert.AreEqual (x, res);\n//\t\t}\n\n\t\t// public void TestUnaryMinus ()\n\t\t// {\t\n\t\t// \t\n\t\t// \tlua.doString (@\" import ('System.Numerics')\n\t\t// \t\t\t\t  c = Complex (10, 5) \n\t\t// \t\t\t\t  c = -c \");\n\t\t// \t\n\t\t// \tvar expected = new System.Numerics.Complex (-10, -5);\n\t\t// \t\n\t\t// \tvar res = lua [\"c\"];\n\t\t// \tAssert.AreEqual (expected, res);\n\t\t// }\n\t\t// #endif\n\n\t\tpublic void TestCaseFields ()\n\t\t{\t\t\t\n\t\t\tlua.doString (@\"\n\t\t\t\t\t\t  x = NLuaTest.Mock.TestCaseName()\n\t\t\t\t\t\t  name  = x.name;\n\t\t\t\t\t\t  name2 = x.Name;\n\t\t\t\t\t\t  Name = x.Name;\n\t\t\t\t\t\t  Name2 = x.name\");\n\t\t\t\n\t\t\tAssert.AreEqual (\"name\", lua [\"name\"]);\n\t\t\tAssert.AreEqual (\"**name**\", lua [\"name2\"]);\n\t\t\tAssert.AreEqual (\"**name**\", lua [\"Name\"]);\n\t\t\tAssert.AreEqual (\"name\", lua [\"Name2\"]);\n\t\t}\n\t\t\n\n\t\tpublic void TestStaticOperators ()\n\t\t{\t\n\t\t\tlua.doString (@\"\n\t\t\t\t\t\t  v = NLuaTest.Mock.Vector()\n\t\t\t\t\t\t  v.x = 10\n\t\t\t\t\t\t  v.y = 3\n\t\t\t\t\t\t  v = v*2 \");\n\t\t\t\n\t\t\tvar v = (Vector)lua [\"v\"];\n\t\t\t\n\t\t\tAssert.AreEqual (20d, v.x, \"#1\");\n\t\t\tAssert.AreEqual (6d, v.y, \"#2\");\n\t\t\t\n\t\t\t// lua.doString (@\" x = 2 * v\");\n\t\t\t// var x = (Vector)lua [\"x\"];\n\t\t\t\n\t\t\t// Assert.AreEqual (40d, x.x, \"#3\");\n\t\t\t// Assert.AreEqual (12d, x.y, \"#4\");\n\t\t}\t\n\n\t\t// public void TestExtensionMethods ()\n\t\t// {\t\t\n\t\t// \tlua.doString (@\"\n\t\t// \t\t\t\t  v = NLuaTest.Mock.Vector()\n\t\t// \t\t\t\t  v.x = 10\n\t\t// \t\t\t\t  v.y = 3\n\t\t// \t\t\t\t  v = v*2 \");\n\t\t// \t\n\t\t// \tvar v = (Vector)lua [\"v\"];\n\t\t// \t\n\t\t// \tdouble len = v.Length ();\n\t\t// \tlua.doString (\" v:Length() \");\n\t\t// \tlua.doString (@\" len2 = v:Length()\");\n\t\t// \tdouble len2 = (double)lua [\"len2\"];\n\t\t// \tAssert.AreEqual (len, len2, \"#1\");\n\t\t// }\n\n\t\t public void TestOverloadedMethods ()\n\t\t {\n\t \t\tvar obj = new TestClassWithOverloadedMethod ();\n\t \t\tlua [\"obj\"] = obj;\n\t \t\tlua.doString (@\" \n\t \t\t\t\t\t\tobj:Func (10)\n\t \t\t\t\t\t\tobj:Func ('10')\n\t \t\t\t\t\t\tobj:Func (10)\n\t \t\t\t\t\t\tobj:Func ('10')\n\t \t\t\t\t\t\tobj:Func (10)\n\t \t\t\t\t\t\t\");\n\t \t\tAssert.AreEqual (3, obj.CallsToIntFunc,\"#integer\");\n\t \t\tAssert.AreEqual (2, obj.CallsToStringFunc, \"#string\");\n\t\t }\n\n\t\t// public void TestGetStack ()\n\t\t// {\n\t\t// \tm_lua = lua;\n\t\t// \tlua.doString (@\" \n\t\t// \t\timport ('NLuaTest')\n\t\t// \t\tfunction f1 ()\n\t\t// \t\t\t f2 ()\n\t\t// \t\t end\n\t\t// \t\t \n\t\t// \t\tfunction f2()\n\t\t// \t\t\tf3()\n\t\t// \t\tend\n\t\t// \n\t\t// \t\tfunction f3()\n\t\t// \t\t\tLuaTests.func()\n\t\t// \t\tend\n\t\t// \t\t\n\t\t// \t\tf1 ()\n\t\t// \t\");\n\t\t// \tm_lua = null;\n\t\t// }\n//\t\t\n//\t\tpublic static void func()\n//\t\t{\n//\t\t\t#if USE_KOPILUA\n//\t\t\tstring expected = \"[0] [C]:-1 -- func [field]\\n[1] [string \\\"chunk\\\"]:12 -- f3 [global]\\n[2] [string \\\"chunk\\\"]:8 -- f2 [global]\\n[3] [string \\\"chunk\\\"]:4 -- f1 [global]\\n[4] [string \\\"chunk\\\"]:15 -- <unknow> []\\n\";\n//\t\t\tKopiLua.LuaDebug info = new KopiLua.LuaDebug ();\n//\t\t\t#else\n//\t\t\t//string expected = \"[0] func:-1 -- <unknown> [func]\\n[1] f3:12 -- <unknown> [f3]\\n[2] f2:8 -- <unknown> [f2]\\n[3] f1:4 -- <unknown> [f1]\\n[4] :15 --  []\\n\";\n//\t\t\tKeraLua.LuaDebug info = new KeraLua.LuaDebug ();\n//\t\t\t#endif\n//\t\t\t\n//\t\t\tint level = 0;\n//\t\t\tStringBuilder sb = new StringBuilder ();\n//\t\t\twhile (m_lua.GetStack (level,ref info) != 0) {\n//\t\t\t\tm_lua.GetInfo (\"nSl\", ref info);\n//\t\t\t\tstring name = \"<unknow>\";\n//\t\t\t\tif (info.name != null && !string.IsNullOrEmpty(info.name.ToString()))\n//\t\t\t\t\tname = info.name.ToString ();\n//\t\t\t\t\n//\t\t\t\tsb.AppendFormat (\"[{0}] {1}:{2} -- {3} [{4}]\\n\",\n//\t\t\t\t                 level, info.shortsrc, info.currentline,\n//\t\t\t\t                 name, info.namewhat);\n//\t\t\t\t++level;\n//\t\t\t}\n//\t\t\tstring x = sb.ToString ();\n//\t\t\tAssert.True (!string.IsNullOrEmpty(x));\n//\t\t}\n//\t\t\n\n\t\t// public void TestCallImplicitBaseMethod ()\n\t\t// {\n\t\t// \tlua.doString (\"testClass3 = NLuaTest.Mock.testClass3\");\n\t\t// \tlua.doString (\"res = testClass3.read() \");\n\t\t// \tstring res = (string)lua [\"res\"];\n\t\t// \tAssert.AreEqual (testClass3.read (), res);\n\t\t// }\n\t\t\n\n//\t\tpublic void TestPushLuaFunctionWhenReadingDelegateProperty ()\n//\t\t{\n//\t\t\tbool called = false;\n//\t\t\tvar _model = new DefaultElementModel ();\n//\t\t\t_model.DrawMe = (x) => {\n//\t\t\t\tcalled = true;\n//\t\t\t};\n//\t\t\t\n//\t\t\tlua [\"model\"] = _model;\n//\t\t\tlua.doString (@\" model.DrawMe (0) \");\n//\t\t\t\n//\t\t\tAssert.True (called);\n//\t\t}\n\t\t\n\n//\t\t public void TestCallDelegateWithParameters ()\n//\t\t {\n//\t\t \tstring sval = \"\";\n//\t\t \tint nval = 0;\n//\t\t \t\n//\t\t\tAction<int, string> c = (n, s) => { sval = s; nval = n; };\n//\t\t \tlua [\"d\"] = c;\n//\t\t\tlua.doString (\" d (10, 'string') \");\n//\t\t \t\n//\t\t \tAssert.AreEqual (\"string\", sval, \"#1\");\n//\t\t \tAssert.AreEqual (10 , nval, \"#2\");\n//\t\t }\n\t\t\n\n//\t\tpublic void TestCallSimpleDelegate ()\n//\t\t{\n//\t\t\tbool called = false;\n//\n//\t\t\tAction c = () => { called = true; };\n//\t\t\tlua [\"d\"] = c;\n//\t\t\tlua.doString (\" d () \");\n//\t\t\t\n//\t\t\tAssert.True (called);\n//\t\t}\n\n//\t\tpublic void TestCallDelegateWithWrongParametersShouldFail ()\n//\t\t{\n//\t\t\tbool fail = false;\n//\t\t\tAction c = () => { fail = false; };\n//\t\t\tlua [\"d\"] = c;\n//\t\t\ttry {\n//\t\t\t\tlua.doString (\" d (10) \");\n//\t\t\t}\n//\t\t\tcatch (Exception ) {\n//\t\t\t\tfail = true;\n//\t\t\t}\n//\t\t\t\n//\t\t\tAssert.True (fail);\n//\t\t}\n\t\t\n\n\t\tpublic void TestOverloadedMethodCallOnBase ()\n\t\t{\n\t\t\tlua.doString (\"parameter = NLuaTest.Mock.parameter\");\n\t\t\tlua.doString (@\"\n\t\t\t\ttestClass3 = NLuaTest.Mock.testClass3\n\t\t\t\tp=parameter()\n\t\t\t\t-- r1 = testClass3.read(p)     -- is not working. it is also not working if the method in base class has two parameters instead of one\n\t\t\t\tr2 = testClass3.read(1)     -- is working\t\t\t\t\n\t\t\t\");\n\t\t\t// string r1 = (string) lua [\"r1\"];\n\t\t\tstring r2 = (string) lua [\"r2\"];\n\t\t\t// Assert.AreEqual (\"parameter-field1\", r1, \"#1\");\n\t\t\tAssert.AreEqual (\"int-test\" , r2, \"#2\");\n\t\t}\t\n\n\t\tpublic void TestCallMethodWithParams2 ()\n\t\t{\n\t\t\tlua.doString (@\"\t\t\t\t\t\n\t\t\t\tr = TestClass.MethodWithParams(2)\t\t\t\n\t\t\t\");\n\t\t\tAssert.AreEqual (0d, lua[\"r\"], \"#1\");\n\t\t}\n\n\t\tpublic void TestPassType()\n\t\t{\n\t\t\tTestClass o = new TestClass ();\n\t\t\tType t = o.GetType();\n\t\t\tAssert.True (t == typeof(NLuaTest.Mock.TestClass));\n\t\t\tAssert.True (t != typeof(Type));\n\t\t\tAssert.True (t.GetType() == typeof(Type).GetType());\n\n\t\t\tlua.doString (@\"\n\t\t\t\tTestClass=NLuaTest.Mock.TestClass\n\t\t\t\tt = TestClass()\n\t\t\t\tr1 = t:TestType(t:GetType())\n\t\t\t\tr2 = t:TestType(TestClass)\n\t\t\t\");\n\t\t\tAssert.True ((bool)lua [\"r1\"]);\n\t\t\tAssert.True ((bool)lua [\"r2\"]);\n\t\t}\n\n//\t\tstatic Lua m_lua;\n\t\t\n\t}\n}\n"
  },
  {
    "path": "Assets/Slua/example/test/test.cs.meta",
    "content": "fileFormatVersion: 2\nguid: 79c4ed45b58f2416fb77da896214b93c\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/test/test.unity.meta",
    "content": "fileFormatVersion: 2\nguid: 7020251aed1be414aaa7351d3781bb94\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/test.meta",
    "content": "fileFormatVersion: 2\nguid: 7e3c66330dad643fda430bcb5bf776e9\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/valuetype_test.unity.meta",
    "content": "fileFormatVersion: 2\nguid: 4132054ddf9a16f49ba0cba518a29c4f\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example/varobj.unity.meta",
    "content": "fileFormatVersion: 2\nguid: c05c3bee60105384bac680aa9bddf444\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua/example.meta",
    "content": "fileFormatVersion: 2\nguid: cad67713b7240514d9bc4d4406c52777\nfolderAsset: yes\nDefaultImporter:\n  userData: \n"
  },
  {
    "path": "Assets/Slua.meta",
    "content": "fileFormatVersion: 2\r\nguid: d96e028c097762940a9c9f5c8c5e204c\r\nfolderAsset: yes\r\nDefaultImporter:\r\n  userData: \r\n"
  },
  {
    "path": "Assets/StreamingAssets.meta",
    "content": "fileFormatVersion: 2\nguid: dae9b6b434cf52d4782c22c0c32ac902\nfolderAsset: yes\ntimeCreated: 1463889511\nlicenseType: Free\nDefaultImporter:\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"
  },
  {
    "path": "LICENSE",
    "content": "The MIT License (MIT)\r\n\r\nCopyright (c) 2014 Lingjijian [B-y]\r\n\r\n342854406@qq.com\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\nSOFTWARE."
  },
  {
    "path": "ProjectSettings/ProjectVersion.txt",
    "content": "m_EditorVersion: 5.6.0f3\n"
  },
  {
    "path": "README.md",
    "content": "基于ugui组件封装，高级控件库uLui\r\n====\r\n![](picture/photo1.png)\r\n![](picture/photo2.png)\r\n特性\r\n-------  \r\n### 组件LWidget\r\n1.LScrollView 滑动层<br>\r\n2.LRichLabel 可复用的富文本<br>\r\n3.LControlView 摇杆控件<br>\r\n4.LGridView 网格容器<br>\r\n5.LGridPageView 网格翻页容器<br>\r\n6.LMovieClip 序列帧控件<br>\r\n7.LPageView 翻页容器<br>\r\n8.LButton 长按按钮<br>\r\n9.LListView 复用列表<br>\r\n10.LLabelAtlas 图集字<br>\r\n11.LTableView 复用表<br>\r\n12.LHUDView hud容器<br>\r\n13.LSlider 滑块<br>\r\n14.LProgress 进度条<br>\r\n15.LExpandListView 可折叠列表<br>\r\n16.LDragView 拖拽控件<br>\r\n17.LSwitch 切换条<br>\r\n18.LInputField 抬起输入框<br>\r\n\r\n### 窗体LWindow\r\n1.自动管理窗体层次<br>\r\n2.窗体回收和缓存<br>\r\n3.窗体逻辑跟控件解耦<br>\r\n\r\n### 多线程网络库\r\n整合protobuff\r\n\r\n### 若干小工具\r\n1.热更模块<br>\r\n2.打包ab<br>\r\n3.使用texturepacker图集<br>\r\n\r\n### 整合Slua\r\n1.已经可以用纯lua开发了哦 <br>\r\n\r\n### 运行\r\n①普通测试<br>\r\n双击运行 Assets/Resources/Scenes/start 场景即可<br>\r\n②热更测试<br>\r\n\r\n### 如何热更？\r\n1.首先配置热更<br>\r\n①config.txt 中修改 Debug 为 0<br>\r\n②config.txt 中修改 HotFix 为 1<br>\r\n③config.txt 中修改 ResUrl 为 你的cdn地址<br>\r\n2.准备打包ab<br>\r\n①点击菜单栏Tools->HotfixConfig，然后选择对应的平台<br>\r\n②然后会生成data.zip和version.ver，把他们放到cdn服务器下准备下载<br>\r\n双击运行 Assets/Resources/Scenes/start 场景即可<br>\r\n\r\n什么？这个例子太复杂？请看下面热更精简版演示：<br>\r\n[https://github.com/LingJiJian/UnityHotFixDemo](https://github.com/LingJiJian/UnityHotFixDemo)<br />  \r\n\r\n联系\r\n-------\r\nqq342854406  qq群347085657\r\n"
  },
  {
    "path": "build/SConstruct",
    "content": "import glob, os\r\n\r\nLUA_SRC = './luajit-2.1.0/src'\r\nIOS_SDK = 'iPhoneOS8.4.sdk'\r\n\r\ndef build_mac_dylib(name, src):\r\n\tenv = Environment(CCFLAGS=\"-Wall -std=gnu99 -arch i386 -arch x86_64\")\r\n\tenv.Append(LINKFLAGS = '-Wl,-undefined -Wl,dynamic_lookup -arch i386 -arch x86_64')\r\n\r\n\tenv.Append(CPPPATH=[LUA_SRC])\r\n\tenv.SharedLibrary(name+\".bundle\", src)\r\n\t\r\ndef build_ios_lib(name, src):\r\n\tenv = Environment(CCFLAGS=\"-Wall -std=gnu99 -arch armv7 -arch armv7s -arch arm64\")\r\n\r\n\tIXCODE = os.popen(\"xcode-select -print-path\").read().replace(\"\\n\", \"\")\r\n\tenv[\"PATH\"] = IXCODE\r\n\tenv.Append(CPPFLAGS = [\"-isysroot\", os.path.join(IXCODE, \"Platforms/iPhoneOS.platform/Developer/SDKs/\" + IOS_SDK)])\r\n\t\r\n\tenv.Append(CPPPATH=[LUA_SRC])\r\n\tenv.StaticLibrary(name, src)\r\n\r\nluasocket_src = glob.glob('./luasocket-2.0.2/src/*.c')\r\nif os.name != \"nt\":\r\n\tluasocket_src.remove('./luasocket-2.0.2/src/wsocket.c')\r\n\r\nbuild_mac_dylib(\"luasocket\", luasocket_src)\r\nbuild_ios_lib(\"luasocket\", luasocket_src)"
  },
  {
    "path": "build/lua-5.1.5/COPYRIGHT",
    "content": "Lua License\r\n-----------\r\n\r\nLua is licensed under the terms of the MIT license reproduced below.\r\nThis means that Lua is free software and can be used for both academic\r\nand commercial purposes at absolutely no cost.\r\n\r\nFor details and rationale, see http://www.lua.org/license.html .\r\n\r\n===============================================================================\r\n\r\nCopyright (C) 1994-2012 Lua.org, PUC-Rio.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n\r\n===============================================================================\r\n\r\n(end of COPYRIGHT)\r\n"
  },
  {
    "path": "build/lua-5.1.5/HISTORY",
    "content": "HISTORY for Lua 5.1\r\n\r\n* Changes from version 5.0 to 5.1\r\n  -------------------------------\r\n  Language:\r\n  + new module system.\r\n  + new semantics for control variables of fors.\r\n  + new semantics for setn/getn.\r\n  + new syntax/semantics for varargs.\r\n  + new long strings and comments.\r\n  + new `mod' operator (`%')\r\n  + new length operator #t\r\n  + metatables for all types\r\n  API:\r\n  + new functions: lua_createtable, lua_get(set)field, lua_push(to)integer.\r\n  + user supplies memory allocator (lua_open becomes lua_newstate).\r\n  + luaopen_* functions must be called through Lua.\r\n  Implementation:\r\n  + new configuration scheme via luaconf.h.\r\n  + incremental garbage collection.\r\n  + better handling of end-of-line in the lexer.\r\n  + fully reentrant parser (new Lua function `load')\r\n  + better support for 64-bit machines.\r\n  + native loadlib support for Mac OS X.\r\n  + standard distribution in only one library (lualib.a merged into lua.a)\r\n\r\n* Changes from version 4.0 to 5.0\r\n  -------------------------------\r\n  Language:\r\n  + lexical scoping.\r\n  + Lua coroutines.\r\n  + standard libraries now packaged in tables.\r\n  + tags replaced by metatables and tag methods replaced by metamethods,\r\n    stored in metatables.\r\n  + proper tail calls.\r\n  + each function can have its own global table, which can be shared.\r\n  + new __newindex metamethod, called when we insert a new key into a table.\r\n  + new block comments: --[[ ... ]].\r\n  + new generic for.\r\n  + new weak tables.\r\n  + new boolean type.\r\n  + new syntax \"local function\".\r\n  + (f()) returns the first value returned by f.\r\n  + {f()} fills a table with all values returned by f.\r\n  + \\n ignored in [[\\n .\r\n  + fixed and-or priorities.\r\n  + more general syntax for function definition (e.g. function a.x.y:f()...end).\r\n  + more general syntax for function calls (e.g. (print or write)(9)).\r\n  + new functions (time/date, tmpfile, unpack, require, load*, etc.).\r\n  API:\r\n  + chunks are loaded by using lua_load; new luaL_loadfile and luaL_loadbuffer.\r\n  + introduced lightweight userdata, a simple \"void*\" without a metatable.\r\n  + new error handling protocol: the core no longer prints error messages;\r\n    all errors are reported to the caller on the stack.\r\n  + new lua_atpanic for host cleanup.\r\n  + new, signal-safe, hook scheme.\r\n  Implementation:\r\n  + new license: MIT.\r\n  + new, faster, register-based virtual machine.\r\n  + support for external multithreading and coroutines.\r\n  + new and consistent error message format.\r\n  + the core no longer needs \"stdio.h\" for anything (except for a single\r\n    use of sprintf to convert numbers to strings).\r\n  + lua.c now runs the environment variable LUA_INIT, if present. It can\r\n    be \"@filename\", to run a file, or the chunk itself.\r\n  + support for user extensions in lua.c.\r\n    sample implementation given for command line editing.\r\n  + new dynamic loading library, active by default on several platforms.\r\n  + safe garbage-collector metamethods.\r\n  + precompiled bytecodes checked for integrity (secure binary dostring).\r\n  + strings are fully aligned.\r\n  + position capture in string.find.\r\n  + read('*l') can read lines with embedded zeros.\r\n\r\n* Changes from version 3.2 to 4.0\r\n  -------------------------------\r\n  Language:\r\n  + new \"break\" and \"for\" statements (both numerical and for tables).\r\n  + uniform treatment of globals: globals are now stored in a Lua table.\r\n  + improved error messages.\r\n  + no more '$debug': full speed *and* full debug information.\r\n  + new read form: read(N) for next N bytes.\r\n  + general read patterns now deprecated.\r\n    (still available with -DCOMPAT_READPATTERNS.)\r\n  + all return values are passed as arguments for the last function\r\n    (old semantics still available with -DLUA_COMPAT_ARGRET)\r\n  + garbage collection tag methods for tables now deprecated.\r\n  + there is now only one tag method for order.\r\n  API:\r\n  + New API: fully re-entrant, simpler, and more efficient.\r\n  + New debug API.\r\n  Implementation:\r\n  + faster than ever: cleaner virtual machine and new hashing algorithm.\r\n  + non-recursive garbage-collector algorithm.\r\n  + reduced memory usage for programs with many strings.\r\n  + improved treatment for memory allocation errors.\r\n  + improved support for 16-bit machines (we hope).\r\n  + code now compiles unmodified as both ANSI C and C++.\r\n  + numbers in bases other than 10 are converted using strtoul.\r\n  + new -f option in Lua to support #! scripts.\r\n  + luac can now combine text and binaries.\r\n\r\n* Changes from version 3.1 to 3.2\r\n  -------------------------------\r\n  + redirected all output in Lua's core to _ERRORMESSAGE and _ALERT.\r\n  + increased limit on the number of constants and globals per function\r\n    (from 2^16 to 2^24).\r\n  + debugging info (lua_debug and hooks) moved into lua_state and new API\r\n    functions provided to get and set this info.\r\n  + new debug lib gives full debugging access within Lua.\r\n  + new table functions \"foreachi\", \"sort\", \"tinsert\", \"tremove\", \"getn\".\r\n  + new io functions \"flush\", \"seek\".\r\n\r\n* Changes from version 3.0 to 3.1\r\n  -------------------------------\r\n  + NEW FEATURE: anonymous functions with closures (via \"upvalues\").\r\n  + new syntax:\r\n    - local variables in chunks.\r\n    - better scope control with DO block END.\r\n    - constructors can now be also written: { record-part; list-part }.\r\n    - more general syntax for function calls and lvalues, e.g.:\r\n      f(x).y=1\r\n      o:f(x,y):g(z)\r\n      f\"string\" is sugar for f(\"string\")\r\n  + strings may now contain arbitrary binary data (e.g., embedded zeros).\r\n  + major code re-organization and clean-up; reduced module interdependecies.\r\n  + no arbitrary limits on the total number of constants and globals.\r\n  + support for multiple global contexts.\r\n  + better syntax error messages.\r\n  + new traversal functions \"foreach\" and \"foreachvar\".\r\n  + the default for numbers is now double.\r\n    changing it to use floats or longs is easy.\r\n  + complete debug information stored in pre-compiled chunks.\r\n  + sample interpreter now prompts user when run interactively, and also\r\n    handles control-C interruptions gracefully.\r\n\r\n* Changes from version 2.5 to 3.0\r\n  -------------------------------\r\n  + NEW CONCEPT: \"tag methods\".\r\n    Tag methods replace fallbacks as the meta-mechanism for extending the\r\n    semantics of Lua. Whereas fallbacks had a global nature, tag methods\r\n    work on objects having the same tag (e.g., groups of tables).\r\n    Existing code that uses fallbacks should work without change.\r\n  + new, general syntax for constructors {[exp] = exp, ... }.\r\n  + support for handling variable number of arguments in functions (varargs).\r\n  + support for conditional compilation ($if ... $else ... $end).\r\n  + cleaner semantics in API simplifies host code.\r\n  + better support for writing libraries (auxlib.h).\r\n  + better type checking and error messages in the standard library.\r\n  + luac can now also undump.\r\n\r\n* Changes from version 2.4 to 2.5\r\n  -------------------------------\r\n  + io and string libraries are now based on pattern matching;\r\n    the old libraries are still available for compatibility\r\n  + dofile and dostring can now return values (via return statement)\r\n  + better support for 16- and 64-bit machines\r\n  + expanded documentation, with more examples\r\n\r\n* Changes from version 2.2 to 2.4\r\n  -------------------------------\r\n  + external compiler creates portable binary files that can be loaded faster\r\n  + interface for debugging and profiling\r\n  + new \"getglobal\" fallback\r\n  + new functions for handling references to Lua objects\r\n  + new functions in standard lib\r\n  + only one copy of each string is stored\r\n  + expanded documentation, with more examples\r\n\r\n* Changes from version 2.1 to 2.2\r\n  -------------------------------\r\n  + functions now may be declared with any \"lvalue\" as a name\r\n  + garbage collection of functions\r\n  + support for pipes\r\n\r\n* Changes from version 1.1 to 2.1\r\n  -------------------------------\r\n  + object-oriented support\r\n  + fallbacks\r\n  + simplified syntax for tables\r\n  + many internal improvements\r\n\r\n(end of HISTORY)\r\n"
  },
  {
    "path": "build/lua-5.1.5/INSTALL",
    "content": "INSTALL for Lua 5.1\r\n\r\n* Building Lua\r\n  ------------\r\n  Lua is built in the src directory, but the build process can be\r\n  controlled from the top-level Makefile.\r\n\r\n  Building Lua on Unix systems should be very easy. First do \"make\" and\r\n  see if your platform is listed. If so, just do \"make xxx\", where xxx\r\n  is your platform name. The platforms currently supported are:\r\n    aix ansi bsd freebsd generic linux macosx mingw posix solaris\r\n\r\n  If your platform is not listed, try the closest one or posix, generic,\r\n  ansi, in this order.\r\n\r\n  See below for customization instructions and for instructions on how\r\n  to build with other Windows compilers.\r\n\r\n  If you want to check that Lua has been built correctly, do \"make test\"\r\n  after building Lua. Also, have a look at the example programs in test.\r\n\r\n* Installing Lua\r\n  --------------\r\n  Once you have built Lua, you may want to install it in an official\r\n  place in your system. In this case, do \"make install\". The official\r\n  place and the way to install files are defined in Makefile. You must\r\n  have the right permissions to install files.\r\n\r\n  If you want to build and install Lua in one step, do \"make xxx install\",\r\n  where xxx is your platform name.\r\n\r\n  If you want to install Lua locally, then do \"make local\". This will\r\n  create directories bin, include, lib, man, and install Lua there as\r\n  follows:\r\n\r\n    bin:\tlua luac\r\n    include:\tlua.h luaconf.h lualib.h lauxlib.h lua.hpp\r\n    lib:\tliblua.a\r\n    man/man1:\tlua.1 luac.1\r\n\r\n  These are the only directories you need for development.\r\n\r\n  There are man pages for lua and luac, in both nroff and html, and a\r\n  reference manual in html in doc, some sample code in test, and some\r\n  useful stuff in etc. You don't need these directories for development.\r\n\r\n  If you want to install Lua locally, but in some other directory, do\r\n  \"make install INSTALL_TOP=xxx\", where xxx is your chosen directory.\r\n\r\n  See below for instructions for Windows and other systems.\r\n\r\n* Customization\r\n  -------------\r\n  Three things can be customized by editing a file:\r\n    - Where and how to install Lua -- edit Makefile.\r\n    - How to build Lua -- edit src/Makefile.\r\n    - Lua features -- edit src/luaconf.h.\r\n\r\n  You don't actually need to edit the Makefiles because you may set the\r\n  relevant variables when invoking make.\r\n\r\n  On the other hand, if you need to select some Lua features, you'll need\r\n  to edit src/luaconf.h. The edited file will be the one installed, and\r\n  it will be used by any Lua clients that you build, to ensure consistency.\r\n\r\n  We strongly recommend that you enable dynamic loading. This is done\r\n  automatically for all platforms listed above that have this feature\r\n  (and also Windows). See src/luaconf.h and also src/Makefile.\r\n\r\n* Building Lua on Windows and other systems\r\n  -----------------------------------------\r\n  If you're not using the usual Unix tools, then the instructions for\r\n  building Lua depend on the compiler you use. You'll need to create\r\n  projects (or whatever your compiler uses) for building the library,\r\n  the interpreter, and the compiler, as follows:\r\n\r\n  library:\tlapi.c lcode.c ldebug.c ldo.c ldump.c lfunc.c lgc.c llex.c\r\n\t\tlmem.c lobject.c lopcodes.c lparser.c lstate.c lstring.c\r\n\t\tltable.c ltm.c lundump.c lvm.c lzio.c\r\n\t\tlauxlib.c lbaselib.c ldblib.c liolib.c lmathlib.c loslib.c\r\n\t\tltablib.c lstrlib.c loadlib.c linit.c\r\n\r\n  interpreter:\tlibrary, lua.c\r\n\r\n  compiler:\tlibrary, luac.c print.c\r\n\r\n  If you use Visual Studio .NET, you can use etc/luavs.bat in its\r\n  \"Command Prompt\".\r\n\r\n  If all you want is to build the Lua interpreter, you may put all .c files\r\n  in a single project, except for luac.c and print.c. Or just use etc/all.c.\r\n\r\n  To use Lua as a library in your own programs, you'll need to know how to\r\n  create and use libraries with your compiler.\r\n\r\n  As mentioned above, you may edit luaconf.h to select some features before\r\n  building Lua.\r\n\r\n(end of INSTALL)\r\n"
  },
  {
    "path": "build/lua-5.1.5/Makefile",
    "content": "# makefile for installing Lua\r\n# see INSTALL for installation instructions\r\n# see src/Makefile and src/luaconf.h for further customization\r\n\r\n# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================\r\n\r\n# Your platform. See PLATS for possible values.\r\nPLAT= none\r\n\r\n# Where to install. The installation starts in the src and doc directories,\r\n# so take care if INSTALL_TOP is not an absolute path.\r\nINSTALL_TOP= /usr/local\r\nINSTALL_BIN= $(INSTALL_TOP)/bin\r\nINSTALL_INC= $(INSTALL_TOP)/include\r\nINSTALL_LIB= $(INSTALL_TOP)/lib\r\nINSTALL_MAN= $(INSTALL_TOP)/man/man1\r\n#\r\n# You probably want to make INSTALL_LMOD and INSTALL_CMOD consistent with\r\n# LUA_ROOT, LUA_LDIR, and LUA_CDIR in luaconf.h (and also with etc/lua.pc).\r\nINSTALL_LMOD= $(INSTALL_TOP)/share/lua/$V\r\nINSTALL_CMOD= $(INSTALL_TOP)/lib/lua/$V\r\n\r\n# How to install. If your install program does not support \"-p\", then you\r\n# may have to run ranlib on the installed liblua.a (do \"make ranlib\").\r\nINSTALL= install -p\r\nINSTALL_EXEC= $(INSTALL) -m 0755\r\nINSTALL_DATA= $(INSTALL) -m 0644\r\n#\r\n# If you don't have install you can use cp instead.\r\n# INSTALL= cp -p\r\n# INSTALL_EXEC= $(INSTALL)\r\n# INSTALL_DATA= $(INSTALL)\r\n\r\n# Utilities.\r\nMKDIR= mkdir -p\r\nRANLIB= ranlib\r\n\r\n# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========\r\n\r\n# Convenience platforms targets.\r\nPLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris\r\n\r\n# What to install.\r\nTO_BIN= lua luac\r\nTO_INC= lua.h luaconf.h lualib.h lauxlib.h ../etc/lua.hpp\r\nTO_LIB= liblua.a\r\nTO_MAN= lua.1 luac.1\r\n\r\n# Lua version and release.\r\nV= 5.1\r\nR= 5.1.5\r\n\r\nall:\t$(PLAT)\r\n\r\n$(PLATS) clean:\r\n\tcd src && $(MAKE) $@\r\n\r\ntest:\tdummy\r\n\tsrc/lua test/hello.lua\r\n\r\ninstall: dummy\r\n\tcd src && $(MKDIR) $(INSTALL_BIN) $(INSTALL_INC) $(INSTALL_LIB) $(INSTALL_MAN) $(INSTALL_LMOD) $(INSTALL_CMOD)\r\n\tcd src && $(INSTALL_EXEC) $(TO_BIN) $(INSTALL_BIN)\r\n\tcd src && $(INSTALL_DATA) $(TO_INC) $(INSTALL_INC)\r\n\tcd src && $(INSTALL_DATA) $(TO_LIB) $(INSTALL_LIB)\r\n\tcd doc && $(INSTALL_DATA) $(TO_MAN) $(INSTALL_MAN)\r\n\r\nranlib:\r\n\tcd src && cd $(INSTALL_LIB) && $(RANLIB) $(TO_LIB)\r\n\r\nlocal:\r\n\t$(MAKE) install INSTALL_TOP=..\r\n\r\nnone:\r\n\t@echo \"Please do\"\r\n\t@echo \"   make PLATFORM\"\r\n\t@echo \"where PLATFORM is one of these:\"\r\n\t@echo \"   $(PLATS)\"\r\n\t@echo \"See INSTALL for complete instructions.\"\r\n\r\n# make may get confused with test/ and INSTALL in a case-insensitive OS\r\ndummy:\r\n\r\n# echo config parameters\r\necho:\r\n\t@echo \"\"\r\n\t@echo \"These are the parameters currently set in src/Makefile to build Lua $R:\"\r\n\t@echo \"\"\r\n\t@cd src && $(MAKE) -s echo\r\n\t@echo \"\"\r\n\t@echo \"These are the parameters currently set in Makefile to install Lua $R:\"\r\n\t@echo \"\"\r\n\t@echo \"PLAT = $(PLAT)\"\r\n\t@echo \"INSTALL_TOP = $(INSTALL_TOP)\"\r\n\t@echo \"INSTALL_BIN = $(INSTALL_BIN)\"\r\n\t@echo \"INSTALL_INC = $(INSTALL_INC)\"\r\n\t@echo \"INSTALL_LIB = $(INSTALL_LIB)\"\r\n\t@echo \"INSTALL_MAN = $(INSTALL_MAN)\"\r\n\t@echo \"INSTALL_LMOD = $(INSTALL_LMOD)\"\r\n\t@echo \"INSTALL_CMOD = $(INSTALL_CMOD)\"\r\n\t@echo \"INSTALL_EXEC = $(INSTALL_EXEC)\"\r\n\t@echo \"INSTALL_DATA = $(INSTALL_DATA)\"\r\n\t@echo \"\"\r\n\t@echo \"See also src/luaconf.h .\"\r\n\t@echo \"\"\r\n\r\n# echo private config parameters\r\npecho:\r\n\t@echo \"V = $(V)\"\r\n\t@echo \"R = $(R)\"\r\n\t@echo \"TO_BIN = $(TO_BIN)\"\r\n\t@echo \"TO_INC = $(TO_INC)\"\r\n\t@echo \"TO_LIB = $(TO_LIB)\"\r\n\t@echo \"TO_MAN = $(TO_MAN)\"\r\n\r\n# echo config parameters as Lua code\r\n# uncomment the last sed expression if you want nil instead of empty strings\r\nlecho:\r\n\t@echo \"-- installation parameters for Lua $R\"\r\n\t@echo \"VERSION = '$V'\"\r\n\t@echo \"RELEASE = '$R'\"\r\n\t@$(MAKE) echo | grep = | sed -e 's/= /= \"/' -e 's/$$/\"/' #-e 's/\"\"/nil/'\r\n\t@echo \"-- EOF\"\r\n\r\n# list targets that do not create files (but not all makes understand .PHONY)\r\n.PHONY: all $(PLATS) clean test install local none dummy echo pecho lecho\r\n\r\n# (end of Makefile)\r\n"
  },
  {
    "path": "build/lua-5.1.5/README",
    "content": "README for Lua 5.1\r\n\r\nSee INSTALL for installation instructions.\r\nSee HISTORY for a summary of changes since the last released version.\r\n\r\n* What is Lua?\r\n  ------------\r\n  Lua is a powerful, light-weight programming language designed for extending\r\n  applications. Lua is also frequently used as a general-purpose, stand-alone\r\n  language. Lua is free software.\r\n\r\n  For complete information, visit Lua's web site at http://www.lua.org/ .\r\n  For an executive summary, see http://www.lua.org/about.html .\r\n\r\n  Lua has been used in many different projects around the world.\r\n  For a short list, see http://www.lua.org/uses.html .\r\n\r\n* Availability\r\n  ------------\r\n  Lua is freely available for both academic and commercial purposes.\r\n  See COPYRIGHT and http://www.lua.org/license.html for details.\r\n  Lua can be downloaded at http://www.lua.org/download.html .\r\n\r\n* Installation\r\n  ------------\r\n  Lua is implemented in pure ANSI C, and compiles unmodified in all known\r\n  platforms that have an ANSI C compiler. In most Unix-like platforms, simply\r\n  do \"make\" with a suitable target. See INSTALL for detailed instructions.\r\n\r\n* Origin\r\n  ------\r\n  Lua is developed at Lua.org, a laboratory of the Department of Computer\r\n  Science of PUC-Rio (the Pontifical Catholic University of Rio de Janeiro\r\n  in Brazil).\r\n  For more information about the authors, see http://www.lua.org/authors.html .\r\n\r\n(end of README)\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/contents.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\">\r\n<HTML>\r\n<HEAD>\r\n<TITLE>Lua 5.1 Reference Manual - contents</TITLE>\r\n<LINK REL=\"stylesheet\" TYPE=\"text/css\" HREF=\"lua.css\">\r\n<META HTTP-EQUIV=\"content-type\" CONTENT=\"text/html; charset=utf-8\">\r\n<STYLE TYPE=\"text/css\">\r\nul {\r\n\tlist-style-type: none ;\r\n}\r\n</STYLE>\r\n</HEAD>\r\n\r\n<BODY>\r\n\r\n<HR>\r\n<H1>\r\n<A HREF=\"http://www.lua.org/\"><IMG SRC=\"logo.gif\" ALT=\"\" BORDER=0></A>\r\nLua 5.1 Reference Manual\r\n</H1>\r\n\r\n<P>\r\nThe reference manual is the official definition of the Lua language.\r\nFor a complete introduction to Lua programming, see the book\r\n<A HREF=\"http://www.lua.org/docs.html#pil\">Programming in Lua</A>.\r\n\r\n<P>\r\nThis manual is also available as a book:\r\n<BLOCKQUOTE>\r\n<A HREF=\"http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20\">\r\n<IMG SRC=\"cover.png\" ALT=\"\" TITLE=\"buy from Amazon\" BORDER=1 ALIGN=\"left\" HSPACE=12>\r\n</A>\r\n<B>Lua 5.1 Reference Manual</B>\r\n<BR>by R. Ierusalimschy, L. H. de Figueiredo, W. Celes\r\n<BR>Lua.org, August 2006\r\n<BR>ISBN 85-903798-3-3\r\n<BR CLEAR=\"all\">\r\n</BLOCKQUOTE>\r\n\r\n<P>\r\n<A HREF=\"http://www.amazon.com/exec/obidos/ASIN/8590379833/lua-indexmanual-20\">Buy a copy</A>\r\nof this book and\r\n<A HREF=\"http://www.lua.org/donations.html\">help to support</A>\r\nthe Lua project.\r\n\r\n<P>\r\n<A HREF=\"manual.html\">start</A>\r\n&middot;\r\n<A HREF=\"#contents\">contents</A>\r\n&middot;\r\n<A HREF=\"#index\">index</A>\r\n&middot;\r\n<A HREF=\"http://www.lua.org/manual/\">other versions</A>\r\n<HR>\r\n<SMALL>\r\nCopyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.\r\nFreely available under the terms of the\r\n<A HREF=\"http://www.lua.org/license.html\">Lua license</A>.\r\n</SMALL>\r\n\r\n<H2><A NAME=\"contents\">Contents</A></H2>\r\n<UL style=\"padding: 0\">\r\n<LI><A HREF=\"manual.html\">1 &ndash; Introduction</A>\r\n<P>\r\n<LI><A HREF=\"manual.html#2\">2 &ndash; The Language</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#2.1\">2.1 &ndash; Lexical Conventions</A>\r\n<LI><A HREF=\"manual.html#2.2\">2.2 &ndash; Values and Types</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#2.2.1\">2.2.1 &ndash; Coercion</A>\r\n</UL>\r\n<LI><A HREF=\"manual.html#2.3\">2.3 &ndash; Variables</A>\r\n<LI><A HREF=\"manual.html#2.4\">2.4 &ndash; Statements</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#2.4.1\">2.4.1 &ndash; Chunks</A>\r\n<LI><A HREF=\"manual.html#2.4.2\">2.4.2 &ndash; Blocks</A>\r\n<LI><A HREF=\"manual.html#2.4.3\">2.4.3 &ndash; Assignment</A>\r\n<LI><A HREF=\"manual.html#2.4.4\">2.4.4 &ndash; Control Structures</A>\r\n<LI><A HREF=\"manual.html#2.4.5\">2.4.5 &ndash; For Statement</A>\r\n<LI><A HREF=\"manual.html#2.4.6\">2.4.6 &ndash; Function Calls as Statements</A>\r\n<LI><A HREF=\"manual.html#2.4.7\">2.4.7 &ndash; Local Declarations</A>\r\n</UL>\r\n<LI><A HREF=\"manual.html#2.5\">2.5 &ndash; Expressions</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#2.5.1\">2.5.1 &ndash; Arithmetic Operators</A>\r\n<LI><A HREF=\"manual.html#2.5.2\">2.5.2 &ndash; Relational Operators</A>\r\n<LI><A HREF=\"manual.html#2.5.3\">2.5.3 &ndash; Logical Operators</A>\r\n<LI><A HREF=\"manual.html#2.5.4\">2.5.4 &ndash; Concatenation</A>\r\n<LI><A HREF=\"manual.html#2.5.5\">2.5.5 &ndash; The Length Operator</A>\r\n<LI><A HREF=\"manual.html#2.5.6\">2.5.6 &ndash; Precedence</A>\r\n<LI><A HREF=\"manual.html#2.5.7\">2.5.7 &ndash; Table Constructors</A>\r\n<LI><A HREF=\"manual.html#2.5.8\">2.5.8 &ndash; Function Calls</A>\r\n<LI><A HREF=\"manual.html#2.5.9\">2.5.9 &ndash; Function Definitions</A>\r\n</UL>\r\n<LI><A HREF=\"manual.html#2.6\">2.6 &ndash; Visibility Rules</A>\r\n<LI><A HREF=\"manual.html#2.7\">2.7 &ndash; Error Handling</A>\r\n<LI><A HREF=\"manual.html#2.8\">2.8 &ndash; Metatables</A>\r\n<LI><A HREF=\"manual.html#2.9\">2.9 &ndash; Environments</A>\r\n<LI><A HREF=\"manual.html#2.10\">2.10 &ndash; Garbage Collection</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#2.10.1\">2.10.1 &ndash; Garbage-Collection Metamethods</A>\r\n<LI><A HREF=\"manual.html#2.10.2\">2.10.2 &ndash; Weak Tables</A>\r\n</UL>\r\n<LI><A HREF=\"manual.html#2.11\">2.11 &ndash; Coroutines</A>\r\n</UL>\r\n<P>\r\n<LI><A HREF=\"manual.html#3\">3 &ndash; The Application Program Interface</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#3.1\">3.1 &ndash; The Stack</A>\r\n<LI><A HREF=\"manual.html#3.2\">3.2 &ndash; Stack Size</A>\r\n<LI><A HREF=\"manual.html#3.3\">3.3 &ndash; Pseudo-Indices</A>\r\n<LI><A HREF=\"manual.html#3.4\">3.4 &ndash; C Closures</A>\r\n<LI><A HREF=\"manual.html#3.5\">3.5 &ndash; Registry</A>\r\n<LI><A HREF=\"manual.html#3.6\">3.6 &ndash; Error Handling in C</A>\r\n<LI><A HREF=\"manual.html#3.7\">3.7 &ndash; Functions and Types</A>\r\n<LI><A HREF=\"manual.html#3.8\">3.8 &ndash; The Debug Interface</A>\r\n</UL>\r\n<P>\r\n<LI><A HREF=\"manual.html#4\">4 &ndash; The Auxiliary Library</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#4.1\">4.1 &ndash; Functions and Types</A>\r\n</UL>\r\n<P>\r\n<LI><A HREF=\"manual.html#5\">5 &ndash; Standard Libraries</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#5.1\">5.1 &ndash; Basic Functions</A>\r\n<LI><A HREF=\"manual.html#5.2\">5.2 &ndash; Coroutine Manipulation</A>\r\n<LI><A HREF=\"manual.html#5.3\">5.3 &ndash; Modules</A>\r\n<LI><A HREF=\"manual.html#5.4\">5.4 &ndash; String Manipulation</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#5.4.1\">5.4.1 &ndash; Patterns</A>\r\n</UL>\r\n<LI><A HREF=\"manual.html#5.5\">5.5 &ndash; Table Manipulation</A>\r\n<LI><A HREF=\"manual.html#5.6\">5.6 &ndash; Mathematical Functions</A>\r\n<LI><A HREF=\"manual.html#5.7\">5.7 &ndash; Input and Output Facilities</A>\r\n<LI><A HREF=\"manual.html#5.8\">5.8 &ndash; Operating System Facilities</A>\r\n<LI><A HREF=\"manual.html#5.9\">5.9 &ndash; The Debug Library</A>\r\n</UL>\r\n<P>\r\n<LI><A HREF=\"manual.html#6\">6 &ndash; Lua Stand-alone</A>\r\n<P>\r\n<LI><A HREF=\"manual.html#7\">7 &ndash; Incompatibilities with the Previous Version</A>\r\n<UL>\r\n<LI><A HREF=\"manual.html#7.1\">7.1 &ndash; Changes in the Language</A>\r\n<LI><A HREF=\"manual.html#7.2\">7.2 &ndash; Changes in the Libraries</A>\r\n<LI><A HREF=\"manual.html#7.3\">7.3 &ndash; Changes in the API</A>\r\n</UL>\r\n<P>\r\n<LI><A HREF=\"manual.html#8\">8 &ndash; The Complete Syntax of Lua</A>\r\n</UL>\r\n\r\n<H2><A NAME=\"index\">Index</A></H2>\r\n<TABLE WIDTH=\"100%\">\r\n<TR VALIGN=\"top\">\r\n<TD>\r\n<H3><A NAME=\"functions\">Lua functions</A></H3>\r\n<A HREF=\"manual.html#pdf-_G\">_G</A><BR>\r\n<A HREF=\"manual.html#pdf-_VERSION\">_VERSION</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-assert\">assert</A><BR>\r\n<A HREF=\"manual.html#pdf-collectgarbage\">collectgarbage</A><BR>\r\n<A HREF=\"manual.html#pdf-dofile\">dofile</A><BR>\r\n<A HREF=\"manual.html#pdf-error\">error</A><BR>\r\n<A HREF=\"manual.html#pdf-getfenv\">getfenv</A><BR>\r\n<A HREF=\"manual.html#pdf-getmetatable\">getmetatable</A><BR>\r\n<A HREF=\"manual.html#pdf-ipairs\">ipairs</A><BR>\r\n<A HREF=\"manual.html#pdf-load\">load</A><BR>\r\n<A HREF=\"manual.html#pdf-loadfile\">loadfile</A><BR>\r\n<A HREF=\"manual.html#pdf-loadstring\">loadstring</A><BR>\r\n<A HREF=\"manual.html#pdf-module\">module</A><BR>\r\n<A HREF=\"manual.html#pdf-next\">next</A><BR>\r\n<A HREF=\"manual.html#pdf-pairs\">pairs</A><BR>\r\n<A HREF=\"manual.html#pdf-pcall\">pcall</A><BR>\r\n<A HREF=\"manual.html#pdf-print\">print</A><BR>\r\n<A HREF=\"manual.html#pdf-rawequal\">rawequal</A><BR>\r\n<A HREF=\"manual.html#pdf-rawget\">rawget</A><BR>\r\n<A HREF=\"manual.html#pdf-rawset\">rawset</A><BR>\r\n<A HREF=\"manual.html#pdf-require\">require</A><BR>\r\n<A HREF=\"manual.html#pdf-select\">select</A><BR>\r\n<A HREF=\"manual.html#pdf-setfenv\">setfenv</A><BR>\r\n<A HREF=\"manual.html#pdf-setmetatable\">setmetatable</A><BR>\r\n<A HREF=\"manual.html#pdf-tonumber\">tonumber</A><BR>\r\n<A HREF=\"manual.html#pdf-tostring\">tostring</A><BR>\r\n<A HREF=\"manual.html#pdf-type\">type</A><BR>\r\n<A HREF=\"manual.html#pdf-unpack\">unpack</A><BR>\r\n<A HREF=\"manual.html#pdf-xpcall\">xpcall</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-coroutine.create\">coroutine.create</A><BR>\r\n<A HREF=\"manual.html#pdf-coroutine.resume\">coroutine.resume</A><BR>\r\n<A HREF=\"manual.html#pdf-coroutine.running\">coroutine.running</A><BR>\r\n<A HREF=\"manual.html#pdf-coroutine.status\">coroutine.status</A><BR>\r\n<A HREF=\"manual.html#pdf-coroutine.wrap\">coroutine.wrap</A><BR>\r\n<A HREF=\"manual.html#pdf-coroutine.yield\">coroutine.yield</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-debug.debug\">debug.debug</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getfenv\">debug.getfenv</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.gethook\">debug.gethook</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getinfo\">debug.getinfo</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getlocal\">debug.getlocal</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getmetatable\">debug.getmetatable</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getregistry\">debug.getregistry</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.getupvalue\">debug.getupvalue</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.setfenv\">debug.setfenv</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.sethook\">debug.sethook</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.setlocal\">debug.setlocal</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.setmetatable\">debug.setmetatable</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.setupvalue\">debug.setupvalue</A><BR>\r\n<A HREF=\"manual.html#pdf-debug.traceback\">debug.traceback</A><BR>\r\n\r\n</TD>\r\n<TD>\r\n<H3>&nbsp;</H3>\r\n<A HREF=\"manual.html#pdf-file:close\">file:close</A><BR>\r\n<A HREF=\"manual.html#pdf-file:flush\">file:flush</A><BR>\r\n<A HREF=\"manual.html#pdf-file:lines\">file:lines</A><BR>\r\n<A HREF=\"manual.html#pdf-file:read\">file:read</A><BR>\r\n<A HREF=\"manual.html#pdf-file:seek\">file:seek</A><BR>\r\n<A HREF=\"manual.html#pdf-file:setvbuf\">file:setvbuf</A><BR>\r\n<A HREF=\"manual.html#pdf-file:write\">file:write</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-io.close\">io.close</A><BR>\r\n<A HREF=\"manual.html#pdf-io.flush\">io.flush</A><BR>\r\n<A HREF=\"manual.html#pdf-io.input\">io.input</A><BR>\r\n<A HREF=\"manual.html#pdf-io.lines\">io.lines</A><BR>\r\n<A HREF=\"manual.html#pdf-io.open\">io.open</A><BR>\r\n<A HREF=\"manual.html#pdf-io.output\">io.output</A><BR>\r\n<A HREF=\"manual.html#pdf-io.popen\">io.popen</A><BR>\r\n<A HREF=\"manual.html#pdf-io.read\">io.read</A><BR>\r\n<A HREF=\"manual.html#pdf-io.stderr\">io.stderr</A><BR>\r\n<A HREF=\"manual.html#pdf-io.stdin\">io.stdin</A><BR>\r\n<A HREF=\"manual.html#pdf-io.stdout\">io.stdout</A><BR>\r\n<A HREF=\"manual.html#pdf-io.tmpfile\">io.tmpfile</A><BR>\r\n<A HREF=\"manual.html#pdf-io.type\">io.type</A><BR>\r\n<A HREF=\"manual.html#pdf-io.write\">io.write</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-math.abs\">math.abs</A><BR>\r\n<A HREF=\"manual.html#pdf-math.acos\">math.acos</A><BR>\r\n<A HREF=\"manual.html#pdf-math.asin\">math.asin</A><BR>\r\n<A HREF=\"manual.html#pdf-math.atan\">math.atan</A><BR>\r\n<A HREF=\"manual.html#pdf-math.atan2\">math.atan2</A><BR>\r\n<A HREF=\"manual.html#pdf-math.ceil\">math.ceil</A><BR>\r\n<A HREF=\"manual.html#pdf-math.cos\">math.cos</A><BR>\r\n<A HREF=\"manual.html#pdf-math.cosh\">math.cosh</A><BR>\r\n<A HREF=\"manual.html#pdf-math.deg\">math.deg</A><BR>\r\n<A HREF=\"manual.html#pdf-math.exp\">math.exp</A><BR>\r\n<A HREF=\"manual.html#pdf-math.floor\">math.floor</A><BR>\r\n<A HREF=\"manual.html#pdf-math.fmod\">math.fmod</A><BR>\r\n<A HREF=\"manual.html#pdf-math.frexp\">math.frexp</A><BR>\r\n<A HREF=\"manual.html#pdf-math.huge\">math.huge</A><BR>\r\n<A HREF=\"manual.html#pdf-math.ldexp\">math.ldexp</A><BR>\r\n<A HREF=\"manual.html#pdf-math.log\">math.log</A><BR>\r\n<A HREF=\"manual.html#pdf-math.log10\">math.log10</A><BR>\r\n<A HREF=\"manual.html#pdf-math.max\">math.max</A><BR>\r\n<A HREF=\"manual.html#pdf-math.min\">math.min</A><BR>\r\n<A HREF=\"manual.html#pdf-math.modf\">math.modf</A><BR>\r\n<A HREF=\"manual.html#pdf-math.pi\">math.pi</A><BR>\r\n<A HREF=\"manual.html#pdf-math.pow\">math.pow</A><BR>\r\n<A HREF=\"manual.html#pdf-math.rad\">math.rad</A><BR>\r\n<A HREF=\"manual.html#pdf-math.random\">math.random</A><BR>\r\n<A HREF=\"manual.html#pdf-math.randomseed\">math.randomseed</A><BR>\r\n<A HREF=\"manual.html#pdf-math.sin\">math.sin</A><BR>\r\n<A HREF=\"manual.html#pdf-math.sinh\">math.sinh</A><BR>\r\n<A HREF=\"manual.html#pdf-math.sqrt\">math.sqrt</A><BR>\r\n<A HREF=\"manual.html#pdf-math.tan\">math.tan</A><BR>\r\n<A HREF=\"manual.html#pdf-math.tanh\">math.tanh</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-os.clock\">os.clock</A><BR>\r\n<A HREF=\"manual.html#pdf-os.date\">os.date</A><BR>\r\n<A HREF=\"manual.html#pdf-os.difftime\">os.difftime</A><BR>\r\n<A HREF=\"manual.html#pdf-os.execute\">os.execute</A><BR>\r\n<A HREF=\"manual.html#pdf-os.exit\">os.exit</A><BR>\r\n<A HREF=\"manual.html#pdf-os.getenv\">os.getenv</A><BR>\r\n<A HREF=\"manual.html#pdf-os.remove\">os.remove</A><BR>\r\n<A HREF=\"manual.html#pdf-os.rename\">os.rename</A><BR>\r\n<A HREF=\"manual.html#pdf-os.setlocale\">os.setlocale</A><BR>\r\n<A HREF=\"manual.html#pdf-os.time\">os.time</A><BR>\r\n<A HREF=\"manual.html#pdf-os.tmpname\">os.tmpname</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-package.cpath\">package.cpath</A><BR>\r\n<A HREF=\"manual.html#pdf-package.loaded\">package.loaded</A><BR>\r\n<A HREF=\"manual.html#pdf-package.loaders\">package.loaders</A><BR>\r\n<A HREF=\"manual.html#pdf-package.loadlib\">package.loadlib</A><BR>\r\n<A HREF=\"manual.html#pdf-package.path\">package.path</A><BR>\r\n<A HREF=\"manual.html#pdf-package.preload\">package.preload</A><BR>\r\n<A HREF=\"manual.html#pdf-package.seeall\">package.seeall</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-string.byte\">string.byte</A><BR>\r\n<A HREF=\"manual.html#pdf-string.char\">string.char</A><BR>\r\n<A HREF=\"manual.html#pdf-string.dump\">string.dump</A><BR>\r\n<A HREF=\"manual.html#pdf-string.find\">string.find</A><BR>\r\n<A HREF=\"manual.html#pdf-string.format\">string.format</A><BR>\r\n<A HREF=\"manual.html#pdf-string.gmatch\">string.gmatch</A><BR>\r\n<A HREF=\"manual.html#pdf-string.gsub\">string.gsub</A><BR>\r\n<A HREF=\"manual.html#pdf-string.len\">string.len</A><BR>\r\n<A HREF=\"manual.html#pdf-string.lower\">string.lower</A><BR>\r\n<A HREF=\"manual.html#pdf-string.match\">string.match</A><BR>\r\n<A HREF=\"manual.html#pdf-string.rep\">string.rep</A><BR>\r\n<A HREF=\"manual.html#pdf-string.reverse\">string.reverse</A><BR>\r\n<A HREF=\"manual.html#pdf-string.sub\">string.sub</A><BR>\r\n<A HREF=\"manual.html#pdf-string.upper\">string.upper</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#pdf-table.concat\">table.concat</A><BR>\r\n<A HREF=\"manual.html#pdf-table.insert\">table.insert</A><BR>\r\n<A HREF=\"manual.html#pdf-table.maxn\">table.maxn</A><BR>\r\n<A HREF=\"manual.html#pdf-table.remove\">table.remove</A><BR>\r\n<A HREF=\"manual.html#pdf-table.sort\">table.sort</A><BR>\r\n\r\n</TD>\r\n<TD>\r\n<H3>C API</H3>\r\n<A HREF=\"manual.html#lua_Alloc\">lua_Alloc</A><BR>\r\n<A HREF=\"manual.html#lua_CFunction\">lua_CFunction</A><BR>\r\n<A HREF=\"manual.html#lua_Debug\">lua_Debug</A><BR>\r\n<A HREF=\"manual.html#lua_Hook\">lua_Hook</A><BR>\r\n<A HREF=\"manual.html#lua_Integer\">lua_Integer</A><BR>\r\n<A HREF=\"manual.html#lua_Number\">lua_Number</A><BR>\r\n<A HREF=\"manual.html#lua_Reader\">lua_Reader</A><BR>\r\n<A HREF=\"manual.html#lua_State\">lua_State</A><BR>\r\n<A HREF=\"manual.html#lua_Writer\">lua_Writer</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#lua_atpanic\">lua_atpanic</A><BR>\r\n<A HREF=\"manual.html#lua_call\">lua_call</A><BR>\r\n<A HREF=\"manual.html#lua_checkstack\">lua_checkstack</A><BR>\r\n<A HREF=\"manual.html#lua_close\">lua_close</A><BR>\r\n<A HREF=\"manual.html#lua_concat\">lua_concat</A><BR>\r\n<A HREF=\"manual.html#lua_cpcall\">lua_cpcall</A><BR>\r\n<A HREF=\"manual.html#lua_createtable\">lua_createtable</A><BR>\r\n<A HREF=\"manual.html#lua_dump\">lua_dump</A><BR>\r\n<A HREF=\"manual.html#lua_equal\">lua_equal</A><BR>\r\n<A HREF=\"manual.html#lua_error\">lua_error</A><BR>\r\n<A HREF=\"manual.html#lua_gc\">lua_gc</A><BR>\r\n<A HREF=\"manual.html#lua_getallocf\">lua_getallocf</A><BR>\r\n<A HREF=\"manual.html#lua_getfenv\">lua_getfenv</A><BR>\r\n<A HREF=\"manual.html#lua_getfield\">lua_getfield</A><BR>\r\n<A HREF=\"manual.html#lua_getglobal\">lua_getglobal</A><BR>\r\n<A HREF=\"manual.html#lua_gethook\">lua_gethook</A><BR>\r\n<A HREF=\"manual.html#lua_gethookcount\">lua_gethookcount</A><BR>\r\n<A HREF=\"manual.html#lua_gethookmask\">lua_gethookmask</A><BR>\r\n<A HREF=\"manual.html#lua_getinfo\">lua_getinfo</A><BR>\r\n<A HREF=\"manual.html#lua_getlocal\">lua_getlocal</A><BR>\r\n<A HREF=\"manual.html#lua_getmetatable\">lua_getmetatable</A><BR>\r\n<A HREF=\"manual.html#lua_getstack\">lua_getstack</A><BR>\r\n<A HREF=\"manual.html#lua_gettable\">lua_gettable</A><BR>\r\n<A HREF=\"manual.html#lua_gettop\">lua_gettop</A><BR>\r\n<A HREF=\"manual.html#lua_getupvalue\">lua_getupvalue</A><BR>\r\n<A HREF=\"manual.html#lua_insert\">lua_insert</A><BR>\r\n<A HREF=\"manual.html#lua_isboolean\">lua_isboolean</A><BR>\r\n<A HREF=\"manual.html#lua_iscfunction\">lua_iscfunction</A><BR>\r\n<A HREF=\"manual.html#lua_isfunction\">lua_isfunction</A><BR>\r\n<A HREF=\"manual.html#lua_islightuserdata\">lua_islightuserdata</A><BR>\r\n<A HREF=\"manual.html#lua_isnil\">lua_isnil</A><BR>\r\n<A HREF=\"manual.html#lua_isnone\">lua_isnone</A><BR>\r\n<A HREF=\"manual.html#lua_isnoneornil\">lua_isnoneornil</A><BR>\r\n<A HREF=\"manual.html#lua_isnumber\">lua_isnumber</A><BR>\r\n<A HREF=\"manual.html#lua_isstring\">lua_isstring</A><BR>\r\n<A HREF=\"manual.html#lua_istable\">lua_istable</A><BR>\r\n<A HREF=\"manual.html#lua_isthread\">lua_isthread</A><BR>\r\n<A HREF=\"manual.html#lua_isuserdata\">lua_isuserdata</A><BR>\r\n<A HREF=\"manual.html#lua_lessthan\">lua_lessthan</A><BR>\r\n<A HREF=\"manual.html#lua_load\">lua_load</A><BR>\r\n<A HREF=\"manual.html#lua_newstate\">lua_newstate</A><BR>\r\n<A HREF=\"manual.html#lua_newtable\">lua_newtable</A><BR>\r\n<A HREF=\"manual.html#lua_newthread\">lua_newthread</A><BR>\r\n<A HREF=\"manual.html#lua_newuserdata\">lua_newuserdata</A><BR>\r\n<A HREF=\"manual.html#lua_next\">lua_next</A><BR>\r\n<A HREF=\"manual.html#lua_objlen\">lua_objlen</A><BR>\r\n<A HREF=\"manual.html#lua_pcall\">lua_pcall</A><BR>\r\n<A HREF=\"manual.html#lua_pop\">lua_pop</A><BR>\r\n<A HREF=\"manual.html#lua_pushboolean\">lua_pushboolean</A><BR>\r\n<A HREF=\"manual.html#lua_pushcclosure\">lua_pushcclosure</A><BR>\r\n<A HREF=\"manual.html#lua_pushcfunction\">lua_pushcfunction</A><BR>\r\n<A HREF=\"manual.html#lua_pushfstring\">lua_pushfstring</A><BR>\r\n<A HREF=\"manual.html#lua_pushinteger\">lua_pushinteger</A><BR>\r\n<A HREF=\"manual.html#lua_pushlightuserdata\">lua_pushlightuserdata</A><BR>\r\n<A HREF=\"manual.html#lua_pushliteral\">lua_pushliteral</A><BR>\r\n<A HREF=\"manual.html#lua_pushlstring\">lua_pushlstring</A><BR>\r\n<A HREF=\"manual.html#lua_pushnil\">lua_pushnil</A><BR>\r\n<A HREF=\"manual.html#lua_pushnumber\">lua_pushnumber</A><BR>\r\n<A HREF=\"manual.html#lua_pushstring\">lua_pushstring</A><BR>\r\n<A HREF=\"manual.html#lua_pushthread\">lua_pushthread</A><BR>\r\n<A HREF=\"manual.html#lua_pushvalue\">lua_pushvalue</A><BR>\r\n<A HREF=\"manual.html#lua_pushvfstring\">lua_pushvfstring</A><BR>\r\n<A HREF=\"manual.html#lua_rawequal\">lua_rawequal</A><BR>\r\n<A HREF=\"manual.html#lua_rawget\">lua_rawget</A><BR>\r\n<A HREF=\"manual.html#lua_rawgeti\">lua_rawgeti</A><BR>\r\n<A HREF=\"manual.html#lua_rawset\">lua_rawset</A><BR>\r\n<A HREF=\"manual.html#lua_rawseti\">lua_rawseti</A><BR>\r\n<A HREF=\"manual.html#lua_register\">lua_register</A><BR>\r\n<A HREF=\"manual.html#lua_remove\">lua_remove</A><BR>\r\n<A HREF=\"manual.html#lua_replace\">lua_replace</A><BR>\r\n<A HREF=\"manual.html#lua_resume\">lua_resume</A><BR>\r\n<A HREF=\"manual.html#lua_setallocf\">lua_setallocf</A><BR>\r\n<A HREF=\"manual.html#lua_setfenv\">lua_setfenv</A><BR>\r\n<A HREF=\"manual.html#lua_setfield\">lua_setfield</A><BR>\r\n<A HREF=\"manual.html#lua_setglobal\">lua_setglobal</A><BR>\r\n<A HREF=\"manual.html#lua_sethook\">lua_sethook</A><BR>\r\n<A HREF=\"manual.html#lua_setlocal\">lua_setlocal</A><BR>\r\n<A HREF=\"manual.html#lua_setmetatable\">lua_setmetatable</A><BR>\r\n<A HREF=\"manual.html#lua_settable\">lua_settable</A><BR>\r\n<A HREF=\"manual.html#lua_settop\">lua_settop</A><BR>\r\n<A HREF=\"manual.html#lua_setupvalue\">lua_setupvalue</A><BR>\r\n<A HREF=\"manual.html#lua_status\">lua_status</A><BR>\r\n<A HREF=\"manual.html#lua_toboolean\">lua_toboolean</A><BR>\r\n<A HREF=\"manual.html#lua_tocfunction\">lua_tocfunction</A><BR>\r\n<A HREF=\"manual.html#lua_tointeger\">lua_tointeger</A><BR>\r\n<A HREF=\"manual.html#lua_tolstring\">lua_tolstring</A><BR>\r\n<A HREF=\"manual.html#lua_tonumber\">lua_tonumber</A><BR>\r\n<A HREF=\"manual.html#lua_topointer\">lua_topointer</A><BR>\r\n<A HREF=\"manual.html#lua_tostring\">lua_tostring</A><BR>\r\n<A HREF=\"manual.html#lua_tothread\">lua_tothread</A><BR>\r\n<A HREF=\"manual.html#lua_touserdata\">lua_touserdata</A><BR>\r\n<A HREF=\"manual.html#lua_type\">lua_type</A><BR>\r\n<A HREF=\"manual.html#lua_typename\">lua_typename</A><BR>\r\n<A HREF=\"manual.html#lua_upvalueindex\">lua_upvalueindex</A><BR>\r\n<A HREF=\"manual.html#lua_xmove\">lua_xmove</A><BR>\r\n<A HREF=\"manual.html#lua_yield\">lua_yield</A><BR>\r\n\r\n</TD>\r\n<TD>\r\n<H3>auxiliary library</H3>\r\n<A HREF=\"manual.html#luaL_Buffer\">luaL_Buffer</A><BR>\r\n<A HREF=\"manual.html#luaL_Reg\">luaL_Reg</A><BR>\r\n<P>\r\n\r\n<A HREF=\"manual.html#luaL_addchar\">luaL_addchar</A><BR>\r\n<A HREF=\"manual.html#luaL_addlstring\">luaL_addlstring</A><BR>\r\n<A HREF=\"manual.html#luaL_addsize\">luaL_addsize</A><BR>\r\n<A HREF=\"manual.html#luaL_addstring\">luaL_addstring</A><BR>\r\n<A HREF=\"manual.html#luaL_addvalue\">luaL_addvalue</A><BR>\r\n<A HREF=\"manual.html#luaL_argcheck\">luaL_argcheck</A><BR>\r\n<A HREF=\"manual.html#luaL_argerror\">luaL_argerror</A><BR>\r\n<A HREF=\"manual.html#luaL_buffinit\">luaL_buffinit</A><BR>\r\n<A HREF=\"manual.html#luaL_callmeta\">luaL_callmeta</A><BR>\r\n<A HREF=\"manual.html#luaL_checkany\">luaL_checkany</A><BR>\r\n<A HREF=\"manual.html#luaL_checkint\">luaL_checkint</A><BR>\r\n<A HREF=\"manual.html#luaL_checkinteger\">luaL_checkinteger</A><BR>\r\n<A HREF=\"manual.html#luaL_checklong\">luaL_checklong</A><BR>\r\n<A HREF=\"manual.html#luaL_checklstring\">luaL_checklstring</A><BR>\r\n<A HREF=\"manual.html#luaL_checknumber\">luaL_checknumber</A><BR>\r\n<A HREF=\"manual.html#luaL_checkoption\">luaL_checkoption</A><BR>\r\n<A HREF=\"manual.html#luaL_checkstack\">luaL_checkstack</A><BR>\r\n<A HREF=\"manual.html#luaL_checkstring\">luaL_checkstring</A><BR>\r\n<A HREF=\"manual.html#luaL_checktype\">luaL_checktype</A><BR>\r\n<A HREF=\"manual.html#luaL_checkudata\">luaL_checkudata</A><BR>\r\n<A HREF=\"manual.html#luaL_dofile\">luaL_dofile</A><BR>\r\n<A HREF=\"manual.html#luaL_dostring\">luaL_dostring</A><BR>\r\n<A HREF=\"manual.html#luaL_error\">luaL_error</A><BR>\r\n<A HREF=\"manual.html#luaL_getmetafield\">luaL_getmetafield</A><BR>\r\n<A HREF=\"manual.html#luaL_getmetatable\">luaL_getmetatable</A><BR>\r\n<A HREF=\"manual.html#luaL_gsub\">luaL_gsub</A><BR>\r\n<A HREF=\"manual.html#luaL_loadbuffer\">luaL_loadbuffer</A><BR>\r\n<A HREF=\"manual.html#luaL_loadfile\">luaL_loadfile</A><BR>\r\n<A HREF=\"manual.html#luaL_loadstring\">luaL_loadstring</A><BR>\r\n<A HREF=\"manual.html#luaL_newmetatable\">luaL_newmetatable</A><BR>\r\n<A HREF=\"manual.html#luaL_newstate\">luaL_newstate</A><BR>\r\n<A HREF=\"manual.html#luaL_openlibs\">luaL_openlibs</A><BR>\r\n<A HREF=\"manual.html#luaL_optint\">luaL_optint</A><BR>\r\n<A HREF=\"manual.html#luaL_optinteger\">luaL_optinteger</A><BR>\r\n<A HREF=\"manual.html#luaL_optlong\">luaL_optlong</A><BR>\r\n<A HREF=\"manual.html#luaL_optlstring\">luaL_optlstring</A><BR>\r\n<A HREF=\"manual.html#luaL_optnumber\">luaL_optnumber</A><BR>\r\n<A HREF=\"manual.html#luaL_optstring\">luaL_optstring</A><BR>\r\n<A HREF=\"manual.html#luaL_prepbuffer\">luaL_prepbuffer</A><BR>\r\n<A HREF=\"manual.html#luaL_pushresult\">luaL_pushresult</A><BR>\r\n<A HREF=\"manual.html#luaL_ref\">luaL_ref</A><BR>\r\n<A HREF=\"manual.html#luaL_register\">luaL_register</A><BR>\r\n<A HREF=\"manual.html#luaL_typename\">luaL_typename</A><BR>\r\n<A HREF=\"manual.html#luaL_typerror\">luaL_typerror</A><BR>\r\n<A HREF=\"manual.html#luaL_unref\">luaL_unref</A><BR>\r\n<A HREF=\"manual.html#luaL_where\">luaL_where</A><BR>\r\n\r\n</TD>\r\n</TR>\r\n</TABLE>\r\n<P>\r\n\r\n<HR>\r\n<SMALL CLASS=\"footer\">\r\nLast update:\r\nMon Feb 13 18:53:32 BRST 2012\r\n</SMALL>\r\n<!--\r\nLast change: revised for Lua 5.1.5\r\n-->\r\n\r\n</BODY>\r\n</HTML>\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/lua.1",
    "content": ".\\\" $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $\r\n.TH LUA 1 \"$Date: 2006/01/06 16:03:34 $\"\r\n.SH NAME\r\nlua \\- Lua interpreter\r\n.SH SYNOPSIS\r\n.B lua\r\n[\r\n.I options\r\n]\r\n[\r\n.I script\r\n[\r\n.I args\r\n]\r\n]\r\n.SH DESCRIPTION\r\n.B lua\r\nis the stand-alone Lua interpreter.\r\nIt loads and executes Lua programs,\r\neither in textual source form or\r\nin precompiled binary form.\r\n(Precompiled binaries are output by\r\n.BR luac ,\r\nthe Lua compiler.)\r\n.B lua\r\ncan be used as a batch interpreter and also interactively.\r\n.LP\r\nThe given\r\n.I options\r\n(see below)\r\nare executed and then\r\nthe Lua program in file\r\n.I script\r\nis loaded and executed.\r\nThe given\r\n.I args\r\nare available to\r\n.I script\r\nas strings in a global table named\r\n.BR arg .\r\nIf these arguments contain spaces or other characters special to the shell,\r\nthen they should be quoted\r\n(but note that the quotes will be removed by the shell).\r\nThe arguments in\r\n.B arg\r\nstart at 0,\r\nwhich contains the string\r\n.RI ' script '.\r\nThe index of the last argument is stored in\r\n.BR arg.n .\r\nThe arguments given in the command line before\r\n.IR script ,\r\nincluding the name of the interpreter,\r\nare available in negative indices in\r\n.BR arg .\r\n.LP\r\nAt the very start,\r\nbefore even handling the command line,\r\n.B lua\r\nexecutes the contents of the environment variable\r\n.BR LUA_INIT ,\r\nif it is defined.\r\nIf the value of\r\n.B LUA_INIT\r\nis of the form\r\n.RI '@ filename ',\r\nthen\r\n.I filename\r\nis executed.\r\nOtherwise, the string is assumed to be a Lua statement and is executed.\r\n.LP\r\nOptions start with\r\n.B '\\-'\r\nand are described below.\r\nYou can use\r\n.B \"'\\--'\"\r\nto signal the end of options.\r\n.LP\r\nIf no arguments are given,\r\nthen\r\n.B \"\\-v \\-i\"\r\nis assumed when the standard input is a terminal;\r\notherwise,\r\n.B \"\\-\"\r\nis assumed.\r\n.LP\r\nIn interactive mode,\r\n.B lua\r\nprompts the user,\r\nreads lines from the standard input,\r\nand executes them as they are read.\r\nIf a line does not contain a complete statement,\r\nthen a secondary prompt is displayed and\r\nlines are read until a complete statement is formed or\r\na syntax error is found.\r\nSo, one way to interrupt the reading of an incomplete statement is\r\nto force a syntax error:\r\nadding a\r\n.B ';' \r\nin the middle of a statement is a sure way of forcing a syntax error\r\n(except inside multiline strings and comments; these must be closed explicitly).\r\nIf a line starts with\r\n.BR '=' ,\r\nthen\r\n.B lua\r\ndisplays the values of all the expressions in the remainder of the\r\nline. The expressions must be separated by commas.\r\nThe primary prompt is the value of the global variable\r\n.BR _PROMPT ,\r\nif this value is a string;\r\notherwise, the default prompt is used.\r\nSimilarly, the secondary prompt is the value of the global variable\r\n.BR _PROMPT2 .\r\nSo,\r\nto change the prompts,\r\nset the corresponding variable to a string of your choice.\r\nYou can do that after calling the interpreter\r\nor on the command line\r\n(but in this case you have to be careful with quotes\r\nif the prompt string contains a space; otherwise you may confuse the shell.)\r\nThe default prompts are \"> \" and \">> \".\r\n.SH OPTIONS\r\n.TP\r\n.B \\-\r\nload and execute the standard input as a file,\r\nthat is,\r\nnot interactively,\r\neven when the standard input is a terminal.\r\n.TP\r\n.BI \\-e \" stat\"\r\nexecute statement\r\n.IR stat .\r\nYou need to quote\r\n.I stat \r\nif it contains spaces, quotes,\r\nor other characters special to the shell.\r\n.TP\r\n.B \\-i\r\nenter interactive mode after\r\n.I script\r\nis executed.\r\n.TP\r\n.BI \\-l \" name\"\r\ncall\r\n.BI require(' name ')\r\nbefore executing\r\n.IR script .\r\nTypically used to load libraries.\r\n.TP\r\n.B \\-v\r\nshow version information.\r\n.SH \"SEE ALSO\"\r\n.BR luac (1)\r\n.br\r\nhttp://www.lua.org/\r\n.SH DIAGNOSTICS\r\nError messages should be self explanatory.\r\n.SH AUTHORS\r\nR. Ierusalimschy,\r\nL. H. de Figueiredo,\r\nand\r\nW. Celes\r\n.\\\" EOF\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/lua.css",
    "content": "body {\r\n\tcolor: #000000 ;\r\n\tbackground-color: #FFFFFF ;\r\n\tfont-family: Helvetica, Arial, sans-serif ;\r\n\ttext-align: justify ;\r\n\tmargin-right: 30px ;\r\n\tmargin-left: 30px ;\r\n}\r\n\r\nh1, h2, h3, h4 {\r\n\tfont-family: Verdana, Geneva, sans-serif ;\r\n\tfont-weight: normal ;\r\n\tfont-style: italic ;\r\n}\r\n\r\nh2 {\r\n\tpadding-top: 0.4em ;\r\n\tpadding-bottom: 0.4em ;\r\n\tpadding-left: 30px ;\r\n\tpadding-right: 30px ;\r\n\tmargin-left: -30px ;\r\n\tbackground-color: #E0E0FF ;\r\n}\r\n\r\nh3 {\r\n\tpadding-left: 0.5em ;\r\n\tborder-left: solid #E0E0FF 1em ;\r\n}\r\n\r\ntable h3 {\r\n\tpadding-left: 0px ;\r\n\tborder-left: none ;\r\n}\r\n\r\na:link {\r\n\tcolor: #000080 ;\r\n\tbackground-color: inherit ;\r\n\ttext-decoration: none ;\r\n}\r\n\r\na:visited {\r\n\tbackground-color: inherit ;\r\n\ttext-decoration: none ;\r\n}\r\n\r\na:link:hover, a:visited:hover {\r\n\tcolor: #000080 ;\r\n\tbackground-color: #E0E0FF ;\r\n}\r\n\r\na:link:active, a:visited:active {\r\n\tcolor: #FF0000 ;\r\n}\r\n\r\nhr {\r\n\tborder: 0 ;\r\n\theight: 1px ;\r\n\tcolor: #a0a0a0 ;\r\n\tbackground-color: #a0a0a0 ;\r\n}\r\n\r\n:target {\r\n\tbackground-color: #F8F8F8 ;\r\n\tpadding: 8px ;\r\n\tborder: solid #a0a0a0 2px ;\r\n}\r\n\r\n.footer {\r\n\tcolor: gray ;\r\n\tfont-size: small ;\r\n}\r\n\r\ninput[type=text] {\r\n\tborder: solid #a0a0a0 2px ;\r\n\tborder-radius: 2em ;\r\n\t-moz-border-radius: 2em ;\r\n\tbackground-image: url('images/search.png') ;\r\n\tbackground-repeat: no-repeat;\r\n\tbackground-position: 4px center ;\r\n\tpadding-left: 20px ;\r\n\theight: 2em ;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/lua.html",
    "content": "<!-- $Id: lua.man,v 1.11 2006/01/06 16:03:34 lhf Exp $ -->\r\n<HTML>\r\n<HEAD>\r\n<TITLE>LUA man page</TITLE>\r\n<LINK REL=\"stylesheet\" TYPE=\"text/css\" HREF=\"lua.css\">\r\n</HEAD>\r\n\r\n<BODY BGCOLOR=\"#FFFFFF\">\r\n\r\n<H2>NAME</H2>\r\nlua - Lua interpreter\r\n<H2>SYNOPSIS</H2>\r\n<B>lua</B>\r\n[\r\n<I>options</I>\r\n]\r\n[\r\n<I>script</I>\r\n[\r\n<I>args</I>\r\n]\r\n]\r\n<H2>DESCRIPTION</H2>\r\n<B>lua</B>\r\nis the stand-alone Lua interpreter.\r\nIt loads and executes Lua programs,\r\neither in textual source form or\r\nin precompiled binary form.\r\n(Precompiled binaries are output by\r\n<B>luac</B>,\r\nthe Lua compiler.)\r\n<B>lua</B>\r\ncan be used as a batch interpreter and also interactively.\r\n<P>\r\nThe given\r\n<I>options</I>\r\n(see below)\r\nare executed and then\r\nthe Lua program in file\r\n<I>script</I>\r\nis loaded and executed.\r\nThe given\r\n<I>args</I>\r\nare available to\r\n<I>script</I>\r\nas strings in a global table named\r\n<B>arg</B>.\r\nIf these arguments contain spaces or other characters special to the shell,\r\nthen they should be quoted\r\n(but note that the quotes will be removed by the shell).\r\nThe arguments in\r\n<B>arg</B>\r\nstart at 0,\r\nwhich contains the string\r\n'<I>script</I>'.\r\nThe index of the last argument is stored in\r\n<B>arg.n</B>.\r\nThe arguments given in the command line before\r\n<I>script</I>,\r\nincluding the name of the interpreter,\r\nare available in negative indices in\r\n<B>arg</B>.\r\n<P>\r\nAt the very start,\r\nbefore even handling the command line,\r\n<B>lua</B>\r\nexecutes the contents of the environment variable\r\n<B>LUA_INIT</B>,\r\nif it is defined.\r\nIf the value of\r\n<B>LUA_INIT</B>\r\nis of the form\r\n'@<I>filename</I>',\r\nthen\r\n<I>filename</I>\r\nis executed.\r\nOtherwise, the string is assumed to be a Lua statement and is executed.\r\n<P>\r\nOptions start with\r\n<B>'-'</B>\r\nand are described below.\r\nYou can use\r\n<B>'--'</B>\r\nto signal the end of options.\r\n<P>\r\nIf no arguments are given,\r\nthen\r\n<B>\"-v -i\"</B>\r\nis assumed when the standard input is a terminal;\r\notherwise,\r\n<B>\"-\"</B>\r\nis assumed.\r\n<P>\r\nIn interactive mode,\r\n<B>lua</B>\r\nprompts the user,\r\nreads lines from the standard input,\r\nand executes them as they are read.\r\nIf a line does not contain a complete statement,\r\nthen a secondary prompt is displayed and\r\nlines are read until a complete statement is formed or\r\na syntax error is found.\r\nSo, one way to interrupt the reading of an incomplete statement is\r\nto force a syntax error:\r\nadding a\r\n<B>';'</B>\r\nin the middle of a statement is a sure way of forcing a syntax error\r\n(except inside multiline strings and comments; these must be closed explicitly).\r\nIf a line starts with\r\n<B>'='</B>,\r\nthen\r\n<B>lua</B>\r\ndisplays the values of all the expressions in the remainder of the\r\nline. The expressions must be separated by commas.\r\nThe primary prompt is the value of the global variable\r\n<B>_PROMPT</B>,\r\nif this value is a string;\r\notherwise, the default prompt is used.\r\nSimilarly, the secondary prompt is the value of the global variable\r\n<B>_PROMPT2</B>.\r\nSo,\r\nto change the prompts,\r\nset the corresponding variable to a string of your choice.\r\nYou can do that after calling the interpreter\r\nor on the command line\r\n(but in this case you have to be careful with quotes\r\nif the prompt string contains a space; otherwise you may confuse the shell.)\r\nThe default prompts are \"&gt; \" and \"&gt;&gt; \".\r\n<H2>OPTIONS</H2>\r\n<P>\r\n<B>-</B>\r\nload and execute the standard input as a file,\r\nthat is,\r\nnot interactively,\r\neven when the standard input is a terminal.\r\n<P>\r\n<B>-e </B><I>stat</I>\r\nexecute statement\r\n<I>stat</I>.\r\nYou need to quote\r\n<I>stat </I>\r\nif it contains spaces, quotes,\r\nor other characters special to the shell.\r\n<P>\r\n<B>-i</B>\r\nenter interactive mode after\r\n<I>script</I>\r\nis executed.\r\n<P>\r\n<B>-l </B><I>name</I>\r\ncall\r\n<B>require</B>('<I>name</I>')\r\nbefore executing\r\n<I>script</I>.\r\nTypically used to load libraries.\r\n<P>\r\n<B>-v</B>\r\nshow version information.\r\n<H2>SEE ALSO</H2>\r\n<B>luac</B>(1)\r\n<BR>\r\n<A HREF=\"http://www.lua.org/\">http://www.lua.org/</A>\r\n<H2>DIAGNOSTICS</H2>\r\nError messages should be self explanatory.\r\n<H2>AUTHORS</H2>\r\nR. Ierusalimschy,\r\nL. H. de Figueiredo,\r\nand\r\nW. Celes\r\n<!-- EOF -->\r\n</BODY>\r\n</HTML>\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/luac.1",
    "content": ".\\\" $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $\r\n.TH LUAC 1 \"$Date: 2006/01/06 16:03:34 $\"\r\n.SH NAME\r\nluac \\- Lua compiler\r\n.SH SYNOPSIS\r\n.B luac\r\n[\r\n.I options\r\n] [\r\n.I filenames\r\n]\r\n.SH DESCRIPTION\r\n.B luac\r\nis the Lua compiler.\r\nIt translates programs written in the Lua programming language\r\ninto binary files that can be later loaded and executed.\r\n.LP\r\nThe main advantages of precompiling chunks are:\r\nfaster loading,\r\nprotecting source code from accidental user changes,\r\nand\r\noff-line syntax checking.\r\n.LP\r\nPre-compiling does not imply faster execution\r\nbecause in Lua chunks are always compiled into bytecodes before being executed.\r\n.B luac\r\nsimply allows those bytecodes to be saved in a file for later execution.\r\n.LP\r\nPre-compiled chunks are not necessarily smaller than the corresponding source.\r\nThe main goal in pre-compiling is faster loading.\r\n.LP\r\nThe binary files created by\r\n.B luac\r\nare portable only among architectures with the same word size and byte order.\r\n.LP\r\n.B luac\r\nproduces a single output file containing the bytecodes\r\nfor all source files given.\r\nBy default,\r\nthe output file is named\r\n.BR luac.out ,\r\nbut you can change this with the\r\n.B \\-o\r\noption.\r\n.LP\r\nIn the command line,\r\nyou can mix\r\ntext files containing Lua source and\r\nbinary files containing precompiled chunks.\r\nThis is useful to combine several precompiled chunks,\r\neven from different (but compatible) platforms,\r\ninto a single precompiled chunk.\r\n.LP\r\nYou can use\r\n.B \"'\\-'\"\r\nto indicate the standard input as a source file\r\nand\r\n.B \"'\\--'\"\r\nto signal the end of options\r\n(that is,\r\nall remaining arguments will be treated as files even if they start with\r\n.BR \"'\\-'\" ).\r\n.LP\r\nThe internal format of the binary files produced by\r\n.B luac\r\nis likely to change when a new version of Lua is released.\r\nSo,\r\nsave the source files of all Lua programs that you precompile.\r\n.LP\r\n.SH OPTIONS\r\nOptions must be separate.\r\n.TP\r\n.B \\-l\r\nproduce a listing of the compiled bytecode for Lua's virtual machine.\r\nListing bytecodes is useful to learn about Lua's virtual machine.\r\nIf no files are given, then\r\n.B luac\r\nloads\r\n.B luac.out\r\nand lists its contents.\r\n.TP\r\n.BI \\-o \" file\"\r\noutput to\r\n.IR file ,\r\ninstead of the default\r\n.BR luac.out .\r\n(You can use\r\n.B \"'\\-'\"\r\nfor standard output,\r\nbut not on platforms that open standard output in text mode.)\r\nThe output file may be a source file because\r\nall files are loaded before the output file is written.\r\nBe careful not to overwrite precious files.\r\n.TP\r\n.B \\-p\r\nload files but do not generate any output file.\r\nUsed mainly for syntax checking and for testing precompiled chunks:\r\ncorrupted files will probably generate errors when loaded.\r\nLua always performs a thorough integrity test on precompiled chunks.\r\nBytecode that passes this test is completely safe,\r\nin the sense that it will not break the interpreter.\r\nHowever,\r\nthere is no guarantee that such code does anything sensible.\r\n(None can be given, because the halting problem is unsolvable.)\r\nIf no files are given, then\r\n.B luac\r\nloads\r\n.B luac.out\r\nand tests its contents.\r\nNo messages are displayed if the file passes the integrity test.\r\n.TP\r\n.B \\-s\r\nstrip debug information before writing the output file.\r\nThis saves some space in very large chunks,\r\nbut if errors occur when running a stripped chunk,\r\nthen the error messages may not contain the full information they usually do.\r\nFor instance,\r\nline numbers and names of local variables are lost.\r\n.TP\r\n.B \\-v\r\nshow version information.\r\n.SH FILES\r\n.TP 15\r\n.B luac.out\r\ndefault output file\r\n.SH \"SEE ALSO\"\r\n.BR lua (1)\r\n.br\r\nhttp://www.lua.org/\r\n.SH DIAGNOSTICS\r\nError messages should be self explanatory.\r\n.SH AUTHORS\r\nL. H. de Figueiredo,\r\nR. Ierusalimschy and\r\nW. Celes\r\n.\\\" EOF\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/luac.html",
    "content": "<!-- $Id: luac.man,v 1.28 2006/01/06 16:03:34 lhf Exp $ -->\r\n<HTML>\r\n<HEAD>\r\n<TITLE>LUAC man page</TITLE>\r\n<LINK REL=\"stylesheet\" TYPE=\"text/css\" HREF=\"lua.css\">\r\n</HEAD>\r\n\r\n<BODY BGCOLOR=\"#FFFFFF\">\r\n\r\n<H2>NAME</H2>\r\nluac - Lua compiler\r\n<H2>SYNOPSIS</H2>\r\n<B>luac</B>\r\n[\r\n<I>options</I>\r\n] [\r\n<I>filenames</I>\r\n]\r\n<H2>DESCRIPTION</H2>\r\n<B>luac</B>\r\nis the Lua compiler.\r\nIt translates programs written in the Lua programming language\r\ninto binary files that can be later loaded and executed.\r\n<P>\r\nThe main advantages of precompiling chunks are:\r\nfaster loading,\r\nprotecting source code from accidental user changes,\r\nand\r\noff-line syntax checking.\r\n<P>\r\nPrecompiling does not imply faster execution\r\nbecause in Lua chunks are always compiled into bytecodes before being executed.\r\n<B>luac</B>\r\nsimply allows those bytecodes to be saved in a file for later execution.\r\n<P>\r\nPrecompiled chunks are not necessarily smaller than the corresponding source.\r\nThe main goal in precompiling is faster loading.\r\n<P>\r\nThe binary files created by\r\n<B>luac</B>\r\nare portable only among architectures with the same word size and byte order.\r\n<P>\r\n<B>luac</B>\r\nproduces a single output file containing the bytecodes\r\nfor all source files given.\r\nBy default,\r\nthe output file is named\r\n<B>luac.out</B>,\r\nbut you can change this with the\r\n<B>-o</B>\r\noption.\r\n<P>\r\nIn the command line,\r\nyou can mix\r\ntext files containing Lua source and\r\nbinary files containing precompiled chunks.\r\nThis is useful because several precompiled chunks,\r\neven from different (but compatible) platforms,\r\ncan be combined into a single precompiled chunk.\r\n<P>\r\nYou can use\r\n<B>'-'</B>\r\nto indicate the standard input as a source file\r\nand\r\n<B>'--'</B>\r\nto signal the end of options\r\n(that is,\r\nall remaining arguments will be treated as files even if they start with\r\n<B>'-'</B>).\r\n<P>\r\nThe internal format of the binary files produced by\r\n<B>luac</B>\r\nis likely to change when a new version of Lua is released.\r\nSo,\r\nsave the source files of all Lua programs that you precompile.\r\n<P>\r\n<H2>OPTIONS</H2>\r\nOptions must be separate.\r\n<P>\r\n<B>-l</B>\r\nproduce a listing of the compiled bytecode for Lua's virtual machine.\r\nListing bytecodes is useful to learn about Lua's virtual machine.\r\nIf no files are given, then\r\n<B>luac</B>\r\nloads\r\n<B>luac.out</B>\r\nand lists its contents.\r\n<P>\r\n<B>-o </B><I>file</I>\r\noutput to\r\n<I>file</I>,\r\ninstead of the default\r\n<B>luac.out</B>.\r\n(You can use\r\n<B>'-'</B>\r\nfor standard output,\r\nbut not on platforms that open standard output in text mode.)\r\nThe output file may be a source file because\r\nall files are loaded before the output file is written.\r\nBe careful not to overwrite precious files.\r\n<P>\r\n<B>-p</B>\r\nload files but do not generate any output file.\r\nUsed mainly for syntax checking and for testing precompiled chunks:\r\ncorrupted files will probably generate errors when loaded.\r\nLua always performs a thorough integrity test on precompiled chunks.\r\nBytecode that passes this test is completely safe,\r\nin the sense that it will not break the interpreter.\r\nHowever,\r\nthere is no guarantee that such code does anything sensible.\r\n(None can be given, because the halting problem is unsolvable.)\r\nIf no files are given, then\r\n<B>luac</B>\r\nloads\r\n<B>luac.out</B>\r\nand tests its contents.\r\nNo messages are displayed if the file passes the integrity test.\r\n<P>\r\n<B>-s</B>\r\nstrip debug information before writing the output file.\r\nThis saves some space in very large chunks,\r\nbut if errors occur when running a stripped chunk,\r\nthen the error messages may not contain the full information they usually do.\r\nFor instance,\r\nline numbers and names of local variables are lost.\r\n<P>\r\n<B>-v</B>\r\nshow version information.\r\n<H2>FILES</H2>\r\n<P>\r\n<B>luac.out</B>\r\ndefault output file\r\n<H2>SEE ALSO</H2>\r\n<B>lua</B>(1)\r\n<BR>\r\n<A HREF=\"http://www.lua.org/\">http://www.lua.org/</A>\r\n<H2>DIAGNOSTICS</H2>\r\nError messages should be self explanatory.\r\n<H2>AUTHORS</H2>\r\nL. H. de Figueiredo,\r\nR. Ierusalimschy and\r\nW. Celes\r\n<!-- EOF -->\r\n</BODY>\r\n</HTML>\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/manual.css",
    "content": "h3 code {\r\n\tfont-family: inherit ;\r\n\tfont-size: inherit ;\r\n}\r\n\r\npre, code {\r\n\tfont-size: 12pt ;\r\n}\r\n\r\nspan.apii {\r\n\tfloat: right ;\r\n\tfont-family: inherit ;\r\n\tfont-style: normal ;\r\n\tfont-size: small ;\r\n\tcolor: gray ;\r\n}\r\n\r\np+h1, ul+h1 {\r\n\tpadding-top: 0.4em ;\r\n\tpadding-bottom: 0.4em ;\r\n\tpadding-left: 30px ;\r\n\tmargin-left: -30px ;\r\n\tbackground-color: #E0E0FF ;\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/manual.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\">\r\n<html>\r\n\r\n<head>\r\n<title>Lua 5.1 Reference Manual</title>\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"lua.css\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"manual.css\">\r\n<META HTTP-EQUIV=\"content-type\" CONTENT=\"text/html; charset=iso-8859-1\">\r\n</head>\r\n\r\n<body>\r\n\r\n<hr>\r\n<h1>\r\n<a href=\"http://www.lua.org/\"><img src=\"logo.gif\" alt=\"\" border=\"0\"></a>\r\nLua 5.1 Reference Manual\r\n</h1>\r\n\r\nby Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes\r\n<p>\r\n<small>\r\nCopyright &copy; 2006&ndash;2012 Lua.org, PUC-Rio.\r\nFreely available under the terms of the\r\n<a href=\"http://www.lua.org/license.html\">Lua license</a>.\r\n</small>\r\n<hr>\r\n<p>\r\n\r\n<a href=\"contents.html#contents\">contents</A>\r\n&middot;\r\n<a href=\"contents.html#index\">index</A>\r\n&middot;\r\n<A HREF=\"http://www.lua.org/manual/\">other versions</A>\r\n\r\n<!-- ====================================================================== -->\r\n<p>\r\n\r\n<!-- $Id: manual.of,v 1.49.1.2 2012/01/13 20:23:26 roberto Exp $ -->\r\n\r\n\r\n\r\n\r\n<h1>1 - <a name=\"1\">Introduction</a></h1>\r\n\r\n<p>\r\nLua is an extension programming language designed to support\r\ngeneral procedural programming with data description\r\nfacilities.\r\nIt also offers good support for object-oriented programming,\r\nfunctional programming, and data-driven programming.\r\nLua is intended to be used as a powerful, light-weight\r\nscripting language for any program that needs one.\r\nLua is implemented as a library, written in <em>clean</em> C\r\n(that is, in the common subset of ANSI&nbsp;C and C++).\r\n\r\n\r\n<p>\r\nBeing an extension language, Lua has no notion of a \"main\" program:\r\nit only works <em>embedded</em> in a host client,\r\ncalled the <em>embedding program</em> or simply the <em>host</em>.\r\nThis host program can invoke functions to execute a piece of Lua code,\r\ncan write and read Lua variables,\r\nand can register C&nbsp;functions to be called by Lua code.\r\nThrough the use of C&nbsp;functions, Lua can be augmented to cope with\r\na wide range of different domains,\r\nthus creating customized programming languages sharing a syntactical framework.\r\nThe Lua distribution includes a sample host program called <code>lua</code>,\r\nwhich uses the Lua library to offer a complete, stand-alone Lua interpreter.\r\n\r\n\r\n<p>\r\nLua is free software,\r\nand is provided as usual with no guarantees,\r\nas stated in its license.\r\nThe implementation described in this manual is available\r\nat Lua's official web site, <code>www.lua.org</code>.\r\n\r\n\r\n<p>\r\nLike any other reference manual,\r\nthis document is dry in places.\r\nFor a discussion of the decisions behind the design of Lua,\r\nsee the technical papers available at Lua's web site.\r\nFor a detailed introduction to programming in Lua,\r\nsee Roberto's book, <em>Programming in Lua (Second Edition)</em>.\r\n\r\n\r\n\r\n<h1>2 - <a name=\"2\">The Language</a></h1>\r\n\r\n<p>\r\nThis section describes the lexis, the syntax, and the semantics of Lua.\r\nIn other words,\r\nthis section describes\r\nwhich tokens are valid,\r\nhow they can be combined,\r\nand what their combinations mean.\r\n\r\n\r\n<p>\r\nThe language constructs will be explained using the usual extended BNF notation,\r\nin which\r\n{<em>a</em>}&nbsp;means&nbsp;0 or more <em>a</em>'s, and\r\n[<em>a</em>]&nbsp;means an optional <em>a</em>.\r\nNon-terminals are shown like non-terminal,\r\nkeywords are shown like <b>kword</b>,\r\nand other terminal symbols are shown like `<b>=</b>&acute;.\r\nThe complete syntax of Lua can be found in <a href=\"#8\">&sect;8</a>\r\nat the end of this manual.\r\n\r\n\r\n\r\n<h2>2.1 - <a name=\"2.1\">Lexical Conventions</a></h2>\r\n\r\n<p>\r\n<em>Names</em>\r\n(also called <em>identifiers</em>)\r\nin Lua can be any string of letters,\r\ndigits, and underscores,\r\nnot beginning with a digit.\r\nThis coincides with the definition of names in most languages.\r\n(The definition of letter depends on the current locale:\r\nany character considered alphabetic by the current locale\r\ncan be used in an identifier.)\r\nIdentifiers are used to name variables and table fields.\r\n\r\n\r\n<p>\r\nThe following <em>keywords</em> are reserved\r\nand cannot be used as names:\r\n\r\n\r\n<pre>\r\n     and       break     do        else      elseif\r\n     end       false     for       function  if\r\n     in        local     nil       not       or\r\n     repeat    return    then      true      until     while\r\n</pre>\r\n\r\n<p>\r\nLua is a case-sensitive language:\r\n<code>and</code> is a reserved word, but <code>And</code> and <code>AND</code>\r\nare two different, valid names.\r\nAs a convention, names starting with an underscore followed by\r\nuppercase letters (such as <a href=\"#pdf-_VERSION\"><code>_VERSION</code></a>)\r\nare reserved for internal global variables used by Lua.\r\n\r\n\r\n<p>\r\nThe following strings denote other tokens:\r\n\r\n<pre>\r\n     +     -     *     /     %     ^     #\r\n     ==    ~=    &lt;=    &gt;=    &lt;     &gt;     =\r\n     (     )     {     }     [     ]\r\n     ;     :     ,     .     ..    ...\r\n</pre>\r\n\r\n<p>\r\n<em>Literal strings</em>\r\ncan be delimited by matching single or double quotes,\r\nand can contain the following C-like escape sequences:\r\n'<code>\\a</code>' (bell),\r\n'<code>\\b</code>' (backspace),\r\n'<code>\\f</code>' (form feed),\r\n'<code>\\n</code>' (newline),\r\n'<code>\\r</code>' (carriage return),\r\n'<code>\\t</code>' (horizontal tab),\r\n'<code>\\v</code>' (vertical tab),\r\n'<code>\\\\</code>' (backslash),\r\n'<code>\\\"</code>' (quotation mark [double quote]),\r\nand '<code>\\'</code>' (apostrophe [single quote]).\r\nMoreover, a backslash followed by a real newline\r\nresults in a newline in the string.\r\nA character in a string can also be specified by its numerical value\r\nusing the escape sequence <code>\\<em>ddd</em></code>,\r\nwhere <em>ddd</em> is a sequence of up to three decimal digits.\r\n(Note that if a numerical escape is to be followed by a digit,\r\nit must be expressed using exactly three digits.)\r\nStrings in Lua can contain any 8-bit value, including embedded zeros,\r\nwhich can be specified as '<code>\\0</code>'.\r\n\r\n\r\n<p>\r\nLiteral strings can also be defined using a long format\r\nenclosed by <em>long brackets</em>.\r\nWe define an <em>opening long bracket of level <em>n</em></em> as an opening\r\nsquare bracket followed by <em>n</em> equal signs followed by another\r\nopening square bracket.\r\nSo, an opening long bracket of level&nbsp;0 is written as <code>[[</code>,\r\nan opening long bracket of level&nbsp;1 is written as <code>[=[</code>,\r\nand so on.\r\nA <em>closing long bracket</em> is defined similarly;\r\nfor instance, a closing long bracket of level&nbsp;4 is written as <code>]====]</code>.\r\nA long string starts with an opening long bracket of any level and\r\nends at the first closing long bracket of the same level.\r\nLiterals in this bracketed form can run for several lines,\r\ndo not interpret any escape sequences,\r\nand ignore long brackets of any other level.\r\nThey can contain anything except a closing bracket of the proper level.\r\n\r\n\r\n<p>\r\nFor convenience,\r\nwhen the opening long bracket is immediately followed by a newline,\r\nthe newline is not included in the string.\r\nAs an example, in a system using ASCII\r\n(in which '<code>a</code>' is coded as&nbsp;97,\r\nnewline is coded as&nbsp;10, and '<code>1</code>' is coded as&nbsp;49),\r\nthe five literal strings below denote the same string:\r\n\r\n<pre>\r\n     a = 'alo\\n123\"'\r\n     a = \"alo\\n123\\\"\"\r\n     a = '\\97lo\\10\\04923\"'\r\n     a = [[alo\r\n     123\"]]\r\n     a = [==[\r\n     alo\r\n     123\"]==]\r\n</pre>\r\n\r\n<p>\r\nA <em>numerical constant</em> can be written with an optional decimal part\r\nand an optional decimal exponent.\r\nLua also accepts integer hexadecimal constants,\r\nby prefixing them with <code>0x</code>.\r\nExamples of valid numerical constants are\r\n\r\n<pre>\r\n     3   3.0   3.1416   314.16e-2   0.31416E1   0xff   0x56\r\n</pre>\r\n\r\n<p>\r\nA <em>comment</em> starts with a double hyphen (<code>--</code>)\r\nanywhere outside a string.\r\nIf the text immediately after <code>--</code> is not an opening long bracket,\r\nthe comment is a <em>short comment</em>,\r\nwhich runs until the end of the line.\r\nOtherwise, it is a <em>long comment</em>,\r\nwhich runs until the corresponding closing long bracket.\r\nLong comments are frequently used to disable code temporarily.\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.2 - <a name=\"2.2\">Values and Types</a></h2>\r\n\r\n<p>\r\nLua is a <em>dynamically typed language</em>.\r\nThis means that\r\nvariables do not have types; only values do.\r\nThere are no type definitions in the language.\r\nAll values carry their own type.\r\n\r\n\r\n<p>\r\nAll values in Lua are <em>first-class values</em>.\r\nThis means that all values can be stored in variables,\r\npassed as arguments to other functions, and returned as results.\r\n\r\n\r\n<p>\r\nThere are eight basic types in Lua:\r\n<em>nil</em>, <em>boolean</em>, <em>number</em>,\r\n<em>string</em>, <em>function</em>, <em>userdata</em>,\r\n<em>thread</em>, and <em>table</em>.\r\n<em>Nil</em> is the type of the value <b>nil</b>,\r\nwhose main property is to be different from any other value;\r\nit usually represents the absence of a useful value.\r\n<em>Boolean</em> is the type of the values <b>false</b> and <b>true</b>.\r\nBoth <b>nil</b> and <b>false</b> make a condition false;\r\nany other value makes it true.\r\n<em>Number</em> represents real (double-precision floating-point) numbers.\r\n(It is easy to build Lua interpreters that use other\r\ninternal representations for numbers,\r\nsuch as single-precision float or long integers;\r\nsee file <code>luaconf.h</code>.)\r\n<em>String</em> represents arrays of characters.\r\n\r\nLua is 8-bit clean:\r\nstrings can contain any 8-bit character,\r\nincluding embedded zeros ('<code>\\0</code>') (see <a href=\"#2.1\">&sect;2.1</a>).\r\n\r\n\r\n<p>\r\nLua can call (and manipulate) functions written in Lua and\r\nfunctions written in C\r\n(see <a href=\"#2.5.8\">&sect;2.5.8</a>).\r\n\r\n\r\n<p>\r\nThe type <em>userdata</em> is provided to allow arbitrary C&nbsp;data to\r\nbe stored in Lua variables.\r\nThis type corresponds to a block of raw memory\r\nand has no pre-defined operations in Lua,\r\nexcept assignment and identity test.\r\nHowever, by using <em>metatables</em>,\r\nthe programmer can define operations for userdata values\r\n(see <a href=\"#2.8\">&sect;2.8</a>).\r\nUserdata values cannot be created or modified in Lua,\r\nonly through the C&nbsp;API.\r\nThis guarantees the integrity of data owned by the host program.\r\n\r\n\r\n<p>\r\nThe type <em>thread</em> represents independent threads of execution\r\nand it is used to implement coroutines (see <a href=\"#2.11\">&sect;2.11</a>).\r\nDo not confuse Lua threads with operating-system threads.\r\nLua supports coroutines on all systems,\r\neven those that do not support threads.\r\n\r\n\r\n<p>\r\nThe type <em>table</em> implements associative arrays,\r\nthat is, arrays that can be indexed not only with numbers,\r\nbut with any value (except <b>nil</b>).\r\nTables can be <em>heterogeneous</em>;\r\nthat is, they can contain values of all types (except <b>nil</b>).\r\nTables are the sole data structuring mechanism in Lua;\r\nthey can be used to represent ordinary arrays,\r\nsymbol tables, sets, records, graphs, trees, etc.\r\nTo represent records, Lua uses the field name as an index.\r\nThe language supports this representation by\r\nproviding <code>a.name</code> as syntactic sugar for <code>a[\"name\"]</code>.\r\nThere are several convenient ways to create tables in Lua\r\n(see <a href=\"#2.5.7\">&sect;2.5.7</a>).\r\n\r\n\r\n<p>\r\nLike indices,\r\nthe value of a table field can be of any type (except <b>nil</b>).\r\nIn particular,\r\nbecause functions are first-class values,\r\ntable fields can contain functions.\r\nThus tables can also carry <em>methods</em> (see <a href=\"#2.5.9\">&sect;2.5.9</a>).\r\n\r\n\r\n<p>\r\nTables, functions, threads, and (full) userdata values are <em>objects</em>:\r\nvariables do not actually <em>contain</em> these values,\r\nonly <em>references</em> to them.\r\nAssignment, parameter passing, and function returns\r\nalways manipulate references to such values;\r\nthese operations do not imply any kind of copy.\r\n\r\n\r\n<p>\r\nThe library function <a href=\"#pdf-type\"><code>type</code></a> returns a string describing the type\r\nof a given value.\r\n\r\n\r\n\r\n<h3>2.2.1 - <a name=\"2.2.1\">Coercion</a></h3>\r\n\r\n<p>\r\nLua provides automatic conversion between\r\nstring and number values at run time.\r\nAny arithmetic operation applied to a string tries to convert\r\nthis string to a number, following the usual conversion rules.\r\nConversely, whenever a number is used where a string is expected,\r\nthe number is converted to a string, in a reasonable format.\r\nFor complete control over how numbers are converted to strings,\r\nuse the <code>format</code> function from the string library\r\n(see <a href=\"#pdf-string.format\"><code>string.format</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.3 - <a name=\"2.3\">Variables</a></h2>\r\n\r\n<p>\r\nVariables are places that store values.\r\n\r\nThere are three kinds of variables in Lua:\r\nglobal variables, local variables, and table fields.\r\n\r\n\r\n<p>\r\nA single name can denote a global variable or a local variable\r\n(or a function's formal parameter,\r\nwhich is a particular kind of local variable):\r\n\r\n<pre>\r\n\tvar ::= Name\r\n</pre><p>\r\nName denotes identifiers, as defined in <a href=\"#2.1\">&sect;2.1</a>.\r\n\r\n\r\n<p>\r\nAny variable is assumed to be global unless explicitly declared\r\nas a local (see <a href=\"#2.4.7\">&sect;2.4.7</a>).\r\nLocal variables are <em>lexically scoped</em>:\r\nlocal variables can be freely accessed by functions\r\ndefined inside their scope (see <a href=\"#2.6\">&sect;2.6</a>).\r\n\r\n\r\n<p>\r\nBefore the first assignment to a variable, its value is <b>nil</b>.\r\n\r\n\r\n<p>\r\nSquare brackets are used to index a table:\r\n\r\n<pre>\r\n\tvar ::= prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute;\r\n</pre><p>\r\nThe meaning of accesses to global variables \r\nand table fields can be changed via metatables.\r\nAn access to an indexed variable <code>t[i]</code> is equivalent to\r\na call <code>gettable_event(t,i)</code>.\r\n(See <a href=\"#2.8\">&sect;2.8</a> for a complete description of the\r\n<code>gettable_event</code> function.\r\nThis function is not defined or callable in Lua.\r\nWe use it here only for explanatory purposes.)\r\n\r\n\r\n<p>\r\nThe syntax <code>var.Name</code> is just syntactic sugar for\r\n<code>var[\"Name\"]</code>:\r\n\r\n<pre>\r\n\tvar ::= prefixexp `<b>.</b>&acute; Name\r\n</pre>\r\n\r\n<p>\r\nAll global variables live as fields in ordinary Lua tables,\r\ncalled <em>environment tables</em> or simply\r\n<em>environments</em> (see <a href=\"#2.9\">&sect;2.9</a>).\r\nEach function has its own reference to an environment,\r\nso that all global variables in this function\r\nwill refer to this environment table.\r\nWhen a function is created,\r\nit inherits the environment from the function that created it.\r\nTo get the environment table of a Lua function,\r\nyou call <a href=\"#pdf-getfenv\"><code>getfenv</code></a>.\r\nTo replace it,\r\nyou call <a href=\"#pdf-setfenv\"><code>setfenv</code></a>.\r\n(You can only manipulate the environment of C&nbsp;functions\r\nthrough the debug library; (see <a href=\"#5.9\">&sect;5.9</a>).)\r\n\r\n\r\n<p>\r\nAn access to a global variable <code>x</code>\r\nis equivalent to <code>_env.x</code>,\r\nwhich in turn is equivalent to\r\n\r\n<pre>\r\n     gettable_event(_env, \"x\")\r\n</pre><p>\r\nwhere <code>_env</code> is the environment of the running function.\r\n(See <a href=\"#2.8\">&sect;2.8</a> for a complete description of the\r\n<code>gettable_event</code> function.\r\nThis function is not defined or callable in Lua.\r\nSimilarly, the <code>_env</code> variable is not defined in Lua.\r\nWe use them here only for explanatory purposes.)\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.4 - <a name=\"2.4\">Statements</a></h2>\r\n\r\n<p>\r\nLua supports an almost conventional set of statements,\r\nsimilar to those in Pascal or C.\r\nThis set includes\r\nassignments, control structures, function calls,\r\nand variable declarations.\r\n\r\n\r\n\r\n<h3>2.4.1 - <a name=\"2.4.1\">Chunks</a></h3>\r\n\r\n<p>\r\nThe unit of execution of Lua is called a <em>chunk</em>.\r\nA chunk is simply a sequence of statements,\r\nwhich are executed sequentially.\r\nEach statement can be optionally followed by a semicolon:\r\n\r\n<pre>\r\n\tchunk ::= {stat [`<b>;</b>&acute;]}\r\n</pre><p>\r\nThere are no empty statements and thus '<code>;;</code>' is not legal.\r\n\r\n\r\n<p>\r\nLua handles a chunk as the body of an anonymous function \r\nwith a variable number of arguments\r\n(see <a href=\"#2.5.9\">&sect;2.5.9</a>).\r\nAs such, chunks can define local variables,\r\nreceive arguments, and return values.\r\n\r\n\r\n<p>\r\nA chunk can be stored in a file or in a string inside the host program.\r\nTo execute a chunk,\r\nLua first pre-compiles the chunk into instructions for a virtual machine,\r\nand then it executes the compiled code\r\nwith an interpreter for the virtual machine.\r\n\r\n\r\n<p>\r\nChunks can also be pre-compiled into binary form;\r\nsee program <code>luac</code> for details.\r\nPrograms in source and compiled forms are interchangeable;\r\nLua automatically detects the file type and acts accordingly.\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.4.2 - <a name=\"2.4.2\">Blocks</a></h3><p>\r\nA block is a list of statements;\r\nsyntactically, a block is the same as a chunk:\r\n\r\n<pre>\r\n\tblock ::= chunk\r\n</pre>\r\n\r\n<p>\r\nA block can be explicitly delimited to produce a single statement:\r\n\r\n<pre>\r\n\tstat ::= <b>do</b> block <b>end</b>\r\n</pre><p>\r\nExplicit blocks are useful\r\nto control the scope of variable declarations.\r\nExplicit blocks are also sometimes used to\r\nadd a <b>return</b> or <b>break</b> statement in the middle\r\nof another block (see <a href=\"#2.4.4\">&sect;2.4.4</a>).\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.4.3 - <a name=\"2.4.3\">Assignment</a></h3>\r\n\r\n<p>\r\nLua allows multiple assignments.\r\nTherefore, the syntax for assignment\r\ndefines a list of variables on the left side\r\nand a list of expressions on the right side.\r\nThe elements in both lists are separated by commas:\r\n\r\n<pre>\r\n\tstat ::= varlist `<b>=</b>&acute; explist\r\n\tvarlist ::= var {`<b>,</b>&acute; var}\r\n\texplist ::= exp {`<b>,</b>&acute; exp}\r\n</pre><p>\r\nExpressions are discussed in <a href=\"#2.5\">&sect;2.5</a>.\r\n\r\n\r\n<p>\r\nBefore the assignment,\r\nthe list of values is <em>adjusted</em> to the length of\r\nthe list of variables.\r\nIf there are more values than needed,\r\nthe excess values are thrown away.\r\nIf there are fewer values than needed,\r\nthe list is extended with as many  <b>nil</b>'s as needed.\r\nIf the list of expressions ends with a function call,\r\nthen all values returned by that call enter the list of values,\r\nbefore the adjustment\r\n(except when the call is enclosed in parentheses; see <a href=\"#2.5\">&sect;2.5</a>).\r\n\r\n\r\n<p>\r\nThe assignment statement first evaluates all its expressions\r\nand only then are the assignments performed.\r\nThus the code\r\n\r\n<pre>\r\n     i = 3\r\n     i, a[i] = i+1, 20\r\n</pre><p>\r\nsets <code>a[3]</code> to 20, without affecting <code>a[4]</code>\r\nbecause the <code>i</code> in <code>a[i]</code> is evaluated (to 3)\r\nbefore it is assigned&nbsp;4.\r\nSimilarly, the line\r\n\r\n<pre>\r\n     x, y = y, x\r\n</pre><p>\r\nexchanges the values of <code>x</code> and <code>y</code>,\r\nand\r\n\r\n<pre>\r\n     x, y, z = y, z, x\r\n</pre><p>\r\ncyclically permutes the values of <code>x</code>, <code>y</code>, and <code>z</code>.\r\n\r\n\r\n<p>\r\nThe meaning of assignments to global variables\r\nand table fields can be changed via metatables.\r\nAn assignment to an indexed variable <code>t[i] = val</code> is equivalent to\r\n<code>settable_event(t,i,val)</code>.\r\n(See <a href=\"#2.8\">&sect;2.8</a> for a complete description of the\r\n<code>settable_event</code> function.\r\nThis function is not defined or callable in Lua.\r\nWe use it here only for explanatory purposes.)\r\n\r\n\r\n<p>\r\nAn assignment to a global variable <code>x = val</code>\r\nis equivalent to the assignment\r\n<code>_env.x = val</code>,\r\nwhich in turn is equivalent to\r\n\r\n<pre>\r\n     settable_event(_env, \"x\", val)\r\n</pre><p>\r\nwhere <code>_env</code> is the environment of the running function.\r\n(The <code>_env</code> variable is not defined in Lua.\r\nWe use it here only for explanatory purposes.)\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.4.4 - <a name=\"2.4.4\">Control Structures</a></h3><p>\r\nThe control structures\r\n<b>if</b>, <b>while</b>, and <b>repeat</b> have the usual meaning and\r\nfamiliar syntax:\r\n\r\n\r\n\r\n\r\n<pre>\r\n\tstat ::= <b>while</b> exp <b>do</b> block <b>end</b>\r\n\tstat ::= <b>repeat</b> block <b>until</b> exp\r\n\tstat ::= <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b>\r\n</pre><p>\r\nLua also has a <b>for</b> statement, in two flavors (see <a href=\"#2.4.5\">&sect;2.4.5</a>).\r\n\r\n\r\n<p>\r\nThe condition expression of a\r\ncontrol structure can return any value.\r\nBoth <b>false</b> and <b>nil</b> are considered false.\r\nAll values different from <b>nil</b> and <b>false</b> are considered true\r\n(in particular, the number 0 and the empty string are also true).\r\n\r\n\r\n<p>\r\nIn the <b>repeat</b>&ndash;<b>until</b> loop,\r\nthe inner block does not end at the <b>until</b> keyword,\r\nbut only after the condition.\r\nSo, the condition can refer to local variables\r\ndeclared inside the loop block.\r\n\r\n\r\n<p>\r\nThe <b>return</b> statement is used to return values\r\nfrom a function or a chunk (which is just a function).\r\n\r\nFunctions and chunks can return more than one value,\r\nand so the syntax for the <b>return</b> statement is\r\n\r\n<pre>\r\n\tstat ::= <b>return</b> [explist]\r\n</pre>\r\n\r\n<p>\r\nThe <b>break</b> statement is used to terminate the execution of a\r\n<b>while</b>, <b>repeat</b>, or <b>for</b> loop,\r\nskipping to the next statement after the loop:\r\n\r\n\r\n<pre>\r\n\tstat ::= <b>break</b>\r\n</pre><p>\r\nA <b>break</b> ends the innermost enclosing loop.\r\n\r\n\r\n<p>\r\nThe <b>return</b> and <b>break</b>\r\nstatements can only be written as the <em>last</em> statement of a block.\r\nIf it is really necessary to <b>return</b> or <b>break</b> in the\r\nmiddle of a block,\r\nthen an explicit inner block can be used,\r\nas in the idioms\r\n<code>do return end</code> and <code>do break end</code>,\r\nbecause now <b>return</b> and <b>break</b> are the last statements in\r\ntheir (inner) blocks.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.4.5 - <a name=\"2.4.5\">For Statement</a></h3>\r\n\r\n<p>\r\n\r\nThe <b>for</b> statement has two forms:\r\none numeric and one generic.\r\n\r\n\r\n<p>\r\nThe numeric <b>for</b> loop repeats a block of code while a\r\ncontrol variable runs through an arithmetic progression.\r\nIt has the following syntax:\r\n\r\n<pre>\r\n\tstat ::= <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b>\r\n</pre><p>\r\nThe <em>block</em> is repeated for <em>name</em> starting at the value of\r\nthe first <em>exp</em>, until it passes the second <em>exp</em> by steps of the\r\nthird <em>exp</em>.\r\nMore precisely, a <b>for</b> statement like\r\n\r\n<pre>\r\n     for v = <em>e1</em>, <em>e2</em>, <em>e3</em> do <em>block</em> end\r\n</pre><p>\r\nis equivalent to the code:\r\n\r\n<pre>\r\n     do\r\n       local <em>var</em>, <em>limit</em>, <em>step</em> = tonumber(<em>e1</em>), tonumber(<em>e2</em>), tonumber(<em>e3</em>)\r\n       if not (<em>var</em> and <em>limit</em> and <em>step</em>) then error() end\r\n       while (<em>step</em> &gt; 0 and <em>var</em> &lt;= <em>limit</em>) or (<em>step</em> &lt;= 0 and <em>var</em> &gt;= <em>limit</em>) do\r\n         local v = <em>var</em>\r\n         <em>block</em>\r\n         <em>var</em> = <em>var</em> + <em>step</em>\r\n       end\r\n     end\r\n</pre><p>\r\nNote the following:\r\n\r\n<ul>\r\n\r\n<li>\r\nAll three control expressions are evaluated only once,\r\nbefore the loop starts.\r\nThey must all result in numbers.\r\n</li>\r\n\r\n<li>\r\n<code><em>var</em></code>, <code><em>limit</em></code>, and <code><em>step</em></code> are invisible variables.\r\nThe names shown here are for explanatory purposes only.\r\n</li>\r\n\r\n<li>\r\nIf the third expression (the step) is absent,\r\nthen a step of&nbsp;1 is used.\r\n</li>\r\n\r\n<li>\r\nYou can use <b>break</b> to exit a <b>for</b> loop.\r\n</li>\r\n\r\n<li>\r\nThe loop variable <code>v</code> is local to the loop;\r\nyou cannot use its value after the <b>for</b> ends or is broken.\r\nIf you need this value,\r\nassign it to another variable before breaking or exiting the loop.\r\n</li>\r\n\r\n</ul>\r\n\r\n<p>\r\nThe generic <b>for</b> statement works over functions,\r\ncalled <em>iterators</em>.\r\nOn each iteration, the iterator function is called to produce a new value,\r\nstopping when this new value is <b>nil</b>.\r\nThe generic <b>for</b> loop has the following syntax:\r\n\r\n<pre>\r\n\tstat ::= <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b>\r\n\tnamelist ::= Name {`<b>,</b>&acute; Name}\r\n</pre><p>\r\nA <b>for</b> statement like\r\n\r\n<pre>\r\n     for <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> in <em>explist</em> do <em>block</em> end\r\n</pre><p>\r\nis equivalent to the code:\r\n\r\n<pre>\r\n     do\r\n       local <em>f</em>, <em>s</em>, <em>var</em> = <em>explist</em>\r\n       while true do\r\n         local <em>var_1</em>, &middot;&middot;&middot;, <em>var_n</em> = <em>f</em>(<em>s</em>, <em>var</em>)\r\n         <em>var</em> = <em>var_1</em>\r\n         if <em>var</em> == nil then break end\r\n         <em>block</em>\r\n       end\r\n     end\r\n</pre><p>\r\nNote the following:\r\n\r\n<ul>\r\n\r\n<li>\r\n<code><em>explist</em></code> is evaluated only once.\r\nIts results are an <em>iterator</em> function,\r\na <em>state</em>,\r\nand an initial value for the first <em>iterator variable</em>.\r\n</li>\r\n\r\n<li>\r\n<code><em>f</em></code>, <code><em>s</em></code>, and <code><em>var</em></code> are invisible variables.\r\nThe names are here for explanatory purposes only.\r\n</li>\r\n\r\n<li>\r\nYou can use <b>break</b> to exit a <b>for</b> loop.\r\n</li>\r\n\r\n<li>\r\nThe loop variables <code><em>var_i</em></code> are local to the loop;\r\nyou cannot use their values after the <b>for</b> ends.\r\nIf you need these values,\r\nthen assign them to other variables before breaking or exiting the loop.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h3>2.4.6 - <a name=\"2.4.6\">Function Calls as Statements</a></h3><p>\r\nTo allow possible side-effects,\r\nfunction calls can be executed as statements:\r\n\r\n<pre>\r\n\tstat ::= functioncall\r\n</pre><p>\r\nIn this case, all returned values are thrown away.\r\nFunction calls are explained in <a href=\"#2.5.8\">&sect;2.5.8</a>.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.4.7 - <a name=\"2.4.7\">Local Declarations</a></h3><p>\r\nLocal variables can be declared anywhere inside a block.\r\nThe declaration can include an initial assignment:\r\n\r\n<pre>\r\n\tstat ::= <b>local</b> namelist [`<b>=</b>&acute; explist]\r\n</pre><p>\r\nIf present, an initial assignment has the same semantics\r\nof a multiple assignment (see <a href=\"#2.4.3\">&sect;2.4.3</a>).\r\nOtherwise, all variables are initialized with <b>nil</b>.\r\n\r\n\r\n<p>\r\nA chunk is also a block (see <a href=\"#2.4.1\">&sect;2.4.1</a>),\r\nand so local variables can be declared in a chunk outside any explicit block.\r\nThe scope of such local variables extends until the end of the chunk.\r\n\r\n\r\n<p>\r\nThe visibility rules for local variables are explained in <a href=\"#2.6\">&sect;2.6</a>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.5 - <a name=\"2.5\">Expressions</a></h2>\r\n\r\n<p>\r\nThe basic expressions in Lua are the following:\r\n\r\n<pre>\r\n\texp ::= prefixexp\r\n\texp ::= <b>nil</b> | <b>false</b> | <b>true</b>\r\n\texp ::= Number\r\n\texp ::= String\r\n\texp ::= function\r\n\texp ::= tableconstructor\r\n\texp ::= `<b>...</b>&acute;\r\n\texp ::= exp binop exp\r\n\texp ::= unop exp\r\n\tprefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;\r\n</pre>\r\n\r\n<p>\r\nNumbers and literal strings are explained in <a href=\"#2.1\">&sect;2.1</a>;\r\nvariables are explained in <a href=\"#2.3\">&sect;2.3</a>;\r\nfunction definitions are explained in <a href=\"#2.5.9\">&sect;2.5.9</a>;\r\nfunction calls are explained in <a href=\"#2.5.8\">&sect;2.5.8</a>;\r\ntable constructors are explained in <a href=\"#2.5.7\">&sect;2.5.7</a>.\r\nVararg expressions,\r\ndenoted by three dots ('<code>...</code>'), can only be used when\r\ndirectly inside a vararg function;\r\nthey are explained in <a href=\"#2.5.9\">&sect;2.5.9</a>.\r\n\r\n\r\n<p>\r\nBinary operators comprise arithmetic operators (see <a href=\"#2.5.1\">&sect;2.5.1</a>),\r\nrelational operators (see <a href=\"#2.5.2\">&sect;2.5.2</a>), logical operators (see <a href=\"#2.5.3\">&sect;2.5.3</a>),\r\nand the concatenation operator (see <a href=\"#2.5.4\">&sect;2.5.4</a>).\r\nUnary operators comprise the unary minus (see <a href=\"#2.5.1\">&sect;2.5.1</a>),\r\nthe unary <b>not</b> (see <a href=\"#2.5.3\">&sect;2.5.3</a>),\r\nand the unary <em>length operator</em> (see <a href=\"#2.5.5\">&sect;2.5.5</a>).\r\n\r\n\r\n<p>\r\nBoth function calls and vararg expressions can result in multiple values.\r\nIf an expression is used as a statement\r\n(only possible for function calls (see <a href=\"#2.4.6\">&sect;2.4.6</a>)),\r\nthen its return list is adjusted to zero elements,\r\nthus discarding all returned values.\r\nIf an expression is used as the last (or the only) element\r\nof a list of expressions,\r\nthen no adjustment is made\r\n(unless the call is enclosed in parentheses).\r\nIn all other contexts,\r\nLua adjusts the result list to one element,\r\ndiscarding all values except the first one.\r\n\r\n\r\n<p>\r\nHere are some examples:\r\n\r\n<pre>\r\n     f()                -- adjusted to 0 results\r\n     g(f(), x)          -- f() is adjusted to 1 result\r\n     g(x, f())          -- g gets x plus all results from f()\r\n     a,b,c = f(), x     -- f() is adjusted to 1 result (c gets nil)\r\n     a,b = ...          -- a gets the first vararg parameter, b gets\r\n                        -- the second (both a and b can get nil if there\r\n                        -- is no corresponding vararg parameter)\r\n     \r\n     a,b,c = x, f()     -- f() is adjusted to 2 results\r\n     a,b,c = f()        -- f() is adjusted to 3 results\r\n     return f()         -- returns all results from f()\r\n     return ...         -- returns all received vararg parameters\r\n     return x,y,f()     -- returns x, y, and all results from f()\r\n     {f()}              -- creates a list with all results from f()\r\n     {...}              -- creates a list with all vararg parameters\r\n     {f(), nil}         -- f() is adjusted to 1 result\r\n</pre>\r\n\r\n<p>\r\nAny expression enclosed in parentheses always results in only one value.\r\nThus,\r\n<code>(f(x,y,z))</code> is always a single value,\r\neven if <code>f</code> returns several values.\r\n(The value of <code>(f(x,y,z))</code> is the first value returned by <code>f</code>\r\nor <b>nil</b> if <code>f</code> does not return any values.)\r\n\r\n\r\n\r\n<h3>2.5.1 - <a name=\"2.5.1\">Arithmetic Operators</a></h3><p>\r\nLua supports the usual arithmetic operators:\r\nthe binary <code>+</code> (addition),\r\n<code>-</code> (subtraction), <code>*</code> (multiplication),\r\n<code>/</code> (division), <code>%</code> (modulo), and <code>^</code> (exponentiation);\r\nand unary <code>-</code> (negation).\r\nIf the operands are numbers, or strings that can be converted to\r\nnumbers (see <a href=\"#2.2.1\">&sect;2.2.1</a>),\r\nthen all operations have the usual meaning.\r\nExponentiation works for any exponent.\r\nFor instance, <code>x^(-0.5)</code> computes the inverse of the square root of <code>x</code>.\r\nModulo is defined as\r\n\r\n<pre>\r\n     a % b == a - math.floor(a/b)*b\r\n</pre><p>\r\nThat is, it is the remainder of a division that rounds\r\nthe quotient towards minus infinity.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.2 - <a name=\"2.5.2\">Relational Operators</a></h3><p>\r\nThe relational operators in Lua are\r\n\r\n<pre>\r\n     ==    ~=    &lt;     &gt;     &lt;=    &gt;=\r\n</pre><p>\r\nThese operators always result in <b>false</b> or <b>true</b>.\r\n\r\n\r\n<p>\r\nEquality (<code>==</code>) first compares the type of its operands.\r\nIf the types are different, then the result is <b>false</b>.\r\nOtherwise, the values of the operands are compared.\r\nNumbers and strings are compared in the usual way.\r\nObjects (tables, userdata, threads, and functions)\r\nare compared by <em>reference</em>:\r\ntwo objects are considered equal only if they are the <em>same</em> object.\r\nEvery time you create a new object\r\n(a table, userdata, thread, or function),\r\nthis new object is different from any previously existing object.\r\n\r\n\r\n<p>\r\nYou can change the way that Lua compares tables and userdata \r\nby using the \"eq\" metamethod (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n<p>\r\nThe conversion rules of <a href=\"#2.2.1\">&sect;2.2.1</a>\r\n<em>do not</em> apply to equality comparisons.\r\nThus, <code>\"0\"==0</code> evaluates to <b>false</b>,\r\nand <code>t[0]</code> and <code>t[\"0\"]</code> denote different\r\nentries in a table.\r\n\r\n\r\n<p>\r\nThe operator <code>~=</code> is exactly the negation of equality (<code>==</code>).\r\n\r\n\r\n<p>\r\nThe order operators work as follows.\r\nIf both arguments are numbers, then they are compared as such.\r\nOtherwise, if both arguments are strings,\r\nthen their values are compared according to the current locale.\r\nOtherwise, Lua tries to call the \"lt\" or the \"le\"\r\nmetamethod (see <a href=\"#2.8\">&sect;2.8</a>).\r\nA comparison <code>a &gt; b</code> is translated to <code>b &lt; a</code>\r\nand <code>a &gt;= b</code> is translated to <code>b &lt;= a</code>.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.3 - <a name=\"2.5.3\">Logical Operators</a></h3><p>\r\nThe logical operators in Lua are\r\n<b>and</b>, <b>or</b>, and <b>not</b>.\r\nLike the control structures (see <a href=\"#2.4.4\">&sect;2.4.4</a>),\r\nall logical operators consider both <b>false</b> and <b>nil</b> as false\r\nand anything else as true.\r\n\r\n\r\n<p>\r\nThe negation operator <b>not</b> always returns <b>false</b> or <b>true</b>.\r\nThe conjunction operator <b>and</b> returns its first argument\r\nif this value is <b>false</b> or <b>nil</b>;\r\notherwise, <b>and</b> returns its second argument.\r\nThe disjunction operator <b>or</b> returns its first argument\r\nif this value is different from <b>nil</b> and <b>false</b>;\r\notherwise, <b>or</b> returns its second argument.\r\nBoth <b>and</b> and <b>or</b> use short-cut evaluation;\r\nthat is,\r\nthe second operand is evaluated only if necessary.\r\nHere are some examples:\r\n\r\n<pre>\r\n     10 or 20            --&gt; 10\r\n     10 or error()       --&gt; 10\r\n     nil or \"a\"          --&gt; \"a\"\r\n     nil and 10          --&gt; nil\r\n     false and error()   --&gt; false\r\n     false and nil       --&gt; false\r\n     false or nil        --&gt; nil\r\n     10 and 20           --&gt; 20\r\n</pre><p>\r\n(In this manual,\r\n<code>--&gt;</code> indicates the result of the preceding expression.)\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.4 - <a name=\"2.5.4\">Concatenation</a></h3><p>\r\nThe string concatenation operator in Lua is\r\ndenoted by two dots ('<code>..</code>').\r\nIf both operands are strings or numbers, then they are converted to\r\nstrings according to the rules mentioned in <a href=\"#2.2.1\">&sect;2.2.1</a>.\r\nOtherwise, the \"concat\" metamethod is called (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.5 - <a name=\"2.5.5\">The Length Operator</a></h3>\r\n\r\n<p>\r\nThe length operator is denoted by the unary operator <code>#</code>.\r\nThe length of a string is its number of bytes\r\n(that is, the usual meaning of string length when each\r\ncharacter is one byte).\r\n\r\n\r\n<p>\r\nThe length of a table <code>t</code> is defined to be any\r\ninteger index <code>n</code>\r\nsuch that <code>t[n]</code> is not <b>nil</b> and <code>t[n+1]</code> is <b>nil</b>;\r\nmoreover, if <code>t[1]</code> is <b>nil</b>, <code>n</code> can be zero.\r\nFor a regular array, with non-nil values from 1 to a given <code>n</code>,\r\nits length is exactly that <code>n</code>,\r\nthe index of its last value.\r\nIf the array has \"holes\"\r\n(that is, <b>nil</b> values between other non-nil values),\r\nthen <code>#t</code> can be any of the indices that\r\ndirectly precedes a <b>nil</b> value\r\n(that is, it may consider any such <b>nil</b> value as the end of\r\nthe array). \r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.6 - <a name=\"2.5.6\">Precedence</a></h3><p>\r\nOperator precedence in Lua follows the table below,\r\nfrom lower to higher priority:\r\n\r\n<pre>\r\n     or\r\n     and\r\n     &lt;     &gt;     &lt;=    &gt;=    ~=    ==\r\n     ..\r\n     +     -\r\n     *     /     %\r\n     not   #     - (unary)\r\n     ^\r\n</pre><p>\r\nAs usual,\r\nyou can use parentheses to change the precedences of an expression.\r\nThe concatenation ('<code>..</code>') and exponentiation ('<code>^</code>')\r\noperators are right associative.\r\nAll other binary operators are left associative.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.7 - <a name=\"2.5.7\">Table Constructors</a></h3><p>\r\nTable constructors are expressions that create tables.\r\nEvery time a constructor is evaluated, a new table is created.\r\nA constructor can be used to create an empty table\r\nor to create a table and initialize some of its fields.\r\nThe general syntax for constructors is\r\n\r\n<pre>\r\n\ttableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;\r\n\tfieldlist ::= field {fieldsep field} [fieldsep]\r\n\tfield ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp\r\n\tfieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;\r\n</pre>\r\n\r\n<p>\r\nEach field of the form <code>[exp1] = exp2</code> adds to the new table an entry\r\nwith key <code>exp1</code> and value <code>exp2</code>.\r\nA field of the form <code>name = exp</code> is equivalent to\r\n<code>[\"name\"] = exp</code>.\r\nFinally, fields of the form <code>exp</code> are equivalent to\r\n<code>[i] = exp</code>, where <code>i</code> are consecutive numerical integers,\r\nstarting with 1.\r\nFields in the other formats do not affect this counting.\r\nFor example,\r\n\r\n<pre>\r\n     a = { [f(1)] = g; \"x\", \"y\"; x = 1, f(x), [30] = 23; 45 }\r\n</pre><p>\r\nis equivalent to\r\n\r\n<pre>\r\n     do\r\n       local t = {}\r\n       t[f(1)] = g\r\n       t[1] = \"x\"         -- 1st exp\r\n       t[2] = \"y\"         -- 2nd exp\r\n       t.x = 1            -- t[\"x\"] = 1\r\n       t[3] = f(x)        -- 3rd exp\r\n       t[30] = 23\r\n       t[4] = 45          -- 4th exp\r\n       a = t\r\n     end\r\n</pre>\r\n\r\n<p>\r\nIf the last field in the list has the form <code>exp</code>\r\nand the expression is a function call or a vararg expression,\r\nthen all values returned by this expression enter the list consecutively\r\n(see <a href=\"#2.5.8\">&sect;2.5.8</a>).\r\nTo avoid this,\r\nenclose the function call or the vararg expression\r\nin parentheses (see <a href=\"#2.5\">&sect;2.5</a>).\r\n\r\n\r\n<p>\r\nThe field list can have an optional trailing separator,\r\nas a convenience for machine-generated code.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.5.8 - <a name=\"2.5.8\">Function Calls</a></h3><p>\r\nA function call in Lua has the following syntax:\r\n\r\n<pre>\r\n\tfunctioncall ::= prefixexp args\r\n</pre><p>\r\nIn a function call,\r\nfirst prefixexp and args are evaluated.\r\nIf the value of prefixexp has type <em>function</em>,\r\nthen this function is called\r\nwith the given arguments.\r\nOtherwise, the prefixexp \"call\" metamethod is called,\r\nhaving as first parameter the value of prefixexp,\r\nfollowed by the original call arguments\r\n(see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n<p>\r\nThe form\r\n\r\n<pre>\r\n\tfunctioncall ::= prefixexp `<b>:</b>&acute; Name args\r\n</pre><p>\r\ncan be used to call \"methods\".\r\nA call <code>v:name(<em>args</em>)</code>\r\nis syntactic sugar for <code>v.name(v,<em>args</em>)</code>,\r\nexcept that <code>v</code> is evaluated only once.\r\n\r\n\r\n<p>\r\nArguments have the following syntax:\r\n\r\n<pre>\r\n\targs ::= `<b>(</b>&acute; [explist] `<b>)</b>&acute;\r\n\targs ::= tableconstructor\r\n\targs ::= String\r\n</pre><p>\r\nAll argument expressions are evaluated before the call.\r\nA call of the form <code>f{<em>fields</em>}</code> is\r\nsyntactic sugar for <code>f({<em>fields</em>})</code>;\r\nthat is, the argument list is a single new table.\r\nA call of the form <code>f'<em>string</em>'</code>\r\n(or <code>f\"<em>string</em>\"</code> or <code>f[[<em>string</em>]]</code>)\r\nis syntactic sugar for <code>f('<em>string</em>')</code>;\r\nthat is, the argument list is a single literal string.\r\n\r\n\r\n<p>\r\nAs an exception to the free-format syntax of Lua,\r\nyou cannot put a line break before the '<code>(</code>' in a function call.\r\nThis restriction avoids some ambiguities in the language.\r\nIf you write\r\n\r\n<pre>\r\n     a = f\r\n     (g).x(a)\r\n</pre><p>\r\nLua would see that as a single statement, <code>a = f(g).x(a)</code>.\r\nSo, if you want two statements, you must add a semi-colon between them.\r\nIf you actually want to call <code>f</code>,\r\nyou must remove the line break before <code>(g)</code>.\r\n\r\n\r\n<p>\r\nA call of the form <code>return</code> <em>functioncall</em> is called\r\na <em>tail call</em>.\r\nLua implements <em>proper tail calls</em>\r\n(or <em>proper tail recursion</em>):\r\nin a tail call,\r\nthe called function reuses the stack entry of the calling function.\r\nTherefore, there is no limit on the number of nested tail calls that\r\na program can execute.\r\nHowever, a tail call erases any debug information about the\r\ncalling function.\r\nNote that a tail call only happens with a particular syntax,\r\nwhere the <b>return</b> has one single function call as argument;\r\nthis syntax makes the calling function return exactly\r\nthe returns of the called function.\r\nSo, none of the following examples are tail calls:\r\n\r\n<pre>\r\n     return (f(x))        -- results adjusted to 1\r\n     return 2 * f(x)\r\n     return x, f(x)       -- additional results\r\n     f(x); return         -- results discarded\r\n     return x or f(x)     -- results adjusted to 1\r\n</pre>\r\n\r\n\r\n\r\n\r\n<h3>2.5.9 - <a name=\"2.5.9\">Function Definitions</a></h3>\r\n\r\n<p>\r\nThe syntax for function definition is\r\n\r\n<pre>\r\n\tfunction ::= <b>function</b> funcbody\r\n\tfuncbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>\r\n</pre>\r\n\r\n<p>\r\nThe following syntactic sugar simplifies function definitions:\r\n\r\n<pre>\r\n\tstat ::= <b>function</b> funcname funcbody\r\n\tstat ::= <b>local</b> <b>function</b> Name funcbody\r\n\tfuncname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]\r\n</pre><p>\r\nThe statement\r\n\r\n<pre>\r\n     function f () <em>body</em> end\r\n</pre><p>\r\ntranslates to\r\n\r\n<pre>\r\n     f = function () <em>body</em> end\r\n</pre><p>\r\nThe statement\r\n\r\n<pre>\r\n     function t.a.b.c.f () <em>body</em> end\r\n</pre><p>\r\ntranslates to\r\n\r\n<pre>\r\n     t.a.b.c.f = function () <em>body</em> end\r\n</pre><p>\r\nThe statement\r\n\r\n<pre>\r\n     local function f () <em>body</em> end\r\n</pre><p>\r\ntranslates to\r\n\r\n<pre>\r\n     local f; f = function () <em>body</em> end\r\n</pre><p>\r\n<em>not</em> to\r\n\r\n<pre>\r\n     local f = function () <em>body</em> end\r\n</pre><p>\r\n(This only makes a difference when the body of the function\r\ncontains references to <code>f</code>.)\r\n\r\n\r\n<p>\r\nA function definition is an executable expression,\r\nwhose value has type <em>function</em>.\r\nWhen Lua pre-compiles a chunk,\r\nall its function bodies are pre-compiled too.\r\nThen, whenever Lua executes the function definition,\r\nthe function is <em>instantiated</em> (or <em>closed</em>).\r\nThis function instance (or <em>closure</em>)\r\nis the final value of the expression.\r\nDifferent instances of the same function\r\ncan refer to different  external local variables\r\nand can have different environment tables.\r\n\r\n\r\n<p>\r\nParameters act as local variables that are\r\ninitialized with the argument values:\r\n\r\n<pre>\r\n\tparlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;\r\n</pre><p>\r\nWhen a function is called,\r\nthe list of arguments is adjusted to\r\nthe length of the list of parameters,\r\nunless the function is a variadic or <em>vararg function</em>,\r\nwhich is\r\nindicated by three dots ('<code>...</code>') at the end of its parameter list.\r\nA vararg function does not adjust its argument list;\r\ninstead, it collects all extra arguments and supplies them\r\nto the function through a <em>vararg expression</em>,\r\nwhich is also written as three dots.\r\nThe value of this expression is a list of all actual extra arguments,\r\nsimilar to a function with multiple results.\r\nIf a vararg expression is used inside another expression\r\nor in the middle of a list of expressions,\r\nthen its return list is adjusted to one element.\r\nIf the expression is used as the last element of a list of expressions,\r\nthen no adjustment is made\r\n(unless that last expression is enclosed in parentheses).\r\n\r\n\r\n<p>\r\nAs an example, consider the following definitions:\r\n\r\n<pre>\r\n     function f(a, b) end\r\n     function g(a, b, ...) end\r\n     function r() return 1,2,3 end\r\n</pre><p>\r\nThen, we have the following mapping from arguments to parameters and\r\nto the vararg expression:\r\n\r\n<pre>\r\n     CALL            PARAMETERS\r\n     \r\n     f(3)             a=3, b=nil\r\n     f(3, 4)          a=3, b=4\r\n     f(3, 4, 5)       a=3, b=4\r\n     f(r(), 10)       a=1, b=10\r\n     f(r())           a=1, b=2\r\n     \r\n     g(3)             a=3, b=nil, ... --&gt;  (nothing)\r\n     g(3, 4)          a=3, b=4,   ... --&gt;  (nothing)\r\n     g(3, 4, 5, 8)    a=3, b=4,   ... --&gt;  5  8\r\n     g(5, r())        a=5, b=1,   ... --&gt;  2  3\r\n</pre>\r\n\r\n<p>\r\nResults are returned using the <b>return</b> statement (see <a href=\"#2.4.4\">&sect;2.4.4</a>).\r\nIf control reaches the end of a function\r\nwithout encountering a <b>return</b> statement,\r\nthen the function returns with no results.\r\n\r\n\r\n<p>\r\nThe <em>colon</em> syntax\r\nis used for defining <em>methods</em>,\r\nthat is, functions that have an implicit extra parameter <code>self</code>.\r\nThus, the statement\r\n\r\n<pre>\r\n     function t.a.b.c:f (<em>params</em>) <em>body</em> end\r\n</pre><p>\r\nis syntactic sugar for\r\n\r\n<pre>\r\n     t.a.b.c.f = function (self, <em>params</em>) <em>body</em> end\r\n</pre>\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.6 - <a name=\"2.6\">Visibility Rules</a></h2>\r\n\r\n<p>\r\n\r\nLua is a lexically scoped language.\r\nThe scope of variables begins at the first statement <em>after</em>\r\ntheir declaration and lasts until the end of the innermost block that\r\nincludes the declaration.\r\nConsider the following example:\r\n\r\n<pre>\r\n     x = 10                -- global variable\r\n     do                    -- new block\r\n       local x = x         -- new 'x', with value 10\r\n       print(x)            --&gt; 10\r\n       x = x+1\r\n       do                  -- another block\r\n         local x = x+1     -- another 'x'\r\n         print(x)          --&gt; 12\r\n       end\r\n       print(x)            --&gt; 11\r\n     end\r\n     print(x)              --&gt; 10  (the global one)\r\n</pre>\r\n\r\n<p>\r\nNotice that, in a declaration like <code>local x = x</code>,\r\nthe new <code>x</code> being declared is not in scope yet,\r\nand so the second <code>x</code> refers to the outside variable.\r\n\r\n\r\n<p>\r\nBecause of the lexical scoping rules,\r\nlocal variables can be freely accessed by functions\r\ndefined inside their scope.\r\nA local variable used by an inner function is called\r\nan <em>upvalue</em>, or <em>external local variable</em>,\r\ninside the inner function.\r\n\r\n\r\n<p>\r\nNotice that each execution of a <b>local</b> statement\r\ndefines new local variables.\r\nConsider the following example:\r\n\r\n<pre>\r\n     a = {}\r\n     local x = 20\r\n     for i=1,10 do\r\n       local y = 0\r\n       a[i] = function () y=y+1; return x+y end\r\n     end\r\n</pre><p>\r\nThe loop creates ten closures\r\n(that is, ten instances of the anonymous function).\r\nEach of these closures uses a different <code>y</code> variable,\r\nwhile all of them share the same <code>x</code>.\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.7 - <a name=\"2.7\">Error Handling</a></h2>\r\n\r\n<p>\r\nBecause Lua is an embedded extension language,\r\nall Lua actions start from C&nbsp;code in the host program\r\ncalling a function from the Lua library (see <a href=\"#lua_pcall\"><code>lua_pcall</code></a>).\r\nWhenever an error occurs during Lua compilation or execution,\r\ncontrol returns to C,\r\nwhich can take appropriate measures\r\n(such as printing an error message).\r\n\r\n\r\n<p>\r\nLua code can explicitly generate an error by calling the\r\n<a href=\"#pdf-error\"><code>error</code></a> function.\r\nIf you need to catch errors in Lua,\r\nyou can use the <a href=\"#pdf-pcall\"><code>pcall</code></a> function.\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.8 - <a name=\"2.8\">Metatables</a></h2>\r\n\r\n<p>\r\nEvery value in Lua can have a <em>metatable</em>.\r\nThis <em>metatable</em> is an ordinary Lua table\r\nthat defines the behavior of the original value\r\nunder certain special operations.\r\nYou can change several aspects of the behavior\r\nof operations over a value by setting specific fields in its metatable.\r\nFor instance, when a non-numeric value is the operand of an addition,\r\nLua checks for a function in the field <code>\"__add\"</code> in its metatable.\r\nIf it finds one,\r\nLua calls this function to perform the addition.\r\n\r\n\r\n<p>\r\nWe call the keys in a metatable <em>events</em>\r\nand the values <em>metamethods</em>.\r\nIn the previous example, the event is <code>\"add\"</code> \r\nand the metamethod is the function that performs the addition.\r\n\r\n\r\n<p>\r\nYou can query the metatable of any value\r\nthrough the <a href=\"#pdf-getmetatable\"><code>getmetatable</code></a> function.\r\n\r\n\r\n<p>\r\nYou can replace the metatable of tables\r\nthrough the <a href=\"#pdf-setmetatable\"><code>setmetatable</code></a>\r\nfunction.\r\nYou cannot change the metatable of other types from Lua\r\n(except by using the debug library);\r\nyou must use the C&nbsp;API for that.\r\n\r\n\r\n<p>\r\nTables and full userdata have individual metatables\r\n(although multiple tables and userdata can share their metatables).\r\nValues of all other types share one single metatable per type;\r\nthat is, there is one single metatable for all numbers,\r\none for all strings, etc.\r\n\r\n\r\n<p>\r\nA metatable controls how an object behaves in arithmetic operations,\r\norder comparisons, concatenation, length operation, and indexing.\r\nA metatable also can define a function to be called when a userdata\r\nis garbage collected.\r\nFor each of these operations Lua associates a specific key\r\ncalled an <em>event</em>.\r\nWhen Lua performs one of these operations over a value,\r\nit checks whether this value has a metatable with the corresponding event.\r\nIf so, the value associated with that key (the metamethod)\r\ncontrols how Lua will perform the operation.\r\n\r\n\r\n<p>\r\nMetatables control the operations listed next.\r\nEach operation is identified by its corresponding name.\r\nThe key for each operation is a string with its name prefixed by\r\ntwo underscores, '<code>__</code>';\r\nfor instance, the key for operation \"add\" is the\r\nstring <code>\"__add\"</code>.\r\nThe semantics of these operations is better explained by a Lua function\r\ndescribing how the interpreter executes the operation.\r\n\r\n\r\n<p>\r\nThe code shown here in Lua is only illustrative;\r\nthe real behavior is hard coded in the interpreter\r\nand it is much more efficient than this simulation.\r\nAll functions used in these descriptions\r\n(<a href=\"#pdf-rawget\"><code>rawget</code></a>, <a href=\"#pdf-tonumber\"><code>tonumber</code></a>, etc.)\r\nare described in <a href=\"#5.1\">&sect;5.1</a>.\r\nIn particular, to retrieve the metamethod of a given object,\r\nwe use the expression\r\n\r\n<pre>\r\n     metatable(obj)[event]\r\n</pre><p>\r\nThis should be read as\r\n\r\n<pre>\r\n     rawget(getmetatable(obj) or {}, event)\r\n</pre><p>\r\n\r\nThat is, the access to a metamethod does not invoke other metamethods,\r\nand the access to objects with no metatables does not fail\r\n(it simply results in <b>nil</b>).\r\n\r\n\r\n\r\n<ul>\r\n\r\n<li><b>\"add\":</b>\r\nthe <code>+</code> operation.\r\n\r\n\r\n\r\n<p>\r\nThe function <code>getbinhandler</code> below defines how Lua chooses a handler\r\nfor a binary operation.\r\nFirst, Lua tries the first operand.\r\nIf its type does not define a handler for the operation,\r\nthen Lua tries the second operand.\r\n\r\n<pre>\r\n     function getbinhandler (op1, op2, event)\r\n       return metatable(op1)[event] or metatable(op2)[event]\r\n     end\r\n</pre><p>\r\nBy using this function,\r\nthe behavior of the <code>op1 + op2</code> is\r\n\r\n<pre>\r\n     function add_event (op1, op2)\r\n       local o1, o2 = tonumber(op1), tonumber(op2)\r\n       if o1 and o2 then  -- both operands are numeric?\r\n         return o1 + o2   -- '+' here is the primitive 'add'\r\n       else  -- at least one of the operands is not numeric\r\n         local h = getbinhandler(op1, op2, \"__add\")\r\n         if h then\r\n           -- call the handler with both operands\r\n           return (h(op1, op2))\r\n         else  -- no handler available: default behavior\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n<li><b>\"sub\":</b>\r\nthe <code>-</code> operation.\r\n\r\nBehavior similar to the \"add\" operation.\r\n</li>\r\n\r\n<li><b>\"mul\":</b>\r\nthe <code>*</code> operation.\r\n\r\nBehavior similar to the \"add\" operation.\r\n</li>\r\n\r\n<li><b>\"div\":</b>\r\nthe <code>/</code> operation.\r\n\r\nBehavior similar to the \"add\" operation.\r\n</li>\r\n\r\n<li><b>\"mod\":</b>\r\nthe <code>%</code> operation.\r\n\r\nBehavior similar to the \"add\" operation,\r\nwith the operation\r\n<code>o1 - floor(o1/o2)*o2</code> as the primitive operation.\r\n</li>\r\n\r\n<li><b>\"pow\":</b>\r\nthe <code>^</code> (exponentiation) operation.\r\n\r\nBehavior similar to the \"add\" operation,\r\nwith the function <code>pow</code> (from the C&nbsp;math library)\r\nas the primitive operation.\r\n</li>\r\n\r\n<li><b>\"unm\":</b>\r\nthe unary <code>-</code> operation.\r\n\r\n\r\n<pre>\r\n     function unm_event (op)\r\n       local o = tonumber(op)\r\n       if o then  -- operand is numeric?\r\n         return -o  -- '-' here is the primitive 'unm'\r\n       else  -- the operand is not numeric.\r\n         -- Try to get a handler from the operand\r\n         local h = metatable(op).__unm\r\n         if h then\r\n           -- call the handler with the operand\r\n           return (h(op))\r\n         else  -- no handler available: default behavior\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n<li><b>\"concat\":</b>\r\nthe <code>..</code> (concatenation) operation.\r\n\r\n\r\n<pre>\r\n     function concat_event (op1, op2)\r\n       if (type(op1) == \"string\" or type(op1) == \"number\") and\r\n          (type(op2) == \"string\" or type(op2) == \"number\") then\r\n         return op1 .. op2  -- primitive string concatenation\r\n       else\r\n         local h = getbinhandler(op1, op2, \"__concat\")\r\n         if h then\r\n           return (h(op1, op2))\r\n         else\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n<li><b>\"len\":</b>\r\nthe <code>#</code> operation.\r\n\r\n\r\n<pre>\r\n     function len_event (op)\r\n       if type(op) == \"string\" then\r\n         return strlen(op)         -- primitive string length\r\n       elseif type(op) == \"table\" then\r\n         return #op                -- primitive table length\r\n       else\r\n         local h = metatable(op).__len\r\n         if h then\r\n           -- call the handler with the operand\r\n           return (h(op))\r\n         else  -- no handler available: default behavior\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\nSee <a href=\"#2.5.5\">&sect;2.5.5</a> for a description of the length of a table.\r\n</li>\r\n\r\n<li><b>\"eq\":</b>\r\nthe <code>==</code> operation.\r\n\r\nThe function <code>getcomphandler</code> defines how Lua chooses a metamethod\r\nfor comparison operators.\r\nA metamethod only is selected when both objects\r\nbeing compared have the same type\r\nand the same metamethod for the selected operation.\r\n\r\n<pre>\r\n     function getcomphandler (op1, op2, event)\r\n       if type(op1) ~= type(op2) then return nil end\r\n       local mm1 = metatable(op1)[event]\r\n       local mm2 = metatable(op2)[event]\r\n       if mm1 == mm2 then return mm1 else return nil end\r\n     end\r\n</pre><p>\r\nThe \"eq\" event is defined as follows:\r\n\r\n<pre>\r\n     function eq_event (op1, op2)\r\n       if type(op1) ~= type(op2) then  -- different types?\r\n         return false   -- different objects\r\n       end\r\n       if op1 == op2 then   -- primitive equal?\r\n         return true   -- objects are equal\r\n       end\r\n       -- try metamethod\r\n       local h = getcomphandler(op1, op2, \"__eq\")\r\n       if h then\r\n         return (h(op1, op2))\r\n       else\r\n         return false\r\n       end\r\n     end\r\n</pre><p>\r\n<code>a ~= b</code> is equivalent to <code>not (a == b)</code>.\r\n</li>\r\n\r\n<li><b>\"lt\":</b>\r\nthe <code>&lt;</code> operation.\r\n\r\n\r\n<pre>\r\n     function lt_event (op1, op2)\r\n       if type(op1) == \"number\" and type(op2) == \"number\" then\r\n         return op1 &lt; op2   -- numeric comparison\r\n       elseif type(op1) == \"string\" and type(op2) == \"string\" then\r\n         return op1 &lt; op2   -- lexicographic comparison\r\n       else\r\n         local h = getcomphandler(op1, op2, \"__lt\")\r\n         if h then\r\n           return (h(op1, op2))\r\n         else\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n<code>a &gt; b</code> is equivalent to <code>b &lt; a</code>.\r\n</li>\r\n\r\n<li><b>\"le\":</b>\r\nthe <code>&lt;=</code> operation.\r\n\r\n\r\n<pre>\r\n     function le_event (op1, op2)\r\n       if type(op1) == \"number\" and type(op2) == \"number\" then\r\n         return op1 &lt;= op2   -- numeric comparison\r\n       elseif type(op1) == \"string\" and type(op2) == \"string\" then\r\n         return op1 &lt;= op2   -- lexicographic comparison\r\n       else\r\n         local h = getcomphandler(op1, op2, \"__le\")\r\n         if h then\r\n           return (h(op1, op2))\r\n         else\r\n           h = getcomphandler(op1, op2, \"__lt\")\r\n           if h then\r\n             return not h(op2, op1)\r\n           else\r\n             error(&middot;&middot;&middot;)\r\n           end\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n<code>a &gt;= b</code> is equivalent to <code>b &lt;= a</code>.\r\nNote that, in the absence of a \"le\" metamethod,\r\nLua tries the \"lt\", assuming that <code>a &lt;= b</code> is\r\nequivalent to <code>not (b &lt; a)</code>.\r\n</li>\r\n\r\n<li><b>\"index\":</b>\r\nThe indexing access <code>table[key]</code>.\r\n\r\n\r\n<pre>\r\n     function gettable_event (table, key)\r\n       local h\r\n       if type(table) == \"table\" then\r\n         local v = rawget(table, key)\r\n         if v ~= nil then return v end\r\n         h = metatable(table).__index\r\n         if h == nil then return nil end\r\n       else\r\n         h = metatable(table).__index\r\n         if h == nil then\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n       if type(h) == \"function\" then\r\n         return (h(table, key))     -- call the handler\r\n       else return h[key]           -- or repeat operation on it\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n<li><b>\"newindex\":</b>\r\nThe indexing assignment <code>table[key] = value</code>.\r\n\r\n\r\n<pre>\r\n     function settable_event (table, key, value)\r\n       local h\r\n       if type(table) == \"table\" then\r\n         local v = rawget(table, key)\r\n         if v ~= nil then rawset(table, key, value); return end\r\n         h = metatable(table).__newindex\r\n         if h == nil then rawset(table, key, value); return end\r\n       else\r\n         h = metatable(table).__newindex\r\n         if h == nil then\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n       if type(h) == \"function\" then\r\n         h(table, key,value)           -- call the handler\r\n       else h[key] = value             -- or repeat operation on it\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n<li><b>\"call\":</b>\r\ncalled when Lua calls a value.\r\n\r\n\r\n<pre>\r\n     function function_event (func, ...)\r\n       if type(func) == \"function\" then\r\n         return func(...)   -- primitive call\r\n       else\r\n         local h = metatable(func).__call\r\n         if h then\r\n           return h(func, ...)\r\n         else\r\n           error(&middot;&middot;&middot;)\r\n         end\r\n       end\r\n     end\r\n</pre><p>\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h2>2.9 - <a name=\"2.9\">Environments</a></h2>\r\n\r\n<p>\r\nBesides metatables,\r\nobjects of types thread, function, and userdata\r\nhave another table associated with them,\r\ncalled their <em>environment</em>.\r\nLike metatables, environments are regular tables and\r\nmultiple objects can share the same environment.\r\n\r\n\r\n<p>\r\nThreads are created sharing the environment of the creating thread.\r\nUserdata and C&nbsp;functions are created sharing the environment\r\nof the creating C&nbsp;function.\r\nNon-nested Lua functions\r\n(created by <a href=\"#pdf-loadfile\"><code>loadfile</code></a>, <a href=\"#pdf-loadstring\"><code>loadstring</code></a> or <a href=\"#pdf-load\"><code>load</code></a>)\r\nare created sharing the environment of the creating thread.\r\nNested Lua functions are created sharing the environment of\r\nthe creating Lua function.\r\n\r\n\r\n<p>\r\nEnvironments associated with userdata have no meaning for Lua.\r\nIt is only a convenience feature for programmers to associate a table to\r\na userdata.\r\n\r\n\r\n<p>\r\nEnvironments associated with threads are called\r\n<em>global environments</em>.\r\nThey are used as the default environment for threads and\r\nnon-nested Lua functions created by the thread\r\nand can be directly accessed by C&nbsp;code (see <a href=\"#3.3\">&sect;3.3</a>).\r\n\r\n\r\n<p>\r\nThe environment associated with a C&nbsp;function can be directly\r\naccessed by C&nbsp;code (see <a href=\"#3.3\">&sect;3.3</a>).\r\nIt is used as the default environment for other C&nbsp;functions\r\nand userdata created by the function.\r\n\r\n\r\n<p>\r\nEnvironments associated with Lua functions are used to resolve\r\nall accesses to global variables within the function (see <a href=\"#2.3\">&sect;2.3</a>).\r\nThey are used as the default environment for nested Lua functions\r\ncreated by the function.\r\n\r\n\r\n<p>\r\nYou can change the environment of a Lua function or the\r\nrunning thread by calling <a href=\"#pdf-setfenv\"><code>setfenv</code></a>.\r\nYou can get the environment of a Lua function or the running thread\r\nby calling <a href=\"#pdf-getfenv\"><code>getfenv</code></a>.\r\nTo manipulate the environment of other objects\r\n(userdata, C&nbsp;functions, other threads) you must\r\nuse the C&nbsp;API.\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.10 - <a name=\"2.10\">Garbage Collection</a></h2>\r\n\r\n<p>\r\nLua performs automatic memory management.\r\nThis means that\r\nyou have to worry neither about allocating memory for new objects\r\nnor about freeing it when the objects are no longer needed.\r\nLua manages memory automatically by running\r\na <em>garbage collector</em> from time to time\r\nto collect all <em>dead objects</em>\r\n(that is, objects that are no longer accessible from Lua).\r\nAll memory used by Lua is subject to automatic management:\r\ntables, userdata, functions, threads, strings, etc.\r\n\r\n\r\n<p>\r\nLua implements an incremental mark-and-sweep collector.\r\nIt uses two numbers to control its garbage-collection cycles:\r\nthe <em>garbage-collector pause</em> and\r\nthe <em>garbage-collector step multiplier</em>.\r\nBoth use percentage points as units\r\n(so that a value of 100 means an internal value of 1).\r\n\r\n\r\n<p>\r\nThe garbage-collector pause\r\ncontrols how long the collector waits before starting a new cycle.\r\nLarger values make the collector less aggressive.\r\nValues smaller than 100 mean the collector will not wait to\r\nstart a new cycle.\r\nA value of 200 means that the collector waits for the total memory in use\r\nto double before starting a new cycle.\r\n\r\n\r\n<p>\r\nThe step multiplier\r\ncontrols the relative speed of the collector relative to\r\nmemory allocation.\r\nLarger values make the collector more aggressive but also increase\r\nthe size of each incremental step.\r\nValues smaller than 100 make the collector too slow and\r\ncan result in the collector never finishing a cycle.\r\nThe default, 200, means that the collector runs at \"twice\"\r\nthe speed of memory allocation.\r\n\r\n\r\n<p>\r\nYou can change these numbers by calling <a href=\"#lua_gc\"><code>lua_gc</code></a> in C\r\nor <a href=\"#pdf-collectgarbage\"><code>collectgarbage</code></a> in Lua.\r\nWith these functions you can also control \r\nthe collector directly (e.g., stop and restart it).\r\n\r\n\r\n\r\n<h3>2.10.1 - <a name=\"2.10.1\">Garbage-Collection Metamethods</a></h3>\r\n\r\n<p>\r\nUsing the C&nbsp;API,\r\nyou can set garbage-collector metamethods for userdata (see <a href=\"#2.8\">&sect;2.8</a>).\r\nThese metamethods are also called <em>finalizers</em>.\r\nFinalizers allow you to coordinate Lua's garbage collection\r\nwith external resource management\r\n(such as closing files, network or database connections,\r\nor freeing your own memory).\r\n\r\n\r\n<p>\r\nGarbage userdata with a field <code>__gc</code> in their metatables are not\r\ncollected immediately by the garbage collector.\r\nInstead, Lua puts them in a list.\r\nAfter the collection,\r\nLua does the equivalent of the following function\r\nfor each userdata in that list:\r\n\r\n<pre>\r\n     function gc_event (udata)\r\n       local h = metatable(udata).__gc\r\n       if h then\r\n         h(udata)\r\n       end\r\n     end\r\n</pre>\r\n\r\n<p>\r\nAt the end of each garbage-collection cycle,\r\nthe finalizers for userdata are called in <em>reverse</em>\r\norder of their creation,\r\namong those collected in that cycle.\r\nThat is, the first finalizer to be called is the one associated\r\nwith the userdata created last in the program.\r\nThe userdata itself is freed only in the next garbage-collection cycle.\r\n\r\n\r\n\r\n\r\n\r\n<h3>2.10.2 - <a name=\"2.10.2\">Weak Tables</a></h3>\r\n\r\n<p>\r\nA <em>weak table</em> is a table whose elements are\r\n<em>weak references</em>.\r\nA weak reference is ignored by the garbage collector.\r\nIn other words,\r\nif the only references to an object are weak references,\r\nthen the garbage collector will collect this object.\r\n\r\n\r\n<p>\r\nA weak table can have weak keys, weak values, or both.\r\nA table with weak keys allows the collection of its keys,\r\nbut prevents the collection of its values.\r\nA table with both weak keys and weak values allows the collection of\r\nboth keys and values.\r\nIn any case, if either the key or the value is collected,\r\nthe whole pair is removed from the table.\r\nThe weakness of a table is controlled by the\r\n<code>__mode</code> field of its metatable.\r\nIf the <code>__mode</code> field is a string containing the character&nbsp;'<code>k</code>',\r\nthe keys in the table are weak.\r\nIf <code>__mode</code> contains '<code>v</code>',\r\nthe values in the table are weak.\r\n\r\n\r\n<p>\r\nAfter you use a table as a metatable,\r\nyou should not change the value of its <code>__mode</code> field.\r\nOtherwise, the weak behavior of the tables controlled by this\r\nmetatable is undefined.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>2.11 - <a name=\"2.11\">Coroutines</a></h2>\r\n\r\n<p>\r\nLua supports coroutines,\r\nalso called <em>collaborative multithreading</em>.\r\nA coroutine in Lua represents an independent thread of execution.\r\nUnlike threads in multithread systems, however,\r\na coroutine only suspends its execution by explicitly calling\r\na yield function.\r\n\r\n\r\n<p>\r\nYou create a coroutine with a call to <a href=\"#pdf-coroutine.create\"><code>coroutine.create</code></a>.\r\nIts sole argument is a function\r\nthat is the main function of the coroutine.\r\nThe <code>create</code> function only creates a new coroutine and\r\nreturns a handle to it (an object of type <em>thread</em>);\r\nit does not start the coroutine execution.\r\n\r\n\r\n<p>\r\nWhen you first call <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a>,\r\npassing as its first argument\r\na thread returned by <a href=\"#pdf-coroutine.create\"><code>coroutine.create</code></a>,\r\nthe coroutine starts its execution,\r\nat the first line of its main function.\r\nExtra arguments passed to <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a> are passed on\r\nto the coroutine main function.\r\nAfter the coroutine starts running,\r\nit runs until it terminates or <em>yields</em>.\r\n\r\n\r\n<p>\r\nA coroutine can terminate its execution in two ways:\r\nnormally, when its main function returns\r\n(explicitly or implicitly, after the last instruction);\r\nand abnormally, if there is an unprotected error.\r\nIn the first case, <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a> returns <b>true</b>,\r\nplus any values returned by the coroutine main function.\r\nIn case of errors, <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a> returns <b>false</b>\r\nplus an error message.\r\n\r\n\r\n<p>\r\nA coroutine yields by calling <a href=\"#pdf-coroutine.yield\"><code>coroutine.yield</code></a>.\r\nWhen a coroutine yields,\r\nthe corresponding <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a> returns immediately,\r\neven if the yield happens inside nested function calls\r\n(that is, not in the main function,\r\nbut in a function directly or indirectly called by the main function).\r\nIn the case of a yield, <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a> also returns <b>true</b>,\r\nplus any values passed to <a href=\"#pdf-coroutine.yield\"><code>coroutine.yield</code></a>.\r\nThe next time you resume the same coroutine,\r\nit continues its execution from the point where it yielded,\r\nwith the call to <a href=\"#pdf-coroutine.yield\"><code>coroutine.yield</code></a> returning any extra\r\narguments passed to <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a>.\r\n\r\n\r\n<p>\r\nLike <a href=\"#pdf-coroutine.create\"><code>coroutine.create</code></a>,\r\nthe <a href=\"#pdf-coroutine.wrap\"><code>coroutine.wrap</code></a> function also creates a coroutine,\r\nbut instead of returning the coroutine itself,\r\nit returns a function that, when called, resumes the coroutine.\r\nAny arguments passed to this function\r\ngo as extra arguments to <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a>.\r\n<a href=\"#pdf-coroutine.wrap\"><code>coroutine.wrap</code></a> returns all the values returned by <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a>,\r\nexcept the first one (the boolean error code).\r\nUnlike <a href=\"#pdf-coroutine.resume\"><code>coroutine.resume</code></a>,\r\n<a href=\"#pdf-coroutine.wrap\"><code>coroutine.wrap</code></a> does not catch errors;\r\nany error is propagated to the caller.\r\n\r\n\r\n<p>\r\nAs an example,\r\nconsider the following code:\r\n\r\n<pre>\r\n     function foo (a)\r\n       print(\"foo\", a)\r\n       return coroutine.yield(2*a)\r\n     end\r\n     \r\n     co = coroutine.create(function (a,b)\r\n           print(\"co-body\", a, b)\r\n           local r = foo(a+1)\r\n           print(\"co-body\", r)\r\n           local r, s = coroutine.yield(a+b, a-b)\r\n           print(\"co-body\", r, s)\r\n           return b, \"end\"\r\n     end)\r\n            \r\n     print(\"main\", coroutine.resume(co, 1, 10))\r\n     print(\"main\", coroutine.resume(co, \"r\"))\r\n     print(\"main\", coroutine.resume(co, \"x\", \"y\"))\r\n     print(\"main\", coroutine.resume(co, \"x\", \"y\"))\r\n</pre><p>\r\nWhen you run it, it produces the following output:\r\n\r\n<pre>\r\n     co-body 1       10\r\n     foo     2\r\n     \r\n     main    true    4\r\n     co-body r\r\n     main    true    11      -9\r\n     co-body x       y\r\n     main    true    10      end\r\n     main    false   cannot resume dead coroutine\r\n</pre>\r\n\r\n\r\n\r\n\r\n<h1>3 - <a name=\"3\">The Application Program Interface</a></h1>\r\n\r\n<p>\r\n\r\nThis section describes the C&nbsp;API for Lua, that is,\r\nthe set of C&nbsp;functions available to the host program to communicate\r\nwith Lua.\r\nAll API functions and related types and constants\r\nare declared in the header file <a name=\"pdf-lua.h\"><code>lua.h</code></a>.\r\n\r\n\r\n<p>\r\nEven when we use the term \"function\",\r\nany facility in the API may be provided as a macro instead.\r\nAll such macros use each of their arguments exactly once\r\n(except for the first argument, which is always a Lua state),\r\nand so do not generate any hidden side-effects.\r\n\r\n\r\n<p>\r\nAs in most C&nbsp;libraries,\r\nthe Lua API functions do not check their arguments for validity or consistency.\r\nHowever, you can change this behavior by compiling Lua\r\nwith a proper definition for the macro <a name=\"pdf-luai_apicheck\"><code>luai_apicheck</code></a>,\r\nin file <code>luaconf.h</code>.\r\n\r\n\r\n\r\n<h2>3.1 - <a name=\"3.1\">The Stack</a></h2>\r\n\r\n<p>\r\nLua uses a <em>virtual stack</em> to pass values to and from C.\r\nEach element in this stack represents a Lua value\r\n(<b>nil</b>, number, string, etc.).\r\n\r\n\r\n<p>\r\nWhenever Lua calls C, the called function gets a new stack,\r\nwhich is independent of previous stacks and of stacks of\r\nC&nbsp;functions that are still active.\r\nThis stack initially contains any arguments to the C&nbsp;function\r\nand it is where the C&nbsp;function pushes its results\r\nto be returned to the caller (see <a href=\"#lua_CFunction\"><code>lua_CFunction</code></a>).\r\n\r\n\r\n<p>\r\nFor convenience,\r\nmost query operations in the API do not follow a strict stack discipline.\r\nInstead, they can refer to any element in the stack\r\nby using an <em>index</em>:\r\nA positive index represents an <em>absolute</em> stack position\r\n(starting at&nbsp;1);\r\na negative index represents an <em>offset</em> relative to the top of the stack.\r\nMore specifically, if the stack has <em>n</em> elements,\r\nthen index&nbsp;1 represents the first element\r\n(that is, the element that was pushed onto the stack first)\r\nand\r\nindex&nbsp;<em>n</em> represents the last element;\r\nindex&nbsp;-1 also represents the last element\r\n(that is, the element at the&nbsp;top)\r\nand index <em>-n</em> represents the first element.\r\nWe say that an index is <em>valid</em>\r\nif it lies between&nbsp;1 and the stack top\r\n(that is, if <code>1 &le; abs(index) &le; top</code>).\r\n \r\n\r\n\r\n\r\n\r\n\r\n<h2>3.2 - <a name=\"3.2\">Stack Size</a></h2>\r\n\r\n<p>\r\nWhen you interact with Lua API,\r\nyou are responsible for ensuring consistency.\r\nIn particular,\r\n<em>you are responsible for controlling stack overflow</em>.\r\nYou can use the function <a href=\"#lua_checkstack\"><code>lua_checkstack</code></a>\r\nto grow the stack size.\r\n\r\n\r\n<p>\r\nWhenever Lua calls C,\r\nit ensures that at least <a name=\"pdf-LUA_MINSTACK\"><code>LUA_MINSTACK</code></a> stack positions are available.\r\n<code>LUA_MINSTACK</code> is defined as 20,\r\nso that usually you do not have to worry about stack space\r\nunless your code has loops pushing elements onto the stack.\r\n\r\n\r\n<p>\r\nMost query functions accept as indices any value inside the\r\navailable stack space, that is, indices up to the maximum stack size\r\nyou have set through <a href=\"#lua_checkstack\"><code>lua_checkstack</code></a>.\r\nSuch indices are called <em>acceptable indices</em>.\r\nMore formally, we define an <em>acceptable index</em>\r\nas follows:\r\n\r\n<pre>\r\n     (index &lt; 0 &amp;&amp; abs(index) &lt;= top) ||\r\n     (index &gt; 0 &amp;&amp; index &lt;= stackspace)\r\n</pre><p>\r\nNote that 0 is never an acceptable index.\r\n\r\n\r\n\r\n\r\n\r\n<h2>3.3 - <a name=\"3.3\">Pseudo-Indices</a></h2>\r\n\r\n<p>\r\nUnless otherwise noted,\r\nany function that accepts valid indices can also be called with\r\n<em>pseudo-indices</em>,\r\nwhich represent some Lua values that are accessible to C&nbsp;code\r\nbut which are not in the stack.\r\nPseudo-indices are used to access the thread environment,\r\nthe function environment,\r\nthe registry,\r\nand the upvalues of a C&nbsp;function (see <a href=\"#3.4\">&sect;3.4</a>).\r\n\r\n\r\n<p>\r\nThe thread environment (where global variables live) is\r\nalways at pseudo-index <a name=\"pdf-LUA_GLOBALSINDEX\"><code>LUA_GLOBALSINDEX</code></a>.\r\nThe environment of the running C&nbsp;function is always\r\nat pseudo-index <a name=\"pdf-LUA_ENVIRONINDEX\"><code>LUA_ENVIRONINDEX</code></a>.\r\n\r\n\r\n<p>\r\nTo access and change the value of global variables,\r\nyou can use regular table operations over an environment table.\r\nFor instance, to access the value of a global variable, do\r\n\r\n<pre>\r\n     lua_getfield(L, LUA_GLOBALSINDEX, varname);\r\n</pre>\r\n\r\n\r\n\r\n\r\n<h2>3.4 - <a name=\"3.4\">C Closures</a></h2>\r\n\r\n<p>\r\nWhen a C&nbsp;function is created,\r\nit is possible to associate some values with it,\r\nthus creating a <em>C&nbsp;closure</em>;\r\nthese values are called <em>upvalues</em> and are\r\naccessible to the function whenever it is called\r\n(see <a href=\"#lua_pushcclosure\"><code>lua_pushcclosure</code></a>).\r\n\r\n\r\n<p>\r\nWhenever a C&nbsp;function is called,\r\nits upvalues are located at specific pseudo-indices.\r\nThese pseudo-indices are produced by the macro\r\n<a name=\"lua_upvalueindex\"><code>lua_upvalueindex</code></a>.\r\nThe first value associated with a function is at position\r\n<code>lua_upvalueindex(1)</code>, and so on.\r\nAny access to <code>lua_upvalueindex(<em>n</em>)</code>,\r\nwhere <em>n</em> is greater than the number of upvalues of the\r\ncurrent function (but not greater than 256),\r\nproduces an acceptable (but invalid) index.\r\n\r\n\r\n\r\n\r\n\r\n<h2>3.5 - <a name=\"3.5\">Registry</a></h2>\r\n\r\n<p>\r\nLua provides a <em>registry</em>,\r\na pre-defined table that can be used by any C&nbsp;code to\r\nstore whatever Lua value it needs to store.\r\nThis table is always located at pseudo-index\r\n<a name=\"pdf-LUA_REGISTRYINDEX\"><code>LUA_REGISTRYINDEX</code></a>.\r\nAny C&nbsp;library can store data into this table,\r\nbut it should take care to choose keys different from those used\r\nby other libraries, to avoid collisions.\r\nTypically, you should use as key a string containing your library name\r\nor a light userdata with the address of a C&nbsp;object in your code.\r\n\r\n\r\n<p>\r\nThe integer keys in the registry are used by the reference mechanism,\r\nimplemented by the auxiliary library,\r\nand therefore should not be used for other purposes.\r\n\r\n\r\n\r\n\r\n\r\n<h2>3.6 - <a name=\"3.6\">Error Handling in C</a></h2>\r\n\r\n<p>\r\nInternally, Lua uses the C <code>longjmp</code> facility to handle errors.\r\n(You can also choose to use exceptions if you use C++;\r\nsee file <code>luaconf.h</code>.)\r\nWhen Lua faces any error\r\n(such as memory allocation errors, type errors, syntax errors,\r\nand runtime errors)\r\nit <em>raises</em> an error;\r\nthat is, it does a long jump.\r\nA <em>protected environment</em> uses <code>setjmp</code>\r\nto set a recover point;\r\nany error jumps to the most recent active recover point.\r\n\r\n\r\n<p>\r\nMost functions in the API can throw an error,\r\nfor instance due to a memory allocation error.\r\nThe documentation for each function indicates whether\r\nit can throw errors.\r\n\r\n\r\n<p>\r\nInside a C&nbsp;function you can throw an error by calling <a href=\"#lua_error\"><code>lua_error</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<h2>3.7 - <a name=\"3.7\">Functions and Types</a></h2>\r\n\r\n<p>\r\nHere we list all functions and types from the C&nbsp;API in\r\nalphabetical order.\r\nEach function has an indicator like this:\r\n<span class=\"apii\">[-o, +p, <em>x</em>]</span>\r\n\r\n\r\n<p>\r\nThe first field, <code>o</code>,\r\nis how many elements the function pops from the stack.\r\nThe second field, <code>p</code>,\r\nis how many elements the function pushes onto the stack.\r\n(Any function always pushes its results after popping its arguments.)\r\nA field in the form <code>x|y</code> means the function can push (or pop)\r\n<code>x</code> or <code>y</code> elements,\r\ndepending on the situation;\r\nan interrogation mark '<code>?</code>' means that\r\nwe cannot know how many elements the function pops/pushes\r\nby looking only at its arguments\r\n(e.g., they may depend on what is on the stack).\r\nThe third field, <code>x</code>,\r\ntells whether the function may throw errors:\r\n'<code>-</code>' means the function never throws any error;\r\n'<code>m</code>' means the function may throw an error\r\nonly due to not enough memory;\r\n'<code>e</code>' means the function may throw other kinds of errors;\r\n'<code>v</code>' means the function may throw an error on purpose.\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Alloc\"><code>lua_Alloc</code></a></h3>\r\n<pre>typedef void * (*lua_Alloc) (void *ud,\r\n                             void *ptr,\r\n                             size_t osize,\r\n                             size_t nsize);</pre>\r\n\r\n<p>\r\nThe type of the memory-allocation function used by Lua states.\r\nThe allocator function must provide a\r\nfunctionality similar to <code>realloc</code>,\r\nbut not exactly the same.\r\nIts arguments are\r\n<code>ud</code>, an opaque pointer passed to <a href=\"#lua_newstate\"><code>lua_newstate</code></a>;\r\n<code>ptr</code>, a pointer to the block being allocated/reallocated/freed;\r\n<code>osize</code>, the original size of the block;\r\n<code>nsize</code>, the new size of the block.\r\n<code>ptr</code> is <code>NULL</code> if and only if <code>osize</code> is zero.\r\nWhen <code>nsize</code> is zero, the allocator must return <code>NULL</code>;\r\nif <code>osize</code> is not zero,\r\nit should free the block pointed to by <code>ptr</code>.\r\nWhen <code>nsize</code> is not zero, the allocator returns <code>NULL</code>\r\nif and only if it cannot fill the request.\r\nWhen <code>nsize</code> is not zero and <code>osize</code> is zero,\r\nthe allocator should behave like <code>malloc</code>.\r\nWhen <code>nsize</code> and <code>osize</code> are not zero,\r\nthe allocator behaves like <code>realloc</code>.\r\nLua assumes that the allocator never fails when\r\n<code>osize &gt;= nsize</code>.\r\n\r\n\r\n<p>\r\nHere is a simple implementation for the allocator function.\r\nIt is used in the auxiliary library by <a href=\"#luaL_newstate\"><code>luaL_newstate</code></a>.\r\n\r\n<pre>\r\n     static void *l_alloc (void *ud, void *ptr, size_t osize,\r\n                                                size_t nsize) {\r\n       (void)ud;  (void)osize;  /* not used */\r\n       if (nsize == 0) {\r\n         free(ptr);\r\n         return NULL;\r\n       }\r\n       else\r\n         return realloc(ptr, nsize);\r\n     }\r\n</pre><p>\r\nThis code assumes\r\nthat <code>free(NULL)</code> has no effect and that\r\n<code>realloc(NULL, size)</code> is equivalent to <code>malloc(size)</code>.\r\nANSI&nbsp;C ensures both behaviors.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_atpanic\"><code>lua_atpanic</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf);</pre>\r\n\r\n<p>\r\nSets a new panic function and returns the old one.\r\n\r\n\r\n<p>\r\nIf an error happens outside any protected environment,\r\nLua calls a <em>panic function</em>\r\nand then calls <code>exit(EXIT_FAILURE)</code>,\r\nthus exiting the host application.\r\nYour panic function can avoid this exit by\r\nnever returning (e.g., doing a long jump).\r\n\r\n\r\n<p>\r\nThe panic function can access the error message at the top of the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_call\"><code>lua_call</code></a></h3><p>\r\n<span class=\"apii\">[-(nargs + 1), +nresults, <em>e</em>]</span>\r\n<pre>void lua_call (lua_State *L, int nargs, int nresults);</pre>\r\n\r\n<p>\r\nCalls a function.\r\n\r\n\r\n<p>\r\nTo call a function you must use the following protocol:\r\nfirst, the function to be called is pushed onto the stack;\r\nthen, the arguments to the function are pushed\r\nin direct order;\r\nthat is, the first argument is pushed first.\r\nFinally you call <a href=\"#lua_call\"><code>lua_call</code></a>;\r\n<code>nargs</code> is the number of arguments that you pushed onto the stack.\r\nAll arguments and the function value are popped from the stack\r\nwhen the function is called.\r\nThe function results are pushed onto the stack when the function returns.\r\nThe number of results is adjusted to <code>nresults</code>,\r\nunless <code>nresults</code> is <a name=\"pdf-LUA_MULTRET\"><code>LUA_MULTRET</code></a>.\r\nIn this case, <em>all</em> results from the function are pushed.\r\nLua takes care that the returned values fit into the stack space.\r\nThe function results are pushed onto the stack in direct order\r\n(the first result is pushed first),\r\nso that after the call the last result is on the top of the stack.\r\n\r\n\r\n<p>\r\nAny error inside the called function is propagated upwards\r\n(with a <code>longjmp</code>).\r\n\r\n\r\n<p>\r\nThe following example shows how the host program can do the\r\nequivalent to this Lua code:\r\n\r\n<pre>\r\n     a = f(\"how\", t.x, 14)\r\n</pre><p>\r\nHere it is in&nbsp;C:\r\n\r\n<pre>\r\n     lua_getfield(L, LUA_GLOBALSINDEX, \"f\"); /* function to be called */\r\n     lua_pushstring(L, \"how\");                        /* 1st argument */\r\n     lua_getfield(L, LUA_GLOBALSINDEX, \"t\");   /* table to be indexed */\r\n     lua_getfield(L, -1, \"x\");        /* push result of t.x (2nd arg) */\r\n     lua_remove(L, -2);                  /* remove 't' from the stack */\r\n     lua_pushinteger(L, 14);                          /* 3rd argument */\r\n     lua_call(L, 3, 1);     /* call 'f' with 3 arguments and 1 result */\r\n     lua_setfield(L, LUA_GLOBALSINDEX, \"a\");        /* set global 'a' */\r\n</pre><p>\r\nNote that the code above is \"balanced\":\r\nat its end, the stack is back to its original configuration.\r\nThis is considered good programming practice.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_CFunction\"><code>lua_CFunction</code></a></h3>\r\n<pre>typedef int (*lua_CFunction) (lua_State *L);</pre>\r\n\r\n<p>\r\nType for C&nbsp;functions.\r\n\r\n\r\n<p>\r\nIn order to communicate properly with Lua,\r\na C&nbsp;function must use the following protocol,\r\nwhich defines the way parameters and results are passed:\r\na C&nbsp;function receives its arguments from Lua in its stack\r\nin direct order (the first argument is pushed first).\r\nSo, when the function starts,\r\n<code>lua_gettop(L)</code> returns the number of arguments received by the function.\r\nThe first argument (if any) is at index 1\r\nand its last argument is at index <code>lua_gettop(L)</code>.\r\nTo return values to Lua, a C&nbsp;function just pushes them onto the stack,\r\nin direct order (the first result is pushed first),\r\nand returns the number of results.\r\nAny other value in the stack below the results will be properly\r\ndiscarded by Lua.\r\nLike a Lua function, a C&nbsp;function called by Lua can also return\r\nmany results.\r\n\r\n\r\n<p>\r\nAs an example, the following function receives a variable number\r\nof numerical arguments and returns their average and sum:\r\n\r\n<pre>\r\n     static int foo (lua_State *L) {\r\n       int n = lua_gettop(L);    /* number of arguments */\r\n       lua_Number sum = 0;\r\n       int i;\r\n       for (i = 1; i &lt;= n; i++) {\r\n         if (!lua_isnumber(L, i)) {\r\n           lua_pushstring(L, \"incorrect argument\");\r\n           lua_error(L);\r\n         }\r\n         sum += lua_tonumber(L, i);\r\n       }\r\n       lua_pushnumber(L, sum/n);        /* first result */\r\n       lua_pushnumber(L, sum);         /* second result */\r\n       return 2;                   /* number of results */\r\n     }\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_checkstack\"><code>lua_checkstack</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>int lua_checkstack (lua_State *L, int extra);</pre>\r\n\r\n<p>\r\nEnsures that there are at least <code>extra</code> free stack slots in the stack.\r\nIt returns false if it cannot grow the stack to that size.\r\nThis function never shrinks the stack;\r\nif the stack is already larger than the new size,\r\nit is left unchanged.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_close\"><code>lua_close</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>void lua_close (lua_State *L);</pre>\r\n\r\n<p>\r\nDestroys all objects in the given Lua state\r\n(calling the corresponding garbage-collection metamethods, if any)\r\nand frees all dynamic memory used by this state.\r\nOn several platforms, you may not need to call this function,\r\nbecause all resources are naturally released when the host program ends.\r\nOn the other hand, long-running programs,\r\nsuch as a daemon or a web server,\r\nmight need to release states as soon as they are not needed,\r\nto avoid growing too large.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_concat\"><code>lua_concat</code></a></h3><p>\r\n<span class=\"apii\">[-n, +1, <em>e</em>]</span>\r\n<pre>void lua_concat (lua_State *L, int n);</pre>\r\n\r\n<p>\r\nConcatenates the <code>n</code> values at the top of the stack,\r\npops them, and leaves the result at the top.\r\nIf <code>n</code>&nbsp;is&nbsp;1, the result is the single value on the stack\r\n(that is, the function does nothing);\r\nif <code>n</code> is 0, the result is the empty string.\r\nConcatenation is performed following the usual semantics of Lua\r\n(see <a href=\"#2.5.4\">&sect;2.5.4</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_cpcall\"><code>lua_cpcall</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>-</em>]</span>\r\n<pre>int lua_cpcall (lua_State *L, lua_CFunction func, void *ud);</pre>\r\n\r\n<p>\r\nCalls the C&nbsp;function <code>func</code> in protected mode.\r\n<code>func</code> starts with only one element in its stack,\r\na light userdata containing <code>ud</code>.\r\nIn case of errors,\r\n<a href=\"#lua_cpcall\"><code>lua_cpcall</code></a> returns the same error codes as <a href=\"#lua_pcall\"><code>lua_pcall</code></a>,\r\nplus the error object on the top of the stack;\r\notherwise, it returns zero, and does not change the stack.\r\nAll values returned by <code>func</code> are discarded.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_createtable\"><code>lua_createtable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_createtable (lua_State *L, int narr, int nrec);</pre>\r\n\r\n<p>\r\nCreates a new empty table and pushes it onto the stack.\r\nThe new table has space pre-allocated\r\nfor <code>narr</code> array elements and <code>nrec</code> non-array elements.\r\nThis pre-allocation is useful when you know exactly how many elements\r\nthe table will have.\r\nOtherwise you can use the function <a href=\"#lua_newtable\"><code>lua_newtable</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_dump\"><code>lua_dump</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>int lua_dump (lua_State *L, lua_Writer writer, void *data);</pre>\r\n\r\n<p>\r\nDumps a function as a binary chunk.\r\nReceives a Lua function on the top of the stack\r\nand produces a binary chunk that,\r\nif loaded again,\r\nresults in a function equivalent to the one dumped.\r\nAs it produces parts of the chunk,\r\n<a href=\"#lua_dump\"><code>lua_dump</code></a> calls function <code>writer</code> (see <a href=\"#lua_Writer\"><code>lua_Writer</code></a>)\r\nwith the given <code>data</code>\r\nto write them.\r\n\r\n\r\n<p>\r\nThe value returned is the error code returned by the last\r\ncall to the writer;\r\n0&nbsp;means no errors.\r\n\r\n\r\n<p>\r\nThis function does not pop the Lua function from the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_equal\"><code>lua_equal</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>e</em>]</span>\r\n<pre>int lua_equal (lua_State *L, int index1, int index2);</pre>\r\n\r\n<p>\r\nReturns 1 if the two values in acceptable indices <code>index1</code> and\r\n<code>index2</code> are equal,\r\nfollowing the semantics of the Lua <code>==</code> operator\r\n(that is, may call metamethods).\r\nOtherwise returns&nbsp;0.\r\nAlso returns&nbsp;0 if any of the indices is non valid.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_error\"><code>lua_error</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>v</em>]</span>\r\n<pre>int lua_error (lua_State *L);</pre>\r\n\r\n<p>\r\nGenerates a Lua error.\r\nThe error message (which can actually be a Lua value of any type)\r\nmust be on the stack top.\r\nThis function does a long jump,\r\nand therefore never returns.\r\n(see <a href=\"#luaL_error\"><code>luaL_error</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gc\"><code>lua_gc</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>e</em>]</span>\r\n<pre>int lua_gc (lua_State *L, int what, int data);</pre>\r\n\r\n<p>\r\nControls the garbage collector.\r\n\r\n\r\n<p>\r\nThis function performs several tasks,\r\naccording to the value of the parameter <code>what</code>:\r\n\r\n<ul>\r\n\r\n<li><b><code>LUA_GCSTOP</code>:</b>\r\nstops the garbage collector.\r\n</li>\r\n\r\n<li><b><code>LUA_GCRESTART</code>:</b>\r\nrestarts the garbage collector.\r\n</li>\r\n\r\n<li><b><code>LUA_GCCOLLECT</code>:</b>\r\nperforms a full garbage-collection cycle.\r\n</li>\r\n\r\n<li><b><code>LUA_GCCOUNT</code>:</b>\r\nreturns the current amount of memory (in Kbytes) in use by Lua.\r\n</li>\r\n\r\n<li><b><code>LUA_GCCOUNTB</code>:</b>\r\nreturns the remainder of dividing the current amount of bytes of\r\nmemory in use by Lua by 1024.\r\n</li>\r\n\r\n<li><b><code>LUA_GCSTEP</code>:</b>\r\nperforms an incremental step of garbage collection.\r\nThe step \"size\" is controlled by <code>data</code>\r\n(larger values mean more steps) in a non-specified way.\r\nIf you want to control the step size\r\nyou must experimentally tune the value of <code>data</code>.\r\nThe function returns 1 if the step finished a\r\ngarbage-collection cycle.\r\n</li>\r\n\r\n<li><b><code>LUA_GCSETPAUSE</code>:</b>\r\nsets <code>data</code> as the new value\r\nfor the <em>pause</em> of the collector (see <a href=\"#2.10\">&sect;2.10</a>).\r\nThe function returns the previous value of the pause.\r\n</li>\r\n\r\n<li><b><code>LUA_GCSETSTEPMUL</code>:</b>\r\nsets <code>data</code> as the new value for the <em>step multiplier</em> of\r\nthe collector (see <a href=\"#2.10\">&sect;2.10</a>).\r\nThe function returns the previous value of the step multiplier.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getallocf\"><code>lua_getallocf</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_Alloc lua_getallocf (lua_State *L, void **ud);</pre>\r\n\r\n<p>\r\nReturns the memory-allocation function of a given state.\r\nIf <code>ud</code> is not <code>NULL</code>, Lua stores in <code>*ud</code> the\r\nopaque pointer passed to <a href=\"#lua_newstate\"><code>lua_newstate</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getfenv\"><code>lua_getfenv</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_getfenv (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPushes onto the stack the environment table of\r\nthe value at the given index.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getfield\"><code>lua_getfield</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>e</em>]</span>\r\n<pre>void lua_getfield (lua_State *L, int index, const char *k);</pre>\r\n\r\n<p>\r\nPushes onto the stack the value <code>t[k]</code>,\r\nwhere <code>t</code> is the value at the given valid index.\r\nAs in Lua, this function may trigger a metamethod\r\nfor the \"index\" event (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getglobal\"><code>lua_getglobal</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>e</em>]</span>\r\n<pre>void lua_getglobal (lua_State *L, const char *name);</pre>\r\n\r\n<p>\r\nPushes onto the stack the value of the global <code>name</code>.\r\nIt is defined as a macro:\r\n\r\n<pre>\r\n     #define lua_getglobal(L,s)  lua_getfield(L, LUA_GLOBALSINDEX, s)\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getmetatable\"><code>lua_getmetatable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>-</em>]</span>\r\n<pre>int lua_getmetatable (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPushes onto the stack the metatable of the value at the given\r\nacceptable index.\r\nIf the index is not valid,\r\nor if the value does not have a metatable,\r\nthe function returns&nbsp;0 and pushes nothing on the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gettable\"><code>lua_gettable</code></a></h3><p>\r\n<span class=\"apii\">[-1, +1, <em>e</em>]</span>\r\n<pre>void lua_gettable (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPushes onto the stack the value <code>t[k]</code>,\r\nwhere <code>t</code> is the value at the given valid index\r\nand <code>k</code> is the value at the top of the stack.\r\n\r\n\r\n<p>\r\nThis function pops the key from the stack\r\n(putting the resulting value in its place).\r\nAs in Lua, this function may trigger a metamethod\r\nfor the \"index\" event (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gettop\"><code>lua_gettop</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_gettop (lua_State *L);</pre>\r\n\r\n<p>\r\nReturns the index of the top element in the stack.\r\nBecause indices start at&nbsp;1,\r\nthis result is equal to the number of elements in the stack\r\n(and so 0&nbsp;means an empty stack).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_insert\"><code>lua_insert</code></a></h3><p>\r\n<span class=\"apii\">[-1, +1, <em>-</em>]</span>\r\n<pre>void lua_insert (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nMoves the top element into the given valid index,\r\nshifting up the elements above this index to open space.\r\nCannot be called with a pseudo-index,\r\nbecause a pseudo-index is not an actual stack position.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Integer\"><code>lua_Integer</code></a></h3>\r\n<pre>typedef ptrdiff_t lua_Integer;</pre>\r\n\r\n<p>\r\nThe type used by the Lua API to represent integral values.\r\n\r\n\r\n<p>\r\nBy default it is a <code>ptrdiff_t</code>,\r\nwhich is usually the largest signed integral type the machine handles\r\n\"comfortably\".\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isboolean\"><code>lua_isboolean</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isboolean (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index has type boolean,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_iscfunction\"><code>lua_iscfunction</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_iscfunction (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a C&nbsp;function,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isfunction\"><code>lua_isfunction</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isfunction (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a function\r\n(either C or Lua), and 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_islightuserdata\"><code>lua_islightuserdata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_islightuserdata (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a light userdata,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isnil\"><code>lua_isnil</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isnil (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is <b>nil</b>,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isnone\"><code>lua_isnone</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isnone (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the given acceptable index is not valid\r\n(that is, it refers to an element outside the current stack),\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isnoneornil\"><code>lua_isnoneornil</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isnoneornil (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the given acceptable index is not valid\r\n(that is, it refers to an element outside the current stack)\r\nor if the value at this index is <b>nil</b>,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isnumber\"><code>lua_isnumber</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isnumber (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a number\r\nor a string convertible to a number,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isstring\"><code>lua_isstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isstring (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a string\r\nor a number (which is always convertible to a string),\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_istable\"><code>lua_istable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_istable (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a table,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isthread\"><code>lua_isthread</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isthread (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a thread,\r\nand 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_isuserdata\"><code>lua_isuserdata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_isuserdata (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at the given acceptable index is a userdata\r\n(either full or light), and 0&nbsp;otherwise.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_lessthan\"><code>lua_lessthan</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>e</em>]</span>\r\n<pre>int lua_lessthan (lua_State *L, int index1, int index2);</pre>\r\n\r\n<p>\r\nReturns 1 if the value at acceptable index <code>index1</code> is smaller\r\nthan the value at acceptable index <code>index2</code>,\r\nfollowing the semantics of the Lua <code>&lt;</code> operator\r\n(that is, may call metamethods).\r\nOtherwise returns&nbsp;0.\r\nAlso returns&nbsp;0 if any of the indices is non valid.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_load\"><code>lua_load</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>int lua_load (lua_State *L,\r\n              lua_Reader reader,\r\n              void *data,\r\n              const char *chunkname);</pre>\r\n\r\n<p>\r\nLoads a Lua chunk.\r\nIf there are no errors,\r\n<a href=\"#lua_load\"><code>lua_load</code></a> pushes the compiled chunk as a Lua\r\nfunction on top of the stack.\r\nOtherwise, it pushes an error message.\r\nThe return values of <a href=\"#lua_load\"><code>lua_load</code></a> are:\r\n\r\n<ul>\r\n\r\n<li><b>0:</b> no errors;</li>\r\n\r\n<li><b><a name=\"pdf-LUA_ERRSYNTAX\"><code>LUA_ERRSYNTAX</code></a>:</b>\r\nsyntax error during pre-compilation;</li>\r\n\r\n<li><b><a href=\"#pdf-LUA_ERRMEM\"><code>LUA_ERRMEM</code></a>:</b>\r\nmemory allocation error.</li>\r\n\r\n</ul>\r\n\r\n<p>\r\nThis function only loads a chunk;\r\nit does not run it.\r\n\r\n\r\n<p>\r\n<a href=\"#lua_load\"><code>lua_load</code></a> automatically detects whether the chunk is text or binary,\r\nand loads it accordingly (see program <code>luac</code>).\r\n\r\n\r\n<p>\r\nThe <a href=\"#lua_load\"><code>lua_load</code></a> function uses a user-supplied <code>reader</code> function\r\nto read the chunk (see <a href=\"#lua_Reader\"><code>lua_Reader</code></a>).\r\nThe <code>data</code> argument is an opaque value passed to the reader function.\r\n\r\n\r\n<p>\r\nThe <code>chunkname</code> argument gives a name to the chunk,\r\nwhich is used for error messages and in debug information (see <a href=\"#3.8\">&sect;3.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_newstate\"><code>lua_newstate</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_State *lua_newstate (lua_Alloc f, void *ud);</pre>\r\n\r\n<p>\r\nCreates a new, independent state.\r\nReturns <code>NULL</code> if cannot create the state\r\n(due to lack of memory).\r\nThe argument <code>f</code> is the allocator function;\r\nLua does all memory allocation for this state through this function.\r\nThe second argument, <code>ud</code>, is an opaque pointer that Lua\r\nsimply passes to the allocator in every call.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_newtable\"><code>lua_newtable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_newtable (lua_State *L);</pre>\r\n\r\n<p>\r\nCreates a new empty table and pushes it onto the stack.\r\nIt is equivalent to <code>lua_createtable(L, 0, 0)</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_newthread\"><code>lua_newthread</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>lua_State *lua_newthread (lua_State *L);</pre>\r\n\r\n<p>\r\nCreates a new thread, pushes it on the stack,\r\nand returns a pointer to a <a href=\"#lua_State\"><code>lua_State</code></a> that represents this new thread.\r\nThe new state returned by this function shares with the original state\r\nall global objects (such as tables),\r\nbut has an independent execution stack.\r\n\r\n\r\n<p>\r\nThere is no explicit function to close or to destroy a thread.\r\nThreads are subject to garbage collection,\r\nlike any Lua object.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_newuserdata\"><code>lua_newuserdata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void *lua_newuserdata (lua_State *L, size_t size);</pre>\r\n\r\n<p>\r\nThis function allocates a new block of memory with the given size,\r\npushes onto the stack a new full userdata with the block address,\r\nand returns this address.\r\n\r\n\r\n<p>\r\nUserdata represent C&nbsp;values in Lua.\r\nA <em>full userdata</em> represents a block of memory.\r\nIt is an object (like a table):\r\nyou must create it, it can have its own metatable,\r\nand you can detect when it is being collected.\r\nA full userdata is only equal to itself (under raw equality).\r\n\r\n\r\n<p>\r\nWhen Lua collects a full userdata with a <code>gc</code> metamethod,\r\nLua calls the metamethod and marks the userdata as finalized.\r\nWhen this userdata is collected again then\r\nLua frees its corresponding memory.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_next\"><code>lua_next</code></a></h3><p>\r\n<span class=\"apii\">[-1, +(2|0), <em>e</em>]</span>\r\n<pre>int lua_next (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPops a key from the stack,\r\nand pushes a key-value pair from the table at the given index\r\n(the \"next\" pair after the given key).\r\nIf there are no more elements in the table,\r\nthen <a href=\"#lua_next\"><code>lua_next</code></a> returns 0 (and pushes nothing).\r\n\r\n\r\n<p>\r\nA typical traversal looks like this:\r\n\r\n<pre>\r\n     /* table is in the stack at index 't' */\r\n     lua_pushnil(L);  /* first key */\r\n     while (lua_next(L, t) != 0) {\r\n       /* uses 'key' (at index -2) and 'value' (at index -1) */\r\n       printf(\"%s - %s\\n\",\r\n              lua_typename(L, lua_type(L, -2)),\r\n              lua_typename(L, lua_type(L, -1)));\r\n       /* removes 'value'; keeps 'key' for next iteration */\r\n       lua_pop(L, 1);\r\n     }\r\n</pre>\r\n\r\n<p>\r\nWhile traversing a table,\r\ndo not call <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> directly on a key,\r\nunless you know that the key is actually a string.\r\nRecall that <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> <em>changes</em>\r\nthe value at the given index;\r\nthis confuses the next call to <a href=\"#lua_next\"><code>lua_next</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Number\"><code>lua_Number</code></a></h3>\r\n<pre>typedef double lua_Number;</pre>\r\n\r\n<p>\r\nThe type of numbers in Lua.\r\nBy default, it is double, but that can be changed in <code>luaconf.h</code>.\r\n\r\n\r\n<p>\r\nThrough the configuration file you can change\r\nLua to operate with another type for numbers (e.g., float or long).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_objlen\"><code>lua_objlen</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>size_t lua_objlen (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns the \"length\" of the value at the given acceptable index:\r\nfor strings, this is the string length;\r\nfor tables, this is the result of the length operator ('<code>#</code>');\r\nfor userdata, this is the size of the block of memory allocated\r\nfor the userdata;\r\nfor other values, it is&nbsp;0.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pcall\"><code>lua_pcall</code></a></h3><p>\r\n<span class=\"apii\">[-(nargs + 1), +(nresults|1), <em>-</em>]</span>\r\n<pre>int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc);</pre>\r\n\r\n<p>\r\nCalls a function in protected mode.\r\n\r\n\r\n<p>\r\nBoth <code>nargs</code> and <code>nresults</code> have the same meaning as\r\nin <a href=\"#lua_call\"><code>lua_call</code></a>.\r\nIf there are no errors during the call,\r\n<a href=\"#lua_pcall\"><code>lua_pcall</code></a> behaves exactly like <a href=\"#lua_call\"><code>lua_call</code></a>.\r\nHowever, if there is any error,\r\n<a href=\"#lua_pcall\"><code>lua_pcall</code></a> catches it,\r\npushes a single value on the stack (the error message),\r\nand returns an error code.\r\nLike <a href=\"#lua_call\"><code>lua_call</code></a>,\r\n<a href=\"#lua_pcall\"><code>lua_pcall</code></a> always removes the function\r\nand its arguments from the stack.\r\n\r\n\r\n<p>\r\nIf <code>errfunc</code> is 0,\r\nthen the error message returned on the stack\r\nis exactly the original error message.\r\nOtherwise, <code>errfunc</code> is the stack index of an\r\n<em>error handler function</em>.\r\n(In the current implementation, this index cannot be a pseudo-index.)\r\nIn case of runtime errors,\r\nthis function will be called with the error message\r\nand its return value will be the message returned on the stack by <a href=\"#lua_pcall\"><code>lua_pcall</code></a>.\r\n\r\n\r\n<p>\r\nTypically, the error handler function is used to add more debug\r\ninformation to the error message, such as a stack traceback.\r\nSuch information cannot be gathered after the return of <a href=\"#lua_pcall\"><code>lua_pcall</code></a>,\r\nsince by then the stack has unwound.\r\n\r\n\r\n<p>\r\nThe <a href=\"#lua_pcall\"><code>lua_pcall</code></a> function returns 0 in case of success\r\nor one of the following error codes\r\n(defined in <code>lua.h</code>):\r\n\r\n<ul>\r\n\r\n<li><b><a name=\"pdf-LUA_ERRRUN\"><code>LUA_ERRRUN</code></a>:</b>\r\na runtime error.\r\n</li>\r\n\r\n<li><b><a name=\"pdf-LUA_ERRMEM\"><code>LUA_ERRMEM</code></a>:</b>\r\nmemory allocation error.\r\nFor such errors, Lua does not call the error handler function.\r\n</li>\r\n\r\n<li><b><a name=\"pdf-LUA_ERRERR\"><code>LUA_ERRERR</code></a>:</b>\r\nerror while running the error handler function.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pop\"><code>lua_pop</code></a></h3><p>\r\n<span class=\"apii\">[-n, +0, <em>-</em>]</span>\r\n<pre>void lua_pop (lua_State *L, int n);</pre>\r\n\r\n<p>\r\nPops <code>n</code> elements from the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushboolean\"><code>lua_pushboolean</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushboolean (lua_State *L, int b);</pre>\r\n\r\n<p>\r\nPushes a boolean value with value <code>b</code> onto the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushcclosure\"><code>lua_pushcclosure</code></a></h3><p>\r\n<span class=\"apii\">[-n, +1, <em>m</em>]</span>\r\n<pre>void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n);</pre>\r\n\r\n<p>\r\nPushes a new C&nbsp;closure onto the stack.\r\n\r\n\r\n<p>\r\nWhen a C&nbsp;function is created,\r\nit is possible to associate some values with it,\r\nthus creating a C&nbsp;closure (see <a href=\"#3.4\">&sect;3.4</a>);\r\nthese values are then accessible to the function whenever it is called.\r\nTo associate values with a C&nbsp;function,\r\nfirst these values should be pushed onto the stack\r\n(when there are multiple values, the first value is pushed first).\r\nThen <a href=\"#lua_pushcclosure\"><code>lua_pushcclosure</code></a>\r\nis called to create and push the C&nbsp;function onto the stack,\r\nwith the argument <code>n</code> telling how many values should be\r\nassociated with the function.\r\n<a href=\"#lua_pushcclosure\"><code>lua_pushcclosure</code></a> also pops these values from the stack.\r\n\r\n\r\n<p>\r\nThe maximum value for <code>n</code> is 255.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushcfunction\"><code>lua_pushcfunction</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_pushcfunction (lua_State *L, lua_CFunction f);</pre>\r\n\r\n<p>\r\nPushes a C&nbsp;function onto the stack.\r\nThis function receives a pointer to a C function\r\nand pushes onto the stack a Lua value of type <code>function</code> that,\r\nwhen called, invokes the corresponding C&nbsp;function.\r\n\r\n\r\n<p>\r\nAny function to be registered in Lua must\r\nfollow the correct protocol to receive its parameters\r\nand return its results (see <a href=\"#lua_CFunction\"><code>lua_CFunction</code></a>).\r\n\r\n\r\n<p>\r\n<code>lua_pushcfunction</code> is defined as a macro:\r\n\r\n<pre>\r\n     #define lua_pushcfunction(L,f)  lua_pushcclosure(L,f,0)\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushfstring\"><code>lua_pushfstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>const char *lua_pushfstring (lua_State *L, const char *fmt, ...);</pre>\r\n\r\n<p>\r\nPushes onto the stack a formatted string\r\nand returns a pointer to this string.\r\nIt is similar to the C&nbsp;function <code>sprintf</code>,\r\nbut has some important differences:\r\n\r\n<ul>\r\n\r\n<li>\r\nYou do not have to allocate space for the result:\r\nthe result is a Lua string and Lua takes care of memory allocation\r\n(and deallocation, through garbage collection).\r\n</li>\r\n\r\n<li>\r\nThe conversion specifiers are quite restricted.\r\nThere are no flags, widths, or precisions.\r\nThe conversion specifiers can only be\r\n'<code>%%</code>' (inserts a '<code>%</code>' in the string),\r\n'<code>%s</code>' (inserts a zero-terminated string, with no size restrictions),\r\n'<code>%f</code>' (inserts a <a href=\"#lua_Number\"><code>lua_Number</code></a>),\r\n'<code>%p</code>' (inserts a pointer as a hexadecimal numeral),\r\n'<code>%d</code>' (inserts an <code>int</code>), and\r\n'<code>%c</code>' (inserts an <code>int</code> as a character).\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushinteger\"><code>lua_pushinteger</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushinteger (lua_State *L, lua_Integer n);</pre>\r\n\r\n<p>\r\nPushes a number with value <code>n</code> onto the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushlightuserdata\"><code>lua_pushlightuserdata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushlightuserdata (lua_State *L, void *p);</pre>\r\n\r\n<p>\r\nPushes a light userdata onto the stack.\r\n\r\n\r\n<p>\r\nUserdata represent C&nbsp;values in Lua.\r\nA <em>light userdata</em> represents a pointer.\r\nIt is a value (like a number):\r\nyou do not create it, it has no individual metatable,\r\nand it is not collected (as it was never created).\r\nA light userdata is equal to \"any\"\r\nlight userdata with the same C&nbsp;address.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushliteral\"><code>lua_pushliteral</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_pushliteral (lua_State *L, const char *s);</pre>\r\n\r\n<p>\r\nThis macro is equivalent to <a href=\"#lua_pushlstring\"><code>lua_pushlstring</code></a>,\r\nbut can be used only when <code>s</code> is a literal string.\r\nIn these cases, it automatically provides the string length.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushlstring\"><code>lua_pushlstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_pushlstring (lua_State *L, const char *s, size_t len);</pre>\r\n\r\n<p>\r\nPushes the string pointed to by <code>s</code> with size <code>len</code>\r\nonto the stack.\r\nLua makes (or reuses) an internal copy of the given string,\r\nso the memory at <code>s</code> can be freed or reused immediately after\r\nthe function returns.\r\nThe string can contain embedded zeros.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushnil\"><code>lua_pushnil</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushnil (lua_State *L);</pre>\r\n\r\n<p>\r\nPushes a nil value onto the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushnumber\"><code>lua_pushnumber</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushnumber (lua_State *L, lua_Number n);</pre>\r\n\r\n<p>\r\nPushes a number with value <code>n</code> onto the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushstring\"><code>lua_pushstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void lua_pushstring (lua_State *L, const char *s);</pre>\r\n\r\n<p>\r\nPushes the zero-terminated string pointed to by <code>s</code>\r\nonto the stack.\r\nLua makes (or reuses) an internal copy of the given string,\r\nso the memory at <code>s</code> can be freed or reused immediately after\r\nthe function returns.\r\nThe string cannot contain embedded zeros;\r\nit is assumed to end at the first zero.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushthread\"><code>lua_pushthread</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>int lua_pushthread (lua_State *L);</pre>\r\n\r\n<p>\r\nPushes the thread represented by <code>L</code> onto the stack.\r\nReturns 1 if this thread is the main thread of its state.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushvalue\"><code>lua_pushvalue</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_pushvalue (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPushes a copy of the element at the given valid index\r\nonto the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_pushvfstring\"><code>lua_pushvfstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>const char *lua_pushvfstring (lua_State *L,\r\n                              const char *fmt,\r\n                              va_list argp);</pre>\r\n\r\n<p>\r\nEquivalent to <a href=\"#lua_pushfstring\"><code>lua_pushfstring</code></a>, except that it receives a <code>va_list</code>\r\ninstead of a variable number of arguments.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_rawequal\"><code>lua_rawequal</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_rawequal (lua_State *L, int index1, int index2);</pre>\r\n\r\n<p>\r\nReturns 1 if the two values in acceptable indices <code>index1</code> and\r\n<code>index2</code> are primitively equal\r\n(that is, without calling metamethods).\r\nOtherwise returns&nbsp;0.\r\nAlso returns&nbsp;0 if any of the indices are non valid.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_rawget\"><code>lua_rawget</code></a></h3><p>\r\n<span class=\"apii\">[-1, +1, <em>-</em>]</span>\r\n<pre>void lua_rawget (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nSimilar to <a href=\"#lua_gettable\"><code>lua_gettable</code></a>, but does a raw access\r\n(i.e., without metamethods).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_rawgeti\"><code>lua_rawgeti</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void lua_rawgeti (lua_State *L, int index, int n);</pre>\r\n\r\n<p>\r\nPushes onto the stack the value <code>t[n]</code>,\r\nwhere <code>t</code> is the value at the given valid index.\r\nThe access is raw;\r\nthat is, it does not invoke metamethods.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_rawset\"><code>lua_rawset</code></a></h3><p>\r\n<span class=\"apii\">[-2, +0, <em>m</em>]</span>\r\n<pre>void lua_rawset (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nSimilar to <a href=\"#lua_settable\"><code>lua_settable</code></a>, but does a raw assignment\r\n(i.e., without metamethods).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_rawseti\"><code>lua_rawseti</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>m</em>]</span>\r\n<pre>void lua_rawseti (lua_State *L, int index, int n);</pre>\r\n\r\n<p>\r\nDoes the equivalent of <code>t[n] = v</code>,\r\nwhere <code>t</code> is the value at the given valid index\r\nand <code>v</code> is the value at the top of the stack.\r\n\r\n\r\n<p>\r\nThis function pops the value from the stack.\r\nThe assignment is raw;\r\nthat is, it does not invoke metamethods.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Reader\"><code>lua_Reader</code></a></h3>\r\n<pre>typedef const char * (*lua_Reader) (lua_State *L,\r\n                                    void *data,\r\n                                    size_t *size);</pre>\r\n\r\n<p>\r\nThe reader function used by <a href=\"#lua_load\"><code>lua_load</code></a>.\r\nEvery time it needs another piece of the chunk,\r\n<a href=\"#lua_load\"><code>lua_load</code></a> calls the reader,\r\npassing along its <code>data</code> parameter.\r\nThe reader must return a pointer to a block of memory\r\nwith a new piece of the chunk\r\nand set <code>size</code> to the block size.\r\nThe block must exist until the reader function is called again.\r\nTo signal the end of the chunk,\r\nthe reader must return <code>NULL</code> or set <code>size</code> to zero.\r\nThe reader function may return pieces of any size greater than zero.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_register\"><code>lua_register</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>e</em>]</span>\r\n<pre>void lua_register (lua_State *L,\r\n                   const char *name,\r\n                   lua_CFunction f);</pre>\r\n\r\n<p>\r\nSets the C function <code>f</code> as the new value of global <code>name</code>.\r\nIt is defined as a macro:\r\n\r\n<pre>\r\n     #define lua_register(L,n,f) \\\r\n            (lua_pushcfunction(L, f), lua_setglobal(L, n))\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_remove\"><code>lua_remove</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>-</em>]</span>\r\n<pre>void lua_remove (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nRemoves the element at the given valid index,\r\nshifting down the elements above this index to fill the gap.\r\nCannot be called with a pseudo-index,\r\nbecause a pseudo-index is not an actual stack position.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_replace\"><code>lua_replace</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>-</em>]</span>\r\n<pre>void lua_replace (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nMoves the top element into the given position (and pops it),\r\nwithout shifting any element\r\n(therefore replacing the value at the given position).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_resume\"><code>lua_resume</code></a></h3><p>\r\n<span class=\"apii\">[-?, +?, <em>-</em>]</span>\r\n<pre>int lua_resume (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nStarts and resumes a coroutine in a given thread.\r\n\r\n\r\n<p>\r\nTo start a coroutine, you first create a new thread\r\n(see <a href=\"#lua_newthread\"><code>lua_newthread</code></a>);\r\nthen you push onto its stack the main function plus any arguments;\r\nthen you call <a href=\"#lua_resume\"><code>lua_resume</code></a>,\r\nwith <code>narg</code> being the number of arguments.\r\nThis call returns when the coroutine suspends or finishes its execution.\r\nWhen it returns, the stack contains all values passed to <a href=\"#lua_yield\"><code>lua_yield</code></a>,\r\nor all values returned by the body function.\r\n<a href=\"#lua_resume\"><code>lua_resume</code></a> returns\r\n<a href=\"#pdf-LUA_YIELD\"><code>LUA_YIELD</code></a> if the coroutine yields,\r\n0 if the coroutine finishes its execution\r\nwithout errors,\r\nor an error code in case of errors (see <a href=\"#lua_pcall\"><code>lua_pcall</code></a>).\r\nIn case of errors,\r\nthe stack is not unwound,\r\nso you can use the debug API over it.\r\nThe error message is on the top of the stack.\r\nTo restart a coroutine, you put on its stack only the values to\r\nbe passed as results from <code>yield</code>,\r\nand then call <a href=\"#lua_resume\"><code>lua_resume</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setallocf\"><code>lua_setallocf</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);</pre>\r\n\r\n<p>\r\nChanges the allocator function of a given state to <code>f</code>\r\nwith user data <code>ud</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setfenv\"><code>lua_setfenv</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>-</em>]</span>\r\n<pre>int lua_setfenv (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPops a table from the stack and sets it as\r\nthe new environment for the value at the given index.\r\nIf the value at the given index is\r\nneither a function nor a thread nor a userdata,\r\n<a href=\"#lua_setfenv\"><code>lua_setfenv</code></a> returns 0.\r\nOtherwise it returns 1.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setfield\"><code>lua_setfield</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>e</em>]</span>\r\n<pre>void lua_setfield (lua_State *L, int index, const char *k);</pre>\r\n\r\n<p>\r\nDoes the equivalent to <code>t[k] = v</code>,\r\nwhere <code>t</code> is the value at the given valid index\r\nand <code>v</code> is the value at the top of the stack.\r\n\r\n\r\n<p>\r\nThis function pops the value from the stack.\r\nAs in Lua, this function may trigger a metamethod\r\nfor the \"newindex\" event (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setglobal\"><code>lua_setglobal</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>e</em>]</span>\r\n<pre>void lua_setglobal (lua_State *L, const char *name);</pre>\r\n\r\n<p>\r\nPops a value from the stack and\r\nsets it as the new value of global <code>name</code>.\r\nIt is defined as a macro:\r\n\r\n<pre>\r\n     #define lua_setglobal(L,s)   lua_setfield(L, LUA_GLOBALSINDEX, s)\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setmetatable\"><code>lua_setmetatable</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>-</em>]</span>\r\n<pre>int lua_setmetatable (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nPops a table from the stack and\r\nsets it as the new metatable for the value at the given\r\nacceptable index.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_settable\"><code>lua_settable</code></a></h3><p>\r\n<span class=\"apii\">[-2, +0, <em>e</em>]</span>\r\n<pre>void lua_settable (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nDoes the equivalent to <code>t[k] = v</code>,\r\nwhere <code>t</code> is the value at the given valid index,\r\n<code>v</code> is the value at the top of the stack,\r\nand <code>k</code> is the value just below the top.\r\n\r\n\r\n<p>\r\nThis function pops both the key and the value from the stack.\r\nAs in Lua, this function may trigger a metamethod\r\nfor the \"newindex\" event (see <a href=\"#2.8\">&sect;2.8</a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_settop\"><code>lua_settop</code></a></h3><p>\r\n<span class=\"apii\">[-?, +?, <em>-</em>]</span>\r\n<pre>void lua_settop (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nAccepts any acceptable index, or&nbsp;0,\r\nand sets the stack top to this index.\r\nIf the new top is larger than the old one,\r\nthen the new elements are filled with <b>nil</b>.\r\nIf <code>index</code> is&nbsp;0, then all stack elements are removed.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_State\"><code>lua_State</code></a></h3>\r\n<pre>typedef struct lua_State lua_State;</pre>\r\n\r\n<p>\r\nOpaque structure that keeps the whole state of a Lua interpreter.\r\nThe Lua library is fully reentrant:\r\nit has no global variables.\r\nAll information about a state is kept in this structure.\r\n\r\n\r\n<p>\r\nA pointer to this state must be passed as the first argument to\r\nevery function in the library, except to <a href=\"#lua_newstate\"><code>lua_newstate</code></a>,\r\nwhich creates a Lua state from scratch.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_status\"><code>lua_status</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_status (lua_State *L);</pre>\r\n\r\n<p>\r\nReturns the status of the thread <code>L</code>.\r\n\r\n\r\n<p>\r\nThe status can be 0 for a normal thread,\r\nan error code if the thread finished its execution with an error,\r\nor <a name=\"pdf-LUA_YIELD\"><code>LUA_YIELD</code></a> if the thread is suspended.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_toboolean\"><code>lua_toboolean</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_toboolean (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts the Lua value at the given acceptable index to a C&nbsp;boolean\r\nvalue (0&nbsp;or&nbsp;1).\r\nLike all tests in Lua,\r\n<a href=\"#lua_toboolean\"><code>lua_toboolean</code></a> returns 1 for any Lua value\r\ndifferent from <b>false</b> and <b>nil</b>;\r\notherwise it returns 0.\r\nIt also returns 0 when called with a non-valid index.\r\n(If you want to accept only actual boolean values,\r\nuse <a href=\"#lua_isboolean\"><code>lua_isboolean</code></a> to test the value's type.)\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tocfunction\"><code>lua_tocfunction</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_CFunction lua_tocfunction (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts a value at the given acceptable index to a C&nbsp;function.\r\nThat value must be a C&nbsp;function;\r\notherwise, returns <code>NULL</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tointeger\"><code>lua_tointeger</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_Integer lua_tointeger (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts the Lua value at the given acceptable index\r\nto the signed integral type <a href=\"#lua_Integer\"><code>lua_Integer</code></a>.\r\nThe Lua value must be a number or a string convertible to a number\r\n(see <a href=\"#2.2.1\">&sect;2.2.1</a>);\r\notherwise, <a href=\"#lua_tointeger\"><code>lua_tointeger</code></a> returns&nbsp;0.\r\n\r\n\r\n<p>\r\nIf the number is not an integer,\r\nit is truncated in some non-specified way.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tolstring\"><code>lua_tolstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>const char *lua_tolstring (lua_State *L, int index, size_t *len);</pre>\r\n\r\n<p>\r\nConverts the Lua value at the given acceptable index to a C&nbsp;string.\r\nIf <code>len</code> is not <code>NULL</code>,\r\nit also sets <code>*len</code> with the string length.\r\nThe Lua value must be a string or a number;\r\notherwise, the function returns <code>NULL</code>.\r\nIf the value is a number,\r\nthen <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> also\r\n<em>changes the actual value in the stack to a string</em>.\r\n(This change confuses <a href=\"#lua_next\"><code>lua_next</code></a>\r\nwhen <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> is applied to keys during a table traversal.)\r\n\r\n\r\n<p>\r\n<a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> returns a fully aligned pointer\r\nto a string inside the Lua state.\r\nThis string always has a zero ('<code>\\0</code>')\r\nafter its last character (as in&nbsp;C),\r\nbut can contain other zeros in its body.\r\nBecause Lua has garbage collection,\r\nthere is no guarantee that the pointer returned by <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a>\r\nwill be valid after the corresponding value is removed from the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tonumber\"><code>lua_tonumber</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_Number lua_tonumber (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts the Lua value at the given acceptable index\r\nto the C&nbsp;type <a href=\"#lua_Number\"><code>lua_Number</code></a> (see <a href=\"#lua_Number\"><code>lua_Number</code></a>).\r\nThe Lua value must be a number or a string convertible to a number\r\n(see <a href=\"#2.2.1\">&sect;2.2.1</a>);\r\notherwise, <a href=\"#lua_tonumber\"><code>lua_tonumber</code></a> returns&nbsp;0.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_topointer\"><code>lua_topointer</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>const void *lua_topointer (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts the value at the given acceptable index to a generic\r\nC&nbsp;pointer (<code>void*</code>).\r\nThe value can be a userdata, a table, a thread, or a function;\r\notherwise, <a href=\"#lua_topointer\"><code>lua_topointer</code></a> returns <code>NULL</code>.\r\nDifferent objects will give different pointers.\r\nThere is no way to convert the pointer back to its original value.\r\n\r\n\r\n<p>\r\nTypically this function is used only for debug information.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tostring\"><code>lua_tostring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>const char *lua_tostring (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nEquivalent to <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> with <code>len</code> equal to <code>NULL</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_tothread\"><code>lua_tothread</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_State *lua_tothread (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nConverts the value at the given acceptable index to a Lua thread\r\n(represented as <code>lua_State*</code>).\r\nThis value must be a thread;\r\notherwise, the function returns <code>NULL</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_touserdata\"><code>lua_touserdata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>void *lua_touserdata (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nIf the value at the given acceptable index is a full userdata,\r\nreturns its block address.\r\nIf the value is a light userdata,\r\nreturns its pointer.\r\nOtherwise, returns <code>NULL</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_type\"><code>lua_type</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_type (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns the type of the value in the given acceptable index,\r\nor <code>LUA_TNONE</code> for a non-valid index\r\n(that is, an index to an \"empty\" stack position).\r\nThe types returned by <a href=\"#lua_type\"><code>lua_type</code></a> are coded by the following constants\r\ndefined in <code>lua.h</code>:\r\n<code>LUA_TNIL</code>,\r\n<code>LUA_TNUMBER</code>,\r\n<code>LUA_TBOOLEAN</code>,\r\n<code>LUA_TSTRING</code>,\r\n<code>LUA_TTABLE</code>,\r\n<code>LUA_TFUNCTION</code>,\r\n<code>LUA_TUSERDATA</code>,\r\n<code>LUA_TTHREAD</code>,\r\nand\r\n<code>LUA_TLIGHTUSERDATA</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_typename\"><code>lua_typename</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>const char *lua_typename  (lua_State *L, int tp);</pre>\r\n\r\n<p>\r\nReturns the name of the type encoded by the value <code>tp</code>,\r\nwhich must be one the values returned by <a href=\"#lua_type\"><code>lua_type</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Writer\"><code>lua_Writer</code></a></h3>\r\n<pre>typedef int (*lua_Writer) (lua_State *L,\r\n                           const void* p,\r\n                           size_t sz,\r\n                           void* ud);</pre>\r\n\r\n<p>\r\nThe type of the writer function used by <a href=\"#lua_dump\"><code>lua_dump</code></a>.\r\nEvery time it produces another piece of chunk,\r\n<a href=\"#lua_dump\"><code>lua_dump</code></a> calls the writer,\r\npassing along the buffer to be written (<code>p</code>),\r\nits size (<code>sz</code>),\r\nand the <code>data</code> parameter supplied to <a href=\"#lua_dump\"><code>lua_dump</code></a>.\r\n\r\n\r\n<p>\r\nThe writer returns an error code:\r\n0&nbsp;means no errors;\r\nany other value means an error and stops <a href=\"#lua_dump\"><code>lua_dump</code></a> from\r\ncalling the writer again.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_xmove\"><code>lua_xmove</code></a></h3><p>\r\n<span class=\"apii\">[-?, +?, <em>-</em>]</span>\r\n<pre>void lua_xmove (lua_State *from, lua_State *to, int n);</pre>\r\n\r\n<p>\r\nExchange values between different threads of the <em>same</em> global state.\r\n\r\n\r\n<p>\r\nThis function pops <code>n</code> values from the stack <code>from</code>,\r\nand pushes them onto the stack <code>to</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_yield\"><code>lua_yield</code></a></h3><p>\r\n<span class=\"apii\">[-?, +?, <em>-</em>]</span>\r\n<pre>int lua_yield  (lua_State *L, int nresults);</pre>\r\n\r\n<p>\r\nYields a coroutine.\r\n\r\n\r\n<p>\r\nThis function should only be called as the\r\nreturn expression of a C&nbsp;function, as follows:\r\n\r\n<pre>\r\n     return lua_yield (L, nresults);\r\n</pre><p>\r\nWhen a C&nbsp;function calls <a href=\"#lua_yield\"><code>lua_yield</code></a> in that way,\r\nthe running coroutine suspends its execution,\r\nand the call to <a href=\"#lua_resume\"><code>lua_resume</code></a> that started this coroutine returns.\r\nThe parameter <code>nresults</code> is the number of values from the stack\r\nthat are passed as results to <a href=\"#lua_resume\"><code>lua_resume</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>3.8 - <a name=\"3.8\">The Debug Interface</a></h2>\r\n\r\n<p>\r\nLua has no built-in debugging facilities.\r\nInstead, it offers a special interface\r\nby means of functions and <em>hooks</em>.\r\nThis interface allows the construction of different\r\nkinds of debuggers, profilers, and other tools\r\nthat need \"inside information\" from the interpreter.\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Debug\"><code>lua_Debug</code></a></h3>\r\n<pre>typedef struct lua_Debug {\r\n  int event;\r\n  const char *name;           /* (n) */\r\n  const char *namewhat;       /* (n) */\r\n  const char *what;           /* (S) */\r\n  const char *source;         /* (S) */\r\n  int currentline;            /* (l) */\r\n  int nups;                   /* (u) number of upvalues */\r\n  int linedefined;            /* (S) */\r\n  int lastlinedefined;        /* (S) */\r\n  char short_src[LUA_IDSIZE]; /* (S) */\r\n  /* private part */\r\n  <em>other fields</em>\r\n} lua_Debug;</pre>\r\n\r\n<p>\r\nA structure used to carry different pieces of\r\ninformation about an active function.\r\n<a href=\"#lua_getstack\"><code>lua_getstack</code></a> fills only the private part\r\nof this structure, for later use.\r\nTo fill the other fields of <a href=\"#lua_Debug\"><code>lua_Debug</code></a> with useful information,\r\ncall <a href=\"#lua_getinfo\"><code>lua_getinfo</code></a>.\r\n\r\n\r\n<p>\r\nThe fields of <a href=\"#lua_Debug\"><code>lua_Debug</code></a> have the following meaning:\r\n\r\n<ul>\r\n\r\n<li><b><code>source</code>:</b>\r\nIf the function was defined in a string,\r\nthen <code>source</code> is that string.\r\nIf the function was defined in a file,\r\nthen <code>source</code> starts with a '<code>@</code>' followed by the file name.\r\n</li>\r\n\r\n<li><b><code>short_src</code>:</b>\r\na \"printable\" version of <code>source</code>, to be used in error messages.\r\n</li>\r\n\r\n<li><b><code>linedefined</code>:</b>\r\nthe line number where the definition of the function starts.\r\n</li>\r\n\r\n<li><b><code>lastlinedefined</code>:</b>\r\nthe line number where the definition of the function ends.\r\n</li>\r\n\r\n<li><b><code>what</code>:</b>\r\nthe string <code>\"Lua\"</code> if the function is a Lua function,\r\n<code>\"C\"</code> if it is a C&nbsp;function,\r\n<code>\"main\"</code> if it is the main part of a chunk,\r\nand <code>\"tail\"</code> if it was a function that did a tail call.\r\nIn the latter case,\r\nLua has no other information about the function.\r\n</li>\r\n\r\n<li><b><code>currentline</code>:</b>\r\nthe current line where the given function is executing.\r\nWhen no line information is available,\r\n<code>currentline</code> is set to -1.\r\n</li>\r\n\r\n<li><b><code>name</code>:</b>\r\na reasonable name for the given function.\r\nBecause functions in Lua are first-class values,\r\nthey do not have a fixed name:\r\nsome functions can be the value of multiple global variables,\r\nwhile others can be stored only in a table field.\r\nThe <code>lua_getinfo</code> function checks how the function was\r\ncalled to find a suitable name.\r\nIf it cannot find a name,\r\nthen <code>name</code> is set to <code>NULL</code>.\r\n</li>\r\n\r\n<li><b><code>namewhat</code>:</b>\r\nexplains the <code>name</code> field.\r\nThe value of <code>namewhat</code> can be\r\n<code>\"global\"</code>, <code>\"local\"</code>, <code>\"method\"</code>,\r\n<code>\"field\"</code>, <code>\"upvalue\"</code>, or <code>\"\"</code> (the empty string),\r\naccording to how the function was called.\r\n(Lua uses the empty string when no other option seems to apply.)\r\n</li>\r\n\r\n<li><b><code>nups</code>:</b>\r\nthe number of upvalues of the function.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gethook\"><code>lua_gethook</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_Hook lua_gethook (lua_State *L);</pre>\r\n\r\n<p>\r\nReturns the current hook function.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gethookcount\"><code>lua_gethookcount</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_gethookcount (lua_State *L);</pre>\r\n\r\n<p>\r\nReturns the current hook count.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_gethookmask\"><code>lua_gethookmask</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_gethookmask (lua_State *L);</pre>\r\n\r\n<p>\r\nReturns the current hook mask.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getinfo\"><code>lua_getinfo</code></a></h3><p>\r\n<span class=\"apii\">[-(0|1), +(0|1|2), <em>m</em>]</span>\r\n<pre>int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);</pre>\r\n\r\n<p>\r\nReturns information about a specific function or function invocation.\r\n\r\n\r\n<p>\r\nTo get information about a function invocation,\r\nthe parameter <code>ar</code> must be a valid activation record that was\r\nfilled by a previous call to <a href=\"#lua_getstack\"><code>lua_getstack</code></a> or\r\ngiven as argument to a hook (see <a href=\"#lua_Hook\"><code>lua_Hook</code></a>).\r\n\r\n\r\n<p>\r\nTo get information about a function you push it onto the stack\r\nand start the <code>what</code> string with the character '<code>&gt;</code>'.\r\n(In that case,\r\n<code>lua_getinfo</code> pops the function in the top of the stack.)\r\nFor instance, to know in which line a function <code>f</code> was defined,\r\nyou can write the following code:\r\n\r\n<pre>\r\n     lua_Debug ar;\r\n     lua_getfield(L, LUA_GLOBALSINDEX, \"f\");  /* get global 'f' */\r\n     lua_getinfo(L, \"&gt;S\", &amp;ar);\r\n     printf(\"%d\\n\", ar.linedefined);\r\n</pre>\r\n\r\n<p>\r\nEach character in the string <code>what</code>\r\nselects some fields of the structure <code>ar</code> to be filled or\r\na value to be pushed on the stack:\r\n\r\n<ul>\r\n\r\n<li><b>'<code>n</code>':</b> fills in the field <code>name</code> and <code>namewhat</code>;\r\n</li>\r\n\r\n<li><b>'<code>S</code>':</b>\r\nfills in the fields <code>source</code>, <code>short_src</code>,\r\n<code>linedefined</code>, <code>lastlinedefined</code>, and <code>what</code>;\r\n</li>\r\n\r\n<li><b>'<code>l</code>':</b> fills in the field <code>currentline</code>;\r\n</li>\r\n\r\n<li><b>'<code>u</code>':</b> fills in the field <code>nups</code>;\r\n</li>\r\n\r\n<li><b>'<code>f</code>':</b>\r\npushes onto the stack the function that is\r\nrunning at the given level;\r\n</li>\r\n\r\n<li><b>'<code>L</code>':</b>\r\npushes onto the stack a table whose indices are the\r\nnumbers of the lines that are valid on the function.\r\n(A <em>valid line</em> is a line with some associated code,\r\nthat is, a line where you can put a break point.\r\nNon-valid lines include empty lines and comments.)\r\n</li>\r\n\r\n</ul>\r\n\r\n<p>\r\nThis function returns 0 on error\r\n(for instance, an invalid option in <code>what</code>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getlocal\"><code>lua_getlocal</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>-</em>]</span>\r\n<pre>const char *lua_getlocal (lua_State *L, lua_Debug *ar, int n);</pre>\r\n\r\n<p>\r\nGets information about a local variable of a given activation record.\r\nThe parameter <code>ar</code> must be a valid activation record that was\r\nfilled by a previous call to <a href=\"#lua_getstack\"><code>lua_getstack</code></a> or\r\ngiven as argument to a hook (see <a href=\"#lua_Hook\"><code>lua_Hook</code></a>).\r\nThe index <code>n</code> selects which local variable to inspect\r\n(1 is the first parameter or active local variable, and so on,\r\nuntil the last active local variable).\r\n<a href=\"#lua_getlocal\"><code>lua_getlocal</code></a> pushes the variable's value onto the stack\r\nand returns its name.\r\n\r\n\r\n<p>\r\nVariable names starting with '<code>(</code>' (open parentheses)\r\nrepresent internal variables\r\n(loop control variables, temporaries, and C&nbsp;function locals).\r\n\r\n\r\n<p>\r\nReturns <code>NULL</code> (and pushes nothing)\r\nwhen the index is greater than\r\nthe number of active local variables.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getstack\"><code>lua_getstack</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_getstack (lua_State *L, int level, lua_Debug *ar);</pre>\r\n\r\n<p>\r\nGet information about the interpreter runtime stack.\r\n\r\n\r\n<p>\r\nThis function fills parts of a <a href=\"#lua_Debug\"><code>lua_Debug</code></a> structure with\r\nan identification of the <em>activation record</em>\r\nof the function executing at a given level.\r\nLevel&nbsp;0 is the current running function,\r\nwhereas level <em>n+1</em> is the function that has called level <em>n</em>.\r\nWhen there are no errors, <a href=\"#lua_getstack\"><code>lua_getstack</code></a> returns 1;\r\nwhen called with a level greater than the stack depth,\r\nit returns 0.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_getupvalue\"><code>lua_getupvalue</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>-</em>]</span>\r\n<pre>const char *lua_getupvalue (lua_State *L, int funcindex, int n);</pre>\r\n\r\n<p>\r\nGets information about a closure's upvalue.\r\n(For Lua functions,\r\nupvalues are the external local variables that the function uses,\r\nand that are consequently included in its closure.)\r\n<a href=\"#lua_getupvalue\"><code>lua_getupvalue</code></a> gets the index <code>n</code> of an upvalue,\r\npushes the upvalue's value onto the stack,\r\nand returns its name.\r\n<code>funcindex</code> points to the closure in the stack.\r\n(Upvalues have no particular order,\r\nas they are active through the whole function.\r\nSo, they are numbered in an arbitrary order.)\r\n\r\n\r\n<p>\r\nReturns <code>NULL</code> (and pushes nothing)\r\nwhen the index is greater than the number of upvalues.\r\nFor C&nbsp;functions, this function uses the empty string <code>\"\"</code>\r\nas a name for all upvalues.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_Hook\"><code>lua_Hook</code></a></h3>\r\n<pre>typedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);</pre>\r\n\r\n<p>\r\nType for debugging hook functions.\r\n\r\n\r\n<p>\r\nWhenever a hook is called, its <code>ar</code> argument has its field\r\n<code>event</code> set to the specific event that triggered the hook.\r\nLua identifies these events with the following constants:\r\n<a name=\"pdf-LUA_HOOKCALL\"><code>LUA_HOOKCALL</code></a>, <a name=\"pdf-LUA_HOOKRET\"><code>LUA_HOOKRET</code></a>,\r\n<a name=\"pdf-LUA_HOOKTAILRET\"><code>LUA_HOOKTAILRET</code></a>, <a name=\"pdf-LUA_HOOKLINE\"><code>LUA_HOOKLINE</code></a>,\r\nand <a name=\"pdf-LUA_HOOKCOUNT\"><code>LUA_HOOKCOUNT</code></a>.\r\nMoreover, for line events, the field <code>currentline</code> is also set.\r\nTo get the value of any other field in <code>ar</code>,\r\nthe hook must call <a href=\"#lua_getinfo\"><code>lua_getinfo</code></a>.\r\nFor return events, <code>event</code> can be <code>LUA_HOOKRET</code>,\r\nthe normal value, or <code>LUA_HOOKTAILRET</code>.\r\nIn the latter case, Lua is simulating a return from\r\na function that did a tail call;\r\nin this case, it is useless to call <a href=\"#lua_getinfo\"><code>lua_getinfo</code></a>.\r\n\r\n\r\n<p>\r\nWhile Lua is running a hook, it disables other calls to hooks.\r\nTherefore, if a hook calls back Lua to execute a function or a chunk,\r\nthis execution occurs without any calls to hooks.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_sethook\"><code>lua_sethook</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>int lua_sethook (lua_State *L, lua_Hook f, int mask, int count);</pre>\r\n\r\n<p>\r\nSets the debugging hook function.\r\n\r\n\r\n<p>\r\nArgument <code>f</code> is the hook function.\r\n<code>mask</code> specifies on which events the hook will be called:\r\nit is formed by a bitwise or of the constants\r\n<a name=\"pdf-LUA_MASKCALL\"><code>LUA_MASKCALL</code></a>,\r\n<a name=\"pdf-LUA_MASKRET\"><code>LUA_MASKRET</code></a>,\r\n<a name=\"pdf-LUA_MASKLINE\"><code>LUA_MASKLINE</code></a>,\r\nand <a name=\"pdf-LUA_MASKCOUNT\"><code>LUA_MASKCOUNT</code></a>.\r\nThe <code>count</code> argument is only meaningful when the mask\r\nincludes <code>LUA_MASKCOUNT</code>.\r\nFor each event, the hook is called as explained below:\r\n\r\n<ul>\r\n\r\n<li><b>The call hook:</b> is called when the interpreter calls a function.\r\nThe hook is called just after Lua enters the new function,\r\nbefore the function gets its arguments.\r\n</li>\r\n\r\n<li><b>The return hook:</b> is called when the interpreter returns from a function.\r\nThe hook is called just before Lua leaves the function.\r\nYou have no access to the values to be returned by the function.\r\n</li>\r\n\r\n<li><b>The line hook:</b> is called when the interpreter is about to\r\nstart the execution of a new line of code,\r\nor when it jumps back in the code (even to the same line).\r\n(This event only happens while Lua is executing a Lua function.)\r\n</li>\r\n\r\n<li><b>The count hook:</b> is called after the interpreter executes every\r\n<code>count</code> instructions.\r\n(This event only happens while Lua is executing a Lua function.)\r\n</li>\r\n\r\n</ul>\r\n\r\n<p>\r\nA hook is disabled by setting <code>mask</code> to zero.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setlocal\"><code>lua_setlocal</code></a></h3><p>\r\n<span class=\"apii\">[-(0|1), +0, <em>-</em>]</span>\r\n<pre>const char *lua_setlocal (lua_State *L, lua_Debug *ar, int n);</pre>\r\n\r\n<p>\r\nSets the value of a local variable of a given activation record.\r\nParameters <code>ar</code> and <code>n</code> are as in <a href=\"#lua_getlocal\"><code>lua_getlocal</code></a>\r\n(see <a href=\"#lua_getlocal\"><code>lua_getlocal</code></a>).\r\n<a href=\"#lua_setlocal\"><code>lua_setlocal</code></a> assigns the value at the top of the stack\r\nto the variable and returns its name.\r\nIt also pops the value from the stack.\r\n\r\n\r\n<p>\r\nReturns <code>NULL</code> (and pops nothing)\r\nwhen the index is greater than\r\nthe number of active local variables.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"lua_setupvalue\"><code>lua_setupvalue</code></a></h3><p>\r\n<span class=\"apii\">[-(0|1), +0, <em>-</em>]</span>\r\n<pre>const char *lua_setupvalue (lua_State *L, int funcindex, int n);</pre>\r\n\r\n<p>\r\nSets the value of a closure's upvalue.\r\nIt assigns the value at the top of the stack\r\nto the upvalue and returns its name.\r\nIt also pops the value from the stack.\r\nParameters <code>funcindex</code> and <code>n</code> are as in the <a href=\"#lua_getupvalue\"><code>lua_getupvalue</code></a>\r\n(see <a href=\"#lua_getupvalue\"><code>lua_getupvalue</code></a>).\r\n\r\n\r\n<p>\r\nReturns <code>NULL</code> (and pops nothing)\r\nwhen the index is greater than the number of upvalues.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h1>4 - <a name=\"4\">The Auxiliary Library</a></h1>\r\n\r\n<p>\r\n\r\nThe <em>auxiliary library</em> provides several convenient functions\r\nto interface C with Lua.\r\nWhile the basic API provides the primitive functions for all \r\ninteractions between C and Lua,\r\nthe auxiliary library provides higher-level functions for some\r\ncommon tasks.\r\n\r\n\r\n<p>\r\nAll functions from the auxiliary library\r\nare defined in header file <code>lauxlib.h</code> and\r\nhave a prefix <code>luaL_</code>.\r\n\r\n\r\n<p>\r\nAll functions in the auxiliary library are built on\r\ntop of the basic API,\r\nand so they provide nothing that cannot be done with this API.\r\n\r\n\r\n<p>\r\nSeveral functions in the auxiliary library are used to\r\ncheck C&nbsp;function arguments.\r\nTheir names are always <code>luaL_check*</code> or <code>luaL_opt*</code>.\r\nAll of these functions throw an error if the check is not satisfied.\r\nBecause the error message is formatted for arguments\r\n(e.g., \"<code>bad argument #1</code>\"),\r\nyou should not use these functions for other stack values.\r\n\r\n\r\n\r\n<h2>4.1 - <a name=\"4.1\">Functions and Types</a></h2>\r\n\r\n<p>\r\nHere we list all functions and types from the auxiliary library\r\nin alphabetical order.\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_addchar\"><code>luaL_addchar</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>void luaL_addchar (luaL_Buffer *B, char c);</pre>\r\n\r\n<p>\r\nAdds the character <code>c</code> to the buffer <code>B</code>\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_addlstring\"><code>luaL_addlstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l);</pre>\r\n\r\n<p>\r\nAdds the string pointed to by <code>s</code> with length <code>l</code> to\r\nthe buffer <code>B</code>\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\nThe string may contain embedded zeros.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_addsize\"><code>luaL_addsize</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>void luaL_addsize (luaL_Buffer *B, size_t n);</pre>\r\n\r\n<p>\r\nAdds to the buffer <code>B</code> (see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>)\r\na string of length <code>n</code> previously copied to the\r\nbuffer area (see <a href=\"#luaL_prepbuffer\"><code>luaL_prepbuffer</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_addstring\"><code>luaL_addstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>void luaL_addstring (luaL_Buffer *B, const char *s);</pre>\r\n\r\n<p>\r\nAdds the zero-terminated string pointed to by <code>s</code>\r\nto the buffer <code>B</code>\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\nThe string may not contain embedded zeros.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_addvalue\"><code>luaL_addvalue</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>m</em>]</span>\r\n<pre>void luaL_addvalue (luaL_Buffer *B);</pre>\r\n\r\n<p>\r\nAdds the value at the top of the stack\r\nto the buffer <code>B</code>\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\nPops the value.\r\n\r\n\r\n<p>\r\nThis is the only function on string buffers that can (and must)\r\nbe called with an extra element on the stack,\r\nwhich is the value to be added to the buffer.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_argcheck\"><code>luaL_argcheck</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>void luaL_argcheck (lua_State *L,\r\n                    int cond,\r\n                    int narg,\r\n                    const char *extramsg);</pre>\r\n\r\n<p>\r\nChecks whether <code>cond</code> is true.\r\nIf not, raises an error with the following message,\r\nwhere <code>func</code> is retrieved from the call stack:\r\n\r\n<pre>\r\n     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)\r\n</pre>\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_argerror\"><code>luaL_argerror</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_argerror (lua_State *L, int narg, const char *extramsg);</pre>\r\n\r\n<p>\r\nRaises an error with the following message,\r\nwhere <code>func</code> is retrieved from the call stack:\r\n\r\n<pre>\r\n     bad argument #&lt;narg&gt; to &lt;func&gt; (&lt;extramsg&gt;)\r\n</pre>\r\n\r\n<p>\r\nThis function never returns,\r\nbut it is an idiom to use it in C&nbsp;functions\r\nas <code>return luaL_argerror(<em>args</em>)</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_Buffer\"><code>luaL_Buffer</code></a></h3>\r\n<pre>typedef struct luaL_Buffer luaL_Buffer;</pre>\r\n\r\n<p>\r\nType for a <em>string buffer</em>.\r\n\r\n\r\n<p>\r\nA string buffer allows C&nbsp;code to build Lua strings piecemeal.\r\nIts pattern of use is as follows:\r\n\r\n<ul>\r\n\r\n<li>First you declare a variable <code>b</code> of type <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>.</li>\r\n\r\n<li>Then you initialize it with a call <code>luaL_buffinit(L, &amp;b)</code>.</li>\r\n\r\n<li>\r\nThen you add string pieces to the buffer calling any of\r\nthe <code>luaL_add*</code> functions.\r\n</li>\r\n\r\n<li>\r\nYou finish by calling <code>luaL_pushresult(&amp;b)</code>.\r\nThis call leaves the final string on the top of the stack.\r\n</li>\r\n\r\n</ul>\r\n\r\n<p>\r\nDuring its normal operation,\r\na string buffer uses a variable number of stack slots.\r\nSo, while using a buffer, you cannot assume that you know where\r\nthe top of the stack is.\r\nYou can use the stack between successive calls to buffer operations\r\nas long as that use is balanced;\r\nthat is,\r\nwhen you call a buffer operation,\r\nthe stack is at the same level\r\nit was immediately after the previous buffer operation.\r\n(The only exception to this rule is <a href=\"#luaL_addvalue\"><code>luaL_addvalue</code></a>.)\r\nAfter calling <a href=\"#luaL_pushresult\"><code>luaL_pushresult</code></a> the stack is back to its\r\nlevel when the buffer was initialized,\r\nplus the final string on its top.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_buffinit\"><code>luaL_buffinit</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>void luaL_buffinit (lua_State *L, luaL_Buffer *B);</pre>\r\n\r\n<p>\r\nInitializes a buffer <code>B</code>.\r\nThis function does not allocate any space;\r\nthe buffer must be declared as a variable\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_callmeta\"><code>luaL_callmeta</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>e</em>]</span>\r\n<pre>int luaL_callmeta (lua_State *L, int obj, const char *e);</pre>\r\n\r\n<p>\r\nCalls a metamethod.\r\n\r\n\r\n<p>\r\nIf the object at index <code>obj</code> has a metatable and this\r\nmetatable has a field <code>e</code>,\r\nthis function calls this field and passes the object as its only argument.\r\nIn this case this function returns 1 and pushes onto the\r\nstack the value returned by the call.\r\nIf there is no metatable or no metamethod,\r\nthis function returns 0 (without pushing any value on the stack).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkany\"><code>luaL_checkany</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>void luaL_checkany (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function has an argument\r\nof any type (including <b>nil</b>) at position <code>narg</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkint\"><code>luaL_checkint</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_checkint (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a number\r\nand returns this number cast to an <code>int</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkinteger\"><code>luaL_checkinteger</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>lua_Integer luaL_checkinteger (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a number\r\nand returns this number cast to a <a href=\"#lua_Integer\"><code>lua_Integer</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checklong\"><code>luaL_checklong</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>long luaL_checklong (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a number\r\nand returns this number cast to a <code>long</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checklstring\"><code>luaL_checklstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>const char *luaL_checklstring (lua_State *L, int narg, size_t *l);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a string\r\nand returns this string;\r\nif <code>l</code> is not <code>NULL</code> fills <code>*l</code>\r\nwith the string's length.\r\n\r\n\r\n<p>\r\nThis function uses <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> to get its result,\r\nso all conversions and caveats of that function apply here.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checknumber\"><code>luaL_checknumber</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>lua_Number luaL_checknumber (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a number\r\nand returns this number.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkoption\"><code>luaL_checkoption</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_checkoption (lua_State *L,\r\n                      int narg,\r\n                      const char *def,\r\n                      const char *const lst[]);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a string and\r\nsearches for this string in the array <code>lst</code>\r\n(which must be NULL-terminated).\r\nReturns the index in the array where the string was found.\r\nRaises an error if the argument is not a string or\r\nif the string cannot be found.\r\n\r\n\r\n<p>\r\nIf <code>def</code> is not <code>NULL</code>,\r\nthe function uses <code>def</code> as a default value when\r\nthere is no argument <code>narg</code> or if this argument is <b>nil</b>.\r\n\r\n\r\n<p>\r\nThis is a useful function for mapping strings to C&nbsp;enums.\r\n(The usual convention in Lua libraries is\r\nto use strings instead of numbers to select options.)\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkstack\"><code>luaL_checkstack</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>void luaL_checkstack (lua_State *L, int sz, const char *msg);</pre>\r\n\r\n<p>\r\nGrows the stack size to <code>top + sz</code> elements,\r\nraising an error if the stack cannot grow to that size.\r\n<code>msg</code> is an additional text to go into the error message.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkstring\"><code>luaL_checkstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>const char *luaL_checkstring (lua_State *L, int narg);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a string\r\nand returns this string.\r\n\r\n\r\n<p>\r\nThis function uses <a href=\"#lua_tolstring\"><code>lua_tolstring</code></a> to get its result,\r\nso all conversions and caveats of that function apply here.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checktype\"><code>luaL_checktype</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>void luaL_checktype (lua_State *L, int narg, int t);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> has type <code>t</code>.\r\nSee <a href=\"#lua_type\"><code>lua_type</code></a> for the encoding of types for <code>t</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_checkudata\"><code>luaL_checkudata</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>void *luaL_checkudata (lua_State *L, int narg, const char *tname);</pre>\r\n\r\n<p>\r\nChecks whether the function argument <code>narg</code> is a userdata\r\nof the type <code>tname</code> (see <a href=\"#luaL_newmetatable\"><code>luaL_newmetatable</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_dofile\"><code>luaL_dofile</code></a></h3><p>\r\n<span class=\"apii\">[-0, +?, <em>m</em>]</span>\r\n<pre>int luaL_dofile (lua_State *L, const char *filename);</pre>\r\n\r\n<p>\r\nLoads and runs the given file.\r\nIt is defined as the following macro:\r\n\r\n<pre>\r\n     (luaL_loadfile(L, filename) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n</pre><p>\r\nIt returns 0 if there are no errors\r\nor 1 in case of errors.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_dostring\"><code>luaL_dostring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +?, <em>m</em>]</span>\r\n<pre>int luaL_dostring (lua_State *L, const char *str);</pre>\r\n\r\n<p>\r\nLoads and runs the given string.\r\nIt is defined as the following macro:\r\n\r\n<pre>\r\n     (luaL_loadstring(L, str) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n</pre><p>\r\nIt returns 0 if there are no errors\r\nor 1 in case of errors.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_error\"><code>luaL_error</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_error (lua_State *L, const char *fmt, ...);</pre>\r\n\r\n<p>\r\nRaises an error.\r\nThe error message format is given by <code>fmt</code>\r\nplus any extra arguments,\r\nfollowing the same rules of <a href=\"#lua_pushfstring\"><code>lua_pushfstring</code></a>.\r\nIt also adds at the beginning of the message the file name and\r\nthe line number where the error occurred,\r\nif this information is available.\r\n\r\n\r\n<p>\r\nThis function never returns,\r\nbut it is an idiom to use it in C&nbsp;functions\r\nas <code>return luaL_error(<em>args</em>)</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_getmetafield\"><code>luaL_getmetafield</code></a></h3><p>\r\n<span class=\"apii\">[-0, +(0|1), <em>m</em>]</span>\r\n<pre>int luaL_getmetafield (lua_State *L, int obj, const char *e);</pre>\r\n\r\n<p>\r\nPushes onto the stack the field <code>e</code> from the metatable\r\nof the object at index <code>obj</code>.\r\nIf the object does not have a metatable,\r\nor if the metatable does not have this field,\r\nreturns 0 and pushes nothing.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_getmetatable\"><code>luaL_getmetatable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>-</em>]</span>\r\n<pre>void luaL_getmetatable (lua_State *L, const char *tname);</pre>\r\n\r\n<p>\r\nPushes onto the stack the metatable associated with name <code>tname</code>\r\nin the registry (see <a href=\"#luaL_newmetatable\"><code>luaL_newmetatable</code></a>).\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_gsub\"><code>luaL_gsub</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>const char *luaL_gsub (lua_State *L,\r\n                       const char *s,\r\n                       const char *p,\r\n                       const char *r);</pre>\r\n\r\n<p>\r\nCreates a copy of string <code>s</code> by replacing\r\nany occurrence of the string <code>p</code>\r\nwith the string <code>r</code>.\r\nPushes the resulting string on the stack and returns it.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_loadbuffer\"><code>luaL_loadbuffer</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>int luaL_loadbuffer (lua_State *L,\r\n                     const char *buff,\r\n                     size_t sz,\r\n                     const char *name);</pre>\r\n\r\n<p>\r\nLoads a buffer as a Lua chunk.\r\nThis function uses <a href=\"#lua_load\"><code>lua_load</code></a> to load the chunk in the\r\nbuffer pointed to by <code>buff</code> with size <code>sz</code>.\r\n\r\n\r\n<p>\r\nThis function returns the same results as <a href=\"#lua_load\"><code>lua_load</code></a>.\r\n<code>name</code> is the chunk name,\r\nused for debug information and error messages.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_loadfile\"><code>luaL_loadfile</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>int luaL_loadfile (lua_State *L, const char *filename);</pre>\r\n\r\n<p>\r\nLoads a file as a Lua chunk.\r\nThis function uses <a href=\"#lua_load\"><code>lua_load</code></a> to load the chunk in the file\r\nnamed <code>filename</code>.\r\nIf <code>filename</code> is <code>NULL</code>,\r\nthen it loads from the standard input.\r\nThe first line in the file is ignored if it starts with a <code>#</code>.\r\n\r\n\r\n<p>\r\nThis function returns the same results as <a href=\"#lua_load\"><code>lua_load</code></a>,\r\nbut it has an extra error code <a name=\"pdf-LUA_ERRFILE\"><code>LUA_ERRFILE</code></a>\r\nif it cannot open/read the file.\r\n\r\n\r\n<p>\r\nAs <a href=\"#lua_load\"><code>lua_load</code></a>, this function only loads the chunk;\r\nit does not run it.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_loadstring\"><code>luaL_loadstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>int luaL_loadstring (lua_State *L, const char *s);</pre>\r\n\r\n<p>\r\nLoads a string as a Lua chunk.\r\nThis function uses <a href=\"#lua_load\"><code>lua_load</code></a> to load the chunk in\r\nthe zero-terminated string <code>s</code>.\r\n\r\n\r\n<p>\r\nThis function returns the same results as <a href=\"#lua_load\"><code>lua_load</code></a>.\r\n\r\n\r\n<p>\r\nAlso as <a href=\"#lua_load\"><code>lua_load</code></a>, this function only loads the chunk;\r\nit does not run it.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_newmetatable\"><code>luaL_newmetatable</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>int luaL_newmetatable (lua_State *L, const char *tname);</pre>\r\n\r\n<p>\r\nIf the registry already has the key <code>tname</code>,\r\nreturns 0.\r\nOtherwise,\r\ncreates a new table to be used as a metatable for userdata,\r\nadds it to the registry with key <code>tname</code>,\r\nand returns 1.\r\n\r\n\r\n<p>\r\nIn both cases pushes onto the stack the final value associated\r\nwith <code>tname</code> in the registry.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_newstate\"><code>luaL_newstate</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>lua_State *luaL_newstate (void);</pre>\r\n\r\n<p>\r\nCreates a new Lua state.\r\nIt calls <a href=\"#lua_newstate\"><code>lua_newstate</code></a> with an\r\nallocator based on the standard&nbsp;C <code>realloc</code> function\r\nand then sets a panic function (see <a href=\"#lua_atpanic\"><code>lua_atpanic</code></a>) that prints\r\nan error message to the standard error output in case of fatal\r\nerrors.\r\n\r\n\r\n<p>\r\nReturns the new state,\r\nor <code>NULL</code> if there is a memory allocation error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_openlibs\"><code>luaL_openlibs</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>m</em>]</span>\r\n<pre>void luaL_openlibs (lua_State *L);</pre>\r\n\r\n<p>\r\nOpens all standard Lua libraries into the given state.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optint\"><code>luaL_optint</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_optint (lua_State *L, int narg, int d);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a number,\r\nreturns this number cast to an <code>int</code>.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optinteger\"><code>luaL_optinteger</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>lua_Integer luaL_optinteger (lua_State *L,\r\n                             int narg,\r\n                             lua_Integer d);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a number,\r\nreturns this number cast to a <a href=\"#lua_Integer\"><code>lua_Integer</code></a>.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optlong\"><code>luaL_optlong</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>long luaL_optlong (lua_State *L, int narg, long d);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a number,\r\nreturns this number cast to a <code>long</code>.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optlstring\"><code>luaL_optlstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>const char *luaL_optlstring (lua_State *L,\r\n                             int narg,\r\n                             const char *d,\r\n                             size_t *l);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a string,\r\nreturns this string.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n<p>\r\nIf <code>l</code> is not <code>NULL</code>,\r\nfills the position <code>*l</code> with the results's length.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optnumber\"><code>luaL_optnumber</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number d);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a number,\r\nreturns this number.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_optstring\"><code>luaL_optstring</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>const char *luaL_optstring (lua_State *L,\r\n                            int narg,\r\n                            const char *d);</pre>\r\n\r\n<p>\r\nIf the function argument <code>narg</code> is a string,\r\nreturns this string.\r\nIf this argument is absent or is <b>nil</b>,\r\nreturns <code>d</code>.\r\nOtherwise, raises an error.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_prepbuffer\"><code>luaL_prepbuffer</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>char *luaL_prepbuffer (luaL_Buffer *B);</pre>\r\n\r\n<p>\r\nReturns an address to a space of size <a name=\"pdf-LUAL_BUFFERSIZE\"><code>LUAL_BUFFERSIZE</code></a>\r\nwhere you can copy a string to be added to buffer <code>B</code>\r\n(see <a href=\"#luaL_Buffer\"><code>luaL_Buffer</code></a>).\r\nAfter copying the string into this space you must call\r\n<a href=\"#luaL_addsize\"><code>luaL_addsize</code></a> with the size of the string to actually add \r\nit to the buffer.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_pushresult\"><code>luaL_pushresult</code></a></h3><p>\r\n<span class=\"apii\">[-?, +1, <em>m</em>]</span>\r\n<pre>void luaL_pushresult (luaL_Buffer *B);</pre>\r\n\r\n<p>\r\nFinishes the use of buffer <code>B</code> leaving the final string on\r\nthe top of the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_ref\"><code>luaL_ref</code></a></h3><p>\r\n<span class=\"apii\">[-1, +0, <em>m</em>]</span>\r\n<pre>int luaL_ref (lua_State *L, int t);</pre>\r\n\r\n<p>\r\nCreates and returns a <em>reference</em>,\r\nin the table at index <code>t</code>,\r\nfor the object at the top of the stack (and pops the object).\r\n\r\n\r\n<p>\r\nA reference is a unique integer key.\r\nAs long as you do not manually add integer keys into table <code>t</code>,\r\n<a href=\"#luaL_ref\"><code>luaL_ref</code></a> ensures the uniqueness of the key it returns.\r\nYou can retrieve an object referred by reference <code>r</code>\r\nby calling <code>lua_rawgeti(L, t, r)</code>.\r\nFunction <a href=\"#luaL_unref\"><code>luaL_unref</code></a> frees a reference and its associated object.\r\n\r\n\r\n<p>\r\nIf the object at the top of the stack is <b>nil</b>,\r\n<a href=\"#luaL_ref\"><code>luaL_ref</code></a> returns the constant <a name=\"pdf-LUA_REFNIL\"><code>LUA_REFNIL</code></a>.\r\nThe constant <a name=\"pdf-LUA_NOREF\"><code>LUA_NOREF</code></a> is guaranteed to be different\r\nfrom any reference returned by <a href=\"#luaL_ref\"><code>luaL_ref</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_Reg\"><code>luaL_Reg</code></a></h3>\r\n<pre>typedef struct luaL_Reg {\r\n  const char *name;\r\n  lua_CFunction func;\r\n} luaL_Reg;</pre>\r\n\r\n<p>\r\nType for arrays of functions to be registered by\r\n<a href=\"#luaL_register\"><code>luaL_register</code></a>.\r\n<code>name</code> is the function name and <code>func</code> is a pointer to\r\nthe function.\r\nAny array of <a href=\"#luaL_Reg\"><code>luaL_Reg</code></a> must end with an sentinel entry\r\nin which both <code>name</code> and <code>func</code> are <code>NULL</code>.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_register\"><code>luaL_register</code></a></h3><p>\r\n<span class=\"apii\">[-(0|1), +1, <em>m</em>]</span>\r\n<pre>void luaL_register (lua_State *L,\r\n                    const char *libname,\r\n                    const luaL_Reg *l);</pre>\r\n\r\n<p>\r\nOpens a library.\r\n\r\n\r\n<p>\r\nWhen called with <code>libname</code> equal to <code>NULL</code>,\r\nit simply registers all functions in the list <code>l</code>\r\n(see <a href=\"#luaL_Reg\"><code>luaL_Reg</code></a>) into the table on the top of the stack.\r\n\r\n\r\n<p>\r\nWhen called with a non-null <code>libname</code>,\r\n<code>luaL_register</code> creates a new table <code>t</code>,\r\nsets it as the value of the global variable <code>libname</code>,\r\nsets it as the value of <code>package.loaded[libname]</code>,\r\nand registers on it all functions in the list <code>l</code>.\r\nIf there is a table in <code>package.loaded[libname]</code> or in\r\nvariable <code>libname</code>,\r\nreuses this table instead of creating a new one.\r\n\r\n\r\n<p>\r\nIn any case the function leaves the table\r\non the top of the stack.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_typename\"><code>luaL_typename</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>const char *luaL_typename (lua_State *L, int index);</pre>\r\n\r\n<p>\r\nReturns the name of the type of the value at the given index.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_typerror\"><code>luaL_typerror</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>v</em>]</span>\r\n<pre>int luaL_typerror (lua_State *L, int narg, const char *tname);</pre>\r\n\r\n<p>\r\nGenerates an error with a message like the following:\r\n\r\n<pre>\r\n     <em>location</em>: bad argument <em>narg</em> to '<em>func</em>' (<em>tname</em> expected, got <em>rt</em>)\r\n</pre><p>\r\nwhere <code><em>location</em></code> is produced by <a href=\"#luaL_where\"><code>luaL_where</code></a>,\r\n<code><em>func</em></code> is the name of the current function,\r\nand <code><em>rt</em></code> is the type name of the actual argument.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_unref\"><code>luaL_unref</code></a></h3><p>\r\n<span class=\"apii\">[-0, +0, <em>-</em>]</span>\r\n<pre>void luaL_unref (lua_State *L, int t, int ref);</pre>\r\n\r\n<p>\r\nReleases reference <code>ref</code> from the table at index <code>t</code>\r\n(see <a href=\"#luaL_ref\"><code>luaL_ref</code></a>).\r\nThe entry is removed from the table,\r\nso that the referred object can be collected.\r\nThe reference <code>ref</code> is also freed to be used again.\r\n\r\n\r\n<p>\r\nIf <code>ref</code> is <a href=\"#pdf-LUA_NOREF\"><code>LUA_NOREF</code></a> or <a href=\"#pdf-LUA_REFNIL\"><code>LUA_REFNIL</code></a>,\r\n<a href=\"#luaL_unref\"><code>luaL_unref</code></a> does nothing.\r\n\r\n\r\n\r\n\r\n\r\n<hr><h3><a name=\"luaL_where\"><code>luaL_where</code></a></h3><p>\r\n<span class=\"apii\">[-0, +1, <em>m</em>]</span>\r\n<pre>void luaL_where (lua_State *L, int lvl);</pre>\r\n\r\n<p>\r\nPushes onto the stack a string identifying the current position\r\nof the control at level <code>lvl</code> in the call stack.\r\nTypically this string has the following format:\r\n\r\n<pre>\r\n     <em>chunkname</em>:<em>currentline</em>:\r\n</pre><p>\r\nLevel&nbsp;0 is the running function,\r\nlevel&nbsp;1 is the function that called the running function,\r\netc.\r\n\r\n\r\n<p>\r\nThis function is used to build a prefix for error messages.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h1>5 - <a name=\"5\">Standard Libraries</a></h1>\r\n\r\n<p>\r\nThe standard Lua libraries provide useful functions\r\nthat are implemented directly through the C&nbsp;API.\r\nSome of these functions provide essential services to the language\r\n(e.g., <a href=\"#pdf-type\"><code>type</code></a> and <a href=\"#pdf-getmetatable\"><code>getmetatable</code></a>);\r\nothers provide access to \"outside\" services (e.g., I/O);\r\nand others could be implemented in Lua itself,\r\nbut are quite useful or have critical performance requirements that\r\ndeserve an implementation in C (e.g., <a href=\"#pdf-table.sort\"><code>table.sort</code></a>).\r\n\r\n\r\n<p>\r\nAll libraries are implemented through the official C&nbsp;API\r\nand are provided as separate C&nbsp;modules.\r\nCurrently, Lua has the following standard libraries:\r\n\r\n<ul>\r\n\r\n<li>basic library, which includes the coroutine sub-library;</li>\r\n\r\n<li>package library;</li>\r\n\r\n<li>string manipulation;</li>\r\n\r\n<li>table manipulation;</li>\r\n\r\n<li>mathematical functions (sin, log, etc.);</li>\r\n\r\n<li>input and output;</li>\r\n\r\n<li>operating system facilities;</li>\r\n\r\n<li>debug facilities.</li>\r\n\r\n</ul><p>\r\nExcept for the basic and package libraries,\r\neach library provides all its functions as fields of a global table\r\nor as methods of its objects.\r\n\r\n\r\n<p>\r\nTo have access to these libraries,\r\nthe C&nbsp;host program should call the <a href=\"#luaL_openlibs\"><code>luaL_openlibs</code></a> function,\r\nwhich opens all standard libraries.\r\nAlternatively,\r\nit can open them individually by calling\r\n<a name=\"pdf-luaopen_base\"><code>luaopen_base</code></a> (for the basic library),\r\n<a name=\"pdf-luaopen_package\"><code>luaopen_package</code></a> (for the package library),\r\n<a name=\"pdf-luaopen_string\"><code>luaopen_string</code></a> (for the string library),\r\n<a name=\"pdf-luaopen_table\"><code>luaopen_table</code></a> (for the table library),\r\n<a name=\"pdf-luaopen_math\"><code>luaopen_math</code></a> (for the mathematical library),\r\n<a name=\"pdf-luaopen_io\"><code>luaopen_io</code></a> (for the I/O library),\r\n<a name=\"pdf-luaopen_os\"><code>luaopen_os</code></a> (for the Operating System library),\r\nand <a name=\"pdf-luaopen_debug\"><code>luaopen_debug</code></a> (for the debug library).\r\nThese functions are declared in <a name=\"pdf-lualib.h\"><code>lualib.h</code></a>\r\nand should not be called directly:\r\nyou must call them like any other Lua C&nbsp;function,\r\ne.g., by using <a href=\"#lua_call\"><code>lua_call</code></a>.\r\n\r\n\r\n\r\n<h2>5.1 - <a name=\"5.1\">Basic Functions</a></h2>\r\n\r\n<p>\r\nThe basic library provides some core functions to Lua.\r\nIf you do not include this library in your application,\r\nyou should check carefully whether you need to provide \r\nimplementations for some of its facilities.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-assert\"><code>assert (v [, message])</code></a></h3>\r\nIssues an  error when\r\nthe value of its argument <code>v</code> is false (i.e., <b>nil</b> or <b>false</b>);\r\notherwise, returns all its arguments.\r\n<code>message</code> is an error message;\r\nwhen absent, it defaults to \"assertion failed!\"\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-collectgarbage\"><code>collectgarbage ([opt [, arg]])</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function is a generic interface to the garbage collector.\r\nIt performs different functions according to its first argument, <code>opt</code>:\r\n\r\n<ul>\r\n\r\n<li><b>\"collect\":</b>\r\nperforms a full garbage-collection cycle.\r\nThis is the default option.\r\n</li>\r\n\r\n<li><b>\"stop\":</b>\r\nstops the garbage collector.\r\n</li>\r\n\r\n<li><b>\"restart\":</b>\r\nrestarts the garbage collector.\r\n</li>\r\n\r\n<li><b>\"count\":</b>\r\nreturns the total memory in use by Lua (in Kbytes).\r\n</li>\r\n\r\n<li><b>\"step\":</b>\r\nperforms a garbage-collection step.\r\nThe step \"size\" is controlled by <code>arg</code>\r\n(larger values mean more steps) in a non-specified way.\r\nIf you want to control the step size\r\nyou must experimentally tune the value of <code>arg</code>.\r\nReturns <b>true</b> if the step finished a collection cycle.\r\n</li>\r\n\r\n<li><b>\"setpause\":</b>\r\nsets <code>arg</code> as the new value for the <em>pause</em> of\r\nthe collector (see <a href=\"#2.10\">&sect;2.10</a>).\r\nReturns the previous value for <em>pause</em>.\r\n</li>\r\n\r\n<li><b>\"setstepmul\":</b>\r\nsets <code>arg</code> as the new value for the <em>step multiplier</em> of\r\nthe collector (see <a href=\"#2.10\">&sect;2.10</a>).\r\nReturns the previous value for <em>step</em>.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-dofile\"><code>dofile ([filename])</code></a></h3>\r\nOpens the named file and executes its contents as a Lua chunk.\r\nWhen called without arguments,\r\n<code>dofile</code> executes the contents of the standard input (<code>stdin</code>).\r\nReturns all values returned by the chunk.\r\nIn case of errors, <code>dofile</code> propagates the error\r\nto its caller (that is, <code>dofile</code> does not run in protected mode).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-error\"><code>error (message [, level])</code></a></h3>\r\nTerminates the last protected function called\r\nand returns <code>message</code> as the error message.\r\nFunction <code>error</code> never returns.\r\n\r\n\r\n<p>\r\nUsually, <code>error</code> adds some information about the error position\r\nat the beginning of the message.\r\nThe <code>level</code> argument specifies how to get the error position.\r\nWith level&nbsp;1 (the default), the error position is where the\r\n<code>error</code> function was called.\r\nLevel&nbsp;2 points the error to where the function\r\nthat called <code>error</code> was called; and so on.\r\nPassing a level&nbsp;0 avoids the addition of error position information\r\nto the message.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-_G\"><code>_G</code></a></h3>\r\nA global variable (not a function) that\r\nholds the global environment (that is, <code>_G._G = _G</code>).\r\nLua itself does not use this variable;\r\nchanging its value does not affect any environment,\r\nnor vice-versa.\r\n(Use <a href=\"#pdf-setfenv\"><code>setfenv</code></a> to change environments.)\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-getfenv\"><code>getfenv ([f])</code></a></h3>\r\nReturns the current environment in use by the function.\r\n<code>f</code> can be a Lua function or a number\r\nthat specifies the function at that stack level:\r\nLevel&nbsp;1 is the function calling <code>getfenv</code>.\r\nIf the given function is not a Lua function,\r\nor if <code>f</code> is 0,\r\n<code>getfenv</code> returns the global environment.\r\nThe default for <code>f</code> is 1.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-getmetatable\"><code>getmetatable (object)</code></a></h3>\r\n\r\n\r\n<p>\r\nIf <code>object</code> does not have a metatable, returns <b>nil</b>.\r\nOtherwise,\r\nif the object's metatable has a <code>\"__metatable\"</code> field,\r\nreturns the associated value.\r\nOtherwise, returns the metatable of the given object.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-ipairs\"><code>ipairs (t)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns three values: an iterator function, the table <code>t</code>, and 0,\r\nso that the construction\r\n\r\n<pre>\r\n     for i,v in ipairs(t) do <em>body</em> end\r\n</pre><p>\r\nwill iterate over the pairs (<code>1,t[1]</code>), (<code>2,t[2]</code>), &middot;&middot;&middot;,\r\nup to the first integer key absent from the table.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-load\"><code>load (func [, chunkname])</code></a></h3>\r\n\r\n\r\n<p>\r\nLoads a chunk using function <code>func</code> to get its pieces.\r\nEach call to <code>func</code> must return a string that concatenates\r\nwith previous results.\r\nA return of an empty string, <b>nil</b>, or no value signals the end of the chunk.\r\n\r\n\r\n<p>\r\nIf there are no errors, \r\nreturns the compiled chunk as a function;\r\notherwise, returns <b>nil</b> plus the error message.\r\nThe environment of the returned function is the global environment.\r\n\r\n\r\n<p>\r\n<code>chunkname</code> is used as the chunk name for error messages\r\nand debug information.\r\nWhen absent,\r\nit defaults to \"<code>=(load)</code>\".\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-loadfile\"><code>loadfile ([filename])</code></a></h3>\r\n\r\n\r\n<p>\r\nSimilar to <a href=\"#pdf-load\"><code>load</code></a>,\r\nbut gets the chunk from file <code>filename</code>\r\nor from the standard input,\r\nif no file name is given.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-loadstring\"><code>loadstring (string [, chunkname])</code></a></h3>\r\n\r\n\r\n<p>\r\nSimilar to <a href=\"#pdf-load\"><code>load</code></a>,\r\nbut gets the chunk from the given string.\r\n\r\n\r\n<p>\r\nTo load and run a given string, use the idiom\r\n\r\n<pre>\r\n     assert(loadstring(s))()\r\n</pre>\r\n\r\n<p>\r\nWhen absent,\r\n<code>chunkname</code> defaults to the given string.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-next\"><code>next (table [, index])</code></a></h3>\r\n\r\n\r\n<p>\r\nAllows a program to traverse all fields of a table.\r\nIts first argument is a table and its second argument\r\nis an index in this table.\r\n<code>next</code> returns the next index of the table\r\nand its associated value.\r\nWhen called with <b>nil</b> as its second argument,\r\n<code>next</code> returns an initial index\r\nand its associated value.\r\nWhen called with the last index,\r\nor with <b>nil</b> in an empty table,\r\n<code>next</code> returns <b>nil</b>.\r\nIf the second argument is absent, then it is interpreted as <b>nil</b>.\r\nIn particular,\r\nyou can use <code>next(t)</code> to check whether a table is empty.\r\n\r\n\r\n<p>\r\nThe order in which the indices are enumerated is not specified,\r\n<em>even for numeric indices</em>.\r\n(To traverse a table in numeric order,\r\nuse a numerical <b>for</b> or the <a href=\"#pdf-ipairs\"><code>ipairs</code></a> function.)\r\n\r\n\r\n<p>\r\nThe behavior of <code>next</code> is <em>undefined</em> if,\r\nduring the traversal,\r\nyou assign any value to a non-existent field in the table.\r\nYou may however modify existing fields.\r\nIn particular, you may clear existing fields.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-pairs\"><code>pairs (t)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns three values: the <a href=\"#pdf-next\"><code>next</code></a> function, the table <code>t</code>, and <b>nil</b>,\r\nso that the construction\r\n\r\n<pre>\r\n     for k,v in pairs(t) do <em>body</em> end\r\n</pre><p>\r\nwill iterate over all key&ndash;value pairs of table <code>t</code>.\r\n\r\n\r\n<p>\r\nSee function <a href=\"#pdf-next\"><code>next</code></a> for the caveats of modifying\r\nthe table during its traversal.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-pcall\"><code>pcall (f, arg1, &middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nCalls function <code>f</code> with\r\nthe given arguments in <em>protected mode</em>.\r\nThis means that any error inside&nbsp;<code>f</code> is not propagated;\r\ninstead, <code>pcall</code> catches the error\r\nand returns a status code.\r\nIts first result is the status code (a boolean),\r\nwhich is true if the call succeeds without errors.\r\nIn such case, <code>pcall</code> also returns all results from the call,\r\nafter this first result.\r\nIn case of any error, <code>pcall</code> returns <b>false</b> plus the error message.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-print\"><code>print (&middot;&middot;&middot;)</code></a></h3>\r\nReceives any number of arguments,\r\nand prints their values to <code>stdout</code>,\r\nusing the <a href=\"#pdf-tostring\"><code>tostring</code></a> function to convert them to strings.\r\n<code>print</code> is not intended for formatted output,\r\nbut only as a quick way to show a value,\r\ntypically for debugging.\r\nFor formatted output, use <a href=\"#pdf-string.format\"><code>string.format</code></a>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-rawequal\"><code>rawequal (v1, v2)</code></a></h3>\r\nChecks whether <code>v1</code> is equal to <code>v2</code>,\r\nwithout invoking any metamethod.\r\nReturns a boolean.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-rawget\"><code>rawget (table, index)</code></a></h3>\r\nGets the real value of <code>table[index]</code>,\r\nwithout invoking any metamethod.\r\n<code>table</code> must be a table;\r\n<code>index</code> may be any value.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-rawset\"><code>rawset (table, index, value)</code></a></h3>\r\nSets the real value of <code>table[index]</code> to <code>value</code>,\r\nwithout invoking any metamethod.\r\n<code>table</code> must be a table,\r\n<code>index</code> any value different from <b>nil</b>,\r\nand <code>value</code> any Lua value.\r\n\r\n\r\n<p>\r\nThis function returns <code>table</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-select\"><code>select (index, &middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nIf <code>index</code> is a number,\r\nreturns all arguments after argument number <code>index</code>.\r\nOtherwise, <code>index</code> must be the string <code>\"#\"</code>,\r\nand <code>select</code> returns the total number of extra arguments it received.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-setfenv\"><code>setfenv (f, table)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the environment to be used by the given function.\r\n<code>f</code> can be a Lua function or a number\r\nthat specifies the function at that stack level:\r\nLevel&nbsp;1 is the function calling <code>setfenv</code>.\r\n<code>setfenv</code> returns the given function.\r\n\r\n\r\n<p>\r\nAs a special case, when <code>f</code> is 0 <code>setfenv</code> changes\r\nthe environment of the running thread.\r\nIn this case, <code>setfenv</code> returns no values.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-setmetatable\"><code>setmetatable (table, metatable)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the metatable for the given table.\r\n(You cannot change the metatable of other types from Lua, only from&nbsp;C.)\r\nIf <code>metatable</code> is <b>nil</b>,\r\nremoves the metatable of the given table.\r\nIf the original metatable has a <code>\"__metatable\"</code> field,\r\nraises an error.\r\n\r\n\r\n<p>\r\nThis function returns <code>table</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-tonumber\"><code>tonumber (e [, base])</code></a></h3>\r\nTries to convert its argument to a number.\r\nIf the argument is already a number or a string convertible\r\nto a number, then <code>tonumber</code> returns this number;\r\notherwise, it returns <b>nil</b>.\r\n\r\n\r\n<p>\r\nAn optional argument specifies the base to interpret the numeral.\r\nThe base may be any integer between 2 and 36, inclusive.\r\nIn bases above&nbsp;10, the letter '<code>A</code>' (in either upper or lower case)\r\nrepresents&nbsp;10, '<code>B</code>' represents&nbsp;11, and so forth,\r\nwith '<code>Z</code>' representing 35.\r\nIn base 10 (the default), the number can have a decimal part,\r\nas well as an optional exponent part (see <a href=\"#2.1\">&sect;2.1</a>).\r\nIn other bases, only unsigned integers are accepted.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-tostring\"><code>tostring (e)</code></a></h3>\r\nReceives an argument of any type and\r\nconverts it to a string in a reasonable format.\r\nFor complete control of how numbers are converted,\r\nuse <a href=\"#pdf-string.format\"><code>string.format</code></a>.\r\n\r\n\r\n<p>\r\nIf the metatable of <code>e</code> has a <code>\"__tostring\"</code> field,\r\nthen <code>tostring</code> calls the corresponding value\r\nwith <code>e</code> as argument,\r\nand uses the result of the call as its result.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-type\"><code>type (v)</code></a></h3>\r\nReturns the type of its only argument, coded as a string.\r\nThe possible results of this function are\r\n\"<code>nil</code>\" (a string, not the value <b>nil</b>),\r\n\"<code>number</code>\",\r\n\"<code>string</code>\",\r\n\"<code>boolean</code>\",\r\n\"<code>table</code>\",\r\n\"<code>function</code>\",\r\n\"<code>thread</code>\",\r\nand \"<code>userdata</code>\".\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-unpack\"><code>unpack (list [, i [, j]])</code></a></h3>\r\nReturns the elements from the given table.\r\nThis function is equivalent to\r\n\r\n<pre>\r\n     return list[i], list[i+1], &middot;&middot;&middot;, list[j]\r\n</pre><p>\r\nexcept that the above code can be written only for a fixed number\r\nof elements.\r\nBy default, <code>i</code> is&nbsp;1 and <code>j</code> is the length of the list,\r\nas defined by the length operator (see <a href=\"#2.5.5\">&sect;2.5.5</a>).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-_VERSION\"><code>_VERSION</code></a></h3>\r\nA global variable (not a function) that\r\nholds a string containing the current interpreter version.\r\nThe current contents of this variable is \"<code>Lua 5.1</code>\".\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-xpcall\"><code>xpcall (f, err)</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function is similar to <a href=\"#pdf-pcall\"><code>pcall</code></a>,\r\nexcept that you can set a new error handler.\r\n\r\n\r\n<p>\r\n<code>xpcall</code> calls function <code>f</code> in protected mode,\r\nusing <code>err</code> as the error handler.\r\nAny error inside <code>f</code> is not propagated;\r\ninstead, <code>xpcall</code> catches the error,\r\ncalls the <code>err</code> function with the original error object,\r\nand returns a status code.\r\nIts first result is the status code (a boolean),\r\nwhich is true if the call succeeds without errors.\r\nIn this case, <code>xpcall</code> also returns all results from the call,\r\nafter this first result.\r\nIn case of any error,\r\n<code>xpcall</code> returns <b>false</b> plus the result from <code>err</code>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.2 - <a name=\"5.2\">Coroutine Manipulation</a></h2>\r\n\r\n<p>\r\nThe operations related to coroutines comprise a sub-library of\r\nthe basic library and come inside the table <a name=\"pdf-coroutine\"><code>coroutine</code></a>.\r\nSee <a href=\"#2.11\">&sect;2.11</a> for a general description of coroutines.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.create\"><code>coroutine.create (f)</code></a></h3>\r\n\r\n\r\n<p>\r\nCreates a new coroutine, with body <code>f</code>.\r\n<code>f</code> must be a Lua function.\r\nReturns this new coroutine,\r\nan object with type <code>\"thread\"</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.resume\"><code>coroutine.resume (co [, val1, &middot;&middot;&middot;])</code></a></h3>\r\n\r\n\r\n<p>\r\nStarts or continues the execution of coroutine <code>co</code>.\r\nThe first time you resume a coroutine,\r\nit starts running its body.\r\nThe values <code>val1</code>, &middot;&middot;&middot; are passed\r\nas the arguments to the body function.\r\nIf the coroutine has yielded,\r\n<code>resume</code> restarts it;\r\nthe values <code>val1</code>, &middot;&middot;&middot; are passed\r\nas the results from the yield.\r\n\r\n\r\n<p>\r\nIf the coroutine runs without any errors,\r\n<code>resume</code> returns <b>true</b> plus any values passed to <code>yield</code>\r\n(if the coroutine yields) or any values returned by the body function\r\n(if the coroutine terminates).\r\nIf there is any error,\r\n<code>resume</code> returns <b>false</b> plus the error message.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.running\"><code>coroutine.running ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the running coroutine,\r\nor <b>nil</b> when called by the main thread.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.status\"><code>coroutine.status (co)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the status of coroutine <code>co</code>, as a string:\r\n<code>\"running\"</code>,\r\nif the coroutine is running (that is, it called <code>status</code>);\r\n<code>\"suspended\"</code>, if the coroutine is suspended in a call to <code>yield</code>,\r\nor if it has not started running yet;\r\n<code>\"normal\"</code> if the coroutine is active but not running\r\n(that is, it has resumed another coroutine);\r\nand <code>\"dead\"</code> if the coroutine has finished its body function,\r\nor if it has stopped with an error.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.wrap\"><code>coroutine.wrap (f)</code></a></h3>\r\n\r\n\r\n<p>\r\nCreates a new coroutine, with body <code>f</code>.\r\n<code>f</code> must be a Lua function.\r\nReturns a function that resumes the coroutine each time it is called.\r\nAny arguments passed to the function behave as the\r\nextra arguments to <code>resume</code>.\r\nReturns the same values returned by <code>resume</code>,\r\nexcept the first boolean.\r\nIn case of error, propagates the error.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-coroutine.yield\"><code>coroutine.yield (&middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nSuspends the execution of the calling coroutine.\r\nThe coroutine cannot be running a C&nbsp;function,\r\na metamethod, or an iterator.\r\nAny arguments to <code>yield</code> are passed as extra results to <code>resume</code>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.3 - <a name=\"5.3\">Modules</a></h2>\r\n\r\n<p>\r\nThe package library provides basic\r\nfacilities for loading and building modules in Lua.\r\nIt exports two of its functions directly in the global environment:\r\n<a href=\"#pdf-require\"><code>require</code></a> and <a href=\"#pdf-module\"><code>module</code></a>.\r\nEverything else is exported in a table <a name=\"pdf-package\"><code>package</code></a>.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-module\"><code>module (name [, &middot;&middot;&middot;])</code></a></h3>\r\n\r\n\r\n<p>\r\nCreates a module.\r\nIf there is a table in <code>package.loaded[name]</code>,\r\nthis table is the module.\r\nOtherwise, if there is a global table <code>t</code> with the given name,\r\nthis table is the module.\r\nOtherwise creates a new table <code>t</code> and\r\nsets it as the value of the global <code>name</code> and\r\nthe value of <code>package.loaded[name]</code>.\r\nThis function also initializes <code>t._NAME</code> with the given name,\r\n<code>t._M</code> with the module (<code>t</code> itself),\r\nand <code>t._PACKAGE</code> with the package name\r\n(the full module name minus last component; see below).\r\nFinally, <code>module</code> sets <code>t</code> as the new environment\r\nof the current function and the new value of <code>package.loaded[name]</code>,\r\nso that <a href=\"#pdf-require\"><code>require</code></a> returns <code>t</code>.\r\n\r\n\r\n<p>\r\nIf <code>name</code> is a compound name\r\n(that is, one with components separated by dots),\r\n<code>module</code> creates (or reuses, if they already exist)\r\ntables for each component.\r\nFor instance, if <code>name</code> is <code>a.b.c</code>,\r\nthen <code>module</code> stores the module table in field <code>c</code> of\r\nfield <code>b</code> of global <code>a</code>.\r\n\r\n\r\n<p>\r\nThis function can receive optional <em>options</em> after\r\nthe module name,\r\nwhere each option is a function to be applied over the module.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-require\"><code>require (modname)</code></a></h3>\r\n\r\n\r\n<p>\r\nLoads the given module.\r\nThe function starts by looking into the <a href=\"#pdf-package.loaded\"><code>package.loaded</code></a> table\r\nto determine whether <code>modname</code> is already loaded.\r\nIf it is, then <code>require</code> returns the value stored\r\nat <code>package.loaded[modname]</code>.\r\nOtherwise, it tries to find a <em>loader</em> for the module.\r\n\r\n\r\n<p>\r\nTo find a loader,\r\n<code>require</code> is guided by the <a href=\"#pdf-package.loaders\"><code>package.loaders</code></a> array.\r\nBy changing this array,\r\nwe can change how <code>require</code> looks for a module.\r\nThe following explanation is based on the default configuration\r\nfor <a href=\"#pdf-package.loaders\"><code>package.loaders</code></a>.\r\n\r\n\r\n<p>\r\nFirst <code>require</code> queries <code>package.preload[modname]</code>.\r\nIf it has a value,\r\nthis value (which should be a function) is the loader.\r\nOtherwise <code>require</code> searches for a Lua loader using the\r\npath stored in <a href=\"#pdf-package.path\"><code>package.path</code></a>.\r\nIf that also fails, it searches for a C&nbsp;loader using the\r\npath stored in <a href=\"#pdf-package.cpath\"><code>package.cpath</code></a>.\r\nIf that also fails,\r\nit tries an <em>all-in-one</em> loader (see <a href=\"#pdf-package.loaders\"><code>package.loaders</code></a>).\r\n\r\n\r\n<p>\r\nOnce a loader is found,\r\n<code>require</code> calls the loader with a single argument, <code>modname</code>.\r\nIf the loader returns any value,\r\n<code>require</code> assigns the returned value to <code>package.loaded[modname]</code>.\r\nIf the loader returns no value and\r\nhas not assigned any value to <code>package.loaded[modname]</code>,\r\nthen <code>require</code> assigns <b>true</b> to this entry.\r\nIn any case, <code>require</code> returns the\r\nfinal value of <code>package.loaded[modname]</code>.\r\n\r\n\r\n<p>\r\nIf there is any error loading or running the module,\r\nor if it cannot find any loader for the module,\r\nthen <code>require</code> signals an error. \r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.cpath\"><code>package.cpath</code></a></h3>\r\n\r\n\r\n<p>\r\nThe path used by <a href=\"#pdf-require\"><code>require</code></a> to search for a C&nbsp;loader.\r\n\r\n\r\n<p>\r\nLua initializes the C&nbsp;path <a href=\"#pdf-package.cpath\"><code>package.cpath</code></a> in the same way\r\nit initializes the Lua path <a href=\"#pdf-package.path\"><code>package.path</code></a>,\r\nusing the environment variable <a name=\"pdf-LUA_CPATH\"><code>LUA_CPATH</code></a>\r\nor a default path defined in <code>luaconf.h</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n\r\n<hr><h3><a name=\"pdf-package.loaded\"><code>package.loaded</code></a></h3>\r\n\r\n\r\n<p>\r\nA table used by <a href=\"#pdf-require\"><code>require</code></a> to control which\r\nmodules are already loaded.\r\nWhen you require a module <code>modname</code> and\r\n<code>package.loaded[modname]</code> is not false,\r\n<a href=\"#pdf-require\"><code>require</code></a> simply returns the value stored there.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.loaders\"><code>package.loaders</code></a></h3>\r\n\r\n\r\n<p>\r\nA table used by <a href=\"#pdf-require\"><code>require</code></a> to control how to load modules.\r\n\r\n\r\n<p>\r\nEach entry in this table is a <em>searcher function</em>.\r\nWhen looking for a module,\r\n<a href=\"#pdf-require\"><code>require</code></a> calls each of these searchers in ascending order,\r\nwith the module name (the argument given to <a href=\"#pdf-require\"><code>require</code></a>) as its\r\nsole parameter.\r\nThe function can return another function (the module <em>loader</em>)\r\nor a string explaining why it did not find that module\r\n(or <b>nil</b> if it has nothing to say).\r\nLua initializes this table with four functions.\r\n\r\n\r\n<p>\r\nThe first searcher simply looks for a loader in the\r\n<a href=\"#pdf-package.preload\"><code>package.preload</code></a> table.\r\n\r\n\r\n<p>\r\nThe second searcher looks for a loader as a Lua library,\r\nusing the path stored at <a href=\"#pdf-package.path\"><code>package.path</code></a>.\r\nA path is a sequence of <em>templates</em> separated by semicolons.\r\nFor each template,\r\nthe searcher will change each interrogation\r\nmark in the template by <code>filename</code>,\r\nwhich is the module name with each dot replaced by a\r\n\"directory separator\" (such as \"<code>/</code>\" in Unix);\r\nthen it will try to open the resulting file name.\r\nSo, for instance, if the Lua path is the string\r\n\r\n<pre>\r\n     \"./?.lua;./?.lc;/usr/local/?/init.lua\"\r\n</pre><p>\r\nthe search for a Lua file for module <code>foo</code>\r\nwill try to open the files\r\n<code>./foo.lua</code>, <code>./foo.lc</code>, and\r\n<code>/usr/local/foo/init.lua</code>, in that order.\r\n\r\n\r\n<p>\r\nThe third searcher looks for a loader as a C&nbsp;library,\r\nusing the path given by the variable <a href=\"#pdf-package.cpath\"><code>package.cpath</code></a>.\r\nFor instance,\r\nif the C&nbsp;path is the string\r\n\r\n<pre>\r\n     \"./?.so;./?.dll;/usr/local/?/init.so\"\r\n</pre><p>\r\nthe searcher for module <code>foo</code>\r\nwill try to open the files <code>./foo.so</code>, <code>./foo.dll</code>,\r\nand <code>/usr/local/foo/init.so</code>, in that order.\r\nOnce it finds a C&nbsp;library,\r\nthis searcher first uses a dynamic link facility to link the\r\napplication with the library.\r\nThen it tries to find a C&nbsp;function inside the library to\r\nbe used as the loader.\r\nThe name of this C&nbsp;function is the string \"<code>luaopen_</code>\"\r\nconcatenated with a copy of the module name where each dot\r\nis replaced by an underscore.\r\nMoreover, if the module name has a hyphen,\r\nits prefix up to (and including) the first hyphen is removed.\r\nFor instance, if the module name is <code>a.v1-b.c</code>,\r\nthe function name will be <code>luaopen_b_c</code>.\r\n\r\n\r\n<p>\r\nThe fourth searcher tries an <em>all-in-one loader</em>.\r\nIt searches the C&nbsp;path for a library for\r\nthe root name of the given module.\r\nFor instance, when requiring <code>a.b.c</code>,\r\nit will search for a C&nbsp;library for <code>a</code>.\r\nIf found, it looks into it for an open function for\r\nthe submodule;\r\nin our example, that would be <code>luaopen_a_b_c</code>.\r\nWith this facility, a package can pack several C&nbsp;submodules\r\ninto one single library,\r\nwith each submodule keeping its original open function.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.loadlib\"><code>package.loadlib (libname, funcname)</code></a></h3>\r\n\r\n\r\n<p>\r\nDynamically links the host program with the C&nbsp;library <code>libname</code>.\r\nInside this library, looks for a function <code>funcname</code>\r\nand returns this function as a C&nbsp;function.\r\n(So, <code>funcname</code> must follow the protocol (see <a href=\"#lua_CFunction\"><code>lua_CFunction</code></a>)).\r\n\r\n\r\n<p>\r\nThis is a low-level function.\r\nIt completely bypasses the package and module system.\r\nUnlike <a href=\"#pdf-require\"><code>require</code></a>,\r\nit does not perform any path searching and\r\ndoes not automatically adds extensions.\r\n<code>libname</code> must be the complete file name of the C&nbsp;library,\r\nincluding if necessary a path and extension.\r\n<code>funcname</code> must be the exact name exported by the C&nbsp;library\r\n(which may depend on the C&nbsp;compiler and linker used).\r\n\r\n\r\n<p>\r\nThis function is not supported by ANSI C.\r\nAs such, it is only available on some platforms\r\n(Windows, Linux, Mac OS X, Solaris, BSD,\r\nplus other Unix systems that support the <code>dlfcn</code> standard).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.path\"><code>package.path</code></a></h3>\r\n\r\n\r\n<p>\r\nThe path used by <a href=\"#pdf-require\"><code>require</code></a> to search for a Lua loader.\r\n\r\n\r\n<p>\r\nAt start-up, Lua initializes this variable with\r\nthe value of the environment variable <a name=\"pdf-LUA_PATH\"><code>LUA_PATH</code></a> or\r\nwith a default path defined in <code>luaconf.h</code>,\r\nif the environment variable is not defined.\r\nAny \"<code>;;</code>\" in the value of the environment variable\r\nis replaced by the default path.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.preload\"><code>package.preload</code></a></h3>\r\n\r\n\r\n<p>\r\nA table to store loaders for specific modules\r\n(see <a href=\"#pdf-require\"><code>require</code></a>).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-package.seeall\"><code>package.seeall (module)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets a metatable for <code>module</code> with\r\nits <code>__index</code> field referring to the global environment,\r\nso that this module inherits values\r\nfrom the global environment.\r\nTo be used as an option to function <a href=\"#pdf-module\"><code>module</code></a>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.4 - <a name=\"5.4\">String Manipulation</a></h2>\r\n\r\n<p>\r\nThis library provides generic functions for string manipulation,\r\nsuch as finding and extracting substrings, and pattern matching.\r\nWhen indexing a string in Lua, the first character is at position&nbsp;1\r\n(not at&nbsp;0, as in C).\r\nIndices are allowed to be negative and are interpreted as indexing backwards,\r\nfrom the end of the string.\r\nThus, the last character is at position -1, and so on.\r\n\r\n\r\n<p>\r\nThe string library provides all its functions inside the table\r\n<a name=\"pdf-string\"><code>string</code></a>.\r\nIt also sets a metatable for strings\r\nwhere the <code>__index</code> field points to the <code>string</code> table.\r\nTherefore, you can use the string functions in object-oriented style.\r\nFor instance, <code>string.byte(s, i)</code>\r\ncan be written as <code>s:byte(i)</code>.\r\n\r\n\r\n<p>\r\nThe string library assumes one-byte character encodings.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.byte\"><code>string.byte (s [, i [, j]])</code></a></h3>\r\nReturns the internal numerical codes of the characters <code>s[i]</code>,\r\n<code>s[i+1]</code>, &middot;&middot;&middot;, <code>s[j]</code>.\r\nThe default value for <code>i</code> is&nbsp;1;\r\nthe default value for <code>j</code> is&nbsp;<code>i</code>.\r\n\r\n\r\n<p>\r\nNote that numerical codes are not necessarily portable across platforms.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.char\"><code>string.char (&middot;&middot;&middot;)</code></a></h3>\r\nReceives zero or more integers.\r\nReturns a string with length equal to the number of arguments,\r\nin which each character has the internal numerical code equal\r\nto its corresponding argument.\r\n\r\n\r\n<p>\r\nNote that numerical codes are not necessarily portable across platforms.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.dump\"><code>string.dump (function)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a string containing a binary representation of the given function,\r\nso that a later <a href=\"#pdf-loadstring\"><code>loadstring</code></a> on this string returns\r\na copy of the function.\r\n<code>function</code> must be a Lua function without upvalues.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.find\"><code>string.find (s, pattern [, init [, plain]])</code></a></h3>\r\nLooks for the first match of\r\n<code>pattern</code> in the string <code>s</code>.\r\nIf it finds a match, then <code>find</code> returns the indices of&nbsp;<code>s</code>\r\nwhere this occurrence starts and ends;\r\notherwise, it returns <b>nil</b>.\r\nA third, optional numerical argument <code>init</code> specifies\r\nwhere to start the search;\r\nits default value is&nbsp;1 and can be negative.\r\nA value of <b>true</b> as a fourth, optional argument <code>plain</code>\r\nturns off the pattern matching facilities,\r\nso the function does a plain \"find substring\" operation,\r\nwith no characters in <code>pattern</code> being considered \"magic\".\r\nNote that if <code>plain</code> is given, then <code>init</code> must be given as well.\r\n\r\n\r\n<p>\r\nIf the pattern has captures,\r\nthen in a successful match\r\nthe captured values are also returned,\r\nafter the two indices.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.format\"><code>string.format (formatstring, &middot;&middot;&middot;)</code></a></h3>\r\nReturns a formatted version of its variable number of arguments\r\nfollowing the description given in its first argument (which must be a string).\r\nThe format string follows the same rules as the <code>printf</code> family of\r\nstandard C&nbsp;functions.\r\nThe only differences are that the options/modifiers\r\n<code>*</code>, <code>l</code>, <code>L</code>, <code>n</code>, <code>p</code>,\r\nand <code>h</code> are not supported\r\nand that there is an extra option, <code>q</code>.\r\nThe <code>q</code> option formats a string in a form suitable to be safely read\r\nback by the Lua interpreter:\r\nthe string is written between double quotes,\r\nand all double quotes, newlines, embedded zeros,\r\nand backslashes in the string\r\nare correctly escaped when written.\r\nFor instance, the call\r\n\r\n<pre>\r\n     string.format('%q', 'a string with \"quotes\" and \\n new line')\r\n</pre><p>\r\nwill produce the string:\r\n\r\n<pre>\r\n     \"a string with \\\"quotes\\\" and \\\r\n      new line\"\r\n</pre>\r\n\r\n<p>\r\nThe options <code>c</code>, <code>d</code>, <code>E</code>, <code>e</code>, <code>f</code>,\r\n<code>g</code>, <code>G</code>, <code>i</code>, <code>o</code>, <code>u</code>, <code>X</code>, and <code>x</code> all\r\nexpect a number as argument,\r\nwhereas <code>q</code> and <code>s</code> expect a string.\r\n\r\n\r\n<p>\r\nThis function does not accept string values\r\ncontaining embedded zeros,\r\nexcept as arguments to the <code>q</code> option.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.gmatch\"><code>string.gmatch (s, pattern)</code></a></h3>\r\nReturns an iterator function that,\r\neach time it is called,\r\nreturns the next captures from <code>pattern</code> over string <code>s</code>.\r\nIf <code>pattern</code> specifies no captures,\r\nthen the whole match is produced in each call.\r\n\r\n\r\n<p>\r\nAs an example, the following loop\r\n\r\n<pre>\r\n     s = \"hello world from Lua\"\r\n     for w in string.gmatch(s, \"%a+\") do\r\n       print(w)\r\n     end\r\n</pre><p>\r\nwill iterate over all the words from string <code>s</code>,\r\nprinting one per line.\r\nThe next example collects all pairs <code>key=value</code> from the\r\ngiven string into a table:\r\n\r\n<pre>\r\n     t = {}\r\n     s = \"from=world, to=Lua\"\r\n     for k, v in string.gmatch(s, \"(%w+)=(%w+)\") do\r\n       t[k] = v\r\n     end\r\n</pre>\r\n\r\n<p>\r\nFor this function, a '<code>^</code>' at the start of a pattern does not\r\nwork as an anchor, as this would prevent the iteration.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.gsub\"><code>string.gsub (s, pattern, repl [, n])</code></a></h3>\r\nReturns a copy of <code>s</code>\r\nin which all (or the first <code>n</code>, if given)\r\noccurrences of the <code>pattern</code> have been\r\nreplaced by a replacement string specified by <code>repl</code>,\r\nwhich can be a string, a table, or a function.\r\n<code>gsub</code> also returns, as its second value,\r\nthe total number of matches that occurred.\r\n\r\n\r\n<p>\r\nIf <code>repl</code> is a string, then its value is used for replacement.\r\nThe character&nbsp;<code>%</code> works as an escape character:\r\nany sequence in <code>repl</code> of the form <code>%<em>n</em></code>,\r\nwith <em>n</em> between 1 and 9,\r\nstands for the value of the <em>n</em>-th captured substring (see below).\r\nThe sequence <code>%0</code> stands for the whole match.\r\nThe sequence <code>%%</code> stands for a single&nbsp;<code>%</code>.\r\n\r\n\r\n<p>\r\nIf <code>repl</code> is a table, then the table is queried for every match,\r\nusing the first capture as the key;\r\nif the pattern specifies no captures,\r\nthen the whole match is used as the key.\r\n\r\n\r\n<p>\r\nIf <code>repl</code> is a function, then this function is called every time a\r\nmatch occurs, with all captured substrings passed as arguments,\r\nin order;\r\nif the pattern specifies no captures,\r\nthen the whole match is passed as a sole argument.\r\n\r\n\r\n<p>\r\nIf the value returned by the table query or by the function call\r\nis a string or a number,\r\nthen it is used as the replacement string;\r\notherwise, if it is <b>false</b> or <b>nil</b>,\r\nthen there is no replacement\r\n(that is, the original match is kept in the string).\r\n\r\n\r\n<p>\r\nHere are some examples:\r\n\r\n<pre>\r\n     x = string.gsub(\"hello world\", \"(%w+)\", \"%1 %1\")\r\n     --&gt; x=\"hello hello world world\"\r\n     \r\n     x = string.gsub(\"hello world\", \"%w+\", \"%0 %0\", 1)\r\n     --&gt; x=\"hello hello world\"\r\n     \r\n     x = string.gsub(\"hello world from Lua\", \"(%w+)%s*(%w+)\", \"%2 %1\")\r\n     --&gt; x=\"world hello Lua from\"\r\n     \r\n     x = string.gsub(\"home = $HOME, user = $USER\", \"%$(%w+)\", os.getenv)\r\n     --&gt; x=\"home = /home/roberto, user = roberto\"\r\n     \r\n     x = string.gsub(\"4+5 = $return 4+5$\", \"%$(.-)%$\", function (s)\r\n           return loadstring(s)()\r\n         end)\r\n     --&gt; x=\"4+5 = 9\"\r\n     \r\n     local t = {name=\"lua\", version=\"5.1\"}\r\n     x = string.gsub(\"$name-$version.tar.gz\", \"%$(%w+)\", t)\r\n     --&gt; x=\"lua-5.1.tar.gz\"\r\n</pre>\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.len\"><code>string.len (s)</code></a></h3>\r\nReceives a string and returns its length.\r\nThe empty string <code>\"\"</code> has length 0.\r\nEmbedded zeros are counted,\r\nso <code>\"a\\000bc\\000\"</code> has length 5.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.lower\"><code>string.lower (s)</code></a></h3>\r\nReceives a string and returns a copy of this string with all\r\nuppercase letters changed to lowercase.\r\nAll other characters are left unchanged.\r\nThe definition of what an uppercase letter is depends on the current locale.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.match\"><code>string.match (s, pattern [, init])</code></a></h3>\r\nLooks for the first <em>match</em> of\r\n<code>pattern</code> in the string <code>s</code>.\r\nIf it finds one, then <code>match</code> returns\r\nthe captures from the pattern;\r\notherwise it returns <b>nil</b>.\r\nIf <code>pattern</code> specifies no captures,\r\nthen the whole match is returned.\r\nA third, optional numerical argument <code>init</code> specifies\r\nwhere to start the search;\r\nits default value is&nbsp;1 and can be negative.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.rep\"><code>string.rep (s, n)</code></a></h3>\r\nReturns a string that is the concatenation of <code>n</code> copies of\r\nthe string <code>s</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.reverse\"><code>string.reverse (s)</code></a></h3>\r\nReturns a string that is the string <code>s</code> reversed.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.sub\"><code>string.sub (s, i [, j])</code></a></h3>\r\nReturns the substring of <code>s</code> that\r\nstarts at <code>i</code>  and continues until <code>j</code>;\r\n<code>i</code> and <code>j</code> can be negative.\r\nIf <code>j</code> is absent, then it is assumed to be equal to -1\r\n(which is the same as the string length).\r\nIn particular,\r\nthe call <code>string.sub(s,1,j)</code> returns a prefix of <code>s</code>\r\nwith length <code>j</code>,\r\nand <code>string.sub(s, -i)</code> returns a suffix of <code>s</code>\r\nwith length <code>i</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-string.upper\"><code>string.upper (s)</code></a></h3>\r\nReceives a string and returns a copy of this string with all\r\nlowercase letters changed to uppercase.\r\nAll other characters are left unchanged.\r\nThe definition of what a lowercase letter is depends on the current locale.\r\n\r\n\r\n\r\n<h3>5.4.1 - <a name=\"5.4.1\">Patterns</a></h3>\r\n\r\n\r\n<h4>Character Class:</h4><p>\r\nA <em>character class</em> is used to represent a set of characters.\r\nThe following combinations are allowed in describing a character class:\r\n\r\n<ul>\r\n\r\n<li><b><em>x</em>:</b>\r\n(where <em>x</em> is not one of the <em>magic characters</em>\r\n<code>^$()%.[]*+-?</code>)\r\nrepresents the character <em>x</em> itself.\r\n</li>\r\n\r\n<li><b><code>.</code>:</b> (a dot) represents all characters.</li>\r\n\r\n<li><b><code>%a</code>:</b> represents all letters.</li>\r\n\r\n<li><b><code>%c</code>:</b> represents all control characters.</li>\r\n\r\n<li><b><code>%d</code>:</b> represents all digits.</li>\r\n\r\n<li><b><code>%l</code>:</b> represents all lowercase letters.</li>\r\n\r\n<li><b><code>%p</code>:</b> represents all punctuation characters.</li>\r\n\r\n<li><b><code>%s</code>:</b> represents all space characters.</li>\r\n\r\n<li><b><code>%u</code>:</b> represents all uppercase letters.</li>\r\n\r\n<li><b><code>%w</code>:</b> represents all alphanumeric characters.</li>\r\n\r\n<li><b><code>%x</code>:</b> represents all hexadecimal digits.</li>\r\n\r\n<li><b><code>%z</code>:</b> represents the character with representation 0.</li>\r\n\r\n<li><b><code>%<em>x</em></code>:</b> (where <em>x</em> is any non-alphanumeric character)\r\nrepresents the character <em>x</em>.\r\nThis is the standard way to escape the magic characters.\r\nAny punctuation character (even the non magic)\r\ncan be preceded by a '<code>%</code>'\r\nwhen used to represent itself in a pattern.\r\n</li>\r\n\r\n<li><b><code>[<em>set</em>]</code>:</b>\r\nrepresents the class which is the union of all\r\ncharacters in <em>set</em>.\r\nA range of characters can be specified by\r\nseparating the end characters of the range with a '<code>-</code>'.\r\nAll classes <code>%</code><em>x</em> described above can also be used as\r\ncomponents in <em>set</em>.\r\nAll other characters in <em>set</em> represent themselves.\r\nFor example, <code>[%w_]</code> (or <code>[_%w]</code>)\r\nrepresents all alphanumeric characters plus the underscore,\r\n<code>[0-7]</code> represents the octal digits,\r\nand <code>[0-7%l%-]</code> represents the octal digits plus\r\nthe lowercase letters plus the '<code>-</code>' character.\r\n\r\n\r\n<p>\r\nThe interaction between ranges and classes is not defined.\r\nTherefore, patterns like <code>[%a-z]</code> or <code>[a-%%]</code>\r\nhave no meaning.\r\n</li>\r\n\r\n<li><b><code>[^<em>set</em>]</code>:</b>\r\nrepresents the complement of <em>set</em>,\r\nwhere <em>set</em> is interpreted as above.\r\n</li>\r\n\r\n</ul><p>\r\nFor all classes represented by single letters (<code>%a</code>, <code>%c</code>, etc.),\r\nthe corresponding uppercase letter represents the complement of the class.\r\nFor instance, <code>%S</code> represents all non-space characters.\r\n\r\n\r\n<p>\r\nThe definitions of letter, space, and other character groups\r\ndepend on the current locale.\r\nIn particular, the class <code>[a-z]</code> may not be equivalent to <code>%l</code>.\r\n\r\n\r\n\r\n\r\n\r\n<h4>Pattern Item:</h4><p>\r\nA <em>pattern item</em> can be\r\n\r\n<ul>\r\n\r\n<li>\r\na single character class,\r\nwhich matches any single character in the class;\r\n</li>\r\n\r\n<li>\r\na single character class followed by '<code>*</code>',\r\nwhich matches 0 or more repetitions of characters in the class.\r\nThese repetition items will always match the longest possible sequence;\r\n</li>\r\n\r\n<li>\r\na single character class followed by '<code>+</code>',\r\nwhich matches 1 or more repetitions of characters in the class.\r\nThese repetition items will always match the longest possible sequence;\r\n</li>\r\n\r\n<li>\r\na single character class followed by '<code>-</code>',\r\nwhich also matches 0 or more repetitions of characters in the class.\r\nUnlike '<code>*</code>',\r\nthese repetition items will always match the <em>shortest</em> possible sequence;\r\n</li>\r\n\r\n<li>\r\na single character class followed by '<code>?</code>',\r\nwhich matches 0 or 1 occurrence of a character in the class;\r\n</li>\r\n\r\n<li>\r\n<code>%<em>n</em></code>, for <em>n</em> between 1 and 9;\r\nsuch item matches a substring equal to the <em>n</em>-th captured string\r\n(see below);\r\n</li>\r\n\r\n<li>\r\n<code>%b<em>xy</em></code>, where <em>x</em> and <em>y</em> are two distinct characters;\r\nsuch item matches strings that start with&nbsp;<em>x</em>, end with&nbsp;<em>y</em>,\r\nand where the <em>x</em> and <em>y</em> are <em>balanced</em>.\r\nThis means that, if one reads the string from left to right,\r\ncounting <em>+1</em> for an <em>x</em> and <em>-1</em> for a <em>y</em>,\r\nthe ending <em>y</em> is the first <em>y</em> where the count reaches 0.\r\nFor instance, the item <code>%b()</code> matches expressions with\r\nbalanced parentheses.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h4>Pattern:</h4><p>\r\nA <em>pattern</em> is a sequence of pattern items.\r\nA '<code>^</code>' at the beginning of a pattern anchors the match at the\r\nbeginning of the subject string.\r\nA '<code>$</code>' at the end of a pattern anchors the match at the\r\nend of the subject string.\r\nAt other positions,\r\n'<code>^</code>' and '<code>$</code>' have no special meaning and represent themselves.\r\n\r\n\r\n\r\n\r\n\r\n<h4>Captures:</h4><p>\r\nA pattern can contain sub-patterns enclosed in parentheses;\r\nthey describe <em>captures</em>.\r\nWhen a match succeeds, the substrings of the subject string\r\nthat match captures are stored (<em>captured</em>) for future use.\r\nCaptures are numbered according to their left parentheses.\r\nFor instance, in the pattern <code>\"(a*(.)%w(%s*))\"</code>,\r\nthe part of the string matching <code>\"a*(.)%w(%s*)\"</code> is\r\nstored as the first capture (and therefore has number&nbsp;1);\r\nthe character matching \"<code>.</code>\" is captured with number&nbsp;2,\r\nand the part matching \"<code>%s*</code>\" has number&nbsp;3.\r\n\r\n\r\n<p>\r\nAs a special case, the empty capture <code>()</code> captures\r\nthe current string position (a number).\r\nFor instance, if we apply the pattern <code>\"()aa()\"</code> on the\r\nstring <code>\"flaaap\"</code>, there will be two captures: 3&nbsp;and&nbsp;5.\r\n\r\n\r\n<p>\r\nA pattern cannot contain embedded zeros.  Use <code>%z</code> instead.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.5 - <a name=\"5.5\">Table Manipulation</a></h2><p>\r\nThis library provides generic functions for table manipulation.\r\nIt provides all its functions inside the table <a name=\"pdf-table\"><code>table</code></a>.\r\n\r\n\r\n<p>\r\nMost functions in the table library assume that the table\r\nrepresents an array or a list.\r\nFor these functions, when we talk about the \"length\" of a table\r\nwe mean the result of the length operator.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-table.concat\"><code>table.concat (table [, sep [, i [, j]]])</code></a></h3>\r\nGiven an array where all elements are strings or numbers,\r\nreturns <code>table[i]..sep..table[i+1] &middot;&middot;&middot; sep..table[j]</code>.\r\nThe default value for <code>sep</code> is the empty string,\r\nthe default for <code>i</code> is 1,\r\nand the default for <code>j</code> is the length of the table.\r\nIf <code>i</code> is greater than <code>j</code>, returns the empty string.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-table.insert\"><code>table.insert (table, [pos,] value)</code></a></h3>\r\n\r\n\r\n<p>\r\nInserts element <code>value</code> at position <code>pos</code> in <code>table</code>,\r\nshifting up other elements to open space, if necessary.\r\nThe default value for <code>pos</code> is <code>n+1</code>,\r\nwhere <code>n</code> is the length of the table (see <a href=\"#2.5.5\">&sect;2.5.5</a>),\r\nso that a call <code>table.insert(t,x)</code> inserts <code>x</code> at the end\r\nof table <code>t</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-table.maxn\"><code>table.maxn (table)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the largest positive numerical index of the given table,\r\nor zero if the table has no positive numerical indices.\r\n(To do its job this function does a linear traversal of\r\nthe whole table.) \r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-table.remove\"><code>table.remove (table [, pos])</code></a></h3>\r\n\r\n\r\n<p>\r\nRemoves from <code>table</code> the element at position <code>pos</code>,\r\nshifting down other elements to close the space, if necessary.\r\nReturns the value of the removed element.\r\nThe default value for <code>pos</code> is <code>n</code>,\r\nwhere <code>n</code> is the length of the table,\r\nso that a call <code>table.remove(t)</code> removes the last element\r\nof table <code>t</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-table.sort\"><code>table.sort (table [, comp])</code></a></h3>\r\nSorts table elements in a given order, <em>in-place</em>,\r\nfrom <code>table[1]</code> to <code>table[n]</code>,\r\nwhere <code>n</code> is the length of the table.\r\nIf <code>comp</code> is given,\r\nthen it must be a function that receives two table elements,\r\nand returns true\r\nwhen the first is less than the second\r\n(so that <code>not comp(a[i+1],a[i])</code> will be true after the sort).\r\nIf <code>comp</code> is not given,\r\nthen the standard Lua operator <code>&lt;</code> is used instead.\r\n\r\n\r\n<p>\r\nThe sort algorithm is not stable;\r\nthat is, elements considered equal by the given order\r\nmay have their relative positions changed by the sort.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.6 - <a name=\"5.6\">Mathematical Functions</a></h2>\r\n\r\n<p>\r\nThis library is an interface to the standard C&nbsp;math library.\r\nIt provides all its functions inside the table <a name=\"pdf-math\"><code>math</code></a>.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.abs\"><code>math.abs (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the absolute value of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.acos\"><code>math.acos (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the arc cosine of <code>x</code> (in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.asin\"><code>math.asin (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the arc sine of <code>x</code> (in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.atan\"><code>math.atan (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the arc tangent of <code>x</code> (in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.atan2\"><code>math.atan2 (y, x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the arc tangent of <code>y/x</code> (in radians),\r\nbut uses the signs of both parameters to find the\r\nquadrant of the result.\r\n(It also handles correctly the case of <code>x</code> being zero.)\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.ceil\"><code>math.ceil (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the smallest integer larger than or equal to <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.cos\"><code>math.cos (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the cosine of <code>x</code> (assumed to be in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.cosh\"><code>math.cosh (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the hyperbolic cosine of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.deg\"><code>math.deg (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the angle <code>x</code> (given in radians) in degrees.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.exp\"><code>math.exp (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the value <em>e<sup>x</sup></em>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.floor\"><code>math.floor (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the largest integer smaller than or equal to <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.fmod\"><code>math.fmod (x, y)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the remainder of the division of <code>x</code> by <code>y</code>\r\nthat rounds the quotient towards zero.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.frexp\"><code>math.frexp (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns <code>m</code> and <code>e</code> such that <em>x = m2<sup>e</sup></em>,\r\n<code>e</code> is an integer and the absolute value of <code>m</code> is\r\nin the range <em>[0.5, 1)</em>\r\n(or zero when <code>x</code> is zero).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.huge\"><code>math.huge</code></a></h3>\r\n\r\n\r\n<p>\r\nThe value <code>HUGE_VAL</code>,\r\na value larger than or equal to any other numerical value.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.ldexp\"><code>math.ldexp (m, e)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns <em>m2<sup>e</sup></em> (<code>e</code> should be an integer).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.log\"><code>math.log (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the natural logarithm of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.log10\"><code>math.log10 (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the base-10 logarithm of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.max\"><code>math.max (x, &middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the maximum value among its arguments.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.min\"><code>math.min (x, &middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the minimum value among its arguments.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.modf\"><code>math.modf (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns two numbers,\r\nthe integral part of <code>x</code> and the fractional part of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.pi\"><code>math.pi</code></a></h3>\r\n\r\n\r\n<p>\r\nThe value of <em>pi</em>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.pow\"><code>math.pow (x, y)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns <em>x<sup>y</sup></em>.\r\n(You can also use the expression <code>x^y</code> to compute this value.)\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.rad\"><code>math.rad (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the angle <code>x</code> (given in degrees) in radians.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.random\"><code>math.random ([m [, n]])</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function is an interface to the simple\r\npseudo-random generator function <code>rand</code> provided by ANSI&nbsp;C.\r\n(No guarantees can be given for its statistical properties.)\r\n\r\n\r\n<p>\r\nWhen called without arguments,\r\nreturns a uniform pseudo-random real number\r\nin the range <em>[0,1)</em>.  \r\nWhen called with an integer number <code>m</code>,\r\n<code>math.random</code> returns\r\na uniform pseudo-random integer in the range <em>[1, m]</em>.\r\nWhen called with two integer numbers <code>m</code> and <code>n</code>,\r\n<code>math.random</code> returns a uniform pseudo-random\r\ninteger in the range <em>[m, n]</em>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.randomseed\"><code>math.randomseed (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets <code>x</code> as the \"seed\"\r\nfor the pseudo-random generator:\r\nequal seeds produce equal sequences of numbers.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.sin\"><code>math.sin (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the sine of <code>x</code> (assumed to be in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.sinh\"><code>math.sinh (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the hyperbolic sine of <code>x</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.sqrt\"><code>math.sqrt (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the square root of <code>x</code>.\r\n(You can also use the expression <code>x^0.5</code> to compute this value.)\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.tan\"><code>math.tan (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the tangent of <code>x</code> (assumed to be in radians).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-math.tanh\"><code>math.tanh (x)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the hyperbolic tangent of <code>x</code>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.7 - <a name=\"5.7\">Input and Output Facilities</a></h2>\r\n\r\n<p>\r\nThe I/O library provides two different styles for file manipulation.\r\nThe first one uses implicit file descriptors;\r\nthat is, there are operations to set a default input file and a\r\ndefault output file,\r\nand all input/output operations are over these default files.\r\nThe second style uses explicit file descriptors.\r\n\r\n\r\n<p>\r\nWhen using implicit file descriptors,\r\nall operations are supplied by table <a name=\"pdf-io\"><code>io</code></a>.\r\nWhen using explicit file descriptors,\r\nthe operation <a href=\"#pdf-io.open\"><code>io.open</code></a> returns a file descriptor\r\nand then all operations are supplied as methods of the file descriptor.\r\n\r\n\r\n<p>\r\nThe table <code>io</code> also provides\r\nthree predefined file descriptors with their usual meanings from C:\r\n<a name=\"pdf-io.stdin\"><code>io.stdin</code></a>, <a name=\"pdf-io.stdout\"><code>io.stdout</code></a>, and <a name=\"pdf-io.stderr\"><code>io.stderr</code></a>.\r\nThe I/O library never closes these files.\r\n\r\n\r\n<p>\r\nUnless otherwise stated,\r\nall I/O functions return <b>nil</b> on failure\r\n(plus an error message as a second result and\r\na system-dependent error code as a third result)\r\nand some value different from <b>nil</b> on success.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.close\"><code>io.close ([file])</code></a></h3>\r\n\r\n\r\n<p>\r\nEquivalent to <code>file:close()</code>.\r\nWithout a <code>file</code>, closes the default output file.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.flush\"><code>io.flush ()</code></a></h3>\r\n\r\n\r\n<p>\r\nEquivalent to <code>file:flush</code> over the default output file.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.input\"><code>io.input ([file])</code></a></h3>\r\n\r\n\r\n<p>\r\nWhen called with a file name, it opens the named file (in text mode),\r\nand sets its handle as the default input file.\r\nWhen called with a file handle,\r\nit simply sets this file handle as the default input file.\r\nWhen called without parameters,\r\nit returns the current default input file.\r\n\r\n\r\n<p>\r\nIn case of errors this function raises the error,\r\ninstead of returning an error code.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.lines\"><code>io.lines ([filename])</code></a></h3>\r\n\r\n\r\n<p>\r\nOpens the given file name in read mode\r\nand returns an iterator function that,\r\neach time it is called,\r\nreturns a new line from the file.\r\nTherefore, the construction\r\n\r\n<pre>\r\n     for line in io.lines(filename) do <em>body</em> end\r\n</pre><p>\r\nwill iterate over all lines of the file.\r\nWhen the iterator function detects the end of file,\r\nit returns <b>nil</b> (to finish the loop) and automatically closes the file.\r\n\r\n\r\n<p>\r\nThe call <code>io.lines()</code> (with no file name) is equivalent\r\nto <code>io.input():lines()</code>;\r\nthat is, it iterates over the lines of the default input file.\r\nIn this case it does not close the file when the loop ends.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.open\"><code>io.open (filename [, mode])</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function opens a file,\r\nin the mode specified in the string <code>mode</code>.\r\nIt returns a new file handle,\r\nor, in case of errors, <b>nil</b> plus an error message.\r\n\r\n\r\n<p>\r\nThe <code>mode</code> string can be any of the following:\r\n\r\n<ul>\r\n<li><b>\"r\":</b> read mode (the default);</li>\r\n<li><b>\"w\":</b> write mode;</li>\r\n<li><b>\"a\":</b> append mode;</li>\r\n<li><b>\"r+\":</b> update mode, all previous data is preserved;</li>\r\n<li><b>\"w+\":</b> update mode, all previous data is erased;</li>\r\n<li><b>\"a+\":</b> append update mode, previous data is preserved,\r\n  writing is only allowed at the end of file.</li>\r\n</ul><p>\r\nThe <code>mode</code> string can also have a '<code>b</code>' at the end,\r\nwhich is needed in some systems to open the file in binary mode.\r\nThis string is exactly what is used in the\r\nstandard&nbsp;C function <code>fopen</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.output\"><code>io.output ([file])</code></a></h3>\r\n\r\n\r\n<p>\r\nSimilar to <a href=\"#pdf-io.input\"><code>io.input</code></a>, but operates over the default output file.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.popen\"><code>io.popen (prog [, mode])</code></a></h3>\r\n\r\n\r\n<p>\r\nStarts program <code>prog</code> in a separated process and returns\r\na file handle that you can use to read data from this program\r\n(if <code>mode</code> is <code>\"r\"</code>, the default)\r\nor to write data to this program\r\n(if <code>mode</code> is <code>\"w\"</code>).\r\n\r\n\r\n<p>\r\nThis function is system dependent and is not available\r\non all platforms.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.read\"><code>io.read (&middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nEquivalent to <code>io.input():read</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.tmpfile\"><code>io.tmpfile ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a handle for a temporary file.\r\nThis file is opened in update mode\r\nand it is automatically removed when the program ends.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.type\"><code>io.type (obj)</code></a></h3>\r\n\r\n\r\n<p>\r\nChecks whether <code>obj</code> is a valid file handle.\r\nReturns the string <code>\"file\"</code> if <code>obj</code> is an open file handle,\r\n<code>\"closed file\"</code> if <code>obj</code> is a closed file handle,\r\nor <b>nil</b> if <code>obj</code> is not a file handle.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-io.write\"><code>io.write (&middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nEquivalent to <code>io.output():write</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:close\"><code>file:close ()</code></a></h3>\r\n\r\n\r\n<p>\r\nCloses <code>file</code>.\r\nNote that files are automatically closed when\r\ntheir handles are garbage collected,\r\nbut that takes an unpredictable amount of time to happen.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:flush\"><code>file:flush ()</code></a></h3>\r\n\r\n\r\n<p>\r\nSaves any written data to <code>file</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:lines\"><code>file:lines ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns an iterator function that,\r\neach time it is called,\r\nreturns a new line from the file.\r\nTherefore, the construction\r\n\r\n<pre>\r\n     for line in file:lines() do <em>body</em> end\r\n</pre><p>\r\nwill iterate over all lines of the file.\r\n(Unlike <a href=\"#pdf-io.lines\"><code>io.lines</code></a>, this function does not close the file\r\nwhen the loop ends.)\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:read\"><code>file:read (&middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nReads the file <code>file</code>,\r\naccording to the given formats, which specify what to read.\r\nFor each format,\r\nthe function returns a string (or a number) with the characters read,\r\nor <b>nil</b> if it cannot read data with the specified format.\r\nWhen called without formats,\r\nit uses a default format that reads the entire next line\r\n(see below).\r\n\r\n\r\n<p>\r\nThe available formats are\r\n\r\n<ul>\r\n\r\n<li><b>\"*n\":</b>\r\nreads a number;\r\nthis is the only format that returns a number instead of a string.\r\n</li>\r\n\r\n<li><b>\"*a\":</b>\r\nreads the whole file, starting at the current position.\r\nOn end of file, it returns the empty string.\r\n</li>\r\n\r\n<li><b>\"*l\":</b>\r\nreads the next line (skipping the end of line),\r\nreturning <b>nil</b> on end of file.\r\nThis is the default format.\r\n</li>\r\n\r\n<li><b><em>number</em>:</b>\r\nreads a string with up to this number of characters,\r\nreturning <b>nil</b> on end of file.\r\nIf number is zero,\r\nit reads nothing and returns an empty string,\r\nor <b>nil</b> on end of file.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:seek\"><code>file:seek ([whence] [, offset])</code></a></h3>\r\n\r\n\r\n<p>\r\nSets and gets the file position,\r\nmeasured from the beginning of the file,\r\nto the position given by <code>offset</code> plus a base\r\nspecified by the string <code>whence</code>, as follows:\r\n\r\n<ul>\r\n<li><b>\"set\":</b> base is position 0 (beginning of the file);</li>\r\n<li><b>\"cur\":</b> base is current position;</li>\r\n<li><b>\"end\":</b> base is end of file;</li>\r\n</ul><p>\r\nIn case of success, function <code>seek</code> returns the final file position,\r\nmeasured in bytes from the beginning of the file.\r\nIf this function fails, it returns <b>nil</b>,\r\nplus a string describing the error.\r\n\r\n\r\n<p>\r\nThe default value for <code>whence</code> is <code>\"cur\"</code>,\r\nand for <code>offset</code> is 0.\r\nTherefore, the call <code>file:seek()</code> returns the current\r\nfile position, without changing it;\r\nthe call <code>file:seek(\"set\")</code> sets the position to the\r\nbeginning of the file (and returns 0);\r\nand the call <code>file:seek(\"end\")</code> sets the position to the\r\nend of the file, and returns its size.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:setvbuf\"><code>file:setvbuf (mode [, size])</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the buffering mode for an output file.\r\nThere are three available modes:\r\n\r\n<ul>\r\n\r\n<li><b>\"no\":</b>\r\nno buffering; the result of any output operation appears immediately.\r\n</li>\r\n\r\n<li><b>\"full\":</b>\r\nfull buffering; output operation is performed only\r\nwhen the buffer is full (or when you explicitly <code>flush</code> the file\r\n(see <a href=\"#pdf-io.flush\"><code>io.flush</code></a>)).\r\n</li>\r\n\r\n<li><b>\"line\":</b>\r\nline buffering; output is buffered until a newline is output\r\nor there is any input from some special files\r\n(such as a terminal device).\r\n</li>\r\n\r\n</ul><p>\r\nFor the last two cases, <code>size</code>\r\nspecifies the size of the buffer, in bytes.\r\nThe default is an appropriate size.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-file:write\"><code>file:write (&middot;&middot;&middot;)</code></a></h3>\r\n\r\n\r\n<p>\r\nWrites the value of each of its arguments to\r\nthe <code>file</code>.\r\nThe arguments must be strings or numbers.\r\nTo write other values,\r\nuse <a href=\"#pdf-tostring\"><code>tostring</code></a> or <a href=\"#pdf-string.format\"><code>string.format</code></a> before <code>write</code>.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.8 - <a name=\"5.8\">Operating System Facilities</a></h2>\r\n\r\n<p>\r\nThis library is implemented through table <a name=\"pdf-os\"><code>os</code></a>.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.clock\"><code>os.clock ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns an approximation of the amount in seconds of CPU time\r\nused by the program.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.date\"><code>os.date ([format [, time]])</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a string or a table containing date and time,\r\nformatted according to the given string <code>format</code>.\r\n\r\n\r\n<p>\r\nIf the <code>time</code> argument is present,\r\nthis is the time to be formatted\r\n(see the <a href=\"#pdf-os.time\"><code>os.time</code></a> function for a description of this value).\r\nOtherwise, <code>date</code> formats the current time.\r\n\r\n\r\n<p>\r\nIf <code>format</code> starts with '<code>!</code>',\r\nthen the date is formatted in Coordinated Universal Time.\r\nAfter this optional character,\r\nif <code>format</code> is the string \"<code>*t</code>\",\r\nthen <code>date</code> returns a table with the following fields:\r\n<code>year</code> (four digits), <code>month</code> (1--12), <code>day</code> (1--31),\r\n<code>hour</code> (0--23), <code>min</code> (0--59), <code>sec</code> (0--61),\r\n<code>wday</code> (weekday, Sunday is&nbsp;1),\r\n<code>yday</code> (day of the year),\r\nand <code>isdst</code> (daylight saving flag, a boolean).\r\n\r\n\r\n<p>\r\nIf <code>format</code> is not \"<code>*t</code>\",\r\nthen <code>date</code> returns the date as a string,\r\nformatted according to the same rules as the C&nbsp;function <code>strftime</code>.\r\n\r\n\r\n<p>\r\nWhen called without arguments,\r\n<code>date</code> returns a reasonable date and time representation that depends on\r\nthe host system and on the current locale\r\n(that is, <code>os.date()</code> is equivalent to <code>os.date(\"%c\")</code>).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.difftime\"><code>os.difftime (t2, t1)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the number of seconds from time <code>t1</code> to time <code>t2</code>.\r\nIn POSIX, Windows, and some other systems,\r\nthis value is exactly <code>t2</code><em>-</em><code>t1</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.execute\"><code>os.execute ([command])</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function is equivalent to the C&nbsp;function <code>system</code>.\r\nIt passes <code>command</code> to be executed by an operating system shell.\r\nIt returns a status code, which is system-dependent.\r\nIf <code>command</code> is absent, then it returns nonzero if a shell is available\r\nand zero otherwise.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.exit\"><code>os.exit ([code])</code></a></h3>\r\n\r\n\r\n<p>\r\nCalls the C&nbsp;function <code>exit</code>,\r\nwith an optional <code>code</code>,\r\nto terminate the host program.\r\nThe default value for <code>code</code> is the success code.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.getenv\"><code>os.getenv (varname)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the value of the process environment variable <code>varname</code>,\r\nor <b>nil</b> if the variable is not defined.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.remove\"><code>os.remove (filename)</code></a></h3>\r\n\r\n\r\n<p>\r\nDeletes the file or directory with the given name.\r\nDirectories must be empty to be removed.\r\nIf this function fails, it returns <b>nil</b>,\r\nplus a string describing the error.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.rename\"><code>os.rename (oldname, newname)</code></a></h3>\r\n\r\n\r\n<p>\r\nRenames file or directory named <code>oldname</code> to <code>newname</code>.\r\nIf this function fails, it returns <b>nil</b>,\r\nplus a string describing the error.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.setlocale\"><code>os.setlocale (locale [, category])</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the current locale of the program.\r\n<code>locale</code> is a string specifying a locale;\r\n<code>category</code> is an optional string describing which category to change:\r\n<code>\"all\"</code>, <code>\"collate\"</code>, <code>\"ctype\"</code>,\r\n<code>\"monetary\"</code>, <code>\"numeric\"</code>, or <code>\"time\"</code>;\r\nthe default category is <code>\"all\"</code>.\r\nThe function returns the name of the new locale,\r\nor <b>nil</b> if the request cannot be honored.\r\n\r\n\r\n<p>\r\nIf <code>locale</code> is the empty string,\r\nthe current locale is set to an implementation-defined native locale.\r\nIf <code>locale</code> is the string \"<code>C</code>\",\r\nthe current locale is set to the standard C locale.\r\n\r\n\r\n<p>\r\nWhen called with <b>nil</b> as the first argument,\r\nthis function only returns the name of the current locale\r\nfor the given category.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.time\"><code>os.time ([table])</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the current time when called without arguments,\r\nor a time representing the date and time specified by the given table.\r\nThis table must have fields <code>year</code>, <code>month</code>, and <code>day</code>,\r\nand may have fields <code>hour</code>, <code>min</code>, <code>sec</code>, and <code>isdst</code>\r\n(for a description of these fields, see the <a href=\"#pdf-os.date\"><code>os.date</code></a> function).\r\n\r\n\r\n<p>\r\nThe returned value is a number, whose meaning depends on your system.\r\nIn POSIX, Windows, and some other systems, this number counts the number\r\nof seconds since some given start time (the \"epoch\").\r\nIn other systems, the meaning is not specified,\r\nand the number returned by <code>time</code> can be used only as an argument to\r\n<code>date</code> and <code>difftime</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-os.tmpname\"><code>os.tmpname ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a string with a file name that can\r\nbe used for a temporary file.\r\nThe file must be explicitly opened before its use\r\nand explicitly removed when no longer needed.\r\n\r\n\r\n<p>\r\nOn some systems (POSIX),\r\nthis function also creates a file with that name,\r\nto avoid security risks.\r\n(Someone else might create the file with wrong permissions\r\nin the time between getting the name and creating the file.)\r\nYou still have to open the file to use it\r\nand to remove it (even if you do not use it).\r\n\r\n\r\n<p>\r\nWhen possible,\r\nyou may prefer to use <a href=\"#pdf-io.tmpfile\"><code>io.tmpfile</code></a>,\r\nwhich automatically removes the file when the program ends.\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h2>5.9 - <a name=\"5.9\">The Debug Library</a></h2>\r\n\r\n<p>\r\nThis library provides\r\nthe functionality of the debug interface to Lua programs.\r\nYou should exert care when using this library.\r\nThe functions provided here should be used exclusively for debugging\r\nand similar tasks, such as profiling.\r\nPlease resist the temptation to use them as a\r\nusual programming tool:\r\nthey can be very slow.\r\nMoreover, several of these functions\r\nviolate some assumptions about Lua code\r\n(e.g., that variables local to a function\r\ncannot be accessed from outside or\r\nthat userdata metatables cannot be changed by Lua code)\r\nand therefore can compromise otherwise secure code.\r\n\r\n\r\n<p>\r\nAll functions in this library are provided\r\ninside the <a name=\"pdf-debug\"><code>debug</code></a> table.\r\nAll functions that operate over a thread\r\nhave an optional first argument which is the\r\nthread to operate over.\r\nThe default is always the current thread.\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.debug\"><code>debug.debug ()</code></a></h3>\r\n\r\n\r\n<p>\r\nEnters an interactive mode with the user,\r\nrunning each string that the user enters.\r\nUsing simple commands and other debug facilities,\r\nthe user can inspect global and local variables,\r\nchange their values, evaluate expressions, and so on.\r\nA line containing only the word <code>cont</code> finishes this function,\r\nso that the caller continues its execution.\r\n\r\n\r\n<p>\r\nNote that commands for <code>debug.debug</code> are not lexically nested\r\nwithin any function, and so have no direct access to local variables.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getfenv\"><code>debug.getfenv (o)</code></a></h3>\r\nReturns the environment of object <code>o</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.gethook\"><code>debug.gethook ([thread])</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the current hook settings of the thread, as three values:\r\nthe current hook function, the current hook mask,\r\nand the current hook count\r\n(as set by the <a href=\"#pdf-debug.sethook\"><code>debug.sethook</code></a> function).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getinfo\"><code>debug.getinfo ([thread,] function [, what])</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a table with information about a function.\r\nYou can give the function directly,\r\nor you can give a number as the value of <code>function</code>,\r\nwhich means the function running at level <code>function</code> of the call stack\r\nof the given thread:\r\nlevel&nbsp;0 is the current function (<code>getinfo</code> itself);\r\nlevel&nbsp;1 is the function that called <code>getinfo</code>;\r\nand so on.\r\nIf <code>function</code> is a number larger than the number of active functions,\r\nthen <code>getinfo</code> returns <b>nil</b>.\r\n\r\n\r\n<p>\r\nThe returned table can contain all the fields returned by <a href=\"#lua_getinfo\"><code>lua_getinfo</code></a>,\r\nwith the string <code>what</code> describing which fields to fill in.\r\nThe default for <code>what</code> is to get all information available,\r\nexcept the table of valid lines.\r\nIf present,\r\nthe option '<code>f</code>'\r\nadds a field named <code>func</code> with the function itself.\r\nIf present,\r\nthe option '<code>L</code>'\r\nadds a field named <code>activelines</code> with the table of\r\nvalid lines.\r\n\r\n\r\n<p>\r\nFor instance, the expression <code>debug.getinfo(1,\"n\").name</code> returns\r\na table with a name for the current function,\r\nif a reasonable name can be found,\r\nand the expression <code>debug.getinfo(print)</code>\r\nreturns a table with all available information\r\nabout the <a href=\"#pdf-print\"><code>print</code></a> function.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getlocal\"><code>debug.getlocal ([thread,] level, local)</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function returns the name and the value of the local variable\r\nwith index <code>local</code> of the function at level <code>level</code> of the stack.\r\n(The first parameter or local variable has index&nbsp;1, and so on,\r\nuntil the last active local variable.)\r\nThe function returns <b>nil</b> if there is no local\r\nvariable with the given index,\r\nand raises an error when called with a <code>level</code> out of range.\r\n(You can call <a href=\"#pdf-debug.getinfo\"><code>debug.getinfo</code></a> to check whether the level is valid.)\r\n\r\n\r\n<p>\r\nVariable names starting with '<code>(</code>' (open parentheses)\r\nrepresent internal variables\r\n(loop control variables, temporaries, and C&nbsp;function locals).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getmetatable\"><code>debug.getmetatable (object)</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the metatable of the given <code>object</code>\r\nor <b>nil</b> if it does not have a metatable.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getregistry\"><code>debug.getregistry ()</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns the registry table (see <a href=\"#3.5\">&sect;3.5</a>).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.getupvalue\"><code>debug.getupvalue (func, up)</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function returns the name and the value of the upvalue\r\nwith index <code>up</code> of the function <code>func</code>.\r\nThe function returns <b>nil</b> if there is no upvalue with the given index.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.setfenv\"><code>debug.setfenv (object, table)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the environment of the given <code>object</code> to the given <code>table</code>.\r\nReturns <code>object</code>.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.sethook\"><code>debug.sethook ([thread,] hook, mask [, count])</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the given function as a hook.\r\nThe string <code>mask</code> and the number <code>count</code> describe\r\nwhen the hook will be called.\r\nThe string mask may have the following characters,\r\nwith the given meaning:\r\n\r\n<ul>\r\n<li><b><code>\"c\"</code>:</b> the hook is called every time Lua calls a function;</li>\r\n<li><b><code>\"r\"</code>:</b> the hook is called every time Lua returns from a function;</li>\r\n<li><b><code>\"l\"</code>:</b> the hook is called every time Lua enters a new line of code.</li>\r\n</ul><p>\r\nWith a <code>count</code> different from zero,\r\nthe hook is called after every <code>count</code> instructions.\r\n\r\n\r\n<p>\r\nWhen called without arguments,\r\n<a href=\"#pdf-debug.sethook\"><code>debug.sethook</code></a> turns off the hook.\r\n\r\n\r\n<p>\r\nWhen the hook is called, its first parameter is a string\r\ndescribing the event that has triggered its call:\r\n<code>\"call\"</code>, <code>\"return\"</code> (or <code>\"tail return\"</code>,\r\nwhen simulating a return from a tail call),\r\n<code>\"line\"</code>, and <code>\"count\"</code>.\r\nFor line events,\r\nthe hook also gets the new line number as its second parameter.\r\nInside a hook,\r\nyou can call <code>getinfo</code> with level&nbsp;2 to get more information about\r\nthe running function\r\n(level&nbsp;0 is the <code>getinfo</code> function,\r\nand level&nbsp;1 is the hook function),\r\nunless the event is <code>\"tail return\"</code>.\r\nIn this case, Lua is only simulating the return,\r\nand a call to <code>getinfo</code> will return invalid data.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.setlocal\"><code>debug.setlocal ([thread,] level, local, value)</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function assigns the value <code>value</code> to the local variable\r\nwith index <code>local</code> of the function at level <code>level</code> of the stack.\r\nThe function returns <b>nil</b> if there is no local\r\nvariable with the given index,\r\nand raises an error when called with a <code>level</code> out of range.\r\n(You can call <code>getinfo</code> to check whether the level is valid.)\r\nOtherwise, it returns the name of the local variable.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.setmetatable\"><code>debug.setmetatable (object, table)</code></a></h3>\r\n\r\n\r\n<p>\r\nSets the metatable for the given <code>object</code> to the given <code>table</code>\r\n(which can be <b>nil</b>).\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.setupvalue\"><code>debug.setupvalue (func, up, value)</code></a></h3>\r\n\r\n\r\n<p>\r\nThis function assigns the value <code>value</code> to the upvalue\r\nwith index <code>up</code> of the function <code>func</code>.\r\nThe function returns <b>nil</b> if there is no upvalue\r\nwith the given index.\r\nOtherwise, it returns the name of the upvalue.\r\n\r\n\r\n\r\n\r\n<p>\r\n<hr><h3><a name=\"pdf-debug.traceback\"><code>debug.traceback ([thread,] [message [, level]])</code></a></h3>\r\n\r\n\r\n<p>\r\nReturns a string with a traceback of the call stack.\r\nAn optional <code>message</code> string is appended\r\nat the beginning of the traceback.\r\nAn optional <code>level</code> number tells at which level\r\nto start the traceback\r\n(default is 1, the function calling <code>traceback</code>).\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<h1>6 - <a name=\"6\">Lua Stand-alone</a></h1>\r\n\r\n<p>\r\nAlthough Lua has been designed as an extension language,\r\nto be embedded in a host C&nbsp;program,\r\nit is also frequently used as a stand-alone language.\r\nAn interpreter for Lua as a stand-alone language,\r\ncalled simply <code>lua</code>,\r\nis provided with the standard distribution.\r\nThe stand-alone interpreter includes\r\nall standard libraries, including the debug library.\r\nIts usage is:\r\n\r\n<pre>\r\n     lua [options] [script [args]]\r\n</pre><p>\r\nThe options are:\r\n\r\n<ul>\r\n<li><b><code>-e <em>stat</em></code>:</b> executes string <em>stat</em>;</li>\r\n<li><b><code>-l <em>mod</em></code>:</b> \"requires\" <em>mod</em>;</li>\r\n<li><b><code>-i</code>:</b> enters interactive mode after running <em>script</em>;</li>\r\n<li><b><code>-v</code>:</b> prints version information;</li>\r\n<li><b><code>--</code>:</b> stops handling options;</li>\r\n<li><b><code>-</code>:</b> executes <code>stdin</code> as a file and stops handling options.</li>\r\n</ul><p>\r\nAfter handling its options, <code>lua</code> runs the given <em>script</em>,\r\npassing to it the given <em>args</em> as string arguments.\r\nWhen called without arguments,\r\n<code>lua</code> behaves as <code>lua -v -i</code>\r\nwhen the standard input (<code>stdin</code>) is a terminal,\r\nand as <code>lua -</code> otherwise.\r\n\r\n\r\n<p>\r\nBefore running any argument,\r\nthe interpreter checks for an environment variable <a name=\"pdf-LUA_INIT\"><code>LUA_INIT</code></a>.\r\nIf its format is <code>@<em>filename</em></code>,\r\nthen <code>lua</code> executes the file.\r\nOtherwise, <code>lua</code> executes the string itself.\r\n\r\n\r\n<p>\r\nAll options are handled in order, except <code>-i</code>.\r\nFor instance, an invocation like\r\n\r\n<pre>\r\n     $ lua -e'a=1' -e 'print(a)' script.lua\r\n</pre><p>\r\nwill first set <code>a</code> to 1, then print the value of <code>a</code> (which is '<code>1</code>'),\r\nand finally run the file <code>script.lua</code> with no arguments.\r\n(Here <code>$</code> is the shell prompt. Your prompt may be different.)\r\n\r\n\r\n<p>\r\nBefore starting to run the script,\r\n<code>lua</code> collects all arguments in the command line\r\nin a global table called <code>arg</code>.\r\nThe script name is stored at index 0,\r\nthe first argument after the script name goes to index 1,\r\nand so on.\r\nAny arguments before the script name\r\n(that is, the interpreter name plus the options)\r\ngo to negative indices.\r\nFor instance, in the call\r\n\r\n<pre>\r\n     $ lua -la b.lua t1 t2\r\n</pre><p>\r\nthe interpreter first runs the file <code>a.lua</code>,\r\nthen creates a table\r\n\r\n<pre>\r\n     arg = { [-2] = \"lua\", [-1] = \"-la\",\r\n             [0] = \"b.lua\",\r\n             [1] = \"t1\", [2] = \"t2\" }\r\n</pre><p>\r\nand finally runs the file <code>b.lua</code>.\r\nThe script is called with <code>arg[1]</code>, <code>arg[2]</code>, &middot;&middot;&middot;\r\nas arguments;\r\nit can also access these arguments with the vararg expression '<code>...</code>'.\r\n\r\n\r\n<p>\r\nIn interactive mode,\r\nif you write an incomplete statement,\r\nthe interpreter waits for its completion\r\nby issuing a different prompt.\r\n\r\n\r\n<p>\r\nIf the global variable <a name=\"pdf-_PROMPT\"><code>_PROMPT</code></a> contains a string,\r\nthen its value is used as the prompt.\r\nSimilarly, if the global variable <a name=\"pdf-_PROMPT2\"><code>_PROMPT2</code></a> contains a string,\r\nits value is used as the secondary prompt\r\n(issued during incomplete statements).\r\nTherefore, both prompts can be changed directly on the command line\r\nor in any Lua programs by assigning to <code>_PROMPT</code>.\r\nSee the next example:\r\n\r\n<pre>\r\n     $ lua -e\"_PROMPT='myprompt&gt; '\" -i\r\n</pre><p>\r\n(The outer pair of quotes is for the shell,\r\nthe inner pair is for Lua.)\r\nNote the use of <code>-i</code> to enter interactive mode;\r\notherwise,\r\nthe program would just end silently\r\nright after the assignment to <code>_PROMPT</code>.\r\n\r\n\r\n<p>\r\nTo allow the use of Lua as a\r\nscript interpreter in Unix systems,\r\nthe stand-alone interpreter skips\r\nthe first line of a chunk if it starts with <code>#</code>.\r\nTherefore, Lua scripts can be made into executable programs\r\nby using <code>chmod +x</code> and the&nbsp;<code>#!</code> form,\r\nas in\r\n\r\n<pre>\r\n     #!/usr/local/bin/lua\r\n</pre><p>\r\n(Of course,\r\nthe location of the Lua interpreter may be different in your machine.\r\nIf <code>lua</code> is in your <code>PATH</code>,\r\nthen \r\n\r\n<pre>\r\n     #!/usr/bin/env lua\r\n</pre><p>\r\nis a more portable solution.) \r\n\r\n\r\n\r\n<h1>7 - <a name=\"7\">Incompatibilities with the Previous Version</a></h1>\r\n\r\n<p>\r\nHere we list the incompatibilities that you may find when moving a program\r\nfrom Lua&nbsp;5.0 to Lua&nbsp;5.1.\r\nYou can avoid most of the incompatibilities compiling Lua with\r\nappropriate options (see file <code>luaconf.h</code>).\r\nHowever,\r\nall these compatibility options will be removed in the next version of Lua.\r\n\r\n\r\n\r\n<h2>7.1 - <a name=\"7.1\">Changes in the Language</a></h2>\r\n<ul>\r\n\r\n<li>\r\nThe vararg system changed from the pseudo-argument <code>arg</code> with a\r\ntable with the extra arguments to the vararg expression.\r\n(See compile-time option <code>LUA_COMPAT_VARARG</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n<li>\r\nThere was a subtle change in the scope of the implicit\r\nvariables of the <b>for</b> statement and for the <b>repeat</b> statement.\r\n</li>\r\n\r\n<li>\r\nThe long string/long comment syntax (<code>[[<em>string</em>]]</code>)\r\ndoes not allow nesting.\r\nYou can use the new syntax (<code>[=[<em>string</em>]=]</code>) in these cases.\r\n(See compile-time option <code>LUA_COMPAT_LSTR</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h2>7.2 - <a name=\"7.2\">Changes in the Libraries</a></h2>\r\n<ul>\r\n\r\n<li>\r\nFunction <code>string.gfind</code> was renamed <a href=\"#pdf-string.gmatch\"><code>string.gmatch</code></a>.\r\n(See compile-time option <code>LUA_COMPAT_GFIND</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n<li>\r\nWhen <a href=\"#pdf-string.gsub\"><code>string.gsub</code></a> is called with a function as its\r\nthird argument,\r\nwhenever this function returns <b>nil</b> or <b>false</b> the\r\nreplacement string is the whole match,\r\ninstead of the empty string.\r\n</li>\r\n\r\n<li>\r\nFunction <code>table.setn</code> was deprecated.\r\nFunction <code>table.getn</code> corresponds\r\nto the new length operator (<code>#</code>);\r\nuse the operator instead of the function.\r\n(See compile-time option <code>LUA_COMPAT_GETN</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n<li>\r\nFunction <code>loadlib</code> was renamed <a href=\"#pdf-package.loadlib\"><code>package.loadlib</code></a>.\r\n(See compile-time option <code>LUA_COMPAT_LOADLIB</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n<li>\r\nFunction <code>math.mod</code> was renamed <a href=\"#pdf-math.fmod\"><code>math.fmod</code></a>.\r\n(See compile-time option <code>LUA_COMPAT_MOD</code> in <code>luaconf.h</code>.)\r\n</li>\r\n\r\n<li>\r\nFunctions <code>table.foreach</code> and <code>table.foreachi</code> are deprecated.\r\nYou can use a for loop with <code>pairs</code> or <code>ipairs</code> instead.\r\n</li>\r\n\r\n<li>\r\nThere were substantial changes in function <a href=\"#pdf-require\"><code>require</code></a> due to\r\nthe new module system.\r\nHowever, the new behavior is mostly compatible with the old,\r\nbut <code>require</code> gets the path from <a href=\"#pdf-package.path\"><code>package.path</code></a> instead\r\nof from <code>LUA_PATH</code>.\r\n</li>\r\n\r\n<li>\r\nFunction <a href=\"#pdf-collectgarbage\"><code>collectgarbage</code></a> has different arguments.\r\nFunction <code>gcinfo</code> is deprecated;\r\nuse <code>collectgarbage(\"count\")</code> instead.\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h2>7.3 - <a name=\"7.3\">Changes in the API</a></h2>\r\n<ul>\r\n\r\n<li>\r\nThe <code>luaopen_*</code> functions (to open libraries)\r\ncannot be called directly,\r\nlike a regular C function.\r\nThey must be called through Lua,\r\nlike a Lua function.\r\n</li>\r\n\r\n<li>\r\nFunction <code>lua_open</code> was replaced by <a href=\"#lua_newstate\"><code>lua_newstate</code></a> to\r\nallow the user to set a memory-allocation function.\r\nYou can use <a href=\"#luaL_newstate\"><code>luaL_newstate</code></a> from the standard library to\r\ncreate a state with a standard allocation function\r\n(based on <code>realloc</code>).\r\n</li>\r\n\r\n<li>\r\nFunctions <code>luaL_getn</code> and <code>luaL_setn</code>\r\n(from the auxiliary library) are deprecated.\r\nUse <a href=\"#lua_objlen\"><code>lua_objlen</code></a> instead of <code>luaL_getn</code>\r\nand nothing instead of <code>luaL_setn</code>.\r\n</li>\r\n\r\n<li>\r\nFunction <code>luaL_openlib</code> was replaced by <a href=\"#luaL_register\"><code>luaL_register</code></a>.\r\n</li>\r\n\r\n<li>\r\nFunction <code>luaL_checkudata</code> now throws an error when the given value\r\nis not a userdata of the expected type.\r\n(In Lua&nbsp;5.0 it returned <code>NULL</code>.)\r\n</li>\r\n\r\n</ul>\r\n\r\n\r\n\r\n\r\n<h1>8 - <a name=\"8\">The Complete Syntax of Lua</a></h1>\r\n\r\n<p>\r\nHere is the complete syntax of Lua in extended BNF.\r\n(It does not describe operator precedences.)\r\n\r\n\r\n\r\n\r\n<pre>\r\n\r\n\tchunk ::= {stat [`<b>;</b>&acute;]} [laststat [`<b>;</b>&acute;]]\r\n\r\n\tblock ::= chunk\r\n\r\n\tstat ::=  varlist `<b>=</b>&acute; explist | \r\n\t\t functioncall | \r\n\t\t <b>do</b> block <b>end</b> | \r\n\t\t <b>while</b> exp <b>do</b> block <b>end</b> | \r\n\t\t <b>repeat</b> block <b>until</b> exp | \r\n\t\t <b>if</b> exp <b>then</b> block {<b>elseif</b> exp <b>then</b> block} [<b>else</b> block] <b>end</b> | \r\n\t\t <b>for</b> Name `<b>=</b>&acute; exp `<b>,</b>&acute; exp [`<b>,</b>&acute; exp] <b>do</b> block <b>end</b> | \r\n\t\t <b>for</b> namelist <b>in</b> explist <b>do</b> block <b>end</b> | \r\n\t\t <b>function</b> funcname funcbody | \r\n\t\t <b>local</b> <b>function</b> Name funcbody | \r\n\t\t <b>local</b> namelist [`<b>=</b>&acute; explist] \r\n\r\n\tlaststat ::= <b>return</b> [explist] | <b>break</b>\r\n\r\n\tfuncname ::= Name {`<b>.</b>&acute; Name} [`<b>:</b>&acute; Name]\r\n\r\n\tvarlist ::= var {`<b>,</b>&acute; var}\r\n\r\n\tvar ::=  Name | prefixexp `<b>[</b>&acute; exp `<b>]</b>&acute; | prefixexp `<b>.</b>&acute; Name \r\n\r\n\tnamelist ::= Name {`<b>,</b>&acute; Name}\r\n\r\n\texplist ::= {exp `<b>,</b>&acute;} exp\r\n\r\n\texp ::=  <b>nil</b> | <b>false</b> | <b>true</b> | Number | String | `<b>...</b>&acute; | function | \r\n\t\t prefixexp | tableconstructor | exp binop exp | unop exp \r\n\r\n\tprefixexp ::= var | functioncall | `<b>(</b>&acute; exp `<b>)</b>&acute;\r\n\r\n\tfunctioncall ::=  prefixexp args | prefixexp `<b>:</b>&acute; Name args \r\n\r\n\targs ::=  `<b>(</b>&acute; [explist] `<b>)</b>&acute; | tableconstructor | String \r\n\r\n\tfunction ::= <b>function</b> funcbody\r\n\r\n\tfuncbody ::= `<b>(</b>&acute; [parlist] `<b>)</b>&acute; block <b>end</b>\r\n\r\n\tparlist ::= namelist [`<b>,</b>&acute; `<b>...</b>&acute;] | `<b>...</b>&acute;\r\n\r\n\ttableconstructor ::= `<b>{</b>&acute; [fieldlist] `<b>}</b>&acute;\r\n\r\n\tfieldlist ::= field {fieldsep field} [fieldsep]\r\n\r\n\tfield ::= `<b>[</b>&acute; exp `<b>]</b>&acute; `<b>=</b>&acute; exp | Name `<b>=</b>&acute; exp | exp\r\n\r\n\tfieldsep ::= `<b>,</b>&acute; | `<b>;</b>&acute;\r\n\r\n\tbinop ::= `<b>+</b>&acute; | `<b>-</b>&acute; | `<b>*</b>&acute; | `<b>/</b>&acute; | `<b>^</b>&acute; | `<b>%</b>&acute; | `<b>..</b>&acute; | \r\n\t\t `<b>&lt;</b>&acute; | `<b>&lt;=</b>&acute; | `<b>&gt;</b>&acute; | `<b>&gt;=</b>&acute; | `<b>==</b>&acute; | `<b>~=</b>&acute; | \r\n\t\t <b>and</b> | <b>or</b>\r\n\r\n\tunop ::= `<b>-</b>&acute; | <b>not</b> | `<b>#</b>&acute;\r\n\r\n</pre>\r\n\r\n<p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n<HR>\r\n<SMALL CLASS=\"footer\">\r\nLast update:\r\nMon Feb 13 18:54:19 BRST 2012\r\n</SMALL>\r\n<!--\r\nLast change: revised for Lua 5.1.5\r\n-->\r\n\r\n</body></html>\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/doc/readme.html",
    "content": "<HTML>\r\n<HEAD>\r\n<TITLE>Lua documentation</TITLE>\r\n<LINK REL=\"stylesheet\" TYPE=\"text/css\" HREF=\"lua.css\">\r\n</HEAD>\r\n\r\n<BODY>\r\n\r\n<HR>\r\n<H1>\r\n<A HREF=\"http://www.lua.org/\"><IMG SRC=\"logo.gif\" ALT=\"Lua\" BORDER=0></A>\r\nDocumentation\r\n</H1>\r\n\r\nThis is the documentation included in the source distribution of Lua 5.1.5.\r\n\r\n<UL>\r\n<LI><A HREF=\"contents.html\">Reference manual</A>\r\n<LI><A HREF=\"lua.html\">lua man page</A>\r\n<LI><A HREF=\"luac.html\">luac man page</A>\r\n<LI><A HREF=\"../README\">lua/README</A>\r\n<LI><A HREF=\"../etc/README\">lua/etc/README</A>\r\n<LI><A HREF=\"../test/README\">lua/test/README</A>\r\n</UL>\r\n\r\nLua's\r\n<A HREF=\"http://www.lua.org/\">official web site</A>\r\ncontains updated documentation,\r\nespecially the\r\n<A HREF=\"http://www.lua.org/manual/5.1/\">reference manual</A>.\r\n<P>\r\n\r\n<HR>\r\n<SMALL>\r\nLast update:\r\nFri Feb  3 09:44:42 BRST 2012\r\n</SMALL>\r\n\r\n</BODY>\r\n</HTML>\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/Makefile",
    "content": "# makefile for Lua etc\r\n\r\nTOP= ..\r\nLIB= $(TOP)/src\r\nINC= $(TOP)/src\r\nBIN= $(TOP)/src\r\nSRC= $(TOP)/src\r\nTST= $(TOP)/test\r\n\r\nCC= gcc\r\nCFLAGS= -O2 -Wall -I$(INC) $(MYCFLAGS)\r\nMYCFLAGS= \r\nMYLDFLAGS= -Wl,-E\r\nMYLIBS= -lm\r\n#MYLIBS= -lm -Wl,-E -ldl -lreadline -lhistory -lncurses\r\nRM= rm -f\r\n\r\ndefault:\r\n\t@echo 'Please choose a target: min noparser one strict clean'\r\n\r\nmin:\tmin.c\r\n\t$(CC) $(CFLAGS) $@.c -L$(LIB) -llua $(MYLIBS)\r\n\techo 'print\"Hello there!\"' | ./a.out\r\n\r\nnoparser: noparser.o\r\n\t$(CC) noparser.o $(SRC)/lua.o -L$(LIB) -llua $(MYLIBS)\r\n\t$(BIN)/luac $(TST)/hello.lua\r\n\t-./a.out luac.out\r\n\t-./a.out -e'a=1'\r\n\r\none:\r\n\t$(CC) $(CFLAGS) all.c $(MYLIBS)\r\n\t./a.out $(TST)/hello.lua\r\n\r\nstrict:\r\n\t-$(BIN)/lua -e 'print(a);b=2'\r\n\t-$(BIN)/lua -lstrict -e 'print(a)'\r\n\t-$(BIN)/lua -e 'function f() b=2 end f()'\r\n\t-$(BIN)/lua -lstrict -e 'function f() b=2 end f()'\r\n\r\nclean:\r\n\t$(RM) a.out core core.* *.o luac.out\r\n\r\n.PHONY:\tdefault min noparser one strict clean\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/README",
    "content": "This directory contains some useful files and code.\r\nUnlike the code in ../src, everything here is in the public domain.\r\n\r\nIf any of the makes fail, you're probably not using the same libraries\r\nused to build Lua. Set MYLIBS in Makefile accordingly.\r\n\r\nall.c\r\n\tFull Lua interpreter in a single file.\r\n\tDo \"make one\" for a demo.\r\n\r\nlua.hpp\r\n\tLua header files for C++ using 'extern \"C\"'.\r\n\r\nlua.ico\r\n\tA Lua icon for Windows (and web sites: save as favicon.ico).\r\n\tDrawn by hand by Markus Gritsch <gritsch@iue.tuwien.ac.at>.\r\n\r\nlua.pc\r\n\tpkg-config data for Lua\r\n\r\nluavs.bat\r\n\tScript to build Lua under \"Visual Studio .NET Command Prompt\".\r\n\tRun it from the toplevel as etc\\luavs.bat.\r\n\r\nmin.c\r\n\tA minimal Lua interpreter.\r\n\tGood for learning and for starting your own.\r\n\tDo \"make min\" for a demo.\r\n\r\nnoparser.c\r\n\tLinking with noparser.o avoids loading the parsing modules in lualib.a.\r\n\tDo \"make noparser\" for a demo.\r\n\r\nstrict.lua\r\n\tTraps uses of undeclared global variables.\r\n\tDo \"make strict\" for a demo.\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/all.c",
    "content": "/*\r\n* all.c -- Lua core, libraries and interpreter in a single file\r\n*/\r\n\r\n#define luaall_c\r\n\r\n#include \"lapi.c\"\r\n#include \"lcode.c\"\r\n#include \"ldebug.c\"\r\n#include \"ldo.c\"\r\n#include \"ldump.c\"\r\n#include \"lfunc.c\"\r\n#include \"lgc.c\"\r\n#include \"llex.c\"\r\n#include \"lmem.c\"\r\n#include \"lobject.c\"\r\n#include \"lopcodes.c\"\r\n#include \"lparser.c\"\r\n#include \"lstate.c\"\r\n#include \"lstring.c\"\r\n#include \"ltable.c\"\r\n#include \"ltm.c\"\r\n#include \"lundump.c\"\r\n#include \"lvm.c\"\r\n#include \"lzio.c\"\r\n\r\n#include \"lauxlib.c\"\r\n#include \"lbaselib.c\"\r\n#include \"ldblib.c\"\r\n#include \"liolib.c\"\r\n#include \"linit.c\"\r\n#include \"lmathlib.c\"\r\n#include \"loadlib.c\"\r\n#include \"loslib.c\"\r\n#include \"lstrlib.c\"\r\n#include \"ltablib.c\"\r\n\r\n#include \"lua.c\"\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/lua.hpp",
    "content": "// lua.hpp\r\n// Lua header files for C++\r\n// <<extern \"C\">> not supplied automatically because Lua also compiles as C++\r\n\r\nextern \"C\" {\r\n#include \"lua.h\"\r\n#include \"lualib.h\"\r\n#include \"lauxlib.h\"\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/lua.pc",
    "content": "# lua.pc -- pkg-config data for Lua\r\n\r\n# vars from install Makefile\r\n\r\n# grep '^V=' ../Makefile\r\nV= 5.1\r\n# grep '^R=' ../Makefile\r\nR= 5.1.5\r\n\r\n# grep '^INSTALL_.*=' ../Makefile | sed 's/INSTALL_TOP/prefix/'\r\nprefix= /usr/local\r\nINSTALL_BIN= ${prefix}/bin\r\nINSTALL_INC= ${prefix}/include\r\nINSTALL_LIB= ${prefix}/lib\r\nINSTALL_MAN= ${prefix}/man/man1\r\nINSTALL_LMOD= ${prefix}/share/lua/${V}\r\nINSTALL_CMOD= ${prefix}/lib/lua/${V}\r\n\r\n# canonical vars\r\nexec_prefix=${prefix}\r\nlibdir=${exec_prefix}/lib\r\nincludedir=${prefix}/include\r\n\r\nName: Lua\r\nDescription: An Extensible Extension Language\r\nVersion: ${R}\r\nRequires: \r\nLibs: -L${libdir} -llua -lm\r\nCflags: -I${includedir}\r\n\r\n# (end of lua.pc)\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/luavs.bat",
    "content": "@rem Script to build Lua under \"Visual Studio .NET Command Prompt\".\r\n@rem Do not run from this directory; run it from the toplevel: etc\\luavs.bat .\r\n@rem It creates lua51.dll, lua51.lib, lua.exe, and luac.exe in src.\r\n@rem (contributed by David Manura and Mike Pall)\r\n\r\n@setlocal\r\n@set MYCOMPILE=cl /nologo /MD /O2 /W3 /c /D_CRT_SECURE_NO_DEPRECATE\r\n@set MYLINK=link /nologo\r\n@set MYMT=mt /nologo\r\n\r\ncd src\r\n%MYCOMPILE% /DLUA_BUILD_AS_DLL l*.c\r\ndel lua.obj luac.obj\r\n%MYLINK% /DLL /out:lua51.dll l*.obj\r\nif exist lua51.dll.manifest^\r\n  %MYMT% -manifest lua51.dll.manifest -outputresource:lua51.dll;2\r\n%MYCOMPILE% /DLUA_BUILD_AS_DLL lua.c\r\n%MYLINK% /out:lua.exe lua.obj lua51.lib\r\nif exist lua.exe.manifest^\r\n  %MYMT% -manifest lua.exe.manifest -outputresource:lua.exe\r\n%MYCOMPILE% l*.c print.c\r\ndel lua.obj linit.obj lbaselib.obj ldblib.obj liolib.obj lmathlib.obj^\r\n    loslib.obj ltablib.obj lstrlib.obj loadlib.obj\r\n%MYLINK% /out:luac.exe *.obj\r\nif exist luac.exe.manifest^\r\n  %MYMT% -manifest luac.exe.manifest -outputresource:luac.exe\r\ndel *.obj *.manifest\r\ncd ..\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/min.c",
    "content": "/*\r\n* min.c -- a minimal Lua interpreter\r\n* loads stdin only with minimal error handling.\r\n* no interaction, and no standard library, only a \"print\" function.\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\nstatic int print(lua_State *L)\r\n{\r\n int n=lua_gettop(L);\r\n int i;\r\n for (i=1; i<=n; i++)\r\n {\r\n  if (i>1) printf(\"\\t\");\r\n  if (lua_isstring(L,i))\r\n   printf(\"%s\",lua_tostring(L,i));\r\n  else if (lua_isnil(L,i))\r\n   printf(\"%s\",\"nil\");\r\n  else if (lua_isboolean(L,i))\r\n   printf(\"%s\",lua_toboolean(L,i) ? \"true\" : \"false\");\r\n  else\r\n   printf(\"%s:%p\",luaL_typename(L,i),lua_topointer(L,i));\r\n }\r\n printf(\"\\n\");\r\n return 0;\r\n}\r\n\r\nint main(void)\r\n{\r\n lua_State *L=lua_open();\r\n lua_register(L,\"print\",print);\r\n if (luaL_dofile(L,NULL)!=0) fprintf(stderr,\"%s\\n\",lua_tostring(L,-1));\r\n lua_close(L);\r\n return 0;\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/noparser.c",
    "content": "/*\r\n* The code below can be used to make a Lua core that does not contain the\r\n* parsing modules (lcode, llex, lparser), which represent 35% of the total core.\r\n* You'll only be able to load binary files and strings, precompiled with luac.\r\n* (Of course, you'll have to build luac with the original parsing modules!)\r\n*\r\n* To use this module, simply compile it (\"make noparser\" does that) and list\r\n* its object file before the Lua libraries. The linker should then not load\r\n* the parsing modules. To try it, do \"make luab\".\r\n*\r\n* If you also want to avoid the dump module (ldump.o), define NODUMP.\r\n* #define NODUMP\r\n*/\r\n\r\n#define LUA_CORE\r\n\r\n#include \"llex.h\"\r\n#include \"lparser.h\"\r\n#include \"lzio.h\"\r\n\r\nLUAI_FUNC void luaX_init (lua_State *L) {\r\n  UNUSED(L);\r\n}\r\n\r\nLUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {\r\n  UNUSED(z);\r\n  UNUSED(buff);\r\n  UNUSED(name);\r\n  lua_pushliteral(L,\"parser not loaded\");\r\n  lua_error(L);\r\n  return NULL;\r\n}\r\n\r\n#ifdef NODUMP\r\n#include \"lundump.h\"\r\n\r\nLUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) {\r\n  UNUSED(f);\r\n  UNUSED(w);\r\n  UNUSED(data);\r\n  UNUSED(strip);\r\n#if 1\r\n  UNUSED(L);\r\n  return 0;\r\n#else\r\n  lua_pushliteral(L,\"dumper not loaded\");\r\n  lua_error(L);\r\n#endif\r\n}\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/etc/strict.lua",
    "content": "--\r\n-- strict.lua\r\n-- checks uses of undeclared global variables\r\n-- All global variables must be 'declared' through a regular assignment\r\n-- (even assigning nil will do) in a main chunk before being used\r\n-- anywhere or assigned to inside a function.\r\n--\r\n\r\nlocal getinfo, error, rawset, rawget = debug.getinfo, error, rawset, rawget\r\n\r\nlocal mt = getmetatable(_G)\r\nif mt == nil then\r\n  mt = {}\r\n  setmetatable(_G, mt)\r\nend\r\n\r\nmt.__declared = {}\r\n\r\nlocal function what ()\r\n  local d = getinfo(3, \"S\")\r\n  return d and d.what or \"C\"\r\nend\r\n\r\nmt.__newindex = function (t, n, v)\r\n  if not mt.__declared[n] then\r\n    local w = what()\r\n    if w ~= \"main\" and w ~= \"C\" then\r\n      error(\"assign to undeclared variable '\"..n..\"'\", 2)\r\n    end\r\n    mt.__declared[n] = true\r\n  end\r\n  rawset(t, n, v)\r\nend\r\n  \r\nmt.__index = function (t, n)\r\n  if not mt.__declared[n] and what() ~= \"C\" then\r\n    error(\"variable '\"..n..\"' is not declared\", 2)\r\n  end\r\n  return rawget(t, n)\r\nend\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua/Info.plist",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>CFBundleDevelopmentRegion</key>\r\n\t<string>en</string>\r\n\t<key>CFBundleExecutable</key>\r\n\t<string>$(EXECUTABLE_NAME)</string>\r\n\t<key>CFBundleIdentifier</key>\r\n\t<string>com.sineysoft.$(PRODUCT_NAME:rfc1034identifier)</string>\r\n\t<key>CFBundleInfoDictionaryVersion</key>\r\n\t<string>6.0</string>\r\n\t<key>CFBundleName</key>\r\n\t<string>$(PRODUCT_NAME)</string>\r\n\t<key>CFBundlePackageType</key>\r\n\t<string>BNDL</string>\r\n\t<key>CFBundleShortVersionString</key>\r\n\t<string>1.0</string>\r\n\t<key>CFBundleSignature</key>\r\n\t<string>????</string>\r\n\t<key>CFBundleVersion</key>\r\n\t<string>1</string>\r\n\t<key>NSHumanReadableCopyright</key>\r\n\t<string>Copyright © 2015年 Pang Weiwei. All rights reserved.</string>\r\n\t<key>NSPrincipalClass</key>\r\n\t<string></string>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/project.pbxproj",
    "content": "// !$*UTF8*$!\r\n{\r\n\tarchiveVersion = 1;\r\n\tclasses = {\r\n\t};\r\n\tobjectVersion = 46;\r\n\tobjects = {\r\n\r\n/* Begin PBXBuildFile section */\r\n\t\tE8091A131B74553E008FED27 /* lapi.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919F51B74553E008FED27 /* lapi.c */; };\r\n\t\tE8091A141B74553E008FED27 /* lauxlib.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919F61B74553E008FED27 /* lauxlib.c */; };\r\n\t\tE8091A151B74553E008FED27 /* lbaselib.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919F71B74553E008FED27 /* lbaselib.c */; };\r\n\t\tE8091A161B74553E008FED27 /* lcode.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919F81B74553E008FED27 /* lcode.c */; };\r\n\t\tE8091A171B74553E008FED27 /* ldblib.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919F91B74553E008FED27 /* ldblib.c */; };\r\n\t\tE8091A181B74553E008FED27 /* ldebug.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FA1B74553E008FED27 /* ldebug.c */; };\r\n\t\tE8091A191B74553E008FED27 /* ldo.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FB1B74553E008FED27 /* ldo.c */; };\r\n\t\tE8091A1A1B74553E008FED27 /* ldump.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FC1B74553E008FED27 /* ldump.c */; };\r\n\t\tE8091A1B1B74553E008FED27 /* lfunc.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FD1B74553E008FED27 /* lfunc.c */; };\r\n\t\tE8091A1C1B74553E008FED27 /* lgc.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FE1B74553E008FED27 /* lgc.c */; };\r\n\t\tE8091A1D1B74553E008FED27 /* linit.c in Sources */ = {isa = PBXBuildFile; fileRef = E80919FF1B74553E008FED27 /* linit.c */; };\r\n\t\tE8091A1E1B74553E008FED27 /* liolib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A001B74553E008FED27 /* liolib.c */; };\r\n\t\tE8091A1F1B74553E008FED27 /* llex.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A011B74553E008FED27 /* llex.c */; };\r\n\t\tE8091A201B74553E008FED27 /* lmathlib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A021B74553E008FED27 /* lmathlib.c */; };\r\n\t\tE8091A211B74553E008FED27 /* lmem.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A031B74553E008FED27 /* lmem.c */; };\r\n\t\tE8091A221B74553E008FED27 /* loadlib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A041B74553E008FED27 /* loadlib.c */; };\r\n\t\tE8091A231B74553E008FED27 /* lobject.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A051B74553E008FED27 /* lobject.c */; };\r\n\t\tE8091A241B74553E008FED27 /* lopcodes.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A061B74553E008FED27 /* lopcodes.c */; };\r\n\t\tE8091A251B74553E008FED27 /* loslib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A071B74553E008FED27 /* loslib.c */; };\r\n\t\tE8091A261B74553E008FED27 /* lparser.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A081B74553E008FED27 /* lparser.c */; };\r\n\t\tE8091A271B74553E008FED27 /* lstate.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A091B74553E008FED27 /* lstate.c */; };\r\n\t\tE8091A281B74553E008FED27 /* lstring.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0A1B74553E008FED27 /* lstring.c */; };\r\n\t\tE8091A291B74553E008FED27 /* lstrlib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0B1B74553E008FED27 /* lstrlib.c */; };\r\n\t\tE8091A2A1B74553E008FED27 /* ltable.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0C1B74553E008FED27 /* ltable.c */; };\r\n\t\tE8091A2B1B74553E008FED27 /* ltablib.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0D1B74553E008FED27 /* ltablib.c */; };\r\n\t\tE8091A2C1B74553E008FED27 /* ltm.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0E1B74553E008FED27 /* ltm.c */; };\r\n\t\tE8091A2D1B74553E008FED27 /* lundump.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A0F1B74553E008FED27 /* lundump.c */; };\r\n\t\tE8091A2E1B74553E008FED27 /* lvm.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A101B74553E008FED27 /* lvm.c */; };\r\n\t\tE8091A2F1B74553E008FED27 /* lzio.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A111B74553E008FED27 /* lzio.c */; };\r\n\t\tE8091A301B74553E008FED27 /* print.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A121B74553E008FED27 /* print.c */; };\r\n\t\tE8091A321B745553008FED27 /* slua.c in Sources */ = {isa = PBXBuildFile; fileRef = E8091A311B745553008FED27 /* slua.c */; };\r\n/* End PBXBuildFile section */\r\n\r\n/* Begin PBXFileReference section */\r\n\t\tE80919D41B745519008FED27 /* slua.bundle */ = {isa = PBXFileReference; explicitFileType = wrapper.cfbundle; includeInIndex = 0; path = slua.bundle; sourceTree = BUILT_PRODUCTS_DIR; };\r\n\t\tE80919D81B745519008FED27 /* Info.plist */ = {isa = PBXFileReference; lastKnownFileType = text.plist.xml; path = Info.plist; sourceTree = \"<group>\"; };\r\n\t\tE80919DE1B74553E008FED27 /* lapi.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lapi.h; path = ../src/lapi.h; sourceTree = \"<group>\"; };\r\n\t\tE80919DF1B74553E008FED27 /* lauxlib.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lauxlib.h; path = ../src/lauxlib.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E01B74553E008FED27 /* lcode.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lcode.h; path = ../src/lcode.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E11B74553E008FED27 /* ldebug.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ldebug.h; path = ../src/ldebug.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E21B74553E008FED27 /* ldo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ldo.h; path = ../src/ldo.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E31B74553E008FED27 /* lfunc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lfunc.h; path = ../src/lfunc.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E41B74553E008FED27 /* lgc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lgc.h; path = ../src/lgc.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E51B74553E008FED27 /* llex.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = llex.h; path = ../src/llex.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E61B74553E008FED27 /* llimits.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = llimits.h; path = ../src/llimits.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E71B74553E008FED27 /* lmem.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lmem.h; path = ../src/lmem.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E81B74553E008FED27 /* lobject.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lobject.h; path = ../src/lobject.h; sourceTree = \"<group>\"; };\r\n\t\tE80919E91B74553E008FED27 /* lopcodes.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lopcodes.h; path = ../src/lopcodes.h; sourceTree = \"<group>\"; };\r\n\t\tE80919EA1B74553E008FED27 /* lparser.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lparser.h; path = ../src/lparser.h; sourceTree = \"<group>\"; };\r\n\t\tE80919EB1B74553E008FED27 /* lstate.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lstate.h; path = ../src/lstate.h; sourceTree = \"<group>\"; };\r\n\t\tE80919EC1B74553E008FED27 /* lstring.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lstring.h; path = ../src/lstring.h; sourceTree = \"<group>\"; };\r\n\t\tE80919ED1B74553E008FED27 /* ltable.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ltable.h; path = ../src/ltable.h; sourceTree = \"<group>\"; };\r\n\t\tE80919EE1B74553E008FED27 /* ltm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ltm.h; path = ../src/ltm.h; sourceTree = \"<group>\"; };\r\n\t\tE80919EF1B74553E008FED27 /* lua.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lua.h; path = ../src/lua.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F01B74553E008FED27 /* luaconf.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = luaconf.h; path = ../src/luaconf.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F11B74553E008FED27 /* lualib.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lualib.h; path = ../src/lualib.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F21B74553E008FED27 /* lundump.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lundump.h; path = ../src/lundump.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F31B74553E008FED27 /* lvm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lvm.h; path = ../src/lvm.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F41B74553E008FED27 /* lzio.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lzio.h; path = ../src/lzio.h; sourceTree = \"<group>\"; };\r\n\t\tE80919F51B74553E008FED27 /* lapi.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lapi.c; path = ../src/lapi.c; sourceTree = \"<group>\"; };\r\n\t\tE80919F61B74553E008FED27 /* lauxlib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lauxlib.c; path = ../src/lauxlib.c; sourceTree = \"<group>\"; };\r\n\t\tE80919F71B74553E008FED27 /* lbaselib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lbaselib.c; path = ../src/lbaselib.c; sourceTree = \"<group>\"; };\r\n\t\tE80919F81B74553E008FED27 /* lcode.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lcode.c; path = ../src/lcode.c; sourceTree = \"<group>\"; };\r\n\t\tE80919F91B74553E008FED27 /* ldblib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ldblib.c; path = ../src/ldblib.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FA1B74553E008FED27 /* ldebug.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ldebug.c; path = ../src/ldebug.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FB1B74553E008FED27 /* ldo.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ldo.c; path = ../src/ldo.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FC1B74553E008FED27 /* ldump.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ldump.c; path = ../src/ldump.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FD1B74553E008FED27 /* lfunc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lfunc.c; path = ../src/lfunc.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FE1B74553E008FED27 /* lgc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lgc.c; path = ../src/lgc.c; sourceTree = \"<group>\"; };\r\n\t\tE80919FF1B74553E008FED27 /* linit.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = linit.c; path = ../src/linit.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A001B74553E008FED27 /* liolib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = liolib.c; path = ../src/liolib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A011B74553E008FED27 /* llex.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = llex.c; path = ../src/llex.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A021B74553E008FED27 /* lmathlib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lmathlib.c; path = ../src/lmathlib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A031B74553E008FED27 /* lmem.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lmem.c; path = ../src/lmem.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A041B74553E008FED27 /* loadlib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = loadlib.c; path = ../src/loadlib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A051B74553E008FED27 /* lobject.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lobject.c; path = ../src/lobject.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A061B74553E008FED27 /* lopcodes.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lopcodes.c; path = ../src/lopcodes.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A071B74553E008FED27 /* loslib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = loslib.c; path = ../src/loslib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A081B74553E008FED27 /* lparser.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lparser.c; path = ../src/lparser.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A091B74553E008FED27 /* lstate.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lstate.c; path = ../src/lstate.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0A1B74553E008FED27 /* lstring.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lstring.c; path = ../src/lstring.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0B1B74553E008FED27 /* lstrlib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lstrlib.c; path = ../src/lstrlib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0C1B74553E008FED27 /* ltable.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ltable.c; path = ../src/ltable.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0D1B74553E008FED27 /* ltablib.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ltablib.c; path = ../src/ltablib.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0E1B74553E008FED27 /* ltm.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = ltm.c; path = ../src/ltm.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A0F1B74553E008FED27 /* lundump.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lundump.c; path = ../src/lundump.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A101B74553E008FED27 /* lvm.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lvm.c; path = ../src/lvm.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A111B74553E008FED27 /* lzio.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = lzio.c; path = ../src/lzio.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A121B74553E008FED27 /* print.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = print.c; path = ../src/print.c; sourceTree = \"<group>\"; };\r\n\t\tE8091A311B745553008FED27 /* slua.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = slua.c; path = ../../slua.c; sourceTree = \"<group>\"; };\r\n/* End PBXFileReference section */\r\n\r\n/* Begin PBXFrameworksBuildPhase section */\r\n\t\tE80919D11B745519008FED27 /* Frameworks */ = {\r\n\t\t\tisa = PBXFrameworksBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXFrameworksBuildPhase section */\r\n\r\n/* Begin PBXGroup section */\r\n\t\tE80919CB1B745519008FED27 = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE8091A311B745553008FED27 /* slua.c */,\r\n\t\t\t\tE80919DE1B74553E008FED27 /* lapi.h */,\r\n\t\t\t\tE80919DF1B74553E008FED27 /* lauxlib.h */,\r\n\t\t\t\tE80919E01B74553E008FED27 /* lcode.h */,\r\n\t\t\t\tE80919E11B74553E008FED27 /* ldebug.h */,\r\n\t\t\t\tE80919E21B74553E008FED27 /* ldo.h */,\r\n\t\t\t\tE80919E31B74553E008FED27 /* lfunc.h */,\r\n\t\t\t\tE80919E41B74553E008FED27 /* lgc.h */,\r\n\t\t\t\tE80919E51B74553E008FED27 /* llex.h */,\r\n\t\t\t\tE80919E61B74553E008FED27 /* llimits.h */,\r\n\t\t\t\tE80919E71B74553E008FED27 /* lmem.h */,\r\n\t\t\t\tE80919E81B74553E008FED27 /* lobject.h */,\r\n\t\t\t\tE80919E91B74553E008FED27 /* lopcodes.h */,\r\n\t\t\t\tE80919EA1B74553E008FED27 /* lparser.h */,\r\n\t\t\t\tE80919EB1B74553E008FED27 /* lstate.h */,\r\n\t\t\t\tE80919EC1B74553E008FED27 /* lstring.h */,\r\n\t\t\t\tE80919ED1B74553E008FED27 /* ltable.h */,\r\n\t\t\t\tE80919EE1B74553E008FED27 /* ltm.h */,\r\n\t\t\t\tE80919EF1B74553E008FED27 /* lua.h */,\r\n\t\t\t\tE80919F01B74553E008FED27 /* luaconf.h */,\r\n\t\t\t\tE80919F11B74553E008FED27 /* lualib.h */,\r\n\t\t\t\tE80919F21B74553E008FED27 /* lundump.h */,\r\n\t\t\t\tE80919F31B74553E008FED27 /* lvm.h */,\r\n\t\t\t\tE80919F41B74553E008FED27 /* lzio.h */,\r\n\t\t\t\tE80919F51B74553E008FED27 /* lapi.c */,\r\n\t\t\t\tE80919F61B74553E008FED27 /* lauxlib.c */,\r\n\t\t\t\tE80919F71B74553E008FED27 /* lbaselib.c */,\r\n\t\t\t\tE80919F81B74553E008FED27 /* lcode.c */,\r\n\t\t\t\tE80919F91B74553E008FED27 /* ldblib.c */,\r\n\t\t\t\tE80919FA1B74553E008FED27 /* ldebug.c */,\r\n\t\t\t\tE80919FB1B74553E008FED27 /* ldo.c */,\r\n\t\t\t\tE80919FC1B74553E008FED27 /* ldump.c */,\r\n\t\t\t\tE80919FD1B74553E008FED27 /* lfunc.c */,\r\n\t\t\t\tE80919FE1B74553E008FED27 /* lgc.c */,\r\n\t\t\t\tE80919FF1B74553E008FED27 /* linit.c */,\r\n\t\t\t\tE8091A001B74553E008FED27 /* liolib.c */,\r\n\t\t\t\tE8091A011B74553E008FED27 /* llex.c */,\r\n\t\t\t\tE8091A021B74553E008FED27 /* lmathlib.c */,\r\n\t\t\t\tE8091A031B74553E008FED27 /* lmem.c */,\r\n\t\t\t\tE8091A041B74553E008FED27 /* loadlib.c */,\r\n\t\t\t\tE8091A051B74553E008FED27 /* lobject.c */,\r\n\t\t\t\tE8091A061B74553E008FED27 /* lopcodes.c */,\r\n\t\t\t\tE8091A071B74553E008FED27 /* loslib.c */,\r\n\t\t\t\tE8091A081B74553E008FED27 /* lparser.c */,\r\n\t\t\t\tE8091A091B74553E008FED27 /* lstate.c */,\r\n\t\t\t\tE8091A0A1B74553E008FED27 /* lstring.c */,\r\n\t\t\t\tE8091A0B1B74553E008FED27 /* lstrlib.c */,\r\n\t\t\t\tE8091A0C1B74553E008FED27 /* ltable.c */,\r\n\t\t\t\tE8091A0D1B74553E008FED27 /* ltablib.c */,\r\n\t\t\t\tE8091A0E1B74553E008FED27 /* ltm.c */,\r\n\t\t\t\tE8091A0F1B74553E008FED27 /* lundump.c */,\r\n\t\t\t\tE8091A101B74553E008FED27 /* lvm.c */,\r\n\t\t\t\tE8091A111B74553E008FED27 /* lzio.c */,\r\n\t\t\t\tE8091A121B74553E008FED27 /* print.c */,\r\n\t\t\t\tE80919D61B745519008FED27 /* slua */,\r\n\t\t\t\tE80919D51B745519008FED27 /* Products */,\r\n\t\t\t);\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D51B745519008FED27 /* Products */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D41B745519008FED27 /* slua.bundle */,\r\n\t\t\t);\r\n\t\t\tname = Products;\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D61B745519008FED27 /* slua */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D71B745519008FED27 /* Supporting Files */,\r\n\t\t\t);\r\n\t\t\tpath = slua;\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D71B745519008FED27 /* Supporting Files */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D81B745519008FED27 /* Info.plist */,\r\n\t\t\t);\r\n\t\t\tname = \"Supporting Files\";\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n/* End PBXGroup section */\r\n\r\n/* Begin PBXNativeTarget section */\r\n\t\tE80919D31B745519008FED27 /* slua */ = {\r\n\t\t\tisa = PBXNativeTarget;\r\n\t\t\tbuildConfigurationList = E80919DB1B745519008FED27 /* Build configuration list for PBXNativeTarget \"slua\" */;\r\n\t\t\tbuildPhases = (\r\n\t\t\t\tE80919D01B745519008FED27 /* Sources */,\r\n\t\t\t\tE80919D11B745519008FED27 /* Frameworks */,\r\n\t\t\t\tE80919D21B745519008FED27 /* Resources */,\r\n\t\t\t);\r\n\t\t\tbuildRules = (\r\n\t\t\t);\r\n\t\t\tdependencies = (\r\n\t\t\t);\r\n\t\t\tname = slua;\r\n\t\t\tproductName = slua;\r\n\t\t\tproductReference = E80919D41B745519008FED27 /* slua.bundle */;\r\n\t\t\tproductType = \"com.apple.product-type.bundle\";\r\n\t\t};\r\n/* End PBXNativeTarget section */\r\n\r\n/* Begin PBXProject section */\r\n\t\tE80919CC1B745519008FED27 /* Project object */ = {\r\n\t\t\tisa = PBXProject;\r\n\t\t\tattributes = {\r\n\t\t\t\tLastUpgradeCheck = 0640;\r\n\t\t\t\tORGANIZATIONNAME = \"Pang Weiwei\";\r\n\t\t\t\tTargetAttributes = {\r\n\t\t\t\t\tE80919D31B745519008FED27 = {\r\n\t\t\t\t\t\tCreatedOnToolsVersion = 6.4;\r\n\t\t\t\t\t};\r\n\t\t\t\t};\r\n\t\t\t};\r\n\t\t\tbuildConfigurationList = E80919CF1B745519008FED27 /* Build configuration list for PBXProject \"slua\" */;\r\n\t\t\tcompatibilityVersion = \"Xcode 3.2\";\r\n\t\t\tdevelopmentRegion = English;\r\n\t\t\thasScannedForEncodings = 0;\r\n\t\t\tknownRegions = (\r\n\t\t\t\ten,\r\n\t\t\t);\r\n\t\t\tmainGroup = E80919CB1B745519008FED27;\r\n\t\t\tproductRefGroup = E80919D51B745519008FED27 /* Products */;\r\n\t\t\tprojectDirPath = \"\";\r\n\t\t\tprojectRoot = \"\";\r\n\t\t\ttargets = (\r\n\t\t\t\tE80919D31B745519008FED27 /* slua */,\r\n\t\t\t);\r\n\t\t};\r\n/* End PBXProject section */\r\n\r\n/* Begin PBXResourcesBuildPhase section */\r\n\t\tE80919D21B745519008FED27 /* Resources */ = {\r\n\t\t\tisa = PBXResourcesBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXResourcesBuildPhase section */\r\n\r\n/* Begin PBXSourcesBuildPhase section */\r\n\t\tE80919D01B745519008FED27 /* Sources */ = {\r\n\t\t\tisa = PBXSourcesBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t\tE8091A1F1B74553E008FED27 /* llex.c in Sources */,\r\n\t\t\t\tE8091A221B74553E008FED27 /* loadlib.c in Sources */,\r\n\t\t\t\tE8091A2B1B74553E008FED27 /* ltablib.c in Sources */,\r\n\t\t\t\tE8091A1E1B74553E008FED27 /* liolib.c in Sources */,\r\n\t\t\t\tE8091A281B74553E008FED27 /* lstring.c in Sources */,\r\n\t\t\t\tE8091A2E1B74553E008FED27 /* lvm.c in Sources */,\r\n\t\t\t\tE8091A1B1B74553E008FED27 /* lfunc.c in Sources */,\r\n\t\t\t\tE8091A291B74553E008FED27 /* lstrlib.c in Sources */,\r\n\t\t\t\tE8091A131B74553E008FED27 /* lapi.c in Sources */,\r\n\t\t\t\tE8091A301B74553E008FED27 /* print.c in Sources */,\r\n\t\t\t\tE8091A231B74553E008FED27 /* lobject.c in Sources */,\r\n\t\t\t\tE8091A2C1B74553E008FED27 /* ltm.c in Sources */,\r\n\t\t\t\tE8091A1C1B74553E008FED27 /* lgc.c in Sources */,\r\n\t\t\t\tE8091A141B74553E008FED27 /* lauxlib.c in Sources */,\r\n\t\t\t\tE8091A1A1B74553E008FED27 /* ldump.c in Sources */,\r\n\t\t\t\tE8091A2D1B74553E008FED27 /* lundump.c in Sources */,\r\n\t\t\t\tE8091A251B74553E008FED27 /* loslib.c in Sources */,\r\n\t\t\t\tE8091A191B74553E008FED27 /* ldo.c in Sources */,\r\n\t\t\t\tE8091A241B74553E008FED27 /* lopcodes.c in Sources */,\r\n\t\t\t\tE8091A2F1B74553E008FED27 /* lzio.c in Sources */,\r\n\t\t\t\tE8091A151B74553E008FED27 /* lbaselib.c in Sources */,\r\n\t\t\t\tE8091A1D1B74553E008FED27 /* linit.c in Sources */,\r\n\t\t\t\tE8091A271B74553E008FED27 /* lstate.c in Sources */,\r\n\t\t\t\tE8091A211B74553E008FED27 /* lmem.c in Sources */,\r\n\t\t\t\tE8091A161B74553E008FED27 /* lcode.c in Sources */,\r\n\t\t\t\tE8091A181B74553E008FED27 /* ldebug.c in Sources */,\r\n\t\t\t\tE8091A201B74553E008FED27 /* lmathlib.c in Sources */,\r\n\t\t\t\tE8091A2A1B74553E008FED27 /* ltable.c in Sources */,\r\n\t\t\t\tE8091A171B74553E008FED27 /* ldblib.c in Sources */,\r\n\t\t\t\tE8091A321B745553008FED27 /* slua.c in Sources */,\r\n\t\t\t\tE8091A261B74553E008FED27 /* lparser.c in Sources */,\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXSourcesBuildPhase section */\r\n\r\n/* Begin XCBuildConfiguration section */\r\n\t\tE80919D91B745519008FED27 /* Debug */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\r\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\r\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\r\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\r\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\r\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\r\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\r\n\t\t\t\tCOPY_PHASE_STRIP = NO;\r\n\t\t\t\tDEBUG_INFORMATION_FORMAT = dwarf;\r\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\r\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\r\n\t\t\t\tGCC_DYNAMIC_NO_PIC = NO;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\r\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\r\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\r\n\t\t\t\t\t\"DEBUG=1\",\r\n\t\t\t\t\t\"$(inherited)\",\r\n\t\t\t\t);\r\n\t\t\t\tGCC_SYMBOLS_PRIVATE_EXTERN = NO;\r\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\r\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\r\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\r\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\r\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\r\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\r\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.10;\r\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = YES;\r\n\t\t\t\tONLY_ACTIVE_ARCH = YES;\r\n\t\t\t\tSDKROOT = macosx;\r\n\t\t\t};\r\n\t\t\tname = Debug;\r\n\t\t};\r\n\t\tE80919DA1B745519008FED27 /* Release */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\r\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\r\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\r\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\r\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\r\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\r\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\r\n\t\t\t\tCOPY_PHASE_STRIP = NO;\r\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\r\n\t\t\t\tENABLE_NS_ASSERTIONS = NO;\r\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\r\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\r\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\r\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\r\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\r\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\r\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\r\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\r\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.10;\r\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = NO;\r\n\t\t\t\tSDKROOT = macosx;\r\n\t\t\t};\r\n\t\t\tname = Release;\r\n\t\t};\r\n\t\tE80919DC1B745519008FED27 /* Debug */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tARCHS = \"$(ARCHS_STANDARD_32_64_BIT)\";\r\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\r\n\t\t\t\tINFOPLIST_FILE = slua/Info.plist;\r\n\t\t\t\tINSTALL_PATH = \"$(LOCAL_LIBRARY_DIR)/Bundles\";\r\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\r\n\t\t\t\tSKIP_INSTALL = YES;\r\n\t\t\t\tWRAPPER_EXTENSION = bundle;\r\n\t\t\t};\r\n\t\t\tname = Debug;\r\n\t\t};\r\n\t\tE80919DD1B745519008FED27 /* Release */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tARCHS = \"$(ARCHS_STANDARD_32_64_BIT)\";\r\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\r\n\t\t\t\tINFOPLIST_FILE = slua/Info.plist;\r\n\t\t\t\tINSTALL_PATH = \"$(LOCAL_LIBRARY_DIR)/Bundles\";\r\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\r\n\t\t\t\tSKIP_INSTALL = YES;\r\n\t\t\t\tWRAPPER_EXTENSION = bundle;\r\n\t\t\t};\r\n\t\t\tname = Release;\r\n\t\t};\r\n/* End XCBuildConfiguration section */\r\n\r\n/* Begin XCConfigurationList section */\r\n\t\tE80919CF1B745519008FED27 /* Build configuration list for PBXProject \"slua\" */ = {\r\n\t\t\tisa = XCConfigurationList;\r\n\t\t\tbuildConfigurations = (\r\n\t\t\t\tE80919D91B745519008FED27 /* Debug */,\r\n\t\t\t\tE80919DA1B745519008FED27 /* Release */,\r\n\t\t\t);\r\n\t\t\tdefaultConfigurationIsVisible = 0;\r\n\t\t\tdefaultConfigurationName = Release;\r\n\t\t};\r\n\t\tE80919DB1B745519008FED27 /* Build configuration list for PBXNativeTarget \"slua\" */ = {\r\n\t\t\tisa = XCConfigurationList;\r\n\t\t\tbuildConfigurations = (\r\n\t\t\t\tE80919DC1B745519008FED27 /* Debug */,\r\n\t\t\t\tE80919DD1B745519008FED27 /* Release */,\r\n\t\t\t);\r\n\t\t\tdefaultConfigurationIsVisible = 0;\r\n\t\t\tdefaultConfigurationName = Release;\r\n\t\t};\r\n/* End XCConfigurationList section */\r\n\t};\r\n\trootObject = E80919CC1B745519008FED27 /* Project object */;\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/project.xcworkspace/contents.xcworkspacedata",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<Workspace\r\n   version = \"1.0\">\r\n   <FileRef\r\n      location = \"self:slua.xcodeproj\">\r\n   </FileRef>\r\n</Workspace>\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/project.xcworkspace/xcshareddata/slua.xccheckout",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>IDESourceControlProjectFavoriteDictionaryKey</key>\r\n\t<false/>\r\n\t<key>IDESourceControlProjectIdentifier</key>\r\n\t<string>EE253B8E-7C08-46A7-A34D-8C5A95EB8495</string>\r\n\t<key>IDESourceControlProjectName</key>\r\n\t<string>project</string>\r\n\t<key>IDESourceControlProjectOriginsDictionary</key>\r\n\t<dict>\r\n\t\t<key>16BCFA1EB47C537A4254C08C32590AD083A3938E</key>\r\n\t\t<string>https://github.com/pangweiwei/slua.git</string>\r\n\t</dict>\r\n\t<key>IDESourceControlProjectPath</key>\r\n\t<string>build/lua-5.1.5/slua/slua.xcodeproj/project.xcworkspace</string>\r\n\t<key>IDESourceControlProjectRelativeInstallPathDictionary</key>\r\n\t<dict>\r\n\t\t<key>16BCFA1EB47C537A4254C08C32590AD083A3938E</key>\r\n\t\t<string>../../../../..</string>\r\n\t</dict>\r\n\t<key>IDESourceControlProjectURL</key>\r\n\t<string>https://github.com/pangweiwei/slua.git</string>\r\n\t<key>IDESourceControlProjectVersion</key>\r\n\t<integer>111</integer>\r\n\t<key>IDESourceControlProjectWCCIdentifier</key>\r\n\t<string>16BCFA1EB47C537A4254C08C32590AD083A3938E</string>\r\n\t<key>IDESourceControlProjectWCConfigurations</key>\r\n\t<array>\r\n\t\t<dict>\r\n\t\t\t<key>IDESourceControlRepositoryExtensionIdentifierKey</key>\r\n\t\t\t<string>public.vcs.git</string>\r\n\t\t\t<key>IDESourceControlWCCIdentifierKey</key>\r\n\t\t\t<string>16BCFA1EB47C537A4254C08C32590AD083A3938E</string>\r\n\t\t\t<key>IDESourceControlWCCName</key>\r\n\t\t\t<string>slua</string>\r\n\t\t</dict>\r\n\t</array>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/project.xcworkspace/xcuserdata/sineysan.xcuserdatad/WorkspaceSettings.xcsettings",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>BuildLocationStyle</key>\r\n\t<string>CustomLocation</string>\r\n\t<key>CustomBuildIntermediatesPath</key>\r\n\t<string>Build/Intermediates</string>\r\n\t<key>CustomBuildLocationType</key>\r\n\t<string>RelativeToWorkspace</string>\r\n\t<key>CustomBuildProductsPath</key>\r\n\t<string>Build</string>\r\n\t<key>DerivedDataLocationStyle</key>\r\n\t<string>Default</string>\r\n\t<key>IssueFilterStyle</key>\r\n\t<string>ShowActiveSchemeOnly</string>\r\n\t<key>LiveSourceIssuesEnabled</key>\r\n\t<true/>\r\n\t<key>SnapshotAutomaticallyBeforeSignificantChanges</key>\r\n\t<true/>\r\n\t<key>SnapshotLocationStyle</key>\r\n\t<string>Default</string>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/xcuserdata/sineysan.xcuserdatad/xcschemes/slua.xcscheme",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<Scheme\r\n   LastUpgradeVersion = \"0640\"\r\n   version = \"1.3\">\r\n   <BuildAction\r\n      parallelizeBuildables = \"YES\"\r\n      buildImplicitDependencies = \"YES\">\r\n      <BuildActionEntries>\r\n         <BuildActionEntry\r\n            buildForTesting = \"YES\"\r\n            buildForRunning = \"YES\"\r\n            buildForProfiling = \"YES\"\r\n            buildForArchiving = \"YES\"\r\n            buildForAnalyzing = \"YES\">\r\n            <BuildableReference\r\n               BuildableIdentifier = \"primary\"\r\n               BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n               BuildableName = \"slua.bundle\"\r\n               BlueprintName = \"slua\"\r\n               ReferencedContainer = \"container:slua.xcodeproj\">\r\n            </BuildableReference>\r\n         </BuildActionEntry>\r\n      </BuildActionEntries>\r\n   </BuildAction>\r\n   <TestAction\r\n      selectedDebuggerIdentifier = \"Xcode.DebuggerFoundation.Debugger.LLDB\"\r\n      selectedLauncherIdentifier = \"Xcode.DebuggerFoundation.Launcher.LLDB\"\r\n      shouldUseLaunchSchemeArgsEnv = \"YES\"\r\n      buildConfiguration = \"Debug\">\r\n      <Testables>\r\n      </Testables>\r\n   </TestAction>\r\n   <LaunchAction\r\n      selectedDebuggerIdentifier = \"Xcode.DebuggerFoundation.Debugger.LLDB\"\r\n      selectedLauncherIdentifier = \"Xcode.DebuggerFoundation.Launcher.LLDB\"\r\n      launchStyle = \"0\"\r\n      useCustomWorkingDirectory = \"NO\"\r\n      buildConfiguration = \"Release\"\r\n      ignoresPersistentStateOnLaunch = \"NO\"\r\n      debugDocumentVersioning = \"YES\"\r\n      allowLocationSimulation = \"YES\">\r\n      <MacroExpansion>\r\n         <BuildableReference\r\n            BuildableIdentifier = \"primary\"\r\n            BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n            BuildableName = \"slua.bundle\"\r\n            BlueprintName = \"slua\"\r\n            ReferencedContainer = \"container:slua.xcodeproj\">\r\n         </BuildableReference>\r\n      </MacroExpansion>\r\n      <AdditionalOptions>\r\n      </AdditionalOptions>\r\n   </LaunchAction>\r\n   <ProfileAction\r\n      shouldUseLaunchSchemeArgsEnv = \"YES\"\r\n      savedToolIdentifier = \"\"\r\n      useCustomWorkingDirectory = \"NO\"\r\n      buildConfiguration = \"Release\"\r\n      debugDocumentVersioning = \"YES\">\r\n      <MacroExpansion>\r\n         <BuildableReference\r\n            BuildableIdentifier = \"primary\"\r\n            BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n            BuildableName = \"slua.bundle\"\r\n            BlueprintName = \"slua\"\r\n            ReferencedContainer = \"container:slua.xcodeproj\">\r\n         </BuildableReference>\r\n      </MacroExpansion>\r\n   </ProfileAction>\r\n   <AnalyzeAction\r\n      buildConfiguration = \"Debug\">\r\n   </AnalyzeAction>\r\n   <ArchiveAction\r\n      buildConfiguration = \"Release\"\r\n      revealArchiveInOrganizer = \"YES\">\r\n   </ArchiveAction>\r\n</Scheme>\r\n"
  },
  {
    "path": "build/lua-5.1.5/slua/slua.xcodeproj/xcuserdata/sineysan.xcuserdatad/xcschemes/xcschememanagement.plist",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>SchemeUserState</key>\r\n\t<dict>\r\n\t\t<key>slua.xcscheme</key>\r\n\t\t<dict>\r\n\t\t\t<key>orderHint</key>\r\n\t\t\t<integer>0</integer>\r\n\t\t</dict>\r\n\t</dict>\r\n\t<key>SuppressBuildableAutocreation</key>\r\n\t<dict>\r\n\t\t<key>E80919D31B745519008FED27</key>\r\n\t\t<dict>\r\n\t\t\t<key>primary</key>\r\n\t\t\t<true/>\r\n\t\t</dict>\r\n\t</dict>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/Makefile",
    "content": "# makefile for building Lua\r\n# see ../INSTALL for installation instructions\r\n# see ../Makefile and luaconf.h for further customization\r\n\r\n# == CHANGE THE SETTINGS BELOW TO SUIT YOUR ENVIRONMENT =======================\r\n\r\n# Your platform. See PLATS for possible values.\r\nPLAT= none\r\n\r\nCC= gcc\r\nCFLAGS= -O2 -Wall $(MYCFLAGS)\r\nAR= ar rcu\r\nRANLIB= ranlib\r\nRM= rm -f\r\nLIBS= -lm $(MYLIBS)\r\n\r\nMYCFLAGS=\r\nMYLDFLAGS=\r\nMYLIBS=\r\n\r\n# == END OF USER SETTINGS. NO NEED TO CHANGE ANYTHING BELOW THIS LINE =========\r\n\r\nPLATS= aix ansi bsd freebsd generic linux macosx mingw posix solaris\r\n\r\nLUA_A=\tliblua.a\r\nCORE_O=\tlapi.o lcode.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o lmem.o \\\r\n\tlobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o ltm.o  \\\r\n\tlundump.o lvm.o lzio.o\r\nLIB_O=\tlauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o loslib.o ltablib.o \\\r\n\tlstrlib.o loadlib.o linit.o\r\n\r\nLUA_T=\tlua\r\nLUA_O=\tlua.o\r\n\r\nLUAC_T=\tluac\r\nLUAC_O=\tluac.o print.o\r\n\r\nALL_O= $(CORE_O) $(LIB_O) $(LUA_O) $(LUAC_O)\r\nALL_T= $(LUA_A) $(LUA_T) $(LUAC_T)\r\nALL_A= $(LUA_A)\r\n\r\ndefault: $(PLAT)\r\n\r\nall:\t$(ALL_T)\r\n\r\no:\t$(ALL_O)\r\n\r\na:\t$(ALL_A)\r\n\r\n$(LUA_A): $(CORE_O) $(LIB_O)\r\n\t$(AR) $@ $(CORE_O) $(LIB_O)\t# DLL needs all object files\r\n\t$(RANLIB) $@\r\n\r\n$(LUA_T): $(LUA_O) $(LUA_A)\r\n\t$(CC) -o $@ $(MYLDFLAGS) $(LUA_O) $(LUA_A) $(LIBS)\r\n\r\n$(LUAC_T): $(LUAC_O) $(LUA_A)\r\n\t$(CC) -o $@ $(MYLDFLAGS) $(LUAC_O) $(LUA_A) $(LIBS)\r\n\r\nclean:\r\n\t$(RM) $(ALL_T) $(ALL_O)\r\n\r\ndepend:\r\n\t@$(CC) $(CFLAGS) -MM l*.c print.c\r\n\r\necho:\r\n\t@echo \"PLAT = $(PLAT)\"\r\n\t@echo \"CC = $(CC)\"\r\n\t@echo \"CFLAGS = $(CFLAGS)\"\r\n\t@echo \"AR = $(AR)\"\r\n\t@echo \"RANLIB = $(RANLIB)\"\r\n\t@echo \"RM = $(RM)\"\r\n\t@echo \"MYCFLAGS = $(MYCFLAGS)\"\r\n\t@echo \"MYLDFLAGS = $(MYLDFLAGS)\"\r\n\t@echo \"MYLIBS = $(MYLIBS)\"\r\n\r\n# convenience targets for popular platforms\r\n\r\nnone:\r\n\t@echo \"Please choose a platform:\"\r\n\t@echo \"   $(PLATS)\"\r\n\r\naix:\r\n\t$(MAKE) all CC=\"xlc\" CFLAGS=\"-O2 -DLUA_USE_POSIX -DLUA_USE_DLOPEN\" MYLIBS=\"-ldl\" MYLDFLAGS=\"-brtl -bexpall\"\r\n\r\nansi:\r\n\t$(MAKE) all MYCFLAGS=-DLUA_ANSI\r\n\r\nbsd:\r\n\t$(MAKE) all MYCFLAGS=\"-DLUA_USE_POSIX -DLUA_USE_DLOPEN\" MYLIBS=\"-Wl,-E\"\r\n\r\nfreebsd:\r\n\t$(MAKE) all MYCFLAGS=\"-DLUA_USE_LINUX\" MYLIBS=\"-Wl,-E -lreadline\"\r\n\r\ngeneric:\r\n\t$(MAKE) all MYCFLAGS=\r\n\r\nlinux:\r\n\t$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS=\"-Wl,-E -ldl -lreadline -lhistory -lncurses\"\r\n\r\nmacosx:\r\n\t$(MAKE) all MYCFLAGS=-DLUA_USE_LINUX MYLIBS=\"-lreadline\"\r\n# use this on Mac OS X 10.3-\r\n#\t$(MAKE) all MYCFLAGS=-DLUA_USE_MACOSX\r\n\r\nmingw:\r\n\t$(MAKE) \"LUA_A=lua51.dll\" \"LUA_T=lua.exe\" \\\r\n\t\"AR=$(CC) -shared -o\" \"RANLIB=strip --strip-unneeded\" \\\r\n\t\"MYCFLAGS=-DLUA_BUILD_AS_DLL\" \"MYLIBS=\" \"MYLDFLAGS=-s\" lua.exe\r\n\t$(MAKE) \"LUAC_T=luac.exe\" luac.exe\r\n\r\nposix:\r\n\t$(MAKE) all MYCFLAGS=-DLUA_USE_POSIX\r\n\r\nsolaris:\r\n\t$(MAKE) all MYCFLAGS=\"-DLUA_USE_POSIX -DLUA_USE_DLOPEN\" MYLIBS=\"-ldl\"\r\n\r\n# list targets that do not create files (but not all makes understand .PHONY)\r\n.PHONY: all $(PLATS) default o a clean depend echo none\r\n\r\n# DO NOT DELETE\r\n\r\nlapi.o: lapi.c lua.h luaconf.h lapi.h lobject.h llimits.h ldebug.h \\\r\n  lstate.h ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h \\\r\n  lundump.h lvm.h\r\nlauxlib.o: lauxlib.c lua.h luaconf.h lauxlib.h\r\nlbaselib.o: lbaselib.c lua.h luaconf.h lauxlib.h lualib.h\r\nlcode.o: lcode.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \\\r\n  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h lgc.h \\\r\n  ltable.h\r\nldblib.o: ldblib.c lua.h luaconf.h lauxlib.h lualib.h\r\nldebug.o: ldebug.c lua.h luaconf.h lapi.h lobject.h llimits.h lcode.h \\\r\n  llex.h lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \\\r\n  lfunc.h lstring.h lgc.h ltable.h lvm.h\r\nldo.o: ldo.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \\\r\n  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lparser.h lstring.h \\\r\n  ltable.h lundump.h lvm.h\r\nldump.o: ldump.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h \\\r\n  lzio.h lmem.h lundump.h\r\nlfunc.o: lfunc.c lua.h luaconf.h lfunc.h lobject.h llimits.h lgc.h lmem.h \\\r\n  lstate.h ltm.h lzio.h\r\nlgc.o: lgc.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \\\r\n  lzio.h lmem.h ldo.h lfunc.h lgc.h lstring.h ltable.h\r\nlinit.o: linit.c lua.h luaconf.h lualib.h lauxlib.h\r\nliolib.o: liolib.c lua.h luaconf.h lauxlib.h lualib.h\r\nllex.o: llex.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h ltm.h \\\r\n  lzio.h lmem.h llex.h lparser.h lstring.h lgc.h ltable.h\r\nlmathlib.o: lmathlib.c lua.h luaconf.h lauxlib.h lualib.h\r\nlmem.o: lmem.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \\\r\n  ltm.h lzio.h lmem.h ldo.h\r\nloadlib.o: loadlib.c lua.h luaconf.h lauxlib.h lualib.h\r\nlobject.o: lobject.c lua.h luaconf.h ldo.h lobject.h llimits.h lstate.h \\\r\n  ltm.h lzio.h lmem.h lstring.h lgc.h lvm.h\r\nlopcodes.o: lopcodes.c lopcodes.h llimits.h lua.h luaconf.h\r\nloslib.o: loslib.c lua.h luaconf.h lauxlib.h lualib.h\r\nlparser.o: lparser.c lua.h luaconf.h lcode.h llex.h lobject.h llimits.h \\\r\n  lzio.h lmem.h lopcodes.h lparser.h ldebug.h lstate.h ltm.h ldo.h \\\r\n  lfunc.h lstring.h lgc.h ltable.h\r\nlstate.o: lstate.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \\\r\n  ltm.h lzio.h lmem.h ldo.h lfunc.h lgc.h llex.h lstring.h ltable.h\r\nlstring.o: lstring.c lua.h luaconf.h lmem.h llimits.h lobject.h lstate.h \\\r\n  ltm.h lzio.h lstring.h lgc.h\r\nlstrlib.o: lstrlib.c lua.h luaconf.h lauxlib.h lualib.h\r\nltable.o: ltable.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h \\\r\n  ltm.h lzio.h lmem.h ldo.h lgc.h ltable.h\r\nltablib.o: ltablib.c lua.h luaconf.h lauxlib.h lualib.h\r\nltm.o: ltm.c lua.h luaconf.h lobject.h llimits.h lstate.h ltm.h lzio.h \\\r\n  lmem.h lstring.h lgc.h ltable.h\r\nlua.o: lua.c lua.h luaconf.h lauxlib.h lualib.h\r\nluac.o: luac.c lua.h luaconf.h lauxlib.h ldo.h lobject.h llimits.h \\\r\n  lstate.h ltm.h lzio.h lmem.h lfunc.h lopcodes.h lstring.h lgc.h \\\r\n  lundump.h\r\nlundump.o: lundump.c lua.h luaconf.h ldebug.h lstate.h lobject.h \\\r\n  llimits.h ltm.h lzio.h lmem.h ldo.h lfunc.h lstring.h lgc.h lundump.h\r\nlvm.o: lvm.c lua.h luaconf.h ldebug.h lstate.h lobject.h llimits.h ltm.h \\\r\n  lzio.h lmem.h ldo.h lfunc.h lgc.h lopcodes.h lstring.h ltable.h lvm.h\r\nlzio.o: lzio.c lua.h luaconf.h llimits.h lmem.h lstate.h lobject.h ltm.h \\\r\n  lzio.h\r\nprint.o: print.c ldebug.h lstate.h lua.h luaconf.h lobject.h llimits.h \\\r\n  ltm.h lzio.h lmem.h lopcodes.h lundump.h\r\n\r\n# (end of Makefile)\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lapi.c",
    "content": "/*\r\n** $Id: lapi.c,v 2.55.1.5 2008/07/04 18:41:18 roberto Exp $\r\n** Lua API\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <assert.h>\r\n#include <math.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n\r\n#define lapi_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lapi.h\"\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n#include \"lundump.h\"\r\n#include \"lvm.h\"\r\n\r\n\r\n\r\nconst char lua_ident[] =\r\n  \"$Lua: \" LUA_RELEASE \" \" LUA_COPYRIGHT \" $\\n\"\r\n  \"$Authors: \" LUA_AUTHORS \" $\\n\"\r\n  \"$URL: www.lua.org $\\n\";\r\n\r\n\r\n\r\n#define api_checknelems(L, n)\tapi_check(L, (n) <= (L->top - L->base))\r\n\r\n#define api_checkvalidindex(L, i)\tapi_check(L, (i) != luaO_nilobject)\r\n\r\n#define api_incr_top(L)   {api_check(L, L->top < L->ci->top); L->top++;}\r\n\r\n\r\n\r\nstatic TValue *index2adr (lua_State *L, int idx) {\r\n  if (idx > 0) {\r\n    TValue *o = L->base + (idx - 1);\r\n    api_check(L, idx <= L->ci->top - L->base);\r\n    if (o >= L->top) return cast(TValue *, luaO_nilobject);\r\n    else return o;\r\n  }\r\n  else if (idx > LUA_REGISTRYINDEX) {\r\n    api_check(L, idx != 0 && -idx <= L->top - L->base);\r\n    return L->top + idx;\r\n  }\r\n  else switch (idx) {  /* pseudo-indices */\r\n    case LUA_REGISTRYINDEX: return registry(L);\r\n    case LUA_ENVIRONINDEX: {\r\n      Closure *func = curr_func(L);\r\n      sethvalue(L, &L->env, func->c.env);\r\n      return &L->env;\r\n    }\r\n    case LUA_GLOBALSINDEX: return gt(L);\r\n    default: {\r\n      Closure *func = curr_func(L);\r\n      idx = LUA_GLOBALSINDEX - idx;\r\n      return (idx <= func->c.nupvalues)\r\n                ? &func->c.upvalue[idx-1]\r\n                : cast(TValue *, luaO_nilobject);\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic Table *getcurrenv (lua_State *L) {\r\n  if (L->ci == L->base_ci)  /* no enclosing function? */\r\n    return hvalue(gt(L));  /* use global table as environment */\r\n  else {\r\n    Closure *func = curr_func(L);\r\n    return func->c.env;\r\n  }\r\n}\r\n\r\n\r\nvoid luaA_pushobject (lua_State *L, const TValue *o) {\r\n  setobj2s(L, L->top, o);\r\n  api_incr_top(L);\r\n}\r\n\r\n\r\nLUA_API int lua_checkstack (lua_State *L, int size) {\r\n  int res = 1;\r\n  lua_lock(L);\r\n  if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK)\r\n    res = 0;  /* stack overflow */\r\n  else if (size > 0) {\r\n    luaD_checkstack(L, size);\r\n    if (L->ci->top < L->top + size)\r\n      L->ci->top = L->top + size;\r\n  }\r\n  lua_unlock(L);\r\n  return res;\r\n}\r\n\r\n\r\nLUA_API void lua_xmove (lua_State *from, lua_State *to, int n) {\r\n  int i;\r\n  if (from == to) return;\r\n  lua_lock(to);\r\n  api_checknelems(from, n);\r\n  api_check(from, G(from) == G(to));\r\n  api_check(from, to->ci->top - to->top >= n);\r\n  from->top -= n;\r\n  for (i = 0; i < n; i++) {\r\n    setobj2s(to, to->top++, from->top + i);\r\n  }\r\n  lua_unlock(to);\r\n}\r\n\r\n\r\nLUA_API void lua_setlevel (lua_State *from, lua_State *to) {\r\n  to->nCcalls = from->nCcalls;\r\n}\r\n\r\n\r\nLUA_API lua_CFunction lua_atpanic (lua_State *L, lua_CFunction panicf) {\r\n  lua_CFunction old;\r\n  lua_lock(L);\r\n  old = G(L)->panic;\r\n  G(L)->panic = panicf;\r\n  lua_unlock(L);\r\n  return old;\r\n}\r\n\r\n\r\nLUA_API lua_State *lua_newthread (lua_State *L) {\r\n  lua_State *L1;\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  L1 = luaE_newthread(L);\r\n  setthvalue(L, L->top, L1);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n  luai_userstatethread(L, L1);\r\n  return L1;\r\n}\r\n\r\n\r\n\r\n/*\r\n** basic stack manipulation\r\n*/\r\n\r\n\r\nLUA_API int lua_gettop (lua_State *L) {\r\n  return cast_int(L->top - L->base);\r\n}\r\n\r\n\r\nLUA_API void lua_settop (lua_State *L, int idx) {\r\n  lua_lock(L);\r\n  if (idx >= 0) {\r\n    api_check(L, idx <= L->stack_last - L->base);\r\n    while (L->top < L->base + idx)\r\n      setnilvalue(L->top++);\r\n    L->top = L->base + idx;\r\n  }\r\n  else {\r\n    api_check(L, -(idx+1) <= (L->top - L->base));\r\n    L->top += idx+1;  /* `subtract' index (index is negative) */\r\n  }\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_remove (lua_State *L, int idx) {\r\n  StkId p;\r\n  lua_lock(L);\r\n  p = index2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  while (++p < L->top) setobjs2s(L, p-1, p);\r\n  L->top--;\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_insert (lua_State *L, int idx) {\r\n  StkId p;\r\n  StkId q;\r\n  lua_lock(L);\r\n  p = index2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  for (q = L->top; q>p; q--) setobjs2s(L, q, q-1);\r\n  setobjs2s(L, p, L->top);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_replace (lua_State *L, int idx) {\r\n  StkId o;\r\n  lua_lock(L);\r\n  /* explicit test for incompatible code */\r\n  if (idx == LUA_ENVIRONINDEX && L->ci == L->base_ci)\r\n    luaG_runerror(L, \"no calling environment\");\r\n  api_checknelems(L, 1);\r\n  o = index2adr(L, idx);\r\n  api_checkvalidindex(L, o);\r\n  if (idx == LUA_ENVIRONINDEX) {\r\n    Closure *func = curr_func(L);\r\n    api_check(L, ttistable(L->top - 1)); \r\n    func->c.env = hvalue(L->top - 1);\r\n    luaC_barrier(L, func, L->top - 1);\r\n  }\r\n  else {\r\n    setobj(L, o, L->top - 1);\r\n    if (idx < LUA_GLOBALSINDEX)  /* function upvalue? */\r\n      luaC_barrier(L, curr_func(L), L->top - 1);\r\n  }\r\n  L->top--;\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushvalue (lua_State *L, int idx) {\r\n  lua_lock(L);\r\n  setobj2s(L, L->top, index2adr(L, idx));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\n\r\n/*\r\n** access functions (stack -> C)\r\n*/\r\n\r\n\r\nLUA_API int lua_type (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  return (o == luaO_nilobject) ? LUA_TNONE : ttype(o);\r\n}\r\n\r\n\r\nLUA_API const char *lua_typename (lua_State *L, int t) {\r\n  UNUSED(L);\r\n  return (t == LUA_TNONE) ? \"no value\" : luaT_typenames[t];\r\n}\r\n\r\n\r\nLUA_API int lua_iscfunction (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  return iscfunction(o);\r\n}\r\n\r\n\r\nLUA_API int lua_isnumber (lua_State *L, int idx) {\r\n  TValue n;\r\n  const TValue *o = index2adr(L, idx);\r\n  return tonumber(o, &n);\r\n}\r\n\r\n\r\nLUA_API int lua_isstring (lua_State *L, int idx) {\r\n  int t = lua_type(L, idx);\r\n  return (t == LUA_TSTRING || t == LUA_TNUMBER);\r\n}\r\n\r\n\r\nLUA_API int lua_isuserdata (lua_State *L, int idx) {\r\n  const TValue *o = index2adr(L, idx);\r\n  return (ttisuserdata(o) || ttislightuserdata(o));\r\n}\r\n\r\n\r\nLUA_API int lua_rawequal (lua_State *L, int index1, int index2) {\r\n  StkId o1 = index2adr(L, index1);\r\n  StkId o2 = index2adr(L, index2);\r\n  return (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0\r\n         : luaO_rawequalObj(o1, o2);\r\n}\r\n\r\n\r\nLUA_API int lua_equal (lua_State *L, int index1, int index2) {\r\n  StkId o1, o2;\r\n  int i;\r\n  lua_lock(L);  /* may call tag method */\r\n  o1 = index2adr(L, index1);\r\n  o2 = index2adr(L, index2);\r\n  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0 : equalobj(L, o1, o2);\r\n  lua_unlock(L);\r\n  return i;\r\n}\r\n\r\n\r\nLUA_API int lua_lessthan (lua_State *L, int index1, int index2) {\r\n  StkId o1, o2;\r\n  int i;\r\n  lua_lock(L);  /* may call tag method */\r\n  o1 = index2adr(L, index1);\r\n  o2 = index2adr(L, index2);\r\n  i = (o1 == luaO_nilobject || o2 == luaO_nilobject) ? 0\r\n       : luaV_lessthan(L, o1, o2);\r\n  lua_unlock(L);\r\n  return i;\r\n}\r\n\r\n\r\n\r\nLUA_API lua_Number lua_tonumber (lua_State *L, int idx) {\r\n  TValue n;\r\n  const TValue *o = index2adr(L, idx);\r\n  if (tonumber(o, &n))\r\n    return nvalue(o);\r\n  else\r\n    return 0;\r\n}\r\n\r\n\r\nLUA_API lua_Integer lua_tointeger (lua_State *L, int idx) {\r\n  TValue n;\r\n  const TValue *o = index2adr(L, idx);\r\n  if (tonumber(o, &n)) {\r\n    lua_Integer res;\r\n    lua_Number num = nvalue(o);\r\n    lua_number2integer(res, num);\r\n    return res;\r\n  }\r\n  else\r\n    return 0;\r\n}\r\n\r\n\r\nLUA_API int lua_toboolean (lua_State *L, int idx) {\r\n  const TValue *o = index2adr(L, idx);\r\n  return !l_isfalse(o);\r\n}\r\n\r\n\r\nLUA_API const char *lua_tolstring (lua_State *L, int idx, size_t *len) {\r\n  StkId o = index2adr(L, idx);\r\n  if (!ttisstring(o)) {\r\n    lua_lock(L);  /* `luaV_tostring' may create a new string */\r\n    if (!luaV_tostring(L, o)) {  /* conversion failed? */\r\n      if (len != NULL) *len = 0;\r\n      lua_unlock(L);\r\n      return NULL;\r\n    }\r\n    luaC_checkGC(L);\r\n    o = index2adr(L, idx);  /* previous call may reallocate the stack */\r\n    lua_unlock(L);\r\n  }\r\n  if (len != NULL) *len = tsvalue(o)->len;\r\n  return svalue(o);\r\n}\r\n\r\n\r\nLUA_API size_t lua_objlen (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  switch (ttype(o)) {\r\n    case LUA_TSTRING: return tsvalue(o)->len;\r\n    case LUA_TUSERDATA: return uvalue(o)->len;\r\n    case LUA_TTABLE: return luaH_getn(hvalue(o));\r\n    case LUA_TNUMBER: {\r\n      size_t l;\r\n      lua_lock(L);  /* `luaV_tostring' may create a new string */\r\n      l = (luaV_tostring(L, o) ? tsvalue(o)->len : 0);\r\n      lua_unlock(L);\r\n      return l;\r\n    }\r\n    default: return 0;\r\n  }\r\n}\r\n\r\n\r\nLUA_API lua_CFunction lua_tocfunction (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  return (!iscfunction(o)) ? NULL : clvalue(o)->c.f;\r\n}\r\n\r\n\r\nLUA_API void *lua_touserdata (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  switch (ttype(o)) {\r\n    case LUA_TUSERDATA: return (rawuvalue(o) + 1);\r\n    case LUA_TLIGHTUSERDATA: return pvalue(o);\r\n    default: return NULL;\r\n  }\r\n}\r\n\r\n\r\nLUA_API lua_State *lua_tothread (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  return (!ttisthread(o)) ? NULL : thvalue(o);\r\n}\r\n\r\n\r\nLUA_API const void *lua_topointer (lua_State *L, int idx) {\r\n  StkId o = index2adr(L, idx);\r\n  switch (ttype(o)) {\r\n    case LUA_TTABLE: return hvalue(o);\r\n    case LUA_TFUNCTION: return clvalue(o);\r\n    case LUA_TTHREAD: return thvalue(o);\r\n    case LUA_TUSERDATA:\r\n    case LUA_TLIGHTUSERDATA:\r\n      return lua_touserdata(L, idx);\r\n    default: return NULL;\r\n  }\r\n}\r\n\r\n\r\n\r\n/*\r\n** push functions (C -> stack)\r\n*/\r\n\r\n\r\nLUA_API void lua_pushnil (lua_State *L) {\r\n  lua_lock(L);\r\n  setnilvalue(L->top);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushnumber (lua_State *L, lua_Number n) {\r\n  lua_lock(L);\r\n  setnvalue(L->top, n);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushinteger (lua_State *L, lua_Integer n) {\r\n  lua_lock(L);\r\n  setnvalue(L->top, cast_num(n));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushlstring (lua_State *L, const char *s, size_t len) {\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  setsvalue2s(L, L->top, luaS_newlstr(L, s, len));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushstring (lua_State *L, const char *s) {\r\n  if (s == NULL)\r\n    lua_pushnil(L);\r\n  else\r\n    lua_pushlstring(L, s, strlen(s));\r\n}\r\n\r\n\r\nLUA_API const char *lua_pushvfstring (lua_State *L, const char *fmt,\r\n                                      va_list argp) {\r\n  const char *ret;\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  ret = luaO_pushvfstring(L, fmt, argp);\r\n  lua_unlock(L);\r\n  return ret;\r\n}\r\n\r\n\r\nLUA_API const char *lua_pushfstring (lua_State *L, const char *fmt, ...) {\r\n  const char *ret;\r\n  va_list argp;\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  va_start(argp, fmt);\r\n  ret = luaO_pushvfstring(L, fmt, argp);\r\n  va_end(argp);\r\n  lua_unlock(L);\r\n  return ret;\r\n}\r\n\r\n\r\nLUA_API void lua_pushcclosure (lua_State *L, lua_CFunction fn, int n) {\r\n  Closure *cl;\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  api_checknelems(L, n);\r\n  cl = luaF_newCclosure(L, n, getcurrenv(L));\r\n  cl->c.f = fn;\r\n  L->top -= n;\r\n  while (n--)\r\n    setobj2n(L, &cl->c.upvalue[n], L->top+n);\r\n  setclvalue(L, L->top, cl);\r\n  lua_assert(iswhite(obj2gco(cl)));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushboolean (lua_State *L, int b) {\r\n  lua_lock(L);\r\n  setbvalue(L->top, (b != 0));  /* ensure that true is 1 */\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_pushlightuserdata (lua_State *L, void *p) {\r\n  lua_lock(L);\r\n  setpvalue(L->top, p);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API int lua_pushthread (lua_State *L) {\r\n  lua_lock(L);\r\n  setthvalue(L, L->top, L);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n  return (G(L)->mainthread == L);\r\n}\r\n\r\n\r\n\r\n/*\r\n** get functions (Lua -> stack)\r\n*/\r\n\r\n\r\nLUA_API void lua_gettable (lua_State *L, int idx) {\r\n  StkId t;\r\n  lua_lock(L);\r\n  t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  luaV_gettable(L, t, L->top - 1, L->top - 1);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_getfield (lua_State *L, int idx, const char *k) {\r\n  StkId t;\r\n  TValue key;\r\n  lua_lock(L);\r\n  t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  setsvalue(L, &key, luaS_new(L, k));\r\n  luaV_gettable(L, t, &key, L->top);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_rawget (lua_State *L, int idx) {\r\n  StkId t;\r\n  lua_lock(L);\r\n  t = index2adr(L, idx);\r\n  api_check(L, ttistable(t));\r\n  setobj2s(L, L->top - 1, luaH_get(hvalue(t), L->top - 1));\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_rawgeti (lua_State *L, int idx, int n) {\r\n  StkId o;\r\n  lua_lock(L);\r\n  o = index2adr(L, idx);\r\n  api_check(L, ttistable(o));\r\n  setobj2s(L, L->top, luaH_getnum(hvalue(o), n));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_createtable (lua_State *L, int narray, int nrec) {\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  sethvalue(L, L->top, luaH_new(L, narray, nrec));\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API int lua_getmetatable (lua_State *L, int objindex) {\r\n  const TValue *obj;\r\n  Table *mt = NULL;\r\n  int res;\r\n  lua_lock(L);\r\n  obj = index2adr(L, objindex);\r\n  switch (ttype(obj)) {\r\n    case LUA_TTABLE:\r\n      mt = hvalue(obj)->metatable;\r\n      break;\r\n    case LUA_TUSERDATA:\r\n      mt = uvalue(obj)->metatable;\r\n      break;\r\n    default:\r\n      mt = G(L)->mt[ttype(obj)];\r\n      break;\r\n  }\r\n  if (mt == NULL)\r\n    res = 0;\r\n  else {\r\n    sethvalue(L, L->top, mt);\r\n    api_incr_top(L);\r\n    res = 1;\r\n  }\r\n  lua_unlock(L);\r\n  return res;\r\n}\r\n\r\n\r\nLUA_API void lua_getfenv (lua_State *L, int idx) {\r\n  StkId o;\r\n  lua_lock(L);\r\n  o = index2adr(L, idx);\r\n  api_checkvalidindex(L, o);\r\n  switch (ttype(o)) {\r\n    case LUA_TFUNCTION:\r\n      sethvalue(L, L->top, clvalue(o)->c.env);\r\n      break;\r\n    case LUA_TUSERDATA:\r\n      sethvalue(L, L->top, uvalue(o)->env);\r\n      break;\r\n    case LUA_TTHREAD:\r\n      setobj2s(L, L->top,  gt(thvalue(o)));\r\n      break;\r\n    default:\r\n      setnilvalue(L->top);\r\n      break;\r\n  }\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\n/*\r\n** set functions (stack -> Lua)\r\n*/\r\n\r\n\r\nLUA_API void lua_settable (lua_State *L, int idx) {\r\n  StkId t;\r\n  lua_lock(L);\r\n  api_checknelems(L, 2);\r\n  t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  luaV_settable(L, t, L->top - 2, L->top - 1);\r\n  L->top -= 2;  /* pop index and value */\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_setfield (lua_State *L, int idx, const char *k) {\r\n  StkId t;\r\n  TValue key;\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  setsvalue(L, &key, luaS_new(L, k));\r\n  luaV_settable(L, t, &key, L->top - 1);\r\n  L->top--;  /* pop value */\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_rawset (lua_State *L, int idx) {\r\n  StkId t;\r\n  lua_lock(L);\r\n  api_checknelems(L, 2);\r\n  t = index2adr(L, idx);\r\n  api_check(L, ttistable(t));\r\n  setobj2t(L, luaH_set(L, hvalue(t), L->top-2), L->top-1);\r\n  luaC_barriert(L, hvalue(t), L->top-1);\r\n  L->top -= 2;\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void lua_rawseti (lua_State *L, int idx, int n) {\r\n  StkId o;\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  o = index2adr(L, idx);\r\n  api_check(L, ttistable(o));\r\n  setobj2t(L, luaH_setnum(L, hvalue(o), n), L->top-1);\r\n  luaC_barriert(L, hvalue(o), L->top-1);\r\n  L->top--;\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API int lua_setmetatable (lua_State *L, int objindex) {\r\n  TValue *obj;\r\n  Table *mt;\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  obj = index2adr(L, objindex);\r\n  api_checkvalidindex(L, obj);\r\n  if (ttisnil(L->top - 1))\r\n    mt = NULL;\r\n  else {\r\n    api_check(L, ttistable(L->top - 1));\r\n    mt = hvalue(L->top - 1);\r\n  }\r\n  switch (ttype(obj)) {\r\n    case LUA_TTABLE: {\r\n      hvalue(obj)->metatable = mt;\r\n      if (mt)\r\n        luaC_objbarriert(L, hvalue(obj), mt);\r\n      break;\r\n    }\r\n    case LUA_TUSERDATA: {\r\n      uvalue(obj)->metatable = mt;\r\n      if (mt)\r\n        luaC_objbarrier(L, rawuvalue(obj), mt);\r\n      break;\r\n    }\r\n    default: {\r\n      G(L)->mt[ttype(obj)] = mt;\r\n      break;\r\n    }\r\n  }\r\n  L->top--;\r\n  lua_unlock(L);\r\n  return 1;\r\n}\r\n\r\n\r\nLUA_API int lua_setfenv (lua_State *L, int idx) {\r\n  StkId o;\r\n  int res = 1;\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  o = index2adr(L, idx);\r\n  api_checkvalidindex(L, o);\r\n  api_check(L, ttistable(L->top - 1));\r\n  switch (ttype(o)) {\r\n    case LUA_TFUNCTION:\r\n      clvalue(o)->c.env = hvalue(L->top - 1);\r\n      break;\r\n    case LUA_TUSERDATA:\r\n      uvalue(o)->env = hvalue(L->top - 1);\r\n      break;\r\n    case LUA_TTHREAD:\r\n      sethvalue(L, gt(thvalue(o)), hvalue(L->top - 1));\r\n      break;\r\n    default:\r\n      res = 0;\r\n      break;\r\n  }\r\n  if (res) luaC_objbarrier(L, gcvalue(o), hvalue(L->top - 1));\r\n  L->top--;\r\n  lua_unlock(L);\r\n  return res;\r\n}\r\n\r\n\r\n/*\r\n** `load' and `call' functions (run Lua code)\r\n*/\r\n\r\n\r\n#define adjustresults(L,nres) \\\r\n    { if (nres == LUA_MULTRET && L->top >= L->ci->top) L->ci->top = L->top; }\r\n\r\n\r\n#define checkresults(L,na,nr) \\\r\n     api_check(L, (nr) == LUA_MULTRET || (L->ci->top - L->top >= (nr) - (na)))\r\n\t\r\n\r\nLUA_API void lua_call (lua_State *L, int nargs, int nresults) {\r\n  StkId func;\r\n  lua_lock(L);\r\n  api_checknelems(L, nargs+1);\r\n  checkresults(L, nargs, nresults);\r\n  func = L->top - (nargs+1);\r\n  luaD_call(L, func, nresults);\r\n  adjustresults(L, nresults);\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\n\r\n/*\r\n** Execute a protected call.\r\n*/\r\nstruct CallS {  /* data to `f_call' */\r\n  StkId func;\r\n  int nresults;\r\n};\r\n\r\n\r\nstatic void f_call (lua_State *L, void *ud) {\r\n  struct CallS *c = cast(struct CallS *, ud);\r\n  luaD_call(L, c->func, c->nresults);\r\n}\r\n\r\n\r\n\r\nLUA_API int lua_pcall (lua_State *L, int nargs, int nresults, int errfunc) {\r\n  struct CallS c;\r\n  int status;\r\n  ptrdiff_t func;\r\n  lua_lock(L);\r\n  api_checknelems(L, nargs+1);\r\n  checkresults(L, nargs, nresults);\r\n  if (errfunc == 0)\r\n    func = 0;\r\n  else {\r\n    StkId o = index2adr(L, errfunc);\r\n    api_checkvalidindex(L, o);\r\n    func = savestack(L, o);\r\n  }\r\n  c.func = L->top - (nargs+1);  /* function to be called */\r\n  c.nresults = nresults;\r\n  status = luaD_pcall(L, f_call, &c, savestack(L, c.func), func);\r\n  adjustresults(L, nresults);\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\n/*\r\n** Execute a protected C call.\r\n*/\r\nstruct CCallS {  /* data to `f_Ccall' */\r\n  lua_CFunction func;\r\n  void *ud;\r\n};\r\n\r\n\r\nstatic void f_Ccall (lua_State *L, void *ud) {\r\n  struct CCallS *c = cast(struct CCallS *, ud);\r\n  Closure *cl;\r\n  cl = luaF_newCclosure(L, 0, getcurrenv(L));\r\n  cl->c.f = c->func;\r\n  setclvalue(L, L->top, cl);  /* push function */\r\n  api_incr_top(L);\r\n  setpvalue(L->top, c->ud);  /* push only argument */\r\n  api_incr_top(L);\r\n  luaD_call(L, L->top - 2, 0);\r\n}\r\n\r\n\r\nLUA_API int lua_cpcall (lua_State *L, lua_CFunction func, void *ud) {\r\n  struct CCallS c;\r\n  int status;\r\n  lua_lock(L);\r\n  c.func = func;\r\n  c.ud = ud;\r\n  status = luaD_pcall(L, f_Ccall, &c, savestack(L, L->top), 0);\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\nLUA_API int lua_load (lua_State *L, lua_Reader reader, void *data,\r\n                      const char *chunkname) {\r\n  ZIO z;\r\n  int status;\r\n  lua_lock(L);\r\n  if (!chunkname) chunkname = \"?\";\r\n  luaZ_init(L, &z, reader, data);\r\n  status = luaD_protectedparser(L, &z, chunkname);\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\nLUA_API int lua_dump (lua_State *L, lua_Writer writer, void *data) {\r\n  int status;\r\n  TValue *o;\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  o = L->top - 1;\r\n  if (isLfunction(o))\r\n    status = luaU_dump(L, clvalue(o)->l.p, writer, data, 0);\r\n  else\r\n    status = 1;\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\nLUA_API int  lua_status (lua_State *L) {\r\n  return L->status;\r\n}\r\n\r\n\r\n/*\r\n** Garbage-collection function\r\n*/\r\n\r\nLUA_API int lua_gc (lua_State *L, int what, int data) {\r\n  int res = 0;\r\n  global_State *g;\r\n  lua_lock(L);\r\n  g = G(L);\r\n  switch (what) {\r\n    case LUA_GCSTOP: {\r\n      g->GCthreshold = MAX_LUMEM;\r\n      break;\r\n    }\r\n    case LUA_GCRESTART: {\r\n      g->GCthreshold = g->totalbytes;\r\n      break;\r\n    }\r\n    case LUA_GCCOLLECT: {\r\n      luaC_fullgc(L);\r\n      break;\r\n    }\r\n    case LUA_GCCOUNT: {\r\n      /* GC values are expressed in Kbytes: #bytes/2^10 */\r\n      res = cast_int(g->totalbytes >> 10);\r\n      break;\r\n    }\r\n    case LUA_GCCOUNTB: {\r\n      res = cast_int(g->totalbytes & 0x3ff);\r\n      break;\r\n    }\r\n    case LUA_GCSTEP: {\r\n      lu_mem a = (cast(lu_mem, data) << 10);\r\n      if (a <= g->totalbytes)\r\n        g->GCthreshold = g->totalbytes - a;\r\n      else\r\n        g->GCthreshold = 0;\r\n      while (g->GCthreshold <= g->totalbytes) {\r\n        luaC_step(L);\r\n        if (g->gcstate == GCSpause) {  /* end of cycle? */\r\n          res = 1;  /* signal it */\r\n          break;\r\n        }\r\n      }\r\n      break;\r\n    }\r\n    case LUA_GCSETPAUSE: {\r\n      res = g->gcpause;\r\n      g->gcpause = data;\r\n      break;\r\n    }\r\n    case LUA_GCSETSTEPMUL: {\r\n      res = g->gcstepmul;\r\n      g->gcstepmul = data;\r\n      break;\r\n    }\r\n    default: res = -1;  /* invalid option */\r\n  }\r\n  lua_unlock(L);\r\n  return res;\r\n}\r\n\r\n\r\n\r\n/*\r\n** miscellaneous functions\r\n*/\r\n\r\n\r\nLUA_API int lua_error (lua_State *L) {\r\n  lua_lock(L);\r\n  api_checknelems(L, 1);\r\n  luaG_errormsg(L);\r\n  lua_unlock(L);\r\n  return 0;  /* to avoid warnings */\r\n}\r\n\r\n\r\nLUA_API int lua_next (lua_State *L, int idx) {\r\n  StkId t;\r\n  int more;\r\n  lua_lock(L);\r\n  t = index2adr(L, idx);\r\n  api_check(L, ttistable(t));\r\n  more = luaH_next(L, hvalue(t), L->top - 1);\r\n  if (more) {\r\n    api_incr_top(L);\r\n  }\r\n  else  /* no more elements */\r\n    L->top -= 1;  /* remove key */\r\n  lua_unlock(L);\r\n  return more;\r\n}\r\n\r\n\r\nLUA_API void lua_concat (lua_State *L, int n) {\r\n  lua_lock(L);\r\n  api_checknelems(L, n);\r\n  if (n >= 2) {\r\n    luaC_checkGC(L);\r\n    luaV_concat(L, n, cast_int(L->top - L->base) - 1);\r\n    L->top -= (n-1);\r\n  }\r\n  else if (n == 0) {  /* push empty string */\r\n    setsvalue2s(L, L->top, luaS_newlstr(L, \"\", 0));\r\n    api_incr_top(L);\r\n  }\r\n  /* else n == 1; nothing to do */\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API lua_Alloc lua_getallocf (lua_State *L, void **ud) {\r\n  lua_Alloc f;\r\n  lua_lock(L);\r\n  if (ud) *ud = G(L)->ud;\r\n  f = G(L)->frealloc;\r\n  lua_unlock(L);\r\n  return f;\r\n}\r\n\r\n\r\nLUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud) {\r\n  lua_lock(L);\r\n  G(L)->ud = ud;\r\n  G(L)->frealloc = f;\r\n  lua_unlock(L);\r\n}\r\n\r\n\r\nLUA_API void *lua_newuserdata (lua_State *L, size_t size) {\r\n  Udata *u;\r\n  lua_lock(L);\r\n  luaC_checkGC(L);\r\n  u = luaS_newudata(L, size, getcurrenv(L));\r\n  setuvalue(L, L->top, u);\r\n  api_incr_top(L);\r\n  lua_unlock(L);\r\n  return u + 1;\r\n}\r\n\r\n\r\n\r\n\r\nstatic const char *aux_upvalue (StkId fi, int n, TValue **val) {\r\n  Closure *f;\r\n  if (!ttisfunction(fi)) return NULL;\r\n  f = clvalue(fi);\r\n  if (f->c.isC) {\r\n    if (!(1 <= n && n <= f->c.nupvalues)) return NULL;\r\n    *val = &f->c.upvalue[n-1];\r\n    return \"\";\r\n  }\r\n  else {\r\n    Proto *p = f->l.p;\r\n    if (!(1 <= n && n <= p->sizeupvalues)) return NULL;\r\n    *val = f->l.upvals[n-1]->v;\r\n    return getstr(p->upvalues[n-1]);\r\n  }\r\n}\r\n\r\n\r\nLUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n) {\r\n  const char *name;\r\n  TValue *val;\r\n  lua_lock(L);\r\n  name = aux_upvalue(index2adr(L, funcindex), n, &val);\r\n  if (name) {\r\n    setobj2s(L, L->top, val);\r\n    api_incr_top(L);\r\n  }\r\n  lua_unlock(L);\r\n  return name;\r\n}\r\n\r\n\r\nLUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n) {\r\n  const char *name;\r\n  TValue *val;\r\n  StkId fi;\r\n  lua_lock(L);\r\n  fi = index2adr(L, funcindex);\r\n  api_checknelems(L, 1);\r\n  name = aux_upvalue(fi, n, &val);\r\n  if (name) {\r\n    L->top--;\r\n    setobj(L, val, L->top);\r\n    luaC_barrier(L, clvalue(fi), L->top);\r\n  }\r\n  lua_unlock(L);\r\n  return name;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lapi.h",
    "content": "/*\r\n** $Id: lapi.h,v 2.2.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions from Lua API\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lapi_h\r\n#define lapi_h\r\n\r\n\r\n#include \"lobject.h\"\r\n\r\n\r\nLUAI_FUNC void luaA_pushobject (lua_State *L, const TValue *o);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lauxlib.c",
    "content": "/*\r\n** $Id: lauxlib.c,v 1.159.1.3 2008/01/21 13:20:51 roberto Exp $\r\n** Auxiliary functions for building Lua libraries\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <ctype.h>\r\n#include <errno.h>\r\n#include <stdarg.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n\r\n/* This file uses only the official API of Lua.\r\n** Any function declared here could be written as an application function.\r\n*/\r\n\r\n#define lauxlib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n\r\n\r\n#define FREELIST_REF\t0\t/* free list of references */\r\n\r\n\r\n/* convert a stack index to positive */\r\n#define abs_index(L, i)\t\t((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : \\\r\n\t\t\t\t\tlua_gettop(L) + (i) + 1)\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Error-report functions\r\n** =======================================================\r\n*/\r\n\r\n\r\nLUALIB_API int luaL_argerror (lua_State *L, int narg, const char *extramsg) {\r\n  lua_Debug ar;\r\n  if (!lua_getstack(L, 0, &ar))  /* no stack frame? */\r\n    return luaL_error(L, \"bad argument #%d (%s)\", narg, extramsg);\r\n  lua_getinfo(L, \"n\", &ar);\r\n  if (strcmp(ar.namewhat, \"method\") == 0) {\r\n    narg--;  /* do not count `self' */\r\n    if (narg == 0)  /* error is in the self argument itself? */\r\n      return luaL_error(L, \"calling \" LUA_QS \" on bad self (%s)\",\r\n                           ar.name, extramsg);\r\n  }\r\n  if (ar.name == NULL)\r\n    ar.name = \"?\";\r\n  return luaL_error(L, \"bad argument #%d to \" LUA_QS \" (%s)\",\r\n                        narg, ar.name, extramsg);\r\n}\r\n\r\n\r\nLUALIB_API int luaL_typerror (lua_State *L, int narg, const char *tname) {\r\n  const char *msg = lua_pushfstring(L, \"%s expected, got %s\",\r\n                                    tname, luaL_typename(L, narg));\r\n  return luaL_argerror(L, narg, msg);\r\n}\r\n\r\n\r\nstatic void tag_error (lua_State *L, int narg, int tag) {\r\n  luaL_typerror(L, narg, lua_typename(L, tag));\r\n}\r\n\r\n\r\nLUALIB_API void luaL_where (lua_State *L, int level) {\r\n  lua_Debug ar;\r\n  if (lua_getstack(L, level, &ar)) {  /* check function at level */\r\n    lua_getinfo(L, \"Sl\", &ar);  /* get info about it */\r\n    if (ar.currentline > 0) {  /* is there info? */\r\n      lua_pushfstring(L, \"%s:%d: \", ar.short_src, ar.currentline);\r\n      return;\r\n    }\r\n  }\r\n  lua_pushliteral(L, \"\");  /* else, no information available... */\r\n}\r\n\r\n\r\nLUALIB_API int luaL_error (lua_State *L, const char *fmt, ...) {\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  luaL_where(L, 1);\r\n  lua_pushvfstring(L, fmt, argp);\r\n  va_end(argp);\r\n  lua_concat(L, 2);\r\n  return lua_error(L);\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nLUALIB_API int luaL_checkoption (lua_State *L, int narg, const char *def,\r\n                                 const char *const lst[]) {\r\n  const char *name = (def) ? luaL_optstring(L, narg, def) :\r\n                             luaL_checkstring(L, narg);\r\n  int i;\r\n  for (i=0; lst[i]; i++)\r\n    if (strcmp(lst[i], name) == 0)\r\n      return i;\r\n  return luaL_argerror(L, narg,\r\n                       lua_pushfstring(L, \"invalid option \" LUA_QS, name));\r\n}\r\n\r\n\r\nLUALIB_API int luaL_newmetatable (lua_State *L, const char *tname) {\r\n  lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get registry.name */\r\n  if (!lua_isnil(L, -1))  /* name already in use? */\r\n    return 0;  /* leave previous value on top, but return 0 */\r\n  lua_pop(L, 1);\r\n  lua_newtable(L);  /* create metatable */\r\n  lua_pushvalue(L, -1);\r\n  lua_setfield(L, LUA_REGISTRYINDEX, tname);  /* registry.name = metatable */\r\n  return 1;\r\n}\r\n\r\n\r\nLUALIB_API void *luaL_checkudata (lua_State *L, int ud, const char *tname) {\r\n  void *p = lua_touserdata(L, ud);\r\n  if (p != NULL) {  /* value is a userdata? */\r\n    if (lua_getmetatable(L, ud)) {  /* does it have a metatable? */\r\n      lua_getfield(L, LUA_REGISTRYINDEX, tname);  /* get correct metatable */\r\n      if (lua_rawequal(L, -1, -2)) {  /* does it have the correct mt? */\r\n        lua_pop(L, 2);  /* remove both metatables */\r\n        return p;\r\n      }\r\n    }\r\n  }\r\n  luaL_typerror(L, ud, tname);  /* else error */\r\n  return NULL;  /* to avoid warnings */\r\n}\r\n\r\n\r\nLUALIB_API void luaL_checkstack (lua_State *L, int space, const char *mes) {\r\n  if (!lua_checkstack(L, space))\r\n    luaL_error(L, \"stack overflow (%s)\", mes);\r\n}\r\n\r\n\r\nLUALIB_API void luaL_checktype (lua_State *L, int narg, int t) {\r\n  if (lua_type(L, narg) != t)\r\n    tag_error(L, narg, t);\r\n}\r\n\r\n\r\nLUALIB_API void luaL_checkany (lua_State *L, int narg) {\r\n  if (lua_type(L, narg) == LUA_TNONE)\r\n    luaL_argerror(L, narg, \"value expected\");\r\n}\r\n\r\n\r\nLUALIB_API const char *luaL_checklstring (lua_State *L, int narg, size_t *len) {\r\n  const char *s = lua_tolstring(L, narg, len);\r\n  if (!s) tag_error(L, narg, LUA_TSTRING);\r\n  return s;\r\n}\r\n\r\n\r\nLUALIB_API const char *luaL_optlstring (lua_State *L, int narg,\r\n                                        const char *def, size_t *len) {\r\n  if (lua_isnoneornil(L, narg)) {\r\n    if (len)\r\n      *len = (def ? strlen(def) : 0);\r\n    return def;\r\n  }\r\n  else return luaL_checklstring(L, narg, len);\r\n}\r\n\r\n\r\nLUALIB_API lua_Number luaL_checknumber (lua_State *L, int narg) {\r\n  lua_Number d = lua_tonumber(L, narg);\r\n  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */\r\n    tag_error(L, narg, LUA_TNUMBER);\r\n  return d;\r\n}\r\n\r\n\r\nLUALIB_API lua_Number luaL_optnumber (lua_State *L, int narg, lua_Number def) {\r\n  return luaL_opt(L, luaL_checknumber, narg, def);\r\n}\r\n\r\n\r\nLUALIB_API lua_Integer luaL_checkinteger (lua_State *L, int narg) {\r\n  lua_Integer d = lua_tointeger(L, narg);\r\n  if (d == 0 && !lua_isnumber(L, narg))  /* avoid extra test when d is not 0 */\r\n    tag_error(L, narg, LUA_TNUMBER);\r\n  return d;\r\n}\r\n\r\n\r\nLUALIB_API lua_Integer luaL_optinteger (lua_State *L, int narg,\r\n                                                      lua_Integer def) {\r\n  return luaL_opt(L, luaL_checkinteger, narg, def);\r\n}\r\n\r\n\r\nLUALIB_API int luaL_getmetafield (lua_State *L, int obj, const char *event) {\r\n  if (!lua_getmetatable(L, obj))  /* no metatable? */\r\n    return 0;\r\n  lua_pushstring(L, event);\r\n  lua_rawget(L, -2);\r\n  if (lua_isnil(L, -1)) {\r\n    lua_pop(L, 2);  /* remove metatable and metafield */\r\n    return 0;\r\n  }\r\n  else {\r\n    lua_remove(L, -2);  /* remove only metatable */\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nLUALIB_API int luaL_callmeta (lua_State *L, int obj, const char *event) {\r\n  obj = abs_index(L, obj);\r\n  if (!luaL_getmetafield(L, obj, event))  /* no metafield? */\r\n    return 0;\r\n  lua_pushvalue(L, obj);\r\n  lua_call(L, 1, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nLUALIB_API void (luaL_register) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l) {\r\n  luaI_openlib(L, libname, l, 0);\r\n}\r\n\r\n\r\nstatic int libsize (const luaL_Reg *l) {\r\n  int size = 0;\r\n  for (; l->name; l++) size++;\r\n  return size;\r\n}\r\n\r\n\r\nLUALIB_API void luaI_openlib (lua_State *L, const char *libname,\r\n                              const luaL_Reg *l, int nup) {\r\n  if (libname) {\r\n    int size = libsize(l);\r\n    /* check whether lib already exists */\r\n    luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 1);\r\n    lua_getfield(L, -1, libname);  /* get _LOADED[libname] */\r\n    if (!lua_istable(L, -1)) {  /* not found? */\r\n      lua_pop(L, 1);  /* remove previous result */\r\n      /* try global variable (and create one if it does not exist) */\r\n      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)\r\n        luaL_error(L, \"name conflict for module \" LUA_QS, libname);\r\n      lua_pushvalue(L, -1);\r\n      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */\r\n    }\r\n    lua_remove(L, -2);  /* remove _LOADED table */\r\n    lua_insert(L, -(nup+1));  /* move library table to below upvalues */\r\n  }\r\n  for (; l->name; l++) {\r\n    int i;\r\n    for (i=0; i<nup; i++)  /* copy upvalues to the top */\r\n      lua_pushvalue(L, -nup);\r\n    lua_pushcclosure(L, l->func, nup);\r\n    lua_setfield(L, -(nup+2), l->name);\r\n  }\r\n  lua_pop(L, nup);  /* remove upvalues */\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** getn-setn: size for arrays\r\n** =======================================================\r\n*/\r\n\r\n#if defined(LUA_COMPAT_GETN)\r\n\r\nstatic int checkint (lua_State *L, int topop) {\r\n  int n = (lua_type(L, -1) == LUA_TNUMBER) ? lua_tointeger(L, -1) : -1;\r\n  lua_pop(L, topop);\r\n  return n;\r\n}\r\n\r\n\r\nstatic void getsizes (lua_State *L) {\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"LUA_SIZES\");\r\n  if (lua_isnil(L, -1)) {  /* no `size' table? */\r\n    lua_pop(L, 1);  /* remove nil */\r\n    lua_newtable(L);  /* create it */\r\n    lua_pushvalue(L, -1);  /* `size' will be its own metatable */\r\n    lua_setmetatable(L, -2);\r\n    lua_pushliteral(L, \"kv\");\r\n    lua_setfield(L, -2, \"__mode\");  /* metatable(N).__mode = \"kv\" */\r\n    lua_pushvalue(L, -1);\r\n    lua_setfield(L, LUA_REGISTRYINDEX, \"LUA_SIZES\");  /* store in register */\r\n  }\r\n}\r\n\r\n\r\nLUALIB_API void luaL_setn (lua_State *L, int t, int n) {\r\n  t = abs_index(L, t);\r\n  lua_pushliteral(L, \"n\");\r\n  lua_rawget(L, t);\r\n  if (checkint(L, 1) >= 0) {  /* is there a numeric field `n'? */\r\n    lua_pushliteral(L, \"n\");  /* use it */\r\n    lua_pushinteger(L, n);\r\n    lua_rawset(L, t);\r\n  }\r\n  else {  /* use `sizes' */\r\n    getsizes(L);\r\n    lua_pushvalue(L, t);\r\n    lua_pushinteger(L, n);\r\n    lua_rawset(L, -3);  /* sizes[t] = n */\r\n    lua_pop(L, 1);  /* remove `sizes' */\r\n  }\r\n}\r\n\r\n\r\nLUALIB_API int luaL_getn (lua_State *L, int t) {\r\n  int n;\r\n  t = abs_index(L, t);\r\n  lua_pushliteral(L, \"n\");  /* try t.n */\r\n  lua_rawget(L, t);\r\n  if ((n = checkint(L, 1)) >= 0) return n;\r\n  getsizes(L);  /* else try sizes[t] */\r\n  lua_pushvalue(L, t);\r\n  lua_rawget(L, -2);\r\n  if ((n = checkint(L, 2)) >= 0) return n;\r\n  return (int)lua_objlen(L, t);\r\n}\r\n\r\n#endif\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\nLUALIB_API const char *luaL_gsub (lua_State *L, const char *s, const char *p,\r\n                                                               const char *r) {\r\n  const char *wild;\r\n  size_t l = strlen(p);\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  while ((wild = strstr(s, p)) != NULL) {\r\n    luaL_addlstring(&b, s, wild - s);  /* push prefix */\r\n    luaL_addstring(&b, r);  /* push replacement in place of pattern */\r\n    s = wild + l;  /* continue after `p' */\r\n  }\r\n  luaL_addstring(&b, s);  /* push last suffix */\r\n  luaL_pushresult(&b);\r\n  return lua_tostring(L, -1);\r\n}\r\n\r\n\r\nLUALIB_API const char *luaL_findtable (lua_State *L, int idx,\r\n                                       const char *fname, int szhint) {\r\n  const char *e;\r\n  lua_pushvalue(L, idx);\r\n  do {\r\n    e = strchr(fname, '.');\r\n    if (e == NULL) e = fname + strlen(fname);\r\n    lua_pushlstring(L, fname, e - fname);\r\n    lua_rawget(L, -2);\r\n    if (lua_isnil(L, -1)) {  /* no such field? */\r\n      lua_pop(L, 1);  /* remove this nil */\r\n      lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */\r\n      lua_pushlstring(L, fname, e - fname);\r\n      lua_pushvalue(L, -2);\r\n      lua_settable(L, -4);  /* set new table into field */\r\n    }\r\n    else if (!lua_istable(L, -1)) {  /* field has a non-table value? */\r\n      lua_pop(L, 2);  /* remove table and value */\r\n      return fname;  /* return problematic part of the name */\r\n    }\r\n    lua_remove(L, -2);  /* remove previous table */\r\n    fname = e + 1;\r\n  } while (*e == '.');\r\n  return NULL;\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Generic Buffer manipulation\r\n** =======================================================\r\n*/\r\n\r\n\r\n#define bufflen(B)\t((B)->p - (B)->buffer)\r\n#define bufffree(B)\t((size_t)(LUAL_BUFFERSIZE - bufflen(B)))\r\n\r\n#define LIMIT\t(LUA_MINSTACK/2)\r\n\r\n\r\nstatic int emptybuffer (luaL_Buffer *B) {\r\n  size_t l = bufflen(B);\r\n  if (l == 0) return 0;  /* put nothing on stack */\r\n  else {\r\n    lua_pushlstring(B->L, B->buffer, l);\r\n    B->p = B->buffer;\r\n    B->lvl++;\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nstatic void adjuststack (luaL_Buffer *B) {\r\n  if (B->lvl > 1) {\r\n    lua_State *L = B->L;\r\n    int toget = 1;  /* number of levels to concat */\r\n    size_t toplen = lua_strlen(L, -1);\r\n    do {\r\n      size_t l = lua_strlen(L, -(toget+1));\r\n      if (B->lvl - toget + 1 >= LIMIT || toplen > l) {\r\n        toplen += l;\r\n        toget++;\r\n      }\r\n      else break;\r\n    } while (toget < B->lvl);\r\n    lua_concat(L, toget);\r\n    B->lvl = B->lvl - toget + 1;\r\n  }\r\n}\r\n\r\n\r\nLUALIB_API char *luaL_prepbuffer (luaL_Buffer *B) {\r\n  if (emptybuffer(B))\r\n    adjuststack(B);\r\n  return B->buffer;\r\n}\r\n\r\n\r\nLUALIB_API void luaL_addlstring (luaL_Buffer *B, const char *s, size_t l) {\r\n  while (l--)\r\n    luaL_addchar(B, *s++);\r\n}\r\n\r\n\r\nLUALIB_API void luaL_addstring (luaL_Buffer *B, const char *s) {\r\n  luaL_addlstring(B, s, strlen(s));\r\n}\r\n\r\n\r\nLUALIB_API void luaL_pushresult (luaL_Buffer *B) {\r\n  emptybuffer(B);\r\n  lua_concat(B->L, B->lvl);\r\n  B->lvl = 1;\r\n}\r\n\r\n\r\nLUALIB_API void luaL_addvalue (luaL_Buffer *B) {\r\n  lua_State *L = B->L;\r\n  size_t vl;\r\n  const char *s = lua_tolstring(L, -1, &vl);\r\n  if (vl <= bufffree(B)) {  /* fit into buffer? */\r\n    memcpy(B->p, s, vl);  /* put it there */\r\n    B->p += vl;\r\n    lua_pop(L, 1);  /* remove from stack */\r\n  }\r\n  else {\r\n    if (emptybuffer(B))\r\n      lua_insert(L, -2);  /* put buffer before new value */\r\n    B->lvl++;  /* add new value into B stack */\r\n    adjuststack(B);\r\n  }\r\n}\r\n\r\n\r\nLUALIB_API void luaL_buffinit (lua_State *L, luaL_Buffer *B) {\r\n  B->L = L;\r\n  B->p = B->buffer;\r\n  B->lvl = 0;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nLUALIB_API int luaL_ref (lua_State *L, int t) {\r\n  int ref;\r\n  t = abs_index(L, t);\r\n  if (lua_isnil(L, -1)) {\r\n    lua_pop(L, 1);  /* remove from stack */\r\n    return LUA_REFNIL;  /* `nil' has a unique fixed reference */\r\n  }\r\n  lua_rawgeti(L, t, FREELIST_REF);  /* get first free element */\r\n  ref = (int)lua_tointeger(L, -1);  /* ref = t[FREELIST_REF] */\r\n  lua_pop(L, 1);  /* remove it from stack */\r\n  if (ref != 0) {  /* any free element? */\r\n    lua_rawgeti(L, t, ref);  /* remove it from list */\r\n    lua_rawseti(L, t, FREELIST_REF);  /* (t[FREELIST_REF] = t[ref]) */\r\n  }\r\n  else {  /* no free elements */\r\n    ref = (int)lua_objlen(L, t);\r\n    ref++;  /* create new reference */\r\n  }\r\n  lua_rawseti(L, t, ref);\r\n  return ref;\r\n}\r\n\r\n\r\nLUALIB_API void luaL_unref (lua_State *L, int t, int ref) {\r\n  if (ref >= 0) {\r\n    t = abs_index(L, t);\r\n    lua_rawgeti(L, t, FREELIST_REF);\r\n    lua_rawseti(L, t, ref);  /* t[ref] = t[FREELIST_REF] */\r\n    lua_pushinteger(L, ref);\r\n    lua_rawseti(L, t, FREELIST_REF);  /* t[FREELIST_REF] = ref */\r\n  }\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Load functions\r\n** =======================================================\r\n*/\r\n\r\ntypedef struct LoadF {\r\n  int extraline;\r\n  FILE *f;\r\n  char buff[LUAL_BUFFERSIZE];\r\n} LoadF;\r\n\r\n\r\nstatic const char *getF (lua_State *L, void *ud, size_t *size) {\r\n  LoadF *lf = (LoadF *)ud;\r\n  (void)L;\r\n  if (lf->extraline) {\r\n    lf->extraline = 0;\r\n    *size = 1;\r\n    return \"\\n\";\r\n  }\r\n  if (feof(lf->f)) return NULL;\r\n  *size = fread(lf->buff, 1, sizeof(lf->buff), lf->f);\r\n  return (*size > 0) ? lf->buff : NULL;\r\n}\r\n\r\n\r\nstatic int errfile (lua_State *L, const char *what, int fnameindex) {\r\n  const char *serr = strerror(errno);\r\n  const char *filename = lua_tostring(L, fnameindex) + 1;\r\n  lua_pushfstring(L, \"cannot %s %s: %s\", what, filename, serr);\r\n  lua_remove(L, fnameindex);\r\n  return LUA_ERRFILE;\r\n}\r\n\r\n\r\nLUALIB_API int luaL_loadfile (lua_State *L, const char *filename) {\r\n  LoadF lf;\r\n  int status, readstatus;\r\n  int c;\r\n  int fnameindex = lua_gettop(L) + 1;  /* index of filename on the stack */\r\n  lf.extraline = 0;\r\n  if (filename == NULL) {\r\n    lua_pushliteral(L, \"=stdin\");\r\n    lf.f = stdin;\r\n  }\r\n  else {\r\n    lua_pushfstring(L, \"@%s\", filename);\r\n    lf.f = fopen(filename, \"r\");\r\n    if (lf.f == NULL) return errfile(L, \"open\", fnameindex);\r\n  }\r\n  c = getc(lf.f);\r\n  if (c == '#') {  /* Unix exec. file? */\r\n    lf.extraline = 1;\r\n    while ((c = getc(lf.f)) != EOF && c != '\\n') ;  /* skip first line */\r\n    if (c == '\\n') c = getc(lf.f);\r\n  }\r\n  if (c == LUA_SIGNATURE[0] && filename) {  /* binary file? */\r\n    lf.f = freopen(filename, \"rb\", lf.f);  /* reopen in binary mode */\r\n    if (lf.f == NULL) return errfile(L, \"reopen\", fnameindex);\r\n    /* skip eventual `#!...' */\r\n   while ((c = getc(lf.f)) != EOF && c != LUA_SIGNATURE[0]) ;\r\n    lf.extraline = 0;\r\n  }\r\n  ungetc(c, lf.f);\r\n  status = lua_load(L, getF, &lf, lua_tostring(L, -1));\r\n  readstatus = ferror(lf.f);\r\n  if (filename) fclose(lf.f);  /* close file (even in case of errors) */\r\n  if (readstatus) {\r\n    lua_settop(L, fnameindex);  /* ignore results from `lua_load' */\r\n    return errfile(L, \"read\", fnameindex);\r\n  }\r\n  lua_remove(L, fnameindex);\r\n  return status;\r\n}\r\n\r\n\r\ntypedef struct LoadS {\r\n  const char *s;\r\n  size_t size;\r\n} LoadS;\r\n\r\n\r\nstatic const char *getS (lua_State *L, void *ud, size_t *size) {\r\n  LoadS *ls = (LoadS *)ud;\r\n  (void)L;\r\n  if (ls->size == 0) return NULL;\r\n  *size = ls->size;\r\n  ls->size = 0;\r\n  return ls->s;\r\n}\r\n\r\n\r\nLUALIB_API int luaL_loadbuffer (lua_State *L, const char *buff, size_t size,\r\n                                const char *name) {\r\n  LoadS ls;\r\n  ls.s = buff;\r\n  ls.size = size;\r\n  return lua_load(L, getS, &ls, name);\r\n}\r\n\r\n\r\nLUALIB_API int (luaL_loadstring) (lua_State *L, const char *s) {\r\n  return luaL_loadbuffer(L, s, strlen(s), s);\r\n}\r\n\r\n\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic void *l_alloc (void *ud, void *ptr, size_t osize, size_t nsize) {\r\n  (void)ud;\r\n  (void)osize;\r\n  if (nsize == 0) {\r\n    free(ptr);\r\n    return NULL;\r\n  }\r\n  else\r\n    return realloc(ptr, nsize);\r\n}\r\n\r\n\r\nstatic int panic (lua_State *L) {\r\n  (void)L;  /* to avoid warnings */\r\n  fprintf(stderr, \"PANIC: unprotected error in call to Lua API (%s)\\n\",\r\n                   lua_tostring(L, -1));\r\n  return 0;\r\n}\r\n\r\n\r\nLUALIB_API lua_State *luaL_newstate (void) {\r\n  lua_State *L = lua_newstate(l_alloc, NULL);\r\n  if (L) lua_atpanic(L, &panic);\r\n  return L;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lauxlib.h",
    "content": "/*\r\n** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions for building Lua libraries\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lauxlib_h\r\n#define lauxlib_h\r\n\r\n\r\n#include <stddef.h>\r\n#include <stdio.h>\r\n\r\n#include \"lua.h\"\r\n\r\n\r\n#if defined(LUA_COMPAT_GETN)\r\nLUALIB_API int (luaL_getn) (lua_State *L, int t);\r\nLUALIB_API void (luaL_setn) (lua_State *L, int t, int n);\r\n#else\r\n#define luaL_getn(L,i)          ((int)lua_objlen(L, i))\r\n#define luaL_setn(L,i,j)        ((void)0)  /* no op! */\r\n#endif\r\n\r\n#if defined(LUA_COMPAT_OPENLIB)\r\n#define luaI_openlib\tluaL_openlib\r\n#endif\r\n\r\n\r\n/* extra error code for `luaL_load' */\r\n#define LUA_ERRFILE     (LUA_ERRERR+1)\r\n\r\n\r\ntypedef struct luaL_Reg {\r\n  const char *name;\r\n  lua_CFunction func;\r\n} luaL_Reg;\r\n\r\n\r\n\r\nLUALIB_API void (luaI_openlib) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l, int nup);\r\nLUALIB_API void (luaL_register) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l);\r\nLUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_typerror) (lua_State *L, int narg, const char *tname);\r\nLUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg);\r\nLUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg,\r\n                                                          size_t *l);\r\nLUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg,\r\n                                          const char *def, size_t *l);\r\nLUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg);\r\nLUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def);\r\n\r\nLUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);\r\nLUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,\r\n                                          lua_Integer def);\r\n\r\nLUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);\r\nLUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t);\r\nLUALIB_API void (luaL_checkany) (lua_State *L, int narg);\r\n\r\nLUALIB_API int   (luaL_newmetatable) (lua_State *L, const char *tname);\r\nLUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname);\r\n\r\nLUALIB_API void (luaL_where) (lua_State *L, int lvl);\r\nLUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);\r\n\r\nLUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,\r\n                                   const char *const lst[]);\r\n\r\nLUALIB_API int (luaL_ref) (lua_State *L, int t);\r\nLUALIB_API void (luaL_unref) (lua_State *L, int t, int ref);\r\n\r\nLUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename);\r\nLUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,\r\n                                  const char *name);\r\nLUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);\r\n\r\nLUALIB_API lua_State *(luaL_newstate) (void);\r\n\r\n\r\nLUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,\r\n                                                  const char *r);\r\n\r\nLUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,\r\n                                         const char *fname, int szhint);\r\n\r\n\r\n\r\n\r\n/*\r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define luaL_argcheck(L, cond,numarg,extramsg)\t\\\r\n\t\t((void)((cond) || luaL_argerror(L, (numarg), (extramsg))))\r\n#define luaL_checkstring(L,n)\t(luaL_checklstring(L, (n), NULL))\r\n#define luaL_optstring(L,n,d)\t(luaL_optlstring(L, (n), (d), NULL))\r\n#define luaL_checkint(L,n)\t((int)luaL_checkinteger(L, (n)))\r\n#define luaL_optint(L,n,d)\t((int)luaL_optinteger(L, (n), (d)))\r\n#define luaL_checklong(L,n)\t((long)luaL_checkinteger(L, (n)))\r\n#define luaL_optlong(L,n,d)\t((long)luaL_optinteger(L, (n), (d)))\r\n\r\n#define luaL_typename(L,i)\tlua_typename(L, lua_type(L,(i)))\r\n\r\n#define luaL_dofile(L, fn) \\\r\n\t(luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_dostring(L, s) \\\r\n\t(luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_getmetatable(L,n)\t(lua_getfield(L, LUA_REGISTRYINDEX, (n)))\r\n\r\n#define luaL_opt(L,f,n,d)\t(lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))\r\n\r\n/*\r\n** {======================================================\r\n** Generic Buffer manipulation\r\n** =======================================================\r\n*/\r\n\r\n\r\n\r\ntypedef struct luaL_Buffer {\r\n  char *p;\t\t\t/* current position in buffer */\r\n  int lvl;  /* number of strings in the stack (level) */\r\n  lua_State *L;\r\n  char buffer[LUAL_BUFFERSIZE];\r\n} luaL_Buffer;\r\n\r\n#define luaL_addchar(B,c) \\\r\n  ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \\\r\n   (*(B)->p++ = (char)(c)))\r\n\r\n/* compatibility only */\r\n#define luaL_putchar(B,c)\tluaL_addchar(B,c)\r\n\r\n#define luaL_addsize(B,n)\t((B)->p += (n))\r\n\r\nLUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B);\r\nLUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l);\r\nLUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s);\r\nLUALIB_API void (luaL_addvalue) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_pushresult) (luaL_Buffer *B);\r\n\r\n\r\n/* }====================================================== */\r\n\r\n\r\n/* compatibility with ref system */\r\n\r\n/* pre-defined references */\r\n#define LUA_NOREF       (-2)\r\n#define LUA_REFNIL      (-1)\r\n\r\n#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \\\r\n      (lua_pushstring(L, \"unlocked references are obsolete\"), lua_error(L), 0))\r\n\r\n#define lua_unref(L,ref)        luaL_unref(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n#define lua_getref(L,ref)       lua_rawgeti(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n\r\n#define luaL_reg\tluaL_Reg\r\n\r\n#endif\r\n\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lbaselib.c",
    "content": "/*\r\n** $Id: lbaselib.c,v 1.191.1.6 2008/02/14 16:46:22 roberto Exp $\r\n** Basic library\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n\r\n#include <ctype.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define lbaselib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n\r\n\r\n/*\r\n** If your system does not support `stdout', you can just remove this function.\r\n** If you need, you can define your own `print' function, following this\r\n** model but changing `fputs' to put the strings at a proper place\r\n** (a console window or a log file, for instance).\r\n*/\r\nstatic int luaB_print (lua_State *L) {\r\n  int n = lua_gettop(L);  /* number of arguments */\r\n  int i;\r\n  lua_getglobal(L, \"tostring\");\r\n  for (i=1; i<=n; i++) {\r\n    const char *s;\r\n    lua_pushvalue(L, -1);  /* function to be called */\r\n    lua_pushvalue(L, i);   /* value to print */\r\n    lua_call(L, 1, 1);\r\n    s = lua_tostring(L, -1);  /* get result */\r\n    if (s == NULL)\r\n      return luaL_error(L, LUA_QL(\"tostring\") \" must return a string to \"\r\n                           LUA_QL(\"print\"));\r\n    if (i>1) fputs(\"\\t\", stdout);\r\n    fputs(s, stdout);\r\n    lua_pop(L, 1);  /* pop result */\r\n  }\r\n  fputs(\"\\n\", stdout);\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int luaB_tonumber (lua_State *L) {\r\n  int base = luaL_optint(L, 2, 10);\r\n  if (base == 10) {  /* standard conversion */\r\n    luaL_checkany(L, 1);\r\n    if (lua_isnumber(L, 1)) {\r\n      lua_pushnumber(L, lua_tonumber(L, 1));\r\n      return 1;\r\n    }\r\n  }\r\n  else {\r\n    const char *s1 = luaL_checkstring(L, 1);\r\n    char *s2;\r\n    unsigned long n;\r\n    luaL_argcheck(L, 2 <= base && base <= 36, 2, \"base out of range\");\r\n    n = strtoul(s1, &s2, base);\r\n    if (s1 != s2) {  /* at least one valid digit? */\r\n      while (isspace((unsigned char)(*s2))) s2++;  /* skip trailing spaces */\r\n      if (*s2 == '\\0') {  /* no invalid trailing characters? */\r\n        lua_pushnumber(L, (lua_Number)n);\r\n        return 1;\r\n      }\r\n    }\r\n  }\r\n  lua_pushnil(L);  /* else not a number */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_error (lua_State *L) {\r\n  int level = luaL_optint(L, 2, 1);\r\n  lua_settop(L, 1);\r\n  if (lua_isstring(L, 1) && level > 0) {  /* add extra information? */\r\n    luaL_where(L, level);\r\n    lua_pushvalue(L, 1);\r\n    lua_concat(L, 2);\r\n  }\r\n  return lua_error(L);\r\n}\r\n\r\n\r\nstatic int luaB_getmetatable (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    lua_pushnil(L);\r\n    return 1;  /* no metatable */\r\n  }\r\n  luaL_getmetafield(L, 1, \"__metatable\");\r\n  return 1;  /* returns either __metatable field (if present) or metatable */\r\n}\r\n\r\n\r\nstatic int luaB_setmetatable (lua_State *L) {\r\n  int t = lua_type(L, 2);\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,\r\n                    \"nil or table expected\");\r\n  if (luaL_getmetafield(L, 1, \"__metatable\"))\r\n    luaL_error(L, \"cannot change a protected metatable\");\r\n  lua_settop(L, 2);\r\n  lua_setmetatable(L, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void getfunc (lua_State *L, int opt) {\r\n  if (lua_isfunction(L, 1)) lua_pushvalue(L, 1);\r\n  else {\r\n    lua_Debug ar;\r\n    int level = opt ? luaL_optint(L, 1, 1) : luaL_checkint(L, 1);\r\n    luaL_argcheck(L, level >= 0, 1, \"level must be non-negative\");\r\n    if (lua_getstack(L, level, &ar) == 0)\r\n      luaL_argerror(L, 1, \"invalid level\");\r\n    lua_getinfo(L, \"f\", &ar);\r\n    if (lua_isnil(L, -1))\r\n      luaL_error(L, \"no function environment for tail call at level %d\",\r\n                    level);\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_getfenv (lua_State *L) {\r\n  getfunc(L, 1);\r\n  if (lua_iscfunction(L, -1))  /* is a C function? */\r\n    lua_pushvalue(L, LUA_GLOBALSINDEX);  /* return the thread's global env. */\r\n  else\r\n    lua_getfenv(L, -1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_setfenv (lua_State *L) {\r\n  luaL_checktype(L, 2, LUA_TTABLE);\r\n  getfunc(L, 0);\r\n  lua_pushvalue(L, 2);\r\n  if (lua_isnumber(L, 1) && lua_tonumber(L, 1) == 0) {\r\n    /* change environment of current thread */\r\n    lua_pushthread(L);\r\n    lua_insert(L, -2);\r\n    lua_setfenv(L, -2);\r\n    return 0;\r\n  }\r\n  else if (lua_iscfunction(L, -2) || lua_setfenv(L, -2) == 0)\r\n    luaL_error(L,\r\n          LUA_QL(\"setfenv\") \" cannot change environment of given object\");\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_rawequal (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  luaL_checkany(L, 2);\r\n  lua_pushboolean(L, lua_rawequal(L, 1, 2));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_rawget (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  luaL_checkany(L, 2);\r\n  lua_settop(L, 2);\r\n  lua_rawget(L, 1);\r\n  return 1;\r\n}\r\n\r\nstatic int luaB_rawset (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  luaL_checkany(L, 2);\r\n  luaL_checkany(L, 3);\r\n  lua_settop(L, 3);\r\n  lua_rawset(L, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_gcinfo (lua_State *L) {\r\n  lua_pushinteger(L, lua_getgccount(L));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_collectgarbage (lua_State *L) {\r\n  static const char *const opts[] = {\"stop\", \"restart\", \"collect\",\r\n    \"count\", \"step\", \"setpause\", \"setstepmul\", NULL};\r\n  static const int optsnum[] = {LUA_GCSTOP, LUA_GCRESTART, LUA_GCCOLLECT,\r\n    LUA_GCCOUNT, LUA_GCSTEP, LUA_GCSETPAUSE, LUA_GCSETSTEPMUL};\r\n  int o = luaL_checkoption(L, 1, \"collect\", opts);\r\n  int ex = luaL_optint(L, 2, 0);\r\n  int res = lua_gc(L, optsnum[o], ex);\r\n  switch (optsnum[o]) {\r\n    case LUA_GCCOUNT: {\r\n      int b = lua_gc(L, LUA_GCCOUNTB, 0);\r\n      lua_pushnumber(L, res + ((lua_Number)b/1024));\r\n      return 1;\r\n    }\r\n    case LUA_GCSTEP: {\r\n      lua_pushboolean(L, res);\r\n      return 1;\r\n    }\r\n    default: {\r\n      lua_pushnumber(L, res);\r\n      return 1;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_type (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  lua_pushstring(L, luaL_typename(L, 1));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_next (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  lua_settop(L, 2);  /* create a 2nd argument if there isn't one */\r\n  if (lua_next(L, 1))\r\n    return 2;\r\n  else {\r\n    lua_pushnil(L);\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_pairs (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */\r\n  lua_pushvalue(L, 1);  /* state, */\r\n  lua_pushnil(L);  /* and initial value */\r\n  return 3;\r\n}\r\n\r\n\r\nstatic int ipairsaux (lua_State *L) {\r\n  int i = luaL_checkint(L, 2);\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  i++;  /* next value */\r\n  lua_pushinteger(L, i);\r\n  lua_rawgeti(L, 1, i);\r\n  return (lua_isnil(L, -1)) ? 0 : 2;\r\n}\r\n\r\n\r\nstatic int luaB_ipairs (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  lua_pushvalue(L, lua_upvalueindex(1));  /* return generator, */\r\n  lua_pushvalue(L, 1);  /* state, */\r\n  lua_pushinteger(L, 0);  /* and initial value */\r\n  return 3;\r\n}\r\n\r\n\r\nstatic int load_aux (lua_State *L, int status) {\r\n  if (status == 0)  /* OK? */\r\n    return 1;\r\n  else {\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);  /* put before error message */\r\n    return 2;  /* return nil plus error message */\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_loadstring (lua_State *L) {\r\n  size_t l;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  const char *chunkname = luaL_optstring(L, 2, s);\r\n  return load_aux(L, luaL_loadbuffer(L, s, l, chunkname));\r\n}\r\n\r\n\r\nstatic int luaB_loadfile (lua_State *L) {\r\n  const char *fname = luaL_optstring(L, 1, NULL);\r\n  return load_aux(L, luaL_loadfile(L, fname));\r\n}\r\n\r\n\r\n/*\r\n** Reader for generic `load' function: `lua_load' uses the\r\n** stack for internal stuff, so the reader cannot change the\r\n** stack top. Instead, it keeps its resulting string in a\r\n** reserved slot inside the stack.\r\n*/\r\nstatic const char *generic_reader (lua_State *L, void *ud, size_t *size) {\r\n  (void)ud;  /* to avoid warnings */\r\n  luaL_checkstack(L, 2, \"too many nested functions\");\r\n  lua_pushvalue(L, 1);  /* get function */\r\n  lua_call(L, 0, 1);  /* call it */\r\n  if (lua_isnil(L, -1)) {\r\n    *size = 0;\r\n    return NULL;\r\n  }\r\n  else if (lua_isstring(L, -1)) {\r\n    lua_replace(L, 3);  /* save string in a reserved stack slot */\r\n    return lua_tolstring(L, 3, size);\r\n  }\r\n  else luaL_error(L, \"reader function must return a string\");\r\n  return NULL;  /* to avoid warnings */\r\n}\r\n\r\n\r\nstatic int luaB_load (lua_State *L) {\r\n  int status;\r\n  const char *cname = luaL_optstring(L, 2, \"=(load)\");\r\n  luaL_checktype(L, 1, LUA_TFUNCTION);\r\n  lua_settop(L, 3);  /* function, eventual name, plus one reserved slot */\r\n  status = lua_load(L, generic_reader, NULL, cname);\r\n  return load_aux(L, status);\r\n}\r\n\r\n\r\nstatic int luaB_dofile (lua_State *L) {\r\n  const char *fname = luaL_optstring(L, 1, NULL);\r\n  int n = lua_gettop(L);\r\n  if (luaL_loadfile(L, fname) != 0) lua_error(L);\r\n  lua_call(L, 0, LUA_MULTRET);\r\n  return lua_gettop(L) - n;\r\n}\r\n\r\n\r\nstatic int luaB_assert (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  if (!lua_toboolean(L, 1))\r\n    return luaL_error(L, \"%s\", luaL_optstring(L, 2, \"assertion failed!\"));\r\n  return lua_gettop(L);\r\n}\r\n\r\n\r\nstatic int luaB_unpack (lua_State *L) {\r\n  int i, e, n;\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  i = luaL_optint(L, 2, 1);\r\n  e = luaL_opt(L, luaL_checkint, 3, luaL_getn(L, 1));\r\n  if (i > e) return 0;  /* empty range */\r\n  n = e - i + 1;  /* number of elements */\r\n  if (n <= 0 || !lua_checkstack(L, n))  /* n <= 0 means arith. overflow */\r\n    return luaL_error(L, \"too many results to unpack\");\r\n  lua_rawgeti(L, 1, i);  /* push arg[i] (avoiding overflow problems) */\r\n  while (i++ < e)  /* push arg[i + 1...e] */\r\n    lua_rawgeti(L, 1, i);\r\n  return n;\r\n}\r\n\r\n\r\nstatic int luaB_select (lua_State *L) {\r\n  int n = lua_gettop(L);\r\n  if (lua_type(L, 1) == LUA_TSTRING && *lua_tostring(L, 1) == '#') {\r\n    lua_pushinteger(L, n-1);\r\n    return 1;\r\n  }\r\n  else {\r\n    int i = luaL_checkint(L, 1);\r\n    if (i < 0) i = n + i;\r\n    else if (i > n) i = n;\r\n    luaL_argcheck(L, 1 <= i, 1, \"index out of range\");\r\n    return n - i;\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_pcall (lua_State *L) {\r\n  int status;\r\n  luaL_checkany(L, 1);\r\n  status = lua_pcall(L, lua_gettop(L) - 1, LUA_MULTRET, 0);\r\n  lua_pushboolean(L, (status == 0));\r\n  lua_insert(L, 1);\r\n  return lua_gettop(L);  /* return status + all results */\r\n}\r\n\r\n\r\nstatic int luaB_xpcall (lua_State *L) {\r\n  int status;\r\n  luaL_checkany(L, 2);\r\n  lua_settop(L, 2);\r\n  lua_insert(L, 1);  /* put error function under function to be called */\r\n  status = lua_pcall(L, 0, LUA_MULTRET, 1);\r\n  lua_pushboolean(L, (status == 0));\r\n  lua_replace(L, 1);\r\n  return lua_gettop(L);  /* return status + all results */\r\n}\r\n\r\n\r\nstatic int luaB_tostring (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  if (luaL_callmeta(L, 1, \"__tostring\"))  /* is there a metafield? */\r\n    return 1;  /* use its value */\r\n  switch (lua_type(L, 1)) {\r\n    case LUA_TNUMBER:\r\n      lua_pushstring(L, lua_tostring(L, 1));\r\n      break;\r\n    case LUA_TSTRING:\r\n      lua_pushvalue(L, 1);\r\n      break;\r\n    case LUA_TBOOLEAN:\r\n      lua_pushstring(L, (lua_toboolean(L, 1) ? \"true\" : \"false\"));\r\n      break;\r\n    case LUA_TNIL:\r\n      lua_pushliteral(L, \"nil\");\r\n      break;\r\n    default:\r\n      lua_pushfstring(L, \"%s: %p\", luaL_typename(L, 1), lua_topointer(L, 1));\r\n      break;\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_newproxy (lua_State *L) {\r\n  lua_settop(L, 1);\r\n  lua_newuserdata(L, 0);  /* create proxy */\r\n  if (lua_toboolean(L, 1) == 0)\r\n    return 1;  /* no metatable */\r\n  else if (lua_isboolean(L, 1)) {\r\n    lua_newtable(L);  /* create a new metatable `m' ... */\r\n    lua_pushvalue(L, -1);  /* ... and mark `m' as a valid metatable */\r\n    lua_pushboolean(L, 1);\r\n    lua_rawset(L, lua_upvalueindex(1));  /* weaktable[m] = true */\r\n  }\r\n  else {\r\n    int validproxy = 0;  /* to check if weaktable[metatable(u)] == true */\r\n    if (lua_getmetatable(L, 1)) {\r\n      lua_rawget(L, lua_upvalueindex(1));\r\n      validproxy = lua_toboolean(L, -1);\r\n      lua_pop(L, 1);  /* remove value */\r\n    }\r\n    luaL_argcheck(L, validproxy, 1, \"boolean or proxy expected\");\r\n    lua_getmetatable(L, 1);  /* metatable is valid; get it */\r\n  }\r\n  lua_setmetatable(L, 2);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const luaL_Reg base_funcs[] = {\r\n  {\"assert\", luaB_assert},\r\n  {\"collectgarbage\", luaB_collectgarbage},\r\n  {\"dofile\", luaB_dofile},\r\n  {\"error\", luaB_error},\r\n  {\"gcinfo\", luaB_gcinfo},\r\n  {\"getfenv\", luaB_getfenv},\r\n  {\"getmetatable\", luaB_getmetatable},\r\n  {\"loadfile\", luaB_loadfile},\r\n  {\"load\", luaB_load},\r\n  {\"loadstring\", luaB_loadstring},\r\n  {\"next\", luaB_next},\r\n  {\"pcall\", luaB_pcall},\r\n  {\"print\", luaB_print},\r\n  {\"rawequal\", luaB_rawequal},\r\n  {\"rawget\", luaB_rawget},\r\n  {\"rawset\", luaB_rawset},\r\n  {\"select\", luaB_select},\r\n  {\"setfenv\", luaB_setfenv},\r\n  {\"setmetatable\", luaB_setmetatable},\r\n  {\"tonumber\", luaB_tonumber},\r\n  {\"tostring\", luaB_tostring},\r\n  {\"type\", luaB_type},\r\n  {\"unpack\", luaB_unpack},\r\n  {\"xpcall\", luaB_xpcall},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Coroutine library\r\n** =======================================================\r\n*/\r\n\r\n#define CO_RUN\t0\t/* running */\r\n#define CO_SUS\t1\t/* suspended */\r\n#define CO_NOR\t2\t/* 'normal' (it resumed another coroutine) */\r\n#define CO_DEAD\t3\r\n\r\nstatic const char *const statnames[] =\r\n    {\"running\", \"suspended\", \"normal\", \"dead\"};\r\n\r\nstatic int costatus (lua_State *L, lua_State *co) {\r\n  if (L == co) return CO_RUN;\r\n  switch (lua_status(co)) {\r\n    case LUA_YIELD:\r\n      return CO_SUS;\r\n    case 0: {\r\n      lua_Debug ar;\r\n      if (lua_getstack(co, 0, &ar) > 0)  /* does it have frames? */\r\n        return CO_NOR;  /* it is running */\r\n      else if (lua_gettop(co) == 0)\r\n          return CO_DEAD;\r\n      else\r\n        return CO_SUS;  /* initial state */\r\n    }\r\n    default:  /* some error occured */\r\n      return CO_DEAD;\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_costatus (lua_State *L) {\r\n  lua_State *co = lua_tothread(L, 1);\r\n  luaL_argcheck(L, co, 1, \"coroutine expected\");\r\n  lua_pushstring(L, statnames[costatus(L, co)]);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int auxresume (lua_State *L, lua_State *co, int narg) {\r\n  int status = costatus(L, co);\r\n  if (!lua_checkstack(co, narg))\r\n    luaL_error(L, \"too many arguments to resume\");\r\n  if (status != CO_SUS) {\r\n    lua_pushfstring(L, \"cannot resume %s coroutine\", statnames[status]);\r\n    return -1;  /* error flag */\r\n  }\r\n  lua_xmove(L, co, narg);\r\n  lua_setlevel(L, co);\r\n  status = lua_resume(co, narg);\r\n  if (status == 0 || status == LUA_YIELD) {\r\n    int nres = lua_gettop(co);\r\n    if (!lua_checkstack(L, nres + 1))\r\n      luaL_error(L, \"too many results to resume\");\r\n    lua_xmove(co, L, nres);  /* move yielded values */\r\n    return nres;\r\n  }\r\n  else {\r\n    lua_xmove(co, L, 1);  /* move error message */\r\n    return -1;  /* error flag */\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_coresume (lua_State *L) {\r\n  lua_State *co = lua_tothread(L, 1);\r\n  int r;\r\n  luaL_argcheck(L, co, 1, \"coroutine expected\");\r\n  r = auxresume(L, co, lua_gettop(L) - 1);\r\n  if (r < 0) {\r\n    lua_pushboolean(L, 0);\r\n    lua_insert(L, -2);\r\n    return 2;  /* return false + error message */\r\n  }\r\n  else {\r\n    lua_pushboolean(L, 1);\r\n    lua_insert(L, -(r + 1));\r\n    return r + 1;  /* return true + `resume' returns */\r\n  }\r\n}\r\n\r\n\r\nstatic int luaB_auxwrap (lua_State *L) {\r\n  lua_State *co = lua_tothread(L, lua_upvalueindex(1));\r\n  int r = auxresume(L, co, lua_gettop(L));\r\n  if (r < 0) {\r\n    if (lua_isstring(L, -1)) {  /* error object is a string? */\r\n      luaL_where(L, 1);  /* add extra info */\r\n      lua_insert(L, -2);\r\n      lua_concat(L, 2);\r\n    }\r\n    lua_error(L);  /* propagate error */\r\n  }\r\n  return r;\r\n}\r\n\r\n\r\nstatic int luaB_cocreate (lua_State *L) {\r\n  lua_State *NL = lua_newthread(L);\r\n  luaL_argcheck(L, lua_isfunction(L, 1) && !lua_iscfunction(L, 1), 1,\r\n    \"Lua function expected\");\r\n  lua_pushvalue(L, 1);  /* move function to top */\r\n  lua_xmove(L, NL, 1);  /* move function from L to NL */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_cowrap (lua_State *L) {\r\n  luaB_cocreate(L);\r\n  lua_pushcclosure(L, luaB_auxwrap, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int luaB_yield (lua_State *L) {\r\n  return lua_yield(L, lua_gettop(L));\r\n}\r\n\r\n\r\nstatic int luaB_corunning (lua_State *L) {\r\n  if (lua_pushthread(L))\r\n    lua_pushnil(L);  /* main thread is not a coroutine */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const luaL_Reg co_funcs[] = {\r\n  {\"create\", luaB_cocreate},\r\n  {\"resume\", luaB_coresume},\r\n  {\"running\", luaB_corunning},\r\n  {\"status\", luaB_costatus},\r\n  {\"wrap\", luaB_cowrap},\r\n  {\"yield\", luaB_yield},\r\n  {NULL, NULL}\r\n};\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic void auxopen (lua_State *L, const char *name,\r\n                     lua_CFunction f, lua_CFunction u) {\r\n  lua_pushcfunction(L, u);\r\n  lua_pushcclosure(L, f, 1);\r\n  lua_setfield(L, -2, name);\r\n}\r\n\r\n\r\nstatic void base_open (lua_State *L) {\r\n  /* set global _G */\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  lua_setglobal(L, \"_G\");\r\n  /* open lib into global table */\r\n  luaL_register(L, \"_G\", base_funcs);\r\n  lua_pushliteral(L, LUA_VERSION);\r\n  lua_setglobal(L, \"_VERSION\");  /* set global _VERSION */\r\n  /* `ipairs' and `pairs' need auxiliary functions as upvalues */\r\n  auxopen(L, \"ipairs\", luaB_ipairs, ipairsaux);\r\n  auxopen(L, \"pairs\", luaB_pairs, luaB_next);\r\n  /* `newproxy' needs a weaktable as upvalue */\r\n  lua_createtable(L, 0, 1);  /* new table `w' */\r\n  lua_pushvalue(L, -1);  /* `w' will be its own metatable */\r\n  lua_setmetatable(L, -2);\r\n  lua_pushliteral(L, \"kv\");\r\n  lua_setfield(L, -2, \"__mode\");  /* metatable(w).__mode = \"kv\" */\r\n  lua_pushcclosure(L, luaB_newproxy, 1);\r\n  lua_setglobal(L, \"newproxy\");  /* set global `newproxy' */\r\n}\r\n\r\n\r\nLUALIB_API int luaopen_base (lua_State *L) {\r\n  base_open(L);\r\n  luaL_register(L, LUA_COLIBNAME, co_funcs);\r\n  return 2;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lcode.c",
    "content": "/*\r\n** $Id: lcode.c,v 2.25.1.5 2011/01/31 14:53:16 roberto Exp $\r\n** Code generator for Lua\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stdlib.h>\r\n\r\n#define lcode_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lcode.h\"\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lgc.h\"\r\n#include \"llex.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lparser.h\"\r\n#include \"ltable.h\"\r\n\r\n\r\n#define hasjumps(e)\t((e)->t != (e)->f)\r\n\r\n\r\nstatic int isnumeral(expdesc *e) {\r\n  return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP);\r\n}\r\n\r\n\r\nvoid luaK_nil (FuncState *fs, int from, int n) {\r\n  Instruction *previous;\r\n  if (fs->pc > fs->lasttarget) {  /* no jumps to current position? */\r\n    if (fs->pc == 0) {  /* function start? */\r\n      if (from >= fs->nactvar)\r\n        return;  /* positions are already clean */\r\n    }\r\n    else {\r\n      previous = &fs->f->code[fs->pc-1];\r\n      if (GET_OPCODE(*previous) == OP_LOADNIL) {\r\n        int pfrom = GETARG_A(*previous);\r\n        int pto = GETARG_B(*previous);\r\n        if (pfrom <= from && from <= pto+1) {  /* can connect both? */\r\n          if (from+n-1 > pto)\r\n            SETARG_B(*previous, from+n-1);\r\n          return;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0);  /* else no optimization */\r\n}\r\n\r\n\r\nint luaK_jump (FuncState *fs) {\r\n  int jpc = fs->jpc;  /* save list of jumps to here */\r\n  int j;\r\n  fs->jpc = NO_JUMP;\r\n  j = luaK_codeAsBx(fs, OP_JMP, 0, NO_JUMP);\r\n  luaK_concat(fs, &j, jpc);  /* keep them on hold */\r\n  return j;\r\n}\r\n\r\n\r\nvoid luaK_ret (FuncState *fs, int first, int nret) {\r\n  luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);\r\n}\r\n\r\n\r\nstatic int condjump (FuncState *fs, OpCode op, int A, int B, int C) {\r\n  luaK_codeABC(fs, op, A, B, C);\r\n  return luaK_jump(fs);\r\n}\r\n\r\n\r\nstatic void fixjump (FuncState *fs, int pc, int dest) {\r\n  Instruction *jmp = &fs->f->code[pc];\r\n  int offset = dest-(pc+1);\r\n  lua_assert(dest != NO_JUMP);\r\n  if (abs(offset) > MAXARG_sBx)\r\n    luaX_syntaxerror(fs->ls, \"control structure too long\");\r\n  SETARG_sBx(*jmp, offset);\r\n}\r\n\r\n\r\n/*\r\n** returns current `pc' and marks it as a jump target (to avoid wrong\r\n** optimizations with consecutive instructions not in the same basic block).\r\n*/\r\nint luaK_getlabel (FuncState *fs) {\r\n  fs->lasttarget = fs->pc;\r\n  return fs->pc;\r\n}\r\n\r\n\r\nstatic int getjump (FuncState *fs, int pc) {\r\n  int offset = GETARG_sBx(fs->f->code[pc]);\r\n  if (offset == NO_JUMP)  /* point to itself represents end of list */\r\n    return NO_JUMP;  /* end of list */\r\n  else\r\n    return (pc+1)+offset;  /* turn offset into absolute position */\r\n}\r\n\r\n\r\nstatic Instruction *getjumpcontrol (FuncState *fs, int pc) {\r\n  Instruction *pi = &fs->f->code[pc];\r\n  if (pc >= 1 && testTMode(GET_OPCODE(*(pi-1))))\r\n    return pi-1;\r\n  else\r\n    return pi;\r\n}\r\n\r\n\r\n/*\r\n** check whether list has any jump that do not produce a value\r\n** (or produce an inverted value)\r\n*/\r\nstatic int need_value (FuncState *fs, int list) {\r\n  for (; list != NO_JUMP; list = getjump(fs, list)) {\r\n    Instruction i = *getjumpcontrol(fs, list);\r\n    if (GET_OPCODE(i) != OP_TESTSET) return 1;\r\n  }\r\n  return 0;  /* not found */\r\n}\r\n\r\n\r\nstatic int patchtestreg (FuncState *fs, int node, int reg) {\r\n  Instruction *i = getjumpcontrol(fs, node);\r\n  if (GET_OPCODE(*i) != OP_TESTSET)\r\n    return 0;  /* cannot patch other instructions */\r\n  if (reg != NO_REG && reg != GETARG_B(*i))\r\n    SETARG_A(*i, reg);\r\n  else  /* no register to put value or register already has the value */\r\n    *i = CREATE_ABC(OP_TEST, GETARG_B(*i), 0, GETARG_C(*i));\r\n\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void removevalues (FuncState *fs, int list) {\r\n  for (; list != NO_JUMP; list = getjump(fs, list))\r\n      patchtestreg(fs, list, NO_REG);\r\n}\r\n\r\n\r\nstatic void patchlistaux (FuncState *fs, int list, int vtarget, int reg,\r\n                          int dtarget) {\r\n  while (list != NO_JUMP) {\r\n    int next = getjump(fs, list);\r\n    if (patchtestreg(fs, list, reg))\r\n      fixjump(fs, list, vtarget);\r\n    else\r\n      fixjump(fs, list, dtarget);  /* jump to default target */\r\n    list = next;\r\n  }\r\n}\r\n\r\n\r\nstatic void dischargejpc (FuncState *fs) {\r\n  patchlistaux(fs, fs->jpc, fs->pc, NO_REG, fs->pc);\r\n  fs->jpc = NO_JUMP;\r\n}\r\n\r\n\r\nvoid luaK_patchlist (FuncState *fs, int list, int target) {\r\n  if (target == fs->pc)\r\n    luaK_patchtohere(fs, list);\r\n  else {\r\n    lua_assert(target < fs->pc);\r\n    patchlistaux(fs, list, target, NO_REG, target);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_patchtohere (FuncState *fs, int list) {\r\n  luaK_getlabel(fs);\r\n  luaK_concat(fs, &fs->jpc, list);\r\n}\r\n\r\n\r\nvoid luaK_concat (FuncState *fs, int *l1, int l2) {\r\n  if (l2 == NO_JUMP) return;\r\n  else if (*l1 == NO_JUMP)\r\n    *l1 = l2;\r\n  else {\r\n    int list = *l1;\r\n    int next;\r\n    while ((next = getjump(fs, list)) != NO_JUMP)  /* find last element */\r\n      list = next;\r\n    fixjump(fs, list, l2);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_checkstack (FuncState *fs, int n) {\r\n  int newstack = fs->freereg + n;\r\n  if (newstack > fs->f->maxstacksize) {\r\n    if (newstack >= MAXSTACK)\r\n      luaX_syntaxerror(fs->ls, \"function or expression too complex\");\r\n    fs->f->maxstacksize = cast_byte(newstack);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_reserveregs (FuncState *fs, int n) {\r\n  luaK_checkstack(fs, n);\r\n  fs->freereg += n;\r\n}\r\n\r\n\r\nstatic void freereg (FuncState *fs, int reg) {\r\n  if (!ISK(reg) && reg >= fs->nactvar) {\r\n    fs->freereg--;\r\n    lua_assert(reg == fs->freereg);\r\n  }\r\n}\r\n\r\n\r\nstatic void freeexp (FuncState *fs, expdesc *e) {\r\n  if (e->k == VNONRELOC)\r\n    freereg(fs, e->u.s.info);\r\n}\r\n\r\n\r\nstatic int addk (FuncState *fs, TValue *k, TValue *v) {\r\n  lua_State *L = fs->L;\r\n  TValue *idx = luaH_set(L, fs->h, k);\r\n  Proto *f = fs->f;\r\n  int oldsize = f->sizek;\r\n  if (ttisnumber(idx)) {\r\n    lua_assert(luaO_rawequalObj(&fs->f->k[cast_int(nvalue(idx))], v));\r\n    return cast_int(nvalue(idx));\r\n  }\r\n  else {  /* constant not found; create a new entry */\r\n    setnvalue(idx, cast_num(fs->nk));\r\n    luaM_growvector(L, f->k, fs->nk, f->sizek, TValue,\r\n                    MAXARG_Bx, \"constant table overflow\");\r\n    while (oldsize < f->sizek) setnilvalue(&f->k[oldsize++]);\r\n    setobj(L, &f->k[fs->nk], v);\r\n    luaC_barrier(L, f, v);\r\n    return fs->nk++;\r\n  }\r\n}\r\n\r\n\r\nint luaK_stringK (FuncState *fs, TString *s) {\r\n  TValue o;\r\n  setsvalue(fs->L, &o, s);\r\n  return addk(fs, &o, &o);\r\n}\r\n\r\n\r\nint luaK_numberK (FuncState *fs, lua_Number r) {\r\n  TValue o;\r\n  setnvalue(&o, r);\r\n  return addk(fs, &o, &o);\r\n}\r\n\r\n\r\nstatic int boolK (FuncState *fs, int b) {\r\n  TValue o;\r\n  setbvalue(&o, b);\r\n  return addk(fs, &o, &o);\r\n}\r\n\r\n\r\nstatic int nilK (FuncState *fs) {\r\n  TValue k, v;\r\n  setnilvalue(&v);\r\n  /* cannot use nil as key; instead use table itself to represent nil */\r\n  sethvalue(fs->L, &k, fs->h);\r\n  return addk(fs, &k, &v);\r\n}\r\n\r\n\r\nvoid luaK_setreturns (FuncState *fs, expdesc *e, int nresults) {\r\n  if (e->k == VCALL) {  /* expression is an open function call? */\r\n    SETARG_C(getcode(fs, e), nresults+1);\r\n  }\r\n  else if (e->k == VVARARG) {\r\n    SETARG_B(getcode(fs, e), nresults+1);\r\n    SETARG_A(getcode(fs, e), fs->freereg);\r\n    luaK_reserveregs(fs, 1);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_setoneret (FuncState *fs, expdesc *e) {\r\n  if (e->k == VCALL) {  /* expression is an open function call? */\r\n    e->k = VNONRELOC;\r\n    e->u.s.info = GETARG_A(getcode(fs, e));\r\n  }\r\n  else if (e->k == VVARARG) {\r\n    SETARG_B(getcode(fs, e), 2);\r\n    e->k = VRELOCABLE;  /* can relocate its simple result */\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_dischargevars (FuncState *fs, expdesc *e) {\r\n  switch (e->k) {\r\n    case VLOCAL: {\r\n      e->k = VNONRELOC;\r\n      break;\r\n    }\r\n    case VUPVAL: {\r\n      e->u.s.info = luaK_codeABC(fs, OP_GETUPVAL, 0, e->u.s.info, 0);\r\n      e->k = VRELOCABLE;\r\n      break;\r\n    }\r\n    case VGLOBAL: {\r\n      e->u.s.info = luaK_codeABx(fs, OP_GETGLOBAL, 0, e->u.s.info);\r\n      e->k = VRELOCABLE;\r\n      break;\r\n    }\r\n    case VINDEXED: {\r\n      freereg(fs, e->u.s.aux);\r\n      freereg(fs, e->u.s.info);\r\n      e->u.s.info = luaK_codeABC(fs, OP_GETTABLE, 0, e->u.s.info, e->u.s.aux);\r\n      e->k = VRELOCABLE;\r\n      break;\r\n    }\r\n    case VVARARG:\r\n    case VCALL: {\r\n      luaK_setoneret(fs, e);\r\n      break;\r\n    }\r\n    default: break;  /* there is one value available (somewhere) */\r\n  }\r\n}\r\n\r\n\r\nstatic int code_label (FuncState *fs, int A, int b, int jump) {\r\n  luaK_getlabel(fs);  /* those instructions may be jump targets */\r\n  return luaK_codeABC(fs, OP_LOADBOOL, A, b, jump);\r\n}\r\n\r\n\r\nstatic void discharge2reg (FuncState *fs, expdesc *e, int reg) {\r\n  luaK_dischargevars(fs, e);\r\n  switch (e->k) {\r\n    case VNIL: {\r\n      luaK_nil(fs, reg, 1);\r\n      break;\r\n    }\r\n    case VFALSE:  case VTRUE: {\r\n      luaK_codeABC(fs, OP_LOADBOOL, reg, e->k == VTRUE, 0);\r\n      break;\r\n    }\r\n    case VK: {\r\n      luaK_codeABx(fs, OP_LOADK, reg, e->u.s.info);\r\n      break;\r\n    }\r\n    case VKNUM: {\r\n      luaK_codeABx(fs, OP_LOADK, reg, luaK_numberK(fs, e->u.nval));\r\n      break;\r\n    }\r\n    case VRELOCABLE: {\r\n      Instruction *pc = &getcode(fs, e);\r\n      SETARG_A(*pc, reg);\r\n      break;\r\n    }\r\n    case VNONRELOC: {\r\n      if (reg != e->u.s.info)\r\n        luaK_codeABC(fs, OP_MOVE, reg, e->u.s.info, 0);\r\n      break;\r\n    }\r\n    default: {\r\n      lua_assert(e->k == VVOID || e->k == VJMP);\r\n      return;  /* nothing to do... */\r\n    }\r\n  }\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n\r\nstatic void discharge2anyreg (FuncState *fs, expdesc *e) {\r\n  if (e->k != VNONRELOC) {\r\n    luaK_reserveregs(fs, 1);\r\n    discharge2reg(fs, e, fs->freereg-1);\r\n  }\r\n}\r\n\r\n\r\nstatic void exp2reg (FuncState *fs, expdesc *e, int reg) {\r\n  discharge2reg(fs, e, reg);\r\n  if (e->k == VJMP)\r\n    luaK_concat(fs, &e->t, e->u.s.info);  /* put this jump in `t' list */\r\n  if (hasjumps(e)) {\r\n    int final;  /* position after whole expression */\r\n    int p_f = NO_JUMP;  /* position of an eventual LOAD false */\r\n    int p_t = NO_JUMP;  /* position of an eventual LOAD true */\r\n    if (need_value(fs, e->t) || need_value(fs, e->f)) {\r\n      int fj = (e->k == VJMP) ? NO_JUMP : luaK_jump(fs);\r\n      p_f = code_label(fs, reg, 0, 1);\r\n      p_t = code_label(fs, reg, 1, 0);\r\n      luaK_patchtohere(fs, fj);\r\n    }\r\n    final = luaK_getlabel(fs);\r\n    patchlistaux(fs, e->f, final, reg, p_f);\r\n    patchlistaux(fs, e->t, final, reg, p_t);\r\n  }\r\n  e->f = e->t = NO_JUMP;\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n\r\nvoid luaK_exp2nextreg (FuncState *fs, expdesc *e) {\r\n  luaK_dischargevars(fs, e);\r\n  freeexp(fs, e);\r\n  luaK_reserveregs(fs, 1);\r\n  exp2reg(fs, e, fs->freereg - 1);\r\n}\r\n\r\n\r\nint luaK_exp2anyreg (FuncState *fs, expdesc *e) {\r\n  luaK_dischargevars(fs, e);\r\n  if (e->k == VNONRELOC) {\r\n    if (!hasjumps(e)) return e->u.s.info;  /* exp is already in a register */\r\n    if (e->u.s.info >= fs->nactvar) {  /* reg. is not a local? */\r\n      exp2reg(fs, e, e->u.s.info);  /* put value on it */\r\n      return e->u.s.info;\r\n    }\r\n  }\r\n  luaK_exp2nextreg(fs, e);  /* default */\r\n  return e->u.s.info;\r\n}\r\n\r\n\r\nvoid luaK_exp2val (FuncState *fs, expdesc *e) {\r\n  if (hasjumps(e))\r\n    luaK_exp2anyreg(fs, e);\r\n  else\r\n    luaK_dischargevars(fs, e);\r\n}\r\n\r\n\r\nint luaK_exp2RK (FuncState *fs, expdesc *e) {\r\n  luaK_exp2val(fs, e);\r\n  switch (e->k) {\r\n    case VKNUM:\r\n    case VTRUE:\r\n    case VFALSE:\r\n    case VNIL: {\r\n      if (fs->nk <= MAXINDEXRK) {  /* constant fit in RK operand? */\r\n        e->u.s.info = (e->k == VNIL)  ? nilK(fs) :\r\n                      (e->k == VKNUM) ? luaK_numberK(fs, e->u.nval) :\r\n                                        boolK(fs, (e->k == VTRUE));\r\n        e->k = VK;\r\n        return RKASK(e->u.s.info);\r\n      }\r\n      else break;\r\n    }\r\n    case VK: {\r\n      if (e->u.s.info <= MAXINDEXRK)  /* constant fit in argC? */\r\n        return RKASK(e->u.s.info);\r\n      else break;\r\n    }\r\n    default: break;\r\n  }\r\n  /* not a constant in the right range: put it in a register */\r\n  return luaK_exp2anyreg(fs, e);\r\n}\r\n\r\n\r\nvoid luaK_storevar (FuncState *fs, expdesc *var, expdesc *ex) {\r\n  switch (var->k) {\r\n    case VLOCAL: {\r\n      freeexp(fs, ex);\r\n      exp2reg(fs, ex, var->u.s.info);\r\n      return;\r\n    }\r\n    case VUPVAL: {\r\n      int e = luaK_exp2anyreg(fs, ex);\r\n      luaK_codeABC(fs, OP_SETUPVAL, e, var->u.s.info, 0);\r\n      break;\r\n    }\r\n    case VGLOBAL: {\r\n      int e = luaK_exp2anyreg(fs, ex);\r\n      luaK_codeABx(fs, OP_SETGLOBAL, e, var->u.s.info);\r\n      break;\r\n    }\r\n    case VINDEXED: {\r\n      int e = luaK_exp2RK(fs, ex);\r\n      luaK_codeABC(fs, OP_SETTABLE, var->u.s.info, var->u.s.aux, e);\r\n      break;\r\n    }\r\n    default: {\r\n      lua_assert(0);  /* invalid var kind to store */\r\n      break;\r\n    }\r\n  }\r\n  freeexp(fs, ex);\r\n}\r\n\r\n\r\nvoid luaK_self (FuncState *fs, expdesc *e, expdesc *key) {\r\n  int func;\r\n  luaK_exp2anyreg(fs, e);\r\n  freeexp(fs, e);\r\n  func = fs->freereg;\r\n  luaK_reserveregs(fs, 2);\r\n  luaK_codeABC(fs, OP_SELF, func, e->u.s.info, luaK_exp2RK(fs, key));\r\n  freeexp(fs, key);\r\n  e->u.s.info = func;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n\r\nstatic void invertjump (FuncState *fs, expdesc *e) {\r\n  Instruction *pc = getjumpcontrol(fs, e->u.s.info);\r\n  lua_assert(testTMode(GET_OPCODE(*pc)) && GET_OPCODE(*pc) != OP_TESTSET &&\r\n                                           GET_OPCODE(*pc) != OP_TEST);\r\n  SETARG_A(*pc, !(GETARG_A(*pc)));\r\n}\r\n\r\n\r\nstatic int jumponcond (FuncState *fs, expdesc *e, int cond) {\r\n  if (e->k == VRELOCABLE) {\r\n    Instruction ie = getcode(fs, e);\r\n    if (GET_OPCODE(ie) == OP_NOT) {\r\n      fs->pc--;  /* remove previous OP_NOT */\r\n      return condjump(fs, OP_TEST, GETARG_B(ie), 0, !cond);\r\n    }\r\n    /* else go through */\r\n  }\r\n  discharge2anyreg(fs, e);\r\n  freeexp(fs, e);\r\n  return condjump(fs, OP_TESTSET, NO_REG, e->u.s.info, cond);\r\n}\r\n\r\n\r\nvoid luaK_goiftrue (FuncState *fs, expdesc *e) {\r\n  int pc;  /* pc of last jump */\r\n  luaK_dischargevars(fs, e);\r\n  switch (e->k) {\r\n    case VK: case VKNUM: case VTRUE: {\r\n      pc = NO_JUMP;  /* always true; do nothing */\r\n      break;\r\n    }\r\n    case VJMP: {\r\n      invertjump(fs, e);\r\n      pc = e->u.s.info;\r\n      break;\r\n    }\r\n    default: {\r\n      pc = jumponcond(fs, e, 0);\r\n      break;\r\n    }\r\n  }\r\n  luaK_concat(fs, &e->f, pc);  /* insert last jump in `f' list */\r\n  luaK_patchtohere(fs, e->t);\r\n  e->t = NO_JUMP;\r\n}\r\n\r\n\r\nstatic void luaK_goiffalse (FuncState *fs, expdesc *e) {\r\n  int pc;  /* pc of last jump */\r\n  luaK_dischargevars(fs, e);\r\n  switch (e->k) {\r\n    case VNIL: case VFALSE: {\r\n      pc = NO_JUMP;  /* always false; do nothing */\r\n      break;\r\n    }\r\n    case VJMP: {\r\n      pc = e->u.s.info;\r\n      break;\r\n    }\r\n    default: {\r\n      pc = jumponcond(fs, e, 1);\r\n      break;\r\n    }\r\n  }\r\n  luaK_concat(fs, &e->t, pc);  /* insert last jump in `t' list */\r\n  luaK_patchtohere(fs, e->f);\r\n  e->f = NO_JUMP;\r\n}\r\n\r\n\r\nstatic void codenot (FuncState *fs, expdesc *e) {\r\n  luaK_dischargevars(fs, e);\r\n  switch (e->k) {\r\n    case VNIL: case VFALSE: {\r\n      e->k = VTRUE;\r\n      break;\r\n    }\r\n    case VK: case VKNUM: case VTRUE: {\r\n      e->k = VFALSE;\r\n      break;\r\n    }\r\n    case VJMP: {\r\n      invertjump(fs, e);\r\n      break;\r\n    }\r\n    case VRELOCABLE:\r\n    case VNONRELOC: {\r\n      discharge2anyreg(fs, e);\r\n      freeexp(fs, e);\r\n      e->u.s.info = luaK_codeABC(fs, OP_NOT, 0, e->u.s.info, 0);\r\n      e->k = VRELOCABLE;\r\n      break;\r\n    }\r\n    default: {\r\n      lua_assert(0);  /* cannot happen */\r\n      break;\r\n    }\r\n  }\r\n  /* interchange true and false lists */\r\n  { int temp = e->f; e->f = e->t; e->t = temp; }\r\n  removevalues(fs, e->f);\r\n  removevalues(fs, e->t);\r\n}\r\n\r\n\r\nvoid luaK_indexed (FuncState *fs, expdesc *t, expdesc *k) {\r\n  t->u.s.aux = luaK_exp2RK(fs, k);\r\n  t->k = VINDEXED;\r\n}\r\n\r\n\r\nstatic int constfolding (OpCode op, expdesc *e1, expdesc *e2) {\r\n  lua_Number v1, v2, r;\r\n  if (!isnumeral(e1) || !isnumeral(e2)) return 0;\r\n  v1 = e1->u.nval;\r\n  v2 = e2->u.nval;\r\n  switch (op) {\r\n    case OP_ADD: r = luai_numadd(v1, v2); break;\r\n    case OP_SUB: r = luai_numsub(v1, v2); break;\r\n    case OP_MUL: r = luai_nummul(v1, v2); break;\r\n    case OP_DIV:\r\n      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */\r\n      r = luai_numdiv(v1, v2); break;\r\n    case OP_MOD:\r\n      if (v2 == 0) return 0;  /* do not attempt to divide by 0 */\r\n      r = luai_nummod(v1, v2); break;\r\n    case OP_POW: r = luai_numpow(v1, v2); break;\r\n    case OP_UNM: r = luai_numunm(v1); break;\r\n    case OP_LEN: return 0;  /* no constant folding for 'len' */\r\n    default: lua_assert(0); r = 0; break;\r\n  }\r\n  if (luai_numisnan(r)) return 0;  /* do not attempt to produce NaN */\r\n  e1->u.nval = r;\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void codearith (FuncState *fs, OpCode op, expdesc *e1, expdesc *e2) {\r\n  if (constfolding(op, e1, e2))\r\n    return;\r\n  else {\r\n    int o2 = (op != OP_UNM && op != OP_LEN) ? luaK_exp2RK(fs, e2) : 0;\r\n    int o1 = luaK_exp2RK(fs, e1);\r\n    if (o1 > o2) {\r\n      freeexp(fs, e1);\r\n      freeexp(fs, e2);\r\n    }\r\n    else {\r\n      freeexp(fs, e2);\r\n      freeexp(fs, e1);\r\n    }\r\n    e1->u.s.info = luaK_codeABC(fs, op, 0, o1, o2);\r\n    e1->k = VRELOCABLE;\r\n  }\r\n}\r\n\r\n\r\nstatic void codecomp (FuncState *fs, OpCode op, int cond, expdesc *e1,\r\n                                                          expdesc *e2) {\r\n  int o1 = luaK_exp2RK(fs, e1);\r\n  int o2 = luaK_exp2RK(fs, e2);\r\n  freeexp(fs, e2);\r\n  freeexp(fs, e1);\r\n  if (cond == 0 && op != OP_EQ) {\r\n    int temp;  /* exchange args to replace by `<' or `<=' */\r\n    temp = o1; o1 = o2; o2 = temp;  /* o1 <==> o2 */\r\n    cond = 1;\r\n  }\r\n  e1->u.s.info = condjump(fs, op, cond, o1, o2);\r\n  e1->k = VJMP;\r\n}\r\n\r\n\r\nvoid luaK_prefix (FuncState *fs, UnOpr op, expdesc *e) {\r\n  expdesc e2;\r\n  e2.t = e2.f = NO_JUMP; e2.k = VKNUM; e2.u.nval = 0;\r\n  switch (op) {\r\n    case OPR_MINUS: {\r\n      if (!isnumeral(e))\r\n        luaK_exp2anyreg(fs, e);  /* cannot operate on non-numeric constants */\r\n      codearith(fs, OP_UNM, e, &e2);\r\n      break;\r\n    }\r\n    case OPR_NOT: codenot(fs, e); break;\r\n    case OPR_LEN: {\r\n      luaK_exp2anyreg(fs, e);  /* cannot operate on constants */\r\n      codearith(fs, OP_LEN, e, &e2);\r\n      break;\r\n    }\r\n    default: lua_assert(0);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_infix (FuncState *fs, BinOpr op, expdesc *v) {\r\n  switch (op) {\r\n    case OPR_AND: {\r\n      luaK_goiftrue(fs, v);\r\n      break;\r\n    }\r\n    case OPR_OR: {\r\n      luaK_goiffalse(fs, v);\r\n      break;\r\n    }\r\n    case OPR_CONCAT: {\r\n      luaK_exp2nextreg(fs, v);  /* operand must be on the `stack' */\r\n      break;\r\n    }\r\n    case OPR_ADD: case OPR_SUB: case OPR_MUL: case OPR_DIV:\r\n    case OPR_MOD: case OPR_POW: {\r\n      if (!isnumeral(v)) luaK_exp2RK(fs, v);\r\n      break;\r\n    }\r\n    default: {\r\n      luaK_exp2RK(fs, v);\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_posfix (FuncState *fs, BinOpr op, expdesc *e1, expdesc *e2) {\r\n  switch (op) {\r\n    case OPR_AND: {\r\n      lua_assert(e1->t == NO_JUMP);  /* list must be closed */\r\n      luaK_dischargevars(fs, e2);\r\n      luaK_concat(fs, &e2->f, e1->f);\r\n      *e1 = *e2;\r\n      break;\r\n    }\r\n    case OPR_OR: {\r\n      lua_assert(e1->f == NO_JUMP);  /* list must be closed */\r\n      luaK_dischargevars(fs, e2);\r\n      luaK_concat(fs, &e2->t, e1->t);\r\n      *e1 = *e2;\r\n      break;\r\n    }\r\n    case OPR_CONCAT: {\r\n      luaK_exp2val(fs, e2);\r\n      if (e2->k == VRELOCABLE && GET_OPCODE(getcode(fs, e2)) == OP_CONCAT) {\r\n        lua_assert(e1->u.s.info == GETARG_B(getcode(fs, e2))-1);\r\n        freeexp(fs, e1);\r\n        SETARG_B(getcode(fs, e2), e1->u.s.info);\r\n        e1->k = VRELOCABLE; e1->u.s.info = e2->u.s.info;\r\n      }\r\n      else {\r\n        luaK_exp2nextreg(fs, e2);  /* operand must be on the 'stack' */\r\n        codearith(fs, OP_CONCAT, e1, e2);\r\n      }\r\n      break;\r\n    }\r\n    case OPR_ADD: codearith(fs, OP_ADD, e1, e2); break;\r\n    case OPR_SUB: codearith(fs, OP_SUB, e1, e2); break;\r\n    case OPR_MUL: codearith(fs, OP_MUL, e1, e2); break;\r\n    case OPR_DIV: codearith(fs, OP_DIV, e1, e2); break;\r\n    case OPR_MOD: codearith(fs, OP_MOD, e1, e2); break;\r\n    case OPR_POW: codearith(fs, OP_POW, e1, e2); break;\r\n    case OPR_EQ: codecomp(fs, OP_EQ, 1, e1, e2); break;\r\n    case OPR_NE: codecomp(fs, OP_EQ, 0, e1, e2); break;\r\n    case OPR_LT: codecomp(fs, OP_LT, 1, e1, e2); break;\r\n    case OPR_LE: codecomp(fs, OP_LE, 1, e1, e2); break;\r\n    case OPR_GT: codecomp(fs, OP_LT, 0, e1, e2); break;\r\n    case OPR_GE: codecomp(fs, OP_LE, 0, e1, e2); break;\r\n    default: lua_assert(0);\r\n  }\r\n}\r\n\r\n\r\nvoid luaK_fixline (FuncState *fs, int line) {\r\n  fs->f->lineinfo[fs->pc - 1] = line;\r\n}\r\n\r\n\r\nstatic int luaK_code (FuncState *fs, Instruction i, int line) {\r\n  Proto *f = fs->f;\r\n  dischargejpc(fs);  /* `pc' will change */\r\n  /* put new instruction in code array */\r\n  luaM_growvector(fs->L, f->code, fs->pc, f->sizecode, Instruction,\r\n                  MAX_INT, \"code size overflow\");\r\n  f->code[fs->pc] = i;\r\n  /* save corresponding line information */\r\n  luaM_growvector(fs->L, f->lineinfo, fs->pc, f->sizelineinfo, int,\r\n                  MAX_INT, \"code size overflow\");\r\n  f->lineinfo[fs->pc] = line;\r\n  return fs->pc++;\r\n}\r\n\r\n\r\nint luaK_codeABC (FuncState *fs, OpCode o, int a, int b, int c) {\r\n  lua_assert(getOpMode(o) == iABC);\r\n  lua_assert(getBMode(o) != OpArgN || b == 0);\r\n  lua_assert(getCMode(o) != OpArgN || c == 0);\r\n  return luaK_code(fs, CREATE_ABC(o, a, b, c), fs->ls->lastline);\r\n}\r\n\r\n\r\nint luaK_codeABx (FuncState *fs, OpCode o, int a, unsigned int bc) {\r\n  lua_assert(getOpMode(o) == iABx || getOpMode(o) == iAsBx);\r\n  lua_assert(getCMode(o) == OpArgN);\r\n  return luaK_code(fs, CREATE_ABx(o, a, bc), fs->ls->lastline);\r\n}\r\n\r\n\r\nvoid luaK_setlist (FuncState *fs, int base, int nelems, int tostore) {\r\n  int c =  (nelems - 1)/LFIELDS_PER_FLUSH + 1;\r\n  int b = (tostore == LUA_MULTRET) ? 0 : tostore;\r\n  lua_assert(tostore != 0);\r\n  if (c <= MAXARG_C)\r\n    luaK_codeABC(fs, OP_SETLIST, base, b, c);\r\n  else {\r\n    luaK_codeABC(fs, OP_SETLIST, base, b, 0);\r\n    luaK_code(fs, cast(Instruction, c), fs->ls->lastline);\r\n  }\r\n  fs->freereg = base + 1;  /* free registers with list values */\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lcode.h",
    "content": "/*\r\n** $Id: lcode.h,v 1.48.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Code generator for Lua\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lcode_h\r\n#define lcode_h\r\n\r\n#include \"llex.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lparser.h\"\r\n\r\n\r\n/*\r\n** Marks the end of a patch list. It is an invalid value both as an absolute\r\n** address, and as a list link (would link an element to itself).\r\n*/\r\n#define NO_JUMP (-1)\r\n\r\n\r\n/*\r\n** grep \"ORDER OPR\" if you change these enums\r\n*/\r\ntypedef enum BinOpr {\r\n  OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW,\r\n  OPR_CONCAT,\r\n  OPR_NE, OPR_EQ,\r\n  OPR_LT, OPR_LE, OPR_GT, OPR_GE,\r\n  OPR_AND, OPR_OR,\r\n  OPR_NOBINOPR\r\n} BinOpr;\r\n\r\n\r\ntypedef enum UnOpr { OPR_MINUS, OPR_NOT, OPR_LEN, OPR_NOUNOPR } UnOpr;\r\n\r\n\r\n#define getcode(fs,e)\t((fs)->f->code[(e)->u.s.info])\r\n\r\n#define luaK_codeAsBx(fs,o,A,sBx)\tluaK_codeABx(fs,o,A,(sBx)+MAXARG_sBx)\r\n\r\n#define luaK_setmultret(fs,e)\tluaK_setreturns(fs, e, LUA_MULTRET)\r\n\r\nLUAI_FUNC int luaK_codeABx (FuncState *fs, OpCode o, int A, unsigned int Bx);\r\nLUAI_FUNC int luaK_codeABC (FuncState *fs, OpCode o, int A, int B, int C);\r\nLUAI_FUNC void luaK_fixline (FuncState *fs, int line);\r\nLUAI_FUNC void luaK_nil (FuncState *fs, int from, int n);\r\nLUAI_FUNC void luaK_reserveregs (FuncState *fs, int n);\r\nLUAI_FUNC void luaK_checkstack (FuncState *fs, int n);\r\nLUAI_FUNC int luaK_stringK (FuncState *fs, TString *s);\r\nLUAI_FUNC int luaK_numberK (FuncState *fs, lua_Number r);\r\nLUAI_FUNC void luaK_dischargevars (FuncState *fs, expdesc *e);\r\nLUAI_FUNC int luaK_exp2anyreg (FuncState *fs, expdesc *e);\r\nLUAI_FUNC void luaK_exp2nextreg (FuncState *fs, expdesc *e);\r\nLUAI_FUNC void luaK_exp2val (FuncState *fs, expdesc *e);\r\nLUAI_FUNC int luaK_exp2RK (FuncState *fs, expdesc *e);\r\nLUAI_FUNC void luaK_self (FuncState *fs, expdesc *e, expdesc *key);\r\nLUAI_FUNC void luaK_indexed (FuncState *fs, expdesc *t, expdesc *k);\r\nLUAI_FUNC void luaK_goiftrue (FuncState *fs, expdesc *e);\r\nLUAI_FUNC void luaK_storevar (FuncState *fs, expdesc *var, expdesc *e);\r\nLUAI_FUNC void luaK_setreturns (FuncState *fs, expdesc *e, int nresults);\r\nLUAI_FUNC void luaK_setoneret (FuncState *fs, expdesc *e);\r\nLUAI_FUNC int luaK_jump (FuncState *fs);\r\nLUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret);\r\nLUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target);\r\nLUAI_FUNC void luaK_patchtohere (FuncState *fs, int list);\r\nLUAI_FUNC void luaK_concat (FuncState *fs, int *l1, int l2);\r\nLUAI_FUNC int luaK_getlabel (FuncState *fs);\r\nLUAI_FUNC void luaK_prefix (FuncState *fs, UnOpr op, expdesc *v);\r\nLUAI_FUNC void luaK_infix (FuncState *fs, BinOpr op, expdesc *v);\r\nLUAI_FUNC void luaK_posfix (FuncState *fs, BinOpr op, expdesc *v1, expdesc *v2);\r\nLUAI_FUNC void luaK_setlist (FuncState *fs, int base, int nelems, int tostore);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldblib.c",
    "content": "/*\r\n** $Id: ldblib.c,v 1.104.1.4 2009/08/04 18:50:18 roberto Exp $\r\n** Interface from Lua to its debug API\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define ldblib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n\r\nstatic int db_getregistry (lua_State *L) {\r\n  lua_pushvalue(L, LUA_REGISTRYINDEX);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int db_getmetatable (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    lua_pushnil(L);  /* no metatable */\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int db_setmetatable (lua_State *L) {\r\n  int t = lua_type(L, 2);\r\n  luaL_argcheck(L, t == LUA_TNIL || t == LUA_TTABLE, 2,\r\n                    \"nil or table expected\");\r\n  lua_settop(L, 2);\r\n  lua_pushboolean(L, lua_setmetatable(L, 1));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int db_getfenv (lua_State *L) {\r\n  luaL_checkany(L, 1);\r\n  lua_getfenv(L, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int db_setfenv (lua_State *L) {\r\n  luaL_checktype(L, 2, LUA_TTABLE);\r\n  lua_settop(L, 2);\r\n  if (lua_setfenv(L, 1) == 0)\r\n    luaL_error(L, LUA_QL(\"setfenv\")\r\n                  \" cannot change environment of given object\");\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void settabss (lua_State *L, const char *i, const char *v) {\r\n  lua_pushstring(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\n\r\nstatic void settabsi (lua_State *L, const char *i, int v) {\r\n  lua_pushinteger(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\n\r\nstatic lua_State *getthread (lua_State *L, int *arg) {\r\n  if (lua_isthread(L, 1)) {\r\n    *arg = 1;\r\n    return lua_tothread(L, 1);\r\n  }\r\n  else {\r\n    *arg = 0;\r\n    return L;\r\n  }\r\n}\r\n\r\n\r\nstatic void treatstackoption (lua_State *L, lua_State *L1, const char *fname) {\r\n  if (L == L1) {\r\n    lua_pushvalue(L, -2);\r\n    lua_remove(L, -3);\r\n  }\r\n  else\r\n    lua_xmove(L1, L, 1);\r\n  lua_setfield(L, -2, fname);\r\n}\r\n\r\n\r\nstatic int db_getinfo (lua_State *L) {\r\n  lua_Debug ar;\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  const char *options = luaL_optstring(L, arg+2, \"flnSu\");\r\n  if (lua_isnumber(L, arg+1)) {\r\n    if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), &ar)) {\r\n      lua_pushnil(L);  /* level out of range */\r\n      return 1;\r\n    }\r\n  }\r\n  else if (lua_isfunction(L, arg+1)) {\r\n    lua_pushfstring(L, \">%s\", options);\r\n    options = lua_tostring(L, -1);\r\n    lua_pushvalue(L, arg+1);\r\n    lua_xmove(L, L1, 1);\r\n  }\r\n  else\r\n    return luaL_argerror(L, arg+1, \"function or level expected\");\r\n  if (!lua_getinfo(L1, options, &ar))\r\n    return luaL_argerror(L, arg+2, \"invalid option\");\r\n  lua_createtable(L, 0, 2);\r\n  if (strchr(options, 'S')) {\r\n    settabss(L, \"source\", ar.source);\r\n    settabss(L, \"short_src\", ar.short_src);\r\n    settabsi(L, \"linedefined\", ar.linedefined);\r\n    settabsi(L, \"lastlinedefined\", ar.lastlinedefined);\r\n    settabss(L, \"what\", ar.what);\r\n  }\r\n  if (strchr(options, 'l'))\r\n    settabsi(L, \"currentline\", ar.currentline);\r\n  if (strchr(options, 'u'))\r\n    settabsi(L, \"nups\", ar.nups);\r\n  if (strchr(options, 'n')) {\r\n    settabss(L, \"name\", ar.name);\r\n    settabss(L, \"namewhat\", ar.namewhat);\r\n  }\r\n  if (strchr(options, 'L'))\r\n    treatstackoption(L, L1, \"activelines\");\r\n  if (strchr(options, 'f'))\r\n    treatstackoption(L, L1, \"func\");\r\n  return 1;  /* return table */\r\n}\r\n    \r\n\r\nstatic int db_getlocal (lua_State *L) {\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  const char *name;\r\n  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */\r\n    return luaL_argerror(L, arg+1, \"level out of range\");\r\n  name = lua_getlocal(L1, &ar, luaL_checkint(L, arg+2));\r\n  if (name) {\r\n    lua_xmove(L1, L, 1);\r\n    lua_pushstring(L, name);\r\n    lua_pushvalue(L, -2);\r\n    return 2;\r\n  }\r\n  else {\r\n    lua_pushnil(L);\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nstatic int db_setlocal (lua_State *L) {\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  if (!lua_getstack(L1, luaL_checkint(L, arg+1), &ar))  /* out of range? */\r\n    return luaL_argerror(L, arg+1, \"level out of range\");\r\n  luaL_checkany(L, arg+3);\r\n  lua_settop(L, arg+3);\r\n  lua_xmove(L, L1, 1);\r\n  lua_pushstring(L, lua_setlocal(L1, &ar, luaL_checkint(L, arg+2)));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int auxupvalue (lua_State *L, int get) {\r\n  const char *name;\r\n  int n = luaL_checkint(L, 2);\r\n  luaL_checktype(L, 1, LUA_TFUNCTION);\r\n  if (lua_iscfunction(L, 1)) return 0;  /* cannot touch C upvalues from Lua */\r\n  name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);\r\n  if (name == NULL) return 0;\r\n  lua_pushstring(L, name);\r\n  lua_insert(L, -(get+1));\r\n  return get + 1;\r\n}\r\n\r\n\r\nstatic int db_getupvalue (lua_State *L) {\r\n  return auxupvalue(L, 1);\r\n}\r\n\r\n\r\nstatic int db_setupvalue (lua_State *L) {\r\n  luaL_checkany(L, 3);\r\n  return auxupvalue(L, 0);\r\n}\r\n\r\n\r\n\r\nstatic const char KEY_HOOK = 'h';\r\n\r\n\r\nstatic void hookf (lua_State *L, lua_Debug *ar) {\r\n  static const char *const hooknames[] =\r\n    {\"call\", \"return\", \"line\", \"count\", \"tail return\"};\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_rawget(L, LUA_REGISTRYINDEX);\r\n  lua_pushlightuserdata(L, L);\r\n  lua_rawget(L, -2);\r\n  if (lua_isfunction(L, -1)) {\r\n    lua_pushstring(L, hooknames[(int)ar->event]);\r\n    if (ar->currentline >= 0)\r\n      lua_pushinteger(L, ar->currentline);\r\n    else lua_pushnil(L);\r\n    lua_assert(lua_getinfo(L, \"lS\", ar));\r\n    lua_call(L, 2, 0);\r\n  }\r\n}\r\n\r\n\r\nstatic int makemask (const char *smask, int count) {\r\n  int mask = 0;\r\n  if (strchr(smask, 'c')) mask |= LUA_MASKCALL;\r\n  if (strchr(smask, 'r')) mask |= LUA_MASKRET;\r\n  if (strchr(smask, 'l')) mask |= LUA_MASKLINE;\r\n  if (count > 0) mask |= LUA_MASKCOUNT;\r\n  return mask;\r\n}\r\n\r\n\r\nstatic char *unmakemask (int mask, char *smask) {\r\n  int i = 0;\r\n  if (mask & LUA_MASKCALL) smask[i++] = 'c';\r\n  if (mask & LUA_MASKRET) smask[i++] = 'r';\r\n  if (mask & LUA_MASKLINE) smask[i++] = 'l';\r\n  smask[i] = '\\0';\r\n  return smask;\r\n}\r\n\r\n\r\nstatic void gethooktable (lua_State *L) {\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_rawget(L, LUA_REGISTRYINDEX);\r\n  if (!lua_istable(L, -1)) {\r\n    lua_pop(L, 1);\r\n    lua_createtable(L, 0, 1);\r\n    lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n    lua_pushvalue(L, -2);\r\n    lua_rawset(L, LUA_REGISTRYINDEX);\r\n  }\r\n}\r\n\r\n\r\nstatic int db_sethook (lua_State *L) {\r\n  int arg, mask, count;\r\n  lua_Hook func;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  if (lua_isnoneornil(L, arg+1)) {\r\n    lua_settop(L, arg+1);\r\n    func = NULL; mask = 0; count = 0;  /* turn off hooks */\r\n  }\r\n  else {\r\n    const char *smask = luaL_checkstring(L, arg+2);\r\n    luaL_checktype(L, arg+1, LUA_TFUNCTION);\r\n    count = luaL_optint(L, arg+3, 0);\r\n    func = hookf; mask = makemask(smask, count);\r\n  }\r\n  gethooktable(L);\r\n  lua_pushlightuserdata(L, L1);\r\n  lua_pushvalue(L, arg+1);\r\n  lua_rawset(L, -3);  /* set new hook */\r\n  lua_pop(L, 1);  /* remove hook table */\r\n  lua_sethook(L1, func, mask, count);  /* set hooks */\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int db_gethook (lua_State *L) {\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  char buff[5];\r\n  int mask = lua_gethookmask(L1);\r\n  lua_Hook hook = lua_gethook(L1);\r\n  if (hook != NULL && hook != hookf)  /* external hook? */\r\n    lua_pushliteral(L, \"external hook\");\r\n  else {\r\n    gethooktable(L);\r\n    lua_pushlightuserdata(L, L1);\r\n    lua_rawget(L, -2);   /* get hook */\r\n    lua_remove(L, -2);  /* remove hook table */\r\n  }\r\n  lua_pushstring(L, unmakemask(mask, buff));\r\n  lua_pushinteger(L, lua_gethookcount(L1));\r\n  return 3;\r\n}\r\n\r\n\r\nstatic int db_debug (lua_State *L) {\r\n  for (;;) {\r\n    char buffer[250];\r\n    fputs(\"lua_debug> \", stderr);\r\n    if (fgets(buffer, sizeof(buffer), stdin) == 0 ||\r\n        strcmp(buffer, \"cont\\n\") == 0)\r\n      return 0;\r\n    if (luaL_loadbuffer(L, buffer, strlen(buffer), \"=(debug command)\") ||\r\n        lua_pcall(L, 0, 0, 0)) {\r\n      fputs(lua_tostring(L, -1), stderr);\r\n      fputs(\"\\n\", stderr);\r\n    }\r\n    lua_settop(L, 0);  /* remove eventual returns */\r\n  }\r\n}\r\n\r\n\r\n#define LEVELS1\t12\t/* size of the first part of the stack */\r\n#define LEVELS2\t10\t/* size of the second part of the stack */\r\n\r\nstatic int db_errorfb (lua_State *L) {\r\n  int level;\r\n  int firstpart = 1;  /* still before eventual `...' */\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  if (lua_isnumber(L, arg+2)) {\r\n    level = (int)lua_tointeger(L, arg+2);\r\n    lua_pop(L, 1);\r\n  }\r\n  else\r\n    level = (L == L1) ? 1 : 0;  /* level 0 may be this own function */\r\n  if (lua_gettop(L) == arg)\r\n    lua_pushliteral(L, \"\");\r\n  else if (!lua_isstring(L, arg+1)) return 1;  /* message is not a string */\r\n  else lua_pushliteral(L, \"\\n\");\r\n  lua_pushliteral(L, \"stack traceback:\");\r\n  while (lua_getstack(L1, level++, &ar)) {\r\n    if (level > LEVELS1 && firstpart) {\r\n      /* no more than `LEVELS2' more levels? */\r\n      if (!lua_getstack(L1, level+LEVELS2, &ar))\r\n        level--;  /* keep going */\r\n      else {\r\n        lua_pushliteral(L, \"\\n\\t...\");  /* too many levels */\r\n        while (lua_getstack(L1, level+LEVELS2, &ar))  /* find last levels */\r\n          level++;\r\n      }\r\n      firstpart = 0;\r\n      continue;\r\n    }\r\n    lua_pushliteral(L, \"\\n\\t\");\r\n    lua_getinfo(L1, \"Snl\", &ar);\r\n    lua_pushfstring(L, \"%s:\", ar.short_src);\r\n    if (ar.currentline > 0)\r\n      lua_pushfstring(L, \"%d:\", ar.currentline);\r\n    if (*ar.namewhat != '\\0')  /* is there a name? */\r\n        lua_pushfstring(L, \" in function \" LUA_QS, ar.name);\r\n    else {\r\n      if (*ar.what == 'm')  /* main? */\r\n        lua_pushfstring(L, \" in main chunk\");\r\n      else if (*ar.what == 'C' || *ar.what == 't')\r\n        lua_pushliteral(L, \" ?\");  /* C function or tail call */\r\n      else\r\n        lua_pushfstring(L, \" in function <%s:%d>\",\r\n                           ar.short_src, ar.linedefined);\r\n    }\r\n    lua_concat(L, lua_gettop(L) - arg);\r\n  }\r\n  lua_concat(L, lua_gettop(L) - arg);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const luaL_Reg dblib[] = {\r\n  {\"debug\", db_debug},\r\n  {\"getfenv\", db_getfenv},\r\n  {\"gethook\", db_gethook},\r\n  {\"getinfo\", db_getinfo},\r\n  {\"getlocal\", db_getlocal},\r\n  {\"getregistry\", db_getregistry},\r\n  {\"getmetatable\", db_getmetatable},\r\n  {\"getupvalue\", db_getupvalue},\r\n  {\"setfenv\", db_setfenv},\r\n  {\"sethook\", db_sethook},\r\n  {\"setlocal\", db_setlocal},\r\n  {\"setmetatable\", db_setmetatable},\r\n  {\"setupvalue\", db_setupvalue},\r\n  {\"traceback\", db_errorfb},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nLUALIB_API int luaopen_debug (lua_State *L) {\r\n  luaL_register(L, LUA_DBLIBNAME, dblib);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldebug.c",
    "content": "/*\r\n** $Id: ldebug.c,v 2.29.1.6 2008/05/08 16:56:26 roberto Exp $\r\n** Debug Interface\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stdarg.h>\r\n#include <stddef.h>\r\n#include <string.h>\r\n\r\n\r\n#define ldebug_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lapi.h\"\r\n#include \"lcode.h\"\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n#include \"lvm.h\"\r\n\r\n\r\n\r\nstatic const char *getfuncname (lua_State *L, CallInfo *ci, const char **name);\r\n\r\n\r\nstatic int currentpc (lua_State *L, CallInfo *ci) {\r\n  if (!isLua(ci)) return -1;  /* function is not a Lua function? */\r\n  if (ci == L->ci)\r\n    ci->savedpc = L->savedpc;\r\n  return pcRel(ci->savedpc, ci_func(ci)->l.p);\r\n}\r\n\r\n\r\nstatic int currentline (lua_State *L, CallInfo *ci) {\r\n  int pc = currentpc(L, ci);\r\n  if (pc < 0)\r\n    return -1;  /* only active lua functions have current-line information */\r\n  else\r\n    return getline(ci_func(ci)->l.p, pc);\r\n}\r\n\r\n\r\n/*\r\n** this function can be called asynchronous (e.g. during a signal)\r\n*/\r\nLUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count) {\r\n  if (func == NULL || mask == 0) {  /* turn off hooks? */\r\n    mask = 0;\r\n    func = NULL;\r\n  }\r\n  L->hook = func;\r\n  L->basehookcount = count;\r\n  resethookcount(L);\r\n  L->hookmask = cast_byte(mask);\r\n  return 1;\r\n}\r\n\r\n\r\nLUA_API lua_Hook lua_gethook (lua_State *L) {\r\n  return L->hook;\r\n}\r\n\r\n\r\nLUA_API int lua_gethookmask (lua_State *L) {\r\n  return L->hookmask;\r\n}\r\n\r\n\r\nLUA_API int lua_gethookcount (lua_State *L) {\r\n  return L->basehookcount;\r\n}\r\n\r\n\r\nLUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar) {\r\n  int status;\r\n  CallInfo *ci;\r\n  lua_lock(L);\r\n  for (ci = L->ci; level > 0 && ci > L->base_ci; ci--) {\r\n    level--;\r\n    if (f_isLua(ci))  /* Lua function? */\r\n      level -= ci->tailcalls;  /* skip lost tail calls */\r\n  }\r\n  if (level == 0 && ci > L->base_ci) {  /* level found? */\r\n    status = 1;\r\n    ar->i_ci = cast_int(ci - L->base_ci);\r\n  }\r\n  else if (level < 0) {  /* level is of a lost tail call? */\r\n    status = 1;\r\n    ar->i_ci = 0;\r\n  }\r\n  else status = 0;  /* no such level */\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\nstatic Proto *getluaproto (CallInfo *ci) {\r\n  return (isLua(ci) ? ci_func(ci)->l.p : NULL);\r\n}\r\n\r\n\r\nstatic const char *findlocal (lua_State *L, CallInfo *ci, int n) {\r\n  const char *name;\r\n  Proto *fp = getluaproto(ci);\r\n  if (fp && (name = luaF_getlocalname(fp, n, currentpc(L, ci))) != NULL)\r\n    return name;  /* is a local variable in a Lua function */\r\n  else {\r\n    StkId limit = (ci == L->ci) ? L->top : (ci+1)->func;\r\n    if (limit - ci->base >= n && n > 0)  /* is 'n' inside 'ci' stack? */\r\n      return \"(*temporary)\";\r\n    else\r\n      return NULL;\r\n  }\r\n}\r\n\r\n\r\nLUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n) {\r\n  CallInfo *ci = L->base_ci + ar->i_ci;\r\n  const char *name = findlocal(L, ci, n);\r\n  lua_lock(L);\r\n  if (name)\r\n      luaA_pushobject(L, ci->base + (n - 1));\r\n  lua_unlock(L);\r\n  return name;\r\n}\r\n\r\n\r\nLUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n) {\r\n  CallInfo *ci = L->base_ci + ar->i_ci;\r\n  const char *name = findlocal(L, ci, n);\r\n  lua_lock(L);\r\n  if (name)\r\n      setobjs2s(L, ci->base + (n - 1), L->top - 1);\r\n  L->top--;  /* pop value */\r\n  lua_unlock(L);\r\n  return name;\r\n}\r\n\r\n\r\nstatic void funcinfo (lua_Debug *ar, Closure *cl) {\r\n  if (cl->c.isC) {\r\n    ar->source = \"=[C]\";\r\n    ar->linedefined = -1;\r\n    ar->lastlinedefined = -1;\r\n    ar->what = \"C\";\r\n  }\r\n  else {\r\n    ar->source = getstr(cl->l.p->source);\r\n    ar->linedefined = cl->l.p->linedefined;\r\n    ar->lastlinedefined = cl->l.p->lastlinedefined;\r\n    ar->what = (ar->linedefined == 0) ? \"main\" : \"Lua\";\r\n  }\r\n  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);\r\n}\r\n\r\n\r\nstatic void info_tailcall (lua_Debug *ar) {\r\n  ar->name = ar->namewhat = \"\";\r\n  ar->what = \"tail\";\r\n  ar->lastlinedefined = ar->linedefined = ar->currentline = -1;\r\n  ar->source = \"=(tail call)\";\r\n  luaO_chunkid(ar->short_src, ar->source, LUA_IDSIZE);\r\n  ar->nups = 0;\r\n}\r\n\r\n\r\nstatic void collectvalidlines (lua_State *L, Closure *f) {\r\n  if (f == NULL || f->c.isC) {\r\n    setnilvalue(L->top);\r\n  }\r\n  else {\r\n    Table *t = luaH_new(L, 0, 0);\r\n    int *lineinfo = f->l.p->lineinfo;\r\n    int i;\r\n    for (i=0; i<f->l.p->sizelineinfo; i++)\r\n      setbvalue(luaH_setnum(L, t, lineinfo[i]), 1);\r\n    sethvalue(L, L->top, t); \r\n  }\r\n  incr_top(L);\r\n}\r\n\r\n\r\nstatic int auxgetinfo (lua_State *L, const char *what, lua_Debug *ar,\r\n                    Closure *f, CallInfo *ci) {\r\n  int status = 1;\r\n  if (f == NULL) {\r\n    info_tailcall(ar);\r\n    return status;\r\n  }\r\n  for (; *what; what++) {\r\n    switch (*what) {\r\n      case 'S': {\r\n        funcinfo(ar, f);\r\n        break;\r\n      }\r\n      case 'l': {\r\n        ar->currentline = (ci) ? currentline(L, ci) : -1;\r\n        break;\r\n      }\r\n      case 'u': {\r\n        ar->nups = f->c.nupvalues;\r\n        break;\r\n      }\r\n      case 'n': {\r\n        ar->namewhat = (ci) ? getfuncname(L, ci, &ar->name) : NULL;\r\n        if (ar->namewhat == NULL) {\r\n          ar->namewhat = \"\";  /* not found */\r\n          ar->name = NULL;\r\n        }\r\n        break;\r\n      }\r\n      case 'L':\r\n      case 'f':  /* handled by lua_getinfo */\r\n        break;\r\n      default: status = 0;  /* invalid option */\r\n    }\r\n  }\r\n  return status;\r\n}\r\n\r\n\r\nLUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar) {\r\n  int status;\r\n  Closure *f = NULL;\r\n  CallInfo *ci = NULL;\r\n  lua_lock(L);\r\n  if (*what == '>') {\r\n    StkId func = L->top - 1;\r\n    luai_apicheck(L, ttisfunction(func));\r\n    what++;  /* skip the '>' */\r\n    f = clvalue(func);\r\n    L->top--;  /* pop function */\r\n  }\r\n  else if (ar->i_ci != 0) {  /* no tail call? */\r\n    ci = L->base_ci + ar->i_ci;\r\n    lua_assert(ttisfunction(ci->func));\r\n    f = clvalue(ci->func);\r\n  }\r\n  status = auxgetinfo(L, what, ar, f, ci);\r\n  if (strchr(what, 'f')) {\r\n    if (f == NULL) setnilvalue(L->top);\r\n    else setclvalue(L, L->top, f);\r\n    incr_top(L);\r\n  }\r\n  if (strchr(what, 'L'))\r\n    collectvalidlines(L, f);\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Symbolic Execution and code checker\r\n** =======================================================\r\n*/\r\n\r\n#define check(x)\t\tif (!(x)) return 0;\r\n\r\n#define checkjump(pt,pc)\tcheck(0 <= pc && pc < pt->sizecode)\r\n\r\n#define checkreg(pt,reg)\tcheck((reg) < (pt)->maxstacksize)\r\n\r\n\r\n\r\nstatic int precheck (const Proto *pt) {\r\n  check(pt->maxstacksize <= MAXSTACK);\r\n  check(pt->numparams+(pt->is_vararg & VARARG_HASARG) <= pt->maxstacksize);\r\n  check(!(pt->is_vararg & VARARG_NEEDSARG) ||\r\n              (pt->is_vararg & VARARG_HASARG));\r\n  check(pt->sizeupvalues <= pt->nups);\r\n  check(pt->sizelineinfo == pt->sizecode || pt->sizelineinfo == 0);\r\n  check(pt->sizecode > 0 && GET_OPCODE(pt->code[pt->sizecode-1]) == OP_RETURN);\r\n  return 1;\r\n}\r\n\r\n\r\n#define checkopenop(pt,pc)\tluaG_checkopenop((pt)->code[(pc)+1])\r\n\r\nint luaG_checkopenop (Instruction i) {\r\n  switch (GET_OPCODE(i)) {\r\n    case OP_CALL:\r\n    case OP_TAILCALL:\r\n    case OP_RETURN:\r\n    case OP_SETLIST: {\r\n      check(GETARG_B(i) == 0);\r\n      return 1;\r\n    }\r\n    default: return 0;  /* invalid instruction after an open call */\r\n  }\r\n}\r\n\r\n\r\nstatic int checkArgMode (const Proto *pt, int r, enum OpArgMask mode) {\r\n  switch (mode) {\r\n    case OpArgN: check(r == 0); break;\r\n    case OpArgU: break;\r\n    case OpArgR: checkreg(pt, r); break;\r\n    case OpArgK:\r\n      check(ISK(r) ? INDEXK(r) < pt->sizek : r < pt->maxstacksize);\r\n      break;\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic Instruction symbexec (const Proto *pt, int lastpc, int reg) {\r\n  int pc;\r\n  int last;  /* stores position of last instruction that changed `reg' */\r\n  last = pt->sizecode-1;  /* points to final return (a `neutral' instruction) */\r\n  check(precheck(pt));\r\n  for (pc = 0; pc < lastpc; pc++) {\r\n    Instruction i = pt->code[pc];\r\n    OpCode op = GET_OPCODE(i);\r\n    int a = GETARG_A(i);\r\n    int b = 0;\r\n    int c = 0;\r\n    check(op < NUM_OPCODES);\r\n    checkreg(pt, a);\r\n    switch (getOpMode(op)) {\r\n      case iABC: {\r\n        b = GETARG_B(i);\r\n        c = GETARG_C(i);\r\n        check(checkArgMode(pt, b, getBMode(op)));\r\n        check(checkArgMode(pt, c, getCMode(op)));\r\n        break;\r\n      }\r\n      case iABx: {\r\n        b = GETARG_Bx(i);\r\n        if (getBMode(op) == OpArgK) check(b < pt->sizek);\r\n        break;\r\n      }\r\n      case iAsBx: {\r\n        b = GETARG_sBx(i);\r\n        if (getBMode(op) == OpArgR) {\r\n          int dest = pc+1+b;\r\n          check(0 <= dest && dest < pt->sizecode);\r\n          if (dest > 0) {\r\n            int j;\r\n            /* check that it does not jump to a setlist count; this\r\n               is tricky, because the count from a previous setlist may\r\n               have the same value of an invalid setlist; so, we must\r\n               go all the way back to the first of them (if any) */\r\n            for (j = 0; j < dest; j++) {\r\n              Instruction d = pt->code[dest-1-j];\r\n              if (!(GET_OPCODE(d) == OP_SETLIST && GETARG_C(d) == 0)) break;\r\n            }\r\n            /* if 'j' is even, previous value is not a setlist (even if\r\n               it looks like one) */\r\n            check((j&1) == 0);\r\n          }\r\n        }\r\n        break;\r\n      }\r\n    }\r\n    if (testAMode(op)) {\r\n      if (a == reg) last = pc;  /* change register `a' */\r\n    }\r\n    if (testTMode(op)) {\r\n      check(pc+2 < pt->sizecode);  /* check skip */\r\n      check(GET_OPCODE(pt->code[pc+1]) == OP_JMP);\r\n    }\r\n    switch (op) {\r\n      case OP_LOADBOOL: {\r\n        if (c == 1) {  /* does it jump? */\r\n          check(pc+2 < pt->sizecode);  /* check its jump */\r\n          check(GET_OPCODE(pt->code[pc+1]) != OP_SETLIST ||\r\n                GETARG_C(pt->code[pc+1]) != 0);\r\n        }\r\n        break;\r\n      }\r\n      case OP_LOADNIL: {\r\n        if (a <= reg && reg <= b)\r\n          last = pc;  /* set registers from `a' to `b' */\r\n        break;\r\n      }\r\n      case OP_GETUPVAL:\r\n      case OP_SETUPVAL: {\r\n        check(b < pt->nups);\r\n        break;\r\n      }\r\n      case OP_GETGLOBAL:\r\n      case OP_SETGLOBAL: {\r\n        check(ttisstring(&pt->k[b]));\r\n        break;\r\n      }\r\n      case OP_SELF: {\r\n        checkreg(pt, a+1);\r\n        if (reg == a+1) last = pc;\r\n        break;\r\n      }\r\n      case OP_CONCAT: {\r\n        check(b < c);  /* at least two operands */\r\n        break;\r\n      }\r\n      case OP_TFORLOOP: {\r\n        check(c >= 1);  /* at least one result (control variable) */\r\n        checkreg(pt, a+2+c);  /* space for results */\r\n        if (reg >= a+2) last = pc;  /* affect all regs above its base */\r\n        break;\r\n      }\r\n      case OP_FORLOOP:\r\n      case OP_FORPREP:\r\n        checkreg(pt, a+3);\r\n        /* go through */\r\n      case OP_JMP: {\r\n        int dest = pc+1+b;\r\n        /* not full check and jump is forward and do not skip `lastpc'? */\r\n        if (reg != NO_REG && pc < dest && dest <= lastpc)\r\n          pc += b;  /* do the jump */\r\n        break;\r\n      }\r\n      case OP_CALL:\r\n      case OP_TAILCALL: {\r\n        if (b != 0) {\r\n          checkreg(pt, a+b-1);\r\n        }\r\n        c--;  /* c = num. returns */\r\n        if (c == LUA_MULTRET) {\r\n          check(checkopenop(pt, pc));\r\n        }\r\n        else if (c != 0)\r\n          checkreg(pt, a+c-1);\r\n        if (reg >= a) last = pc;  /* affect all registers above base */\r\n        break;\r\n      }\r\n      case OP_RETURN: {\r\n        b--;  /* b = num. returns */\r\n        if (b > 0) checkreg(pt, a+b-1);\r\n        break;\r\n      }\r\n      case OP_SETLIST: {\r\n        if (b > 0) checkreg(pt, a + b);\r\n        if (c == 0) {\r\n          pc++;\r\n          check(pc < pt->sizecode - 1);\r\n        }\r\n        break;\r\n      }\r\n      case OP_CLOSURE: {\r\n        int nup, j;\r\n        check(b < pt->sizep);\r\n        nup = pt->p[b]->nups;\r\n        check(pc + nup < pt->sizecode);\r\n        for (j = 1; j <= nup; j++) {\r\n          OpCode op1 = GET_OPCODE(pt->code[pc + j]);\r\n          check(op1 == OP_GETUPVAL || op1 == OP_MOVE);\r\n        }\r\n        if (reg != NO_REG)  /* tracing? */\r\n          pc += nup;  /* do not 'execute' these pseudo-instructions */\r\n        break;\r\n      }\r\n      case OP_VARARG: {\r\n        check((pt->is_vararg & VARARG_ISVARARG) &&\r\n             !(pt->is_vararg & VARARG_NEEDSARG));\r\n        b--;\r\n        if (b == LUA_MULTRET) check(checkopenop(pt, pc));\r\n        checkreg(pt, a+b-1);\r\n        break;\r\n      }\r\n      default: break;\r\n    }\r\n  }\r\n  return pt->code[last];\r\n}\r\n\r\n#undef check\r\n#undef checkjump\r\n#undef checkreg\r\n\r\n/* }====================================================== */\r\n\r\n\r\nint luaG_checkcode (const Proto *pt) {\r\n  return (symbexec(pt, pt->sizecode, NO_REG) != 0);\r\n}\r\n\r\n\r\nstatic const char *kname (Proto *p, int c) {\r\n  if (ISK(c) && ttisstring(&p->k[INDEXK(c)]))\r\n    return svalue(&p->k[INDEXK(c)]);\r\n  else\r\n    return \"?\";\r\n}\r\n\r\n\r\nstatic const char *getobjname (lua_State *L, CallInfo *ci, int stackpos,\r\n                               const char **name) {\r\n  if (isLua(ci)) {  /* a Lua function? */\r\n    Proto *p = ci_func(ci)->l.p;\r\n    int pc = currentpc(L, ci);\r\n    Instruction i;\r\n    *name = luaF_getlocalname(p, stackpos+1, pc);\r\n    if (*name)  /* is a local? */\r\n      return \"local\";\r\n    i = symbexec(p, pc, stackpos);  /* try symbolic execution */\r\n    lua_assert(pc != -1);\r\n    switch (GET_OPCODE(i)) {\r\n      case OP_GETGLOBAL: {\r\n        int g = GETARG_Bx(i);  /* global index */\r\n        lua_assert(ttisstring(&p->k[g]));\r\n        *name = svalue(&p->k[g]);\r\n        return \"global\";\r\n      }\r\n      case OP_MOVE: {\r\n        int a = GETARG_A(i);\r\n        int b = GETARG_B(i);  /* move from `b' to `a' */\r\n        if (b < a)\r\n          return getobjname(L, ci, b, name);  /* get name for `b' */\r\n        break;\r\n      }\r\n      case OP_GETTABLE: {\r\n        int k = GETARG_C(i);  /* key index */\r\n        *name = kname(p, k);\r\n        return \"field\";\r\n      }\r\n      case OP_GETUPVAL: {\r\n        int u = GETARG_B(i);  /* upvalue index */\r\n        *name = p->upvalues ? getstr(p->upvalues[u]) : \"?\";\r\n        return \"upvalue\";\r\n      }\r\n      case OP_SELF: {\r\n        int k = GETARG_C(i);  /* key index */\r\n        *name = kname(p, k);\r\n        return \"method\";\r\n      }\r\n      default: break;\r\n    }\r\n  }\r\n  return NULL;  /* no useful name found */\r\n}\r\n\r\n\r\nstatic const char *getfuncname (lua_State *L, CallInfo *ci, const char **name) {\r\n  Instruction i;\r\n  if ((isLua(ci) && ci->tailcalls > 0) || !isLua(ci - 1))\r\n    return NULL;  /* calling function is not Lua (or is unknown) */\r\n  ci--;  /* calling function */\r\n  i = ci_func(ci)->l.p->code[currentpc(L, ci)];\r\n  if (GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||\r\n      GET_OPCODE(i) == OP_TFORLOOP)\r\n    return getobjname(L, ci, GETARG_A(i), name);\r\n  else\r\n    return NULL;  /* no useful name can be found */\r\n}\r\n\r\n\r\n/* only ANSI way to check whether a pointer points to an array */\r\nstatic int isinstack (CallInfo *ci, const TValue *o) {\r\n  StkId p;\r\n  for (p = ci->base; p < ci->top; p++)\r\n    if (o == p) return 1;\r\n  return 0;\r\n}\r\n\r\n\r\nvoid luaG_typeerror (lua_State *L, const TValue *o, const char *op) {\r\n  const char *name = NULL;\r\n  const char *t = luaT_typenames[ttype(o)];\r\n  const char *kind = (isinstack(L->ci, o)) ?\r\n                         getobjname(L, L->ci, cast_int(o - L->base), &name) :\r\n                         NULL;\r\n  if (kind)\r\n    luaG_runerror(L, \"attempt to %s %s \" LUA_QS \" (a %s value)\",\r\n                op, kind, name, t);\r\n  else\r\n    luaG_runerror(L, \"attempt to %s a %s value\", op, t);\r\n}\r\n\r\n\r\nvoid luaG_concaterror (lua_State *L, StkId p1, StkId p2) {\r\n  if (ttisstring(p1) || ttisnumber(p1)) p1 = p2;\r\n  lua_assert(!ttisstring(p1) && !ttisnumber(p1));\r\n  luaG_typeerror(L, p1, \"concatenate\");\r\n}\r\n\r\n\r\nvoid luaG_aritherror (lua_State *L, const TValue *p1, const TValue *p2) {\r\n  TValue temp;\r\n  if (luaV_tonumber(p1, &temp) == NULL)\r\n    p2 = p1;  /* first operand is wrong */\r\n  luaG_typeerror(L, p2, \"perform arithmetic on\");\r\n}\r\n\r\n\r\nint luaG_ordererror (lua_State *L, const TValue *p1, const TValue *p2) {\r\n  const char *t1 = luaT_typenames[ttype(p1)];\r\n  const char *t2 = luaT_typenames[ttype(p2)];\r\n  if (t1[2] == t2[2])\r\n    luaG_runerror(L, \"attempt to compare two %s values\", t1);\r\n  else\r\n    luaG_runerror(L, \"attempt to compare %s with %s\", t1, t2);\r\n  return 0;\r\n}\r\n\r\n\r\nstatic void addinfo (lua_State *L, const char *msg) {\r\n  CallInfo *ci = L->ci;\r\n  if (isLua(ci)) {  /* is Lua code? */\r\n    char buff[LUA_IDSIZE];  /* add file:line information */\r\n    int line = currentline(L, ci);\r\n    luaO_chunkid(buff, getstr(getluaproto(ci)->source), LUA_IDSIZE);\r\n    luaO_pushfstring(L, \"%s:%d: %s\", buff, line, msg);\r\n  }\r\n}\r\n\r\n\r\nvoid luaG_errormsg (lua_State *L) {\r\n  if (L->errfunc != 0) {  /* is there an error handling function? */\r\n    StkId errfunc = restorestack(L, L->errfunc);\r\n    if (!ttisfunction(errfunc)) luaD_throw(L, LUA_ERRERR);\r\n    setobjs2s(L, L->top, L->top - 1);  /* move argument */\r\n    setobjs2s(L, L->top - 1, errfunc);  /* push function */\r\n    incr_top(L);\r\n    luaD_call(L, L->top - 2, 1);  /* call it */\r\n  }\r\n  luaD_throw(L, LUA_ERRRUN);\r\n}\r\n\r\n\r\nvoid luaG_runerror (lua_State *L, const char *fmt, ...) {\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  addinfo(L, luaO_pushvfstring(L, fmt, argp));\r\n  va_end(argp);\r\n  luaG_errormsg(L);\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldebug.h",
    "content": "/*\r\n** $Id: ldebug.h,v 2.3.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions from Debug Interface module\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef ldebug_h\r\n#define ldebug_h\r\n\r\n\r\n#include \"lstate.h\"\r\n\r\n\r\n#define pcRel(pc, p)\t(cast(int, (pc) - (p)->code) - 1)\r\n\r\n#define getline(f,pc)\t(((f)->lineinfo) ? (f)->lineinfo[pc] : 0)\r\n\r\n#define resethookcount(L)\t(L->hookcount = L->basehookcount)\r\n\r\n\r\nLUAI_FUNC void luaG_typeerror (lua_State *L, const TValue *o,\r\n                                             const char *opname);\r\nLUAI_FUNC void luaG_concaterror (lua_State *L, StkId p1, StkId p2);\r\nLUAI_FUNC void luaG_aritherror (lua_State *L, const TValue *p1,\r\n                                              const TValue *p2);\r\nLUAI_FUNC int luaG_ordererror (lua_State *L, const TValue *p1,\r\n                                             const TValue *p2);\r\nLUAI_FUNC void luaG_runerror (lua_State *L, const char *fmt, ...);\r\nLUAI_FUNC void luaG_errormsg (lua_State *L);\r\nLUAI_FUNC int luaG_checkcode (const Proto *pt);\r\nLUAI_FUNC int luaG_checkopenop (Instruction i);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldo.c",
    "content": "/*\r\n** $Id: ldo.c,v 2.38.1.4 2012/01/18 02:27:10 roberto Exp $\r\n** Stack and Call structure of Lua\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <setjmp.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define ldo_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lparser.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n#include \"lundump.h\"\r\n#include \"lvm.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Error-recovery functions\r\n** =======================================================\r\n*/\r\n\r\n\r\n/* chain list of long jump buffers */\r\nstruct lua_longjmp {\r\n  struct lua_longjmp *previous;\r\n  luai_jmpbuf b;\r\n  volatile int status;  /* error code */\r\n};\r\n\r\n\r\nvoid luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) {\r\n  switch (errcode) {\r\n    case LUA_ERRMEM: {\r\n      setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG));\r\n      break;\r\n    }\r\n    case LUA_ERRERR: {\r\n      setsvalue2s(L, oldtop, luaS_newliteral(L, \"error in error handling\"));\r\n      break;\r\n    }\r\n    case LUA_ERRSYNTAX:\r\n    case LUA_ERRRUN: {\r\n      setobjs2s(L, oldtop, L->top - 1);  /* error message on current top */\r\n      break;\r\n    }\r\n  }\r\n  L->top = oldtop + 1;\r\n}\r\n\r\n\r\nstatic void restore_stack_limit (lua_State *L) {\r\n  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);\r\n  if (L->size_ci > LUAI_MAXCALLS) {  /* there was an overflow? */\r\n    int inuse = cast_int(L->ci - L->base_ci);\r\n    if (inuse + 1 < LUAI_MAXCALLS)  /* can `undo' overflow? */\r\n      luaD_reallocCI(L, LUAI_MAXCALLS);\r\n  }\r\n}\r\n\r\n\r\nstatic void resetstack (lua_State *L, int status) {\r\n  L->ci = L->base_ci;\r\n  L->base = L->ci->base;\r\n  luaF_close(L, L->base);  /* close eventual pending closures */\r\n  luaD_seterrorobj(L, status, L->base);\r\n  L->nCcalls = L->baseCcalls;\r\n  L->allowhook = 1;\r\n  restore_stack_limit(L);\r\n  L->errfunc = 0;\r\n  L->errorJmp = NULL;\r\n}\r\n\r\n\r\nvoid luaD_throw (lua_State *L, int errcode) {\r\n  if (L->errorJmp) {\r\n    L->errorJmp->status = errcode;\r\n    LUAI_THROW(L, L->errorJmp);\r\n  }\r\n  else {\r\n    L->status = cast_byte(errcode);\r\n    if (G(L)->panic) {\r\n      resetstack(L, errcode);\r\n      lua_unlock(L);\r\n      G(L)->panic(L);\r\n    }\r\n    exit(EXIT_FAILURE);\r\n  }\r\n}\r\n\r\n\r\nint luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) {\r\n  struct lua_longjmp lj;\r\n  lj.status = 0;\r\n  lj.previous = L->errorJmp;  /* chain new error handler */\r\n  L->errorJmp = &lj;\r\n  LUAI_TRY(L, &lj,\r\n    (*f)(L, ud);\r\n  );\r\n  L->errorJmp = lj.previous;  /* restore old error handler */\r\n  return lj.status;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic void correctstack (lua_State *L, TValue *oldstack) {\r\n  CallInfo *ci;\r\n  GCObject *up;\r\n  L->top = (L->top - oldstack) + L->stack;\r\n  for (up = L->openupval; up != NULL; up = up->gch.next)\r\n    gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;\r\n  for (ci = L->base_ci; ci <= L->ci; ci++) {\r\n    ci->top = (ci->top - oldstack) + L->stack;\r\n    ci->base = (ci->base - oldstack) + L->stack;\r\n    ci->func = (ci->func - oldstack) + L->stack;\r\n  }\r\n  L->base = (L->base - oldstack) + L->stack;\r\n}\r\n\r\n\r\nvoid luaD_reallocstack (lua_State *L, int newsize) {\r\n  TValue *oldstack = L->stack;\r\n  int realsize = newsize + 1 + EXTRA_STACK;\r\n  lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK - 1);\r\n  luaM_reallocvector(L, L->stack, L->stacksize, realsize, TValue);\r\n  L->stacksize = realsize;\r\n  L->stack_last = L->stack+newsize;\r\n  correctstack(L, oldstack);\r\n}\r\n\r\n\r\nvoid luaD_reallocCI (lua_State *L, int newsize) {\r\n  CallInfo *oldci = L->base_ci;\r\n  luaM_reallocvector(L, L->base_ci, L->size_ci, newsize, CallInfo);\r\n  L->size_ci = newsize;\r\n  L->ci = (L->ci - oldci) + L->base_ci;\r\n  L->end_ci = L->base_ci + L->size_ci - 1;\r\n}\r\n\r\n\r\nvoid luaD_growstack (lua_State *L, int n) {\r\n  if (n <= L->stacksize)  /* double size is enough? */\r\n    luaD_reallocstack(L, 2*L->stacksize);\r\n  else\r\n    luaD_reallocstack(L, L->stacksize + n);\r\n}\r\n\r\n\r\nstatic CallInfo *growCI (lua_State *L) {\r\n  if (L->size_ci > LUAI_MAXCALLS)  /* overflow while handling overflow? */\r\n    luaD_throw(L, LUA_ERRERR);\r\n  else {\r\n    luaD_reallocCI(L, 2*L->size_ci);\r\n    if (L->size_ci > LUAI_MAXCALLS)\r\n      luaG_runerror(L, \"stack overflow\");\r\n  }\r\n  return ++L->ci;\r\n}\r\n\r\n\r\nvoid luaD_callhook (lua_State *L, int event, int line) {\r\n  lua_Hook hook = L->hook;\r\n  if (hook && L->allowhook) {\r\n    ptrdiff_t top = savestack(L, L->top);\r\n    ptrdiff_t ci_top = savestack(L, L->ci->top);\r\n    lua_Debug ar;\r\n    ar.event = event;\r\n    ar.currentline = line;\r\n    if (event == LUA_HOOKTAILRET)\r\n      ar.i_ci = 0;  /* tail call; no debug information about it */\r\n    else\r\n      ar.i_ci = cast_int(L->ci - L->base_ci);\r\n    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */\r\n    L->ci->top = L->top + LUA_MINSTACK;\r\n    lua_assert(L->ci->top <= L->stack_last);\r\n    L->allowhook = 0;  /* cannot call hooks inside a hook */\r\n    lua_unlock(L);\r\n    (*hook)(L, &ar);\r\n    lua_lock(L);\r\n    lua_assert(!L->allowhook);\r\n    L->allowhook = 1;\r\n    L->ci->top = restorestack(L, ci_top);\r\n    L->top = restorestack(L, top);\r\n  }\r\n}\r\n\r\n\r\nstatic StkId adjust_varargs (lua_State *L, Proto *p, int actual) {\r\n  int i;\r\n  int nfixargs = p->numparams;\r\n  Table *htab = NULL;\r\n  StkId base, fixed;\r\n  for (; actual < nfixargs; ++actual)\r\n    setnilvalue(L->top++);\r\n#if defined(LUA_COMPAT_VARARG)\r\n  if (p->is_vararg & VARARG_NEEDSARG) { /* compat. with old-style vararg? */\r\n    int nvar = actual - nfixargs;  /* number of extra arguments */\r\n    lua_assert(p->is_vararg & VARARG_HASARG);\r\n    luaC_checkGC(L);\r\n    luaD_checkstack(L, p->maxstacksize);\r\n    htab = luaH_new(L, nvar, 1);  /* create `arg' table */\r\n    for (i=0; i<nvar; i++)  /* put extra arguments into `arg' table */\r\n      setobj2n(L, luaH_setnum(L, htab, i+1), L->top - nvar + i);\r\n    /* store counter in field `n' */\r\n    setnvalue(luaH_setstr(L, htab, luaS_newliteral(L, \"n\")), cast_num(nvar));\r\n  }\r\n#endif\r\n  /* move fixed parameters to final position */\r\n  fixed = L->top - actual;  /* first fixed argument */\r\n  base = L->top;  /* final position of first argument */\r\n  for (i=0; i<nfixargs; i++) {\r\n    setobjs2s(L, L->top++, fixed+i);\r\n    setnilvalue(fixed+i);\r\n  }\r\n  /* add `arg' parameter */\r\n  if (htab) {\r\n    sethvalue(L, L->top++, htab);\r\n    lua_assert(iswhite(obj2gco(htab)));\r\n  }\r\n  return base;\r\n}\r\n\r\n\r\nstatic StkId tryfuncTM (lua_State *L, StkId func) {\r\n  const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL);\r\n  StkId p;\r\n  ptrdiff_t funcr = savestack(L, func);\r\n  if (!ttisfunction(tm))\r\n    luaG_typeerror(L, func, \"call\");\r\n  /* Open a hole inside the stack at `func' */\r\n  for (p = L->top; p > func; p--) setobjs2s(L, p, p-1);\r\n  incr_top(L);\r\n  func = restorestack(L, funcr);  /* previous call may change stack */\r\n  setobj2s(L, func, tm);  /* tag method is the new function to be called */\r\n  return func;\r\n}\r\n\r\n\r\n\r\n#define inc_ci(L) \\\r\n  ((L->ci == L->end_ci) ? growCI(L) : \\\r\n   (condhardstacktests(luaD_reallocCI(L, L->size_ci)), ++L->ci))\r\n\r\n\r\nint luaD_precall (lua_State *L, StkId func, int nresults) {\r\n  LClosure *cl;\r\n  ptrdiff_t funcr;\r\n  if (!ttisfunction(func)) /* `func' is not a function? */\r\n    func = tryfuncTM(L, func);  /* check the `function' tag method */\r\n  funcr = savestack(L, func);\r\n  cl = &clvalue(func)->l;\r\n  L->ci->savedpc = L->savedpc;\r\n  if (!cl->isC) {  /* Lua function? prepare its call */\r\n    CallInfo *ci;\r\n    StkId st, base;\r\n    Proto *p = cl->p;\r\n    luaD_checkstack(L, p->maxstacksize);\r\n    func = restorestack(L, funcr);\r\n    if (!p->is_vararg) {  /* no varargs? */\r\n      base = func + 1;\r\n      if (L->top > base + p->numparams)\r\n        L->top = base + p->numparams;\r\n    }\r\n    else {  /* vararg function */\r\n      int nargs = cast_int(L->top - func) - 1;\r\n      base = adjust_varargs(L, p, nargs);\r\n      func = restorestack(L, funcr);  /* previous call may change the stack */\r\n    }\r\n    ci = inc_ci(L);  /* now `enter' new function */\r\n    ci->func = func;\r\n    L->base = ci->base = base;\r\n    ci->top = L->base + p->maxstacksize;\r\n    lua_assert(ci->top <= L->stack_last);\r\n    L->savedpc = p->code;  /* starting point */\r\n    ci->tailcalls = 0;\r\n    ci->nresults = nresults;\r\n    for (st = L->top; st < ci->top; st++)\r\n      setnilvalue(st);\r\n    L->top = ci->top;\r\n    if (L->hookmask & LUA_MASKCALL) {\r\n      L->savedpc++;  /* hooks assume 'pc' is already incremented */\r\n      luaD_callhook(L, LUA_HOOKCALL, -1);\r\n      L->savedpc--;  /* correct 'pc' */\r\n    }\r\n    return PCRLUA;\r\n  }\r\n  else {  /* if is a C function, call it */\r\n    CallInfo *ci;\r\n    int n;\r\n    luaD_checkstack(L, LUA_MINSTACK);  /* ensure minimum stack size */\r\n    ci = inc_ci(L);  /* now `enter' new function */\r\n    ci->func = restorestack(L, funcr);\r\n    L->base = ci->base = ci->func + 1;\r\n    ci->top = L->top + LUA_MINSTACK;\r\n    lua_assert(ci->top <= L->stack_last);\r\n    ci->nresults = nresults;\r\n    if (L->hookmask & LUA_MASKCALL)\r\n      luaD_callhook(L, LUA_HOOKCALL, -1);\r\n    lua_unlock(L);\r\n    n = (*curr_func(L)->c.f)(L);  /* do the actual call */\r\n    lua_lock(L);\r\n    if (n < 0)  /* yielding? */\r\n      return PCRYIELD;\r\n    else {\r\n      luaD_poscall(L, L->top - n);\r\n      return PCRC;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic StkId callrethooks (lua_State *L, StkId firstResult) {\r\n  ptrdiff_t fr = savestack(L, firstResult);  /* next call may change stack */\r\n  luaD_callhook(L, LUA_HOOKRET, -1);\r\n  if (f_isLua(L->ci)) {  /* Lua function? */\r\n    while ((L->hookmask & LUA_MASKRET) && L->ci->tailcalls--) /* tail calls */\r\n      luaD_callhook(L, LUA_HOOKTAILRET, -1);\r\n  }\r\n  return restorestack(L, fr);\r\n}\r\n\r\n\r\nint luaD_poscall (lua_State *L, StkId firstResult) {\r\n  StkId res;\r\n  int wanted, i;\r\n  CallInfo *ci;\r\n  if (L->hookmask & LUA_MASKRET)\r\n    firstResult = callrethooks(L, firstResult);\r\n  ci = L->ci--;\r\n  res = ci->func;  /* res == final position of 1st result */\r\n  wanted = ci->nresults;\r\n  L->base = (ci - 1)->base;  /* restore base */\r\n  L->savedpc = (ci - 1)->savedpc;  /* restore savedpc */\r\n  /* move results to correct place */\r\n  for (i = wanted; i != 0 && firstResult < L->top; i--)\r\n    setobjs2s(L, res++, firstResult++);\r\n  while (i-- > 0)\r\n    setnilvalue(res++);\r\n  L->top = res;\r\n  return (wanted - LUA_MULTRET);  /* 0 iff wanted == LUA_MULTRET */\r\n}\r\n\r\n\r\n/*\r\n** Call a function (C or Lua). The function to be called is at *func.\r\n** The arguments are on the stack, right after the function.\r\n** When returns, all the results are on the stack, starting at the original\r\n** function position.\r\n*/ \r\nvoid luaD_call (lua_State *L, StkId func, int nResults) {\r\n  if (++L->nCcalls >= LUAI_MAXCCALLS) {\r\n    if (L->nCcalls == LUAI_MAXCCALLS)\r\n      luaG_runerror(L, \"C stack overflow\");\r\n    else if (L->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3)))\r\n      luaD_throw(L, LUA_ERRERR);  /* error while handing stack error */\r\n  }\r\n  if (luaD_precall(L, func, nResults) == PCRLUA)  /* is a Lua function? */\r\n    luaV_execute(L, 1);  /* call it */\r\n  L->nCcalls--;\r\n  luaC_checkGC(L);\r\n}\r\n\r\n\r\nstatic void resume (lua_State *L, void *ud) {\r\n  StkId firstArg = cast(StkId, ud);\r\n  CallInfo *ci = L->ci;\r\n  if (L->status == 0) {  /* start coroutine? */\r\n    lua_assert(ci == L->base_ci && firstArg > L->base);\r\n    if (luaD_precall(L, firstArg - 1, LUA_MULTRET) != PCRLUA)\r\n      return;\r\n  }\r\n  else {  /* resuming from previous yield */\r\n    lua_assert(L->status == LUA_YIELD);\r\n    L->status = 0;\r\n    if (!f_isLua(ci)) {  /* `common' yield? */\r\n      /* finish interrupted execution of `OP_CALL' */\r\n      lua_assert(GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_CALL ||\r\n                 GET_OPCODE(*((ci-1)->savedpc - 1)) == OP_TAILCALL);\r\n      if (luaD_poscall(L, firstArg))  /* complete it... */\r\n        L->top = L->ci->top;  /* and correct top if not multiple results */\r\n    }\r\n    else  /* yielded inside a hook: just continue its execution */\r\n      L->base = L->ci->base;\r\n  }\r\n  luaV_execute(L, cast_int(L->ci - L->base_ci));\r\n}\r\n\r\n\r\nstatic int resume_error (lua_State *L, const char *msg) {\r\n  L->top = L->ci->base;\r\n  setsvalue2s(L, L->top, luaS_new(L, msg));\r\n  incr_top(L);\r\n  lua_unlock(L);\r\n  return LUA_ERRRUN;\r\n}\r\n\r\n\r\nLUA_API int lua_resume (lua_State *L, int nargs) {\r\n  int status;\r\n  lua_lock(L);\r\n  if (L->status != LUA_YIELD && (L->status != 0 || L->ci != L->base_ci))\r\n      return resume_error(L, \"cannot resume non-suspended coroutine\");\r\n  if (L->nCcalls >= LUAI_MAXCCALLS)\r\n    return resume_error(L, \"C stack overflow\");\r\n  luai_userstateresume(L, nargs);\r\n  lua_assert(L->errfunc == 0);\r\n  L->baseCcalls = ++L->nCcalls;\r\n  status = luaD_rawrunprotected(L, resume, L->top - nargs);\r\n  if (status != 0) {  /* error? */\r\n    L->status = cast_byte(status);  /* mark thread as `dead' */\r\n    luaD_seterrorobj(L, status, L->top);\r\n    L->ci->top = L->top;\r\n  }\r\n  else {\r\n    lua_assert(L->nCcalls == L->baseCcalls);\r\n    status = L->status;\r\n  }\r\n  --L->nCcalls;\r\n  lua_unlock(L);\r\n  return status;\r\n}\r\n\r\n\r\nLUA_API int lua_yield (lua_State *L, int nresults) {\r\n  luai_userstateyield(L, nresults);\r\n  lua_lock(L);\r\n  if (L->nCcalls > L->baseCcalls)\r\n    luaG_runerror(L, \"attempt to yield across metamethod/C-call boundary\");\r\n  L->base = L->top - nresults;  /* protect stack slots below */\r\n  L->status = LUA_YIELD;\r\n  lua_unlock(L);\r\n  return -1;\r\n}\r\n\r\n\r\nint luaD_pcall (lua_State *L, Pfunc func, void *u,\r\n                ptrdiff_t old_top, ptrdiff_t ef) {\r\n  int status;\r\n  unsigned short oldnCcalls = L->nCcalls;\r\n  ptrdiff_t old_ci = saveci(L, L->ci);\r\n  lu_byte old_allowhooks = L->allowhook;\r\n  ptrdiff_t old_errfunc = L->errfunc;\r\n  L->errfunc = ef;\r\n  status = luaD_rawrunprotected(L, func, u);\r\n  if (status != 0) {  /* an error occurred? */\r\n    StkId oldtop = restorestack(L, old_top);\r\n    luaF_close(L, oldtop);  /* close eventual pending closures */\r\n    luaD_seterrorobj(L, status, oldtop);\r\n    L->nCcalls = oldnCcalls;\r\n    L->ci = restoreci(L, old_ci);\r\n    L->base = L->ci->base;\r\n    L->savedpc = L->ci->savedpc;\r\n    L->allowhook = old_allowhooks;\r\n    restore_stack_limit(L);\r\n  }\r\n  L->errfunc = old_errfunc;\r\n  return status;\r\n}\r\n\r\n\r\n\r\n/*\r\n** Execute a protected parser.\r\n*/\r\nstruct SParser {  /* data to `f_parser' */\r\n  ZIO *z;\r\n  Mbuffer buff;  /* buffer to be used by the scanner */\r\n  const char *name;\r\n};\r\n\r\nstatic void f_parser (lua_State *L, void *ud) {\r\n  int i;\r\n  Proto *tf;\r\n  Closure *cl;\r\n  struct SParser *p = cast(struct SParser *, ud);\r\n  int c = luaZ_lookahead(p->z);\r\n  luaC_checkGC(L);\r\n  tf = ((c == LUA_SIGNATURE[0]) ? luaU_undump : luaY_parser)(L, p->z,\r\n                                                             &p->buff, p->name);\r\n  cl = luaF_newLclosure(L, tf->nups, hvalue(gt(L)));\r\n  cl->l.p = tf;\r\n  for (i = 0; i < tf->nups; i++)  /* initialize eventual upvalues */\r\n    cl->l.upvals[i] = luaF_newupval(L);\r\n  setclvalue(L, L->top, cl);\r\n  incr_top(L);\r\n}\r\n\r\n\r\nint luaD_protectedparser (lua_State *L, ZIO *z, const char *name) {\r\n  struct SParser p;\r\n  int status;\r\n  p.z = z; p.name = name;\r\n  luaZ_initbuffer(L, &p.buff);\r\n  status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc);\r\n  luaZ_freebuffer(L, &p.buff);\r\n  return status;\r\n}\r\n\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldo.h",
    "content": "/*\r\n** $Id: ldo.h,v 2.7.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Stack and Call structure of Lua\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef ldo_h\r\n#define ldo_h\r\n\r\n\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n#define luaD_checkstack(L,n)\t\\\r\n  if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TValue)) \\\r\n    luaD_growstack(L, n); \\\r\n  else condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1));\r\n\r\n\r\n#define incr_top(L) {luaD_checkstack(L,1); L->top++;}\r\n\r\n#define savestack(L,p)\t\t((char *)(p) - (char *)L->stack)\r\n#define restorestack(L,n)\t((TValue *)((char *)L->stack + (n)))\r\n\r\n#define saveci(L,p)\t\t((char *)(p) - (char *)L->base_ci)\r\n#define restoreci(L,n)\t\t((CallInfo *)((char *)L->base_ci + (n)))\r\n\r\n\r\n/* results from luaD_precall */\r\n#define PCRLUA\t\t0\t/* initiated a call to a Lua function */\r\n#define PCRC\t\t1\t/* did a call to a C function */\r\n#define PCRYIELD\t2\t/* C funtion yielded */\r\n\r\n\r\n/* type of protected functions, to be ran by `runprotected' */\r\ntypedef void (*Pfunc) (lua_State *L, void *ud);\r\n\r\nLUAI_FUNC int luaD_protectedparser (lua_State *L, ZIO *z, const char *name);\r\nLUAI_FUNC void luaD_callhook (lua_State *L, int event, int line);\r\nLUAI_FUNC int luaD_precall (lua_State *L, StkId func, int nresults);\r\nLUAI_FUNC void luaD_call (lua_State *L, StkId func, int nResults);\r\nLUAI_FUNC int luaD_pcall (lua_State *L, Pfunc func, void *u,\r\n                                        ptrdiff_t oldtop, ptrdiff_t ef);\r\nLUAI_FUNC int luaD_poscall (lua_State *L, StkId firstResult);\r\nLUAI_FUNC void luaD_reallocCI (lua_State *L, int newsize);\r\nLUAI_FUNC void luaD_reallocstack (lua_State *L, int newsize);\r\nLUAI_FUNC void luaD_growstack (lua_State *L, int n);\r\n\r\nLUAI_FUNC void luaD_throw (lua_State *L, int errcode);\r\nLUAI_FUNC int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud);\r\n\r\nLUAI_FUNC void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop);\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ldump.c",
    "content": "/*\r\n** $Id: ldump.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** save precompiled Lua chunks\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stddef.h>\r\n\r\n#define ldump_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lundump.h\"\r\n\r\ntypedef struct {\r\n lua_State* L;\r\n lua_Writer writer;\r\n void* data;\r\n int strip;\r\n int status;\r\n} DumpState;\r\n\r\n#define DumpMem(b,n,size,D)\tDumpBlock(b,(n)*(size),D)\r\n#define DumpVar(x,D)\t \tDumpMem(&x,1,sizeof(x),D)\r\n\r\nstatic void DumpBlock(const void* b, size_t size, DumpState* D)\r\n{\r\n if (D->status==0)\r\n {\r\n  lua_unlock(D->L);\r\n  D->status=(*D->writer)(D->L,b,size,D->data);\r\n  lua_lock(D->L);\r\n }\r\n}\r\n\r\nstatic void DumpChar(int y, DumpState* D)\r\n{\r\n char x=(char)y;\r\n DumpVar(x,D);\r\n}\r\n\r\nstatic void DumpInt(int x, DumpState* D)\r\n{\r\n DumpVar(x,D);\r\n}\r\n\r\nstatic void DumpNumber(lua_Number x, DumpState* D)\r\n{\r\n DumpVar(x,D);\r\n}\r\n\r\nstatic void DumpVector(const void* b, int n, size_t size, DumpState* D)\r\n{\r\n DumpInt(n,D);\r\n DumpMem(b,n,size,D);\r\n}\r\n\r\nstatic void DumpString(const TString* s, DumpState* D)\r\n{\r\n if (s==NULL || getstr(s)==NULL)\r\n {\r\n  size_t size=0;\r\n  DumpVar(size,D);\r\n }\r\n else\r\n {\r\n  size_t size=s->tsv.len+1;\t\t/* include trailing '\\0' */\r\n  DumpVar(size,D);\r\n  DumpBlock(getstr(s),size,D);\r\n }\r\n}\r\n\r\n#define DumpCode(f,D)\t DumpVector(f->code,f->sizecode,sizeof(Instruction),D)\r\n\r\nstatic void DumpFunction(const Proto* f, const TString* p, DumpState* D);\r\n\r\nstatic void DumpConstants(const Proto* f, DumpState* D)\r\n{\r\n int i,n=f->sizek;\r\n DumpInt(n,D);\r\n for (i=0; i<n; i++)\r\n {\r\n  const TValue* o=&f->k[i];\r\n  DumpChar(ttype(o),D);\r\n  switch (ttype(o))\r\n  {\r\n   case LUA_TNIL:\r\n\tbreak;\r\n   case LUA_TBOOLEAN:\r\n\tDumpChar(bvalue(o),D);\r\n\tbreak;\r\n   case LUA_TNUMBER:\r\n\tDumpNumber(nvalue(o),D);\r\n\tbreak;\r\n   case LUA_TSTRING:\r\n\tDumpString(rawtsvalue(o),D);\r\n\tbreak;\r\n   default:\r\n\tlua_assert(0);\t\t\t/* cannot happen */\r\n\tbreak;\r\n  }\r\n }\r\n n=f->sizep;\r\n DumpInt(n,D);\r\n for (i=0; i<n; i++) DumpFunction(f->p[i],f->source,D);\r\n}\r\n\r\nstatic void DumpDebug(const Proto* f, DumpState* D)\r\n{\r\n int i,n;\r\n n= (D->strip) ? 0 : f->sizelineinfo;\r\n DumpVector(f->lineinfo,n,sizeof(int),D);\r\n n= (D->strip) ? 0 : f->sizelocvars;\r\n DumpInt(n,D);\r\n for (i=0; i<n; i++)\r\n {\r\n  DumpString(f->locvars[i].varname,D);\r\n  DumpInt(f->locvars[i].startpc,D);\r\n  DumpInt(f->locvars[i].endpc,D);\r\n }\r\n n= (D->strip) ? 0 : f->sizeupvalues;\r\n DumpInt(n,D);\r\n for (i=0; i<n; i++) DumpString(f->upvalues[i],D);\r\n}\r\n\r\nstatic void DumpFunction(const Proto* f, const TString* p, DumpState* D)\r\n{\r\n DumpString((f->source==p || D->strip) ? NULL : f->source,D);\r\n DumpInt(f->linedefined,D);\r\n DumpInt(f->lastlinedefined,D);\r\n DumpChar(f->nups,D);\r\n DumpChar(f->numparams,D);\r\n DumpChar(f->is_vararg,D);\r\n DumpChar(f->maxstacksize,D);\r\n DumpCode(f,D);\r\n DumpConstants(f,D);\r\n DumpDebug(f,D);\r\n}\r\n\r\nstatic void DumpHeader(DumpState* D)\r\n{\r\n char h[LUAC_HEADERSIZE];\r\n luaU_header(h);\r\n DumpBlock(h,LUAC_HEADERSIZE,D);\r\n}\r\n\r\n/*\r\n** dump Lua function as precompiled chunk\r\n*/\r\nint luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip)\r\n{\r\n DumpState D;\r\n D.L=L;\r\n D.writer=w;\r\n D.data=data;\r\n D.strip=strip;\r\n D.status=0;\r\n DumpHeader(&D);\r\n DumpFunction(f,NULL,&D);\r\n return D.status;\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lfunc.c",
    "content": "/*\r\n** $Id: lfunc.c,v 2.12.1.2 2007/12/28 14:58:43 roberto Exp $\r\n** Auxiliary functions to manipulate prototypes and closures\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stddef.h>\r\n\r\n#define lfunc_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n\r\n\r\n\r\nClosure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {\r\n  Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));\r\n  luaC_link(L, obj2gco(c), LUA_TFUNCTION);\r\n  c->c.isC = 1;\r\n  c->c.env = e;\r\n  c->c.nupvalues = cast_byte(nelems);\r\n  return c;\r\n}\r\n\r\n\r\nClosure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {\r\n  Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));\r\n  luaC_link(L, obj2gco(c), LUA_TFUNCTION);\r\n  c->l.isC = 0;\r\n  c->l.env = e;\r\n  c->l.nupvalues = cast_byte(nelems);\r\n  while (nelems--) c->l.upvals[nelems] = NULL;\r\n  return c;\r\n}\r\n\r\n\r\nUpVal *luaF_newupval (lua_State *L) {\r\n  UpVal *uv = luaM_new(L, UpVal);\r\n  luaC_link(L, obj2gco(uv), LUA_TUPVAL);\r\n  uv->v = &uv->u.value;\r\n  setnilvalue(uv->v);\r\n  return uv;\r\n}\r\n\r\n\r\nUpVal *luaF_findupval (lua_State *L, StkId level) {\r\n  global_State *g = G(L);\r\n  GCObject **pp = &L->openupval;\r\n  UpVal *p;\r\n  UpVal *uv;\r\n  while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) {\r\n    lua_assert(p->v != &p->u.value);\r\n    if (p->v == level) {  /* found a corresponding upvalue? */\r\n      if (isdead(g, obj2gco(p)))  /* is it dead? */\r\n        changewhite(obj2gco(p));  /* ressurect it */\r\n      return p;\r\n    }\r\n    pp = &p->next;\r\n  }\r\n  uv = luaM_new(L, UpVal);  /* not found: create a new one */\r\n  uv->tt = LUA_TUPVAL;\r\n  uv->marked = luaC_white(g);\r\n  uv->v = level;  /* current value lives in the stack */\r\n  uv->next = *pp;  /* chain it in the proper position */\r\n  *pp = obj2gco(uv);\r\n  uv->u.l.prev = &g->uvhead;  /* double link it in `uvhead' list */\r\n  uv->u.l.next = g->uvhead.u.l.next;\r\n  uv->u.l.next->u.l.prev = uv;\r\n  g->uvhead.u.l.next = uv;\r\n  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);\r\n  return uv;\r\n}\r\n\r\n\r\nstatic void unlinkupval (UpVal *uv) {\r\n  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);\r\n  uv->u.l.next->u.l.prev = uv->u.l.prev;  /* remove from `uvhead' list */\r\n  uv->u.l.prev->u.l.next = uv->u.l.next;\r\n}\r\n\r\n\r\nvoid luaF_freeupval (lua_State *L, UpVal *uv) {\r\n  if (uv->v != &uv->u.value)  /* is it open? */\r\n    unlinkupval(uv);  /* remove from open list */\r\n  luaM_free(L, uv);  /* free upvalue */\r\n}\r\n\r\n\r\nvoid luaF_close (lua_State *L, StkId level) {\r\n  UpVal *uv;\r\n  global_State *g = G(L);\r\n  while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) {\r\n    GCObject *o = obj2gco(uv);\r\n    lua_assert(!isblack(o) && uv->v != &uv->u.value);\r\n    L->openupval = uv->next;  /* remove from `open' list */\r\n    if (isdead(g, o))\r\n      luaF_freeupval(L, uv);  /* free upvalue */\r\n    else {\r\n      unlinkupval(uv);\r\n      setobj(L, &uv->u.value, uv->v);\r\n      uv->v = &uv->u.value;  /* now current value lives here */\r\n      luaC_linkupval(L, uv);  /* link upvalue into `gcroot' list */\r\n    }\r\n  }\r\n}\r\n\r\n\r\nProto *luaF_newproto (lua_State *L) {\r\n  Proto *f = luaM_new(L, Proto);\r\n  luaC_link(L, obj2gco(f), LUA_TPROTO);\r\n  f->k = NULL;\r\n  f->sizek = 0;\r\n  f->p = NULL;\r\n  f->sizep = 0;\r\n  f->code = NULL;\r\n  f->sizecode = 0;\r\n  f->sizelineinfo = 0;\r\n  f->sizeupvalues = 0;\r\n  f->nups = 0;\r\n  f->upvalues = NULL;\r\n  f->numparams = 0;\r\n  f->is_vararg = 0;\r\n  f->maxstacksize = 0;\r\n  f->lineinfo = NULL;\r\n  f->sizelocvars = 0;\r\n  f->locvars = NULL;\r\n  f->linedefined = 0;\r\n  f->lastlinedefined = 0;\r\n  f->source = NULL;\r\n  return f;\r\n}\r\n\r\n\r\nvoid luaF_freeproto (lua_State *L, Proto *f) {\r\n  luaM_freearray(L, f->code, f->sizecode, Instruction);\r\n  luaM_freearray(L, f->p, f->sizep, Proto *);\r\n  luaM_freearray(L, f->k, f->sizek, TValue);\r\n  luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);\r\n  luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);\r\n  luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);\r\n  luaM_free(L, f);\r\n}\r\n\r\n\r\nvoid luaF_freeclosure (lua_State *L, Closure *c) {\r\n  int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :\r\n                          sizeLclosure(c->l.nupvalues);\r\n  luaM_freemem(L, c, size);\r\n}\r\n\r\n\r\n/*\r\n** Look for n-th local variable at line `line' in function `func'.\r\n** Returns NULL if not found.\r\n*/\r\nconst char *luaF_getlocalname (const Proto *f, int local_number, int pc) {\r\n  int i;\r\n  for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {\r\n    if (pc < f->locvars[i].endpc) {  /* is variable active? */\r\n      local_number--;\r\n      if (local_number == 0)\r\n        return getstr(f->locvars[i].varname);\r\n    }\r\n  }\r\n  return NULL;  /* not found */\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lfunc.h",
    "content": "/*\r\n** $Id: lfunc.h,v 2.4.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions to manipulate prototypes and closures\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lfunc_h\r\n#define lfunc_h\r\n\r\n\r\n#include \"lobject.h\"\r\n\r\n\r\n#define sizeCclosure(n)\t(cast(int, sizeof(CClosure)) + \\\r\n                         cast(int, sizeof(TValue)*((n)-1)))\r\n\r\n#define sizeLclosure(n)\t(cast(int, sizeof(LClosure)) + \\\r\n                         cast(int, sizeof(TValue *)*((n)-1)))\r\n\r\n\r\nLUAI_FUNC Proto *luaF_newproto (lua_State *L);\r\nLUAI_FUNC Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e);\r\nLUAI_FUNC Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e);\r\nLUAI_FUNC UpVal *luaF_newupval (lua_State *L);\r\nLUAI_FUNC UpVal *luaF_findupval (lua_State *L, StkId level);\r\nLUAI_FUNC void luaF_close (lua_State *L, StkId level);\r\nLUAI_FUNC void luaF_freeproto (lua_State *L, Proto *f);\r\nLUAI_FUNC void luaF_freeclosure (lua_State *L, Closure *c);\r\nLUAI_FUNC void luaF_freeupval (lua_State *L, UpVal *uv);\r\nLUAI_FUNC const char *luaF_getlocalname (const Proto *func, int local_number,\r\n                                         int pc);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lgc.c",
    "content": "/*\r\n** $Id: lgc.c,v 2.38.1.2 2011/03/18 18:05:38 roberto Exp $\r\n** Garbage Collector\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <string.h>\r\n\r\n#define lgc_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n\r\n\r\n#define GCSTEPSIZE\t1024u\r\n#define GCSWEEPMAX\t40\r\n#define GCSWEEPCOST\t10\r\n#define GCFINALIZECOST\t100\r\n\r\n\r\n#define maskmarks\tcast_byte(~(bitmask(BLACKBIT)|WHITEBITS))\r\n\r\n#define makewhite(g,x)\t\\\r\n   ((x)->gch.marked = cast_byte(((x)->gch.marked & maskmarks) | luaC_white(g)))\r\n\r\n#define white2gray(x)\treset2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)\r\n#define black2gray(x)\tresetbit((x)->gch.marked, BLACKBIT)\r\n\r\n#define stringmark(s)\treset2bits((s)->tsv.marked, WHITE0BIT, WHITE1BIT)\r\n\r\n\r\n#define isfinalized(u)\t\ttestbit((u)->marked, FINALIZEDBIT)\r\n#define markfinalized(u)\tl_setbit((u)->marked, FINALIZEDBIT)\r\n\r\n\r\n#define KEYWEAK         bitmask(KEYWEAKBIT)\r\n#define VALUEWEAK       bitmask(VALUEWEAKBIT)\r\n\r\n\r\n\r\n#define markvalue(g,o) { checkconsistency(o); \\\r\n  if (iscollectable(o) && iswhite(gcvalue(o))) reallymarkobject(g,gcvalue(o)); }\r\n\r\n#define markobject(g,t) { if (iswhite(obj2gco(t))) \\\r\n\t\treallymarkobject(g, obj2gco(t)); }\r\n\r\n\r\n#define setthreshold(g)  (g->GCthreshold = (g->estimate/100) * g->gcpause)\r\n\r\n\r\nstatic void removeentry (Node *n) {\r\n  lua_assert(ttisnil(gval(n)));\r\n  if (iscollectable(gkey(n)))\r\n    setttype(gkey(n), LUA_TDEADKEY);  /* dead key; remove it */\r\n}\r\n\r\n\r\nstatic void reallymarkobject (global_State *g, GCObject *o) {\r\n  lua_assert(iswhite(o) && !isdead(g, o));\r\n  white2gray(o);\r\n  switch (o->gch.tt) {\r\n    case LUA_TSTRING: {\r\n      return;\r\n    }\r\n    case LUA_TUSERDATA: {\r\n      Table *mt = gco2u(o)->metatable;\r\n      gray2black(o);  /* udata are never gray */\r\n      if (mt) markobject(g, mt);\r\n      markobject(g, gco2u(o)->env);\r\n      return;\r\n    }\r\n    case LUA_TUPVAL: {\r\n      UpVal *uv = gco2uv(o);\r\n      markvalue(g, uv->v);\r\n      if (uv->v == &uv->u.value)  /* closed? */\r\n        gray2black(o);  /* open upvalues are never black */\r\n      return;\r\n    }\r\n    case LUA_TFUNCTION: {\r\n      gco2cl(o)->c.gclist = g->gray;\r\n      g->gray = o;\r\n      break;\r\n    }\r\n    case LUA_TTABLE: {\r\n      gco2h(o)->gclist = g->gray;\r\n      g->gray = o;\r\n      break;\r\n    }\r\n    case LUA_TTHREAD: {\r\n      gco2th(o)->gclist = g->gray;\r\n      g->gray = o;\r\n      break;\r\n    }\r\n    case LUA_TPROTO: {\r\n      gco2p(o)->gclist = g->gray;\r\n      g->gray = o;\r\n      break;\r\n    }\r\n    default: lua_assert(0);\r\n  }\r\n}\r\n\r\n\r\nstatic void marktmu (global_State *g) {\r\n  GCObject *u = g->tmudata;\r\n  if (u) {\r\n    do {\r\n      u = u->gch.next;\r\n      makewhite(g, u);  /* may be marked, if left from previous GC */\r\n      reallymarkobject(g, u);\r\n    } while (u != g->tmudata);\r\n  }\r\n}\r\n\r\n\r\n/* move `dead' udata that need finalization to list `tmudata' */\r\nsize_t luaC_separateudata (lua_State *L, int all) {\r\n  global_State *g = G(L);\r\n  size_t deadmem = 0;\r\n  GCObject **p = &g->mainthread->next;\r\n  GCObject *curr;\r\n  while ((curr = *p) != NULL) {\r\n    if (!(iswhite(curr) || all) || isfinalized(gco2u(curr)))\r\n      p = &curr->gch.next;  /* don't bother with them */\r\n    else if (fasttm(L, gco2u(curr)->metatable, TM_GC) == NULL) {\r\n      markfinalized(gco2u(curr));  /* don't need finalization */\r\n      p = &curr->gch.next;\r\n    }\r\n    else {  /* must call its gc method */\r\n      deadmem += sizeudata(gco2u(curr));\r\n      markfinalized(gco2u(curr));\r\n      *p = curr->gch.next;\r\n      /* link `curr' at the end of `tmudata' list */\r\n      if (g->tmudata == NULL)  /* list is empty? */\r\n        g->tmudata = curr->gch.next = curr;  /* creates a circular list */\r\n      else {\r\n        curr->gch.next = g->tmudata->gch.next;\r\n        g->tmudata->gch.next = curr;\r\n        g->tmudata = curr;\r\n      }\r\n    }\r\n  }\r\n  return deadmem;\r\n}\r\n\r\n\r\nstatic int traversetable (global_State *g, Table *h) {\r\n  int i;\r\n  int weakkey = 0;\r\n  int weakvalue = 0;\r\n  const TValue *mode;\r\n  if (h->metatable)\r\n    markobject(g, h->metatable);\r\n  mode = gfasttm(g, h->metatable, TM_MODE);\r\n  if (mode && ttisstring(mode)) {  /* is there a weak mode? */\r\n    weakkey = (strchr(svalue(mode), 'k') != NULL);\r\n    weakvalue = (strchr(svalue(mode), 'v') != NULL);\r\n    if (weakkey || weakvalue) {  /* is really weak? */\r\n      h->marked &= ~(KEYWEAK | VALUEWEAK);  /* clear bits */\r\n      h->marked |= cast_byte((weakkey << KEYWEAKBIT) |\r\n                             (weakvalue << VALUEWEAKBIT));\r\n      h->gclist = g->weak;  /* must be cleared after GC, ... */\r\n      g->weak = obj2gco(h);  /* ... so put in the appropriate list */\r\n    }\r\n  }\r\n  if (weakkey && weakvalue) return 1;\r\n  if (!weakvalue) {\r\n    i = h->sizearray;\r\n    while (i--)\r\n      markvalue(g, &h->array[i]);\r\n  }\r\n  i = sizenode(h);\r\n  while (i--) {\r\n    Node *n = gnode(h, i);\r\n    lua_assert(ttype(gkey(n)) != LUA_TDEADKEY || ttisnil(gval(n)));\r\n    if (ttisnil(gval(n)))\r\n      removeentry(n);  /* remove empty entries */\r\n    else {\r\n      lua_assert(!ttisnil(gkey(n)));\r\n      if (!weakkey) markvalue(g, gkey(n));\r\n      if (!weakvalue) markvalue(g, gval(n));\r\n    }\r\n  }\r\n  return weakkey || weakvalue;\r\n}\r\n\r\n\r\n/*\r\n** All marks are conditional because a GC may happen while the\r\n** prototype is still being created\r\n*/\r\nstatic void traverseproto (global_State *g, Proto *f) {\r\n  int i;\r\n  if (f->source) stringmark(f->source);\r\n  for (i=0; i<f->sizek; i++)  /* mark literals */\r\n    markvalue(g, &f->k[i]);\r\n  for (i=0; i<f->sizeupvalues; i++) {  /* mark upvalue names */\r\n    if (f->upvalues[i])\r\n      stringmark(f->upvalues[i]);\r\n  }\r\n  for (i=0; i<f->sizep; i++) {  /* mark nested protos */\r\n    if (f->p[i])\r\n      markobject(g, f->p[i]);\r\n  }\r\n  for (i=0; i<f->sizelocvars; i++) {  /* mark local-variable names */\r\n    if (f->locvars[i].varname)\r\n      stringmark(f->locvars[i].varname);\r\n  }\r\n}\r\n\r\n\r\n\r\nstatic void traverseclosure (global_State *g, Closure *cl) {\r\n  markobject(g, cl->c.env);\r\n  if (cl->c.isC) {\r\n    int i;\r\n    for (i=0; i<cl->c.nupvalues; i++)  /* mark its upvalues */\r\n      markvalue(g, &cl->c.upvalue[i]);\r\n  }\r\n  else {\r\n    int i;\r\n    lua_assert(cl->l.nupvalues == cl->l.p->nups);\r\n    markobject(g, cl->l.p);\r\n    for (i=0; i<cl->l.nupvalues; i++)  /* mark its upvalues */\r\n      markobject(g, cl->l.upvals[i]);\r\n  }\r\n}\r\n\r\n\r\nstatic void checkstacksizes (lua_State *L, StkId max) {\r\n  int ci_used = cast_int(L->ci - L->base_ci);  /* number of `ci' in use */\r\n  int s_used = cast_int(max - L->stack);  /* part of stack in use */\r\n  if (L->size_ci > LUAI_MAXCALLS)  /* handling overflow? */\r\n    return;  /* do not touch the stacks */\r\n  if (4*ci_used < L->size_ci && 2*BASIC_CI_SIZE < L->size_ci)\r\n    luaD_reallocCI(L, L->size_ci/2);  /* still big enough... */\r\n  condhardstacktests(luaD_reallocCI(L, ci_used + 1));\r\n  if (4*s_used < L->stacksize &&\r\n      2*(BASIC_STACK_SIZE+EXTRA_STACK) < L->stacksize)\r\n    luaD_reallocstack(L, L->stacksize/2);  /* still big enough... */\r\n  condhardstacktests(luaD_reallocstack(L, s_used));\r\n}\r\n\r\n\r\nstatic void traversestack (global_State *g, lua_State *l) {\r\n  StkId o, lim;\r\n  CallInfo *ci;\r\n  markvalue(g, gt(l));\r\n  lim = l->top;\r\n  for (ci = l->base_ci; ci <= l->ci; ci++) {\r\n    lua_assert(ci->top <= l->stack_last);\r\n    if (lim < ci->top) lim = ci->top;\r\n  }\r\n  for (o = l->stack; o < l->top; o++)\r\n    markvalue(g, o);\r\n  for (; o <= lim; o++)\r\n    setnilvalue(o);\r\n  checkstacksizes(l, lim);\r\n}\r\n\r\n\r\n/*\r\n** traverse one gray object, turning it to black.\r\n** Returns `quantity' traversed.\r\n*/\r\nstatic l_mem propagatemark (global_State *g) {\r\n  GCObject *o = g->gray;\r\n  lua_assert(isgray(o));\r\n  gray2black(o);\r\n  switch (o->gch.tt) {\r\n    case LUA_TTABLE: {\r\n      Table *h = gco2h(o);\r\n      g->gray = h->gclist;\r\n      if (traversetable(g, h))  /* table is weak? */\r\n        black2gray(o);  /* keep it gray */\r\n      return sizeof(Table) + sizeof(TValue) * h->sizearray +\r\n                             sizeof(Node) * sizenode(h);\r\n    }\r\n    case LUA_TFUNCTION: {\r\n      Closure *cl = gco2cl(o);\r\n      g->gray = cl->c.gclist;\r\n      traverseclosure(g, cl);\r\n      return (cl->c.isC) ? sizeCclosure(cl->c.nupvalues) :\r\n                           sizeLclosure(cl->l.nupvalues);\r\n    }\r\n    case LUA_TTHREAD: {\r\n      lua_State *th = gco2th(o);\r\n      g->gray = th->gclist;\r\n      th->gclist = g->grayagain;\r\n      g->grayagain = o;\r\n      black2gray(o);\r\n      traversestack(g, th);\r\n      return sizeof(lua_State) + sizeof(TValue) * th->stacksize +\r\n                                 sizeof(CallInfo) * th->size_ci;\r\n    }\r\n    case LUA_TPROTO: {\r\n      Proto *p = gco2p(o);\r\n      g->gray = p->gclist;\r\n      traverseproto(g, p);\r\n      return sizeof(Proto) + sizeof(Instruction) * p->sizecode +\r\n                             sizeof(Proto *) * p->sizep +\r\n                             sizeof(TValue) * p->sizek + \r\n                             sizeof(int) * p->sizelineinfo +\r\n                             sizeof(LocVar) * p->sizelocvars +\r\n                             sizeof(TString *) * p->sizeupvalues;\r\n    }\r\n    default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n\r\nstatic size_t propagateall (global_State *g) {\r\n  size_t m = 0;\r\n  while (g->gray) m += propagatemark(g);\r\n  return m;\r\n}\r\n\r\n\r\n/*\r\n** The next function tells whether a key or value can be cleared from\r\n** a weak table. Non-collectable objects are never removed from weak\r\n** tables. Strings behave as `values', so are never removed too. for\r\n** other objects: if really collected, cannot keep them; for userdata\r\n** being finalized, keep them in keys, but not in values\r\n*/\r\nstatic int iscleared (const TValue *o, int iskey) {\r\n  if (!iscollectable(o)) return 0;\r\n  if (ttisstring(o)) {\r\n    stringmark(rawtsvalue(o));  /* strings are `values', so are never weak */\r\n    return 0;\r\n  }\r\n  return iswhite(gcvalue(o)) ||\r\n    (ttisuserdata(o) && (!iskey && isfinalized(uvalue(o))));\r\n}\r\n\r\n\r\n/*\r\n** clear collected entries from weaktables\r\n*/\r\nstatic void cleartable (GCObject *l) {\r\n  while (l) {\r\n    Table *h = gco2h(l);\r\n    int i = h->sizearray;\r\n    lua_assert(testbit(h->marked, VALUEWEAKBIT) ||\r\n               testbit(h->marked, KEYWEAKBIT));\r\n    if (testbit(h->marked, VALUEWEAKBIT)) {\r\n      while (i--) {\r\n        TValue *o = &h->array[i];\r\n        if (iscleared(o, 0))  /* value was collected? */\r\n          setnilvalue(o);  /* remove value */\r\n      }\r\n    }\r\n    i = sizenode(h);\r\n    while (i--) {\r\n      Node *n = gnode(h, i);\r\n      if (!ttisnil(gval(n)) &&  /* non-empty entry? */\r\n          (iscleared(key2tval(n), 1) || iscleared(gval(n), 0))) {\r\n        setnilvalue(gval(n));  /* remove value ... */\r\n        removeentry(n);  /* remove entry from table */\r\n      }\r\n    }\r\n    l = h->gclist;\r\n  }\r\n}\r\n\r\n\r\nstatic void freeobj (lua_State *L, GCObject *o) {\r\n  switch (o->gch.tt) {\r\n    case LUA_TPROTO: luaF_freeproto(L, gco2p(o)); break;\r\n    case LUA_TFUNCTION: luaF_freeclosure(L, gco2cl(o)); break;\r\n    case LUA_TUPVAL: luaF_freeupval(L, gco2uv(o)); break;\r\n    case LUA_TTABLE: luaH_free(L, gco2h(o)); break;\r\n    case LUA_TTHREAD: {\r\n      lua_assert(gco2th(o) != L && gco2th(o) != G(L)->mainthread);\r\n      luaE_freethread(L, gco2th(o));\r\n      break;\r\n    }\r\n    case LUA_TSTRING: {\r\n      G(L)->strt.nuse--;\r\n      luaM_freemem(L, o, sizestring(gco2ts(o)));\r\n      break;\r\n    }\r\n    case LUA_TUSERDATA: {\r\n      luaM_freemem(L, o, sizeudata(gco2u(o)));\r\n      break;\r\n    }\r\n    default: lua_assert(0);\r\n  }\r\n}\r\n\r\n\r\n\r\n#define sweepwholelist(L,p)\tsweeplist(L,p,MAX_LUMEM)\r\n\r\n\r\nstatic GCObject **sweeplist (lua_State *L, GCObject **p, lu_mem count) {\r\n  GCObject *curr;\r\n  global_State *g = G(L);\r\n  int deadmask = otherwhite(g);\r\n  while ((curr = *p) != NULL && count-- > 0) {\r\n    if (curr->gch.tt == LUA_TTHREAD)  /* sweep open upvalues of each thread */\r\n      sweepwholelist(L, &gco2th(curr)->openupval);\r\n    if ((curr->gch.marked ^ WHITEBITS) & deadmask) {  /* not dead? */\r\n      lua_assert(!isdead(g, curr) || testbit(curr->gch.marked, FIXEDBIT));\r\n      makewhite(g, curr);  /* make it white (for next cycle) */\r\n      p = &curr->gch.next;\r\n    }\r\n    else {  /* must erase `curr' */\r\n      lua_assert(isdead(g, curr) || deadmask == bitmask(SFIXEDBIT));\r\n      *p = curr->gch.next;\r\n      if (curr == g->rootgc)  /* is the first element of the list? */\r\n        g->rootgc = curr->gch.next;  /* adjust first */\r\n      freeobj(L, curr);\r\n    }\r\n  }\r\n  return p;\r\n}\r\n\r\n\r\nstatic void checkSizes (lua_State *L) {\r\n  global_State *g = G(L);\r\n  /* check size of string hash */\r\n  if (g->strt.nuse < cast(lu_int32, g->strt.size/4) &&\r\n      g->strt.size > MINSTRTABSIZE*2)\r\n    luaS_resize(L, g->strt.size/2);  /* table is too big */\r\n  /* check size of buffer */\r\n  if (luaZ_sizebuffer(&g->buff) > LUA_MINBUFFER*2) {  /* buffer too big? */\r\n    size_t newsize = luaZ_sizebuffer(&g->buff) / 2;\r\n    luaZ_resizebuffer(L, &g->buff, newsize);\r\n  }\r\n}\r\n\r\n\r\nstatic void GCTM (lua_State *L) {\r\n  global_State *g = G(L);\r\n  GCObject *o = g->tmudata->gch.next;  /* get first element */\r\n  Udata *udata = rawgco2u(o);\r\n  const TValue *tm;\r\n  /* remove udata from `tmudata' */\r\n  if (o == g->tmudata)  /* last element? */\r\n    g->tmudata = NULL;\r\n  else\r\n    g->tmudata->gch.next = udata->uv.next;\r\n  udata->uv.next = g->mainthread->next;  /* return it to `root' list */\r\n  g->mainthread->next = o;\r\n  makewhite(g, o);\r\n  tm = fasttm(L, udata->uv.metatable, TM_GC);\r\n  if (tm != NULL) {\r\n    lu_byte oldah = L->allowhook;\r\n    lu_mem oldt = g->GCthreshold;\r\n    L->allowhook = 0;  /* stop debug hooks during GC tag method */\r\n    g->GCthreshold = 2*g->totalbytes;  /* avoid GC steps */\r\n    setobj2s(L, L->top, tm);\r\n    setuvalue(L, L->top+1, udata);\r\n    L->top += 2;\r\n    luaD_call(L, L->top - 2, 0);\r\n    L->allowhook = oldah;  /* restore hooks */\r\n    g->GCthreshold = oldt;  /* restore threshold */\r\n  }\r\n}\r\n\r\n\r\n/*\r\n** Call all GC tag methods\r\n*/\r\nvoid luaC_callGCTM (lua_State *L) {\r\n  while (G(L)->tmudata)\r\n    GCTM(L);\r\n}\r\n\r\n\r\nvoid luaC_freeall (lua_State *L) {\r\n  global_State *g = G(L);\r\n  int i;\r\n  g->currentwhite = WHITEBITS | bitmask(SFIXEDBIT);  /* mask to collect all elements */\r\n  sweepwholelist(L, &g->rootgc);\r\n  for (i = 0; i < g->strt.size; i++)  /* free all string lists */\r\n    sweepwholelist(L, &g->strt.hash[i]);\r\n}\r\n\r\n\r\nstatic void markmt (global_State *g) {\r\n  int i;\r\n  for (i=0; i<NUM_TAGS; i++)\r\n    if (g->mt[i]) markobject(g, g->mt[i]);\r\n}\r\n\r\n\r\n/* mark root set */\r\nstatic void markroot (lua_State *L) {\r\n  global_State *g = G(L);\r\n  g->gray = NULL;\r\n  g->grayagain = NULL;\r\n  g->weak = NULL;\r\n  markobject(g, g->mainthread);\r\n  /* make global table be traversed before main stack */\r\n  markvalue(g, gt(g->mainthread));\r\n  markvalue(g, registry(L));\r\n  markmt(g);\r\n  g->gcstate = GCSpropagate;\r\n}\r\n\r\n\r\nstatic void remarkupvals (global_State *g) {\r\n  UpVal *uv;\r\n  for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) {\r\n    lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);\r\n    if (isgray(obj2gco(uv)))\r\n      markvalue(g, uv->v);\r\n  }\r\n}\r\n\r\n\r\nstatic void atomic (lua_State *L) {\r\n  global_State *g = G(L);\r\n  size_t udsize;  /* total size of userdata to be finalized */\r\n  /* remark occasional upvalues of (maybe) dead threads */\r\n  remarkupvals(g);\r\n  /* traverse objects cautch by write barrier and by 'remarkupvals' */\r\n  propagateall(g);\r\n  /* remark weak tables */\r\n  g->gray = g->weak;\r\n  g->weak = NULL;\r\n  lua_assert(!iswhite(obj2gco(g->mainthread)));\r\n  markobject(g, L);  /* mark running thread */\r\n  markmt(g);  /* mark basic metatables (again) */\r\n  propagateall(g);\r\n  /* remark gray again */\r\n  g->gray = g->grayagain;\r\n  g->grayagain = NULL;\r\n  propagateall(g);\r\n  udsize = luaC_separateudata(L, 0);  /* separate userdata to be finalized */\r\n  marktmu(g);  /* mark `preserved' userdata */\r\n  udsize += propagateall(g);  /* remark, to propagate `preserveness' */\r\n  cleartable(g->weak);  /* remove collected objects from weak tables */\r\n  /* flip current white */\r\n  g->currentwhite = cast_byte(otherwhite(g));\r\n  g->sweepstrgc = 0;\r\n  g->sweepgc = &g->rootgc;\r\n  g->gcstate = GCSsweepstring;\r\n  g->estimate = g->totalbytes - udsize;  /* first estimate */\r\n}\r\n\r\n\r\nstatic l_mem singlestep (lua_State *L) {\r\n  global_State *g = G(L);\r\n  /*lua_checkmemory(L);*/\r\n  switch (g->gcstate) {\r\n    case GCSpause: {\r\n      markroot(L);  /* start a new collection */\r\n      return 0;\r\n    }\r\n    case GCSpropagate: {\r\n      if (g->gray)\r\n        return propagatemark(g);\r\n      else {  /* no more `gray' objects */\r\n        atomic(L);  /* finish mark phase */\r\n        return 0;\r\n      }\r\n    }\r\n    case GCSsweepstring: {\r\n      lu_mem old = g->totalbytes;\r\n      sweepwholelist(L, &g->strt.hash[g->sweepstrgc++]);\r\n      if (g->sweepstrgc >= g->strt.size)  /* nothing more to sweep? */\r\n        g->gcstate = GCSsweep;  /* end sweep-string phase */\r\n      lua_assert(old >= g->totalbytes);\r\n      g->estimate -= old - g->totalbytes;\r\n      return GCSWEEPCOST;\r\n    }\r\n    case GCSsweep: {\r\n      lu_mem old = g->totalbytes;\r\n      g->sweepgc = sweeplist(L, g->sweepgc, GCSWEEPMAX);\r\n      if (*g->sweepgc == NULL) {  /* nothing more to sweep? */\r\n        checkSizes(L);\r\n        g->gcstate = GCSfinalize;  /* end sweep phase */\r\n      }\r\n      lua_assert(old >= g->totalbytes);\r\n      g->estimate -= old - g->totalbytes;\r\n      return GCSWEEPMAX*GCSWEEPCOST;\r\n    }\r\n    case GCSfinalize: {\r\n      if (g->tmudata) {\r\n        GCTM(L);\r\n        if (g->estimate > GCFINALIZECOST)\r\n          g->estimate -= GCFINALIZECOST;\r\n        return GCFINALIZECOST;\r\n      }\r\n      else {\r\n        g->gcstate = GCSpause;  /* end collection */\r\n        g->gcdept = 0;\r\n        return 0;\r\n      }\r\n    }\r\n    default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n\r\nvoid luaC_step (lua_State *L) {\r\n  global_State *g = G(L);\r\n  l_mem lim = (GCSTEPSIZE/100) * g->gcstepmul;\r\n  if (lim == 0)\r\n    lim = (MAX_LUMEM-1)/2;  /* no limit */\r\n  g->gcdept += g->totalbytes - g->GCthreshold;\r\n  do {\r\n    lim -= singlestep(L);\r\n    if (g->gcstate == GCSpause)\r\n      break;\r\n  } while (lim > 0);\r\n  if (g->gcstate != GCSpause) {\r\n    if (g->gcdept < GCSTEPSIZE)\r\n      g->GCthreshold = g->totalbytes + GCSTEPSIZE;  /* - lim/g->gcstepmul;*/\r\n    else {\r\n      g->gcdept -= GCSTEPSIZE;\r\n      g->GCthreshold = g->totalbytes;\r\n    }\r\n  }\r\n  else {\r\n    setthreshold(g);\r\n  }\r\n}\r\n\r\n\r\nvoid luaC_fullgc (lua_State *L) {\r\n  global_State *g = G(L);\r\n  if (g->gcstate <= GCSpropagate) {\r\n    /* reset sweep marks to sweep all elements (returning them to white) */\r\n    g->sweepstrgc = 0;\r\n    g->sweepgc = &g->rootgc;\r\n    /* reset other collector lists */\r\n    g->gray = NULL;\r\n    g->grayagain = NULL;\r\n    g->weak = NULL;\r\n    g->gcstate = GCSsweepstring;\r\n  }\r\n  lua_assert(g->gcstate != GCSpause && g->gcstate != GCSpropagate);\r\n  /* finish any pending sweep phase */\r\n  while (g->gcstate != GCSfinalize) {\r\n    lua_assert(g->gcstate == GCSsweepstring || g->gcstate == GCSsweep);\r\n    singlestep(L);\r\n  }\r\n  markroot(L);\r\n  while (g->gcstate != GCSpause) {\r\n    singlestep(L);\r\n  }\r\n  setthreshold(g);\r\n}\r\n\r\n\r\nvoid luaC_barrierf (lua_State *L, GCObject *o, GCObject *v) {\r\n  global_State *g = G(L);\r\n  lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));\r\n  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);\r\n  lua_assert(ttype(&o->gch) != LUA_TTABLE);\r\n  /* must keep invariant? */\r\n  if (g->gcstate == GCSpropagate)\r\n    reallymarkobject(g, v);  /* restore invariant */\r\n  else  /* don't mind */\r\n    makewhite(g, o);  /* mark as white just to avoid other barriers */\r\n}\r\n\r\n\r\nvoid luaC_barrierback (lua_State *L, Table *t) {\r\n  global_State *g = G(L);\r\n  GCObject *o = obj2gco(t);\r\n  lua_assert(isblack(o) && !isdead(g, o));\r\n  lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);\r\n  black2gray(o);  /* make table gray (again) */\r\n  t->gclist = g->grayagain;\r\n  g->grayagain = o;\r\n}\r\n\r\n\r\nvoid luaC_link (lua_State *L, GCObject *o, lu_byte tt) {\r\n  global_State *g = G(L);\r\n  o->gch.next = g->rootgc;\r\n  g->rootgc = o;\r\n  o->gch.marked = luaC_white(g);\r\n  o->gch.tt = tt;\r\n}\r\n\r\n\r\nvoid luaC_linkupval (lua_State *L, UpVal *uv) {\r\n  global_State *g = G(L);\r\n  GCObject *o = obj2gco(uv);\r\n  o->gch.next = g->rootgc;  /* link upvalue into `rootgc' list */\r\n  g->rootgc = o;\r\n  if (isgray(o)) { \r\n    if (g->gcstate == GCSpropagate) {\r\n      gray2black(o);  /* closed upvalues need barrier */\r\n      luaC_barrier(L, uv, uv->v);\r\n    }\r\n    else {  /* sweep phase: sweep it (turning it into white) */\r\n      makewhite(g, o);\r\n      lua_assert(g->gcstate != GCSfinalize && g->gcstate != GCSpause);\r\n    }\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lgc.h",
    "content": "/*\r\n** $Id: lgc.h,v 2.15.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Garbage Collector\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lgc_h\r\n#define lgc_h\r\n\r\n\r\n#include \"lobject.h\"\r\n\r\n\r\n/*\r\n** Possible states of the Garbage Collector\r\n*/\r\n#define GCSpause\t0\r\n#define GCSpropagate\t1\r\n#define GCSsweepstring\t2\r\n#define GCSsweep\t3\r\n#define GCSfinalize\t4\r\n\r\n\r\n/*\r\n** some userful bit tricks\r\n*/\r\n#define resetbits(x,m)\t((x) &= cast(lu_byte, ~(m)))\r\n#define setbits(x,m)\t((x) |= (m))\r\n#define testbits(x,m)\t((x) & (m))\r\n#define bitmask(b)\t(1<<(b))\r\n#define bit2mask(b1,b2)\t(bitmask(b1) | bitmask(b2))\r\n#define l_setbit(x,b)\tsetbits(x, bitmask(b))\r\n#define resetbit(x,b)\tresetbits(x, bitmask(b))\r\n#define testbit(x,b)\ttestbits(x, bitmask(b))\r\n#define set2bits(x,b1,b2)\tsetbits(x, (bit2mask(b1, b2)))\r\n#define reset2bits(x,b1,b2)\tresetbits(x, (bit2mask(b1, b2)))\r\n#define test2bits(x,b1,b2)\ttestbits(x, (bit2mask(b1, b2)))\r\n\r\n\r\n\r\n/*\r\n** Layout for bit use in `marked' field:\r\n** bit 0 - object is white (type 0)\r\n** bit 1 - object is white (type 1)\r\n** bit 2 - object is black\r\n** bit 3 - for userdata: has been finalized\r\n** bit 3 - for tables: has weak keys\r\n** bit 4 - for tables: has weak values\r\n** bit 5 - object is fixed (should not be collected)\r\n** bit 6 - object is \"super\" fixed (only the main thread)\r\n*/\r\n\r\n\r\n#define WHITE0BIT\t0\r\n#define WHITE1BIT\t1\r\n#define BLACKBIT\t2\r\n#define FINALIZEDBIT\t3\r\n#define KEYWEAKBIT\t3\r\n#define VALUEWEAKBIT\t4\r\n#define FIXEDBIT\t5\r\n#define SFIXEDBIT\t6\r\n#define WHITEBITS\tbit2mask(WHITE0BIT, WHITE1BIT)\r\n\r\n\r\n#define iswhite(x)      test2bits((x)->gch.marked, WHITE0BIT, WHITE1BIT)\r\n#define isblack(x)      testbit((x)->gch.marked, BLACKBIT)\r\n#define isgray(x)\t(!isblack(x) && !iswhite(x))\r\n\r\n#define otherwhite(g)\t(g->currentwhite ^ WHITEBITS)\r\n#define isdead(g,v)\t((v)->gch.marked & otherwhite(g) & WHITEBITS)\r\n\r\n#define changewhite(x)\t((x)->gch.marked ^= WHITEBITS)\r\n#define gray2black(x)\tl_setbit((x)->gch.marked, BLACKBIT)\r\n\r\n#define valiswhite(x)\t(iscollectable(x) && iswhite(gcvalue(x)))\r\n\r\n#define luaC_white(g)\tcast(lu_byte, (g)->currentwhite & WHITEBITS)\r\n\r\n\r\n#define luaC_checkGC(L) { \\\r\n  condhardstacktests(luaD_reallocstack(L, L->stacksize - EXTRA_STACK - 1)); \\\r\n  if (G(L)->totalbytes >= G(L)->GCthreshold) \\\r\n\tluaC_step(L); }\r\n\r\n\r\n#define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p)))  \\\r\n\tluaC_barrierf(L,obj2gco(p),gcvalue(v)); }\r\n\r\n#define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t)))  \\\r\n\tluaC_barrierback(L,t); }\r\n\r\n#define luaC_objbarrier(L,p,o)  \\\r\n\t{ if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \\\r\n\t\tluaC_barrierf(L,obj2gco(p),obj2gco(o)); }\r\n\r\n#define luaC_objbarriert(L,t,o)  \\\r\n   { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) luaC_barrierback(L,t); }\r\n\r\nLUAI_FUNC size_t luaC_separateudata (lua_State *L, int all);\r\nLUAI_FUNC void luaC_callGCTM (lua_State *L);\r\nLUAI_FUNC void luaC_freeall (lua_State *L);\r\nLUAI_FUNC void luaC_step (lua_State *L);\r\nLUAI_FUNC void luaC_fullgc (lua_State *L);\r\nLUAI_FUNC void luaC_link (lua_State *L, GCObject *o, lu_byte tt);\r\nLUAI_FUNC void luaC_linkupval (lua_State *L, UpVal *uv);\r\nLUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v);\r\nLUAI_FUNC void luaC_barrierback (lua_State *L, Table *t);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/linit.c",
    "content": "/*\r\n** $Id: linit.c,v 1.14.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Initialization of libraries for lua.c\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#define linit_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lualib.h\"\r\n#include \"lauxlib.h\"\r\n\r\n\r\nstatic const luaL_Reg lualibs[] = {\r\n  {\"\", luaopen_base},\r\n  {LUA_LOADLIBNAME, luaopen_package},\r\n  {LUA_TABLIBNAME, luaopen_table},\r\n  {LUA_IOLIBNAME, luaopen_io},\r\n  {LUA_OSLIBNAME, luaopen_os},\r\n  {LUA_STRLIBNAME, luaopen_string},\r\n  {LUA_MATHLIBNAME, luaopen_math},\r\n  {LUA_DBLIBNAME, luaopen_debug},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nLUALIB_API void luaL_openlibs (lua_State *L) {\r\n  const luaL_Reg *lib = lualibs;\r\n  for (; lib->func; lib++) {\r\n    lua_pushcfunction(L, lib->func);\r\n    lua_pushstring(L, lib->name);\r\n    lua_call(L, 1, 0);\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/liolib.c",
    "content": "/*\r\n** $Id: liolib.c,v 2.73.1.4 2010/05/14 15:33:51 roberto Exp $\r\n** Standard I/O (and system) library\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define liolib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n\r\n#define IO_INPUT\t1\r\n#define IO_OUTPUT\t2\r\n\r\n\r\nstatic const char *const fnames[] = {\"input\", \"output\"};\r\n\r\n\r\nstatic int pushresult (lua_State *L, int i, const char *filename) {\r\n  int en = errno;  /* calls to Lua API may change this value */\r\n  if (i) {\r\n    lua_pushboolean(L, 1);\r\n    return 1;\r\n  }\r\n  else {\r\n    lua_pushnil(L);\r\n    if (filename)\r\n      lua_pushfstring(L, \"%s: %s\", filename, strerror(en));\r\n    else\r\n      lua_pushfstring(L, \"%s\", strerror(en));\r\n    lua_pushinteger(L, en);\r\n    return 3;\r\n  }\r\n}\r\n\r\n\r\nstatic void fileerror (lua_State *L, int arg, const char *filename) {\r\n  lua_pushfstring(L, \"%s: %s\", filename, strerror(errno));\r\n  luaL_argerror(L, arg, lua_tostring(L, -1));\r\n}\r\n\r\n\r\n#define tofilep(L)\t((FILE **)luaL_checkudata(L, 1, LUA_FILEHANDLE))\r\n\r\n\r\nstatic int io_type (lua_State *L) {\r\n  void *ud;\r\n  luaL_checkany(L, 1);\r\n  ud = lua_touserdata(L, 1);\r\n  lua_getfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);\r\n  if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1))\r\n    lua_pushnil(L);  /* not a file */\r\n  else if (*((FILE **)ud) == NULL)\r\n    lua_pushliteral(L, \"closed file\");\r\n  else\r\n    lua_pushliteral(L, \"file\");\r\n  return 1;\r\n}\r\n\r\n\r\nstatic FILE *tofile (lua_State *L) {\r\n  FILE **f = tofilep(L);\r\n  if (*f == NULL)\r\n    luaL_error(L, \"attempt to use a closed file\");\r\n  return *f;\r\n}\r\n\r\n\r\n\r\n/*\r\n** When creating file handles, always creates a `closed' file handle\r\n** before opening the actual file; so, if there is a memory error, the\r\n** file is not left opened.\r\n*/\r\nstatic FILE **newfile (lua_State *L) {\r\n  FILE **pf = (FILE **)lua_newuserdata(L, sizeof(FILE *));\r\n  *pf = NULL;  /* file handle is currently `closed' */\r\n  luaL_getmetatable(L, LUA_FILEHANDLE);\r\n  lua_setmetatable(L, -2);\r\n  return pf;\r\n}\r\n\r\n\r\n/*\r\n** function to (not) close the standard files stdin, stdout, and stderr\r\n*/\r\nstatic int io_noclose (lua_State *L) {\r\n  lua_pushnil(L);\r\n  lua_pushliteral(L, \"cannot close standard file\");\r\n  return 2;\r\n}\r\n\r\n\r\n/*\r\n** function to close 'popen' files\r\n*/\r\nstatic int io_pclose (lua_State *L) {\r\n  FILE **p = tofilep(L);\r\n  int ok = lua_pclose(L, *p);\r\n  *p = NULL;\r\n  return pushresult(L, ok, NULL);\r\n}\r\n\r\n\r\n/*\r\n** function to close regular files\r\n*/\r\nstatic int io_fclose (lua_State *L) {\r\n  FILE **p = tofilep(L);\r\n  int ok = (fclose(*p) == 0);\r\n  *p = NULL;\r\n  return pushresult(L, ok, NULL);\r\n}\r\n\r\n\r\nstatic int aux_close (lua_State *L) {\r\n  lua_getfenv(L, 1);\r\n  lua_getfield(L, -1, \"__close\");\r\n  return (lua_tocfunction(L, -1))(L);\r\n}\r\n\r\n\r\nstatic int io_close (lua_State *L) {\r\n  if (lua_isnone(L, 1))\r\n    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_OUTPUT);\r\n  tofile(L);  /* make sure argument is a file */\r\n  return aux_close(L);\r\n}\r\n\r\n\r\nstatic int io_gc (lua_State *L) {\r\n  FILE *f = *tofilep(L);\r\n  /* ignore closed files */\r\n  if (f != NULL)\r\n    aux_close(L);\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int io_tostring (lua_State *L) {\r\n  FILE *f = *tofilep(L);\r\n  if (f == NULL)\r\n    lua_pushliteral(L, \"file (closed)\");\r\n  else\r\n    lua_pushfstring(L, \"file (%p)\", f);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int io_open (lua_State *L) {\r\n  const char *filename = luaL_checkstring(L, 1);\r\n  const char *mode = luaL_optstring(L, 2, \"r\");\r\n  FILE **pf = newfile(L);\r\n  *pf = fopen(filename, mode);\r\n  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;\r\n}\r\n\r\n\r\n/*\r\n** this function has a separated environment, which defines the\r\n** correct __close for 'popen' files\r\n*/\r\nstatic int io_popen (lua_State *L) {\r\n  const char *filename = luaL_checkstring(L, 1);\r\n  const char *mode = luaL_optstring(L, 2, \"r\");\r\n  FILE **pf = newfile(L);\r\n  *pf = lua_popen(L, filename, mode);\r\n  return (*pf == NULL) ? pushresult(L, 0, filename) : 1;\r\n}\r\n\r\n\r\nstatic int io_tmpfile (lua_State *L) {\r\n  FILE **pf = newfile(L);\r\n  *pf = tmpfile();\r\n  return (*pf == NULL) ? pushresult(L, 0, NULL) : 1;\r\n}\r\n\r\n\r\nstatic FILE *getiofile (lua_State *L, int findex) {\r\n  FILE *f;\r\n  lua_rawgeti(L, LUA_ENVIRONINDEX, findex);\r\n  f = *(FILE **)lua_touserdata(L, -1);\r\n  if (f == NULL)\r\n    luaL_error(L, \"standard %s file is closed\", fnames[findex - 1]);\r\n  return f;\r\n}\r\n\r\n\r\nstatic int g_iofile (lua_State *L, int f, const char *mode) {\r\n  if (!lua_isnoneornil(L, 1)) {\r\n    const char *filename = lua_tostring(L, 1);\r\n    if (filename) {\r\n      FILE **pf = newfile(L);\r\n      *pf = fopen(filename, mode);\r\n      if (*pf == NULL)\r\n        fileerror(L, 1, filename);\r\n    }\r\n    else {\r\n      tofile(L);  /* check that it's a valid file handle */\r\n      lua_pushvalue(L, 1);\r\n    }\r\n    lua_rawseti(L, LUA_ENVIRONINDEX, f);\r\n  }\r\n  /* return current value */\r\n  lua_rawgeti(L, LUA_ENVIRONINDEX, f);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int io_input (lua_State *L) {\r\n  return g_iofile(L, IO_INPUT, \"r\");\r\n}\r\n\r\n\r\nstatic int io_output (lua_State *L) {\r\n  return g_iofile(L, IO_OUTPUT, \"w\");\r\n}\r\n\r\n\r\nstatic int io_readline (lua_State *L);\r\n\r\n\r\nstatic void aux_lines (lua_State *L, int idx, int toclose) {\r\n  lua_pushvalue(L, idx);\r\n  lua_pushboolean(L, toclose);  /* close/not close file when finished */\r\n  lua_pushcclosure(L, io_readline, 2);\r\n}\r\n\r\n\r\nstatic int f_lines (lua_State *L) {\r\n  tofile(L);  /* check that it's a valid file handle */\r\n  aux_lines(L, 1, 0);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int io_lines (lua_State *L) {\r\n  if (lua_isnoneornil(L, 1)) {  /* no arguments? */\r\n    /* will iterate over default input */\r\n    lua_rawgeti(L, LUA_ENVIRONINDEX, IO_INPUT);\r\n    return f_lines(L);\r\n  }\r\n  else {\r\n    const char *filename = luaL_checkstring(L, 1);\r\n    FILE **pf = newfile(L);\r\n    *pf = fopen(filename, \"r\");\r\n    if (*pf == NULL)\r\n      fileerror(L, 1, filename);\r\n    aux_lines(L, lua_gettop(L), 1);\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\n/*\r\n** {======================================================\r\n** READ\r\n** =======================================================\r\n*/\r\n\r\n\r\nstatic int read_number (lua_State *L, FILE *f) {\r\n  lua_Number d;\r\n  if (fscanf(f, LUA_NUMBER_SCAN, &d) == 1) {\r\n    lua_pushnumber(L, d);\r\n    return 1;\r\n  }\r\n  else {\r\n    lua_pushnil(L);  /* \"result\" to be removed */\r\n    return 0;  /* read fails */\r\n  }\r\n}\r\n\r\n\r\nstatic int test_eof (lua_State *L, FILE *f) {\r\n  int c = getc(f);\r\n  ungetc(c, f);\r\n  lua_pushlstring(L, NULL, 0);\r\n  return (c != EOF);\r\n}\r\n\r\n\r\nstatic int read_line (lua_State *L, FILE *f) {\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  for (;;) {\r\n    size_t l;\r\n    char *p = luaL_prepbuffer(&b);\r\n    if (fgets(p, LUAL_BUFFERSIZE, f) == NULL) {  /* eof? */\r\n      luaL_pushresult(&b);  /* close buffer */\r\n      return (lua_objlen(L, -1) > 0);  /* check whether read something */\r\n    }\r\n    l = strlen(p);\r\n    if (l == 0 || p[l-1] != '\\n')\r\n      luaL_addsize(&b, l);\r\n    else {\r\n      luaL_addsize(&b, l - 1);  /* do not include `eol' */\r\n      luaL_pushresult(&b);  /* close buffer */\r\n      return 1;  /* read at least an `eol' */\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic int read_chars (lua_State *L, FILE *f, size_t n) {\r\n  size_t rlen;  /* how much to read */\r\n  size_t nr;  /* number of chars actually read */\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  rlen = LUAL_BUFFERSIZE;  /* try to read that much each time */\r\n  do {\r\n    char *p = luaL_prepbuffer(&b);\r\n    if (rlen > n) rlen = n;  /* cannot read more than asked */\r\n    nr = fread(p, sizeof(char), rlen, f);\r\n    luaL_addsize(&b, nr);\r\n    n -= nr;  /* still have to read `n' chars */\r\n  } while (n > 0 && nr == rlen);  /* until end of count or eof */\r\n  luaL_pushresult(&b);  /* close buffer */\r\n  return (n == 0 || lua_objlen(L, -1) > 0);\r\n}\r\n\r\n\r\nstatic int g_read (lua_State *L, FILE *f, int first) {\r\n  int nargs = lua_gettop(L) - 1;\r\n  int success;\r\n  int n;\r\n  clearerr(f);\r\n  if (nargs == 0) {  /* no arguments? */\r\n    success = read_line(L, f);\r\n    n = first+1;  /* to return 1 result */\r\n  }\r\n  else {  /* ensure stack space for all results and for auxlib's buffer */\r\n    luaL_checkstack(L, nargs+LUA_MINSTACK, \"too many arguments\");\r\n    success = 1;\r\n    for (n = first; nargs-- && success; n++) {\r\n      if (lua_type(L, n) == LUA_TNUMBER) {\r\n        size_t l = (size_t)lua_tointeger(L, n);\r\n        success = (l == 0) ? test_eof(L, f) : read_chars(L, f, l);\r\n      }\r\n      else {\r\n        const char *p = lua_tostring(L, n);\r\n        luaL_argcheck(L, p && p[0] == '*', n, \"invalid option\");\r\n        switch (p[1]) {\r\n          case 'n':  /* number */\r\n            success = read_number(L, f);\r\n            break;\r\n          case 'l':  /* line */\r\n            success = read_line(L, f);\r\n            break;\r\n          case 'a':  /* file */\r\n            read_chars(L, f, ~((size_t)0));  /* read MAX_SIZE_T chars */\r\n            success = 1; /* always success */\r\n            break;\r\n          default:\r\n            return luaL_argerror(L, n, \"invalid format\");\r\n        }\r\n      }\r\n    }\r\n  }\r\n  if (ferror(f))\r\n    return pushresult(L, 0, NULL);\r\n  if (!success) {\r\n    lua_pop(L, 1);  /* remove last result */\r\n    lua_pushnil(L);  /* push nil instead */\r\n  }\r\n  return n - first;\r\n}\r\n\r\n\r\nstatic int io_read (lua_State *L) {\r\n  return g_read(L, getiofile(L, IO_INPUT), 1);\r\n}\r\n\r\n\r\nstatic int f_read (lua_State *L) {\r\n  return g_read(L, tofile(L), 2);\r\n}\r\n\r\n\r\nstatic int io_readline (lua_State *L) {\r\n  FILE *f = *(FILE **)lua_touserdata(L, lua_upvalueindex(1));\r\n  int sucess;\r\n  if (f == NULL)  /* file is already closed? */\r\n    luaL_error(L, \"file is already closed\");\r\n  sucess = read_line(L, f);\r\n  if (ferror(f))\r\n    return luaL_error(L, \"%s\", strerror(errno));\r\n  if (sucess) return 1;\r\n  else {  /* EOF */\r\n    if (lua_toboolean(L, lua_upvalueindex(2))) {  /* generator created file? */\r\n      lua_settop(L, 0);\r\n      lua_pushvalue(L, lua_upvalueindex(1));\r\n      aux_close(L);  /* close it */\r\n    }\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic int g_write (lua_State *L, FILE *f, int arg) {\r\n  int nargs = lua_gettop(L) - 1;\r\n  int status = 1;\r\n  for (; nargs--; arg++) {\r\n    if (lua_type(L, arg) == LUA_TNUMBER) {\r\n      /* optimization: could be done exactly as for strings */\r\n      status = status &&\r\n          fprintf(f, LUA_NUMBER_FMT, lua_tonumber(L, arg)) > 0;\r\n    }\r\n    else {\r\n      size_t l;\r\n      const char *s = luaL_checklstring(L, arg, &l);\r\n      status = status && (fwrite(s, sizeof(char), l, f) == l);\r\n    }\r\n  }\r\n  return pushresult(L, status, NULL);\r\n}\r\n\r\n\r\nstatic int io_write (lua_State *L) {\r\n  return g_write(L, getiofile(L, IO_OUTPUT), 1);\r\n}\r\n\r\n\r\nstatic int f_write (lua_State *L) {\r\n  return g_write(L, tofile(L), 2);\r\n}\r\n\r\n\r\nstatic int f_seek (lua_State *L) {\r\n  static const int mode[] = {SEEK_SET, SEEK_CUR, SEEK_END};\r\n  static const char *const modenames[] = {\"set\", \"cur\", \"end\", NULL};\r\n  FILE *f = tofile(L);\r\n  int op = luaL_checkoption(L, 2, \"cur\", modenames);\r\n  long offset = luaL_optlong(L, 3, 0);\r\n  op = fseek(f, offset, mode[op]);\r\n  if (op)\r\n    return pushresult(L, 0, NULL);  /* error */\r\n  else {\r\n    lua_pushinteger(L, ftell(f));\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nstatic int f_setvbuf (lua_State *L) {\r\n  static const int mode[] = {_IONBF, _IOFBF, _IOLBF};\r\n  static const char *const modenames[] = {\"no\", \"full\", \"line\", NULL};\r\n  FILE *f = tofile(L);\r\n  int op = luaL_checkoption(L, 2, NULL, modenames);\r\n  lua_Integer sz = luaL_optinteger(L, 3, LUAL_BUFFERSIZE);\r\n  int res = setvbuf(f, NULL, mode[op], sz);\r\n  return pushresult(L, res == 0, NULL);\r\n}\r\n\r\n\r\n\r\nstatic int io_flush (lua_State *L) {\r\n  return pushresult(L, fflush(getiofile(L, IO_OUTPUT)) == 0, NULL);\r\n}\r\n\r\n\r\nstatic int f_flush (lua_State *L) {\r\n  return pushresult(L, fflush(tofile(L)) == 0, NULL);\r\n}\r\n\r\n\r\nstatic const luaL_Reg iolib[] = {\r\n  {\"close\", io_close},\r\n  {\"flush\", io_flush},\r\n  {\"input\", io_input},\r\n  {\"lines\", io_lines},\r\n  {\"open\", io_open},\r\n  {\"output\", io_output},\r\n  {\"popen\", io_popen},\r\n  {\"read\", io_read},\r\n  {\"tmpfile\", io_tmpfile},\r\n  {\"type\", io_type},\r\n  {\"write\", io_write},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nstatic const luaL_Reg flib[] = {\r\n  {\"close\", io_close},\r\n  {\"flush\", f_flush},\r\n  {\"lines\", f_lines},\r\n  {\"read\", f_read},\r\n  {\"seek\", f_seek},\r\n  {\"setvbuf\", f_setvbuf},\r\n  {\"write\", f_write},\r\n  {\"__gc\", io_gc},\r\n  {\"__tostring\", io_tostring},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nstatic void createmeta (lua_State *L) {\r\n  luaL_newmetatable(L, LUA_FILEHANDLE);  /* create metatable for file handles */\r\n  lua_pushvalue(L, -1);  /* push metatable */\r\n  lua_setfield(L, -2, \"__index\");  /* metatable.__index = metatable */\r\n  luaL_register(L, NULL, flib);  /* file methods */\r\n}\r\n\r\n\r\nstatic void createstdfile (lua_State *L, FILE *f, int k, const char *fname) {\r\n  *newfile(L) = f;\r\n  if (k > 0) {\r\n    lua_pushvalue(L, -1);\r\n    lua_rawseti(L, LUA_ENVIRONINDEX, k);\r\n  }\r\n  lua_pushvalue(L, -2);  /* copy environment */\r\n  lua_setfenv(L, -2);  /* set it */\r\n  lua_setfield(L, -3, fname);\r\n}\r\n\r\n\r\nstatic void newfenv (lua_State *L, lua_CFunction cls) {\r\n  lua_createtable(L, 0, 1);\r\n  lua_pushcfunction(L, cls);\r\n  lua_setfield(L, -2, \"__close\");\r\n}\r\n\r\n\r\nLUALIB_API int luaopen_io (lua_State *L) {\r\n  createmeta(L);\r\n  /* create (private) environment (with fields IO_INPUT, IO_OUTPUT, __close) */\r\n  newfenv(L, io_fclose);\r\n  lua_replace(L, LUA_ENVIRONINDEX);\r\n  /* open library */\r\n  luaL_register(L, LUA_IOLIBNAME, iolib);\r\n  /* create (and set) default files */\r\n  newfenv(L, io_noclose);  /* close function for default files */\r\n  createstdfile(L, stdin, IO_INPUT, \"stdin\");\r\n  createstdfile(L, stdout, IO_OUTPUT, \"stdout\");\r\n  createstdfile(L, stderr, 0, \"stderr\");\r\n  lua_pop(L, 1);  /* pop environment for default files */\r\n  lua_getfield(L, -1, \"popen\");\r\n  newfenv(L, io_pclose);  /* create environment for 'popen' */\r\n  lua_setfenv(L, -2);  /* set fenv for 'popen' */\r\n  lua_pop(L, 1);  /* pop 'popen' */\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/llex.c",
    "content": "/*\r\n** $Id: llex.c,v 2.20.1.2 2009/11/23 14:58:22 roberto Exp $\r\n** Lexical Analyzer\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <ctype.h>\r\n#include <locale.h>\r\n#include <string.h>\r\n\r\n#define llex_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldo.h\"\r\n#include \"llex.h\"\r\n#include \"lobject.h\"\r\n#include \"lparser.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n\r\n#define next(ls) (ls->current = zgetc(ls->z))\r\n\r\n\r\n\r\n\r\n#define currIsNewline(ls)\t(ls->current == '\\n' || ls->current == '\\r')\r\n\r\n\r\n/* ORDER RESERVED */\r\nconst char *const luaX_tokens [] = {\r\n    \"and\", \"break\", \"do\", \"else\", \"elseif\",\r\n    \"end\", \"false\", \"for\", \"function\", \"if\",\r\n    \"in\", \"local\", \"nil\", \"not\", \"or\", \"repeat\",\r\n    \"return\", \"then\", \"true\", \"until\", \"while\",\r\n    \"..\", \"...\", \"==\", \">=\", \"<=\", \"~=\",\r\n    \"<number>\", \"<name>\", \"<string>\", \"<eof>\",\r\n    NULL\r\n};\r\n\r\n\r\n#define save_and_next(ls) (save(ls, ls->current), next(ls))\r\n\r\n\r\nstatic void save (LexState *ls, int c) {\r\n  Mbuffer *b = ls->buff;\r\n  if (b->n + 1 > b->buffsize) {\r\n    size_t newsize;\r\n    if (b->buffsize >= MAX_SIZET/2)\r\n      luaX_lexerror(ls, \"lexical element too long\", 0);\r\n    newsize = b->buffsize * 2;\r\n    luaZ_resizebuffer(ls->L, b, newsize);\r\n  }\r\n  b->buffer[b->n++] = cast(char, c);\r\n}\r\n\r\n\r\nvoid luaX_init (lua_State *L) {\r\n  int i;\r\n  for (i=0; i<NUM_RESERVED; i++) {\r\n    TString *ts = luaS_new(L, luaX_tokens[i]);\r\n    luaS_fix(ts);  /* reserved words are never collected */\r\n    lua_assert(strlen(luaX_tokens[i])+1 <= TOKEN_LEN);\r\n    ts->tsv.reserved = cast_byte(i+1);  /* reserved word */\r\n  }\r\n}\r\n\r\n\r\n#define MAXSRC          80\r\n\r\n\r\nconst char *luaX_token2str (LexState *ls, int token) {\r\n  if (token < FIRST_RESERVED) {\r\n    lua_assert(token == cast(unsigned char, token));\r\n    return (iscntrl(token)) ? luaO_pushfstring(ls->L, \"char(%d)\", token) :\r\n                              luaO_pushfstring(ls->L, \"%c\", token);\r\n  }\r\n  else\r\n    return luaX_tokens[token-FIRST_RESERVED];\r\n}\r\n\r\n\r\nstatic const char *txtToken (LexState *ls, int token) {\r\n  switch (token) {\r\n    case TK_NAME:\r\n    case TK_STRING:\r\n    case TK_NUMBER:\r\n      save(ls, '\\0');\r\n      return luaZ_buffer(ls->buff);\r\n    default:\r\n      return luaX_token2str(ls, token);\r\n  }\r\n}\r\n\r\n\r\nvoid luaX_lexerror (LexState *ls, const char *msg, int token) {\r\n  char buff[MAXSRC];\r\n  luaO_chunkid(buff, getstr(ls->source), MAXSRC);\r\n  msg = luaO_pushfstring(ls->L, \"%s:%d: %s\", buff, ls->linenumber, msg);\r\n  if (token)\r\n    luaO_pushfstring(ls->L, \"%s near \" LUA_QS, msg, txtToken(ls, token));\r\n  luaD_throw(ls->L, LUA_ERRSYNTAX);\r\n}\r\n\r\n\r\nvoid luaX_syntaxerror (LexState *ls, const char *msg) {\r\n  luaX_lexerror(ls, msg, ls->t.token);\r\n}\r\n\r\n\r\nTString *luaX_newstring (LexState *ls, const char *str, size_t l) {\r\n  lua_State *L = ls->L;\r\n  TString *ts = luaS_newlstr(L, str, l);\r\n  TValue *o = luaH_setstr(L, ls->fs->h, ts);  /* entry for `str' */\r\n  if (ttisnil(o)) {\r\n    setbvalue(o, 1);  /* make sure `str' will not be collected */\r\n    luaC_checkGC(L);\r\n  }\r\n  return ts;\r\n}\r\n\r\n\r\nstatic void inclinenumber (LexState *ls) {\r\n  int old = ls->current;\r\n  lua_assert(currIsNewline(ls));\r\n  next(ls);  /* skip `\\n' or `\\r' */\r\n  if (currIsNewline(ls) && ls->current != old)\r\n    next(ls);  /* skip `\\n\\r' or `\\r\\n' */\r\n  if (++ls->linenumber >= MAX_INT)\r\n    luaX_syntaxerror(ls, \"chunk has too many lines\");\r\n}\r\n\r\n\r\nvoid luaX_setinput (lua_State *L, LexState *ls, ZIO *z, TString *source) {\r\n  ls->decpoint = '.';\r\n  ls->L = L;\r\n  ls->lookahead.token = TK_EOS;  /* no look-ahead token */\r\n  ls->z = z;\r\n  ls->fs = NULL;\r\n  ls->linenumber = 1;\r\n  ls->lastline = 1;\r\n  ls->source = source;\r\n  luaZ_resizebuffer(ls->L, ls->buff, LUA_MINBUFFER);  /* initialize buffer */\r\n  next(ls);  /* read first char */\r\n}\r\n\r\n\r\n\r\n/*\r\n** =======================================================\r\n** LEXICAL ANALYZER\r\n** =======================================================\r\n*/\r\n\r\n\r\n\r\nstatic int check_next (LexState *ls, const char *set) {\r\n  if (!strchr(set, ls->current))\r\n    return 0;\r\n  save_and_next(ls);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void buffreplace (LexState *ls, char from, char to) {\r\n  size_t n = luaZ_bufflen(ls->buff);\r\n  char *p = luaZ_buffer(ls->buff);\r\n  while (n--)\r\n    if (p[n] == from) p[n] = to;\r\n}\r\n\r\n\r\nstatic void trydecpoint (LexState *ls, SemInfo *seminfo) {\r\n  /* format error: try to update decimal point separator */\r\n  struct lconv *cv = localeconv();\r\n  char old = ls->decpoint;\r\n  ls->decpoint = (cv ? cv->decimal_point[0] : '.');\r\n  buffreplace(ls, old, ls->decpoint);  /* try updated decimal separator */\r\n  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r)) {\r\n    /* format error with correct decimal point: no more options */\r\n    buffreplace(ls, ls->decpoint, '.');  /* undo change (for error message) */\r\n    luaX_lexerror(ls, \"malformed number\", TK_NUMBER);\r\n  }\r\n}\r\n\r\n\r\n/* LUA_NUMBER */\r\nstatic void read_numeral (LexState *ls, SemInfo *seminfo) {\r\n  lua_assert(isdigit(ls->current));\r\n  do {\r\n    save_and_next(ls);\r\n  } while (isdigit(ls->current) || ls->current == '.');\r\n  if (check_next(ls, \"Ee\"))  /* `E'? */\r\n    check_next(ls, \"+-\");  /* optional exponent sign */\r\n  while (isalnum(ls->current) || ls->current == '_')\r\n    save_and_next(ls);\r\n  save(ls, '\\0');\r\n  buffreplace(ls, '.', ls->decpoint);  /* follow locale for decimal point */\r\n  if (!luaO_str2d(luaZ_buffer(ls->buff), &seminfo->r))  /* format error? */\r\n    trydecpoint(ls, seminfo); /* try to update decimal point separator */\r\n}\r\n\r\n\r\nstatic int skip_sep (LexState *ls) {\r\n  int count = 0;\r\n  int s = ls->current;\r\n  lua_assert(s == '[' || s == ']');\r\n  save_and_next(ls);\r\n  while (ls->current == '=') {\r\n    save_and_next(ls);\r\n    count++;\r\n  }\r\n  return (ls->current == s) ? count : (-count) - 1;\r\n}\r\n\r\n\r\nstatic void read_long_string (LexState *ls, SemInfo *seminfo, int sep) {\r\n  int cont = 0;\r\n  (void)(cont);  /* avoid warnings when `cont' is not used */\r\n  save_and_next(ls);  /* skip 2nd `[' */\r\n  if (currIsNewline(ls))  /* string starts with a newline? */\r\n    inclinenumber(ls);  /* skip it */\r\n  for (;;) {\r\n    switch (ls->current) {\r\n      case EOZ:\r\n        luaX_lexerror(ls, (seminfo) ? \"unfinished long string\" :\r\n                                   \"unfinished long comment\", TK_EOS);\r\n        break;  /* to avoid warnings */\r\n#if defined(LUA_COMPAT_LSTR)\r\n      case '[': {\r\n        if (skip_sep(ls) == sep) {\r\n          save_and_next(ls);  /* skip 2nd `[' */\r\n          cont++;\r\n#if LUA_COMPAT_LSTR == 1\r\n          if (sep == 0)\r\n            luaX_lexerror(ls, \"nesting of [[...]] is deprecated\", '[');\r\n#endif\r\n        }\r\n        break;\r\n      }\r\n#endif\r\n      case ']': {\r\n        if (skip_sep(ls) == sep) {\r\n          save_and_next(ls);  /* skip 2nd `]' */\r\n#if defined(LUA_COMPAT_LSTR) && LUA_COMPAT_LSTR == 2\r\n          cont--;\r\n          if (sep == 0 && cont >= 0) break;\r\n#endif\r\n          goto endloop;\r\n        }\r\n        break;\r\n      }\r\n      case '\\n':\r\n      case '\\r': {\r\n        save(ls, '\\n');\r\n        inclinenumber(ls);\r\n        if (!seminfo) luaZ_resetbuffer(ls->buff);  /* avoid wasting space */\r\n        break;\r\n      }\r\n      default: {\r\n        if (seminfo) save_and_next(ls);\r\n        else next(ls);\r\n      }\r\n    }\r\n  } endloop:\r\n  if (seminfo)\r\n    seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + (2 + sep),\r\n                                     luaZ_bufflen(ls->buff) - 2*(2 + sep));\r\n}\r\n\r\n\r\nstatic void read_string (LexState *ls, int del, SemInfo *seminfo) {\r\n  save_and_next(ls);\r\n  while (ls->current != del) {\r\n    switch (ls->current) {\r\n      case EOZ:\r\n        luaX_lexerror(ls, \"unfinished string\", TK_EOS);\r\n        continue;  /* to avoid warnings */\r\n      case '\\n':\r\n      case '\\r':\r\n        luaX_lexerror(ls, \"unfinished string\", TK_STRING);\r\n        continue;  /* to avoid warnings */\r\n      case '\\\\': {\r\n        int c;\r\n        next(ls);  /* do not save the `\\' */\r\n        switch (ls->current) {\r\n          case 'a': c = '\\a'; break;\r\n          case 'b': c = '\\b'; break;\r\n          case 'f': c = '\\f'; break;\r\n          case 'n': c = '\\n'; break;\r\n          case 'r': c = '\\r'; break;\r\n          case 't': c = '\\t'; break;\r\n          case 'v': c = '\\v'; break;\r\n          case '\\n':  /* go through */\r\n          case '\\r': save(ls, '\\n'); inclinenumber(ls); continue;\r\n          case EOZ: continue;  /* will raise an error next loop */\r\n          default: {\r\n            if (!isdigit(ls->current))\r\n              save_and_next(ls);  /* handles \\\\, \\\", \\', and \\? */\r\n            else {  /* \\xxx */\r\n              int i = 0;\r\n              c = 0;\r\n              do {\r\n                c = 10*c + (ls->current-'0');\r\n                next(ls);\r\n              } while (++i<3 && isdigit(ls->current));\r\n              if (c > UCHAR_MAX)\r\n                luaX_lexerror(ls, \"escape sequence too large\", TK_STRING);\r\n              save(ls, c);\r\n            }\r\n            continue;\r\n          }\r\n        }\r\n        save(ls, c);\r\n        next(ls);\r\n        continue;\r\n      }\r\n      default:\r\n        save_and_next(ls);\r\n    }\r\n  }\r\n  save_and_next(ls);  /* skip delimiter */\r\n  seminfo->ts = luaX_newstring(ls, luaZ_buffer(ls->buff) + 1,\r\n                                   luaZ_bufflen(ls->buff) - 2);\r\n}\r\n\r\n\r\nstatic int llex (LexState *ls, SemInfo *seminfo) {\r\n  luaZ_resetbuffer(ls->buff);\r\n  for (;;) {\r\n    switch (ls->current) {\r\n      case '\\n':\r\n      case '\\r': {\r\n        inclinenumber(ls);\r\n        continue;\r\n      }\r\n      case '-': {\r\n        next(ls);\r\n        if (ls->current != '-') return '-';\r\n        /* else is a comment */\r\n        next(ls);\r\n        if (ls->current == '[') {\r\n          int sep = skip_sep(ls);\r\n          luaZ_resetbuffer(ls->buff);  /* `skip_sep' may dirty the buffer */\r\n          if (sep >= 0) {\r\n            read_long_string(ls, NULL, sep);  /* long comment */\r\n            luaZ_resetbuffer(ls->buff);\r\n            continue;\r\n          }\r\n        }\r\n        /* else short comment */\r\n        while (!currIsNewline(ls) && ls->current != EOZ)\r\n          next(ls);\r\n        continue;\r\n      }\r\n      case '[': {\r\n        int sep = skip_sep(ls);\r\n        if (sep >= 0) {\r\n          read_long_string(ls, seminfo, sep);\r\n          return TK_STRING;\r\n        }\r\n        else if (sep == -1) return '[';\r\n        else luaX_lexerror(ls, \"invalid long string delimiter\", TK_STRING);\r\n      }\r\n      case '=': {\r\n        next(ls);\r\n        if (ls->current != '=') return '=';\r\n        else { next(ls); return TK_EQ; }\r\n      }\r\n      case '<': {\r\n        next(ls);\r\n        if (ls->current != '=') return '<';\r\n        else { next(ls); return TK_LE; }\r\n      }\r\n      case '>': {\r\n        next(ls);\r\n        if (ls->current != '=') return '>';\r\n        else { next(ls); return TK_GE; }\r\n      }\r\n      case '~': {\r\n        next(ls);\r\n        if (ls->current != '=') return '~';\r\n        else { next(ls); return TK_NE; }\r\n      }\r\n      case '\"':\r\n      case '\\'': {\r\n        read_string(ls, ls->current, seminfo);\r\n        return TK_STRING;\r\n      }\r\n      case '.': {\r\n        save_and_next(ls);\r\n        if (check_next(ls, \".\")) {\r\n          if (check_next(ls, \".\"))\r\n            return TK_DOTS;   /* ... */\r\n          else return TK_CONCAT;   /* .. */\r\n        }\r\n        else if (!isdigit(ls->current)) return '.';\r\n        else {\r\n          read_numeral(ls, seminfo);\r\n          return TK_NUMBER;\r\n        }\r\n      }\r\n      case EOZ: {\r\n        return TK_EOS;\r\n      }\r\n      default: {\r\n        if (isspace(ls->current)) {\r\n          lua_assert(!currIsNewline(ls));\r\n          next(ls);\r\n          continue;\r\n        }\r\n        else if (isdigit(ls->current)) {\r\n          read_numeral(ls, seminfo);\r\n          return TK_NUMBER;\r\n        }\r\n        else if (isalpha(ls->current) || ls->current == '_') {\r\n          /* identifier or reserved word */\r\n          TString *ts;\r\n          do {\r\n            save_and_next(ls);\r\n          } while (isalnum(ls->current) || ls->current == '_');\r\n          ts = luaX_newstring(ls, luaZ_buffer(ls->buff),\r\n                                  luaZ_bufflen(ls->buff));\r\n          if (ts->tsv.reserved > 0)  /* reserved word? */\r\n            return ts->tsv.reserved - 1 + FIRST_RESERVED;\r\n          else {\r\n            seminfo->ts = ts;\r\n            return TK_NAME;\r\n          }\r\n        }\r\n        else {\r\n          int c = ls->current;\r\n          next(ls);\r\n          return c;  /* single-char tokens (+ - / ...) */\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n\r\nvoid luaX_next (LexState *ls) {\r\n  ls->lastline = ls->linenumber;\r\n  if (ls->lookahead.token != TK_EOS) {  /* is there a look-ahead token? */\r\n    ls->t = ls->lookahead;  /* use this one */\r\n    ls->lookahead.token = TK_EOS;  /* and discharge it */\r\n  }\r\n  else\r\n    ls->t.token = llex(ls, &ls->t.seminfo);  /* read next token */\r\n}\r\n\r\n\r\nvoid luaX_lookahead (LexState *ls) {\r\n  lua_assert(ls->lookahead.token == TK_EOS);\r\n  ls->lookahead.token = llex(ls, &ls->lookahead.seminfo);\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/llex.h",
    "content": "/*\r\n** $Id: llex.h,v 1.58.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Lexical Analyzer\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef llex_h\r\n#define llex_h\r\n\r\n#include \"lobject.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n#define FIRST_RESERVED\t257\r\n\r\n/* maximum length of a reserved word */\r\n#define TOKEN_LEN\t(sizeof(\"function\")/sizeof(char))\r\n\r\n\r\n/*\r\n* WARNING: if you change the order of this enumeration,\r\n* grep \"ORDER RESERVED\"\r\n*/\r\nenum RESERVED {\r\n  /* terminal symbols denoted by reserved words */\r\n  TK_AND = FIRST_RESERVED, TK_BREAK,\r\n  TK_DO, TK_ELSE, TK_ELSEIF, TK_END, TK_FALSE, TK_FOR, TK_FUNCTION,\r\n  TK_IF, TK_IN, TK_LOCAL, TK_NIL, TK_NOT, TK_OR, TK_REPEAT,\r\n  TK_RETURN, TK_THEN, TK_TRUE, TK_UNTIL, TK_WHILE,\r\n  /* other terminal symbols */\r\n  TK_CONCAT, TK_DOTS, TK_EQ, TK_GE, TK_LE, TK_NE, TK_NUMBER,\r\n  TK_NAME, TK_STRING, TK_EOS\r\n};\r\n\r\n/* number of reserved words */\r\n#define NUM_RESERVED\t(cast(int, TK_WHILE-FIRST_RESERVED+1))\r\n\r\n\r\n/* array with token `names' */\r\nLUAI_DATA const char *const luaX_tokens [];\r\n\r\n\r\ntypedef union {\r\n  lua_Number r;\r\n  TString *ts;\r\n} SemInfo;  /* semantics information */\r\n\r\n\r\ntypedef struct Token {\r\n  int token;\r\n  SemInfo seminfo;\r\n} Token;\r\n\r\n\r\ntypedef struct LexState {\r\n  int current;  /* current character (charint) */\r\n  int linenumber;  /* input line counter */\r\n  int lastline;  /* line of last token `consumed' */\r\n  Token t;  /* current token */\r\n  Token lookahead;  /* look ahead token */\r\n  struct FuncState *fs;  /* `FuncState' is private to the parser */\r\n  struct lua_State *L;\r\n  ZIO *z;  /* input stream */\r\n  Mbuffer *buff;  /* buffer for tokens */\r\n  TString *source;  /* current source name */\r\n  char decpoint;  /* locale decimal point */\r\n} LexState;\r\n\r\n\r\nLUAI_FUNC void luaX_init (lua_State *L);\r\nLUAI_FUNC void luaX_setinput (lua_State *L, LexState *ls, ZIO *z,\r\n                              TString *source);\r\nLUAI_FUNC TString *luaX_newstring (LexState *ls, const char *str, size_t l);\r\nLUAI_FUNC void luaX_next (LexState *ls);\r\nLUAI_FUNC void luaX_lookahead (LexState *ls);\r\nLUAI_FUNC void luaX_lexerror (LexState *ls, const char *msg, int token);\r\nLUAI_FUNC void luaX_syntaxerror (LexState *ls, const char *s);\r\nLUAI_FUNC const char *luaX_token2str (LexState *ls, int token);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/llimits.h",
    "content": "/*\r\n** $Id: llimits.h,v 1.69.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Limits, basic types, and some other `installation-dependent' definitions\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef llimits_h\r\n#define llimits_h\r\n\r\n\r\n#include <limits.h>\r\n#include <stddef.h>\r\n\r\n\r\n#include \"lua.h\"\r\n\r\n\r\ntypedef LUAI_UINT32 lu_int32;\r\n\r\ntypedef LUAI_UMEM lu_mem;\r\n\r\ntypedef LUAI_MEM l_mem;\r\n\r\n\r\n\r\n/* chars used as small naturals (so that `char' is reserved for characters) */\r\ntypedef unsigned char lu_byte;\r\n\r\n\r\n#define MAX_SIZET\t((size_t)(~(size_t)0)-2)\r\n\r\n#define MAX_LUMEM\t((lu_mem)(~(lu_mem)0)-2)\r\n\r\n\r\n#define MAX_INT (INT_MAX-2)  /* maximum value of an int (-2 for safety) */\r\n\r\n/*\r\n** conversion of pointer to integer\r\n** this is for hashing only; there is no problem if the integer\r\n** cannot hold the whole pointer value\r\n*/\r\n#define IntPoint(p)  ((unsigned int)(lu_mem)(p))\r\n\r\n\r\n\r\n/* type to ensure maximum alignment */\r\ntypedef LUAI_USER_ALIGNMENT_T L_Umaxalign;\r\n\r\n\r\n/* result of a `usual argument conversion' over lua_Number */\r\ntypedef LUAI_UACNUMBER l_uacNumber;\r\n\r\n\r\n/* internal assertions for in-house debugging */\r\n#ifdef lua_assert\r\n\r\n#define check_exp(c,e)\t\t(lua_assert(c), (e))\r\n#define api_check(l,e)\t\tlua_assert(e)\r\n\r\n#else\r\n\r\n#define lua_assert(c)\t\t((void)0)\r\n#define check_exp(c,e)\t\t(e)\r\n#define api_check\t\tluai_apicheck\r\n\r\n#endif\r\n\r\n\r\n#ifndef UNUSED\r\n#define UNUSED(x)\t((void)(x))\t/* to avoid warnings */\r\n#endif\r\n\r\n\r\n#ifndef cast\r\n#define cast(t, exp)\t((t)(exp))\r\n#endif\r\n\r\n#define cast_byte(i)\tcast(lu_byte, (i))\r\n#define cast_num(i)\tcast(lua_Number, (i))\r\n#define cast_int(i)\tcast(int, (i))\r\n\r\n\r\n\r\n/*\r\n** type for virtual-machine instructions\r\n** must be an unsigned with (at least) 4 bytes (see details in lopcodes.h)\r\n*/\r\ntypedef lu_int32 Instruction;\r\n\r\n\r\n\r\n/* maximum stack for a Lua function */\r\n#define MAXSTACK\t250\r\n\r\n\r\n\r\n/* minimum size for the string table (must be power of 2) */\r\n#ifndef MINSTRTABSIZE\r\n#define MINSTRTABSIZE\t32\r\n#endif\r\n\r\n\r\n/* minimum size for string buffer */\r\n#ifndef LUA_MINBUFFER\r\n#define LUA_MINBUFFER\t32\r\n#endif\r\n\r\n\r\n#ifndef lua_lock\r\n#define lua_lock(L)     ((void) 0) \r\n#define lua_unlock(L)   ((void) 0)\r\n#endif\r\n\r\n#ifndef luai_threadyield\r\n#define luai_threadyield(L)     {lua_unlock(L); lua_lock(L);}\r\n#endif\r\n\r\n\r\n/*\r\n** macro to control inclusion of some hard tests on stack reallocation\r\n*/ \r\n#ifndef HARDSTACKTESTS\r\n#define condhardstacktests(x)\t((void)0)\r\n#else\r\n#define condhardstacktests(x)\tx\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lmathlib.c",
    "content": "/*\r\n** $Id: lmathlib.c,v 1.67.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Standard mathematical library\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stdlib.h>\r\n#include <math.h>\r\n\r\n#define lmathlib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n#undef PI\r\n#define PI (3.14159265358979323846)\r\n#define RADIANS_PER_DEGREE (PI/180.0)\r\n\r\n\r\n\r\nstatic int math_abs (lua_State *L) {\r\n  lua_pushnumber(L, fabs(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_sin (lua_State *L) {\r\n  lua_pushnumber(L, sin(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_sinh (lua_State *L) {\r\n  lua_pushnumber(L, sinh(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_cos (lua_State *L) {\r\n  lua_pushnumber(L, cos(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_cosh (lua_State *L) {\r\n  lua_pushnumber(L, cosh(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_tan (lua_State *L) {\r\n  lua_pushnumber(L, tan(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_tanh (lua_State *L) {\r\n  lua_pushnumber(L, tanh(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_asin (lua_State *L) {\r\n  lua_pushnumber(L, asin(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_acos (lua_State *L) {\r\n  lua_pushnumber(L, acos(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_atan (lua_State *L) {\r\n  lua_pushnumber(L, atan(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_atan2 (lua_State *L) {\r\n  lua_pushnumber(L, atan2(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_ceil (lua_State *L) {\r\n  lua_pushnumber(L, ceil(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_floor (lua_State *L) {\r\n  lua_pushnumber(L, floor(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_fmod (lua_State *L) {\r\n  lua_pushnumber(L, fmod(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_modf (lua_State *L) {\r\n  double ip;\r\n  double fp = modf(luaL_checknumber(L, 1), &ip);\r\n  lua_pushnumber(L, ip);\r\n  lua_pushnumber(L, fp);\r\n  return 2;\r\n}\r\n\r\nstatic int math_sqrt (lua_State *L) {\r\n  lua_pushnumber(L, sqrt(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_pow (lua_State *L) {\r\n  lua_pushnumber(L, pow(luaL_checknumber(L, 1), luaL_checknumber(L, 2)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_log (lua_State *L) {\r\n  lua_pushnumber(L, log(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_log10 (lua_State *L) {\r\n  lua_pushnumber(L, log10(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_exp (lua_State *L) {\r\n  lua_pushnumber(L, exp(luaL_checknumber(L, 1)));\r\n  return 1;\r\n}\r\n\r\nstatic int math_deg (lua_State *L) {\r\n  lua_pushnumber(L, luaL_checknumber(L, 1)/RADIANS_PER_DEGREE);\r\n  return 1;\r\n}\r\n\r\nstatic int math_rad (lua_State *L) {\r\n  lua_pushnumber(L, luaL_checknumber(L, 1)*RADIANS_PER_DEGREE);\r\n  return 1;\r\n}\r\n\r\nstatic int math_frexp (lua_State *L) {\r\n  int e;\r\n  lua_pushnumber(L, frexp(luaL_checknumber(L, 1), &e));\r\n  lua_pushinteger(L, e);\r\n  return 2;\r\n}\r\n\r\nstatic int math_ldexp (lua_State *L) {\r\n  lua_pushnumber(L, ldexp(luaL_checknumber(L, 1), luaL_checkint(L, 2)));\r\n  return 1;\r\n}\r\n\r\n\r\n\r\nstatic int math_min (lua_State *L) {\r\n  int n = lua_gettop(L);  /* number of arguments */\r\n  lua_Number dmin = luaL_checknumber(L, 1);\r\n  int i;\r\n  for (i=2; i<=n; i++) {\r\n    lua_Number d = luaL_checknumber(L, i);\r\n    if (d < dmin)\r\n      dmin = d;\r\n  }\r\n  lua_pushnumber(L, dmin);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int math_max (lua_State *L) {\r\n  int n = lua_gettop(L);  /* number of arguments */\r\n  lua_Number dmax = luaL_checknumber(L, 1);\r\n  int i;\r\n  for (i=2; i<=n; i++) {\r\n    lua_Number d = luaL_checknumber(L, i);\r\n    if (d > dmax)\r\n      dmax = d;\r\n  }\r\n  lua_pushnumber(L, dmax);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int math_random (lua_State *L) {\r\n  /* the `%' avoids the (rare) case of r==1, and is needed also because on\r\n     some systems (SunOS!) `rand()' may return a value larger than RAND_MAX */\r\n  lua_Number r = (lua_Number)(rand()%RAND_MAX) / (lua_Number)RAND_MAX;\r\n  switch (lua_gettop(L)) {  /* check number of arguments */\r\n    case 0: {  /* no arguments */\r\n      lua_pushnumber(L, r);  /* Number between 0 and 1 */\r\n      break;\r\n    }\r\n    case 1: {  /* only upper limit */\r\n      int u = luaL_checkint(L, 1);\r\n      luaL_argcheck(L, 1<=u, 1, \"interval is empty\");\r\n      lua_pushnumber(L, floor(r*u)+1);  /* int between 1 and `u' */\r\n      break;\r\n    }\r\n    case 2: {  /* lower and upper limits */\r\n      int l = luaL_checkint(L, 1);\r\n      int u = luaL_checkint(L, 2);\r\n      luaL_argcheck(L, l<=u, 2, \"interval is empty\");\r\n      lua_pushnumber(L, floor(r*(u-l+1))+l);  /* int between `l' and `u' */\r\n      break;\r\n    }\r\n    default: return luaL_error(L, \"wrong number of arguments\");\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int math_randomseed (lua_State *L) {\r\n  srand(luaL_checkint(L, 1));\r\n  return 0;\r\n}\r\n\r\n\r\nstatic const luaL_Reg mathlib[] = {\r\n  {\"abs\",   math_abs},\r\n  {\"acos\",  math_acos},\r\n  {\"asin\",  math_asin},\r\n  {\"atan2\", math_atan2},\r\n  {\"atan\",  math_atan},\r\n  {\"ceil\",  math_ceil},\r\n  {\"cosh\",   math_cosh},\r\n  {\"cos\",   math_cos},\r\n  {\"deg\",   math_deg},\r\n  {\"exp\",   math_exp},\r\n  {\"floor\", math_floor},\r\n  {\"fmod\",   math_fmod},\r\n  {\"frexp\", math_frexp},\r\n  {\"ldexp\", math_ldexp},\r\n  {\"log10\", math_log10},\r\n  {\"log\",   math_log},\r\n  {\"max\",   math_max},\r\n  {\"min\",   math_min},\r\n  {\"modf\",   math_modf},\r\n  {\"pow\",   math_pow},\r\n  {\"rad\",   math_rad},\r\n  {\"random\",     math_random},\r\n  {\"randomseed\", math_randomseed},\r\n  {\"sinh\",   math_sinh},\r\n  {\"sin\",   math_sin},\r\n  {\"sqrt\",  math_sqrt},\r\n  {\"tanh\",   math_tanh},\r\n  {\"tan\",   math_tan},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\n/*\r\n** Open math library\r\n*/\r\nLUALIB_API int luaopen_math (lua_State *L) {\r\n  luaL_register(L, LUA_MATHLIBNAME, mathlib);\r\n  lua_pushnumber(L, PI);\r\n  lua_setfield(L, -2, \"pi\");\r\n  lua_pushnumber(L, HUGE_VAL);\r\n  lua_setfield(L, -2, \"huge\");\r\n#if defined(LUA_COMPAT_MOD)\r\n  lua_getfield(L, -1, \"fmod\");\r\n  lua_setfield(L, -2, \"mod\");\r\n#endif\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lmem.c",
    "content": "/*\r\n** $Id: lmem.c,v 1.70.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Interface to Memory Manager\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stddef.h>\r\n\r\n#define lmem_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n\r\n\r\n\r\n/*\r\n** About the realloc function:\r\n** void * frealloc (void *ud, void *ptr, size_t osize, size_t nsize);\r\n** (`osize' is the old size, `nsize' is the new size)\r\n**\r\n** Lua ensures that (ptr == NULL) iff (osize == 0).\r\n**\r\n** * frealloc(ud, NULL, 0, x) creates a new block of size `x'\r\n**\r\n** * frealloc(ud, p, x, 0) frees the block `p'\r\n** (in this specific case, frealloc must return NULL).\r\n** particularly, frealloc(ud, NULL, 0, 0) does nothing\r\n** (which is equivalent to free(NULL) in ANSI C)\r\n**\r\n** frealloc returns NULL if it cannot create or reallocate the area\r\n** (any reallocation to an equal or smaller size cannot fail!)\r\n*/\r\n\r\n\r\n\r\n#define MINSIZEARRAY\t4\r\n\r\n\r\nvoid *luaM_growaux_ (lua_State *L, void *block, int *size, size_t size_elems,\r\n                     int limit, const char *errormsg) {\r\n  void *newblock;\r\n  int newsize;\r\n  if (*size >= limit/2) {  /* cannot double it? */\r\n    if (*size >= limit)  /* cannot grow even a little? */\r\n      luaG_runerror(L, errormsg);\r\n    newsize = limit;  /* still have at least one free place */\r\n  }\r\n  else {\r\n    newsize = (*size)*2;\r\n    if (newsize < MINSIZEARRAY)\r\n      newsize = MINSIZEARRAY;  /* minimum size */\r\n  }\r\n  newblock = luaM_reallocv(L, block, *size, newsize, size_elems);\r\n  *size = newsize;  /* update only when everything else is OK */\r\n  return newblock;\r\n}\r\n\r\n\r\nvoid *luaM_toobig (lua_State *L) {\r\n  luaG_runerror(L, \"memory allocation error: block too big\");\r\n  return NULL;  /* to avoid warnings */\r\n}\r\n\r\n\r\n\r\n/*\r\n** generic allocation routine.\r\n*/\r\nvoid *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {\r\n  global_State *g = G(L);\r\n  lua_assert((osize == 0) == (block == NULL));\r\n  block = (*g->frealloc)(g->ud, block, osize, nsize);\r\n  if (block == NULL && nsize > 0)\r\n    luaD_throw(L, LUA_ERRMEM);\r\n  lua_assert((nsize == 0) == (block == NULL));\r\n  g->totalbytes = (g->totalbytes - osize) + nsize;\r\n  return block;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lmem.h",
    "content": "/*\r\n** $Id: lmem.h,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Interface to Memory Manager\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lmem_h\r\n#define lmem_h\r\n\r\n\r\n#include <stddef.h>\r\n\r\n#include \"llimits.h\"\r\n#include \"lua.h\"\r\n\r\n#define MEMERRMSG\t\"not enough memory\"\r\n\r\n\r\n#define luaM_reallocv(L,b,on,n,e) \\\r\n\t((cast(size_t, (n)+1) <= MAX_SIZET/(e)) ?  /* +1 to avoid warnings */ \\\r\n\t\tluaM_realloc_(L, (b), (on)*(e), (n)*(e)) : \\\r\n\t\tluaM_toobig(L))\r\n\r\n#define luaM_freemem(L, b, s)\tluaM_realloc_(L, (b), (s), 0)\r\n#define luaM_free(L, b)\t\tluaM_realloc_(L, (b), sizeof(*(b)), 0)\r\n#define luaM_freearray(L, b, n, t)   luaM_reallocv(L, (b), n, 0, sizeof(t))\r\n\r\n#define luaM_malloc(L,t)\tluaM_realloc_(L, NULL, 0, (t))\r\n#define luaM_new(L,t)\t\tcast(t *, luaM_malloc(L, sizeof(t)))\r\n#define luaM_newvector(L,n,t) \\\r\n\t\tcast(t *, luaM_reallocv(L, NULL, 0, n, sizeof(t)))\r\n\r\n#define luaM_growvector(L,v,nelems,size,t,limit,e) \\\r\n          if ((nelems)+1 > (size)) \\\r\n            ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))\r\n\r\n#define luaM_reallocvector(L, v,oldn,n,t) \\\r\n   ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))\r\n\r\n\r\nLUAI_FUNC void *luaM_realloc_ (lua_State *L, void *block, size_t oldsize,\r\n                                                          size_t size);\r\nLUAI_FUNC void *luaM_toobig (lua_State *L);\r\nLUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,\r\n                               size_t size_elem, int limit,\r\n                               const char *errormsg);\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/loadlib.c",
    "content": "/*\r\n** $Id: loadlib.c,v 1.52.1.4 2009/09/09 13:17:16 roberto Exp $\r\n** Dynamic library loader for Lua\r\n** See Copyright Notice in lua.h\r\n**\r\n** This module contains an implementation of loadlib for Unix systems\r\n** that have dlfcn, an implementation for Darwin (Mac OS X), an\r\n** implementation for Windows, and a stub for other systems.\r\n*/\r\n\r\n\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n\r\n#define loadlib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n/* prefix for open functions in C libraries */\r\n#define LUA_POF\t\t\"luaopen_\"\r\n\r\n/* separator for open functions in C libraries */\r\n#define LUA_OFSEP\t\"_\"\r\n\r\n\r\n#define LIBPREFIX\t\"LOADLIB: \"\r\n\r\n#define POF\t\tLUA_POF\r\n#define LIB_FAIL\t\"open\"\r\n\r\n\r\n/* error codes for ll_loadfunc */\r\n#define ERRLIB\t\t1\r\n#define ERRFUNC\t\t2\r\n\r\n#define setprogdir(L)\t\t((void)0)\r\n\r\n\r\nstatic void ll_unloadlib (void *lib);\r\nstatic void *ll_load (lua_State *L, const char *path);\r\nstatic lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym);\r\n\r\n\r\n\r\n#if defined(LUA_DL_DLOPEN)\r\n/*\r\n** {========================================================================\r\n** This is an implementation of loadlib based on the dlfcn interface.\r\n** The dlfcn interface is available in Linux, SunOS, Solaris, IRIX, FreeBSD,\r\n** NetBSD, AIX 4.2, HPUX 11, and  probably most other Unix flavors, at least\r\n** as an emulation layer on top of native functions.\r\n** =========================================================================\r\n*/\r\n\r\n#include <dlfcn.h>\r\n\r\nstatic void ll_unloadlib (void *lib) {\r\n  dlclose(lib);\r\n}\r\n\r\n\r\nstatic void *ll_load (lua_State *L, const char *path) {\r\n  void *lib = dlopen(path, RTLD_NOW);\r\n  if (lib == NULL) lua_pushstring(L, dlerror());\r\n  return lib;\r\n}\r\n\r\n\r\nstatic lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {\r\n  lua_CFunction f = (lua_CFunction)dlsym(lib, sym);\r\n  if (f == NULL) lua_pushstring(L, dlerror());\r\n  return f;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\n#elif defined(LUA_DL_DLL)\r\n/*\r\n** {======================================================================\r\n** This is an implementation of loadlib for Windows using native functions.\r\n** =======================================================================\r\n*/\r\n\r\n#include <windows.h>\r\n\r\n\r\n#undef setprogdir\r\n\r\nstatic void setprogdir (lua_State *L) {\r\n  char buff[MAX_PATH + 1];\r\n  char *lb;\r\n  DWORD nsize = sizeof(buff)/sizeof(char);\r\n  DWORD n = GetModuleFileNameA(NULL, buff, nsize);\r\n  if (n == 0 || n == nsize || (lb = strrchr(buff, '\\\\')) == NULL)\r\n    luaL_error(L, \"unable to get ModuleFileName\");\r\n  else {\r\n    *lb = '\\0';\r\n    luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);\r\n    lua_remove(L, -2);  /* remove original string */\r\n  }\r\n}\r\n\r\n\r\nstatic void pusherror (lua_State *L) {\r\n  int error = GetLastError();\r\n  char buffer[128];\r\n  if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,\r\n      NULL, error, 0, buffer, sizeof(buffer), NULL))\r\n    lua_pushstring(L, buffer);\r\n  else\r\n    lua_pushfstring(L, \"system error %d\\n\", error);\r\n}\r\n\r\nstatic void ll_unloadlib (void *lib) {\r\n  FreeLibrary((HINSTANCE)lib);\r\n}\r\n\r\n\r\nstatic void *ll_load (lua_State *L, const char *path) {\r\n  HINSTANCE lib = LoadLibraryA(path);\r\n  if (lib == NULL) pusherror(L);\r\n  return lib;\r\n}\r\n\r\n\r\nstatic lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {\r\n  lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);\r\n  if (f == NULL) pusherror(L);\r\n  return f;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\n#elif defined(LUA_DL_DYLD)\r\n/*\r\n** {======================================================================\r\n** Native Mac OS X / Darwin Implementation\r\n** =======================================================================\r\n*/\r\n\r\n#include <mach-o/dyld.h>\r\n\r\n\r\n/* Mac appends a `_' before C function names */\r\n#undef POF\r\n#define POF\t\"_\" LUA_POF\r\n\r\n\r\nstatic void pusherror (lua_State *L) {\r\n  const char *err_str;\r\n  const char *err_file;\r\n  NSLinkEditErrors err;\r\n  int err_num;\r\n  NSLinkEditError(&err, &err_num, &err_file, &err_str);\r\n  lua_pushstring(L, err_str);\r\n}\r\n\r\n\r\nstatic const char *errorfromcode (NSObjectFileImageReturnCode ret) {\r\n  switch (ret) {\r\n    case NSObjectFileImageInappropriateFile:\r\n      return \"file is not a bundle\";\r\n    case NSObjectFileImageArch:\r\n      return \"library is for wrong CPU type\";\r\n    case NSObjectFileImageFormat:\r\n      return \"bad format\";\r\n    case NSObjectFileImageAccess:\r\n      return \"cannot access file\";\r\n    case NSObjectFileImageFailure:\r\n    default:\r\n      return \"unable to load library\";\r\n  }\r\n}\r\n\r\n\r\nstatic void ll_unloadlib (void *lib) {\r\n  NSUnLinkModule((NSModule)lib, NSUNLINKMODULE_OPTION_RESET_LAZY_REFERENCES);\r\n}\r\n\r\n\r\nstatic void *ll_load (lua_State *L, const char *path) {\r\n  NSObjectFileImage img;\r\n  NSObjectFileImageReturnCode ret;\r\n  /* this would be a rare case, but prevents crashing if it happens */\r\n  if(!_dyld_present()) {\r\n    lua_pushliteral(L, \"dyld not present\");\r\n    return NULL;\r\n  }\r\n  ret = NSCreateObjectFileImageFromFile(path, &img);\r\n  if (ret == NSObjectFileImageSuccess) {\r\n    NSModule mod = NSLinkModule(img, path, NSLINKMODULE_OPTION_PRIVATE |\r\n                       NSLINKMODULE_OPTION_RETURN_ON_ERROR);\r\n    NSDestroyObjectFileImage(img);\r\n    if (mod == NULL) pusherror(L);\r\n    return mod;\r\n  }\r\n  lua_pushstring(L, errorfromcode(ret));\r\n  return NULL;\r\n}\r\n\r\n\r\nstatic lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {\r\n  NSSymbol nss = NSLookupSymbolInModule((NSModule)lib, sym);\r\n  if (nss == NULL) {\r\n    lua_pushfstring(L, \"symbol \" LUA_QS \" not found\", sym);\r\n    return NULL;\r\n  }\r\n  return (lua_CFunction)NSAddressOfSymbol(nss);\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\n#else\r\n/*\r\n** {======================================================\r\n** Fallback for other systems\r\n** =======================================================\r\n*/\r\n\r\n#undef LIB_FAIL\r\n#define LIB_FAIL\t\"absent\"\r\n\r\n\r\n#define DLMSG\t\"dynamic libraries not enabled; check your Lua installation\"\r\n\r\n\r\nstatic void ll_unloadlib (void *lib) {\r\n  (void)lib;  /* to avoid warnings */\r\n}\r\n\r\n\r\nstatic void *ll_load (lua_State *L, const char *path) {\r\n  (void)path;  /* to avoid warnings */\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\n\r\nstatic lua_CFunction ll_sym (lua_State *L, void *lib, const char *sym) {\r\n  (void)lib; (void)sym;  /* to avoid warnings */\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\n/* }====================================================== */\r\n#endif\r\n\r\n\r\n\r\nstatic void **ll_register (lua_State *L, const char *path) {\r\n  void **plib;\r\n  lua_pushfstring(L, \"%s%s\", LIBPREFIX, path);\r\n  lua_gettable(L, LUA_REGISTRYINDEX);  /* check library in registry? */\r\n  if (!lua_isnil(L, -1))  /* is there an entry? */\r\n    plib = (void **)lua_touserdata(L, -1);\r\n  else {  /* no entry yet; create one */\r\n    lua_pop(L, 1);\r\n    plib = (void **)lua_newuserdata(L, sizeof(const void *));\r\n    *plib = NULL;\r\n    luaL_getmetatable(L, \"_LOADLIB\");\r\n    lua_setmetatable(L, -2);\r\n    lua_pushfstring(L, \"%s%s\", LIBPREFIX, path);\r\n    lua_pushvalue(L, -2);\r\n    lua_settable(L, LUA_REGISTRYINDEX);\r\n  }\r\n  return plib;\r\n}\r\n\r\n\r\n/*\r\n** __gc tag method: calls library's `ll_unloadlib' function with the lib\r\n** handle\r\n*/\r\nstatic int gctm (lua_State *L) {\r\n  void **lib = (void **)luaL_checkudata(L, 1, \"_LOADLIB\");\r\n  if (*lib) ll_unloadlib(*lib);\r\n  *lib = NULL;  /* mark library as closed */\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int ll_loadfunc (lua_State *L, const char *path, const char *sym) {\r\n  void **reg = ll_register(L, path);\r\n  if (*reg == NULL) *reg = ll_load(L, path);\r\n  if (*reg == NULL)\r\n    return ERRLIB;  /* unable to load library */\r\n  else {\r\n    lua_CFunction f = ll_sym(L, *reg, sym);\r\n    if (f == NULL)\r\n      return ERRFUNC;  /* unable to find function */\r\n    lua_pushcfunction(L, f);\r\n    return 0;  /* return function */\r\n  }\r\n}\r\n\r\n\r\nstatic int ll_loadlib (lua_State *L) {\r\n  const char *path = luaL_checkstring(L, 1);\r\n  const char *init = luaL_checkstring(L, 2);\r\n  int stat = ll_loadfunc(L, path, init);\r\n  if (stat == 0)  /* no errors? */\r\n    return 1;  /* return the loaded function */\r\n  else {  /* error; error message is on stack top */\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);\r\n    lua_pushstring(L, (stat == ERRLIB) ?  LIB_FAIL : \"init\");\r\n    return 3;  /* return nil, error message, and where */\r\n  }\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** 'require' function\r\n** =======================================================\r\n*/\r\n\r\n\r\nstatic int readable (const char *filename) {\r\n  FILE *f = fopen(filename, \"r\");  /* try to open file */\r\n  if (f == NULL) return 0;  /* open failed */\r\n  fclose(f);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const char *pushnexttemplate (lua_State *L, const char *path) {\r\n  const char *l;\r\n  while (*path == *LUA_PATHSEP) path++;  /* skip separators */\r\n  if (*path == '\\0') return NULL;  /* no more templates */\r\n  l = strchr(path, *LUA_PATHSEP);  /* find next separator */\r\n  if (l == NULL) l = path + strlen(path);\r\n  lua_pushlstring(L, path, l - path);  /* template */\r\n  return l;\r\n}\r\n\r\n\r\nstatic const char *findfile (lua_State *L, const char *name,\r\n                                           const char *pname) {\r\n  const char *path;\r\n  name = luaL_gsub(L, name, \".\", LUA_DIRSEP);\r\n  lua_getfield(L, LUA_ENVIRONINDEX, pname);\r\n  path = lua_tostring(L, -1);\r\n  if (path == NULL)\r\n    luaL_error(L, LUA_QL(\"package.%s\") \" must be a string\", pname);\r\n  lua_pushliteral(L, \"\");  /* error accumulator */\r\n  while ((path = pushnexttemplate(L, path)) != NULL) {\r\n    const char *filename;\r\n    filename = luaL_gsub(L, lua_tostring(L, -1), LUA_PATH_MARK, name);\r\n    lua_remove(L, -2);  /* remove path template */\r\n    if (readable(filename))  /* does file exist and is readable? */\r\n      return filename;  /* return that file name */\r\n    lua_pushfstring(L, \"\\n\\tno file \" LUA_QS, filename);\r\n    lua_remove(L, -2);  /* remove file name */\r\n    lua_concat(L, 2);  /* add entry to possible error message */\r\n  }\r\n  return NULL;  /* not found */\r\n}\r\n\r\n\r\nstatic void loaderror (lua_State *L, const char *filename) {\r\n  luaL_error(L, \"error loading module \" LUA_QS \" from file \" LUA_QS \":\\n\\t%s\",\r\n                lua_tostring(L, 1), filename, lua_tostring(L, -1));\r\n}\r\n\r\n\r\nstatic int loader_Lua (lua_State *L) {\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  filename = findfile(L, name, \"path\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  if (luaL_loadfile(L, filename) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\n\r\nstatic const char *mkfuncname (lua_State *L, const char *modname) {\r\n  const char *funcname;\r\n  const char *mark = strchr(modname, *LUA_IGMARK);\r\n  if (mark) modname = mark + 1;\r\n  funcname = luaL_gsub(L, modname, \".\", LUA_OFSEP);\r\n  funcname = lua_pushfstring(L, POF\"%s\", funcname);\r\n  lua_remove(L, -2);  /* remove 'gsub' result */\r\n  return funcname;\r\n}\r\n\r\n\r\nstatic int loader_C (lua_State *L) {\r\n  const char *funcname;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *filename = findfile(L, name, \"cpath\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  funcname = mkfuncname(L, name);\r\n  if (ll_loadfunc(L, filename, funcname) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\n\r\nstatic int loader_Croot (lua_State *L) {\r\n  const char *funcname;\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *p = strchr(name, '.');\r\n  int stat;\r\n  if (p == NULL) return 0;  /* is root */\r\n  lua_pushlstring(L, name, p - name);\r\n  filename = findfile(L, lua_tostring(L, -1), \"cpath\");\r\n  if (filename == NULL) return 1;  /* root not found */\r\n  funcname = mkfuncname(L, name);\r\n  if ((stat = ll_loadfunc(L, filename, funcname)) != 0) {\r\n    if (stat != ERRFUNC) loaderror(L, filename);  /* real error */\r\n    lua_pushfstring(L, \"\\n\\tno module \" LUA_QS \" in file \" LUA_QS,\r\n                       name, filename);\r\n    return 1;  /* function not found */\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int loader_preload (lua_State *L) {\r\n  const char *name = luaL_checkstring(L, 1);\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"preload\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.preload\") \" must be a table\");\r\n  lua_getfield(L, -1, name);\r\n  if (lua_isnil(L, -1))  /* not found? */\r\n    lua_pushfstring(L, \"\\n\\tno field package.preload['%s']\", name);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const int sentinel_ = 0;\r\n#define sentinel\t((void *)&sentinel_)\r\n\r\n\r\nstatic int ll_require (lua_State *L) {\r\n  const char *name = luaL_checkstring(L, 1);\r\n  int i;\r\n  lua_settop(L, 1);  /* _LOADED table will be at index 2 */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, 2, name);\r\n  if (lua_toboolean(L, -1)) {  /* is it there? */\r\n    if (lua_touserdata(L, -1) == sentinel)  /* check loops */\r\n      luaL_error(L, \"loop or previous error loading module \" LUA_QS, name);\r\n    return 1;  /* package is already loaded */\r\n  }\r\n  /* else must load it; iterate over available loaders */\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"loaders\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.loaders\") \" must be a table\");\r\n  lua_pushliteral(L, \"\");  /* error message accumulator */\r\n  for (i=1; ; i++) {\r\n    lua_rawgeti(L, -2, i);  /* get a loader */\r\n    if (lua_isnil(L, -1))\r\n      luaL_error(L, \"module \" LUA_QS \" not found:%s\",\r\n                    name, lua_tostring(L, -2));\r\n    lua_pushstring(L, name);\r\n    lua_call(L, 1, 1);  /* call it */\r\n    if (lua_isfunction(L, -1))  /* did it find module? */\r\n      break;  /* module loaded successfully */\r\n    else if (lua_isstring(L, -1))  /* loader returned error message? */\r\n      lua_concat(L, 2);  /* accumulate it */\r\n    else\r\n      lua_pop(L, 1);\r\n  }\r\n  lua_pushlightuserdata(L, sentinel);\r\n  lua_setfield(L, 2, name);  /* _LOADED[name] = sentinel */\r\n  lua_pushstring(L, name);  /* pass name as argument to module */\r\n  lua_call(L, 1, 1);  /* run loaded module */\r\n  if (!lua_isnil(L, -1))  /* non-nil return? */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = returned value */\r\n  lua_getfield(L, 2, name);\r\n  if (lua_touserdata(L, -1) == sentinel) {   /* module did not set a value? */\r\n    lua_pushboolean(L, 1);  /* use true as result */\r\n    lua_pushvalue(L, -1);  /* extra copy to be returned */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = true */\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** 'module' function\r\n** =======================================================\r\n*/\r\n  \r\n\r\nstatic void setfenv (lua_State *L) {\r\n  lua_Debug ar;\r\n  if (lua_getstack(L, 1, &ar) == 0 ||\r\n      lua_getinfo(L, \"f\", &ar) == 0 ||  /* get calling function */\r\n      lua_iscfunction(L, -1))\r\n    luaL_error(L, LUA_QL(\"module\") \" not called from a Lua function\");\r\n  lua_pushvalue(L, -2);\r\n  lua_setfenv(L, -2);\r\n  lua_pop(L, 1);\r\n}\r\n\r\n\r\nstatic void dooptions (lua_State *L, int n) {\r\n  int i;\r\n  for (i = 2; i <= n; i++) {\r\n    lua_pushvalue(L, i);  /* get option (a function) */\r\n    lua_pushvalue(L, -2);  /* module */\r\n    lua_call(L, 1, 0);\r\n  }\r\n}\r\n\r\n\r\nstatic void modinit (lua_State *L, const char *modname) {\r\n  const char *dot;\r\n  lua_pushvalue(L, -1);\r\n  lua_setfield(L, -2, \"_M\");  /* module._M = module */\r\n  lua_pushstring(L, modname);\r\n  lua_setfield(L, -2, \"_NAME\");\r\n  dot = strrchr(modname, '.');  /* look for last dot in module name */\r\n  if (dot == NULL) dot = modname;\r\n  else dot++;\r\n  /* set _PACKAGE as package name (full module name minus last part) */\r\n  lua_pushlstring(L, modname, dot - modname);\r\n  lua_setfield(L, -2, \"_PACKAGE\");\r\n}\r\n\r\n\r\nstatic int ll_module (lua_State *L) {\r\n  const char *modname = luaL_checkstring(L, 1);\r\n  int loaded = lua_gettop(L) + 1;  /* index of _LOADED table */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, loaded, modname);  /* get _LOADED[modname] */\r\n  if (!lua_istable(L, -1)) {  /* not found? */\r\n    lua_pop(L, 1);  /* remove previous result */\r\n    /* try global variable (and create one if it does not exist) */\r\n    if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)\r\n      return luaL_error(L, \"name conflict for module \" LUA_QS, modname);\r\n    lua_pushvalue(L, -1);\r\n    lua_setfield(L, loaded, modname);  /* _LOADED[modname] = new table */\r\n  }\r\n  /* check whether table already has a _NAME field */\r\n  lua_getfield(L, -1, \"_NAME\");\r\n  if (!lua_isnil(L, -1))  /* is table an initialized module? */\r\n    lua_pop(L, 1);\r\n  else {  /* no; initialize it */\r\n    lua_pop(L, 1);\r\n    modinit(L, modname);\r\n  }\r\n  lua_pushvalue(L, -1);\r\n  setfenv(L);\r\n  dooptions(L, loaded - 1);\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int ll_seeall (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    lua_createtable(L, 0, 1); /* create new metatable */\r\n    lua_pushvalue(L, -1);\r\n    lua_setmetatable(L, 1);\r\n  }\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  lua_setfield(L, -2, \"__index\");  /* mt.__index = _G */\r\n  return 0;\r\n}\r\n\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\n/* auxiliary mark (for internal use) */\r\n#define AUXMARK\t\t\"\\1\"\r\n\r\nstatic void setpath (lua_State *L, const char *fieldname, const char *envname,\r\n                                   const char *def) {\r\n  const char *path = getenv(envname);\r\n  if (path == NULL)  /* no environment variable? */\r\n    lua_pushstring(L, def);  /* use default */\r\n  else {\r\n    /* replace \";;\" by \";AUXMARK;\" and then AUXMARK by default path */\r\n    path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,\r\n                              LUA_PATHSEP AUXMARK LUA_PATHSEP);\r\n    luaL_gsub(L, path, AUXMARK, def);\r\n    lua_remove(L, -2);\r\n  }\r\n  setprogdir(L);\r\n  lua_setfield(L, -2, fieldname);\r\n}\r\n\r\n\r\nstatic const luaL_Reg pk_funcs[] = {\r\n  {\"loadlib\", ll_loadlib},\r\n  {\"seeall\", ll_seeall},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nstatic const luaL_Reg ll_funcs[] = {\r\n  {\"module\", ll_module},\r\n  {\"require\", ll_require},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nstatic const lua_CFunction loaders[] =\r\n  {loader_preload, loader_Lua, loader_C, loader_Croot, NULL};\r\n\r\n\r\nLUALIB_API int luaopen_package (lua_State *L) {\r\n  int i;\r\n  /* create new type _LOADLIB */\r\n  luaL_newmetatable(L, \"_LOADLIB\");\r\n  lua_pushcfunction(L, gctm);\r\n  lua_setfield(L, -2, \"__gc\");\r\n  /* create `package' table */\r\n  luaL_register(L, LUA_LOADLIBNAME, pk_funcs);\r\n#if defined(LUA_COMPAT_LOADLIB) \r\n  lua_getfield(L, -1, \"loadlib\");\r\n  lua_setfield(L, LUA_GLOBALSINDEX, \"loadlib\");\r\n#endif\r\n  lua_pushvalue(L, -1);\r\n  lua_replace(L, LUA_ENVIRONINDEX);\r\n  /* create `loaders' table */\r\n  lua_createtable(L, sizeof(loaders)/sizeof(loaders[0]) - 1, 0);\r\n  /* fill it with pre-defined loaders */\r\n  for (i=0; loaders[i] != NULL; i++) {\r\n    lua_pushcfunction(L, loaders[i]);\r\n    lua_rawseti(L, -2, i+1);\r\n  }\r\n  lua_setfield(L, -2, \"loaders\");  /* put it in field `loaders' */\r\n  setpath(L, \"path\", LUA_PATH, LUA_PATH_DEFAULT);  /* set field `path' */\r\n  setpath(L, \"cpath\", LUA_CPATH, LUA_CPATH_DEFAULT); /* set field `cpath' */\r\n  /* store config information */\r\n  lua_pushliteral(L, LUA_DIRSEP \"\\n\" LUA_PATHSEP \"\\n\" LUA_PATH_MARK \"\\n\"\r\n                     LUA_EXECDIR \"\\n\" LUA_IGMARK);\r\n  lua_setfield(L, -2, \"config\");\r\n  /* set field `loaded' */\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 2);\r\n  lua_setfield(L, -2, \"loaded\");\r\n  /* set field `preload' */\r\n  lua_newtable(L);\r\n  lua_setfield(L, -2, \"preload\");\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  luaL_register(L, NULL, ll_funcs);  /* open lib into global table */\r\n  lua_pop(L, 1);\r\n  return 1;  /* return 'package' table */\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lobject.c",
    "content": "/*\r\n** $Id: lobject.c,v 2.22.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Some generic functions over Lua objects\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <ctype.h>\r\n#include <stdarg.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define lobject_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldo.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"lvm.h\"\r\n\r\n\r\n\r\nconst TValue luaO_nilobject_ = {{NULL}, LUA_TNIL};\r\n\r\n\r\n/*\r\n** converts an integer to a \"floating point byte\", represented as\r\n** (eeeeexxx), where the real value is (1xxx) * 2^(eeeee - 1) if\r\n** eeeee != 0 and (xxx) otherwise.\r\n*/\r\nint luaO_int2fb (unsigned int x) {\r\n  int e = 0;  /* expoent */\r\n  while (x >= 16) {\r\n    x = (x+1) >> 1;\r\n    e++;\r\n  }\r\n  if (x < 8) return x;\r\n  else return ((e+1) << 3) | (cast_int(x) - 8);\r\n}\r\n\r\n\r\n/* converts back */\r\nint luaO_fb2int (int x) {\r\n  int e = (x >> 3) & 31;\r\n  if (e == 0) return x;\r\n  else return ((x & 7)+8) << (e - 1);\r\n}\r\n\r\n\r\nint luaO_log2 (unsigned int x) {\r\n  static const lu_byte log_2[256] = {\r\n    0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,\r\n    6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,\r\n    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n    7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n    8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8\r\n  };\r\n  int l = -1;\r\n  while (x >= 256) { l += 8; x >>= 8; }\r\n  return l + log_2[x];\r\n\r\n}\r\n\r\n\r\nint luaO_rawequalObj (const TValue *t1, const TValue *t2) {\r\n  if (ttype(t1) != ttype(t2)) return 0;\r\n  else switch (ttype(t1)) {\r\n    case LUA_TNIL:\r\n      return 1;\r\n    case LUA_TNUMBER:\r\n      return luai_numeq(nvalue(t1), nvalue(t2));\r\n    case LUA_TBOOLEAN:\r\n      return bvalue(t1) == bvalue(t2);  /* boolean true must be 1 !! */\r\n    case LUA_TLIGHTUSERDATA:\r\n      return pvalue(t1) == pvalue(t2);\r\n    default:\r\n      lua_assert(iscollectable(t1));\r\n      return gcvalue(t1) == gcvalue(t2);\r\n  }\r\n}\r\n\r\n\r\nint luaO_str2d (const char *s, lua_Number *result) {\r\n  char *endptr;\r\n  *result = lua_str2number(s, &endptr);\r\n  if (endptr == s) return 0;  /* conversion failed */\r\n  if (*endptr == 'x' || *endptr == 'X')  /* maybe an hexadecimal constant? */\r\n    *result = cast_num(strtoul(s, &endptr, 16));\r\n  if (*endptr == '\\0') return 1;  /* most common case */\r\n  while (isspace(cast(unsigned char, *endptr))) endptr++;\r\n  if (*endptr != '\\0') return 0;  /* invalid trailing characters? */\r\n  return 1;\r\n}\r\n\r\n\r\n\r\nstatic void pushstr (lua_State *L, const char *str) {\r\n  setsvalue2s(L, L->top, luaS_new(L, str));\r\n  incr_top(L);\r\n}\r\n\r\n\r\n/* this function handles only `%d', `%c', %f, %p, and `%s' formats */\r\nconst char *luaO_pushvfstring (lua_State *L, const char *fmt, va_list argp) {\r\n  int n = 1;\r\n  pushstr(L, \"\");\r\n  for (;;) {\r\n    const char *e = strchr(fmt, '%');\r\n    if (e == NULL) break;\r\n    setsvalue2s(L, L->top, luaS_newlstr(L, fmt, e-fmt));\r\n    incr_top(L);\r\n    switch (*(e+1)) {\r\n      case 's': {\r\n        const char *s = va_arg(argp, char *);\r\n        if (s == NULL) s = \"(null)\";\r\n        pushstr(L, s);\r\n        break;\r\n      }\r\n      case 'c': {\r\n        char buff[2];\r\n        buff[0] = cast(char, va_arg(argp, int));\r\n        buff[1] = '\\0';\r\n        pushstr(L, buff);\r\n        break;\r\n      }\r\n      case 'd': {\r\n        setnvalue(L->top, cast_num(va_arg(argp, int)));\r\n        incr_top(L);\r\n        break;\r\n      }\r\n      case 'f': {\r\n        setnvalue(L->top, cast_num(va_arg(argp, l_uacNumber)));\r\n        incr_top(L);\r\n        break;\r\n      }\r\n      case 'p': {\r\n        char buff[4*sizeof(void *) + 8]; /* should be enough space for a `%p' */\r\n        sprintf(buff, \"%p\", va_arg(argp, void *));\r\n        pushstr(L, buff);\r\n        break;\r\n      }\r\n      case '%': {\r\n        pushstr(L, \"%\");\r\n        break;\r\n      }\r\n      default: {\r\n        char buff[3];\r\n        buff[0] = '%';\r\n        buff[1] = *(e+1);\r\n        buff[2] = '\\0';\r\n        pushstr(L, buff);\r\n        break;\r\n      }\r\n    }\r\n    n += 2;\r\n    fmt = e+2;\r\n  }\r\n  pushstr(L, fmt);\r\n  luaV_concat(L, n+1, cast_int(L->top - L->base) - 1);\r\n  L->top -= n;\r\n  return svalue(L->top - 1);\r\n}\r\n\r\n\r\nconst char *luaO_pushfstring (lua_State *L, const char *fmt, ...) {\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  msg = luaO_pushvfstring(L, fmt, argp);\r\n  va_end(argp);\r\n  return msg;\r\n}\r\n\r\n\r\nvoid luaO_chunkid (char *out, const char *source, size_t bufflen) {\r\n  if (*source == '=') {\r\n    strncpy(out, source+1, bufflen);  /* remove first char */\r\n    out[bufflen-1] = '\\0';  /* ensures null termination */\r\n  }\r\n  else {  /* out = \"source\", or \"...source\" */\r\n    if (*source == '@') {\r\n      size_t l;\r\n      source++;  /* skip the `@' */\r\n      bufflen -= sizeof(\" '...' \");\r\n      l = strlen(source);\r\n      strcpy(out, \"\");\r\n      if (l > bufflen) {\r\n        source += (l-bufflen);  /* get last part of file name */\r\n        strcat(out, \"...\");\r\n      }\r\n      strcat(out, source);\r\n    }\r\n    else {  /* out = [string \"string\"] */\r\n      size_t len = strcspn(source, \"\\n\\r\");  /* stop at first newline */\r\n      bufflen -= sizeof(\" [string \\\"...\\\"] \");\r\n      if (len > bufflen) len = bufflen;\r\n      strcpy(out, \"[string \\\"\");\r\n      if (source[len] != '\\0') {  /* must truncate? */\r\n        strncat(out, source, len);\r\n        strcat(out, \"...\");\r\n      }\r\n      else\r\n        strcat(out, source);\r\n      strcat(out, \"\\\"]\");\r\n    }\r\n  }\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lobject.h",
    "content": "/*\r\n** $Id: lobject.h,v 2.20.1.2 2008/08/06 13:29:48 roberto Exp $\r\n** Type definitions for Lua objects\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lobject_h\r\n#define lobject_h\r\n\r\n\r\n#include <stdarg.h>\r\n\r\n\r\n#include \"llimits.h\"\r\n#include \"lua.h\"\r\n\r\n\r\n/* tags for values visible from Lua */\r\n#define LAST_TAG\tLUA_TTHREAD\r\n\r\n#define NUM_TAGS\t(LAST_TAG+1)\r\n\r\n\r\n/*\r\n** Extra tags for non-values\r\n*/\r\n#define LUA_TPROTO\t(LAST_TAG+1)\r\n#define LUA_TUPVAL\t(LAST_TAG+2)\r\n#define LUA_TDEADKEY\t(LAST_TAG+3)\r\n\r\n\r\n/*\r\n** Union of all collectable objects\r\n*/\r\ntypedef union GCObject GCObject;\r\n\r\n\r\n/*\r\n** Common Header for all collectable objects (in macro form, to be\r\n** included in other objects)\r\n*/\r\n#define CommonHeader\tGCObject *next; lu_byte tt; lu_byte marked\r\n\r\n\r\n/*\r\n** Common header in struct form\r\n*/\r\ntypedef struct GCheader {\r\n  CommonHeader;\r\n} GCheader;\r\n\r\n\r\n\r\n\r\n/*\r\n** Union of all Lua values\r\n*/\r\ntypedef union {\r\n  GCObject *gc;\r\n  void *p;\r\n  lua_Number n;\r\n  int b;\r\n} Value;\r\n\r\n\r\n/*\r\n** Tagged Values\r\n*/\r\n\r\n#define TValuefields\tValue value; int tt\r\n\r\ntypedef struct lua_TValue {\r\n  TValuefields;\r\n} TValue;\r\n\r\n\r\n/* Macros to test type */\r\n#define ttisnil(o)\t(ttype(o) == LUA_TNIL)\r\n#define ttisnumber(o)\t(ttype(o) == LUA_TNUMBER)\r\n#define ttisstring(o)\t(ttype(o) == LUA_TSTRING)\r\n#define ttistable(o)\t(ttype(o) == LUA_TTABLE)\r\n#define ttisfunction(o)\t(ttype(o) == LUA_TFUNCTION)\r\n#define ttisboolean(o)\t(ttype(o) == LUA_TBOOLEAN)\r\n#define ttisuserdata(o)\t(ttype(o) == LUA_TUSERDATA)\r\n#define ttisthread(o)\t(ttype(o) == LUA_TTHREAD)\r\n#define ttislightuserdata(o)\t(ttype(o) == LUA_TLIGHTUSERDATA)\r\n\r\n/* Macros to access values */\r\n#define ttype(o)\t((o)->tt)\r\n#define gcvalue(o)\tcheck_exp(iscollectable(o), (o)->value.gc)\r\n#define pvalue(o)\tcheck_exp(ttislightuserdata(o), (o)->value.p)\r\n#define nvalue(o)\tcheck_exp(ttisnumber(o), (o)->value.n)\r\n#define rawtsvalue(o)\tcheck_exp(ttisstring(o), &(o)->value.gc->ts)\r\n#define tsvalue(o)\t(&rawtsvalue(o)->tsv)\r\n#define rawuvalue(o)\tcheck_exp(ttisuserdata(o), &(o)->value.gc->u)\r\n#define uvalue(o)\t(&rawuvalue(o)->uv)\r\n#define clvalue(o)\tcheck_exp(ttisfunction(o), &(o)->value.gc->cl)\r\n#define hvalue(o)\tcheck_exp(ttistable(o), &(o)->value.gc->h)\r\n#define bvalue(o)\tcheck_exp(ttisboolean(o), (o)->value.b)\r\n#define thvalue(o)\tcheck_exp(ttisthread(o), &(o)->value.gc->th)\r\n\r\n#define l_isfalse(o)\t(ttisnil(o) || (ttisboolean(o) && bvalue(o) == 0))\r\n\r\n/*\r\n** for internal debug only\r\n*/\r\n#define checkconsistency(obj) \\\r\n  lua_assert(!iscollectable(obj) || (ttype(obj) == (obj)->value.gc->gch.tt))\r\n\r\n#define checkliveness(g,obj) \\\r\n  lua_assert(!iscollectable(obj) || \\\r\n  ((ttype(obj) == (obj)->value.gc->gch.tt) && !isdead(g, (obj)->value.gc)))\r\n\r\n\r\n/* Macros to set values */\r\n#define setnilvalue(obj) ((obj)->tt=LUA_TNIL)\r\n\r\n#define setnvalue(obj,x) \\\r\n  { TValue *i_o=(obj); i_o->value.n=(x); i_o->tt=LUA_TNUMBER; }\r\n\r\n#define setpvalue(obj,x) \\\r\n  { TValue *i_o=(obj); i_o->value.p=(x); i_o->tt=LUA_TLIGHTUSERDATA; }\r\n\r\n#define setbvalue(obj,x) \\\r\n  { TValue *i_o=(obj); i_o->value.b=(x); i_o->tt=LUA_TBOOLEAN; }\r\n\r\n#define setsvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TSTRING; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n#define setuvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TUSERDATA; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n#define setthvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTHREAD; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n#define setclvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TFUNCTION; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n#define sethvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TTABLE; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n#define setptvalue(L,obj,x) \\\r\n  { TValue *i_o=(obj); \\\r\n    i_o->value.gc=cast(GCObject *, (x)); i_o->tt=LUA_TPROTO; \\\r\n    checkliveness(G(L),i_o); }\r\n\r\n\r\n\r\n\r\n#define setobj(L,obj1,obj2) \\\r\n  { const TValue *o2=(obj2); TValue *o1=(obj1); \\\r\n    o1->value = o2->value; o1->tt=o2->tt; \\\r\n    checkliveness(G(L),o1); }\r\n\r\n\r\n/*\r\n** different types of sets, according to destination\r\n*/\r\n\r\n/* from stack to (same) stack */\r\n#define setobjs2s\tsetobj\r\n/* to stack (not from same stack) */\r\n#define setobj2s\tsetobj\r\n#define setsvalue2s\tsetsvalue\r\n#define sethvalue2s\tsethvalue\r\n#define setptvalue2s\tsetptvalue\r\n/* from table to same table */\r\n#define setobjt2t\tsetobj\r\n/* to table */\r\n#define setobj2t\tsetobj\r\n/* to new object */\r\n#define setobj2n\tsetobj\r\n#define setsvalue2n\tsetsvalue\r\n\r\n#define setttype(obj, tt) (ttype(obj) = (tt))\r\n\r\n\r\n#define iscollectable(o)\t(ttype(o) >= LUA_TSTRING)\r\n\r\n\r\n\r\ntypedef TValue *StkId;  /* index to stack elements */\r\n\r\n\r\n/*\r\n** String headers for string table\r\n*/\r\ntypedef union TString {\r\n  L_Umaxalign dummy;  /* ensures maximum alignment for strings */\r\n  struct {\r\n    CommonHeader;\r\n    lu_byte reserved;\r\n    unsigned int hash;\r\n    size_t len;\r\n  } tsv;\r\n} TString;\r\n\r\n\r\n#define getstr(ts)\tcast(const char *, (ts) + 1)\r\n#define svalue(o)       getstr(rawtsvalue(o))\r\n\r\n\r\n\r\ntypedef union Udata {\r\n  L_Umaxalign dummy;  /* ensures maximum alignment for `local' udata */\r\n  struct {\r\n    CommonHeader;\r\n    struct Table *metatable;\r\n    struct Table *env;\r\n    size_t len;\r\n  } uv;\r\n} Udata;\r\n\r\n\r\n\r\n\r\n/*\r\n** Function Prototypes\r\n*/\r\ntypedef struct Proto {\r\n  CommonHeader;\r\n  TValue *k;  /* constants used by the function */\r\n  Instruction *code;\r\n  struct Proto **p;  /* functions defined inside the function */\r\n  int *lineinfo;  /* map from opcodes to source lines */\r\n  struct LocVar *locvars;  /* information about local variables */\r\n  TString **upvalues;  /* upvalue names */\r\n  TString  *source;\r\n  int sizeupvalues;\r\n  int sizek;  /* size of `k' */\r\n  int sizecode;\r\n  int sizelineinfo;\r\n  int sizep;  /* size of `p' */\r\n  int sizelocvars;\r\n  int linedefined;\r\n  int lastlinedefined;\r\n  GCObject *gclist;\r\n  lu_byte nups;  /* number of upvalues */\r\n  lu_byte numparams;\r\n  lu_byte is_vararg;\r\n  lu_byte maxstacksize;\r\n} Proto;\r\n\r\n\r\n/* masks for new-style vararg */\r\n#define VARARG_HASARG\t\t1\r\n#define VARARG_ISVARARG\t\t2\r\n#define VARARG_NEEDSARG\t\t4\r\n\r\n\r\ntypedef struct LocVar {\r\n  TString *varname;\r\n  int startpc;  /* first point where variable is active */\r\n  int endpc;    /* first point where variable is dead */\r\n} LocVar;\r\n\r\n\r\n\r\n/*\r\n** Upvalues\r\n*/\r\n\r\ntypedef struct UpVal {\r\n  CommonHeader;\r\n  TValue *v;  /* points to stack or to its own value */\r\n  union {\r\n    TValue value;  /* the value (when closed) */\r\n    struct {  /* double linked list (when open) */\r\n      struct UpVal *prev;\r\n      struct UpVal *next;\r\n    } l;\r\n  } u;\r\n} UpVal;\r\n\r\n\r\n/*\r\n** Closures\r\n*/\r\n\r\n#define ClosureHeader \\\r\n\tCommonHeader; lu_byte isC; lu_byte nupvalues; GCObject *gclist; \\\r\n\tstruct Table *env\r\n\r\ntypedef struct CClosure {\r\n  ClosureHeader;\r\n  lua_CFunction f;\r\n  TValue upvalue[1];\r\n} CClosure;\r\n\r\n\r\ntypedef struct LClosure {\r\n  ClosureHeader;\r\n  struct Proto *p;\r\n  UpVal *upvals[1];\r\n} LClosure;\r\n\r\n\r\ntypedef union Closure {\r\n  CClosure c;\r\n  LClosure l;\r\n} Closure;\r\n\r\n\r\n#define iscfunction(o)\t(ttype(o) == LUA_TFUNCTION && clvalue(o)->c.isC)\r\n#define isLfunction(o)\t(ttype(o) == LUA_TFUNCTION && !clvalue(o)->c.isC)\r\n\r\n\r\n/*\r\n** Tables\r\n*/\r\n\r\ntypedef union TKey {\r\n  struct {\r\n    TValuefields;\r\n    struct Node *next;  /* for chaining */\r\n  } nk;\r\n  TValue tvk;\r\n} TKey;\r\n\r\n\r\ntypedef struct Node {\r\n  TValue i_val;\r\n  TKey i_key;\r\n} Node;\r\n\r\n\r\ntypedef struct Table {\r\n  CommonHeader;\r\n  lu_byte flags;  /* 1<<p means tagmethod(p) is not present */ \r\n  lu_byte lsizenode;  /* log2 of size of `node' array */\r\n  struct Table *metatable;\r\n  TValue *array;  /* array part */\r\n  Node *node;\r\n  Node *lastfree;  /* any free position is before this position */\r\n  GCObject *gclist;\r\n  int sizearray;  /* size of `array' array */\r\n} Table;\r\n\r\n\r\n\r\n/*\r\n** `module' operation for hashing (size is always a power of 2)\r\n*/\r\n#define lmod(s,size) \\\r\n\t(check_exp((size&(size-1))==0, (cast(int, (s) & ((size)-1)))))\r\n\r\n\r\n#define twoto(x)\t(1<<(x))\r\n#define sizenode(t)\t(twoto((t)->lsizenode))\r\n\r\n\r\n#define luaO_nilobject\t\t(&luaO_nilobject_)\r\n\r\nLUAI_DATA const TValue luaO_nilobject_;\r\n\r\n#define ceillog2(x)\t(luaO_log2((x)-1) + 1)\r\n\r\nLUAI_FUNC int luaO_log2 (unsigned int x);\r\nLUAI_FUNC int luaO_int2fb (unsigned int x);\r\nLUAI_FUNC int luaO_fb2int (int x);\r\nLUAI_FUNC int luaO_rawequalObj (const TValue *t1, const TValue *t2);\r\nLUAI_FUNC int luaO_str2d (const char *s, lua_Number *result);\r\nLUAI_FUNC const char *luaO_pushvfstring (lua_State *L, const char *fmt,\r\n                                                       va_list argp);\r\nLUAI_FUNC const char *luaO_pushfstring (lua_State *L, const char *fmt, ...);\r\nLUAI_FUNC void luaO_chunkid (char *out, const char *source, size_t len);\r\n\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lopcodes.c",
    "content": "/*\r\n** $Id: lopcodes.c,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#define lopcodes_c\r\n#define LUA_CORE\r\n\r\n\r\n#include \"lopcodes.h\"\r\n\r\n\r\n/* ORDER OP */\r\n\r\nconst char *const luaP_opnames[NUM_OPCODES+1] = {\r\n  \"MOVE\",\r\n  \"LOADK\",\r\n  \"LOADBOOL\",\r\n  \"LOADNIL\",\r\n  \"GETUPVAL\",\r\n  \"GETGLOBAL\",\r\n  \"GETTABLE\",\r\n  \"SETGLOBAL\",\r\n  \"SETUPVAL\",\r\n  \"SETTABLE\",\r\n  \"NEWTABLE\",\r\n  \"SELF\",\r\n  \"ADD\",\r\n  \"SUB\",\r\n  \"MUL\",\r\n  \"DIV\",\r\n  \"MOD\",\r\n  \"POW\",\r\n  \"UNM\",\r\n  \"NOT\",\r\n  \"LEN\",\r\n  \"CONCAT\",\r\n  \"JMP\",\r\n  \"EQ\",\r\n  \"LT\",\r\n  \"LE\",\r\n  \"TEST\",\r\n  \"TESTSET\",\r\n  \"CALL\",\r\n  \"TAILCALL\",\r\n  \"RETURN\",\r\n  \"FORLOOP\",\r\n  \"FORPREP\",\r\n  \"TFORLOOP\",\r\n  \"SETLIST\",\r\n  \"CLOSE\",\r\n  \"CLOSURE\",\r\n  \"VARARG\",\r\n  NULL\r\n};\r\n\r\n\r\n#define opmode(t,a,b,c,m) (((t)<<7) | ((a)<<6) | ((b)<<4) | ((c)<<2) | (m))\r\n\r\nconst lu_byte luaP_opmodes[NUM_OPCODES] = {\r\n/*       T  A    B       C     mode\t\t   opcode\t*/\r\n  opmode(0, 1, OpArgR, OpArgN, iABC) \t\t/* OP_MOVE */\r\n ,opmode(0, 1, OpArgK, OpArgN, iABx)\t\t/* OP_LOADK */\r\n ,opmode(0, 1, OpArgU, OpArgU, iABC)\t\t/* OP_LOADBOOL */\r\n ,opmode(0, 1, OpArgR, OpArgN, iABC)\t\t/* OP_LOADNIL */\r\n ,opmode(0, 1, OpArgU, OpArgN, iABC)\t\t/* OP_GETUPVAL */\r\n ,opmode(0, 1, OpArgK, OpArgN, iABx)\t\t/* OP_GETGLOBAL */\r\n ,opmode(0, 1, OpArgR, OpArgK, iABC)\t\t/* OP_GETTABLE */\r\n ,opmode(0, 0, OpArgK, OpArgN, iABx)\t\t/* OP_SETGLOBAL */\r\n ,opmode(0, 0, OpArgU, OpArgN, iABC)\t\t/* OP_SETUPVAL */\r\n ,opmode(0, 0, OpArgK, OpArgK, iABC)\t\t/* OP_SETTABLE */\r\n ,opmode(0, 1, OpArgU, OpArgU, iABC)\t\t/* OP_NEWTABLE */\r\n ,opmode(0, 1, OpArgR, OpArgK, iABC)\t\t/* OP_SELF */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_ADD */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_SUB */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_MUL */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_DIV */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_MOD */\r\n ,opmode(0, 1, OpArgK, OpArgK, iABC)\t\t/* OP_POW */\r\n ,opmode(0, 1, OpArgR, OpArgN, iABC)\t\t/* OP_UNM */\r\n ,opmode(0, 1, OpArgR, OpArgN, iABC)\t\t/* OP_NOT */\r\n ,opmode(0, 1, OpArgR, OpArgN, iABC)\t\t/* OP_LEN */\r\n ,opmode(0, 1, OpArgR, OpArgR, iABC)\t\t/* OP_CONCAT */\r\n ,opmode(0, 0, OpArgR, OpArgN, iAsBx)\t\t/* OP_JMP */\r\n ,opmode(1, 0, OpArgK, OpArgK, iABC)\t\t/* OP_EQ */\r\n ,opmode(1, 0, OpArgK, OpArgK, iABC)\t\t/* OP_LT */\r\n ,opmode(1, 0, OpArgK, OpArgK, iABC)\t\t/* OP_LE */\r\n ,opmode(1, 1, OpArgR, OpArgU, iABC)\t\t/* OP_TEST */\r\n ,opmode(1, 1, OpArgR, OpArgU, iABC)\t\t/* OP_TESTSET */\r\n ,opmode(0, 1, OpArgU, OpArgU, iABC)\t\t/* OP_CALL */\r\n ,opmode(0, 1, OpArgU, OpArgU, iABC)\t\t/* OP_TAILCALL */\r\n ,opmode(0, 0, OpArgU, OpArgN, iABC)\t\t/* OP_RETURN */\r\n ,opmode(0, 1, OpArgR, OpArgN, iAsBx)\t\t/* OP_FORLOOP */\r\n ,opmode(0, 1, OpArgR, OpArgN, iAsBx)\t\t/* OP_FORPREP */\r\n ,opmode(1, 0, OpArgN, OpArgU, iABC)\t\t/* OP_TFORLOOP */\r\n ,opmode(0, 0, OpArgU, OpArgU, iABC)\t\t/* OP_SETLIST */\r\n ,opmode(0, 0, OpArgN, OpArgN, iABC)\t\t/* OP_CLOSE */\r\n ,opmode(0, 1, OpArgU, OpArgN, iABx)\t\t/* OP_CLOSURE */\r\n ,opmode(0, 1, OpArgU, OpArgN, iABC)\t\t/* OP_VARARG */\r\n};\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lopcodes.h",
    "content": "/*\r\n** $Id: lopcodes.h,v 1.125.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Opcodes for Lua virtual machine\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lopcodes_h\r\n#define lopcodes_h\r\n\r\n#include \"llimits.h\"\r\n\r\n\r\n/*===========================================================================\r\n  We assume that instructions are unsigned numbers.\r\n  All instructions have an opcode in the first 6 bits.\r\n  Instructions can have the following fields:\r\n\t`A' : 8 bits\r\n\t`B' : 9 bits\r\n\t`C' : 9 bits\r\n\t`Bx' : 18 bits (`B' and `C' together)\r\n\t`sBx' : signed Bx\r\n\r\n  A signed argument is represented in excess K; that is, the number\r\n  value is the unsigned value minus K. K is exactly the maximum value\r\n  for that argument (so that -max is represented by 0, and +max is\r\n  represented by 2*max), which is half the maximum for the corresponding\r\n  unsigned argument.\r\n===========================================================================*/\r\n\r\n\r\nenum OpMode {iABC, iABx, iAsBx};  /* basic instruction format */\r\n\r\n\r\n/*\r\n** size and position of opcode arguments.\r\n*/\r\n#define SIZE_C\t\t9\r\n#define SIZE_B\t\t9\r\n#define SIZE_Bx\t\t(SIZE_C + SIZE_B)\r\n#define SIZE_A\t\t8\r\n\r\n#define SIZE_OP\t\t6\r\n\r\n#define POS_OP\t\t0\r\n#define POS_A\t\t(POS_OP + SIZE_OP)\r\n#define POS_C\t\t(POS_A + SIZE_A)\r\n#define POS_B\t\t(POS_C + SIZE_C)\r\n#define POS_Bx\t\tPOS_C\r\n\r\n\r\n/*\r\n** limits for opcode arguments.\r\n** we use (signed) int to manipulate most arguments,\r\n** so they must fit in LUAI_BITSINT-1 bits (-1 for sign)\r\n*/\r\n#if SIZE_Bx < LUAI_BITSINT-1\r\n#define MAXARG_Bx        ((1<<SIZE_Bx)-1)\r\n#define MAXARG_sBx        (MAXARG_Bx>>1)         /* `sBx' is signed */\r\n#else\r\n#define MAXARG_Bx        MAX_INT\r\n#define MAXARG_sBx        MAX_INT\r\n#endif\r\n\r\n\r\n#define MAXARG_A        ((1<<SIZE_A)-1)\r\n#define MAXARG_B        ((1<<SIZE_B)-1)\r\n#define MAXARG_C        ((1<<SIZE_C)-1)\r\n\r\n\r\n/* creates a mask with `n' 1 bits at position `p' */\r\n#define MASK1(n,p)\t((~((~(Instruction)0)<<n))<<p)\r\n\r\n/* creates a mask with `n' 0 bits at position `p' */\r\n#define MASK0(n,p)\t(~MASK1(n,p))\r\n\r\n/*\r\n** the following macros help to manipulate instructions\r\n*/\r\n\r\n#define GET_OPCODE(i)\t(cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0)))\r\n#define SET_OPCODE(i,o)\t((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \\\r\n\t\t((cast(Instruction, o)<<POS_OP)&MASK1(SIZE_OP,POS_OP))))\r\n\r\n#define GETARG_A(i)\t(cast(int, ((i)>>POS_A) & MASK1(SIZE_A,0)))\r\n#define SETARG_A(i,u)\t((i) = (((i)&MASK0(SIZE_A,POS_A)) | \\\r\n\t\t((cast(Instruction, u)<<POS_A)&MASK1(SIZE_A,POS_A))))\r\n\r\n#define GETARG_B(i)\t(cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0)))\r\n#define SETARG_B(i,b)\t((i) = (((i)&MASK0(SIZE_B,POS_B)) | \\\r\n\t\t((cast(Instruction, b)<<POS_B)&MASK1(SIZE_B,POS_B))))\r\n\r\n#define GETARG_C(i)\t(cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0)))\r\n#define SETARG_C(i,b)\t((i) = (((i)&MASK0(SIZE_C,POS_C)) | \\\r\n\t\t((cast(Instruction, b)<<POS_C)&MASK1(SIZE_C,POS_C))))\r\n\r\n#define GETARG_Bx(i)\t(cast(int, ((i)>>POS_Bx) & MASK1(SIZE_Bx,0)))\r\n#define SETARG_Bx(i,b)\t((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \\\r\n\t\t((cast(Instruction, b)<<POS_Bx)&MASK1(SIZE_Bx,POS_Bx))))\r\n\r\n#define GETARG_sBx(i)\t(GETARG_Bx(i)-MAXARG_sBx)\r\n#define SETARG_sBx(i,b)\tSETARG_Bx((i),cast(unsigned int, (b)+MAXARG_sBx))\r\n\r\n\r\n#define CREATE_ABC(o,a,b,c)\t((cast(Instruction, o)<<POS_OP) \\\r\n\t\t\t| (cast(Instruction, a)<<POS_A) \\\r\n\t\t\t| (cast(Instruction, b)<<POS_B) \\\r\n\t\t\t| (cast(Instruction, c)<<POS_C))\r\n\r\n#define CREATE_ABx(o,a,bc)\t((cast(Instruction, o)<<POS_OP) \\\r\n\t\t\t| (cast(Instruction, a)<<POS_A) \\\r\n\t\t\t| (cast(Instruction, bc)<<POS_Bx))\r\n\r\n\r\n/*\r\n** Macros to operate RK indices\r\n*/\r\n\r\n/* this bit 1 means constant (0 means register) */\r\n#define BITRK\t\t(1 << (SIZE_B - 1))\r\n\r\n/* test whether value is a constant */\r\n#define ISK(x)\t\t((x) & BITRK)\r\n\r\n/* gets the index of the constant */\r\n#define INDEXK(r)\t((int)(r) & ~BITRK)\r\n\r\n#define MAXINDEXRK\t(BITRK - 1)\r\n\r\n/* code a constant index as a RK value */\r\n#define RKASK(x)\t((x) | BITRK)\r\n\r\n\r\n/*\r\n** invalid register that fits in 8 bits\r\n*/\r\n#define NO_REG\t\tMAXARG_A\r\n\r\n\r\n/*\r\n** R(x) - register\r\n** Kst(x) - constant (in constant table)\r\n** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x)\r\n*/\r\n\r\n\r\n/*\r\n** grep \"ORDER OP\" if you change these enums\r\n*/\r\n\r\ntypedef enum {\r\n/*----------------------------------------------------------------------\r\nname\t\targs\tdescription\r\n------------------------------------------------------------------------*/\r\nOP_MOVE,/*\tA B\tR(A) := R(B)\t\t\t\t\t*/\r\nOP_LOADK,/*\tA Bx\tR(A) := Kst(Bx)\t\t\t\t\t*/\r\nOP_LOADBOOL,/*\tA B C\tR(A) := (Bool)B; if (C) pc++\t\t\t*/\r\nOP_LOADNIL,/*\tA B\tR(A) := ... := R(B) := nil\t\t\t*/\r\nOP_GETUPVAL,/*\tA B\tR(A) := UpValue[B]\t\t\t\t*/\r\n\r\nOP_GETGLOBAL,/*\tA Bx\tR(A) := Gbl[Kst(Bx)]\t\t\t\t*/\r\nOP_GETTABLE,/*\tA B C\tR(A) := R(B)[RK(C)]\t\t\t\t*/\r\n\r\nOP_SETGLOBAL,/*\tA Bx\tGbl[Kst(Bx)] := R(A)\t\t\t\t*/\r\nOP_SETUPVAL,/*\tA B\tUpValue[B] := R(A)\t\t\t\t*/\r\nOP_SETTABLE,/*\tA B C\tR(A)[RK(B)] := RK(C)\t\t\t\t*/\r\n\r\nOP_NEWTABLE,/*\tA B C\tR(A) := {} (size = B,C)\t\t\t\t*/\r\n\r\nOP_SELF,/*\tA B C\tR(A+1) := R(B); R(A) := R(B)[RK(C)]\t\t*/\r\n\r\nOP_ADD,/*\tA B C\tR(A) := RK(B) + RK(C)\t\t\t\t*/\r\nOP_SUB,/*\tA B C\tR(A) := RK(B) - RK(C)\t\t\t\t*/\r\nOP_MUL,/*\tA B C\tR(A) := RK(B) * RK(C)\t\t\t\t*/\r\nOP_DIV,/*\tA B C\tR(A) := RK(B) / RK(C)\t\t\t\t*/\r\nOP_MOD,/*\tA B C\tR(A) := RK(B) % RK(C)\t\t\t\t*/\r\nOP_POW,/*\tA B C\tR(A) := RK(B) ^ RK(C)\t\t\t\t*/\r\nOP_UNM,/*\tA B\tR(A) := -R(B)\t\t\t\t\t*/\r\nOP_NOT,/*\tA B\tR(A) := not R(B)\t\t\t\t*/\r\nOP_LEN,/*\tA B\tR(A) := length of R(B)\t\t\t\t*/\r\n\r\nOP_CONCAT,/*\tA B C\tR(A) := R(B).. ... ..R(C)\t\t\t*/\r\n\r\nOP_JMP,/*\tsBx\tpc+=sBx\t\t\t\t\t*/\r\n\r\nOP_EQ,/*\tA B C\tif ((RK(B) == RK(C)) ~= A) then pc++\t\t*/\r\nOP_LT,/*\tA B C\tif ((RK(B) <  RK(C)) ~= A) then pc++  \t\t*/\r\nOP_LE,/*\tA B C\tif ((RK(B) <= RK(C)) ~= A) then pc++  \t\t*/\r\n\r\nOP_TEST,/*\tA C\tif not (R(A) <=> C) then pc++\t\t\t*/ \r\nOP_TESTSET,/*\tA B C\tif (R(B) <=> C) then R(A) := R(B) else pc++\t*/ \r\n\r\nOP_CALL,/*\tA B C\tR(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1)) */\r\nOP_TAILCALL,/*\tA B C\treturn R(A)(R(A+1), ... ,R(A+B-1))\t\t*/\r\nOP_RETURN,/*\tA B\treturn R(A), ... ,R(A+B-2)\t(see note)\t*/\r\n\r\nOP_FORLOOP,/*\tA sBx\tR(A)+=R(A+2);\r\n\t\t\tif R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }*/\r\nOP_FORPREP,/*\tA sBx\tR(A)-=R(A+2); pc+=sBx\t\t\t\t*/\r\n\r\nOP_TFORLOOP,/*\tA C\tR(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); \r\n                        if R(A+3) ~= nil then R(A+2)=R(A+3) else pc++\t*/ \r\nOP_SETLIST,/*\tA B C\tR(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B\t*/\r\n\r\nOP_CLOSE,/*\tA \tclose all variables in the stack up to (>=) R(A)*/\r\nOP_CLOSURE,/*\tA Bx\tR(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n))\t*/\r\n\r\nOP_VARARG/*\tA B\tR(A), R(A+1), ..., R(A+B-1) = vararg\t\t*/\r\n} OpCode;\r\n\r\n\r\n#define NUM_OPCODES\t(cast(int, OP_VARARG) + 1)\r\n\r\n\r\n\r\n/*===========================================================================\r\n  Notes:\r\n  (*) In OP_CALL, if (B == 0) then B = top. C is the number of returns - 1,\r\n      and can be 0: OP_CALL then sets `top' to last_result+1, so\r\n      next open instruction (OP_CALL, OP_RETURN, OP_SETLIST) may use `top'.\r\n\r\n  (*) In OP_VARARG, if (B == 0) then use actual number of varargs and\r\n      set top (like in OP_CALL with C == 0).\r\n\r\n  (*) In OP_RETURN, if (B == 0) then return up to `top'\r\n\r\n  (*) In OP_SETLIST, if (B == 0) then B = `top';\r\n      if (C == 0) then next `instruction' is real C\r\n\r\n  (*) For comparisons, A specifies what condition the test should accept\r\n      (true or false).\r\n\r\n  (*) All `skips' (pc++) assume that next instruction is a jump\r\n===========================================================================*/\r\n\r\n\r\n/*\r\n** masks for instruction properties. The format is:\r\n** bits 0-1: op mode\r\n** bits 2-3: C arg mode\r\n** bits 4-5: B arg mode\r\n** bit 6: instruction set register A\r\n** bit 7: operator is a test\r\n*/  \r\n\r\nenum OpArgMask {\r\n  OpArgN,  /* argument is not used */\r\n  OpArgU,  /* argument is used */\r\n  OpArgR,  /* argument is a register or a jump offset */\r\n  OpArgK   /* argument is a constant or register/constant */\r\n};\r\n\r\nLUAI_DATA const lu_byte luaP_opmodes[NUM_OPCODES];\r\n\r\n#define getOpMode(m)\t(cast(enum OpMode, luaP_opmodes[m] & 3))\r\n#define getBMode(m)\t(cast(enum OpArgMask, (luaP_opmodes[m] >> 4) & 3))\r\n#define getCMode(m)\t(cast(enum OpArgMask, (luaP_opmodes[m] >> 2) & 3))\r\n#define testAMode(m)\t(luaP_opmodes[m] & (1 << 6))\r\n#define testTMode(m)\t(luaP_opmodes[m] & (1 << 7))\r\n\r\n\r\nLUAI_DATA const char *const luaP_opnames[NUM_OPCODES+1];  /* opcode names */\r\n\r\n\r\n/* number of list items to accumulate before a SETLIST instruction */\r\n#define LFIELDS_PER_FLUSH\t50\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/loslib.c",
    "content": "/*\r\n** $Id: loslib.c,v 1.19.1.3 2008/01/18 16:38:18 roberto Exp $\r\n** Standard Operating System library\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <errno.h>\r\n#include <locale.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <time.h>\r\n\r\n#define loslib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\nstatic int os_pushresult (lua_State *L, int i, const char *filename) {\r\n  int en = errno;  /* calls to Lua API may change this value */\r\n  if (i) {\r\n    lua_pushboolean(L, 1);\r\n    return 1;\r\n  }\r\n  else {\r\n    lua_pushnil(L);\r\n    lua_pushfstring(L, \"%s: %s\", filename, strerror(en));\r\n    lua_pushinteger(L, en);\r\n    return 3;\r\n  }\r\n}\r\n\r\n\r\nstatic int os_execute (lua_State *L) {\r\n  lua_pushinteger(L, system(luaL_optstring(L, 1, NULL)));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_remove (lua_State *L) {\r\n  const char *filename = luaL_checkstring(L, 1);\r\n  return os_pushresult(L, remove(filename) == 0, filename);\r\n}\r\n\r\n\r\nstatic int os_rename (lua_State *L) {\r\n  const char *fromname = luaL_checkstring(L, 1);\r\n  const char *toname = luaL_checkstring(L, 2);\r\n  return os_pushresult(L, rename(fromname, toname) == 0, fromname);\r\n}\r\n\r\n\r\nstatic int os_tmpname (lua_State *L) {\r\n  char buff[LUA_TMPNAMBUFSIZE];\r\n  int err;\r\n  lua_tmpnam(buff, err);\r\n  if (err)\r\n    return luaL_error(L, \"unable to generate a unique filename\");\r\n  lua_pushstring(L, buff);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_getenv (lua_State *L) {\r\n  lua_pushstring(L, getenv(luaL_checkstring(L, 1)));  /* if NULL push nil */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_clock (lua_State *L) {\r\n  lua_pushnumber(L, ((lua_Number)clock())/(lua_Number)CLOCKS_PER_SEC);\r\n  return 1;\r\n}\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Time/Date operations\r\n** { year=%Y, month=%m, day=%d, hour=%H, min=%M, sec=%S,\r\n**   wday=%w+1, yday=%j, isdst=? }\r\n** =======================================================\r\n*/\r\n\r\nstatic void setfield (lua_State *L, const char *key, int value) {\r\n  lua_pushinteger(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic void setboolfield (lua_State *L, const char *key, int value) {\r\n  if (value < 0)  /* undefined? */\r\n    return;  /* does not set field */\r\n  lua_pushboolean(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic int getboolfield (lua_State *L, const char *key) {\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\n\r\nstatic int getfield (lua_State *L, const char *key, int d) {\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  if (lua_isnumber(L, -1))\r\n    res = (int)lua_tointeger(L, -1);\r\n  else {\r\n    if (d < 0)\r\n      return luaL_error(L, \"field \" LUA_QS \" missing in date table\", key);\r\n    res = d;\r\n  }\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\n\r\nstatic int os_date (lua_State *L) {\r\n  const char *s = luaL_optstring(L, 1, \"%c\");\r\n  time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));\r\n  struct tm *stm;\r\n  if (*s == '!') {  /* UTC? */\r\n    stm = gmtime(&t);\r\n    s++;  /* skip `!' */\r\n  }\r\n  else\r\n    stm = localtime(&t);\r\n  if (stm == NULL)  /* invalid date? */\r\n    lua_pushnil(L);\r\n  else if (strcmp(s, \"*t\") == 0) {\r\n    lua_createtable(L, 0, 9);  /* 9 = number of fields */\r\n    setfield(L, \"sec\", stm->tm_sec);\r\n    setfield(L, \"min\", stm->tm_min);\r\n    setfield(L, \"hour\", stm->tm_hour);\r\n    setfield(L, \"day\", stm->tm_mday);\r\n    setfield(L, \"month\", stm->tm_mon+1);\r\n    setfield(L, \"year\", stm->tm_year+1900);\r\n    setfield(L, \"wday\", stm->tm_wday+1);\r\n    setfield(L, \"yday\", stm->tm_yday+1);\r\n    setboolfield(L, \"isdst\", stm->tm_isdst);\r\n  }\r\n  else {\r\n    char cc[3];\r\n    luaL_Buffer b;\r\n    cc[0] = '%'; cc[2] = '\\0';\r\n    luaL_buffinit(L, &b);\r\n    for (; *s; s++) {\r\n      if (*s != '%' || *(s + 1) == '\\0')  /* no conversion specifier? */\r\n        luaL_addchar(&b, *s);\r\n      else {\r\n        size_t reslen;\r\n        char buff[200];  /* should be big enough for any conversion result */\r\n        cc[1] = *(++s);\r\n        reslen = strftime(buff, sizeof(buff), cc, stm);\r\n        luaL_addlstring(&b, buff, reslen);\r\n      }\r\n    }\r\n    luaL_pushresult(&b);\r\n  }\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_time (lua_State *L) {\r\n  time_t t;\r\n  if (lua_isnoneornil(L, 1))  /* called without args? */\r\n    t = time(NULL);  /* get current time */\r\n  else {\r\n    struct tm ts;\r\n    luaL_checktype(L, 1, LUA_TTABLE);\r\n    lua_settop(L, 1);  /* make sure table is at the top */\r\n    ts.tm_sec = getfield(L, \"sec\", 0);\r\n    ts.tm_min = getfield(L, \"min\", 0);\r\n    ts.tm_hour = getfield(L, \"hour\", 12);\r\n    ts.tm_mday = getfield(L, \"day\", -1);\r\n    ts.tm_mon = getfield(L, \"month\", -1) - 1;\r\n    ts.tm_year = getfield(L, \"year\", -1) - 1900;\r\n    ts.tm_isdst = getboolfield(L, \"isdst\");\r\n    t = mktime(&ts);\r\n  }\r\n  if (t == (time_t)(-1))\r\n    lua_pushnil(L);\r\n  else\r\n    lua_pushnumber(L, (lua_Number)t);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_difftime (lua_State *L) {\r\n  lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),\r\n                             (time_t)(luaL_optnumber(L, 2, 0))));\r\n  return 1;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic int os_setlocale (lua_State *L) {\r\n  static const int cat[] = {LC_ALL, LC_COLLATE, LC_CTYPE, LC_MONETARY,\r\n                      LC_NUMERIC, LC_TIME};\r\n  static const char *const catnames[] = {\"all\", \"collate\", \"ctype\", \"monetary\",\r\n     \"numeric\", \"time\", NULL};\r\n  const char *l = luaL_optstring(L, 1, NULL);\r\n  int op = luaL_checkoption(L, 2, \"all\", catnames);\r\n  lua_pushstring(L, setlocale(cat[op], l));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int os_exit (lua_State *L) {\r\n  exit(luaL_optint(L, 1, EXIT_SUCCESS));\r\n}\r\n\r\nstatic const luaL_Reg syslib[] = {\r\n  {\"clock\",     os_clock},\r\n  {\"date\",      os_date},\r\n  {\"difftime\",  os_difftime},\r\n  {\"execute\",   os_execute},\r\n  {\"exit\",      os_exit},\r\n  {\"getenv\",    os_getenv},\r\n  {\"remove\",    os_remove},\r\n  {\"rename\",    os_rename},\r\n  {\"setlocale\", os_setlocale},\r\n  {\"time\",      os_time},\r\n  {\"tmpname\",   os_tmpname},\r\n  {NULL, NULL}\r\n};\r\n\r\n/* }====================================================== */\r\n\r\n\r\n\r\nLUALIB_API int luaopen_os (lua_State *L) {\r\n  luaL_register(L, LUA_OSLIBNAME, syslib);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lparser.c",
    "content": "/*\r\n** $Id: lparser.c,v 2.42.1.4 2011/10/21 19:31:42 roberto Exp $\r\n** Lua Parser\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <string.h>\r\n\r\n#define lparser_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lcode.h\"\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"llex.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lparser.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n\r\n\r\n\r\n#define hasmultret(k)\t\t((k) == VCALL || (k) == VVARARG)\r\n\r\n#define getlocvar(fs, i)\t((fs)->f->locvars[(fs)->actvar[i]])\r\n\r\n#define luaY_checklimit(fs,v,l,m)\tif ((v)>(l)) errorlimit(fs,l,m)\r\n\r\n\r\n/*\r\n** nodes for block list (list of active blocks)\r\n*/\r\ntypedef struct BlockCnt {\r\n  struct BlockCnt *previous;  /* chain */\r\n  int breaklist;  /* list of jumps out of this loop */\r\n  lu_byte nactvar;  /* # active locals outside the breakable structure */\r\n  lu_byte upval;  /* true if some variable in the block is an upvalue */\r\n  lu_byte isbreakable;  /* true if `block' is a loop */\r\n} BlockCnt;\r\n\r\n\r\n\r\n/*\r\n** prototypes for recursive non-terminal functions\r\n*/\r\nstatic void chunk (LexState *ls);\r\nstatic void expr (LexState *ls, expdesc *v);\r\n\r\n\r\nstatic void anchor_token (LexState *ls) {\r\n  if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) {\r\n    TString *ts = ls->t.seminfo.ts;\r\n    luaX_newstring(ls, getstr(ts), ts->tsv.len);\r\n  }\r\n}\r\n\r\n\r\nstatic void error_expected (LexState *ls, int token) {\r\n  luaX_syntaxerror(ls,\r\n      luaO_pushfstring(ls->L, LUA_QS \" expected\", luaX_token2str(ls, token)));\r\n}\r\n\r\n\r\nstatic void errorlimit (FuncState *fs, int limit, const char *what) {\r\n  const char *msg = (fs->f->linedefined == 0) ?\r\n    luaO_pushfstring(fs->L, \"main function has more than %d %s\", limit, what) :\r\n    luaO_pushfstring(fs->L, \"function at line %d has more than %d %s\",\r\n                            fs->f->linedefined, limit, what);\r\n  luaX_lexerror(fs->ls, msg, 0);\r\n}\r\n\r\n\r\nstatic int testnext (LexState *ls, int c) {\r\n  if (ls->t.token == c) {\r\n    luaX_next(ls);\r\n    return 1;\r\n  }\r\n  else return 0;\r\n}\r\n\r\n\r\nstatic void check (LexState *ls, int c) {\r\n  if (ls->t.token != c)\r\n    error_expected(ls, c);\r\n}\r\n\r\nstatic void checknext (LexState *ls, int c) {\r\n  check(ls, c);\r\n  luaX_next(ls);\r\n}\r\n\r\n\r\n#define check_condition(ls,c,msg)\t{ if (!(c)) luaX_syntaxerror(ls, msg); }\r\n\r\n\r\n\r\nstatic void check_match (LexState *ls, int what, int who, int where) {\r\n  if (!testnext(ls, what)) {\r\n    if (where == ls->linenumber)\r\n      error_expected(ls, what);\r\n    else {\r\n      luaX_syntaxerror(ls, luaO_pushfstring(ls->L,\r\n             LUA_QS \" expected (to close \" LUA_QS \" at line %d)\",\r\n              luaX_token2str(ls, what), luaX_token2str(ls, who), where));\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic TString *str_checkname (LexState *ls) {\r\n  TString *ts;\r\n  check(ls, TK_NAME);\r\n  ts = ls->t.seminfo.ts;\r\n  luaX_next(ls);\r\n  return ts;\r\n}\r\n\r\n\r\nstatic void init_exp (expdesc *e, expkind k, int i) {\r\n  e->f = e->t = NO_JUMP;\r\n  e->k = k;\r\n  e->u.s.info = i;\r\n}\r\n\r\n\r\nstatic void codestring (LexState *ls, expdesc *e, TString *s) {\r\n  init_exp(e, VK, luaK_stringK(ls->fs, s));\r\n}\r\n\r\n\r\nstatic void checkname(LexState *ls, expdesc *e) {\r\n  codestring(ls, e, str_checkname(ls));\r\n}\r\n\r\n\r\nstatic int registerlocalvar (LexState *ls, TString *varname) {\r\n  FuncState *fs = ls->fs;\r\n  Proto *f = fs->f;\r\n  int oldsize = f->sizelocvars;\r\n  luaM_growvector(ls->L, f->locvars, fs->nlocvars, f->sizelocvars,\r\n                  LocVar, SHRT_MAX, \"too many local variables\");\r\n  while (oldsize < f->sizelocvars) f->locvars[oldsize++].varname = NULL;\r\n  f->locvars[fs->nlocvars].varname = varname;\r\n  luaC_objbarrier(ls->L, f, varname);\r\n  return fs->nlocvars++;\r\n}\r\n\r\n\r\n#define new_localvarliteral(ls,v,n) \\\r\n  new_localvar(ls, luaX_newstring(ls, \"\" v, (sizeof(v)/sizeof(char))-1), n)\r\n\r\n\r\nstatic void new_localvar (LexState *ls, TString *name, int n) {\r\n  FuncState *fs = ls->fs;\r\n  luaY_checklimit(fs, fs->nactvar+n+1, LUAI_MAXVARS, \"local variables\");\r\n  fs->actvar[fs->nactvar+n] = cast(unsigned short, registerlocalvar(ls, name));\r\n}\r\n\r\n\r\nstatic void adjustlocalvars (LexState *ls, int nvars) {\r\n  FuncState *fs = ls->fs;\r\n  fs->nactvar = cast_byte(fs->nactvar + nvars);\r\n  for (; nvars; nvars--) {\r\n    getlocvar(fs, fs->nactvar - nvars).startpc = fs->pc;\r\n  }\r\n}\r\n\r\n\r\nstatic void removevars (LexState *ls, int tolevel) {\r\n  FuncState *fs = ls->fs;\r\n  while (fs->nactvar > tolevel)\r\n    getlocvar(fs, --fs->nactvar).endpc = fs->pc;\r\n}\r\n\r\n\r\nstatic int indexupvalue (FuncState *fs, TString *name, expdesc *v) {\r\n  int i;\r\n  Proto *f = fs->f;\r\n  int oldsize = f->sizeupvalues;\r\n  for (i=0; i<f->nups; i++) {\r\n    if (fs->upvalues[i].k == v->k && fs->upvalues[i].info == v->u.s.info) {\r\n      lua_assert(f->upvalues[i] == name);\r\n      return i;\r\n    }\r\n  }\r\n  /* new one */\r\n  luaY_checklimit(fs, f->nups + 1, LUAI_MAXUPVALUES, \"upvalues\");\r\n  luaM_growvector(fs->L, f->upvalues, f->nups, f->sizeupvalues,\r\n                  TString *, MAX_INT, \"\");\r\n  while (oldsize < f->sizeupvalues) f->upvalues[oldsize++] = NULL;\r\n  f->upvalues[f->nups] = name;\r\n  luaC_objbarrier(fs->L, f, name);\r\n  lua_assert(v->k == VLOCAL || v->k == VUPVAL);\r\n  fs->upvalues[f->nups].k = cast_byte(v->k);\r\n  fs->upvalues[f->nups].info = cast_byte(v->u.s.info);\r\n  return f->nups++;\r\n}\r\n\r\n\r\nstatic int searchvar (FuncState *fs, TString *n) {\r\n  int i;\r\n  for (i=fs->nactvar-1; i >= 0; i--) {\r\n    if (n == getlocvar(fs, i).varname)\r\n      return i;\r\n  }\r\n  return -1;  /* not found */\r\n}\r\n\r\n\r\nstatic void markupval (FuncState *fs, int level) {\r\n  BlockCnt *bl = fs->bl;\r\n  while (bl && bl->nactvar > level) bl = bl->previous;\r\n  if (bl) bl->upval = 1;\r\n}\r\n\r\n\r\nstatic int singlevaraux (FuncState *fs, TString *n, expdesc *var, int base) {\r\n  if (fs == NULL) {  /* no more levels? */\r\n    init_exp(var, VGLOBAL, NO_REG);  /* default is global variable */\r\n    return VGLOBAL;\r\n  }\r\n  else {\r\n    int v = searchvar(fs, n);  /* look up at current level */\r\n    if (v >= 0) {\r\n      init_exp(var, VLOCAL, v);\r\n      if (!base)\r\n        markupval(fs, v);  /* local will be used as an upval */\r\n      return VLOCAL;\r\n    }\r\n    else {  /* not found at current level; try upper one */\r\n      if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL)\r\n        return VGLOBAL;\r\n      var->u.s.info = indexupvalue(fs, n, var);  /* else was LOCAL or UPVAL */\r\n      var->k = VUPVAL;  /* upvalue in this level */\r\n      return VUPVAL;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void singlevar (LexState *ls, expdesc *var) {\r\n  TString *varname = str_checkname(ls);\r\n  FuncState *fs = ls->fs;\r\n  if (singlevaraux(fs, varname, var, 1) == VGLOBAL)\r\n    var->u.s.info = luaK_stringK(fs, varname);  /* info points to global name */\r\n}\r\n\r\n\r\nstatic void adjust_assign (LexState *ls, int nvars, int nexps, expdesc *e) {\r\n  FuncState *fs = ls->fs;\r\n  int extra = nvars - nexps;\r\n  if (hasmultret(e->k)) {\r\n    extra++;  /* includes call itself */\r\n    if (extra < 0) extra = 0;\r\n    luaK_setreturns(fs, e, extra);  /* last exp. provides the difference */\r\n    if (extra > 1) luaK_reserveregs(fs, extra-1);\r\n  }\r\n  else {\r\n    if (e->k != VVOID) luaK_exp2nextreg(fs, e);  /* close last expression */\r\n    if (extra > 0) {\r\n      int reg = fs->freereg;\r\n      luaK_reserveregs(fs, extra);\r\n      luaK_nil(fs, reg, extra);\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void enterlevel (LexState *ls) {\r\n  if (++ls->L->nCcalls > LUAI_MAXCCALLS)\r\n\tluaX_lexerror(ls, \"chunk has too many syntax levels\", 0);\r\n}\r\n\r\n\r\n#define leavelevel(ls)\t((ls)->L->nCcalls--)\r\n\r\n\r\nstatic void enterblock (FuncState *fs, BlockCnt *bl, lu_byte isbreakable) {\r\n  bl->breaklist = NO_JUMP;\r\n  bl->isbreakable = isbreakable;\r\n  bl->nactvar = fs->nactvar;\r\n  bl->upval = 0;\r\n  bl->previous = fs->bl;\r\n  fs->bl = bl;\r\n  lua_assert(fs->freereg == fs->nactvar);\r\n}\r\n\r\n\r\nstatic void leaveblock (FuncState *fs) {\r\n  BlockCnt *bl = fs->bl;\r\n  fs->bl = bl->previous;\r\n  removevars(fs->ls, bl->nactvar);\r\n  if (bl->upval)\r\n    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);\r\n  /* a block either controls scope or breaks (never both) */\r\n  lua_assert(!bl->isbreakable || !bl->upval);\r\n  lua_assert(bl->nactvar == fs->nactvar);\r\n  fs->freereg = fs->nactvar;  /* free registers */\r\n  luaK_patchtohere(fs, bl->breaklist);\r\n}\r\n\r\n\r\nstatic void pushclosure (LexState *ls, FuncState *func, expdesc *v) {\r\n  FuncState *fs = ls->fs;\r\n  Proto *f = fs->f;\r\n  int oldsize = f->sizep;\r\n  int i;\r\n  luaM_growvector(ls->L, f->p, fs->np, f->sizep, Proto *,\r\n                  MAXARG_Bx, \"constant table overflow\");\r\n  while (oldsize < f->sizep) f->p[oldsize++] = NULL;\r\n  f->p[fs->np++] = func->f;\r\n  luaC_objbarrier(ls->L, f, func->f);\r\n  init_exp(v, VRELOCABLE, luaK_codeABx(fs, OP_CLOSURE, 0, fs->np-1));\r\n  for (i=0; i<func->f->nups; i++) {\r\n    OpCode o = (func->upvalues[i].k == VLOCAL) ? OP_MOVE : OP_GETUPVAL;\r\n    luaK_codeABC(fs, o, 0, func->upvalues[i].info, 0);\r\n  }\r\n}\r\n\r\n\r\nstatic void open_func (LexState *ls, FuncState *fs) {\r\n  lua_State *L = ls->L;\r\n  Proto *f = luaF_newproto(L);\r\n  fs->f = f;\r\n  fs->prev = ls->fs;  /* linked list of funcstates */\r\n  fs->ls = ls;\r\n  fs->L = L;\r\n  ls->fs = fs;\r\n  fs->pc = 0;\r\n  fs->lasttarget = -1;\r\n  fs->jpc = NO_JUMP;\r\n  fs->freereg = 0;\r\n  fs->nk = 0;\r\n  fs->np = 0;\r\n  fs->nlocvars = 0;\r\n  fs->nactvar = 0;\r\n  fs->bl = NULL;\r\n  f->source = ls->source;\r\n  f->maxstacksize = 2;  /* registers 0/1 are always valid */\r\n  fs->h = luaH_new(L, 0, 0);\r\n  /* anchor table of constants and prototype (to avoid being collected) */\r\n  sethvalue2s(L, L->top, fs->h);\r\n  incr_top(L);\r\n  setptvalue2s(L, L->top, f);\r\n  incr_top(L);\r\n}\r\n\r\n\r\nstatic void close_func (LexState *ls) {\r\n  lua_State *L = ls->L;\r\n  FuncState *fs = ls->fs;\r\n  Proto *f = fs->f;\r\n  removevars(ls, 0);\r\n  luaK_ret(fs, 0, 0);  /* final return */\r\n  luaM_reallocvector(L, f->code, f->sizecode, fs->pc, Instruction);\r\n  f->sizecode = fs->pc;\r\n  luaM_reallocvector(L, f->lineinfo, f->sizelineinfo, fs->pc, int);\r\n  f->sizelineinfo = fs->pc;\r\n  luaM_reallocvector(L, f->k, f->sizek, fs->nk, TValue);\r\n  f->sizek = fs->nk;\r\n  luaM_reallocvector(L, f->p, f->sizep, fs->np, Proto *);\r\n  f->sizep = fs->np;\r\n  luaM_reallocvector(L, f->locvars, f->sizelocvars, fs->nlocvars, LocVar);\r\n  f->sizelocvars = fs->nlocvars;\r\n  luaM_reallocvector(L, f->upvalues, f->sizeupvalues, f->nups, TString *);\r\n  f->sizeupvalues = f->nups;\r\n  lua_assert(luaG_checkcode(f));\r\n  lua_assert(fs->bl == NULL);\r\n  ls->fs = fs->prev;\r\n  /* last token read was anchored in defunct function; must reanchor it */\r\n  if (fs) anchor_token(ls);\r\n  L->top -= 2;  /* remove table and prototype from the stack */\r\n}\r\n\r\n\r\nProto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff, const char *name) {\r\n  struct LexState lexstate;\r\n  struct FuncState funcstate;\r\n  lexstate.buff = buff;\r\n  luaX_setinput(L, &lexstate, z, luaS_new(L, name));\r\n  open_func(&lexstate, &funcstate);\r\n  funcstate.f->is_vararg = VARARG_ISVARARG;  /* main func. is always vararg */\r\n  luaX_next(&lexstate);  /* read first token */\r\n  chunk(&lexstate);\r\n  check(&lexstate, TK_EOS);\r\n  close_func(&lexstate);\r\n  lua_assert(funcstate.prev == NULL);\r\n  lua_assert(funcstate.f->nups == 0);\r\n  lua_assert(lexstate.fs == NULL);\r\n  return funcstate.f;\r\n}\r\n\r\n\r\n\r\n/*============================================================*/\r\n/* GRAMMAR RULES */\r\n/*============================================================*/\r\n\r\n\r\nstatic void field (LexState *ls, expdesc *v) {\r\n  /* field -> ['.' | ':'] NAME */\r\n  FuncState *fs = ls->fs;\r\n  expdesc key;\r\n  luaK_exp2anyreg(fs, v);\r\n  luaX_next(ls);  /* skip the dot or colon */\r\n  checkname(ls, &key);\r\n  luaK_indexed(fs, v, &key);\r\n}\r\n\r\n\r\nstatic void yindex (LexState *ls, expdesc *v) {\r\n  /* index -> '[' expr ']' */\r\n  luaX_next(ls);  /* skip the '[' */\r\n  expr(ls, v);\r\n  luaK_exp2val(ls->fs, v);\r\n  checknext(ls, ']');\r\n}\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Rules for Constructors\r\n** =======================================================================\r\n*/\r\n\r\n\r\nstruct ConsControl {\r\n  expdesc v;  /* last list item read */\r\n  expdesc *t;  /* table descriptor */\r\n  int nh;  /* total number of `record' elements */\r\n  int na;  /* total number of array elements */\r\n  int tostore;  /* number of array elements pending to be stored */\r\n};\r\n\r\n\r\nstatic void recfield (LexState *ls, struct ConsControl *cc) {\r\n  /* recfield -> (NAME | `['exp1`]') = exp1 */\r\n  FuncState *fs = ls->fs;\r\n  int reg = ls->fs->freereg;\r\n  expdesc key, val;\r\n  int rkkey;\r\n  if (ls->t.token == TK_NAME) {\r\n    luaY_checklimit(fs, cc->nh, MAX_INT, \"items in a constructor\");\r\n    checkname(ls, &key);\r\n  }\r\n  else  /* ls->t.token == '[' */\r\n    yindex(ls, &key);\r\n  cc->nh++;\r\n  checknext(ls, '=');\r\n  rkkey = luaK_exp2RK(fs, &key);\r\n  expr(ls, &val);\r\n  luaK_codeABC(fs, OP_SETTABLE, cc->t->u.s.info, rkkey, luaK_exp2RK(fs, &val));\r\n  fs->freereg = reg;  /* free registers */\r\n}\r\n\r\n\r\nstatic void closelistfield (FuncState *fs, struct ConsControl *cc) {\r\n  if (cc->v.k == VVOID) return;  /* there is no list item */\r\n  luaK_exp2nextreg(fs, &cc->v);\r\n  cc->v.k = VVOID;\r\n  if (cc->tostore == LFIELDS_PER_FLUSH) {\r\n    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);  /* flush */\r\n    cc->tostore = 0;  /* no more items pending */\r\n  }\r\n}\r\n\r\n\r\nstatic void lastlistfield (FuncState *fs, struct ConsControl *cc) {\r\n  if (cc->tostore == 0) return;\r\n  if (hasmultret(cc->v.k)) {\r\n    luaK_setmultret(fs, &cc->v);\r\n    luaK_setlist(fs, cc->t->u.s.info, cc->na, LUA_MULTRET);\r\n    cc->na--;  /* do not count last expression (unknown number of elements) */\r\n  }\r\n  else {\r\n    if (cc->v.k != VVOID)\r\n      luaK_exp2nextreg(fs, &cc->v);\r\n    luaK_setlist(fs, cc->t->u.s.info, cc->na, cc->tostore);\r\n  }\r\n}\r\n\r\n\r\nstatic void listfield (LexState *ls, struct ConsControl *cc) {\r\n  expr(ls, &cc->v);\r\n  luaY_checklimit(ls->fs, cc->na, MAX_INT, \"items in a constructor\");\r\n  cc->na++;\r\n  cc->tostore++;\r\n}\r\n\r\n\r\nstatic void constructor (LexState *ls, expdesc *t) {\r\n  /* constructor -> ?? */\r\n  FuncState *fs = ls->fs;\r\n  int line = ls->linenumber;\r\n  int pc = luaK_codeABC(fs, OP_NEWTABLE, 0, 0, 0);\r\n  struct ConsControl cc;\r\n  cc.na = cc.nh = cc.tostore = 0;\r\n  cc.t = t;\r\n  init_exp(t, VRELOCABLE, pc);\r\n  init_exp(&cc.v, VVOID, 0);  /* no value (yet) */\r\n  luaK_exp2nextreg(ls->fs, t);  /* fix it at stack top (for gc) */\r\n  checknext(ls, '{');\r\n  do {\r\n    lua_assert(cc.v.k == VVOID || cc.tostore > 0);\r\n    if (ls->t.token == '}') break;\r\n    closelistfield(fs, &cc);\r\n    switch(ls->t.token) {\r\n      case TK_NAME: {  /* may be listfields or recfields */\r\n        luaX_lookahead(ls);\r\n        if (ls->lookahead.token != '=')  /* expression? */\r\n          listfield(ls, &cc);\r\n        else\r\n          recfield(ls, &cc);\r\n        break;\r\n      }\r\n      case '[': {  /* constructor_item -> recfield */\r\n        recfield(ls, &cc);\r\n        break;\r\n      }\r\n      default: {  /* constructor_part -> listfield */\r\n        listfield(ls, &cc);\r\n        break;\r\n      }\r\n    }\r\n  } while (testnext(ls, ',') || testnext(ls, ';'));\r\n  check_match(ls, '}', '{', line);\r\n  lastlistfield(fs, &cc);\r\n  SETARG_B(fs->f->code[pc], luaO_int2fb(cc.na)); /* set initial array size */\r\n  SETARG_C(fs->f->code[pc], luaO_int2fb(cc.nh));  /* set initial table size */\r\n}\r\n\r\n/* }====================================================================== */\r\n\r\n\r\n\r\nstatic void parlist (LexState *ls) {\r\n  /* parlist -> [ param { `,' param } ] */\r\n  FuncState *fs = ls->fs;\r\n  Proto *f = fs->f;\r\n  int nparams = 0;\r\n  f->is_vararg = 0;\r\n  if (ls->t.token != ')') {  /* is `parlist' not empty? */\r\n    do {\r\n      switch (ls->t.token) {\r\n        case TK_NAME: {  /* param -> NAME */\r\n          new_localvar(ls, str_checkname(ls), nparams++);\r\n          break;\r\n        }\r\n        case TK_DOTS: {  /* param -> `...' */\r\n          luaX_next(ls);\r\n#if defined(LUA_COMPAT_VARARG)\r\n          /* use `arg' as default name */\r\n          new_localvarliteral(ls, \"arg\", nparams++);\r\n          f->is_vararg = VARARG_HASARG | VARARG_NEEDSARG;\r\n#endif\r\n          f->is_vararg |= VARARG_ISVARARG;\r\n          break;\r\n        }\r\n        default: luaX_syntaxerror(ls, \"<name> or \" LUA_QL(\"...\") \" expected\");\r\n      }\r\n    } while (!f->is_vararg && testnext(ls, ','));\r\n  }\r\n  adjustlocalvars(ls, nparams);\r\n  f->numparams = cast_byte(fs->nactvar - (f->is_vararg & VARARG_HASARG));\r\n  luaK_reserveregs(fs, fs->nactvar);  /* reserve register for parameters */\r\n}\r\n\r\n\r\nstatic void body (LexState *ls, expdesc *e, int needself, int line) {\r\n  /* body ->  `(' parlist `)' chunk END */\r\n  FuncState new_fs;\r\n  open_func(ls, &new_fs);\r\n  new_fs.f->linedefined = line;\r\n  checknext(ls, '(');\r\n  if (needself) {\r\n    new_localvarliteral(ls, \"self\", 0);\r\n    adjustlocalvars(ls, 1);\r\n  }\r\n  parlist(ls);\r\n  checknext(ls, ')');\r\n  chunk(ls);\r\n  new_fs.f->lastlinedefined = ls->linenumber;\r\n  check_match(ls, TK_END, TK_FUNCTION, line);\r\n  close_func(ls);\r\n  pushclosure(ls, &new_fs, e);\r\n}\r\n\r\n\r\nstatic int explist1 (LexState *ls, expdesc *v) {\r\n  /* explist1 -> expr { `,' expr } */\r\n  int n = 1;  /* at least one expression */\r\n  expr(ls, v);\r\n  while (testnext(ls, ',')) {\r\n    luaK_exp2nextreg(ls->fs, v);\r\n    expr(ls, v);\r\n    n++;\r\n  }\r\n  return n;\r\n}\r\n\r\n\r\nstatic void funcargs (LexState *ls, expdesc *f) {\r\n  FuncState *fs = ls->fs;\r\n  expdesc args;\r\n  int base, nparams;\r\n  int line = ls->linenumber;\r\n  switch (ls->t.token) {\r\n    case '(': {  /* funcargs -> `(' [ explist1 ] `)' */\r\n      if (line != ls->lastline)\r\n        luaX_syntaxerror(ls,\"ambiguous syntax (function call x new statement)\");\r\n      luaX_next(ls);\r\n      if (ls->t.token == ')')  /* arg list is empty? */\r\n        args.k = VVOID;\r\n      else {\r\n        explist1(ls, &args);\r\n        luaK_setmultret(fs, &args);\r\n      }\r\n      check_match(ls, ')', '(', line);\r\n      break;\r\n    }\r\n    case '{': {  /* funcargs -> constructor */\r\n      constructor(ls, &args);\r\n      break;\r\n    }\r\n    case TK_STRING: {  /* funcargs -> STRING */\r\n      codestring(ls, &args, ls->t.seminfo.ts);\r\n      luaX_next(ls);  /* must use `seminfo' before `next' */\r\n      break;\r\n    }\r\n    default: {\r\n      luaX_syntaxerror(ls, \"function arguments expected\");\r\n      return;\r\n    }\r\n  }\r\n  lua_assert(f->k == VNONRELOC);\r\n  base = f->u.s.info;  /* base register for call */\r\n  if (hasmultret(args.k))\r\n    nparams = LUA_MULTRET;  /* open call */\r\n  else {\r\n    if (args.k != VVOID)\r\n      luaK_exp2nextreg(fs, &args);  /* close last argument */\r\n    nparams = fs->freereg - (base+1);\r\n  }\r\n  init_exp(f, VCALL, luaK_codeABC(fs, OP_CALL, base, nparams+1, 2));\r\n  luaK_fixline(fs, line);\r\n  fs->freereg = base+1;  /* call remove function and arguments and leaves\r\n                            (unless changed) one result */\r\n}\r\n\r\n\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Expression parsing\r\n** =======================================================================\r\n*/\r\n\r\n\r\nstatic void prefixexp (LexState *ls, expdesc *v) {\r\n  /* prefixexp -> NAME | '(' expr ')' */\r\n  switch (ls->t.token) {\r\n    case '(': {\r\n      int line = ls->linenumber;\r\n      luaX_next(ls);\r\n      expr(ls, v);\r\n      check_match(ls, ')', '(', line);\r\n      luaK_dischargevars(ls->fs, v);\r\n      return;\r\n    }\r\n    case TK_NAME: {\r\n      singlevar(ls, v);\r\n      return;\r\n    }\r\n    default: {\r\n      luaX_syntaxerror(ls, \"unexpected symbol\");\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void primaryexp (LexState *ls, expdesc *v) {\r\n  /* primaryexp ->\r\n        prefixexp { `.' NAME | `[' exp `]' | `:' NAME funcargs | funcargs } */\r\n  FuncState *fs = ls->fs;\r\n  prefixexp(ls, v);\r\n  for (;;) {\r\n    switch (ls->t.token) {\r\n      case '.': {  /* field */\r\n        field(ls, v);\r\n        break;\r\n      }\r\n      case '[': {  /* `[' exp1 `]' */\r\n        expdesc key;\r\n        luaK_exp2anyreg(fs, v);\r\n        yindex(ls, &key);\r\n        luaK_indexed(fs, v, &key);\r\n        break;\r\n      }\r\n      case ':': {  /* `:' NAME funcargs */\r\n        expdesc key;\r\n        luaX_next(ls);\r\n        checkname(ls, &key);\r\n        luaK_self(fs, v, &key);\r\n        funcargs(ls, v);\r\n        break;\r\n      }\r\n      case '(': case TK_STRING: case '{': {  /* funcargs */\r\n        luaK_exp2nextreg(fs, v);\r\n        funcargs(ls, v);\r\n        break;\r\n      }\r\n      default: return;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void simpleexp (LexState *ls, expdesc *v) {\r\n  /* simpleexp -> NUMBER | STRING | NIL | true | false | ... |\r\n                  constructor | FUNCTION body | primaryexp */\r\n  switch (ls->t.token) {\r\n    case TK_NUMBER: {\r\n      init_exp(v, VKNUM, 0);\r\n      v->u.nval = ls->t.seminfo.r;\r\n      break;\r\n    }\r\n    case TK_STRING: {\r\n      codestring(ls, v, ls->t.seminfo.ts);\r\n      break;\r\n    }\r\n    case TK_NIL: {\r\n      init_exp(v, VNIL, 0);\r\n      break;\r\n    }\r\n    case TK_TRUE: {\r\n      init_exp(v, VTRUE, 0);\r\n      break;\r\n    }\r\n    case TK_FALSE: {\r\n      init_exp(v, VFALSE, 0);\r\n      break;\r\n    }\r\n    case TK_DOTS: {  /* vararg */\r\n      FuncState *fs = ls->fs;\r\n      check_condition(ls, fs->f->is_vararg,\r\n                      \"cannot use \" LUA_QL(\"...\") \" outside a vararg function\");\r\n      fs->f->is_vararg &= ~VARARG_NEEDSARG;  /* don't need 'arg' */\r\n      init_exp(v, VVARARG, luaK_codeABC(fs, OP_VARARG, 0, 1, 0));\r\n      break;\r\n    }\r\n    case '{': {  /* constructor */\r\n      constructor(ls, v);\r\n      return;\r\n    }\r\n    case TK_FUNCTION: {\r\n      luaX_next(ls);\r\n      body(ls, v, 0, ls->linenumber);\r\n      return;\r\n    }\r\n    default: {\r\n      primaryexp(ls, v);\r\n      return;\r\n    }\r\n  }\r\n  luaX_next(ls);\r\n}\r\n\r\n\r\nstatic UnOpr getunopr (int op) {\r\n  switch (op) {\r\n    case TK_NOT: return OPR_NOT;\r\n    case '-': return OPR_MINUS;\r\n    case '#': return OPR_LEN;\r\n    default: return OPR_NOUNOPR;\r\n  }\r\n}\r\n\r\n\r\nstatic BinOpr getbinopr (int op) {\r\n  switch (op) {\r\n    case '+': return OPR_ADD;\r\n    case '-': return OPR_SUB;\r\n    case '*': return OPR_MUL;\r\n    case '/': return OPR_DIV;\r\n    case '%': return OPR_MOD;\r\n    case '^': return OPR_POW;\r\n    case TK_CONCAT: return OPR_CONCAT;\r\n    case TK_NE: return OPR_NE;\r\n    case TK_EQ: return OPR_EQ;\r\n    case '<': return OPR_LT;\r\n    case TK_LE: return OPR_LE;\r\n    case '>': return OPR_GT;\r\n    case TK_GE: return OPR_GE;\r\n    case TK_AND: return OPR_AND;\r\n    case TK_OR: return OPR_OR;\r\n    default: return OPR_NOBINOPR;\r\n  }\r\n}\r\n\r\n\r\nstatic const struct {\r\n  lu_byte left;  /* left priority for each binary operator */\r\n  lu_byte right; /* right priority */\r\n} priority[] = {  /* ORDER OPR */\r\n   {6, 6}, {6, 6}, {7, 7}, {7, 7}, {7, 7},  /* `+' `-' `/' `%' */\r\n   {10, 9}, {5, 4},                 /* power and concat (right associative) */\r\n   {3, 3}, {3, 3},                  /* equality and inequality */\r\n   {3, 3}, {3, 3}, {3, 3}, {3, 3},  /* order */\r\n   {2, 2}, {1, 1}                   /* logical (and/or) */\r\n};\r\n\r\n#define UNARY_PRIORITY\t8  /* priority for unary operators */\r\n\r\n\r\n/*\r\n** subexpr -> (simpleexp | unop subexpr) { binop subexpr }\r\n** where `binop' is any binary operator with a priority higher than `limit'\r\n*/\r\nstatic BinOpr subexpr (LexState *ls, expdesc *v, unsigned int limit) {\r\n  BinOpr op;\r\n  UnOpr uop;\r\n  enterlevel(ls);\r\n  uop = getunopr(ls->t.token);\r\n  if (uop != OPR_NOUNOPR) {\r\n    luaX_next(ls);\r\n    subexpr(ls, v, UNARY_PRIORITY);\r\n    luaK_prefix(ls->fs, uop, v);\r\n  }\r\n  else simpleexp(ls, v);\r\n  /* expand while operators have priorities higher than `limit' */\r\n  op = getbinopr(ls->t.token);\r\n  while (op != OPR_NOBINOPR && priority[op].left > limit) {\r\n    expdesc v2;\r\n    BinOpr nextop;\r\n    luaX_next(ls);\r\n    luaK_infix(ls->fs, op, v);\r\n    /* read sub-expression with higher priority */\r\n    nextop = subexpr(ls, &v2, priority[op].right);\r\n    luaK_posfix(ls->fs, op, v, &v2);\r\n    op = nextop;\r\n  }\r\n  leavelevel(ls);\r\n  return op;  /* return first untreated operator */\r\n}\r\n\r\n\r\nstatic void expr (LexState *ls, expdesc *v) {\r\n  subexpr(ls, v, 0);\r\n}\r\n\r\n/* }==================================================================== */\r\n\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Rules for Statements\r\n** =======================================================================\r\n*/\r\n\r\n\r\nstatic int block_follow (int token) {\r\n  switch (token) {\r\n    case TK_ELSE: case TK_ELSEIF: case TK_END:\r\n    case TK_UNTIL: case TK_EOS:\r\n      return 1;\r\n    default: return 0;\r\n  }\r\n}\r\n\r\n\r\nstatic void block (LexState *ls) {\r\n  /* block -> chunk */\r\n  FuncState *fs = ls->fs;\r\n  BlockCnt bl;\r\n  enterblock(fs, &bl, 0);\r\n  chunk(ls);\r\n  lua_assert(bl.breaklist == NO_JUMP);\r\n  leaveblock(fs);\r\n}\r\n\r\n\r\n/*\r\n** structure to chain all variables in the left-hand side of an\r\n** assignment\r\n*/\r\nstruct LHS_assign {\r\n  struct LHS_assign *prev;\r\n  expdesc v;  /* variable (global, local, upvalue, or indexed) */\r\n};\r\n\r\n\r\n/*\r\n** check whether, in an assignment to a local variable, the local variable\r\n** is needed in a previous assignment (to a table). If so, save original\r\n** local value in a safe place and use this safe copy in the previous\r\n** assignment.\r\n*/\r\nstatic void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) {\r\n  FuncState *fs = ls->fs;\r\n  int extra = fs->freereg;  /* eventual position to save local variable */\r\n  int conflict = 0;\r\n  for (; lh; lh = lh->prev) {\r\n    if (lh->v.k == VINDEXED) {\r\n      if (lh->v.u.s.info == v->u.s.info) {  /* conflict? */\r\n        conflict = 1;\r\n        lh->v.u.s.info = extra;  /* previous assignment will use safe copy */\r\n      }\r\n      if (lh->v.u.s.aux == v->u.s.info) {  /* conflict? */\r\n        conflict = 1;\r\n        lh->v.u.s.aux = extra;  /* previous assignment will use safe copy */\r\n      }\r\n    }\r\n  }\r\n  if (conflict) {\r\n    luaK_codeABC(fs, OP_MOVE, fs->freereg, v->u.s.info, 0);  /* make copy */\r\n    luaK_reserveregs(fs, 1);\r\n  }\r\n}\r\n\r\n\r\nstatic void assignment (LexState *ls, struct LHS_assign *lh, int nvars) {\r\n  expdesc e;\r\n  check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED,\r\n                      \"syntax error\");\r\n  if (testnext(ls, ',')) {  /* assignment -> `,' primaryexp assignment */\r\n    struct LHS_assign nv;\r\n    nv.prev = lh;\r\n    primaryexp(ls, &nv.v);\r\n    if (nv.v.k == VLOCAL)\r\n      check_conflict(ls, lh, &nv.v);\r\n    luaY_checklimit(ls->fs, nvars, LUAI_MAXCCALLS - ls->L->nCcalls,\r\n                    \"variables in assignment\");\r\n    assignment(ls, &nv, nvars+1);\r\n  }\r\n  else {  /* assignment -> `=' explist1 */\r\n    int nexps;\r\n    checknext(ls, '=');\r\n    nexps = explist1(ls, &e);\r\n    if (nexps != nvars) {\r\n      adjust_assign(ls, nvars, nexps, &e);\r\n      if (nexps > nvars)\r\n        ls->fs->freereg -= nexps - nvars;  /* remove extra values */\r\n    }\r\n    else {\r\n      luaK_setoneret(ls->fs, &e);  /* close last expression */\r\n      luaK_storevar(ls->fs, &lh->v, &e);\r\n      return;  /* avoid default */\r\n    }\r\n  }\r\n  init_exp(&e, VNONRELOC, ls->fs->freereg-1);  /* default assignment */\r\n  luaK_storevar(ls->fs, &lh->v, &e);\r\n}\r\n\r\n\r\nstatic int cond (LexState *ls) {\r\n  /* cond -> exp */\r\n  expdesc v;\r\n  expr(ls, &v);  /* read condition */\r\n  if (v.k == VNIL) v.k = VFALSE;  /* `falses' are all equal here */\r\n  luaK_goiftrue(ls->fs, &v);\r\n  return v.f;\r\n}\r\n\r\n\r\nstatic void breakstat (LexState *ls) {\r\n  FuncState *fs = ls->fs;\r\n  BlockCnt *bl = fs->bl;\r\n  int upval = 0;\r\n  while (bl && !bl->isbreakable) {\r\n    upval |= bl->upval;\r\n    bl = bl->previous;\r\n  }\r\n  if (!bl)\r\n    luaX_syntaxerror(ls, \"no loop to break\");\r\n  if (upval)\r\n    luaK_codeABC(fs, OP_CLOSE, bl->nactvar, 0, 0);\r\n  luaK_concat(fs, &bl->breaklist, luaK_jump(fs));\r\n}\r\n\r\n\r\nstatic void whilestat (LexState *ls, int line) {\r\n  /* whilestat -> WHILE cond DO block END */\r\n  FuncState *fs = ls->fs;\r\n  int whileinit;\r\n  int condexit;\r\n  BlockCnt bl;\r\n  luaX_next(ls);  /* skip WHILE */\r\n  whileinit = luaK_getlabel(fs);\r\n  condexit = cond(ls);\r\n  enterblock(fs, &bl, 1);\r\n  checknext(ls, TK_DO);\r\n  block(ls);\r\n  luaK_patchlist(fs, luaK_jump(fs), whileinit);\r\n  check_match(ls, TK_END, TK_WHILE, line);\r\n  leaveblock(fs);\r\n  luaK_patchtohere(fs, condexit);  /* false conditions finish the loop */\r\n}\r\n\r\n\r\nstatic void repeatstat (LexState *ls, int line) {\r\n  /* repeatstat -> REPEAT block UNTIL cond */\r\n  int condexit;\r\n  FuncState *fs = ls->fs;\r\n  int repeat_init = luaK_getlabel(fs);\r\n  BlockCnt bl1, bl2;\r\n  enterblock(fs, &bl1, 1);  /* loop block */\r\n  enterblock(fs, &bl2, 0);  /* scope block */\r\n  luaX_next(ls);  /* skip REPEAT */\r\n  chunk(ls);\r\n  check_match(ls, TK_UNTIL, TK_REPEAT, line);\r\n  condexit = cond(ls);  /* read condition (inside scope block) */\r\n  if (!bl2.upval) {  /* no upvalues? */\r\n    leaveblock(fs);  /* finish scope */\r\n    luaK_patchlist(ls->fs, condexit, repeat_init);  /* close the loop */\r\n  }\r\n  else {  /* complete semantics when there are upvalues */\r\n    breakstat(ls);  /* if condition then break */\r\n    luaK_patchtohere(ls->fs, condexit);  /* else... */\r\n    leaveblock(fs);  /* finish scope... */\r\n    luaK_patchlist(ls->fs, luaK_jump(fs), repeat_init);  /* and repeat */\r\n  }\r\n  leaveblock(fs);  /* finish loop */\r\n}\r\n\r\n\r\nstatic int exp1 (LexState *ls) {\r\n  expdesc e;\r\n  int k;\r\n  expr(ls, &e);\r\n  k = e.k;\r\n  luaK_exp2nextreg(ls->fs, &e);\r\n  return k;\r\n}\r\n\r\n\r\nstatic void forbody (LexState *ls, int base, int line, int nvars, int isnum) {\r\n  /* forbody -> DO block */\r\n  BlockCnt bl;\r\n  FuncState *fs = ls->fs;\r\n  int prep, endfor;\r\n  adjustlocalvars(ls, 3);  /* control variables */\r\n  checknext(ls, TK_DO);\r\n  prep = isnum ? luaK_codeAsBx(fs, OP_FORPREP, base, NO_JUMP) : luaK_jump(fs);\r\n  enterblock(fs, &bl, 0);  /* scope for declared variables */\r\n  adjustlocalvars(ls, nvars);\r\n  luaK_reserveregs(fs, nvars);\r\n  block(ls);\r\n  leaveblock(fs);  /* end of scope for declared variables */\r\n  luaK_patchtohere(fs, prep);\r\n  endfor = (isnum) ? luaK_codeAsBx(fs, OP_FORLOOP, base, NO_JUMP) :\r\n                     luaK_codeABC(fs, OP_TFORLOOP, base, 0, nvars);\r\n  luaK_fixline(fs, line);  /* pretend that `OP_FOR' starts the loop */\r\n  luaK_patchlist(fs, (isnum ? endfor : luaK_jump(fs)), prep + 1);\r\n}\r\n\r\n\r\nstatic void fornum (LexState *ls, TString *varname, int line) {\r\n  /* fornum -> NAME = exp1,exp1[,exp1] forbody */\r\n  FuncState *fs = ls->fs;\r\n  int base = fs->freereg;\r\n  new_localvarliteral(ls, \"(for index)\", 0);\r\n  new_localvarliteral(ls, \"(for limit)\", 1);\r\n  new_localvarliteral(ls, \"(for step)\", 2);\r\n  new_localvar(ls, varname, 3);\r\n  checknext(ls, '=');\r\n  exp1(ls);  /* initial value */\r\n  checknext(ls, ',');\r\n  exp1(ls);  /* limit */\r\n  if (testnext(ls, ','))\r\n    exp1(ls);  /* optional step */\r\n  else {  /* default step = 1 */\r\n    luaK_codeABx(fs, OP_LOADK, fs->freereg, luaK_numberK(fs, 1));\r\n    luaK_reserveregs(fs, 1);\r\n  }\r\n  forbody(ls, base, line, 1, 1);\r\n}\r\n\r\n\r\nstatic void forlist (LexState *ls, TString *indexname) {\r\n  /* forlist -> NAME {,NAME} IN explist1 forbody */\r\n  FuncState *fs = ls->fs;\r\n  expdesc e;\r\n  int nvars = 0;\r\n  int line;\r\n  int base = fs->freereg;\r\n  /* create control variables */\r\n  new_localvarliteral(ls, \"(for generator)\", nvars++);\r\n  new_localvarliteral(ls, \"(for state)\", nvars++);\r\n  new_localvarliteral(ls, \"(for control)\", nvars++);\r\n  /* create declared variables */\r\n  new_localvar(ls, indexname, nvars++);\r\n  while (testnext(ls, ','))\r\n    new_localvar(ls, str_checkname(ls), nvars++);\r\n  checknext(ls, TK_IN);\r\n  line = ls->linenumber;\r\n  adjust_assign(ls, 3, explist1(ls, &e), &e);\r\n  luaK_checkstack(fs, 3);  /* extra space to call generator */\r\n  forbody(ls, base, line, nvars - 3, 0);\r\n}\r\n\r\n\r\nstatic void forstat (LexState *ls, int line) {\r\n  /* forstat -> FOR (fornum | forlist) END */\r\n  FuncState *fs = ls->fs;\r\n  TString *varname;\r\n  BlockCnt bl;\r\n  enterblock(fs, &bl, 1);  /* scope for loop and control variables */\r\n  luaX_next(ls);  /* skip `for' */\r\n  varname = str_checkname(ls);  /* first variable name */\r\n  switch (ls->t.token) {\r\n    case '=': fornum(ls, varname, line); break;\r\n    case ',': case TK_IN: forlist(ls, varname); break;\r\n    default: luaX_syntaxerror(ls, LUA_QL(\"=\") \" or \" LUA_QL(\"in\") \" expected\");\r\n  }\r\n  check_match(ls, TK_END, TK_FOR, line);\r\n  leaveblock(fs);  /* loop scope (`break' jumps to this point) */\r\n}\r\n\r\n\r\nstatic int test_then_block (LexState *ls) {\r\n  /* test_then_block -> [IF | ELSEIF] cond THEN block */\r\n  int condexit;\r\n  luaX_next(ls);  /* skip IF or ELSEIF */\r\n  condexit = cond(ls);\r\n  checknext(ls, TK_THEN);\r\n  block(ls);  /* `then' part */\r\n  return condexit;\r\n}\r\n\r\n\r\nstatic void ifstat (LexState *ls, int line) {\r\n  /* ifstat -> IF cond THEN block {ELSEIF cond THEN block} [ELSE block] END */\r\n  FuncState *fs = ls->fs;\r\n  int flist;\r\n  int escapelist = NO_JUMP;\r\n  flist = test_then_block(ls);  /* IF cond THEN block */\r\n  while (ls->t.token == TK_ELSEIF) {\r\n    luaK_concat(fs, &escapelist, luaK_jump(fs));\r\n    luaK_patchtohere(fs, flist);\r\n    flist = test_then_block(ls);  /* ELSEIF cond THEN block */\r\n  }\r\n  if (ls->t.token == TK_ELSE) {\r\n    luaK_concat(fs, &escapelist, luaK_jump(fs));\r\n    luaK_patchtohere(fs, flist);\r\n    luaX_next(ls);  /* skip ELSE (after patch, for correct line info) */\r\n    block(ls);  /* `else' part */\r\n  }\r\n  else\r\n    luaK_concat(fs, &escapelist, flist);\r\n  luaK_patchtohere(fs, escapelist);\r\n  check_match(ls, TK_END, TK_IF, line);\r\n}\r\n\r\n\r\nstatic void localfunc (LexState *ls) {\r\n  expdesc v, b;\r\n  FuncState *fs = ls->fs;\r\n  new_localvar(ls, str_checkname(ls), 0);\r\n  init_exp(&v, VLOCAL, fs->freereg);\r\n  luaK_reserveregs(fs, 1);\r\n  adjustlocalvars(ls, 1);\r\n  body(ls, &b, 0, ls->linenumber);\r\n  luaK_storevar(fs, &v, &b);\r\n  /* debug information will only see the variable after this point! */\r\n  getlocvar(fs, fs->nactvar - 1).startpc = fs->pc;\r\n}\r\n\r\n\r\nstatic void localstat (LexState *ls) {\r\n  /* stat -> LOCAL NAME {`,' NAME} [`=' explist1] */\r\n  int nvars = 0;\r\n  int nexps;\r\n  expdesc e;\r\n  do {\r\n    new_localvar(ls, str_checkname(ls), nvars++);\r\n  } while (testnext(ls, ','));\r\n  if (testnext(ls, '='))\r\n    nexps = explist1(ls, &e);\r\n  else {\r\n    e.k = VVOID;\r\n    nexps = 0;\r\n  }\r\n  adjust_assign(ls, nvars, nexps, &e);\r\n  adjustlocalvars(ls, nvars);\r\n}\r\n\r\n\r\nstatic int funcname (LexState *ls, expdesc *v) {\r\n  /* funcname -> NAME {field} [`:' NAME] */\r\n  int needself = 0;\r\n  singlevar(ls, v);\r\n  while (ls->t.token == '.')\r\n    field(ls, v);\r\n  if (ls->t.token == ':') {\r\n    needself = 1;\r\n    field(ls, v);\r\n  }\r\n  return needself;\r\n}\r\n\r\n\r\nstatic void funcstat (LexState *ls, int line) {\r\n  /* funcstat -> FUNCTION funcname body */\r\n  int needself;\r\n  expdesc v, b;\r\n  luaX_next(ls);  /* skip FUNCTION */\r\n  needself = funcname(ls, &v);\r\n  body(ls, &b, needself, line);\r\n  luaK_storevar(ls->fs, &v, &b);\r\n  luaK_fixline(ls->fs, line);  /* definition `happens' in the first line */\r\n}\r\n\r\n\r\nstatic void exprstat (LexState *ls) {\r\n  /* stat -> func | assignment */\r\n  FuncState *fs = ls->fs;\r\n  struct LHS_assign v;\r\n  primaryexp(ls, &v.v);\r\n  if (v.v.k == VCALL)  /* stat -> func */\r\n    SETARG_C(getcode(fs, &v.v), 1);  /* call statement uses no results */\r\n  else {  /* stat -> assignment */\r\n    v.prev = NULL;\r\n    assignment(ls, &v, 1);\r\n  }\r\n}\r\n\r\n\r\nstatic void retstat (LexState *ls) {\r\n  /* stat -> RETURN explist */\r\n  FuncState *fs = ls->fs;\r\n  expdesc e;\r\n  int first, nret;  /* registers with returned values */\r\n  luaX_next(ls);  /* skip RETURN */\r\n  if (block_follow(ls->t.token) || ls->t.token == ';')\r\n    first = nret = 0;  /* return no values */\r\n  else {\r\n    nret = explist1(ls, &e);  /* optional return values */\r\n    if (hasmultret(e.k)) {\r\n      luaK_setmultret(fs, &e);\r\n      if (e.k == VCALL && nret == 1) {  /* tail call? */\r\n        SET_OPCODE(getcode(fs,&e), OP_TAILCALL);\r\n        lua_assert(GETARG_A(getcode(fs,&e)) == fs->nactvar);\r\n      }\r\n      first = fs->nactvar;\r\n      nret = LUA_MULTRET;  /* return all values */\r\n    }\r\n    else {\r\n      if (nret == 1)  /* only one single value? */\r\n        first = luaK_exp2anyreg(fs, &e);\r\n      else {\r\n        luaK_exp2nextreg(fs, &e);  /* values must go to the `stack' */\r\n        first = fs->nactvar;  /* return all `active' values */\r\n        lua_assert(nret == fs->freereg - first);\r\n      }\r\n    }\r\n  }\r\n  luaK_ret(fs, first, nret);\r\n}\r\n\r\n\r\nstatic int statement (LexState *ls) {\r\n  int line = ls->linenumber;  /* may be needed for error messages */\r\n  switch (ls->t.token) {\r\n    case TK_IF: {  /* stat -> ifstat */\r\n      ifstat(ls, line);\r\n      return 0;\r\n    }\r\n    case TK_WHILE: {  /* stat -> whilestat */\r\n      whilestat(ls, line);\r\n      return 0;\r\n    }\r\n    case TK_DO: {  /* stat -> DO block END */\r\n      luaX_next(ls);  /* skip DO */\r\n      block(ls);\r\n      check_match(ls, TK_END, TK_DO, line);\r\n      return 0;\r\n    }\r\n    case TK_FOR: {  /* stat -> forstat */\r\n      forstat(ls, line);\r\n      return 0;\r\n    }\r\n    case TK_REPEAT: {  /* stat -> repeatstat */\r\n      repeatstat(ls, line);\r\n      return 0;\r\n    }\r\n    case TK_FUNCTION: {\r\n      funcstat(ls, line);  /* stat -> funcstat */\r\n      return 0;\r\n    }\r\n    case TK_LOCAL: {  /* stat -> localstat */\r\n      luaX_next(ls);  /* skip LOCAL */\r\n      if (testnext(ls, TK_FUNCTION))  /* local function? */\r\n        localfunc(ls);\r\n      else\r\n        localstat(ls);\r\n      return 0;\r\n    }\r\n    case TK_RETURN: {  /* stat -> retstat */\r\n      retstat(ls);\r\n      return 1;  /* must be last statement */\r\n    }\r\n    case TK_BREAK: {  /* stat -> breakstat */\r\n      luaX_next(ls);  /* skip BREAK */\r\n      breakstat(ls);\r\n      return 1;  /* must be last statement */\r\n    }\r\n    default: {\r\n      exprstat(ls);\r\n      return 0;  /* to avoid warnings */\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void chunk (LexState *ls) {\r\n  /* chunk -> { stat [`;'] } */\r\n  int islast = 0;\r\n  enterlevel(ls);\r\n  while (!islast && !block_follow(ls->t.token)) {\r\n    islast = statement(ls);\r\n    testnext(ls, ';');\r\n    lua_assert(ls->fs->f->maxstacksize >= ls->fs->freereg &&\r\n               ls->fs->freereg >= ls->fs->nactvar);\r\n    ls->fs->freereg = ls->fs->nactvar;  /* free registers */\r\n  }\r\n  leavelevel(ls);\r\n}\r\n\r\n/* }====================================================================== */\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lparser.h",
    "content": "/*\r\n** $Id: lparser.h,v 1.57.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Lua Parser\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lparser_h\r\n#define lparser_h\r\n\r\n#include \"llimits.h\"\r\n#include \"lobject.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n/*\r\n** Expression descriptor\r\n*/\r\n\r\ntypedef enum {\r\n  VVOID,\t/* no value */\r\n  VNIL,\r\n  VTRUE,\r\n  VFALSE,\r\n  VK,\t\t/* info = index of constant in `k' */\r\n  VKNUM,\t/* nval = numerical value */\r\n  VLOCAL,\t/* info = local register */\r\n  VUPVAL,       /* info = index of upvalue in `upvalues' */\r\n  VGLOBAL,\t/* info = index of table; aux = index of global name in `k' */\r\n  VINDEXED,\t/* info = table register; aux = index register (or `k') */\r\n  VJMP,\t\t/* info = instruction pc */\r\n  VRELOCABLE,\t/* info = instruction pc */\r\n  VNONRELOC,\t/* info = result register */\r\n  VCALL,\t/* info = instruction pc */\r\n  VVARARG\t/* info = instruction pc */\r\n} expkind;\r\n\r\ntypedef struct expdesc {\r\n  expkind k;\r\n  union {\r\n    struct { int info, aux; } s;\r\n    lua_Number nval;\r\n  } u;\r\n  int t;  /* patch list of `exit when true' */\r\n  int f;  /* patch list of `exit when false' */\r\n} expdesc;\r\n\r\n\r\ntypedef struct upvaldesc {\r\n  lu_byte k;\r\n  lu_byte info;\r\n} upvaldesc;\r\n\r\n\r\nstruct BlockCnt;  /* defined in lparser.c */\r\n\r\n\r\n/* state needed to generate code for a given function */\r\ntypedef struct FuncState {\r\n  Proto *f;  /* current function header */\r\n  Table *h;  /* table to find (and reuse) elements in `k' */\r\n  struct FuncState *prev;  /* enclosing function */\r\n  struct LexState *ls;  /* lexical state */\r\n  struct lua_State *L;  /* copy of the Lua state */\r\n  struct BlockCnt *bl;  /* chain of current blocks */\r\n  int pc;  /* next position to code (equivalent to `ncode') */\r\n  int lasttarget;   /* `pc' of last `jump target' */\r\n  int jpc;  /* list of pending jumps to `pc' */\r\n  int freereg;  /* first free register */\r\n  int nk;  /* number of elements in `k' */\r\n  int np;  /* number of elements in `p' */\r\n  short nlocvars;  /* number of elements in `locvars' */\r\n  lu_byte nactvar;  /* number of active local variables */\r\n  upvaldesc upvalues[LUAI_MAXUPVALUES];  /* upvalues */\r\n  unsigned short actvar[LUAI_MAXVARS];  /* declared-variable stack */\r\n} FuncState;\r\n\r\n\r\nLUAI_FUNC Proto *luaY_parser (lua_State *L, ZIO *z, Mbuffer *buff,\r\n                                            const char *name);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lstate.c",
    "content": "/*\r\n** $Id: lstate.c,v 2.36.1.2 2008/01/03 15:20:39 roberto Exp $\r\n** Global State\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stddef.h>\r\n\r\n#define lstate_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"llex.h\"\r\n#include \"lmem.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n\r\n\r\n#define state_size(x)\t(sizeof(x) + LUAI_EXTRASPACE)\r\n#define fromstate(l)\t(cast(lu_byte *, (l)) - LUAI_EXTRASPACE)\r\n#define tostate(l)   (cast(lua_State *, cast(lu_byte *, l) + LUAI_EXTRASPACE))\r\n\r\n\r\n/*\r\n** Main thread combines a thread state and the global state\r\n*/\r\ntypedef struct LG {\r\n  lua_State l;\r\n  global_State g;\r\n} LG;\r\n  \r\n\r\n\r\nstatic void stack_init (lua_State *L1, lua_State *L) {\r\n  /* initialize CallInfo array */\r\n  L1->base_ci = luaM_newvector(L, BASIC_CI_SIZE, CallInfo);\r\n  L1->ci = L1->base_ci;\r\n  L1->size_ci = BASIC_CI_SIZE;\r\n  L1->end_ci = L1->base_ci + L1->size_ci - 1;\r\n  /* initialize stack array */\r\n  L1->stack = luaM_newvector(L, BASIC_STACK_SIZE + EXTRA_STACK, TValue);\r\n  L1->stacksize = BASIC_STACK_SIZE + EXTRA_STACK;\r\n  L1->top = L1->stack;\r\n  L1->stack_last = L1->stack+(L1->stacksize - EXTRA_STACK)-1;\r\n  /* initialize first ci */\r\n  L1->ci->func = L1->top;\r\n  setnilvalue(L1->top++);  /* `function' entry for this `ci' */\r\n  L1->base = L1->ci->base = L1->top;\r\n  L1->ci->top = L1->top + LUA_MINSTACK;\r\n}\r\n\r\n\r\nstatic void freestack (lua_State *L, lua_State *L1) {\r\n  luaM_freearray(L, L1->base_ci, L1->size_ci, CallInfo);\r\n  luaM_freearray(L, L1->stack, L1->stacksize, TValue);\r\n}\r\n\r\n\r\n/*\r\n** open parts that may cause memory-allocation errors\r\n*/\r\nstatic void f_luaopen (lua_State *L, void *ud) {\r\n  global_State *g = G(L);\r\n  UNUSED(ud);\r\n  stack_init(L, L);  /* init stack */\r\n  sethvalue(L, gt(L), luaH_new(L, 0, 2));  /* table of globals */\r\n  sethvalue(L, registry(L), luaH_new(L, 0, 2));  /* registry */\r\n  luaS_resize(L, MINSTRTABSIZE);  /* initial size of string table */\r\n  luaT_init(L);\r\n  luaX_init(L);\r\n  luaS_fix(luaS_newliteral(L, MEMERRMSG));\r\n  g->GCthreshold = 4*g->totalbytes;\r\n}\r\n\r\n\r\nstatic void preinit_state (lua_State *L, global_State *g) {\r\n  G(L) = g;\r\n  L->stack = NULL;\r\n  L->stacksize = 0;\r\n  L->errorJmp = NULL;\r\n  L->hook = NULL;\r\n  L->hookmask = 0;\r\n  L->basehookcount = 0;\r\n  L->allowhook = 1;\r\n  resethookcount(L);\r\n  L->openupval = NULL;\r\n  L->size_ci = 0;\r\n  L->nCcalls = L->baseCcalls = 0;\r\n  L->status = 0;\r\n  L->base_ci = L->ci = NULL;\r\n  L->savedpc = NULL;\r\n  L->errfunc = 0;\r\n  setnilvalue(gt(L));\r\n}\r\n\r\n\r\nstatic void close_state (lua_State *L) {\r\n  global_State *g = G(L);\r\n  luaF_close(L, L->stack);  /* close all upvalues for this thread */\r\n  luaC_freeall(L);  /* collect all objects */\r\n  lua_assert(g->rootgc == obj2gco(L));\r\n  lua_assert(g->strt.nuse == 0);\r\n  luaM_freearray(L, G(L)->strt.hash, G(L)->strt.size, TString *);\r\n  luaZ_freebuffer(L, &g->buff);\r\n  freestack(L, L);\r\n  lua_assert(g->totalbytes == sizeof(LG));\r\n  (*g->frealloc)(g->ud, fromstate(L), state_size(LG), 0);\r\n}\r\n\r\n\r\nlua_State *luaE_newthread (lua_State *L) {\r\n  lua_State *L1 = tostate(luaM_malloc(L, state_size(lua_State)));\r\n  luaC_link(L, obj2gco(L1), LUA_TTHREAD);\r\n  preinit_state(L1, G(L));\r\n  stack_init(L1, L);  /* init stack */\r\n  setobj2n(L, gt(L1), gt(L));  /* share table of globals */\r\n  L1->hookmask = L->hookmask;\r\n  L1->basehookcount = L->basehookcount;\r\n  L1->hook = L->hook;\r\n  resethookcount(L1);\r\n  lua_assert(iswhite(obj2gco(L1)));\r\n  return L1;\r\n}\r\n\r\n\r\nvoid luaE_freethread (lua_State *L, lua_State *L1) {\r\n  luaF_close(L1, L1->stack);  /* close all upvalues for this thread */\r\n  lua_assert(L1->openupval == NULL);\r\n  luai_userstatefree(L1);\r\n  freestack(L, L1);\r\n  luaM_freemem(L, fromstate(L1), state_size(lua_State));\r\n}\r\n\r\n\r\nLUA_API lua_State *lua_newstate (lua_Alloc f, void *ud) {\r\n  int i;\r\n  lua_State *L;\r\n  global_State *g;\r\n  void *l = (*f)(ud, NULL, 0, state_size(LG));\r\n  if (l == NULL) return NULL;\r\n  L = tostate(l);\r\n  g = &((LG *)L)->g;\r\n  L->next = NULL;\r\n  L->tt = LUA_TTHREAD;\r\n  g->currentwhite = bit2mask(WHITE0BIT, FIXEDBIT);\r\n  L->marked = luaC_white(g);\r\n  set2bits(L->marked, FIXEDBIT, SFIXEDBIT);\r\n  preinit_state(L, g);\r\n  g->frealloc = f;\r\n  g->ud = ud;\r\n  g->mainthread = L;\r\n  g->uvhead.u.l.prev = &g->uvhead;\r\n  g->uvhead.u.l.next = &g->uvhead;\r\n  g->GCthreshold = 0;  /* mark it as unfinished state */\r\n  g->strt.size = 0;\r\n  g->strt.nuse = 0;\r\n  g->strt.hash = NULL;\r\n  setnilvalue(registry(L));\r\n  luaZ_initbuffer(L, &g->buff);\r\n  g->panic = NULL;\r\n  g->gcstate = GCSpause;\r\n  g->rootgc = obj2gco(L);\r\n  g->sweepstrgc = 0;\r\n  g->sweepgc = &g->rootgc;\r\n  g->gray = NULL;\r\n  g->grayagain = NULL;\r\n  g->weak = NULL;\r\n  g->tmudata = NULL;\r\n  g->totalbytes = sizeof(LG);\r\n  g->gcpause = LUAI_GCPAUSE;\r\n  g->gcstepmul = LUAI_GCMUL;\r\n  g->gcdept = 0;\r\n  for (i=0; i<NUM_TAGS; i++) g->mt[i] = NULL;\r\n  if (luaD_rawrunprotected(L, f_luaopen, NULL) != 0) {\r\n    /* memory allocation error: free partial state */\r\n    close_state(L);\r\n    L = NULL;\r\n  }\r\n  else\r\n    luai_userstateopen(L);\r\n  return L;\r\n}\r\n\r\n\r\nstatic void callallgcTM (lua_State *L, void *ud) {\r\n  UNUSED(ud);\r\n  luaC_callGCTM(L);  /* call GC metamethods for all udata */\r\n}\r\n\r\n\r\nLUA_API void lua_close (lua_State *L) {\r\n  L = G(L)->mainthread;  /* only the main thread can be closed */\r\n  lua_lock(L);\r\n  luaF_close(L, L->stack);  /* close all upvalues for this thread */\r\n  luaC_separateudata(L, 1);  /* separate udata that have GC metamethods */\r\n  L->errfunc = 0;  /* no error function during GC metamethods */\r\n  do {  /* repeat until no more errors */\r\n    L->ci = L->base_ci;\r\n    L->base = L->top = L->ci->base;\r\n    L->nCcalls = L->baseCcalls = 0;\r\n  } while (luaD_rawrunprotected(L, callallgcTM, NULL) != 0);\r\n  lua_assert(G(L)->tmudata == NULL);\r\n  luai_userstateclose(L);\r\n  close_state(L);\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lstate.h",
    "content": "/*\r\n** $Id: lstate.h,v 2.24.1.2 2008/01/03 15:20:39 roberto Exp $\r\n** Global State\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lstate_h\r\n#define lstate_h\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lobject.h\"\r\n#include \"ltm.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\n\r\nstruct lua_longjmp;  /* defined in ldo.c */\r\n\r\n\r\n/* table of globals */\r\n#define gt(L)\t(&L->l_gt)\r\n\r\n/* registry */\r\n#define registry(L)\t(&G(L)->l_registry)\r\n\r\n\r\n/* extra stack space to handle TM calls and some other extras */\r\n#define EXTRA_STACK   5\r\n\r\n\r\n#define BASIC_CI_SIZE           8\r\n\r\n#define BASIC_STACK_SIZE        (2*LUA_MINSTACK)\r\n\r\n\r\n\r\ntypedef struct stringtable {\r\n  GCObject **hash;\r\n  lu_int32 nuse;  /* number of elements */\r\n  int size;\r\n} stringtable;\r\n\r\n\r\n/*\r\n** informations about a call\r\n*/\r\ntypedef struct CallInfo {\r\n  StkId base;  /* base for this function */\r\n  StkId func;  /* function index in the stack */\r\n  StkId\ttop;  /* top for this function */\r\n  const Instruction *savedpc;\r\n  int nresults;  /* expected number of results from this function */\r\n  int tailcalls;  /* number of tail calls lost under this entry */\r\n} CallInfo;\r\n\r\n\r\n\r\n#define curr_func(L)\t(clvalue(L->ci->func))\r\n#define ci_func(ci)\t(clvalue((ci)->func))\r\n#define f_isLua(ci)\t(!ci_func(ci)->c.isC)\r\n#define isLua(ci)\t(ttisfunction((ci)->func) && f_isLua(ci))\r\n\r\n\r\n/*\r\n** `global state', shared by all threads of this state\r\n*/\r\ntypedef struct global_State {\r\n  stringtable strt;  /* hash table for strings */\r\n  lua_Alloc frealloc;  /* function to reallocate memory */\r\n  void *ud;         /* auxiliary data to `frealloc' */\r\n  lu_byte currentwhite;\r\n  lu_byte gcstate;  /* state of garbage collector */\r\n  int sweepstrgc;  /* position of sweep in `strt' */\r\n  GCObject *rootgc;  /* list of all collectable objects */\r\n  GCObject **sweepgc;  /* position of sweep in `rootgc' */\r\n  GCObject *gray;  /* list of gray objects */\r\n  GCObject *grayagain;  /* list of objects to be traversed atomically */\r\n  GCObject *weak;  /* list of weak tables (to be cleared) */\r\n  GCObject *tmudata;  /* last element of list of userdata to be GC */\r\n  Mbuffer buff;  /* temporary buffer for string concatentation */\r\n  lu_mem GCthreshold;\r\n  lu_mem totalbytes;  /* number of bytes currently allocated */\r\n  lu_mem estimate;  /* an estimate of number of bytes actually in use */\r\n  lu_mem gcdept;  /* how much GC is `behind schedule' */\r\n  int gcpause;  /* size of pause between successive GCs */\r\n  int gcstepmul;  /* GC `granularity' */\r\n  lua_CFunction panic;  /* to be called in unprotected errors */\r\n  TValue l_registry;\r\n  struct lua_State *mainthread;\r\n  UpVal uvhead;  /* head of double-linked list of all open upvalues */\r\n  struct Table *mt[NUM_TAGS];  /* metatables for basic types */\r\n  TString *tmname[TM_N];  /* array with tag-method names */\r\n} global_State;\r\n\r\n\r\n/*\r\n** `per thread' state\r\n*/\r\nstruct lua_State {\r\n  CommonHeader;\r\n  lu_byte status;\r\n  StkId top;  /* first free slot in the stack */\r\n  StkId base;  /* base of current function */\r\n  global_State *l_G;\r\n  CallInfo *ci;  /* call info for current function */\r\n  const Instruction *savedpc;  /* `savedpc' of current function */\r\n  StkId stack_last;  /* last free slot in the stack */\r\n  StkId stack;  /* stack base */\r\n  CallInfo *end_ci;  /* points after end of ci array*/\r\n  CallInfo *base_ci;  /* array of CallInfo's */\r\n  int stacksize;\r\n  int size_ci;  /* size of array `base_ci' */\r\n  unsigned short nCcalls;  /* number of nested C calls */\r\n  unsigned short baseCcalls;  /* nested C calls when resuming coroutine */\r\n  lu_byte hookmask;\r\n  lu_byte allowhook;\r\n  int basehookcount;\r\n  int hookcount;\r\n  lua_Hook hook;\r\n  TValue l_gt;  /* table of globals */\r\n  TValue env;  /* temporary place for environments */\r\n  GCObject *openupval;  /* list of open upvalues in this stack */\r\n  GCObject *gclist;\r\n  struct lua_longjmp *errorJmp;  /* current error recover point */\r\n  ptrdiff_t errfunc;  /* current error handling function (stack index) */\r\n};\r\n\r\n\r\n#define G(L)\t(L->l_G)\r\n\r\n\r\n/*\r\n** Union of all collectable objects\r\n*/\r\nunion GCObject {\r\n  GCheader gch;\r\n  union TString ts;\r\n  union Udata u;\r\n  union Closure cl;\r\n  struct Table h;\r\n  struct Proto p;\r\n  struct UpVal uv;\r\n  struct lua_State th;  /* thread */\r\n};\r\n\r\n\r\n/* macros to convert a GCObject into a specific value */\r\n#define rawgco2ts(o)\tcheck_exp((o)->gch.tt == LUA_TSTRING, &((o)->ts))\r\n#define gco2ts(o)\t(&rawgco2ts(o)->tsv)\r\n#define rawgco2u(o)\tcheck_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))\r\n#define gco2u(o)\t(&rawgco2u(o)->uv)\r\n#define gco2cl(o)\tcheck_exp((o)->gch.tt == LUA_TFUNCTION, &((o)->cl))\r\n#define gco2h(o)\tcheck_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))\r\n#define gco2p(o)\tcheck_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))\r\n#define gco2uv(o)\tcheck_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv))\r\n#define ngcotouv(o) \\\r\n\tcheck_exp((o) == NULL || (o)->gch.tt == LUA_TUPVAL, &((o)->uv))\r\n#define gco2th(o)\tcheck_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))\r\n\r\n/* macro to convert any Lua object into a GCObject */\r\n#define obj2gco(v)\t(cast(GCObject *, (v)))\r\n\r\n\r\nLUAI_FUNC lua_State *luaE_newthread (lua_State *L);\r\nLUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lstring.c",
    "content": "/*\r\n** $Id: lstring.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** String table (keeps all strings handled by Lua)\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <string.h>\r\n\r\n#define lstring_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n\r\n\r\n\r\nvoid luaS_resize (lua_State *L, int newsize) {\r\n  GCObject **newhash;\r\n  stringtable *tb;\r\n  int i;\r\n  if (G(L)->gcstate == GCSsweepstring)\r\n    return;  /* cannot resize during GC traverse */\r\n  newhash = luaM_newvector(L, newsize, GCObject *);\r\n  tb = &G(L)->strt;\r\n  for (i=0; i<newsize; i++) newhash[i] = NULL;\r\n  /* rehash */\r\n  for (i=0; i<tb->size; i++) {\r\n    GCObject *p = tb->hash[i];\r\n    while (p) {  /* for each node in the list */\r\n      GCObject *next = p->gch.next;  /* save next */\r\n      unsigned int h = gco2ts(p)->hash;\r\n      int h1 = lmod(h, newsize);  /* new position */\r\n      lua_assert(cast_int(h%newsize) == lmod(h, newsize));\r\n      p->gch.next = newhash[h1];  /* chain it */\r\n      newhash[h1] = p;\r\n      p = next;\r\n    }\r\n  }\r\n  luaM_freearray(L, tb->hash, tb->size, TString *);\r\n  tb->size = newsize;\r\n  tb->hash = newhash;\r\n}\r\n\r\n\r\nstatic TString *newlstr (lua_State *L, const char *str, size_t l,\r\n                                       unsigned int h) {\r\n  TString *ts;\r\n  stringtable *tb;\r\n  if (l+1 > (MAX_SIZET - sizeof(TString))/sizeof(char))\r\n    luaM_toobig(L);\r\n  ts = cast(TString *, luaM_malloc(L, (l+1)*sizeof(char)+sizeof(TString)));\r\n  ts->tsv.len = l;\r\n  ts->tsv.hash = h;\r\n  ts->tsv.marked = luaC_white(G(L));\r\n  ts->tsv.tt = LUA_TSTRING;\r\n  ts->tsv.reserved = 0;\r\n  memcpy(ts+1, str, l*sizeof(char));\r\n  ((char *)(ts+1))[l] = '\\0';  /* ending 0 */\r\n  tb = &G(L)->strt;\r\n  h = lmod(h, tb->size);\r\n  ts->tsv.next = tb->hash[h];  /* chain new entry */\r\n  tb->hash[h] = obj2gco(ts);\r\n  tb->nuse++;\r\n  if (tb->nuse > cast(lu_int32, tb->size) && tb->size <= MAX_INT/2)\r\n    luaS_resize(L, tb->size*2);  /* too crowded */\r\n  return ts;\r\n}\r\n\r\n\r\nTString *luaS_newlstr (lua_State *L, const char *str, size_t l) {\r\n  GCObject *o;\r\n  unsigned int h = cast(unsigned int, l);  /* seed */\r\n  size_t step = (l>>5)+1;  /* if string is too long, don't hash all its chars */\r\n  size_t l1;\r\n  for (l1=l; l1>=step; l1-=step)  /* compute hash */\r\n    h = h ^ ((h<<5)+(h>>2)+cast(unsigned char, str[l1-1]));\r\n  for (o = G(L)->strt.hash[lmod(h, G(L)->strt.size)];\r\n       o != NULL;\r\n       o = o->gch.next) {\r\n    TString *ts = rawgco2ts(o);\r\n    if (ts->tsv.len == l && (memcmp(str, getstr(ts), l) == 0)) {\r\n      /* string may be dead */\r\n      if (isdead(G(L), o)) changewhite(o);\r\n      return ts;\r\n    }\r\n  }\r\n  return newlstr(L, str, l, h);  /* not found */\r\n}\r\n\r\n\r\nUdata *luaS_newudata (lua_State *L, size_t s, Table *e) {\r\n  Udata *u;\r\n  if (s > MAX_SIZET - sizeof(Udata))\r\n    luaM_toobig(L);\r\n  u = cast(Udata *, luaM_malloc(L, s + sizeof(Udata)));\r\n  u->uv.marked = luaC_white(G(L));  /* is not finalized */\r\n  u->uv.tt = LUA_TUSERDATA;\r\n  u->uv.len = s;\r\n  u->uv.metatable = NULL;\r\n  u->uv.env = e;\r\n  /* chain it on udata list (after main thread) */\r\n  u->uv.next = G(L)->mainthread->next;\r\n  G(L)->mainthread->next = obj2gco(u);\r\n  return u;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lstring.h",
    "content": "/*\r\n** $Id: lstring.h,v 1.43.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** String table (keep all strings handled by Lua)\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lstring_h\r\n#define lstring_h\r\n\r\n\r\n#include \"lgc.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n\r\n\r\n#define sizestring(s)\t(sizeof(union TString)+((s)->len+1)*sizeof(char))\r\n\r\n#define sizeudata(u)\t(sizeof(union Udata)+(u)->len)\r\n\r\n#define luaS_new(L, s)\t(luaS_newlstr(L, s, strlen(s)))\r\n#define luaS_newliteral(L, s)\t(luaS_newlstr(L, \"\" s, \\\r\n                                 (sizeof(s)/sizeof(char))-1))\r\n\r\n#define luaS_fix(s)\tl_setbit((s)->tsv.marked, FIXEDBIT)\r\n\r\nLUAI_FUNC void luaS_resize (lua_State *L, int newsize);\r\nLUAI_FUNC Udata *luaS_newudata (lua_State *L, size_t s, Table *e);\r\nLUAI_FUNC TString *luaS_newlstr (lua_State *L, const char *str, size_t l);\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lstrlib.c",
    "content": "/*\r\n** $Id: lstrlib.c,v 1.132.1.5 2010/05/14 15:34:19 roberto Exp $\r\n** Standard library for string operations and pattern-matching\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <ctype.h>\r\n#include <stddef.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define lstrlib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n/* macro to `unsign' a character */\r\n#define uchar(c)        ((unsigned char)(c))\r\n\r\n\r\n\r\nstatic int str_len (lua_State *L) {\r\n  size_t l;\r\n  luaL_checklstring(L, 1, &l);\r\n  lua_pushinteger(L, l);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic ptrdiff_t posrelat (ptrdiff_t pos, size_t len) {\r\n  /* relative string position: negative means back from end */\r\n  if (pos < 0) pos += (ptrdiff_t)len + 1;\r\n  return (pos >= 0) ? pos : 0;\r\n}\r\n\r\n\r\nstatic int str_sub (lua_State *L) {\r\n  size_t l;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  ptrdiff_t start = posrelat(luaL_checkinteger(L, 2), l);\r\n  ptrdiff_t end = posrelat(luaL_optinteger(L, 3, -1), l);\r\n  if (start < 1) start = 1;\r\n  if (end > (ptrdiff_t)l) end = (ptrdiff_t)l;\r\n  if (start <= end)\r\n    lua_pushlstring(L, s+start-1, end-start+1);\r\n  else lua_pushliteral(L, \"\");\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int str_reverse (lua_State *L) {\r\n  size_t l;\r\n  luaL_Buffer b;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  luaL_buffinit(L, &b);\r\n  while (l--) luaL_addchar(&b, s[l]);\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int str_lower (lua_State *L) {\r\n  size_t l;\r\n  size_t i;\r\n  luaL_Buffer b;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  luaL_buffinit(L, &b);\r\n  for (i=0; i<l; i++)\r\n    luaL_addchar(&b, tolower(uchar(s[i])));\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int str_upper (lua_State *L) {\r\n  size_t l;\r\n  size_t i;\r\n  luaL_Buffer b;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  luaL_buffinit(L, &b);\r\n  for (i=0; i<l; i++)\r\n    luaL_addchar(&b, toupper(uchar(s[i])));\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\nstatic int str_rep (lua_State *L) {\r\n  size_t l;\r\n  luaL_Buffer b;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  int n = luaL_checkint(L, 2);\r\n  luaL_buffinit(L, &b);\r\n  while (n-- > 0)\r\n    luaL_addlstring(&b, s, l);\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int str_byte (lua_State *L) {\r\n  size_t l;\r\n  const char *s = luaL_checklstring(L, 1, &l);\r\n  ptrdiff_t posi = posrelat(luaL_optinteger(L, 2, 1), l);\r\n  ptrdiff_t pose = posrelat(luaL_optinteger(L, 3, posi), l);\r\n  int n, i;\r\n  if (posi <= 0) posi = 1;\r\n  if ((size_t)pose > l) pose = l;\r\n  if (posi > pose) return 0;  /* empty interval; return no values */\r\n  n = (int)(pose -  posi + 1);\r\n  if (posi + n <= pose)  /* overflow? */\r\n    luaL_error(L, \"string slice too long\");\r\n  luaL_checkstack(L, n, \"string slice too long\");\r\n  for (i=0; i<n; i++)\r\n    lua_pushinteger(L, uchar(s[posi+i-1]));\r\n  return n;\r\n}\r\n\r\n\r\nstatic int str_char (lua_State *L) {\r\n  int n = lua_gettop(L);  /* number of arguments */\r\n  int i;\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  for (i=1; i<=n; i++) {\r\n    int c = luaL_checkint(L, i);\r\n    luaL_argcheck(L, uchar(c) == c, i, \"invalid value\");\r\n    luaL_addchar(&b, uchar(c));\r\n  }\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int writer (lua_State *L, const void* b, size_t size, void* B) {\r\n  (void)L;\r\n  luaL_addlstring((luaL_Buffer*) B, (const char *)b, size);\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int str_dump (lua_State *L) {\r\n  luaL_Buffer b;\r\n  luaL_checktype(L, 1, LUA_TFUNCTION);\r\n  lua_settop(L, 1);\r\n  luaL_buffinit(L,&b);\r\n  if (lua_dump(L, writer, &b) != 0)\r\n    luaL_error(L, \"unable to dump given function\");\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** PATTERN MATCHING\r\n** =======================================================\r\n*/\r\n\r\n\r\n#define CAP_UNFINISHED\t(-1)\r\n#define CAP_POSITION\t(-2)\r\n\r\ntypedef struct MatchState {\r\n  const char *src_init;  /* init of source string */\r\n  const char *src_end;  /* end (`\\0') of source string */\r\n  lua_State *L;\r\n  int level;  /* total number of captures (finished or unfinished) */\r\n  struct {\r\n    const char *init;\r\n    ptrdiff_t len;\r\n  } capture[LUA_MAXCAPTURES];\r\n} MatchState;\r\n\r\n\r\n#define L_ESC\t\t'%'\r\n#define SPECIALS\t\"^$*+?.([%-\"\r\n\r\n\r\nstatic int check_capture (MatchState *ms, int l) {\r\n  l -= '1';\r\n  if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)\r\n    return luaL_error(ms->L, \"invalid capture index\");\r\n  return l;\r\n}\r\n\r\n\r\nstatic int capture_to_close (MatchState *ms) {\r\n  int level = ms->level;\r\n  for (level--; level>=0; level--)\r\n    if (ms->capture[level].len == CAP_UNFINISHED) return level;\r\n  return luaL_error(ms->L, \"invalid pattern capture\");\r\n}\r\n\r\n\r\nstatic const char *classend (MatchState *ms, const char *p) {\r\n  switch (*p++) {\r\n    case L_ESC: {\r\n      if (*p == '\\0')\r\n        luaL_error(ms->L, \"malformed pattern (ends with \" LUA_QL(\"%%\") \")\");\r\n      return p+1;\r\n    }\r\n    case '[': {\r\n      if (*p == '^') p++;\r\n      do {  /* look for a `]' */\r\n        if (*p == '\\0')\r\n          luaL_error(ms->L, \"malformed pattern (missing \" LUA_QL(\"]\") \")\");\r\n        if (*(p++) == L_ESC && *p != '\\0')\r\n          p++;  /* skip escapes (e.g. `%]') */\r\n      } while (*p != ']');\r\n      return p+1;\r\n    }\r\n    default: {\r\n      return p;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic int match_class (int c, int cl) {\r\n  int res;\r\n  switch (tolower(cl)) {\r\n    case 'a' : res = isalpha(c); break;\r\n    case 'c' : res = iscntrl(c); break;\r\n    case 'd' : res = isdigit(c); break;\r\n    case 'l' : res = islower(c); break;\r\n    case 'p' : res = ispunct(c); break;\r\n    case 's' : res = isspace(c); break;\r\n    case 'u' : res = isupper(c); break;\r\n    case 'w' : res = isalnum(c); break;\r\n    case 'x' : res = isxdigit(c); break;\r\n    case 'z' : res = (c == 0); break;\r\n    default: return (cl == c);\r\n  }\r\n  return (islower(cl) ? res : !res);\r\n}\r\n\r\n\r\nstatic int matchbracketclass (int c, const char *p, const char *ec) {\r\n  int sig = 1;\r\n  if (*(p+1) == '^') {\r\n    sig = 0;\r\n    p++;  /* skip the `^' */\r\n  }\r\n  while (++p < ec) {\r\n    if (*p == L_ESC) {\r\n      p++;\r\n      if (match_class(c, uchar(*p)))\r\n        return sig;\r\n    }\r\n    else if ((*(p+1) == '-') && (p+2 < ec)) {\r\n      p+=2;\r\n      if (uchar(*(p-2)) <= c && c <= uchar(*p))\r\n        return sig;\r\n    }\r\n    else if (uchar(*p) == c) return sig;\r\n  }\r\n  return !sig;\r\n}\r\n\r\n\r\nstatic int singlematch (int c, const char *p, const char *ep) {\r\n  switch (*p) {\r\n    case '.': return 1;  /* matches any char */\r\n    case L_ESC: return match_class(c, uchar(*(p+1)));\r\n    case '[': return matchbracketclass(c, p, ep-1);\r\n    default:  return (uchar(*p) == c);\r\n  }\r\n}\r\n\r\n\r\nstatic const char *match (MatchState *ms, const char *s, const char *p);\r\n\r\n\r\nstatic const char *matchbalance (MatchState *ms, const char *s,\r\n                                   const char *p) {\r\n  if (*p == 0 || *(p+1) == 0)\r\n    luaL_error(ms->L, \"unbalanced pattern\");\r\n  if (*s != *p) return NULL;\r\n  else {\r\n    int b = *p;\r\n    int e = *(p+1);\r\n    int cont = 1;\r\n    while (++s < ms->src_end) {\r\n      if (*s == e) {\r\n        if (--cont == 0) return s+1;\r\n      }\r\n      else if (*s == b) cont++;\r\n    }\r\n  }\r\n  return NULL;  /* string ends out of balance */\r\n}\r\n\r\n\r\nstatic const char *max_expand (MatchState *ms, const char *s,\r\n                                 const char *p, const char *ep) {\r\n  ptrdiff_t i = 0;  /* counts maximum expand for item */\r\n  while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep))\r\n    i++;\r\n  /* keeps trying to match with the maximum repetitions */\r\n  while (i>=0) {\r\n    const char *res = match(ms, (s+i), ep+1);\r\n    if (res) return res;\r\n    i--;  /* else didn't match; reduce 1 repetition to try again */\r\n  }\r\n  return NULL;\r\n}\r\n\r\n\r\nstatic const char *min_expand (MatchState *ms, const char *s,\r\n                                 const char *p, const char *ep) {\r\n  for (;;) {\r\n    const char *res = match(ms, s, ep+1);\r\n    if (res != NULL)\r\n      return res;\r\n    else if (s<ms->src_end && singlematch(uchar(*s), p, ep))\r\n      s++;  /* try with one more repetition */\r\n    else return NULL;\r\n  }\r\n}\r\n\r\n\r\nstatic const char *start_capture (MatchState *ms, const char *s,\r\n                                    const char *p, int what) {\r\n  const char *res;\r\n  int level = ms->level;\r\n  if (level >= LUA_MAXCAPTURES) luaL_error(ms->L, \"too many captures\");\r\n  ms->capture[level].init = s;\r\n  ms->capture[level].len = what;\r\n  ms->level = level+1;\r\n  if ((res=match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->level--;  /* undo capture */\r\n  return res;\r\n}\r\n\r\n\r\nstatic const char *end_capture (MatchState *ms, const char *s,\r\n                                  const char *p) {\r\n  int l = capture_to_close(ms);\r\n  const char *res;\r\n  ms->capture[l].len = s - ms->capture[l].init;  /* close capture */\r\n  if ((res = match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->capture[l].len = CAP_UNFINISHED;  /* undo capture */\r\n  return res;\r\n}\r\n\r\n\r\nstatic const char *match_capture (MatchState *ms, const char *s, int l) {\r\n  size_t len;\r\n  l = check_capture(ms, l);\r\n  len = ms->capture[l].len;\r\n  if ((size_t)(ms->src_end-s) >= len &&\r\n      memcmp(ms->capture[l].init, s, len) == 0)\r\n    return s+len;\r\n  else return NULL;\r\n}\r\n\r\n\r\nstatic const char *match (MatchState *ms, const char *s, const char *p) {\r\n  init: /* using goto's to optimize tail recursion */\r\n  switch (*p) {\r\n    case '(': {  /* start capture */\r\n      if (*(p+1) == ')')  /* position capture? */\r\n        return start_capture(ms, s, p+2, CAP_POSITION);\r\n      else\r\n        return start_capture(ms, s, p+1, CAP_UNFINISHED);\r\n    }\r\n    case ')': {  /* end capture */\r\n      return end_capture(ms, s, p+1);\r\n    }\r\n    case L_ESC: {\r\n      switch (*(p+1)) {\r\n        case 'b': {  /* balanced string? */\r\n          s = matchbalance(ms, s, p+2);\r\n          if (s == NULL) return NULL;\r\n          p+=4; goto init;  /* else return match(ms, s, p+4); */\r\n        }\r\n        case 'f': {  /* frontier? */\r\n          const char *ep; char previous;\r\n          p += 2;\r\n          if (*p != '[')\r\n            luaL_error(ms->L, \"missing \" LUA_QL(\"[\") \" after \"\r\n                               LUA_QL(\"%%f\") \" in pattern\");\r\n          ep = classend(ms, p);  /* points to what is next */\r\n          previous = (s == ms->src_init) ? '\\0' : *(s-1);\r\n          if (matchbracketclass(uchar(previous), p, ep-1) ||\r\n             !matchbracketclass(uchar(*s), p, ep-1)) return NULL;\r\n          p=ep; goto init;  /* else return match(ms, s, ep); */\r\n        }\r\n        default: {\r\n          if (isdigit(uchar(*(p+1)))) {  /* capture results (%0-%9)? */\r\n            s = match_capture(ms, s, uchar(*(p+1)));\r\n            if (s == NULL) return NULL;\r\n            p+=2; goto init;  /* else return match(ms, s, p+2) */\r\n          }\r\n          goto dflt;  /* case default */\r\n        }\r\n      }\r\n    }\r\n    case '\\0': {  /* end of pattern */\r\n      return s;  /* match succeeded */\r\n    }\r\n    case '$': {\r\n      if (*(p+1) == '\\0')  /* is the `$' the last char in pattern? */\r\n        return (s == ms->src_end) ? s : NULL;  /* check end of string */\r\n      else goto dflt;\r\n    }\r\n    default: dflt: {  /* it is a pattern item */\r\n      const char *ep = classend(ms, p);  /* points to what is next */\r\n      int m = s<ms->src_end && singlematch(uchar(*s), p, ep);\r\n      switch (*ep) {\r\n        case '?': {  /* optional */\r\n          const char *res;\r\n          if (m && ((res=match(ms, s+1, ep+1)) != NULL))\r\n            return res;\r\n          p=ep+1; goto init;  /* else return match(ms, s, ep+1); */\r\n        }\r\n        case '*': {  /* 0 or more repetitions */\r\n          return max_expand(ms, s, p, ep);\r\n        }\r\n        case '+': {  /* 1 or more repetitions */\r\n          return (m ? max_expand(ms, s+1, p, ep) : NULL);\r\n        }\r\n        case '-': {  /* 0 or more repetitions (minimum) */\r\n          return min_expand(ms, s, p, ep);\r\n        }\r\n        default: {\r\n          if (!m) return NULL;\r\n          s++; p=ep; goto init;  /* else return match(ms, s+1, ep); */\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n\r\n\r\nstatic const char *lmemfind (const char *s1, size_t l1,\r\n                               const char *s2, size_t l2) {\r\n  if (l2 == 0) return s1;  /* empty strings are everywhere */\r\n  else if (l2 > l1) return NULL;  /* avoids a negative `l1' */\r\n  else {\r\n    const char *init;  /* to search for a `*s2' inside `s1' */\r\n    l2--;  /* 1st char will be checked by `memchr' */\r\n    l1 = l1-l2;  /* `s2' cannot be found after that */\r\n    while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) {\r\n      init++;   /* 1st char is already checked */\r\n      if (memcmp(init, s2+1, l2) == 0)\r\n        return init-1;\r\n      else {  /* correct `l1' and `s1' to try again */\r\n        l1 -= init-s1;\r\n        s1 = init;\r\n      }\r\n    }\r\n    return NULL;  /* not found */\r\n  }\r\n}\r\n\r\n\r\nstatic void push_onecapture (MatchState *ms, int i, const char *s,\r\n                                                    const char *e) {\r\n  if (i >= ms->level) {\r\n    if (i == 0)  /* ms->level == 0, too */\r\n      lua_pushlstring(ms->L, s, e - s);  /* add whole match */\r\n    else\r\n      luaL_error(ms->L, \"invalid capture index\");\r\n  }\r\n  else {\r\n    ptrdiff_t l = ms->capture[i].len;\r\n    if (l == CAP_UNFINISHED) luaL_error(ms->L, \"unfinished capture\");\r\n    if (l == CAP_POSITION)\r\n      lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1);\r\n    else\r\n      lua_pushlstring(ms->L, ms->capture[i].init, l);\r\n  }\r\n}\r\n\r\n\r\nstatic int push_captures (MatchState *ms, const char *s, const char *e) {\r\n  int i;\r\n  int nlevels = (ms->level == 0 && s) ? 1 : ms->level;\r\n  luaL_checkstack(ms->L, nlevels, \"too many captures\");\r\n  for (i = 0; i < nlevels; i++)\r\n    push_onecapture(ms, i, s, e);\r\n  return nlevels;  /* number of strings pushed */\r\n}\r\n\r\n\r\nstatic int str_find_aux (lua_State *L, int find) {\r\n  size_t l1, l2;\r\n  const char *s = luaL_checklstring(L, 1, &l1);\r\n  const char *p = luaL_checklstring(L, 2, &l2);\r\n  ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1;\r\n  if (init < 0) init = 0;\r\n  else if ((size_t)(init) > l1) init = (ptrdiff_t)l1;\r\n  if (find && (lua_toboolean(L, 4) ||  /* explicit request? */\r\n      strpbrk(p, SPECIALS) == NULL)) {  /* or no special characters? */\r\n    /* do a plain search */\r\n    const char *s2 = lmemfind(s+init, l1-init, p, l2);\r\n    if (s2) {\r\n      lua_pushinteger(L, s2-s+1);\r\n      lua_pushinteger(L, s2-s+l2);\r\n      return 2;\r\n    }\r\n  }\r\n  else {\r\n    MatchState ms;\r\n    int anchor = (*p == '^') ? (p++, 1) : 0;\r\n    const char *s1=s+init;\r\n    ms.L = L;\r\n    ms.src_init = s;\r\n    ms.src_end = s+l1;\r\n    do {\r\n      const char *res;\r\n      ms.level = 0;\r\n      if ((res=match(&ms, s1, p)) != NULL) {\r\n        if (find) {\r\n          lua_pushinteger(L, s1-s+1);  /* start */\r\n          lua_pushinteger(L, res-s);   /* end */\r\n          return push_captures(&ms, NULL, 0) + 2;\r\n        }\r\n        else\r\n          return push_captures(&ms, s1, res);\r\n      }\r\n    } while (s1++ < ms.src_end && !anchor);\r\n  }\r\n  lua_pushnil(L);  /* not found */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int str_find (lua_State *L) {\r\n  return str_find_aux(L, 1);\r\n}\r\n\r\n\r\nstatic int str_match (lua_State *L) {\r\n  return str_find_aux(L, 0);\r\n}\r\n\r\n\r\nstatic int gmatch_aux (lua_State *L) {\r\n  MatchState ms;\r\n  size_t ls;\r\n  const char *s = lua_tolstring(L, lua_upvalueindex(1), &ls);\r\n  const char *p = lua_tostring(L, lua_upvalueindex(2));\r\n  const char *src;\r\n  ms.L = L;\r\n  ms.src_init = s;\r\n  ms.src_end = s+ls;\r\n  for (src = s + (size_t)lua_tointeger(L, lua_upvalueindex(3));\r\n       src <= ms.src_end;\r\n       src++) {\r\n    const char *e;\r\n    ms.level = 0;\r\n    if ((e = match(&ms, src, p)) != NULL) {\r\n      lua_Integer newstart = e-s;\r\n      if (e == src) newstart++;  /* empty match? go at least one position */\r\n      lua_pushinteger(L, newstart);\r\n      lua_replace(L, lua_upvalueindex(3));\r\n      return push_captures(&ms, src, e);\r\n    }\r\n  }\r\n  return 0;  /* not found */\r\n}\r\n\r\n\r\nstatic int gmatch (lua_State *L) {\r\n  luaL_checkstring(L, 1);\r\n  luaL_checkstring(L, 2);\r\n  lua_settop(L, 2);\r\n  lua_pushinteger(L, 0);\r\n  lua_pushcclosure(L, gmatch_aux, 3);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int gfind_nodef (lua_State *L) {\r\n  return luaL_error(L, LUA_QL(\"string.gfind\") \" was renamed to \"\r\n                       LUA_QL(\"string.gmatch\"));\r\n}\r\n\r\n\r\nstatic void add_s (MatchState *ms, luaL_Buffer *b, const char *s,\r\n                                                   const char *e) {\r\n  size_t l, i;\r\n  const char *news = lua_tolstring(ms->L, 3, &l);\r\n  for (i = 0; i < l; i++) {\r\n    if (news[i] != L_ESC)\r\n      luaL_addchar(b, news[i]);\r\n    else {\r\n      i++;  /* skip ESC */\r\n      if (!isdigit(uchar(news[i])))\r\n        luaL_addchar(b, news[i]);\r\n      else if (news[i] == '0')\r\n          luaL_addlstring(b, s, e - s);\r\n      else {\r\n        push_onecapture(ms, news[i] - '1', s, e);\r\n        luaL_addvalue(b);  /* add capture to accumulated result */\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n\r\nstatic void add_value (MatchState *ms, luaL_Buffer *b, const char *s,\r\n                                                       const char *e) {\r\n  lua_State *L = ms->L;\r\n  switch (lua_type(L, 3)) {\r\n    case LUA_TNUMBER:\r\n    case LUA_TSTRING: {\r\n      add_s(ms, b, s, e);\r\n      return;\r\n    }\r\n    case LUA_TFUNCTION: {\r\n      int n;\r\n      lua_pushvalue(L, 3);\r\n      n = push_captures(ms, s, e);\r\n      lua_call(L, n, 1);\r\n      break;\r\n    }\r\n    case LUA_TTABLE: {\r\n      push_onecapture(ms, 0, s, e);\r\n      lua_gettable(L, 3);\r\n      break;\r\n    }\r\n  }\r\n  if (!lua_toboolean(L, -1)) {  /* nil or false? */\r\n    lua_pop(L, 1);\r\n    lua_pushlstring(L, s, e - s);  /* keep original text */\r\n  }\r\n  else if (!lua_isstring(L, -1))\r\n    luaL_error(L, \"invalid replacement value (a %s)\", luaL_typename(L, -1)); \r\n  luaL_addvalue(b);  /* add result to accumulator */\r\n}\r\n\r\n\r\nstatic int str_gsub (lua_State *L) {\r\n  size_t srcl;\r\n  const char *src = luaL_checklstring(L, 1, &srcl);\r\n  const char *p = luaL_checkstring(L, 2);\r\n  int  tr = lua_type(L, 3);\r\n  int max_s = luaL_optint(L, 4, srcl+1);\r\n  int anchor = (*p == '^') ? (p++, 1) : 0;\r\n  int n = 0;\r\n  MatchState ms;\r\n  luaL_Buffer b;\r\n  luaL_argcheck(L, tr == LUA_TNUMBER || tr == LUA_TSTRING ||\r\n                   tr == LUA_TFUNCTION || tr == LUA_TTABLE, 3,\r\n                      \"string/function/table expected\");\r\n  luaL_buffinit(L, &b);\r\n  ms.L = L;\r\n  ms.src_init = src;\r\n  ms.src_end = src+srcl;\r\n  while (n < max_s) {\r\n    const char *e;\r\n    ms.level = 0;\r\n    e = match(&ms, src, p);\r\n    if (e) {\r\n      n++;\r\n      add_value(&ms, &b, src, e);\r\n    }\r\n    if (e && e>src) /* non empty match? */\r\n      src = e;  /* skip it */\r\n    else if (src < ms.src_end)\r\n      luaL_addchar(&b, *src++);\r\n    else break;\r\n    if (anchor) break;\r\n  }\r\n  luaL_addlstring(&b, src, ms.src_end-src);\r\n  luaL_pushresult(&b);\r\n  lua_pushinteger(L, n);  /* number of substitutions */\r\n  return 2;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\n/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */\r\n#define MAX_ITEM\t512\r\n/* valid flags in a format specification */\r\n#define FLAGS\t\"-+ #0\"\r\n/*\r\n** maximum size of each format specification (such as '%-099.99d')\r\n** (+10 accounts for %99.99x plus margin of error)\r\n*/\r\n#define MAX_FORMAT\t(sizeof(FLAGS) + sizeof(LUA_INTFRMLEN) + 10)\r\n\r\n\r\nstatic void addquoted (lua_State *L, luaL_Buffer *b, int arg) {\r\n  size_t l;\r\n  const char *s = luaL_checklstring(L, arg, &l);\r\n  luaL_addchar(b, '\"');\r\n  while (l--) {\r\n    switch (*s) {\r\n      case '\"': case '\\\\': case '\\n': {\r\n        luaL_addchar(b, '\\\\');\r\n        luaL_addchar(b, *s);\r\n        break;\r\n      }\r\n      case '\\r': {\r\n        luaL_addlstring(b, \"\\\\r\", 2);\r\n        break;\r\n      }\r\n      case '\\0': {\r\n        luaL_addlstring(b, \"\\\\000\", 4);\r\n        break;\r\n      }\r\n      default: {\r\n        luaL_addchar(b, *s);\r\n        break;\r\n      }\r\n    }\r\n    s++;\r\n  }\r\n  luaL_addchar(b, '\"');\r\n}\r\n\r\nstatic const char *scanformat (lua_State *L, const char *strfrmt, char *form) {\r\n  const char *p = strfrmt;\r\n  while (*p != '\\0' && strchr(FLAGS, *p) != NULL) p++;  /* skip flags */\r\n  if ((size_t)(p - strfrmt) >= sizeof(FLAGS))\r\n    luaL_error(L, \"invalid format (repeated flags)\");\r\n  if (isdigit(uchar(*p))) p++;  /* skip width */\r\n  if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */\r\n  if (*p == '.') {\r\n    p++;\r\n    if (isdigit(uchar(*p))) p++;  /* skip precision */\r\n    if (isdigit(uchar(*p))) p++;  /* (2 digits at most) */\r\n  }\r\n  if (isdigit(uchar(*p)))\r\n    luaL_error(L, \"invalid format (width or precision too long)\");\r\n  *(form++) = '%';\r\n  strncpy(form, strfrmt, p - strfrmt + 1);\r\n  form += p - strfrmt + 1;\r\n  *form = '\\0';\r\n  return p;\r\n}\r\n\r\n\r\nstatic void addintlen (char *form) {\r\n  size_t l = strlen(form);\r\n  char spec = form[l - 1];\r\n  strcpy(form + l - 1, LUA_INTFRMLEN);\r\n  form[l + sizeof(LUA_INTFRMLEN) - 2] = spec;\r\n  form[l + sizeof(LUA_INTFRMLEN) - 1] = '\\0';\r\n}\r\n\r\n\r\nstatic int str_format (lua_State *L) {\r\n  int top = lua_gettop(L);\r\n  int arg = 1;\r\n  size_t sfl;\r\n  const char *strfrmt = luaL_checklstring(L, arg, &sfl);\r\n  const char *strfrmt_end = strfrmt+sfl;\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  while (strfrmt < strfrmt_end) {\r\n    if (*strfrmt != L_ESC)\r\n      luaL_addchar(&b, *strfrmt++);\r\n    else if (*++strfrmt == L_ESC)\r\n      luaL_addchar(&b, *strfrmt++);  /* %% */\r\n    else { /* format item */\r\n      char form[MAX_FORMAT];  /* to store the format (`%...') */\r\n      char buff[MAX_ITEM];  /* to store the formatted item */\r\n      if (++arg > top)\r\n        luaL_argerror(L, arg, \"no value\");\r\n      strfrmt = scanformat(L, strfrmt, form);\r\n      switch (*strfrmt++) {\r\n        case 'c': {\r\n          sprintf(buff, form, (int)luaL_checknumber(L, arg));\r\n          break;\r\n        }\r\n        case 'd':  case 'i': {\r\n          addintlen(form);\r\n          sprintf(buff, form, (LUA_INTFRM_T)luaL_checknumber(L, arg));\r\n          break;\r\n        }\r\n        case 'o':  case 'u':  case 'x':  case 'X': {\r\n          addintlen(form);\r\n          sprintf(buff, form, (unsigned LUA_INTFRM_T)luaL_checknumber(L, arg));\r\n          break;\r\n        }\r\n        case 'e':  case 'E': case 'f':\r\n        case 'g': case 'G': {\r\n          sprintf(buff, form, (double)luaL_checknumber(L, arg));\r\n          break;\r\n        }\r\n        case 'q': {\r\n          addquoted(L, &b, arg);\r\n          continue;  /* skip the 'addsize' at the end */\r\n        }\r\n        case 's': {\r\n          size_t l;\r\n          const char *s = luaL_checklstring(L, arg, &l);\r\n          if (!strchr(form, '.') && l >= 100) {\r\n            /* no precision and string is too long to be formatted;\r\n               keep original string */\r\n            lua_pushvalue(L, arg);\r\n            luaL_addvalue(&b);\r\n            continue;  /* skip the `addsize' at the end */\r\n          }\r\n          else {\r\n            sprintf(buff, form, s);\r\n            break;\r\n          }\r\n        }\r\n        default: {  /* also treat cases `pnLlh' */\r\n          return luaL_error(L, \"invalid option \" LUA_QL(\"%%%c\") \" to \"\r\n                               LUA_QL(\"format\"), *(strfrmt - 1));\r\n        }\r\n      }\r\n      luaL_addlstring(&b, buff, strlen(buff));\r\n    }\r\n  }\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const luaL_Reg strlib[] = {\r\n  {\"byte\", str_byte},\r\n  {\"char\", str_char},\r\n  {\"dump\", str_dump},\r\n  {\"find\", str_find},\r\n  {\"format\", str_format},\r\n  {\"gfind\", gfind_nodef},\r\n  {\"gmatch\", gmatch},\r\n  {\"gsub\", str_gsub},\r\n  {\"len\", str_len},\r\n  {\"lower\", str_lower},\r\n  {\"match\", str_match},\r\n  {\"rep\", str_rep},\r\n  {\"reverse\", str_reverse},\r\n  {\"sub\", str_sub},\r\n  {\"upper\", str_upper},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nstatic void createmetatable (lua_State *L) {\r\n  lua_createtable(L, 0, 1);  /* create metatable for strings */\r\n  lua_pushliteral(L, \"\");  /* dummy string */\r\n  lua_pushvalue(L, -2);\r\n  lua_setmetatable(L, -2);  /* set string metatable */\r\n  lua_pop(L, 1);  /* pop dummy string */\r\n  lua_pushvalue(L, -2);  /* string library... */\r\n  lua_setfield(L, -2, \"__index\");  /* ...is the __index metamethod */\r\n  lua_pop(L, 1);  /* pop metatable */\r\n}\r\n\r\n\r\n/*\r\n** Open string library\r\n*/\r\nLUALIB_API int luaopen_string (lua_State *L) {\r\n  luaL_register(L, LUA_STRLIBNAME, strlib);\r\n#if defined(LUA_COMPAT_GFIND)\r\n  lua_getfield(L, -1, \"gmatch\");\r\n  lua_setfield(L, -2, \"gfind\");\r\n#endif\r\n  createmetatable(L);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ltable.c",
    "content": "/*\r\n** $Id: ltable.c,v 2.32.1.2 2007/12/28 15:32:23 roberto Exp $\r\n** Lua tables (hash)\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n/*\r\n** Implementation of tables (aka arrays, objects, or hash tables).\r\n** Tables keep its elements in two parts: an array part and a hash part.\r\n** Non-negative integer keys are all candidates to be kept in the array\r\n** part. The actual size of the array is the largest `n' such that at\r\n** least half the slots between 0 and n are in use.\r\n** Hash uses a mix of chained scatter table with Brent's variation.\r\n** A main invariant of these tables is that, if an element is not\r\n** in its main position (i.e. the `original' position that its hash gives\r\n** to it), then the colliding element is in its own main position.\r\n** Hence even when the load factor reaches 100%, performance remains good.\r\n*/\r\n\r\n#include <math.h>\r\n#include <string.h>\r\n\r\n#define ltable_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lgc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"ltable.h\"\r\n\r\n\r\n/*\r\n** max size of array part is 2^MAXBITS\r\n*/\r\n#if LUAI_BITSINT > 26\r\n#define MAXBITS\t\t26\r\n#else\r\n#define MAXBITS\t\t(LUAI_BITSINT-2)\r\n#endif\r\n\r\n#define MAXASIZE\t(1 << MAXBITS)\r\n\r\n\r\n#define hashpow2(t,n)      (gnode(t, lmod((n), sizenode(t))))\r\n  \r\n#define hashstr(t,str)  hashpow2(t, (str)->tsv.hash)\r\n#define hashboolean(t,p)        hashpow2(t, p)\r\n\r\n\r\n/*\r\n** for some types, it is better to avoid modulus by power of 2, as\r\n** they tend to have many 2 factors.\r\n*/\r\n#define hashmod(t,n)\t(gnode(t, ((n) % ((sizenode(t)-1)|1))))\r\n\r\n\r\n#define hashpointer(t,p)\thashmod(t, IntPoint(p))\r\n\r\n\r\n/*\r\n** number of ints inside a lua_Number\r\n*/\r\n#define numints\t\tcast_int(sizeof(lua_Number)/sizeof(int))\r\n\r\n\r\n\r\n#define dummynode\t\t(&dummynode_)\r\n\r\nstatic const Node dummynode_ = {\r\n  {{NULL}, LUA_TNIL},  /* value */\r\n  {{{NULL}, LUA_TNIL, NULL}}  /* key */\r\n};\r\n\r\n\r\n/*\r\n** hash for lua_Numbers\r\n*/\r\nstatic Node *hashnum (const Table *t, lua_Number n) {\r\n  unsigned int a[numints];\r\n  int i;\r\n  if (luai_numeq(n, 0))  /* avoid problems with -0 */\r\n    return gnode(t, 0);\r\n  memcpy(a, &n, sizeof(a));\r\n  for (i = 1; i < numints; i++) a[0] += a[i];\r\n  return hashmod(t, a[0]);\r\n}\r\n\r\n\r\n\r\n/*\r\n** returns the `main' position of an element in a table (that is, the index\r\n** of its hash value)\r\n*/\r\nstatic Node *mainposition (const Table *t, const TValue *key) {\r\n  switch (ttype(key)) {\r\n    case LUA_TNUMBER:\r\n      return hashnum(t, nvalue(key));\r\n    case LUA_TSTRING:\r\n      return hashstr(t, rawtsvalue(key));\r\n    case LUA_TBOOLEAN:\r\n      return hashboolean(t, bvalue(key));\r\n    case LUA_TLIGHTUSERDATA:\r\n      return hashpointer(t, pvalue(key));\r\n    default:\r\n      return hashpointer(t, gcvalue(key));\r\n  }\r\n}\r\n\r\n\r\n/*\r\n** returns the index for `key' if `key' is an appropriate key to live in\r\n** the array part of the table, -1 otherwise.\r\n*/\r\nstatic int arrayindex (const TValue *key) {\r\n  if (ttisnumber(key)) {\r\n    lua_Number n = nvalue(key);\r\n    int k;\r\n    lua_number2int(k, n);\r\n    if (luai_numeq(cast_num(k), n))\r\n      return k;\r\n  }\r\n  return -1;  /* `key' did not match some condition */\r\n}\r\n\r\n\r\n/*\r\n** returns the index of a `key' for table traversals. First goes all\r\n** elements in the array part, then elements in the hash part. The\r\n** beginning of a traversal is signalled by -1.\r\n*/\r\nstatic int findindex (lua_State *L, Table *t, StkId key) {\r\n  int i;\r\n  if (ttisnil(key)) return -1;  /* first iteration */\r\n  i = arrayindex(key);\r\n  if (0 < i && i <= t->sizearray)  /* is `key' inside array part? */\r\n    return i-1;  /* yes; that's the index (corrected to C) */\r\n  else {\r\n    Node *n = mainposition(t, key);\r\n    do {  /* check whether `key' is somewhere in the chain */\r\n      /* key may be dead already, but it is ok to use it in `next' */\r\n      if (luaO_rawequalObj(key2tval(n), key) ||\r\n            (ttype(gkey(n)) == LUA_TDEADKEY && iscollectable(key) &&\r\n             gcvalue(gkey(n)) == gcvalue(key))) {\r\n        i = cast_int(n - gnode(t, 0));  /* key index in hash table */\r\n        /* hash elements are numbered after array ones */\r\n        return i + t->sizearray;\r\n      }\r\n      else n = gnext(n);\r\n    } while (n);\r\n    luaG_runerror(L, \"invalid key to \" LUA_QL(\"next\"));  /* key not found */\r\n    return 0;  /* to avoid warnings */\r\n  }\r\n}\r\n\r\n\r\nint luaH_next (lua_State *L, Table *t, StkId key) {\r\n  int i = findindex(L, t, key);  /* find original element */\r\n  for (i++; i < t->sizearray; i++) {  /* try first array part */\r\n    if (!ttisnil(&t->array[i])) {  /* a non-nil value? */\r\n      setnvalue(key, cast_num(i+1));\r\n      setobj2s(L, key+1, &t->array[i]);\r\n      return 1;\r\n    }\r\n  }\r\n  for (i -= t->sizearray; i < sizenode(t); i++) {  /* then hash part */\r\n    if (!ttisnil(gval(gnode(t, i)))) {  /* a non-nil value? */\r\n      setobj2s(L, key, key2tval(gnode(t, i)));\r\n      setobj2s(L, key+1, gval(gnode(t, i)));\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* no more elements */\r\n}\r\n\r\n\r\n/*\r\n** {=============================================================\r\n** Rehash\r\n** ==============================================================\r\n*/\r\n\r\n\r\nstatic int computesizes (int nums[], int *narray) {\r\n  int i;\r\n  int twotoi;  /* 2^i */\r\n  int a = 0;  /* number of elements smaller than 2^i */\r\n  int na = 0;  /* number of elements to go to array part */\r\n  int n = 0;  /* optimal size for array part */\r\n  for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {\r\n    if (nums[i] > 0) {\r\n      a += nums[i];\r\n      if (a > twotoi/2) {  /* more than half elements present? */\r\n        n = twotoi;  /* optimal size (till now) */\r\n        na = a;  /* all elements smaller than n will go to array part */\r\n      }\r\n    }\r\n    if (a == *narray) break;  /* all elements already counted */\r\n  }\r\n  *narray = n;\r\n  lua_assert(*narray/2 <= na && na <= *narray);\r\n  return na;\r\n}\r\n\r\n\r\nstatic int countint (const TValue *key, int *nums) {\r\n  int k = arrayindex(key);\r\n  if (0 < k && k <= MAXASIZE) {  /* is `key' an appropriate array index? */\r\n    nums[ceillog2(k)]++;  /* count as such */\r\n    return 1;\r\n  }\r\n  else\r\n    return 0;\r\n}\r\n\r\n\r\nstatic int numusearray (const Table *t, int *nums) {\r\n  int lg;\r\n  int ttlg;  /* 2^lg */\r\n  int ause = 0;  /* summation of `nums' */\r\n  int i = 1;  /* count to traverse all array keys */\r\n  for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) {  /* for each slice */\r\n    int lc = 0;  /* counter */\r\n    int lim = ttlg;\r\n    if (lim > t->sizearray) {\r\n      lim = t->sizearray;  /* adjust upper limit */\r\n      if (i > lim)\r\n        break;  /* no more elements to count */\r\n    }\r\n    /* count elements in range (2^(lg-1), 2^lg] */\r\n    for (; i <= lim; i++) {\r\n      if (!ttisnil(&t->array[i-1]))\r\n        lc++;\r\n    }\r\n    nums[lg] += lc;\r\n    ause += lc;\r\n  }\r\n  return ause;\r\n}\r\n\r\n\r\nstatic int numusehash (const Table *t, int *nums, int *pnasize) {\r\n  int totaluse = 0;  /* total number of elements */\r\n  int ause = 0;  /* summation of `nums' */\r\n  int i = sizenode(t);\r\n  while (i--) {\r\n    Node *n = &t->node[i];\r\n    if (!ttisnil(gval(n))) {\r\n      ause += countint(key2tval(n), nums);\r\n      totaluse++;\r\n    }\r\n  }\r\n  *pnasize += ause;\r\n  return totaluse;\r\n}\r\n\r\n\r\nstatic void setarrayvector (lua_State *L, Table *t, int size) {\r\n  int i;\r\n  luaM_reallocvector(L, t->array, t->sizearray, size, TValue);\r\n  for (i=t->sizearray; i<size; i++)\r\n     setnilvalue(&t->array[i]);\r\n  t->sizearray = size;\r\n}\r\n\r\n\r\nstatic void setnodevector (lua_State *L, Table *t, int size) {\r\n  int lsize;\r\n  if (size == 0) {  /* no elements to hash part? */\r\n    t->node = cast(Node *, dummynode);  /* use common `dummynode' */\r\n    lsize = 0;\r\n  }\r\n  else {\r\n    int i;\r\n    lsize = ceillog2(size);\r\n    if (lsize > MAXBITS)\r\n      luaG_runerror(L, \"table overflow\");\r\n    size = twoto(lsize);\r\n    t->node = luaM_newvector(L, size, Node);\r\n    for (i=0; i<size; i++) {\r\n      Node *n = gnode(t, i);\r\n      gnext(n) = NULL;\r\n      setnilvalue(gkey(n));\r\n      setnilvalue(gval(n));\r\n    }\r\n  }\r\n  t->lsizenode = cast_byte(lsize);\r\n  t->lastfree = gnode(t, size);  /* all positions are free */\r\n}\r\n\r\n\r\nstatic void resize (lua_State *L, Table *t, int nasize, int nhsize) {\r\n  int i;\r\n  int oldasize = t->sizearray;\r\n  int oldhsize = t->lsizenode;\r\n  Node *nold = t->node;  /* save old hash ... */\r\n  if (nasize > oldasize)  /* array part must grow? */\r\n    setarrayvector(L, t, nasize);\r\n  /* create new hash part with appropriate size */\r\n  setnodevector(L, t, nhsize);  \r\n  if (nasize < oldasize) {  /* array part must shrink? */\r\n    t->sizearray = nasize;\r\n    /* re-insert elements from vanishing slice */\r\n    for (i=nasize; i<oldasize; i++) {\r\n      if (!ttisnil(&t->array[i]))\r\n        setobjt2t(L, luaH_setnum(L, t, i+1), &t->array[i]);\r\n    }\r\n    /* shrink array */\r\n    luaM_reallocvector(L, t->array, oldasize, nasize, TValue);\r\n  }\r\n  /* re-insert elements from hash part */\r\n  for (i = twoto(oldhsize) - 1; i >= 0; i--) {\r\n    Node *old = nold+i;\r\n    if (!ttisnil(gval(old)))\r\n      setobjt2t(L, luaH_set(L, t, key2tval(old)), gval(old));\r\n  }\r\n  if (nold != dummynode)\r\n    luaM_freearray(L, nold, twoto(oldhsize), Node);  /* free old array */\r\n}\r\n\r\n\r\nvoid luaH_resizearray (lua_State *L, Table *t, int nasize) {\r\n  int nsize = (t->node == dummynode) ? 0 : sizenode(t);\r\n  resize(L, t, nasize, nsize);\r\n}\r\n\r\n\r\nstatic void rehash (lua_State *L, Table *t, const TValue *ek) {\r\n  int nasize, na;\r\n  int nums[MAXBITS+1];  /* nums[i] = number of keys between 2^(i-1) and 2^i */\r\n  int i;\r\n  int totaluse;\r\n  for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */\r\n  nasize = numusearray(t, nums);  /* count keys in array part */\r\n  totaluse = nasize;  /* all those keys are integer keys */\r\n  totaluse += numusehash(t, nums, &nasize);  /* count keys in hash part */\r\n  /* count extra key */\r\n  nasize += countint(ek, nums);\r\n  totaluse++;\r\n  /* compute new size for array part */\r\n  na = computesizes(nums, &nasize);\r\n  /* resize the table to new computed sizes */\r\n  resize(L, t, nasize, totaluse - na);\r\n}\r\n\r\n\r\n\r\n/*\r\n** }=============================================================\r\n*/\r\n\r\n\r\nTable *luaH_new (lua_State *L, int narray, int nhash) {\r\n  Table *t = luaM_new(L, Table);\r\n  luaC_link(L, obj2gco(t), LUA_TTABLE);\r\n  t->metatable = NULL;\r\n  t->flags = cast_byte(~0);\r\n  /* temporary values (kept only if some malloc fails) */\r\n  t->array = NULL;\r\n  t->sizearray = 0;\r\n  t->lsizenode = 0;\r\n  t->node = cast(Node *, dummynode);\r\n  setarrayvector(L, t, narray);\r\n  setnodevector(L, t, nhash);\r\n  return t;\r\n}\r\n\r\n\r\nvoid luaH_free (lua_State *L, Table *t) {\r\n  if (t->node != dummynode)\r\n    luaM_freearray(L, t->node, sizenode(t), Node);\r\n  luaM_freearray(L, t->array, t->sizearray, TValue);\r\n  luaM_free(L, t);\r\n}\r\n\r\n\r\nstatic Node *getfreepos (Table *t) {\r\n  while (t->lastfree-- > t->node) {\r\n    if (ttisnil(gkey(t->lastfree)))\r\n      return t->lastfree;\r\n  }\r\n  return NULL;  /* could not find a free place */\r\n}\r\n\r\n\r\n\r\n/*\r\n** inserts a new key into a hash table; first, check whether key's main \r\n** position is free. If not, check whether colliding node is in its main \r\n** position or not: if it is not, move colliding node to an empty place and \r\n** put new key in its main position; otherwise (colliding node is in its main \r\n** position), new key goes to an empty position. \r\n*/\r\nstatic TValue *newkey (lua_State *L, Table *t, const TValue *key) {\r\n  Node *mp = mainposition(t, key);\r\n  if (!ttisnil(gval(mp)) || mp == dummynode) {\r\n    Node *othern;\r\n    Node *n = getfreepos(t);  /* get a free place */\r\n    if (n == NULL) {  /* cannot find a free place? */\r\n      rehash(L, t, key);  /* grow table */\r\n      return luaH_set(L, t, key);  /* re-insert key into grown table */\r\n    }\r\n    lua_assert(n != dummynode);\r\n    othern = mainposition(t, key2tval(mp));\r\n    if (othern != mp) {  /* is colliding node out of its main position? */\r\n      /* yes; move colliding node into free position */\r\n      while (gnext(othern) != mp) othern = gnext(othern);  /* find previous */\r\n      gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */\r\n      *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */\r\n      gnext(mp) = NULL;  /* now `mp' is free */\r\n      setnilvalue(gval(mp));\r\n    }\r\n    else {  /* colliding node is in its own main position */\r\n      /* new node will go into free position */\r\n      gnext(n) = gnext(mp);  /* chain new position */\r\n      gnext(mp) = n;\r\n      mp = n;\r\n    }\r\n  }\r\n  gkey(mp)->value = key->value; gkey(mp)->tt = key->tt;\r\n  luaC_barriert(L, t, key);\r\n  lua_assert(ttisnil(gval(mp)));\r\n  return gval(mp);\r\n}\r\n\r\n\r\n/*\r\n** search function for integers\r\n*/\r\nconst TValue *luaH_getnum (Table *t, int key) {\r\n  /* (1 <= key && key <= t->sizearray) */\r\n  if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))\r\n    return &t->array[key-1];\r\n  else {\r\n    lua_Number nk = cast_num(key);\r\n    Node *n = hashnum(t, nk);\r\n    do {  /* check whether `key' is somewhere in the chain */\r\n      if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))\r\n        return gval(n);  /* that's it */\r\n      else n = gnext(n);\r\n    } while (n);\r\n    return luaO_nilobject;\r\n  }\r\n}\r\n\r\n\r\n/*\r\n** search function for strings\r\n*/\r\nconst TValue *luaH_getstr (Table *t, TString *key) {\r\n  Node *n = hashstr(t, key);\r\n  do {  /* check whether `key' is somewhere in the chain */\r\n    if (ttisstring(gkey(n)) && rawtsvalue(gkey(n)) == key)\r\n      return gval(n);  /* that's it */\r\n    else n = gnext(n);\r\n  } while (n);\r\n  return luaO_nilobject;\r\n}\r\n\r\n\r\n/*\r\n** main search function\r\n*/\r\nconst TValue *luaH_get (Table *t, const TValue *key) {\r\n  switch (ttype(key)) {\r\n    case LUA_TNIL: return luaO_nilobject;\r\n    case LUA_TSTRING: return luaH_getstr(t, rawtsvalue(key));\r\n    case LUA_TNUMBER: {\r\n      int k;\r\n      lua_Number n = nvalue(key);\r\n      lua_number2int(k, n);\r\n      if (luai_numeq(cast_num(k), nvalue(key))) /* index is int? */\r\n        return luaH_getnum(t, k);  /* use specialized version */\r\n      /* else go through */\r\n    }\r\n    default: {\r\n      Node *n = mainposition(t, key);\r\n      do {  /* check whether `key' is somewhere in the chain */\r\n        if (luaO_rawequalObj(key2tval(n), key))\r\n          return gval(n);  /* that's it */\r\n        else n = gnext(n);\r\n      } while (n);\r\n      return luaO_nilobject;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nTValue *luaH_set (lua_State *L, Table *t, const TValue *key) {\r\n  const TValue *p = luaH_get(t, key);\r\n  t->flags = 0;\r\n  if (p != luaO_nilobject)\r\n    return cast(TValue *, p);\r\n  else {\r\n    if (ttisnil(key)) luaG_runerror(L, \"table index is nil\");\r\n    else if (ttisnumber(key) && luai_numisnan(nvalue(key)))\r\n      luaG_runerror(L, \"table index is NaN\");\r\n    return newkey(L, t, key);\r\n  }\r\n}\r\n\r\n\r\nTValue *luaH_setnum (lua_State *L, Table *t, int key) {\r\n  const TValue *p = luaH_getnum(t, key);\r\n  if (p != luaO_nilobject)\r\n    return cast(TValue *, p);\r\n  else {\r\n    TValue k;\r\n    setnvalue(&k, cast_num(key));\r\n    return newkey(L, t, &k);\r\n  }\r\n}\r\n\r\n\r\nTValue *luaH_setstr (lua_State *L, Table *t, TString *key) {\r\n  const TValue *p = luaH_getstr(t, key);\r\n  if (p != luaO_nilobject)\r\n    return cast(TValue *, p);\r\n  else {\r\n    TValue k;\r\n    setsvalue(L, &k, key);\r\n    return newkey(L, t, &k);\r\n  }\r\n}\r\n\r\n\r\nstatic int unbound_search (Table *t, unsigned int j) {\r\n  unsigned int i = j;  /* i is zero or a present index */\r\n  j++;\r\n  /* find `i' and `j' such that i is present and j is not */\r\n  while (!ttisnil(luaH_getnum(t, j))) {\r\n    i = j;\r\n    j *= 2;\r\n    if (j > cast(unsigned int, MAX_INT)) {  /* overflow? */\r\n      /* table was built with bad purposes: resort to linear search */\r\n      i = 1;\r\n      while (!ttisnil(luaH_getnum(t, i))) i++;\r\n      return i - 1;\r\n    }\r\n  }\r\n  /* now do a binary search between them */\r\n  while (j - i > 1) {\r\n    unsigned int m = (i+j)/2;\r\n    if (ttisnil(luaH_getnum(t, m))) j = m;\r\n    else i = m;\r\n  }\r\n  return i;\r\n}\r\n\r\n\r\n/*\r\n** Try to find a boundary in table `t'. A `boundary' is an integer index\r\n** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).\r\n*/\r\nint luaH_getn (Table *t) {\r\n  unsigned int j = t->sizearray;\r\n  if (j > 0 && ttisnil(&t->array[j - 1])) {\r\n    /* there is a boundary in the array part: (binary) search for it */\r\n    unsigned int i = 0;\r\n    while (j - i > 1) {\r\n      unsigned int m = (i+j)/2;\r\n      if (ttisnil(&t->array[m - 1])) j = m;\r\n      else i = m;\r\n    }\r\n    return i;\r\n  }\r\n  /* else must find a boundary in hash part */\r\n  else if (t->node == dummynode)  /* hash part is empty? */\r\n    return j;  /* that is easy... */\r\n  else return unbound_search(t, j);\r\n}\r\n\r\n\r\n\r\n#if defined(LUA_DEBUG)\r\n\r\nNode *luaH_mainposition (const Table *t, const TValue *key) {\r\n  return mainposition(t, key);\r\n}\r\n\r\nint luaH_isdummy (Node *n) { return n == dummynode; }\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ltable.h",
    "content": "/*\r\n** $Id: ltable.h,v 2.10.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Lua tables (hash)\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef ltable_h\r\n#define ltable_h\r\n\r\n#include \"lobject.h\"\r\n\r\n\r\n#define gnode(t,i)\t(&(t)->node[i])\r\n#define gkey(n)\t\t(&(n)->i_key.nk)\r\n#define gval(n)\t\t(&(n)->i_val)\r\n#define gnext(n)\t((n)->i_key.nk.next)\r\n\r\n#define key2tval(n)\t(&(n)->i_key.tvk)\r\n\r\n\r\nLUAI_FUNC const TValue *luaH_getnum (Table *t, int key);\r\nLUAI_FUNC TValue *luaH_setnum (lua_State *L, Table *t, int key);\r\nLUAI_FUNC const TValue *luaH_getstr (Table *t, TString *key);\r\nLUAI_FUNC TValue *luaH_setstr (lua_State *L, Table *t, TString *key);\r\nLUAI_FUNC const TValue *luaH_get (Table *t, const TValue *key);\r\nLUAI_FUNC TValue *luaH_set (lua_State *L, Table *t, const TValue *key);\r\nLUAI_FUNC Table *luaH_new (lua_State *L, int narray, int lnhash);\r\nLUAI_FUNC void luaH_resizearray (lua_State *L, Table *t, int nasize);\r\nLUAI_FUNC void luaH_free (lua_State *L, Table *t);\r\nLUAI_FUNC int luaH_next (lua_State *L, Table *t, StkId key);\r\nLUAI_FUNC int luaH_getn (Table *t);\r\n\r\n\r\n#if defined(LUA_DEBUG)\r\nLUAI_FUNC Node *luaH_mainposition (const Table *t, const TValue *key);\r\nLUAI_FUNC int luaH_isdummy (Node *n);\r\n#endif\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ltablib.c",
    "content": "/*\r\n** $Id: ltablib.c,v 1.38.1.3 2008/02/14 16:46:58 roberto Exp $\r\n** Library for Table Manipulation\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stddef.h>\r\n\r\n#define ltablib_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n#define aux_getn(L,n)\t(luaL_checktype(L, n, LUA_TTABLE), luaL_getn(L, n))\r\n\r\n\r\nstatic int foreachi (lua_State *L) {\r\n  int i;\r\n  int n = aux_getn(L, 1);\r\n  luaL_checktype(L, 2, LUA_TFUNCTION);\r\n  for (i=1; i <= n; i++) {\r\n    lua_pushvalue(L, 2);  /* function */\r\n    lua_pushinteger(L, i);  /* 1st argument */\r\n    lua_rawgeti(L, 1, i);  /* 2nd argument */\r\n    lua_call(L, 2, 1);\r\n    if (!lua_isnil(L, -1))\r\n      return 1;\r\n    lua_pop(L, 1);  /* remove nil result */\r\n  }\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int foreach (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  luaL_checktype(L, 2, LUA_TFUNCTION);\r\n  lua_pushnil(L);  /* first key */\r\n  while (lua_next(L, 1)) {\r\n    lua_pushvalue(L, 2);  /* function */\r\n    lua_pushvalue(L, -3);  /* key */\r\n    lua_pushvalue(L, -3);  /* value */\r\n    lua_call(L, 2, 1);\r\n    if (!lua_isnil(L, -1))\r\n      return 1;\r\n    lua_pop(L, 2);  /* remove value and result */\r\n  }\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int maxn (lua_State *L) {\r\n  lua_Number max = 0;\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  lua_pushnil(L);  /* first key */\r\n  while (lua_next(L, 1)) {\r\n    lua_pop(L, 1);  /* remove value */\r\n    if (lua_type(L, -1) == LUA_TNUMBER) {\r\n      lua_Number v = lua_tonumber(L, -1);\r\n      if (v > max) max = v;\r\n    }\r\n  }\r\n  lua_pushnumber(L, max);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int getn (lua_State *L) {\r\n  lua_pushinteger(L, aux_getn(L, 1));\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int setn (lua_State *L) {\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n#ifndef luaL_setn\r\n  luaL_setn(L, 1, luaL_checkint(L, 2));\r\n#else\r\n  luaL_error(L, LUA_QL(\"setn\") \" is obsolete\");\r\n#endif\r\n  lua_pushvalue(L, 1);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int tinsert (lua_State *L) {\r\n  int e = aux_getn(L, 1) + 1;  /* first empty element */\r\n  int pos;  /* where to insert new element */\r\n  switch (lua_gettop(L)) {\r\n    case 2: {  /* called with only 2 arguments */\r\n      pos = e;  /* insert new element at the end */\r\n      break;\r\n    }\r\n    case 3: {\r\n      int i;\r\n      pos = luaL_checkint(L, 2);  /* 2nd argument is the position */\r\n      if (pos > e) e = pos;  /* `grow' array if necessary */\r\n      for (i = e; i > pos; i--) {  /* move up elements */\r\n        lua_rawgeti(L, 1, i-1);\r\n        lua_rawseti(L, 1, i);  /* t[i] = t[i-1] */\r\n      }\r\n      break;\r\n    }\r\n    default: {\r\n      return luaL_error(L, \"wrong number of arguments to \" LUA_QL(\"insert\"));\r\n    }\r\n  }\r\n  luaL_setn(L, 1, e);  /* new size */\r\n  lua_rawseti(L, 1, pos);  /* t[pos] = v */\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int tremove (lua_State *L) {\r\n  int e = aux_getn(L, 1);\r\n  int pos = luaL_optint(L, 2, e);\r\n  if (!(1 <= pos && pos <= e))  /* position is outside bounds? */\r\n   return 0;  /* nothing to remove */\r\n  luaL_setn(L, 1, e - 1);  /* t.n = n-1 */\r\n  lua_rawgeti(L, 1, pos);  /* result = t[pos] */\r\n  for ( ;pos<e; pos++) {\r\n    lua_rawgeti(L, 1, pos+1);\r\n    lua_rawseti(L, 1, pos);  /* t[pos] = t[pos+1] */\r\n  }\r\n  lua_pushnil(L);\r\n  lua_rawseti(L, 1, e);  /* t[e] = nil */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic void addfield (lua_State *L, luaL_Buffer *b, int i) {\r\n  lua_rawgeti(L, 1, i);\r\n  if (!lua_isstring(L, -1))\r\n    luaL_error(L, \"invalid value (%s) at index %d in table for \"\r\n                  LUA_QL(\"concat\"), luaL_typename(L, -1), i);\r\n    luaL_addvalue(b);\r\n}\r\n\r\n\r\nstatic int tconcat (lua_State *L) {\r\n  luaL_Buffer b;\r\n  size_t lsep;\r\n  int i, last;\r\n  const char *sep = luaL_optlstring(L, 2, \"\", &lsep);\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  i = luaL_optint(L, 3, 1);\r\n  last = luaL_opt(L, luaL_checkint, 4, luaL_getn(L, 1));\r\n  luaL_buffinit(L, &b);\r\n  for (; i < last; i++) {\r\n    addfield(L, &b, i);\r\n    luaL_addlstring(&b, sep, lsep);\r\n  }\r\n  if (i == last)  /* add last value (if interval was not empty) */\r\n    addfield(L, &b, i);\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n\r\n\r\n/*\r\n** {======================================================\r\n** Quicksort\r\n** (based on `Algorithms in MODULA-3', Robert Sedgewick;\r\n**  Addison-Wesley, 1993.)\r\n*/\r\n\r\n\r\nstatic void set2 (lua_State *L, int i, int j) {\r\n  lua_rawseti(L, 1, i);\r\n  lua_rawseti(L, 1, j);\r\n}\r\n\r\nstatic int sort_comp (lua_State *L, int a, int b) {\r\n  if (!lua_isnil(L, 2)) {  /* function? */\r\n    int res;\r\n    lua_pushvalue(L, 2);\r\n    lua_pushvalue(L, a-1);  /* -1 to compensate function */\r\n    lua_pushvalue(L, b-2);  /* -2 to compensate function and `a' */\r\n    lua_call(L, 2, 1);\r\n    res = lua_toboolean(L, -1);\r\n    lua_pop(L, 1);\r\n    return res;\r\n  }\r\n  else  /* a < b? */\r\n    return lua_lessthan(L, a, b);\r\n}\r\n\r\nstatic void auxsort (lua_State *L, int l, int u) {\r\n  while (l < u) {  /* for tail recursion */\r\n    int i, j;\r\n    /* sort elements a[l], a[(l+u)/2] and a[u] */\r\n    lua_rawgeti(L, 1, l);\r\n    lua_rawgeti(L, 1, u);\r\n    if (sort_comp(L, -1, -2))  /* a[u] < a[l]? */\r\n      set2(L, l, u);  /* swap a[l] - a[u] */\r\n    else\r\n      lua_pop(L, 2);\r\n    if (u-l == 1) break;  /* only 2 elements */\r\n    i = (l+u)/2;\r\n    lua_rawgeti(L, 1, i);\r\n    lua_rawgeti(L, 1, l);\r\n    if (sort_comp(L, -2, -1))  /* a[i]<a[l]? */\r\n      set2(L, i, l);\r\n    else {\r\n      lua_pop(L, 1);  /* remove a[l] */\r\n      lua_rawgeti(L, 1, u);\r\n      if (sort_comp(L, -1, -2))  /* a[u]<a[i]? */\r\n        set2(L, i, u);\r\n      else\r\n        lua_pop(L, 2);\r\n    }\r\n    if (u-l == 2) break;  /* only 3 elements */\r\n    lua_rawgeti(L, 1, i);  /* Pivot */\r\n    lua_pushvalue(L, -1);\r\n    lua_rawgeti(L, 1, u-1);\r\n    set2(L, i, u-1);\r\n    /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */\r\n    i = l; j = u-1;\r\n    for (;;) {  /* invariant: a[l..i] <= P <= a[j..u] */\r\n      /* repeat ++i until a[i] >= P */\r\n      while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {\r\n        if (i>u) luaL_error(L, \"invalid order function for sorting\");\r\n        lua_pop(L, 1);  /* remove a[i] */\r\n      }\r\n      /* repeat --j until a[j] <= P */\r\n      while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {\r\n        if (j<l) luaL_error(L, \"invalid order function for sorting\");\r\n        lua_pop(L, 1);  /* remove a[j] */\r\n      }\r\n      if (j<i) {\r\n        lua_pop(L, 3);  /* pop pivot, a[i], a[j] */\r\n        break;\r\n      }\r\n      set2(L, i, j);\r\n    }\r\n    lua_rawgeti(L, 1, u-1);\r\n    lua_rawgeti(L, 1, i);\r\n    set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */\r\n    /* a[l..i-1] <= a[i] == P <= a[i+1..u] */\r\n    /* adjust so that smaller half is in [j..i] and larger one in [l..u] */\r\n    if (i-l < u-i) {\r\n      j=l; i=i-1; l=i+2;\r\n    }\r\n    else {\r\n      j=i+1; i=u; u=j-2;\r\n    }\r\n    auxsort(L, j, i);  /* call recursively the smaller one */\r\n  }  /* repeat the routine for the larger one */\r\n}\r\n\r\nstatic int sort (lua_State *L) {\r\n  int n = aux_getn(L, 1);\r\n  luaL_checkstack(L, 40, \"\");  /* assume array is smaller than 2^40 */\r\n  if (!lua_isnoneornil(L, 2))  /* is there a 2nd argument? */\r\n    luaL_checktype(L, 2, LUA_TFUNCTION);\r\n  lua_settop(L, 2);  /* make sure there is two arguments */\r\n  auxsort(L, 1, n);\r\n  return 0;\r\n}\r\n\r\n/* }====================================================== */\r\n\r\n\r\nstatic const luaL_Reg tab_funcs[] = {\r\n  {\"concat\", tconcat},\r\n  {\"foreach\", foreach},\r\n  {\"foreachi\", foreachi},\r\n  {\"getn\", getn},\r\n  {\"maxn\", maxn},\r\n  {\"insert\", tinsert},\r\n  {\"remove\", tremove},\r\n  {\"setn\", setn},\r\n  {\"sort\", sort},\r\n  {NULL, NULL}\r\n};\r\n\r\n\r\nLUALIB_API int luaopen_table (lua_State *L) {\r\n  luaL_register(L, LUA_TABLIBNAME, tab_funcs);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ltm.c",
    "content": "/*\r\n** $Id: ltm.c,v 2.8.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Tag methods\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <string.h>\r\n\r\n#define ltm_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lobject.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n\r\n\r\n\r\nconst char *const luaT_typenames[] = {\r\n  \"nil\", \"boolean\", \"userdata\", \"number\",\r\n  \"string\", \"table\", \"function\", \"userdata\", \"thread\",\r\n  \"proto\", \"upval\"\r\n};\r\n\r\n\r\nvoid luaT_init (lua_State *L) {\r\n  static const char *const luaT_eventname[] = {  /* ORDER TM */\r\n    \"__index\", \"__newindex\",\r\n    \"__gc\", \"__mode\", \"__eq\",\r\n    \"__add\", \"__sub\", \"__mul\", \"__div\", \"__mod\",\r\n    \"__pow\", \"__unm\", \"__len\", \"__lt\", \"__le\",\r\n    \"__concat\", \"__call\"\r\n  };\r\n  int i;\r\n  for (i=0; i<TM_N; i++) {\r\n    G(L)->tmname[i] = luaS_new(L, luaT_eventname[i]);\r\n    luaS_fix(G(L)->tmname[i]);  /* never collect these names */\r\n  }\r\n}\r\n\r\n\r\n/*\r\n** function to be used with macro \"fasttm\": optimized for absence of\r\n** tag methods\r\n*/\r\nconst TValue *luaT_gettm (Table *events, TMS event, TString *ename) {\r\n  const TValue *tm = luaH_getstr(events, ename);\r\n  lua_assert(event <= TM_EQ);\r\n  if (ttisnil(tm)) {  /* no tag method? */\r\n    events->flags |= cast_byte(1u<<event);  /* cache this fact */\r\n    return NULL;\r\n  }\r\n  else return tm;\r\n}\r\n\r\n\r\nconst TValue *luaT_gettmbyobj (lua_State *L, const TValue *o, TMS event) {\r\n  Table *mt;\r\n  switch (ttype(o)) {\r\n    case LUA_TTABLE:\r\n      mt = hvalue(o)->metatable;\r\n      break;\r\n    case LUA_TUSERDATA:\r\n      mt = uvalue(o)->metatable;\r\n      break;\r\n    default:\r\n      mt = G(L)->mt[ttype(o)];\r\n  }\r\n  return (mt ? luaH_getstr(mt, G(L)->tmname[event]) : luaO_nilobject);\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/ltm.h",
    "content": "/*\r\n** $Id: ltm.h,v 2.6.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Tag methods\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef ltm_h\r\n#define ltm_h\r\n\r\n\r\n#include \"lobject.h\"\r\n\r\n\r\n/*\r\n* WARNING: if you change the order of this enumeration,\r\n* grep \"ORDER TM\"\r\n*/\r\ntypedef enum {\r\n  TM_INDEX,\r\n  TM_NEWINDEX,\r\n  TM_GC,\r\n  TM_MODE,\r\n  TM_EQ,  /* last tag method with `fast' access */\r\n  TM_ADD,\r\n  TM_SUB,\r\n  TM_MUL,\r\n  TM_DIV,\r\n  TM_MOD,\r\n  TM_POW,\r\n  TM_UNM,\r\n  TM_LEN,\r\n  TM_LT,\r\n  TM_LE,\r\n  TM_CONCAT,\r\n  TM_CALL,\r\n  TM_N\t\t/* number of elements in the enum */\r\n} TMS;\r\n\r\n\r\n\r\n#define gfasttm(g,et,e) ((et) == NULL ? NULL : \\\r\n  ((et)->flags & (1u<<(e))) ? NULL : luaT_gettm(et, e, (g)->tmname[e]))\r\n\r\n#define fasttm(l,et,e)\tgfasttm(G(l), et, e)\r\n\r\nLUAI_DATA const char *const luaT_typenames[];\r\n\r\n\r\nLUAI_FUNC const TValue *luaT_gettm (Table *events, TMS event, TString *ename);\r\nLUAI_FUNC const TValue *luaT_gettmbyobj (lua_State *L, const TValue *o,\r\n                                                       TMS event);\r\nLUAI_FUNC void luaT_init (lua_State *L);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lua.c",
    "content": "/*\r\n** $Id: lua.c,v 1.160.1.2 2007/12/28 15:32:23 roberto Exp $\r\n** Lua stand-alone interpreter\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <signal.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define lua_c\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n\r\n\r\nstatic lua_State *globalL = NULL;\r\n\r\nstatic const char *progname = LUA_PROGNAME;\r\n\r\n\r\n\r\nstatic void lstop (lua_State *L, lua_Debug *ar) {\r\n  (void)ar;  /* unused arg. */\r\n  lua_sethook(L, NULL, 0, 0);\r\n  luaL_error(L, \"interrupted!\");\r\n}\r\n\r\n\r\nstatic void laction (int i) {\r\n  signal(i, SIG_DFL); /* if another SIGINT happens before lstop,\r\n                              terminate process (default action) */\r\n  lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);\r\n}\r\n\r\n\r\nstatic void print_usage (void) {\r\n  fprintf(stderr,\r\n  \"usage: %s [options] [script [args]].\\n\"\r\n  \"Available options are:\\n\"\r\n  \"  -e stat  execute string \" LUA_QL(\"stat\") \"\\n\"\r\n  \"  -l name  require library \" LUA_QL(\"name\") \"\\n\"\r\n  \"  -i       enter interactive mode after executing \" LUA_QL(\"script\") \"\\n\"\r\n  \"  -v       show version information\\n\"\r\n  \"  --       stop handling options\\n\"\r\n  \"  -        execute stdin and stop handling options\\n\"\r\n  ,\r\n  progname);\r\n  fflush(stderr);\r\n}\r\n\r\n\r\nstatic void l_message (const char *pname, const char *msg) {\r\n  if (pname) fprintf(stderr, \"%s: \", pname);\r\n  fprintf(stderr, \"%s\\n\", msg);\r\n  fflush(stderr);\r\n}\r\n\r\n\r\nstatic int report (lua_State *L, int status) {\r\n  if (status && !lua_isnil(L, -1)) {\r\n    const char *msg = lua_tostring(L, -1);\r\n    if (msg == NULL) msg = \"(error object is not a string)\";\r\n    l_message(progname, msg);\r\n    lua_pop(L, 1);\r\n  }\r\n  return status;\r\n}\r\n\r\n\r\nstatic int traceback (lua_State *L) {\r\n  if (!lua_isstring(L, 1))  /* 'message' not a string? */\r\n    return 1;  /* keep it intact */\r\n  lua_getfield(L, LUA_GLOBALSINDEX, \"debug\");\r\n  if (!lua_istable(L, -1)) {\r\n    lua_pop(L, 1);\r\n    return 1;\r\n  }\r\n  lua_getfield(L, -1, \"traceback\");\r\n  if (!lua_isfunction(L, -1)) {\r\n    lua_pop(L, 2);\r\n    return 1;\r\n  }\r\n  lua_pushvalue(L, 1);  /* pass error message */\r\n  lua_pushinteger(L, 2);  /* skip this function and traceback */\r\n  lua_call(L, 2, 1);  /* call debug.traceback */\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int docall (lua_State *L, int narg, int clear) {\r\n  int status;\r\n  int base = lua_gettop(L) - narg;  /* function index */\r\n  lua_pushcfunction(L, traceback);  /* push traceback function */\r\n  lua_insert(L, base);  /* put it under chunk and args */\r\n  signal(SIGINT, laction);\r\n  status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);\r\n  signal(SIGINT, SIG_DFL);\r\n  lua_remove(L, base);  /* remove traceback function */\r\n  /* force a complete garbage collection in case of errors */\r\n  if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0);\r\n  return status;\r\n}\r\n\r\n\r\nstatic void print_version (void) {\r\n  l_message(NULL, LUA_RELEASE \"  \" LUA_COPYRIGHT);\r\n}\r\n\r\n\r\nstatic int getargs (lua_State *L, char **argv, int n) {\r\n  int narg;\r\n  int i;\r\n  int argc = 0;\r\n  while (argv[argc]) argc++;  /* count total number of arguments */\r\n  narg = argc - (n + 1);  /* number of arguments to the script */\r\n  luaL_checkstack(L, narg + 3, \"too many arguments to script\");\r\n  for (i=n+1; i < argc; i++)\r\n    lua_pushstring(L, argv[i]);\r\n  lua_createtable(L, narg, n + 1);\r\n  for (i=0; i < argc; i++) {\r\n    lua_pushstring(L, argv[i]);\r\n    lua_rawseti(L, -2, i - n);\r\n  }\r\n  return narg;\r\n}\r\n\r\n\r\nstatic int dofile (lua_State *L, const char *name) {\r\n  int status = luaL_loadfile(L, name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\n\r\nstatic int dostring (lua_State *L, const char *s, const char *name) {\r\n  int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\n\r\nstatic int dolibrary (lua_State *L, const char *name) {\r\n  lua_getglobal(L, \"require\");\r\n  lua_pushstring(L, name);\r\n  return report(L, docall(L, 1, 1));\r\n}\r\n\r\n\r\nstatic const char *get_prompt (lua_State *L, int firstline) {\r\n  const char *p;\r\n  lua_getfield(L, LUA_GLOBALSINDEX, firstline ? \"_PROMPT\" : \"_PROMPT2\");\r\n  p = lua_tostring(L, -1);\r\n  if (p == NULL) p = (firstline ? LUA_PROMPT : LUA_PROMPT2);\r\n  lua_pop(L, 1);  /* remove global */\r\n  return p;\r\n}\r\n\r\n\r\nstatic int incomplete (lua_State *L, int status) {\r\n  if (status == LUA_ERRSYNTAX) {\r\n    size_t lmsg;\r\n    const char *msg = lua_tolstring(L, -1, &lmsg);\r\n    const char *tp = msg + lmsg - (sizeof(LUA_QL(\"<eof>\")) - 1);\r\n    if (strstr(msg, LUA_QL(\"<eof>\")) == tp) {\r\n      lua_pop(L, 1);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* else... */\r\n}\r\n\r\n\r\nstatic int pushline (lua_State *L, int firstline) {\r\n  char buffer[LUA_MAXINPUT];\r\n  char *b = buffer;\r\n  size_t l;\r\n  const char *prmt = get_prompt(L, firstline);\r\n  if (lua_readline(L, b, prmt) == 0)\r\n    return 0;  /* no input */\r\n  l = strlen(b);\r\n  if (l > 0 && b[l-1] == '\\n')  /* line ends with newline? */\r\n    b[l-1] = '\\0';  /* remove it */\r\n  if (firstline && b[0] == '=')  /* first line starts with `=' ? */\r\n    lua_pushfstring(L, \"return %s\", b+1);  /* change it to `return' */\r\n  else\r\n    lua_pushstring(L, b);\r\n  lua_freeline(L, b);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic int loadline (lua_State *L) {\r\n  int status;\r\n  lua_settop(L, 0);\r\n  if (!pushline(L, 1))\r\n    return -1;  /* no input */\r\n  for (;;) {  /* repeat until gets a complete line */\r\n    status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), \"=stdin\");\r\n    if (!incomplete(L, status)) break;  /* cannot try to add lines? */\r\n    if (!pushline(L, 0))  /* no more input? */\r\n      return -1;\r\n    lua_pushliteral(L, \"\\n\");  /* add a new line... */\r\n    lua_insert(L, -2);  /* ...between the two lines */\r\n    lua_concat(L, 3);  /* join them */\r\n  }\r\n  lua_saveline(L, 1);\r\n  lua_remove(L, 1);  /* remove line */\r\n  return status;\r\n}\r\n\r\n\r\nstatic void dotty (lua_State *L) {\r\n  int status;\r\n  const char *oldprogname = progname;\r\n  progname = NULL;\r\n  while ((status = loadline(L)) != -1) {\r\n    if (status == 0) status = docall(L, 0, 0);\r\n    report(L, status);\r\n    if (status == 0 && lua_gettop(L) > 0) {  /* any result to print? */\r\n      lua_getglobal(L, \"print\");\r\n      lua_insert(L, 1);\r\n      if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)\r\n        l_message(progname, lua_pushfstring(L,\r\n                               \"error calling \" LUA_QL(\"print\") \" (%s)\",\r\n                               lua_tostring(L, -1)));\r\n    }\r\n  }\r\n  lua_settop(L, 0);  /* clear stack */\r\n  fputs(\"\\n\", stdout);\r\n  fflush(stdout);\r\n  progname = oldprogname;\r\n}\r\n\r\n\r\nstatic int handle_script (lua_State *L, char **argv, int n) {\r\n  int status;\r\n  const char *fname;\r\n  int narg = getargs(L, argv, n);  /* collect arguments */\r\n  lua_setglobal(L, \"arg\");\r\n  fname = argv[n];\r\n  if (strcmp(fname, \"-\") == 0 && strcmp(argv[n-1], \"--\") != 0) \r\n    fname = NULL;  /* stdin */\r\n  status = luaL_loadfile(L, fname);\r\n  lua_insert(L, -(narg+1));\r\n  if (status == 0)\r\n    status = docall(L, narg, 0);\r\n  else\r\n    lua_pop(L, narg);      \r\n  return report(L, status);\r\n}\r\n\r\n\r\n/* check that argument has no extra characters at the end */\r\n#define notail(x)\t{if ((x)[2] != '\\0') return -1;}\r\n\r\n\r\nstatic int collectargs (char **argv, int *pi, int *pv, int *pe) {\r\n  int i;\r\n  for (i = 1; argv[i] != NULL; i++) {\r\n    if (argv[i][0] != '-')  /* not an option? */\r\n        return i;\r\n    switch (argv[i][1]) {  /* option */\r\n      case '-':\r\n        notail(argv[i]);\r\n        return (argv[i+1] != NULL ? i+1 : 0);\r\n      case '\\0':\r\n        return i;\r\n      case 'i':\r\n        notail(argv[i]);\r\n        *pi = 1;  /* go through */\r\n      case 'v':\r\n        notail(argv[i]);\r\n        *pv = 1;\r\n        break;\r\n      case 'e':\r\n        *pe = 1;  /* go through */\r\n      case 'l':\r\n        if (argv[i][2] == '\\0') {\r\n          i++;\r\n          if (argv[i] == NULL) return -1;\r\n        }\r\n        break;\r\n      default: return -1;  /* invalid option */\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int runargs (lua_State *L, char **argv, int n) {\r\n  int i;\r\n  for (i = 1; i < n; i++) {\r\n    if (argv[i] == NULL) continue;\r\n    lua_assert(argv[i][0] == '-');\r\n    switch (argv[i][1]) {  /* option */\r\n      case 'e': {\r\n        const char *chunk = argv[i] + 2;\r\n        if (*chunk == '\\0') chunk = argv[++i];\r\n        lua_assert(chunk != NULL);\r\n        if (dostring(L, chunk, \"=(command line)\") != 0)\r\n          return 1;\r\n        break;\r\n      }\r\n      case 'l': {\r\n        const char *filename = argv[i] + 2;\r\n        if (*filename == '\\0') filename = argv[++i];\r\n        lua_assert(filename != NULL);\r\n        if (dolibrary(L, filename))\r\n          return 1;  /* stop if file fails */\r\n        break;\r\n      }\r\n      default: break;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n\r\nstatic int handle_luainit (lua_State *L) {\r\n  const char *init = getenv(LUA_INIT);\r\n  if (init == NULL) return 0;  /* status OK */\r\n  else if (init[0] == '@')\r\n    return dofile(L, init+1);\r\n  else\r\n    return dostring(L, init, \"=\" LUA_INIT);\r\n}\r\n\r\n\r\nstruct Smain {\r\n  int argc;\r\n  char **argv;\r\n  int status;\r\n};\r\n\r\n\r\nstatic int pmain (lua_State *L) {\r\n  struct Smain *s = (struct Smain *)lua_touserdata(L, 1);\r\n  char **argv = s->argv;\r\n  int script;\r\n  int has_i = 0, has_v = 0, has_e = 0;\r\n  globalL = L;\r\n  if (argv[0] && argv[0][0]) progname = argv[0];\r\n  lua_gc(L, LUA_GCSTOP, 0);  /* stop collector during initialization */\r\n  luaL_openlibs(L);  /* open libraries */\r\n  lua_gc(L, LUA_GCRESTART, 0);\r\n  s->status = handle_luainit(L);\r\n  if (s->status != 0) return 0;\r\n  script = collectargs(argv, &has_i, &has_v, &has_e);\r\n  if (script < 0) {  /* invalid args? */\r\n    print_usage();\r\n    s->status = 1;\r\n    return 0;\r\n  }\r\n  if (has_v) print_version();\r\n  s->status = runargs(L, argv, (script > 0) ? script : s->argc);\r\n  if (s->status != 0) return 0;\r\n  if (script)\r\n    s->status = handle_script(L, argv, script);\r\n  if (s->status != 0) return 0;\r\n  if (has_i)\r\n    dotty(L);\r\n  else if (script == 0 && !has_e && !has_v) {\r\n    if (lua_stdin_is_tty()) {\r\n      print_version();\r\n      dotty(L);\r\n    }\r\n    else dofile(L, NULL);  /* executes stdin as a file */\r\n  }\r\n  return 0;\r\n}\r\n\r\n\r\nint main (int argc, char **argv) {\r\n  int status;\r\n  struct Smain s;\r\n  lua_State *L = lua_open();  /* create state */\r\n  if (L == NULL) {\r\n    l_message(argv[0], \"cannot create state: not enough memory\");\r\n    return EXIT_FAILURE;\r\n  }\r\n  s.argc = argc;\r\n  s.argv = argv;\r\n  status = lua_cpcall(L, &pmain, &s);\r\n  report(L, status);\r\n  lua_close(L);\r\n  return (status || s.status) ? EXIT_FAILURE : EXIT_SUCCESS;\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lua.h",
    "content": "/*\r\n** $Id: lua.h,v 1.218.1.7 2012/01/13 20:36:20 roberto Exp $\r\n** Lua - An Extensible Extension Language\r\n** Lua.org, PUC-Rio, Brazil (http://www.lua.org)\r\n** See Copyright Notice at the end of this file\r\n*/\r\n\r\n\r\n#ifndef lua_h\r\n#define lua_h\r\n\r\n#include <stdarg.h>\r\n#include <stddef.h>\r\n\r\n\r\n#include \"luaconf.h\"\r\n\r\n\r\n#define LUA_VERSION\t\"Lua 5.1\"\r\n#define LUA_RELEASE\t\"Lua 5.1.5\"\r\n#define LUA_VERSION_NUM\t501\r\n#define LUA_COPYRIGHT\t\"Copyright (C) 1994-2012 Lua.org, PUC-Rio\"\r\n#define LUA_AUTHORS \t\"R. Ierusalimschy, L. H. de Figueiredo & W. Celes\"\r\n\r\n\r\n/* mark for precompiled code (`<esc>Lua') */\r\n#define\tLUA_SIGNATURE\t\"\\033Lua\"\r\n\r\n/* option for multiple returns in `lua_pcall' and `lua_call' */\r\n#define LUA_MULTRET\t(-1)\r\n\r\n\r\n/*\r\n** pseudo-indices\r\n*/\r\n#define LUA_REGISTRYINDEX\t(-10000)\r\n#define LUA_ENVIRONINDEX\t(-10001)\r\n#define LUA_GLOBALSINDEX\t(-10002)\r\n#define lua_upvalueindex(i)\t(LUA_GLOBALSINDEX-(i))\r\n\r\n\r\n/* thread status; 0 is OK */\r\n#define LUA_YIELD\t1\r\n#define LUA_ERRRUN\t2\r\n#define LUA_ERRSYNTAX\t3\r\n#define LUA_ERRMEM\t4\r\n#define LUA_ERRERR\t5\r\n\r\n\r\ntypedef struct lua_State lua_State;\r\n\r\ntypedef int (*lua_CFunction) (lua_State *L);\r\n\r\n\r\n/*\r\n** functions that read/write blocks when loading/dumping Lua chunks\r\n*/\r\ntypedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);\r\n\r\ntypedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);\r\n\r\n\r\n/*\r\n** prototype for memory-allocation functions\r\n*/\r\ntypedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);\r\n\r\n\r\n/*\r\n** basic types\r\n*/\r\n#define LUA_TNONE\t\t(-1)\r\n\r\n#define LUA_TNIL\t\t0\r\n#define LUA_TBOOLEAN\t\t1\r\n#define LUA_TLIGHTUSERDATA\t2\r\n#define LUA_TNUMBER\t\t3\r\n#define LUA_TSTRING\t\t4\r\n#define LUA_TTABLE\t\t5\r\n#define LUA_TFUNCTION\t\t6\r\n#define LUA_TUSERDATA\t\t7\r\n#define LUA_TTHREAD\t\t8\r\n\r\n\r\n\r\n/* minimum Lua stack available to a C function */\r\n#define LUA_MINSTACK\t20\r\n\r\n\r\n/*\r\n** generic extra include file\r\n*/\r\n#if defined(LUA_USER_H)\r\n#include LUA_USER_H\r\n#endif\r\n\r\n\r\n/* type of numbers in Lua */\r\ntypedef LUA_NUMBER lua_Number;\r\n\r\n\r\n/* type for integer functions */\r\ntypedef LUA_INTEGER lua_Integer;\r\n\r\n\r\n\r\n/*\r\n** state manipulation\r\n*/\r\nLUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);\r\nLUA_API void       (lua_close) (lua_State *L);\r\nLUA_API lua_State *(lua_newthread) (lua_State *L);\r\n\r\nLUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);\r\n\r\n\r\n/*\r\n** basic stack manipulation\r\n*/\r\nLUA_API int   (lua_gettop) (lua_State *L);\r\nLUA_API void  (lua_settop) (lua_State *L, int idx);\r\nLUA_API void  (lua_pushvalue) (lua_State *L, int idx);\r\nLUA_API void  (lua_remove) (lua_State *L, int idx);\r\nLUA_API void  (lua_insert) (lua_State *L, int idx);\r\nLUA_API void  (lua_replace) (lua_State *L, int idx);\r\nLUA_API int   (lua_checkstack) (lua_State *L, int sz);\r\n\r\nLUA_API void  (lua_xmove) (lua_State *from, lua_State *to, int n);\r\n\r\n\r\n/*\r\n** access functions (stack -> C)\r\n*/\r\n\r\nLUA_API int             (lua_isnumber) (lua_State *L, int idx);\r\nLUA_API int             (lua_isstring) (lua_State *L, int idx);\r\nLUA_API int             (lua_iscfunction) (lua_State *L, int idx);\r\nLUA_API int             (lua_isuserdata) (lua_State *L, int idx);\r\nLUA_API int             (lua_type) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_typename) (lua_State *L, int tp);\r\n\r\nLUA_API int            (lua_equal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_rawequal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_lessthan) (lua_State *L, int idx1, int idx2);\r\n\r\nLUA_API lua_Number      (lua_tonumber) (lua_State *L, int idx);\r\nLUA_API lua_Integer     (lua_tointeger) (lua_State *L, int idx);\r\nLUA_API int             (lua_toboolean) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_tolstring) (lua_State *L, int idx, size_t *len);\r\nLUA_API size_t          (lua_objlen) (lua_State *L, int idx);\r\nLUA_API lua_CFunction   (lua_tocfunction) (lua_State *L, int idx);\r\nLUA_API void\t       *(lua_touserdata) (lua_State *L, int idx);\r\nLUA_API lua_State      *(lua_tothread) (lua_State *L, int idx);\r\nLUA_API const void     *(lua_topointer) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** push functions (C -> stack)\r\n*/\r\nLUA_API void  (lua_pushnil) (lua_State *L);\r\nLUA_API void  (lua_pushnumber) (lua_State *L, lua_Number n);\r\nLUA_API void  (lua_pushinteger) (lua_State *L, lua_Integer n);\r\nLUA_API void  (lua_pushlstring) (lua_State *L, const char *s, size_t l);\r\nLUA_API void  (lua_pushstring) (lua_State *L, const char *s);\r\nLUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt,\r\n                                                      va_list argp);\r\nLUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...);\r\nLUA_API void  (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);\r\nLUA_API void  (lua_pushboolean) (lua_State *L, int b);\r\nLUA_API void  (lua_pushlightuserdata) (lua_State *L, void *p);\r\nLUA_API int   (lua_pushthread) (lua_State *L);\r\n\r\n\r\n/*\r\n** get functions (Lua -> stack)\r\n*/\r\nLUA_API void  (lua_gettable) (lua_State *L, int idx);\r\nLUA_API void  (lua_getfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawget) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawgeti) (lua_State *L, int idx, int n);\r\nLUA_API void  (lua_createtable) (lua_State *L, int narr, int nrec);\r\nLUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);\r\nLUA_API int   (lua_getmetatable) (lua_State *L, int objindex);\r\nLUA_API void  (lua_getfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** set functions (stack -> Lua)\r\n*/\r\nLUA_API void  (lua_settable) (lua_State *L, int idx);\r\nLUA_API void  (lua_setfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawset) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawseti) (lua_State *L, int idx, int n);\r\nLUA_API int   (lua_setmetatable) (lua_State *L, int objindex);\r\nLUA_API int   (lua_setfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** `load' and `call' functions (load and run Lua code)\r\n*/\r\nLUA_API void  (lua_call) (lua_State *L, int nargs, int nresults);\r\nLUA_API int   (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);\r\nLUA_API int   (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud);\r\nLUA_API int   (lua_load) (lua_State *L, lua_Reader reader, void *dt,\r\n                                        const char *chunkname);\r\n\r\nLUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data);\r\n\r\n\r\n/*\r\n** coroutine functions\r\n*/\r\nLUA_API int  (lua_yield) (lua_State *L, int nresults);\r\nLUA_API int  (lua_resume) (lua_State *L, int narg);\r\nLUA_API int  (lua_status) (lua_State *L);\r\n\r\n/*\r\n** garbage-collection function and options\r\n*/\r\n\r\n#define LUA_GCSTOP\t\t0\r\n#define LUA_GCRESTART\t\t1\r\n#define LUA_GCCOLLECT\t\t2\r\n#define LUA_GCCOUNT\t\t3\r\n#define LUA_GCCOUNTB\t\t4\r\n#define LUA_GCSTEP\t\t5\r\n#define LUA_GCSETPAUSE\t\t6\r\n#define LUA_GCSETSTEPMUL\t7\r\n\r\nLUA_API int (lua_gc) (lua_State *L, int what, int data);\r\n\r\n\r\n/*\r\n** miscellaneous functions\r\n*/\r\n\r\nLUA_API int   (lua_error) (lua_State *L);\r\n\r\nLUA_API int   (lua_next) (lua_State *L, int idx);\r\n\r\nLUA_API void  (lua_concat) (lua_State *L, int n);\r\n\r\nLUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);\r\nLUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);\r\n\r\n\r\n\r\n/* \r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define lua_pop(L,n)\t\tlua_settop(L, -(n)-1)\r\n\r\n#define lua_newtable(L)\t\tlua_createtable(L, 0, 0)\r\n\r\n#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))\r\n\r\n#define lua_pushcfunction(L,f)\tlua_pushcclosure(L, (f), 0)\r\n\r\n#define lua_strlen(L,i)\t\tlua_objlen(L, (i))\r\n\r\n#define lua_isfunction(L,n)\t(lua_type(L, (n)) == LUA_TFUNCTION)\r\n#define lua_istable(L,n)\t(lua_type(L, (n)) == LUA_TTABLE)\r\n#define lua_islightuserdata(L,n)\t(lua_type(L, (n)) == LUA_TLIGHTUSERDATA)\r\n#define lua_isnil(L,n)\t\t(lua_type(L, (n)) == LUA_TNIL)\r\n#define lua_isboolean(L,n)\t(lua_type(L, (n)) == LUA_TBOOLEAN)\r\n#define lua_isthread(L,n)\t(lua_type(L, (n)) == LUA_TTHREAD)\r\n#define lua_isnone(L,n)\t\t(lua_type(L, (n)) == LUA_TNONE)\r\n#define lua_isnoneornil(L, n)\t(lua_type(L, (n)) <= 0)\r\n\r\n#define lua_pushliteral(L, s)\t\\\r\n\tlua_pushlstring(L, \"\" s, (sizeof(s)/sizeof(char))-1)\r\n\r\n#define lua_setglobal(L,s)\tlua_setfield(L, LUA_GLOBALSINDEX, (s))\r\n#define lua_getglobal(L,s)\tlua_getfield(L, LUA_GLOBALSINDEX, (s))\r\n\r\n#define lua_tostring(L,i)\tlua_tolstring(L, (i), NULL)\r\n\r\n\r\n\r\n/*\r\n** compatibility macros and functions\r\n*/\r\n\r\n#define lua_open()\tluaL_newstate()\r\n\r\n#define lua_getregistry(L)\tlua_pushvalue(L, LUA_REGISTRYINDEX)\r\n\r\n#define lua_getgccount(L)\tlua_gc(L, LUA_GCCOUNT, 0)\r\n\r\n#define lua_Chunkreader\t\tlua_Reader\r\n#define lua_Chunkwriter\t\tlua_Writer\r\n\r\n\r\n/* hack */\r\nLUA_API void lua_setlevel\t(lua_State *from, lua_State *to);\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Debug API\r\n** =======================================================================\r\n*/\r\n\r\n\r\n/*\r\n** Event codes\r\n*/\r\n#define LUA_HOOKCALL\t0\r\n#define LUA_HOOKRET\t1\r\n#define LUA_HOOKLINE\t2\r\n#define LUA_HOOKCOUNT\t3\r\n#define LUA_HOOKTAILRET 4\r\n\r\n\r\n/*\r\n** Event masks\r\n*/\r\n#define LUA_MASKCALL\t(1 << LUA_HOOKCALL)\r\n#define LUA_MASKRET\t(1 << LUA_HOOKRET)\r\n#define LUA_MASKLINE\t(1 << LUA_HOOKLINE)\r\n#define LUA_MASKCOUNT\t(1 << LUA_HOOKCOUNT)\r\n\r\ntypedef struct lua_Debug lua_Debug;  /* activation record */\r\n\r\n\r\n/* Functions to be called by the debuger in specific events */\r\ntypedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);\r\n\r\n\r\nLUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);\r\nLUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);\r\nLUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);\r\nLUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);\r\n\r\nLUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);\r\nLUA_API lua_Hook lua_gethook (lua_State *L);\r\nLUA_API int lua_gethookmask (lua_State *L);\r\nLUA_API int lua_gethookcount (lua_State *L);\r\n\r\n\r\nstruct lua_Debug {\r\n  int event;\r\n  const char *name;\t/* (n) */\r\n  const char *namewhat;\t/* (n) `global', `local', `field', `method' */\r\n  const char *what;\t/* (S) `Lua', `C', `main', `tail' */\r\n  const char *source;\t/* (S) */\r\n  int currentline;\t/* (l) */\r\n  int nups;\t\t/* (u) number of upvalues */\r\n  int linedefined;\t/* (S) */\r\n  int lastlinedefined;\t/* (S) */\r\n  char short_src[LUA_IDSIZE]; /* (S) */\r\n  /* private part */\r\n  int i_ci;  /* active function */\r\n};\r\n\r\n/* }====================================================================== */\r\n\r\n\r\n/******************************************************************************\r\n* Copyright (C) 1994-2012 Lua.org, PUC-Rio.  All rights reserved.\r\n*\r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including\r\n* without limitation the rights to use, copy, modify, merge, publish,\r\n* distribute, sublicense, and/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject to\r\n* the following conditions:\r\n*\r\n* The above copyright notice and this permission notice shall be\r\n* included in all copies or substantial portions of the Software.\r\n*\r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n******************************************************************************/\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/luac.c",
    "content": "/*\r\n** $Id: luac.c,v 1.54 2006/06/02 17:37:11 lhf Exp $\r\n** Lua compiler (saves bytecodes to files; also list bytecodes)\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define luac_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lstring.h\"\r\n#include \"lundump.h\"\r\n\r\n#define PROGNAME\t\"luac\"\t\t/* default program name */\r\n#define\tOUTPUT\t\tPROGNAME \".out\"\t/* default output file */\r\n\r\nstatic int listing=0;\t\t\t/* list bytecodes? */\r\nstatic int dumping=1;\t\t\t/* dump bytecodes? */\r\nstatic int stripping=0;\t\t\t/* strip debug information? */\r\nstatic char Output[]={ OUTPUT };\t/* default output file name */\r\nstatic const char* output=Output;\t/* actual output file name */\r\nstatic const char* progname=PROGNAME;\t/* actual program name */\r\n\r\nstatic void fatal(const char* message)\r\n{\r\n fprintf(stderr,\"%s: %s\\n\",progname,message);\r\n exit(EXIT_FAILURE);\r\n}\r\n\r\nstatic void cannot(const char* what)\r\n{\r\n fprintf(stderr,\"%s: cannot %s %s: %s\\n\",progname,what,output,strerror(errno));\r\n exit(EXIT_FAILURE);\r\n}\r\n\r\nstatic void usage(const char* message)\r\n{\r\n if (*message=='-')\r\n  fprintf(stderr,\"%s: unrecognized option \" LUA_QS \"\\n\",progname,message);\r\n else\r\n  fprintf(stderr,\"%s: %s\\n\",progname,message);\r\n fprintf(stderr,\r\n \"usage: %s [options] [filenames].\\n\"\r\n \"Available options are:\\n\"\r\n \"  -        process stdin\\n\"\r\n \"  -l       list\\n\"\r\n \"  -o name  output to file \" LUA_QL(\"name\") \" (default is \\\"%s\\\")\\n\"\r\n \"  -p       parse only\\n\"\r\n \"  -s       strip debug information\\n\"\r\n \"  -v       show version information\\n\"\r\n \"  --       stop handling options\\n\",\r\n progname,Output);\r\n exit(EXIT_FAILURE);\r\n}\r\n\r\n#define\tIS(s)\t(strcmp(argv[i],s)==0)\r\n\r\nstatic int doargs(int argc, char* argv[])\r\n{\r\n int i;\r\n int version=0;\r\n if (argv[0]!=NULL && *argv[0]!=0) progname=argv[0];\r\n for (i=1; i<argc; i++)\r\n {\r\n  if (*argv[i]!='-')\t\t\t/* end of options; keep it */\r\n   break;\r\n  else if (IS(\"--\"))\t\t\t/* end of options; skip it */\r\n  {\r\n   ++i;\r\n   if (version) ++version;\r\n   break;\r\n  }\r\n  else if (IS(\"-\"))\t\t\t/* end of options; use stdin */\r\n   break;\r\n  else if (IS(\"-l\"))\t\t\t/* list */\r\n   ++listing;\r\n  else if (IS(\"-o\"))\t\t\t/* output file */\r\n  {\r\n   output=argv[++i];\r\n   if (output==NULL || *output==0) usage(LUA_QL(\"-o\") \" needs argument\");\r\n   if (IS(\"-\")) output=NULL;\r\n  }\r\n  else if (IS(\"-p\"))\t\t\t/* parse only */\r\n   dumping=0;\r\n  else if (IS(\"-s\"))\t\t\t/* strip debug information */\r\n   stripping=1;\r\n  else if (IS(\"-v\"))\t\t\t/* show version */\r\n   ++version;\r\n  else\t\t\t\t\t/* unknown option */\r\n   usage(argv[i]);\r\n }\r\n if (i==argc && (listing || !dumping))\r\n {\r\n  dumping=0;\r\n  argv[--i]=Output;\r\n }\r\n if (version)\r\n {\r\n  printf(\"%s  %s\\n\",LUA_RELEASE,LUA_COPYRIGHT);\r\n  if (version==argc-1) exit(EXIT_SUCCESS);\r\n }\r\n return i;\r\n}\r\n\r\n#define toproto(L,i) (clvalue(L->top+(i))->l.p)\r\n\r\nstatic const Proto* combine(lua_State* L, int n)\r\n{\r\n if (n==1)\r\n  return toproto(L,-1);\r\n else\r\n {\r\n  int i,pc;\r\n  Proto* f=luaF_newproto(L);\r\n  setptvalue2s(L,L->top,f); incr_top(L);\r\n  f->source=luaS_newliteral(L,\"=(\" PROGNAME \")\");\r\n  f->maxstacksize=1;\r\n  pc=2*n+1;\r\n  f->code=luaM_newvector(L,pc,Instruction);\r\n  f->sizecode=pc;\r\n  f->p=luaM_newvector(L,n,Proto*);\r\n  f->sizep=n;\r\n  pc=0;\r\n  for (i=0; i<n; i++)\r\n  {\r\n   f->p[i]=toproto(L,i-n-1);\r\n   f->code[pc++]=CREATE_ABx(OP_CLOSURE,0,i);\r\n   f->code[pc++]=CREATE_ABC(OP_CALL,0,1,1);\r\n  }\r\n  f->code[pc++]=CREATE_ABC(OP_RETURN,0,1,0);\r\n  return f;\r\n }\r\n}\r\n\r\nstatic int writer(lua_State* L, const void* p, size_t size, void* u)\r\n{\r\n UNUSED(L);\r\n return (fwrite(p,size,1,(FILE*)u)!=1) && (size!=0);\r\n}\r\n\r\nstruct Smain {\r\n int argc;\r\n char** argv;\r\n};\r\n\r\nstatic int pmain(lua_State* L)\r\n{\r\n struct Smain* s = (struct Smain*)lua_touserdata(L, 1);\r\n int argc=s->argc;\r\n char** argv=s->argv;\r\n const Proto* f;\r\n int i;\r\n if (!lua_checkstack(L,argc)) fatal(\"too many input files\");\r\n for (i=0; i<argc; i++)\r\n {\r\n  const char* filename=IS(\"-\") ? NULL : argv[i];\r\n  if (luaL_loadfile(L,filename)!=0) fatal(lua_tostring(L,-1));\r\n }\r\n f=combine(L,argc);\r\n if (listing) luaU_print(f,listing>1);\r\n if (dumping)\r\n {\r\n  FILE* D= (output==NULL) ? stdout : fopen(output,\"wb\");\r\n  if (D==NULL) cannot(\"open\");\r\n  lua_lock(L);\r\n  luaU_dump(L,f,writer,D,stripping);\r\n  lua_unlock(L);\r\n  if (ferror(D)) cannot(\"write\");\r\n  if (fclose(D)) cannot(\"close\");\r\n }\r\n return 0;\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n lua_State* L;\r\n struct Smain s;\r\n int i=doargs(argc,argv);\r\n argc-=i; argv+=i;\r\n if (argc<=0) usage(\"no input files given\");\r\n L=lua_open();\r\n if (L==NULL) fatal(\"not enough memory for state\");\r\n s.argc=argc;\r\n s.argv=argv;\r\n if (lua_cpcall(L,pmain,&s)!=0) fatal(lua_tostring(L,-1));\r\n lua_close(L);\r\n return EXIT_SUCCESS;\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/luaconf.h",
    "content": "/*\r\n** $Id: luaconf.h,v 1.82.1.7 2008/02/11 16:25:08 roberto Exp $\r\n** Configuration file for Lua\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lconfig_h\r\n#define lconfig_h\r\n\r\n#include <limits.h>\r\n#include <stddef.h>\r\n\r\n\r\n/*\r\n** ==================================================================\r\n** Search for \"@@\" to find all configurable definitions.\r\n** ===================================================================\r\n*/\r\n\r\n\r\n/*\r\n@@ LUA_ANSI controls the use of non-ansi features.\r\n** CHANGE it (define it) if you want Lua to avoid the use of any\r\n** non-ansi feature or library.\r\n*/\r\n#if defined(__STRICT_ANSI__)\r\n#define LUA_ANSI\r\n#endif\r\n\r\n\r\n#if !defined(LUA_ANSI) && defined(_WIN32)\r\n#define LUA_WIN\r\n#endif\r\n\r\n#if defined(LUA_USE_LINUX)\r\n#define LUA_USE_POSIX\r\n#define LUA_USE_DLOPEN\t\t/* needs an extra library: -ldl */\r\n#define LUA_USE_READLINE\t/* needs some extra libraries */\r\n#endif\r\n\r\n#if defined(LUA_USE_MACOSX)\r\n#define LUA_USE_POSIX\r\n#define LUA_DL_DYLD\t\t/* does not need extra library */\r\n#endif\r\n\r\n\r\n\r\n/*\r\n@@ LUA_USE_POSIX includes all functionallity listed as X/Open System\r\n@* Interfaces Extension (XSI).\r\n** CHANGE it (define it) if your system is XSI compatible.\r\n*/\r\n#if defined(LUA_USE_POSIX)\r\n#define LUA_USE_MKSTEMP\r\n#define LUA_USE_ISATTY\r\n#define LUA_USE_POPEN\r\n#define LUA_USE_ULONGJMP\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUA_PATH and LUA_CPATH are the names of the environment variables that\r\n@* Lua check to set its paths.\r\n@@ LUA_INIT is the name of the environment variable that Lua\r\n@* checks for initialization code.\r\n** CHANGE them if you want different names.\r\n*/\r\n#define LUA_PATH        \"LUA_PATH\"\r\n#define LUA_CPATH       \"LUA_CPATH\"\r\n#define LUA_INIT\t\"LUA_INIT\"\r\n\r\n\r\n/*\r\n@@ LUA_PATH_DEFAULT is the default path that Lua uses to look for\r\n@* Lua libraries.\r\n@@ LUA_CPATH_DEFAULT is the default path that Lua uses to look for\r\n@* C libraries.\r\n** CHANGE them if your machine has a non-conventional directory\r\n** hierarchy or if you want to install your libraries in\r\n** non-conventional directories.\r\n*/\r\n#if defined(_WIN32)\r\n/*\r\n** In Windows, any exclamation mark ('!') in the path is replaced by the\r\n** path of the directory of the executable file of the current process.\r\n*/\r\n#define LUA_LDIR\t\"!\\\\lua\\\\\"\r\n#define LUA_CDIR\t\"!\\\\\"\r\n#define LUA_PATH_DEFAULT  \\\r\n\t\t\".\\\\?.lua;\"  LUA_LDIR\"?.lua;\"  LUA_LDIR\"?\\\\init.lua;\" \\\r\n\t\t             LUA_CDIR\"?.lua;\"  LUA_CDIR\"?\\\\init.lua\"\r\n#define LUA_CPATH_DEFAULT \\\r\n\t\".\\\\?.dll;\"  LUA_CDIR\"?.dll;\" LUA_CDIR\"loadall.dll\"\r\n\r\n#else\r\n#define LUA_ROOT\t\"/usr/local/\"\r\n#define LUA_LDIR\tLUA_ROOT \"share/lua/5.1/\"\r\n#define LUA_CDIR\tLUA_ROOT \"lib/lua/5.1/\"\r\n#define LUA_PATH_DEFAULT  \\\r\n\t\t\"./?.lua;\"  LUA_LDIR\"?.lua;\"  LUA_LDIR\"?/init.lua;\" \\\r\n\t\t            LUA_CDIR\"?.lua;\"  LUA_CDIR\"?/init.lua\"\r\n#define LUA_CPATH_DEFAULT \\\r\n\t\"./?.so;\"  LUA_CDIR\"?.so;\" LUA_CDIR\"loadall.so\"\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUA_DIRSEP is the directory separator (for submodules).\r\n** CHANGE it if your machine does not use \"/\" as the directory separator\r\n** and is not Windows. (On Windows Lua automatically uses \"\\\".)\r\n*/\r\n#if defined(_WIN32)\r\n#define LUA_DIRSEP\t\"\\\\\"\r\n#else\r\n#define LUA_DIRSEP\t\"/\"\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUA_PATHSEP is the character that separates templates in a path.\r\n@@ LUA_PATH_MARK is the string that marks the substitution points in a\r\n@* template.\r\n@@ LUA_EXECDIR in a Windows path is replaced by the executable's\r\n@* directory.\r\n@@ LUA_IGMARK is a mark to ignore all before it when bulding the\r\n@* luaopen_ function name.\r\n** CHANGE them if for some reason your system cannot use those\r\n** characters. (E.g., if one of those characters is a common character\r\n** in file/directory names.) Probably you do not need to change them.\r\n*/\r\n#define LUA_PATHSEP\t\";\"\r\n#define LUA_PATH_MARK\t\"?\"\r\n#define LUA_EXECDIR\t\"!\"\r\n#define LUA_IGMARK\t\"-\"\r\n\r\n\r\n/*\r\n@@ LUA_INTEGER is the integral type used by lua_pushinteger/lua_tointeger.\r\n** CHANGE that if ptrdiff_t is not adequate on your machine. (On most\r\n** machines, ptrdiff_t gives a good choice between int or long.)\r\n*/\r\n#define LUA_INTEGER\tptrdiff_t\r\n\r\n\r\n/*\r\n@@ LUA_API is a mark for all core API functions.\r\n@@ LUALIB_API is a mark for all standard library functions.\r\n** CHANGE them if you need to define those functions in some special way.\r\n** For instance, if you want to create one Windows DLL with the core and\r\n** the libraries, you may want to use the following definition (define\r\n** LUA_BUILD_AS_DLL to get it).\r\n*/\r\n#if defined(LUA_BUILD_AS_DLL)\r\n\r\n#if defined(LUA_CORE) || defined(LUA_LIB)\r\n#define LUA_API __declspec(dllexport)\r\n#else\r\n#define LUA_API __declspec(dllimport)\r\n#endif\r\n\r\n#else\r\n\r\n#define LUA_API\t\textern\r\n\r\n#endif\r\n\r\n/* more often than not the libs go together with the core */\r\n#define LUALIB_API\tLUA_API\r\n\r\n\r\n/*\r\n@@ LUAI_FUNC is a mark for all extern functions that are not to be\r\n@* exported to outside modules.\r\n@@ LUAI_DATA is a mark for all extern (const) variables that are not to\r\n@* be exported to outside modules.\r\n** CHANGE them if you need to mark them in some special way. Elf/gcc\r\n** (versions 3.2 and later) mark them as \"hidden\" to optimize access\r\n** when Lua is compiled as a shared library.\r\n*/\r\n#if defined(luaall_c)\r\n#define LUAI_FUNC\tstatic\r\n#define LUAI_DATA\t/* empty */\r\n\r\n#elif defined(__GNUC__) && ((__GNUC__*100 + __GNUC_MINOR__) >= 302) && \\\r\n      defined(__ELF__)\r\n#define LUAI_FUNC\t__attribute__((visibility(\"hidden\"))) extern\r\n#define LUAI_DATA\tLUAI_FUNC\r\n\r\n#else\r\n#define LUAI_FUNC\textern\r\n#define LUAI_DATA\textern\r\n#endif\r\n\r\n\r\n\r\n/*\r\n@@ LUA_QL describes how error messages quote program elements.\r\n** CHANGE it if you want a different appearance.\r\n*/\r\n#define LUA_QL(x)\t\"'\" x \"'\"\r\n#define LUA_QS\t\tLUA_QL(\"%s\")\r\n\r\n\r\n/*\r\n@@ LUA_IDSIZE gives the maximum size for the description of the source\r\n@* of a function in debug information.\r\n** CHANGE it if you want a different size.\r\n*/\r\n#define LUA_IDSIZE\t150\r\n\r\n\r\n/*\r\n** {==================================================================\r\n** Stand-alone configuration\r\n** ===================================================================\r\n*/\r\n\r\n#if defined(lua_c) || defined(luaall_c)\r\n\r\n/*\r\n@@ lua_stdin_is_tty detects whether the standard input is a 'tty' (that\r\n@* is, whether we're running lua interactively).\r\n** CHANGE it if you have a better definition for non-POSIX/non-Windows\r\n** systems.\r\n*/\r\n#if defined(LUA_USE_ISATTY)\r\n#include <unistd.h>\r\n#define lua_stdin_is_tty()\tisatty(0)\r\n#elif defined(LUA_WIN)\r\n#include <io.h>\r\n#include <stdio.h>\r\n#define lua_stdin_is_tty()\t_isatty(_fileno(stdin))\r\n#else\r\n#define lua_stdin_is_tty()\t1  /* assume stdin is a tty */\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUA_PROMPT is the default prompt used by stand-alone Lua.\r\n@@ LUA_PROMPT2 is the default continuation prompt used by stand-alone Lua.\r\n** CHANGE them if you want different prompts. (You can also change the\r\n** prompts dynamically, assigning to globals _PROMPT/_PROMPT2.)\r\n*/\r\n#define LUA_PROMPT\t\t\"> \"\r\n#define LUA_PROMPT2\t\t\">> \"\r\n\r\n\r\n/*\r\n@@ LUA_PROGNAME is the default name for the stand-alone Lua program.\r\n** CHANGE it if your stand-alone interpreter has a different name and\r\n** your system is not able to detect that name automatically.\r\n*/\r\n#define LUA_PROGNAME\t\t\"lua\"\r\n\r\n\r\n/*\r\n@@ LUA_MAXINPUT is the maximum length for an input line in the\r\n@* stand-alone interpreter.\r\n** CHANGE it if you need longer lines.\r\n*/\r\n#define LUA_MAXINPUT\t512\r\n\r\n\r\n/*\r\n@@ lua_readline defines how to show a prompt and then read a line from\r\n@* the standard input.\r\n@@ lua_saveline defines how to \"save\" a read line in a \"history\".\r\n@@ lua_freeline defines how to free a line read by lua_readline.\r\n** CHANGE them if you want to improve this functionality (e.g., by using\r\n** GNU readline and history facilities).\r\n*/\r\n#if defined(LUA_USE_READLINE)\r\n#include <stdio.h>\r\n#include <readline/readline.h>\r\n#include <readline/history.h>\r\n#define lua_readline(L,b,p)\t((void)L, ((b)=readline(p)) != NULL)\r\n#define lua_saveline(L,idx) \\\r\n\tif (lua_strlen(L,idx) > 0)  /* non-empty line? */ \\\r\n\t  add_history(lua_tostring(L, idx));  /* add it to history */\r\n#define lua_freeline(L,b)\t((void)L, free(b))\r\n#else\r\n#define lua_readline(L,b,p)\t\\\r\n\t((void)L, fputs(p, stdout), fflush(stdout),  /* show prompt */ \\\r\n\tfgets(b, LUA_MAXINPUT, stdin) != NULL)  /* get line */\r\n#define lua_saveline(L,idx)\t{ (void)L; (void)idx; }\r\n#define lua_freeline(L,b)\t{ (void)L; (void)b; }\r\n#endif\r\n\r\n#endif\r\n\r\n/* }================================================================== */\r\n\r\n\r\n/*\r\n@@ LUAI_GCPAUSE defines the default pause between garbage-collector cycles\r\n@* as a percentage.\r\n** CHANGE it if you want the GC to run faster or slower (higher values\r\n** mean larger pauses which mean slower collection.) You can also change\r\n** this value dynamically.\r\n*/\r\n#define LUAI_GCPAUSE\t200  /* 200% (wait memory to double before next GC) */\r\n\r\n\r\n/*\r\n@@ LUAI_GCMUL defines the default speed of garbage collection relative to\r\n@* memory allocation as a percentage.\r\n** CHANGE it if you want to change the granularity of the garbage\r\n** collection. (Higher values mean coarser collections. 0 represents\r\n** infinity, where each step performs a full collection.) You can also\r\n** change this value dynamically.\r\n*/\r\n#define LUAI_GCMUL\t200 /* GC runs 'twice the speed' of memory allocation */\r\n\r\n\r\n\r\n/*\r\n@@ LUA_COMPAT_GETN controls compatibility with old getn behavior.\r\n** CHANGE it (define it) if you want exact compatibility with the\r\n** behavior of setn/getn in Lua 5.0.\r\n*/\r\n#undef LUA_COMPAT_GETN\r\n\r\n/*\r\n@@ LUA_COMPAT_LOADLIB controls compatibility about global loadlib.\r\n** CHANGE it to undefined as soon as you do not need a global 'loadlib'\r\n** function (the function is still available as 'package.loadlib').\r\n*/\r\n#undef LUA_COMPAT_LOADLIB\r\n\r\n/*\r\n@@ LUA_COMPAT_VARARG controls compatibility with old vararg feature.\r\n** CHANGE it to undefined as soon as your programs use only '...' to\r\n** access vararg parameters (instead of the old 'arg' table).\r\n*/\r\n#define LUA_COMPAT_VARARG\r\n\r\n/*\r\n@@ LUA_COMPAT_MOD controls compatibility with old math.mod function.\r\n** CHANGE it to undefined as soon as your programs use 'math.fmod' or\r\n** the new '%' operator instead of 'math.mod'.\r\n*/\r\n#define LUA_COMPAT_MOD\r\n\r\n/*\r\n@@ LUA_COMPAT_LSTR controls compatibility with old long string nesting\r\n@* facility.\r\n** CHANGE it to 2 if you want the old behaviour, or undefine it to turn\r\n** off the advisory error when nesting [[...]].\r\n*/\r\n#define LUA_COMPAT_LSTR\t\t1\r\n\r\n/*\r\n@@ LUA_COMPAT_GFIND controls compatibility with old 'string.gfind' name.\r\n** CHANGE it to undefined as soon as you rename 'string.gfind' to\r\n** 'string.gmatch'.\r\n*/\r\n#define LUA_COMPAT_GFIND\r\n\r\n/*\r\n@@ LUA_COMPAT_OPENLIB controls compatibility with old 'luaL_openlib'\r\n@* behavior.\r\n** CHANGE it to undefined as soon as you replace to 'luaL_register'\r\n** your uses of 'luaL_openlib'\r\n*/\r\n#define LUA_COMPAT_OPENLIB\r\n\r\n\r\n\r\n/*\r\n@@ luai_apicheck is the assert macro used by the Lua-C API.\r\n** CHANGE luai_apicheck if you want Lua to perform some checks in the\r\n** parameters it gets from API calls. This may slow down the interpreter\r\n** a bit, but may be quite useful when debugging C code that interfaces\r\n** with Lua. A useful redefinition is to use assert.h.\r\n*/\r\n#if defined(LUA_USE_APICHECK)\r\n#include <assert.h>\r\n#define luai_apicheck(L,o)\t{ (void)L; assert(o); }\r\n#else\r\n#define luai_apicheck(L,o)\t{ (void)L; }\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUAI_BITSINT defines the number of bits in an int.\r\n** CHANGE here if Lua cannot automatically detect the number of bits of\r\n** your machine. Probably you do not need to change this.\r\n*/\r\n/* avoid overflows in comparison */\r\n#if INT_MAX-20 < 32760\r\n#define LUAI_BITSINT\t16\r\n#elif INT_MAX > 2147483640L\r\n/* int has at least 32 bits */\r\n#define LUAI_BITSINT\t32\r\n#else\r\n#error \"you must define LUA_BITSINT with number of bits in an integer\"\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUAI_UINT32 is an unsigned integer with at least 32 bits.\r\n@@ LUAI_INT32 is an signed integer with at least 32 bits.\r\n@@ LUAI_UMEM is an unsigned integer big enough to count the total\r\n@* memory used by Lua.\r\n@@ LUAI_MEM is a signed integer big enough to count the total memory\r\n@* used by Lua.\r\n** CHANGE here if for some weird reason the default definitions are not\r\n** good enough for your machine. (The definitions in the 'else'\r\n** part always works, but may waste space on machines with 64-bit\r\n** longs.) Probably you do not need to change this.\r\n*/\r\n#if LUAI_BITSINT >= 32\r\n#define LUAI_UINT32\tunsigned int\r\n#define LUAI_INT32\tint\r\n#define LUAI_MAXINT32\tINT_MAX\r\n#define LUAI_UMEM\tsize_t\r\n#define LUAI_MEM\tptrdiff_t\r\n#else\r\n/* 16-bit ints */\r\n#define LUAI_UINT32\tunsigned long\r\n#define LUAI_INT32\tlong\r\n#define LUAI_MAXINT32\tLONG_MAX\r\n#define LUAI_UMEM\tunsigned long\r\n#define LUAI_MEM\tlong\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUAI_MAXCALLS limits the number of nested calls.\r\n** CHANGE it if you need really deep recursive calls. This limit is\r\n** arbitrary; its only purpose is to stop infinite recursion before\r\n** exhausting memory.\r\n*/\r\n#define LUAI_MAXCALLS\t20000\r\n\r\n\r\n/*\r\n@@ LUAI_MAXCSTACK limits the number of Lua stack slots that a C function\r\n@* can use.\r\n** CHANGE it if you need lots of (Lua) stack space for your C\r\n** functions. This limit is arbitrary; its only purpose is to stop C\r\n** functions to consume unlimited stack space. (must be smaller than\r\n** -LUA_REGISTRYINDEX)\r\n*/\r\n#define LUAI_MAXCSTACK\t8000\r\n\r\n\r\n\r\n/*\r\n** {==================================================================\r\n** CHANGE (to smaller values) the following definitions if your system\r\n** has a small C stack. (Or you may want to change them to larger\r\n** values if your system has a large C stack and these limits are\r\n** too rigid for you.) Some of these constants control the size of\r\n** stack-allocated arrays used by the compiler or the interpreter, while\r\n** others limit the maximum number of recursive calls that the compiler\r\n** or the interpreter can perform. Values too large may cause a C stack\r\n** overflow for some forms of deep constructs.\r\n** ===================================================================\r\n*/\r\n\r\n\r\n/*\r\n@@ LUAI_MAXCCALLS is the maximum depth for nested C calls (short) and\r\n@* syntactical nested non-terminals in a program.\r\n*/\r\n#define LUAI_MAXCCALLS\t\t200\r\n\r\n\r\n/*\r\n@@ LUAI_MAXVARS is the maximum number of local variables per function\r\n@* (must be smaller than 250).\r\n*/\r\n#define LUAI_MAXVARS\t\t200\r\n\r\n\r\n/*\r\n@@ LUAI_MAXUPVALUES is the maximum number of upvalues per function\r\n@* (must be smaller than 250).\r\n*/\r\n#define LUAI_MAXUPVALUES\t60\r\n\r\n\r\n/*\r\n@@ LUAL_BUFFERSIZE is the buffer size used by the lauxlib buffer system.\r\n*/\r\n#define LUAL_BUFFERSIZE\t\tBUFSIZ\r\n\r\n/* }================================================================== */\r\n\r\n\r\n\r\n\r\n/*\r\n** {==================================================================\r\n@@ LUA_NUMBER is the type of numbers in Lua.\r\n** CHANGE the following definitions only if you want to build Lua\r\n** with a number type different from double. You may also need to\r\n** change lua_number2int & lua_number2integer.\r\n** ===================================================================\r\n*/\r\n\r\n#define LUA_NUMBER_DOUBLE\r\n#define LUA_NUMBER\tdouble\r\n\r\n/*\r\n@@ LUAI_UACNUMBER is the result of an 'usual argument conversion'\r\n@* over a number.\r\n*/\r\n#define LUAI_UACNUMBER\tdouble\r\n\r\n\r\n/*\r\n@@ LUA_NUMBER_SCAN is the format for reading numbers.\r\n@@ LUA_NUMBER_FMT is the format for writing numbers.\r\n@@ lua_number2str converts a number to a string.\r\n@@ LUAI_MAXNUMBER2STR is maximum size of previous conversion.\r\n@@ lua_str2number converts a string to a number.\r\n*/\r\n#define LUA_NUMBER_SCAN\t\t\"%lf\"\r\n#define LUA_NUMBER_FMT\t\t\"%.14g\"\r\n#define lua_number2str(s,n)\tsprintf((s), LUA_NUMBER_FMT, (n))\r\n#define LUAI_MAXNUMBER2STR\t32 /* 16 digits, sign, point, and \\0 */\r\n#define lua_str2number(s,p)\tstrtod((s), (p))\r\n\r\n\r\n/*\r\n@@ The luai_num* macros define the primitive operations over numbers.\r\n*/\r\n#if defined(LUA_CORE)\r\n#include <math.h>\r\n#define luai_numadd(a,b)\t((a)+(b))\r\n#define luai_numsub(a,b)\t((a)-(b))\r\n#define luai_nummul(a,b)\t((a)*(b))\r\n#define luai_numdiv(a,b)\t((a)/(b))\r\n#define luai_nummod(a,b)\t((a) - floor((a)/(b))*(b))\r\n#define luai_numpow(a,b)\t(pow(a,b))\r\n#define luai_numunm(a)\t\t(-(a))\r\n#define luai_numeq(a,b)\t\t((a)==(b))\r\n#define luai_numlt(a,b)\t\t((a)<(b))\r\n#define luai_numle(a,b)\t\t((a)<=(b))\r\n#define luai_numisnan(a)\t(!luai_numeq((a), (a)))\r\n#endif\r\n\r\n\r\n/*\r\n@@ lua_number2int is a macro to convert lua_Number to int.\r\n@@ lua_number2integer is a macro to convert lua_Number to lua_Integer.\r\n** CHANGE them if you know a faster way to convert a lua_Number to\r\n** int (with any rounding method and without throwing errors) in your\r\n** system. In Pentium machines, a naive typecast from double to int\r\n** in C is extremely slow, so any alternative is worth trying.\r\n*/\r\n\r\n/* On a Pentium, resort to a trick */\r\n#if defined(LUA_NUMBER_DOUBLE) && !defined(LUA_ANSI) && !defined(__SSE2__) && \\\r\n    (defined(__i386) || defined (_M_IX86) || defined(__i386__))\r\n\r\n/* On a Microsoft compiler, use assembler */\r\n#if defined(_MSC_VER)\r\n\r\n#define lua_number2int(i,d)   __asm fld d   __asm fistp i\r\n#define lua_number2integer(i,n)\t\tlua_number2int(i, n)\r\n\r\n/* the next trick should work on any Pentium, but sometimes clashes\r\n   with a DirectX idiosyncrasy */\r\n#else\r\n\r\nunion luai_Cast { double l_d; long l_l; };\r\n#define lua_number2int(i,d) \\\r\n  { volatile union luai_Cast u; u.l_d = (d) + 6755399441055744.0; (i) = u.l_l; }\r\n#define lua_number2integer(i,n)\t\tlua_number2int(i, n)\r\n\r\n#endif\r\n\r\n\r\n/* this option always works, but may be slow */\r\n#else\r\n#define lua_number2int(i,d)\t((i)=(int)(d))\r\n#define lua_number2integer(i,d)\t((i)=(lua_Integer)(d))\r\n\r\n#endif\r\n\r\n/* }================================================================== */\r\n\r\n\r\n/*\r\n@@ LUAI_USER_ALIGNMENT_T is a type that requires maximum alignment.\r\n** CHANGE it if your system requires alignments larger than double. (For\r\n** instance, if your system supports long doubles and they must be\r\n** aligned in 16-byte boundaries, then you should add long double in the\r\n** union.) Probably you do not need to change this.\r\n*/\r\n#define LUAI_USER_ALIGNMENT_T\tunion { double u; void *s; long l; }\r\n\r\n\r\n/*\r\n@@ LUAI_THROW/LUAI_TRY define how Lua does exception handling.\r\n** CHANGE them if you prefer to use longjmp/setjmp even with C++\r\n** or if want/don't to use _longjmp/_setjmp instead of regular\r\n** longjmp/setjmp. By default, Lua handles errors with exceptions when\r\n** compiling as C++ code, with _longjmp/_setjmp when asked to use them,\r\n** and with longjmp/setjmp otherwise.\r\n*/\r\n#if defined(__cplusplus)\r\n/* C++ exceptions */\r\n#define LUAI_THROW(L,c)\tthrow(c)\r\n#define LUAI_TRY(L,c,a)\ttry { a } catch(...) \\\r\n\t{ if ((c)->status == 0) (c)->status = -1; }\r\n#define luai_jmpbuf\tint  /* dummy variable */\r\n\r\n#elif defined(LUA_USE_ULONGJMP)\r\n/* in Unix, try _longjmp/_setjmp (more efficient) */\r\n#define LUAI_THROW(L,c)\t_longjmp((c)->b, 1)\r\n#define LUAI_TRY(L,c,a)\tif (_setjmp((c)->b) == 0) { a }\r\n#define luai_jmpbuf\tjmp_buf\r\n\r\n#else\r\n/* default handling with long jumps */\r\n#define LUAI_THROW(L,c)\tlongjmp((c)->b, 1)\r\n#define LUAI_TRY(L,c,a)\tif (setjmp((c)->b) == 0) { a }\r\n#define luai_jmpbuf\tjmp_buf\r\n\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUA_MAXCAPTURES is the maximum number of captures that a pattern\r\n@* can do during pattern-matching.\r\n** CHANGE it if you need more captures. This limit is arbitrary.\r\n*/\r\n#define LUA_MAXCAPTURES\t\t32\r\n\r\n\r\n/*\r\n@@ lua_tmpnam is the function that the OS library uses to create a\r\n@* temporary name.\r\n@@ LUA_TMPNAMBUFSIZE is the maximum size of a name created by lua_tmpnam.\r\n** CHANGE them if you have an alternative to tmpnam (which is considered\r\n** insecure) or if you want the original tmpnam anyway.  By default, Lua\r\n** uses tmpnam except when POSIX is available, where it uses mkstemp.\r\n*/\r\n#if defined(loslib_c) || defined(luaall_c)\r\n\r\n#if defined(LUA_USE_MKSTEMP)\r\n#include <unistd.h>\r\n#define LUA_TMPNAMBUFSIZE\t32\r\n#define lua_tmpnam(b,e)\t{ \\\r\n\tstrcpy(b, \"/tmp/lua_XXXXXX\"); \\\r\n\te = mkstemp(b); \\\r\n\tif (e != -1) close(e); \\\r\n\te = (e == -1); }\r\n\r\n#else\r\n#define LUA_TMPNAMBUFSIZE\tL_tmpnam\r\n#define lua_tmpnam(b,e)\t\t{ e = (tmpnam(b) == NULL); }\r\n#endif\r\n\r\n#endif\r\n\r\n\r\n/*\r\n@@ lua_popen spawns a new process connected to the current one through\r\n@* the file streams.\r\n** CHANGE it if you have a way to implement it in your system.\r\n*/\r\n#if defined(LUA_USE_POPEN)\r\n\r\n#define lua_popen(L,c,m)\t((void)L, fflush(NULL), popen(c,m))\r\n#define lua_pclose(L,file)\t((void)L, (pclose(file) != -1))\r\n\r\n#elif defined(LUA_WIN)\r\n\r\n#define lua_popen(L,c,m)\t((void)L, _popen(c,m))\r\n#define lua_pclose(L,file)\t((void)L, (_pclose(file) != -1))\r\n\r\n#else\r\n\r\n#define lua_popen(L,c,m)\t((void)((void)c, m),  \\\r\n\t\tluaL_error(L, LUA_QL(\"popen\") \" not supported\"), (FILE*)0)\r\n#define lua_pclose(L,file)\t\t((void)((void)L, file), 0)\r\n\r\n#endif\r\n\r\n/*\r\n@@ LUA_DL_* define which dynamic-library system Lua should use.\r\n** CHANGE here if Lua has problems choosing the appropriate\r\n** dynamic-library system for your platform (either Windows' DLL, Mac's\r\n** dyld, or Unix's dlopen). If your system is some kind of Unix, there\r\n** is a good chance that it has dlopen, so LUA_DL_DLOPEN will work for\r\n** it.  To use dlopen you also need to adapt the src/Makefile (probably\r\n** adding -ldl to the linker options), so Lua does not select it\r\n** automatically.  (When you change the makefile to add -ldl, you must\r\n** also add -DLUA_USE_DLOPEN.)\r\n** If you do not want any kind of dynamic library, undefine all these\r\n** options.\r\n** By default, _WIN32 gets LUA_DL_DLL and MAC OS X gets LUA_DL_DYLD.\r\n*/\r\n#if defined(LUA_USE_DLOPEN)\r\n#define LUA_DL_DLOPEN\r\n#endif\r\n\r\n#if defined(LUA_WIN)\r\n#define LUA_DL_DLL\r\n#endif\r\n\r\n\r\n/*\r\n@@ LUAI_EXTRASPACE allows you to add user-specific data in a lua_State\r\n@* (the data goes just *before* the lua_State pointer).\r\n** CHANGE (define) this if you really need that. This value must be\r\n** a multiple of the maximum alignment required for your machine.\r\n*/\r\n#define LUAI_EXTRASPACE\t\t0\r\n\r\n\r\n/*\r\n@@ luai_userstate* allow user-specific actions on threads.\r\n** CHANGE them if you defined LUAI_EXTRASPACE and need to do something\r\n** extra when a thread is created/deleted/resumed/yielded.\r\n*/\r\n#define luai_userstateopen(L)\t\t((void)L)\r\n#define luai_userstateclose(L)\t\t((void)L)\r\n#define luai_userstatethread(L,L1)\t((void)L)\r\n#define luai_userstatefree(L)\t\t((void)L)\r\n#define luai_userstateresume(L,n)\t((void)L)\r\n#define luai_userstateyield(L,n)\t((void)L)\r\n\r\n\r\n/*\r\n@@ LUA_INTFRMLEN is the length modifier for integer conversions\r\n@* in 'string.format'.\r\n@@ LUA_INTFRM_T is the integer type correspoding to the previous length\r\n@* modifier.\r\n** CHANGE them if your system supports long long or does not support long.\r\n*/\r\n\r\n#if defined(LUA_USELONGLONG)\r\n\r\n#define LUA_INTFRMLEN\t\t\"ll\"\r\n#define LUA_INTFRM_T\t\tlong long\r\n\r\n#else\r\n\r\n#define LUA_INTFRMLEN\t\t\"l\"\r\n#define LUA_INTFRM_T\t\tlong\r\n\r\n#endif\r\n\r\n\r\n\r\n/* =================================================================== */\r\n\r\n/*\r\n** Local configuration. You can use this space to add your redefinitions\r\n** without modifying the main part of the file.\r\n*/\r\n\r\n\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lualib.h",
    "content": "/*\r\n** $Id: lualib.h,v 1.36.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Lua standard libraries\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lualib_h\r\n#define lualib_h\r\n\r\n#include \"lua.h\"\r\n\r\n\r\n/* Key to file-handle type */\r\n#define LUA_FILEHANDLE\t\t\"FILE*\"\r\n\r\n\r\n#define LUA_COLIBNAME\t\"coroutine\"\r\nLUALIB_API int (luaopen_base) (lua_State *L);\r\n\r\n#define LUA_TABLIBNAME\t\"table\"\r\nLUALIB_API int (luaopen_table) (lua_State *L);\r\n\r\n#define LUA_IOLIBNAME\t\"io\"\r\nLUALIB_API int (luaopen_io) (lua_State *L);\r\n\r\n#define LUA_OSLIBNAME\t\"os\"\r\nLUALIB_API int (luaopen_os) (lua_State *L);\r\n\r\n#define LUA_STRLIBNAME\t\"string\"\r\nLUALIB_API int (luaopen_string) (lua_State *L);\r\n\r\n#define LUA_MATHLIBNAME\t\"math\"\r\nLUALIB_API int (luaopen_math) (lua_State *L);\r\n\r\n#define LUA_DBLIBNAME\t\"debug\"\r\nLUALIB_API int (luaopen_debug) (lua_State *L);\r\n\r\n#define LUA_LOADLIBNAME\t\"package\"\r\nLUALIB_API int (luaopen_package) (lua_State *L);\r\n\r\n\r\n/* open all previous libraries */\r\nLUALIB_API void (luaL_openlibs) (lua_State *L); \r\n\r\n\r\n\r\n#ifndef lua_assert\r\n#define lua_assert(x)\t((void)0)\r\n#endif\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lundump.c",
    "content": "/*\r\n** $Id: lundump.c,v 2.7.1.4 2008/04/04 19:51:41 roberto Exp $\r\n** load precompiled Lua chunks\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <string.h>\r\n\r\n#define lundump_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lmem.h\"\r\n#include \"lobject.h\"\r\n#include \"lstring.h\"\r\n#include \"lundump.h\"\r\n#include \"lzio.h\"\r\n\r\ntypedef struct {\r\n lua_State* L;\r\n ZIO* Z;\r\n Mbuffer* b;\r\n const char* name;\r\n} LoadState;\r\n\r\n#ifdef LUAC_TRUST_BINARIES\r\n#define IF(c,s)\r\n#define error(S,s)\r\n#else\r\n#define IF(c,s)\t\tif (c) error(S,s)\r\n\r\nstatic void error(LoadState* S, const char* why)\r\n{\r\n luaO_pushfstring(S->L,\"%s: %s in precompiled chunk\",S->name,why);\r\n luaD_throw(S->L,LUA_ERRSYNTAX);\r\n}\r\n#endif\r\n\r\n#define LoadMem(S,b,n,size)\tLoadBlock(S,b,(n)*(size))\r\n#define\tLoadByte(S)\t\t(lu_byte)LoadChar(S)\r\n#define LoadVar(S,x)\t\tLoadMem(S,&x,1,sizeof(x))\r\n#define LoadVector(S,b,n,size)\tLoadMem(S,b,n,size)\r\n\r\nstatic void LoadBlock(LoadState* S, void* b, size_t size)\r\n{\r\n size_t r=luaZ_read(S->Z,b,size);\r\n IF (r!=0, \"unexpected end\");\r\n}\r\n\r\nstatic int LoadChar(LoadState* S)\r\n{\r\n char x;\r\n LoadVar(S,x);\r\n return x;\r\n}\r\n\r\nstatic int LoadInt(LoadState* S)\r\n{\r\n int x;\r\n LoadVar(S,x);\r\n IF (x<0, \"bad integer\");\r\n return x;\r\n}\r\n\r\nstatic lua_Number LoadNumber(LoadState* S)\r\n{\r\n lua_Number x;\r\n LoadVar(S,x);\r\n return x;\r\n}\r\n\r\nstatic TString* LoadString(LoadState* S)\r\n{\r\n size_t size;\r\n LoadVar(S,size);\r\n if (size==0)\r\n  return NULL;\r\n else\r\n {\r\n  char* s=luaZ_openspace(S->L,S->b,size);\r\n  LoadBlock(S,s,size);\r\n  return luaS_newlstr(S->L,s,size-1);\t\t/* remove trailing '\\0' */\r\n }\r\n}\r\n\r\nstatic void LoadCode(LoadState* S, Proto* f)\r\n{\r\n int n=LoadInt(S);\r\n f->code=luaM_newvector(S->L,n,Instruction);\r\n f->sizecode=n;\r\n LoadVector(S,f->code,n,sizeof(Instruction));\r\n}\r\n\r\nstatic Proto* LoadFunction(LoadState* S, TString* p);\r\n\r\nstatic void LoadConstants(LoadState* S, Proto* f)\r\n{\r\n int i,n;\r\n n=LoadInt(S);\r\n f->k=luaM_newvector(S->L,n,TValue);\r\n f->sizek=n;\r\n for (i=0; i<n; i++) setnilvalue(&f->k[i]);\r\n for (i=0; i<n; i++)\r\n {\r\n  TValue* o=&f->k[i];\r\n  int t=LoadChar(S);\r\n  switch (t)\r\n  {\r\n   case LUA_TNIL:\r\n   \tsetnilvalue(o);\r\n\tbreak;\r\n   case LUA_TBOOLEAN:\r\n   \tsetbvalue(o,LoadChar(S)!=0);\r\n\tbreak;\r\n   case LUA_TNUMBER:\r\n\tsetnvalue(o,LoadNumber(S));\r\n\tbreak;\r\n   case LUA_TSTRING:\r\n\tsetsvalue2n(S->L,o,LoadString(S));\r\n\tbreak;\r\n   default:\r\n\terror(S,\"bad constant\");\r\n\tbreak;\r\n  }\r\n }\r\n n=LoadInt(S);\r\n f->p=luaM_newvector(S->L,n,Proto*);\r\n f->sizep=n;\r\n for (i=0; i<n; i++) f->p[i]=NULL;\r\n for (i=0; i<n; i++) f->p[i]=LoadFunction(S,f->source);\r\n}\r\n\r\nstatic void LoadDebug(LoadState* S, Proto* f)\r\n{\r\n int i,n;\r\n n=LoadInt(S);\r\n f->lineinfo=luaM_newvector(S->L,n,int);\r\n f->sizelineinfo=n;\r\n LoadVector(S,f->lineinfo,n,sizeof(int));\r\n n=LoadInt(S);\r\n f->locvars=luaM_newvector(S->L,n,LocVar);\r\n f->sizelocvars=n;\r\n for (i=0; i<n; i++) f->locvars[i].varname=NULL;\r\n for (i=0; i<n; i++)\r\n {\r\n  f->locvars[i].varname=LoadString(S);\r\n  f->locvars[i].startpc=LoadInt(S);\r\n  f->locvars[i].endpc=LoadInt(S);\r\n }\r\n n=LoadInt(S);\r\n f->upvalues=luaM_newvector(S->L,n,TString*);\r\n f->sizeupvalues=n;\r\n for (i=0; i<n; i++) f->upvalues[i]=NULL;\r\n for (i=0; i<n; i++) f->upvalues[i]=LoadString(S);\r\n}\r\n\r\nstatic Proto* LoadFunction(LoadState* S, TString* p)\r\n{\r\n Proto* f;\r\n if (++S->L->nCcalls > LUAI_MAXCCALLS) error(S,\"code too deep\");\r\n f=luaF_newproto(S->L);\r\n setptvalue2s(S->L,S->L->top,f); incr_top(S->L);\r\n f->source=LoadString(S); if (f->source==NULL) f->source=p;\r\n f->linedefined=LoadInt(S);\r\n f->lastlinedefined=LoadInt(S);\r\n f->nups=LoadByte(S);\r\n f->numparams=LoadByte(S);\r\n f->is_vararg=LoadByte(S);\r\n f->maxstacksize=LoadByte(S);\r\n LoadCode(S,f);\r\n LoadConstants(S,f);\r\n LoadDebug(S,f);\r\n IF (!luaG_checkcode(f), \"bad code\");\r\n S->L->top--;\r\n S->L->nCcalls--;\r\n return f;\r\n}\r\n\r\nstatic void LoadHeader(LoadState* S)\r\n{\r\n char h[LUAC_HEADERSIZE];\r\n char s[LUAC_HEADERSIZE];\r\n luaU_header(h);\r\n LoadBlock(S,s,LUAC_HEADERSIZE);\r\n IF (memcmp(h,s,LUAC_HEADERSIZE)!=0, \"bad header\");\r\n}\r\n\r\n/*\r\n** load precompiled chunk\r\n*/\r\nProto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name)\r\n{\r\n LoadState S;\r\n if (*name=='@' || *name=='=')\r\n  S.name=name+1;\r\n else if (*name==LUA_SIGNATURE[0])\r\n  S.name=\"binary string\";\r\n else\r\n  S.name=name;\r\n S.L=L;\r\n S.Z=Z;\r\n S.b=buff;\r\n LoadHeader(&S);\r\n return LoadFunction(&S,luaS_newliteral(L,\"=?\"));\r\n}\r\n\r\n/*\r\n* make header\r\n*/\r\nvoid luaU_header (char* h)\r\n{\r\n int x=1;\r\n memcpy(h,LUA_SIGNATURE,sizeof(LUA_SIGNATURE)-1);\r\n h+=sizeof(LUA_SIGNATURE)-1;\r\n *h++=(char)LUAC_VERSION;\r\n *h++=(char)LUAC_FORMAT;\r\n *h++=(char)*(char*)&x;\t\t\t\t/* endianness */\r\n *h++=(char)sizeof(int);\r\n *h++=(char)sizeof(size_t);\r\n *h++=(char)sizeof(Instruction);\r\n *h++=(char)sizeof(lua_Number);\r\n *h++=(char)(((lua_Number)0.5)==0);\t\t/* is lua_Number integral? */\r\n}\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lundump.h",
    "content": "/*\r\n** $Id: lundump.h,v 1.37.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** load precompiled Lua chunks\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lundump_h\r\n#define lundump_h\r\n\r\n#include \"lobject.h\"\r\n#include \"lzio.h\"\r\n\r\n/* load one chunk; from lundump.c */\r\nLUAI_FUNC Proto* luaU_undump (lua_State* L, ZIO* Z, Mbuffer* buff, const char* name);\r\n\r\n/* make header; from lundump.c */\r\nLUAI_FUNC void luaU_header (char* h);\r\n\r\n/* dump one chunk; from ldump.c */\r\nLUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip);\r\n\r\n#ifdef luac_c\r\n/* print one chunk; from print.c */\r\nLUAI_FUNC void luaU_print (const Proto* f, int full);\r\n#endif\r\n\r\n/* for header of binary files -- this is Lua 5.1 */\r\n#define LUAC_VERSION\t\t0x51\r\n\r\n/* for header of binary files -- this is the official format */\r\n#define LUAC_FORMAT\t\t0\r\n\r\n/* size of header of binary files */\r\n#define LUAC_HEADERSIZE\t\t12\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lvm.c",
    "content": "/*\r\n** $Id: lvm.c,v 2.63.1.5 2011/08/17 20:43:11 roberto Exp $\r\n** Lua virtual machine\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define lvm_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"ldebug.h\"\r\n#include \"ldo.h\"\r\n#include \"lfunc.h\"\r\n#include \"lgc.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lstate.h\"\r\n#include \"lstring.h\"\r\n#include \"ltable.h\"\r\n#include \"ltm.h\"\r\n#include \"lvm.h\"\r\n\r\n\r\n\r\n/* limit for table tag-method chains (to avoid loops) */\r\n#define MAXTAGLOOP\t100\r\n\r\n\r\nconst TValue *luaV_tonumber (const TValue *obj, TValue *n) {\r\n  lua_Number num;\r\n  if (ttisnumber(obj)) return obj;\r\n  if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {\r\n    setnvalue(n, num);\r\n    return n;\r\n  }\r\n  else\r\n    return NULL;\r\n}\r\n\r\n\r\nint luaV_tostring (lua_State *L, StkId obj) {\r\n  if (!ttisnumber(obj))\r\n    return 0;\r\n  else {\r\n    char s[LUAI_MAXNUMBER2STR];\r\n    lua_Number n = nvalue(obj);\r\n    lua_number2str(s, n);\r\n    setsvalue2s(L, obj, luaS_new(L, s));\r\n    return 1;\r\n  }\r\n}\r\n\r\n\r\nstatic void traceexec (lua_State *L, const Instruction *pc) {\r\n  lu_byte mask = L->hookmask;\r\n  const Instruction *oldpc = L->savedpc;\r\n  L->savedpc = pc;\r\n  if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {\r\n    resethookcount(L);\r\n    luaD_callhook(L, LUA_HOOKCOUNT, -1);\r\n  }\r\n  if (mask & LUA_MASKLINE) {\r\n    Proto *p = ci_func(L->ci)->l.p;\r\n    int npc = pcRel(pc, p);\r\n    int newline = getline(p, npc);\r\n    /* call linehook when enter a new function, when jump back (loop),\r\n       or when enter a new line */\r\n    if (npc == 0 || pc <= oldpc || newline != getline(p, pcRel(oldpc, p)))\r\n      luaD_callhook(L, LUA_HOOKLINE, newline);\r\n  }\r\n}\r\n\r\n\r\nstatic void callTMres (lua_State *L, StkId res, const TValue *f,\r\n                        const TValue *p1, const TValue *p2) {\r\n  ptrdiff_t result = savestack(L, res);\r\n  setobj2s(L, L->top, f);  /* push function */\r\n  setobj2s(L, L->top+1, p1);  /* 1st argument */\r\n  setobj2s(L, L->top+2, p2);  /* 2nd argument */\r\n  luaD_checkstack(L, 3);\r\n  L->top += 3;\r\n  luaD_call(L, L->top - 3, 1);\r\n  res = restorestack(L, result);\r\n  L->top--;\r\n  setobjs2s(L, res, L->top);\r\n}\r\n\r\n\r\n\r\nstatic void callTM (lua_State *L, const TValue *f, const TValue *p1,\r\n                    const TValue *p2, const TValue *p3) {\r\n  setobj2s(L, L->top, f);  /* push function */\r\n  setobj2s(L, L->top+1, p1);  /* 1st argument */\r\n  setobj2s(L, L->top+2, p2);  /* 2nd argument */\r\n  setobj2s(L, L->top+3, p3);  /* 3th argument */\r\n  luaD_checkstack(L, 4);\r\n  L->top += 4;\r\n  luaD_call(L, L->top - 4, 0);\r\n}\r\n\r\n\r\nvoid luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {\r\n  int loop;\r\n  for (loop = 0; loop < MAXTAGLOOP; loop++) {\r\n    const TValue *tm;\r\n    if (ttistable(t)) {  /* `t' is a table? */\r\n      Table *h = hvalue(t);\r\n      const TValue *res = luaH_get(h, key); /* do a primitive get */\r\n      if (!ttisnil(res) ||  /* result is no nil? */\r\n          (tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */\r\n        setobj2s(L, val, res);\r\n        return;\r\n      }\r\n      /* else will try the tag method */\r\n    }\r\n    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))\r\n      luaG_typeerror(L, t, \"index\");\r\n    if (ttisfunction(tm)) {\r\n      callTMres(L, val, tm, t, key);\r\n      return;\r\n    }\r\n    t = tm;  /* else repeat with `tm' */ \r\n  }\r\n  luaG_runerror(L, \"loop in gettable\");\r\n}\r\n\r\n\r\nvoid luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {\r\n  int loop;\r\n  TValue temp;\r\n  for (loop = 0; loop < MAXTAGLOOP; loop++) {\r\n    const TValue *tm;\r\n    if (ttistable(t)) {  /* `t' is a table? */\r\n      Table *h = hvalue(t);\r\n      TValue *oldval = luaH_set(L, h, key); /* do a primitive set */\r\n      if (!ttisnil(oldval) ||  /* result is no nil? */\r\n          (tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */\r\n        setobj2t(L, oldval, val);\r\n        h->flags = 0;\r\n        luaC_barriert(L, h, val);\r\n        return;\r\n      }\r\n      /* else will try the tag method */\r\n    }\r\n    else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))\r\n      luaG_typeerror(L, t, \"index\");\r\n    if (ttisfunction(tm)) {\r\n      callTM(L, tm, t, key, val);\r\n      return;\r\n    }\r\n    /* else repeat with `tm' */\r\n    setobj(L, &temp, tm);  /* avoid pointing inside table (may rehash) */\r\n    t = &temp;\r\n  }\r\n  luaG_runerror(L, \"loop in settable\");\r\n}\r\n\r\n\r\nstatic int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,\r\n                       StkId res, TMS event) {\r\n  const TValue *tm = luaT_gettmbyobj(L, p1, event);  /* try first operand */\r\n  if (ttisnil(tm))\r\n    tm = luaT_gettmbyobj(L, p2, event);  /* try second operand */\r\n  if (ttisnil(tm)) return 0;\r\n  callTMres(L, res, tm, p1, p2);\r\n  return 1;\r\n}\r\n\r\n\r\nstatic const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2,\r\n                                  TMS event) {\r\n  const TValue *tm1 = fasttm(L, mt1, event);\r\n  const TValue *tm2;\r\n  if (tm1 == NULL) return NULL;  /* no metamethod */\r\n  if (mt1 == mt2) return tm1;  /* same metatables => same metamethods */\r\n  tm2 = fasttm(L, mt2, event);\r\n  if (tm2 == NULL) return NULL;  /* no metamethod */\r\n  if (luaO_rawequalObj(tm1, tm2))  /* same metamethods? */\r\n    return tm1;\r\n  return NULL;\r\n}\r\n\r\n\r\nstatic int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,\r\n                         TMS event) {\r\n  const TValue *tm1 = luaT_gettmbyobj(L, p1, event);\r\n  const TValue *tm2;\r\n  if (ttisnil(tm1)) return -1;  /* no metamethod? */\r\n  tm2 = luaT_gettmbyobj(L, p2, event);\r\n  if (!luaO_rawequalObj(tm1, tm2))  /* different metamethods? */\r\n    return -1;\r\n  callTMres(L, L->top, tm1, p1, p2);\r\n  return !l_isfalse(L->top);\r\n}\r\n\r\n\r\nstatic int l_strcmp (const TString *ls, const TString *rs) {\r\n  const char *l = getstr(ls);\r\n  size_t ll = ls->tsv.len;\r\n  const char *r = getstr(rs);\r\n  size_t lr = rs->tsv.len;\r\n  for (;;) {\r\n    int temp = strcoll(l, r);\r\n    if (temp != 0) return temp;\r\n    else {  /* strings are equal up to a `\\0' */\r\n      size_t len = strlen(l);  /* index of first `\\0' in both strings */\r\n      if (len == lr)  /* r is finished? */\r\n        return (len == ll) ? 0 : 1;\r\n      else if (len == ll)  /* l is finished? */\r\n        return -1;  /* l is smaller than r (because r is not finished) */\r\n      /* both strings longer than `len'; go on comparing (after the `\\0') */\r\n      len++;\r\n      l += len; ll -= len; r += len; lr -= len;\r\n    }\r\n  }\r\n}\r\n\r\n\r\nint luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {\r\n  int res;\r\n  if (ttype(l) != ttype(r))\r\n    return luaG_ordererror(L, l, r);\r\n  else if (ttisnumber(l))\r\n    return luai_numlt(nvalue(l), nvalue(r));\r\n  else if (ttisstring(l))\r\n    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;\r\n  else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)\r\n    return res;\r\n  return luaG_ordererror(L, l, r);\r\n}\r\n\r\n\r\nstatic int lessequal (lua_State *L, const TValue *l, const TValue *r) {\r\n  int res;\r\n  if (ttype(l) != ttype(r))\r\n    return luaG_ordererror(L, l, r);\r\n  else if (ttisnumber(l))\r\n    return luai_numle(nvalue(l), nvalue(r));\r\n  else if (ttisstring(l))\r\n    return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;\r\n  else if ((res = call_orderTM(L, l, r, TM_LE)) != -1)  /* first try `le' */\r\n    return res;\r\n  else if ((res = call_orderTM(L, r, l, TM_LT)) != -1)  /* else try `lt' */\r\n    return !res;\r\n  return luaG_ordererror(L, l, r);\r\n}\r\n\r\n\r\nint luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2) {\r\n  const TValue *tm;\r\n  lua_assert(ttype(t1) == ttype(t2));\r\n  switch (ttype(t1)) {\r\n    case LUA_TNIL: return 1;\r\n    case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));\r\n    case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2);  /* true must be 1 !! */\r\n    case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);\r\n    case LUA_TUSERDATA: {\r\n      if (uvalue(t1) == uvalue(t2)) return 1;\r\n      tm = get_compTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable,\r\n                         TM_EQ);\r\n      break;  /* will try TM */\r\n    }\r\n    case LUA_TTABLE: {\r\n      if (hvalue(t1) == hvalue(t2)) return 1;\r\n      tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);\r\n      break;  /* will try TM */\r\n    }\r\n    default: return gcvalue(t1) == gcvalue(t2);\r\n  }\r\n  if (tm == NULL) return 0;  /* no TM? */\r\n  callTMres(L, L->top, tm, t1, t2);  /* call TM */\r\n  return !l_isfalse(L->top);\r\n}\r\n\r\n\r\nvoid luaV_concat (lua_State *L, int total, int last) {\r\n  do {\r\n    StkId top = L->base + last + 1;\r\n    int n = 2;  /* number of elements handled in this pass (at least 2) */\r\n    if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {\r\n      if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))\r\n        luaG_concaterror(L, top-2, top-1);\r\n    } else if (tsvalue(top-1)->len == 0)  /* second op is empty? */\r\n      (void)tostring(L, top - 2);  /* result is first op (as string) */\r\n    else {\r\n      /* at least two string values; get as many as possible */\r\n      size_t tl = tsvalue(top-1)->len;\r\n      char *buffer;\r\n      int i;\r\n      /* collect total length */\r\n      for (n = 1; n < total && tostring(L, top-n-1); n++) {\r\n        size_t l = tsvalue(top-n-1)->len;\r\n        if (l >= MAX_SIZET - tl) luaG_runerror(L, \"string length overflow\");\r\n        tl += l;\r\n      }\r\n      buffer = luaZ_openspace(L, &G(L)->buff, tl);\r\n      tl = 0;\r\n      for (i=n; i>0; i--) {  /* concat all strings */\r\n        size_t l = tsvalue(top-i)->len;\r\n        memcpy(buffer+tl, svalue(top-i), l);\r\n        tl += l;\r\n      }\r\n      setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));\r\n    }\r\n    total -= n-1;  /* got `n' strings to create 1 new */\r\n    last -= n-1;\r\n  } while (total > 1);  /* repeat until only 1 result left */\r\n}\r\n\r\n\r\nstatic void Arith (lua_State *L, StkId ra, const TValue *rb,\r\n                   const TValue *rc, TMS op) {\r\n  TValue tempb, tempc;\r\n  const TValue *b, *c;\r\n  if ((b = luaV_tonumber(rb, &tempb)) != NULL &&\r\n      (c = luaV_tonumber(rc, &tempc)) != NULL) {\r\n    lua_Number nb = nvalue(b), nc = nvalue(c);\r\n    switch (op) {\r\n      case TM_ADD: setnvalue(ra, luai_numadd(nb, nc)); break;\r\n      case TM_SUB: setnvalue(ra, luai_numsub(nb, nc)); break;\r\n      case TM_MUL: setnvalue(ra, luai_nummul(nb, nc)); break;\r\n      case TM_DIV: setnvalue(ra, luai_numdiv(nb, nc)); break;\r\n      case TM_MOD: setnvalue(ra, luai_nummod(nb, nc)); break;\r\n      case TM_POW: setnvalue(ra, luai_numpow(nb, nc)); break;\r\n      case TM_UNM: setnvalue(ra, luai_numunm(nb)); break;\r\n      default: lua_assert(0); break;\r\n    }\r\n  }\r\n  else if (!call_binTM(L, rb, rc, ra, op))\r\n    luaG_aritherror(L, rb, rc);\r\n}\r\n\r\n\r\n\r\n/*\r\n** some macros for common tasks in `luaV_execute'\r\n*/\r\n\r\n#define runtime_check(L, c)\t{ if (!(c)) break; }\r\n\r\n#define RA(i)\t(base+GETARG_A(i))\r\n/* to be used after possible stack reallocation */\r\n#define RB(i)\tcheck_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))\r\n#define RC(i)\tcheck_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))\r\n#define RKB(i)\tcheck_exp(getBMode(GET_OPCODE(i)) == OpArgK, \\\r\n\tISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))\r\n#define RKC(i)\tcheck_exp(getCMode(GET_OPCODE(i)) == OpArgK, \\\r\n\tISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))\r\n#define KBx(i)\tcheck_exp(getBMode(GET_OPCODE(i)) == OpArgK, k+GETARG_Bx(i))\r\n\r\n\r\n#define dojump(L,pc,i)\t{(pc) += (i); luai_threadyield(L);}\r\n\r\n\r\n#define Protect(x)\t{ L->savedpc = pc; {x;}; base = L->base; }\r\n\r\n\r\n#define arith_op(op,tm) { \\\r\n        TValue *rb = RKB(i); \\\r\n        TValue *rc = RKC(i); \\\r\n        if (ttisnumber(rb) && ttisnumber(rc)) { \\\r\n          lua_Number nb = nvalue(rb), nc = nvalue(rc); \\\r\n          setnvalue(ra, op(nb, nc)); \\\r\n        } \\\r\n        else \\\r\n          Protect(Arith(L, ra, rb, rc, tm)); \\\r\n      }\r\n\r\n\r\n\r\nvoid luaV_execute (lua_State *L, int nexeccalls) {\r\n  LClosure *cl;\r\n  StkId base;\r\n  TValue *k;\r\n  const Instruction *pc;\r\n reentry:  /* entry point */\r\n  lua_assert(isLua(L->ci));\r\n  pc = L->savedpc;\r\n  cl = &clvalue(L->ci->func)->l;\r\n  base = L->base;\r\n  k = cl->p->k;\r\n  /* main loop of interpreter */\r\n  for (;;) {\r\n    const Instruction i = *pc++;\r\n    StkId ra;\r\n    if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&\r\n        (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {\r\n      traceexec(L, pc);\r\n      if (L->status == LUA_YIELD) {  /* did hook yield? */\r\n        L->savedpc = pc - 1;\r\n        return;\r\n      }\r\n      base = L->base;\r\n    }\r\n    /* warning!! several calls may realloc the stack and invalidate `ra' */\r\n    ra = RA(i);\r\n    lua_assert(base == L->base && L->base == L->ci->base);\r\n    lua_assert(base <= L->top && L->top <= L->stack + L->stacksize);\r\n    lua_assert(L->top == L->ci->top || luaG_checkopenop(i));\r\n    switch (GET_OPCODE(i)) {\r\n      case OP_MOVE: {\r\n        setobjs2s(L, ra, RB(i));\r\n        continue;\r\n      }\r\n      case OP_LOADK: {\r\n        setobj2s(L, ra, KBx(i));\r\n        continue;\r\n      }\r\n      case OP_LOADBOOL: {\r\n        setbvalue(ra, GETARG_B(i));\r\n        if (GETARG_C(i)) pc++;  /* skip next instruction (if C) */\r\n        continue;\r\n      }\r\n      case OP_LOADNIL: {\r\n        TValue *rb = RB(i);\r\n        do {\r\n          setnilvalue(rb--);\r\n        } while (rb >= ra);\r\n        continue;\r\n      }\r\n      case OP_GETUPVAL: {\r\n        int b = GETARG_B(i);\r\n        setobj2s(L, ra, cl->upvals[b]->v);\r\n        continue;\r\n      }\r\n      case OP_GETGLOBAL: {\r\n        TValue g;\r\n        TValue *rb = KBx(i);\r\n        sethvalue(L, &g, cl->env);\r\n        lua_assert(ttisstring(rb));\r\n        Protect(luaV_gettable(L, &g, rb, ra));\r\n        continue;\r\n      }\r\n      case OP_GETTABLE: {\r\n        Protect(luaV_gettable(L, RB(i), RKC(i), ra));\r\n        continue;\r\n      }\r\n      case OP_SETGLOBAL: {\r\n        TValue g;\r\n        sethvalue(L, &g, cl->env);\r\n        lua_assert(ttisstring(KBx(i)));\r\n        Protect(luaV_settable(L, &g, KBx(i), ra));\r\n        continue;\r\n      }\r\n      case OP_SETUPVAL: {\r\n        UpVal *uv = cl->upvals[GETARG_B(i)];\r\n        setobj(L, uv->v, ra);\r\n        luaC_barrier(L, uv, ra);\r\n        continue;\r\n      }\r\n      case OP_SETTABLE: {\r\n        Protect(luaV_settable(L, ra, RKB(i), RKC(i)));\r\n        continue;\r\n      }\r\n      case OP_NEWTABLE: {\r\n        int b = GETARG_B(i);\r\n        int c = GETARG_C(i);\r\n        sethvalue(L, ra, luaH_new(L, luaO_fb2int(b), luaO_fb2int(c)));\r\n        Protect(luaC_checkGC(L));\r\n        continue;\r\n      }\r\n      case OP_SELF: {\r\n        StkId rb = RB(i);\r\n        setobjs2s(L, ra+1, rb);\r\n        Protect(luaV_gettable(L, rb, RKC(i), ra));\r\n        continue;\r\n      }\r\n      case OP_ADD: {\r\n        arith_op(luai_numadd, TM_ADD);\r\n        continue;\r\n      }\r\n      case OP_SUB: {\r\n        arith_op(luai_numsub, TM_SUB);\r\n        continue;\r\n      }\r\n      case OP_MUL: {\r\n        arith_op(luai_nummul, TM_MUL);\r\n        continue;\r\n      }\r\n      case OP_DIV: {\r\n        arith_op(luai_numdiv, TM_DIV);\r\n        continue;\r\n      }\r\n      case OP_MOD: {\r\n        arith_op(luai_nummod, TM_MOD);\r\n        continue;\r\n      }\r\n      case OP_POW: {\r\n        arith_op(luai_numpow, TM_POW);\r\n        continue;\r\n      }\r\n      case OP_UNM: {\r\n        TValue *rb = RB(i);\r\n        if (ttisnumber(rb)) {\r\n          lua_Number nb = nvalue(rb);\r\n          setnvalue(ra, luai_numunm(nb));\r\n        }\r\n        else {\r\n          Protect(Arith(L, ra, rb, rb, TM_UNM));\r\n        }\r\n        continue;\r\n      }\r\n      case OP_NOT: {\r\n        int res = l_isfalse(RB(i));  /* next assignment may change this value */\r\n        setbvalue(ra, res);\r\n        continue;\r\n      }\r\n      case OP_LEN: {\r\n        const TValue *rb = RB(i);\r\n        switch (ttype(rb)) {\r\n          case LUA_TTABLE: {\r\n            setnvalue(ra, cast_num(luaH_getn(hvalue(rb))));\r\n            break;\r\n          }\r\n          case LUA_TSTRING: {\r\n            setnvalue(ra, cast_num(tsvalue(rb)->len));\r\n            break;\r\n          }\r\n          default: {  /* try metamethod */\r\n            Protect(\r\n              if (!call_binTM(L, rb, luaO_nilobject, ra, TM_LEN))\r\n                luaG_typeerror(L, rb, \"get length of\");\r\n            )\r\n          }\r\n        }\r\n        continue;\r\n      }\r\n      case OP_CONCAT: {\r\n        int b = GETARG_B(i);\r\n        int c = GETARG_C(i);\r\n        Protect(luaV_concat(L, c-b+1, c); luaC_checkGC(L));\r\n        setobjs2s(L, RA(i), base+b);\r\n        continue;\r\n      }\r\n      case OP_JMP: {\r\n        dojump(L, pc, GETARG_sBx(i));\r\n        continue;\r\n      }\r\n      case OP_EQ: {\r\n        TValue *rb = RKB(i);\r\n        TValue *rc = RKC(i);\r\n        Protect(\r\n          if (equalobj(L, rb, rc) == GETARG_A(i))\r\n            dojump(L, pc, GETARG_sBx(*pc));\r\n        )\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_LT: {\r\n        Protect(\r\n          if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))\r\n            dojump(L, pc, GETARG_sBx(*pc));\r\n        )\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_LE: {\r\n        Protect(\r\n          if (lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))\r\n            dojump(L, pc, GETARG_sBx(*pc));\r\n        )\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_TEST: {\r\n        if (l_isfalse(ra) != GETARG_C(i))\r\n          dojump(L, pc, GETARG_sBx(*pc));\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_TESTSET: {\r\n        TValue *rb = RB(i);\r\n        if (l_isfalse(rb) != GETARG_C(i)) {\r\n          setobjs2s(L, ra, rb);\r\n          dojump(L, pc, GETARG_sBx(*pc));\r\n        }\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_CALL: {\r\n        int b = GETARG_B(i);\r\n        int nresults = GETARG_C(i) - 1;\r\n        if (b != 0) L->top = ra+b;  /* else previous instruction set top */\r\n        L->savedpc = pc;\r\n        switch (luaD_precall(L, ra, nresults)) {\r\n          case PCRLUA: {\r\n            nexeccalls++;\r\n            goto reentry;  /* restart luaV_execute over new Lua function */\r\n          }\r\n          case PCRC: {\r\n            /* it was a C function (`precall' called it); adjust results */\r\n            if (nresults >= 0) L->top = L->ci->top;\r\n            base = L->base;\r\n            continue;\r\n          }\r\n          default: {\r\n            return;  /* yield */\r\n          }\r\n        }\r\n      }\r\n      case OP_TAILCALL: {\r\n        int b = GETARG_B(i);\r\n        if (b != 0) L->top = ra+b;  /* else previous instruction set top */\r\n        L->savedpc = pc;\r\n        lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);\r\n        switch (luaD_precall(L, ra, LUA_MULTRET)) {\r\n          case PCRLUA: {\r\n            /* tail call: put new frame in place of previous one */\r\n            CallInfo *ci = L->ci - 1;  /* previous frame */\r\n            int aux;\r\n            StkId func = ci->func;\r\n            StkId pfunc = (ci+1)->func;  /* previous function index */\r\n            if (L->openupval) luaF_close(L, ci->base);\r\n            L->base = ci->base = ci->func + ((ci+1)->base - pfunc);\r\n            for (aux = 0; pfunc+aux < L->top; aux++)  /* move frame down */\r\n              setobjs2s(L, func+aux, pfunc+aux);\r\n            ci->top = L->top = func+aux;  /* correct top */\r\n            lua_assert(L->top == L->base + clvalue(func)->l.p->maxstacksize);\r\n            ci->savedpc = L->savedpc;\r\n            ci->tailcalls++;  /* one more call lost */\r\n            L->ci--;  /* remove new frame */\r\n            goto reentry;\r\n          }\r\n          case PCRC: {  /* it was a C function (`precall' called it) */\r\n            base = L->base;\r\n            continue;\r\n          }\r\n          default: {\r\n            return;  /* yield */\r\n          }\r\n        }\r\n      }\r\n      case OP_RETURN: {\r\n        int b = GETARG_B(i);\r\n        if (b != 0) L->top = ra+b-1;\r\n        if (L->openupval) luaF_close(L, base);\r\n        L->savedpc = pc;\r\n        b = luaD_poscall(L, ra);\r\n        if (--nexeccalls == 0)  /* was previous function running `here'? */\r\n          return;  /* no: return */\r\n        else {  /* yes: continue its execution */\r\n          if (b) L->top = L->ci->top;\r\n          lua_assert(isLua(L->ci));\r\n          lua_assert(GET_OPCODE(*((L->ci)->savedpc - 1)) == OP_CALL);\r\n          goto reentry;\r\n        }\r\n      }\r\n      case OP_FORLOOP: {\r\n        lua_Number step = nvalue(ra+2);\r\n        lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */\r\n        lua_Number limit = nvalue(ra+1);\r\n        if (luai_numlt(0, step) ? luai_numle(idx, limit)\r\n                                : luai_numle(limit, idx)) {\r\n          dojump(L, pc, GETARG_sBx(i));  /* jump back */\r\n          setnvalue(ra, idx);  /* update internal index... */\r\n          setnvalue(ra+3, idx);  /* ...and external index */\r\n        }\r\n        continue;\r\n      }\r\n      case OP_FORPREP: {\r\n        const TValue *init = ra;\r\n        const TValue *plimit = ra+1;\r\n        const TValue *pstep = ra+2;\r\n        L->savedpc = pc;  /* next steps may throw errors */\r\n        if (!tonumber(init, ra))\r\n          luaG_runerror(L, LUA_QL(\"for\") \" initial value must be a number\");\r\n        else if (!tonumber(plimit, ra+1))\r\n          luaG_runerror(L, LUA_QL(\"for\") \" limit must be a number\");\r\n        else if (!tonumber(pstep, ra+2))\r\n          luaG_runerror(L, LUA_QL(\"for\") \" step must be a number\");\r\n        setnvalue(ra, luai_numsub(nvalue(ra), nvalue(pstep)));\r\n        dojump(L, pc, GETARG_sBx(i));\r\n        continue;\r\n      }\r\n      case OP_TFORLOOP: {\r\n        StkId cb = ra + 3;  /* call base */\r\n        setobjs2s(L, cb+2, ra+2);\r\n        setobjs2s(L, cb+1, ra+1);\r\n        setobjs2s(L, cb, ra);\r\n        L->top = cb+3;  /* func. + 2 args (state and index) */\r\n        Protect(luaD_call(L, cb, GETARG_C(i)));\r\n        L->top = L->ci->top;\r\n        cb = RA(i) + 3;  /* previous call may change the stack */\r\n        if (!ttisnil(cb)) {  /* continue loop? */\r\n          setobjs2s(L, cb-1, cb);  /* save control variable */\r\n          dojump(L, pc, GETARG_sBx(*pc));  /* jump back */\r\n        }\r\n        pc++;\r\n        continue;\r\n      }\r\n      case OP_SETLIST: {\r\n        int n = GETARG_B(i);\r\n        int c = GETARG_C(i);\r\n        int last;\r\n        Table *h;\r\n        if (n == 0) {\r\n          n = cast_int(L->top - ra) - 1;\r\n          L->top = L->ci->top;\r\n        }\r\n        if (c == 0) c = cast_int(*pc++);\r\n        runtime_check(L, ttistable(ra));\r\n        h = hvalue(ra);\r\n        last = ((c-1)*LFIELDS_PER_FLUSH) + n;\r\n        if (last > h->sizearray)  /* needs more space? */\r\n          luaH_resizearray(L, h, last);  /* pre-alloc it at once */\r\n        for (; n > 0; n--) {\r\n          TValue *val = ra+n;\r\n          setobj2t(L, luaH_setnum(L, h, last--), val);\r\n          luaC_barriert(L, h, val);\r\n        }\r\n        continue;\r\n      }\r\n      case OP_CLOSE: {\r\n        luaF_close(L, ra);\r\n        continue;\r\n      }\r\n      case OP_CLOSURE: {\r\n        Proto *p;\r\n        Closure *ncl;\r\n        int nup, j;\r\n        p = cl->p->p[GETARG_Bx(i)];\r\n        nup = p->nups;\r\n        ncl = luaF_newLclosure(L, nup, cl->env);\r\n        ncl->l.p = p;\r\n        for (j=0; j<nup; j++, pc++) {\r\n          if (GET_OPCODE(*pc) == OP_GETUPVAL)\r\n            ncl->l.upvals[j] = cl->upvals[GETARG_B(*pc)];\r\n          else {\r\n            lua_assert(GET_OPCODE(*pc) == OP_MOVE);\r\n            ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc));\r\n          }\r\n        }\r\n        setclvalue(L, ra, ncl);\r\n        Protect(luaC_checkGC(L));\r\n        continue;\r\n      }\r\n      case OP_VARARG: {\r\n        int b = GETARG_B(i) - 1;\r\n        int j;\r\n        CallInfo *ci = L->ci;\r\n        int n = cast_int(ci->base - ci->func) - cl->p->numparams - 1;\r\n        if (b == LUA_MULTRET) {\r\n          Protect(luaD_checkstack(L, n));\r\n          ra = RA(i);  /* previous call may change the stack */\r\n          b = n;\r\n          L->top = ra + n;\r\n        }\r\n        for (j = 0; j < b; j++) {\r\n          if (j < n) {\r\n            setobjs2s(L, ra + j, ci->base - n + j);\r\n          }\r\n          else {\r\n            setnilvalue(ra + j);\r\n          }\r\n        }\r\n        continue;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lvm.h",
    "content": "/*\r\n** $Id: lvm.h,v 2.5.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Lua virtual machine\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef lvm_h\r\n#define lvm_h\r\n\r\n\r\n#include \"ldo.h\"\r\n#include \"lobject.h\"\r\n#include \"ltm.h\"\r\n\r\n\r\n#define tostring(L,o) ((ttype(o) == LUA_TSTRING) || (luaV_tostring(L, o)))\r\n\r\n#define tonumber(o,n)\t(ttype(o) == LUA_TNUMBER || \\\r\n                         (((o) = luaV_tonumber(o,n)) != NULL))\r\n\r\n#define equalobj(L,o1,o2) \\\r\n\t(ttype(o1) == ttype(o2) && luaV_equalval(L, o1, o2))\r\n\r\n\r\nLUAI_FUNC int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r);\r\nLUAI_FUNC int luaV_equalval (lua_State *L, const TValue *t1, const TValue *t2);\r\nLUAI_FUNC const TValue *luaV_tonumber (const TValue *obj, TValue *n);\r\nLUAI_FUNC int luaV_tostring (lua_State *L, StkId obj);\r\nLUAI_FUNC void luaV_gettable (lua_State *L, const TValue *t, TValue *key,\r\n                                            StkId val);\r\nLUAI_FUNC void luaV_settable (lua_State *L, const TValue *t, TValue *key,\r\n                                            StkId val);\r\nLUAI_FUNC void luaV_execute (lua_State *L, int nexeccalls);\r\nLUAI_FUNC void luaV_concat (lua_State *L, int total, int last);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lzio.c",
    "content": "/*\r\n** $Id: lzio.c,v 1.31.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** a generic input stream interface\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#include <string.h>\r\n\r\n#define lzio_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"llimits.h\"\r\n#include \"lmem.h\"\r\n#include \"lstate.h\"\r\n#include \"lzio.h\"\r\n\r\n\r\nint luaZ_fill (ZIO *z) {\r\n  size_t size;\r\n  lua_State *L = z->L;\r\n  const char *buff;\r\n  lua_unlock(L);\r\n  buff = z->reader(L, z->data, &size);\r\n  lua_lock(L);\r\n  if (buff == NULL || size == 0) return EOZ;\r\n  z->n = size - 1;\r\n  z->p = buff;\r\n  return char2int(*(z->p++));\r\n}\r\n\r\n\r\nint luaZ_lookahead (ZIO *z) {\r\n  if (z->n == 0) {\r\n    if (luaZ_fill(z) == EOZ)\r\n      return EOZ;\r\n    else {\r\n      z->n++;  /* luaZ_fill removed first byte; put back it */\r\n      z->p--;\r\n    }\r\n  }\r\n  return char2int(*z->p);\r\n}\r\n\r\n\r\nvoid luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) {\r\n  z->L = L;\r\n  z->reader = reader;\r\n  z->data = data;\r\n  z->n = 0;\r\n  z->p = NULL;\r\n}\r\n\r\n\r\n/* --------------------------------------------------------------- read --- */\r\nsize_t luaZ_read (ZIO *z, void *b, size_t n) {\r\n  while (n) {\r\n    size_t m;\r\n    if (luaZ_lookahead(z) == EOZ)\r\n      return n;  /* return number of missing bytes */\r\n    m = (n <= z->n) ? n : z->n;  /* min. between n and z->n */\r\n    memcpy(b, z->p, m);\r\n    z->n -= m;\r\n    z->p += m;\r\n    b = (char *)b + m;\r\n    n -= m;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\nchar *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n) {\r\n  if (n > buff->buffsize) {\r\n    if (n < LUA_MINBUFFER) n = LUA_MINBUFFER;\r\n    luaZ_resizebuffer(L, buff, n);\r\n  }\r\n  return buff->buffer;\r\n}\r\n\r\n\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/lzio.h",
    "content": "/*\r\n** $Id: lzio.h,v 1.21.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Buffered streams\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lzio_h\r\n#define lzio_h\r\n\r\n#include \"lua.h\"\r\n\r\n#include \"lmem.h\"\r\n\r\n\r\n#define EOZ\t(-1)\t\t\t/* end of stream */\r\n\r\ntypedef struct Zio ZIO;\r\n\r\n#define char2int(c)\tcast(int, cast(unsigned char, (c)))\r\n\r\n#define zgetc(z)  (((z)->n--)>0 ?  char2int(*(z)->p++) : luaZ_fill(z))\r\n\r\ntypedef struct Mbuffer {\r\n  char *buffer;\r\n  size_t n;\r\n  size_t buffsize;\r\n} Mbuffer;\r\n\r\n#define luaZ_initbuffer(L, buff) ((buff)->buffer = NULL, (buff)->buffsize = 0)\r\n\r\n#define luaZ_buffer(buff)\t((buff)->buffer)\r\n#define luaZ_sizebuffer(buff)\t((buff)->buffsize)\r\n#define luaZ_bufflen(buff)\t((buff)->n)\r\n\r\n#define luaZ_resetbuffer(buff) ((buff)->n = 0)\r\n\r\n\r\n#define luaZ_resizebuffer(L, buff, size) \\\r\n\t(luaM_reallocvector(L, (buff)->buffer, (buff)->buffsize, size, char), \\\r\n\t(buff)->buffsize = size)\r\n\r\n#define luaZ_freebuffer(L, buff)\tluaZ_resizebuffer(L, buff, 0)\r\n\r\n\r\nLUAI_FUNC char *luaZ_openspace (lua_State *L, Mbuffer *buff, size_t n);\r\nLUAI_FUNC void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader,\r\n                                        void *data);\r\nLUAI_FUNC size_t luaZ_read (ZIO* z, void* b, size_t n);\t/* read next n bytes */\r\nLUAI_FUNC int luaZ_lookahead (ZIO *z);\r\n\r\n\r\n\r\n/* --------- Private Part ------------------ */\r\n\r\nstruct Zio {\r\n  size_t n;\t\t\t/* bytes still unread */\r\n  const char *p;\t\t/* current position in buffer */\r\n  lua_Reader reader;\r\n  void* data;\t\t\t/* additional data */\r\n  lua_State *L;\t\t\t/* Lua state (for reader) */\r\n};\r\n\r\n\r\nLUAI_FUNC int luaZ_fill (ZIO *z);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/lua-5.1.5/src/print.c",
    "content": "/*\r\n** $Id: print.c,v 1.55a 2006/05/31 13:30:05 lhf Exp $\r\n** print bytecodes\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <ctype.h>\r\n#include <stdio.h>\r\n\r\n#define luac_c\r\n#define LUA_CORE\r\n\r\n#include \"ldebug.h\"\r\n#include \"lobject.h\"\r\n#include \"lopcodes.h\"\r\n#include \"lundump.h\"\r\n\r\n#define PrintFunction\tluaU_print\r\n\r\n#define Sizeof(x)\t((int)sizeof(x))\r\n#define VOID(p)\t\t((const void*)(p))\r\n\r\nstatic void PrintString(const TString* ts)\r\n{\r\n const char* s=getstr(ts);\r\n size_t i,n=ts->tsv.len;\r\n putchar('\"');\r\n for (i=0; i<n; i++)\r\n {\r\n  int c=s[i];\r\n  switch (c)\r\n  {\r\n   case '\"': printf(\"\\\\\\\"\"); break;\r\n   case '\\\\': printf(\"\\\\\\\\\"); break;\r\n   case '\\a': printf(\"\\\\a\"); break;\r\n   case '\\b': printf(\"\\\\b\"); break;\r\n   case '\\f': printf(\"\\\\f\"); break;\r\n   case '\\n': printf(\"\\\\n\"); break;\r\n   case '\\r': printf(\"\\\\r\"); break;\r\n   case '\\t': printf(\"\\\\t\"); break;\r\n   case '\\v': printf(\"\\\\v\"); break;\r\n   default:\tif (isprint((unsigned char)c))\r\n   \t\t\tputchar(c);\r\n\t\telse\r\n\t\t\tprintf(\"\\\\%03u\",(unsigned char)c);\r\n  }\r\n }\r\n putchar('\"');\r\n}\r\n\r\nstatic void PrintConstant(const Proto* f, int i)\r\n{\r\n const TValue* o=&f->k[i];\r\n switch (ttype(o))\r\n {\r\n  case LUA_TNIL:\r\n\tprintf(\"nil\");\r\n\tbreak;\r\n  case LUA_TBOOLEAN:\r\n\tprintf(bvalue(o) ? \"true\" : \"false\");\r\n\tbreak;\r\n  case LUA_TNUMBER:\r\n\tprintf(LUA_NUMBER_FMT,nvalue(o));\r\n\tbreak;\r\n  case LUA_TSTRING:\r\n\tPrintString(rawtsvalue(o));\r\n\tbreak;\r\n  default:\t\t\t\t/* cannot happen */\r\n\tprintf(\"? type=%d\",ttype(o));\r\n\tbreak;\r\n }\r\n}\r\n\r\nstatic void PrintCode(const Proto* f)\r\n{\r\n const Instruction* code=f->code;\r\n int pc,n=f->sizecode;\r\n for (pc=0; pc<n; pc++)\r\n {\r\n  Instruction i=code[pc];\r\n  OpCode o=GET_OPCODE(i);\r\n  int a=GETARG_A(i);\r\n  int b=GETARG_B(i);\r\n  int c=GETARG_C(i);\r\n  int bx=GETARG_Bx(i);\r\n  int sbx=GETARG_sBx(i);\r\n  int line=getline(f,pc);\r\n  printf(\"\\t%d\\t\",pc+1);\r\n  if (line>0) printf(\"[%d]\\t\",line); else printf(\"[-]\\t\");\r\n  printf(\"%-9s\\t\",luaP_opnames[o]);\r\n  switch (getOpMode(o))\r\n  {\r\n   case iABC:\r\n    printf(\"%d\",a);\r\n    if (getBMode(o)!=OpArgN) printf(\" %d\",ISK(b) ? (-1-INDEXK(b)) : b);\r\n    if (getCMode(o)!=OpArgN) printf(\" %d\",ISK(c) ? (-1-INDEXK(c)) : c);\r\n    break;\r\n   case iABx:\r\n    if (getBMode(o)==OpArgK) printf(\"%d %d\",a,-1-bx); else printf(\"%d %d\",a,bx);\r\n    break;\r\n   case iAsBx:\r\n    if (o==OP_JMP) printf(\"%d\",sbx); else printf(\"%d %d\",a,sbx);\r\n    break;\r\n  }\r\n  switch (o)\r\n  {\r\n   case OP_LOADK:\r\n    printf(\"\\t; \"); PrintConstant(f,bx);\r\n    break;\r\n   case OP_GETUPVAL:\r\n   case OP_SETUPVAL:\r\n    printf(\"\\t; %s\", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : \"-\");\r\n    break;\r\n   case OP_GETGLOBAL:\r\n   case OP_SETGLOBAL:\r\n    printf(\"\\t; %s\",svalue(&f->k[bx]));\r\n    break;\r\n   case OP_GETTABLE:\r\n   case OP_SELF:\r\n    if (ISK(c)) { printf(\"\\t; \"); PrintConstant(f,INDEXK(c)); }\r\n    break;\r\n   case OP_SETTABLE:\r\n   case OP_ADD:\r\n   case OP_SUB:\r\n   case OP_MUL:\r\n   case OP_DIV:\r\n   case OP_POW:\r\n   case OP_EQ:\r\n   case OP_LT:\r\n   case OP_LE:\r\n    if (ISK(b) || ISK(c))\r\n    {\r\n     printf(\"\\t; \");\r\n     if (ISK(b)) PrintConstant(f,INDEXK(b)); else printf(\"-\");\r\n     printf(\" \");\r\n     if (ISK(c)) PrintConstant(f,INDEXK(c)); else printf(\"-\");\r\n    }\r\n    break;\r\n   case OP_JMP:\r\n   case OP_FORLOOP:\r\n   case OP_FORPREP:\r\n    printf(\"\\t; to %d\",sbx+pc+2);\r\n    break;\r\n   case OP_CLOSURE:\r\n    printf(\"\\t; %p\",VOID(f->p[bx]));\r\n    break;\r\n   case OP_SETLIST:\r\n    if (c==0) printf(\"\\t; %d\",(int)code[++pc]);\r\n    else printf(\"\\t; %d\",c);\r\n    break;\r\n   default:\r\n    break;\r\n  }\r\n  printf(\"\\n\");\r\n }\r\n}\r\n\r\n#define SS(x)\t(x==1)?\"\":\"s\"\r\n#define S(x)\tx,SS(x)\r\n\r\nstatic void PrintHeader(const Proto* f)\r\n{\r\n const char* s=getstr(f->source);\r\n if (*s=='@' || *s=='=')\r\n  s++;\r\n else if (*s==LUA_SIGNATURE[0])\r\n  s=\"(bstring)\";\r\n else\r\n  s=\"(string)\";\r\n printf(\"\\n%s <%s:%d,%d> (%d instruction%s, %d bytes at %p)\\n\",\r\n \t(f->linedefined==0)?\"main\":\"function\",s,\r\n\tf->linedefined,f->lastlinedefined,\r\n\tS(f->sizecode),f->sizecode*Sizeof(Instruction),VOID(f));\r\n printf(\"%d%s param%s, %d slot%s, %d upvalue%s, \",\r\n\tf->numparams,f->is_vararg?\"+\":\"\",SS(f->numparams),\r\n\tS(f->maxstacksize),S(f->nups));\r\n printf(\"%d local%s, %d constant%s, %d function%s\\n\",\r\n\tS(f->sizelocvars),S(f->sizek),S(f->sizep));\r\n}\r\n\r\nstatic void PrintConstants(const Proto* f)\r\n{\r\n int i,n=f->sizek;\r\n printf(\"constants (%d) for %p:\\n\",n,VOID(f));\r\n for (i=0; i<n; i++)\r\n {\r\n  printf(\"\\t%d\\t\",i+1);\r\n  PrintConstant(f,i);\r\n  printf(\"\\n\");\r\n }\r\n}\r\n\r\nstatic void PrintLocals(const Proto* f)\r\n{\r\n int i,n=f->sizelocvars;\r\n printf(\"locals (%d) for %p:\\n\",n,VOID(f));\r\n for (i=0; i<n; i++)\r\n {\r\n  printf(\"\\t%d\\t%s\\t%d\\t%d\\n\",\r\n  i,getstr(f->locvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1);\r\n }\r\n}\r\n\r\nstatic void PrintUpvalues(const Proto* f)\r\n{\r\n int i,n=f->sizeupvalues;\r\n printf(\"upvalues (%d) for %p:\\n\",n,VOID(f));\r\n if (f->upvalues==NULL) return;\r\n for (i=0; i<n; i++)\r\n {\r\n  printf(\"\\t%d\\t%s\\n\",i,getstr(f->upvalues[i]));\r\n }\r\n}\r\n\r\nvoid PrintFunction(const Proto* f, int full)\r\n{\r\n int i,n=f->sizep;\r\n PrintHeader(f);\r\n PrintCode(f);\r\n if (full)\r\n {\r\n  PrintConstants(f);\r\n  PrintLocals(f);\r\n  PrintUpvalues(f);\r\n }\r\n for (i=0; i<n; i++) PrintFunction(f->p[i],full);\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/COPYRIGHT",
    "content": "===============================================================================\r\nLuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/\r\n\r\nCopyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n\r\n[ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n\r\n===============================================================================\r\n[ LuaJIT includes code from Lua 5.1/5.2, which has this license statement: ]\r\n\r\nCopyright (C) 1994-2012 Lua.org, PUC-Rio.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n\r\n===============================================================================\r\n[ LuaJIT includes code from dlmalloc, which has this license statement: ]\r\n\r\nThis is a version (aka dlmalloc) of malloc/free/realloc written by\r\nDoug Lea and released to the public domain, as explained at\r\nhttp://creativecommons.org/licenses/publicdomain\r\n\r\n===============================================================================\r\n"
  },
  {
    "path": "build/luajit-2.0.4/Makefile",
    "content": "##############################################################################\r\n# LuaJIT top level Makefile for installation. Requires GNU Make.\r\n#\r\n# Please read doc/install.html before changing any variables!\r\n#\r\n# Suitable for POSIX platforms (Linux, *BSD, OSX etc.).\r\n# Note: src/Makefile has many more configurable options.\r\n#\r\n# ##### This Makefile is NOT useful for Windows! #####\r\n# For MSVC, please follow the instructions given in src/msvcbuild.bat.\r\n# For MinGW and Cygwin, cd to src and run make with the Makefile there.\r\n#\r\n# Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n##############################################################################\r\n\r\nMAJVER=  2\r\nMINVER=  0\r\nRELVER=  4\r\nVERSION= $(MAJVER).$(MINVER).$(RELVER)\r\nABIVER=  5.1\r\n\r\n##############################################################################\r\n#\r\n# Change the installation path as needed. This automatically adjusts\r\n# the paths in src/luaconf.h, too. Note: PREFIX must be an absolute path!\r\n#\r\nexport PREFIX= /usr/local\r\nexport MULTILIB= lib\r\n##############################################################################\r\n\r\nDPREFIX= $(DESTDIR)$(PREFIX)\r\nINSTALL_BIN=   $(DPREFIX)/bin\r\nINSTALL_LIB=   $(DPREFIX)/$(MULTILIB)\r\nINSTALL_SHARE= $(DPREFIX)/share\r\nINSTALL_INC=   $(DPREFIX)/include/luajit-$(MAJVER).$(MINVER)\r\n\r\nINSTALL_LJLIBD= $(INSTALL_SHARE)/luajit-$(VERSION)\r\nINSTALL_JITLIB= $(INSTALL_LJLIBD)/jit\r\nINSTALL_LMODD= $(INSTALL_SHARE)/lua\r\nINSTALL_LMOD= $(INSTALL_LMODD)/$(ABIVER)\r\nINSTALL_CMODD= $(INSTALL_LIB)/lua\r\nINSTALL_CMOD= $(INSTALL_CMODD)/$(ABIVER)\r\nINSTALL_MAN= $(INSTALL_SHARE)/man/man1\r\nINSTALL_PKGCONFIG= $(INSTALL_LIB)/pkgconfig\r\n\r\nINSTALL_TNAME= luajit-$(VERSION)\r\nINSTALL_TSYMNAME= luajit\r\nINSTALL_ANAME= libluajit-$(ABIVER).a\r\nINSTALL_SONAME= libluajit-$(ABIVER).so.$(MAJVER).$(MINVER).$(RELVER)\r\nINSTALL_SOSHORT= libluajit-$(ABIVER).so\r\nINSTALL_DYLIBNAME= libluajit-$(ABIVER).$(MAJVER).$(MINVER).$(RELVER).dylib\r\nINSTALL_DYLIBSHORT1= libluajit-$(ABIVER).dylib\r\nINSTALL_DYLIBSHORT2= libluajit-$(ABIVER).$(MAJVER).dylib\r\nINSTALL_PCNAME= luajit.pc\r\n\r\nINSTALL_STATIC= $(INSTALL_LIB)/$(INSTALL_ANAME)\r\nINSTALL_DYN= $(INSTALL_LIB)/$(INSTALL_SONAME)\r\nINSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_SOSHORT)\r\nINSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_SOSHORT)\r\nINSTALL_T= $(INSTALL_BIN)/$(INSTALL_TNAME)\r\nINSTALL_TSYM= $(INSTALL_BIN)/$(INSTALL_TSYMNAME)\r\nINSTALL_PC= $(INSTALL_PKGCONFIG)/$(INSTALL_PCNAME)\r\n\r\nINSTALL_DIRS= $(INSTALL_BIN) $(INSTALL_LIB) $(INSTALL_INC) $(INSTALL_MAN) \\\r\n  $(INSTALL_PKGCONFIG) $(INSTALL_JITLIB) $(INSTALL_LMOD) $(INSTALL_CMOD)\r\nUNINSTALL_DIRS= $(INSTALL_JITLIB) $(INSTALL_LJLIBD) $(INSTALL_INC) \\\r\n  $(INSTALL_LMOD) $(INSTALL_LMODD) $(INSTALL_CMOD) $(INSTALL_CMODD)\r\n\r\nRM= rm -f\r\nMKDIR= mkdir -p\r\nRMDIR= rmdir 2>/dev/null\r\nSYMLINK= ln -sf\r\nINSTALL_X= install -m 0755\r\nINSTALL_F= install -m 0644\r\nUNINSTALL= $(RM)\r\nLDCONFIG= ldconfig -n\r\nSED_PC= sed -e \"s|^prefix=.*|prefix=$(PREFIX)|\" \\\r\n            -e \"s|^multilib=.*|multilib=$(MULTILIB)|\"\r\n\r\nFILE_T= luajit\r\nFILE_A= libluajit.a\r\nFILE_SO= libluajit.so\r\nFILE_MAN= luajit.1\r\nFILE_PC= luajit.pc\r\nFILES_INC= lua.h lualib.h lauxlib.h luaconf.h lua.hpp luajit.h\r\nFILES_JITLIB= bc.lua v.lua dump.lua dis_x86.lua dis_x64.lua dis_arm.lua \\\r\n\t      dis_ppc.lua dis_mips.lua dis_mipsel.lua bcsave.lua vmdef.lua\r\n\r\nifeq (,$(findstring Windows,$(OS)))\r\n  ifeq (Darwin,$(shell uname -s))\r\n    INSTALL_SONAME= $(INSTALL_DYLIBNAME)\r\n    INSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT1)\r\n    INSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT2)\r\n    LDCONFIG= :\r\n  endif\r\nendif\r\n\r\n##############################################################################\r\n\r\nINSTALL_DEP= src/luajit\r\n\r\ndefault all $(INSTALL_DEP):\r\n\t@echo \"==== Building LuaJIT $(VERSION) ====\"\r\n\t$(MAKE) -C src\r\n\t@echo \"==== Successfully built LuaJIT $(VERSION) ====\"\r\n\r\ninstall: $(INSTALL_DEP)\r\n\t@echo \"==== Installing LuaJIT $(VERSION) to $(PREFIX) ====\"\r\n\t$(MKDIR) $(INSTALL_DIRS)\r\n\tcd src && $(INSTALL_X) $(FILE_T) $(INSTALL_T)\r\n\tcd src && test -f $(FILE_A) && $(INSTALL_F) $(FILE_A) $(INSTALL_STATIC) || :\r\n\t$(RM) $(INSTALL_TSYM) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2)\r\n\tcd src && test -f $(FILE_SO) && \\\r\n\t  $(INSTALL_X) $(FILE_SO) $(INSTALL_DYN) && \\\r\n\t  $(LDCONFIG) $(INSTALL_LIB) && \\\r\n\t  $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT1) && \\\r\n\t  $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT2) || :\r\n\tcd etc && $(INSTALL_F) $(FILE_MAN) $(INSTALL_MAN)\r\n\tcd etc && $(SED_PC) $(FILE_PC) > $(FILE_PC).tmp && \\\r\n\t  $(INSTALL_F) $(FILE_PC).tmp $(INSTALL_PC) && \\\r\n\t  $(RM) $(FILE_PC).tmp\r\n\tcd src && $(INSTALL_F) $(FILES_INC) $(INSTALL_INC)\r\n\tcd src/jit && $(INSTALL_F) $(FILES_JITLIB) $(INSTALL_JITLIB)\r\n\t$(SYMLINK) $(INSTALL_TNAME) $(INSTALL_TSYM)\r\n\t@echo \"==== Successfully installed LuaJIT $(VERSION) to $(PREFIX) ====\"\r\n\r\nuninstall:\r\n\t@echo \"==== Uninstalling LuaJIT $(VERSION) from $(PREFIX) ====\"\r\n\t$(UNINSTALL) $(INSTALL_TSYM) $(INSTALL_T) $(INSTALL_STATIC) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2) $(INSTALL_MAN)/$(FILE_MAN) $(INSTALL_PC)\r\n\tfor file in $(FILES_JITLIB); do \\\r\n\t  $(UNINSTALL) $(INSTALL_JITLIB)/$$file; \\\r\n\t  done\r\n\tfor file in $(FILES_INC); do \\\r\n\t  $(UNINSTALL) $(INSTALL_INC)/$$file; \\\r\n\t  done\r\n\t$(LDCONFIG) $(INSTALL_LIB)\r\n\t$(RMDIR) $(UNINSTALL_DIRS) || :\r\n\t@echo \"==== Successfully uninstalled LuaJIT $(VERSION) from $(PREFIX) ====\"\r\n\r\n##############################################################################\r\n\r\namalg:\r\n\t@echo \"Building LuaJIT $(VERSION)\"\r\n\t$(MAKE) -C src amalg\r\n\r\nclean:\r\n\t$(MAKE) -C src clean\r\n\r\n.PHONY: all install amalg clean\r\n\r\n##############################################################################\r\n"
  },
  {
    "path": "build/luajit-2.0.4/README",
    "content": "README for LuaJIT 2.0.4\r\n-----------------------\r\n\r\nLuaJIT is a Just-In-Time (JIT) compiler for the Lua programming language.\r\n\r\nProject Homepage: http://luajit.org/\r\n\r\nLuaJIT is Copyright (C) 2005-2015 Mike Pall.\r\nLuaJIT is free software, released under the MIT license.\r\nSee full Copyright Notice in the COPYRIGHT file or in luajit.h.\r\n\r\nDocumentation for LuaJIT is available in HTML format.\r\nPlease point your favorite browser to:\r\n\r\n doc/luajit.html\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/bluequad-print.css",
    "content": "/* Copyright (C) 2004-2015 Mike Pall.\r\n *\r\n * You are welcome to use the general ideas of this design for your own sites.\r\n * But please do not steal the stylesheet, the layout or the color scheme.\r\n */\r\nbody {\r\n  font-family: serif;\r\n  font-size: 11pt;\r\n  margin: 0 3em;\r\n  padding: 0;\r\n  border: none;\r\n}\r\na:link, a:visited, a:hover, a:active {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #0000ff;\r\n}\r\nh1, h2, h3 {\r\n  font-family: sans-serif;\r\n  font-weight: bold;\r\n  text-align: left;\r\n  margin: 0.5em 0;\r\n  padding: 0;\r\n}\r\nh1 {\r\n  font-size: 200%;\r\n}\r\nh2 {\r\n  font-size: 150%;\r\n}\r\nh3 {\r\n  font-size: 125%;\r\n}\r\np {\r\n  margin: 0 0 0.5em 0;\r\n  padding: 0;\r\n}\r\nul, ol {\r\n  margin: 0.5em 0;\r\n  padding: 0 0 0 2em;\r\n}\r\nul {\r\n  list-style: outside square;\r\n}\r\nol {\r\n  list-style: outside decimal;\r\n}\r\nli {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndl {\r\n  margin: 1em 0;\r\n  padding: 1em;\r\n  border: 1px solid black;\r\n}\r\ndt {\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndt sup {\r\n  float: right;\r\n  margin-left: 1em;\r\n}\r\ndd {\r\n  margin: 0.5em 0 0 2em;\r\n  padding: 0;\r\n}\r\ntable {\r\n  table-layout: fixed;\r\n  width: 100%;\r\n  margin: 1em 0;\r\n  padding: 0;\r\n  border: 1px solid black;\r\n  border-spacing: 0;\r\n  border-collapse: collapse;\r\n}\r\ntr {\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n}\r\ntd {\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 0.2em 0.5em;\r\n  border-top: 1px solid black;\r\n  border-bottom: 1px solid black;\r\n}\r\ntr.separate td {\r\n  border-top: double;\r\n}\r\ntt, pre, code, kbd, samp {\r\n  font-family: monospace;\r\n  font-size: 75%;\r\n}\r\nkbd {\r\n  font-weight: bolder;\r\n}\r\nblockquote, pre {\r\n  margin: 1em 2em;\r\n  padding: 0;\r\n}\r\nimg {\r\n  border: none;\r\n  vertical-align: baseline;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\nimg.left {\r\n  float: left;\r\n  margin: 0.5em 1em 0.5em 0;\r\n}\r\nimg.right {\r\n  float: right;\r\n  margin: 0.5em 0 0.5em 1em;\r\n}\r\n.flush {\r\n  clear: both;\r\n  visibility: hidden;\r\n}\r\n.hide, .noprint, #nav {\r\n  display: none !important;\r\n}\r\n.pagebreak {\r\n  page-break-before: always;\r\n}\r\n#site {\r\n  text-align: right;\r\n  font-family: sans-serif;\r\n  font-weight: bold;\r\n  margin: 0 1em;\r\n  border-bottom: 1pt solid black;\r\n}\r\n#site a {\r\n  font-size: 1.2em;\r\n}\r\n#site a:link, #site a:visited {\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#logo {\r\n  color: #ff8000;\r\n}\r\n#head {\r\n  clear: both;\r\n  margin: 0 1em;\r\n}\r\n#main {\r\n  line-height: 1.3;\r\n  text-align: justify;\r\n  margin: 1em;\r\n}\r\n#foot {\r\n  clear: both;\r\n  font-size: 80%;\r\n  text-align: center;\r\n  margin: 0 1.25em;\r\n  padding: 0.5em 0 0 0;\r\n  border-top: 1pt solid black;\r\n  page-break-before: avoid;\r\n  page-break-after: avoid;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/bluequad.css",
    "content": "/* Copyright (C) 2004-2015 Mike Pall.\r\n *\r\n * You are welcome to use the general ideas of this design for your own sites.\r\n * But please do not steal the stylesheet, the layout or the color scheme.\r\n */\r\n/* colorscheme:\r\n *\r\n * site  |  head   #4162bf/white   | #6078bf/#e6ecff\r\n * ------+------   ----------------+-------------------\r\n * nav   |  main   #bfcfff         | #e6ecff/black\r\n *\r\n * nav:  hiback   loback     #c5d5ff #b9c9f9\r\n *       hiborder loborder   #e6ecff #97a7d7\r\n *       link     hover      #2142bf #ff0000\r\n *\r\n * link: link visited hover  #2142bf #8122bf #ff0000\r\n *\r\n * main: boxback  boxborder  #f0f4ff #bfcfff\r\n */\r\nbody {\r\n  font-family: Verdana, Arial, Helvetica, sans-serif;\r\n  font-size: 10pt;\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n  background: #e0e0e0;\r\n  color: #000000;\r\n}\r\na:link {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #2142bf;\r\n}\r\na:visited {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #8122bf;\r\n}\r\na:hover, a:active {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #ff0000;\r\n}\r\nh1, h2, h3 {\r\n  font-weight: bold;\r\n  text-align: left;\r\n  margin: 0.5em 0;\r\n  padding: 0;\r\n  background: transparent;\r\n}\r\nh1 {\r\n  font-size: 200%;\r\n  line-height: 3em; /* really 6em relative to body, match #site span */\r\n  margin: 0;\r\n}\r\nh2 {\r\n  font-size: 150%;\r\n  color: #606060;\r\n}\r\nh3 {\r\n  font-size: 125%;\r\n  color: #404040;\r\n}\r\np {\r\n  max-width: 600px;\r\n  margin: 0 0 0.5em 0;\r\n  padding: 0;\r\n}\r\nb {\r\n  color: #404040;\r\n}\r\nul, ol {\r\n  max-width: 600px;\r\n  margin: 0.5em 0;\r\n  padding: 0 0 0 2em;\r\n}\r\nul {\r\n  list-style: outside square;\r\n}\r\nol {\r\n  list-style: outside decimal;\r\n}\r\nli {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndl {\r\n  max-width: 600px;\r\n  margin: 1em 0;\r\n  padding: 1em;\r\n  border: 1px solid #bfcfff;\r\n  background: #f0f4ff;\r\n}\r\ndt {\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndt sup {\r\n  float: right;\r\n  margin-left: 1em;\r\n  color: #808080;\r\n}\r\ndt a:visited {\r\n  text-decoration: none;\r\n  color: #2142bf;\r\n}\r\ndt a:hover, dt a:active {\r\n  text-decoration: none;\r\n  color: #ff0000;\r\n}\r\ndd {\r\n  margin: 0.5em 0 0 2em;\r\n  padding: 0;\r\n}\r\ndiv.tablewrap { /* for IE *sigh* */\r\n  max-width: 600px;\r\n}\r\ntable {\r\n  table-layout: fixed;\r\n  border-spacing: 0;\r\n  border-collapse: collapse;\r\n  max-width: 600px;\r\n  width: 100%;\r\n  margin: 1em 0;\r\n  padding: 0;\r\n  border: 1px solid #bfcfff;\r\n}\r\ntr {\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n}\r\ntr.odd {\r\n  background: #f0f4ff;\r\n}\r\ntr.separate td {\r\n  border-top: 1px solid #bfcfff;\r\n}\r\ntd {\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 0.2em 0.5em;\r\n  border: none;\r\n}\r\ntt, code, kbd, samp {\r\n  font-family: Courier New, Courier, monospace;\r\n  line-height: 1.2;\r\n  font-size: 110%;\r\n}\r\nkbd {\r\n  font-weight: bolder;\r\n}\r\nblockquote, pre {\r\n  max-width: 600px;\r\n  margin: 1em 2em;\r\n  padding: 0;\r\n}\r\npre {\r\n  line-height: 1.1;\r\n}\r\npre.code {\r\n  line-height: 1.4;\r\n  margin: 0.5em 0 1em 0.5em;\r\n  padding: 0.5em 1em;\r\n  border: 1px solid #bfcfff;\r\n  background: #f0f4ff;\r\n}\r\npre.mark {\r\n  padding-left: 2em;\r\n}\r\nspan.codemark {\r\n  position:absolute;\r\n  left: 16em;\r\n  color: #4040c0;\r\n}\r\nspan.mark {\r\n  color: #4040c0;\r\n  font-family: Courier New, Courier, monospace;\r\n  line-height: 1.1;\r\n}\r\nimg {\r\n  border: none;\r\n  vertical-align: baseline;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\nimg.left {\r\n  float: left;\r\n  margin: 0.5em 1em 0.5em 0;\r\n}\r\nimg.right {\r\n  float: right;\r\n  margin: 0.5em 0 0.5em 1em;\r\n}\r\n.indent {\r\n  padding-left: 1em;\r\n}\r\n.flush {\r\n  clear: both;\r\n  visibility: hidden;\r\n}\r\n.hide, .noscreen {\r\n  display: none !important;\r\n}\r\n.ext {\r\n  color: #ff8000;\r\n}\r\n.new {\r\n  font-size: 6pt;\r\n  vertical-align: middle;\r\n  background: #ff8000;\r\n  color: #ffffff;\r\n}\r\n#site {\r\n  clear: both;\r\n  float: left;\r\n  width: 13em;\r\n  text-align: center;\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#site a {\r\n  font-size: 200%;\r\n}\r\n#site a:link, #site a:visited {\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#site span {\r\n  line-height: 3em; /* really 6em relative to body, match h1 */\r\n}\r\n#logo {\r\n  color: #ffb380;\r\n}\r\n#head {\r\n  margin: 0;\r\n  padding: 0 0 0 2em;\r\n  border-left: solid 13em #4162bf;\r\n  border-right: solid 3em #6078bf;\r\n  background: #6078bf;\r\n  color: #e6ecff;\r\n}\r\n#nav {\r\n  clear: both;\r\n  float: left;\r\n  overflow: hidden;\r\n  text-align: left;\r\n  line-height: 1.5;\r\n  width: 13em;\r\n  padding-top: 1em;\r\n  background: transparent;\r\n}\r\n#nav ul {\r\n  list-style: none outside;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\n#nav li {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\n#nav a {\r\n  display: block;\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 2px 1em;\r\n  border-top: 1px solid transparent;\r\n  border-bottom: 1px solid transparent;\r\n  background: transparent;\r\n  color: #2142bf;\r\n}\r\n#nav a:hover, #nav a:active {\r\n  text-decoration: none;\r\n  border-top: 1px solid #97a7d7;\r\n  border-bottom: 1px solid #e6ecff;\r\n  background: #b9c9f9;\r\n  color: #ff0000;\r\n}\r\n#nav a.current, #nav a.current:hover, #nav a.current:active {\r\n  border-top: 1px solid #e6ecff;\r\n  border-bottom: 1px solid #97a7d7;\r\n  background: #c5d5ff;\r\n  color: #2142bf;\r\n}\r\n#nav ul ul a {\r\n  padding: 0 1em 0 1.7em;\r\n}\r\n#nav ul ul ul a {\r\n  padding: 0 0.5em 0 2.4em;\r\n}\r\n#main {\r\n  line-height: 1.5;\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 1em 2em;\r\n  border-left: solid 13em #bfcfff;\r\n  border-right: solid 3em #e6ecff;\r\n  background: #e6ecff;\r\n}\r\n#foot {\r\n  clear: both;\r\n  font-size: 80%;\r\n  text-align: center;\r\n  margin: 0;\r\n  padding: 0.5em;\r\n  background: #6078bf;\r\n  color: #ffffff;\r\n}\r\n#foot a:link, #foot a:visited {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#foot a:hover, #foot a:active {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #bfcfff;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/changes.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>LuaJIT Change History</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ndiv.major { max-width: 600px; padding: 1em; margin: 1em 0 1em 0; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>LuaJIT Change History</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis is a list of changes between the released versions of LuaJIT.<br>\r\nThe current <span style=\"color: #0000c0;\">stable version</span> is <strong>LuaJIT&nbsp;2.0.4</strong>.<br>\r\n</p>\r\n<p>\r\nPlease check the\r\n<a href=\"http://luajit.org/changes.html\"><span class=\"ext\">&raquo;</span>&nbsp;Online Change History</a>\r\nto see whether newer versions are available.\r\n</p>\r\n\r\n<div class=\"major\" style=\"background: #d0d0ff;\">\r\n<h2 id=\"LuaJIT-2.0.4\">LuaJIT 2.0.4 &mdash; 2015-05-14</h2>\r\n<ul>\r\n<li>Fix stack check in narrowing optimization.</li>\r\n<li>Fix Lua/C API typecheck error for special indexes.</li>\r\n<li>Fix string to number conversion.</li>\r\n<li>Fix lexer error for chunks without tokens.</li>\r\n<li>Don't compile <tt>IR_RETF</tt> after <tt>CALLT</tt> to ff with-side effects.</li>\r\n<li>Fix <tt>BC_UCLO</tt>/<tt>BC_JMP</tt> join optimization in Lua parser.</li>\r\n<li>Fix corner case in string to number conversion.</li>\r\n<li>Gracefully handle <tt>lua_error()</tt> for a suspended coroutine.</li>\r\n<li>Avoid error messages when building with Clang.</li>\r\n<li>Fix snapshot #0 handling for traces with a stack check on entry.</li>\r\n<li>Fix fused constant loads under high register pressure.</li>\r\n<li>Invalidate backpropagation cache after DCE.</li>\r\n<li>Fix ABC elimination.</li>\r\n<li>Fix debug info for main chunk of stripped bytecode.</li>\r\n<li>Fix FOLD rule for <tt>string.sub(s, ...) == k</tt>.</li>\r\n<li>Fix FOLD rule for <tt>STRREF</tt> of <tt>SNEW</tt>.</li>\r\n<li>Fix frame traversal while searching for error function.</li>\r\n<li>Prevent GC estimate miscalculation due to buffer growth.</li>\r\n<li>Prevent adding side traces for stack checks.</li>\r\n<li>Fix top slot calculation for snapshots with continuations.</li>\r\n<li>Fix check for reuse of SCEV results in <tt>FORL</tt>.</li>\r\n<li>Add PS Vita port.</li>\r\n<li>Fix compatibility issues with Illumos.</li>\r\n<li>Fix DragonFly build (unsupported).</li>\r\n<li>OpenBSD/x86: Better executable memory allocation for W^X mode.</li>\r\n<li>x86: Fix argument checks for <tt>ipairs()</tt> iterator.</li>\r\n<li>x86: <tt>lj_math_random_step()</tt> clobbers XMM regs on OSX Clang.</li>\r\n<li>x86: Fix code generation for unused result of <tt>math.random()</tt>.</li>\r\n<li>x64: Allow building with <tt>LUAJIT_USE_SYSMALLOC</tt> and <tt>LUAJIT_USE_VALGRIND</tt>.</li>\r\n<li>x86/x64: Fix argument check for bit shifts.</li>\r\n<li>x86/x64: Fix code generation for fused test/arith ops.</li>\r\n<li>ARM: Fix write barrier check in <tt>BC_USETS</tt>.</li>\r\n<li>PPC: Fix red zone overflow in machine code generation.</li>\r\n<li>PPC: Don't use <tt>mcrxr</tt> on PPE.</li>\r\n<li>Various archs: Fix excess stack growth in interpreter.</li>\r\n<li>FFI: Fix FOLD rule for <tt>TOBIT</tt> + <tt>CONV num.u32</tt>.</li>\r\n<li>FFI: Prevent DSE across <tt>ffi.string()</tt>.</li>\r\n<li>FFI: No meta fallback when indexing pointer to incomplete struct.</li>\r\n<li>FFI: Fix initialization of unions of subtypes.</li>\r\n<li>FFI: Fix cdata vs. non-cdata arithmetic and comparisons.</li>\r\n<li>FFI: Fix <tt>__index</tt>/<tt>__newindex</tt> metamethod resolution for ctypes.</li>\r\n<li>FFI: Fix compilation of reference field access.</li>\r\n<li>FFI: Fix frame traversal for backtraces with FFI callbacks.</li>\r\n<li>FFI: Fix recording of indexing a struct pointer ctype object itself.</li>\r\n<li>FFI: Allow non-scalar cdata to be compared for equality by address.</li>\r\n<li>FFI: Fix pseudo type conversions for type punning.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.3\">LuaJIT 2.0.3 &mdash; 2014-03-12</h2>\r\n<ul>\r\n<li>Add PS4 port.</li>\r\n<li>Add support for multilib distro builds.</li>\r\n<li>Fix OSX build.</li>\r\n<li>Fix MinGW build.</li>\r\n<li>Fix Xbox 360 build.</li>\r\n<li>Improve ULOAD forwarding for open upvalues.</li>\r\n<li>Fix GC steps threshold handling when called by JIT-compiled code.</li>\r\n<li>Fix argument checks for <tt>math.deg()</tt> and <tt>math.rad()</tt>.</li>\r\n<li>Fix <tt>jit.flush(func|true)</tt>.</li>\r\n<li>Respect <tt>jit.off(func)</tt> when returning to a function, too.</li>\r\n<li>Fix compilation of <tt>string.byte(s, nil, n)</tt>.</li>\r\n<li>Fix line number for relocated bytecode after closure fixup</li>\r\n<li>Fix frame traversal for backtraces.</li>\r\n<li>Fix ABC elimination.</li>\r\n<li>Fix handling of redundant PHIs.</li>\r\n<li>Fix snapshot restore for exit to function header.</li>\r\n<li>Fix type punning alias analysis for constified pointers</li>\r\n<li>Fix call unroll checks in the presence of metamethod frames.</li>\r\n<li>Fix initial maxslot for down-recursive traces.</li>\r\n<li>Prevent BASE register coalescing if parent uses <tt>IR_RETF</tt>.</li>\r\n<li>Don't purge modified function from stack slots in <tt>BC_RET</tt>.</li>\r\n<li>Fix recording of <tt>BC_VARG</tt>.</li>\r\n<li>Don't access dangling reference to reallocated IR.</li>\r\n<li>Fix frame depth display for bytecode dump in <tt>-jdump</tt>.</li>\r\n<li>ARM: Fix register allocation when rematerializing FPRs.</li>\r\n<li>x64: Fix store to upvalue for lightuserdata values.</li>\r\n<li>FFI: Add missing GC steps for callback argument conversions.</li>\r\n<li>FFI: Properly unload loaded DLLs.</li>\r\n<li>FFI: Fix argument checks for <tt>ffi.string()</tt>.</li>\r\n<li>FFI/x64: Fix passing of vector arguments to calls.</li>\r\n<li>FFI: Rehash finalizer table after GC cycle, if needed.</li>\r\n<li>FFI: Fix <tt>cts-&gt;L</tt> for cdata unsinking in snapshot restore.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.2\">LuaJIT 2.0.2 &mdash; 2013-06-03</h2>\r\n<ul>\r\n<li>Fix memory access check for fast string interning.</li>\r\n<li>Fix MSVC intrinsics for older versions.</li>\r\n<li>Add missing GC steps for <tt>io.*</tt> functions.</li>\r\n<li>Fix spurious red zone overflows in machine code generation.</li>\r\n<li>Fix jump-range constrained mcode allocation.</li>\r\n<li>Inhibit DSE for implicit loads via calls.</li>\r\n<li>Fix builtin string to number conversion for overflow digits.</li>\r\n<li>Fix optional argument handling while recording builtins.</li>\r\n<li>Fix optional argument handling in <tt>table.concat()</tt>.</li>\r\n<li>Add partial support for building with MingW64 GCC 4.8-SEH.</li>\r\n<li>Add missing PHI barrier to <tt>string.sub(str, a, b) == kstr</tt> FOLD rule.</li>\r\n<li>Fix compatibility issues with Illumos.</li>\r\n<li>ARM: Fix cache flush/sync for exit stubs of JIT-compiled code.</li>\r\n<li>MIPS: Fix cache flush/sync for JIT-compiled code jump area.</li>\r\n<li>PPC: Add <tt>plt</tt> suffix for external calls from assembler code.</li>\r\n<li>FFI: Fix snapshot substitution in SPLIT pass.</li>\r\n<li>FFI/x86: Fix register allocation for 64 bit comparisons.</li>\r\n<li>FFI: Fix tailcall in lowest frame to C&nbsp;function with bool result.</li>\r\n<li>FFI: Ignore <tt>long</tt> type specifier in <tt>ffi.istype()</tt>.</li>\r\n<li>FFI: Fix calling conventions for 32 bit OSX and iOS simulator (struct returns).</li>\r\n<li>FFI: Fix calling conventions for ARM hard-float EABI (nested structs).</li>\r\n<li>FFI: Improve error messages for arithmetic and comparison operators.</li>\r\n<li>FFI: Insert no-op type conversion for pointer to integer cast.</li>\r\n<li>FFI: Fix unroll limit for <tt>ffi.fill()</tt>.</li>\r\n<li>FFI: Must sink <tt>XBAR</tt> together with <tt>XSTORE</tt>s.</li>\r\n<li>FFI: Preserve intermediate string for <tt>const&nbsp;char&nbsp;*</tt> conversion.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.1\">LuaJIT 2.0.1 &mdash; 2013-02-19</h2>\r\n<ul>\r\n<li>Don't clear frame for out-of-memory error.</li>\r\n<li>Leave hook when resume catches error thrown from hook.</li>\r\n<li>Add missing GC steps for template table creation.</li>\r\n<li>Fix discharge order of comparisons in Lua parser.</li>\r\n<li>Improve buffer handling for <tt>io.read()</tt>.</li>\r\n<li>OSX: Add support for Mach-O object files to <tt>-b</tt> option.</li>\r\n<li>Fix PS3 port.</li>\r\n<li>Fix/enable Xbox 360 port.</li>\r\n<li>x86/x64: Always mark ref for shift count as non-weak.</li>\r\n<li>x64: Don't fuse implicitly 32-to-64 extended operands.</li>\r\n<li>ARM: Fix armhf call argument handling.</li>\r\n<li>ARM: Fix code generation for integer math.min/math.max.</li>\r\n<li>PPC/e500: Fix <tt>lj_vm_floor()</tt> for Inf/NaN.</li>\r\n<li>FFI: Change priority of table initializer variants for structs.</li>\r\n<li>FFI: Fix code generation for bool call result check on x86/x64.</li>\r\n<li>FFI: Load FFI library on-demand for bytecode with cdata literals.</li>\r\n<li>FFI: Fix handling of qualified transparent structs/unions.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0\">LuaJIT 2.0.0 &mdash; 2012-11-08</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n  <li>Fix Android/x86 build.</li>\r\n  <li>Fix recording of equality comparisons with <tt>__eq</tt> metamethods.</li>\r\n  <li>Fix detection of immutable upvalues.</li>\r\n  <li>Replace error with PANIC for callbacks from JIT-compiled code.</li>\r\n  <li>Fix builtin string to number conversion for <tt>INT_MIN</tt>.</li>\r\n  <li>Don't create unneeded array part for template tables.</li>\r\n  <li>Fix <tt>CONV.num.int</tt> sinking.</li>\r\n  <li>Don't propagate implicitly widened number to index metamethods.</li>\r\n  <li>ARM: Fix ordered comparisons of number vs. non-number.</li>\r\n  <li>FFI: Fix code generation for replay of sunk float fields.</li>\r\n  <li>FFI: Fix signedness of bool.</li>\r\n  <li>FFI: Fix recording of bool call result check on x86/x64.</li>\r\n  <li>FFI: Fix stack-adjustment for <tt>__thiscall</tt> callbacks.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta11\">LuaJIT 2.0.0-beta11 &mdash; 2012-10-16</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n  <li>Use ARM VFP instructions, if available (build-time detection).</li>\r\n  <li>Add support for ARM hard-float EABI (<tt>armhf</tt>).</li>\r\n  <li>Add PS3 port.</li>\r\n  <li>Add many features from Lua&nbsp;5.2, e.g. <tt>goto</tt>/labels.\r\n  Refer to <a href=\"extensions.html#lua52\">this list</a>.</li>\r\n  <li>FFI: Add parameterized C types.</li>\r\n  <li>FFI: Add support for copy constructors.</li>\r\n  <li>FFI: Equality comparisons never raise an error (treat as unequal instead).</li>\r\n  <li>FFI: Box all accessed or returned enums.</li>\r\n  <li>FFI: Check for <tt>__new</tt> metamethod when calling a constructor.</li>\r\n  <li>FFI: Handle <tt>__pairs</tt>/<tt>__ipairs</tt> metamethods for cdata objects.</li>\r\n  <li>FFI: Convert <tt>io.*</tt> file handle to <tt>FILE *</tt> pointer (but as a <tt>void *</tt>).</li>\r\n  <li>FFI: Detect and support type punning through unions.</li>\r\n  <li>FFI: Improve various error messages.</li>\r\n</ul></li>\r\n<li>Build-system reorganization:\r\n<ul>\r\n  <li>Reorganize directory layout:<br>\r\n  <tt>lib/*</tt> &rarr; <tt>src/jit/*</tt><br>\r\n  <tt>src/buildvm_*.dasc</tt> &rarr; <tt>src/vm_*.dasc</tt><br>\r\n  <tt>src/buildvm_*.h</tt> &rarr; removed<br>\r\n  <tt>src/buildvm*</tt> &rarr; <tt>src/host/*</tt></li>\r\n  <li>Add minified Lua interpreter plus Lua BitOp (<tt>minilua</tt>) to run DynASM.</li>\r\n  <li>Change DynASM bit operations to use Lua BitOp</li>\r\n  <li>Translate only <tt>vm_*.dasc</tt> for detected target architecture.</li>\r\n  <li>Improve target detection for <tt>msvcbuild.bat</tt>.</li>\r\n  <li>Fix build issues on Cygwin and MinGW with optional MSys.</li>\r\n  <li>Handle cross-compiles with FPU/no-FPU or hard-fp/soft-fp ABI mismatch.</li>\r\n  <li>Remove some library functions for no-JIT/no-FFI builds.</li>\r\n  <li>Add uninstall target to top-level Makefile.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n  <li>Preserve snapshot #0 PC for all traces.</li>\r\n  <li>Fix argument checks for <tt>coroutine.create()</tt>.</li>\r\n  <li>Command line prints version and JIT status to <tt>stdout</tt>, not <tt>stderr</tt>.</li>\r\n  <li>Fix userdata <tt>__gc</tt> separations at Lua state close.</li>\r\n  <li>Fix <tt>TDUP</tt> to <tt>HLOAD</tt> forwarding for <tt>LJ_DUALNUM</tt> builds.</li>\r\n  <li>Fix buffer check in bytecode writer.</li>\r\n  <li>Make <tt>os.date()</tt> thread-safe.</li>\r\n  <li>Add missing declarations for MSVC intrinsics.</li>\r\n  <li>Fix dispatch table modifications for return hooks.</li>\r\n  <li>Workaround for MSVC conversion bug (<tt>double</tt> &rarr; <tt>uint32_t</tt> &rarr; <tt>int32_t</tt>).</li>\r\n  <li>Fix FOLD rule <tt>(i-j)-i => 0-j</tt>.</li>\r\n  <li>Never use DWARF unwinder on Windows.</li>\r\n  <li>Fix shrinking of direct mapped blocks in builtin allocator.</li>\r\n  <li>Limit recursion depth in <tt>string.match()</tt> et al.</li>\r\n  <li>Fix late despecialization of <tt>ITERN</tt> after loop has been entered.</li>\r\n  <li>Fix <tt>'f'</tt> and <tt>'L'</tt> options for <tt>debug.getinfo()</tt> and <tt>lua_getinfo()</tt>.</li>\r\n  <li>Fix <tt>package.searchpath()</tt>.</li>\r\n  <li>OSX: Change dylib names to be consistent with other platforms.</li>\r\n  <li>Android: Workaround for broken <tt>sprintf(\"%g\",&nbsp;-0.0)</tt>.</li>\r\n  <li>x86: Remove support for ancient CPUs without <tt>CMOV</tt> (before Pentium Pro).</li>\r\n  <li>x86: Fix register allocation for calls returning register pair.</li>\r\n  <li>x86/x64: Fix fusion of unsigned byte comparisons with swapped operands.</li>\r\n  <li>ARM: Fix <tt>tonumber()</tt> argument check.</li>\r\n  <li>ARM: Fix modulo operator and <tt>math.floor()</tt>/<tt>math.ceil()</tt> for <tt>inf</tt>/<tt>nan</tt>.</li>\r\n  <li>ARM: Invoke SPLIT pass for leftover <tt>IR_TOBIT</tt>.</li>\r\n  <li>ARM: Fix BASE register coalescing.</li>\r\n  <li>PPC: Fix interpreter state setup in callbacks.</li>\r\n  <li>PPC: Fix <tt>string.sub()</tt> range check.</li>\r\n  <li>MIPS: Support generation of MIPS/MIPSEL bytecode object files.</li>\r\n  <li>MIPS: Fix calls to <tt>floor()</tt>/<tt>ceil()</tt><tt>/trunc()</tt>.</li>\r\n  <li>ARM/PPC: Detect more target architecture variants.</li>\r\n  <li>ARM/PPC/e500/MIPS: Fix tailcalls from fast functions, esp. <tt>tostring()</tt>.</li>\r\n  <li>ARM/PPC/MIPS: Fix rematerialization of FP constants.</li>\r\n  <li>FFI: Don't call <tt>FreeLibrary()</tt> on our own EXE/DLL.</li>\r\n  <li>FFI: Resolve metamethods for constructors, too.</li>\r\n  <li>FFI: Properly disable callbacks on iOS (would require executable memory).</li>\r\n  <li>FFI: Fix cdecl string parsing during recording.</li>\r\n  <li>FFI: Show address pointed to for <tt>tostring(ref)</tt>, too.</li>\r\n  <li>FFI: Fix alignment of C call argument/return structure.</li>\r\n  <li>FFI: Initialize all fields of standard types.</li>\r\n  <li>FFI: Fix callback handling when new C&nbsp;types are declared in callback.</li>\r\n  <li>FFI: Fix recording of constructors for pointers.</li>\r\n  <li>FFI: Always resolve metamethods for pointers to structs.</li>\r\n  <li>FFI: Correctly propagate alignment when interning nested types.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n  <li>Add allocation sinking and store sinking optimization.</li>\r\n  <li>Constify immutable upvalues.</li>\r\n  <li>Add builtin string to integer or FP number conversion. Improves cross-platform consistency and correctness.</li>\r\n  <li>Create string hash slots in template tables for non-const values, too. Avoids later table resizes.</li>\r\n  <li>Eliminate <tt>HREFK</tt> guard for template table references.</li>\r\n  <li>Add various new FOLD rules.</li>\r\n  <li>Don't use stack unwinding for <tt>lua_yield()</tt> (slow on x64).</li>\r\n  <li>ARM, PPC, MIPS: Improve <tt>XLOAD</tt> operand fusion and register hinting.</li>\r\n  <li>PPC, MIPS: Compile <tt>math.sqrt()</tt> to sqrt instruction, if available.</li>\r\n  <li>FFI: Fold <tt>KPTR</tt> + constant offset in SPLIT pass.</li>\r\n  <li>FFI: Optimize/inline <tt>ffi.copy()</tt> and <tt>ffi.fill()</tt>.</li>\r\n  <li>FFI: Compile and optimize array/struct copies.</li>\r\n  <li>FFI: Compile <tt>ffi.typeof(cdata|ctype)</tt>, <tt>ffi.sizeof()</tt>, <tt>ffi.alignof()</tt>, <tt>ffi.offsetof()</tt> and <tt>ffi.gc()</tt>.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta10\">LuaJIT 2.0.0-beta10 &mdash; 2012-05-09</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>The MIPS of LuaJIT is complete. It requires a CPU conforming to the\r\nMIPS32&nbsp;R1 architecture with hardware FPU. O32 hard-fp ABI,\r\nlittle-endian or big-endian.</li>\r\n<li>Auto-detect target arch via cross-compiler. No need for\r\n<tt>TARGET=arch</tt> anymore.</li>\r\n<li>Make DynASM compatible with Lua 5.2.</li>\r\n<li>From Lua 5.2: Try <tt>__tostring</tt> metamethod on non-string error\r\nmessages..</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix parsing of hex literals with exponents.</li>\r\n<li>Fix bytecode dump for certain number constants.</li>\r\n<li>Fix argument type in error message for relative arguments.</li>\r\n<li>Fix argument error handling on Lua stacks without a frame.</li>\r\n<li>Add missing mcode limit check in assembler backend.</li>\r\n<li>Fix compilation on OpenBSD.</li>\r\n<li>Avoid recursive GC steps after GC-triggered trace exit.</li>\r\n<li>Replace <tt>&lt;unwind.h&gt;</tt> definitions with our own.</li>\r\n<li>Fix OSX build issues. Bump minimum required OSX version to 10.4.</li>\r\n<li>Fix discharge order of comparisons in Lua parser.</li>\r\n<li>Ensure running <tt>__gc</tt> of userdata created in <tt>__gc</tt>\r\nat state close.</li>\r\n<li>Limit number of userdata <tt>__gc</tt> separations at state close.</li>\r\n<li>Fix bytecode <tt>JMP</tt> slot range when optimizing\r\n<tt>and</tt>/<tt>or</tt> with constant LHS.</li>\r\n<li>Fix DSE of <tt>USTORE</tt>.</li>\r\n<li>Make <tt>lua_concat()</tt> work from C&nbsp;hook with partial frame.</li>\r\n<li>Add required PHIs for implicit conversions, e.g. via <tt>XREF</tt>\r\nforwarding.</li>\r\n<li>Add more comparison variants to Valgrind suppressions file.</li>\r\n<li>Disable loading bytecode with an extra header (BOM or <tt>#!</tt>).</li>\r\n<li>Fix PHI stack slot syncing.</li>\r\n<li>ARM: Reorder type/value tests to silence Valgrind.</li>\r\n<li>ARM: Fix register allocation for <tt>ldrd</tt>-optimized\r\n<tt>HREFK</tt>.</li>\r\n<li>ARM: Fix conditional branch fixup for <tt>OBAR</tt>.</li>\r\n<li>ARM: Invoke SPLIT pass for <tt>double</tt> args in FFI call.</li>\r\n<li>ARM: Handle all <tt>CALL*</tt> ops with <tt>double</tt> results in\r\nSPLIT pass.</li>\r\n<li>ARM: Fix rejoin of <tt>POW</tt> in SPLIT pass.</li>\r\n<li>ARM: Fix compilation of <tt>math.sinh</tt>, <tt>math.cosh</tt>,\r\n<tt>math.tanh</tt>.</li>\r\n<li>ARM, PPC: Avoid pointless arg clearing in <tt>BC_IFUNCF</tt>.</li>\r\n<li>PPC: Fix resume after yield from hook.</li>\r\n<li>PPC: Fix argument checking for <tt>rawget()</tt>.</li>\r\n<li>PPC: Fix fusion of floating-point <tt>XLOAD</tt>/<tt>XSTORE</tt>.</li>\r\n<li>PPC: Fix <tt>HREFK</tt> code generation for huge tables.</li>\r\n<li>PPC: Use builtin D-Cache/I-Cache sync code.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Ignore empty statements in <tt>ffi.cdef()</tt>.</li>\r\n<li>Ignore number parsing errors while skipping definitions.</li>\r\n<li>Don't touch frame in callbacks with tailcalls to fast functions.</li>\r\n<li>Fix library unloading on POSIX systems.</li>\r\n<li>Finalize cdata before userdata when closing the state.</li>\r\n<li>Change <tt>ffi.load()</tt> library name resolution for Cygwin.</li>\r\n<li>Fix resolving of function name redirects on Windows/x86.</li>\r\n<li>Fix symbol resolving error messages on Windows.</li>\r\n<li>Fix blacklisting of C functions calling callbacks.</li>\r\n<li>Fix result type of pointer difference.</li>\r\n<li>Use correct PC in FFI metamethod error message.</li>\r\n<li>Allow <tt>'typedef _Bool int BOOL;'</tt> for the Windows API.</li>\r\n<li>Don't record test for bool result of call, if ignored.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta9\">LuaJIT 2.0.0-beta9 &mdash; 2011-12-14</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>PPC port of LuaJIT is complete. Default is the dual-number port\r\n(usually faster). Single-number port selectable via <tt>src/Makefile</tt>\r\nat build time.</li>\r\n<li>Add FFI callback support.</li>\r\n<li>Extend <tt>-b</tt> to generate <tt>.c</tt>, <tt>.h</tt> or <tt>.obj/.o</tt>\r\nfiles with embedded bytecode.</li>\r\n<li>Allow loading embedded bytecode with <tt>require()</tt>.</li>\r\n<li>From Lua 5.2: Change to <tt>'\\z'</tt> escape. Reject undefined escape\r\nsequences.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix OSX 10.7 build. Fix <tt>install_name</tt> and versioning on OSX.</li>\r\n<li>Fix iOS build.</li>\r\n<li>Install <tt>dis_arm.lua</tt>, too.</li>\r\n<li>Mark installed shared library as executable.</li>\r\n<li>Add debug option to <tt>msvcbuild.bat</tt> and improve error handling.</li>\r\n<li>Fix data-flow analysis for iterators.</li>\r\n<li>Fix forced unwinding triggered by external unwinder.</li>\r\n<li>Record missing <tt>for</tt> loop slot loads (return to lower frame).</li>\r\n<li>Always use ANSI variants of Windows system functions.</li>\r\n<li>Fix GC barrier for multi-result table constructor (<tt>TSETM</tt>).</li>\r\n<li>Fix/add various FOLD rules.</li>\r\n<li>Add potential PHI for number conversions due to type instability.</li>\r\n<li>Do not eliminate PHIs only referenced from other PHIs.</li>\r\n<li>Correctly anchor implicit number to string conversions in Lua/C API.</li>\r\n<li>Fix various stack limit checks.</li>\r\n<li>x64: Use thread-safe exceptions for external unwinding (GCC platforms).</li>\r\n<li>x64: Fix result type of cdata index conversions.</li>\r\n<li>x64: Fix <tt>math.random()</tt> and <tt>bit.bswap()</tt> code generation.</li>\r\n<li>x64: Fix <tt>lightuserdata</tt> comparisons.</li>\r\n<li>x64: Always extend stack-passed arguments to pointer size.</li>\r\n<li>ARM: Many fixes to code generation backend.</li>\r\n<li>PPC/e500: Fix dispatch for binop metamethods.</li>\r\n<li>PPC/e500: Save/restore condition registers when entering/leaving the VM.</li>\r\n<li>PPC/e500: Fix write barrier in stores of strings to upvalues.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Fix C comment parsing.</li>\r\n<li>Fix snapshot optimization for cdata comparisons.</li>\r\n<li>Fix recording of const/enum lookups in namespaces.</li>\r\n<li>Fix call argument and return handling for <tt>I8/U8/I16/U16</tt> types.</li>\r\n<li>Fix unfused loads of float fields.</li>\r\n<li>Fix <tt>ffi.string()</tt> recording.</li>\r\n<li>Save <tt>GetLastError()</tt> around <tt>ffi.load()</tt> and symbol\r\nresolving, too.</li>\r\n<li>Improve ld script detection in <tt>ffi.load()</tt>.</li>\r\n<li>Record loads/stores to external variables in namespaces.</li>\r\n<li>Compile calls to stdcall, fastcall and vararg functions.</li>\r\n<li>Treat function ctypes like pointers in comparisons.</li>\r\n<li>Resolve <tt>__call</tt> metamethod for pointers, too.</li>\r\n<li>Record C function calls with bool return values.</li>\r\n<li>Record <tt>ffi.errno()</tt>.</li>\r\n<li>x86: Fix number to <tt>uint32_t</tt> conversion rounding.</li>\r\n<li>x86: Fix 64 bit arithmetic in assembler backend.</li>\r\n<li>x64: Fix struct-by-value calling conventions.</li>\r\n<li>ARM: Ensure invocation of SPLIT pass for float conversions.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Display trace types with <tt>-jv</tt> and <tt>-jdump</tt>.</li>\r\n<li>Record isolated calls. But prefer recording loops over calls.</li>\r\n<li>Specialize to prototype for non-monomorphic functions. Solves the\r\ntrace-explosion problem for closure-heavy programming styles.</li>\r\n<li>Always generate a portable <tt>vmdef.lua</tt>. Easier for distros.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta8\">LuaJIT 2.0.0-beta8 &mdash; 2011-06-23</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>Soft-float ARM port of LuaJIT is complete.</li>\r\n<li>Add support for bytecode loading/saving and <tt>-b</tt> command line\r\noption.</li>\r\n<li>From Lua 5.2: <tt>__len</tt> metamethod for tables\r\n(disabled by default).</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>ARM: Misc. fixes for interpreter.</li>\r\n<li>x86/x64: Fix <tt>bit.*</tt> argument checking in interpreter.</li>\r\n<li>Catch early out-of-memory in memory allocator initialization.</li>\r\n<li>Fix data-flow analysis for paths leading to an upvalue close.</li>\r\n<li>Fix check for missing arguments in <tt>string.format()</tt>.</li>\r\n<li>Fix Solaris/x86 build (note: not a supported target).</li>\r\n<li>Fix recording of loops with instable directions in side traces.</li>\r\n<li>x86/x64: Fix fusion of comparisons with <tt>u8</tt>/<tt>u16</tt>\r\n<tt>XLOAD</tt>.</li>\r\n<li>x86/x64: Fix register allocation for variable shifts.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Add <tt>ffi.errno()</tt>. Save <tt>errno</tt>/<tt>GetLastError()</tt>\r\naround allocations etc.</li>\r\n<li>Fix <tt>__gc</tt> for VLA/VLS cdata objects.</li>\r\n<li>Fix recording of casts from 32 bit cdata pointers to integers.</li>\r\n<li><tt>tonumber(cdata)</tt> returns <tt>nil</tt> for non-numbers.</li>\r\n<li>Show address pointed to for <tt>tostring(pointer)</tt>.</li>\r\n<li>Print <tt>NULL</tt> pointers as <tt>\"cdata&lt;... *&gt;: NULL\"</tt>.</li>\r\n<li>Support <tt>__tostring</tt> metamethod for pointers to structs, too.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>More tuning for loop unrolling heuristics.</li>\r\n<li>Flatten and compress in-memory debug info (saves ~70%).</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta7\">LuaJIT 2.0.0-beta7 &mdash; 2011-05-05</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>ARM port of the LuaJIT interpreter is complete.</li>\r\n<li>FFI library: Add <tt>ffi.gc()</tt>, <tt>ffi.metatype()</tt>,\r\n<tt>ffi.istype()</tt>.</li>\r\n<li>FFI library: Resolve ld script redirection in <tt>ffi.load()</tt>.</li>\r\n<li>From Lua 5.2: <tt>package.searchpath()</tt>, <tt>fp:read(\"*L\")</tt>,\r\n<tt>load(string)</tt>.</li>\r\n<li>From Lua 5.2, disabled by default: empty statement,\r\n<tt>table.unpack()</tt>, modified <tt>coroutine.running()</tt>.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>FFI library: numerous fixes.</li>\r\n<li>Fix type mismatches in store-to-load forwarding.</li>\r\n<li>Fix error handling within metamethods.</li>\r\n<li>Fix <tt>table.maxn()</tt>.</li>\r\n<li>Improve accuracy of <tt>x^-k</tt> on x64.</li>\r\n<li>Fix code generation for Intel Atom in x64 mode.</li>\r\n<li>Fix narrowing of POW.</li>\r\n<li>Fix recording of retried fast functions.</li>\r\n<li>Fix code generation for <tt>bit.bnot()</tt> and multiplies.</li>\r\n<li>Fix error location within cpcall frames.</li>\r\n<li>Add workaround for old libgcc unwind bug.</li>\r\n<li>Fix <tt>lua_yield()</tt> and <tt>getmetatable(lightuserdata)</tt> on x64.</li>\r\n<li>Misc. fixes for PPC/e500 interpreter.</li>\r\n<li>Fix stack slot updates for down-recursion.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Add dual-number mode (int/double) for the VM. Enabled for ARM.</li>\r\n<li>Improve narrowing of arithmetic operators and <tt>for</tt> loops.</li>\r\n<li>Tune loop unrolling heuristics and increase trace recorder limits.</li>\r\n<li>Eliminate dead slots in snapshots using bytecode data-flow analysis.</li>\r\n<li>Avoid phantom stores to proxy tables.</li>\r\n<li>Optimize lookups in empty proxy tables.</li>\r\n<li>Improve bytecode optimization of <tt>and</tt>/<tt>or</tt> operators.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta6\">LuaJIT 2.0.0-beta6 &mdash; 2011-02-11</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>PowerPC/e500v2 port of the LuaJIT interpreter is complete.</li>\r\n<li>Various minor features from Lua 5.2: Hex escapes in literals,\r\n<tt>'\\*'</tt> escape, reversible <tt>string.format(\"%q\",s)</tt>,\r\n<tt>\"%g\"</tt> pattern, <tt>table.sort</tt> checks callbacks,\r\n<tt>os.exit(status|true|false[,close])</tt>.</li>\r\n<li>Lua 5.2 <tt>__pairs</tt> and <tt>__ipairs</tt> metamethods\r\n(disabled by default).</li>\r\n<li>Initial release of the FFI library.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix <tt>string.format()</tt> for non-finite numbers.</li>\r\n<li>Fix memory leak when compiled to use the built-in allocator.</li>\r\n<li>x86/x64: Fix unnecessary resize in <tt>TSETM</tt> bytecode.</li>\r\n<li>Fix various GC issues with traces and <tt>jit.flush()</tt>.</li>\r\n<li>x64: Fix fusion of indexes for array references.</li>\r\n<li>x86/x64: Fix stack overflow handling for coroutine results.</li>\r\n<li>Enable low-2GB memory allocation on FreeBSD/x64.</li>\r\n<li>Fix <tt>collectgarbage(\"count\")</tt> result if more than 2GB is in use.</li>\r\n<li>Fix parsing of hex floats.</li>\r\n<li>x86/x64: Fix loop branch inversion with trailing\r\n<tt>HREF+NE/EQ</tt>.</li>\r\n<li>Add <tt>jit.os</tt> string.</li>\r\n<li><tt>coroutine.create()</tt> permits running C functions, too.</li>\r\n<li>Fix OSX build to work with newer ld64 versions.</li>\r\n<li>Fix bytecode optimization of <tt>and</tt>/<tt>or</tt> operators.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Emit specialized bytecode for <tt>pairs()</tt>/<tt>next()</tt>.</li>\r\n<li>Improve bytecode coalescing of <tt>nil</tt> constants.</li>\r\n<li>Compile calls to vararg functions.</li>\r\n<li>Compile <tt>select()</tt>.</li>\r\n<li>Improve alias analysis, esp. for loads from allocations.</li>\r\n<li>Tuning of various compiler heuristics.</li>\r\n<li>Refactor and extend IR conversion instructions.</li>\r\n<li>x86/x64: Various backend enhancements related to the FFI.</li>\r\n<li>Add SPLIT pass to split 64 bit IR instructions for 32 bit CPUs.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta5\">LuaJIT 2.0.0-beta5 &mdash; 2010-08-24</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix trace exit dispatch to function headers.</li>\r\n<li>Fix Windows and OSX builds with LUAJIT_DISABLE_JIT.</li>\r\n<li>Reorganize and fix placement of generated machine code on x64.</li>\r\n<li>Fix TNEW in x64 interpreter.</li>\r\n<li>Do not eliminate PHIs for values only referenced from side exits.</li>\r\n<li>OS-independent canonicalization of strings for non-finite numbers.</li>\r\n<li>Fix <tt>string.char()</tt> range check on x64.</li>\r\n<li>Fix <tt>tostring()</tt> resolving within <tt>print()</tt>.</li>\r\n<li>Fix error handling for <tt>next()</tt>.</li>\r\n<li>Fix passing of constant arguments to external calls on x64.</li>\r\n<li>Fix interpreter argument check for two-argument SSE math functions.</li>\r\n<li>Fix C frame chain corruption caused by <tt>lua_cpcall()</tt>.</li>\r\n<li>Fix return from <tt>pcall()</tt> within active hook.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Replace on-trace GC frame syncing with interpreter exit.</li>\r\n<li>Improve hash lookup specialization by not removing dead keys during GC.</li>\r\n<li>Turn traces into true GC objects.</li>\r\n<li>Avoid starting a GC cycle immediately after library init.</li>\r\n<li>Add weak guards to improve dead-code elimination.</li>\r\n<li>Speed up string interning.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta4\">LuaJIT 2.0.0-beta4 &mdash; 2010-03-28</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix precondition for on-trace creation of table keys.</li>\r\n<li>Fix <tt>{f()}</tt> on x64 when table is resized.</li>\r\n<li>Fix folding of ordered comparisons with same references.</li>\r\n<li>Fix snapshot restores for multi-result bytecodes.</li>\r\n<li>Fix potential hang when recording bytecode with nested closures.</li>\r\n<li>Fix recording of <tt>getmetatable()</tt>, <tt>tonumber()</tt> and bad argument types.</li>\r\n<li>Fix SLOAD fusion across returns to lower frames.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Add array bounds check elimination. <tt>-Oabc</tt> is enabled by default.</li>\r\n<li>More tuning for x64, e.g. smaller table objects.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta3\">LuaJIT 2.0.0-beta3 &mdash; 2010-03-07</h2>\r\n<ul>\r\n<li>LuaJIT x64 port:\r\n<ul>\r\n<li>Port integrated memory allocator to Linux/x64, Windows/x64 and OSX/x64.</li>\r\n<li>Port interpreter and JIT compiler to x64.</li>\r\n<li>Port DynASM to x64.</li>\r\n<li>Many 32/64 bit cleanups in the VM.</li>\r\n<li>Allow building the interpreter with either x87 or SSE2 arithmetics.</li>\r\n<li>Add external unwinding and C++ exception interop (default on x64).</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix constructor bytecode generation for certain conditional values.</li>\r\n<li>Fix some cases of ordered string comparisons.</li>\r\n<li>Fix <tt>lua_tocfunction()</tt>.</li>\r\n<li>Fix cutoff register in JMP bytecode for some conditional expressions.</li>\r\n<li>Fix PHI marking algorithm for references from variant slots.</li>\r\n<li>Fix <tt>package.cpath</tt> for non-default PREFIX.</li>\r\n<li>Fix DWARF2 frame unwind information for interpreter on OSX.</li>\r\n<li>Drive the GC forward on string allocations in the parser.</li>\r\n<li>Implement call/return hooks (zero-cost if disabled).</li>\r\n<li>Implement yield from C hooks.</li>\r\n<li>Disable JIT compiler on older non-SSE2 CPUs instead of aborting.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Compile recursive code (tail-, up- and down-recursion).</li>\r\n<li>Improve heuristics for bytecode penalties and blacklisting.</li>\r\n<li>Split CALL/FUNC recording and clean up fast function call semantics.</li>\r\n<li>Major redesign of internal function call handling.</li>\r\n<li>Improve FOR loop const specialization and integerness checks.</li>\r\n<li>Switch to pre-initialized stacks. Avoid frame-clearing.</li>\r\n<li>Colocation of prototypes and related data: bytecode, constants, debug info.</li>\r\n<li>Cleanup parser and streamline bytecode generation.</li>\r\n<li>Add support for weak IR references to register allocator.</li>\r\n<li>Switch to compressed, extensible snapshots.</li>\r\n<li>Compile returns to frames below the start frame.</li>\r\n<li>Improve alias analysis of upvalues using a disambiguation hash value.</li>\r\n<li>Compile floor/ceil/trunc to SSE2 helper calls or SSE4.1 instructions.</li>\r\n<li>Add generic C call handling to IR and backend.</li>\r\n<li>Improve KNUM fuse vs. load heuristics.</li>\r\n<li>Compile various <tt>io.*()</tt> functions.</li>\r\n<li>Compile <tt>math.sinh()</tt>, <tt>math.cosh()</tt>, <tt>math.tanh()</tt>\r\nand <tt>math.random()</tt>.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta2\">LuaJIT 2.0.0-beta2 &mdash; 2009-11-09</h2>\r\n<ul>\r\n<li>Reorganize build system. Build static+shared library on POSIX.</li>\r\n<li>Allow C++ exception conversion on all platforms\r\nusing a wrapper function.</li>\r\n<li>Automatically catch C++ exceptions and rethrow Lua error\r\n(DWARF2 only).</li>\r\n<li>Check for the correct x87 FPU precision at strategic points.</li>\r\n<li>Always use wrappers for libm functions.</li>\r\n<li>Resurrect metamethod name strings before copying them.</li>\r\n<li>Mark current trace, even if compiler is idle.</li>\r\n<li>Ensure FILE metatable is created only once.</li>\r\n<li>Fix type comparisons when different integer types are involved.</li>\r\n<li>Fix <tt>getmetatable()</tt> recording.</li>\r\n<li>Fix TDUP with dead keys in template table.</li>\r\n<li><tt>jit.flush(tr)</tt> returns status.\r\nPrevent manual flush of a trace that's still linked.</li>\r\n<li>Improve register allocation heuristics for invariant references.</li>\r\n<li>Compile the push/pop variants of <tt>table.insert()</tt> and\r\n<tt>table.remove()</tt>.</li>\r\n<li>Compatibility with MSVC <tt>link&nbsp/debug</tt>.</li>\r\n<li>Fix <tt>lua_iscfunction()</tt>.</li>\r\n<li>Fix <tt>math.random()</tt> when compiled with <tt>-fpic</tt> (OSX).</li>\r\n<li>Fix <tt>table.maxn()</tt>.</li>\r\n<li>Bump <tt>MACOSX_DEPLOYMENT_TARGET</tt> to <tt>10.4</tt></li>\r\n<li><tt>luaL_check*()</tt> and <tt>luaL_opt*()</tt> now support\r\nnegative arguments, too.<br>\r\nThis matches the behavior of Lua 5.1, but not the specification.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta1\">LuaJIT 2.0.0-beta1 &mdash; 2009-10-31</h2>\r\n<ul>\r\n<li>This is the first public release of LuaJIT 2.0.</li>\r\n<li>The whole VM has been rewritten from the ground up, so there's\r\nno point in listing differences over earlier versions.</li>\r\n</ul>\r\n</div>\r\n\r\n<div class=\"major\" style=\"background: #ffff80;\">\r\n<h2 id=\"LuaJIT-1.1.8\">LuaJIT 1.1.8 &mdash; 2012-04-16</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1.5. Also integrated fixes for all\r\n<a href=\"http://www.lua.org/bugs.html#5.1.5\"><span class=\"ext\">&raquo;</span>&nbsp;<span class=\"ext\">&raquo;</span>&nbsp;currently known bugs in Lua 5.1.5</a>.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.7\">LuaJIT 1.1.7 &mdash; 2011-05-05</h2>\r\n<ul>\r\n<li>Added fixes for the\r\n<a href=\"http://www.lua.org/bugs.html#5.1.4\"><span class=\"ext\">&raquo;</span>&nbsp;currently known bugs in Lua 5.1.4</a>.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.6\">LuaJIT 1.1.6 &mdash; 2010-03-28</h2>\r\n<ul>\r\n<li>Added fixes for the\r\n<a href=\"http://www.lua.org/bugs.html#5.1.4\"><span class=\"ext\">&raquo;</span>&nbsp;currently known bugs in Lua 5.1.4</a>.</li>\r\n<li>Removed wrong GC check in <tt>jit_createstate()</tt>.\r\nThanks to Tim Mensch.</li>\r\n<li>Fixed bad assertions while compiling <tt>table.insert()</tt> and\r\n<tt>table.remove()</tt>.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.5\">LuaJIT 1.1.5 &mdash; 2008-10-25</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1.4. Fixes all\r\n<a href=\"http://www.lua.org/bugs.html#5.1.3\"><span class=\"ext\">&raquo;</span>&nbsp;known bugs in Lua 5.1.3</a>.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.4\">LuaJIT 1.1.4 &mdash; 2008-02-05</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1.3. Fixes all\r\n<a href=\"http://www.lua.org/bugs.html#5.1.2\"><span class=\"ext\">&raquo;</span>&nbsp;known bugs in Lua 5.1.2</a>.</li>\r\n<li>Fixed possible (but unlikely) stack corruption while compiling\r\n<tt>k^x</tt> expressions.</li>\r\n<li>Fixed DynASM template for cmpss instruction.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.3\">LuaJIT 1.1.3 &mdash; 2007-05-24</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1.2. Fixes all\r\n<a href=\"http://www.lua.org/bugs.html#5.1.1\"><span class=\"ext\">&raquo;</span>&nbsp;known bugs in Lua 5.1.1</a>.</li>\r\n<li>Merged pending Lua 5.1.x fixes: \"return -nil\" bug, spurious count hook call.</li>\r\n<li>Remove a (sometimes) wrong assertion in <tt>luaJIT_findpc()</tt>.</li>\r\n<li>DynASM now allows labels for displacements and <tt>.aword</tt>.</li>\r\n<li>Fix some compiler warnings for DynASM glue (internal API change).</li>\r\n<li>Correct naming for SSSE3 (temporarily known as SSE4) in DynASM and x86 disassembler.</li>\r\n<li>The loadable debug modules now handle redirection to stdout\r\n(e.g. <tt>-j&nbsp;trace=-</tt>).</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.2\">LuaJIT 1.1.2 &mdash; 2006-06-24</h2>\r\n<ul>\r\n<li>Fix MSVC inline assembly: use only local variables with\r\n<tt>lua_number2int()</tt>.</li>\r\n<li>Fix \"attempt to call a thread value\" bug on Mac OS X:\r\nmake values of consts used as lightuserdata keys unique\r\nto avoid joining by the compiler/linker.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-1.1.1\">LuaJIT 1.1.1 &mdash; 2006-06-20</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1.1. Fixes all\r\n<a href=\"http://www.lua.org/bugs.html#5.1\"><span class=\"ext\">&raquo;</span>&nbsp;known bugs in Lua 5.1</a>.</li>\r\n<li>Enforce (dynamic) linker error for EXE/DLL version mismatches.</li>\r\n<li>Minor changes to DynASM: faster pre-processing, smaller encoding\r\nfor some immediates.</li>\r\n</ul>\r\n<p>\r\nThis release is in sync with Coco 1.1.1 (see the\r\n<a href=\"http://coco.luajit.org/changes.html\"><span class=\"ext\">&raquo;</span>&nbsp;Coco Change History</a>).\r\n</p>\r\n\r\n<h2 id=\"LuaJIT-1.1.0\">LuaJIT 1.1.0 &mdash; 2006-03-13</h2>\r\n<ul>\r\n<li>Merged with Lua 5.1 (final).</li>\r\n\r\n<li>New JIT call frame setup:\r\n<ul>\r\n<li>The C stack is kept 16 byte aligned (faster).\r\nMandatory for Mac OS X on Intel, too.</li>\r\n<li>Faster calling conventions for internal C helper functions.</li>\r\n<li>Better instruction scheduling for function prologue, OP_CALL and\r\nOP_RETURN.</li>\r\n</ul></li>\r\n\r\n<li>Miscellaneous optimizations:\r\n<ul>\r\n<li>Faster loads of FP constants. Remove narrow-to-wide store-to-load\r\nforwarding stalls.</li>\r\n<li>Use (scalar) SSE2 ops (if the CPU supports it) to speed up slot moves\r\nand FP to integer conversions.</li>\r\n<li>Optimized the two-argument form of <tt>OP_CONCAT</tt> (<tt>a..b</tt>).</li>\r\n<li>Inlined <tt>OP_MOD</tt> (<tt>a%b</tt>).\r\nWith better accuracy than the C variant, too.</li>\r\n<li>Inlined <tt>OP_POW</tt> (<tt>a^b</tt>). Unroll <tt>x^k</tt> or\r\nuse <tt>k^x = 2^(log2(k)*x)</tt> or call <tt>pow()</tt>.</li>\r\n</ul></li>\r\n\r\n<li>Changes in the optimizer:\r\n<ul>\r\n<li>Improved hinting for table keys derived from table values\r\n(<tt>t1[t2[x]]</tt>).</li>\r\n<li>Lookup hinting now works with arbitrary object types and\r\nsupports index chains, too.</li>\r\n<li>Generate type hints for arithmetic and comparison operators,\r\nOP_LEN, OP_CONCAT and OP_FORPREP.</li>\r\n<li>Remove several hint definitions in favour of a generic COMBINE hint.</li>\r\n<li>Complete rewrite of <tt>jit.opt_inline</tt> module\r\n(ex <tt>jit.opt_lib</tt>).</li>\r\n</ul></li>\r\n\r\n<li>Use adaptive deoptimization:\r\n<ul>\r\n<li>If runtime verification of a contract fails, the affected\r\ninstruction is recompiled and patched on-the-fly.\r\nRegular programs will trigger deoptimization only occasionally.</li>\r\n<li>This avoids generating code for uncommon fallback cases\r\nmost of the time. Generated code is up to 30% smaller compared to\r\nLuaJIT&nbsp;1.0.3.</li>\r\n<li>Deoptimization is used for many opcodes and contracts:\r\n<ul>\r\n<li>OP_CALL, OP_TAILCALL: type mismatch for callable.</li>\r\n<li>Inlined calls: closure mismatch, parameter number and type mismatches.</li>\r\n<li>OP_GETTABLE, OP_SETTABLE: table or key type and range mismatches.</li>\r\n<li>All arithmetic and comparison operators, OP_LEN, OP_CONCAT,\r\nOP_FORPREP: operand type and range mismatches.</li>\r\n</ul></li>\r\n<li>Complete redesign of the debug and traceback info\r\n(bytecode &harr; mcode) to support deoptimization.\r\nMuch more flexible and needs only 50% of the space.</li>\r\n<li>The modules <tt>jit.trace</tt>, <tt>jit.dumphints</tt> and\r\n<tt>jit.dump</tt> handle deoptimization.</li>\r\n</ul></li>\r\n\r\n<li>Inlined many popular library functions\r\n(for commonly used arguments only):\r\n<ul>\r\n<li>Most <tt>math.*</tt> functions (the 18 most used ones)\r\n[2x-10x faster].</li>\r\n<li><tt>string.len</tt>, <tt>string.sub</tt> and <tt>string.char</tt>\r\n[2x-10x faster].</li>\r\n<li><tt>table.insert</tt>, <tt>table.remove</tt> and <tt>table.getn</tt>\r\n[3x-5x faster].</li>\r\n<li><tt>coroutine.yield</tt> and <tt>coroutine.resume</tt>\r\n[3x-5x faster].</li>\r\n<li><tt>pairs</tt>, <tt>ipairs</tt> and the corresponding iterators\r\n[8x-15x faster].</li>\r\n</ul></li>\r\n\r\n<li>Changes in the core and loadable modules and the stand-alone executable:\r\n<ul>\r\n<li>Added <tt>jit.version</tt>, <tt>jit.version_num</tt>\r\nand <tt>jit.arch</tt>.</li>\r\n<li>Reorganized some internal API functions (<tt>jit.util.*mcode*</tt>).</li>\r\n<li>The <tt>-j dump</tt> output now shows JSUB names, too.</li>\r\n<li>New x86 disassembler module written in pure Lua. No dependency\r\non ndisasm anymore. Flexible API, very compact (500 lines)\r\nand complete (x87, MMX, SSE, SSE2, SSE3, SSSE3, privileged instructions).</li>\r\n<li><tt>luajit -v</tt> prints the LuaJIT version and copyright\r\non a separate line.</li>\r\n</ul></li>\r\n\r\n<li>Added SSE, SSE2, SSE3 and SSSE3 support to DynASM.</li>\r\n<li>Miscellaneous doc changes. Added a section about\r\n<a href=\"install.html#embedding\">embedding LuaJIT</a>.</li>\r\n</ul>\r\n<p>\r\nThis release is in sync with Coco 1.1.0 (see the\r\n<a href=\"http://coco.luajit.org/changes.html\"><span class=\"ext\">&raquo;</span>&nbsp;Coco Change History</a>).\r\n</p>\r\n</div>\r\n\r\n<div class=\"major\" style=\"background: #ffffd0;\">\r\n<h2 id=\"LuaJIT-1.0.3\">LuaJIT 1.0.3 &mdash; 2005-09-08</h2>\r\n<ul>\r\n<li>Even more docs.</li>\r\n<li>Unified closure checks in <tt>jit.*</tt>.</li>\r\n<li>Fixed some range checks in <tt>jit.util.*</tt>.</li>\r\n<li>Fixed __newindex call originating from <tt>jit_settable_str()</tt>.</li>\r\n<li>Merged with Lua 5.1 alpha (including early bug fixes).</li>\r\n</ul>\r\n<p>\r\nThis is the first public release of LuaJIT.\r\n</p>\r\n\r\n<h2 id=\"LuaJIT-1.0.2\">LuaJIT 1.0.2 &mdash; 2005-09-02</h2>\r\n<ul>\r\n<li>Add support for flushing the Valgrind translation cache <br>\r\n(<tt>MYCFLAGS= -DUSE_VALGRIND</tt>).</li>\r\n<li>Add support for freeing executable mcode memory to the <tt>mmap()</tt>-based\r\nvariant for POSIX systems.</li>\r\n<li>Reorganized the C&nbsp;function signature handling in\r\n<tt>jit.opt_lib</tt>.</li>\r\n<li>Changed to index-based hints for inlining C&nbsp;functions.\r\nStill no support in the backend for inlining.</li>\r\n<li>Hardcode <tt>HEAP_CREATE_ENABLE_EXECUTE</tt> value if undefined.</li>\r\n<li>Misc. changes to the <tt>jit.*</tt> modules.</li>\r\n<li>Misc. changes to the Makefiles.</li>\r\n<li>Lots of new docs.</li>\r\n<li>Complete doc reorg.</li>\r\n</ul>\r\n<p>\r\nNot released because Lua 5.1 alpha came out today.\r\n</p>\r\n\r\n<h2 id=\"LuaJIT-1.0.1\">LuaJIT 1.0.1 &mdash; 2005-08-31</h2>\r\n<ul>\r\n<li>Missing GC step in <tt>OP_CONCAT</tt>.</li>\r\n<li>Fix result handling for C &ndash;> JIT calls.</li>\r\n<li>Detect CPU feature bits.</li>\r\n<li>Encode conditional moves (<tt>fucomip</tt>) only when supported.</li>\r\n<li>Add fallback instructions for FP compares.</li>\r\n<li>Add support for <tt>LUA_COMPAT_VARARG</tt>. Still disabled by default.</li>\r\n<li>MSVC needs a specific place for the <tt>CALLBACK</tt> attribute\r\n(David Burgess).</li>\r\n<li>Misc. doc updates.</li>\r\n</ul>\r\n<p>\r\nInterim non-public release.\r\nSpecial thanks to Adam D. Moss for reporting most of the bugs.\r\n</p>\r\n\r\n<h2 id=\"LuaJIT-1.0.0\">LuaJIT 1.0.0 &mdash; 2005-08-29</h2>\r\n<p>\r\nThis is the initial non-public release of LuaJIT.\r\n</p>\r\n</div>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/contact.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Contact</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Contact</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nPlease send general questions to the\r\n<a href=\"http://luajit.org/list.html\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT mailing list</a>.\r\nYou can also send any questions you have directly to me:\r\n</p>\r\n\r\n<script type=\"text/javascript\">\r\n<!--\r\nvar xS=\"@-:\\\" .0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ<abc>defghijklmnopqrstuvwxyz\";function xD(s)\r\n{var len=s.length;var r=\"\";for(var i=0;i<len;i++)\r\n{var c=s.charAt(i);var n=xS.indexOf(c);if(n!=-1)c=xS.charAt(69-n);r+=c;}\r\ndocument.write(\"<\"+\"p>\"+r+\"<\"+\"/p>\\n\");}\r\n//-->\r\n</script>\r\n<script type=\"text/javascript\">\r\n<!--\r\nxD(\"fyZKB8xv\\\"FJytmz8.KAB0u52D\")\r\n//--></script>\r\n<noscript>\r\n<p><img src=\"img/contact.png\" alt=\"Contact info in image\" width=\"170\" height=\"13\">\r\n</p>\r\n</noscript>\r\n\r\n<h2>Copyright</h2>\r\n<p>\r\nAll documentation is\r\nCopyright &copy; 2005-2015 Mike Pall.\r\n</p>\r\n\r\n\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_c_api.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Lua/C API Extensions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Lua/C API Extensions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT adds some extensions to the standard Lua/C API. The LuaJIT include\r\ndirectory must be in the compiler search path (<tt>-I<i>path</i></tt>)\r\nto be able to include the required header for C code:\r\n</p>\r\n<pre class=\"code\">\r\n#include \"luajit.h\"\r\n</pre>\r\n<p>\r\nOr for C++ code:\r\n</p>\r\n<pre class=\"code\">\r\n#include \"lua.hpp\"\r\n</pre>\r\n\r\n<h2 id=\"luaJIT_setmode\"><tt>luaJIT_setmode(L, idx, mode)</tt>\r\n&mdash; Control VM</h2>\r\n<p>\r\nThis is a C API extension to allow control of the VM from C code. The\r\nfull prototype of <tt>LuaJIT_setmode</tt> is:\r\n</p>\r\n<pre class=\"code\">\r\nLUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);\r\n</pre>\r\n<p>\r\nThe returned status is either success (<tt>1</tt>) or failure (<tt>0</tt>).\r\nThe second argument is either <tt>0</tt> or a stack index (similar to the\r\nother Lua/C API functions).\r\n</p>\r\n<p>\r\nThe third argument specifies the mode, which is 'or'ed with a flag.\r\nThe flag can be <tt>LUAJIT_MODE_OFF</tt> to turn a feature on,\r\n<tt>LUAJIT_MODE_ON</tt> to turn a feature off, or\r\n<tt>LUAJIT_MODE_FLUSH</tt> to flush cached code.\r\n</p>\r\n<p>\r\nThe following modes are defined:\r\n</p>\r\n\r\n<h3 id=\"mode_engine\"><tt>luaJIT_setmode(L, 0, LUAJIT_MODE_ENGINE|flag)</tt></h3>\r\n<p>\r\nTurn the whole JIT compiler on or off or flush the whole cache of compiled code.\r\n</p>\r\n\r\n<h3 id=\"mode_func\"><tt>luaJIT_setmode(L, idx, LUAJIT_MODE_FUNC|flag)</tt><br>\r\n<tt>luaJIT_setmode(L, idx, LUAJIT_MODE_ALLFUNC|flag)</tt><br>\r\n<tt>luaJIT_setmode(L, idx, LUAJIT_MODE_ALLSUBFUNC|flag)</tt></h3>\r\n<p>\r\nThis sets the mode for the function at the stack index <tt>idx</tt> or\r\nthe parent of the calling function (<tt>idx = 0</tt>). It either\r\nenables JIT compilation for a function, disables it and flushes any\r\nalready compiled code or only flushes already compiled code. This\r\napplies recursively to all sub-functions of the function with\r\n<tt>LUAJIT_MODE_ALLFUNC</tt> or only to the sub-functions with\r\n<tt>LUAJIT_MODE_ALLSUBFUNC</tt>.\r\n</p>\r\n\r\n<h3 id=\"mode_trace\"><tt>luaJIT_setmode(L, trace,<br>\r\n&nbsp;&nbsp;LUAJIT_MODE_TRACE|LUAJIT_MODE_FLUSH)</tt></h3>\r\n<p>\r\nFlushes the specified root trace and all of its side traces from the cache.\r\nThe code for the trace will be retained as long as there are any other\r\ntraces which link to it.\r\n</p>\r\n\r\n<h3 id=\"mode_wrapcfunc\"><tt>luaJIT_setmode(L, idx, LUAJIT_MODE_WRAPCFUNC|flag)</tt></h3>\r\n<p>\r\nThis mode defines a wrapper function for calls to C functions. If\r\ncalled with <tt>LUAJIT_MODE_ON</tt>, the stack index at <tt>idx</tt>\r\nmust be a <tt>lightuserdata</tt> object holding a pointer to the wrapper\r\nfunction. From now on all C functions are called through the wrapper\r\nfunction. If called with <tt>LUAJIT_MODE_OFF</tt> this mode is turned\r\noff and all C functions are directly called.\r\n</p>\r\n<p>\r\nThe wrapper function can be used for debugging purposes or to catch\r\nand convert foreign exceptions. But please read the section on\r\n<a href=\"extensions.html#exceptions\">C++&nbsp;exception interoperability</a>\r\nfirst. Recommended usage can be seen in this C++ code excerpt:\r\n</p>\r\n<pre class=\"code\">\r\n#include &lt;exception&gt;\r\n#include \"lua.hpp\"\r\n\r\n// Catch C++ exceptions and convert them to Lua error messages.\r\n// Customize as needed for your own exception classes.\r\nstatic int wrap_exceptions(lua_State *L, lua_CFunction f)\r\n{\r\n  try {\r\n    return f(L);  // Call wrapped function and return result.\r\n  } catch (const char *s) {  // Catch and convert exceptions.\r\n    lua_pushstring(L, s);\r\n  } catch (std::exception& e) {\r\n    lua_pushstring(L, e.what());\r\n  } catch (...) {\r\n    lua_pushliteral(L, \"caught (...)\");\r\n  }\r\n  return lua_error(L);  // Rethrow as a Lua error.\r\n}\r\n\r\nstatic int myinit(lua_State *L)\r\n{\r\n  ...\r\n  // Define wrapper function and enable it.\r\n  lua_pushlightuserdata(L, (void *)wrap_exceptions);\r\n  luaJIT_setmode(L, -1, LUAJIT_MODE_WRAPCFUNC|LUAJIT_MODE_ON);\r\n  lua_pop(L, 1);\r\n  ...\r\n}\r\n</pre>\r\n<p>\r\nNote that you can only define <b>a single global wrapper function</b>,\r\nso be careful when using this mechanism from multiple C++ modules.\r\nAlso note that this mechanism is not without overhead.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_ffi.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Library</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Library</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\n\r\nThe FFI library allows <b>calling external C&nbsp;functions</b> and\r\n<b>using C&nbsp;data structures</b> from pure Lua code.\r\n\r\n</p>\r\n<p>\r\n\r\nThe FFI library largely obviates the need to write tedious manual\r\nLua/C bindings in C. No need to learn a separate binding language\r\n&mdash; <b>it parses plain C&nbsp;declarations!</b> These can be\r\ncut-n-pasted from C&nbsp;header files or reference manuals. It's up to\r\nthe task of binding large libraries without the need for dealing with\r\nfragile binding generators.\r\n\r\n</p>\r\n<p>\r\nThe FFI library is tightly integrated into LuaJIT (it's not available\r\nas a separate module). The code generated by the JIT-compiler for\r\naccesses to C&nbsp;data structures from Lua code is on par with the\r\ncode a C&nbsp;compiler would generate. Calls to C&nbsp;functions can\r\nbe inlined in JIT-compiled code, unlike calls to functions bound via\r\nthe classic Lua/C API.\r\n</p>\r\n<p>\r\nThis page gives a short introduction to the usage of the FFI library.\r\n<em>Please use the FFI sub-topics in the navigation bar to learn more.</em>\r\n</p>\r\n\r\n<h2 id=\"call\">Motivating Example: Calling External C Functions</h2>\r\n<p>\r\nIt's really easy to call an external C&nbsp;library function:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&#9312;\r\n&#9313;\r\n\r\n\r\n&#9314;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">int printf(const char *fmt, ...);</span>\r\n]]\r\nffi.C.printf(\"Hello %s!\", \"world\")\r\n</pre>\r\n<p>\r\nSo, let's pick that apart:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> Load the FFI library.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> Add a C&nbsp;declaration\r\nfor the function. The part inside the double-brackets (in green) is\r\njust standard C&nbsp;syntax.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Call the named\r\nC&nbsp;function &mdash; Yes, it's that simple!\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nActually, what goes on behind the scenes is far from simple: <span\r\nstyle=\"color:#4040c0;\">&#9314;</span> makes use of the standard\r\nC&nbsp;library namespace <tt>ffi.C</tt>. Indexing this namespace with\r\na symbol name (<tt>\"printf\"</tt>) automatically binds it to the\r\nstandard C&nbsp;library. The result is a special kind of object which,\r\nwhen called, runs the <tt>printf</tt> function. The arguments passed\r\nto this function are automatically converted from Lua objects to the\r\ncorresponding C&nbsp;types.\r\n</p>\r\n<p>\r\nOk, so maybe the use of <tt>printf()</tt> wasn't such a spectacular\r\nexample. You could have done that with <tt>io.write()</tt> and\r\n<tt>string.format()</tt>, too. But you get the idea ...\r\n</p>\r\n<p>\r\nSo here's something to pop up a message box on Windows:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">int MessageBoxA(void *w, const char *txt, const char *cap, int type);</span>\r\n]]\r\nffi.C.MessageBoxA(nil, \"Hello world!\", \"Test\", 0)\r\n</pre>\r\n<p>\r\nBing! Again, that was far too easy, no?\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nCompare this with the effort required to bind that function using the\r\nclassic Lua/C API: create an extra C&nbsp;file, add a C&nbsp;function\r\nthat retrieves and checks the argument types passed from Lua and calls\r\nthe actual C&nbsp;function, add a list of module functions and their\r\nnames, add a <tt>luaopen_*</tt> function and register all module\r\nfunctions, compile and link it into a shared library (DLL), move it to\r\nthe proper path, add Lua code that loads the module aaaand ... finally\r\ncall the binding function. Phew!\r\n</p>\r\n\r\n<h2 id=\"cdata\">Motivating Example: Using C Data Structures</h2>\r\n<p>\r\nThe FFI library allows you to create and access C&nbsp;data\r\nstructures. Of course the main use for this is for interfacing with\r\nC&nbsp;functions. But they can be used stand-alone, too.\r\n</p>\r\n<p>\r\nLua is built upon high-level data types. They are flexible, extensible\r\nand dynamic. That's why we all love Lua so much. Alas, this can be\r\ninefficient for certain tasks, where you'd really want a low-level\r\ndata type. E.g. a large array of a fixed structure needs to be\r\nimplemented with a big table holding lots of tiny tables. This imposes\r\nboth a substantial memory overhead as well as a performance overhead.\r\n</p>\r\n<p>\r\nHere's a sketch of a library that operates on color images plus a\r\nsimple benchmark. First, the plain Lua version:\r\n</p>\r\n<pre class=\"code\">\r\nlocal floor = math.floor\r\n\r\nlocal function image_ramp_green(n)\r\n  local img = {}\r\n  local f = 255/(n-1)\r\n  for i=1,n do\r\n    img[i] = { red = 0, green = floor((i-1)*f), blue = 0, alpha = 255 }\r\n  end\r\n  return img\r\nend\r\n\r\nlocal function image_to_grey(img, n)\r\n  for i=1,n do\r\n    local y = floor(0.3*img[i].red + 0.59*img[i].green + 0.11*img[i].blue)\r\n    img[i].red = y; img[i].green = y; img[i].blue = y\r\n  end\r\nend\r\n\r\nlocal N = 400*400\r\nlocal img = image_ramp_green(N)\r\nfor i=1,1000 do\r\n  image_to_grey(img, N)\r\nend\r\n</pre>\r\n<p>\r\nThis creates a table with 160.000 pixels, each of which is a table\r\nholding four number values in the range of 0-255. First an image with\r\na green ramp is created (1D for simplicity), then the image is\r\nconverted to greyscale 1000 times. Yes, that's silly, but I was in\r\nneed of a simple example ...\r\n</p>\r\n<p>\r\nAnd here's the FFI version. The modified parts have been marked in\r\nbold:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&#9312;\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n\r\n&#9314;\r\n&#9315;\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9314;\r\n&#9316;</span><b>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n</b><span style=\"color:#00a000;\">typedef struct { uint8_t red, green, blue, alpha; } rgba_pixel;</span><b>\r\n]]</b>\r\n\r\nlocal function image_ramp_green(n)\r\n  <b>local img = ffi.new(\"rgba_pixel[?]\", n)</b>\r\n  local f = 255/(n-1)\r\n  for i=<b>0,n-1</b> do\r\n    <b>img[i].green = i*f</b>\r\n    <b>img[i].alpha = 255</b>\r\n  end\r\n  return img\r\nend\r\n\r\nlocal function image_to_grey(img, n)\r\n  for i=<b>0,n-1</b> do\r\n    local y = <b>0.3*img[i].red + 0.59*img[i].green + 0.11*img[i].blue</b>\r\n    img[i].red = y; img[i].green = y; img[i].blue = y\r\n  end\r\nend\r\n\r\nlocal N = 400*400\r\nlocal img = image_ramp_green(N)\r\nfor i=1,1000 do\r\n  image_to_grey(img, N)\r\nend\r\n</pre>\r\n<p>\r\nOk, so that wasn't too difficult:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> First, load the FFI\r\nlibrary and declare the low-level data type. Here we choose a\r\n<tt>struct</tt> which holds four byte fields, one for each component\r\nof a 4x8&nbsp;bit RGBA pixel.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> Creating the data\r\nstructure with <tt>ffi.new()</tt> is straightforward &mdash; the\r\n<tt>'?'</tt> is a placeholder for the number of elements of a\r\nvariable-length array.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> C&nbsp;arrays are\r\nzero-based, so the indexes have to run from <tt>0</tt> to\r\n<tt>n-1</tt>. One might want to allocate one more element instead to\r\nsimplify converting legacy code.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> Since <tt>ffi.new()</tt>\r\nzero-fills the array by default, we only need to set the green and the\r\nalpha fields.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> The calls to\r\n<tt>math.floor()</tt> can be omitted here, because floating-point\r\nnumbers are already truncated towards zero when converting them to an\r\ninteger. This happens implicitly when the number is stored in the\r\nfields of each pixel.\r\n</p>\r\n<p>\r\nNow let's have a look at the impact of the changes: first, memory\r\nconsumption for the image is down from 22&nbsp;Megabytes to\r\n640&nbsp;Kilobytes (400*400*4 bytes). That's a factor of 35x less! So,\r\nyes, tables do have a noticeable overhead. BTW: The original program\r\nwould consume 40&nbsp;Megabytes in plain Lua (on x64).\r\n</p>\r\n<p>\r\nNext, performance: the pure Lua version runs in 9.57 seconds (52.9\r\nseconds with the Lua interpreter) and the FFI version runs in 0.48\r\nseconds on my machine (YMMV). That's a factor of 20x faster (110x\r\nfaster than the Lua interpreter).\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nThe avid reader may notice that converting the pure Lua version over\r\nto use array indexes for the colors (<tt>[1]</tt> instead of\r\n<tt>.red</tt>, <tt>[2]</tt> instead of <tt>.green</tt> etc.) ought to\r\nbe more compact and faster. This is certainly true (by a factor of\r\n~1.7x). Switching to a struct-of-arrays would help, too.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nHowever the resulting code would be less idiomatic and rather\r\nerror-prone. And it still doesn't get even close to the performance of\r\nthe FFI version of the code. Also, high-level data structures cannot\r\nbe easily passed to other C&nbsp;functions, especially I/O functions,\r\nwithout undue conversion penalties.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_ffi_api.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>ffi.* API Functions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.abitable { width: 30em; line-height: 1.2; }\r\ntr.abihead td { font-weight: bold; }\r\ntd.abiparam { font-weight: bold; width: 6em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1><tt>ffi.*</tt> API Functions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page describes the API functions provided by the FFI library in\r\ndetail. It's recommended to read through the\r\n<a href=\"ext_ffi.html\">introduction</a> and the\r\n<a href=\"ext_ffi_tutorial.html\">FFI tutorial</a> first.\r\n</p>\r\n\r\n<h2 id=\"glossary\">Glossary</h2>\r\n<ul>\r\n<li><b>cdecl</b> &mdash; An abstract C&nbsp;type declaration (a Lua\r\nstring).</li>\r\n<li><b>ctype</b> &mdash; A C&nbsp;type object. This is a special kind of\r\n<b>cdata</b> returned by <tt>ffi.typeof()</tt>. It serves as a\r\n<b>cdata</b> <a href=\"#ffi_new\">constructor</a> when called.</li>\r\n<li><b>cdata</b> &mdash; A C&nbsp;data object. It holds a value of the\r\ncorresponding <b>ctype</b>.</li>\r\n<li><b>ct</b> &mdash; A C&nbsp;type specification which can be used for\r\nmost of the API functions. Either a <b>cdecl</b>, a <b>ctype</b> or a\r\n<b>cdata</b> serving as a template type.</li>\r\n<li><b>cb</b> &mdash; A callback object. This is a C&nbsp;data object\r\nholding a special function pointer. Calling this function from\r\nC&nbsp;code runs an associated Lua function.</li>\r\n<li><b>VLA</b> &mdash; A variable-length array is declared with a\r\n<tt>?</tt> instead of the number of elements, e.g. <tt>\"int[?]\"</tt>.\r\nThe number of elements (<tt>nelem</tt>) must be given when it's\r\n<a href=\"#ffi_new\">created</a>.</li>\r\n<li><b>VLS</b> &mdash; A variable-length struct is a <tt>struct</tt> C\r\ntype where the last element is a <b>VLA</b>. The same rules for\r\ndeclaration and creation apply.</li>\r\n</ul>\r\n\r\n<h2 id=\"decl\">Declaring and Accessing External Symbols</h2>\r\n<p>\r\nExternal symbols must be declared first and can then be accessed by\r\nindexing a <a href=\"ext_ffi_semantics.html#clib\">C&nbsp;library\r\nnamespace</a>, which automatically binds the symbol to a specific\r\nlibrary.\r\n</p>\r\n\r\n<h3 id=\"ffi_cdef\"><tt>ffi.cdef(def)</tt></h3>\r\n<p>\r\nAdds multiple C&nbsp;declarations for types or external symbols (named\r\nvariables or functions). <tt>def</tt> must be a Lua string. It's\r\nrecommended to use the syntactic sugar for string arguments as\r\nfollows:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">typedef struct foo { int a, b; } foo_t;  // Declare a struct and typedef.\r\nint dofoo(foo_t *f, int n);  /* Declare an external C function. */</span>\r\n]]\r\n</pre>\r\n<p>\r\nThe contents of the string (the part in green above) must be a\r\nsequence of\r\n<a href=\"ext_ffi_semantics.html#clang\">C&nbsp;declarations</a>,\r\nseparated by semicolons. The trailing semicolon for a single\r\ndeclaration may be omitted.\r\n</p>\r\n<p>\r\nPlease note that external symbols are only <em>declared</em>, but they\r\nare <em>not bound</em> to any specific address, yet. Binding is\r\nachieved with C&nbsp;library namespaces (see below).\r\n</p>\r\n<p style=\"color: #c00000;\">\r\nC&nbsp;declarations are not passed through a C&nbsp;pre-processor,\r\nyet. No pre-processor tokens are allowed, except for\r\n<tt>#pragma&nbsp;pack</tt>. Replace <tt>#define</tt> in existing\r\nC&nbsp;header files with <tt>enum</tt>, <tt>static&nbsp;const</tt>\r\nor <tt>typedef</tt> and/or pass the files through an external\r\nC&nbsp;pre-processor (once). Be careful not to include unneeded or\r\nredundant declarations from unrelated header files.\r\n</p>\r\n\r\n<h3 id=\"ffi_C\"><tt>ffi.C</tt></h3>\r\n<p>\r\nThis is the default C&nbsp;library namespace &mdash; note the\r\nuppercase <tt>'C'</tt>. It binds to the default set of symbols or\r\nlibraries on the target system. These are more or less the same as a\r\nC&nbsp;compiler would offer by default, without specifying extra link\r\nlibraries.\r\n</p>\r\n<p>\r\nOn POSIX systems, this binds to symbols in the default or global\r\nnamespace. This includes all exported symbols from the executable and\r\nany libraries loaded into the global namespace. This includes at least\r\n<tt>libc</tt>, <tt>libm</tt>, <tt>libdl</tt> (on Linux),\r\n<tt>libgcc</tt> (if compiled with GCC), as well as any exported\r\nsymbols from the Lua/C&nbsp;API provided by LuaJIT itself.\r\n</p>\r\n<p>\r\nOn Windows systems, this binds to symbols exported from the\r\n<tt>*.exe</tt>, the <tt>lua51.dll</tt> (i.e. the Lua/C&nbsp;API\r\nprovided by LuaJIT itself), the C&nbsp;runtime library LuaJIT was linked\r\nwith (<tt>msvcrt*.dll</tt>), <tt>kernel32.dll</tt>,\r\n<tt>user32.dll</tt> and <tt>gdi32.dll</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_load\"><tt>clib = ffi.load(name [,global])</tt></h3>\r\n<p>\r\nThis loads the dynamic library given by <tt>name</tt> and returns\r\na new C&nbsp;library namespace which binds to its symbols. On POSIX\r\nsystems, if <tt>global</tt> is <tt>true</tt>, the library symbols are\r\nloaded into the global namespace, too.\r\n</p>\r\n<p>\r\nIf <tt>name</tt> is a path, the library is loaded from this path.\r\nOtherwise <tt>name</tt> is canonicalized in a system-dependent way and\r\nsearched in the default search path for dynamic libraries:\r\n</p>\r\n<p>\r\nOn POSIX systems, if the name contains no dot, the extension\r\n<tt>.so</tt> is appended. Also, the <tt>lib</tt> prefix is prepended\r\nif necessary. So <tt>ffi.load(\"z\")</tt> looks for <tt>\"libz.so\"</tt>\r\nin the default shared library search path.\r\n</p>\r\n<p>\r\nOn Windows systems, if the name contains no dot, the extension\r\n<tt>.dll</tt> is appended. So <tt>ffi.load(\"ws2_32\")</tt> looks for\r\n<tt>\"ws2_32.dll\"</tt> in the default DLL search path.\r\n</p>\r\n\r\n<h2 id=\"create\">Creating cdata Objects</h2>\r\n<p>\r\nThe following API functions create cdata objects (<tt>type()</tt>\r\nreturns <tt>\"cdata\"</tt>). All created cdata objects are\r\n<a href=\"ext_ffi_semantics.html#gc\">garbage collected</a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_new\"><tt>cdata = ffi.new(ct [,nelem] [,init...])<br>\r\ncdata = <em>ctype</em>([nelem,] [init...])</tt></h3>\r\n<p>\r\nCreates a cdata object for the given <tt>ct</tt>. VLA/VLS types\r\nrequire the <tt>nelem</tt> argument. The second syntax uses a ctype as\r\na constructor and is otherwise fully equivalent.\r\n</p>\r\n<p>\r\nThe cdata object is initialized according to the\r\n<a href=\"ext_ffi_semantics.html#init\">rules for initializers</a>,\r\nusing the optional <tt>init</tt> arguments. Excess initializers cause\r\nan error.\r\n</p>\r\n<p>\r\nPerformance notice: if you want to create many objects of one kind,\r\nparse the cdecl only once and get its ctype with\r\n<tt>ffi.typeof()</tt>. Then use the ctype as a constructor repeatedly.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nPlease note that an anonymous <tt>struct</tt> declaration implicitly\r\ncreates a new and distinguished ctype every time you use it for\r\n<tt>ffi.new()</tt>. This is probably <b>not</b> what you want,\r\nespecially if you create more than one cdata object. Different anonymous\r\n<tt>structs</tt> are not considered assignment-compatible by the\r\nC&nbsp;standard, even though they may have the same fields! Also, they\r\nare considered different types by the JIT-compiler, which may cause an\r\nexcessive number of traces. It's strongly suggested to either declare\r\na named <tt>struct</tt> or <tt>typedef</tt> with <tt>ffi.cdef()</tt>\r\nor to create a single ctype object for an anonymous <tt>struct</tt>\r\nwith <tt>ffi.typeof()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_typeof\"><tt>ctype = ffi.typeof(ct)</tt></h3>\r\n<p>\r\nCreates a ctype object for the given <tt>ct</tt>.\r\n</p>\r\n<p>\r\nThis function is especially useful to parse a cdecl only once and then\r\nuse the resulting ctype object as a <a href=\"#ffi_new\">constructor</a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_cast\"><tt>cdata = ffi.cast(ct, init)</tt></h3>\r\n<p>\r\nCreates a scalar cdata object for the given <tt>ct</tt>. The cdata\r\nobject is initialized with <tt>init</tt> using the \"cast\" variant of\r\nthe <a href=\"ext_ffi_semantics.html#convert\">C&nbsp;type conversion\r\nrules</a>.\r\n</p>\r\n<p>\r\nThis functions is mainly useful to override the pointer compatibility\r\nchecks or to convert pointers to addresses or vice versa.\r\n</p>\r\n\r\n<h3 id=\"ffi_metatype\"><tt>ctype = ffi.metatype(ct, metatable)</tt></h3>\r\n<p>\r\nCreates a ctype object for the given <tt>ct</tt> and associates it with\r\na metatable. Only <tt>struct</tt>/<tt>union</tt> types, complex numbers\r\nand vectors are allowed. Other types may be wrapped in a\r\n<tt>struct</tt>, if needed.\r\n</p>\r\n<p>\r\nThe association with a metatable is permanent and cannot be changed\r\nafterwards. Neither the contents of the <tt>metatable</tt> nor the\r\ncontents of an <tt>__index</tt> table (if any) may be modified\r\nafterwards. The associated metatable automatically applies to all uses\r\nof this type, no matter how the objects are created or where they\r\noriginate from. Note that pre-defined operations on types have\r\nprecedence (e.g. declared field names cannot be overriden).\r\n</p>\r\n<p>\r\nAll standard Lua metamethods are implemented. These are called directly,\r\nwithout shortcuts and on any mix of types. For binary operations, the\r\nleft operand is checked first for a valid ctype metamethod. The\r\n<tt>__gc</tt> metamethod only applies to <tt>struct</tt>/<tt>union</tt>\r\ntypes and performs an implicit <a href=\"#ffi_gc\"><tt>ffi.gc()</tt></a>\r\ncall during creation of an instance.\r\n</p>\r\n\r\n<h3 id=\"ffi_gc\"><tt>cdata = ffi.gc(cdata, finalizer)</tt></h3>\r\n<p>\r\nAssociates a finalizer with a pointer or aggregate cdata object. The\r\ncdata object is returned unchanged.\r\n</p>\r\n<p>\r\nThis function allows safe integration of unmanaged resources into the\r\nautomatic memory management of the LuaJIT garbage collector. Typical\r\nusage:\r\n</p>\r\n<pre class=\"code\">\r\nlocal p = ffi.gc(ffi.C.malloc(n), ffi.C.free)\r\n...\r\np = nil -- Last reference to p is gone.\r\n-- GC will eventually run finalizer: ffi.C.free(p)\r\n</pre>\r\n<p>\r\nA cdata finalizer works like the <tt>__gc</tt> metamethod for userdata\r\nobjects: when the last reference to a cdata object is gone, the\r\nassociated finalizer is called with the cdata object as an argument. The\r\nfinalizer can be a Lua function or a cdata function or cdata function\r\npointer. An existing finalizer can be removed by setting a <tt>nil</tt>\r\nfinalizer, e.g. right before explicitly deleting a resource:\r\n</p>\r\n<pre class=\"code\">\r\nffi.C.free(ffi.gc(p, nil)) -- Manually free the memory.\r\n</pre>\r\n\r\n<h2 id=\"info\">C&nbsp;Type Information</h2>\r\n<p>\r\nThe following API functions return information about C&nbsp;types.\r\nThey are most useful for inspecting cdata objects.\r\n</p>\r\n\r\n<h3 id=\"ffi_sizeof\"><tt>size = ffi.sizeof(ct [,nelem])</tt></h3>\r\n<p>\r\nReturns the size of <tt>ct</tt> in bytes. Returns <tt>nil</tt> if\r\nthe size is not known (e.g. for <tt>\"void\"</tt> or function types).\r\nRequires <tt>nelem</tt> for VLA/VLS types, except for cdata objects.\r\n</p>\r\n\r\n<h3 id=\"ffi_alignof\"><tt>align = ffi.alignof(ct)</tt></h3>\r\n<p>\r\nReturns the minimum required alignment for <tt>ct</tt> in bytes.\r\n</p>\r\n\r\n<h3 id=\"ffi_offsetof\"><tt>ofs [,bpos,bsize] = ffi.offsetof(ct, field)</tt></h3>\r\n<p>\r\nReturns the offset (in bytes) of <tt>field</tt> relative to the start\r\nof <tt>ct</tt>, which must be a <tt>struct</tt>. Additionally returns\r\nthe position and the field size (in bits) for bit fields.\r\n</p>\r\n\r\n<h3 id=\"ffi_istype\"><tt>status = ffi.istype(ct, obj)</tt></h3>\r\n<p>\r\nReturns <tt>true</tt> if <tt>obj</tt> has the C&nbsp;type given by\r\n<tt>ct</tt>. Returns <tt>false</tt> otherwise.\r\n</p>\r\n<p>\r\nC&nbsp;type qualifiers (<tt>const</tt> etc.) are ignored. Pointers are\r\nchecked with the standard pointer compatibility rules, but without any\r\nspecial treatment for <tt>void&nbsp;*</tt>. If <tt>ct</tt> specifies a\r\n<tt>struct</tt>/<tt>union</tt>, then a pointer to this type is accepted,\r\ntoo. Otherwise the types must match exactly.\r\n</p>\r\n<p>\r\nNote: this function accepts all kinds of Lua objects for the\r\n<tt>obj</tt> argument, but always returns <tt>false</tt> for non-cdata\r\nobjects.\r\n</p>\r\n\r\n<h2 id=\"util\">Utility Functions</h2>\r\n\r\n<h3 id=\"ffi_errno\"><tt>err = ffi.errno([newerr])</tt></h3>\r\n<p>\r\nReturns the error number set by the last C&nbsp;function call which\r\nindicated an error condition. If the optional <tt>newerr</tt> argument\r\nis present, the error number is set to the new value and the previous\r\nvalue is returned.\r\n</p>\r\n<p>\r\nThis function offers a portable and OS-independent way to get and set the\r\nerror number. Note that only <em>some</em> C&nbsp;functions set the error\r\nnumber. And it's only significant if the function actually indicated an\r\nerror condition (e.g. with a return value of <tt>-1</tt> or\r\n<tt>NULL</tt>). Otherwise, it may or may not contain any previously set\r\nvalue.\r\n</p>\r\n<p>\r\nYou're advised to call this function only when needed and as close as\r\npossible after the return of the related C&nbsp;function. The\r\n<tt>errno</tt> value is preserved across hooks, memory allocations,\r\ninvocations of the JIT compiler and other internal VM activity. The same\r\napplies to the value returned by <tt>GetLastError()</tt> on Windows, but\r\nyou need to declare and call it yourself.\r\n</p>\r\n\r\n<h3 id=\"ffi_string\"><tt>str = ffi.string(ptr [,len])</tt></h3>\r\n<p>\r\nCreates an interned Lua string from the data pointed to by\r\n<tt>ptr</tt>.\r\n</p>\r\n<p>\r\nIf the optional argument <tt>len</tt> is missing, <tt>ptr</tt> is\r\nconverted to a <tt>\"char&nbsp;*\"</tt> and the data is assumed to be\r\nzero-terminated. The length of the string is computed with\r\n<tt>strlen()</tt>.\r\n</p>\r\n<p>\r\nOtherwise <tt>ptr</tt> is converted to a <tt>\"void&nbsp;*\"</tt> and\r\n<tt>len</tt> gives the length of the data. The data may contain\r\nembedded zeros and need not be byte-oriented (though this may cause\r\nendianess issues).\r\n</p>\r\n<p>\r\nThis function is mainly useful to convert (temporary)\r\n<tt>\"const&nbsp;char&nbsp;*\"</tt> pointers returned by\r\nC&nbsp;functions to Lua strings and store them or pass them to other\r\nfunctions expecting a Lua string. The Lua string is an (interned) copy\r\nof the data and bears no relation to the original data area anymore.\r\nLua strings are 8&nbsp;bit clean and may be used to hold arbitrary,\r\nnon-character data.\r\n</p>\r\n<p>\r\nPerformance notice: it's faster to pass the length of the string, if\r\nit's known. E.g. when the length is returned by a C&nbsp;call like\r\n<tt>sprintf()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_copy\"><tt>ffi.copy(dst, src, len)<br>\r\nffi.copy(dst, str)</tt></h3>\r\n<p>\r\nCopies the data pointed to by <tt>src</tt> to <tt>dst</tt>.\r\n<tt>dst</tt> is converted to a <tt>\"void&nbsp;*\"</tt> and <tt>src</tt>\r\nis converted to a <tt>\"const void&nbsp;*\"</tt>.\r\n</p>\r\n<p>\r\nIn the first syntax, <tt>len</tt> gives the number of bytes to copy.\r\nCaveat: if <tt>src</tt> is a Lua string, then <tt>len</tt> must not\r\nexceed <tt>#src+1</tt>.\r\n</p>\r\n<p>\r\nIn the second syntax, the source of the copy must be a Lua string. All\r\nbytes of the string <em>plus a zero-terminator</em> are copied to\r\n<tt>dst</tt> (i.e. <tt>#src+1</tt> bytes).\r\n</p>\r\n<p>\r\nPerformance notice: <tt>ffi.copy()</tt> may be used as a faster\r\n(inlinable) replacement for the C&nbsp;library functions\r\n<tt>memcpy()</tt>, <tt>strcpy()</tt> and <tt>strncpy()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_fill\"><tt>ffi.fill(dst, len [,c])</tt></h3>\r\n<p>\r\nFills the data pointed to by <tt>dst</tt> with <tt>len</tt> constant\r\nbytes, given by <tt>c</tt>. If <tt>c</tt> is omitted, the data is\r\nzero-filled.\r\n</p>\r\n<p>\r\nPerformance notice: <tt>ffi.fill()</tt> may be used as a faster\r\n(inlinable) replacement for the C&nbsp;library function\r\n<tt>memset(dst,&nbsp;c,&nbsp;len)</tt>. Please note the different\r\norder of arguments!\r\n</p>\r\n\r\n<h2 id=\"target\">Target-specific Information</h2>\r\n\r\n<h3 id=\"ffi_abi\"><tt>status = ffi.abi(param)</tt></h3>\r\n<p>\r\nReturns <tt>true</tt> if <tt>param</tt> (a Lua string) applies for the\r\ntarget ABI (Application Binary Interface). Returns <tt>false</tt>\r\notherwise. The following parameters are currently defined:\r\n</p>\r\n<table class=\"abitable\">\r\n<tr class=\"abihead\">\r\n<td class=\"abiparam\">Parameter</td>\r\n<td class=\"abidesc\">Description</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">32bit</td><td class=\"abidesc\">32 bit architecture</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">64bit</td><td class=\"abidesc\">64 bit architecture</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">le</td><td class=\"abidesc\">Little-endian architecture</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">be</td><td class=\"abidesc\">Big-endian architecture</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">fpu</td><td class=\"abidesc\">Target has a hardware FPU</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">softfp</td><td class=\"abidesc\">softfp calling conventions</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"abiparam\">hardfp</td><td class=\"abidesc\">hardfp calling conventions</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"abiparam\">eabi</td><td class=\"abidesc\">EABI variant of the standard ABI</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"abiparam\">win</td><td class=\"abidesc\">Windows variant of the standard ABI</td></tr>\r\n</table>\r\n\r\n<h3 id=\"ffi_os\"><tt>ffi.os</tt></h3>\r\n<p>\r\nContains the target OS name. Same contents as\r\n<a href=\"ext_jit.html#jit_os\"><tt>jit.os</tt></a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_arch\"><tt>ffi.arch</tt></h3>\r\n<p>\r\nContains the target architecture name. Same contents as\r\n<a href=\"ext_jit.html#jit_arch\"><tt>jit.arch</tt></a>.\r\n</p>\r\n\r\n<h2 id=\"callback\">Methods for Callbacks</h2>\r\n<p>\r\nThe C&nbsp;types for <a href=\"ext_ffi_semantics.html#callback\">callbacks</a>\r\nhave some extra methods:\r\n</p>\r\n\r\n<h3 id=\"callback_free\"><tt>cb:free()</tt></h3>\r\n<p>\r\nFree the resources associated with a callback. The associated Lua\r\nfunction is unanchored and may be garbage collected. The callback\r\nfunction pointer is no longer valid and must not be called anymore\r\n(it may be reused by a subsequently created callback).\r\n</p>\r\n\r\n<h3 id=\"callback_set\"><tt>cb:set(func)</tt></h3>\r\n<p>\r\nAssociate a new Lua function with a callback. The C&nbsp;type of the\r\ncallback and the callback function pointer are unchanged.\r\n</p>\r\n<p>\r\nThis method is useful to dynamically switch the receiver of callbacks\r\nwithout creating a new callback each time and registering it again (e.g.\r\nwith a GUI library).\r\n</p>\r\n\r\n<h2 id=\"extended\">Extended Standard Library Functions</h2>\r\n<p>\r\nThe following standard library functions have been extended to work\r\nwith cdata objects:\r\n</p>\r\n\r\n<h3 id=\"tonumber\"><tt>n = tonumber(cdata)</tt></h3>\r\n<p>\r\nConverts a number cdata object to a <tt>double</tt> and returns it as\r\na Lua number. This is particularly useful for boxed 64&nbsp;bit\r\ninteger values. Caveat: this conversion may incur a precision loss.\r\n</p>\r\n\r\n<h3 id=\"tostring\"><tt>s = tostring(cdata)</tt></h3>\r\n<p>\r\nReturns a string representation of the value of 64&nbsp;bit integers\r\n(<tt><b>\"</b>nnn<b>LL\"</b></tt> or <tt><b>\"</b>nnn<b>ULL\"</b></tt>) or\r\ncomplex numbers (<tt><b>\"</b>re&plusmn;im<b>i\"</b></tt>). Otherwise\r\nreturns a string representation of the C&nbsp;type of a ctype object\r\n(<tt><b>\"ctype&lt;</b>type<b>&gt;\"</b></tt>) or a cdata object\r\n(<tt><b>\"cdata&lt;</b>type<b>&gt;:&nbsp;</b>address\"</tt>), unless you\r\noverride it with a <tt>__tostring</tt> metamethod (see\r\n<a href=\"#ffi_metatype\"><tt>ffi.metatype()</tt></a>).\r\n</p>\r\n\r\n<h3 id=\"pairs\"><tt>iter, obj, start = pairs(cdata)<br>\r\niter, obj, start = ipairs(cdata)<br></tt></h3>\r\n<p>\r\nCalls the <tt>__pairs</tt> or <tt>__ipairs</tt> metamethod of the\r\ncorresponding ctype.\r\n</p>\r\n\r\n<h2 id=\"literals\">Extensions to the Lua Parser</h2>\r\n<p>\r\nThe parser for Lua source code treats numeric literals with the\r\nsuffixes <tt>LL</tt> or <tt>ULL</tt> as signed or unsigned 64&nbsp;bit\r\nintegers. Case doesn't matter, but uppercase is recommended for\r\nreadability. It handles both decimal (<tt>42LL</tt>) and hexadecimal\r\n(<tt>0x2aLL</tt>) literals.\r\n</p>\r\n<p>\r\nThe imaginary part of complex numbers can be specified by suffixing\r\nnumber literals with <tt>i</tt> or <tt>I</tt>, e.g. <tt>12.5i</tt>.\r\nCaveat: you'll need to use <tt>1i</tt> to get an imaginary part with\r\nthe value one, since <tt>i</tt> itself still refers to a variable\r\nnamed <tt>i</tt>.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_ffi_semantics.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Semantics</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.convtable { line-height: 1.2; }\r\ntr.convhead td { font-weight: bold; }\r\ntd.convop { font-style: italic; width: 40%; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Semantics</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page describes the detailed semantics underlying the FFI library\r\nand its interaction with both Lua and C&nbsp;code.\r\n</p>\r\n<p>\r\nGiven that the FFI library is designed to interface with C&nbsp;code\r\nand that declarations can be written in plain C&nbsp;syntax, <b>it\r\nclosely follows the C&nbsp;language semantics</b>, wherever possible.\r\nSome minor concessions are needed for smoother interoperation with Lua\r\nlanguage semantics.\r\n</p>\r\n<p>\r\nPlease don't be overwhelmed by the contents of this page &mdash; this\r\nis a reference and you may need to consult it, if in doubt. It doesn't\r\nhurt to skim this page, but most of the semantics \"just work\" as you'd\r\nexpect them to work. It should be straightforward to write\r\napplications using the LuaJIT FFI for developers with a C or C++\r\nbackground.\r\n</p>\r\n\r\n<h2 id=\"clang\">C Language Support</h2>\r\n<p>\r\nThe FFI library has a built-in C&nbsp;parser with a minimal memory\r\nfootprint. It's used by the <a href=\"ext_ffi_api.html\">ffi.* library\r\nfunctions</a> to declare C&nbsp;types or external symbols.\r\n</p>\r\n<p>\r\nIt's only purpose is to parse C&nbsp;declarations, as found e.g. in\r\nC&nbsp;header files. Although it does evaluate constant expressions,\r\nit's <em>not</em> a C&nbsp;compiler. The body of <tt>inline</tt>\r\nC&nbsp;function definitions is simply ignored.\r\n</p>\r\n<p>\r\nAlso, this is <em>not</em> a validating C&nbsp;parser. It expects and\r\naccepts correctly formed C&nbsp;declarations, but it may choose to\r\nignore bad declarations or show rather generic error messages. If in\r\ndoubt, please check the input against your favorite C&nbsp;compiler.\r\n</p>\r\n<p>\r\nThe C&nbsp;parser complies to the <b>C99 language standard</b> plus\r\nthe following extensions:\r\n</p>\r\n<ul>\r\n\r\n<li>The <tt>'\\e'</tt> escape in character and string literals.</li>\r\n\r\n<li>The C99/C++ boolean type, declared with the keywords <tt>bool</tt>\r\nor <tt>_Bool</tt>.</li>\r\n\r\n<li>Complex numbers, declared with the keywords <tt>complex</tt> or\r\n<tt>_Complex</tt>.</li>\r\n\r\n<li>Two complex number types: <tt>complex</tt> (aka\r\n<tt>complex&nbsp;double</tt>) and <tt>complex&nbsp;float</tt>.</li>\r\n\r\n<li>Vector types, declared with the GCC <tt>mode</tt> or\r\n<tt>vector_size</tt> attribute.</li>\r\n\r\n<li>Unnamed ('transparent') <tt>struct</tt>/<tt>union</tt> fields\r\ninside a <tt>struct</tt>/<tt>union</tt>.</li>\r\n\r\n<li>Incomplete <tt>enum</tt> declarations, handled like incomplete\r\n<tt>struct</tt> declarations.</li>\r\n\r\n<li>Unnamed <tt>enum</tt> fields inside a\r\n<tt>struct</tt>/<tt>union</tt>. This is similar to a scoped C++\r\n<tt>enum</tt>, except that declared constants are visible in the\r\nglobal namespace, too.</li>\r\n\r\n<li>Scoped <tt>static&nbsp;const</tt> declarations inside a\r\n<tt>struct</tt>/<tt>union</tt> (from C++).</li>\r\n\r\n<li>Zero-length arrays (<tt>[0]</tt>), empty\r\n<tt>struct</tt>/<tt>union</tt>, variable-length arrays (VLA,\r\n<tt>[?]</tt>) and variable-length structs (VLS, with a trailing\r\nVLA).</li>\r\n\r\n<li>C++ reference types (<tt>int&nbsp;&amp;x</tt>).</li>\r\n\r\n<li>Alternate GCC keywords with '<tt>__</tt>', e.g.\r\n<tt>__const__</tt>.</li>\r\n\r\n<li>GCC <tt>__attribute__</tt> with the following attributes:\r\n<tt>aligned</tt>, <tt>packed</tt>, <tt>mode</tt>,\r\n<tt>vector_size</tt>, <tt>cdecl</tt>, <tt>fastcall</tt>,\r\n<tt>stdcall</tt>, <tt>thiscall</tt>.</li>\r\n\r\n<li>The GCC <tt>__extension__</tt> keyword and the GCC\r\n<tt>__alignof__</tt> operator.</li>\r\n\r\n<li>GCC <tt>__asm__(\"symname\")</tt> symbol name redirection for\r\nfunction declarations.</li>\r\n\r\n<li>MSVC keywords for fixed-length types: <tt>__int8</tt>,\r\n<tt>__int16</tt>, <tt>__int32</tt> and <tt>__int64</tt>.</li>\r\n\r\n<li>MSVC <tt>__cdecl</tt>, <tt>__fastcall</tt>, <tt>__stdcall</tt>,\r\n<tt>__thiscall</tt>, <tt>__ptr32</tt>, <tt>__ptr64</tt>,\r\n<tt>__declspec(align(n))</tt> and <tt>#pragma&nbsp;pack</tt>.</li>\r\n\r\n<li>All other GCC/MSVC-specific attributes are ignored.</li>\r\n\r\n</ul>\r\n<p>\r\nThe following C&nbsp;types are pre-defined by the C&nbsp;parser (like\r\na <tt>typedef</tt>, except re-declarations will be ignored):\r\n</p>\r\n<ul>\r\n\r\n<li>Vararg handling: <tt>va_list</tt>, <tt>__builtin_va_list</tt>,\r\n<tt>__gnuc_va_list</tt>.</li>\r\n\r\n<li>From <tt>&lt;stddef.h&gt;</tt>: <tt>ptrdiff_t</tt>,\r\n<tt>size_t</tt>, <tt>wchar_t</tt>.</li>\r\n\r\n<li>From <tt>&lt;stdint.h&gt;</tt>: <tt>int8_t</tt>, <tt>int16_t</tt>,\r\n<tt>int32_t</tt>, <tt>int64_t</tt>, <tt>uint8_t</tt>,\r\n<tt>uint16_t</tt>, <tt>uint32_t</tt>, <tt>uint64_t</tt>,\r\n<tt>intptr_t</tt>, <tt>uintptr_t</tt>.</li>\r\n\r\n</ul>\r\n<p>\r\nYou're encouraged to use these types in preference to\r\ncompiler-specific extensions or target-dependent standard types.\r\nE.g. <tt>char</tt> differs in signedness and <tt>long</tt> differs in\r\nsize, depending on the target architecture and platform ABI.\r\n</p>\r\n<p>\r\nThe following C&nbsp;features are <b>not</b> supported:\r\n</p>\r\n<ul>\r\n\r\n<li>A declaration must always have a type specifier; it doesn't\r\ndefault to an <tt>int</tt> type.</li>\r\n\r\n<li>Old-style empty function declarations (K&amp;R) are not allowed.\r\nAll C&nbsp;functions must have a proper prototype declaration. A\r\nfunction declared without parameters (<tt>int&nbsp;foo();</tt>) is\r\ntreated as a function taking zero arguments, like in C++.</li>\r\n\r\n<li>The <tt>long double</tt> C&nbsp;type is parsed correctly, but\r\nthere's no support for the related conversions, accesses or arithmetic\r\noperations.</li>\r\n\r\n<li>Wide character strings and character literals are not\r\nsupported.</li>\r\n\r\n<li><a href=\"#status\">See below</a> for features that are currently\r\nnot implemented.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"convert\">C Type Conversion Rules</h2>\r\n\r\n<h3 id=\"convert_tolua\">Conversions from C&nbsp;types to Lua objects</h3>\r\n<p>\r\nThese conversion rules apply for <em>read accesses</em> to\r\nC&nbsp;types: indexing pointers, arrays or\r\n<tt>struct</tt>/<tt>union</tt> types; reading external variables or\r\nconstant values; retrieving return values from C&nbsp;calls:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>int8_t</tt>, <tt>int16_t</tt></td><td class=\"convop\">&rarr;<sup>sign-ext</sup> <tt>int32_t</tt> &rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>uint8_t</tt>, <tt>uint16_t</tt></td><td class=\"convop\">&rarr;<sup>zero-ext</sup> <tt>int32_t</tt> &rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>int32_t</tt>, <tt>uint32_t</tt></td><td class=\"convop\">&rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>int64_t</tt>, <tt>uint64_t</tt></td><td class=\"convop\">boxed value</td><td class=\"convout\">64 bit int cdata</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\"><tt>bool</tt></td><td class=\"convop\">0 &rarr; <tt>false</tt>, otherwise <tt>true</tt></td><td class=\"convout\">boolean</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>enum</tt></td><td class=\"convop\">boxed value</td><td class=\"convout\">enum cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">boxed value</td><td class=\"convout\">complex cdata</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Vector</td><td class=\"convop\">boxed value</td><td class=\"convout\">vector cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">boxed value</td><td class=\"convout\">pointer cdata</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">boxed reference</td><td class=\"convout\">reference cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">boxed reference</td><td class=\"convout\">reference cdata</td></tr>\r\n</table>\r\n<p>\r\nBitfields are treated like their underlying type.\r\n</p>\r\n<p>\r\nReference types are dereferenced <em>before</em> a conversion can take\r\nplace &mdash; the conversion is applied to the C&nbsp;type pointed to\r\nby the reference.\r\n</p>\r\n\r\n<h3 id=\"convert_fromlua\">Conversions from Lua objects to C&nbsp;types</h3>\r\n<p>\r\nThese conversion rules apply for <em>write accesses</em> to\r\nC&nbsp;types: indexing pointers, arrays or\r\n<tt>struct</tt>/<tt>union</tt> types; initializing cdata objects;\r\ncasts to C&nbsp;types; writing to external variables; passing\r\narguments to C&nbsp;calls:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">number</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">boolean</td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">nil</td><td class=\"convop\"><tt>NULL</tt> &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">lightuserdata</td><td class=\"convop\">lightuserdata address &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">userdata</td><td class=\"convop\">userdata payload &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">io.* file</td><td class=\"convop\">get FILE * handle &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">string</td><td class=\"convop\">match against <tt>enum</tt> constant</td><td class=\"convout\"><tt>enum</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">string</td><td class=\"convop\">copy string data + zero-byte</td><td class=\"convout\"><tt>int8_t[]</tt>, <tt>uint8_t[]</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">string</td><td class=\"convop\">string data &rarr;</td><td class=\"convout\"><tt>const char[]</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">function</td><td class=\"convop\"><a href=\"#callback\">create callback</a> &rarr;</td><td class=\"convout\">C function type</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">table</td><td class=\"convop\"><a href=\"#init_table\">table initializer</a></td><td class=\"convout\">Array</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">table</td><td class=\"convop\"><a href=\"#init_table\">table initializer</a></td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">cdata</td><td class=\"convop\">cdata payload &rarr;</td><td class=\"convout\">C type</td></tr>\r\n</table>\r\n<p>\r\nIf the result type of this conversion doesn't match the\r\nC&nbsp;type of the destination, the\r\n<a href=\"#convert_between\">conversion rules between C&nbsp;types</a>\r\nare applied.\r\n</p>\r\n<p>\r\nReference types are immutable after initialization (\"no re-seating of\r\nreferences\"). For initialization purposes or when passing values to\r\nreference parameters, they are treated like pointers. Note that unlike\r\nin C++, there's no way to implement automatic reference generation of\r\nvariables under the Lua language semantics. If you want to call a\r\nfunction with a reference parameter, you need to explicitly pass a\r\none-element array.\r\n</p>\r\n\r\n<h3 id=\"convert_between\">Conversions between C&nbsp;types</h3>\r\n<p>\r\nThese conversion rules are more or less the same as the standard\r\nC&nbsp;conversion rules. Some rules only apply to casts, or require\r\npointer or type compatibility:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Signed integer</td><td class=\"convop\">&rarr;<sup>narrow or sign-extend</sup></td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Unsigned integer</td><td class=\"convop\">&rarr;<sup>narrow or zero-extend</sup></td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Integer</td><td class=\"convop\">&rarr;<sup>round</sup></td><td class=\"convout\"><tt>double</tt>, <tt>float</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>trunc</sup> <tt>int32_t</tt> &rarr;<sup>narrow</sup></td><td class=\"convout\"><tt>(u)int8_t</tt>, <tt>(u)int16_t</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>trunc</sup></td><td class=\"convout\"><tt>(u)int32_t</tt>, <tt>(u)int64_t</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>round</sup></td><td class=\"convout\"><tt>float</tt>, <tt>double</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">n == 0 &rarr; 0, otherwise 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>bool</tt></td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\">Number</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">convert real part</td><td class=\"convout\">Number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert real part, imag = 0</td><td class=\"convout\">Complex number</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">convert real and imag part</td><td class=\"convout\">Complex number</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert scalar and replicate</td><td class=\"convout\">Vector</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Vector</td><td class=\"convop\">copy (same size)</td><td class=\"convout\">Vector</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">take base address (compat)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">take base address (compat)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Function</td><td class=\"convop\">take function address</td><td class=\"convout\">Function pointer</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert via <tt>uintptr_t</tt> (cast)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">convert address (compat/cast)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">convert address (cast)</td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">convert base address (cast)</td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">copy (compat)</td><td class=\"convout\">Array</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">copy (identical type)</td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt></td></tr>\r\n</table>\r\n<p>\r\nBitfields or <tt>enum</tt> types are treated like their underlying\r\ntype.\r\n</p>\r\n<p>\r\nConversions not listed above will raise an error. E.g. it's not\r\npossible to convert a pointer to a complex number or vice versa.\r\n</p>\r\n\r\n<h3 id=\"convert_vararg\">Conversions for vararg C&nbsp;function arguments</h3>\r\n<p>\r\nThe following default conversion rules apply when passing Lua objects\r\nto the variable argument part of vararg C&nbsp;functions:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">number</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">boolean</td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">nil</td><td class=\"convop\"><tt>NULL</tt> &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">userdata</td><td class=\"convop\">userdata payload &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">lightuserdata</td><td class=\"convop\">lightuserdata address &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">string</td><td class=\"convop\">string data &rarr;</td><td class=\"convout\"><tt>const char *</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>float</tt> cdata</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Array cdata</td><td class=\"convop\">take base address</td><td class=\"convout\">Element pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt> cdata</td><td class=\"convop\">take base address</td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt> pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Function cdata</td><td class=\"convop\">take function address</td><td class=\"convout\">Function pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Any other cdata</td><td class=\"convop\">no conversion</td><td class=\"convout\">C type</td></tr>\r\n</table>\r\n<p>\r\nTo pass a Lua object, other than a cdata object, as a specific type,\r\nyou need to override the conversion rules: create a temporary cdata\r\nobject with a constructor or a cast and initialize it with the value\r\nto pass:\r\n</p>\r\n<p>\r\nAssuming <tt>x</tt> is a Lua number, here's how to pass it as an\r\ninteger to a vararg function:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\nint printf(const char *fmt, ...);\r\n]]\r\nffi.C.printf(\"integer value: %d\\n\", ffi.new(\"int\", x))\r\n</pre>\r\n<p>\r\nIf you don't do this, the default Lua number &rarr; <tt>double</tt>\r\nconversion rule applies. A vararg C&nbsp;function expecting an integer\r\nwill see a garbled or uninitialized value.\r\n</p>\r\n\r\n<h2 id=\"init\">Initializers</h2>\r\n<p>\r\nCreating a cdata object with\r\n<a href=\"ext_ffi_api.html#ffi_new\"><tt>ffi.new()</tt></a> or the\r\nequivalent constructor syntax always initializes its contents, too.\r\nDifferent rules apply, depending on the number of optional\r\ninitializers and the C&nbsp;types involved:\r\n</p>\r\n<ul>\r\n<li>If no initializers are given, the object is filled with zero bytes.</li>\r\n\r\n<li>Scalar types (numbers and pointers) accept a single initializer.\r\nThe Lua object is <a href=\"#convert_fromlua\">converted to the scalar\r\nC&nbsp;type</a>.</li>\r\n\r\n<li>Valarrays (complex numbers and vectors) are treated like scalars\r\nwhen a single initializer is given. Otherwise they are treated like\r\nregular arrays.</li>\r\n\r\n<li>Aggregate types (arrays and structs) accept either a single cdata\r\ninitializer of the same type (copy constructor), a single\r\n<a href=\"#init_table\">table initializer</a>, or a flat list of\r\ninitializers.</li>\r\n\r\n<li>The elements of an array are initialized, starting at index zero.\r\nIf a single initializer is given for an array, it's repeated for all\r\nremaining elements. This doesn't happen if two or more initializers\r\nare given: all remaining uninitialized elements are filled with zero\r\nbytes.</li>\r\n\r\n<li>Byte arrays may also be initialized with a Lua string. This copies\r\nthe whole string plus a terminating zero-byte. The copy stops early only\r\nif the array has a known, fixed size.</li>\r\n\r\n<li>The fields of a <tt>struct</tt> are initialized in the order of\r\ntheir declaration. Uninitialized fields are filled with zero\r\nbytes.</li>\r\n\r\n<li>Only the first field of a <tt>union</tt> can be initialized with a\r\nflat initializer.</li>\r\n\r\n<li>Elements or fields which are aggregates themselves are initialized\r\nwith a <em>single</em> initializer, but this may be a table\r\ninitializer or a compatible aggregate.</li>\r\n\r\n<li>Excess initializers cause an error.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"init_table\">Table Initializers</h2>\r\n<p>\r\nThe following rules apply if a Lua table is used to initialize an\r\nArray or a <tt>struct</tt>/<tt>union</tt>:\r\n</p>\r\n<ul>\r\n\r\n<li>If the table index <tt>[0]</tt> is non-<tt>nil</tt>, then the\r\ntable is assumed to be zero-based. Otherwise it's assumed to be\r\none-based.</li>\r\n\r\n<li>Array elements, starting at index zero, are initialized one-by-one\r\nwith the consecutive table elements, starting at either index\r\n<tt>[0]</tt> or <tt>[1]</tt>. This process stops at the first\r\n<tt>nil</tt> table element.</li>\r\n\r\n<li>If exactly one array element was initialized, it's repeated for\r\nall the remaining elements. Otherwise all remaining uninitialized\r\nelements are filled with zero bytes.</li>\r\n\r\n<li>The above logic only applies to arrays with a known fixed size.\r\nA VLA is only initialized with the element(s) given in the table.\r\nDepending on the use case, you may need to explicitly add a\r\n<tt>NULL</tt> or <tt>0</tt> terminator to a VLA.</li>\r\n\r\n<li>A <tt>struct</tt>/<tt>union</tt> can be initialized in the\r\norder of the declaration of its fields. Each field is initialized with\r\nconsecutive table elements, starting at either index <tt>[0]</tt>\r\nor <tt>[1]</tt>. This process stops at the first <tt>nil</tt> table\r\nelement.</li>\r\n\r\n<li>Otherwise, if neither index <tt>[0]</tt> nor <tt>[1]</tt> is present,\r\na <tt>struct</tt>/<tt>union</tt> is initialized by looking up each field\r\nname (as a string key) in the table. Each non-<tt>nil</tt> value is\r\nused to initialize the corresponding field.</li>\r\n\r\n<li>Uninitialized fields of a <tt>struct</tt> are filled with zero\r\nbytes, except for the trailing VLA of a VLS.</li>\r\n\r\n<li>Initialization of a <tt>union</tt> stops after one field has been\r\ninitialized. If no field has been initialized, the <tt>union</tt> is\r\nfilled with zero bytes.</li>\r\n\r\n<li>Elements or fields which are aggregates themselves are initialized\r\nwith a <em>single</em> initializer, but this may be a nested table\r\ninitializer (or a compatible aggregate).</li>\r\n\r\n<li>Excess initializers for an array cause an error. Excess\r\ninitializers for a <tt>struct</tt>/<tt>union</tt> are ignored.\r\nUnrelated table entries are ignored, too.</li>\r\n\r\n</ul>\r\n<p>\r\nExample:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\n\r\nffi.cdef[[\r\nstruct foo { int a, b; };\r\nunion bar { int i; double d; };\r\nstruct nested { int x; struct foo y; };\r\n]]\r\n\r\nffi.new(\"int[3]\", {})            --> 0, 0, 0\r\nffi.new(\"int[3]\", {1})           --> 1, 1, 1\r\nffi.new(\"int[3]\", {1,2})         --> 1, 2, 0\r\nffi.new(\"int[3]\", {1,2,3})       --> 1, 2, 3\r\nffi.new(\"int[3]\", {[0]=1})       --> 1, 1, 1\r\nffi.new(\"int[3]\", {[0]=1,2})     --> 1, 2, 0\r\nffi.new(\"int[3]\", {[0]=1,2,3})   --> 1, 2, 3\r\nffi.new(\"int[3]\", {[0]=1,2,3,4}) --> error: too many initializers\r\n\r\nffi.new(\"struct foo\", {})            --> a = 0, b = 0\r\nffi.new(\"struct foo\", {1})           --> a = 1, b = 0\r\nffi.new(\"struct foo\", {1,2})         --> a = 1, b = 2\r\nffi.new(\"struct foo\", {[0]=1,2})     --> a = 1, b = 2\r\nffi.new(\"struct foo\", {b=2})         --> a = 0, b = 2\r\nffi.new(\"struct foo\", {a=1,b=2,c=3}) --> a = 1, b = 2  'c' is ignored\r\n\r\nffi.new(\"union bar\", {})        --> i = 0, d = 0.0\r\nffi.new(\"union bar\", {1})       --> i = 1, d = ?\r\nffi.new(\"union bar\", {[0]=1,2}) --> i = 1, d = ?    '2' is ignored\r\nffi.new(\"union bar\", {d=2})     --> i = ?, d = 2.0\r\n\r\nffi.new(\"struct nested\", {1,{2,3}})     --> x = 1, y.a = 2, y.b = 3\r\nffi.new(\"struct nested\", {x=1,y={2,3}}) --> x = 1, y.a = 2, y.b = 3\r\n</pre>\r\n\r\n<h2 id=\"cdata_ops\">Operations on cdata Objects</h2>\r\n<p>\r\nAll of the standard Lua operators can be applied to cdata objects or a\r\nmix of a cdata object and another Lua object. The following list shows\r\nthe pre-defined operations.\r\n</p>\r\n<p>\r\nReference types are dereferenced <em>before</em> performing each of\r\nthe operations below &mdash; the operation is applied to the\r\nC&nbsp;type pointed to by the reference.\r\n</p>\r\n<p>\r\nThe pre-defined operations are always tried first before deferring to a\r\nmetamethod or index table (if any) for the corresponding ctype (except\r\nfor <tt>__new</tt>). An error is raised if the metamethod lookup or\r\nindex table lookup fails.\r\n</p>\r\n\r\n<h3 id=\"cdata_array\">Indexing a cdata object</h3>\r\n<ul>\r\n\r\n<li><b>Indexing a pointer/array</b>: a cdata pointer/array can be\r\nindexed by a cdata number or a Lua number. The element address is\r\ncomputed as the base address plus the number value multiplied by the\r\nelement size in bytes. A read access loads the element value and\r\n<a href=\"#convert_tolua\">converts it to a Lua object</a>. A write\r\naccess <a href=\"#convert_fromlua\">converts a Lua object to the element\r\ntype</a> and stores the converted value to the element. An error is\r\nraised if the element size is undefined or a write access to a\r\nconstant element is attempted.</li>\r\n\r\n<li><b>Dereferencing a <tt>struct</tt>/<tt>union</tt> field</b>: a\r\ncdata <tt>struct</tt>/<tt>union</tt> or a pointer to a\r\n<tt>struct</tt>/<tt>union</tt> can be dereferenced by a string key,\r\ngiving the field name. The field address is computed as the base\r\naddress plus the relative offset of the field. A read access loads the\r\nfield value and <a href=\"#convert_tolua\">converts it to a Lua\r\nobject</a>. A write access <a href=\"#convert_fromlua\">converts a Lua\r\nobject to the field type</a> and stores the converted value to the\r\nfield. An error is raised if a write access to a constant\r\n<tt>struct</tt>/<tt>union</tt> or a constant field is attempted.\r\nScoped enum constants or static constants are treated like a constant\r\nfield.</li>\r\n\r\n<li><b>Indexing a complex number</b>: a complex number can be indexed\r\neither by a cdata number or a Lua number with the values 0 or 1, or by\r\nthe strings <tt>\"re\"</tt> or <tt>\"im\"</tt>. A read access loads the\r\nreal part (<tt>[0]</tt>, <tt>.re</tt>) or the imaginary part\r\n(<tt>[1]</tt>, <tt>.im</tt>) part of a complex number and\r\n<a href=\"#convert_tolua\">converts it to a Lua number</a>. The\r\nsub-parts of a complex number are immutable &mdash; assigning to an\r\nindex of a complex number raises an error. Accessing out-of-bound\r\nindexes returns unspecified results, but is guaranteed not to trigger\r\nmemory access violations.</li>\r\n\r\n<li><b>Indexing a vector</b>: a vector is treated like an array for\r\nindexing purposes, except the vector elements are immutable &mdash;\r\nassigning to an index of a vector raises an error.</li>\r\n\r\n</ul>\r\n<p>\r\nA ctype object can be indexed with a string key, too. The only\r\npre-defined operation is reading scoped constants of\r\n<tt>struct</tt>/<tt>union</tt> types. All other accesses defer\r\nto the corresponding metamethods or index tables (if any).\r\n</p>\r\n<p>\r\nNote: since there's (deliberately) no address-of operator, a cdata\r\nobject holding a value type is effectively immutable after\r\ninitialization. The JIT compiler benefits from this fact when applying\r\ncertain optimizations.\r\n</p>\r\n<p>\r\nAs a consequence, the <em>elements</em> of complex numbers and\r\nvectors are immutable. But the elements of an aggregate holding these\r\ntypes <em>may</em> be modified of course. I.e. you cannot assign to\r\n<tt>foo.c.im</tt>, but you can assign a (newly created) complex number\r\nto <tt>foo.c</tt>.\r\n</p>\r\n<p>\r\nThe JIT compiler implements strict aliasing rules: accesses to different\r\ntypes do <b>not</b> alias, except for differences in signedness (this\r\napplies even to <tt>char</tt> pointers, unlike C99). Type punning\r\nthrough unions is explicitly detected and allowed.\r\n</p>\r\n\r\n<h3 id=\"cdata_call\">Calling a cdata object</h3>\r\n<ul>\r\n\r\n<li><b>Constructor</b>: a ctype object can be called and used as a\r\n<a href=\"ext_ffi_api.html#ffi_new\">constructor</a>. This is equivalent\r\nto <tt>ffi.new(ct, ...)</tt>, unless a <tt>__new</tt> metamethod is\r\ndefined. The <tt>__new</tt> metamethod is called with the ctype object\r\nplus any other arguments passed to the contructor. Note that you have to\r\nuse <tt>ffi.new</tt> inside of it, since calling <tt>ct(...)</tt> would\r\ncause infinite recursion.</li>\r\n\r\n<li><b>C&nbsp;function call</b>: a cdata function or cdata function\r\npointer can be called. The passed arguments are\r\n<a href=\"#convert_fromlua\">converted to the C&nbsp;types</a> of the\r\nparameters given by the function declaration. Arguments passed to the\r\nvariable argument part of vararg C&nbsp;function use\r\n<a href=\"#convert_vararg\">special conversion rules</a>. This\r\nC&nbsp;function is called and the return value (if any) is\r\n<a href=\"#convert_tolua\">converted to a Lua object</a>.<br>\r\nOn Windows/x86 systems, <tt>__stdcall</tt> functions are automatically\r\ndetected and a function declared as <tt>__cdecl</tt> (the default) is\r\nsilently fixed up after the first call.</li>\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_arith\">Arithmetic on cdata objects</h3>\r\n<ul>\r\n\r\n<li><b>Pointer arithmetic</b>: a cdata pointer/array and a cdata\r\nnumber or a Lua number can be added or subtracted. The number must be\r\non the right hand side for a subtraction. The result is a pointer of\r\nthe same type with an address plus or minus the number value\r\nmultiplied by the element size in bytes. An error is raised if the\r\nelement size is undefined.</li>\r\n\r\n<li><b>Pointer difference</b>: two compatible cdata pointers/arrays\r\ncan be subtracted. The result is the difference between their\r\naddresses, divided by the element size in bytes. An error is raised if\r\nthe element size is undefined or zero.</li>\r\n\r\n<li><b>64&nbsp;bit integer arithmetic</b>: the standard arithmetic\r\noperators (<tt>+&nbsp;-&nbsp;*&nbsp;/&nbsp;%&nbsp;^</tt> and unary\r\nminus) can be applied to two cdata numbers, or a cdata number and a\r\nLua number. If one of them is an <tt>uint64_t</tt>, the other side is\r\nconverted to an <tt>uint64_t</tt> and an unsigned arithmetic operation\r\nis performed. Otherwise both sides are converted to an\r\n<tt>int64_t</tt> and a signed arithmetic operation is performed. The\r\nresult is a boxed 64&nbsp;bit cdata object.<br>\r\n\r\nIf one of the operands is an <tt>enum</tt> and the other operand is a\r\nstring, the string is converted to the value of a matching <tt>enum</tt>\r\nconstant before the above conversion.<br>\r\n\r\nThese rules ensure that 64&nbsp;bit integers are \"sticky\". Any\r\nexpression involving at least one 64&nbsp;bit integer operand results\r\nin another one. The undefined cases for the division, modulo and power\r\noperators return <tt>2LL&nbsp;^&nbsp;63</tt> or\r\n<tt>2ULL&nbsp;^&nbsp;63</tt>.<br>\r\n\r\nYou'll have to explicitly convert a 64&nbsp;bit integer to a Lua\r\nnumber (e.g. for regular floating-point calculations) with\r\n<tt>tonumber()</tt>. But note this may incur a precision loss.</li>\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_comp\">Comparisons of cdata objects</h3>\r\n<ul>\r\n\r\n<li><b>Pointer comparison</b>: two compatible cdata pointers/arrays\r\ncan be compared. The result is the same as an unsigned comparison of\r\ntheir addresses. <tt>nil</tt> is treated like a <tt>NULL</tt> pointer,\r\nwhich is compatible with any other pointer type.</li>\r\n\r\n<li><b>64&nbsp;bit integer comparison</b>: two cdata numbers, or a\r\ncdata number and a Lua number can be compared with each other. If one\r\nof them is an <tt>uint64_t</tt>, the other side is converted to an\r\n<tt>uint64_t</tt> and an unsigned comparison is performed. Otherwise\r\nboth sides are converted to an <tt>int64_t</tt> and a signed\r\ncomparison is performed.<br>\r\n\r\nIf one of the operands is an <tt>enum</tt> and the other operand is a\r\nstring, the string is converted to the value of a matching <tt>enum</tt>\r\nconstant before the above conversion.<br>\r\n\r\n<li><b>Comparisons for equality/inequality</b> never raise an error.\r\nEven incompatible pointers can be compared for equality by address. Any\r\nother incompatible comparison (also with non-cdata objects) treats the\r\ntwo sides as unequal.</li>\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_key\">cdata objects as table keys</h3>\r\n<p>\r\nLua tables may be indexed by cdata objects, but this doesn't provide\r\nany useful semantics &mdash; <b>cdata objects are unsuitable as table\r\nkeys!</b>\r\n</p>\r\n<p>\r\nA cdata object is treated like any other garbage-collected object and\r\nis hashed and compared by its address for table indexing. Since\r\nthere's no interning for cdata value types, the same value may be\r\nboxed in different cdata objects with different addresses. Thus\r\n<tt>t[1LL+1LL]</tt> and <tt>t[2LL]</tt> usually <b>do not</b> point to\r\nthe same hash slot and they certainly <b>do not</b> point to the same\r\nhash slot as <tt>t[2]</tt>.\r\n</p>\r\n<p>\r\nIt would seriously drive up implementation complexity and slow down\r\nthe common case, if one were to add extra handling for by-value\r\nhashing and comparisons to Lua tables. Given the ubiquity of their use\r\ninside the VM, this is not acceptable.\r\n</p>\r\n<p>\r\nThere are three viable alternatives, if you really need to use cdata\r\nobjects as keys:\r\n</p>\r\n<ul>\r\n\r\n<li>If you can get by with the precision of Lua numbers\r\n(52&nbsp;bits), then use <tt>tonumber()</tt> on a cdata number or\r\ncombine multiple fields of a cdata aggregate to a Lua number. Then use\r\nthe resulting Lua number as a key when indexing tables.<br>\r\nOne obvious benefit: <tt>t[tonumber(2LL)]</tt> <b>does</b> point to\r\nthe same slot as <tt>t[2]</tt>.</li>\r\n\r\n<li>Otherwise use either <tt>tostring()</tt> on 64&nbsp;bit integers\r\nor complex numbers or combine multiple fields of a cdata aggregate to\r\na Lua string (e.g. with\r\n<a href=\"ext_ffi_api.html#ffi_string\"><tt>ffi.string()</tt></a>). Then\r\nuse the resulting Lua string as a key when indexing tables.</li>\r\n\r\n<li>Create your own specialized hash table implementation using the\r\nC&nbsp;types provided by the FFI library, just like you would in\r\nC&nbsp;code. Ultimately this may give much better performance than the\r\nother alternatives or what a generic by-value hash table could\r\npossibly provide.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"param\">Parameterized Types</h2>\r\n<p>\r\nTo facilitate some abstractions, the two functions\r\n<a href=\"ext_ffi_api.html#ffi_typeof\"><tt>ffi.typeof</tt></a> and\r\n<a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a> support\r\nparameterized types in C&nbsp;declarations. Note: none of the other API\r\nfunctions taking a cdecl allow this.\r\n</p>\r\n<p>\r\nAny place you can write a <b><tt>typedef</tt> name</b>, an\r\n<b>identifier</b> or a <b>number</b> in a declaration, you can write\r\n<tt>$</tt> (the dollar sign) instead. These placeholders are replaced in\r\norder of appearance with the arguments following the cdecl string:\r\n</p>\r\n<pre class=\"code\">\r\n-- Declare a struct with a parameterized field type and name:\r\nffi.cdef([[\r\ntypedef struct { $ $; } foo_t;\r\n]], type1, name1)\r\n\r\n-- Anonymous struct with dynamic names:\r\nlocal bar_t = ffi.typeof(\"struct { int $, $; }\", name1, name2)\r\n-- Derived pointer type:\r\nlocal bar_ptr_t = ffi.typeof(\"$ *\", bar_t)\r\n\r\n-- Parameterized dimensions work even where a VLA won't work:\r\nlocal matrix_t = ffi.typeof(\"uint8_t[$][$]\", width, height)\r\n</pre>\r\n<p>\r\nCaveat: this is <em>not</em> simple text substitution! A passed ctype or\r\ncdata object is treated like the underlying type, a passed string is\r\nconsidered an identifier and a number is considered a number. You must\r\nnot mix this up: e.g. passing <tt>\"int\"</tt> as a string doesn't work in\r\nplace of a type, you'd need to use <tt>ffi.typeof(\"int\")</tt> instead.\r\n</p>\r\n<p>\r\nThe main use for parameterized types are libraries implementing abstract\r\ndata types\r\n(<a href=\"http://www.freelists.org/post/luajit/ffi-type-of-pointer-to,8\"><span class=\"ext\">&raquo;</span>&nbsp;example</a>),\r\nsimilar to what can be achieved with C++ template metaprogramming.\r\nAnother use case are derived types of anonymous structs, which avoids\r\npollution of the global struct namespace.\r\n</p>\r\n<p>\r\nPlease note that parameterized types are a nice tool and indispensable\r\nfor certain use cases. But you'll want to use them sparingly in regular\r\ncode, e.g. when all types are actually fixed.\r\n</p>\r\n\r\n<h2 id=\"gc\">Garbage Collection of cdata Objects</h2>\r\n<p>\r\nAll explicitly (<tt>ffi.new()</tt>, <tt>ffi.cast()</tt> etc.) or\r\nimplicitly (accessors) created cdata objects are garbage collected.\r\nYou need to ensure to retain valid references to cdata objects\r\nsomewhere on a Lua stack, an upvalue or in a Lua table while they are\r\nstill in use. Once the last reference to a cdata object is gone, the\r\ngarbage collector will automatically free the memory used by it (at\r\nthe end of the next GC cycle).\r\n</p>\r\n<p>\r\nPlease note that pointers themselves are cdata objects, however they\r\nare <b>not</b> followed by the garbage collector. So e.g. if you\r\nassign a cdata array to a pointer, you must keep the cdata object\r\nholding the array alive as long as the pointer is still in use:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\ntypedef struct { int *a; } foo_t;\r\n]]\r\n\r\nlocal s = ffi.new(\"foo_t\", ffi.new(\"int[10]\")) -- <span style=\"color:#c00000;\">WRONG!</span>\r\n\r\nlocal a = ffi.new(\"int[10]\") -- <span style=\"color:#00a000;\">OK</span>\r\nlocal s = ffi.new(\"foo_t\", a)\r\n-- Now do something with 's', but keep 'a' alive until you're done.\r\n</pre>\r\n<p>\r\nSimilar rules apply for Lua strings which are implicitly converted to\r\n<tt>\"const&nbsp;char&nbsp;*\"</tt>: the string object itself must be\r\nreferenced somewhere or it'll be garbage collected eventually. The\r\npointer will then point to stale data, which may have already been\r\noverwritten. Note that <em>string literals</em> are automatically kept\r\nalive as long as the function containing it (actually its prototype)\r\nis not garbage collected.\r\n</p>\r\n<p>\r\nObjects which are passed as an argument to an external C&nbsp;function\r\nare kept alive until the call returns. So it's generally safe to\r\ncreate temporary cdata objects in argument lists. This is a common\r\nidiom for <a href=\"#convert_vararg\">passing specific C&nbsp;types to\r\nvararg functions</a>.\r\n</p>\r\n<p>\r\nMemory areas returned by C functions (e.g. from <tt>malloc()</tt>)\r\nmust be manually managed, of course (or use\r\n<a href=\"ext_ffi_api.html#ffi_gc\"><tt>ffi.gc()</tt></a>). Pointers to\r\ncdata objects are indistinguishable from pointers returned by C\r\nfunctions (which is one of the reasons why the GC cannot follow them).\r\n</p>\r\n\r\n<h2 id=\"callback\">Callbacks</h2>\r\n<p>\r\nThe LuaJIT FFI automatically generates special callback functions\r\nwhenever a Lua function is converted to a C&nbsp;function pointer. This\r\nassociates the generated callback function pointer with the C&nbsp;type\r\nof the function pointer and the Lua function object (closure).\r\n</p>\r\n<p>\r\nThis can happen implicitly due to the usual conversions, e.g. when\r\npassing a Lua function to a function pointer argument. Or you can use\r\n<tt>ffi.cast()</tt> to explicitly cast a Lua function to a\r\nC&nbsp;function pointer.\r\n</p>\r\n<p>\r\nCurrently only certain C&nbsp;function types can be used as callback\r\nfunctions. Neither C&nbsp;vararg functions nor functions with\r\npass-by-value aggregate argument or result types are supported. There\r\nare no restrictions for the kind of Lua functions that can be called\r\nfrom the callback &mdash; no checks for the proper number of arguments\r\nare made. The return value of the Lua function will be converted to the\r\nresult type and an error will be thrown for invalid conversions.\r\n</p>\r\n<p>\r\nIt's allowed to throw errors across a callback invocation, but it's not\r\nadvisable in general. Do this only if you know the C&nbsp;function, that\r\ncalled the callback, copes with the forced stack unwinding and doesn't\r\nleak resources.\r\n</p>\r\n<p>\r\nOne thing that's not allowed, is to let an FFI call into a C&nbsp;function\r\nget JIT-compiled, which in turn calls a callback, calling into Lua again.\r\nUsually this attempt is caught by the interpreter first and the\r\nC&nbsp;function is blacklisted for compilation.\r\n</p>\r\n<p>\r\nHowever, this heuristic may fail under specific circumstances: e.g. a\r\nmessage polling function might not run Lua callbacks right away and the call\r\ngets JIT-compiled. If it later happens to call back into Lua (e.g. a rarely\r\ninvoked error callback), you'll get a VM PANIC with the message\r\n<tt>\"bad callback\"</tt>. Then you'll need to manually turn off\r\nJIT-compilation with\r\n<a href=\"ext_jit.html#jit_onoff_func\"><tt>jit.off()</tt></a> for the\r\nsurrounding Lua function that invokes such a message polling function (or\r\nsimilar).\r\n</p>\r\n\r\n<h3 id=\"callback_resources\">Callback resource handling</h3>\r\n<p>\r\nCallbacks take up resources &mdash; you can only have a limited number\r\nof them at the same time (500&nbsp;-&nbsp;1000, depending on the\r\narchitecture). The associated Lua functions are anchored to prevent\r\ngarbage collection, too.\r\n</p>\r\n<p>\r\n<b>Callbacks due to implicit conversions are permanent!</b> There is no\r\nway to guess their lifetime, since the C&nbsp;side might store the\r\nfunction pointer for later use (typical for GUI toolkits). The associated\r\nresources cannot be reclaimed until termination:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\ntypedef int (__stdcall *WNDENUMPROC)(void *hwnd, intptr_t l);\r\nint EnumWindows(WNDENUMPROC func, intptr_t l);\r\n]]\r\n\r\n-- Implicit conversion to a callback via function pointer argument.\r\nlocal count = 0\r\nffi.C.EnumWindows(function(hwnd, l)\r\n  count = count + 1\r\n  return true\r\nend, 0)\r\n-- The callback is permanent and its resources cannot be reclaimed!\r\n-- Ok, so this may not be a problem, if you do this only once.\r\n</pre>\r\n<p>\r\nNote: this example shows that you <em>must</em> properly declare\r\n<tt>__stdcall</tt> callbacks on Windows/x86 systems. The calling\r\nconvention cannot be automatically detected, unlike for\r\n<tt>__stdcall</tt> calls <em>to</em> Windows functions.\r\n</p>\r\n<p>\r\nFor some use cases it's necessary to free up the resources or to\r\ndynamically redirect callbacks. Use an explicit cast to a\r\nC&nbsp;function pointer and keep the resulting cdata object. Then use\r\nthe <a href=\"ext_ffi_api.html#callback_free\"><tt>cb:free()</tt></a>\r\nor <a href=\"ext_ffi_api.html#callback_set\"><tt>cb:set()</tt></a> methods\r\non the cdata object:\r\n</p>\r\n<pre class=\"code\">\r\n-- Explicitly convert to a callback via cast.\r\nlocal count = 0\r\nlocal cb = ffi.cast(\"WNDENUMPROC\", function(hwnd, l)\r\n  count = count + 1\r\n  return true\r\nend)\r\n\r\n-- Pass it to a C function.\r\nffi.C.EnumWindows(cb, 0)\r\n-- EnumWindows doesn't need the callback after it returns, so free it.\r\n\r\ncb:free()\r\n-- The callback function pointer is no longer valid and its resources\r\n-- will be reclaimed. The created Lua closure will be garbage collected.\r\n</pre>\r\n\r\n<h3 id=\"callback_performance\">Callback performance</h3>\r\n<p>\r\n<b>Callbacks are slow!</b> First, the C&nbsp;to Lua transition itself\r\nhas an unavoidable cost, similar to a <tt>lua_call()</tt> or\r\n<tt>lua_pcall()</tt>. Argument and result marshalling add to that cost.\r\nAnd finally, neither the C&nbsp;compiler nor LuaJIT can inline or\r\noptimize across the language barrier and hoist repeated computations out\r\nof a callback function.\r\n</p>\r\n<p>\r\nDo not use callbacks for performance-sensitive work: e.g. consider a\r\nnumerical integration routine which takes a user-defined function to\r\nintegrate over. It's a bad idea to call a user-defined Lua function from\r\nC&nbsp;code millions of times. The callback overhead will be absolutely\r\ndetrimental for performance.\r\n</p>\r\n<p>\r\nIt's considerably faster to write the numerical integration routine\r\nitself in Lua &mdash; the JIT compiler will be able to inline the\r\nuser-defined function and optimize it together with its calling context,\r\nwith very competitive performance.\r\n</p>\r\n<p>\r\nAs a general guideline: <b>use callbacks only when you must</b>, because\r\nof existing C&nbsp;APIs. E.g. callback performance is irrelevant for a\r\nGUI application, which waits for user input most of the time, anyway.\r\n</p>\r\n<p>\r\nFor new designs <b>avoid push-style APIs</b>: a C&nbsp;function repeatedly\r\ncalling a callback for each result. Instead <b>use pull-style APIs</b>:\r\ncall a C&nbsp;function repeatedly to get a new result. Calls from Lua\r\nto C via the FFI are much faster than the other way round. Most well-designed\r\nlibraries already use pull-style APIs (read/write, get/put).\r\n</p>\r\n\r\n<h2 id=\"clib\">C Library Namespaces</h2>\r\n<p>\r\nA C&nbsp;library namespace is a special kind of object which allows\r\naccess to the symbols contained in shared libraries or the default\r\nsymbol namespace. The default\r\n<a href=\"ext_ffi_api.html#ffi_C\"><tt>ffi.C</tt></a> namespace is\r\nautomatically created when the FFI library is loaded. C&nbsp;library\r\nnamespaces for specific shared libraries may be created with the\r\n<a href=\"ext_ffi_api.html#ffi_load\"><tt>ffi.load()</tt></a> API\r\nfunction.\r\n</p>\r\n<p>\r\nIndexing a C&nbsp;library namespace object with a symbol name (a Lua\r\nstring) automatically binds it to the library. First the symbol type\r\nis resolved &mdash; it must have been declared with\r\n<a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a>. Then the\r\nsymbol address is resolved by searching for the symbol name in the\r\nassociated shared libraries or the default symbol namespace. Finally,\r\nthe resulting binding between the symbol name, the symbol type and its\r\naddress is cached. Missing symbol declarations or nonexistent symbol\r\nnames cause an error.\r\n</p>\r\n<p>\r\nThis is what happens on a <b>read access</b> for the different kinds of\r\nsymbols:\r\n</p>\r\n<ul>\r\n\r\n<li>External functions: a cdata object with the type of the function\r\nand its address is returned.</li>\r\n\r\n<li>External variables: the symbol address is dereferenced and the\r\nloaded value is <a href=\"#convert_tolua\">converted to a Lua object</a>\r\nand returned.</li>\r\n\r\n<li>Constant values (<tt>static&nbsp;const</tt> or <tt>enum</tt>\r\nconstants): the constant is <a href=\"#convert_tolua\">converted to a\r\nLua object</a> and returned.</li>\r\n\r\n</ul>\r\n<p>\r\nThis is what happens on a <b>write access</b>:\r\n</p>\r\n<ul>\r\n\r\n<li>External variables: the value to be written is\r\n<a href=\"#convert_fromlua\">converted to the C&nbsp;type</a> of the\r\nvariable and then stored at the symbol address.</li>\r\n\r\n<li>Writing to constant variables or to any other symbol type causes\r\nan error, like any other attempted write to a constant location.</li>\r\n\r\n</ul>\r\n<p>\r\nC&nbsp;library namespaces themselves are garbage collected objects. If\r\nthe last reference to the namespace object is gone, the garbage\r\ncollector will eventually release the shared library reference and\r\nremove all memory associated with the namespace. Since this may\r\ntrigger the removal of the shared library from the memory of the\r\nrunning process, it's generally <em>not safe</em> to use function\r\ncdata objects obtained from a library if the namespace object may be\r\nunreferenced.\r\n</p>\r\n<p>\r\nPerformance notice: the JIT compiler specializes to the identity of\r\nnamespace objects and to the strings used to index it. This\r\neffectively turns function cdata objects into constants. It's not\r\nuseful and actually counter-productive to explicitly cache these\r\nfunction objects, e.g. <tt>local strlen = ffi.C.strlen</tt>. OTOH it\r\n<em>is</em> useful to cache the namespace itself, e.g. <tt>local C =\r\nffi.C</tt>.\r\n</p>\r\n\r\n<h2 id=\"policy\">No Hand-holding!</h2>\r\n<p>\r\nThe FFI library has been designed as <b>a low-level library</b>. The\r\ngoal is to interface with C&nbsp;code and C&nbsp;data types with a\r\nminimum of overhead. This means <b>you can do anything you can do\r\nfrom&nbsp;C</b>: access all memory, overwrite anything in memory, call\r\nmachine code at any memory address and so on.\r\n</p>\r\n<p>\r\nThe FFI library provides <b>no memory safety</b>, unlike regular Lua\r\ncode. It will happily allow you to dereference a <tt>NULL</tt>\r\npointer, to access arrays out of bounds or to misdeclare\r\nC&nbsp;functions. If you make a mistake, your application might crash,\r\njust like equivalent C&nbsp;code would.\r\n</p>\r\n<p>\r\nThis behavior is inevitable, since the goal is to provide full\r\ninteroperability with C&nbsp;code. Adding extra safety measures, like\r\nbounds checks, would be futile. There's no way to detect\r\nmisdeclarations of C&nbsp;functions, since shared libraries only\r\nprovide symbol names, but no type information. Likewise there's no way\r\nto infer the valid range of indexes for a returned pointer.\r\n</p>\r\n<p>\r\nAgain: the FFI library is a low-level library. This implies it needs\r\nto be used with care, but it's flexibility and performance often\r\noutweigh this concern. If you're a C or C++ developer, it'll be easy\r\nto apply your existing knowledge. OTOH writing code for the FFI\r\nlibrary is not for the faint of heart and probably shouldn't be the\r\nfirst exercise for someone with little experience in Lua, C or C++.\r\n</p>\r\n<p>\r\nAs a corollary of the above, the FFI library is <b>not safe for use by\r\nuntrusted Lua code</b>. If you're sandboxing untrusted Lua code, you\r\ndefinitely don't want to give this code access to the FFI library or\r\nto <em>any</em> cdata object (except 64&nbsp;bit integers or complex\r\nnumbers). Any properly engineered Lua sandbox needs to provide safety\r\nwrappers for many of the standard Lua library functions &mdash;\r\nsimilar wrappers need to be written for high-level operations on FFI\r\ndata types, too.\r\n</p>\r\n\r\n<h2 id=\"status\">Current Status</h2>\r\n<p>\r\nThe initial release of the FFI library has some limitations and is\r\nmissing some features. Most of these will be fixed in future releases.\r\n</p>\r\n<p>\r\n<a href=\"#clang\">C language support</a> is\r\ncurrently incomplete:\r\n</p>\r\n<ul>\r\n<li>C&nbsp;declarations are not passed through a C&nbsp;pre-processor,\r\nyet.</li>\r\n<li>The C&nbsp;parser is able to evaluate most constant expressions\r\ncommonly found in C&nbsp;header files. However it doesn't handle the\r\nfull range of C&nbsp;expression semantics and may fail for some\r\nobscure constructs.</li>\r\n<li><tt>static const</tt> declarations only work for integer types\r\nup to 32&nbsp;bits. Neither declaring string constants nor\r\nfloating-point constants is supported.</li>\r\n<li>Packed <tt>struct</tt> bitfields that cross container boundaries\r\nare not implemented.</li>\r\n<li>Native vector types may be defined with the GCC <tt>mode</tt> or\r\n<tt>vector_size</tt> attribute. But no operations other than loading,\r\nstoring and initializing them are supported, yet.</li>\r\n<li>The <tt>volatile</tt> type qualifier is currently ignored by\r\ncompiled code.</li>\r\n<li><a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a> silently\r\nignores most re-declarations. Note: avoid re-declarations which do not\r\nconform to C99. The implementation will eventually be changed to\r\nperform strict checks.</li>\r\n</ul>\r\n<p>\r\nThe JIT compiler already handles a large subset of all FFI operations.\r\nIt automatically falls back to the interpreter for unimplemented\r\noperations (you can check for this with the\r\n<a href=\"running.html#opt_j\"><tt>-jv</tt></a> command line option).\r\nThe following operations are currently not compiled and may exhibit\r\nsuboptimal performance, especially when used in inner loops:\r\n</p>\r\n<ul>\r\n<li>Bitfield accesses and initializations.</li>\r\n<li>Vector operations.</li>\r\n<li>Table initializers.</li>\r\n<li>Initialization of nested <tt>struct</tt>/<tt>union</tt> types.</li>\r\n<li>Allocations of variable-length arrays or structs.</li>\r\n<li>Allocations of C&nbsp;types with a size &gt; 128&nbsp;bytes or an\r\nalignment &gt; 8&nbsp;bytes.</li>\r\n<li>Conversions from lightuserdata to <tt>void&nbsp;*</tt>.</li>\r\n<li>Pointer differences for element sizes that are not a power of\r\ntwo.</li>\r\n<li>Calls to C&nbsp;functions with aggregates passed or returned by\r\nvalue.</li>\r\n<li>Calls to ctype metamethods which are not plain functions.</li>\r\n<li>ctype <tt>__newindex</tt> tables and non-string lookups in ctype\r\n<tt>__index</tt> tables.</li>\r\n<li><tt>tostring()</tt> for cdata types.</li>\r\n<li>Calls to <tt>ffi.cdef()</tt>, <tt>ffi.load()</tt> and\r\n<tt>ffi.metatype()</tt>.</li>\r\n</ul>\r\n<p>\r\nOther missing features:\r\n</p>\r\n<ul>\r\n<li>Bit operations for 64&nbsp;bit types.</li>\r\n<li>Arithmetic for <tt>complex</tt> numbers.</li>\r\n<li>Passing structs by value to vararg C&nbsp;functions.</li>\r\n<li><a href=\"extensions.html#exceptions\">C++ exception interoperability</a>\r\ndoes not extend to C&nbsp;functions called via the FFI, if the call is\r\ncompiled.</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_ffi_tutorial.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Tutorial</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.idiomtable { font-size: 90%; line-height: 1.2; }\r\ntable.idiomtable tt { font-size: 100%; }\r\ntable.idiomtable td { vertical-align: top; }\r\ntr.idiomhead td { font-weight: bold; }\r\ntd.idiomlua b { font-weight: normal; color: #2142bf; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Tutorial</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page is intended to give you an overview of the features of the FFI\r\nlibrary by presenting a few use cases and guidelines.\r\n</p>\r\n<p>\r\nThis page makes no attempt to explain all of the FFI library, though.\r\nYou'll want to have a look at the <a href=\"ext_ffi_api.html\">ffi.* API\r\nfunction reference</a> and the <a href=\"ext_ffi_semantics.html\">FFI\r\nsemantics</a> to learn more.\r\n</p>\r\n\r\n<h2 id=\"load\">Loading the FFI Library</h2>\r\n<p>\r\nThe FFI library is built into LuaJIT by default, but it's not loaded\r\nand initialized by default. The suggested way to use the FFI library\r\nis to add the following to the start of every Lua file that needs one\r\nof its functions:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\n</pre>\r\n<p>\r\nPlease note this doesn't define an <tt>ffi</tt> variable in the table\r\nof globals &mdash; you really need to use the local variable. The\r\n<tt>require</tt> function ensures the library is only loaded once.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote: If you want to experiment with the FFI from the interactive prompt\r\nof the command line executable, omit the <tt>local</tt>, as it doesn't\r\npreserve local variables across lines.\r\n</p>\r\n\r\n<h2 id=\"sleep\">Accessing Standard System Functions</h2>\r\n<p>\r\nThe following code explains how to access standard system functions.\r\nWe slowly print two lines of dots by sleeping for 10&nbsp;milliseconds\r\nafter each dot:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n&#9314;\r\n&#9315;\r\n\r\n\r\n\r\n&#9316;\r\n\r\n\r\n\r\n\r\n\r\n&#9317;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">void Sleep(int ms);\r\nint poll(struct pollfd *fds, unsigned long nfds, int timeout);</span>\r\n]]\r\n\r\nlocal sleep\r\nif ffi.os == \"Windows\" then\r\n  function sleep(s)\r\n    ffi.C.Sleep(s*1000)\r\n  end\r\nelse\r\n  function sleep(s)\r\n    ffi.C.poll(nil, 0, s*1000)\r\n  end\r\nend\r\n\r\nfor i=1,160 do\r\n  io.write(\".\"); io.flush()\r\n  sleep(0.01)\r\nend\r\nio.write(\"\\n\")\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines the\r\nC&nbsp;library functions we're going to use. The part inside the\r\ndouble-brackets (in green) is just standard C&nbsp;syntax. You can\r\nusually get this info from the C&nbsp;header files or the\r\ndocumentation provided by each C&nbsp;library or C&nbsp;compiler.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> The difficulty we're\r\nfacing here, is that there are different standards to choose from.\r\nWindows has a simple <tt>Sleep()</tt> function. On other systems there\r\nare a variety of functions available to achieve sub-second sleeps, but\r\nwith no clear consensus. Thankfully <tt>poll()</tt> can be used for\r\nthis task, too, and it's present on most non-Windows systems. The\r\ncheck for <tt>ffi.os</tt> makes sure we use the Windows-specific\r\nfunction only on Windows systems.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Here we're wrapping the\r\ncall to the C&nbsp;function in a Lua function. This isn't strictly\r\nnecessary, but it's helpful to deal with system-specific issues only\r\nin one part of the code. The way we're wrapping it ensures the check\r\nfor the OS is only done during initialization and not for every call.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> A more subtle point is\r\nthat we defined our <tt>sleep()</tt> function (for the sake of this\r\nexample) as taking the number of seconds, but accepting fractional\r\nseconds. Multiplying this by 1000 gets us milliseconds, but that still\r\nleaves it a Lua number, which is a floating-point value. Alas, the\r\n<tt>Sleep()</tt> function only accepts an integer value. Luckily for\r\nus, the FFI library automatically performs the conversion when calling\r\nthe function (truncating the FP value towards zero, like in C).\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nSome readers will notice that <tt>Sleep()</tt> is part of\r\n<tt>KERNEL32.DLL</tt> and is also a <tt>stdcall</tt> function. So how\r\ncan this possibly work? The FFI library provides the <tt>ffi.C</tt>\r\ndefault C&nbsp;library namespace, which allows calling functions from\r\nthe default set of libraries, like a C&nbsp;compiler would. Also, the\r\nFFI library automatically detects <tt>stdcall</tt> functions, so you\r\ndon't need to declare them as such.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> The <tt>poll()</tt>\r\nfunction takes a couple more arguments we're not going to use. You can\r\nsimply use <tt>nil</tt> to pass a <tt>NULL</tt> pointer and <tt>0</tt>\r\nfor the <tt>nfds</tt> parameter. Please note that the\r\nnumber&nbsp;<tt>0</tt> <em>does not convert to a pointer value</em>,\r\nunlike in C++. You really have to pass pointers to pointer arguments\r\nand numbers to number arguments.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nThe page on <a href=\"ext_ffi_semantics.html\">FFI semantics</a> has all\r\nof the gory details about\r\n<a href=\"ext_ffi_semantics.html#convert\">conversions between Lua\r\nobjects and C&nbsp;types</a>. For the most part you don't have to deal\r\nwith this, as it's performed automatically and it's carefully designed\r\nto bridge the semantic differences between Lua and C.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> Now that we have defined\r\nour own <tt>sleep()</tt> function, we can just call it from plain Lua\r\ncode. That wasn't so bad, huh? Turning these boring animated dots into\r\na fascinating best-selling game is left as an exercise for the reader.\r\n:-)\r\n</p>\r\n\r\n<h2 id=\"zlib\">Accessing the zlib Compression Library</h2>\r\n<p>\r\nThe following code shows how to access the <a\r\nhref=\"http://zlib.net/\">zlib</a> compression library from Lua code.\r\nWe'll define two convenience wrapper functions that take a string and\r\ncompress or uncompress it to another string:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n\r\n\r\n&#9314;\r\n\r\n&#9315;\r\n\r\n\r\n&#9316;\r\n\r\n\r\n&#9317;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9318;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">unsigned long compressBound(unsigned long sourceLen);\r\nint compress2(uint8_t *dest, unsigned long *destLen,\r\n\t      const uint8_t *source, unsigned long sourceLen, int level);\r\nint uncompress(uint8_t *dest, unsigned long *destLen,\r\n\t       const uint8_t *source, unsigned long sourceLen);</span>\r\n]]\r\nlocal zlib = ffi.load(ffi.os == \"Windows\" and \"zlib1\" or \"z\")\r\n\r\nlocal function compress(txt)\r\n  local n = zlib.compressBound(#txt)\r\n  local buf = ffi.new(\"uint8_t[?]\", n)\r\n  local buflen = ffi.new(\"unsigned long[1]\", n)\r\n  local res = zlib.compress2(buf, buflen, txt, #txt, 9)\r\n  assert(res == 0)\r\n  return ffi.string(buf, buflen[0])\r\nend\r\n\r\nlocal function uncompress(comp, n)\r\n  local buf = ffi.new(\"uint8_t[?]\", n)\r\n  local buflen = ffi.new(\"unsigned long[1]\", n)\r\n  local res = zlib.uncompress(buf, buflen, comp, #comp)\r\n  assert(res == 0)\r\n  return ffi.string(buf, buflen[0])\r\nend\r\n\r\n-- Simple test code.\r\nlocal txt = string.rep(\"abcd\", 1000)\r\nprint(\"Uncompressed size: \", #txt)\r\nlocal c = compress(txt)\r\nprint(\"Compressed size: \", #c)\r\nlocal txt2 = uncompress(c, #txt)\r\nassert(txt2 == txt)\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines some of the\r\nC&nbsp;functions provided by zlib. For the sake of this example, some\r\ntype indirections have been reduced and it uses the pre-defined\r\nfixed-size integer types, while still adhering to the zlib API/ABI.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> This loads the zlib shared\r\nlibrary. On POSIX systems it's named <tt>libz.so</tt> and usually\r\ncomes pre-installed. Since <tt>ffi.load()</tt> automatically adds any\r\nmissing standard prefixes/suffixes, we can simply load the\r\n<tt>\"z\"</tt> library. On Windows it's named <tt>zlib1.dll</tt> and\r\nyou'll have to download it first from the\r\n<a href=\"http://zlib.net/\"><span class=\"ext\">&raquo;</span>&nbsp;zlib site</a>. The check for\r\n<tt>ffi.os</tt> makes sure we pass the right name to\r\n<tt>ffi.load()</tt>.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> First, the maximum size of\r\nthe compression buffer is obtained by calling the\r\n<tt>zlib.compressBound</tt> function with the length of the\r\nuncompressed string. The next line allocates a byte buffer of this\r\nsize. The <tt>[?]</tt> in the type specification indicates a\r\nvariable-length array (VLA). The actual number of elements of this\r\narray is given as the 2nd argument to <tt>ffi.new()</tt>.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> This may look strange at\r\nfirst, but have a look at the declaration of the <tt>compress2</tt>\r\nfunction from zlib: the destination length is defined as a pointer!\r\nThis is because you pass in the maximum buffer size and get back the\r\nactual length that was used.\r\n</p>\r\n<p>\r\nIn C you'd pass in the address of a local variable\r\n(<tt>&amp;buflen</tt>). But since there's no address-of operator in\r\nLua, we'll just pass in a one-element array. Conveniently it can be\r\ninitialized with the maximum buffer size in one step. Calling the\r\nactual <tt>zlib.compress2</tt> function is then straightforward.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> We want to return the\r\ncompressed data as a Lua string, so we'll use <tt>ffi.string()</tt>.\r\nIt needs a pointer to the start of the data and the actual length. The\r\nlength has been returned in the <tt>buflen</tt> array, so we'll just\r\nget it from there.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote that since the function returns now, the <tt>buf</tt> and\r\n<tt>buflen</tt> variables will eventually be garbage collected. This\r\nis fine, because <tt>ffi.string()</tt> has copied the contents to a\r\nnewly created (interned) Lua string. If you plan to call this function\r\nlots of times, consider reusing the buffers and/or handing back the\r\nresults in buffers instead of strings. This will reduce the overhead\r\nfor garbage collection and string interning.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> The <tt>uncompress</tt>\r\nfunctions does the exact opposite of the <tt>compress</tt> function.\r\nThe compressed data doesn't include the size of the original string,\r\nso this needs to be passed in. Otherwise no surprises here.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9318;</span> The code, that makes use\r\nof the functions we just defined, is just plain Lua code. It doesn't\r\nneed to know anything about the LuaJIT FFI &mdash; the convenience\r\nwrapper functions completely hide it.\r\n</p>\r\n<p>\r\nOne major advantage of the LuaJIT FFI is that you are now able to\r\nwrite those wrappers <em>in Lua</em>. And at a fraction of the time it\r\nwould cost you to create an extra C&nbsp;module using the Lua/C API.\r\nMany of the simpler C&nbsp;functions can probably be used directly\r\nfrom your Lua code, without any wrappers.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nSide note: the zlib API uses the <tt>long</tt> type for passing\r\nlengths and sizes around. But all those zlib functions actually only\r\ndeal with 32&nbsp;bit values. This is an unfortunate choice for a\r\npublic API, but may be explained by zlib's history &mdash; we'll just\r\nhave to deal with it.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nFirst, you should know that a <tt>long</tt> is a 64&nbsp;bit type e.g.\r\non POSIX/x64 systems, but a 32&nbsp;bit type on Windows/x64 and on\r\n32&nbsp;bit systems. Thus a <tt>long</tt> result can be either a plain\r\nLua number or a boxed 64&nbsp;bit integer cdata object, depending on\r\nthe target system.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nOk, so the <tt>ffi.*</tt> functions generally accept cdata objects\r\nwherever you'd want to use a number. That's why we get a away with\r\npassing <tt>n</tt> to <tt>ffi.string()</tt> above. But other Lua\r\nlibrary functions or modules don't know how to deal with this. So for\r\nmaximum portability one needs to use <tt>tonumber()</tt> on returned\r\n<tt>long</tt> results before passing them on. Otherwise the\r\napplication might work on some systems, but would fail in a POSIX/x64\r\nenvironment.\r\n</p>\r\n\r\n<h2 id=\"metatype\">Defining Metamethods for a C&nbsp;Type</h2>\r\n<p>\r\nThe following code explains how to define metamethods for a C type.\r\nWe define a simple point type and add some operations to it:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n&#9313;\r\n\r\n&#9314;\r\n\r\n&#9315;\r\n\r\n\r\n\r\n&#9316;\r\n\r\n&#9317;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">typedef struct { double x, y; } point_t;</span>\r\n]]\r\n\r\nlocal point\r\nlocal mt = {\r\n  __add = function(a, b) return point(a.x+b.x, a.y+b.y) end,\r\n  __len = function(a) return math.sqrt(a.x*a.x + a.y*a.y) end,\r\n  __index = {\r\n    area = function(a) return a.x*a.x + a.y*a.y end,\r\n  },\r\n}\r\npoint = ffi.metatype(\"point_t\", mt)\r\n\r\nlocal a = point(3, 4)\r\nprint(a.x, a.y)  --> 3  4\r\nprint(#a)        --> 5\r\nprint(a:area())  --> 25\r\nlocal b = a + point(0.5, 8)\r\nprint(#b)        --> 12.5\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines the C&nbsp;type for a\r\ntwo-dimensional point object.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> We have to declare the variable\r\nholding the point constructor first, because it's used inside of a\r\nmetamethod.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Let's define an <tt>__add</tt>\r\nmetamethod which adds the coordinates of two points and creates a new\r\npoint object. For simplicity, this function assumes that both arguments\r\nare points. But it could be any mix of objects, if at least one operand\r\nis of the required type (e.g. adding a point plus a number or vice\r\nversa). Our <tt>__len</tt> metamethod returns the distance of a point to\r\nthe origin.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> If we run out of operators, we can\r\ndefine named methods, too. Here the <tt>__index</tt> table defines an\r\n<tt>area</tt> function. For custom indexing needs, one might want to\r\ndefine <tt>__index</tt> and <tt>__newindex</tt> <em>functions</em> instead.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> This associates the metamethods with\r\nour C&nbsp;type. This only needs to be done once. For convenience, a\r\nconstructor is returned by\r\n<a href=\"ext_ffi_api.html#ffi_metatype\"><tt>ffi.metatype()</tt></a>.\r\nWe're not required to use it, though. The original C&nbsp;type can still\r\nbe used e.g. to create an array of points. The metamethods automatically\r\napply to any and all uses of this type.\r\n</p>\r\n<p>\r\nPlease note that the association with a metatable is permanent and\r\n<b>the metatable must not be modified afterwards!</b> Ditto for the\r\n<tt>__index</tt> table.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> Here are some simple usage examples\r\nfor the point type and their expected results. The pre-defined\r\noperations (such as <tt>a.x</tt>) can be freely mixed with the newly\r\ndefined metamethods. Note that <tt>area</tt> is a method and must be\r\ncalled with the Lua syntax for methods: <tt>a:area()</tt>, not\r\n<tt>a.area()</tt>.\r\n</p>\r\n<p>\r\nThe C&nbsp;type metamethod mechanism is most useful when used in\r\nconjunction with C&nbsp;libraries that are written in an object-oriented\r\nstyle. Creators return a pointer to a new instance and methods take an\r\ninstance pointer as the first argument. Sometimes you can just point\r\n<tt>__index</tt> to the library namespace and <tt>__gc</tt> to the\r\ndestructor and you're done. But often enough you'll want to add\r\nconvenience wrappers, e.g. to return actual Lua strings or when\r\nreturning multiple values.\r\n</p>\r\n<p>\r\nSome C libraries only declare instance pointers as an opaque\r\n<tt>void&nbsp;*</tt> type. In this case you can use a fake type for all\r\ndeclarations, e.g. a pointer to a named (incomplete) struct will do:\r\n<tt>typedef struct foo_type *foo_handle</tt>. The C&nbsp;side doesn't\r\nknow what you declare with the LuaJIT FFI, but as long as the underlying\r\ntypes are compatible, everything still works.\r\n</p>\r\n\r\n<h2 id=\"idioms\">Translating C&nbsp;Idioms</h2>\r\n<p>\r\nHere's a list of common C&nbsp;idioms and their translation to the\r\nLuaJIT FFI:\r\n</p>\r\n<table class=\"idiomtable\">\r\n<tr class=\"idiomhead\">\r\n<td class=\"idiomdesc\">Idiom</td>\r\n<td class=\"idiomc\">C&nbsp;code</td>\r\n<td class=\"idiomlua\">Lua code</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"idiomdesc\">Pointer dereference<br><tt>int *p;</tt></td><td class=\"idiomc\"><tt>x = *p;<br>*p = y;</tt></td><td class=\"idiomlua\"><tt>x = <b>p[0]</b><br><b>p[0]</b> = y</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"idiomdesc\">Pointer indexing<br><tt>int i, *p;</tt></td><td class=\"idiomc\"><tt>x = p[i];<br>p[i+1] = y;</tt></td><td class=\"idiomlua\"><tt>x = p[i]<br>p[i+1] = y</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Array indexing<br><tt>int i, a[];</tt></td><td class=\"idiomc\"><tt>x = a[i];<br>a[i+1] = y;</tt></td><td class=\"idiomlua\"><tt>x = a[i]<br>a[i+1] = y</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\"><tt>struct</tt>/<tt>union</tt> dereference<br><tt>struct foo s;</tt></td><td class=\"idiomc\"><tt>x = s.field;<br>s.field = y;</tt></td><td class=\"idiomlua\"><tt>x = s.field<br>s.field = y</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\"><tt>struct</tt>/<tt>union</tt> pointer deref.<br><tt>struct foo *sp;</tt></td><td class=\"idiomc\"><tt>x = sp->field;<br>sp->field = y;</tt></td><td class=\"idiomlua\"><tt>x = <b>s.field</b><br><b>s.field</b> = y</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\">Pointer arithmetic<br><tt>int i, *p;</tt></td><td class=\"idiomc\"><tt>x = p + i;<br>y = p - i;</tt></td><td class=\"idiomlua\"><tt>x = p + i<br>y = p - i</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Pointer difference<br><tt>int *p1, *p2;</tt></td><td class=\"idiomc\"><tt>x = p1 - p2;</tt></td><td class=\"idiomlua\"><tt>x = p1 - p2</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"idiomdesc\">Array element pointer<br><tt>int i, a[];</tt></td><td class=\"idiomc\"><tt>x = &amp;a[i];</tt></td><td class=\"idiomlua\"><tt>x = <b>a+i</b></tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Cast pointer to address<br><tt>int *p;</tt></td><td class=\"idiomc\"><tt>x = (intptr_t)p;</tt></td><td class=\"idiomlua\"><tt>x = <b>tonumber(<br>&nbsp;ffi.cast(\"intptr_t\",<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p))</b></tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\">Functions with outargs<br><tt>void foo(int *inoutlen);</tt></td><td class=\"idiomc\"><tt>int len = x;<br>foo(&amp;len);<br>y = len;</tt></td><td class=\"idiomlua\"><tt><b>local len =<br>&nbsp;&nbsp;ffi.new(\"int[1]\", x)<br>foo(len)<br>y = len[0]</b></tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\"><a href=\"ext_ffi_semantics.html#convert_vararg\">Vararg conversions</a><br><tt>int printf(char *fmt, ...);</tt></td><td class=\"idiomc\"><tt>printf(\"%g\", 1.0);<br>printf(\"%d\", 1);<br>&nbsp;</tt></td><td class=\"idiomlua\"><tt>printf(\"%g\", 1);<br>printf(\"%d\",<br>&nbsp;&nbsp;<b>ffi.new(\"int\", 1)</b>)</tt></td></tr>\r\n</table>\r\n\r\n<h2 id=\"cache\">To Cache or Not to Cache</h2>\r\n<p>\r\nIt's a common Lua idiom to cache library functions in local variables\r\nor upvalues, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nlocal byte, char = string.byte, string.char\r\nlocal function foo(x)\r\n  return char(byte(x)+1)\r\nend\r\n</pre>\r\n<p>\r\nThis replaces several hash-table lookups with a (faster) direct use of\r\na local or an upvalue. This is less important with LuaJIT, since the\r\nJIT compiler optimizes hash-table lookups a lot and is even able to\r\nhoist most of them out of the inner loops. It can't eliminate\r\n<em>all</em> of them, though, and it saves some typing for often-used\r\nfunctions. So there's still a place for this, even with LuaJIT.\r\n</p>\r\n<p>\r\nThe situation is a bit different with C&nbsp;function calls via the\r\nFFI library. The JIT compiler has special logic to eliminate <em>all\r\nof the lookup overhead</em> for functions resolved from a\r\n<a href=\"ext_ffi_semantics.html#clib\">C&nbsp;library namespace</a>!\r\nThus it's not helpful and actually counter-productive to cache\r\nindividual C&nbsp;functions like this:\r\n</p>\r\n<pre class=\"code\">\r\nlocal <b>funca</b>, <b>funcb</b> = ffi.C.funca, ffi.C.funcb -- <span style=\"color:#c00000;\">Not helpful!</span>\r\nlocal function foo(x, n)\r\n  for i=1,n do <b>funcb</b>(<b>funca</b>(x, i), 1) end\r\nend\r\n</pre>\r\n<p>\r\nThis turns them into indirect calls and generates bigger and slower\r\nmachine code. Instead you'll want to cache the namespace itself and\r\nrely on the JIT compiler to eliminate the lookups:\r\n</p>\r\n<pre class=\"code\">\r\nlocal <b>C</b> = ffi.C          -- <span style=\"color:#00a000;\">Instead use this!</span>\r\nlocal function foo(x, n)\r\n  for i=1,n do <b>C.funcb</b>(<b>C.funca</b>(x, i), 1) end\r\nend\r\n</pre>\r\n<p>\r\nThis generates both shorter and faster code. So <b>don't cache\r\nC&nbsp;functions</b>, but <b>do</b> cache namespaces! Most often the\r\nnamespace is already in a local variable at an outer scope, e.g. from\r\n<tt>local&nbsp;lib&nbsp;=&nbsp;ffi.load(...)</tt>. Note that copying\r\nit to a local variable in the function scope is unnecessary.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/ext_jit.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>jit.* Library</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1><tt>jit.*</tt> Library</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThe functions in this built-in module control the behavior of the JIT\r\ncompiler engine. Note that JIT-compilation is fully automatic &mdash;\r\nyou probably won't need to use any of the following functions unless\r\nyou have special needs.\r\n</p>\r\n\r\n<h3 id=\"jit_onoff\"><tt>jit.on()<br>\r\njit.off()</tt></h3>\r\n<p>\r\nTurns the whole JIT compiler on (default) or off.\r\n</p>\r\n<p>\r\nThese functions are typically used with the command line options\r\n<tt>-j on</tt> or <tt>-j off</tt>.\r\n</p>\r\n\r\n<h3 id=\"jit_flush\"><tt>jit.flush()</tt></h3>\r\n<p>\r\nFlushes the whole cache of compiled code.\r\n</p>\r\n\r\n<h3 id=\"jit_onoff_func\"><tt>jit.on(func|true [,true|false])<br>\r\njit.off(func|true [,true|false])<br>\r\njit.flush(func|true [,true|false])</tt></h3>\r\n<p>\r\n<tt>jit.on</tt> enables JIT compilation for a Lua function (this is\r\nthe default).\r\n</p>\r\n<p>\r\n<tt>jit.off</tt> disables JIT compilation for a Lua function and\r\nflushes any already compiled code from the code cache.\r\n</p>\r\n<p>\r\n<tt>jit.flush</tt> flushes the code, but doesn't affect the\r\nenable/disable status.\r\n</p>\r\n<p>\r\nThe current function, i.e. the Lua function calling this library\r\nfunction, can also be specified by passing <tt>true</tt> as the first\r\nargument.\r\n</p>\r\n<p>\r\nIf the second argument is <tt>true</tt>, JIT compilation is also\r\nenabled, disabled or flushed recursively for all sub-functions of a\r\nfunction. With <tt>false</tt> only the sub-functions are affected.\r\n</p>\r\n<p>\r\nThe <tt>jit.on</tt> and <tt>jit.off</tt> functions only set a flag\r\nwhich is checked when the function is about to be compiled. They do\r\nnot trigger immediate compilation.\r\n</p>\r\n<p>\r\nTypical usage is <tt>jit.off(true, true)</tt> in the main chunk\r\nof a module to turn off JIT compilation for the whole module for\r\ndebugging purposes.\r\n</p>\r\n\r\n<h3 id=\"jit_flush_tr\"><tt>jit.flush(tr)</tt></h3>\r\n<p>\r\nFlushes the root trace, specified by its number, and all of its side\r\ntraces from the cache. The code for the trace will be retained as long\r\nas there are any other traces which link to it.\r\n</p>\r\n\r\n<h3 id=\"jit_status\"><tt>status, ... = jit.status()</tt></h3>\r\n<p>\r\nReturns the current status of the JIT compiler. The first result is\r\neither <tt>true</tt> or <tt>false</tt> if the JIT compiler is turned\r\non or off. The remaining results are strings for CPU-specific features\r\nand enabled optimizations.\r\n</p>\r\n\r\n<h3 id=\"jit_version\"><tt>jit.version</tt></h3>\r\n<p>\r\nContains the LuaJIT version string.\r\n</p>\r\n\r\n<h3 id=\"jit_version_num\"><tt>jit.version_num</tt></h3>\r\n<p>\r\nContains the version number of the LuaJIT core. Version xx.yy.zz\r\nis represented by the decimal number xxyyzz.\r\n</p>\r\n\r\n<h3 id=\"jit_os\"><tt>jit.os</tt></h3>\r\n<p>\r\nContains the target OS name:\r\n\"Windows\", \"Linux\", \"OSX\", \"BSD\", \"POSIX\" or \"Other\".\r\n</p>\r\n\r\n<h3 id=\"jit_arch\"><tt>jit.arch</tt></h3>\r\n<p>\r\nContains the target architecture name:\r\n\"x86\", \"x64\", \"arm\", \"ppc\", \"ppcspe\", or \"mips\".\r\n</p>\r\n\r\n<h2 id=\"jit_opt\"><tt>jit.opt.*</tt> &mdash; JIT compiler optimization control</h2>\r\n<p>\r\nThis sub-module provides the backend for the <tt>-O</tt> command line\r\noption.\r\n</p>\r\n<p>\r\nYou can also use it programmatically, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\njit.opt.start(2) -- same as -O2\r\njit.opt.start(\"-dce\")\r\njit.opt.start(\"hotloop=10\", \"hotexit=2\")\r\n</pre>\r\n<p>\r\nUnlike in LuaJIT 1.x, the module is built-in and\r\n<b>optimization is turned on by default!</b>\r\nIt's no longer necessary to run <tt>require(\"jit.opt\").start()</tt>,\r\nwhich was one of the ways to enable optimization.\r\n</p>\r\n\r\n<h2 id=\"jit_util\"><tt>jit.util.*</tt> &mdash; JIT compiler introspection</h2>\r\n<p>\r\nThis sub-module holds functions to introspect the bytecode, generated\r\ntraces, the IR and the generated machine code. The functionality\r\nprovided by this module is still in flux and therefore undocumented.\r\n</p>\r\n<p>\r\nThe debug modules <tt>-jbc</tt>, <tt>-jv</tt> and <tt>-jdump</tt> make\r\nextensive use of these functions. Please check out their source code,\r\nif you want to know more.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/extensions.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Extensions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.exc {\r\n  line-height: 1.2;\r\n}\r\ntr.exchead td {\r\n  font-weight: bold;\r\n}\r\ntd.excplatform {\r\n  width: 48%;\r\n}\r\ntd.exccompiler {\r\n  width: 29%;\r\n}\r\ntd.excinterop {\r\n  width: 23%;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Extensions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is fully upwards-compatible with Lua 5.1. It supports all\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#5\"><span class=\"ext\">&raquo;</span>&nbsp;standard Lua\r\nlibrary functions</a> and the full set of\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#3\"><span class=\"ext\">&raquo;</span>&nbsp;Lua/C API\r\nfunctions</a>.\r\n</p>\r\n<p>\r\nLuaJIT is also fully ABI-compatible to Lua 5.1 at the linker/dynamic\r\nloader level. This means you can compile a C&nbsp;module against the\r\nstandard Lua headers and load the same shared library from either Lua\r\nor LuaJIT.\r\n</p>\r\n<p>\r\nLuaJIT extends the standard Lua VM with new functionality and adds\r\nseveral extension modules. Please note this page is only about\r\n<em>functional</em> enhancements and not about performance enhancements,\r\nsuch as the optimized VM, the faster interpreter or the JIT compiler.\r\n</p>\r\n\r\n<h2 id=\"modules\">Extensions Modules</h2>\r\n<p>\r\nLuaJIT comes with several built-in extension modules:\r\n</p>\r\n\r\n<h3 id=\"bit\"><tt>bit.*</tt> &mdash; Bitwise operations</h3>\r\n<p>\r\nLuaJIT supports all bitwise operations as defined by\r\n<a href=\"http://bitop.luajit.org\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp</a>:\r\n</p>\r\n<pre class=\"code\">\r\nbit.tobit  bit.tohex  bit.bnot    bit.band bit.bor  bit.bxor\r\nbit.lshift bit.rshift bit.arshift bit.rol  bit.ror  bit.bswap\r\n</pre>\r\n<p>\r\nThis module is a LuaJIT built-in &mdash; you don't need to download or\r\ninstall Lua BitOp. The Lua BitOp site has full documentation for all\r\n<a href=\"http://bitop.luajit.org/api.html\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp API functions</a>.\r\n</p>\r\n<p>\r\nPlease make sure to <tt>require</tt> the module before using any of\r\nits functions:\r\n</p>\r\n<pre class=\"code\">\r\nlocal bit = require(\"bit\")\r\n</pre>\r\n<p>\r\nAn already installed Lua BitOp module is ignored by LuaJIT.\r\nThis way you can use bit operations from both Lua and LuaJIT on a\r\nshared installation.\r\n</p>\r\n\r\n<h3 id=\"ffi\"><tt>ffi.*</tt> &mdash; FFI library</h3>\r\n<p>\r\nThe <a href=\"ext_ffi.html\">FFI library</a> allows calling external\r\nC&nbsp;functions and the use of C&nbsp;data structures from pure Lua\r\ncode.\r\n</p>\r\n\r\n<h3 id=\"jit\"><tt>jit.*</tt> &mdash; JIT compiler control</h3>\r\n<p>\r\nThe functions in this module\r\n<a href=\"ext_jit.html\">control the behavior of the JIT compiler engine</a>.\r\n</p>\r\n\r\n<h3 id=\"c_api\">C API extensions</h3>\r\n<p>\r\nLuaJIT adds some\r\n<a href=\"ext_c_api.html\">extra functions to the Lua/C API</a>.\r\n</p>\r\n\r\n<h2 id=\"library\">Enhanced Standard Library Functions</h2>\r\n\r\n<h3 id=\"xpcall\"><tt>xpcall(f, err [,args...])</tt> passes arguments</h3>\r\n<p>\r\nUnlike the standard implementation in Lua 5.1, <tt>xpcall()</tt>\r\npasses any arguments after the error function to the function\r\nwhich is called in a protected context.\r\n</p>\r\n\r\n<h3 id=\"load\"><tt>loadfile()</tt> etc. handle UTF-8 source code</h3>\r\n<p>\r\nNon-ASCII characters are handled transparently by the Lua source code parser.\r\nThis allows the use of UTF-8 characters in identifiers and strings.\r\nA UTF-8 BOM is skipped at the start of the source code.\r\n</p>\r\n\r\n<h3 id=\"tostring\"><tt>tostring()</tt> etc. canonicalize NaN and &plusmn;Inf</h3>\r\n<p>\r\nAll number-to-string conversions consistently convert non-finite numbers\r\nto the same strings on all platforms. NaN results in <tt>\"nan\"</tt>,\r\npositive infinity results in <tt>\"inf\"</tt> and negative infinity results\r\nin <tt>\"-inf\"</tt>.\r\n</p>\r\n\r\n<h3 id=\"tonumber\"><tt>tonumber()</tt> etc. use builtin string to number conversion</h3>\r\n<p>\r\nAll string-to-number conversions consistently convert integer and\r\nfloating-point inputs in decimal and hexadecimal on all platforms.\r\n<tt>strtod()</tt> is <em>not</em> used anymore, which avoids numerous\r\nproblems with poor C library implementations. The builtin conversion\r\nfunction provides full precision according to the IEEE-754 standard, it\r\nworks independently of the current locale and it supports hex floating-point\r\nnumbers (e.g. <tt>0x1.5p-3</tt>).\r\n</p>\r\n\r\n<h3 id=\"string_dump\"><tt>string.dump(f [,strip])</tt> generates portable bytecode</h3>\r\n<p>\r\nAn extra argument has been added to <tt>string.dump()</tt>. If set to\r\n<tt>true</tt>, 'stripped' bytecode without debug information is\r\ngenerated. This speeds up later bytecode loading and reduces memory\r\nusage. See also the\r\n<a href=\"running.html#opt_b\"><tt>-b</tt> command line option</a>.\r\n</p>\r\n<p>\r\nThe generated bytecode is portable and can be loaded on any architecture\r\nthat LuaJIT supports, independent of word size or endianess. However the\r\nbytecode compatibility versions must match. Bytecode stays compatible\r\nfor dot releases (x.y.0 &rarr; x.y.1), but may change with major or\r\nminor releases (2.0 &rarr; 2.1) or between any beta release. Foreign\r\nbytecode (e.g. from Lua 5.1) is incompatible and cannot be loaded.\r\n</p>\r\n\r\n<h3 id=\"math_random\">Enhanced PRNG for <tt>math.random()</tt></h3>\r\n<p>\r\nLuaJIT uses a Tausworthe PRNG with period 2^223 to implement\r\n<tt>math.random()</tt> and <tt>math.randomseed()</tt>. The quality of\r\nthe PRNG results is much superior compared to the standard Lua\r\nimplementation which uses the platform-specific ANSI rand().\r\n</p>\r\n<p>\r\nThe PRNG generates the same sequences from the same seeds on all\r\nplatforms and makes use of all bits in the seed argument.\r\n<tt>math.random()</tt> without arguments generates 52 pseudo-random bits\r\nfor every call. The result is uniformly distributed between 0.0 and 1.0.\r\nIt's correctly scaled up and rounded for <tt>math.random(n&nbsp;[,m])</tt> to\r\npreserve uniformity.\r\n</p>\r\n\r\n<h3 id=\"io\"><tt>io.*</tt> functions handle 64&nbsp;bit file offsets</h3>\r\n<p>\r\nThe file I/O functions in the standard <tt>io.*</tt> library handle\r\n64&nbsp;bit file offsets. In particular this means it's possible\r\nto open files larger than 2&nbsp;Gigabytes and to reposition or obtain\r\nthe current file position for offsets beyond 2&nbsp;GB\r\n(<tt>fp:seek()</tt> method).\r\n</p>\r\n\r\n<h3 id=\"debug_meta\"><tt>debug.*</tt> functions identify metamethods</h3>\r\n<p>\r\n<tt>debug.getinfo()</tt> and <tt>lua_getinfo()</tt> also return information\r\nabout invoked metamethods. The <tt>namewhat</tt> field is set to\r\n<tt>\"metamethod\"</tt> and the <tt>name</tt> field has the name of\r\nthe corresponding metamethod (e.g. <tt>\"__index\"</tt>).\r\n</p>\r\n\r\n<h2 id=\"resumable\">Fully Resumable VM</h2>\r\n<p>\r\nThe LuaJIT VM is fully resumable. This means you can yield from a\r\ncoroutine even across contexts, where this would not possible with\r\nthe standard Lua&nbsp;5.1 VM: e.g. you can yield across <tt>pcall()</tt>\r\nand <tt>xpcall()</tt>, across iterators and across metamethods.\r\n</p>\r\n\r\n<h2 id=\"lua52\">Extensions from Lua 5.2</h2>\r\n<p>\r\nLuaJIT supports some language and library extensions from Lua&nbsp;5.2.\r\nFeatures that are unlikely to break existing code are unconditionally\r\nenabled:\r\n</p>\r\n<ul>\r\n<li><tt>goto</tt> and <tt>::labels::</tt>.</li>\r\n<li>Hex escapes <tt>'\\x3F'</tt> and <tt>'\\*'</tt> escape in strings.</li>\r\n<li><tt>load(string|reader [, chunkname [,mode [,env]]])</tt>.</li>\r\n<li><tt>loadstring()</tt> is an alias for <tt>load()</tt>.</li>\r\n<li><tt>loadfile(filename [,mode [,env]])</tt>.</li>\r\n<li><tt>math.log(x [,base])</tt>.\r\n<li><tt>string.rep(s, n [,sep])</tt>.\r\n<li><tt>string.format()</tt>: <tt>%q</tt> reversible.\r\n<tt>%s</tt> checks <tt>__tostring</tt>.\r\n<tt>%a</tt> and <tt>\"%A</tt> added.</li>\r\n<li>String matching pattern <tt>%g</tt> added.</li>\r\n<li><tt>io.read(\"*L\")</tt>.</li>\r\n<li><tt>io.lines()</tt> and <tt>file:lines()</tt> process\r\n<tt>io.read()</tt> options.</li>\r\n<li><tt>os.exit(status|true|false [,close])</tt>.</li>\r\n<li><tt>package.searchpath(name, path [, sep [, rep]])</tt>.</li>\r\n<li><tt>package.loadlib(name, \"*\")</tt>.</li>\r\n<li><tt>debug.getinfo()</tt> returns <tt>nparams</tt> and <tt>isvararg</tt>\r\nfor option <tt>\"u\"</tt>.</li>\r\n<li><tt>debug.getlocal()</tt> accepts function instead of level.</li>\r\n<li><tt>debug.getlocal()</tt> and <tt>debug.setlocal()</tt> accept negative\r\nindexes for varargs.</li>\r\n<li><tt>debug.getupvalue()</tt> and <tt>debug.setupvalue()</tt> handle\r\nC&nbsp;functions.</li>\r\n<li><tt>debug.upvalueid()</tt> and <tt>debug.upvaluejoin()</tt>.</li>\r\n<li>Command line option <tt>-E</tt>.</li>\r\n<li>Command line checks <tt>__tostring</tt> for errors.</li>\r\n</ul>\r\n<p>\r\nOther features are only enabled, if LuaJIT is built with\r\n<tt>-DLUAJIT_ENABLE_LUA52COMPAT</tt>:\r\n</p>\r\n<ul>\r\n<li><tt>goto</tt> is a keyword and not a valid variable name anymore.</li>\r\n<li><tt>break</tt> can be placed anywhere. Empty statements (<tt>;;</tt>)\r\nare allowed.</li>\r\n<li><tt>__lt</tt>, <tt>__le</tt> are invoked for mixed types.</li>\r\n<li><tt>__len</tt> for tables. <tt>rawlen()</tt> library function.</li>\r\n<li><tt>pairs()</tt> and <tt>ipairs()</tt> check for <tt>__pairs</tt> and\r\n<tt>__ipairs</tt>.</li>\r\n<li><tt>coroutine.running()</tt> returns two results.</li>\r\n<li><tt>table.pack()</tt> and <tt>table.unpack()</tt>\r\n(same as <tt>unpack()</tt>).</li>\r\n<li><tt>io.write()</tt> and <tt>file:write()</tt> return file handle\r\ninstead of <tt>true</tt>.</li>\r\n<li><tt>os.execute()</tt> and <tt>pipe:close()</tt> return detailed\r\nexit status.</li>\r\n<li><tt>debug.setmetatable()</tt> returns object.</li>\r\n<li><tt>debug.getuservalue()</tt> and <tt>debug.setuservalue()</tt>.</li>\r\n<li>Remove <tt>math.mod()</tt>, <tt>string.gfind()</tt>.\r\n</ul>\r\n<p>\r\nNote: this provides only partial compatibility with Lua 5.2 at the\r\nlanguage and Lua library level. LuaJIT is API+ABI-compatible with\r\nLua&nbsp;5.1, which prevents implementing features that would otherwise\r\nbreak the Lua/C API and ABI (e.g. <tt>_ENV</tt>).\r\n</p>\r\n\r\n<h2 id=\"exceptions\">C++ Exception Interoperability</h2>\r\n<p>\r\nLuaJIT has built-in support for interoperating with C++&nbsp;exceptions.\r\nThe available range of features depends on the target platform and\r\nthe toolchain used to compile LuaJIT:\r\n</p>\r\n<table class=\"exc\">\r\n<tr class=\"exchead\">\r\n<td class=\"excplatform\">Platform</td>\r\n<td class=\"exccompiler\">Compiler</td>\r\n<td class=\"excinterop\">Interoperability</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"excplatform\">POSIX/x64, DWARF2 unwinding</td>\r\n<td class=\"exccompiler\">GCC 4.3+</td>\r\n<td class=\"excinterop\"><b style=\"color: #00a000;\">Full</b></td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"excplatform\">Other platforms, DWARF2 unwinding</td>\r\n<td class=\"exccompiler\">GCC</td>\r\n<td class=\"excinterop\"><b style=\"color: #c06000;\">Limited</b></td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"excplatform\">Windows/x64</td>\r\n<td class=\"exccompiler\">MSVC or WinSDK</td>\r\n<td class=\"excinterop\"><b style=\"color: #00a000;\">Full</b></td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"excplatform\">Windows/x86</td>\r\n<td class=\"exccompiler\">Any</td>\r\n<td class=\"excinterop\"><b style=\"color: #a00000;\">No</b></td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"excplatform\">Other platforms</td>\r\n<td class=\"exccompiler\">Other compilers</td>\r\n<td class=\"excinterop\"><b style=\"color: #a00000;\">No</b></td>\r\n</tr>\r\n</table>\r\n<p>\r\n<b style=\"color: #00a000;\">Full interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>C++&nbsp;exceptions can be caught on the Lua side with <tt>pcall()</tt>,\r\n<tt>lua_pcall()</tt> etc.</li>\r\n<li>C++&nbsp;exceptions will be converted to the generic Lua error\r\n<tt>\"C++&nbsp;exception\"</tt>, unless you use the\r\n<a href=\"ext_c_api.html#mode_wrapcfunc\">C&nbsp;call wrapper</a> feature.</li>\r\n<li>It's safe to throw C++&nbsp;exceptions across non-protected Lua frames\r\non the C&nbsp;stack. The contents of the C++&nbsp;exception object\r\npass through unmodified.</li>\r\n<li>Lua errors can be caught on the C++ side with <tt>catch(...)</tt>.\r\nThe corresponding Lua error message can be retrieved from the Lua stack.</li>\r\n<li>Throwing Lua errors across C++ frames is safe. C++ destructors\r\nwill be called.</li>\r\n</ul>\r\n<p>\r\n<b style=\"color: #c06000;\">Limited interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>C++&nbsp;exceptions can be caught on the Lua side with <tt>pcall()</tt>,\r\n<tt>lua_pcall()</tt> etc.</li>\r\n<li>C++&nbsp;exceptions will be converted to the generic Lua error\r\n<tt>\"C++&nbsp;exception\"</tt>, unless you use the\r\n<a href=\"ext_c_api.html#mode_wrapcfunc\">C&nbsp;call wrapper</a> feature.</li>\r\n<li>C++&nbsp;exceptions will be caught by non-protected Lua frames and\r\nare rethrown as a generic Lua error. The C++&nbsp;exception object will\r\nbe destroyed.</li>\r\n<li>Lua errors <b>cannot</b> be caught on the C++ side.</li>\r\n<li>Throwing Lua errors across C++ frames will <b>not</b> call\r\nC++ destructors.</li>\r\n</ul>\r\n\r\n<p>\r\n<b style=\"color: #a00000;\">No interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>It's <b>not</b> safe to throw C++&nbsp;exceptions across Lua frames.</li>\r\n<li>C++&nbsp;exceptions <b>cannot</b> be caught on the Lua side.</li>\r\n<li>Lua errors <b>cannot</b> be caught on the C++ side.</li>\r\n<li>Throwing Lua errors across C++ frames will <b>not</b> call\r\nC++ destructors.</li>\r\n<li>Additionally, on Windows/x86 with SEH-based C++&nbsp;exceptions:\r\nit's <b>not</b> safe to throw a Lua error across any frames containing\r\na C++ function with any try/catch construct or using variables with\r\n(implicit) destructors. This also applies to any functions which may be\r\ninlined in such a function. It doesn't matter whether <tt>lua_error()</tt>\r\nis called inside or outside of a try/catch or whether any object actually\r\nneeds to be destroyed: the SEH chain is corrupted and this will eventually\r\nlead to the termination of the process.</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/faq.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Frequently Asked Questions (FAQ)</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ndd { margin-left: 1.5em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Frequently Asked Questions (FAQ)</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<dl>\r\n<dt>Q: Where can I learn more about LuaJIT and Lua?</dt>\r\n<dd>\r\n<ul style=\"padding: 0;\">\r\n<li>The <a href=\"http://luajit.org/list.html\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT mailing list</a> focuses on topics\r\nrelated to LuaJIT.</li>\r\n<li>The <a href=\"http://wiki.luajit.org/\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT wiki</a> gathers community\r\nresources about LuaJIT.</li>\r\n<li>News about Lua itself can be found at the\r\n<a href=\"http://www.lua.org/lua-l.html\"><span class=\"ext\">&raquo;</span>&nbsp;Lua mailing list</a>.\r\nThe mailing list archives are worth checking out for older postings\r\nabout LuaJIT.</li>\r\n<li>The <a href=\"http://lua.org\"><span class=\"ext\">&raquo;</span>&nbsp;main Lua.org site</a> has complete\r\n<a href=\"http://www.lua.org/docs.html\"><span class=\"ext\">&raquo;</span>&nbsp;documentation</a> of the language\r\nand links to books and papers about Lua.</li>\r\n<li>The community-managed <a href=\"http://lua-users.org/wiki/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua Wiki</a>\r\nhas information about diverse topics.</li>\r\n</ul>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Where can I learn more about the compiler technology used by LuaJIT?</dt>\r\n<dd>\r\nI'm planning to write more documentation about the internals of LuaJIT.\r\nIn the meantime, please use the following Google Scholar searches\r\nto find relevant papers:<br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Trace+Compiler\"><span class=\"ext\">&raquo;</span>&nbsp;Trace Compiler</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=JIT+Compiler\"><span class=\"ext\">&raquo;</span>&nbsp;JIT Compiler</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Dynamic+Language+Optimizations\"><span class=\"ext\">&raquo;</span>&nbsp;Dynamic Language Optimizations</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=SSA+Form\"><span class=\"ext\">&raquo;</span>&nbsp;SSA Form</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Linear+Scan+Register+Allocation\"><span class=\"ext\">&raquo;</span>&nbsp;Linear Scan Register Allocation</a><br>\r\nHere is a list of the <a href=\"http://article.gmane.org/gmane.comp.lang.lua.general/58908\"><span class=\"ext\">&raquo;</span>&nbsp;innovative features in LuaJIT</a>.<br>\r\nAnd, you know, reading the source is of course the only way to enlightenment. :-)\r\n</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why do I get this error: \"attempt to index global 'arg' (a nil value)\"?<br>\r\nQ: My vararg functions fail after switching to LuaJIT!</dt>\r\n<dd>LuaJIT is compatible to the Lua 5.1 language standard. It doesn't\r\nsupport the implicit <tt>arg</tt> parameter for old-style vararg\r\nfunctions from Lua 5.0.<br>Please convert your code to the\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#2.5.9\"><span class=\"ext\">&raquo;</span>&nbsp;Lua 5.1\r\nvararg syntax</a>.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why do I get this error: \"bad FPU precision\"?<br>\r\n<dt>Q: I get weird behavior after initializing Direct3D.<br>\r\n<dt>Q: Some FPU operations crash after I load a Delphi DLL.<br>\r\n</dt>\r\n<dd>\r\n\r\nDirectX/Direct3D (up to version 9) sets the x87 FPU to single-precision\r\nmode by default. This violates the Windows ABI and interferes with the\r\noperation of many programs &mdash; LuaJIT is affected, too. Please make\r\nsure you always use the <tt>D3DCREATE_FPU_PRESERVE</tt> flag when\r\ninitializing Direct3D.<br>\r\n\r\nDirect3D version 10 or higher do not show this behavior anymore.\r\nConsider testing your application with older versions, too.<br>\r\n\r\nSimilarly, the Borland/Delphi runtime modifies the FPU control word and\r\nenables FP exceptions. Of course this violates the Windows ABI, too.\r\nPlease check the Delphi docs for the Set8087CW method.\r\n\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Sometimes Ctrl-C fails to stop my Lua program. Why?</dt>\r\n<dd>The interrupt signal handler sets a Lua debug hook. But this is\r\ncurrently ignored by compiled code (this will eventually be fixed). If\r\nyour program is running in a tight loop and never falls back to the\r\ninterpreter, the debug hook never runs and can't throw the\r\n\"interrupted!\" error.<br> In the meantime you have to press Ctrl-C\r\ntwice to get stop your program. That's similar to when it's stuck\r\nrunning inside a C function under the Lua interpreter.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why doesn't my favorite power-patch for Lua apply against LuaJIT?</dt>\r\n<dd>Because it's a completely redesigned VM and has very little code\r\nin common with Lua anymore. Also, if the patch introduces changes to\r\nthe Lua semantics, these would need to be reflected everywhere in the\r\nVM, from the interpreter up to all stages of the compiler.<br> Please\r\nuse only standard Lua language constructs. For many common needs you\r\ncan use source transformations or use wrapper or proxy functions.\r\nThe compiler will happily optimize away such indirections.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Lua runs everywhere. Why doesn't LuaJIT support my CPU?</dt>\r\n<dd>Because it's a compiler &mdash; it needs to generate native\r\nmachine code. This means the code generator must be ported to each\r\narchitecture. And the fast interpreter is written in assembler and\r\nmust be ported, too. This is quite an undertaking.<br>\r\nThe <a href=\"install.html\">install documentation</a> shows the supported\r\narchitectures. Other architectures will follow based on sufficient user\r\ndemand and/or sponsoring.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: When will feature X be added? When will the next version be released?</dt>\r\n<dd>When it's ready.<br>\r\nC'mon, it's open source &mdash; I'm doing it on my own time and you're\r\ngetting it for free. You can either contribute a patch or sponsor\r\nthe development of certain features, if they are important to you.\r\n</dd>\r\n</dl>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/install.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Installation</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.compat {\r\n  line-height: 1.2;\r\n  font-size: 80%;\r\n}\r\ntable.compat td {\r\n  border: 1px solid #bfcfff;\r\n  height: 2.5em;\r\n}\r\ntable.compat tr.compathead td {\r\n  font-weight: bold;\r\n  border-bottom: 2px solid #bfcfff;\r\n}\r\ntr.compathead td.compatos {\r\n  vertical-align: top;\r\n}\r\ntable.compat td.compatcpu {\r\n  width: 18%;\r\n  border-right: 2px solid #bfcfff;\r\n}\r\ntd.compatos {\r\n  width: 21%;\r\n  vertical-align: middle;\r\n}\r\ntd.compatno {\r\n  background-color: #d0d0d0;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Installation</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a class=\"current\" href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is only distributed as a source package. This page explains\r\nhow to build and install LuaJIT with different operating systems\r\nand C&nbsp;compilers.\r\n</p>\r\n<p>\r\nFor the impatient (on POSIX systems):\r\n</p>\r\n<pre class=\"code\">\r\nmake &amp;&amp; sudo make install\r\n</pre>\r\n<p>\r\nLuaJIT currently builds out-of-the box on most systems.\r\nHere's the compatibility matrix for the supported combinations of\r\noperating systems, CPUs and compilers:\r\n</p>\r\n<table class=\"compat\">\r\n<tr class=\"compathead\">\r\n<td class=\"compatcpu\">CPU / OS</td>\r\n<td class=\"compatos\"><a href=\"#posix\">Linux</a> or<br><a href=\"#android\">Android</a></td>\r\n<td class=\"compatos\"><a href=\"#posix\">*BSD, Other</a></td>\r\n<td class=\"compatos\"><a href=\"#posix\">OSX 10.4+</a> or<br><a href=\"#ios\">iOS 3.0+</a></td>\r\n<td class=\"compatos\"><a href=\"#windows\">Windows<br>XP/Vista/7</a></td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"compatcpu\">x86 (32 bit)</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">MSVC, MSVC/EE<br>WinSDK<br>MinGW, Cygwin</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\">x64 (64 bit)</td>\r\n<td class=\"compatos\">GCC 4.x</td>\r\n<td class=\"compatos\">ORBIS (<a href=\"#ps4\">PS4</a>)</td>\r\n<td class=\"compatos\">GCC 4.x</td>\r\n<td class=\"compatos\">MSVC + SDK v7.0<br>WinSDK v7.0</td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">ARMv5+<br>ARM9E+</a></td>\r\n<td class=\"compatos\">GCC 4.2+</td>\r\n<td class=\"compatos\">GCC 4.2+<br>PSP2 (<a href=\"#psvita\">PS VITA</a>)</td>\r\n<td class=\"compatos\">GCC 4.2+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">PPC</a></td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos\">GCC 4.3+<br>GCC 4.1 (<a href=\"#ps3\">PS3</a>)</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos\">XEDK (<a href=\"#xbox360\">Xbox 360</a>)</td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">PPC/e500v2</a></td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">MIPS</a></td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n</table>\r\n\r\n<h2>Configuring LuaJIT</h2>\r\n<p>\r\nThe standard configuration should work fine for most installations.\r\nUsually there is no need to tweak the settings. The following files\r\nhold all user-configurable settings:\r\n</p>\r\n<ul>\r\n<li><tt>src/luaconf.h</tt> sets some configuration variables.</li>\r\n<li><tt>Makefile</tt> has settings for <b>installing</b> LuaJIT (POSIX\r\nonly).</li>\r\n<li><tt>src/Makefile</tt> has settings for <b>compiling</b> LuaJIT\r\nunder POSIX, MinGW or Cygwin.</li>\r\n<li><tt>src/msvcbuild.bat</tt> has settings for compiling LuaJIT with\r\nMSVC or WinSDK.</li>\r\n</ul>\r\n<p>\r\nPlease read the instructions given in these files, before changing\r\nany settings.\r\n</p>\r\n\r\n<h2 id=\"posix\">POSIX Systems (Linux, OSX, *BSD etc.)</h2>\r\n<h3>Prerequisites</h3>\r\n<p>\r\nDepending on your distribution, you may need to install a package for\r\nGCC, the development headers and/or a complete SDK. E.g. on a current\r\nDebian/Ubuntu, install <tt>libc6-dev</tt> with the package manager.\r\n</p>\r\n<p>\r\nDownload the current source package of LuaJIT (pick the .tar.gz),\r\nif you haven't already done so. Move it to a directory of your choice,\r\nopen a terminal window and change to this directory. Now unpack the archive\r\nand change to the newly created directory:\r\n</p>\r\n<pre class=\"code\">\r\ntar zxf LuaJIT-2.0.4.tar.gz\r\ncd LuaJIT-2.0.4</pre>\r\n<h3>Building LuaJIT</h3>\r\n<p>\r\nThe supplied Makefiles try to auto-detect the settings needed for your\r\noperating system and your compiler. They need to be run with GNU Make,\r\nwhich is probably the default on your system, anyway. Simply run:\r\n</p>\r\n<pre class=\"code\">\r\nmake\r\n</pre>\r\n<p>\r\nThis always builds a native x86, x64 or PPC binary, depending on the host OS\r\nyou're running this command on. Check the section on\r\n<a href=\"#cross\">cross-compilation</a> for more options.\r\n</p>\r\n<p>\r\nBy default, modules are only searched under the prefix <tt>/usr/local</tt>.\r\nYou can add an extra prefix to the search paths by appending the\r\n<tt>PREFIX</tt> option, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nmake PREFIX=/home/myself/lj2\r\n</pre>\r\n<p>\r\nNote for OSX: if the <tt>MACOSX_DEPLOYMENT_TARGET</tt> environment\r\nvariable is not set, then it's forced to <tt>10.4</tt>.\r\n</p>\r\n<h3>Installing LuaJIT</h3>\r\n<p>\r\nThe top-level Makefile installs LuaJIT by default under\r\n<tt>/usr/local</tt>, i.e. the executable ends up in\r\n<tt>/usr/local/bin</tt> and so on. You need root privileges\r\nto write to this path. So, assuming sudo is installed on your system,\r\nrun the following command and enter your sudo password:\r\n</p>\r\n<pre class=\"code\">\r\nsudo make install\r\n</pre>\r\n<p>\r\nOtherwise specify the directory prefix as an absolute path, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nmake install PREFIX=/home/myself/lj2\r\n</pre>\r\n<p>\r\nObviously the prefixes given during build and installation need to be the same.\r\n</p>\r\n\r\n<h2 id=\"windows\">Windows Systems</h2>\r\n<h3>Prerequisites</h3>\r\n<p>\r\nEither install one of the open source SDKs\r\n(<a href=\"http://mingw.org/\"><span class=\"ext\">&raquo;</span>&nbsp;MinGW</a> or\r\n<a href=\"http://www.cygwin.com/\"><span class=\"ext\">&raquo;</span>&nbsp;Cygwin</a>), which come with a modified\r\nGCC plus the required development headers.\r\n</p>\r\n<p>\r\nOr install Microsoft's Visual C++ (MSVC). The freely downloadable\r\n<a href=\"http://www.microsoft.com/Express/VC/\"><span class=\"ext\">&raquo;</span>&nbsp;Express Edition</a>\r\nworks just fine, but only contains an x86 compiler.\r\n</p>\r\n<p>\r\nThe freely downloadable\r\n<a href=\"http://msdn.microsoft.com/en-us/windowsserver/bb980924.aspx\"><span class=\"ext\">&raquo;</span>&nbsp;Windows SDK</a>\r\nonly comes with command line tools, but this is all you need to build LuaJIT.\r\nIt contains x86 and x64 compilers.\r\n</p>\r\n<p>\r\nNext, download the source package and unpack it using an archive manager\r\n(e.g. the Windows Explorer) to a directory of your choice.\r\n</p>\r\n<h3>Building with MSVC</h3>\r\n<p>\r\nOpen a \"Visual Studio .NET Command Prompt\", <tt>cd</tt> to the\r\ndirectory where you've unpacked the sources and run these commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nmsvcbuild\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Building with the Windows SDK</h3>\r\n<p>\r\nOpen a \"Windows SDK Command Shell\" and select the x86 compiler:\r\n</p>\r\n<pre class=\"code\">\r\nsetenv /release /x86\r\n</pre>\r\n<p>\r\nOr select the x64 compiler:\r\n</p>\r\n<pre class=\"code\">\r\nsetenv /release /x64\r\n</pre>\r\n<p>\r\nThen <tt>cd</tt> to the directory where you've unpacked the sources\r\nand run these commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nmsvcbuild\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Building with MinGW or Cygwin</h3>\r\n<p>\r\nOpen a command prompt window and make sure the MinGW or Cygwin programs\r\nare in your path. Then <tt>cd</tt> to the directory where\r\nyou've unpacked the sources and run this command for MinGW:\r\n</p>\r\n<pre class=\"code\">\r\nmingw32-make\r\n</pre>\r\n<p>\r\nOr this command for Cygwin:\r\n</p>\r\n<pre class=\"code\">\r\nmake\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Installing LuaJIT</h3>\r\n<p>\r\nCopy <tt>luajit.exe</tt> and <tt>lua51.dll</tt> (built in the <tt>src</tt>\r\ndirectory) to a newly created directory (any location is ok).\r\nAdd <tt>lua</tt> and <tt>lua\\jit</tt> directories below it and copy\r\nall Lua files from the <tt>src\\jit</tt> directory of the distribution\r\nto the latter directory.\r\n</p>\r\n<p>\r\nThere are no hardcoded\r\nabsolute path names &mdash; all modules are loaded relative to the\r\ndirectory where <tt>luajit.exe</tt> is installed\r\n(see <tt>src/luaconf.h</tt>).\r\n</p>\r\n\r\n<h2 id=\"cross\">Cross-compiling LuaJIT</h2>\r\n<p>\r\nThe GNU Makefile-based build system allows cross-compiling on any host\r\nfor any supported target, as long as both architectures have the same\r\npointer size. If you want to cross-compile to any 32 bit target on an\r\nx64 OS, you need to install the multilib development package (e.g.\r\n<tt>libc6-dev-i386</tt> on Debian/Ubuntu) and build a 32 bit host part\r\n(<tt>HOST_CC=\"gcc -m32\"</tt>).\r\n</p>\r\n<p>\r\nYou need to specify <tt>TARGET_SYS</tt> whenever the host OS and the\r\ntarget OS differ, or you'll get assembler or linker errors. E.g. if\r\nyou're compiling on a Windows or OSX host for embedded Linux or Android,\r\nyou need to add <tt>TARGET_SYS=Linux</tt> to the examples below. For a\r\nminimal target OS, you may need to disable the built-in allocator in\r\n<tt>src/Makefile</tt> and use <tt>TARGET_SYS=Other</tt>. The examples\r\nbelow only show some popular targets &mdash; please check the comments\r\nin <tt>src/Makefile</tt> for more details.\r\n</p>\r\n<pre class=\"code\">\r\n# Cross-compile to a 32 bit binary on a multilib x64 OS\r\nmake CC=\"gcc -m32\"\r\n\r\n# Cross-compile on Debian/Ubuntu for Windows (mingw32 package)\r\nmake HOST_CC=\"gcc -m32\" CROSS=i586-mingw32msvc- TARGET_SYS=Windows\r\n</pre>\r\n<p id=\"cross2\">\r\nThe <tt>CROSS</tt> prefix allows specifying a standard GNU cross-compile\r\ntoolchain (Binutils, GCC and a matching libc). The prefix may vary\r\ndepending on the <tt>--target</tt> the toolchain was built for (note the\r\n<tt>CROSS</tt> prefix has a trailing <tt>\"-\"</tt>). The examples below\r\nuse the canonical toolchain triplets for Linux.\r\n</p>\r\n<p>\r\nSince there's often no easy way to detect CPU features at runtime, it's\r\nimportant to compile with the proper CPU or architecture settings. You\r\ncan specify these when building the toolchain yourself. Or add\r\n<tt>-mcpu=...</tt> or <tt>-march=...</tt> to <tt>TARGET_CFLAGS</tt>. For\r\nARM it's important to have the correct <tt>-mfloat-abi=...</tt> setting,\r\ntoo. Otherwise LuaJIT may not run at the full performance of your target\r\nCPU.\r\n</p>\r\n<pre class=\"code\">\r\n# ARM soft-float\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabi- \\\r\n     TARGET_CFLAGS=\"-mfloat-abi=soft\"\r\n\r\n# ARM soft-float ABI with VFP (example for Cortex-A8)\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabi- \\\r\n     TARGET_CFLAGS=\"-mcpu=cortex-a8 -mfloat-abi=softfp\"\r\n\r\n# ARM hard-float ABI with VFP (armhf, requires recent toolchain)\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabihf-\r\n\r\n# PPC\r\nmake HOST_CC=\"gcc -m32\" CROSS=powerpc-linux-gnu-\r\n# PPC/e500v2 (fast interpreter only)\r\nmake HOST_CC=\"gcc -m32\" CROSS=powerpc-e500v2-linux-gnuspe-\r\n\r\n# MIPS big-endian\r\nmake HOST_CC=\"gcc -m32\" CROSS=mips-linux-\r\n# MIPS little-endian\r\nmake HOST_CC=\"gcc -m32\" CROSS=mipsel-linux-\r\n</pre>\r\n<p>\r\nYou can cross-compile for <b id=\"android\">Android</b> using the <a href=\"http://developer.android.com/sdk/ndk/index.html\"><span class=\"ext\">&raquo;</span>&nbsp;Android NDK</a>.\r\nThe environment variables need to match the install locations and the\r\ndesired target platform. E.g. Android&nbsp;4.0 corresponds to ABI level&nbsp;14.\r\nFor details check the folder <tt>docs</tt> in the NDK directory.\r\n</p>\r\n<p>\r\nOnly a few common variations for the different CPUs, ABIs and platforms\r\nare listed. Please use your own judgement for which combination you want\r\nto build/deploy or which lowest common denominator you want to pick:\r\n</p>\r\n<pre class=\"code\">\r\n# Android/ARM, armeabi (ARMv5TE soft-float), Android 2.2+ (Froyo)\r\nNDK=/opt/android/ndk\r\nNDKABI=8\r\nNDKVER=$NDK/toolchains/arm-linux-androideabi-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/arm-linux-androideabi-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n\r\n# Android/ARM, armeabi-v7a (ARMv7 VFP), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/arm-linux-androideabi-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/arm-linux-androideabi-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\nNDKARCH=\"-march=armv7-a -mfloat-abi=softfp -Wl,--fix-cortex-a8\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF $NDKARCH\"\r\n\r\n# Android/MIPS, mips (MIPS32R1 hard-float), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/mipsel-linux-android-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/mipsel-linux-android-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-mips\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n\r\n# Android/x86, x86 (i686 SSE3), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/x86-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/i686-linux-android-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-x86\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n</pre>\r\n<p>\r\nYou can cross-compile for <b id=\"ios\">iOS 3.0+</b> (iPhone/iPad) using the <a href=\"http://developer.apple.com/devcenter/ios/index.action\"><span class=\"ext\">&raquo;</span>&nbsp;iOS SDK</a>.\r\nThe environment variables need to match the iOS SDK version:\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote: <b>the JIT compiler is disabled for iOS</b>, because regular iOS Apps\r\nare not allowed to generate code at runtime. You'll only get the performance\r\nof the LuaJIT interpreter on iOS. This is still faster than plain Lua, but\r\nmuch slower than the JIT compiler. Please complain to Apple, not me.\r\nOr use Android. :-p\r\n</p>\r\n<pre class=\"code\">\r\nIXCODE=`xcode-select -print-path`\r\nISDK=$IXCODE/Platforms/iPhoneOS.platform/Developer\r\nISDKVER=iPhoneOS6.0.sdk\r\nISDKP=$ISDK/usr/bin/\r\nISDKF=\"-arch armv7 -isysroot $ISDK/SDKs/$ISDKVER\"\r\nmake HOST_CC=\"gcc -m32 -arch i386\" CROSS=$ISDKP TARGET_FLAGS=\"$ISDKF\" \\\r\n     TARGET_SYS=iOS\r\n</pre>\r\n\r\n<h3 id=\"consoles\">Cross-compiling for consoles</h3>\r\n<p>\r\nBuilding LuaJIT for consoles requires both a supported host compiler\r\n(x86 or x64) and a cross-compiler (to PPC or ARM) from the official\r\nconsole SDK.\r\n</p>\r\n<p>\r\nDue to restrictions on consoles, the JIT compiler is disabled and only\r\nthe fast interpreter is built. This is still faster than plain Lua,\r\nbut much slower than the JIT compiler. The FFI is disabled, too, since\r\nit's not very useful in such an environment.\r\n</p>\r\n<p>\r\nThe following commands build a static library <tt>libluajit.a</tt>,\r\nwhich can be linked against your game, just like the Lua library.\r\n</p>\r\n<p>\r\nTo cross-compile for <b id=\"ps3\">PS3</b> from a Linux host (requires\r\n32&nbsp;bit GCC, i.e. multilib Linux/x64) or a Windows host (requires\r\n32&nbsp;bit MinGW), run this command:\r\n</p>\r\n<pre class=\"code\">\r\nmake HOST_CC=\"gcc -m32\" CROSS=ppu-lv2-\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"ps4\">PS4</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (64&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and\r\nrun the following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nps4build\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"psvita\">PS Vita</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (32&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and\r\nrun the following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\npsvitabuild\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"xbox360\">Xbox 360</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (32&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and run\r\nthe following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nxedkbuild\r\n</pre>\r\n\r\n<h2 id=\"embed\">Embedding LuaJIT</h2>\r\n<p>\r\nLuaJIT is API-compatible with Lua 5.1. If you've already embedded Lua\r\ninto your application, you probably don't need to do anything to switch\r\nto LuaJIT, except link with a different library:\r\n</p>\r\n<ul>\r\n<li>It's strongly suggested to build LuaJIT separately using the supplied\r\nbuild system. Please do <em>not</em> attempt to integrate the individual\r\nsource files into your build tree. You'll most likely get the internal build\r\ndependencies wrong or mess up the compiler flags. Treat LuaJIT like any\r\nother external library and link your application with either the dynamic\r\nor static library, depending on your needs.</li>\r\n<li>If you want to load C modules compiled for plain Lua\r\nwith <tt>require()</tt>, you need to make sure the public symbols\r\n(e.g. <tt>lua_pushnumber</tt>) are exported, too:\r\n<ul><li>On POSIX systems you can either link to the shared library\r\nor link the static library into your application. In the latter case\r\nyou'll need to export all public symbols from your main executable\r\n(e.g. <tt>-Wl,-E</tt> on Linux) and add the external dependencies\r\n(e.g. <tt>-lm -ldl</tt> on Linux).</li>\r\n<li>Since Windows symbols are bound to a specific DLL name, you need to\r\nlink to the <tt>lua51.dll</tt> created by the LuaJIT build (do not rename\r\nthe DLL). You may link LuaJIT statically on Windows only if you don't\r\nintend to load Lua/C modules at runtime.\r\n</li></ul>\r\n</li>\r\n<li>\r\nIf you're building a 64 bit application on OSX which links directly or\r\nindirectly against LuaJIT, you need to link your main executable\r\nwith these flags:\r\n<pre class=\"code\">\r\n-pagezero_size 10000 -image_base 100000000\r\n</pre>\r\nAlso, it's recommended to <tt>rebase</tt> all (self-compiled) shared libraries\r\nwhich are loaded at runtime on OSX/x64 (e.g. C extension modules for Lua).\r\nSee: <tt>man rebase</tt>\r\n</li>\r\n</ul>\r\n<p>Additional hints for initializing LuaJIT using the C API functions:</p>\r\n<ul>\r\n<li>Here's a\r\n<a href=\"http://lua-users.org/wiki/SimpleLuaApiExample\"><span class=\"ext\">&raquo;</span>&nbsp;simple example</a>\r\nfor embedding Lua or LuaJIT into your application.</li>\r\n<li>Make sure you use <tt>luaL_newstate</tt>. Avoid using\r\n<tt>lua_newstate</tt>, since this uses the (slower) default memory\r\nallocator from your system (no support for this on x64).</li>\r\n<li>Make sure you use <tt>luaL_openlibs</tt> and not the old Lua 5.0 style\r\nof calling <tt>luaopen_base</tt> etc. directly.</li>\r\n<li>To change or extend the list of standard libraries to load, copy\r\n<tt>src/lib_init.c</tt> to your project and modify it accordingly.\r\nMake sure the <tt>jit</tt> library is loaded or the JIT compiler\r\nwill not be activated.</li>\r\n<li>The <tt>bit.*</tt> module for bitwise operations\r\nis already built-in. There's no need to statically link\r\n<a href=\"http://bitop.luajit.org/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp</a> to your application.</li>\r\n</ul>\r\n\r\n<h2 id=\"distro\">Hints for Distribution Maintainers</h2>\r\n<p>\r\nThe LuaJIT build system has extra provisions for the needs of most\r\nPOSIX-based distributions. If you're a package maintainer for\r\na distribution, <em>please</em> make use of these features and\r\navoid patching, subverting, autotoolizing or messing up the build system\r\nin unspeakable ways.\r\n</p>\r\n<p>\r\nThere should be absolutely no need to patch <tt>luaconf.h</tt> or any\r\nof the Makefiles. And please do not hand-pick files for your packages &mdash;\r\nsimply use whatever <tt>make install</tt> creates. There's a reason\r\nfor all of the files <em>and</em> directories it creates.\r\n</p>\r\n<p>\r\nThe build system uses GNU make and auto-detects most settings based on\r\nthe host you're building it on. This should work fine for native builds,\r\neven when sandboxed. You may need to pass some of the following flags to\r\n<em>both</em> the <tt>make</tt> and the <tt>make install</tt> command lines\r\nfor a regular distribution build:\r\n</p>\r\n<ul>\r\n<li><tt>PREFIX</tt> overrides the installation path and should usually\r\nbe set to <tt>/usr</tt>. Setting this also changes the module paths and\r\nthe paths needed to locate the shared library.</li>\r\n<li><tt>DESTDIR</tt> is an absolute path which allows you to install\r\nto a shadow tree instead of the root tree of the build system.</li>\r\n<li><tt>MULTILIB</tt> sets the architecture-specific library path component\r\nfor multilib systems. The default is <tt>lib</tt>.</li>\r\n<li>Have a look at the top-level <tt>Makefile</tt> and <tt>src/Makefile</tt>\r\nfor additional variables to tweak. The following variables <em>may</em> be\r\noverridden, but it's <em>not</em> recommended, except for special needs\r\nlike cross-builds:\r\n<tt>BUILDMODE, CC, HOST_CC, STATIC_CC, DYNAMIC_CC, CFLAGS, HOST_CFLAGS,\r\nTARGET_CFLAGS, LDFLAGS, HOST_LDFLAGS, TARGET_LDFLAGS, TARGET_SHLDFLAGS,\r\nTARGET_FLAGS, LIBS, HOST_LIBS, TARGET_LIBS, CROSS, HOST_SYS, TARGET_SYS\r\n</tt></li>\r\n</ul>\r\n<p>\r\nThe build system has a special target for an amalgamated build, i.e.\r\n<tt>make amalg</tt>. This compiles the LuaJIT core as one huge C file\r\nand allows GCC to generate faster and shorter code. Alas, this requires\r\nlots of memory during the build. This may be a problem for some users,\r\nthat's why it's not enabled by default. But it shouldn't be a problem for\r\nmost build farms. It's recommended that binary distributions use this\r\ntarget for their LuaJIT builds.\r\n</p>\r\n<p>\r\nThe tl;dr version of the above:\r\n</p>\r\n<pre class=\"code\">\r\nmake amalg PREFIX=/usr && \\\r\nmake install PREFIX=/usr DESTDIR=/tmp/buildroot\r\n</pre>\r\n<p>\r\nFinally, if you encounter any difficulties, please\r\n<a href=\"contact.html\">contact me</a> first, instead of releasing a broken\r\npackage onto unsuspecting users. Because they'll usually gonna complain\r\nto me (the upstream) and not you (the package maintainer), anyway.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/luajit.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>LuaJIT</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<meta name=\"description\" content=\"LuaJIT is a Just-In-Time (JIT) compiler for the Lua language.\">\r\n<style type=\"text/css\">\r\ntable.feature {\r\n  width: inherit;\r\n  line-height: 1.2;\r\n  margin: 0;\r\n}\r\ntable.feature td {\r\n  width: 80px;\r\n  height: 40px;\r\n  vertical-align: middle;\r\n  text-align: center;\r\n  font-weight: bold;\r\n  border: 4px solid #e6ecff;\r\n  border-radius: 12px;\r\n}\r\ntable.os td {\r\n  background: #7080d0;\r\n  background-image: linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -moz-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -webkit-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -o-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -ms-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n}\r\ntable.os1 td {\r\n  color: #ffff80;\r\n}\r\ntable.os2 td {\r\n  color: #ffa040;\r\n}\r\ntable.os3 td {\r\n  color: #40ffff;\r\n}\r\ntable.compiler td {\r\n  color: #2080ff;\r\n  background: #62bf41;\r\n  background-image: linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -moz-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -webkit-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -o-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -ms-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n}\r\ntable.cpu td {\r\n  color: #ffff00;\r\n  background: #cf7251;\r\n  background-image: linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -moz-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -webkit-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -o-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -ms-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n}\r\ntable.fcompat td {\r\n  color: #2060e0;\r\n  background: #61cfcf;\r\n  background-image: linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -moz-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -webkit-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -o-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -ms-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n}\r\ntable.stats td {\r\n  color: #ffffff;\r\n  background: #a0a0a0;\r\n  background-image: linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -moz-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -webkit-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -o-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -ms-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n}\r\ntable.stats td.speed {\r\n  color: #ff4020;\r\n}\r\ntable.stats td.kb {\r\n  color: #ffff80;\r\n  background: #808080;\r\n  background-image: linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -moz-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -webkit-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -o-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -ms-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n}\r\ntable.feature small {\r\n  font-size: 50%;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>LuaJIT</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a class=\"current\" href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is a <b>Just-In-Time Compiler</b> (JIT) for the\r\n<a href=\"http://www.lua.org/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua</a> programming language.\r\nLua is a powerful, dynamic and light-weight programming language.\r\nIt may be embedded or used as a general-purpose, stand-alone language.\r\n</p>\r\n<p>\r\nLuaJIT is Copyright &copy; 2005-2015 Mike Pall, released under the\r\n<a href=\"http://www.opensource.org/licenses/mit-license.php\"><span class=\"ext\">&raquo;</span>&nbsp;MIT open source license</a>.\r\n</p>\r\n<p>\r\n</p>\r\n\r\n<h2>Compatibility</h2>\r\n<table class=\"feature os os1\">\r\n<tr><td>Windows</td><td>Linux</td><td>BSD</td><td>OSX</td><td>POSIX</td></tr>\r\n</table>\r\n<table class=\"feature os os2\">\r\n<tr><td><span style=\"font-size:90%;\">Embedded</span></td><td>Android</td><td>iOS</td></tr>\r\n</table>\r\n<table class=\"feature os os3\">\r\n<tr><td>PS3</td><td>PS4</td><td>PS Vita</td><td>Xbox 360</td></tr>\r\n</table>\r\n<table class=\"feature compiler\">\r\n<tr><td>GCC</td><td>CLANG<br>LLVM</td><td>MSVC</td></tr>\r\n</table>\r\n<table class=\"feature cpu\">\r\n<tr><td>x86</td><td>x64</td><td>ARM</td><td>PPC</td><td>e500</td><td>MIPS</td></tr>\r\n</table>\r\n<table class=\"feature fcompat\">\r\n<tr><td>Lua&nbsp;5.1<br>API+ABI</td><td>+&nbsp;JIT</td><td>+&nbsp;BitOp</td><td>+&nbsp;FFI</td><td>Drop-in<br>DLL/.so</td></tr>\r\n</table>\r\n\r\n<h2>Overview</h2>\r\n<table class=\"feature stats\">\r\n<tr>\r\n<td class=\"speed\">3x<br>-&nbsp;&nbsp;100x</td>\r\n<td class=\"kb\">115&nbsp;<small>KB</small><br>VM</td>\r\n<td class=\"kb\">90&nbsp;<small>KB</small><br>JIT</td>\r\n<td class=\"kloc\">63&nbsp;<small>KLOC</small><br>C</td>\r\n<td class=\"kloc\">24&nbsp;<small>KLOC</small><br>ASM</td>\r\n<td class=\"kloc\">11&nbsp;<small>KLOC</small><br>Lua</td>\r\n</tr>\r\n</table>\r\n<p style=\"margin-top: 1em;\">\r\nLuaJIT has been successfully used as a <b>scripting middleware</b> in\r\ngames, appliances, network and graphics apps, numerical simulations,\r\ntrading platforms and many other specialty applications. It scales from\r\nembedded devices, smartphones, desktops up to server farms. It combines\r\nhigh flexibility with <a href=\"http://luajit.org/performance.html\"><span class=\"ext\">&raquo;</span>&nbsp;high performance</a>\r\nand an unmatched <b>low memory footprint</b>.\r\n</p>\r\n<p>\r\nLuaJIT has been in continuous development since 2005. It's widely\r\nconsidered to be <b>one of the fastest dynamic language\r\nimplementations</b>. It has outperformed other dynamic languages on many\r\ncross-language benchmarks since its first release &mdash; often by a\r\nsubstantial margin.\r\n</p>\r\n<p>\r\nFor <b>LuaJIT 2.0</b>, the whole VM has been rewritten from the ground up\r\nand relentlessly optimized for performance. It combines a <b>high-speed\r\ninterpreter</b>, written in assembler, with a <b>state-of-the-art JIT\r\ncompiler</b>.\r\n</p>\r\n<p>\r\nAn innovative <b>trace compiler</b> is integrated with advanced,\r\nSSA-based optimizations and highly tuned code generation backends.\r\nA substantial reduction of the overhead associated with dynamic languages\r\nallows it to break into the performance range traditionally reserved for\r\noffline, static language compilers.\r\n</p>\r\n\r\n<h2>More ...</h2>\r\n<p>\r\nPlease select a sub-topic in the navigation bar to learn more about LuaJIT.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/running.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Running LuaJIT</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.opt {\r\n  line-height: 1.2;\r\n}\r\ntr.opthead td {\r\n  font-weight: bold;\r\n}\r\ntd.flag_name {\r\n  width: 4em;\r\n}\r\ntd.flag_level {\r\n  width: 2em;\r\n  text-align: center;\r\n}\r\ntd.param_name {\r\n  width: 6em;\r\n}\r\ntd.param_default {\r\n  width: 4em;\r\n  text-align: right;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Running LuaJIT</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a class=\"current\" href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT has only a single stand-alone executable, called <tt>luajit</tt> on\r\nPOSIX systems or <tt>luajit.exe</tt> on Windows. It can be used to run simple\r\nLua statements or whole Lua applications from the command line. It has an\r\ninteractive mode, too.\r\n</p>\r\n\r\n<h2 id=\"options\">Command Line Options</h2>\r\n<p>\r\nThe <tt>luajit</tt> stand-alone executable is just a slightly modified\r\nversion of the regular <tt>lua</tt> stand-alone executable.\r\nIt supports the same basic options, too. <tt>luajit&nbsp;-h</tt>\r\nprints a short list of the available options. Please have a look at the\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#6\"><span class=\"ext\">&raquo;</span>&nbsp;Lua manual</a>\r\nfor details.\r\n</p>\r\n<p>\r\nLuaJIT has some additional options:\r\n</p>\r\n\r\n<h3 id=\"opt_b\"><tt>-b[options] input output</tt></h3>\r\n<p>\r\nThis option saves or lists bytecode. The following additional options\r\nare accepted:\r\n</p>\r\n<ul>\r\n<li><tt>-l</tt> &mdash; Only list bytecode.</li>\r\n<li><tt>-s</tt> &mdash; Strip debug info (this is the default).</li>\r\n<li><tt>-g</tt> &mdash; Keep debug info.</li>\r\n<li><tt>-n name</tt> &mdash; Set module name (default: auto-detect from input name)</li>\r\n<li><tt>-t type</tt> &mdash; Set output file type (default: auto-detect from output name).</li>\r\n<li><tt>-a arch</tt> &mdash; Override architecture for object files (default: native).</li>\r\n<li><tt>-o os</tt> &mdash; Override OS for object files (default: native).</li>\r\n<li><tt>-e chunk</tt> &mdash; Use chunk string as input.</li>\r\n<li><tt>-</tt> (a single minus sign) &mdash; Use stdin as input and/or stdout as output.</li>\r\n</ul>\r\n<p>\r\nThe output file type is auto-detected from the extension of the output\r\nfile name:\r\n</p>\r\n<ul>\r\n<li><tt>c</tt> &mdash; C source file, exported bytecode data.</li>\r\n<li><tt>h</tt> &mdash; C header file, static bytecode data.</li>\r\n<li><tt>obj</tt> or <tt>o</tt> &mdash; Object file, exported bytecode data\r\n(OS- and architecture-specific).</li>\r\n<li><tt>raw</tt> or any other extension &mdash; Raw bytecode file (portable).\r\n</ul>\r\n<p>\r\nNotes:\r\n</p>\r\n<ul>\r\n<li>See also <a href=\"extensions.html#string_dump\">string.dump()</a>\r\nfor information on bytecode portability and compatibility.</li>\r\n<li>A file in raw bytecode format is auto-detected and can be loaded like\r\nany Lua source file. E.g. directly from the command line or with\r\n<tt>loadfile()</tt>, <tt>dofile()</tt> etc.</li>\r\n<li>To statically embed the bytecode of a module in your application,\r\ngenerate an object file and just link it with your application.</li>\r\n<li>On most ELF-based systems (e.g. Linux) you need to explicitly export the\r\nglobal symbols when linking your application, e.g. with: <tt>-Wl,-E</tt></li>\r\n<li><tt>require()</tt> tries to load embedded bytecode data from exported\r\nsymbols (in <tt>*.exe</tt> or <tt>lua51.dll</tt> on Windows) and from\r\nshared libraries in <tt>package.cpath</tt>.</li>\r\n</ul>\r\n<p>\r\nTypical usage examples:\r\n</p>\r\n<pre class=\"code\">\r\nluajit -b test.lua test.out                 # Save bytecode to test.out\r\nluajit -bg test.lua test.out                # Keep debug info\r\nluajit -be \"print('hello world')\" test.out  # Save cmdline script\r\n\r\nluajit -bl test.lua                         # List to stdout\r\nluajit -bl test.lua test.txt                # List to test.txt\r\nluajit -ble \"print('hello world')\"          # List cmdline script\r\n\r\nluajit -b test.lua test.obj                 # Generate object file\r\n# Link test.obj with your application and load it with require(\"test\")\r\n</pre>\r\n\r\n<h3 id=\"opt_j\"><tt>-j cmd[=arg[,arg...]]</tt></h3>\r\n<p>\r\nThis option performs a LuaJIT control command or activates one of the\r\nloadable extension modules. The command is first looked up in the\r\n<tt>jit.*</tt> library. If no matching function is found, a module\r\nnamed <tt>jit.&lt;cmd&gt;</tt> is loaded and the <tt>start()</tt>\r\nfunction of the module is called with the specified arguments (if\r\nany). The space between <tt>-j</tt> and <tt>cmd</tt> is optional.\r\n</p>\r\n<p>\r\nHere are the available LuaJIT control commands:\r\n</p>\r\n<ul>\r\n<li id=\"j_on\"><tt>-jon</tt> &mdash; Turns the JIT compiler on (default).</li>\r\n<li id=\"j_off\"><tt>-joff</tt> &mdash; Turns the JIT compiler off (only use the interpreter).</li>\r\n<li id=\"j_flush\"><tt>-jflush</tt> &mdash; Flushes the whole cache of compiled code.</li>\r\n<li id=\"j_v\"><tt>-jv</tt> &mdash; Shows verbose information about the progress of the JIT compiler.</li>\r\n<li id=\"j_dump\"><tt>-jdump</tt> &mdash; Dumps the code and structures used in various compiler stages.</li>\r\n</ul>\r\n<p>\r\nThe <tt>-jv</tt> and <tt>-jdump</tt> commands are extension modules\r\nwritten in Lua. They are mainly used for debugging the JIT compiler\r\nitself. For a description of their options and output format, please\r\nread the comment block at the start of their source.\r\nThey can be found in the <tt>lib</tt> directory of the source\r\ndistribution or installed under the <tt>jit</tt> directory. By default\r\nthis is <tt>/usr/local/share/luajit-2.0.4/jit</tt> on POSIX\r\nsystems.\r\n</p>\r\n\r\n<h3 id=\"opt_O\"><tt>-O[level]</tt><br>\r\n<tt>-O[+]flag</tt>&nbsp;&nbsp;&nbsp;<tt>-O-flag</tt><br>\r\n<tt>-Oparam=value</tt></h3>\r\n<p>\r\nThis options allows fine-tuned control of the optimizations used by\r\nthe JIT compiler. This is mainly intended for debugging LuaJIT itself.\r\nPlease note that the JIT compiler is extremely fast (we are talking\r\nabout the microsecond to millisecond range). Disabling optimizations\r\ndoesn't have any visible impact on its overhead, but usually generates\r\ncode that runs slower.\r\n</p>\r\n<p>\r\nThe first form sets an optimization level &mdash; this enables a\r\nspecific mix of optimization flags. <tt>-O0</tt> turns off all\r\noptimizations and higher numbers enable more optimizations. Omitting\r\nthe level (i.e. just <tt>-O</tt>) sets the default optimization level,\r\nwhich is <tt>-O3</tt> in the current version.\r\n</p>\r\n<p>\r\nThe second form adds or removes individual optimization flags.\r\nThe third form sets a parameter for the VM or the JIT compiler\r\nto a specific value.\r\n</p>\r\n<p>\r\nYou can either use this option multiple times (like <tt>-Ocse\r\n-O-dce -Ohotloop=10</tt>) or separate several settings with a comma\r\n(like <tt>-O+cse,-dce,hotloop=10</tt>). The settings are applied from\r\nleft to right and later settings override earlier ones. You can freely\r\nmix the three forms, but note that setting an optimization level\r\noverrides all earlier flags.\r\n</p>\r\n<p>\r\nHere are the available flags and at what optimization levels they\r\nare enabled:\r\n</p>\r\n<table class=\"opt\">\r\n<tr class=\"opthead\">\r\n<td class=\"flag_name\">Flag</td>\r\n<td class=\"flag_level\">-O1</td>\r\n<td class=\"flag_level\">-O2</td>\r\n<td class=\"flag_level\">-O3</td>\r\n<td class=\"flag_desc\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"flag_name\">fold</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Constant Folding, Simplifications and Reassociation</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">cse</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Common-Subexpression Elimination</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">dce</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Dead-Code Elimination</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">narrow</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Narrowing of numbers to integers</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">loop</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Loop Optimizations (code hoisting)</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">fwd</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Load Forwarding (L2L) and Store Forwarding (S2L)</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">dse</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Dead-Store Elimination</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">abc</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Array Bounds Check Elimination</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">sink</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Allocation/Store Sinking</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">fuse</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Fusion of operands into instructions</td></tr>\r\n</table>\r\n<p>\r\nHere are the parameters and their default settings:\r\n</p>\r\n<table class=\"opt\">\r\n<tr class=\"opthead\">\r\n<td class=\"param_name\">Parameter</td>\r\n<td class=\"param_default\">Default</td>\r\n<td class=\"param_desc\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">maxtrace</td><td class=\"param_default\">1000</td><td class=\"param_desc\">Max. number of traces in the cache</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxrecord</td><td class=\"param_default\">4000</td><td class=\"param_desc\">Max. number of recorded IR instructions</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">maxirconst</td><td class=\"param_default\">500</td><td class=\"param_desc\">Max. number of IR constants of a trace</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxside</td><td class=\"param_default\">100</td><td class=\"param_desc\">Max. number of side traces of a root trace</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">maxsnap</td><td class=\"param_default\">500</td><td class=\"param_desc\">Max. number of snapshots for a trace</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"param_name\">hotloop</td><td class=\"param_default\">56</td><td class=\"param_desc\">Number of iterations to detect a hot loop or hot call</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">hotexit</td><td class=\"param_default\">10</td><td class=\"param_desc\">Number of taken exits to start a side trace</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">tryside</td><td class=\"param_default\">4</td><td class=\"param_desc\">Number of attempts to compile a side trace</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">instunroll</td><td class=\"param_default\">4</td><td class=\"param_desc\">Max. unroll factor for instable loops</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">loopunroll</td><td class=\"param_default\">15</td><td class=\"param_desc\">Max. unroll factor for loop ops in side traces</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">callunroll</td><td class=\"param_default\">3</td><td class=\"param_desc\">Max. unroll factor for pseudo-recursive calls</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">recunroll</td><td class=\"param_default\">2</td><td class=\"param_desc\">Min. unroll factor for true recursion</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">sizemcode</td><td class=\"param_default\">32</td><td class=\"param_desc\">Size of each machine code area in KBytes (Windows: 64K)</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxmcode</td><td class=\"param_default\">512</td><td class=\"param_desc\">Max. total size of all machine code areas in KBytes</td></tr>\r\n</table>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/doc/status.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Status</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\nul li { padding-bottom: 0.3em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Status</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\n<span style=\"color: #0000c0;\">LuaJIT&nbsp;2.0</span> is the current\r\n<span style=\"color: #0000c0;\">stable branch</span>. This branch is in\r\nfeature-freeze &mdash; new features will only be added to LuaJIT&nbsp;2.1.\r\n</p>\r\n\r\n<h2>Current Status</h2>\r\n<p>\r\nLuaJIT ought to run all Lua&nbsp;5.1-compatible source code just fine.\r\nIt's considered a serious bug if the VM crashes or produces unexpected\r\nresults &mdash; please report this.\r\n</p>\r\n<p>\r\nKnown incompatibilities and issues in LuaJIT&nbsp;2.0:\r\n</p>\r\n<ul>\r\n<li>\r\nThere are some differences in <b>implementation-defined</b> behavior.\r\nThese either have a good reason, are arbitrary design choices\r\nor are due to quirks in the VM. The latter cases may get fixed if a\r\ndemonstrable need is shown.\r\n</li>\r\n<li>\r\nThe Lua <b>debug API</b> is missing a couple of features (return\r\nhooks for non-Lua functions) and shows slightly different behavior\r\nin LuaJIT (no per-coroutine hooks, no tail call counting).\r\n</li>\r\n<li>\r\nSome checks are missing in the JIT-compiled code for obscure situations\r\nwith <b>open upvalues aliasing</b> one of the SSA slots later on (or\r\nvice versa). Bonus points, if you can find a real world test case for\r\nthis.\r\n</li>\r\n<li>\r\nCurrently some <b>out-of-memory</b> errors from <b>on-trace code</b> are not\r\nhandled correctly. The error may fall through an on-trace\r\n<tt>pcall</tt> or it may be passed on to the function set with\r\n<tt>lua_atpanic</tt> on x64. This issue will be fixed with the new\r\ngarbage collector.\r\n</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_arm.h",
    "content": "/*\r\n** DynASM ARM encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"arm\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC,\r\n  DASM_IMM, DASM_IMM12, DASM_IMM16, DASM_IMML8, DASM_IMML12, DASM_IMMV8,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\nstatic int dasm_imm12(unsigned int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < 16; i++, n = (n << 2) | (n >> 30))\r\n    if (n <= 255) return (int)(n + (i << 8));\r\n  return -1;\r\n}\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16);\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n      case DASM_IMM16:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n\tif ((ins & 0x8000))\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMMV8:\r\n\tCK((n & 3) == 0, RANGE_I);\r\n\tn >>= 2;\r\n      case DASM_IMML8:\r\n      case DASM_IMML12:\r\n\tCK(n >= 0 ? ((n>>((ins>>5)&31)) == 0) :\r\n\t\t    (((-n)>>((ins>>5)&31)) == 0), RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM12:\r\n\tCK(dasm_imm12((unsigned int)n) != -1, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: case DASM_IMM12: case DASM_IMM16:\r\n\tcase DASM_IMML8: case DASM_IMML12: case DASM_IMMV8: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xe1a00000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) - 4;\r\n\tpatchrel:\r\n\t  if ((ins & 0x800) == 0) {\r\n\t    CK((n & 3) == 0 && ((n+0x02000000) >> 26) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n >> 2) & 0x00ffffff);\r\n\t  } else if ((ins & 0x1000)) {\r\n\t    CK((n & 3) == 0 && -256 <= n && n <= 256, RANGE_REL);\r\n\t    goto patchimml8;\r\n\t  } else if ((ins & 0x2000) == 0) {\r\n\t    CK((n & 3) == 0 && -4096 <= n && n <= 4096, RANGE_REL);\r\n\t    goto patchimml;\r\n\t  } else {\r\n\t    CK((n & 3) == 0 && -1020 <= n && n <= 1020, RANGE_REL);\r\n\t    n >>= 2;\r\n\t    goto patchimml;\r\n\t  }\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= ((n>>((ins>>10)&31)) & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tcase DASM_IMM12:\r\n\t  cp[-1] |= dasm_imm12((unsigned int)n);\r\n\t  break;\r\n\tcase DASM_IMM16:\r\n\t  cp[-1] |= ((n & 0xf000) << 4) | (n & 0x0fff);\r\n\t  break;\r\n\tcase DASM_IMML8: patchimml8:\r\n\t  cp[-1] |= n >= 0 ? (0x00800000 | (n & 0x0f) | ((n & 0xf0) << 4)) :\r\n\t\t\t     ((-n & 0x0f) | ((-n & 0xf0) << 4));\r\n\t  break;\r\n\tcase DASM_IMML12: case DASM_IMMV8: patchimml:\r\n\t  cp[-1] |= n >= 0 ? (0x00800000 | n) : (-n);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_arm.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM ARM module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"arm\",\r\n  description =\t\"DynASM ARM module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable, rawget = assert, setmetatable, rawget\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch, gsub = _s.match, _s.gmatch, _s.gsub\r\nlocal concat, sort, insert = table.concat, table.sort, table.insert\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr, sar = bit.band, bit.lshift, bit.rshift, bit.arshift\r\nlocal ror, tohex = bit.ror, bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\", \"IMM12\", \"IMM16\", \"IMML8\", \"IMML12\", \"IMMV8\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n <= 0x000fffff then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  if n <= 0x000fffff then\r\n    insert(actlist, pos+1, n)\r\n    n = map_action.ESC * 0x10000\r\n  end\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\n\r\n-- Ext. register name -> int. name.\r\nlocal map_archdef = { sp = \"r13\", lr = \"r14\", pc = \"r15\", }\r\n\r\n-- Int. register name -> ext. name.\r\nlocal map_reg_rev = { r13 = \"sp\", r14 = \"lr\", r15 = \"pc\", }\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  return map_reg_rev[s] or s\r\nend\r\n\r\nlocal map_shift = { lsl = 0, lsr = 1, asr = 2, ror = 3, }\r\n\r\nlocal map_cond = {\r\n  eq = 0, ne = 1, cs = 2, cc = 3, mi = 4, pl = 5, vs = 6, vc = 7,\r\n  hi = 8, ls = 9, ge = 10, lt = 11, gt = 12, le = 13, al = 14,\r\n  hs = 2, lo = 3,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for ARM instructions.\r\nlocal map_op = {\r\n  -- Basic data processing instructions.\r\n  and_3 = \"e0000000DNPs\",\r\n  eor_3 = \"e0200000DNPs\",\r\n  sub_3 = \"e0400000DNPs\",\r\n  rsb_3 = \"e0600000DNPs\",\r\n  add_3 = \"e0800000DNPs\",\r\n  adc_3 = \"e0a00000DNPs\",\r\n  sbc_3 = \"e0c00000DNPs\",\r\n  rsc_3 = \"e0e00000DNPs\",\r\n  tst_2 = \"e1100000NP\",\r\n  teq_2 = \"e1300000NP\",\r\n  cmp_2 = \"e1500000NP\",\r\n  cmn_2 = \"e1700000NP\",\r\n  orr_3 = \"e1800000DNPs\",\r\n  mov_2 = \"e1a00000DPs\",\r\n  bic_3 = \"e1c00000DNPs\",\r\n  mvn_2 = \"e1e00000DPs\",\r\n\r\n  and_4 = \"e0000000DNMps\",\r\n  eor_4 = \"e0200000DNMps\",\r\n  sub_4 = \"e0400000DNMps\",\r\n  rsb_4 = \"e0600000DNMps\",\r\n  add_4 = \"e0800000DNMps\",\r\n  adc_4 = \"e0a00000DNMps\",\r\n  sbc_4 = \"e0c00000DNMps\",\r\n  rsc_4 = \"e0e00000DNMps\",\r\n  tst_3 = \"e1100000NMp\",\r\n  teq_3 = \"e1300000NMp\",\r\n  cmp_3 = \"e1500000NMp\",\r\n  cmn_3 = \"e1700000NMp\",\r\n  orr_4 = \"e1800000DNMps\",\r\n  mov_3 = \"e1a00000DMps\",\r\n  bic_4 = \"e1c00000DNMps\",\r\n  mvn_3 = \"e1e00000DMps\",\r\n\r\n  lsl_3 = \"e1a00000DMws\",\r\n  lsr_3 = \"e1a00020DMws\",\r\n  asr_3 = \"e1a00040DMws\",\r\n  ror_3 = \"e1a00060DMws\",\r\n  rrx_2 = \"e1a00060DMs\",\r\n\r\n  -- Multiply and multiply-accumulate.\r\n  mul_3 = \"e0000090NMSs\",\r\n  mla_4 = \"e0200090NMSDs\",\r\n  umaal_4 = \"e0400090DNMSs\",\t-- v6\r\n  mls_4 = \"e0600090DNMSs\",\t-- v6T2\r\n  umull_4 = \"e0800090DNMSs\",\r\n  umlal_4 = \"e0a00090DNMSs\",\r\n  smull_4 = \"e0c00090DNMSs\",\r\n  smlal_4 = \"e0e00090DNMSs\",\r\n\r\n  -- Halfword multiply and multiply-accumulate.\r\n  smlabb_4 = \"e1000080NMSD\",\t-- v5TE\r\n  smlatb_4 = \"e10000a0NMSD\",\t-- v5TE\r\n  smlabt_4 = \"e10000c0NMSD\",\t-- v5TE\r\n  smlatt_4 = \"e10000e0NMSD\",\t-- v5TE\r\n  smlawb_4 = \"e1200080NMSD\",\t-- v5TE\r\n  smulwb_3 = \"e12000a0NMS\",\t-- v5TE\r\n  smlawt_4 = \"e12000c0NMSD\",\t-- v5TE\r\n  smulwt_3 = \"e12000e0NMS\",\t-- v5TE\r\n  smlalbb_4 = \"e1400080NMSD\",\t-- v5TE\r\n  smlaltb_4 = \"e14000a0NMSD\",\t-- v5TE\r\n  smlalbt_4 = \"e14000c0NMSD\",\t-- v5TE\r\n  smlaltt_4 = \"e14000e0NMSD\",\t-- v5TE\r\n  smulbb_3 = \"e1600080NMS\",\t-- v5TE\r\n  smultb_3 = \"e16000a0NMS\",\t-- v5TE\r\n  smulbt_3 = \"e16000c0NMS\",\t-- v5TE\r\n  smultt_3 = \"e16000e0NMS\",\t-- v5TE\r\n\r\n  -- Miscellaneous data processing instructions.\r\n  clz_2 = \"e16f0f10DM\", -- v5T\r\n  rev_2 = \"e6bf0f30DM\", -- v6\r\n  rev16_2 = \"e6bf0fb0DM\", -- v6\r\n  revsh_2 = \"e6ff0fb0DM\", -- v6\r\n  sel_3 = \"e6800fb0DNM\", -- v6\r\n  usad8_3 = \"e780f010NMS\", -- v6\r\n  usada8_4 = \"e7800010NMSD\", -- v6\r\n  rbit_2 = \"e6ff0f30DM\", -- v6T2\r\n  movw_2 = \"e3000000DW\", -- v6T2\r\n  movt_2 = \"e3400000DW\", -- v6T2\r\n  -- Note: the X encodes width-1, not width.\r\n  sbfx_4 = \"e7a00050DMvX\", -- v6T2\r\n  ubfx_4 = \"e7e00050DMvX\", -- v6T2\r\n  -- Note: the X encodes the msb field, not the width.\r\n  bfc_3 = \"e7c0001fDvX\", -- v6T2\r\n  bfi_4 = \"e7c00010DMvX\", -- v6T2\r\n\r\n  -- Packing and unpacking instructions.\r\n  pkhbt_3 = \"e6800010DNM\", pkhbt_4 = \"e6800010DNMv\", -- v6\r\n  pkhtb_3 = \"e6800050DNM\", pkhtb_4 = \"e6800050DNMv\", -- v6\r\n  sxtab_3 = \"e6a00070DNM\", sxtab_4 = \"e6a00070DNMv\", -- v6\r\n  sxtab16_3 = \"e6800070DNM\", sxtab16_4 = \"e6800070DNMv\", -- v6\r\n  sxtah_3 = \"e6b00070DNM\", sxtah_4 = \"e6b00070DNMv\", -- v6\r\n  sxtb_2 = \"e6af0070DM\", sxtb_3 = \"e6af0070DMv\", -- v6\r\n  sxtb16_2 = \"e68f0070DM\", sxtb16_3 = \"e68f0070DMv\", -- v6\r\n  sxth_2 = \"e6bf0070DM\", sxth_3 = \"e6bf0070DMv\", -- v6\r\n  uxtab_3 = \"e6e00070DNM\", uxtab_4 = \"e6e00070DNMv\", -- v6\r\n  uxtab16_3 = \"e6c00070DNM\", uxtab16_4 = \"e6c00070DNMv\", -- v6\r\n  uxtah_3 = \"e6f00070DNM\", uxtah_4 = \"e6f00070DNMv\", -- v6\r\n  uxtb_2 = \"e6ef0070DM\", uxtb_3 = \"e6ef0070DMv\", -- v6\r\n  uxtb16_2 = \"e6cf0070DM\", uxtb16_3 = \"e6cf0070DMv\", -- v6\r\n  uxth_2 = \"e6ff0070DM\", uxth_3 = \"e6ff0070DMv\", -- v6\r\n\r\n  -- Saturating instructions.\r\n  qadd_3 = \"e1000050DMN\",\t-- v5TE\r\n  qsub_3 = \"e1200050DMN\",\t-- v5TE\r\n  qdadd_3 = \"e1400050DMN\",\t-- v5TE\r\n  qdsub_3 = \"e1600050DMN\",\t-- v5TE\r\n  -- Note: the X for ssat* encodes sat_imm-1, not sat_imm.\r\n  ssat_3 = \"e6a00010DXM\", ssat_4 = \"e6a00010DXMp\", -- v6\r\n  usat_3 = \"e6e00010DXM\", usat_4 = \"e6e00010DXMp\", -- v6\r\n  ssat16_3 = \"e6a00f30DXM\", -- v6\r\n  usat16_3 = \"e6e00f30DXM\", -- v6\r\n\r\n  -- Parallel addition and subtraction.\r\n  sadd16_3 = \"e6100f10DNM\", -- v6\r\n  sasx_3 = \"e6100f30DNM\", -- v6\r\n  ssax_3 = \"e6100f50DNM\", -- v6\r\n  ssub16_3 = \"e6100f70DNM\", -- v6\r\n  sadd8_3 = \"e6100f90DNM\", -- v6\r\n  ssub8_3 = \"e6100ff0DNM\", -- v6\r\n  qadd16_3 = \"e6200f10DNM\", -- v6\r\n  qasx_3 = \"e6200f30DNM\", -- v6\r\n  qsax_3 = \"e6200f50DNM\", -- v6\r\n  qsub16_3 = \"e6200f70DNM\", -- v6\r\n  qadd8_3 = \"e6200f90DNM\", -- v6\r\n  qsub8_3 = \"e6200ff0DNM\", -- v6\r\n  shadd16_3 = \"e6300f10DNM\", -- v6\r\n  shasx_3 = \"e6300f30DNM\", -- v6\r\n  shsax_3 = \"e6300f50DNM\", -- v6\r\n  shsub16_3 = \"e6300f70DNM\", -- v6\r\n  shadd8_3 = \"e6300f90DNM\", -- v6\r\n  shsub8_3 = \"e6300ff0DNM\", -- v6\r\n  uadd16_3 = \"e6500f10DNM\", -- v6\r\n  uasx_3 = \"e6500f30DNM\", -- v6\r\n  usax_3 = \"e6500f50DNM\", -- v6\r\n  usub16_3 = \"e6500f70DNM\", -- v6\r\n  uadd8_3 = \"e6500f90DNM\", -- v6\r\n  usub8_3 = \"e6500ff0DNM\", -- v6\r\n  uqadd16_3 = \"e6600f10DNM\", -- v6\r\n  uqasx_3 = \"e6600f30DNM\", -- v6\r\n  uqsax_3 = \"e6600f50DNM\", -- v6\r\n  uqsub16_3 = \"e6600f70DNM\", -- v6\r\n  uqadd8_3 = \"e6600f90DNM\", -- v6\r\n  uqsub8_3 = \"e6600ff0DNM\", -- v6\r\n  uhadd16_3 = \"e6700f10DNM\", -- v6\r\n  uhasx_3 = \"e6700f30DNM\", -- v6\r\n  uhsax_3 = \"e6700f50DNM\", -- v6\r\n  uhsub16_3 = \"e6700f70DNM\", -- v6\r\n  uhadd8_3 = \"e6700f90DNM\", -- v6\r\n  uhsub8_3 = \"e6700ff0DNM\", -- v6\r\n\r\n  -- Load/store instructions.\r\n  str_2 = \"e4000000DL\", str_3 = \"e4000000DL\", str_4 = \"e4000000DL\",\r\n  strb_2 = \"e4400000DL\", strb_3 = \"e4400000DL\", strb_4 = \"e4400000DL\",\r\n  ldr_2 = \"e4100000DL\", ldr_3 = \"e4100000DL\", ldr_4 = \"e4100000DL\",\r\n  ldrb_2 = \"e4500000DL\", ldrb_3 = \"e4500000DL\", ldrb_4 = \"e4500000DL\",\r\n  strh_2 = \"e00000b0DL\", strh_3 = \"e00000b0DL\",\r\n  ldrh_2 = \"e01000b0DL\", ldrh_3 = \"e01000b0DL\",\r\n  ldrd_2 = \"e00000d0DL\", ldrd_3 = \"e00000d0DL\", -- v5TE\r\n  ldrsb_2 = \"e01000d0DL\", ldrsb_3 = \"e01000d0DL\",\r\n  strd_2 = \"e00000f0DL\", strd_3 = \"e00000f0DL\", -- v5TE\r\n  ldrsh_2 = \"e01000f0DL\", ldrsh_3 = \"e01000f0DL\",\r\n\r\n  ldm_2 = \"e8900000oR\", ldmia_2 = \"e8900000oR\", ldmfd_2 = \"e8900000oR\",\r\n  ldmda_2 = \"e8100000oR\", ldmfa_2 = \"e8100000oR\",\r\n  ldmdb_2 = \"e9100000oR\", ldmea_2 = \"e9100000oR\",\r\n  ldmib_2 = \"e9900000oR\", ldmed_2 = \"e9900000oR\",\r\n  stm_2 = \"e8800000oR\", stmia_2 = \"e8800000oR\", stmfd_2 = \"e8800000oR\",\r\n  stmda_2 = \"e8000000oR\", stmfa_2 = \"e8000000oR\",\r\n  stmdb_2 = \"e9000000oR\", stmea_2 = \"e9000000oR\",\r\n  stmib_2 = \"e9800000oR\", stmed_2 = \"e9800000oR\",\r\n  pop_1 = \"e8bd0000R\", push_1 = \"e92d0000R\",\r\n\r\n  -- Branch instructions.\r\n  b_1 = \"ea000000B\",\r\n  bl_1 = \"eb000000B\",\r\n  blx_1 = \"e12fff30C\",\r\n  bx_1 = \"e12fff10M\",\r\n\r\n  -- Miscellaneous instructions.\r\n  nop_0 = \"e1a00000\",\r\n  mrs_1 = \"e10f0000D\",\r\n  bkpt_1 = \"e1200070K\", -- v5T\r\n  svc_1 = \"ef000000T\", swi_1 = \"ef000000T\",\r\n  ud_0 = \"e7f001f0\",\r\n\r\n  -- VFP instructions.\r\n  [\"vadd.f32_3\"] = \"ee300a00dnm\",\r\n  [\"vadd.f64_3\"] = \"ee300b00Gdnm\",\r\n  [\"vsub.f32_3\"] = \"ee300a40dnm\",\r\n  [\"vsub.f64_3\"] = \"ee300b40Gdnm\",\r\n  [\"vmul.f32_3\"] = \"ee200a00dnm\",\r\n  [\"vmul.f64_3\"] = \"ee200b00Gdnm\",\r\n  [\"vnmul.f32_3\"] = \"ee200a40dnm\",\r\n  [\"vnmul.f64_3\"] = \"ee200b40Gdnm\",\r\n  [\"vmla.f32_3\"] = \"ee000a00dnm\",\r\n  [\"vmla.f64_3\"] = \"ee000b00Gdnm\",\r\n  [\"vmls.f32_3\"] = \"ee000a40dnm\",\r\n  [\"vmls.f64_3\"] = \"ee000b40Gdnm\",\r\n  [\"vnmla.f32_3\"] = \"ee100a40dnm\",\r\n  [\"vnmla.f64_3\"] = \"ee100b40Gdnm\",\r\n  [\"vnmls.f32_3\"] = \"ee100a00dnm\",\r\n  [\"vnmls.f64_3\"] = \"ee100b00Gdnm\",\r\n  [\"vdiv.f32_3\"] = \"ee800a00dnm\",\r\n  [\"vdiv.f64_3\"] = \"ee800b00Gdnm\",\r\n\r\n  [\"vabs.f32_2\"] = \"eeb00ac0dm\",\r\n  [\"vabs.f64_2\"] = \"eeb00bc0Gdm\",\r\n  [\"vneg.f32_2\"] = \"eeb10a40dm\",\r\n  [\"vneg.f64_2\"] = \"eeb10b40Gdm\",\r\n  [\"vsqrt.f32_2\"] = \"eeb10ac0dm\",\r\n  [\"vsqrt.f64_2\"] = \"eeb10bc0Gdm\",\r\n  [\"vcmp.f32_2\"] = \"eeb40a40dm\",\r\n  [\"vcmp.f64_2\"] = \"eeb40b40Gdm\",\r\n  [\"vcmpe.f32_2\"] = \"eeb40ac0dm\",\r\n  [\"vcmpe.f64_2\"] = \"eeb40bc0Gdm\",\r\n  [\"vcmpz.f32_1\"] = \"eeb50a40d\",\r\n  [\"vcmpz.f64_1\"] = \"eeb50b40Gd\",\r\n  [\"vcmpze.f32_1\"] = \"eeb50ac0d\",\r\n  [\"vcmpze.f64_1\"] = \"eeb50bc0Gd\",\r\n\r\n  vldr_2 = \"ed100a00dl|ed100b00Gdl\",\r\n  vstr_2 = \"ed000a00dl|ed000b00Gdl\",\r\n  vldm_2 = \"ec900a00or\",\r\n  vldmia_2 = \"ec900a00or\",\r\n  vldmdb_2 = \"ed100a00or\",\r\n  vpop_1 = \"ecbd0a00r\",\r\n  vstm_2 = \"ec800a00or\",\r\n  vstmia_2 = \"ec800a00or\",\r\n  vstmdb_2 = \"ed000a00or\",\r\n  vpush_1 = \"ed2d0a00r\",\r\n\r\n  [\"vmov.f32_2\"] = \"eeb00a40dm|eeb00a00dY\",\t-- #imm is VFPv3 only\r\n  [\"vmov.f64_2\"] = \"eeb00b40Gdm|eeb00b00GdY\",\t-- #imm is VFPv3 only\r\n  vmov_2 = \"ee100a10Dn|ee000a10nD\",\r\n  vmov_3 = \"ec500a10DNm|ec400a10mDN|ec500b10GDNm|ec400b10GmDN\",\r\n\r\n  vmrs_0 = \"eef1fa10\",\r\n  vmrs_1 = \"eef10a10D\",\r\n  vmsr_1 = \"eee10a10D\",\r\n\r\n  [\"vcvt.s32.f32_2\"] = \"eebd0ac0dm\",\r\n  [\"vcvt.s32.f64_2\"] = \"eebd0bc0dGm\",\r\n  [\"vcvt.u32.f32_2\"] = \"eebc0ac0dm\",\r\n  [\"vcvt.u32.f64_2\"] = \"eebc0bc0dGm\",\r\n  [\"vcvtr.s32.f32_2\"] = \"eebd0a40dm\",\r\n  [\"vcvtr.s32.f64_2\"] = \"eebd0b40dGm\",\r\n  [\"vcvtr.u32.f32_2\"] = \"eebc0a40dm\",\r\n  [\"vcvtr.u32.f64_2\"] = \"eebc0b40dGm\",\r\n  [\"vcvt.f32.s32_2\"] = \"eeb80ac0dm\",\r\n  [\"vcvt.f64.s32_2\"] = \"eeb80bc0GdFm\",\r\n  [\"vcvt.f32.u32_2\"] = \"eeb80a40dm\",\r\n  [\"vcvt.f64.u32_2\"] = \"eeb80b40GdFm\",\r\n  [\"vcvt.f32.f64_2\"] = \"eeb70bc0dGm\",\r\n  [\"vcvt.f64.f32_2\"] = \"eeb70ac0GdFm\",\r\n\r\n  -- VFPv4 only:\r\n  [\"vfma.f32_3\"] = \"eea00a00dnm\",\r\n  [\"vfma.f64_3\"] = \"eea00b00Gdnm\",\r\n  [\"vfms.f32_3\"] = \"eea00a40dnm\",\r\n  [\"vfms.f64_3\"] = \"eea00b40Gdnm\",\r\n  [\"vfnma.f32_3\"] = \"ee900a40dnm\",\r\n  [\"vfnma.f64_3\"] = \"ee900b40Gdnm\",\r\n  [\"vfnms.f32_3\"] = \"ee900a00dnm\",\r\n  [\"vfnms.f64_3\"] = \"ee900b00Gdnm\",\r\n\r\n  -- NYI: Advanced SIMD instructions.\r\n\r\n  -- NYI: I have no need for these instructions right now:\r\n  -- swp, swpb, strex, ldrex, strexd, ldrexd, strexb, ldrexb, strexh, ldrexh\r\n  -- msr, nopv6, yield, wfe, wfi, sev, dbg, bxj, smc, srs, rfe\r\n  -- cps, setend, pli, pld, pldw, clrex, dsb, dmb, isb\r\n  -- stc, ldc, mcr, mcr2, mrc, mrc2, mcrr, mcrr2, mrrc, mrrc2, cdp, cdp2\r\n}\r\n\r\n-- Add mnemonics for \"s\" variants.\r\ndo\r\n  local t = {}\r\n  for k,v in pairs(map_op) do\r\n    if sub(v, -1) == \"s\" then\r\n      local v2 = sub(v, 1, 2)..char(byte(v, 3)+1)..sub(v, 4, -2)\r\n      t[sub(k, 1, -3)..\"s\"..sub(k, -2)] = v2\r\n    end\r\n  end\r\n  for k,v in pairs(t) do\r\n    map_op[k] = v\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r1?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r(1?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 15 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_gpr_pm(expr)\r\n  local pm, expr2 = match(expr, \"^([+-]?)(.*)$\")\r\n  return parse_gpr(expr2), (pm == \"-\")\r\nend\r\n\r\nlocal function parse_vr(expr, tp)\r\n  local t, r = match(expr, \"^([sd])([0-9]+)$\")\r\n  if t == tp then\r\n    r = tonumber(r)\r\n    if r <= 31 then\r\n      if t == \"s\" then return shr(r, 1), band(r, 1) end\r\n      return band(r, 15), shr(r, 4)\r\n    end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_reglist(reglist)\r\n  reglist = match(reglist, \"^{%s*([^}]*)}$\")\r\n  if not reglist then werror(\"register list expected\") end\r\n  local rr = 0\r\n  for p in gmatch(reglist..\",\", \"%s*([^,]*),\") do\r\n    local rbit = shl(1, parse_gpr(gsub(p, \"%s+$\", \"\")))\r\n    if band(rr, rbit) ~= 0 then\r\n      werror(\"duplicate register `\"..p..\"'\")\r\n    end\r\n    rr = rr + rbit\r\n  end\r\n  return rr\r\nend\r\n\r\nlocal function parse_vrlist(reglist)\r\n  local ta, ra, tb, rb = match(reglist,\r\n\t\t\t   \"^{%s*([sd])([0-9]+)%s*%-%s*([sd])([0-9]+)%s*}$\")\r\n  ra, rb = tonumber(ra), tonumber(rb)\r\n  if ta and ta == tb and ra and rb and ra <= 31 and rb <= 31 and ra <= rb then\r\n    local nr = rb+1 - ra\r\n    if ta == \"s\" then\r\n      return shl(shr(ra,1),12)+shl(band(ra,1),22) + nr\r\n    else\r\n      return shl(band(ra,15),12)+shl(shr(ra,4),22) + nr*2 + 0x100\r\n    end\r\n  end\r\n  werror(\"register list expected\")\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm12(imm)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = band(n)\r\n    for i=0,-15,-1 do\r\n      if shr(m, 8) == 0 then return m + shl(band(i, 15), 8) end\r\n      m = ror(m, 2)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM12\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm16(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = tonumber(imm)\r\n  if n then\r\n    if shr(n, 16) == 0 then return band(n, 0x0fff) + shl(band(n, 0xf000), 4) end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM16\", 32*16, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm_load(imm, ext)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    if ext then\r\n      if n >= -255 and n <= 255 then\r\n\tlocal up = 0x00800000\r\n\tif n < 0 then n = -n; up = 0 end\r\n\treturn shl(band(n, 0xf0), 4) + band(n, 0x0f) + up\r\n      end\r\n    else\r\n      if n >= -4095 and n <= 4095 then\r\n\tif n >= 0 then return n+0x00800000 end\r\n\treturn -n\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(ext and \"IMML8\" or \"IMML12\", 32768 + shl(ext and 8 or 12, 5), imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_shift(shift, gprok)\r\n  if shift == \"rrx\" then\r\n    return 3 * 32\r\n  else\r\n    local s, s2 = match(shift, \"^(%S+)%s*(.*)$\")\r\n    s = map_shift[s]\r\n    if not s then werror(\"expected shift operand\") end\r\n    if sub(s2, 1, 1) == \"#\" then\r\n      return parse_imm(s2, 5, 7, 0, false) + shl(s, 5)\r\n    else\r\n      if not gprok then werror(\"expected immediate shift operand\") end\r\n      return shl(parse_gpr(s2), 8) + shl(s, 5) + 16\r\n    end\r\n  end\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\nlocal function parse_load(params, nparams, n, op)\r\n  local oplo = band(op, 255)\r\n  local ext, ldrd = (oplo ~= 0), (oplo == 208)\r\n  local d\r\n  if (ldrd or oplo == 240) then\r\n    d = band(shr(op, 12), 15)\r\n    if band(d, 1) ~= 0 then werror(\"odd destination register\") end\r\n  end\r\n  local pn = params[n]\r\n  local p1, wb = match(pn, \"^%[%s*(.-)%s*%](!?)$\")\r\n  local p2 = params[n+1]\r\n  if not p1 then\r\n    if not p2 then\r\n      if match(pn, \"^[<>=%-]\") or match(pn, \"^extern%s+\") then\r\n\tlocal mode, n, s = parse_label(pn, false)\r\n\twaction(\"REL_\"..mode, n + (ext and 0x1800 or 0x0800), s, 1)\r\n\treturn op + 15 * 65536 + 0x01000000 + (ext and 0x00400000 or 0)\r\n      end\r\n      local reg, tailr = match(pn, \"^([%w_:]+)%s*(.*)$\")\r\n      if reg and tailr ~= \"\" then\r\n\tlocal d, tp = parse_gpr(reg)\r\n\tif tp then\r\n\t  waction(ext and \"IMML8\" or \"IMML12\", 32768 + 32*(ext and 8 or 12),\r\n\t\t  format(tp.ctypefmt, tailr))\r\n\t  return op + shl(d, 16) + 0x01000000 + (ext and 0x00400000 or 0)\r\n\tend\r\n      end\r\n    end\r\n    werror(\"expected address operand\")\r\n  end\r\n  if wb == \"!\" then op = op + 0x00200000 end\r\n  if p2 then\r\n    if wb == \"!\" then werror(\"bad use of '!'\") end\r\n    local p3 = params[n+2]\r\n    op = op + shl(parse_gpr(p1), 16)\r\n    local imm = match(p2, \"^#(.*)$\")\r\n    if imm then\r\n      local m = parse_imm_load(imm, ext)\r\n      if p3 then werror(\"too many parameters\") end\r\n      op = op + m + (ext and 0x00400000 or 0)\r\n    else\r\n      local m, neg = parse_gpr_pm(p2)\r\n      if ldrd and (m == d or m-1 == d) then werror(\"register conflict\") end\r\n      op = op + m + (neg and 0 or 0x00800000) + (ext and 0 or 0x02000000)\r\n      if p3 then op = op + parse_shift(p3) end\r\n    end\r\n  else\r\n    local p1a, p2 = match(p1, \"^([^,%s]*)%s*(.*)$\")\r\n    op = op + shl(parse_gpr(p1a), 16) + 0x01000000\r\n    if p2 ~= \"\" then\r\n      local imm = match(p2, \"^,%s*#(.*)$\")\r\n      if imm then\r\n\tlocal m = parse_imm_load(imm, ext)\r\n\top = op + m + (ext and 0x00400000 or 0)\r\n      else\r\n\tlocal p2a, p3 = match(p2, \"^,%s*([^,%s]*)%s*,?%s*(.*)$\")\r\n\tlocal m, neg = parse_gpr_pm(p2a)\r\n\tif ldrd and (m == d or m-1 == d) then werror(\"register conflict\") end\r\n\top = op + m + (neg and 0 or 0x00800000) + (ext and 0 or 0x02000000)\r\n\tif p3 ~= \"\" then\r\n\t  if ext then werror(\"too many parameters\") end\r\n\t  op = op + parse_shift(p3)\r\n\tend\r\n      end\r\n    else\r\n      if wb == \"!\" then werror(\"bad use of '!'\") end\r\n      op = op + (ext and 0x00c00000 or 0x00800000)\r\n    end\r\n  end\r\n  return op\r\nend\r\n\r\nlocal function parse_vload(q)\r\n  local reg, imm = match(q, \"^%[%s*([^,%s]*)%s*(.*)%]$\")\r\n  if reg then\r\n    local d = shl(parse_gpr(reg), 16)\r\n    if imm == \"\" then return d end\r\n    imm = match(imm, \"^,%s*#(.*)$\")\r\n    if imm then\r\n      local n = tonumber(imm)\r\n      if n then\r\n\tif n >= -1020 and n <= 1020 and n%4 == 0 then\r\n\t  return d + (n >= 0 and n/4+0x00800000 or -n/4)\r\n\tend\r\n\twerror(\"out of range immediate `\"..imm..\"'\")\r\n      else\r\n\twaction(\"IMMV8\", 32768 + 32*8, imm)\r\n\treturn d\r\n      end\r\n    end\r\n  else\r\n    if match(q, \"^[<>=%-]\") or match(q, \"^extern%s+\") then\r\n      local mode, n, s = parse_label(q, false)\r\n      waction(\"REL_\"..mode, n + 0x2800, s, 1)\r\n      return 15 * 65536\r\n    end\r\n    local reg, tailr = match(q, \"^([%w_:]+)%s*(.*)$\")\r\n    if reg and tailr ~= \"\" then\r\n      local d, tp = parse_gpr(reg)\r\n      if tp then\r\n\twaction(\"IMMV8\", 32768 + 32*8, format(tp.ctypefmt, tailr))\r\n\treturn shl(d, 16)\r\n      end\r\n    end\r\n  end\r\n  werror(\"expected address operand\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nlocal function parse_template(params, template, nparams, pos)\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n = 1\r\n  local vr = \"s\"\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    local q = params[n]\r\n    if p == \"D\" then\r\n      op = op + shl(parse_gpr(q), 12); n = n + 1\r\n    elseif p == \"N\" then\r\n      op = op + shl(parse_gpr(q), 16); n = n + 1\r\n    elseif p == \"S\" then\r\n      op = op + shl(parse_gpr(q), 8); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_gpr(q); n = n + 1\r\n    elseif p == \"d\" then\r\n      local r,h = parse_vr(q, vr); op = op+shl(r,12)+shl(h,22); n = n + 1\r\n    elseif p == \"n\" then\r\n      local r,h = parse_vr(q, vr); op = op+shl(r,16)+shl(h,7); n = n + 1\r\n    elseif p == \"m\" then\r\n      local r,h = parse_vr(q, vr); op = op+r+shl(h,5); n = n + 1\r\n    elseif p == \"P\" then\r\n      local imm = match(q, \"^#(.*)$\")\r\n      if imm then\r\n\top = op + parse_imm12(imm) + 0x02000000\r\n      else\r\n\top = op + parse_gpr(q)\r\n      end\r\n      n = n + 1\r\n    elseif p == \"p\" then\r\n      op = op + parse_shift(q, true); n = n + 1\r\n    elseif p == \"L\" then\r\n      op = parse_load(params, nparams, n, op)\r\n    elseif p == \"l\" then\r\n      op = op + parse_vload(q)\r\n    elseif p == \"B\" then\r\n      local mode, n, s = parse_label(q, false)\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n    elseif p == \"C\" then -- blx gpr vs. blx label.\r\n      if match(q, \"^([%w_]+):(r1?[0-9])$\") or match(q, \"^r(1?[0-9])$\") then\r\n\top = op + parse_gpr(q)\r\n      else\r\n\tif op < 0xe0000000 then werror(\"unconditional instruction\") end\r\n\tlocal mode, n, s = parse_label(q, false)\r\n\twaction(\"REL_\"..mode, n, s, 1)\r\n\top = 0xfa000000\r\n      end\r\n    elseif p == \"F\" then\r\n      vr = \"s\"\r\n    elseif p == \"G\" then\r\n      vr = \"d\"\r\n    elseif p == \"o\" then\r\n      local r, wb = match(q, \"^([^!]*)(!?)$\")\r\n      op = op + shl(parse_gpr(r), 16) + (wb == \"!\" and 0x00200000 or 0)\r\n      n = n + 1\r\n    elseif p == \"R\" then\r\n      op = op + parse_reglist(q); n = n + 1\r\n    elseif p == \"r\" then\r\n      op = op + parse_vrlist(q); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_imm16(q); n = n + 1\r\n    elseif p == \"v\" then\r\n      op = op + parse_imm(q, 5, 7, 0, false); n = n + 1\r\n    elseif p == \"w\" then\r\n      local imm = match(q, \"^#(.*)$\")\r\n      if imm then\r\n\top = op + parse_imm(q, 5, 7, 0, false); n = n + 1\r\n      else\r\n\top = op + shl(parse_gpr(q), 8) + 16\r\n      end\r\n    elseif p == \"X\" then\r\n      op = op + parse_imm(q, 5, 16, 0, false); n = n + 1\r\n    elseif p == \"Y\" then\r\n      local imm = tonumber(match(q, \"^#(.*)$\")); n = n + 1\r\n      if not imm or shr(imm, 8) ~= 0 then\r\n\twerror(\"bad immediate operand\")\r\n      end\r\n      op = op + shl(band(imm, 0xf0), 12) + band(imm, 0x0f)\r\n    elseif p == \"K\" then\r\n      local imm = tonumber(match(q, \"^#(.*)$\")); n = n + 1\r\n      if not imm or shr(imm, 16) ~= 0 then\r\n\twerror(\"bad immediate operand\")\r\n      end\r\n      op = op + shl(band(imm, 0xfff0), 4) + band(imm, 0x000f)\r\n    elseif p == \"T\" then\r\n      op = op + parse_imm(q, 24, 0, 0, false); n = n + 1\r\n    elseif p == \"s\" then\r\n      -- Ignored.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return template:gsub(\"%x%x%x%x%x%x%x%x\", \"\") end\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 3 positions.\r\n  if secpos+3 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n  local lpos, apos, spos = #actlist, #actargs, secpos\r\n\r\n  local ok, err\r\n  for t in gmatch(template, \"[^|]+\") do\r\n    ok, err = pcall(parse_template, params, t, nparams, pos)\r\n    if ok then return end\r\n    secpos = spos\r\n    actlist[lpos+1] = nil\r\n    actlist[lpos+2] = nil\r\n    actlist[lpos+3] = nil\r\n    actargs[apos+1] = nil\r\n    actargs[apos+2] = nil\r\n    actargs[apos+3] = nil\r\n  end\r\n  error(err, 0)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = function(t, k)\r\n    local v = map_coreop[k]\r\n    if v then return v end\r\n    local k1, cc, k2 = match(k, \"^(.-)(..)([._].*)$\")\r\n    local cv = map_cond[cc]\r\n    if cv then\r\n      local v = rawget(t, k1..k2)\r\n      if type(v) == \"string\" then\r\n\tlocal scv = format(\"%x\", cv)\r\n\treturn gsub(scv..sub(v, 2), \"|e\", \"|\"..scv)\r\n      end\r\n    end\r\n  end })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_mips.h",
    "content": "/*\r\n** DynASM MIPS encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"mips\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC, DASM_IMM,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16) - 0xff00;\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n#endif\r\n\tn >>= ((ins>>10)&31);\r\n#ifdef DASM_CHECKS\r\n\tif (ins & 0x8000)\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16) - 0xff00;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16) - 0xff00;\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1);\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n);\r\n\t  if (ins & 2048)\r\n\t    n = n - (int)((char *)cp - base);\r\n\t  else\r\n\t    n = (n + (int)base) & 0x0fffffff;\r\n\tpatchrel:\r\n\t  CK((n & 3) == 0 &&\r\n\t     ((n + ((ins & 2048) ? 0x00020000 : 0)) >>\r\n\t       ((ins & 2048) ? 18 : 28)) == 0, RANGE_REL);\r\n\t  cp[-1] |= ((n>>2) & ((ins & 2048) ? 0x0000ffff: 0x03ffffff));\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_mips.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM MIPS module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"mips\",\r\n  description =\t\"DynASM MIPS module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2012-01-23\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable = assert, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch = _s.match, _s.gmatch\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, sar, tohex = bit.band, bit.lshift, bit.arshift, bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(0xff000000 + w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n >= 0xff000000 then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = { sp=\"r29\", ra=\"r31\" } -- Ext. register name -> int. name.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  if s == \"r29\" then return \"sp\"\r\n  elseif s == \"r31\" then return \"ra\" end\r\n  return s\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for MIPS instructions.\r\nlocal map_op = {\r\n  -- First-level opcodes.\r\n  j_1 =\t\t\"08000000J\",\r\n  jal_1 =\t\"0c000000J\",\r\n  b_1 =\t\t\"10000000B\",\r\n  beqz_2 =\t\"10000000SB\",\r\n  beq_3 =\t\"10000000STB\",\r\n  bnez_2 =\t\"14000000SB\",\r\n  bne_3 =\t\"14000000STB\",\r\n  blez_2 =\t\"18000000SB\",\r\n  bgtz_2 =\t\"1c000000SB\",\r\n  addi_3 =\t\"20000000TSI\",\r\n  li_2 =\t\"24000000TI\",\r\n  addiu_3 =\t\"24000000TSI\",\r\n  slti_3 =\t\"28000000TSI\",\r\n  sltiu_3 =\t\"2c000000TSI\",\r\n  andi_3 =\t\"30000000TSU\",\r\n  lu_2 =\t\"34000000TU\",\r\n  ori_3 =\t\"34000000TSU\",\r\n  xori_3 =\t\"38000000TSU\",\r\n  lui_2 =\t\"3c000000TU\",\r\n  beqzl_2 =\t\"50000000SB\",\r\n  beql_3 =\t\"50000000STB\",\r\n  bnezl_2 =\t\"54000000SB\",\r\n  bnel_3 =\t\"54000000STB\",\r\n  blezl_2 =\t\"58000000SB\",\r\n  bgtzl_2 =\t\"5c000000SB\",\r\n  lb_2 =\t\"80000000TO\",\r\n  lh_2 =\t\"84000000TO\",\r\n  lwl_2 =\t\"88000000TO\",\r\n  lw_2 =\t\"8c000000TO\",\r\n  lbu_2 =\t\"90000000TO\",\r\n  lhu_2 =\t\"94000000TO\",\r\n  lwr_2 =\t\"98000000TO\",\r\n  sb_2 =\t\"a0000000TO\",\r\n  sh_2 =\t\"a4000000TO\",\r\n  swl_2 =\t\"a8000000TO\",\r\n  sw_2 =\t\"ac000000TO\",\r\n  swr_2 =\t\"b8000000TO\",\r\n  cache_2 =\t\"bc000000NO\",\r\n  ll_2 =\t\"c0000000TO\",\r\n  lwc1_2 =\t\"c4000000HO\",\r\n  pref_2 =\t\"cc000000NO\",\r\n  ldc1_2 =\t\"d4000000HO\",\r\n  sc_2 =\t\"e0000000TO\",\r\n  swc1_2 =\t\"e4000000HO\",\r\n  sdc1_2 =\t\"f4000000HO\",\r\n\r\n  -- Opcode SPECIAL.\r\n  nop_0 =\t\"00000000\",\r\n  sll_3 =\t\"00000000DTA\",\r\n  movf_2 =\t\"00000001DS\",\r\n  movf_3 =\t\"00000001DSC\",\r\n  movt_2 =\t\"00010001DS\",\r\n  movt_3 =\t\"00010001DSC\",\r\n  srl_3 =\t\"00000002DTA\",\r\n  rotr_3 =\t\"00200002DTA\",\r\n  sra_3 =\t\"00000003DTA\",\r\n  sllv_3 =\t\"00000004DTS\",\r\n  srlv_3 =\t\"00000006DTS\",\r\n  rotrv_3 =\t\"00000046DTS\",\r\n  srav_3 =\t\"00000007DTS\",\r\n  jr_1 =\t\"00000008S\",\r\n  jalr_1 =\t\"0000f809S\",\r\n  jalr_2 =\t\"00000009DS\",\r\n  movz_3 =\t\"0000000aDST\",\r\n  movn_3 =\t\"0000000bDST\",\r\n  syscall_0 =\t\"0000000c\",\r\n  syscall_1 =\t\"0000000cY\",\r\n  break_0 =\t\"0000000d\",\r\n  break_1 =\t\"0000000dY\",\r\n  sync_0 =\t\"0000000f\",\r\n  mfhi_1 =\t\"00000010D\",\r\n  mthi_1 =\t\"00000011S\",\r\n  mflo_1 =\t\"00000012D\",\r\n  mtlo_1 =\t\"00000013S\",\r\n  mult_2 =\t\"00000018ST\",\r\n  multu_2 =\t\"00000019ST\",\r\n  div_2 =\t\"0000001aST\",\r\n  divu_2 =\t\"0000001bST\",\r\n  add_3 =\t\"00000020DST\",\r\n  move_2 =\t\"00000021DS\",\r\n  addu_3 =\t\"00000021DST\",\r\n  sub_3 =\t\"00000022DST\",\r\n  negu_2 =\t\"00000023DT\",\r\n  subu_3 =\t\"00000023DST\",\r\n  and_3 =\t\"00000024DST\",\r\n  or_3 =\t\"00000025DST\",\r\n  xor_3 =\t\"00000026DST\",\r\n  not_2 =\t\"00000027DS\",\r\n  nor_3 =\t\"00000027DST\",\r\n  slt_3 =\t\"0000002aDST\",\r\n  sltu_3 =\t\"0000002bDST\",\r\n  tge_2 =\t\"00000030ST\",\r\n  tge_3 =\t\"00000030STZ\",\r\n  tgeu_2 =\t\"00000031ST\",\r\n  tgeu_3 =\t\"00000031STZ\",\r\n  tlt_2 =\t\"00000032ST\",\r\n  tlt_3 =\t\"00000032STZ\",\r\n  tltu_2 =\t\"00000033ST\",\r\n  tltu_3 =\t\"00000033STZ\",\r\n  teq_2 =\t\"00000034ST\",\r\n  teq_3 =\t\"00000034STZ\",\r\n  tne_2 =\t\"00000036ST\",\r\n  tne_3 =\t\"00000036STZ\",\r\n\r\n  -- Opcode REGIMM.\r\n  bltz_2 =\t\"04000000SB\",\r\n  bgez_2 =\t\"04010000SB\",\r\n  bltzl_2 =\t\"04020000SB\",\r\n  bgezl_2 =\t\"04030000SB\",\r\n  tgei_2 =\t\"04080000SI\",\r\n  tgeiu_2 =\t\"04090000SI\",\r\n  tlti_2 =\t\"040a0000SI\",\r\n  tltiu_2 =\t\"040b0000SI\",\r\n  teqi_2 =\t\"040c0000SI\",\r\n  tnei_2 =\t\"040e0000SI\",\r\n  bltzal_2 =\t\"04100000SB\",\r\n  bal_1 =\t\"04110000B\",\r\n  bgezal_2 =\t\"04110000SB\",\r\n  bltzall_2 =\t\"04120000SB\",\r\n  bgezall_2 =\t\"04130000SB\",\r\n  synci_1 =\t\"041f0000O\",\r\n\r\n  -- Opcode SPECIAL2.\r\n  madd_2 =\t\"70000000ST\",\r\n  maddu_2 =\t\"70000001ST\",\r\n  mul_3 =\t\"70000002DST\",\r\n  msub_2 =\t\"70000004ST\",\r\n  msubu_2 =\t\"70000005ST\",\r\n  clz_2 =\t\"70000020DS=\",\r\n  clo_2 =\t\"70000021DS=\",\r\n  sdbbp_0 =\t\"7000003f\",\r\n  sdbbp_1 =\t\"7000003fY\",\r\n\r\n  -- Opcode SPECIAL3.\r\n  ext_4 =\t\"7c000000TSAM\", -- Note: last arg is msbd = size-1\r\n  ins_4 =\t\"7c000004TSAM\", -- Note: last arg is msb = pos+size-1\r\n  wsbh_2 =\t\"7c0000a0DT\",\r\n  seb_2 =\t\"7c000420DT\",\r\n  seh_2 =\t\"7c000620DT\",\r\n  rdhwr_2 =\t\"7c00003bTD\",\r\n\r\n  -- Opcode COP0.\r\n  mfc0_2 =\t\"40000000TD\",\r\n  mfc0_3 =\t\"40000000TDW\",\r\n  mtc0_2 =\t\"40800000TD\",\r\n  mtc0_3 =\t\"40800000TDW\",\r\n  rdpgpr_2 =\t\"41400000DT\",\r\n  di_0 =\t\"41606000\",\r\n  di_1 =\t\"41606000T\",\r\n  ei_0 =\t\"41606020\",\r\n  ei_1 =\t\"41606020T\",\r\n  wrpgpr_2 =\t\"41c00000DT\",\r\n  tlbr_0 =\t\"42000001\",\r\n  tlbwi_0 =\t\"42000002\",\r\n  tlbwr_0 =\t\"42000006\",\r\n  tlbp_0 =\t\"42000008\",\r\n  eret_0 =\t\"42000018\",\r\n  deret_0 =\t\"4200001f\",\r\n  wait_0 =\t\"42000020\",\r\n\r\n  -- Opcode COP1.\r\n  mfc1_2 =\t\"44000000TG\",\r\n  cfc1_2 =\t\"44400000TG\",\r\n  mfhc1_2 =\t\"44600000TG\",\r\n  mtc1_2 =\t\"44800000TG\",\r\n  ctc1_2 =\t\"44c00000TG\",\r\n  mthc1_2 =\t\"44e00000TG\",\r\n\r\n  bc1f_1 =\t\"45000000B\",\r\n  bc1f_2 =\t\"45000000CB\",\r\n  bc1t_1 =\t\"45010000B\",\r\n  bc1t_2 =\t\"45010000CB\",\r\n  bc1fl_1 =\t\"45020000B\",\r\n  bc1fl_2 =\t\"45020000CB\",\r\n  bc1tl_1 =\t\"45030000B\",\r\n  bc1tl_2 =\t\"45030000CB\",\r\n\r\n  [\"add.s_3\"] =\t\t\"46000000FGH\",\r\n  [\"sub.s_3\"] =\t\t\"46000001FGH\",\r\n  [\"mul.s_3\"] =\t\t\"46000002FGH\",\r\n  [\"div.s_3\"] =\t\t\"46000003FGH\",\r\n  [\"sqrt.s_2\"] =\t\"46000004FG\",\r\n  [\"abs.s_2\"] =\t\t\"46000005FG\",\r\n  [\"mov.s_2\"] =\t\t\"46000006FG\",\r\n  [\"neg.s_2\"] =\t\t\"46000007FG\",\r\n  [\"round.l.s_2\"] =\t\"46000008FG\",\r\n  [\"trunc.l.s_2\"] =\t\"46000009FG\",\r\n  [\"ceil.l.s_2\"] =\t\"4600000aFG\",\r\n  [\"floor.l.s_2\"] =\t\"4600000bFG\",\r\n  [\"round.w.s_2\"] =\t\"4600000cFG\",\r\n  [\"trunc.w.s_2\"] =\t\"4600000dFG\",\r\n  [\"ceil.w.s_2\"] =\t\"4600000eFG\",\r\n  [\"floor.w.s_2\"] =\t\"4600000fFG\",\r\n  [\"movf.s_2\"] =\t\"46000011FG\",\r\n  [\"movf.s_3\"] =\t\"46000011FGC\",\r\n  [\"movt.s_2\"] =\t\"46010011FG\",\r\n  [\"movt.s_3\"] =\t\"46010011FGC\",\r\n  [\"movz.s_3\"] =\t\"46000012FGT\",\r\n  [\"movn.s_3\"] =\t\"46000013FGT\",\r\n  [\"recip.s_2\"] =\t\"46000015FG\",\r\n  [\"rsqrt.s_2\"] =\t\"46000016FG\",\r\n  [\"cvt.d.s_2\"] =\t\"46000021FG\",\r\n  [\"cvt.w.s_2\"] =\t\"46000024FG\",\r\n  [\"cvt.l.s_2\"] =\t\"46000025FG\",\r\n  [\"cvt.ps.s_3\"] =\t\"46000026FGH\",\r\n  [\"c.f.s_2\"] =\t\t\"46000030GH\",\r\n  [\"c.f.s_3\"] =\t\t\"46000030VGH\",\r\n  [\"c.un.s_2\"] =\t\"46000031GH\",\r\n  [\"c.un.s_3\"] =\t\"46000031VGH\",\r\n  [\"c.eq.s_2\"] =\t\"46000032GH\",\r\n  [\"c.eq.s_3\"] =\t\"46000032VGH\",\r\n  [\"c.ueq.s_2\"] =\t\"46000033GH\",\r\n  [\"c.ueq.s_3\"] =\t\"46000033VGH\",\r\n  [\"c.olt.s_2\"] =\t\"46000034GH\",\r\n  [\"c.olt.s_3\"] =\t\"46000034VGH\",\r\n  [\"c.ult.s_2\"] =\t\"46000035GH\",\r\n  [\"c.ult.s_3\"] =\t\"46000035VGH\",\r\n  [\"c.ole.s_2\"] =\t\"46000036GH\",\r\n  [\"c.ole.s_3\"] =\t\"46000036VGH\",\r\n  [\"c.ule.s_2\"] =\t\"46000037GH\",\r\n  [\"c.ule.s_3\"] =\t\"46000037VGH\",\r\n  [\"c.sf.s_2\"] =\t\"46000038GH\",\r\n  [\"c.sf.s_3\"] =\t\"46000038VGH\",\r\n  [\"c.ngle.s_2\"] =\t\"46000039GH\",\r\n  [\"c.ngle.s_3\"] =\t\"46000039VGH\",\r\n  [\"c.seq.s_2\"] =\t\"4600003aGH\",\r\n  [\"c.seq.s_3\"] =\t\"4600003aVGH\",\r\n  [\"c.ngl.s_2\"] =\t\"4600003bGH\",\r\n  [\"c.ngl.s_3\"] =\t\"4600003bVGH\",\r\n  [\"c.lt.s_2\"] =\t\"4600003cGH\",\r\n  [\"c.lt.s_3\"] =\t\"4600003cVGH\",\r\n  [\"c.nge.s_2\"] =\t\"4600003dGH\",\r\n  [\"c.nge.s_3\"] =\t\"4600003dVGH\",\r\n  [\"c.le.s_2\"] =\t\"4600003eGH\",\r\n  [\"c.le.s_3\"] =\t\"4600003eVGH\",\r\n  [\"c.ngt.s_2\"] =\t\"4600003fGH\",\r\n  [\"c.ngt.s_3\"] =\t\"4600003fVGH\",\r\n\r\n  [\"add.d_3\"] =\t\t\"46200000FGH\",\r\n  [\"sub.d_3\"] =\t\t\"46200001FGH\",\r\n  [\"mul.d_3\"] =\t\t\"46200002FGH\",\r\n  [\"div.d_3\"] =\t\t\"46200003FGH\",\r\n  [\"sqrt.d_2\"] =\t\"46200004FG\",\r\n  [\"abs.d_2\"] =\t\t\"46200005FG\",\r\n  [\"mov.d_2\"] =\t\t\"46200006FG\",\r\n  [\"neg.d_2\"] =\t\t\"46200007FG\",\r\n  [\"round.l.d_2\"] =\t\"46200008FG\",\r\n  [\"trunc.l.d_2\"] =\t\"46200009FG\",\r\n  [\"ceil.l.d_2\"] =\t\"4620000aFG\",\r\n  [\"floor.l.d_2\"] =\t\"4620000bFG\",\r\n  [\"round.w.d_2\"] =\t\"4620000cFG\",\r\n  [\"trunc.w.d_2\"] =\t\"4620000dFG\",\r\n  [\"ceil.w.d_2\"] =\t\"4620000eFG\",\r\n  [\"floor.w.d_2\"] =\t\"4620000fFG\",\r\n  [\"movf.d_2\"] =\t\"46200011FG\",\r\n  [\"movf.d_3\"] =\t\"46200011FGC\",\r\n  [\"movt.d_2\"] =\t\"46210011FG\",\r\n  [\"movt.d_3\"] =\t\"46210011FGC\",\r\n  [\"movz.d_3\"] =\t\"46200012FGT\",\r\n  [\"movn.d_3\"] =\t\"46200013FGT\",\r\n  [\"recip.d_2\"] =\t\"46200015FG\",\r\n  [\"rsqrt.d_2\"] =\t\"46200016FG\",\r\n  [\"cvt.s.d_2\"] =\t\"46200020FG\",\r\n  [\"cvt.w.d_2\"] =\t\"46200024FG\",\r\n  [\"cvt.l.d_2\"] =\t\"46200025FG\",\r\n  [\"c.f.d_2\"] =\t\t\"46200030GH\",\r\n  [\"c.f.d_3\"] =\t\t\"46200030VGH\",\r\n  [\"c.un.d_2\"] =\t\"46200031GH\",\r\n  [\"c.un.d_3\"] =\t\"46200031VGH\",\r\n  [\"c.eq.d_2\"] =\t\"46200032GH\",\r\n  [\"c.eq.d_3\"] =\t\"46200032VGH\",\r\n  [\"c.ueq.d_2\"] =\t\"46200033GH\",\r\n  [\"c.ueq.d_3\"] =\t\"46200033VGH\",\r\n  [\"c.olt.d_2\"] =\t\"46200034GH\",\r\n  [\"c.olt.d_3\"] =\t\"46200034VGH\",\r\n  [\"c.ult.d_2\"] =\t\"46200035GH\",\r\n  [\"c.ult.d_3\"] =\t\"46200035VGH\",\r\n  [\"c.ole.d_2\"] =\t\"46200036GH\",\r\n  [\"c.ole.d_3\"] =\t\"46200036VGH\",\r\n  [\"c.ule.d_2\"] =\t\"46200037GH\",\r\n  [\"c.ule.d_3\"] =\t\"46200037VGH\",\r\n  [\"c.sf.d_2\"] =\t\"46200038GH\",\r\n  [\"c.sf.d_3\"] =\t\"46200038VGH\",\r\n  [\"c.ngle.d_2\"] =\t\"46200039GH\",\r\n  [\"c.ngle.d_3\"] =\t\"46200039VGH\",\r\n  [\"c.seq.d_2\"] =\t\"4620003aGH\",\r\n  [\"c.seq.d_3\"] =\t\"4620003aVGH\",\r\n  [\"c.ngl.d_2\"] =\t\"4620003bGH\",\r\n  [\"c.ngl.d_3\"] =\t\"4620003bVGH\",\r\n  [\"c.lt.d_2\"] =\t\"4620003cGH\",\r\n  [\"c.lt.d_3\"] =\t\"4620003cVGH\",\r\n  [\"c.nge.d_2\"] =\t\"4620003dGH\",\r\n  [\"c.nge.d_3\"] =\t\"4620003dVGH\",\r\n  [\"c.le.d_2\"] =\t\"4620003eGH\",\r\n  [\"c.le.d_3\"] =\t\"4620003eVGH\",\r\n  [\"c.ngt.d_2\"] =\t\"4620003fGH\",\r\n  [\"c.ngt.d_3\"] =\t\"4620003fVGH\",\r\n\r\n  [\"add.ps_3\"] =\t\"46c00000FGH\",\r\n  [\"sub.ps_3\"] =\t\"46c00001FGH\",\r\n  [\"mul.ps_3\"] =\t\"46c00002FGH\",\r\n  [\"abs.ps_2\"] =\t\"46c00005FG\",\r\n  [\"mov.ps_2\"] =\t\"46c00006FG\",\r\n  [\"neg.ps_2\"] =\t\"46c00007FG\",\r\n  [\"movf.ps_2\"] =\t\"46c00011FG\",\r\n  [\"movf.ps_3\"] =\t\"46c00011FGC\",\r\n  [\"movt.ps_2\"] =\t\"46c10011FG\",\r\n  [\"movt.ps_3\"] =\t\"46c10011FGC\",\r\n  [\"movz.ps_3\"] =\t\"46c00012FGT\",\r\n  [\"movn.ps_3\"] =\t\"46c00013FGT\",\r\n  [\"cvt.s.pu_2\"] =\t\"46c00020FG\",\r\n  [\"cvt.s.pl_2\"] =\t\"46c00028FG\",\r\n  [\"pll.ps_3\"] =\t\"46c0002cFGH\",\r\n  [\"plu.ps_3\"] =\t\"46c0002dFGH\",\r\n  [\"pul.ps_3\"] =\t\"46c0002eFGH\",\r\n  [\"puu.ps_3\"] =\t\"46c0002fFGH\",\r\n  [\"c.f.ps_2\"] =\t\"46c00030GH\",\r\n  [\"c.f.ps_3\"] =\t\"46c00030VGH\",\r\n  [\"c.un.ps_2\"] =\t\"46c00031GH\",\r\n  [\"c.un.ps_3\"] =\t\"46c00031VGH\",\r\n  [\"c.eq.ps_2\"] =\t\"46c00032GH\",\r\n  [\"c.eq.ps_3\"] =\t\"46c00032VGH\",\r\n  [\"c.ueq.ps_2\"] =\t\"46c00033GH\",\r\n  [\"c.ueq.ps_3\"] =\t\"46c00033VGH\",\r\n  [\"c.olt.ps_2\"] =\t\"46c00034GH\",\r\n  [\"c.olt.ps_3\"] =\t\"46c00034VGH\",\r\n  [\"c.ult.ps_2\"] =\t\"46c00035GH\",\r\n  [\"c.ult.ps_3\"] =\t\"46c00035VGH\",\r\n  [\"c.ole.ps_2\"] =\t\"46c00036GH\",\r\n  [\"c.ole.ps_3\"] =\t\"46c00036VGH\",\r\n  [\"c.ule.ps_2\"] =\t\"46c00037GH\",\r\n  [\"c.ule.ps_3\"] =\t\"46c00037VGH\",\r\n  [\"c.sf.ps_2\"] =\t\"46c00038GH\",\r\n  [\"c.sf.ps_3\"] =\t\"46c00038VGH\",\r\n  [\"c.ngle.ps_2\"] =\t\"46c00039GH\",\r\n  [\"c.ngle.ps_3\"] =\t\"46c00039VGH\",\r\n  [\"c.seq.ps_2\"] =\t\"46c0003aGH\",\r\n  [\"c.seq.ps_3\"] =\t\"46c0003aVGH\",\r\n  [\"c.ngl.ps_2\"] =\t\"46c0003bGH\",\r\n  [\"c.ngl.ps_3\"] =\t\"46c0003bVGH\",\r\n  [\"c.lt.ps_2\"] =\t\"46c0003cGH\",\r\n  [\"c.lt.ps_3\"] =\t\"46c0003cVGH\",\r\n  [\"c.nge.ps_2\"] =\t\"46c0003dGH\",\r\n  [\"c.nge.ps_3\"] =\t\"46c0003dVGH\",\r\n  [\"c.le.ps_2\"] =\t\"46c0003eGH\",\r\n  [\"c.le.ps_3\"] =\t\"46c0003eVGH\",\r\n  [\"c.ngt.ps_2\"] =\t\"46c0003fGH\",\r\n  [\"c.ngt.ps_3\"] =\t\"46c0003fVGH\",\r\n\r\n  [\"cvt.s.w_2\"] =\t\"46800020FG\",\r\n  [\"cvt.d.w_2\"] =\t\"46800021FG\",\r\n\r\n  [\"cvt.s.l_2\"] =\t\"46a00020FG\",\r\n  [\"cvt.d.l_2\"] =\t\"46a00021FG\",\r\n\r\n  -- Opcode COP1X.\r\n  lwxc1_2 =\t\t\"4c000000FX\",\r\n  ldxc1_2 =\t\t\"4c000001FX\",\r\n  luxc1_2 =\t\t\"4c000005FX\",\r\n  swxc1_2 =\t\t\"4c000008FX\",\r\n  sdxc1_2 =\t\t\"4c000009FX\",\r\n  suxc1_2 =\t\t\"4c00000dFX\",\r\n  prefx_2 =\t\t\"4c00000fMX\",\r\n  [\"alnv.ps_4\"] =\t\"4c00001eFGHS\",\r\n  [\"madd.s_4\"] =\t\"4c000020FRGH\",\r\n  [\"madd.d_4\"] =\t\"4c000021FRGH\",\r\n  [\"madd.ps_4\"] =\t\"4c000026FRGH\",\r\n  [\"msub.s_4\"] =\t\"4c000028FRGH\",\r\n  [\"msub.d_4\"] =\t\"4c000029FRGH\",\r\n  [\"msub.ps_4\"] =\t\"4c00002eFRGH\",\r\n  [\"nmadd.s_4\"] =\t\"4c000030FRGH\",\r\n  [\"nmadd.d_4\"] =\t\"4c000031FRGH\",\r\n  [\"nmadd.ps_4\"] =\t\"4c000036FRGH\",\r\n  [\"nmsub.s_4\"] =\t\"4c000038FRGH\",\r\n  [\"nmsub.d_4\"] =\t\"4c000039FRGH\",\r\n  [\"nmsub.ps_4\"] =\t\"4c00003eFRGH\",\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r[1-3]?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_fpr(expr)\r\n  local r = match(expr, \"^f([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^[rf]([1-3]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):([rf][1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_disp(disp)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = shl(parse_gpr(reg), 21)\r\n    local extname = match(imm, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      waction(\"REL_EXT\", map_extern[extname], nil, 1)\r\n      return r\r\n    else\r\n      return r + parse_imm(imm, 16, 0, 0, true)\r\n    end\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if tp then\r\n      waction(\"IMM\", 32768+16*32, format(tp.ctypefmt, tailr))\r\n      return shl(r, 21)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_index(idx)\r\n  local rt, rs = match(idx, \"^(.*)%(([%w_:]+)%)$\")\r\n  if rt then\r\n    rt = parse_gpr(rt)\r\n    rs = parse_gpr(rs)\r\n    return shl(rt, 16) + shl(rs, 21)\r\n  end\r\n  werror(\"bad index `\"..idx..\"'\")\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return sub(template, 9) end\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n = 1\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 2 positions (ins/ext).\r\n  if secpos+2 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    if p == \"D\" then\r\n      op = op + shl(parse_gpr(params[n]), 11); n = n + 1\r\n    elseif p == \"T\" then\r\n      op = op + shl(parse_gpr(params[n]), 16); n = n + 1\r\n    elseif p == \"S\" then\r\n      op = op + shl(parse_gpr(params[n]), 21); n = n + 1\r\n    elseif p == \"F\" then\r\n      op = op + shl(parse_fpr(params[n]), 6); n = n + 1\r\n    elseif p == \"G\" then\r\n      op = op + shl(parse_fpr(params[n]), 11); n = n + 1\r\n    elseif p == \"H\" then\r\n      op = op + shl(parse_fpr(params[n]), 16); n = n + 1\r\n    elseif p == \"R\" then\r\n      op = op + shl(parse_fpr(params[n]), 21); n = n + 1\r\n    elseif p == \"I\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, true); n = n + 1\r\n    elseif p == \"U\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, false); n = n + 1\r\n    elseif p == \"O\" then\r\n      op = op + parse_disp(params[n]); n = n + 1\r\n    elseif p == \"X\" then\r\n      op = op + parse_index(params[n]); n = n + 1\r\n    elseif p == \"B\" or p == \"J\" then\r\n      local mode, n, s = parse_label(params[n], false)\r\n      if p == \"B\" then n = n + 2048 end\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n      n = n + 1\r\n    elseif p == \"A\" then\r\n      op = op + parse_imm(params[n], 5, 6, 0, false); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_imm(params[n], 5, 11, 0, false); n = n + 1\r\n    elseif p == \"N\" then\r\n      op = op + parse_imm(params[n], 5, 16, 0, false); n = n + 1\r\n    elseif p == \"C\" then\r\n      op = op + parse_imm(params[n], 3, 18, 0, false); n = n + 1\r\n    elseif p == \"V\" then\r\n      op = op + parse_imm(params[n], 3, 8, 0, false); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_imm(params[n], 3, 0, 0, false); n = n + 1\r\n    elseif p == \"Y\" then\r\n      op = op + parse_imm(params[n], 20, 6, 0, false); n = n + 1\r\n    elseif p == \"Z\" then\r\n      op = op + parse_imm(params[n], 10, 6, 0, false); n = n + 1\r\n    elseif p == \"=\" then\r\n      op = op + shl(band(op, 0xf800), 5) -- Copy D to T for clz, clo.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_ppc.h",
    "content": "/*\r\n** DynASM PPC encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"ppc\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC, DASM_IMM,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16);\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n#endif\r\n\tn >>= ((ins>>10)&31);\r\n#ifdef DASM_CHECKS\r\n\tif (ins & 0x8000)\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1) - 4;\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base);\r\n\tpatchrel:\r\n\t  CK((n & 3) == 0 &&\r\n\t      (((n+4) + ((ins & 2048) ? 0x00008000 : 0x02000000)) >>\r\n\t       ((ins & 2048) ? 16 : 26)) == 0, RANGE_REL);\r\n\t  cp[-1] |= ((n+4) & ((ins & 2048) ? 0x0000fffc: 0x03fffffc));\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_ppc.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM PPC module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"ppc\",\r\n  description =\t\"DynASM PPC module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable = assert, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch = _s.match, _s.gmatch\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr, sar = bit.band, bit.lshift, bit.rshift, bit.arshift\r\nlocal tohex = bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n <= 0xffffff then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = { sp = \"r1\" } -- Ext. register name -> int. name.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  if s == \"r1\" then return \"sp\" end\r\n  return s\r\nend\r\n\r\nlocal map_cond = {\r\n  lt = 0, gt = 1, eq = 2, so = 3,\r\n  ge = 4, le = 5, ne = 6, ns = 7,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for PPC instructions.\r\nlocal map_op = {\r\n  tdi_3 =\t\"08000000ARI\",\r\n  twi_3 =\t\"0c000000ARI\",\r\n  mulli_3 =\t\"1c000000RRI\",\r\n  subfic_3 =\t\"20000000RRI\",\r\n  cmplwi_3 =\t\"28000000XRU\",\r\n  cmplwi_2 =\t\"28000000-RU\",\r\n  cmpldi_3 =\t\"28200000XRU\",\r\n  cmpldi_2 =\t\"28200000-RU\",\r\n  cmpwi_3 =\t\"2c000000XRI\",\r\n  cmpwi_2 =\t\"2c000000-RI\",\r\n  cmpdi_3 =\t\"2c200000XRI\",\r\n  cmpdi_2 =\t\"2c200000-RI\",\r\n  addic_3 =\t\"30000000RRI\",\r\n  [\"addic._3\"] = \"34000000RRI\",\r\n  addi_3 =\t\"38000000RR0I\",\r\n  li_2 =\t\"38000000RI\",\r\n  la_2 =\t\"38000000RD\",\r\n  addis_3 =\t\"3c000000RR0I\",\r\n  lis_2 =\t\"3c000000RI\",\r\n  lus_2 =\t\"3c000000RU\",\r\n  bc_3 =\t\"40000000AAK\",\r\n  bcl_3 =\t\"40000001AAK\",\r\n  bdnz_1 =\t\"42000000K\",\r\n  bdz_1 =\t\"42400000K\",\r\n  sc_0 =\t\"44000000\",\r\n  b_1 =\t\t\"48000000J\",\r\n  bl_1 =\t\"48000001J\",\r\n  rlwimi_5 =\t\"50000000RR~AAA.\",\r\n  rlwinm_5 =\t\"54000000RR~AAA.\",\r\n  rlwnm_5 =\t\"5c000000RR~RAA.\",\r\n  ori_3 =\t\"60000000RR~U\",\r\n  nop_0 =\t\"60000000\",\r\n  oris_3 =\t\"64000000RR~U\",\r\n  xori_3 =\t\"68000000RR~U\",\r\n  xoris_3 =\t\"6c000000RR~U\",\r\n  [\"andi._3\"] =\t\"70000000RR~U\",\r\n  [\"andis._3\"] = \"74000000RR~U\",\r\n  lwz_2 =\t\"80000000RD\",\r\n  lwzu_2 =\t\"84000000RD\",\r\n  lbz_2 =\t\"88000000RD\",\r\n  lbzu_2 =\t\"8c000000RD\",\r\n  stw_2 =\t\"90000000RD\",\r\n  stwu_2 =\t\"94000000RD\",\r\n  stb_2 =\t\"98000000RD\",\r\n  stbu_2 =\t\"9c000000RD\",\r\n  lhz_2 =\t\"a0000000RD\",\r\n  lhzu_2 =\t\"a4000000RD\",\r\n  lha_2 =\t\"a8000000RD\",\r\n  lhau_2 =\t\"ac000000RD\",\r\n  sth_2 =\t\"b0000000RD\",\r\n  sthu_2 =\t\"b4000000RD\",\r\n  lmw_2 =\t\"b8000000RD\",\r\n  stmw_2 =\t\"bc000000RD\",\r\n  lfs_2 =\t\"c0000000FD\",\r\n  lfsu_2 =\t\"c4000000FD\",\r\n  lfd_2 =\t\"c8000000FD\",\r\n  lfdu_2 =\t\"cc000000FD\",\r\n  stfs_2 =\t\"d0000000FD\",\r\n  stfsu_2 =\t\"d4000000FD\",\r\n  stfd_2 =\t\"d8000000FD\",\r\n  stfdu_2 =\t\"dc000000FD\",\r\n  ld_2 =\t\"e8000000RD\", -- NYI: displacement must be divisible by 4.\r\n  ldu_2 =\t\"e8000001RD\",\r\n  lwa_2 =\t\"e8000002RD\",\r\n  std_2 =\t\"f8000000RD\",\r\n  stdu_2 =\t\"f8000001RD\",\r\n\r\n  -- Primary opcode 19:\r\n  mcrf_2 =\t\"4c000000XX\",\r\n  isync_0 =\t\"4c00012c\",\r\n  crnor_3 =\t\"4c000042CCC\",\r\n  crnot_2 =\t\"4c000042CC=\",\r\n  crandc_3 =\t\"4c000102CCC\",\r\n  crxor_3 =\t\"4c000182CCC\",\r\n  crclr_1 =\t\"4c000182C==\",\r\n  crnand_3 =\t\"4c0001c2CCC\",\r\n  crand_3 =\t\"4c000202CCC\",\r\n  creqv_3 =\t\"4c000242CCC\",\r\n  crset_1 =\t\"4c000242C==\",\r\n  crorc_3 =\t\"4c000342CCC\",\r\n  cror_3 =\t\"4c000382CCC\",\r\n  crmove_2 =\t\"4c000382CC=\",\r\n  bclr_2 =\t\"4c000020AA\",\r\n  bclrl_2 =\t\"4c000021AA\",\r\n  bcctr_2 =\t\"4c000420AA\",\r\n  bcctrl_2 =\t\"4c000421AA\",\r\n  blr_0 =\t\"4e800020\",\r\n  blrl_0 =\t\"4e800021\",\r\n  bctr_0 =\t\"4e800420\",\r\n  bctrl_0 =\t\"4e800421\",\r\n\r\n  -- Primary opcode 31:\r\n  cmpw_3 =\t\"7c000000XRR\",\r\n  cmpw_2 =\t\"7c000000-RR\",\r\n  cmpd_3 =\t\"7c200000XRR\",\r\n  cmpd_2 =\t\"7c200000-RR\",\r\n  tw_3 =\t\"7c000008ARR\",\r\n  subfc_3 =\t\"7c000010RRR.\",\r\n  subc_3 =\t\"7c000010RRR~.\",\r\n  mulhdu_3 =\t\"7c000012RRR.\",\r\n  addc_3 =\t\"7c000014RRR.\",\r\n  mulhwu_3 =\t\"7c000016RRR.\",\r\n  isel_4 =\t\"7c00001eRRRC\",\r\n  isellt_3 =\t\"7c00001eRRR\",\r\n  iselgt_3 =\t\"7c00005eRRR\",\r\n  iseleq_3 =\t\"7c00009eRRR\",\r\n  mfcr_1 =\t\"7c000026R\",\r\n  mfocrf_2 =\t\"7c100026RG\",\r\n  mtcrf_2 =\t\"7c000120GR\",\r\n  mtocrf_2 =\t\"7c100120GR\",\r\n  lwarx_3 =\t\"7c000028RR0R\",\r\n  ldx_3 =\t\"7c00002aRR0R\",\r\n  lwzx_3 =\t\"7c00002eRR0R\",\r\n  slw_3 =\t\"7c000030RR~R.\",\r\n  cntlzw_2 =\t\"7c000034RR~\",\r\n  sld_3 =\t\"7c000036RR~R.\",\r\n  and_3 =\t\"7c000038RR~R.\",\r\n  cmplw_3 =\t\"7c000040XRR\",\r\n  cmplw_2 =\t\"7c000040-RR\",\r\n  cmpld_3 =\t\"7c200040XRR\",\r\n  cmpld_2 =\t\"7c200040-RR\",\r\n  subf_3 =\t\"7c000050RRR.\",\r\n  sub_3 =\t\"7c000050RRR~.\",\r\n  ldux_3 =\t\"7c00006aRR0R\",\r\n  dcbst_2 =\t\"7c00006c-RR\",\r\n  lwzux_3 =\t\"7c00006eRR0R\",\r\n  cntlzd_2 =\t\"7c000074RR~\",\r\n  andc_3 =\t\"7c000078RR~R.\",\r\n  td_3 =\t\"7c000088ARR\",\r\n  mulhd_3 =\t\"7c000092RRR.\",\r\n  mulhw_3 =\t\"7c000096RRR.\",\r\n  ldarx_3 =\t\"7c0000a8RR0R\",\r\n  dcbf_2 =\t\"7c0000ac-RR\",\r\n  lbzx_3 =\t\"7c0000aeRR0R\",\r\n  neg_2 =\t\"7c0000d0RR.\",\r\n  lbzux_3 =\t\"7c0000eeRR0R\",\r\n  popcntb_2 =\t\"7c0000f4RR~\",\r\n  not_2 =\t\"7c0000f8RR~%.\",\r\n  nor_3 =\t\"7c0000f8RR~R.\",\r\n  subfe_3 =\t\"7c000110RRR.\",\r\n  sube_3 =\t\"7c000110RRR~.\",\r\n  adde_3 =\t\"7c000114RRR.\",\r\n  stdx_3 =\t\"7c00012aRR0R\",\r\n  stwcx_3 =\t\"7c00012cRR0R.\",\r\n  stwx_3 =\t\"7c00012eRR0R\",\r\n  prtyw_2 =\t\"7c000134RR~\",\r\n  stdux_3 =\t\"7c00016aRR0R\",\r\n  stwux_3 =\t\"7c00016eRR0R\",\r\n  prtyd_2 =\t\"7c000174RR~\",\r\n  subfze_2 =\t\"7c000190RR.\",\r\n  addze_2 =\t\"7c000194RR.\",\r\n  stdcx_3 =\t\"7c0001acRR0R.\",\r\n  stbx_3 =\t\"7c0001aeRR0R\",\r\n  subfme_2 =\t\"7c0001d0RR.\",\r\n  mulld_3 =\t\"7c0001d2RRR.\",\r\n  addme_2 =\t\"7c0001d4RR.\",\r\n  mullw_3 =\t\"7c0001d6RRR.\",\r\n  dcbtst_2 =\t\"7c0001ec-RR\",\r\n  stbux_3 =\t\"7c0001eeRR0R\",\r\n  add_3 =\t\"7c000214RRR.\",\r\n  dcbt_2 =\t\"7c00022c-RR\",\r\n  lhzx_3 =\t\"7c00022eRR0R\",\r\n  eqv_3 =\t\"7c000238RR~R.\",\r\n  eciwx_3 =\t\"7c00026cRR0R\",\r\n  lhzux_3 =\t\"7c00026eRR0R\",\r\n  xor_3 =\t\"7c000278RR~R.\",\r\n  mfspefscr_1 =\t\"7c0082a6R\",\r\n  mfxer_1 =\t\"7c0102a6R\",\r\n  mflr_1 =\t\"7c0802a6R\",\r\n  mfctr_1 =\t\"7c0902a6R\",\r\n  lwax_3 =\t\"7c0002aaRR0R\",\r\n  lhax_3 =\t\"7c0002aeRR0R\",\r\n  mftb_1 =\t\"7c0c42e6R\",\r\n  mftbu_1 =\t\"7c0d42e6R\",\r\n  lwaux_3 =\t\"7c0002eaRR0R\",\r\n  lhaux_3 =\t\"7c0002eeRR0R\",\r\n  sthx_3 =\t\"7c00032eRR0R\",\r\n  orc_3 =\t\"7c000338RR~R.\",\r\n  ecowx_3 =\t\"7c00036cRR0R\",\r\n  sthux_3 =\t\"7c00036eRR0R\",\r\n  or_3 =\t\"7c000378RR~R.\",\r\n  mr_2 =\t\"7c000378RR~%.\",\r\n  divdu_3 =\t\"7c000392RRR.\",\r\n  divwu_3 =\t\"7c000396RRR.\",\r\n  mtspefscr_1 =\t\"7c0083a6R\",\r\n  mtxer_1 =\t\"7c0103a6R\",\r\n  mtlr_1 =\t\"7c0803a6R\",\r\n  mtctr_1 =\t\"7c0903a6R\",\r\n  dcbi_2 =\t\"7c0003ac-RR\",\r\n  nand_3 =\t\"7c0003b8RR~R.\",\r\n  divd_3 =\t\"7c0003d2RRR.\",\r\n  divw_3 =\t\"7c0003d6RRR.\",\r\n  cmpb_3 =\t\"7c0003f8RR~R.\",\r\n  mcrxr_1 =\t\"7c000400X\",\r\n  subfco_3 =\t\"7c000410RRR.\",\r\n  subco_3 =\t\"7c000410RRR~.\",\r\n  addco_3 =\t\"7c000414RRR.\",\r\n  ldbrx_3 =\t\"7c000428RR0R\",\r\n  lswx_3 =\t\"7c00042aRR0R\",\r\n  lwbrx_3 =\t\"7c00042cRR0R\",\r\n  lfsx_3 =\t\"7c00042eFR0R\",\r\n  srw_3 =\t\"7c000430RR~R.\",\r\n  srd_3 =\t\"7c000436RR~R.\",\r\n  subfo_3 =\t\"7c000450RRR.\",\r\n  subo_3 =\t\"7c000450RRR~.\",\r\n  lfsux_3 =\t\"7c00046eFR0R\",\r\n  lswi_3 =\t\"7c0004aaRR0A\",\r\n  sync_0 =\t\"7c0004ac\",\r\n  lwsync_0 =\t\"7c2004ac\",\r\n  ptesync_0 =\t\"7c4004ac\",\r\n  lfdx_3 =\t\"7c0004aeFR0R\",\r\n  nego_2 =\t\"7c0004d0RR.\",\r\n  lfdux_3 =\t\"7c0004eeFR0R\",\r\n  subfeo_3 =\t\"7c000510RRR.\",\r\n  subeo_3 =\t\"7c000510RRR~.\",\r\n  addeo_3 =\t\"7c000514RRR.\",\r\n  stdbrx_3 =\t\"7c000528RR0R\",\r\n  stswx_3 =\t\"7c00052aRR0R\",\r\n  stwbrx_3 =\t\"7c00052cRR0R\",\r\n  stfsx_3 =\t\"7c00052eFR0R\",\r\n  stfsux_3 =\t\"7c00056eFR0R\",\r\n  subfzeo_2 =\t\"7c000590RR.\",\r\n  addzeo_2 =\t\"7c000594RR.\",\r\n  stswi_3 =\t\"7c0005aaRR0A\",\r\n  stfdx_3 =\t\"7c0005aeFR0R\",\r\n  subfmeo_2 =\t\"7c0005d0RR.\",\r\n  mulldo_3 =\t\"7c0005d2RRR.\",\r\n  addmeo_2 =\t\"7c0005d4RR.\",\r\n  mullwo_3 =\t\"7c0005d6RRR.\",\r\n  dcba_2 =\t\"7c0005ec-RR\",\r\n  stfdux_3 =\t\"7c0005eeFR0R\",\r\n  addo_3 =\t\"7c000614RRR.\",\r\n  lhbrx_3 =\t\"7c00062cRR0R\",\r\n  sraw_3 =\t\"7c000630RR~R.\",\r\n  srad_3 =\t\"7c000634RR~R.\",\r\n  srawi_3 =\t\"7c000670RR~A.\",\r\n  sradi_3 =\t\"7c000674RR~H.\",\r\n  eieio_0 =\t\"7c0006ac\",\r\n  lfiwax_3 =\t\"7c0006aeFR0R\",\r\n  sthbrx_3 =\t\"7c00072cRR0R\",\r\n  extsh_2 =\t\"7c000734RR~.\",\r\n  extsb_2 =\t\"7c000774RR~.\",\r\n  divduo_3 =\t\"7c000792RRR.\",\r\n  divwou_3 =\t\"7c000796RRR.\",\r\n  icbi_2 =\t\"7c0007ac-RR\",\r\n  stfiwx_3 =\t\"7c0007aeFR0R\",\r\n  extsw_2 =\t\"7c0007b4RR~.\",\r\n  divdo_3 =\t\"7c0007d2RRR.\",\r\n  divwo_3 =\t\"7c0007d6RRR.\",\r\n  dcbz_2 =\t\"7c0007ec-RR\",\r\n\r\n  -- Primary opcode 30:\r\n  rldicl_4 =\t\"78000000RR~HM.\",\r\n  rldicr_4 =\t\"78000004RR~HM.\",\r\n  rldic_4 =\t\"78000008RR~HM.\",\r\n  rldimi_4 =\t\"7800000cRR~HM.\",\r\n  rldcl_4 =\t\"78000010RR~RM.\",\r\n  rldcr_4 =\t\"78000012RR~RM.\",\r\n\r\n  -- Primary opcode 59:\r\n  fdivs_3 =\t\"ec000024FFF.\",\r\n  fsubs_3 =\t\"ec000028FFF.\",\r\n  fadds_3 =\t\"ec00002aFFF.\",\r\n  fsqrts_2 =\t\"ec00002cF-F.\",\r\n  fres_2 =\t\"ec000030F-F.\",\r\n  fmuls_3 =\t\"ec000032FF-F.\",\r\n  frsqrtes_2 =\t\"ec000034F-F.\",\r\n  fmsubs_4 =\t\"ec000038FFFF~.\",\r\n  fmadds_4 =\t\"ec00003aFFFF~.\",\r\n  fnmsubs_4 =\t\"ec00003cFFFF~.\",\r\n  fnmadds_4 =\t\"ec00003eFFFF~.\",\r\n\r\n  -- Primary opcode 63:\r\n  fdiv_3 =\t\"fc000024FFF.\",\r\n  fsub_3 =\t\"fc000028FFF.\",\r\n  fadd_3 =\t\"fc00002aFFF.\",\r\n  fsqrt_2 =\t\"fc00002cF-F.\",\r\n  fsel_4 =\t\"fc00002eFFFF~.\",\r\n  fre_2 =\t\"fc000030F-F.\",\r\n  fmul_3 =\t\"fc000032FF-F.\",\r\n  frsqrte_2 =\t\"fc000034F-F.\",\r\n  fmsub_4 =\t\"fc000038FFFF~.\",\r\n  fmadd_4 =\t\"fc00003aFFFF~.\",\r\n  fnmsub_4 =\t\"fc00003cFFFF~.\",\r\n  fnmadd_4 =\t\"fc00003eFFFF~.\",\r\n  fcmpu_3 =\t\"fc000000XFF\",\r\n  fcpsgn_3 =\t\"fc000010FFF.\",\r\n  fcmpo_3 =\t\"fc000040XFF\",\r\n  mtfsb1_1 =\t\"fc00004cA\",\r\n  fneg_2 =\t\"fc000050F-F.\",\r\n  mcrfs_2 =\t\"fc000080XX\",\r\n  mtfsb0_1 =\t\"fc00008cA\",\r\n  fmr_2 =\t\"fc000090F-F.\",\r\n  frsp_2 =\t\"fc000018F-F.\",\r\n  fctiw_2 =\t\"fc00001cF-F.\",\r\n  fctiwz_2 =\t\"fc00001eF-F.\",\r\n  mtfsfi_2 =\t\"fc00010cAA\", -- NYI: upshift.\r\n  fnabs_2 =\t\"fc000110F-F.\",\r\n  fabs_2 =\t\"fc000210F-F.\",\r\n  frin_2 =\t\"fc000310F-F.\",\r\n  friz_2 =\t\"fc000350F-F.\",\r\n  frip_2 =\t\"fc000390F-F.\",\r\n  frim_2 =\t\"fc0003d0F-F.\",\r\n  mffs_1 =\t\"fc00048eF.\",\r\n  -- NYI: mtfsf, mtfsb0, mtfsb1.\r\n  fctid_2 =\t\"fc00065cF-F.\",\r\n  fctidz_2 =\t\"fc00065eF-F.\",\r\n  fcfid_2 =\t\"fc00069cF-F.\",\r\n\r\n  -- Primary opcode 4, SPE APU extension:\r\n  evaddw_3 =\t\t\"10000200RRR\",\r\n  evaddiw_3 =\t\t\"10000202RAR~\",\r\n  evsubw_3 =\t\t\"10000204RRR~\",\r\n  evsubiw_3 =\t\t\"10000206RAR~\",\r\n  evabs_2 =\t\t\"10000208RR\",\r\n  evneg_2 =\t\t\"10000209RR\",\r\n  evextsb_2 =\t\t\"1000020aRR\",\r\n  evextsh_2 =\t\t\"1000020bRR\",\r\n  evrndw_2 =\t\t\"1000020cRR\",\r\n  evcntlzw_2 =\t\t\"1000020dRR\",\r\n  evcntlsw_2 =\t\t\"1000020eRR\",\r\n  brinc_3 =\t\t\"1000020fRRR\",\r\n  evand_3 =\t\t\"10000211RRR\",\r\n  evandc_3 =\t\t\"10000212RRR\",\r\n  evxor_3 =\t\t\"10000216RRR\",\r\n  evor_3 =\t\t\"10000217RRR\",\r\n  evmr_2 =\t\t\"10000217RR=\",\r\n  evnor_3 =\t\t\"10000218RRR\",\r\n  evnot_2 =\t\t\"10000218RR=\",\r\n  eveqv_3 =\t\t\"10000219RRR\",\r\n  evorc_3 =\t\t\"1000021bRRR\",\r\n  evnand_3 =\t\t\"1000021eRRR\",\r\n  evsrwu_3 =\t\t\"10000220RRR\",\r\n  evsrws_3 =\t\t\"10000221RRR\",\r\n  evsrwiu_3 =\t\t\"10000222RRA\",\r\n  evsrwis_3 =\t\t\"10000223RRA\",\r\n  evslw_3 =\t\t\"10000224RRR\",\r\n  evslwi_3 =\t\t\"10000226RRA\",\r\n  evrlw_3 =\t\t\"10000228RRR\",\r\n  evsplati_2 =\t\t\"10000229RS\",\r\n  evrlwi_3 =\t\t\"1000022aRRA\",\r\n  evsplatfi_2 =\t\t\"1000022bRS\",\r\n  evmergehi_3 =\t\t\"1000022cRRR\",\r\n  evmergelo_3 =\t\t\"1000022dRRR\",\r\n  evcmpgtu_3 =\t\t\"10000230XRR\",\r\n  evcmpgtu_2 =\t\t\"10000230-RR\",\r\n  evcmpgts_3 =\t\t\"10000231XRR\",\r\n  evcmpgts_2 =\t\t\"10000231-RR\",\r\n  evcmpltu_3 =\t\t\"10000232XRR\",\r\n  evcmpltu_2 =\t\t\"10000232-RR\",\r\n  evcmplts_3 =\t\t\"10000233XRR\",\r\n  evcmplts_2 =\t\t\"10000233-RR\",\r\n  evcmpeq_3 =\t\t\"10000234XRR\",\r\n  evcmpeq_2 =\t\t\"10000234-RR\",\r\n  evsel_4 =\t\t\"10000278RRRW\",\r\n  evsel_3 =\t\t\"10000278RRR\",\r\n  evfsadd_3 =\t\t\"10000280RRR\",\r\n  evfssub_3 =\t\t\"10000281RRR\",\r\n  evfsabs_2 =\t\t\"10000284RR\",\r\n  evfsnabs_2 =\t\t\"10000285RR\",\r\n  evfsneg_2 =\t\t\"10000286RR\",\r\n  evfsmul_3 =\t\t\"10000288RRR\",\r\n  evfsdiv_3 =\t\t\"10000289RRR\",\r\n  evfscmpgt_3 =\t\t\"1000028cXRR\",\r\n  evfscmpgt_2 =\t\t\"1000028c-RR\",\r\n  evfscmplt_3 =\t\t\"1000028dXRR\",\r\n  evfscmplt_2 =\t\t\"1000028d-RR\",\r\n  evfscmpeq_3 =\t\t\"1000028eXRR\",\r\n  evfscmpeq_2 =\t\t\"1000028e-RR\",\r\n  evfscfui_2 =\t\t\"10000290R-R\",\r\n  evfscfsi_2 =\t\t\"10000291R-R\",\r\n  evfscfuf_2 =\t\t\"10000292R-R\",\r\n  evfscfsf_2 =\t\t\"10000293R-R\",\r\n  evfsctui_2 =\t\t\"10000294R-R\",\r\n  evfsctsi_2 =\t\t\"10000295R-R\",\r\n  evfsctuf_2 =\t\t\"10000296R-R\",\r\n  evfsctsf_2 =\t\t\"10000297R-R\",\r\n  evfsctuiz_2 =\t\t\"10000298R-R\",\r\n  evfsctsiz_2 =\t\t\"1000029aR-R\",\r\n  evfststgt_3 =\t\t\"1000029cXRR\",\r\n  evfststgt_2 =\t\t\"1000029c-RR\",\r\n  evfststlt_3 =\t\t\"1000029dXRR\",\r\n  evfststlt_2 =\t\t\"1000029d-RR\",\r\n  evfststeq_3 =\t\t\"1000029eXRR\",\r\n  evfststeq_2 =\t\t\"1000029e-RR\",\r\n  efsadd_3 =\t\t\"100002c0RRR\",\r\n  efssub_3 =\t\t\"100002c1RRR\",\r\n  efsabs_2 =\t\t\"100002c4RR\",\r\n  efsnabs_2 =\t\t\"100002c5RR\",\r\n  efsneg_2 =\t\t\"100002c6RR\",\r\n  efsmul_3 =\t\t\"100002c8RRR\",\r\n  efsdiv_3 =\t\t\"100002c9RRR\",\r\n  efscmpgt_3 =\t\t\"100002ccXRR\",\r\n  efscmpgt_2 =\t\t\"100002cc-RR\",\r\n  efscmplt_3 =\t\t\"100002cdXRR\",\r\n  efscmplt_2 =\t\t\"100002cd-RR\",\r\n  efscmpeq_3 =\t\t\"100002ceXRR\",\r\n  efscmpeq_2 =\t\t\"100002ce-RR\",\r\n  efscfd_2 =\t\t\"100002cfR-R\",\r\n  efscfui_2 =\t\t\"100002d0R-R\",\r\n  efscfsi_2 =\t\t\"100002d1R-R\",\r\n  efscfuf_2 =\t\t\"100002d2R-R\",\r\n  efscfsf_2 =\t\t\"100002d3R-R\",\r\n  efsctui_2 =\t\t\"100002d4R-R\",\r\n  efsctsi_2 =\t\t\"100002d5R-R\",\r\n  efsctuf_2 =\t\t\"100002d6R-R\",\r\n  efsctsf_2 =\t\t\"100002d7R-R\",\r\n  efsctuiz_2 =\t\t\"100002d8R-R\",\r\n  efsctsiz_2 =\t\t\"100002daR-R\",\r\n  efststgt_3 =\t\t\"100002dcXRR\",\r\n  efststgt_2 =\t\t\"100002dc-RR\",\r\n  efststlt_3 =\t\t\"100002ddXRR\",\r\n  efststlt_2 =\t\t\"100002dd-RR\",\r\n  efststeq_3 =\t\t\"100002deXRR\",\r\n  efststeq_2 =\t\t\"100002de-RR\",\r\n  efdadd_3 =\t\t\"100002e0RRR\",\r\n  efdsub_3 =\t\t\"100002e1RRR\",\r\n  efdcfuid_2 =\t\t\"100002e2R-R\",\r\n  efdcfsid_2 =\t\t\"100002e3R-R\",\r\n  efdabs_2 =\t\t\"100002e4RR\",\r\n  efdnabs_2 =\t\t\"100002e5RR\",\r\n  efdneg_2 =\t\t\"100002e6RR\",\r\n  efdmul_3 =\t\t\"100002e8RRR\",\r\n  efddiv_3 =\t\t\"100002e9RRR\",\r\n  efdctuidz_2 =\t\t\"100002eaR-R\",\r\n  efdctsidz_2 =\t\t\"100002ebR-R\",\r\n  efdcmpgt_3 =\t\t\"100002ecXRR\",\r\n  efdcmpgt_2 =\t\t\"100002ec-RR\",\r\n  efdcmplt_3 =\t\t\"100002edXRR\",\r\n  efdcmplt_2 =\t\t\"100002ed-RR\",\r\n  efdcmpeq_3 =\t\t\"100002eeXRR\",\r\n  efdcmpeq_2 =\t\t\"100002ee-RR\",\r\n  efdcfs_2 =\t\t\"100002efR-R\",\r\n  efdcfui_2 =\t\t\"100002f0R-R\",\r\n  efdcfsi_2 =\t\t\"100002f1R-R\",\r\n  efdcfuf_2 =\t\t\"100002f2R-R\",\r\n  efdcfsf_2 =\t\t\"100002f3R-R\",\r\n  efdctui_2 =\t\t\"100002f4R-R\",\r\n  efdctsi_2 =\t\t\"100002f5R-R\",\r\n  efdctuf_2 =\t\t\"100002f6R-R\",\r\n  efdctsf_2 =\t\t\"100002f7R-R\",\r\n  efdctuiz_2 =\t\t\"100002f8R-R\",\r\n  efdctsiz_2 =\t\t\"100002faR-R\",\r\n  efdtstgt_3 =\t\t\"100002fcXRR\",\r\n  efdtstgt_2 =\t\t\"100002fc-RR\",\r\n  efdtstlt_3 =\t\t\"100002fdXRR\",\r\n  efdtstlt_2 =\t\t\"100002fd-RR\",\r\n  efdtsteq_3 =\t\t\"100002feXRR\",\r\n  efdtsteq_2 =\t\t\"100002fe-RR\",\r\n  evlddx_3 =\t\t\"10000300RR0R\",\r\n  evldd_2 =\t\t\"10000301R8\",\r\n  evldwx_3 =\t\t\"10000302RR0R\",\r\n  evldw_2 =\t\t\"10000303R8\",\r\n  evldhx_3 =\t\t\"10000304RR0R\",\r\n  evldh_2 =\t\t\"10000305R8\",\r\n  evlwhex_3 =\t\t\"10000310RR0R\",\r\n  evlwhe_2 =\t\t\"10000311R4\",\r\n  evlwhoux_3 =\t\t\"10000314RR0R\",\r\n  evlwhou_2 =\t\t\"10000315R4\",\r\n  evlwhosx_3 =\t\t\"10000316RR0R\",\r\n  evlwhos_2 =\t\t\"10000317R4\",\r\n  evstddx_3 =\t\t\"10000320RR0R\",\r\n  evstdd_2 =\t\t\"10000321R8\",\r\n  evstdwx_3 =\t\t\"10000322RR0R\",\r\n  evstdw_2 =\t\t\"10000323R8\",\r\n  evstdhx_3 =\t\t\"10000324RR0R\",\r\n  evstdh_2 =\t\t\"10000325R8\",\r\n  evstwhex_3 =\t\t\"10000330RR0R\",\r\n  evstwhe_2 =\t\t\"10000331R4\",\r\n  evstwhox_3 =\t\t\"10000334RR0R\",\r\n  evstwho_2 =\t\t\"10000335R4\",\r\n  evstwwex_3 =\t\t\"10000338RR0R\",\r\n  evstwwe_2 =\t\t\"10000339R4\",\r\n  evstwwox_3 =\t\t\"1000033cRR0R\",\r\n  evstwwo_2 =\t\t\"1000033dR4\",\r\n  evmhessf_3 =\t\t\"10000403RRR\",\r\n  evmhossf_3 =\t\t\"10000407RRR\",\r\n  evmheumi_3 =\t\t\"10000408RRR\",\r\n  evmhesmi_3 =\t\t\"10000409RRR\",\r\n  evmhesmf_3 =\t\t\"1000040bRRR\",\r\n  evmhoumi_3 =\t\t\"1000040cRRR\",\r\n  evmhosmi_3 =\t\t\"1000040dRRR\",\r\n  evmhosmf_3 =\t\t\"1000040fRRR\",\r\n  evmhessfa_3 =\t\t\"10000423RRR\",\r\n  evmhossfa_3 =\t\t\"10000427RRR\",\r\n  evmheumia_3 =\t\t\"10000428RRR\",\r\n  evmhesmia_3 =\t\t\"10000429RRR\",\r\n  evmhesmfa_3 =\t\t\"1000042bRRR\",\r\n  evmhoumia_3 =\t\t\"1000042cRRR\",\r\n  evmhosmia_3 =\t\t\"1000042dRRR\",\r\n  evmhosmfa_3 =\t\t\"1000042fRRR\",\r\n  evmwhssf_3 =\t\t\"10000447RRR\",\r\n  evmwlumi_3 =\t\t\"10000448RRR\",\r\n  evmwhumi_3 =\t\t\"1000044cRRR\",\r\n  evmwhsmi_3 =\t\t\"1000044dRRR\",\r\n  evmwhsmf_3 =\t\t\"1000044fRRR\",\r\n  evmwssf_3 =\t\t\"10000453RRR\",\r\n  evmwumi_3 =\t\t\"10000458RRR\",\r\n  evmwsmi_3 =\t\t\"10000459RRR\",\r\n  evmwsmf_3 =\t\t\"1000045bRRR\",\r\n  evmwhssfa_3 =\t\t\"10000467RRR\",\r\n  evmwlumia_3 =\t\t\"10000468RRR\",\r\n  evmwhumia_3 =\t\t\"1000046cRRR\",\r\n  evmwhsmia_3 =\t\t\"1000046dRRR\",\r\n  evmwhsmfa_3 =\t\t\"1000046fRRR\",\r\n  evmwssfa_3 =\t\t\"10000473RRR\",\r\n  evmwumia_3 =\t\t\"10000478RRR\",\r\n  evmwsmia_3 =\t\t\"10000479RRR\",\r\n  evmwsmfa_3 =\t\t\"1000047bRRR\",\r\n  evmra_2 =\t\t\"100004c4RR\",\r\n  evdivws_3 =\t\t\"100004c6RRR\",\r\n  evdivwu_3 =\t\t\"100004c7RRR\",\r\n  evmwssfaa_3 =\t\t\"10000553RRR\",\r\n  evmwumiaa_3 =\t\t\"10000558RRR\",\r\n  evmwsmiaa_3 =\t\t\"10000559RRR\",\r\n  evmwsmfaa_3 =\t\t\"1000055bRRR\",\r\n  evmwssfan_3 =\t\t\"100005d3RRR\",\r\n  evmwumian_3 =\t\t\"100005d8RRR\",\r\n  evmwsmian_3 =\t\t\"100005d9RRR\",\r\n  evmwsmfan_3 =\t\t\"100005dbRRR\",\r\n  evmergehilo_3 =\t\"1000022eRRR\",\r\n  evmergelohi_3 =\t\"1000022fRRR\",\r\n  evlhhesplatx_3 =\t\"10000308RR0R\",\r\n  evlhhesplat_2 =\t\"10000309R2\",\r\n  evlhhousplatx_3 =\t\"1000030cRR0R\",\r\n  evlhhousplat_2 =\t\"1000030dR2\",\r\n  evlhhossplatx_3 =\t\"1000030eRR0R\",\r\n  evlhhossplat_2 =\t\"1000030fR2\",\r\n  evlwwsplatx_3 =\t\"10000318RR0R\",\r\n  evlwwsplat_2 =\t\"10000319R4\",\r\n  evlwhsplatx_3 =\t\"1000031cRR0R\",\r\n  evlwhsplat_2 =\t\"1000031dR4\",\r\n  evaddusiaaw_2 =\t\"100004c0RR\",\r\n  evaddssiaaw_2 =\t\"100004c1RR\",\r\n  evsubfusiaaw_2 =\t\"100004c2RR\",\r\n  evsubfssiaaw_2 =\t\"100004c3RR\",\r\n  evaddumiaaw_2 =\t\"100004c8RR\",\r\n  evaddsmiaaw_2 =\t\"100004c9RR\",\r\n  evsubfumiaaw_2 =\t\"100004caRR\",\r\n  evsubfsmiaaw_2 =\t\"100004cbRR\",\r\n  evmheusiaaw_3 =\t\"10000500RRR\",\r\n  evmhessiaaw_3 =\t\"10000501RRR\",\r\n  evmhessfaaw_3 =\t\"10000503RRR\",\r\n  evmhousiaaw_3 =\t\"10000504RRR\",\r\n  evmhossiaaw_3 =\t\"10000505RRR\",\r\n  evmhossfaaw_3 =\t\"10000507RRR\",\r\n  evmheumiaaw_3 =\t\"10000508RRR\",\r\n  evmhesmiaaw_3 =\t\"10000509RRR\",\r\n  evmhesmfaaw_3 =\t\"1000050bRRR\",\r\n  evmhoumiaaw_3 =\t\"1000050cRRR\",\r\n  evmhosmiaaw_3 =\t\"1000050dRRR\",\r\n  evmhosmfaaw_3 =\t\"1000050fRRR\",\r\n  evmhegumiaa_3 =\t\"10000528RRR\",\r\n  evmhegsmiaa_3 =\t\"10000529RRR\",\r\n  evmhegsmfaa_3 =\t\"1000052bRRR\",\r\n  evmhogumiaa_3 =\t\"1000052cRRR\",\r\n  evmhogsmiaa_3 =\t\"1000052dRRR\",\r\n  evmhogsmfaa_3 =\t\"1000052fRRR\",\r\n  evmwlusiaaw_3 =\t\"10000540RRR\",\r\n  evmwlssiaaw_3 =\t\"10000541RRR\",\r\n  evmwlumiaaw_3 =\t\"10000548RRR\",\r\n  evmwlsmiaaw_3 =\t\"10000549RRR\",\r\n  evmheusianw_3 =\t\"10000580RRR\",\r\n  evmhessianw_3 =\t\"10000581RRR\",\r\n  evmhessfanw_3 =\t\"10000583RRR\",\r\n  evmhousianw_3 =\t\"10000584RRR\",\r\n  evmhossianw_3 =\t\"10000585RRR\",\r\n  evmhossfanw_3 =\t\"10000587RRR\",\r\n  evmheumianw_3 =\t\"10000588RRR\",\r\n  evmhesmianw_3 =\t\"10000589RRR\",\r\n  evmhesmfanw_3 =\t\"1000058bRRR\",\r\n  evmhoumianw_3 =\t\"1000058cRRR\",\r\n  evmhosmianw_3 =\t\"1000058dRRR\",\r\n  evmhosmfanw_3 =\t\"1000058fRRR\",\r\n  evmhegumian_3 =\t\"100005a8RRR\",\r\n  evmhegsmian_3 =\t\"100005a9RRR\",\r\n  evmhegsmfan_3 =\t\"100005abRRR\",\r\n  evmhogumian_3 =\t\"100005acRRR\",\r\n  evmhogsmian_3 =\t\"100005adRRR\",\r\n  evmhogsmfan_3 =\t\"100005afRRR\",\r\n  evmwlusianw_3 =\t\"100005c0RRR\",\r\n  evmwlssianw_3 =\t\"100005c1RRR\",\r\n  evmwlumianw_3 =\t\"100005c8RRR\",\r\n  evmwlsmianw_3 =\t\"100005c9RRR\",\r\n\r\n  -- NYI: Book E instructions.\r\n}\r\n\r\n-- Add mnemonics for \".\" variants.\r\ndo\r\n  local t = {}\r\n  for k,v in pairs(map_op) do\r\n    if sub(v, -1) == \".\" then\r\n      local v2 = sub(v, 1, 7)..char(byte(v, 8)+1)..sub(v, 9, -2)\r\n      t[sub(k, 1, -3)..\".\"..sub(k, -2)] = v2\r\n    end\r\n  end\r\n  for k,v in pairs(t) do\r\n    map_op[k] = v\r\n  end\r\nend\r\n\r\n-- Add more branch mnemonics.\r\nfor cond,c in pairs(map_cond) do\r\n  local b1 = \"b\"..cond\r\n  local c1 = shl(band(c, 3), 16) + (c < 4 and 0x01000000 or 0)\r\n  -- bX[l]\r\n  map_op[b1..\"_1\"] = tohex(0x40800000 + c1)..\"K\"\r\n  map_op[b1..\"y_1\"] = tohex(0x40a00000 + c1)..\"K\"\r\n  map_op[b1..\"l_1\"] = tohex(0x40800001 + c1)..\"K\"\r\n  map_op[b1..\"_2\"] = tohex(0x40800000 + c1)..\"-XK\"\r\n  map_op[b1..\"y_2\"] = tohex(0x40a00000 + c1)..\"-XK\"\r\n  map_op[b1..\"l_2\"] = tohex(0x40800001 + c1)..\"-XK\"\r\n  -- bXlr[l]\r\n  map_op[b1..\"lr_0\"] = tohex(0x4c800020 + c1)\r\n  map_op[b1..\"lrl_0\"] = tohex(0x4c800021 + c1)\r\n  map_op[b1..\"ctr_0\"] = tohex(0x4c800420 + c1)\r\n  map_op[b1..\"ctrl_0\"] = tohex(0x4c800421 + c1)\r\n  -- bXctr[l]\r\n  map_op[b1..\"lr_1\"] = tohex(0x4c800020 + c1)..\"-X\"\r\n  map_op[b1..\"lrl_1\"] = tohex(0x4c800021 + c1)..\"-X\"\r\n  map_op[b1..\"ctr_1\"] = tohex(0x4c800420 + c1)..\"-X\"\r\n  map_op[b1..\"ctrl_1\"] = tohex(0x4c800421 + c1)..\"-X\"\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r[1-3]?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_fpr(expr)\r\n  local r = match(expr, \"^f([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_cr(expr)\r\n  local r = match(expr, \"^cr([0-7])$\")\r\n  if r then return tonumber(r) end\r\n  werror(\"bad condition register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_cond(expr)\r\n  local r, cond = match(expr, \"^4%*cr([0-7])%+(%w%w)$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    local c = map_cond[cond]\r\n    if c and c < 4 then return r*4+c end\r\n  end\r\n  werror(\"bad condition bit name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^r([1-3]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):(r[1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_shiftmask(imm, isshift)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    if shr(n, 6) == 0 then\r\n      local lsb = band(imm, 31)\r\n      local msb = imm - lsb\r\n      return isshift and (shl(lsb, 11)+shr(msb, 4)) or (shl(lsb, 6)+msb)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^r([1-3]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):(r[1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    werror(\"NYI: parameterized 64 bit shift/mask\")\r\n  end\r\nend\r\n\r\nlocal function parse_disp(disp)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    return shl(r, 16) + parse_imm(imm, 16, 0, 0, true)\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    if tp then\r\n      waction(\"IMM\", 32768+16*32, format(tp.ctypefmt, tailr))\r\n      return shl(r, 16)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_u5disp(disp, scale)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    return shl(r, 16) + parse_imm(imm, 5, 11, scale, false)\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    if tp then\r\n      waction(\"IMM\", scale*1024+5*32+11, format(tp.ctypefmt, tailr))\r\n      return shl(r, 16)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return sub(template, 9) end\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n, rs = 1, 26\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 3 positions (rlwinm).\r\n  if secpos+3 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    if p == \"R\" then\r\n      rs = rs - 5; op = op + shl(parse_gpr(params[n]), rs); n = n + 1\r\n    elseif p == \"F\" then\r\n      rs = rs - 5; op = op + shl(parse_fpr(params[n]), rs); n = n + 1\r\n    elseif p == \"A\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 5, rs, 0, false); n = n + 1\r\n    elseif p == \"S\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 5, rs, 0, true); n = n + 1\r\n    elseif p == \"I\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, true); n = n + 1\r\n    elseif p == \"U\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, false); n = n + 1\r\n    elseif p == \"D\" then\r\n      op = op + parse_disp(params[n]); n = n + 1\r\n    elseif p == \"2\" then\r\n      op = op + parse_u5disp(params[n], 1); n = n + 1\r\n    elseif p == \"4\" then\r\n      op = op + parse_u5disp(params[n], 2); n = n + 1\r\n    elseif p == \"8\" then\r\n      op = op + parse_u5disp(params[n], 3); n = n + 1\r\n    elseif p == \"C\" then\r\n      rs = rs - 5; op = op + shl(parse_cond(params[n]), rs); n = n + 1\r\n    elseif p == \"X\" then\r\n      rs = rs - 5; op = op + shl(parse_cr(params[n]), rs+2); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_cr(params[n]); n = n + 1\r\n    elseif p == \"G\" then\r\n      op = op + parse_imm(params[n], 8, 12, 0, false); n = n + 1\r\n    elseif p == \"H\" then\r\n      op = op + parse_shiftmask(params[n], true); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_shiftmask(params[n], false); n = n + 1\r\n    elseif p == \"J\" or p == \"K\" then\r\n      local mode, n, s = parse_label(params[n], false)\r\n      if p == \"K\" then n = n + 2048 end\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n      n = n + 1\r\n    elseif p == \"0\" then\r\n      if band(shr(op, rs), 31) == 0 then werror(\"cannot use r0\") end\r\n    elseif p == \"=\" or p == \"%\" then\r\n      local t = band(shr(op, p == \"%\" and rs+5 or rs), 31)\r\n      rs = rs - 5\r\n      op = op + shl(t, rs)\r\n    elseif p == \"~\" then\r\n      local mm = shl(31, rs)\r\n      local lo = band(op, mm)\r\n      local hi = band(op, shl(mm, 5))\r\n      op = op - lo - hi + shl(lo, 5) + shr(hi, 5)\r\n    elseif p == \"-\" then\r\n      rs = rs - 5\r\n    elseif p == \".\" then\r\n      -- Ignored.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_proto.h",
    "content": "/*\r\n** DynASM encoding engine prototypes.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#ifndef _DASM_PROTO_H\r\n#define _DASM_PROTO_H\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n\r\n#define DASM_IDENT\t\"DynASM 1.3.0\"\r\n#define DASM_VERSION\t10300\t/* 1.3.0 */\r\n\r\n#ifndef Dst_DECL\r\n#define Dst_DECL\tdasm_State **Dst\r\n#endif\r\n\r\n#ifndef Dst_REF\r\n#define Dst_REF\t\t(*Dst)\r\n#endif\r\n\r\n#ifndef DASM_FDEF\r\n#define DASM_FDEF\textern\r\n#endif\r\n\r\n#ifndef DASM_M_GROW\r\n#define DASM_M_GROW(ctx, t, p, sz, need) \\\r\n  do { \\\r\n    size_t _sz = (sz), _need = (need); \\\r\n    if (_sz < _need) { \\\r\n      if (_sz < 16) _sz = 16; \\\r\n      while (_sz < _need) _sz += _sz; \\\r\n      (p) = (t *)realloc((p), _sz); \\\r\n      if ((p) == NULL) exit(1); \\\r\n      (sz) = _sz; \\\r\n    } \\\r\n  } while(0)\r\n#endif\r\n\r\n#ifndef DASM_M_FREE\r\n#define DASM_M_FREE(ctx, p, sz)\tfree(p)\r\n#endif\r\n\r\n/* Internal DynASM encoder state. */\r\ntypedef struct dasm_State dasm_State;\r\n\r\n\r\n/* Initialize and free DynASM state. */\r\nDASM_FDEF void dasm_init(Dst_DECL, int maxsection);\r\nDASM_FDEF void dasm_free(Dst_DECL);\r\n\r\n/* Setup global array. Must be called before dasm_setup(). */\r\nDASM_FDEF void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl);\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nDASM_FDEF void dasm_growpc(Dst_DECL, unsigned int maxpc);\r\n\r\n/* Setup encoder. */\r\nDASM_FDEF void dasm_setup(Dst_DECL, const void *actionlist);\r\n\r\n/* Feed encoder with actions. Calls are generated by pre-processor. */\r\nDASM_FDEF void dasm_put(Dst_DECL, int start, ...);\r\n\r\n/* Link sections and return the resulting size. */\r\nDASM_FDEF int dasm_link(Dst_DECL, size_t *szp);\r\n\r\n/* Encode sections into buffer. */\r\nDASM_FDEF int dasm_encode(Dst_DECL, void *buffer);\r\n\r\n/* Get PC label offset. */\r\nDASM_FDEF int dasm_getpclabel(Dst_DECL, unsigned int pc);\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nDASM_FDEF int dasm_checkstep(Dst_DECL, int secmatch);\r\n#else\r\n#define dasm_checkstep(a, b)\t0\r\n#endif\r\n\r\n\r\n#endif /* _DASM_PROTO_H */\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_x64.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM x64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n-- This module just sets 64 bit mode for the combined x86/x64 module.\r\n-- All the interesting stuff is there.\r\n------------------------------------------------------------------------------\r\n\r\nx64 = true -- Using a global is an ugly, but effective solution.\r\nreturn require(\"dasm_x86\")\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_x86.h",
    "content": "/*\r\n** DynASM x86 encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"x86\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. DASM_STOP must be 255. */\r\nenum {\r\n  DASM_DISP = 233,\r\n  DASM_IMM_S, DASM_IMM_B, DASM_IMM_W, DASM_IMM_D, DASM_IMM_WB, DASM_IMM_DB,\r\n  DASM_VREG, DASM_SPACE, DASM_SETLABEL, DASM_REL_A, DASM_REL_LG, DASM_REL_PC,\r\n  DASM_IMM_LG, DASM_IMM_PC, DASM_LABEL_LG, DASM_LABEL_PC, DASM_ALIGN,\r\n  DASM_EXTERN, DASM_ESC, DASM_MARK, DASM_SECTION, DASM_STOP\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_VREG\t0x15000000\r\n#define DASM_S_UNDEF_L\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned char *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(int)(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status=DASM_S_RANGE_##st|(int)(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs, mrm = 4;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    int action = *p++;\r\n    if (action < DASM_DISP) {\r\n      ofs++;\r\n    } else if (action <= DASM_REL_A) {\r\n      int n = va_arg(ap, int);\r\n      b[pos++] = n;\r\n      switch (action) {\r\n      case DASM_DISP:\r\n\tif (n == 0) { if ((mrm&7) == 4) mrm = p[-2]; if ((mrm&7) != 5) break; }\r\n      case DASM_IMM_DB: if (((n+128)&-256) == 0) goto ob;\r\n      case DASM_REL_A: /* Assumes ptrdiff_t is int. !x64 */\r\n      case DASM_IMM_D: ofs += 4; break;\r\n      case DASM_IMM_S: CK(((n+128)&-256) == 0, RANGE_I); goto ob;\r\n      case DASM_IMM_B: CK((n&-256) == 0, RANGE_I); ob: ofs++; break;\r\n      case DASM_IMM_WB: if (((n+128)&-256) == 0) goto ob;\r\n      case DASM_IMM_W: CK((n&-65536) == 0, RANGE_I); ofs += 2; break;\r\n      case DASM_SPACE: p++; ofs += n; break;\r\n      case DASM_SETLABEL: b[pos-2] = -0x40000000; break;  /* Neg. label ofs. */\r\n      case DASM_VREG: CK((n&-8) == 0 && (n != 4 || (*p&1) == 0), RANGE_VREG);\r\n\tif (*p++ == 1 && *p == DASM_DISP) mrm = n; continue;\r\n      }\r\n      mrm = 4;\r\n    } else {\r\n      int *pl, n;\r\n      switch (action) {\r\n      case DASM_REL_LG:\r\n      case DASM_IMM_LG:\r\n\tn = *p++; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n <= 246) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl -= 246; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n      case DASM_IMM_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tofs += 4;  /* Maximum offset needed. */\r\n\tif (action == DASM_REL_LG || action == DASM_REL_PC)\r\n\t  b[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_LABEL_LG: pl = D->lglabels + *p++; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos; }\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_ALIGN:\r\n\tofs += *p++;  /* Maximum alignment needed (arg is 2**n-1). */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_EXTERN: p += 2; ofs += 4; break;\r\n      case DASM_ESC: p++; ofs++; break;\r\n      case DASM_MARK: mrm = p[-2]; break;\r\n      case DASM_SECTION:\r\n\tn = *p; CK(n < D->maxsection, RANGE_SEC); D->section = &D->sections[n];\r\n      case DASM_STOP: goto stop;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink branches/aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tint op, action = *p++;\r\n\tswitch (action) {\r\n\tcase DASM_REL_LG: p++; op = p[-3]; goto rel_pc;\r\n\tcase DASM_REL_PC: op = p[-2]; rel_pc: {\r\n\t  int shrink = op == 0xe9 ? 3 : ((op&0xf0) == 0x80 ? 4 : 0);\r\n\t  if (shrink) {  /* Shrinkable branch opcode? */\r\n\t    int lofs, lpos = b[pos];\r\n\t    if (lpos < 0) goto noshrink;  /* Ext global? */\r\n\t    lofs = *DASM_POS2PTR(D, lpos);\r\n\t    if (lpos > pos) {  /* Fwd label: add cumulative section offsets. */\r\n\t      int i;\r\n\t      for (i = secnum; i < DASM_POS2SEC(lpos); i++)\r\n\t\tlofs += D->sections[i].ofs;\r\n\t    } else {\r\n\t      lofs -= ofs;  /* Bkwd label: unfix offset. */\r\n\t    }\r\n\t    lofs -= b[pos+1];  /* Short branch ok? */\r\n\t    if (lofs >= -128-shrink && lofs <= 127) ofs -= shrink;  /* Yes. */\r\n\t    else { noshrink: shrink = 0; }  /* No, cannot shrink op. */\r\n\t  }\r\n\t  b[pos+1] = shrink;\r\n\t  pos += 2;\r\n\t  break;\r\n\t}\r\n\tcase DASM_SPACE: case DASM_IMM_LG: case DASM_VREG: p++;\r\n\tcase DASM_DISP: case DASM_IMM_S: case DASM_IMM_B: case DASM_IMM_W:\r\n\tcase DASM_IMM_D: case DASM_IMM_WB: case DASM_IMM_DB:\r\n\tcase DASM_SETLABEL: case DASM_REL_A: case DASM_IMM_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: p++;\r\n\tcase DASM_LABEL_PC: b[pos++] += ofs; break; /* Fix label offset. */\r\n\tcase DASM_ALIGN: ofs -= (b[pos++]+ofs)&*p++; break; /* Adjust ofs. */\r\n\tcase DASM_EXTERN: p += 2; break;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_MARK: break;\r\n\tcase DASM_SECTION: case DASM_STOP: goto stop;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#define dasmb(x)\t*cp++ = (unsigned char)(x)\r\n#ifndef DASM_ALIGNED_WRITES\r\n#define dasmw(x) \\\r\n  do { *((unsigned short *)cp) = (unsigned short)(x); cp+=2; } while (0)\r\n#define dasmd(x) \\\r\n  do { *((unsigned int *)cp) = (unsigned int)(x); cp+=4; } while (0)\r\n#else\r\n#define dasmw(x)\tdo { dasmb(x); dasmb((x)>>8); } while (0)\r\n#define dasmd(x)\tdo { dasmw(x); dasmw((x)>>16); } while (0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  unsigned char *base = (unsigned char *)buffer;\r\n  unsigned char *cp = base;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      unsigned char *mark = NULL;\r\n      while (1) {\r\n\tint action = *p++;\r\n\tint n = (action >= DASM_DISP && action <= DASM_ALIGN) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_DISP: if (!mark) mark = cp; {\r\n\t  unsigned char *mm = mark;\r\n\t  if (*p != DASM_IMM_DB && *p != DASM_IMM_WB) mark = NULL;\r\n\t  if (n == 0) { int mrm = mm[-1]&7; if (mrm == 4) mrm = mm[0]&7;\r\n\t    if (mrm != 5) { mm[-1] -= 0x80; break; } }\r\n\t  if (((n+128) & -256) != 0) goto wd; else mm[-1] -= 0x40;\r\n\t}\r\n\tcase DASM_IMM_S: case DASM_IMM_B: wb: dasmb(n); break;\r\n\tcase DASM_IMM_DB: if (((n+128)&-256) == 0) {\r\n\t    db: if (!mark) mark = cp; mark[-2] += 2; mark = NULL; goto wb;\r\n\t  } else mark = NULL;\r\n\tcase DASM_IMM_D: wd: dasmd(n); break;\r\n\tcase DASM_IMM_WB: if (((n+128)&-256) == 0) goto db; else mark = NULL;\r\n\tcase DASM_IMM_W: dasmw(n); break;\r\n\tcase DASM_VREG: { int t = *p++; if (t >= 2) n<<=3; cp[-1] |= n; break; }\r\n\tcase DASM_REL_LG: p++; if (n >= 0) goto rel_pc;\r\n\t  b++; n = (int)(ptrdiff_t)D->globals[-n];\r\n\tcase DASM_REL_A: rel_a: n -= (int)(ptrdiff_t)(cp+4); goto wd; /* !x64 */\r\n\tcase DASM_REL_PC: rel_pc: {\r\n\t  int shrink = *b++;\r\n\t  int *pb = DASM_POS2PTR(D, n); if (*pb < 0) { n = pb[1]; goto rel_a; }\r\n\t  n = *pb - ((int)(cp-base) + 4-shrink);\r\n\t  if (shrink == 0) goto wd;\r\n\t  if (shrink == 4) { cp--; cp[-1] = *cp-0x10; } else cp[-1] = 0xeb;\r\n\t  goto wb;\r\n\t}\r\n\tcase DASM_IMM_LG:\r\n\t  p++; if (n < 0) { n = (int)(ptrdiff_t)D->globals[-n]; goto wd; }\r\n\tcase DASM_IMM_PC: {\r\n\t  int *pb = DASM_POS2PTR(D, n);\r\n\t  n = *pb < 0 ? pb[1] : (*pb + (int)(ptrdiff_t)base);\r\n\t  goto wd;\r\n\t}\r\n\tcase DASM_LABEL_LG: {\r\n\t  int idx = *p++;\r\n\t  if (idx >= 10)\r\n\t    D->globals[idx] = (void *)(base + (*p == DASM_SETLABEL ? *b : n));\r\n\t  break;\r\n\t}\r\n\tcase DASM_LABEL_PC: case DASM_SETLABEL: break;\r\n\tcase DASM_SPACE: { int fill = *p++; while (n--) *cp++ = fill; break; }\r\n\tcase DASM_ALIGN:\r\n\t  n = *p++;\r\n\t  while (((cp-base) & n)) *cp++ = 0x90; /* nop */\r\n\t  break;\r\n\tcase DASM_EXTERN: n = DASM_EXTERN(Dst, cp, p[1], *p); p += 2; goto wd;\r\n\tcase DASM_MARK: mark = cp; break;\r\n\tcase DASM_ESC: action = *p++;\r\n\tdefault: *cp++ = action; break;\r\n\tcase DASM_SECTION: case DASM_STOP: goto stop;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_L|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(int)(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dasm_x86.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM x86/x64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\nlocal x64 = x64\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\tx64 and \"x64\" or \"x86\",\r\n  description =\t\"DynASM x86/x64 module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, unpack, setmetatable = assert, unpack or table.unpack, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal find, match, gmatch, gsub = _s.find, _s.match, _s.gmatch, _s.gsub\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr = bit.band, bit.lshift, bit.rshift\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  -- int arg, 1 buffer pos:\r\n  \"DISP\",  \"IMM_S\", \"IMM_B\", \"IMM_W\", \"IMM_D\",  \"IMM_WB\", \"IMM_DB\",\r\n  -- action arg (1 byte), int arg, 1 buffer pos (reg/num):\r\n  \"VREG\", \"SPACE\", -- !x64: VREG support NYI.\r\n  -- ptrdiff_t arg, 1 buffer pos (address): !x64\r\n  \"SETLABEL\", \"REL_A\",\r\n  -- action arg (1 byte) or int arg, 2 buffer pos (link, offset):\r\n  \"REL_LG\", \"REL_PC\",\r\n  -- action arg (1 byte) or int arg, 1 buffer pos (link):\r\n  \"IMM_LG\", \"IMM_PC\",\r\n  -- action arg (1 byte) or int arg, 1 buffer pos (offset):\r\n  \"LABEL_LG\", \"LABEL_PC\",\r\n  -- action arg (1 byte), 1 buffer pos (offset):\r\n  \"ALIGN\",\r\n  -- action args (2 bytes), no buffer pos.\r\n  \"EXTERN\",\r\n  -- action arg (1 byte), no buffer pos.\r\n  \"ESC\",\r\n  -- no action arg, no buffer pos.\r\n  \"MARK\",\r\n  -- action arg (1 byte), no buffer pos, terminal action:\r\n  \"SECTION\",\r\n  -- no args, no buffer pos, terminal action:\r\n  \"STOP\"\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number (dynamically generated below).\r\nlocal map_action = {}\r\n-- First action number. Everything below does not need to be escaped.\r\nlocal actfirst = 256-#action_names\r\n\r\n-- Action list buffer and string (only used to remove dupes).\r\nlocal actlist = {}\r\nlocal actstr = \"\"\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Compute action numbers for action names.\r\nfor n,name in ipairs(action_names) do\r\n  local num = actfirst + n - 1\r\n  map_action[name] = num\r\nend\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  local last = actlist[nn] or 255\r\n  actlist[nn] = nil -- Remove last byte.\r\n  if nn == 0 then nn = 1 end\r\n  out:write(\"static const unsigned char \", name, \"[\", nn, \"] = {\\n\")\r\n  local s = \"  \"\r\n  for n,b in ipairs(actlist) do\r\n    s = s..b..\",\"\r\n    if #s >= 75 then\r\n      assert(out:write(s, \"\\n\"))\r\n      s = \"  \"\r\n    end\r\n  end\r\n  out:write(s, last, \"\\n};\\n\\n\") -- Add last byte back.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add byte to action list.\r\nlocal function wputxb(n)\r\n  assert(n >= 0 and n <= 255 and n % 1 == 0, \"byte out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, a, num)\r\n  wputxb(assert(map_action[action], \"bad action name `\"..action..\"'\"))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Add call to embedded DynASM C code.\r\nlocal function wcall(func, args)\r\n  wline(format(\"dasm_%s(Dst, %s);\", func, concat(args, \", \")), true)\r\nend\r\n\r\n-- Delete duplicate action list chunks. A tad slow, but so what.\r\nlocal function dedupechunk(offset)\r\n  local al, as = actlist, actstr\r\n  local chunk = char(unpack(al, offset+1, #al))\r\n  local orig = find(as, chunk, 1, true)\r\n  if orig then\r\n    actargs[1] = orig-1 -- Replace with original offset.\r\n    for i=offset+1,#al do al[i] = nil end -- Kill dupe.\r\n  else\r\n    actstr = as..chunk\r\n  end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  local offset = actargs[1]\r\n  if #actlist == offset then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  dedupechunk(offset)\r\n  wcall(\"put\", actargs) -- Add call to dasm_put().\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped byte.\r\nlocal function wputb(n)\r\n  if n >= actfirst then waction(\"ESC\") end -- Need to escape byte.\r\n  wputxb(n)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 10\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_@]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 246 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(\"  \", prefix, gsub(t[i], \"@.*\", \"\"), \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = -1\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n < -256 then werror(\"too many extern labels\") end\r\n  next_extern = n - 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_extern) do t[-n] = name end\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=1,-next_extern-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_extern) do t[-n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=1,-next_extern-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = {}\t\t-- Ext. register name -> int. name.\r\nlocal map_reg_rev = {}\t\t-- Int. register name -> ext. name.\r\nlocal map_reg_num = {}\t\t-- Int. register name -> register number.\r\nlocal map_reg_opsize = {}\t-- Int. register name -> operand size.\r\nlocal map_reg_valid_base = {}\t-- Int. register name -> valid base register?\r\nlocal map_reg_valid_index = {}\t-- Int. register name -> valid index register?\r\nlocal map_reg_needrex = {}\t-- Int. register name -> need rex vs. no rex.\r\nlocal reg_list = {}\t\t-- Canonical list of int. register names.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for _PTx macros).\r\n\r\nlocal addrsize = x64 and \"q\" or \"d\"\t-- Size for address operands.\r\n\r\n-- Helper functions to fill register maps.\r\nlocal function mkrmap(sz, cl, names)\r\n  local cname = format(\"@%s\", sz)\r\n  reg_list[#reg_list+1] = cname\r\n  map_archdef[cl] = cname\r\n  map_reg_rev[cname] = cl\r\n  map_reg_num[cname] = -1\r\n  map_reg_opsize[cname] = sz\r\n  if sz == addrsize or sz == \"d\" then\r\n    map_reg_valid_base[cname] = true\r\n    map_reg_valid_index[cname] = true\r\n  end\r\n  if names then\r\n    for n,name in ipairs(names) do\r\n      local iname = format(\"@%s%x\", sz, n-1)\r\n      reg_list[#reg_list+1] = iname\r\n      map_archdef[name] = iname\r\n      map_reg_rev[iname] = name\r\n      map_reg_num[iname] = n-1\r\n      map_reg_opsize[iname] = sz\r\n      if sz == \"b\" and n > 4 then map_reg_needrex[iname] = false end\r\n      if sz == addrsize or sz == \"d\" then\r\n\tmap_reg_valid_base[iname] = true\r\n\tmap_reg_valid_index[iname] = true\r\n      end\r\n    end\r\n  end\r\n  for i=0,(x64 and sz ~= \"f\") and 15 or 7 do\r\n    local needrex = sz == \"b\" and i > 3\r\n    local iname = format(\"@%s%x%s\", sz, i, needrex and \"R\" or \"\")\r\n    if needrex then map_reg_needrex[iname] = true end\r\n    local name\r\n    if sz == \"o\" then name = format(\"xmm%d\", i)\r\n    elseif sz == \"f\" then name = format(\"st%d\", i)\r\n    else name = format(\"r%d%s\", i, sz == addrsize and \"\" or sz) end\r\n    map_archdef[name] = iname\r\n    if not map_reg_rev[iname] then\r\n      reg_list[#reg_list+1] = iname\r\n      map_reg_rev[iname] = name\r\n      map_reg_num[iname] = i\r\n      map_reg_opsize[iname] = sz\r\n      if sz == addrsize or sz == \"d\" then\r\n\tmap_reg_valid_base[iname] = true\r\n\tmap_reg_valid_index[iname] = true\r\n      end\r\n    end\r\n  end\r\n  reg_list[#reg_list+1] = \"\"\r\nend\r\n\r\n-- Integer registers (qword, dword, word and byte sized).\r\nif x64 then\r\n  mkrmap(\"q\", \"Rq\", {\"rax\", \"rcx\", \"rdx\", \"rbx\", \"rsp\", \"rbp\", \"rsi\", \"rdi\"})\r\nend\r\nmkrmap(\"d\", \"Rd\", {\"eax\", \"ecx\", \"edx\", \"ebx\", \"esp\", \"ebp\", \"esi\", \"edi\"})\r\nmkrmap(\"w\", \"Rw\", {\"ax\", \"cx\", \"dx\", \"bx\", \"sp\", \"bp\", \"si\", \"di\"})\r\nmkrmap(\"b\", \"Rb\", {\"al\", \"cl\", \"dl\", \"bl\", \"ah\", \"ch\", \"dh\", \"bh\"})\r\nmap_reg_valid_index[map_archdef.esp] = false\r\nif x64 then map_reg_valid_index[map_archdef.rsp] = false end\r\nmap_archdef[\"Ra\"] = \"@\"..addrsize\r\n\r\n-- FP registers (internally tword sized, but use \"f\" as operand size).\r\nmkrmap(\"f\", \"Rf\")\r\n\r\n-- SSE registers (oword sized, but qword and dword accessible).\r\nmkrmap(\"o\", \"xmm\")\r\n\r\n-- Operand size prefixes to codes.\r\nlocal map_opsize = {\r\n  byte = \"b\", word = \"w\", dword = \"d\", qword = \"q\", oword = \"o\", tword = \"t\",\r\n  aword = addrsize,\r\n}\r\n\r\n-- Operand size code to number.\r\nlocal map_opsizenum = {\r\n  b = 1, w = 2, d = 4, q = 8, o = 16, t = 10,\r\n}\r\n\r\n-- Operand size code to name.\r\nlocal map_opsizename = {\r\n  b = \"byte\", w = \"word\", d = \"dword\", q = \"qword\", o = \"oword\", t = \"tword\",\r\n  f = \"fpword\",\r\n}\r\n\r\n-- Valid index register scale factors.\r\nlocal map_xsc = {\r\n  [\"1\"] = 0, [\"2\"] = 1, [\"4\"] = 2, [\"8\"] = 3,\r\n}\r\n\r\n-- Condition codes.\r\nlocal map_cc = {\r\n  o = 0, no = 1, b = 2, nb = 3, e = 4, ne = 5, be = 6, nbe = 7,\r\n  s = 8, ns = 9, p = 10, np = 11, l = 12, nl = 13, le = 14, nle = 15,\r\n  c = 2, nae = 2, nc = 3, ae = 3, z = 4, nz = 5, na = 6, a = 7,\r\n  pe = 10, po = 11, nge = 12, ge = 13, ng = 14, g = 15,\r\n}\r\n\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  return gsub(s, \"@%w+\", map_reg_rev)\r\nend\r\n\r\n-- Dump register names and numbers\r\nlocal function dumpregs(out)\r\n  out:write(\"Register names, sizes and internal numbers:\\n\")\r\n  for _,reg in ipairs(reg_list) do\r\n    if reg == \"\" then\r\n      out:write(\"\\n\")\r\n    else\r\n      local name = map_reg_rev[reg]\r\n      local num = map_reg_num[reg]\r\n      local opsize = map_opsizename[map_reg_opsize[reg]]\r\n      out:write(format(\"  %-5s %-8s %s\\n\", name, opsize,\r\n\t\t       num < 0 and \"(variable)\" or num))\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Put action for label arg (IMM_LG, IMM_PC, REL_LG, REL_PC).\r\nlocal function wputlabel(aprefix, imm, num)\r\n  if type(imm) == \"number\" then\r\n    if imm < 0 then\r\n      waction(\"EXTERN\")\r\n      wputxb(aprefix == \"IMM_\" and 0 or 1)\r\n      imm = -imm-1\r\n    else\r\n      waction(aprefix..\"LG\", nil, num);\r\n    end\r\n    wputxb(imm)\r\n  else\r\n    waction(aprefix..\"PC\", imm, num)\r\n  end\r\nend\r\n\r\n-- Put signed byte or arg.\r\nlocal function wputsbarg(n)\r\n  if type(n) == \"number\" then\r\n    if n < -128 or n > 127 then\r\n      werror(\"signed immediate byte out of range\")\r\n    end\r\n    if n < 0 then n = n + 256 end\r\n    wputb(n)\r\n  else waction(\"IMM_S\", n) end\r\nend\r\n\r\n-- Put unsigned byte or arg.\r\nlocal function wputbarg(n)\r\n  if type(n) == \"number\" then\r\n    if n < 0 or n > 255 then\r\n      werror(\"unsigned immediate byte out of range\")\r\n    end\r\n    wputb(n)\r\n  else waction(\"IMM_B\", n) end\r\nend\r\n\r\n-- Put unsigned word or arg.\r\nlocal function wputwarg(n)\r\n  if type(n) == \"number\" then\r\n    if shr(n, 16) ~= 0 then\r\n      werror(\"unsigned immediate word out of range\")\r\n    end\r\n    wputb(band(n, 255)); wputb(shr(n, 8));\r\n  else waction(\"IMM_W\", n) end\r\nend\r\n\r\n-- Put signed or unsigned dword or arg.\r\nlocal function wputdarg(n)\r\n  local tn = type(n)\r\n  if tn == \"number\" then\r\n    wputb(band(n, 255))\r\n    wputb(band(shr(n, 8), 255))\r\n    wputb(band(shr(n, 16), 255))\r\n    wputb(shr(n, 24))\r\n  elseif tn == \"table\" then\r\n    wputlabel(\"IMM_\", n[1], 1)\r\n  else\r\n    waction(\"IMM_D\", n)\r\n  end\r\nend\r\n\r\n-- Put operand-size dependent number or arg (defaults to dword).\r\nlocal function wputszarg(sz, n)\r\n  if not sz or sz == \"d\" or sz == \"q\" then wputdarg(n)\r\n  elseif sz == \"w\" then wputwarg(n)\r\n  elseif sz == \"b\" then wputbarg(n)\r\n  elseif sz == \"s\" then wputsbarg(n)\r\n  else werror(\"bad operand size\") end\r\nend\r\n\r\n-- Put multi-byte opcode with operand-size dependent modifications.\r\nlocal function wputop(sz, op, rex)\r\n  local r\r\n  if rex ~= 0 and not x64 then werror(\"bad operand size\") end\r\n  if sz == \"w\" then wputb(102) end\r\n  -- Needs >32 bit numbers, but only for crc32 eax, word [ebx]\r\n  if op >= 4294967296 then r = op%4294967296 wputb((op-r)/4294967296) op = r end\r\n  if op >= 16777216 then wputb(shr(op, 24)); op = band(op, 0xffffff) end\r\n  if op >= 65536 then\r\n    if rex ~= 0 then\r\n      local opc3 = band(op, 0xffff00)\r\n      if opc3 == 0x0f3a00 or opc3 == 0x0f3800 then\r\n\twputb(64 + band(rex, 15)); rex = 0\r\n      end\r\n    end\r\n    wputb(shr(op, 16)); op = band(op, 0xffff)\r\n  end\r\n  if op >= 256 then\r\n    local b = shr(op, 8)\r\n    if b == 15 and rex ~= 0 then wputb(64 + band(rex, 15)); rex = 0 end\r\n    wputb(b)\r\n    op = band(op, 255)\r\n  end\r\n  if rex ~= 0 then wputb(64 + band(rex, 15)) end\r\n  if sz == \"b\" then op = op - 1 end\r\n  wputb(op)\r\nend\r\n\r\n-- Put ModRM or SIB formatted byte.\r\nlocal function wputmodrm(m, s, rm, vs, vrm)\r\n  assert(m < 4 and s < 16 and rm < 16, \"bad modrm operands\")\r\n  wputb(shl(m, 6) + shl(band(s, 7), 3) + band(rm, 7))\r\nend\r\n\r\n-- Put ModRM/SIB plus optional displacement.\r\nlocal function wputmrmsib(t, imark, s, vsreg)\r\n  local vreg, vxreg\r\n  local reg, xreg = t.reg, t.xreg\r\n  if reg and reg < 0 then reg = 0; vreg = t.vreg end\r\n  if xreg and xreg < 0 then xreg = 0; vxreg = t.vxreg end\r\n  if s < 0 then s = 0 end\r\n\r\n  -- Register mode.\r\n  if sub(t.mode, 1, 1) == \"r\" then\r\n    wputmodrm(3, s, reg)\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(0) end\r\n    return\r\n  end\r\n\r\n  local disp = t.disp\r\n  local tdisp = type(disp)\r\n  -- No base register?\r\n  if not reg then\r\n    local riprel = false\r\n    if xreg then\r\n      -- Indexed mode with index register only.\r\n      -- [xreg*xsc+disp] -> (0, s, esp) (xsc, xreg, ebp)\r\n      wputmodrm(0, s, 4)\r\n      if imark == \"I\" then waction(\"MARK\") end\r\n      if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n      wputmodrm(t.xsc, xreg, 5)\r\n      if vxreg then waction(\"VREG\", vxreg); wputxb(3) end\r\n    else\r\n      -- Pure 32 bit displacement.\r\n      if x64 and tdisp ~= \"table\" then\r\n\twputmodrm(0, s, 4) -- [disp] -> (0, s, esp) (0, esp, ebp)\r\n\tif imark == \"I\" then waction(\"MARK\") end\r\n\twputmodrm(0, 4, 5)\r\n      else\r\n\triprel = x64\r\n\twputmodrm(0, s, 5) -- [disp|rip-label] -> (0, s, ebp)\r\n\tif imark == \"I\" then waction(\"MARK\") end\r\n      end\r\n      if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    end\r\n    if riprel then -- Emit rip-relative displacement.\r\n      if match(\"UWSiI\", imark) then\r\n\twerror(\"NYI: rip-relative displacement followed by immediate\")\r\n      end\r\n      -- The previous byte in the action buffer cannot be 0xe9 or 0x80-0x8f.\r\n      wputlabel(\"REL_\", disp[1], 2)\r\n    else\r\n      wputdarg(disp)\r\n    end\r\n    return\r\n  end\r\n\r\n  local m\r\n  if tdisp == \"number\" then -- Check displacement size at assembly time.\r\n    if disp == 0 and band(reg, 7) ~= 5 then -- [ebp] -> [ebp+0] (in SIB, too)\r\n      if not vreg then m = 0 end -- Force DISP to allow [Rd(5)] -> [ebp+0]\r\n    elseif disp >= -128 and disp <= 127 then m = 1\r\n    else m = 2 end\r\n  elseif tdisp == \"table\" then\r\n    m = 2\r\n  end\r\n\r\n  -- Index register present or esp as base register: need SIB encoding.\r\n  if xreg or band(reg, 7) == 4 then\r\n    wputmodrm(m or 2, s, 4) -- ModRM.\r\n    if m == nil or imark == \"I\" then waction(\"MARK\") end\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    wputmodrm(t.xsc or 0, xreg or 4, reg) -- SIB.\r\n    if vxreg then waction(\"VREG\", vxreg); wputxb(3) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(1) end\r\n  else\r\n    wputmodrm(m or 2, s, reg) -- ModRM.\r\n    if (imark == \"I\" and (m == 1 or m == 2)) or\r\n       (m == nil and (vsreg or vreg)) then waction(\"MARK\") end\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(1) end\r\n  end\r\n\r\n  -- Put displacement.\r\n  if m == 1 then wputsbarg(disp)\r\n  elseif m == 2 then wputdarg(disp)\r\n  elseif m == nil then waction(\"DISP\", disp) end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Return human-readable operand mode string.\r\nlocal function opmodestr(op, args)\r\n  local m = {}\r\n  for i=1,#args do\r\n    local a = args[i]\r\n    m[#m+1] = sub(a.mode, 1, 1)..(a.opsize or \"?\")\r\n  end\r\n  return op..\" \"..concat(m, \",\")\r\nend\r\n\r\n-- Convert number to valid integer or nil.\r\nlocal function toint(expr)\r\n  local n = tonumber(expr)\r\n  if n then\r\n    if n % 1 ~= 0 or n < -2147483648 or n > 4294967295 then\r\n      werror(\"bad integer number `\"..expr..\"'\")\r\n    end\r\n    return n\r\n  end\r\nend\r\n\r\n-- Parse immediate expression.\r\nlocal function immexpr(expr)\r\n  -- &expr (pointer)\r\n  if sub(expr, 1, 1) == \"&\" then\r\n    return \"iPJ\", format(\"(ptrdiff_t)(%s)\", sub(expr,2))\r\n  end\r\n\r\n  local prefix = sub(expr, 1, 2)\r\n  -- =>expr (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"iJ\", sub(expr, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"iJ\", map_global[sub(expr, 3)]\r\n  end\r\n\r\n  -- [<>][1-9] (local label reference)\r\n  local dir, lnum = match(expr, \"^([<>])([1-9])$\")\r\n  if dir then -- Fwd: 247-255, Bkwd: 1-9.\r\n    return \"iJ\", lnum + (dir == \">\" and 246 or 0)\r\n  end\r\n\r\n  local extname = match(expr, \"^extern%s+(%S+)$\")\r\n  if extname then\r\n    return \"iJ\", map_extern[extname]\r\n  end\r\n\r\n  -- expr (interpreted as immediate)\r\n  return \"iI\", expr\r\nend\r\n\r\n-- Parse displacement expression: +-num, +-expr, +-opsize*num\r\nlocal function dispexpr(expr)\r\n  local disp = expr == \"\" and 0 or toint(expr)\r\n  if disp then return disp end\r\n  local c, dispt = match(expr, \"^([+-])%s*(.+)$\")\r\n  if c == \"+\" then\r\n    expr = dispt\r\n  elseif not c then\r\n    werror(\"bad displacement expression `\"..expr..\"'\")\r\n  end\r\n  local opsize, tailops = match(dispt, \"^(%w+)%s*%*%s*(.+)$\")\r\n  local ops, imm = map_opsize[opsize], toint(tailops)\r\n  if ops and imm then\r\n    if c == \"-\" then imm = -imm end\r\n    return imm*map_opsizenum[ops]\r\n  end\r\n  local mode, iexpr = immexpr(dispt)\r\n  if mode == \"iJ\" then\r\n    if c == \"-\" then werror(\"cannot invert label reference\") end\r\n    return { iexpr }\r\n  end\r\n  return expr -- Need to return original signed expression.\r\nend\r\n\r\n-- Parse register or type expression.\r\nlocal function rtexpr(expr)\r\n  if not expr then return end\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(@[%w_]+)$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    local rnum = map_reg_num[reg]\r\n    if not rnum then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    if not map_reg_valid_base[reg] then\r\n      werror(\"bad base register override `\"..(map_reg_rev[reg] or reg)..\"'\")\r\n    end\r\n    return reg, rnum, tp\r\n  end\r\n  return expr, map_reg_num[expr]\r\nend\r\n\r\n-- Parse operand and return { mode, opsize, reg, xreg, xsc, disp, imm }.\r\nlocal function parseoperand(param)\r\n  local t = {}\r\n\r\n  local expr = param\r\n  local opsize, tailops = match(param, \"^(%w+)%s*(.+)$\")\r\n  if opsize then\r\n    t.opsize = map_opsize[opsize]\r\n    if t.opsize then expr = tailops end\r\n  end\r\n\r\n  local br = match(expr, \"^%[%s*(.-)%s*%]$\")\r\n  repeat\r\n    if br then\r\n      t.mode = \"xm\"\r\n\r\n      -- [disp]\r\n      t.disp = toint(br)\r\n      if t.disp then\r\n\tt.mode = x64 and \"xm\" or \"xmO\"\r\n\tbreak\r\n      end\r\n\r\n      -- [reg...]\r\n      local tp\r\n      local reg, tailr = match(br, \"^([@%w_:]+)%s*(.*)$\")\r\n      reg, t.reg, tp = rtexpr(reg)\r\n      if not t.reg then\r\n\t-- [expr]\r\n\tt.mode = x64 and \"xm\" or \"xmO\"\r\n\tt.disp = dispexpr(\"+\"..br)\r\n\tbreak\r\n      end\r\n\r\n      if t.reg == -1 then\r\n\tt.vreg, tailr = match(tailr, \"^(%b())(.*)$\")\r\n\tif not t.vreg then werror(\"bad variable register expression\") end\r\n      end\r\n\r\n      -- [xreg*xsc] or [xreg*xsc+-disp] or [xreg*xsc+-expr]\r\n      local xsc, tailsc = match(tailr, \"^%*%s*([1248])%s*(.*)$\")\r\n      if xsc then\r\n\tif not map_reg_valid_index[reg] then\r\n\t  werror(\"bad index register `\"..map_reg_rev[reg]..\"'\")\r\n\tend\r\n\tt.xsc = map_xsc[xsc]\r\n\tt.xreg = t.reg\r\n\tt.vxreg = t.vreg\r\n\tt.reg = nil\r\n\tt.vreg = nil\r\n\tt.disp = dispexpr(tailsc)\r\n\tbreak\r\n      end\r\n      if not map_reg_valid_base[reg] then\r\n\twerror(\"bad base register `\"..map_reg_rev[reg]..\"'\")\r\n      end\r\n\r\n      -- [reg] or [reg+-disp]\r\n      t.disp = toint(tailr) or (tailr == \"\" and 0)\r\n      if t.disp then break end\r\n\r\n      -- [reg+xreg...]\r\n      local xreg, tailx = match(tailr, \"^+%s*([@%w_:]+)%s*(.*)$\")\r\n      xreg, t.xreg, tp = rtexpr(xreg)\r\n      if not t.xreg then\r\n\t-- [reg+-expr]\r\n\tt.disp = dispexpr(tailr)\r\n\tbreak\r\n      end\r\n      if not map_reg_valid_index[xreg] then\r\n\twerror(\"bad index register `\"..map_reg_rev[xreg]..\"'\")\r\n      end\r\n\r\n      if t.xreg == -1 then\r\n\tt.vxreg, tailx = match(tailx, \"^(%b())(.*)$\")\r\n\tif not t.vxreg then werror(\"bad variable register expression\") end\r\n      end\r\n\r\n      -- [reg+xreg*xsc...]\r\n      local xsc, tailsc = match(tailx, \"^%*%s*([1248])%s*(.*)$\")\r\n      if xsc then\r\n\tt.xsc = map_xsc[xsc]\r\n\ttailx = tailsc\r\n      end\r\n\r\n      -- [...] or [...+-disp] or [...+-expr]\r\n      t.disp = dispexpr(tailx)\r\n    else\r\n      -- imm or opsize*imm\r\n      local imm = toint(expr)\r\n      if not imm and sub(expr, 1, 1) == \"*\" and t.opsize then\r\n\timm = toint(sub(expr, 2))\r\n\tif imm then\r\n\t  imm = imm * map_opsizenum[t.opsize]\r\n\t  t.opsize = nil\r\n\tend\r\n      end\r\n      if imm then\r\n\tif t.opsize then werror(\"bad operand size override\") end\r\n\tlocal m = \"i\"\r\n\tif imm == 1 then m = m..\"1\" end\r\n\tif imm >= 4294967168 and imm <= 4294967295 then imm = imm-4294967296 end\r\n\tif imm >= -128 and imm <= 127 then m = m..\"S\" end\r\n\tt.imm = imm\r\n\tt.mode = m\r\n\tbreak\r\n      end\r\n\r\n      local tp\r\n      local reg, tailr = match(expr, \"^([@%w_:]+)%s*(.*)$\")\r\n      reg, t.reg, tp = rtexpr(reg)\r\n      if t.reg then\r\n\tif t.reg == -1 then\r\n\t  t.vreg, tailr = match(tailr, \"^(%b())(.*)$\")\r\n\t  if not t.vreg then werror(\"bad variable register expression\") end\r\n\tend\r\n\t-- reg\r\n\tif tailr == \"\" then\r\n\t  if t.opsize then werror(\"bad operand size override\") end\r\n\t  t.opsize = map_reg_opsize[reg]\r\n\t  if t.opsize == \"f\" then\r\n\t    t.mode = t.reg == 0 and \"fF\" or \"f\"\r\n\t  else\r\n\t    if reg == \"@w4\" or (x64 and reg == \"@d4\") then\r\n\t      wwarn(\"bad idea, try again with `\"..(x64 and \"rsp'\" or \"esp'\"))\r\n\t    end\r\n\t    t.mode = t.reg == 0 and \"rmR\" or (reg == \"@b1\" and \"rmC\" or \"rm\")\r\n\t  end\r\n\t  t.needrex = map_reg_needrex[reg]\r\n\t  break\r\n\tend\r\n\r\n\t-- type[idx], type[idx].field, type->field -> [reg+offset_expr]\r\n\tif not tp then werror(\"bad operand `\"..param..\"'\") end\r\n\tt.mode = \"xm\"\r\n\tt.disp = format(tp.ctypefmt, tailr)\r\n      else\r\n\tt.mode, t.imm = immexpr(expr)\r\n\tif sub(t.mode, -1) == \"J\" then\r\n\t  if t.opsize and t.opsize ~= addrsize then\r\n\t    werror(\"bad operand size override\")\r\n\t  end\r\n\t  t.opsize = addrsize\r\n\tend\r\n      end\r\n    end\r\n  until true\r\n  return t\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n-- x86 Template String Description\r\n-- ===============================\r\n--\r\n-- Each template string is a list of [match:]pattern pairs,\r\n-- separated by \"|\". The first match wins. No match means a\r\n-- bad or unsupported combination of operand modes or sizes.\r\n--\r\n-- The match part and the \":\" is omitted if the operation has\r\n-- no operands. Otherwise the first N characters are matched\r\n-- against the mode strings of each of the N operands.\r\n--\r\n-- The mode string for each operand type is (see parseoperand()):\r\n--   Integer register: \"rm\", +\"R\" for eax, ax, al, +\"C\" for cl\r\n--   FP register:      \"f\",  +\"F\" for st0\r\n--   Index operand:    \"xm\", +\"O\" for [disp] (pure offset)\r\n--   Immediate:        \"i\",  +\"S\" for signed 8 bit, +\"1\" for 1,\r\n--                     +\"I\" for arg, +\"P\" for pointer\r\n--   Any:              +\"J\" for valid jump targets\r\n--\r\n-- So a match character \"m\" (mixed) matches both an integer register\r\n-- and an index operand (to be encoded with the ModRM/SIB scheme).\r\n-- But \"r\" matches only a register and \"x\" only an index operand\r\n-- (e.g. for FP memory access operations).\r\n--\r\n-- The operand size match string starts right after the mode match\r\n-- characters and ends before the \":\". \"dwb\" or \"qdwb\" is assumed, if empty.\r\n-- The effective data size of the operation is matched against this list.\r\n--\r\n-- If only the regular \"b\", \"w\", \"d\", \"q\", \"t\" operand sizes are\r\n-- present, then all operands must be the same size. Unspecified sizes\r\n-- are ignored, but at least one operand must have a size or the pattern\r\n-- won't match (use the \"byte\", \"word\", \"dword\", \"qword\", \"tword\"\r\n-- operand size overrides. E.g.: mov dword [eax], 1).\r\n--\r\n-- If the list has a \"1\" or \"2\" prefix, the operand size is taken\r\n-- from the respective operand and any other operand sizes are ignored.\r\n-- If the list contains only \".\", all operand sizes are ignored.\r\n-- If the list has a \"/\" prefix, the concatenated (mixed) operand sizes\r\n-- are compared to the match.\r\n--\r\n-- E.g. \"rrdw\" matches for either two dword registers or two word\r\n-- registers. \"Fx2dq\" matches an st0 operand plus an index operand\r\n-- pointing to a dword (float) or qword (double).\r\n--\r\n-- Every character after the \":\" is part of the pattern string:\r\n--   Hex chars are accumulated to form the opcode (left to right).\r\n--   \"n\"       disables the standard opcode mods\r\n--             (otherwise: -1 for \"b\", o16 prefix for \"w\", rex.w for \"q\")\r\n--   \"X\"       Force REX.W.\r\n--   \"r\"/\"R\"   adds the reg. number from the 1st/2nd operand to the opcode.\r\n--   \"m\"/\"M\"   generates ModRM/SIB from the 1st/2nd operand.\r\n--             The spare 3 bits are either filled with the last hex digit or\r\n--             the result from a previous \"r\"/\"R\". The opcode is restored.\r\n--\r\n-- All of the following characters force a flush of the opcode:\r\n--   \"o\"/\"O\"   stores a pure 32 bit disp (offset) from the 1st/2nd operand.\r\n--   \"S\"       stores a signed 8 bit immediate from the last operand.\r\n--   \"U\"       stores an unsigned 8 bit immediate from the last operand.\r\n--   \"W\"       stores an unsigned 16 bit immediate from the last operand.\r\n--   \"i\"       stores an operand sized immediate from the last operand.\r\n--   \"I\"       dito, but generates an action code to optionally modify\r\n--             the opcode (+2) for a signed 8 bit immediate.\r\n--   \"J\"       generates one of the REL action codes from the last operand.\r\n--\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for x86 instructions. Ordered by first opcode byte.\r\n-- Unimplemented opcodes (deliberate omissions) are marked with *.\r\nlocal map_op = {\r\n  -- 00-05: add...\r\n  -- 06: *push es\r\n  -- 07: *pop es\r\n  -- 08-0D: or...\r\n  -- 0E: *push cs\r\n  -- 0F: two byte opcode prefix\r\n  -- 10-15: adc...\r\n  -- 16: *push ss\r\n  -- 17: *pop ss\r\n  -- 18-1D: sbb...\r\n  -- 1E: *push ds\r\n  -- 1F: *pop ds\r\n  -- 20-25: and...\r\n  es_0 =\t\"26\",\r\n  -- 27: *daa\r\n  -- 28-2D: sub...\r\n  cs_0 =\t\"2E\",\r\n  -- 2F: *das\r\n  -- 30-35: xor...\r\n  ss_0 =\t\"36\",\r\n  -- 37: *aaa\r\n  -- 38-3D: cmp...\r\n  ds_0 =\t\"3E\",\r\n  -- 3F: *aas\r\n  inc_1 =\tx64 and \"m:FF0m\" or \"rdw:40r|m:FF0m\",\r\n  dec_1 =\tx64 and \"m:FF1m\" or \"rdw:48r|m:FF1m\",\r\n  push_1 =\t(x64 and \"rq:n50r|rw:50r|mq:nFF6m|mw:FF6m\" or\r\n\t\t\t \"rdw:50r|mdw:FF6m\")..\"|S.:6AS|ib:n6Ai|i.:68i\",\r\n  pop_1 =\tx64 and \"rq:n58r|rw:58r|mq:n8F0m|mw:8F0m\" or \"rdw:58r|mdw:8F0m\",\r\n  -- 60: *pusha, *pushad, *pushaw\r\n  -- 61: *popa, *popad, *popaw\r\n  -- 62: *bound rdw,x\r\n  -- 63: x86: *arpl mw,rw\r\n  movsxd_2 =\tx64 and \"rm/qd:63rM\",\r\n  fs_0 =\t\"64\",\r\n  gs_0 =\t\"65\",\r\n  o16_0 =\t\"66\",\r\n  a16_0 =\tnot x64 and \"67\" or nil,\r\n  a32_0 =\tx64 and \"67\",\r\n  -- 68: push idw\r\n  -- 69: imul rdw,mdw,idw\r\n  -- 6A: push ib\r\n  -- 6B: imul rdw,mdw,S\r\n  -- 6C: *insb\r\n  -- 6D: *insd, *insw\r\n  -- 6E: *outsb\r\n  -- 6F: *outsd, *outsw\r\n  -- 70-7F: jcc lb\r\n  -- 80: add... mb,i\r\n  -- 81: add... mdw,i\r\n  -- 82: *undefined\r\n  -- 83: add... mdw,S\r\n  test_2 =\t\"mr:85Rm|rm:85rM|Ri:A9ri|mi:F70mi\",\r\n  -- 86: xchg rb,mb\r\n  -- 87: xchg rdw,mdw\r\n  -- 88: mov mb,r\r\n  -- 89: mov mdw,r\r\n  -- 8A: mov r,mb\r\n  -- 8B: mov r,mdw\r\n  -- 8C: *mov mdw,seg\r\n  lea_2 =\t\"rx1dq:8DrM\",\r\n  -- 8E: *mov seg,mdw\r\n  -- 8F: pop mdw\r\n  nop_0 =\t\"90\",\r\n  xchg_2 =\t\"Rrqdw:90R|rRqdw:90r|rm:87rM|mr:87Rm\",\r\n  cbw_0 =\t\"6698\",\r\n  cwde_0 =\t\"98\",\r\n  cdqe_0 =\t\"4898\",\r\n  cwd_0 =\t\"6699\",\r\n  cdq_0 =\t\"99\",\r\n  cqo_0 =\t\"4899\",\r\n  -- 9A: *call iw:idw\r\n  wait_0 =\t\"9B\",\r\n  fwait_0 =\t\"9B\",\r\n  pushf_0 =\t\"9C\",\r\n  pushfd_0 =\tnot x64 and \"9C\",\r\n  pushfq_0 =\tx64 and \"9C\",\r\n  popf_0 =\t\"9D\",\r\n  popfd_0 =\tnot x64 and \"9D\",\r\n  popfq_0 =\tx64 and \"9D\",\r\n  sahf_0 =\t\"9E\",\r\n  lahf_0 =\t\"9F\",\r\n  mov_2 =\t\"OR:A3o|RO:A1O|mr:89Rm|rm:8BrM|rib:nB0ri|ridw:B8ri|mi:C70mi\",\r\n  movsb_0 =\t\"A4\",\r\n  movsw_0 =\t\"66A5\",\r\n  movsd_0 =\t\"A5\",\r\n  cmpsb_0 =\t\"A6\",\r\n  cmpsw_0 =\t\"66A7\",\r\n  cmpsd_0 =\t\"A7\",\r\n  -- A8: test Rb,i\r\n  -- A9: test Rdw,i\r\n  stosb_0 =\t\"AA\",\r\n  stosw_0 =\t\"66AB\",\r\n  stosd_0 =\t\"AB\",\r\n  lodsb_0 =\t\"AC\",\r\n  lodsw_0 =\t\"66AD\",\r\n  lodsd_0 =\t\"AD\",\r\n  scasb_0 =\t\"AE\",\r\n  scasw_0 =\t\"66AF\",\r\n  scasd_0 =\t\"AF\",\r\n  -- B0-B7: mov rb,i\r\n  -- B8-BF: mov rdw,i\r\n  -- C0: rol... mb,i\r\n  -- C1: rol... mdw,i\r\n  ret_1 =\t\"i.:nC2W\",\r\n  ret_0 =\t\"C3\",\r\n  -- C4: *les rdw,mq\r\n  -- C5: *lds rdw,mq\r\n  -- C6: mov mb,i\r\n  -- C7: mov mdw,i\r\n  -- C8: *enter iw,ib\r\n  leave_0 =\t\"C9\",\r\n  -- CA: *retf iw\r\n  -- CB: *retf\r\n  int3_0 =\t\"CC\",\r\n  int_1 =\t\"i.:nCDU\",\r\n  into_0 =\t\"CE\",\r\n  -- CF: *iret\r\n  -- D0: rol... mb,1\r\n  -- D1: rol... mdw,1\r\n  -- D2: rol... mb,cl\r\n  -- D3: rol... mb,cl\r\n  -- D4: *aam ib\r\n  -- D5: *aad ib\r\n  -- D6: *salc\r\n  -- D7: *xlat\r\n  -- D8-DF: floating point ops\r\n  -- E0: *loopne\r\n  -- E1: *loope\r\n  -- E2: *loop\r\n  -- E3: *jcxz, *jecxz\r\n  -- E4: *in Rb,ib\r\n  -- E5: *in Rdw,ib\r\n  -- E6: *out ib,Rb\r\n  -- E7: *out ib,Rdw\r\n  call_1 =\tx64 and \"mq:nFF2m|J.:E8nJ\" or \"md:FF2m|J.:E8J\",\r\n  jmp_1 =\tx64 and \"mq:nFF4m|J.:E9nJ\" or \"md:FF4m|J.:E9J\", -- short: EB\r\n  -- EA: *jmp iw:idw\r\n  -- EB: jmp ib\r\n  -- EC: *in Rb,dx\r\n  -- ED: *in Rdw,dx\r\n  -- EE: *out dx,Rb\r\n  -- EF: *out dx,Rdw\r\n  lock_0 =\t\"F0\",\r\n  int1_0 =\t\"F1\",\r\n  repne_0 =\t\"F2\",\r\n  repnz_0 =\t\"F2\",\r\n  rep_0 =\t\"F3\",\r\n  repe_0 =\t\"F3\",\r\n  repz_0 =\t\"F3\",\r\n  -- F4: *hlt\r\n  cmc_0 =\t\"F5\",\r\n  -- F6: test... mb,i; div... mb\r\n  -- F7: test... mdw,i; div... mdw\r\n  clc_0 =\t\"F8\",\r\n  stc_0 =\t\"F9\",\r\n  -- FA: *cli\r\n  cld_0 =\t\"FC\",\r\n  std_0 =\t\"FD\",\r\n  -- FE: inc... mb\r\n  -- FF: inc... mdw\r\n\r\n  -- misc ops\r\n  not_1 =\t\"m:F72m\",\r\n  neg_1 =\t\"m:F73m\",\r\n  mul_1 =\t\"m:F74m\",\r\n  imul_1 =\t\"m:F75m\",\r\n  div_1 =\t\"m:F76m\",\r\n  idiv_1 =\t\"m:F77m\",\r\n\r\n  imul_2 =\t\"rmqdw:0FAFrM|rIqdw:69rmI|rSqdw:6BrmS|riqdw:69rmi\",\r\n  imul_3 =\t\"rmIqdw:69rMI|rmSqdw:6BrMS|rmiqdw:69rMi\",\r\n\r\n  movzx_2 =\t\"rm/db:0FB6rM|rm/qb:|rm/wb:0FB6rM|rm/dw:0FB7rM|rm/qw:\",\r\n  movsx_2 =\t\"rm/db:0FBErM|rm/qb:|rm/wb:0FBErM|rm/dw:0FBFrM|rm/qw:\",\r\n\r\n  bswap_1 =\t\"rqd:0FC8r\",\r\n  bsf_2 =\t\"rmqdw:0FBCrM\",\r\n  bsr_2 =\t\"rmqdw:0FBDrM\",\r\n  bt_2 =\t\"mrqdw:0FA3Rm|miqdw:0FBA4mU\",\r\n  btc_2 =\t\"mrqdw:0FBBRm|miqdw:0FBA7mU\",\r\n  btr_2 =\t\"mrqdw:0FB3Rm|miqdw:0FBA6mU\",\r\n  bts_2 =\t\"mrqdw:0FABRm|miqdw:0FBA5mU\",\r\n\r\n  shld_3 =\t\"mriqdw:0FA4RmU|mrCqdw:0FA5Rm\",\r\n  shrd_3 =\t\"mriqdw:0FACRmU|mrCqdw:0FADRm\",\r\n\r\n  rdtsc_0 =\t\"0F31\", -- P1+\r\n  cpuid_0 =\t\"0FA2\", -- P1+\r\n\r\n  -- floating point ops\r\n  fst_1 =\t\"ff:DDD0r|xd:D92m|xq:nDD2m\",\r\n  fstp_1 =\t\"ff:DDD8r|xd:D93m|xq:nDD3m|xt:DB7m\",\r\n  fld_1 =\t\"ff:D9C0r|xd:D90m|xq:nDD0m|xt:DB5m\",\r\n\r\n  fpop_0 =\t\"DDD8\", -- Alias for fstp st0.\r\n\r\n  fist_1 =\t\"xw:nDF2m|xd:DB2m\",\r\n  fistp_1 =\t\"xw:nDF3m|xd:DB3m|xq:nDF7m\",\r\n  fild_1 =\t\"xw:nDF0m|xd:DB0m|xq:nDF5m\",\r\n\r\n  fxch_0 =\t\"D9C9\",\r\n  fxch_1 =\t\"ff:D9C8r\",\r\n  fxch_2 =\t\"fFf:D9C8r|Fff:D9C8R\",\r\n\r\n  fucom_1 =\t\"ff:DDE0r\",\r\n  fucom_2 =\t\"Fff:DDE0R\",\r\n  fucomp_1 =\t\"ff:DDE8r\",\r\n  fucomp_2 =\t\"Fff:DDE8R\",\r\n  fucomi_1 =\t\"ff:DBE8r\", -- P6+\r\n  fucomi_2 =\t\"Fff:DBE8R\", -- P6+\r\n  fucomip_1 =\t\"ff:DFE8r\", -- P6+\r\n  fucomip_2 =\t\"Fff:DFE8R\", -- P6+\r\n  fcomi_1 =\t\"ff:DBF0r\", -- P6+\r\n  fcomi_2 =\t\"Fff:DBF0R\", -- P6+\r\n  fcomip_1 =\t\"ff:DFF0r\", -- P6+\r\n  fcomip_2 =\t\"Fff:DFF0R\", -- P6+\r\n  fucompp_0 =\t\"DAE9\",\r\n  fcompp_0 =\t\"DED9\",\r\n\r\n  fldenv_1 =\t\"x.:D94m\",\r\n  fnstenv_1 =\t\"x.:D96m\",\r\n  fstenv_1 =\t\"x.:9BD96m\",\r\n  fldcw_1 =\t\"xw:nD95m\",\r\n  fstcw_1 =\t\"xw:n9BD97m\",\r\n  fnstcw_1 =\t\"xw:nD97m\",\r\n  fstsw_1 =\t\"Rw:n9BDFE0|xw:n9BDD7m\",\r\n  fnstsw_1 =\t\"Rw:nDFE0|xw:nDD7m\",\r\n  fclex_0 =\t\"9BDBE2\",\r\n  fnclex_0 =\t\"DBE2\",\r\n\r\n  fnop_0 =\t\"D9D0\",\r\n  -- D9D1-D9DF: unassigned\r\n\r\n  fchs_0 =\t\"D9E0\",\r\n  fabs_0 =\t\"D9E1\",\r\n  -- D9E2: unassigned\r\n  -- D9E3: unassigned\r\n  ftst_0 =\t\"D9E4\",\r\n  fxam_0 =\t\"D9E5\",\r\n  -- D9E6: unassigned\r\n  -- D9E7: unassigned\r\n  fld1_0 =\t\"D9E8\",\r\n  fldl2t_0 =\t\"D9E9\",\r\n  fldl2e_0 =\t\"D9EA\",\r\n  fldpi_0 =\t\"D9EB\",\r\n  fldlg2_0 =\t\"D9EC\",\r\n  fldln2_0 =\t\"D9ED\",\r\n  fldz_0 =\t\"D9EE\",\r\n  -- D9EF: unassigned\r\n\r\n  f2xm1_0 =\t\"D9F0\",\r\n  fyl2x_0 =\t\"D9F1\",\r\n  fptan_0 =\t\"D9F2\",\r\n  fpatan_0 =\t\"D9F3\",\r\n  fxtract_0 =\t\"D9F4\",\r\n  fprem1_0 =\t\"D9F5\",\r\n  fdecstp_0 =\t\"D9F6\",\r\n  fincstp_0 =\t\"D9F7\",\r\n  fprem_0 =\t\"D9F8\",\r\n  fyl2xp1_0 =\t\"D9F9\",\r\n  fsqrt_0 =\t\"D9FA\",\r\n  fsincos_0 =\t\"D9FB\",\r\n  frndint_0 =\t\"D9FC\",\r\n  fscale_0 =\t\"D9FD\",\r\n  fsin_0 =\t\"D9FE\",\r\n  fcos_0 =\t\"D9FF\",\r\n\r\n  -- SSE, SSE2\r\n  andnpd_2 =\t\"rmo:660F55rM\",\r\n  andnps_2 =\t\"rmo:0F55rM\",\r\n  andpd_2 =\t\"rmo:660F54rM\",\r\n  andps_2 =\t\"rmo:0F54rM\",\r\n  clflush_1 =\t\"x.:0FAE7m\",\r\n  cmppd_3 =\t\"rmio:660FC2rMU\",\r\n  cmpps_3 =\t\"rmio:0FC2rMU\",\r\n  cmpsd_3 =\t\"rrio:F20FC2rMU|rxi/oq:\",\r\n  cmpss_3 =\t\"rrio:F30FC2rMU|rxi/od:\",\r\n  comisd_2 =\t\"rro:660F2FrM|rx/oq:\",\r\n  comiss_2 =\t\"rro:0F2FrM|rx/od:\",\r\n  cvtdq2pd_2 =\t\"rro:F30FE6rM|rx/oq:\",\r\n  cvtdq2ps_2 =\t\"rmo:0F5BrM\",\r\n  cvtpd2dq_2 =\t\"rmo:F20FE6rM\",\r\n  cvtpd2ps_2 =\t\"rmo:660F5ArM\",\r\n  cvtpi2pd_2 =\t\"rx/oq:660F2ArM\",\r\n  cvtpi2ps_2 =\t\"rx/oq:0F2ArM\",\r\n  cvtps2dq_2 =\t\"rmo:660F5BrM\",\r\n  cvtps2pd_2 =\t\"rro:0F5ArM|rx/oq:\",\r\n  cvtsd2si_2 =\t\"rr/do:F20F2DrM|rr/qo:|rx/dq:|rxq:\",\r\n  cvtsd2ss_2 =\t\"rro:F20F5ArM|rx/oq:\",\r\n  cvtsi2sd_2 =\t\"rm/od:F20F2ArM|rm/oq:F20F2ArXM\",\r\n  cvtsi2ss_2 =\t\"rm/od:F30F2ArM|rm/oq:F30F2ArXM\",\r\n  cvtss2sd_2 =\t\"rro:F30F5ArM|rx/od:\",\r\n  cvtss2si_2 =\t\"rr/do:F20F2CrM|rr/qo:|rxd:|rx/qd:\",\r\n  cvttpd2dq_2 =\t\"rmo:660FE6rM\",\r\n  cvttps2dq_2 =\t\"rmo:F30F5BrM\",\r\n  cvttsd2si_2 =\t\"rr/do:F20F2CrM|rr/qo:|rx/dq:|rxq:\",\r\n  cvttss2si_2 =\t\"rr/do:F30F2CrM|rr/qo:|rxd:|rx/qd:\",\r\n  fxsave_1 =\t\"x.:0FAE0m\",\r\n  fxrstor_1 =\t\"x.:0FAE1m\",\r\n  ldmxcsr_1 =\t\"xd:0FAE2m\",\r\n  lfence_0 =\t\"0FAEE8\",\r\n  maskmovdqu_2 = \"rro:660FF7rM\",\r\n  mfence_0 =\t\"0FAEF0\",\r\n  movapd_2 =\t\"rmo:660F28rM|mro:660F29Rm\",\r\n  movaps_2 =\t\"rmo:0F28rM|mro:0F29Rm\",\r\n  movd_2 =\t\"rm/od:660F6ErM|rm/oq:660F6ErXM|mr/do:660F7ERm|mr/qo:\",\r\n  movdqa_2 =\t\"rmo:660F6FrM|mro:660F7FRm\",\r\n  movdqu_2 =\t\"rmo:F30F6FrM|mro:F30F7FRm\",\r\n  movhlps_2 =\t\"rro:0F12rM\",\r\n  movhpd_2 =\t\"rx/oq:660F16rM|xr/qo:n660F17Rm\",\r\n  movhps_2 =\t\"rx/oq:0F16rM|xr/qo:n0F17Rm\",\r\n  movlhps_2 =\t\"rro:0F16rM\",\r\n  movlpd_2 =\t\"rx/oq:660F12rM|xr/qo:n660F13Rm\",\r\n  movlps_2 =\t\"rx/oq:0F12rM|xr/qo:n0F13Rm\",\r\n  movmskpd_2 =\t\"rr/do:660F50rM\",\r\n  movmskps_2 =\t\"rr/do:0F50rM\",\r\n  movntdq_2 =\t\"xro:660FE7Rm\",\r\n  movnti_2 =\t\"xrqd:0FC3Rm\",\r\n  movntpd_2 =\t\"xro:660F2BRm\",\r\n  movntps_2 =\t\"xro:0F2BRm\",\r\n  movq_2 =\t\"rro:F30F7ErM|rx/oq:|xr/qo:n660FD6Rm\",\r\n  movsd_2 =\t\"rro:F20F10rM|rx/oq:|xr/qo:nF20F11Rm\",\r\n  movss_2 =\t\"rro:F30F10rM|rx/od:|xr/do:F30F11Rm\",\r\n  movupd_2 =\t\"rmo:660F10rM|mro:660F11Rm\",\r\n  movups_2 =\t\"rmo:0F10rM|mro:0F11Rm\",\r\n  orpd_2 =\t\"rmo:660F56rM\",\r\n  orps_2 =\t\"rmo:0F56rM\",\r\n  packssdw_2 =\t\"rmo:660F6BrM\",\r\n  packsswb_2 =\t\"rmo:660F63rM\",\r\n  packuswb_2 =\t\"rmo:660F67rM\",\r\n  paddb_2 =\t\"rmo:660FFCrM\",\r\n  paddd_2 =\t\"rmo:660FFErM\",\r\n  paddq_2 =\t\"rmo:660FD4rM\",\r\n  paddsb_2 =\t\"rmo:660FECrM\",\r\n  paddsw_2 =\t\"rmo:660FEDrM\",\r\n  paddusb_2 =\t\"rmo:660FDCrM\",\r\n  paddusw_2 =\t\"rmo:660FDDrM\",\r\n  paddw_2 =\t\"rmo:660FFDrM\",\r\n  pand_2 =\t\"rmo:660FDBrM\",\r\n  pandn_2 =\t\"rmo:660FDFrM\",\r\n  pause_0 =\t\"F390\",\r\n  pavgb_2 =\t\"rmo:660FE0rM\",\r\n  pavgw_2 =\t\"rmo:660FE3rM\",\r\n  pcmpeqb_2 =\t\"rmo:660F74rM\",\r\n  pcmpeqd_2 =\t\"rmo:660F76rM\",\r\n  pcmpeqw_2 =\t\"rmo:660F75rM\",\r\n  pcmpgtb_2 =\t\"rmo:660F64rM\",\r\n  pcmpgtd_2 =\t\"rmo:660F66rM\",\r\n  pcmpgtw_2 =\t\"rmo:660F65rM\",\r\n  pextrw_3 =\t\"rri/do:660FC5rMU|xri/wo:660F3A15nrMU\", -- Mem op: SSE4.1 only.\r\n  pinsrw_3 =\t\"rri/od:660FC4rMU|rxi/ow:\",\r\n  pmaddwd_2 =\t\"rmo:660FF5rM\",\r\n  pmaxsw_2 =\t\"rmo:660FEErM\",\r\n  pmaxub_2 =\t\"rmo:660FDErM\",\r\n  pminsw_2 =\t\"rmo:660FEArM\",\r\n  pminub_2 =\t\"rmo:660FDArM\",\r\n  pmovmskb_2 =\t\"rr/do:660FD7rM\",\r\n  pmulhuw_2 =\t\"rmo:660FE4rM\",\r\n  pmulhw_2 =\t\"rmo:660FE5rM\",\r\n  pmullw_2 =\t\"rmo:660FD5rM\",\r\n  pmuludq_2 =\t\"rmo:660FF4rM\",\r\n  por_2 =\t\"rmo:660FEBrM\",\r\n  prefetchnta_1 = \"xb:n0F180m\",\r\n  prefetcht0_1 = \"xb:n0F181m\",\r\n  prefetcht1_1 = \"xb:n0F182m\",\r\n  prefetcht2_1 = \"xb:n0F183m\",\r\n  psadbw_2 =\t\"rmo:660FF6rM\",\r\n  pshufd_3 =\t\"rmio:660F70rMU\",\r\n  pshufhw_3 =\t\"rmio:F30F70rMU\",\r\n  pshuflw_3 =\t\"rmio:F20F70rMU\",\r\n  pslld_2 =\t\"rmo:660FF2rM|rio:660F726mU\",\r\n  pslldq_2 =\t\"rio:660F737mU\",\r\n  psllq_2 =\t\"rmo:660FF3rM|rio:660F736mU\",\r\n  psllw_2 =\t\"rmo:660FF1rM|rio:660F716mU\",\r\n  psrad_2 =\t\"rmo:660FE2rM|rio:660F724mU\",\r\n  psraw_2 =\t\"rmo:660FE1rM|rio:660F714mU\",\r\n  psrld_2 =\t\"rmo:660FD2rM|rio:660F722mU\",\r\n  psrldq_2 =\t\"rio:660F733mU\",\r\n  psrlq_2 =\t\"rmo:660FD3rM|rio:660F732mU\",\r\n  psrlw_2 =\t\"rmo:660FD1rM|rio:660F712mU\",\r\n  psubb_2 =\t\"rmo:660FF8rM\",\r\n  psubd_2 =\t\"rmo:660FFArM\",\r\n  psubq_2 =\t\"rmo:660FFBrM\",\r\n  psubsb_2 =\t\"rmo:660FE8rM\",\r\n  psubsw_2 =\t\"rmo:660FE9rM\",\r\n  psubusb_2 =\t\"rmo:660FD8rM\",\r\n  psubusw_2 =\t\"rmo:660FD9rM\",\r\n  psubw_2 =\t\"rmo:660FF9rM\",\r\n  punpckhbw_2 =\t\"rmo:660F68rM\",\r\n  punpckhdq_2 =\t\"rmo:660F6ArM\",\r\n  punpckhqdq_2 = \"rmo:660F6DrM\",\r\n  punpckhwd_2 =\t\"rmo:660F69rM\",\r\n  punpcklbw_2 =\t\"rmo:660F60rM\",\r\n  punpckldq_2 =\t\"rmo:660F62rM\",\r\n  punpcklqdq_2 = \"rmo:660F6CrM\",\r\n  punpcklwd_2 =\t\"rmo:660F61rM\",\r\n  pxor_2 =\t\"rmo:660FEFrM\",\r\n  rcpps_2 =\t\"rmo:0F53rM\",\r\n  rcpss_2 =\t\"rro:F30F53rM|rx/od:\",\r\n  rsqrtps_2 =\t\"rmo:0F52rM\",\r\n  rsqrtss_2 =\t\"rmo:F30F52rM\",\r\n  sfence_0 =\t\"0FAEF8\",\r\n  shufpd_3 =\t\"rmio:660FC6rMU\",\r\n  shufps_3 =\t\"rmio:0FC6rMU\",\r\n  stmxcsr_1 =   \"xd:0FAE3m\",\r\n  ucomisd_2 =\t\"rro:660F2ErM|rx/oq:\",\r\n  ucomiss_2 =\t\"rro:0F2ErM|rx/od:\",\r\n  unpckhpd_2 =\t\"rmo:660F15rM\",\r\n  unpckhps_2 =\t\"rmo:0F15rM\",\r\n  unpcklpd_2 =\t\"rmo:660F14rM\",\r\n  unpcklps_2 =\t\"rmo:0F14rM\",\r\n  xorpd_2 =\t\"rmo:660F57rM\",\r\n  xorps_2 =\t\"rmo:0F57rM\",\r\n\r\n  -- SSE3 ops\r\n  fisttp_1 =\t\"xw:nDF1m|xd:DB1m|xq:nDD1m\",\r\n  addsubpd_2 =\t\"rmo:660FD0rM\",\r\n  addsubps_2 =\t\"rmo:F20FD0rM\",\r\n  haddpd_2 =\t\"rmo:660F7CrM\",\r\n  haddps_2 =\t\"rmo:F20F7CrM\",\r\n  hsubpd_2 =\t\"rmo:660F7DrM\",\r\n  hsubps_2 =\t\"rmo:F20F7DrM\",\r\n  lddqu_2 =\t\"rxo:F20FF0rM\",\r\n  movddup_2 =\t\"rmo:F20F12rM\",\r\n  movshdup_2 =\t\"rmo:F30F16rM\",\r\n  movsldup_2 =\t\"rmo:F30F12rM\",\r\n\r\n  -- SSSE3 ops\r\n  pabsb_2 =\t\"rmo:660F381CrM\",\r\n  pabsd_2 =\t\"rmo:660F381ErM\",\r\n  pabsw_2 =\t\"rmo:660F381DrM\",\r\n  palignr_3 =\t\"rmio:660F3A0FrMU\",\r\n  phaddd_2 =\t\"rmo:660F3802rM\",\r\n  phaddsw_2 =\t\"rmo:660F3803rM\",\r\n  phaddw_2 =\t\"rmo:660F3801rM\",\r\n  phsubd_2 =\t\"rmo:660F3806rM\",\r\n  phsubsw_2 =\t\"rmo:660F3807rM\",\r\n  phsubw_2 =\t\"rmo:660F3805rM\",\r\n  pmaddubsw_2 =\t\"rmo:660F3804rM\",\r\n  pmulhrsw_2 =\t\"rmo:660F380BrM\",\r\n  pshufb_2 =\t\"rmo:660F3800rM\",\r\n  psignb_2 =\t\"rmo:660F3808rM\",\r\n  psignd_2 =\t\"rmo:660F380ArM\",\r\n  psignw_2 =\t\"rmo:660F3809rM\",\r\n\r\n  -- SSE4.1 ops\r\n  blendpd_3 =\t\"rmio:660F3A0DrMU\",\r\n  blendps_3 =\t\"rmio:660F3A0CrMU\",\r\n  blendvpd_3 =\t\"rmRo:660F3815rM\",\r\n  blendvps_3 =\t\"rmRo:660F3814rM\",\r\n  dppd_3 =\t\"rmio:660F3A41rMU\",\r\n  dpps_3 =\t\"rmio:660F3A40rMU\",\r\n  extractps_3 =\t\"mri/do:660F3A17RmU|rri/qo:660F3A17RXmU\",\r\n  insertps_3 =\t\"rrio:660F3A41rMU|rxi/od:\",\r\n  movntdqa_2 =\t\"rmo:660F382ArM\",\r\n  mpsadbw_3 =\t\"rmio:660F3A42rMU\",\r\n  packusdw_2 =\t\"rmo:660F382BrM\",\r\n  pblendvb_3 =\t\"rmRo:660F3810rM\",\r\n  pblendw_3 =\t\"rmio:660F3A0ErMU\",\r\n  pcmpeqq_2 =\t\"rmo:660F3829rM\",\r\n  pextrb_3 =\t\"rri/do:660F3A14nRmU|rri/qo:|xri/bo:\",\r\n  pextrd_3 =\t\"mri/do:660F3A16RmU\",\r\n  pextrq_3 =\t\"mri/qo:660F3A16RmU\",\r\n  -- pextrw is SSE2, mem operand is SSE4.1 only\r\n  phminposuw_2 = \"rmo:660F3841rM\",\r\n  pinsrb_3 =\t\"rri/od:660F3A20nrMU|rxi/ob:\",\r\n  pinsrd_3 =\t\"rmi/od:660F3A22rMU\",\r\n  pinsrq_3 =\t\"rmi/oq:660F3A22rXMU\",\r\n  pmaxsb_2 =\t\"rmo:660F383CrM\",\r\n  pmaxsd_2 =\t\"rmo:660F383DrM\",\r\n  pmaxud_2 =\t\"rmo:660F383FrM\",\r\n  pmaxuw_2 =\t\"rmo:660F383ErM\",\r\n  pminsb_2 =\t\"rmo:660F3838rM\",\r\n  pminsd_2 =\t\"rmo:660F3839rM\",\r\n  pminud_2 =\t\"rmo:660F383BrM\",\r\n  pminuw_2 =\t\"rmo:660F383ArM\",\r\n  pmovsxbd_2 =\t\"rro:660F3821rM|rx/od:\",\r\n  pmovsxbq_2 =\t\"rro:660F3822rM|rx/ow:\",\r\n  pmovsxbw_2 =\t\"rro:660F3820rM|rx/oq:\",\r\n  pmovsxdq_2 =\t\"rro:660F3825rM|rx/oq:\",\r\n  pmovsxwd_2 =\t\"rro:660F3823rM|rx/oq:\",\r\n  pmovsxwq_2 =\t\"rro:660F3824rM|rx/od:\",\r\n  pmovzxbd_2 =\t\"rro:660F3831rM|rx/od:\",\r\n  pmovzxbq_2 =\t\"rro:660F3832rM|rx/ow:\",\r\n  pmovzxbw_2 =\t\"rro:660F3830rM|rx/oq:\",\r\n  pmovzxdq_2 =\t\"rro:660F3835rM|rx/oq:\",\r\n  pmovzxwd_2 =\t\"rro:660F3833rM|rx/oq:\",\r\n  pmovzxwq_2 =\t\"rro:660F3834rM|rx/od:\",\r\n  pmuldq_2 =\t\"rmo:660F3828rM\",\r\n  pmulld_2 =\t\"rmo:660F3840rM\",\r\n  ptest_2 =\t\"rmo:660F3817rM\",\r\n  roundpd_3 =\t\"rmio:660F3A09rMU\",\r\n  roundps_3 =\t\"rmio:660F3A08rMU\",\r\n  roundsd_3 =\t\"rrio:660F3A0BrMU|rxi/oq:\",\r\n  roundss_3 =\t\"rrio:660F3A0ArMU|rxi/od:\",\r\n\r\n  -- SSE4.2 ops\r\n  crc32_2 =\t\"rmqd:F20F38F1rM|rm/dw:66F20F38F1rM|rm/db:F20F38F0rM|rm/qb:\",\r\n  pcmpestri_3 =\t\"rmio:660F3A61rMU\",\r\n  pcmpestrm_3 =\t\"rmio:660F3A60rMU\",\r\n  pcmpgtq_2 =\t\"rmo:660F3837rM\",\r\n  pcmpistri_3 =\t\"rmio:660F3A63rMU\",\r\n  pcmpistrm_3 =\t\"rmio:660F3A62rMU\",\r\n  popcnt_2 =\t\"rmqdw:F30FB8rM\",\r\n\r\n  -- SSE4a\r\n  extrq_2 =\t\"rro:660F79rM\",\r\n  extrq_3 =\t\"riio:660F780mUU\",\r\n  insertq_2 =\t\"rro:F20F79rM\",\r\n  insertq_4 =\t\"rriio:F20F78rMUU\",\r\n  lzcnt_2 =\t\"rmqdw:F30FBDrM\",\r\n  movntsd_2 =\t\"xr/qo:nF20F2BRm\",\r\n  movntss_2 =\t\"xr/do:F30F2BRm\",\r\n  -- popcnt is also in SSE4.2\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arithmetic ops.\r\nfor name,n in pairs{ add = 0, [\"or\"] = 1, adc = 2, sbb = 3,\r\n\t\t     [\"and\"] = 4, sub = 5, xor = 6, cmp = 7 } do\r\n  local n8 = shl(n, 3)\r\n  map_op[name..\"_2\"] = format(\r\n    \"mr:%02XRm|rm:%02XrM|mI1qdw:81%XmI|mS1qdw:83%XmS|Ri1qdwb:%02Xri|mi1qdwb:81%Xmi\",\r\n    1+n8, 3+n8, n, n, 5+n8, n)\r\nend\r\n\r\n-- Shift ops.\r\nfor name,n in pairs{ rol = 0, ror = 1, rcl = 2, rcr = 3,\r\n\t\t     shl = 4, shr = 5,          sar = 7, sal = 4 } do\r\n  map_op[name..\"_2\"] = format(\"m1:D1%Xm|mC1qdwb:D3%Xm|mi:C1%XmU\", n, n, n)\r\nend\r\n\r\n-- Conditional ops.\r\nfor cc,n in pairs(map_cc) do\r\n  map_op[\"j\"..cc..\"_1\"] = format(\"J.:n0F8%XJ\", n) -- short: 7%X\r\n  map_op[\"set\"..cc..\"_1\"] = format(\"mb:n0F9%X2m\", n)\r\n  map_op[\"cmov\"..cc..\"_2\"] = format(\"rmqdw:0F4%XrM\", n) -- P6+\r\nend\r\n\r\n-- FP arithmetic ops.\r\nfor name,n in pairs{ add = 0, mul = 1, com = 2, comp = 3,\r\n\t\t     sub = 4, subr = 5, div = 6, divr = 7 } do\r\n  local nc = 0xc0 + shl(n, 3)\r\n  local nr = nc + (n < 4 and 0 or (n % 2 == 0 and 8 or -8))\r\n  local fn = \"f\"..name\r\n  map_op[fn..\"_1\"] = format(\"ff:D8%02Xr|xd:D8%Xm|xq:nDC%Xm\", nc, n, n)\r\n  if n == 2 or n == 3 then\r\n    map_op[fn..\"_2\"] = format(\"Fff:D8%02XR|Fx2d:D8%XM|Fx2q:nDC%XM\", nc, n, n)\r\n  else\r\n    map_op[fn..\"_2\"] = format(\"Fff:D8%02XR|fFf:DC%02Xr|Fx2d:D8%XM|Fx2q:nDC%XM\", nc, nr, n, n)\r\n    map_op[fn..\"p_1\"] = format(\"ff:DE%02Xr\", nr)\r\n    map_op[fn..\"p_2\"] = format(\"fFf:DE%02Xr\", nr)\r\n  end\r\n  map_op[\"fi\"..name..\"_1\"] = format(\"xd:DA%Xm|xw:nDE%Xm\", n, n)\r\nend\r\n\r\n-- FP conditional moves.\r\nfor cc,n in pairs{ b=0, e=1, be=2, u=3, nb=4, ne=5, nbe=6, nu=7 } do\r\n  local nc = 0xdac0 + shl(band(n, 3), 3) + shl(band(n, 4), 6)\r\n  map_op[\"fcmov\"..cc..\"_1\"] = format(\"ff:%04Xr\", nc) -- P6+\r\n  map_op[\"fcmov\"..cc..\"_2\"] = format(\"Fff:%04XR\", nc) -- P6+\r\nend\r\n\r\n-- SSE FP arithmetic ops.\r\nfor name,n in pairs{ sqrt = 1, add = 8, mul = 9,\r\n\t\t     sub = 12, min = 13, div = 14, max = 15 } do\r\n  map_op[name..\"ps_2\"] = format(\"rmo:0F5%XrM\", n)\r\n  map_op[name..\"ss_2\"] = format(\"rro:F30F5%XrM|rx/od:\", n)\r\n  map_op[name..\"pd_2\"] = format(\"rmo:660F5%XrM\", n)\r\n  map_op[name..\"sd_2\"] = format(\"rro:F20F5%XrM|rx/oq:\", n)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Process pattern string.\r\nlocal function dopattern(pat, args, sz, op, needrex)\r\n  local digit, addin\r\n  local opcode = 0\r\n  local szov = sz\r\n  local narg = 1\r\n  local rex = 0\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 5 positions.\r\n  if secpos+5 > maxsecpos then wflush() end\r\n\r\n  -- Process each character.\r\n  for c in gmatch(pat..\"|\", \".\") do\r\n    if match(c, \"%x\") then\t-- Hex digit.\r\n      digit = byte(c) - 48\r\n      if digit > 48 then digit = digit - 39\r\n      elseif digit > 16 then digit = digit - 7 end\r\n      opcode = opcode*16 + digit\r\n      addin = nil\r\n    elseif c == \"n\" then\t-- Disable operand size mods for opcode.\r\n      szov = nil\r\n    elseif c == \"X\" then\t-- Force REX.W.\r\n      rex = 8\r\n    elseif c == \"r\" then\t-- Merge 1st operand regno. into opcode.\r\n      addin = args[1]; opcode = opcode + (addin.reg % 8)\r\n      if narg < 2 then narg = 2 end\r\n    elseif c == \"R\" then\t-- Merge 2nd operand regno. into opcode.\r\n      addin = args[2]; opcode = opcode + (addin.reg % 8)\r\n      narg = 3\r\n    elseif c == \"m\" or c == \"M\" then\t-- Encode ModRM/SIB.\r\n      local s\r\n      if addin then\r\n\ts = addin.reg\r\n\topcode = opcode - band(s, 7)\t-- Undo regno opcode merge.\r\n      else\r\n\ts = band(opcode, 15)\t-- Undo last digit.\r\n\topcode = shr(opcode, 4)\r\n      end\r\n      local nn = c == \"m\" and 1 or 2\r\n      local t = args[nn]\r\n      if narg <= nn then narg = nn + 1 end\r\n      if szov == \"q\" and rex == 0 then rex = rex + 8 end\r\n      if t.reg and t.reg > 7 then rex = rex + 1 end\r\n      if t.xreg and t.xreg > 7 then rex = rex + 2 end\r\n      if s > 7 then rex = rex + 4 end\r\n      if needrex then rex = rex + 16 end\r\n      wputop(szov, opcode, rex); opcode = nil\r\n      local imark = sub(pat, -1) -- Force a mark (ugly).\r\n      -- Put ModRM/SIB with regno/last digit as spare.\r\n      wputmrmsib(t, imark, s, addin and addin.vreg)\r\n      addin = nil\r\n    else\r\n      if opcode then -- Flush opcode.\r\n\tif szov == \"q\" and rex == 0 then rex = rex + 8 end\r\n\tif needrex then rex = rex + 16 end\r\n\tif addin and addin.reg == -1 then\r\n\t  wputop(szov, opcode - 7, rex)\r\n\t  waction(\"VREG\", addin.vreg); wputxb(0)\r\n\telse\r\n\t  if addin and addin.reg > 7 then rex = rex + 1 end\r\n\t  wputop(szov, opcode, rex)\r\n\tend\r\n\topcode = nil\r\n      end\r\n      if c == \"|\" then break end\r\n      if c == \"o\" then -- Offset (pure 32 bit displacement).\r\n\twputdarg(args[1].disp); if narg < 2 then narg = 2 end\r\n      elseif c == \"O\" then\r\n\twputdarg(args[2].disp); narg = 3\r\n      else\r\n\t-- Anything else is an immediate operand.\r\n\tlocal a = args[narg]\r\n\tnarg = narg + 1\r\n\tlocal mode, imm = a.mode, a.imm\r\n\tif mode == \"iJ\" and not match(\"iIJ\", c) then\r\n\t  werror(\"bad operand size for label\")\r\n\tend\r\n\tif c == \"S\" then\r\n\t  wputsbarg(imm)\r\n\telseif c == \"U\" then\r\n\t  wputbarg(imm)\r\n\telseif c == \"W\" then\r\n\t  wputwarg(imm)\r\n\telseif c == \"i\" or c == \"I\" then\r\n\t  if mode == \"iJ\" then\r\n\t    wputlabel(\"IMM_\", imm, 1)\r\n\t  elseif mode == \"iI\" and c == \"I\" then\r\n\t    waction(sz == \"w\" and \"IMM_WB\" or \"IMM_DB\", imm)\r\n\t  else\r\n\t    wputszarg(sz, imm)\r\n\t  end\r\n\telseif c == \"J\" then\r\n\t  if mode == \"iPJ\" then\r\n\t    waction(\"REL_A\", imm) -- !x64 (secpos)\r\n\t  else\r\n\t    wputlabel(\"REL_\", imm, 2)\r\n\t  end\r\n\telse\r\n\t  werror(\"bad char `\"..c..\"' in pattern `\"..pat..\"' for `\"..op..\"'\")\r\n\tend\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Mapping of operand modes to short names. Suppress output with '#'.\r\nlocal map_modename = {\r\n  r = \"reg\", R = \"eax\", C = \"cl\", x = \"mem\", m = \"mrm\", i = \"imm\",\r\n  f = \"stx\", F = \"st0\", J = \"lbl\", [\"1\"] = \"1\",\r\n  I = \"#\", S = \"#\", O = \"#\",\r\n}\r\n\r\n-- Return a table/string showing all possible operand modes.\r\nlocal function templatehelp(template, nparams)\r\n  if nparams == 0 then return \"\" end\r\n  local t = {}\r\n  for tm in gmatch(template, \"[^%|]+\") do\r\n    local s = map_modename[sub(tm, 1, 1)]\r\n    s = s..gsub(sub(tm, 2, nparams), \".\", function(c)\r\n      return \", \"..map_modename[c]\r\n    end)\r\n    if not match(s, \"#\") then t[#t+1] = s end\r\n  end\r\n  return t\r\nend\r\n\r\n-- Match operand modes against mode match part of template.\r\nlocal function matchtm(tm, args)\r\n  for i=1,#args do\r\n    if not match(args[i].mode, sub(tm, i, i)) then return end\r\n  end\r\n  return true\r\nend\r\n\r\n-- Handle opcodes defined with template strings.\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return templatehelp(template, nparams) end\r\n  local args = {}\r\n\r\n  -- Zero-operand opcodes have no match part.\r\n  if #params == 0 then\r\n    dopattern(template, args, \"d\", params.op, nil)\r\n    return\r\n  end\r\n\r\n  -- Determine common operand size (coerce undefined size) or flag as mixed.\r\n  local sz, szmix, needrex\r\n  for i,p in ipairs(params) do\r\n    args[i] = parseoperand(p)\r\n    local nsz = args[i].opsize\r\n    if nsz then\r\n      if sz and sz ~= nsz then szmix = true else sz = nsz end\r\n    end\r\n    local nrex = args[i].needrex\r\n    if nrex ~= nil then\r\n      if needrex == nil then\r\n\tneedrex = nrex\r\n      elseif needrex ~= nrex then\r\n\twerror(\"bad mix of byte-addressable registers\")\r\n      end\r\n    end\r\n  end\r\n\r\n  -- Try all match:pattern pairs (separated by '|').\r\n  local gotmatch, lastpat\r\n  for tm in gmatch(template, \"[^%|]+\") do\r\n    -- Split off size match (starts after mode match) and pattern string.\r\n    local szm, pat = match(tm, \"^(.-):(.*)$\", #args+1)\r\n    if pat == \"\" then pat = lastpat else lastpat = pat end\r\n    if matchtm(tm, args) then\r\n      local prefix = sub(szm, 1, 1)\r\n      if prefix == \"/\" then -- Match both operand sizes.\r\n\tif args[1].opsize == sub(szm, 2, 2) and\r\n\t   args[2].opsize == sub(szm, 3, 3) then\r\n\t  dopattern(pat, args, sz, params.op, needrex) -- Process pattern.\r\n\t  return\r\n\tend\r\n      else -- Match common operand size.\r\n\tlocal szp = sz\r\n\tif szm == \"\" then szm = x64 and \"qdwb\" or \"dwb\" end -- Default sizes.\r\n\tif prefix == \"1\" then szp = args[1].opsize; szmix = nil\r\n\telseif prefix == \"2\" then szp = args[2].opsize; szmix = nil end\r\n\tif not szmix and (prefix == \".\" or match(szm, szp or \"#\")) then\r\n\t  dopattern(pat, args, szp, params.op, needrex) -- Process pattern.\r\n\t  return\r\n\tend\r\n      end\r\n      gotmatch = true\r\n    end\r\n  end\r\n\r\n  local msg = \"bad operand mode\"\r\n  if gotmatch then\r\n    if szmix then\r\n      msg = \"mixed operand size\"\r\n    else\r\n      msg = sz and \"bad operand size\" or \"missing operand size\"\r\n    end\r\n  end\r\n\r\n  werror(msg..\" in `\"..opmodestr(params.op, args)..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- x64-specific opcode for 64 bit immediates and displacements.\r\nif x64 then\r\n  function map_op.mov64_2(params)\r\n    if not params then return { \"reg, imm\", \"reg, [disp]\", \"[disp], reg\" } end\r\n    if secpos+2 > maxsecpos then wflush() end\r\n    local opcode, op64, sz, rex, vreg\r\n    local op64 = match(params[1], \"^%[%s*(.-)%s*%]$\")\r\n    if op64 then\r\n      local a = parseoperand(params[2])\r\n      if a.mode ~= \"rmR\" then werror(\"bad operand mode\") end\r\n      sz = a.opsize\r\n      rex = sz == \"q\" and 8 or 0\r\n      opcode = 0xa3\r\n    else\r\n      op64 = match(params[2], \"^%[%s*(.-)%s*%]$\")\r\n      local a = parseoperand(params[1])\r\n      if op64 then\r\n\tif a.mode ~= \"rmR\" then werror(\"bad operand mode\") end\r\n\tsz = a.opsize\r\n\trex = sz == \"q\" and 8 or 0\r\n\topcode = 0xa1\r\n      else\r\n\tif sub(a.mode, 1, 1) ~= \"r\" or a.opsize ~= \"q\" then\r\n\t  werror(\"bad operand mode\")\r\n\tend\r\n\top64 = params[2]\r\n\tif a.reg == -1 then\r\n\t  vreg = a.vreg\r\n\t  opcode = 0xb8\r\n\telse\r\n\t  opcode = 0xb8 + band(a.reg, 7)\r\n\tend\r\n\trex = a.reg > 7 and 9 or 8\r\n      end\r\n    end\r\n    wputop(sz, opcode, rex)\r\n    if vreg then waction(\"VREG\", vreg); wputxb(0) end\r\n    waction(\"IMM_D\", format(\"(unsigned int)(%s)\", op64))\r\n    waction(\"IMM_D\", format(\"(unsigned int)((%s)>>32)\", op64))\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nlocal function op_data(params)\r\n  if not params then return \"imm...\" end\r\n  local sz = sub(params.op, 2, 2)\r\n  if sz == \"a\" then sz = addrsize end\r\n  for _,p in ipairs(params) do\r\n    local a = parseoperand(p)\r\n    if sub(a.mode, 1, 1) ~= \"i\" or (a.opsize and a.opsize ~= sz) then\r\n      werror(\"bad mode or size in `\"..p..\"'\")\r\n    end\r\n    if a.mode == \"iJ\" then\r\n      wputlabel(\"IMM_\", a.imm, 1)\r\n    else\r\n      wputszarg(sz, a.imm)\r\n    end\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\nmap_op[\".byte_*\"] = op_data\r\nmap_op[\".sbyte_*\"] = op_data\r\nmap_op[\".word_*\"] = op_data\r\nmap_op[\".dword_*\"] = op_data\r\nmap_op[\".aword_*\"] = op_data\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_2\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr  [, addr]\" end\r\n  if secpos+2 > maxsecpos then wflush() end\r\n  local a = parseoperand(params[1])\r\n  local mode, imm = a.mode, a.imm\r\n  if type(imm) == \"number\" and (mode == \"iJ\" or (imm >= 1 and imm <= 9)) then\r\n    -- Local label (1: ... 9:) or global label (->global:).\r\n    waction(\"LABEL_LG\", nil, 1)\r\n    wputxb(imm)\r\n  elseif mode == \"iJ\" then\r\n    -- PC label (=>pcexpr:).\r\n    waction(\"LABEL_PC\", imm)\r\n  else\r\n    werror(\"bad label definition\")\r\n  end\r\n  -- SETLABEL must immediately follow LABEL_LG/LABEL_PC.\r\n  local addr = params[2]\r\n  if addr then\r\n    local a = parseoperand(addr)\r\n    if a.mode == \"iPJ\" then\r\n      waction(\"SETLABEL\", a.imm)\r\n    else\r\n      werror(\"bad label assignment\")\r\n    end\r\n  end\r\nend\r\nmap_op[\".label_1\"] = map_op[\".label_2\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1]) or map_opsizenum[map_opsize[params[1]]]\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", nil, 1)\r\n\twputxb(align-1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n-- Spacing pseudo-opcode.\r\nmap_op[\".space_2\"] = function(params)\r\n  if not params then return \"num [, filler]\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  waction(\"SPACE\", params[1])\r\n  local fill = params[2]\r\n  if fill then\r\n    fill = tonumber(fill)\r\n    if not fill or fill < 0 or fill > 255 then werror(\"bad filler\") end\r\n  end\r\n  wputxb(fill or 0)\r\nend\r\nmap_op[\".space_1\"] = map_op[\".space_2\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  if reg and not map_reg_valid_base[reg] then\r\n    werror(\"bad base register `\"..(map_reg_rev[reg] or reg)..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg and map_reg_rev[tp.reg] or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\")\r\n  wputxb(num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpregs(out)\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/dynasm/dynasm.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM. A dynamic assembler for code generation engines.\r\n-- Originally designed and implemented for LuaJIT.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See below for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Application information.\r\nlocal _info = {\r\n  name =\t\"DynASM\",\r\n  description =\t\"A dynamic assembler for code generation engines\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  url =\t\t\"http://luajit.org/dynasm.html\",\r\n  license =\t\"MIT\",\r\n  copyright =\t[[\r\nCopyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining\r\na copy of this software and associated documentation files (the\r\n\"Software\"), to deal in the Software without restriction, including\r\nwithout limitation the rights to use, copy, modify, merge, publish,\r\ndistribute, sublicense, and/or sell copies of the Software, and to\r\npermit persons to whom the Software is furnished to do so, subject to\r\nthe following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be\r\nincluded in all copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n[ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n]],\r\n}\r\n\r\n-- Cache library functions.\r\nlocal type, pairs, ipairs = type, pairs, ipairs\r\nlocal pcall, error, assert = pcall, error, assert\r\nlocal _s = string\r\nlocal sub, match, gmatch, gsub = _s.sub, _s.match, _s.gmatch, _s.gsub\r\nlocal format, rep, upper = _s.format, _s.rep, _s.upper\r\nlocal _t = table\r\nlocal insert, remove, concat, sort = _t.insert, _t.remove, _t.concat, _t.sort\r\nlocal exit = os.exit\r\nlocal io = io\r\nlocal stdin, stdout, stderr = io.stdin, io.stdout, io.stderr\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Program options.\r\nlocal g_opt = {}\r\n\r\n-- Global state for current file.\r\nlocal g_fname, g_curline, g_indent, g_lineno, g_synclineno, g_arch\r\nlocal g_errcount = 0\r\n\r\n-- Write buffer for output file.\r\nlocal g_wbuffer, g_capbuffer\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Write an output line (or callback function) to the buffer.\r\nlocal function wline(line, needindent)\r\n  local buf = g_capbuffer or g_wbuffer\r\n  buf[#buf+1] = needindent and g_indent..line or line\r\n  g_synclineno = g_synclineno + 1\r\nend\r\n\r\n-- Write assembler line as a comment, if requestd.\r\nlocal function wcomment(aline)\r\n  if g_opt.comment then\r\n    wline(g_opt.comment..aline..g_opt.endcomment, true)\r\n  end\r\nend\r\n\r\n-- Resync CPP line numbers.\r\nlocal function wsync()\r\n  if g_synclineno ~= g_lineno and g_opt.cpp then\r\n    wline(\"#line \"..g_lineno..' \"'..g_fname..'\"')\r\n    g_synclineno = g_lineno\r\n  end\r\nend\r\n\r\n-- Dummy action flush function. Replaced with arch-specific function later.\r\nlocal function wflush(term)\r\nend\r\n\r\n-- Dump all buffered output lines.\r\nlocal function wdumplines(out, buf)\r\n  for _,line in ipairs(buf) do\r\n    if type(line) == \"string\" then\r\n      assert(out:write(line, \"\\n\"))\r\n    else\r\n      -- Special callback to dynamically insert lines after end of processing.\r\n      line(out)\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Emit an error. Processing continues with next statement.\r\nlocal function werror(msg)\r\n  error(format(\"%s:%s: error: %s:\\n%s\", g_fname, g_lineno, msg, g_curline), 0)\r\nend\r\n\r\n-- Emit a fatal error. Processing stops.\r\nlocal function wfatal(msg)\r\n  g_errcount = \"fatal\"\r\n  werror(msg)\r\nend\r\n\r\n-- Print a warning. Processing continues.\r\nlocal function wwarn(msg)\r\n  stderr:write(format(\"%s:%s: warning: %s:\\n%s\\n\",\r\n    g_fname, g_lineno, msg, g_curline))\r\nend\r\n\r\n-- Print caught error message. But suppress excessive errors.\r\nlocal function wprinterr(...)\r\n  if type(g_errcount) == \"number\" then\r\n    -- Regular error.\r\n    g_errcount = g_errcount + 1\r\n    if g_errcount < 21 then -- Seems to be a reasonable limit.\r\n      stderr:write(...)\r\n    elseif g_errcount == 21 then\r\n      stderr:write(g_fname,\r\n\t\":*: warning: too many errors (suppressed further messages).\\n\")\r\n    end\r\n  else\r\n    -- Fatal error.\r\n    stderr:write(...)\r\n    return true -- Stop processing.\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Map holding all option handlers.\r\nlocal opt_map = {}\r\nlocal opt_current\r\n\r\n-- Print error and exit with error status.\r\nlocal function opterror(...)\r\n  stderr:write(\"dynasm.lua: ERROR: \", ...)\r\n  stderr:write(\"\\n\")\r\n  exit(1)\r\nend\r\n\r\n-- Get option parameter.\r\nlocal function optparam(args)\r\n  local argn = args.argn\r\n  local p = args[argn]\r\n  if not p then\r\n    opterror(\"missing parameter for option `\", opt_current, \"'.\")\r\n  end\r\n  args.argn = argn + 1\r\n  return p\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Core pseudo-opcodes.\r\nlocal map_coreop = {}\r\n-- Dummy opcode map. Replaced by arch-specific map.\r\nlocal map_op = {}\r\n\r\n-- Forward declarations.\r\nlocal dostmt\r\nlocal readfile\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Map for defines (initially empty, chains to arch-specific map).\r\nlocal map_def = {}\r\n\r\n-- Pseudo-opcode to define a substitution.\r\nmap_coreop[\".define_2\"] = function(params, nparams)\r\n  if not params then return nparams == 1 and \"name\" or \"name, subst\" end\r\n  local name, def = params[1], params[2] or \"1\"\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad or duplicate define\") end\r\n  map_def[name] = def\r\nend\r\nmap_coreop[\".define_1\"] = map_coreop[\".define_2\"]\r\n\r\n-- Define a substitution on the command line.\r\nfunction opt_map.D(args)\r\n  local namesubst = optparam(args)\r\n  local name, subst = match(namesubst, \"^([%a_][%w_]*)=(.*)$\")\r\n  if name then\r\n    map_def[name] = subst\r\n  elseif match(namesubst, \"^[%a_][%w_]*$\") then\r\n    map_def[namesubst] = \"1\"\r\n  else\r\n    opterror(\"bad define\")\r\n  end\r\nend\r\n\r\n-- Undefine a substitution on the command line.\r\nfunction opt_map.U(args)\r\n  local name = optparam(args)\r\n  if match(name, \"^[%a_][%w_]*$\") then\r\n    map_def[name] = nil\r\n  else\r\n    opterror(\"bad define\")\r\n  end\r\nend\r\n\r\n-- Helper for definesubst.\r\nlocal gotsubst\r\n\r\nlocal function definesubst_one(word)\r\n  local subst = map_def[word]\r\n  if subst then gotsubst = word; return subst else return word end\r\nend\r\n\r\n-- Iteratively substitute defines.\r\nlocal function definesubst(stmt)\r\n  -- Limit number of iterations.\r\n  for i=1,100 do\r\n    gotsubst = false\r\n    stmt = gsub(stmt, \"#?[%w_]+\", definesubst_one)\r\n    if not gotsubst then break end\r\n  end\r\n  if gotsubst then wfatal(\"recursive define involving `\"..gotsubst..\"'\") end\r\n  return stmt\r\nend\r\n\r\n-- Dump all defines.\r\nlocal function dumpdefines(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_def) do\r\n    t[#t+1] = name\r\n  end\r\n  sort(t)\r\n  out:write(\"Defines:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local subst = map_def[name]\r\n    if g_arch then subst = g_arch.revdef(subst) end\r\n    out:write(format(\"  %-20s %s\\n\", name, subst))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for conditional assembly.\r\nlocal condlevel = 0\r\nlocal condstack = {}\r\n\r\n-- Evaluate condition with a Lua expression. Substitutions already performed.\r\nlocal function cond_eval(cond)\r\n  local func, err\r\n  if setfenv then\r\n    func, err = loadstring(\"return \"..cond, \"=expr\")\r\n  else\r\n    -- No globals. All unknown identifiers evaluate to nil.\r\n    func, err = load(\"return \"..cond, \"=expr\", \"t\", {})\r\n  end\r\n  if func then\r\n    if setfenv then\r\n      setfenv(func, {}) -- No globals. All unknown identifiers evaluate to nil.\r\n    end\r\n    local ok, res = pcall(func)\r\n    if ok then\r\n      if res == 0 then return false end -- Oh well.\r\n      return not not res\r\n    end\r\n    err = res\r\n  end\r\n  wfatal(\"bad condition: \"..err)\r\nend\r\n\r\n-- Skip statements until next conditional pseudo-opcode at the same level.\r\nlocal function stmtskip()\r\n  local dostmt_save = dostmt\r\n  local lvl = 0\r\n  dostmt = function(stmt)\r\n    local op = match(stmt, \"^%s*(%S+)\")\r\n    if op == \".if\" then\r\n      lvl = lvl + 1\r\n    elseif lvl ~= 0 then\r\n      if op == \".endif\" then lvl = lvl - 1 end\r\n    elseif op == \".elif\" or op == \".else\" or op == \".endif\" then\r\n      dostmt = dostmt_save\r\n      dostmt(stmt)\r\n    end\r\n  end\r\nend\r\n\r\n-- Pseudo-opcodes for conditional assembly.\r\nmap_coreop[\".if_1\"] = function(params)\r\n  if not params then return \"condition\" end\r\n  local lvl = condlevel + 1\r\n  local res = cond_eval(params[1])\r\n  condlevel = lvl\r\n  condstack[lvl] = res\r\n  if not res then stmtskip() end\r\nend\r\n\r\nmap_coreop[\".elif_1\"] = function(params)\r\n  if not params then return \"condition\" end\r\n  if condlevel == 0 then wfatal(\".elif without .if\") end\r\n  local lvl = condlevel\r\n  local res = condstack[lvl]\r\n  if res then\r\n    if res == \"else\" then wfatal(\".elif after .else\") end\r\n  else\r\n    res = cond_eval(params[1])\r\n    if res then\r\n      condstack[lvl] = res\r\n      return\r\n    end\r\n  end\r\n  stmtskip()\r\nend\r\n\r\nmap_coreop[\".else_0\"] = function(params)\r\n  if condlevel == 0 then wfatal(\".else without .if\") end\r\n  local lvl = condlevel\r\n  local res = condstack[lvl]\r\n  condstack[lvl] = \"else\"\r\n  if res then\r\n    if res == \"else\" then wfatal(\".else after .else\") end\r\n    stmtskip()\r\n  end\r\nend\r\n\r\nmap_coreop[\".endif_0\"] = function(params)\r\n  local lvl = condlevel\r\n  if lvl == 0 then wfatal(\".endif without .if\") end\r\n  condlevel = lvl - 1\r\nend\r\n\r\n-- Check for unfinished conditionals.\r\nlocal function checkconds()\r\n  if g_errcount ~= \"fatal\" and condlevel ~= 0 then\r\n    wprinterr(g_fname, \":*: error: unbalanced conditional\\n\")\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Search for a file in the given path and open it for reading.\r\nlocal function pathopen(path, name)\r\n  local dirsep = package and match(package.path, \"\\\\\") and \"\\\\\" or \"/\"\r\n  for _,p in ipairs(path) do\r\n    local fullname = p == \"\" and name or p..dirsep..name\r\n    local fin = io.open(fullname, \"r\")\r\n    if fin then\r\n      g_fname = fullname\r\n      return fin\r\n    end\r\n  end\r\nend\r\n\r\n-- Include a file.\r\nmap_coreop[\".include_1\"] = function(params)\r\n  if not params then return \"filename\" end\r\n  local name = params[1]\r\n  -- Save state. Ugly, I know. but upvalues are fast.\r\n  local gf, gl, gcl, gi = g_fname, g_lineno, g_curline, g_indent\r\n  -- Read the included file.\r\n  local fatal = readfile(pathopen(g_opt.include, name) or\r\n\t\t\t wfatal(\"include file `\"..name..\"' not found\"))\r\n  -- Restore state.\r\n  g_synclineno = -1\r\n  g_fname, g_lineno, g_curline, g_indent = gf, gl, gcl, gi\r\n  if fatal then wfatal(\"in include file\") end\r\nend\r\n\r\n-- Make .include and conditionals initially available, too.\r\nmap_op[\".include_1\"] = map_coreop[\".include_1\"]\r\nmap_op[\".if_1\"] = map_coreop[\".if_1\"]\r\nmap_op[\".elif_1\"] = map_coreop[\".elif_1\"]\r\nmap_op[\".else_0\"] = map_coreop[\".else_0\"]\r\nmap_op[\".endif_0\"] = map_coreop[\".endif_0\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for macros.\r\nlocal mac_capture, mac_lineno, mac_name\r\nlocal mac_active = {}\r\nlocal mac_list = {}\r\n\r\n-- Pseudo-opcode to define a macro.\r\nmap_coreop[\".macro_*\"] = function(mparams)\r\n  if not mparams then return \"name [, params...]\" end\r\n  -- Split off and validate macro name.\r\n  local name = remove(mparams, 1)\r\n  if not name then werror(\"missing macro name\") end\r\n  if not (match(name, \"^[%a_][%w_%.]*$\") or match(name, \"^%.[%w_%.]*$\")) then\r\n    wfatal(\"bad macro name `\"..name..\"'\")\r\n  end\r\n  -- Validate macro parameter names.\r\n  local mdup = {}\r\n  for _,mp in ipairs(mparams) do\r\n    if not match(mp, \"^[%a_][%w_]*$\") then\r\n      wfatal(\"bad macro parameter name `\"..mp..\"'\")\r\n    end\r\n    if mdup[mp] then wfatal(\"duplicate macro parameter name `\"..mp..\"'\") end\r\n    mdup[mp] = true\r\n  end\r\n  -- Check for duplicate or recursive macro definitions.\r\n  local opname = name..\"_\"..#mparams\r\n  if map_op[opname] or map_op[name..\"_*\"] then\r\n    wfatal(\"duplicate macro `\"..name..\"' (\"..#mparams..\" parameters)\")\r\n  end\r\n  if mac_capture then wfatal(\"recursive macro definition\") end\r\n\r\n  -- Enable statement capture.\r\n  local lines = {}\r\n  mac_lineno = g_lineno\r\n  mac_name = name\r\n  mac_capture = function(stmt) -- Statement capture function.\r\n    -- Stop macro definition with .endmacro pseudo-opcode.\r\n    if not match(stmt, \"^%s*.endmacro%s*$\") then\r\n      lines[#lines+1] = stmt\r\n      return\r\n    end\r\n    mac_capture = nil\r\n    mac_lineno = nil\r\n    mac_name = nil\r\n    mac_list[#mac_list+1] = opname\r\n    -- Add macro-op definition.\r\n    map_op[opname] = function(params)\r\n      if not params then return mparams, lines end\r\n      -- Protect against recursive macro invocation.\r\n      if mac_active[opname] then wfatal(\"recursive macro invocation\") end\r\n      mac_active[opname] = true\r\n      -- Setup substitution map.\r\n      local subst = {}\r\n      for i,mp in ipairs(mparams) do subst[mp] = params[i] end\r\n      local mcom\r\n      if g_opt.maccomment and g_opt.comment then\r\n\tmcom = \" MACRO \"..name..\" (\"..#mparams..\")\"\r\n\twcomment(\"{\"..mcom)\r\n      end\r\n      -- Loop through all captured statements\r\n      for _,stmt in ipairs(lines) do\r\n\t-- Substitute macro parameters.\r\n\tlocal st = gsub(stmt, \"[%w_]+\", subst)\r\n\tst = definesubst(st)\r\n\tst = gsub(st, \"%s*%.%.%s*\", \"\") -- Token paste a..b.\r\n\tif mcom and sub(st, 1, 1) ~= \"|\" then wcomment(st) end\r\n\t-- Emit statement. Use a protected call for better diagnostics.\r\n\tlocal ok, err = pcall(dostmt, st)\r\n\tif not ok then\r\n\t  -- Add the captured statement to the error.\r\n\t  wprinterr(err, \"\\n\", g_indent, \"|  \", stmt,\r\n\t\t    \"\\t[MACRO \", name, \" (\", #mparams, \")]\\n\")\r\n\tend\r\n      end\r\n      if mcom then wcomment(\"}\"..mcom) end\r\n      mac_active[opname] = nil\r\n    end\r\n  end\r\nend\r\n\r\n-- An .endmacro pseudo-opcode outside of a macro definition is an error.\r\nmap_coreop[\".endmacro_0\"] = function(params)\r\n  wfatal(\".endmacro without .macro\")\r\nend\r\n\r\n-- Dump all macros and their contents (with -PP only).\r\nlocal function dumpmacros(out, lvl)\r\n  sort(mac_list)\r\n  out:write(\"Macros:\\n\")\r\n  for _,opname in ipairs(mac_list) do\r\n    local name = sub(opname, 1, -3)\r\n    local params, lines = map_op[opname]()\r\n    out:write(format(\"  %-20s %s\\n\", name, concat(params, \", \")))\r\n    if lvl > 1 then\r\n      for _,line in ipairs(lines) do\r\n\tout:write(\"  |\", line, \"\\n\")\r\n      end\r\n      out:write(\"\\n\")\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Check for unfinished macro definitions.\r\nlocal function checkmacros()\r\n  if mac_capture then\r\n    wprinterr(g_fname, \":\", mac_lineno,\r\n\t      \": error: unfinished .macro `\", mac_name ,\"'\\n\")\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for captures.\r\nlocal cap_lineno, cap_name\r\nlocal cap_buffers = {}\r\nlocal cap_used = {}\r\n\r\n-- Start a capture.\r\nmap_coreop[\".capture_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wflush()\r\n  local name = params[1]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    wfatal(\"bad capture name `\"..name..\"'\")\r\n  end\r\n  if cap_name then\r\n    wfatal(\"already capturing to `\"..cap_name..\"' since line \"..cap_lineno)\r\n  end\r\n  cap_name = name\r\n  cap_lineno = g_lineno\r\n  -- Create or continue a capture buffer and start the output line capture.\r\n  local buf = cap_buffers[name]\r\n  if not buf then buf = {}; cap_buffers[name] = buf end\r\n  g_capbuffer = buf\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Stop a capture.\r\nmap_coreop[\".endcapture_0\"] = function(params)\r\n  wflush()\r\n  if not cap_name then wfatal(\".endcapture without a valid .capture\") end\r\n  cap_name = nil\r\n  cap_lineno = nil\r\n  g_capbuffer = nil\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Dump a capture buffer.\r\nmap_coreop[\".dumpcapture_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wflush()\r\n  local name = params[1]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    wfatal(\"bad capture name `\"..name..\"'\")\r\n  end\r\n  cap_used[name] = true\r\n  wline(function(out)\r\n    local buf = cap_buffers[name]\r\n    if buf then wdumplines(out, buf) end\r\n  end)\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Dump all captures and their buffers (with -PP only).\r\nlocal function dumpcaptures(out, lvl)\r\n  out:write(\"Captures:\\n\")\r\n  for name,buf in pairs(cap_buffers) do\r\n    out:write(format(\"  %-20s %4s)\\n\", name, \"(\"..#buf))\r\n    if lvl > 1 then\r\n      local bar = rep(\"=\", 76)\r\n      out:write(\"  \", bar, \"\\n\")\r\n      for _,line in ipairs(buf) do\r\n\tout:write(\"  \", line, \"\\n\")\r\n      end\r\n      out:write(\"  \", bar, \"\\n\\n\")\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Check for unfinished or unused captures.\r\nlocal function checkcaptures()\r\n  if cap_name then\r\n    wprinterr(g_fname, \":\", cap_lineno,\r\n\t      \": error: unfinished .capture `\", cap_name,\"'\\n\")\r\n    return\r\n  end\r\n  for name in pairs(cap_buffers) do\r\n    if not cap_used[name] then\r\n      wprinterr(g_fname, \":*: error: missing .dumpcapture \", name ,\"\\n\")\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Sections names.\r\nlocal map_sections = {}\r\n\r\n-- Pseudo-opcode to define code sections.\r\n-- TODO: Data sections, BSS sections. Needs extra C code and API.\r\nmap_coreop[\".section_*\"] = function(params)\r\n  if not params then return \"name...\" end\r\n  if #map_sections > 0 then werror(\"duplicate section definition\") end\r\n  wflush()\r\n  for sn,name in ipairs(params) do\r\n    local opname = \".\"..name..\"_0\"\r\n    if not match(name, \"^[%a][%w_]*$\") or\r\n       map_op[opname] or map_op[\".\"..name..\"_*\"] then\r\n      werror(\"bad section name `\"..name..\"'\")\r\n    end\r\n    map_sections[#map_sections+1] = name\r\n    wline(format(\"#define DASM_SECTION_%s\\t%d\", upper(name), sn-1))\r\n    map_op[opname] = function(params) g_arch.section(sn-1) end\r\n  end\r\n  wline(format(\"#define DASM_MAXSECTION\\t\\t%d\", #map_sections))\r\nend\r\n\r\n-- Dump all sections.\r\nlocal function dumpsections(out, lvl)\r\n  out:write(\"Sections:\\n\")\r\n  for _,name in ipairs(map_sections) do\r\n    out:write(format(\"  %s\\n\", name))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Replacement for customized Lua, which lacks the package library.\r\nlocal prefix = \"\"\r\nif not require then\r\n  function require(name)\r\n    local fp = assert(io.open(prefix..name..\".lua\"))\r\n    local s = fp:read(\"*a\")\r\n    assert(fp:close())\r\n    return assert(loadstring(s, \"@\"..name..\".lua\"))()\r\n  end\r\nend\r\n\r\n-- Load architecture-specific module.\r\nlocal function loadarch(arch)\r\n  if not match(arch, \"^[%w_]+$\") then return \"bad arch name\" end\r\n  local ok, m_arch = pcall(require, \"dasm_\"..arch)\r\n  if not ok then return \"cannot load module: \"..m_arch end\r\n  g_arch = m_arch\r\n  wflush = m_arch.passcb(wline, werror, wfatal, wwarn)\r\n  m_arch.setup(arch, g_opt)\r\n  map_op, map_def = m_arch.mergemaps(map_coreop, map_def)\r\nend\r\n\r\n-- Dump architecture description.\r\nfunction opt_map.dumparch(args)\r\n  local name = optparam(args)\r\n  if not g_arch then\r\n    local err = loadarch(name)\r\n    if err then opterror(err) end\r\n  end\r\n\r\n  local t = {}\r\n  for name in pairs(map_coreop) do t[#t+1] = name end\r\n  for name in pairs(map_op) do t[#t+1] = name end\r\n  sort(t)\r\n\r\n  local out = stdout\r\n  local _arch = g_arch._info\r\n  out:write(format(\"%s version %s, released %s, %s\\n\",\r\n    _info.name, _info.version, _info.release, _info.url))\r\n  g_arch.dumparch(out)\r\n\r\n  local pseudo = true\r\n  out:write(\"Pseudo-Opcodes:\\n\")\r\n  for _,sname in ipairs(t) do\r\n    local name, nparam = match(sname, \"^(.+)_([0-9%*])$\")\r\n    if name then\r\n      if pseudo and sub(name, 1, 1) ~= \".\" then\r\n\tout:write(\"\\nOpcodes:\\n\")\r\n\tpseudo = false\r\n      end\r\n      local f = map_op[sname]\r\n      local s\r\n      if nparam ~= \"*\" then nparam = nparam + 0 end\r\n      if nparam == 0 then\r\n\ts = \"\"\r\n      elseif type(f) == \"string\" then\r\n\ts = map_op[\".template__\"](nil, f, nparam)\r\n      else\r\n\ts = f(nil, nparam)\r\n      end\r\n      if type(s) == \"table\" then\r\n\tfor _,s2 in ipairs(s) do\r\n\t  out:write(format(\"  %-12s %s\\n\", name, s2))\r\n\tend\r\n      else\r\n\tout:write(format(\"  %-12s %s\\n\", name, s))\r\n      end\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\n  exit(0)\r\nend\r\n\r\n-- Pseudo-opcode to set the architecture.\r\n-- Only initially available (map_op is replaced when called).\r\nmap_op[\".arch_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  local err = loadarch(params[1])\r\n  if err then wfatal(err) end\r\n  wline(format(\"#if DASM_VERSION != %d\", _info.vernum))\r\n  wline('#error \"Version mismatch between DynASM and included encoding engine\"')\r\n  wline(\"#endif\")\r\nend\r\n\r\n-- Dummy .arch pseudo-opcode to improve the error report.\r\nmap_coreop[\".arch_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wfatal(\"duplicate .arch statement\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dummy pseudo-opcode. Don't confuse '.nop' with 'nop'.\r\nmap_coreop[\".nop_*\"] = function(params)\r\n  if not params then return \"[ignored...]\" end\r\nend\r\n\r\n-- Pseudo-opcodes to raise errors.\r\nmap_coreop[\".error_1\"] = function(params)\r\n  if not params then return \"message\" end\r\n  werror(params[1])\r\nend\r\n\r\nmap_coreop[\".fatal_1\"] = function(params)\r\n  if not params then return \"message\" end\r\n  wfatal(params[1])\r\nend\r\n\r\n-- Dump all user defined elements.\r\nlocal function dumpdef(out)\r\n  local lvl = g_opt.dumpdef\r\n  if lvl == 0 then return end\r\n  dumpsections(out, lvl)\r\n  dumpdefines(out, lvl)\r\n  if g_arch then g_arch.dumpdef(out, lvl) end\r\n  dumpmacros(out, lvl)\r\n  dumpcaptures(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Helper for splitstmt.\r\nlocal splitlvl\r\n\r\nlocal function splitstmt_one(c)\r\n  if c == \"(\" then\r\n    splitlvl = \")\"..splitlvl\r\n  elseif c == \"[\" then\r\n    splitlvl = \"]\"..splitlvl\r\n  elseif c == \"{\" then\r\n    splitlvl = \"}\"..splitlvl\r\n  elseif c == \")\" or c == \"]\" or c == \"}\" then\r\n    if sub(splitlvl, 1, 1) ~= c then werror(\"unbalanced (), [] or {}\") end\r\n    splitlvl = sub(splitlvl, 2)\r\n  elseif splitlvl == \"\" then\r\n    return \" \\0 \"\r\n  end\r\n  return c\r\nend\r\n\r\n-- Split statement into (pseudo-)opcode and params.\r\nlocal function splitstmt(stmt)\r\n  -- Convert label with trailing-colon into .label statement.\r\n  local label = match(stmt, \"^%s*(.+):%s*$\")\r\n  if label then return \".label\", {label} end\r\n\r\n  -- Split at commas and equal signs, but obey parentheses and brackets.\r\n  splitlvl = \"\"\r\n  stmt = gsub(stmt, \"[,%(%)%[%]{}]\", splitstmt_one)\r\n  if splitlvl ~= \"\" then werror(\"unbalanced () or []\") end\r\n\r\n  -- Split off opcode.\r\n  local op, other = match(stmt, \"^%s*([^%s%z]+)%s*(.*)$\")\r\n  if not op then werror(\"bad statement syntax\") end\r\n\r\n  -- Split parameters.\r\n  local params = {}\r\n  for p in gmatch(other, \"%s*(%Z+)%z?\") do\r\n    params[#params+1] = gsub(p, \"%s+$\", \"\")\r\n  end\r\n  if #params > 16 then werror(\"too many parameters\") end\r\n\r\n  params.op = op\r\n  return op, params\r\nend\r\n\r\n-- Process a single statement.\r\ndostmt = function(stmt)\r\n  -- Ignore empty statements.\r\n  if match(stmt, \"^%s*$\") then return end\r\n\r\n  -- Capture macro defs before substitution.\r\n  if mac_capture then return mac_capture(stmt) end\r\n  stmt = definesubst(stmt)\r\n\r\n  -- Emit C code without parsing the line.\r\n  if sub(stmt, 1, 1) == \"|\" then\r\n    local tail = sub(stmt, 2)\r\n    wflush()\r\n    if sub(tail, 1, 2) == \"//\" then wcomment(tail) else wline(tail, true) end\r\n    return\r\n  end\r\n\r\n  -- Split into (pseudo-)opcode and params.\r\n  local op, params = splitstmt(stmt)\r\n\r\n  -- Get opcode handler (matching # of parameters or generic handler).\r\n  local f = map_op[op..\"_\"..#params] or map_op[op..\"_*\"]\r\n  if not f then\r\n    if not g_arch then wfatal(\"first statement must be .arch\") end\r\n    -- Improve error report.\r\n    for i=0,9 do\r\n      if map_op[op..\"_\"..i] then\r\n\twerror(\"wrong number of parameters for `\"..op..\"'\")\r\n      end\r\n    end\r\n    werror(\"unknown statement `\"..op..\"'\")\r\n  end\r\n\r\n  -- Call opcode handler or special handler for template strings.\r\n  if type(f) == \"string\" then\r\n    map_op[\".template__\"](params, f)\r\n  else\r\n    f(params)\r\n  end\r\nend\r\n\r\n-- Process a single line.\r\nlocal function doline(line)\r\n  if g_opt.flushline then wflush() end\r\n\r\n  -- Assembler line?\r\n  local indent, aline = match(line, \"^(%s*)%|(.*)$\")\r\n  if not aline then\r\n    -- No, plain C code line, need to flush first.\r\n    wflush()\r\n    wsync()\r\n    wline(line, false)\r\n    return\r\n  end\r\n\r\n  g_indent = indent -- Remember current line indentation.\r\n\r\n  -- Emit C code (even from macros). Avoids echo and line parsing.\r\n  if sub(aline, 1, 1) == \"|\" then\r\n    if not mac_capture then\r\n      wsync()\r\n    elseif g_opt.comment then\r\n      wsync()\r\n      wcomment(aline)\r\n    end\r\n    dostmt(aline)\r\n    return\r\n  end\r\n\r\n  -- Echo assembler line as a comment.\r\n  if g_opt.comment then\r\n    wsync()\r\n    wcomment(aline)\r\n  end\r\n\r\n  -- Strip assembler comments.\r\n  aline = gsub(aline, \"//.*$\", \"\")\r\n\r\n  -- Split line into statements at semicolons.\r\n  if match(aline, \";\") then\r\n    for stmt in gmatch(aline, \"[^;]+\") do dostmt(stmt) end\r\n  else\r\n    dostmt(aline)\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Write DynASM header.\r\nlocal function dasmhead(out)\r\n  out:write(format([[\r\n/*\r\n** This file has been pre-processed with DynASM.\r\n** %s\r\n** DynASM version %s, DynASM %s version %s\r\n** DO NOT EDIT! The original file is in \"%s\".\r\n*/\r\n\r\n]], _info.url,\r\n    _info.version, g_arch._info.arch, g_arch._info.version,\r\n    g_fname))\r\nend\r\n\r\n-- Read input file.\r\nreadfile = function(fin)\r\n  g_indent = \"\"\r\n  g_lineno = 0\r\n  g_synclineno = -1\r\n\r\n  -- Process all lines.\r\n  for line in fin:lines() do\r\n    g_lineno = g_lineno + 1\r\n    g_curline = line\r\n    local ok, err = pcall(doline, line)\r\n    if not ok and wprinterr(err, \"\\n\") then return true end\r\n  end\r\n  wflush()\r\n\r\n  -- Close input file.\r\n  assert(fin == stdin or fin:close())\r\nend\r\n\r\n-- Write output file.\r\nlocal function writefile(outfile)\r\n  local fout\r\n\r\n  -- Open output file.\r\n  if outfile == nil or outfile == \"-\" then\r\n    fout = stdout\r\n  else\r\n    fout = assert(io.open(outfile, \"w\"))\r\n  end\r\n\r\n  -- Write all buffered lines\r\n  wdumplines(fout, g_wbuffer)\r\n\r\n  -- Close output file.\r\n  assert(fout == stdout or fout:close())\r\n\r\n  -- Optionally dump definitions.\r\n  dumpdef(fout == stdout and stderr or stdout)\r\nend\r\n\r\n-- Translate an input file to an output file.\r\nlocal function translate(infile, outfile)\r\n  g_wbuffer = {}\r\n  g_indent = \"\"\r\n  g_lineno = 0\r\n  g_synclineno = -1\r\n\r\n  -- Put header.\r\n  wline(dasmhead)\r\n\r\n  -- Read input file.\r\n  local fin\r\n  if infile == \"-\" then\r\n    g_fname = \"(stdin)\"\r\n    fin = stdin\r\n  else\r\n    g_fname = infile\r\n    fin = assert(io.open(infile, \"r\"))\r\n  end\r\n  readfile(fin)\r\n\r\n  -- Check for errors.\r\n  if not g_arch then\r\n    wprinterr(g_fname, \":*: error: missing .arch directive\\n\")\r\n  end\r\n  checkconds()\r\n  checkmacros()\r\n  checkcaptures()\r\n\r\n  if g_errcount ~= 0 then\r\n    stderr:write(g_fname, \":*: info: \", g_errcount, \" error\",\r\n      (type(g_errcount) == \"number\" and g_errcount > 1) and \"s\" or \"\",\r\n      \" in input file -- no output file generated.\\n\")\r\n    dumpdef(stderr)\r\n    exit(1)\r\n  end\r\n\r\n  -- Write output file.\r\n  writefile(outfile)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Print help text.\r\nfunction opt_map.help()\r\n  stdout:write(\"DynASM -- \", _info.description, \".\\n\")\r\n  stdout:write(\"DynASM \", _info.version, \" \", _info.release, \"  \", _info.url, \"\\n\")\r\n  stdout:write[[\r\n\r\nUsage: dynasm [OPTION]... INFILE.dasc|-\r\n\r\n  -h, --help           Display this help text.\r\n  -V, --version        Display version and copyright information.\r\n\r\n  -o, --outfile FILE   Output file name (default is stdout).\r\n  -I, --include DIR    Add directory to the include search path.\r\n\r\n  -c, --ccomment       Use /* */ comments for assembler lines.\r\n  -C, --cppcomment     Use // comments for assembler lines (default).\r\n  -N, --nocomment      Suppress assembler lines in output.\r\n  -M, --maccomment     Show macro expansions as comments (default off).\r\n\r\n  -L, --nolineno       Suppress CPP line number information in output.\r\n  -F, --flushline      Flush action list for every line.\r\n\r\n  -D NAME[=SUBST]      Define a substitution.\r\n  -U NAME              Undefine a substitution.\r\n\r\n  -P, --dumpdef        Dump defines, macros, etc. Repeat for more output.\r\n  -A, --dumparch ARCH  Load architecture ARCH and dump description.\r\n]]\r\n  exit(0)\r\nend\r\n\r\n-- Print version information.\r\nfunction opt_map.version()\r\n  stdout:write(format(\"%s version %s, released %s\\n%s\\n\\n%s\",\r\n    _info.name, _info.version, _info.release, _info.url, _info.copyright))\r\n  exit(0)\r\nend\r\n\r\n-- Misc. options.\r\nfunction opt_map.outfile(args) g_opt.outfile = optparam(args) end\r\nfunction opt_map.include(args) insert(g_opt.include, 1, optparam(args)) end\r\nfunction opt_map.ccomment() g_opt.comment = \"/*|\"; g_opt.endcomment = \" */\" end\r\nfunction opt_map.cppcomment() g_opt.comment = \"//|\"; g_opt.endcomment = \"\" end\r\nfunction opt_map.nocomment() g_opt.comment = false end\r\nfunction opt_map.maccomment() g_opt.maccomment = true end\r\nfunction opt_map.nolineno() g_opt.cpp = false end\r\nfunction opt_map.flushline() g_opt.flushline = true end\r\nfunction opt_map.dumpdef() g_opt.dumpdef = g_opt.dumpdef + 1 end\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Short aliases for long options.\r\nlocal opt_alias = {\r\n  h = \"help\", [\"?\"] = \"help\", V = \"version\",\r\n  o = \"outfile\", I = \"include\",\r\n  c = \"ccomment\", C = \"cppcomment\", N = \"nocomment\", M = \"maccomment\",\r\n  L = \"nolineno\", F = \"flushline\",\r\n  P = \"dumpdef\", A = \"dumparch\",\r\n}\r\n\r\n-- Parse single option.\r\nlocal function parseopt(opt, args)\r\n  opt_current = #opt == 1 and \"-\"..opt or \"--\"..opt\r\n  local f = opt_map[opt] or opt_map[opt_alias[opt]]\r\n  if not f then\r\n    opterror(\"unrecognized option `\", opt_current, \"'. Try `--help'.\\n\")\r\n  end\r\n  f(args)\r\nend\r\n\r\n-- Parse arguments.\r\nlocal function parseargs(args)\r\n  -- Default options.\r\n  g_opt.comment = \"//|\"\r\n  g_opt.endcomment = \"\"\r\n  g_opt.cpp = true\r\n  g_opt.dumpdef = 0\r\n  g_opt.include = { \"\" }\r\n\r\n  -- Process all option arguments.\r\n  args.argn = 1\r\n  repeat\r\n    local a = args[args.argn]\r\n    if not a then break end\r\n    local lopt, opt = match(a, \"^%-(%-?)(.+)\")\r\n    if not opt then break end\r\n    args.argn = args.argn + 1\r\n    if lopt == \"\" then\r\n      -- Loop through short options.\r\n      for o in gmatch(opt, \".\") do parseopt(o, args) end\r\n    else\r\n      -- Long option.\r\n      parseopt(opt, args)\r\n    end\r\n  until false\r\n\r\n  -- Check for proper number of arguments.\r\n  local nargs = #args - args.argn + 1\r\n  if nargs ~= 1 then\r\n    if nargs == 0 then\r\n      if g_opt.dumpdef > 0 then return dumpdef(stdout) end\r\n    end\r\n    opt_map.help()\r\n  end\r\n\r\n  -- Translate a single input file to a single output file\r\n  -- TODO: Handle multiple files?\r\n  translate(args[args.argn], g_opt.outfile)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add the directory dynasm.lua resides in to the Lua module search path.\r\nlocal arg = arg\r\nif arg and arg[0] then\r\n  prefix = match(arg[0], \"^(.*[/\\\\])\")\r\n  if package and prefix then package.path = prefix..\"?.lua;\"..package.path end\r\nend\r\n\r\n-- Start DynASM.\r\nparseargs{...}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/etc/luajit.1",
    "content": ".TH luajit 1 \"\" \"\" \"LuaJIT documentation\"\r\n.SH NAME\r\nluajit \\- Just-In-Time Compiler for the Lua Language\r\n\\fB\r\n.SH SYNOPSIS\r\n.B luajit\r\n[\\fIoptions\\fR]... [\\fIscript\\fR [\\fIargs\\fR]...]\r\n.SH \"WEB SITE\"\r\n.IR http://luajit.org\r\n.SH DESCRIPTION\r\n.PP\r\nThis is the command-line program to run Lua programs with \\fBLuaJIT\\fR.\r\n.PP\r\n\\fBLuaJIT\\fR is a just-in-time (JIT) compiler for the Lua language.\r\nThe virtual machine (VM) is based on a fast interpreter combined with\r\na trace compiler. It can significantly improve the performance of Lua programs.\r\n.PP\r\n\\fBLuaJIT\\fR is API\\- and ABI-compatible with the VM of the standard\r\nLua\\ 5.1 interpreter. When embedding the VM into an application,\r\nthe built library can be used as a drop-in replacement.\r\n.SH OPTIONS\r\n.TP\r\n.BI \"\\-e \" chunk\r\nRun the given chunk of Lua code.\r\n.TP\r\n.BI \"\\-l \" library\r\nLoad the named library, just like \\fBrequire(\"\\fR\\fIlibrary\\fR\\fB\")\\fR.\r\n.TP\r\n.BI \"\\-b \" ...\r\nSave or list bytecode. Run without arguments to get help on options.\r\n.TP\r\n.BI \"\\-j \" command\r\nPerform LuaJIT control command (optional space after \\fB\\-j\\fR).\r\n.TP\r\n.BI \"\\-O\" [opt]\r\nControl LuaJIT optimizations.\r\n.TP\r\n.B \"\\-i\"\r\nRun in interactive mode.\r\n.TP\r\n.B \"\\-v\"\r\nShow \\fBLuaJIT\\fR version.\r\n.TP\r\n.B \"\\-E\"\r\nIgnore environment variables.\r\n.TP\r\n.B \"\\-\\-\"\r\nStop processing options.\r\n.TP\r\n.B \"\\-\"\r\nRead script from stdin instead.\r\n.PP\r\nAfter all options are processed, the given \\fIscript\\fR is run.\r\nThe arguments are passed in the global \\fIarg\\fR table.\r\n.PP\r\nInteractive mode is only entered, if no \\fIscript\\fR and no \\fB\\-e\\fR\r\noption is given. Interactive mode can be left with EOF (\\fICtrl\\-Z\\fB).\r\n.SH EXAMPLES\r\n.TP\r\nluajit hello.lua world\r\n\r\nPrints \"Hello world\", assuming \\fIhello.lua\\fR contains:\r\n.br\r\n  print(\"Hello\", arg[1])\r\n.TP\r\nluajit \\-e \"local x=0; for i=1,1e9 do x=x+i end; print(x)\"\r\n\r\nCalculates the sum of the numbers from 1 to 1000000000.\r\n.br\r\nAnd finishes in a reasonable amount of time, too.\r\n.TP\r\nluajit \\-jv \\-e \"for i=1,10 do for j=1,10 do for k=1,100 do end end end\"\r\n\r\nRuns some nested loops and shows the resulting traces.\r\n.SH COPYRIGHT\r\n.PP\r\n\\fBLuaJIT\\fR is Copyright \\(co 2005-2015 Mike Pall.\r\n.br\r\n\\fBLuaJIT\\fR is open source software, released under the MIT license.\r\n.SH SEE ALSO\r\n.PP\r\nMore details in the provided HTML docs or at:\r\n.IR http://luajit.org\r\n.br\r\nMore about the Lua language can be found at:\r\n.IR http://lua.org/docs.html\r\n.PP\r\nlua(1)\r\n"
  },
  {
    "path": "build/luajit-2.0.4/etc/luajit.pc",
    "content": "# Package information for LuaJIT to be used by pkg-config.\r\nmajver=2\r\nminver=0\r\nrelver=4\r\nversion=${majver}.${minver}.${relver}\r\nabiver=5.1\r\n\r\nprefix=/usr/local\r\nmultilib=lib\r\nexec_prefix=${prefix}\r\nlibdir=${exec_prefix}/${multilib}\r\nlibname=luajit-${abiver}\r\nincludedir=${prefix}/include/luajit-${majver}.${minver}\r\n\r\nINSTALL_LMOD=${prefix}/share/lua/${abiver}\r\nINSTALL_CMOD=${prefix}/${multilib}/lua/${abiver}\r\n\r\nName: LuaJIT\r\nDescription: Just-in-time compiler for Lua\r\nURL: http://luajit.org\r\nVersion: ${version}\r\nRequires:\r\nLibs: -L${libdir} -l${libname}\r\nLibs.private: -Wl,-E -lm -ldl\r\nCflags: -I${includedir}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/Makefile",
    "content": "##############################################################################\r\n# LuaJIT Makefile. Requires GNU Make.\r\n#\r\n# Please read doc/install.html before changing any variables!\r\n#\r\n# Suitable for POSIX platforms (Linux, *BSD, OSX etc.).\r\n# Also works with MinGW and Cygwin on Windows.\r\n# Please check msvcbuild.bat for building with MSVC on Windows.\r\n#\r\n# Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n##############################################################################\r\n\r\nMAJVER=  2\r\nMINVER=  0\r\nRELVER=  4\r\nABIVER=  5.1\r\nNODOTABIVER= 51\r\n\r\n##############################################################################\r\n#############################  COMPILER OPTIONS  #############################\r\n##############################################################################\r\n# These options mainly affect the speed of the JIT compiler itself, not the\r\n# speed of the JIT-compiled code. Turn any of the optional settings on by\r\n# removing the '#' in front of them. Make sure you force a full recompile\r\n# with \"make clean\", followed by \"make\" if you change any options.\r\n#\r\n# LuaJIT builds as a native 32 or 64 bit binary by default.\r\nCC= gcc\r\n#\r\n# Use this if you want to force a 32 bit build on a 64 bit multilib OS.\r\n#CC= gcc -m32\r\n#\r\n# Since the assembler part does NOT maintain a frame pointer, it's pointless\r\n# to slow down the C part by not omitting it. Debugging, tracebacks and\r\n# unwinding are not affected -- the assembler part has frame unwind\r\n# information and GCC emits it where needed (x64) or with -g (see CCDEBUG).\r\nCCOPT= -O3 -fomit-frame-pointer\r\n# Use this if you want to generate a smaller binary (but it's slower):\r\n#CCOPT= -Os -fomit-frame-pointer\r\n# Note: it's no longer recommended to use -O3 with GCC 4.x.\r\n# The I-Cache bloat usually outweighs the benefits from aggressive inlining.\r\n#\r\n# Target-specific compiler options:\r\n#\r\n# x86 only: it's recommended to compile at least for i686. Better yet,\r\n# compile for an architecture that has SSE2, too (-msse -msse2).\r\n#\r\n# x86/x64 only: For GCC 4.2 or higher and if you don't intend to distribute\r\n# the binaries to a different machine you could also use: -march=native\r\n#\r\nCCOPT_x86= -march=i686\r\nCCOPT_x64=\r\nCCOPT_arm=\r\nCCOPT_ppc=\r\nCCOPT_ppcspe=\r\nCCOPT_mips=\r\n#\r\nCCDEBUG=\r\n# Uncomment the next line to generate debug information:\r\n#CCDEBUG= -g\r\n#\r\nCCWARN= -Wall\r\n# Uncomment the next line to enable more warnings:\r\n#CCWARN+= -Wextra -Wdeclaration-after-statement -Wredundant-decls -Wshadow -Wpointer-arith\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n################################  BUILD MODE  ################################\r\n##############################################################################\r\n# The default build mode is mixed mode on POSIX. On Windows this is the same\r\n# as dynamic mode.\r\n#\r\n# Mixed mode creates a static + dynamic library and a statically linked luajit.\r\nBUILDMODE= mixed\r\n#\r\n# Static mode creates a static library and a statically linked luajit.\r\n#BUILDMODE= static\r\n#\r\n# Dynamic mode creates a dynamic library and a dynamically linked luajit.\r\n# Note: this executable will only run when the library is installed!\r\n#BUILDMODE= dynamic\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n#################################  FEATURES  #################################\r\n##############################################################################\r\n# Enable/disable these features as needed, but make sure you force a full\r\n# recompile with \"make clean\", followed by \"make\".\r\nXCFLAGS=\r\n#\r\n# Permanently disable the FFI extension to reduce the size of the LuaJIT\r\n# executable. But please consider that the FFI library is compiled-in,\r\n# but NOT loaded by default. It only allocates any memory, if you actually\r\n# make use of it.\r\n#XCFLAGS+= -DLUAJIT_DISABLE_FFI\r\n#\r\n# Features from Lua 5.2 that are unlikely to break existing code are\r\n# enabled by default. Some other features that *might* break some existing\r\n# code (e.g. __pairs or os.execute() return values) can be enabled here.\r\n# Note: this does not provide full compatibility with Lua 5.2 at this time.\r\n#XCFLAGS+= -DLUAJIT_ENABLE_LUA52COMPAT\r\n#\r\n# Disable the JIT compiler, i.e. turn LuaJIT into a pure interpreter.\r\n#XCFLAGS+= -DLUAJIT_DISABLE_JIT\r\n#\r\n# Some architectures (e.g. PPC) can use either single-number (1) or\r\n# dual-number (2) mode. Uncomment one of these lines to override the\r\n# default mode. Please see LJ_ARCH_NUMMODE in lj_arch.h for details.\r\n#XCFLAGS+= -DLUAJIT_NUMMODE=1\r\n#XCFLAGS+= -DLUAJIT_NUMMODE=2\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n############################  DEBUGGING SUPPORT  #############################\r\n##############################################################################\r\n# Enable these options as needed, but make sure you force a full recompile\r\n# with \"make clean\", followed by \"make\".\r\n# Note that most of these are NOT suitable for benchmarking or release mode!\r\n#\r\n# Use the system provided memory allocator (realloc) instead of the\r\n# bundled memory allocator. This is slower, but sometimes helpful for\r\n# debugging. This option cannot be enabled on x64, since realloc usually\r\n# doesn't return addresses in the right address range.\r\n# OTOH this option is mandatory for Valgrind's memcheck tool on x64 and\r\n# the only way to get useful results from it for all other architectures.\r\n#XCFLAGS+= -DLUAJIT_USE_SYSMALLOC\r\n#\r\n# This define is required to run LuaJIT under Valgrind. The Valgrind\r\n# header files must be installed. You should enable debug information, too.\r\n# Use --suppressions=lj.supp to avoid some false positives.\r\n#XCFLAGS+= -DLUAJIT_USE_VALGRIND\r\n#\r\n# This is the client for the GDB JIT API. GDB 7.0 or higher is required\r\n# to make use of it. See lj_gdbjit.c for details. Enabling this causes\r\n# a non-negligible overhead, even when not running under GDB.\r\n#XCFLAGS+= -DLUAJIT_USE_GDBJIT\r\n#\r\n# Turn on assertions for the Lua/C API to debug problems with lua_* calls.\r\n# This is rather slow -- use only while developing C libraries/embeddings.\r\n#XCFLAGS+= -DLUA_USE_APICHECK\r\n#\r\n# Turn on assertions for the whole LuaJIT VM. This significantly slows down\r\n# everything. Use only if you suspect a problem with LuaJIT itself.\r\n#XCFLAGS+= -DLUA_USE_ASSERT\r\n#\r\n##############################################################################\r\n# You probably don't need to change anything below this line!\r\n##############################################################################\r\n\r\n##############################################################################\r\n# Flags and options for host and target.\r\n##############################################################################\r\n\r\n# You can override the following variables at the make command line:\r\n#   CC       HOST_CC       STATIC_CC       DYNAMIC_CC\r\n#   CFLAGS   HOST_CFLAGS   TARGET_CFLAGS\r\n#   LDFLAGS  HOST_LDFLAGS  TARGET_LDFLAGS  TARGET_SHLDFLAGS\r\n#   LIBS     HOST_LIBS     TARGET_LIBS\r\n#   CROSS    HOST_SYS      TARGET_SYS      TARGET_FLAGS\r\n#\r\n# Cross-compilation examples:\r\n#   make HOST_CC=\"gcc -m32\" CROSS=i586-mingw32msvc- TARGET_SYS=Windows\r\n#   make HOST_CC=\"gcc -m32\" CROSS=powerpc-linux-gnu-\r\n\r\nCCOPTIONS= $(CCDEBUG) $(CCOPT) $(CCWARN) $(XCFLAGS) $(CFLAGS)\r\nLDOPTIONS= $(CCDEBUG) $(LDFLAGS)\r\n\r\nHOST_CC= $(CC)\r\nHOST_RM= rm -f\r\n# If left blank, minilua is built and used. You can supply an installed\r\n# copy of (plain) Lua 5.1 or 5.2, plus Lua BitOp. E.g. with: HOST_LUA=lua\r\nHOST_LUA=\r\n\r\nHOST_XCFLAGS= -I.\r\nHOST_XLDFLAGS=\r\nHOST_XLIBS=\r\nHOST_ACFLAGS= $(CCOPTIONS) $(HOST_XCFLAGS) $(TARGET_ARCH) $(HOST_CFLAGS)\r\nHOST_ALDFLAGS= $(LDOPTIONS) $(HOST_XLDFLAGS) $(HOST_LDFLAGS)\r\nHOST_ALIBS= $(HOST_XLIBS) $(LIBS) $(HOST_LIBS)\r\n\r\nSTATIC_CC = $(CROSS)$(CC)\r\nDYNAMIC_CC = $(CROSS)$(CC) -fPIC\r\nTARGET_CC= $(STATIC_CC)\r\nTARGET_STCC= $(STATIC_CC)\r\nTARGET_DYNCC= $(DYNAMIC_CC)\r\nTARGET_LD= $(CROSS)$(CC)\r\nTARGET_AR= $(CROSS)ar rcus\r\nTARGET_STRIP= $(CROSS)strip\r\n\r\nTARGET_LIBPATH= $(or $(PREFIX),/usr/local)/$(or $(MULTILIB),lib)\r\nTARGET_SONAME= libluajit-$(ABIVER).so.$(MAJVER)\r\nTARGET_DYLIBNAME= libluajit-$(ABIVER).$(MAJVER).dylib\r\nTARGET_DYLIBPATH= $(TARGET_LIBPATH)/$(TARGET_DYLIBNAME)\r\nTARGET_DLLNAME= lua$(NODOTABIVER).dll\r\nTARGET_XSHLDFLAGS= -shared -fPIC -Wl,-soname,$(TARGET_SONAME)\r\nTARGET_DYNXLDOPTS=\r\n\r\nTARGET_LFSFLAGS= -D_FILE_OFFSET_BITS=64 -D_LARGEFILE_SOURCE\r\nTARGET_XCFLAGS= $(TARGET_LFSFLAGS) -U_FORTIFY_SOURCE\r\nTARGET_XLDFLAGS=\r\nTARGET_XLIBS= -lm\r\nTARGET_TCFLAGS= $(CCOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS) $(TARGET_CFLAGS)\r\nTARGET_ACFLAGS= $(CCOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS) $(TARGET_CFLAGS)\r\nTARGET_ALDFLAGS= $(LDOPTIONS) $(TARGET_XLDFLAGS) $(TARGET_FLAGS) $(TARGET_LDFLAGS)\r\nTARGET_ASHLDFLAGS= $(LDOPTIONS) $(TARGET_XSHLDFLAGS) $(TARGET_FLAGS) $(TARGET_SHLDFLAGS)\r\nTARGET_ALIBS= $(TARGET_XLIBS) $(LIBS) $(TARGET_LIBS)\r\n\r\nTARGET_TESTARCH=$(shell $(TARGET_CC) $(TARGET_TCFLAGS) -E lj_arch.h -dM)\r\nifneq (,$(findstring LJ_TARGET_X64 ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= x64\r\nelse\r\nifneq (,$(findstring LJ_TARGET_X86 ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= x86\r\nelse\r\nifneq (,$(findstring LJ_TARGET_ARM ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= arm\r\nelse\r\nifneq (,$(findstring LJ_TARGET_PPC ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= ppc\r\nelse\r\nifneq (,$(findstring LJ_TARGET_PPCSPE ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= ppcspe\r\nelse\r\nifneq (,$(findstring LJ_TARGET_MIPS ,$(TARGET_TESTARCH)))\r\n  ifneq (,$(findstring MIPSEL ,$(TARGET_TESTARCH)))\r\n    TARGET_ARCH= -D__MIPSEL__=1\r\n  endif\r\n  TARGET_LJARCH= mips\r\nelse\r\n  $(error Unsupported target architecture)\r\nendif\r\nendif\r\nendif\r\nendif\r\nendif\r\nendif\r\n\r\nifneq (,$(findstring LJ_TARGET_PS3 1,$(TARGET_TESTARCH)))\r\n  TARGET_SYS= PS3\r\n  TARGET_ARCH+= -D__CELLOS_LV2__\r\n  TARGET_XCFLAGS+= -DLUAJIT_USE_SYSMALLOC\r\nendif\r\nifneq (,$(findstring LJ_NO_UNWIND 1,$(TARGET_TESTARCH)))\r\n  TARGET_ARCH+= -DLUAJIT_NO_UNWIND\r\nendif\r\n\r\nTARGET_XCFLAGS+= $(CCOPT_$(TARGET_LJARCH))\r\nTARGET_ARCH+= $(patsubst %,-DLUAJIT_TARGET=LUAJIT_ARCH_%,$(TARGET_LJARCH))\r\n\r\nifneq (,$(PREFIX))\r\nifneq (/usr/local,$(PREFIX))\r\n  TARGET_XCFLAGS+= -DLUA_ROOT=\\\"$(PREFIX)\\\"\r\n  ifneq (/usr,$(PREFIX))\r\n    TARGET_DYNXLDOPTS= -Wl,-rpath,$(TARGET_LIBPATH)\r\n  endif\r\nendif\r\nendif\r\nifneq (,$(MULTILIB))\r\n  TARGET_XCFLAGS+= -DLUA_MULTILIB=\\\"$(MULTILIB)\\\"\r\nendif\r\nifneq (,$(LMULTILIB))\r\n  TARGET_XCFLAGS+= -DLUA_LMULTILIB=\\\"$(LMULTILIB)\\\"\r\nendif\r\n\r\n##############################################################################\r\n# System detection.\r\n##############################################################################\r\n\r\nifeq (Windows,$(findstring Windows,$(OS))$(MSYSTEM)$(TERM))\r\n  HOST_SYS= Windows\r\n  HOST_RM= del\r\nelse\r\n  HOST_SYS:= $(shell uname -s)\r\n  ifneq (,$(findstring MINGW,$(HOST_SYS)))\r\n    HOST_SYS= Windows\r\n    HOST_MSYS= mingw\r\n  endif\r\n  ifneq (,$(findstring CYGWIN,$(HOST_SYS)))\r\n    HOST_SYS= Windows\r\n    HOST_MSYS= cygwin\r\n  endif\r\nendif\r\n\r\nTARGET_SYS?= $(HOST_SYS)\r\nifeq (Windows,$(TARGET_SYS))\r\n  TARGET_STRIP+= --strip-unneeded\r\n  TARGET_XSHLDFLAGS= -shared\r\n  TARGET_DYNXLDOPTS=\r\nelse\r\nifeq (,$(shell $(TARGET_CC) -o /dev/null -c -x c /dev/null -fno-stack-protector 2>/dev/null || echo 1))\r\n  TARGET_XCFLAGS+= -fno-stack-protector\r\nendif\r\nifeq (Darwin,$(TARGET_SYS))\r\n  ifeq (,$(MACOSX_DEPLOYMENT_TARGET))\r\n    export MACOSX_DEPLOYMENT_TARGET=10.4\r\n  endif\r\n  TARGET_STRIP+= -x\r\n  TARGET_AR+= 2>/dev/null\r\n  TARGET_XSHLDFLAGS= -dynamiclib -single_module -undefined dynamic_lookup -fPIC\r\n  TARGET_DYNXLDOPTS=\r\n  TARGET_XSHLDFLAGS+= -install_name $(TARGET_DYLIBPATH) -compatibility_version $(MAJVER).$(MINVER) -current_version $(MAJVER).$(MINVER).$(RELVER)\r\n  ifeq (x64,$(TARGET_LJARCH))\r\n    TARGET_XLDFLAGS+= -pagezero_size 10000 -image_base 100000000\r\n    TARGET_XSHLDFLAGS+= -image_base 7fff04c4a000\r\n  endif\r\nelse\r\nifeq (iOS,$(TARGET_SYS))\r\n  TARGET_STRIP+= -x\r\n  TARGET_AR+= 2>/dev/null\r\n  TARGET_XSHLDFLAGS= -dynamiclib -single_module -undefined dynamic_lookup -fPIC\r\n  TARGET_DYNXLDOPTS=\r\n  TARGET_XSHLDFLAGS+= -install_name $(TARGET_DYLIBPATH) -compatibility_version $(MAJVER).$(MINVER) -current_version $(MAJVER).$(MINVER).$(RELVER)\r\nelse\r\n  ifneq (SunOS,$(TARGET_SYS))\r\n    ifneq (PS3,$(TARGET_SYS))\r\n      TARGET_XLDFLAGS+= -Wl,-E\r\n    endif\r\n  endif\r\n  ifeq (Linux,$(TARGET_SYS))\r\n    TARGET_XLIBS+= -ldl\r\n  endif\r\n  ifeq (GNU/kFreeBSD,$(TARGET_SYS))\r\n    TARGET_XLIBS+= -ldl\r\n  endif\r\nendif\r\nendif\r\nendif\r\n\r\nifneq ($(HOST_SYS),$(TARGET_SYS))\r\n  ifeq (Windows,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -malign-double -DLUAJIT_OS=LUAJIT_OS_WINDOWS\r\n  else\r\n  ifeq (Linux,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_LINUX\r\n  else\r\n  ifeq (Darwin,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX\r\n  else\r\n  ifeq (iOS,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX\r\n  else\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OTHER\r\n  endif\r\n  endif\r\n  endif\r\n  endif\r\nendif\r\n\r\nifneq (,$(CCDEBUG))\r\n  TARGET_STRIP= @:\r\nendif\r\n\r\n##############################################################################\r\n# Files and pathnames.\r\n##############################################################################\r\n\r\nMINILUA_O= host/minilua.o\r\nMINILUA_LIBS= -lm\r\nMINILUA_T= host/minilua\r\nMINILUA_X= $(MINILUA_T)\r\n\r\nifeq (,$(HOST_LUA))\r\n  HOST_LUA= $(MINILUA_X)\r\n  DASM_DEP= $(MINILUA_T)\r\nendif\r\n\r\nDASM_DIR= ../dynasm\r\nDASM= $(HOST_LUA) $(DASM_DIR)/dynasm.lua\r\nDASM_XFLAGS=\r\nDASM_AFLAGS=\r\nDASM_ARCH= $(TARGET_LJARCH)\r\n\r\nifneq (,$(findstring LJ_ARCH_BITS 64,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D P64\r\nendif\r\nifneq (,$(findstring LJ_HASJIT 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D JIT\r\nendif\r\nifneq (,$(findstring LJ_HASFFI 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D FFI\r\nendif\r\nifneq (,$(findstring LJ_DUALNUM 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D DUALNUM\r\nendif\r\nifneq (,$(findstring LJ_ARCH_HASFPU 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D FPU\r\n  TARGET_ARCH+= -DLJ_ARCH_HASFPU=1\r\nelse\r\n  TARGET_ARCH+= -DLJ_ARCH_HASFPU=0\r\nendif\r\nifeq (,$(findstring LJ_ABI_SOFTFP 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D HFABI\r\n  TARGET_ARCH+= -DLJ_ABI_SOFTFP=0\r\nelse\r\n  TARGET_ARCH+= -DLJ_ABI_SOFTFP=1\r\nendif\r\nDASM_AFLAGS+= -D VER=$(subst LJ_ARCH_VERSION_,,$(filter LJ_ARCH_VERSION_%,$(subst LJ_ARCH_VERSION ,LJ_ARCH_VERSION_,$(TARGET_TESTARCH))))\r\nifeq (Windows,$(TARGET_SYS))\r\n  DASM_AFLAGS+= -D WIN\r\nendif\r\nifeq (x86,$(TARGET_LJARCH))\r\n  ifneq (,$(findstring __SSE2__ 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D SSE\r\n  endif\r\nelse\r\nifeq (x64,$(TARGET_LJARCH))\r\n  DASM_ARCH= x86\r\nelse\r\nifeq (arm,$(TARGET_LJARCH))\r\n  ifeq (iOS,$(TARGET_SYS))\r\n    DASM_AFLAGS+= -D IOS\r\n  endif\r\nelse\r\nifeq (ppc,$(TARGET_LJARCH))\r\n  ifneq (,$(findstring LJ_ARCH_SQRT 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D SQRT\r\n  endif\r\n  ifneq (,$(findstring LJ_ARCH_ROUND 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D ROUND\r\n  endif\r\n  ifneq (,$(findstring LJ_ARCH_PPC64 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D GPR64\r\n  endif\r\n  ifeq (PS3,$(TARGET_SYS))\r\n    DASM_AFLAGS+= -D PPE -D TOC\r\n  endif\r\nendif\r\nendif\r\nendif\r\nendif\r\n\r\nDASM_FLAGS= $(DASM_XFLAGS) $(DASM_AFLAGS)\r\nDASM_DASC= vm_$(DASM_ARCH).dasc\r\n\r\nBUILDVM_O= host/buildvm.o host/buildvm_asm.o host/buildvm_peobj.o \\\r\n\t   host/buildvm_lib.o host/buildvm_fold.o\r\nBUILDVM_T= host/buildvm\r\nBUILDVM_X= $(BUILDVM_T)\r\n\r\nHOST_O= $(MINILUA_O) $(BUILDVM_O)\r\nHOST_T= $(MINILUA_T) $(BUILDVM_T)\r\n\r\nLJVM_S= lj_vm.s\r\nLJVM_O= lj_vm.o\r\nLJVM_BOUT= $(LJVM_S)\r\nLJVM_MODE= elfasm\r\n\r\nLJLIB_O= lib_base.o lib_math.o lib_bit.o lib_string.o lib_table.o \\\r\n\t lib_io.o lib_os.o lib_package.o lib_debug.o lib_jit.o lib_ffi.o\r\nLJLIB_C= $(LJLIB_O:.o=.c)\r\n\r\nLJCORE_O= lj_gc.o lj_err.o lj_char.o lj_bc.o lj_obj.o \\\r\n\t  lj_str.o lj_tab.o lj_func.o lj_udata.o lj_meta.o lj_debug.o \\\r\n\t  lj_state.o lj_dispatch.o lj_vmevent.o lj_vmmath.o lj_strscan.o \\\r\n\t  lj_api.o lj_lex.o lj_parse.o lj_bcread.o lj_bcwrite.o lj_load.o \\\r\n\t  lj_ir.o lj_opt_mem.o lj_opt_fold.o lj_opt_narrow.o \\\r\n\t  lj_opt_dce.o lj_opt_loop.o lj_opt_split.o lj_opt_sink.o \\\r\n\t  lj_mcode.o lj_snap.o lj_record.o lj_crecord.o lj_ffrecord.o \\\r\n\t  lj_asm.o lj_trace.o lj_gdbjit.o \\\r\n\t  lj_ctype.o lj_cdata.o lj_cconv.o lj_ccall.o lj_ccallback.o \\\r\n\t  lj_carith.o lj_clib.o lj_cparse.o \\\r\n\t  lj_lib.o lj_alloc.o lib_aux.o \\\r\n\t  $(LJLIB_O) lib_init.o slua.o\r\n\r\nLJVMCORE_O= $(LJVM_O) $(LJCORE_O)\r\nLJVMCORE_DYNO= $(LJVMCORE_O:.o=_dyn.o)\r\n\r\nLIB_VMDEF= jit/vmdef.lua\r\nLIB_VMDEFP= $(LIB_VMDEF)\r\n\r\nLUAJIT_O= luajit.o\r\nLUAJIT_A= libluajit.a\r\nLUAJIT_SO= libluajit.so\r\nLUAJIT_T= luajit\r\n\r\nALL_T= $(LUAJIT_T) $(LUAJIT_A) $(LUAJIT_SO) $(HOST_T)\r\nALL_HDRGEN= lj_bcdef.h lj_ffdef.h lj_libdef.h lj_recdef.h lj_folddef.h \\\r\n\t    host/buildvm_arch.h\r\nALL_GEN= $(LJVM_S) $(ALL_HDRGEN) $(LIB_VMDEFP)\r\nWIN_RM= *.obj *.lib *.exp *.dll *.exe *.manifest *.pdb *.ilk\r\nALL_RM= $(ALL_T) $(ALL_GEN) *.o host/*.o $(WIN_RM)\r\n\r\n##############################################################################\r\n# Build mode handling.\r\n##############################################################################\r\n\r\n# Mixed mode defaults.\r\nTARGET_O= $(LUAJIT_A)\r\nTARGET_T= $(LUAJIT_T) $(LUAJIT_SO)\r\nTARGET_DEP= $(LIB_VMDEF) $(LUAJIT_SO)\r\n\r\nifeq (Windows,$(TARGET_SYS))\r\n  TARGET_DYNCC= $(STATIC_CC)\r\n  LJVM_MODE= peobj\r\n  LJVM_BOUT= $(LJVM_O)\r\n  LUAJIT_T= luajit.exe\r\n  ifeq (cygwin,$(HOST_MSYS))\r\n    LUAJIT_SO= cyg$(TARGET_DLLNAME)\r\n  else\r\n    LUAJIT_SO= $(TARGET_DLLNAME)\r\n  endif\r\n  # Mixed mode is not supported on Windows. And static mode doesn't work well.\r\n  # C modules cannot be loaded, because they bind to lua51.dll.\r\n  ifneq (static,$(BUILDMODE))\r\n    BUILDMODE= dynamic\r\n    TARGET_XCFLAGS+= -DLUA_BUILD_AS_DLL\r\n  endif\r\nendif\r\nifeq (Darwin,$(TARGET_SYS))\r\n  LJVM_MODE= machasm\r\nendif\r\nifeq (iOS,$(TARGET_SYS))\r\n  LJVM_MODE= machasm\r\nendif\r\nifeq (SunOS,$(TARGET_SYS))\r\n  BUILDMODE= static\r\nendif\r\nifeq (PS3,$(TARGET_SYS))\r\n  BUILDMODE= static\r\nendif\r\n\r\nifeq (Windows,$(HOST_SYS))\r\n  MINILUA_T= host/minilua.exe\r\n  BUILDVM_T= host/buildvm.exe\r\n  ifeq (,$(HOST_MSYS))\r\n    MINILUA_X= host\\minilua\r\n    BUILDVM_X= host\\buildvm\r\n    ALL_RM:= $(subst /,\\,$(ALL_RM))\r\n  endif\r\nendif\r\n\r\nifeq (static,$(BUILDMODE))\r\n  TARGET_DYNCC= @:\r\n  TARGET_T= $(LUAJIT_T)\r\n  TARGET_DEP= $(LIB_VMDEF)\r\nelse\r\nifeq (dynamic,$(BUILDMODE))\r\n  ifneq (Windows,$(TARGET_SYS))\r\n    TARGET_CC= $(DYNAMIC_CC)\r\n  endif\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\n  TARGET_O= $(LUAJIT_SO)\r\n  TARGET_XLDFLAGS+= $(TARGET_DYNXLDOPTS)\r\nelse\r\nifeq (Darwin,$(TARGET_SYS))\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\nendif\r\nifeq (iOS,$(TARGET_SYS))\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\nendif\r\nendif\r\nendif\r\n\r\nQ= @\r\nE= @echo\r\n#Q=\r\n#E= @:\r\n\r\n##############################################################################\r\n# Make targets.\r\n##############################################################################\r\n\r\ndefault all:\t$(TARGET_T)\r\n\r\namalg:\r\n\t@grep \"^[+|]\" ljamalg.c\r\n\t$(MAKE) all \"LJCORE_O=ljamalg.o\"\r\n\r\nclean:\r\n\t$(HOST_RM) $(ALL_RM)\r\n\r\ndepend:\r\n\t@for file in $(ALL_HDRGEN); do \\\r\n\t  test -f $$file || touch $$file; \\\r\n\t  done\r\n\t@$(HOST_CC) $(HOST_ACFLAGS) -MM *.c host/*.c | \\\r\n\t  sed -e \"s| [^ ]*/dasm_\\S*\\.h||g\" \\\r\n\t      -e \"s|^\\([^l ]\\)|host/\\1|\" \\\r\n\t      -e \"s| lj_target_\\S*\\.h| lj_target_*.h|g\" \\\r\n\t      -e \"s| lj_emit_\\S*\\.h| lj_emit_*.h|g\" \\\r\n\t      -e \"s| lj_asm_\\S*\\.h| lj_asm_*.h|g\" >Makefile.dep\r\n\t@for file in $(ALL_HDRGEN); do \\\r\n\t  test -s $$file || $(HOST_RM) $$file; \\\r\n\t  done\r\n\r\n.PHONY: default all amalg clean depend\r\n\r\n##############################################################################\r\n# Rules for generated files.\r\n##############################################################################\r\n\r\n$(MINILUA_T): $(MINILUA_O)\r\n\t$(E) \"HOSTLINK  $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ALDFLAGS) -o $@ $(MINILUA_O) $(MINILUA_LIBS) $(HOST_ALIBS)\r\n\r\nhost/buildvm_arch.h: $(DASM_DASC) $(DASM_DEP)\r\n\t$(E) \"DYNASM    $@\"\r\n\t$(Q)$(DASM) $(DASM_FLAGS) -o $@ $(DASM_DASC)\r\n\r\nhost/buildvm.o: $(DASM_DIR)/dasm_*.h\r\n\r\n$(BUILDVM_T): $(BUILDVM_O)\r\n\t$(E) \"HOSTLINK  $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ALDFLAGS) -o $@ $(BUILDVM_O) $(HOST_ALIBS)\r\n\r\n$(LJVM_BOUT): $(BUILDVM_T)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m $(LJVM_MODE) -o $@\r\n\r\nlj_bcdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m bcdef -o $@ $(LJLIB_C)\r\n\r\nlj_ffdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m ffdef -o $@ $(LJLIB_C)\r\n\r\nlj_libdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m libdef -o $@ $(LJLIB_C)\r\n\r\nlj_recdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m recdef -o $@ $(LJLIB_C)\r\n\r\n$(LIB_VMDEF): $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m vmdef -o $(LIB_VMDEFP) $(LJLIB_C)\r\n\r\nlj_folddef.h: $(BUILDVM_T) lj_opt_fold.c\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m folddef -o $@ lj_opt_fold.c\r\n\r\n##############################################################################\r\n# Object file rules.\r\n##############################################################################\r\n\r\n%.o: %.c\r\n\t$(E) \"CC        $@\"\r\n\t$(Q)$(TARGET_DYNCC) $(TARGET_ACFLAGS) -c -o $(@:.o=_dyn.o) $<\r\n\t$(Q)$(TARGET_CC) $(TARGET_ACFLAGS) -c -o $@ $<\r\n\r\n%.o: %.s\r\n\t$(E) \"ASM       $@\"\r\n\t$(Q)$(TARGET_DYNCC) $(TARGET_ACFLAGS) -c -o $(@:.o=_dyn.o) $<\r\n\t$(Q)$(TARGET_CC) $(TARGET_ACFLAGS) -c -o $@ $<\r\n\r\n$(LUAJIT_O):\r\n\t$(E) \"CC        $@\"\r\n\t$(Q)$(TARGET_STCC) $(TARGET_ACFLAGS) -c -o $@ $<\r\n\r\n$(HOST_O): %.o: %.c\r\n\t$(E) \"HOSTCC    $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ACFLAGS) -c -o $@ $<\r\n\r\ninclude Makefile.dep\r\n\r\n##############################################################################\r\n# Target file rules.\r\n##############################################################################\r\n\r\n$(LUAJIT_A): $(LJVMCORE_O)\r\n\t$(E) \"AR        $@\"\r\n\t$(Q)$(TARGET_AR) $@ $(LJVMCORE_O)\r\n\r\n# The dependency on _O, but linking with _DYNO is intentional.\r\n$(LUAJIT_SO): $(LJVMCORE_O)\r\n\t$(E) \"DYNLINK   $@\"\r\n\t$(Q)$(TARGET_LD) $(TARGET_ASHLDFLAGS) -o $@ $(LJVMCORE_DYNO) $(TARGET_ALIBS)\r\n\t$(Q)$(TARGET_STRIP) $@\r\n\r\n$(LUAJIT_T): $(TARGET_O) $(LUAJIT_O) $(TARGET_DEP)\r\n\t$(E) \"LINK      $@\"\r\n\t$(Q)$(TARGET_LD) $(TARGET_ALDFLAGS) -o $@ $(LUAJIT_O) $(TARGET_O) $(TARGET_ALIBS)\r\n\t$(Q)$(TARGET_STRIP) $@\r\n\t$(E) \"OK        Successfully built LuaJIT\"\r\n\r\n##############################################################################\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/Makefile.dep",
    "content": "lib_aux.o: lib_aux.c lua.h luaconf.h lauxlib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_state.h lj_trace.h lj_jit.h lj_ir.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_lib.h lj_alloc.h\r\nlib_base.o: lib_base.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h \\\r\n lj_tab.h lj_meta.h lj_state.h lj_ctype.h lj_cconv.h lj_bc.h lj_ff.h \\\r\n lj_ffdef.h lj_dispatch.h lj_jit.h lj_ir.h lj_char.h lj_strscan.h \\\r\n lj_lib.h lj_libdef.h\r\nlib_bit.o: lib_bit.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_str.h lj_lib.h lj_libdef.h\r\nlib_debug.o: lib_debug.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_lib.h \\\r\n lj_libdef.h\r\nlib_ffi.o: lib_ffi.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_meta.h \\\r\n lj_ctype.h lj_cparse.h lj_cdata.h lj_cconv.h lj_carith.h lj_ccall.h \\\r\n lj_ccallback.h lj_clib.h lj_ff.h lj_ffdef.h lj_lib.h lj_libdef.h\r\nlib_init.o: lib_init.c lua.h luaconf.h lauxlib.h lualib.h lj_arch.h\r\nlib_io.o: lib_io.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_state.h lj_ff.h \\\r\n lj_ffdef.h lj_lib.h lj_libdef.h\r\nlib_jit.o: lib_jit.c lua.h luaconf.h lauxlib.h lualib.h lj_arch.h \\\r\n lj_obj.h lj_def.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h \\\r\n lj_bc.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_target.h \\\r\n lj_target_*.h lj_dispatch.h lj_vm.h lj_vmevent.h lj_lib.h luajit.h \\\r\n lj_libdef.h\r\nlib_math.o: lib_math.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_lib.h lj_vm.h lj_libdef.h\r\nlib_os.o: lib_os.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_lib.h lj_libdef.h\r\nlib_package.o: lib_package.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_err.h lj_errmsg.h lj_lib.h\r\nlib_string.o: lib_string.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h \\\r\n lj_meta.h lj_state.h lj_ff.h lj_ffdef.h lj_bcdump.h lj_lex.h lj_char.h \\\r\n lj_lib.h lj_libdef.h\r\nlib_table.o: lib_table.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_lib.h \\\r\n lj_libdef.h\r\nlj_alloc.o: lj_alloc.c lj_def.h lua.h luaconf.h lj_arch.h lj_alloc.h\r\nlj_api.o: lj_api.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h lj_func.h lj_udata.h \\\r\n lj_meta.h lj_state.h lj_bc.h lj_frame.h lj_trace.h lj_jit.h lj_ir.h \\\r\n lj_dispatch.h lj_traceerr.h lj_vm.h lj_strscan.h\r\nlj_asm.o: lj_asm.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_str.h lj_tab.h lj_frame.h lj_bc.h lj_ctype.h lj_ir.h lj_jit.h \\\r\n lj_ircall.h lj_iropt.h lj_mcode.h lj_trace.h lj_dispatch.h lj_traceerr.h \\\r\n lj_snap.h lj_asm.h lj_vm.h lj_target.h lj_target_*.h lj_emit_*.h \\\r\n lj_asm_*.h\r\nlj_bc.o: lj_bc.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_bc.h \\\r\n lj_bcdef.h\r\nlj_bcread.o: lj_bcread.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_bc.h lj_ctype.h \\\r\n lj_cdata.h lualib.h lj_lex.h lj_bcdump.h lj_state.h\r\nlj_bcwrite.o: lj_bcwrite.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_str.h lj_bc.h lj_ctype.h lj_dispatch.h lj_jit.h lj_ir.h \\\r\n lj_bcdump.h lj_lex.h lj_err.h lj_errmsg.h lj_vm.h\r\nlj_carith.o: lj_carith.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_meta.h lj_ctype.h lj_cconv.h \\\r\n lj_cdata.h lj_carith.h\r\nlj_ccall.o: lj_ccall.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_ctype.h lj_cconv.h \\\r\n lj_cdata.h lj_ccall.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_bc.h \\\r\n lj_traceerr.h\r\nlj_ccallback.o: lj_ccallback.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_state.h lj_frame.h \\\r\n lj_bc.h lj_ctype.h lj_cconv.h lj_ccall.h lj_ccallback.h lj_target.h \\\r\n lj_target_*.h lj_mcode.h lj_jit.h lj_ir.h lj_trace.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h\r\nlj_cconv.o: lj_cconv.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h lj_ctype.h lj_gc.h lj_cdata.h lj_cconv.h \\\r\n lj_ccallback.h\r\nlj_cdata.o: lj_cdata.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_ctype.h lj_cconv.h \\\r\n lj_cdata.h\r\nlj_char.o: lj_char.c lj_char.h lj_def.h lua.h luaconf.h\r\nlj_clib.o: lj_clib.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h lj_str.h lj_udata.h lj_ctype.h lj_cconv.h \\\r\n lj_cdata.h lj_clib.h\r\nlj_cparse.o: lj_cparse.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_ctype.h lj_cparse.h lj_frame.h \\\r\n lj_bc.h lj_vm.h lj_char.h lj_strscan.h\r\nlj_crecord.o: lj_crecord.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_frame.h lj_bc.h lj_ctype.h \\\r\n lj_gc.h lj_cdata.h lj_cparse.h lj_cconv.h lj_clib.h lj_ccall.h lj_ff.h \\\r\n lj_ffdef.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_record.h lj_ffrecord.h lj_snap.h \\\r\n lj_crecord.h\r\nlj_ctype.o: lj_ctype.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_ctype.h lj_ccallback.h\r\nlj_debug.o: lj_debug.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h lj_state.h lj_frame.h \\\r\n lj_bc.h lj_vm.h lj_jit.h lj_ir.h\r\nlj_dispatch.o: lj_dispatch.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_func.h lj_str.h lj_tab.h lj_meta.h lj_debug.h \\\r\n lj_state.h lj_frame.h lj_bc.h lj_ff.h lj_ffdef.h lj_jit.h lj_ir.h \\\r\n lj_ccallback.h lj_ctype.h lj_gc.h lj_trace.h lj_dispatch.h lj_traceerr.h \\\r\n lj_vm.h luajit.h\r\nlj_err.o: lj_err.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_err.h \\\r\n lj_errmsg.h lj_debug.h lj_str.h lj_func.h lj_state.h lj_frame.h lj_bc.h \\\r\n lj_ff.h lj_ffdef.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h\r\nlj_ffrecord.o: lj_ffrecord.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_frame.h lj_bc.h lj_ff.h \\\r\n lj_ffdef.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_record.h lj_ffrecord.h lj_crecord.h \\\r\n lj_vm.h lj_strscan.h lj_recdef.h\r\nlj_func.o: lj_func.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_func.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_bc.h \\\r\n lj_traceerr.h lj_vm.h\r\nlj_gc.o: lj_gc.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_func.h lj_udata.h lj_meta.h \\\r\n lj_state.h lj_frame.h lj_bc.h lj_ctype.h lj_cdata.h lj_trace.h lj_jit.h \\\r\n lj_ir.h lj_dispatch.h lj_traceerr.h lj_vm.h\r\nlj_gdbjit.o: lj_gdbjit.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_frame.h lj_bc.h lj_jit.h \\\r\n lj_ir.h lj_dispatch.h\r\nlj_ir.o: lj_ir.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_str.h lj_tab.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_ctype.h lj_cdata.h lj_carith.h \\\r\n lj_vm.h lj_strscan.h lj_lib.h\r\nlj_lex.o: lj_lex.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_ctype.h lj_cdata.h lualib.h \\\r\n lj_state.h lj_lex.h lj_parse.h lj_char.h lj_strscan.h\r\nlj_lib.o: lj_lib.c lauxlib.h lua.h luaconf.h lj_obj.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_func.h lj_bc.h \\\r\n lj_dispatch.h lj_jit.h lj_ir.h lj_vm.h lj_strscan.h lj_lib.h\r\nlj_load.o: lj_load.c lua.h luaconf.h lauxlib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_func.h lj_frame.h \\\r\n lj_bc.h lj_vm.h lj_lex.h lj_bcdump.h lj_parse.h\r\nlj_mcode.o: lj_mcode.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_jit.h lj_ir.h lj_mcode.h lj_trace.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_vm.h\r\nlj_meta.o: lj_meta.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_meta.h lj_frame.h lj_bc.h \\\r\n lj_vm.h lj_strscan.h\r\nlj_obj.o: lj_obj.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h\r\nlj_opt_dce.o: lj_opt_dce.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_jit.h lj_iropt.h\r\nlj_opt_fold.o: lj_opt_fold.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_str.h lj_tab.h lj_ir.h lj_jit.h lj_iropt.h lj_trace.h lj_dispatch.h \\\r\n lj_bc.h lj_traceerr.h lj_ctype.h lj_gc.h lj_carith.h lj_vm.h \\\r\n lj_strscan.h lj_folddef.h\r\nlj_opt_loop.o: lj_opt_loop.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_ir.h lj_jit.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_snap.h lj_vm.h\r\nlj_opt_mem.o: lj_opt_mem.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_tab.h lj_ir.h lj_jit.h lj_iropt.h\r\nlj_opt_narrow.o: lj_opt_narrow.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_bc.h lj_ir.h lj_jit.h lj_iropt.h lj_trace.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h lj_strscan.h\r\nlj_opt_sink.o: lj_opt_sink.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_jit.h lj_iropt.h lj_target.h lj_target_*.h\r\nlj_opt_split.o: lj_opt_split.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_str.h lj_ir.h lj_jit.h lj_ircall.h \\\r\n lj_iropt.h lj_vm.h\r\nlj_parse.o: lj_parse.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h lj_func.h \\\r\n lj_state.h lj_bc.h lj_ctype.h lj_lex.h lj_parse.h lj_vm.h lj_vmevent.h\r\nlj_record.o: lj_record.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_meta.h lj_frame.h lj_bc.h \\\r\n lj_ctype.h lj_gc.h lj_ff.h lj_ffdef.h lj_ir.h lj_jit.h lj_ircall.h \\\r\n lj_iropt.h lj_trace.h lj_dispatch.h lj_traceerr.h lj_record.h \\\r\n lj_ffrecord.h lj_snap.h lj_vm.h\r\nlj_snap.o: lj_snap.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_tab.h lj_state.h lj_frame.h lj_bc.h lj_ir.h lj_jit.h lj_iropt.h \\\r\n lj_trace.h lj_dispatch.h lj_traceerr.h lj_snap.h lj_target.h \\\r\n lj_target_*.h lj_ctype.h lj_cdata.h\r\nlj_state.o: lj_state.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_func.h lj_meta.h \\\r\n lj_state.h lj_frame.h lj_bc.h lj_ctype.h lj_trace.h lj_jit.h lj_ir.h \\\r\n lj_dispatch.h lj_traceerr.h lj_vm.h lj_lex.h lj_alloc.h\r\nlj_str.o: lj_str.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_state.h lj_char.h\r\nlj_strscan.o: lj_strscan.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_char.h lj_strscan.h\r\nlj_tab.o: lj_tab.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h\r\nlj_trace.o: lj_trace.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_frame.h lj_bc.h \\\r\n lj_state.h lj_ir.h lj_jit.h lj_iropt.h lj_mcode.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_snap.h lj_gdbjit.h lj_record.h lj_asm.h \\\r\n lj_vm.h lj_vmevent.h lj_target.h lj_target_*.h\r\nlj_udata.o: lj_udata.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_udata.h\r\nlj_vmevent.o: lj_vmevent.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_str.h lj_tab.h lj_state.h lj_dispatch.h lj_bc.h lj_jit.h lj_ir.h \\\r\n lj_vm.h lj_vmevent.h\r\nlj_vmmath.o: lj_vmmath.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_vm.h\r\nljamalg.o: ljamalg.c lua.h luaconf.h lauxlib.h lj_gc.c lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_func.h \\\r\n lj_udata.h lj_meta.h lj_state.h lj_frame.h lj_bc.h lj_ctype.h lj_cdata.h \\\r\n lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_traceerr.h lj_vm.h lj_err.c \\\r\n lj_debug.h lj_ff.h lj_ffdef.h lj_char.c lj_char.h lj_bc.c lj_bcdef.h \\\r\n lj_obj.c lj_str.c lj_tab.c lj_func.c lj_udata.c lj_meta.c lj_strscan.h \\\r\n lj_debug.c lj_state.c lj_lex.h lj_alloc.h lj_dispatch.c lj_ccallback.h \\\r\n luajit.h lj_vmevent.c lj_vmevent.h lj_vmmath.c lj_strscan.c lj_api.c \\\r\n lj_lex.c lualib.h lj_parse.h lj_parse.c lj_bcread.c lj_bcdump.h \\\r\n lj_bcwrite.c lj_load.c lj_ctype.c lj_cdata.c lj_cconv.h lj_cconv.c \\\r\n lj_ccall.c lj_ccall.h lj_ccallback.c lj_target.h lj_target_*.h \\\r\n lj_mcode.h lj_carith.c lj_carith.h lj_clib.c lj_clib.h lj_cparse.c \\\r\n lj_cparse.h lj_lib.c lj_lib.h lj_ir.c lj_ircall.h lj_iropt.h \\\r\n lj_opt_mem.c lj_opt_fold.c lj_folddef.h lj_opt_narrow.c lj_opt_dce.c \\\r\n lj_opt_loop.c lj_snap.h lj_opt_split.c lj_opt_sink.c lj_mcode.c \\\r\n lj_snap.c lj_record.c lj_record.h lj_ffrecord.h lj_crecord.c \\\r\n lj_crecord.h lj_ffrecord.c lj_recdef.h lj_asm.c lj_asm.h lj_emit_*.h \\\r\n lj_asm_*.h lj_trace.c lj_gdbjit.h lj_gdbjit.c lj_alloc.c lib_aux.c \\\r\n lib_base.c lj_libdef.h lib_math.c lib_string.c lib_table.c lib_io.c \\\r\n lib_os.c lib_package.c lib_debug.c lib_bit.c lib_jit.c lib_ffi.c \\\r\n lib_init.c\r\nluajit.o: luajit.c lua.h luaconf.h lauxlib.h lualib.h luajit.h lj_arch.h\r\nhost/buildvm.o: host/buildvm.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_gc.h lj_obj.h lj_bc.h lj_ir.h \\\r\n lj_ircall.h lj_ir.h lj_jit.h lj_frame.h lj_bc.h lj_dispatch.h lj_ctype.h \\\r\n lj_gc.h lj_ccall.h lj_ctype.h luajit.h \\\r\n host/buildvm_arch.h lj_traceerr.h\r\nhost/buildvm_asm.o: host/buildvm_asm.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_bc.h lj_def.h lj_arch.h\r\nhost/buildvm_fold.o: host/buildvm_fold.c host/buildvm.h lj_def.h lua.h \\\r\n luaconf.h lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_ir.h lj_obj.h\r\nhost/buildvm_lib.o: host/buildvm_lib.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_lib.h lj_obj.h\r\nhost/buildvm_peobj.o: host/buildvm_peobj.c host/buildvm.h lj_def.h lua.h \\\r\n luaconf.h lj_arch.h lj_bc.h lj_def.h lj_arch.h\r\nhost/minilua.o: host/minilua.c\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/README",
    "content": "The files in this directory are only used during the build process of LuaJIT.\r\nFor cross-compilation, they must be executed on the host, not on the target.\r\n\r\nThese files should NOT be installed!\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm.c",
    "content": "/*\r\n** LuaJIT VM builder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** This is a tool to build the hand-tuned assembler code required for\r\n** LuaJIT's bytecode interpreter. It supports a variety of output formats\r\n** to feed different toolchains (see usage() below).\r\n**\r\n** This tool is not particularly optimized because it's only used while\r\n** _building_ LuaJIT. There's no point in distributing or installing it.\r\n** Only the object code generated by this tool is linked into LuaJIT.\r\n**\r\n** Caveat: some memory is not free'd, error handling is lazy.\r\n** It's a one-shot tool -- any effort fixing this would be wasted.\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_dispatch.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_ccall.h\"\r\n#endif\r\n#include \"luajit.h\"\r\n\r\n#if defined(_WIN32)\r\n#include <fcntl.h>\r\n#include <io.h>\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* DynASM glue definitions. */\r\n#define Dst\t\tctx\r\n#define Dst_DECL\tBuildCtx *ctx\r\n#define Dst_REF\t\t(ctx->D)\r\n#define DASM_CHECKS\t1\r\n\r\n#include \"../dynasm/dasm_proto.h\"\r\n\r\n/* Glue macros for DynASM. */\r\nstatic int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type);\r\n\r\n#define DASM_EXTERN(ctx, addr, idx, type) \\\r\n  collect_reloc(ctx, addr, idx, type)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Avoid trouble if cross-compiling for an x86 target. Speed doesn't matter. */\r\n#define DASM_ALIGNED_WRITES\t1\r\n\r\n/* Embed architecture-specific DynASM encoder. */\r\n#if LJ_TARGET_X86ORX64\r\n#include \"../dynasm/dasm_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"../dynasm/dasm_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"../dynasm/dasm_ppc.h\"\r\n#elif LJ_TARGET_PPCSPE\r\n#include \"../dynasm/dasm_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"../dynasm/dasm_mips.h\"\r\n#else\r\n#error \"No support for this architecture (yet)\"\r\n#endif\r\n\r\n/* Embed generated architecture-specific backend. */\r\n#include \"buildvm_arch.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nvoid owrite(BuildCtx *ctx, const void *ptr, size_t sz)\r\n{\r\n  if (fwrite(ptr, 1, sz, ctx->fp) != sz) {\r\n    fprintf(stderr, \"Error: cannot write to output file: %s\\n\",\r\n\t    strerror(errno));\r\n    exit(1);\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Emit code as raw bytes. Only used for DynASM debugging. */\r\nstatic void emit_raw(BuildCtx *ctx)\r\n{\r\n  owrite(ctx, ctx->code, ctx->codesz);\r\n}\r\n\r\n/* -- Build machine code -------------------------------------------------- */\r\n\r\nstatic const char *sym_decorate(BuildCtx *ctx,\r\n\t\t\t\tconst char *prefix, const char *suffix)\r\n{\r\n  char name[256];\r\n  char *p;\r\n#if LJ_64\r\n  const char *symprefix = ctx->mode == BUILD_machasm ? \"_\" : \"\";\r\n#elif LJ_TARGET_XBOX360\r\n  const char *symprefix = \"\";\r\n#else\r\n  const char *symprefix = ctx->mode != BUILD_elfasm ? \"_\" : \"\";\r\n#endif\r\n  sprintf(name, \"%s%s%s\", symprefix, prefix, suffix);\r\n  p = strchr(name, '@');\r\n  if (p) {\r\n#if LJ_TARGET_X86ORX64\r\n    if (!LJ_64 && (ctx->mode == BUILD_coffasm || ctx->mode == BUILD_peobj))\r\n      name[0] = '@';\r\n    else\r\n      *p = '\\0';\r\n#elif (LJ_TARGET_PPC  || LJ_TARGET_PPCSPE) && !LJ_TARGET_CONSOLE\r\n    /* Keep @plt. */\r\n#else\r\n    *p = '\\0';\r\n#endif\r\n  }\r\n  p = (char *)malloc(strlen(name)+1);  /* MSVC doesn't like strdup. */\r\n  strcpy(p, name);\r\n  return p;\r\n}\r\n\r\n#define NRELOCSYM\t(sizeof(extnames)/sizeof(extnames[0])-1)\r\n\r\nstatic int relocmap[NRELOCSYM];\r\n\r\n/* Collect external relocations. */\r\nstatic int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type)\r\n{\r\n  if (ctx->nreloc >= BUILD_MAX_RELOC) {\r\n    fprintf(stderr, \"Error: too many relocations, increase BUILD_MAX_RELOC.\\n\");\r\n    exit(1);\r\n  }\r\n  if (relocmap[idx] < 0) {\r\n    relocmap[idx] = ctx->nrelocsym;\r\n    ctx->relocsym[ctx->nrelocsym] = sym_decorate(ctx, \"\", extnames[idx]);\r\n    ctx->nrelocsym++;\r\n  }\r\n  ctx->reloc[ctx->nreloc].ofs = (int32_t)(addr - ctx->code);\r\n  ctx->reloc[ctx->nreloc].sym = relocmap[idx];\r\n  ctx->reloc[ctx->nreloc].type = type;\r\n  ctx->nreloc++;\r\n#if LJ_TARGET_XBOX360\r\n  return (int)(ctx->code - addr) + 4;  /* Encode symbol offset of .text. */\r\n#else\r\n  return 0;  /* Encode symbol offset of 0. */\r\n#endif\r\n}\r\n\r\n/* Naive insertion sort. Performance doesn't matter here. */\r\nstatic void sym_insert(BuildCtx *ctx, int32_t ofs,\r\n\t\t       const char *prefix, const char *suffix)\r\n{\r\n  ptrdiff_t i = ctx->nsym++;\r\n  while (i > 0) {\r\n    if (ctx->sym[i-1].ofs <= ofs)\r\n      break;\r\n    ctx->sym[i] = ctx->sym[i-1];\r\n    i--;\r\n  }\r\n  ctx->sym[i].ofs = ofs;\r\n  ctx->sym[i].name = sym_decorate(ctx, prefix, suffix);\r\n}\r\n\r\n/* Build the machine code. */\r\nstatic int build_code(BuildCtx *ctx)\r\n{\r\n  int status;\r\n  int i;\r\n\r\n  /* Initialize DynASM structures. */\r\n  ctx->nglob = GLOB__MAX;\r\n  ctx->glob = (void **)malloc(ctx->nglob*sizeof(void *));\r\n  memset(ctx->glob, 0, ctx->nglob*sizeof(void *));\r\n  ctx->nreloc = 0;\r\n\r\n  ctx->globnames = globnames;\r\n  ctx->relocsym = (const char **)malloc(NRELOCSYM*sizeof(const char *));\r\n  ctx->nrelocsym = 0;\r\n  for (i = 0; i < (int)NRELOCSYM; i++) relocmap[i] = -1;\r\n\r\n  ctx->dasm_ident = DASM_IDENT;\r\n  ctx->dasm_arch = DASM_ARCH;\r\n\r\n  dasm_init(Dst, DASM_MAXSECTION);\r\n  dasm_setupglobal(Dst, ctx->glob, ctx->nglob);\r\n  dasm_setup(Dst, build_actionlist);\r\n\r\n  /* Call arch-specific backend to emit the code. */\r\n  ctx->npc = build_backend(ctx);\r\n\r\n  /* Finalize the code. */\r\n  (void)dasm_checkstep(Dst, -1);\r\n  if ((status = dasm_link(Dst, &ctx->codesz))) return status;\r\n  ctx->code = (uint8_t *)malloc(ctx->codesz);\r\n  if ((status = dasm_encode(Dst, (void *)ctx->code))) return status;\r\n\r\n  /* Allocate symbol table and bytecode offsets. */\r\n  ctx->beginsym = sym_decorate(ctx, \"\", LABEL_PREFIX \"vm_asm_begin\");\r\n  ctx->sym = (BuildSym *)malloc((ctx->npc+ctx->nglob+1)*sizeof(BuildSym));\r\n  ctx->nsym = 0;\r\n  ctx->bc_ofs = (int32_t *)malloc(ctx->npc*sizeof(int32_t));\r\n\r\n  /* Collect the opcodes (PC labels). */\r\n  for (i = 0; i < ctx->npc; i++) {\r\n    int32_t ofs = dasm_getpclabel(Dst, i);\r\n    if (ofs < 0) return 0x22000000|i;\r\n    ctx->bc_ofs[i] = ofs;\r\n    if ((LJ_HASJIT ||\r\n\t !(i == BC_JFORI || i == BC_JFORL || i == BC_JITERL || i == BC_JLOOP ||\r\n\t   i == BC_IFORL || i == BC_IITERL || i == BC_ILOOP)) &&\r\n\t(LJ_HASFFI || i != BC_KCDATA))\r\n      sym_insert(ctx, ofs, LABEL_PREFIX_BC, bc_names[i]);\r\n  }\r\n\r\n  /* Collect the globals (named labels). */\r\n  for (i = 0; i < ctx->nglob; i++) {\r\n    const char *gl = globnames[i];\r\n    int len = (int)strlen(gl);\r\n    if (!ctx->glob[i]) {\r\n      fprintf(stderr, \"Error: undefined global %s\\n\", gl);\r\n      exit(2);\r\n    }\r\n    /* Skip the _Z symbols. */\r\n    if (!(len >= 2 && gl[len-2] == '_' && gl[len-1] == 'Z'))\r\n      sym_insert(ctx, (int32_t)((uint8_t *)(ctx->glob[i]) - ctx->code),\r\n\t\t LABEL_PREFIX, globnames[i]);\r\n  }\r\n\r\n  /* Close the address range. */\r\n  sym_insert(ctx, (int32_t)ctx->codesz, \"\", \"\");\r\n  ctx->nsym--;\r\n\r\n  dasm_free(Dst);\r\n\r\n  return 0;\r\n}\r\n\r\n/* -- Generate VM enums --------------------------------------------------- */\r\n\r\nconst char *const bc_names[] = {\r\n#define BCNAME(name, ma, mb, mc, mt)       #name,\r\nBCDEF(BCNAME)\r\n#undef BCNAME\r\n  NULL\r\n};\r\n\r\nconst char *const ir_names[] = {\r\n#define IRNAME(name, m, m1, m2)\t#name,\r\nIRDEF(IRNAME)\r\n#undef IRNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irt_names[] = {\r\n#define IRTNAME(name, size)\t#name,\r\nIRTDEF(IRTNAME)\r\n#undef IRTNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irfpm_names[] = {\r\n#define FPMNAME(name)\t\t#name,\r\nIRFPMDEF(FPMNAME)\r\n#undef FPMNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irfield_names[] = {\r\n#define FLNAME(name, ofs)\t#name,\r\nIRFLDEF(FLNAME)\r\n#undef FLNAME\r\n  NULL\r\n};\r\n\r\nconst char *const ircall_names[] = {\r\n#define IRCALLNAME(cond, name, nargs, kind, type, flags)\t#name,\r\nIRCALLDEF(IRCALLNAME)\r\n#undef IRCALLNAME\r\n  NULL\r\n};\r\n\r\nstatic const char *const trace_errors[] = {\r\n#define TREDEF(name, msg)\tmsg,\r\n#include \"lj_traceerr.h\"\r\n  NULL\r\n};\r\n\r\nstatic const char *lower(char *buf, const char *s)\r\n{\r\n  char *p = buf;\r\n  while (*s) {\r\n    *p++ = (*s >= 'A' && *s <= 'Z') ? *s+0x20 : *s;\r\n    s++;\r\n  }\r\n  *p = '\\0';\r\n  return buf;\r\n}\r\n\r\n/* Emit C source code for bytecode-related definitions. */\r\nstatic void emit_bcdef(BuildCtx *ctx)\r\n{\r\n  int i;\r\n  fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  fprintf(ctx->fp, \"LJ_DATADEF const uint16_t lj_bc_ofs[] = {\\n\");\r\n  for (i = 0; i < ctx->npc; i++) {\r\n    if (i != 0)\r\n      fprintf(ctx->fp, \",\\n\");\r\n    fprintf(ctx->fp, \"%d\", ctx->bc_ofs[i]);\r\n  }\r\n}\r\n\r\n/* Emit VM definitions as Lua code for debug modules. */\r\nstatic void emit_vmdef(BuildCtx *ctx)\r\n{\r\n  char buf[80];\r\n  int i;\r\n  fprintf(ctx->fp, \"-- This is a generated file. DO NOT EDIT!\\n\\n\");\r\n  fprintf(ctx->fp, \"module(...)\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"bcnames = \\\"\");\r\n  for (i = 0; bc_names[i]; i++) fprintf(ctx->fp, \"%-6s\", bc_names[i]);\r\n  fprintf(ctx->fp, \"\\\"\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irnames = \\\"\");\r\n  for (i = 0; ir_names[i]; i++) fprintf(ctx->fp, \"%-6s\", ir_names[i]);\r\n  fprintf(ctx->fp, \"\\\"\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irfpm = { [0]=\");\r\n  for (i = 0; irfpm_names[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\", \", lower(buf, irfpm_names[i]));\r\n  fprintf(ctx->fp, \"}\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irfield = { [0]=\");\r\n  for (i = 0; irfield_names[i]; i++) {\r\n    char *p;\r\n    lower(buf, irfield_names[i]);\r\n    p = strchr(buf, '_');\r\n    if (p) *p = '.';\r\n    fprintf(ctx->fp, \"\\\"%s\\\", \", buf);\r\n  }\r\n  fprintf(ctx->fp, \"}\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"ircall = {\\n[0]=\");\r\n  for (i = 0; ircall_names[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", ircall_names[i]);\r\n  fprintf(ctx->fp, \"}\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"traceerr = {\\n[0]=\");\r\n  for (i = 0; trace_errors[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", trace_errors[i]);\r\n  fprintf(ctx->fp, \"}\\n\\n\");\r\n}\r\n\r\n/* -- Argument parsing ---------------------------------------------------- */\r\n\r\n/* Build mode names. */\r\nstatic const char *const modenames[] = {\r\n#define BUILDNAME(name)\t\t#name,\r\nBUILDDEF(BUILDNAME)\r\n#undef BUILDNAME\r\n  NULL\r\n};\r\n\r\n/* Print usage information and exit. */\r\nstatic void usage(void)\r\n{\r\n  int i;\r\n  fprintf(stderr, LUAJIT_VERSION \" VM builder.\\n\");\r\n  fprintf(stderr, LUAJIT_COPYRIGHT \", \" LUAJIT_URL \"\\n\");\r\n  fprintf(stderr, \"Target architecture: \" LJ_ARCH_NAME \"\\n\\n\");\r\n  fprintf(stderr, \"Usage: buildvm -m mode [-o outfile] [infiles...]\\n\\n\");\r\n  fprintf(stderr, \"Available modes:\\n\");\r\n  for (i = 0; i < BUILD__MAX; i++)\r\n    fprintf(stderr, \"  %s\\n\", modenames[i]);\r\n  exit(1);\r\n}\r\n\r\n/* Parse the output mode name. */\r\nstatic BuildMode parsemode(const char *mode)\r\n{\r\n  int i;\r\n  for (i = 0; modenames[i]; i++)\r\n    if (!strcmp(mode, modenames[i]))\r\n      return (BuildMode)i;\r\n  usage();\r\n  return (BuildMode)-1;\r\n}\r\n\r\n/* Parse arguments. */\r\nstatic void parseargs(BuildCtx *ctx, char **argv)\r\n{\r\n  const char *a;\r\n  int i;\r\n  ctx->mode = (BuildMode)-1;\r\n  ctx->outname = \"-\";\r\n  for (i = 1; (a = argv[i]) != NULL; i++) {\r\n    if (a[0] != '-')\r\n      break;\r\n    switch (a[1]) {\r\n    case '-':\r\n      if (a[2]) goto err;\r\n      i++;\r\n      goto ok;\r\n    case '\\0':\r\n      goto ok;\r\n    case 'm':\r\n      i++;\r\n      if (a[2] || argv[i] == NULL) goto err;\r\n      ctx->mode = parsemode(argv[i]);\r\n      break;\r\n    case 'o':\r\n      i++;\r\n      if (a[2] || argv[i] == NULL) goto err;\r\n      ctx->outname = argv[i];\r\n      break;\r\n    default: err:\r\n      usage();\r\n      break;\r\n    }\r\n  }\r\nok:\r\n  ctx->args = argv+i;\r\n  if (ctx->mode == (BuildMode)-1) goto err;\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n  BuildCtx ctx_;\r\n  BuildCtx *ctx = &ctx_;\r\n  int status, binmode;\r\n\r\n  if (sizeof(void *) != 4*LJ_32+8*LJ_64) {\r\n    fprintf(stderr,\"Error: pointer size mismatch in cross-build.\\n\");\r\n    fprintf(stderr,\"Try: make HOST_CC=\\\"gcc -m32\\\" CROSS=...\\n\\n\");\r\n    return 1;\r\n  }\r\n\r\n  UNUSED(argc);\r\n  parseargs(ctx, argv);\r\n\r\n  if ((status = build_code(ctx))) {\r\n    fprintf(stderr,\"Error: DASM error %08x\\n\", status);\r\n    return 1;\r\n  }\r\n\r\n  switch (ctx->mode) {\r\n  case BUILD_peobj:\r\n  case BUILD_raw:\r\n    binmode = 1;\r\n    break;\r\n  default:\r\n    binmode = 0;\r\n    break;\r\n  }\r\n\r\n  if (ctx->outname[0] == '-' && ctx->outname[1] == '\\0') {\r\n    ctx->fp = stdout;\r\n#if defined(_WIN32)\r\n    if (binmode)\r\n      _setmode(_fileno(stdout), _O_BINARY);  /* Yuck. */\r\n#endif\r\n  } else if (!(ctx->fp = fopen(ctx->outname, binmode ? \"wb\" : \"w\"))) {\r\n    fprintf(stderr, \"Error: cannot open output file '%s': %s\\n\",\r\n\t    ctx->outname, strerror(errno));\r\n    exit(1);\r\n  }\r\n\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n  case BUILD_coffasm:\r\n  case BUILD_machasm:\r\n    emit_asm(ctx);\r\n    emit_asm_debug(ctx);\r\n    break;\r\n  case BUILD_peobj:\r\n    emit_peobj(ctx);\r\n    break;\r\n  case BUILD_raw:\r\n    emit_raw(ctx);\r\n    break;\r\n  case BUILD_bcdef:\r\n    emit_bcdef(ctx);\r\n    emit_lib(ctx);\r\n    break;\r\n  case BUILD_vmdef:\r\n    emit_vmdef(ctx);\r\n    emit_lib(ctx);\r\n    break;\r\n  case BUILD_ffdef:\r\n  case BUILD_libdef:\r\n  case BUILD_recdef:\r\n    emit_lib(ctx);\r\n    break;\r\n  case BUILD_folddef:\r\n    emit_fold(ctx);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n\r\n  fflush(ctx->fp);\r\n  if (ferror(ctx->fp)) {\r\n    fprintf(stderr, \"Error: cannot write to output file: %s\\n\",\r\n\t    strerror(errno));\r\n    exit(1);\r\n  }\r\n  fclose(ctx->fp);\r\n\r\n  return 0;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm.h",
    "content": "/*\r\n** LuaJIT VM builder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _BUILDVM_H\r\n#define _BUILDVM_H\r\n\r\n#include <sys/types.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <errno.h>\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* Hardcoded limits. Increase as needed. */\r\n#define BUILD_MAX_RELOC\t\t200\t/* Max. number of relocations. */\r\n#define BUILD_MAX_FOLD\t\t4096\t/* Max. number of fold rules. */\r\n\r\n/* Prefix for scanned library definitions. */\r\n#define LIBDEF_PREFIX\t\t\"LJLIB_\"\r\n\r\n/* Prefix for scanned fold definitions. */\r\n#define FOLDDEF_PREFIX\t\t\"LJFOLD\"\r\n\r\n/* Prefixes for generated labels. */\r\n#define LABEL_PREFIX\t\t\"lj_\"\r\n#define LABEL_PREFIX_BC\t\tLABEL_PREFIX \"BC_\"\r\n#define LABEL_PREFIX_FF\t\tLABEL_PREFIX \"ff_\"\r\n#define LABEL_PREFIX_CF\t\tLABEL_PREFIX \"cf_\"\r\n#define LABEL_PREFIX_FFH\tLABEL_PREFIX \"ffh_\"\r\n#define LABEL_PREFIX_LIBCF\tLABEL_PREFIX \"lib_cf_\"\r\n#define LABEL_PREFIX_LIBINIT\tLABEL_PREFIX \"lib_init_\"\r\n\r\n/* Forward declaration. */\r\nstruct dasm_State;\r\n\r\n/* Build modes. */\r\n#define BUILDDEF(_) \\\r\n  _(elfasm) _(coffasm) _(machasm) _(peobj) _(raw) \\\r\n  _(bcdef) _(ffdef) _(libdef) _(recdef) _(vmdef) \\\r\n  _(folddef)\r\n\r\ntypedef enum {\r\n#define BUILDENUM(name)\t\tBUILD_##name,\r\nBUILDDEF(BUILDENUM)\r\n#undef BUILDENUM\r\n  BUILD__MAX\r\n} BuildMode;\r\n\r\n/* Code relocation. */\r\ntypedef struct BuildReloc {\r\n  int32_t ofs;\r\n  int sym;\r\n  int type;\r\n} BuildReloc;\r\n\r\ntypedef struct BuildSym {\r\n  const char *name;\r\n  int32_t ofs;\r\n} BuildSym;\r\n\r\n/* Build context structure. */\r\ntypedef struct BuildCtx {\r\n  /* DynASM state pointer. Should be first member. */\r\n  struct dasm_State *D;\r\n  /* Parsed command line. */\r\n  BuildMode mode;\r\n  FILE *fp;\r\n  const char *outname;\r\n  char **args;\r\n  /* Code and symbols generated by DynASM. */\r\n  uint8_t *code;\r\n  size_t codesz;\r\n  int npc, nglob, nsym, nreloc, nrelocsym;\r\n  void **glob;\r\n  BuildSym *sym;\r\n  const char **relocsym;\r\n  int32_t *bc_ofs;\r\n  const char *beginsym;\r\n  /* Strings generated by DynASM. */\r\n  const char *const *globnames;\r\n  const char *dasm_ident;\r\n  const char *dasm_arch;\r\n  /* Relocations. */\r\n  BuildReloc reloc[BUILD_MAX_RELOC];\r\n} BuildCtx;\r\n\r\nextern void owrite(BuildCtx *ctx, const void *ptr, size_t sz);\r\nextern void emit_asm(BuildCtx *ctx);\r\nextern void emit_peobj(BuildCtx *ctx);\r\nextern void emit_lib(BuildCtx *ctx);\r\nextern void emit_fold(BuildCtx *ctx);\r\n\r\nextern const char *const bc_names[];\r\nextern const char *const ir_names[];\r\nextern const char *const irt_names[];\r\nextern const char *const irfpm_names[];\r\nextern const char *const irfield_names[];\r\nextern const char *const ircall_names[];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm_asm.c",
    "content": "/*\r\n** LuaJIT VM builder: Assembler source code emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n/* Emit bytes piecewise as assembler text. */\r\nstatic void emit_asm_bytes(BuildCtx *ctx, uint8_t *p, int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < n; i++) {\r\n    if ((i & 15) == 0)\r\n      fprintf(ctx->fp, \"\\t.byte %d\", p[i]);\r\n    else\r\n      fprintf(ctx->fp, \",%d\", p[i]);\r\n    if ((i & 15) == 15) putc('\\n', ctx->fp);\r\n  }\r\n  if ((n & 15) != 0) putc('\\n', ctx->fp);\r\n}\r\n\r\n/* Emit relocation */\r\nstatic void emit_asm_reloc(BuildCtx *ctx, int type, const char *sym)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    if (type)\r\n      fprintf(ctx->fp, \"\\t.long %s-.-4\\n\", sym);\r\n    else\r\n      fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.def %s; .scl 3; .type 32; .endef\\n\", sym);\r\n    if (type)\r\n      fprintf(ctx->fp, \"\\t.long %s-.-4\\n\", sym);\r\n    else\r\n      fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  default:  /* BUILD_machasm for relative relocations handled below. */\r\n    fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic const char *const jccnames[] = {\r\n  \"jo\", \"jno\", \"jb\", \"jnb\", \"jz\", \"jnz\", \"jbe\", \"ja\",\r\n  \"js\", \"jns\", \"jpe\", \"jpo\", \"jl\", \"jge\", \"jle\", \"jg\"\r\n};\r\n\r\n/* Emit relocation for the incredibly stupid OSX assembler. */\r\nstatic void emit_asm_reloc_mach(BuildCtx *ctx, uint8_t *cp, int n,\r\n\t\t\t\tconst char *sym)\r\n{\r\n  const char *opname = NULL;\r\n  if (--n < 0) goto err;\r\n  if (cp[n] == 0xe8) {\r\n    opname = \"call\";\r\n  } else if (cp[n] == 0xe9) {\r\n    opname = \"jmp\";\r\n  } else if (cp[n] >= 0x80 && cp[n] <= 0x8f && n > 0 && cp[n-1] == 0x0f) {\r\n    opname = jccnames[cp[n]-0x80];\r\n    n--;\r\n  } else {\r\nerr:\r\n    fprintf(stderr, \"Error: unsupported opcode for %s symbol relocation.\\n\",\r\n\t    sym);\r\n    exit(1);\r\n  }\r\n  emit_asm_bytes(ctx, cp, n);\r\n  fprintf(ctx->fp, \"\\t%s %s\\n\", opname, sym);\r\n}\r\n#else\r\n/* Emit words piecewise as assembler text. */\r\nstatic void emit_asm_words(BuildCtx *ctx, uint8_t *p, int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < n; i += 4) {\r\n    if ((i & 15) == 0)\r\n      fprintf(ctx->fp, \"\\t.long 0x%08x\", *(uint32_t *)(p+i));\r\n    else\r\n      fprintf(ctx->fp, \",0x%08x\", *(uint32_t *)(p+i));\r\n    if ((i & 15) == 12) putc('\\n', ctx->fp);\r\n  }\r\n  if ((n & 15) != 0) putc('\\n', ctx->fp);\r\n}\r\n\r\n/* Emit relocation as part of an instruction. */\r\nstatic void emit_asm_wordreloc(BuildCtx *ctx, uint8_t *p, int n,\r\n\t\t\t       const char *sym)\r\n{\r\n  uint32_t ins;\r\n  emit_asm_words(ctx, p, n-4);\r\n  ins = *(uint32_t *)(p+n-4);\r\n#if LJ_TARGET_ARM\r\n  if ((ins & 0xff000000u) == 0xfa000000u) {\r\n    fprintf(ctx->fp, \"\\tblx %s\\n\", sym);\r\n  } else if ((ins & 0x0e000000u) == 0x0a000000u) {\r\n    fprintf(ctx->fp, \"\\t%s%.2s %s\\n\", (ins & 0x01000000u) ? \"bl\" : \"b\",\r\n\t    &\"eqnecsccmiplvsvchilsgeltgtle\"[2*(ins >> 28)], sym);\r\n  } else {\r\n    fprintf(stderr,\r\n\t    \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t    ins, sym);\r\n    exit(1);\r\n  }\r\n#elif LJ_TARGET_PPC || LJ_TARGET_PPCSPE\r\n#if LJ_TARGET_PS3\r\n#define TOCPREFIX \".\"\r\n#else\r\n#define TOCPREFIX \"\"\r\n#endif\r\n  if ((ins >> 26) == 16) {\r\n    fprintf(ctx->fp, \"\\t%s %d, %d, \" TOCPREFIX \"%s\\n\",\r\n\t    (ins & 1) ? \"bcl\" : \"bc\", (ins >> 21) & 31, (ins >> 16) & 31, sym);\r\n  } else if ((ins >> 26) == 18) {\r\n    fprintf(ctx->fp, \"\\t%s \" TOCPREFIX \"%s\\n\", (ins & 1) ? \"bl\" : \"b\", sym);\r\n  } else {\r\n    fprintf(stderr,\r\n\t    \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t    ins, sym);\r\n    exit(1);\r\n  }\r\n#elif LJ_TARGET_MIPS\r\n  fprintf(stderr,\r\n\t  \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t  ins, sym);\r\n  exit(1);\r\n#else\r\n#error \"missing relocation support for this architecture\"\r\n#endif\r\n}\r\n#endif\r\n\r\n#if LJ_TARGET_ARM\r\n#define ELFASM_PX\t\"%%\"\r\n#else\r\n#define ELFASM_PX\t\"@\"\r\n#endif\r\n\r\n/* Emit an assembler label. */\r\nstatic void emit_asm_label(BuildCtx *ctx, const char *name, int size, int isfunc)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n#if LJ_TARGET_PS3\r\n    if (!strncmp(name, \"lj_vm_\", 6) &&\r\n\tstrcmp(name, ctx->beginsym) &&\r\n\t!strstr(name, \"hook\")) {\r\n      fprintf(ctx->fp,\r\n\t\"\\n\\t.globl %s\\n\"\r\n\t\"\\t.section \\\".opd\\\",\\\"aw\\\"\\n\"\r\n\t\"%s:\\n\"\r\n\t\"\\t.long .%s,.TOC.@tocbase32\\n\"\r\n\t\"\\t.size %s,8\\n\"\r\n\t\"\\t.previous\\n\"\r\n\t\"\\t.globl .%s\\n\"\r\n\t\"\\t.hidden .%s\\n\"\r\n\t\"\\t.type .%s, \" ELFASM_PX \"function\\n\"\r\n\t\"\\t.size .%s, %d\\n\"\r\n\t\".%s:\\n\",\r\n\tname, name, name, name, name, name, name, name, size, name);\r\n      break;\r\n    }\r\n#endif\r\n    fprintf(ctx->fp,\r\n      \"\\n\\t.globl %s\\n\"\r\n      \"\\t.hidden %s\\n\"\r\n      \"\\t.type %s, \" ELFASM_PX \"%s\\n\"\r\n      \"\\t.size %s, %d\\n\"\r\n      \"%s:\\n\",\r\n      name, name, name, isfunc ? \"function\" : \"object\", name, size, name);\r\n    break;\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\n\\t.globl %s\\n\", name);\r\n    if (isfunc)\r\n      fprintf(ctx->fp, \"\\t.def %s; .scl 3; .type 32; .endef\\n\", name);\r\n    fprintf(ctx->fp, \"%s:\\n\", name);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp,\r\n      \"\\n\\t.private_extern %s\\n\"\r\n      \"%s:\\n\", name, name);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n/* Emit alignment. */\r\nstatic void emit_asm_align(BuildCtx *ctx, int bits)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.p2align %d\\n\", bits);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp, \"\\t.align %d\\n\", bits);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Emit assembler source code. */\r\nvoid emit_asm(BuildCtx *ctx)\r\n{\r\n  int i, rel;\r\n\r\n  fprintf(ctx->fp, \"\\t.file \\\"buildvm_%s.dasc\\\"\\n\", ctx->dasm_arch);\r\n  fprintf(ctx->fp, \"\\t.text\\n\");\r\n  emit_asm_align(ctx, 4);\r\n\r\n#if LJ_TARGET_PS3\r\n  emit_asm_label(ctx, ctx->beginsym, ctx->codesz, 0);\r\n#else\r\n  emit_asm_label(ctx, ctx->beginsym, 0, 0);\r\n#endif\r\n  if (ctx->mode != BUILD_machasm)\r\n    fprintf(ctx->fp, \".Lbegin:\\n\");\r\n\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND\r\n  /* This should really be moved into buildvm_arm.dasc. */\r\n  fprintf(ctx->fp,\r\n\t  \".fnstart\\n\"\r\n\t  \".save {r4, r5, r6, r7, r8, r9, r10, r11, lr}\\n\"\r\n\t  \".pad #28\\n\");\r\n#endif\r\n#if LJ_TARGET_MIPS\r\n  fprintf(ctx->fp, \".set nomips16\\n.abicalls\\n.set noreorder\\n.set nomacro\\n\");\r\n#endif\r\n\r\n  for (i = rel = 0; i < ctx->nsym; i++) {\r\n    int32_t ofs = ctx->sym[i].ofs;\r\n    int32_t next = ctx->sym[i+1].ofs;\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND && LJ_HASFFI\r\n    if (!strcmp(ctx->sym[i].name, \"lj_vm_ffi_call\"))\r\n      fprintf(ctx->fp,\r\n\t      \".globl lj_err_unwind_arm\\n\"\r\n\t      \".personality lj_err_unwind_arm\\n\"\r\n\t      \".fnend\\n\"\r\n\t      \".fnstart\\n\"\r\n\t      \".save {r4, r5, r11, lr}\\n\"\r\n\t      \".setfp r11, sp\\n\");\r\n#endif\r\n    emit_asm_label(ctx, ctx->sym[i].name, next - ofs, 1);\r\n    while (rel < ctx->nreloc && ctx->reloc[rel].ofs <= next) {\r\n      BuildReloc *r = &ctx->reloc[rel];\r\n      int n = r->ofs - ofs;\r\n#if LJ_TARGET_X86ORX64\r\n      if (ctx->mode == BUILD_machasm && r->type != 0) {\r\n\temit_asm_reloc_mach(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);\r\n      } else {\r\n\temit_asm_bytes(ctx, ctx->code+ofs, n);\r\n\temit_asm_reloc(ctx, r->type, ctx->relocsym[r->sym]);\r\n      }\r\n      ofs += n+4;\r\n#else\r\n      emit_asm_wordreloc(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);\r\n      ofs += n;\r\n#endif\r\n      rel++;\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    emit_asm_bytes(ctx, ctx->code+ofs, next-ofs);\r\n#else\r\n    emit_asm_words(ctx, ctx->code+ofs, next-ofs);\r\n#endif\r\n  }\r\n\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND\r\n  fprintf(ctx->fp,\r\n#if !LJ_HASFFI\r\n\t  \".globl lj_err_unwind_arm\\n\"\r\n\t  \".personality lj_err_unwind_arm\\n\"\r\n#endif\r\n\t  \".fnend\\n\");\r\n#endif\r\n\r\n  fprintf(ctx->fp, \"\\n\");\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n#if !(LJ_TARGET_PS3 || LJ_TARGET_PSVITA)\r\n    fprintf(ctx->fp, \"\\t.section .note.GNU-stack,\\\"\\\",\" ELFASM_PX \"progbits\\n\");\r\n#endif\r\n#if LJ_TARGET_PPCSPE\r\n    /* Soft-float ABI + SPE. */\r\n    fprintf(ctx->fp, \"\\t.gnu_attribute 4, 2\\n\\t.gnu_attribute 8, 3\\n\");\r\n#elif LJ_TARGET_PPC && !LJ_TARGET_PS3\r\n    /* Hard-float ABI. */\r\n    fprintf(ctx->fp, \"\\t.gnu_attribute 4, 1\\n\");\r\n#endif\r\n    /* fallthrough */\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.ident \\\"%s\\\"\\n\", ctx->dasm_ident);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp,\r\n      \"\\t.cstring\\n\"\r\n      \"\\t.ascii \\\"%s\\\\0\\\"\\n\", ctx->dasm_ident);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n  fprintf(ctx->fp, \"\\n\");\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm_fold.c",
    "content": "/*\r\n** LuaJIT VM builder: IR folding hash table generator.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n\r\n/* Context for the folding hash table generator. */\r\nstatic int lineno;\r\nstatic int funcidx;\r\nstatic uint32_t foldkeys[BUILD_MAX_FOLD];\r\nstatic uint32_t nkeys;\r\n\r\n/* Try to fill the hash table with keys using the hash parameters. */\r\nstatic int tryhash(uint32_t *htab, uint32_t sz, uint32_t r, int dorol)\r\n{\r\n  uint32_t i;\r\n  if (dorol && ((r & 31) == 0 || (r>>5) == 0))\r\n    return 0;  /* Avoid zero rotates. */\r\n  memset(htab, 0xff, (sz+1)*sizeof(uint32_t));\r\n  for (i = 0; i < nkeys; i++) {\r\n    uint32_t key = foldkeys[i];\r\n    uint32_t k = key & 0xffffff;\r\n    uint32_t h = (dorol ? lj_rol(lj_rol(k, r>>5) - k, r&31) :\r\n\t\t\t  (((k << (r>>5)) - k) << (r&31))) % sz;\r\n    if (htab[h] != 0xffffffff) {  /* Collision on primary slot. */\r\n      if (htab[h+1] != 0xffffffff) {  /* Collision on secondary slot. */\r\n\t/* Try to move the colliding key, if possible. */\r\n\tif (h < sz-1 && htab[h+2] == 0xffffffff) {\r\n\t  uint32_t k2 = htab[h+1] & 0xffffff;\r\n\t  uint32_t h2 = (dorol ? lj_rol(lj_rol(k2, r>>5) - k2, r&31) :\r\n\t\t\t\t (((k2 << (r>>5)) - k2) << (r&31))) % sz;\r\n\t  if (h2 != h+1) return 0;  /* Cannot resolve collision. */\r\n\t  htab[h+2] = htab[h+1];  /* Move colliding key to secondary slot. */\r\n\t} else {\r\n\t  return 0;  /* Collision. */\r\n\t}\r\n      }\r\n      htab[h+1] = key;\r\n    } else {\r\n      htab[h] = key;\r\n    }\r\n  }\r\n  return 1;  /* Success, all keys could be stored. */\r\n}\r\n\r\n/* Print the generated hash table. */\r\nstatic void printhash(BuildCtx *ctx, uint32_t *htab, uint32_t sz)\r\n{\r\n  uint32_t i;\r\n  fprintf(ctx->fp, \"static const uint32_t fold_hash[%d] = {\\n0x%08x\",\r\n\t  sz+1, htab[0]);\r\n  for (i = 1; i < sz+1; i++)\r\n    fprintf(ctx->fp, \",\\n0x%08x\", htab[i]);\r\n  fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n}\r\n\r\n/* Exhaustive search for the shortest semi-perfect hash table. */\r\nstatic void makehash(BuildCtx *ctx)\r\n{\r\n  uint32_t htab[BUILD_MAX_FOLD*2+1];\r\n  uint32_t sz, r;\r\n  /* Search for the smallest hash table with an odd size. */\r\n  for (sz = (nkeys|1); sz < BUILD_MAX_FOLD*2; sz += 2) {\r\n    /* First try all shift hash combinations. */\r\n    for (r = 0; r < 32*32; r++) {\r\n      if (tryhash(htab, sz, r, 0)) {\r\n\tprinthash(ctx, htab, sz);\r\n\tfprintf(ctx->fp,\r\n\t\t\"#define fold_hashkey(k)\\t(((((k)<<%u)-(k))<<%u)%%%u)\\n\\n\",\r\n\t\tr>>5, r&31, sz);\r\n\treturn;\r\n      }\r\n    }\r\n    /* Then try all rotate hash combinations. */\r\n    for (r = 0; r < 32*32; r++) {\r\n      if (tryhash(htab, sz, r, 1)) {\r\n\tprinthash(ctx, htab, sz);\r\n\tfprintf(ctx->fp,\r\n\t  \"#define fold_hashkey(k)\\t(lj_rol(lj_rol((k),%u)-(k),%u)%%%u)\\n\\n\",\r\n\t\tr>>5, r&31, sz);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  fprintf(stderr, \"Error: search for perfect hash failed\\n\");\r\n  exit(1);\r\n}\r\n\r\n/* Parse one token of a fold rule. */\r\nstatic uint32_t nexttoken(char **pp, int allowlit, int allowany)\r\n{\r\n  char *p = *pp;\r\n  if (p) {\r\n    uint32_t i;\r\n    char *q = strchr(p, ' ');\r\n    if (q) *q++ = '\\0';\r\n    *pp = q;\r\n    if (allowlit && !strncmp(p, \"IRFPM_\", 6)) {\r\n      for (i = 0; irfpm_names[i]; i++)\r\n\tif (!strcmp(irfpm_names[i], p+6))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRFL_\", 5)) {\r\n      for (i = 0; irfield_names[i]; i++)\r\n\tif (!strcmp(irfield_names[i], p+5))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRCALL_\", 7)) {\r\n      for (i = 0; ircall_names[i]; i++)\r\n\tif (!strcmp(ircall_names[i], p+7))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRCONV_\", 7)) {\r\n      for (i = 0; irt_names[i]; i++) {\r\n\tconst char *r = strchr(p+7, '_');\r\n\tif (r && !strncmp(irt_names[i], p+7, r-(p+7))) {\r\n\t  uint32_t j;\r\n\t  for (j = 0; irt_names[j]; j++)\r\n\t    if (!strcmp(irt_names[j], r+1))\r\n\t      return (i << 5) + j;\r\n\t}\r\n      }\r\n    } else if (allowlit && *p >= '0' && *p <= '9') {\r\n      for (i = 0; *p >= '0' && *p <= '9'; p++)\r\n\ti = i*10 + (*p - '0');\r\n      if (*p == '\\0')\r\n\treturn i;\r\n    } else if (allowany && !strcmp(\"any\", p)) {\r\n      return allowany;\r\n    } else {\r\n      for (i = 0; ir_names[i]; i++)\r\n\tif (!strcmp(ir_names[i], p))\r\n\t  return i;\r\n    }\r\n    fprintf(stderr, \"Error: bad fold definition token \\\"%s\\\" at line %d\\n\", p, lineno);\r\n    exit(1);\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Parse a fold rule. */\r\nstatic void foldrule(char *p)\r\n{\r\n  uint32_t op = nexttoken(&p, 0, 0);\r\n  uint32_t left = nexttoken(&p, 0, 0x7f);\r\n  uint32_t right = nexttoken(&p, 1, 0x3ff);\r\n  uint32_t key = (funcidx << 24) | (op << 17) | (left << 10) | right;\r\n  uint32_t i;\r\n  if (nkeys >= BUILD_MAX_FOLD) {\r\n    fprintf(stderr, \"Error: too many fold rules, increase BUILD_MAX_FOLD.\\n\");\r\n    exit(1);\r\n  }\r\n  /* Simple insertion sort to detect duplicates. */\r\n  for (i = nkeys; i > 0; i--) {\r\n    if ((foldkeys[i-1]&0xffffff) < (key & 0xffffff))\r\n      break;\r\n    if ((foldkeys[i-1]&0xffffff) == (key & 0xffffff)) {\r\n      fprintf(stderr, \"Error: duplicate fold definition at line %d\\n\", lineno);\r\n      exit(1);\r\n    }\r\n    foldkeys[i] = foldkeys[i-1];\r\n  }\r\n  foldkeys[i] = key;\r\n  nkeys++;\r\n}\r\n\r\n/* Emit C source code for IR folding hash table. */\r\nvoid emit_fold(BuildCtx *ctx)\r\n{\r\n  char buf[256];  /* We don't care about analyzing lines longer than that. */\r\n  const char *fname = ctx->args[0];\r\n  FILE *fp;\r\n\r\n  if (fname == NULL) {\r\n    fprintf(stderr, \"Error: missing input filename\\n\");\r\n    exit(1);\r\n  }\r\n\r\n  if (fname[0] == '-' && fname[1] == '\\0') {\r\n    fp = stdin;\r\n  } else {\r\n    fp = fopen(fname, \"r\");\r\n    if (!fp) {\r\n      fprintf(stderr, \"Error: cannot open input file '%s': %s\\n\",\r\n\t      fname, strerror(errno));\r\n      exit(1);\r\n    }\r\n  }\r\n\r\n  fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  fprintf(ctx->fp, \"static const FoldFunc fold_func[] = {\\n\");\r\n\r\n  lineno = 0;\r\n  funcidx = 0;\r\n  nkeys = 0;\r\n  while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n    lineno++;\r\n    /* The prefix must be at the start of a line, otherwise it's ignored. */\r\n    if (!strncmp(buf, FOLDDEF_PREFIX, sizeof(FOLDDEF_PREFIX)-1)) {\r\n      char *p = buf+sizeof(FOLDDEF_PREFIX)-1;\r\n      char *q = strchr(p, ')');\r\n      if (p[0] == '(' && q) {\r\n\tp++;\r\n\t*q = '\\0';\r\n\tfoldrule(p);\r\n      } else if ((p[0] == 'F' || p[0] == 'X') && p[1] == '(' && q) {\r\n\tp += 2;\r\n\t*q = '\\0';\r\n\tif (funcidx)\r\n\t  fprintf(ctx->fp, \",\\n\");\r\n\tif (p[-2] == 'X')\r\n\t  fprintf(ctx->fp, \"  %s\", p);\r\n\telse\r\n\t  fprintf(ctx->fp, \"  fold_%s\", p);\r\n\tfuncidx++;\r\n      } else {\r\n\tbuf[strlen(buf)-1] = '\\0';\r\n\tfprintf(stderr, \"Error: unknown fold definition tag %s%s at line %d\\n\",\r\n\t\tFOLDDEF_PREFIX, p, lineno);\r\n\texit(1);\r\n      }\r\n    }\r\n  }\r\n  fclose(fp);\r\n  fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n\r\n  makehash(ctx);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm_lib.c",
    "content": "/*\r\n** LuaJIT VM builder: library definition compiler.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* Context for library definitions. */\r\nstatic uint8_t obuf[8192];\r\nstatic uint8_t *optr;\r\nstatic char modname[80];\r\nstatic size_t modnamelen;\r\nstatic char funcname[80];\r\nstatic int modstate, regfunc;\r\nstatic int ffid, recffid, ffasmfunc;\r\n\r\nenum {\r\n  REGFUNC_OK,\r\n  REGFUNC_NOREG,\r\n  REGFUNC_NOREGUV\r\n};\r\n\r\nstatic void libdef_name(const char *p, int kind)\r\n{\r\n  size_t n = strlen(p);\r\n  if (kind != LIBINIT_STRING) {\r\n    if (n > modnamelen && p[modnamelen] == '_' &&\r\n\t!strncmp(p, modname, modnamelen)) {\r\n      p += modnamelen+1;\r\n      n -= modnamelen+1;\r\n    }\r\n  }\r\n  if (n > LIBINIT_MAXSTR) {\r\n    fprintf(stderr, \"Error: string too long: '%s'\\n\",  p);\r\n    exit(1);\r\n  }\r\n  if (optr+1+n+2 > obuf+sizeof(obuf)) {  /* +2 for caller. */\r\n    fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n    exit(1);\r\n  }\r\n  *optr++ = (uint8_t)(n | kind);\r\n  memcpy(optr, p, n);\r\n  optr += n;\r\n}\r\n\r\nstatic void libdef_endmodule(BuildCtx *ctx)\r\n{\r\n  if (modstate != 0) {\r\n    char line[80];\r\n    const uint8_t *p;\r\n    int n;\r\n    if (modstate == 1)\r\n      fprintf(ctx->fp, \"  (lua_CFunction)0\");\r\n    fprintf(ctx->fp, \"\\n};\\n\");\r\n    fprintf(ctx->fp, \"static const uint8_t %s%s[] = {\\n\",\r\n\t    LABEL_PREFIX_LIBINIT, modname);\r\n    line[0] = '\\0';\r\n    for (n = 0, p = obuf; p < optr; p++) {\r\n      n += sprintf(line+n, \"%d,\", *p);\r\n      if (n >= 75) {\r\n\tfprintf(ctx->fp, \"%s\\n\", line);\r\n\tn = 0;\r\n\tline[0] = '\\0';\r\n      }\r\n    }\r\n    fprintf(ctx->fp, \"%s%d\\n};\\n#endif\\n\\n\", line, LIBINIT_END);\r\n  }\r\n}\r\n\r\nstatic void libdef_module(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    libdef_endmodule(ctx);\r\n    optr = obuf;\r\n    *optr++ = (uint8_t)ffid;\r\n    *optr++ = (uint8_t)ffasmfunc;\r\n    *optr++ = 0;  /* Hash table size. */\r\n    modstate = 1;\r\n    fprintf(ctx->fp, \"#ifdef %sMODULE_%s\\n\", LIBDEF_PREFIX, p);\r\n    fprintf(ctx->fp, \"#undef %sMODULE_%s\\n\", LIBDEF_PREFIX, p);\r\n    fprintf(ctx->fp, \"static const lua_CFunction %s%s[] = {\\n\",\r\n\t    LABEL_PREFIX_LIBCF, p);\r\n  }\r\n  modnamelen = strlen(p);\r\n  if (modnamelen > sizeof(modname)-1) {\r\n    fprintf(stderr, \"Error: module name too long: '%s'\\n\", p);\r\n    exit(1);\r\n  }\r\n  strcpy(modname, p);\r\n}\r\n\r\nstatic int find_ffofs(BuildCtx *ctx, const char *name)\r\n{\r\n  int i;\r\n  for (i = 0; i < ctx->nglob; i++) {\r\n    const char *gl = ctx->globnames[i];\r\n    if (gl[0] == 'f' && gl[1] == 'f' && gl[2] == '_' && !strcmp(gl+3, name)) {\r\n      return (int)((uint8_t *)ctx->glob[i] - ctx->code);\r\n    }\r\n  }\r\n  fprintf(stderr, \"Error: undefined fast function %s%s\\n\",\r\n\t  LABEL_PREFIX_FF, name);\r\n  exit(1);\r\n}\r\n\r\nstatic void libdef_func(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  if (arg != LIBINIT_CF)\r\n    ffasmfunc++;\r\n  if (ctx->mode == BUILD_libdef) {\r\n    if (modstate == 0) {\r\n      fprintf(stderr, \"Error: no module for function definition %s\\n\", p);\r\n      exit(1);\r\n    }\r\n    if (regfunc == REGFUNC_NOREG) {\r\n      if (optr+1 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_FFID;\r\n    } else {\r\n      if (arg != LIBINIT_ASM_) {\r\n\tif (modstate != 1) fprintf(ctx->fp, \",\\n\");\r\n\tmodstate = 2;\r\n\tfprintf(ctx->fp, \"  %s%s\", arg ? LABEL_PREFIX_FFH : LABEL_PREFIX_CF, p);\r\n      }\r\n      if (regfunc != REGFUNC_NOREGUV) obuf[2]++;  /* Bump hash table size. */\r\n      libdef_name(regfunc == REGFUNC_NOREGUV ? \"\" : p, arg);\r\n    }\r\n  } else if (ctx->mode == BUILD_ffdef) {\r\n    fprintf(ctx->fp, \"FFDEF(%s)\\n\", p);\r\n  } else if (ctx->mode == BUILD_recdef) {\r\n    if (strlen(p) > sizeof(funcname)-1) {\r\n      fprintf(stderr, \"Error: function name too long: '%s'\\n\", p);\r\n      exit(1);\r\n    }\r\n    strcpy(funcname, p);\r\n  } else if (ctx->mode == BUILD_vmdef) {\r\n    int i;\r\n    for (i = 1; p[i] && modname[i-1]; i++)\r\n      if (p[i] == '_') p[i] = '.';\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", p);\r\n  } else if (ctx->mode == BUILD_bcdef) {\r\n    if (arg != LIBINIT_CF)\r\n      fprintf(ctx->fp, \",\\n%d\", find_ffofs(ctx, p));\r\n  }\r\n  ffid++;\r\n  regfunc = REGFUNC_OK;\r\n}\r\n\r\nstatic uint32_t find_rec(char *name)\r\n{\r\n  char *p = (char *)obuf;\r\n  uint32_t n;\r\n  for (n = 2; *p; n++) {\r\n    if (strcmp(p, name) == 0)\r\n      return n;\r\n    p += strlen(p)+1;\r\n  }\r\n  if (p+strlen(name)+1 >= (char *)obuf+sizeof(obuf)) {\r\n    fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n    exit(1);\r\n  }\r\n  strcpy(p, name);\r\n  return n;\r\n}\r\n\r\nstatic void libdef_rec(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_recdef) {\r\n    char *q;\r\n    uint32_t n;\r\n    for (; recffid+1 < ffid; recffid++)\r\n      fprintf(ctx->fp, \",\\n0\");\r\n    recffid = ffid;\r\n    if (*p == '.') p = funcname;\r\n    q = strchr(p, ' ');\r\n    if (q) *q++ = '\\0';\r\n    n = find_rec(p);\r\n    if (q)\r\n      fprintf(ctx->fp, \",\\n0x%02x00+(%s)\", n, q);\r\n    else\r\n      fprintf(ctx->fp, \",\\n0x%02x00\", n);\r\n  }\r\n}\r\n\r\nstatic void memcpy_endian(void *dst, void *src, size_t n)\r\n{\r\n  union { uint8_t b; uint32_t u; } host_endian;\r\n  host_endian.u = 1;\r\n  if (host_endian.b == LJ_ENDIAN_SELECT(1, 0)) {\r\n    memcpy(dst, src, n);\r\n  } else {\r\n    size_t i;\r\n    for (i = 0; i < n; i++)\r\n      ((uint8_t *)dst)[i] = ((uint8_t *)src)[n-i-1];\r\n  }\r\n}\r\n\r\nstatic void libdef_push(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    int len = (int)strlen(p);\r\n    if (*p == '\"') {\r\n      if (len > 1 && p[len-1] == '\"') {\r\n\tp[len-1] = '\\0';\r\n\tlibdef_name(p+1, LIBINIT_STRING);\r\n\treturn;\r\n      }\r\n    } else if (*p >= '0' && *p <= '9') {\r\n      char *ep;\r\n      double d = strtod(p, &ep);\r\n      if (*ep == '\\0') {\r\n\tif (optr+1+sizeof(double) > obuf+sizeof(obuf)) {\r\n\t  fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\t  exit(1);\r\n\t}\r\n\t*optr++ = LIBINIT_NUMBER;\r\n\tmemcpy_endian(optr, &d, sizeof(double));\r\n\toptr += sizeof(double);\r\n\treturn;\r\n      }\r\n    } else if (!strcmp(p, \"lastcl\")) {\r\n      if (optr+1 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_LASTCL;\r\n      return;\r\n    } else if (len > 4 && !strncmp(p, \"top-\", 4)) {\r\n      if (optr+2 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_COPY;\r\n      *optr++ = (uint8_t)atoi(p+4);\r\n      return;\r\n    }\r\n    fprintf(stderr, \"Error: bad value for %sPUSH(%s)\\n\", LIBDEF_PREFIX, p);\r\n    exit(1);\r\n  }\r\n}\r\n\r\nstatic void libdef_set(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    if (p[0] == '!' && p[1] == '\\0') p[0] = '\\0';  /* Set env. */\r\n    libdef_name(p, LIBINIT_STRING);\r\n    *optr++ = LIBINIT_SET;\r\n    obuf[2]++;  /* Bump hash table size. */\r\n  }\r\n}\r\n\r\nstatic void libdef_regfunc(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(ctx); UNUSED(p);\r\n  regfunc = arg;\r\n}\r\n\r\ntypedef void (*LibDefFunc)(BuildCtx *ctx, char *p, int arg);\r\n\r\ntypedef struct LibDefHandler {\r\n  const char *suffix;\r\n  const char *stop;\r\n  const LibDefFunc func;\r\n  const int arg;\r\n} LibDefHandler;\r\n\r\nstatic const LibDefHandler libdef_handlers[] = {\r\n  { \"MODULE_\",\t\" \\t\\r\\n\",\tlibdef_module,\t\t0 },\r\n  { \"CF(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_CF },\r\n  { \"ASM(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_ASM },\r\n  { \"ASM_(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_ASM_ },\r\n  { \"REC(\",\t\")\",\t\tlibdef_rec,\t\t0 },\r\n  { \"PUSH(\",\t\")\",\t\tlibdef_push,\t\t0 },\r\n  { \"SET(\",\t\")\",\t\tlibdef_set,\t\t0 },\r\n  { \"NOREGUV\",\tNULL,\t\tlibdef_regfunc,\t\tREGFUNC_NOREGUV },\r\n  { \"NOREG\",\tNULL,\t\tlibdef_regfunc,\t\tREGFUNC_NOREG },\r\n  { NULL,\tNULL,\t\t(LibDefFunc)0,\t\t0 }\r\n};\r\n\r\n/* Emit C source code for library function definitions. */\r\nvoid emit_lib(BuildCtx *ctx)\r\n{\r\n  const char *fname;\r\n\r\n  if (ctx->mode == BUILD_ffdef || ctx->mode == BUILD_libdef ||\r\n      ctx->mode == BUILD_recdef)\r\n    fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  else if (ctx->mode == BUILD_vmdef)\r\n    fprintf(ctx->fp, \"ffnames = {\\n[0]=\\\"Lua\\\",\\n\\\"C\\\",\\n\");\r\n  if (ctx->mode == BUILD_recdef)\r\n    fprintf(ctx->fp, \"static const uint16_t recff_idmap[] = {\\n0,\\n0x0100\");\r\n  recffid = ffid = FF_C+1;\r\n  ffasmfunc = 0;\r\n\r\n  while ((fname = *ctx->args++)) {\r\n    char buf[256];  /* We don't care about analyzing lines longer than that. */\r\n    FILE *fp;\r\n    if (fname[0] == '-' && fname[1] == '\\0') {\r\n      fp = stdin;\r\n    } else {\r\n      fp = fopen(fname, \"r\");\r\n      if (!fp) {\r\n\tfprintf(stderr, \"Error: cannot open input file '%s': %s\\n\",\r\n\t\tfname, strerror(errno));\r\n\texit(1);\r\n      }\r\n    }\r\n    modstate = 0;\r\n    regfunc = REGFUNC_OK;\r\n    while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n      char *p;\r\n      /* Simplistic pre-processor. Only handles top-level #if/#endif. */\r\n      if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {\r\n\tint ok = 1;\r\n\tif (!strcmp(buf, \"#if LJ_52\\n\"))\r\n\t  ok = LJ_52;\r\n\telse if (!strcmp(buf, \"#if LJ_HASJIT\\n\"))\r\n\t  ok = LJ_HASJIT;\r\n\telse if (!strcmp(buf, \"#if LJ_HASFFI\\n\"))\r\n\t  ok = LJ_HASFFI;\r\n\tif (!ok) {\r\n\t  int lvl = 1;\r\n\t  while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n\t    if (buf[0] == '#' && buf[1] == 'e' && buf[2] == 'n') {\r\n\t      if (--lvl == 0) break;\r\n\t    } else if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {\r\n\t      lvl++;\r\n\t    }\r\n\t  }\r\n\t  continue;\r\n\t}\r\n      }\r\n      for (p = buf; (p = strstr(p, LIBDEF_PREFIX)) != NULL; ) {\r\n\tconst LibDefHandler *ldh;\r\n\tp += sizeof(LIBDEF_PREFIX)-1;\r\n\tfor (ldh = libdef_handlers; ldh->suffix != NULL; ldh++) {\r\n\t  size_t n, len = strlen(ldh->suffix);\r\n\t  if (!strncmp(p, ldh->suffix, len)) {\r\n\t    p += len;\r\n\t    n = ldh->stop ? strcspn(p, ldh->stop) : 0;\r\n\t    if (!p[n]) break;\r\n\t    p[n] = '\\0';\r\n\t    ldh->func(ctx, p, ldh->arg);\r\n\t    p += n+1;\r\n\t    break;\r\n\t  }\r\n\t}\r\n\tif (ldh->suffix == NULL) {\r\n\t  buf[strlen(buf)-1] = '\\0';\r\n\t  fprintf(stderr, \"Error: unknown library definition tag %s%s\\n\",\r\n\t\t  LIBDEF_PREFIX, p);\r\n\t  exit(1);\r\n\t}\r\n      }\r\n    }\r\n    fclose(fp);\r\n    if (ctx->mode == BUILD_libdef) {\r\n      libdef_endmodule(ctx);\r\n    }\r\n  }\r\n\r\n  if (ctx->mode == BUILD_ffdef) {\r\n    fprintf(ctx->fp, \"\\n#undef FFDEF\\n\\n\");\r\n    fprintf(ctx->fp,\r\n      \"#ifndef FF_NUM_ASMFUNC\\n#define FF_NUM_ASMFUNC %d\\n#endif\\n\\n\",\r\n      ffasmfunc);\r\n  } else if (ctx->mode == BUILD_vmdef) {\r\n    fprintf(ctx->fp, \"}\\n\\n\");\r\n  } else if (ctx->mode == BUILD_bcdef) {\r\n    int i;\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n    fprintf(ctx->fp, \"LJ_DATADEF const uint16_t lj_bc_mode[] = {\\n\");\r\n    fprintf(ctx->fp, \"BCDEF(BCMODE)\\n\");\r\n    for (i = ffasmfunc-1; i > 0; i--)\r\n      fprintf(ctx->fp, \"BCMODE_FF,\\n\");\r\n    fprintf(ctx->fp, \"BCMODE_FF\\n};\\n\\n\");\r\n  } else if (ctx->mode == BUILD_recdef) {\r\n    char *p = (char *)obuf;\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n    fprintf(ctx->fp, \"static const RecordFunc recff_func[] = {\\n\"\r\n\t    \"recff_nyi,\\n\"\r\n\t    \"recff_c\");\r\n    while (*p) {\r\n      fprintf(ctx->fp, \",\\nrecff_%s\", p);\r\n      p += strlen(p)+1;\r\n    }\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/buildvm_peobj.c",
    "content": "/*\r\n** LuaJIT VM builder: PE object emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Only used for building on Windows, since we cannot assume the presence\r\n** of a suitable assembler. The host and target byte order must match.\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_bc.h\"\r\n\r\n#if LJ_TARGET_X86ORX64 || LJ_TARGET_PPC\r\n\r\n/* Context for PE object emitter. */\r\nstatic char *strtab;\r\nstatic size_t strtabofs;\r\n\r\n/* -- PE object definitions ----------------------------------------------- */\r\n\r\n/* PE header. */\r\ntypedef struct PEheader {\r\n  uint16_t arch;\r\n  uint16_t nsects;\r\n  uint32_t time;\r\n  uint32_t symtabofs;\r\n  uint32_t nsyms;\r\n  uint16_t opthdrsz;\r\n  uint16_t flags;\r\n} PEheader;\r\n\r\n/* PE section. */\r\ntypedef struct PEsection {\r\n  char name[8];\r\n  uint32_t vsize;\r\n  uint32_t vaddr;\r\n  uint32_t size;\r\n  uint32_t ofs;\r\n  uint32_t relocofs;\r\n  uint32_t lineofs;\r\n  uint16_t nreloc;\r\n  uint16_t nline;\r\n  uint32_t flags;\r\n} PEsection;\r\n\r\n/* PE relocation. */\r\ntypedef struct PEreloc {\r\n  uint32_t vaddr;\r\n  uint32_t symidx;\r\n  uint16_t type;\r\n} PEreloc;\r\n\r\n/* Cannot use sizeof, because it pads up to the max. alignment. */\r\n#define PEOBJ_RELOC_SIZE\t(4+4+2)\r\n\r\n/* PE symbol table entry. */\r\ntypedef struct PEsym {\r\n  union {\r\n    char name[8];\r\n    uint32_t nameref[2];\r\n  } n;\r\n  uint32_t value;\r\n  int16_t sect;\r\n  uint16_t type;\r\n  uint8_t scl;\r\n  uint8_t naux;\r\n} PEsym;\r\n\r\n/* PE symbol table auxiliary entry for a section. */\r\ntypedef struct PEsymaux {\r\n  uint32_t size;\r\n  uint16_t nreloc;\r\n  uint16_t nline;\r\n  uint32_t cksum;\r\n  uint16_t assoc;\r\n  uint8_t comdatsel;\r\n  uint8_t unused[3];\r\n} PEsymaux;\r\n\r\n/* Cannot use sizeof, because it pads up to the max. alignment. */\r\n#define PEOBJ_SYM_SIZE\t(8+4+2+2+1+1)\r\n\r\n/* PE object CPU specific defines. */\r\n#if LJ_TARGET_X86\r\n#define PEOBJ_ARCH_TARGET\t0x014c\r\n#define PEOBJ_RELOC_REL32\t0x14  /* MS: REL32, GNU: DISP32. */\r\n#define PEOBJ_RELOC_DIR32\t0x06\r\n#define PEOBJ_RELOC_OFS\t\t0\r\n#define PEOBJ_TEXT_FLAGS\t0x60500020  /* 60=r+x, 50=align16, 20=code. */\r\n#elif LJ_TARGET_X64\r\n#define PEOBJ_ARCH_TARGET\t0x8664\r\n#define PEOBJ_RELOC_REL32\t0x04  /* MS: REL32, GNU: DISP32. */\r\n#define PEOBJ_RELOC_DIR32\t0x02\r\n#define PEOBJ_RELOC_ADDR32NB\t0x03\r\n#define PEOBJ_RELOC_OFS\t\t0\r\n#define PEOBJ_TEXT_FLAGS\t0x60500020  /* 60=r+x, 50=align16, 20=code. */\r\n#elif LJ_TARGET_PPC\r\n#define PEOBJ_ARCH_TARGET\t0x01f2\r\n#define PEOBJ_RELOC_REL32\t0x06\r\n#define PEOBJ_RELOC_DIR32\t0x02\r\n#define PEOBJ_RELOC_OFS\t\t(-4)\r\n#define PEOBJ_TEXT_FLAGS\t0x60400020  /* 60=r+x, 40=align8, 20=code. */\r\n#endif\r\n\r\n/* Section numbers (0-based). */\r\nenum {\r\n  PEOBJ_SECT_ABS = -2,\r\n  PEOBJ_SECT_UNDEF = -1,\r\n  PEOBJ_SECT_TEXT,\r\n#if LJ_TARGET_X64\r\n  PEOBJ_SECT_PDATA,\r\n  PEOBJ_SECT_XDATA,\r\n#endif\r\n  PEOBJ_SECT_RDATA_Z,\r\n  PEOBJ_NSECTIONS\r\n};\r\n\r\n/* Symbol types. */\r\n#define PEOBJ_TYPE_NULL\t\t0\r\n#define PEOBJ_TYPE_FUNC\t\t0x20\r\n\r\n/* Symbol storage class. */\r\n#define PEOBJ_SCL_EXTERN\t2\r\n#define PEOBJ_SCL_STATIC\t3\r\n\r\n/* -- PE object emitter --------------------------------------------------- */\r\n\r\n/* Emit PE object symbol. */\r\nstatic void emit_peobj_sym(BuildCtx *ctx, const char *name, uint32_t value,\r\n\t\t\t   int sect, int type, int scl)\r\n{\r\n  PEsym sym;\r\n  size_t len = strlen(name);\r\n  if (!strtab) {  /* Pass 1: only calculate string table length. */\r\n    if (len > 8) strtabofs += len+1;\r\n    return;\r\n  }\r\n  if (len <= 8) {\r\n    memcpy(sym.n.name, name, len);\r\n    memset(sym.n.name+len, 0, 8-len);\r\n  } else {\r\n    sym.n.nameref[0] = 0;\r\n    sym.n.nameref[1] = (uint32_t)strtabofs;\r\n    memcpy(strtab + strtabofs, name, len);\r\n    strtab[strtabofs+len] = 0;\r\n    strtabofs += len+1;\r\n  }\r\n  sym.value = value;\r\n  sym.sect = (int16_t)(sect+1);  /* 1-based section number. */\r\n  sym.type = (uint16_t)type;\r\n  sym.scl = (uint8_t)scl;\r\n  sym.naux = 0;\r\n  owrite(ctx, &sym, PEOBJ_SYM_SIZE);\r\n}\r\n\r\n/* Emit PE object section symbol. */\r\nstatic void emit_peobj_sym_sect(BuildCtx *ctx, PEsection *pesect, int sect)\r\n{\r\n  PEsym sym;\r\n  PEsymaux aux;\r\n  if (!strtab) return;  /* Pass 1: no output. */\r\n  memcpy(sym.n.name, pesect[sect].name, 8);\r\n  sym.value = 0;\r\n  sym.sect = (int16_t)(sect+1);  /* 1-based section number. */\r\n  sym.type = PEOBJ_TYPE_NULL;\r\n  sym.scl = PEOBJ_SCL_STATIC;\r\n  sym.naux = 1;\r\n  owrite(ctx, &sym, PEOBJ_SYM_SIZE);\r\n  memset(&aux, 0, sizeof(PEsymaux));\r\n  aux.size = pesect[sect].size;\r\n  aux.nreloc = pesect[sect].nreloc;\r\n  owrite(ctx, &aux, PEOBJ_SYM_SIZE);\r\n}\r\n\r\n/* Emit Windows PE object file. */\r\nvoid emit_peobj(BuildCtx *ctx)\r\n{\r\n  PEheader pehdr;\r\n  PEsection pesect[PEOBJ_NSECTIONS];\r\n  uint32_t sofs;\r\n  int i, nrsym;\r\n  union { uint8_t b; uint32_t u; } host_endian;\r\n\r\n  sofs = sizeof(PEheader) + PEOBJ_NSECTIONS*sizeof(PEsection);\r\n\r\n  /* Fill in PE sections. */\r\n  memset(&pesect, 0, PEOBJ_NSECTIONS*sizeof(PEsection));\r\n  memcpy(pesect[PEOBJ_SECT_TEXT].name, \".text\", sizeof(\".text\")-1);\r\n  pesect[PEOBJ_SECT_TEXT].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_TEXT].size = (uint32_t)ctx->codesz);\r\n  pesect[PEOBJ_SECT_TEXT].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_TEXT].nreloc = (uint16_t)ctx->nreloc) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 60 = read+execute, 50 = align16, 20 = code. */\r\n  pesect[PEOBJ_SECT_TEXT].flags = PEOBJ_TEXT_FLAGS;\r\n\r\n#if LJ_TARGET_X64\r\n  memcpy(pesect[PEOBJ_SECT_PDATA].name, \".pdata\", sizeof(\".pdata\")-1);\r\n  pesect[PEOBJ_SECT_PDATA].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_PDATA].size = 6*4);\r\n  pesect[PEOBJ_SECT_PDATA].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_PDATA].nreloc = 6) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_PDATA].flags = 0x40300040;\r\n\r\n  memcpy(pesect[PEOBJ_SECT_XDATA].name, \".xdata\", sizeof(\".xdata\")-1);\r\n  pesect[PEOBJ_SECT_XDATA].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_XDATA].size = 8*2+4+6*2);  /* See below. */\r\n  pesect[PEOBJ_SECT_XDATA].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_XDATA].nreloc = 1) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_XDATA].flags = 0x40300040;\r\n#endif\r\n\r\n  memcpy(pesect[PEOBJ_SECT_RDATA_Z].name, \".rdata$Z\", sizeof(\".rdata$Z\")-1);\r\n  pesect[PEOBJ_SECT_RDATA_Z].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_RDATA_Z].size = (uint32_t)strlen(ctx->dasm_ident)+1);\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_RDATA_Z].flags = 0x40300040;\r\n\r\n  /* Fill in PE header. */\r\n  pehdr.arch = PEOBJ_ARCH_TARGET;\r\n  pehdr.nsects = PEOBJ_NSECTIONS;\r\n  pehdr.time = 0;  /* Timestamp is optional. */\r\n  pehdr.symtabofs = sofs;\r\n  pehdr.opthdrsz = 0;\r\n  pehdr.flags = 0;\r\n\r\n  /* Compute the size of the symbol table:\r\n  ** @feat.00 + nsections*2\r\n  ** + asm_start + nsym\r\n  ** + nrsym\r\n  */\r\n  nrsym = ctx->nrelocsym;\r\n  pehdr.nsyms = 1+PEOBJ_NSECTIONS*2 + 1+ctx->nsym + nrsym;\r\n#if LJ_TARGET_X64\r\n  pehdr.nsyms += 1;  /* Symbol for lj_err_unwind_win64. */\r\n#endif\r\n\r\n  /* Write PE object header and all sections. */\r\n  owrite(ctx, &pehdr, sizeof(PEheader));\r\n  owrite(ctx, &pesect, sizeof(PEsection)*PEOBJ_NSECTIONS);\r\n\r\n  /* Write .text section. */\r\n  host_endian.u = 1;\r\n  if (host_endian.b != LJ_ENDIAN_SELECT(1, 0)) {\r\n#if LJ_TARGET_PPC\r\n    uint32_t *p = (uint32_t *)ctx->code;\r\n    int n = (int)(ctx->codesz >> 2);\r\n    for (i = 0; i < n; i++, p++)\r\n      *p = lj_bswap(*p);  /* Byteswap .text section. */\r\n#else\r\n    fprintf(stderr, \"Error: different byte order for host and target\\n\");\r\n    exit(1);\r\n#endif\r\n  }\r\n  owrite(ctx, ctx->code, ctx->codesz);\r\n  for (i = 0; i < ctx->nreloc; i++) {\r\n    PEreloc reloc;\r\n    reloc.vaddr = (uint32_t)ctx->reloc[i].ofs + PEOBJ_RELOC_OFS;\r\n    reloc.symidx = 1+2+ctx->reloc[i].sym;  /* Reloc syms are after .text sym. */\r\n    reloc.type = ctx->reloc[i].type ? PEOBJ_RELOC_REL32 : PEOBJ_RELOC_DIR32;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n\r\n#if LJ_TARGET_X64\r\n  { /* Write .pdata section. */\r\n    uint32_t fcofs = (uint32_t)ctx->sym[ctx->nsym-1].ofs;\r\n    uint32_t pdata[3];  /* Start of .text, end of .text and .xdata. */\r\n    PEreloc reloc;\r\n    pdata[0] = 0; pdata[1] = fcofs; pdata[2] = 0;\r\n    owrite(ctx, &pdata, sizeof(pdata));\r\n    pdata[0] = fcofs; pdata[1] = (uint32_t)ctx->codesz; pdata[2] = 20;\r\n    owrite(ctx, &pdata, sizeof(pdata));\r\n    reloc.vaddr = 0; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 4; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 8; reloc.symidx = 1+2+nrsym+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 12; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 16; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 20; reloc.symidx = 1+2+nrsym+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n  { /* Write .xdata section. */\r\n    uint16_t xdata[8+2+6];\r\n    PEreloc reloc;\r\n    xdata[0] = 0x01|0x08|0x10;  /* Ver. 1, uhandler/ehandler, prolog size 0. */\r\n    xdata[1] = 0x0005;  /* Number of unwind codes, no frame pointer. */\r\n    xdata[2] = 0x4200;  /* Stack offset 4*8+8 = aword*5. */\r\n    xdata[3] = 0x3000;  /* Push rbx. */\r\n    xdata[4] = 0x6000;  /* Push rsi. */\r\n    xdata[5] = 0x7000;  /* Push rdi. */\r\n    xdata[6] = 0x5000;  /* Push rbp. */\r\n    xdata[7] = 0;  /* Alignment. */\r\n    xdata[8] = xdata[9] = 0;  /* Relocated address of exception handler. */\r\n    xdata[10] = 0x01;  /* Ver. 1, no handler, prolog size 0. */\r\n    xdata[11] = 0x1504;  /* Number of unwind codes, fp = rbp, fpofs = 16. */\r\n    xdata[12] = 0x0300;  /* set_fpreg. */\r\n    xdata[13] = 0x0200;  /* stack offset 0*8+8 = aword*1. */\r\n    xdata[14] = 0x3000;  /* Push rbx. */\r\n    xdata[15] = 0x5000;  /* Push rbp. */\r\n    owrite(ctx, &xdata, sizeof(xdata));\r\n    reloc.vaddr = 2*8; reloc.symidx = 1+2+nrsym+2+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n#endif\r\n\r\n  /* Write .rdata$Z section. */\r\n  owrite(ctx, ctx->dasm_ident, strlen(ctx->dasm_ident)+1);\r\n\r\n  /* Write symbol table. */\r\n  strtab = NULL;  /* 1st pass: collect string sizes. */\r\n  for (;;) {\r\n    strtabofs = 4;\r\n    /* Mark as SafeSEH compliant. */\r\n    emit_peobj_sym(ctx, \"@feat.00\", 1,\r\n\t\t   PEOBJ_SECT_ABS, PEOBJ_TYPE_NULL, PEOBJ_SCL_STATIC);\r\n\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_TEXT);\r\n    for (i = 0; i < nrsym; i++)\r\n      emit_peobj_sym(ctx, ctx->relocsym[i], 0,\r\n\t\t     PEOBJ_SECT_UNDEF, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n\r\n#if LJ_TARGET_X64\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_PDATA);\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_XDATA);\r\n    emit_peobj_sym(ctx, \"lj_err_unwind_win64\", 0,\r\n\t\t   PEOBJ_SECT_UNDEF, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n#endif\r\n\r\n    emit_peobj_sym(ctx, ctx->beginsym, 0,\r\n\t\t   PEOBJ_SECT_TEXT, PEOBJ_TYPE_NULL, PEOBJ_SCL_EXTERN);\r\n    for (i = 0; i < ctx->nsym; i++)\r\n      emit_peobj_sym(ctx, ctx->sym[i].name, (uint32_t)ctx->sym[i].ofs,\r\n\t\t     PEOBJ_SECT_TEXT, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_RDATA_Z);\r\n\r\n    if (strtab)\r\n      break;\r\n    /* 2nd pass: alloc strtab, write syms and copy strings. */\r\n    strtab = (char *)malloc(strtabofs);\r\n    *(uint32_t *)strtab = (uint32_t)strtabofs;\r\n  }\r\n\r\n  /* Write string table. */\r\n  owrite(ctx, strtab, strtabofs);\r\n}\r\n\r\n#else\r\n\r\nvoid emit_peobj(BuildCtx *ctx)\r\n{\r\n  UNUSED(ctx);\r\n  fprintf(stderr, \"Error: no PE object support for this target\\n\");\r\n  exit(1);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/genminilua.lua",
    "content": "----------------------------------------------------------------------------\r\n-- Lua script to generate a customized, minified version of Lua.\r\n-- The resulting 'minilua' is used for the build process of LuaJIT.\r\n----------------------------------------------------------------------------\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n\r\nlocal sub, match, gsub = string.sub, string.match, string.gsub\r\n\r\nlocal LUA_VERSION = \"5.1.5\"\r\nlocal LUA_SOURCE\r\n\r\nlocal function usage()\r\n  io.stderr:write(\"Usage: \", arg and arg[0] or \"genminilua\",\r\n\t\t  \" lua-\", LUA_VERSION, \"-source-dir\\n\")\r\n  os.exit(1)\r\nend\r\n\r\nlocal function find_sources()\r\n  LUA_SOURCE = arg and arg[1]\r\n  if not LUA_SOURCE then usage() end\r\n  if sub(LUA_SOURCE, -1) ~= \"/\" then LUA_SOURCE = LUA_SOURCE..\"/\" end\r\n  local fp = io.open(LUA_SOURCE .. \"lua.h\")\r\n  if not fp then\r\n    LUA_SOURCE = LUA_SOURCE..\"src/\"\r\n    fp = io.open(LUA_SOURCE .. \"lua.h\")\r\n    if not fp then usage() end\r\n  end\r\n  local all = fp:read(\"*a\")\r\n  fp:close()\r\n  if not match(all, 'LUA_RELEASE%s*\"Lua '..LUA_VERSION..'\"') then\r\n    io.stderr:write(\"Error: version mismatch\\n\")\r\n    usage()\r\n  end\r\nend\r\n\r\nlocal LUA_FILES = {\r\n\"lmem.c\", \"lobject.c\", \"ltm.c\", \"lfunc.c\", \"ldo.c\", \"lstring.c\", \"ltable.c\",\r\n\"lgc.c\", \"lstate.c\", \"ldebug.c\", \"lzio.c\", \"lopcodes.c\",\r\n\"llex.c\", \"lcode.c\", \"lparser.c\", \"lvm.c\", \"lapi.c\", \"lauxlib.c\",\r\n\"lbaselib.c\", \"ltablib.c\", \"liolib.c\", \"loslib.c\", \"lstrlib.c\", \"linit.c\",\r\n}\r\n\r\nlocal REMOVE_LIB = {}\r\ngsub([[\r\ncollectgarbage dofile gcinfo getfenv getmetatable load print rawequal rawset\r\nselect tostring xpcall\r\nforeach foreachi getn maxn setn\r\npopen tmpfile seek setvbuf __tostring\r\nclock date difftime execute getenv rename setlocale time tmpname\r\ndump gfind len reverse\r\nLUA_LOADLIBNAME LUA_MATHLIBNAME LUA_DBLIBNAME\r\n]], \"%S+\", function(name)\r\n  REMOVE_LIB[name] = true\r\nend)\r\n\r\nlocal REMOVE_EXTINC = { [\"<assert.h>\"] = true, [\"<locale.h>\"] = true, }\r\n\r\nlocal CUSTOM_MAIN = [[\r\ntypedef unsigned int UB;\r\nstatic UB barg(lua_State *L,int idx){\r\nunion{lua_Number n;U64 b;}bn;\r\nbn.n=lua_tonumber(L,idx)+6755399441055744.0;\r\nif (bn.n==0.0&&!lua_isnumber(L,idx))luaL_typerror(L,idx,\"number\");\r\nreturn(UB)bn.b;\r\n}\r\n#define BRET(b) lua_pushnumber(L,(lua_Number)(int)(b));return 1;\r\nstatic int tobit(lua_State *L){\r\nBRET(barg(L,1))}\r\nstatic int bnot(lua_State *L){\r\nBRET(~barg(L,1))}\r\nstatic int band(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b&=barg(L,i);BRET(b)}\r\nstatic int bor(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b|=barg(L,i);BRET(b)}\r\nstatic int bxor(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b^=barg(L,i);BRET(b)}\r\nstatic int lshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b<<n)}\r\nstatic int rshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b>>n)}\r\nstatic int arshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((int)b>>n)}\r\nstatic int rol(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b<<n)|(b>>(32-n)))}\r\nstatic int ror(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b>>n)|(b<<(32-n)))}\r\nstatic int bswap(lua_State *L){\r\nUB b=barg(L,1);b=(b>>24)|((b>>8)&0xff00)|((b&0xff00)<<8)|(b<<24);BRET(b)}\r\nstatic int tohex(lua_State *L){\r\nUB b=barg(L,1);\r\nint n=lua_isnone(L,2)?8:(int)barg(L,2);\r\nconst char *hexdigits=\"0123456789abcdef\";\r\nchar buf[8];\r\nint i;\r\nif(n<0){n=-n;hexdigits=\"0123456789ABCDEF\";}\r\nif(n>8)n=8;\r\nfor(i=(int)n;--i>=0;){buf[i]=hexdigits[b&15];b>>=4;}\r\nlua_pushlstring(L,buf,(size_t)n);\r\nreturn 1;\r\n}\r\nstatic const struct luaL_Reg bitlib[] = {\r\n{\"tobit\",tobit},\r\n{\"bnot\",bnot},\r\n{\"band\",band},\r\n{\"bor\",bor},\r\n{\"bxor\",bxor},\r\n{\"lshift\",lshift},\r\n{\"rshift\",rshift},\r\n{\"arshift\",arshift},\r\n{\"rol\",rol},\r\n{\"ror\",ror},\r\n{\"bswap\",bswap},\r\n{\"tohex\",tohex},\r\n{NULL,NULL}\r\n};\r\nint main(int argc, char **argv){\r\n  lua_State *L = luaL_newstate();\r\n  int i;\r\n  luaL_openlibs(L);\r\n  luaL_register(L, \"bit\", bitlib);\r\n  if (argc < 2) return sizeof(void *);\r\n  lua_createtable(L, 0, 1);\r\n  lua_pushstring(L, argv[1]);\r\n  lua_rawseti(L, -2, 0);\r\n  lua_setglobal(L, \"arg\");\r\n  if (luaL_loadfile(L, argv[1]))\r\n    goto err;\r\n  for (i = 2; i < argc; i++)\r\n    lua_pushstring(L, argv[i]);\r\n  if (lua_pcall(L, argc - 2, 0, 0)) {\r\n  err:\r\n    fprintf(stderr, \"Error: %s\\n\", lua_tostring(L, -1));\r\n    return 1;\r\n  }\r\n  lua_close(L);\r\n  return 0;\r\n}\r\n]]\r\n\r\nlocal function read_sources()\r\n  local t = {}\r\n  for i, name in ipairs(LUA_FILES) do\r\n    local fp = assert(io.open(LUA_SOURCE..name, \"r\"))\r\n    t[i] = fp:read(\"*a\")\r\n    assert(fp:close())\r\n  end\r\n  t[#t+1] = CUSTOM_MAIN\r\n  return table.concat(t)\r\nend\r\n\r\nlocal includes = {}\r\n\r\nlocal function merge_includes(src)\r\n  return gsub(src, '#include%s*\"([^\"]*)\"%s*\\n', function(name)\r\n    if includes[name] then return \"\" end\r\n    includes[name] = true\r\n    local fp = assert(io.open(LUA_SOURCE..name, \"r\"))\r\n    local src = fp:read(\"*a\")\r\n    assert(fp:close())\r\n    src = gsub(src, \"#ifndef%s+%w+_h\\n#define%s+%w+_h\\n\", \"\")\r\n    src = gsub(src, \"#endif%s*$\", \"\")\r\n    return merge_includes(src)\r\n  end)\r\nend\r\n\r\nlocal function get_license(src)\r\n  return match(src, \"/%*+\\n%* Copyright %(.-%*/\\n\")\r\nend\r\n\r\nlocal function fold_lines(src)\r\n  return gsub(src, \"\\\\\\n\", \" \")\r\nend\r\n\r\nlocal strings = {}\r\n\r\nlocal function save_str(str)\r\n  local n = #strings+1\r\n  strings[n] = str\r\n  return \"\\1\"..n..\"\\2\"\r\nend\r\n\r\nlocal function save_strings(src)\r\n  src = gsub(src, '\"[^\"\\n]*\"', save_str)\r\n  return gsub(src, \"'[^'\\n]*'\", save_str)\r\nend\r\n\r\nlocal function restore_strings(src)\r\n  return gsub(src, \"\\1(%d+)\\2\", function(numstr)\r\n    return strings[tonumber(numstr)]\r\n  end)\r\nend\r\n\r\nlocal function def_istrue(def)\r\n  return def == \"INT_MAX > 2147483640L\" or\r\n\t def == \"LUAI_BITSINT >= 32\" or\r\n\t def == \"SIZE_Bx < LUAI_BITSINT-1\" or\r\n\t def == \"cast\" or\r\n\t def == \"defined(LUA_CORE)\" or\r\n\t def == \"MINSTRTABSIZE\" or\r\n\t def == \"LUA_MINBUFFER\" or\r\n\t def == \"HARDSTACKTESTS\" or\r\n\t def == \"UNUSED\"\r\nend\r\n\r\nlocal head, defs = {[[\r\n#ifdef _MSC_VER\r\ntypedef unsigned __int64 U64;\r\n#else\r\ntypedef unsigned long long U64;\r\n#endif\r\nint _CRT_glob = 0;\r\n]]}, {}\r\n\r\nlocal function preprocess(src)\r\n  local t = { match(src, \"^(.-)#\") }\r\n  local lvl, on, oldon = 0, true, {}\r\n  for pp, def, txt in string.gmatch(src, \"#(%w+) *([^\\n]*)\\n([^#]*)\") do\r\n    if pp == \"if\" or pp == \"ifdef\" or pp == \"ifndef\" then\r\n      lvl = lvl + 1\r\n      oldon[lvl] = on\r\n      on = def_istrue(def)\r\n    elseif pp == \"else\" then\r\n      if oldon[lvl] then\r\n\tif on == false then on = true else on = false end\r\n      end\r\n    elseif pp == \"elif\" then\r\n      if oldon[lvl] then\r\n\ton = def_istrue(def)\r\n      end\r\n    elseif pp == \"endif\" then\r\n      on = oldon[lvl]\r\n      lvl = lvl - 1\r\n    elseif on then\r\n      if pp == \"include\" then\r\n\tif not head[def] and not REMOVE_EXTINC[def] then\r\n\t  head[def] = true\r\n\t  head[#head+1] = \"#include \"..def..\"\\n\"\r\n\tend\r\n      elseif pp == \"define\" then\r\n\tlocal k, sp, v = match(def, \"([%w_]+)(%s*)(.*)\")\r\n\tif k and not (sp == \"\" and sub(v, 1, 1) == \"(\") then\r\n\t  defs[k] = gsub(v, \"%a[%w_]*\", function(tok)\r\n\t    return defs[tok] or tok\r\n\t  end)\r\n\telse\r\n\t  t[#t+1] = \"#define \"..def..\"\\n\"\r\n\tend\r\n      elseif pp ~= \"undef\" then\r\n\terror(\"unexpected directive: \"..pp..\" \"..def)\r\n      end\r\n    end\r\n    if on then t[#t+1] = txt end\r\n  end\r\n  return gsub(table.concat(t), \"%a[%w_]*\", function(tok)\r\n    return defs[tok] or tok\r\n  end)\r\nend\r\n\r\nlocal function merge_header(src, license)\r\n  local hdr = string.format([[\r\n/* This is a heavily customized and minimized copy of Lua %s. */\r\n/* It's only used to build LuaJIT. It does NOT have all standard functions! */\r\n]], LUA_VERSION)\r\n  return hdr..license..table.concat(head)..src\r\nend\r\n\r\nlocal function strip_unused1(src)\r\n  return gsub(src, '(  {\"?([%w_]+)\"?,%s+%a[%w_]*},\\n)', function(line, func)\r\n    return REMOVE_LIB[func] and \"\" or line\r\n  end)\r\nend\r\n\r\nlocal function strip_unused2(src)\r\n  return gsub(src, \"Symbolic Execution.-}=\", \"\")\r\nend\r\n\r\nlocal function strip_unused3(src)\r\n  src = gsub(src, \"extern\", \"static\")\r\n  src = gsub(src, \"\\nstatic([^\\n]-)%(([^)]*)%)%(\", \"\\nstatic%1 %2(\")\r\n  src = gsub(src, \"#define lua_assert[^\\n]*\\n\", \"\")\r\n  src = gsub(src, \"lua_assert%b();?\", \"\")\r\n  src = gsub(src, \"default:\\n}\", \"default:;\\n}\")\r\n  src = gsub(src, \"lua_lock%b();\", \"\")\r\n  src = gsub(src, \"lua_unlock%b();\", \"\")\r\n  src = gsub(src, \"luai_threadyield%b();\", \"\")\r\n  src = gsub(src, \"luai_userstateopen%b();\", \"{}\")\r\n  src = gsub(src, \"luai_userstate%w+%b();\", \"\")\r\n  src = gsub(src, \"%(%(c==.*luaY_parser%)\", \"luaY_parser\")\r\n  src = gsub(src, \"trydecpoint%(ls,seminfo%)\",\r\n\t\t  \"luaX_lexerror(ls,\\\"malformed number\\\",TK_NUMBER)\")\r\n  src = gsub(src, \"int c=luaZ_lookahead%b();\", \"\")\r\n  src = gsub(src, \"luaL_register%(L,[^,]*,co_funcs%);\\nreturn 2;\",\r\n\t\t  \"return 1;\")\r\n  src = gsub(src, \"getfuncname%b():\", \"NULL:\")\r\n  src = gsub(src, \"getobjname%b():\", \"NULL:\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*%)\\n[^\\n]*\\n\", \"\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*%)%b{}\\n\", \"\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*&&\\n[^\\n]*%b{}\\n\", \"\")\r\n  src = gsub(src, \"(twoto%b()%()\", \"%1(size_t)\")\r\n  src = gsub(src, \"i<sizenode\", \"i<(int)sizenode\")\r\n  return gsub(src, \"\\n\\n+\", \"\\n\")\r\nend\r\n\r\nlocal function strip_comments(src)\r\n  return gsub(src, \"/%*.-%*/\", \" \")\r\nend\r\n\r\nlocal function strip_whitespace(src)\r\n  src = gsub(src, \"^%s+\", \"\")\r\n  src = gsub(src, \"%s*\\n%s*\", \"\\n\")\r\n  src = gsub(src, \"[ \\t]+\", \" \")\r\n  src = gsub(src, \"(%W) \", \"%1\")\r\n  return gsub(src, \" (%W)\", \"%1\")\r\nend\r\n\r\nlocal function rename_tokens1(src)\r\n  src = gsub(src, \"getline\", \"getline_\")\r\n  src = gsub(src, \"struct ([%w_]+)\", \"ZX%1\")\r\n  return gsub(src, \"union ([%w_]+)\", \"ZY%1\")\r\nend\r\n\r\nlocal function rename_tokens2(src)\r\n  src = gsub(src, \"ZX([%w_]+)\", \"struct %1\")\r\n  return gsub(src, \"ZY([%w_]+)\", \"union %1\")\r\nend\r\n\r\nlocal function func_gather(src)\r\n  local nodes, list = {}, {}\r\n  local pos, len = 1, #src\r\n  while pos < len do\r\n    local d, w = match(src, \"^(#define ([%w_]+)[^\\n]*\\n)\", pos)\r\n    if d then\r\n      local n = #list+1\r\n      list[n] = d\r\n      nodes[w] = n\r\n    else\r\n      local s\r\n      d, w, s = match(src, \"^(([%w_]+)[^\\n]*([{;])\\n)\", pos)\r\n      if not d then\r\n\td, w, s = match(src, \"^(([%w_]+)[^(]*%b()([{;])\\n)\", pos)\r\n\tif not d then d = match(src, \"^[^\\n]*\\n\", pos) end\r\n      end\r\n      if s == \"{\" then\r\n\td = d..sub(match(src, \"^%b{}[^;\\n]*;?\\n\", pos+#d-2), 3)\r\n\tif sub(d, -2) == \"{\\n\" then\r\n\t  d = d..sub(match(src, \"^%b{}[^;\\n]*;?\\n\", pos+#d-2), 3)\r\n\tend\r\n      end\r\n      local k, v = nil, d\r\n      if w == \"typedef\" then\r\n\tif match(d, \"^typedef enum\") then\r\n\t  head[#head+1] = d\r\n\telse\r\n\t  k = match(d, \"([%w_]+);\\n$\")\r\n\t  if not k then k = match(d, \"^.-%(.-([%w_]+)%)%(\") end\r\n\tend\r\n      elseif w == \"enum\" then\r\n\thead[#head+1] = v\r\n      elseif w ~= nil then\r\n\tk = match(d, \"^[^\\n]-([%w_]+)[(%[=]\")\r\n\tif k then\r\n\t  if w ~= \"static\" and k ~= \"main\" then v = \"static \"..d end\r\n\telse\r\n\t  k = w\r\n\tend\r\n      end\r\n      if w and k then\r\n\tlocal o = nodes[k]\r\n\tif o then nodes[\"*\"..k] = o end\r\n\tlocal n = #list+1\r\n\tlist[n] = v\r\n\tnodes[k] = n\r\n      end\r\n    end\r\n    pos = pos + #d\r\n  end\r\n  return nodes, list\r\nend\r\n\r\nlocal function func_visit(nodes, list, used, n)\r\n  local i = nodes[n]\r\n  for m in string.gmatch(list[i], \"[%w_]+\") do\r\n    if nodes[m] then\r\n      local j = used[m]\r\n      if not j then\r\n\tused[m] = i\r\n\tfunc_visit(nodes, list, used, m)\r\n      elseif i < j then\r\n\tused[m] = i\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\nlocal function func_collect(src)\r\n  local nodes, list = func_gather(src)\r\n  local used = {}\r\n  func_visit(nodes, list, used, \"main\")\r\n  for n,i in pairs(nodes) do\r\n    local j = used[n]\r\n    if j and j < i then used[\"*\"..n] = j end\r\n  end\r\n  for n,i in pairs(nodes) do\r\n    if not used[n] then list[i] = \"\" end\r\n  end\r\n  return table.concat(list)\r\nend\r\n\r\nfind_sources()\r\nlocal src = read_sources()\r\nsrc = merge_includes(src)\r\nlocal license = get_license(src)\r\nsrc = fold_lines(src)\r\nsrc = strip_unused1(src)\r\nsrc = save_strings(src)\r\nsrc = strip_unused2(src)\r\nsrc = strip_comments(src)\r\nsrc = preprocess(src)\r\nsrc = strip_whitespace(src)\r\nsrc = strip_unused3(src)\r\nsrc = rename_tokens1(src)\r\nsrc = func_collect(src)\r\nsrc = rename_tokens2(src)\r\nsrc = restore_strings(src)\r\nsrc = merge_header(src, license)\r\nio.write(src)\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/host/minilua.c",
    "content": "/* This is a heavily customized and minimized copy of Lua 5.1.5. */\r\n/* It's only used to build LuaJIT. It does NOT have all standard functions! */\r\n/******************************************************************************\r\n* Copyright (C) 1994-2012 Lua.org, PUC-Rio.  All rights reserved.\r\n*\r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including\r\n* without limitation the rights to use, copy, modify, merge, publish,\r\n* distribute, sublicense, and/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject to\r\n* the following conditions:\r\n*\r\n* The above copyright notice and this permission notice shall be\r\n* included in all copies or substantial portions of the Software.\r\n*\r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n******************************************************************************/\r\n#ifdef _MSC_VER\r\ntypedef unsigned __int64 U64;\r\n#else\r\ntypedef unsigned long long U64;\r\n#endif\r\nint _CRT_glob = 0;\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <limits.h>\r\n#include <math.h>\r\n#include <ctype.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <setjmp.h>\r\n#include <errno.h>\r\n#include <time.h>\r\ntypedef enum{\r\nTM_INDEX,\r\nTM_NEWINDEX,\r\nTM_GC,\r\nTM_MODE,\r\nTM_EQ,\r\nTM_ADD,\r\nTM_SUB,\r\nTM_MUL,\r\nTM_DIV,\r\nTM_MOD,\r\nTM_POW,\r\nTM_UNM,\r\nTM_LEN,\r\nTM_LT,\r\nTM_LE,\r\nTM_CONCAT,\r\nTM_CALL,\r\nTM_N\r\n}TMS;\r\nenum OpMode{iABC,iABx,iAsBx};\r\ntypedef enum{\r\nOP_MOVE,\r\nOP_LOADK,\r\nOP_LOADBOOL,\r\nOP_LOADNIL,\r\nOP_GETUPVAL,\r\nOP_GETGLOBAL,\r\nOP_GETTABLE,\r\nOP_SETGLOBAL,\r\nOP_SETUPVAL,\r\nOP_SETTABLE,\r\nOP_NEWTABLE,\r\nOP_SELF,\r\nOP_ADD,\r\nOP_SUB,\r\nOP_MUL,\r\nOP_DIV,\r\nOP_MOD,\r\nOP_POW,\r\nOP_UNM,\r\nOP_NOT,\r\nOP_LEN,\r\nOP_CONCAT,\r\nOP_JMP,\r\nOP_EQ,\r\nOP_LT,\r\nOP_LE,\r\nOP_TEST,\r\nOP_TESTSET,\r\nOP_CALL,\r\nOP_TAILCALL,\r\nOP_RETURN,\r\nOP_FORLOOP,\r\nOP_FORPREP,\r\nOP_TFORLOOP,\r\nOP_SETLIST,\r\nOP_CLOSE,\r\nOP_CLOSURE,\r\nOP_VARARG\r\n}OpCode;\r\nenum OpArgMask{\r\nOpArgN,\r\nOpArgU,\r\nOpArgR,\r\nOpArgK\r\n};\r\ntypedef enum{\r\nVVOID,\r\nVNIL,\r\nVTRUE,\r\nVFALSE,\r\nVK,\r\nVKNUM,\r\nVLOCAL,\r\nVUPVAL,\r\nVGLOBAL,\r\nVINDEXED,\r\nVJMP,\r\nVRELOCABLE,\r\nVNONRELOC,\r\nVCALL,\r\nVVARARG\r\n}expkind;\r\nenum RESERVED{\r\nTK_AND=257,TK_BREAK,\r\nTK_DO,TK_ELSE,TK_ELSEIF,TK_END,TK_FALSE,TK_FOR,TK_FUNCTION,\r\nTK_IF,TK_IN,TK_LOCAL,TK_NIL,TK_NOT,TK_OR,TK_REPEAT,\r\nTK_RETURN,TK_THEN,TK_TRUE,TK_UNTIL,TK_WHILE,\r\nTK_CONCAT,TK_DOTS,TK_EQ,TK_GE,TK_LE,TK_NE,TK_NUMBER,\r\nTK_NAME,TK_STRING,TK_EOS\r\n};\r\ntypedef enum BinOpr{\r\nOPR_ADD,OPR_SUB,OPR_MUL,OPR_DIV,OPR_MOD,OPR_POW,\r\nOPR_CONCAT,\r\nOPR_NE,OPR_EQ,\r\nOPR_LT,OPR_LE,OPR_GT,OPR_GE,\r\nOPR_AND,OPR_OR,\r\nOPR_NOBINOPR\r\n}BinOpr;\r\ntypedef enum UnOpr{OPR_MINUS,OPR_NOT,OPR_LEN,OPR_NOUNOPR}UnOpr;\r\n#define LUA_QL(x)\"'\"x\"'\"\r\n#define luai_apicheck(L,o){(void)L;}\r\n#define lua_number2str(s,n)sprintf((s),\"%.14g\",(n))\r\n#define lua_str2number(s,p)strtod((s),(p))\r\n#define luai_numadd(a,b)((a)+(b))\r\n#define luai_numsub(a,b)((a)-(b))\r\n#define luai_nummul(a,b)((a)*(b))\r\n#define luai_numdiv(a,b)((a)/(b))\r\n#define luai_nummod(a,b)((a)-floor((a)/(b))*(b))\r\n#define luai_numpow(a,b)(pow(a,b))\r\n#define luai_numunm(a)(-(a))\r\n#define luai_numeq(a,b)((a)==(b))\r\n#define luai_numlt(a,b)((a)<(b))\r\n#define luai_numle(a,b)((a)<=(b))\r\n#define luai_numisnan(a)(!luai_numeq((a),(a)))\r\n#define lua_number2int(i,d)((i)=(int)(d))\r\n#define lua_number2integer(i,d)((i)=(lua_Integer)(d))\r\n#define LUAI_THROW(L,c)longjmp((c)->b,1)\r\n#define LUAI_TRY(L,c,a)if(setjmp((c)->b)==0){a}\r\n#define lua_pclose(L,file)((void)((void)L,file),0)\r\n#define lua_upvalueindex(i)((-10002)-(i))\r\ntypedef struct lua_State lua_State;\r\ntypedef int(*lua_CFunction)(lua_State*L);\r\ntypedef const char*(*lua_Reader)(lua_State*L,void*ud,size_t*sz);\r\ntypedef void*(*lua_Alloc)(void*ud,void*ptr,size_t osize,size_t nsize);\r\ntypedef double lua_Number;\r\ntypedef ptrdiff_t lua_Integer;\r\nstatic void lua_settop(lua_State*L,int idx);\r\nstatic int lua_type(lua_State*L,int idx);\r\nstatic const char* lua_tolstring(lua_State*L,int idx,size_t*len);\r\nstatic size_t lua_objlen(lua_State*L,int idx);\r\nstatic void lua_pushlstring(lua_State*L,const char*s,size_t l);\r\nstatic void lua_pushcclosure(lua_State*L,lua_CFunction fn,int n);\r\nstatic void lua_createtable(lua_State*L,int narr,int nrec);\r\nstatic void lua_setfield(lua_State*L,int idx,const char*k);\r\n#define lua_pop(L,n)lua_settop(L,-(n)-1)\r\n#define lua_newtable(L)lua_createtable(L,0,0)\r\n#define lua_pushcfunction(L,f)lua_pushcclosure(L,(f),0)\r\n#define lua_strlen(L,i)lua_objlen(L,(i))\r\n#define lua_isfunction(L,n)(lua_type(L,(n))==6)\r\n#define lua_istable(L,n)(lua_type(L,(n))==5)\r\n#define lua_isnil(L,n)(lua_type(L,(n))==0)\r\n#define lua_isboolean(L,n)(lua_type(L,(n))==1)\r\n#define lua_isnone(L,n)(lua_type(L,(n))==(-1))\r\n#define lua_isnoneornil(L,n)(lua_type(L,(n))<=0)\r\n#define lua_pushliteral(L,s)lua_pushlstring(L,\"\"s,(sizeof(s)/sizeof(char))-1)\r\n#define lua_setglobal(L,s)lua_setfield(L,(-10002),(s))\r\n#define lua_tostring(L,i)lua_tolstring(L,(i),NULL)\r\ntypedef struct lua_Debug lua_Debug;\r\ntypedef void(*lua_Hook)(lua_State*L,lua_Debug*ar);\r\nstruct lua_Debug{\r\nint event;\r\nconst char*name;\r\nconst char*namewhat;\r\nconst char*what;\r\nconst char*source;\r\nint currentline;\r\nint nups;\r\nint linedefined;\r\nint lastlinedefined;\r\nchar short_src[60];\r\nint i_ci;\r\n};\r\ntypedef unsigned int lu_int32;\r\ntypedef size_t lu_mem;\r\ntypedef ptrdiff_t l_mem;\r\ntypedef unsigned char lu_byte;\r\n#define IntPoint(p)((unsigned int)(lu_mem)(p))\r\ntypedef union{double u;void*s;long l;}L_Umaxalign;\r\ntypedef double l_uacNumber;\r\n#define check_exp(c,e)(e)\r\n#define UNUSED(x)((void)(x))\r\n#define cast(t,exp)((t)(exp))\r\n#define cast_byte(i)cast(lu_byte,(i))\r\n#define cast_num(i)cast(lua_Number,(i))\r\n#define cast_int(i)cast(int,(i))\r\ntypedef lu_int32 Instruction;\r\n#define condhardstacktests(x)((void)0)\r\ntypedef union GCObject GCObject;\r\ntypedef struct GCheader{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\n}GCheader;\r\ntypedef union{\r\nGCObject*gc;\r\nvoid*p;\r\nlua_Number n;\r\nint b;\r\n}Value;\r\ntypedef struct lua_TValue{\r\nValue value;int tt;\r\n}TValue;\r\n#define ttisnil(o)(ttype(o)==0)\r\n#define ttisnumber(o)(ttype(o)==3)\r\n#define ttisstring(o)(ttype(o)==4)\r\n#define ttistable(o)(ttype(o)==5)\r\n#define ttisfunction(o)(ttype(o)==6)\r\n#define ttisboolean(o)(ttype(o)==1)\r\n#define ttisuserdata(o)(ttype(o)==7)\r\n#define ttisthread(o)(ttype(o)==8)\r\n#define ttislightuserdata(o)(ttype(o)==2)\r\n#define ttype(o)((o)->tt)\r\n#define gcvalue(o)check_exp(iscollectable(o),(o)->value.gc)\r\n#define pvalue(o)check_exp(ttislightuserdata(o),(o)->value.p)\r\n#define nvalue(o)check_exp(ttisnumber(o),(o)->value.n)\r\n#define rawtsvalue(o)check_exp(ttisstring(o),&(o)->value.gc->ts)\r\n#define tsvalue(o)(&rawtsvalue(o)->tsv)\r\n#define rawuvalue(o)check_exp(ttisuserdata(o),&(o)->value.gc->u)\r\n#define uvalue(o)(&rawuvalue(o)->uv)\r\n#define clvalue(o)check_exp(ttisfunction(o),&(o)->value.gc->cl)\r\n#define hvalue(o)check_exp(ttistable(o),&(o)->value.gc->h)\r\n#define bvalue(o)check_exp(ttisboolean(o),(o)->value.b)\r\n#define thvalue(o)check_exp(ttisthread(o),&(o)->value.gc->th)\r\n#define l_isfalse(o)(ttisnil(o)||(ttisboolean(o)&&bvalue(o)==0))\r\n#define checkconsistency(obj)\r\n#define checkliveness(g,obj)\r\n#define setnilvalue(obj)((obj)->tt=0)\r\n#define setnvalue(obj,x){TValue*i_o=(obj);i_o->value.n=(x);i_o->tt=3;}\r\n#define setbvalue(obj,x){TValue*i_o=(obj);i_o->value.b=(x);i_o->tt=1;}\r\n#define setsvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=4;checkliveness(G(L),i_o);}\r\n#define setuvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=7;checkliveness(G(L),i_o);}\r\n#define setthvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=8;checkliveness(G(L),i_o);}\r\n#define setclvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=6;checkliveness(G(L),i_o);}\r\n#define sethvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=5;checkliveness(G(L),i_o);}\r\n#define setptvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=(8+1);checkliveness(G(L),i_o);}\r\n#define setobj(L,obj1,obj2){const TValue*o2=(obj2);TValue*o1=(obj1);o1->value=o2->value;o1->tt=o2->tt;checkliveness(G(L),o1);}\r\n#define setttype(obj,tt)(ttype(obj)=(tt))\r\n#define iscollectable(o)(ttype(o)>=4)\r\ntypedef TValue*StkId;\r\ntypedef union TString{\r\nL_Umaxalign dummy;\r\nstruct{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte reserved;\r\nunsigned int hash;\r\nsize_t len;\r\n}tsv;\r\n}TString;\r\n#define getstr(ts)cast(const char*,(ts)+1)\r\n#define svalue(o)getstr(rawtsvalue(o))\r\ntypedef union Udata{\r\nL_Umaxalign dummy;\r\nstruct{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nstruct Table*metatable;\r\nstruct Table*env;\r\nsize_t len;\r\n}uv;\r\n}Udata;\r\ntypedef struct Proto{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nTValue*k;\r\nInstruction*code;\r\nstruct Proto**p;\r\nint*lineinfo;\r\nstruct LocVar*locvars;\r\nTString**upvalues;\r\nTString*source;\r\nint sizeupvalues;\r\nint sizek;\r\nint sizecode;\r\nint sizelineinfo;\r\nint sizep;\r\nint sizelocvars;\r\nint linedefined;\r\nint lastlinedefined;\r\nGCObject*gclist;\r\nlu_byte nups;\r\nlu_byte numparams;\r\nlu_byte is_vararg;\r\nlu_byte maxstacksize;\r\n}Proto;\r\ntypedef struct LocVar{\r\nTString*varname;\r\nint startpc;\r\nint endpc;\r\n}LocVar;\r\ntypedef struct UpVal{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nTValue*v;\r\nunion{\r\nTValue value;\r\nstruct{\r\nstruct UpVal*prev;\r\nstruct UpVal*next;\r\n}l;\r\n}u;\r\n}UpVal;\r\ntypedef struct CClosure{\r\nGCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;\r\nlua_CFunction f;\r\nTValue upvalue[1];\r\n}CClosure;\r\ntypedef struct LClosure{\r\nGCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;\r\nstruct Proto*p;\r\nUpVal*upvals[1];\r\n}LClosure;\r\ntypedef union Closure{\r\nCClosure c;\r\nLClosure l;\r\n}Closure;\r\n#define iscfunction(o)(ttype(o)==6&&clvalue(o)->c.isC)\r\ntypedef union TKey{\r\nstruct{\r\nValue value;int tt;\r\nstruct Node*next;\r\n}nk;\r\nTValue tvk;\r\n}TKey;\r\ntypedef struct Node{\r\nTValue i_val;\r\nTKey i_key;\r\n}Node;\r\ntypedef struct Table{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte flags;\r\nlu_byte lsizenode;\r\nstruct Table*metatable;\r\nTValue*array;\r\nNode*node;\r\nNode*lastfree;\r\nGCObject*gclist;\r\nint sizearray;\r\n}Table;\r\n#define lmod(s,size)(check_exp((size&(size-1))==0,(cast(int,(s)&((size)-1)))))\r\n#define twoto(x)((size_t)1<<(x))\r\n#define sizenode(t)(twoto((t)->lsizenode))\r\nstatic const TValue luaO_nilobject_;\r\n#define ceillog2(x)(luaO_log2((x)-1)+1)\r\nstatic int luaO_log2(unsigned int x);\r\n#define gfasttm(g,et,e)((et)==NULL?NULL:((et)->flags&(1u<<(e)))?NULL:luaT_gettm(et,e,(g)->tmname[e]))\r\n#define fasttm(l,et,e)gfasttm(G(l),et,e)\r\nstatic const TValue*luaT_gettm(Table*events,TMS event,TString*ename);\r\n#define luaM_reallocv(L,b,on,n,e)((cast(size_t,(n)+1)<=((size_t)(~(size_t)0)-2)/(e))?luaM_realloc_(L,(b),(on)*(e),(n)*(e)):luaM_toobig(L))\r\n#define luaM_freemem(L,b,s)luaM_realloc_(L,(b),(s),0)\r\n#define luaM_free(L,b)luaM_realloc_(L,(b),sizeof(*(b)),0)\r\n#define luaM_freearray(L,b,n,t)luaM_reallocv(L,(b),n,0,sizeof(t))\r\n#define luaM_malloc(L,t)luaM_realloc_(L,NULL,0,(t))\r\n#define luaM_new(L,t)cast(t*,luaM_malloc(L,sizeof(t)))\r\n#define luaM_newvector(L,n,t)cast(t*,luaM_reallocv(L,NULL,0,n,sizeof(t)))\r\n#define luaM_growvector(L,v,nelems,size,t,limit,e)if((nelems)+1>(size))((v)=cast(t*,luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))\r\n#define luaM_reallocvector(L,v,oldn,n,t)((v)=cast(t*,luaM_reallocv(L,v,oldn,n,sizeof(t))))\r\nstatic void*luaM_realloc_(lua_State*L,void*block,size_t oldsize,\r\nsize_t size);\r\nstatic void*luaM_toobig(lua_State*L);\r\nstatic void*luaM_growaux_(lua_State*L,void*block,int*size,\r\nsize_t size_elem,int limit,\r\nconst char*errormsg);\r\ntypedef struct Zio ZIO;\r\n#define char2int(c)cast(int,cast(unsigned char,(c)))\r\n#define zgetc(z)(((z)->n--)>0?char2int(*(z)->p++):luaZ_fill(z))\r\ntypedef struct Mbuffer{\r\nchar*buffer;\r\nsize_t n;\r\nsize_t buffsize;\r\n}Mbuffer;\r\n#define luaZ_initbuffer(L,buff)((buff)->buffer=NULL,(buff)->buffsize=0)\r\n#define luaZ_buffer(buff)((buff)->buffer)\r\n#define luaZ_sizebuffer(buff)((buff)->buffsize)\r\n#define luaZ_bufflen(buff)((buff)->n)\r\n#define luaZ_resetbuffer(buff)((buff)->n=0)\r\n#define luaZ_resizebuffer(L,buff,size)(luaM_reallocvector(L,(buff)->buffer,(buff)->buffsize,size,char),(buff)->buffsize=size)\r\n#define luaZ_freebuffer(L,buff)luaZ_resizebuffer(L,buff,0)\r\nstruct Zio{\r\nsize_t n;\r\nconst char*p;\r\nlua_Reader reader;\r\nvoid*data;\r\nlua_State*L;\r\n};\r\nstatic int luaZ_fill(ZIO*z);\r\nstruct lua_longjmp;\r\n#define gt(L)(&L->l_gt)\r\n#define registry(L)(&G(L)->l_registry)\r\ntypedef struct stringtable{\r\nGCObject**hash;\r\nlu_int32 nuse;\r\nint size;\r\n}stringtable;\r\ntypedef struct CallInfo{\r\nStkId base;\r\nStkId func;\r\nStkId top;\r\nconst Instruction*savedpc;\r\nint nresults;\r\nint tailcalls;\r\n}CallInfo;\r\n#define curr_func(L)(clvalue(L->ci->func))\r\n#define ci_func(ci)(clvalue((ci)->func))\r\n#define f_isLua(ci)(!ci_func(ci)->c.isC)\r\n#define isLua(ci)(ttisfunction((ci)->func)&&f_isLua(ci))\r\ntypedef struct global_State{\r\nstringtable strt;\r\nlua_Alloc frealloc;\r\nvoid*ud;\r\nlu_byte currentwhite;\r\nlu_byte gcstate;\r\nint sweepstrgc;\r\nGCObject*rootgc;\r\nGCObject**sweepgc;\r\nGCObject*gray;\r\nGCObject*grayagain;\r\nGCObject*weak;\r\nGCObject*tmudata;\r\nMbuffer buff;\r\nlu_mem GCthreshold;\r\nlu_mem totalbytes;\r\nlu_mem estimate;\r\nlu_mem gcdept;\r\nint gcpause;\r\nint gcstepmul;\r\nlua_CFunction panic;\r\nTValue l_registry;\r\nstruct lua_State*mainthread;\r\nUpVal uvhead;\r\nstruct Table*mt[(8+1)];\r\nTString*tmname[TM_N];\r\n}global_State;\r\nstruct lua_State{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte status;\r\nStkId top;\r\nStkId base;\r\nglobal_State*l_G;\r\nCallInfo*ci;\r\nconst Instruction*savedpc;\r\nStkId stack_last;\r\nStkId stack;\r\nCallInfo*end_ci;\r\nCallInfo*base_ci;\r\nint stacksize;\r\nint size_ci;\r\nunsigned short nCcalls;\r\nunsigned short baseCcalls;\r\nlu_byte hookmask;\r\nlu_byte allowhook;\r\nint basehookcount;\r\nint hookcount;\r\nlua_Hook hook;\r\nTValue l_gt;\r\nTValue env;\r\nGCObject*openupval;\r\nGCObject*gclist;\r\nstruct lua_longjmp*errorJmp;\r\nptrdiff_t errfunc;\r\n};\r\n#define G(L)(L->l_G)\r\nunion GCObject{\r\nGCheader gch;\r\nunion TString ts;\r\nunion Udata u;\r\nunion Closure cl;\r\nstruct Table h;\r\nstruct Proto p;\r\nstruct UpVal uv;\r\nstruct lua_State th;\r\n};\r\n#define rawgco2ts(o)check_exp((o)->gch.tt==4,&((o)->ts))\r\n#define gco2ts(o)(&rawgco2ts(o)->tsv)\r\n#define rawgco2u(o)check_exp((o)->gch.tt==7,&((o)->u))\r\n#define gco2u(o)(&rawgco2u(o)->uv)\r\n#define gco2cl(o)check_exp((o)->gch.tt==6,&((o)->cl))\r\n#define gco2h(o)check_exp((o)->gch.tt==5,&((o)->h))\r\n#define gco2p(o)check_exp((o)->gch.tt==(8+1),&((o)->p))\r\n#define gco2uv(o)check_exp((o)->gch.tt==(8+2),&((o)->uv))\r\n#define ngcotouv(o)check_exp((o)==NULL||(o)->gch.tt==(8+2),&((o)->uv))\r\n#define gco2th(o)check_exp((o)->gch.tt==8,&((o)->th))\r\n#define obj2gco(v)(cast(GCObject*,(v)))\r\nstatic void luaE_freethread(lua_State*L,lua_State*L1);\r\n#define pcRel(pc,p)(cast(int,(pc)-(p)->code)-1)\r\n#define getline_(f,pc)(((f)->lineinfo)?(f)->lineinfo[pc]:0)\r\n#define resethookcount(L)(L->hookcount=L->basehookcount)\r\nstatic void luaG_typeerror(lua_State*L,const TValue*o,\r\nconst char*opname);\r\nstatic void luaG_runerror(lua_State*L,const char*fmt,...);\r\n#define luaD_checkstack(L,n)if((char*)L->stack_last-(char*)L->top<=(n)*(int)sizeof(TValue))luaD_growstack(L,n);else condhardstacktests(luaD_reallocstack(L,L->stacksize-5-1));\r\n#define incr_top(L){luaD_checkstack(L,1);L->top++;}\r\n#define savestack(L,p)((char*)(p)-(char*)L->stack)\r\n#define restorestack(L,n)((TValue*)((char*)L->stack+(n)))\r\n#define saveci(L,p)((char*)(p)-(char*)L->base_ci)\r\n#define restoreci(L,n)((CallInfo*)((char*)L->base_ci+(n)))\r\ntypedef void(*Pfunc)(lua_State*L,void*ud);\r\nstatic int luaD_poscall(lua_State*L,StkId firstResult);\r\nstatic void luaD_reallocCI(lua_State*L,int newsize);\r\nstatic void luaD_reallocstack(lua_State*L,int newsize);\r\nstatic void luaD_growstack(lua_State*L,int n);\r\nstatic void luaD_throw(lua_State*L,int errcode);\r\nstatic void*luaM_growaux_(lua_State*L,void*block,int*size,size_t size_elems,\r\nint limit,const char*errormsg){\r\nvoid*newblock;\r\nint newsize;\r\nif(*size>=limit/2){\r\nif(*size>=limit)\r\nluaG_runerror(L,errormsg);\r\nnewsize=limit;\r\n}\r\nelse{\r\nnewsize=(*size)*2;\r\nif(newsize<4)\r\nnewsize=4;\r\n}\r\nnewblock=luaM_reallocv(L,block,*size,newsize,size_elems);\r\n*size=newsize;\r\nreturn newblock;\r\n}\r\nstatic void*luaM_toobig(lua_State*L){\r\nluaG_runerror(L,\"memory allocation error: block too big\");\r\nreturn NULL;\r\n}\r\nstatic void*luaM_realloc_(lua_State*L,void*block,size_t osize,size_t nsize){\r\nglobal_State*g=G(L);\r\nblock=(*g->frealloc)(g->ud,block,osize,nsize);\r\nif(block==NULL&&nsize>0)\r\nluaD_throw(L,4);\r\ng->totalbytes=(g->totalbytes-osize)+nsize;\r\nreturn block;\r\n}\r\n#define resetbits(x,m)((x)&=cast(lu_byte,~(m)))\r\n#define setbits(x,m)((x)|=(m))\r\n#define testbits(x,m)((x)&(m))\r\n#define bitmask(b)(1<<(b))\r\n#define bit2mask(b1,b2)(bitmask(b1)|bitmask(b2))\r\n#define l_setbit(x,b)setbits(x,bitmask(b))\r\n#define resetbit(x,b)resetbits(x,bitmask(b))\r\n#define testbit(x,b)testbits(x,bitmask(b))\r\n#define set2bits(x,b1,b2)setbits(x,(bit2mask(b1,b2)))\r\n#define reset2bits(x,b1,b2)resetbits(x,(bit2mask(b1,b2)))\r\n#define test2bits(x,b1,b2)testbits(x,(bit2mask(b1,b2)))\r\n#define iswhite(x)test2bits((x)->gch.marked,0,1)\r\n#define isblack(x)testbit((x)->gch.marked,2)\r\n#define isgray(x)(!isblack(x)&&!iswhite(x))\r\n#define otherwhite(g)(g->currentwhite^bit2mask(0,1))\r\n#define isdead(g,v)((v)->gch.marked&otherwhite(g)&bit2mask(0,1))\r\n#define changewhite(x)((x)->gch.marked^=bit2mask(0,1))\r\n#define gray2black(x)l_setbit((x)->gch.marked,2)\r\n#define valiswhite(x)(iscollectable(x)&&iswhite(gcvalue(x)))\r\n#define luaC_white(g)cast(lu_byte,(g)->currentwhite&bit2mask(0,1))\r\n#define luaC_checkGC(L){condhardstacktests(luaD_reallocstack(L,L->stacksize-5-1));if(G(L)->totalbytes>=G(L)->GCthreshold)luaC_step(L);}\r\n#define luaC_barrier(L,p,v){if(valiswhite(v)&&isblack(obj2gco(p)))luaC_barrierf(L,obj2gco(p),gcvalue(v));}\r\n#define luaC_barriert(L,t,v){if(valiswhite(v)&&isblack(obj2gco(t)))luaC_barrierback(L,t);}\r\n#define luaC_objbarrier(L,p,o){if(iswhite(obj2gco(o))&&isblack(obj2gco(p)))luaC_barrierf(L,obj2gco(p),obj2gco(o));}\r\n#define luaC_objbarriert(L,t,o){if(iswhite(obj2gco(o))&&isblack(obj2gco(t)))luaC_barrierback(L,t);}\r\nstatic void luaC_step(lua_State*L);\r\nstatic void luaC_link(lua_State*L,GCObject*o,lu_byte tt);\r\nstatic void luaC_linkupval(lua_State*L,UpVal*uv);\r\nstatic void luaC_barrierf(lua_State*L,GCObject*o,GCObject*v);\r\nstatic void luaC_barrierback(lua_State*L,Table*t);\r\n#define sizestring(s)(sizeof(union TString)+((s)->len+1)*sizeof(char))\r\n#define sizeudata(u)(sizeof(union Udata)+(u)->len)\r\n#define luaS_new(L,s)(luaS_newlstr(L,s,strlen(s)))\r\n#define luaS_newliteral(L,s)(luaS_newlstr(L,\"\"s,(sizeof(s)/sizeof(char))-1))\r\n#define luaS_fix(s)l_setbit((s)->tsv.marked,5)\r\nstatic TString*luaS_newlstr(lua_State*L,const char*str,size_t l);\r\n#define tostring(L,o)((ttype(o)==4)||(luaV_tostring(L,o)))\r\n#define tonumber(o,n)(ttype(o)==3||(((o)=luaV_tonumber(o,n))!=NULL))\r\n#define equalobj(L,o1,o2)(ttype(o1)==ttype(o2)&&luaV_equalval(L,o1,o2))\r\nstatic int luaV_equalval(lua_State*L,const TValue*t1,const TValue*t2);\r\nstatic const TValue*luaV_tonumber(const TValue*obj,TValue*n);\r\nstatic int luaV_tostring(lua_State*L,StkId obj);\r\nstatic void luaV_execute(lua_State*L,int nexeccalls);\r\nstatic void luaV_concat(lua_State*L,int total,int last);\r\nstatic const TValue luaO_nilobject_={{NULL},0};\r\nstatic int luaO_int2fb(unsigned int x){\r\nint e=0;\r\nwhile(x>=16){\r\nx=(x+1)>>1;\r\ne++;\r\n}\r\nif(x<8)return x;\r\nelse return((e+1)<<3)|(cast_int(x)-8);\r\n}\r\nstatic int luaO_fb2int(int x){\r\nint e=(x>>3)&31;\r\nif(e==0)return x;\r\nelse return((x&7)+8)<<(e-1);\r\n}\r\nstatic int luaO_log2(unsigned int x){\r\nstatic const lu_byte log_2[256]={\r\n0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,\r\n6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,\r\n7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8\r\n};\r\nint l=-1;\r\nwhile(x>=256){l+=8;x>>=8;}\r\nreturn l+log_2[x];\r\n}\r\nstatic int luaO_rawequalObj(const TValue*t1,const TValue*t2){\r\nif(ttype(t1)!=ttype(t2))return 0;\r\nelse switch(ttype(t1)){\r\ncase 0:\r\nreturn 1;\r\ncase 3:\r\nreturn luai_numeq(nvalue(t1),nvalue(t2));\r\ncase 1:\r\nreturn bvalue(t1)==bvalue(t2);\r\ncase 2:\r\nreturn pvalue(t1)==pvalue(t2);\r\ndefault:\r\nreturn gcvalue(t1)==gcvalue(t2);\r\n}\r\n}\r\nstatic int luaO_str2d(const char*s,lua_Number*result){\r\nchar*endptr;\r\n*result=lua_str2number(s,&endptr);\r\nif(endptr==s)return 0;\r\nif(*endptr=='x'||*endptr=='X')\r\n*result=cast_num(strtoul(s,&endptr,16));\r\nif(*endptr=='\\0')return 1;\r\nwhile(isspace(cast(unsigned char,*endptr)))endptr++;\r\nif(*endptr!='\\0')return 0;\r\nreturn 1;\r\n}\r\nstatic void pushstr(lua_State*L,const char*str){\r\nsetsvalue(L,L->top,luaS_new(L,str));\r\nincr_top(L);\r\n}\r\nstatic const char*luaO_pushvfstring(lua_State*L,const char*fmt,va_list argp){\r\nint n=1;\r\npushstr(L,\"\");\r\nfor(;;){\r\nconst char*e=strchr(fmt,'%');\r\nif(e==NULL)break;\r\nsetsvalue(L,L->top,luaS_newlstr(L,fmt,e-fmt));\r\nincr_top(L);\r\nswitch(*(e+1)){\r\ncase's':{\r\nconst char*s=va_arg(argp,char*);\r\nif(s==NULL)s=\"(null)\";\r\npushstr(L,s);\r\nbreak;\r\n}\r\ncase'c':{\r\nchar buff[2];\r\nbuff[0]=cast(char,va_arg(argp,int));\r\nbuff[1]='\\0';\r\npushstr(L,buff);\r\nbreak;\r\n}\r\ncase'd':{\r\nsetnvalue(L->top,cast_num(va_arg(argp,int)));\r\nincr_top(L);\r\nbreak;\r\n}\r\ncase'f':{\r\nsetnvalue(L->top,cast_num(va_arg(argp,l_uacNumber)));\r\nincr_top(L);\r\nbreak;\r\n}\r\ncase'p':{\r\nchar buff[4*sizeof(void*)+8];\r\nsprintf(buff,\"%p\",va_arg(argp,void*));\r\npushstr(L,buff);\r\nbreak;\r\n}\r\ncase'%':{\r\npushstr(L,\"%\");\r\nbreak;\r\n}\r\ndefault:{\r\nchar buff[3];\r\nbuff[0]='%';\r\nbuff[1]=*(e+1);\r\nbuff[2]='\\0';\r\npushstr(L,buff);\r\nbreak;\r\n}\r\n}\r\nn+=2;\r\nfmt=e+2;\r\n}\r\npushstr(L,fmt);\r\nluaV_concat(L,n+1,cast_int(L->top-L->base)-1);\r\nL->top-=n;\r\nreturn svalue(L->top-1);\r\n}\r\nstatic const char*luaO_pushfstring(lua_State*L,const char*fmt,...){\r\nconst char*msg;\r\nva_list argp;\r\nva_start(argp,fmt);\r\nmsg=luaO_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nreturn msg;\r\n}\r\nstatic void luaO_chunkid(char*out,const char*source,size_t bufflen){\r\nif(*source=='='){\r\nstrncpy(out,source+1,bufflen);\r\nout[bufflen-1]='\\0';\r\n}\r\nelse{\r\nif(*source=='@'){\r\nsize_t l;\r\nsource++;\r\nbufflen-=sizeof(\" '...' \");\r\nl=strlen(source);\r\nstrcpy(out,\"\");\r\nif(l>bufflen){\r\nsource+=(l-bufflen);\r\nstrcat(out,\"...\");\r\n}\r\nstrcat(out,source);\r\n}\r\nelse{\r\nsize_t len=strcspn(source,\"\\n\\r\");\r\nbufflen-=sizeof(\" [string \\\"...\\\"] \");\r\nif(len>bufflen)len=bufflen;\r\nstrcpy(out,\"[string \\\"\");\r\nif(source[len]!='\\0'){\r\nstrncat(out,source,len);\r\nstrcat(out,\"...\");\r\n}\r\nelse\r\nstrcat(out,source);\r\nstrcat(out,\"\\\"]\");\r\n}\r\n}\r\n}\r\n#define gnode(t,i)(&(t)->node[i])\r\n#define gkey(n)(&(n)->i_key.nk)\r\n#define gval(n)(&(n)->i_val)\r\n#define gnext(n)((n)->i_key.nk.next)\r\n#define key2tval(n)(&(n)->i_key.tvk)\r\nstatic TValue*luaH_setnum(lua_State*L,Table*t,int key);\r\nstatic const TValue*luaH_getstr(Table*t,TString*key);\r\nstatic TValue*luaH_set(lua_State*L,Table*t,const TValue*key);\r\nstatic const char*const luaT_typenames[]={\r\n\"nil\",\"boolean\",\"userdata\",\"number\",\r\n\"string\",\"table\",\"function\",\"userdata\",\"thread\",\r\n\"proto\",\"upval\"\r\n};\r\nstatic void luaT_init(lua_State*L){\r\nstatic const char*const luaT_eventname[]={\r\n\"__index\",\"__newindex\",\r\n\"__gc\",\"__mode\",\"__eq\",\r\n\"__add\",\"__sub\",\"__mul\",\"__div\",\"__mod\",\r\n\"__pow\",\"__unm\",\"__len\",\"__lt\",\"__le\",\r\n\"__concat\",\"__call\"\r\n};\r\nint i;\r\nfor(i=0;i<TM_N;i++){\r\nG(L)->tmname[i]=luaS_new(L,luaT_eventname[i]);\r\nluaS_fix(G(L)->tmname[i]);\r\n}\r\n}\r\nstatic const TValue*luaT_gettm(Table*events,TMS event,TString*ename){\r\nconst TValue*tm=luaH_getstr(events,ename);\r\nif(ttisnil(tm)){\r\nevents->flags|=cast_byte(1u<<event);\r\nreturn NULL;\r\n}\r\nelse return tm;\r\n}\r\nstatic const TValue*luaT_gettmbyobj(lua_State*L,const TValue*o,TMS event){\r\nTable*mt;\r\nswitch(ttype(o)){\r\ncase 5:\r\nmt=hvalue(o)->metatable;\r\nbreak;\r\ncase 7:\r\nmt=uvalue(o)->metatable;\r\nbreak;\r\ndefault:\r\nmt=G(L)->mt[ttype(o)];\r\n}\r\nreturn(mt?luaH_getstr(mt,G(L)->tmname[event]):(&luaO_nilobject_));\r\n}\r\n#define sizeCclosure(n)(cast(int,sizeof(CClosure))+cast(int,sizeof(TValue)*((n)-1)))\r\n#define sizeLclosure(n)(cast(int,sizeof(LClosure))+cast(int,sizeof(TValue*)*((n)-1)))\r\nstatic Closure*luaF_newCclosure(lua_State*L,int nelems,Table*e){\r\nClosure*c=cast(Closure*,luaM_malloc(L,sizeCclosure(nelems)));\r\nluaC_link(L,obj2gco(c),6);\r\nc->c.isC=1;\r\nc->c.env=e;\r\nc->c.nupvalues=cast_byte(nelems);\r\nreturn c;\r\n}\r\nstatic Closure*luaF_newLclosure(lua_State*L,int nelems,Table*e){\r\nClosure*c=cast(Closure*,luaM_malloc(L,sizeLclosure(nelems)));\r\nluaC_link(L,obj2gco(c),6);\r\nc->l.isC=0;\r\nc->l.env=e;\r\nc->l.nupvalues=cast_byte(nelems);\r\nwhile(nelems--)c->l.upvals[nelems]=NULL;\r\nreturn c;\r\n}\r\nstatic UpVal*luaF_newupval(lua_State*L){\r\nUpVal*uv=luaM_new(L,UpVal);\r\nluaC_link(L,obj2gco(uv),(8+2));\r\nuv->v=&uv->u.value;\r\nsetnilvalue(uv->v);\r\nreturn uv;\r\n}\r\nstatic UpVal*luaF_findupval(lua_State*L,StkId level){\r\nglobal_State*g=G(L);\r\nGCObject**pp=&L->openupval;\r\nUpVal*p;\r\nUpVal*uv;\r\nwhile(*pp!=NULL&&(p=ngcotouv(*pp))->v>=level){\r\nif(p->v==level){\r\nif(isdead(g,obj2gco(p)))\r\nchangewhite(obj2gco(p));\r\nreturn p;\r\n}\r\npp=&p->next;\r\n}\r\nuv=luaM_new(L,UpVal);\r\nuv->tt=(8+2);\r\nuv->marked=luaC_white(g);\r\nuv->v=level;\r\nuv->next=*pp;\r\n*pp=obj2gco(uv);\r\nuv->u.l.prev=&g->uvhead;\r\nuv->u.l.next=g->uvhead.u.l.next;\r\nuv->u.l.next->u.l.prev=uv;\r\ng->uvhead.u.l.next=uv;\r\nreturn uv;\r\n}\r\nstatic void unlinkupval(UpVal*uv){\r\nuv->u.l.next->u.l.prev=uv->u.l.prev;\r\nuv->u.l.prev->u.l.next=uv->u.l.next;\r\n}\r\nstatic void luaF_freeupval(lua_State*L,UpVal*uv){\r\nif(uv->v!=&uv->u.value)\r\nunlinkupval(uv);\r\nluaM_free(L,uv);\r\n}\r\nstatic void luaF_close(lua_State*L,StkId level){\r\nUpVal*uv;\r\nglobal_State*g=G(L);\r\nwhile(L->openupval!=NULL&&(uv=ngcotouv(L->openupval))->v>=level){\r\nGCObject*o=obj2gco(uv);\r\nL->openupval=uv->next;\r\nif(isdead(g,o))\r\nluaF_freeupval(L,uv);\r\nelse{\r\nunlinkupval(uv);\r\nsetobj(L,&uv->u.value,uv->v);\r\nuv->v=&uv->u.value;\r\nluaC_linkupval(L,uv);\r\n}\r\n}\r\n}\r\nstatic Proto*luaF_newproto(lua_State*L){\r\nProto*f=luaM_new(L,Proto);\r\nluaC_link(L,obj2gco(f),(8+1));\r\nf->k=NULL;\r\nf->sizek=0;\r\nf->p=NULL;\r\nf->sizep=0;\r\nf->code=NULL;\r\nf->sizecode=0;\r\nf->sizelineinfo=0;\r\nf->sizeupvalues=0;\r\nf->nups=0;\r\nf->upvalues=NULL;\r\nf->numparams=0;\r\nf->is_vararg=0;\r\nf->maxstacksize=0;\r\nf->lineinfo=NULL;\r\nf->sizelocvars=0;\r\nf->locvars=NULL;\r\nf->linedefined=0;\r\nf->lastlinedefined=0;\r\nf->source=NULL;\r\nreturn f;\r\n}\r\nstatic void luaF_freeproto(lua_State*L,Proto*f){\r\nluaM_freearray(L,f->code,f->sizecode,Instruction);\r\nluaM_freearray(L,f->p,f->sizep,Proto*);\r\nluaM_freearray(L,f->k,f->sizek,TValue);\r\nluaM_freearray(L,f->lineinfo,f->sizelineinfo,int);\r\nluaM_freearray(L,f->locvars,f->sizelocvars,struct LocVar);\r\nluaM_freearray(L,f->upvalues,f->sizeupvalues,TString*);\r\nluaM_free(L,f);\r\n}\r\nstatic void luaF_freeclosure(lua_State*L,Closure*c){\r\nint size=(c->c.isC)?sizeCclosure(c->c.nupvalues):\r\nsizeLclosure(c->l.nupvalues);\r\nluaM_freemem(L,c,size);\r\n}\r\n#define MASK1(n,p)((~((~(Instruction)0)<<n))<<p)\r\n#define MASK0(n,p)(~MASK1(n,p))\r\n#define GET_OPCODE(i)(cast(OpCode,((i)>>0)&MASK1(6,0)))\r\n#define SET_OPCODE(i,o)((i)=(((i)&MASK0(6,0))|((cast(Instruction,o)<<0)&MASK1(6,0))))\r\n#define GETARG_A(i)(cast(int,((i)>>(0+6))&MASK1(8,0)))\r\n#define SETARG_A(i,u)((i)=(((i)&MASK0(8,(0+6)))|((cast(Instruction,u)<<(0+6))&MASK1(8,(0+6)))))\r\n#define GETARG_B(i)(cast(int,((i)>>(((0+6)+8)+9))&MASK1(9,0)))\r\n#define SETARG_B(i,b)((i)=(((i)&MASK0(9,(((0+6)+8)+9)))|((cast(Instruction,b)<<(((0+6)+8)+9))&MASK1(9,(((0+6)+8)+9)))))\r\n#define GETARG_C(i)(cast(int,((i)>>((0+6)+8))&MASK1(9,0)))\r\n#define SETARG_C(i,b)((i)=(((i)&MASK0(9,((0+6)+8)))|((cast(Instruction,b)<<((0+6)+8))&MASK1(9,((0+6)+8)))))\r\n#define GETARG_Bx(i)(cast(int,((i)>>((0+6)+8))&MASK1((9+9),0)))\r\n#define SETARG_Bx(i,b)((i)=(((i)&MASK0((9+9),((0+6)+8)))|((cast(Instruction,b)<<((0+6)+8))&MASK1((9+9),((0+6)+8)))))\r\n#define GETARG_sBx(i)(GETARG_Bx(i)-(((1<<(9+9))-1)>>1))\r\n#define SETARG_sBx(i,b)SETARG_Bx((i),cast(unsigned int,(b)+(((1<<(9+9))-1)>>1)))\r\n#define CREATE_ABC(o,a,b,c)((cast(Instruction,o)<<0)|(cast(Instruction,a)<<(0+6))|(cast(Instruction,b)<<(((0+6)+8)+9))|(cast(Instruction,c)<<((0+6)+8)))\r\n#define CREATE_ABx(o,a,bc)((cast(Instruction,o)<<0)|(cast(Instruction,a)<<(0+6))|(cast(Instruction,bc)<<((0+6)+8)))\r\n#define ISK(x)((x)&(1<<(9-1)))\r\n#define INDEXK(r)((int)(r)&~(1<<(9-1)))\r\n#define RKASK(x)((x)|(1<<(9-1)))\r\nstatic const lu_byte luaP_opmodes[(cast(int,OP_VARARG)+1)];\r\n#define getBMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>4)&3))\r\n#define getCMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>2)&3))\r\n#define testTMode(m)(luaP_opmodes[m]&(1<<7))\r\ntypedef struct expdesc{\r\nexpkind k;\r\nunion{\r\nstruct{int info,aux;}s;\r\nlua_Number nval;\r\n}u;\r\nint t;\r\nint f;\r\n}expdesc;\r\ntypedef struct upvaldesc{\r\nlu_byte k;\r\nlu_byte info;\r\n}upvaldesc;\r\nstruct BlockCnt;\r\ntypedef struct FuncState{\r\nProto*f;\r\nTable*h;\r\nstruct FuncState*prev;\r\nstruct LexState*ls;\r\nstruct lua_State*L;\r\nstruct BlockCnt*bl;\r\nint pc;\r\nint lasttarget;\r\nint jpc;\r\nint freereg;\r\nint nk;\r\nint np;\r\nshort nlocvars;\r\nlu_byte nactvar;\r\nupvaldesc upvalues[60];\r\nunsigned short actvar[200];\r\n}FuncState;\r\nstatic Proto*luaY_parser(lua_State*L,ZIO*z,Mbuffer*buff,\r\nconst char*name);\r\nstruct lua_longjmp{\r\nstruct lua_longjmp*previous;\r\njmp_buf b;\r\nvolatile int status;\r\n};\r\nstatic void luaD_seterrorobj(lua_State*L,int errcode,StkId oldtop){\r\nswitch(errcode){\r\ncase 4:{\r\nsetsvalue(L,oldtop,luaS_newliteral(L,\"not enough memory\"));\r\nbreak;\r\n}\r\ncase 5:{\r\nsetsvalue(L,oldtop,luaS_newliteral(L,\"error in error handling\"));\r\nbreak;\r\n}\r\ncase 3:\r\ncase 2:{\r\nsetobj(L,oldtop,L->top-1);\r\nbreak;\r\n}\r\n}\r\nL->top=oldtop+1;\r\n}\r\nstatic void restore_stack_limit(lua_State*L){\r\nif(L->size_ci>20000){\r\nint inuse=cast_int(L->ci-L->base_ci);\r\nif(inuse+1<20000)\r\nluaD_reallocCI(L,20000);\r\n}\r\n}\r\nstatic void resetstack(lua_State*L,int status){\r\nL->ci=L->base_ci;\r\nL->base=L->ci->base;\r\nluaF_close(L,L->base);\r\nluaD_seterrorobj(L,status,L->base);\r\nL->nCcalls=L->baseCcalls;\r\nL->allowhook=1;\r\nrestore_stack_limit(L);\r\nL->errfunc=0;\r\nL->errorJmp=NULL;\r\n}\r\nstatic void luaD_throw(lua_State*L,int errcode){\r\nif(L->errorJmp){\r\nL->errorJmp->status=errcode;\r\nLUAI_THROW(L,L->errorJmp);\r\n}\r\nelse{\r\nL->status=cast_byte(errcode);\r\nif(G(L)->panic){\r\nresetstack(L,errcode);\r\nG(L)->panic(L);\r\n}\r\nexit(EXIT_FAILURE);\r\n}\r\n}\r\nstatic int luaD_rawrunprotected(lua_State*L,Pfunc f,void*ud){\r\nstruct lua_longjmp lj;\r\nlj.status=0;\r\nlj.previous=L->errorJmp;\r\nL->errorJmp=&lj;\r\nLUAI_TRY(L,&lj,\r\n(*f)(L,ud);\r\n);\r\nL->errorJmp=lj.previous;\r\nreturn lj.status;\r\n}\r\nstatic void correctstack(lua_State*L,TValue*oldstack){\r\nCallInfo*ci;\r\nGCObject*up;\r\nL->top=(L->top-oldstack)+L->stack;\r\nfor(up=L->openupval;up!=NULL;up=up->gch.next)\r\ngco2uv(up)->v=(gco2uv(up)->v-oldstack)+L->stack;\r\nfor(ci=L->base_ci;ci<=L->ci;ci++){\r\nci->top=(ci->top-oldstack)+L->stack;\r\nci->base=(ci->base-oldstack)+L->stack;\r\nci->func=(ci->func-oldstack)+L->stack;\r\n}\r\nL->base=(L->base-oldstack)+L->stack;\r\n}\r\nstatic void luaD_reallocstack(lua_State*L,int newsize){\r\nTValue*oldstack=L->stack;\r\nint realsize=newsize+1+5;\r\nluaM_reallocvector(L,L->stack,L->stacksize,realsize,TValue);\r\nL->stacksize=realsize;\r\nL->stack_last=L->stack+newsize;\r\ncorrectstack(L,oldstack);\r\n}\r\nstatic void luaD_reallocCI(lua_State*L,int newsize){\r\nCallInfo*oldci=L->base_ci;\r\nluaM_reallocvector(L,L->base_ci,L->size_ci,newsize,CallInfo);\r\nL->size_ci=newsize;\r\nL->ci=(L->ci-oldci)+L->base_ci;\r\nL->end_ci=L->base_ci+L->size_ci-1;\r\n}\r\nstatic void luaD_growstack(lua_State*L,int n){\r\nif(n<=L->stacksize)\r\nluaD_reallocstack(L,2*L->stacksize);\r\nelse\r\nluaD_reallocstack(L,L->stacksize+n);\r\n}\r\nstatic CallInfo*growCI(lua_State*L){\r\nif(L->size_ci>20000)\r\nluaD_throw(L,5);\r\nelse{\r\nluaD_reallocCI(L,2*L->size_ci);\r\nif(L->size_ci>20000)\r\nluaG_runerror(L,\"stack overflow\");\r\n}\r\nreturn++L->ci;\r\n}\r\nstatic StkId adjust_varargs(lua_State*L,Proto*p,int actual){\r\nint i;\r\nint nfixargs=p->numparams;\r\nTable*htab=NULL;\r\nStkId base,fixed;\r\nfor(;actual<nfixargs;++actual)\r\nsetnilvalue(L->top++);\r\nfixed=L->top-actual;\r\nbase=L->top;\r\nfor(i=0;i<nfixargs;i++){\r\nsetobj(L,L->top++,fixed+i);\r\nsetnilvalue(fixed+i);\r\n}\r\nif(htab){\r\nsethvalue(L,L->top++,htab);\r\n}\r\nreturn base;\r\n}\r\nstatic StkId tryfuncTM(lua_State*L,StkId func){\r\nconst TValue*tm=luaT_gettmbyobj(L,func,TM_CALL);\r\nStkId p;\r\nptrdiff_t funcr=savestack(L,func);\r\nif(!ttisfunction(tm))\r\nluaG_typeerror(L,func,\"call\");\r\nfor(p=L->top;p>func;p--)setobj(L,p,p-1);\r\nincr_top(L);\r\nfunc=restorestack(L,funcr);\r\nsetobj(L,func,tm);\r\nreturn func;\r\n}\r\n#define inc_ci(L)((L->ci==L->end_ci)?growCI(L):(condhardstacktests(luaD_reallocCI(L,L->size_ci)),++L->ci))\r\nstatic int luaD_precall(lua_State*L,StkId func,int nresults){\r\nLClosure*cl;\r\nptrdiff_t funcr;\r\nif(!ttisfunction(func))\r\nfunc=tryfuncTM(L,func);\r\nfuncr=savestack(L,func);\r\ncl=&clvalue(func)->l;\r\nL->ci->savedpc=L->savedpc;\r\nif(!cl->isC){\r\nCallInfo*ci;\r\nStkId st,base;\r\nProto*p=cl->p;\r\nluaD_checkstack(L,p->maxstacksize);\r\nfunc=restorestack(L,funcr);\r\nif(!p->is_vararg){\r\nbase=func+1;\r\nif(L->top>base+p->numparams)\r\nL->top=base+p->numparams;\r\n}\r\nelse{\r\nint nargs=cast_int(L->top-func)-1;\r\nbase=adjust_varargs(L,p,nargs);\r\nfunc=restorestack(L,funcr);\r\n}\r\nci=inc_ci(L);\r\nci->func=func;\r\nL->base=ci->base=base;\r\nci->top=L->base+p->maxstacksize;\r\nL->savedpc=p->code;\r\nci->tailcalls=0;\r\nci->nresults=nresults;\r\nfor(st=L->top;st<ci->top;st++)\r\nsetnilvalue(st);\r\nL->top=ci->top;\r\nreturn 0;\r\n}\r\nelse{\r\nCallInfo*ci;\r\nint n;\r\nluaD_checkstack(L,20);\r\nci=inc_ci(L);\r\nci->func=restorestack(L,funcr);\r\nL->base=ci->base=ci->func+1;\r\nci->top=L->top+20;\r\nci->nresults=nresults;\r\nn=(*curr_func(L)->c.f)(L);\r\nif(n<0)\r\nreturn 2;\r\nelse{\r\nluaD_poscall(L,L->top-n);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nstatic int luaD_poscall(lua_State*L,StkId firstResult){\r\nStkId res;\r\nint wanted,i;\r\nCallInfo*ci;\r\nci=L->ci--;\r\nres=ci->func;\r\nwanted=ci->nresults;\r\nL->base=(ci-1)->base;\r\nL->savedpc=(ci-1)->savedpc;\r\nfor(i=wanted;i!=0&&firstResult<L->top;i--)\r\nsetobj(L,res++,firstResult++);\r\nwhile(i-->0)\r\nsetnilvalue(res++);\r\nL->top=res;\r\nreturn(wanted-(-1));\r\n}\r\nstatic void luaD_call(lua_State*L,StkId func,int nResults){\r\nif(++L->nCcalls>=200){\r\nif(L->nCcalls==200)\r\nluaG_runerror(L,\"C stack overflow\");\r\nelse if(L->nCcalls>=(200+(200>>3)))\r\nluaD_throw(L,5);\r\n}\r\nif(luaD_precall(L,func,nResults)==0)\r\nluaV_execute(L,1);\r\nL->nCcalls--;\r\nluaC_checkGC(L);\r\n}\r\nstatic int luaD_pcall(lua_State*L,Pfunc func,void*u,\r\nptrdiff_t old_top,ptrdiff_t ef){\r\nint status;\r\nunsigned short oldnCcalls=L->nCcalls;\r\nptrdiff_t old_ci=saveci(L,L->ci);\r\nlu_byte old_allowhooks=L->allowhook;\r\nptrdiff_t old_errfunc=L->errfunc;\r\nL->errfunc=ef;\r\nstatus=luaD_rawrunprotected(L,func,u);\r\nif(status!=0){\r\nStkId oldtop=restorestack(L,old_top);\r\nluaF_close(L,oldtop);\r\nluaD_seterrorobj(L,status,oldtop);\r\nL->nCcalls=oldnCcalls;\r\nL->ci=restoreci(L,old_ci);\r\nL->base=L->ci->base;\r\nL->savedpc=L->ci->savedpc;\r\nL->allowhook=old_allowhooks;\r\nrestore_stack_limit(L);\r\n}\r\nL->errfunc=old_errfunc;\r\nreturn status;\r\n}\r\nstruct SParser{\r\nZIO*z;\r\nMbuffer buff;\r\nconst char*name;\r\n};\r\nstatic void f_parser(lua_State*L,void*ud){\r\nint i;\r\nProto*tf;\r\nClosure*cl;\r\nstruct SParser*p=cast(struct SParser*,ud);\r\nluaC_checkGC(L);\r\ntf=luaY_parser(L,p->z,\r\n&p->buff,p->name);\r\ncl=luaF_newLclosure(L,tf->nups,hvalue(gt(L)));\r\ncl->l.p=tf;\r\nfor(i=0;i<tf->nups;i++)\r\ncl->l.upvals[i]=luaF_newupval(L);\r\nsetclvalue(L,L->top,cl);\r\nincr_top(L);\r\n}\r\nstatic int luaD_protectedparser(lua_State*L,ZIO*z,const char*name){\r\nstruct SParser p;\r\nint status;\r\np.z=z;p.name=name;\r\nluaZ_initbuffer(L,&p.buff);\r\nstatus=luaD_pcall(L,f_parser,&p,savestack(L,L->top),L->errfunc);\r\nluaZ_freebuffer(L,&p.buff);\r\nreturn status;\r\n}\r\nstatic void luaS_resize(lua_State*L,int newsize){\r\nGCObject**newhash;\r\nstringtable*tb;\r\nint i;\r\nif(G(L)->gcstate==2)\r\nreturn;\r\nnewhash=luaM_newvector(L,newsize,GCObject*);\r\ntb=&G(L)->strt;\r\nfor(i=0;i<newsize;i++)newhash[i]=NULL;\r\nfor(i=0;i<tb->size;i++){\r\nGCObject*p=tb->hash[i];\r\nwhile(p){\r\nGCObject*next=p->gch.next;\r\nunsigned int h=gco2ts(p)->hash;\r\nint h1=lmod(h,newsize);\r\np->gch.next=newhash[h1];\r\nnewhash[h1]=p;\r\np=next;\r\n}\r\n}\r\nluaM_freearray(L,tb->hash,tb->size,TString*);\r\ntb->size=newsize;\r\ntb->hash=newhash;\r\n}\r\nstatic TString*newlstr(lua_State*L,const char*str,size_t l,\r\nunsigned int h){\r\nTString*ts;\r\nstringtable*tb;\r\nif(l+1>(((size_t)(~(size_t)0)-2)-sizeof(TString))/sizeof(char))\r\nluaM_toobig(L);\r\nts=cast(TString*,luaM_malloc(L,(l+1)*sizeof(char)+sizeof(TString)));\r\nts->tsv.len=l;\r\nts->tsv.hash=h;\r\nts->tsv.marked=luaC_white(G(L));\r\nts->tsv.tt=4;\r\nts->tsv.reserved=0;\r\nmemcpy(ts+1,str,l*sizeof(char));\r\n((char*)(ts+1))[l]='\\0';\r\ntb=&G(L)->strt;\r\nh=lmod(h,tb->size);\r\nts->tsv.next=tb->hash[h];\r\ntb->hash[h]=obj2gco(ts);\r\ntb->nuse++;\r\nif(tb->nuse>cast(lu_int32,tb->size)&&tb->size<=(INT_MAX-2)/2)\r\nluaS_resize(L,tb->size*2);\r\nreturn ts;\r\n}\r\nstatic TString*luaS_newlstr(lua_State*L,const char*str,size_t l){\r\nGCObject*o;\r\nunsigned int h=cast(unsigned int,l);\r\nsize_t step=(l>>5)+1;\r\nsize_t l1;\r\nfor(l1=l;l1>=step;l1-=step)\r\nh=h^((h<<5)+(h>>2)+cast(unsigned char,str[l1-1]));\r\nfor(o=G(L)->strt.hash[lmod(h,G(L)->strt.size)];\r\no!=NULL;\r\no=o->gch.next){\r\nTString*ts=rawgco2ts(o);\r\nif(ts->tsv.len==l&&(memcmp(str,getstr(ts),l)==0)){\r\nif(isdead(G(L),o))changewhite(o);\r\nreturn ts;\r\n}\r\n}\r\nreturn newlstr(L,str,l,h);\r\n}\r\nstatic Udata*luaS_newudata(lua_State*L,size_t s,Table*e){\r\nUdata*u;\r\nif(s>((size_t)(~(size_t)0)-2)-sizeof(Udata))\r\nluaM_toobig(L);\r\nu=cast(Udata*,luaM_malloc(L,s+sizeof(Udata)));\r\nu->uv.marked=luaC_white(G(L));\r\nu->uv.tt=7;\r\nu->uv.len=s;\r\nu->uv.metatable=NULL;\r\nu->uv.env=e;\r\nu->uv.next=G(L)->mainthread->next;\r\nG(L)->mainthread->next=obj2gco(u);\r\nreturn u;\r\n}\r\n#define hashpow2(t,n)(gnode(t,lmod((n),sizenode(t))))\r\n#define hashstr(t,str)hashpow2(t,(str)->tsv.hash)\r\n#define hashboolean(t,p)hashpow2(t,p)\r\n#define hashmod(t,n)(gnode(t,((n)%((sizenode(t)-1)|1))))\r\n#define hashpointer(t,p)hashmod(t,IntPoint(p))\r\nstatic const Node dummynode_={\r\n{{NULL},0},\r\n{{{NULL},0,NULL}}\r\n};\r\nstatic Node*hashnum(const Table*t,lua_Number n){\r\nunsigned int a[cast_int(sizeof(lua_Number)/sizeof(int))];\r\nint i;\r\nif(luai_numeq(n,0))\r\nreturn gnode(t,0);\r\nmemcpy(a,&n,sizeof(a));\r\nfor(i=1;i<cast_int(sizeof(lua_Number)/sizeof(int));i++)a[0]+=a[i];\r\nreturn hashmod(t,a[0]);\r\n}\r\nstatic Node*mainposition(const Table*t,const TValue*key){\r\nswitch(ttype(key)){\r\ncase 3:\r\nreturn hashnum(t,nvalue(key));\r\ncase 4:\r\nreturn hashstr(t,rawtsvalue(key));\r\ncase 1:\r\nreturn hashboolean(t,bvalue(key));\r\ncase 2:\r\nreturn hashpointer(t,pvalue(key));\r\ndefault:\r\nreturn hashpointer(t,gcvalue(key));\r\n}\r\n}\r\nstatic int arrayindex(const TValue*key){\r\nif(ttisnumber(key)){\r\nlua_Number n=nvalue(key);\r\nint k;\r\nlua_number2int(k,n);\r\nif(luai_numeq(cast_num(k),n))\r\nreturn k;\r\n}\r\nreturn-1;\r\n}\r\nstatic int findindex(lua_State*L,Table*t,StkId key){\r\nint i;\r\nif(ttisnil(key))return-1;\r\ni=arrayindex(key);\r\nif(0<i&&i<=t->sizearray)\r\nreturn i-1;\r\nelse{\r\nNode*n=mainposition(t,key);\r\ndo{\r\nif(luaO_rawequalObj(key2tval(n),key)||\r\n(ttype(gkey(n))==(8+3)&&iscollectable(key)&&\r\ngcvalue(gkey(n))==gcvalue(key))){\r\ni=cast_int(n-gnode(t,0));\r\nreturn i+t->sizearray;\r\n}\r\nelse n=gnext(n);\r\n}while(n);\r\nluaG_runerror(L,\"invalid key to \"LUA_QL(\"next\"));\r\nreturn 0;\r\n}\r\n}\r\nstatic int luaH_next(lua_State*L,Table*t,StkId key){\r\nint i=findindex(L,t,key);\r\nfor(i++;i<t->sizearray;i++){\r\nif(!ttisnil(&t->array[i])){\r\nsetnvalue(key,cast_num(i+1));\r\nsetobj(L,key+1,&t->array[i]);\r\nreturn 1;\r\n}\r\n}\r\nfor(i-=t->sizearray;i<(int)sizenode(t);i++){\r\nif(!ttisnil(gval(gnode(t,i)))){\r\nsetobj(L,key,key2tval(gnode(t,i)));\r\nsetobj(L,key+1,gval(gnode(t,i)));\r\nreturn 1;\r\n}\r\n}\r\nreturn 0;\r\n}\r\nstatic int computesizes(int nums[],int*narray){\r\nint i;\r\nint twotoi;\r\nint a=0;\r\nint na=0;\r\nint n=0;\r\nfor(i=0,twotoi=1;twotoi/2<*narray;i++,twotoi*=2){\r\nif(nums[i]>0){\r\na+=nums[i];\r\nif(a>twotoi/2){\r\nn=twotoi;\r\nna=a;\r\n}\r\n}\r\nif(a==*narray)break;\r\n}\r\n*narray=n;\r\nreturn na;\r\n}\r\nstatic int countint(const TValue*key,int*nums){\r\nint k=arrayindex(key);\r\nif(0<k&&k<=(1<<(32-2))){\r\nnums[ceillog2(k)]++;\r\nreturn 1;\r\n}\r\nelse\r\nreturn 0;\r\n}\r\nstatic int numusearray(const Table*t,int*nums){\r\nint lg;\r\nint ttlg;\r\nint ause=0;\r\nint i=1;\r\nfor(lg=0,ttlg=1;lg<=(32-2);lg++,ttlg*=2){\r\nint lc=0;\r\nint lim=ttlg;\r\nif(lim>t->sizearray){\r\nlim=t->sizearray;\r\nif(i>lim)\r\nbreak;\r\n}\r\nfor(;i<=lim;i++){\r\nif(!ttisnil(&t->array[i-1]))\r\nlc++;\r\n}\r\nnums[lg]+=lc;\r\nause+=lc;\r\n}\r\nreturn ause;\r\n}\r\nstatic int numusehash(const Table*t,int*nums,int*pnasize){\r\nint totaluse=0;\r\nint ause=0;\r\nint i=sizenode(t);\r\nwhile(i--){\r\nNode*n=&t->node[i];\r\nif(!ttisnil(gval(n))){\r\nause+=countint(key2tval(n),nums);\r\ntotaluse++;\r\n}\r\n}\r\n*pnasize+=ause;\r\nreturn totaluse;\r\n}\r\nstatic void setarrayvector(lua_State*L,Table*t,int size){\r\nint i;\r\nluaM_reallocvector(L,t->array,t->sizearray,size,TValue);\r\nfor(i=t->sizearray;i<size;i++)\r\nsetnilvalue(&t->array[i]);\r\nt->sizearray=size;\r\n}\r\nstatic void setnodevector(lua_State*L,Table*t,int size){\r\nint lsize;\r\nif(size==0){\r\nt->node=cast(Node*,(&dummynode_));\r\nlsize=0;\r\n}\r\nelse{\r\nint i;\r\nlsize=ceillog2(size);\r\nif(lsize>(32-2))\r\nluaG_runerror(L,\"table overflow\");\r\nsize=twoto(lsize);\r\nt->node=luaM_newvector(L,size,Node);\r\nfor(i=0;i<size;i++){\r\nNode*n=gnode(t,i);\r\ngnext(n)=NULL;\r\nsetnilvalue(gkey(n));\r\nsetnilvalue(gval(n));\r\n}\r\n}\r\nt->lsizenode=cast_byte(lsize);\r\nt->lastfree=gnode(t,size);\r\n}\r\nstatic void resize(lua_State*L,Table*t,int nasize,int nhsize){\r\nint i;\r\nint oldasize=t->sizearray;\r\nint oldhsize=t->lsizenode;\r\nNode*nold=t->node;\r\nif(nasize>oldasize)\r\nsetarrayvector(L,t,nasize);\r\nsetnodevector(L,t,nhsize);\r\nif(nasize<oldasize){\r\nt->sizearray=nasize;\r\nfor(i=nasize;i<oldasize;i++){\r\nif(!ttisnil(&t->array[i]))\r\nsetobj(L,luaH_setnum(L,t,i+1),&t->array[i]);\r\n}\r\nluaM_reallocvector(L,t->array,oldasize,nasize,TValue);\r\n}\r\nfor(i=twoto(oldhsize)-1;i>=0;i--){\r\nNode*old=nold+i;\r\nif(!ttisnil(gval(old)))\r\nsetobj(L,luaH_set(L,t,key2tval(old)),gval(old));\r\n}\r\nif(nold!=(&dummynode_))\r\nluaM_freearray(L,nold,twoto(oldhsize),Node);\r\n}\r\nstatic void luaH_resizearray(lua_State*L,Table*t,int nasize){\r\nint nsize=(t->node==(&dummynode_))?0:sizenode(t);\r\nresize(L,t,nasize,nsize);\r\n}\r\nstatic void rehash(lua_State*L,Table*t,const TValue*ek){\r\nint nasize,na;\r\nint nums[(32-2)+1];\r\nint i;\r\nint totaluse;\r\nfor(i=0;i<=(32-2);i++)nums[i]=0;\r\nnasize=numusearray(t,nums);\r\ntotaluse=nasize;\r\ntotaluse+=numusehash(t,nums,&nasize);\r\nnasize+=countint(ek,nums);\r\ntotaluse++;\r\nna=computesizes(nums,&nasize);\r\nresize(L,t,nasize,totaluse-na);\r\n}\r\nstatic Table*luaH_new(lua_State*L,int narray,int nhash){\r\nTable*t=luaM_new(L,Table);\r\nluaC_link(L,obj2gco(t),5);\r\nt->metatable=NULL;\r\nt->flags=cast_byte(~0);\r\nt->array=NULL;\r\nt->sizearray=0;\r\nt->lsizenode=0;\r\nt->node=cast(Node*,(&dummynode_));\r\nsetarrayvector(L,t,narray);\r\nsetnodevector(L,t,nhash);\r\nreturn t;\r\n}\r\nstatic void luaH_free(lua_State*L,Table*t){\r\nif(t->node!=(&dummynode_))\r\nluaM_freearray(L,t->node,sizenode(t),Node);\r\nluaM_freearray(L,t->array,t->sizearray,TValue);\r\nluaM_free(L,t);\r\n}\r\nstatic Node*getfreepos(Table*t){\r\nwhile(t->lastfree-->t->node){\r\nif(ttisnil(gkey(t->lastfree)))\r\nreturn t->lastfree;\r\n}\r\nreturn NULL;\r\n}\r\nstatic TValue*newkey(lua_State*L,Table*t,const TValue*key){\r\nNode*mp=mainposition(t,key);\r\nif(!ttisnil(gval(mp))||mp==(&dummynode_)){\r\nNode*othern;\r\nNode*n=getfreepos(t);\r\nif(n==NULL){\r\nrehash(L,t,key);\r\nreturn luaH_set(L,t,key);\r\n}\r\nothern=mainposition(t,key2tval(mp));\r\nif(othern!=mp){\r\nwhile(gnext(othern)!=mp)othern=gnext(othern);\r\ngnext(othern)=n;\r\n*n=*mp;\r\ngnext(mp)=NULL;\r\nsetnilvalue(gval(mp));\r\n}\r\nelse{\r\ngnext(n)=gnext(mp);\r\ngnext(mp)=n;\r\nmp=n;\r\n}\r\n}\r\ngkey(mp)->value=key->value;gkey(mp)->tt=key->tt;\r\nluaC_barriert(L,t,key);\r\nreturn gval(mp);\r\n}\r\nstatic const TValue*luaH_getnum(Table*t,int key){\r\nif(cast(unsigned int,key-1)<cast(unsigned int,t->sizearray))\r\nreturn&t->array[key-1];\r\nelse{\r\nlua_Number nk=cast_num(key);\r\nNode*n=hashnum(t,nk);\r\ndo{\r\nif(ttisnumber(gkey(n))&&luai_numeq(nvalue(gkey(n)),nk))\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\n}\r\nstatic const TValue*luaH_getstr(Table*t,TString*key){\r\nNode*n=hashstr(t,key);\r\ndo{\r\nif(ttisstring(gkey(n))&&rawtsvalue(gkey(n))==key)\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\nstatic const TValue*luaH_get(Table*t,const TValue*key){\r\nswitch(ttype(key)){\r\ncase 0:return(&luaO_nilobject_);\r\ncase 4:return luaH_getstr(t,rawtsvalue(key));\r\ncase 3:{\r\nint k;\r\nlua_Number n=nvalue(key);\r\nlua_number2int(k,n);\r\nif(luai_numeq(cast_num(k),nvalue(key)))\r\nreturn luaH_getnum(t,k);\r\n}\r\ndefault:{\r\nNode*n=mainposition(t,key);\r\ndo{\r\nif(luaO_rawequalObj(key2tval(n),key))\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\n}\r\n}\r\nstatic TValue*luaH_set(lua_State*L,Table*t,const TValue*key){\r\nconst TValue*p=luaH_get(t,key);\r\nt->flags=0;\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nif(ttisnil(key))luaG_runerror(L,\"table index is nil\");\r\nelse if(ttisnumber(key)&&luai_numisnan(nvalue(key)))\r\nluaG_runerror(L,\"table index is NaN\");\r\nreturn newkey(L,t,key);\r\n}\r\n}\r\nstatic TValue*luaH_setnum(lua_State*L,Table*t,int key){\r\nconst TValue*p=luaH_getnum(t,key);\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nTValue k;\r\nsetnvalue(&k,cast_num(key));\r\nreturn newkey(L,t,&k);\r\n}\r\n}\r\nstatic TValue*luaH_setstr(lua_State*L,Table*t,TString*key){\r\nconst TValue*p=luaH_getstr(t,key);\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nTValue k;\r\nsetsvalue(L,&k,key);\r\nreturn newkey(L,t,&k);\r\n}\r\n}\r\nstatic int unbound_search(Table*t,unsigned int j){\r\nunsigned int i=j;\r\nj++;\r\nwhile(!ttisnil(luaH_getnum(t,j))){\r\ni=j;\r\nj*=2;\r\nif(j>cast(unsigned int,(INT_MAX-2))){\r\ni=1;\r\nwhile(!ttisnil(luaH_getnum(t,i)))i++;\r\nreturn i-1;\r\n}\r\n}\r\nwhile(j-i>1){\r\nunsigned int m=(i+j)/2;\r\nif(ttisnil(luaH_getnum(t,m)))j=m;\r\nelse i=m;\r\n}\r\nreturn i;\r\n}\r\nstatic int luaH_getn(Table*t){\r\nunsigned int j=t->sizearray;\r\nif(j>0&&ttisnil(&t->array[j-1])){\r\nunsigned int i=0;\r\nwhile(j-i>1){\r\nunsigned int m=(i+j)/2;\r\nif(ttisnil(&t->array[m-1]))j=m;\r\nelse i=m;\r\n}\r\nreturn i;\r\n}\r\nelse if(t->node==(&dummynode_))\r\nreturn j;\r\nelse return unbound_search(t,j);\r\n}\r\n#define makewhite(g,x)((x)->gch.marked=cast_byte(((x)->gch.marked&cast_byte(~(bitmask(2)|bit2mask(0,1))))|luaC_white(g)))\r\n#define white2gray(x)reset2bits((x)->gch.marked,0,1)\r\n#define black2gray(x)resetbit((x)->gch.marked,2)\r\n#define stringmark(s)reset2bits((s)->tsv.marked,0,1)\r\n#define isfinalized(u)testbit((u)->marked,3)\r\n#define markfinalized(u)l_setbit((u)->marked,3)\r\n#define markvalue(g,o){checkconsistency(o);if(iscollectable(o)&&iswhite(gcvalue(o)))reallymarkobject(g,gcvalue(o));}\r\n#define markobject(g,t){if(iswhite(obj2gco(t)))reallymarkobject(g,obj2gco(t));}\r\n#define setthreshold(g)(g->GCthreshold=(g->estimate/100)*g->gcpause)\r\nstatic void removeentry(Node*n){\r\nif(iscollectable(gkey(n)))\r\nsetttype(gkey(n),(8+3));\r\n}\r\nstatic void reallymarkobject(global_State*g,GCObject*o){\r\nwhite2gray(o);\r\nswitch(o->gch.tt){\r\ncase 4:{\r\nreturn;\r\n}\r\ncase 7:{\r\nTable*mt=gco2u(o)->metatable;\r\ngray2black(o);\r\nif(mt)markobject(g,mt);\r\nmarkobject(g,gco2u(o)->env);\r\nreturn;\r\n}\r\ncase(8+2):{\r\nUpVal*uv=gco2uv(o);\r\nmarkvalue(g,uv->v);\r\nif(uv->v==&uv->u.value)\r\ngray2black(o);\r\nreturn;\r\n}\r\ncase 6:{\r\ngco2cl(o)->c.gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase 5:{\r\ngco2h(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase 8:{\r\ngco2th(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase(8+1):{\r\ngco2p(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\nstatic void marktmu(global_State*g){\r\nGCObject*u=g->tmudata;\r\nif(u){\r\ndo{\r\nu=u->gch.next;\r\nmakewhite(g,u);\r\nreallymarkobject(g,u);\r\n}while(u!=g->tmudata);\r\n}\r\n}\r\nstatic size_t luaC_separateudata(lua_State*L,int all){\r\nglobal_State*g=G(L);\r\nsize_t deadmem=0;\r\nGCObject**p=&g->mainthread->next;\r\nGCObject*curr;\r\nwhile((curr=*p)!=NULL){\r\nif(!(iswhite(curr)||all)||isfinalized(gco2u(curr)))\r\np=&curr->gch.next;\r\nelse if(fasttm(L,gco2u(curr)->metatable,TM_GC)==NULL){\r\nmarkfinalized(gco2u(curr));\r\np=&curr->gch.next;\r\n}\r\nelse{\r\ndeadmem+=sizeudata(gco2u(curr));\r\nmarkfinalized(gco2u(curr));\r\n*p=curr->gch.next;\r\nif(g->tmudata==NULL)\r\ng->tmudata=curr->gch.next=curr;\r\nelse{\r\ncurr->gch.next=g->tmudata->gch.next;\r\ng->tmudata->gch.next=curr;\r\ng->tmudata=curr;\r\n}\r\n}\r\n}\r\nreturn deadmem;\r\n}\r\nstatic int traversetable(global_State*g,Table*h){\r\nint i;\r\nint weakkey=0;\r\nint weakvalue=0;\r\nconst TValue*mode;\r\nif(h->metatable)\r\nmarkobject(g,h->metatable);\r\nmode=gfasttm(g,h->metatable,TM_MODE);\r\nif(mode&&ttisstring(mode)){\r\nweakkey=(strchr(svalue(mode),'k')!=NULL);\r\nweakvalue=(strchr(svalue(mode),'v')!=NULL);\r\nif(weakkey||weakvalue){\r\nh->marked&=~(bitmask(3)|bitmask(4));\r\nh->marked|=cast_byte((weakkey<<3)|\r\n(weakvalue<<4));\r\nh->gclist=g->weak;\r\ng->weak=obj2gco(h);\r\n}\r\n}\r\nif(weakkey&&weakvalue)return 1;\r\nif(!weakvalue){\r\ni=h->sizearray;\r\nwhile(i--)\r\nmarkvalue(g,&h->array[i]);\r\n}\r\ni=sizenode(h);\r\nwhile(i--){\r\nNode*n=gnode(h,i);\r\nif(ttisnil(gval(n)))\r\nremoveentry(n);\r\nelse{\r\nif(!weakkey)markvalue(g,gkey(n));\r\nif(!weakvalue)markvalue(g,gval(n));\r\n}\r\n}\r\nreturn weakkey||weakvalue;\r\n}\r\nstatic void traverseproto(global_State*g,Proto*f){\r\nint i;\r\nif(f->source)stringmark(f->source);\r\nfor(i=0;i<f->sizek;i++)\r\nmarkvalue(g,&f->k[i]);\r\nfor(i=0;i<f->sizeupvalues;i++){\r\nif(f->upvalues[i])\r\nstringmark(f->upvalues[i]);\r\n}\r\nfor(i=0;i<f->sizep;i++){\r\nif(f->p[i])\r\nmarkobject(g,f->p[i]);\r\n}\r\nfor(i=0;i<f->sizelocvars;i++){\r\nif(f->locvars[i].varname)\r\nstringmark(f->locvars[i].varname);\r\n}\r\n}\r\nstatic void traverseclosure(global_State*g,Closure*cl){\r\nmarkobject(g,cl->c.env);\r\nif(cl->c.isC){\r\nint i;\r\nfor(i=0;i<cl->c.nupvalues;i++)\r\nmarkvalue(g,&cl->c.upvalue[i]);\r\n}\r\nelse{\r\nint i;\r\nmarkobject(g,cl->l.p);\r\nfor(i=0;i<cl->l.nupvalues;i++)\r\nmarkobject(g,cl->l.upvals[i]);\r\n}\r\n}\r\nstatic void checkstacksizes(lua_State*L,StkId max){\r\nint ci_used=cast_int(L->ci-L->base_ci);\r\nint s_used=cast_int(max-L->stack);\r\nif(L->size_ci>20000)\r\nreturn;\r\nif(4*ci_used<L->size_ci&&2*8<L->size_ci)\r\nluaD_reallocCI(L,L->size_ci/2);\r\ncondhardstacktests(luaD_reallocCI(L,ci_used+1));\r\nif(4*s_used<L->stacksize&&\r\n2*((2*20)+5)<L->stacksize)\r\nluaD_reallocstack(L,L->stacksize/2);\r\ncondhardstacktests(luaD_reallocstack(L,s_used));\r\n}\r\nstatic void traversestack(global_State*g,lua_State*l){\r\nStkId o,lim;\r\nCallInfo*ci;\r\nmarkvalue(g,gt(l));\r\nlim=l->top;\r\nfor(ci=l->base_ci;ci<=l->ci;ci++){\r\nif(lim<ci->top)lim=ci->top;\r\n}\r\nfor(o=l->stack;o<l->top;o++)\r\nmarkvalue(g,o);\r\nfor(;o<=lim;o++)\r\nsetnilvalue(o);\r\ncheckstacksizes(l,lim);\r\n}\r\nstatic l_mem propagatemark(global_State*g){\r\nGCObject*o=g->gray;\r\ngray2black(o);\r\nswitch(o->gch.tt){\r\ncase 5:{\r\nTable*h=gco2h(o);\r\ng->gray=h->gclist;\r\nif(traversetable(g,h))\r\nblack2gray(o);\r\nreturn sizeof(Table)+sizeof(TValue)*h->sizearray+\r\nsizeof(Node)*sizenode(h);\r\n}\r\ncase 6:{\r\nClosure*cl=gco2cl(o);\r\ng->gray=cl->c.gclist;\r\ntraverseclosure(g,cl);\r\nreturn(cl->c.isC)?sizeCclosure(cl->c.nupvalues):\r\nsizeLclosure(cl->l.nupvalues);\r\n}\r\ncase 8:{\r\nlua_State*th=gco2th(o);\r\ng->gray=th->gclist;\r\nth->gclist=g->grayagain;\r\ng->grayagain=o;\r\nblack2gray(o);\r\ntraversestack(g,th);\r\nreturn sizeof(lua_State)+sizeof(TValue)*th->stacksize+\r\nsizeof(CallInfo)*th->size_ci;\r\n}\r\ncase(8+1):{\r\nProto*p=gco2p(o);\r\ng->gray=p->gclist;\r\ntraverseproto(g,p);\r\nreturn sizeof(Proto)+sizeof(Instruction)*p->sizecode+\r\nsizeof(Proto*)*p->sizep+\r\nsizeof(TValue)*p->sizek+\r\nsizeof(int)*p->sizelineinfo+\r\nsizeof(LocVar)*p->sizelocvars+\r\nsizeof(TString*)*p->sizeupvalues;\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic size_t propagateall(global_State*g){\r\nsize_t m=0;\r\nwhile(g->gray)m+=propagatemark(g);\r\nreturn m;\r\n}\r\nstatic int iscleared(const TValue*o,int iskey){\r\nif(!iscollectable(o))return 0;\r\nif(ttisstring(o)){\r\nstringmark(rawtsvalue(o));\r\nreturn 0;\r\n}\r\nreturn iswhite(gcvalue(o))||\r\n(ttisuserdata(o)&&(!iskey&&isfinalized(uvalue(o))));\r\n}\r\nstatic void cleartable(GCObject*l){\r\nwhile(l){\r\nTable*h=gco2h(l);\r\nint i=h->sizearray;\r\nif(testbit(h->marked,4)){\r\nwhile(i--){\r\nTValue*o=&h->array[i];\r\nif(iscleared(o,0))\r\nsetnilvalue(o);\r\n}\r\n}\r\ni=sizenode(h);\r\nwhile(i--){\r\nNode*n=gnode(h,i);\r\nif(!ttisnil(gval(n))&&\r\n(iscleared(key2tval(n),1)||iscleared(gval(n),0))){\r\nsetnilvalue(gval(n));\r\nremoveentry(n);\r\n}\r\n}\r\nl=h->gclist;\r\n}\r\n}\r\nstatic void freeobj(lua_State*L,GCObject*o){\r\nswitch(o->gch.tt){\r\ncase(8+1):luaF_freeproto(L,gco2p(o));break;\r\ncase 6:luaF_freeclosure(L,gco2cl(o));break;\r\ncase(8+2):luaF_freeupval(L,gco2uv(o));break;\r\ncase 5:luaH_free(L,gco2h(o));break;\r\ncase 8:{\r\nluaE_freethread(L,gco2th(o));\r\nbreak;\r\n}\r\ncase 4:{\r\nG(L)->strt.nuse--;\r\nluaM_freemem(L,o,sizestring(gco2ts(o)));\r\nbreak;\r\n}\r\ncase 7:{\r\nluaM_freemem(L,o,sizeudata(gco2u(o)));\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\n#define sweepwholelist(L,p)sweeplist(L,p,((lu_mem)(~(lu_mem)0)-2))\r\nstatic GCObject**sweeplist(lua_State*L,GCObject**p,lu_mem count){\r\nGCObject*curr;\r\nglobal_State*g=G(L);\r\nint deadmask=otherwhite(g);\r\nwhile((curr=*p)!=NULL&&count-->0){\r\nif(curr->gch.tt==8)\r\nsweepwholelist(L,&gco2th(curr)->openupval);\r\nif((curr->gch.marked^bit2mask(0,1))&deadmask){\r\nmakewhite(g,curr);\r\np=&curr->gch.next;\r\n}\r\nelse{\r\n*p=curr->gch.next;\r\nif(curr==g->rootgc)\r\ng->rootgc=curr->gch.next;\r\nfreeobj(L,curr);\r\n}\r\n}\r\nreturn p;\r\n}\r\nstatic void checkSizes(lua_State*L){\r\nglobal_State*g=G(L);\r\nif(g->strt.nuse<cast(lu_int32,g->strt.size/4)&&\r\ng->strt.size>32*2)\r\nluaS_resize(L,g->strt.size/2);\r\nif(luaZ_sizebuffer(&g->buff)>32*2){\r\nsize_t newsize=luaZ_sizebuffer(&g->buff)/2;\r\nluaZ_resizebuffer(L,&g->buff,newsize);\r\n}\r\n}\r\nstatic void GCTM(lua_State*L){\r\nglobal_State*g=G(L);\r\nGCObject*o=g->tmudata->gch.next;\r\nUdata*udata=rawgco2u(o);\r\nconst TValue*tm;\r\nif(o==g->tmudata)\r\ng->tmudata=NULL;\r\nelse\r\ng->tmudata->gch.next=udata->uv.next;\r\nudata->uv.next=g->mainthread->next;\r\ng->mainthread->next=o;\r\nmakewhite(g,o);\r\ntm=fasttm(L,udata->uv.metatable,TM_GC);\r\nif(tm!=NULL){\r\nlu_byte oldah=L->allowhook;\r\nlu_mem oldt=g->GCthreshold;\r\nL->allowhook=0;\r\ng->GCthreshold=2*g->totalbytes;\r\nsetobj(L,L->top,tm);\r\nsetuvalue(L,L->top+1,udata);\r\nL->top+=2;\r\nluaD_call(L,L->top-2,0);\r\nL->allowhook=oldah;\r\ng->GCthreshold=oldt;\r\n}\r\n}\r\nstatic void luaC_callGCTM(lua_State*L){\r\nwhile(G(L)->tmudata)\r\nGCTM(L);\r\n}\r\nstatic void luaC_freeall(lua_State*L){\r\nglobal_State*g=G(L);\r\nint i;\r\ng->currentwhite=bit2mask(0,1)|bitmask(6);\r\nsweepwholelist(L,&g->rootgc);\r\nfor(i=0;i<g->strt.size;i++)\r\nsweepwholelist(L,&g->strt.hash[i]);\r\n}\r\nstatic void markmt(global_State*g){\r\nint i;\r\nfor(i=0;i<(8+1);i++)\r\nif(g->mt[i])markobject(g,g->mt[i]);\r\n}\r\nstatic void markroot(lua_State*L){\r\nglobal_State*g=G(L);\r\ng->gray=NULL;\r\ng->grayagain=NULL;\r\ng->weak=NULL;\r\nmarkobject(g,g->mainthread);\r\nmarkvalue(g,gt(g->mainthread));\r\nmarkvalue(g,registry(L));\r\nmarkmt(g);\r\ng->gcstate=1;\r\n}\r\nstatic void remarkupvals(global_State*g){\r\nUpVal*uv;\r\nfor(uv=g->uvhead.u.l.next;uv!=&g->uvhead;uv=uv->u.l.next){\r\nif(isgray(obj2gco(uv)))\r\nmarkvalue(g,uv->v);\r\n}\r\n}\r\nstatic void atomic(lua_State*L){\r\nglobal_State*g=G(L);\r\nsize_t udsize;\r\nremarkupvals(g);\r\npropagateall(g);\r\ng->gray=g->weak;\r\ng->weak=NULL;\r\nmarkobject(g,L);\r\nmarkmt(g);\r\npropagateall(g);\r\ng->gray=g->grayagain;\r\ng->grayagain=NULL;\r\npropagateall(g);\r\nudsize=luaC_separateudata(L,0);\r\nmarktmu(g);\r\nudsize+=propagateall(g);\r\ncleartable(g->weak);\r\ng->currentwhite=cast_byte(otherwhite(g));\r\ng->sweepstrgc=0;\r\ng->sweepgc=&g->rootgc;\r\ng->gcstate=2;\r\ng->estimate=g->totalbytes-udsize;\r\n}\r\nstatic l_mem singlestep(lua_State*L){\r\nglobal_State*g=G(L);\r\nswitch(g->gcstate){\r\ncase 0:{\r\nmarkroot(L);\r\nreturn 0;\r\n}\r\ncase 1:{\r\nif(g->gray)\r\nreturn propagatemark(g);\r\nelse{\r\natomic(L);\r\nreturn 0;\r\n}\r\n}\r\ncase 2:{\r\nlu_mem old=g->totalbytes;\r\nsweepwholelist(L,&g->strt.hash[g->sweepstrgc++]);\r\nif(g->sweepstrgc>=g->strt.size)\r\ng->gcstate=3;\r\ng->estimate-=old-g->totalbytes;\r\nreturn 10;\r\n}\r\ncase 3:{\r\nlu_mem old=g->totalbytes;\r\ng->sweepgc=sweeplist(L,g->sweepgc,40);\r\nif(*g->sweepgc==NULL){\r\ncheckSizes(L);\r\ng->gcstate=4;\r\n}\r\ng->estimate-=old-g->totalbytes;\r\nreturn 40*10;\r\n}\r\ncase 4:{\r\nif(g->tmudata){\r\nGCTM(L);\r\nif(g->estimate>100)\r\ng->estimate-=100;\r\nreturn 100;\r\n}\r\nelse{\r\ng->gcstate=0;\r\ng->gcdept=0;\r\nreturn 0;\r\n}\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic void luaC_step(lua_State*L){\r\nglobal_State*g=G(L);\r\nl_mem lim=(1024u/100)*g->gcstepmul;\r\nif(lim==0)\r\nlim=(((lu_mem)(~(lu_mem)0)-2)-1)/2;\r\ng->gcdept+=g->totalbytes-g->GCthreshold;\r\ndo{\r\nlim-=singlestep(L);\r\nif(g->gcstate==0)\r\nbreak;\r\n}while(lim>0);\r\nif(g->gcstate!=0){\r\nif(g->gcdept<1024u)\r\ng->GCthreshold=g->totalbytes+1024u;\r\nelse{\r\ng->gcdept-=1024u;\r\ng->GCthreshold=g->totalbytes;\r\n}\r\n}\r\nelse{\r\nsetthreshold(g);\r\n}\r\n}\r\nstatic void luaC_barrierf(lua_State*L,GCObject*o,GCObject*v){\r\nglobal_State*g=G(L);\r\nif(g->gcstate==1)\r\nreallymarkobject(g,v);\r\nelse\r\nmakewhite(g,o);\r\n}\r\nstatic void luaC_barrierback(lua_State*L,Table*t){\r\nglobal_State*g=G(L);\r\nGCObject*o=obj2gco(t);\r\nblack2gray(o);\r\nt->gclist=g->grayagain;\r\ng->grayagain=o;\r\n}\r\nstatic void luaC_link(lua_State*L,GCObject*o,lu_byte tt){\r\nglobal_State*g=G(L);\r\no->gch.next=g->rootgc;\r\ng->rootgc=o;\r\no->gch.marked=luaC_white(g);\r\no->gch.tt=tt;\r\n}\r\nstatic void luaC_linkupval(lua_State*L,UpVal*uv){\r\nglobal_State*g=G(L);\r\nGCObject*o=obj2gco(uv);\r\no->gch.next=g->rootgc;\r\ng->rootgc=o;\r\nif(isgray(o)){\r\nif(g->gcstate==1){\r\ngray2black(o);\r\nluaC_barrier(L,uv,uv->v);\r\n}\r\nelse{\r\nmakewhite(g,o);\r\n}\r\n}\r\n}\r\ntypedef union{\r\nlua_Number r;\r\nTString*ts;\r\n}SemInfo;\r\ntypedef struct Token{\r\nint token;\r\nSemInfo seminfo;\r\n}Token;\r\ntypedef struct LexState{\r\nint current;\r\nint linenumber;\r\nint lastline;\r\nToken t;\r\nToken lookahead;\r\nstruct FuncState*fs;\r\nstruct lua_State*L;\r\nZIO*z;\r\nMbuffer*buff;\r\nTString*source;\r\nchar decpoint;\r\n}LexState;\r\nstatic void luaX_init(lua_State*L);\r\nstatic void luaX_lexerror(LexState*ls,const char*msg,int token);\r\n#define state_size(x)(sizeof(x)+0)\r\n#define fromstate(l)(cast(lu_byte*,(l))-0)\r\n#define tostate(l)(cast(lua_State*,cast(lu_byte*,l)+0))\r\ntypedef struct LG{\r\nlua_State l;\r\nglobal_State g;\r\n}LG;\r\nstatic void stack_init(lua_State*L1,lua_State*L){\r\nL1->base_ci=luaM_newvector(L,8,CallInfo);\r\nL1->ci=L1->base_ci;\r\nL1->size_ci=8;\r\nL1->end_ci=L1->base_ci+L1->size_ci-1;\r\nL1->stack=luaM_newvector(L,(2*20)+5,TValue);\r\nL1->stacksize=(2*20)+5;\r\nL1->top=L1->stack;\r\nL1->stack_last=L1->stack+(L1->stacksize-5)-1;\r\nL1->ci->func=L1->top;\r\nsetnilvalue(L1->top++);\r\nL1->base=L1->ci->base=L1->top;\r\nL1->ci->top=L1->top+20;\r\n}\r\nstatic void freestack(lua_State*L,lua_State*L1){\r\nluaM_freearray(L,L1->base_ci,L1->size_ci,CallInfo);\r\nluaM_freearray(L,L1->stack,L1->stacksize,TValue);\r\n}\r\nstatic void f_luaopen(lua_State*L,void*ud){\r\nglobal_State*g=G(L);\r\nUNUSED(ud);\r\nstack_init(L,L);\r\nsethvalue(L,gt(L),luaH_new(L,0,2));\r\nsethvalue(L,registry(L),luaH_new(L,0,2));\r\nluaS_resize(L,32);\r\nluaT_init(L);\r\nluaX_init(L);\r\nluaS_fix(luaS_newliteral(L,\"not enough memory\"));\r\ng->GCthreshold=4*g->totalbytes;\r\n}\r\nstatic void preinit_state(lua_State*L,global_State*g){\r\nG(L)=g;\r\nL->stack=NULL;\r\nL->stacksize=0;\r\nL->errorJmp=NULL;\r\nL->hook=NULL;\r\nL->hookmask=0;\r\nL->basehookcount=0;\r\nL->allowhook=1;\r\nresethookcount(L);\r\nL->openupval=NULL;\r\nL->size_ci=0;\r\nL->nCcalls=L->baseCcalls=0;\r\nL->status=0;\r\nL->base_ci=L->ci=NULL;\r\nL->savedpc=NULL;\r\nL->errfunc=0;\r\nsetnilvalue(gt(L));\r\n}\r\nstatic void close_state(lua_State*L){\r\nglobal_State*g=G(L);\r\nluaF_close(L,L->stack);\r\nluaC_freeall(L);\r\nluaM_freearray(L,G(L)->strt.hash,G(L)->strt.size,TString*);\r\nluaZ_freebuffer(L,&g->buff);\r\nfreestack(L,L);\r\n(*g->frealloc)(g->ud,fromstate(L),state_size(LG),0);\r\n}\r\nstatic void luaE_freethread(lua_State*L,lua_State*L1){\r\nluaF_close(L1,L1->stack);\r\nfreestack(L,L1);\r\nluaM_freemem(L,fromstate(L1),state_size(lua_State));\r\n}\r\nstatic lua_State*lua_newstate(lua_Alloc f,void*ud){\r\nint i;\r\nlua_State*L;\r\nglobal_State*g;\r\nvoid*l=(*f)(ud,NULL,0,state_size(LG));\r\nif(l==NULL)return NULL;\r\nL=tostate(l);\r\ng=&((LG*)L)->g;\r\nL->next=NULL;\r\nL->tt=8;\r\ng->currentwhite=bit2mask(0,5);\r\nL->marked=luaC_white(g);\r\nset2bits(L->marked,5,6);\r\npreinit_state(L,g);\r\ng->frealloc=f;\r\ng->ud=ud;\r\ng->mainthread=L;\r\ng->uvhead.u.l.prev=&g->uvhead;\r\ng->uvhead.u.l.next=&g->uvhead;\r\ng->GCthreshold=0;\r\ng->strt.size=0;\r\ng->strt.nuse=0;\r\ng->strt.hash=NULL;\r\nsetnilvalue(registry(L));\r\nluaZ_initbuffer(L,&g->buff);\r\ng->panic=NULL;\r\ng->gcstate=0;\r\ng->rootgc=obj2gco(L);\r\ng->sweepstrgc=0;\r\ng->sweepgc=&g->rootgc;\r\ng->gray=NULL;\r\ng->grayagain=NULL;\r\ng->weak=NULL;\r\ng->tmudata=NULL;\r\ng->totalbytes=sizeof(LG);\r\ng->gcpause=200;\r\ng->gcstepmul=200;\r\ng->gcdept=0;\r\nfor(i=0;i<(8+1);i++)g->mt[i]=NULL;\r\nif(luaD_rawrunprotected(L,f_luaopen,NULL)!=0){\r\nclose_state(L);\r\nL=NULL;\r\n}\r\nelse\r\n{}\r\nreturn L;\r\n}\r\nstatic void callallgcTM(lua_State*L,void*ud){\r\nUNUSED(ud);\r\nluaC_callGCTM(L);\r\n}\r\nstatic void lua_close(lua_State*L){\r\nL=G(L)->mainthread;\r\nluaF_close(L,L->stack);\r\nluaC_separateudata(L,1);\r\nL->errfunc=0;\r\ndo{\r\nL->ci=L->base_ci;\r\nL->base=L->top=L->ci->base;\r\nL->nCcalls=L->baseCcalls=0;\r\n}while(luaD_rawrunprotected(L,callallgcTM,NULL)!=0);\r\nclose_state(L);\r\n}\r\n#define getcode(fs,e)((fs)->f->code[(e)->u.s.info])\r\n#define luaK_codeAsBx(fs,o,A,sBx)luaK_codeABx(fs,o,A,(sBx)+(((1<<(9+9))-1)>>1))\r\n#define luaK_setmultret(fs,e)luaK_setreturns(fs,e,(-1))\r\nstatic int luaK_codeABx(FuncState*fs,OpCode o,int A,unsigned int Bx);\r\nstatic int luaK_codeABC(FuncState*fs,OpCode o,int A,int B,int C);\r\nstatic void luaK_setreturns(FuncState*fs,expdesc*e,int nresults);\r\nstatic void luaK_patchtohere(FuncState*fs,int list);\r\nstatic void luaK_concat(FuncState*fs,int*l1,int l2);\r\nstatic int currentpc(lua_State*L,CallInfo*ci){\r\nif(!isLua(ci))return-1;\r\nif(ci==L->ci)\r\nci->savedpc=L->savedpc;\r\nreturn pcRel(ci->savedpc,ci_func(ci)->l.p);\r\n}\r\nstatic int currentline(lua_State*L,CallInfo*ci){\r\nint pc=currentpc(L,ci);\r\nif(pc<0)\r\nreturn-1;\r\nelse\r\nreturn getline_(ci_func(ci)->l.p,pc);\r\n}\r\nstatic int lua_getstack(lua_State*L,int level,lua_Debug*ar){\r\nint status;\r\nCallInfo*ci;\r\nfor(ci=L->ci;level>0&&ci>L->base_ci;ci--){\r\nlevel--;\r\nif(f_isLua(ci))\r\nlevel-=ci->tailcalls;\r\n}\r\nif(level==0&&ci>L->base_ci){\r\nstatus=1;\r\nar->i_ci=cast_int(ci-L->base_ci);\r\n}\r\nelse if(level<0){\r\nstatus=1;\r\nar->i_ci=0;\r\n}\r\nelse status=0;\r\nreturn status;\r\n}\r\nstatic Proto*getluaproto(CallInfo*ci){\r\nreturn(isLua(ci)?ci_func(ci)->l.p:NULL);\r\n}\r\nstatic void funcinfo(lua_Debug*ar,Closure*cl){\r\nif(cl->c.isC){\r\nar->source=\"=[C]\";\r\nar->linedefined=-1;\r\nar->lastlinedefined=-1;\r\nar->what=\"C\";\r\n}\r\nelse{\r\nar->source=getstr(cl->l.p->source);\r\nar->linedefined=cl->l.p->linedefined;\r\nar->lastlinedefined=cl->l.p->lastlinedefined;\r\nar->what=(ar->linedefined==0)?\"main\":\"Lua\";\r\n}\r\nluaO_chunkid(ar->short_src,ar->source,60);\r\n}\r\nstatic void info_tailcall(lua_Debug*ar){\r\nar->name=ar->namewhat=\"\";\r\nar->what=\"tail\";\r\nar->lastlinedefined=ar->linedefined=ar->currentline=-1;\r\nar->source=\"=(tail call)\";\r\nluaO_chunkid(ar->short_src,ar->source,60);\r\nar->nups=0;\r\n}\r\nstatic void collectvalidlines(lua_State*L,Closure*f){\r\nif(f==NULL||f->c.isC){\r\nsetnilvalue(L->top);\r\n}\r\nelse{\r\nTable*t=luaH_new(L,0,0);\r\nint*lineinfo=f->l.p->lineinfo;\r\nint i;\r\nfor(i=0;i<f->l.p->sizelineinfo;i++)\r\nsetbvalue(luaH_setnum(L,t,lineinfo[i]),1);\r\nsethvalue(L,L->top,t);\r\n}\r\nincr_top(L);\r\n}\r\nstatic int auxgetinfo(lua_State*L,const char*what,lua_Debug*ar,\r\nClosure*f,CallInfo*ci){\r\nint status=1;\r\nif(f==NULL){\r\ninfo_tailcall(ar);\r\nreturn status;\r\n}\r\nfor(;*what;what++){\r\nswitch(*what){\r\ncase'S':{\r\nfuncinfo(ar,f);\r\nbreak;\r\n}\r\ncase'l':{\r\nar->currentline=(ci)?currentline(L,ci):-1;\r\nbreak;\r\n}\r\ncase'u':{\r\nar->nups=f->c.nupvalues;\r\nbreak;\r\n}\r\ncase'n':{\r\nar->namewhat=(ci)?NULL:NULL;\r\nif(ar->namewhat==NULL){\r\nar->namewhat=\"\";\r\nar->name=NULL;\r\n}\r\nbreak;\r\n}\r\ncase'L':\r\ncase'f':\r\nbreak;\r\ndefault:status=0;\r\n}\r\n}\r\nreturn status;\r\n}\r\nstatic int lua_getinfo(lua_State*L,const char*what,lua_Debug*ar){\r\nint status;\r\nClosure*f=NULL;\r\nCallInfo*ci=NULL;\r\nif(*what=='>'){\r\nStkId func=L->top-1;\r\nluai_apicheck(L,ttisfunction(func));\r\nwhat++;\r\nf=clvalue(func);\r\nL->top--;\r\n}\r\nelse if(ar->i_ci!=0){\r\nci=L->base_ci+ar->i_ci;\r\nf=clvalue(ci->func);\r\n}\r\nstatus=auxgetinfo(L,what,ar,f,ci);\r\nif(strchr(what,'f')){\r\nif(f==NULL)setnilvalue(L->top);\r\nelse setclvalue(L,L->top,f);\r\nincr_top(L);\r\n}\r\nif(strchr(what,'L'))\r\ncollectvalidlines(L,f);\r\nreturn status;\r\n}\r\nstatic int isinstack(CallInfo*ci,const TValue*o){\r\nStkId p;\r\nfor(p=ci->base;p<ci->top;p++)\r\nif(o==p)return 1;\r\nreturn 0;\r\n}\r\nstatic void luaG_typeerror(lua_State*L,const TValue*o,const char*op){\r\nconst char*name=NULL;\r\nconst char*t=luaT_typenames[ttype(o)];\r\nconst char*kind=(isinstack(L->ci,o))?\r\nNULL:\r\nNULL;\r\nif(kind)\r\nluaG_runerror(L,\"attempt to %s %s \"LUA_QL(\"%s\")\" (a %s value)\",\r\nop,kind,name,t);\r\nelse\r\nluaG_runerror(L,\"attempt to %s a %s value\",op,t);\r\n}\r\nstatic void luaG_concaterror(lua_State*L,StkId p1,StkId p2){\r\nif(ttisstring(p1)||ttisnumber(p1))p1=p2;\r\nluaG_typeerror(L,p1,\"concatenate\");\r\n}\r\nstatic void luaG_aritherror(lua_State*L,const TValue*p1,const TValue*p2){\r\nTValue temp;\r\nif(luaV_tonumber(p1,&temp)==NULL)\r\np2=p1;\r\nluaG_typeerror(L,p2,\"perform arithmetic on\");\r\n}\r\nstatic int luaG_ordererror(lua_State*L,const TValue*p1,const TValue*p2){\r\nconst char*t1=luaT_typenames[ttype(p1)];\r\nconst char*t2=luaT_typenames[ttype(p2)];\r\nif(t1[2]==t2[2])\r\nluaG_runerror(L,\"attempt to compare two %s values\",t1);\r\nelse\r\nluaG_runerror(L,\"attempt to compare %s with %s\",t1,t2);\r\nreturn 0;\r\n}\r\nstatic void addinfo(lua_State*L,const char*msg){\r\nCallInfo*ci=L->ci;\r\nif(isLua(ci)){\r\nchar buff[60];\r\nint line=currentline(L,ci);\r\nluaO_chunkid(buff,getstr(getluaproto(ci)->source),60);\r\nluaO_pushfstring(L,\"%s:%d: %s\",buff,line,msg);\r\n}\r\n}\r\nstatic void luaG_errormsg(lua_State*L){\r\nif(L->errfunc!=0){\r\nStkId errfunc=restorestack(L,L->errfunc);\r\nif(!ttisfunction(errfunc))luaD_throw(L,5);\r\nsetobj(L,L->top,L->top-1);\r\nsetobj(L,L->top-1,errfunc);\r\nincr_top(L);\r\nluaD_call(L,L->top-2,1);\r\n}\r\nluaD_throw(L,2);\r\n}\r\nstatic void luaG_runerror(lua_State*L,const char*fmt,...){\r\nva_list argp;\r\nva_start(argp,fmt);\r\naddinfo(L,luaO_pushvfstring(L,fmt,argp));\r\nva_end(argp);\r\nluaG_errormsg(L);\r\n}\r\nstatic int luaZ_fill(ZIO*z){\r\nsize_t size;\r\nlua_State*L=z->L;\r\nconst char*buff;\r\nbuff=z->reader(L,z->data,&size);\r\nif(buff==NULL||size==0)return(-1);\r\nz->n=size-1;\r\nz->p=buff;\r\nreturn char2int(*(z->p++));\r\n}\r\nstatic void luaZ_init(lua_State*L,ZIO*z,lua_Reader reader,void*data){\r\nz->L=L;\r\nz->reader=reader;\r\nz->data=data;\r\nz->n=0;\r\nz->p=NULL;\r\n}\r\nstatic char*luaZ_openspace(lua_State*L,Mbuffer*buff,size_t n){\r\nif(n>buff->buffsize){\r\nif(n<32)n=32;\r\nluaZ_resizebuffer(L,buff,n);\r\n}\r\nreturn buff->buffer;\r\n}\r\n#define opmode(t,a,b,c,m)(((t)<<7)|((a)<<6)|((b)<<4)|((c)<<2)|(m))\r\nstatic const lu_byte luaP_opmodes[(cast(int,OP_VARARG)+1)]={\r\nopmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgK,OpArgN,iABx)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgU,OpArgN,iABC)\r\n,opmode(0,1,OpArgK,OpArgN,iABx)\r\n,opmode(0,1,OpArgR,OpArgK,iABC)\r\n,opmode(0,0,OpArgK,OpArgN,iABx)\r\n,opmode(0,0,OpArgU,OpArgN,iABC)\r\n,opmode(0,0,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgR,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgR,iABC)\r\n,opmode(0,0,OpArgR,OpArgN,iAsBx)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,1,OpArgR,OpArgU,iABC)\r\n,opmode(1,1,OpArgR,OpArgU,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,0,OpArgU,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iAsBx)\r\n,opmode(0,1,OpArgR,OpArgN,iAsBx)\r\n,opmode(1,0,OpArgN,OpArgU,iABC)\r\n,opmode(0,0,OpArgU,OpArgU,iABC)\r\n,opmode(0,0,OpArgN,OpArgN,iABC)\r\n,opmode(0,1,OpArgU,OpArgN,iABx)\r\n,opmode(0,1,OpArgU,OpArgN,iABC)\r\n};\r\n#define next(ls)(ls->current=zgetc(ls->z))\r\n#define currIsNewline(ls)(ls->current=='\\n'||ls->current=='\\r')\r\nstatic const char*const luaX_tokens[]={\r\n\"and\",\"break\",\"do\",\"else\",\"elseif\",\r\n\"end\",\"false\",\"for\",\"function\",\"if\",\r\n\"in\",\"local\",\"nil\",\"not\",\"or\",\"repeat\",\r\n\"return\",\"then\",\"true\",\"until\",\"while\",\r\n\"..\",\"...\",\"==\",\">=\",\"<=\",\"~=\",\r\n\"<number>\",\"<name>\",\"<string>\",\"<eof>\",\r\nNULL\r\n};\r\n#define save_and_next(ls)(save(ls,ls->current),next(ls))\r\nstatic void save(LexState*ls,int c){\r\nMbuffer*b=ls->buff;\r\nif(b->n+1>b->buffsize){\r\nsize_t newsize;\r\nif(b->buffsize>=((size_t)(~(size_t)0)-2)/2)\r\nluaX_lexerror(ls,\"lexical element too long\",0);\r\nnewsize=b->buffsize*2;\r\nluaZ_resizebuffer(ls->L,b,newsize);\r\n}\r\nb->buffer[b->n++]=cast(char,c);\r\n}\r\nstatic void luaX_init(lua_State*L){\r\nint i;\r\nfor(i=0;i<(cast(int,TK_WHILE-257+1));i++){\r\nTString*ts=luaS_new(L,luaX_tokens[i]);\r\nluaS_fix(ts);\r\nts->tsv.reserved=cast_byte(i+1);\r\n}\r\n}\r\nstatic const char*luaX_token2str(LexState*ls,int token){\r\nif(token<257){\r\nreturn(iscntrl(token))?luaO_pushfstring(ls->L,\"char(%d)\",token):\r\nluaO_pushfstring(ls->L,\"%c\",token);\r\n}\r\nelse\r\nreturn luaX_tokens[token-257];\r\n}\r\nstatic const char*txtToken(LexState*ls,int token){\r\nswitch(token){\r\ncase TK_NAME:\r\ncase TK_STRING:\r\ncase TK_NUMBER:\r\nsave(ls,'\\0');\r\nreturn luaZ_buffer(ls->buff);\r\ndefault:\r\nreturn luaX_token2str(ls,token);\r\n}\r\n}\r\nstatic void luaX_lexerror(LexState*ls,const char*msg,int token){\r\nchar buff[80];\r\nluaO_chunkid(buff,getstr(ls->source),80);\r\nmsg=luaO_pushfstring(ls->L,\"%s:%d: %s\",buff,ls->linenumber,msg);\r\nif(token)\r\nluaO_pushfstring(ls->L,\"%s near \"LUA_QL(\"%s\"),msg,txtToken(ls,token));\r\nluaD_throw(ls->L,3);\r\n}\r\nstatic void luaX_syntaxerror(LexState*ls,const char*msg){\r\nluaX_lexerror(ls,msg,ls->t.token);\r\n}\r\nstatic TString*luaX_newstring(LexState*ls,const char*str,size_t l){\r\nlua_State*L=ls->L;\r\nTString*ts=luaS_newlstr(L,str,l);\r\nTValue*o=luaH_setstr(L,ls->fs->h,ts);\r\nif(ttisnil(o)){\r\nsetbvalue(o,1);\r\nluaC_checkGC(L);\r\n}\r\nreturn ts;\r\n}\r\nstatic void inclinenumber(LexState*ls){\r\nint old=ls->current;\r\nnext(ls);\r\nif(currIsNewline(ls)&&ls->current!=old)\r\nnext(ls);\r\nif(++ls->linenumber>=(INT_MAX-2))\r\nluaX_syntaxerror(ls,\"chunk has too many lines\");\r\n}\r\nstatic void luaX_setinput(lua_State*L,LexState*ls,ZIO*z,TString*source){\r\nls->decpoint='.';\r\nls->L=L;\r\nls->lookahead.token=TK_EOS;\r\nls->z=z;\r\nls->fs=NULL;\r\nls->linenumber=1;\r\nls->lastline=1;\r\nls->source=source;\r\nluaZ_resizebuffer(ls->L,ls->buff,32);\r\nnext(ls);\r\n}\r\nstatic int check_next(LexState*ls,const char*set){\r\nif(!strchr(set,ls->current))\r\nreturn 0;\r\nsave_and_next(ls);\r\nreturn 1;\r\n}\r\nstatic void buffreplace(LexState*ls,char from,char to){\r\nsize_t n=luaZ_bufflen(ls->buff);\r\nchar*p=luaZ_buffer(ls->buff);\r\nwhile(n--)\r\nif(p[n]==from)p[n]=to;\r\n}\r\nstatic void read_numeral(LexState*ls,SemInfo*seminfo){\r\ndo{\r\nsave_and_next(ls);\r\n}while(isdigit(ls->current)||ls->current=='.');\r\nif(check_next(ls,\"Ee\"))\r\ncheck_next(ls,\"+-\");\r\nwhile(isalnum(ls->current)||ls->current=='_')\r\nsave_and_next(ls);\r\nsave(ls,'\\0');\r\nbuffreplace(ls,'.',ls->decpoint);\r\nif(!luaO_str2d(luaZ_buffer(ls->buff),&seminfo->r))\r\nluaX_lexerror(ls,\"malformed number\",TK_NUMBER);\r\n}\r\nstatic int skip_sep(LexState*ls){\r\nint count=0;\r\nint s=ls->current;\r\nsave_and_next(ls);\r\nwhile(ls->current=='='){\r\nsave_and_next(ls);\r\ncount++;\r\n}\r\nreturn(ls->current==s)?count:(-count)-1;\r\n}\r\nstatic void read_long_string(LexState*ls,SemInfo*seminfo,int sep){\r\nint cont=0;\r\n(void)(cont);\r\nsave_and_next(ls);\r\nif(currIsNewline(ls))\r\ninclinenumber(ls);\r\nfor(;;){\r\nswitch(ls->current){\r\ncase(-1):\r\nluaX_lexerror(ls,(seminfo)?\"unfinished long string\":\r\n\"unfinished long comment\",TK_EOS);\r\nbreak;\r\ncase']':{\r\nif(skip_sep(ls)==sep){\r\nsave_and_next(ls);\r\ngoto endloop;\r\n}\r\nbreak;\r\n}\r\ncase'\\n':\r\ncase'\\r':{\r\nsave(ls,'\\n');\r\ninclinenumber(ls);\r\nif(!seminfo)luaZ_resetbuffer(ls->buff);\r\nbreak;\r\n}\r\ndefault:{\r\nif(seminfo)save_and_next(ls);\r\nelse next(ls);\r\n}\r\n}\r\n}endloop:\r\nif(seminfo)\r\nseminfo->ts=luaX_newstring(ls,luaZ_buffer(ls->buff)+(2+sep),\r\nluaZ_bufflen(ls->buff)-2*(2+sep));\r\n}\r\nstatic void read_string(LexState*ls,int del,SemInfo*seminfo){\r\nsave_and_next(ls);\r\nwhile(ls->current!=del){\r\nswitch(ls->current){\r\ncase(-1):\r\nluaX_lexerror(ls,\"unfinished string\",TK_EOS);\r\ncontinue;\r\ncase'\\n':\r\ncase'\\r':\r\nluaX_lexerror(ls,\"unfinished string\",TK_STRING);\r\ncontinue;\r\ncase'\\\\':{\r\nint c;\r\nnext(ls);\r\nswitch(ls->current){\r\ncase'a':c='\\a';break;\r\ncase'b':c='\\b';break;\r\ncase'f':c='\\f';break;\r\ncase'n':c='\\n';break;\r\ncase'r':c='\\r';break;\r\ncase't':c='\\t';break;\r\ncase'v':c='\\v';break;\r\ncase'\\n':\r\ncase'\\r':save(ls,'\\n');inclinenumber(ls);continue;\r\ncase(-1):continue;\r\ndefault:{\r\nif(!isdigit(ls->current))\r\nsave_and_next(ls);\r\nelse{\r\nint i=0;\r\nc=0;\r\ndo{\r\nc=10*c+(ls->current-'0');\r\nnext(ls);\r\n}while(++i<3&&isdigit(ls->current));\r\nif(c>UCHAR_MAX)\r\nluaX_lexerror(ls,\"escape sequence too large\",TK_STRING);\r\nsave(ls,c);\r\n}\r\ncontinue;\r\n}\r\n}\r\nsave(ls,c);\r\nnext(ls);\r\ncontinue;\r\n}\r\ndefault:\r\nsave_and_next(ls);\r\n}\r\n}\r\nsave_and_next(ls);\r\nseminfo->ts=luaX_newstring(ls,luaZ_buffer(ls->buff)+1,\r\nluaZ_bufflen(ls->buff)-2);\r\n}\r\nstatic int llex(LexState*ls,SemInfo*seminfo){\r\nluaZ_resetbuffer(ls->buff);\r\nfor(;;){\r\nswitch(ls->current){\r\ncase'\\n':\r\ncase'\\r':{\r\ninclinenumber(ls);\r\ncontinue;\r\n}\r\ncase'-':{\r\nnext(ls);\r\nif(ls->current!='-')return'-';\r\nnext(ls);\r\nif(ls->current=='['){\r\nint sep=skip_sep(ls);\r\nluaZ_resetbuffer(ls->buff);\r\nif(sep>=0){\r\nread_long_string(ls,NULL,sep);\r\nluaZ_resetbuffer(ls->buff);\r\ncontinue;\r\n}\r\n}\r\nwhile(!currIsNewline(ls)&&ls->current!=(-1))\r\nnext(ls);\r\ncontinue;\r\n}\r\ncase'[':{\r\nint sep=skip_sep(ls);\r\nif(sep>=0){\r\nread_long_string(ls,seminfo,sep);\r\nreturn TK_STRING;\r\n}\r\nelse if(sep==-1)return'[';\r\nelse luaX_lexerror(ls,\"invalid long string delimiter\",TK_STRING);\r\n}\r\ncase'=':{\r\nnext(ls);\r\nif(ls->current!='=')return'=';\r\nelse{next(ls);return TK_EQ;}\r\n}\r\ncase'<':{\r\nnext(ls);\r\nif(ls->current!='=')return'<';\r\nelse{next(ls);return TK_LE;}\r\n}\r\ncase'>':{\r\nnext(ls);\r\nif(ls->current!='=')return'>';\r\nelse{next(ls);return TK_GE;}\r\n}\r\ncase'~':{\r\nnext(ls);\r\nif(ls->current!='=')return'~';\r\nelse{next(ls);return TK_NE;}\r\n}\r\ncase'\"':\r\ncase'\\'':{\r\nread_string(ls,ls->current,seminfo);\r\nreturn TK_STRING;\r\n}\r\ncase'.':{\r\nsave_and_next(ls);\r\nif(check_next(ls,\".\")){\r\nif(check_next(ls,\".\"))\r\nreturn TK_DOTS;\r\nelse return TK_CONCAT;\r\n}\r\nelse if(!isdigit(ls->current))return'.';\r\nelse{\r\nread_numeral(ls,seminfo);\r\nreturn TK_NUMBER;\r\n}\r\n}\r\ncase(-1):{\r\nreturn TK_EOS;\r\n}\r\ndefault:{\r\nif(isspace(ls->current)){\r\nnext(ls);\r\ncontinue;\r\n}\r\nelse if(isdigit(ls->current)){\r\nread_numeral(ls,seminfo);\r\nreturn TK_NUMBER;\r\n}\r\nelse if(isalpha(ls->current)||ls->current=='_'){\r\nTString*ts;\r\ndo{\r\nsave_and_next(ls);\r\n}while(isalnum(ls->current)||ls->current=='_');\r\nts=luaX_newstring(ls,luaZ_buffer(ls->buff),\r\nluaZ_bufflen(ls->buff));\r\nif(ts->tsv.reserved>0)\r\nreturn ts->tsv.reserved-1+257;\r\nelse{\r\nseminfo->ts=ts;\r\nreturn TK_NAME;\r\n}\r\n}\r\nelse{\r\nint c=ls->current;\r\nnext(ls);\r\nreturn c;\r\n}\r\n}\r\n}\r\n}\r\n}\r\nstatic void luaX_next(LexState*ls){\r\nls->lastline=ls->linenumber;\r\nif(ls->lookahead.token!=TK_EOS){\r\nls->t=ls->lookahead;\r\nls->lookahead.token=TK_EOS;\r\n}\r\nelse\r\nls->t.token=llex(ls,&ls->t.seminfo);\r\n}\r\nstatic void luaX_lookahead(LexState*ls){\r\nls->lookahead.token=llex(ls,&ls->lookahead.seminfo);\r\n}\r\n#define hasjumps(e)((e)->t!=(e)->f)\r\nstatic int isnumeral(expdesc*e){\r\nreturn(e->k==VKNUM&&e->t==(-1)&&e->f==(-1));\r\n}\r\nstatic void luaK_nil(FuncState*fs,int from,int n){\r\nInstruction*previous;\r\nif(fs->pc>fs->lasttarget){\r\nif(fs->pc==0){\r\nif(from>=fs->nactvar)\r\nreturn;\r\n}\r\nelse{\r\nprevious=&fs->f->code[fs->pc-1];\r\nif(GET_OPCODE(*previous)==OP_LOADNIL){\r\nint pfrom=GETARG_A(*previous);\r\nint pto=GETARG_B(*previous);\r\nif(pfrom<=from&&from<=pto+1){\r\nif(from+n-1>pto)\r\nSETARG_B(*previous,from+n-1);\r\nreturn;\r\n}\r\n}\r\n}\r\n}\r\nluaK_codeABC(fs,OP_LOADNIL,from,from+n-1,0);\r\n}\r\nstatic int luaK_jump(FuncState*fs){\r\nint jpc=fs->jpc;\r\nint j;\r\nfs->jpc=(-1);\r\nj=luaK_codeAsBx(fs,OP_JMP,0,(-1));\r\nluaK_concat(fs,&j,jpc);\r\nreturn j;\r\n}\r\nstatic void luaK_ret(FuncState*fs,int first,int nret){\r\nluaK_codeABC(fs,OP_RETURN,first,nret+1,0);\r\n}\r\nstatic int condjump(FuncState*fs,OpCode op,int A,int B,int C){\r\nluaK_codeABC(fs,op,A,B,C);\r\nreturn luaK_jump(fs);\r\n}\r\nstatic void fixjump(FuncState*fs,int pc,int dest){\r\nInstruction*jmp=&fs->f->code[pc];\r\nint offset=dest-(pc+1);\r\nif(abs(offset)>(((1<<(9+9))-1)>>1))\r\nluaX_syntaxerror(fs->ls,\"control structure too long\");\r\nSETARG_sBx(*jmp,offset);\r\n}\r\nstatic int luaK_getlabel(FuncState*fs){\r\nfs->lasttarget=fs->pc;\r\nreturn fs->pc;\r\n}\r\nstatic int getjump(FuncState*fs,int pc){\r\nint offset=GETARG_sBx(fs->f->code[pc]);\r\nif(offset==(-1))\r\nreturn(-1);\r\nelse\r\nreturn(pc+1)+offset;\r\n}\r\nstatic Instruction*getjumpcontrol(FuncState*fs,int pc){\r\nInstruction*pi=&fs->f->code[pc];\r\nif(pc>=1&&testTMode(GET_OPCODE(*(pi-1))))\r\nreturn pi-1;\r\nelse\r\nreturn pi;\r\n}\r\nstatic int need_value(FuncState*fs,int list){\r\nfor(;list!=(-1);list=getjump(fs,list)){\r\nInstruction i=*getjumpcontrol(fs,list);\r\nif(GET_OPCODE(i)!=OP_TESTSET)return 1;\r\n}\r\nreturn 0;\r\n}\r\nstatic int patchtestreg(FuncState*fs,int node,int reg){\r\nInstruction*i=getjumpcontrol(fs,node);\r\nif(GET_OPCODE(*i)!=OP_TESTSET)\r\nreturn 0;\r\nif(reg!=((1<<8)-1)&&reg!=GETARG_B(*i))\r\nSETARG_A(*i,reg);\r\nelse\r\n*i=CREATE_ABC(OP_TEST,GETARG_B(*i),0,GETARG_C(*i));\r\nreturn 1;\r\n}\r\nstatic void removevalues(FuncState*fs,int list){\r\nfor(;list!=(-1);list=getjump(fs,list))\r\npatchtestreg(fs,list,((1<<8)-1));\r\n}\r\nstatic void patchlistaux(FuncState*fs,int list,int vtarget,int reg,\r\nint dtarget){\r\nwhile(list!=(-1)){\r\nint next=getjump(fs,list);\r\nif(patchtestreg(fs,list,reg))\r\nfixjump(fs,list,vtarget);\r\nelse\r\nfixjump(fs,list,dtarget);\r\nlist=next;\r\n}\r\n}\r\nstatic void dischargejpc(FuncState*fs){\r\npatchlistaux(fs,fs->jpc,fs->pc,((1<<8)-1),fs->pc);\r\nfs->jpc=(-1);\r\n}\r\nstatic void luaK_patchlist(FuncState*fs,int list,int target){\r\nif(target==fs->pc)\r\nluaK_patchtohere(fs,list);\r\nelse{\r\npatchlistaux(fs,list,target,((1<<8)-1),target);\r\n}\r\n}\r\nstatic void luaK_patchtohere(FuncState*fs,int list){\r\nluaK_getlabel(fs);\r\nluaK_concat(fs,&fs->jpc,list);\r\n}\r\nstatic void luaK_concat(FuncState*fs,int*l1,int l2){\r\nif(l2==(-1))return;\r\nelse if(*l1==(-1))\r\n*l1=l2;\r\nelse{\r\nint list=*l1;\r\nint next;\r\nwhile((next=getjump(fs,list))!=(-1))\r\nlist=next;\r\nfixjump(fs,list,l2);\r\n}\r\n}\r\nstatic void luaK_checkstack(FuncState*fs,int n){\r\nint newstack=fs->freereg+n;\r\nif(newstack>fs->f->maxstacksize){\r\nif(newstack>=250)\r\nluaX_syntaxerror(fs->ls,\"function or expression too complex\");\r\nfs->f->maxstacksize=cast_byte(newstack);\r\n}\r\n}\r\nstatic void luaK_reserveregs(FuncState*fs,int n){\r\nluaK_checkstack(fs,n);\r\nfs->freereg+=n;\r\n}\r\nstatic void freereg(FuncState*fs,int reg){\r\nif(!ISK(reg)&&reg>=fs->nactvar){\r\nfs->freereg--;\r\n}\r\n}\r\nstatic void freeexp(FuncState*fs,expdesc*e){\r\nif(e->k==VNONRELOC)\r\nfreereg(fs,e->u.s.info);\r\n}\r\nstatic int addk(FuncState*fs,TValue*k,TValue*v){\r\nlua_State*L=fs->L;\r\nTValue*idx=luaH_set(L,fs->h,k);\r\nProto*f=fs->f;\r\nint oldsize=f->sizek;\r\nif(ttisnumber(idx)){\r\nreturn cast_int(nvalue(idx));\r\n}\r\nelse{\r\nsetnvalue(idx,cast_num(fs->nk));\r\nluaM_growvector(L,f->k,fs->nk,f->sizek,TValue,\r\n((1<<(9+9))-1),\"constant table overflow\");\r\nwhile(oldsize<f->sizek)setnilvalue(&f->k[oldsize++]);\r\nsetobj(L,&f->k[fs->nk],v);\r\nluaC_barrier(L,f,v);\r\nreturn fs->nk++;\r\n}\r\n}\r\nstatic int luaK_stringK(FuncState*fs,TString*s){\r\nTValue o;\r\nsetsvalue(fs->L,&o,s);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int luaK_numberK(FuncState*fs,lua_Number r){\r\nTValue o;\r\nsetnvalue(&o,r);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int boolK(FuncState*fs,int b){\r\nTValue o;\r\nsetbvalue(&o,b);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int nilK(FuncState*fs){\r\nTValue k,v;\r\nsetnilvalue(&v);\r\nsethvalue(fs->L,&k,fs->h);\r\nreturn addk(fs,&k,&v);\r\n}\r\nstatic void luaK_setreturns(FuncState*fs,expdesc*e,int nresults){\r\nif(e->k==VCALL){\r\nSETARG_C(getcode(fs,e),nresults+1);\r\n}\r\nelse if(e->k==VVARARG){\r\nSETARG_B(getcode(fs,e),nresults+1);\r\nSETARG_A(getcode(fs,e),fs->freereg);\r\nluaK_reserveregs(fs,1);\r\n}\r\n}\r\nstatic void luaK_setoneret(FuncState*fs,expdesc*e){\r\nif(e->k==VCALL){\r\ne->k=VNONRELOC;\r\ne->u.s.info=GETARG_A(getcode(fs,e));\r\n}\r\nelse if(e->k==VVARARG){\r\nSETARG_B(getcode(fs,e),2);\r\ne->k=VRELOCABLE;\r\n}\r\n}\r\nstatic void luaK_dischargevars(FuncState*fs,expdesc*e){\r\nswitch(e->k){\r\ncase VLOCAL:{\r\ne->k=VNONRELOC;\r\nbreak;\r\n}\r\ncase VUPVAL:{\r\ne->u.s.info=luaK_codeABC(fs,OP_GETUPVAL,0,e->u.s.info,0);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VGLOBAL:{\r\ne->u.s.info=luaK_codeABx(fs,OP_GETGLOBAL,0,e->u.s.info);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VINDEXED:{\r\nfreereg(fs,e->u.s.aux);\r\nfreereg(fs,e->u.s.info);\r\ne->u.s.info=luaK_codeABC(fs,OP_GETTABLE,0,e->u.s.info,e->u.s.aux);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VVARARG:\r\ncase VCALL:{\r\nluaK_setoneret(fs,e);\r\nbreak;\r\n}\r\ndefault:break;\r\n}\r\n}\r\nstatic int code_label(FuncState*fs,int A,int b,int jump){\r\nluaK_getlabel(fs);\r\nreturn luaK_codeABC(fs,OP_LOADBOOL,A,b,jump);\r\n}\r\nstatic void discharge2reg(FuncState*fs,expdesc*e,int reg){\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:{\r\nluaK_nil(fs,reg,1);\r\nbreak;\r\n}\r\ncase VFALSE:case VTRUE:{\r\nluaK_codeABC(fs,OP_LOADBOOL,reg,e->k==VTRUE,0);\r\nbreak;\r\n}\r\ncase VK:{\r\nluaK_codeABx(fs,OP_LOADK,reg,e->u.s.info);\r\nbreak;\r\n}\r\ncase VKNUM:{\r\nluaK_codeABx(fs,OP_LOADK,reg,luaK_numberK(fs,e->u.nval));\r\nbreak;\r\n}\r\ncase VRELOCABLE:{\r\nInstruction*pc=&getcode(fs,e);\r\nSETARG_A(*pc,reg);\r\nbreak;\r\n}\r\ncase VNONRELOC:{\r\nif(reg!=e->u.s.info)\r\nluaK_codeABC(fs,OP_MOVE,reg,e->u.s.info,0);\r\nbreak;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\ne->u.s.info=reg;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void discharge2anyreg(FuncState*fs,expdesc*e){\r\nif(e->k!=VNONRELOC){\r\nluaK_reserveregs(fs,1);\r\ndischarge2reg(fs,e,fs->freereg-1);\r\n}\r\n}\r\nstatic void exp2reg(FuncState*fs,expdesc*e,int reg){\r\ndischarge2reg(fs,e,reg);\r\nif(e->k==VJMP)\r\nluaK_concat(fs,&e->t,e->u.s.info);\r\nif(hasjumps(e)){\r\nint final;\r\nint p_f=(-1);\r\nint p_t=(-1);\r\nif(need_value(fs,e->t)||need_value(fs,e->f)){\r\nint fj=(e->k==VJMP)?(-1):luaK_jump(fs);\r\np_f=code_label(fs,reg,0,1);\r\np_t=code_label(fs,reg,1,0);\r\nluaK_patchtohere(fs,fj);\r\n}\r\nfinal=luaK_getlabel(fs);\r\npatchlistaux(fs,e->f,final,reg,p_f);\r\npatchlistaux(fs,e->t,final,reg,p_t);\r\n}\r\ne->f=e->t=(-1);\r\ne->u.s.info=reg;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void luaK_exp2nextreg(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nfreeexp(fs,e);\r\nluaK_reserveregs(fs,1);\r\nexp2reg(fs,e,fs->freereg-1);\r\n}\r\nstatic int luaK_exp2anyreg(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nif(e->k==VNONRELOC){\r\nif(!hasjumps(e))return e->u.s.info;\r\nif(e->u.s.info>=fs->nactvar){\r\nexp2reg(fs,e,e->u.s.info);\r\nreturn e->u.s.info;\r\n}\r\n}\r\nluaK_exp2nextreg(fs,e);\r\nreturn e->u.s.info;\r\n}\r\nstatic void luaK_exp2val(FuncState*fs,expdesc*e){\r\nif(hasjumps(e))\r\nluaK_exp2anyreg(fs,e);\r\nelse\r\nluaK_dischargevars(fs,e);\r\n}\r\nstatic int luaK_exp2RK(FuncState*fs,expdesc*e){\r\nluaK_exp2val(fs,e);\r\nswitch(e->k){\r\ncase VKNUM:\r\ncase VTRUE:\r\ncase VFALSE:\r\ncase VNIL:{\r\nif(fs->nk<=((1<<(9-1))-1)){\r\ne->u.s.info=(e->k==VNIL)?nilK(fs):\r\n(e->k==VKNUM)?luaK_numberK(fs,e->u.nval):\r\nboolK(fs,(e->k==VTRUE));\r\ne->k=VK;\r\nreturn RKASK(e->u.s.info);\r\n}\r\nelse break;\r\n}\r\ncase VK:{\r\nif(e->u.s.info<=((1<<(9-1))-1))\r\nreturn RKASK(e->u.s.info);\r\nelse break;\r\n}\r\ndefault:break;\r\n}\r\nreturn luaK_exp2anyreg(fs,e);\r\n}\r\nstatic void luaK_storevar(FuncState*fs,expdesc*var,expdesc*ex){\r\nswitch(var->k){\r\ncase VLOCAL:{\r\nfreeexp(fs,ex);\r\nexp2reg(fs,ex,var->u.s.info);\r\nreturn;\r\n}\r\ncase VUPVAL:{\r\nint e=luaK_exp2anyreg(fs,ex);\r\nluaK_codeABC(fs,OP_SETUPVAL,e,var->u.s.info,0);\r\nbreak;\r\n}\r\ncase VGLOBAL:{\r\nint e=luaK_exp2anyreg(fs,ex);\r\nluaK_codeABx(fs,OP_SETGLOBAL,e,var->u.s.info);\r\nbreak;\r\n}\r\ncase VINDEXED:{\r\nint e=luaK_exp2RK(fs,ex);\r\nluaK_codeABC(fs,OP_SETTABLE,var->u.s.info,var->u.s.aux,e);\r\nbreak;\r\n}\r\ndefault:{\r\nbreak;\r\n}\r\n}\r\nfreeexp(fs,ex);\r\n}\r\nstatic void luaK_self(FuncState*fs,expdesc*e,expdesc*key){\r\nint func;\r\nluaK_exp2anyreg(fs,e);\r\nfreeexp(fs,e);\r\nfunc=fs->freereg;\r\nluaK_reserveregs(fs,2);\r\nluaK_codeABC(fs,OP_SELF,func,e->u.s.info,luaK_exp2RK(fs,key));\r\nfreeexp(fs,key);\r\ne->u.s.info=func;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void invertjump(FuncState*fs,expdesc*e){\r\nInstruction*pc=getjumpcontrol(fs,e->u.s.info);\r\nSETARG_A(*pc,!(GETARG_A(*pc)));\r\n}\r\nstatic int jumponcond(FuncState*fs,expdesc*e,int cond){\r\nif(e->k==VRELOCABLE){\r\nInstruction ie=getcode(fs,e);\r\nif(GET_OPCODE(ie)==OP_NOT){\r\nfs->pc--;\r\nreturn condjump(fs,OP_TEST,GETARG_B(ie),0,!cond);\r\n}\r\n}\r\ndischarge2anyreg(fs,e);\r\nfreeexp(fs,e);\r\nreturn condjump(fs,OP_TESTSET,((1<<8)-1),e->u.s.info,cond);\r\n}\r\nstatic void luaK_goiftrue(FuncState*fs,expdesc*e){\r\nint pc;\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VK:case VKNUM:case VTRUE:{\r\npc=(-1);\r\nbreak;\r\n}\r\ncase VJMP:{\r\ninvertjump(fs,e);\r\npc=e->u.s.info;\r\nbreak;\r\n}\r\ndefault:{\r\npc=jumponcond(fs,e,0);\r\nbreak;\r\n}\r\n}\r\nluaK_concat(fs,&e->f,pc);\r\nluaK_patchtohere(fs,e->t);\r\ne->t=(-1);\r\n}\r\nstatic void luaK_goiffalse(FuncState*fs,expdesc*e){\r\nint pc;\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:case VFALSE:{\r\npc=(-1);\r\nbreak;\r\n}\r\ncase VJMP:{\r\npc=e->u.s.info;\r\nbreak;\r\n}\r\ndefault:{\r\npc=jumponcond(fs,e,1);\r\nbreak;\r\n}\r\n}\r\nluaK_concat(fs,&e->t,pc);\r\nluaK_patchtohere(fs,e->f);\r\ne->f=(-1);\r\n}\r\nstatic void codenot(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:case VFALSE:{\r\ne->k=VTRUE;\r\nbreak;\r\n}\r\ncase VK:case VKNUM:case VTRUE:{\r\ne->k=VFALSE;\r\nbreak;\r\n}\r\ncase VJMP:{\r\ninvertjump(fs,e);\r\nbreak;\r\n}\r\ncase VRELOCABLE:\r\ncase VNONRELOC:{\r\ndischarge2anyreg(fs,e);\r\nfreeexp(fs,e);\r\ne->u.s.info=luaK_codeABC(fs,OP_NOT,0,e->u.s.info,0);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ndefault:{\r\nbreak;\r\n}\r\n}\r\n{int temp=e->f;e->f=e->t;e->t=temp;}\r\nremovevalues(fs,e->f);\r\nremovevalues(fs,e->t);\r\n}\r\nstatic void luaK_indexed(FuncState*fs,expdesc*t,expdesc*k){\r\nt->u.s.aux=luaK_exp2RK(fs,k);\r\nt->k=VINDEXED;\r\n}\r\nstatic int constfolding(OpCode op,expdesc*e1,expdesc*e2){\r\nlua_Number v1,v2,r;\r\nif(!isnumeral(e1)||!isnumeral(e2))return 0;\r\nv1=e1->u.nval;\r\nv2=e2->u.nval;\r\nswitch(op){\r\ncase OP_ADD:r=luai_numadd(v1,v2);break;\r\ncase OP_SUB:r=luai_numsub(v1,v2);break;\r\ncase OP_MUL:r=luai_nummul(v1,v2);break;\r\ncase OP_DIV:\r\nif(v2==0)return 0;\r\nr=luai_numdiv(v1,v2);break;\r\ncase OP_MOD:\r\nif(v2==0)return 0;\r\nr=luai_nummod(v1,v2);break;\r\ncase OP_POW:r=luai_numpow(v1,v2);break;\r\ncase OP_UNM:r=luai_numunm(v1);break;\r\ncase OP_LEN:return 0;\r\ndefault:r=0;break;\r\n}\r\nif(luai_numisnan(r))return 0;\r\ne1->u.nval=r;\r\nreturn 1;\r\n}\r\nstatic void codearith(FuncState*fs,OpCode op,expdesc*e1,expdesc*e2){\r\nif(constfolding(op,e1,e2))\r\nreturn;\r\nelse{\r\nint o2=(op!=OP_UNM&&op!=OP_LEN)?luaK_exp2RK(fs,e2):0;\r\nint o1=luaK_exp2RK(fs,e1);\r\nif(o1>o2){\r\nfreeexp(fs,e1);\r\nfreeexp(fs,e2);\r\n}\r\nelse{\r\nfreeexp(fs,e2);\r\nfreeexp(fs,e1);\r\n}\r\ne1->u.s.info=luaK_codeABC(fs,op,0,o1,o2);\r\ne1->k=VRELOCABLE;\r\n}\r\n}\r\nstatic void codecomp(FuncState*fs,OpCode op,int cond,expdesc*e1,\r\nexpdesc*e2){\r\nint o1=luaK_exp2RK(fs,e1);\r\nint o2=luaK_exp2RK(fs,e2);\r\nfreeexp(fs,e2);\r\nfreeexp(fs,e1);\r\nif(cond==0&&op!=OP_EQ){\r\nint temp;\r\ntemp=o1;o1=o2;o2=temp;\r\ncond=1;\r\n}\r\ne1->u.s.info=condjump(fs,op,cond,o1,o2);\r\ne1->k=VJMP;\r\n}\r\nstatic void luaK_prefix(FuncState*fs,UnOpr op,expdesc*e){\r\nexpdesc e2;\r\ne2.t=e2.f=(-1);e2.k=VKNUM;e2.u.nval=0;\r\nswitch(op){\r\ncase OPR_MINUS:{\r\nif(!isnumeral(e))\r\nluaK_exp2anyreg(fs,e);\r\ncodearith(fs,OP_UNM,e,&e2);\r\nbreak;\r\n}\r\ncase OPR_NOT:codenot(fs,e);break;\r\ncase OPR_LEN:{\r\nluaK_exp2anyreg(fs,e);\r\ncodearith(fs,OP_LEN,e,&e2);\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\nstatic void luaK_infix(FuncState*fs,BinOpr op,expdesc*v){\r\nswitch(op){\r\ncase OPR_AND:{\r\nluaK_goiftrue(fs,v);\r\nbreak;\r\n}\r\ncase OPR_OR:{\r\nluaK_goiffalse(fs,v);\r\nbreak;\r\n}\r\ncase OPR_CONCAT:{\r\nluaK_exp2nextreg(fs,v);\r\nbreak;\r\n}\r\ncase OPR_ADD:case OPR_SUB:case OPR_MUL:case OPR_DIV:\r\ncase OPR_MOD:case OPR_POW:{\r\nif(!isnumeral(v))luaK_exp2RK(fs,v);\r\nbreak;\r\n}\r\ndefault:{\r\nluaK_exp2RK(fs,v);\r\nbreak;\r\n}\r\n}\r\n}\r\nstatic void luaK_posfix(FuncState*fs,BinOpr op,expdesc*e1,expdesc*e2){\r\nswitch(op){\r\ncase OPR_AND:{\r\nluaK_dischargevars(fs,e2);\r\nluaK_concat(fs,&e2->f,e1->f);\r\n*e1=*e2;\r\nbreak;\r\n}\r\ncase OPR_OR:{\r\nluaK_dischargevars(fs,e2);\r\nluaK_concat(fs,&e2->t,e1->t);\r\n*e1=*e2;\r\nbreak;\r\n}\r\ncase OPR_CONCAT:{\r\nluaK_exp2val(fs,e2);\r\nif(e2->k==VRELOCABLE&&GET_OPCODE(getcode(fs,e2))==OP_CONCAT){\r\nfreeexp(fs,e1);\r\nSETARG_B(getcode(fs,e2),e1->u.s.info);\r\ne1->k=VRELOCABLE;e1->u.s.info=e2->u.s.info;\r\n}\r\nelse{\r\nluaK_exp2nextreg(fs,e2);\r\ncodearith(fs,OP_CONCAT,e1,e2);\r\n}\r\nbreak;\r\n}\r\ncase OPR_ADD:codearith(fs,OP_ADD,e1,e2);break;\r\ncase OPR_SUB:codearith(fs,OP_SUB,e1,e2);break;\r\ncase OPR_MUL:codearith(fs,OP_MUL,e1,e2);break;\r\ncase OPR_DIV:codearith(fs,OP_DIV,e1,e2);break;\r\ncase OPR_MOD:codearith(fs,OP_MOD,e1,e2);break;\r\ncase OPR_POW:codearith(fs,OP_POW,e1,e2);break;\r\ncase OPR_EQ:codecomp(fs,OP_EQ,1,e1,e2);break;\r\ncase OPR_NE:codecomp(fs,OP_EQ,0,e1,e2);break;\r\ncase OPR_LT:codecomp(fs,OP_LT,1,e1,e2);break;\r\ncase OPR_LE:codecomp(fs,OP_LE,1,e1,e2);break;\r\ncase OPR_GT:codecomp(fs,OP_LT,0,e1,e2);break;\r\ncase OPR_GE:codecomp(fs,OP_LE,0,e1,e2);break;\r\ndefault:;\r\n}\r\n}\r\nstatic void luaK_fixline(FuncState*fs,int line){\r\nfs->f->lineinfo[fs->pc-1]=line;\r\n}\r\nstatic int luaK_code(FuncState*fs,Instruction i,int line){\r\nProto*f=fs->f;\r\ndischargejpc(fs);\r\nluaM_growvector(fs->L,f->code,fs->pc,f->sizecode,Instruction,\r\n(INT_MAX-2),\"code size overflow\");\r\nf->code[fs->pc]=i;\r\nluaM_growvector(fs->L,f->lineinfo,fs->pc,f->sizelineinfo,int,\r\n(INT_MAX-2),\"code size overflow\");\r\nf->lineinfo[fs->pc]=line;\r\nreturn fs->pc++;\r\n}\r\nstatic int luaK_codeABC(FuncState*fs,OpCode o,int a,int b,int c){\r\nreturn luaK_code(fs,CREATE_ABC(o,a,b,c),fs->ls->lastline);\r\n}\r\nstatic int luaK_codeABx(FuncState*fs,OpCode o,int a,unsigned int bc){\r\nreturn luaK_code(fs,CREATE_ABx(o,a,bc),fs->ls->lastline);\r\n}\r\nstatic void luaK_setlist(FuncState*fs,int base,int nelems,int tostore){\r\nint c=(nelems-1)/50+1;\r\nint b=(tostore==(-1))?0:tostore;\r\nif(c<=((1<<9)-1))\r\nluaK_codeABC(fs,OP_SETLIST,base,b,c);\r\nelse{\r\nluaK_codeABC(fs,OP_SETLIST,base,b,0);\r\nluaK_code(fs,cast(Instruction,c),fs->ls->lastline);\r\n}\r\nfs->freereg=base+1;\r\n}\r\n#define hasmultret(k)((k)==VCALL||(k)==VVARARG)\r\n#define getlocvar(fs,i)((fs)->f->locvars[(fs)->actvar[i]])\r\n#define luaY_checklimit(fs,v,l,m)if((v)>(l))errorlimit(fs,l,m)\r\ntypedef struct BlockCnt{\r\nstruct BlockCnt*previous;\r\nint breaklist;\r\nlu_byte nactvar;\r\nlu_byte upval;\r\nlu_byte isbreakable;\r\n}BlockCnt;\r\nstatic void chunk(LexState*ls);\r\nstatic void expr(LexState*ls,expdesc*v);\r\nstatic void anchor_token(LexState*ls){\r\nif(ls->t.token==TK_NAME||ls->t.token==TK_STRING){\r\nTString*ts=ls->t.seminfo.ts;\r\nluaX_newstring(ls,getstr(ts),ts->tsv.len);\r\n}\r\n}\r\nstatic void error_expected(LexState*ls,int token){\r\nluaX_syntaxerror(ls,\r\nluaO_pushfstring(ls->L,LUA_QL(\"%s\")\" expected\",luaX_token2str(ls,token)));\r\n}\r\nstatic void errorlimit(FuncState*fs,int limit,const char*what){\r\nconst char*msg=(fs->f->linedefined==0)?\r\nluaO_pushfstring(fs->L,\"main function has more than %d %s\",limit,what):\r\nluaO_pushfstring(fs->L,\"function at line %d has more than %d %s\",\r\nfs->f->linedefined,limit,what);\r\nluaX_lexerror(fs->ls,msg,0);\r\n}\r\nstatic int testnext(LexState*ls,int c){\r\nif(ls->t.token==c){\r\nluaX_next(ls);\r\nreturn 1;\r\n}\r\nelse return 0;\r\n}\r\nstatic void check(LexState*ls,int c){\r\nif(ls->t.token!=c)\r\nerror_expected(ls,c);\r\n}\r\nstatic void checknext(LexState*ls,int c){\r\ncheck(ls,c);\r\nluaX_next(ls);\r\n}\r\n#define check_condition(ls,c,msg){if(!(c))luaX_syntaxerror(ls,msg);}\r\nstatic void check_match(LexState*ls,int what,int who,int where){\r\nif(!testnext(ls,what)){\r\nif(where==ls->linenumber)\r\nerror_expected(ls,what);\r\nelse{\r\nluaX_syntaxerror(ls,luaO_pushfstring(ls->L,\r\nLUA_QL(\"%s\")\" expected (to close \"LUA_QL(\"%s\")\" at line %d)\",\r\nluaX_token2str(ls,what),luaX_token2str(ls,who),where));\r\n}\r\n}\r\n}\r\nstatic TString*str_checkname(LexState*ls){\r\nTString*ts;\r\ncheck(ls,TK_NAME);\r\nts=ls->t.seminfo.ts;\r\nluaX_next(ls);\r\nreturn ts;\r\n}\r\nstatic void init_exp(expdesc*e,expkind k,int i){\r\ne->f=e->t=(-1);\r\ne->k=k;\r\ne->u.s.info=i;\r\n}\r\nstatic void codestring(LexState*ls,expdesc*e,TString*s){\r\ninit_exp(e,VK,luaK_stringK(ls->fs,s));\r\n}\r\nstatic void checkname(LexState*ls,expdesc*e){\r\ncodestring(ls,e,str_checkname(ls));\r\n}\r\nstatic int registerlocalvar(LexState*ls,TString*varname){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint oldsize=f->sizelocvars;\r\nluaM_growvector(ls->L,f->locvars,fs->nlocvars,f->sizelocvars,\r\nLocVar,SHRT_MAX,\"too many local variables\");\r\nwhile(oldsize<f->sizelocvars)f->locvars[oldsize++].varname=NULL;\r\nf->locvars[fs->nlocvars].varname=varname;\r\nluaC_objbarrier(ls->L,f,varname);\r\nreturn fs->nlocvars++;\r\n}\r\n#define new_localvarliteral(ls,v,n)new_localvar(ls,luaX_newstring(ls,\"\"v,(sizeof(v)/sizeof(char))-1),n)\r\nstatic void new_localvar(LexState*ls,TString*name,int n){\r\nFuncState*fs=ls->fs;\r\nluaY_checklimit(fs,fs->nactvar+n+1,200,\"local variables\");\r\nfs->actvar[fs->nactvar+n]=cast(unsigned short,registerlocalvar(ls,name));\r\n}\r\nstatic void adjustlocalvars(LexState*ls,int nvars){\r\nFuncState*fs=ls->fs;\r\nfs->nactvar=cast_byte(fs->nactvar+nvars);\r\nfor(;nvars;nvars--){\r\ngetlocvar(fs,fs->nactvar-nvars).startpc=fs->pc;\r\n}\r\n}\r\nstatic void removevars(LexState*ls,int tolevel){\r\nFuncState*fs=ls->fs;\r\nwhile(fs->nactvar>tolevel)\r\ngetlocvar(fs,--fs->nactvar).endpc=fs->pc;\r\n}\r\nstatic int indexupvalue(FuncState*fs,TString*name,expdesc*v){\r\nint i;\r\nProto*f=fs->f;\r\nint oldsize=f->sizeupvalues;\r\nfor(i=0;i<f->nups;i++){\r\nif(fs->upvalues[i].k==v->k&&fs->upvalues[i].info==v->u.s.info){\r\nreturn i;\r\n}\r\n}\r\nluaY_checklimit(fs,f->nups+1,60,\"upvalues\");\r\nluaM_growvector(fs->L,f->upvalues,f->nups,f->sizeupvalues,\r\nTString*,(INT_MAX-2),\"\");\r\nwhile(oldsize<f->sizeupvalues)f->upvalues[oldsize++]=NULL;\r\nf->upvalues[f->nups]=name;\r\nluaC_objbarrier(fs->L,f,name);\r\nfs->upvalues[f->nups].k=cast_byte(v->k);\r\nfs->upvalues[f->nups].info=cast_byte(v->u.s.info);\r\nreturn f->nups++;\r\n}\r\nstatic int searchvar(FuncState*fs,TString*n){\r\nint i;\r\nfor(i=fs->nactvar-1;i>=0;i--){\r\nif(n==getlocvar(fs,i).varname)\r\nreturn i;\r\n}\r\nreturn-1;\r\n}\r\nstatic void markupval(FuncState*fs,int level){\r\nBlockCnt*bl=fs->bl;\r\nwhile(bl&&bl->nactvar>level)bl=bl->previous;\r\nif(bl)bl->upval=1;\r\n}\r\nstatic int singlevaraux(FuncState*fs,TString*n,expdesc*var,int base){\r\nif(fs==NULL){\r\ninit_exp(var,VGLOBAL,((1<<8)-1));\r\nreturn VGLOBAL;\r\n}\r\nelse{\r\nint v=searchvar(fs,n);\r\nif(v>=0){\r\ninit_exp(var,VLOCAL,v);\r\nif(!base)\r\nmarkupval(fs,v);\r\nreturn VLOCAL;\r\n}\r\nelse{\r\nif(singlevaraux(fs->prev,n,var,0)==VGLOBAL)\r\nreturn VGLOBAL;\r\nvar->u.s.info=indexupvalue(fs,n,var);\r\nvar->k=VUPVAL;\r\nreturn VUPVAL;\r\n}\r\n}\r\n}\r\nstatic void singlevar(LexState*ls,expdesc*var){\r\nTString*varname=str_checkname(ls);\r\nFuncState*fs=ls->fs;\r\nif(singlevaraux(fs,varname,var,1)==VGLOBAL)\r\nvar->u.s.info=luaK_stringK(fs,varname);\r\n}\r\nstatic void adjust_assign(LexState*ls,int nvars,int nexps,expdesc*e){\r\nFuncState*fs=ls->fs;\r\nint extra=nvars-nexps;\r\nif(hasmultret(e->k)){\r\nextra++;\r\nif(extra<0)extra=0;\r\nluaK_setreturns(fs,e,extra);\r\nif(extra>1)luaK_reserveregs(fs,extra-1);\r\n}\r\nelse{\r\nif(e->k!=VVOID)luaK_exp2nextreg(fs,e);\r\nif(extra>0){\r\nint reg=fs->freereg;\r\nluaK_reserveregs(fs,extra);\r\nluaK_nil(fs,reg,extra);\r\n}\r\n}\r\n}\r\nstatic void enterlevel(LexState*ls){\r\nif(++ls->L->nCcalls>200)\r\nluaX_lexerror(ls,\"chunk has too many syntax levels\",0);\r\n}\r\n#define leavelevel(ls)((ls)->L->nCcalls--)\r\nstatic void enterblock(FuncState*fs,BlockCnt*bl,lu_byte isbreakable){\r\nbl->breaklist=(-1);\r\nbl->isbreakable=isbreakable;\r\nbl->nactvar=fs->nactvar;\r\nbl->upval=0;\r\nbl->previous=fs->bl;\r\nfs->bl=bl;\r\n}\r\nstatic void leaveblock(FuncState*fs){\r\nBlockCnt*bl=fs->bl;\r\nfs->bl=bl->previous;\r\nremovevars(fs->ls,bl->nactvar);\r\nif(bl->upval)\r\nluaK_codeABC(fs,OP_CLOSE,bl->nactvar,0,0);\r\nfs->freereg=fs->nactvar;\r\nluaK_patchtohere(fs,bl->breaklist);\r\n}\r\nstatic void pushclosure(LexState*ls,FuncState*func,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint oldsize=f->sizep;\r\nint i;\r\nluaM_growvector(ls->L,f->p,fs->np,f->sizep,Proto*,\r\n((1<<(9+9))-1),\"constant table overflow\");\r\nwhile(oldsize<f->sizep)f->p[oldsize++]=NULL;\r\nf->p[fs->np++]=func->f;\r\nluaC_objbarrier(ls->L,f,func->f);\r\ninit_exp(v,VRELOCABLE,luaK_codeABx(fs,OP_CLOSURE,0,fs->np-1));\r\nfor(i=0;i<func->f->nups;i++){\r\nOpCode o=(func->upvalues[i].k==VLOCAL)?OP_MOVE:OP_GETUPVAL;\r\nluaK_codeABC(fs,o,0,func->upvalues[i].info,0);\r\n}\r\n}\r\nstatic void open_func(LexState*ls,FuncState*fs){\r\nlua_State*L=ls->L;\r\nProto*f=luaF_newproto(L);\r\nfs->f=f;\r\nfs->prev=ls->fs;\r\nfs->ls=ls;\r\nfs->L=L;\r\nls->fs=fs;\r\nfs->pc=0;\r\nfs->lasttarget=-1;\r\nfs->jpc=(-1);\r\nfs->freereg=0;\r\nfs->nk=0;\r\nfs->np=0;\r\nfs->nlocvars=0;\r\nfs->nactvar=0;\r\nfs->bl=NULL;\r\nf->source=ls->source;\r\nf->maxstacksize=2;\r\nfs->h=luaH_new(L,0,0);\r\nsethvalue(L,L->top,fs->h);\r\nincr_top(L);\r\nsetptvalue(L,L->top,f);\r\nincr_top(L);\r\n}\r\nstatic void close_func(LexState*ls){\r\nlua_State*L=ls->L;\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nremovevars(ls,0);\r\nluaK_ret(fs,0,0);\r\nluaM_reallocvector(L,f->code,f->sizecode,fs->pc,Instruction);\r\nf->sizecode=fs->pc;\r\nluaM_reallocvector(L,f->lineinfo,f->sizelineinfo,fs->pc,int);\r\nf->sizelineinfo=fs->pc;\r\nluaM_reallocvector(L,f->k,f->sizek,fs->nk,TValue);\r\nf->sizek=fs->nk;\r\nluaM_reallocvector(L,f->p,f->sizep,fs->np,Proto*);\r\nf->sizep=fs->np;\r\nluaM_reallocvector(L,f->locvars,f->sizelocvars,fs->nlocvars,LocVar);\r\nf->sizelocvars=fs->nlocvars;\r\nluaM_reallocvector(L,f->upvalues,f->sizeupvalues,f->nups,TString*);\r\nf->sizeupvalues=f->nups;\r\nls->fs=fs->prev;\r\nif(fs)anchor_token(ls);\r\nL->top-=2;\r\n}\r\nstatic Proto*luaY_parser(lua_State*L,ZIO*z,Mbuffer*buff,const char*name){\r\nstruct LexState lexstate;\r\nstruct FuncState funcstate;\r\nlexstate.buff=buff;\r\nluaX_setinput(L,&lexstate,z,luaS_new(L,name));\r\nopen_func(&lexstate,&funcstate);\r\nfuncstate.f->is_vararg=2;\r\nluaX_next(&lexstate);\r\nchunk(&lexstate);\r\ncheck(&lexstate,TK_EOS);\r\nclose_func(&lexstate);\r\nreturn funcstate.f;\r\n}\r\nstatic void field(LexState*ls,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nexpdesc key;\r\nluaK_exp2anyreg(fs,v);\r\nluaX_next(ls);\r\ncheckname(ls,&key);\r\nluaK_indexed(fs,v,&key);\r\n}\r\nstatic void yindex(LexState*ls,expdesc*v){\r\nluaX_next(ls);\r\nexpr(ls,v);\r\nluaK_exp2val(ls->fs,v);\r\nchecknext(ls,']');\r\n}\r\nstruct ConsControl{\r\nexpdesc v;\r\nexpdesc*t;\r\nint nh;\r\nint na;\r\nint tostore;\r\n};\r\nstatic void recfield(LexState*ls,struct ConsControl*cc){\r\nFuncState*fs=ls->fs;\r\nint reg=ls->fs->freereg;\r\nexpdesc key,val;\r\nint rkkey;\r\nif(ls->t.token==TK_NAME){\r\nluaY_checklimit(fs,cc->nh,(INT_MAX-2),\"items in a constructor\");\r\ncheckname(ls,&key);\r\n}\r\nelse\r\nyindex(ls,&key);\r\ncc->nh++;\r\nchecknext(ls,'=');\r\nrkkey=luaK_exp2RK(fs,&key);\r\nexpr(ls,&val);\r\nluaK_codeABC(fs,OP_SETTABLE,cc->t->u.s.info,rkkey,luaK_exp2RK(fs,&val));\r\nfs->freereg=reg;\r\n}\r\nstatic void closelistfield(FuncState*fs,struct ConsControl*cc){\r\nif(cc->v.k==VVOID)return;\r\nluaK_exp2nextreg(fs,&cc->v);\r\ncc->v.k=VVOID;\r\nif(cc->tostore==50){\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,cc->tostore);\r\ncc->tostore=0;\r\n}\r\n}\r\nstatic void lastlistfield(FuncState*fs,struct ConsControl*cc){\r\nif(cc->tostore==0)return;\r\nif(hasmultret(cc->v.k)){\r\nluaK_setmultret(fs,&cc->v);\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,(-1));\r\ncc->na--;\r\n}\r\nelse{\r\nif(cc->v.k!=VVOID)\r\nluaK_exp2nextreg(fs,&cc->v);\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,cc->tostore);\r\n}\r\n}\r\nstatic void listfield(LexState*ls,struct ConsControl*cc){\r\nexpr(ls,&cc->v);\r\nluaY_checklimit(ls->fs,cc->na,(INT_MAX-2),\"items in a constructor\");\r\ncc->na++;\r\ncc->tostore++;\r\n}\r\nstatic void constructor(LexState*ls,expdesc*t){\r\nFuncState*fs=ls->fs;\r\nint line=ls->linenumber;\r\nint pc=luaK_codeABC(fs,OP_NEWTABLE,0,0,0);\r\nstruct ConsControl cc;\r\ncc.na=cc.nh=cc.tostore=0;\r\ncc.t=t;\r\ninit_exp(t,VRELOCABLE,pc);\r\ninit_exp(&cc.v,VVOID,0);\r\nluaK_exp2nextreg(ls->fs,t);\r\nchecknext(ls,'{');\r\ndo{\r\nif(ls->t.token=='}')break;\r\ncloselistfield(fs,&cc);\r\nswitch(ls->t.token){\r\ncase TK_NAME:{\r\nluaX_lookahead(ls);\r\nif(ls->lookahead.token!='=')\r\nlistfield(ls,&cc);\r\nelse\r\nrecfield(ls,&cc);\r\nbreak;\r\n}\r\ncase'[':{\r\nrecfield(ls,&cc);\r\nbreak;\r\n}\r\ndefault:{\r\nlistfield(ls,&cc);\r\nbreak;\r\n}\r\n}\r\n}while(testnext(ls,',')||testnext(ls,';'));\r\ncheck_match(ls,'}','{',line);\r\nlastlistfield(fs,&cc);\r\nSETARG_B(fs->f->code[pc],luaO_int2fb(cc.na));\r\nSETARG_C(fs->f->code[pc],luaO_int2fb(cc.nh));\r\n}\r\nstatic void parlist(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint nparams=0;\r\nf->is_vararg=0;\r\nif(ls->t.token!=')'){\r\ndo{\r\nswitch(ls->t.token){\r\ncase TK_NAME:{\r\nnew_localvar(ls,str_checkname(ls),nparams++);\r\nbreak;\r\n}\r\ncase TK_DOTS:{\r\nluaX_next(ls);\r\nf->is_vararg|=2;\r\nbreak;\r\n}\r\ndefault:luaX_syntaxerror(ls,\"<name> or \"LUA_QL(\"...\")\" expected\");\r\n}\r\n}while(!f->is_vararg&&testnext(ls,','));\r\n}\r\nadjustlocalvars(ls,nparams);\r\nf->numparams=cast_byte(fs->nactvar-(f->is_vararg&1));\r\nluaK_reserveregs(fs,fs->nactvar);\r\n}\r\nstatic void body(LexState*ls,expdesc*e,int needself,int line){\r\nFuncState new_fs;\r\nopen_func(ls,&new_fs);\r\nnew_fs.f->linedefined=line;\r\nchecknext(ls,'(');\r\nif(needself){\r\nnew_localvarliteral(ls,\"self\",0);\r\nadjustlocalvars(ls,1);\r\n}\r\nparlist(ls);\r\nchecknext(ls,')');\r\nchunk(ls);\r\nnew_fs.f->lastlinedefined=ls->linenumber;\r\ncheck_match(ls,TK_END,TK_FUNCTION,line);\r\nclose_func(ls);\r\npushclosure(ls,&new_fs,e);\r\n}\r\nstatic int explist1(LexState*ls,expdesc*v){\r\nint n=1;\r\nexpr(ls,v);\r\nwhile(testnext(ls,',')){\r\nluaK_exp2nextreg(ls->fs,v);\r\nexpr(ls,v);\r\nn++;\r\n}\r\nreturn n;\r\n}\r\nstatic void funcargs(LexState*ls,expdesc*f){\r\nFuncState*fs=ls->fs;\r\nexpdesc args;\r\nint base,nparams;\r\nint line=ls->linenumber;\r\nswitch(ls->t.token){\r\ncase'(':{\r\nif(line!=ls->lastline)\r\nluaX_syntaxerror(ls,\"ambiguous syntax (function call x new statement)\");\r\nluaX_next(ls);\r\nif(ls->t.token==')')\r\nargs.k=VVOID;\r\nelse{\r\nexplist1(ls,&args);\r\nluaK_setmultret(fs,&args);\r\n}\r\ncheck_match(ls,')','(',line);\r\nbreak;\r\n}\r\ncase'{':{\r\nconstructor(ls,&args);\r\nbreak;\r\n}\r\ncase TK_STRING:{\r\ncodestring(ls,&args,ls->t.seminfo.ts);\r\nluaX_next(ls);\r\nbreak;\r\n}\r\ndefault:{\r\nluaX_syntaxerror(ls,\"function arguments expected\");\r\nreturn;\r\n}\r\n}\r\nbase=f->u.s.info;\r\nif(hasmultret(args.k))\r\nnparams=(-1);\r\nelse{\r\nif(args.k!=VVOID)\r\nluaK_exp2nextreg(fs,&args);\r\nnparams=fs->freereg-(base+1);\r\n}\r\ninit_exp(f,VCALL,luaK_codeABC(fs,OP_CALL,base,nparams+1,2));\r\nluaK_fixline(fs,line);\r\nfs->freereg=base+1;\r\n}\r\nstatic void prefixexp(LexState*ls,expdesc*v){\r\nswitch(ls->t.token){\r\ncase'(':{\r\nint line=ls->linenumber;\r\nluaX_next(ls);\r\nexpr(ls,v);\r\ncheck_match(ls,')','(',line);\r\nluaK_dischargevars(ls->fs,v);\r\nreturn;\r\n}\r\ncase TK_NAME:{\r\nsinglevar(ls,v);\r\nreturn;\r\n}\r\ndefault:{\r\nluaX_syntaxerror(ls,\"unexpected symbol\");\r\nreturn;\r\n}\r\n}\r\n}\r\nstatic void primaryexp(LexState*ls,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nprefixexp(ls,v);\r\nfor(;;){\r\nswitch(ls->t.token){\r\ncase'.':{\r\nfield(ls,v);\r\nbreak;\r\n}\r\ncase'[':{\r\nexpdesc key;\r\nluaK_exp2anyreg(fs,v);\r\nyindex(ls,&key);\r\nluaK_indexed(fs,v,&key);\r\nbreak;\r\n}\r\ncase':':{\r\nexpdesc key;\r\nluaX_next(ls);\r\ncheckname(ls,&key);\r\nluaK_self(fs,v,&key);\r\nfuncargs(ls,v);\r\nbreak;\r\n}\r\ncase'(':case TK_STRING:case'{':{\r\nluaK_exp2nextreg(fs,v);\r\nfuncargs(ls,v);\r\nbreak;\r\n}\r\ndefault:return;\r\n}\r\n}\r\n}\r\nstatic void simpleexp(LexState*ls,expdesc*v){\r\nswitch(ls->t.token){\r\ncase TK_NUMBER:{\r\ninit_exp(v,VKNUM,0);\r\nv->u.nval=ls->t.seminfo.r;\r\nbreak;\r\n}\r\ncase TK_STRING:{\r\ncodestring(ls,v,ls->t.seminfo.ts);\r\nbreak;\r\n}\r\ncase TK_NIL:{\r\ninit_exp(v,VNIL,0);\r\nbreak;\r\n}\r\ncase TK_TRUE:{\r\ninit_exp(v,VTRUE,0);\r\nbreak;\r\n}\r\ncase TK_FALSE:{\r\ninit_exp(v,VFALSE,0);\r\nbreak;\r\n}\r\ncase TK_DOTS:{\r\nFuncState*fs=ls->fs;\r\ncheck_condition(ls,fs->f->is_vararg,\r\n\"cannot use \"LUA_QL(\"...\")\" outside a vararg function\");\r\nfs->f->is_vararg&=~4;\r\ninit_exp(v,VVARARG,luaK_codeABC(fs,OP_VARARG,0,1,0));\r\nbreak;\r\n}\r\ncase'{':{\r\nconstructor(ls,v);\r\nreturn;\r\n}\r\ncase TK_FUNCTION:{\r\nluaX_next(ls);\r\nbody(ls,v,0,ls->linenumber);\r\nreturn;\r\n}\r\ndefault:{\r\nprimaryexp(ls,v);\r\nreturn;\r\n}\r\n}\r\nluaX_next(ls);\r\n}\r\nstatic UnOpr getunopr(int op){\r\nswitch(op){\r\ncase TK_NOT:return OPR_NOT;\r\ncase'-':return OPR_MINUS;\r\ncase'#':return OPR_LEN;\r\ndefault:return OPR_NOUNOPR;\r\n}\r\n}\r\nstatic BinOpr getbinopr(int op){\r\nswitch(op){\r\ncase'+':return OPR_ADD;\r\ncase'-':return OPR_SUB;\r\ncase'*':return OPR_MUL;\r\ncase'/':return OPR_DIV;\r\ncase'%':return OPR_MOD;\r\ncase'^':return OPR_POW;\r\ncase TK_CONCAT:return OPR_CONCAT;\r\ncase TK_NE:return OPR_NE;\r\ncase TK_EQ:return OPR_EQ;\r\ncase'<':return OPR_LT;\r\ncase TK_LE:return OPR_LE;\r\ncase'>':return OPR_GT;\r\ncase TK_GE:return OPR_GE;\r\ncase TK_AND:return OPR_AND;\r\ncase TK_OR:return OPR_OR;\r\ndefault:return OPR_NOBINOPR;\r\n}\r\n}\r\nstatic const struct{\r\nlu_byte left;\r\nlu_byte right;\r\n}priority[]={\r\n{6,6},{6,6},{7,7},{7,7},{7,7},\r\n{10,9},{5,4},\r\n{3,3},{3,3},\r\n{3,3},{3,3},{3,3},{3,3},\r\n{2,2},{1,1}\r\n};\r\nstatic BinOpr subexpr(LexState*ls,expdesc*v,unsigned int limit){\r\nBinOpr op;\r\nUnOpr uop;\r\nenterlevel(ls);\r\nuop=getunopr(ls->t.token);\r\nif(uop!=OPR_NOUNOPR){\r\nluaX_next(ls);\r\nsubexpr(ls,v,8);\r\nluaK_prefix(ls->fs,uop,v);\r\n}\r\nelse simpleexp(ls,v);\r\nop=getbinopr(ls->t.token);\r\nwhile(op!=OPR_NOBINOPR&&priority[op].left>limit){\r\nexpdesc v2;\r\nBinOpr nextop;\r\nluaX_next(ls);\r\nluaK_infix(ls->fs,op,v);\r\nnextop=subexpr(ls,&v2,priority[op].right);\r\nluaK_posfix(ls->fs,op,v,&v2);\r\nop=nextop;\r\n}\r\nleavelevel(ls);\r\nreturn op;\r\n}\r\nstatic void expr(LexState*ls,expdesc*v){\r\nsubexpr(ls,v,0);\r\n}\r\nstatic int block_follow(int token){\r\nswitch(token){\r\ncase TK_ELSE:case TK_ELSEIF:case TK_END:\r\ncase TK_UNTIL:case TK_EOS:\r\nreturn 1;\r\ndefault:return 0;\r\n}\r\n}\r\nstatic void block(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nBlockCnt bl;\r\nenterblock(fs,&bl,0);\r\nchunk(ls);\r\nleaveblock(fs);\r\n}\r\nstruct LHS_assign{\r\nstruct LHS_assign*prev;\r\nexpdesc v;\r\n};\r\nstatic void check_conflict(LexState*ls,struct LHS_assign*lh,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nint extra=fs->freereg;\r\nint conflict=0;\r\nfor(;lh;lh=lh->prev){\r\nif(lh->v.k==VINDEXED){\r\nif(lh->v.u.s.info==v->u.s.info){\r\nconflict=1;\r\nlh->v.u.s.info=extra;\r\n}\r\nif(lh->v.u.s.aux==v->u.s.info){\r\nconflict=1;\r\nlh->v.u.s.aux=extra;\r\n}\r\n}\r\n}\r\nif(conflict){\r\nluaK_codeABC(fs,OP_MOVE,fs->freereg,v->u.s.info,0);\r\nluaK_reserveregs(fs,1);\r\n}\r\n}\r\nstatic void assignment(LexState*ls,struct LHS_assign*lh,int nvars){\r\nexpdesc e;\r\ncheck_condition(ls,VLOCAL<=lh->v.k&&lh->v.k<=VINDEXED,\r\n\"syntax error\");\r\nif(testnext(ls,',')){\r\nstruct LHS_assign nv;\r\nnv.prev=lh;\r\nprimaryexp(ls,&nv.v);\r\nif(nv.v.k==VLOCAL)\r\ncheck_conflict(ls,lh,&nv.v);\r\nluaY_checklimit(ls->fs,nvars,200-ls->L->nCcalls,\r\n\"variables in assignment\");\r\nassignment(ls,&nv,nvars+1);\r\n}\r\nelse{\r\nint nexps;\r\nchecknext(ls,'=');\r\nnexps=explist1(ls,&e);\r\nif(nexps!=nvars){\r\nadjust_assign(ls,nvars,nexps,&e);\r\nif(nexps>nvars)\r\nls->fs->freereg-=nexps-nvars;\r\n}\r\nelse{\r\nluaK_setoneret(ls->fs,&e);\r\nluaK_storevar(ls->fs,&lh->v,&e);\r\nreturn;\r\n}\r\n}\r\ninit_exp(&e,VNONRELOC,ls->fs->freereg-1);\r\nluaK_storevar(ls->fs,&lh->v,&e);\r\n}\r\nstatic int cond(LexState*ls){\r\nexpdesc v;\r\nexpr(ls,&v);\r\nif(v.k==VNIL)v.k=VFALSE;\r\nluaK_goiftrue(ls->fs,&v);\r\nreturn v.f;\r\n}\r\nstatic void breakstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nBlockCnt*bl=fs->bl;\r\nint upval=0;\r\nwhile(bl&&!bl->isbreakable){\r\nupval|=bl->upval;\r\nbl=bl->previous;\r\n}\r\nif(!bl)\r\nluaX_syntaxerror(ls,\"no loop to break\");\r\nif(upval)\r\nluaK_codeABC(fs,OP_CLOSE,bl->nactvar,0,0);\r\nluaK_concat(fs,&bl->breaklist,luaK_jump(fs));\r\n}\r\nstatic void whilestat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nint whileinit;\r\nint condexit;\r\nBlockCnt bl;\r\nluaX_next(ls);\r\nwhileinit=luaK_getlabel(fs);\r\ncondexit=cond(ls);\r\nenterblock(fs,&bl,1);\r\nchecknext(ls,TK_DO);\r\nblock(ls);\r\nluaK_patchlist(fs,luaK_jump(fs),whileinit);\r\ncheck_match(ls,TK_END,TK_WHILE,line);\r\nleaveblock(fs);\r\nluaK_patchtohere(fs,condexit);\r\n}\r\nstatic void repeatstat(LexState*ls,int line){\r\nint condexit;\r\nFuncState*fs=ls->fs;\r\nint repeat_init=luaK_getlabel(fs);\r\nBlockCnt bl1,bl2;\r\nenterblock(fs,&bl1,1);\r\nenterblock(fs,&bl2,0);\r\nluaX_next(ls);\r\nchunk(ls);\r\ncheck_match(ls,TK_UNTIL,TK_REPEAT,line);\r\ncondexit=cond(ls);\r\nif(!bl2.upval){\r\nleaveblock(fs);\r\nluaK_patchlist(ls->fs,condexit,repeat_init);\r\n}\r\nelse{\r\nbreakstat(ls);\r\nluaK_patchtohere(ls->fs,condexit);\r\nleaveblock(fs);\r\nluaK_patchlist(ls->fs,luaK_jump(fs),repeat_init);\r\n}\r\nleaveblock(fs);\r\n}\r\nstatic int exp1(LexState*ls){\r\nexpdesc e;\r\nint k;\r\nexpr(ls,&e);\r\nk=e.k;\r\nluaK_exp2nextreg(ls->fs,&e);\r\nreturn k;\r\n}\r\nstatic void forbody(LexState*ls,int base,int line,int nvars,int isnum){\r\nBlockCnt bl;\r\nFuncState*fs=ls->fs;\r\nint prep,endfor;\r\nadjustlocalvars(ls,3);\r\nchecknext(ls,TK_DO);\r\nprep=isnum?luaK_codeAsBx(fs,OP_FORPREP,base,(-1)):luaK_jump(fs);\r\nenterblock(fs,&bl,0);\r\nadjustlocalvars(ls,nvars);\r\nluaK_reserveregs(fs,nvars);\r\nblock(ls);\r\nleaveblock(fs);\r\nluaK_patchtohere(fs,prep);\r\nendfor=(isnum)?luaK_codeAsBx(fs,OP_FORLOOP,base,(-1)):\r\nluaK_codeABC(fs,OP_TFORLOOP,base,0,nvars);\r\nluaK_fixline(fs,line);\r\nluaK_patchlist(fs,(isnum?endfor:luaK_jump(fs)),prep+1);\r\n}\r\nstatic void fornum(LexState*ls,TString*varname,int line){\r\nFuncState*fs=ls->fs;\r\nint base=fs->freereg;\r\nnew_localvarliteral(ls,\"(for index)\",0);\r\nnew_localvarliteral(ls,\"(for limit)\",1);\r\nnew_localvarliteral(ls,\"(for step)\",2);\r\nnew_localvar(ls,varname,3);\r\nchecknext(ls,'=');\r\nexp1(ls);\r\nchecknext(ls,',');\r\nexp1(ls);\r\nif(testnext(ls,','))\r\nexp1(ls);\r\nelse{\r\nluaK_codeABx(fs,OP_LOADK,fs->freereg,luaK_numberK(fs,1));\r\nluaK_reserveregs(fs,1);\r\n}\r\nforbody(ls,base,line,1,1);\r\n}\r\nstatic void forlist(LexState*ls,TString*indexname){\r\nFuncState*fs=ls->fs;\r\nexpdesc e;\r\nint nvars=0;\r\nint line;\r\nint base=fs->freereg;\r\nnew_localvarliteral(ls,\"(for generator)\",nvars++);\r\nnew_localvarliteral(ls,\"(for state)\",nvars++);\r\nnew_localvarliteral(ls,\"(for control)\",nvars++);\r\nnew_localvar(ls,indexname,nvars++);\r\nwhile(testnext(ls,','))\r\nnew_localvar(ls,str_checkname(ls),nvars++);\r\nchecknext(ls,TK_IN);\r\nline=ls->linenumber;\r\nadjust_assign(ls,3,explist1(ls,&e),&e);\r\nluaK_checkstack(fs,3);\r\nforbody(ls,base,line,nvars-3,0);\r\n}\r\nstatic void forstat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nTString*varname;\r\nBlockCnt bl;\r\nenterblock(fs,&bl,1);\r\nluaX_next(ls);\r\nvarname=str_checkname(ls);\r\nswitch(ls->t.token){\r\ncase'=':fornum(ls,varname,line);break;\r\ncase',':case TK_IN:forlist(ls,varname);break;\r\ndefault:luaX_syntaxerror(ls,LUA_QL(\"=\")\" or \"LUA_QL(\"in\")\" expected\");\r\n}\r\ncheck_match(ls,TK_END,TK_FOR,line);\r\nleaveblock(fs);\r\n}\r\nstatic int test_then_block(LexState*ls){\r\nint condexit;\r\nluaX_next(ls);\r\ncondexit=cond(ls);\r\nchecknext(ls,TK_THEN);\r\nblock(ls);\r\nreturn condexit;\r\n}\r\nstatic void ifstat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nint flist;\r\nint escapelist=(-1);\r\nflist=test_then_block(ls);\r\nwhile(ls->t.token==TK_ELSEIF){\r\nluaK_concat(fs,&escapelist,luaK_jump(fs));\r\nluaK_patchtohere(fs,flist);\r\nflist=test_then_block(ls);\r\n}\r\nif(ls->t.token==TK_ELSE){\r\nluaK_concat(fs,&escapelist,luaK_jump(fs));\r\nluaK_patchtohere(fs,flist);\r\nluaX_next(ls);\r\nblock(ls);\r\n}\r\nelse\r\nluaK_concat(fs,&escapelist,flist);\r\nluaK_patchtohere(fs,escapelist);\r\ncheck_match(ls,TK_END,TK_IF,line);\r\n}\r\nstatic void localfunc(LexState*ls){\r\nexpdesc v,b;\r\nFuncState*fs=ls->fs;\r\nnew_localvar(ls,str_checkname(ls),0);\r\ninit_exp(&v,VLOCAL,fs->freereg);\r\nluaK_reserveregs(fs,1);\r\nadjustlocalvars(ls,1);\r\nbody(ls,&b,0,ls->linenumber);\r\nluaK_storevar(fs,&v,&b);\r\ngetlocvar(fs,fs->nactvar-1).startpc=fs->pc;\r\n}\r\nstatic void localstat(LexState*ls){\r\nint nvars=0;\r\nint nexps;\r\nexpdesc e;\r\ndo{\r\nnew_localvar(ls,str_checkname(ls),nvars++);\r\n}while(testnext(ls,','));\r\nif(testnext(ls,'='))\r\nnexps=explist1(ls,&e);\r\nelse{\r\ne.k=VVOID;\r\nnexps=0;\r\n}\r\nadjust_assign(ls,nvars,nexps,&e);\r\nadjustlocalvars(ls,nvars);\r\n}\r\nstatic int funcname(LexState*ls,expdesc*v){\r\nint needself=0;\r\nsinglevar(ls,v);\r\nwhile(ls->t.token=='.')\r\nfield(ls,v);\r\nif(ls->t.token==':'){\r\nneedself=1;\r\nfield(ls,v);\r\n}\r\nreturn needself;\r\n}\r\nstatic void funcstat(LexState*ls,int line){\r\nint needself;\r\nexpdesc v,b;\r\nluaX_next(ls);\r\nneedself=funcname(ls,&v);\r\nbody(ls,&b,needself,line);\r\nluaK_storevar(ls->fs,&v,&b);\r\nluaK_fixline(ls->fs,line);\r\n}\r\nstatic void exprstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nstruct LHS_assign v;\r\nprimaryexp(ls,&v.v);\r\nif(v.v.k==VCALL)\r\nSETARG_C(getcode(fs,&v.v),1);\r\nelse{\r\nv.prev=NULL;\r\nassignment(ls,&v,1);\r\n}\r\n}\r\nstatic void retstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nexpdesc e;\r\nint first,nret;\r\nluaX_next(ls);\r\nif(block_follow(ls->t.token)||ls->t.token==';')\r\nfirst=nret=0;\r\nelse{\r\nnret=explist1(ls,&e);\r\nif(hasmultret(e.k)){\r\nluaK_setmultret(fs,&e);\r\nif(e.k==VCALL&&nret==1){\r\nSET_OPCODE(getcode(fs,&e),OP_TAILCALL);\r\n}\r\nfirst=fs->nactvar;\r\nnret=(-1);\r\n}\r\nelse{\r\nif(nret==1)\r\nfirst=luaK_exp2anyreg(fs,&e);\r\nelse{\r\nluaK_exp2nextreg(fs,&e);\r\nfirst=fs->nactvar;\r\n}\r\n}\r\n}\r\nluaK_ret(fs,first,nret);\r\n}\r\nstatic int statement(LexState*ls){\r\nint line=ls->linenumber;\r\nswitch(ls->t.token){\r\ncase TK_IF:{\r\nifstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_WHILE:{\r\nwhilestat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_DO:{\r\nluaX_next(ls);\r\nblock(ls);\r\ncheck_match(ls,TK_END,TK_DO,line);\r\nreturn 0;\r\n}\r\ncase TK_FOR:{\r\nforstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_REPEAT:{\r\nrepeatstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_FUNCTION:{\r\nfuncstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_LOCAL:{\r\nluaX_next(ls);\r\nif(testnext(ls,TK_FUNCTION))\r\nlocalfunc(ls);\r\nelse\r\nlocalstat(ls);\r\nreturn 0;\r\n}\r\ncase TK_RETURN:{\r\nretstat(ls);\r\nreturn 1;\r\n}\r\ncase TK_BREAK:{\r\nluaX_next(ls);\r\nbreakstat(ls);\r\nreturn 1;\r\n}\r\ndefault:{\r\nexprstat(ls);\r\nreturn 0;\r\n}\r\n}\r\n}\r\nstatic void chunk(LexState*ls){\r\nint islast=0;\r\nenterlevel(ls);\r\nwhile(!islast&&!block_follow(ls->t.token)){\r\nislast=statement(ls);\r\ntestnext(ls,';');\r\nls->fs->freereg=ls->fs->nactvar;\r\n}\r\nleavelevel(ls);\r\n}\r\nstatic const TValue*luaV_tonumber(const TValue*obj,TValue*n){\r\nlua_Number num;\r\nif(ttisnumber(obj))return obj;\r\nif(ttisstring(obj)&&luaO_str2d(svalue(obj),&num)){\r\nsetnvalue(n,num);\r\nreturn n;\r\n}\r\nelse\r\nreturn NULL;\r\n}\r\nstatic int luaV_tostring(lua_State*L,StkId obj){\r\nif(!ttisnumber(obj))\r\nreturn 0;\r\nelse{\r\nchar s[32];\r\nlua_Number n=nvalue(obj);\r\nlua_number2str(s,n);\r\nsetsvalue(L,obj,luaS_new(L,s));\r\nreturn 1;\r\n}\r\n}\r\nstatic void callTMres(lua_State*L,StkId res,const TValue*f,\r\nconst TValue*p1,const TValue*p2){\r\nptrdiff_t result=savestack(L,res);\r\nsetobj(L,L->top,f);\r\nsetobj(L,L->top+1,p1);\r\nsetobj(L,L->top+2,p2);\r\nluaD_checkstack(L,3);\r\nL->top+=3;\r\nluaD_call(L,L->top-3,1);\r\nres=restorestack(L,result);\r\nL->top--;\r\nsetobj(L,res,L->top);\r\n}\r\nstatic void callTM(lua_State*L,const TValue*f,const TValue*p1,\r\nconst TValue*p2,const TValue*p3){\r\nsetobj(L,L->top,f);\r\nsetobj(L,L->top+1,p1);\r\nsetobj(L,L->top+2,p2);\r\nsetobj(L,L->top+3,p3);\r\nluaD_checkstack(L,4);\r\nL->top+=4;\r\nluaD_call(L,L->top-4,0);\r\n}\r\nstatic void luaV_gettable(lua_State*L,const TValue*t,TValue*key,StkId val){\r\nint loop;\r\nfor(loop=0;loop<100;loop++){\r\nconst TValue*tm;\r\nif(ttistable(t)){\r\nTable*h=hvalue(t);\r\nconst TValue*res=luaH_get(h,key);\r\nif(!ttisnil(res)||\r\n(tm=fasttm(L,h->metatable,TM_INDEX))==NULL){\r\nsetobj(L,val,res);\r\nreturn;\r\n}\r\n}\r\nelse if(ttisnil(tm=luaT_gettmbyobj(L,t,TM_INDEX)))\r\nluaG_typeerror(L,t,\"index\");\r\nif(ttisfunction(tm)){\r\ncallTMres(L,val,tm,t,key);\r\nreturn;\r\n}\r\nt=tm;\r\n}\r\nluaG_runerror(L,\"loop in gettable\");\r\n}\r\nstatic void luaV_settable(lua_State*L,const TValue*t,TValue*key,StkId val){\r\nint loop;\r\nTValue temp;\r\nfor(loop=0;loop<100;loop++){\r\nconst TValue*tm;\r\nif(ttistable(t)){\r\nTable*h=hvalue(t);\r\nTValue*oldval=luaH_set(L,h,key);\r\nif(!ttisnil(oldval)||\r\n(tm=fasttm(L,h->metatable,TM_NEWINDEX))==NULL){\r\nsetobj(L,oldval,val);\r\nh->flags=0;\r\nluaC_barriert(L,h,val);\r\nreturn;\r\n}\r\n}\r\nelse if(ttisnil(tm=luaT_gettmbyobj(L,t,TM_NEWINDEX)))\r\nluaG_typeerror(L,t,\"index\");\r\nif(ttisfunction(tm)){\r\ncallTM(L,tm,t,key,val);\r\nreturn;\r\n}\r\nsetobj(L,&temp,tm);\r\nt=&temp;\r\n}\r\nluaG_runerror(L,\"loop in settable\");\r\n}\r\nstatic int call_binTM(lua_State*L,const TValue*p1,const TValue*p2,\r\nStkId res,TMS event){\r\nconst TValue*tm=luaT_gettmbyobj(L,p1,event);\r\nif(ttisnil(tm))\r\ntm=luaT_gettmbyobj(L,p2,event);\r\nif(ttisnil(tm))return 0;\r\ncallTMres(L,res,tm,p1,p2);\r\nreturn 1;\r\n}\r\nstatic const TValue*get_compTM(lua_State*L,Table*mt1,Table*mt2,\r\nTMS event){\r\nconst TValue*tm1=fasttm(L,mt1,event);\r\nconst TValue*tm2;\r\nif(tm1==NULL)return NULL;\r\nif(mt1==mt2)return tm1;\r\ntm2=fasttm(L,mt2,event);\r\nif(tm2==NULL)return NULL;\r\nif(luaO_rawequalObj(tm1,tm2))\r\nreturn tm1;\r\nreturn NULL;\r\n}\r\nstatic int call_orderTM(lua_State*L,const TValue*p1,const TValue*p2,\r\nTMS event){\r\nconst TValue*tm1=luaT_gettmbyobj(L,p1,event);\r\nconst TValue*tm2;\r\nif(ttisnil(tm1))return-1;\r\ntm2=luaT_gettmbyobj(L,p2,event);\r\nif(!luaO_rawequalObj(tm1,tm2))\r\nreturn-1;\r\ncallTMres(L,L->top,tm1,p1,p2);\r\nreturn!l_isfalse(L->top);\r\n}\r\nstatic int l_strcmp(const TString*ls,const TString*rs){\r\nconst char*l=getstr(ls);\r\nsize_t ll=ls->tsv.len;\r\nconst char*r=getstr(rs);\r\nsize_t lr=rs->tsv.len;\r\nfor(;;){\r\nint temp=strcoll(l,r);\r\nif(temp!=0)return temp;\r\nelse{\r\nsize_t len=strlen(l);\r\nif(len==lr)\r\nreturn(len==ll)?0:1;\r\nelse if(len==ll)\r\nreturn-1;\r\nlen++;\r\nl+=len;ll-=len;r+=len;lr-=len;\r\n}\r\n}\r\n}\r\nstatic int luaV_lessthan(lua_State*L,const TValue*l,const TValue*r){\r\nint res;\r\nif(ttype(l)!=ttype(r))\r\nreturn luaG_ordererror(L,l,r);\r\nelse if(ttisnumber(l))\r\nreturn luai_numlt(nvalue(l),nvalue(r));\r\nelse if(ttisstring(l))\r\nreturn l_strcmp(rawtsvalue(l),rawtsvalue(r))<0;\r\nelse if((res=call_orderTM(L,l,r,TM_LT))!=-1)\r\nreturn res;\r\nreturn luaG_ordererror(L,l,r);\r\n}\r\nstatic int lessequal(lua_State*L,const TValue*l,const TValue*r){\r\nint res;\r\nif(ttype(l)!=ttype(r))\r\nreturn luaG_ordererror(L,l,r);\r\nelse if(ttisnumber(l))\r\nreturn luai_numle(nvalue(l),nvalue(r));\r\nelse if(ttisstring(l))\r\nreturn l_strcmp(rawtsvalue(l),rawtsvalue(r))<=0;\r\nelse if((res=call_orderTM(L,l,r,TM_LE))!=-1)\r\nreturn res;\r\nelse if((res=call_orderTM(L,r,l,TM_LT))!=-1)\r\nreturn!res;\r\nreturn luaG_ordererror(L,l,r);\r\n}\r\nstatic int luaV_equalval(lua_State*L,const TValue*t1,const TValue*t2){\r\nconst TValue*tm;\r\nswitch(ttype(t1)){\r\ncase 0:return 1;\r\ncase 3:return luai_numeq(nvalue(t1),nvalue(t2));\r\ncase 1:return bvalue(t1)==bvalue(t2);\r\ncase 2:return pvalue(t1)==pvalue(t2);\r\ncase 7:{\r\nif(uvalue(t1)==uvalue(t2))return 1;\r\ntm=get_compTM(L,uvalue(t1)->metatable,uvalue(t2)->metatable,\r\nTM_EQ);\r\nbreak;\r\n}\r\ncase 5:{\r\nif(hvalue(t1)==hvalue(t2))return 1;\r\ntm=get_compTM(L,hvalue(t1)->metatable,hvalue(t2)->metatable,TM_EQ);\r\nbreak;\r\n}\r\ndefault:return gcvalue(t1)==gcvalue(t2);\r\n}\r\nif(tm==NULL)return 0;\r\ncallTMres(L,L->top,tm,t1,t2);\r\nreturn!l_isfalse(L->top);\r\n}\r\nstatic void luaV_concat(lua_State*L,int total,int last){\r\ndo{\r\nStkId top=L->base+last+1;\r\nint n=2;\r\nif(!(ttisstring(top-2)||ttisnumber(top-2))||!tostring(L,top-1)){\r\nif(!call_binTM(L,top-2,top-1,top-2,TM_CONCAT))\r\nluaG_concaterror(L,top-2,top-1);\r\n}else if(tsvalue(top-1)->len==0)\r\n(void)tostring(L,top-2);\r\nelse{\r\nsize_t tl=tsvalue(top-1)->len;\r\nchar*buffer;\r\nint i;\r\nfor(n=1;n<total&&tostring(L,top-n-1);n++){\r\nsize_t l=tsvalue(top-n-1)->len;\r\nif(l>=((size_t)(~(size_t)0)-2)-tl)luaG_runerror(L,\"string length overflow\");\r\ntl+=l;\r\n}\r\nbuffer=luaZ_openspace(L,&G(L)->buff,tl);\r\ntl=0;\r\nfor(i=n;i>0;i--){\r\nsize_t l=tsvalue(top-i)->len;\r\nmemcpy(buffer+tl,svalue(top-i),l);\r\ntl+=l;\r\n}\r\nsetsvalue(L,top-n,luaS_newlstr(L,buffer,tl));\r\n}\r\ntotal-=n-1;\r\nlast-=n-1;\r\n}while(total>1);\r\n}\r\nstatic void Arith(lua_State*L,StkId ra,const TValue*rb,\r\nconst TValue*rc,TMS op){\r\nTValue tempb,tempc;\r\nconst TValue*b,*c;\r\nif((b=luaV_tonumber(rb,&tempb))!=NULL&&\r\n(c=luaV_tonumber(rc,&tempc))!=NULL){\r\nlua_Number nb=nvalue(b),nc=nvalue(c);\r\nswitch(op){\r\ncase TM_ADD:setnvalue(ra,luai_numadd(nb,nc));break;\r\ncase TM_SUB:setnvalue(ra,luai_numsub(nb,nc));break;\r\ncase TM_MUL:setnvalue(ra,luai_nummul(nb,nc));break;\r\ncase TM_DIV:setnvalue(ra,luai_numdiv(nb,nc));break;\r\ncase TM_MOD:setnvalue(ra,luai_nummod(nb,nc));break;\r\ncase TM_POW:setnvalue(ra,luai_numpow(nb,nc));break;\r\ncase TM_UNM:setnvalue(ra,luai_numunm(nb));break;\r\ndefault:break;\r\n}\r\n}\r\nelse if(!call_binTM(L,rb,rc,ra,op))\r\nluaG_aritherror(L,rb,rc);\r\n}\r\n#define runtime_check(L,c){if(!(c))break;}\r\n#define RA(i)(base+GETARG_A(i))\r\n#define RB(i)check_exp(getBMode(GET_OPCODE(i))==OpArgR,base+GETARG_B(i))\r\n#define RKB(i)check_exp(getBMode(GET_OPCODE(i))==OpArgK,ISK(GETARG_B(i))?k+INDEXK(GETARG_B(i)):base+GETARG_B(i))\r\n#define RKC(i)check_exp(getCMode(GET_OPCODE(i))==OpArgK,ISK(GETARG_C(i))?k+INDEXK(GETARG_C(i)):base+GETARG_C(i))\r\n#define KBx(i)check_exp(getBMode(GET_OPCODE(i))==OpArgK,k+GETARG_Bx(i))\r\n#define dojump(L,pc,i){(pc)+=(i);}\r\n#define Protect(x){L->savedpc=pc;{x;};base=L->base;}\r\n#define arith_op(op,tm){TValue*rb=RKB(i);TValue*rc=RKC(i);if(ttisnumber(rb)&&ttisnumber(rc)){lua_Number nb=nvalue(rb),nc=nvalue(rc);setnvalue(ra,op(nb,nc));}else Protect(Arith(L,ra,rb,rc,tm));}\r\nstatic void luaV_execute(lua_State*L,int nexeccalls){\r\nLClosure*cl;\r\nStkId base;\r\nTValue*k;\r\nconst Instruction*pc;\r\nreentry:\r\npc=L->savedpc;\r\ncl=&clvalue(L->ci->func)->l;\r\nbase=L->base;\r\nk=cl->p->k;\r\nfor(;;){\r\nconst Instruction i=*pc++;\r\nStkId ra;\r\nra=RA(i);\r\nswitch(GET_OPCODE(i)){\r\ncase OP_MOVE:{\r\nsetobj(L,ra,RB(i));\r\ncontinue;\r\n}\r\ncase OP_LOADK:{\r\nsetobj(L,ra,KBx(i));\r\ncontinue;\r\n}\r\ncase OP_LOADBOOL:{\r\nsetbvalue(ra,GETARG_B(i));\r\nif(GETARG_C(i))pc++;\r\ncontinue;\r\n}\r\ncase OP_LOADNIL:{\r\nTValue*rb=RB(i);\r\ndo{\r\nsetnilvalue(rb--);\r\n}while(rb>=ra);\r\ncontinue;\r\n}\r\ncase OP_GETUPVAL:{\r\nint b=GETARG_B(i);\r\nsetobj(L,ra,cl->upvals[b]->v);\r\ncontinue;\r\n}\r\ncase OP_GETGLOBAL:{\r\nTValue g;\r\nTValue*rb=KBx(i);\r\nsethvalue(L,&g,cl->env);\r\nProtect(luaV_gettable(L,&g,rb,ra));\r\ncontinue;\r\n}\r\ncase OP_GETTABLE:{\r\nProtect(luaV_gettable(L,RB(i),RKC(i),ra));\r\ncontinue;\r\n}\r\ncase OP_SETGLOBAL:{\r\nTValue g;\r\nsethvalue(L,&g,cl->env);\r\nProtect(luaV_settable(L,&g,KBx(i),ra));\r\ncontinue;\r\n}\r\ncase OP_SETUPVAL:{\r\nUpVal*uv=cl->upvals[GETARG_B(i)];\r\nsetobj(L,uv->v,ra);\r\nluaC_barrier(L,uv,ra);\r\ncontinue;\r\n}\r\ncase OP_SETTABLE:{\r\nProtect(luaV_settable(L,ra,RKB(i),RKC(i)));\r\ncontinue;\r\n}\r\ncase OP_NEWTABLE:{\r\nint b=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nsethvalue(L,ra,luaH_new(L,luaO_fb2int(b),luaO_fb2int(c)));\r\nProtect(luaC_checkGC(L));\r\ncontinue;\r\n}\r\ncase OP_SELF:{\r\nStkId rb=RB(i);\r\nsetobj(L,ra+1,rb);\r\nProtect(luaV_gettable(L,rb,RKC(i),ra));\r\ncontinue;\r\n}\r\ncase OP_ADD:{\r\narith_op(luai_numadd,TM_ADD);\r\ncontinue;\r\n}\r\ncase OP_SUB:{\r\narith_op(luai_numsub,TM_SUB);\r\ncontinue;\r\n}\r\ncase OP_MUL:{\r\narith_op(luai_nummul,TM_MUL);\r\ncontinue;\r\n}\r\ncase OP_DIV:{\r\narith_op(luai_numdiv,TM_DIV);\r\ncontinue;\r\n}\r\ncase OP_MOD:{\r\narith_op(luai_nummod,TM_MOD);\r\ncontinue;\r\n}\r\ncase OP_POW:{\r\narith_op(luai_numpow,TM_POW);\r\ncontinue;\r\n}\r\ncase OP_UNM:{\r\nTValue*rb=RB(i);\r\nif(ttisnumber(rb)){\r\nlua_Number nb=nvalue(rb);\r\nsetnvalue(ra,luai_numunm(nb));\r\n}\r\nelse{\r\nProtect(Arith(L,ra,rb,rb,TM_UNM));\r\n}\r\ncontinue;\r\n}\r\ncase OP_NOT:{\r\nint res=l_isfalse(RB(i));\r\nsetbvalue(ra,res);\r\ncontinue;\r\n}\r\ncase OP_LEN:{\r\nconst TValue*rb=RB(i);\r\nswitch(ttype(rb)){\r\ncase 5:{\r\nsetnvalue(ra,cast_num(luaH_getn(hvalue(rb))));\r\nbreak;\r\n}\r\ncase 4:{\r\nsetnvalue(ra,cast_num(tsvalue(rb)->len));\r\nbreak;\r\n}\r\ndefault:{\r\nProtect(\r\nif(!call_binTM(L,rb,(&luaO_nilobject_),ra,TM_LEN))\r\nluaG_typeerror(L,rb,\"get length of\");\r\n)\r\n}\r\n}\r\ncontinue;\r\n}\r\ncase OP_CONCAT:{\r\nint b=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nProtect(luaV_concat(L,c-b+1,c);luaC_checkGC(L));\r\nsetobj(L,RA(i),base+b);\r\ncontinue;\r\n}\r\ncase OP_JMP:{\r\ndojump(L,pc,GETARG_sBx(i));\r\ncontinue;\r\n}\r\ncase OP_EQ:{\r\nTValue*rb=RKB(i);\r\nTValue*rc=RKC(i);\r\nProtect(\r\nif(equalobj(L,rb,rc)==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_LT:{\r\nProtect(\r\nif(luaV_lessthan(L,RKB(i),RKC(i))==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_LE:{\r\nProtect(\r\nif(lessequal(L,RKB(i),RKC(i))==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_TEST:{\r\nif(l_isfalse(ra)!=GETARG_C(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_TESTSET:{\r\nTValue*rb=RB(i);\r\nif(l_isfalse(rb)!=GETARG_C(i)){\r\nsetobj(L,ra,rb);\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n}\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_CALL:{\r\nint b=GETARG_B(i);\r\nint nresults=GETARG_C(i)-1;\r\nif(b!=0)L->top=ra+b;\r\nL->savedpc=pc;\r\nswitch(luaD_precall(L,ra,nresults)){\r\ncase 0:{\r\nnexeccalls++;\r\ngoto reentry;\r\n}\r\ncase 1:{\r\nif(nresults>=0)L->top=L->ci->top;\r\nbase=L->base;\r\ncontinue;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\n}\r\ncase OP_TAILCALL:{\r\nint b=GETARG_B(i);\r\nif(b!=0)L->top=ra+b;\r\nL->savedpc=pc;\r\nswitch(luaD_precall(L,ra,(-1))){\r\ncase 0:{\r\nCallInfo*ci=L->ci-1;\r\nint aux;\r\nStkId func=ci->func;\r\nStkId pfunc=(ci+1)->func;\r\nif(L->openupval)luaF_close(L,ci->base);\r\nL->base=ci->base=ci->func+((ci+1)->base-pfunc);\r\nfor(aux=0;pfunc+aux<L->top;aux++)\r\nsetobj(L,func+aux,pfunc+aux);\r\nci->top=L->top=func+aux;\r\nci->savedpc=L->savedpc;\r\nci->tailcalls++;\r\nL->ci--;\r\ngoto reentry;\r\n}\r\ncase 1:{\r\nbase=L->base;\r\ncontinue;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\n}\r\ncase OP_RETURN:{\r\nint b=GETARG_B(i);\r\nif(b!=0)L->top=ra+b-1;\r\nif(L->openupval)luaF_close(L,base);\r\nL->savedpc=pc;\r\nb=luaD_poscall(L,ra);\r\nif(--nexeccalls==0)\r\nreturn;\r\nelse{\r\nif(b)L->top=L->ci->top;\r\ngoto reentry;\r\n}\r\n}\r\ncase OP_FORLOOP:{\r\nlua_Number step=nvalue(ra+2);\r\nlua_Number idx=luai_numadd(nvalue(ra),step);\r\nlua_Number limit=nvalue(ra+1);\r\nif(luai_numlt(0,step)?luai_numle(idx,limit)\r\n:luai_numle(limit,idx)){\r\ndojump(L,pc,GETARG_sBx(i));\r\nsetnvalue(ra,idx);\r\nsetnvalue(ra+3,idx);\r\n}\r\ncontinue;\r\n}\r\ncase OP_FORPREP:{\r\nconst TValue*init=ra;\r\nconst TValue*plimit=ra+1;\r\nconst TValue*pstep=ra+2;\r\nL->savedpc=pc;\r\nif(!tonumber(init,ra))\r\nluaG_runerror(L,LUA_QL(\"for\")\" initial value must be a number\");\r\nelse if(!tonumber(plimit,ra+1))\r\nluaG_runerror(L,LUA_QL(\"for\")\" limit must be a number\");\r\nelse if(!tonumber(pstep,ra+2))\r\nluaG_runerror(L,LUA_QL(\"for\")\" step must be a number\");\r\nsetnvalue(ra,luai_numsub(nvalue(ra),nvalue(pstep)));\r\ndojump(L,pc,GETARG_sBx(i));\r\ncontinue;\r\n}\r\ncase OP_TFORLOOP:{\r\nStkId cb=ra+3;\r\nsetobj(L,cb+2,ra+2);\r\nsetobj(L,cb+1,ra+1);\r\nsetobj(L,cb,ra);\r\nL->top=cb+3;\r\nProtect(luaD_call(L,cb,GETARG_C(i)));\r\nL->top=L->ci->top;\r\ncb=RA(i)+3;\r\nif(!ttisnil(cb)){\r\nsetobj(L,cb-1,cb);\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n}\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_SETLIST:{\r\nint n=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nint last;\r\nTable*h;\r\nif(n==0){\r\nn=cast_int(L->top-ra)-1;\r\nL->top=L->ci->top;\r\n}\r\nif(c==0)c=cast_int(*pc++);\r\nruntime_check(L,ttistable(ra));\r\nh=hvalue(ra);\r\nlast=((c-1)*50)+n;\r\nif(last>h->sizearray)\r\nluaH_resizearray(L,h,last);\r\nfor(;n>0;n--){\r\nTValue*val=ra+n;\r\nsetobj(L,luaH_setnum(L,h,last--),val);\r\nluaC_barriert(L,h,val);\r\n}\r\ncontinue;\r\n}\r\ncase OP_CLOSE:{\r\nluaF_close(L,ra);\r\ncontinue;\r\n}\r\ncase OP_CLOSURE:{\r\nProto*p;\r\nClosure*ncl;\r\nint nup,j;\r\np=cl->p->p[GETARG_Bx(i)];\r\nnup=p->nups;\r\nncl=luaF_newLclosure(L,nup,cl->env);\r\nncl->l.p=p;\r\nfor(j=0;j<nup;j++,pc++){\r\nif(GET_OPCODE(*pc)==OP_GETUPVAL)\r\nncl->l.upvals[j]=cl->upvals[GETARG_B(*pc)];\r\nelse{\r\nncl->l.upvals[j]=luaF_findupval(L,base+GETARG_B(*pc));\r\n}\r\n}\r\nsetclvalue(L,ra,ncl);\r\nProtect(luaC_checkGC(L));\r\ncontinue;\r\n}\r\ncase OP_VARARG:{\r\nint b=GETARG_B(i)-1;\r\nint j;\r\nCallInfo*ci=L->ci;\r\nint n=cast_int(ci->base-ci->func)-cl->p->numparams-1;\r\nif(b==(-1)){\r\nProtect(luaD_checkstack(L,n));\r\nra=RA(i);\r\nb=n;\r\nL->top=ra+n;\r\n}\r\nfor(j=0;j<b;j++){\r\nif(j<n){\r\nsetobj(L,ra+j,ci->base-n+j);\r\n}\r\nelse{\r\nsetnilvalue(ra+j);\r\n}\r\n}\r\ncontinue;\r\n}\r\n}\r\n}\r\n}\r\n#define api_checknelems(L,n)luai_apicheck(L,(n)<=(L->top-L->base))\r\n#define api_checkvalidindex(L,i)luai_apicheck(L,(i)!=(&luaO_nilobject_))\r\n#define api_incr_top(L){luai_apicheck(L,L->top<L->ci->top);L->top++;}\r\nstatic TValue*index2adr(lua_State*L,int idx){\r\nif(idx>0){\r\nTValue*o=L->base+(idx-1);\r\nluai_apicheck(L,idx<=L->ci->top-L->base);\r\nif(o>=L->top)return cast(TValue*,(&luaO_nilobject_));\r\nelse return o;\r\n}\r\nelse if(idx>(-10000)){\r\nluai_apicheck(L,idx!=0&&-idx<=L->top-L->base);\r\nreturn L->top+idx;\r\n}\r\nelse switch(idx){\r\ncase(-10000):return registry(L);\r\ncase(-10001):{\r\nClosure*func=curr_func(L);\r\nsethvalue(L,&L->env,func->c.env);\r\nreturn&L->env;\r\n}\r\ncase(-10002):return gt(L);\r\ndefault:{\r\nClosure*func=curr_func(L);\r\nidx=(-10002)-idx;\r\nreturn(idx<=func->c.nupvalues)\r\n?&func->c.upvalue[idx-1]\r\n:cast(TValue*,(&luaO_nilobject_));\r\n}\r\n}\r\n}\r\nstatic Table*getcurrenv(lua_State*L){\r\nif(L->ci==L->base_ci)\r\nreturn hvalue(gt(L));\r\nelse{\r\nClosure*func=curr_func(L);\r\nreturn func->c.env;\r\n}\r\n}\r\nstatic int lua_checkstack(lua_State*L,int size){\r\nint res=1;\r\nif(size>8000||(L->top-L->base+size)>8000)\r\nres=0;\r\nelse if(size>0){\r\nluaD_checkstack(L,size);\r\nif(L->ci->top<L->top+size)\r\nL->ci->top=L->top+size;\r\n}\r\nreturn res;\r\n}\r\nstatic lua_CFunction lua_atpanic(lua_State*L,lua_CFunction panicf){\r\nlua_CFunction old;\r\nold=G(L)->panic;\r\nG(L)->panic=panicf;\r\nreturn old;\r\n}\r\nstatic int lua_gettop(lua_State*L){\r\nreturn cast_int(L->top-L->base);\r\n}\r\nstatic void lua_settop(lua_State*L,int idx){\r\nif(idx>=0){\r\nluai_apicheck(L,idx<=L->stack_last-L->base);\r\nwhile(L->top<L->base+idx)\r\nsetnilvalue(L->top++);\r\nL->top=L->base+idx;\r\n}\r\nelse{\r\nluai_apicheck(L,-(idx+1)<=(L->top-L->base));\r\nL->top+=idx+1;\r\n}\r\n}\r\nstatic void lua_remove(lua_State*L,int idx){\r\nStkId p;\r\np=index2adr(L,idx);\r\napi_checkvalidindex(L,p);\r\nwhile(++p<L->top)setobj(L,p-1,p);\r\nL->top--;\r\n}\r\nstatic void lua_insert(lua_State*L,int idx){\r\nStkId p;\r\nStkId q;\r\np=index2adr(L,idx);\r\napi_checkvalidindex(L,p);\r\nfor(q=L->top;q>p;q--)setobj(L,q,q-1);\r\nsetobj(L,p,L->top);\r\n}\r\nstatic void lua_replace(lua_State*L,int idx){\r\nStkId o;\r\nif(idx==(-10001)&&L->ci==L->base_ci)\r\nluaG_runerror(L,\"no calling environment\");\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nif(idx==(-10001)){\r\nClosure*func=curr_func(L);\r\nluai_apicheck(L,ttistable(L->top-1));\r\nfunc->c.env=hvalue(L->top-1);\r\nluaC_barrier(L,func,L->top-1);\r\n}\r\nelse{\r\nsetobj(L,o,L->top-1);\r\nif(idx<(-10002))\r\nluaC_barrier(L,curr_func(L),L->top-1);\r\n}\r\nL->top--;\r\n}\r\nstatic void lua_pushvalue(lua_State*L,int idx){\r\nsetobj(L,L->top,index2adr(L,idx));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_type(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn(o==(&luaO_nilobject_))?(-1):ttype(o);\r\n}\r\nstatic const char*lua_typename(lua_State*L,int t){\r\nUNUSED(L);\r\nreturn(t==(-1))?\"no value\":luaT_typenames[t];\r\n}\r\nstatic int lua_iscfunction(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn iscfunction(o);\r\n}\r\nstatic int lua_isnumber(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nreturn tonumber(o,&n);\r\n}\r\nstatic int lua_isstring(lua_State*L,int idx){\r\nint t=lua_type(L,idx);\r\nreturn(t==4||t==3);\r\n}\r\nstatic int lua_rawequal(lua_State*L,int index1,int index2){\r\nStkId o1=index2adr(L,index1);\r\nStkId o2=index2adr(L,index2);\r\nreturn(o1==(&luaO_nilobject_)||o2==(&luaO_nilobject_))?0\r\n:luaO_rawequalObj(o1,o2);\r\n}\r\nstatic int lua_lessthan(lua_State*L,int index1,int index2){\r\nStkId o1,o2;\r\nint i;\r\no1=index2adr(L,index1);\r\no2=index2adr(L,index2);\r\ni=(o1==(&luaO_nilobject_)||o2==(&luaO_nilobject_))?0\r\n:luaV_lessthan(L,o1,o2);\r\nreturn i;\r\n}\r\nstatic lua_Number lua_tonumber(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nif(tonumber(o,&n))\r\nreturn nvalue(o);\r\nelse\r\nreturn 0;\r\n}\r\nstatic lua_Integer lua_tointeger(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nif(tonumber(o,&n)){\r\nlua_Integer res;\r\nlua_Number num=nvalue(o);\r\nlua_number2integer(res,num);\r\nreturn res;\r\n}\r\nelse\r\nreturn 0;\r\n}\r\nstatic int lua_toboolean(lua_State*L,int idx){\r\nconst TValue*o=index2adr(L,idx);\r\nreturn!l_isfalse(o);\r\n}\r\nstatic const char*lua_tolstring(lua_State*L,int idx,size_t*len){\r\nStkId o=index2adr(L,idx);\r\nif(!ttisstring(o)){\r\nif(!luaV_tostring(L,o)){\r\nif(len!=NULL)*len=0;\r\nreturn NULL;\r\n}\r\nluaC_checkGC(L);\r\no=index2adr(L,idx);\r\n}\r\nif(len!=NULL)*len=tsvalue(o)->len;\r\nreturn svalue(o);\r\n}\r\nstatic size_t lua_objlen(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nswitch(ttype(o)){\r\ncase 4:return tsvalue(o)->len;\r\ncase 7:return uvalue(o)->len;\r\ncase 5:return luaH_getn(hvalue(o));\r\ncase 3:{\r\nsize_t l;\r\nl=(luaV_tostring(L,o)?tsvalue(o)->len:0);\r\nreturn l;\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic lua_CFunction lua_tocfunction(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn(!iscfunction(o))?NULL:clvalue(o)->c.f;\r\n}\r\nstatic void*lua_touserdata(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nswitch(ttype(o)){\r\ncase 7:return(rawuvalue(o)+1);\r\ncase 2:return pvalue(o);\r\ndefault:return NULL;\r\n}\r\n}\r\nstatic void lua_pushnil(lua_State*L){\r\nsetnilvalue(L->top);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushnumber(lua_State*L,lua_Number n){\r\nsetnvalue(L->top,n);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushinteger(lua_State*L,lua_Integer n){\r\nsetnvalue(L->top,cast_num(n));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushlstring(lua_State*L,const char*s,size_t len){\r\nluaC_checkGC(L);\r\nsetsvalue(L,L->top,luaS_newlstr(L,s,len));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushstring(lua_State*L,const char*s){\r\nif(s==NULL)\r\nlua_pushnil(L);\r\nelse\r\nlua_pushlstring(L,s,strlen(s));\r\n}\r\nstatic const char*lua_pushvfstring(lua_State*L,const char*fmt,\r\nva_list argp){\r\nconst char*ret;\r\nluaC_checkGC(L);\r\nret=luaO_pushvfstring(L,fmt,argp);\r\nreturn ret;\r\n}\r\nstatic const char*lua_pushfstring(lua_State*L,const char*fmt,...){\r\nconst char*ret;\r\nva_list argp;\r\nluaC_checkGC(L);\r\nva_start(argp,fmt);\r\nret=luaO_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nreturn ret;\r\n}\r\nstatic void lua_pushcclosure(lua_State*L,lua_CFunction fn,int n){\r\nClosure*cl;\r\nluaC_checkGC(L);\r\napi_checknelems(L,n);\r\ncl=luaF_newCclosure(L,n,getcurrenv(L));\r\ncl->c.f=fn;\r\nL->top-=n;\r\nwhile(n--)\r\nsetobj(L,&cl->c.upvalue[n],L->top+n);\r\nsetclvalue(L,L->top,cl);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushboolean(lua_State*L,int b){\r\nsetbvalue(L->top,(b!=0));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_pushthread(lua_State*L){\r\nsetthvalue(L,L->top,L);\r\napi_incr_top(L);\r\nreturn(G(L)->mainthread==L);\r\n}\r\nstatic void lua_gettable(lua_State*L,int idx){\r\nStkId t;\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nluaV_gettable(L,t,L->top-1,L->top-1);\r\n}\r\nstatic void lua_getfield(lua_State*L,int idx,const char*k){\r\nStkId t;\r\nTValue key;\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nsetsvalue(L,&key,luaS_new(L,k));\r\nluaV_gettable(L,t,&key,L->top);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_rawget(lua_State*L,int idx){\r\nStkId t;\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nsetobj(L,L->top-1,luaH_get(hvalue(t),L->top-1));\r\n}\r\nstatic void lua_rawgeti(lua_State*L,int idx,int n){\r\nStkId o;\r\no=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(o));\r\nsetobj(L,L->top,luaH_getnum(hvalue(o),n));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_createtable(lua_State*L,int narray,int nrec){\r\nluaC_checkGC(L);\r\nsethvalue(L,L->top,luaH_new(L,narray,nrec));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_getmetatable(lua_State*L,int objindex){\r\nconst TValue*obj;\r\nTable*mt=NULL;\r\nint res;\r\nobj=index2adr(L,objindex);\r\nswitch(ttype(obj)){\r\ncase 5:\r\nmt=hvalue(obj)->metatable;\r\nbreak;\r\ncase 7:\r\nmt=uvalue(obj)->metatable;\r\nbreak;\r\ndefault:\r\nmt=G(L)->mt[ttype(obj)];\r\nbreak;\r\n}\r\nif(mt==NULL)\r\nres=0;\r\nelse{\r\nsethvalue(L,L->top,mt);\r\napi_incr_top(L);\r\nres=1;\r\n}\r\nreturn res;\r\n}\r\nstatic void lua_getfenv(lua_State*L,int idx){\r\nStkId o;\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nswitch(ttype(o)){\r\ncase 6:\r\nsethvalue(L,L->top,clvalue(o)->c.env);\r\nbreak;\r\ncase 7:\r\nsethvalue(L,L->top,uvalue(o)->env);\r\nbreak;\r\ncase 8:\r\nsetobj(L,L->top,gt(thvalue(o)));\r\nbreak;\r\ndefault:\r\nsetnilvalue(L->top);\r\nbreak;\r\n}\r\napi_incr_top(L);\r\n}\r\nstatic void lua_settable(lua_State*L,int idx){\r\nStkId t;\r\napi_checknelems(L,2);\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nluaV_settable(L,t,L->top-2,L->top-1);\r\nL->top-=2;\r\n}\r\nstatic void lua_setfield(lua_State*L,int idx,const char*k){\r\nStkId t;\r\nTValue key;\r\napi_checknelems(L,1);\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nsetsvalue(L,&key,luaS_new(L,k));\r\nluaV_settable(L,t,&key,L->top-1);\r\nL->top--;\r\n}\r\nstatic void lua_rawset(lua_State*L,int idx){\r\nStkId t;\r\napi_checknelems(L,2);\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nsetobj(L,luaH_set(L,hvalue(t),L->top-2),L->top-1);\r\nluaC_barriert(L,hvalue(t),L->top-1);\r\nL->top-=2;\r\n}\r\nstatic void lua_rawseti(lua_State*L,int idx,int n){\r\nStkId o;\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(o));\r\nsetobj(L,luaH_setnum(L,hvalue(o),n),L->top-1);\r\nluaC_barriert(L,hvalue(o),L->top-1);\r\nL->top--;\r\n}\r\nstatic int lua_setmetatable(lua_State*L,int objindex){\r\nTValue*obj;\r\nTable*mt;\r\napi_checknelems(L,1);\r\nobj=index2adr(L,objindex);\r\napi_checkvalidindex(L,obj);\r\nif(ttisnil(L->top-1))\r\nmt=NULL;\r\nelse{\r\nluai_apicheck(L,ttistable(L->top-1));\r\nmt=hvalue(L->top-1);\r\n}\r\nswitch(ttype(obj)){\r\ncase 5:{\r\nhvalue(obj)->metatable=mt;\r\nif(mt)\r\nluaC_objbarriert(L,hvalue(obj),mt);\r\nbreak;\r\n}\r\ncase 7:{\r\nuvalue(obj)->metatable=mt;\r\nif(mt)\r\nluaC_objbarrier(L,rawuvalue(obj),mt);\r\nbreak;\r\n}\r\ndefault:{\r\nG(L)->mt[ttype(obj)]=mt;\r\nbreak;\r\n}\r\n}\r\nL->top--;\r\nreturn 1;\r\n}\r\nstatic int lua_setfenv(lua_State*L,int idx){\r\nStkId o;\r\nint res=1;\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nluai_apicheck(L,ttistable(L->top-1));\r\nswitch(ttype(o)){\r\ncase 6:\r\nclvalue(o)->c.env=hvalue(L->top-1);\r\nbreak;\r\ncase 7:\r\nuvalue(o)->env=hvalue(L->top-1);\r\nbreak;\r\ncase 8:\r\nsethvalue(L,gt(thvalue(o)),hvalue(L->top-1));\r\nbreak;\r\ndefault:\r\nres=0;\r\nbreak;\r\n}\r\nif(res)luaC_objbarrier(L,gcvalue(o),hvalue(L->top-1));\r\nL->top--;\r\nreturn res;\r\n}\r\n#define adjustresults(L,nres){if(nres==(-1)&&L->top>=L->ci->top)L->ci->top=L->top;}\r\n#define checkresults(L,na,nr)luai_apicheck(L,(nr)==(-1)||(L->ci->top-L->top>=(nr)-(na)))\r\nstatic void lua_call(lua_State*L,int nargs,int nresults){\r\nStkId func;\r\napi_checknelems(L,nargs+1);\r\ncheckresults(L,nargs,nresults);\r\nfunc=L->top-(nargs+1);\r\nluaD_call(L,func,nresults);\r\nadjustresults(L,nresults);\r\n}\r\nstruct CallS{\r\nStkId func;\r\nint nresults;\r\n};\r\nstatic void f_call(lua_State*L,void*ud){\r\nstruct CallS*c=cast(struct CallS*,ud);\r\nluaD_call(L,c->func,c->nresults);\r\n}\r\nstatic int lua_pcall(lua_State*L,int nargs,int nresults,int errfunc){\r\nstruct CallS c;\r\nint status;\r\nptrdiff_t func;\r\napi_checknelems(L,nargs+1);\r\ncheckresults(L,nargs,nresults);\r\nif(errfunc==0)\r\nfunc=0;\r\nelse{\r\nStkId o=index2adr(L,errfunc);\r\napi_checkvalidindex(L,o);\r\nfunc=savestack(L,o);\r\n}\r\nc.func=L->top-(nargs+1);\r\nc.nresults=nresults;\r\nstatus=luaD_pcall(L,f_call,&c,savestack(L,c.func),func);\r\nadjustresults(L,nresults);\r\nreturn status;\r\n}\r\nstatic int lua_load(lua_State*L,lua_Reader reader,void*data,\r\nconst char*chunkname){\r\nZIO z;\r\nint status;\r\nif(!chunkname)chunkname=\"?\";\r\nluaZ_init(L,&z,reader,data);\r\nstatus=luaD_protectedparser(L,&z,chunkname);\r\nreturn status;\r\n}\r\nstatic int lua_error(lua_State*L){\r\napi_checknelems(L,1);\r\nluaG_errormsg(L);\r\nreturn 0;\r\n}\r\nstatic int lua_next(lua_State*L,int idx){\r\nStkId t;\r\nint more;\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nmore=luaH_next(L,hvalue(t),L->top-1);\r\nif(more){\r\napi_incr_top(L);\r\n}\r\nelse\r\nL->top-=1;\r\nreturn more;\r\n}\r\nstatic void lua_concat(lua_State*L,int n){\r\napi_checknelems(L,n);\r\nif(n>=2){\r\nluaC_checkGC(L);\r\nluaV_concat(L,n,cast_int(L->top-L->base)-1);\r\nL->top-=(n-1);\r\n}\r\nelse if(n==0){\r\nsetsvalue(L,L->top,luaS_newlstr(L,\"\",0));\r\napi_incr_top(L);\r\n}\r\n}\r\nstatic void*lua_newuserdata(lua_State*L,size_t size){\r\nUdata*u;\r\nluaC_checkGC(L);\r\nu=luaS_newudata(L,size,getcurrenv(L));\r\nsetuvalue(L,L->top,u);\r\napi_incr_top(L);\r\nreturn u+1;\r\n}\r\n#define luaL_getn(L,i)((int)lua_objlen(L,i))\r\n#define luaL_setn(L,i,j)((void)0)\r\ntypedef struct luaL_Reg{\r\nconst char*name;\r\nlua_CFunction func;\r\n}luaL_Reg;\r\nstatic void luaI_openlib(lua_State*L,const char*libname,\r\nconst luaL_Reg*l,int nup);\r\nstatic int luaL_argerror(lua_State*L,int numarg,const char*extramsg);\r\nstatic const char* luaL_checklstring(lua_State*L,int numArg,\r\nsize_t*l);\r\nstatic const char* luaL_optlstring(lua_State*L,int numArg,\r\nconst char*def,size_t*l);\r\nstatic lua_Integer luaL_checkinteger(lua_State*L,int numArg);\r\nstatic lua_Integer luaL_optinteger(lua_State*L,int nArg,\r\nlua_Integer def);\r\nstatic int luaL_error(lua_State*L,const char*fmt,...);\r\nstatic const char* luaL_findtable(lua_State*L,int idx,\r\nconst char*fname,int szhint);\r\n#define luaL_argcheck(L,cond,numarg,extramsg)((void)((cond)||luaL_argerror(L,(numarg),(extramsg))))\r\n#define luaL_checkstring(L,n)(luaL_checklstring(L,(n),NULL))\r\n#define luaL_optstring(L,n,d)(luaL_optlstring(L,(n),(d),NULL))\r\n#define luaL_checkint(L,n)((int)luaL_checkinteger(L,(n)))\r\n#define luaL_optint(L,n,d)((int)luaL_optinteger(L,(n),(d)))\r\n#define luaL_typename(L,i)lua_typename(L,lua_type(L,(i)))\r\n#define luaL_getmetatable(L,n)(lua_getfield(L,(-10000),(n)))\r\n#define luaL_opt(L,f,n,d)(lua_isnoneornil(L,(n))?(d):f(L,(n)))\r\ntypedef struct luaL_Buffer{\r\nchar*p;\r\nint lvl;\r\nlua_State*L;\r\nchar buffer[BUFSIZ];\r\n}luaL_Buffer;\r\n#define luaL_addchar(B,c)((void)((B)->p<((B)->buffer+BUFSIZ)||luaL_prepbuffer(B)),(*(B)->p++=(char)(c)))\r\n#define luaL_addsize(B,n)((B)->p+=(n))\r\nstatic char* luaL_prepbuffer(luaL_Buffer*B);\r\nstatic int luaL_argerror(lua_State*L,int narg,const char*extramsg){\r\nlua_Debug ar;\r\nif(!lua_getstack(L,0,&ar))\r\nreturn luaL_error(L,\"bad argument #%d (%s)\",narg,extramsg);\r\nlua_getinfo(L,\"n\",&ar);\r\nif(strcmp(ar.namewhat,\"method\")==0){\r\nnarg--;\r\nif(narg==0)\r\nreturn luaL_error(L,\"calling \"LUA_QL(\"%s\")\" on bad self (%s)\",\r\nar.name,extramsg);\r\n}\r\nif(ar.name==NULL)\r\nar.name=\"?\";\r\nreturn luaL_error(L,\"bad argument #%d to \"LUA_QL(\"%s\")\" (%s)\",\r\nnarg,ar.name,extramsg);\r\n}\r\nstatic int luaL_typerror(lua_State*L,int narg,const char*tname){\r\nconst char*msg=lua_pushfstring(L,\"%s expected, got %s\",\r\ntname,luaL_typename(L,narg));\r\nreturn luaL_argerror(L,narg,msg);\r\n}\r\nstatic void tag_error(lua_State*L,int narg,int tag){\r\nluaL_typerror(L,narg,lua_typename(L,tag));\r\n}\r\nstatic void luaL_where(lua_State*L,int level){\r\nlua_Debug ar;\r\nif(lua_getstack(L,level,&ar)){\r\nlua_getinfo(L,\"Sl\",&ar);\r\nif(ar.currentline>0){\r\nlua_pushfstring(L,\"%s:%d: \",ar.short_src,ar.currentline);\r\nreturn;\r\n}\r\n}\r\nlua_pushliteral(L,\"\");\r\n}\r\nstatic int luaL_error(lua_State*L,const char*fmt,...){\r\nva_list argp;\r\nva_start(argp,fmt);\r\nluaL_where(L,1);\r\nlua_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nlua_concat(L,2);\r\nreturn lua_error(L);\r\n}\r\nstatic int luaL_newmetatable(lua_State*L,const char*tname){\r\nlua_getfield(L,(-10000),tname);\r\nif(!lua_isnil(L,-1))\r\nreturn 0;\r\nlua_pop(L,1);\r\nlua_newtable(L);\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,(-10000),tname);\r\nreturn 1;\r\n}\r\nstatic void*luaL_checkudata(lua_State*L,int ud,const char*tname){\r\nvoid*p=lua_touserdata(L,ud);\r\nif(p!=NULL){\r\nif(lua_getmetatable(L,ud)){\r\nlua_getfield(L,(-10000),tname);\r\nif(lua_rawequal(L,-1,-2)){\r\nlua_pop(L,2);\r\nreturn p;\r\n}\r\n}\r\n}\r\nluaL_typerror(L,ud,tname);\r\nreturn NULL;\r\n}\r\nstatic void luaL_checkstack(lua_State*L,int space,const char*mes){\r\nif(!lua_checkstack(L,space))\r\nluaL_error(L,\"stack overflow (%s)\",mes);\r\n}\r\nstatic void luaL_checktype(lua_State*L,int narg,int t){\r\nif(lua_type(L,narg)!=t)\r\ntag_error(L,narg,t);\r\n}\r\nstatic void luaL_checkany(lua_State*L,int narg){\r\nif(lua_type(L,narg)==(-1))\r\nluaL_argerror(L,narg,\"value expected\");\r\n}\r\nstatic const char*luaL_checklstring(lua_State*L,int narg,size_t*len){\r\nconst char*s=lua_tolstring(L,narg,len);\r\nif(!s)tag_error(L,narg,4);\r\nreturn s;\r\n}\r\nstatic const char*luaL_optlstring(lua_State*L,int narg,\r\nconst char*def,size_t*len){\r\nif(lua_isnoneornil(L,narg)){\r\nif(len)\r\n*len=(def?strlen(def):0);\r\nreturn def;\r\n}\r\nelse return luaL_checklstring(L,narg,len);\r\n}\r\nstatic lua_Number luaL_checknumber(lua_State*L,int narg){\r\nlua_Number d=lua_tonumber(L,narg);\r\nif(d==0&&!lua_isnumber(L,narg))\r\ntag_error(L,narg,3);\r\nreturn d;\r\n}\r\nstatic lua_Integer luaL_checkinteger(lua_State*L,int narg){\r\nlua_Integer d=lua_tointeger(L,narg);\r\nif(d==0&&!lua_isnumber(L,narg))\r\ntag_error(L,narg,3);\r\nreturn d;\r\n}\r\nstatic lua_Integer luaL_optinteger(lua_State*L,int narg,\r\nlua_Integer def){\r\nreturn luaL_opt(L,luaL_checkinteger,narg,def);\r\n}\r\nstatic int luaL_getmetafield(lua_State*L,int obj,const char*event){\r\nif(!lua_getmetatable(L,obj))\r\nreturn 0;\r\nlua_pushstring(L,event);\r\nlua_rawget(L,-2);\r\nif(lua_isnil(L,-1)){\r\nlua_pop(L,2);\r\nreturn 0;\r\n}\r\nelse{\r\nlua_remove(L,-2);\r\nreturn 1;\r\n}\r\n}\r\nstatic void luaL_register(lua_State*L,const char*libname,\r\nconst luaL_Reg*l){\r\nluaI_openlib(L,libname,l,0);\r\n}\r\nstatic int libsize(const luaL_Reg*l){\r\nint size=0;\r\nfor(;l->name;l++)size++;\r\nreturn size;\r\n}\r\nstatic void luaI_openlib(lua_State*L,const char*libname,\r\nconst luaL_Reg*l,int nup){\r\nif(libname){\r\nint size=libsize(l);\r\nluaL_findtable(L,(-10000),\"_LOADED\",1);\r\nlua_getfield(L,-1,libname);\r\nif(!lua_istable(L,-1)){\r\nlua_pop(L,1);\r\nif(luaL_findtable(L,(-10002),libname,size)!=NULL)\r\nluaL_error(L,\"name conflict for module \"LUA_QL(\"%s\"),libname);\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,-3,libname);\r\n}\r\nlua_remove(L,-2);\r\nlua_insert(L,-(nup+1));\r\n}\r\nfor(;l->name;l++){\r\nint i;\r\nfor(i=0;i<nup;i++)\r\nlua_pushvalue(L,-nup);\r\nlua_pushcclosure(L,l->func,nup);\r\nlua_setfield(L,-(nup+2),l->name);\r\n}\r\nlua_pop(L,nup);\r\n}\r\nstatic const char*luaL_findtable(lua_State*L,int idx,\r\nconst char*fname,int szhint){\r\nconst char*e;\r\nlua_pushvalue(L,idx);\r\ndo{\r\ne=strchr(fname,'.');\r\nif(e==NULL)e=fname+strlen(fname);\r\nlua_pushlstring(L,fname,e-fname);\r\nlua_rawget(L,-2);\r\nif(lua_isnil(L,-1)){\r\nlua_pop(L,1);\r\nlua_createtable(L,0,(*e=='.'?1:szhint));\r\nlua_pushlstring(L,fname,e-fname);\r\nlua_pushvalue(L,-2);\r\nlua_settable(L,-4);\r\n}\r\nelse if(!lua_istable(L,-1)){\r\nlua_pop(L,2);\r\nreturn fname;\r\n}\r\nlua_remove(L,-2);\r\nfname=e+1;\r\n}while(*e=='.');\r\nreturn NULL;\r\n}\r\n#define bufflen(B)((B)->p-(B)->buffer)\r\n#define bufffree(B)((size_t)(BUFSIZ-bufflen(B)))\r\nstatic int emptybuffer(luaL_Buffer*B){\r\nsize_t l=bufflen(B);\r\nif(l==0)return 0;\r\nelse{\r\nlua_pushlstring(B->L,B->buffer,l);\r\nB->p=B->buffer;\r\nB->lvl++;\r\nreturn 1;\r\n}\r\n}\r\nstatic void adjuststack(luaL_Buffer*B){\r\nif(B->lvl>1){\r\nlua_State*L=B->L;\r\nint toget=1;\r\nsize_t toplen=lua_strlen(L,-1);\r\ndo{\r\nsize_t l=lua_strlen(L,-(toget+1));\r\nif(B->lvl-toget+1>=(20/2)||toplen>l){\r\ntoplen+=l;\r\ntoget++;\r\n}\r\nelse break;\r\n}while(toget<B->lvl);\r\nlua_concat(L,toget);\r\nB->lvl=B->lvl-toget+1;\r\n}\r\n}\r\nstatic char*luaL_prepbuffer(luaL_Buffer*B){\r\nif(emptybuffer(B))\r\nadjuststack(B);\r\nreturn B->buffer;\r\n}\r\nstatic void luaL_addlstring(luaL_Buffer*B,const char*s,size_t l){\r\nwhile(l--)\r\nluaL_addchar(B,*s++);\r\n}\r\nstatic void luaL_pushresult(luaL_Buffer*B){\r\nemptybuffer(B);\r\nlua_concat(B->L,B->lvl);\r\nB->lvl=1;\r\n}\r\nstatic void luaL_addvalue(luaL_Buffer*B){\r\nlua_State*L=B->L;\r\nsize_t vl;\r\nconst char*s=lua_tolstring(L,-1,&vl);\r\nif(vl<=bufffree(B)){\r\nmemcpy(B->p,s,vl);\r\nB->p+=vl;\r\nlua_pop(L,1);\r\n}\r\nelse{\r\nif(emptybuffer(B))\r\nlua_insert(L,-2);\r\nB->lvl++;\r\nadjuststack(B);\r\n}\r\n}\r\nstatic void luaL_buffinit(lua_State*L,luaL_Buffer*B){\r\nB->L=L;\r\nB->p=B->buffer;\r\nB->lvl=0;\r\n}\r\ntypedef struct LoadF{\r\nint extraline;\r\nFILE*f;\r\nchar buff[BUFSIZ];\r\n}LoadF;\r\nstatic const char*getF(lua_State*L,void*ud,size_t*size){\r\nLoadF*lf=(LoadF*)ud;\r\n(void)L;\r\nif(lf->extraline){\r\nlf->extraline=0;\r\n*size=1;\r\nreturn\"\\n\";\r\n}\r\nif(feof(lf->f))return NULL;\r\n*size=fread(lf->buff,1,sizeof(lf->buff),lf->f);\r\nreturn(*size>0)?lf->buff:NULL;\r\n}\r\nstatic int errfile(lua_State*L,const char*what,int fnameindex){\r\nconst char*serr=strerror(errno);\r\nconst char*filename=lua_tostring(L,fnameindex)+1;\r\nlua_pushfstring(L,\"cannot %s %s: %s\",what,filename,serr);\r\nlua_remove(L,fnameindex);\r\nreturn(5+1);\r\n}\r\nstatic int luaL_loadfile(lua_State*L,const char*filename){\r\nLoadF lf;\r\nint status,readstatus;\r\nint c;\r\nint fnameindex=lua_gettop(L)+1;\r\nlf.extraline=0;\r\nif(filename==NULL){\r\nlua_pushliteral(L,\"=stdin\");\r\nlf.f=stdin;\r\n}\r\nelse{\r\nlua_pushfstring(L,\"@%s\",filename);\r\nlf.f=fopen(filename,\"r\");\r\nif(lf.f==NULL)return errfile(L,\"open\",fnameindex);\r\n}\r\nc=getc(lf.f);\r\nif(c=='#'){\r\nlf.extraline=1;\r\nwhile((c=getc(lf.f))!=EOF&&c!='\\n');\r\nif(c=='\\n')c=getc(lf.f);\r\n}\r\nif(c==\"\\033Lua\"[0]&&filename){\r\nlf.f=freopen(filename,\"rb\",lf.f);\r\nif(lf.f==NULL)return errfile(L,\"reopen\",fnameindex);\r\nwhile((c=getc(lf.f))!=EOF&&c!=\"\\033Lua\"[0]);\r\nlf.extraline=0;\r\n}\r\nungetc(c,lf.f);\r\nstatus=lua_load(L,getF,&lf,lua_tostring(L,-1));\r\nreadstatus=ferror(lf.f);\r\nif(filename)fclose(lf.f);\r\nif(readstatus){\r\nlua_settop(L,fnameindex);\r\nreturn errfile(L,\"read\",fnameindex);\r\n}\r\nlua_remove(L,fnameindex);\r\nreturn status;\r\n}\r\ntypedef struct LoadS{\r\nconst char*s;\r\nsize_t size;\r\n}LoadS;\r\nstatic const char*getS(lua_State*L,void*ud,size_t*size){\r\nLoadS*ls=(LoadS*)ud;\r\n(void)L;\r\nif(ls->size==0)return NULL;\r\n*size=ls->size;\r\nls->size=0;\r\nreturn ls->s;\r\n}\r\nstatic int luaL_loadbuffer(lua_State*L,const char*buff,size_t size,\r\nconst char*name){\r\nLoadS ls;\r\nls.s=buff;\r\nls.size=size;\r\nreturn lua_load(L,getS,&ls,name);\r\n}\r\nstatic void*l_alloc(void*ud,void*ptr,size_t osize,size_t nsize){\r\n(void)ud;\r\n(void)osize;\r\nif(nsize==0){\r\nfree(ptr);\r\nreturn NULL;\r\n}\r\nelse\r\nreturn realloc(ptr,nsize);\r\n}\r\nstatic int panic(lua_State*L){\r\n(void)L;\r\nfprintf(stderr,\"PANIC: unprotected error in call to Lua API (%s)\\n\",\r\nlua_tostring(L,-1));\r\nreturn 0;\r\n}\r\nstatic lua_State*luaL_newstate(void){\r\nlua_State*L=lua_newstate(l_alloc,NULL);\r\nif(L)lua_atpanic(L,&panic);\r\nreturn L;\r\n}\r\nstatic int luaB_tonumber(lua_State*L){\r\nint base=luaL_optint(L,2,10);\r\nif(base==10){\r\nluaL_checkany(L,1);\r\nif(lua_isnumber(L,1)){\r\nlua_pushnumber(L,lua_tonumber(L,1));\r\nreturn 1;\r\n}\r\n}\r\nelse{\r\nconst char*s1=luaL_checkstring(L,1);\r\nchar*s2;\r\nunsigned long n;\r\nluaL_argcheck(L,2<=base&&base<=36,2,\"base out of range\");\r\nn=strtoul(s1,&s2,base);\r\nif(s1!=s2){\r\nwhile(isspace((unsigned char)(*s2)))s2++;\r\nif(*s2=='\\0'){\r\nlua_pushnumber(L,(lua_Number)n);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\nstatic int luaB_error(lua_State*L){\r\nint level=luaL_optint(L,2,1);\r\nlua_settop(L,1);\r\nif(lua_isstring(L,1)&&level>0){\r\nluaL_where(L,level);\r\nlua_pushvalue(L,1);\r\nlua_concat(L,2);\r\n}\r\nreturn lua_error(L);\r\n}\r\nstatic int luaB_setmetatable(lua_State*L){\r\nint t=lua_type(L,2);\r\nluaL_checktype(L,1,5);\r\nluaL_argcheck(L,t==0||t==5,2,\r\n\"nil or table expected\");\r\nif(luaL_getmetafield(L,1,\"__metatable\"))\r\nluaL_error(L,\"cannot change a protected metatable\");\r\nlua_settop(L,2);\r\nlua_setmetatable(L,1);\r\nreturn 1;\r\n}\r\nstatic void getfunc(lua_State*L,int opt){\r\nif(lua_isfunction(L,1))lua_pushvalue(L,1);\r\nelse{\r\nlua_Debug ar;\r\nint level=opt?luaL_optint(L,1,1):luaL_checkint(L,1);\r\nluaL_argcheck(L,level>=0,1,\"level must be non-negative\");\r\nif(lua_getstack(L,level,&ar)==0)\r\nluaL_argerror(L,1,\"invalid level\");\r\nlua_getinfo(L,\"f\",&ar);\r\nif(lua_isnil(L,-1))\r\nluaL_error(L,\"no function environment for tail call at level %d\",\r\nlevel);\r\n}\r\n}\r\nstatic int luaB_setfenv(lua_State*L){\r\nluaL_checktype(L,2,5);\r\ngetfunc(L,0);\r\nlua_pushvalue(L,2);\r\nif(lua_isnumber(L,1)&&lua_tonumber(L,1)==0){\r\nlua_pushthread(L);\r\nlua_insert(L,-2);\r\nlua_setfenv(L,-2);\r\nreturn 0;\r\n}\r\nelse if(lua_iscfunction(L,-2)||lua_setfenv(L,-2)==0)\r\nluaL_error(L,\r\nLUA_QL(\"setfenv\")\" cannot change environment of given object\");\r\nreturn 1;\r\n}\r\nstatic int luaB_rawget(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nluaL_checkany(L,2);\r\nlua_settop(L,2);\r\nlua_rawget(L,1);\r\nreturn 1;\r\n}\r\nstatic int luaB_type(lua_State*L){\r\nluaL_checkany(L,1);\r\nlua_pushstring(L,luaL_typename(L,1));\r\nreturn 1;\r\n}\r\nstatic int luaB_next(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_settop(L,2);\r\nif(lua_next(L,1))\r\nreturn 2;\r\nelse{\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\n}\r\nstatic int luaB_pairs(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\nlua_pushvalue(L,1);\r\nlua_pushnil(L);\r\nreturn 3;\r\n}\r\nstatic int ipairsaux(lua_State*L){\r\nint i=luaL_checkint(L,2);\r\nluaL_checktype(L,1,5);\r\ni++;\r\nlua_pushinteger(L,i);\r\nlua_rawgeti(L,1,i);\r\nreturn(lua_isnil(L,-1))?0:2;\r\n}\r\nstatic int luaB_ipairs(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\nlua_pushvalue(L,1);\r\nlua_pushinteger(L,0);\r\nreturn 3;\r\n}\r\nstatic int load_aux(lua_State*L,int status){\r\nif(status==0)\r\nreturn 1;\r\nelse{\r\nlua_pushnil(L);\r\nlua_insert(L,-2);\r\nreturn 2;\r\n}\r\n}\r\nstatic int luaB_loadstring(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nconst char*chunkname=luaL_optstring(L,2,s);\r\nreturn load_aux(L,luaL_loadbuffer(L,s,l,chunkname));\r\n}\r\nstatic int luaB_loadfile(lua_State*L){\r\nconst char*fname=luaL_optstring(L,1,NULL);\r\nreturn load_aux(L,luaL_loadfile(L,fname));\r\n}\r\nstatic int luaB_assert(lua_State*L){\r\nluaL_checkany(L,1);\r\nif(!lua_toboolean(L,1))\r\nreturn luaL_error(L,\"%s\",luaL_optstring(L,2,\"assertion failed!\"));\r\nreturn lua_gettop(L);\r\n}\r\nstatic int luaB_unpack(lua_State*L){\r\nint i,e,n;\r\nluaL_checktype(L,1,5);\r\ni=luaL_optint(L,2,1);\r\ne=luaL_opt(L,luaL_checkint,3,luaL_getn(L,1));\r\nif(i>e)return 0;\r\nn=e-i+1;\r\nif(n<=0||!lua_checkstack(L,n))\r\nreturn luaL_error(L,\"too many results to unpack\");\r\nlua_rawgeti(L,1,i);\r\nwhile(i++<e)\r\nlua_rawgeti(L,1,i);\r\nreturn n;\r\n}\r\nstatic int luaB_pcall(lua_State*L){\r\nint status;\r\nluaL_checkany(L,1);\r\nstatus=lua_pcall(L,lua_gettop(L)-1,(-1),0);\r\nlua_pushboolean(L,(status==0));\r\nlua_insert(L,1);\r\nreturn lua_gettop(L);\r\n}\r\nstatic int luaB_newproxy(lua_State*L){\r\nlua_settop(L,1);\r\nlua_newuserdata(L,0);\r\nif(lua_toboolean(L,1)==0)\r\nreturn 1;\r\nelse if(lua_isboolean(L,1)){\r\nlua_newtable(L);\r\nlua_pushvalue(L,-1);\r\nlua_pushboolean(L,1);\r\nlua_rawset(L,lua_upvalueindex(1));\r\n}\r\nelse{\r\nint validproxy=0;\r\nif(lua_getmetatable(L,1)){\r\nlua_rawget(L,lua_upvalueindex(1));\r\nvalidproxy=lua_toboolean(L,-1);\r\nlua_pop(L,1);\r\n}\r\nluaL_argcheck(L,validproxy,1,\"boolean or proxy expected\");\r\nlua_getmetatable(L,1);\r\n}\r\nlua_setmetatable(L,2);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg base_funcs[]={\r\n{\"assert\",luaB_assert},\r\n{\"error\",luaB_error},\r\n{\"loadfile\",luaB_loadfile},\r\n{\"loadstring\",luaB_loadstring},\r\n{\"next\",luaB_next},\r\n{\"pcall\",luaB_pcall},\r\n{\"rawget\",luaB_rawget},\r\n{\"setfenv\",luaB_setfenv},\r\n{\"setmetatable\",luaB_setmetatable},\r\n{\"tonumber\",luaB_tonumber},\r\n{\"type\",luaB_type},\r\n{\"unpack\",luaB_unpack},\r\n{NULL,NULL}\r\n};\r\nstatic void auxopen(lua_State*L,const char*name,\r\nlua_CFunction f,lua_CFunction u){\r\nlua_pushcfunction(L,u);\r\nlua_pushcclosure(L,f,1);\r\nlua_setfield(L,-2,name);\r\n}\r\nstatic void base_open(lua_State*L){\r\nlua_pushvalue(L,(-10002));\r\nlua_setglobal(L,\"_G\");\r\nluaL_register(L,\"_G\",base_funcs);\r\nlua_pushliteral(L,\"Lua 5.1\");\r\nlua_setglobal(L,\"_VERSION\");\r\nauxopen(L,\"ipairs\",luaB_ipairs,ipairsaux);\r\nauxopen(L,\"pairs\",luaB_pairs,luaB_next);\r\nlua_createtable(L,0,1);\r\nlua_pushvalue(L,-1);\r\nlua_setmetatable(L,-2);\r\nlua_pushliteral(L,\"kv\");\r\nlua_setfield(L,-2,\"__mode\");\r\nlua_pushcclosure(L,luaB_newproxy,1);\r\nlua_setglobal(L,\"newproxy\");\r\n}\r\nstatic int luaopen_base(lua_State*L){\r\nbase_open(L);\r\nreturn 1;\r\n}\r\n#define aux_getn(L,n)(luaL_checktype(L,n,5),luaL_getn(L,n))\r\nstatic int tinsert(lua_State*L){\r\nint e=aux_getn(L,1)+1;\r\nint pos;\r\nswitch(lua_gettop(L)){\r\ncase 2:{\r\npos=e;\r\nbreak;\r\n}\r\ncase 3:{\r\nint i;\r\npos=luaL_checkint(L,2);\r\nif(pos>e)e=pos;\r\nfor(i=e;i>pos;i--){\r\nlua_rawgeti(L,1,i-1);\r\nlua_rawseti(L,1,i);\r\n}\r\nbreak;\r\n}\r\ndefault:{\r\nreturn luaL_error(L,\"wrong number of arguments to \"LUA_QL(\"insert\"));\r\n}\r\n}\r\nluaL_setn(L,1,e);\r\nlua_rawseti(L,1,pos);\r\nreturn 0;\r\n}\r\nstatic int tremove(lua_State*L){\r\nint e=aux_getn(L,1);\r\nint pos=luaL_optint(L,2,e);\r\nif(!(1<=pos&&pos<=e))\r\nreturn 0;\r\nluaL_setn(L,1,e-1);\r\nlua_rawgeti(L,1,pos);\r\nfor(;pos<e;pos++){\r\nlua_rawgeti(L,1,pos+1);\r\nlua_rawseti(L,1,pos);\r\n}\r\nlua_pushnil(L);\r\nlua_rawseti(L,1,e);\r\nreturn 1;\r\n}\r\nstatic void addfield(lua_State*L,luaL_Buffer*b,int i){\r\nlua_rawgeti(L,1,i);\r\nif(!lua_isstring(L,-1))\r\nluaL_error(L,\"invalid value (%s) at index %d in table for \"\r\nLUA_QL(\"concat\"),luaL_typename(L,-1),i);\r\nluaL_addvalue(b);\r\n}\r\nstatic int tconcat(lua_State*L){\r\nluaL_Buffer b;\r\nsize_t lsep;\r\nint i,last;\r\nconst char*sep=luaL_optlstring(L,2,\"\",&lsep);\r\nluaL_checktype(L,1,5);\r\ni=luaL_optint(L,3,1);\r\nlast=luaL_opt(L,luaL_checkint,4,luaL_getn(L,1));\r\nluaL_buffinit(L,&b);\r\nfor(;i<last;i++){\r\naddfield(L,&b,i);\r\nluaL_addlstring(&b,sep,lsep);\r\n}\r\nif(i==last)\r\naddfield(L,&b,i);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic void set2(lua_State*L,int i,int j){\r\nlua_rawseti(L,1,i);\r\nlua_rawseti(L,1,j);\r\n}\r\nstatic int sort_comp(lua_State*L,int a,int b){\r\nif(!lua_isnil(L,2)){\r\nint res;\r\nlua_pushvalue(L,2);\r\nlua_pushvalue(L,a-1);\r\nlua_pushvalue(L,b-2);\r\nlua_call(L,2,1);\r\nres=lua_toboolean(L,-1);\r\nlua_pop(L,1);\r\nreturn res;\r\n}\r\nelse\r\nreturn lua_lessthan(L,a,b);\r\n}\r\nstatic void auxsort(lua_State*L,int l,int u){\r\nwhile(l<u){\r\nint i,j;\r\nlua_rawgeti(L,1,l);\r\nlua_rawgeti(L,1,u);\r\nif(sort_comp(L,-1,-2))\r\nset2(L,l,u);\r\nelse\r\nlua_pop(L,2);\r\nif(u-l==1)break;\r\ni=(l+u)/2;\r\nlua_rawgeti(L,1,i);\r\nlua_rawgeti(L,1,l);\r\nif(sort_comp(L,-2,-1))\r\nset2(L,i,l);\r\nelse{\r\nlua_pop(L,1);\r\nlua_rawgeti(L,1,u);\r\nif(sort_comp(L,-1,-2))\r\nset2(L,i,u);\r\nelse\r\nlua_pop(L,2);\r\n}\r\nif(u-l==2)break;\r\nlua_rawgeti(L,1,i);\r\nlua_pushvalue(L,-1);\r\nlua_rawgeti(L,1,u-1);\r\nset2(L,i,u-1);\r\ni=l;j=u-1;\r\nfor(;;){\r\nwhile(lua_rawgeti(L,1,++i),sort_comp(L,-1,-2)){\r\nif(i>u)luaL_error(L,\"invalid order function for sorting\");\r\nlua_pop(L,1);\r\n}\r\nwhile(lua_rawgeti(L,1,--j),sort_comp(L,-3,-1)){\r\nif(j<l)luaL_error(L,\"invalid order function for sorting\");\r\nlua_pop(L,1);\r\n}\r\nif(j<i){\r\nlua_pop(L,3);\r\nbreak;\r\n}\r\nset2(L,i,j);\r\n}\r\nlua_rawgeti(L,1,u-1);\r\nlua_rawgeti(L,1,i);\r\nset2(L,u-1,i);\r\nif(i-l<u-i){\r\nj=l;i=i-1;l=i+2;\r\n}\r\nelse{\r\nj=i+1;i=u;u=j-2;\r\n}\r\nauxsort(L,j,i);\r\n}\r\n}\r\nstatic int sort(lua_State*L){\r\nint n=aux_getn(L,1);\r\nluaL_checkstack(L,40,\"\");\r\nif(!lua_isnoneornil(L,2))\r\nluaL_checktype(L,2,6);\r\nlua_settop(L,2);\r\nauxsort(L,1,n);\r\nreturn 0;\r\n}\r\nstatic const luaL_Reg tab_funcs[]={\r\n{\"concat\",tconcat},\r\n{\"insert\",tinsert},\r\n{\"remove\",tremove},\r\n{\"sort\",sort},\r\n{NULL,NULL}\r\n};\r\nstatic int luaopen_table(lua_State*L){\r\nluaL_register(L,\"table\",tab_funcs);\r\nreturn 1;\r\n}\r\nstatic const char*const fnames[]={\"input\",\"output\"};\r\nstatic int pushresult(lua_State*L,int i,const char*filename){\r\nint en=errno;\r\nif(i){\r\nlua_pushboolean(L,1);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nif(filename)\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(en));\r\nelse\r\nlua_pushfstring(L,\"%s\",strerror(en));\r\nlua_pushinteger(L,en);\r\nreturn 3;\r\n}\r\n}\r\nstatic void fileerror(lua_State*L,int arg,const char*filename){\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(errno));\r\nluaL_argerror(L,arg,lua_tostring(L,-1));\r\n}\r\n#define tofilep(L)((FILE**)luaL_checkudata(L,1,\"FILE*\"))\r\nstatic int io_type(lua_State*L){\r\nvoid*ud;\r\nluaL_checkany(L,1);\r\nud=lua_touserdata(L,1);\r\nlua_getfield(L,(-10000),\"FILE*\");\r\nif(ud==NULL||!lua_getmetatable(L,1)||!lua_rawequal(L,-2,-1))\r\nlua_pushnil(L);\r\nelse if(*((FILE**)ud)==NULL)\r\nlua_pushliteral(L,\"closed file\");\r\nelse\r\nlua_pushliteral(L,\"file\");\r\nreturn 1;\r\n}\r\nstatic FILE*tofile(lua_State*L){\r\nFILE**f=tofilep(L);\r\nif(*f==NULL)\r\nluaL_error(L,\"attempt to use a closed file\");\r\nreturn*f;\r\n}\r\nstatic FILE**newfile(lua_State*L){\r\nFILE**pf=(FILE**)lua_newuserdata(L,sizeof(FILE*));\r\n*pf=NULL;\r\nluaL_getmetatable(L,\"FILE*\");\r\nlua_setmetatable(L,-2);\r\nreturn pf;\r\n}\r\nstatic int io_noclose(lua_State*L){\r\nlua_pushnil(L);\r\nlua_pushliteral(L,\"cannot close standard file\");\r\nreturn 2;\r\n}\r\nstatic int io_pclose(lua_State*L){\r\nFILE**p=tofilep(L);\r\nint ok=lua_pclose(L,*p);\r\n*p=NULL;\r\nreturn pushresult(L,ok,NULL);\r\n}\r\nstatic int io_fclose(lua_State*L){\r\nFILE**p=tofilep(L);\r\nint ok=(fclose(*p)==0);\r\n*p=NULL;\r\nreturn pushresult(L,ok,NULL);\r\n}\r\nstatic int aux_close(lua_State*L){\r\nlua_getfenv(L,1);\r\nlua_getfield(L,-1,\"__close\");\r\nreturn(lua_tocfunction(L,-1))(L);\r\n}\r\nstatic int io_close(lua_State*L){\r\nif(lua_isnone(L,1))\r\nlua_rawgeti(L,(-10001),2);\r\ntofile(L);\r\nreturn aux_close(L);\r\n}\r\nstatic int io_gc(lua_State*L){\r\nFILE*f=*tofilep(L);\r\nif(f!=NULL)\r\naux_close(L);\r\nreturn 0;\r\n}\r\nstatic int io_open(lua_State*L){\r\nconst char*filename=luaL_checkstring(L,1);\r\nconst char*mode=luaL_optstring(L,2,\"r\");\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,mode);\r\nreturn(*pf==NULL)?pushresult(L,0,filename):1;\r\n}\r\nstatic FILE*getiofile(lua_State*L,int findex){\r\nFILE*f;\r\nlua_rawgeti(L,(-10001),findex);\r\nf=*(FILE**)lua_touserdata(L,-1);\r\nif(f==NULL)\r\nluaL_error(L,\"standard %s file is closed\",fnames[findex-1]);\r\nreturn f;\r\n}\r\nstatic int g_iofile(lua_State*L,int f,const char*mode){\r\nif(!lua_isnoneornil(L,1)){\r\nconst char*filename=lua_tostring(L,1);\r\nif(filename){\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,mode);\r\nif(*pf==NULL)\r\nfileerror(L,1,filename);\r\n}\r\nelse{\r\ntofile(L);\r\nlua_pushvalue(L,1);\r\n}\r\nlua_rawseti(L,(-10001),f);\r\n}\r\nlua_rawgeti(L,(-10001),f);\r\nreturn 1;\r\n}\r\nstatic int io_input(lua_State*L){\r\nreturn g_iofile(L,1,\"r\");\r\n}\r\nstatic int io_output(lua_State*L){\r\nreturn g_iofile(L,2,\"w\");\r\n}\r\nstatic int io_readline(lua_State*L);\r\nstatic void aux_lines(lua_State*L,int idx,int toclose){\r\nlua_pushvalue(L,idx);\r\nlua_pushboolean(L,toclose);\r\nlua_pushcclosure(L,io_readline,2);\r\n}\r\nstatic int f_lines(lua_State*L){\r\ntofile(L);\r\naux_lines(L,1,0);\r\nreturn 1;\r\n}\r\nstatic int io_lines(lua_State*L){\r\nif(lua_isnoneornil(L,1)){\r\nlua_rawgeti(L,(-10001),1);\r\nreturn f_lines(L);\r\n}\r\nelse{\r\nconst char*filename=luaL_checkstring(L,1);\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,\"r\");\r\nif(*pf==NULL)\r\nfileerror(L,1,filename);\r\naux_lines(L,lua_gettop(L),1);\r\nreturn 1;\r\n}\r\n}\r\nstatic int read_number(lua_State*L,FILE*f){\r\nlua_Number d;\r\nif(fscanf(f,\"%lf\",&d)==1){\r\nlua_pushnumber(L,d);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nreturn 0;\r\n}\r\n}\r\nstatic int test_eof(lua_State*L,FILE*f){\r\nint c=getc(f);\r\nungetc(c,f);\r\nlua_pushlstring(L,NULL,0);\r\nreturn(c!=EOF);\r\n}\r\nstatic int read_line(lua_State*L,FILE*f){\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nfor(;;){\r\nsize_t l;\r\nchar*p=luaL_prepbuffer(&b);\r\nif(fgets(p,BUFSIZ,f)==NULL){\r\nluaL_pushresult(&b);\r\nreturn(lua_objlen(L,-1)>0);\r\n}\r\nl=strlen(p);\r\nif(l==0||p[l-1]!='\\n')\r\nluaL_addsize(&b,l);\r\nelse{\r\nluaL_addsize(&b,l-1);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nstatic int read_chars(lua_State*L,FILE*f,size_t n){\r\nsize_t rlen;\r\nsize_t nr;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nrlen=BUFSIZ;\r\ndo{\r\nchar*p=luaL_prepbuffer(&b);\r\nif(rlen>n)rlen=n;\r\nnr=fread(p,sizeof(char),rlen,f);\r\nluaL_addsize(&b,nr);\r\nn-=nr;\r\n}while(n>0&&nr==rlen);\r\nluaL_pushresult(&b);\r\nreturn(n==0||lua_objlen(L,-1)>0);\r\n}\r\nstatic int g_read(lua_State*L,FILE*f,int first){\r\nint nargs=lua_gettop(L)-1;\r\nint success;\r\nint n;\r\nclearerr(f);\r\nif(nargs==0){\r\nsuccess=read_line(L,f);\r\nn=first+1;\r\n}\r\nelse{\r\nluaL_checkstack(L,nargs+20,\"too many arguments\");\r\nsuccess=1;\r\nfor(n=first;nargs--&&success;n++){\r\nif(lua_type(L,n)==3){\r\nsize_t l=(size_t)lua_tointeger(L,n);\r\nsuccess=(l==0)?test_eof(L,f):read_chars(L,f,l);\r\n}\r\nelse{\r\nconst char*p=lua_tostring(L,n);\r\nluaL_argcheck(L,p&&p[0]=='*',n,\"invalid option\");\r\nswitch(p[1]){\r\ncase'n':\r\nsuccess=read_number(L,f);\r\nbreak;\r\ncase'l':\r\nsuccess=read_line(L,f);\r\nbreak;\r\ncase'a':\r\nread_chars(L,f,~((size_t)0));\r\nsuccess=1;\r\nbreak;\r\ndefault:\r\nreturn luaL_argerror(L,n,\"invalid format\");\r\n}\r\n}\r\n}\r\n}\r\nif(ferror(f))\r\nreturn pushresult(L,0,NULL);\r\nif(!success){\r\nlua_pop(L,1);\r\nlua_pushnil(L);\r\n}\r\nreturn n-first;\r\n}\r\nstatic int io_read(lua_State*L){\r\nreturn g_read(L,getiofile(L,1),1);\r\n}\r\nstatic int f_read(lua_State*L){\r\nreturn g_read(L,tofile(L),2);\r\n}\r\nstatic int io_readline(lua_State*L){\r\nFILE*f=*(FILE**)lua_touserdata(L,lua_upvalueindex(1));\r\nint sucess;\r\nif(f==NULL)\r\nluaL_error(L,\"file is already closed\");\r\nsucess=read_line(L,f);\r\nif(ferror(f))\r\nreturn luaL_error(L,\"%s\",strerror(errno));\r\nif(sucess)return 1;\r\nelse{\r\nif(lua_toboolean(L,lua_upvalueindex(2))){\r\nlua_settop(L,0);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\naux_close(L);\r\n}\r\nreturn 0;\r\n}\r\n}\r\nstatic int g_write(lua_State*L,FILE*f,int arg){\r\nint nargs=lua_gettop(L)-1;\r\nint status=1;\r\nfor(;nargs--;arg++){\r\nif(lua_type(L,arg)==3){\r\nstatus=status&&\r\nfprintf(f,\"%.14g\",lua_tonumber(L,arg))>0;\r\n}\r\nelse{\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nstatus=status&&(fwrite(s,sizeof(char),l,f)==l);\r\n}\r\n}\r\nreturn pushresult(L,status,NULL);\r\n}\r\nstatic int io_write(lua_State*L){\r\nreturn g_write(L,getiofile(L,2),1);\r\n}\r\nstatic int f_write(lua_State*L){\r\nreturn g_write(L,tofile(L),2);\r\n}\r\nstatic int io_flush(lua_State*L){\r\nreturn pushresult(L,fflush(getiofile(L,2))==0,NULL);\r\n}\r\nstatic int f_flush(lua_State*L){\r\nreturn pushresult(L,fflush(tofile(L))==0,NULL);\r\n}\r\nstatic const luaL_Reg iolib[]={\r\n{\"close\",io_close},\r\n{\"flush\",io_flush},\r\n{\"input\",io_input},\r\n{\"lines\",io_lines},\r\n{\"open\",io_open},\r\n{\"output\",io_output},\r\n{\"read\",io_read},\r\n{\"type\",io_type},\r\n{\"write\",io_write},\r\n{NULL,NULL}\r\n};\r\nstatic const luaL_Reg flib[]={\r\n{\"close\",io_close},\r\n{\"flush\",f_flush},\r\n{\"lines\",f_lines},\r\n{\"read\",f_read},\r\n{\"write\",f_write},\r\n{\"__gc\",io_gc},\r\n{NULL,NULL}\r\n};\r\nstatic void createmeta(lua_State*L){\r\nluaL_newmetatable(L,\"FILE*\");\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,-2,\"__index\");\r\nluaL_register(L,NULL,flib);\r\n}\r\nstatic void createstdfile(lua_State*L,FILE*f,int k,const char*fname){\r\n*newfile(L)=f;\r\nif(k>0){\r\nlua_pushvalue(L,-1);\r\nlua_rawseti(L,(-10001),k);\r\n}\r\nlua_pushvalue(L,-2);\r\nlua_setfenv(L,-2);\r\nlua_setfield(L,-3,fname);\r\n}\r\nstatic void newfenv(lua_State*L,lua_CFunction cls){\r\nlua_createtable(L,0,1);\r\nlua_pushcfunction(L,cls);\r\nlua_setfield(L,-2,\"__close\");\r\n}\r\nstatic int luaopen_io(lua_State*L){\r\ncreatemeta(L);\r\nnewfenv(L,io_fclose);\r\nlua_replace(L,(-10001));\r\nluaL_register(L,\"io\",iolib);\r\nnewfenv(L,io_noclose);\r\ncreatestdfile(L,stdin,1,\"stdin\");\r\ncreatestdfile(L,stdout,2,\"stdout\");\r\ncreatestdfile(L,stderr,0,\"stderr\");\r\nlua_pop(L,1);\r\nlua_getfield(L,-1,\"popen\");\r\nnewfenv(L,io_pclose);\r\nlua_setfenv(L,-2);\r\nlua_pop(L,1);\r\nreturn 1;\r\n}\r\nstatic int os_pushresult(lua_State*L,int i,const char*filename){\r\nint en=errno;\r\nif(i){\r\nlua_pushboolean(L,1);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(en));\r\nlua_pushinteger(L,en);\r\nreturn 3;\r\n}\r\n}\r\nstatic int os_remove(lua_State*L){\r\nconst char*filename=luaL_checkstring(L,1);\r\nreturn os_pushresult(L,remove(filename)==0,filename);\r\n}\r\nstatic int os_exit(lua_State*L){\r\nexit(luaL_optint(L,1,EXIT_SUCCESS));\r\n}\r\nstatic const luaL_Reg syslib[]={\r\n{\"exit\",os_exit},\r\n{\"remove\",os_remove},\r\n{NULL,NULL}\r\n};\r\nstatic int luaopen_os(lua_State*L){\r\nluaL_register(L,\"os\",syslib);\r\nreturn 1;\r\n}\r\n#define uchar(c)((unsigned char)(c))\r\nstatic ptrdiff_t posrelat(ptrdiff_t pos,size_t len){\r\nif(pos<0)pos+=(ptrdiff_t)len+1;\r\nreturn(pos>=0)?pos:0;\r\n}\r\nstatic int str_sub(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nptrdiff_t start=posrelat(luaL_checkinteger(L,2),l);\r\nptrdiff_t end=posrelat(luaL_optinteger(L,3,-1),l);\r\nif(start<1)start=1;\r\nif(end>(ptrdiff_t)l)end=(ptrdiff_t)l;\r\nif(start<=end)\r\nlua_pushlstring(L,s+start-1,end-start+1);\r\nelse lua_pushliteral(L,\"\");\r\nreturn 1;\r\n}\r\nstatic int str_lower(lua_State*L){\r\nsize_t l;\r\nsize_t i;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nluaL_buffinit(L,&b);\r\nfor(i=0;i<l;i++)\r\nluaL_addchar(&b,tolower(uchar(s[i])));\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_upper(lua_State*L){\r\nsize_t l;\r\nsize_t i;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nluaL_buffinit(L,&b);\r\nfor(i=0;i<l;i++)\r\nluaL_addchar(&b,toupper(uchar(s[i])));\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_rep(lua_State*L){\r\nsize_t l;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nint n=luaL_checkint(L,2);\r\nluaL_buffinit(L,&b);\r\nwhile(n-->0)\r\nluaL_addlstring(&b,s,l);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_byte(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nptrdiff_t posi=posrelat(luaL_optinteger(L,2,1),l);\r\nptrdiff_t pose=posrelat(luaL_optinteger(L,3,posi),l);\r\nint n,i;\r\nif(posi<=0)posi=1;\r\nif((size_t)pose>l)pose=l;\r\nif(posi>pose)return 0;\r\nn=(int)(pose-posi+1);\r\nif(posi+n<=pose)\r\nluaL_error(L,\"string slice too long\");\r\nluaL_checkstack(L,n,\"string slice too long\");\r\nfor(i=0;i<n;i++)\r\nlua_pushinteger(L,uchar(s[posi+i-1]));\r\nreturn n;\r\n}\r\nstatic int str_char(lua_State*L){\r\nint n=lua_gettop(L);\r\nint i;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nfor(i=1;i<=n;i++){\r\nint c=luaL_checkint(L,i);\r\nluaL_argcheck(L,uchar(c)==c,i,\"invalid value\");\r\nluaL_addchar(&b,uchar(c));\r\n}\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\ntypedef struct MatchState{\r\nconst char*src_init;\r\nconst char*src_end;\r\nlua_State*L;\r\nint level;\r\nstruct{\r\nconst char*init;\r\nptrdiff_t len;\r\n}capture[32];\r\n}MatchState;\r\nstatic int check_capture(MatchState*ms,int l){\r\nl-='1';\r\nif(l<0||l>=ms->level||ms->capture[l].len==(-1))\r\nreturn luaL_error(ms->L,\"invalid capture index\");\r\nreturn l;\r\n}\r\nstatic int capture_to_close(MatchState*ms){\r\nint level=ms->level;\r\nfor(level--;level>=0;level--)\r\nif(ms->capture[level].len==(-1))return level;\r\nreturn luaL_error(ms->L,\"invalid pattern capture\");\r\n}\r\nstatic const char*classend(MatchState*ms,const char*p){\r\nswitch(*p++){\r\ncase'%':{\r\nif(*p=='\\0')\r\nluaL_error(ms->L,\"malformed pattern (ends with \"LUA_QL(\"%%\")\")\");\r\nreturn p+1;\r\n}\r\ncase'[':{\r\nif(*p=='^')p++;\r\ndo{\r\nif(*p=='\\0')\r\nluaL_error(ms->L,\"malformed pattern (missing \"LUA_QL(\"]\")\")\");\r\nif(*(p++)=='%'&&*p!='\\0')\r\np++;\r\n}while(*p!=']');\r\nreturn p+1;\r\n}\r\ndefault:{\r\nreturn p;\r\n}\r\n}\r\n}\r\nstatic int match_class(int c,int cl){\r\nint res;\r\nswitch(tolower(cl)){\r\ncase'a':res=isalpha(c);break;\r\ncase'c':res=iscntrl(c);break;\r\ncase'd':res=isdigit(c);break;\r\ncase'l':res=islower(c);break;\r\ncase'p':res=ispunct(c);break;\r\ncase's':res=isspace(c);break;\r\ncase'u':res=isupper(c);break;\r\ncase'w':res=isalnum(c);break;\r\ncase'x':res=isxdigit(c);break;\r\ncase'z':res=(c==0);break;\r\ndefault:return(cl==c);\r\n}\r\nreturn(islower(cl)?res:!res);\r\n}\r\nstatic int matchbracketclass(int c,const char*p,const char*ec){\r\nint sig=1;\r\nif(*(p+1)=='^'){\r\nsig=0;\r\np++;\r\n}\r\nwhile(++p<ec){\r\nif(*p=='%'){\r\np++;\r\nif(match_class(c,uchar(*p)))\r\nreturn sig;\r\n}\r\nelse if((*(p+1)=='-')&&(p+2<ec)){\r\np+=2;\r\nif(uchar(*(p-2))<=c&&c<=uchar(*p))\r\nreturn sig;\r\n}\r\nelse if(uchar(*p)==c)return sig;\r\n}\r\nreturn!sig;\r\n}\r\nstatic int singlematch(int c,const char*p,const char*ep){\r\nswitch(*p){\r\ncase'.':return 1;\r\ncase'%':return match_class(c,uchar(*(p+1)));\r\ncase'[':return matchbracketclass(c,p,ep-1);\r\ndefault:return(uchar(*p)==c);\r\n}\r\n}\r\nstatic const char*match(MatchState*ms,const char*s,const char*p);\r\nstatic const char*matchbalance(MatchState*ms,const char*s,\r\nconst char*p){\r\nif(*p==0||*(p+1)==0)\r\nluaL_error(ms->L,\"unbalanced pattern\");\r\nif(*s!=*p)return NULL;\r\nelse{\r\nint b=*p;\r\nint e=*(p+1);\r\nint cont=1;\r\nwhile(++s<ms->src_end){\r\nif(*s==e){\r\nif(--cont==0)return s+1;\r\n}\r\nelse if(*s==b)cont++;\r\n}\r\n}\r\nreturn NULL;\r\n}\r\nstatic const char*max_expand(MatchState*ms,const char*s,\r\nconst char*p,const char*ep){\r\nptrdiff_t i=0;\r\nwhile((s+i)<ms->src_end&&singlematch(uchar(*(s+i)),p,ep))\r\ni++;\r\nwhile(i>=0){\r\nconst char*res=match(ms,(s+i),ep+1);\r\nif(res)return res;\r\ni--;\r\n}\r\nreturn NULL;\r\n}\r\nstatic const char*min_expand(MatchState*ms,const char*s,\r\nconst char*p,const char*ep){\r\nfor(;;){\r\nconst char*res=match(ms,s,ep+1);\r\nif(res!=NULL)\r\nreturn res;\r\nelse if(s<ms->src_end&&singlematch(uchar(*s),p,ep))\r\ns++;\r\nelse return NULL;\r\n}\r\n}\r\nstatic const char*start_capture(MatchState*ms,const char*s,\r\nconst char*p,int what){\r\nconst char*res;\r\nint level=ms->level;\r\nif(level>=32)luaL_error(ms->L,\"too many captures\");\r\nms->capture[level].init=s;\r\nms->capture[level].len=what;\r\nms->level=level+1;\r\nif((res=match(ms,s,p))==NULL)\r\nms->level--;\r\nreturn res;\r\n}\r\nstatic const char*end_capture(MatchState*ms,const char*s,\r\nconst char*p){\r\nint l=capture_to_close(ms);\r\nconst char*res;\r\nms->capture[l].len=s-ms->capture[l].init;\r\nif((res=match(ms,s,p))==NULL)\r\nms->capture[l].len=(-1);\r\nreturn res;\r\n}\r\nstatic const char*match_capture(MatchState*ms,const char*s,int l){\r\nsize_t len;\r\nl=check_capture(ms,l);\r\nlen=ms->capture[l].len;\r\nif((size_t)(ms->src_end-s)>=len&&\r\nmemcmp(ms->capture[l].init,s,len)==0)\r\nreturn s+len;\r\nelse return NULL;\r\n}\r\nstatic const char*match(MatchState*ms,const char*s,const char*p){\r\ninit:\r\nswitch(*p){\r\ncase'(':{\r\nif(*(p+1)==')')\r\nreturn start_capture(ms,s,p+2,(-2));\r\nelse\r\nreturn start_capture(ms,s,p+1,(-1));\r\n}\r\ncase')':{\r\nreturn end_capture(ms,s,p+1);\r\n}\r\ncase'%':{\r\nswitch(*(p+1)){\r\ncase'b':{\r\ns=matchbalance(ms,s,p+2);\r\nif(s==NULL)return NULL;\r\np+=4;goto init;\r\n}\r\ncase'f':{\r\nconst char*ep;char previous;\r\np+=2;\r\nif(*p!='[')\r\nluaL_error(ms->L,\"missing \"LUA_QL(\"[\")\" after \"\r\nLUA_QL(\"%%f\")\" in pattern\");\r\nep=classend(ms,p);\r\nprevious=(s==ms->src_init)?'\\0':*(s-1);\r\nif(matchbracketclass(uchar(previous),p,ep-1)||\r\n!matchbracketclass(uchar(*s),p,ep-1))return NULL;\r\np=ep;goto init;\r\n}\r\ndefault:{\r\nif(isdigit(uchar(*(p+1)))){\r\ns=match_capture(ms,s,uchar(*(p+1)));\r\nif(s==NULL)return NULL;\r\np+=2;goto init;\r\n}\r\ngoto dflt;\r\n}\r\n}\r\n}\r\ncase'\\0':{\r\nreturn s;\r\n}\r\ncase'$':{\r\nif(*(p+1)=='\\0')\r\nreturn(s==ms->src_end)?s:NULL;\r\nelse goto dflt;\r\n}\r\ndefault:dflt:{\r\nconst char*ep=classend(ms,p);\r\nint m=s<ms->src_end&&singlematch(uchar(*s),p,ep);\r\nswitch(*ep){\r\ncase'?':{\r\nconst char*res;\r\nif(m&&((res=match(ms,s+1,ep+1))!=NULL))\r\nreturn res;\r\np=ep+1;goto init;\r\n}\r\ncase'*':{\r\nreturn max_expand(ms,s,p,ep);\r\n}\r\ncase'+':{\r\nreturn(m?max_expand(ms,s+1,p,ep):NULL);\r\n}\r\ncase'-':{\r\nreturn min_expand(ms,s,p,ep);\r\n}\r\ndefault:{\r\nif(!m)return NULL;\r\ns++;p=ep;goto init;\r\n}\r\n}\r\n}\r\n}\r\n}\r\nstatic const char*lmemfind(const char*s1,size_t l1,\r\nconst char*s2,size_t l2){\r\nif(l2==0)return s1;\r\nelse if(l2>l1)return NULL;\r\nelse{\r\nconst char*init;\r\nl2--;\r\nl1=l1-l2;\r\nwhile(l1>0&&(init=(const char*)memchr(s1,*s2,l1))!=NULL){\r\ninit++;\r\nif(memcmp(init,s2+1,l2)==0)\r\nreturn init-1;\r\nelse{\r\nl1-=init-s1;\r\ns1=init;\r\n}\r\n}\r\nreturn NULL;\r\n}\r\n}\r\nstatic void push_onecapture(MatchState*ms,int i,const char*s,\r\nconst char*e){\r\nif(i>=ms->level){\r\nif(i==0)\r\nlua_pushlstring(ms->L,s,e-s);\r\nelse\r\nluaL_error(ms->L,\"invalid capture index\");\r\n}\r\nelse{\r\nptrdiff_t l=ms->capture[i].len;\r\nif(l==(-1))luaL_error(ms->L,\"unfinished capture\");\r\nif(l==(-2))\r\nlua_pushinteger(ms->L,ms->capture[i].init-ms->src_init+1);\r\nelse\r\nlua_pushlstring(ms->L,ms->capture[i].init,l);\r\n}\r\n}\r\nstatic int push_captures(MatchState*ms,const char*s,const char*e){\r\nint i;\r\nint nlevels=(ms->level==0&&s)?1:ms->level;\r\nluaL_checkstack(ms->L,nlevels,\"too many captures\");\r\nfor(i=0;i<nlevels;i++)\r\npush_onecapture(ms,i,s,e);\r\nreturn nlevels;\r\n}\r\nstatic int str_find_aux(lua_State*L,int find){\r\nsize_t l1,l2;\r\nconst char*s=luaL_checklstring(L,1,&l1);\r\nconst char*p=luaL_checklstring(L,2,&l2);\r\nptrdiff_t init=posrelat(luaL_optinteger(L,3,1),l1)-1;\r\nif(init<0)init=0;\r\nelse if((size_t)(init)>l1)init=(ptrdiff_t)l1;\r\nif(find&&(lua_toboolean(L,4)||\r\nstrpbrk(p,\"^$*+?.([%-\")==NULL)){\r\nconst char*s2=lmemfind(s+init,l1-init,p,l2);\r\nif(s2){\r\nlua_pushinteger(L,s2-s+1);\r\nlua_pushinteger(L,s2-s+l2);\r\nreturn 2;\r\n}\r\n}\r\nelse{\r\nMatchState ms;\r\nint anchor=(*p=='^')?(p++,1):0;\r\nconst char*s1=s+init;\r\nms.L=L;\r\nms.src_init=s;\r\nms.src_end=s+l1;\r\ndo{\r\nconst char*res;\r\nms.level=0;\r\nif((res=match(&ms,s1,p))!=NULL){\r\nif(find){\r\nlua_pushinteger(L,s1-s+1);\r\nlua_pushinteger(L,res-s);\r\nreturn push_captures(&ms,NULL,0)+2;\r\n}\r\nelse\r\nreturn push_captures(&ms,s1,res);\r\n}\r\n}while(s1++<ms.src_end&&!anchor);\r\n}\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\nstatic int str_find(lua_State*L){\r\nreturn str_find_aux(L,1);\r\n}\r\nstatic int str_match(lua_State*L){\r\nreturn str_find_aux(L,0);\r\n}\r\nstatic int gmatch_aux(lua_State*L){\r\nMatchState ms;\r\nsize_t ls;\r\nconst char*s=lua_tolstring(L,lua_upvalueindex(1),&ls);\r\nconst char*p=lua_tostring(L,lua_upvalueindex(2));\r\nconst char*src;\r\nms.L=L;\r\nms.src_init=s;\r\nms.src_end=s+ls;\r\nfor(src=s+(size_t)lua_tointeger(L,lua_upvalueindex(3));\r\nsrc<=ms.src_end;\r\nsrc++){\r\nconst char*e;\r\nms.level=0;\r\nif((e=match(&ms,src,p))!=NULL){\r\nlua_Integer newstart=e-s;\r\nif(e==src)newstart++;\r\nlua_pushinteger(L,newstart);\r\nlua_replace(L,lua_upvalueindex(3));\r\nreturn push_captures(&ms,src,e);\r\n}\r\n}\r\nreturn 0;\r\n}\r\nstatic int gmatch(lua_State*L){\r\nluaL_checkstring(L,1);\r\nluaL_checkstring(L,2);\r\nlua_settop(L,2);\r\nlua_pushinteger(L,0);\r\nlua_pushcclosure(L,gmatch_aux,3);\r\nreturn 1;\r\n}\r\nstatic void add_s(MatchState*ms,luaL_Buffer*b,const char*s,\r\nconst char*e){\r\nsize_t l,i;\r\nconst char*news=lua_tolstring(ms->L,3,&l);\r\nfor(i=0;i<l;i++){\r\nif(news[i]!='%')\r\nluaL_addchar(b,news[i]);\r\nelse{\r\ni++;\r\nif(!isdigit(uchar(news[i])))\r\nluaL_addchar(b,news[i]);\r\nelse if(news[i]=='0')\r\nluaL_addlstring(b,s,e-s);\r\nelse{\r\npush_onecapture(ms,news[i]-'1',s,e);\r\nluaL_addvalue(b);\r\n}\r\n}\r\n}\r\n}\r\nstatic void add_value(MatchState*ms,luaL_Buffer*b,const char*s,\r\nconst char*e){\r\nlua_State*L=ms->L;\r\nswitch(lua_type(L,3)){\r\ncase 3:\r\ncase 4:{\r\nadd_s(ms,b,s,e);\r\nreturn;\r\n}\r\ncase 6:{\r\nint n;\r\nlua_pushvalue(L,3);\r\nn=push_captures(ms,s,e);\r\nlua_call(L,n,1);\r\nbreak;\r\n}\r\ncase 5:{\r\npush_onecapture(ms,0,s,e);\r\nlua_gettable(L,3);\r\nbreak;\r\n}\r\n}\r\nif(!lua_toboolean(L,-1)){\r\nlua_pop(L,1);\r\nlua_pushlstring(L,s,e-s);\r\n}\r\nelse if(!lua_isstring(L,-1))\r\nluaL_error(L,\"invalid replacement value (a %s)\",luaL_typename(L,-1));\r\nluaL_addvalue(b);\r\n}\r\nstatic int str_gsub(lua_State*L){\r\nsize_t srcl;\r\nconst char*src=luaL_checklstring(L,1,&srcl);\r\nconst char*p=luaL_checkstring(L,2);\r\nint tr=lua_type(L,3);\r\nint max_s=luaL_optint(L,4,srcl+1);\r\nint anchor=(*p=='^')?(p++,1):0;\r\nint n=0;\r\nMatchState ms;\r\nluaL_Buffer b;\r\nluaL_argcheck(L,tr==3||tr==4||\r\ntr==6||tr==5,3,\r\n\"string/function/table expected\");\r\nluaL_buffinit(L,&b);\r\nms.L=L;\r\nms.src_init=src;\r\nms.src_end=src+srcl;\r\nwhile(n<max_s){\r\nconst char*e;\r\nms.level=0;\r\ne=match(&ms,src,p);\r\nif(e){\r\nn++;\r\nadd_value(&ms,&b,src,e);\r\n}\r\nif(e&&e>src)\r\nsrc=e;\r\nelse if(src<ms.src_end)\r\nluaL_addchar(&b,*src++);\r\nelse break;\r\nif(anchor)break;\r\n}\r\nluaL_addlstring(&b,src,ms.src_end-src);\r\nluaL_pushresult(&b);\r\nlua_pushinteger(L,n);\r\nreturn 2;\r\n}\r\nstatic void addquoted(lua_State*L,luaL_Buffer*b,int arg){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nluaL_addchar(b,'\"');\r\nwhile(l--){\r\nswitch(*s){\r\ncase'\"':case'\\\\':case'\\n':{\r\nluaL_addchar(b,'\\\\');\r\nluaL_addchar(b,*s);\r\nbreak;\r\n}\r\ncase'\\r':{\r\nluaL_addlstring(b,\"\\\\r\",2);\r\nbreak;\r\n}\r\ncase'\\0':{\r\nluaL_addlstring(b,\"\\\\000\",4);\r\nbreak;\r\n}\r\ndefault:{\r\nluaL_addchar(b,*s);\r\nbreak;\r\n}\r\n}\r\ns++;\r\n}\r\nluaL_addchar(b,'\"');\r\n}\r\nstatic const char*scanformat(lua_State*L,const char*strfrmt,char*form){\r\nconst char*p=strfrmt;\r\nwhile(*p!='\\0'&&strchr(\"-+ #0\",*p)!=NULL)p++;\r\nif((size_t)(p-strfrmt)>=sizeof(\"-+ #0\"))\r\nluaL_error(L,\"invalid format (repeated flags)\");\r\nif(isdigit(uchar(*p)))p++;\r\nif(isdigit(uchar(*p)))p++;\r\nif(*p=='.'){\r\np++;\r\nif(isdigit(uchar(*p)))p++;\r\nif(isdigit(uchar(*p)))p++;\r\n}\r\nif(isdigit(uchar(*p)))\r\nluaL_error(L,\"invalid format (width or precision too long)\");\r\n*(form++)='%';\r\nstrncpy(form,strfrmt,p-strfrmt+1);\r\nform+=p-strfrmt+1;\r\n*form='\\0';\r\nreturn p;\r\n}\r\nstatic void addintlen(char*form){\r\nsize_t l=strlen(form);\r\nchar spec=form[l-1];\r\nstrcpy(form+l-1,\"l\");\r\nform[l+sizeof(\"l\")-2]=spec;\r\nform[l+sizeof(\"l\")-1]='\\0';\r\n}\r\nstatic int str_format(lua_State*L){\r\nint top=lua_gettop(L);\r\nint arg=1;\r\nsize_t sfl;\r\nconst char*strfrmt=luaL_checklstring(L,arg,&sfl);\r\nconst char*strfrmt_end=strfrmt+sfl;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nwhile(strfrmt<strfrmt_end){\r\nif(*strfrmt!='%')\r\nluaL_addchar(&b,*strfrmt++);\r\nelse if(*++strfrmt=='%')\r\nluaL_addchar(&b,*strfrmt++);\r\nelse{\r\nchar form[(sizeof(\"-+ #0\")+sizeof(\"l\")+10)];\r\nchar buff[512];\r\nif(++arg>top)\r\nluaL_argerror(L,arg,\"no value\");\r\nstrfrmt=scanformat(L,strfrmt,form);\r\nswitch(*strfrmt++){\r\ncase'c':{\r\nsprintf(buff,form,(int)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'd':case'i':{\r\naddintlen(form);\r\nsprintf(buff,form,(long)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'o':case'u':case'x':case'X':{\r\naddintlen(form);\r\nsprintf(buff,form,(unsigned long)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'e':case'E':case'f':\r\ncase'g':case'G':{\r\nsprintf(buff,form,(double)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'q':{\r\naddquoted(L,&b,arg);\r\ncontinue;\r\n}\r\ncase's':{\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nif(!strchr(form,'.')&&l>=100){\r\nlua_pushvalue(L,arg);\r\nluaL_addvalue(&b);\r\ncontinue;\r\n}\r\nelse{\r\nsprintf(buff,form,s);\r\nbreak;\r\n}\r\n}\r\ndefault:{\r\nreturn luaL_error(L,\"invalid option \"LUA_QL(\"%%%c\")\" to \"\r\nLUA_QL(\"format\"),*(strfrmt-1));\r\n}\r\n}\r\nluaL_addlstring(&b,buff,strlen(buff));\r\n}\r\n}\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg strlib[]={\r\n{\"byte\",str_byte},\r\n{\"char\",str_char},\r\n{\"find\",str_find},\r\n{\"format\",str_format},\r\n{\"gmatch\",gmatch},\r\n{\"gsub\",str_gsub},\r\n{\"lower\",str_lower},\r\n{\"match\",str_match},\r\n{\"rep\",str_rep},\r\n{\"sub\",str_sub},\r\n{\"upper\",str_upper},\r\n{NULL,NULL}\r\n};\r\nstatic void createmetatable(lua_State*L){\r\nlua_createtable(L,0,1);\r\nlua_pushliteral(L,\"\");\r\nlua_pushvalue(L,-2);\r\nlua_setmetatable(L,-2);\r\nlua_pop(L,1);\r\nlua_pushvalue(L,-2);\r\nlua_setfield(L,-2,\"__index\");\r\nlua_pop(L,1);\r\n}\r\nstatic int luaopen_string(lua_State*L){\r\nluaL_register(L,\"string\",strlib);\r\ncreatemetatable(L);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg lualibs[]={\r\n{\"\",luaopen_base},\r\n{\"table\",luaopen_table},\r\n{\"io\",luaopen_io},\r\n{\"os\",luaopen_os},\r\n{\"string\",luaopen_string},\r\n{NULL,NULL}\r\n};\r\nstatic void luaL_openlibs(lua_State*L){\r\nconst luaL_Reg*lib=lualibs;\r\nfor(;lib->func;lib++){\r\nlua_pushcfunction(L,lib->func);\r\nlua_pushstring(L,lib->name);\r\nlua_call(L,1,0);\r\n}\r\n}\r\ntypedef unsigned int UB;\r\nstatic UB barg(lua_State*L,int idx){\r\nunion{lua_Number n;U64 b;}bn;\r\nbn.n=lua_tonumber(L,idx)+6755399441055744.0;\r\nif(bn.n==0.0&&!lua_isnumber(L,idx))luaL_typerror(L,idx,\"number\");\r\nreturn(UB)bn.b;\r\n}\r\n#define BRET(b)lua_pushnumber(L,(lua_Number)(int)(b));return 1;\r\nstatic int tobit(lua_State*L){\r\nBRET(barg(L,1))}\r\nstatic int bnot(lua_State*L){\r\nBRET(~barg(L,1))}\r\nstatic int band(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b&=barg(L,i);BRET(b)}\r\nstatic int bor(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b|=barg(L,i);BRET(b)}\r\nstatic int bxor(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b^=barg(L,i);BRET(b)}\r\nstatic int lshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b<<n)}\r\nstatic int rshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b>>n)}\r\nstatic int arshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((int)b>>n)}\r\nstatic int rol(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b<<n)|(b>>(32-n)))}\r\nstatic int ror(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b>>n)|(b<<(32-n)))}\r\nstatic int bswap(lua_State*L){\r\nUB b=barg(L,1);b=(b>>24)|((b>>8)&0xff00)|((b&0xff00)<<8)|(b<<24);BRET(b)}\r\nstatic int tohex(lua_State*L){\r\nUB b=barg(L,1);\r\nint n=lua_isnone(L,2)?8:(int)barg(L,2);\r\nconst char*hexdigits=\"0123456789abcdef\";\r\nchar buf[8];\r\nint i;\r\nif(n<0){n=-n;hexdigits=\"0123456789ABCDEF\";}\r\nif(n>8)n=8;\r\nfor(i=(int)n;--i>=0;){buf[i]=hexdigits[b&15];b>>=4;}\r\nlua_pushlstring(L,buf,(size_t)n);\r\nreturn 1;\r\n}\r\nstatic const struct luaL_Reg bitlib[]={\r\n{\"tobit\",tobit},\r\n{\"bnot\",bnot},\r\n{\"band\",band},\r\n{\"bor\",bor},\r\n{\"bxor\",bxor},\r\n{\"lshift\",lshift},\r\n{\"rshift\",rshift},\r\n{\"arshift\",arshift},\r\n{\"rol\",rol},\r\n{\"ror\",ror},\r\n{\"bswap\",bswap},\r\n{\"tohex\",tohex},\r\n{NULL,NULL}\r\n};\r\nint main(int argc,char**argv){\r\nlua_State*L=luaL_newstate();\r\nint i;\r\nluaL_openlibs(L);\r\nluaL_register(L,\"bit\",bitlib);\r\nif(argc<2)return sizeof(void*);\r\nlua_createtable(L,0,1);\r\nlua_pushstring(L,argv[1]);\r\nlua_rawseti(L,-2,0);\r\nlua_setglobal(L,\"arg\");\r\nif(luaL_loadfile(L,argv[1]))\r\ngoto err;\r\nfor(i=2;i<argc;i++)\r\nlua_pushstring(L,argv[i]);\r\nif(lua_pcall(L,argc-2,0,0)){\r\nerr:\r\nfprintf(stderr,\"Error: %s\\n\",lua_tostring(L,-1));\r\nreturn 1;\r\n}\r\nlua_close(L);\r\nreturn 0;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/bc.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT bytecode listing module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n--\n-- This module lists the bytecode of a Lua function. If it's loaded by -jbc\n-- it hooks into the parser and lists all functions of a chunk as they\n-- are parsed.\n--\n-- Example usage:\n--\n--   luajit -jbc -e 'local x=0; for i=1,1e6 do x=x+i end; print(x)'\n--   luajit -jbc=- foo.lua\n--   luajit -jbc=foo.list foo.lua\n--\n-- Default output is to stderr. To redirect the output to a file, pass a\n-- filename as an argument (use '-' for stdout) or set the environment\n-- variable LUAJIT_LISTFILE. The file is overwritten every time the module\n-- is started.\n--\n-- This module can also be used programmatically:\n--\n--   local bc = require(\"jit.bc\")\n--\n--   local function foo() print(\"hello\") end\n--\n--   bc.dump(foo)           --> -- BYTECODE -- [...]\n--   print(bc.line(foo, 2)) --> 0002    KSTR     1   1      ; \"hello\"\n--\n--   local out = {\n--     -- Do something with each line:\n--     write = function(t, ...) io.write(...) end,\n--     close = function(t) end,\n--     flush = function(t) end,\n--   }\n--   bc.dump(foo, out)\n--\n------------------------------------------------------------------------------\n\n-- Cache some library functions and objects.\nlocal jit = require(\"jit\")\nassert(jit.version_num == 20004, \"LuaJIT core/library version mismatch\")\nlocal jutil = require(\"jit.util\")\nlocal vmdef = require(\"jit.vmdef\")\nlocal bit = require(\"bit\")\nlocal sub, gsub, format = string.sub, string.gsub, string.format\nlocal byte, band, shr = string.byte, bit.band, bit.rshift\nlocal funcinfo, funcbc, funck = jutil.funcinfo, jutil.funcbc, jutil.funck\nlocal funcuvname = jutil.funcuvname\nlocal bcnames = vmdef.bcnames\nlocal stdout, stderr = io.stdout, io.stderr\n\n------------------------------------------------------------------------------\n\nlocal function ctlsub(c)\n  if c == \"\\n\" then return \"\\\\n\"\n  elseif c == \"\\r\" then return \"\\\\r\"\n  elseif c == \"\\t\" then return \"\\\\t\"\n  else return format(\"\\\\%03d\", byte(c))\n  end\nend\n\n-- Return one bytecode line.\nlocal function bcline(func, pc, prefix)\n  local ins, m = funcbc(func, pc)\n  if not ins then return end\n  local ma, mb, mc = band(m, 7), band(m, 15*8), band(m, 15*128)\n  local a = band(shr(ins, 8), 0xff)\n  local oidx = 6*band(ins, 0xff)\n  local op = sub(bcnames, oidx+1, oidx+6)\n  local s = format(\"%04d %s %-6s %3s \",\n    pc, prefix or \"  \", op, ma == 0 and \"\" or a)\n  local d = shr(ins, 16)\n  if mc == 13*128 then -- BCMjump\n    return format(\"%s=> %04d\\n\", s, pc+d-0x7fff)\n  end\n  if mb ~= 0 then\n    d = band(d, 0xff)\n  elseif mc == 0 then\n    return s..\"\\n\"\n  end\n  local kc\n  if mc == 10*128 then -- BCMstr\n    kc = funck(func, -d-1)\n    kc = format(#kc > 40 and '\"%.40s\"~' or '\"%s\"', gsub(kc, \"%c\", ctlsub))\n  elseif mc == 9*128 then -- BCMnum\n    kc = funck(func, d)\n    if op == \"TSETM \" then kc = kc - 2^52 end\n  elseif mc == 12*128 then -- BCMfunc\n    local fi = funcinfo(funck(func, -d-1))\n    if fi.ffid then\n      kc = vmdef.ffnames[fi.ffid]\n    else\n      kc = fi.loc\n    end\n  elseif mc == 5*128 then -- BCMuv\n    kc = funcuvname(func, d)\n  end\n  if ma == 5 then -- BCMuv\n    local ka = funcuvname(func, a)\n    if kc then kc = ka..\" ; \"..kc else kc = ka end\n  end\n  if mb ~= 0 then\n    local b = shr(ins, 24)\n    if kc then return format(\"%s%3d %3d  ; %s\\n\", s, b, d, kc) end\n    return format(\"%s%3d %3d\\n\", s, b, d)\n  end\n  if kc then return format(\"%s%3d      ; %s\\n\", s, d, kc) end\n  if mc == 7*128 and d > 32767 then d = d - 65536 end -- BCMlits\n  return format(\"%s%3d\\n\", s, d)\nend\n\n-- Collect branch targets of a function.\nlocal function bctargets(func)\n  local target = {}\n  for pc=1,1000000000 do\n    local ins, m = funcbc(func, pc)\n    if not ins then break end\n    if band(m, 15*128) == 13*128 then target[pc+shr(ins, 16)-0x7fff] = true end\n  end\n  return target\nend\n\n-- Dump bytecode instructions of a function.\nlocal function bcdump(func, out, all)\n  if not out then out = stdout end\n  local fi = funcinfo(func)\n  if all and fi.children then\n    for n=-1,-1000000000,-1 do\n      local k = funck(func, n)\n      if not k then break end\n      if type(k) == \"proto\" then bcdump(k, out, true) end\n    end\n  end\n  out:write(format(\"-- BYTECODE -- %s-%d\\n\", fi.loc, fi.lastlinedefined))\n  local target = bctargets(func)\n  for pc=1,1000000000 do\n    local s = bcline(func, pc, target[pc] and \"=>\")\n    if not s then break end\n    out:write(s)\n  end\n  out:write(\"\\n\")\n  out:flush()\nend\n\n------------------------------------------------------------------------------\n\n-- Active flag and output file handle.\nlocal active, out\n\n-- List handler.\nlocal function h_list(func)\n  return bcdump(func, out)\nend\n\n-- Detach list handler.\nlocal function bclistoff()\n  if active then\n    active = false\n    jit.attach(h_list)\n    if out and out ~= stdout and out ~= stderr then out:close() end\n    out = nil\n  end\nend\n\n-- Open the output file and attach list handler.\nlocal function bcliston(outfile)\n  if active then bclistoff() end\n  if not outfile then outfile = os.getenv(\"LUAJIT_LISTFILE\") end\n  if outfile then\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\n  else\n    out = stderr\n  end\n  jit.attach(h_list, \"bc\")\n  active = true\nend\n\n-- Public module functions.\nmodule(...)\n\nline = bcline\ndump = bcdump\ntargets = bctargets\n\non = bcliston\noff = bclistoff\nstart = bcliston -- For -j command line option.\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/bcsave.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT module to save/list bytecode.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n--\n-- This module saves or lists the bytecode for an input file.\n-- It's run by the -b command line option.\n--\n------------------------------------------------------------------------------\n\nlocal jit = require(\"jit\")\nassert(jit.version_num == 20004, \"LuaJIT core/library version mismatch\")\nlocal bit = require(\"bit\")\n\n-- Symbol name prefix for LuaJIT bytecode.\nlocal LJBC_PREFIX = \"luaJIT_BC_\"\n\n------------------------------------------------------------------------------\n\nlocal function usage()\n  io.stderr:write[[\nSave LuaJIT bytecode: luajit -b[options] input output\n  -l        Only list bytecode.\n  -s        Strip debug info (default).\n  -g        Keep debug info.\n  -n name   Set module name (default: auto-detect from input name).\n  -t type   Set output file type (default: auto-detect from output name).\n  -a arch   Override architecture for object files (default: native).\n  -o os     Override OS for object files (default: native).\n  -e chunk  Use chunk string as input.\n  --        Stop handling options.\n  -         Use stdin as input and/or stdout as output.\n\nFile types: c h obj o raw (default)\n]]\n  os.exit(1)\nend\n\nlocal function check(ok, ...)\n  if ok then return ok, ... end\n  io.stderr:write(\"luajit: \", ...)\n  io.stderr:write(\"\\n\")\n  os.exit(1)\nend\n\nlocal function readfile(input)\n  if type(input) == \"function\" then return input end\n  if input == \"-\" then input = nil end\n  return check(loadfile(input))\nend\n\nlocal function savefile(name, mode)\n  if name == \"-\" then return io.stdout end\n  return check(io.open(name, mode))\nend\n\n------------------------------------------------------------------------------\n\nlocal map_type = {\n  raw = \"raw\", c = \"c\", h = \"h\", o = \"obj\", obj = \"obj\",\n}\n\nlocal map_arch = {\n  x86 = true, x64 = true, arm = true, ppc = true, ppcspe = true,\n  mips = true, mipsel = true,\n}\n\nlocal map_os = {\n  linux = true, windows = true, osx = true, freebsd = true, netbsd = true,\n  openbsd = true, dragonfly = true, solaris = true,\n}\n\nlocal function checkarg(str, map, err)\n  str = string.lower(str)\n  local s = check(map[str], \"unknown \", err)\n  return s == true and str or s\nend\n\nlocal function detecttype(str)\n  local ext = string.match(string.lower(str), \"%.(%a+)$\")\n  return map_type[ext] or \"raw\"\nend\n\nlocal function checkmodname(str)\n  check(string.match(str, \"^[%w_.%-]+$\"), \"bad module name\")\n  return string.gsub(str, \"[%.%-]\", \"_\")\nend\n\nlocal function detectmodname(str)\n  if type(str) == \"string\" then\n    local tail = string.match(str, \"[^/\\\\]+$\")\n    if tail then str = tail end\n    local head = string.match(str, \"^(.*)%.[^.]*$\")\n    if head then str = head end\n    str = string.match(str, \"^[%w_.%-]+\")\n  else\n    str = nil\n  end\n  check(str, \"cannot derive module name, use -n name\")\n  return string.gsub(str, \"[%.%-]\", \"_\")\nend\n\n------------------------------------------------------------------------------\n\nlocal function bcsave_tail(fp, output, s)\n  local ok, err = fp:write(s)\n  if ok and output ~= \"-\" then ok, err = fp:close() end\n  check(ok, \"cannot write \", output, \": \", err)\nend\n\nlocal function bcsave_raw(output, s)\n  local fp = savefile(output, \"wb\")\n  bcsave_tail(fp, output, s)\nend\n\nlocal function bcsave_c(ctx, output, s)\n  local fp = savefile(output, \"w\")\n  if ctx.type == \"c\" then\n    fp:write(string.format([[\n#ifdef _cplusplus\nextern \"C\"\n#endif\n#ifdef _WIN32\n__declspec(dllexport)\n#endif\nconst char %s%s[] = {\n]], LJBC_PREFIX, ctx.modname))\n  else\n    fp:write(string.format([[\n#define %s%s_SIZE %d\nstatic const char %s%s[] = {\n]], LJBC_PREFIX, ctx.modname, #s, LJBC_PREFIX, ctx.modname))\n  end\n  local t, n, m = {}, 0, 0\n  for i=1,#s do\n    local b = tostring(string.byte(s, i))\n    m = m + #b + 1\n    if m > 78 then\n      fp:write(table.concat(t, \",\", 1, n), \",\\n\")\n      n, m = 0, #b + 1\n    end\n    n = n + 1\n    t[n] = b\n  end\n  bcsave_tail(fp, output, table.concat(t, \",\", 1, n)..\"\\n};\\n\")\nend\n\nlocal function bcsave_elfobj(ctx, output, s, ffi)\n  ffi.cdef[[\ntypedef struct {\n  uint8_t emagic[4], eclass, eendian, eversion, eosabi, eabiversion, epad[7];\n  uint16_t type, machine;\n  uint32_t version;\n  uint32_t entry, phofs, shofs;\n  uint32_t flags;\n  uint16_t ehsize, phentsize, phnum, shentsize, shnum, shstridx;\n} ELF32header;\ntypedef struct {\n  uint8_t emagic[4], eclass, eendian, eversion, eosabi, eabiversion, epad[7];\n  uint16_t type, machine;\n  uint32_t version;\n  uint64_t entry, phofs, shofs;\n  uint32_t flags;\n  uint16_t ehsize, phentsize, phnum, shentsize, shnum, shstridx;\n} ELF64header;\ntypedef struct {\n  uint32_t name, type, flags, addr, ofs, size, link, info, align, entsize;\n} ELF32sectheader;\ntypedef struct {\n  uint32_t name, type;\n  uint64_t flags, addr, ofs, size;\n  uint32_t link, info;\n  uint64_t align, entsize;\n} ELF64sectheader;\ntypedef struct {\n  uint32_t name, value, size;\n  uint8_t info, other;\n  uint16_t sectidx;\n} ELF32symbol;\ntypedef struct {\n  uint32_t name;\n  uint8_t info, other;\n  uint16_t sectidx;\n  uint64_t value, size;\n} ELF64symbol;\ntypedef struct {\n  ELF32header hdr;\n  ELF32sectheader sect[6];\n  ELF32symbol sym[2];\n  uint8_t space[4096];\n} ELF32obj;\ntypedef struct {\n  ELF64header hdr;\n  ELF64sectheader sect[6];\n  ELF64symbol sym[2];\n  uint8_t space[4096];\n} ELF64obj;\n]]\n  local symname = LJBC_PREFIX..ctx.modname\n  local is64, isbe = false, false\n  if ctx.arch == \"x64\" then\n    is64 = true\n  elseif ctx.arch == \"ppc\" or ctx.arch == \"ppcspe\" or ctx.arch == \"mips\" then\n    isbe = true\n  end\n\n  -- Handle different host/target endianess.\n  local function f32(x) return x end\n  local f16, fofs = f32, f32\n  if ffi.abi(\"be\") ~= isbe then\n    f32 = bit.bswap\n    function f16(x) return bit.rshift(bit.bswap(x), 16) end\n    if is64 then\n      local two32 = ffi.cast(\"int64_t\", 2^32)\n      function fofs(x) return bit.bswap(x)*two32 end\n    else\n      fofs = f32\n    end\n  end\n\n  -- Create ELF object and fill in header.\n  local o = ffi.new(is64 and \"ELF64obj\" or \"ELF32obj\")\n  local hdr = o.hdr\n  if ctx.os == \"bsd\" or ctx.os == \"other\" then -- Determine native hdr.eosabi.\n    local bf = assert(io.open(\"/bin/ls\", \"rb\"))\n    local bs = bf:read(9)\n    bf:close()\n    ffi.copy(o, bs, 9)\n    check(hdr.emagic[0] == 127, \"no support for writing native object files\")\n  else\n    hdr.emagic = \"\\127ELF\"\n    hdr.eosabi = ({ freebsd=9, netbsd=2, openbsd=12, solaris=6 })[ctx.os] or 0\n  end\n  hdr.eclass = is64 and 2 or 1\n  hdr.eendian = isbe and 2 or 1\n  hdr.eversion = 1\n  hdr.type = f16(1)\n  hdr.machine = f16(({ x86=3, x64=62, arm=40, ppc=20, ppcspe=20, mips=8, mipsel=8 })[ctx.arch])\n  if ctx.arch == \"mips\" or ctx.arch == \"mipsel\" then\n    hdr.flags = 0x50001006\n  end\n  hdr.version = f32(1)\n  hdr.shofs = fofs(ffi.offsetof(o, \"sect\"))\n  hdr.ehsize = f16(ffi.sizeof(hdr))\n  hdr.shentsize = f16(ffi.sizeof(o.sect[0]))\n  hdr.shnum = f16(6)\n  hdr.shstridx = f16(2)\n\n  -- Fill in sections and symbols.\n  local sofs, ofs = ffi.offsetof(o, \"space\"), 1\n  for i,name in ipairs{\n      \".symtab\", \".shstrtab\", \".strtab\", \".rodata\", \".note.GNU-stack\",\n    } do\n    local sect = o.sect[i]\n    sect.align = fofs(1)\n    sect.name = f32(ofs)\n    ffi.copy(o.space+ofs, name)\n    ofs = ofs + #name+1\n  end\n  o.sect[1].type = f32(2) -- .symtab\n  o.sect[1].link = f32(3)\n  o.sect[1].info = f32(1)\n  o.sect[1].align = fofs(8)\n  o.sect[1].ofs = fofs(ffi.offsetof(o, \"sym\"))\n  o.sect[1].entsize = fofs(ffi.sizeof(o.sym[0]))\n  o.sect[1].size = fofs(ffi.sizeof(o.sym))\n  o.sym[1].name = f32(1)\n  o.sym[1].sectidx = f16(4)\n  o.sym[1].size = fofs(#s)\n  o.sym[1].info = 17\n  o.sect[2].type = f32(3) -- .shstrtab\n  o.sect[2].ofs = fofs(sofs)\n  o.sect[2].size = fofs(ofs)\n  o.sect[3].type = f32(3) -- .strtab\n  o.sect[3].ofs = fofs(sofs + ofs)\n  o.sect[3].size = fofs(#symname+1)\n  ffi.copy(o.space+ofs+1, symname)\n  ofs = ofs + #symname + 2\n  o.sect[4].type = f32(1) -- .rodata\n  o.sect[4].flags = fofs(2)\n  o.sect[4].ofs = fofs(sofs + ofs)\n  o.sect[4].size = fofs(#s)\n  o.sect[5].type = f32(1) -- .note.GNU-stack\n  o.sect[5].ofs = fofs(sofs + ofs + #s)\n\n  -- Write ELF object file.\n  local fp = savefile(output, \"wb\")\n  fp:write(ffi.string(o, ffi.sizeof(o)-4096+ofs))\n  bcsave_tail(fp, output, s)\nend\n\nlocal function bcsave_peobj(ctx, output, s, ffi)\n  ffi.cdef[[\ntypedef struct {\n  uint16_t arch, nsects;\n  uint32_t time, symtabofs, nsyms;\n  uint16_t opthdrsz, flags;\n} PEheader;\ntypedef struct {\n  char name[8];\n  uint32_t vsize, vaddr, size, ofs, relocofs, lineofs;\n  uint16_t nreloc, nline;\n  uint32_t flags;\n} PEsection;\ntypedef struct __attribute((packed)) {\n  union {\n    char name[8];\n    uint32_t nameref[2];\n  };\n  uint32_t value;\n  int16_t sect;\n  uint16_t type;\n  uint8_t scl, naux;\n} PEsym;\ntypedef struct __attribute((packed)) {\n  uint32_t size;\n  uint16_t nreloc, nline;\n  uint32_t cksum;\n  uint16_t assoc;\n  uint8_t comdatsel, unused[3];\n} PEsymaux;\ntypedef struct {\n  PEheader hdr;\n  PEsection sect[2];\n  // Must be an even number of symbol structs.\n  PEsym sym0;\n  PEsymaux sym0aux;\n  PEsym sym1;\n  PEsymaux sym1aux;\n  PEsym sym2;\n  PEsym sym3;\n  uint32_t strtabsize;\n  uint8_t space[4096];\n} PEobj;\n]]\n  local symname = LJBC_PREFIX..ctx.modname\n  local is64 = false\n  if ctx.arch == \"x86\" then\n    symname = \"_\"..symname\n  elseif ctx.arch == \"x64\" then\n    is64 = true\n  end\n  local symexport = \"   /EXPORT:\"..symname..\",DATA \"\n\n  -- The file format is always little-endian. Swap if the host is big-endian.\n  local function f32(x) return x end\n  local f16 = f32\n  if ffi.abi(\"be\") then\n    f32 = bit.bswap\n    function f16(x) return bit.rshift(bit.bswap(x), 16) end\n  end\n\n  -- Create PE object and fill in header.\n  local o = ffi.new(\"PEobj\")\n  local hdr = o.hdr\n  hdr.arch = f16(({ x86=0x14c, x64=0x8664, arm=0x1c0, ppc=0x1f2, mips=0x366, mipsel=0x366 })[ctx.arch])\n  hdr.nsects = f16(2)\n  hdr.symtabofs = f32(ffi.offsetof(o, \"sym0\"))\n  hdr.nsyms = f32(6)\n\n  -- Fill in sections and symbols.\n  o.sect[0].name = \".drectve\"\n  o.sect[0].size = f32(#symexport)\n  o.sect[0].flags = f32(0x00100a00)\n  o.sym0.sect = f16(1)\n  o.sym0.scl = 3\n  o.sym0.name = \".drectve\"\n  o.sym0.naux = 1\n  o.sym0aux.size = f32(#symexport)\n  o.sect[1].name = \".rdata\"\n  o.sect[1].size = f32(#s)\n  o.sect[1].flags = f32(0x40300040)\n  o.sym1.sect = f16(2)\n  o.sym1.scl = 3\n  o.sym1.name = \".rdata\"\n  o.sym1.naux = 1\n  o.sym1aux.size = f32(#s)\n  o.sym2.sect = f16(2)\n  o.sym2.scl = 2\n  o.sym2.nameref[1] = f32(4)\n  o.sym3.sect = f16(-1)\n  o.sym3.scl = 2\n  o.sym3.value = f32(1)\n  o.sym3.name = \"@feat.00\" -- Mark as SafeSEH compliant.\n  ffi.copy(o.space, symname)\n  local ofs = #symname + 1\n  o.strtabsize = f32(ofs + 4)\n  o.sect[0].ofs = f32(ffi.offsetof(o, \"space\") + ofs)\n  ffi.copy(o.space + ofs, symexport)\n  ofs = ofs + #symexport\n  o.sect[1].ofs = f32(ffi.offsetof(o, \"space\") + ofs)\n\n  -- Write PE object file.\n  local fp = savefile(output, \"wb\")\n  fp:write(ffi.string(o, ffi.sizeof(o)-4096+ofs))\n  bcsave_tail(fp, output, s)\nend\n\nlocal function bcsave_machobj(ctx, output, s, ffi)\n  ffi.cdef[[\ntypedef struct\n{\n  uint32_t magic, cputype, cpusubtype, filetype, ncmds, sizeofcmds, flags;\n} mach_header;\ntypedef struct\n{\n  mach_header; uint32_t reserved;\n} mach_header_64;\ntypedef struct {\n  uint32_t cmd, cmdsize;\n  char segname[16];\n  uint32_t vmaddr, vmsize, fileoff, filesize;\n  uint32_t maxprot, initprot, nsects, flags;\n} mach_segment_command;\ntypedef struct {\n  uint32_t cmd, cmdsize;\n  char segname[16];\n  uint64_t vmaddr, vmsize, fileoff, filesize;\n  uint32_t maxprot, initprot, nsects, flags;\n} mach_segment_command_64;\ntypedef struct {\n  char sectname[16], segname[16];\n  uint32_t addr, size;\n  uint32_t offset, align, reloff, nreloc, flags;\n  uint32_t reserved1, reserved2;\n} mach_section;\ntypedef struct {\n  char sectname[16], segname[16];\n  uint64_t addr, size;\n  uint32_t offset, align, reloff, nreloc, flags;\n  uint32_t reserved1, reserved2, reserved3;\n} mach_section_64;\ntypedef struct {\n  uint32_t cmd, cmdsize, symoff, nsyms, stroff, strsize;\n} mach_symtab_command;\ntypedef struct {\n  int32_t strx;\n  uint8_t type, sect;\n  int16_t desc;\n  uint32_t value;\n} mach_nlist;\ntypedef struct {\n  uint32_t strx;\n  uint8_t type, sect;\n  uint16_t desc;\n  uint64_t value;\n} mach_nlist_64;\ntypedef struct\n{\n  uint32_t magic, nfat_arch;\n} mach_fat_header;\ntypedef struct\n{\n  uint32_t cputype, cpusubtype, offset, size, align;\n} mach_fat_arch;\ntypedef struct {\n  struct {\n    mach_header hdr;\n    mach_segment_command seg;\n    mach_section sec;\n    mach_symtab_command sym;\n  } arch[1];\n  mach_nlist sym_entry;\n  uint8_t space[4096];\n} mach_obj;\ntypedef struct {\n  struct {\n    mach_header_64 hdr;\n    mach_segment_command_64 seg;\n    mach_section_64 sec;\n    mach_symtab_command sym;\n  } arch[1];\n  mach_nlist_64 sym_entry;\n  uint8_t space[4096];\n} mach_obj_64;\ntypedef struct {\n  mach_fat_header fat;\n  mach_fat_arch fat_arch[4];\n  struct {\n    mach_header hdr;\n    mach_segment_command seg;\n    mach_section sec;\n    mach_symtab_command sym;\n  } arch[4];\n  mach_nlist sym_entry;\n  uint8_t space[4096];\n} mach_fat_obj;\n]]\n  local symname = '_'..LJBC_PREFIX..ctx.modname\n  local isfat, is64, align, mobj = false, false, 4, \"mach_obj\"\n  if ctx.arch == \"x64\" then\n    is64, align, mobj = true, 8, \"mach_obj_64\"\n  elseif ctx.arch == \"arm\" then\n    isfat, mobj = true, \"mach_fat_obj\"\n  else\n    check(ctx.arch == \"x86\", \"unsupported architecture for OSX\")\n  end\n  local function aligned(v, a) return bit.band(v+a-1, -a) end\n  local be32 = bit.bswap -- Mach-O FAT is BE, supported archs are LE.\n\n  -- Create Mach-O object and fill in header.\n  local o = ffi.new(mobj)\n  local mach_size = aligned(ffi.offsetof(o, \"space\")+#symname+2, align)\n  local cputype = ({ x86={7}, x64={0x01000007}, arm={7,12,12,12} })[ctx.arch]\n  local cpusubtype = ({ x86={3}, x64={3}, arm={3,6,9,11} })[ctx.arch]\n  if isfat then\n    o.fat.magic = be32(0xcafebabe)\n    o.fat.nfat_arch = be32(#cpusubtype)\n  end\n\n  -- Fill in sections and symbols.\n  for i=0,#cpusubtype-1 do\n    local ofs = 0\n    if isfat then\n      local a = o.fat_arch[i]\n      a.cputype = be32(cputype[i+1])\n      a.cpusubtype = be32(cpusubtype[i+1])\n      -- Subsequent slices overlap each other to share data.\n      ofs = ffi.offsetof(o, \"arch\") + i*ffi.sizeof(o.arch[0])\n      a.offset = be32(ofs)\n      a.size = be32(mach_size-ofs+#s)\n    end\n    local a = o.arch[i]\n    a.hdr.magic = is64 and 0xfeedfacf or 0xfeedface\n    a.hdr.cputype = cputype[i+1]\n    a.hdr.cpusubtype = cpusubtype[i+1]\n    a.hdr.filetype = 1\n    a.hdr.ncmds = 2\n    a.hdr.sizeofcmds = ffi.sizeof(a.seg)+ffi.sizeof(a.sec)+ffi.sizeof(a.sym)\n    a.seg.cmd = is64 and 0x19 or 0x1\n    a.seg.cmdsize = ffi.sizeof(a.seg)+ffi.sizeof(a.sec)\n    a.seg.vmsize = #s\n    a.seg.fileoff = mach_size-ofs\n    a.seg.filesize = #s\n    a.seg.maxprot = 1\n    a.seg.initprot = 1\n    a.seg.nsects = 1\n    ffi.copy(a.sec.sectname, \"__data\")\n    ffi.copy(a.sec.segname, \"__DATA\")\n    a.sec.size = #s\n    a.sec.offset = mach_size-ofs\n    a.sym.cmd = 2\n    a.sym.cmdsize = ffi.sizeof(a.sym)\n    a.sym.symoff = ffi.offsetof(o, \"sym_entry\")-ofs\n    a.sym.nsyms = 1\n    a.sym.stroff = ffi.offsetof(o, \"sym_entry\")+ffi.sizeof(o.sym_entry)-ofs\n    a.sym.strsize = aligned(#symname+2, align)\n  end\n  o.sym_entry.type = 0xf\n  o.sym_entry.sect = 1\n  o.sym_entry.strx = 1\n  ffi.copy(o.space+1, symname)\n\n  -- Write Macho-O object file.\n  local fp = savefile(output, \"wb\")\n  fp:write(ffi.string(o, mach_size))\n  bcsave_tail(fp, output, s)\nend\n\nlocal function bcsave_obj(ctx, output, s)\n  local ok, ffi = pcall(require, \"ffi\")\n  check(ok, \"FFI library required to write this file type\")\n  if ctx.os == \"windows\" then\n    return bcsave_peobj(ctx, output, s, ffi)\n  elseif ctx.os == \"osx\" then\n    return bcsave_machobj(ctx, output, s, ffi)\n  else\n    return bcsave_elfobj(ctx, output, s, ffi)\n  end\nend\n\n------------------------------------------------------------------------------\n\nlocal function bclist(input, output)\n  local f = readfile(input)\n  require(\"jit.bc\").dump(f, savefile(output, \"w\"), true)\nend\n\nlocal function bcsave(ctx, input, output)\n  local f = readfile(input)\n  local s = string.dump(f, ctx.strip)\n  local t = ctx.type\n  if not t then\n    t = detecttype(output)\n    ctx.type = t\n  end\n  if t == \"raw\" then\n    bcsave_raw(output, s)\n  else\n    if not ctx.modname then ctx.modname = detectmodname(input) end\n    if t == \"obj\" then\n      bcsave_obj(ctx, output, s)\n    else\n      bcsave_c(ctx, output, s)\n    end\n  end\nend\n\nlocal function docmd(...)\n  local arg = {...}\n  local n = 1\n  local list = false\n  local ctx = {\n    strip = true, arch = jit.arch, os = string.lower(jit.os),\n    type = false, modname = false,\n  }\n  while n <= #arg do\n    local a = arg[n]\n    if type(a) == \"string\" and string.sub(a, 1, 1) == \"-\" and a ~= \"-\" then\n      table.remove(arg, n)\n      if a == \"--\" then break end\n      for m=2,#a do\n\tlocal opt = string.sub(a, m, m)\n\tif opt == \"l\" then\n\t  list = true\n\telseif opt == \"s\" then\n\t  ctx.strip = true\n\telseif opt == \"g\" then\n\t  ctx.strip = false\n\telse\n\t  if arg[n] == nil or m ~= #a then usage() end\n\t  if opt == \"e\" then\n\t    if n ~= 1 then usage() end\n\t    arg[1] = check(loadstring(arg[1]))\n\t  elseif opt == \"n\" then\n\t    ctx.modname = checkmodname(table.remove(arg, n))\n\t  elseif opt == \"t\" then\n\t    ctx.type = checkarg(table.remove(arg, n), map_type, \"file type\")\n\t  elseif opt == \"a\" then\n\t    ctx.arch = checkarg(table.remove(arg, n), map_arch, \"architecture\")\n\t  elseif opt == \"o\" then\n\t    ctx.os = checkarg(table.remove(arg, n), map_os, \"OS name\")\n\t  else\n\t    usage()\n\t  end\n\tend\n      end\n    else\n      n = n + 1\n    end\n  end\n  if list then\n    if #arg == 0 or #arg > 2 then usage() end\n    bclist(arg[1], arg[2] or \"-\")\n  else\n    if #arg ~= 2 then usage() end\n    bcsave(ctx, arg[1], arg[2])\n  end\nend\n\n------------------------------------------------------------------------------\n\n-- Public module functions.\nmodule(...)\n\nstart = docmd -- Process -b command line option.\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_arm.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT ARM disassembler module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This is a helper module used by the LuaJIT machine code dumper module.\n--\n-- It disassembles most user-mode ARMv7 instructions\n-- NYI: Advanced SIMD and VFP instructions.\n------------------------------------------------------------------------------\n\nlocal type = type\nlocal sub, byte, format = string.sub, string.byte, string.format\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\nlocal concat = table.concat\nlocal bit = require(\"bit\")\nlocal band, bor, ror, tohex = bit.band, bit.bor, bit.ror, bit.tohex\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\n\n------------------------------------------------------------------------------\n-- Opcode maps\n------------------------------------------------------------------------------\n\nlocal map_loadc = {\n  shift = 8, mask = 15,\n  [10] = {\n    shift = 20, mask = 1,\n    [0] = {\n      shift = 23, mask = 3,\n      [0] = \"vmovFmDN\", \"vstmFNdr\",\n      _ = {\n\tshift = 21, mask = 1,\n\t[0] = \"vstrFdl\",\n\t{ shift = 16, mask = 15, [13] = \"vpushFdr\", _ = \"vstmdbFNdr\", }\n      },\n    },\n    {\n      shift = 23, mask = 3,\n      [0] = \"vmovFDNm\",\n      { shift = 16, mask = 15, [13] = \"vpopFdr\", _ = \"vldmFNdr\", },\n      _ = {\n\tshift = 21, mask = 1,\n\t[0] = \"vldrFdl\", \"vldmdbFNdr\",\n      },\n    },\n  },\n  [11] = {\n    shift = 20, mask = 1,\n    [0] = {\n      shift = 23, mask = 3,\n      [0] = \"vmovGmDN\", \"vstmGNdr\",\n      _ = {\n\tshift = 21, mask = 1,\n\t[0] = \"vstrGdl\",\n\t{ shift = 16, mask = 15, [13] = \"vpushGdr\", _ = \"vstmdbGNdr\", }\n      },\n    },\n    {\n      shift = 23, mask = 3,\n      [0] = \"vmovGDNm\",\n      { shift = 16, mask = 15, [13] = \"vpopGdr\", _ = \"vldmGNdr\", },\n      _ = {\n\tshift = 21, mask = 1,\n\t[0] = \"vldrGdl\", \"vldmdbGNdr\",\n      },\n    },\n  },\n  _ = {\n    shift = 0, mask = 0 -- NYI ldc, mcrr, mrrc.\n  },\n}\n\nlocal map_vfps = {\n  shift = 6, mask = 0x2c001,\n  [0] = \"vmlaF.dnm\", \"vmlsF.dnm\",\n  [0x04000] = \"vnmlsF.dnm\", [0x04001] = \"vnmlaF.dnm\",\n  [0x08000] = \"vmulF.dnm\", [0x08001] = \"vnmulF.dnm\",\n  [0x0c000] = \"vaddF.dnm\", [0x0c001] = \"vsubF.dnm\",\n  [0x20000] = \"vdivF.dnm\",\n  [0x24000] = \"vfnmsF.dnm\", [0x24001] = \"vfnmaF.dnm\",\n  [0x28000] = \"vfmaF.dnm\", [0x28001] = \"vfmsF.dnm\",\n  [0x2c000] = \"vmovF.dY\",\n  [0x2c001] = {\n    shift = 7, mask = 0x1e01,\n    [0] = \"vmovF.dm\", \"vabsF.dm\",\n    [0x0200] = \"vnegF.dm\", [0x0201] = \"vsqrtF.dm\",\n    [0x0800] = \"vcmpF.dm\", [0x0801] = \"vcmpeF.dm\",\n    [0x0a00] = \"vcmpzF.d\", [0x0a01] = \"vcmpzeF.d\",\n    [0x0e01] = \"vcvtG.dF.m\",\n    [0x1000] = \"vcvt.f32.u32Fdm\", [0x1001] = \"vcvt.f32.s32Fdm\",\n    [0x1800] = \"vcvtr.u32F.dm\", [0x1801] = \"vcvt.u32F.dm\",\n    [0x1a00] = \"vcvtr.s32F.dm\", [0x1a01] = \"vcvt.s32F.dm\",\n  },\n}\n\nlocal map_vfpd = {\n  shift = 6, mask = 0x2c001,\n  [0] = \"vmlaG.dnm\", \"vmlsG.dnm\",\n  [0x04000] = \"vnmlsG.dnm\", [0x04001] = \"vnmlaG.dnm\",\n  [0x08000] = \"vmulG.dnm\", [0x08001] = \"vnmulG.dnm\",\n  [0x0c000] = \"vaddG.dnm\", [0x0c001] = \"vsubG.dnm\",\n  [0x20000] = \"vdivG.dnm\",\n  [0x24000] = \"vfnmsG.dnm\", [0x24001] = \"vfnmaG.dnm\",\n  [0x28000] = \"vfmaG.dnm\", [0x28001] = \"vfmsG.dnm\",\n  [0x2c000] = \"vmovG.dY\",\n  [0x2c001] = {\n    shift = 7, mask = 0x1e01,\n    [0] = \"vmovG.dm\", \"vabsG.dm\",\n    [0x0200] = \"vnegG.dm\", [0x0201] = \"vsqrtG.dm\",\n    [0x0800] = \"vcmpG.dm\", [0x0801] = \"vcmpeG.dm\",\n    [0x0a00] = \"vcmpzG.d\", [0x0a01] = \"vcmpzeG.d\",\n    [0x0e01] = \"vcvtF.dG.m\",\n    [0x1000] = \"vcvt.f64.u32GdFm\", [0x1001] = \"vcvt.f64.s32GdFm\",\n    [0x1800] = \"vcvtr.u32FdG.m\", [0x1801] = \"vcvt.u32FdG.m\",\n    [0x1a00] = \"vcvtr.s32FdG.m\", [0x1a01] = \"vcvt.s32FdG.m\",\n  },\n}\n\nlocal map_datac = {\n  shift = 24, mask = 1,\n  [0] = {\n    shift = 4, mask = 1,\n    [0] = {\n      shift = 8, mask = 15,\n      [10] = map_vfps,\n      [11] = map_vfpd,\n      -- NYI cdp, mcr, mrc.\n    },\n    {\n      shift = 8, mask = 15,\n      [10] = {\n\tshift = 20, mask = 15,\n\t[0] = \"vmovFnD\", \"vmovFDn\",\n\t[14] = \"vmsrD\",\n\t[15] = { shift = 12, mask = 15, [15] = \"vmrs\", _ = \"vmrsD\", },\n      },\n    },\n  },\n  \"svcT\",\n}\n\nlocal map_loadcu = {\n  shift = 0, mask = 0, -- NYI unconditional CP load/store.\n}\n\nlocal map_datacu = {\n  shift = 0, mask = 0, -- NYI unconditional CP data.\n}\n\nlocal map_simddata = {\n  shift = 0, mask = 0, -- NYI SIMD data.\n}\n\nlocal map_simdload = {\n  shift = 0, mask = 0, -- NYI SIMD load/store, preload.\n}\n\nlocal map_preload = {\n  shift = 0, mask = 0, -- NYI preload.\n}\n\nlocal map_media = {\n  shift = 20, mask = 31,\n  [0] = false,\n  { --01\n    shift = 5, mask = 7,\n    [0] = \"sadd16DNM\", \"sasxDNM\", \"ssaxDNM\", \"ssub16DNM\",\n    \"sadd8DNM\", false, false, \"ssub8DNM\",\n  },\n  { --02\n    shift = 5, mask = 7,\n    [0] = \"qadd16DNM\", \"qasxDNM\", \"qsaxDNM\", \"qsub16DNM\",\n    \"qadd8DNM\", false, false, \"qsub8DNM\",\n  },\n  { --03\n    shift = 5, mask = 7,\n    [0] = \"shadd16DNM\", \"shasxDNM\", \"shsaxDNM\", \"shsub16DNM\",\n    \"shadd8DNM\", false, false, \"shsub8DNM\",\n  },\n  false,\n  { --05\n    shift = 5, mask = 7,\n    [0] = \"uadd16DNM\", \"uasxDNM\", \"usaxDNM\", \"usub16DNM\",\n    \"uadd8DNM\", false, false, \"usub8DNM\",\n  },\n  { --06\n    shift = 5, mask = 7,\n    [0] = \"uqadd16DNM\", \"uqasxDNM\", \"uqsaxDNM\", \"uqsub16DNM\",\n    \"uqadd8DNM\", false, false, \"uqsub8DNM\",\n  },\n  { --07\n    shift = 5, mask = 7,\n    [0] = \"uhadd16DNM\", \"uhasxDNM\", \"uhsaxDNM\", \"uhsub16DNM\",\n    \"uhadd8DNM\", false, false, \"uhsub8DNM\",\n  },\n  { --08\n    shift = 5, mask = 7,\n    [0] = \"pkhbtDNMU\", false, \"pkhtbDNMU\",\n    { shift = 16, mask = 15, [15] = \"sxtb16DMU\", _ = \"sxtab16DNMU\", },\n    \"pkhbtDNMU\", \"selDNM\", \"pkhtbDNMU\",\n  },\n  false,\n  { --0a\n    shift = 5, mask = 7,\n    [0] = \"ssatDxMu\", \"ssat16DxM\", \"ssatDxMu\",\n    { shift = 16, mask = 15, [15] = \"sxtbDMU\", _ = \"sxtabDNMU\", },\n    \"ssatDxMu\", false, \"ssatDxMu\",\n  },\n  { --0b\n    shift = 5, mask = 7,\n    [0] = \"ssatDxMu\", \"revDM\", \"ssatDxMu\",\n    { shift = 16, mask = 15, [15] = \"sxthDMU\", _ = \"sxtahDNMU\", },\n    \"ssatDxMu\", \"rev16DM\", \"ssatDxMu\",\n  },\n  { --0c\n    shift = 5, mask = 7,\n    [3] = { shift = 16, mask = 15, [15] = \"uxtb16DMU\", _ = \"uxtab16DNMU\", },\n  },\n  false,\n  { --0e\n    shift = 5, mask = 7,\n    [0] = \"usatDwMu\", \"usat16DwM\", \"usatDwMu\",\n    { shift = 16, mask = 15, [15] = \"uxtbDMU\", _ = \"uxtabDNMU\", },\n    \"usatDwMu\", false, \"usatDwMu\",\n  },\n  { --0f\n    shift = 5, mask = 7,\n    [0] = \"usatDwMu\", \"rbitDM\", \"usatDwMu\",\n    { shift = 16, mask = 15, [15] = \"uxthDMU\", _ = \"uxtahDNMU\", },\n    \"usatDwMu\", \"revshDM\", \"usatDwMu\",\n  },\n  { --10\n    shift = 12, mask = 15,\n    [15] = {\n      shift = 5, mask = 7,\n      \"smuadNMS\", \"smuadxNMS\", \"smusdNMS\", \"smusdxNMS\",\n    },\n    _ = {\n      shift = 5, mask = 7,\n      [0] = \"smladNMSD\", \"smladxNMSD\", \"smlsdNMSD\", \"smlsdxNMSD\",\n    },\n  },\n  false, false, false,\n  { --14\n    shift = 5, mask = 7,\n    [0] = \"smlaldDNMS\", \"smlaldxDNMS\", \"smlsldDNMS\", \"smlsldxDNMS\",\n  },\n  { --15\n    shift = 5, mask = 7,\n    [0] = { shift = 12, mask = 15, [15] = \"smmulNMS\", _ = \"smmlaNMSD\", },\n    { shift = 12, mask = 15, [15] = \"smmulrNMS\", _ = \"smmlarNMSD\", },\n    false, false, false, false,\n    \"smmlsNMSD\", \"smmlsrNMSD\",\n  },\n  false, false,\n  { --18\n    shift = 5, mask = 7,\n    [0] = { shift = 12, mask = 15, [15] = \"usad8NMS\", _ = \"usada8NMSD\", },\n  },\n  false,\n  { --1a\n    shift = 5, mask = 3, [2] = \"sbfxDMvw\",\n  },\n  { --1b\n    shift = 5, mask = 3, [2] = \"sbfxDMvw\",\n  },\n  { --1c\n    shift = 5, mask = 3,\n    [0] = { shift = 0, mask = 15, [15] = \"bfcDvX\", _ = \"bfiDMvX\", },\n  },\n  { --1d\n    shift = 5, mask = 3,\n    [0] = { shift = 0, mask = 15, [15] = \"bfcDvX\", _ = \"bfiDMvX\", },\n  },\n  { --1e\n    shift = 5, mask = 3, [2] = \"ubfxDMvw\",\n  },\n  { --1f\n    shift = 5, mask = 3, [2] = \"ubfxDMvw\",\n  },\n}\n\nlocal map_load = {\n  shift = 21, mask = 9,\n  {\n    shift = 20, mask = 5,\n    [0] = \"strtDL\", \"ldrtDL\", [4] = \"strbtDL\", [5] = \"ldrbtDL\",\n  },\n  _ = {\n    shift = 20, mask = 5,\n    [0] = \"strDL\", \"ldrDL\", [4] = \"strbDL\", [5] = \"ldrbDL\",\n  }\n}\n\nlocal map_load1 = {\n  shift = 4, mask = 1,\n  [0] = map_load, map_media,\n}\n\nlocal map_loadm = {\n  shift = 20, mask = 1,\n  [0] = {\n    shift = 23, mask = 3,\n    [0] = \"stmdaNR\", \"stmNR\",\n    { shift = 16, mask = 63, [45] = \"pushR\", _ = \"stmdbNR\", }, \"stmibNR\",\n  },\n  {\n    shift = 23, mask = 3,\n    [0] = \"ldmdaNR\", { shift = 16, mask = 63, [61] = \"popR\", _ = \"ldmNR\", },\n    \"ldmdbNR\", \"ldmibNR\",\n  },\n}\n\nlocal map_data = {\n  shift = 21, mask = 15,\n  [0] = \"andDNPs\", \"eorDNPs\", \"subDNPs\", \"rsbDNPs\",\n  \"addDNPs\", \"adcDNPs\", \"sbcDNPs\", \"rscDNPs\",\n  \"tstNP\", \"teqNP\", \"cmpNP\", \"cmnNP\",\n  \"orrDNPs\", \"movDPs\", \"bicDNPs\", \"mvnDPs\",\n}\n\nlocal map_mul = {\n  shift = 21, mask = 7,\n  [0] = \"mulNMSs\", \"mlaNMSDs\", \"umaalDNMS\", \"mlsDNMS\",\n  \"umullDNMSs\", \"umlalDNMSs\", \"smullDNMSs\", \"smlalDNMSs\",\n}\n\nlocal map_sync = {\n  shift = 20, mask = 15, -- NYI: brackets around N. R(D+1) for ldrexd/strexd.\n  [0] = \"swpDMN\", false, false, false,\n  \"swpbDMN\", false, false, false,\n  \"strexDMN\", \"ldrexDN\", \"strexdDN\", \"ldrexdDN\",\n  \"strexbDMN\", \"ldrexbDN\", \"strexhDN\", \"ldrexhDN\",\n}\n\nlocal map_mulh = {\n  shift = 21, mask = 3,\n  [0] = { shift = 5, mask = 3,\n    [0] = \"smlabbNMSD\", \"smlatbNMSD\", \"smlabtNMSD\", \"smlattNMSD\", },\n  { shift = 5, mask = 3,\n    [0] = \"smlawbNMSD\", \"smulwbNMS\", \"smlawtNMSD\", \"smulwtNMS\", },\n  { shift = 5, mask = 3,\n    [0] = \"smlalbbDNMS\", \"smlaltbDNMS\", \"smlalbtDNMS\", \"smlalttDNMS\", },\n  { shift = 5, mask = 3,\n    [0] = \"smulbbNMS\", \"smultbNMS\", \"smulbtNMS\", \"smulttNMS\", },\n}\n\nlocal map_misc = {\n  shift = 4, mask = 7,\n  -- NYI: decode PSR bits of msr.\n  [0] = { shift = 21, mask = 1, [0] = \"mrsD\", \"msrM\", },\n  { shift = 21, mask = 3, \"bxM\", false, \"clzDM\", },\n  { shift = 21, mask = 3, \"bxjM\", },\n  { shift = 21, mask = 3, \"blxM\", },\n  false,\n  { shift = 21, mask = 3, [0] = \"qaddDMN\", \"qsubDMN\", \"qdaddDMN\", \"qdsubDMN\", },\n  false,\n  { shift = 21, mask = 3, \"bkptK\", },\n}\n\nlocal map_datar = {\n  shift = 4, mask = 9,\n  [9] = {\n    shift = 5, mask = 3,\n    [0] = { shift = 24, mask = 1, [0] = map_mul, map_sync, },\n    { shift = 20, mask = 1, [0] = \"strhDL\", \"ldrhDL\", },\n    { shift = 20, mask = 1, [0] = \"ldrdDL\", \"ldrsbDL\", },\n    { shift = 20, mask = 1, [0] = \"strdDL\", \"ldrshDL\", },\n  },\n  _ = {\n    shift = 20, mask = 25,\n    [16] = { shift = 7, mask = 1, [0] = map_misc, map_mulh, },\n    _ = {\n      shift = 0, mask = 0xffffffff,\n      [bor(0xe1a00000)] = \"nop\",\n      _ = map_data,\n    }\n  },\n}\n\nlocal map_datai = {\n  shift = 20, mask = 31, -- NYI: decode PSR bits of msr. Decode imm12.\n  [16] = \"movwDW\", [20] = \"movtDW\",\n  [18] = { shift = 0, mask = 0xf00ff, [0] = \"nopv6\", _ = \"msrNW\", },\n  [22] = \"msrNW\",\n  _ = map_data,\n}\n\nlocal map_branch = {\n  shift = 24, mask = 1,\n  [0] = \"bB\", \"blB\"\n}\n\nlocal map_condins = {\n  [0] = map_datar, map_datai, map_load, map_load1,\n  map_loadm, map_branch, map_loadc, map_datac\n}\n\n-- NYI: setend.\nlocal map_uncondins = {\n  [0] = false, map_simddata, map_simdload, map_preload,\n  false, \"blxB\", map_loadcu, map_datacu,\n}\n\n------------------------------------------------------------------------------\n\nlocal map_gpr = {\n  [0] = \"r0\", \"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"sp\", \"lr\", \"pc\",\n}\n\nlocal map_cond = {\n  [0] = \"eq\", \"ne\", \"hs\", \"lo\", \"mi\", \"pl\", \"vs\", \"vc\",\n  \"hi\", \"ls\", \"ge\", \"lt\", \"gt\", \"le\", \"al\",\n}\n\nlocal map_shift = { [0] = \"lsl\", \"lsr\", \"asr\", \"ror\", }\n\n------------------------------------------------------------------------------\n\n-- Output a nicely formatted line with an opcode and operands.\nlocal function putop(ctx, text, operands)\n  local pos = ctx.pos\n  local extra = \"\"\n  if ctx.rel then\n    local sym = ctx.symtab[ctx.rel]\n    if sym then\n      extra = \"\\t->\"..sym\n    elseif band(ctx.op, 0x0e000000) ~= 0x0a000000 then\n      extra = \"\\t; 0x\"..tohex(ctx.rel)\n    end\n  end\n  if ctx.hexdump > 0 then\n    ctx.out(format(\"%08x  %s  %-5s %s%s\\n\",\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\n  else\n    ctx.out(format(\"%08x  %-5s %s%s\\n\",\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\n  end\n  ctx.pos = pos + 4\nend\n\n-- Fallback for unknown opcodes.\nlocal function unknown(ctx)\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\nend\n\n-- Format operand 2 of load/store opcodes.\nlocal function fmtload(ctx, op, pos)\n  local base = map_gpr[band(rshift(op, 16), 15)]\n  local x, ofs\n  local ext = (band(op, 0x04000000) == 0)\n  if not ext and band(op, 0x02000000) == 0 then\n    ofs = band(op, 4095)\n    if band(op, 0x00800000) == 0 then ofs = -ofs end\n    if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\n    ofs = \"#\"..ofs\n  elseif ext and band(op, 0x00400000) ~= 0 then\n    ofs = band(op, 15) + band(rshift(op, 4), 0xf0)\n    if band(op, 0x00800000) == 0 then ofs = -ofs end\n    if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\n    ofs = \"#\"..ofs\n  else\n    ofs = map_gpr[band(op, 15)]\n    if ext or band(op, 0xfe0) == 0 then\n    elseif band(op, 0xfe0) == 0x60 then\n      ofs = format(\"%s, rrx\", ofs)\n    else\n      local sh = band(rshift(op, 7), 31)\n      if sh == 0 then sh = 32 end\n      ofs = format(\"%s, %s #%d\", ofs, map_shift[band(rshift(op, 5), 3)], sh)\n    end\n    if band(op, 0x00800000) == 0 then ofs = \"-\"..ofs end\n  end\n  if ofs == \"#0\" then\n    x = format(\"[%s]\", base)\n  elseif band(op, 0x01000000) == 0 then\n    x = format(\"[%s], %s\", base, ofs)\n  else\n    x = format(\"[%s, %s]\", base, ofs)\n  end\n  if band(op, 0x01200000) == 0x01200000 then x = x..\"!\" end\n  return x\nend\n\n-- Format operand 2 of vector load/store opcodes.\nlocal function fmtvload(ctx, op, pos)\n  local base = map_gpr[band(rshift(op, 16), 15)]\n  local ofs = band(op, 255)*4\n  if band(op, 0x00800000) == 0 then ofs = -ofs end\n  if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\n  if ofs == 0 then\n    return format(\"[%s]\", base)\n  else\n    return format(\"[%s, #%d]\", base, ofs)\n  end\nend\n\nlocal function fmtvr(op, vr, sh0, sh1)\n  if vr == \"s\" then\n    return format(\"s%d\", 2*band(rshift(op, sh0), 15)+band(rshift(op, sh1), 1))\n  else\n    return format(\"d%d\", band(rshift(op, sh0), 15)+band(rshift(op, sh1-4), 16))\n  end\nend\n\n-- Disassemble a single instruction.\nlocal function disass_ins(ctx)\n  local pos = ctx.pos\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\n  local op = bor(lshift(b3, 24), lshift(b2, 16), lshift(b1, 8), b0)\n  local operands = {}\n  local suffix = \"\"\n  local last, name, pat\n  local vr\n  ctx.op = op\n  ctx.rel = nil\n\n  local cond = rshift(op, 28)\n  local opat\n  if cond == 15 then\n    opat = map_uncondins[band(rshift(op, 25), 7)]\n  else\n    if cond ~= 14 then suffix = map_cond[cond] end\n    opat = map_condins[band(rshift(op, 25), 7)]\n  end\n  while type(opat) ~= \"string\" do\n    if not opat then return unknown(ctx) end\n    opat = opat[band(rshift(op, opat.shift), opat.mask)] or opat._\n  end\n  name, pat = match(opat, \"^([a-z0-9]*)(.*)\")\n  if sub(pat, 1, 1) == \".\" then\n    local s2, p2 = match(pat, \"^([a-z0-9.]*)(.*)\")\n    suffix = suffix..s2\n    pat = p2\n  end\n\n  for p in gmatch(pat, \".\") do\n    local x = nil\n    if p == \"D\" then\n      x = map_gpr[band(rshift(op, 12), 15)]\n    elseif p == \"N\" then\n      x = map_gpr[band(rshift(op, 16), 15)]\n    elseif p == \"S\" then\n      x = map_gpr[band(rshift(op, 8), 15)]\n    elseif p == \"M\" then\n      x = map_gpr[band(op, 15)]\n    elseif p == \"d\" then\n      x = fmtvr(op, vr, 12, 22)\n    elseif p == \"n\" then\n      x = fmtvr(op, vr, 16, 7)\n    elseif p == \"m\" then\n      x = fmtvr(op, vr, 0, 5)\n    elseif p == \"P\" then\n      if band(op, 0x02000000) ~= 0 then\n\tx = ror(band(op, 255), 2*band(rshift(op, 8), 15))\n      else\n\tx = map_gpr[band(op, 15)]\n\tif band(op, 0xff0) ~= 0 then\n\t  operands[#operands+1] = x\n\t  local s = map_shift[band(rshift(op, 5), 3)]\n\t  local r = nil\n\t  if band(op, 0xf90) == 0 then\n\t    if s == \"ror\" then s = \"rrx\" else r = \"#32\" end\n\t  elseif band(op, 0x10) == 0 then\n\t    r = \"#\"..band(rshift(op, 7), 31)\n\t  else\n\t    r = map_gpr[band(rshift(op, 8), 15)]\n\t  end\n\t  if name == \"mov\" then name = s; x = r\n\t  elseif r then x = format(\"%s %s\", s, r)\n\t  else x = s end\n\tend\n      end\n    elseif p == \"L\" then\n      x = fmtload(ctx, op, pos)\n    elseif p == \"l\" then\n      x = fmtvload(ctx, op, pos)\n    elseif p == \"B\" then\n      local addr = ctx.addr + pos + 8 + arshift(lshift(op, 8), 6)\n      if cond == 15 then addr = addr + band(rshift(op, 23), 2) end\n      ctx.rel = addr\n      x = \"0x\"..tohex(addr)\n    elseif p == \"F\" then\n      vr = \"s\"\n    elseif p == \"G\" then\n      vr = \"d\"\n    elseif p == \".\" then\n      suffix = suffix..(vr == \"s\" and \".f32\" or \".f64\")\n    elseif p == \"R\" then\n      if band(op, 0x00200000) ~= 0 and #operands == 1 then\n\toperands[1] = operands[1]..\"!\"\n      end\n      local t = {}\n      for i=0,15 do\n\tif band(rshift(op, i), 1) == 1 then t[#t+1] = map_gpr[i] end\n      end\n      x = \"{\"..concat(t, \", \")..\"}\"\n    elseif p == \"r\" then\n      if band(op, 0x00200000) ~= 0 and #operands == 2 then\n\toperands[1] = operands[1]..\"!\"\n      end\n      local s = tonumber(sub(last, 2))\n      local n = band(op, 255)\n      if vr == \"d\" then n = rshift(n, 1) end\n      operands[#operands] = format(\"{%s-%s%d}\", last, vr, s+n-1)\n    elseif p == \"W\" then\n      x = band(op, 0x0fff) + band(rshift(op, 4), 0xf000)\n    elseif p == \"T\" then\n      x = \"#0x\"..tohex(band(op, 0x00ffffff), 6)\n    elseif p == \"U\" then\n      x = band(rshift(op, 7), 31)\n      if x == 0 then x = nil end\n    elseif p == \"u\" then\n      x = band(rshift(op, 7), 31)\n      if band(op, 0x40) == 0 then\n\tif x == 0 then x = nil else x = \"lsl #\"..x end\n      else\n\tif x == 0 then x = \"asr #32\" else x = \"asr #\"..x end\n      end\n    elseif p == \"v\" then\n      x = band(rshift(op, 7), 31)\n    elseif p == \"w\" then\n      x = band(rshift(op, 16), 31)\n    elseif p == \"x\" then\n      x = band(rshift(op, 16), 31) + 1\n    elseif p == \"X\" then\n      x = band(rshift(op, 16), 31) - last + 1\n    elseif p == \"Y\" then\n      x = band(rshift(op, 12), 0xf0) + band(op, 0x0f)\n    elseif p == \"K\" then\n      x = \"#0x\"..tohex(band(rshift(op, 4), 0x0000fff0) + band(op, 15), 4)\n    elseif p == \"s\" then\n      if band(op, 0x00100000) ~= 0 then suffix = \"s\"..suffix end\n    else\n      assert(false)\n    end\n    if x then\n      last = x\n      if type(x) == \"number\" then x = \"#\"..x end\n      operands[#operands+1] = x\n    end\n  end\n\n  return putop(ctx, name..suffix, operands)\nend\n\n------------------------------------------------------------------------------\n\n-- Disassemble a block of code.\nlocal function disass_block(ctx, ofs, len)\n  if not ofs then ofs = 0 end\n  local stop = len and ofs+len or #ctx.code\n  ctx.pos = ofs\n  ctx.rel = nil\n  while ctx.pos < stop do disass_ins(ctx) end\nend\n\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\nlocal function create_(code, addr, out)\n  local ctx = {}\n  ctx.code = code\n  ctx.addr = addr or 0\n  ctx.out = out or io.write\n  ctx.symtab = {}\n  ctx.disass = disass_block\n  ctx.hexdump = 8\n  return ctx\nend\n\n-- Simple API: disassemble code (a string) at address and output via out.\nlocal function disass_(code, addr, out)\n  create_(code, addr, out):disass()\nend\n\n-- Return register name for RID.\nlocal function regname_(r)\n  if r < 16 then return map_gpr[r] end\n  return \"d\"..(r-16)\nend\n\n-- Public module functions.\nmodule(...)\n\ncreate = create_\ndisass = disass_\nregname = regname_\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_mips.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT MIPS disassembler module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT/X license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This is a helper module used by the LuaJIT machine code dumper module.\n--\n-- It disassembles all standard MIPS32R1/R2 instructions.\n-- Default mode is big-endian, but see: dis_mipsel.lua\n------------------------------------------------------------------------------\n\nlocal type = type\nlocal sub, byte, format = string.sub, string.byte, string.format\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\nlocal concat = table.concat\nlocal bit = require(\"bit\")\nlocal band, bor, tohex = bit.band, bit.bor, bit.tohex\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\n\n------------------------------------------------------------------------------\n-- Primary and extended opcode maps\n------------------------------------------------------------------------------\n\nlocal map_movci = { shift = 16, mask = 1, [0] = \"movfDSC\", \"movtDSC\", }\nlocal map_srl = { shift = 21, mask = 1, [0] = \"srlDTA\", \"rotrDTA\", }\nlocal map_srlv = { shift = 6, mask = 1, [0] = \"srlvDTS\", \"rotrvDTS\", }\n\nlocal map_special = {\n  shift = 0, mask = 63,\n  [0] = { shift = 0, mask = -1, [0] = \"nop\", _ = \"sllDTA\" },\n  map_movci,\tmap_srl,\t\"sraDTA\",\n  \"sllvDTS\",\tfalse,\t\tmap_srlv,\t\"sravDTS\",\n  \"jrS\",\t\"jalrD1S\",\t\"movzDST\",\t\"movnDST\",\n  \"syscallY\",\t\"breakY\",\tfalse,\t\t\"sync\",\n  \"mfhiD\",\t\"mthiS\",\t\"mfloD\",\t\"mtloS\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"multST\",\t\"multuST\",\t\"divST\",\t\"divuST\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"addDST\",\t\"addu|moveDST0\", \"subDST\",\t\"subu|neguDS0T\",\n  \"andDST\",\t\"orDST\",\t\"xorDST\",\t\"nor|notDST0\",\n  false,\tfalse,\t\t\"sltDST\",\t\"sltuDST\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"tgeSTZ\",\t\"tgeuSTZ\",\t\"tltSTZ\",\t\"tltuSTZ\",\n  \"teqSTZ\",\tfalse,\t\t\"tneSTZ\",\n}\n\nlocal map_special2 = {\n  shift = 0, mask = 63,\n  [0] = \"maddST\", \"madduST\",\t\"mulDST\",\tfalse,\n  \"msubST\",\t\"msubuST\",\n  [32] = \"clzDS\", [33] = \"cloDS\",\n  [63] = \"sdbbpY\",\n}\n\nlocal map_bshfl = {\n  shift = 6, mask = 31,\n  [2] = \"wsbhDT\",\n  [16] = \"sebDT\",\n  [24] = \"sehDT\",\n}\n\nlocal map_special3 = {\n  shift = 0, mask = 63,\n  [0] = \"extTSAK\", [4] = \"insTSAL\",\n  [32] = map_bshfl,\n  [59] = \"rdhwrTD\",\n}\n\nlocal map_regimm = {\n  shift = 16, mask = 31,\n  [0] = \"bltzSB\",\t\"bgezSB\",\t\"bltzlSB\",\t\"bgezlSB\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"tgeiSI\",\t\"tgeiuSI\",\t\"tltiSI\",\t\"tltiuSI\",\n  \"teqiSI\",\tfalse,\t\t\"tneiSI\",\tfalse,\n  \"bltzalSB\",\t\"bgezalSB\",\t\"bltzallSB\",\t\"bgezallSB\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\t\"synciSO\",\n}\n\nlocal map_cop0 = {\n  shift = 25, mask = 1,\n  [0] = {\n    shift = 21, mask = 15,\n    [0] = \"mfc0TDW\", [4] = \"mtc0TDW\",\n    [10] = \"rdpgprDT\",\n    [11] = { shift = 5, mask = 1, [0] = \"diT0\", \"eiT0\", },\n    [14] = \"wrpgprDT\",\n  }, {\n    shift = 0, mask = 63,\n    [1] = \"tlbr\", [2] = \"tlbwi\", [6] = \"tlbwr\", [8] = \"tlbp\",\n    [24] = \"eret\", [31] = \"deret\",\n    [32] = \"wait\",\n  },\n}\n\nlocal map_cop1s = {\n  shift = 0, mask = 63,\n  [0] = \"add.sFGH\",\t\"sub.sFGH\",\t\"mul.sFGH\",\t\"div.sFGH\",\n  \"sqrt.sFG\",\t\t\"abs.sFG\",\t\"mov.sFG\",\t\"neg.sFG\",\n  \"round.l.sFG\",\t\"trunc.l.sFG\",\t\"ceil.l.sFG\",\t\"floor.l.sFG\",\n  \"round.w.sFG\",\t\"trunc.w.sFG\",\t\"ceil.w.sFG\",\t\"floor.w.sFG\",\n  false,\n  { shift = 16, mask = 1, [0] = \"movf.sFGC\", \"movt.sFGC\" },\n  \"movz.sFGT\",\t\"movn.sFGT\",\n  false,\t\"recip.sFG\",\t\"rsqrt.sFG\",\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\t\"cvt.d.sFG\",\tfalse,\t\tfalse,\n  \"cvt.w.sFG\",\t\"cvt.l.sFG\",\t\"cvt.ps.sFGH\",\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"c.f.sVGH\",\t\"c.un.sVGH\",\t\"c.eq.sVGH\",\t\"c.ueq.sVGH\",\n  \"c.olt.sVGH\",\t\"c.ult.sVGH\",\t\"c.ole.sVGH\",\t\"c.ule.sVGH\",\n  \"c.sf.sVGH\",\t\"c.ngle.sVGH\",\t\"c.seq.sVGH\",\t\"c.ngl.sVGH\",\n  \"c.lt.sVGH\",\t\"c.nge.sVGH\",\t\"c.le.sVGH\",\t\"c.ngt.sVGH\",\n}\n\nlocal map_cop1d = {\n  shift = 0, mask = 63,\n  [0] = \"add.dFGH\",\t\"sub.dFGH\",\t\"mul.dFGH\",\t\"div.dFGH\",\n  \"sqrt.dFG\",\t\t\"abs.dFG\",\t\"mov.dFG\",\t\"neg.dFG\",\n  \"round.l.dFG\",\t\"trunc.l.dFG\",\t\"ceil.l.dFG\",\t\"floor.l.dFG\",\n  \"round.w.dFG\",\t\"trunc.w.dFG\",\t\"ceil.w.dFG\",\t\"floor.w.dFG\",\n  false,\n  { shift = 16, mask = 1, [0] = \"movf.dFGC\", \"movt.dFGC\" },\n  \"movz.dFGT\",\t\"movn.dFGT\",\n  false,\t\"recip.dFG\",\t\"rsqrt.dFG\",\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"cvt.s.dFG\",\tfalse,\t\tfalse,\t\tfalse,\n  \"cvt.w.dFG\",\t\"cvt.l.dFG\",\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"c.f.dVGH\",\t\"c.un.dVGH\",\t\"c.eq.dVGH\",\t\"c.ueq.dVGH\",\n  \"c.olt.dVGH\",\t\"c.ult.dVGH\",\t\"c.ole.dVGH\",\t\"c.ule.dVGH\",\n  \"c.df.dVGH\",\t\"c.ngle.dVGH\",\t\"c.deq.dVGH\",\t\"c.ngl.dVGH\",\n  \"c.lt.dVGH\",\t\"c.nge.dVGH\",\t\"c.le.dVGH\",\t\"c.ngt.dVGH\",\n}\n\nlocal map_cop1ps = {\n  shift = 0, mask = 63,\n  [0] = \"add.psFGH\",\t\"sub.psFGH\",\t\"mul.psFGH\",\tfalse,\n  false,\t\t\"abs.psFG\",\t\"mov.psFG\",\t\"neg.psFG\",\n  false,\t\tfalse,\t\tfalse,\t\tfalse,\n  false,\t\tfalse,\t\tfalse,\t\tfalse,\n  false,\n  { shift = 16, mask = 1, [0] = \"movf.psFGC\", \"movt.psFGC\" },\n  \"movz.psFGT\",\t\"movn.psFGT\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"cvt.s.puFG\",\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  \"cvt.s.plFG\",\tfalse,\t\tfalse,\t\tfalse,\n  \"pll.psFGH\",\t\"plu.psFGH\",\t\"pul.psFGH\",\t\"puu.psFGH\",\n  \"c.f.psVGH\",\t\"c.un.psVGH\",\t\"c.eq.psVGH\",\t\"c.ueq.psVGH\",\n  \"c.olt.psVGH\", \"c.ult.psVGH\",\t\"c.ole.psVGH\",\t\"c.ule.psVGH\",\n  \"c.psf.psVGH\", \"c.ngle.psVGH\", \"c.pseq.psVGH\", \"c.ngl.psVGH\",\n  \"c.lt.psVGH\",\t\"c.nge.psVGH\",\t\"c.le.psVGH\",\t\"c.ngt.psVGH\",\n}\n\nlocal map_cop1w = {\n  shift = 0, mask = 63,\n  [32] = \"cvt.s.wFG\", [33] = \"cvt.d.wFG\",\n}\n\nlocal map_cop1l = {\n  shift = 0, mask = 63,\n  [32] = \"cvt.s.lFG\", [33] = \"cvt.d.lFG\",\n}\n\nlocal map_cop1bc = {\n  shift = 16, mask = 3,\n  [0] = \"bc1fCB\", \"bc1tCB\",\t\"bc1flCB\",\t\"bc1tlCB\",\n}\n\nlocal map_cop1 = {\n  shift = 21, mask = 31,\n  [0] = \"mfc1TG\", false,\t\"cfc1TG\",\t\"mfhc1TG\",\n  \"mtc1TG\",\tfalse,\t\t\"ctc1TG\",\t\"mthc1TG\",\n  map_cop1bc,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  map_cop1s,\tmap_cop1d,\tfalse,\t\tfalse,\n  map_cop1w,\tmap_cop1l,\tmap_cop1ps,\n}\n\nlocal map_cop1x = {\n  shift = 0, mask = 63,\n  [0] = \"lwxc1FSX\",\t\"ldxc1FSX\",\tfalse,\t\tfalse,\n  false,\t\"luxc1FSX\",\tfalse,\t\tfalse,\n  \"swxc1FSX\",\t\"sdxc1FSX\",\tfalse,\t\tfalse,\n  false,\t\"suxc1FSX\",\tfalse,\t\t\"prefxMSX\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  false,\tfalse,\t\t\"alnv.psFGHS\",\tfalse,\n  \"madd.sFRGH\",\t\"madd.dFRGH\",\tfalse,\t\tfalse,\n  false,\tfalse,\t\t\"madd.psFRGH\",\tfalse,\n  \"msub.sFRGH\",\t\"msub.dFRGH\",\tfalse,\t\tfalse,\n  false,\tfalse,\t\t\"msub.psFRGH\",\tfalse,\n  \"nmadd.sFRGH\", \"nmadd.dFRGH\",\tfalse,\t\tfalse,\n  false,\tfalse,\t\t\"nmadd.psFRGH\",\tfalse,\n  \"nmsub.sFRGH\", \"nmsub.dFRGH\",\tfalse,\t\tfalse,\n  false,\tfalse,\t\t\"nmsub.psFRGH\",\tfalse,\n}\n\nlocal map_pri = {\n  [0] = map_special,\tmap_regimm,\t\"jJ\",\t\"jalJ\",\n  \"beq|beqz|bST00B\",\t\"bne|bnezST0B\",\t\t\"blezSB\",\t\"bgtzSB\",\n  \"addiTSI\",\t\"addiu|liTS0I\",\t\"sltiTSI\",\t\"sltiuTSI\",\n  \"andiTSU\",\t\"ori|liTS0U\",\t\"xoriTSU\",\t\"luiTU\",\n  map_cop0,\tmap_cop1,\tfalse,\t\tmap_cop1x,\n  \"beql|beqzlST0B\",\t\"bnel|bnezlST0B\",\t\"blezlSB\",\t\"bgtzlSB\",\n  false,\tfalse,\t\tfalse,\t\tfalse,\n  map_special2,\tfalse,\t\tfalse,\t\tmap_special3,\n  \"lbTSO\",\t\"lhTSO\",\t\"lwlTSO\",\t\"lwTSO\",\n  \"lbuTSO\",\t\"lhuTSO\",\t\"lwrTSO\",\tfalse,\n  \"sbTSO\",\t\"shTSO\",\t\"swlTSO\",\t\"swTSO\",\n  false,\tfalse,\t\t\"swrTSO\",\t\"cacheNSO\",\n  \"llTSO\",\t\"lwc1HSO\",\t\"lwc2TSO\",\t\"prefNSO\",\n  false,\t\"ldc1HSO\",\t\"ldc2TSO\",\tfalse,\n  \"scTSO\",\t\"swc1HSO\",\t\"swc2TSO\",\tfalse,\n  false,\t\"sdc1HSO\",\t\"sdc2TSO\",\tfalse,\n}\n\n------------------------------------------------------------------------------\n\nlocal map_gpr = {\n  [0] = \"r0\", \"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\",\n  \"r16\", \"r17\", \"r18\", \"r19\", \"r20\", \"r21\", \"r22\", \"r23\",\n  \"r24\", \"r25\", \"r26\", \"r27\", \"r28\", \"sp\", \"r30\", \"ra\",\n}\n\n------------------------------------------------------------------------------\n\n-- Output a nicely formatted line with an opcode and operands.\nlocal function putop(ctx, text, operands)\n  local pos = ctx.pos\n  local extra = \"\"\n  if ctx.rel then\n    local sym = ctx.symtab[ctx.rel]\n    if sym then extra = \"\\t->\"..sym end\n  end\n  if ctx.hexdump > 0 then\n    ctx.out(format(\"%08x  %s  %-7s %s%s\\n\",\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\n  else\n    ctx.out(format(\"%08x  %-7s %s%s\\n\",\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\n  end\n  ctx.pos = pos + 4\nend\n\n-- Fallback for unknown opcodes.\nlocal function unknown(ctx)\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\nend\n\nlocal function get_be(ctx)\n  local pos = ctx.pos\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\n  return bor(lshift(b0, 24), lshift(b1, 16), lshift(b2, 8), b3)\nend\n\nlocal function get_le(ctx)\n  local pos = ctx.pos\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\n  return bor(lshift(b3, 24), lshift(b2, 16), lshift(b1, 8), b0)\nend\n\n-- Disassemble a single instruction.\nlocal function disass_ins(ctx)\n  local op = ctx:get()\n  local operands = {}\n  local last = nil\n  ctx.op = op\n  ctx.rel = nil\n\n  local opat = map_pri[rshift(op, 26)]\n  while type(opat) ~= \"string\" do\n    if not opat then return unknown(ctx) end\n    opat = opat[band(rshift(op, opat.shift), opat.mask)] or opat._\n  end\n  local name, pat = match(opat, \"^([a-z0-9_.]*)(.*)\")\n  local altname, pat2 = match(pat, \"|([a-z0-9_.|]*)(.*)\")\n  if altname then pat = pat2 end\n\n  for p in gmatch(pat, \".\") do\n    local x = nil\n    if p == \"S\" then\n      x = map_gpr[band(rshift(op, 21), 31)]\n    elseif p == \"T\" then\n      x = map_gpr[band(rshift(op, 16), 31)]\n    elseif p == \"D\" then\n      x = map_gpr[band(rshift(op, 11), 31)]\n    elseif p == \"F\" then\n      x = \"f\"..band(rshift(op, 6), 31)\n    elseif p == \"G\" then\n      x = \"f\"..band(rshift(op, 11), 31)\n    elseif p == \"H\" then\n      x = \"f\"..band(rshift(op, 16), 31)\n    elseif p == \"R\" then\n      x = \"f\"..band(rshift(op, 21), 31)\n    elseif p == \"A\" then\n      x = band(rshift(op, 6), 31)\n    elseif p == \"M\" then\n      x = band(rshift(op, 11), 31)\n    elseif p == \"N\" then\n      x = band(rshift(op, 16), 31)\n    elseif p == \"C\" then\n      x = band(rshift(op, 18), 7)\n      if x == 0 then x = nil end\n    elseif p == \"K\" then\n      x = band(rshift(op, 11), 31) + 1\n    elseif p == \"L\" then\n      x = band(rshift(op, 11), 31) - last + 1\n    elseif p == \"I\" then\n      x = arshift(lshift(op, 16), 16)\n    elseif p == \"U\" then\n      x = band(op, 0xffff)\n    elseif p == \"O\" then\n      local disp = arshift(lshift(op, 16), 16)\n      operands[#operands] = format(\"%d(%s)\", disp, last)\n    elseif p == \"X\" then\n      local index = map_gpr[band(rshift(op, 16), 31)]\n      operands[#operands] = format(\"%s(%s)\", index, last)\n    elseif p == \"B\" then\n      x = ctx.addr + ctx.pos + arshift(lshift(op, 16), 16)*4 + 4\n      ctx.rel = x\n      x = \"0x\"..tohex(x)\n    elseif p == \"J\" then\n      x = band(ctx.addr + ctx.pos, 0xf0000000) + band(op, 0x03ffffff)*4\n      ctx.rel = x\n      x = \"0x\"..tohex(x)\n    elseif p == \"V\" then\n      x = band(rshift(op, 8), 7)\n      if x == 0 then x = nil end\n    elseif p == \"W\" then\n      x = band(op, 7)\n      if x == 0 then x = nil end\n    elseif p == \"Y\" then\n      x = band(rshift(op, 6), 0x000fffff)\n      if x == 0 then x = nil end\n    elseif p == \"Z\" then\n      x = band(rshift(op, 6), 1023)\n      if x == 0 then x = nil end\n    elseif p == \"0\" then\n      if last == \"r0\" or last == 0 then\n\tlocal n = #operands\n\toperands[n] = nil\n\tlast = operands[n-1]\n\tif altname then\n\t  local a1, a2 = match(altname, \"([^|]*)|(.*)\")\n\t  if a1 then name, altname = a1, a2\n\t  else name = altname end\n\tend\n      end\n    elseif p == \"1\" then\n      if last == \"ra\" then\n\toperands[#operands] = nil\n      end\n    else\n      assert(false)\n    end\n    if x then operands[#operands+1] = x; last = x end\n  end\n\n  return putop(ctx, name, operands)\nend\n\n------------------------------------------------------------------------------\n\n-- Disassemble a block of code.\nlocal function disass_block(ctx, ofs, len)\n  if not ofs then ofs = 0 end\n  local stop = len and ofs+len or #ctx.code\n  stop = stop - stop % 4\n  ctx.pos = ofs - ofs % 4\n  ctx.rel = nil\n  while ctx.pos < stop do disass_ins(ctx) end\nend\n\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\nlocal function create_(code, addr, out)\n  local ctx = {}\n  ctx.code = code\n  ctx.addr = addr or 0\n  ctx.out = out or io.write\n  ctx.symtab = {}\n  ctx.disass = disass_block\n  ctx.hexdump = 8\n  ctx.get = get_be\n  return ctx\nend\n\nlocal function create_el_(code, addr, out)\n  local ctx = create_(code, addr, out)\n  ctx.get = get_le\n  return ctx\nend\n\n-- Simple API: disassemble code (a string) at address and output via out.\nlocal function disass_(code, addr, out)\n  create_(code, addr, out):disass()\nend\n\nlocal function disass_el_(code, addr, out)\n  create_el_(code, addr, out):disass()\nend\n\n-- Return register name for RID.\nlocal function regname_(r)\n  if r < 32 then return map_gpr[r] end\n  return \"f\"..(r-32)\nend\n\n-- Public module functions.\nmodule(...)\n\ncreate = create_\ncreate_el = create_el_\ndisass = disass_\ndisass_el = disass_el_\nregname = regname_\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_mipsel.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT MIPSEL disassembler wrapper module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This module just exports the little-endian functions from the\n-- MIPS disassembler module. All the interesting stuff is there.\n------------------------------------------------------------------------------\n\nlocal require = require\n\nmodule(...)\n\nlocal dis_mips = require(_PACKAGE..\"dis_mips\")\n\ncreate = dis_mips.create_el\ndisass = dis_mips.disass_el\nregname = dis_mips.regname\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_ppc.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT PPC disassembler module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT/X license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This is a helper module used by the LuaJIT machine code dumper module.\n--\n-- It disassembles all common, non-privileged 32/64 bit PowerPC instructions\n-- plus the e500 SPE instructions and some Cell/Xenon extensions.\n--\n-- NYI: VMX, VMX128\n------------------------------------------------------------------------------\n\nlocal type = type\nlocal sub, byte, format = string.sub, string.byte, string.format\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\nlocal concat = table.concat\nlocal bit = require(\"bit\")\nlocal band, bor, tohex = bit.band, bit.bor, bit.tohex\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\n\n------------------------------------------------------------------------------\n-- Primary and extended opcode maps\n------------------------------------------------------------------------------\n\nlocal map_crops = {\n  shift = 1, mask = 1023,\n  [0] = \"mcrfXX\",\n  [33] = \"crnor|crnotCCC=\", [129] = \"crandcCCC\",\n  [193] = \"crxor|crclrCCC%\", [225] = \"crnandCCC\",\n  [257] = \"crandCCC\", [289] = \"creqv|crsetCCC%\",\n  [417] = \"crorcCCC\", [449] = \"cror|crmoveCCC=\",\n  [16] = \"b_lrKB\", [528] = \"b_ctrKB\",\n  [150] = \"isync\",\n}\n\nlocal map_rlwinm = setmetatable({\n  shift = 0, mask = -1,\n},\n{ __index = function(t, x)\n    local rot = band(rshift(x, 11), 31)\n    local mb = band(rshift(x, 6), 31)\n    local me = band(rshift(x, 1), 31)\n    if mb == 0 and me == 31-rot then\n      return \"slwiRR~A.\"\n    elseif me == 31 and mb == 32-rot then\n      return \"srwiRR~-A.\"\n    else\n      return \"rlwinmRR~AAA.\"\n    end\n  end\n})\n\nlocal map_rld = {\n  shift = 2, mask = 7,\n  [0] = \"rldiclRR~HM.\", \"rldicrRR~HM.\", \"rldicRR~HM.\", \"rldimiRR~HM.\",\n  {\n    shift = 1, mask = 1,\n    [0] = \"rldclRR~RM.\", \"rldcrRR~RM.\",\n  },\n}\n\nlocal map_ext = setmetatable({\n  shift = 1, mask = 1023,\n\n  [0] = \"cmp_YLRR\", [32] = \"cmpl_YLRR\",\n  [4] = \"twARR\", [68] = \"tdARR\",\n\n  [8] = \"subfcRRR.\", [40] = \"subfRRR.\",\n  [104] = \"negRR.\", [136] = \"subfeRRR.\",\n  [200] = \"subfzeRR.\", [232] = \"subfmeRR.\",\n  [520] = \"subfcoRRR.\", [552] = \"subfoRRR.\",\n  [616] = \"negoRR.\", [648] = \"subfeoRRR.\",\n  [712] = \"subfzeoRR.\", [744] = \"subfmeoRR.\",\n\n  [9] = \"mulhduRRR.\", [73] = \"mulhdRRR.\", [233] = \"mulldRRR.\",\n  [457] = \"divduRRR.\", [489] = \"divdRRR.\",\n  [745] = \"mulldoRRR.\",\n  [969] = \"divduoRRR.\", [1001] = \"divdoRRR.\",\n\n  [10] = \"addcRRR.\", [138] = \"addeRRR.\",\n  [202] = \"addzeRR.\", [234] = \"addmeRR.\", [266] = \"addRRR.\",\n  [522] = \"addcoRRR.\", [650] = \"addeoRRR.\",\n  [714] = \"addzeoRR.\", [746] = \"addmeoRR.\", [778] = \"addoRRR.\",\n\n  [11] = \"mulhwuRRR.\", [75] = \"mulhwRRR.\", [235] = \"mullwRRR.\",\n  [459] = \"divwuRRR.\", [491] = \"divwRRR.\",\n  [747] = \"mullwoRRR.\",\n  [971] = \"divwouRRR.\", [1003] = \"divwoRRR.\",\n\n  [15] = \"iselltRRR\", [47] = \"iselgtRRR\", [79] = \"iseleqRRR\",\n\n  [144] = { shift = 20, mask = 1, [0] = \"mtcrfRZ~\", \"mtocrfRZ~\", },\n  [19] = { shift = 20, mask = 1, [0] = \"mfcrR\", \"mfocrfRZ\", },\n  [371] = { shift = 11, mask = 1023, [392] = \"mftbR\", [424] = \"mftbuR\", },\n  [339] = {\n    shift = 11, mask = 1023,\n    [32] = \"mferR\", [256] = \"mflrR\", [288] = \"mfctrR\", [16] = \"mfspefscrR\",\n  },\n  [467] = {\n    shift = 11, mask = 1023,\n    [32] = \"mtxerR\", [256] = \"mtlrR\", [288] = \"mtctrR\", [16] = \"mtspefscrR\",\n  },\n\n  [20] = \"lwarxRR0R\", [84] = \"ldarxRR0R\",\n\n  [21] = \"ldxRR0R\", [53] = \"lduxRRR\",\n  [149] = \"stdxRR0R\", [181] = \"stduxRRR\",\n  [341] = \"lwaxRR0R\", [373] = \"lwauxRRR\",\n\n  [23] = \"lwzxRR0R\", [55] = \"lwzuxRRR\",\n  [87] = \"lbzxRR0R\", [119] = \"lbzuxRRR\",\n  [151] = \"stwxRR0R\", [183] = \"stwuxRRR\",\n  [215] = \"stbxRR0R\", [247] = \"stbuxRRR\",\n  [279] = \"lhzxRR0R\", [311] = \"lhzuxRRR\",\n  [343] = \"lhaxRR0R\", [375] = \"lhauxRRR\",\n  [407] = \"sthxRR0R\", [439] = \"sthuxRRR\",\n\n  [54] = \"dcbst-R0R\", [86] = \"dcbf-R0R\",\n  [150] = \"stwcxRR0R.\", [214] = \"stdcxRR0R.\",\n  [246] = \"dcbtst-R0R\", [278] = \"dcbt-R0R\",\n  [310] = \"eciwxRR0R\", [438] = \"ecowxRR0R\",\n  [470] = \"dcbi-RR\",\n\n  [598] = {\n    shift = 21, mask = 3,\n    [0] = \"sync\", \"lwsync\", \"ptesync\",\n  },\n  [758] = \"dcba-RR\",\n  [854] = \"eieio\", [982] = \"icbi-R0R\", [1014] = \"dcbz-R0R\",\n\n  [26] = \"cntlzwRR~\", [58] = \"cntlzdRR~\",\n  [122] = \"popcntbRR~\",\n  [154] = \"prtywRR~\", [186] = \"prtydRR~\",\n\n  [28] = \"andRR~R.\", [60] = \"andcRR~R.\", [124] = \"nor|notRR~R=.\",\n  [284] = \"eqvRR~R.\", [316] = \"xorRR~R.\",\n  [412] = \"orcRR~R.\", [444] = \"or|mrRR~R=.\", [476] = \"nandRR~R.\",\n  [508] = \"cmpbRR~R\",\n\n  [512] = \"mcrxrX\",\n\n  [532] = \"ldbrxRR0R\", [660] = \"stdbrxRR0R\",\n\n  [533] = \"lswxRR0R\", [597] = \"lswiRR0A\",\n  [661] = \"stswxRR0R\", [725] = \"stswiRR0A\",\n\n  [534] = \"lwbrxRR0R\", [662] = \"stwbrxRR0R\",\n  [790] = \"lhbrxRR0R\", [918] = \"sthbrxRR0R\",\n\n  [535] = \"lfsxFR0R\", [567] = \"lfsuxFRR\",\n  [599] = \"lfdxFR0R\", [631] = \"lfduxFRR\",\n  [663] = \"stfsxFR0R\", [695] = \"stfsuxFRR\",\n  [727] = \"stfdxFR0R\", [759] = \"stfduxFR0R\",\n  [855] = \"lfiwaxFR0R\",\n  [983] = \"stfiwxFR0R\",\n\n  [24] = \"slwRR~R.\",\n\n  [27] = \"sldRR~R.\", [536] = \"srwRR~R.\",\n  [792] = \"srawRR~R.\", [824] = \"srawiRR~A.\",\n\n  [794] = \"sradRR~R.\", [826] = \"sradiRR~H.\", [827] = \"sradiRR~H.\",\n  [922] = \"extshRR~.\", [954] = \"extsbRR~.\", [986] = \"extswRR~.\",\n\n  [539] = \"srdRR~R.\",\n},\n{ __index = function(t, x)\n    if band(x, 31) == 15 then return \"iselRRRC\" end\n  end\n})\n\nlocal map_ld = {\n  shift = 0, mask = 3,\n  [0] = \"ldRRE\", \"lduRRE\", \"lwaRRE\",\n}\n\nlocal map_std = {\n  shift = 0, mask = 3,\n  [0] = \"stdRRE\", \"stduRRE\",\n}\n\nlocal map_fps = {\n  shift = 5, mask = 1,\n  {\n    shift = 1, mask = 15,\n    [0] = false, false, \"fdivsFFF.\", false,\n    \"fsubsFFF.\", \"faddsFFF.\", \"fsqrtsF-F.\", false,\n    \"fresF-F.\", \"fmulsFF-F.\", \"frsqrtesF-F.\", false,\n    \"fmsubsFFFF~.\", \"fmaddsFFFF~.\", \"fnmsubsFFFF~.\", \"fnmaddsFFFF~.\",\n  }\n}\n\nlocal map_fpd = {\n  shift = 5, mask = 1,\n  [0] = {\n    shift = 1, mask = 1023,\n    [0] = \"fcmpuXFF\", [32] = \"fcmpoXFF\", [64] = \"mcrfsXX\",\n    [38] = \"mtfsb1A.\", [70] = \"mtfsb0A.\", [134] = \"mtfsfiA>>-A>\",\n    [8] = \"fcpsgnFFF.\", [40] = \"fnegF-F.\", [72] = \"fmrF-F.\",\n    [136] = \"fnabsF-F.\", [264] = \"fabsF-F.\",\n    [12] = \"frspF-F.\",\n    [14] = \"fctiwF-F.\", [15] = \"fctiwzF-F.\",\n    [583] = \"mffsF.\", [711] = \"mtfsfZF.\",\n    [392] = \"frinF-F.\", [424] = \"frizF-F.\",\n    [456] = \"fripF-F.\", [488] = \"frimF-F.\",\n    [814] = \"fctidF-F.\", [815] = \"fctidzF-F.\", [846] = \"fcfidF-F.\",\n  },\n  {\n    shift = 1, mask = 15,\n    [0] = false, false, \"fdivFFF.\", false,\n    \"fsubFFF.\", \"faddFFF.\", \"fsqrtF-F.\", \"fselFFFF~.\",\n    \"freF-F.\", \"fmulFF-F.\", \"frsqrteF-F.\", false,\n    \"fmsubFFFF~.\", \"fmaddFFFF~.\", \"fnmsubFFFF~.\", \"fnmaddFFFF~.\",\n  }\n}\n\nlocal map_spe = {\n  shift = 0, mask = 2047,\n\n  [512] = \"evaddwRRR\", [514] = \"evaddiwRAR~\",\n  [516] = \"evsubwRRR~\", [518] = \"evsubiwRAR~\",\n  [520] = \"evabsRR\", [521] = \"evnegRR\",\n  [522] = \"evextsbRR\", [523] = \"evextshRR\", [524] = \"evrndwRR\",\n  [525] = \"evcntlzwRR\", [526] = \"evcntlswRR\",\n\n  [527] = \"brincRRR\",\n\n  [529] = \"evandRRR\", [530] = \"evandcRRR\", [534] = \"evxorRRR\",\n  [535] = \"evor|evmrRRR=\", [536] = \"evnor|evnotRRR=\",\n  [537] = \"eveqvRRR\", [539] = \"evorcRRR\", [542] = \"evnandRRR\",\n\n  [544] = \"evsrwuRRR\", [545] = \"evsrwsRRR\",\n  [546] = \"evsrwiuRRA\", [547] = \"evsrwisRRA\",\n  [548] = \"evslwRRR\", [550] = \"evslwiRRA\",\n  [552] = \"evrlwRRR\", [553] = \"evsplatiRS\",\n  [554] = \"evrlwiRRA\", [555] = \"evsplatfiRS\",\n  [556] = \"evmergehiRRR\", [557] = \"evmergeloRRR\",\n  [558] = \"evmergehiloRRR\", [559] = \"evmergelohiRRR\",\n\n  [560] = \"evcmpgtuYRR\", [561] = \"evcmpgtsYRR\",\n  [562] = \"evcmpltuYRR\", [563] = \"evcmpltsYRR\",\n  [564] = \"evcmpeqYRR\",\n\n  [632] = \"evselRRR\", [633] = \"evselRRRW\",\n  [634] = \"evselRRRW\", [635] = \"evselRRRW\",\n  [636] = \"evselRRRW\", [637] = \"evselRRRW\",\n  [638] = \"evselRRRW\", [639] = \"evselRRRW\",\n\n  [640] = \"evfsaddRRR\", [641] = \"evfssubRRR\",\n  [644] = \"evfsabsRR\", [645] = \"evfsnabsRR\", [646] = \"evfsnegRR\",\n  [648] = \"evfsmulRRR\", [649] = \"evfsdivRRR\",\n  [652] = \"evfscmpgtYRR\", [653] = \"evfscmpltYRR\", [654] = \"evfscmpeqYRR\",\n  [656] = \"evfscfuiR-R\", [657] = \"evfscfsiR-R\",\n  [658] = \"evfscfufR-R\", [659] = \"evfscfsfR-R\",\n  [660] = \"evfsctuiR-R\", [661] = \"evfsctsiR-R\",\n  [662] = \"evfsctufR-R\", [663] = \"evfsctsfR-R\",\n  [664] = \"evfsctuizR-R\", [666] = \"evfsctsizR-R\",\n  [668] = \"evfststgtYRR\", [669] = \"evfststltYRR\", [670] = \"evfststeqYRR\",\n\n  [704] = \"efsaddRRR\", [705] = \"efssubRRR\",\n  [708] = \"efsabsRR\", [709] = \"efsnabsRR\", [710] = \"efsnegRR\",\n  [712] = \"efsmulRRR\", [713] = \"efsdivRRR\",\n  [716] = \"efscmpgtYRR\", [717] = \"efscmpltYRR\", [718] = \"efscmpeqYRR\",\n  [719] = \"efscfdR-R\",\n  [720] = \"efscfuiR-R\", [721] = \"efscfsiR-R\",\n  [722] = \"efscfufR-R\", [723] = \"efscfsfR-R\",\n  [724] = \"efsctuiR-R\", [725] = \"efsctsiR-R\",\n  [726] = \"efsctufR-R\", [727] = \"efsctsfR-R\",\n  [728] = \"efsctuizR-R\", [730] = \"efsctsizR-R\",\n  [732] = \"efststgtYRR\", [733] = \"efststltYRR\", [734] = \"efststeqYRR\",\n\n  [736] = \"efdaddRRR\", [737] = \"efdsubRRR\",\n  [738] = \"efdcfuidR-R\", [739] = \"efdcfsidR-R\",\n  [740] = \"efdabsRR\", [741] = \"efdnabsRR\", [742] = \"efdnegRR\",\n  [744] = \"efdmulRRR\", [745] = \"efddivRRR\",\n  [746] = \"efdctuidzR-R\", [747] = \"efdctsidzR-R\",\n  [748] = \"efdcmpgtYRR\", [749] = \"efdcmpltYRR\", [750] = \"efdcmpeqYRR\",\n  [751] = \"efdcfsR-R\",\n  [752] = \"efdcfuiR-R\", [753] = \"efdcfsiR-R\",\n  [754] = \"efdcfufR-R\", [755] = \"efdcfsfR-R\",\n  [756] = \"efdctuiR-R\", [757] = \"efdctsiR-R\",\n  [758] = \"efdctufR-R\", [759] = \"efdctsfR-R\",\n  [760] = \"efdctuizR-R\", [762] = \"efdctsizR-R\",\n  [764] = \"efdtstgtYRR\", [765] = \"efdtstltYRR\", [766] = \"efdtsteqYRR\",\n\n  [768] = \"evlddxRR0R\", [769] = \"evlddRR8\",\n  [770] = \"evldwxRR0R\", [771] = \"evldwRR8\",\n  [772] = \"evldhxRR0R\", [773] = \"evldhRR8\",\n  [776] = \"evlhhesplatxRR0R\", [777] = \"evlhhesplatRR2\",\n  [780] = \"evlhhousplatxRR0R\", [781] = \"evlhhousplatRR2\",\n  [782] = \"evlhhossplatxRR0R\", [783] = \"evlhhossplatRR2\",\n  [784] = \"evlwhexRR0R\", [785] = \"evlwheRR4\",\n  [788] = \"evlwhouxRR0R\", [789] = \"evlwhouRR4\",\n  [790] = \"evlwhosxRR0R\", [791] = \"evlwhosRR4\",\n  [792] = \"evlwwsplatxRR0R\", [793] = \"evlwwsplatRR4\",\n  [796] = \"evlwhsplatxRR0R\", [797] = \"evlwhsplatRR4\",\n\n  [800] = \"evstddxRR0R\", [801] = \"evstddRR8\",\n  [802] = \"evstdwxRR0R\", [803] = \"evstdwRR8\",\n  [804] = \"evstdhxRR0R\", [805] = \"evstdhRR8\",\n  [816] = \"evstwhexRR0R\", [817] = \"evstwheRR4\",\n  [820] = \"evstwhoxRR0R\", [821] = \"evstwhoRR4\",\n  [824] = \"evstwwexRR0R\", [825] = \"evstwweRR4\",\n  [828] = \"evstwwoxRR0R\", [829] = \"evstwwoRR4\",\n\n  [1027] = \"evmhessfRRR\", [1031] = \"evmhossfRRR\", [1032] = \"evmheumiRRR\",\n  [1033] = \"evmhesmiRRR\", [1035] = \"evmhesmfRRR\", [1036] = \"evmhoumiRRR\",\n  [1037] = \"evmhosmiRRR\", [1039] = \"evmhosmfRRR\", [1059] = \"evmhessfaRRR\",\n  [1063] = \"evmhossfaRRR\", [1064] = \"evmheumiaRRR\", [1065] = \"evmhesmiaRRR\",\n  [1067] = \"evmhesmfaRRR\", [1068] = \"evmhoumiaRRR\", [1069] = \"evmhosmiaRRR\",\n  [1071] = \"evmhosmfaRRR\", [1095] = \"evmwhssfRRR\", [1096] = \"evmwlumiRRR\",\n  [1100] = \"evmwhumiRRR\", [1101] = \"evmwhsmiRRR\", [1103] = \"evmwhsmfRRR\",\n  [1107] = \"evmwssfRRR\", [1112] = \"evmwumiRRR\", [1113] = \"evmwsmiRRR\",\n  [1115] = \"evmwsmfRRR\", [1127] = \"evmwhssfaRRR\", [1128] = \"evmwlumiaRRR\",\n  [1132] = \"evmwhumiaRRR\", [1133] = \"evmwhsmiaRRR\", [1135] = \"evmwhsmfaRRR\",\n  [1139] = \"evmwssfaRRR\", [1144] = \"evmwumiaRRR\", [1145] = \"evmwsmiaRRR\",\n  [1147] = \"evmwsmfaRRR\",\n\n  [1216] = \"evaddusiaawRR\", [1217] = \"evaddssiaawRR\",\n  [1218] = \"evsubfusiaawRR\", [1219] = \"evsubfssiaawRR\",\n  [1220] = \"evmraRR\",\n  [1222] = \"evdivwsRRR\", [1223] = \"evdivwuRRR\",\n  [1224] = \"evaddumiaawRR\", [1225] = \"evaddsmiaawRR\",\n  [1226] = \"evsubfumiaawRR\", [1227] = \"evsubfsmiaawRR\",\n\n  [1280] = \"evmheusiaawRRR\", [1281] = \"evmhessiaawRRR\",\n  [1283] = \"evmhessfaawRRR\", [1284] = \"evmhousiaawRRR\",\n  [1285] = \"evmhossiaawRRR\", [1287] = \"evmhossfaawRRR\",\n  [1288] = \"evmheumiaawRRR\", [1289] = \"evmhesmiaawRRR\",\n  [1291] = \"evmhesmfaawRRR\", [1292] = \"evmhoumiaawRRR\",\n  [1293] = \"evmhosmiaawRRR\", [1295] = \"evmhosmfaawRRR\",\n  [1320] = \"evmhegumiaaRRR\", [1321] = \"evmhegsmiaaRRR\",\n  [1323] = \"evmhegsmfaaRRR\", [1324] = \"evmhogumiaaRRR\",\n  [1325] = \"evmhogsmiaaRRR\", [1327] = \"evmhogsmfaaRRR\",\n  [1344] = \"evmwlusiaawRRR\", [1345] = \"evmwlssiaawRRR\",\n  [1352] = \"evmwlumiaawRRR\", [1353] = \"evmwlsmiaawRRR\",\n  [1363] = \"evmwssfaaRRR\", [1368] = \"evmwumiaaRRR\",\n  [1369] = \"evmwsmiaaRRR\", [1371] = \"evmwsmfaaRRR\",\n  [1408] = \"evmheusianwRRR\", [1409] = \"evmhessianwRRR\",\n  [1411] = \"evmhessfanwRRR\", [1412] = \"evmhousianwRRR\",\n  [1413] = \"evmhossianwRRR\", [1415] = \"evmhossfanwRRR\",\n  [1416] = \"evmheumianwRRR\", [1417] = \"evmhesmianwRRR\",\n  [1419] = \"evmhesmfanwRRR\", [1420] = \"evmhoumianwRRR\",\n  [1421] = \"evmhosmianwRRR\", [1423] = \"evmhosmfanwRRR\",\n  [1448] = \"evmhegumianRRR\", [1449] = \"evmhegsmianRRR\",\n  [1451] = \"evmhegsmfanRRR\", [1452] = \"evmhogumianRRR\",\n  [1453] = \"evmhogsmianRRR\", [1455] = \"evmhogsmfanRRR\",\n  [1472] = \"evmwlusianwRRR\", [1473] = \"evmwlssianwRRR\",\n  [1480] = \"evmwlumianwRRR\", [1481] = \"evmwlsmianwRRR\",\n  [1491] = \"evmwssfanRRR\", [1496] = \"evmwumianRRR\",\n  [1497] = \"evmwsmianRRR\", [1499] = \"evmwsmfanRRR\",\n}\n\nlocal map_pri = {\n  [0] = false,\tfalse,\t\t\"tdiARI\",\t\"twiARI\",\n  map_spe,\tfalse,\t\tfalse,\t\t\"mulliRRI\",\n  \"subficRRI\",\tfalse,\t\t\"cmpl_iYLRU\",\t\"cmp_iYLRI\",\n  \"addicRRI\",\t\"addic.RRI\",\t\"addi|liRR0I\",\t\"addis|lisRR0I\",\n  \"b_KBJ\",\t\"sc\",\t\t \"bKJ\",\t\tmap_crops,\n  \"rlwimiRR~AAA.\", map_rlwinm,\tfalse,\t\t\"rlwnmRR~RAA.\",\n  \"oriNRR~U\",\t\"orisRR~U\",\t\"xoriRR~U\",\t\"xorisRR~U\",\n  \"andi.RR~U\",\t\"andis.RR~U\",\tmap_rld,\tmap_ext,\n  \"lwzRRD\",\t\"lwzuRRD\",\t\"lbzRRD\",\t\"lbzuRRD\",\n  \"stwRRD\",\t\"stwuRRD\",\t\"stbRRD\",\t\"stbuRRD\",\n  \"lhzRRD\",\t\"lhzuRRD\",\t\"lhaRRD\",\t\"lhauRRD\",\n  \"sthRRD\",\t\"sthuRRD\",\t\"lmwRRD\",\t\"stmwRRD\",\n  \"lfsFRD\",\t\"lfsuFRD\",\t\"lfdFRD\",\t\"lfduFRD\",\n  \"stfsFRD\",\t\"stfsuFRD\",\t\"stfdFRD\",\t\"stfduFRD\",\n  false,\tfalse,\t\tmap_ld,\t\tmap_fps,\n  false,\tfalse,\t\tmap_std,\tmap_fpd,\n}\n\n------------------------------------------------------------------------------\n\nlocal map_gpr = {\n  [0] = \"r0\", \"sp\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\",\n  \"r16\", \"r17\", \"r18\", \"r19\", \"r20\", \"r21\", \"r22\", \"r23\",\n  \"r24\", \"r25\", \"r26\", \"r27\", \"r28\", \"r29\", \"r30\", \"r31\",\n}\n\nlocal map_cond = { [0] = \"lt\", \"gt\", \"eq\", \"so\", \"ge\", \"le\", \"ne\", \"ns\", }\n\n-- Format a condition bit.\nlocal function condfmt(cond)\n  if cond <= 3 then\n    return map_cond[band(cond, 3)]\n  else\n    return format(\"4*cr%d+%s\", rshift(cond, 2), map_cond[band(cond, 3)])\n  end\nend\n\n------------------------------------------------------------------------------\n\n-- Output a nicely formatted line with an opcode and operands.\nlocal function putop(ctx, text, operands)\n  local pos = ctx.pos\n  local extra = \"\"\n  if ctx.rel then\n    local sym = ctx.symtab[ctx.rel]\n    if sym then extra = \"\\t->\"..sym end\n  end\n  if ctx.hexdump > 0 then\n    ctx.out(format(\"%08x  %s  %-7s %s%s\\n\",\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\n  else\n    ctx.out(format(\"%08x  %-7s %s%s\\n\",\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\n  end\n  ctx.pos = pos + 4\nend\n\n-- Fallback for unknown opcodes.\nlocal function unknown(ctx)\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\nend\n\n-- Disassemble a single instruction.\nlocal function disass_ins(ctx)\n  local pos = ctx.pos\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\n  local op = bor(lshift(b0, 24), lshift(b1, 16), lshift(b2, 8), b3)\n  local operands = {}\n  local last = nil\n  local rs = 21\n  ctx.op = op\n  ctx.rel = nil\n\n  local opat = map_pri[rshift(b0, 2)]\n  while type(opat) ~= \"string\" do\n    if not opat then return unknown(ctx) end\n    opat = opat[band(rshift(op, opat.shift), opat.mask)]\n  end\n  local name, pat = match(opat, \"^([a-z0-9_.]*)(.*)\")\n  local altname, pat2 = match(pat, \"|([a-z0-9_.]*)(.*)\")\n  if altname then pat = pat2 end\n\n  for p in gmatch(pat, \".\") do\n    local x = nil\n    if p == \"R\" then\n      x = map_gpr[band(rshift(op, rs), 31)]\n      rs = rs - 5\n    elseif p == \"F\" then\n      x = \"f\"..band(rshift(op, rs), 31)\n      rs = rs - 5\n    elseif p == \"A\" then\n      x = band(rshift(op, rs), 31)\n      rs = rs - 5\n    elseif p == \"S\" then\n      x = arshift(lshift(op, 27-rs), 27)\n      rs = rs - 5\n    elseif p == \"I\" then\n      x = arshift(lshift(op, 16), 16)\n    elseif p == \"U\" then\n      x = band(op, 0xffff)\n    elseif p == \"D\" or p == \"E\" then\n      local disp = arshift(lshift(op, 16), 16)\n      if p == \"E\" then disp = band(disp, -4) end\n      if last == \"r0\" then last = \"0\" end\n      operands[#operands] = format(\"%d(%s)\", disp, last)\n    elseif p >= \"2\" and p <= \"8\" then\n      local disp = band(rshift(op, rs), 31) * p\n      if last == \"r0\" then last = \"0\" end\n      operands[#operands] = format(\"%d(%s)\", disp, last)\n    elseif p == \"H\" then\n      x = band(rshift(op, rs), 31) + lshift(band(op, 2), 4)\n      rs = rs - 5\n    elseif p == \"M\" then\n      x = band(rshift(op, rs), 31) + band(op, 0x20)\n    elseif p == \"C\" then\n      x = condfmt(band(rshift(op, rs), 31))\n      rs = rs - 5\n    elseif p == \"B\" then\n      local bo = rshift(op, 21)\n      local cond = band(rshift(op, 16), 31)\n      local cn = \"\"\n      rs = rs - 10\n      if band(bo, 4) == 0 then\n\tcn = band(bo, 2) == 0 and \"dnz\" or \"dz\"\n\tif band(bo, 0x10) == 0 then\n\t  cn = cn..(band(bo, 8) == 0 and \"f\" or \"t\")\n\tend\n\tif band(bo, 0x10) == 0 then x = condfmt(cond) end\n\tname = name..(band(bo, 1) == band(rshift(op, 15), 1) and \"-\" or \"+\")\n      elseif band(bo, 0x10) == 0 then\n\tcn = map_cond[band(cond, 3) + (band(bo, 8) == 0 and 4 or 0)]\n\tif cond > 3 then x = \"cr\"..rshift(cond, 2) end\n\tname = name..(band(bo, 1) == band(rshift(op, 15), 1) and \"-\" or \"+\")\n      end\n      name = gsub(name, \"_\", cn)\n    elseif p == \"J\" then\n      x = arshift(lshift(op, 27-rs), 29-rs)*4\n      if band(op, 2) == 0 then x = ctx.addr + pos + x end\n      ctx.rel = x\n      x = \"0x\"..tohex(x)\n    elseif p == \"K\" then\n      if band(op, 1) ~= 0 then name = name..\"l\" end\n      if band(op, 2) ~= 0 then name = name..\"a\" end\n    elseif p == \"X\" or p == \"Y\" then\n      x = band(rshift(op, rs+2), 7)\n      if x == 0 and p == \"Y\" then x = nil else x = \"cr\"..x end\n      rs = rs - 5\n    elseif p == \"W\" then\n      x = \"cr\"..band(op, 7)\n    elseif p == \"Z\" then\n      x = band(rshift(op, rs-4), 255)\n      rs = rs - 10\n    elseif p == \">\" then\n      operands[#operands] = rshift(operands[#operands], 1)\n    elseif p == \"0\" then\n      if last == \"r0\" then\n\toperands[#operands] = nil\n\tif altname then name = altname end\n      end\n    elseif p == \"L\" then\n      name = gsub(name, \"_\", band(op, 0x00200000) ~= 0 and \"d\" or \"w\")\n    elseif p == \".\" then\n      if band(op, 1) == 1 then name = name..\".\" end\n    elseif p == \"N\" then\n      if op == 0x60000000 then name = \"nop\"; break end\n    elseif p == \"~\" then\n      local n = #operands\n      operands[n-1],  operands[n] = operands[n], operands[n-1]\n    elseif p == \"=\" then\n      local n = #operands\n      if last == operands[n-1] then\n\toperands[n] = nil\n\tname = altname\n      end\n    elseif p == \"%\" then\n      local n = #operands\n      if last == operands[n-1] and last == operands[n-2] then\n\toperands[n] = nil\n\toperands[n-1] = nil\n\tname = altname\n      end\n    elseif p == \"-\" then\n      rs = rs - 5\n    else\n      assert(false)\n    end\n    if x then operands[#operands+1] = x; last = x end\n  end\n\n  return putop(ctx, name, operands)\nend\n\n------------------------------------------------------------------------------\n\n-- Disassemble a block of code.\nlocal function disass_block(ctx, ofs, len)\n  if not ofs then ofs = 0 end\n  local stop = len and ofs+len or #ctx.code\n  stop = stop - stop % 4\n  ctx.pos = ofs - ofs % 4\n  ctx.rel = nil\n  while ctx.pos < stop do disass_ins(ctx) end\nend\n\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\nlocal function create_(code, addr, out)\n  local ctx = {}\n  ctx.code = code\n  ctx.addr = addr or 0\n  ctx.out = out or io.write\n  ctx.symtab = {}\n  ctx.disass = disass_block\n  ctx.hexdump = 8\n  return ctx\nend\n\n-- Simple API: disassemble code (a string) at address and output via out.\nlocal function disass_(code, addr, out)\n  create_(code, addr, out):disass()\nend\n\n-- Return register name for RID.\nlocal function regname_(r)\n  if r < 32 then return map_gpr[r] end\n  return \"f\"..(r-32)\nend\n\n-- Public module functions.\nmodule(...)\n\ncreate = create_\ndisass = disass_\nregname = regname_\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_x64.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT x64 disassembler wrapper module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This module just exports the 64 bit functions from the combined\n-- x86/x64 disassembler module. All the interesting stuff is there.\n------------------------------------------------------------------------------\n\nlocal require = require\n\nmodule(...)\n\nlocal dis_x86 = require(_PACKAGE..\"dis_x86\")\n\ncreate = dis_x86.create64\ndisass = dis_x86.disass64\nregname = dis_x86.regname64\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dis_x86.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT x86/x64 disassembler module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n-- This is a helper module used by the LuaJIT machine code dumper module.\n--\n-- Sending small code snippets to an external disassembler and mixing the\n-- output with our own stuff was too fragile. So I had to bite the bullet\n-- and write yet another x86 disassembler. Oh well ...\n--\n-- The output format is very similar to what ndisasm generates. But it has\n-- been developed independently by looking at the opcode tables from the\n-- Intel and AMD manuals. The supported instruction set is quite extensive\n-- and reflects what a current generation Intel or AMD CPU implements in\n-- 32 bit and 64 bit mode. Yes, this includes MMX, SSE, SSE2, SSE3, SSSE3,\n-- SSE4.1, SSE4.2, SSE4a and even privileged and hypervisor (VMX/SVM)\n-- instructions.\n--\n-- Notes:\n-- * The (useless) a16 prefix, 3DNow and pre-586 opcodes are unsupported.\n-- * No attempt at optimization has been made -- it's fast enough for my needs.\n-- * The public API may change when more architectures are added.\n------------------------------------------------------------------------------\n\nlocal type = type\nlocal sub, byte, format = string.sub, string.byte, string.format\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\nlocal lower, rep = string.lower, string.rep\n\n-- Map for 1st opcode byte in 32 bit mode. Ugly? Well ... read on.\nlocal map_opc1_32 = {\n--0x\n[0]=\"addBmr\",\"addVmr\",\"addBrm\",\"addVrm\",\"addBai\",\"addVai\",\"push es\",\"pop es\",\n\"orBmr\",\"orVmr\",\"orBrm\",\"orVrm\",\"orBai\",\"orVai\",\"push cs\",\"opc2*\",\n--1x\n\"adcBmr\",\"adcVmr\",\"adcBrm\",\"adcVrm\",\"adcBai\",\"adcVai\",\"push ss\",\"pop ss\",\n\"sbbBmr\",\"sbbVmr\",\"sbbBrm\",\"sbbVrm\",\"sbbBai\",\"sbbVai\",\"push ds\",\"pop ds\",\n--2x\n\"andBmr\",\"andVmr\",\"andBrm\",\"andVrm\",\"andBai\",\"andVai\",\"es:seg\",\"daa\",\n\"subBmr\",\"subVmr\",\"subBrm\",\"subVrm\",\"subBai\",\"subVai\",\"cs:seg\",\"das\",\n--3x\n\"xorBmr\",\"xorVmr\",\"xorBrm\",\"xorVrm\",\"xorBai\",\"xorVai\",\"ss:seg\",\"aaa\",\n\"cmpBmr\",\"cmpVmr\",\"cmpBrm\",\"cmpVrm\",\"cmpBai\",\"cmpVai\",\"ds:seg\",\"aas\",\n--4x\n\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\n\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\n--5x\n\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\n\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\n--6x\n\"sz*pushaw,pusha\",\"sz*popaw,popa\",\"boundVrm\",\"arplWmr\",\n\"fs:seg\",\"gs:seg\",\"o16:\",\"a16\",\n\"pushUi\",\"imulVrmi\",\"pushBs\",\"imulVrms\",\n\"insb\",\"insVS\",\"outsb\",\"outsVS\",\n--7x\n\"joBj\",\"jnoBj\",\"jbBj\",\"jnbBj\",\"jzBj\",\"jnzBj\",\"jbeBj\",\"jaBj\",\n\"jsBj\",\"jnsBj\",\"jpeBj\",\"jpoBj\",\"jlBj\",\"jgeBj\",\"jleBj\",\"jgBj\",\n--8x\n\"arith!Bmi\",\"arith!Vmi\",\"arith!Bmi\",\"arith!Vms\",\n\"testBmr\",\"testVmr\",\"xchgBrm\",\"xchgVrm\",\n\"movBmr\",\"movVmr\",\"movBrm\",\"movVrm\",\n\"movVmg\",\"leaVrm\",\"movWgm\",\"popUm\",\n--9x\n\"nop*xchgVaR|pause|xchgWaR|repne nop\",\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\n\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\n\"sz*cbw,cwde,cdqe\",\"sz*cwd,cdq,cqo\",\"call farViw\",\"wait\",\n\"sz*pushfw,pushf\",\"sz*popfw,popf\",\"sahf\",\"lahf\",\n--Ax\n\"movBao\",\"movVao\",\"movBoa\",\"movVoa\",\n\"movsb\",\"movsVS\",\"cmpsb\",\"cmpsVS\",\n\"testBai\",\"testVai\",\"stosb\",\"stosVS\",\n\"lodsb\",\"lodsVS\",\"scasb\",\"scasVS\",\n--Bx\n\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\n\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\n--Cx\n\"shift!Bmu\",\"shift!Vmu\",\"retBw\",\"ret\",\"$lesVrm\",\"$ldsVrm\",\"movBmi\",\"movVmi\",\n\"enterBwu\",\"leave\",\"retfBw\",\"retf\",\"int3\",\"intBu\",\"into\",\"iretVS\",\n--Dx\n\"shift!Bm1\",\"shift!Vm1\",\"shift!Bmc\",\"shift!Vmc\",\"aamBu\",\"aadBu\",\"salc\",\"xlatb\",\n\"fp*0\",\"fp*1\",\"fp*2\",\"fp*3\",\"fp*4\",\"fp*5\",\"fp*6\",\"fp*7\",\n--Ex\n\"loopneBj\",\"loopeBj\",\"loopBj\",\"sz*jcxzBj,jecxzBj,jrcxzBj\",\n\"inBau\",\"inVau\",\"outBua\",\"outVua\",\n\"callVj\",\"jmpVj\",\"jmp farViw\",\"jmpBj\",\"inBad\",\"inVad\",\"outBda\",\"outVda\",\n--Fx\n\"lock:\",\"int1\",\"repne:rep\",\"rep:\",\"hlt\",\"cmc\",\"testb!Bm\",\"testv!Vm\",\n\"clc\",\"stc\",\"cli\",\"sti\",\"cld\",\"std\",\"incb!Bm\",\"incd!Vm\",\n}\nassert(#map_opc1_32 == 255)\n\n-- Map for 1st opcode byte in 64 bit mode (overrides only).\nlocal map_opc1_64 = setmetatable({\n  [0x06]=false, [0x07]=false, [0x0e]=false,\n  [0x16]=false, [0x17]=false, [0x1e]=false, [0x1f]=false,\n  [0x27]=false, [0x2f]=false, [0x37]=false, [0x3f]=false,\n  [0x60]=false, [0x61]=false, [0x62]=false, [0x63]=\"movsxdVrDmt\", [0x67]=\"a32:\",\n  [0x40]=\"rex*\",   [0x41]=\"rex*b\",   [0x42]=\"rex*x\",   [0x43]=\"rex*xb\",\n  [0x44]=\"rex*r\",  [0x45]=\"rex*rb\",  [0x46]=\"rex*rx\",  [0x47]=\"rex*rxb\",\n  [0x48]=\"rex*w\",  [0x49]=\"rex*wb\",  [0x4a]=\"rex*wx\",  [0x4b]=\"rex*wxb\",\n  [0x4c]=\"rex*wr\", [0x4d]=\"rex*wrb\", [0x4e]=\"rex*wrx\", [0x4f]=\"rex*wrxb\",\n  [0x82]=false, [0x9a]=false, [0xc4]=false, [0xc5]=false, [0xce]=false,\n  [0xd4]=false, [0xd5]=false, [0xd6]=false, [0xea]=false,\n}, { __index = map_opc1_32 })\n\n-- Map for 2nd opcode byte (0F xx). True CISC hell. Hey, I told you.\n-- Prefix dependent MMX/SSE opcodes: (none)|rep|o16|repne, -|F3|66|F2\nlocal map_opc2 = {\n--0x\n[0]=\"sldt!Dmp\",\"sgdt!Ump\",\"larVrm\",\"lslVrm\",nil,\"syscall\",\"clts\",\"sysret\",\n\"invd\",\"wbinvd\",nil,\"ud1\",nil,\"$prefetch!Bm\",\"femms\",\"3dnowMrmu\",\n--1x\n\"movupsXrm|movssXrm|movupdXrm|movsdXrm\",\n\"movupsXmr|movssXmr|movupdXmr|movsdXmr\",\n\"movhlpsXrm$movlpsXrm|movsldupXrm|movlpdXrm|movddupXrm\",\n\"movlpsXmr||movlpdXmr\",\n\"unpcklpsXrm||unpcklpdXrm\",\n\"unpckhpsXrm||unpckhpdXrm\",\n\"movlhpsXrm$movhpsXrm|movshdupXrm|movhpdXrm\",\n\"movhpsXmr||movhpdXmr\",\n\"$prefetcht!Bm\",\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\n\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\n--2x\n\"movUmx$\",\"movUmy$\",\"movUxm$\",\"movUym$\",\"movUmz$\",nil,\"movUzm$\",nil,\n\"movapsXrm||movapdXrm\",\n\"movapsXmr||movapdXmr\",\n\"cvtpi2psXrMm|cvtsi2ssXrVmt|cvtpi2pdXrMm|cvtsi2sdXrVmt\",\n\"movntpsXmr|movntssXmr|movntpdXmr|movntsdXmr\",\n\"cvttps2piMrXm|cvttss2siVrXm|cvttpd2piMrXm|cvttsd2siVrXm\",\n\"cvtps2piMrXm|cvtss2siVrXm|cvtpd2piMrXm|cvtsd2siVrXm\",\n\"ucomissXrm||ucomisdXrm\",\n\"comissXrm||comisdXrm\",\n--3x\n\"wrmsr\",\"rdtsc\",\"rdmsr\",\"rdpmc\",\"sysenter\",\"sysexit\",nil,\"getsec\",\n\"opc3*38\",nil,\"opc3*3a\",nil,nil,nil,nil,nil,\n--4x\n\"cmovoVrm\",\"cmovnoVrm\",\"cmovbVrm\",\"cmovnbVrm\",\n\"cmovzVrm\",\"cmovnzVrm\",\"cmovbeVrm\",\"cmovaVrm\",\n\"cmovsVrm\",\"cmovnsVrm\",\"cmovpeVrm\",\"cmovpoVrm\",\n\"cmovlVrm\",\"cmovgeVrm\",\"cmovleVrm\",\"cmovgVrm\",\n--5x\n\"movmskpsVrXm$||movmskpdVrXm$\",\"sqrtpsXrm|sqrtssXrm|sqrtpdXrm|sqrtsdXrm\",\n\"rsqrtpsXrm|rsqrtssXrm\",\"rcppsXrm|rcpssXrm\",\n\"andpsXrm||andpdXrm\",\"andnpsXrm||andnpdXrm\",\n\"orpsXrm||orpdXrm\",\"xorpsXrm||xorpdXrm\",\n\"addpsXrm|addssXrm|addpdXrm|addsdXrm\",\"mulpsXrm|mulssXrm|mulpdXrm|mulsdXrm\",\n\"cvtps2pdXrm|cvtss2sdXrm|cvtpd2psXrm|cvtsd2ssXrm\",\n\"cvtdq2psXrm|cvttps2dqXrm|cvtps2dqXrm\",\n\"subpsXrm|subssXrm|subpdXrm|subsdXrm\",\"minpsXrm|minssXrm|minpdXrm|minsdXrm\",\n\"divpsXrm|divssXrm|divpdXrm|divsdXrm\",\"maxpsXrm|maxssXrm|maxpdXrm|maxsdXrm\",\n--6x\n\"punpcklbwPrm\",\"punpcklwdPrm\",\"punpckldqPrm\",\"packsswbPrm\",\n\"pcmpgtbPrm\",\"pcmpgtwPrm\",\"pcmpgtdPrm\",\"packuswbPrm\",\n\"punpckhbwPrm\",\"punpckhwdPrm\",\"punpckhdqPrm\",\"packssdwPrm\",\n\"||punpcklqdqXrm\",\"||punpckhqdqXrm\",\n\"movPrVSm\",\"movqMrm|movdquXrm|movdqaXrm\",\n--7x\n\"pshufwMrmu|pshufhwXrmu|pshufdXrmu|pshuflwXrmu\",\"pshiftw!Pmu\",\n\"pshiftd!Pmu\",\"pshiftq!Mmu||pshiftdq!Xmu\",\n\"pcmpeqbPrm\",\"pcmpeqwPrm\",\"pcmpeqdPrm\",\"emms|\",\n\"vmreadUmr||extrqXmuu$|insertqXrmuu$\",\"vmwriteUrm||extrqXrm$|insertqXrm$\",\nnil,nil,\n\"||haddpdXrm|haddpsXrm\",\"||hsubpdXrm|hsubpsXrm\",\n\"movVSmMr|movqXrm|movVSmXr\",\"movqMmr|movdquXmr|movdqaXmr\",\n--8x\n\"joVj\",\"jnoVj\",\"jbVj\",\"jnbVj\",\"jzVj\",\"jnzVj\",\"jbeVj\",\"jaVj\",\n\"jsVj\",\"jnsVj\",\"jpeVj\",\"jpoVj\",\"jlVj\",\"jgeVj\",\"jleVj\",\"jgVj\",\n--9x\n\"setoBm\",\"setnoBm\",\"setbBm\",\"setnbBm\",\"setzBm\",\"setnzBm\",\"setbeBm\",\"setaBm\",\n\"setsBm\",\"setnsBm\",\"setpeBm\",\"setpoBm\",\"setlBm\",\"setgeBm\",\"setleBm\",\"setgBm\",\n--Ax\n\"push fs\",\"pop fs\",\"cpuid\",\"btVmr\",\"shldVmru\",\"shldVmrc\",nil,nil,\n\"push gs\",\"pop gs\",\"rsm\",\"btsVmr\",\"shrdVmru\",\"shrdVmrc\",\"fxsave!Dmp\",\"imulVrm\",\n--Bx\n\"cmpxchgBmr\",\"cmpxchgVmr\",\"$lssVrm\",\"btrVmr\",\n\"$lfsVrm\",\"$lgsVrm\",\"movzxVrBmt\",\"movzxVrWmt\",\n\"|popcntVrm\",\"ud2Dp\",\"bt!Vmu\",\"btcVmr\",\n\"bsfVrm\",\"bsrVrm|lzcntVrm|bsrWrm\",\"movsxVrBmt\",\"movsxVrWmt\",\n--Cx\n\"xaddBmr\",\"xaddVmr\",\n\"cmppsXrmu|cmpssXrmu|cmppdXrmu|cmpsdXrmu\",\"$movntiVmr|\",\n\"pinsrwPrWmu\",\"pextrwDrPmu\",\n\"shufpsXrmu||shufpdXrmu\",\"$cmpxchg!Qmp\",\n\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\n--Dx\n\"||addsubpdXrm|addsubpsXrm\",\"psrlwPrm\",\"psrldPrm\",\"psrlqPrm\",\n\"paddqPrm\",\"pmullwPrm\",\n\"|movq2dqXrMm|movqXmr|movdq2qMrXm$\",\"pmovmskbVrMm||pmovmskbVrXm\",\n\"psubusbPrm\",\"psubuswPrm\",\"pminubPrm\",\"pandPrm\",\n\"paddusbPrm\",\"padduswPrm\",\"pmaxubPrm\",\"pandnPrm\",\n--Ex\n\"pavgbPrm\",\"psrawPrm\",\"psradPrm\",\"pavgwPrm\",\n\"pmulhuwPrm\",\"pmulhwPrm\",\n\"|cvtdq2pdXrm|cvttpd2dqXrm|cvtpd2dqXrm\",\"$movntqMmr||$movntdqXmr\",\n\"psubsbPrm\",\"psubswPrm\",\"pminswPrm\",\"porPrm\",\n\"paddsbPrm\",\"paddswPrm\",\"pmaxswPrm\",\"pxorPrm\",\n--Fx\n\"|||lddquXrm\",\"psllwPrm\",\"pslldPrm\",\"psllqPrm\",\n\"pmuludqPrm\",\"pmaddwdPrm\",\"psadbwPrm\",\"maskmovqMrm||maskmovdquXrm$\",\n\"psubbPrm\",\"psubwPrm\",\"psubdPrm\",\"psubqPrm\",\n\"paddbPrm\",\"paddwPrm\",\"padddPrm\",\"ud\",\n}\nassert(map_opc2[255] == \"ud\")\n\n-- Map for three-byte opcodes. Can't wait for their next invention.\nlocal map_opc3 = {\n[\"38\"] = { -- [66] 0f 38 xx\n--0x\n[0]=\"pshufbPrm\",\"phaddwPrm\",\"phadddPrm\",\"phaddswPrm\",\n\"pmaddubswPrm\",\"phsubwPrm\",\"phsubdPrm\",\"phsubswPrm\",\n\"psignbPrm\",\"psignwPrm\",\"psigndPrm\",\"pmulhrswPrm\",\nnil,nil,nil,nil,\n--1x\n\"||pblendvbXrma\",nil,nil,nil,\n\"||blendvpsXrma\",\"||blendvpdXrma\",nil,\"||ptestXrm\",\nnil,nil,nil,nil,\n\"pabsbPrm\",\"pabswPrm\",\"pabsdPrm\",nil,\n--2x\n\"||pmovsxbwXrm\",\"||pmovsxbdXrm\",\"||pmovsxbqXrm\",\"||pmovsxwdXrm\",\n\"||pmovsxwqXrm\",\"||pmovsxdqXrm\",nil,nil,\n\"||pmuldqXrm\",\"||pcmpeqqXrm\",\"||$movntdqaXrm\",\"||packusdwXrm\",\nnil,nil,nil,nil,\n--3x\n\"||pmovzxbwXrm\",\"||pmovzxbdXrm\",\"||pmovzxbqXrm\",\"||pmovzxwdXrm\",\n\"||pmovzxwqXrm\",\"||pmovzxdqXrm\",nil,\"||pcmpgtqXrm\",\n\"||pminsbXrm\",\"||pminsdXrm\",\"||pminuwXrm\",\"||pminudXrm\",\n\"||pmaxsbXrm\",\"||pmaxsdXrm\",\"||pmaxuwXrm\",\"||pmaxudXrm\",\n--4x\n\"||pmulddXrm\",\"||phminposuwXrm\",\n--Fx\n[0xf0] = \"|||crc32TrBmt\",[0xf1] = \"|||crc32TrVmt\",\n},\n\n[\"3a\"] = { -- [66] 0f 3a xx\n--0x\n[0x00]=nil,nil,nil,nil,nil,nil,nil,nil,\n\"||roundpsXrmu\",\"||roundpdXrmu\",\"||roundssXrmu\",\"||roundsdXrmu\",\n\"||blendpsXrmu\",\"||blendpdXrmu\",\"||pblendwXrmu\",\"palignrPrmu\",\n--1x\nnil,nil,nil,nil,\n\"||pextrbVmXru\",\"||pextrwVmXru\",\"||pextrVmSXru\",\"||extractpsVmXru\",\nnil,nil,nil,nil,nil,nil,nil,nil,\n--2x\n\"||pinsrbXrVmu\",\"||insertpsXrmu\",\"||pinsrXrVmuS\",nil,\n--4x\n[0x40] = \"||dppsXrmu\",\n[0x41] = \"||dppdXrmu\",\n[0x42] = \"||mpsadbwXrmu\",\n--6x\n[0x60] = \"||pcmpestrmXrmu\",[0x61] = \"||pcmpestriXrmu\",\n[0x62] = \"||pcmpistrmXrmu\",[0x63] = \"||pcmpistriXrmu\",\n},\n}\n\n-- Map for VMX/SVM opcodes 0F 01 C0-FF (sgdt group with register operands).\nlocal map_opcvm = {\n[0xc1]=\"vmcall\",[0xc2]=\"vmlaunch\",[0xc3]=\"vmresume\",[0xc4]=\"vmxoff\",\n[0xc8]=\"monitor\",[0xc9]=\"mwait\",\n[0xd8]=\"vmrun\",[0xd9]=\"vmmcall\",[0xda]=\"vmload\",[0xdb]=\"vmsave\",\n[0xdc]=\"stgi\",[0xdd]=\"clgi\",[0xde]=\"skinit\",[0xdf]=\"invlpga\",\n[0xf8]=\"swapgs\",[0xf9]=\"rdtscp\",\n}\n\n-- Map for FP opcodes. And you thought stack machines are simple?\nlocal map_opcfp = {\n-- D8-DF 00-BF: opcodes with a memory operand.\n-- D8\n[0]=\"faddFm\",\"fmulFm\",\"fcomFm\",\"fcompFm\",\"fsubFm\",\"fsubrFm\",\"fdivFm\",\"fdivrFm\",\n\"fldFm\",nil,\"fstFm\",\"fstpFm\",\"fldenvVm\",\"fldcwWm\",\"fnstenvVm\",\"fnstcwWm\",\n-- DA\n\"fiaddDm\",\"fimulDm\",\"ficomDm\",\"ficompDm\",\n\"fisubDm\",\"fisubrDm\",\"fidivDm\",\"fidivrDm\",\n-- DB\n\"fildDm\",\"fisttpDm\",\"fistDm\",\"fistpDm\",nil,\"fld twordFmp\",nil,\"fstp twordFmp\",\n-- DC\n\"faddGm\",\"fmulGm\",\"fcomGm\",\"fcompGm\",\"fsubGm\",\"fsubrGm\",\"fdivGm\",\"fdivrGm\",\n-- DD\n\"fldGm\",\"fisttpQm\",\"fstGm\",\"fstpGm\",\"frstorDmp\",nil,\"fnsaveDmp\",\"fnstswWm\",\n-- DE\n\"fiaddWm\",\"fimulWm\",\"ficomWm\",\"ficompWm\",\n\"fisubWm\",\"fisubrWm\",\"fidivWm\",\"fidivrWm\",\n-- DF\n\"fildWm\",\"fisttpWm\",\"fistWm\",\"fistpWm\",\n\"fbld twordFmp\",\"fildQm\",\"fbstp twordFmp\",\"fistpQm\",\n-- xx C0-FF: opcodes with a pseudo-register operand.\n-- D8\n\"faddFf\",\"fmulFf\",\"fcomFf\",\"fcompFf\",\"fsubFf\",\"fsubrFf\",\"fdivFf\",\"fdivrFf\",\n-- D9\n\"fldFf\",\"fxchFf\",{\"fnop\"},nil,\n{\"fchs\",\"fabs\",nil,nil,\"ftst\",\"fxam\"},\n{\"fld1\",\"fldl2t\",\"fldl2e\",\"fldpi\",\"fldlg2\",\"fldln2\",\"fldz\"},\n{\"f2xm1\",\"fyl2x\",\"fptan\",\"fpatan\",\"fxtract\",\"fprem1\",\"fdecstp\",\"fincstp\"},\n{\"fprem\",\"fyl2xp1\",\"fsqrt\",\"fsincos\",\"frndint\",\"fscale\",\"fsin\",\"fcos\"},\n-- DA\n\"fcmovbFf\",\"fcmoveFf\",\"fcmovbeFf\",\"fcmovuFf\",nil,{nil,\"fucompp\"},nil,nil,\n-- DB\n\"fcmovnbFf\",\"fcmovneFf\",\"fcmovnbeFf\",\"fcmovnuFf\",\n{nil,nil,\"fnclex\",\"fninit\"},\"fucomiFf\",\"fcomiFf\",nil,\n-- DC\n\"fadd toFf\",\"fmul toFf\",nil,nil,\n\"fsub toFf\",\"fsubr toFf\",\"fdivr toFf\",\"fdiv toFf\",\n-- DD\n\"ffreeFf\",nil,\"fstFf\",\"fstpFf\",\"fucomFf\",\"fucompFf\",nil,nil,\n-- DE\n\"faddpFf\",\"fmulpFf\",nil,{nil,\"fcompp\"},\n\"fsubrpFf\",\"fsubpFf\",\"fdivrpFf\",\"fdivpFf\",\n-- DF\nnil,nil,nil,nil,{\"fnstsw ax\"},\"fucomipFf\",\"fcomipFf\",nil,\n}\nassert(map_opcfp[126] == \"fcomipFf\")\n\n-- Map for opcode groups. The subkey is sp from the ModRM byte.\nlocal map_opcgroup = {\n  arith = { \"add\", \"or\", \"adc\", \"sbb\", \"and\", \"sub\", \"xor\", \"cmp\" },\n  shift = { \"rol\", \"ror\", \"rcl\", \"rcr\", \"shl\", \"shr\", \"sal\", \"sar\" },\n  testb = { \"testBmi\", \"testBmi\", \"not\", \"neg\", \"mul\", \"imul\", \"div\", \"idiv\" },\n  testv = { \"testVmi\", \"testVmi\", \"not\", \"neg\", \"mul\", \"imul\", \"div\", \"idiv\" },\n  incb = { \"inc\", \"dec\" },\n  incd = { \"inc\", \"dec\", \"callUmp\", \"$call farDmp\",\n\t   \"jmpUmp\", \"$jmp farDmp\", \"pushUm\" },\n  sldt = { \"sldt\", \"str\", \"lldt\", \"ltr\", \"verr\", \"verw\" },\n  sgdt = { \"vm*$sgdt\", \"vm*$sidt\", \"$lgdt\", \"vm*$lidt\",\n\t   \"smsw\", nil, \"lmsw\", \"vm*$invlpg\" },\n  bt = { nil, nil, nil, nil, \"bt\", \"bts\", \"btr\", \"btc\" },\n  cmpxchg = { nil, \"sz*,cmpxchg8bQmp,cmpxchg16bXmp\", nil, nil,\n\t      nil, nil, \"vmptrld|vmxon|vmclear\", \"vmptrst\" },\n  pshiftw = { nil, nil, \"psrlw\", nil, \"psraw\", nil, \"psllw\" },\n  pshiftd = { nil, nil, \"psrld\", nil, \"psrad\", nil, \"pslld\" },\n  pshiftq = { nil, nil, \"psrlq\", nil, nil, nil, \"psllq\" },\n  pshiftdq = { nil, nil, \"psrlq\", \"psrldq\", nil, nil, \"psllq\", \"pslldq\" },\n  fxsave = { \"$fxsave\", \"$fxrstor\", \"$ldmxcsr\", \"$stmxcsr\",\n\t     nil, \"lfenceDp$\", \"mfenceDp$\", \"sfenceDp$clflush\" },\n  prefetch = { \"prefetch\", \"prefetchw\" },\n  prefetcht = { \"prefetchnta\", \"prefetcht0\", \"prefetcht1\", \"prefetcht2\" },\n}\n\n------------------------------------------------------------------------------\n\n-- Maps for register names.\nlocal map_regs = {\n  B = { \"al\", \"cl\", \"dl\", \"bl\", \"ah\", \"ch\", \"dh\", \"bh\",\n\t\"r8b\", \"r9b\", \"r10b\", \"r11b\", \"r12b\", \"r13b\", \"r14b\", \"r15b\" },\n  B64 = { \"al\", \"cl\", \"dl\", \"bl\", \"spl\", \"bpl\", \"sil\", \"dil\",\n\t  \"r8b\", \"r9b\", \"r10b\", \"r11b\", \"r12b\", \"r13b\", \"r14b\", \"r15b\" },\n  W = { \"ax\", \"cx\", \"dx\", \"bx\", \"sp\", \"bp\", \"si\", \"di\",\n\t\"r8w\", \"r9w\", \"r10w\", \"r11w\", \"r12w\", \"r13w\", \"r14w\", \"r15w\" },\n  D = { \"eax\", \"ecx\", \"edx\", \"ebx\", \"esp\", \"ebp\", \"esi\", \"edi\",\n\t\"r8d\", \"r9d\", \"r10d\", \"r11d\", \"r12d\", \"r13d\", \"r14d\", \"r15d\" },\n  Q = { \"rax\", \"rcx\", \"rdx\", \"rbx\", \"rsp\", \"rbp\", \"rsi\", \"rdi\",\n\t\"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\" },\n  M = { \"mm0\", \"mm1\", \"mm2\", \"mm3\", \"mm4\", \"mm5\", \"mm6\", \"mm7\",\n\t\"mm0\", \"mm1\", \"mm2\", \"mm3\", \"mm4\", \"mm5\", \"mm6\", \"mm7\" }, -- No x64 ext!\n  X = { \"xmm0\", \"xmm1\", \"xmm2\", \"xmm3\", \"xmm4\", \"xmm5\", \"xmm6\", \"xmm7\",\n\t\"xmm8\", \"xmm9\", \"xmm10\", \"xmm11\", \"xmm12\", \"xmm13\", \"xmm14\", \"xmm15\" },\n}\nlocal map_segregs = { \"es\", \"cs\", \"ss\", \"ds\", \"fs\", \"gs\", \"segr6\", \"segr7\" }\n\n-- Maps for size names.\nlocal map_sz2n = {\n  B = 1, W = 2, D = 4, Q = 8, M = 8, X = 16,\n}\nlocal map_sz2prefix = {\n  B = \"byte\", W = \"word\", D = \"dword\",\n  Q = \"qword\",\n  M = \"qword\", X = \"xword\",\n  F = \"dword\", G = \"qword\", -- No need for sizes/register names for these two.\n}\n\n------------------------------------------------------------------------------\n\n-- Output a nicely formatted line with an opcode and operands.\nlocal function putop(ctx, text, operands)\n  local code, pos, hex = ctx.code, ctx.pos, \"\"\n  local hmax = ctx.hexdump\n  if hmax > 0 then\n    for i=ctx.start,pos-1 do\n      hex = hex..format(\"%02X\", byte(code, i, i))\n    end\n    if #hex > hmax then hex = sub(hex, 1, hmax)..\". \"\n    else hex = hex..rep(\" \", hmax-#hex+2) end\n  end\n  if operands then text = text..\" \"..operands end\n  if ctx.o16 then text = \"o16 \"..text; ctx.o16 = false end\n  if ctx.a32 then text = \"a32 \"..text; ctx.a32 = false end\n  if ctx.rep then text = ctx.rep..\" \"..text; ctx.rep = false end\n  if ctx.rex then\n    local t = (ctx.rexw and \"w\" or \"\")..(ctx.rexr and \"r\" or \"\")..\n\t      (ctx.rexx and \"x\" or \"\")..(ctx.rexb and \"b\" or \"\")\n    if t ~= \"\" then text = \"rex.\"..t..\" \"..text end\n    ctx.rexw = false; ctx.rexr = false; ctx.rexx = false; ctx.rexb = false\n    ctx.rex = false\n  end\n  if ctx.seg then\n    local text2, n = gsub(text, \"%[\", \"[\"..ctx.seg..\":\")\n    if n == 0 then text = ctx.seg..\" \"..text else text = text2 end\n    ctx.seg = false\n  end\n  if ctx.lock then text = \"lock \"..text; ctx.lock = false end\n  local imm = ctx.imm\n  if imm then\n    local sym = ctx.symtab[imm]\n    if sym then text = text..\"\\t->\"..sym end\n  end\n  ctx.out(format(\"%08x  %s%s\\n\", ctx.addr+ctx.start, hex, text))\n  ctx.mrm = false\n  ctx.start = pos\n  ctx.imm = nil\nend\n\n-- Clear all prefix flags.\nlocal function clearprefixes(ctx)\n  ctx.o16 = false; ctx.seg = false; ctx.lock = false; ctx.rep = false\n  ctx.rexw = false; ctx.rexr = false; ctx.rexx = false; ctx.rexb = false\n  ctx.rex = false; ctx.a32 = false\nend\n\n-- Fallback for incomplete opcodes at the end.\nlocal function incomplete(ctx)\n  ctx.pos = ctx.stop+1\n  clearprefixes(ctx)\n  return putop(ctx, \"(incomplete)\")\nend\n\n-- Fallback for unknown opcodes.\nlocal function unknown(ctx)\n  clearprefixes(ctx)\n  return putop(ctx, \"(unknown)\")\nend\n\n-- Return an immediate of the specified size.\nlocal function getimm(ctx, pos, n)\n  if pos+n-1 > ctx.stop then return incomplete(ctx) end\n  local code = ctx.code\n  if n == 1 then\n    local b1 = byte(code, pos, pos)\n    return b1\n  elseif n == 2 then\n    local b1, b2 = byte(code, pos, pos+1)\n    return b1+b2*256\n  else\n    local b1, b2, b3, b4 = byte(code, pos, pos+3)\n    local imm = b1+b2*256+b3*65536+b4*16777216\n    ctx.imm = imm\n    return imm\n  end\nend\n\n-- Process pattern string and generate the operands.\nlocal function putpat(ctx, name, pat)\n  local operands, regs, sz, mode, sp, rm, sc, rx, sdisp\n  local code, pos, stop = ctx.code, ctx.pos, ctx.stop\n\n  -- Chars used: 1DFGIMPQRSTUVWXacdfgijmoprstuwxyz\n  for p in gmatch(pat, \".\") do\n    local x = nil\n    if p == \"V\" or p == \"U\" then\n      if ctx.rexw then sz = \"Q\"; ctx.rexw = false\n      elseif ctx.o16 then sz = \"W\"; ctx.o16 = false\n      elseif p == \"U\" and ctx.x64 then sz = \"Q\"\n      else sz = \"D\" end\n      regs = map_regs[sz]\n    elseif p == \"T\" then\n      if ctx.rexw then sz = \"Q\"; ctx.rexw = false else sz = \"D\" end\n      regs = map_regs[sz]\n    elseif p == \"B\" then\n      sz = \"B\"\n      regs = ctx.rex and map_regs.B64 or map_regs.B\n    elseif match(p, \"[WDQMXFG]\") then\n      sz = p\n      regs = map_regs[sz]\n    elseif p == \"P\" then\n      sz = ctx.o16 and \"X\" or \"M\"; ctx.o16 = false\n      regs = map_regs[sz]\n    elseif p == \"S\" then\n      name = name..lower(sz)\n    elseif p == \"s\" then\n      local imm = getimm(ctx, pos, 1); if not imm then return end\n      x = imm <= 127 and format(\"+0x%02x\", imm)\n\t\t     or format(\"-0x%02x\", 256-imm)\n      pos = pos+1\n    elseif p == \"u\" then\n      local imm = getimm(ctx, pos, 1); if not imm then return end\n      x = format(\"0x%02x\", imm)\n      pos = pos+1\n    elseif p == \"w\" then\n      local imm = getimm(ctx, pos, 2); if not imm then return end\n      x = format(\"0x%x\", imm)\n      pos = pos+2\n    elseif p == \"o\" then -- [offset]\n      if ctx.x64 then\n\tlocal imm1 = getimm(ctx, pos, 4); if not imm1 then return end\n\tlocal imm2 = getimm(ctx, pos+4, 4); if not imm2 then return end\n\tx = format(\"[0x%08x%08x]\", imm2, imm1)\n\tpos = pos+8\n      else\n\tlocal imm = getimm(ctx, pos, 4); if not imm then return end\n\tx = format(\"[0x%08x]\", imm)\n\tpos = pos+4\n      end\n    elseif p == \"i\" or p == \"I\" then\n      local n = map_sz2n[sz]\n      if n == 8 and ctx.x64 and p == \"I\" then\n\tlocal imm1 = getimm(ctx, pos, 4); if not imm1 then return end\n\tlocal imm2 = getimm(ctx, pos+4, 4); if not imm2 then return end\n\tx = format(\"0x%08x%08x\", imm2, imm1)\n      else\n\tif n == 8 then n = 4 end\n\tlocal imm = getimm(ctx, pos, n); if not imm then return end\n\tif sz == \"Q\" and (imm < 0 or imm > 0x7fffffff) then\n\t  imm = (0xffffffff+1)-imm\n\t  x = format(imm > 65535 and \"-0x%08x\" or \"-0x%x\", imm)\n\telse\n\t  x = format(imm > 65535 and \"0x%08x\" or \"0x%x\", imm)\n\tend\n      end\n      pos = pos+n\n    elseif p == \"j\" then\n      local n = map_sz2n[sz]\n      if n == 8 then n = 4 end\n      local imm = getimm(ctx, pos, n); if not imm then return end\n      if sz == \"B\" and imm > 127 then imm = imm-256\n      elseif imm > 2147483647 then imm = imm-4294967296 end\n      pos = pos+n\n      imm = imm + pos + ctx.addr\n      if imm > 4294967295 and not ctx.x64 then imm = imm-4294967296 end\n      ctx.imm = imm\n      if sz == \"W\" then\n\tx = format(\"word 0x%04x\", imm%65536)\n      elseif ctx.x64 then\n\tlocal lo = imm % 0x1000000\n\tx = format(\"0x%02x%06x\", (imm-lo) / 0x1000000, lo)\n      else\n\tx = format(\"0x%08x\", imm)\n      end\n    elseif p == \"R\" then\n      local r = byte(code, pos-1, pos-1)%8\n      if ctx.rexb then r = r + 8; ctx.rexb = false end\n      x = regs[r+1]\n    elseif p == \"a\" then x = regs[1]\n    elseif p == \"c\" then x = \"cl\"\n    elseif p == \"d\" then x = \"dx\"\n    elseif p == \"1\" then x = \"1\"\n    else\n      if not mode then\n\tmode = ctx.mrm\n\tif not mode then\n\t  if pos > stop then return incomplete(ctx) end\n\t  mode = byte(code, pos, pos)\n\t  pos = pos+1\n\tend\n\trm = mode%8; mode = (mode-rm)/8\n\tsp = mode%8; mode = (mode-sp)/8\n\tsdisp = \"\"\n\tif mode < 3 then\n\t  if rm == 4 then\n\t    if pos > stop then return incomplete(ctx) end\n\t    sc = byte(code, pos, pos)\n\t    pos = pos+1\n\t    rm = sc%8; sc = (sc-rm)/8\n\t    rx = sc%8; sc = (sc-rx)/8\n\t    if ctx.rexx then rx = rx + 8; ctx.rexx = false end\n\t    if rx == 4 then rx = nil end\n\t  end\n\t  if mode > 0 or rm == 5 then\n\t    local dsz = mode\n\t    if dsz ~= 1 then dsz = 4 end\n\t    local disp = getimm(ctx, pos, dsz); if not disp then return end\n\t    if mode == 0 then rm = nil end\n\t    if rm or rx or (not sc and ctx.x64 and not ctx.a32) then\n\t      if dsz == 1 and disp > 127 then\n\t\tsdisp = format(\"-0x%x\", 256-disp)\n\t      elseif disp >= 0 and disp <= 0x7fffffff then\n\t\tsdisp = format(\"+0x%x\", disp)\n\t      else\n\t\tsdisp = format(\"-0x%x\", (0xffffffff+1)-disp)\n\t      end\n\t    else\n\t      sdisp = format(ctx.x64 and not ctx.a32 and\n\t\tnot (disp >= 0 and disp <= 0x7fffffff)\n\t\tand \"0xffffffff%08x\" or \"0x%08x\", disp)\n\t    end\n\t    pos = pos+dsz\n\t  end\n\tend\n\tif rm and ctx.rexb then rm = rm + 8; ctx.rexb = false end\n\tif ctx.rexr then sp = sp + 8; ctx.rexr = false end\n      end\n      if p == \"m\" then\n\tif mode == 3 then x = regs[rm+1]\n\telse\n\t  local aregs = ctx.a32 and map_regs.D or ctx.aregs\n\t  local srm, srx = \"\", \"\"\n\t  if rm then srm = aregs[rm+1]\n\t  elseif not sc and ctx.x64 and not ctx.a32 then srm = \"rip\" end\n\t  ctx.a32 = false\n\t  if rx then\n\t    if rm then srm = srm..\"+\" end\n\t    srx = aregs[rx+1]\n\t    if sc > 0 then srx = srx..\"*\"..(2^sc) end\n\t  end\n\t  x = format(\"[%s%s%s]\", srm, srx, sdisp)\n\tend\n\tif mode < 3 and\n\t   (not match(pat, \"[aRrgp]\") or match(pat, \"t\")) then -- Yuck.\n\t  x = map_sz2prefix[sz]..\" \"..x\n\tend\n      elseif p == \"r\" then x = regs[sp+1]\n      elseif p == \"g\" then x = map_segregs[sp+1]\n      elseif p == \"p\" then -- Suppress prefix.\n      elseif p == \"f\" then x = \"st\"..rm\n      elseif p == \"x\" then\n\tif sp == 0 and ctx.lock and not ctx.x64 then\n\t  x = \"CR8\"; ctx.lock = false\n\telse\n\t  x = \"CR\"..sp\n\tend\n      elseif p == \"y\" then x = \"DR\"..sp\n      elseif p == \"z\" then x = \"TR\"..sp\n      elseif p == \"t\" then\n      else\n\terror(\"bad pattern `\"..pat..\"'\")\n      end\n    end\n    if x then operands = operands and operands..\", \"..x or x end\n  end\n  ctx.pos = pos\n  return putop(ctx, name, operands)\nend\n\n-- Forward declaration.\nlocal map_act\n\n-- Fetch and cache MRM byte.\nlocal function getmrm(ctx)\n  local mrm = ctx.mrm\n  if not mrm then\n    local pos = ctx.pos\n    if pos > ctx.stop then return nil end\n    mrm = byte(ctx.code, pos, pos)\n    ctx.pos = pos+1\n    ctx.mrm = mrm\n  end\n  return mrm\nend\n\n-- Dispatch to handler depending on pattern.\nlocal function dispatch(ctx, opat, patgrp)\n  if not opat then return unknown(ctx) end\n  if match(opat, \"%|\") then -- MMX/SSE variants depending on prefix.\n    local p\n    if ctx.rep then\n      p = ctx.rep==\"rep\" and \"%|([^%|]*)\" or \"%|[^%|]*%|[^%|]*%|([^%|]*)\"\n      ctx.rep = false\n    elseif ctx.o16 then p = \"%|[^%|]*%|([^%|]*)\"; ctx.o16 = false\n    else p = \"^[^%|]*\" end\n    opat = match(opat, p)\n    if not opat then return unknown(ctx) end\n--    ctx.rep = false; ctx.o16 = false\n    --XXX fails for 66 f2 0f 38 f1 06  crc32 eax,WORD PTR [esi]\n    --XXX remove in branches?\n  end\n  if match(opat, \"%$\") then -- reg$mem variants.\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\n    opat = match(opat, mrm >= 192 and \"^[^%$]*\" or \"%$(.*)\")\n    if opat == \"\" then return unknown(ctx) end\n  end\n  if opat == \"\" then return unknown(ctx) end\n  local name, pat = match(opat, \"^([a-z0-9 ]*)(.*)\")\n  if pat == \"\" and patgrp then pat = patgrp end\n  return map_act[sub(pat, 1, 1)](ctx, name, pat)\nend\n\n-- Get a pattern from an opcode map and dispatch to handler.\nlocal function dispatchmap(ctx, opcmap)\n  local pos = ctx.pos\n  local opat = opcmap[byte(ctx.code, pos, pos)]\n  pos = pos + 1\n  ctx.pos = pos\n  return dispatch(ctx, opat)\nend\n\n-- Map for action codes. The key is the first char after the name.\nmap_act = {\n  -- Simple opcodes without operands.\n  [\"\"] = function(ctx, name, pat)\n    return putop(ctx, name)\n  end,\n\n  -- Operand size chars fall right through.\n  B = putpat, W = putpat, D = putpat, Q = putpat,\n  V = putpat, U = putpat, T = putpat,\n  M = putpat, X = putpat, P = putpat,\n  F = putpat, G = putpat,\n\n  -- Collect prefixes.\n  [\":\"] = function(ctx, name, pat)\n    ctx[pat == \":\" and name or sub(pat, 2)] = name\n    if ctx.pos - ctx.start > 5 then return unknown(ctx) end -- Limit #prefixes.\n  end,\n\n  -- Chain to special handler specified by name.\n  [\"*\"] = function(ctx, name, pat)\n    return map_act[name](ctx, name, sub(pat, 2))\n  end,\n\n  -- Use named subtable for opcode group.\n  [\"!\"] = function(ctx, name, pat)\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\n    return dispatch(ctx, map_opcgroup[name][((mrm-(mrm%8))/8)%8+1], sub(pat, 2))\n  end,\n\n  -- o16,o32[,o64] variants.\n  sz = function(ctx, name, pat)\n    if ctx.o16 then ctx.o16 = false\n    else\n      pat = match(pat, \",(.*)\")\n      if ctx.rexw then\n\tlocal p = match(pat, \",(.*)\")\n\tif p then pat = p; ctx.rexw = false end\n      end\n    end\n    pat = match(pat, \"^[^,]*\")\n    return dispatch(ctx, pat)\n  end,\n\n  -- Two-byte opcode dispatch.\n  opc2 = function(ctx, name, pat)\n    return dispatchmap(ctx, map_opc2)\n  end,\n\n  -- Three-byte opcode dispatch.\n  opc3 = function(ctx, name, pat)\n    return dispatchmap(ctx, map_opc3[pat])\n  end,\n\n  -- VMX/SVM dispatch.\n  vm = function(ctx, name, pat)\n    return dispatch(ctx, map_opcvm[ctx.mrm])\n  end,\n\n  -- Floating point opcode dispatch.\n  fp = function(ctx, name, pat)\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\n    local rm = mrm%8\n    local idx = pat*8 + ((mrm-rm)/8)%8\n    if mrm >= 192 then idx = idx + 64 end\n    local opat = map_opcfp[idx]\n    if type(opat) == \"table\" then opat = opat[rm+1] end\n    return dispatch(ctx, opat)\n  end,\n\n  -- REX prefix.\n  rex = function(ctx, name, pat)\n    if ctx.rex then return unknown(ctx) end -- Only 1 REX prefix allowed.\n    for p in gmatch(pat, \".\") do ctx[\"rex\"..p] = true end\n    ctx.rex = true\n  end,\n\n  -- Special case for nop with REX prefix.\n  nop = function(ctx, name, pat)\n    return dispatch(ctx, ctx.rex and pat or \"nop\")\n  end,\n}\n\n------------------------------------------------------------------------------\n\n-- Disassemble a block of code.\nlocal function disass_block(ctx, ofs, len)\n  if not ofs then ofs = 0 end\n  local stop = len and ofs+len or #ctx.code\n  ofs = ofs + 1\n  ctx.start = ofs\n  ctx.pos = ofs\n  ctx.stop = stop\n  ctx.imm = nil\n  ctx.mrm = false\n  clearprefixes(ctx)\n  while ctx.pos <= stop do dispatchmap(ctx, ctx.map1) end\n  if ctx.pos ~= ctx.start then incomplete(ctx) end\nend\n\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\nlocal function create_(code, addr, out)\n  local ctx = {}\n  ctx.code = code\n  ctx.addr = (addr or 0) - 1\n  ctx.out = out or io.write\n  ctx.symtab = {}\n  ctx.disass = disass_block\n  ctx.hexdump = 16\n  ctx.x64 = false\n  ctx.map1 = map_opc1_32\n  ctx.aregs = map_regs.D\n  return ctx\nend\n\nlocal function create64_(code, addr, out)\n  local ctx = create_(code, addr, out)\n  ctx.x64 = true\n  ctx.map1 = map_opc1_64\n  ctx.aregs = map_regs.Q\n  return ctx\nend\n\n-- Simple API: disassemble code (a string) at address and output via out.\nlocal function disass_(code, addr, out)\n  create_(code, addr, out):disass()\nend\n\nlocal function disass64_(code, addr, out)\n  create64_(code, addr, out):disass()\nend\n\n-- Return register name for RID.\nlocal function regname_(r)\n  if r < 8 then return map_regs.D[r+1] end\n  return map_regs.X[r-7]\nend\n\nlocal function regname64_(r)\n  if r < 16 then return map_regs.Q[r+1] end\n  return map_regs.X[r-15]\nend\n\n-- Public module functions.\nmodule(...)\n\ncreate = create_\ncreate64 = create64_\ndisass = disass_\ndisass64 = disass64_\nregname = regname_\nregname64 = regname64_\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/dump.lua",
    "content": "----------------------------------------------------------------------------\n-- LuaJIT compiler dump module.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n--\n-- This module can be used to debug the JIT compiler itself. It dumps the\n-- code representations and structures used in various compiler stages.\n--\n-- Example usage:\n--\n--   luajit -jdump -e \"local x=0; for i=1,1e6 do x=x+i end; print(x)\"\n--   luajit -jdump=im -e \"for i=1,1000 do for j=1,1000 do end end\" | less -R\n--   luajit -jdump=is myapp.lua | less -R\n--   luajit -jdump=-b myapp.lua\n--   luajit -jdump=+aH,myapp.html myapp.lua\n--   luajit -jdump=ixT,myapp.dump myapp.lua\n--\n-- The first argument specifies the dump mode. The second argument gives\n-- the output file name. Default output is to stdout, unless the environment\n-- variable LUAJIT_DUMPFILE is set. The file is overwritten every time the\n-- module is started.\n--\n-- Different features can be turned on or off with the dump mode. If the\n-- mode starts with a '+', the following features are added to the default\n-- set of features; a '-' removes them. Otherwise the features are replaced.\n--\n-- The following dump features are available (* marks the default):\n--\n--  * t  Print a line for each started, ended or aborted trace (see also -jv).\n--  * b  Dump the traced bytecode.\n--  * i  Dump the IR (intermediate representation).\n--    r  Augment the IR with register/stack slots.\n--    s  Dump the snapshot map.\n--  * m  Dump the generated machine code.\n--    x  Print each taken trace exit.\n--    X  Print each taken trace exit and the contents of all registers.\n--    a  Print the IR of aborted traces, too.\n--\n-- The output format can be set with the following characters:\n--\n--    T  Plain text output.\n--    A  ANSI-colored text output\n--    H  Colorized HTML + CSS output.\n--\n-- The default output format is plain text. It's set to ANSI-colored text\n-- if the COLORTERM variable is set. Note: this is independent of any output\n-- redirection, which is actually considered a feature.\n--\n-- You probably want to use less -R to enjoy viewing ANSI-colored text from\n-- a pipe or a file. Add this to your ~/.bashrc: export LESS=\"-R\"\n--\n------------------------------------------------------------------------------\n\n-- Cache some library functions and objects.\nlocal jit = require(\"jit\")\nassert(jit.version_num == 20004, \"LuaJIT core/library version mismatch\")\nlocal jutil = require(\"jit.util\")\nlocal vmdef = require(\"jit.vmdef\")\nlocal funcinfo, funcbc = jutil.funcinfo, jutil.funcbc\nlocal traceinfo, traceir, tracek = jutil.traceinfo, jutil.traceir, jutil.tracek\nlocal tracemc, tracesnap = jutil.tracemc, jutil.tracesnap\nlocal traceexitstub, ircalladdr = jutil.traceexitstub, jutil.ircalladdr\nlocal bit = require(\"bit\")\nlocal band, shl, shr = bit.band, bit.lshift, bit.rshift\nlocal sub, gsub, format = string.sub, string.gsub, string.format\nlocal byte, char, rep = string.byte, string.char, string.rep\nlocal type, tostring = type, tostring\nlocal stdout, stderr = io.stdout, io.stderr\n\n-- Load other modules on-demand.\nlocal bcline, disass\n\n-- Active flag, output file handle and dump mode.\nlocal active, out, dumpmode\n\n------------------------------------------------------------------------------\n\nlocal symtabmt = { __index = false }\nlocal symtab = {}\nlocal nexitsym = 0\n\n-- Fill nested symbol table with per-trace exit stub addresses.\nlocal function fillsymtab_tr(tr, nexit)\n  local t = {}\n  symtabmt.__index = t\n  if jit.arch == \"mips\" or jit.arch == \"mipsel\" then\n    t[traceexitstub(tr, 0)] = \"exit\"\n    return\n  end\n  for i=0,nexit-1 do\n    local addr = traceexitstub(tr, i)\n    t[addr] = tostring(i)\n  end\n  local addr = traceexitstub(tr, nexit)\n  if addr then t[addr] = \"stack_check\" end\nend\n\n-- Fill symbol table with trace exit stub addresses.\nlocal function fillsymtab(tr, nexit)\n  local t = symtab\n  if nexitsym == 0 then\n    local ircall = vmdef.ircall\n    for i=0,#ircall do\n      local addr = ircalladdr(i)\n      if addr ~= 0 then t[addr] = ircall[i] end\n    end\n  end\n  if nexitsym == 1000000 then -- Per-trace exit stubs.\n    fillsymtab_tr(tr, nexit)\n  elseif nexit > nexitsym then -- Shared exit stubs.\n    for i=nexitsym,nexit-1 do\n      local addr = traceexitstub(i)\n      if addr == nil then -- Fall back to per-trace exit stubs.\n\tfillsymtab_tr(tr, nexit)\n\tsetmetatable(symtab, symtabmt)\n\tnexit = 1000000\n\tbreak\n      end\n      t[addr] = tostring(i)\n    end\n    nexitsym = nexit\n  end\n  return t\nend\n\nlocal function dumpwrite(s)\n  out:write(s)\nend\n\n-- Disassemble machine code.\nlocal function dump_mcode(tr)\n  local info = traceinfo(tr)\n  if not info then return end\n  local mcode, addr, loop = tracemc(tr)\n  if not mcode then return end\n  if not disass then disass = require(\"jit.dis_\"..jit.arch) end\n  out:write(\"---- TRACE \", tr, \" mcode \", #mcode, \"\\n\")\n  local ctx = disass.create(mcode, addr, dumpwrite)\n  ctx.hexdump = 0\n  ctx.symtab = fillsymtab(tr, info.nexit)\n  if loop ~= 0 then\n    symtab[addr+loop] = \"LOOP\"\n    ctx:disass(0, loop)\n    out:write(\"->LOOP:\\n\")\n    ctx:disass(loop, #mcode-loop)\n    symtab[addr+loop] = nil\n  else\n    ctx:disass(0, #mcode)\n  end\nend\n\n------------------------------------------------------------------------------\n\nlocal irtype_text = {\n  [0] = \"nil\",\n  \"fal\",\n  \"tru\",\n  \"lud\",\n  \"str\",\n  \"p32\",\n  \"thr\",\n  \"pro\",\n  \"fun\",\n  \"p64\",\n  \"cdt\",\n  \"tab\",\n  \"udt\",\n  \"flt\",\n  \"num\",\n  \"i8 \",\n  \"u8 \",\n  \"i16\",\n  \"u16\",\n  \"int\",\n  \"u32\",\n  \"i64\",\n  \"u64\",\n  \"sfp\",\n}\n\nlocal colortype_ansi = {\n  [0] = \"%s\",\n  \"%s\",\n  \"%s\",\n  \"\\027[36m%s\\027[m\",\n  \"\\027[32m%s\\027[m\",\n  \"%s\",\n  \"\\027[1m%s\\027[m\",\n  \"%s\",\n  \"\\027[1m%s\\027[m\",\n  \"%s\",\n  \"\\027[33m%s\\027[m\",\n  \"\\027[31m%s\\027[m\",\n  \"\\027[36m%s\\027[m\",\n  \"\\027[34m%s\\027[m\",\n  \"\\027[34m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n  \"\\027[35m%s\\027[m\",\n}\n\nlocal function colorize_text(s, t)\n  return s\nend\n\nlocal function colorize_ansi(s, t)\n  return format(colortype_ansi[t], s)\nend\n\nlocal irtype_ansi = setmetatable({},\n  { __index = function(tab, t)\n      local s = colorize_ansi(irtype_text[t], t); tab[t] = s; return s; end })\n\nlocal html_escape = { [\"<\"] = \"&lt;\", [\">\"] = \"&gt;\", [\"&\"] = \"&amp;\", }\n\nlocal function colorize_html(s, t)\n  s = gsub(s, \"[<>&]\", html_escape)\n  return format('<span class=\"irt_%s\">%s</span>', irtype_text[t], s)\nend\n\nlocal irtype_html = setmetatable({},\n  { __index = function(tab, t)\n      local s = colorize_html(irtype_text[t], t); tab[t] = s; return s; end })\n\nlocal header_html = [[\n<style type=\"text/css\">\nbackground { background: #ffffff; color: #000000; }\npre.ljdump {\nfont-size: 10pt;\nbackground: #f0f4ff;\ncolor: #000000;\nborder: 1px solid #bfcfff;\npadding: 0.5em;\nmargin-left: 2em;\nmargin-right: 2em;\n}\nspan.irt_str { color: #00a000; }\nspan.irt_thr, span.irt_fun { color: #404040; font-weight: bold; }\nspan.irt_tab { color: #c00000; }\nspan.irt_udt, span.irt_lud { color: #00c0c0; }\nspan.irt_num { color: #4040c0; }\nspan.irt_int, span.irt_i8, span.irt_u8, span.irt_i16, span.irt_u16 { color: #b040b0; }\n</style>\n]]\n\nlocal colorize, irtype\n\n-- Lookup tables to convert some literals into names.\nlocal litname = {\n  [\"SLOAD \"] = setmetatable({}, { __index = function(t, mode)\n    local s = \"\"\n    if band(mode, 1) ~= 0 then s = s..\"P\" end\n    if band(mode, 2) ~= 0 then s = s..\"F\" end\n    if band(mode, 4) ~= 0 then s = s..\"T\" end\n    if band(mode, 8) ~= 0 then s = s..\"C\" end\n    if band(mode, 16) ~= 0 then s = s..\"R\" end\n    if band(mode, 32) ~= 0 then s = s..\"I\" end\n    t[mode] = s\n    return s\n  end}),\n  [\"XLOAD \"] = { [0] = \"\", \"R\", \"V\", \"RV\", \"U\", \"RU\", \"VU\", \"RVU\", },\n  [\"CONV  \"] = setmetatable({}, { __index = function(t, mode)\n    local s = irtype[band(mode, 31)]\n    s = irtype[band(shr(mode, 5), 31)]..\".\"..s\n    if band(mode, 0x400) ~= 0 then s = s..\" trunc\"\n    elseif band(mode, 0x800) ~= 0 then s = s..\" sext\" end\n    local c = shr(mode, 14)\n    if c == 2 then s = s..\" index\" elseif c == 3 then s = s..\" check\" end\n    t[mode] = s\n    return s\n  end}),\n  [\"FLOAD \"] = vmdef.irfield,\n  [\"FREF  \"] = vmdef.irfield,\n  [\"FPMATH\"] = vmdef.irfpm,\n}\n\nlocal function ctlsub(c)\n  if c == \"\\n\" then return \"\\\\n\"\n  elseif c == \"\\r\" then return \"\\\\r\"\n  elseif c == \"\\t\" then return \"\\\\t\"\n  else return format(\"\\\\%03d\", byte(c))\n  end\nend\n\nlocal function fmtfunc(func, pc)\n  local fi = funcinfo(func, pc)\n  if fi.loc then\n    return fi.loc\n  elseif fi.ffid then\n    return vmdef.ffnames[fi.ffid]\n  elseif fi.addr then\n    return format(\"C:%x\", fi.addr)\n  else\n    return \"(?)\"\n  end\nend\n\nlocal function formatk(tr, idx)\n  local k, t, slot = tracek(tr, idx)\n  local tn = type(k)\n  local s\n  if tn == \"number\" then\n    if k == 2^52+2^51 then\n      s = \"bias\"\n    else\n      s = format(\"%+.14g\", k)\n    end\n  elseif tn == \"string\" then\n    s = format(#k > 20 and '\"%.20s\"~' or '\"%s\"', gsub(k, \"%c\", ctlsub))\n  elseif tn == \"function\" then\n    s = fmtfunc(k)\n  elseif tn == \"table\" then\n    s = format(\"{%p}\", k)\n  elseif tn == \"userdata\" then\n    if t == 12 then\n      s = format(\"userdata:%p\", k)\n    else\n      s = format(\"[%p]\", k)\n      if s == \"[0x00000000]\" then s = \"NULL\" end\n    end\n  elseif t == 21 then -- int64_t\n    s = sub(tostring(k), 1, -3)\n    if sub(s, 1, 1) ~= \"-\" then s = \"+\"..s end\n  else\n    s = tostring(k) -- For primitives.\n  end\n  s = colorize(format(\"%-4s\", s), t)\n  if slot then\n    s = format(\"%s @%d\", s, slot)\n  end\n  return s\nend\n\nlocal function printsnap(tr, snap)\n  local n = 2\n  for s=0,snap[1]-1 do\n    local sn = snap[n]\n    if shr(sn, 24) == s then\n      n = n + 1\n      local ref = band(sn, 0xffff) - 0x8000 -- REF_BIAS\n      if ref < 0 then\n\tout:write(formatk(tr, ref))\n      elseif band(sn, 0x80000) ~= 0 then -- SNAP_SOFTFPNUM\n\tout:write(colorize(format(\"%04d/%04d\", ref, ref+1), 14))\n      else\n\tlocal m, ot, op1, op2 = traceir(tr, ref)\n\tout:write(colorize(format(\"%04d\", ref), band(ot, 31)))\n      end\n      out:write(band(sn, 0x10000) == 0 and \" \" or \"|\") -- SNAP_FRAME\n    else\n      out:write(\"---- \")\n    end\n  end\n  out:write(\"]\\n\")\nend\n\n-- Dump snapshots (not interleaved with IR).\nlocal function dump_snap(tr)\n  out:write(\"---- TRACE \", tr, \" snapshots\\n\")\n  for i=0,1000000000 do\n    local snap = tracesnap(tr, i)\n    if not snap then break end\n    out:write(format(\"#%-3d %04d [ \", i, snap[0]))\n    printsnap(tr, snap)\n  end\nend\n\n-- Return a register name or stack slot for a rid/sp location.\nlocal function ridsp_name(ridsp, ins)\n  if not disass then disass = require(\"jit.dis_\"..jit.arch) end\n  local rid, slot = band(ridsp, 0xff), shr(ridsp, 8)\n  if rid == 253 or rid == 254 then\n    return (slot == 0 or slot == 255) and \" {sink\" or format(\" {%04d\", ins-slot)\n  end\n  if ridsp > 255 then return format(\"[%x]\", slot*4) end\n  if rid < 128 then return disass.regname(rid) end\n  return \"\"\nend\n\n-- Dump CALL* function ref and return optional ctype.\nlocal function dumpcallfunc(tr, ins)\n  local ctype\n  if ins > 0 then\n    local m, ot, op1, op2 = traceir(tr, ins)\n    if band(ot, 31) == 0 then -- nil type means CARG(func, ctype).\n      ins = op1\n      ctype = formatk(tr, op2)\n    end\n  end\n  if ins < 0 then\n    out:write(format(\"[0x%x](\", tonumber((tracek(tr, ins)))))\n  else\n    out:write(format(\"%04d (\", ins))\n  end\n  return ctype\nend\n\n-- Recursively gather CALL* args and dump them.\nlocal function dumpcallargs(tr, ins)\n  if ins < 0 then\n    out:write(formatk(tr, ins))\n  else\n    local m, ot, op1, op2 = traceir(tr, ins)\n    local oidx = 6*shr(ot, 8)\n    local op = sub(vmdef.irnames, oidx+1, oidx+6)\n    if op == \"CARG  \" then\n      dumpcallargs(tr, op1)\n      if op2 < 0 then\n\tout:write(\" \", formatk(tr, op2))\n      else\n\tout:write(\" \", format(\"%04d\", op2))\n      end\n    else\n      out:write(format(\"%04d\", ins))\n    end\n  end\nend\n\n-- Dump IR and interleaved snapshots.\nlocal function dump_ir(tr, dumpsnap, dumpreg)\n  local info = traceinfo(tr)\n  if not info then return end\n  local nins = info.nins\n  out:write(\"---- TRACE \", tr, \" IR\\n\")\n  local irnames = vmdef.irnames\n  local snapref = 65536\n  local snap, snapno\n  if dumpsnap then\n    snap = tracesnap(tr, 0)\n    snapref = snap[0]\n    snapno = 0\n  end\n  for ins=1,nins do\n    if ins >= snapref then\n      if dumpreg then\n\tout:write(format(\"....              SNAP   #%-3d [ \", snapno))\n      else\n\tout:write(format(\"....        SNAP   #%-3d [ \", snapno))\n      end\n      printsnap(tr, snap)\n      snapno = snapno + 1\n      snap = tracesnap(tr, snapno)\n      snapref = snap and snap[0] or 65536\n    end\n    local m, ot, op1, op2, ridsp = traceir(tr, ins)\n    local oidx, t = 6*shr(ot, 8), band(ot, 31)\n    local op = sub(irnames, oidx+1, oidx+6)\n    if op == \"LOOP  \" then\n      if dumpreg then\n\tout:write(format(\"%04d ------------ LOOP ------------\\n\", ins))\n      else\n\tout:write(format(\"%04d ------ LOOP ------------\\n\", ins))\n      end\n    elseif op ~= \"NOP   \" and op ~= \"CARG  \" and\n\t   (dumpreg or op ~= \"RENAME\") then\n      local rid = band(ridsp, 255)\n      if dumpreg then\n\tout:write(format(\"%04d %-6s\", ins, ridsp_name(ridsp, ins)))\n      else\n\tout:write(format(\"%04d \", ins))\n      end\n      out:write(format(\"%s%s %s %s \",\n\t\t       (rid == 254 or rid == 253) and \"}\" or\n\t\t       (band(ot, 128) == 0 and \" \" or \">\"),\n\t\t       band(ot, 64) == 0 and \" \" or \"+\",\n\t\t       irtype[t], op))\n      local m1, m2 = band(m, 3), band(m, 3*4)\n      if sub(op, 1, 4) == \"CALL\" then\n\tlocal ctype\n\tif m2 == 1*4 then -- op2 == IRMlit\n\t  out:write(format(\"%-10s  (\", vmdef.ircall[op2]))\n\telse\n\t  ctype = dumpcallfunc(tr, op2)\n\tend\n\tif op1 ~= -1 then dumpcallargs(tr, op1) end\n\tout:write(\")\")\n\tif ctype then out:write(\" ctype \", ctype) end\n      elseif op == \"CNEW  \" and op2 == -1 then\n\tout:write(formatk(tr, op1))\n      elseif m1 ~= 3 then -- op1 != IRMnone\n\tif op1 < 0 then\n\t  out:write(formatk(tr, op1))\n\telse\n\t  out:write(format(m1 == 0 and \"%04d\" or \"#%-3d\", op1))\n\tend\n\tif m2 ~= 3*4 then -- op2 != IRMnone\n\t  if m2 == 1*4 then -- op2 == IRMlit\n\t    local litn = litname[op]\n\t    if litn and litn[op2] then\n\t      out:write(\"  \", litn[op2])\n\t    elseif op == \"UREFO \" or op == \"UREFC \" then\n\t      out:write(format(\"  #%-3d\", shr(op2, 8)))\n\t    else\n\t      out:write(format(\"  #%-3d\", op2))\n\t    end\n\t  elseif op2 < 0 then\n\t    out:write(\"  \", formatk(tr, op2))\n\t  else\n\t    out:write(format(\"  %04d\", op2))\n\t  end\n\tend\n      end\n      out:write(\"\\n\")\n    end\n  end\n  if snap then\n    if dumpreg then\n      out:write(format(\"....              SNAP   #%-3d [ \", snapno))\n    else\n      out:write(format(\"....        SNAP   #%-3d [ \", snapno))\n    end\n    printsnap(tr, snap)\n  end\nend\n\n------------------------------------------------------------------------------\n\nlocal recprefix = \"\"\nlocal recdepth = 0\n\n-- Format trace error message.\nlocal function fmterr(err, info)\n  if type(err) == \"number\" then\n    if type(info) == \"function\" then info = fmtfunc(info) end\n    err = format(vmdef.traceerr[err], info)\n  end\n  return err\nend\n\n-- Dump trace states.\nlocal function dump_trace(what, tr, func, pc, otr, oex)\n  if what == \"stop\" or (what == \"abort\" and dumpmode.a) then\n    if dumpmode.i then dump_ir(tr, dumpmode.s, dumpmode.r and what == \"stop\")\n    elseif dumpmode.s then dump_snap(tr) end\n    if dumpmode.m then dump_mcode(tr) end\n  end\n  if what == \"start\" then\n    if dumpmode.H then out:write('<pre class=\"ljdump\">\\n') end\n    out:write(\"---- TRACE \", tr, \" \", what)\n    if otr then out:write(\" \", otr, \"/\", oex) end\n    out:write(\" \", fmtfunc(func, pc), \"\\n\")\n  elseif what == \"stop\" or what == \"abort\" then\n    out:write(\"---- TRACE \", tr, \" \", what)\n    if what == \"abort\" then\n      out:write(\" \", fmtfunc(func, pc), \" -- \", fmterr(otr, oex), \"\\n\")\n    else\n      local info = traceinfo(tr)\n      local link, ltype = info.link, info.linktype\n      if link == tr or link == 0 then\n\tout:write(\" -> \", ltype, \"\\n\")\n      elseif ltype == \"root\" then\n\tout:write(\" -> \", link, \"\\n\")\n      else\n\tout:write(\" -> \", link, \" \", ltype, \"\\n\")\n      end\n    end\n    if dumpmode.H then out:write(\"</pre>\\n\\n\") else out:write(\"\\n\") end\n  else\n    out:write(\"---- TRACE \", what, \"\\n\\n\")\n  end\n  out:flush()\nend\n\n-- Dump recorded bytecode.\nlocal function dump_record(tr, func, pc, depth, callee)\n  if depth ~= recdepth then\n    recdepth = depth\n    recprefix = rep(\" .\", depth)\n  end\n  local line\n  if pc >= 0 then\n    line = bcline(func, pc, recprefix)\n    if dumpmode.H then line = gsub(line, \"[<>&]\", html_escape) end\n  else\n    line = \"0000 \"..recprefix..\" FUNCC      \\n\"\n    callee = func\n  end\n  if pc <= 0 then\n    out:write(sub(line, 1, -2), \"         ; \", fmtfunc(func), \"\\n\")\n  else\n    out:write(line)\n  end\n  if pc >= 0 and band(funcbc(func, pc), 0xff) < 16 then -- ORDER BC\n    out:write(bcline(func, pc+1, recprefix)) -- Write JMP for cond.\n  end\nend\n\n------------------------------------------------------------------------------\n\n-- Dump taken trace exits.\nlocal function dump_texit(tr, ex, ngpr, nfpr, ...)\n  out:write(\"---- TRACE \", tr, \" exit \", ex, \"\\n\")\n  if dumpmode.X then\n    local regs = {...}\n    if jit.arch == \"x64\" then\n      for i=1,ngpr do\n\tout:write(format(\" %016x\", regs[i]))\n\tif i % 4 == 0 then out:write(\"\\n\") end\n      end\n    else\n      for i=1,ngpr do\n\tout:write(format(\" %08x\", regs[i]))\n\tif i % 8 == 0 then out:write(\"\\n\") end\n      end\n    end\n    if jit.arch == \"mips\" or jit.arch == \"mipsel\" then\n      for i=1,nfpr,2 do\n\tout:write(format(\" %+17.14g\", regs[ngpr+i]))\n\tif i % 8 == 7 then out:write(\"\\n\") end\n      end\n    else\n      for i=1,nfpr do\n\tout:write(format(\" %+17.14g\", regs[ngpr+i]))\n\tif i % 4 == 0 then out:write(\"\\n\") end\n      end\n    end\n  end\nend\n\n------------------------------------------------------------------------------\n\n-- Detach dump handlers.\nlocal function dumpoff()\n  if active then\n    active = false\n    jit.attach(dump_texit)\n    jit.attach(dump_record)\n    jit.attach(dump_trace)\n    if out and out ~= stdout and out ~= stderr then out:close() end\n    out = nil\n  end\nend\n\n-- Open the output file and attach dump handlers.\nlocal function dumpon(opt, outfile)\n  if active then dumpoff() end\n\n  local colormode = os.getenv(\"COLORTERM\") and \"A\" or \"T\"\n  if opt then\n    opt = gsub(opt, \"[TAH]\", function(mode) colormode = mode; return \"\"; end)\n  end\n\n  local m = { t=true, b=true, i=true, m=true, }\n  if opt and opt ~= \"\" then\n    local o = sub(opt, 1, 1)\n    if o ~= \"+\" and o ~= \"-\" then m = {} end\n    for i=1,#opt do m[sub(opt, i, i)] = (o ~= \"-\") end\n  end\n  dumpmode = m\n\n  if m.t or m.b or m.i or m.s or m.m then\n    jit.attach(dump_trace, \"trace\")\n  end\n  if m.b then\n    jit.attach(dump_record, \"record\")\n    if not bcline then bcline = require(\"jit.bc\").line end\n  end\n  if m.x or m.X then\n    jit.attach(dump_texit, \"texit\")\n  end\n\n  if not outfile then outfile = os.getenv(\"LUAJIT_DUMPFILE\") end\n  if outfile then\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\n  else\n    out = stdout\n  end\n\n  m[colormode] = true\n  if colormode == \"A\" then\n    colorize = colorize_ansi\n    irtype = irtype_ansi\n  elseif colormode == \"H\" then\n    colorize = colorize_html\n    irtype = irtype_html\n    out:write(header_html)\n  else\n    colorize = colorize_text\n    irtype = irtype_text\n  end\n\n  active = true\nend\n\n-- Public module functions.\nmodule(...)\n\non = dumpon\noff = dumpoff\nstart = dumpon -- For -j command line option.\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/v.lua",
    "content": "----------------------------------------------------------------------------\n-- Verbose mode of the LuaJIT compiler.\n--\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\n-- Released under the MIT license. See Copyright Notice in luajit.h\n----------------------------------------------------------------------------\n--\n-- This module shows verbose information about the progress of the\n-- JIT compiler. It prints one line for each generated trace. This module\n-- is useful to see which code has been compiled or where the compiler\n-- punts and falls back to the interpreter.\n--\n-- Example usage:\n--\n--   luajit -jv -e \"for i=1,1000 do for j=1,1000 do end end\"\n--   luajit -jv=myapp.out myapp.lua\n--\n-- Default output is to stderr. To redirect the output to a file, pass a\n-- filename as an argument (use '-' for stdout) or set the environment\n-- variable LUAJIT_VERBOSEFILE. The file is overwritten every time the\n-- module is started.\n--\n-- The output from the first example should look like this:\n--\n-- [TRACE   1 (command line):1 loop]\n-- [TRACE   2 (1/3) (command line):1 -> 1]\n--\n-- The first number in each line is the internal trace number. Next are\n-- the file name ('(command line)') and the line number (':1') where the\n-- trace has started. Side traces also show the parent trace number and\n-- the exit number where they are attached to in parentheses ('(1/3)').\n-- An arrow at the end shows where the trace links to ('-> 1'), unless\n-- it loops to itself.\n--\n-- In this case the inner loop gets hot and is traced first, generating\n-- a root trace. Then the last exit from the 1st trace gets hot, too,\n-- and triggers generation of the 2nd trace. The side trace follows the\n-- path along the outer loop and *around* the inner loop, back to its\n-- start, and then links to the 1st trace. Yes, this may seem unusual,\n-- if you know how traditional compilers work. Trace compilers are full\n-- of surprises like this -- have fun! :-)\n--\n-- Aborted traces are shown like this:\n--\n-- [TRACE --- foo.lua:44 -- leaving loop in root trace at foo:lua:50]\n--\n-- Don't worry -- trace aborts are quite common, even in programs which\n-- can be fully compiled. The compiler may retry several times until it\n-- finds a suitable trace.\n--\n-- Of course this doesn't work with features that are not-yet-implemented\n-- (NYI error messages). The VM simply falls back to the interpreter. This\n-- may not matter at all if the particular trace is not very high up in\n-- the CPU usage profile. Oh, and the interpreter is quite fast, too.\n--\n-- Also check out the -jdump module, which prints all the gory details.\n--\n------------------------------------------------------------------------------\n\n-- Cache some library functions and objects.\nlocal jit = require(\"jit\")\nassert(jit.version_num == 20004, \"LuaJIT core/library version mismatch\")\nlocal jutil = require(\"jit.util\")\nlocal vmdef = require(\"jit.vmdef\")\nlocal funcinfo, traceinfo = jutil.funcinfo, jutil.traceinfo\nlocal type, format = type, string.format\nlocal stdout, stderr = io.stdout, io.stderr\n\n-- Active flag and output file handle.\nlocal active, out\n\n------------------------------------------------------------------------------\n\nlocal startloc, startex\n\nlocal function fmtfunc(func, pc)\n  local fi = funcinfo(func, pc)\n  if fi.loc then\n    return fi.loc\n  elseif fi.ffid then\n    return vmdef.ffnames[fi.ffid]\n  elseif fi.addr then\n    return format(\"C:%x\", fi.addr)\n  else\n    return \"(?)\"\n  end\nend\n\n-- Format trace error message.\nlocal function fmterr(err, info)\n  if type(err) == \"number\" then\n    if type(info) == \"function\" then info = fmtfunc(info) end\n    err = format(vmdef.traceerr[err], info)\n  end\n  return err\nend\n\n-- Dump trace states.\nlocal function dump_trace(what, tr, func, pc, otr, oex)\n  if what == \"start\" then\n    startloc = fmtfunc(func, pc)\n    startex = otr and \"(\"..otr..\"/\"..oex..\") \" or \"\"\n  else\n    if what == \"abort\" then\n      local loc = fmtfunc(func, pc)\n      if loc ~= startloc then\n\tout:write(format(\"[TRACE --- %s%s -- %s at %s]\\n\",\n\t  startex, startloc, fmterr(otr, oex), loc))\n      else\n\tout:write(format(\"[TRACE --- %s%s -- %s]\\n\",\n\t  startex, startloc, fmterr(otr, oex)))\n      end\n    elseif what == \"stop\" then\n      local info = traceinfo(tr)\n      local link, ltype = info.link, info.linktype\n      if ltype == \"interpreter\" then\n\tout:write(format(\"[TRACE %3s %s%s -- fallback to interpreter]\\n\",\n\t  tr, startex, startloc))\n      elseif link == tr or link == 0 then\n\tout:write(format(\"[TRACE %3s %s%s %s]\\n\",\n\t  tr, startex, startloc, ltype))\n      elseif ltype == \"root\" then\n\tout:write(format(\"[TRACE %3s %s%s -> %d]\\n\",\n\t  tr, startex, startloc, link))\n      else\n\tout:write(format(\"[TRACE %3s %s%s -> %d %s]\\n\",\n\t  tr, startex, startloc, link, ltype))\n      end\n    else\n      out:write(format(\"[TRACE %s]\\n\", what))\n    end\n    out:flush()\n  end\nend\n\n------------------------------------------------------------------------------\n\n-- Detach dump handlers.\nlocal function dumpoff()\n  if active then\n    active = false\n    jit.attach(dump_trace)\n    if out and out ~= stdout and out ~= stderr then out:close() end\n    out = nil\n  end\nend\n\n-- Open the output file and attach dump handlers.\nlocal function dumpon(outfile)\n  if active then dumpoff() end\n  if not outfile then outfile = os.getenv(\"LUAJIT_VERBOSEFILE\") end\n  if outfile then\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\n  else\n    out = stderr\n  end\n  jit.attach(dump_trace, \"trace\")\n  active = true\nend\n\n-- Public module functions.\nmodule(...)\n\non = dumpon\noff = dumpoff\nstart = dumpon -- For -j command line option.\n\n"
  },
  {
    "path": "build/luajit-2.0.4/src/jit/vmdef.lua",
    "content": "-- This is a generated file. DO NOT EDIT!\r\n\r\nmodule(...)\r\n\r\nbcnames = \"ISLT  ISGE  ISLE  ISGT  ISEQV ISNEV ISEQS ISNES ISEQN ISNEN ISEQP ISNEP ISTC  ISFC  IST   ISF   MOV   NOT   UNM   LEN   ADDVN SUBVN MULVN DIVVN MODVN ADDNV SUBNV MULNV DIVNV MODNV ADDVV SUBVV MULVV DIVVV MODVV POW   CAT   KSTR  KCDATAKSHORTKNUM  KPRI  KNIL  UGET  USETV USETS USETN USETP UCLO  FNEW  TNEW  TDUP  GGET  GSET  TGETV TGETS TGETB TSETV TSETS TSETB TSETM CALLM CALL  CALLMTCALLT ITERC ITERN VARG  ISNEXTRETM  RET   RET0  RET1  FORI  JFORI FORL  IFORL JFORL ITERL IITERLJITERLLOOP  ILOOP JLOOP JMP   FUNCF IFUNCFJFUNCFFUNCV IFUNCVJFUNCVFUNCC FUNCCW\"\r\n\r\nirnames = \"LT    GE    LE    GT    ULT   UGE   ULE   UGT   EQ    NE    ABC   RETF  NOP   BASE  PVAL  GCSTEPHIOP  LOOP  USE   PHI   RENAMEKPRI  KINT  KGC   KPTR  KKPTR KNULL KNUM  KINT64KSLOT BNOT  BSWAP BAND  BOR   BXOR  BSHL  BSHR  BSAR  BROL  BROR  ADD   SUB   MUL   DIV   MOD   POW   NEG   ABS   ATAN2 LDEXP MIN   MAX   FPMATHADDOV SUBOV MULOV AREF  HREFK HREF  NEWREFUREFO UREFC FREF  STRREFALOAD HLOAD ULOAD FLOAD XLOAD SLOAD VLOAD ASTOREHSTOREUSTOREFSTOREXSTORESNEW  XSNEW TNEW  TDUP  CNEW  CNEWI TBAR  OBAR  XBAR  CONV  TOBIT TOSTR STRTO CALLN CALLL CALLS CALLXSCARG  \"\r\n\r\nirfpm = { [0]=\"floor\", \"ceil\", \"trunc\", \"sqrt\", \"exp\", \"exp2\", \"log\", \"log2\", \"log10\", \"sin\", \"cos\", \"tan\", \"other\", }\r\n\r\nirfield = { [0]=\"str.len\", \"func.env\", \"func.pc\", \"tab.meta\", \"tab.array\", \"tab.node\", \"tab.asize\", \"tab.hmask\", \"tab.nomm\", \"udata.meta\", \"udata.udtype\", \"udata.file\", \"cdata.ctypeid\", \"cdata.ptr\", \"cdata.int\", \"cdata.int64\", \"cdata.int64_4\", }\r\n\r\nircall = {\r\n[0]=\"lj_str_cmp\",\r\n\"lj_str_new\",\r\n\"lj_strscan_num\",\r\n\"lj_str_fromint\",\r\n\"lj_str_fromnum\",\r\n\"lj_tab_new1\",\r\n\"lj_tab_dup\",\r\n\"lj_tab_newkey\",\r\n\"lj_tab_len\",\r\n\"lj_gc_step_jit\",\r\n\"lj_gc_barrieruv\",\r\n\"lj_mem_newgco\",\r\n\"lj_math_random_step\",\r\n\"lj_vm_modi\",\r\n\"sinh\",\r\n\"cosh\",\r\n\"tanh\",\r\n\"fputc\",\r\n\"fwrite\",\r\n\"fflush\",\r\n\"lj_vm_floor\",\r\n\"lj_vm_ceil\",\r\n\"lj_vm_trunc\",\r\n\"sqrt\",\r\n\"exp\",\r\n\"lj_vm_exp2\",\r\n\"log\",\r\n\"lj_vm_log2\",\r\n\"log10\",\r\n\"sin\",\r\n\"cos\",\r\n\"tan\",\r\n\"lj_vm_powi\",\r\n\"pow\",\r\n\"atan2\",\r\n\"ldexp\",\r\n\"lj_vm_tobit\",\r\n\"softfp_add\",\r\n\"softfp_sub\",\r\n\"softfp_mul\",\r\n\"softfp_div\",\r\n\"softfp_cmp\",\r\n\"softfp_i2d\",\r\n\"softfp_d2i\",\r\n\"softfp_ui2d\",\r\n\"softfp_f2d\",\r\n\"softfp_d2ui\",\r\n\"softfp_d2f\",\r\n\"softfp_i2f\",\r\n\"softfp_ui2f\",\r\n\"softfp_f2i\",\r\n\"softfp_f2ui\",\r\n\"fp64_l2d\",\r\n\"fp64_ul2d\",\r\n\"fp64_l2f\",\r\n\"fp64_ul2f\",\r\n\"fp64_d2l\",\r\n\"fp64_d2ul\",\r\n\"fp64_f2l\",\r\n\"fp64_f2ul\",\r\n\"lj_carith_divi64\",\r\n\"lj_carith_divu64\",\r\n\"lj_carith_modi64\",\r\n\"lj_carith_modu64\",\r\n\"lj_carith_powi64\",\r\n\"lj_carith_powu64\",\r\n\"lj_cdata_setfin\",\r\n\"strlen\",\r\n\"memcpy\",\r\n\"memset\",\r\n\"lj_vm_errno\",\r\n\"lj_carith_mul64\",\r\n}\r\n\r\ntraceerr = {\r\n[0]=\"error thrown or hook called during recording\",\r\n\"trace too long\",\r\n\"trace too deep\",\r\n\"too many snapshots\",\r\n\"blacklisted\",\r\n\"NYI: bytecode %d\",\r\n\"leaving loop in root trace\",\r\n\"inner loop in root trace\",\r\n\"loop unroll limit reached\",\r\n\"bad argument type\",\r\n\"JIT compilation disabled for function\",\r\n\"call unroll limit reached\",\r\n\"down-recursion, restarting\",\r\n\"NYI: C function %p\",\r\n\"NYI: FastFunc %s\",\r\n\"NYI: unsupported variant of FastFunc %s\",\r\n\"NYI: return to lower frame\",\r\n\"store with nil or NaN key\",\r\n\"missing metamethod\",\r\n\"looping index lookup\",\r\n\"NYI: mixed sparse/dense table\",\r\n\"symbol not in cache\",\r\n\"NYI: unsupported C type conversion\",\r\n\"NYI: unsupported C function type\",\r\n\"guard would always fail\",\r\n\"too many PHIs\",\r\n\"persistent type instability\",\r\n\"failed to allocate mcode memory\",\r\n\"machine code too long\",\r\n\"hit mcode limit (retrying)\",\r\n\"too many spill slots\",\r\n\"inconsistent register allocation\",\r\n\"NYI: cannot assemble IR instruction %d\",\r\n\"NYI: PHI shuffling too complex\",\r\n\"NYI: register coalescing too complex\",\r\n}\r\n\r\nffnames = {\r\n[0]=\"Lua\",\r\n\"C\",\r\n\"assert\",\r\n\"type\",\r\n\"next\",\r\n\"pairs\",\r\n\"ipairs_aux\",\r\n\"ipairs\",\r\n\"getmetatable\",\r\n\"setmetatable\",\r\n\"getfenv\",\r\n\"setfenv\",\r\n\"rawget\",\r\n\"rawset\",\r\n\"rawequal\",\r\n\"unpack\",\r\n\"select\",\r\n\"tonumber\",\r\n\"tostring\",\r\n\"error\",\r\n\"pcall\",\r\n\"xpcall\",\r\n\"loadfile\",\r\n\"load\",\r\n\"loadstring\",\r\n\"dofile\",\r\n\"gcinfo\",\r\n\"collectgarbage\",\r\n\"newproxy\",\r\n\"print\",\r\n\"coroutine.status\",\r\n\"coroutine.running\",\r\n\"coroutine.create\",\r\n\"coroutine.yield\",\r\n\"coroutine.resume\",\r\n\"coroutine.wrap_aux\",\r\n\"coroutine.wrap\",\r\n\"math.abs\",\r\n\"math.floor\",\r\n\"math.ceil\",\r\n\"math.sqrt\",\r\n\"math.log10\",\r\n\"math.exp\",\r\n\"math.sin\",\r\n\"math.cos\",\r\n\"math.tan\",\r\n\"math.asin\",\r\n\"math.acos\",\r\n\"math.atan\",\r\n\"math.sinh\",\r\n\"math.cosh\",\r\n\"math.tanh\",\r\n\"math.frexp\",\r\n\"math.modf\",\r\n\"math.deg\",\r\n\"math.rad\",\r\n\"math.log\",\r\n\"math.atan2\",\r\n\"math.pow\",\r\n\"math.fmod\",\r\n\"math.ldexp\",\r\n\"math.min\",\r\n\"math.max\",\r\n\"math.random\",\r\n\"math.randomseed\",\r\n\"bit.tobit\",\r\n\"bit.bnot\",\r\n\"bit.bswap\",\r\n\"bit.lshift\",\r\n\"bit.rshift\",\r\n\"bit.arshift\",\r\n\"bit.rol\",\r\n\"bit.ror\",\r\n\"bit.band\",\r\n\"bit.bor\",\r\n\"bit.bxor\",\r\n\"bit.tohex\",\r\n\"string.len\",\r\n\"string.byte\",\r\n\"string.char\",\r\n\"string.sub\",\r\n\"string.rep\",\r\n\"string.reverse\",\r\n\"string.lower\",\r\n\"string.upper\",\r\n\"string.dump\",\r\n\"string.find\",\r\n\"string.match\",\r\n\"string.gmatch_aux\",\r\n\"string.gmatch\",\r\n\"string.gsub\",\r\n\"string.format\",\r\n\"table.foreachi\",\r\n\"table.foreach\",\r\n\"table.getn\",\r\n\"table.maxn\",\r\n\"table.insert\",\r\n\"table.remove\",\r\n\"table.concat\",\r\n\"table.sort\",\r\n\"io.method.close\",\r\n\"io.method.read\",\r\n\"io.method.write\",\r\n\"io.method.flush\",\r\n\"io.method.seek\",\r\n\"io.method.setvbuf\",\r\n\"io.method.lines\",\r\n\"io.method.__gc\",\r\n\"io.method.__tostring\",\r\n\"io.open\",\r\n\"io.popen\",\r\n\"io.tmpfile\",\r\n\"io.close\",\r\n\"io.read\",\r\n\"io.write\",\r\n\"io.flush\",\r\n\"io.input\",\r\n\"io.output\",\r\n\"io.lines\",\r\n\"io.type\",\r\n\"os.execute\",\r\n\"os.remove\",\r\n\"os.rename\",\r\n\"os.tmpname\",\r\n\"os.getenv\",\r\n\"os.exit\",\r\n\"os.clock\",\r\n\"os.date\",\r\n\"os.time\",\r\n\"os.difftime\",\r\n\"os.setlocale\",\r\n\"debug.getregistry\",\r\n\"debug.getmetatable\",\r\n\"debug.setmetatable\",\r\n\"debug.getfenv\",\r\n\"debug.setfenv\",\r\n\"debug.getinfo\",\r\n\"debug.getlocal\",\r\n\"debug.setlocal\",\r\n\"debug.getupvalue\",\r\n\"debug.setupvalue\",\r\n\"debug.upvalueid\",\r\n\"debug.upvaluejoin\",\r\n\"debug.sethook\",\r\n\"debug.gethook\",\r\n\"debug.debug\",\r\n\"debug.traceback\",\r\n\"jit.on\",\r\n\"jit.off\",\r\n\"jit.flush\",\r\n\"jit.status\",\r\n\"jit.attach\",\r\n\"jit.util.funcinfo\",\r\n\"jit.util.funcbc\",\r\n\"jit.util.funck\",\r\n\"jit.util.funcuvname\",\r\n\"jit.util.traceinfo\",\r\n\"jit.util.traceir\",\r\n\"jit.util.tracek\",\r\n\"jit.util.tracesnap\",\r\n\"jit.util.tracemc\",\r\n\"jit.util.traceexitstub\",\r\n\"jit.util.ircalladdr\",\r\n\"jit.opt.start\",\r\n\"ffi.meta.__index\",\r\n\"ffi.meta.__newindex\",\r\n\"ffi.meta.__eq\",\r\n\"ffi.meta.__len\",\r\n\"ffi.meta.__lt\",\r\n\"ffi.meta.__le\",\r\n\"ffi.meta.__concat\",\r\n\"ffi.meta.__call\",\r\n\"ffi.meta.__add\",\r\n\"ffi.meta.__sub\",\r\n\"ffi.meta.__mul\",\r\n\"ffi.meta.__div\",\r\n\"ffi.meta.__mod\",\r\n\"ffi.meta.__pow\",\r\n\"ffi.meta.__unm\",\r\n\"ffi.meta.__tostring\",\r\n\"ffi.meta.__pairs\",\r\n\"ffi.meta.__ipairs\",\r\n\"ffi.clib.__index\",\r\n\"ffi.clib.__newindex\",\r\n\"ffi.clib.__gc\",\r\n\"ffi.callback.free\",\r\n\"ffi.callback.set\",\r\n\"ffi.cdef\",\r\n\"ffi.new\",\r\n\"ffi.cast\",\r\n\"ffi.typeof\",\r\n\"ffi.istype\",\r\n\"ffi.sizeof\",\r\n\"ffi.alignof\",\r\n\"ffi.offsetof\",\r\n\"ffi.errno\",\r\n\"ffi.string\",\r\n\"ffi.copy\",\r\n\"ffi.fill\",\r\n\"ffi.abi\",\r\n\"ffi.metatype\",\r\n\"ffi.gc\",\r\n\"ffi.load\",\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lauxlib.h",
    "content": "/*\r\n** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions for building Lua libraries\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lauxlib_h\r\n#define lauxlib_h\r\n\r\n\r\n#include <stddef.h>\r\n#include <stdio.h>\r\n\r\n#include \"lua.h\"\r\n\r\n\r\n#define luaL_getn(L,i)          ((int)lua_objlen(L, i))\r\n#define luaL_setn(L,i,j)        ((void)0)  /* no op! */\r\n\r\n/* extra error code for `luaL_load' */\r\n#define LUA_ERRFILE     (LUA_ERRERR+1)\r\n\r\ntypedef struct luaL_Reg {\r\n  const char *name;\r\n  lua_CFunction func;\r\n} luaL_Reg;\r\n\r\nLUALIB_API void (luaL_openlib) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l, int nup);\r\nLUALIB_API void (luaL_register) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l);\r\nLUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_typerror) (lua_State *L, int narg, const char *tname);\r\nLUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg);\r\nLUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg,\r\n                                                          size_t *l);\r\nLUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg,\r\n                                          const char *def, size_t *l);\r\nLUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg);\r\nLUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def);\r\n\r\nLUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);\r\nLUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,\r\n                                          lua_Integer def);\r\n\r\nLUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);\r\nLUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t);\r\nLUALIB_API void (luaL_checkany) (lua_State *L, int narg);\r\n\r\nLUALIB_API int   (luaL_newmetatable) (lua_State *L, const char *tname);\r\nLUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname);\r\n\r\nLUALIB_API void (luaL_where) (lua_State *L, int lvl);\r\nLUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);\r\n\r\nLUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,\r\n                                   const char *const lst[]);\r\n\r\nLUALIB_API int (luaL_ref) (lua_State *L, int t);\r\nLUALIB_API void (luaL_unref) (lua_State *L, int t, int ref);\r\n\r\nLUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename);\r\nLUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,\r\n                                  const char *name);\r\nLUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);\r\n\r\nLUALIB_API lua_State *(luaL_newstate) (void);\r\n\r\n\r\nLUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,\r\n                                                  const char *r);\r\n\r\nLUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,\r\n                                         const char *fname, int szhint);\r\n\r\n/* From Lua 5.2. */\r\nLUALIB_API int luaL_fileresult(lua_State *L, int stat, const char *fname);\r\nLUALIB_API int luaL_execresult(lua_State *L, int stat);\r\nLUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename,\r\n\t\t\t\t const char *mode);\r\nLUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz,\r\n\t\t\t\t   const char *name, const char *mode);\r\nLUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, const char *msg,\r\n\t\t\t\tint level);\r\n\r\n\r\n/*\r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define luaL_argcheck(L, cond,numarg,extramsg)\t\\\r\n\t\t((void)((cond) || luaL_argerror(L, (numarg), (extramsg))))\r\n#define luaL_checkstring(L,n)\t(luaL_checklstring(L, (n), NULL))\r\n#define luaL_optstring(L,n,d)\t(luaL_optlstring(L, (n), (d), NULL))\r\n#define luaL_checkint(L,n)\t((int)luaL_checkinteger(L, (n)))\r\n#define luaL_optint(L,n,d)\t((int)luaL_optinteger(L, (n), (d)))\r\n#define luaL_checklong(L,n)\t((long)luaL_checkinteger(L, (n)))\r\n#define luaL_optlong(L,n,d)\t((long)luaL_optinteger(L, (n), (d)))\r\n\r\n#define luaL_typename(L,i)\tlua_typename(L, lua_type(L,(i)))\r\n\r\n#define luaL_dofile(L, fn) \\\r\n\t(luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_dostring(L, s) \\\r\n\t(luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_getmetatable(L,n)\t(lua_getfield(L, LUA_REGISTRYINDEX, (n)))\r\n\r\n#define luaL_opt(L,f,n,d)\t(lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))\r\n\r\n/*\r\n** {======================================================\r\n** Generic Buffer manipulation\r\n** =======================================================\r\n*/\r\n\r\n\r\n\r\ntypedef struct luaL_Buffer {\r\n  char *p;\t\t\t/* current position in buffer */\r\n  int lvl;  /* number of strings in the stack (level) */\r\n  lua_State *L;\r\n  char buffer[LUAL_BUFFERSIZE];\r\n} luaL_Buffer;\r\n\r\n#define luaL_addchar(B,c) \\\r\n  ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \\\r\n   (*(B)->p++ = (char)(c)))\r\n\r\n/* compatibility only */\r\n#define luaL_putchar(B,c)\tluaL_addchar(B,c)\r\n\r\n#define luaL_addsize(B,n)\t((B)->p += (n))\r\n\r\nLUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B);\r\nLUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l);\r\nLUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s);\r\nLUALIB_API void (luaL_addvalue) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_pushresult) (luaL_Buffer *B);\r\n\r\n\r\n/* }====================================================== */\r\n\r\n\r\n/* compatibility with ref system */\r\n\r\n/* pre-defined references */\r\n#define LUA_NOREF       (-2)\r\n#define LUA_REFNIL      (-1)\r\n\r\n#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \\\r\n      (lua_pushstring(L, \"unlocked references are obsolete\"), lua_error(L), 0))\r\n\r\n#define lua_unref(L,ref)        luaL_unref(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n#define lua_getref(L,ref)       lua_rawgeti(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n\r\n#define luaL_reg\tluaL_Reg\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_aux.c",
    "content": "/*\r\n** Auxiliary library for the Lua/C API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major parts taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdarg.h>\r\n#include <stdio.h>\r\n\r\n#define lib_aux_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <sys/wait.h>\r\n#endif\r\n\r\n/* -- I/O error handling -------------------------------------------------- */\r\n\r\nLUALIB_API int luaL_fileresult(lua_State *L, int stat, const char *fname)\r\n{\r\n  if (stat) {\r\n    setboolV(L->top++, 1);\r\n    return 1;\r\n  } else {\r\n    int en = errno;  /* Lua API calls may change this value. */\r\n    setnilV(L->top++);\r\n    if (fname)\r\n      lua_pushfstring(L, \"%s: %s\", fname, strerror(en));\r\n    else\r\n      lua_pushfstring(L, \"%s\", strerror(en));\r\n    setintV(L->top++, en);\r\n    lj_trace_abort(G(L));\r\n    return 3;\r\n  }\r\n}\r\n\r\nLUALIB_API int luaL_execresult(lua_State *L, int stat)\r\n{\r\n  if (stat != -1) {\r\n#if LJ_TARGET_POSIX\r\n    if (WIFSIGNALED(stat)) {\r\n      stat = WTERMSIG(stat);\r\n      setnilV(L->top++);\r\n      lua_pushliteral(L, \"signal\");\r\n    } else {\r\n      if (WIFEXITED(stat))\r\n\tstat = WEXITSTATUS(stat);\r\n      if (stat == 0)\r\n\tsetboolV(L->top++, 1);\r\n      else\r\n\tsetnilV(L->top++);\r\n      lua_pushliteral(L, \"exit\");\r\n    }\r\n#else\r\n    if (stat == 0)\r\n      setboolV(L->top++, 1);\r\n    else\r\n      setnilV(L->top++);\r\n    lua_pushliteral(L, \"exit\");\r\n#endif\r\n    setintV(L->top++, stat);\r\n    return 3;\r\n  }\r\n  return luaL_fileresult(L, 0, NULL);\r\n}\r\n\r\n/* -- Module registration ------------------------------------------------- */\r\n\r\nLUALIB_API const char *luaL_findtable(lua_State *L, int idx,\r\n\t\t\t\t      const char *fname, int szhint)\r\n{\r\n  const char *e;\r\n  lua_pushvalue(L, idx);\r\n  do {\r\n    e = strchr(fname, '.');\r\n    if (e == NULL) e = fname + strlen(fname);\r\n    lua_pushlstring(L, fname, (size_t)(e - fname));\r\n    lua_rawget(L, -2);\r\n    if (lua_isnil(L, -1)) {  /* no such field? */\r\n      lua_pop(L, 1);  /* remove this nil */\r\n      lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */\r\n      lua_pushlstring(L, fname, (size_t)(e - fname));\r\n      lua_pushvalue(L, -2);\r\n      lua_settable(L, -4);  /* set new table into field */\r\n    } else if (!lua_istable(L, -1)) {  /* field has a non-table value? */\r\n      lua_pop(L, 2);  /* remove table and value */\r\n      return fname;  /* return problematic part of the name */\r\n    }\r\n    lua_remove(L, -2);  /* remove previous table */\r\n    fname = e + 1;\r\n  } while (*e == '.');\r\n  return NULL;\r\n}\r\n\r\nstatic int libsize(const luaL_Reg *l)\r\n{\r\n  int size = 0;\r\n  for (; l->name; l++) size++;\r\n  return size;\r\n}\r\n\r\nLUALIB_API void luaL_openlib(lua_State *L, const char *libname,\r\n\t\t\t     const luaL_Reg *l, int nup)\r\n{\r\n  lj_lib_checkfpu(L);\r\n  if (libname) {\r\n    int size = libsize(l);\r\n    /* check whether lib already exists */\r\n    luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n    lua_getfield(L, -1, libname);  /* get _LOADED[libname] */\r\n    if (!lua_istable(L, -1)) {  /* not found? */\r\n      lua_pop(L, 1);  /* remove previous result */\r\n      /* try global variable (and create one if it does not exist) */\r\n      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)\r\n\tlj_err_callerv(L, LJ_ERR_BADMODN, libname);\r\n      lua_pushvalue(L, -1);\r\n      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */\r\n    }\r\n    lua_remove(L, -2);  /* remove _LOADED table */\r\n    lua_insert(L, -(nup+1));  /* move library table to below upvalues */\r\n  }\r\n  for (; l->name; l++) {\r\n    int i;\r\n    for (i = 0; i < nup; i++)  /* copy upvalues to the top */\r\n      lua_pushvalue(L, -nup);\r\n    lua_pushcclosure(L, l->func, nup);\r\n    lua_setfield(L, -(nup+2), l->name);\r\n  }\r\n  lua_pop(L, nup);  /* remove upvalues */\r\n}\r\n\r\nLUALIB_API void luaL_register(lua_State *L, const char *libname,\r\n\t\t\t      const luaL_Reg *l)\r\n{\r\n  luaL_openlib(L, libname, l, 0);\r\n}\r\n\r\nLUALIB_API const char *luaL_gsub(lua_State *L, const char *s,\r\n\t\t\t\t const char *p, const char *r)\r\n{\r\n  const char *wild;\r\n  size_t l = strlen(p);\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  while ((wild = strstr(s, p)) != NULL) {\r\n    luaL_addlstring(&b, s, (size_t)(wild - s));  /* push prefix */\r\n    luaL_addstring(&b, r);  /* push replacement in place of pattern */\r\n    s = wild + l;  /* continue after `p' */\r\n  }\r\n  luaL_addstring(&b, s);  /* push last suffix */\r\n  luaL_pushresult(&b);\r\n  return lua_tostring(L, -1);\r\n}\r\n\r\n/* -- Buffer handling ----------------------------------------------------- */\r\n\r\n#define bufflen(B)\t((size_t)((B)->p - (B)->buffer))\r\n#define bufffree(B)\t((size_t)(LUAL_BUFFERSIZE - bufflen(B)))\r\n\r\nstatic int emptybuffer(luaL_Buffer *B)\r\n{\r\n  size_t l = bufflen(B);\r\n  if (l == 0)\r\n    return 0;  /* put nothing on stack */\r\n  lua_pushlstring(B->L, B->buffer, l);\r\n  B->p = B->buffer;\r\n  B->lvl++;\r\n  return 1;\r\n}\r\n\r\nstatic void adjuststack(luaL_Buffer *B)\r\n{\r\n  if (B->lvl > 1) {\r\n    lua_State *L = B->L;\r\n    int toget = 1;  /* number of levels to concat */\r\n    size_t toplen = lua_strlen(L, -1);\r\n    do {\r\n      size_t l = lua_strlen(L, -(toget+1));\r\n      if (!(B->lvl - toget + 1 >= LUA_MINSTACK/2 || toplen > l))\r\n\tbreak;\r\n      toplen += l;\r\n      toget++;\r\n    } while (toget < B->lvl);\r\n    lua_concat(L, toget);\r\n    B->lvl = B->lvl - toget + 1;\r\n  }\r\n}\r\n\r\nLUALIB_API char *luaL_prepbuffer(luaL_Buffer *B)\r\n{\r\n  if (emptybuffer(B))\r\n    adjuststack(B);\r\n  return B->buffer;\r\n}\r\n\r\nLUALIB_API void luaL_addlstring(luaL_Buffer *B, const char *s, size_t l)\r\n{\r\n  while (l--)\r\n    luaL_addchar(B, *s++);\r\n}\r\n\r\nLUALIB_API void luaL_addstring(luaL_Buffer *B, const char *s)\r\n{\r\n  luaL_addlstring(B, s, strlen(s));\r\n}\r\n\r\nLUALIB_API void luaL_pushresult(luaL_Buffer *B)\r\n{\r\n  emptybuffer(B);\r\n  lua_concat(B->L, B->lvl);\r\n  B->lvl = 1;\r\n}\r\n\r\nLUALIB_API void luaL_addvalue(luaL_Buffer *B)\r\n{\r\n  lua_State *L = B->L;\r\n  size_t vl;\r\n  const char *s = lua_tolstring(L, -1, &vl);\r\n  if (vl <= bufffree(B)) {  /* fit into buffer? */\r\n    memcpy(B->p, s, vl);  /* put it there */\r\n    B->p += vl;\r\n    lua_pop(L, 1);  /* remove from stack */\r\n  } else {\r\n    if (emptybuffer(B))\r\n      lua_insert(L, -2);  /* put buffer before new value */\r\n    B->lvl++;  /* add new value into B stack */\r\n    adjuststack(B);\r\n  }\r\n}\r\n\r\nLUALIB_API void luaL_buffinit(lua_State *L, luaL_Buffer *B)\r\n{\r\n  B->L = L;\r\n  B->p = B->buffer;\r\n  B->lvl = 0;\r\n}\r\n\r\n/* -- Reference management ------------------------------------------------ */\r\n\r\n#define FREELIST_REF\t0\r\n\r\n/* Convert a stack index to an absolute index. */\r\n#define abs_index(L, i) \\\r\n  ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : lua_gettop(L) + (i) + 1)\r\n\r\nLUALIB_API int luaL_ref(lua_State *L, int t)\r\n{\r\n  int ref;\r\n  t = abs_index(L, t);\r\n  if (lua_isnil(L, -1)) {\r\n    lua_pop(L, 1);  /* remove from stack */\r\n    return LUA_REFNIL;  /* `nil' has a unique fixed reference */\r\n  }\r\n  lua_rawgeti(L, t, FREELIST_REF);  /* get first free element */\r\n  ref = (int)lua_tointeger(L, -1);  /* ref = t[FREELIST_REF] */\r\n  lua_pop(L, 1);  /* remove it from stack */\r\n  if (ref != 0) {  /* any free element? */\r\n    lua_rawgeti(L, t, ref);  /* remove it from list */\r\n    lua_rawseti(L, t, FREELIST_REF);  /* (t[FREELIST_REF] = t[ref]) */\r\n  } else {  /* no free elements */\r\n    ref = (int)lua_objlen(L, t);\r\n    ref++;  /* create new reference */\r\n  }\r\n  lua_rawseti(L, t, ref);\r\n  return ref;\r\n}\r\n\r\nLUALIB_API void luaL_unref(lua_State *L, int t, int ref)\r\n{\r\n  if (ref >= 0) {\r\n    t = abs_index(L, t);\r\n    lua_rawgeti(L, t, FREELIST_REF);\r\n    lua_rawseti(L, t, ref);  /* t[ref] = t[FREELIST_REF] */\r\n    lua_pushinteger(L, ref);\r\n    lua_rawseti(L, t, FREELIST_REF);  /* t[FREELIST_REF] = ref */\r\n  }\r\n}\r\n\r\n/* -- Default allocator and panic function -------------------------------- */\r\n\r\nstatic int panic(lua_State *L)\r\n{\r\n  const char *s = lua_tostring(L, -1);\r\n  fputs(\"PANIC: unprotected error in call to Lua API (\", stderr);\r\n  fputs(s ? s : \"?\", stderr);\r\n  fputc(')', stderr); fputc('\\n', stderr);\r\n  fflush(stderr);\r\n  return 0;\r\n}\r\n\r\n#ifdef LUAJIT_USE_SYSMALLOC\r\n\r\n#if LJ_64 && !defined(LUAJIT_USE_VALGRIND)\r\n#error \"Must use builtin allocator for 64 bit target\"\r\n#endif\r\n\r\nstatic void *mem_alloc(void *ud, void *ptr, size_t osize, size_t nsize)\r\n{\r\n  (void)ud;\r\n  (void)osize;\r\n  if (nsize == 0) {\r\n    free(ptr);\r\n    return NULL;\r\n  } else {\r\n    return realloc(ptr, nsize);\r\n  }\r\n}\r\n\r\nLUALIB_API lua_State *luaL_newstate(void)\r\n{\r\n  lua_State *L = lua_newstate(mem_alloc, NULL);\r\n  if (L) G(L)->panic = panic;\r\n  return L;\r\n}\r\n\r\n#else\r\n\r\n#include \"lj_alloc.h\"\r\n\r\nLUALIB_API lua_State *luaL_newstate(void)\r\n{\r\n  lua_State *L;\r\n  void *ud = lj_alloc_create();\r\n  if (ud == NULL) return NULL;\r\n#if LJ_64\r\n  L = lj_state_newstate(lj_alloc_f, ud);\r\n#else\r\n  L = lua_newstate(lj_alloc_f, ud);\r\n#endif\r\n  if (L) G(L)->panic = panic;\r\n  return L;\r\n}\r\n\r\n#if LJ_64\r\nLUA_API lua_State *lua_newstate(lua_Alloc f, void *ud)\r\n{\r\n  UNUSED(f); UNUSED(ud);\r\n  fputs(\"Must use luaL_newstate() for 64 bit target\\n\", stderr);\r\n  return NULL;\r\n}\r\n#endif\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_base.c",
    "content": "/*\r\n** Base and coroutine library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2011 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lib_base_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#endif\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- Base library: checks ------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_base\r\n\r\nLJLIB_ASM(assert)\t\tLJLIB_REC(.)\r\n{\r\n  GCstr *s;\r\n  lj_lib_checkany(L, 1);\r\n  s = lj_lib_optstr(L, 2);\r\n  if (s)\r\n    lj_err_callermsg(L, strdata(s));\r\n  else\r\n    lj_err_caller(L, LJ_ERR_ASSERT);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\n/* ORDER LJ_T */\r\nLJLIB_PUSH(\"nil\")\r\nLJLIB_PUSH(\"boolean\")\r\nLJLIB_PUSH(top-1)  /* boolean */\r\nLJLIB_PUSH(\"userdata\")\r\nLJLIB_PUSH(\"string\")\r\nLJLIB_PUSH(\"upval\")\r\nLJLIB_PUSH(\"thread\")\r\nLJLIB_PUSH(\"proto\")\r\nLJLIB_PUSH(\"function\")\r\nLJLIB_PUSH(\"trace\")\r\nLJLIB_PUSH(\"cdata\")\r\nLJLIB_PUSH(\"table\")\r\nLJLIB_PUSH(top-9)  /* userdata */\r\nLJLIB_PUSH(\"number\")\r\nLJLIB_ASM_(type)\t\tLJLIB_REC(.)\r\n/* Recycle the lj_lib_checkany(L, 1) from assert. */\r\n\r\n/* -- Base library: iterators --------------------------------------------- */\r\n\r\n/* This solves a circular dependency problem -- change FF_next_N as needed. */\r\nLJ_STATIC_ASSERT((int)FF_next == FF_next_N);\r\n\r\nLJLIB_ASM(next)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\n#if LJ_52 || LJ_HASFFI\r\nstatic int ffh_pairs(lua_State *L, MMS mm)\r\n{\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  cTValue *mo = lj_meta_lookup(L, o, mm);\r\n  if ((LJ_52 || tviscdata(o)) && !tvisnil(mo)) {\r\n    L->top = o+1;  /* Only keep one argument. */\r\n    copyTV(L, L->base-1, mo);  /* Replace callable. */\r\n    return FFH_TAILCALL;\r\n  } else {\r\n    if (!tvistab(o)) lj_err_argt(L, 1, LUA_TTABLE);\r\n    setfuncV(L, o-1, funcV(lj_lib_upvalue(L, 1)));\r\n    if (mm == MM_pairs) setnilV(o+1); else setintV(o+1, 0);\r\n    return FFH_RES(3);\r\n  }\r\n}\r\n#else\r\n#define ffh_pairs(L, mm)\t(lj_lib_checktab(L, 1), FFH_UNREACHABLE)\r\n#endif\r\n\r\nLJLIB_PUSH(lastcl)\r\nLJLIB_ASM(pairs)\r\n{\r\n  return ffh_pairs(L, MM_pairs);\r\n}\r\n\r\nLJLIB_NOREGUV LJLIB_ASM(ipairs_aux)\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkint(L, 2);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nLJLIB_PUSH(lastcl)\r\nLJLIB_ASM(ipairs)\t\tLJLIB_REC(.)\r\n{\r\n  return ffh_pairs(L, MM_ipairs);\r\n}\r\n\r\n/* -- Base library: getters and setters ----------------------------------- */\r\n\r\nLJLIB_ASM_(getmetatable)\tLJLIB_REC(.)\r\n/* Recycle the lj_lib_checkany(L, 1) from assert. */\r\n\r\nLJLIB_ASM(setmetatable)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCtab *mt = lj_lib_checktabornil(L, 2);\r\n  if (!tvisnil(lj_meta_lookup(L, L->base, MM_metatable)))\r\n    lj_err_caller(L, LJ_ERR_PROTMT);\r\n  setgcref(t->metatable, obj2gco(mt));\r\n  if (mt) { lj_gc_objbarriert(L, t, mt); }\r\n  settabV(L, L->base-1, t);\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_CF(getfenv)\r\n{\r\n  GCfunc *fn;\r\n  cTValue *o = L->base;\r\n  if (!(o < L->top && tvisfunc(o))) {\r\n    int level = lj_lib_optint(L, 1, 1);\r\n    o = lj_debug_frame(L, level, &level);\r\n    if (o == NULL)\r\n      lj_err_arg(L, 1, LJ_ERR_INVLVL);\r\n  }\r\n  fn = &gcval(o)->fn;\r\n  settabV(L, L->top++, isluafunc(fn) ? tabref(fn->l.env) : tabref(L->env));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(setfenv)\r\n{\r\n  GCfunc *fn;\r\n  GCtab *t = lj_lib_checktab(L, 2);\r\n  cTValue *o = L->base;\r\n  if (!(o < L->top && tvisfunc(o))) {\r\n    int level = lj_lib_checkint(L, 1);\r\n    if (level == 0) {\r\n      /* NOBARRIER: A thread (i.e. L) is never black. */\r\n      setgcref(L->env, obj2gco(t));\r\n      return 0;\r\n    }\r\n    o = lj_debug_frame(L, level, &level);\r\n    if (o == NULL)\r\n      lj_err_arg(L, 1, LJ_ERR_INVLVL);\r\n  }\r\n  fn = &gcval(o)->fn;\r\n  if (!isluafunc(fn))\r\n    lj_err_caller(L, LJ_ERR_SETFENV);\r\n  setgcref(fn->l.env, obj2gco(t));\r\n  lj_gc_objbarrier(L, obj2gco(fn), t);\r\n  setfuncV(L, L->top++, fn);\r\n  return 1;\r\n}\r\n\r\nLJLIB_ASM(rawget)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkany(L, 2);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nLJLIB_CF(rawset)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkany(L, 2);\r\n  L->top = 1+lj_lib_checkany(L, 3);\r\n  lua_rawset(L, 1);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(rawequal)\t\tLJLIB_REC(.)\r\n{\r\n  cTValue *o1 = lj_lib_checkany(L, 1);\r\n  cTValue *o2 = lj_lib_checkany(L, 2);\r\n  setboolV(L->top-1, lj_obj_equal(o1, o2));\r\n  return 1;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_CF(rawlen)\t\tLJLIB_REC(.)\r\n{\r\n  cTValue *o = L->base;\r\n  int32_t len;\r\n  if (L->top > o && tvisstr(o))\r\n    len = (int32_t)strV(o)->len;\r\n  else\r\n    len = (int32_t)lj_tab_len(lj_lib_checktab(L, 1));\r\n  setintV(L->top-1, len);\r\n  return 1;\r\n}\r\n#endif\r\n\r\nLJLIB_CF(unpack)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n, i = lj_lib_optint(L, 2, 1);\r\n  int32_t e = (L->base+3-1 < L->top && !tvisnil(L->base+3-1)) ?\r\n\t      lj_lib_checkint(L, 3) : (int32_t)lj_tab_len(t);\r\n  if (i > e) return 0;\r\n  n = e - i + 1;\r\n  if (n <= 0 || !lua_checkstack(L, n))\r\n    lj_err_caller(L, LJ_ERR_UNPACK);\r\n  do {\r\n    cTValue *tv = lj_tab_getint(t, i);\r\n    if (tv) {\r\n      copyTV(L, L->top++, tv);\r\n    } else {\r\n      setnilV(L->top++);\r\n    }\r\n  } while (i++ < e);\r\n  return n;\r\n}\r\n\r\nLJLIB_CF(select)\t\tLJLIB_REC(.)\r\n{\r\n  int32_t n = (int32_t)(L->top - L->base);\r\n  if (n >= 1 && tvisstr(L->base) && *strVdata(L->base) == '#') {\r\n    setintV(L->top-1, n-1);\r\n    return 1;\r\n  } else {\r\n    int32_t i = lj_lib_checkint(L, 1);\r\n    if (i < 0) i = n + i; else if (i > n) i = n;\r\n    if (i < 1)\r\n      lj_err_arg(L, 1, LJ_ERR_IDXRNG);\r\n    return n - i;\r\n  }\r\n}\r\n\r\n/* -- Base library: conversions ------------------------------------------- */\r\n\r\nLJLIB_ASM(tonumber)\t\tLJLIB_REC(.)\r\n{\r\n  int32_t base = lj_lib_optint(L, 2, 10);\r\n  if (base == 10) {\r\n    TValue *o = lj_lib_checkany(L, 1);\r\n    if (lj_strscan_numberobj(o)) {\r\n      copyTV(L, L->base-1, o);\r\n      return FFH_RES(1);\r\n    }\r\n#if LJ_HASFFI\r\n    if (tviscdata(o)) {\r\n      CTState *cts = ctype_cts(L);\r\n      CType *ct = lj_ctype_rawref(cts, cdataV(o)->ctypeid);\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      if (ctype_isnum(ct->info) || ctype_iscomplex(ct->info)) {\r\n\tif (LJ_DUALNUM && ctype_isinteger_or_bool(ct->info) &&\r\n\t    ct->size <= 4 && !(ct->size == 4 && (ct->info & CTF_UNSIGNED))) {\r\n\t  int32_t i;\r\n\t  lj_cconv_ct_tv(cts, ctype_get(cts, CTID_INT32), (uint8_t *)&i, o, 0);\r\n\t  setintV(L->base-1, i);\r\n\t  return FFH_RES(1);\r\n\t}\r\n\tlj_cconv_ct_tv(cts, ctype_get(cts, CTID_DOUBLE),\r\n\t\t       (uint8_t *)&(L->base-1)->n, o, 0);\r\n\treturn FFH_RES(1);\r\n      }\r\n    }\r\n#endif\r\n  } else {\r\n    const char *p = strdata(lj_lib_checkstr(L, 1));\r\n    char *ep;\r\n    unsigned long ul;\r\n    if (base < 2 || base > 36)\r\n      lj_err_arg(L, 2, LJ_ERR_BASERNG);\r\n    ul = strtoul(p, &ep, base);\r\n    if (p != ep) {\r\n      while (lj_char_isspace((unsigned char)(*ep))) ep++;\r\n      if (*ep == '\\0') {\r\n\tif (LJ_DUALNUM && LJ_LIKELY(ul < 0x80000000u))\r\n\t  setintV(L->base-1, (int32_t)ul);\r\n\telse\r\n\t  setnumV(L->base-1, (lua_Number)ul);\r\n\treturn FFH_RES(1);\r\n      }\r\n    }\r\n  }\r\n  setnilV(L->base-1);\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_PUSH(\"nil\")\r\nLJLIB_PUSH(\"false\")\r\nLJLIB_PUSH(\"true\")\r\nLJLIB_ASM(tostring)\t\tLJLIB_REC(.)\r\n{\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  cTValue *mo;\r\n  L->top = o+1;  /* Only keep one argument. */\r\n  if (!tvisnil(mo = lj_meta_lookup(L, o, MM_tostring))) {\r\n    copyTV(L, L->base-1, mo);  /* Replace callable. */\r\n    return FFH_TAILCALL;\r\n  } else {\r\n    GCstr *s;\r\n    if (tvisnumber(o)) {\r\n      s = lj_str_fromnumber(L, o);\r\n    } else if (tvispri(o)) {\r\n      s = strV(lj_lib_upvalue(L, -(int32_t)itype(o)));\r\n    } else {\r\n      if (tvisfunc(o) && isffunc(funcV(o)))\r\n\tlua_pushfstring(L, \"function: builtin#%d\", funcV(o)->c.ffid);\r\n      else\r\n\tlua_pushfstring(L, \"%s: %p\", lj_typename(o), lua_topointer(L, 1));\r\n      /* Note: lua_pushfstring calls the GC which may invalidate o. */\r\n      s = strV(L->top-1);\r\n    }\r\n    setstrV(L, L->base-1, s);\r\n    return FFH_RES(1);\r\n  }\r\n}\r\n\r\n/* -- Base library: throw and catch errors -------------------------------- */\r\n\r\nLJLIB_CF(error)\r\n{\r\n  int32_t level = lj_lib_optint(L, 2, 1);\r\n  lua_settop(L, 1);\r\n  if (lua_isstring(L, 1) && level > 0) {\r\n    luaL_where(L, level);\r\n    lua_pushvalue(L, 1);\r\n    lua_concat(L, 2);\r\n  }\r\n  return lua_error(L);\r\n}\r\n\r\nLJLIB_ASM(pcall)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  lj_lib_checkfunc(L, 2);  /* For xpcall only. */\r\n  return FFH_UNREACHABLE;\r\n}\r\nLJLIB_ASM_(xpcall)\t\tLJLIB_REC(.)\r\n\r\n/* -- Base library: load Lua code ----------------------------------------- */\r\n\r\nstatic int load_aux(lua_State *L, int status, int envarg)\r\n{\r\n  if (status == 0) {\r\n    if (tvistab(L->base+envarg-1)) {\r\n      GCfunc *fn = funcV(L->top-1);\r\n      GCtab *t = tabV(L->base+envarg-1);\r\n      setgcref(fn->c.env, obj2gco(t));\r\n      lj_gc_objbarrier(L, fn, t);\r\n    }\r\n    return 1;\r\n  } else {\r\n    setnilV(L->top-2);\r\n    return 2;\r\n  }\r\n}\r\n\r\nLJLIB_CF(loadfile)\r\n{\r\n  GCstr *fname = lj_lib_optstr(L, 1);\r\n  GCstr *mode = lj_lib_optstr(L, 2);\r\n  int status;\r\n  lua_settop(L, 3);  /* Ensure env arg exists. */\r\n  status = luaL_loadfilex(L, fname ? strdata(fname) : NULL,\r\n\t\t\t  mode ? strdata(mode) : NULL);\r\n  return load_aux(L, status, 3);\r\n}\r\n\r\nstatic const char *reader_func(lua_State *L, void *ud, size_t *size)\r\n{\r\n  UNUSED(ud);\r\n  luaL_checkstack(L, 2, \"too many nested functions\");\r\n  copyTV(L, L->top++, L->base);\r\n  lua_call(L, 0, 1);  /* Call user-supplied function. */\r\n  L->top--;\r\n  if (tvisnil(L->top)) {\r\n    *size = 0;\r\n    return NULL;\r\n  } else if (tvisstr(L->top) || tvisnumber(L->top)) {\r\n    copyTV(L, L->base+4, L->top);  /* Anchor string in reserved stack slot. */\r\n    return lua_tolstring(L, 5, size);\r\n  } else {\r\n    lj_err_caller(L, LJ_ERR_RDRSTR);\r\n    return NULL;\r\n  }\r\n}\r\n\r\nLJLIB_CF(load)\r\n{\r\n  GCstr *name = lj_lib_optstr(L, 2);\r\n  GCstr *mode = lj_lib_optstr(L, 3);\r\n  int status;\r\n  if (L->base < L->top && (tvisstr(L->base) || tvisnumber(L->base))) {\r\n    GCstr *s = lj_lib_checkstr(L, 1);\r\n    lua_settop(L, 4);  /* Ensure env arg exists. */\r\n    status = luaL_loadbufferx(L, strdata(s), s->len, strdata(name ? name : s),\r\n\t\t\t      mode ? strdata(mode) : NULL);\r\n  } else {\r\n    lj_lib_checkfunc(L, 1);\r\n    lua_settop(L, 5);  /* Reserve a slot for the string from the reader. */\r\n    status = lua_loadx(L, reader_func, NULL, name ? strdata(name) : \"=(load)\",\r\n\t\t       mode ? strdata(mode) : NULL);\r\n  }\r\n  return load_aux(L, status, 4);\r\n}\r\n\r\nLJLIB_CF(loadstring)\r\n{\r\n  return lj_cf_load(L);\r\n}\r\n\r\nLJLIB_CF(dofile)\r\n{\r\n  GCstr *fname = lj_lib_optstr(L, 1);\r\n  setnilV(L->top);\r\n  L->top = L->base+1;\r\n  if (luaL_loadfile(L, fname ? strdata(fname) : NULL) != 0)\r\n    lua_error(L);\r\n  lua_call(L, 0, LUA_MULTRET);\r\n  return (int)(L->top - L->base) - 1;\r\n}\r\n\r\n/* -- Base library: GC control -------------------------------------------- */\r\n\r\nLJLIB_CF(gcinfo)\r\n{\r\n  setintV(L->top++, (G(L)->gc.total >> 10));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(collectgarbage)\r\n{\r\n  int opt = lj_lib_checkopt(L, 1, LUA_GCCOLLECT,  /* ORDER LUA_GC* */\r\n    \"\\4stop\\7restart\\7collect\\5count\\1\\377\\4step\\10setpause\\12setstepmul\");\r\n  int32_t data = lj_lib_optint(L, 2, 0);\r\n  if (opt == LUA_GCCOUNT) {\r\n    setnumV(L->top, (lua_Number)G(L)->gc.total/1024.0);\r\n  } else {\r\n    int res = lua_gc(L, opt, data);\r\n    if (opt == LUA_GCSTEP)\r\n      setboolV(L->top, res);\r\n    else\r\n      setintV(L->top, res);\r\n  }\r\n  L->top++;\r\n  return 1;\r\n}\r\n\r\n/* -- Base library: miscellaneous functions ------------------------------- */\r\n\r\nLJLIB_PUSH(top-2)  /* Upvalue holds weak table. */\r\nLJLIB_CF(newproxy)\r\n{\r\n  lua_settop(L, 1);\r\n  lua_newuserdata(L, 0);\r\n  if (lua_toboolean(L, 1) == 0) {  /* newproxy(): without metatable. */\r\n    return 1;\r\n  } else if (lua_isboolean(L, 1)) {  /* newproxy(true): with metatable. */\r\n    lua_newtable(L);\r\n    lua_pushvalue(L, -1);\r\n    lua_pushboolean(L, 1);\r\n    lua_rawset(L, lua_upvalueindex(1));  /* Remember mt in weak table. */\r\n  } else {  /* newproxy(proxy): inherit metatable. */\r\n    int validproxy = 0;\r\n    if (lua_getmetatable(L, 1)) {\r\n      lua_rawget(L, lua_upvalueindex(1));\r\n      validproxy = lua_toboolean(L, -1);\r\n      lua_pop(L, 1);\r\n    }\r\n    if (!validproxy)\r\n      lj_err_arg(L, 1, LJ_ERR_NOPROXY);\r\n    lua_getmetatable(L, 1);\r\n  }\r\n  lua_setmetatable(L, 2);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(\"tostring\")\r\nLJLIB_CF(print)\r\n{\r\n  ptrdiff_t i, nargs = L->top - L->base;\r\n  cTValue *tv = lj_tab_getstr(tabref(L->env), strV(lj_lib_upvalue(L, 1)));\r\n  int shortcut;\r\n  if (tv && !tvisnil(tv)) {\r\n    copyTV(L, L->top++, tv);\r\n  } else {\r\n    setstrV(L, L->top++, strV(lj_lib_upvalue(L, 1)));\r\n    lua_gettable(L, LUA_GLOBALSINDEX);\r\n    tv = L->top-1;\r\n  }\r\n  shortcut = (tvisfunc(tv) && funcV(tv)->c.ffid == FF_tostring);\r\n  for (i = 0; i < nargs; i++) {\r\n    const char *str;\r\n    size_t size;\r\n    cTValue *o = &L->base[i];\r\n    if (shortcut && tvisstr(o)) {\r\n      str = strVdata(o);\r\n      size = strV(o)->len;\r\n    } else if (shortcut && tvisint(o)) {\r\n      char buf[LJ_STR_INTBUF];\r\n      char *p = lj_str_bufint(buf, intV(o));\r\n      size = (size_t)(buf+LJ_STR_INTBUF-p);\r\n      str = p;\r\n    } else if (shortcut && tvisnum(o)) {\r\n      char buf[LJ_STR_NUMBUF];\r\n      size = lj_str_bufnum(buf, o);\r\n      str = buf;\r\n    } else {\r\n      copyTV(L, L->top+1, o);\r\n      copyTV(L, L->top, L->top-1);\r\n      L->top += 2;\r\n      lua_call(L, 1, 1);\r\n      str = lua_tolstring(L, -1, &size);\r\n      if (!str)\r\n\tlj_err_caller(L, LJ_ERR_PRTOSTR);\r\n      L->top--;\r\n    }\r\n    if (i)\r\n      putchar('\\t');\r\n    fwrite(str, 1, size, stdout);\r\n  }\r\n  putchar('\\n');\r\n  return 0;\r\n}\r\n\r\nLJLIB_PUSH(top-3)\r\nLJLIB_SET(_VERSION)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- Coroutine library --------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_coroutine\r\n\r\nLJLIB_CF(coroutine_status)\r\n{\r\n  const char *s;\r\n  lua_State *co;\r\n  if (!(L->top > L->base && tvisthread(L->base)))\r\n    lj_err_arg(L, 1, LJ_ERR_NOCORO);\r\n  co = threadV(L->base);\r\n  if (co == L) s = \"running\";\r\n  else if (co->status == LUA_YIELD) s = \"suspended\";\r\n  else if (co->status != 0) s = \"dead\";\r\n  else if (co->base > tvref(co->stack)+1) s = \"normal\";\r\n  else if (co->top == co->base) s = \"dead\";\r\n  else s = \"suspended\";\r\n  lua_pushstring(L, s);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(coroutine_running)\r\n{\r\n#if LJ_52\r\n  int ismain = lua_pushthread(L);\r\n  setboolV(L->top++, ismain);\r\n  return 2;\r\n#else\r\n  if (lua_pushthread(L))\r\n    setnilV(L->top++);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(coroutine_create)\r\n{\r\n  lua_State *L1;\r\n  if (!(L->base < L->top && tvisfunc(L->base)))\r\n    lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  L1 = lua_newthread(L);\r\n  setfuncV(L, L1->top++, funcV(L->base));\r\n  return 1;\r\n}\r\n\r\nLJLIB_ASM(coroutine_yield)\r\n{\r\n  lj_err_caller(L, LJ_ERR_CYIELD);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nstatic int ffh_resume(lua_State *L, lua_State *co, int wrap)\r\n{\r\n  if (co->cframe != NULL || co->status > LUA_YIELD ||\r\n      (co->status == 0 && co->top == co->base)) {\r\n    ErrMsg em = co->cframe ? LJ_ERR_CORUN : LJ_ERR_CODEAD;\r\n    if (wrap) lj_err_caller(L, em);\r\n    setboolV(L->base-1, 0);\r\n    setstrV(L, L->base, lj_err_str(L, em));\r\n    return FFH_RES(2);\r\n  }\r\n  lj_state_growstack(co, (MSize)(L->top - L->base));\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(coroutine_resume)\r\n{\r\n  if (!(L->top > L->base && tvisthread(L->base)))\r\n    lj_err_arg(L, 1, LJ_ERR_NOCORO);\r\n  return ffh_resume(L, threadV(L->base), 0);\r\n}\r\n\r\nLJLIB_NOREG LJLIB_ASM(coroutine_wrap_aux)\r\n{\r\n  return ffh_resume(L, threadV(lj_lib_upvalue(L, 1)), 1);\r\n}\r\n\r\n/* Inline declarations. */\r\nLJ_ASMF void lj_ff_coroutine_wrap_aux(void);\r\n#if !(LJ_TARGET_MIPS && defined(ljamalg_c))\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L,\r\n\t\t\t\t\t\t\t  lua_State *co);\r\n#endif\r\n\r\n/* Error handler, called from assembler VM. */\r\nvoid LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L, lua_State *co)\r\n{\r\n  co->top--; copyTV(L, L->top, co->top); L->top++;\r\n  if (tvisstr(L->top-1))\r\n    lj_err_callermsg(L, strVdata(L->top-1));\r\n  else\r\n    lj_err_run(L);\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void setpc_wrap_aux(lua_State *L, GCfunc *fn);\r\n\r\nLJLIB_CF(coroutine_wrap)\r\n{\r\n  lj_cf_coroutine_create(L);\r\n  lj_lib_pushcc(L, lj_ffh_coroutine_wrap_aux, FF_coroutine_wrap_aux, 1);\r\n  setpc_wrap_aux(L, funcV(L->top-1));\r\n  return 1;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* Fix the PC of wrap_aux. Really ugly workaround. */\r\nstatic void setpc_wrap_aux(lua_State *L, GCfunc *fn)\r\n{\r\n  setmref(fn->c.pc, &L2GG(L)->bcff[lj_lib_init_coroutine[1]+2]);\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void newproxy_weaktable(lua_State *L)\r\n{\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  GCtab *t = lj_tab_new(L, 0, 1);\r\n  settabV(L, L->top++, t);\r\n  setgcref(t->metatable, obj2gco(t));\r\n  setstrV(L, lj_tab_setstr(L, t, lj_str_newlit(L, \"__mode\")),\r\n\t    lj_str_newlit(L, \"kv\"));\r\n  t->nomm = (uint8_t)(~(1u<<MM_mode));\r\n}\r\n\r\nLUALIB_API int luaopen_base(lua_State *L)\r\n{\r\n  /* NOBARRIER: Table and value are the same. */\r\n  GCtab *env = tabref(L->env);\r\n  settabV(L, lj_tab_setstr(L, env, lj_str_newlit(L, \"_G\")), env);\r\n  lua_pushliteral(L, LUA_VERSION);  /* top-3. */\r\n  newproxy_weaktable(L);  /* top-2. */\r\n  LJ_LIB_REG(L, \"_G\", base);\r\n  LJ_LIB_REG(L, LUA_COLIBNAME, coroutine);\r\n  return 2;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_bit.c",
    "content": "/*\r\n** Bit manipulation library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_bit_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_bit\r\n\r\nLJLIB_ASM(bit_tobit)\t\tLJLIB_REC(bit_unary IR_TOBIT)\r\n{\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(bit_bnot)\t\tLJLIB_REC(bit_unary IR_BNOT)\r\nLJLIB_ASM_(bit_bswap)\t\tLJLIB_REC(bit_unary IR_BSWAP)\r\n\r\nLJLIB_ASM(bit_lshift)\t\tLJLIB_REC(bit_shift IR_BSHL)\r\n{\r\n  lj_lib_checknumber(L, 1);\r\n  lj_lib_checkbit(L, 2);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(bit_rshift)\t\tLJLIB_REC(bit_shift IR_BSHR)\r\nLJLIB_ASM_(bit_arshift)\t\tLJLIB_REC(bit_shift IR_BSAR)\r\nLJLIB_ASM_(bit_rol)\t\tLJLIB_REC(bit_shift IR_BROL)\r\nLJLIB_ASM_(bit_ror)\t\tLJLIB_REC(bit_shift IR_BROR)\r\n\r\nLJLIB_ASM(bit_band)\t\tLJLIB_REC(bit_nary IR_BAND)\r\n{\r\n  int i = 0;\r\n  do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(bit_bor)\t\tLJLIB_REC(bit_nary IR_BOR)\r\nLJLIB_ASM_(bit_bxor)\t\tLJLIB_REC(bit_nary IR_BXOR)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(bit_tohex)\r\n{\r\n  uint32_t b = (uint32_t)lj_lib_checkbit(L, 1);\r\n  int32_t i, n = L->base+1 >= L->top ? 8 : lj_lib_checkbit(L, 2);\r\n  const char *hexdigits = \"0123456789abcdef\";\r\n  char buf[8];\r\n  if (n < 0) { n = -n; hexdigits = \"0123456789ABCDEF\"; }\r\n  if (n > 8) n = 8;\r\n  for (i = n; --i >= 0; ) { buf[i] = hexdigits[b & 15]; b >>= 4; }\r\n  lua_pushlstring(L, buf, (size_t)n);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_bit(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_BITLIBNAME, bit);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_debug.c",
    "content": "/*\r\n** Debug library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_debug_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_debug\r\n\r\nLJLIB_CF(debug_getregistry)\r\n{\r\n  copyTV(L, L->top++, registry(L));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_getmetatable)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    setnilV(L->top-1);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setmetatable)\r\n{\r\n  lj_lib_checktabornil(L, 2);\r\n  L->top = L->base+2;\r\n  lua_setmetatable(L, 1);\r\n#if !LJ_52\r\n  setboolV(L->top-1, 1);\r\n#endif\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_getfenv)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  lua_getfenv(L, 1);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setfenv)\r\n{\r\n  lj_lib_checktab(L, 2);\r\n  L->top = L->base+2;\r\n  if (!lua_setfenv(L, 1))\r\n    lj_err_caller(L, LJ_ERR_SETFENV);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void settabss(lua_State *L, const char *i, const char *v)\r\n{\r\n  lua_pushstring(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic void settabsi(lua_State *L, const char *i, int v)\r\n{\r\n  lua_pushinteger(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic void settabsb(lua_State *L, const char *i, int v)\r\n{\r\n  lua_pushboolean(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic lua_State *getthread(lua_State *L, int *arg)\r\n{\r\n  if (L->base < L->top && tvisthread(L->base)) {\r\n    *arg = 1;\r\n    return threadV(L->base);\r\n  } else {\r\n    *arg = 0;\r\n    return L;\r\n  }\r\n}\r\n\r\nstatic void treatstackoption(lua_State *L, lua_State *L1, const char *fname)\r\n{\r\n  if (L == L1) {\r\n    lua_pushvalue(L, -2);\r\n    lua_remove(L, -3);\r\n  }\r\n  else\r\n    lua_xmove(L1, L, 1);\r\n  lua_setfield(L, -2, fname);\r\n}\r\n\r\nLJLIB_CF(debug_getinfo)\r\n{\r\n  lj_Debug ar;\r\n  int arg, opt_f = 0, opt_L = 0;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  const char *options = luaL_optstring(L, arg+2, \"flnSu\");\r\n  if (lua_isnumber(L, arg+1)) {\r\n    if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), (lua_Debug *)&ar)) {\r\n      setnilV(L->top-1);\r\n      return 1;\r\n    }\r\n  } else if (L->base+arg < L->top && tvisfunc(L->base+arg)) {\r\n    options = lua_pushfstring(L, \">%s\", options);\r\n    setfuncV(L1, L1->top++, funcV(L->base+arg));\r\n  } else {\r\n    lj_err_arg(L, arg+1, LJ_ERR_NOFUNCL);\r\n  }\r\n  if (!lj_debug_getinfo(L1, options, &ar, 1))\r\n    lj_err_arg(L, arg+2, LJ_ERR_INVOPT);\r\n  lua_createtable(L, 0, 16);  /* Create result table. */\r\n  for (; *options; options++) {\r\n    switch (*options) {\r\n    case 'S':\r\n      settabss(L, \"source\", ar.source);\r\n      settabss(L, \"short_src\", ar.short_src);\r\n      settabsi(L, \"linedefined\", ar.linedefined);\r\n      settabsi(L, \"lastlinedefined\", ar.lastlinedefined);\r\n      settabss(L, \"what\", ar.what);\r\n      break;\r\n    case 'l':\r\n      settabsi(L, \"currentline\", ar.currentline);\r\n      break;\r\n    case 'u':\r\n      settabsi(L, \"nups\", ar.nups);\r\n      settabsi(L, \"nparams\", ar.nparams);\r\n      settabsb(L, \"isvararg\", ar.isvararg);\r\n      break;\r\n    case 'n':\r\n      settabss(L, \"name\", ar.name);\r\n      settabss(L, \"namewhat\", ar.namewhat);\r\n      break;\r\n    case 'f': opt_f = 1; break;\r\n    case 'L': opt_L = 1; break;\r\n    default: break;\r\n    }\r\n  }\r\n  if (opt_L) treatstackoption(L, L1, \"activelines\");\r\n  if (opt_f) treatstackoption(L, L1, \"func\");\r\n  return 1;  /* Return result table. */\r\n}\r\n\r\nLJLIB_CF(debug_getlocal)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  const char *name;\r\n  int slot = lj_lib_checkint(L, arg+2);\r\n  if (tvisfunc(L->base+arg)) {\r\n    L->top = L->base+arg+1;\r\n    lua_pushstring(L, lua_getlocal(L, NULL, slot));\r\n    return 1;\r\n  }\r\n  if (!lua_getstack(L1, lj_lib_checkint(L, arg+1), &ar))\r\n    lj_err_arg(L, arg+1, LJ_ERR_LVLRNG);\r\n  name = lua_getlocal(L1, &ar, slot);\r\n  if (name) {\r\n    lua_xmove(L1, L, 1);\r\n    lua_pushstring(L, name);\r\n    lua_pushvalue(L, -2);\r\n    return 2;\r\n  } else {\r\n    setnilV(L->top-1);\r\n    return 1;\r\n  }\r\n}\r\n\r\nLJLIB_CF(debug_setlocal)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  TValue *tv;\r\n  if (!lua_getstack(L1, lj_lib_checkint(L, arg+1), &ar))\r\n    lj_err_arg(L, arg+1, LJ_ERR_LVLRNG);\r\n  tv = lj_lib_checkany(L, arg+3);\r\n  copyTV(L1, L1->top++, tv);\r\n  lua_pushstring(L, lua_setlocal(L1, &ar, lj_lib_checkint(L, arg+2)));\r\n  return 1;\r\n}\r\n\r\nstatic int debug_getupvalue(lua_State *L, int get)\r\n{\r\n  int32_t n = lj_lib_checkint(L, 2);\r\n  const char *name;\r\n  lj_lib_checkfunc(L, 1);\r\n  name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);\r\n  if (name) {\r\n    lua_pushstring(L, name);\r\n    if (!get) return 1;\r\n    copyTV(L, L->top, L->top-2);\r\n    L->top++;\r\n    return 2;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(debug_getupvalue)\r\n{\r\n  return debug_getupvalue(L, 1);\r\n}\r\n\r\nLJLIB_CF(debug_setupvalue)\r\n{\r\n  lj_lib_checkany(L, 3);\r\n  return debug_getupvalue(L, 0);\r\n}\r\n\r\nLJLIB_CF(debug_upvalueid)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  int32_t n = lj_lib_checkint(L, 2) - 1;\r\n  if ((uint32_t)n >= fn->l.nupvalues)\r\n    lj_err_arg(L, 2, LJ_ERR_IDXRNG);\r\n  setlightudV(L->top-1, isluafunc(fn) ? (void *)gcref(fn->l.uvptr[n]) :\r\n\t\t\t\t\t(void *)&fn->c.upvalue[n]);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_upvaluejoin)\r\n{\r\n  GCfunc *fn[2];\r\n  GCRef *p[2];\r\n  int i;\r\n  for (i = 0; i < 2; i++) {\r\n    int32_t n;\r\n    fn[i] = lj_lib_checkfunc(L, 2*i+1);\r\n    if (!isluafunc(fn[i]))\r\n      lj_err_arg(L, 2*i+1, LJ_ERR_NOLFUNC);\r\n    n = lj_lib_checkint(L, 2*i+2) - 1;\r\n    if ((uint32_t)n >= fn[i]->l.nupvalues)\r\n      lj_err_arg(L, 2*i+2, LJ_ERR_IDXRNG);\r\n    p[i] = &fn[i]->l.uvptr[n];\r\n  }\r\n  setgcrefr(*p[0], *p[1]);\r\n  lj_gc_objbarrier(L, fn[0], gcref(*p[1]));\r\n  return 0;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_CF(debug_getuservalue)\r\n{\r\n  TValue *o = L->base;\r\n  if (o < L->top && tvisudata(o))\r\n    settabV(L, o, tabref(udataV(o)->env));\r\n  else\r\n    setnilV(o);\r\n  L->top = o+1;\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setuservalue)\r\n{\r\n  TValue *o = L->base;\r\n  if (!(o < L->top && tvisudata(o)))\r\n    lj_err_argt(L, 1, LUA_TUSERDATA);\r\n  if (!(o+1 < L->top && tvistab(o+1)))\r\n    lj_err_argt(L, 2, LUA_TTABLE);\r\n  L->top = o+2;\r\n  lua_setfenv(L, 1);\r\n  return 1;\r\n}\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic const char KEY_HOOK = 'h';\r\n\r\nstatic void hookf(lua_State *L, lua_Debug *ar)\r\n{\r\n  static const char *const hooknames[] =\r\n    {\"call\", \"return\", \"line\", \"count\", \"tail return\"};\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_rawget(L, LUA_REGISTRYINDEX);\r\n  if (lua_isfunction(L, -1)) {\r\n    lua_pushstring(L, hooknames[(int)ar->event]);\r\n    if (ar->currentline >= 0)\r\n      lua_pushinteger(L, ar->currentline);\r\n    else lua_pushnil(L);\r\n    lua_call(L, 2, 0);\r\n  }\r\n}\r\n\r\nstatic int makemask(const char *smask, int count)\r\n{\r\n  int mask = 0;\r\n  if (strchr(smask, 'c')) mask |= LUA_MASKCALL;\r\n  if (strchr(smask, 'r')) mask |= LUA_MASKRET;\r\n  if (strchr(smask, 'l')) mask |= LUA_MASKLINE;\r\n  if (count > 0) mask |= LUA_MASKCOUNT;\r\n  return mask;\r\n}\r\n\r\nstatic char *unmakemask(int mask, char *smask)\r\n{\r\n  int i = 0;\r\n  if (mask & LUA_MASKCALL) smask[i++] = 'c';\r\n  if (mask & LUA_MASKRET) smask[i++] = 'r';\r\n  if (mask & LUA_MASKLINE) smask[i++] = 'l';\r\n  smask[i] = '\\0';\r\n  return smask;\r\n}\r\n\r\nLJLIB_CF(debug_sethook)\r\n{\r\n  int arg, mask, count;\r\n  lua_Hook func;\r\n  (void)getthread(L, &arg);\r\n  if (lua_isnoneornil(L, arg+1)) {\r\n    lua_settop(L, arg+1);\r\n    func = NULL; mask = 0; count = 0;  /* turn off hooks */\r\n  } else {\r\n    const char *smask = luaL_checkstring(L, arg+2);\r\n    luaL_checktype(L, arg+1, LUA_TFUNCTION);\r\n    count = luaL_optint(L, arg+3, 0);\r\n    func = hookf; mask = makemask(smask, count);\r\n  }\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_pushvalue(L, arg+1);\r\n  lua_rawset(L, LUA_REGISTRYINDEX);\r\n  lua_sethook(L, func, mask, count);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(debug_gethook)\r\n{\r\n  char buff[5];\r\n  int mask = lua_gethookmask(L);\r\n  lua_Hook hook = lua_gethook(L);\r\n  if (hook != NULL && hook != hookf) {  /* external hook? */\r\n    lua_pushliteral(L, \"external hook\");\r\n  } else {\r\n    lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n    lua_rawget(L, LUA_REGISTRYINDEX);   /* get hook */\r\n  }\r\n  lua_pushstring(L, unmakemask(mask, buff));\r\n  lua_pushinteger(L, lua_gethookcount(L));\r\n  return 3;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(debug_debug)\r\n{\r\n  for (;;) {\r\n    char buffer[250];\r\n    fputs(\"lua_debug> \", stderr);\r\n    if (fgets(buffer, sizeof(buffer), stdin) == 0 ||\r\n\tstrcmp(buffer, \"cont\\n\") == 0)\r\n      return 0;\r\n    if (luaL_loadbuffer(L, buffer, strlen(buffer), \"=(debug command)\") ||\r\n\tlua_pcall(L, 0, 0, 0)) {\r\n      fputs(lua_tostring(L, -1), stderr);\r\n      fputs(\"\\n\", stderr);\r\n    }\r\n    lua_settop(L, 0);  /* remove eventual returns */\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LEVELS1\t12\t/* size of the first part of the stack */\r\n#define LEVELS2\t10\t/* size of the second part of the stack */\r\n\r\nLJLIB_CF(debug_traceback)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  const char *msg = lua_tostring(L, arg+1);\r\n  if (msg == NULL && L->top > L->base+arg)\r\n    L->top = L->base+arg+1;\r\n  else\r\n    luaL_traceback(L, L1, msg, lj_lib_optint(L, arg+2, (L == L1)));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_debug(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_DBLIBNAME, debug);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_ffi.c",
    "content": "/*\r\n** FFI library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_ffi_c\r\n#define LUA_LIB\r\n\r\n#include <errno.h>\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_carith.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ccallback.h\"\r\n#include \"lj_clib.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- C type checks ------------------------------------------------------- */\r\n\r\n/* Check first argument for a C type and returns its ID. */\r\nstatic CTypeID ffi_checkctype(lua_State *L, CTState *cts, TValue *param)\r\n{\r\n  TValue *o = L->base;\r\n  if (!(o < L->top)) {\r\n  err_argtype:\r\n    lj_err_argtype(L, 1, \"C type\");\r\n  }\r\n  if (tvisstr(o)) {  /* Parse an abstract C type declaration. */\r\n    GCstr *s = strV(o);\r\n    CPState cp;\r\n    int errcode;\r\n    cp.L = L;\r\n    cp.cts = cts;\r\n    cp.srcname = strdata(s);\r\n    cp.p = strdata(s);\r\n    cp.param = param;\r\n    cp.mode = CPARSE_MODE_ABSTRACT|CPARSE_MODE_NOIMPLICIT;\r\n    errcode = lj_cparse(&cp);\r\n    if (errcode) lj_err_throw(L, errcode);  /* Propagate errors. */\r\n    return cp.val.id;\r\n  } else {\r\n    GCcdata *cd;\r\n    if (!tviscdata(o)) goto err_argtype;\r\n    if (param && param < L->top) lj_err_arg(L, 1, LJ_ERR_FFI_NUMPARAM);\r\n    cd = cdataV(o);\r\n    return cd->ctypeid == CTID_CTYPEID ? *(CTypeID *)cdataptr(cd) : cd->ctypeid;\r\n  }\r\n}\r\n\r\n/* Check argument for C data and return it. */\r\nstatic GCcdata *ffi_checkcdata(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tviscdata(o)))\r\n    lj_err_argt(L, narg, LUA_TCDATA);\r\n  return cdataV(o);\r\n}\r\n\r\n/* Convert argument to C pointer. */\r\nstatic void *ffi_checkptr(lua_State *L, int narg, CTypeID id)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = L->base + narg-1;\r\n  void *p;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  lj_cconv_ct_tv(cts, ctype_get(cts, id), (uint8_t *)&p, o, CCF_ARG(narg));\r\n  return p;\r\n}\r\n\r\n/* Convert argument to int32_t. */\r\nstatic int32_t ffi_checkint(lua_State *L, int narg)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = L->base + narg-1;\r\n  int32_t i;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  lj_cconv_ct_tv(cts, ctype_get(cts, CTID_INT32), (uint8_t *)&i, o,\r\n\t\t CCF_ARG(narg));\r\n  return i;\r\n}\r\n\r\n/* -- C type metamethods -------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_meta\r\n\r\n/* Handle ctype __index/__newindex metamethods. */\r\nstatic int ffi_index_meta(lua_State *L, CTState *cts, CType *ct, MMS mm)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  cTValue *tv = lj_ctype_meta(cts, id, mm);\r\n  TValue *base = L->base;\r\n  if (!tv) {\r\n    const char *s;\r\n  err_index:\r\n    s = strdata(lj_ctype_repr(L, id, NULL));\r\n    if (tvisstr(L->base+1)) {\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADMEMBER, s, strVdata(L->base+1));\r\n    } else {\r\n      const char *key = tviscdata(L->base+1) ?\r\n\tstrdata(lj_ctype_repr(L, cdataV(L->base+1)->ctypeid, NULL)) :\r\n\tlj_typename(L->base+1);\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADIDXW, s, key);\r\n    }\r\n  }\r\n  if (!tvisfunc(tv)) {\r\n    if (mm == MM_index) {\r\n      cTValue *o = lj_meta_tget(L, tv, base+1);\r\n      if (o) {\r\n\tif (tvisnil(o)) goto err_index;\r\n\tcopyTV(L, L->top-1, o);\r\n\treturn 1;\r\n      }\r\n    } else {\r\n      TValue *o = lj_meta_tset(L, tv, base+1);\r\n      if (o) {\r\n\tcopyTV(L, o, base+2);\r\n\treturn 0;\r\n      }\r\n    }\r\n    copyTV(L, base, L->top);\r\n    tv = L->top-1;\r\n  }\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___index)\tLJLIB_REC(cdata_index 0)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTInfo qual = 0;\r\n  CType *ct;\r\n  uint8_t *p;\r\n  TValue *o = L->base;\r\n  if (!(o+1 < L->top && tviscdata(o)))  /* Also checks for presence of key. */\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  ct = lj_cdata_index(cts, cdataV(o), o+1, &p, &qual);\r\n  if ((qual & 1))\r\n    return ffi_index_meta(L, cts, ct, MM_index);\r\n  if (lj_cdata_get(cts, ct, L->top-1, p))\r\n    lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_meta___newindex)\tLJLIB_REC(cdata_index 1)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTInfo qual = 0;\r\n  CType *ct;\r\n  uint8_t *p;\r\n  TValue *o = L->base;\r\n  if (!(o+2 < L->top && tviscdata(o)))  /* Also checks for key and value. */\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  ct = lj_cdata_index(cts, cdataV(o), o+1, &p, &qual);\r\n  if ((qual & 1)) {\r\n    if ((qual & CTF_CONST))\r\n      lj_err_caller(L, LJ_ERR_FFI_WRCONST);\r\n    return ffi_index_meta(L, cts, ct, MM_newindex);\r\n  }\r\n  lj_cdata_set(cts, ct, p, o+2, qual);\r\n  return 0;\r\n}\r\n\r\n/* Common handler for cdata arithmetic. */\r\nstatic int ffi_arith(lua_State *L)\r\n{\r\n  MMS mm = (MMS)(curr_func(L)->c.ffid - (int)FF_ffi_meta___eq + (int)MM_eq);\r\n  return lj_carith_op(L, mm);\r\n}\r\n\r\n/* The following functions must be in contiguous ORDER MM. */\r\nLJLIB_CF(ffi_meta___eq)\t\tLJLIB_REC(cdata_arith MM_eq)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___len)\tLJLIB_REC(cdata_arith MM_len)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___lt)\t\tLJLIB_REC(cdata_arith MM_lt)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___le)\t\tLJLIB_REC(cdata_arith MM_le)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___concat)\tLJLIB_REC(cdata_arith MM_concat)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic int lj_cf_ffi_new(lua_State *L);\r\n\r\nLJLIB_CF(ffi_meta___call)\tLJLIB_REC(cdata_call)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  CTypeID id = cd->ctypeid;\r\n  CType *ct;\r\n  cTValue *tv;\r\n  MMS mm = MM_call;\r\n  if (cd->ctypeid == CTID_CTYPEID) {\r\n    id = *(CTypeID *)cdataptr(cd);\r\n    mm = MM_new;\r\n  } else {\r\n    int ret = lj_ccall_func(L, cd);\r\n    if (ret >= 0)\r\n      return ret;\r\n  }\r\n  /* Handle ctype __call/__new metamethod. */\r\n  ct = ctype_raw(cts, id);\r\n  if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n  tv = lj_ctype_meta(cts, id, mm);\r\n  if (tv)\r\n    return lj_meta_tailcall(L, tv);\r\n  else if (mm == MM_call)\r\n    lj_err_callerv(L, LJ_ERR_FFI_BADCALL, strdata(lj_ctype_repr(L, id, NULL)));\r\n  return lj_cf_ffi_new(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___add)\tLJLIB_REC(cdata_arith MM_add)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___sub)\tLJLIB_REC(cdata_arith MM_sub)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___mul)\tLJLIB_REC(cdata_arith MM_mul)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___div)\tLJLIB_REC(cdata_arith MM_div)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___mod)\tLJLIB_REC(cdata_arith MM_mod)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___pow)\tLJLIB_REC(cdata_arith MM_pow)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___unm)\tLJLIB_REC(cdata_arith MM_unm)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n/* End of contiguous ORDER MM. */\r\n\r\nLJLIB_CF(ffi_meta___tostring)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  const char *msg = \"cdata<%s>: %p\";\r\n  CTypeID id = cd->ctypeid;\r\n  void *p = cdataptr(cd);\r\n  if (id == CTID_CTYPEID) {\r\n    msg = \"ctype<%s>\";\r\n    id = *(CTypeID *)p;\r\n  } else {\r\n    CTState *cts = ctype_cts(L);\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isref(ct->info)) {\r\n      p = *(void **)p;\r\n      ct = ctype_rawchild(cts, ct);\r\n    }\r\n    if (ctype_iscomplex(ct->info)) {\r\n      setstrV(L, L->top-1, lj_ctype_repr_complex(L, cdataptr(cd), ct->size));\r\n      goto checkgc;\r\n    } else if (ct->size == 8 && ctype_isinteger(ct->info)) {\r\n      setstrV(L, L->top-1, lj_ctype_repr_int64(L, *(uint64_t *)cdataptr(cd),\r\n\t\t\t\t\t       (ct->info & CTF_UNSIGNED)));\r\n      goto checkgc;\r\n    } else if (ctype_isfunc(ct->info)) {\r\n      p = *(void **)p;\r\n    } else if (ctype_isenum(ct->info)) {\r\n      msg = \"cdata<%s>: %d\";\r\n      p = (void *)(uintptr_t)*(uint32_t **)p;\r\n    } else {\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = cdata_getptr(p, ct->size);\r\n\tct = ctype_rawchild(cts, ct);\r\n      }\r\n      if (ctype_isstruct(ct->info) || ctype_isvector(ct->info)) {\r\n\t/* Handle ctype __tostring metamethod. */\r\n\tcTValue *tv = lj_ctype_meta(cts, ctype_typeid(cts, ct), MM_tostring);\r\n\tif (tv)\r\n\t  return lj_meta_tailcall(L, tv);\r\n      }\r\n    }\r\n  }\r\n  lj_str_pushf(L, msg, strdata(lj_ctype_repr(L, id, NULL)), p);\r\ncheckgc:\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nstatic int ffi_pairs(lua_State *L, MMS mm)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkcdata(L, 1)->ctypeid;\r\n  CType *ct = ctype_raw(cts, id);\r\n  cTValue *tv;\r\n  if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n  tv = lj_ctype_meta(cts, id, mm);\r\n  if (!tv)\r\n    lj_err_callerv(L, LJ_ERR_FFI_BADMM, strdata(lj_ctype_repr(L, id, NULL)),\r\n\t\t   strdata(mmname_str(G(L), mm)));\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___pairs)\r\n{\r\n  return ffi_pairs(L, MM_pairs);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___ipairs)\r\n{\r\n  return ffi_pairs(L, MM_ipairs);\r\n}\r\n\r\nLJLIB_PUSH(\"ffi\") LJLIB_SET(__metatable)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- C library metamethods ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_clib\r\n\r\n/* Index C library by a name. */\r\nstatic TValue *ffi_clib_index(lua_State *L)\r\n{\r\n  TValue *o = L->base;\r\n  CLibrary *cl;\r\n  if (!(o < L->top && tvisudata(o) && udataV(o)->udtype == UDTYPE_FFI_CLIB))\r\n    lj_err_argt(L, 1, LUA_TUSERDATA);\r\n  cl = (CLibrary *)uddata(udataV(o));\r\n  if (!(o+1 < L->top && tvisstr(o+1)))\r\n    lj_err_argt(L, 2, LUA_TSTRING);\r\n  return lj_clib_index(L, cl, strV(o+1));\r\n}\r\n\r\nLJLIB_CF(ffi_clib___index)\tLJLIB_REC(clib_index 1)\r\n{\r\n  TValue *tv = ffi_clib_index(L);\r\n  if (tviscdata(tv)) {\r\n    CTState *cts = ctype_cts(L);\r\n    GCcdata *cd = cdataV(tv);\r\n    CType *s = ctype_get(cts, cd->ctypeid);\r\n    if (ctype_isextern(s->info)) {\r\n      CTypeID sid = ctype_cid(s->info);\r\n      void *sp = *(void **)cdataptr(cd);\r\n      CType *ct = ctype_raw(cts, sid);\r\n      if (lj_cconv_tv_ct(cts, ct, sid, L->top-1, sp))\r\n\tlj_gc_check(L);\r\n      return 1;\r\n    }\r\n  }\r\n  copyTV(L, L->top-1, tv);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_clib___newindex)\tLJLIB_REC(clib_index 0)\r\n{\r\n  TValue *tv = ffi_clib_index(L);\r\n  TValue *o = L->base+2;\r\n  if (o < L->top && tviscdata(tv)) {\r\n    CTState *cts = ctype_cts(L);\r\n    GCcdata *cd = cdataV(tv);\r\n    CType *d = ctype_get(cts, cd->ctypeid);\r\n    if (ctype_isextern(d->info)) {\r\n      CTInfo qual = 0;\r\n      for (;;) {  /* Skip attributes and collect qualifiers. */\r\n\td = ctype_child(cts, d);\r\n\tif (!ctype_isattrib(d->info)) break;\r\n\tif (ctype_attrib(d->info) == CTA_QUAL) qual |= d->size;\r\n      }\r\n      if (!((d->info|qual) & CTF_CONST)) {\r\n\tlj_cconv_ct_tv(cts, d, *(void **)cdataptr(cd), o, 0);\r\n\treturn 0;\r\n      }\r\n    }\r\n  }\r\n  lj_err_caller(L, LJ_ERR_FFI_WRCONST);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLJLIB_CF(ffi_clib___gc)\r\n{\r\n  TValue *o = L->base;\r\n  if (o < L->top && tvisudata(o) && udataV(o)->udtype == UDTYPE_FFI_CLIB)\r\n    lj_clib_unload((CLibrary *)uddata(udataV(o)));\r\n  return 0;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- Callback function metamethods --------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_callback\r\n\r\nstatic int ffi_callback_set(lua_State *L, GCfunc *fn)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  CTState *cts = ctype_cts(L);\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  if (ctype_isptr(ct->info) && (LJ_32 || ct->size == 8)) {\r\n    MSize slot = lj_ccallback_ptr2slot(cts, *(void **)cdataptr(cd));\r\n    if (slot < cts->cb.sizeid && cts->cb.cbid[slot] != 0) {\r\n      GCtab *t = cts->miscmap;\r\n      TValue *tv = lj_tab_setint(L, t, (int32_t)slot);\r\n      if (fn) {\r\n\tsetfuncV(L, tv, fn);\r\n\tlj_gc_anybarriert(L, t);\r\n      } else {\r\n\tsetnilV(tv);\r\n\tcts->cb.cbid[slot] = 0;\r\n\tcts->cb.topid = slot < cts->cb.topid ? slot : cts->cb.topid;\r\n      }\r\n      return 0;\r\n    }\r\n  }\r\n  lj_err_caller(L, LJ_ERR_FFI_BADCBACK);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_callback_free)\r\n{\r\n  return ffi_callback_set(L, NULL);\r\n}\r\n\r\nLJLIB_CF(ffi_callback_set)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 2);\r\n  return ffi_callback_set(L, fn);\r\n}\r\n\r\nLJLIB_PUSH(top-1) LJLIB_SET(__index)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- FFI library functions ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi\r\n\r\nLJLIB_CF(ffi_cdef)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  CPState cp;\r\n  int errcode;\r\n  cp.L = L;\r\n  cp.cts = ctype_cts(L);\r\n  cp.srcname = strdata(s);\r\n  cp.p = strdata(s);\r\n  cp.param = L->base+1;\r\n  cp.mode = CPARSE_MODE_MULTI|CPARSE_MODE_DIRECT;\r\n  errcode = lj_cparse(&cp);\r\n  if (errcode) lj_err_throw(L, errcode);  /* Propagate errors. */\r\n  lj_gc_check(L);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_new)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CType *ct = ctype_raw(cts, id);\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  TValue *o = L->base+1;\r\n  GCcdata *cd;\r\n  if ((info & CTF_VLA)) {\r\n    o++;\r\n    sz = lj_ctype_vlsize(cts, ct, (CTSize)ffi_checkint(L, 2));\r\n  }\r\n  if (sz == CTSIZE_INVALID)\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVSIZE);\r\n  if (!(info & CTF_VLA) && ctype_align(info) <= CT_MEMALIGN)\r\n    cd = lj_cdata_new(cts, id, sz);\r\n  else\r\n    cd = lj_cdata_newv(cts, id, sz, ctype_align(info));\r\n  setcdataV(L, o-1, cd);  /* Anchor the uninitialized cdata. */\r\n  lj_cconv_ct_init(cts, ct, sz, cdataptr(cd),\r\n\t\t   o, (MSize)(L->top - o));  /* Initialize cdata. */\r\n  if (ctype_isstruct(ct->info)) {\r\n    /* Handle ctype __gc metamethod. Use the fast lookup here. */\r\n    cTValue *tv = lj_tab_getinth(cts->miscmap, -(int32_t)id);\r\n    if (tv && tvistab(tv) && (tv = lj_meta_fast(L, tabV(tv), MM_gc))) {\r\n      GCtab *t = cts->finalizer;\r\n      if (gcref(t->metatable)) {\r\n\t/* Add to finalizer table, if still enabled. */\r\n\tcopyTV(L, lj_tab_set(L, t, o-1), tv);\r\n\tlj_gc_anybarriert(L, t);\r\n\tcd->marked |= LJ_GC_CDATA_FIN;\r\n      }\r\n    }\r\n  }\r\n  L->top = o;  /* Only return the cdata itself. */\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_cast)\tLJLIB_REC(ffi_new)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CType *d = ctype_raw(cts, id);\r\n  TValue *o = lj_lib_checkany(L, 2);\r\n  L->top = o+1;  /* Make sure this is the last item on the stack. */\r\n  if (!(ctype_isnum(d->info) || ctype_isptr(d->info) || ctype_isenum(d->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  if (!(tviscdata(o) && cdataV(o)->ctypeid == id)) {\r\n    GCcdata *cd = lj_cdata_new(cts, id, d->size);\r\n    lj_cconv_ct_tv(cts, d, cdataptr(cd), o, CCF_CAST);\r\n    setcdataV(L, o, cd);\r\n    lj_gc_check(L);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_typeof)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, L->base+1);\r\n  GCcdata *cd = lj_cdata_new(cts, CTID_CTYPEID, 4);\r\n  *(CTypeID *)cdataptr(cd) = id;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_istype)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id1 = ffi_checkctype(L, cts, NULL);\r\n  TValue *o = lj_lib_checkany(L, 2);\r\n  int b = 0;\r\n  if (tviscdata(o)) {\r\n    GCcdata *cd = cdataV(o);\r\n    CTypeID id2 = cd->ctypeid == CTID_CTYPEID ? *(CTypeID *)cdataptr(cd) :\r\n\t\t\t\t\t\tcd->ctypeid;\r\n    CType *ct1 = lj_ctype_rawref(cts, id1);\r\n    CType *ct2 = lj_ctype_rawref(cts, id2);\r\n    if (ct1 == ct2) {\r\n      b = 1;\r\n    } else if (ctype_type(ct1->info) == ctype_type(ct2->info) &&\r\n\t       ct1->size == ct2->size) {\r\n      if (ctype_ispointer(ct1->info))\r\n\tb = lj_cconv_compatptr(cts, ct1, ct2, CCF_IGNQUAL);\r\n      else if (ctype_isnum(ct1->info) || ctype_isvoid(ct1->info))\r\n\tb = (((ct1->info ^ ct2->info) & ~(CTF_QUAL|CTF_LONG)) == 0);\r\n    } else if (ctype_isstruct(ct1->info) && ctype_isptr(ct2->info) &&\r\n\t       ct1 == ctype_rawchild(cts, ct2)) {\r\n      b = 1;\r\n    }\r\n  }\r\n  setboolV(L->top-1, b);\r\n  setboolV(&G(L)->tmptv2, b);  /* Remember for trace recorder. */\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_sizeof)\tLJLIB_REC(ffi_xof FF_ffi_sizeof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CTSize sz;\r\n  if (LJ_UNLIKELY(tviscdata(L->base) && cdataisv(cdataV(L->base)))) {\r\n    sz = cdatavlen(cdataV(L->base));\r\n  } else {\r\n    CType *ct = lj_ctype_rawref(cts, id);\r\n    if (ctype_isvltype(ct->info))\r\n      sz = lj_ctype_vlsize(cts, ct, (CTSize)ffi_checkint(L, 2));\r\n    else\r\n      sz = ctype_hassize(ct->info) ? ct->size : CTSIZE_INVALID;\r\n    if (LJ_UNLIKELY(sz == CTSIZE_INVALID)) {\r\n      setnilV(L->top-1);\r\n      return 1;\r\n    }\r\n  }\r\n  setintV(L->top-1, (int32_t)sz);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_alignof)\tLJLIB_REC(ffi_xof FF_ffi_alignof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CTSize sz = 0;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  setintV(L->top-1, 1 << ctype_align(info));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_offsetof)\tLJLIB_REC(ffi_xof FF_ffi_offsetof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  GCstr *name = lj_lib_checkstr(L, 2);\r\n  CType *ct = lj_ctype_rawref(cts, id);\r\n  CTSize ofs;\r\n  if (ctype_isstruct(ct->info) && ct->size != CTSIZE_INVALID) {\r\n    CType *fct = lj_ctype_getfield(cts, ct, name, &ofs);\r\n    if (fct) {\r\n      setintV(L->top-1, ofs);\r\n      if (ctype_isfield(fct->info)) {\r\n\treturn 1;\r\n      } else if (ctype_isbitfield(fct->info)) {\r\n\tsetintV(L->top++, ctype_bitpos(fct->info));\r\n\tsetintV(L->top++, ctype_bitbsz(fct->info));\r\n\treturn 3;\r\n      }\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_errno)\tLJLIB_REC(.)\r\n{\r\n  int err = errno;\r\n  if (L->top > L->base)\r\n    errno = ffi_checkint(L, 1);\r\n  setintV(L->top++, err);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_string)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  const char *p;\r\n  size_t len;\r\n  if (o+1 < L->top && !tvisnil(o+1)) {\r\n    len = (size_t)ffi_checkint(L, 2);\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_P_CVOID), (uint8_t *)&p, o,\r\n\t\t   CCF_ARG(1));\r\n  } else {\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_P_CCHAR), (uint8_t *)&p, o,\r\n\t\t   CCF_ARG(1));\r\n    len = strlen(p);\r\n  }\r\n  L->top = o+1;  /* Make sure this is the last item on the stack. */\r\n  setstrV(L, o, lj_str_new(L, p, len));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_copy)\tLJLIB_REC(.)\r\n{\r\n  void *dp = ffi_checkptr(L, 1, CTID_P_VOID);\r\n  void *sp = ffi_checkptr(L, 2, CTID_P_CVOID);\r\n  TValue *o = L->base+1;\r\n  CTSize len;\r\n  if (tvisstr(o) && o+1 >= L->top)\r\n    len = strV(o)->len+1;  /* Copy Lua string including trailing '\\0'. */\r\n  else\r\n    len = (CTSize)ffi_checkint(L, 3);\r\n  memcpy(dp, sp, len);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_fill)\tLJLIB_REC(.)\r\n{\r\n  void *dp = ffi_checkptr(L, 1, CTID_P_VOID);\r\n  CTSize len = (CTSize)ffi_checkint(L, 2);\r\n  int32_t fill = 0;\r\n  if (L->base+2 < L->top && !tvisnil(L->base+2)) fill = ffi_checkint(L, 3);\r\n  memset(dp, fill, len);\r\n  return 0;\r\n}\r\n\r\n#define H_(le, be)\tLJ_ENDIAN_SELECT(0x##le, 0x##be)\r\n\r\n/* Test ABI string. */\r\nLJLIB_CF(ffi_abi)\tLJLIB_REC(.)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int b = 0;\r\n  switch (s->hash) {\r\n#if LJ_64\r\n  case H_(849858eb,ad35fd06): b = 1; break;  /* 64bit */\r\n#else\r\n  case H_(662d3c79,d0e22477): b = 1; break;  /* 32bit */\r\n#endif\r\n#if LJ_ARCH_HASFPU\r\n  case H_(e33ee463,e33ee463): b = 1; break;  /* fpu */\r\n#endif\r\n#if LJ_ABI_SOFTFP\r\n  case H_(61211a23,c2e8c81c): b = 1; break;  /* softfp */\r\n#else\r\n  case H_(539417a8,8ce0812f): b = 1; break;  /* hardfp */\r\n#endif\r\n#if LJ_ABI_EABI\r\n  case H_(2182df8f,f2ed1152): b = 1; break;  /* eabi */\r\n#endif\r\n#if LJ_ABI_WIN\r\n  case H_(4ab624a8,4ab624a8): b = 1; break;  /* win */\r\n#endif\r\n  case H_(3af93066,1f001464): b = 1; break;  /* le/be */\r\n  default:\r\n    break;\r\n  }\r\n  setboolV(L->top-1, b);\r\n  setboolV(&G(L)->tmptv2, b);  /* Remember for trace recorder. */\r\n  return 1;\r\n}\r\n\r\n#undef H_\r\n\r\nLJLIB_PUSH(top-8) LJLIB_SET(!)  /* Store reference to miscmap table. */\r\n\r\nLJLIB_CF(ffi_metatype)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  GCtab *mt = lj_lib_checktab(L, 2);\r\n  GCtab *t = cts->miscmap;\r\n  CType *ct = ctype_get(cts, id);  /* Only allow raw types. */\r\n  TValue *tv;\r\n  GCcdata *cd;\r\n  if (!(ctype_isstruct(ct->info) || ctype_iscomplex(ct->info) ||\r\n\tctype_isvector(ct->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  tv = lj_tab_setinth(L, t, -(int32_t)id);\r\n  if (!tvisnil(tv))\r\n    lj_err_caller(L, LJ_ERR_PROTMT);\r\n  settabV(L, tv, mt);\r\n  lj_gc_anybarriert(L, t);\r\n  cd = lj_cdata_new(cts, CTID_CTYPEID, 4);\r\n  *(CTypeID *)cdataptr(cd) = id;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-7) LJLIB_SET(!)  /* Store reference to finalizer table. */\r\n\r\nLJLIB_CF(ffi_gc)\tLJLIB_REC(.)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  TValue *fin = lj_lib_checkany(L, 2);\r\n  CTState *cts = ctype_cts(L);\r\n  GCtab *t = cts->finalizer;\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  if (!(ctype_isptr(ct->info) || ctype_isstruct(ct->info) ||\r\n\tctype_isrefarray(ct->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  if (gcref(t->metatable)) {  /* Update finalizer table, if still enabled. */\r\n    copyTV(L, lj_tab_set(L, t, L->base), fin);\r\n    lj_gc_anybarriert(L, t);\r\n    if (!tvisnil(fin))\r\n      cd->marked |= LJ_GC_CDATA_FIN;\r\n    else\r\n      cd->marked &= ~LJ_GC_CDATA_FIN;\r\n  }\r\n  L->top = L->base+1;  /* Pass through the cdata object. */\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-5) LJLIB_SET(!)  /* Store clib metatable in func environment. */\r\n\r\nLJLIB_CF(ffi_load)\r\n{\r\n  GCstr *name = lj_lib_checkstr(L, 1);\r\n  int global = (L->base+1 < L->top && tvistruecond(L->base+1));\r\n  lj_clib_load(L, tabref(curr_func(L)->c.env), name, global);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-4) LJLIB_SET(C)\r\nLJLIB_PUSH(top-3) LJLIB_SET(os)\r\nLJLIB_PUSH(top-2) LJLIB_SET(arch)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Create special weak-keyed finalizer table. */\r\nstatic GCtab *ffi_finalizer(lua_State *L)\r\n{\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  GCtab *t = lj_tab_new(L, 0, 1);\r\n  settabV(L, L->top++, t);\r\n  setgcref(t->metatable, obj2gco(t));\r\n  setstrV(L, lj_tab_setstr(L, t, lj_str_newlit(L, \"__mode\")),\r\n\t  lj_str_newlit(L, \"K\"));\r\n  t->nomm = (uint8_t)(~(1u<<MM_mode));\r\n  return t;\r\n}\r\n\r\n/* Register FFI module as loaded. */\r\nstatic void ffi_register_module(lua_State *L)\r\n{\r\n  cTValue *tmp = lj_tab_getstr(tabV(registry(L)), lj_str_newlit(L, \"_LOADED\"));\r\n  if (tmp && tvistab(tmp)) {\r\n    GCtab *t = tabV(tmp);\r\n    copyTV(L, lj_tab_setstr(L, t, lj_str_newlit(L, LUA_FFILIBNAME)), L->top-1);\r\n    lj_gc_anybarriert(L, t);\r\n  }\r\n}\r\n\r\nLUALIB_API int luaopen_ffi(lua_State *L)\r\n{\r\n  CTState *cts = lj_ctype_init(L);\r\n  settabV(L, L->top++, (cts->miscmap = lj_tab_new(L, 0, 1)));\r\n  cts->finalizer = ffi_finalizer(L);\r\n  LJ_LIB_REG(L, NULL, ffi_meta);\r\n  /* NOBARRIER: basemt is a GC root. */\r\n  setgcref(basemt_it(G(L), LJ_TCDATA), obj2gco(tabV(L->top-1)));\r\n  LJ_LIB_REG(L, NULL, ffi_clib);\r\n  LJ_LIB_REG(L, NULL, ffi_callback);\r\n  /* NOBARRIER: the key is new and lj_tab_newkey() handles the barrier. */\r\n  settabV(L, lj_tab_setstr(L, cts->miscmap, &cts->g->strempty), tabV(L->top-1));\r\n  L->top--;\r\n  lj_clib_default(L, tabV(L->top-1));  /* Create ffi.C default namespace. */\r\n  lua_pushliteral(L, LJ_OS_NAME);\r\n  lua_pushliteral(L, LJ_ARCH_NAME);\r\n  LJ_LIB_REG(L, NULL, ffi);  /* Note: no global \"ffi\" created! */\r\n  ffi_register_module(L);\r\n  return 1;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_init.c",
    "content": "/*\r\n** Library initialization.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major parts taken verbatim from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_init_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_arch.h\"\r\n\r\nstatic const luaL_Reg lj_lib_load[] = {\r\n  { \"\",\t\t\tluaopen_base },\r\n  { LUA_LOADLIBNAME,\tluaopen_package },\r\n  { LUA_TABLIBNAME,\tluaopen_table },\r\n  { LUA_IOLIBNAME,\tluaopen_io },\r\n  { LUA_OSLIBNAME,\tluaopen_os },\r\n  { LUA_STRLIBNAME,\tluaopen_string },\r\n  { LUA_MATHLIBNAME,\tluaopen_math },\r\n  { LUA_DBLIBNAME,\tluaopen_debug },\r\n  { LUA_BITLIBNAME,\tluaopen_bit },\r\n  { LUA_JITLIBNAME,\tluaopen_jit },\r\n  { NULL,\t\tNULL }\r\n};\r\n\r\nstatic const luaL_Reg lj_lib_preload[] = {\r\n#if LJ_HASFFI\r\n  { LUA_FFILIBNAME,\tluaopen_ffi },\r\n#endif\r\n  { NULL,\t\tNULL }\r\n};\r\n\r\nLUALIB_API void luaL_openlibs(lua_State *L)\r\n{\r\n  const luaL_Reg *lib;\r\n  for (lib = lj_lib_load; lib->func; lib++) {\r\n    lua_pushcfunction(L, lib->func);\r\n    lua_pushstring(L, lib->name);\r\n    lua_call(L, 1, 0);\r\n  }\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\",\r\n\t\t sizeof(lj_lib_preload)/sizeof(lj_lib_preload[0])-1);\r\n  for (lib = lj_lib_preload; lib->func; lib++) {\r\n    lua_pushcfunction(L, lib->func);\r\n    lua_setfield(L, -2, lib->name);\r\n  }\r\n  lua_pop(L, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_io.c",
    "content": "/*\r\n** I/O library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2011 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n\r\n#define lib_io_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* Userdata payload for I/O file. */\r\ntypedef struct IOFileUD {\r\n  FILE *fp;\t\t/* File handle. */\r\n  uint32_t type;\t/* File type. */\r\n} IOFileUD;\r\n\r\n#define IOFILE_TYPE_FILE\t0\t/* Regular file. */\r\n#define IOFILE_TYPE_PIPE\t1\t/* Pipe. */\r\n#define IOFILE_TYPE_STDF\t2\t/* Standard file handle. */\r\n#define IOFILE_TYPE_MASK\t3\r\n\r\n#define IOFILE_FLAG_CLOSE\t4\t/* Close after io.lines() iterator. */\r\n\r\n#define IOSTDF_UD(L, id)\t(&gcref(G(L)->gcroot[(id)])->ud)\r\n#define IOSTDF_IOF(L, id)\t((IOFileUD *)uddata(IOSTDF_UD(L, (id))))\r\n\r\n/* -- Open/close helpers -------------------------------------------------- */\r\n\r\nstatic IOFileUD *io_tofilep(lua_State *L)\r\n{\r\n  if (!(L->base < L->top && tvisudata(L->base) &&\r\n\tudataV(L->base)->udtype == UDTYPE_IO_FILE))\r\n    lj_err_argtype(L, 1, \"FILE*\");\r\n  return (IOFileUD *)uddata(udataV(L->base));\r\n}\r\n\r\nstatic IOFileUD *io_tofile(lua_State *L)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOCLFL);\r\n  return iof;\r\n}\r\n\r\nstatic FILE *io_stdfile(lua_State *L, ptrdiff_t id)\r\n{\r\n  IOFileUD *iof = IOSTDF_IOF(L, id);\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOSTDCL);\r\n  return iof->fp;\r\n}\r\n\r\nstatic IOFileUD *io_file_new(lua_State *L)\r\n{\r\n  IOFileUD *iof = (IOFileUD *)lua_newuserdata(L, sizeof(IOFileUD));\r\n  GCudata *ud = udataV(L->top-1);\r\n  ud->udtype = UDTYPE_IO_FILE;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcrefr(ud->metatable, curr_func(L)->c.env);\r\n  iof->fp = NULL;\r\n  iof->type = IOFILE_TYPE_FILE;\r\n  return iof;\r\n}\r\n\r\nstatic IOFileUD *io_file_open(lua_State *L, const char *mode)\r\n{\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->fp = fopen(fname, mode);\r\n  if (iof->fp == NULL)\r\n    luaL_argerror(L, 1, lj_str_pushf(L, \"%s: %s\", fname, strerror(errno)));\r\n  return iof;\r\n}\r\n\r\nstatic int io_file_close(lua_State *L, IOFileUD *iof)\r\n{\r\n  int ok;\r\n  if ((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_FILE) {\r\n    ok = (fclose(iof->fp) == 0);\r\n  } else if ((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_PIPE) {\r\n    int stat = -1;\r\n#if LJ_TARGET_POSIX\r\n    stat = pclose(iof->fp);\r\n#elif LJ_TARGET_WINDOWS\r\n    stat = _pclose(iof->fp);\r\n#else\r\n    lua_assert(0);\r\n    return 0;\r\n#endif\r\n#if LJ_52\r\n    iof->fp = NULL;\r\n    return luaL_execresult(L, stat);\r\n#else\r\n    ok = (stat != -1);\r\n#endif\r\n  } else {\r\n    lua_assert((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_STDF);\r\n    setnilV(L->top++);\r\n    lua_pushliteral(L, \"cannot close standard file\");\r\n    return 2;\r\n  }\r\n  iof->fp = NULL;\r\n  return luaL_fileresult(L, ok, NULL);\r\n}\r\n\r\n/* -- Read/write helpers -------------------------------------------------- */\r\n\r\nstatic int io_file_readnum(lua_State *L, FILE *fp)\r\n{\r\n  lua_Number d;\r\n  if (fscanf(fp, LUA_NUMBER_SCAN, &d) == 1) {\r\n    if (LJ_DUALNUM) {\r\n      int32_t i = lj_num2int(d);\r\n      if (d == (lua_Number)i && !tvismzero((cTValue *)&d)) {\r\n\tsetintV(L->top++, i);\r\n\treturn 1;\r\n      }\r\n    }\r\n    setnumV(L->top++, d);\r\n    return 1;\r\n  } else {\r\n    setnilV(L->top++);\r\n    return 0;\r\n  }\r\n}\r\n\r\nstatic int io_file_readline(lua_State *L, FILE *fp, MSize chop)\r\n{\r\n  MSize m = LUAL_BUFFERSIZE, n = 0, ok = 0;\r\n  char *buf;\r\n  for (;;) {\r\n    buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);\r\n    if (fgets(buf+n, m-n, fp) == NULL) break;\r\n    n += (MSize)strlen(buf+n);\r\n    ok |= n;\r\n    if (n && buf[n-1] == '\\n') { n -= chop; break; }\r\n    if (n >= m - 64) m += m;\r\n  }\r\n  setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n  lj_gc_check(L);\r\n  return (int)ok;\r\n}\r\n\r\nstatic void io_file_readall(lua_State *L, FILE *fp)\r\n{\r\n  MSize m, n;\r\n  for (m = LUAL_BUFFERSIZE, n = 0; ; m += m) {\r\n    char *buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);\r\n    n += (MSize)fread(buf+n, 1, m-n, fp);\r\n    if (n != m) {\r\n      setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n      lj_gc_check(L);\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\nstatic int io_file_readlen(lua_State *L, FILE *fp, MSize m)\r\n{\r\n  if (m) {\r\n    char *buf = lj_str_needbuf(L, &G(L)->tmpbuf, m);\r\n    MSize n = (MSize)fread(buf, 1, m, fp);\r\n    setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n    lj_gc_check(L);\r\n    return (n > 0 || m == 0);\r\n  } else {\r\n    int c = getc(fp);\r\n    ungetc(c, fp);\r\n    setstrV(L, L->top++, &G(L)->strempty);\r\n    return (c != EOF);\r\n  }\r\n}\r\n\r\nstatic int io_file_read(lua_State *L, FILE *fp, int start)\r\n{\r\n  int ok, n, nargs = (int)(L->top - L->base) - start;\r\n  clearerr(fp);\r\n  if (nargs == 0) {\r\n    ok = io_file_readline(L, fp, 1);\r\n    n = start+1;  /* Return 1 result. */\r\n  } else {\r\n    /* The results plus the buffers go on top of the args. */\r\n    luaL_checkstack(L, nargs+LUA_MINSTACK, \"too many arguments\");\r\n    ok = 1;\r\n    for (n = start; nargs-- && ok; n++) {\r\n      if (tvisstr(L->base+n)) {\r\n\tconst char *p = strVdata(L->base+n);\r\n\tif (p[0] != '*')\r\n\t  lj_err_arg(L, n+1, LJ_ERR_INVOPT);\r\n\tif (p[1] == 'n')\r\n\t  ok = io_file_readnum(L, fp);\r\n\telse if ((p[1] & ~0x20) == 'L')\r\n\t  ok = io_file_readline(L, fp, (p[1] == 'l'));\r\n\telse if (p[1] == 'a')\r\n\t  io_file_readall(L, fp);\r\n\telse\r\n\t  lj_err_arg(L, n+1, LJ_ERR_INVFMT);\r\n      } else if (tvisnumber(L->base+n)) {\r\n\tok = io_file_readlen(L, fp, (MSize)lj_lib_checkint(L, n+1));\r\n      } else {\r\n\tlj_err_arg(L, n+1, LJ_ERR_INVOPT);\r\n      }\r\n    }\r\n  }\r\n  if (ferror(fp))\r\n    return luaL_fileresult(L, 0, NULL);\r\n  if (!ok)\r\n    setnilV(L->top-1);  /* Replace last result with nil. */\r\n  return n - start;\r\n}\r\n\r\nstatic int io_file_write(lua_State *L, FILE *fp, int start)\r\n{\r\n  cTValue *tv;\r\n  int status = 1;\r\n  for (tv = L->base+start; tv < L->top; tv++) {\r\n    if (tvisstr(tv)) {\r\n      MSize len = strV(tv)->len;\r\n      status = status && (fwrite(strVdata(tv), 1, len, fp) == len);\r\n    } else if (tvisint(tv)) {\r\n      char buf[LJ_STR_INTBUF];\r\n      char *p = lj_str_bufint(buf, intV(tv));\r\n      size_t len = (size_t)(buf+LJ_STR_INTBUF-p);\r\n      status = status && (fwrite(p, 1, len, fp) == len);\r\n    } else if (tvisnum(tv)) {\r\n      status = status && (fprintf(fp, LUA_NUMBER_FMT, numV(tv)) > 0);\r\n    } else {\r\n      lj_err_argt(L, (int)(tv - L->base) + 1, LUA_TSTRING);\r\n    }\r\n  }\r\n  if (LJ_52 && status) {\r\n    L->top = L->base+1;\r\n    if (start == 0)\r\n      setudataV(L, L->base, IOSTDF_UD(L, GCROOT_IO_OUTPUT));\r\n    return 1;\r\n  }\r\n  return luaL_fileresult(L, status, NULL);\r\n}\r\n\r\nstatic int io_file_iter(lua_State *L)\r\n{\r\n  GCfunc *fn = curr_func(L);\r\n  IOFileUD *iof = uddata(udataV(&fn->c.upvalue[0]));\r\n  int n = fn->c.nupvalues - 1;\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOCLFL);\r\n  L->top = L->base;\r\n  if (n) {  /* Copy upvalues with options to stack. */\r\n    if (n > LUAI_MAXCSTACK)\r\n      lj_err_caller(L, LJ_ERR_STKOV);\r\n    lj_state_checkstack(L, (MSize)n);\r\n    memcpy(L->top, &fn->c.upvalue[1], n*sizeof(TValue));\r\n    L->top += n;\r\n  }\r\n  n = io_file_read(L, iof->fp, 0);\r\n  if (ferror(iof->fp))\r\n    lj_err_callermsg(L, strVdata(L->top-2));\r\n  if (tvisnil(L->base) && (iof->type & IOFILE_FLAG_CLOSE)) {\r\n    io_file_close(L, iof);  /* Return values are ignored. */\r\n    return 0;\r\n  }\r\n  return n;\r\n}\r\n\r\n/* -- I/O file methods ---------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_io_method\r\n\r\nLJLIB_CF(io_method_close)\r\n{\r\n  IOFileUD *iof = L->base < L->top ? io_tofile(L) :\r\n\t\t  IOSTDF_IOF(L, GCROOT_IO_OUTPUT);\r\n  return io_file_close(L, iof);\r\n}\r\n\r\nLJLIB_CF(io_method_read)\r\n{\r\n  return io_file_read(L, io_tofile(L)->fp, 1);\r\n}\r\n\r\nLJLIB_CF(io_method_write)\t\tLJLIB_REC(io_write 0)\r\n{\r\n  return io_file_write(L, io_tofile(L)->fp, 1);\r\n}\r\n\r\nLJLIB_CF(io_method_flush)\t\tLJLIB_REC(io_flush 0)\r\n{\r\n  return luaL_fileresult(L, fflush(io_tofile(L)->fp) == 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_method_seek)\r\n{\r\n  FILE *fp = io_tofile(L)->fp;\r\n  int opt = lj_lib_checkopt(L, 2, 1, \"\\3set\\3cur\\3end\");\r\n  int64_t ofs = 0;\r\n  cTValue *o;\r\n  int res;\r\n  if (opt == 0) opt = SEEK_SET;\r\n  else if (opt == 1) opt = SEEK_CUR;\r\n  else if (opt == 2) opt = SEEK_END;\r\n  o = L->base+2;\r\n  if (o < L->top) {\r\n    if (tvisint(o))\r\n      ofs = (int64_t)intV(o);\r\n    else if (tvisnum(o))\r\n      ofs = (int64_t)numV(o);\r\n    else if (!tvisnil(o))\r\n      lj_err_argt(L, 3, LUA_TNUMBER);\r\n  }\r\n#if LJ_TARGET_POSIX\r\n  res = fseeko(fp, ofs, opt);\r\n#elif _MSC_VER >= 1400\r\n  res = _fseeki64(fp, ofs, opt);\r\n#elif defined(__MINGW32__)\r\n  res = fseeko64(fp, ofs, opt);\r\n#else\r\n  res = fseek(fp, (long)ofs, opt);\r\n#endif\r\n  if (res)\r\n    return luaL_fileresult(L, 0, NULL);\r\n#if LJ_TARGET_POSIX\r\n  ofs = ftello(fp);\r\n#elif _MSC_VER >= 1400\r\n  ofs = _ftelli64(fp);\r\n#elif defined(__MINGW32__)\r\n  ofs = ftello64(fp);\r\n#else\r\n  ofs = (int64_t)ftell(fp);\r\n#endif\r\n  setint64V(L->top-1, ofs);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_method_setvbuf)\r\n{\r\n  FILE *fp = io_tofile(L)->fp;\r\n  int opt = lj_lib_checkopt(L, 2, -1, \"\\4full\\4line\\2no\");\r\n  size_t sz = (size_t)lj_lib_optint(L, 3, LUAL_BUFFERSIZE);\r\n  if (opt == 0) opt = _IOFBF;\r\n  else if (opt == 1) opt = _IOLBF;\r\n  else if (opt == 2) opt = _IONBF;\r\n  return luaL_fileresult(L, setvbuf(fp, NULL, opt, sz) == 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_method_lines)\r\n{\r\n  io_tofile(L);\r\n  lua_pushcclosure(L, io_file_iter, (int)(L->top - L->base));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_method___gc)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp != NULL && (iof->type & IOFILE_TYPE_MASK) != IOFILE_TYPE_STDF)\r\n    io_file_close(L, iof);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(io_method___tostring)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp != NULL)\r\n    lua_pushfstring(L, \"file (%p)\", iof->fp);\r\n  else\r\n    lua_pushliteral(L, \"file (closed)\");\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-1) LJLIB_SET(__index)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- I/O library functions ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_io\r\n\r\nLJLIB_PUSH(top-2) LJLIB_SET(!)  /* Set environment. */\r\n\r\nLJLIB_CF(io_open)\r\n{\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  const char *mode = s ? strdata(s) : \"r\";\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->fp = fopen(fname, mode);\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, fname);\r\n}\r\n\r\nLJLIB_CF(io_popen)\r\n{\r\n#if LJ_TARGET_POSIX || LJ_TARGET_WINDOWS\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  const char *mode = s ? strdata(s) : \"r\";\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->type = IOFILE_TYPE_PIPE;\r\n#if LJ_TARGET_POSIX\r\n  fflush(NULL);\r\n  iof->fp = popen(fname, mode);\r\n#else\r\n  iof->fp = _popen(fname, mode);\r\n#endif\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, fname);\r\n#else\r\n  return luaL_error(L, LUA_QL(\"popen\") \" not supported\");\r\n#endif\r\n}\r\n\r\nLJLIB_CF(io_tmpfile)\r\n{\r\n  IOFileUD *iof = io_file_new(L);\r\n#if LJ_TARGET_PS3 || LJ_TARGET_PS4 || LJ_TARGET_PSVITA\r\n  iof->fp = NULL; errno = ENOSYS;\r\n#else\r\n  iof->fp = tmpfile();\r\n#endif\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_close)\r\n{\r\n  return lj_cf_io_method_close(L);\r\n}\r\n\r\nLJLIB_CF(io_read)\r\n{\r\n  return io_file_read(L, io_stdfile(L, GCROOT_IO_INPUT), 0);\r\n}\r\n\r\nLJLIB_CF(io_write)\t\tLJLIB_REC(io_write GCROOT_IO_OUTPUT)\r\n{\r\n  return io_file_write(L, io_stdfile(L, GCROOT_IO_OUTPUT), 0);\r\n}\r\n\r\nLJLIB_CF(io_flush)\t\tLJLIB_REC(io_flush GCROOT_IO_OUTPUT)\r\n{\r\n  return luaL_fileresult(L, fflush(io_stdfile(L, GCROOT_IO_OUTPUT)) == 0, NULL);\r\n}\r\n\r\nstatic int io_std_getset(lua_State *L, ptrdiff_t id, const char *mode)\r\n{\r\n  if (L->base < L->top && !tvisnil(L->base)) {\r\n    if (tvisudata(L->base)) {\r\n      io_tofile(L);\r\n      L->top = L->base+1;\r\n    } else {\r\n      io_file_open(L, mode);\r\n    }\r\n    /* NOBARRIER: The standard I/O handles are GC roots. */\r\n    setgcref(G(L)->gcroot[id], gcV(L->top-1));\r\n  } else {\r\n    setudataV(L, L->top++, IOSTDF_UD(L, id));\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_input)\r\n{\r\n  return io_std_getset(L, GCROOT_IO_INPUT, \"r\");\r\n}\r\n\r\nLJLIB_CF(io_output)\r\n{\r\n  return io_std_getset(L, GCROOT_IO_OUTPUT, \"w\");\r\n}\r\n\r\nLJLIB_CF(io_lines)\r\n{\r\n  if (L->base == L->top) setnilV(L->top++);\r\n  if (!tvisnil(L->base)) {  /* io.lines(fname) */\r\n    IOFileUD *iof = io_file_open(L, \"r\");\r\n    iof->type = IOFILE_TYPE_FILE|IOFILE_FLAG_CLOSE;\r\n    L->top--;\r\n    setudataV(L, L->base, udataV(L->top));\r\n  } else {  /* io.lines() iterates over stdin. */\r\n    setudataV(L, L->base, IOSTDF_UD(L, GCROOT_IO_INPUT));\r\n  }\r\n  lua_pushcclosure(L, io_file_iter, (int)(L->top - L->base));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_type)\r\n{\r\n  cTValue *o = lj_lib_checkany(L, 1);\r\n  if (!(tvisudata(o) && udataV(o)->udtype == UDTYPE_IO_FILE))\r\n    setnilV(L->top++);\r\n  else if (((IOFileUD *)uddata(udataV(o)))->fp != NULL)\r\n    lua_pushliteral(L, \"file\");\r\n  else\r\n    lua_pushliteral(L, \"closed file\");\r\n  return 1;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic GCobj *io_std_new(lua_State *L, FILE *fp, const char *name)\r\n{\r\n  IOFileUD *iof = (IOFileUD *)lua_newuserdata(L, sizeof(IOFileUD));\r\n  GCudata *ud = udataV(L->top-1);\r\n  ud->udtype = UDTYPE_IO_FILE;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcref(ud->metatable, gcV(L->top-3));\r\n  iof->fp = fp;\r\n  iof->type = IOFILE_TYPE_STDF;\r\n  lua_setfield(L, -2, name);\r\n  return obj2gco(ud);\r\n}\r\n\r\nLUALIB_API int luaopen_io(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, NULL, io_method);\r\n  copyTV(L, L->top, L->top-1); L->top++;\r\n  lua_setfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);\r\n  LJ_LIB_REG(L, LUA_IOLIBNAME, io);\r\n  setgcref(G(L)->gcroot[GCROOT_IO_INPUT], io_std_new(L, stdin, \"stdin\"));\r\n  setgcref(G(L)->gcroot[GCROOT_IO_OUTPUT], io_std_new(L, stdout, \"stdout\"));\r\n  io_std_new(L, stderr, \"stderr\");\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_jit.c",
    "content": "/*\r\n** JIT library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_jit_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_arch.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_target.h\"\r\n#endif\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#include \"luajit.h\"\r\n\r\n/* -- jit.* functions ----------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_jit\r\n\r\nstatic int setjitmode(lua_State *L, int mode)\r\n{\r\n  int idx = 0;\r\n  if (L->base == L->top || tvisnil(L->base)) {  /* jit.on/off/flush([nil]) */\r\n    mode |= LUAJIT_MODE_ENGINE;\r\n  } else {\r\n    /* jit.on/off/flush(func|proto, nil|true|false) */\r\n    if (tvisfunc(L->base) || tvisproto(L->base))\r\n      idx = 1;\r\n    else if (!tvistrue(L->base))  /* jit.on/off/flush(true, nil|true|false) */\r\n      goto err;\r\n    if (L->base+1 < L->top && tvisbool(L->base+1))\r\n      mode |= boolV(L->base+1) ? LUAJIT_MODE_ALLFUNC : LUAJIT_MODE_ALLSUBFUNC;\r\n    else\r\n      mode |= LUAJIT_MODE_FUNC;\r\n  }\r\n  if (luaJIT_setmode(L, idx, mode) != 1) {\r\n    if ((mode & LUAJIT_MODE_MASK) == LUAJIT_MODE_ENGINE)\r\n      lj_err_caller(L, LJ_ERR_NOJIT);\r\n  err:\r\n    lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(jit_on)\r\n{\r\n  return setjitmode(L, LUAJIT_MODE_ON);\r\n}\r\n\r\nLJLIB_CF(jit_off)\r\n{\r\n  return setjitmode(L, LUAJIT_MODE_OFF);\r\n}\r\n\r\nLJLIB_CF(jit_flush)\r\n{\r\n#if LJ_HASJIT\r\n  if (L->base < L->top && tvisnumber(L->base)) {\r\n    int traceno = lj_lib_checkint(L, 1);\r\n    luaJIT_setmode(L, traceno, LUAJIT_MODE_FLUSH|LUAJIT_MODE_TRACE);\r\n    return 0;\r\n  }\r\n#endif\r\n  return setjitmode(L, LUAJIT_MODE_FLUSH);\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Push a string for every flag bit that is set. */\r\nstatic void flagbits_to_strings(lua_State *L, uint32_t flags, uint32_t base,\r\n\t\t\t\tconst char *str)\r\n{\r\n  for (; *str; base <<= 1, str += 1+*str)\r\n    if (flags & base)\r\n      setstrV(L, L->top++, lj_str_new(L, str+1, *(uint8_t *)str));\r\n}\r\n#endif\r\n\r\nLJLIB_CF(jit_status)\r\n{\r\n#if LJ_HASJIT\r\n  jit_State *J = L2J(L);\r\n  L->top = L->base;\r\n  setboolV(L->top++, (J->flags & JIT_F_ON) ? 1 : 0);\r\n  flagbits_to_strings(L, J->flags, JIT_F_CPU_FIRST, JIT_F_CPUSTRING);\r\n  flagbits_to_strings(L, J->flags, JIT_F_OPT_FIRST, JIT_F_OPTSTRING);\r\n  return (int)(L->top - L->base);\r\n#else\r\n  setboolV(L->top++, 0);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(jit_attach)\r\n{\r\n#ifdef LUAJIT_DISABLE_VMEVENT\r\n  luaL_error(L, \"vmevent API disabled\");\r\n#else\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, LJ_VMEVENTS_REGKEY, LJ_VMEVENTS_HSIZE);\r\n  if (s) {  /* Attach to given event. */\r\n    const uint8_t *p = (const uint8_t *)strdata(s);\r\n    uint32_t h = s->len;\r\n    while (*p) h = h ^ (lj_rol(h, 6) + *p++);\r\n    lua_pushvalue(L, 1);\r\n    lua_rawseti(L, -2, VMEVENT_HASHIDX(h));\r\n    G(L)->vmevmask = VMEVENT_NOCACHE;  /* Invalidate cache. */\r\n  } else {  /* Detach if no event given. */\r\n    setnilV(L->top++);\r\n    while (lua_next(L, -2)) {\r\n      L->top--;\r\n      if (tvisfunc(L->top) && funcV(L->top) == fn) {\r\n\tsetnilV(lj_tab_set(L, tabV(L->top-2), L->top-1));\r\n      }\r\n    }\r\n  }\r\n#endif\r\n  return 0;\r\n}\r\n\r\nLJLIB_PUSH(top-5) LJLIB_SET(os)\r\nLJLIB_PUSH(top-4) LJLIB_SET(arch)\r\nLJLIB_PUSH(top-3) LJLIB_SET(version_num)\r\nLJLIB_PUSH(top-2) LJLIB_SET(version)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- jit.util.* functions ------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_jit_util\r\n\r\n/* -- Reflection API for Lua functions ------------------------------------ */\r\n\r\n/* Return prototype of first argument (Lua function or prototype object) */\r\nstatic GCproto *check_Lproto(lua_State *L, int nolua)\r\n{\r\n  TValue *o = L->base;\r\n  if (L->top > o) {\r\n    if (tvisproto(o)) {\r\n      return protoV(o);\r\n    } else if (tvisfunc(o)) {\r\n      if (isluafunc(funcV(o)))\r\n\treturn funcproto(funcV(o));\r\n      else if (nolua)\r\n\treturn NULL;\r\n    }\r\n  }\r\n  lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nstatic void setintfield(lua_State *L, GCtab *t, const char *name, int32_t val)\r\n{\r\n  setintV(lj_tab_setstr(L, t, lj_str_newz(L, name)), val);\r\n}\r\n\r\n/* local info = jit.util.funcinfo(func [,pc]) */\r\nLJLIB_CF(jit_util_funcinfo)\r\n{\r\n  GCproto *pt = check_Lproto(L, 1);\r\n  if (pt) {\r\n    BCPos pc = (BCPos)lj_lib_optint(L, 2, 0);\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 16);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    setintfield(L, t, \"linedefined\", pt->firstline);\r\n    setintfield(L, t, \"lastlinedefined\", pt->firstline + pt->numline);\r\n    setintfield(L, t, \"stackslots\", pt->framesize);\r\n    setintfield(L, t, \"params\", pt->numparams);\r\n    setintfield(L, t, \"bytecodes\", (int32_t)pt->sizebc);\r\n    setintfield(L, t, \"gcconsts\", (int32_t)pt->sizekgc);\r\n    setintfield(L, t, \"nconsts\", (int32_t)pt->sizekn);\r\n    setintfield(L, t, \"upvalues\", (int32_t)pt->sizeuv);\r\n    if (pc < pt->sizebc)\r\n      setintfield(L, t, \"currentline\", lj_debug_line(pt, pc));\r\n    lua_pushboolean(L, (pt->flags & PROTO_VARARG));\r\n    lua_setfield(L, -2, \"isvararg\");\r\n    lua_pushboolean(L, (pt->flags & PROTO_CHILD));\r\n    lua_setfield(L, -2, \"children\");\r\n    setstrV(L, L->top++, proto_chunkname(pt));\r\n    lua_setfield(L, -2, \"source\");\r\n    lj_debug_pushloc(L, pt, pc);\r\n    lua_setfield(L, -2, \"loc\");\r\n  } else {\r\n    GCfunc *fn = funcV(L->base);\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 4);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    if (!iscfunc(fn))\r\n      setintfield(L, t, \"ffid\", fn->c.ffid);\r\n    setintptrV(lj_tab_setstr(L, t, lj_str_newlit(L, \"addr\")),\r\n\t       (intptr_t)(void *)fn->c.f);\r\n    setintfield(L, t, \"upvalues\", fn->c.nupvalues);\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* local ins, m = jit.util.funcbc(func, pc) */\r\nLJLIB_CF(jit_util_funcbc)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  BCPos pc = (BCPos)lj_lib_checkint(L, 2);\r\n  if (pc < pt->sizebc) {\r\n    BCIns ins = proto_bc(pt)[pc];\r\n    BCOp op = bc_op(ins);\r\n    lua_assert(op < BC__MAX);\r\n    setintV(L->top, ins);\r\n    setintV(L->top+1, lj_bc_mode[op]);\r\n    L->top += 2;\r\n    return 2;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local k = jit.util.funck(func, idx) */\r\nLJLIB_CF(jit_util_funck)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  ptrdiff_t idx = (ptrdiff_t)lj_lib_checkint(L, 2);\r\n  if (idx >= 0) {\r\n    if (idx < (ptrdiff_t)pt->sizekn) {\r\n      copyTV(L, L->top-1, proto_knumtv(pt, idx));\r\n      return 1;\r\n    }\r\n  } else {\r\n    if (~idx < (ptrdiff_t)pt->sizekgc) {\r\n      GCobj *gc = proto_kgc(pt, idx);\r\n      setgcV(L, L->top-1, gc, ~gc->gch.gct);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local name = jit.util.funcuvname(func, idx) */\r\nLJLIB_CF(jit_util_funcuvname)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  uint32_t idx = (uint32_t)lj_lib_checkint(L, 2);\r\n  if (idx < pt->sizeuv) {\r\n    setstrV(L, L->top-1, lj_str_newz(L, lj_debug_uvname(pt, idx)));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Reflection API for traces ------------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n\r\n/* Check trace argument. Must not throw for non-existent trace numbers. */\r\nstatic GCtrace *jit_checktrace(lua_State *L)\r\n{\r\n  TraceNo tr = (TraceNo)lj_lib_checkint(L, 1);\r\n  jit_State *J = L2J(L);\r\n  if (tr > 0 && tr < J->sizetrace)\r\n    return traceref(J, tr);\r\n  return NULL;\r\n}\r\n\r\n/* Names of link types. ORDER LJ_TRLINK */\r\nstatic const char *const jit_trlinkname[] = {\r\n  \"none\", \"root\", \"loop\", \"tail-recursion\", \"up-recursion\", \"down-recursion\",\r\n  \"interpreter\", \"return\"\r\n};\r\n\r\n/* local info = jit.util.traceinfo(tr) */\r\nLJLIB_CF(jit_util_traceinfo)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  if (T) {\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 8);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    setintfield(L, t, \"nins\", (int32_t)T->nins - REF_BIAS - 1);\r\n    setintfield(L, t, \"nk\", REF_BIAS - (int32_t)T->nk);\r\n    setintfield(L, t, \"link\", T->link);\r\n    setintfield(L, t, \"nexit\", T->nsnap);\r\n    setstrV(L, L->top++, lj_str_newz(L, jit_trlinkname[T->linktype]));\r\n    lua_setfield(L, -2, \"linktype\");\r\n    /* There are many more fields. Add them only when needed. */\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local m, ot, op1, op2, prev = jit.util.traceir(tr, idx) */\r\nLJLIB_CF(jit_util_traceir)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  IRRef ref = (IRRef)lj_lib_checkint(L, 2) + REF_BIAS;\r\n  if (T && ref >= REF_BIAS && ref < T->nins) {\r\n    IRIns *ir = &T->ir[ref];\r\n    int32_t m = lj_ir_mode[ir->o];\r\n    setintV(L->top-2, m);\r\n    setintV(L->top-1, ir->ot);\r\n    setintV(L->top++, (int32_t)ir->op1 - (irm_op1(m)==IRMref ? REF_BIAS : 0));\r\n    setintV(L->top++, (int32_t)ir->op2 - (irm_op2(m)==IRMref ? REF_BIAS : 0));\r\n    setintV(L->top++, ir->prev);\r\n    return 5;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local k, t [, slot] = jit.util.tracek(tr, idx) */\r\nLJLIB_CF(jit_util_tracek)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  IRRef ref = (IRRef)lj_lib_checkint(L, 2) + REF_BIAS;\r\n  if (T && ref >= T->nk && ref < REF_BIAS) {\r\n    IRIns *ir = &T->ir[ref];\r\n    int32_t slot = -1;\r\n    if (ir->o == IR_KSLOT) {\r\n      slot = ir->op2;\r\n      ir = &T->ir[ir->op1];\r\n    }\r\n    lj_ir_kvalue(L, L->top-2, ir);\r\n    setintV(L->top-1, (int32_t)irt_type(ir->t));\r\n    if (slot == -1)\r\n      return 2;\r\n    setintV(L->top++, slot);\r\n    return 3;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local snap = jit.util.tracesnap(tr, sn) */\r\nLJLIB_CF(jit_util_tracesnap)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  SnapNo sn = (SnapNo)lj_lib_checkint(L, 2);\r\n  if (T && sn < T->nsnap) {\r\n    SnapShot *snap = &T->snap[sn];\r\n    SnapEntry *map = &T->snapmap[snap->mapofs];\r\n    MSize n, nent = snap->nent;\r\n    GCtab *t;\r\n    lua_createtable(L, nent+2, 0);\r\n    t = tabV(L->top-1);\r\n    setintV(lj_tab_setint(L, t, 0), (int32_t)snap->ref - REF_BIAS);\r\n    setintV(lj_tab_setint(L, t, 1), (int32_t)snap->nslots);\r\n    for (n = 0; n < nent; n++)\r\n      setintV(lj_tab_setint(L, t, (int32_t)(n+2)), (int32_t)map[n]);\r\n    setintV(lj_tab_setint(L, t, (int32_t)(nent+2)), (int32_t)SNAP(255, 0, 0));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local mcode, addr, loop = jit.util.tracemc(tr) */\r\nLJLIB_CF(jit_util_tracemc)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  if (T && T->mcode != NULL) {\r\n    setstrV(L, L->top-1, lj_str_new(L, (const char *)T->mcode, T->szmcode));\r\n    setintptrV(L->top++, (intptr_t)(void *)T->mcode);\r\n    setintV(L->top++, T->mcloop);\r\n    return 3;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local addr = jit.util.traceexitstub([tr,] exitno) */\r\nLJLIB_CF(jit_util_traceexitstub)\r\n{\r\n#ifdef EXITSTUBS_PER_GROUP\r\n  ExitNo exitno = (ExitNo)lj_lib_checkint(L, 1);\r\n  jit_State *J = L2J(L);\r\n  if (exitno < EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR) {\r\n    setintptrV(L->top-1, (intptr_t)(void *)exitstub_addr(J, exitno));\r\n    return 1;\r\n  }\r\n#else\r\n  if (L->top > L->base+1) {  /* Don't throw for one-argument variant. */\r\n    GCtrace *T = jit_checktrace(L);\r\n    ExitNo exitno = (ExitNo)lj_lib_checkint(L, 2);\r\n    ExitNo maxexit = T->root ? T->nsnap+1 : T->nsnap;\r\n    if (T && T->mcode != NULL && exitno < maxexit) {\r\n      setintptrV(L->top-1, (intptr_t)(void *)exitstub_trace_addr(T, exitno));\r\n      return 1;\r\n    }\r\n  }\r\n#endif\r\n  return 0;\r\n}\r\n\r\n/* local addr = jit.util.ircalladdr(idx) */\r\nLJLIB_CF(jit_util_ircalladdr)\r\n{\r\n  uint32_t idx = (uint32_t)lj_lib_checkint(L, 1);\r\n  if (idx < IRCALL__MAX) {\r\n    setintptrV(L->top-1, (intptr_t)(void *)lj_ir_callinfo[idx].func);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n#endif\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- jit.opt module ------------------------------------------------------ */\r\n\r\n#if LJ_HASJIT\r\n\r\n#define LJLIB_MODULE_jit_opt\r\n\r\n/* Parse optimization level. */\r\nstatic int jitopt_level(jit_State *J, const char *str)\r\n{\r\n  if (str[0] >= '0' && str[0] <= '9' && str[1] == '\\0') {\r\n    uint32_t flags;\r\n    if (str[0] == '0') flags = JIT_F_OPT_0;\r\n    else if (str[0] == '1') flags = JIT_F_OPT_1;\r\n    else if (str[0] == '2') flags = JIT_F_OPT_2;\r\n    else flags = JIT_F_OPT_3;\r\n    J->flags = (J->flags & ~JIT_F_OPT_MASK) | flags;\r\n    return 1;  /* Ok. */\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* Parse optimization flag. */\r\nstatic int jitopt_flag(jit_State *J, const char *str)\r\n{\r\n  const char *lst = JIT_F_OPTSTRING;\r\n  uint32_t opt;\r\n  int set = 1;\r\n  if (str[0] == '+') {\r\n    str++;\r\n  } else if (str[0] == '-') {\r\n    str++;\r\n    set = 0;\r\n  } else if (str[0] == 'n' && str[1] == 'o') {\r\n    str += str[2] == '-' ? 3 : 2;\r\n    set = 0;\r\n  }\r\n  for (opt = JIT_F_OPT_FIRST; ; opt <<= 1) {\r\n    size_t len = *(const uint8_t *)lst;\r\n    if (len == 0)\r\n      break;\r\n    if (strncmp(str, lst+1, len) == 0 && str[len] == '\\0') {\r\n      if (set) J->flags |= opt; else J->flags &= ~opt;\r\n      return 1;  /* Ok. */\r\n    }\r\n    lst += 1+len;\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* Parse optimization parameter. */\r\nstatic int jitopt_param(jit_State *J, const char *str)\r\n{\r\n  const char *lst = JIT_P_STRING;\r\n  int i;\r\n  for (i = 0; i < JIT_P__MAX; i++) {\r\n    size_t len = *(const uint8_t *)lst;\r\n    lua_assert(len != 0);\r\n    if (strncmp(str, lst+1, len) == 0 && str[len] == '=') {\r\n      int32_t n = 0;\r\n      const char *p = &str[len+1];\r\n      while (*p >= '0' && *p <= '9')\r\n\tn = n*10 + (*p++ - '0');\r\n      if (*p) return 0;  /* Malformed number. */\r\n      J->param[i] = n;\r\n      if (i == JIT_P_hotloop)\r\n\tlj_dispatch_init_hotcount(J2G(J));\r\n      return 1;  /* Ok. */\r\n    }\r\n    lst += 1+len;\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* jit.opt.start(flags...) */\r\nLJLIB_CF(jit_opt_start)\r\n{\r\n  jit_State *J = L2J(L);\r\n  int nargs = (int)(L->top - L->base);\r\n  if (nargs == 0) {\r\n    J->flags = (J->flags & ~JIT_F_OPT_MASK) | JIT_F_OPT_DEFAULT;\r\n  } else {\r\n    int i;\r\n    for (i = 1; i <= nargs; i++) {\r\n      const char *str = strdata(lj_lib_checkstr(L, i));\r\n      if (!jitopt_level(J, str) &&\r\n\t  !jitopt_flag(J, str) &&\r\n\t  !jitopt_param(J, str))\r\n\tlj_err_callerv(L, LJ_ERR_JITOPT, str);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n#endif\r\n\r\n/* -- JIT compiler initialization ----------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n/* Default values for JIT parameters. */\r\nstatic const int32_t jit_param_default[JIT_P__MAX+1] = {\r\n#define JIT_PARAMINIT(len, name, value)\t(value),\r\nJIT_PARAMDEF(JIT_PARAMINIT)\r\n#undef JIT_PARAMINIT\r\n  0\r\n};\r\n#endif\r\n\r\n#if LJ_TARGET_ARM && LJ_TARGET_LINUX\r\n#include <sys/utsname.h>\r\n#endif\r\n\r\n/* Arch-dependent CPU detection. */\r\nstatic uint32_t jit_cpudetect(lua_State *L)\r\n{\r\n  uint32_t flags = 0;\r\n#if LJ_TARGET_X86ORX64\r\n  uint32_t vendor[4];\r\n  uint32_t features[4];\r\n  if (lj_vm_cpuid(0, vendor) && lj_vm_cpuid(1, features)) {\r\n#if !LJ_HASJIT\r\n#define JIT_F_CMOV\t1\r\n#define JIT_F_SSE2\t2\r\n#endif\r\n    flags |= ((features[3] >> 15)&1) * JIT_F_CMOV;\r\n    flags |= ((features[3] >> 26)&1) * JIT_F_SSE2;\r\n#if LJ_HASJIT\r\n    flags |= ((features[2] >> 0)&1) * JIT_F_SSE3;\r\n    flags |= ((features[2] >> 19)&1) * JIT_F_SSE4_1;\r\n    if (vendor[2] == 0x6c65746e) {  /* Intel. */\r\n      if ((features[0] & 0x0ff00f00) == 0x00000f00)  /* P4. */\r\n\tflags |= JIT_F_P4;  /* Currently unused. */\r\n      else if ((features[0] & 0x0fff0ff0) == 0x000106c0)  /* Atom. */\r\n\tflags |= JIT_F_LEA_AGU;\r\n    } else if (vendor[2] == 0x444d4163) {  /* AMD. */\r\n      uint32_t fam = (features[0] & 0x0ff00f00);\r\n      if (fam == 0x00000f00)  /* K8. */\r\n\tflags |= JIT_F_SPLIT_XMM;\r\n      if (fam >= 0x00000f00)  /* K8, K10. */\r\n\tflags |= JIT_F_PREFER_IMUL;\r\n    }\r\n#endif\r\n  }\r\n  /* Check for required instruction set support on x86 (unnecessary on x64). */\r\n#if LJ_TARGET_X86\r\n#if !defined(LUAJIT_CPU_NOCMOV)\r\n  if (!(flags & JIT_F_CMOV))\r\n    luaL_error(L, \"CPU not supported\");\r\n#endif\r\n#if defined(LUAJIT_CPU_SSE2)\r\n  if (!(flags & JIT_F_SSE2))\r\n    luaL_error(L, \"CPU does not support SSE2 (recompile without -DLUAJIT_CPU_SSE2)\");\r\n#endif\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if LJ_HASJIT\r\n  int ver = LJ_ARCH_VERSION;  /* Compile-time ARM CPU detection. */\r\n#if LJ_TARGET_LINUX\r\n  if (ver < 70) {  /* Runtime ARM CPU detection. */\r\n    struct utsname ut;\r\n    uname(&ut);\r\n    if (strncmp(ut.machine, \"armv\", 4) == 0) {\r\n      if (ut.machine[4] >= '7')\r\n\tver = 70;\r\n      else if (ut.machine[4] == '6')\r\n\tver = 60;\r\n    }\r\n  }\r\n#endif\r\n  flags |= ver >= 70 ? JIT_F_ARMV7 :\r\n\t   ver >= 61 ? JIT_F_ARMV6T2_ :\r\n\t   ver >= 60 ? JIT_F_ARMV6_ : 0;\r\n  flags |= LJ_ARCH_HASFPU == 0 ? 0 : ver >= 70 ? JIT_F_VFPV3 : JIT_F_VFPV2;\r\n#endif\r\n#elif LJ_TARGET_PPC\r\n#if LJ_HASJIT\r\n#if LJ_ARCH_SQRT\r\n  flags |= JIT_F_SQRT;\r\n#endif\r\n#if LJ_ARCH_ROUND\r\n  flags |= JIT_F_ROUND;\r\n#endif\r\n#endif\r\n#elif LJ_TARGET_PPCSPE\r\n  /* Nothing to do. */\r\n#elif LJ_TARGET_MIPS\r\n#if LJ_HASJIT\r\n  /* Compile-time MIPS CPU detection. */\r\n#if LJ_ARCH_VERSION >= 20\r\n  flags |= JIT_F_MIPS32R2;\r\n#endif\r\n  /* Runtime MIPS CPU detection. */\r\n#if defined(__GNUC__)\r\n  if (!(flags & JIT_F_MIPS32R2)) {\r\n    int x;\r\n    /* On MIPS32R1 rotr is treated as srl. rotr r2,r2,1 -> srl r2,r2,1. */\r\n    __asm__(\"li $2, 1\\n\\t.long 0x00221042\\n\\tmove %0, $2\" : \"=r\"(x) : : \"$2\");\r\n    if (x) flags |= JIT_F_MIPS32R2;  /* Either 0x80000000 (R2) or 0 (R1). */\r\n  }\r\n#endif\r\n#endif\r\n#else\r\n#error \"Missing CPU detection for this architecture\"\r\n#endif\r\n  UNUSED(L);\r\n  return flags;\r\n}\r\n\r\n/* Initialize JIT compiler. */\r\nstatic void jit_init(lua_State *L)\r\n{\r\n  uint32_t flags = jit_cpudetect(L);\r\n#if LJ_HASJIT\r\n  jit_State *J = L2J(L);\r\n#if LJ_TARGET_X86\r\n  /* Silently turn off the JIT compiler on CPUs without SSE2. */\r\n  if ((flags & JIT_F_SSE2))\r\n#endif\r\n    J->flags = flags | JIT_F_ON | JIT_F_OPT_DEFAULT;\r\n  memcpy(J->param, jit_param_default, sizeof(J->param));\r\n  lj_dispatch_update(G(L));\r\n#else\r\n  UNUSED(flags);\r\n#endif\r\n}\r\n\r\nLUALIB_API int luaopen_jit(lua_State *L)\r\n{\r\n  lua_pushliteral(L, LJ_OS_NAME);\r\n  lua_pushliteral(L, LJ_ARCH_NAME);\r\n  lua_pushinteger(L, LUAJIT_VERSION_NUM);\r\n  lua_pushliteral(L, LUAJIT_VERSION);\r\n  LJ_LIB_REG(L, LUA_JITLIBNAME, jit);\r\n#ifndef LUAJIT_DISABLE_JITUTIL\r\n  LJ_LIB_REG(L, \"jit.util\", jit_util);\r\n#endif\r\n#if LJ_HASJIT\r\n  LJ_LIB_REG(L, \"jit.opt\", jit_opt);\r\n#endif\r\n  L->top -= 2;\r\n  jit_init(L);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_math.c",
    "content": "/*\r\n** Math library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <math.h>\r\n\r\n#define lib_math_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lib.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_math\r\n\r\nLJLIB_ASM(math_abs)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_floor)\t\tLJLIB_REC(math_round IRFPM_FLOOR)\r\nLJLIB_ASM_(math_ceil)\t\tLJLIB_REC(math_round IRFPM_CEIL)\r\n\r\nLJLIB_ASM(math_sqrt)\t\tLJLIB_REC(math_unary IRFPM_SQRT)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_log10)\t\tLJLIB_REC(math_unary IRFPM_LOG10)\r\nLJLIB_ASM_(math_exp)\t\tLJLIB_REC(math_unary IRFPM_EXP)\r\nLJLIB_ASM_(math_sin)\t\tLJLIB_REC(math_unary IRFPM_SIN)\r\nLJLIB_ASM_(math_cos)\t\tLJLIB_REC(math_unary IRFPM_COS)\r\nLJLIB_ASM_(math_tan)\t\tLJLIB_REC(math_unary IRFPM_TAN)\r\nLJLIB_ASM_(math_asin)\t\tLJLIB_REC(math_atrig FF_math_asin)\r\nLJLIB_ASM_(math_acos)\t\tLJLIB_REC(math_atrig FF_math_acos)\r\nLJLIB_ASM_(math_atan)\t\tLJLIB_REC(math_atrig FF_math_atan)\r\nLJLIB_ASM_(math_sinh)\t\tLJLIB_REC(math_htrig IRCALL_sinh)\r\nLJLIB_ASM_(math_cosh)\t\tLJLIB_REC(math_htrig IRCALL_cosh)\r\nLJLIB_ASM_(math_tanh)\t\tLJLIB_REC(math_htrig IRCALL_tanh)\r\nLJLIB_ASM_(math_frexp)\r\nLJLIB_ASM_(math_modf)\t\tLJLIB_REC(.)\r\n\r\nLJLIB_PUSH(57.29577951308232)\r\nLJLIB_ASM_(math_deg)\t\tLJLIB_REC(math_degrad)\r\n\r\nLJLIB_PUSH(0.017453292519943295)\r\nLJLIB_ASM_(math_rad)\t\tLJLIB_REC(math_degrad)\r\n\r\nLJLIB_ASM(math_log)\t\tLJLIB_REC(math_log)\r\n{\r\n  double x = lj_lib_checknum(L, 1);\r\n  if (L->base+1 < L->top) {\r\n    double y = lj_lib_checknum(L, 2);\r\n#ifdef LUAJIT_NO_LOG2\r\n    x = log(x); y = 1.0 / log(y);\r\n#else\r\n    x = lj_vm_log2(x); y = 1.0 / lj_vm_log2(y);\r\n#endif\r\n    setnumV(L->base-1, x*y);  /* Do NOT join the expression to x / y. */\r\n    return FFH_RES(1);\r\n  }\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(math_atan2)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n  lj_lib_checknum(L, 2);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_pow)\t\tLJLIB_REC(.)\r\nLJLIB_ASM_(math_fmod)\r\n\r\nLJLIB_ASM(math_ldexp)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n#if LJ_DUALNUM && !LJ_TARGET_X86ORX64\r\n  lj_lib_checkint(L, 2);\r\n#else\r\n  lj_lib_checknum(L, 2);\r\n#endif\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(math_min)\t\tLJLIB_REC(math_minmax IR_MIN)\r\n{\r\n  int i = 0;\r\n  do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_max)\t\tLJLIB_REC(math_minmax IR_MAX)\r\n\r\nLJLIB_PUSH(3.14159265358979323846) LJLIB_SET(pi)\r\nLJLIB_PUSH(1e310) LJLIB_SET(huge)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* This implements a Tausworthe PRNG with period 2^223. Based on:\r\n**   Tables of maximally-equidistributed combined LFSR generators,\r\n**   Pierre L'Ecuyer, 1991, table 3, 1st entry.\r\n** Full-period ME-CF generator with L=64, J=4, k=223, N1=49.\r\n*/\r\n\r\n/* PRNG state. */\r\nstruct RandomState {\r\n  uint64_t gen[4];\t/* State of the 4 LFSR generators. */\r\n  int valid;\t\t/* State is valid. */\r\n};\r\n\r\n/* Union needed for bit-pattern conversion between uint64_t and double. */\r\ntypedef union { uint64_t u64; double d; } U64double;\r\n\r\n/* Update generator i and compute a running xor of all states. */\r\n#define TW223_GEN(i, k, q, s) \\\r\n  z = rs->gen[i]; \\\r\n  z = (((z<<q)^z) >> (k-s)) ^ ((z&((uint64_t)(int64_t)-1 << (64-k)))<<s); \\\r\n  r ^= z; rs->gen[i] = z;\r\n\r\n/* PRNG step function. Returns a double in the range 1.0 <= d < 2.0. */\r\nLJ_NOINLINE uint64_t LJ_FASTCALL lj_math_random_step(RandomState *rs)\r\n{\r\n  uint64_t z, r = 0;\r\n  TW223_GEN(0, 63, 31, 18)\r\n  TW223_GEN(1, 58, 19, 28)\r\n  TW223_GEN(2, 55, 24,  7)\r\n  TW223_GEN(3, 47, 21,  8)\r\n  return (r & U64x(000fffff,ffffffff)) | U64x(3ff00000,00000000);\r\n}\r\n\r\n/* PRNG initialization function. */\r\nstatic void random_init(RandomState *rs, double d)\r\n{\r\n  uint32_t r = 0x11090601;  /* 64-k[i] as four 8 bit constants. */\r\n  int i;\r\n  for (i = 0; i < 4; i++) {\r\n    U64double u;\r\n    uint32_t m = 1u << (r&255);\r\n    r >>= 8;\r\n    u.d = d = d * 3.14159265358979323846 + 2.7182818284590452354;\r\n    if (u.u64 < m) u.u64 += m;  /* Ensure k[i] MSB of gen[i] are non-zero. */\r\n    rs->gen[i] = u.u64;\r\n  }\r\n  rs->valid = 1;\r\n  for (i = 0; i < 10; i++)\r\n    lj_math_random_step(rs);\r\n}\r\n\r\n/* PRNG extract function. */\r\nLJLIB_PUSH(top-2)  /* Upvalue holds userdata with RandomState. */\r\nLJLIB_CF(math_random)\t\tLJLIB_REC(.)\r\n{\r\n  int n = (int)(L->top - L->base);\r\n  RandomState *rs = (RandomState *)(uddata(udataV(lj_lib_upvalue(L, 1))));\r\n  U64double u;\r\n  double d;\r\n  if (LJ_UNLIKELY(!rs->valid)) random_init(rs, 0.0);\r\n  u.u64 = lj_math_random_step(rs);\r\n  d = u.d - 1.0;\r\n  if (n > 0) {\r\n#if LJ_DUALNUM\r\n    int isint = 1;\r\n    double r1;\r\n    lj_lib_checknumber(L, 1);\r\n    if (tvisint(L->base)) {\r\n      r1 = (lua_Number)intV(L->base);\r\n    } else {\r\n      isint = 0;\r\n      r1 = numV(L->base);\r\n    }\r\n#else\r\n    double r1 = lj_lib_checknum(L, 1);\r\n#endif\r\n    if (n == 1) {\r\n      d = lj_vm_floor(d*r1) + 1.0;  /* d is an int in range [1, r1] */\r\n    } else {\r\n#if LJ_DUALNUM\r\n      double r2;\r\n      lj_lib_checknumber(L, 2);\r\n      if (tvisint(L->base+1)) {\r\n\tr2 = (lua_Number)intV(L->base+1);\r\n      } else {\r\n\tisint = 0;\r\n\tr2 = numV(L->base+1);\r\n      }\r\n#else\r\n      double r2 = lj_lib_checknum(L, 2);\r\n#endif\r\n      d = lj_vm_floor(d*(r2-r1+1.0)) + r1;  /* d is an int in range [r1, r2] */\r\n    }\r\n#if LJ_DUALNUM\r\n    if (isint) {\r\n      setintV(L->top-1, lj_num2int(d));\r\n      return 1;\r\n    }\r\n#endif\r\n  }  /* else: d is a double in range [0, 1] */\r\n  setnumV(L->top++, d);\r\n  return 1;\r\n}\r\n\r\n/* PRNG seed function. */\r\nLJLIB_PUSH(top-2)  /* Upvalue holds userdata with RandomState. */\r\nLJLIB_CF(math_randomseed)\r\n{\r\n  RandomState *rs = (RandomState *)(uddata(udataV(lj_lib_upvalue(L, 1))));\r\n  random_init(rs, lj_lib_checknum(L, 1));\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_math(lua_State *L)\r\n{\r\n  RandomState *rs;\r\n  rs = (RandomState *)lua_newuserdata(L, sizeof(RandomState));\r\n  rs->valid = 0;  /* Use lazy initialization to save some time on startup. */\r\n  LJ_LIB_REG(L, LUA_MATHLIBNAME, math);\r\n#if defined(LUA_COMPAT_MOD) && !LJ_52\r\n  lua_getfield(L, -1, \"fmod\");\r\n  lua_setfield(L, -2, \"mod\");\r\n#endif\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_os.c",
    "content": "/*\r\n** OS library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <time.h>\r\n\r\n#define lib_os_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <unistd.h>\r\n#else\r\n#include <stdio.h>\r\n#endif\r\n\r\n#if !LJ_TARGET_PSVITA\r\n#include <locale.h>\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_os\r\n\r\nLJLIB_CF(os_execute)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n#if LJ_52\r\n  errno = ENOSYS;\r\n  return luaL_fileresult(L, 0, NULL);\r\n#else\r\n  lua_pushinteger(L, -1);\r\n  return 1;\r\n#endif\r\n#else\r\n  const char *cmd = luaL_optstring(L, 1, NULL);\r\n  int stat = system(cmd);\r\n#if LJ_52\r\n  if (cmd)\r\n    return luaL_execresult(L, stat);\r\n  setboolV(L->top++, 1);\r\n#else\r\n  setintV(L->top++, stat);\r\n#endif\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(os_remove)\r\n{\r\n  const char *filename = luaL_checkstring(L, 1);\r\n  return luaL_fileresult(L, remove(filename) == 0, filename);\r\n}\r\n\r\nLJLIB_CF(os_rename)\r\n{\r\n  const char *fromname = luaL_checkstring(L, 1);\r\n  const char *toname = luaL_checkstring(L, 2);\r\n  return luaL_fileresult(L, rename(fromname, toname) == 0, fromname);\r\n}\r\n\r\nLJLIB_CF(os_tmpname)\r\n{\r\n#if LJ_TARGET_PS3 || LJ_TARGET_PS4 || LJ_TARGET_PSVITA\r\n  lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n  return 0;\r\n#else\r\n#if LJ_TARGET_POSIX\r\n  char buf[15+1];\r\n  int fp;\r\n  strcpy(buf, \"/tmp/lua_XXXXXX\");\r\n  fp = mkstemp(buf);\r\n  if (fp != -1)\r\n    close(fp);\r\n  else\r\n    lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n#else\r\n  char buf[L_tmpnam];\r\n  if (tmpnam(buf) == NULL)\r\n    lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n#endif\r\n  lua_pushstring(L, buf);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(os_getenv)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  lua_pushnil(L);\r\n#else\r\n  lua_pushstring(L, getenv(luaL_checkstring(L, 1)));  /* if NULL push nil */\r\n#endif\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_exit)\r\n{\r\n  int status;\r\n  if (L->base < L->top && tvisbool(L->base))\r\n    status = boolV(L->base) ? EXIT_SUCCESS : EXIT_FAILURE;\r\n  else\r\n    status = lj_lib_optint(L, 1, EXIT_SUCCESS);\r\n  if (L->base+1 < L->top && tvistruecond(L->base+1))\r\n    lua_close(L);\r\n  exit(status);\r\n  return 0;  /* Unreachable. */\r\n}\r\n\r\nLJLIB_CF(os_clock)\r\n{\r\n  setnumV(L->top++, ((lua_Number)clock())*(1.0/(lua_Number)CLOCKS_PER_SEC));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void setfield(lua_State *L, const char *key, int value)\r\n{\r\n  lua_pushinteger(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic void setboolfield(lua_State *L, const char *key, int value)\r\n{\r\n  if (value < 0)  /* undefined? */\r\n    return;  /* does not set field */\r\n  lua_pushboolean(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic int getboolfield(lua_State *L, const char *key)\r\n{\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\nstatic int getfield(lua_State *L, const char *key, int d)\r\n{\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  if (lua_isnumber(L, -1)) {\r\n    res = (int)lua_tointeger(L, -1);\r\n  } else {\r\n    if (d < 0)\r\n      lj_err_callerv(L, LJ_ERR_OSDATEF, key);\r\n    res = d;\r\n  }\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\nLJLIB_CF(os_date)\r\n{\r\n  const char *s = luaL_optstring(L, 1, \"%c\");\r\n  time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));\r\n  struct tm *stm;\r\n#if LJ_TARGET_POSIX\r\n  struct tm rtm;\r\n#endif\r\n  if (*s == '!') {  /* UTC? */\r\n    s++;  /* Skip '!' */\r\n#if LJ_TARGET_POSIX\r\n    stm = gmtime_r(&t, &rtm);\r\n#else\r\n    stm = gmtime(&t);\r\n#endif\r\n  } else {\r\n#if LJ_TARGET_POSIX\r\n    stm = localtime_r(&t, &rtm);\r\n#else\r\n    stm = localtime(&t);\r\n#endif\r\n  }\r\n  if (stm == NULL) {  /* Invalid date? */\r\n    setnilV(L->top-1);\r\n  } else if (strcmp(s, \"*t\") == 0) {\r\n    lua_createtable(L, 0, 9);  /* 9 = number of fields */\r\n    setfield(L, \"sec\", stm->tm_sec);\r\n    setfield(L, \"min\", stm->tm_min);\r\n    setfield(L, \"hour\", stm->tm_hour);\r\n    setfield(L, \"day\", stm->tm_mday);\r\n    setfield(L, \"month\", stm->tm_mon+1);\r\n    setfield(L, \"year\", stm->tm_year+1900);\r\n    setfield(L, \"wday\", stm->tm_wday+1);\r\n    setfield(L, \"yday\", stm->tm_yday+1);\r\n    setboolfield(L, \"isdst\", stm->tm_isdst);\r\n  } else {\r\n    char cc[3];\r\n    luaL_Buffer b;\r\n    cc[0] = '%'; cc[2] = '\\0';\r\n    luaL_buffinit(L, &b);\r\n    for (; *s; s++) {\r\n      if (*s != '%' || *(s + 1) == '\\0') {  /* No conversion specifier? */\r\n\tluaL_addchar(&b, *s);\r\n      } else {\r\n\tsize_t reslen;\r\n\tchar buff[200];  /* Should be big enough for any conversion result. */\r\n\tcc[1] = *(++s);\r\n\treslen = strftime(buff, sizeof(buff), cc, stm);\r\n\tluaL_addlstring(&b, buff, reslen);\r\n      }\r\n    }\r\n    luaL_pushresult(&b);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_time)\r\n{\r\n  time_t t;\r\n  if (lua_isnoneornil(L, 1)) {  /* called without args? */\r\n    t = time(NULL);  /* get current time */\r\n  } else {\r\n    struct tm ts;\r\n    luaL_checktype(L, 1, LUA_TTABLE);\r\n    lua_settop(L, 1);  /* make sure table is at the top */\r\n    ts.tm_sec = getfield(L, \"sec\", 0);\r\n    ts.tm_min = getfield(L, \"min\", 0);\r\n    ts.tm_hour = getfield(L, \"hour\", 12);\r\n    ts.tm_mday = getfield(L, \"day\", -1);\r\n    ts.tm_mon = getfield(L, \"month\", -1) - 1;\r\n    ts.tm_year = getfield(L, \"year\", -1) - 1900;\r\n    ts.tm_isdst = getboolfield(L, \"isdst\");\r\n    t = mktime(&ts);\r\n  }\r\n  if (t == (time_t)(-1))\r\n    lua_pushnil(L);\r\n  else\r\n    lua_pushnumber(L, (lua_Number)t);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_difftime)\r\n{\r\n  lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),\r\n\t\t\t     (time_t)(luaL_optnumber(L, 2, (lua_Number)0))));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(os_setlocale)\r\n{\r\n#if LJ_TARGET_PSVITA\r\n  lua_pushliteral(L, \"C\");\r\n#else\r\n  GCstr *s = lj_lib_optstr(L, 1);\r\n  const char *str = s ? strdata(s) : NULL;\r\n  int opt = lj_lib_checkopt(L, 2, 6,\r\n    \"\\5ctype\\7numeric\\4time\\7collate\\10monetary\\1\\377\\3all\");\r\n  if (opt == 0) opt = LC_CTYPE;\r\n  else if (opt == 1) opt = LC_NUMERIC;\r\n  else if (opt == 2) opt = LC_TIME;\r\n  else if (opt == 3) opt = LC_COLLATE;\r\n  else if (opt == 4) opt = LC_MONETARY;\r\n  else if (opt == 6) opt = LC_ALL;\r\n  lua_pushstring(L, setlocale(opt, str));\r\n#endif\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_os(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_OSLIBNAME, os);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_package.c",
    "content": "/*\r\n** Package library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2012 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_package_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Error codes for ll_loadfunc. */\r\n#define PACKAGE_ERR_LIB\t\t1\r\n#define PACKAGE_ERR_FUNC\t2\r\n#define PACKAGE_ERR_LOAD\t3\r\n\r\n/* Redefined in platform specific part. */\r\n#define PACKAGE_LIB_FAIL\t\"open\"\r\n#define setprogdir(L)\t\t((void)0)\r\n\r\n/* Symbol name prefixes. */\r\n#define SYMPREFIX_CF\t\t\"luaopen_%s\"\r\n#define SYMPREFIX_BC\t\t\"luaJIT_BC_%s\"\r\n\r\n#if LJ_TARGET_DLOPEN\r\n\r\n#include <dlfcn.h>\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  dlclose(lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  void *lib = dlopen(path, RTLD_NOW | (gl ? RTLD_GLOBAL : RTLD_LOCAL));\r\n  if (lib == NULL) lua_pushstring(L, dlerror());\r\n  return lib;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  lua_CFunction f = (lua_CFunction)dlsym(lib, sym);\r\n  if (f == NULL) lua_pushstring(L, dlerror());\r\n  return f;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n#if defined(RTLD_DEFAULT)\r\n  if (lib == NULL) lib = RTLD_DEFAULT;\r\n#elif LJ_TARGET_OSX || LJ_TARGET_BSD\r\n  if (lib == NULL) lib = (void *)(intptr_t)-2;\r\n#endif\r\n  return (const char *)dlsym(lib, sym);\r\n}\r\n\r\n#elif LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#ifndef GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\r\n#define GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS  4\r\n#define GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT  2\r\nBOOL WINAPI GetModuleHandleExA(DWORD, LPCSTR, HMODULE*);\r\n#endif\r\n\r\n#undef setprogdir\r\n\r\nstatic void setprogdir(lua_State *L)\r\n{\r\n  char buff[MAX_PATH + 1];\r\n  char *lb;\r\n  DWORD nsize = sizeof(buff);\r\n  DWORD n = GetModuleFileNameA(NULL, buff, nsize);\r\n  if (n == 0 || n == nsize || (lb = strrchr(buff, '\\\\')) == NULL) {\r\n    luaL_error(L, \"unable to get ModuleFileName\");\r\n  } else {\r\n    *lb = '\\0';\r\n    luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);\r\n    lua_remove(L, -2);  /* remove original string */\r\n  }\r\n}\r\n\r\nstatic void pusherror(lua_State *L)\r\n{\r\n  DWORD error = GetLastError();\r\n  char buffer[128];\r\n  if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,\r\n      NULL, error, 0, buffer, sizeof(buffer), NULL))\r\n    lua_pushstring(L, buffer);\r\n  else\r\n    lua_pushfstring(L, \"system error %d\\n\", error);\r\n}\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  FreeLibrary((HINSTANCE)lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  HINSTANCE lib = LoadLibraryA(path);\r\n  if (lib == NULL) pusherror(L);\r\n  UNUSED(gl);\r\n  return lib;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);\r\n  if (f == NULL) pusherror(L);\r\n  return f;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n  if (lib) {\r\n    return (const char *)GetProcAddress((HINSTANCE)lib, sym);\r\n  } else {\r\n    HINSTANCE h = GetModuleHandleA(NULL);\r\n    const char *p = (const char *)GetProcAddress(h, sym);\r\n    if (p == NULL && GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t\t\t(const char *)ll_bcsym, &h))\r\n      p = (const char *)GetProcAddress(h, sym);\r\n    return p;\r\n  }\r\n}\r\n\r\n#else\r\n\r\n#undef PACKAGE_LIB_FAIL\r\n#define PACKAGE_LIB_FAIL\t\"absent\"\r\n\r\n#define DLMSG\t\"dynamic libraries not enabled; no support for target OS\"\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  UNUSED(lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  UNUSED(path); UNUSED(gl);\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  UNUSED(lib); UNUSED(sym);\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n  UNUSED(lib); UNUSED(sym);\r\n  return NULL;\r\n}\r\n\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void **ll_register(lua_State *L, const char *path)\r\n{\r\n  void **plib;\r\n  lua_pushfstring(L, \"LOADLIB: %s\", path);\r\n  lua_gettable(L, LUA_REGISTRYINDEX);  /* check library in registry? */\r\n  if (!lua_isnil(L, -1)) {  /* is there an entry? */\r\n    plib = (void **)lua_touserdata(L, -1);\r\n  } else {  /* no entry yet; create one */\r\n    lua_pop(L, 1);\r\n    plib = (void **)lua_newuserdata(L, sizeof(void *));\r\n    *plib = NULL;\r\n    luaL_getmetatable(L, \"_LOADLIB\");\r\n    lua_setmetatable(L, -2);\r\n    lua_pushfstring(L, \"LOADLIB: %s\", path);\r\n    lua_pushvalue(L, -2);\r\n    lua_settable(L, LUA_REGISTRYINDEX);\r\n  }\r\n  return plib;\r\n}\r\n\r\nstatic const char *mksymname(lua_State *L, const char *modname,\r\n\t\t\t     const char *prefix)\r\n{\r\n  const char *funcname;\r\n  const char *mark = strchr(modname, *LUA_IGMARK);\r\n  if (mark) modname = mark + 1;\r\n  funcname = luaL_gsub(L, modname, \".\", \"_\");\r\n  funcname = lua_pushfstring(L, prefix, funcname);\r\n  lua_remove(L, -2);  /* remove 'gsub' result */\r\n  return funcname;\r\n}\r\n\r\nstatic int ll_loadfunc(lua_State *L, const char *path, const char *name, int r)\r\n{\r\n  void **reg = ll_register(L, path);\r\n  if (*reg == NULL) *reg = ll_load(L, path, (*name == '*'));\r\n  if (*reg == NULL) {\r\n    return PACKAGE_ERR_LIB;  /* Unable to load library. */\r\n  } else if (*name == '*') {  /* Only load library into global namespace. */\r\n    lua_pushboolean(L, 1);\r\n    return 0;\r\n  } else {\r\n    const char *sym = r ? name : mksymname(L, name, SYMPREFIX_CF);\r\n    lua_CFunction f = ll_sym(L, *reg, sym);\r\n    if (f) {\r\n      lua_pushcfunction(L, f);\r\n      return 0;\r\n    }\r\n    if (!r) {\r\n      const char *bcdata = ll_bcsym(*reg, mksymname(L, name, SYMPREFIX_BC));\r\n      lua_pop(L, 1);\r\n      if (bcdata) {\r\n\tif (luaL_loadbuffer(L, bcdata, ~(size_t)0, name) != 0)\r\n\t  return PACKAGE_ERR_LOAD;\r\n\treturn 0;\r\n      }\r\n    }\r\n    return PACKAGE_ERR_FUNC;  /* Unable to find function. */\r\n  }\r\n}\r\n\r\nstatic int lj_cf_package_loadlib(lua_State *L)\r\n{\r\n  const char *path = luaL_checkstring(L, 1);\r\n  const char *init = luaL_checkstring(L, 2);\r\n  int st = ll_loadfunc(L, path, init, 1);\r\n  if (st == 0) {  /* no errors? */\r\n    return 1;  /* return the loaded function */\r\n  } else {  /* error; error message is on stack top */\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);\r\n    lua_pushstring(L, (st == PACKAGE_ERR_LIB) ?  PACKAGE_LIB_FAIL : \"init\");\r\n    return 3;  /* return nil, error message, and where */\r\n  }\r\n}\r\n\r\nstatic int lj_cf_package_unloadlib(lua_State *L)\r\n{\r\n  void **lib = (void **)luaL_checkudata(L, 1, \"_LOADLIB\");\r\n  if (*lib) ll_unloadlib(*lib);\r\n  *lib = NULL;  /* mark library as closed */\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic int readable(const char *filename)\r\n{\r\n  FILE *f = fopen(filename, \"r\");  /* try to open file */\r\n  if (f == NULL) return 0;  /* open failed */\r\n  fclose(f);\r\n  return 1;\r\n}\r\n\r\nstatic const char *pushnexttemplate(lua_State *L, const char *path)\r\n{\r\n  const char *l;\r\n  while (*path == *LUA_PATHSEP) path++;  /* skip separators */\r\n  if (*path == '\\0') return NULL;  /* no more templates */\r\n  l = strchr(path, *LUA_PATHSEP);  /* find next separator */\r\n  if (l == NULL) l = path + strlen(path);\r\n  lua_pushlstring(L, path, (size_t)(l - path));  /* template */\r\n  return l;\r\n}\r\n\r\nstatic const char *searchpath (lua_State *L, const char *name,\r\n\t\t\t       const char *path, const char *sep,\r\n\t\t\t       const char *dirsep)\r\n{\r\n  luaL_Buffer msg;  /* to build error message */\r\n  luaL_buffinit(L, &msg);\r\n  if (*sep != '\\0')  /* non-empty separator? */\r\n    name = luaL_gsub(L, name, sep, dirsep);  /* replace it by 'dirsep' */\r\n  while ((path = pushnexttemplate(L, path)) != NULL) {\r\n    const char *filename = luaL_gsub(L, lua_tostring(L, -1),\r\n\t\t\t\t     LUA_PATH_MARK, name);\r\n    lua_remove(L, -2);  /* remove path template */\r\n    if (readable(filename))  /* does file exist and is readable? */\r\n      return filename;  /* return that file name */\r\n    lua_pushfstring(L, \"\\n\\tno file \" LUA_QS, filename);\r\n    lua_remove(L, -2);  /* remove file name */\r\n    luaL_addvalue(&msg);  /* concatenate error msg. entry */\r\n  }\r\n  luaL_pushresult(&msg);  /* create error message */\r\n  return NULL;  /* not found */\r\n}\r\n\r\nstatic int lj_cf_package_searchpath(lua_State *L)\r\n{\r\n  const char *f = searchpath(L, luaL_checkstring(L, 1),\r\n\t\t\t\tluaL_checkstring(L, 2),\r\n\t\t\t\tluaL_optstring(L, 3, \".\"),\r\n\t\t\t\tluaL_optstring(L, 4, LUA_DIRSEP));\r\n  if (f != NULL) {\r\n    return 1;\r\n  } else {  /* error message is on top of the stack */\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);\r\n    return 2;  /* return nil + error message */\r\n  }\r\n}\r\n\r\nstatic const char *findfile(lua_State *L, const char *name,\r\n\t\t\t    const char *pname)\r\n{\r\n  const char *path;\r\n  lua_getfield(L, LUA_ENVIRONINDEX, pname);\r\n  path = lua_tostring(L, -1);\r\n  if (path == NULL)\r\n    luaL_error(L, LUA_QL(\"package.%s\") \" must be a string\", pname);\r\n  return searchpath(L, name, path, \".\", LUA_DIRSEP);\r\n}\r\n\r\nstatic void loaderror(lua_State *L, const char *filename)\r\n{\r\n  luaL_error(L, \"error loading module \" LUA_QS \" from file \" LUA_QS \":\\n\\t%s\",\r\n\t     lua_tostring(L, 1), filename, lua_tostring(L, -1));\r\n}\r\n\r\nstatic int lj_cf_package_loader_lua(lua_State *L)\r\n{\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  filename = findfile(L, name, \"path\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  if (luaL_loadfile(L, filename) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\nstatic int lj_cf_package_loader_c(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *filename = findfile(L, name, \"cpath\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  if (ll_loadfunc(L, filename, name, 0) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\nstatic int lj_cf_package_loader_croot(lua_State *L)\r\n{\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *p = strchr(name, '.');\r\n  int st;\r\n  if (p == NULL) return 0;  /* is root */\r\n  lua_pushlstring(L, name, (size_t)(p - name));\r\n  filename = findfile(L, lua_tostring(L, -1), \"cpath\");\r\n  if (filename == NULL) return 1;  /* root not found */\r\n  if ((st = ll_loadfunc(L, filename, name, 0)) != 0) {\r\n    if (st != PACKAGE_ERR_FUNC) loaderror(L, filename);  /* real error */\r\n    lua_pushfstring(L, \"\\n\\tno module \" LUA_QS \" in file \" LUA_QS,\r\n\t\t    name, filename);\r\n    return 1;  /* function not found */\r\n  }\r\n  return 1;\r\n}\r\n\r\nstatic int lj_cf_package_loader_preload(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"preload\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.preload\") \" must be a table\");\r\n  lua_getfield(L, -1, name);\r\n  if (lua_isnil(L, -1)) {  /* Not found? */\r\n    const char *bcname = mksymname(L, name, SYMPREFIX_BC);\r\n    const char *bcdata = ll_bcsym(NULL, bcname);\r\n    if (bcdata == NULL || luaL_loadbuffer(L, bcdata, ~(size_t)0, name) != 0)\r\n      lua_pushfstring(L, \"\\n\\tno field package.preload['%s']\", name);\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic const int sentinel_ = 0;\r\n#define sentinel\t((void *)&sentinel_)\r\n\r\nstatic int lj_cf_package_require(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  int i;\r\n  lua_settop(L, 1);  /* _LOADED table will be at index 2 */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, 2, name);\r\n  if (lua_toboolean(L, -1)) {  /* is it there? */\r\n    if (lua_touserdata(L, -1) == sentinel)  /* check loops */\r\n      luaL_error(L, \"loop or previous error loading module \" LUA_QS, name);\r\n    return 1;  /* package is already loaded */\r\n  }\r\n  /* else must load it; iterate over available loaders */\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"loaders\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.loaders\") \" must be a table\");\r\n  lua_pushliteral(L, \"\");  /* error message accumulator */\r\n  for (i = 1; ; i++) {\r\n    lua_rawgeti(L, -2, i);  /* get a loader */\r\n    if (lua_isnil(L, -1))\r\n      luaL_error(L, \"module \" LUA_QS \" not found:%s\",\r\n\t\t name, lua_tostring(L, -2));\r\n    lua_pushstring(L, name);\r\n    lua_call(L, 1, 1);  /* call it */\r\n    if (lua_isfunction(L, -1))  /* did it find module? */\r\n      break;  /* module loaded successfully */\r\n    else if (lua_isstring(L, -1))  /* loader returned error message? */\r\n      lua_concat(L, 2);  /* accumulate it */\r\n    else\r\n      lua_pop(L, 1);\r\n  }\r\n  lua_pushlightuserdata(L, sentinel);\r\n  lua_setfield(L, 2, name);  /* _LOADED[name] = sentinel */\r\n  lua_pushstring(L, name);  /* pass name as argument to module */\r\n  lua_call(L, 1, 1);  /* run loaded module */\r\n  if (!lua_isnil(L, -1))  /* non-nil return? */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = returned value */\r\n  lua_getfield(L, 2, name);\r\n  if (lua_touserdata(L, -1) == sentinel) {   /* module did not set a value? */\r\n    lua_pushboolean(L, 1);  /* use true as result */\r\n    lua_pushvalue(L, -1);  /* extra copy to be returned */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = true */\r\n  }\r\n  lj_lib_checkfpu(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void setfenv(lua_State *L)\r\n{\r\n  lua_Debug ar;\r\n  if (lua_getstack(L, 1, &ar) == 0 ||\r\n      lua_getinfo(L, \"f\", &ar) == 0 ||  /* get calling function */\r\n      lua_iscfunction(L, -1))\r\n    luaL_error(L, LUA_QL(\"module\") \" not called from a Lua function\");\r\n  lua_pushvalue(L, -2);\r\n  lua_setfenv(L, -2);\r\n  lua_pop(L, 1);\r\n}\r\n\r\nstatic void dooptions(lua_State *L, int n)\r\n{\r\n  int i;\r\n  for (i = 2; i <= n; i++) {\r\n    lua_pushvalue(L, i);  /* get option (a function) */\r\n    lua_pushvalue(L, -2);  /* module */\r\n    lua_call(L, 1, 0);\r\n  }\r\n}\r\n\r\nstatic void modinit(lua_State *L, const char *modname)\r\n{\r\n  const char *dot;\r\n  lua_pushvalue(L, -1);\r\n  lua_setfield(L, -2, \"_M\");  /* module._M = module */\r\n  lua_pushstring(L, modname);\r\n  lua_setfield(L, -2, \"_NAME\");\r\n  dot = strrchr(modname, '.');  /* look for last dot in module name */\r\n  if (dot == NULL) dot = modname; else dot++;\r\n  /* set _PACKAGE as package name (full module name minus last part) */\r\n  lua_pushlstring(L, modname, (size_t)(dot - modname));\r\n  lua_setfield(L, -2, \"_PACKAGE\");\r\n}\r\n\r\nstatic int lj_cf_package_module(lua_State *L)\r\n{\r\n  const char *modname = luaL_checkstring(L, 1);\r\n  int loaded = lua_gettop(L) + 1;  /* index of _LOADED table */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, loaded, modname);  /* get _LOADED[modname] */\r\n  if (!lua_istable(L, -1)) {  /* not found? */\r\n    lua_pop(L, 1);  /* remove previous result */\r\n    /* try global variable (and create one if it does not exist) */\r\n    if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)\r\n      lj_err_callerv(L, LJ_ERR_BADMODN, modname);\r\n    lua_pushvalue(L, -1);\r\n    lua_setfield(L, loaded, modname);  /* _LOADED[modname] = new table */\r\n  }\r\n  /* check whether table already has a _NAME field */\r\n  lua_getfield(L, -1, \"_NAME\");\r\n  if (!lua_isnil(L, -1)) {  /* is table an initialized module? */\r\n    lua_pop(L, 1);\r\n  } else {  /* no; initialize it */\r\n    lua_pop(L, 1);\r\n    modinit(L, modname);\r\n  }\r\n  lua_pushvalue(L, -1);\r\n  setfenv(L);\r\n  dooptions(L, loaded - 1);\r\n  return 0;\r\n}\r\n\r\nstatic int lj_cf_package_seeall(lua_State *L)\r\n{\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    lua_createtable(L, 0, 1); /* create new metatable */\r\n    lua_pushvalue(L, -1);\r\n    lua_setmetatable(L, 1);\r\n  }\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  lua_setfield(L, -2, \"__index\");  /* mt.__index = _G */\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define AUXMARK\t\t\"\\1\"\r\n\r\nstatic void setpath(lua_State *L, const char *fieldname, const char *envname,\r\n\t\t    const char *def, int noenv)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  const char *path = NULL;\r\n  UNUSED(envname);\r\n#else\r\n  const char *path = getenv(envname);\r\n#endif\r\n  if (path == NULL || noenv) {\r\n    lua_pushstring(L, def);\r\n  } else {\r\n    path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,\r\n\t\t\t      LUA_PATHSEP AUXMARK LUA_PATHSEP);\r\n    luaL_gsub(L, path, AUXMARK, def);\r\n    lua_remove(L, -2);\r\n  }\r\n  setprogdir(L);\r\n  lua_setfield(L, -2, fieldname);\r\n}\r\n\r\nstatic const luaL_Reg package_lib[] = {\r\n  { \"loadlib\",\tlj_cf_package_loadlib },\r\n  { \"searchpath\",  lj_cf_package_searchpath },\r\n  { \"seeall\",\tlj_cf_package_seeall },\r\n  { NULL, NULL }\r\n};\r\n\r\nstatic const luaL_Reg package_global[] = {\r\n  { \"module\",\tlj_cf_package_module },\r\n  { \"require\",\tlj_cf_package_require },\r\n  { NULL, NULL }\r\n};\r\n\r\nstatic const lua_CFunction package_loaders[] =\r\n{\r\n  lj_cf_package_loader_preload,\r\n  lj_cf_package_loader_lua,\r\n  lj_cf_package_loader_c,\r\n  lj_cf_package_loader_croot,\r\n  NULL\r\n};\r\n\r\nLUALIB_API int luaopen_package(lua_State *L)\r\n{\r\n  int i;\r\n  int noenv;\r\n  luaL_newmetatable(L, \"_LOADLIB\");\r\n  lj_lib_pushcf(L, lj_cf_package_unloadlib, 1);\r\n  lua_setfield(L, -2, \"__gc\");\r\n  luaL_register(L, LUA_LOADLIBNAME, package_lib);\r\n  lua_pushvalue(L, -1);\r\n  lua_replace(L, LUA_ENVIRONINDEX);\r\n  lua_createtable(L, sizeof(package_loaders)/sizeof(package_loaders[0])-1, 0);\r\n  for (i = 0; package_loaders[i] != NULL; i++) {\r\n    lj_lib_pushcf(L, package_loaders[i], 1);\r\n    lua_rawseti(L, -2, i+1);\r\n  }\r\n  lua_setfield(L, -2, \"loaders\");\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"LUA_NOENV\");\r\n  noenv = lua_toboolean(L, -1);\r\n  lua_pop(L, 1);\r\n  setpath(L, \"path\", LUA_PATH, LUA_PATH_DEFAULT, noenv);\r\n  setpath(L, \"cpath\", LUA_CPATH, LUA_CPATH_DEFAULT, noenv);\r\n  lua_pushliteral(L, LUA_PATH_CONFIG);\r\n  lua_setfield(L, -2, \"config\");\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n  lua_setfield(L, -2, \"loaded\");\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\", 4);\r\n  lua_setfield(L, -2, \"preload\");\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  luaL_register(L, NULL, package_global);\r\n  lua_pop(L, 1);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_string.c",
    "content": "/*\r\n** String library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lib_string_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_string\r\n\r\nLJLIB_ASM(string_len)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(string_byte)\t\tLJLIB_REC(string_range 0)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int32_t len = (int32_t)s->len;\r\n  int32_t start = lj_lib_optint(L, 2, 1);\r\n  int32_t stop = lj_lib_optint(L, 3, start);\r\n  int32_t n, i;\r\n  const unsigned char *p;\r\n  if (stop < 0) stop += len+1;\r\n  if (start < 0) start += len+1;\r\n  if (start <= 0) start = 1;\r\n  if (stop > len) stop = len;\r\n  if (start > stop) return FFH_RES(0);  /* Empty interval: return no results. */\r\n  start--;\r\n  n = stop - start;\r\n  if ((uint32_t)n > LUAI_MAXCSTACK)\r\n    lj_err_caller(L, LJ_ERR_STRSLC);\r\n  lj_state_checkstack(L, (MSize)n);\r\n  p = (const unsigned char *)strdata(s) + start;\r\n  for (i = 0; i < n; i++)\r\n    setintV(L->base + i-1, p[i]);\r\n  return FFH_RES(n);\r\n}\r\n\r\nLJLIB_ASM(string_char)\r\n{\r\n  int i, nargs = (int)(L->top - L->base);\r\n  char *buf = lj_str_needbuf(L, &G(L)->tmpbuf, (MSize)nargs);\r\n  for (i = 1; i <= nargs; i++) {\r\n    int32_t k = lj_lib_checkint(L, i);\r\n    if (!checku8(k))\r\n      lj_err_arg(L, i, LJ_ERR_BADVAL);\r\n    buf[i-1] = (char)k;\r\n  }\r\n  setstrV(L, L->base-1, lj_str_new(L, buf, (size_t)nargs));\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_ASM(string_sub)\t\tLJLIB_REC(string_range 1)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  lj_lib_checkint(L, 2);\r\n  setintV(L->base+2, lj_lib_optint(L, 3, -1));\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(string_rep)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int32_t k = lj_lib_checkint(L, 2);\r\n  GCstr *sep = lj_lib_optstr(L, 3);\r\n  int32_t len = (int32_t)s->len;\r\n  global_State *g = G(L);\r\n  int64_t tlen;\r\n  const char *src;\r\n  char *buf;\r\n  if (k <= 0) {\r\n  empty:\r\n    setstrV(L, L->base-1, &g->strempty);\r\n    return FFH_RES(1);\r\n  }\r\n  if (sep) {\r\n    tlen = (int64_t)len + sep->len;\r\n    if (tlen > LJ_MAX_STR)\r\n      lj_err_caller(L, LJ_ERR_STROV);\r\n    tlen *= k;\r\n    if (tlen > LJ_MAX_STR)\r\n      lj_err_caller(L, LJ_ERR_STROV);\r\n  } else {\r\n    tlen = (int64_t)k * len;\r\n    if (tlen > LJ_MAX_STR)\r\n      lj_err_caller(L, LJ_ERR_STROV);\r\n  }\r\n  if (tlen == 0) goto empty;\r\n  buf = lj_str_needbuf(L, &g->tmpbuf, (MSize)tlen);\r\n  src = strdata(s);\r\n  if (sep) {\r\n    tlen -= sep->len;  /* Ignore trailing separator. */\r\n    if (k > 1) {  /* Paste one string and one separator. */\r\n      int32_t i;\r\n      i = 0; while (i < len) *buf++ = src[i++];\r\n      src = strdata(sep); len = sep->len;\r\n      i = 0; while (i < len) *buf++ = src[i++];\r\n      src = g->tmpbuf.buf; len += s->len; k--;  /* Now copy that k-1 times. */\r\n    }\r\n  }\r\n  do {\r\n    int32_t i = 0;\r\n    do { *buf++ = src[i++]; } while (i < len);\r\n  } while (--k > 0);\r\n  setstrV(L, L->base-1, lj_str_new(L, g->tmpbuf.buf, (size_t)tlen));\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_ASM(string_reverse)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  lj_str_needbuf(L, &G(L)->tmpbuf, s->len);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(string_lower)\r\nLJLIB_ASM_(string_upper)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic int writer_buf(lua_State *L, const void *p, size_t size, void *b)\r\n{\r\n  luaL_addlstring((luaL_Buffer *)b, (const char *)p, size);\r\n  UNUSED(L);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(string_dump)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  int strip = L->base+1 < L->top && tvistruecond(L->base+1);\r\n  luaL_Buffer b;\r\n  L->top = L->base+1;\r\n  luaL_buffinit(L, &b);\r\n  if (!isluafunc(fn) || lj_bcwrite(L, funcproto(fn), writer_buf, &b, strip))\r\n    lj_err_caller(L, LJ_ERR_STRDUMP);\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* macro to `unsign' a character */\r\n#define uchar(c)        ((unsigned char)(c))\r\n\r\n#define CAP_UNFINISHED\t(-1)\r\n#define CAP_POSITION\t(-2)\r\n\r\ntypedef struct MatchState {\r\n  const char *src_init;  /* init of source string */\r\n  const char *src_end;  /* end (`\\0') of source string */\r\n  lua_State *L;\r\n  int level;  /* total number of captures (finished or unfinished) */\r\n  int depth;\r\n  struct {\r\n    const char *init;\r\n    ptrdiff_t len;\r\n  } capture[LUA_MAXCAPTURES];\r\n} MatchState;\r\n\r\n#define L_ESC\t\t'%'\r\n#define SPECIALS\t\"^$*+?.([%-\"\r\n\r\nstatic int check_capture(MatchState *ms, int l)\r\n{\r\n  l -= '1';\r\n  if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)\r\n    lj_err_caller(ms->L, LJ_ERR_STRCAPI);\r\n  return l;\r\n}\r\n\r\nstatic int capture_to_close(MatchState *ms)\r\n{\r\n  int level = ms->level;\r\n  for (level--; level>=0; level--)\r\n    if (ms->capture[level].len == CAP_UNFINISHED) return level;\r\n  lj_err_caller(ms->L, LJ_ERR_STRPATC);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nstatic const char *classend(MatchState *ms, const char *p)\r\n{\r\n  switch (*p++) {\r\n  case L_ESC:\r\n    if (*p == '\\0')\r\n      lj_err_caller(ms->L, LJ_ERR_STRPATE);\r\n    return p+1;\r\n  case '[':\r\n    if (*p == '^') p++;\r\n    do {  /* look for a `]' */\r\n      if (*p == '\\0')\r\n\tlj_err_caller(ms->L, LJ_ERR_STRPATM);\r\n      if (*(p++) == L_ESC && *p != '\\0')\r\n\tp++;  /* skip escapes (e.g. `%]') */\r\n    } while (*p != ']');\r\n    return p+1;\r\n  default:\r\n    return p;\r\n  }\r\n}\r\n\r\nstatic const unsigned char match_class_map[32] = {\r\n  0,LJ_CHAR_ALPHA,0,LJ_CHAR_CNTRL,LJ_CHAR_DIGIT,0,0,LJ_CHAR_GRAPH,0,0,0,0,\r\n  LJ_CHAR_LOWER,0,0,0,LJ_CHAR_PUNCT,0,0,LJ_CHAR_SPACE,0,\r\n  LJ_CHAR_UPPER,0,LJ_CHAR_ALNUM,LJ_CHAR_XDIGIT,0,0,0,0,0,0,0\r\n};\r\n\r\nstatic int match_class(int c, int cl)\r\n{\r\n  if ((cl & 0xc0) == 0x40) {\r\n    int t = match_class_map[(cl&0x1f)];\r\n    if (t) {\r\n      t = lj_char_isa(c, t);\r\n      return (cl & 0x20) ? t : !t;\r\n    }\r\n    if (cl == 'z') return c == 0;\r\n    if (cl == 'Z') return c != 0;\r\n  }\r\n  return (cl == c);\r\n}\r\n\r\nstatic int matchbracketclass(int c, const char *p, const char *ec)\r\n{\r\n  int sig = 1;\r\n  if (*(p+1) == '^') {\r\n    sig = 0;\r\n    p++;  /* skip the `^' */\r\n  }\r\n  while (++p < ec) {\r\n    if (*p == L_ESC) {\r\n      p++;\r\n      if (match_class(c, uchar(*p)))\r\n\treturn sig;\r\n    }\r\n    else if ((*(p+1) == '-') && (p+2 < ec)) {\r\n      p+=2;\r\n      if (uchar(*(p-2)) <= c && c <= uchar(*p))\r\n\treturn sig;\r\n    }\r\n    else if (uchar(*p) == c) return sig;\r\n  }\r\n  return !sig;\r\n}\r\n\r\nstatic int singlematch(int c, const char *p, const char *ep)\r\n{\r\n  switch (*p) {\r\n  case '.': return 1;  /* matches any char */\r\n  case L_ESC: return match_class(c, uchar(*(p+1)));\r\n  case '[': return matchbracketclass(c, p, ep-1);\r\n  default:  return (uchar(*p) == c);\r\n  }\r\n}\r\n\r\nstatic const char *match(MatchState *ms, const char *s, const char *p);\r\n\r\nstatic const char *matchbalance(MatchState *ms, const char *s, const char *p)\r\n{\r\n  if (*p == 0 || *(p+1) == 0)\r\n    lj_err_caller(ms->L, LJ_ERR_STRPATU);\r\n  if (*s != *p) {\r\n    return NULL;\r\n  } else {\r\n    int b = *p;\r\n    int e = *(p+1);\r\n    int cont = 1;\r\n    while (++s < ms->src_end) {\r\n      if (*s == e) {\r\n\tif (--cont == 0) return s+1;\r\n      } else if (*s == b) {\r\n\tcont++;\r\n      }\r\n    }\r\n  }\r\n  return NULL;  /* string ends out of balance */\r\n}\r\n\r\nstatic const char *max_expand(MatchState *ms, const char *s,\r\n\t\t\t      const char *p, const char *ep)\r\n{\r\n  ptrdiff_t i = 0;  /* counts maximum expand for item */\r\n  while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep))\r\n    i++;\r\n  /* keeps trying to match with the maximum repetitions */\r\n  while (i>=0) {\r\n    const char *res = match(ms, (s+i), ep+1);\r\n    if (res) return res;\r\n    i--;  /* else didn't match; reduce 1 repetition to try again */\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic const char *min_expand(MatchState *ms, const char *s,\r\n\t\t\t      const char *p, const char *ep)\r\n{\r\n  for (;;) {\r\n    const char *res = match(ms, s, ep+1);\r\n    if (res != NULL)\r\n      return res;\r\n    else if (s<ms->src_end && singlematch(uchar(*s), p, ep))\r\n      s++;  /* try with one more repetition */\r\n    else\r\n      return NULL;\r\n  }\r\n}\r\n\r\nstatic const char *start_capture(MatchState *ms, const char *s,\r\n\t\t\t\t const char *p, int what)\r\n{\r\n  const char *res;\r\n  int level = ms->level;\r\n  if (level >= LUA_MAXCAPTURES) lj_err_caller(ms->L, LJ_ERR_STRCAPN);\r\n  ms->capture[level].init = s;\r\n  ms->capture[level].len = what;\r\n  ms->level = level+1;\r\n  if ((res=match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->level--;  /* undo capture */\r\n  return res;\r\n}\r\n\r\nstatic const char *end_capture(MatchState *ms, const char *s,\r\n\t\t\t       const char *p)\r\n{\r\n  int l = capture_to_close(ms);\r\n  const char *res;\r\n  ms->capture[l].len = s - ms->capture[l].init;  /* close capture */\r\n  if ((res = match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->capture[l].len = CAP_UNFINISHED;  /* undo capture */\r\n  return res;\r\n}\r\n\r\nstatic const char *match_capture(MatchState *ms, const char *s, int l)\r\n{\r\n  size_t len;\r\n  l = check_capture(ms, l);\r\n  len = (size_t)ms->capture[l].len;\r\n  if ((size_t)(ms->src_end-s) >= len &&\r\n      memcmp(ms->capture[l].init, s, len) == 0)\r\n    return s+len;\r\n  else\r\n    return NULL;\r\n}\r\n\r\nstatic const char *match(MatchState *ms, const char *s, const char *p)\r\n{\r\n  if (++ms->depth > LJ_MAX_XLEVEL)\r\n    lj_err_caller(ms->L, LJ_ERR_STRPATX);\r\n  init: /* using goto's to optimize tail recursion */\r\n  switch (*p) {\r\n  case '(':  /* start capture */\r\n    if (*(p+1) == ')')  /* position capture? */\r\n      s = start_capture(ms, s, p+2, CAP_POSITION);\r\n    else\r\n      s = start_capture(ms, s, p+1, CAP_UNFINISHED);\r\n    break;\r\n  case ')':  /* end capture */\r\n    s = end_capture(ms, s, p+1);\r\n    break;\r\n  case L_ESC:\r\n    switch (*(p+1)) {\r\n    case 'b':  /* balanced string? */\r\n      s = matchbalance(ms, s, p+2);\r\n      if (s == NULL) break;\r\n      p+=4;\r\n      goto init;  /* else s = match(ms, s, p+4); */\r\n    case 'f': {  /* frontier? */\r\n      const char *ep; char previous;\r\n      p += 2;\r\n      if (*p != '[')\r\n\tlj_err_caller(ms->L, LJ_ERR_STRPATB);\r\n      ep = classend(ms, p);  /* points to what is next */\r\n      previous = (s == ms->src_init) ? '\\0' : *(s-1);\r\n      if (matchbracketclass(uchar(previous), p, ep-1) ||\r\n\t !matchbracketclass(uchar(*s), p, ep-1)) { s = NULL; break; }\r\n      p=ep;\r\n      goto init;  /* else s = match(ms, s, ep); */\r\n      }\r\n    default:\r\n      if (lj_char_isdigit(uchar(*(p+1)))) {  /* capture results (%0-%9)? */\r\n\ts = match_capture(ms, s, uchar(*(p+1)));\r\n\tif (s == NULL) break;\r\n\tp+=2;\r\n\tgoto init;  /* else s = match(ms, s, p+2) */\r\n      }\r\n      goto dflt;  /* case default */\r\n    }\r\n    break;\r\n  case '\\0':  /* end of pattern */\r\n    break;  /* match succeeded */\r\n  case '$':\r\n    /* is the `$' the last char in pattern? */\r\n    if (*(p+1) != '\\0') goto dflt;\r\n    if (s != ms->src_end) s = NULL;  /* check end of string */\r\n    break;\r\n  default: dflt: {  /* it is a pattern item */\r\n    const char *ep = classend(ms, p);  /* points to what is next */\r\n    int m = s<ms->src_end && singlematch(uchar(*s), p, ep);\r\n    switch (*ep) {\r\n    case '?': {  /* optional */\r\n      const char *res;\r\n      if (m && ((res=match(ms, s+1, ep+1)) != NULL)) {\r\n\ts = res;\r\n\tbreak;\r\n      }\r\n      p=ep+1;\r\n      goto init;  /* else s = match(ms, s, ep+1); */\r\n      }\r\n    case '*':  /* 0 or more repetitions */\r\n      s = max_expand(ms, s, p, ep);\r\n      break;\r\n    case '+':  /* 1 or more repetitions */\r\n      s = (m ? max_expand(ms, s+1, p, ep) : NULL);\r\n      break;\r\n    case '-':  /* 0 or more repetitions (minimum) */\r\n      s = min_expand(ms, s, p, ep);\r\n      break;\r\n    default:\r\n      if (m) { s++; p=ep; goto init; }  /* else s = match(ms, s+1, ep); */\r\n      s = NULL;\r\n      break;\r\n    }\r\n    break;\r\n    }\r\n  }\r\n  ms->depth--;\r\n  return s;\r\n}\r\n\r\nstatic const char *lmemfind(const char *s1, size_t l1,\r\n\t\t\t    const char *s2, size_t l2)\r\n{\r\n  if (l2 == 0) {\r\n    return s1;  /* empty strings are everywhere */\r\n  } else if (l2 > l1) {\r\n    return NULL;  /* avoids a negative `l1' */\r\n  } else {\r\n    const char *init;  /* to search for a `*s2' inside `s1' */\r\n    l2--;  /* 1st char will be checked by `memchr' */\r\n    l1 = l1-l2;  /* `s2' cannot be found after that */\r\n    while (l1 > 0 && (init = (const char *)memchr(s1, *s2, l1)) != NULL) {\r\n      init++;   /* 1st char is already checked */\r\n      if (memcmp(init, s2+1, l2) == 0) {\r\n\treturn init-1;\r\n      } else {  /* correct `l1' and `s1' to try again */\r\n\tl1 -= (size_t)(init-s1);\r\n\ts1 = init;\r\n      }\r\n    }\r\n    return NULL;  /* not found */\r\n  }\r\n}\r\n\r\nstatic void push_onecapture(MatchState *ms, int i, const char *s, const char *e)\r\n{\r\n  if (i >= ms->level) {\r\n    if (i == 0)  /* ms->level == 0, too */\r\n      lua_pushlstring(ms->L, s, (size_t)(e - s));  /* add whole match */\r\n    else\r\n      lj_err_caller(ms->L, LJ_ERR_STRCAPI);\r\n  } else {\r\n    ptrdiff_t l = ms->capture[i].len;\r\n    if (l == CAP_UNFINISHED) lj_err_caller(ms->L, LJ_ERR_STRCAPU);\r\n    if (l == CAP_POSITION)\r\n      lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1);\r\n    else\r\n      lua_pushlstring(ms->L, ms->capture[i].init, (size_t)l);\r\n  }\r\n}\r\n\r\nstatic int push_captures(MatchState *ms, const char *s, const char *e)\r\n{\r\n  int i;\r\n  int nlevels = (ms->level == 0 && s) ? 1 : ms->level;\r\n  luaL_checkstack(ms->L, nlevels, \"too many captures\");\r\n  for (i = 0; i < nlevels; i++)\r\n    push_onecapture(ms, i, s, e);\r\n  return nlevels;  /* number of strings pushed */\r\n}\r\n\r\nstatic ptrdiff_t posrelat(ptrdiff_t pos, size_t len)\r\n{\r\n  /* relative string position: negative means back from end */\r\n  if (pos < 0) pos += (ptrdiff_t)len + 1;\r\n  return (pos >= 0) ? pos : 0;\r\n}\r\n\r\nstatic int str_find_aux(lua_State *L, int find)\r\n{\r\n  size_t l1, l2;\r\n  const char *s = luaL_checklstring(L, 1, &l1);\r\n  const char *p = luaL_checklstring(L, 2, &l2);\r\n  ptrdiff_t init = posrelat(luaL_optinteger(L, 3, 1), l1) - 1;\r\n  if (init < 0) {\r\n    init = 0;\r\n  } else if ((size_t)(init) > l1) {\r\n#if LJ_52\r\n    setnilV(L->top-1);\r\n    return 1;\r\n#else\r\n    init = (ptrdiff_t)l1;\r\n#endif\r\n  }\r\n  if (find && (lua_toboolean(L, 4) ||  /* explicit request? */\r\n      strpbrk(p, SPECIALS) == NULL)) {  /* or no special characters? */\r\n    /* do a plain search */\r\n    const char *s2 = lmemfind(s+init, l1-(size_t)init, p, l2);\r\n    if (s2) {\r\n      lua_pushinteger(L, s2-s+1);\r\n      lua_pushinteger(L, s2-s+(ptrdiff_t)l2);\r\n      return 2;\r\n    }\r\n  } else {\r\n    MatchState ms;\r\n    int anchor = (*p == '^') ? (p++, 1) : 0;\r\n    const char *s1=s+init;\r\n    ms.L = L;\r\n    ms.src_init = s;\r\n    ms.src_end = s+l1;\r\n    do {\r\n      const char *res;\r\n      ms.level = ms.depth = 0;\r\n      if ((res=match(&ms, s1, p)) != NULL) {\r\n\tif (find) {\r\n\t  lua_pushinteger(L, s1-s+1);  /* start */\r\n\t  lua_pushinteger(L, res-s);   /* end */\r\n\t  return push_captures(&ms, NULL, 0) + 2;\r\n\t} else {\r\n\t  return push_captures(&ms, s1, res);\r\n\t}\r\n      }\r\n    } while (s1++ < ms.src_end && !anchor);\r\n  }\r\n  lua_pushnil(L);  /* not found */\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(string_find)\r\n{\r\n  return str_find_aux(L, 1);\r\n}\r\n\r\nLJLIB_CF(string_match)\r\n{\r\n  return str_find_aux(L, 0);\r\n}\r\n\r\nLJLIB_NOREG LJLIB_CF(string_gmatch_aux)\r\n{\r\n  const char *p = strVdata(lj_lib_upvalue(L, 2));\r\n  GCstr *str = strV(lj_lib_upvalue(L, 1));\r\n  const char *s = strdata(str);\r\n  TValue *tvpos = lj_lib_upvalue(L, 3);\r\n  const char *src = s + tvpos->u32.lo;\r\n  MatchState ms;\r\n  ms.L = L;\r\n  ms.src_init = s;\r\n  ms.src_end = s + str->len;\r\n  for (; src <= ms.src_end; src++) {\r\n    const char *e;\r\n    ms.level = ms.depth = 0;\r\n    if ((e = match(&ms, src, p)) != NULL) {\r\n      int32_t pos = (int32_t)(e - s);\r\n      if (e == src) pos++;  /* Ensure progress for empty match. */\r\n      tvpos->u32.lo = (uint32_t)pos;\r\n      return push_captures(&ms, src, e);\r\n    }\r\n  }\r\n  return 0;  /* not found */\r\n}\r\n\r\nLJLIB_CF(string_gmatch)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  lj_lib_checkstr(L, 2);\r\n  L->top = L->base+3;\r\n  (L->top-1)->u64 = 0;\r\n  lj_lib_pushcc(L, lj_cf_string_gmatch_aux, FF_string_gmatch_aux, 3);\r\n  return 1;\r\n}\r\n\r\nstatic void add_s(MatchState *ms, luaL_Buffer *b, const char *s, const char *e)\r\n{\r\n  size_t l, i;\r\n  const char *news = lua_tolstring(ms->L, 3, &l);\r\n  for (i = 0; i < l; i++) {\r\n    if (news[i] != L_ESC) {\r\n      luaL_addchar(b, news[i]);\r\n    } else {\r\n      i++;  /* skip ESC */\r\n      if (!lj_char_isdigit(uchar(news[i]))) {\r\n\tluaL_addchar(b, news[i]);\r\n      } else if (news[i] == '0') {\r\n\tluaL_addlstring(b, s, (size_t)(e - s));\r\n      } else {\r\n\tpush_onecapture(ms, news[i] - '1', s, e);\r\n\tluaL_addvalue(b);  /* add capture to accumulated result */\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void add_value(MatchState *ms, luaL_Buffer *b,\r\n\t\t      const char *s, const char *e)\r\n{\r\n  lua_State *L = ms->L;\r\n  switch (lua_type(L, 3)) {\r\n    case LUA_TNUMBER:\r\n    case LUA_TSTRING: {\r\n      add_s(ms, b, s, e);\r\n      return;\r\n    }\r\n    case LUA_TFUNCTION: {\r\n      int n;\r\n      lua_pushvalue(L, 3);\r\n      n = push_captures(ms, s, e);\r\n      lua_call(L, n, 1);\r\n      break;\r\n    }\r\n    case LUA_TTABLE: {\r\n      push_onecapture(ms, 0, s, e);\r\n      lua_gettable(L, 3);\r\n      break;\r\n    }\r\n  }\r\n  if (!lua_toboolean(L, -1)) {  /* nil or false? */\r\n    lua_pop(L, 1);\r\n    lua_pushlstring(L, s, (size_t)(e - s));  /* keep original text */\r\n  } else if (!lua_isstring(L, -1)) {\r\n    lj_err_callerv(L, LJ_ERR_STRGSRV, luaL_typename(L, -1));\r\n  }\r\n  luaL_addvalue(b);  /* add result to accumulator */\r\n}\r\n\r\nLJLIB_CF(string_gsub)\r\n{\r\n  size_t srcl;\r\n  const char *src = luaL_checklstring(L, 1, &srcl);\r\n  const char *p = luaL_checkstring(L, 2);\r\n  int  tr = lua_type(L, 3);\r\n  int max_s = luaL_optint(L, 4, (int)(srcl+1));\r\n  int anchor = (*p == '^') ? (p++, 1) : 0;\r\n  int n = 0;\r\n  MatchState ms;\r\n  luaL_Buffer b;\r\n  if (!(tr == LUA_TNUMBER || tr == LUA_TSTRING ||\r\n\ttr == LUA_TFUNCTION || tr == LUA_TTABLE))\r\n    lj_err_arg(L, 3, LJ_ERR_NOSFT);\r\n  luaL_buffinit(L, &b);\r\n  ms.L = L;\r\n  ms.src_init = src;\r\n  ms.src_end = src+srcl;\r\n  while (n < max_s) {\r\n    const char *e;\r\n    ms.level = ms.depth = 0;\r\n    e = match(&ms, src, p);\r\n    if (e) {\r\n      n++;\r\n      add_value(&ms, &b, src, e);\r\n    }\r\n    if (e && e>src) /* non empty match? */\r\n      src = e;  /* skip it */\r\n    else if (src < ms.src_end)\r\n      luaL_addchar(&b, *src++);\r\n    else\r\n      break;\r\n    if (anchor)\r\n      break;\r\n  }\r\n  luaL_addlstring(&b, src, (size_t)(ms.src_end-src));\r\n  luaL_pushresult(&b);\r\n  lua_pushinteger(L, n);  /* number of substitutions */\r\n  return 2;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* maximum size of each formatted item (> len(format('%99.99f', -1e308))) */\r\n#define MAX_FMTITEM\t512\r\n/* valid flags in a format specification */\r\n#define FMT_FLAGS\t\"-+ #0\"\r\n/*\r\n** maximum size of each format specification (such as '%-099.99d')\r\n** (+10 accounts for %99.99x plus margin of error)\r\n*/\r\n#define MAX_FMTSPEC\t(sizeof(FMT_FLAGS) + sizeof(LUA_INTFRMLEN) + 10)\r\n\r\nstatic void addquoted(lua_State *L, luaL_Buffer *b, int arg)\r\n{\r\n  GCstr *str = lj_lib_checkstr(L, arg);\r\n  int32_t len = (int32_t)str->len;\r\n  const char *s = strdata(str);\r\n  luaL_addchar(b, '\"');\r\n  while (len--) {\r\n    uint32_t c = uchar(*s);\r\n    if (c == '\"' || c == '\\\\' || c == '\\n') {\r\n      luaL_addchar(b, '\\\\');\r\n    } else if (lj_char_iscntrl(c)) {  /* This can only be 0-31 or 127. */\r\n      uint32_t d;\r\n      luaL_addchar(b, '\\\\');\r\n      if (c >= 100 || lj_char_isdigit(uchar(s[1]))) {\r\n\tluaL_addchar(b, '0'+(c >= 100)); if (c >= 100) c -= 100;\r\n\tgoto tens;\r\n      } else if (c >= 10) {\r\n      tens:\r\n\td = (c * 205) >> 11; c -= d * 10; luaL_addchar(b, '0'+d);\r\n      }\r\n      c += '0';\r\n    }\r\n    luaL_addchar(b, c);\r\n    s++;\r\n  }\r\n  luaL_addchar(b, '\"');\r\n}\r\n\r\nstatic const char *scanformat(lua_State *L, const char *strfrmt, char *form)\r\n{\r\n  const char *p = strfrmt;\r\n  while (*p != '\\0' && strchr(FMT_FLAGS, *p) != NULL) p++;  /* skip flags */\r\n  if ((size_t)(p - strfrmt) >= sizeof(FMT_FLAGS))\r\n    lj_err_caller(L, LJ_ERR_STRFMTR);\r\n  if (lj_char_isdigit(uchar(*p))) p++;  /* skip width */\r\n  if (lj_char_isdigit(uchar(*p))) p++;  /* (2 digits at most) */\r\n  if (*p == '.') {\r\n    p++;\r\n    if (lj_char_isdigit(uchar(*p))) p++;  /* skip precision */\r\n    if (lj_char_isdigit(uchar(*p))) p++;  /* (2 digits at most) */\r\n  }\r\n  if (lj_char_isdigit(uchar(*p)))\r\n    lj_err_caller(L, LJ_ERR_STRFMTW);\r\n  *(form++) = '%';\r\n  strncpy(form, strfrmt, (size_t)(p - strfrmt + 1));\r\n  form += p - strfrmt + 1;\r\n  *form = '\\0';\r\n  return p;\r\n}\r\n\r\nstatic void addintlen(char *form)\r\n{\r\n  size_t l = strlen(form);\r\n  char spec = form[l - 1];\r\n  strcpy(form + l - 1, LUA_INTFRMLEN);\r\n  form[l + sizeof(LUA_INTFRMLEN) - 2] = spec;\r\n  form[l + sizeof(LUA_INTFRMLEN) - 1] = '\\0';\r\n}\r\n\r\nstatic unsigned LUA_INTFRM_T num2intfrm(lua_State *L, int arg)\r\n{\r\n  if (sizeof(LUA_INTFRM_T) == 4) {\r\n    return (LUA_INTFRM_T)lj_lib_checkbit(L, arg);\r\n  } else {\r\n    cTValue *o;\r\n    lj_lib_checknumber(L, arg);\r\n    o = L->base+arg-1;\r\n    if (tvisint(o))\r\n      return (LUA_INTFRM_T)intV(o);\r\n    else\r\n      return (LUA_INTFRM_T)numV(o);\r\n  }\r\n}\r\n\r\nstatic unsigned LUA_INTFRM_T num2uintfrm(lua_State *L, int arg)\r\n{\r\n  if (sizeof(LUA_INTFRM_T) == 4) {\r\n    return (unsigned LUA_INTFRM_T)lj_lib_checkbit(L, arg);\r\n  } else {\r\n    cTValue *o;\r\n    lj_lib_checknumber(L, arg);\r\n    o = L->base+arg-1;\r\n    if (tvisint(o))\r\n      return (unsigned LUA_INTFRM_T)intV(o);\r\n    else if ((int32_t)o->u32.hi < 0)\r\n      return (unsigned LUA_INTFRM_T)(LUA_INTFRM_T)numV(o);\r\n    else\r\n      return (unsigned LUA_INTFRM_T)numV(o);\r\n  }\r\n}\r\n\r\nstatic GCstr *meta_tostring(lua_State *L, int arg)\r\n{\r\n  TValue *o = L->base+arg-1;\r\n  cTValue *mo;\r\n  lua_assert(o < L->top);  /* Caller already checks for existence. */\r\n  if (LJ_LIKELY(tvisstr(o)))\r\n    return strV(o);\r\n  if (!tvisnil(mo = lj_meta_lookup(L, o, MM_tostring))) {\r\n    copyTV(L, L->top++, mo);\r\n    copyTV(L, L->top++, o);\r\n    lua_call(L, 1, 1);\r\n    L->top--;\r\n    if (tvisstr(L->top))\r\n      return strV(L->top);\r\n    o = L->base+arg-1;\r\n    copyTV(L, o, L->top);\r\n  }\r\n  if (tvisnumber(o)) {\r\n    return lj_str_fromnumber(L, o);\r\n  } else if (tvisnil(o)) {\r\n    return lj_str_newlit(L, \"nil\");\r\n  } else if (tvisfalse(o)) {\r\n    return lj_str_newlit(L, \"false\");\r\n  } else if (tvistrue(o)) {\r\n    return lj_str_newlit(L, \"true\");\r\n  } else {\r\n    if (tvisfunc(o) && isffunc(funcV(o)))\r\n      lj_str_pushf(L, \"function: builtin#%d\", funcV(o)->c.ffid);\r\n    else\r\n      lj_str_pushf(L, \"%s: %p\", lj_typename(o), lua_topointer(L, arg));\r\n    L->top--;\r\n    return strV(L->top);\r\n  }\r\n}\r\n\r\nLJLIB_CF(string_format)\r\n{\r\n  int arg = 1, top = (int)(L->top - L->base);\r\n  GCstr *fmt = lj_lib_checkstr(L, arg);\r\n  const char *strfrmt = strdata(fmt);\r\n  const char *strfrmt_end = strfrmt + fmt->len;\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  while (strfrmt < strfrmt_end) {\r\n    if (*strfrmt != L_ESC) {\r\n      luaL_addchar(&b, *strfrmt++);\r\n    } else if (*++strfrmt == L_ESC) {\r\n      luaL_addchar(&b, *strfrmt++);  /* %% */\r\n    } else { /* format item */\r\n      char form[MAX_FMTSPEC];  /* to store the format (`%...') */\r\n      char buff[MAX_FMTITEM];  /* to store the formatted item */\r\n      if (++arg > top)\r\n\tluaL_argerror(L, arg, lj_obj_typename[0]);\r\n      strfrmt = scanformat(L, strfrmt, form);\r\n      switch (*strfrmt++) {\r\n      case 'c':\r\n\tsprintf(buff, form, lj_lib_checkint(L, arg));\r\n\tbreak;\r\n      case 'd':  case 'i':\r\n\taddintlen(form);\r\n\tsprintf(buff, form, num2intfrm(L, arg));\r\n\tbreak;\r\n      case 'o':  case 'u':  case 'x':  case 'X':\r\n\taddintlen(form);\r\n\tsprintf(buff, form, num2uintfrm(L, arg));\r\n\tbreak;\r\n      case 'e':  case 'E': case 'f': case 'g': case 'G': case 'a': case 'A': {\r\n\tTValue tv;\r\n\ttv.n = lj_lib_checknum(L, arg);\r\n\tif (LJ_UNLIKELY((tv.u32.hi << 1) >= 0xffe00000)) {\r\n\t  /* Canonicalize output of non-finite values. */\r\n\t  char *p, nbuf[LJ_STR_NUMBUF];\r\n\t  size_t len = lj_str_bufnum(nbuf, &tv);\r\n\t  if (strfrmt[-1] < 'a') {\r\n\t    nbuf[len-3] = nbuf[len-3] - 0x20;\r\n\t    nbuf[len-2] = nbuf[len-2] - 0x20;\r\n\t    nbuf[len-1] = nbuf[len-1] - 0x20;\r\n\t  }\r\n\t  nbuf[len] = '\\0';\r\n\t  for (p = form; *p < 'A' && *p != '.'; p++) ;\r\n\t  *p++ = 's'; *p = '\\0';\r\n\t  sprintf(buff, form, nbuf);\r\n\t  break;\r\n\t}\r\n\tsprintf(buff, form, (double)tv.n);\r\n\tbreak;\r\n\t}\r\n      case 'q':\r\n\taddquoted(L, &b, arg);\r\n\tcontinue;\r\n      case 'p':\r\n\tlj_str_pushf(L, \"%p\", lua_topointer(L, arg));\r\n\tluaL_addvalue(&b);\r\n\tcontinue;\r\n      case 's': {\r\n\tGCstr *str = meta_tostring(L, arg);\r\n\tif (!strchr(form, '.') && str->len >= 100) {\r\n\t  /* no precision and string is too long to be formatted;\r\n\t     keep original string */\r\n\t  setstrV(L, L->top++, str);\r\n\t  luaL_addvalue(&b);\r\n\t  continue;\r\n\t}\r\n\tsprintf(buff, form, strdata(str));\r\n\tbreak;\r\n\t}\r\n      default:\r\n\tlj_err_callerv(L, LJ_ERR_STRFMTO, *(strfrmt -1));\r\n\tbreak;\r\n      }\r\n      luaL_addlstring(&b, buff, strlen(buff));\r\n    }\r\n  }\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_string(lua_State *L)\r\n{\r\n  GCtab *mt;\r\n  global_State *g;\r\n  LJ_LIB_REG(L, LUA_STRLIBNAME, string);\r\n#if defined(LUA_COMPAT_GFIND) && !LJ_52\r\n  lua_getfield(L, -1, \"gmatch\");\r\n  lua_setfield(L, -2, \"gfind\");\r\n#endif\r\n  mt = lj_tab_new(L, 0, 1);\r\n  /* NOBARRIER: basemt is a GC root. */\r\n  g = G(L);\r\n  setgcref(basemt_it(g, LJ_TSTR), obj2gco(mt));\r\n  settabV(L, lj_tab_setstr(L, mt, mmname_str(g, MM_index)), tabV(L->top-1));\r\n  mt->nomm = (uint8_t)(~(1u<<MM_index));\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lib_table.c",
    "content": "/*\r\n** Table library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_table_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_table\r\n\r\nLJLIB_CF(table_foreachi)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCfunc *func = lj_lib_checkfunc(L, 2);\r\n  MSize i, n = lj_tab_len(t);\r\n  for (i = 1; i <= n; i++) {\r\n    cTValue *val;\r\n    setfuncV(L, L->top, func);\r\n    setintV(L->top+1, i);\r\n    val = lj_tab_getint(t, (int32_t)i);\r\n    if (val) { copyTV(L, L->top+2, val); } else { setnilV(L->top+2); }\r\n    L->top += 3;\r\n    lua_call(L, 2, 1);\r\n    if (!tvisnil(L->top-1))\r\n      return 1;\r\n    L->top--;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(table_foreach)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCfunc *func = lj_lib_checkfunc(L, 2);\r\n  L->top = L->base+3;\r\n  setnilV(L->top-1);\r\n  while (lj_tab_next(L, t, L->top-1)) {\r\n    copyTV(L, L->top+2, L->top);\r\n    copyTV(L, L->top+1, L->top-1);\r\n    setfuncV(L, L->top, func);\r\n    L->top += 3;\r\n    lua_call(L, 2, 1);\r\n    if (!tvisnil(L->top-1))\r\n      return 1;\r\n    L->top--;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_ASM(table_getn)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nLJLIB_CF(table_maxn)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  TValue *array = tvref(t->array);\r\n  Node *node;\r\n  lua_Number m = 0;\r\n  ptrdiff_t i;\r\n  for (i = (ptrdiff_t)t->asize - 1; i >= 0; i--)\r\n    if (!tvisnil(&array[i])) {\r\n      m = (lua_Number)(int32_t)i;\r\n      break;\r\n    }\r\n  node = noderef(t->node);\r\n  for (i = (ptrdiff_t)t->hmask; i >= 0; i--)\r\n    if (!tvisnil(&node[i].val) && tvisnumber(&node[i].key)) {\r\n      lua_Number n = numberVnum(&node[i].key);\r\n      if (n > m) m = n;\r\n    }\r\n  setnumV(L->top-1, m);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(table_insert)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n, i = (int32_t)lj_tab_len(t) + 1;\r\n  int nargs = (int)((char *)L->top - (char *)L->base);\r\n  if (nargs != 2*sizeof(TValue)) {\r\n    if (nargs != 3*sizeof(TValue))\r\n      lj_err_caller(L, LJ_ERR_TABINS);\r\n    /* NOBARRIER: This just moves existing elements around. */\r\n    for (n = lj_lib_checkint(L, 2); i > n; i--) {\r\n      /* The set may invalidate the get pointer, so need to do it first! */\r\n      TValue *dst = lj_tab_setint(L, t, i);\r\n      cTValue *src = lj_tab_getint(t, i-1);\r\n      if (src) {\r\n\tcopyTV(L, dst, src);\r\n      } else {\r\n\tsetnilV(dst);\r\n      }\r\n    }\r\n    i = n;\r\n  }\r\n  {\r\n    TValue *dst = lj_tab_setint(L, t, i);\r\n    copyTV(L, dst, L->top-1);  /* Set new value. */\r\n    lj_gc_barriert(L, t, dst);\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(table_remove)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t e = (int32_t)lj_tab_len(t);\r\n  int32_t pos = lj_lib_optint(L, 2, e);\r\n  if (!(1 <= pos && pos <= e))  /* Nothing to remove? */\r\n    return 0;\r\n  lua_rawgeti(L, 1, pos);  /* Get previous value. */\r\n  /* NOBARRIER: This just moves existing elements around. */\r\n  for (; pos < e; pos++) {\r\n    cTValue *src = lj_tab_getint(t, pos+1);\r\n    TValue *dst = lj_tab_setint(L, t, pos);\r\n    if (src) {\r\n      copyTV(L, dst, src);\r\n    } else {\r\n      setnilV(dst);\r\n    }\r\n  }\r\n  setnilV(lj_tab_setint(L, t, e));  /* Remove (last) value. */\r\n  return 1;  /* Return previous value. */\r\n}\r\n\r\nLJLIB_CF(table_concat)\r\n{\r\n  luaL_Buffer b;\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCstr *sep = lj_lib_optstr(L, 2);\r\n  MSize seplen = sep ? sep->len : 0;\r\n  int32_t i = lj_lib_optint(L, 3, 1);\r\n  int32_t e = (L->base+3 < L->top && !tvisnil(L->base+3)) ?\r\n\t      lj_lib_checkint(L, 4) : (int32_t)lj_tab_len(t);\r\n  luaL_buffinit(L, &b);\r\n  if (i <= e) {\r\n    for (;;) {\r\n      cTValue *o;\r\n      lua_rawgeti(L, 1, i);\r\n      o = L->top-1;\r\n      if (!(tvisstr(o) || tvisnumber(o)))\r\n\tlj_err_callerv(L, LJ_ERR_TABCAT, lj_typename(o), i);\r\n      luaL_addvalue(&b);\r\n      if (i++ == e) break;\r\n      if (seplen)\r\n\tluaL_addlstring(&b, strdata(sep), seplen);\r\n    }\r\n  }\r\n  luaL_pushresult(&b);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void set2(lua_State *L, int i, int j)\r\n{\r\n  lua_rawseti(L, 1, i);\r\n  lua_rawseti(L, 1, j);\r\n}\r\n\r\nstatic int sort_comp(lua_State *L, int a, int b)\r\n{\r\n  if (!lua_isnil(L, 2)) {  /* function? */\r\n    int res;\r\n    lua_pushvalue(L, 2);\r\n    lua_pushvalue(L, a-1);  /* -1 to compensate function */\r\n    lua_pushvalue(L, b-2);  /* -2 to compensate function and `a' */\r\n    lua_call(L, 2, 1);\r\n    res = lua_toboolean(L, -1);\r\n    lua_pop(L, 1);\r\n    return res;\r\n  } else {  /* a < b? */\r\n    return lua_lessthan(L, a, b);\r\n  }\r\n}\r\n\r\nstatic void auxsort(lua_State *L, int l, int u)\r\n{\r\n  while (l < u) {  /* for tail recursion */\r\n    int i, j;\r\n    /* sort elements a[l], a[(l+u)/2] and a[u] */\r\n    lua_rawgeti(L, 1, l);\r\n    lua_rawgeti(L, 1, u);\r\n    if (sort_comp(L, -1, -2))  /* a[u] < a[l]? */\r\n      set2(L, l, u);  /* swap a[l] - a[u] */\r\n    else\r\n      lua_pop(L, 2);\r\n    if (u-l == 1) break;  /* only 2 elements */\r\n    i = (l+u)/2;\r\n    lua_rawgeti(L, 1, i);\r\n    lua_rawgeti(L, 1, l);\r\n    if (sort_comp(L, -2, -1)) {  /* a[i]<a[l]? */\r\n      set2(L, i, l);\r\n    } else {\r\n      lua_pop(L, 1);  /* remove a[l] */\r\n      lua_rawgeti(L, 1, u);\r\n      if (sort_comp(L, -1, -2))  /* a[u]<a[i]? */\r\n\tset2(L, i, u);\r\n      else\r\n\tlua_pop(L, 2);\r\n    }\r\n    if (u-l == 2) break;  /* only 3 elements */\r\n    lua_rawgeti(L, 1, i);  /* Pivot */\r\n    lua_pushvalue(L, -1);\r\n    lua_rawgeti(L, 1, u-1);\r\n    set2(L, i, u-1);\r\n    /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */\r\n    i = l; j = u-1;\r\n    for (;;) {  /* invariant: a[l..i] <= P <= a[j..u] */\r\n      /* repeat ++i until a[i] >= P */\r\n      while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {\r\n\tif (i>=u) lj_err_caller(L, LJ_ERR_TABSORT);\r\n\tlua_pop(L, 1);  /* remove a[i] */\r\n      }\r\n      /* repeat --j until a[j] <= P */\r\n      while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {\r\n\tif (j<=l) lj_err_caller(L, LJ_ERR_TABSORT);\r\n\tlua_pop(L, 1);  /* remove a[j] */\r\n      }\r\n      if (j<i) {\r\n\tlua_pop(L, 3);  /* pop pivot, a[i], a[j] */\r\n\tbreak;\r\n      }\r\n      set2(L, i, j);\r\n    }\r\n    lua_rawgeti(L, 1, u-1);\r\n    lua_rawgeti(L, 1, i);\r\n    set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */\r\n    /* a[l..i-1] <= a[i] == P <= a[i+1..u] */\r\n    /* adjust so that smaller half is in [j..i] and larger one in [l..u] */\r\n    if (i-l < u-i) {\r\n      j=l; i=i-1; l=i+2;\r\n    } else {\r\n      j=i+1; i=u; u=j-2;\r\n    }\r\n    auxsort(L, j, i);  /* call recursively the smaller one */\r\n  }  /* repeat the routine for the larger one */\r\n}\r\n\r\nLJLIB_CF(table_sort)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n = (int32_t)lj_tab_len(t);\r\n  lua_settop(L, 2);\r\n  if (!tvisnil(L->base+1))\r\n    lj_lib_checkfunc(L, 2);\r\n  auxsort(L, 1, n);\r\n  return 0;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_PUSH(\"n\")\r\nLJLIB_CF(table_pack)\r\n{\r\n  TValue *array, *base = L->base;\r\n  MSize i, n = (uint32_t)(L->top - base);\r\n  GCtab *t = lj_tab_new(L, n ? n+1 : 0, 1);\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  setintV(lj_tab_setstr(L, t, strV(lj_lib_upvalue(L, 1))), (int32_t)n);\r\n  for (array = tvref(t->array) + 1, i = 0; i < n; i++)\r\n    copyTV(L, &array[i], &base[i]);\r\n  settabV(L, base, t);\r\n  L->top = base+1;\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_table(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_TABLIBNAME, table);\r\n#if LJ_52\r\n  lua_getglobal(L, \"unpack\");\r\n  lua_setfield(L, -2, \"unpack\");\r\n#endif\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj.supp",
    "content": "# Valgrind suppression file for LuaJIT 2.0.\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr4\r\n   fun:lj_str_cmp\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr1\r\n   fun:lj_str_cmp\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr4\r\n   fun:lj_str_new\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr1\r\n   fun:lj_str_new\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Cond\r\n   fun:lj_str_new\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_alloc.c",
    "content": "/*\r\n** Bundled memory allocator.\r\n**\r\n** Beware: this is a HEAVILY CUSTOMIZED version of dlmalloc.\r\n** The original bears the following remark:\r\n**\r\n**   This is a version (aka dlmalloc) of malloc/free/realloc written by\r\n**   Doug Lea and released to the public domain, as explained at\r\n**   http://creativecommons.org/licenses/publicdomain.\r\n**\r\n**   * Version pre-2.8.4 Wed Mar 29 19:46:29 2006    (dl at gee)\r\n**\r\n** No additional copyright is claimed over the customizations.\r\n** Please do NOT bother the original author about this version here!\r\n**\r\n** If you want to use dlmalloc in another project, you should get\r\n** the original from: ftp://gee.cs.oswego.edu/pub/misc/\r\n** For thread-safe derivatives, take a look at:\r\n** - ptmalloc: http://www.malloc.de/\r\n** - nedmalloc: http://www.nedprod.com/programs/portable/nedmalloc/\r\n*/\r\n\r\n#define lj_alloc_c\r\n#define LUA_CORE\r\n\r\n/* To get the mremap prototype. Must be defined before any system includes. */\r\n#if defined(__linux__) && !defined(_GNU_SOURCE)\r\n#define _GNU_SOURCE\r\n#endif\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n#include \"lj_alloc.h\"\r\n\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\n\r\n#define MAX_SIZE_T\t\t(~(size_t)0)\r\n#define MALLOC_ALIGNMENT\t((size_t)8U)\r\n\r\n#define DEFAULT_GRANULARITY\t((size_t)128U * (size_t)1024U)\r\n#define DEFAULT_TRIM_THRESHOLD\t((size_t)2U * (size_t)1024U * (size_t)1024U)\r\n#define DEFAULT_MMAP_THRESHOLD\t((size_t)128U * (size_t)1024U)\r\n#define MAX_RELEASE_CHECK_RATE\t255\r\n\r\n/* ------------------- size_t and alignment properties -------------------- */\r\n\r\n/* The byte and bit size of a size_t */\r\n#define SIZE_T_SIZE\t\t(sizeof(size_t))\r\n#define SIZE_T_BITSIZE\t\t(sizeof(size_t) << 3)\r\n\r\n/* Some constants coerced to size_t */\r\n/* Annoying but necessary to avoid errors on some platforms */\r\n#define SIZE_T_ZERO\t\t((size_t)0)\r\n#define SIZE_T_ONE\t\t((size_t)1)\r\n#define SIZE_T_TWO\t\t((size_t)2)\r\n#define TWO_SIZE_T_SIZES\t(SIZE_T_SIZE<<1)\r\n#define FOUR_SIZE_T_SIZES\t(SIZE_T_SIZE<<2)\r\n#define SIX_SIZE_T_SIZES\t(FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES)\r\n\r\n/* The bit mask value corresponding to MALLOC_ALIGNMENT */\r\n#define CHUNK_ALIGN_MASK\t(MALLOC_ALIGNMENT - SIZE_T_ONE)\r\n\r\n/* the number of bytes to offset an address to align it */\r\n#define align_offset(A)\\\r\n ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\\\r\n  ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK))\r\n\r\n/* -------------------------- MMAP support ------------------------------- */\r\n\r\n#define MFAIL\t\t\t((void *)(MAX_SIZE_T))\r\n#define CMFAIL\t\t\t((char *)(MFAIL)) /* defined for convenience */\r\n\r\n#define IS_DIRECT_BIT\t\t(SIZE_T_ONE)\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#if LJ_64\r\n\r\n/* Undocumented, but hey, that's what we all love so much about Windows. */\r\ntypedef long (*PNTAVM)(HANDLE handle, void **addr, ULONG zbits,\r\n\t\t       size_t *size, ULONG alloctype, ULONG prot);\r\nstatic PNTAVM ntavm;\r\n\r\n/* Number of top bits of the lower 32 bits of an address that must be zero.\r\n** Apparently 0 gives us full 64 bit addresses and 1 gives us the lower 2GB.\r\n*/\r\n#define NTAVM_ZEROBITS\t\t1\r\n\r\nstatic void INIT_MMAP(void)\r\n{\r\n  ntavm = (PNTAVM)GetProcAddress(GetModuleHandleA(\"ntdll.dll\"),\r\n\t\t\t\t \"NtAllocateVirtualMemory\");\r\n}\r\n\r\n/* Win64 32 bit MMAP via NtAllocateVirtualMemory. */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = NULL;\r\n  long st = ntavm(INVALID_HANDLE_VALUE, &ptr, NTAVM_ZEROBITS, &size,\r\n\t\t  MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return st == 0 ? ptr : MFAIL;\r\n}\r\n\r\n/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */\r\nstatic LJ_AINLINE void *DIRECT_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = NULL;\r\n  long st = ntavm(INVALID_HANDLE_VALUE, &ptr, NTAVM_ZEROBITS, &size,\r\n\t\t  MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return st == 0 ? ptr : MFAIL;\r\n}\r\n\r\n#else\r\n\r\n#define INIT_MMAP()\t\t((void)0)\r\n\r\n/* Win32 MMAP via VirtualAlloc */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return ptr ? ptr : MFAIL;\r\n}\r\n\r\n/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */\r\nstatic LJ_AINLINE void *DIRECT_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN,\r\n\t\t\t   PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return ptr ? ptr : MFAIL;\r\n}\r\n\r\n#endif\r\n\r\n/* This function supports releasing coalesed segments */\r\nstatic LJ_AINLINE int CALL_MUNMAP(void *ptr, size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  MEMORY_BASIC_INFORMATION minfo;\r\n  char *cptr = (char *)ptr;\r\n  while (size) {\r\n    if (VirtualQuery(cptr, &minfo, sizeof(minfo)) == 0)\r\n      return -1;\r\n    if (minfo.BaseAddress != cptr || minfo.AllocationBase != cptr ||\r\n\tminfo.State != MEM_COMMIT || minfo.RegionSize > size)\r\n      return -1;\r\n    if (VirtualFree(cptr, 0, MEM_RELEASE) == 0)\r\n      return -1;\r\n    cptr += minfo.RegionSize;\r\n    size -= minfo.RegionSize;\r\n  }\r\n  SetLastError(olderr);\r\n  return 0;\r\n}\r\n\r\n#else\r\n\r\n#include <errno.h>\r\n#include <sys/mman.h>\r\n\r\n#define MMAP_PROT\t\t(PROT_READ|PROT_WRITE)\r\n#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON)\r\n#define MAP_ANONYMOUS\t\tMAP_ANON\r\n#endif\r\n#define MMAP_FLAGS\t\t(MAP_PRIVATE|MAP_ANONYMOUS)\r\n\r\n#if LJ_64\r\n/* 64 bit mode needs special support for allocating memory in the lower 2GB. */\r\n\r\n#if defined(MAP_32BIT)\r\n\r\n#if defined(__sun__)\r\n#define MMAP_REGION_START\t((uintptr_t)0x1000)\r\n#else\r\n/* Actually this only gives us max. 1GB in current Linux kernels. */\r\n#define MMAP_REGION_START\t((uintptr_t)0)\r\n#endif\r\n\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  void *ptr = mmap((void *)MMAP_REGION_START, size, MMAP_PROT, MAP_32BIT|MMAP_FLAGS, -1, 0);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#elif LJ_TARGET_OSX || LJ_TARGET_PS4 || defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) || defined(__sun__)\r\n\r\n/* OSX and FreeBSD mmap() use a naive first-fit linear search.\r\n** That's perfect for us. Except that -pagezero_size must be set for OSX,\r\n** otherwise the lower 4GB are blocked. And the 32GB RLIMIT_DATA needs\r\n** to be reduced to 250MB on FreeBSD.\r\n*/\r\n#if LJ_TARGET_OSX || defined(__DragonFly__)\r\n#define MMAP_REGION_START\t((uintptr_t)0x10000)\r\n#elif LJ_TARGET_PS4\r\n#define MMAP_REGION_START\t((uintptr_t)0x4000)\r\n#else\r\n#define MMAP_REGION_START\t((uintptr_t)0x10000000)\r\n#endif\r\n#define MMAP_REGION_END\t\t((uintptr_t)0x80000000)\r\n\r\n#if (defined(__FreeBSD__) || defined(__FreeBSD_kernel__)) && !LJ_TARGET_PS4\r\n#include <sys/resource.h>\r\n#endif\r\n\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  /* Hint for next allocation. Doesn't need to be thread-safe. */\r\n  static uintptr_t alloc_hint = MMAP_REGION_START;\r\n  int retry = 0;\r\n#if (defined(__FreeBSD__) || defined(__FreeBSD_kernel__)) && !LJ_TARGET_PS4\r\n  static int rlimit_modified = 0;\r\n  if (LJ_UNLIKELY(rlimit_modified == 0)) {\r\n    struct rlimit rlim;\r\n    rlim.rlim_cur = rlim.rlim_max = MMAP_REGION_START;\r\n    setrlimit(RLIMIT_DATA, &rlim);  /* Ignore result. May fail below. */\r\n    rlimit_modified = 1;\r\n  }\r\n#endif\r\n  for (;;) {\r\n    void *p = mmap((void *)alloc_hint, size, MMAP_PROT, MMAP_FLAGS, -1, 0);\r\n    if ((uintptr_t)p >= MMAP_REGION_START &&\r\n\t(uintptr_t)p + size < MMAP_REGION_END) {\r\n      alloc_hint = (uintptr_t)p + size;\r\n      errno = olderr;\r\n      return p;\r\n    }\r\n    if (p != CMFAIL) munmap(p, size);\r\n#if defined(__sun__) || defined(__DragonFly__)\r\n    alloc_hint += 0x1000000;  /* Need near-exhaustive linear scan. */\r\n    if (alloc_hint + size < MMAP_REGION_END) continue;\r\n#endif\r\n    if (retry) break;\r\n    retry = 1;\r\n    alloc_hint = MMAP_REGION_START;\r\n  }\r\n  errno = olderr;\r\n  return CMFAIL;\r\n}\r\n\r\n#else\r\n\r\n#error \"NYI: need an equivalent of MAP_32BIT for this 64 bit OS\"\r\n\r\n#endif\r\n\r\n#else\r\n\r\n/* 32 bit mode is easy. */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  void *ptr = mmap(NULL, size, MMAP_PROT, MMAP_FLAGS, -1, 0);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#endif\r\n\r\n#define INIT_MMAP()\t\t((void)0)\r\n#define DIRECT_MMAP(s)\t\tCALL_MMAP(s)\r\n\r\nstatic LJ_AINLINE int CALL_MUNMAP(void *ptr, size_t size)\r\n{\r\n  int olderr = errno;\r\n  int ret = munmap(ptr, size);\r\n  errno = olderr;\r\n  return ret;\r\n}\r\n\r\n#if LJ_TARGET_LINUX\r\n/* Need to define _GNU_SOURCE to get the mremap prototype. */\r\nstatic LJ_AINLINE void *CALL_MREMAP_(void *ptr, size_t osz, size_t nsz,\r\n\t\t\t\t     int flags)\r\n{\r\n  int olderr = errno;\r\n  ptr = mremap(ptr, osz, nsz, flags);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#define CALL_MREMAP(addr, osz, nsz, mv) CALL_MREMAP_((addr), (osz), (nsz), (mv))\r\n#define CALL_MREMAP_NOMOVE\t0\r\n#define CALL_MREMAP_MAYMOVE\t1\r\n#if LJ_64\r\n#define CALL_MREMAP_MV\t\tCALL_MREMAP_NOMOVE\r\n#else\r\n#define CALL_MREMAP_MV\t\tCALL_MREMAP_MAYMOVE\r\n#endif\r\n#endif\r\n\r\n#endif\r\n\r\n#ifndef CALL_MREMAP\r\n#define CALL_MREMAP(addr, osz, nsz, mv) ((void)osz, MFAIL)\r\n#endif\r\n\r\n/* -----------------------  Chunk representations ------------------------ */\r\n\r\nstruct malloc_chunk {\r\n  size_t               prev_foot;  /* Size of previous chunk (if free).  */\r\n  size_t               head;       /* Size and inuse bits. */\r\n  struct malloc_chunk *fd;         /* double links -- used only if free. */\r\n  struct malloc_chunk *bk;\r\n};\r\n\r\ntypedef struct malloc_chunk  mchunk;\r\ntypedef struct malloc_chunk *mchunkptr;\r\ntypedef struct malloc_chunk *sbinptr;  /* The type of bins of chunks */\r\ntypedef size_t bindex_t;               /* Described below */\r\ntypedef unsigned int binmap_t;         /* Described below */\r\ntypedef unsigned int flag_t;           /* The type of various bit flag sets */\r\n\r\n/* ------------------- Chunks sizes and alignments ----------------------- */\r\n\r\n#define MCHUNK_SIZE\t\t(sizeof(mchunk))\r\n\r\n#define CHUNK_OVERHEAD\t\t(SIZE_T_SIZE)\r\n\r\n/* Direct chunks need a second word of overhead ... */\r\n#define DIRECT_CHUNK_OVERHEAD\t(TWO_SIZE_T_SIZES)\r\n/* ... and additional padding for fake next-chunk at foot */\r\n#define DIRECT_FOOT_PAD\t\t(FOUR_SIZE_T_SIZES)\r\n\r\n/* The smallest size we can malloc is an aligned minimal chunk */\r\n#define MIN_CHUNK_SIZE\\\r\n  ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)\r\n\r\n/* conversion from malloc headers to user pointers, and back */\r\n#define chunk2mem(p)\t\t((void *)((char *)(p) + TWO_SIZE_T_SIZES))\r\n#define mem2chunk(mem)\t\t((mchunkptr)((char *)(mem) - TWO_SIZE_T_SIZES))\r\n/* chunk associated with aligned address A */\r\n#define align_as_chunk(A)\t(mchunkptr)((A) + align_offset(chunk2mem(A)))\r\n\r\n/* Bounds on request (not chunk) sizes. */\r\n#define MAX_REQUEST\t\t((~MIN_CHUNK_SIZE+1) << 2)\r\n#define MIN_REQUEST\t\t(MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE)\r\n\r\n/* pad request bytes into a usable size */\r\n#define pad_request(req) \\\r\n   (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)\r\n\r\n/* pad request, checking for minimum (but not maximum) */\r\n#define request2size(req) \\\r\n  (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req))\r\n\r\n/* ------------------ Operations on head and foot fields ----------------- */\r\n\r\n#define PINUSE_BIT\t\t(SIZE_T_ONE)\r\n#define CINUSE_BIT\t\t(SIZE_T_TWO)\r\n#define INUSE_BITS\t\t(PINUSE_BIT|CINUSE_BIT)\r\n\r\n/* Head value for fenceposts */\r\n#define FENCEPOST_HEAD\t\t(INUSE_BITS|SIZE_T_SIZE)\r\n\r\n/* extraction of fields from head words */\r\n#define cinuse(p)\t\t((p)->head & CINUSE_BIT)\r\n#define pinuse(p)\t\t((p)->head & PINUSE_BIT)\r\n#define chunksize(p)\t\t((p)->head & ~(INUSE_BITS))\r\n\r\n#define clear_pinuse(p)\t\t((p)->head &= ~PINUSE_BIT)\r\n#define clear_cinuse(p)\t\t((p)->head &= ~CINUSE_BIT)\r\n\r\n/* Treat space at ptr +/- offset as a chunk */\r\n#define chunk_plus_offset(p, s)\t\t((mchunkptr)(((char *)(p)) + (s)))\r\n#define chunk_minus_offset(p, s)\t((mchunkptr)(((char *)(p)) - (s)))\r\n\r\n/* Ptr to next or previous physical malloc_chunk. */\r\n#define next_chunk(p)\t((mchunkptr)(((char *)(p)) + ((p)->head & ~INUSE_BITS)))\r\n#define prev_chunk(p)\t((mchunkptr)(((char *)(p)) - ((p)->prev_foot) ))\r\n\r\n/* extract next chunk's pinuse bit */\r\n#define next_pinuse(p)\t((next_chunk(p)->head) & PINUSE_BIT)\r\n\r\n/* Get/set size at footer */\r\n#define get_foot(p, s)\t(((mchunkptr)((char *)(p) + (s)))->prev_foot)\r\n#define set_foot(p, s)\t(((mchunkptr)((char *)(p) + (s)))->prev_foot = (s))\r\n\r\n/* Set size, pinuse bit, and foot */\r\n#define set_size_and_pinuse_of_free_chunk(p, s)\\\r\n  ((p)->head = (s|PINUSE_BIT), set_foot(p, s))\r\n\r\n/* Set size, pinuse bit, foot, and clear next pinuse */\r\n#define set_free_with_pinuse(p, s, n)\\\r\n  (clear_pinuse(n), set_size_and_pinuse_of_free_chunk(p, s))\r\n\r\n#define is_direct(p)\\\r\n  (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_DIRECT_BIT))\r\n\r\n/* Get the internal overhead associated with chunk p */\r\n#define overhead_for(p)\\\r\n (is_direct(p)? DIRECT_CHUNK_OVERHEAD : CHUNK_OVERHEAD)\r\n\r\n/* ---------------------- Overlaid data structures ----------------------- */\r\n\r\nstruct malloc_tree_chunk {\r\n  /* The first four fields must be compatible with malloc_chunk */\r\n  size_t                    prev_foot;\r\n  size_t                    head;\r\n  struct malloc_tree_chunk *fd;\r\n  struct malloc_tree_chunk *bk;\r\n\r\n  struct malloc_tree_chunk *child[2];\r\n  struct malloc_tree_chunk *parent;\r\n  bindex_t                  index;\r\n};\r\n\r\ntypedef struct malloc_tree_chunk  tchunk;\r\ntypedef struct malloc_tree_chunk *tchunkptr;\r\ntypedef struct malloc_tree_chunk *tbinptr; /* The type of bins of trees */\r\n\r\n/* A little helper macro for trees */\r\n#define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])\r\n\r\n/* ----------------------------- Segments -------------------------------- */\r\n\r\nstruct malloc_segment {\r\n  char        *base;             /* base address */\r\n  size_t       size;             /* allocated size */\r\n  struct malloc_segment *next;   /* ptr to next segment */\r\n};\r\n\r\ntypedef struct malloc_segment  msegment;\r\ntypedef struct malloc_segment *msegmentptr;\r\n\r\n/* ---------------------------- malloc_state ----------------------------- */\r\n\r\n/* Bin types, widths and sizes */\r\n#define NSMALLBINS\t\t(32U)\r\n#define NTREEBINS\t\t(32U)\r\n#define SMALLBIN_SHIFT\t\t(3U)\r\n#define SMALLBIN_WIDTH\t\t(SIZE_T_ONE << SMALLBIN_SHIFT)\r\n#define TREEBIN_SHIFT\t\t(8U)\r\n#define MIN_LARGE_SIZE\t\t(SIZE_T_ONE << TREEBIN_SHIFT)\r\n#define MAX_SMALL_SIZE\t\t(MIN_LARGE_SIZE - SIZE_T_ONE)\r\n#define MAX_SMALL_REQUEST  (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD)\r\n\r\nstruct malloc_state {\r\n  binmap_t   smallmap;\r\n  binmap_t   treemap;\r\n  size_t     dvsize;\r\n  size_t     topsize;\r\n  mchunkptr  dv;\r\n  mchunkptr  top;\r\n  size_t     trim_check;\r\n  size_t     release_checks;\r\n  mchunkptr  smallbins[(NSMALLBINS+1)*2];\r\n  tbinptr    treebins[NTREEBINS];\r\n  msegment   seg;\r\n};\r\n\r\ntypedef struct malloc_state *mstate;\r\n\r\n#define is_initialized(M)\t((M)->top != 0)\r\n\r\n/* -------------------------- system alloc setup ------------------------- */\r\n\r\n/* page-align a size */\r\n#define page_align(S)\\\r\n (((S) + (LJ_PAGESIZE - SIZE_T_ONE)) & ~(LJ_PAGESIZE - SIZE_T_ONE))\r\n\r\n/* granularity-align a size */\r\n#define granularity_align(S)\\\r\n  (((S) + (DEFAULT_GRANULARITY - SIZE_T_ONE))\\\r\n   & ~(DEFAULT_GRANULARITY - SIZE_T_ONE))\r\n\r\n#if LJ_TARGET_WINDOWS\r\n#define mmap_align(S)\tgranularity_align(S)\r\n#else\r\n#define mmap_align(S)\tpage_align(S)\r\n#endif\r\n\r\n/*  True if segment S holds address A */\r\n#define segment_holds(S, A)\\\r\n  ((char *)(A) >= S->base && (char *)(A) < S->base + S->size)\r\n\r\n/* Return segment holding given address */\r\nstatic msegmentptr segment_holding(mstate m, char *addr)\r\n{\r\n  msegmentptr sp = &m->seg;\r\n  for (;;) {\r\n    if (addr >= sp->base && addr < sp->base + sp->size)\r\n      return sp;\r\n    if ((sp = sp->next) == 0)\r\n      return 0;\r\n  }\r\n}\r\n\r\n/* Return true if segment contains a segment link */\r\nstatic int has_segment_link(mstate m, msegmentptr ss)\r\n{\r\n  msegmentptr sp = &m->seg;\r\n  for (;;) {\r\n    if ((char *)sp >= ss->base && (char *)sp < ss->base + ss->size)\r\n      return 1;\r\n    if ((sp = sp->next) == 0)\r\n      return 0;\r\n  }\r\n}\r\n\r\n/*\r\n  TOP_FOOT_SIZE is padding at the end of a segment, including space\r\n  that may be needed to place segment records and fenceposts when new\r\n  noncontiguous segments are added.\r\n*/\r\n#define TOP_FOOT_SIZE\\\r\n  (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE)\r\n\r\n/* ---------------------------- Indexing Bins ---------------------------- */\r\n\r\n#define is_small(s)\t\t(((s) >> SMALLBIN_SHIFT) < NSMALLBINS)\r\n#define small_index(s)\t\t((s)  >> SMALLBIN_SHIFT)\r\n#define small_index2size(i)\t((i)  << SMALLBIN_SHIFT)\r\n#define MIN_SMALL_INDEX\t\t(small_index(MIN_CHUNK_SIZE))\r\n\r\n/* addressing by index. See above about smallbin repositioning */\r\n#define smallbin_at(M, i)\t((sbinptr)((char *)&((M)->smallbins[(i)<<1])))\r\n#define treebin_at(M,i)\t\t(&((M)->treebins[i]))\r\n\r\n/* assign tree index for size S to variable I */\r\n#define compute_tree_index(S, I)\\\r\n{\\\r\n  unsigned int X = (unsigned int)(S >> TREEBIN_SHIFT);\\\r\n  if (X == 0) {\\\r\n    I = 0;\\\r\n  } else if (X > 0xFFFF) {\\\r\n    I = NTREEBINS-1;\\\r\n  } else {\\\r\n    unsigned int K = lj_fls(X);\\\r\n    I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\\\r\n  }\\\r\n}\r\n\r\n/* Bit representing maximum resolved size in a treebin at i */\r\n#define bit_for_tree_index(i) \\\r\n   (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2)\r\n\r\n/* Shift placing maximum resolved bit in a treebin at i as sign bit */\r\n#define leftshift_for_tree_index(i) \\\r\n   ((i == NTREEBINS-1)? 0 : \\\r\n    ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2)))\r\n\r\n/* The size of the smallest chunk held in bin with index i */\r\n#define minsize_for_tree_index(i) \\\r\n   ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) |  \\\r\n   (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1)))\r\n\r\n/* ------------------------ Operations on bin maps ----------------------- */\r\n\r\n/* bit corresponding to given index */\r\n#define idx2bit(i)\t\t((binmap_t)(1) << (i))\r\n\r\n/* Mark/Clear bits with given index */\r\n#define mark_smallmap(M,i)\t((M)->smallmap |=  idx2bit(i))\r\n#define clear_smallmap(M,i)\t((M)->smallmap &= ~idx2bit(i))\r\n#define smallmap_is_marked(M,i)\t((M)->smallmap &   idx2bit(i))\r\n\r\n#define mark_treemap(M,i)\t((M)->treemap  |=  idx2bit(i))\r\n#define clear_treemap(M,i)\t((M)->treemap  &= ~idx2bit(i))\r\n#define treemap_is_marked(M,i)\t((M)->treemap  &   idx2bit(i))\r\n\r\n/* mask with all bits to left of least bit of x on */\r\n#define left_bits(x)\t\t((x<<1) | (~(x<<1)+1))\r\n\r\n/* Set cinuse bit and pinuse bit of next chunk */\r\n#define set_inuse(M,p,s)\\\r\n  ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\\\r\n  ((mchunkptr)(((char *)(p)) + (s)))->head |= PINUSE_BIT)\r\n\r\n/* Set cinuse and pinuse of this chunk and pinuse of next chunk */\r\n#define set_inuse_and_pinuse(M,p,s)\\\r\n  ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\\\r\n  ((mchunkptr)(((char *)(p)) + (s)))->head |= PINUSE_BIT)\r\n\r\n/* Set size, cinuse and pinuse bit of this chunk */\r\n#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\\\r\n  ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))\r\n\r\n/* ----------------------- Operations on smallbins ----------------------- */\r\n\r\n/* Link a free chunk into a smallbin  */\r\n#define insert_small_chunk(M, P, S) {\\\r\n  bindex_t I = small_index(S);\\\r\n  mchunkptr B = smallbin_at(M, I);\\\r\n  mchunkptr F = B;\\\r\n  if (!smallmap_is_marked(M, I))\\\r\n    mark_smallmap(M, I);\\\r\n  else\\\r\n    F = B->fd;\\\r\n  B->fd = P;\\\r\n  F->bk = P;\\\r\n  P->fd = F;\\\r\n  P->bk = B;\\\r\n}\r\n\r\n/* Unlink a chunk from a smallbin  */\r\n#define unlink_small_chunk(M, P, S) {\\\r\n  mchunkptr F = P->fd;\\\r\n  mchunkptr B = P->bk;\\\r\n  bindex_t I = small_index(S);\\\r\n  if (F == B) {\\\r\n    clear_smallmap(M, I);\\\r\n  } else {\\\r\n    F->bk = B;\\\r\n    B->fd = F;\\\r\n  }\\\r\n}\r\n\r\n/* Unlink the first chunk from a smallbin */\r\n#define unlink_first_small_chunk(M, B, P, I) {\\\r\n  mchunkptr F = P->fd;\\\r\n  if (B == F) {\\\r\n    clear_smallmap(M, I);\\\r\n  } else {\\\r\n    B->fd = F;\\\r\n    F->bk = B;\\\r\n  }\\\r\n}\r\n\r\n/* Replace dv node, binning the old one */\r\n/* Used only when dvsize known to be small */\r\n#define replace_dv(M, P, S) {\\\r\n  size_t DVS = M->dvsize;\\\r\n  if (DVS != 0) {\\\r\n    mchunkptr DV = M->dv;\\\r\n    insert_small_chunk(M, DV, DVS);\\\r\n  }\\\r\n  M->dvsize = S;\\\r\n  M->dv = P;\\\r\n}\r\n\r\n/* ------------------------- Operations on trees ------------------------- */\r\n\r\n/* Insert chunk into tree */\r\n#define insert_large_chunk(M, X, S) {\\\r\n  tbinptr *H;\\\r\n  bindex_t I;\\\r\n  compute_tree_index(S, I);\\\r\n  H = treebin_at(M, I);\\\r\n  X->index = I;\\\r\n  X->child[0] = X->child[1] = 0;\\\r\n  if (!treemap_is_marked(M, I)) {\\\r\n    mark_treemap(M, I);\\\r\n    *H = X;\\\r\n    X->parent = (tchunkptr)H;\\\r\n    X->fd = X->bk = X;\\\r\n  } else {\\\r\n    tchunkptr T = *H;\\\r\n    size_t K = S << leftshift_for_tree_index(I);\\\r\n    for (;;) {\\\r\n      if (chunksize(T) != S) {\\\r\n\ttchunkptr *C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\\\r\n\tK <<= 1;\\\r\n\tif (*C != 0) {\\\r\n\t  T = *C;\\\r\n\t} else {\\\r\n\t  *C = X;\\\r\n\t  X->parent = T;\\\r\n\t  X->fd = X->bk = X;\\\r\n\t  break;\\\r\n\t}\\\r\n      } else {\\\r\n\ttchunkptr F = T->fd;\\\r\n\tT->fd = F->bk = X;\\\r\n\tX->fd = F;\\\r\n\tX->bk = T;\\\r\n\tX->parent = 0;\\\r\n\tbreak;\\\r\n      }\\\r\n    }\\\r\n  }\\\r\n}\r\n\r\n#define unlink_large_chunk(M, X) {\\\r\n  tchunkptr XP = X->parent;\\\r\n  tchunkptr R;\\\r\n  if (X->bk != X) {\\\r\n    tchunkptr F = X->fd;\\\r\n    R = X->bk;\\\r\n    F->bk = R;\\\r\n    R->fd = F;\\\r\n  } else {\\\r\n    tchunkptr *RP;\\\r\n    if (((R = *(RP = &(X->child[1]))) != 0) ||\\\r\n\t((R = *(RP = &(X->child[0]))) != 0)) {\\\r\n      tchunkptr *CP;\\\r\n      while ((*(CP = &(R->child[1])) != 0) ||\\\r\n\t     (*(CP = &(R->child[0])) != 0)) {\\\r\n\tR = *(RP = CP);\\\r\n      }\\\r\n      *RP = 0;\\\r\n    }\\\r\n  }\\\r\n  if (XP != 0) {\\\r\n    tbinptr *H = treebin_at(M, X->index);\\\r\n    if (X == *H) {\\\r\n      if ((*H = R) == 0) \\\r\n\tclear_treemap(M, X->index);\\\r\n    } else {\\\r\n      if (XP->child[0] == X) \\\r\n\tXP->child[0] = R;\\\r\n      else \\\r\n\tXP->child[1] = R;\\\r\n    }\\\r\n    if (R != 0) {\\\r\n      tchunkptr C0, C1;\\\r\n      R->parent = XP;\\\r\n      if ((C0 = X->child[0]) != 0) {\\\r\n\tR->child[0] = C0;\\\r\n\tC0->parent = R;\\\r\n      }\\\r\n      if ((C1 = X->child[1]) != 0) {\\\r\n\tR->child[1] = C1;\\\r\n\tC1->parent = R;\\\r\n      }\\\r\n    }\\\r\n  }\\\r\n}\r\n\r\n/* Relays to large vs small bin operations */\r\n\r\n#define insert_chunk(M, P, S)\\\r\n  if (is_small(S)) { insert_small_chunk(M, P, S)\\\r\n  } else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }\r\n\r\n#define unlink_chunk(M, P, S)\\\r\n  if (is_small(S)) { unlink_small_chunk(M, P, S)\\\r\n  } else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }\r\n\r\n/* -----------------------  Direct-mmapping chunks ----------------------- */\r\n\r\nstatic void *direct_alloc(size_t nb)\r\n{\r\n  size_t mmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n  if (LJ_LIKELY(mmsize > nb)) {     /* Check for wrap around 0 */\r\n    char *mm = (char *)(DIRECT_MMAP(mmsize));\r\n    if (mm != CMFAIL) {\r\n      size_t offset = align_offset(chunk2mem(mm));\r\n      size_t psize = mmsize - offset - DIRECT_FOOT_PAD;\r\n      mchunkptr p = (mchunkptr)(mm + offset);\r\n      p->prev_foot = offset | IS_DIRECT_BIT;\r\n      p->head = psize|CINUSE_BIT;\r\n      chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;\r\n      chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;\r\n      return chunk2mem(p);\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic mchunkptr direct_resize(mchunkptr oldp, size_t nb)\r\n{\r\n  size_t oldsize = chunksize(oldp);\r\n  if (is_small(nb)) /* Can't shrink direct regions below small size */\r\n    return NULL;\r\n  /* Keep old chunk if big enough but not too big */\r\n  if (oldsize >= nb + SIZE_T_SIZE &&\r\n      (oldsize - nb) <= (DEFAULT_GRANULARITY >> 1)) {\r\n    return oldp;\r\n  } else {\r\n    size_t offset = oldp->prev_foot & ~IS_DIRECT_BIT;\r\n    size_t oldmmsize = oldsize + offset + DIRECT_FOOT_PAD;\r\n    size_t newmmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n    char *cp = (char *)CALL_MREMAP((char *)oldp - offset,\r\n\t\t\t\t   oldmmsize, newmmsize, CALL_MREMAP_MV);\r\n    if (cp != CMFAIL) {\r\n      mchunkptr newp = (mchunkptr)(cp + offset);\r\n      size_t psize = newmmsize - offset - DIRECT_FOOT_PAD;\r\n      newp->head = psize|CINUSE_BIT;\r\n      chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;\r\n      chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;\r\n      return newp;\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* -------------------------- mspace management -------------------------- */\r\n\r\n/* Initialize top chunk and its size */\r\nstatic void init_top(mstate m, mchunkptr p, size_t psize)\r\n{\r\n  /* Ensure alignment */\r\n  size_t offset = align_offset(chunk2mem(p));\r\n  p = (mchunkptr)((char *)p + offset);\r\n  psize -= offset;\r\n\r\n  m->top = p;\r\n  m->topsize = psize;\r\n  p->head = psize | PINUSE_BIT;\r\n  /* set size of fake trailing chunk holding overhead space only once */\r\n  chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;\r\n  m->trim_check = DEFAULT_TRIM_THRESHOLD; /* reset on each update */\r\n}\r\n\r\n/* Initialize bins for a new mstate that is otherwise zeroed out */\r\nstatic void init_bins(mstate m)\r\n{\r\n  /* Establish circular links for smallbins */\r\n  bindex_t i;\r\n  for (i = 0; i < NSMALLBINS; i++) {\r\n    sbinptr bin = smallbin_at(m,i);\r\n    bin->fd = bin->bk = bin;\r\n  }\r\n}\r\n\r\n/* Allocate chunk and prepend remainder with chunk in successor base. */\r\nstatic void *prepend_alloc(mstate m, char *newbase, char *oldbase, size_t nb)\r\n{\r\n  mchunkptr p = align_as_chunk(newbase);\r\n  mchunkptr oldfirst = align_as_chunk(oldbase);\r\n  size_t psize = (size_t)((char *)oldfirst - (char *)p);\r\n  mchunkptr q = chunk_plus_offset(p, nb);\r\n  size_t qsize = psize - nb;\r\n  set_size_and_pinuse_of_inuse_chunk(m, p, nb);\r\n\r\n  /* consolidate remainder with first chunk of old base */\r\n  if (oldfirst == m->top) {\r\n    size_t tsize = m->topsize += qsize;\r\n    m->top = q;\r\n    q->head = tsize | PINUSE_BIT;\r\n  } else if (oldfirst == m->dv) {\r\n    size_t dsize = m->dvsize += qsize;\r\n    m->dv = q;\r\n    set_size_and_pinuse_of_free_chunk(q, dsize);\r\n  } else {\r\n    if (!cinuse(oldfirst)) {\r\n      size_t nsize = chunksize(oldfirst);\r\n      unlink_chunk(m, oldfirst, nsize);\r\n      oldfirst = chunk_plus_offset(oldfirst, nsize);\r\n      qsize += nsize;\r\n    }\r\n    set_free_with_pinuse(q, qsize, oldfirst);\r\n    insert_chunk(m, q, qsize);\r\n  }\r\n\r\n  return chunk2mem(p);\r\n}\r\n\r\n/* Add a segment to hold a new noncontiguous region */\r\nstatic void add_segment(mstate m, char *tbase, size_t tsize)\r\n{\r\n  /* Determine locations and sizes of segment, fenceposts, old top */\r\n  char *old_top = (char *)m->top;\r\n  msegmentptr oldsp = segment_holding(m, old_top);\r\n  char *old_end = oldsp->base + oldsp->size;\r\n  size_t ssize = pad_request(sizeof(struct malloc_segment));\r\n  char *rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n  size_t offset = align_offset(chunk2mem(rawsp));\r\n  char *asp = rawsp + offset;\r\n  char *csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp;\r\n  mchunkptr sp = (mchunkptr)csp;\r\n  msegmentptr ss = (msegmentptr)(chunk2mem(sp));\r\n  mchunkptr tnext = chunk_plus_offset(sp, ssize);\r\n  mchunkptr p = tnext;\r\n\r\n  /* reset top to new space */\r\n  init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE);\r\n\r\n  /* Set up segment record */\r\n  set_size_and_pinuse_of_inuse_chunk(m, sp, ssize);\r\n  *ss = m->seg; /* Push current record */\r\n  m->seg.base = tbase;\r\n  m->seg.size = tsize;\r\n  m->seg.next = ss;\r\n\r\n  /* Insert trailing fenceposts */\r\n  for (;;) {\r\n    mchunkptr nextp = chunk_plus_offset(p, SIZE_T_SIZE);\r\n    p->head = FENCEPOST_HEAD;\r\n    if ((char *)(&(nextp->head)) < old_end)\r\n      p = nextp;\r\n    else\r\n      break;\r\n  }\r\n\r\n  /* Insert the rest of old top into a bin as an ordinary free chunk */\r\n  if (csp != old_top) {\r\n    mchunkptr q = (mchunkptr)old_top;\r\n    size_t psize = (size_t)(csp - old_top);\r\n    mchunkptr tn = chunk_plus_offset(q, psize);\r\n    set_free_with_pinuse(q, psize, tn);\r\n    insert_chunk(m, q, psize);\r\n  }\r\n}\r\n\r\n/* -------------------------- System allocation -------------------------- */\r\n\r\nstatic void *alloc_sys(mstate m, size_t nb)\r\n{\r\n  char *tbase = CMFAIL;\r\n  size_t tsize = 0;\r\n\r\n  /* Directly map large chunks */\r\n  if (LJ_UNLIKELY(nb >= DEFAULT_MMAP_THRESHOLD)) {\r\n    void *mem = direct_alloc(nb);\r\n    if (mem != 0)\r\n      return mem;\r\n  }\r\n\r\n  {\r\n    size_t req = nb + TOP_FOOT_SIZE + SIZE_T_ONE;\r\n    size_t rsize = granularity_align(req);\r\n    if (LJ_LIKELY(rsize > nb)) { /* Fail if wraps around zero */\r\n      char *mp = (char *)(CALL_MMAP(rsize));\r\n      if (mp != CMFAIL) {\r\n\ttbase = mp;\r\n\ttsize = rsize;\r\n      }\r\n    }\r\n  }\r\n\r\n  if (tbase != CMFAIL) {\r\n    msegmentptr sp = &m->seg;\r\n    /* Try to merge with an existing segment */\r\n    while (sp != 0 && tbase != sp->base + sp->size)\r\n      sp = sp->next;\r\n    if (sp != 0 && segment_holds(sp, m->top)) { /* append */\r\n      sp->size += tsize;\r\n      init_top(m, m->top, m->topsize + tsize);\r\n    } else {\r\n      sp = &m->seg;\r\n      while (sp != 0 && sp->base != tbase + tsize)\r\n\tsp = sp->next;\r\n      if (sp != 0) {\r\n\tchar *oldbase = sp->base;\r\n\tsp->base = tbase;\r\n\tsp->size += tsize;\r\n\treturn prepend_alloc(m, tbase, oldbase, nb);\r\n      } else {\r\n\tadd_segment(m, tbase, tsize);\r\n      }\r\n    }\r\n\r\n    if (nb < m->topsize) { /* Allocate from new or extended top space */\r\n      size_t rsize = m->topsize -= nb;\r\n      mchunkptr p = m->top;\r\n      mchunkptr r = m->top = chunk_plus_offset(p, nb);\r\n      r->head = rsize | PINUSE_BIT;\r\n      set_size_and_pinuse_of_inuse_chunk(m, p, nb);\r\n      return chunk2mem(p);\r\n    }\r\n  }\r\n\r\n  return NULL;\r\n}\r\n\r\n/* -----------------------  system deallocation -------------------------- */\r\n\r\n/* Unmap and unlink any mmapped segments that don't contain used chunks */\r\nstatic size_t release_unused_segments(mstate m)\r\n{\r\n  size_t released = 0;\r\n  size_t nsegs = 0;\r\n  msegmentptr pred = &m->seg;\r\n  msegmentptr sp = pred->next;\r\n  while (sp != 0) {\r\n    char *base = sp->base;\r\n    size_t size = sp->size;\r\n    msegmentptr next = sp->next;\r\n    nsegs++;\r\n    {\r\n      mchunkptr p = align_as_chunk(base);\r\n      size_t psize = chunksize(p);\r\n      /* Can unmap if first chunk holds entire segment and not pinned */\r\n      if (!cinuse(p) && (char *)p + psize >= base + size - TOP_FOOT_SIZE) {\r\n\ttchunkptr tp = (tchunkptr)p;\r\n\tif (p == m->dv) {\r\n\t  m->dv = 0;\r\n\t  m->dvsize = 0;\r\n\t} else {\r\n\t  unlink_large_chunk(m, tp);\r\n\t}\r\n\tif (CALL_MUNMAP(base, size) == 0) {\r\n\t  released += size;\r\n\t  /* unlink obsoleted record */\r\n\t  sp = pred;\r\n\t  sp->next = next;\r\n\t} else { /* back out if cannot unmap */\r\n\t  insert_large_chunk(m, tp, psize);\r\n\t}\r\n      }\r\n    }\r\n    pred = sp;\r\n    sp = next;\r\n  }\r\n  /* Reset check counter */\r\n  m->release_checks = nsegs > MAX_RELEASE_CHECK_RATE ?\r\n\t\t      nsegs : MAX_RELEASE_CHECK_RATE;\r\n  return released;\r\n}\r\n\r\nstatic int alloc_trim(mstate m, size_t pad)\r\n{\r\n  size_t released = 0;\r\n  if (pad < MAX_REQUEST && is_initialized(m)) {\r\n    pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */\r\n\r\n    if (m->topsize > pad) {\r\n      /* Shrink top space in granularity-size units, keeping at least one */\r\n      size_t unit = DEFAULT_GRANULARITY;\r\n      size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit -\r\n\t\t      SIZE_T_ONE) * unit;\r\n      msegmentptr sp = segment_holding(m, (char *)m->top);\r\n\r\n      if (sp->size >= extra &&\r\n\t  !has_segment_link(m, sp)) { /* can't shrink if pinned */\r\n\tsize_t newsize = sp->size - extra;\r\n\t/* Prefer mremap, fall back to munmap */\r\n\tif ((CALL_MREMAP(sp->base, sp->size, newsize, CALL_MREMAP_NOMOVE) != MFAIL) ||\r\n\t    (CALL_MUNMAP(sp->base + newsize, extra) == 0)) {\r\n\t  released = extra;\r\n\t}\r\n      }\r\n\r\n      if (released != 0) {\r\n\tsp->size -= released;\r\n\tinit_top(m, m->top, m->topsize - released);\r\n      }\r\n    }\r\n\r\n    /* Unmap any unused mmapped segments */\r\n    released += release_unused_segments(m);\r\n\r\n    /* On failure, disable autotrim to avoid repeated failed future calls */\r\n    if (released == 0 && m->topsize > m->trim_check)\r\n      m->trim_check = MAX_SIZE_T;\r\n  }\r\n\r\n  return (released != 0)? 1 : 0;\r\n}\r\n\r\n/* ---------------------------- malloc support --------------------------- */\r\n\r\n/* allocate a large request from the best fitting chunk in a treebin */\r\nstatic void *tmalloc_large(mstate m, size_t nb)\r\n{\r\n  tchunkptr v = 0;\r\n  size_t rsize = ~nb+1; /* Unsigned negation */\r\n  tchunkptr t;\r\n  bindex_t idx;\r\n  compute_tree_index(nb, idx);\r\n\r\n  if ((t = *treebin_at(m, idx)) != 0) {\r\n    /* Traverse tree for this bin looking for node with size == nb */\r\n    size_t sizebits = nb << leftshift_for_tree_index(idx);\r\n    tchunkptr rst = 0;  /* The deepest untaken right subtree */\r\n    for (;;) {\r\n      tchunkptr rt;\r\n      size_t trem = chunksize(t) - nb;\r\n      if (trem < rsize) {\r\n\tv = t;\r\n\tif ((rsize = trem) == 0)\r\n\t  break;\r\n      }\r\n      rt = t->child[1];\r\n      t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];\r\n      if (rt != 0 && rt != t)\r\n\trst = rt;\r\n      if (t == 0) {\r\n\tt = rst; /* set t to least subtree holding sizes > nb */\r\n\tbreak;\r\n      }\r\n      sizebits <<= 1;\r\n    }\r\n  }\r\n\r\n  if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */\r\n    binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;\r\n    if (leftbits != 0)\r\n      t = *treebin_at(m, lj_ffs(leftbits));\r\n  }\r\n\r\n  while (t != 0) { /* find smallest of tree or subtree */\r\n    size_t trem = chunksize(t) - nb;\r\n    if (trem < rsize) {\r\n      rsize = trem;\r\n      v = t;\r\n    }\r\n    t = leftmost_child(t);\r\n  }\r\n\r\n  /*  If dv is a better fit, return NULL so malloc will use it */\r\n  if (v != 0 && rsize < (size_t)(m->dvsize - nb)) {\r\n    mchunkptr r = chunk_plus_offset(v, nb);\r\n    unlink_large_chunk(m, v);\r\n    if (rsize < MIN_CHUNK_SIZE) {\r\n      set_inuse_and_pinuse(m, v, (rsize + nb));\r\n    } else {\r\n      set_size_and_pinuse_of_inuse_chunk(m, v, nb);\r\n      set_size_and_pinuse_of_free_chunk(r, rsize);\r\n      insert_chunk(m, r, rsize);\r\n    }\r\n    return chunk2mem(v);\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* allocate a small request from the best fitting chunk in a treebin */\r\nstatic void *tmalloc_small(mstate m, size_t nb)\r\n{\r\n  tchunkptr t, v;\r\n  mchunkptr r;\r\n  size_t rsize;\r\n  bindex_t i = lj_ffs(m->treemap);\r\n\r\n  v = t = *treebin_at(m, i);\r\n  rsize = chunksize(t) - nb;\r\n\r\n  while ((t = leftmost_child(t)) != 0) {\r\n    size_t trem = chunksize(t) - nb;\r\n    if (trem < rsize) {\r\n      rsize = trem;\r\n      v = t;\r\n    }\r\n  }\r\n\r\n  r = chunk_plus_offset(v, nb);\r\n  unlink_large_chunk(m, v);\r\n  if (rsize < MIN_CHUNK_SIZE) {\r\n    set_inuse_and_pinuse(m, v, (rsize + nb));\r\n  } else {\r\n    set_size_and_pinuse_of_inuse_chunk(m, v, nb);\r\n    set_size_and_pinuse_of_free_chunk(r, rsize);\r\n    replace_dv(m, r, rsize);\r\n  }\r\n  return chunk2mem(v);\r\n}\r\n\r\n/* ----------------------------------------------------------------------- */\r\n\r\nvoid *lj_alloc_create(void)\r\n{\r\n  size_t tsize = DEFAULT_GRANULARITY;\r\n  char *tbase;\r\n  INIT_MMAP();\r\n  tbase = (char *)(CALL_MMAP(tsize));\r\n  if (tbase != CMFAIL) {\r\n    size_t msize = pad_request(sizeof(struct malloc_state));\r\n    mchunkptr mn;\r\n    mchunkptr msp = align_as_chunk(tbase);\r\n    mstate m = (mstate)(chunk2mem(msp));\r\n    memset(m, 0, msize);\r\n    msp->head = (msize|PINUSE_BIT|CINUSE_BIT);\r\n    m->seg.base = tbase;\r\n    m->seg.size = tsize;\r\n    m->release_checks = MAX_RELEASE_CHECK_RATE;\r\n    init_bins(m);\r\n    mn = next_chunk(mem2chunk(m));\r\n    init_top(m, mn, (size_t)((tbase + tsize) - (char *)mn) - TOP_FOOT_SIZE);\r\n    return m;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nvoid lj_alloc_destroy(void *msp)\r\n{\r\n  mstate ms = (mstate)msp;\r\n  msegmentptr sp = &ms->seg;\r\n  while (sp != 0) {\r\n    char *base = sp->base;\r\n    size_t size = sp->size;\r\n    sp = sp->next;\r\n    CALL_MUNMAP(base, size);\r\n  }\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_malloc(void *msp, size_t nsize)\r\n{\r\n  mstate ms = (mstate)msp;\r\n  void *mem;\r\n  size_t nb;\r\n  if (nsize <= MAX_SMALL_REQUEST) {\r\n    bindex_t idx;\r\n    binmap_t smallbits;\r\n    nb = (nsize < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(nsize);\r\n    idx = small_index(nb);\r\n    smallbits = ms->smallmap >> idx;\r\n\r\n    if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */\r\n      mchunkptr b, p;\r\n      idx += ~smallbits & 1;       /* Uses next bin if idx empty */\r\n      b = smallbin_at(ms, idx);\r\n      p = b->fd;\r\n      unlink_first_small_chunk(ms, b, p, idx);\r\n      set_inuse_and_pinuse(ms, p, small_index2size(idx));\r\n      mem = chunk2mem(p);\r\n      return mem;\r\n    } else if (nb > ms->dvsize) {\r\n      if (smallbits != 0) { /* Use chunk in next nonempty smallbin */\r\n\tmchunkptr b, p, r;\r\n\tsize_t rsize;\r\n\tbinmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));\r\n\tbindex_t i = lj_ffs(leftbits);\r\n\tb = smallbin_at(ms, i);\r\n\tp = b->fd;\r\n\tunlink_first_small_chunk(ms, b, p, i);\r\n\trsize = small_index2size(i) - nb;\r\n\t/* Fit here cannot be remainderless if 4byte sizes */\r\n\tif (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) {\r\n\t  set_inuse_and_pinuse(ms, p, small_index2size(i));\r\n\t} else {\r\n\t  set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n\t  r = chunk_plus_offset(p, nb);\r\n\t  set_size_and_pinuse_of_free_chunk(r, rsize);\r\n\t  replace_dv(ms, r, rsize);\r\n\t}\r\n\tmem = chunk2mem(p);\r\n\treturn mem;\r\n      } else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) {\r\n\treturn mem;\r\n      }\r\n    }\r\n  } else if (nsize >= MAX_REQUEST) {\r\n    nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */\r\n  } else {\r\n    nb = pad_request(nsize);\r\n    if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) {\r\n      return mem;\r\n    }\r\n  }\r\n\r\n  if (nb <= ms->dvsize) {\r\n    size_t rsize = ms->dvsize - nb;\r\n    mchunkptr p = ms->dv;\r\n    if (rsize >= MIN_CHUNK_SIZE) { /* split dv */\r\n      mchunkptr r = ms->dv = chunk_plus_offset(p, nb);\r\n      ms->dvsize = rsize;\r\n      set_size_and_pinuse_of_free_chunk(r, rsize);\r\n      set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n    } else { /* exhaust dv */\r\n      size_t dvs = ms->dvsize;\r\n      ms->dvsize = 0;\r\n      ms->dv = 0;\r\n      set_inuse_and_pinuse(ms, p, dvs);\r\n    }\r\n    mem = chunk2mem(p);\r\n    return mem;\r\n  } else if (nb < ms->topsize) { /* Split top */\r\n    size_t rsize = ms->topsize -= nb;\r\n    mchunkptr p = ms->top;\r\n    mchunkptr r = ms->top = chunk_plus_offset(p, nb);\r\n    r->head = rsize | PINUSE_BIT;\r\n    set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n    mem = chunk2mem(p);\r\n    return mem;\r\n  }\r\n  return alloc_sys(ms, nb);\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_free(void *msp, void *ptr)\r\n{\r\n  if (ptr != 0) {\r\n    mchunkptr p = mem2chunk(ptr);\r\n    mstate fm = (mstate)msp;\r\n    size_t psize = chunksize(p);\r\n    mchunkptr next = chunk_plus_offset(p, psize);\r\n    if (!pinuse(p)) {\r\n      size_t prevsize = p->prev_foot;\r\n      if ((prevsize & IS_DIRECT_BIT) != 0) {\r\n\tprevsize &= ~IS_DIRECT_BIT;\r\n\tpsize += prevsize + DIRECT_FOOT_PAD;\r\n\tCALL_MUNMAP((char *)p - prevsize, psize);\r\n\treturn NULL;\r\n      } else {\r\n\tmchunkptr prev = chunk_minus_offset(p, prevsize);\r\n\tpsize += prevsize;\r\n\tp = prev;\r\n\t/* consolidate backward */\r\n\tif (p != fm->dv) {\r\n\t  unlink_chunk(fm, p, prevsize);\r\n\t} else if ((next->head & INUSE_BITS) == INUSE_BITS) {\r\n\t  fm->dvsize = psize;\r\n\t  set_free_with_pinuse(p, psize, next);\r\n\t  return NULL;\r\n\t}\r\n      }\r\n    }\r\n    if (!cinuse(next)) {  /* consolidate forward */\r\n      if (next == fm->top) {\r\n\tsize_t tsize = fm->topsize += psize;\r\n\tfm->top = p;\r\n\tp->head = tsize | PINUSE_BIT;\r\n\tif (p == fm->dv) {\r\n\t  fm->dv = 0;\r\n\t  fm->dvsize = 0;\r\n\t}\r\n\tif (tsize > fm->trim_check)\r\n\t  alloc_trim(fm, 0);\r\n\treturn NULL;\r\n      } else if (next == fm->dv) {\r\n\tsize_t dsize = fm->dvsize += psize;\r\n\tfm->dv = p;\r\n\tset_size_and_pinuse_of_free_chunk(p, dsize);\r\n\treturn NULL;\r\n      } else {\r\n\tsize_t nsize = chunksize(next);\r\n\tpsize += nsize;\r\n\tunlink_chunk(fm, next, nsize);\r\n\tset_size_and_pinuse_of_free_chunk(p, psize);\r\n\tif (p == fm->dv) {\r\n\t  fm->dvsize = psize;\r\n\t  return NULL;\r\n\t}\r\n      }\r\n    } else {\r\n      set_free_with_pinuse(p, psize, next);\r\n    }\r\n\r\n    if (is_small(psize)) {\r\n      insert_small_chunk(fm, p, psize);\r\n    } else {\r\n      tchunkptr tp = (tchunkptr)p;\r\n      insert_large_chunk(fm, tp, psize);\r\n      if (--fm->release_checks == 0)\r\n\trelease_unused_segments(fm);\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_realloc(void *msp, void *ptr, size_t nsize)\r\n{\r\n  if (nsize >= MAX_REQUEST) {\r\n    return NULL;\r\n  } else {\r\n    mstate m = (mstate)msp;\r\n    mchunkptr oldp = mem2chunk(ptr);\r\n    size_t oldsize = chunksize(oldp);\r\n    mchunkptr next = chunk_plus_offset(oldp, oldsize);\r\n    mchunkptr newp = 0;\r\n    size_t nb = request2size(nsize);\r\n\r\n    /* Try to either shrink or extend into top. Else malloc-copy-free */\r\n    if (is_direct(oldp)) {\r\n      newp = direct_resize(oldp, nb);  /* this may return NULL. */\r\n    } else if (oldsize >= nb) { /* already big enough */\r\n      size_t rsize = oldsize - nb;\r\n      newp = oldp;\r\n      if (rsize >= MIN_CHUNK_SIZE) {\r\n\tmchunkptr rem = chunk_plus_offset(newp, nb);\r\n\tset_inuse(m, newp, nb);\r\n\tset_inuse(m, rem, rsize);\r\n\tlj_alloc_free(m, chunk2mem(rem));\r\n      }\r\n    } else if (next == m->top && oldsize + m->topsize > nb) {\r\n      /* Expand into top */\r\n      size_t newsize = oldsize + m->topsize;\r\n      size_t newtopsize = newsize - nb;\r\n      mchunkptr newtop = chunk_plus_offset(oldp, nb);\r\n      set_inuse(m, oldp, nb);\r\n      newtop->head = newtopsize |PINUSE_BIT;\r\n      m->top = newtop;\r\n      m->topsize = newtopsize;\r\n      newp = oldp;\r\n    }\r\n\r\n    if (newp != 0) {\r\n      return chunk2mem(newp);\r\n    } else {\r\n      void *newmem = lj_alloc_malloc(m, nsize);\r\n      if (newmem != 0) {\r\n\tsize_t oc = oldsize - overhead_for(oldp);\r\n\tmemcpy(newmem, ptr, oc < nsize ? oc : nsize);\r\n\tlj_alloc_free(m, ptr);\r\n      }\r\n      return newmem;\r\n    }\r\n  }\r\n}\r\n\r\nvoid *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize)\r\n{\r\n  (void)osize;\r\n  if (nsize == 0) {\r\n    return lj_alloc_free(msp, ptr);\r\n  } else if (ptr == NULL) {\r\n    return lj_alloc_malloc(msp, nsize);\r\n  } else {\r\n    return lj_alloc_realloc(msp, ptr, nsize);\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_alloc.h",
    "content": "/*\r\n** Bundled memory allocator.\r\n** Donated to the public domain.\r\n*/\r\n\r\n#ifndef _LJ_ALLOC_H\r\n#define _LJ_ALLOC_H\r\n\r\n#include \"lj_def.h\"\r\n\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\nLJ_FUNC void *lj_alloc_create(void);\r\nLJ_FUNC void lj_alloc_destroy(void *msp);\r\nLJ_FUNC void *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_api.c",
    "content": "/*\r\n** Public Lua/C API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_api_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* -- Common helper functions --------------------------------------------- */\r\n\r\n#define api_checknelems(L, n)\t\tapi_check(L, (n) <= (L->top - L->base))\r\n#define api_checkvalidindex(L, i)\tapi_check(L, (i) != niltv(L))\r\n\r\nstatic TValue *index2adr(lua_State *L, int idx)\r\n{\r\n  if (idx > 0) {\r\n    TValue *o = L->base + (idx - 1);\r\n    return o < L->top ? o : niltv(L);\r\n  } else if (idx > LUA_REGISTRYINDEX) {\r\n    api_check(L, idx != 0 && -idx <= L->top - L->base);\r\n    return L->top + idx;\r\n  } else if (idx == LUA_GLOBALSINDEX) {\r\n    TValue *o = &G(L)->tmptv;\r\n    settabV(L, o, tabref(L->env));\r\n    return o;\r\n  } else if (idx == LUA_REGISTRYINDEX) {\r\n    return registry(L);\r\n  } else {\r\n    GCfunc *fn = curr_func(L);\r\n    api_check(L, fn->c.gct == ~LJ_TFUNC && !isluafunc(fn));\r\n    if (idx == LUA_ENVIRONINDEX) {\r\n      TValue *o = &G(L)->tmptv;\r\n      settabV(L, o, tabref(fn->c.env));\r\n      return o;\r\n    } else {\r\n      idx = LUA_GLOBALSINDEX - idx;\r\n      return idx <= fn->c.nupvalues ? &fn->c.upvalue[idx-1] : niltv(L);\r\n    }\r\n  }\r\n}\r\n\r\nstatic TValue *stkindex2adr(lua_State *L, int idx)\r\n{\r\n  if (idx > 0) {\r\n    TValue *o = L->base + (idx - 1);\r\n    return o < L->top ? o : niltv(L);\r\n  } else {\r\n    api_check(L, idx != 0 && -idx <= L->top - L->base);\r\n    return L->top + idx;\r\n  }\r\n}\r\n\r\nstatic GCtab *getcurrenv(lua_State *L)\r\n{\r\n  GCfunc *fn = curr_func(L);\r\n  return fn->c.gct == ~LJ_TFUNC ? tabref(fn->c.env) : tabref(L->env);\r\n}\r\n\r\n/* -- Miscellaneous API functions ----------------------------------------- */\r\n\r\nLUA_API int lua_status(lua_State *L)\r\n{\r\n  return L->status;\r\n}\r\n\r\nLUA_API int lua_checkstack(lua_State *L, int size)\r\n{\r\n  if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK) {\r\n    return 0;  /* Stack overflow. */\r\n  } else if (size > 0) {\r\n    lj_state_checkstack(L, (MSize)size);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLUALIB_API void luaL_checkstack(lua_State *L, int size, const char *msg)\r\n{\r\n  if (!lua_checkstack(L, size))\r\n    lj_err_callerv(L, LJ_ERR_STKOVM, msg);\r\n}\r\n\r\nLUA_API void lua_xmove(lua_State *from, lua_State *to, int n)\r\n{\r\n  TValue *f, *t;\r\n  if (from == to) return;\r\n  api_checknelems(from, n);\r\n  api_check(from, G(from) == G(to));\r\n  lj_state_checkstack(to, (MSize)n);\r\n  f = from->top;\r\n  t = to->top = to->top + n;\r\n  while (--n >= 0) copyTV(to, --t, --f);\r\n  from->top = f;\r\n}\r\n\r\n/* -- Stack manipulation -------------------------------------------------- */\r\n\r\nLUA_API int lua_gettop(lua_State *L)\r\n{\r\n  return (int)(L->top - L->base);\r\n}\r\n\r\nLUA_API void lua_settop(lua_State *L, int idx)\r\n{\r\n  if (idx >= 0) {\r\n    api_check(L, idx <= tvref(L->maxstack) - L->base);\r\n    if (L->base + idx > L->top) {\r\n      if (L->base + idx >= tvref(L->maxstack))\r\n\tlj_state_growstack(L, (MSize)idx - (MSize)(L->top - L->base));\r\n      do { setnilV(L->top++); } while (L->top < L->base + idx);\r\n    } else {\r\n      L->top = L->base + idx;\r\n    }\r\n  } else {\r\n    api_check(L, -(idx+1) <= (L->top - L->base));\r\n    L->top += idx+1;  /* Shrinks top (idx < 0). */\r\n  }\r\n}\r\n\r\nLUA_API void lua_remove(lua_State *L, int idx)\r\n{\r\n  TValue *p = stkindex2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  while (++p < L->top) copyTV(L, p-1, p);\r\n  L->top--;\r\n}\r\n\r\nLUA_API void lua_insert(lua_State *L, int idx)\r\n{\r\n  TValue *q, *p = stkindex2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  for (q = L->top; q > p; q--) copyTV(L, q, q-1);\r\n  copyTV(L, p, L->top);\r\n}\r\n\r\nLUA_API void lua_replace(lua_State *L, int idx)\r\n{\r\n  api_checknelems(L, 1);\r\n  if (idx == LUA_GLOBALSINDEX) {\r\n    api_check(L, tvistab(L->top-1));\r\n    /* NOBARRIER: A thread (i.e. L) is never black. */\r\n    setgcref(L->env, obj2gco(tabV(L->top-1)));\r\n  } else if (idx == LUA_ENVIRONINDEX) {\r\n    GCfunc *fn = curr_func(L);\r\n    if (fn->c.gct != ~LJ_TFUNC)\r\n      lj_err_msg(L, LJ_ERR_NOENV);\r\n    api_check(L, tvistab(L->top-1));\r\n    setgcref(fn->c.env, obj2gco(tabV(L->top-1)));\r\n    lj_gc_barrier(L, fn, L->top-1);\r\n  } else {\r\n    TValue *o = index2adr(L, idx);\r\n    api_checkvalidindex(L, o);\r\n    copyTV(L, o, L->top-1);\r\n    if (idx < LUA_GLOBALSINDEX)  /* Need a barrier for upvalues. */\r\n      lj_gc_barrier(L, curr_func(L), L->top-1);\r\n  }\r\n  L->top--;\r\n}\r\n\r\nLUA_API void lua_pushvalue(lua_State *L, int idx)\r\n{\r\n  copyTV(L, L->top, index2adr(L, idx));\r\n  incr_top(L);\r\n}\r\n\r\n/* -- Stack getters ------------------------------------------------------- */\r\n\r\nLUA_API int lua_type(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisnumber(o)) {\r\n    return LUA_TNUMBER;\r\n#if LJ_64\r\n  } else if (tvislightud(o)) {\r\n    return LUA_TLIGHTUSERDATA;\r\n#endif\r\n  } else if (o == niltv(L)) {\r\n    return LUA_TNONE;\r\n  } else {  /* Magic internal/external tag conversion. ORDER LJ_T */\r\n    uint32_t t = ~itype(o);\r\n#if LJ_64\r\n    int tt = (int)((U64x(75a06,98042110) >> 4*t) & 15u);\r\n#else\r\n    int tt = (int)(((t < 8 ? 0x98042110u : 0x75a06u) >> 4*(t&7)) & 15u);\r\n#endif\r\n    lua_assert(tt != LUA_TNIL || tvisnil(o));\r\n    return tt;\r\n  }\r\n}\r\n\r\nLUALIB_API void luaL_checktype(lua_State *L, int idx, int tt)\r\n{\r\n  if (lua_type(L, idx) != tt)\r\n    lj_err_argt(L, idx, tt);\r\n}\r\n\r\nLUALIB_API void luaL_checkany(lua_State *L, int idx)\r\n{\r\n  if (index2adr(L, idx) == niltv(L))\r\n    lj_err_arg(L, idx, LJ_ERR_NOVAL);\r\n}\r\n\r\nLUA_API const char *lua_typename(lua_State *L, int t)\r\n{\r\n  UNUSED(L);\r\n  return lj_obj_typename[t+1];\r\n}\r\n\r\nLUA_API int lua_iscfunction(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return tvisfunc(o) && !isluafunc(funcV(o));\r\n}\r\n\r\nLUA_API int lua_isnumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  return (tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), &tmp)));\r\n}\r\n\r\nLUA_API int lua_isstring(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (tvisstr(o) || tvisnumber(o));\r\n}\r\n\r\nLUA_API int lua_isuserdata(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (tvisudata(o) || tvislightud(o));\r\n}\r\n\r\nLUA_API int lua_rawequal(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  return (o1 == niltv(L) || o2 == niltv(L)) ? 0 : lj_obj_equal(o1, o2);\r\n}\r\n\r\nLUA_API int lua_equal(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  if (tvisint(o1) && tvisint(o2)) {\r\n    return intV(o1) == intV(o2);\r\n  } else if (tvisnumber(o1) && tvisnumber(o2)) {\r\n    return numberVnum(o1) == numberVnum(o2);\r\n  } else if (itype(o1) != itype(o2)) {\r\n    return 0;\r\n  } else if (tvispri(o1)) {\r\n    return o1 != niltv(L) && o2 != niltv(L);\r\n#if LJ_64\r\n  } else if (tvislightud(o1)) {\r\n    return o1->u64 == o2->u64;\r\n#endif\r\n  } else if (gcrefeq(o1->gcr, o2->gcr)) {\r\n    return 1;\r\n  } else if (!tvistabud(o1)) {\r\n    return 0;\r\n  } else {\r\n    TValue *base = lj_meta_equal(L, gcV(o1), gcV(o2), 0);\r\n    if ((uintptr_t)base <= 1) {\r\n      return (int)(uintptr_t)base;\r\n    } else {\r\n      L->top = base+2;\r\n      lj_vm_call(L, base, 1+1);\r\n      L->top -= 2;\r\n      return tvistruecond(L->top+1);\r\n    }\r\n  }\r\n}\r\n\r\nLUA_API int lua_lessthan(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  if (o1 == niltv(L) || o2 == niltv(L)) {\r\n    return 0;\r\n  } else if (tvisint(o1) && tvisint(o2)) {\r\n    return intV(o1) < intV(o2);\r\n  } else if (tvisnumber(o1) && tvisnumber(o2)) {\r\n    return numberVnum(o1) < numberVnum(o2);\r\n  } else {\r\n    TValue *base = lj_meta_comp(L, o1, o2, 0);\r\n    if ((uintptr_t)base <= 1) {\r\n      return (int)(uintptr_t)base;\r\n    } else {\r\n      L->top = base+2;\r\n      lj_vm_call(L, base, 1+1);\r\n      L->top -= 2;\r\n      return tvistruecond(L->top+1);\r\n    }\r\n  }\r\n}\r\n\r\nLUA_API lua_Number lua_tonumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (tvisstr(o) && lj_strscan_num(strV(o), &tmp))\r\n    return numV(&tmp);\r\n  else\r\n    return 0;\r\n}\r\n\r\nLUALIB_API lua_Number luaL_checknumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (!(tvisstr(o) && lj_strscan_num(strV(o), &tmp)))\r\n    lj_err_argt(L, idx, LUA_TNUMBER);\r\n  return numV(&tmp);\r\n}\r\n\r\nLUALIB_API lua_Number luaL_optnumber(lua_State *L, int idx, lua_Number def)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (tvisnil(o))\r\n    return def;\r\n  else if (!(tvisstr(o) && lj_strscan_num(strV(o), &tmp)))\r\n    lj_err_argt(L, idx, LUA_TNUMBER);\r\n  return numV(&tmp);\r\n}\r\n\r\nLUA_API lua_Integer lua_tointeger(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      return 0;\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUALIB_API lua_Integer luaL_checkinteger(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      lj_err_argt(L, idx, LUA_TNUMBER);\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUALIB_API lua_Integer luaL_optinteger(lua_State *L, int idx, lua_Integer def)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else if (tvisnil(o)) {\r\n    return def;\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      lj_err_argt(L, idx, LUA_TNUMBER);\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUA_API int lua_toboolean(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return tvistruecond(o);\r\n}\r\n\r\nLUA_API const char *lua_tolstring(lua_State *L, int idx, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_str_fromnumber(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    if (len != NULL) *len = 0;\r\n    return NULL;\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API const char *luaL_checklstring(lua_State *L, int idx, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_str_fromnumber(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API const char *luaL_optlstring(lua_State *L, int idx,\r\n\t\t\t\t       const char *def, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnil(o)) {\r\n    if (len != NULL) *len = def ? strlen(def) : 0;\r\n    return def;\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_str_fromnumber(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API int luaL_checkoption(lua_State *L, int idx, const char *def,\r\n\t\t\t\tconst char *const lst[])\r\n{\r\n  ptrdiff_t i;\r\n  const char *s = lua_tolstring(L, idx, NULL);\r\n  if (s == NULL && (s = def) == NULL)\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  for (i = 0; lst[i]; i++)\r\n    if (strcmp(lst[i], s) == 0)\r\n      return (int)i;\r\n  lj_err_argv(L, idx, LJ_ERR_INVOPTM, s);\r\n}\r\n\r\nLUA_API size_t lua_objlen(lua_State *L, int idx)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  if (tvisstr(o)) {\r\n    return strV(o)->len;\r\n  } else if (tvistab(o)) {\r\n    return (size_t)lj_tab_len(tabV(o));\r\n  } else if (tvisudata(o)) {\r\n    return udataV(o)->len;\r\n  } else if (tvisnumber(o)) {\r\n    GCstr *s = lj_str_fromnumber(L, o);\r\n    setstrV(L, o, s);\r\n    return s->len;\r\n  } else {\r\n    return 0;\r\n  }\r\n}\r\n\r\nLUA_API lua_CFunction lua_tocfunction(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisfunc(o)) {\r\n    BCOp op = bc_op(*mref(funcV(o)->c.pc, BCIns));\r\n    if (op == BC_FUNCC || op == BC_FUNCCW)\r\n      return funcV(o)->c.f;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nLUA_API void *lua_touserdata(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisudata(o))\r\n    return uddata(udataV(o));\r\n  else if (tvislightud(o))\r\n    return lightudV(o);\r\n  else\r\n    return NULL;\r\n}\r\n\r\nLUA_API lua_State *lua_tothread(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (!tvisthread(o)) ? NULL : threadV(o);\r\n}\r\n\r\nLUA_API const void *lua_topointer(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisudata(o))\r\n    return uddata(udataV(o));\r\n  else if (tvislightud(o))\r\n    return lightudV(o);\r\n  else if (tviscdata(o))\r\n    return cdataptr(cdataV(o));\r\n  else if (tvisgcv(o))\r\n    return gcV(o);\r\n  else\r\n    return NULL;\r\n}\r\n\r\n/* -- Stack setters (object creation) ------------------------------------- */\r\n\r\nLUA_API void lua_pushnil(lua_State *L)\r\n{\r\n  setnilV(L->top);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushnumber(lua_State *L, lua_Number n)\r\n{\r\n  setnumV(L->top, n);\r\n  if (LJ_UNLIKELY(tvisnan(L->top)))\r\n    setnanV(L->top);  /* Canonicalize injected NaNs. */\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushinteger(lua_State *L, lua_Integer n)\r\n{\r\n  setintptrV(L->top, n);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushlstring(lua_State *L, const char *str, size_t len)\r\n{\r\n  GCstr *s;\r\n  lj_gc_check(L);\r\n  s = lj_str_new(L, str, len);\r\n  setstrV(L, L->top, s);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushstring(lua_State *L, const char *str)\r\n{\r\n  if (str == NULL) {\r\n    setnilV(L->top);\r\n  } else {\r\n    GCstr *s;\r\n    lj_gc_check(L);\r\n    s = lj_str_newz(L, str);\r\n    setstrV(L, L->top, s);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API const char *lua_pushvfstring(lua_State *L, const char *fmt,\r\n\t\t\t\t     va_list argp)\r\n{\r\n  lj_gc_check(L);\r\n  return lj_str_pushvf(L, fmt, argp);\r\n}\r\n\r\nLUA_API const char *lua_pushfstring(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *ret;\r\n  va_list argp;\r\n  lj_gc_check(L);\r\n  va_start(argp, fmt);\r\n  ret = lj_str_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  return ret;\r\n}\r\n\r\nLUA_API void lua_pushcclosure(lua_State *L, lua_CFunction f, int n)\r\n{\r\n  GCfunc *fn;\r\n  lj_gc_check(L);\r\n  api_checknelems(L, n);\r\n  fn = lj_func_newC(L, (MSize)n, getcurrenv(L));\r\n  fn->c.f = f;\r\n  L->top -= n;\r\n  while (n--)\r\n    copyTV(L, &fn->c.upvalue[n], L->top+n);\r\n  setfuncV(L, L->top, fn);\r\n  lua_assert(iswhite(obj2gco(fn)));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushboolean(lua_State *L, int b)\r\n{\r\n  setboolV(L->top, (b != 0));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushlightuserdata(lua_State *L, void *p)\r\n{\r\n  setlightudV(L->top, checklightudptr(L, p));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_createtable(lua_State *L, int narray, int nrec)\r\n{\r\n  GCtab *t;\r\n  lj_gc_check(L);\r\n  t = lj_tab_new(L, (uint32_t)(narray > 0 ? narray+1 : 0), hsize2hbits(nrec));\r\n  settabV(L, L->top, t);\r\n  incr_top(L);\r\n}\r\n\r\nLUALIB_API int luaL_newmetatable(lua_State *L, const char *tname)\r\n{\r\n  GCtab *regt = tabV(registry(L));\r\n  TValue *tv = lj_tab_setstr(L, regt, lj_str_newz(L, tname));\r\n  if (tvisnil(tv)) {\r\n    GCtab *mt = lj_tab_new(L, 0, 1);\r\n    settabV(L, tv, mt);\r\n    settabV(L, L->top++, mt);\r\n    lj_gc_anybarriert(L, regt);\r\n    return 1;\r\n  } else {\r\n    copyTV(L, L->top++, tv);\r\n    return 0;\r\n  }\r\n}\r\n\r\nLUA_API int lua_pushthread(lua_State *L)\r\n{\r\n  setthreadV(L, L->top, L);\r\n  incr_top(L);\r\n  return (mainthread(G(L)) == L);\r\n}\r\n\r\nLUA_API lua_State *lua_newthread(lua_State *L)\r\n{\r\n  lua_State *L1;\r\n  lj_gc_check(L);\r\n  L1 = lj_state_new(L);\r\n  setthreadV(L, L->top, L1);\r\n  incr_top(L);\r\n  return L1;\r\n}\r\n\r\nLUA_API void *lua_newuserdata(lua_State *L, size_t size)\r\n{\r\n  GCudata *ud;\r\n  lj_gc_check(L);\r\n  if (size > LJ_MAX_UDATA)\r\n    lj_err_msg(L, LJ_ERR_UDATAOV);\r\n  ud = lj_udata_new(L, (MSize)size, getcurrenv(L));\r\n  setudataV(L, L->top, ud);\r\n  incr_top(L);\r\n  return uddata(ud);\r\n}\r\n\r\nLUA_API void lua_concat(lua_State *L, int n)\r\n{\r\n  api_checknelems(L, n);\r\n  if (n >= 2) {\r\n    n--;\r\n    do {\r\n      TValue *top = lj_meta_cat(L, L->top-1, -n);\r\n      if (top == NULL) {\r\n\tL->top -= n;\r\n\tbreak;\r\n      }\r\n      n -= (int)(L->top - top);\r\n      L->top = top+2;\r\n      lj_vm_call(L, top, 1+1);\r\n      L->top--;\r\n      copyTV(L, L->top-1, L->top);\r\n    } while (--n > 0);\r\n  } else if (n == 0) {  /* Push empty string. */\r\n    setstrV(L, L->top, &G(L)->strempty);\r\n    incr_top(L);\r\n  }\r\n  /* else n == 1: nothing to do. */\r\n}\r\n\r\n/* -- Object getters ------------------------------------------------------ */\r\n\r\nLUA_API void lua_gettable(lua_State *L, int idx)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  v = lj_meta_tget(L, t, L->top-1);\r\n  if (v == NULL) {\r\n    L->top += 2;\r\n    lj_vm_call(L, L->top-2, 1+1);\r\n    L->top -= 2;\r\n    v = L->top+1;\r\n  }\r\n  copyTV(L, L->top-1, v);\r\n}\r\n\r\nLUA_API void lua_getfield(lua_State *L, int idx, const char *k)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  TValue key;\r\n  api_checkvalidindex(L, t);\r\n  setstrV(L, &key, lj_str_newz(L, k));\r\n  v = lj_meta_tget(L, t, &key);\r\n  if (v == NULL) {\r\n    L->top += 2;\r\n    lj_vm_call(L, L->top-2, 1+1);\r\n    L->top -= 2;\r\n    v = L->top+1;\r\n  }\r\n  copyTV(L, L->top, v);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_rawget(lua_State *L, int idx)\r\n{\r\n  cTValue *t = index2adr(L, idx);\r\n  api_check(L, tvistab(t));\r\n  copyTV(L, L->top-1, lj_tab_get(L, tabV(t), L->top-1));\r\n}\r\n\r\nLUA_API void lua_rawgeti(lua_State *L, int idx, int n)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  api_check(L, tvistab(t));\r\n  v = lj_tab_getint(tabV(t), n);\r\n  if (v) {\r\n    copyTV(L, L->top, v);\r\n  } else {\r\n    setnilV(L->top);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API int lua_getmetatable(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  GCtab *mt = NULL;\r\n  if (tvistab(o))\r\n    mt = tabref(tabV(o)->metatable);\r\n  else if (tvisudata(o))\r\n    mt = tabref(udataV(o)->metatable);\r\n  else\r\n    mt = tabref(basemt_obj(G(L), o));\r\n  if (mt == NULL)\r\n    return 0;\r\n  settabV(L, L->top, mt);\r\n  incr_top(L);\r\n  return 1;\r\n}\r\n\r\nLUALIB_API int luaL_getmetafield(lua_State *L, int idx, const char *field)\r\n{\r\n  if (lua_getmetatable(L, idx)) {\r\n    cTValue *tv = lj_tab_getstr(tabV(L->top-1), lj_str_newz(L, field));\r\n    if (tv && !tvisnil(tv)) {\r\n      copyTV(L, L->top-1, tv);\r\n      return 1;\r\n    }\r\n    L->top--;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLUA_API void lua_getfenv(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  api_checkvalidindex(L, o);\r\n  if (tvisfunc(o)) {\r\n    settabV(L, L->top, tabref(funcV(o)->c.env));\r\n  } else if (tvisudata(o)) {\r\n    settabV(L, L->top, tabref(udataV(o)->env));\r\n  } else if (tvisthread(o)) {\r\n    settabV(L, L->top, tabref(threadV(o)->env));\r\n  } else {\r\n    setnilV(L->top);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API int lua_next(lua_State *L, int idx)\r\n{\r\n  cTValue *t = index2adr(L, idx);\r\n  int more;\r\n  api_check(L, tvistab(t));\r\n  more = lj_tab_next(L, tabV(t), L->top-1);\r\n  if (more) {\r\n    incr_top(L);  /* Return new key and value slot. */\r\n  } else {  /* End of traversal. */\r\n    L->top--;  /* Remove key slot. */\r\n  }\r\n  return more;\r\n}\r\n\r\nLUA_API const char *lua_getupvalue(lua_State *L, int idx, int n)\r\n{\r\n  TValue *val;\r\n  const char *name = lj_debug_uvnamev(index2adr(L, idx), (uint32_t)(n-1), &val);\r\n  if (name) {\r\n    copyTV(L, L->top, val);\r\n    incr_top(L);\r\n  }\r\n  return name;\r\n}\r\n\r\nLUA_API void *lua_upvalueid(lua_State *L, int idx, int n)\r\n{\r\n  GCfunc *fn = funcV(index2adr(L, idx));\r\n  n--;\r\n  api_check(L, (uint32_t)n < fn->l.nupvalues);\r\n  return isluafunc(fn) ? (void *)gcref(fn->l.uvptr[n]) :\r\n\t\t\t (void *)&fn->c.upvalue[n];\r\n}\r\n\r\nLUA_API void lua_upvaluejoin(lua_State *L, int idx1, int n1, int idx2, int n2)\r\n{\r\n  GCfunc *fn1 = funcV(index2adr(L, idx1));\r\n  GCfunc *fn2 = funcV(index2adr(L, idx2));\r\n  n1--; n2--;\r\n  api_check(L, isluafunc(fn1) && (uint32_t)n1 < fn1->l.nupvalues);\r\n  api_check(L, isluafunc(fn2) && (uint32_t)n2 < fn2->l.nupvalues);\r\n  setgcrefr(fn1->l.uvptr[n1], fn2->l.uvptr[n2]);\r\n  lj_gc_objbarrier(L, fn1, gcref(fn1->l.uvptr[n1]));\r\n}\r\n\r\nLUALIB_API void *luaL_checkudata(lua_State *L, int idx, const char *tname)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisudata(o)) {\r\n    GCudata *ud = udataV(o);\r\n    cTValue *tv = lj_tab_getstr(tabV(registry(L)), lj_str_newz(L, tname));\r\n    if (tv && tvistab(tv) && tabV(tv) == tabref(ud->metatable))\r\n      return uddata(ud);\r\n  }\r\n  lj_err_argtype(L, idx, tname);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\n/* -- Object setters ------------------------------------------------------ */\r\n\r\nLUA_API void lua_settable(lua_State *L, int idx)\r\n{\r\n  TValue *o;\r\n  cTValue *t = index2adr(L, idx);\r\n  api_checknelems(L, 2);\r\n  api_checkvalidindex(L, t);\r\n  o = lj_meta_tset(L, t, L->top-2);\r\n  if (o) {\r\n    /* NOBARRIER: lj_meta_tset ensures the table is not black. */\r\n    copyTV(L, o, L->top-1);\r\n    L->top -= 2;\r\n  } else {\r\n    L->top += 3;\r\n    copyTV(L, L->top-1, L->top-6);\r\n    lj_vm_call(L, L->top-3, 0+1);\r\n    L->top -= 3;\r\n  }\r\n}\r\n\r\nLUA_API void lua_setfield(lua_State *L, int idx, const char *k)\r\n{\r\n  TValue *o;\r\n  TValue key;\r\n  cTValue *t = index2adr(L, idx);\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, t);\r\n  setstrV(L, &key, lj_str_newz(L, k));\r\n  o = lj_meta_tset(L, t, &key);\r\n  if (o) {\r\n    L->top--;\r\n    /* NOBARRIER: lj_meta_tset ensures the table is not black. */\r\n    copyTV(L, o, L->top);\r\n  } else {\r\n    L->top += 3;\r\n    copyTV(L, L->top-1, L->top-6);\r\n    lj_vm_call(L, L->top-3, 0+1);\r\n    L->top -= 2;\r\n  }\r\n}\r\n\r\nLUA_API void lua_rawset(lua_State *L, int idx)\r\n{\r\n  GCtab *t = tabV(index2adr(L, idx));\r\n  TValue *dst, *key;\r\n  api_checknelems(L, 2);\r\n  key = L->top-2;\r\n  dst = lj_tab_set(L, t, key);\r\n  copyTV(L, dst, key+1);\r\n  lj_gc_anybarriert(L, t);\r\n  L->top = key;\r\n}\r\n\r\nLUA_API void lua_rawseti(lua_State *L, int idx, int n)\r\n{\r\n  GCtab *t = tabV(index2adr(L, idx));\r\n  TValue *dst, *src;\r\n  api_checknelems(L, 1);\r\n  dst = lj_tab_setint(L, t, n);\r\n  src = L->top-1;\r\n  copyTV(L, dst, src);\r\n  lj_gc_barriert(L, t, dst);\r\n  L->top = src;\r\n}\r\n\r\nLUA_API int lua_setmetatable(lua_State *L, int idx)\r\n{\r\n  global_State *g;\r\n  GCtab *mt;\r\n  cTValue *o = index2adr(L, idx);\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, o);\r\n  if (tvisnil(L->top-1)) {\r\n    mt = NULL;\r\n  } else {\r\n    api_check(L, tvistab(L->top-1));\r\n    mt = tabV(L->top-1);\r\n  }\r\n  g = G(L);\r\n  if (tvistab(o)) {\r\n    setgcref(tabV(o)->metatable, obj2gco(mt));\r\n    if (mt)\r\n      lj_gc_objbarriert(L, tabV(o), mt);\r\n  } else if (tvisudata(o)) {\r\n    setgcref(udataV(o)->metatable, obj2gco(mt));\r\n    if (mt)\r\n      lj_gc_objbarrier(L, udataV(o), mt);\r\n  } else {\r\n    /* Flush cache, since traces specialize to basemt. But not during __gc. */\r\n    if (lj_trace_flushall(L))\r\n      lj_err_caller(L, LJ_ERR_NOGCMM);\r\n    if (tvisbool(o)) {\r\n      /* NOBARRIER: basemt is a GC root. */\r\n      setgcref(basemt_it(g, LJ_TTRUE), obj2gco(mt));\r\n      setgcref(basemt_it(g, LJ_TFALSE), obj2gco(mt));\r\n    } else {\r\n      /* NOBARRIER: basemt is a GC root. */\r\n      setgcref(basemt_obj(g, o), obj2gco(mt));\r\n    }\r\n  }\r\n  L->top--;\r\n  return 1;\r\n}\r\n\r\nLUA_API int lua_setfenv(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  GCtab *t;\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, o);\r\n  api_check(L, tvistab(L->top-1));\r\n  t = tabV(L->top-1);\r\n  if (tvisfunc(o)) {\r\n    setgcref(funcV(o)->c.env, obj2gco(t));\r\n  } else if (tvisudata(o)) {\r\n    setgcref(udataV(o)->env, obj2gco(t));\r\n  } else if (tvisthread(o)) {\r\n    setgcref(threadV(o)->env, obj2gco(t));\r\n  } else {\r\n    L->top--;\r\n    return 0;\r\n  }\r\n  lj_gc_objbarrier(L, gcV(o), t);\r\n  L->top--;\r\n  return 1;\r\n}\r\n\r\nLUA_API const char *lua_setupvalue(lua_State *L, int idx, int n)\r\n{\r\n  cTValue *f = index2adr(L, idx);\r\n  TValue *val;\r\n  const char *name;\r\n  api_checknelems(L, 1);\r\n  name = lj_debug_uvnamev(f, (uint32_t)(n-1), &val);\r\n  if (name) {\r\n    L->top--;\r\n    copyTV(L, val, L->top);\r\n    lj_gc_barrier(L, funcV(f), L->top);\r\n  }\r\n  return name;\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\nLUA_API void lua_call(lua_State *L, int nargs, int nresults)\r\n{\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  api_checknelems(L, nargs+1);\r\n  lj_vm_call(L, L->top - nargs, nresults+1);\r\n}\r\n\r\nLUA_API int lua_pcall(lua_State *L, int nargs, int nresults, int errfunc)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldh = hook_save(g);\r\n  ptrdiff_t ef;\r\n  int status;\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  api_checknelems(L, nargs+1);\r\n  if (errfunc == 0) {\r\n    ef = 0;\r\n  } else {\r\n    cTValue *o = stkindex2adr(L, errfunc);\r\n    api_checkvalidindex(L, o);\r\n    ef = savestack(L, o);\r\n  }\r\n  status = lj_vm_pcall(L, L->top - nargs, nresults+1, ef);\r\n  if (status) hook_restore(g, oldh);\r\n  return status;\r\n}\r\n\r\nstatic TValue *cpcall(lua_State *L, lua_CFunction func, void *ud)\r\n{\r\n  GCfunc *fn = lj_func_newC(L, 0, getcurrenv(L));\r\n  fn->c.f = func;\r\n  setfuncV(L, L->top, fn);\r\n  setlightudV(L->top+1, checklightudptr(L, ud));\r\n  cframe_nres(L->cframe) = 1+0;  /* Zero results. */\r\n  L->top += 2;\r\n  return L->top-1;  /* Now call the newly allocated C function. */\r\n}\r\n\r\nLUA_API int lua_cpcall(lua_State *L, lua_CFunction func, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldh = hook_save(g);\r\n  int status;\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  status = lj_vm_cpcall(L, func, ud, cpcall);\r\n  if (status) hook_restore(g, oldh);\r\n  return status;\r\n}\r\n\r\nLUALIB_API int luaL_callmeta(lua_State *L, int idx, const char *field)\r\n{\r\n  if (luaL_getmetafield(L, idx, field)) {\r\n    TValue *base = L->top--;\r\n    copyTV(L, base, index2adr(L, idx));\r\n    L->top = base+1;\r\n    lj_vm_call(L, base, 1+1);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Coroutine yield and resume ------------------------------------------ */\r\n\r\nLUA_API int lua_yield(lua_State *L, int nresults)\r\n{\r\n  void *cf = L->cframe;\r\n  global_State *g = G(L);\r\n  if (cframe_canyield(cf)) {\r\n    cf = cframe_raw(cf);\r\n    if (!hook_active(g)) {  /* Regular yield: move results down if needed. */\r\n      cTValue *f = L->top - nresults;\r\n      if (f > L->base) {\r\n\tTValue *t = L->base;\r\n\twhile (--nresults >= 0) copyTV(L, t++, f++);\r\n\tL->top = t;\r\n      }\r\n      L->cframe = NULL;\r\n      L->status = LUA_YIELD;\r\n      return -1;\r\n    } else {  /* Yield from hook: add a pseudo-frame. */\r\n      TValue *top = L->top;\r\n      hook_leave(g);\r\n      top->u64 = cframe_multres(cf);\r\n      setcont(top+1, lj_cont_hook);\r\n      setframe_pc(top+1, cframe_pc(cf)-1);\r\n      setframe_gc(top+2, obj2gco(L));\r\n      setframe_ftsz(top+2, (int)((char *)(top+3)-(char *)L->base)+FRAME_CONT);\r\n      L->top = L->base = top+3;\r\n#if LJ_TARGET_X64\r\n      lj_err_throw(L, LUA_YIELD);\r\n#else\r\n      L->cframe = NULL;\r\n      L->status = LUA_YIELD;\r\n      lj_vm_unwind_c(cf, LUA_YIELD);\r\n#endif\r\n    }\r\n  }\r\n  lj_err_msg(L, LJ_ERR_CYIELD);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUA_API int lua_resume(lua_State *L, int nargs)\r\n{\r\n  if (L->cframe == NULL && L->status <= LUA_YIELD)\r\n    return lj_vm_resume(L, L->top - nargs, 0, 0);\r\n  L->top = L->base;\r\n  setstrV(L, L->top, lj_err_str(L, LJ_ERR_COSUSP));\r\n  incr_top(L);\r\n  return LUA_ERRRUN;\r\n}\r\n\r\n/* -- GC and memory management -------------------------------------------- */\r\n\r\nLUA_API int lua_gc(lua_State *L, int what, int data)\r\n{\r\n  global_State *g = G(L);\r\n  int res = 0;\r\n  switch (what) {\r\n  case LUA_GCSTOP:\r\n    g->gc.threshold = LJ_MAX_MEM;\r\n    break;\r\n  case LUA_GCRESTART:\r\n    g->gc.threshold = data == -1 ? (g->gc.total/100)*g->gc.pause : g->gc.total;\r\n    break;\r\n  case LUA_GCCOLLECT:\r\n    lj_gc_fullgc(L);\r\n    break;\r\n  case LUA_GCCOUNT:\r\n    res = (int)(g->gc.total >> 10);\r\n    break;\r\n  case LUA_GCCOUNTB:\r\n    res = (int)(g->gc.total & 0x3ff);\r\n    break;\r\n  case LUA_GCSTEP: {\r\n    MSize a = (MSize)data << 10;\r\n    g->gc.threshold = (a <= g->gc.total) ? (g->gc.total - a) : 0;\r\n    while (g->gc.total >= g->gc.threshold)\r\n      if (lj_gc_step(L) > 0) {\r\n\tres = 1;\r\n\tbreak;\r\n      }\r\n    break;\r\n  }\r\n  case LUA_GCSETPAUSE:\r\n    res = (int)(g->gc.pause);\r\n    g->gc.pause = (MSize)data;\r\n    break;\r\n  case LUA_GCSETSTEPMUL:\r\n    res = (int)(g->gc.stepmul);\r\n    g->gc.stepmul = (MSize)data;\r\n    break;\r\n  default:\r\n    res = -1;  /* Invalid option. */\r\n  }\r\n  return res;\r\n}\r\n\r\nLUA_API lua_Alloc lua_getallocf(lua_State *L, void **ud)\r\n{\r\n  global_State *g = G(L);\r\n  if (ud) *ud = g->allocd;\r\n  return g->allocf;\r\n}\r\n\r\nLUA_API void lua_setallocf(lua_State *L, lua_Alloc f, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  g->allocd = ud;\r\n  g->allocf = f;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_arch.h",
    "content": "/*\r\n** Target architecture selection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ARCH_H\r\n#define _LJ_ARCH_H\r\n\r\n#include \"lua.h\"\r\n\r\n/* Target endianess. */\r\n#define LUAJIT_LE\t0\r\n#define LUAJIT_BE\t1\r\n\r\n/* Target architectures. */\r\n#define LUAJIT_ARCH_X86\t\t1\r\n#define LUAJIT_ARCH_x86\t\t1\r\n#define LUAJIT_ARCH_X64\t\t2\r\n#define LUAJIT_ARCH_x64\t\t2\r\n#define LUAJIT_ARCH_ARM\t\t3\r\n#define LUAJIT_ARCH_arm\t\t3\r\n#define LUAJIT_ARCH_PPC\t\t4\r\n#define LUAJIT_ARCH_ppc\t\t4\r\n#define LUAJIT_ARCH_PPCSPE\t5\r\n#define LUAJIT_ARCH_ppcspe\t5\r\n#define LUAJIT_ARCH_MIPS\t6\r\n#define LUAJIT_ARCH_mips\t6\r\n\r\n/* Target OS. */\r\n#define LUAJIT_OS_OTHER\t\t0\r\n#define LUAJIT_OS_WINDOWS\t1\r\n#define LUAJIT_OS_LINUX\t\t2\r\n#define LUAJIT_OS_OSX\t\t3\r\n#define LUAJIT_OS_BSD\t\t4\r\n#define LUAJIT_OS_POSIX\t\t5\r\n\r\n/* Select native target if no target defined. */\r\n#ifndef LUAJIT_TARGET\r\n\r\n#if defined(__i386) || defined(__i386__) || defined(_M_IX86)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_X86\r\n#elif defined(__x86_64__) || defined(__x86_64) || defined(_M_X64) || defined(_M_AMD64)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_X64\r\n#elif defined(__arm__) || defined(__arm) || defined(__ARM__) || defined(__ARM)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_ARM\r\n#elif defined(__ppc__) || defined(__ppc) || defined(__PPC__) || defined(__PPC) || defined(__powerpc__) || defined(__powerpc) || defined(__POWERPC__) || defined(__POWERPC) || defined(_M_PPC)\r\n#ifdef __NO_FPRS__\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_PPCSPE\r\n#else\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_PPC\r\n#endif\r\n#elif defined(__mips__) || defined(__mips) || defined(__MIPS__) || defined(__MIPS)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_MIPS\r\n#else\r\n#error \"No support for this architecture (yet)\"\r\n#endif\r\n\r\n#endif\r\n\r\n/* Select native OS if no target OS defined. */\r\n#ifndef LUAJIT_OS\r\n\r\n#if defined(_WIN32) && !defined(_XBOX_VER)\r\n#define LUAJIT_OS\tLUAJIT_OS_WINDOWS\r\n#elif defined(__linux__)\r\n#define LUAJIT_OS\tLUAJIT_OS_LINUX\r\n#elif defined(__MACH__) && defined(__APPLE__)\r\n#define LUAJIT_OS\tLUAJIT_OS_OSX\r\n#elif (defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || \\\r\n       defined(__NetBSD__) || defined(__OpenBSD__) || \\\r\n       defined(__DragonFly__)) && !defined(__ORBIS__)\r\n#define LUAJIT_OS\tLUAJIT_OS_BSD\r\n#elif (defined(__sun__) && defined(__svr4__)) || defined(__CYGWIN__)\r\n#define LUAJIT_OS\tLUAJIT_OS_POSIX\r\n#else\r\n#define LUAJIT_OS\tLUAJIT_OS_OTHER\r\n#endif\r\n\r\n#endif\r\n\r\n/* Set target OS properties. */\r\n#if LUAJIT_OS == LUAJIT_OS_WINDOWS\r\n#define LJ_OS_NAME\t\"Windows\"\r\n#elif LUAJIT_OS == LUAJIT_OS_LINUX\r\n#define LJ_OS_NAME\t\"Linux\"\r\n#elif LUAJIT_OS == LUAJIT_OS_OSX\r\n#define LJ_OS_NAME\t\"OSX\"\r\n#elif LUAJIT_OS == LUAJIT_OS_BSD\r\n#define LJ_OS_NAME\t\"BSD\"\r\n#elif LUAJIT_OS == LUAJIT_OS_POSIX\r\n#define LJ_OS_NAME\t\"POSIX\"\r\n#else\r\n#define LJ_OS_NAME\t\"Other\"\r\n#endif\r\n\r\n#define LJ_TARGET_WINDOWS\t(LUAJIT_OS == LUAJIT_OS_WINDOWS)\r\n#define LJ_TARGET_LINUX\t\t(LUAJIT_OS == LUAJIT_OS_LINUX)\r\n#define LJ_TARGET_OSX\t\t(LUAJIT_OS == LUAJIT_OS_OSX)\r\n#define LJ_TARGET_IOS\t\t(LJ_TARGET_OSX && LUAJIT_TARGET == LUAJIT_ARCH_ARM)\r\n#define LJ_TARGET_POSIX\t\t(LUAJIT_OS > LUAJIT_OS_WINDOWS)\r\n#define LJ_TARGET_DLOPEN\tLJ_TARGET_POSIX\r\n\r\n#ifdef __CELLOS_LV2__\r\n#define LJ_TARGET_PS3\t\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#ifdef __ORBIS__\r\n#define LJ_TARGET_PS4\t\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#undef NULL\r\n#define NULL ((void*)0)\r\n#endif\r\n\r\n#ifdef __psp2__\r\n#define LJ_TARGET_PSVITA\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#if _XBOX_VER >= 200\r\n#define LJ_TARGET_XBOX360\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#define LJ_NUMMODE_SINGLE\t0\t/* Single-number mode only. */\r\n#define LJ_NUMMODE_SINGLE_DUAL\t1\t/* Default to single-number mode. */\r\n#define LJ_NUMMODE_DUAL\t\t2\t/* Dual-number mode only. */\r\n#define LJ_NUMMODE_DUAL_SINGLE\t3\t/* Default to dual-number mode. */\r\n\r\n/* Set target architecture properties. */\r\n#if LUAJIT_TARGET == LUAJIT_ARCH_X86\r\n\r\n#define LJ_ARCH_NAME\t\t\"x86\"\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#if LJ_TARGET_WINDOWS || __CYGWIN__\r\n#define LJ_ABI_WIN\t\t1\r\n#else\r\n#define LJ_ABI_WIN\t\t0\r\n#endif\r\n#define LJ_TARGET_X86\t\t1\r\n#define LJ_TARGET_X86ORX64\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNALIGNED\t1\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE_DUAL\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_X64\r\n\r\n#define LJ_ARCH_NAME\t\t\"x64\"\r\n#define LJ_ARCH_BITS\t\t64\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#define LJ_ABI_WIN\t\tLJ_TARGET_WINDOWS\r\n#define LJ_TARGET_X64\t\t1\r\n#define LJ_TARGET_X86ORX64\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_JUMPRANGE\t31\t/* +-2^31 = +-2GB */\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNALIGNED\t1\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE_DUAL\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_ARM\r\n\r\n#define LJ_ARCH_NAME\t\t\"arm\"\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#if !defined(LJ_ARCH_HASFPU) && __SOFTFP__\r\n#define LJ_ARCH_HASFPU\t\t0\r\n#endif\r\n#if !defined(LJ_ABI_SOFTFP) && !__ARM_PCS_VFP\r\n#define LJ_ABI_SOFTFP\t\t1\r\n#endif\r\n#define LJ_ABI_EABI\t\t1\r\n#define LJ_TARGET_ARM\t\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_JUMPRANGE\t25\t/* +-2^25 = +-32MB */\r\n#define LJ_TARGET_MASKSHIFT\t0\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t2\t/* Want only IR_BROR. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_DUAL\r\n\r\n#if __ARM_ARCH____ARM_ARCH_8__ || __ARM_ARCH_8A__\r\n#define LJ_ARCH_VERSION\t\t80\r\n#elif __ARM_ARCH_7__ || __ARM_ARCH_7A__ || __ARM_ARCH_7R__ || __ARM_ARCH_7S__ || __ARM_ARCH_7VE__\r\n#define LJ_ARCH_VERSION\t\t70\r\n#elif __ARM_ARCH_6T2__\r\n#define LJ_ARCH_VERSION\t\t61\r\n#elif __ARM_ARCH_6__ || __ARM_ARCH_6J__ || __ARM_ARCH_6K__ || __ARM_ARCH_6Z__ || __ARM_ARCH_6ZK__\r\n#define LJ_ARCH_VERSION\t\t60\r\n#else\r\n#define LJ_ARCH_VERSION\t\t50\r\n#endif\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_PPC\r\n\r\n#define LJ_ARCH_NAME\t\t\"ppc\"\r\n#if _LP64\r\n#define LJ_ARCH_BITS\t\t64\r\n#else\r\n#define LJ_ARCH_BITS\t\t32\r\n#endif\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_BE\r\n#define LJ_TARGET_PPC\t\t1\r\n#define LJ_TARGET_EHRETREG\t3\r\n#define LJ_TARGET_JUMPRANGE\t25\t/* +-2^25 = +-32MB */\r\n#define LJ_TARGET_MASKSHIFT\t0\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t1\t/* Want only IR_BROL. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_DUAL_SINGLE\r\n\r\n#if _ARCH_PWR7\r\n#define LJ_ARCH_VERSION\t\t70\r\n#elif _ARCH_PWR6\r\n#define LJ_ARCH_VERSION\t\t60\r\n#elif _ARCH_PWR5X\r\n#define LJ_ARCH_VERSION\t\t51\r\n#elif _ARCH_PWR5\r\n#define LJ_ARCH_VERSION\t\t50\r\n#elif _ARCH_PWR4\r\n#define LJ_ARCH_VERSION\t\t40\r\n#else\r\n#define LJ_ARCH_VERSION\t\t0\r\n#endif\r\n#if __PPC64__ || __powerpc64__ || LJ_TARGET_CONSOLE\r\n#define LJ_ARCH_PPC64\t\t1\r\n#define LJ_ARCH_NOFFI\t\t1\r\n#endif\r\n#if _ARCH_PPCSQ\r\n#define LJ_ARCH_SQRT\t\t1\r\n#endif\r\n#if _ARCH_PWR5X\r\n#define LJ_ARCH_ROUND\t\t1\r\n#endif\r\n#if __PPU__\r\n#define LJ_ARCH_CELL\t\t1\r\n#endif\r\n#if LJ_TARGET_XBOX360\r\n#define LJ_ARCH_XENON\t\t1\r\n#endif\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_PPCSPE\r\n\r\n#define LJ_ARCH_NAME\t\t\"ppcspe\"\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_BE\r\n#ifndef LJ_ABI_SOFTFP\r\n#define LJ_ABI_SOFTFP\t\t1\r\n#endif\r\n#define LJ_ABI_EABI\t\t1\r\n#define LJ_TARGET_PPCSPE\t1\r\n#define LJ_TARGET_EHRETREG\t3\r\n#define LJ_TARGET_JUMPRANGE\t25\t/* +-2^25 = +-32MB */\r\n#define LJ_TARGET_MASKSHIFT\t0\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t1\t/* Want only IR_BROL. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE\r\n#define LJ_ARCH_NOFFI\t\t1\t/* NYI: comparisons, calls. */\r\n#define LJ_ARCH_NOJIT\t\t1\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_MIPS\r\n\r\n#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL)\r\n#define LJ_ARCH_NAME\t\t\"mipsel\"\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#else\r\n#define LJ_ARCH_NAME\t\t\"mips\"\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_BE\r\n#endif\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_TARGET_MIPS\t\t1\r\n#define LJ_TARGET_EHRETREG\t4\r\n#define LJ_TARGET_JUMPRANGE\t27\t/* 2*2^27 = 256MB-aligned region */\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t2\t/* Want only IR_BROR. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE\r\n\r\n#if _MIPS_ARCH_MIPS32R2\r\n#define LJ_ARCH_VERSION\t\t20\r\n#else\r\n#define LJ_ARCH_VERSION\t\t10\r\n#endif\r\n\r\n#else\r\n#error \"No target architecture defined\"\r\n#endif\r\n\r\n#ifndef LJ_PAGESIZE\r\n#define LJ_PAGESIZE\t\t4096\r\n#endif\r\n\r\n/* Check for minimum required compiler versions. */\r\n#if defined(__GNUC__)\r\n#if LJ_TARGET_X86\r\n#if (__GNUC__ < 3) || ((__GNUC__ == 3) && __GNUC_MINOR__ < 4)\r\n#error \"Need at least GCC 3.4 or newer\"\r\n#endif\r\n#elif LJ_TARGET_X64\r\n#if __GNUC__ < 4\r\n#error \"Need at least GCC 4.0 or newer\"\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if (__GNUC__ < 4) || ((__GNUC__ == 4) && __GNUC_MINOR__ < 2)\r\n#error \"Need at least GCC 4.2 or newer\"\r\n#endif\r\n#elif !LJ_TARGET_PS3\r\n#if (__GNUC__ < 4) || ((__GNUC__ == 4) && __GNUC_MINOR__ < 3)\r\n#error \"Need at least GCC 4.3 or newer\"\r\n#endif\r\n#endif\r\n#endif\r\n\r\n/* Check target-specific constraints. */\r\n#ifndef _BUILDVM_H\r\n#if LJ_TARGET_X64\r\n#if __USING_SJLJ_EXCEPTIONS__\r\n#error \"Need a C compiler with native exception handling on x64\"\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if defined(__ARMEB__)\r\n#error \"No support for big-endian ARM\"\r\n#endif\r\n#if __ARM_ARCH_6M__ || __ARM_ARCH_7M__ || __ARM_ARCH_7EM__\r\n#error \"No support for Cortex-M CPUs\"\r\n#endif\r\n#if !(__ARM_EABI__ || LJ_TARGET_IOS)\r\n#error \"Only ARM EABI or iOS 3.0+ ABI is supported\"\r\n#endif\r\n#elif LJ_TARGET_PPC || LJ_TARGET_PPCSPE\r\n#if defined(_SOFT_FLOAT) || defined(_SOFT_DOUBLE)\r\n#error \"No support for PowerPC CPUs without double-precision FPU\"\r\n#endif\r\n#if defined(_LITTLE_ENDIAN)\r\n#error \"No support for little-endian PowerPC\"\r\n#endif\r\n#if defined(_LP64)\r\n#error \"No support for PowerPC 64 bit mode\"\r\n#endif\r\n#elif LJ_TARGET_MIPS\r\n#if defined(__mips_soft_float)\r\n#error \"No support for MIPS CPUs without FPU\"\r\n#endif\r\n#if defined(_LP64)\r\n#error \"No support for MIPS64\"\r\n#endif\r\n#endif\r\n#endif\r\n\r\n/* Enable or disable the dual-number mode for the VM. */\r\n#if (LJ_ARCH_NUMMODE == LJ_NUMMODE_SINGLE && LUAJIT_NUMMODE == 2) || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL && LUAJIT_NUMMODE == 1)\r\n#error \"No support for this number mode on this architecture\"\r\n#endif\r\n#if LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL_SINGLE && LUAJIT_NUMMODE != 1) || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_SINGLE_DUAL && LUAJIT_NUMMODE == 2)\r\n#define LJ_DUALNUM\t\t1\r\n#else\r\n#define LJ_DUALNUM\t\t0\r\n#endif\r\n\r\n#if LJ_TARGET_IOS || LJ_TARGET_CONSOLE\r\n/* Runtime code generation is restricted on iOS. Complain to Apple, not me. */\r\n/* Ditto for the consoles. Complain to Sony or MS, not me. */\r\n#ifndef LUAJIT_ENABLE_JIT\r\n#define LJ_OS_NOJIT\t\t1\r\n#endif\r\n#endif\r\n\r\n/* Disable or enable the JIT compiler. */\r\n#if defined(LUAJIT_DISABLE_JIT) || defined(LJ_ARCH_NOJIT) || defined(LJ_OS_NOJIT)\r\n#define LJ_HASJIT\t\t0\r\n#else\r\n#define LJ_HASJIT\t\t1\r\n#endif\r\n\r\n/* Disable or enable the FFI extension. */\r\n#if defined(LUAJIT_DISABLE_FFI) || defined(LJ_ARCH_NOFFI)\r\n#define LJ_HASFFI\t\t0\r\n#else\r\n#define LJ_HASFFI\t\t1\r\n#endif\r\n\r\n#ifndef LJ_ARCH_HASFPU\r\n#define LJ_ARCH_HASFPU\t\t1\r\n#endif\r\n#ifndef LJ_ABI_SOFTFP\r\n#define LJ_ABI_SOFTFP\t\t0\r\n#endif\r\n#define LJ_SOFTFP\t\t(!LJ_ARCH_HASFPU)\r\n\r\n#if LJ_ARCH_ENDIAN == LUAJIT_BE\r\n#define LJ_LE\t\t\t0\r\n#define LJ_BE\t\t\t1\r\n#define LJ_ENDIAN_SELECT(le, be)\tbe\r\n#define LJ_ENDIAN_LOHI(lo, hi)\t\thi lo\r\n#else\r\n#define LJ_LE\t\t\t1\r\n#define LJ_BE\t\t\t0\r\n#define LJ_ENDIAN_SELECT(le, be)\tle\r\n#define LJ_ENDIAN_LOHI(lo, hi)\t\tlo hi\r\n#endif\r\n\r\n#if LJ_ARCH_BITS == 32\r\n#define LJ_32\t\t\t1\r\n#define LJ_64\t\t\t0\r\n#else\r\n#define LJ_32\t\t\t0\r\n#define LJ_64\t\t\t1\r\n#endif\r\n\r\n#ifndef LJ_TARGET_UNALIGNED\r\n#define LJ_TARGET_UNALIGNED\t0\r\n#endif\r\n\r\n/* Various workarounds for embedded operating systems. */\r\n#if (defined(__ANDROID__) && !defined(LJ_TARGET_X86ORX64)) || defined(__symbian__) || LJ_TARGET_XBOX360\r\n#define LUAJIT_NO_LOG2\r\n#endif\r\n#if defined(__symbian__)\r\n#define LUAJIT_NO_EXP2\r\n#endif\r\n\r\n#if defined(LUAJIT_NO_UNWIND) || defined(__symbian__) || LJ_TARGET_IOS || LJ_TARGET_PS3\r\n#define LJ_NO_UNWIND\t\t1\r\n#endif\r\n\r\n/* Compatibility with Lua 5.1 vs. 5.2. */\r\n#ifdef LUAJIT_ENABLE_LUA52COMPAT\r\n#define LJ_52\t\t\t1\r\n#else\r\n#define LJ_52\t\t\t0\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm.c",
    "content": "/*\r\n** IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_asm_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_asm.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_target.h\"\r\n\r\n#ifdef LUA_USE_ASSERT\r\n#include <stdio.h>\r\n#endif\r\n\r\n/* -- Assembler state and common macros ----------------------------------- */\r\n\r\n/* Assembler state. */\r\ntypedef struct ASMState {\r\n  RegCost cost[RID_MAX];  /* Reference and blended allocation cost for regs. */\r\n\r\n  MCode *mcp;\t\t/* Current MCode pointer (grows down). */\r\n  MCode *mclim;\t\t/* Lower limit for MCode memory + red zone. */\r\n#ifdef LUA_USE_ASSERT\r\n  MCode *mcp_prev;\t/* Red zone overflow check. */\r\n#endif\r\n\r\n  IRIns *ir;\t\t/* Copy of pointer to IR instructions/constants. */\r\n  jit_State *J;\t\t/* JIT compiler state. */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n  x86ModRM mrm;\t\t/* Fused x86 address operand. */\r\n#endif\r\n\r\n  RegSet freeset;\t/* Set of free registers. */\r\n  RegSet modset;\t/* Set of registers modified inside the loop. */\r\n  RegSet weakset;\t/* Set of weakly referenced registers. */\r\n  RegSet phiset;\t/* Set of PHI registers. */\r\n\r\n  uint32_t flags;\t/* Copy of JIT compiler flags. */\r\n  int loopinv;\t\t/* Loop branch inversion (0:no, 1:yes, 2:yes+CC_P). */\r\n\r\n  int32_t evenspill;\t/* Next even spill slot. */\r\n  int32_t oddspill;\t/* Next odd spill slot (or 0). */\r\n\r\n  IRRef curins;\t\t/* Reference of current instruction. */\r\n  IRRef stopins;\t/* Stop assembly before hitting this instruction. */\r\n  IRRef orignins;\t/* Original T->nins. */\r\n\r\n  IRRef snapref;\t/* Current snapshot is active after this reference. */\r\n  IRRef snaprename;\t/* Rename highwater mark for snapshot check. */\r\n  SnapNo snapno;\t/* Current snapshot number. */\r\n  SnapNo loopsnapno;\t/* Loop snapshot number. */\r\n\r\n  IRRef fuseref;\t/* Fusion limit (loopref, 0 or FUSE_DISABLED). */\r\n  IRRef sectref;\t/* Section base reference (loopref or 0). */\r\n  IRRef loopref;\t/* Reference of LOOP instruction (or 0). */\r\n\r\n  BCReg topslot;\t/* Number of slots for stack check (unless 0). */\r\n  int32_t gcsteps;\t/* Accumulated number of GC steps (per section). */\r\n\r\n  GCtrace *T;\t\t/* Trace to assemble. */\r\n  GCtrace *parent;\t/* Parent trace (or NULL). */\r\n\r\n  MCode *mcbot;\t\t/* Bottom of reserved MCode. */\r\n  MCode *mctop;\t\t/* Top of generated MCode. */\r\n  MCode *mcloop;\t/* Pointer to loop MCode (or NULL). */\r\n  MCode *invmcp;\t/* Points to invertible loop branch (or NULL). */\r\n  MCode *flagmcp;\t/* Pending opportunity to merge flag setting ins. */\r\n  MCode *realign;\t/* Realign loop if not NULL. */\r\n\r\n#ifdef RID_NUM_KREF\r\n  int32_t krefk[RID_NUM_KREF];\r\n#endif\r\n  IRRef1 phireg[RID_MAX];  /* PHI register references. */\r\n  uint16_t parentmap[LJ_MAX_JSLOTS];  /* Parent instruction to RegSP map. */\r\n} ASMState;\r\n\r\n#define IR(ref)\t\t\t(&as->ir[(ref)])\r\n\r\n#define ASMREF_TMP1\t\tREF_TRUE\t/* Temp. register. */\r\n#define ASMREF_TMP2\t\tREF_FALSE\t/* Temp. register. */\r\n#define ASMREF_L\t\tREF_NIL\t\t/* Stores register for L. */\r\n\r\n/* Check for variant to invariant references. */\r\n#define iscrossref(as, ref)\t((ref) < as->sectref)\r\n\r\n/* Inhibit memory op fusion from variant to invariant references. */\r\n#define FUSE_DISABLED\t\t(~(IRRef)0)\r\n#define mayfuse(as, ref)\t((ref) > as->fuseref)\r\n#define neverfuse(as)\t\t(as->fuseref == FUSE_DISABLED)\r\n#define canfuse(as, ir)\t\t(!neverfuse(as) && !irt_isphi((ir)->t))\r\n#define opisfusableload(o) \\\r\n  ((o) == IR_ALOAD || (o) == IR_HLOAD || (o) == IR_ULOAD || \\\r\n   (o) == IR_FLOAD || (o) == IR_XLOAD || (o) == IR_SLOAD || (o) == IR_VLOAD)\r\n\r\n/* Sparse limit checks using a red zone before the actual limit. */\r\n#define MCLIM_REDZONE\t64\r\n\r\nstatic LJ_NORET LJ_NOINLINE void asm_mclimit(ASMState *as)\r\n{\r\n  lj_mcode_limiterr(as->J, (size_t)(as->mctop - as->mcp + 4*MCLIM_REDZONE));\r\n}\r\n\r\nstatic LJ_AINLINE void checkmclim(ASMState *as)\r\n{\r\n#ifdef LUA_USE_ASSERT\r\n  if (as->mcp + MCLIM_REDZONE < as->mcp_prev) {\r\n    IRIns *ir = IR(as->curins+1);\r\n    fprintf(stderr, \"RED ZONE OVERFLOW: %p IR %04d  %02d %04d %04d\\n\", as->mcp,\r\n\t    as->curins+1-REF_BIAS, ir->o, ir->op1-REF_BIAS, ir->op2-REF_BIAS);\r\n    lua_assert(0);\r\n  }\r\n#endif\r\n  if (LJ_UNLIKELY(as->mcp < as->mclim)) asm_mclimit(as);\r\n#ifdef LUA_USE_ASSERT\r\n  as->mcp_prev = as->mcp;\r\n#endif\r\n}\r\n\r\n#ifdef RID_NUM_KREF\r\n#define ra_iskref(ref)\t\t((ref) < RID_NUM_KREF)\r\n#define ra_krefreg(ref)\t\t((Reg)(RID_MIN_KREF + (Reg)(ref)))\r\n#define ra_krefk(as, ref)\t(as->krefk[(ref)])\r\n\r\nstatic LJ_AINLINE void ra_setkref(ASMState *as, Reg r, int32_t k)\r\n{\r\n  IRRef ref = (IRRef)(r - RID_MIN_KREF);\r\n  as->krefk[ref] = k;\r\n  as->cost[r] = REGCOST(ref, ref);\r\n}\r\n\r\n#else\r\n#define ra_iskref(ref)\t\t0\r\n#define ra_krefreg(ref)\t\tRID_MIN_GPR\r\n#define ra_krefk(as, ref)\t0\r\n#endif\r\n\r\n/* Arch-specific field offsets. */\r\nstatic const uint8_t field_ofs[IRFL__MAX+1] = {\r\n#define FLOFS(name, ofs)\t(uint8_t)(ofs),\r\nIRFLDEF(FLOFS)\r\n#undef FLOFS\r\n  0\r\n};\r\n\r\n/* -- Target-specific instruction emitter --------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_emit_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_emit_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_emit_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_emit_mips.h\"\r\n#else\r\n#error \"Missing instruction emitter for target CPU\"\r\n#endif\r\n\r\n/* -- Register allocator debugging ---------------------------------------- */\r\n\r\n/* #define LUAJIT_DEBUG_RA */\r\n\r\n#ifdef LUAJIT_DEBUG_RA\r\n\r\n#include <stdio.h>\r\n#include <stdarg.h>\r\n\r\n#define RIDNAME(name)\t#name,\r\nstatic const char *const ra_regname[] = {\r\n  GPRDEF(RIDNAME)\r\n  FPRDEF(RIDNAME)\r\n  VRIDDEF(RIDNAME)\r\n  NULL\r\n};\r\n#undef RIDNAME\r\n\r\nstatic char ra_dbg_buf[65536];\r\nstatic char *ra_dbg_p;\r\nstatic char *ra_dbg_merge;\r\nstatic MCode *ra_dbg_mcp;\r\n\r\nstatic void ra_dstart(void)\r\n{\r\n  ra_dbg_p = ra_dbg_buf;\r\n  ra_dbg_merge = NULL;\r\n  ra_dbg_mcp = NULL;\r\n}\r\n\r\nstatic void ra_dflush(void)\r\n{\r\n  fwrite(ra_dbg_buf, 1, (size_t)(ra_dbg_p-ra_dbg_buf), stdout);\r\n  ra_dstart();\r\n}\r\n\r\nstatic void ra_dprintf(ASMState *as, const char *fmt, ...)\r\n{\r\n  char *p;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  p = ra_dbg_mcp == as->mcp ? ra_dbg_merge : ra_dbg_p;\r\n  ra_dbg_mcp = NULL;\r\n  p += sprintf(p, \"%08x  \\e[36m%04d \", (uintptr_t)as->mcp, as->curins-REF_BIAS);\r\n  for (;;) {\r\n    const char *e = strchr(fmt, '$');\r\n    if (e == NULL) break;\r\n    memcpy(p, fmt, (size_t)(e-fmt));\r\n    p += e-fmt;\r\n    if (e[1] == 'r') {\r\n      Reg r = va_arg(argp, Reg) & RID_MASK;\r\n      if (r <= RID_MAX) {\r\n\tconst char *q;\r\n\tfor (q = ra_regname[r]; *q; q++)\r\n\t  *p++ = *q >= 'A' && *q <= 'Z' ? *q + 0x20 : *q;\r\n      } else {\r\n\t*p++ = '?';\r\n\tlua_assert(0);\r\n      }\r\n    } else if (e[1] == 'f' || e[1] == 'i') {\r\n      IRRef ref;\r\n      if (e[1] == 'f')\r\n\tref = va_arg(argp, IRRef);\r\n      else\r\n\tref = va_arg(argp, IRIns *) - as->ir;\r\n      if (ref >= REF_BIAS)\r\n\tp += sprintf(p, \"%04d\", ref - REF_BIAS);\r\n      else\r\n\tp += sprintf(p, \"K%03d\", REF_BIAS - ref);\r\n    } else if (e[1] == 's') {\r\n      uint32_t slot = va_arg(argp, uint32_t);\r\n      p += sprintf(p, \"[sp+0x%x]\", sps_scale(slot));\r\n    } else if (e[1] == 'x') {\r\n      p += sprintf(p, \"%08x\", va_arg(argp, int32_t));\r\n    } else {\r\n      lua_assert(0);\r\n    }\r\n    fmt = e+2;\r\n  }\r\n  va_end(argp);\r\n  while (*fmt)\r\n    *p++ = *fmt++;\r\n  *p++ = '\\e'; *p++ = '['; *p++ = 'm'; *p++ = '\\n';\r\n  if (p > ra_dbg_buf+sizeof(ra_dbg_buf)-256) {\r\n    fwrite(ra_dbg_buf, 1, (size_t)(p-ra_dbg_buf), stdout);\r\n    p = ra_dbg_buf;\r\n  }\r\n  ra_dbg_p = p;\r\n}\r\n\r\n#define RA_DBG_START()\tra_dstart()\r\n#define RA_DBG_FLUSH()\tra_dflush()\r\n#define RA_DBG_REF() \\\r\n  do { char *_p = ra_dbg_p; ra_dprintf(as, \"\"); \\\r\n       ra_dbg_merge = _p; ra_dbg_mcp = as->mcp; } while (0)\r\n#define RA_DBGX(x)\tra_dprintf x\r\n\r\n#else\r\n#define RA_DBG_START()\t((void)0)\r\n#define RA_DBG_FLUSH()\t((void)0)\r\n#define RA_DBG_REF()\t((void)0)\r\n#define RA_DBGX(x)\t((void)0)\r\n#endif\r\n\r\n/* -- Register allocator -------------------------------------------------- */\r\n\r\n#define ra_free(as, r)\t\trset_set(as->freeset, (r))\r\n#define ra_modified(as, r)\trset_set(as->modset, (r))\r\n#define ra_weak(as, r)\t\trset_set(as->weakset, (r))\r\n#define ra_noweak(as, r)\trset_clear(as->weakset, (r))\r\n\r\n#define ra_used(ir)\t\t(ra_hasreg((ir)->r) || ra_hasspill((ir)->s))\r\n\r\n/* Setup register allocator. */\r\nstatic void ra_setup(ASMState *as)\r\n{\r\n  Reg r;\r\n  /* Initially all regs (except the stack pointer) are free for use. */\r\n  as->freeset = RSET_INIT;\r\n  as->modset = RSET_EMPTY;\r\n  as->weakset = RSET_EMPTY;\r\n  as->phiset = RSET_EMPTY;\r\n  memset(as->phireg, 0, sizeof(as->phireg));\r\n  for (r = RID_MIN_GPR; r < RID_MAX; r++)\r\n    as->cost[r] = REGCOST(~0u, 0u);\r\n}\r\n\r\n/* Rematerialize constants. */\r\nstatic Reg ra_rematk(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir;\r\n  Reg r;\r\n  if (ra_iskref(ref)) {\r\n    r = ra_krefreg(ref);\r\n    lua_assert(!rset_test(as->freeset, r));\r\n    ra_free(as, r);\r\n    ra_modified(as, r);\r\n    emit_loadi(as, r, ra_krefk(as, ref));\r\n    return r;\r\n  }\r\n  ir = IR(ref);\r\n  r = ir->r;\r\n  lua_assert(ra_hasreg(r) && !ra_hasspill(ir->s));\r\n  ra_free(as, r);\r\n  ra_modified(as, r);\r\n  ir->r = RID_INIT;  /* Do not keep any hint. */\r\n  RA_DBGX((as, \"remat     $i $r\", ir, r));\r\n#if !LJ_SOFTFP\r\n  if (ir->o == IR_KNUM) {\r\n    emit_loadn(as, r, ir_knum(ir));\r\n  } else\r\n#endif\r\n  if (emit_canremat(REF_BASE) && ir->o == IR_BASE) {\r\n    ra_sethint(ir->r, RID_BASE);  /* Restore BASE register hint. */\r\n    emit_getgl(as, r, jit_base);\r\n  } else if (emit_canremat(ASMREF_L) && ir->o == IR_KPRI) {\r\n    lua_assert(irt_isnil(ir->t));  /* REF_NIL stores ASMREF_L register. */\r\n    emit_getgl(as, r, jit_L);\r\n#if LJ_64\r\n  } else if (ir->o == IR_KINT64) {\r\n    emit_loadu64(as, r, ir_kint64(ir)->u64);\r\n#endif\r\n  } else {\r\n    lua_assert(ir->o == IR_KINT || ir->o == IR_KGC ||\r\n\t       ir->o == IR_KPTR || ir->o == IR_KKPTR || ir->o == IR_KNULL);\r\n    emit_loadi(as, r, ir->i);\r\n  }\r\n  return r;\r\n}\r\n\r\n/* Force a spill. Allocate a new spill slot if needed. */\r\nstatic int32_t ra_spill(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t slot = ir->s;\r\n  lua_assert(ir >= as->ir + REF_TRUE);\r\n  if (!ra_hasspill(slot)) {\r\n    if (irt_is64(ir->t)) {\r\n      slot = as->evenspill;\r\n      as->evenspill += 2;\r\n    } else if (as->oddspill) {\r\n      slot = as->oddspill;\r\n      as->oddspill = 0;\r\n    } else {\r\n      slot = as->evenspill;\r\n      as->oddspill = slot+1;\r\n      as->evenspill += 2;\r\n    }\r\n    if (as->evenspill > 256)\r\n      lj_trace_err(as->J, LJ_TRERR_SPILLOV);\r\n    ir->s = (uint8_t)slot;\r\n  }\r\n  return sps_scale(slot);\r\n}\r\n\r\n/* Release the temporarily allocated register in ASMREF_TMP1/ASMREF_TMP2. */\r\nstatic Reg ra_releasetmp(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg r = ir->r;\r\n  lua_assert(ra_hasreg(r) && !ra_hasspill(ir->s));\r\n  ra_free(as, r);\r\n  ra_modified(as, r);\r\n  ir->r = RID_INIT;\r\n  return r;\r\n}\r\n\r\n/* Restore a register (marked as free). Rematerialize or force a spill. */\r\nstatic Reg ra_restore(ASMState *as, IRRef ref)\r\n{\r\n  if (emit_canremat(ref)) {\r\n    return ra_rematk(as, ref);\r\n  } else {\r\n    IRIns *ir = IR(ref);\r\n    int32_t ofs = ra_spill(as, ir);  /* Force a spill slot. */\r\n    Reg r = ir->r;\r\n    lua_assert(ra_hasreg(r));\r\n    ra_sethint(ir->r, r);  /* Keep hint. */\r\n    ra_free(as, r);\r\n    if (!rset_test(as->weakset, r)) {  /* Only restore non-weak references. */\r\n      ra_modified(as, r);\r\n      RA_DBGX((as, \"restore   $i $r\", ir, r));\r\n      emit_spload(as, ir, r, ofs);\r\n    }\r\n    return r;\r\n  }\r\n}\r\n\r\n/* Save a register to a spill slot. */\r\nstatic void ra_save(ASMState *as, IRIns *ir, Reg r)\r\n{\r\n  RA_DBGX((as, \"save      $i $r\", ir, r));\r\n  emit_spstore(as, ir, r, sps_scale(ir->s));\r\n}\r\n\r\n#define MINCOST(name) \\\r\n  if (rset_test(RSET_ALL, RID_##name) && \\\r\n      LJ_LIKELY(allow&RID2RSET(RID_##name)) && as->cost[RID_##name] < cost) \\\r\n    cost = as->cost[RID_##name];\r\n\r\n/* Evict the register with the lowest cost, forcing a restore. */\r\nstatic Reg ra_evict(ASMState *as, RegSet allow)\r\n{\r\n  IRRef ref;\r\n  RegCost cost = ~(RegCost)0;\r\n  lua_assert(allow != RSET_EMPTY);\r\n  if (RID_NUM_FPR == 0 || allow < RID2RSET(RID_MAX_GPR)) {\r\n    GPRDEF(MINCOST)\r\n  } else {\r\n    FPRDEF(MINCOST)\r\n  }\r\n  ref = regcost_ref(cost);\r\n  lua_assert(ra_iskref(ref) || (ref >= as->T->nk && ref < as->T->nins));\r\n  /* Preferably pick any weak ref instead of a non-weak, non-const ref. */\r\n  if (!irref_isk(ref) && (as->weakset & allow)) {\r\n    IRIns *ir = IR(ref);\r\n    if (!rset_test(as->weakset, ir->r))\r\n      ref = regcost_ref(as->cost[rset_pickbot((as->weakset & allow))]);\r\n  }\r\n  return ra_restore(as, ref);\r\n}\r\n\r\n/* Pick any register (marked as free). Evict on-demand. */\r\nstatic Reg ra_pick(ASMState *as, RegSet allow)\r\n{\r\n  RegSet pick = as->freeset & allow;\r\n  if (!pick)\r\n    return ra_evict(as, allow);\r\n  else\r\n    return rset_picktop(pick);\r\n}\r\n\r\n/* Get a scratch register (marked as free). */\r\nstatic Reg ra_scratch(ASMState *as, RegSet allow)\r\n{\r\n  Reg r = ra_pick(as, allow);\r\n  ra_modified(as, r);\r\n  RA_DBGX((as, \"scratch        $r\", r));\r\n  return r;\r\n}\r\n\r\n/* Evict all registers from a set (if not free). */\r\nstatic void ra_evictset(ASMState *as, RegSet drop)\r\n{\r\n  RegSet work;\r\n  as->modset |= drop;\r\n#if !LJ_SOFTFP\r\n  work = (drop & ~as->freeset) & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n#endif\r\n  work = (drop & ~as->freeset);\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n}\r\n\r\n/* Evict (rematerialize) all registers allocated to constants. */\r\nstatic void ra_evictk(ASMState *as)\r\n{\r\n  RegSet work;\r\n#if !LJ_SOFTFP\r\n  work = ~as->freeset & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    if (emit_canremat(ref) && irref_isk(ref)) {\r\n      ra_rematk(as, ref);\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n#endif\r\n  work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    if (emit_canremat(ref) && irref_isk(ref)) {\r\n      ra_rematk(as, ref);\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n#ifdef RID_NUM_KREF\r\n/* Allocate a register for a constant. */\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow)\r\n{\r\n  /* First try to find a register which already holds the same constant. */\r\n  RegSet pick, work = ~as->freeset & RSET_GPR;\r\n  Reg r;\r\n  while (work) {\r\n    IRRef ref;\r\n    r = rset_pickbot(work);\r\n    ref = regcost_ref(as->cost[r]);\r\n    if (ref < ASMREF_L &&\r\n\tk == (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i))\r\n      return r;\r\n    rset_clear(work, r);\r\n  }\r\n  pick = as->freeset & allow;\r\n  if (pick) {\r\n    /* Constants should preferably get unmodified registers. */\r\n    if ((pick & ~as->modset))\r\n      pick &= ~as->modset;\r\n    r = rset_pickbot(pick);  /* Reduce conflicts with inverse allocation. */\r\n  } else {\r\n    r = ra_evict(as, allow);\r\n  }\r\n  RA_DBGX((as, \"allock    $x $r\", k, r));\r\n  ra_setkref(as, r, k);\r\n  rset_clear(as->freeset, r);\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a specific register for a constant. */\r\nstatic void ra_allockreg(ASMState *as, int32_t k, Reg r)\r\n{\r\n  Reg kr = ra_allock(as, k, RID2RSET(r));\r\n  if (kr != r) {\r\n    IRIns irdummy;\r\n    irdummy.t.irt = IRT_INT;\r\n    ra_scratch(as, RID2RSET(r));\r\n    emit_movrr(as, &irdummy, r, kr);\r\n  }\r\n}\r\n#else\r\n#define ra_allockreg(as, k, r)\t\temit_loadi(as, (r), (k))\r\n#endif\r\n\r\n/* Allocate a register for ref from the allowed set of registers.\r\n** Note: this function assumes the ref does NOT have a register yet!\r\n** Picks an optimal register, sets the cost and marks the register as non-free.\r\n*/\r\nstatic Reg ra_allocref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  RegSet pick = as->freeset & allow;\r\n  Reg r;\r\n  lua_assert(ra_noreg(ir->r));\r\n  if (pick) {\r\n    /* First check register hint from propagation or PHI. */\r\n    if (ra_hashint(ir->r)) {\r\n      r = ra_gethint(ir->r);\r\n      if (rset_test(pick, r))  /* Use hint register if possible. */\r\n\tgoto found;\r\n      /* Rematerialization is cheaper than missing a hint. */\r\n      if (rset_test(allow, r) && emit_canremat(regcost_ref(as->cost[r]))) {\r\n\tra_rematk(as, regcost_ref(as->cost[r]));\r\n\tgoto found;\r\n      }\r\n      RA_DBGX((as, \"hintmiss  $f $r\", ref, r));\r\n    }\r\n    /* Invariants should preferably get unmodified registers. */\r\n    if (ref < as->loopref && !irt_isphi(ir->t)) {\r\n      if ((pick & ~as->modset))\r\n\tpick &= ~as->modset;\r\n      r = rset_pickbot(pick);  /* Reduce conflicts with inverse allocation. */\r\n    } else {\r\n      /* We've got plenty of regs, so get callee-save regs if possible. */\r\n      if (RID_NUM_GPR > 8 && (pick & ~RSET_SCRATCH))\r\n\tpick &= ~RSET_SCRATCH;\r\n      r = rset_picktop(pick);\r\n    }\r\n  } else {\r\n    r = ra_evict(as, allow);\r\n  }\r\nfound:\r\n  RA_DBGX((as, \"alloc     $f $r\", ref, r));\r\n  ir->r = (uint8_t)r;\r\n  rset_clear(as->freeset, r);\r\n  ra_noweak(as, r);\r\n  as->cost[r] = REGCOST_REF_T(ref, irt_t(ir->t));\r\n  return r;\r\n}\r\n\r\n/* Allocate a register on-demand. */\r\nstatic Reg ra_alloc1(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  /* Note: allow is ignored if the register is already allocated. */\r\n  if (ra_noreg(r)) r = ra_allocref(as, ref, allow);\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Rename register allocation and emit move. */\r\nstatic void ra_rename(ASMState *as, Reg down, Reg up)\r\n{\r\n  IRRef ren, ref = regcost_ref(as->cost[up] = as->cost[down]);\r\n  IRIns *ir = IR(ref);\r\n  ir->r = (uint8_t)up;\r\n  as->cost[down] = 0;\r\n  lua_assert((down < RID_MAX_GPR) == (up < RID_MAX_GPR));\r\n  lua_assert(!rset_test(as->freeset, down) && rset_test(as->freeset, up));\r\n  ra_free(as, down);  /* 'down' is free ... */\r\n  ra_modified(as, down);\r\n  rset_clear(as->freeset, up);  /* ... and 'up' is now allocated. */\r\n  ra_noweak(as, up);\r\n  RA_DBGX((as, \"rename    $f $r $r\", regcost_ref(as->cost[up]), down, up));\r\n  emit_movrr(as, ir, down, up);  /* Backwards codegen needs inverse move. */\r\n  if (!ra_hasspill(IR(ref)->s)) {  /* Add the rename to the IR. */\r\n    lj_ir_set(as->J, IRT(IR_RENAME, IRT_NIL), ref, as->snapno);\r\n    ren = tref_ref(lj_ir_emit(as->J));\r\n    as->ir = as->T->ir;  /* The IR may have been reallocated. */\r\n    IR(ren)->r = (uint8_t)down;\r\n    IR(ren)->s = SPS_NONE;\r\n  }\r\n}\r\n\r\n/* Pick a destination register (marked as free).\r\n** Caveat: allow is ignored if there's already a destination register.\r\n** Use ra_destreg() to get a specific register.\r\n*/\r\nstatic Reg ra_dest(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  Reg dest = ir->r;\r\n  if (ra_hasreg(dest)) {\r\n    ra_free(as, dest);\r\n    ra_modified(as, dest);\r\n  } else {\r\n    if (ra_hashint(dest) && rset_test((as->freeset&allow), ra_gethint(dest))) {\r\n      dest = ra_gethint(dest);\r\n      ra_modified(as, dest);\r\n      RA_DBGX((as, \"dest           $r\", dest));\r\n    } else {\r\n      dest = ra_scratch(as, allow);\r\n    }\r\n    ir->r = dest;\r\n  }\r\n  if (LJ_UNLIKELY(ra_hasspill(ir->s))) ra_save(as, ir, dest);\r\n  return dest;\r\n}\r\n\r\n/* Force a specific destination register (marked as free). */\r\nstatic void ra_destreg(ASMState *as, IRIns *ir, Reg r)\r\n{\r\n  Reg dest = ra_dest(as, ir, RID2RSET(r));\r\n  if (dest != r) {\r\n    lua_assert(rset_test(as->freeset, r));\r\n    ra_modified(as, r);\r\n    emit_movrr(as, ir, dest, r);\r\n  }\r\n}\r\n\r\n#if LJ_TARGET_X86ORX64\r\n/* Propagate dest register to left reference. Emit moves as needed.\r\n** This is a required fixup step for all 2-operand machine instructions.\r\n*/\r\nstatic void ra_left(ASMState *as, Reg dest, IRRef lref)\r\n{\r\n  IRIns *ir = IR(lref);\r\n  Reg left = ir->r;\r\n  if (ra_noreg(left)) {\r\n    if (irref_isk(lref)) {\r\n      if (ir->o == IR_KNUM) {\r\n\tcTValue *tv = ir_knum(ir);\r\n\t/* FP remat needs a load except for +0. Still better than eviction. */\r\n\tif (tvispzero(tv) || !(as->freeset & RSET_FPR)) {\r\n\t  emit_loadn(as, dest, tv);\r\n\t  return;\r\n\t}\r\n#if LJ_64\r\n      } else if (ir->o == IR_KINT64) {\r\n\temit_loadu64(as, dest, ir_kint64(ir)->u64);\r\n\treturn;\r\n#endif\r\n      } else {\r\n\tlua_assert(ir->o == IR_KINT || ir->o == IR_KGC ||\r\n\t\t   ir->o == IR_KPTR || ir->o == IR_KKPTR || ir->o == IR_KNULL);\r\n\temit_loadi(as, dest, ir->i);\r\n\treturn;\r\n      }\r\n    }\r\n    if (!ra_hashint(left) && !iscrossref(as, lref))\r\n      ra_sethint(ir->r, dest);  /* Propagate register hint. */\r\n    left = ra_allocref(as, lref, dest < RID_MAX_GPR ? RSET_GPR : RSET_FPR);\r\n  }\r\n  ra_noweak(as, left);\r\n  /* Move needed for true 3-operand instruction: y=a+b ==> y=a; y+=b. */\r\n  if (dest != left) {\r\n    /* Use register renaming if dest is the PHI reg. */\r\n    if (irt_isphi(ir->t) && as->phireg[dest] == lref) {\r\n      ra_modified(as, left);\r\n      ra_rename(as, left, dest);\r\n    } else {\r\n      emit_movrr(as, ir, dest, left);\r\n    }\r\n  }\r\n}\r\n#else\r\n/* Similar to ra_left, except we override any hints. */\r\nstatic void ra_leftov(ASMState *as, Reg dest, IRRef lref)\r\n{\r\n  IRIns *ir = IR(lref);\r\n  Reg left = ir->r;\r\n  if (ra_noreg(left)) {\r\n    ra_sethint(ir->r, dest);  /* Propagate register hint. */\r\n    left = ra_allocref(as, lref,\r\n\t\t       (LJ_SOFTFP || dest < RID_MAX_GPR) ? RSET_GPR : RSET_FPR);\r\n  }\r\n  ra_noweak(as, left);\r\n  if (dest != left) {\r\n    /* Use register renaming if dest is the PHI reg. */\r\n    if (irt_isphi(ir->t) && as->phireg[dest] == lref) {\r\n      ra_modified(as, left);\r\n      ra_rename(as, left, dest);\r\n    } else {\r\n      emit_movrr(as, ir, dest, left);\r\n    }\r\n  }\r\n}\r\n#endif\r\n\r\n#if !LJ_64\r\n/* Force a RID_RETLO/RID_RETHI destination register pair (marked as free). */\r\nstatic void ra_destpair(ASMState *as, IRIns *ir)\r\n{\r\n  Reg destlo = ir->r, desthi = (ir+1)->r;\r\n  /* First spill unrelated refs blocking the destination registers. */\r\n  if (!rset_test(as->freeset, RID_RETLO) &&\r\n      destlo != RID_RETLO && desthi != RID_RETLO)\r\n    ra_restore(as, regcost_ref(as->cost[RID_RETLO]));\r\n  if (!rset_test(as->freeset, RID_RETHI) &&\r\n      destlo != RID_RETHI && desthi != RID_RETHI)\r\n    ra_restore(as, regcost_ref(as->cost[RID_RETHI]));\r\n  /* Next free the destination registers (if any). */\r\n  if (ra_hasreg(destlo)) {\r\n    ra_free(as, destlo);\r\n    ra_modified(as, destlo);\r\n  } else {\r\n    destlo = RID_RETLO;\r\n  }\r\n  if (ra_hasreg(desthi)) {\r\n    ra_free(as, desthi);\r\n    ra_modified(as, desthi);\r\n  } else {\r\n    desthi = RID_RETHI;\r\n  }\r\n  /* Check for conflicts and shuffle the registers as needed. */\r\n  if (destlo == RID_RETHI) {\r\n    if (desthi == RID_RETLO) {\r\n#if LJ_TARGET_X86\r\n      *--as->mcp = XI_XCHGa + RID_RETHI;\r\n#else\r\n      emit_movrr(as, ir, RID_RETHI, RID_TMP);\r\n      emit_movrr(as, ir, RID_RETLO, RID_RETHI);\r\n      emit_movrr(as, ir, RID_TMP, RID_RETLO);\r\n#endif\r\n    } else {\r\n      emit_movrr(as, ir, RID_RETHI, RID_RETLO);\r\n      if (desthi != RID_RETHI) emit_movrr(as, ir, desthi, RID_RETHI);\r\n    }\r\n  } else if (desthi == RID_RETLO) {\r\n    emit_movrr(as, ir, RID_RETLO, RID_RETHI);\r\n    if (destlo != RID_RETLO) emit_movrr(as, ir, destlo, RID_RETLO);\r\n  } else {\r\n    if (desthi != RID_RETHI) emit_movrr(as, ir, desthi, RID_RETHI);\r\n    if (destlo != RID_RETLO) emit_movrr(as, ir, destlo, RID_RETLO);\r\n  }\r\n  /* Restore spill slots (if any). */\r\n  if (ra_hasspill((ir+1)->s)) ra_save(as, ir+1, RID_RETHI);\r\n  if (ra_hasspill(ir->s)) ra_save(as, ir, RID_RETLO);\r\n}\r\n#endif\r\n\r\n/* -- Snapshot handling --------- ----------------------------------------- */\r\n\r\n/* Can we rematerialize a KNUM instead of forcing a spill? */\r\nstatic int asm_snap_canremat(ASMState *as)\r\n{\r\n  Reg r;\r\n  for (r = RID_MIN_FPR; r < RID_MAX_FPR; r++)\r\n    if (irref_isk(regcost_ref(as->cost[r])))\r\n      return 1;\r\n  return 0;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. */\r\nstatic int asm_sunk_store(ASMState *as, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->s == 255) {\r\n    if (irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\tirs->o == IR_FSTORE || irs->o == IR_XSTORE) {\r\n      IRIns *irk = IR(irs->op1);\r\n      if (irk->o == IR_AREF || irk->o == IR_HREFK)\r\n\tirk = IR(irk->op1);\r\n      return (IR(irk->op1) == ira);\r\n    }\r\n    return 0;\r\n  } else {\r\n    return (ira + irs->s == irs);  /* Quick check. */\r\n  }\r\n}\r\n\r\n/* Allocate register or spill slot for a ref that escapes to a snapshot. */\r\nstatic void asm_snap_alloc1(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (!irref_isk(ref) && (!(ra_used(ir) || ir->r == RID_SUNK))) {\r\n    if (ir->r == RID_SINK) {\r\n      ir->r = RID_SUNK;\r\n#if LJ_HASFFI\r\n      if (ir->o == IR_CNEWI) {  /* Allocate CNEWI value. */\r\n\tasm_snap_alloc1(as, ir->op2);\r\n\tif (LJ_32 && (ir+1)->o == IR_HIOP)\r\n\t  asm_snap_alloc1(as, (ir+1)->op2);\r\n      } else\r\n#endif\r\n      {  /* Allocate stored values for TNEW, TDUP and CNEW. */\r\n\tIRIns *irs;\r\n\tlua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP || ir->o == IR_CNEW);\r\n\tfor (irs = IR(as->snapref-1); irs > ir; irs--)\r\n\t  if (irs->r == RID_SINK && asm_sunk_store(as, ir, irs)) {\r\n\t    lua_assert(irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\t\t       irs->o == IR_FSTORE || irs->o == IR_XSTORE);\r\n\t    asm_snap_alloc1(as, irs->op2);\r\n\t    if (LJ_32 && (irs+1)->o == IR_HIOP)\r\n\t      asm_snap_alloc1(as, (irs+1)->op2);\r\n\t  }\r\n      }\r\n    } else {\r\n      RegSet allow;\r\n      if (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT) {\r\n\tIRIns *irc;\r\n\tfor (irc = IR(as->curins); irc > ir; irc--)\r\n\t  if ((irc->op1 == ref || irc->op2 == ref) &&\r\n\t      !(irc->r == RID_SINK || irc->r == RID_SUNK))\r\n\t    goto nosink;  /* Don't sink conversion if result is used. */\r\n\tasm_snap_alloc1(as, ir->op1);\r\n\treturn;\r\n      }\r\n    nosink:\r\n      allow = (!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR;\r\n      if ((as->freeset & allow) ||\r\n\t       (allow == RSET_FPR && asm_snap_canremat(as))) {\r\n\t/* Get a weak register if we have a free one or can rematerialize. */\r\n\tReg r = ra_allocref(as, ref, allow);  /* Allocate a register. */\r\n\tif (!irt_isphi(ir->t))\r\n\t  ra_weak(as, r);  /* But mark it as weakly referenced. */\r\n\tcheckmclim(as);\r\n\tRA_DBGX((as, \"snapreg   $f $r\", ref, ir->r));\r\n      } else {\r\n\tra_spill(as, ir);  /* Otherwise force a spill slot. */\r\n\tRA_DBGX((as, \"snapspill $f $s\", ref, ir->s));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Allocate refs escaping to a snapshot. */\r\nstatic void asm_snap_alloc(ASMState *as)\r\n{\r\n  SnapShot *snap = &as->T->snap[as->snapno];\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRRef ref = snap_ref(sn);\r\n    if (!irref_isk(ref)) {\r\n      asm_snap_alloc1(as, ref);\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM)) {\r\n\tlua_assert(irt_type(IR(ref+1)->t) == IRT_SOFTFP);\r\n\tasm_snap_alloc1(as, ref+1);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* All guards for a snapshot use the same exitno. This is currently the\r\n** same as the snapshot number. Since the exact origin of the exit cannot\r\n** be determined, all guards for the same snapshot must exit with the same\r\n** RegSP mapping.\r\n** A renamed ref which has been used in a prior guard for the same snapshot\r\n** would cause an inconsistency. The easy way out is to force a spill slot.\r\n*/\r\nstatic int asm_snap_checkrename(ASMState *as, IRRef ren)\r\n{\r\n  SnapShot *snap = &as->T->snap[as->snapno];\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRRef ref = snap_ref(sn);\r\n    if (ref == ren || (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && ++ref == ren)) {\r\n      IRIns *ir = IR(ref);\r\n      ra_spill(as, ir);  /* Register renamed, so force a spill slot. */\r\n      RA_DBGX((as, \"snaprensp $f $s\", ref, ir->s));\r\n      return 1;  /* Found. */\r\n    }\r\n  }\r\n  return 0;  /* Not found. */\r\n}\r\n\r\n/* Prepare snapshot for next guard instruction. */\r\nstatic void asm_snap_prep(ASMState *as)\r\n{\r\n  if (as->curins < as->snapref) {\r\n    do {\r\n      if (as->snapno == 0) return;  /* Called by sunk stores before snap #0. */\r\n      as->snapno--;\r\n      as->snapref = as->T->snap[as->snapno].ref;\r\n    } while (as->curins < as->snapref);\r\n    asm_snap_alloc(as);\r\n    as->snaprename = as->T->nins;\r\n  } else {\r\n    /* Process any renames above the highwater mark. */\r\n    for (; as->snaprename < as->T->nins; as->snaprename++) {\r\n      IRIns *ir = IR(as->snaprename);\r\n      if (asm_snap_checkrename(as, ir->op1))\r\n\tir->op2 = REF_BIAS-1;  /* Kill rename. */\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Miscellaneous helpers ----------------------------------------------- */\r\n\r\n/* Collect arguments from CALL* and CARG instructions. */\r\nstatic void asm_collectargs(ASMState *as, IRIns *ir,\r\n\t\t\t    const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n = CCI_NARGS(ci);\r\n  lua_assert(n <= CCI_NARGS_MAX*2);  /* Account for split args. */\r\n  if ((ci->flags & CCI_L)) { *args++ = ASMREF_L; n--; }\r\n  while (n-- > 1) {\r\n    ir = IR(ir->op1);\r\n    lua_assert(ir->o == IR_CARG);\r\n    args[n] = ir->op2 == REF_NIL ? 0 : ir->op2;\r\n  }\r\n  args[0] = ir->op1 == REF_NIL ? 0 : ir->op1;\r\n  lua_assert(IR(ir->op1)->o != IR_CARG);\r\n}\r\n\r\n/* Reconstruct CCallInfo flags for CALLX*. */\r\nstatic uint32_t asm_callx_flags(ASMState *as, IRIns *ir)\r\n{\r\n  uint32_t nargs = 0;\r\n  if (ir->op1 != REF_NIL) {  /* Count number of arguments first. */\r\n    IRIns *ira = IR(ir->op1);\r\n    nargs++;\r\n    while (ira->o == IR_CARG) { nargs++; ira = IR(ira->op1); }\r\n  }\r\n#if LJ_HASFFI\r\n  if (IR(ir->op2)->o == IR_CARG) {  /* Copy calling convention info. */\r\n    CTypeID id = (CTypeID)IR(IR(ir->op2)->op2)->i;\r\n    CType *ct = ctype_get(ctype_ctsG(J2G(as->J)), id);\r\n    nargs |= ((ct->info & CTF_VARARG) ? CCI_VARARG : 0);\r\n#if LJ_TARGET_X86\r\n    nargs |= (ctype_cconv(ct->info) << CCI_CC_SHIFT);\r\n#endif\r\n  }\r\n#endif\r\n  return (nargs | (ir->t.irt << CCI_OTSHIFT));\r\n}\r\n\r\n/* Calculate stack adjustment. */\r\nstatic int32_t asm_stack_adjust(ASMState *as)\r\n{\r\n  if (as->evenspill <= SPS_FIXED)\r\n    return 0;\r\n  return sps_scale(sps_align(as->evenspill));\r\n}\r\n\r\n/* Must match with hash*() in lj_tab.c. */\r\nstatic uint32_t ir_khash(IRIns *ir)\r\n{\r\n  uint32_t lo, hi;\r\n  if (irt_isstr(ir->t)) {\r\n    return ir_kstr(ir)->hash;\r\n  } else if (irt_isnum(ir->t)) {\r\n    lo = ir_knum(ir)->u32.lo;\r\n    hi = ir_knum(ir)->u32.hi << 1;\r\n  } else if (irt_ispri(ir->t)) {\r\n    lua_assert(!irt_isnil(ir->t));\r\n    return irt_type(ir->t)-IRT_FALSE;\r\n  } else {\r\n    lua_assert(irt_isgcv(ir->t));\r\n    lo = u32ptr(ir_kgc(ir));\r\n    hi = lo + HASH_BIAS;\r\n  }\r\n  return hashrot(lo, hi);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args);\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci);\r\n\r\nstatic void asm_snew(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_new];\r\n  IRRef args[3];\r\n  args[0] = ASMREF_L;  /* lua_State *L    */\r\n  args[1] = ir->op1;   /* const char *str */\r\n  args[2] = ir->op2;   /* size_t len      */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCstr * */\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_tnew(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_new1];\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;     /* lua_State *L    */\r\n  args[1] = ASMREF_TMP1;  /* uint32_t ahsize */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCtab * */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, ir->op1 | (ir->op2 << 24), ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n\r\nstatic void asm_tdup(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_dup];\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;  /* lua_State *L    */\r\n  args[1] = ir->op1;   /* const GCtab *kt */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCtab * */\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_gc_check(ASMState *as);\r\n\r\n/* Explicit GC step. */\r\nstatic void asm_gcstep(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *ira;\r\n  for (ira = IR(as->stopins+1); ira < ir; ira++)\r\n    if ((ira->o == IR_TNEW || ira->o == IR_TDUP ||\r\n\t (LJ_HASFFI && (ira->o == IR_CNEW || ira->o == IR_CNEWI))) &&\r\n\tra_used(ira))\r\n      as->gcsteps++;\r\n  if (as->gcsteps)\r\n    asm_gc_check(as);\r\n  as->gcsteps = 0x80000000;  /* Prevent implicit GC check further up. */\r\n}\r\n\r\n/* -- PHI and loop handling ----------------------------------------------- */\r\n\r\n/* Break a PHI cycle by renaming to a free register (evict if needed). */\r\nstatic void asm_phi_break(ASMState *as, RegSet blocked, RegSet blockedby,\r\n\t\t\t  RegSet allow)\r\n{\r\n  RegSet candidates = blocked & allow;\r\n  if (candidates) {  /* If this register file has candidates. */\r\n    /* Note: the set for ra_pick cannot be empty, since each register file\r\n    ** has some registers never allocated to PHIs.\r\n    */\r\n    Reg down, up = ra_pick(as, ~blocked & allow);  /* Get a free register. */\r\n    if (candidates & ~blockedby)  /* Optimize shifts, else it's a cycle. */\r\n      candidates = candidates & ~blockedby;\r\n    down = rset_picktop(candidates);  /* Pick candidate PHI register. */\r\n    ra_rename(as, down, up);  /* And rename it to the free register. */\r\n  }\r\n}\r\n\r\n/* PHI register shuffling.\r\n**\r\n** The allocator tries hard to preserve PHI register assignments across\r\n** the loop body. Most of the time this loop does nothing, since there\r\n** are no register mismatches.\r\n**\r\n** If a register mismatch is detected and ...\r\n** - the register is currently free: rename it.\r\n** - the register is blocked by an invariant: restore/remat and rename it.\r\n** - Otherwise the register is used by another PHI, so mark it as blocked.\r\n**\r\n** The renames are order-sensitive, so just retry the loop if a register\r\n** is marked as blocked, but has been freed in the meantime. A cycle is\r\n** detected if all of the blocked registers are allocated. To break the\r\n** cycle rename one of them to a free register and retry.\r\n**\r\n** Note that PHI spill slots are kept in sync and don't need to be shuffled.\r\n*/\r\nstatic void asm_phi_shuffle(ASMState *as)\r\n{\r\n  RegSet work;\r\n\r\n  /* Find and resolve PHI register mismatches. */\r\n  for (;;) {\r\n    RegSet blocked = RSET_EMPTY;\r\n    RegSet blockedby = RSET_EMPTY;\r\n    RegSet phiset = as->phiset;\r\n    while (phiset) {  /* Check all left PHI operand registers. */\r\n      Reg r = rset_pickbot(phiset);\r\n      IRIns *irl = IR(as->phireg[r]);\r\n      Reg left = irl->r;\r\n      if (r != left) {  /* Mismatch? */\r\n\tif (!rset_test(as->freeset, r)) {  /* PHI register blocked? */\r\n\t  IRRef ref = regcost_ref(as->cost[r]);\r\n\t  /* Blocked by other PHI (w/reg)? */\r\n\t  if (!ra_iskref(ref) && irt_ismarked(IR(ref)->t)) {\r\n\t    rset_set(blocked, r);\r\n\t    if (ra_hasreg(left))\r\n\t      rset_set(blockedby, left);\r\n\t    left = RID_NONE;\r\n\t  } else {  /* Otherwise grab register from invariant. */\r\n\t    ra_restore(as, ref);\r\n\t    checkmclim(as);\r\n\t  }\r\n\t}\r\n\tif (ra_hasreg(left)) {\r\n\t  ra_rename(as, left, r);\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n      rset_clear(phiset, r);\r\n    }\r\n    if (!blocked) break;  /* Finished. */\r\n    if (!(as->freeset & blocked)) {  /* Break cycles if none are free. */\r\n      asm_phi_break(as, blocked, blockedby, RSET_GPR);\r\n      if (!LJ_SOFTFP) asm_phi_break(as, blocked, blockedby, RSET_FPR);\r\n      checkmclim(as);\r\n    }  /* Else retry some more renames. */\r\n  }\r\n\r\n  /* Restore/remat invariants whose registers are modified inside the loop. */\r\n#if !LJ_SOFTFP\r\n  work = as->modset & ~(as->freeset | as->phiset) & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n#endif\r\n  work = as->modset & ~(as->freeset | as->phiset);\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n\r\n  /* Allocate and save all unsaved PHI regs and clear marks. */\r\n  work = as->phiset;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef lref = as->phireg[r];\r\n    IRIns *ir = IR(lref);\r\n    if (ra_hasspill(ir->s)) {  /* Left PHI gained a spill slot? */\r\n      irt_clearmark(ir->t);  /* Handled here, so clear marker now. */\r\n      ra_alloc1(as, lref, RID2RSET(r));\r\n      ra_save(as, ir, r);  /* Save to spill slot inside the loop. */\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n/* Copy unsynced left/right PHI spill slots. Rarely needed. */\r\nstatic void asm_phi_copyspill(ASMState *as)\r\n{\r\n  int need = 0;\r\n  IRIns *ir;\r\n  for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--)\r\n    if (ra_hasspill(ir->s) && ra_hasspill(IR(ir->op1)->s))\r\n      need |= irt_isfp(ir->t) ? 2 : 1;  /* Unsynced spill slot? */\r\n  if ((need & 1)) {  /* Copy integer spill slots. */\r\n#if !LJ_TARGET_X86ORX64\r\n    Reg r = RID_TMP;\r\n#else\r\n    Reg r = RID_RET;\r\n    if ((as->freeset & RSET_GPR))\r\n      r = rset_pickbot((as->freeset & RSET_GPR));\r\n    else\r\n      emit_spload(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n#endif\r\n    for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--) {\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRIns *irl = IR(ir->op1);\r\n\tif (ra_hasspill(irl->s) && !irt_isfp(ir->t)) {\r\n\t  emit_spstore(as, irl, r, sps_scale(irl->s));\r\n\t  emit_spload(as, ir, r, sps_scale(ir->s));\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spstore(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n#endif\r\n  }\r\n#if !LJ_SOFTFP\r\n  if ((need & 2)) {  /* Copy FP spill slots. */\r\n#if LJ_TARGET_X86\r\n    Reg r = RID_XMM0;\r\n#else\r\n    Reg r = RID_FPRET;\r\n#endif\r\n    if ((as->freeset & RSET_FPR))\r\n      r = rset_pickbot((as->freeset & RSET_FPR));\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spload(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n    for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--) {\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRIns *irl = IR(ir->op1);\r\n\tif (ra_hasspill(irl->s) && irt_isfp(ir->t)) {\r\n\t  emit_spstore(as, irl, r, sps_scale(irl->s));\r\n\t  emit_spload(as, ir, r, sps_scale(ir->s));\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n    }\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spstore(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n  }\r\n#endif\r\n}\r\n\r\n/* Emit renames for left PHIs which are only spilled outside the loop. */\r\nstatic void asm_phi_fixup(ASMState *as)\r\n{\r\n  RegSet work = as->phiset;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef lref = as->phireg[r];\r\n    IRIns *ir = IR(lref);\r\n    if (irt_ismarked(ir->t)) {\r\n      irt_clearmark(ir->t);\r\n      /* Left PHI gained a spill slot before the loop? */\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRRef ren;\r\n\tlj_ir_set(as->J, IRT(IR_RENAME, IRT_NIL), lref, as->loopsnapno);\r\n\tren = tref_ref(lj_ir_emit(as->J));\r\n\tas->ir = as->T->ir;  /* The IR may have been reallocated. */\r\n\tIR(ren)->r = (uint8_t)r;\r\n\tIR(ren)->s = SPS_NONE;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n/* Setup right PHI reference. */\r\nstatic void asm_phi(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = ((!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR) &\r\n\t\t ~as->phiset;\r\n  RegSet afree = (as->freeset & allow);\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  if (ir->r == RID_SINK)  /* Sink PHI. */\r\n    return;\r\n  /* Spill slot shuffling is not implemented yet (but rarely needed). */\r\n  if (ra_hasspill(irl->s) || ra_hasspill(irr->s))\r\n    lj_trace_err(as->J, LJ_TRERR_NYIPHI);\r\n  /* Leave at least one register free for non-PHIs (and PHI cycle breaking). */\r\n  if ((afree & (afree-1))) {  /* Two or more free registers? */\r\n    Reg r;\r\n    if (ra_noreg(irr->r)) {  /* Get a register for the right PHI. */\r\n      r = ra_allocref(as, ir->op2, allow);\r\n    } else {  /* Duplicate right PHI, need a copy (rare). */\r\n      r = ra_scratch(as, allow);\r\n      emit_movrr(as, irr, r, irr->r);\r\n    }\r\n    ir->r = (uint8_t)r;\r\n    rset_set(as->phiset, r);\r\n    as->phireg[r] = (IRRef1)ir->op1;\r\n    irt_setmark(irl->t);  /* Marks left PHIs _with_ register. */\r\n    if (ra_noreg(irl->r))\r\n      ra_sethint(irl->r, r); /* Set register hint for left PHI. */\r\n  } else {  /* Otherwise allocate a spill slot. */\r\n    /* This is overly restrictive, but it triggers only on synthetic code. */\r\n    if (ra_hasreg(irl->r) || ra_hasreg(irr->r))\r\n      lj_trace_err(as->J, LJ_TRERR_NYIPHI);\r\n    ra_spill(as, ir);\r\n    irr->s = ir->s;  /* Set right PHI spill slot. Sync left slot later. */\r\n  }\r\n}\r\n\r\nstatic void asm_loop_fixup(ASMState *as);\r\n\r\n/* Middle part of a loop. */\r\nstatic void asm_loop(ASMState *as)\r\n{\r\n  MCode *mcspill;\r\n  /* LOOP is a guard, so the snapno is up to date. */\r\n  as->loopsnapno = as->snapno;\r\n  if (as->gcsteps)\r\n    asm_gc_check(as);\r\n  /* LOOP marks the transition from the variant to the invariant part. */\r\n  as->flagmcp = as->invmcp = NULL;\r\n  as->sectref = 0;\r\n  if (!neverfuse(as)) as->fuseref = 0;\r\n  asm_phi_shuffle(as);\r\n  mcspill = as->mcp;\r\n  asm_phi_copyspill(as);\r\n  asm_loop_fixup(as);\r\n  as->mcloop = as->mcp;\r\n  RA_DBGX((as, \"===== LOOP =====\"));\r\n  if (!as->realign) RA_DBG_FLUSH();\r\n  if (as->mcp != mcspill)\r\n    emit_jmp(as, mcspill);\r\n}\r\n\r\n/* -- Target-specific assembler ------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_asm_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_asm_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_asm_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_asm_mips.h\"\r\n#else\r\n#error \"Missing assembler for target CPU\"\r\n#endif\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Head of a root trace. */\r\nstatic void asm_head_root(ASMState *as)\r\n{\r\n  int32_t spadj;\r\n  asm_head_root_base(as);\r\n  emit_setvmstate(as, (int32_t)as->T->traceno);\r\n  spadj = asm_stack_adjust(as);\r\n  as->T->spadjust = (uint16_t)spadj;\r\n  emit_spsub(as, spadj);\r\n  /* Root traces assume a checked stack for the starting proto. */\r\n  as->T->topslot = gcref(as->T->startpt)->pt.framesize;\r\n}\r\n\r\n/* Head of a side trace.\r\n**\r\n** The current simplistic algorithm requires that all slots inherited\r\n** from the parent are live in a register between pass 2 and pass 3. This\r\n** avoids the complexity of stack slot shuffling. But of course this may\r\n** overflow the register set in some cases and cause the dreaded error:\r\n** \"NYI: register coalescing too complex\". A refined algorithm is needed.\r\n*/\r\nstatic void asm_head_side(ASMState *as)\r\n{\r\n  IRRef1 sloadins[RID_MAX];\r\n  RegSet allow = RSET_ALL;  /* Inverse of all coalesced registers. */\r\n  RegSet live = RSET_EMPTY;  /* Live parent registers. */\r\n  IRIns *irp = &as->parent->ir[REF_BASE];  /* Parent base. */\r\n  int32_t spadj, spdelta;\r\n  int pass2 = 0;\r\n  int pass3 = 0;\r\n  IRRef i;\r\n\r\n  if (as->snapno && as->topslot > as->parent->topslot) {\r\n    /* Force snap #0 alloc to prevent register overwrite in stack check. */\r\n    as->snapno = 0;\r\n    asm_snap_alloc(as);\r\n  }\r\n  allow = asm_head_side_base(as, irp, allow);\r\n\r\n  /* Scan all parent SLOADs and collect register dependencies. */\r\n  for (i = as->stopins; i > REF_BASE; i--) {\r\n    IRIns *ir = IR(i);\r\n    RegSP rs;\r\n    lua_assert((ir->o == IR_SLOAD && (ir->op2 & IRSLOAD_PARENT)) ||\r\n\t       (LJ_SOFTFP && ir->o == IR_HIOP) || ir->o == IR_PVAL);\r\n    rs = as->parentmap[i - REF_FIRST];\r\n    if (ra_hasreg(ir->r)) {\r\n      rset_clear(allow, ir->r);\r\n      if (ra_hasspill(ir->s)) {\r\n\tra_save(as, ir, ir->r);\r\n\tcheckmclim(as);\r\n      }\r\n    } else if (ra_hasspill(ir->s)) {\r\n      irt_setmark(ir->t);\r\n      pass2 = 1;\r\n    }\r\n    if (ir->r == rs) {  /* Coalesce matching registers right now. */\r\n      ra_free(as, ir->r);\r\n    } else if (ra_hasspill(regsp_spill(rs))) {\r\n      if (ra_hasreg(ir->r))\r\n\tpass3 = 1;\r\n    } else if (ra_used(ir)) {\r\n      sloadins[rs] = (IRRef1)i;\r\n      rset_set(live, rs);  /* Block live parent register. */\r\n    }\r\n  }\r\n\r\n  /* Calculate stack frame adjustment. */\r\n  spadj = asm_stack_adjust(as);\r\n  spdelta = spadj - (int32_t)as->parent->spadjust;\r\n  if (spdelta < 0) {  /* Don't shrink the stack frame. */\r\n    spadj = (int32_t)as->parent->spadjust;\r\n    spdelta = 0;\r\n  }\r\n  as->T->spadjust = (uint16_t)spadj;\r\n\r\n  /* Reload spilled target registers. */\r\n  if (pass2) {\r\n    for (i = as->stopins; i > REF_BASE; i--) {\r\n      IRIns *ir = IR(i);\r\n      if (irt_ismarked(ir->t)) {\r\n\tRegSet mask;\r\n\tReg r;\r\n\tRegSP rs;\r\n\tirt_clearmark(ir->t);\r\n\trs = as->parentmap[i - REF_FIRST];\r\n\tif (!ra_hasspill(regsp_spill(rs)))\r\n\t  ra_sethint(ir->r, rs);  /* Hint may be gone, set it again. */\r\n\telse if (sps_scale(regsp_spill(rs))+spdelta == sps_scale(ir->s))\r\n\t  continue;  /* Same spill slot, do nothing. */\r\n\tmask = ((!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR) & allow;\r\n\tif (mask == RSET_EMPTY)\r\n\t  lj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n\tr = ra_allocref(as, i, mask);\r\n\tra_save(as, ir, r);\r\n\trset_clear(allow, r);\r\n\tif (r == rs) {  /* Coalesce matching registers right now. */\r\n\t  ra_free(as, r);\r\n\t  rset_clear(live, r);\r\n\t} else if (ra_hasspill(regsp_spill(rs))) {\r\n\t  pass3 = 1;\r\n\t}\r\n\tcheckmclim(as);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Store trace number and adjust stack frame relative to the parent. */\r\n  emit_setvmstate(as, (int32_t)as->T->traceno);\r\n  emit_spsub(as, spdelta);\r\n\r\n#if !LJ_TARGET_X86ORX64\r\n  /* Restore BASE register from parent spill slot. */\r\n  if (ra_hasspill(irp->s))\r\n    emit_spload(as, IR(REF_BASE), IR(REF_BASE)->r, sps_scale(irp->s));\r\n#endif\r\n\r\n  /* Restore target registers from parent spill slots. */\r\n  if (pass3) {\r\n    RegSet work = ~as->freeset & RSET_ALL;\r\n    while (work) {\r\n      Reg r = rset_pickbot(work);\r\n      IRRef ref = regcost_ref(as->cost[r]);\r\n      RegSP rs = as->parentmap[ref - REF_FIRST];\r\n      rset_clear(work, r);\r\n      if (ra_hasspill(regsp_spill(rs))) {\r\n\tint32_t ofs = sps_scale(regsp_spill(rs));\r\n\tra_free(as, r);\r\n\temit_spload(as, IR(ref), r, ofs);\r\n\tcheckmclim(as);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Shuffle registers to match up target regs with parent regs. */\r\n  for (;;) {\r\n    RegSet work;\r\n\r\n    /* Repeatedly coalesce free live registers by moving to their target. */\r\n    while ((work = as->freeset & live) != RSET_EMPTY) {\r\n      Reg rp = rset_pickbot(work);\r\n      IRIns *ir = IR(sloadins[rp]);\r\n      rset_clear(live, rp);\r\n      rset_clear(allow, rp);\r\n      ra_free(as, ir->r);\r\n      emit_movrr(as, ir, ir->r, rp);\r\n      checkmclim(as);\r\n    }\r\n\r\n    /* We're done if no live registers remain. */\r\n    if (live == RSET_EMPTY)\r\n      break;\r\n\r\n    /* Break cycles by renaming one target to a temp. register. */\r\n    if (live & RSET_GPR) {\r\n      RegSet tmpset = as->freeset & ~live & allow & RSET_GPR;\r\n      if (tmpset == RSET_EMPTY)\r\n\tlj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n      ra_rename(as, rset_pickbot(live & RSET_GPR), rset_pickbot(tmpset));\r\n    }\r\n    if (!LJ_SOFTFP && (live & RSET_FPR)) {\r\n      RegSet tmpset = as->freeset & ~live & allow & RSET_FPR;\r\n      if (tmpset == RSET_EMPTY)\r\n\tlj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n      ra_rename(as, rset_pickbot(live & RSET_FPR), rset_pickbot(tmpset));\r\n    }\r\n    checkmclim(as);\r\n    /* Continue with coalescing to fix up the broken cycle(s). */\r\n  }\r\n\r\n  /* Inherit top stack slot already checked by parent trace. */\r\n  as->T->topslot = as->parent->topslot;\r\n  if (as->topslot > as->T->topslot) {  /* Need to check for higher slot? */\r\n#ifdef EXITSTATE_CHECKEXIT\r\n    /* Highest exit + 1 indicates stack check. */\r\n    ExitNo exitno = as->T->nsnap;\r\n#else\r\n    /* Reuse the parent exit in the context of the parent trace. */\r\n    ExitNo exitno = as->J->exitno;\r\n#endif\r\n    as->T->topslot = (uint8_t)as->topslot;  /* Remember for child traces. */\r\n    asm_stack_check(as, as->topslot, irp, allow & RSET_GPR, exitno);\r\n  }\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Get base slot for a snapshot. */\r\nstatic BCReg asm_baseslot(ASMState *as, SnapShot *snap, int *gotframe)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n;\r\n  for (n = snap->nent; n > 0; n--) {\r\n    SnapEntry sn = map[n-1];\r\n    if ((sn & SNAP_FRAME)) {\r\n      *gotframe = 1;\r\n      return snap_slot(sn);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Link to another trace. */\r\nstatic void asm_tail_link(ASMState *as)\r\n{\r\n  SnapNo snapno = as->T->nsnap-1;  /* Last snapshot. */\r\n  SnapShot *snap = &as->T->snap[snapno];\r\n  int gotframe = 0;\r\n  BCReg baseslot = asm_baseslot(as, snap, &gotframe);\r\n\r\n  as->topslot = snap->topslot;\r\n  checkmclim(as);\r\n  ra_allocref(as, REF_BASE, RID2RSET(RID_BASE));\r\n\r\n  if (as->T->link == 0) {\r\n    /* Setup fixed registers for exit to interpreter. */\r\n    const BCIns *pc = snap_pc(as->T->snapmap[snap->mapofs + snap->nent]);\r\n    int32_t mres;\r\n    if (bc_op(*pc) == BC_JLOOP) {  /* NYI: find a better way to do this. */\r\n      BCIns *retpc = &traceref(as->J, bc_d(*pc))->startins;\r\n      if (bc_isret(bc_op(*retpc)))\r\n\tpc = retpc;\r\n    }\r\n    ra_allockreg(as, i32ptr(J2GG(as->J)->dispatch), RID_DISPATCH);\r\n    ra_allockreg(as, i32ptr(pc), RID_LPC);\r\n    mres = (int32_t)(snap->nslots - baseslot);\r\n    switch (bc_op(*pc)) {\r\n    case BC_CALLM: case BC_CALLMT:\r\n      mres -= (int32_t)(1 + bc_a(*pc) + bc_c(*pc)); break;\r\n    case BC_RETM: mres -= (int32_t)(bc_a(*pc) + bc_d(*pc)); break;\r\n    case BC_TSETM: mres -= (int32_t)bc_a(*pc); break;\r\n    default: if (bc_op(*pc) < BC_FUNCF) mres = 0; break;\r\n    }\r\n    ra_allockreg(as, mres, RID_RET);  /* Return MULTRES or 0. */\r\n  } else if (baseslot) {\r\n    /* Save modified BASE for linking to trace with higher start frame. */\r\n    emit_setgl(as, RID_BASE, jit_base);\r\n  }\r\n  emit_addptr(as, RID_BASE, 8*(int32_t)baseslot);\r\n\r\n  /* Sync the interpreter state with the on-trace state. */\r\n  asm_stack_restore(as, snap);\r\n\r\n  /* Root traces that add frames need to check the stack at the end. */\r\n  if (!as->parent && gotframe)\r\n    asm_stack_check(as, as->topslot, NULL, as->freeset & RSET_GPR, snapno);\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Clear reg/sp for all instructions and add register hints. */\r\nstatic void asm_setup_regsp(ASMState *as)\r\n{\r\n  GCtrace *T = as->T;\r\n  int sink = T->sinktags;\r\n  IRRef nins = T->nins;\r\n  IRIns *ir, *lastir;\r\n  int inloop;\r\n#if LJ_TARGET_ARM\r\n  uint32_t rload = 0xa6402a64;\r\n#endif\r\n\r\n  ra_setup(as);\r\n\r\n  /* Clear reg/sp for constants. */\r\n  for (ir = IR(T->nk), lastir = IR(REF_BASE); ir < lastir; ir++)\r\n    ir->prev = REGSP_INIT;\r\n\r\n  /* REF_BASE is used for implicit references to the BASE register. */\r\n  lastir->prev = REGSP_HINT(RID_BASE);\r\n\r\n  ir = IR(nins-1);\r\n  if (ir->o == IR_RENAME) {\r\n    do { ir--; nins--; } while (ir->o == IR_RENAME);\r\n    T->nins = nins;  /* Remove any renames left over from ASM restart. */\r\n  }\r\n  as->snaprename = nins;\r\n  as->snapref = nins;\r\n  as->snapno = T->nsnap;\r\n\r\n  as->stopins = REF_BASE;\r\n  as->orignins = nins;\r\n  as->curins = nins;\r\n\r\n  /* Setup register hints for parent link instructions. */\r\n  ir = IR(REF_FIRST);\r\n  if (as->parent) {\r\n    uint16_t *p;\r\n    lastir = lj_snap_regspmap(as->parent, as->J->exitno, ir);\r\n    if (lastir - ir > LJ_MAX_JSLOTS)\r\n      lj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n    as->stopins = (IRRef)((lastir-1) - as->ir);\r\n    for (p = as->parentmap; ir < lastir; ir++) {\r\n      RegSP rs = ir->prev;\r\n      *p++ = (uint16_t)rs;  /* Copy original parent RegSP to parentmap. */\r\n      if (!ra_hasspill(regsp_spill(rs)))\r\n\tir->prev = (uint16_t)REGSP_HINT(regsp_reg(rs));\r\n      else\r\n\tir->prev = REGSP_INIT;\r\n    }\r\n  }\r\n\r\n  inloop = 0;\r\n  as->evenspill = SPS_FIRST;\r\n  for (lastir = IR(nins); ir < lastir; ir++) {\r\n    if (sink) {\r\n      if (ir->r == RID_SINK)\r\n\tcontinue;\r\n      if (ir->r == RID_SUNK) {  /* Revert after ASM restart. */\r\n\tir->r = RID_SINK;\r\n\tcontinue;\r\n      }\r\n    }\r\n    switch (ir->o) {\r\n    case IR_LOOP:\r\n      inloop = 1;\r\n      break;\r\n#if LJ_TARGET_ARM\r\n    case IR_SLOAD:\r\n      if (!((ir->op2 & IRSLOAD_TYPECHECK) || (ir+1)->o == IR_HIOP))\r\n\tbreak;\r\n      /* fallthrough */\r\n    case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n      if (!LJ_SOFTFP && irt_isnum(ir->t)) break;\r\n      ir->prev = (uint16_t)REGSP_HINT((rload & 15));\r\n      rload = lj_ror(rload, 4);\r\n      continue;\r\n#endif\r\n    case IR_CALLXS: {\r\n      CCallInfo ci;\r\n      ci.flags = asm_callx_flags(as, ir);\r\n      ir->prev = asm_setup_call_slots(as, ir, &ci);\r\n      if (inloop)\r\n\tas->modset |= RSET_SCRATCH;\r\n      continue;\r\n      }\r\n    case IR_CALLN: case IR_CALLL: case IR_CALLS: {\r\n      const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n      ir->prev = asm_setup_call_slots(as, ir, ci);\r\n      if (inloop)\r\n\tas->modset |= (ci->flags & CCI_NOFPRCLOBBER) ?\r\n\t\t      (RSET_SCRATCH & ~RSET_FPR) : RSET_SCRATCH;\r\n      continue;\r\n      }\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n    case IR_HIOP:\r\n      switch ((ir-1)->o) {\r\n#if LJ_SOFTFP && LJ_TARGET_ARM\r\n      case IR_SLOAD: case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n\tif (ra_hashint((ir-1)->r)) {\r\n\t  ir->prev = (ir-1)->prev + 1;\r\n\t  continue;\r\n\t}\r\n\tbreak;\r\n#endif\r\n#if !LJ_SOFTFP && LJ_NEED_FP64\r\n      case IR_CONV:\r\n\tif (irt_isfp((ir-1)->t)) {\r\n\t  ir->prev = REGSP_HINT(RID_FPRET);\r\n\t  continue;\r\n\t}\r\n\t/* fallthrough */\r\n#endif\r\n      case IR_CALLN: case IR_CALLXS:\r\n#if LJ_SOFTFP\r\n      case IR_MIN: case IR_MAX:\r\n#endif\r\n\t(ir-1)->prev = REGSP_HINT(RID_RETLO);\r\n\tir->prev = REGSP_HINT(RID_RETHI);\r\n\tcontinue;\r\n      default:\r\n\tbreak;\r\n      }\r\n      break;\r\n#endif\r\n#if LJ_SOFTFP\r\n    case IR_MIN: case IR_MAX:\r\n      if ((ir+1)->o != IR_HIOP) break;\r\n      /* fallthrough */\r\n#endif\r\n    /* C calls evict all scratch regs and return results in RID_RET. */\r\n    case IR_SNEW: case IR_XSNEW: case IR_NEWREF:\r\n      if (REGARG_NUMGPR < 3 && as->evenspill < 3)\r\n\tas->evenspill = 3;  /* lj_str_new and lj_tab_newkey need 3 args. */\r\n    case IR_TNEW: case IR_TDUP: case IR_CNEW: case IR_CNEWI: case IR_TOSTR:\r\n      ir->prev = REGSP_HINT(RID_RET);\r\n      if (inloop)\r\n\tas->modset = RSET_SCRATCH;\r\n      continue;\r\n    case IR_STRTO: case IR_OBAR:\r\n      if (inloop)\r\n\tas->modset = RSET_SCRATCH;\r\n      break;\r\n#if !LJ_TARGET_X86ORX64 && !LJ_SOFTFP\r\n    case IR_ATAN2: case IR_LDEXP:\r\n#endif\r\n    case IR_POW:\r\n      if (!LJ_SOFTFP && irt_isnum(ir->t)) {\r\n#if LJ_TARGET_X86ORX64\r\n\tir->prev = REGSP_HINT(RID_XMM0);\r\n\tif (inloop)\r\n\t  as->modset |= RSET_RANGE(RID_XMM0, RID_XMM1+1)|RID2RSET(RID_EAX);\r\n#else\r\n\tir->prev = REGSP_HINT(RID_FPRET);\r\n\tif (inloop)\r\n\t  as->modset |= RSET_SCRATCH;\r\n#endif\r\n\tcontinue;\r\n      }\r\n      /* fallthrough for integer POW */\r\n    case IR_DIV: case IR_MOD:\r\n      if (!irt_isnum(ir->t)) {\r\n\tir->prev = REGSP_HINT(RID_RET);\r\n\tif (inloop)\r\n\t  as->modset |= (RSET_SCRATCH & RSET_GPR);\r\n\tcontinue;\r\n      }\r\n      break;\r\n    case IR_FPMATH:\r\n#if LJ_TARGET_X86ORX64\r\n      if (ir->op2 == IRFPM_EXP2) {  /* May be joined to lj_vm_pow_sse. */\r\n\tir->prev = REGSP_HINT(RID_XMM0);\r\n#if !LJ_64\r\n\tif (as->evenspill < 4)  /* Leave room for 16 byte scratch area. */\r\n\t  as->evenspill = 4;\r\n#endif\r\n\tif (inloop)\r\n\t  as->modset |= RSET_RANGE(RID_XMM0, RID_XMM2+1)|RID2RSET(RID_EAX);\r\n\tcontinue;\r\n      } else if (ir->op2 <= IRFPM_TRUNC && !(as->flags & JIT_F_SSE4_1)) {\r\n\tir->prev = REGSP_HINT(RID_XMM0);\r\n\tif (inloop)\r\n\t  as->modset |= RSET_RANGE(RID_XMM0, RID_XMM3+1)|RID2RSET(RID_EAX);\r\n\tcontinue;\r\n      }\r\n      break;\r\n#else\r\n      ir->prev = REGSP_HINT(RID_FPRET);\r\n      if (inloop)\r\n\tas->modset |= RSET_SCRATCH;\r\n      continue;\r\n#endif\r\n#if LJ_TARGET_X86ORX64\r\n    /* Non-constant shift counts need to be in RID_ECX on x86/x64. */\r\n    case IR_BSHL: case IR_BSHR: case IR_BSAR: case IR_BROL: case IR_BROR:\r\n      if (!irref_isk(ir->op2) && !ra_hashint(IR(ir->op2)->r)) {\r\n\tIR(ir->op2)->r = REGSP_HINT(RID_ECX);\r\n\tif (inloop)\r\n\t  rset_set(as->modset, RID_ECX);\r\n      }\r\n      break;\r\n#endif\r\n    /* Do not propagate hints across type conversions or loads. */\r\n    case IR_TOBIT:\r\n    case IR_XLOAD:\r\n#if !LJ_TARGET_ARM\r\n    case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n#endif\r\n      break;\r\n    case IR_CONV:\r\n      if (irt_isfp(ir->t) || (ir->op2 & IRCONV_SRCMASK) == IRT_NUM ||\r\n\t  (ir->op2 & IRCONV_SRCMASK) == IRT_FLOAT)\r\n\tbreak;\r\n      /* fallthrough */\r\n    default:\r\n      /* Propagate hints across likely 'op reg, imm' or 'op reg'. */\r\n      if (irref_isk(ir->op2) && !irref_isk(ir->op1) &&\r\n\t  ra_hashint(regsp_reg(IR(ir->op1)->prev))) {\r\n\tir->prev = IR(ir->op1)->prev;\r\n\tcontinue;\r\n      }\r\n      break;\r\n    }\r\n    ir->prev = REGSP_INIT;\r\n  }\r\n  if ((as->evenspill & 1))\r\n    as->oddspill = as->evenspill++;\r\n  else\r\n    as->oddspill = 0;\r\n}\r\n\r\n/* -- Assembler core ------------------------------------------------------ */\r\n\r\n/* Assemble a trace. */\r\nvoid lj_asm_trace(jit_State *J, GCtrace *T)\r\n{\r\n  ASMState as_;\r\n  ASMState *as = &as_;\r\n  MCode *origtop;\r\n\r\n  /* Ensure an initialized instruction beyond the last one for HIOP checks. */\r\n  J->cur.nins = lj_ir_nextins(J);\r\n  J->cur.ir[J->cur.nins].o = IR_NOP;\r\n\r\n  /* Setup initial state. Copy some fields to reduce indirections. */\r\n  as->J = J;\r\n  as->T = T;\r\n  as->ir = T->ir;\r\n  as->flags = J->flags;\r\n  as->loopref = J->loopref;\r\n  as->realign = NULL;\r\n  as->loopinv = 0;\r\n  as->parent = J->parent ? traceref(J, J->parent) : NULL;\r\n\r\n  /* Reserve MCode memory. */\r\n  as->mctop = origtop = lj_mcode_reserve(J, &as->mcbot);\r\n  as->mcp = as->mctop;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  asm_setup_target(as);\r\n\r\n  do {\r\n    as->mcp = as->mctop;\r\n#ifdef LUA_USE_ASSERT\r\n    as->mcp_prev = as->mcp;\r\n#endif\r\n    as->curins = T->nins;\r\n    RA_DBG_START();\r\n    RA_DBGX((as, \"===== STOP =====\"));\r\n\r\n    /* General trace setup. Emit tail of trace. */\r\n    asm_tail_prep(as);\r\n    as->mcloop = NULL;\r\n    as->flagmcp = NULL;\r\n    as->topslot = 0;\r\n    as->gcsteps = 0;\r\n    as->sectref = as->loopref;\r\n    as->fuseref = (as->flags & JIT_F_OPT_FUSE) ? as->loopref : FUSE_DISABLED;\r\n    asm_setup_regsp(as);\r\n    if (!as->loopref)\r\n      asm_tail_link(as);\r\n\r\n    /* Assemble a trace in linear backwards order. */\r\n    for (as->curins--; as->curins > as->stopins; as->curins--) {\r\n      IRIns *ir = IR(as->curins);\r\n      lua_assert(!(LJ_32 && irt_isint64(ir->t)));  /* Handled by SPLIT. */\r\n      if (!ra_used(ir) && !ir_sideeff(ir) && (as->flags & JIT_F_OPT_DCE))\r\n\tcontinue;  /* Dead-code elimination can be soooo easy. */\r\n      if (irt_isguard(ir->t))\r\n\tasm_snap_prep(as);\r\n      RA_DBG_REF();\r\n      checkmclim(as);\r\n      asm_ir(as, ir);\r\n    }\r\n  } while (as->realign);  /* Retry in case the MCode needs to be realigned. */\r\n\r\n  /* Emit head of trace. */\r\n  RA_DBG_REF();\r\n  checkmclim(as);\r\n  if (as->gcsteps > 0) {\r\n    as->curins = as->T->snap[0].ref;\r\n    asm_snap_prep(as);  /* The GC check is a guard. */\r\n    asm_gc_check(as);\r\n  }\r\n  ra_evictk(as);\r\n  if (as->parent)\r\n    asm_head_side(as);\r\n  else\r\n    asm_head_root(as);\r\n  asm_phi_fixup(as);\r\n\r\n  RA_DBGX((as, \"===== START ====\"));\r\n  RA_DBG_FLUSH();\r\n  if (as->freeset != RSET_ALL)\r\n    lj_trace_err(as->J, LJ_TRERR_BADRA);  /* Ouch! Should never happen. */\r\n\r\n  /* Set trace entry point before fixing up tail to allow link to self. */\r\n  T->mcode = as->mcp;\r\n  T->mcloop = as->mcloop ? (MSize)((char *)as->mcloop - (char *)as->mcp) : 0;\r\n  if (!as->loopref)\r\n    asm_tail_fixup(as, T->link);  /* Note: this may change as->mctop! */\r\n  T->szmcode = (MSize)((char *)as->mctop - (char *)as->mcp);\r\n  lj_mcode_sync(T->mcode, origtop);\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm.h",
    "content": "/*\r\n** IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ASM_H\r\n#define _LJ_ASM_H\r\n\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_asm_trace(jit_State *J, GCtrace *T);\r\nLJ_FUNC void lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno,\r\n\t\t\t      MCode *target);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm_arm.h",
    "content": "/*\r\n** ARM IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a scratch register pair. */\r\nstatic Reg ra_scratchpair(ASMState *as, RegSet allow)\r\n{\r\n  RegSet pick1 = as->freeset & allow;\r\n  RegSet pick2 = pick1 & (pick1 >> 1) & RSET_GPREVEN;\r\n  Reg r;\r\n  if (pick2) {\r\n    r = rset_picktop(pick2);\r\n  } else {\r\n    RegSet pick = pick1 & (allow >> 1) & RSET_GPREVEN;\r\n    if (pick) {\r\n      r = rset_picktop(pick);\r\n      ra_restore(as, regcost_ref(as->cost[r+1]));\r\n    } else {\r\n      pick = pick1 & (allow << 1) & RSET_GPRODD;\r\n      if (pick) {\r\n\tr = ra_restore(as, regcost_ref(as->cost[rset_picktop(pick)-1]));\r\n      } else {\r\n\tr = ra_evict(as, allow & (allow >> 1) & RSET_GPREVEN);\r\n\tra_restore(as, regcost_ref(as->cost[r+1]));\r\n      }\r\n    }\r\n  }\r\n  lua_assert(rset_test(RSET_GPREVEN, r));\r\n  ra_modified(as, r);\r\n  ra_modified(as, r+1);\r\n  RA_DBGX((as, \"scratchpair    $r $r\", r, r+1));\r\n  return r;\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_allocref(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_allocref(as, ir->op2, allow);\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_allocref(as, ir->op1, allow);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n#endif\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Generate an exit stub group at the bottom of the reserved MCode memory. */\r\nstatic MCode *asm_exitstub_gen(ASMState *as, ExitNo group)\r\n{\r\n  MCode *mxp = as->mcbot;\r\n  int i;\r\n  if (mxp + 4*4+4*EXITSTUBS_PER_GROUP >= as->mctop)\r\n    asm_mclimit(as);\r\n  /* str lr, [sp]; bl ->vm_exit_handler; .long DISPATCH_address, group. */\r\n  *mxp++ = ARMI_STR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_LR)|ARMF_N(RID_SP);\r\n  *mxp = ARMI_BL|((((MCode *)(void *)lj_vm_exit_handler-mxp)-2)&0x00ffffffu);\r\n  mxp++;\r\n  *mxp++ = (MCode)i32ptr(J2GG(as->J)->dispatch);  /* DISPATCH address */\r\n  *mxp++ = group*EXITSTUBS_PER_GROUP;\r\n  for (i = 0; i < EXITSTUBS_PER_GROUP; i++)\r\n    *mxp++ = ARMI_B|((-6-i)&0x00ffffffu);\r\n  lj_mcode_sync(as->mcbot, mxp);\r\n  lj_mcode_commitbot(as->J, mxp);\r\n  as->mcbot = mxp;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  return mxp - EXITSTUBS_PER_GROUP;\r\n}\r\n\r\n/* Setup all needed exit stubs. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  if (nexits >= EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR)\r\n    lj_trace_err(as->J, LJ_TRERR_SNAPOV);\r\n  for (i = 0; i < (nexits+EXITSTUBS_PER_GROUP-1)/EXITSTUBS_PER_GROUP; i++)\r\n    if (as->J->exitstubgroup[i] == NULL)\r\n      as->J->exitstubgroup[i] = asm_exitstub_gen(as, i);\r\n}\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guardcc(ASMState *as, ARMCC cc)\r\n{\r\n  MCode *target = exitstub_addr(as->J, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *p = ARMI_BL | ((target-p-2) & 0x00ffffffu);\r\n    emit_branch(as, ARMF_CC(ARMI_B, cc^1), p+1);\r\n    return;\r\n  }\r\n  emit_branch(as, ARMF_CC(ARMI_BL, cc), target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow,\r\n\t\t\t  int lim)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (ofs > -lim && ofs < lim) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (ofs < lim) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\t*ofsp = (ofs & 255);  /* Mask out less bits to allow LDRD. */\r\n\treturn ra_allock(as, (ofs & ~255), allow);\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse m operand into arithmetic/logic instructions. */\r\nstatic uint32_t asm_fuseopm(ASMState *as, ARMIns ai, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_hasreg(ir->r)) {\r\n    ra_noweak(as, ir->r);\r\n    return ARMF_M(ir->r);\r\n  } else if (irref_isk(ref)) {\r\n    uint32_t k = emit_isk12(ai, ir->i);\r\n    if (k)\r\n      return k;\r\n  } else if (mayfuse(as, ref)) {\r\n    if (ir->o >= IR_BSHL && ir->o <= IR_BROR) {\r\n      Reg m = ra_alloc1(as, ir->op1, allow);\r\n      ARMShift sh = ir->o == IR_BSHL ? ARMSH_LSL :\r\n\t\t    ir->o == IR_BSHR ? ARMSH_LSR :\r\n\t\t    ir->o == IR_BSAR ? ARMSH_ASR : ARMSH_ROR;\r\n      if (irref_isk(ir->op2)) {\r\n\treturn m | ARMF_SH(sh, (IR(ir->op2)->i & 31));\r\n      } else {\r\n\tReg s = ra_alloc1(as, ir->op2, rset_exclude(allow, m));\r\n\treturn m | ARMF_RSH(sh, s);\r\n      }\r\n    } else if (ir->o == IR_ADD && ir->op1 == ir->op2) {\r\n      Reg m = ra_alloc1(as, ir->op1, allow);\r\n      return m | ARMF_SH(ARMSH_LSL, 1);\r\n    }\r\n  }\r\n  return ra_allocref(as, ref, allow);\r\n}\r\n\r\n/* Fuse shifts into loads/stores. Only bother with BSHL 2 => lsl #2. */\r\nstatic IRRef asm_fuselsl2(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r) && mayfuse(as, ref) && ir->o == IR_BSHL &&\r\n      irref_isk(ir->op2) && IR(ir->op2)->i == 2)\r\n    return ir->op1;\r\n  return 0;  /* No fusion. */\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, ARMIns ai, Reg rd, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    int32_t lim = (!LJ_SOFTFP && (ai & 0x08000000)) ? 1024 :\r\n\t\t   (ai & 0x04000000) ? 4096 : 256;\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) &&\r\n\t  (ofs2 = ofs + IR(ir->op2)->i) > -lim && ofs2 < lim &&\r\n\t  (!(!LJ_SOFTFP && (ai & 0x08000000)) || !(ofs2 & 3))) {\r\n\tofs = ofs2;\r\n\tref = ir->op1;\r\n      } else if (ofs == 0 && !(!LJ_SOFTFP && (ai & 0x08000000))) {\r\n\tIRRef lref = ir->op1, rref = ir->op2;\r\n\tReg rn, rm;\r\n\tif ((ai & 0x04000000)) {\r\n\t  IRRef sref = asm_fuselsl2(as, rref);\r\n\t  if (sref) {\r\n\t    rref = sref;\r\n\t    ai |= ARMF_SH(ARMSH_LSL, 2);\r\n\t  } else if ((sref = asm_fuselsl2(as, lref)) != 0) {\r\n\t    lref = rref;\r\n\t    rref = sref;\r\n\t    ai |= ARMF_SH(ARMSH_LSL, 2);\r\n\t  }\r\n\t}\r\n\trn = ra_alloc1(as, lref, allow);\r\n\trm = ra_alloc1(as, rref, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000)) ai |= ARMI_LS_R;\r\n\temit_dnm(as, ai|ARMI_LS_P|ARMI_LS_U, rd, rn, rm);\r\n\treturn;\r\n      }\r\n    } else if (ir->o == IR_STRREF && !(!LJ_SOFTFP && (ai & 0x08000000))) {\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs += IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs += IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      } else {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg rn = ra_alloc1(as, ir->op1, allow);\r\n\tuint32_t m = asm_fuseopm(as, 0, ir->op2, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000))\r\n\t  emit_lso(as, ai, rd, rd, ofs);\r\n\telse\r\n\t  emit_lsox(as, ai, rd, rd, ofs);\r\n\temit_dn(as, ARMI_ADD^m, rd, rn);\r\n\treturn;\r\n      }\r\n      if (ofs <= -lim || ofs >= lim) {\r\n\tReg rn = ra_alloc1(as, ref, allow);\r\n\tReg rm = ra_allock(as, ofs, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000)) ai |= ARMI_LS_R;\r\n\temit_dnm(as, ai|ARMI_LS_P|ARMI_LS_U, rd, rn, rm);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n#if !LJ_SOFTFP\r\n  if ((ai & 0x08000000))\r\n    emit_vlso(as, ai, rd, base, ofs);\r\n  else\r\n#endif\r\n  if ((ai & 0x04000000))\r\n    emit_lso(as, ai, rd, base, ofs);\r\n  else\r\n    emit_lsox(as, ai, rd, base, ofs);\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Fuse to multiply-add/sub instruction. */\r\nstatic int asm_fusemadd(ASMState *as, IRIns *ir, ARMIns ai, ARMIns air)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  IRIns *irm;\r\n  if (lref != rref &&\r\n      ((mayfuse(as, lref) && (irm = IR(lref), irm->o == IR_MUL) &&\r\n\tra_noreg(irm->r)) ||\r\n       (mayfuse(as, rref) && (irm = IR(rref), irm->o == IR_MUL) &&\r\n\t(rref = lref, ai = air, ra_noreg(irm->r))))) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg add = ra_hintalloc(as, rref, dest, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, irm,\r\n\t\t\trset_exclude(rset_exclude(RSET_FPR, dest), add));\r\n    right = (left >> 8); left &= 255;\r\n    emit_dnm(as, ai, (dest & 15), (left & 15), (right & 15));\r\n    if (dest != add) emit_dm(as, ARMI_VMOV_D, (dest & 15), (add & 15));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_NARGS(ci);\r\n  int32_t ofs = 0;\r\n#if LJ_SOFTFP\r\n  Reg gpr = REGARG_FIRSTGPR;\r\n#else\r\n  Reg gpr, fpr = REGARG_FIRSTFPR, fprodd = 0;\r\n#endif\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n#if !LJ_SOFTFP\r\n  for (gpr = REGARG_FIRSTGPR; gpr <= REGARG_LASTGPR; gpr++)\r\n    as->cost[gpr] = REGCOST(~0u, ASMREF_L);\r\n  gpr = REGARG_FIRSTGPR;\r\n#endif\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    IRIns *ir = IR(ref);\r\n#if !LJ_SOFTFP\r\n    if (ref && irt_isfp(ir->t)) {\r\n      RegSet of = as->freeset;\r\n      Reg src;\r\n      if (!LJ_ABI_SOFTFP && !(ci->flags & CCI_VARARG)) {\r\n\tif (irt_isnum(ir->t)) {\r\n\t  if (fpr <= REGARG_LASTFPR) {\r\n\t    ra_leftov(as, fpr, ref);\r\n\t    fpr++;\r\n\t    continue;\r\n\t  }\r\n\t} else if (fprodd) {  /* Ick. */\r\n\t  src = ra_alloc1(as, ref, RSET_FPR);\r\n\t  emit_dm(as, ARMI_VMOV_S, (fprodd & 15), (src & 15) | 0x00400000);\r\n\t  fprodd = 0;\r\n\t  continue;\r\n\t} else if (fpr <= REGARG_LASTFPR) {\r\n\t  ra_leftov(as, fpr, ref);\r\n\t  fprodd = fpr++;\r\n\t  continue;\r\n\t}\r\n\t/* Workaround to protect argument GPRs from being used for remat. */\r\n\tas->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n\tsrc = ra_alloc1(as, ref, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n\tas->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n\tfprodd = 0;\r\n\tgoto stackfp;\r\n      }\r\n      /* Workaround to protect argument GPRs from being used for remat. */\r\n      as->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n      src = ra_alloc1(as, ref, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n      as->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n      if (irt_isnum(ir->t)) gpr = (gpr+1) & ~1u;\r\n      if (gpr <= REGARG_LASTGPR) {\r\n\tlua_assert(rset_test(as->freeset, gpr));  /* Must have been evicted. */\r\n\tif (irt_isnum(ir->t)) {\r\n\t  lua_assert(rset_test(as->freeset, gpr+1));  /* Ditto. */\r\n\t  emit_dnm(as, ARMI_VMOV_RR_D, gpr, gpr+1, (src & 15));\r\n\t  gpr += 2;\r\n\t} else {\r\n\t  emit_dn(as, ARMI_VMOV_R_S, gpr, (src & 15));\r\n\t  gpr++;\r\n\t}\r\n      } else {\r\n      stackfp:\r\n\tif (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\temit_spstore(as, ir, src, ofs);\r\n\tofs += irt_isnum(ir->t) ? 8 : 4;\r\n      }\r\n    } else\r\n#endif\r\n    {\r\n      if (gpr <= REGARG_LASTGPR) {\r\n\tlua_assert(rset_test(as->freeset, gpr));  /* Must have been evicted. */\r\n\tif (ref) ra_leftov(as, gpr, ref);\r\n\tgpr++;\r\n      } else {\r\n\tif (ref) {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_GPR);\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t}\r\n\tofs += 4;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (!LJ_SOFTFP && irt_isfp(ir->t)) {\r\n      if (LJ_ABI_SOFTFP || (ci->flags & (CCI_CASTU64|CCI_VARARG))) {\r\n\tReg dest = (ra_dest(as, ir, RSET_FPR) & 15);\r\n\tif (irt_isnum(ir->t))\r\n\t  emit_dnm(as, ARMI_VMOV_D_RR, RID_RETLO, RID_RETHI, dest);\r\n\telse\r\n\t  emit_dn(as, ARMI_VMOV_S_R, RID_RET, dest);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n  UNUSED(ci);\r\n}\r\n\r\nstatic void asm_call(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX];\r\n  const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n  asm_collectargs(as, ir, ci, args);\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(irf->i);\r\n  } else {  /* Need a non-argument register for indirect calls. */\r\n    Reg freg = ra_alloc1(as, func, RSET_RANGE(RID_R4, RID_R12+1));\r\n    emit_m(as, ARMI_BLXr, freg);\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  /* Need to force a spill on REF_BASE now to update the stack slot. */\r\n  emit_lso(as, ARMI_STR, base, RID_SP, ra_spill(as, IR(REF_BASE)));\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_nm(as, ARMI_CMP, RID_TMP,\r\n\t  ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_lso(as, ARMI_LDR, RID_TMP, base, -4);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ARMI_VCMP_D, (tmp & 15), (left & 15));\r\n  emit_dm(as, ARMI_VCVT_F64_S32, (tmp & 15), (tmp & 15));\r\n  emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n  emit_dm(as, ARMI_VCVT_S32_F64, (tmp & 15), (left & 15));\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n  emit_dnm(as, ARMI_VADD_D, (tmp & 15), (left & 15), (right & 15));\r\n}\r\n#endif\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if !LJ_SOFTFP\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n#endif\r\n  IRRef lref = ir->op1;\r\n  /* 64 bit integer conversions are handled by SPLIT. */\r\n  lua_assert(!irt_isint64(ir->t) && !(st == IRT_I64 || st == IRT_U64));\r\n#if LJ_SOFTFP\r\n  /* FP conversions are handled by SPLIT. */\r\n  lua_assert(!irt_isfp(ir->t) && !(st == IRT_NUM || st == IRT_FLOAT));\r\n  /* Can't check for same types: SPLIT uses CONV int.int + BXOR for sfp NEG. */\r\n#else\r\n  lua_assert(irt_type(ir->t) != st);\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      emit_dm(as, st == IRT_NUM ? ARMI_VCVT_F32_F64 : ARMI_VCVT_F64_F32,\r\n\t      (dest & 15), (ra_alloc1(as, lref, RSET_FPR) & 15));\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      ARMIns ai = irt_isfloat(ir->t) ?\r\n\t(st == IRT_INT ? ARMI_VCVT_F32_S32 : ARMI_VCVT_F32_U32) :\r\n\t(st == IRT_INT ? ARMI_VCVT_F64_S32 : ARMI_VCVT_F64_U32);\r\n      emit_dm(as, ai, (dest & 15), (dest & 15));\r\n      emit_dn(as, ARMI_VMOV_S_R, left, (dest & 15));\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      ARMIns ai;\r\n      emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n      ai = irt_isint(ir->t) ?\r\n\t(st == IRT_NUM ? ARMI_VCVT_S32_F64 : ARMI_VCVT_S32_F32) :\r\n\t(st == IRT_NUM ? ARMI_VCVT_U32_F64 : ARMI_VCVT_U32_F32);\r\n      emit_dm(as, ai, (tmp & 15), (left & 15));\r\n    }\r\n  } else\r\n#endif\r\n  {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((as->flags & JIT_F_ARMV6)) {\r\n\tARMIns ai = st == IRT_I8 ? ARMI_SXTB :\r\n\t\t    st == IRT_U8 ? ARMI_UXTB :\r\n\t\t    st == IRT_I16 ? ARMI_SXTH : ARMI_UXTH;\r\n\temit_dm(as, ai, dest, left);\r\n      } else if (st == IRT_U8) {\r\n\temit_dn(as, ARMI_AND|ARMI_K12|255, dest, left);\r\n      } else {\r\n\tuint32_t shift = st == IRT_I8 ? 24 : 16;\r\n\tARMShift sh = st == IRT_U16 ? ARMSH_LSR : ARMSH_ASR;\r\n\temit_dm(as, ARMI_MOV|ARMF_SH(sh, shift), dest, RID_TMP);\r\n\temit_dm(as, ARMI_MOV|ARMF_SH(ARMSH_LSL, shift), RID_TMP, left);\r\n      }\r\n    } else {  /* Handle 32/32 bit no-op (cast). */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\n#if !LJ_SOFTFP && LJ_HASFFI\r\nstatic void asm_conv64(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  IRCallID id;\r\n  CCallInfo ci;\r\n  IRRef args[2];\r\n  args[0] = (ir-1)->op1;\r\n  args[1] = ir->op1;\r\n  if (st == IRT_NUM || st == IRT_FLOAT) {\r\n    id = IRCALL_fp64_d2l + ((st == IRT_FLOAT) ? 2 : 0) + (dt - IRT_I64);\r\n    ir--;\r\n  } else {\r\n    id = IRCALL_fp64_l2d + ((dt == IRT_FLOAT) ? 2 : 0) + (st - IRT_I64);\r\n  }\r\n  ci = lj_ir_callinfo[id];\r\n#if !LJ_ABI_SOFTFP\r\n  ci.flags |= CCI_VARARG;  /* These calls don't use the hard-float ABI! */\r\n#endif\r\n  asm_setupresult(as, ir, &ci);\r\n  asm_gencall(as, &ci, args);\r\n}\r\n#endif\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  Reg rlo = 0, rhi = 0, tmp;\r\n  int destused = ra_used(ir);\r\n  int32_t ofs = 0;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n#if LJ_SOFTFP\r\n  if (destused) {\r\n    if (ra_hasspill(ir->s) && ra_hasspill((ir+1)->s) &&\r\n\t(ir->s & 1) == 0 && ir->s + 1 == (ir+1)->s) {\r\n      int i;\r\n      for (i = 0; i < 2; i++) {\r\n\tReg r = (ir+i)->r;\r\n\tif (ra_hasreg(r)) {\r\n\t  ra_free(as, r);\r\n\t  ra_modified(as, r);\r\n\t  emit_spload(as, ir+i, r, sps_scale((ir+i)->s));\r\n\t}\r\n      }\r\n      ofs = sps_scale(ir->s);\r\n      destused = 0;\r\n    } else {\r\n      rhi = ra_dest(as, ir+1, RSET_GPR);\r\n      rlo = ra_dest(as, ir, rset_exclude(RSET_GPR, rhi));\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_EQ);\r\n  if (destused) {\r\n    emit_lso(as, ARMI_LDR, rhi, RID_SP, 4);\r\n    emit_lso(as, ARMI_LDR, rlo, RID_SP, 0);\r\n  }\r\n#else\r\n  UNUSED(rhi);\r\n  if (destused) {\r\n    if (ra_hasspill(ir->s)) {\r\n      ofs = sps_scale(ir->s);\r\n      destused = 0;\r\n      if (ra_hasreg(ir->r)) {\r\n\tra_free(as, ir->r);\r\n\tra_modified(as, ir->r);\r\n\temit_spload(as, ir, ir->r, ofs);\r\n      }\r\n    } else {\r\n      rlo = ra_dest(as, ir, RSET_FPR);\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_EQ);\r\n  if (destused)\r\n    emit_vlso(as, ARMI_VLDR_D, rlo, RID_SP, 0);\r\n#endif\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, RID_RET);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n  if (ofs == 0)\r\n    emit_dm(as, ARMI_MOV, tmp, RID_SP);\r\n  else\r\n    emit_opk(as, ARMI_ADD, tmp, RID_SP, ofs, RSET_GPR);\r\n}\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref)) {\r\n      /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    } else {\r\n#if LJ_SOFTFP\r\n      lua_assert(0);\r\n#else\r\n      /* Otherwise force a spill and use the spill slot. */\r\n      emit_opk(as, ARMI_ADD, dest, RID_SP, ra_spill(as, ir), RSET_GPR);\r\n#endif\r\n    }\r\n  } else {\r\n    /* Otherwise use [sp] and [sp+4] to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_dm(as, ARMI_MOV, dest, RID_SP);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_lso(as, ARMI_STR, src, RID_SP, 0);\r\n    }\r\n    if ((ir+1)->o == IR_HIOP)\r\n      type = ra_alloc1(as, ref+1, allow);\r\n    else\r\n      type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_lso(as, ARMI_STR, type, RID_SP, 4);\r\n  }\r\n}\r\n\r\nstatic void asm_tostr(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;\r\n  as->gcsteps++;\r\n  if (irt_isnum(IR(ir->op1)->t) || (ir+1)->o == IR_HIOP) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromnum];\r\n    args[1] = ASMREF_TMP1;  /* const lua_Number * */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n    asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op1);\r\n  } else {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromint];\r\n    args[1] = ir->op1;  /* int32_t k */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n  }\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    uint32_t k = emit_isk12(ARMI_ADD, ofs + 8*IR(ir->op2)->i);\r\n    if (k) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_dn(as, ARMI_ADD^k, dest, base);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 3), dest, base, idx);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = 0, keyhi = 0, keynumhi = RID_NONE, tmp = RID_TMP;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  int32_t k = 0, khi = emit_isk12(ARMI_CMP, irt_toitype(kt));\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop;\r\n  rset_clear(allow, tab);\r\n  if (!irref_isk(refkey) || irt_isstr(kt)) {\r\n#if LJ_SOFTFP\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n    if (irkey[1].o == IR_HIOP) {\r\n      if (ra_hasreg((irkey+1)->r)) {\r\n\tkeynumhi = (irkey+1)->r;\r\n\tkeyhi = RID_TMP;\r\n\tra_noweak(as, keynumhi);\r\n      } else {\r\n\tkeyhi = keynumhi = ra_allocref(as, refkey+1, allow);\r\n      }\r\n      rset_clear(allow, keynumhi);\r\n      khi = 0;\r\n    }\r\n#else\r\n    if (irt_isnum(kt)) {\r\n      key = ra_scratch(as, allow);\r\n      rset_clear(allow, key);\r\n      keyhi = keynumhi = ra_scratch(as, allow);\r\n      rset_clear(allow, keyhi);\r\n      khi = 0;\r\n    } else {\r\n      key = ra_alloc1(as, refkey, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n#endif\r\n  } else if (irt_isnum(kt)) {\r\n    int32_t val = (int32_t)ir_knum(irkey)->u32.lo;\r\n    k = emit_isk12(ARMI_CMP, val);\r\n    if (!k) {\r\n      key = ra_allock(as, val, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n    val = (int32_t)ir_knum(irkey)->u32.hi;\r\n    khi = emit_isk12(ARMI_CMP, val);\r\n    if (!khi) {\r\n      keyhi = ra_allock(as, val, allow);\r\n      rset_clear(allow, keyhi);\r\n    }\r\n  } else if (!irt_ispri(kt)) {\r\n    k = emit_isk12(ARMI_CMP, irkey->i);\r\n    if (!k) {\r\n      key = ra_alloc1(as, refkey, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n  }\r\n  if (!irt_ispri(kt))\r\n    tmp = ra_scratchpair(as, allow);\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  as->invmcp = NULL;\r\n  if (merge == IR_NE)\r\n    asm_guardcc(as, CC_AL);\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = --as->mcp;\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, dest);\r\n  emit_lso(as, ARMI_LDR, dest, dest, (int32_t)offsetof(Node, next));\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ)\r\n    asm_guardcc(as, CC_EQ);\r\n  else\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  if (!irt_ispri(kt)) {\r\n    emit_nm(as, ARMF_CC(ARMI_CMP, CC_EQ)^k, tmp, key);\r\n    emit_nm(as, ARMI_CMP^khi, tmp+1, keyhi);\r\n    emit_lsox(as, ARMI_LDRD, tmp, dest, (int32_t)offsetof(Node, key));\r\n  } else {\r\n    emit_n(as, ARMI_CMP^khi, tmp);\r\n    emit_lso(as, ARMI_LDR, tmp, dest, (int32_t)offsetof(Node, key.it));\r\n  }\r\n  *l_loop = ARMF_CC(ARMI_B, CC_NE) | ((as->mcp-l_loop-2) & 0x00ffffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 3), dest, dest, tmp);\r\n    emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 1), tmp, tmp, tmp);\r\n    if (irt_isstr(kt)) {  /* Fetch of str->hash is cheaper than ra_allock. */\r\n      emit_dnm(as, ARMI_AND, tmp, tmp+1, RID_TMP);\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_lso(as, ARMI_LDR, tmp+1, key, (int32_t)offsetof(GCstr, hash));\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n    } else if (irref_isk(refkey)) {\r\n      emit_opk(as, ARMI_AND, tmp, RID_TMP, (int32_t)khash,\r\n\t       rset_exclude(rset_exclude(RSET_GPR, tab), dest));\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      if (ra_hasreg(keynumhi)) {  /* Canonicalize +-0.0 to 0.0. */\r\n\tif (keyhi == RID_TMP)\r\n\t  emit_dm(as, ARMF_CC(ARMI_MOV, CC_NE), keyhi, keynumhi);\r\n\temit_d(as, ARMF_CC(ARMI_MOV, CC_EQ)|ARMI_K12|0, keyhi);\r\n      }\r\n      emit_dnm(as, ARMI_AND, tmp, tmp, RID_TMP);\r\n      emit_dnm(as, ARMI_SUB|ARMF_SH(ARMSH_ROR, 32-HASH_ROT3), tmp, tmp, tmp+1);\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_ROR, 32-((HASH_ROT2+HASH_ROT1)&31)),\r\n\t       tmp, tmp+1, tmp);\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n      emit_dnm(as, ARMI_SUB|ARMF_SH(ARMSH_ROR, 32-HASH_ROT1), tmp+1, tmp+1, tmp);\r\n      if (ra_hasreg(keynumhi)) {\r\n\temit_dnm(as, ARMI_EOR, tmp+1, tmp, key);\r\n\temit_dnm(as, ARMI_ORR|ARMI_S, RID_TMP, tmp, key);  /* Test for +-0.0. */\r\n\temit_dnm(as, ARMI_ADD, tmp, keynumhi, keynumhi);\r\n#if !LJ_SOFTFP\r\n\temit_dnm(as, ARMI_VMOV_RR_D, key, keynumhi,\r\n\t\t (ra_alloc1(as, refkey, RSET_FPR) & 15));\r\n#endif\r\n      } else {\r\n\temit_dnm(as, ARMI_EOR, tmp+1, tmp, key);\r\n\temit_opk(as, ARMI_ADD, tmp, key, (int32_t)HASH_BIAS,\r\n\t\t rset_exclude(rset_exclude(RSET_GPR, tab), key));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir) || ofs > 4095) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 4095) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_opk(as, ARMI_ADD, dest, node, ofs, allow);\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n  if (!irt_ispri(irkey->t)) {\r\n    RegSet even = (as->freeset & allow);\r\n    even = even & (even >> 1) & RSET_GPREVEN;\r\n    if (even) {\r\n      key = ra_scratch(as, even);\r\n      if (rset_test(as->freeset, key+1)) {\r\n\ttype = key+1;\r\n\tra_modified(as, type);\r\n      }\r\n    } else {\r\n      key = ra_scratch(as, allow);\r\n    }\r\n    rset_clear(allow, key);\r\n  }\r\n  rset_clear(allow, type);\r\n  if (irt_isnum(irkey->t)) {\r\n    emit_opk(as, ARMF_CC(ARMI_CMP, CC_EQ), 0, type,\r\n\t     (int32_t)ir_knum(irkey)->u32.hi, allow);\r\n    emit_opk(as, ARMI_CMP, 0, key,\r\n\t     (int32_t)ir_knum(irkey)->u32.lo, allow);\r\n  } else {\r\n    if (ra_hasreg(key))\r\n      emit_opk(as, ARMF_CC(ARMI_CMP, CC_EQ), 0, key, irkey->i, allow);\r\n    emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype(irkey->t), type);\r\n  }\r\n  emit_lso(as, ARMI_LDR, type, idx, kofs+4);\r\n  if (ra_hasreg(key)) emit_lso(as, ARMI_LDR, key, idx, kofs);\r\n  if (ofs > 4095)\r\n    emit_opk(as, ARMI_ADD, dest, node, ofs, RSET_GPR);\r\n}\r\n\r\nstatic void asm_newref(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_newkey];\r\n  IRRef args[3];\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ir->op1;      /* GCtab *t     */\r\n  args[2] = ASMREF_TMP1;  /* cTValue *key */\r\n  asm_setupresult(as, ir, ci);  /* TValue * */\r\n  asm_gencall(as, ci, args);\r\n  asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op2);\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, ARMI_LDR, dest, v);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_n(as, ARMI_CMP|ARMI_K12|1, RID_TMP);\r\n      emit_opk(as, ARMI_ADD, dest, uv,\r\n\t       (int32_t)offsetof(GCupval, tv), RSET_GPR);\r\n      emit_lso(as, ARMI_LDRB, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_lso(as, ARMI_LDR, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_lso(as, ARMI_LDR, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    uint32_t k, m = ARMI_K12|sizeof(GCstr);\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       (k = emit_isk12(ARMI_ADD,\r\n\t\t\t       (int32_t)sizeof(GCstr) + IR(irr->op2)->i))) {\r\n      m = k;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_dn(as, ARMI_ADD^m, dest, dest);\r\n    emit_dnm(as, ARMI_ADD, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  emit_opk(as, ARMI_ADD, dest, r,\r\n\t   sizeof(GCstr) + IR(refk)->i, rset_exclude(RSET_GPR, r));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic ARMIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return ARMI_LDRSB;\r\n  case IRT_U8: return ARMI_LDRB;\r\n  case IRT_I16: return ARMI_LDRSH;\r\n  case IRT_U16: return ARMI_LDRH;\r\n  case IRT_NUM: lua_assert(!LJ_SOFTFP); return ARMI_VLDR_D;\r\n  case IRT_FLOAT: if (!LJ_SOFTFP) return ARMI_VLDR_S;\r\n  default: return ARMI_LDR;\r\n  }\r\n}\r\n\r\nstatic ARMIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return ARMI_STRB;\r\n  case IRT_I16: case IRT_U16: return ARMI_STRH;\r\n  case IRT_NUM: lua_assert(!LJ_SOFTFP); return ARMI_VSTR_D;\r\n  case IRT_FLOAT: if (!LJ_SOFTFP) return ARMI_VSTR_S;\r\n  default: return ARMI_STR;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  ARMIns ai = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_dn(as, ARMI_ADD|ARMI_K12|ofs, dest, idx);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  if ((ai & 0x04000000))\r\n    emit_lso(as, ai, dest, idx, ofs);\r\n  else\r\n    emit_lsox(as, ai, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    ARMIns ai = asm_fxstoreins(ir);\r\n    if ((ai & 0x04000000))\r\n      emit_lso(as, ai, src, idx, ofs);\r\n    else\r\n      emit_lsox(as, ai, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir,\r\n\t\t     (!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2,\r\n\t\t\t(!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n  IRType t = hiop ? IRT_NUM : irt_type(ir->t);\r\n  Reg dest = RID_NONE, type = RID_NONE, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = 0;\r\n  if (hiop && ra_used(ir+1)) {\r\n    type = ra_dest(as, ir+1, allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  if (ra_used(ir)) {\r\n    lua_assert((LJ_SOFTFP ? 0 : irt_isnum(ir->t)) ||\r\n\t       irt_isint(ir->t) || irt_isaddr(ir->t));\r\n    dest = ra_dest(as, ir, (!LJ_SOFTFP && t == IRT_NUM) ? RSET_FPR : allow);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow,\r\n\t\t       (!LJ_SOFTFP && t == IRT_NUM) ? 1024 : 4096);\r\n  if (!hiop || type == RID_NONE) {\r\n    rset_clear(allow, idx);\r\n    if (ofs < 256 && ra_hasreg(dest) && (dest & 1) == 0 &&\r\n\trset_test((as->freeset & allow), dest+1)) {\r\n      type = dest+1;\r\n      ra_modified(as, type);\r\n    } else {\r\n      type = RID_TMP;\r\n    }\r\n  }\r\n  asm_guardcc(as, t == IRT_NUM ? CC_HS : CC_NE);\r\n  emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype_(t), type);\r\n  if (ra_hasreg(dest)) {\r\n#if !LJ_SOFTFP\r\n    if (t == IRT_NUM)\r\n      emit_vlso(as, ARMI_VLDR_D, dest, idx, ofs);\r\n    else\r\n#endif\r\n      emit_lso(as, ARMI_LDR, dest, idx, ofs);\r\n  }\r\n  emit_lso(as, ARMI_LDR, type, idx, ofs+4);\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    RegSet allow = RSET_GPR;\r\n    Reg idx, src = RID_NONE, type = RID_NONE;\r\n    int32_t ofs = 0;\r\n#if !LJ_SOFTFP\r\n    if (irt_isnum(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n      idx = asm_fuseahuref(as, ir->op1, &ofs, allow, 1024);\r\n      emit_vlso(as, ARMI_VSTR_D, src, idx, ofs);\r\n    } else\r\n#endif\r\n    {\r\n      int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n      if (!irt_ispri(ir->t)) {\r\n\tsrc = ra_alloc1(as, ir->op2, allow);\r\n\trset_clear(allow, src);\r\n      }\r\n      if (hiop)\r\n\ttype = ra_alloc1(as, (ir+1)->op2, allow);\r\n      else\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      idx = asm_fuseahuref(as, ir->op1, &ofs, rset_exclude(allow, type), 4096);\r\n      if (ra_hasreg(src)) emit_lso(as, ARMI_STR, src, idx, ofs);\r\n      emit_lso(as, ARMI_STR, type, idx, ofs+4);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n  IRType t = hiop ? IRT_NUM : irt_type(ir->t);\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(ir->t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n#if LJ_SOFTFP\r\n  lua_assert(!(ir->op2 & IRSLOAD_CONVERT));  /* Handled by LJ_SOFTFP SPLIT. */\r\n  if (hiop && ra_used(ir+1)) {\r\n    type = ra_dest(as, ir+1, allow);\r\n    rset_clear(allow, type);\r\n  }\r\n#else\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(ir->t) && t == IRT_INT) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else\r\n#endif\r\n  if (ra_used(ir)) {\r\n    Reg tmp = RID_NONE;\r\n    if ((ir->op2 & IRSLOAD_CONVERT))\r\n      tmp = ra_scratch(as, t == IRT_INT ? RSET_FPR : RSET_GPR);\r\n    lua_assert((LJ_SOFTFP ? 0 : irt_isnum(ir->t)) ||\r\n\t       irt_isint(ir->t) || irt_isaddr(ir->t));\r\n    dest = ra_dest(as, ir, (!LJ_SOFTFP && t == IRT_NUM) ? RSET_FPR : allow);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (t == IRT_INT) {\r\n\temit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n\temit_dm(as, ARMI_VCVT_S32_F64, (tmp & 15), (tmp & 15));\r\n\tt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\temit_dm(as, ARMI_VCVT_F64_S32, (dest & 15), (dest & 15));\r\n\temit_dn(as, ARMI_VMOV_S_R, tmp, (dest & 15));\r\n\tt = IRT_INT;  /* Check for original type. */\r\n      }\r\n      dest = tmp;\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\ndotypecheck:\r\n  rset_clear(allow, base);\r\n  if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n    if (ra_noreg(type)) {\r\n      if (ofs < 256 && ra_hasreg(dest) && (dest & 1) == 0 &&\r\n\t  rset_test((as->freeset & allow), dest+1)) {\r\n\ttype = dest+1;\r\n\tra_modified(as, type);\r\n      } else {\r\n\ttype = RID_TMP;\r\n      }\r\n    }\r\n    asm_guardcc(as, t == IRT_NUM ? CC_HS : CC_NE);\r\n    emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype_(t), type);\r\n  }\r\n  if (ra_hasreg(dest)) {\r\n#if !LJ_SOFTFP\r\n    if (t == IRT_NUM) {\r\n      if (ofs < 1024) {\r\n\temit_vlso(as, ARMI_VLDR_D, dest, base, ofs);\r\n      } else {\r\n\tif (ra_hasreg(type)) emit_lso(as, ARMI_LDR, type, base, ofs+4);\r\n\temit_vlso(as, ARMI_VLDR_D, dest, RID_TMP, 0);\r\n\temit_opk(as, ARMI_ADD, RID_TMP, base, ofs, allow);\r\n\treturn;\r\n      }\r\n    } else\r\n#endif\r\n      emit_lso(as, ARMI_LDR, dest, base, ofs);\r\n  }\r\n  if (ra_hasreg(type)) emit_lso(as, ARMI_LDR, type, base, ofs+4);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID ctypeid = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz = (ir->o == IR_CNEWI || ir->op2 == REF_NIL) ?\r\n\t      lj_ctype_size(cts, ctypeid) : (CTSize)IR(ir->op2)->i;\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[2];\r\n  RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID);\r\n\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  as->gcsteps++;\r\n\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4; ir++;\r\n      lua_assert(ir->o == IR_HIOP);\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_lso(as, ARMI_STR, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir--;\r\n    }\r\n  }\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  {\r\n    uint32_t k = emit_isk12(ARMI_MOV, ctypeid);\r\n    Reg r = k ? RID_R1 : ra_allock(as, ctypeid, allow);\r\n    emit_lso(as, ARMI_STRB, RID_TMP, RID_RET, offsetof(GCcdata, gct));\r\n    emit_lsox(as, ARMI_STRH, r, RID_RET, offsetof(GCcdata, ctypeid));\r\n    emit_d(as, ARMI_MOV|ARMI_K12|~LJ_TCDATA, RID_TMP);\r\n    if (k) emit_d(as, ARMI_MOV^k, RID_R1);\r\n  }\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg link = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg gr = ra_allock(as, i32ptr(J2G(as->J)),\r\n\t\t     rset_exclude(rset_exclude(RSET_GPR, tab), link));\r\n  Reg mark = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_lso(as, ARMI_STR, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_lso(as, ARMI_STRB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_lso(as, ARMI_STR, tab, gr,\r\n\t   (int32_t)offsetof(global_State, gc.grayagain));\r\n  emit_dn(as, ARMI_BIC|ARMI_K12|LJ_GC_BLACK, mark, mark);\r\n  emit_lso(as, ARMI_LDR, link, gr,\r\n\t   (int32_t)offsetof(global_State, gc.grayagain));\r\n  emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  emit_n(as, ARMI_TST|ARMI_K12|LJ_GC_BLACK, mark);\r\n  emit_lso(as, ARMI_LDRB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  if ((l_end[-1] >> 28) == CC_AL)\r\n    l_end[-1] = ARMF_CC(l_end[-1], CC_NE);\r\n  else\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  ra_allockreg(as, i32ptr(J2G(as->J)), ra_releasetmp(as, ASMREF_TMP1));\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_n(as, ARMF_CC(ARMI_TST, CC_NE)|ARMI_K12|LJ_GC_BLACK, tmp);\r\n  emit_n(as, ARMI_TST|ARMI_K12|LJ_GC_WHITES, RID_TMP);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_lso(as, ARMI_LDRB, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_lso(as, ARMI_LDRB, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dnm(as, ai, (dest & 15), (left & 15), (right & 15));\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_dm(as, ai, (dest & 15), (left & 15));\r\n}\r\n\r\nstatic int asm_fpjoin_pow(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irp = IR(ir->op1);\r\n  if (irp == ir-1 && irp->o == IR_MUL && !ra_used(irp)) {\r\n    IRIns *irpp = IR(irp->op1);\r\n    if (irpp == ir-2 && irpp->o == IR_FPMATH &&\r\n\tirpp->op2 == IRFPM_LOG2 && !ra_used(irpp)) {\r\n      const CCallInfo *ci = &lj_ir_callinfo[IRCALL_pow];\r\n      IRRef args[2];\r\n      args[0] = irpp->op1;\r\n      args[1] = irp->op2;\r\n      asm_setupresult(as, ir, ci);\r\n      asm_gencall(as, ci, args);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n#endif\r\n\r\nstatic int asm_swapops(ASMState *as, IRRef lref, IRRef rref)\r\n{\r\n  IRIns *ir;\r\n  if (irref_isk(rref))\r\n    return 0;  /* Don't swap constants to the left. */\r\n  if (irref_isk(lref))\r\n    return 1;  /* But swap constants to the right. */\r\n  ir = IR(rref);\r\n  if ((ir->o >= IR_BSHL && ir->o <= IR_BROR) ||\r\n      (ir->o == IR_ADD && ir->op1 == ir->op2))\r\n    return 0;  /* Don't swap fusable operands to the left. */\r\n  ir = IR(lref);\r\n  if ((ir->o >= IR_BSHL && ir->o <= IR_BROR) ||\r\n      (ir->o == IR_ADD && ir->op1 == ir->op2))\r\n    return 1;  /* But swap fusable operands to the right. */\r\n  return 0;  /* Otherwise don't swap. */\r\n}\r\n\r\nstatic void asm_intop(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  Reg left, dest = ra_dest(as, ir, RSET_GPR);\r\n  uint32_t m;\r\n  if (asm_swapops(as, lref, rref)) {\r\n    IRRef tmp = lref; lref = rref; rref = tmp;\r\n    if ((ai & ~ARMI_S) == ARMI_SUB || (ai & ~ARMI_S) == ARMI_SBC)\r\n      ai ^= (ARMI_SUB^ARMI_RSB);\r\n  }\r\n  left = ra_hintalloc(as, lref, dest, RSET_GPR);\r\n  m = asm_fuseopm(as, ai, rref, rset_exclude(RSET_GPR, left));\r\n  if (irt_isguard(ir->t)) {  /* For IR_ADDOV etc. */\r\n    asm_guardcc(as, CC_VS);\r\n    ai |= ARMI_S;\r\n  }\r\n  emit_dn(as, ai^m, dest, left);\r\n}\r\n\r\nstatic void asm_intop_s(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  if (as->flagmcp == as->mcp) {  /* Drop cmp r, #0. */\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    ai |= ARMI_S;\r\n  }\r\n  asm_intop(as, ir, ai);\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  if (as->flagmcp == as->mcp) {  /* Try to drop cmp r, #0. */\r\n    uint32_t cc = (as->mcp[1] >> 28);\r\n    as->flagmcp = NULL;\r\n    if (cc <= CC_NE) {\r\n      as->mcp++;\r\n      ai |= ARMI_S;\r\n    } else if (cc == CC_GE) {\r\n      *++as->mcp ^= ((CC_GE^CC_PL) << 28);\r\n      ai |= ARMI_S;\r\n    } else if (cc == CC_LT) {\r\n      *++as->mcp ^= ((CC_LT^CC_MI) << 28);\r\n      ai |= ARMI_S;\r\n    }  /* else: other conds don't work with bit ops. */\r\n  }\r\n  if (ir->op2 == 0) {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    uint32_t m = asm_fuseopm(as, ai, ir->op1, RSET_GPR);\r\n    emit_d(as, ai^m, dest);\r\n  } else {\r\n    /* NYI: Turn BAND !k12 into uxtb, uxth or bfc or shl+shr. */\r\n    asm_intop(as, ir, ai);\r\n  }\r\n}\r\n\r\nstatic void asm_intneg(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  emit_dn(as, ai|ARMI_K12|0, dest, left);\r\n}\r\n\r\n/* NYI: use add/shift for MUL(OV) with constants. FOLD only does 2^k. */\r\nstatic void asm_intmul(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, dest));\r\n  Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  Reg tmp = RID_NONE;\r\n  /* ARMv5 restriction: dest != left and dest_hi != left. */\r\n  if (dest == left && left != right) { left = right; right = dest; }\r\n  if (irt_isguard(ir->t)) {  /* IR_MULOV */\r\n    if (!(as->flags & JIT_F_ARMV6) && dest == left)\r\n      tmp = left = ra_scratch(as, rset_exclude(RSET_GPR, left));\r\n    asm_guardcc(as, CC_NE);\r\n    emit_nm(as, ARMI_TEQ|ARMF_SH(ARMSH_ASR, 31), RID_TMP, dest);\r\n    emit_dnm(as, ARMI_SMULL|ARMF_S(right), dest, RID_TMP, left);\r\n  } else {\r\n    if (!(as->flags & JIT_F_ARMV6) && dest == left) tmp = left = RID_TMP;\r\n    emit_nm(as, ARMI_MUL|ARMF_S(right), dest, left);\r\n  }\r\n  /* Only need this for the dest == left == right case. */\r\n  if (ra_hasreg(tmp)) emit_dm(as, ARMI_MOV, tmp, right);\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, ARMI_VMLA_D, ARMI_VMLA_D))\r\n      asm_fparith(as, ir, ARMI_VADD_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intop_s(as, ir, ARMI_ADD);\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, ARMI_VNMLS_D, ARMI_VMLS_D))\r\n      asm_fparith(as, ir, ARMI_VSUB_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intop_s(as, ir, ARMI_SUB);\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, ARMI_VMUL_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intmul(as, ir);\r\n}\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, ARMI_VNEG_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intneg(as, ir, ARMI_RSB);\r\n}\r\n\r\nstatic void asm_callid(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_callround(ASMState *as, IRIns *ir, int id)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RID2RSET(RID_R0)|RID2RSET(RID_R1)|RID2RSET(RID_R2)|\r\n\t\tRID2RSET(RID_R3)|RID2RSET(RID_R12);\r\n  RegSet of;\r\n  Reg dest, src;\r\n  ra_evictset(as, drop);\r\n  dest = ra_dest(as, ir, RSET_FPR);\r\n  emit_dnm(as, ARMI_VMOV_D_RR, RID_RETLO, RID_RETHI, (dest & 15));\r\n  emit_call(as, id == IRFPM_FLOOR ? (void *)lj_vm_floor_sf :\r\n\t\tid == IRFPM_CEIL ? (void *)lj_vm_ceil_sf :\r\n\t\t\t\t   (void *)lj_vm_trunc_sf);\r\n  /* Workaround to protect argument GPRs from being used for remat. */\r\n  of = as->freeset;\r\n  as->freeset &= ~RSET_RANGE(RID_R0, RID_R1+1);\r\n  as->cost[RID_R0] = as->cost[RID_R1] = REGCOST(~0u, ASMREF_L);\r\n  src = ra_alloc1(as, ir->op1, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n  as->freeset |= (of & RSET_RANGE(RID_R0, RID_R1+1));\r\n  emit_dnm(as, ARMI_VMOV_RR_D, RID_R0, RID_R1, (src & 15));\r\n}\r\n#endif\r\n\r\nstatic void asm_bitswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if ((as->flags & JIT_F_ARMV6)) {\r\n    emit_dm(as, ARMI_REV, dest, left);\r\n  } else {\r\n    Reg tmp2 = dest;\r\n    if (tmp2 == left)\r\n      tmp2 = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, dest), left));\r\n    emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_LSR, 8), dest, tmp2, RID_TMP);\r\n    emit_dm(as, ARMI_MOV|ARMF_SH(ARMSH_ROR, 8), tmp2, left);\r\n    emit_dn(as, ARMI_BIC|ARMI_K12|256*8|255, RID_TMP, RID_TMP);\r\n    emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_ROR, 16), RID_TMP, left, left);\r\n  }\r\n}\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, ARMShift sh)\r\n{\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    /* NYI: Turn SHL+SHR or BAND+SHR into uxtb, uxth or ubfx. */\r\n    /* NYI: Turn SHL+ASR into sxtb, sxth or sbfx. */\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    int32_t shift = (IR(ir->op2)->i & 31);\r\n    emit_dm(as, ARMI_MOV|ARMF_SH(sh, shift), dest, left);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_dm(as, ARMI_MOV|ARMF_RSH(sh, right), dest, left);\r\n  }\r\n}\r\n\r\nstatic void asm_intmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  uint32_t kcmp = 0, kmov = 0;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  Reg right = 0;\r\n  if (irref_isk(ir->op2)) {\r\n    kcmp = emit_isk12(ARMI_CMP, IR(ir->op2)->i);\r\n    if (kcmp) kmov = emit_isk12(ARMI_MOV, IR(ir->op2)->i);\r\n  }\r\n  if (!kmov) {\r\n    kcmp = 0;\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  }\r\n  if (kmov || dest != right) {\r\n    emit_dm(as, ARMF_CC(ARMI_MOV, cc)^kmov, dest, right);\r\n    cc ^= 1;  /* Must use opposite conditions for paired moves. */\r\n  } else {\r\n    cc ^= (CC_LT^CC_GT);  /* Otherwise may swap CC_LT <-> CC_GT. */\r\n  }\r\n  if (dest != left) emit_dm(as, ARMF_CC(ARMI_MOV, cc), dest, left);\r\n  emit_nm(as, ARMI_CMP^kcmp, left, right);\r\n}\r\n\r\n#if LJ_SOFTFP\r\nstatic void asm_sfpmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_softfp_cmp];\r\n  RegSet drop = RSET_SCRATCH;\r\n  Reg r;\r\n  IRRef args[4];\r\n  args[0] = ir->op1; args[1] = (ir+1)->op1;\r\n  args[2] = ir->op2; args[3] = (ir+1)->op2;\r\n  /* __aeabi_cdcmple preserves r0-r3. */\r\n  if (ra_hasreg(ir->r)) rset_clear(drop, ir->r);\r\n  if (ra_hasreg((ir+1)->r)) rset_clear(drop, (ir+1)->r);\r\n  if (!rset_test(as->freeset, RID_R2) &&\r\n      regcost_ref(as->cost[RID_R2]) == args[2]) rset_clear(drop, RID_R2);\r\n  if (!rset_test(as->freeset, RID_R3) &&\r\n      regcost_ref(as->cost[RID_R3]) == args[3]) rset_clear(drop, RID_R3);\r\n  ra_evictset(as, drop);\r\n  ra_destpair(as, ir);\r\n  emit_dm(as, ARMF_CC(ARMI_MOV, cc), RID_RETHI, RID_R3);\r\n  emit_dm(as, ARMF_CC(ARMI_MOV, cc), RID_RETLO, RID_R2);\r\n  emit_call(as, (void *)ci->func);\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    ra_leftov(as, r, args[r-RID_R0]);\r\n}\r\n#else\r\nstatic void asm_fpmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  Reg dest = (ra_dest(as, ir, RSET_FPR) & 15);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = ((left >> 8) & 15); left &= 15;\r\n  if (dest != left) emit_dm(as, ARMF_CC(ARMI_VMOV_D, cc^1), dest, left);\r\n  if (dest != right) emit_dm(as, ARMF_CC(ARMI_VMOV_D, cc), dest, right);\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ARMI_VCMP_D, left, right);\r\n}\r\n#endif\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int cc, int fcc)\r\n{\r\n#if LJ_SOFTFP\r\n  UNUSED(fcc);\r\n#else\r\n  if (irt_isnum(ir->t))\r\n    asm_fpmin_max(as, ir, fcc);\r\n  else\r\n#endif\r\n    asm_intmin_max(as, ir, cc);\r\n}\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\nstatic const uint8_t asm_compmap[IR_ABC+1] = {\r\n  /* op  FP swp  int cc   FP cc */\r\n  /* LT       */ CC_GE + (CC_HS << 4),\r\n  /* GE    x  */ CC_LT + (CC_HI << 4),\r\n  /* LE       */ CC_GT + (CC_HI << 4),\r\n  /* GT    x  */ CC_LE + (CC_HS << 4),\r\n  /* ULT   x  */ CC_HS + (CC_LS << 4),\r\n  /* UGE      */ CC_LO + (CC_LO << 4),\r\n  /* ULE   x  */ CC_HI + (CC_LO << 4),\r\n  /* UGT      */ CC_LS + (CC_LS << 4),\r\n  /* EQ       */ CC_NE + (CC_NE << 4),\r\n  /* NE       */ CC_EQ + (CC_EQ << 4),\r\n  /* ABC      */ CC_LS + (CC_LS << 4)  /* Same as UGT. */\r\n};\r\n\r\n#if LJ_SOFTFP\r\n/* FP comparisons. */\r\nstatic void asm_sfpcomp(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_softfp_cmp];\r\n  RegSet drop = RSET_SCRATCH;\r\n  Reg r;\r\n  IRRef args[4];\r\n  int swp = (((ir->o ^ (ir->o >> 2)) & ~(ir->o >> 3) & 1) << 1);\r\n  args[swp^0] = ir->op1; args[swp^1] = (ir+1)->op1;\r\n  args[swp^2] = ir->op2; args[swp^3] = (ir+1)->op2;\r\n  /* __aeabi_cdcmple preserves r0-r3. This helps to reduce spills. */\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    if (!rset_test(as->freeset, r) &&\r\n\tregcost_ref(as->cost[r]) == args[r-RID_R0]) rset_clear(drop, r);\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, (asm_compmap[ir->o] >> 4));\r\n  emit_call(as, (void *)ci->func);\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    ra_leftov(as, r, args[r-RID_R0]);\r\n}\r\n#else\r\n/* FP comparisons. */\r\nstatic void asm_fpcomp(ASMState *as, IRIns *ir)\r\n{\r\n  Reg left, right;\r\n  ARMIns ai;\r\n  int swp = ((ir->o ^ (ir->o >> 2)) & ~(ir->o >> 3) & 1);\r\n  if (!swp && irref_isk(ir->op2) && ir_knum(IR(ir->op2))->u64 == 0) {\r\n    left = (ra_alloc1(as, ir->op1, RSET_FPR) & 15);\r\n    right = 0;\r\n    ai = ARMI_VCMPZ_D;\r\n  } else {\r\n    left = ra_alloc2(as, ir, RSET_FPR);\r\n    if (swp) {\r\n      right = (left & 15); left = ((left >> 8) & 15);\r\n    } else {\r\n      right = ((left >> 8) & 15); left &= 15;\r\n    }\r\n    ai = ARMI_VCMP_D;\r\n  }\r\n  asm_guardcc(as, (asm_compmap[ir->o] >> 4));\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ai, left, right);\r\n}\r\n#endif\r\n\r\n/* Integer comparisons. */\r\nstatic void asm_intcomp(ASMState *as, IRIns *ir)\r\n{\r\n  ARMCC cc = (asm_compmap[ir->o] & 15);\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  Reg left;\r\n  uint32_t m;\r\n  int cmpprev0 = 0;\r\n  lua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n  if (asm_swapops(as, lref, rref)) {\r\n    Reg tmp = lref; lref = rref; rref = tmp;\r\n    if (cc >= CC_GE) cc ^= 7;  /* LT <-> GT, LE <-> GE */\r\n    else if (cc > CC_NE) cc ^= 11;  /* LO <-> HI, LS <-> HS */\r\n  }\r\n  if (irref_isk(rref) && IR(rref)->i == 0) {\r\n    IRIns *irl = IR(lref);\r\n    cmpprev0 = (irl+1 == ir);\r\n    /* Combine comp(BAND(left, right), 0) into tst left, right. */\r\n    if (cmpprev0 && irl->o == IR_BAND && !ra_used(irl)) {\r\n      IRRef blref = irl->op1, brref = irl->op2;\r\n      uint32_t m2 = 0;\r\n      Reg bleft;\r\n      if (asm_swapops(as, blref, brref)) {\r\n\tReg tmp = blref; blref = brref; brref = tmp;\r\n      }\r\n      if (irref_isk(brref)) {\r\n\tm2 = emit_isk12(ARMI_AND, IR(brref)->i);\r\n\tif ((m2 & (ARMI_AND^ARMI_BIC)))\r\n\t  goto notst;  /* Not beneficial if we miss a constant operand. */\r\n      }\r\n      if (cc == CC_GE) cc = CC_PL;\r\n      else if (cc == CC_LT) cc = CC_MI;\r\n      else if (cc > CC_NE) goto notst;  /* Other conds don't work with tst. */\r\n      bleft = ra_alloc1(as, blref, RSET_GPR);\r\n      if (!m2) m2 = asm_fuseopm(as, 0, brref, rset_exclude(RSET_GPR, bleft));\r\n      asm_guardcc(as, cc);\r\n      emit_n(as, ARMI_TST^m2, bleft);\r\n      return;\r\n    }\r\n  }\r\nnotst:\r\n  left = ra_alloc1(as, lref, RSET_GPR);\r\n  m = asm_fuseopm(as, ARMI_CMP, rref, rset_exclude(RSET_GPR, left));\r\n  asm_guardcc(as, cc);\r\n  emit_n(as, ARMI_CMP^m, left);\r\n  /* Signed comparison with zero and referencing previous ins? */\r\n  if (cmpprev0 && (cc <= CC_NE || cc >= CC_GE))\r\n    as->flagmcp = as->mcp;  /* Allow elimination of the compare. */\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_int64comp(ASMState *as, IRIns *ir)\r\n{\r\n  int signedcomp = (ir->o <= IR_GT);\r\n  ARMCC cclo, cchi;\r\n  Reg leftlo, lefthi;\r\n  uint32_t mlo, mhi;\r\n  RegSet allow = RSET_GPR, oldfree;\r\n\r\n  /* Always use unsigned comparison for loword. */\r\n  cclo = asm_compmap[ir->o + (signedcomp ? 4 : 0)] & 15;\r\n  leftlo = ra_alloc1(as, ir->op1, allow);\r\n  oldfree = as->freeset;\r\n  mlo = asm_fuseopm(as, ARMI_CMP, ir->op2, rset_clear(allow, leftlo));\r\n  allow &= ~(oldfree & ~as->freeset);  /* Update for allocs of asm_fuseopm. */\r\n\r\n  /* Use signed or unsigned comparison for hiword. */\r\n  cchi = asm_compmap[ir->o] & 15;\r\n  lefthi = ra_alloc1(as, (ir+1)->op1, allow);\r\n  mhi = asm_fuseopm(as, ARMI_CMP, (ir+1)->op2, rset_clear(allow, lefthi));\r\n\r\n  /* All register allocations must be performed _before_ this point. */\r\n  if (signedcomp) {\r\n    MCLabel l_around = emit_label(as);\r\n    asm_guardcc(as, cclo);\r\n    emit_n(as, ARMI_CMP^mlo, leftlo);\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_NE), l_around);\r\n    if (cchi == CC_GE || cchi == CC_LE) cchi ^= 6;  /* GE -> GT, LE -> LT */\r\n    asm_guardcc(as, cchi);\r\n  } else {\r\n    asm_guardcc(as, cclo);\r\n    emit_n(as, ARMF_CC(ARMI_CMP, CC_EQ)^mlo, leftlo);\r\n  }\r\n  emit_n(as, ARMI_CMP^mhi, lefthi);\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI || LJ_SOFTFP\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o <= IR_NE) {  /* 64 bit integer or FP comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n#if LJ_SOFTFP\r\n    if (!irt_isint(ir->t)) {\r\n      asm_sfpcomp(as, ir-1);\r\n      return;\r\n    }\r\n#endif\r\n#if LJ_HASFFI\r\n    asm_int64comp(as, ir-1);\r\n#endif\r\n    return;\r\n#if LJ_SOFTFP\r\n  } else if ((ir-1)->o == IR_MIN || (ir-1)->o == IR_MAX) {\r\n    as->curins--;  /* Always skip the loword min/max. */\r\n    if (uselo || usehi)\r\n      asm_sfpmin_max(as, ir-1, (ir-1)->o == IR_MIN ? CC_HI : CC_LO);\r\n    return;\r\n#elif LJ_HASFFI\r\n  } else if ((ir-1)->o == IR_CONV) {\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n#endif\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    if ((ir-1)->r != RID_SINK)\r\n      asm_xstore(as, ir, 4);\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n#if LJ_HASFFI\r\n  case IR_ADD:\r\n    as->curins--;\r\n    asm_intop(as, ir, ARMI_ADC);\r\n    asm_intop(as, ir-1, ARMI_ADD|ARMI_S);\r\n    break;\r\n  case IR_SUB:\r\n    as->curins--;\r\n    asm_intop(as, ir, ARMI_SBC);\r\n    asm_intop(as, ir-1, ARMI_SUB|ARMI_S);\r\n    break;\r\n  case IR_NEG:\r\n    as->curins--;\r\n    asm_intneg(as, ir, ARMI_RSC);\r\n    asm_intneg(as, ir-1, ARMI_RSB|ARMI_S);\r\n    break;\r\n#endif\r\n#if LJ_SOFTFP\r\n  case IR_SLOAD: case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n  case IR_STRTO:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RSET_GPR);  /* Mark lo op as used. */\r\n    break;\r\n#endif\r\n  case IR_CALLN:\r\n  case IR_CALLS:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n#if LJ_SOFTFP\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: case IR_TOSTR:\r\n#endif\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);\r\n#endif\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  Reg pbase;\r\n  uint32_t k;\r\n  if (irp) {\r\n    if (!ra_hasspill(irp->s)) {\r\n      pbase = irp->r;\r\n      lua_assert(ra_hasreg(pbase));\r\n    } else if (allow) {\r\n      pbase = rset_pickbot(allow);\r\n    } else {\r\n      pbase = RID_RET;\r\n      emit_lso(as, ARMI_LDR, RID_RET, RID_SP, 0);  /* Restore temp. register. */\r\n    }\r\n  } else {\r\n    pbase = RID_BASE;\r\n  }\r\n  emit_branch(as, ARMF_CC(ARMI_BL, CC_LS), exitstub_addr(as->J, exitno));\r\n  k = emit_isk12(0, (int32_t)(8*topslot));\r\n  lua_assert(k);\r\n  emit_n(as, ARMI_CMP^k, RID_TMP);\r\n  emit_dnm(as, ARMI_SUB, RID_TMP, RID_TMP, pbase);\r\n  emit_lso(as, ARMI_LDR, RID_TMP, RID_TMP,\r\n\t   (int32_t)offsetof(lua_State, maxstack));\r\n  if (irp) {  /* Must not spill arbitrary registers in head of side trace. */\r\n    int32_t i = i32ptr(&J2G(as->J)->jit_L);\r\n    if (ra_hasspill(irp->s))\r\n      emit_lso(as, ARMI_LDR, pbase, RID_SP, sps_scale(irp->s));\r\n    emit_lso(as, ARMI_LDR, RID_TMP, RID_TMP, (i & 4095));\r\n    if (ra_hasspill(irp->s) && !allow)\r\n      emit_lso(as, ARMI_STR, RID_RET, RID_SP, 0);  /* Save temp. register. */\r\n    emit_loadi(as, RID_TMP, (i & ~4095));\r\n  } else {\r\n    emit_getgl(as, RID_TMP, jit_L);\r\n  }\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n#if LJ_SOFTFP\r\n      RegSet odd = rset_exclude(RSET_GPRODD, RID_BASE);\r\n      Reg tmp;\r\n      lua_assert(irref_isk(ref));  /* LJ_SOFTFP: must be a number constant. */\r\n      tmp = ra_allock(as, (int32_t)ir_knum(ir)->u32.lo,\r\n\t\t      rset_exclude(RSET_GPREVEN, RID_BASE));\r\n      emit_lso(as, ARMI_STR, tmp, RID_BASE, ofs);\r\n      if (rset_test(as->freeset, tmp+1)) odd = RID2RSET(tmp+1);\r\n      tmp = ra_allock(as, (int32_t)ir_knum(ir)->u32.hi, odd);\r\n      emit_lso(as, ARMI_STR, tmp, RID_BASE, ofs+4);\r\n#else\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_vlso(as, ARMI_VSTR_D, src, RID_BASE, ofs);\r\n#endif\r\n    } else {\r\n      RegSet odd = rset_exclude(RSET_GPRODD, RID_BASE);\r\n      Reg type;\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, rset_exclude(RSET_GPREVEN, RID_BASE));\r\n\temit_lso(as, ARMI_STR, src, RID_BASE, ofs);\r\n\tif (rset_test(as->freeset, src+1)) odd = RID2RSET(src+1);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), odd);\r\n#if LJ_SOFTFP\r\n      } else if ((sn & SNAP_SOFTFPNUM)) {\r\n\ttype = ra_alloc1(as, ref+1, rset_exclude(RSET_GPRODD, RID_BASE));\r\n#endif\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), odd);\r\n      }\r\n      emit_lso(as, ARMI_STR, type, RID_BASE, ofs+4);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp1, tmp2;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, RID_RET);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  tmp1 = ra_releasetmp(as, ASMREF_TMP1);\r\n  tmp2 = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp2, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_branch(as, ARMF_CC(ARMI_B, CC_LS), l_end);\r\n  emit_nm(as, ARMI_CMP, RID_TMP, tmp2);\r\n  emit_lso(as, ARMI_LDR, tmp2, tmp1,\r\n\t   (int32_t)offsetof(global_State, gc.threshold));\r\n  emit_lso(as, ARMI_LDR, RID_TMP, tmp1,\r\n\t   (int32_t)offsetof(global_State, gc.total));\r\n  ra_allockreg(as, i32ptr(J2G(as->J)), tmp1);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guardcc already inverted the bcc and patched the final bl. */\r\n    p[-2] |= ((uint32_t)(target-p) & 0x00ffffffu);\r\n  } else {\r\n    p[-1] = ARMI_B | ((uint32_t)((target-p)-1) & 0x00ffffffu);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Reload L register from g->jit_L. */\r\nstatic void asm_head_lreg(ASMState *as)\r\n{\r\n  IRIns *ir = IR(ASMREF_L);\r\n  if (ra_used(ir)) {\r\n    Reg r = ra_dest(as, ir, RSET_GPR);\r\n    emit_getgl(as, r, jit_L);\r\n    ra_evictk(as);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir;\r\n  asm_head_lreg(as);\r\n  ir = IR(REF_BASE);\r\n  if (ra_hasreg(ir->r) && (rset_test(as->modset, ir->r) || irt_ismarked(ir->t)))\r\n    ra_spill(as, ir);\r\n  ra_destreg(as, ir, RID_BASE);\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir;\r\n  asm_head_lreg(as);\r\n  ir = IR(REF_BASE);\r\n  if (ra_hasreg(ir->r) && (rset_test(as->modset, ir->r) || irt_ismarked(ir->t)))\r\n    ra_spill(as, ir);\r\n  if (ra_hasspill(irp->s)) {\r\n    rset_clear(allow, ra_dest(as, ir, allow));\r\n  } else {\r\n    Reg r = irp->r;\r\n    lua_assert(ra_hasreg(r));\r\n    rset_clear(allow, r);\r\n    if (r != ir->r && !rset_test(as->freeset, r))\r\n      ra_restore(as, regcost_ref(as->cost[r]));\r\n    ra_destreg(as, ir, r);\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    as->mctop = --p;\r\n  } else {\r\n    /* Patch stack adjustment. */\r\n    uint32_t k = emit_isk12(ARMI_ADD, spadj);\r\n    lua_assert(k);\r\n    p[-2] = (ARMI_ADD^k) | ARMF_D(RID_SP) | ARMF_N(RID_SP);\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  p[-1] = ARMI_B|(((target-p)-1)&0x00ffffffu);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop - 1;  /* Leave room for exit branch. */\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    as->mcp = p-1;  /* Leave room for stack pointer adjustment. */\r\n    as->invmcp = NULL;\r\n  }\r\n  *p = 0;  /* Prevent load/store merging. */\r\n}\r\n\r\n/* -- Instruction dispatch ------------------------------------------------ */\r\n\r\n/* Assemble a single instruction. */\r\nstatic void asm_ir(ASMState *as, IRIns *ir)\r\n{\r\n  switch ((IROp)ir->o) {\r\n  /* Miscellaneous ops. */\r\n  case IR_LOOP: asm_loop(as); break;\r\n  case IR_NOP: case IR_XBAR: lua_assert(!ra_used(ir)); break;\r\n  case IR_USE:\r\n    ra_alloc1(as, ir->op1, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR); break;\r\n  case IR_PHI: asm_phi(as, ir); break;\r\n  case IR_HIOP: asm_hiop(as, ir); break;\r\n  case IR_GCSTEP: asm_gcstep(as, ir); break;\r\n\r\n  /* Guarded assertions. */\r\n  case IR_EQ: case IR_NE:\r\n    if ((ir-1)->o == IR_HREF && ir->op1 == as->curins-1) {\r\n      as->curins--;\r\n      asm_href(as, ir-1, (IROp)ir->o);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case IR_LT: case IR_GE: case IR_LE: case IR_GT:\r\n  case IR_ULT: case IR_UGE: case IR_ULE: case IR_UGT:\r\n  case IR_ABC:\r\n#if !LJ_SOFTFP\r\n    if (irt_isnum(ir->t)) { asm_fpcomp(as, ir); break; }\r\n#endif\r\n    asm_intcomp(as, ir);\r\n    break;\r\n\r\n  case IR_RETF: asm_retf(as, ir); break;\r\n\r\n  /* Bit ops. */\r\n  case IR_BNOT: asm_bitop(as, ir, ARMI_MVN); break;\r\n  case IR_BSWAP: asm_bitswap(as, ir); break;\r\n\r\n  case IR_BAND: asm_bitop(as, ir, ARMI_AND); break;\r\n  case IR_BOR:  asm_bitop(as, ir, ARMI_ORR); break;\r\n  case IR_BXOR: asm_bitop(as, ir, ARMI_EOR); break;\r\n\r\n  case IR_BSHL: asm_bitshift(as, ir, ARMSH_LSL); break;\r\n  case IR_BSHR: asm_bitshift(as, ir, ARMSH_LSR); break;\r\n  case IR_BSAR: asm_bitshift(as, ir, ARMSH_ASR); break;\r\n  case IR_BROR: asm_bitshift(as, ir, ARMSH_ROR); break;\r\n  case IR_BROL: lua_assert(0); break;\r\n\r\n  /* Arithmetic ops. */\r\n  case IR_ADD: case IR_ADDOV: asm_add(as, ir); break;\r\n  case IR_SUB: case IR_SUBOV: asm_sub(as, ir); break;\r\n  case IR_MUL: case IR_MULOV: asm_mul(as, ir); break;\r\n  case IR_MOD: asm_callid(as, ir, IRCALL_lj_vm_modi); break;\r\n  case IR_NEG: asm_neg(as, ir); break;\r\n\r\n#if LJ_SOFTFP\r\n  case IR_DIV: case IR_POW: case IR_ABS:\r\n  case IR_ATAN2: case IR_LDEXP: case IR_FPMATH: case IR_TOBIT:\r\n    lua_assert(0);  /* Unused for LJ_SOFTFP. */\r\n    break;\r\n#else\r\n  case IR_DIV: asm_fparith(as, ir, ARMI_VDIV_D); break;\r\n  case IR_POW: asm_callid(as, ir, IRCALL_lj_vm_powi); break;\r\n  case IR_ABS: asm_fpunary(as, ir, ARMI_VABS_D); break;\r\n  case IR_ATAN2: asm_callid(as, ir, IRCALL_atan2); break;\r\n  case IR_LDEXP: asm_callid(as, ir, IRCALL_ldexp); break;\r\n  case IR_FPMATH:\r\n    if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n      break;\r\n    if (ir->op2 <= IRFPM_TRUNC)\r\n      asm_callround(as, ir, ir->op2);\r\n    else if (ir->op2 == IRFPM_SQRT)\r\n      asm_fpunary(as, ir, ARMI_VSQRT_D);\r\n    else\r\n      asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n    break;\r\n  case IR_TOBIT: asm_tobit(as, ir); break;\r\n#endif\r\n\r\n  case IR_MIN: asm_min_max(as, ir, CC_GT, CC_HI); break;\r\n  case IR_MAX: asm_min_max(as, ir, CC_LT, CC_LO); break;\r\n\r\n  /* Memory references. */\r\n  case IR_AREF: asm_aref(as, ir); break;\r\n  case IR_HREF: asm_href(as, ir, 0); break;\r\n  case IR_HREFK: asm_hrefk(as, ir); break;\r\n  case IR_NEWREF: asm_newref(as, ir); break;\r\n  case IR_UREFO: case IR_UREFC: asm_uref(as, ir); break;\r\n  case IR_FREF: asm_fref(as, ir); break;\r\n  case IR_STRREF: asm_strref(as, ir); break;\r\n\r\n  /* Loads and stores. */\r\n  case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n    asm_ahuvload(as, ir);\r\n    break;\r\n  case IR_FLOAD: asm_fload(as, ir); break;\r\n  case IR_XLOAD: asm_xload(as, ir); break;\r\n  case IR_SLOAD: asm_sload(as, ir); break;\r\n\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: asm_ahustore(as, ir); break;\r\n  case IR_FSTORE: asm_fstore(as, ir); break;\r\n  case IR_XSTORE: asm_xstore(as, ir, 0); break;\r\n\r\n  /* Allocations. */\r\n  case IR_SNEW: case IR_XSNEW: asm_snew(as, ir); break;\r\n  case IR_TNEW: asm_tnew(as, ir); break;\r\n  case IR_TDUP: asm_tdup(as, ir); break;\r\n  case IR_CNEW: case IR_CNEWI: asm_cnew(as, ir); break;\r\n\r\n  /* Write barriers. */\r\n  case IR_TBAR: asm_tbar(as, ir); break;\r\n  case IR_OBAR: asm_obar(as, ir); break;\r\n\r\n  /* Type conversions. */\r\n  case IR_CONV: asm_conv(as, ir); break;\r\n  case IR_TOSTR: asm_tostr(as, ir); break;\r\n  case IR_STRTO: asm_strto(as, ir); break;\r\n\r\n  /* Calls. */\r\n  case IR_CALLN: case IR_CALLL: case IR_CALLS: asm_call(as, ir); break;\r\n  case IR_CALLXS: asm_callx(as, ir); break;\r\n  case IR_CARG: break;\r\n\r\n  default:\r\n    setintV(&as->J->errinfo, ir->o);\r\n    lj_trace_err_info(as->J, LJ_TRERR_NYIIR);\r\n    break;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = (int)CCI_NARGS(ci);\r\n  int nslots = 0, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR, fprodd = 0;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++) {\r\n    if (!LJ_SOFTFP && args[i] && irt_isfp(IR(args[i])->t)) {\r\n      if (!LJ_ABI_SOFTFP && !(ci->flags & CCI_VARARG)) {\r\n\tif (irt_isnum(IR(args[i])->t)) {\r\n\t  if (nfpr > 0) nfpr--;\r\n\t  else fprodd = 0, nslots = (nslots + 3) & ~1;\r\n\t} else {\r\n\t  if (fprodd) fprodd--;\r\n\t  else if (nfpr > 0) fprodd = 1, nfpr--;\r\n\t  else nslots++;\r\n\t}\r\n      } else if (irt_isnum(IR(args[i])->t)) {\r\n\tngpr &= ~1;\r\n\tif (ngpr > 0) ngpr -= 2; else nslots += 2;\r\n      } else {\r\n\tif (ngpr > 0) ngpr--; else nslots++;\r\n      }\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  /* May need extra exit for asm_stack_check on side traces. */\r\n  asm_exitstub_setup(as, as->T->nsnap + (as->parent ? 1 : 0));\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *cstart = NULL, *cend = p;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MCode *px = exitstub_addr(J, exitno) - 2;\r\n  for (; p < pe; p++) {\r\n    /* Look for bl_cc exitstub, replace with b_cc target. */\r\n    uint32_t ins = *p;\r\n    if ((ins & 0x0f000000u) == 0x0b000000u && ins < 0xf0000000u &&\r\n\t((ins ^ (px-p)) & 0x00ffffffu) == 0) {\r\n      *p = (ins & 0xfe000000u) | (((target-p)-2) & 0x00ffffffu);\r\n      cend = p+1;\r\n      if (!cstart) cstart = p;\r\n    }\r\n  }\r\n  lua_assert(cstart != NULL);\r\n  lj_mcode_sync(cstart, cend);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm_mips.h",
    "content": "/*\r\n** MIPS IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a register or RID_ZERO. */\r\nstatic Reg ra_alloc1z(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!(allow & RSET_FPR) && irref_isk(ref) && IR(ref)->i == 0)\r\n      return RID_ZERO;\r\n    r = ra_allocref(as, ref, allow);\r\n  } else {\r\n    ra_noweak(as, r);\r\n  }\r\n  return r;\r\n}\r\n\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_alloc1z(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_alloc1z(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_alloc1z(as, ir->op2, allow);\r\n    left = ra_alloc1z(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_alloc1z(as, ir->op1, allow);\r\n    right = ra_alloc1z(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Need some spare long-range jump slots, for out-of-range branches. */\r\n#define MIPS_SPAREJUMP\t\t4\r\n\r\n/* Setup spare long-range jump slots per mcarea. */\r\nstatic void asm_sparejump_setup(ASMState *as)\r\n{\r\n  MCode *mxp = as->mcbot;\r\n  /* Assumes sizeof(MCLink) == 8. */\r\n  if (((uintptr_t)mxp & (LJ_PAGESIZE-1)) == 8) {\r\n    lua_assert(MIPSI_NOP == 0);\r\n    memset(mxp+2, 0, MIPS_SPAREJUMP*8);\r\n    mxp += MIPS_SPAREJUMP*2;\r\n    lua_assert(mxp < as->mctop);\r\n    lj_mcode_sync(as->mcbot, mxp);\r\n    lj_mcode_commitbot(as->J, mxp);\r\n    as->mcbot = mxp;\r\n    as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  }\r\n}\r\n\r\n/* Setup exit stub after the end of each trace. */\r\nstatic void asm_exitstub_setup(ASMState *as)\r\n{\r\n  MCode *mxp = as->mctop;\r\n  /* sw TMP, 0(sp); j ->vm_exit_handler; li TMP, traceno */\r\n  *--mxp = MIPSI_LI|MIPSF_T(RID_TMP)|as->T->traceno;\r\n  *--mxp = MIPSI_J|((((uintptr_t)(void *)lj_vm_exit_handler)>>2)&0x03ffffffu);\r\n  lua_assert(((uintptr_t)mxp ^ (uintptr_t)(void *)lj_vm_exit_handler)>>28 == 0);\r\n  *--mxp = MIPSI_SW|MIPSF_T(RID_TMP)|MIPSF_S(RID_SP)|0;\r\n  as->mctop = mxp;\r\n}\r\n\r\n/* Keep this in-sync with exitstub_trace_addr(). */\r\n#define asm_exitstub_addr(as)\t((as)->mctop)\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guard(ASMState *as, MIPSIns mi, Reg rs, Reg rt)\r\n{\r\n  MCode *target = asm_exitstub_addr(as);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->invmcp = NULL;\r\n    as->loopinv = 1;\r\n    as->mcp = p+1;\r\n    mi = mi ^ ((mi>>28) == 1 ? 0x04000000u : 0x00010000u);  /* Invert cond. */\r\n    target = p;  /* Patch target later in asm_loop_fixup. */\r\n  }\r\n  emit_ti(as, MIPSI_LI, RID_TMP, as->snapno);\r\n  emit_branch(as, mi, rs, rt, target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (checki16(ofs)) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (checki16(ofs)) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\tint32_t jgl = (intptr_t)J2G(as->J);\r\n\tif ((uint32_t)(ofs-jgl) < 65536) {\r\n\t  *ofsp = ofs-jgl-32768;\r\n\t  return RID_JGL;\r\n\t} else {\r\n\t  *ofsp = (int16_t)ofs;\r\n\t  return ra_allock(as, ofs-(int16_t)ofs, allow);\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, MIPSIns mi, Reg rt, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) && (ofs2 = ofs + IR(ir->op2)->i, checki16(ofs2))) {\r\n\tref = ir->op1;\r\n\tofs = ofs2;\r\n      }\r\n    } else if (ir->o == IR_STRREF) {\r\n      int32_t ofs2 = 65536;\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs2 = ofs + IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs2 = ofs + IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      }\r\n      if (!checki16(ofs2)) {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\temit_hsi(as, mi, rt, RID_TMP, ofs);\r\n\temit_dst(as, MIPSI_ADDU, RID_TMP, left, right);\r\n\treturn;\r\n      }\r\n      ofs = ofs2;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n  emit_hsi(as, mi, rt, base, ofs);\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_NARGS(ci);\r\n  int32_t ofs = 16;\r\n  Reg gpr, fpr = REGARG_FIRSTFPR;\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n  for (gpr = REGARG_FIRSTGPR; gpr <= REGARG_LASTGPR; gpr++)\r\n    as->cost[gpr] = REGCOST(~0u, ASMREF_L);\r\n  gpr = REGARG_FIRSTGPR;\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    if (ref) {\r\n      IRIns *ir = IR(ref);\r\n      if (irt_isfp(ir->t) && fpr <= REGARG_LASTFPR &&\r\n\t  !(ci->flags & CCI_VARARG)) {\r\n\tlua_assert(rset_test(as->freeset, fpr));  /* Already evicted. */\r\n\tra_leftov(as, fpr, ref);\r\n\tfpr += 2;\r\n\tgpr += irt_isnum(ir->t) ? 2 : 1;\r\n      } else {\r\n\tfpr = REGARG_LASTFPR+1;\r\n\tif (irt_isnum(ir->t)) gpr = (gpr+1) & ~1;\r\n\tif (gpr <= REGARG_LASTGPR) {\r\n\t  lua_assert(rset_test(as->freeset, gpr));  /* Already evicted. */\r\n\t  if (irt_isfp(ir->t)) {\r\n\t    RegSet of = as->freeset;\r\n\t    Reg r;\r\n\t    /* Workaround to protect argument GPRs from being used for remat. */\r\n\t    as->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n\t    r = ra_alloc1(as, ref, RSET_FPR);\r\n\t    as->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n\t    if (irt_isnum(ir->t)) {\r\n\t      emit_tg(as, MIPSI_MFC1, gpr+(LJ_BE?0:1), r+1);\r\n\t      emit_tg(as, MIPSI_MFC1, gpr+(LJ_BE?1:0), r);\r\n\t      lua_assert(rset_test(as->freeset, gpr+1));  /* Already evicted. */\r\n\t      gpr += 2;\r\n\t    } else if (irt_isfloat(ir->t)) {\r\n\t      emit_tg(as, MIPSI_MFC1, gpr, r);\r\n\t      gpr++;\r\n\t    }\r\n\t  } else {\r\n\t    ra_leftov(as, gpr, ref);\r\n\t    gpr++;\r\n\t  }\r\n\t} else {\r\n\t  Reg r = ra_alloc1z(as, ref, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n\t  if (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += irt_isnum(ir->t) ? 8 : 4;\r\n\t}\r\n      }\r\n    } else {\r\n      fpr = REGARG_LASTFPR+1;\r\n      if (gpr <= REGARG_LASTGPR)\r\n\tgpr++;\r\n      else\r\n\tofs += 4;\r\n    }\r\n    checkmclim(as);\r\n  }\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (irt_isfp(ir->t)) {\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\tint32_t ofs = sps_scale(ir->s);\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_tg(as, MIPSI_MTC1, RID_RETHI, dest+1);\r\n\t  emit_tg(as, MIPSI_MTC1, RID_RETLO, dest);\r\n\t}\r\n\tif (ofs) {\r\n\t  emit_tsi(as, MIPSI_SW, RID_RETLO, RID_SP, ofs+(LJ_BE?4:0));\r\n\t  emit_tsi(as, MIPSI_SW, RID_RETHI, RID_SP, ofs+(LJ_BE?0:4));\r\n\t}\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_call(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX];\r\n  const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n  asm_collectargs(as, ir, ci, args);\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(irf->i);\r\n  } else {  /* Need specific register for indirect calls. */\r\n    Reg r = ra_alloc1(as, func, RID2RSET(RID_CFUNCADDR));\r\n    MCode *p = as->mcp;\r\n    if (r == RID_CFUNCADDR)\r\n      *--p = MIPSI_NOP;\r\n    else\r\n      *--p = MIPSI_MOVE | MIPSF_D(RID_CFUNCADDR) | MIPSF_S(r);\r\n    *--p = MIPSI_JALR | MIPSF_S(r);\r\n    as->mcp = p;\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\nstatic void asm_callid(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_callround(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RID2RSET(RID_R1)|RID2RSET(RID_R12)|RID2RSET(RID_FPRET)|\r\n\t\tRID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(REGARG_FIRSTFPR);\r\n  if (ra_hasreg(ir->r)) rset_clear(drop, ir->r);\r\n  ra_evictset(as, drop);\r\n  ra_destreg(as, ir, RID_FPRET);\r\n  emit_call(as, (void *)lj_ir_callinfo[id].func);\r\n  ra_leftov(as, REGARG_FIRSTFPR, ir->op1);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guard(as, MIPSI_BNE, RID_TMP,\r\n\t    ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_tsi(as, MIPSI_LW, RID_TMP, base, -8);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guard(as, MIPSI_BC1F, 0, 0);\r\n  emit_fgh(as, MIPSI_C_EQ_D, 0, tmp, left);\r\n  emit_fg(as, MIPSI_CVT_D_W, tmp, tmp);\r\n  emit_tg(as, MIPSI_MFC1, dest, tmp);\r\n  emit_fg(as, MIPSI_CVT_W_D, tmp, left);\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  emit_tg(as, MIPSI_MFC1, dest, tmp);\r\n  emit_fgh(as, MIPSI_ADD_D, tmp, left, right);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(irt_isint64(ir->t) ||\r\n\t       (st == IRT_I64 || st == IRT_U64))); /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      emit_fg(as, st == IRT_NUM ? MIPSI_CVT_S_D : MIPSI_CVT_D_S,\r\n\t      dest, ra_alloc1(as, lref, RSET_FPR));\r\n    } else if (st == IRT_U32) {  /* U32 to FP conversion. */\r\n      /* y = (x ^ 0x8000000) + 2147483648.0 */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      emit_fgh(as, irt_isfloat(ir->t) ? MIPSI_ADD_S : MIPSI_ADD_D,\r\n\t       dest, dest, tmp);\r\n      emit_fg(as, irt_isfloat(ir->t) ? MIPSI_CVT_S_W : MIPSI_CVT_D_W,\r\n\t      dest, dest);\r\n      if (irt_isfloat(ir->t))\r\n\temit_lsptr(as, MIPSI_LWC1, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(4f000000,4f000000)),\r\n\t\t   RSET_GPR);\r\n      else\r\n\temit_lsptr(as, MIPSI_LDC1, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(41e00000,00000000)),\r\n\t\t   RSET_GPR);\r\n      emit_tg(as, MIPSI_MTC1, RID_TMP, dest);\r\n      emit_dst(as, MIPSI_XOR, RID_TMP, RID_TMP, left);\r\n      emit_ti(as, MIPSI_LUI, RID_TMP, 0x8000);\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_fg(as, irt_isfloat(ir->t) ? MIPSI_CVT_S_W : MIPSI_CVT_D_W,\r\n\t      dest, dest);\r\n      emit_tg(as, MIPSI_MTC1, left, dest);\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      if (irt_isu32(ir->t)) {\r\n\t/* y = (int)floor(x - 2147483648.0) ^ 0x80000000 */\r\n\temit_dst(as, MIPSI_XOR, dest, dest, RID_TMP);\r\n\temit_ti(as, MIPSI_LUI, RID_TMP, 0x8000);\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, st == IRT_FLOAT ? MIPSI_FLOOR_W_S : MIPSI_FLOOR_W_D,\r\n\t\ttmp, tmp);\r\n\temit_fgh(as, st == IRT_FLOAT ? MIPSI_SUB_S : MIPSI_SUB_D,\r\n\t\t tmp, left, tmp);\r\n\tif (st == IRT_FLOAT)\r\n\t  emit_lsptr(as, MIPSI_LWC1, (tmp & 31),\r\n\t\t     (void *)lj_ir_k64_find(as->J, U64x(4f000000,4f000000)),\r\n\t\t     RSET_GPR);\r\n\telse\r\n\t  emit_lsptr(as, MIPSI_LDC1, (tmp & 31),\r\n\t\t     (void *)lj_ir_k64_find(as->J, U64x(41e00000,00000000)),\r\n\t\t     RSET_GPR);\r\n      } else {\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, st == IRT_FLOAT ? MIPSI_TRUNC_W_S : MIPSI_TRUNC_W_D,\r\n\t\ttmp, left);\r\n      }\r\n    }\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((ir->op2 & IRCONV_SEXT)) {\r\n\tif ((as->flags & JIT_F_MIPS32R2)) {\r\n\t  emit_dst(as, st == IRT_I8 ? MIPSI_SEB : MIPSI_SEH, dest, 0, left);\r\n\t} else {\r\n\t  uint32_t shift = st == IRT_I8 ? 24 : 16;\r\n\t  emit_dta(as, MIPSI_SRA, dest, dest, shift);\r\n\t  emit_dta(as, MIPSI_SLL, dest, left, shift);\r\n\t}\r\n      } else {\r\n\temit_tsi(as, MIPSI_ANDI, dest, left,\r\n\t\t (int32_t)(st == IRT_U8 ? 0xff : 0xffff));\r\n      }\r\n    } else {  /* 32/64 bit integer conversions. */\r\n      /* Only need to handle 32/32 bit no-op (cast) on 32 bit archs. */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_conv64(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  IRCallID id;\r\n  const CCallInfo *ci;\r\n  IRRef args[2];\r\n  args[LJ_BE?0:1] = ir->op1;\r\n  args[LJ_BE?1:0] = (ir-1)->op1;\r\n  if (st == IRT_NUM || st == IRT_FLOAT) {\r\n    id = IRCALL_fp64_d2l + ((st == IRT_FLOAT) ? 2 : 0) + (dt - IRT_I64);\r\n    ir--;\r\n  } else {\r\n    id = IRCALL_fp64_l2d + ((dt == IRT_FLOAT) ? 2 : 0) + (st - IRT_I64);\r\n  }\r\n  ci = &lj_ir_callinfo[id];\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n#endif\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  RegSet drop = RSET_SCRATCH;\r\n  if (ra_hasreg(ir->r)) rset_set(drop, ir->r);  /* Spill dest reg (if any). */\r\n  ra_evictset(as, drop);\r\n  asm_guard(as, MIPSI_BEQ, RID_RET, RID_ZERO);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1),\r\n\t   RID_SP, sps_scale(ir->s));\r\n}\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref))  /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    else  /* Otherwise force a spill and use the spill slot. */\r\n      emit_tsi(as, MIPSI_ADDIU, dest, RID_SP, ra_spill(as, ir));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_tsi(as, MIPSI_ADDIU, dest, RID_JGL, offsetof(global_State, tmptv)-32768);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_setgl(as, src, tmptv.gcr);\r\n    }\r\n    type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_setgl(as, type, tmptv.it);\r\n  }\r\n}\r\n\r\nstatic void asm_tostr(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;\r\n  as->gcsteps++;\r\n  if (irt_isnum(IR(ir->op1)->t) || (ir+1)->o == IR_HIOP) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromnum];\r\n    args[1] = ASMREF_TMP1;  /* const lua_Number * */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n    asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op1);\r\n  } else {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromint];\r\n    args[1] = ir->op1;  /* int32_t k */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n  }\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    ofs += 8*IR(ir->op2)->i;\r\n    if (checki16(ofs)) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, base, ofs);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_dst(as, MIPSI_ADDU, dest, RID_TMP, base);\r\n  emit_dta(as, MIPSI_SLL, RID_TMP, idx, 3);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, type = RID_NONE, tmpnum = RID_NONE, tmp1 = RID_TMP, tmp2;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  rset_clear(allow, tab);\r\n  if (irt_isnum(kt)) {\r\n    key = ra_alloc1(as, refkey, RSET_FPR);\r\n    tmpnum = ra_scratch(as, rset_exclude(RSET_FPR, key));\r\n  } else if (!irt_ispri(kt)) {\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n    type = ra_allock(as, irt_toitype(irkey->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  tmp2 = ra_scratch(as, allow);\r\n  rset_clear(allow, tmp2);\r\n\r\n  /* Key not found in chain: load niltv. */\r\n  l_end = emit_label(as);\r\n  if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n  else\r\n    *--as->mcp = MIPSI_NOP;\r\n  /* Follow hash chain until the end. */\r\n  emit_move(as, dest, tmp1);\r\n  l_loop = --as->mcp;\r\n  emit_tsi(as, MIPSI_LW, tmp1, dest, (int32_t)offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (irt_isnum(kt)) {\r\n    emit_branch(as, MIPSI_BC1T, 0, 0, l_end);\r\n    emit_fgh(as, MIPSI_C_EQ_D, 0, tmpnum, key);\r\n\temit_tg(as, MIPSI_MFC1, tmp1, key+1);\r\n    emit_branch(as, MIPSI_BEQ, tmp1, RID_ZERO, l_next);\r\n    emit_tsi(as, MIPSI_SLTIU, tmp1, tmp1, (int32_t)LJ_TISNUM);\r\n    emit_hsi(as, MIPSI_LDC1, tmpnum, dest, (int32_t)offsetof(Node, key.n));\r\n  } else {\r\n    if (irt_ispri(kt)) {\r\n      emit_branch(as, MIPSI_BEQ, tmp1, type, l_end);\r\n    } else {\r\n      emit_branch(as, MIPSI_BEQ, tmp2, key, l_end);\r\n      emit_tsi(as, MIPSI_LW, tmp2, dest, (int32_t)offsetof(Node, key.gcr));\r\n      emit_branch(as, MIPSI_BNE, tmp1, type, l_next);\r\n    }\r\n  }\r\n  emit_tsi(as, MIPSI_LW, tmp1, dest, (int32_t)offsetof(Node, key.it));\r\n  *l_loop = MIPSI_BNE | MIPSF_S(tmp1) | ((as->mcp-l_loop-1) & 0xffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_tsi(as, MIPSI_LW, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    Reg tmphash = tmp1;\r\n    if (irref_isk(refkey))\r\n      tmphash = ra_allock(as, khash, allow);\r\n    emit_dst(as, MIPSI_ADDU, dest, dest, tmp1);\r\n    lua_assert(sizeof(Node) == 24);\r\n    emit_dst(as, MIPSI_SUBU, tmp1, tmp2, tmp1);\r\n    emit_dta(as, MIPSI_SLL, tmp1, tmp1, 3);\r\n    emit_dta(as, MIPSI_SLL, tmp2, tmp1, 5);\r\n    emit_dst(as, MIPSI_AND, tmp1, tmp2, tmphash);\r\n    emit_tsi(as, MIPSI_LW, dest, tab, (int32_t)offsetof(GCtab, node));\r\n    emit_tsi(as, MIPSI_LW, tmp2, tab, (int32_t)offsetof(GCtab, hmask));\r\n    if (irref_isk(refkey)) {\r\n      /* Nothing to do. */\r\n    } else if (irt_isstr(kt)) {\r\n      emit_tsi(as, MIPSI_LW, tmp1, key, (int32_t)offsetof(GCstr, hash));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      emit_dst(as, MIPSI_SUBU, tmp1, tmp1, tmp2);\r\n      emit_rotr(as, tmp2, tmp2, dest, (-HASH_ROT3)&31);\r\n      emit_dst(as, MIPSI_XOR, tmp1, tmp1, tmp2);\r\n      emit_rotr(as, tmp1, tmp1, dest, (-HASH_ROT2-HASH_ROT1)&31);\r\n      emit_dst(as, MIPSI_SUBU, tmp2, tmp2, dest);\r\n      if (irt_isnum(kt)) {\r\n\temit_dst(as, MIPSI_XOR, tmp2, tmp2, tmp1);\r\n\tif ((as->flags & JIT_F_MIPS32R2)) {\r\n\t  emit_dta(as, MIPSI_ROTR, dest, tmp1, (-HASH_ROT1)&31);\r\n\t} else {\r\n\t  emit_dst(as, MIPSI_OR, dest, dest, tmp1);\r\n\t  emit_dta(as, MIPSI_SLL, tmp1, tmp1, HASH_ROT1);\r\n\t  emit_dta(as, MIPSI_SRL, dest, tmp1, (-HASH_ROT1)&31);\r\n\t}\r\n\temit_dst(as, MIPSI_ADDU, tmp1, tmp1, tmp1);\r\n\temit_tg(as, MIPSI_MFC1, tmp2, key);\r\n\temit_tg(as, MIPSI_MFC1, tmp1, key+1);\r\n      } else {\r\n\temit_dst(as, MIPSI_XOR, tmp2, key, tmp1);\r\n\temit_rotr(as, dest, tmp1, tmp2, (-HASH_ROT1)&31);\r\n\temit_dst(as, MIPSI_ADDU, tmp1, key, ra_allock(as, HASH_BIAS, allow));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir)||ofs > 32736) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  int32_t lo, hi;\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 32736) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_tsi(as, MIPSI_ADDIU, dest, node, ofs);\r\n  }\r\n  if (!irt_ispri(irkey->t)) {\r\n    key = ra_scratch(as, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  if (irt_isnum(irkey->t)) {\r\n    lo = (int32_t)ir_knum(irkey)->u32.lo;\r\n    hi = (int32_t)ir_knum(irkey)->u32.hi;\r\n  } else {\r\n    lo = irkey->i;\r\n    hi = irt_toitype(irkey->t);\r\n    if (!ra_hasreg(key))\r\n      goto nolo;\r\n  }\r\n  asm_guard(as, MIPSI_BNE, key, lo ? ra_allock(as, lo, allow) : RID_ZERO);\r\nnolo:\r\n  asm_guard(as, MIPSI_BNE, type, hi ? ra_allock(as, hi, allow) : RID_ZERO);\r\n  if (ra_hasreg(key)) emit_tsi(as, MIPSI_LW, key, idx, kofs+(LJ_BE?4:0));\r\n  emit_tsi(as, MIPSI_LW, type, idx, kofs+(LJ_BE?0:4));\r\n  if (ofs > 32736)\r\n    emit_tsi(as, MIPSI_ADDU, dest, node, ra_allock(as, ofs, allow));\r\n}\r\n\r\nstatic void asm_newref(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_newkey];\r\n    IRRef args[3];\r\n    args[0] = ASMREF_L;     /* lua_State *L */\r\n    args[1] = ir->op1;      /* GCtab *t     */\r\n    args[2] = ASMREF_TMP1;  /* cTValue *key */\r\n    asm_setupresult(as, ir, ci);  /* TValue * */\r\n    asm_gencall(as, ci, args);\r\n    asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op2);\r\n  }\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, MIPSI_LW, dest, v, RSET_GPR);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guard(as, MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, uv, (int32_t)offsetof(GCupval, tv));\r\n      emit_tsi(as, MIPSI_LBU, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_tsi(as, MIPSI_LW, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_tsi(as, MIPSI_LW, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  int32_t ofs = (int32_t)sizeof(GCstr);\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       checki16(ofs + IR(irr->op2)->i)) {\r\n      ofs += IR(irr->op2)->i;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_tsi(as, MIPSI_ADDIU, dest, dest, ofs);\r\n    emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  ofs += IR(refk)->i;\r\n  if (checki16(ofs))\r\n    emit_tsi(as, MIPSI_ADDIU, dest, r, ofs);\r\n  else\r\n    emit_dst(as, MIPSI_ADDU, dest, r,\r\n\t     ra_allock(as, ofs, rset_exclude(RSET_GPR, r)));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic MIPSIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return MIPSI_LB;\r\n  case IRT_U8: return MIPSI_LBU;\r\n  case IRT_I16: return MIPSI_LH;\r\n  case IRT_U16: return MIPSI_LHU;\r\n  case IRT_NUM: return MIPSI_LDC1;\r\n  case IRT_FLOAT: return MIPSI_LWC1;\r\n  default: return MIPSI_LW;\r\n  }\r\n}\r\n\r\nstatic MIPSIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return MIPSI_SB;\r\n  case IRT_I16: case IRT_U16: return MIPSI_SH;\r\n  case IRT_NUM: return MIPSI_SDC1;\r\n  case IRT_FLOAT: return MIPSI_SWC1;\r\n  default: return MIPSI_SW;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  MIPSIns mi = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_tsi(as, MIPSI_ADDIU, dest, idx, ofs);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  lua_assert(!irt_isfp(ir->t));\r\n  emit_tsi(as, mi, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1z(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    MIPSIns mi = asm_fxstoreins(ir);\r\n    lua_assert(!irt_isfp(ir->t));\r\n    emit_tsi(as, mi, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1z(as, ir->op2, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_TMP, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = 0;\r\n  if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  rset_clear(allow, idx);\r\n  if (irt_isnum(t)) {\r\n    asm_guard(as, MIPSI_BEQ, type, RID_ZERO);\r\n    emit_tsi(as, MIPSI_SLTIU, type, type, (int32_t)LJ_TISNUM);\r\n    if (ra_hasreg(dest))\r\n      emit_hsi(as, MIPSI_LDC1, dest, idx, ofs);\r\n  } else {\r\n    asm_guard(as, MIPSI_BNE, type, ra_allock(as, irt_toitype(t), allow));\r\n    if (ra_hasreg(dest)) emit_tsi(as, MIPSI_LW, dest, idx, ofs+(LJ_BE?4:0));\r\n  }\r\n  emit_tsi(as, MIPSI_LW, type, idx, ofs+(LJ_BE?0:4));\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg idx, src = RID_NONE, type = RID_NONE;\r\n  int32_t ofs = 0;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n  } else {\r\n    if (!irt_ispri(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n    }\r\n    type = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(ir->t)) {\r\n    emit_hsi(as, MIPSI_SDC1, src, idx, ofs);\r\n  } else {\r\n    if (ra_hasreg(src))\r\n      emit_tsi(as, MIPSI_SW, src, idx, ofs+(LJ_BE?4:0));\r\n    emit_tsi(as, MIPSI_SW, type, idx, ofs+(LJ_BE?0:4));\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(!irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    rset_clear(allow, base);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (irt_isint(t)) {\r\n\tReg tmp = ra_scratch(as, RSET_FPR);\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, MIPSI_CVT_W_D, tmp, tmp);\r\n\tdest = tmp;\r\n\tt.irt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\tReg tmp = ra_scratch(as, RSET_GPR);\r\n\temit_fg(as, MIPSI_CVT_D_W, dest, dest);\r\n\temit_tg(as, MIPSI_MTC1, tmp, dest);\r\n\tdest = tmp;\r\n\tt.irt = IRT_INT;  /* Check for original type. */\r\n      }\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\n  rset_clear(allow, base);\r\ndotypecheck:\r\n  if (irt_isnum(t)) {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      asm_guard(as, MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_tsi(as, MIPSI_SLTIU, RID_TMP, RID_TMP, (int32_t)LJ_TISNUM);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_hsi(as, MIPSI_LDC1, dest, base, ofs);\r\n  } else {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      Reg ktype = ra_allock(as, irt_toitype(t), allow);\r\n      asm_guard(as, MIPSI_BNE, RID_TMP, ktype);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_tsi(as, MIPSI_LW, dest, base, ofs ^ (LJ_BE?4:0));\r\n  }\r\n  if (ra_hasreg(type)) emit_tsi(as, MIPSI_LW, type, base, ofs ^ (LJ_BE?0:4));\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID ctypeid = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz = (ir->o == IR_CNEWI || ir->op2 == REF_NIL) ?\r\n\t      lj_ctype_size(cts, ctypeid) : (CTSize)IR(ir->op2)->i;\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[2];\r\n  RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID);\r\n\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  as->gcsteps++;\r\n\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4;\r\n      lua_assert((ir+1)->o == IR_HIOP);\r\n      if (LJ_LE) ir++;\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1z(as, ir->op2, allow);\r\n      emit_tsi(as, MIPSI_SW, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; if (LJ_BE) ir++; else ir--;\r\n    }\r\n  }\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  emit_tsi(as, MIPSI_SB, RID_RET+1, RID_RET, offsetof(GCcdata, gct));\r\n  emit_tsi(as, MIPSI_SH, RID_TMP, RID_RET, offsetof(GCcdata, ctypeid));\r\n  emit_ti(as, MIPSI_LI, RID_RET+1, ~LJ_TCDATA);\r\n  emit_ti(as, MIPSI_LI, RID_TMP, ctypeid); /* Lower 16 bit used. Sign-ext ok. */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg mark = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg link = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_tsi(as, MIPSI_SW, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_tsi(as, MIPSI_SB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  emit_getgl(as, link, gc.grayagain);\r\n  emit_dst(as, MIPSI_XOR, mark, mark, RID_TMP);  /* Clear black bit. */\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, RID_TMP, mark, LJ_GC_BLACK);\r\n  emit_tsi(as, MIPSI_LBU, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, tmp, tmp, LJ_GC_BLACK);\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, RID_TMP, RID_TMP, LJ_GC_WHITES);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_tsi(as, MIPSI_LBU, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_tsi(as, MIPSI_LBU, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, MIPSIns mi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_fgh(as, mi, dest, left, right);\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, MIPSIns mi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_fg(as, mi, dest, left);\r\n}\r\n\r\nstatic int asm_fpjoin_pow(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irp = IR(ir->op1);\r\n  if (irp == ir-1 && irp->o == IR_MUL && !ra_used(irp)) {\r\n    IRIns *irpp = IR(irp->op1);\r\n    if (irpp == ir-2 && irpp->o == IR_FPMATH &&\r\n\tirpp->op2 == IRFPM_LOG2 && !ra_used(irpp)) {\r\n      const CCallInfo *ci = &lj_ir_callinfo[IRCALL_pow];\r\n      IRRef args[2];\r\n      args[0] = irpp->op1;\r\n      args[1] = irp->op2;\r\n      asm_setupresult(as, ir, ci);\r\n      asm_gencall(as, ci, args);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_ADD_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\temit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_SUB_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_MUL_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, MIPSI_MUL, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, MIPSI_NEG_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n  }\r\n}\r\n\r\nstatic void asm_arithov(ASMState *as, IRIns *ir)\r\n{\r\n  Reg right, left, tmp, dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int k = IR(ir->op2)->i;\r\n    if (ir->o == IR_SUBOV) k = -k;\r\n    if (checki16(k)) {  /* (dest < left) == (k >= 0 ? 1 : 0) */\r\n      left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      asm_guard(as, k >= 0 ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_dst(as, MIPSI_SLT, RID_TMP, dest, dest == left ? RID_TMP : left);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      if (dest == left) emit_move(as, RID_TMP, left);\r\n      return;\r\n    }\r\n  }\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  tmp = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_GPR, left),\r\n\t\t\t\t\t\t right), dest));\r\n  asm_guard(as, MIPSI_BLTZ, RID_TMP, 0);\r\n  emit_dst(as, MIPSI_AND, RID_TMP, RID_TMP, tmp);\r\n  if (ir->o == IR_ADDOV) {  /* ((dest^left) & (dest^right)) < 0 */\r\n    emit_dst(as, MIPSI_XOR, RID_TMP, dest, dest == right ? RID_TMP : right);\r\n  } else {  /* ((dest^left) & (dest^~right)) < 0 */\r\n    emit_dst(as, MIPSI_XOR, RID_TMP, RID_TMP, dest);\r\n    emit_dst(as, MIPSI_NOR, RID_TMP, dest == right ? RID_TMP : right, RID_ZERO);\r\n  }\r\n  emit_dst(as, MIPSI_XOR, tmp, dest, dest == left ? RID_TMP : left);\r\n  emit_dst(as, ir->o == IR_ADDOV ? MIPSI_ADDU : MIPSI_SUBU, dest, left, right);\r\n  if (dest == left || dest == right)\r\n    emit_move(as, RID_TMP, dest == left ? left : right);\r\n}\r\n\r\nstatic void asm_mulov(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_DUALNUM\r\n#error \"NYI: MULOV\"\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused in single-number mode. */\r\n#endif\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_add64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0) {\r\n      emit_dst(as, MIPSI_ADDU, dest, left, RID_TMP);\r\n      goto loarith;\r\n    } else if (checki16(k)) {\r\n      emit_dst(as, MIPSI_ADDU, dest, dest, RID_TMP);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      goto loarith;\r\n    }\r\n  }\r\n  emit_dst(as, MIPSI_ADDU, dest, dest, RID_TMP);\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_dst(as, MIPSI_ADDU, dest, left, right);\r\nloarith:\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0) {\r\n      if (dest != left)\r\n\temit_move(as, dest, left);\r\n      return;\r\n    } else if (checki16(k)) {\r\n      if (dest == left) {\r\n\tReg tmp = ra_scratch(as, rset_exclude(RSET_GPR, left));\r\n\temit_move(as, dest, tmp);\r\n\tdest = tmp;\r\n      }\r\n      emit_dst(as, MIPSI_SLTU, RID_TMP, dest, left);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  if (dest == left && dest == right) {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n    emit_move(as, dest, tmp);\r\n    dest = tmp;\r\n  }\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, dest, dest == left ? right : left);\r\n  emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n}\r\n\r\nstatic void asm_sub64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dst(as, MIPSI_SUBU, dest, dest, RID_TMP);\r\n  emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (dest == left) {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n    emit_move(as, dest, tmp);\r\n    dest = tmp;\r\n  }\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, left, dest);\r\n  emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n}\r\n\r\nstatic void asm_neg64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_dst(as, MIPSI_SUBU, dest, dest, RID_TMP);\r\n  emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, RID_ZERO, dest);\r\n  emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n}\r\n#endif\r\n\r\nstatic void asm_bitnot(ASMState *as, IRIns *ir)\r\n{\r\n  Reg left, right, dest = ra_dest(as, ir, RSET_GPR);\r\n  IRIns *irl = IR(ir->op1);\r\n  if (mayfuse(as, ir->op1) && irl->o == IR_BOR) {\r\n    left = ra_alloc2(as, irl, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n  } else {\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    right = RID_ZERO;\r\n  }\r\n  emit_dst(as, MIPSI_NOR, dest, left, right);\r\n}\r\n\r\nstatic void asm_bitswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    emit_dta(as, MIPSI_ROTR, dest, RID_TMP, 16);\r\n    emit_dst(as, MIPSI_WSBH, RID_TMP, 0, left);\r\n  } else {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), dest));\r\n    emit_dst(as, MIPSI_OR, dest, dest, tmp);\r\n    emit_dst(as, MIPSI_OR, dest, dest, RID_TMP);\r\n    emit_tsi(as, MIPSI_ANDI, dest, dest, 0xff00);\r\n    emit_dta(as, MIPSI_SLL, RID_TMP, RID_TMP, 8);\r\n    emit_dta(as, MIPSI_SRL, dest, left, 8);\r\n    emit_tsi(as, MIPSI_ANDI, RID_TMP, left, 0xff00);\r\n    emit_dst(as, MIPSI_OR, tmp, tmp, RID_TMP);\r\n    emit_dta(as, MIPSI_SRL, tmp, left, 24);\r\n    emit_dta(as, MIPSI_SLL, RID_TMP, left, 24);\r\n  }\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, MIPSIns mi, MIPSIns mik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (checku16(k)) {\r\n      emit_tsi(as, mik, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_dst(as, mi, dest, left, right);\r\n}\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, MIPSIns mi, MIPSIns mik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    uint32_t shift = (uint32_t)(IR(ir->op2)->i & 31);\r\n    emit_dta(as, mik, dest, ra_hintalloc(as, ir->op1, dest, RSET_GPR), shift);\r\n  } else {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, mi, dest, right, left);  /* Shift amount is in rs. */\r\n  }\r\n}\r\n\r\nstatic void asm_bitror(ASMState *as, IRIns *ir)\r\n{\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    asm_bitshift(as, ir, MIPSI_ROTRV, MIPSI_ROTR);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n      uint32_t shift = (uint32_t)(IR(ir->op2)->i & 31);\r\n      Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n      emit_rotr(as, dest, left, RID_TMP, shift);\r\n    } else {\r\n      Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n      right = (left >> 8); left &= 255;\r\n      emit_dst(as, MIPSI_OR, dest, dest, RID_TMP);\r\n      emit_dst(as, MIPSI_SRLV, dest, right, left);\r\n      emit_dst(as, MIPSI_SLLV, RID_TMP, RID_TMP, left);\r\n      emit_dst(as, MIPSI_SUBU, RID_TMP, ra_allock(as, 32, RSET_GPR), right);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int ismax)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (dest == left) {\r\n      emit_fg(as, MIPSI_MOVT_D, dest, right);\r\n    } else {\r\n      emit_fg(as, MIPSI_MOVF_D, dest, left);\r\n      if (dest != right) emit_fg(as, MIPSI_MOV_D, dest, right);\r\n    }\r\n    emit_fgh(as, MIPSI_C_OLT_D, 0, ismax ? left : right, ismax ? right : left);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (dest == left) {\r\n      emit_dst(as, MIPSI_MOVN, dest, right, RID_TMP);\r\n    } else {\r\n      emit_dst(as, MIPSI_MOVZ, dest, left, RID_TMP);\r\n      if (dest != right) emit_move(as, dest, right);\r\n    }\r\n    emit_dst(as, MIPSI_SLT, RID_TMP,\r\n\t     ismax ? left : right, ismax ? right : left);\r\n  }\r\n}\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n  /* ORDER IR: LT GE LE GT  ULT UGE ULE UGT. */\r\n  IROp op = ir->o;\r\n  if (irt_isnum(ir->t)) {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    asm_guard(as, (op&1) ? MIPSI_BC1T : MIPSI_BC1F, 0, 0);\r\n    emit_fgh(as, MIPSI_C_OLT_D + ((op&3) ^ ((op>>2)&1)), 0, left, right);\r\n  } else {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (op == IR_ABC) op = IR_UGT;\r\n    if ((op&4) == 0 && irref_isk(ir->op2) && IR(ir->op2)->i == 0) {\r\n      MIPSIns mi = (op&2) ? ((op&1) ? MIPSI_BLEZ : MIPSI_BGTZ) :\r\n\t\t\t    ((op&1) ? MIPSI_BLTZ : MIPSI_BGEZ);\r\n      asm_guard(as, mi, left, 0);\r\n    } else {\r\n      if (irref_isk(ir->op2)) {\r\n\tint32_t k = IR(ir->op2)->i;\r\n\tif ((op&2)) k++;\r\n\tif (checki16(k)) {\r\n\t  asm_guard(as, (op&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n\t  emit_tsi(as, (op&4) ? MIPSI_SLTIU : MIPSI_SLTI,\r\n\t\t   RID_TMP, left, k);\r\n\t  return;\r\n\t}\r\n      }\r\n      right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n      asm_guard(as, ((op^(op>>1))&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_dst(as, (op&4) ? MIPSI_SLTU : MIPSI_SLT,\r\n\t       RID_TMP, (op&2) ? right : left, (op&2) ? left : right);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_compeq(ASMState *as, IRIns *ir)\r\n{\r\n  Reg right, left = ra_alloc2(as, ir, irt_isnum(ir->t) ? RSET_FPR : RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (irt_isnum(ir->t)) {\r\n    asm_guard(as, (ir->o & 1) ? MIPSI_BC1T : MIPSI_BC1F, 0, 0);\r\n    emit_fgh(as, MIPSI_C_EQ_D, 0, left, right);\r\n  } else {\r\n    asm_guard(as, (ir->o & 1) ? MIPSI_BEQ : MIPSI_BNE, left, right);\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_comp64(ASMState *as, IRIns *ir)\r\n{\r\n  /* ORDER IR: LT GE LE GT  ULT UGE ULE UGT. */\r\n  IROp op = (ir-1)->o;\r\n  MCLabel l_end;\r\n  Reg rightlo, leftlo, righthi, lefthi = ra_alloc2(as, ir, RSET_GPR);\r\n  righthi = (lefthi >> 8); lefthi &= 255;\r\n  leftlo = ra_alloc2(as, ir-1,\r\n\t\t     rset_exclude(rset_exclude(RSET_GPR, lefthi), righthi));\r\n  rightlo = (leftlo >> 8); leftlo &= 255;\r\n  asm_guard(as, ((op^(op>>1))&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n  l_end = emit_label(as);\r\n  if (lefthi != righthi)\r\n    emit_dst(as, (op&4) ? MIPSI_SLTU : MIPSI_SLT, RID_TMP,\r\n\t     (op&2) ? righthi : lefthi, (op&2) ? lefthi : righthi);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP,\r\n\t   (op&2) ? rightlo : leftlo, (op&2) ? leftlo : rightlo);\r\n  if (lefthi != righthi)\r\n    emit_branch(as, MIPSI_BEQ, lefthi, righthi, l_end);\r\n}\r\n\r\nstatic void asm_comp64eq(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tmp, right, left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  asm_guard(as, ((ir-1)->o & 1) ? MIPSI_BEQ : MIPSI_BNE, RID_TMP, RID_ZERO);\r\n  tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n  emit_dst(as, MIPSI_OR, RID_TMP, RID_TMP, tmp);\r\n  emit_dst(as, MIPSI_XOR, tmp, left, right);\r\n  left = ra_alloc2(as, ir-1, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dst(as, MIPSI_XOR, RID_TMP, left, right);\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o < IR_EQ) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64eq(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    as->curins--;  /* Handle both stores here. */\r\n    if ((ir-1)->r != RID_SINK) {\r\n      asm_xstore(as, ir, LJ_LE ? 4 : 0);\r\n      asm_xstore(as, ir-1, LJ_LE ? 0 : 4);\r\n    }\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD: as->curins--; asm_add64(as, ir); break;\r\n  case IR_SUB: as->curins--; asm_sub64(as, ir); break;\r\n  case IR_NEG: as->curins--; asm_neg64(as, ir); break;\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore RID_RET*. */\r\n  Reg tmp, pbase = irp ? (ra_hasreg(irp->r) ? irp->r : RID_TMP) : RID_BASE;\r\n  ExitNo oldsnap = as->snapno;\r\n  rset_clear(allow, pbase);\r\n  tmp = allow ? rset_pickbot(allow) :\r\n\t\t(pbase == RID_RETHI ? RID_RETLO : RID_RETHI);\r\n  as->snapno = exitno;\r\n  asm_guard(as, MIPSI_BNE, RID_TMP, RID_ZERO);\r\n  as->snapno = oldsnap;\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_tsi(as, MIPSI_LW, tmp, RID_SP, 0);\r\n  else\r\n    ra_modified(as, tmp);\r\n  emit_tsi(as, MIPSI_SLTIU, RID_TMP, RID_TMP, (int32_t)(8*topslot));\r\n  emit_dst(as, MIPSI_SUBU, RID_TMP, tmp, pbase);\r\n  emit_tsi(as, MIPSI_LW, tmp, tmp, offsetof(lua_State, maxstack));\r\n  if (pbase == RID_TMP)\r\n    emit_getgl(as, RID_TMP, jit_base);\r\n  emit_getgl(as, tmp, jit_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_tsi(as, MIPSI_SW, tmp, RID_SP, 0);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_hsi(as, MIPSI_SDC1, src, RID_BASE, ofs);\r\n    } else {\r\n      Reg type;\r\n      RegSet allow = rset_exclude(RSET_GPR, RID_BASE);\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, allow);\r\n\trset_clear(allow, src);\r\n\temit_tsi(as, MIPSI_SW, src, RID_BASE, ofs+(LJ_BE?4:0));\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), allow);\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      }\r\n      emit_tsi(as, MIPSI_SW, type, RID_BASE, ofs+(LJ_BE?0:4));\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  /* Assumes asm_snap_prep() already done. */\r\n  asm_guard(as, MIPSI_BNE, RID_RET, RID_ZERO);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_branch(as, MIPSI_BNE, RID_TMP, RID_ZERO, l_end);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, RID_TMP, tmp);\r\n  emit_getgl(as, tmp, gc.threshold);\r\n  emit_getgl(as, RID_TMP, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  p[-1] = MIPSI_NOP;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guard already inverted the cond branch. Only patch the target. */\r\n    p[-3] |= ((target-p+2) & 0x0000ffffu);\r\n  } else {\r\n    p[-2] = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (as->loopinv) as->mctop--;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_move(as, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (as->loopinv) as->mctop--;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_move(as, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *target = lnk ? traceref(as->J,lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  int32_t spadj = as->T->spadjust;\r\n  MCode *p = as->mctop-1;\r\n  *p = spadj ? (MIPSI_ADDIU|MIPSF_T(RID_SP)|MIPSF_S(RID_SP)|spadj) : MIPSI_NOP;\r\n  p[-1] = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  as->mcp = as->mctop-2;  /* Leave room for branch plus nop or stack adj. */\r\n  as->invmcp = as->loopref ? as->mcp : NULL;\r\n}\r\n\r\n/* -- Instruction dispatch ------------------------------------------------ */\r\n\r\n/* Assemble a single instruction. */\r\nstatic void asm_ir(ASMState *as, IRIns *ir)\r\n{\r\n  switch ((IROp)ir->o) {\r\n  /* Miscellaneous ops. */\r\n  case IR_LOOP: asm_loop(as); break;\r\n  case IR_NOP: case IR_XBAR: lua_assert(!ra_used(ir)); break;\r\n  case IR_USE:\r\n    ra_alloc1(as, ir->op1, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR); break;\r\n  case IR_PHI: asm_phi(as, ir); break;\r\n  case IR_HIOP: asm_hiop(as, ir); break;\r\n  case IR_GCSTEP: asm_gcstep(as, ir); break;\r\n\r\n  /* Guarded assertions. */\r\n  case IR_EQ: case IR_NE: asm_compeq(as, ir); break;\r\n  case IR_LT: case IR_GE: case IR_LE: case IR_GT:\r\n  case IR_ULT: case IR_UGE: case IR_ULE: case IR_UGT:\r\n  case IR_ABC:\r\n    asm_comp(as, ir);\r\n    break;\r\n\r\n  case IR_RETF: asm_retf(as, ir); break;\r\n\r\n  /* Bit ops. */\r\n  case IR_BNOT: asm_bitnot(as, ir); break;\r\n  case IR_BSWAP: asm_bitswap(as, ir); break;\r\n\r\n  case IR_BAND: asm_bitop(as, ir, MIPSI_AND, MIPSI_ANDI); break;\r\n  case IR_BOR:  asm_bitop(as, ir, MIPSI_OR, MIPSI_ORI); break;\r\n  case IR_BXOR: asm_bitop(as, ir, MIPSI_XOR, MIPSI_XORI); break;\r\n\r\n  case IR_BSHL: asm_bitshift(as, ir, MIPSI_SLLV, MIPSI_SLL); break;\r\n  case IR_BSHR: asm_bitshift(as, ir, MIPSI_SRLV, MIPSI_SRL); break;\r\n  case IR_BSAR: asm_bitshift(as, ir, MIPSI_SRAV, MIPSI_SRA); break;\r\n  case IR_BROL: lua_assert(0); break;\r\n  case IR_BROR: asm_bitror(as, ir); break;\r\n\r\n  /* Arithmetic ops. */\r\n  case IR_ADD: asm_add(as, ir); break;\r\n  case IR_SUB: asm_sub(as, ir); break;\r\n  case IR_MUL: asm_mul(as, ir); break;\r\n  case IR_DIV: asm_fparith(as, ir, MIPSI_DIV_D); break;\r\n  case IR_MOD: asm_callid(as, ir, IRCALL_lj_vm_modi); break;\r\n  case IR_POW: asm_callid(as, ir, IRCALL_lj_vm_powi); break;\r\n  case IR_NEG: asm_neg(as, ir); break;\r\n\r\n  case IR_ABS: asm_fpunary(as, ir, MIPSI_ABS_D); break;\r\n  case IR_ATAN2: asm_callid(as, ir, IRCALL_atan2); break;\r\n  case IR_LDEXP: asm_callid(as, ir, IRCALL_ldexp); break;\r\n  case IR_MIN: asm_min_max(as, ir, 0); break;\r\n  case IR_MAX: asm_min_max(as, ir, 1); break;\r\n  case IR_FPMATH:\r\n    if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n      break;\r\n    if (ir->op2 <= IRFPM_TRUNC)\r\n      asm_callround(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n    else if (ir->op2 == IRFPM_SQRT)\r\n      asm_fpunary(as, ir, MIPSI_SQRT_D);\r\n    else\r\n      asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n    break;\r\n\r\n  /* Overflow-checking arithmetic ops. */\r\n  case IR_ADDOV: asm_arithov(as, ir); break;\r\n  case IR_SUBOV: asm_arithov(as, ir); break;\r\n  case IR_MULOV: asm_mulov(as, ir); break;\r\n\r\n  /* Memory references. */\r\n  case IR_AREF: asm_aref(as, ir); break;\r\n  case IR_HREF: asm_href(as, ir); break;\r\n  case IR_HREFK: asm_hrefk(as, ir); break;\r\n  case IR_NEWREF: asm_newref(as, ir); break;\r\n  case IR_UREFO: case IR_UREFC: asm_uref(as, ir); break;\r\n  case IR_FREF: asm_fref(as, ir); break;\r\n  case IR_STRREF: asm_strref(as, ir); break;\r\n\r\n  /* Loads and stores. */\r\n  case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n    asm_ahuvload(as, ir);\r\n    break;\r\n  case IR_FLOAD: asm_fload(as, ir); break;\r\n  case IR_XLOAD: asm_xload(as, ir); break;\r\n  case IR_SLOAD: asm_sload(as, ir); break;\r\n\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: asm_ahustore(as, ir); break;\r\n  case IR_FSTORE: asm_fstore(as, ir); break;\r\n  case IR_XSTORE: asm_xstore(as, ir, 0); break;\r\n\r\n  /* Allocations. */\r\n  case IR_SNEW: case IR_XSNEW: asm_snew(as, ir); break;\r\n  case IR_TNEW: asm_tnew(as, ir); break;\r\n  case IR_TDUP: asm_tdup(as, ir); break;\r\n  case IR_CNEW: case IR_CNEWI: asm_cnew(as, ir); break;\r\n\r\n  /* Write barriers. */\r\n  case IR_TBAR: asm_tbar(as, ir); break;\r\n  case IR_OBAR: asm_obar(as, ir); break;\r\n\r\n  /* Type conversions. */\r\n  case IR_CONV: asm_conv(as, ir); break;\r\n  case IR_TOBIT: asm_tobit(as, ir); break;\r\n  case IR_TOSTR: asm_tostr(as, ir); break;\r\n  case IR_STRTO: asm_strto(as, ir); break;\r\n\r\n  /* Calls. */\r\n  case IR_CALLN: case IR_CALLL: case IR_CALLS: asm_call(as, ir); break;\r\n  case IR_CALLXS: asm_callx(as, ir); break;\r\n  case IR_CARG: break;\r\n\r\n  default:\r\n    setintV(&as->J->errinfo, ir->o);\r\n    lj_trace_err_info(as->J, LJ_TRERR_NYIIR);\r\n    break;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = (int)CCI_NARGS(ci);\r\n  int nslots = 4, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++) {\r\n    if (args[i] && irt_isfp(IR(args[i])->t) &&\r\n\tnfpr > 0 && !(ci->flags & CCI_VARARG)) {\r\n      nfpr--;\r\n      ngpr -= irt_isnum(IR(args[i])->t) ? 2 : 1;\r\n    } else if (args[i] && irt_isnum(IR(args[i])->t)) {\r\n      nfpr = 0;\r\n      ngpr = ngpr & ~1;\r\n      if (ngpr > 0) ngpr -= 2; else nslots = (nslots+3) & ~1;\r\n    } else {\r\n      nfpr = 0;\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_sparejump_setup(as);\r\n  asm_exitstub_setup(as);\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *px = exitstub_trace_addr(T, exitno);\r\n  MCode *cstart = NULL, *cstop = NULL;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MCode exitload = MIPSI_LI | MIPSF_T(RID_TMP) | exitno;\r\n  MCode tjump = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n  for (p++; p < pe; p++) {\r\n    if (*p == exitload) {  /* Look for load of exit number. */\r\n      if (((p[-1] ^ (px-p)) & 0xffffu) == 0) {  /* Look for exitstub branch. */\r\n\tptrdiff_t delta = target - p;\r\n\tif (((delta + 0x8000) >> 16) == 0) {  /* Patch in-range branch. */\r\n\tpatchbranch:\r\n\t  p[-1] = (p[-1] & 0xffff0000u) | (delta & 0xffffu);\r\n\t  *p = MIPSI_NOP;  /* Replace the load of the exit number. */\r\n\t  cstop = p;\r\n\t  if (!cstart) cstart = p-1;\r\n\t} else {  /* Branch out of range. Use spare jump slot in mcarea. */\r\n\t  int i;\r\n\t  for (i = 2; i < 2+MIPS_SPAREJUMP*2; i += 2) {\r\n\t    if (mcarea[i] == tjump) {\r\n\t      delta = mcarea+i - p;\r\n\t      goto patchbranch;\r\n\t    } else if (mcarea[i] == MIPSI_NOP) {\r\n\t      mcarea[i] = tjump;\r\n\t      cstart = mcarea+i;\r\n\t      delta = mcarea+i - p;\r\n\t      goto patchbranch;\r\n\t    }\r\n\t  }\r\n\t  /* Ignore jump slot overflow. Child trace is simply not attached. */\r\n\t}\r\n      } else if (p+1 == pe) {\r\n\t/* Patch NOP after code for inverted loop branch. Use of J is ok. */\r\n\tlua_assert(p[1] == MIPSI_NOP);\r\n\tp[1] = tjump;\r\n\t*p = MIPSI_NOP;  /* Replace the load of the exit number. */\r\n\tcstop = p+2;\r\n\tif (!cstart) cstart = p+1;\r\n      }\r\n    }\r\n  }\r\n  if (cstart) lj_mcode_sync(cstart, cstop);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm_ppc.h",
    "content": "/*\r\n** PPC IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_allocref(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_allocref(as, ir->op2, allow);\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_allocref(as, ir->op1, allow);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Setup exit stubs after the end of each trace. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  MCode *mxp = as->mctop;\r\n  if (mxp - (nexits + 3 + MCLIM_REDZONE) < as->mclim)\r\n    asm_mclimit(as);\r\n  /* 1: mflr r0; bl ->vm_exit_handler; li r0, traceno; bl <1; bl <1; ... */\r\n  for (i = nexits-1; (int32_t)i >= 0; i--)\r\n    *--mxp = PPCI_BL|(((-3-i)&0x00ffffffu)<<2);\r\n  *--mxp = PPCI_LI|PPCF_T(RID_TMP)|as->T->traceno;  /* Read by exit handler. */\r\n  mxp--;\r\n  *mxp = PPCI_BL|((((MCode *)(void *)lj_vm_exit_handler-mxp)&0x00ffffffu)<<2);\r\n  *--mxp = PPCI_MFLR|PPCF_T(RID_TMP);\r\n  as->mctop = mxp;\r\n}\r\n\r\nstatic MCode *asm_exitstub_addr(ASMState *as, ExitNo exitno)\r\n{\r\n  /* Keep this in-sync with exitstub_trace_addr(). */\r\n  return as->mctop + exitno + 3;\r\n}\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guardcc(ASMState *as, PPCCC cc)\r\n{\r\n  MCode *target = asm_exitstub_addr(as, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *p = PPCI_B | (((target-p) & 0x00ffffffu) << 2);\r\n    emit_condbranch(as, PPCI_BC, cc^4, p);\r\n    return;\r\n  }\r\n  emit_condbranch(as, PPCI_BC, cc, target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Indicates load/store indexed is ok. */\r\n#define AHUREF_LSX\t((int32_t)0x80000000)\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (checki16(ofs)) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n\tif (*ofsp == AHUREF_LSX) {\r\n\t  Reg base = ra_alloc1(as, ir->op1, allow);\r\n\t  Reg idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n\t  return base | (idx << 8);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (checki16(ofs)) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\tint32_t jgl = (intptr_t)J2G(as->J);\r\n\tif ((uint32_t)(ofs-jgl) < 65536) {\r\n\t  *ofsp = ofs-jgl-32768;\r\n\t  return RID_JGL;\r\n\t} else {\r\n\t  *ofsp = (int16_t)ofs;\r\n\t  return ra_allock(as, ofs-(int16_t)ofs, allow);\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, PPCIns pi, Reg rt, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) && (ofs2 = ofs + IR(ir->op2)->i, checki16(ofs2))) {\r\n\tofs = ofs2;\r\n\tref = ir->op1;\r\n      } else if (ofs == 0) {\r\n\tReg right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\temit_fab(as, PPCI_LWZX | ((pi >> 20) & 0x780), rt, left, right);\r\n\treturn;\r\n      }\r\n    } else if (ir->o == IR_STRREF) {\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs += IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs += IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      } else {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg tmp, right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\ttmp = ra_scratch(as, rset_exclude(rset_exclude(allow, left), right));\r\n\temit_fai(as, pi, rt, tmp, ofs);\r\n\temit_tab(as, PPCI_ADD, tmp, left, right);\r\n\treturn;\r\n      }\r\n      if (!checki16(ofs)) {\r\n\tReg left = ra_alloc1(as, ref, allow);\r\n\tReg right = ra_allock(as, ofs, rset_exclude(allow, left));\r\n\temit_fab(as, PPCI_LWZX | ((pi >> 20) & 0x780), rt, left, right);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n  emit_fai(as, pi, rt, base, ofs);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into indexed-only load/store operand. */\r\nstatic void asm_fusexrefx(ASMState *as, PPCIns pi, Reg rt, IRRef ref,\r\n\t\t\t  RegSet allow)\r\n{\r\n  IRIns *ira = IR(ref);\r\n  Reg right, left;\r\n  if (canfuse(as, ira) && ira->o == IR_ADD && ra_noreg(ira->r)) {\r\n    left = ra_alloc2(as, ira, allow);\r\n    right = (left >> 8); left &= 255;\r\n  } else {\r\n    right = ra_alloc1(as, ref, allow);\r\n    left = RID_R0;\r\n  }\r\n  emit_tab(as, pi, rt, left, right);\r\n}\r\n\r\n/* Fuse to multiply-add/sub instruction. */\r\nstatic int asm_fusemadd(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pir)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  IRIns *irm;\r\n  if (lref != rref &&\r\n      ((mayfuse(as, lref) && (irm = IR(lref), irm->o == IR_MUL) &&\r\n\tra_noreg(irm->r)) ||\r\n       (mayfuse(as, rref) && (irm = IR(rref), irm->o == IR_MUL) &&\r\n\t(rref = lref, pi = pir, ra_noreg(irm->r))))) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg add = ra_alloc1(as, rref, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, irm, rset_exclude(RSET_FPR, add));\r\n    right = (left >> 8); left &= 255;\r\n    emit_facb(as, pi, dest, left, right, add);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_NARGS(ci);\r\n  int32_t ofs = 8;\r\n  Reg gpr = REGARG_FIRSTGPR, fpr = REGARG_FIRSTFPR;\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    if (ref) {\r\n      IRIns *ir = IR(ref);\r\n      if (irt_isfp(ir->t)) {\r\n\tif (fpr <= REGARG_LASTFPR) {\r\n\t  lua_assert(rset_test(as->freeset, fpr));  /* Already evicted. */\r\n\t  ra_leftov(as, fpr, ref);\r\n\t  fpr++;\r\n\t} else {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_FPR);\r\n\t  if (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += irt_isnum(ir->t) ? 8 : 4;\r\n\t}\r\n      } else {\r\n\tif (gpr <= REGARG_LASTGPR) {\r\n\t  lua_assert(rset_test(as->freeset, gpr));  /* Already evicted. */\r\n\t  ra_leftov(as, gpr, ref);\r\n\t  gpr++;\r\n\t} else {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_GPR);\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += 4;\r\n\t}\r\n      }\r\n    } else {\r\n      if (gpr <= REGARG_LASTGPR)\r\n\tgpr++;\r\n      else\r\n\tofs += 4;\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  if ((ci->flags & CCI_VARARG))  /* Vararg calls need to know about FPR use. */\r\n    emit_tab(as, fpr == REGARG_FIRSTFPR ? PPCI_CRXOR : PPCI_CREQV, 6, 6, 6);\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (irt_isfp(ir->t)) {\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\t/* Use spill slot or temp slots. */\r\n\tint32_t ofs = ir->s ? sps_scale(ir->s) : SPOFS_TMP;\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_fai(as, PPCI_LFD, dest, RID_SP, ofs);\r\n\t}\r\n\temit_tai(as, PPCI_STW, RID_RETHI, RID_SP, ofs);\r\n\temit_tai(as, PPCI_STW, RID_RETLO, RID_SP, ofs+4);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_call(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX];\r\n  const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n  asm_collectargs(as, ir, ci, args);\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(irf->i);\r\n  } else {  /* Need a non-argument register for indirect calls. */\r\n    RegSet allow = RSET_GPR & ~RSET_RANGE(RID_R0, REGARG_LASTGPR+1);\r\n    Reg freg = ra_alloc1(as, func, allow);\r\n    *--as->mcp = PPCI_BCTRL;\r\n    *--as->mcp = PPCI_MTCTR | PPCF_T(freg);\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\nstatic void asm_callid(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_ab(as, PPCI_CMPW, RID_TMP,\r\n\t  ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_tai(as, PPCI_LWZ, RID_TMP, base, -8);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, left));\r\n  Reg fbias = ra_scratch(as, rset_clear(allow, tmp));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg hibias = ra_allock(as, 0x43300000, rset_exclude(RSET_GPR, dest));\r\n  asm_guardcc(as, CC_NE);\r\n  emit_fab(as, PPCI_FCMPU, 0, tmp, left);\r\n  emit_fab(as, PPCI_FSUB, tmp, tmp, fbias);\r\n  emit_fai(as, PPCI_LFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_tai(as, PPCI_STW, RID_TMP, RID_SP, SPOFS_TMPLO);\r\n  emit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n  emit_asi(as, PPCI_XORIS, RID_TMP, dest, 0x8000);\r\n  emit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n  emit_lsptr(as, PPCI_LFS, (fbias & 31),\r\n\t     (void *)lj_ir_k64_find(as->J, U64x(59800004,59800000)),\r\n\t     RSET_GPR);\r\n  emit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  emit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n  emit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_fab(as, PPCI_FADD, tmp, left, right);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(irt_isint64(ir->t) ||\r\n\t       (st == IRT_I64 || st == IRT_U64))); /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      if (st == IRT_NUM)  /* double -> float conversion. */\r\n\temit_fb(as, PPCI_FRSP, dest, ra_alloc1(as, lref, RSET_FPR));\r\n      else  /* float -> double conversion is a no-op on PPC. */\r\n\tra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    } else {  /* Integer to FP conversion. */\r\n      /* IRT_INT: Flip hibit, bias with 2^52, subtract 2^52+2^31. */\r\n      /* IRT_U32: Bias with 2^52, subtract 2^52. */\r\n      RegSet allow = RSET_GPR;\r\n      Reg left = ra_alloc1(as, lref, allow);\r\n      Reg hibias = ra_allock(as, 0x43300000, rset_clear(allow, left));\r\n      Reg fbias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      const float *kbias;\r\n      if (irt_isfloat(ir->t)) emit_fb(as, PPCI_FRSP, dest, dest);\r\n      emit_fab(as, PPCI_FSUB, dest, dest, fbias);\r\n      emit_fai(as, PPCI_LFD, dest, RID_SP, SPOFS_TMP);\r\n      kbias = (const float *)lj_ir_k64_find(as->J, U64x(59800004,59800000));\r\n      if (st == IRT_U32) kbias++;\r\n      emit_lsptr(as, PPCI_LFS, (fbias & 31), (void *)kbias,\r\n\t\t rset_clear(allow, hibias));\r\n      emit_tai(as, PPCI_STW, st == IRT_U32 ? left : RID_TMP,\r\n\t       RID_SP, SPOFS_TMPLO);\r\n      emit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n      if (st != IRT_U32) emit_asi(as, PPCI_XORIS, RID_TMP, left, 0x8000);\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      if (irt_isu32(ir->t)) {\r\n\t/* Convert both x and x-2^31 to int and merge results. */\r\n\tReg tmpi = ra_scratch(as, rset_exclude(RSET_GPR, dest));\r\n\temit_asb(as, PPCI_OR, dest, dest, tmpi);  /* Select with mask idiom. */\r\n\temit_asb(as, PPCI_AND, tmpi, tmpi, RID_TMP);\r\n\temit_asb(as, PPCI_ANDC, dest, dest, RID_TMP);\r\n\temit_tai(as, PPCI_LWZ, tmpi, RID_SP, SPOFS_TMPLO);  /* tmp = (int)(x) */\r\n\temit_tai(as, PPCI_ADDIS, dest, dest, 0x8000);  /* dest += 2^31 */\r\n\temit_asb(as, PPCI_SRAWI, RID_TMP, dest, 31);  /* mask = -(dest < 0) */\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_tai(as, PPCI_LWZ, dest,\r\n\t\t RID_SP, SPOFS_TMPLO);  /* dest = (int)(x-2^31) */\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, tmp);\r\n\temit_fab(as, PPCI_FSUB, tmp, left, tmp);\r\n\temit_lsptr(as, PPCI_LFS, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(4f000000,00000000)),\r\n\t\t   RSET_GPR);\r\n      } else {\r\n\temit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n      }\r\n    }\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((ir->op2 & IRCONV_SEXT))\r\n\temit_as(as, st == IRT_I8 ? PPCI_EXTSB : PPCI_EXTSH, dest, left);\r\n      else\r\n\temit_rot(as, PPCI_RLWINM, dest, left, 0, st == IRT_U8 ? 24 : 16, 31);\r\n    } else {  /* 32/64 bit integer conversions. */\r\n      /* Only need to handle 32/32 bit no-op (cast) on 32 bit archs. */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_conv64(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  IRCallID id;\r\n  const CCallInfo *ci;\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = (ir-1)->op1;\r\n  if (st == IRT_NUM || st == IRT_FLOAT) {\r\n    id = IRCALL_fp64_d2l + ((st == IRT_FLOAT) ? 2 : 0) + (dt - IRT_I64);\r\n    ir--;\r\n  } else {\r\n    id = IRCALL_fp64_l2d + ((dt == IRT_FLOAT) ? 2 : 0) + (st - IRT_I64);\r\n  }\r\n  ci = &lj_ir_callinfo[id];\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n#endif\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  int32_t ofs;\r\n  RegSet drop = RSET_SCRATCH;\r\n  if (ra_hasreg(ir->r)) rset_set(drop, ir->r);  /* Spill dest reg (if any). */\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, CC_EQ);\r\n  emit_ai(as, PPCI_CMPWI, RID_RET, 0);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  ofs = ir->s ? sps_scale(ir->s) : SPOFS_TMP;\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_SP, ofs);\r\n}\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref))  /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    else  /* Otherwise force a spill and use the spill slot. */\r\n      emit_tai(as, PPCI_ADDI, dest, RID_SP, ra_spill(as, ir));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_tai(as, PPCI_ADDI, dest, RID_JGL, offsetof(global_State, tmptv)-32768);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_setgl(as, src, tmptv.gcr);\r\n    }\r\n    type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_setgl(as, type, tmptv.it);\r\n  }\r\n}\r\n\r\nstatic void asm_tostr(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;\r\n  as->gcsteps++;\r\n  if (irt_isnum(IR(ir->op1)->t) || (ir+1)->o == IR_HIOP) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromnum];\r\n    args[1] = ASMREF_TMP1;  /* const lua_Number * */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n    asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op1);\r\n  } else {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromint];\r\n    args[1] = ir->op1;  /* int32_t k */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n  }\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    ofs += 8*IR(ir->op2)->i;\r\n    if (checki16(ofs)) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_tai(as, PPCI_ADDI, dest, base, ofs);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_tab(as, PPCI_ADD, dest, RID_TMP, base);\r\n  emit_slwi(as, RID_TMP, idx, 3);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, tmp1 = RID_TMP, tmp2;\r\n  Reg tisnum = RID_NONE, tmpnum = RID_NONE;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  rset_clear(allow, tab);\r\n  if (irt_isnum(kt)) {\r\n    key = ra_alloc1(as, refkey, RSET_FPR);\r\n    tmpnum = ra_scratch(as, rset_exclude(RSET_FPR, key));\r\n    tisnum = ra_allock(as, (int32_t)LJ_TISNUM, allow);\r\n    rset_clear(allow, tisnum);\r\n  } else if (!irt_ispri(kt)) {\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  tmp2 = ra_scratch(as, allow);\r\n  rset_clear(allow, tmp2);\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  as->invmcp = NULL;\r\n  if (merge == IR_NE)\r\n    asm_guardcc(as, CC_EQ);\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = --as->mcp;\r\n  emit_ai(as, PPCI_CMPWI, dest, 0);\r\n  emit_tai(as, PPCI_LWZ, dest, dest, (int32_t)offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ)\r\n    asm_guardcc(as, CC_EQ);\r\n  else\r\n    emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  if (irt_isnum(kt)) {\r\n    emit_fab(as, PPCI_FCMPU, 0, tmpnum, key);\r\n    emit_condbranch(as, PPCI_BC, CC_GE, l_next);\r\n    emit_ab(as, PPCI_CMPLW, tmp1, tisnum);\r\n    emit_fai(as, PPCI_LFD, tmpnum, dest, (int32_t)offsetof(Node, key.n));\r\n  } else {\r\n    if (!irt_ispri(kt)) {\r\n      emit_ab(as, PPCI_CMPW, tmp2, key);\r\n      emit_condbranch(as, PPCI_BC, CC_NE, l_next);\r\n    }\r\n    emit_ai(as, PPCI_CMPWI, tmp1, irt_toitype(irkey->t));\r\n    if (!irt_ispri(kt))\r\n      emit_tai(as, PPCI_LWZ, tmp2, dest, (int32_t)offsetof(Node, key.gcr));\r\n  }\r\n  emit_tai(as, PPCI_LWZ, tmp1, dest, (int32_t)offsetof(Node, key.it));\r\n  *l_loop = PPCI_BC | PPCF_Y | PPCF_CC(CC_NE) |\r\n\t    (((char *)as->mcp-(char *)l_loop) & 0xffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_tai(as, PPCI_LWZ, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    Reg tmphash = tmp1;\r\n    if (irref_isk(refkey))\r\n      tmphash = ra_allock(as, khash, allow);\r\n    emit_tab(as, PPCI_ADD, dest, dest, tmp1);\r\n    emit_tai(as, PPCI_MULLI, tmp1, tmp1, sizeof(Node));\r\n    emit_asb(as, PPCI_AND, tmp1, tmp2, tmphash);\r\n    emit_tai(as, PPCI_LWZ, dest, tab, (int32_t)offsetof(GCtab, node));\r\n    emit_tai(as, PPCI_LWZ, tmp2, tab, (int32_t)offsetof(GCtab, hmask));\r\n    if (irref_isk(refkey)) {\r\n      /* Nothing to do. */\r\n    } else if (irt_isstr(kt)) {\r\n      emit_tai(as, PPCI_LWZ, tmp1, key, (int32_t)offsetof(GCstr, hash));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      emit_tab(as, PPCI_SUBF, tmp1, tmp2, tmp1);\r\n      emit_rotlwi(as, tmp2, tmp2, HASH_ROT3);\r\n      emit_asb(as, PPCI_XOR, tmp1, tmp1, tmp2);\r\n      emit_rotlwi(as, tmp1, tmp1, (HASH_ROT2+HASH_ROT1)&31);\r\n      emit_tab(as, PPCI_SUBF, tmp2, dest, tmp2);\r\n      if (irt_isnum(kt)) {\r\n\tint32_t ofs = ra_spill(as, irkey);\r\n\temit_asb(as, PPCI_XOR, tmp2, tmp2, tmp1);\r\n\temit_rotlwi(as, dest, tmp1, HASH_ROT1);\r\n\temit_tab(as, PPCI_ADD, tmp1, tmp1, tmp1);\r\n\temit_tai(as, PPCI_LWZ, tmp2, RID_SP, ofs+4);\r\n\temit_tai(as, PPCI_LWZ, tmp1, RID_SP, ofs);\r\n      } else {\r\n\temit_asb(as, PPCI_XOR, tmp2, key, tmp1);\r\n\temit_rotlwi(as, dest, tmp1, HASH_ROT1);\r\n\temit_tai(as, PPCI_ADDI, tmp1, tmp2, HASH_BIAS);\r\n\temit_tai(as, PPCI_ADDIS, tmp2, key, (HASH_BIAS + 32768)>>16);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir)||ofs > 32736) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 32736) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_tai(as, PPCI_ADDI, dest, node, ofs);\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n  if (!irt_ispri(irkey->t)) {\r\n    key = ra_scratch(as, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  rset_clear(allow, type);\r\n  if (irt_isnum(irkey->t)) {\r\n    emit_cmpi(as, key, (int32_t)ir_knum(irkey)->u32.lo);\r\n    asm_guardcc(as, CC_NE);\r\n    emit_cmpi(as, type, (int32_t)ir_knum(irkey)->u32.hi);\r\n  } else {\r\n    if (ra_hasreg(key)) {\r\n      emit_cmpi(as, key, irkey->i);  /* May use RID_TMP, i.e. type. */\r\n      asm_guardcc(as, CC_NE);\r\n    }\r\n    emit_ai(as, PPCI_CMPWI, type, irt_toitype(irkey->t));\r\n  }\r\n  if (ra_hasreg(key)) emit_tai(as, PPCI_LWZ, key, idx, kofs+4);\r\n  emit_tai(as, PPCI_LWZ, type, idx, kofs);\r\n  if (ofs > 32736) {\r\n    emit_tai(as, PPCI_ADDIS, dest, dest, (ofs + 32768) >> 16);\r\n    emit_tai(as, PPCI_ADDI, dest, node, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_newref(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_newkey];\r\n  IRRef args[3];\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ir->op1;      /* GCtab *t     */\r\n  args[2] = ASMREF_TMP1;  /* cTValue *key */\r\n  asm_setupresult(as, ir, ci);  /* TValue * */\r\n  asm_gencall(as, ci, args);\r\n  asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op2);\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, PPCI_LWZ, dest, v, RSET_GPR);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_ai(as, PPCI_CMPWI, RID_TMP, 1);\r\n      emit_tai(as, PPCI_ADDI, dest, uv, (int32_t)offsetof(GCupval, tv));\r\n      emit_tai(as, PPCI_LBZ, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_tai(as, PPCI_LWZ, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_tai(as, PPCI_LWZ, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  int32_t ofs = (int32_t)sizeof(GCstr);\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       checki16(ofs + IR(irr->op2)->i)) {\r\n      ofs += IR(irr->op2)->i;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_tai(as, PPCI_ADDI, dest, dest, ofs);\r\n    emit_tab(as, PPCI_ADD, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  ofs += IR(refk)->i;\r\n  if (checki16(ofs))\r\n    emit_tai(as, PPCI_ADDI, dest, r, ofs);\r\n  else\r\n    emit_tab(as, PPCI_ADD, dest, r,\r\n\t     ra_allock(as, ofs, rset_exclude(RSET_GPR, r)));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic PPCIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return PPCI_LBZ;  /* Needs sign-extension. */\r\n  case IRT_U8: return PPCI_LBZ;\r\n  case IRT_I16: return PPCI_LHA;\r\n  case IRT_U16: return PPCI_LHZ;\r\n  case IRT_NUM: return PPCI_LFD;\r\n  case IRT_FLOAT: return PPCI_LFS;\r\n  default: return PPCI_LWZ;\r\n  }\r\n}\r\n\r\nstatic PPCIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return PPCI_STB;\r\n  case IRT_I16: case IRT_U16: return PPCI_STH;\r\n  case IRT_NUM: return PPCI_STFD;\r\n  case IRT_FLOAT: return PPCI_STFS;\r\n  default: return PPCI_STW;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  PPCIns pi = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_tai(as, PPCI_ADDI, dest, idx, ofs);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  lua_assert(!irt_isi8(ir->t));\r\n  emit_tai(as, pi, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    PPCIns pi = asm_fxstoreins(ir);\r\n    emit_tai(as, pi, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  if (irt_isi8(ir->t))\r\n    emit_as(as, PPCI_EXTSB, dest, dest);\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  IRIns *irb;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (ofs == 0 && mayfuse(as, ir->op2) && (irb = IR(ir->op2))->o == IR_BSWAP &&\r\n      ra_noreg(irb->r) && (irt_isint(ir->t) || irt_isu32(ir->t))) {\r\n    /* Fuse BSWAP with XSTORE to stwbrx. */\r\n    Reg src = ra_alloc1(as, irb->op1, RSET_GPR);\r\n    asm_fusexrefx(as, PPCI_STWBRX, src, ir->op1, rset_exclude(RSET_GPR, src));\r\n  } else {\r\n    Reg src = ra_alloc1(as, ir->op2, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_TMP, tmp = RID_TMP, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = AHUREF_LSX;\r\n  if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    if (!irt_isnum(t)) ofs = 0;\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(t)) {\r\n    Reg tisnum = ra_allock(as, (int32_t)LJ_TISNUM, rset_exclude(allow, idx));\r\n    asm_guardcc(as, CC_GE);\r\n    emit_ab(as, PPCI_CMPLW, type, tisnum);\r\n    if (ra_hasreg(dest)) {\r\n      if (ofs == AHUREF_LSX) {\r\n\ttmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR,\r\n\t\t\t\t\t\t       (idx&255)), (idx>>8)));\r\n\temit_fab(as, PPCI_LFDX, dest, (idx&255), tmp);\r\n      } else {\r\n\temit_fai(as, PPCI_LFD, dest, idx, ofs);\r\n      }\r\n    }\r\n  } else {\r\n    asm_guardcc(as, CC_NE);\r\n    emit_ai(as, PPCI_CMPWI, type, irt_toitype(t));\r\n    if (ra_hasreg(dest)) emit_tai(as, PPCI_LWZ, dest, idx, ofs+4);\r\n  }\r\n  if (ofs == AHUREF_LSX) {\r\n    emit_tab(as, PPCI_LWZX, type, (idx&255), tmp);\r\n    emit_slwi(as, tmp, (idx>>8), 3);\r\n  } else {\r\n    emit_tai(as, PPCI_LWZ, type, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg idx, src = RID_NONE, type = RID_NONE;\r\n  int32_t ofs = AHUREF_LSX;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n  } else {\r\n    if (!irt_ispri(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n      ofs = 0;\r\n    }\r\n    type = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(ir->t)) {\r\n    if (ofs == AHUREF_LSX) {\r\n      emit_fab(as, PPCI_STFDX, src, (idx&255), RID_TMP);\r\n      emit_slwi(as, RID_TMP, (idx>>8), 3);\r\n    } else {\r\n      emit_fai(as, PPCI_STFD, src, idx, ofs);\r\n    }\r\n  } else {\r\n    if (ra_hasreg(src))\r\n      emit_tai(as, PPCI_STW, src, idx, ofs+4);\r\n    if (ofs == AHUREF_LSX) {\r\n      emit_tab(as, PPCI_STWX, type, (idx&255), RID_TMP);\r\n      emit_slwi(as, RID_TMP, (idx>>8), 3);\r\n    } else {\r\n      emit_tai(as, PPCI_STW, type, idx, ofs);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 0 : 4);\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(LJ_DUALNUM ||\r\n\t     !irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    rset_clear(allow, base);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (irt_isint(t)) {\r\n\temit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n\tdest = ra_scratch(as, RSET_FPR);\r\n\temit_fai(as, PPCI_STFD, dest, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, dest, dest);\r\n\tt.irt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\tReg tmp = ra_scratch(as, allow);\r\n\tReg hibias = ra_allock(as, 0x43300000, rset_clear(allow, tmp));\r\n\tReg fbias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n\temit_fab(as, PPCI_FSUB, dest, dest, fbias);\r\n\temit_fai(as, PPCI_LFD, dest, RID_SP, SPOFS_TMP);\r\n\temit_lsptr(as, PPCI_LFS, (fbias & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(59800004,59800000)),\r\n\t\t   rset_clear(allow, hibias));\r\n\temit_tai(as, PPCI_STW, tmp, RID_SP, SPOFS_TMPLO);\r\n\temit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n\temit_asi(as, PPCI_XORIS, tmp, tmp, 0x8000);\r\n\tdest = tmp;\r\n\tt.irt = IRT_INT;  /* Check for original type. */\r\n      }\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\n  rset_clear(allow, base);\r\ndotypecheck:\r\n  if (irt_isnum(t)) {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      Reg tisnum = ra_allock(as, (int32_t)LJ_TISNUM, allow);\r\n      asm_guardcc(as, CC_GE);\r\n      emit_ab(as, PPCI_CMPLW, RID_TMP, tisnum);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_fai(as, PPCI_LFD, dest, base, ofs-4);\r\n  } else {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_ai(as, PPCI_CMPWI, RID_TMP, irt_toitype(t));\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_tai(as, PPCI_LWZ, dest, base, ofs);\r\n  }\r\n  if (ra_hasreg(type)) emit_tai(as, PPCI_LWZ, type, base, ofs-4);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID ctypeid = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz = (ir->o == IR_CNEWI || ir->op2 == REF_NIL) ?\r\n\t      lj_ctype_size(cts, ctypeid) : (CTSize)IR(ir->op2)->i;\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[2];\r\n  RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID);\r\n\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  as->gcsteps++;\r\n\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4;\r\n      lua_assert((ir+1)->o == IR_HIOP);\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_tai(as, PPCI_STW, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir++;\r\n    }\r\n  }\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  emit_tai(as, PPCI_STB, RID_RET+1, RID_RET, offsetof(GCcdata, gct));\r\n  emit_tai(as, PPCI_STH, RID_TMP, RID_RET, offsetof(GCcdata, ctypeid));\r\n  emit_ti(as, PPCI_LI, RID_RET+1, ~LJ_TCDATA);\r\n  emit_ti(as, PPCI_LI, RID_TMP, ctypeid);  /* Lower 16 bit used. Sign-ext ok. */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg mark = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg link = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_tai(as, PPCI_STW, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_tai(as, PPCI_STB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  lua_assert(LJ_GC_BLACK == 0x04);\r\n  emit_rot(as, PPCI_RLWINM, mark, mark, 0, 30, 28);  /* Clear black bit. */\r\n  emit_getgl(as, link, gc.grayagain);\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, RID_TMP, mark, LJ_GC_BLACK);\r\n  emit_tai(as, PPCI_LBZ, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, tmp, tmp, LJ_GC_BLACK);\r\n  emit_condbranch(as, PPCI_BC, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, RID_TMP, RID_TMP, LJ_GC_WHITES);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_tai(as, PPCI_LBZ, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_tai(as, PPCI_LBZ, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (pi == PPCI_FMUL)\r\n    emit_fac(as, pi, dest, left, right);\r\n  else\r\n    emit_fab(as, pi, dest, left, right);\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_fb(as, pi, dest, left);\r\n}\r\n\r\nstatic int asm_fpjoin_pow(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irp = IR(ir->op1);\r\n  if (irp == ir-1 && irp->o == IR_MUL && !ra_used(irp)) {\r\n    IRIns *irpp = IR(irp->op1);\r\n    if (irpp == ir-2 && irpp->o == IR_FPMATH &&\r\n\tirpp->op2 == IRFPM_LOG2 && !ra_used(irpp)) {\r\n      const CCallInfo *ci = &lj_ir_callinfo[IRCALL_pow];\r\n      IRRef args[2];\r\n      args[0] = irpp->op1;\r\n      args[1] = irp->op2;\r\n      asm_setupresult(as, ir, ci);\r\n      asm_gencall(as, ci, args);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, PPCI_FMADD, PPCI_FMADD))\r\n      asm_fparith(as, ir, PPCI_FADD);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    PPCIns pi;\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\tpi = PPCI_ADDI;\r\n\t/* May fail due to spills/restores above, but simplifies the logic. */\r\n\tif (as->flagmcp == as->mcp) {\r\n\t  as->flagmcp = NULL;\r\n\t  as->mcp++;\r\n\t  pi = PPCI_ADDICDOT;\r\n\t}\r\n\temit_tai(as, pi, dest, left, k);\r\n\treturn;\r\n      } else if ((k & 0xffff) == 0) {\r\n\temit_tai(as, PPCI_ADDIS, dest, left, (k >> 16));\r\n\treturn;\r\n      } else if (!as->sectref) {\r\n\temit_tai(as, PPCI_ADDIS, dest, dest, (k + 32768) >> 16);\r\n\temit_tai(as, PPCI_ADDI, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    pi = PPCI_ADD;\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, PPCI_FMSUB, PPCI_FNMSUB))\r\n      asm_fparith(as, ir, PPCI_FSUB);\r\n  } else {\r\n    PPCIns pi = PPCI_SUBF;\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left, right;\r\n    if (irref_isk(ir->op1)) {\r\n      int32_t k = IR(ir->op1)->i;\r\n      if (checki16(k)) {\r\n\tright = ra_alloc1(as, ir->op2, RSET_GPR);\r\n\temit_tai(as, PPCI_SUBFIC, dest, right, k);\r\n\treturn;\r\n      }\r\n    }\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, right, left);  /* Subtract right _from_ left. */\r\n  }\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, PPCI_FMUL);\r\n  } else {\r\n    PPCIns pi = PPCI_MULLW;\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\temit_tai(as, PPCI_MULLI, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, PPCI_FNEG);\r\n  } else {\r\n    Reg dest, left;\r\n    PPCIns pi = PPCI_NEG;\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    dest = ra_dest(as, ir, RSET_GPR);\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    emit_tab(as, pi, dest, left, 0);\r\n  }\r\n}\r\n\r\nstatic void asm_arithov(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest, left, right;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n  }\r\n  asm_guardcc(as, CC_SO);\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (pi == PPCI_SUBFO) { Reg tmp = left; left = right; right = tmp; }\r\n  emit_tab(as, pi|PPCF_DOT, dest, left, right);\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_add64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  PPCIns pi = PPCI_ADDE;\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0)\r\n      pi = PPCI_ADDZE;\r\n    else if (k == -1)\r\n      pi = PPCI_ADDME;\r\n    else\r\n      goto needright;\r\n    right = 0;\r\n  } else {\r\n  needright:\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  }\r\n  emit_tab(as, pi, dest, left, right);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (checki16(k)) {\r\n      emit_tai(as, PPCI_ADDIC, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_tab(as, PPCI_ADDC, dest, left, right);\r\n}\r\n\r\nstatic void asm_sub64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left, right = ra_alloc1(as, ir->op2, RSET_GPR);\r\n  PPCIns pi = PPCI_SUBFE;\r\n  if (irref_isk(ir->op1)) {\r\n    int32_t k = IR(ir->op1)->i;\r\n    if (k == 0)\r\n      pi = PPCI_SUBFZE;\r\n    else if (k == -1)\r\n      pi = PPCI_SUBFME;\r\n    else\r\n      goto needleft;\r\n    left = 0;\r\n  } else {\r\n  needleft:\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, right));\r\n  }\r\n  emit_tab(as, pi, dest, right, left);  /* Subtract right _from_ left. */\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  right = ra_alloc1(as, ir->op2, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    int32_t k = IR(ir->op1)->i;\r\n    if (checki16(k)) {\r\n      emit_tai(as, PPCI_SUBFIC, dest, right, k);\r\n      return;\r\n    }\r\n  }\r\n  left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, right));\r\n  emit_tab(as, PPCI_SUBFC, dest, right, left);\r\n}\r\n\r\nstatic void asm_neg64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_tab(as, PPCI_SUBFZE, dest, left, 0);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_tai(as, PPCI_SUBFIC, dest, left, 0);\r\n}\r\n#endif\r\n\r\nstatic void asm_bitnot(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest, left, right;\r\n  PPCIns pi = PPCI_NOR;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    pi |= PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  if (mayfuse(as, ir->op1)) {\r\n    IRIns *irl = IR(ir->op1);\r\n    if (irl->o == IR_BAND)\r\n      pi ^= (PPCI_NOR ^ PPCI_NAND);\r\n    else if (irl->o == IR_BXOR)\r\n      pi ^= (PPCI_NOR ^ PPCI_EQV);\r\n    else if (irl->o != IR_BOR)\r\n      goto nofuse;\r\n    left = ra_hintalloc(as, irl->op1, dest, RSET_GPR);\r\n    right = ra_alloc1(as, irl->op2, rset_exclude(RSET_GPR, left));\r\n  } else {\r\nnofuse:\r\n    left = right = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  }\r\n  emit_asb(as, pi, dest, left, right);\r\n}\r\n\r\nstatic void asm_bitswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRIns *irx;\r\n  if (mayfuse(as, ir->op1) && (irx = IR(ir->op1))->o == IR_XLOAD &&\r\n      ra_noreg(irx->r) && (irt_isint(irx->t) || irt_isu32(irx->t))) {\r\n    /* Fuse BSWAP with XLOAD to lwbrx. */\r\n    asm_fusexrefx(as, PPCI_LWBRX, dest, irx->op1, RSET_GPR);\r\n  } else {\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    Reg tmp = dest;\r\n    if (tmp == left) {\r\n      tmp = RID_TMP;\r\n      emit_mr(as, dest, RID_TMP);\r\n    }\r\n    emit_rot(as, PPCI_RLWIMI, tmp, left, 24, 16, 23);\r\n    emit_rot(as, PPCI_RLWIMI, tmp, left, 24, 0, 7);\r\n    emit_rotlwi(as, tmp, left, 8);\r\n  }\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    Reg tmp = left;\r\n    if ((checku16(k) || (k & 0xffff) == 0) || (tmp = dest, !as->sectref)) {\r\n      if (!checku16(k)) {\r\n\temit_asi(as, pik ^ (PPCI_ORI ^ PPCI_ORIS), dest, tmp, (k >> 16));\r\n\tif ((k & 0xffff) == 0) return;\r\n      }\r\n      emit_asi(as, pik, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  /* May fail due to spills/restores above, but simplifies the logic. */\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    pi |= PPCF_DOT;\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_asb(as, pi, dest, left, right);\r\n}\r\n\r\n/* Fuse BAND with contiguous bitmask and a shift to rlwinm. */\r\nstatic void asm_fuseandsh(ASMState *as, PPCIns pi, int32_t mask, IRRef ref)\r\n{\r\n  IRIns *ir;\r\n  Reg left;\r\n  if (mayfuse(as, ref) && (ir = IR(ref), ra_noreg(ir->r)) &&\r\n      irref_isk(ir->op2) && ir->o >= IR_BSHL && ir->o <= IR_BROR) {\r\n    int32_t sh = (IR(ir->op2)->i & 31);\r\n    switch (ir->o) {\r\n    case IR_BSHL:\r\n      if ((mask & ((1u<<sh)-1))) goto nofuse;\r\n      break;\r\n    case IR_BSHR:\r\n      if ((mask & ~((~0u)>>sh))) goto nofuse;\r\n      sh = ((32-sh)&31);\r\n      break;\r\n    case IR_BROL:\r\n      break;\r\n    default:\r\n      goto nofuse;\r\n    }\r\n    left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    *--as->mcp = pi | PPCF_T(left) | PPCF_B(sh);\r\n    return;\r\n  }\r\nnofuse:\r\n  left = ra_alloc1(as, ref, RSET_GPR);\r\n  *--as->mcp = pi | PPCF_T(left);\r\n}\r\n\r\nstatic void asm_bitand(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest, left, right;\r\n  IRRef lref = ir->op1;\r\n  PPCIns dot = 0;\r\n  IRRef op2;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    dot = PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k) {\r\n      /* First check for a contiguous bitmask as used by rlwinm. */\r\n      uint32_t s1 = lj_ffs((uint32_t)k);\r\n      uint32_t k1 = ((uint32_t)k >> s1);\r\n      if ((k1 & (k1+1)) == 0) {\r\n\tasm_fuseandsh(as, PPCI_RLWINM|dot | PPCF_A(dest) |\r\n\t\t\t  PPCF_MB(31-lj_fls((uint32_t)k)) | PPCF_ME(31-s1),\r\n\t\t\t  k, lref);\r\n\treturn;\r\n      }\r\n      if (~(uint32_t)k) {\r\n\tuint32_t s2 = lj_ffs(~(uint32_t)k);\r\n\tuint32_t k2 = (~(uint32_t)k >> s2);\r\n\tif ((k2 & (k2+1)) == 0) {\r\n\t  asm_fuseandsh(as, PPCI_RLWINM|dot | PPCF_A(dest) |\r\n\t\t\t    PPCF_MB(32-s2) | PPCF_ME(30-lj_fls(~(uint32_t)k)),\r\n\t\t\t    k, lref);\r\n\t  return;\r\n\t}\r\n      }\r\n    }\r\n    if (checku16(k)) {\r\n      left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_asi(as, PPCI_ANDIDOT, dest, left, k);\r\n      return;\r\n    } else if ((k & 0xffff) == 0) {\r\n      left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_asi(as, PPCI_ANDISDOT, dest, left, (k >> 16));\r\n      return;\r\n    }\r\n  }\r\n  op2 = ir->op2;\r\n  if (mayfuse(as, op2) && IR(op2)->o == IR_BNOT && ra_noreg(IR(op2)->r)) {\r\n    dot ^= (PPCI_AND ^ PPCI_ANDC);\r\n    op2 = IR(op2)->op1;\r\n  }\r\n  left = ra_hintalloc(as, lref, dest, RSET_GPR);\r\n  right = ra_alloc1(as, op2, rset_exclude(RSET_GPR, left));\r\n  emit_asb(as, PPCI_AND ^ dot, dest, left, right);\r\n}\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pik)\r\n{\r\n  Reg dest, left;\r\n  Reg dot = 0;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    dot = PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    int32_t shift = (IR(ir->op2)->i & 31);\r\n    if (pik == 0)  /* SLWI */\r\n      emit_rot(as, PPCI_RLWINM|dot, dest, left, shift, 0, 31-shift);\r\n    else if (pik == 1)  /* SRWI */\r\n      emit_rot(as, PPCI_RLWINM|dot, dest, left, (32-shift)&31, shift, 31);\r\n    else\r\n      emit_asb(as, pik|dot, dest, left, shift);\r\n  } else {\r\n    Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_asb(as, pi|dot, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int ismax)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg tmp = dest;\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (tmp == left || tmp == right)\r\n      tmp = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_FPR,\r\n\t\t\t\t\tdest), left), right));\r\n    emit_facb(as, PPCI_FSEL, dest, tmp,\r\n\t      ismax ? left : right, ismax ? right : left);\r\n    emit_fab(as, PPCI_FSUB, tmp, left, right);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg tmp1 = RID_TMP, tmp2 = dest;\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (tmp2 == left || tmp2 == right)\r\n      tmp2 = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_GPR,\r\n\t\t\t\t\t dest), left), right));\r\n    emit_tab(as, PPCI_ADD, dest, tmp2, right);\r\n    emit_asb(as, ismax ? PPCI_ANDC : PPCI_AND, tmp2, tmp2, tmp1);\r\n    emit_tab(as, PPCI_SUBFE, tmp1, tmp1, tmp1);\r\n    emit_tab(as, PPCI_SUBFC, tmp2, tmp2, tmp1);\r\n    emit_asi(as, PPCI_XORIS, tmp2, right, 0x8000);\r\n    emit_asi(as, PPCI_XORIS, tmp1, left, 0x8000);\r\n  }\r\n}\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n#define CC_UNSIGNED\t0x08\t/* Unsigned integer comparison. */\r\n#define CC_TWO\t\t0x80\t/* Check two flags for FP comparison. */\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\nstatic const uint8_t asm_compmap[IR_ABC+1] = {\r\n  /* op     int cc                 FP cc */\r\n  /* LT  */ CC_GE               + (CC_GE<<4),\r\n  /* GE  */ CC_LT               + (CC_LE<<4) + CC_TWO,\r\n  /* LE  */ CC_GT               + (CC_GE<<4) + CC_TWO,\r\n  /* GT  */ CC_LE               + (CC_LE<<4),\r\n  /* ULT */ CC_GE + CC_UNSIGNED + (CC_GT<<4) + CC_TWO,\r\n  /* UGE */ CC_LT + CC_UNSIGNED + (CC_LT<<4),\r\n  /* ULE */ CC_GT + CC_UNSIGNED + (CC_GT<<4),\r\n  /* UGT */ CC_LE + CC_UNSIGNED + (CC_LT<<4) + CC_TWO,\r\n  /* EQ  */ CC_NE               + (CC_NE<<4),\r\n  /* NE  */ CC_EQ               + (CC_EQ<<4),\r\n  /* ABC */ CC_LE + CC_UNSIGNED + (CC_LT<<4) + CC_TWO  /* Same as UGT. */\r\n};\r\n\r\nstatic void asm_intcomp_(ASMState *as, IRRef lref, IRRef rref, Reg cr, PPCCC cc)\r\n{\r\n  Reg right, left = ra_alloc1(as, lref, RSET_GPR);\r\n  if (irref_isk(rref)) {\r\n    int32_t k = IR(rref)->i;\r\n    if ((cc & CC_UNSIGNED) == 0) {  /* Signed comparison with constant. */\r\n      if (checki16(k)) {\r\n\temit_tai(as, PPCI_CMPWI, cr, left, k);\r\n\t/* Signed comparison with zero and referencing previous ins? */\r\n\tif (k == 0 && lref == as->curins-1)\r\n\t  as->flagmcp = as->mcp;  /* Allow elimination of the compare. */\r\n\treturn;\r\n      } else if ((cc & 3) == (CC_EQ & 3)) {  /* Use CMPLWI for EQ or NE. */\r\n\tif (checku16(k)) {\r\n\t  emit_tai(as, PPCI_CMPLWI, cr, left, k);\r\n\t  return;\r\n\t} else if (!as->sectref && ra_noreg(IR(rref)->r)) {\r\n\t  emit_tai(as, PPCI_CMPLWI, cr, RID_TMP, k);\r\n\t  emit_asi(as, PPCI_XORIS, RID_TMP, left, (k >> 16));\r\n\t  return;\r\n\t}\r\n      }\r\n    } else {  /* Unsigned comparison with constant. */\r\n      if (checku16(k)) {\r\n\temit_tai(as, PPCI_CMPLWI, cr, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  right = ra_alloc1(as, rref, rset_exclude(RSET_GPR, left));\r\n  emit_tab(as, (cc & CC_UNSIGNED) ? PPCI_CMPLW : PPCI_CMPW, cr, left, right);\r\n}\r\n\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n  PPCCC cc = asm_compmap[ir->o];\r\n  if (irt_isnum(ir->t)) {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    asm_guardcc(as, (cc >> 4));\r\n    if ((cc & CC_TWO))\r\n      emit_tab(as, PPCI_CROR, ((cc>>4)&3), ((cc>>4)&3), (CC_EQ&3));\r\n    emit_fab(as, PPCI_FCMPU, 0, left, right);\r\n  } else {\r\n    IRRef lref = ir->op1, rref = ir->op2;\r\n    if (irref_isk(lref) && !irref_isk(rref)) {\r\n      /* Swap constants to the right (only for ABC). */\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n      if ((cc & 2) == 0) cc ^= 1;  /* LT <-> GT, LE <-> GE */\r\n    }\r\n    asm_guardcc(as, cc);\r\n    asm_intcomp_(as, lref, rref, 0, cc);\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_comp64(ASMState *as, IRIns *ir)\r\n{\r\n  PPCCC cc = asm_compmap[(ir-1)->o];\r\n  if ((cc&3) == (CC_EQ&3)) {\r\n    asm_guardcc(as, cc);\r\n    emit_tab(as, (cc&4) ? PPCI_CRAND : PPCI_CROR,\r\n\t     (CC_EQ&3), (CC_EQ&3), 4+(CC_EQ&3));\r\n  } else {\r\n    asm_guardcc(as, CC_EQ);\r\n    emit_tab(as, PPCI_CROR, (CC_EQ&3), (CC_EQ&3), ((cc^~(cc>>2))&1));\r\n    emit_tab(as, (cc&4) ? PPCI_CRAND : PPCI_CRANDC,\r\n\t     (CC_EQ&3), (CC_EQ&3), 4+(cc&3));\r\n  }\r\n  /* Loword comparison sets cr1 and is unsigned, except for equality. */\r\n  asm_intcomp_(as, (ir-1)->op1, (ir-1)->op2, 4,\r\n\t       cc | ((cc&3) == (CC_EQ&3) ? 0 : CC_UNSIGNED));\r\n  /* Hiword comparison sets cr0. */\r\n  asm_intcomp_(as, ir->op1, ir->op2, 0, cc);\r\n  as->flagmcp = NULL;  /* Doesn't work here. */\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    as->curins--;  /* Handle both stores here. */\r\n    if ((ir-1)->r != RID_SINK) {\r\n      asm_xstore(as, ir, 0);\r\n      asm_xstore(as, ir-1, 4);\r\n    }\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD: as->curins--; asm_add64(as, ir); break;\r\n  case IR_SUB: as->curins--; asm_sub64(as, ir); break;\r\n  case IR_NEG: as->curins--; asm_neg64(as, ir); break;\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore RID_RET*. */\r\n  Reg tmp, pbase = irp ? (ra_hasreg(irp->r) ? irp->r : RID_TMP) : RID_BASE;\r\n  rset_clear(allow, pbase);\r\n  tmp = allow ? rset_pickbot(allow) :\r\n\t\t(pbase == RID_RETHI ? RID_RETLO : RID_RETHI);\r\n  emit_condbranch(as, PPCI_BC, CC_LT, asm_exitstub_addr(as, exitno));\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_tai(as, PPCI_LWZ, tmp, RID_SP, SPOFS_TMPW);\r\n  else\r\n    ra_modified(as, tmp);\r\n  emit_ai(as, PPCI_CMPLWI, RID_TMP, (int32_t)(8*topslot));\r\n  emit_tab(as, PPCI_SUBF, RID_TMP, pbase, tmp);\r\n  emit_tai(as, PPCI_LWZ, tmp, tmp, offsetof(lua_State, maxstack));\r\n  if (pbase == RID_TMP)\r\n    emit_getgl(as, RID_TMP, jit_base);\r\n  emit_getgl(as, tmp, jit_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_tai(as, PPCI_STW, tmp, RID_SP, SPOFS_TMPW);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_fai(as, PPCI_STFD, src, RID_BASE, ofs);\r\n    } else {\r\n      Reg type;\r\n      RegSet allow = rset_exclude(RSET_GPR, RID_BASE);\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, allow);\r\n\trset_clear(allow, src);\r\n\temit_tai(as, PPCI_STW, src, RID_BASE, ofs+4);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), allow);\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      }\r\n      emit_tai(as, PPCI_STW, type, RID_BASE, ofs);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_ai(as, PPCI_CMPWI, RID_RET, 0);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_LT, l_end);\r\n  emit_ab(as, PPCI_CMPLW, RID_TMP, tmp);\r\n  emit_getgl(as, tmp, gc.threshold);\r\n  emit_getgl(as, RID_TMP, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guardcc already inverted the cond branch and patched the final b. */\r\n    p[-2] = (p[-2] & (0xffff0000u & ~PPCF_Y)) | (((target-p+2) & 0x3fffu) << 2);\r\n  } else {\r\n    p[-1] = PPCI_B|(((target-p+1)&0x00ffffffu)<<2);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_mr(as, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_mr(as, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    *--p = PPCI_NOP;\r\n    *--p = PPCI_NOP;\r\n    as->mctop = p;\r\n  } else {\r\n    /* Patch stack adjustment. */\r\n    lua_assert(checki16(CFRAME_SIZE+spadj));\r\n    p[-3] = PPCI_ADDI | PPCF_T(RID_TMP) | PPCF_A(RID_SP) | (CFRAME_SIZE+spadj);\r\n    p[-2] = PPCI_STWU | PPCF_T(RID_TMP) | PPCF_A(RID_SP) | spadj;\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  p[-1] = PPCI_B|(((target-p+1)&0x00ffffffu)<<2);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop - 1;  /* Leave room for exit branch. */\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    as->mcp = p-2;  /* Leave room for stack pointer adjustment. */\r\n    as->invmcp = NULL;\r\n  }\r\n}\r\n\r\n/* -- Instruction dispatch ------------------------------------------------ */\r\n\r\n/* Assemble a single instruction. */\r\nstatic void asm_ir(ASMState *as, IRIns *ir)\r\n{\r\n  switch ((IROp)ir->o) {\r\n  /* Miscellaneous ops. */\r\n  case IR_LOOP: asm_loop(as); break;\r\n  case IR_NOP: case IR_XBAR: lua_assert(!ra_used(ir)); break;\r\n  case IR_USE:\r\n    ra_alloc1(as, ir->op1, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR); break;\r\n  case IR_PHI: asm_phi(as, ir); break;\r\n  case IR_HIOP: asm_hiop(as, ir); break;\r\n  case IR_GCSTEP: asm_gcstep(as, ir); break;\r\n\r\n  /* Guarded assertions. */\r\n  case IR_EQ: case IR_NE:\r\n    if ((ir-1)->o == IR_HREF && ir->op1 == as->curins-1) {\r\n      as->curins--;\r\n      asm_href(as, ir-1, (IROp)ir->o);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case IR_LT: case IR_GE: case IR_LE: case IR_GT:\r\n  case IR_ULT: case IR_UGE: case IR_ULE: case IR_UGT:\r\n  case IR_ABC:\r\n    asm_comp(as, ir);\r\n    break;\r\n\r\n  case IR_RETF: asm_retf(as, ir); break;\r\n\r\n  /* Bit ops. */\r\n  case IR_BNOT: asm_bitnot(as, ir); break;\r\n  case IR_BSWAP: asm_bitswap(as, ir); break;\r\n\r\n  case IR_BAND: asm_bitand(as, ir); break;\r\n  case IR_BOR:  asm_bitop(as, ir, PPCI_OR, PPCI_ORI); break;\r\n  case IR_BXOR: asm_bitop(as, ir, PPCI_XOR, PPCI_XORI); break;\r\n\r\n  case IR_BSHL: asm_bitshift(as, ir, PPCI_SLW, 0); break;\r\n  case IR_BSHR: asm_bitshift(as, ir, PPCI_SRW, 1); break;\r\n  case IR_BSAR: asm_bitshift(as, ir, PPCI_SRAW, PPCI_SRAWI); break;\r\n  case IR_BROL: asm_bitshift(as, ir, PPCI_RLWNM|PPCF_MB(0)|PPCF_ME(31),\r\n\t\t\t     PPCI_RLWINM|PPCF_MB(0)|PPCF_ME(31)); break;\r\n  case IR_BROR: lua_assert(0); break;\r\n\r\n  /* Arithmetic ops. */\r\n  case IR_ADD: asm_add(as, ir); break;\r\n  case IR_SUB: asm_sub(as, ir); break;\r\n  case IR_MUL: asm_mul(as, ir); break;\r\n  case IR_DIV: asm_fparith(as, ir, PPCI_FDIV); break;\r\n  case IR_MOD: asm_callid(as, ir, IRCALL_lj_vm_modi); break;\r\n  case IR_POW: asm_callid(as, ir, IRCALL_lj_vm_powi); break;\r\n  case IR_NEG: asm_neg(as, ir); break;\r\n\r\n  case IR_ABS: asm_fpunary(as, ir, PPCI_FABS); break;\r\n  case IR_ATAN2: asm_callid(as, ir, IRCALL_atan2); break;\r\n  case IR_LDEXP: asm_callid(as, ir, IRCALL_ldexp); break;\r\n  case IR_MIN: asm_min_max(as, ir, 0); break;\r\n  case IR_MAX: asm_min_max(as, ir, 1); break;\r\n  case IR_FPMATH:\r\n    if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n      break;\r\n    if (ir->op2 == IRFPM_SQRT && (as->flags & JIT_F_SQRT))\r\n      asm_fpunary(as, ir, PPCI_FSQRT);\r\n    else\r\n      asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n    break;\r\n\r\n  /* Overflow-checking arithmetic ops. */\r\n  case IR_ADDOV: asm_arithov(as, ir, PPCI_ADDO); break;\r\n  case IR_SUBOV: asm_arithov(as, ir, PPCI_SUBFO); break;\r\n  case IR_MULOV: asm_arithov(as, ir, PPCI_MULLWO); break;\r\n\r\n  /* Memory references. */\r\n  case IR_AREF: asm_aref(as, ir); break;\r\n  case IR_HREF: asm_href(as, ir, 0); break;\r\n  case IR_HREFK: asm_hrefk(as, ir); break;\r\n  case IR_NEWREF: asm_newref(as, ir); break;\r\n  case IR_UREFO: case IR_UREFC: asm_uref(as, ir); break;\r\n  case IR_FREF: asm_fref(as, ir); break;\r\n  case IR_STRREF: asm_strref(as, ir); break;\r\n\r\n  /* Loads and stores. */\r\n  case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n    asm_ahuvload(as, ir);\r\n    break;\r\n  case IR_FLOAD: asm_fload(as, ir); break;\r\n  case IR_XLOAD: asm_xload(as, ir); break;\r\n  case IR_SLOAD: asm_sload(as, ir); break;\r\n\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: asm_ahustore(as, ir); break;\r\n  case IR_FSTORE: asm_fstore(as, ir); break;\r\n  case IR_XSTORE: asm_xstore(as, ir, 0); break;\r\n\r\n  /* Allocations. */\r\n  case IR_SNEW: case IR_XSNEW: asm_snew(as, ir); break;\r\n  case IR_TNEW: asm_tnew(as, ir); break;\r\n  case IR_TDUP: asm_tdup(as, ir); break;\r\n  case IR_CNEW: case IR_CNEWI: asm_cnew(as, ir); break;\r\n\r\n  /* Write barriers. */\r\n  case IR_TBAR: asm_tbar(as, ir); break;\r\n  case IR_OBAR: asm_obar(as, ir); break;\r\n\r\n  /* Type conversions. */\r\n  case IR_CONV: asm_conv(as, ir); break;\r\n  case IR_TOBIT: asm_tobit(as, ir); break;\r\n  case IR_TOSTR: asm_tostr(as, ir); break;\r\n  case IR_STRTO: asm_strto(as, ir); break;\r\n\r\n  /* Calls. */\r\n  case IR_CALLN: case IR_CALLL: case IR_CALLS: asm_call(as, ir); break;\r\n  case IR_CALLXS: asm_callx(as, ir); break;\r\n  case IR_CARG: break;\r\n\r\n  default:\r\n    setintV(&as->J->errinfo, ir->o);\r\n    lj_trace_err_info(as->J, LJ_TRERR_NYIIR);\r\n    break;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = (int)CCI_NARGS(ci);\r\n  int nslots = 2, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++)\r\n    if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n      if (nfpr > 0) nfpr--; else nslots = (nslots+3) & ~1;\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_exitstub_setup(as, as->T->nsnap + (as->parent ? 1 : 0));\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *px = exitstub_trace_addr(T, exitno);\r\n  MCode *cstart = NULL;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  int clearso = 0;\r\n  for (; p < pe; p++) {\r\n    /* Look for exitstub branch, try to replace with branch to target. */\r\n    uint32_t ins = *p;\r\n    if ((ins & 0xfc000000u) == 0x40000000u &&\r\n\t((ins ^ ((char *)px-(char *)p)) & 0xffffu) == 0) {\r\n      ptrdiff_t delta = (char *)target - (char *)p;\r\n      if (((ins >> 16) & 3) == (CC_SO&3)) {\r\n\tclearso = sizeof(MCode);\r\n\tdelta -= sizeof(MCode);\r\n      }\r\n      /* Many, but not all short-range branches can be patched directly. */\r\n      if (((delta + 0x8000) >> 16) == 0) {\r\n\t*p = (ins & 0xffdf0000u) | ((uint32_t)delta & 0xffffu) |\r\n\t     ((delta & 0x8000) * (PPCF_Y/0x8000));\r\n\tif (!cstart) cstart = p;\r\n      }\r\n    } else if ((ins & 0xfc000000u) == PPCI_B &&\r\n\t       ((ins ^ ((char *)px-(char *)p)) & 0x03ffffffu) == 0) {\r\n      ptrdiff_t delta = (char *)target - (char *)p;\r\n      lua_assert(((delta + 0x02000000) >> 26) == 0);\r\n      *p = PPCI_B | ((uint32_t)delta & 0x03ffffffu);\r\n      if (!cstart) cstart = p;\r\n    }\r\n  }\r\n  {  /* Always patch long-range branch in exit stub itself. */\r\n    ptrdiff_t delta = (char *)target - (char *)px - clearso;\r\n    lua_assert(((delta + 0x02000000) >> 26) == 0);\r\n    *px = PPCI_B | ((uint32_t)delta & 0x03ffffffu);\r\n  }\r\n  if (!cstart) cstart = px;\r\n  lj_mcode_sync(cstart, px+1);\r\n  if (clearso) {  /* Extend the current trace. Ugly workaround. */\r\n    MCode *pp = J->cur.mcode;\r\n    J->cur.szmcode += sizeof(MCode);\r\n    *--pp = PPCI_MCRXR;  /* Clear SO flag. */\r\n    J->cur.mcode = pp;\r\n    lj_mcode_sync(pp, pp+1);\r\n  }\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_asm_x86.h",
    "content": "/*\r\n** x86/x64 IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Generate an exit stub group at the bottom of the reserved MCode memory. */\r\nstatic MCode *asm_exitstub_gen(ASMState *as, ExitNo group)\r\n{\r\n  ExitNo i, groupofs = (group*EXITSTUBS_PER_GROUP) & 0xff;\r\n  MCode *mxp = as->mcbot;\r\n  MCode *mxpstart = mxp;\r\n  if (mxp + (2+2)*EXITSTUBS_PER_GROUP+8+5 >= as->mctop)\r\n    asm_mclimit(as);\r\n  /* Push low byte of exitno for each exit stub. */\r\n  *mxp++ = XI_PUSHi8; *mxp++ = (MCode)groupofs;\r\n  for (i = 1; i < EXITSTUBS_PER_GROUP; i++) {\r\n    *mxp++ = XI_JMPs; *mxp++ = (MCode)((2+2)*(EXITSTUBS_PER_GROUP - i) - 2);\r\n    *mxp++ = XI_PUSHi8; *mxp++ = (MCode)(groupofs + i);\r\n  }\r\n  /* Push the high byte of the exitno for each exit stub group. */\r\n  *mxp++ = XI_PUSHi8; *mxp++ = (MCode)((group*EXITSTUBS_PER_GROUP)>>8);\r\n  /* Store DISPATCH at original stack slot 0. Account for the two push ops. */\r\n  *mxp++ = XI_MOVmi;\r\n  *mxp++ = MODRM(XM_OFS8, 0, RID_ESP);\r\n  *mxp++ = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n  *mxp++ = 2*sizeof(void *);\r\n  *(int32_t *)mxp = ptr2addr(J2GG(as->J)->dispatch); mxp += 4;\r\n  /* Jump to exit handler which fills in the ExitState. */\r\n  *mxp++ = XI_JMP; mxp += 4;\r\n  *((int32_t *)(mxp-4)) = jmprel(mxp, (MCode *)(void *)lj_vm_exit_handler);\r\n  /* Commit the code for this group (even if assembly fails later on). */\r\n  lj_mcode_commitbot(as->J, mxp);\r\n  as->mcbot = mxp;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  return mxpstart;\r\n}\r\n\r\n/* Setup all needed exit stubs. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  if (nexits >= EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR)\r\n    lj_trace_err(as->J, LJ_TRERR_SNAPOV);\r\n  for (i = 0; i < (nexits+EXITSTUBS_PER_GROUP-1)/EXITSTUBS_PER_GROUP; i++)\r\n    if (as->J->exitstubgroup[i] == NULL)\r\n      as->J->exitstubgroup[i] = asm_exitstub_gen(as, i);\r\n}\r\n\r\n/* Emit conditional branch to exit for guard.\r\n** It's important to emit this *after* all registers have been allocated,\r\n** because rematerializations may invalidate the flags.\r\n*/\r\nstatic void asm_guardcc(ASMState *as, int cc)\r\n{\r\n  MCode *target = exitstub_addr(as->J, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *(int32_t *)(p+1) = jmprel(p+5, target);\r\n    target = p;\r\n    cc ^= 1;\r\n    if (as->realign) {\r\n      emit_sjcc(as, cc, target);\r\n      return;\r\n    }\r\n  }\r\n  emit_jcc(as, cc, target);\r\n}\r\n\r\n/* -- Memory operand fusion ----------------------------------------------- */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if a reference is a signed 32 bit constant. */\r\nstatic int asm_isk32(ASMState *as, IRRef ref, int32_t *k)\r\n{\r\n  if (irref_isk(ref)) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->o != IR_KINT64) {\r\n      *k = ir->i;\r\n      return 1;\r\n    } else if (checki32((int64_t)ir_kint64(ir)->u64)) {\r\n      *k = (int32_t)ir_kint64(ir)->u64;\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check if there's no conflicting instruction between curins and ref.\r\n** Also avoid fusing loads if there are multiple references.\r\n*/\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict, int noload)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref) {\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n    else if (!noload && (ir[i].op1 == ref || ir[i].op2 == ref))\r\n      return 0;\r\n  }\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse array base into memory operand. */\r\nstatic IRRef asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *irb = IR(ref);\r\n  as->mrm.ofs = 0;\r\n  if (irb->o == IR_FLOAD) {\r\n    IRIns *ira = IR(irb->op1);\r\n    lua_assert(irb->op2 == IRFL_TAB_ARRAY);\r\n    /* We can avoid the FLOAD of t->array for colocated arrays. */\r\n    if (ira->o == IR_TNEW && ira->op1 <= LJ_MAX_COLOSIZE &&\r\n\t!neverfuse(as) && noconflict(as, irb->op1, IR_NEWREF, 1)) {\r\n      as->mrm.ofs = (int32_t)sizeof(GCtab);  /* Ofs to colocated array. */\r\n      return irb->op1;  /* Table obj. */\r\n    }\r\n  } else if (irb->o == IR_ADD && irref_isk(irb->op2)) {\r\n    /* Fuse base offset (vararg load). */\r\n    as->mrm.ofs = IR(irb->op2)->i;\r\n    return irb->op1;\r\n  }\r\n  return ref;  /* Otherwise use the given array base. */\r\n}\r\n\r\n/* Fuse array reference into memory operand. */\r\nstatic void asm_fusearef(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irx;\r\n  lua_assert(ir->o == IR_AREF);\r\n  as->mrm.base = (uint8_t)ra_alloc1(as, asm_fuseabase(as, ir->op1), allow);\r\n  irx = IR(ir->op2);\r\n  if (irref_isk(ir->op2)) {\r\n    as->mrm.ofs += 8*irx->i;\r\n    as->mrm.idx = RID_NONE;\r\n  } else {\r\n    rset_clear(allow, as->mrm.base);\r\n    as->mrm.scale = XM_SCALE8;\r\n    /* Fuse a constant ADD (e.g. t[i+1]) into the offset.\r\n    ** Doesn't help much without ABCelim, but reduces register pressure.\r\n    */\r\n    if (!LJ_64 &&  /* Has bad effects with negative index on x64. */\r\n\tmayfuse(as, ir->op2) && ra_noreg(irx->r) &&\r\n\tirx->o == IR_ADD && irref_isk(irx->op2)) {\r\n      as->mrm.ofs += 8*IR(irx->op2)->i;\r\n      as->mrm.idx = (uint8_t)ra_alloc1(as, irx->op1, allow);\r\n    } else {\r\n      as->mrm.idx = (uint8_t)ra_alloc1(as, ir->op2, allow);\r\n    }\r\n  }\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into memory operand.\r\n** Caveat: this may allocate GPRs for the base/idx registers. Be sure to\r\n** pass the final allow mask, excluding any GPRs used for other inputs.\r\n** In particular: 2-operand GPR instructions need to call ra_dest() first!\r\n*/\r\nstatic void asm_fuseahuref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    switch ((IROp)ir->o) {\r\n    case IR_AREF:\r\n      if (mayfuse(as, ref)) {\r\n\tasm_fusearef(as, ir, allow);\r\n\treturn;\r\n      }\r\n      break;\r\n    case IR_HREFK:\r\n      if (mayfuse(as, ref)) {\r\n\tas->mrm.base = (uint8_t)ra_alloc1(as, ir->op1, allow);\r\n\tas->mrm.ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tas->mrm.idx = RID_NONE;\r\n\treturn;\r\n      }\r\n      break;\r\n    case IR_UREFC:\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tGCupval *uv = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv;\r\n\tas->mrm.ofs = ptr2addr(&uv->tv);\r\n\tas->mrm.base = as->mrm.idx = RID_NONE;\r\n\treturn;\r\n      }\r\n      break;\r\n    default:\r\n      lua_assert(ir->o == IR_HREF || ir->o == IR_NEWREF || ir->o == IR_UREFO ||\r\n\t\t ir->o == IR_KKPTR);\r\n      break;\r\n    }\r\n  }\r\n  as->mrm.base = (uint8_t)ra_alloc1(as, ref, allow);\r\n  as->mrm.ofs = 0;\r\n  as->mrm.idx = RID_NONE;\r\n}\r\n\r\n/* Fuse FLOAD/FREF reference into memory operand. */\r\nstatic void asm_fusefref(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  lua_assert(ir->o == IR_FLOAD || ir->o == IR_FREF);\r\n  as->mrm.ofs = field_ofs[ir->op2];\r\n  as->mrm.idx = RID_NONE;\r\n  if (irref_isk(ir->op1)) {\r\n    as->mrm.ofs += IR(ir->op1)->i;\r\n    as->mrm.base = RID_NONE;\r\n  } else {\r\n    as->mrm.base = (uint8_t)ra_alloc1(as, ir->op1, allow);\r\n  }\r\n}\r\n\r\n/* Fuse string reference into memory operand. */\r\nstatic void asm_fusestrref(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irr;\r\n  lua_assert(ir->o == IR_STRREF);\r\n  as->mrm.base = as->mrm.idx = RID_NONE;\r\n  as->mrm.scale = XM_SCALE1;\r\n  as->mrm.ofs = sizeof(GCstr);\r\n  if (irref_isk(ir->op1)) {\r\n    as->mrm.ofs += IR(ir->op1)->i;\r\n  } else {\r\n    Reg r = ra_alloc1(as, ir->op1, allow);\r\n    rset_clear(allow, r);\r\n    as->mrm.base = (uint8_t)r;\r\n  }\r\n  irr = IR(ir->op2);\r\n  if (irref_isk(ir->op2)) {\r\n    as->mrm.ofs += irr->i;\r\n  } else {\r\n    Reg r;\r\n    /* Fuse a constant add into the offset, e.g. string.sub(s, i+10). */\r\n    if (!LJ_64 &&  /* Has bad effects with negative index on x64. */\r\n\tmayfuse(as, ir->op2) && irr->o == IR_ADD && irref_isk(irr->op2)) {\r\n      as->mrm.ofs += IR(irr->op2)->i;\r\n      r = ra_alloc1(as, irr->op1, allow);\r\n    } else {\r\n      r = ra_alloc1(as, ir->op2, allow);\r\n    }\r\n    if (as->mrm.base == RID_NONE)\r\n      as->mrm.base = (uint8_t)r;\r\n    else\r\n      as->mrm.idx = (uint8_t)r;\r\n  }\r\n}\r\n\r\nstatic void asm_fusexref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  as->mrm.idx = RID_NONE;\r\n  if (ir->o == IR_KPTR || ir->o == IR_KKPTR) {\r\n    as->mrm.ofs = ir->i;\r\n    as->mrm.base = RID_NONE;\r\n  } else if (ir->o == IR_STRREF) {\r\n    asm_fusestrref(as, ir, allow);\r\n  } else {\r\n    as->mrm.ofs = 0;\r\n    if (canfuse(as, ir) && ir->o == IR_ADD && ra_noreg(ir->r)) {\r\n      /* Gather (base+idx*sz)+ofs as emitted by cdata ptr/array indexing. */\r\n      IRIns *irx;\r\n      IRRef idx;\r\n      Reg r;\r\n      if (asm_isk32(as, ir->op2, &as->mrm.ofs)) {  /* Recognize x+ofs. */\r\n\tref = ir->op1;\r\n\tir = IR(ref);\r\n\tif (!(ir->o == IR_ADD && canfuse(as, ir) && ra_noreg(ir->r)))\r\n\t  goto noadd;\r\n      }\r\n      as->mrm.scale = XM_SCALE1;\r\n      idx = ir->op1;\r\n      ref = ir->op2;\r\n      irx = IR(idx);\r\n      if (!(irx->o == IR_BSHL || irx->o == IR_ADD)) {  /* Try other operand. */\r\n\tidx = ir->op2;\r\n\tref = ir->op1;\r\n\tirx = IR(idx);\r\n      }\r\n      if (canfuse(as, irx) && ra_noreg(irx->r)) {\r\n\tif (irx->o == IR_BSHL && irref_isk(irx->op2) && IR(irx->op2)->i <= 3) {\r\n\t  /* Recognize idx<<b with b = 0-3, corresponding to sz = (1),2,4,8. */\r\n\t  idx = irx->op1;\r\n\t  as->mrm.scale = (uint8_t)(IR(irx->op2)->i << 6);\r\n\t} else if (irx->o == IR_ADD && irx->op1 == irx->op2) {\r\n\t  /* FOLD does idx*2 ==> idx<<1 ==> idx+idx. */\r\n\t  idx = irx->op1;\r\n\t  as->mrm.scale = XM_SCALE2;\r\n\t}\r\n      }\r\n      r = ra_alloc1(as, idx, allow);\r\n      rset_clear(allow, r);\r\n      as->mrm.idx = (uint8_t)r;\r\n    }\r\n  noadd:\r\n    as->mrm.base = (uint8_t)ra_alloc1(as, ref, allow);\r\n  }\r\n}\r\n\r\n/* Fuse load into memory operand. */\r\nstatic Reg asm_fuseload(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_hasreg(ir->r)) {\r\n    if (allow != RSET_EMPTY) {  /* Fast path. */\r\n      ra_noweak(as, ir->r);\r\n      return ir->r;\r\n    }\r\n  fusespill:\r\n    /* Force a spill if only memory operands are allowed (asm_x87load). */\r\n    as->mrm.base = RID_ESP;\r\n    as->mrm.ofs = ra_spill(as, ir);\r\n    as->mrm.idx = RID_NONE;\r\n    return RID_MRM;\r\n  }\r\n  if (ir->o == IR_KNUM) {\r\n    RegSet avail = as->freeset & ~as->modset & RSET_FPR;\r\n    lua_assert(allow != RSET_EMPTY);\r\n    if (!(avail & (avail-1))) {  /* Fuse if less than two regs available. */\r\n      as->mrm.ofs = ptr2addr(ir_knum(ir));\r\n      as->mrm.base = as->mrm.idx = RID_NONE;\r\n      return RID_MRM;\r\n    }\r\n  } else if (ir->o == IR_KINT64) {\r\n    RegSet avail = as->freeset & ~as->modset & RSET_GPR;\r\n    lua_assert(allow != RSET_EMPTY);\r\n    if (!(avail & (avail-1))) {  /* Fuse if less than two regs available. */\r\n      as->mrm.ofs = ptr2addr(ir_kint64(ir));\r\n      as->mrm.base = as->mrm.idx = RID_NONE;\r\n      return RID_MRM;\r\n    }\r\n  } else if (mayfuse(as, ref)) {\r\n    RegSet xallow = (allow & RSET_GPR) ? allow : RSET_GPR;\r\n    if (ir->o == IR_SLOAD) {\r\n      if (!(ir->op2 & (IRSLOAD_PARENT|IRSLOAD_CONVERT)) &&\r\n\t  noconflict(as, ref, IR_RETF, 0)) {\r\n\tas->mrm.base = (uint8_t)ra_alloc1(as, REF_BASE, xallow);\r\n\tas->mrm.ofs = 8*((int32_t)ir->op1-1) + ((ir->op2&IRSLOAD_FRAME)?4:0);\r\n\tas->mrm.idx = RID_NONE;\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_FLOAD) {\r\n      /* Generic fusion is only ok for 32 bit operand (but see asm_comp). */\r\n      if ((irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t)) &&\r\n\t  noconflict(as, ref, IR_FSTORE, 0)) {\r\n\tasm_fusefref(as, ir, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_ALOAD || ir->o == IR_HLOAD || ir->o == IR_ULOAD) {\r\n      if (noconflict(as, ref, ir->o + IRDELTA_L2S, 0)) {\r\n\tasm_fuseahuref(as, ir->op1, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_XLOAD) {\r\n      /* Generic fusion is not ok for 8/16 bit operands (but see asm_comp).\r\n      ** Fusing unaligned memory operands is ok on x86 (except for SIMD types).\r\n      */\r\n      if ((!irt_typerange(ir->t, IRT_I8, IRT_U16)) &&\r\n\t  noconflict(as, ref, IR_XSTORE, 0)) {\r\n\tasm_fusexref(as, ir->op1, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_VLOAD) {\r\n      asm_fuseahuref(as, ir->op1, xallow);\r\n      return RID_MRM;\r\n    }\r\n  }\r\n  if (!(as->freeset & allow) && !irref_isk(ref) &&\r\n      (allow == RSET_EMPTY || ra_hasspill(ir->s) || iscrossref(as, ref)))\r\n    goto fusespill;\r\n  return ra_allocref(as, ref, allow);\r\n}\r\n\r\n#if LJ_64\r\n/* Don't fuse a 32 bit load into a 64 bit operation. */\r\nstatic Reg asm_fuseloadm(ASMState *as, IRRef ref, RegSet allow, int is64)\r\n{\r\n  if (is64 && !irt_is64(IR(ref)->t))\r\n    return ra_alloc1(as, ref, allow);\r\n  return asm_fuseload(as, ref, allow);\r\n}\r\n#else\r\n#define asm_fuseloadm(as, ref, allow, is64)  asm_fuseload(as, (ref), (allow))\r\n#endif\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Count the required number of stack slots for a call. */\r\nstatic int asm_count_call_slots(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t i, nargs = CCI_NARGS(ci);\r\n  int nslots = 0;\r\n#if LJ_64\r\n  if (LJ_ABI_WIN) {\r\n    nslots = (int)(nargs*2);  /* Only matters for more than four args. */\r\n  } else {\r\n    int ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n    for (i = 0; i < nargs; i++)\r\n      if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n\tif (nfpr > 0) nfpr--; else nslots += 2;\r\n      } else {\r\n\tif (ngpr > 0) ngpr--; else nslots += 2;\r\n      }\r\n  }\r\n#else\r\n  int ngpr = 0;\r\n  if ((ci->flags & CCI_CC_MASK) == CCI_CC_FASTCALL)\r\n    ngpr = 2;\r\n  else if ((ci->flags & CCI_CC_MASK) == CCI_CC_THISCALL)\r\n    ngpr = 1;\r\n  for (i = 0; i < nargs; i++)\r\n    if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n      nslots += irt_isnum(IR(args[i])->t) ? 2 : 1;\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n#endif\r\n  return nslots;\r\n}\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_NARGS(ci);\r\n  int32_t ofs = STACKARG_OFS;\r\n#if LJ_64\r\n  uint32_t gprs = REGARG_GPRS;\r\n  Reg fpr = REGARG_FIRSTFPR;\r\n#if !LJ_ABI_WIN\r\n  MCode *patchnfpr = NULL;\r\n#endif\r\n#else\r\n  uint32_t gprs = 0;\r\n  if ((ci->flags & CCI_CC_MASK) != CCI_CC_CDECL) {\r\n    if ((ci->flags & CCI_CC_MASK) == CCI_CC_THISCALL)\r\n      gprs = (REGARG_GPRS & 31);\r\n    else if ((ci->flags & CCI_CC_MASK) == CCI_CC_FASTCALL)\r\n      gprs = REGARG_GPRS;\r\n  }\r\n#endif\r\n  if ((void *)ci->func)\r\n    emit_call(as, ci->func);\r\n#if LJ_64\r\n  if ((ci->flags & CCI_VARARG)) {  /* Special handling for vararg calls. */\r\n#if LJ_ABI_WIN\r\n    for (n = 0; n < 4 && n < nargs; n++) {\r\n      IRIns *ir = IR(args[n]);\r\n      if (irt_isfp(ir->t))  /* Duplicate FPRs in GPRs. */\r\n\temit_rr(as, XO_MOVDto, (irt_isnum(ir->t) ? REX_64 : 0) | (fpr+n),\r\n\t\t((gprs >> (n*5)) & 31));  /* Either MOVD or MOVQ. */\r\n    }\r\n#else\r\n    patchnfpr = --as->mcp;  /* Indicate number of used FPRs in register al. */\r\n    *--as->mcp = XI_MOVrib | RID_EAX;\r\n#endif\r\n  }\r\n#endif\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    IRIns *ir = IR(ref);\r\n    Reg r;\r\n#if LJ_64 && LJ_ABI_WIN\r\n    /* Windows/x64 argument registers are strictly positional. */\r\n    r = irt_isfp(ir->t) ? (fpr <= REGARG_LASTFPR ? fpr : 0) : (gprs & 31);\r\n    fpr++; gprs >>= 5;\r\n#elif LJ_64\r\n    /* POSIX/x64 argument registers are used in order of appearance. */\r\n    if (irt_isfp(ir->t)) {\r\n      r = fpr <= REGARG_LASTFPR ? fpr++ : 0;\r\n    } else {\r\n      r = gprs & 31; gprs >>= 5;\r\n    }\r\n#else\r\n    if (ref && irt_isfp(ir->t)) {\r\n      r = 0;\r\n    } else {\r\n      r = gprs & 31; gprs >>= 5;\r\n      if (!ref) continue;\r\n    }\r\n#endif\r\n    if (r) {  /* Argument is in a register. */\r\n      if (r < RID_MAX_GPR && ref < ASMREF_TMP1) {\r\n#if LJ_64\r\n\tif (ir->o == IR_KINT64)\r\n\t  emit_loadu64(as, r, ir_kint64(ir)->u64);\r\n\telse\r\n#endif\r\n\t  emit_loadi(as, r, ir->i);\r\n      } else {\r\n\tlua_assert(rset_test(as->freeset, r));  /* Must have been evicted. */\r\n\tif (ra_hasreg(ir->r)) {\r\n\t  ra_noweak(as, ir->r);\r\n\t  emit_movrr(as, ir, r, ir->r);\r\n\t} else {\r\n\t  ra_allocref(as, ref, RID2RSET(r));\r\n\t}\r\n      }\r\n    } else if (irt_isfp(ir->t)) {  /* FP argument is on stack. */\r\n      lua_assert(!(irt_isfloat(ir->t) && irref_isk(ref)));  /* No float k. */\r\n      if (LJ_32 && (ofs & 4) && irref_isk(ref)) {\r\n\t/* Split stores for unaligned FP consts. */\r\n\temit_movmroi(as, RID_ESP, ofs, (int32_t)ir_knum(ir)->u32.lo);\r\n\temit_movmroi(as, RID_ESP, ofs+4, (int32_t)ir_knum(ir)->u32.hi);\r\n      } else {\r\n\tr = ra_alloc1(as, ref, RSET_FPR);\r\n\temit_rmro(as, irt_isnum(ir->t) ? XO_MOVSDto : XO_MOVSSto,\r\n\t\t  r, RID_ESP, ofs);\r\n      }\r\n      ofs += (LJ_32 && irt_isfloat(ir->t)) ? 4 : 8;\r\n    } else {  /* Non-FP argument is on stack. */\r\n      if (LJ_32 && ref < ASMREF_TMP1) {\r\n\temit_movmroi(as, RID_ESP, ofs, ir->i);\r\n      } else {\r\n\tr = ra_alloc1(as, ref, RSET_GPR);\r\n\temit_movtomro(as, REX_64 + r, RID_ESP, ofs);\r\n      }\r\n      ofs += sizeof(intptr_t);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n#if LJ_64 && !LJ_ABI_WIN\r\n  if (patchnfpr) *patchnfpr = fpr - REGARG_FIRSTFPR;\r\n#endif\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = (LJ_32 && (ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    if (irt_isfp(ir->t)) {\r\n      int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n#if LJ_64\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_rr(as, XO_MOVD, dest|REX_64, RID_RET);  /* Really MOVQ. */\r\n\t}\r\n\tif (ofs) emit_movtomro(as, RID_RET|REX_64, RID_ESP, ofs);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n#else\r\n      /* Number result is in x87 st0 for x86 calling convention. */\r\n      Reg dest = ir->r;\r\n      if (ra_hasreg(dest)) {\r\n\tra_free(as, dest);\r\n\tra_modified(as, dest);\r\n\temit_rmro(as, irt_isnum(ir->t) ? XMM_MOVRM(as) : XO_MOVSS,\r\n\t\t  dest, RID_ESP, ofs);\r\n      }\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\temit_movtomro(as, RID_RETLO, RID_ESP, ofs);\r\n\temit_movtomro(as, RID_RETHI, RID_ESP, ofs+4);\r\n      } else {\r\n\temit_rmro(as, irt_isnum(ir->t) ? XO_FSTPq : XO_FSTPd,\r\n\t\t  irt_isnum(ir->t) ? XOg_FSTPq : XOg_FSTPd, RID_ESP, ofs);\r\n      }\r\n#endif\r\n#if LJ_32\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n#endif\r\n    } else {\r\n      lua_assert(!irt_ispri(ir->t));\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  } else if (LJ_32 && irt_isfp(ir->t) && !(ci->flags & CCI_CASTU64)) {\r\n    emit_x87op(as, XI_FPOP);  /* Pop unused result from x87 st0. */\r\n  }\r\n}\r\n\r\nstatic void asm_call(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX];\r\n  const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n  asm_collectargs(as, ir, ci, args);\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\n/* Return a constant function pointer or NULL for indirect calls. */\r\nstatic void *asm_callx_func(ASMState *as, IRIns *irf, IRRef func)\r\n{\r\n#if LJ_32\r\n  UNUSED(as);\r\n  if (irref_isk(func))\r\n    return (void *)irf->i;\r\n#else\r\n  if (irref_isk(func)) {\r\n    MCode *p;\r\n    if (irf->o == IR_KINT64)\r\n      p = (MCode *)(void *)ir_k64(irf)->u64;\r\n    else\r\n      p = (MCode *)(void *)(uintptr_t)(uint32_t)irf->i;\r\n    if (p - as->mcp == (int32_t)(p - as->mcp))\r\n      return p;  /* Call target is still in +-2GB range. */\r\n    /* Avoid the indirect case of emit_call(). Try to hoist func addr. */\r\n  }\r\n#endif\r\n  return NULL;\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  int32_t spadj = 0;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n#if LJ_32\r\n  /* Have to readjust stack after non-cdecl calls due to callee cleanup. */\r\n  if ((ci.flags & CCI_CC_MASK) != CCI_CC_CDECL)\r\n    spadj = 4 * asm_count_call_slots(as, &ci, args);\r\n#endif\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  ci.func = (ASMFunction)asm_callx_func(as, irf, func);\r\n  if (!(void *)ci.func) {\r\n    /* Use a (hoistable) non-scratch register for indirect calls. */\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n    Reg r = ra_alloc1(as, func, allow);\r\n    if (LJ_32) emit_spsub(as, spadj);  /* Above code may cause restores! */\r\n    emit_rr(as, XO_GROUP5, XOg_CALL, r);\r\n  } else if (LJ_32) {\r\n    emit_spsub(as, spadj);\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_gmroi(as, XG_ARITHi(XOg_CMP), base, -4, ptr2addr(pc));\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guardcc(as, CC_P);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_rr(as, XO_UCOMISD, left, tmp);\r\n  emit_rr(as, XO_CVTSI2SD, tmp, dest);\r\n  if (!(as->flags & JIT_F_SPLIT_XMM))\r\n    emit_rr(as, XO_XORPS, tmp, tmp);  /* Avoid partial register stall. */\r\n  emit_rr(as, XO_CVTTSD2SI, dest, left);\r\n  /* Can't fuse since left is needed twice. */\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg tmp = ra_noreg(IR(ir->op1)->r) ?\r\n\t      ra_alloc1(as, ir->op1, RSET_FPR) :\r\n\t      ra_scratch(as, RSET_FPR);\r\n  Reg right = asm_fuseload(as, ir->op2, rset_exclude(RSET_FPR, tmp));\r\n  emit_rr(as, XO_MOVDto, tmp, dest);\r\n  emit_mrm(as, XO_ADDSD, tmp, right);\r\n  ra_left(as, tmp, ir->op1);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int st64 = (st == IRT_I64 || st == IRT_U64 || (LJ_64 && st == IRT_P64));\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(LJ_32 && (irt_isint64(ir->t) || st64)));  /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      Reg left = asm_fuseload(as, lref, RSET_FPR);\r\n      emit_mrm(as, st == IRT_NUM ? XO_CVTSD2SS : XO_CVTSS2SD, dest, left);\r\n      if (left == dest) return;  /* Avoid the XO_XORPS. */\r\n    } else if (LJ_32 && st == IRT_U32) {  /* U32 to FP conversion on x86. */\r\n      /* number = (2^52+2^51 .. u32) - (2^52+2^51) */\r\n      cTValue *k = lj_ir_k64_find(as->J, U64x(43380000,00000000));\r\n      Reg bias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      if (irt_isfloat(ir->t))\r\n\temit_rr(as, XO_CVTSD2SS, dest, dest);\r\n      emit_rr(as, XO_SUBSD, dest, bias);  /* Subtract 2^52+2^51 bias. */\r\n      emit_rr(as, XO_XORPS, dest, bias);  /* Merge bias and integer. */\r\n      emit_loadn(as, bias, k);\r\n      emit_mrm(as, XO_MOVD, dest, asm_fuseload(as, lref, RSET_GPR));\r\n      return;\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = (LJ_64 && (st == IRT_U32 || st == IRT_U64)) ?\r\n\t\t ra_alloc1(as, lref, RSET_GPR) :\r\n\t\t asm_fuseloadm(as, lref, RSET_GPR, st64);\r\n      if (LJ_64 && st == IRT_U64) {\r\n\tMCLabel l_end = emit_label(as);\r\n\tconst void *k = lj_ir_k64_find(as->J, U64x(43f00000,00000000));\r\n\temit_rma(as, XO_ADDSD, dest, k);  /* Add 2^64 to compensate. */\r\n\temit_sjcc(as, CC_NS, l_end);\r\n\temit_rr(as, XO_TEST, left|REX_64, left);  /* Check if u64 >= 2^63. */\r\n      }\r\n      emit_mrm(as, irt_isnum(ir->t) ? XO_CVTSI2SD : XO_CVTSI2SS,\r\n\t       dest|((LJ_64 && (st64 || st == IRT_U32)) ? REX_64 : 0), left);\r\n    }\r\n    if (!(as->flags & JIT_F_SPLIT_XMM))\r\n      emit_rr(as, XO_XORPS, dest, dest);  /* Avoid partial register stall. */\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      x86Op op = st == IRT_NUM ?\r\n\t\t ((ir->op2 & IRCONV_TRUNC) ? XO_CVTTSD2SI : XO_CVTSD2SI) :\r\n\t\t ((ir->op2 & IRCONV_TRUNC) ? XO_CVTTSS2SI : XO_CVTSS2SI);\r\n      if (LJ_64 ? irt_isu64(ir->t) : irt_isu32(ir->t)) {\r\n\t/* LJ_64: For inputs >= 2^63 add -2^64, convert again. */\r\n\t/* LJ_32: For inputs >= 2^31 add -2^31, convert again and add 2^31. */\r\n\tReg tmp = ra_noreg(IR(lref)->r) ? ra_alloc1(as, lref, RSET_FPR) :\r\n\t\t\t\t\t  ra_scratch(as, RSET_FPR);\r\n\tMCLabel l_end = emit_label(as);\r\n\tif (LJ_32)\r\n\t  emit_gri(as, XG_ARITHi(XOg_ADD), dest, (int32_t)0x80000000);\r\n\temit_rr(as, op, dest|REX_64, tmp);\r\n\tif (st == IRT_NUM)\r\n\t  emit_rma(as, XO_ADDSD, tmp, lj_ir_k64_find(as->J,\r\n\t\t   LJ_64 ? U64x(c3f00000,00000000) : U64x(c1e00000,00000000)));\r\n\telse\r\n\t  emit_rma(as, XO_ADDSS, tmp, lj_ir_k64_find(as->J,\r\n\t\t   LJ_64 ? U64x(00000000,df800000) : U64x(00000000,cf000000)));\r\n\temit_sjcc(as, CC_NS, l_end);\r\n\temit_rr(as, XO_TEST, dest|REX_64, dest);  /* Check if dest negative. */\r\n\temit_rr(as, op, dest|REX_64, tmp);\r\n\tra_left(as, tmp, lref);\r\n      } else {\r\n\tReg left = asm_fuseload(as, lref, RSET_FPR);\r\n\tif (LJ_64 && irt_isu32(ir->t))\r\n\t  emit_rr(as, XO_MOV, dest, dest);  /* Zero hiword. */\r\n\temit_mrm(as, op,\r\n\t\t dest|((LJ_64 &&\r\n\t\t\t(irt_is64(ir->t) || irt_isu32(ir->t))) ? REX_64 : 0),\r\n\t\t left);\r\n      }\r\n    }\r\n  } else if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n    Reg left, dest = ra_dest(as, ir, RSET_GPR);\r\n    RegSet allow = RSET_GPR;\r\n    x86Op op;\r\n    lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n    if (st == IRT_I8) {\r\n      op = XO_MOVSXb; allow = RSET_GPR8; dest |= FORCE_REX;\r\n    } else if (st == IRT_U8) {\r\n      op = XO_MOVZXb; allow = RSET_GPR8; dest |= FORCE_REX;\r\n    } else if (st == IRT_I16) {\r\n      op = XO_MOVSXw;\r\n    } else {\r\n      op = XO_MOVZXw;\r\n    }\r\n    left = asm_fuseload(as, lref, allow);\r\n    /* Add extra MOV if source is already in wrong register. */\r\n    if (!LJ_64 && left != RID_MRM && !rset_test(allow, left)) {\r\n      Reg tmp = ra_scratch(as, allow);\r\n      emit_rr(as, op, dest, tmp);\r\n      emit_rr(as, XO_MOV, tmp, left);\r\n    } else {\r\n      emit_mrm(as, op, dest, left);\r\n    }\r\n  } else {  /* 32/64 bit integer conversions. */\r\n    if (LJ_32) {  /* Only need to handle 32/32 bit no-op (cast) on x86. */\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      ra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    } else if (irt_is64(ir->t)) {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      if (st64 || !(ir->op2 & IRCONV_SEXT)) {\r\n\t/* 64/64 bit no-op (cast) or 32 to 64 bit zero extension. */\r\n\tra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n      } else {  /* 32 to 64 bit sign extension. */\r\n\tReg left = asm_fuseload(as, lref, RSET_GPR);\r\n\temit_mrm(as, XO_MOVSXd, dest|REX_64, left);\r\n      }\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      if (st64) {\r\n\tReg left = asm_fuseload(as, lref, RSET_GPR);\r\n\t/* This is either a 32 bit reg/reg mov which zeroes the hiword\r\n\t** or a load of the loword from a 64 bit address.\r\n\t*/\r\n\temit_mrm(as, XO_MOV, dest, left);\r\n      } else {  /* 32/32 bit no-op (cast). */\r\n\tra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* No SSE conversions to/from 64 bit on x86, so resort to ugly x87 code. */\r\n\r\n/* 64 bit integer to FP conversion in 32 bit mode. */\r\nstatic void asm_conv_fp_int64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg hi = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg lo = ra_alloc1(as, (ir-1)->op1, rset_exclude(RSET_GPR, hi));\r\n  int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n  Reg dest = ir->r;\r\n  if (ra_hasreg(dest)) {\r\n    ra_free(as, dest);\r\n    ra_modified(as, dest);\r\n    emit_rmro(as, irt_isnum(ir->t) ? XMM_MOVRM(as) : XO_MOVSS,\r\n\t      dest, RID_ESP, ofs);\r\n  }\r\n  emit_rmro(as, irt_isnum(ir->t) ? XO_FSTPq : XO_FSTPd,\r\n\t    irt_isnum(ir->t) ? XOg_FSTPq : XOg_FSTPd, RID_ESP, ofs);\r\n  if (((ir-1)->op2 & IRCONV_SRCMASK) == IRT_U64) {\r\n    /* For inputs in [2^63,2^64-1] add 2^64 to compensate. */\r\n    MCLabel l_end = emit_label(as);\r\n    emit_rma(as, XO_FADDq, XOg_FADDq,\r\n\t     lj_ir_k64_find(as->J, U64x(43f00000,00000000)));\r\n    emit_sjcc(as, CC_NS, l_end);\r\n    emit_rr(as, XO_TEST, hi, hi);  /* Check if u64 >= 2^63. */\r\n  } else {\r\n    lua_assert(((ir-1)->op2 & IRCONV_SRCMASK) == IRT_I64);\r\n  }\r\n  emit_rmro(as, XO_FILDq, XOg_FILDq, RID_ESP, 0);\r\n  /* NYI: Avoid narrow-to-wide store-to-load forwarding stall. */\r\n  emit_rmro(as, XO_MOVto, hi, RID_ESP, 4);\r\n  emit_rmro(as, XO_MOVto, lo, RID_ESP, 0);\r\n}\r\n\r\n/* FP to 64 bit integer conversion in 32 bit mode. */\r\nstatic void asm_conv_int64_fp(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  Reg lo, hi;\r\n  lua_assert(st == IRT_NUM || st == IRT_FLOAT);\r\n  lua_assert(dt == IRT_I64 || dt == IRT_U64);\r\n  lua_assert(((ir-1)->op2 & IRCONV_TRUNC));\r\n  hi = ra_dest(as, ir, RSET_GPR);\r\n  lo = ra_dest(as, ir-1, rset_exclude(RSET_GPR, hi));\r\n  if (ra_used(ir-1)) emit_rmro(as, XO_MOV, lo, RID_ESP, 0);\r\n  /* NYI: Avoid wide-to-narrow store-to-load forwarding stall. */\r\n  if (!(as->flags & JIT_F_SSE3)) {  /* Set FPU rounding mode to default. */\r\n    emit_rmro(as, XO_FLDCW, XOg_FLDCW, RID_ESP, 4);\r\n    emit_rmro(as, XO_MOVto, lo, RID_ESP, 4);\r\n    emit_gri(as, XG_ARITHi(XOg_AND), lo, 0xf3ff);\r\n  }\r\n  if (dt == IRT_U64) {\r\n    /* For inputs in [2^63,2^64-1] add -2^64 and convert again. */\r\n    MCLabel l_pop, l_end = emit_label(as);\r\n    emit_x87op(as, XI_FPOP);\r\n    l_pop = emit_label(as);\r\n    emit_sjmp(as, l_end);\r\n    emit_rmro(as, XO_MOV, hi, RID_ESP, 4);\r\n    if ((as->flags & JIT_F_SSE3))\r\n      emit_rmro(as, XO_FISTTPq, XOg_FISTTPq, RID_ESP, 0);\r\n    else\r\n      emit_rmro(as, XO_FISTPq, XOg_FISTPq, RID_ESP, 0);\r\n    emit_rma(as, XO_FADDq, XOg_FADDq,\r\n\t     lj_ir_k64_find(as->J, U64x(c3f00000,00000000)));\r\n    emit_sjcc(as, CC_NS, l_pop);\r\n    emit_rr(as, XO_TEST, hi, hi);  /* Check if out-of-range (2^63). */\r\n  }\r\n  emit_rmro(as, XO_MOV, hi, RID_ESP, 4);\r\n  if ((as->flags & JIT_F_SSE3)) {  /* Truncation is easy with SSE3. */\r\n    emit_rmro(as, XO_FISTTPq, XOg_FISTTPq, RID_ESP, 0);\r\n  } else {  /* Otherwise set FPU rounding mode to truncate before the store. */\r\n    emit_rmro(as, XO_FISTPq, XOg_FISTPq, RID_ESP, 0);\r\n    emit_rmro(as, XO_FLDCW, XOg_FLDCW, RID_ESP, 0);\r\n    emit_rmro(as, XO_MOVtow, lo, RID_ESP, 0);\r\n    emit_rmro(as, XO_ARITHw(XOg_OR), lo, RID_ESP, 0);\r\n    emit_loadi(as, lo, 0xc00);\r\n    emit_rmro(as, XO_FNSTCW, XOg_FNSTCW, RID_ESP, 0);\r\n  }\r\n  if (dt == IRT_U64)\r\n    emit_x87op(as, XI_FDUP);\r\n  emit_mrm(as, st == IRT_NUM ? XO_FLDq : XO_FLDd,\r\n\t   st == IRT_NUM ? XOg_FLDq: XOg_FLDd,\r\n\t   asm_fuseload(as, ir->op1, RSET_EMPTY));\r\n}\r\n#endif\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  /* Force a spill slot for the destination register (if any). */\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  RegSet drop = RSET_SCRATCH;\r\n  if ((drop & RSET_FPR) != RSET_FPR && ra_hasreg(ir->r))\r\n    rset_set(drop, ir->r);  /* WIN64 doesn't spill all FPRs. */\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, CC_E);\r\n  emit_rr(as, XO_TEST, RID_RET, RID_RET);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  emit_rmro(as, XO_LEA, ra_releasetmp(as, ASMREF_TMP1)|REX_64,\r\n\t    RID_ESP, sps_scale(ir->s));\r\n}\r\n\r\nstatic void asm_tostr(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irl = IR(ir->op1);\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;\r\n  as->gcsteps++;\r\n  if (irt_isnum(irl->t)) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromnum];\r\n    args[1] = ASMREF_TMP1;  /* const lua_Number * */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n    emit_rmro(as, XO_LEA, ra_releasetmp(as, ASMREF_TMP1)|REX_64,\r\n\t      RID_ESP, ra_spill(as, irl));\r\n  } else {\r\n    const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_fromint];\r\n    args[1] = ir->op1;  /* int32_t k */\r\n    asm_setupresult(as, ir, ci);  /* GCstr * */\r\n    asm_gencall(as, ci, args);\r\n  }\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusearef(as, ir, RSET_GPR);\r\n  if (!(as->mrm.idx == RID_NONE && as->mrm.ofs == 0))\r\n    emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n  else if (as->mrm.base != dest)\r\n    emit_rr(as, XO_MOV, dest, as->mrm.base);\r\n}\r\n\r\n/* Merge NE(HREF, niltv) check. */\r\nstatic MCode *merge_href_niltv(ASMState *as, IRIns *ir)\r\n{\r\n  /* Assumes nothing else generates NE of HREF. */\r\n  if ((ir[1].o == IR_NE || ir[1].o == IR_EQ) && ir[1].op1 == as->curins &&\r\n      ra_hasreg(ir->r)) {\r\n    MCode *p = as->mcp;\r\n    p += (LJ_64 && *p != XI_ARITHi) ? 7+6 : 6+6;\r\n    /* Ensure no loop branch inversion happened. */\r\n    if (p[-6] == 0x0f && p[-5] == XI_JCCn+(CC_NE^(ir[1].o & 1))) {\r\n      as->mcp = p;  /* Kill cmp reg, imm32 + jz exit. */\r\n      return p + *(int32_t *)(p-4);  /* Return exit address. */\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir)\r\n{\r\n  MCode *nilexit = merge_href_niltv(as, ir);  /* Do this before any restores. */\r\n  RegSet allow = RSET_GPR;\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, tmp = RID_NONE;\r\n  IRIns *irkey = IR(ir->op2);\r\n  int isk = irref_isk(ir->op2);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  if (!isk) {\r\n    rset_clear(allow, tab);\r\n    key = ra_alloc1(as, ir->op2, irt_isnum(kt) ? RSET_FPR : allow);\r\n    if (!irt_isstr(kt))\r\n      tmp = ra_scratch(as, rset_exclude(allow, key));\r\n  }\r\n\r\n  /* Key not found in chain: jump to exit (if merged with NE) or load niltv. */\r\n  l_end = emit_label(as);\r\n  if (nilexit && ir[1].o == IR_NE) {\r\n    emit_jcc(as, CC_E, nilexit);  /* XI_JMP is not found by lj_asm_patchexit. */\r\n    nilexit = NULL;\r\n  } else {\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n  }\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = emit_sjcc_label(as, CC_NZ);\r\n  emit_rr(as, XO_TEST, dest, dest);\r\n  emit_rmro(as, XO_MOV, dest, dest, offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (nilexit)\r\n    emit_jcc(as, CC_E, nilexit);\r\n  else\r\n    emit_sjcc(as, CC_E, l_end);\r\n  if (irt_isnum(kt)) {\r\n    if (isk) {\r\n      /* Assumes -0.0 is already canonicalized to +0.0. */\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.u32.lo),\r\n\t\t (int32_t)ir_knum(irkey)->u32.lo);\r\n      emit_sjcc(as, CC_NE, l_next);\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.u32.hi),\r\n\t\t (int32_t)ir_knum(irkey)->u32.hi);\r\n    } else {\r\n      emit_sjcc(as, CC_P, l_next);\r\n      emit_rmro(as, XO_UCOMISD, key, dest, offsetof(Node, key.n));\r\n      emit_sjcc(as, CC_AE, l_next);\r\n      /* The type check avoids NaN penalties and complaints from Valgrind. */\r\n#if LJ_64\r\n      emit_u32(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi, XOg_CMP, dest, offsetof(Node, key.it));\r\n#else\r\n      emit_i8(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi8, XOg_CMP, dest, offsetof(Node, key.it));\r\n#endif\r\n    }\r\n#if LJ_64\r\n  } else if (irt_islightud(kt)) {\r\n    emit_rmro(as, XO_CMP, key|REX_64, dest, offsetof(Node, key.u64));\r\n#endif\r\n  } else {\r\n    if (!irt_ispri(kt)) {\r\n      lua_assert(irt_isaddr(kt));\r\n      if (isk)\r\n\temit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.gcr),\r\n\t\t   ptr2addr(ir_kgc(irkey)));\r\n      else\r\n\temit_rmro(as, XO_CMP, key, dest, offsetof(Node, key.gcr));\r\n      emit_sjcc(as, CC_NE, l_next);\r\n    }\r\n    lua_assert(!irt_isnil(kt));\r\n    emit_i8(as, irt_toitype(kt));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, dest, offsetof(Node, key.it));\r\n  }\r\n  emit_sfixup(as, l_loop);\r\n  checkmclim(as);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = isk ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, node));\r\n  } else {\r\n    emit_rmro(as, XO_ARITH(XOg_ADD), dest, tab, offsetof(GCtab, node));\r\n    if ((as->flags & JIT_F_PREFER_IMUL)) {\r\n      emit_i8(as, sizeof(Node));\r\n      emit_rr(as, XO_IMULi8, dest, dest);\r\n    } else {\r\n      emit_shifti(as, XOg_SHL, dest, 3);\r\n      emit_rmrxo(as, XO_LEA, dest, dest, dest, XM_SCALE2, 0);\r\n    }\r\n    if (isk) {\r\n      emit_gri(as, XG_ARITHi(XOg_AND), dest, (int32_t)khash);\r\n      emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, hmask));\r\n    } else if (irt_isstr(kt)) {\r\n      emit_rmro(as, XO_ARITH(XOg_AND), dest, key, offsetof(GCstr, hash));\r\n      emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, hmask));\r\n    } else {  /* Must match with hashrot() in lj_tab.c. */\r\n      emit_rmro(as, XO_ARITH(XOg_AND), dest, tab, offsetof(GCtab, hmask));\r\n      emit_rr(as, XO_ARITH(XOg_SUB), dest, tmp);\r\n      emit_shifti(as, XOg_ROL, tmp, HASH_ROT3);\r\n      emit_rr(as, XO_ARITH(XOg_XOR), dest, tmp);\r\n      emit_shifti(as, XOg_ROL, dest, HASH_ROT2);\r\n      emit_rr(as, XO_ARITH(XOg_SUB), tmp, dest);\r\n      emit_shifti(as, XOg_ROL, dest, HASH_ROT1);\r\n      emit_rr(as, XO_ARITH(XOg_XOR), tmp, dest);\r\n      if (irt_isnum(kt)) {\r\n\temit_rr(as, XO_ARITH(XOg_ADD), dest, dest);\r\n#if LJ_64\r\n\temit_shifti(as, XOg_SHR|REX_64, dest, 32);\r\n\temit_rr(as, XO_MOV, tmp, dest);\r\n\temit_rr(as, XO_MOVDto, key|REX_64, dest);\r\n#else\r\n\temit_rmro(as, XO_MOV, dest, RID_ESP, ra_spill(as, irkey)+4);\r\n\temit_rr(as, XO_MOVDto, key, tmp);\r\n#endif\r\n      } else {\r\n\temit_rr(as, XO_MOV, tmp, key);\r\n\temit_rmro(as, XO_LEA, dest, key, HASH_BIAS);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  Reg dest = ra_used(ir) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n#if !LJ_64\r\n  MCLabel l_exit;\r\n#endif\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ra_hasreg(dest)) {\r\n    if (ofs != 0) {\r\n      if (dest == node && !(as->flags & JIT_F_LEA_AGU))\r\n\temit_gri(as, XG_ARITHi(XOg_ADD), dest, ofs);\r\n      else\r\n\temit_rmro(as, XO_LEA, dest, node, ofs);\r\n    } else if (dest != node) {\r\n      emit_rr(as, XO_MOV, dest, node);\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n#if LJ_64\r\n  if (!irt_ispri(irkey->t)) {\r\n    Reg key = ra_scratch(as, rset_exclude(RSET_GPR, node));\r\n    emit_rmro(as, XO_CMP, key|REX_64, node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u64));\r\n    lua_assert(irt_isnum(irkey->t) || irt_isgcv(irkey->t));\r\n    /* Assumes -0.0 is already canonicalized to +0.0. */\r\n    emit_loadu64(as, key, irt_isnum(irkey->t) ? ir_knum(irkey)->u64 :\r\n\t\t\t  ((uint64_t)irt_toitype(irkey->t) << 32) |\r\n\t\t\t  (uint64_t)(uint32_t)ptr2addr(ir_kgc(irkey)));\r\n  } else {\r\n    lua_assert(!irt_isnil(irkey->t));\r\n    emit_i8(as, irt_toitype(irkey->t));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, node,\r\n\t      ofs + (int32_t)offsetof(Node, key.it));\r\n  }\r\n#else\r\n  l_exit = emit_label(as);\r\n  if (irt_isnum(irkey->t)) {\r\n    /* Assumes -0.0 is already canonicalized to +0.0. */\r\n    emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u32.lo),\r\n\t       (int32_t)ir_knum(irkey)->u32.lo);\r\n    emit_sjcc(as, CC_NE, l_exit);\r\n    emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u32.hi),\r\n\t       (int32_t)ir_knum(irkey)->u32.hi);\r\n  } else {\r\n    if (!irt_ispri(irkey->t)) {\r\n      lua_assert(irt_isgcv(irkey->t));\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t\t ofs + (int32_t)offsetof(Node, key.gcr),\r\n\t\t ptr2addr(ir_kgc(irkey)));\r\n      emit_sjcc(as, CC_NE, l_exit);\r\n    }\r\n    lua_assert(!irt_isnil(irkey->t));\r\n    emit_i8(as, irt_toitype(irkey->t));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, node,\r\n\t      ofs + (int32_t)offsetof(Node, key.it));\r\n  }\r\n#endif\r\n}\r\n\r\nstatic void asm_newref(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_newkey];\r\n  IRRef args[3];\r\n  IRIns *irkey;\r\n  Reg tmp;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ir->op1;      /* GCtab *t     */\r\n  args[2] = ASMREF_TMP1;  /* cTValue *key */\r\n  asm_setupresult(as, ir, ci);  /* TValue * */\r\n  asm_gencall(as, ci, args);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n  irkey = IR(ir->op2);\r\n  if (irt_isnum(irkey->t)) {\r\n    /* For numbers use the constant itself or a spill slot as a TValue. */\r\n    if (irref_isk(ir->op2))\r\n      emit_loada(as, tmp, ir_knum(irkey));\r\n    else\r\n      emit_rmro(as, XO_LEA, tmp|REX_64, RID_ESP, ra_spill(as, irkey));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    if (!irref_isk(ir->op2)) {\r\n      Reg src = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, tmp));\r\n      emit_movtomro(as, REX_64IR(irkey, src), tmp, 0);\r\n    } else if (!irt_ispri(irkey->t)) {\r\n      emit_movmroi(as, tmp, 0, irkey->i);\r\n    }\r\n    if (!(LJ_64 && irt_islightud(irkey->t)))\r\n      emit_movmroi(as, tmp, 4, irt_toitype(irkey->t));\r\n    emit_loada(as, tmp, &J2G(as->J)->tmptv);\r\n  }\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_rma(as, XO_MOV, dest, v);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      emit_rmro(as, XO_LEA, dest, uv, offsetof(GCupval, tv));\r\n      asm_guardcc(as, CC_NE);\r\n      emit_i8(as, 1);\r\n      emit_rmro(as, XO_ARITHib, XOg_CMP, uv, offsetof(GCupval, closed));\r\n    } else {\r\n      emit_rmro(as, XO_MOV, dest, uv, offsetof(GCupval, v));\r\n    }\r\n    emit_rmro(as, XO_MOV, uv, func,\r\n\t      (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusefref(as, ir, RSET_GPR);\r\n  emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusestrref(as, ir, RSET_GPR);\r\n  if (as->mrm.base == RID_NONE)\r\n    emit_loadi(as, dest, as->mrm.ofs);\r\n  else if (as->mrm.base == dest && as->mrm.idx == RID_NONE)\r\n    emit_gri(as, XG_ARITHi(XOg_ADD), dest, as->mrm.ofs);\r\n  else\r\n    emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic void asm_fxload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  x86Op xo;\r\n  if (ir->o == IR_FLOAD)\r\n    asm_fusefref(as, ir, RSET_GPR);\r\n  else\r\n    asm_fusexref(as, ir->op1, RSET_GPR);\r\n  /* ir->op2 is ignored -- unaligned loads are ok on x86. */\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: xo = XO_MOVSXb; break;\r\n  case IRT_U8: xo = XO_MOVZXb; break;\r\n  case IRT_I16: xo = XO_MOVSXw; break;\r\n  case IRT_U16: xo = XO_MOVZXw; break;\r\n  case IRT_NUM: xo = XMM_MOVRM(as); break;\r\n  case IRT_FLOAT: xo = XO_MOVSS; break;\r\n  default:\r\n    if (LJ_64 && irt_is64(ir->t))\r\n      dest |= REX_64;\r\n    else\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n    xo = XO_MOV;\r\n    break;\r\n  }\r\n  emit_mrm(as, xo, dest, RID_MRM);\r\n}\r\n\r\nstatic void asm_fxstore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg src = RID_NONE, osrc = RID_NONE;\r\n  int32_t k = 0;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  /* The IRT_I16/IRT_U16 stores should never be simplified for constant\r\n  ** values since mov word [mem], imm16 has a length-changing prefix.\r\n  */\r\n  if (irt_isi16(ir->t) || irt_isu16(ir->t) || irt_isfp(ir->t) ||\r\n      !asm_isk32(as, ir->op2, &k)) {\r\n    RegSet allow8 = irt_isfp(ir->t) ? RSET_FPR :\r\n\t\t    (irt_isi8(ir->t) || irt_isu8(ir->t)) ? RSET_GPR8 : RSET_GPR;\r\n    src = osrc = ra_alloc1(as, ir->op2, allow8);\r\n    if (!LJ_64 && !rset_test(allow8, src)) {  /* Already in wrong register. */\r\n      rset_clear(allow, osrc);\r\n      src = ra_scratch(as, allow8);\r\n    }\r\n    rset_clear(allow, src);\r\n  }\r\n  if (ir->o == IR_FSTORE) {\r\n    asm_fusefref(as, IR(ir->op1), allow);\r\n  } else {\r\n    asm_fusexref(as, ir->op1, allow);\r\n    if (LJ_32 && ir->o == IR_HIOP) as->mrm.ofs += 4;\r\n  }\r\n  if (ra_hasreg(src)) {\r\n    x86Op xo;\r\n    switch (irt_type(ir->t)) {\r\n    case IRT_I8: case IRT_U8: xo = XO_MOVtob; src |= FORCE_REX; break;\r\n    case IRT_I16: case IRT_U16: xo = XO_MOVtow; break;\r\n    case IRT_NUM: xo = XO_MOVSDto; break;\r\n    case IRT_FLOAT: xo = XO_MOVSSto; break;\r\n#if LJ_64\r\n    case IRT_LIGHTUD: lua_assert(0);  /* NYI: mask 64 bit lightuserdata. */\r\n#endif\r\n    default:\r\n      if (LJ_64 && irt_is64(ir->t))\r\n\tsrc |= REX_64;\r\n      else\r\n\tlua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n      xo = XO_MOVto;\r\n      break;\r\n    }\r\n    emit_mrm(as, xo, src, RID_MRM);\r\n    if (!LJ_64 && src != osrc) {\r\n      ra_noweak(as, osrc);\r\n      emit_rr(as, XO_MOV, src, osrc);\r\n    }\r\n  } else {\r\n    if (irt_isi8(ir->t) || irt_isu8(ir->t)) {\r\n      emit_i8(as, k);\r\n      emit_mrm(as, XO_MOVmib, 0, RID_MRM);\r\n    } else {\r\n      lua_assert(irt_is64(ir->t) || irt_isint(ir->t) || irt_isu32(ir->t) ||\r\n\t\t irt_isaddr(ir->t));\r\n      emit_i32(as, k);\r\n      emit_mrm(as, XO_MOVmi, REX_64IR(ir, 0), RID_MRM);\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_64\r\nstatic Reg asm_load_lightud64(ASMState *as, IRIns *ir, int typecheck)\r\n{\r\n  if (ra_used(ir) || typecheck) {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (typecheck) {\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_GPR, dest));\r\n      asm_guardcc(as, CC_NE);\r\n      emit_i8(as, -2);\r\n      emit_rr(as, XO_ARITHi8, XOg_CMP, tmp);\r\n      emit_shifti(as, XOg_SAR|REX_64, tmp, 47);\r\n      emit_rr(as, XO_MOV, tmp|REX_64, dest);\r\n    }\r\n    return dest;\r\n  } else {\r\n    return RID_NONE;\r\n  }\r\n}\r\n#endif\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  lua_assert(irt_isnum(ir->t) || irt_ispri(ir->t) || irt_isaddr(ir->t) ||\r\n\t     (LJ_DUALNUM && irt_isint(ir->t)));\r\n#if LJ_64\r\n  if (irt_islightud(ir->t)) {\r\n    Reg dest = asm_load_lightud64(as, ir, 1);\r\n    if (ra_hasreg(dest)) {\r\n      asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n      emit_mrm(as, XO_MOV, dest|REX_64, RID_MRM);\r\n    }\r\n    return;\r\n  } else\r\n#endif\r\n  if (ra_used(ir)) {\r\n    RegSet allow = irt_isnum(ir->t) ? RSET_FPR : RSET_GPR;\r\n    Reg dest = ra_dest(as, ir, allow);\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n    emit_mrm(as, dest < RID_MAX_GPR ? XO_MOV : XMM_MOVRM(as), dest, RID_MRM);\r\n  } else {\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n  }\r\n  /* Always do the type check, even if the load result is unused. */\r\n  as->mrm.ofs += 4;\r\n  asm_guardcc(as, irt_isnum(ir->t) ? CC_AE : CC_NE);\r\n  if (LJ_64 && irt_type(ir->t) >= IRT_NUM) {\r\n    lua_assert(irt_isinteger(ir->t) || irt_isnum(ir->t));\r\n    emit_u32(as, LJ_TISNUM);\r\n    emit_mrm(as, XO_ARITHi, XOg_CMP, RID_MRM);\r\n  } else {\r\n    emit_i8(as, irt_toitype(ir->t));\r\n    emit_mrm(as, XO_ARITHi8, XOg_CMP, RID_MRM);\r\n  }\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n    emit_mrm(as, XO_MOVSDto, src, RID_MRM);\r\n#if LJ_64\r\n  } else if (irt_islightud(ir->t)) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    asm_fuseahuref(as, ir->op1, rset_exclude(RSET_GPR, src));\r\n    emit_mrm(as, XO_MOVto, src|REX_64, RID_MRM);\r\n#endif\r\n  } else {\r\n    IRIns *irr = IR(ir->op2);\r\n    RegSet allow = RSET_GPR;\r\n    Reg src = RID_NONE;\r\n    if (!irref_isk(ir->op2)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n    }\r\n    asm_fuseahuref(as, ir->op1, allow);\r\n    if (ra_hasreg(src)) {\r\n      emit_mrm(as, XO_MOVto, src, RID_MRM);\r\n    } else if (!irt_ispri(irr->t)) {\r\n      lua_assert(irt_isaddr(ir->t) || (LJ_DUALNUM && irt_isinteger(ir->t)));\r\n      emit_i32(as, irr->i);\r\n      emit_mrm(as, XO_MOVmi, 0, RID_MRM);\r\n    }\r\n    as->mrm.ofs += 4;\r\n    emit_i32(as, (int32_t)irt_toitype(ir->t));\r\n    emit_mrm(as, XO_MOVmi, 0, RID_MRM);\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  IRType1 t = ir->t;\r\n  Reg base;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(LJ_DUALNUM ||\r\n\t     !irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    Reg left = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, left);  /* Frees dest reg. Do this before base alloc. */\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n    emit_rmro(as, XMM_MOVRM(as), left, base, ofs);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n#if LJ_64\r\n  } else if (irt_islightud(t)) {\r\n    Reg dest = asm_load_lightud64(as, ir, (ir->op2 & IRSLOAD_TYPECHECK));\r\n    if (ra_hasreg(dest)) {\r\n      base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n      emit_rmro(as, XO_MOV, dest|REX_64, base, ofs);\r\n    }\r\n    return;\r\n#endif\r\n  } else if (ra_used(ir)) {\r\n    RegSet allow = irt_isnum(t) ? RSET_FPR : RSET_GPR;\r\n    Reg dest = ra_dest(as, ir, allow);\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      t.irt = irt_isint(t) ? IRT_NUM : IRT_INT;  /* Check for original type. */\r\n      emit_rmro(as, irt_isint(t) ? XO_CVTSI2SD : XO_CVTSD2SI, dest, base, ofs);\r\n    } else if (irt_isnum(t)) {\r\n      emit_rmro(as, XMM_MOVRM(as), dest, base, ofs);\r\n    } else {\r\n      emit_rmro(as, XO_MOV, dest, base, ofs);\r\n    }\r\n  } else {\r\n    if (!(ir->op2 & IRSLOAD_TYPECHECK))\r\n      return;  /* No type check: avoid base alloc. */\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  }\r\n  if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n    /* Need type check, even if the load result is unused. */\r\n    asm_guardcc(as, irt_isnum(t) ? CC_AE : CC_NE);\r\n    if (LJ_64 && irt_type(t) >= IRT_NUM) {\r\n      lua_assert(irt_isinteger(t) || irt_isnum(t));\r\n      emit_u32(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi, XOg_CMP, base, ofs+4);\r\n    } else {\r\n      emit_i8(as, irt_toitype(t));\r\n      emit_rmro(as, XO_ARITHi8, XOg_CMP, base, ofs+4);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID ctypeid = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz = (ir->o == IR_CNEWI || ir->op2 == REF_NIL) ?\r\n\t      lj_ctype_size(cts, ctypeid) : (CTSize)IR(ir->op2)->i;\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[2];\r\n  lua_assert(sz != CTSIZE_INVALID);\r\n\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n#if LJ_64\r\n    Reg r64 = sz == 8 ? REX_64 : 0;\r\n    if (irref_isk(ir->op2)) {\r\n      IRIns *irk = IR(ir->op2);\r\n      uint64_t k = irk->o == IR_KINT64 ? ir_k64(irk)->u64 :\r\n\t\t\t\t\t (uint64_t)(uint32_t)irk->i;\r\n      if (sz == 4 || checki32((int64_t)k)) {\r\n\temit_i32(as, (int32_t)k);\r\n\temit_rmro(as, XO_MOVmi, r64, RID_RET, sizeof(GCcdata));\r\n      } else {\r\n\temit_movtomro(as, RID_ECX + r64, RID_RET, sizeof(GCcdata));\r\n\temit_loadu64(as, RID_ECX, k);\r\n      }\r\n    } else {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_movtomro(as, r + r64, RID_RET, sizeof(GCcdata));\r\n    }\r\n#else\r\n    int32_t ofs = sizeof(GCcdata);\r\n    if (sz == 8) {\r\n      ofs += 4; ir++;\r\n      lua_assert(ir->o == IR_HIOP);\r\n    }\r\n    do {\r\n      if (irref_isk(ir->op2)) {\r\n\temit_movmroi(as, RID_RET, ofs, IR(ir->op2)->i);\r\n      } else {\r\n\tReg r = ra_alloc1(as, ir->op2, allow);\r\n\temit_movtomro(as, r, RID_RET, ofs);\r\n\trset_clear(allow, r);\r\n      }\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir--;\r\n    } while (1);\r\n#endif\r\n    lua_assert(sz == 4 || sz == 8);\r\n  }\r\n\r\n  /* Combine initialization of marked, gct and ctypeid. */\r\n  emit_movtomro(as, RID_ECX, RID_RET, offsetof(GCcdata, marked));\r\n  emit_gri(as, XG_ARITHi(XOg_OR), RID_ECX,\r\n\t   (int32_t)((~LJ_TCDATA<<8)+(ctypeid<<16)));\r\n  emit_gri(as, XG_ARITHi(XOg_AND), RID_ECX, LJ_GC_WHITES);\r\n  emit_opgl(as, XO_MOVZXb, RID_ECX, gc.currentwhite);\r\n\r\n  asm_gencall(as, ci, args);\r\n  emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)(sz+sizeof(GCcdata)));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  MCLabel l_end = emit_label(as);\r\n  emit_movtomro(as, tmp, tab, offsetof(GCtab, gclist));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  emit_getgl(as, tmp, gc.grayagain);\r\n  emit_i8(as, ~LJ_GC_BLACK);\r\n  emit_rmro(as, XO_ARITHib, XOg_AND, tab, offsetof(GCtab, marked));\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_BLACK);\r\n  emit_rmro(as, XO_GROUP3b, XOg_TEST, tab, offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_loada(as, ra_releasetmp(as, ASMREF_TMP1), J2G(as->J));\r\n  obj = IR(ir->op1)->r;\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_WHITES);\r\n  if (irref_isk(ir->op2)) {\r\n    GCobj *vp = ir_kgc(IR(ir->op2));\r\n    emit_rma(as, XO_GROUP3b, XOg_TEST, &vp->gch.marked);\r\n  } else {\r\n    Reg val = ra_alloc1(as, ir->op2, rset_exclude(RSET_SCRATCH&RSET_GPR, obj));\r\n    emit_rmro(as, XO_GROUP3b, XOg_TEST, val, (int32_t)offsetof(GChead, marked));\r\n  }\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_BLACK);\r\n  emit_rmro(as, XO_GROUP3b, XOg_TEST, obj,\r\n\t    (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n}\r\n\r\n/* -- FP/int arithmetic and logic operations ------------------------------ */\r\n\r\n/* Load reference onto x87 stack. Force a spill to memory if needed. */\r\nstatic void asm_x87load(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_KNUM) {\r\n    cTValue *tv = ir_knum(ir);\r\n    if (tvispzero(tv))  /* Use fldz only for +0. */\r\n      emit_x87op(as, XI_FLDZ);\r\n    else if (tvispone(tv))\r\n      emit_x87op(as, XI_FLD1);\r\n    else\r\n      emit_rma(as, XO_FLDq, XOg_FLDq, tv);\r\n  } else if (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT && !ra_used(ir) &&\r\n\t     !irref_isk(ir->op1) && mayfuse(as, ir->op1)) {\r\n    IRIns *iri = IR(ir->op1);\r\n    emit_rmro(as, XO_FILDd, XOg_FILDd, RID_ESP, ra_spill(as, iri));\r\n  } else {\r\n    emit_mrm(as, XO_FLDq, XOg_FLDq, asm_fuseload(as, ref, RSET_EMPTY));\r\n  }\r\n}\r\n\r\n/* Try to rejoin pow from EXP2, MUL and LOG2 (if still unsplit). */\r\nstatic int fpmjoin_pow(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irp = IR(ir->op1);\r\n  if (irp == ir-1 && irp->o == IR_MUL && !ra_used(irp)) {\r\n    IRIns *irpp = IR(irp->op1);\r\n    if (irpp == ir-2 && irpp->o == IR_FPMATH &&\r\n\tirpp->op2 == IRFPM_LOG2 && !ra_used(irpp)) {\r\n      /* The modified regs must match with the *.dasc implementation. */\r\n      RegSet drop = RSET_RANGE(RID_XMM0, RID_XMM2+1)|RID2RSET(RID_EAX);\r\n      IRIns *irx;\r\n      if (ra_hasreg(ir->r))\r\n\trset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n      ra_evictset(as, drop);\r\n      ra_destreg(as, ir, RID_XMM0);\r\n      emit_call(as, lj_vm_pow_sse);\r\n      irx = IR(irpp->op1);\r\n      if (ra_noreg(irx->r) && ra_gethint(irx->r) == RID_XMM1)\r\n\tirx->r = RID_INIT;  /* Avoid allocating xmm1 for x. */\r\n      ra_left(as, RID_XMM0, irpp->op1);\r\n      ra_left(as, RID_XMM1, irp->op2);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void asm_fpmath(ASMState *as, IRIns *ir)\r\n{\r\n  IRFPMathOp fpm = ir->o == IR_FPMATH ? (IRFPMathOp)ir->op2 : IRFPM_OTHER;\r\n  if (fpm == IRFPM_SQRT) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg left = asm_fuseload(as, ir->op1, RSET_FPR);\r\n    emit_mrm(as, XO_SQRTSD, dest, left);\r\n  } else if (fpm <= IRFPM_TRUNC) {\r\n    if (as->flags & JIT_F_SSE4_1) {  /* SSE4.1 has a rounding instruction. */\r\n      Reg dest = ra_dest(as, ir, RSET_FPR);\r\n      Reg left = asm_fuseload(as, ir->op1, RSET_FPR);\r\n      /* ROUNDSD has a 4-byte opcode which doesn't fit in x86Op.\r\n      ** Let's pretend it's a 3-byte opcode, and compensate afterwards.\r\n      ** This is atrocious, but the alternatives are much worse.\r\n      */\r\n      /* Round down/up/trunc == 1001/1010/1011. */\r\n      emit_i8(as, 0x09 + fpm);\r\n      emit_mrm(as, XO_ROUNDSD, dest, left);\r\n      if (LJ_64 && as->mcp[1] != (MCode)(XO_ROUNDSD >> 16)) {\r\n\tas->mcp[0] = as->mcp[1]; as->mcp[1] = 0x0f;  /* Swap 0F and REX. */\r\n      }\r\n      *--as->mcp = 0x66;  /* 1st byte of ROUNDSD opcode. */\r\n    } else {  /* Call helper functions for SSE2 variant. */\r\n      /* The modified regs must match with the *.dasc implementation. */\r\n      RegSet drop = RSET_RANGE(RID_XMM0, RID_XMM3+1)|RID2RSET(RID_EAX);\r\n      if (ra_hasreg(ir->r))\r\n\trset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n      ra_evictset(as, drop);\r\n      ra_destreg(as, ir, RID_XMM0);\r\n      emit_call(as, fpm == IRFPM_FLOOR ? lj_vm_floor_sse :\r\n\t\t    fpm == IRFPM_CEIL ? lj_vm_ceil_sse : lj_vm_trunc_sse);\r\n      ra_left(as, RID_XMM0, ir->op1);\r\n    }\r\n  } else if (fpm == IRFPM_EXP2 && fpmjoin_pow(as, ir)) {\r\n    /* Rejoined to pow(). */\r\n  } else {  /* Handle x87 ops. */\r\n    int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n    Reg dest = ir->r;\r\n    if (ra_hasreg(dest)) {\r\n      ra_free(as, dest);\r\n      ra_modified(as, dest);\r\n      emit_rmro(as, XMM_MOVRM(as), dest, RID_ESP, ofs);\r\n    }\r\n    emit_rmro(as, XO_FSTPq, XOg_FSTPq, RID_ESP, ofs);\r\n    switch (fpm) {  /* st0 = lj_vm_*(st0) */\r\n    case IRFPM_EXP: emit_call(as, lj_vm_exp_x87); break;\r\n    case IRFPM_EXP2: emit_call(as, lj_vm_exp2_x87); break;\r\n    case IRFPM_SIN: emit_x87op(as, XI_FSIN); break;\r\n    case IRFPM_COS: emit_x87op(as, XI_FCOS); break;\r\n    case IRFPM_TAN: emit_x87op(as, XI_FPOP); emit_x87op(as, XI_FPTAN); break;\r\n    case IRFPM_LOG: case IRFPM_LOG2: case IRFPM_LOG10:\r\n      /* Note: the use of fyl2xp1 would be pointless here. When computing\r\n      ** log(1.0+eps) the precision is already lost after 1.0 is added.\r\n      ** Subtracting 1.0 won't recover it. OTOH math.log1p would make sense.\r\n      */\r\n      emit_x87op(as, XI_FYL2X); break;\r\n    case IRFPM_OTHER:\r\n      switch (ir->o) {\r\n      case IR_ATAN2:\r\n\temit_x87op(as, XI_FPATAN); asm_x87load(as, ir->op2); break;\r\n      case IR_LDEXP:\r\n\temit_x87op(as, XI_FPOP1); emit_x87op(as, XI_FSCALE); break;\r\n      default: lua_assert(0); break;\r\n      }\r\n      break;\r\n    default: lua_assert(0); break;\r\n    }\r\n    asm_x87load(as, ir->op1);\r\n    switch (fpm) {\r\n    case IRFPM_LOG: emit_x87op(as, XI_FLDLN2); break;\r\n    case IRFPM_LOG2: emit_x87op(as, XI_FLD1); break;\r\n    case IRFPM_LOG10: emit_x87op(as, XI_FLDLG2); break;\r\n    case IRFPM_OTHER:\r\n      if (ir->o == IR_LDEXP) asm_x87load(as, ir->op2);\r\n      break;\r\n    default: break;\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_fppowi(ASMState *as, IRIns *ir)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RSET_RANGE(RID_XMM0, RID_XMM1+1)|RID2RSET(RID_EAX);\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  ra_destreg(as, ir, RID_XMM0);\r\n  emit_call(as, lj_vm_powi_sse);\r\n  ra_left(as, RID_XMM0, ir->op1);\r\n  ra_left(as, RID_EAX, ir->op2);\r\n}\r\n\r\n#if LJ_64 && LJ_HASFFI\r\nstatic void asm_arith64(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n#endif\r\n\r\nstatic void asm_intmod(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_vm_modi];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic int asm_swapops(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  lua_assert(ra_noreg(irr->r));\r\n  if (!irm_iscomm(lj_ir_mode[ir->o]))\r\n    return 0;  /* Can't swap non-commutative operations. */\r\n  if (irref_isk(ir->op2))\r\n    return 0;  /* Don't swap constants to the left. */\r\n  if (ra_hasreg(irl->r))\r\n    return 1;  /* Swap if left already has a register. */\r\n  if (ra_samehint(ir->r, irr->r))\r\n    return 1;  /* Swap if dest and right have matching hints. */\r\n  if (as->curins > as->loopref) {  /* In variant part? */\r\n    if (ir->op2 < as->loopref && !irt_isphi(irr->t))\r\n      return 0;  /* Keep invariants on the right. */\r\n    if (ir->op1 < as->loopref && !irt_isphi(irl->t))\r\n      return 1;  /* Swap invariants to the right. */\r\n  }\r\n  if (opisfusableload(irl->o))\r\n    return 1;  /* Swap fusable loads to the right. */\r\n  return 0;  /* Otherwise don't swap. */\r\n}\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, x86Op xo)\r\n{\r\n  IRRef lref = ir->op1;\r\n  IRRef rref = ir->op2;\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest;\r\n  Reg right = IR(rref)->r;\r\n  if (ra_hasreg(right)) {\r\n    rset_clear(allow, right);\r\n    ra_noweak(as, right);\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  if (lref == rref) {\r\n    right = dest;\r\n  } else if (ra_noreg(right)) {\r\n    if (asm_swapops(as, ir)) {\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n    }\r\n    right = asm_fuseload(as, rref, rset_clear(allow, dest));\r\n  }\r\n  emit_mrm(as, xo, dest, right);\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\nstatic void asm_intarith(ASMState *as, IRIns *ir, x86Arith xa)\r\n{\r\n  IRRef lref = ir->op1;\r\n  IRRef rref = ir->op2;\r\n  RegSet allow = RSET_GPR;\r\n  Reg dest, right;\r\n  int32_t k = 0;\r\n  if (as->flagmcp == as->mcp) {  /* Drop test r,r instruction. */\r\n    MCode *p = as->mcp + ((LJ_64 && *as->mcp < XI_TESTb) ? 3 : 2);\r\n    if ((p[1] & 15) < 14) {\r\n      if ((p[1] & 15) >= 12) p[1] -= 4;  /* L <->S, NL <-> NS */\r\n      as->flagmcp = NULL;\r\n      as->mcp = p;\r\n    }  /* else: cannot transform LE/NLE to cc without use of OF. */\r\n  }\r\n  right = IR(rref)->r;\r\n  if (ra_hasreg(right)) {\r\n    rset_clear(allow, right);\r\n    ra_noweak(as, right);\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  if (lref == rref) {\r\n    right = dest;\r\n  } else if (ra_noreg(right) && !asm_isk32(as, rref, &k)) {\r\n    if (asm_swapops(as, ir)) {\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n    }\r\n    right = asm_fuseloadm(as, rref, rset_clear(allow, dest), irt_is64(ir->t));\r\n  }\r\n  if (irt_isguard(ir->t))  /* For IR_ADDOV etc. */\r\n    asm_guardcc(as, CC_O);\r\n  if (xa != XOg_X_IMUL) {\r\n    if (ra_hasreg(right))\r\n      emit_mrm(as, XO_ARITH(xa), REX_64IR(ir, dest), right);\r\n    else\r\n      emit_gri(as, XG_ARITHi(xa), REX_64IR(ir, dest), k);\r\n  } else if (ra_hasreg(right)) {  /* IMUL r, mrm. */\r\n    emit_mrm(as, XO_IMUL, REX_64IR(ir, dest), right);\r\n  } else {  /* IMUL r, r, k. */\r\n    /* NYI: use lea/shl/add/sub (FOLD only does 2^k) depending on CPU. */\r\n    Reg left = asm_fuseloadm(as, lref, RSET_GPR, irt_is64(ir->t));\r\n    x86Op xo;\r\n    if (checki8(k)) { emit_i8(as, k); xo = XO_IMULi8;\r\n    } else { emit_i32(as, k); xo = XO_IMULi; }\r\n    emit_mrm(as, xo, REX_64IR(ir, dest), left);\r\n    return;\r\n  }\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\n/* LEA is really a 4-operand ADD with an independent destination register,\r\n** up to two source registers and an immediate. One register can be scaled\r\n** by 1, 2, 4 or 8. This can be used to avoid moves or to fuse several\r\n** instructions.\r\n**\r\n** Currently only a few common cases are supported:\r\n** - 3-operand ADD:    y = a+b; y = a+k   with a and b already allocated\r\n** - Left ADD fusion:  y = (a+b)+k; y = (a+k)+b\r\n** - Right ADD fusion: y = a+(b+k)\r\n** The ommited variants have already been reduced by FOLD.\r\n**\r\n** There are more fusion opportunities, like gathering shifts or joining\r\n** common references. But these are probably not worth the trouble, since\r\n** array indexing is not decomposed and already makes use of all fields\r\n** of the ModRM operand.\r\n*/\r\nstatic int asm_lea(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  RegSet allow = RSET_GPR;\r\n  Reg dest;\r\n  as->mrm.base = as->mrm.idx = RID_NONE;\r\n  as->mrm.scale = XM_SCALE1;\r\n  as->mrm.ofs = 0;\r\n  if (ra_hasreg(irl->r)) {\r\n    rset_clear(allow, irl->r);\r\n    ra_noweak(as, irl->r);\r\n    as->mrm.base = irl->r;\r\n    if (irref_isk(ir->op2) || ra_hasreg(irr->r)) {\r\n      /* The PHI renaming logic does a better job in some cases. */\r\n      if (ra_hasreg(ir->r) &&\r\n\t  ((irt_isphi(irl->t) && as->phireg[ir->r] == ir->op1) ||\r\n\t   (irt_isphi(irr->t) && as->phireg[ir->r] == ir->op2)))\r\n\treturn 0;\r\n      if (irref_isk(ir->op2)) {\r\n\tas->mrm.ofs = irr->i;\r\n      } else {\r\n\trset_clear(allow, irr->r);\r\n\tra_noweak(as, irr->r);\r\n\tas->mrm.idx = irr->r;\r\n      }\r\n    } else if (irr->o == IR_ADD && mayfuse(as, ir->op2) &&\r\n\t       irref_isk(irr->op2)) {\r\n      Reg idx = ra_alloc1(as, irr->op1, allow);\r\n      rset_clear(allow, idx);\r\n      as->mrm.idx = (uint8_t)idx;\r\n      as->mrm.ofs = IR(irr->op2)->i;\r\n    } else {\r\n      return 0;\r\n    }\r\n  } else if (ir->op1 != ir->op2 && irl->o == IR_ADD && mayfuse(as, ir->op1) &&\r\n\t     (irref_isk(ir->op2) || irref_isk(irl->op2))) {\r\n    Reg idx, base = ra_alloc1(as, irl->op1, allow);\r\n    rset_clear(allow, base);\r\n    as->mrm.base = (uint8_t)base;\r\n    if (irref_isk(ir->op2)) {\r\n      as->mrm.ofs = irr->i;\r\n      idx = ra_alloc1(as, irl->op2, allow);\r\n    } else {\r\n      as->mrm.ofs = IR(irl->op2)->i;\r\n      idx = ra_alloc1(as, ir->op2, allow);\r\n    }\r\n    rset_clear(allow, idx);\r\n    as->mrm.idx = (uint8_t)idx;\r\n  } else {\r\n    return 0;\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n  return 1;  /* Success. */\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_ADDSD);\r\n  else if ((as->flags & JIT_F_LEA_AGU) || as->flagmcp == as->mcp ||\r\n\t   irt_is64(ir->t) || !asm_lea(as, ir))\r\n    asm_intarith(as, ir, XOg_ADD);\r\n}\r\n\r\nstatic void asm_neg_not(ASMState *as, IRIns *ir, x86Group3 xg)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  emit_rr(as, XO_GROUP3, REX_64IR(ir, xg), dest);\r\n  ra_left(as, dest, ir->op1);\r\n}\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  Reg right, dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  if (irref_isk(rref)) { lref = rref; rref = ir->op1; }\r\n  right = ra_alloc1(as, rref, rset_exclude(RSET_GPR, dest));\r\n  emit_rr(as, XO_CMOV + (cc<<24), REX_64IR(ir, dest), right);\r\n  emit_rr(as, XO_CMP, REX_64IR(ir, dest), right);\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\nstatic void asm_bitswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  as->mcp = emit_op(XO_BSWAP + ((dest&7) << 24),\r\n\t\t    REX_64IR(ir, 0), dest, 0, as->mcp, 1);\r\n  ra_left(as, dest, ir->op1);\r\n}\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, x86Shift xs)\r\n{\r\n  IRRef rref = ir->op2;\r\n  IRIns *irr = IR(rref);\r\n  Reg dest;\r\n  if (irref_isk(rref)) {  /* Constant shifts. */\r\n    int shift;\r\n    dest = ra_dest(as, ir, RSET_GPR);\r\n    shift = irr->i & (irt_is64(ir->t) ? 63 : 31);\r\n    switch (shift) {\r\n    case 0: break;\r\n    case 1: emit_rr(as, XO_SHIFT1, REX_64IR(ir, xs), dest); break;\r\n    default: emit_shifti(as, REX_64IR(ir, xs), dest, shift); break;\r\n    }\r\n  } else {  /* Variable shifts implicitly use register cl (i.e. ecx). */\r\n    Reg right;\r\n    dest = ra_dest(as, ir, rset_exclude(RSET_GPR, RID_ECX));\r\n    if (dest == RID_ECX) {\r\n      dest = ra_scratch(as, rset_exclude(RSET_GPR, RID_ECX));\r\n      emit_rr(as, XO_MOV, RID_ECX, dest);\r\n    }\r\n    right = irr->r;\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, rref, RID2RSET(RID_ECX));\r\n    else if (right != RID_ECX)\r\n      ra_scratch(as, RID2RSET(RID_ECX));\r\n    emit_rr(as, XO_SHIFTcl, REX_64IR(ir, xs), dest);\r\n    ra_noweak(as, right);\r\n    if (right != RID_ECX)\r\n      emit_rr(as, XO_MOV, RID_ECX, right);\r\n  }\r\n  ra_left(as, dest, ir->op1);\r\n  /*\r\n  ** Note: avoid using the flags resulting from a shift or rotate!\r\n  ** All of them cause a partial flag stall, except for r,1 shifts\r\n  ** (but not rotates). And a shift count of 0 leaves the flags unmodified.\r\n  */\r\n}\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n/* Virtual flags for unordered FP comparisons. */\r\n#define VCC_U\t0x1000\t\t/* Unordered. */\r\n#define VCC_P\t0x2000\t\t/* Needs extra CC_P branch. */\r\n#define VCC_S\t0x4000\t\t/* Swap avoids CC_P branch. */\r\n#define VCC_PS\t(VCC_P|VCC_S)\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\n#define COMPFLAGS(ci, cin, cu, cf)\t((ci)+((cu)<<4)+((cin)<<8)+(cf))\r\nstatic const uint16_t asm_compmap[IR_ABC+1] = {\r\n  /*                 signed non-eq unsigned flags */\r\n  /* LT  */ COMPFLAGS(CC_GE, CC_G,  CC_AE, VCC_PS),\r\n  /* GE  */ COMPFLAGS(CC_L,  CC_L,  CC_B,  0),\r\n  /* LE  */ COMPFLAGS(CC_G,  CC_G,  CC_A,  VCC_PS),\r\n  /* GT  */ COMPFLAGS(CC_LE, CC_L,  CC_BE, 0),\r\n  /* ULT */ COMPFLAGS(CC_AE, CC_A,  CC_AE, VCC_U),\r\n  /* UGE */ COMPFLAGS(CC_B,  CC_B,  CC_B,  VCC_U|VCC_PS),\r\n  /* ULE */ COMPFLAGS(CC_A,  CC_A,  CC_A,  VCC_U),\r\n  /* UGT */ COMPFLAGS(CC_BE, CC_B,  CC_BE, VCC_U|VCC_PS),\r\n  /* EQ  */ COMPFLAGS(CC_NE, CC_NE, CC_NE, VCC_P),\r\n  /* NE  */ COMPFLAGS(CC_E,  CC_E,  CC_E,  VCC_U|VCC_P),\r\n  /* ABC */ COMPFLAGS(CC_BE, CC_B,  CC_BE, VCC_U|VCC_PS)  /* Same as UGT. */\r\n};\r\n\r\n/* FP and integer comparisons. */\r\nstatic void asm_comp(ASMState *as, IRIns *ir, uint32_t cc)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    IRRef lref = ir->op1;\r\n    IRRef rref = ir->op2;\r\n    Reg left, right;\r\n    MCLabel l_around;\r\n    /*\r\n    ** An extra CC_P branch is required to preserve ordered/unordered\r\n    ** semantics for FP comparisons. This can be avoided by swapping\r\n    ** the operands and inverting the condition (except for EQ and UNE).\r\n    ** So always try to swap if possible.\r\n    **\r\n    ** Another option would be to swap operands to achieve better memory\r\n    ** operand fusion. But it's unlikely that this outweighs the cost\r\n    ** of the extra branches.\r\n    */\r\n    if (cc & VCC_S) {  /* Swap? */\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n      cc ^= (VCC_PS|(5<<4));  /* A <-> B, AE <-> BE, PS <-> none */\r\n    }\r\n    left = ra_alloc1(as, lref, RSET_FPR);\r\n    right = asm_fuseload(as, rref, rset_exclude(RSET_FPR, left));\r\n    l_around = emit_label(as);\r\n    asm_guardcc(as, cc >> 4);\r\n    if (cc & VCC_P) {  /* Extra CC_P branch required? */\r\n      if (!(cc & VCC_U)) {\r\n\tasm_guardcc(as, CC_P);  /* Branch to exit for ordered comparisons. */\r\n      } else if (l_around != as->invmcp) {\r\n\temit_sjcc(as, CC_P, l_around);  /* Branch around for unordered. */\r\n      } else {\r\n\t/* Patched to mcloop by asm_loop_fixup. */\r\n\tas->loopinv = 2;\r\n\tif (as->realign)\r\n\t  emit_sjcc(as, CC_P, as->mcp);\r\n\telse\r\n\t  emit_jcc(as, CC_P, as->mcp);\r\n      }\r\n    }\r\n    emit_mrm(as, XO_UCOMISD, left, right);\r\n  } else {\r\n    IRRef lref = ir->op1, rref = ir->op2;\r\n    IROp leftop = (IROp)(IR(lref)->o);\r\n    Reg r64 = REX_64IR(ir, 0);\r\n    int32_t imm = 0;\r\n    lua_assert(irt_is64(ir->t) || irt_isint(ir->t) ||\r\n\t       irt_isu32(ir->t) || irt_isaddr(ir->t) || irt_isu8(ir->t));\r\n    /* Swap constants (only for ABC) and fusable loads to the right. */\r\n    if (irref_isk(lref) || (!irref_isk(rref) && opisfusableload(leftop))) {\r\n      if ((cc & 0xc) == 0xc) cc ^= 0x53;  /* L <-> G, LE <-> GE */\r\n      else if ((cc & 0xa) == 0x2) cc ^= 0x55;  /* A <-> B, AE <-> BE */\r\n      lref = ir->op2; rref = ir->op1;\r\n    }\r\n    if (asm_isk32(as, rref, &imm)) {\r\n      IRIns *irl = IR(lref);\r\n      /* Check wether we can use test ins. Not for unsigned, since CF=0. */\r\n      int usetest = (imm == 0 && (cc & 0xa) != 0x2);\r\n      if (usetest && irl->o == IR_BAND && irl+1 == ir && !ra_used(irl)) {\r\n\t/* Combine comp(BAND(ref, r/imm), 0) into test mrm, r/imm. */\r\n\tReg right, left = RID_NONE;\r\n\tRegSet allow = RSET_GPR;\r\n\tif (!asm_isk32(as, irl->op2, &imm)) {\r\n\t  left = ra_alloc1(as, irl->op2, allow);\r\n\t  rset_clear(allow, left);\r\n\t} else {  /* Try to Fuse IRT_I8/IRT_U8 loads, too. See below. */\r\n\t  IRIns *irll = IR(irl->op1);\r\n\t  if (opisfusableload((IROp)irll->o) &&\r\n\t      (irt_isi8(irll->t) || irt_isu8(irll->t))) {\r\n\t    IRType1 origt = irll->t;  /* Temporarily flip types. */\r\n\t    irll->t.irt = (irll->t.irt & ~IRT_TYPE) | IRT_INT;\r\n\t    as->curins--;  /* Skip to BAND to avoid failing in noconflict(). */\r\n\t    right = asm_fuseload(as, irl->op1, RSET_GPR);\r\n\t    as->curins++;\r\n\t    irll->t = origt;\r\n\t    if (right != RID_MRM) goto test_nofuse;\r\n\t    /* Fusion succeeded, emit test byte mrm, imm8. */\r\n\t    asm_guardcc(as, cc);\r\n\t    emit_i8(as, (imm & 0xff));\r\n\t    emit_mrm(as, XO_GROUP3b, XOg_TEST, RID_MRM);\r\n\t    return;\r\n\t  }\r\n\t}\r\n\tas->curins--;  /* Skip to BAND to avoid failing in noconflict(). */\r\n\tright = asm_fuseloadm(as, irl->op1, allow, r64);\r\n\tas->curins++;  /* Undo the above. */\r\n      test_nofuse:\r\n\tasm_guardcc(as, cc);\r\n\tif (ra_noreg(left)) {\r\n\t  emit_i32(as, imm);\r\n\t  emit_mrm(as, XO_GROUP3, r64 + XOg_TEST, right);\r\n\t} else {\r\n\t  emit_mrm(as, XO_TEST, r64 + left, right);\r\n\t}\r\n      } else {\r\n\tReg left;\r\n\tif (opisfusableload((IROp)irl->o) &&\r\n\t    ((irt_isu8(irl->t) && checku8(imm)) ||\r\n\t     ((irt_isi8(irl->t) || irt_isi16(irl->t)) && checki8(imm)) ||\r\n\t     (irt_isu16(irl->t) && checku16(imm) && checki8((int16_t)imm)))) {\r\n\t  /* Only the IRT_INT case is fused by asm_fuseload.\r\n\t  ** The IRT_I8/IRT_U8 loads and some IRT_I16/IRT_U16 loads\r\n\t  ** are handled here.\r\n\t  ** Note that cmp word [mem], imm16 should not be generated,\r\n\t  ** since it has a length-changing prefix. Compares of a word\r\n\t  ** against a sign-extended imm8 are ok, however.\r\n\t  */\r\n\t  IRType1 origt = irl->t;  /* Temporarily flip types. */\r\n\t  irl->t.irt = (irl->t.irt & ~IRT_TYPE) | IRT_INT;\r\n\t  left = asm_fuseload(as, lref, RSET_GPR);\r\n\t  irl->t = origt;\r\n\t  if (left == RID_MRM) {  /* Fusion succeeded? */\r\n\t    if (irt_isu8(irl->t) || irt_isu16(irl->t))\r\n\t      cc >>= 4;  /* Need unsigned compare. */\r\n\t    asm_guardcc(as, cc);\r\n\t    emit_i8(as, imm);\r\n\t    emit_mrm(as, (irt_isi8(origt) || irt_isu8(origt)) ?\r\n\t\t\t XO_ARITHib : XO_ARITHiw8, r64 + XOg_CMP, RID_MRM);\r\n\t    return;\r\n\t  }  /* Otherwise handle register case as usual. */\r\n\t} else {\r\n\t  left = asm_fuseloadm(as, lref,\r\n\t\t\t       irt_isu8(ir->t) ? RSET_GPR8 : RSET_GPR, r64);\r\n\t}\r\n\tasm_guardcc(as, cc);\r\n\tif (usetest && left != RID_MRM) {\r\n\t  /* Use test r,r instead of cmp r,0. */\r\n\t  x86Op xo = XO_TEST;\r\n\t  if (irt_isu8(ir->t)) {\r\n\t    lua_assert(ir->o == IR_EQ || ir->o == IR_NE);\r\n\t    xo = XO_TESTb;\r\n\t    if (!rset_test(RSET_RANGE(RID_EAX, RID_EBX+1), left)) {\r\n\t      if (LJ_64) {\r\n\t\tleft |= FORCE_REX;\r\n\t      } else {\r\n\t\temit_i32(as, 0xff);\r\n\t\temit_mrm(as, XO_GROUP3, XOg_TEST, left);\r\n\t\treturn;\r\n\t      }\r\n\t    }\r\n\t  }\r\n\t  emit_rr(as, xo, r64 + left, left);\r\n\t  if (irl+1 == ir)  /* Referencing previous ins? */\r\n\t    as->flagmcp = as->mcp;  /* Set flag to drop test r,r if possible. */\r\n\t} else {\r\n\t  emit_gmrmi(as, XG_ARITHi(XOg_CMP), r64 + left, imm);\r\n\t}\r\n      }\r\n    } else {\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      Reg right = asm_fuseloadm(as, rref, rset_exclude(RSET_GPR, left), r64);\r\n      asm_guardcc(as, cc);\r\n      emit_mrm(as, XO_CMP, r64 + left, right);\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* 64 bit integer comparisons in 32 bit mode. */\r\nstatic void asm_comp_int64(ASMState *as, IRIns *ir)\r\n{\r\n  uint32_t cc = asm_compmap[(ir-1)->o];\r\n  RegSet allow = RSET_GPR;\r\n  Reg lefthi = RID_NONE, leftlo = RID_NONE;\r\n  Reg righthi = RID_NONE, rightlo = RID_NONE;\r\n  MCLabel l_around;\r\n  x86ModRM mrm;\r\n\r\n  as->curins--;  /* Skip loword ins. Avoids failing in noconflict(), too. */\r\n\r\n  /* Allocate/fuse hiword operands. */\r\n  if (irref_isk(ir->op2)) {\r\n    lefthi = asm_fuseload(as, ir->op1, allow);\r\n  } else {\r\n    lefthi = ra_alloc1(as, ir->op1, allow);\r\n    rset_clear(allow, lefthi);\r\n    righthi = asm_fuseload(as, ir->op2, allow);\r\n    if (righthi == RID_MRM) {\r\n      if (as->mrm.base != RID_NONE) rset_clear(allow, as->mrm.base);\r\n      if (as->mrm.idx != RID_NONE) rset_clear(allow, as->mrm.idx);\r\n    } else {\r\n      rset_clear(allow, righthi);\r\n    }\r\n  }\r\n  mrm = as->mrm;  /* Save state for hiword instruction. */\r\n\r\n  /* Allocate/fuse loword operands. */\r\n  if (irref_isk((ir-1)->op2)) {\r\n    leftlo = asm_fuseload(as, (ir-1)->op1, allow);\r\n  } else {\r\n    leftlo = ra_alloc1(as, (ir-1)->op1, allow);\r\n    rset_clear(allow, leftlo);\r\n    rightlo = asm_fuseload(as, (ir-1)->op2, allow);\r\n  }\r\n\r\n  /* All register allocations must be performed _before_ this point. */\r\n  l_around = emit_label(as);\r\n  as->invmcp = as->flagmcp = NULL;  /* Cannot use these optimizations. */\r\n\r\n  /* Loword comparison and branch. */\r\n  asm_guardcc(as, cc >> 4);  /* Always use unsigned compare for loword. */\r\n  if (ra_noreg(rightlo)) {\r\n    int32_t imm = IR((ir-1)->op2)->i;\r\n    if (imm == 0 && ((cc >> 4) & 0xa) != 0x2 && leftlo != RID_MRM)\r\n      emit_rr(as, XO_TEST, leftlo, leftlo);\r\n    else\r\n      emit_gmrmi(as, XG_ARITHi(XOg_CMP), leftlo, imm);\r\n  } else {\r\n    emit_mrm(as, XO_CMP, leftlo, rightlo);\r\n  }\r\n\r\n  /* Hiword comparison and branches. */\r\n  if ((cc & 15) != CC_NE)\r\n    emit_sjcc(as, CC_NE, l_around);  /* Hiword unequal: skip loword compare. */\r\n  if ((cc & 15) != CC_E)\r\n    asm_guardcc(as, cc >> 8);  /* Hiword compare without equality check. */\r\n  as->mrm = mrm;  /* Restore state. */\r\n  if (ra_noreg(righthi)) {\r\n    int32_t imm = IR(ir->op2)->i;\r\n    if (imm == 0 && (cc & 0xa) != 0x2 && lefthi != RID_MRM)\r\n      emit_rr(as, XO_TEST, lefthi, lefthi);\r\n    else\r\n      emit_gmrmi(as, XG_ARITHi(XOg_CMP), lefthi, imm);\r\n  } else {\r\n    emit_mrm(as, XO_CMP, lefthi, righthi);\r\n  }\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_32 && LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    if (usehi || uselo) {\r\n      if (irt_isfp(ir->t))\r\n\tasm_conv_fp_int64(as, ir);\r\n      else\r\n\tasm_conv_int64_fp(as, ir);\r\n    }\r\n    as->curins--;  /* Always skip the CONV. */\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    asm_comp_int64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    if ((ir-1)->r != RID_SINK)\r\n      asm_fxstore(as, ir);\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD:\r\n    as->flagmcp = NULL;\r\n    as->curins--;\r\n    asm_intarith(as, ir, XOg_ADC);\r\n    asm_intarith(as, ir-1, XOg_ADD);\r\n    break;\r\n  case IR_SUB:\r\n    as->flagmcp = NULL;\r\n    as->curins--;\r\n    asm_intarith(as, ir, XOg_SBB);\r\n    asm_intarith(as, ir-1, XOg_SUB);\r\n    break;\r\n  case IR_NEG: {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    emit_rr(as, XO_GROUP3, XOg_NEG, dest);\r\n    emit_i8(as, 0);\r\n    emit_rr(as, XO_ARITHi8, XOg_ADC, dest);\r\n    ra_left(as, dest, ir->op1);\r\n    as->curins--;\r\n    asm_neg_not(as, ir-1, XOg_NEG);\r\n    break;\r\n    }\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by CNEWI itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused on x64 or without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore eax. */\r\n  Reg pbase = irp ? irp->r : RID_BASE;\r\n  Reg r = allow ? rset_pickbot(allow) : RID_EAX;\r\n  emit_jcc(as, CC_B, exitstub_addr(as->J, exitno));\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_rmro(as, XO_MOV, r|REX_64, RID_ESP, 0);\r\n  else\r\n    ra_modified(as, r);\r\n  emit_gri(as, XG_ARITHi(XOg_CMP), r, (int32_t)(8*topslot));\r\n  if (ra_hasreg(pbase) && pbase != r)\r\n    emit_rr(as, XO_ARITH(XOg_SUB), r, pbase);\r\n  else\r\n    emit_rmro(as, XO_ARITH(XOg_SUB), r, RID_NONE,\r\n\t      ptr2addr(&J2G(as->J)->jit_base));\r\n  emit_rmro(as, XO_MOV, r, r, offsetof(lua_State, maxstack));\r\n  emit_getgl(as, r, jit_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_rmro(as, XO_MOVto, r|REX_64, RID_ESP, 0);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_rmro(as, XO_MOVSDto, src, RID_BASE, ofs);\r\n    } else {\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) ||\r\n\t\t (LJ_DUALNUM && irt_isinteger(ir->t)));\r\n      if (!irref_isk(ref)) {\r\n\tReg src = ra_alloc1(as, ref, rset_exclude(RSET_GPR, RID_BASE));\r\n\temit_movtomro(as, REX_64IR(ir, src), RID_BASE, ofs);\r\n      } else if (!irt_ispri(ir->t)) {\r\n\temit_movmroi(as, RID_BASE, ofs, ir->i);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s != 0)  /* Do not overwrite link to previous frame. */\r\n\t  emit_movmroi(as, RID_BASE, ofs+4, (int32_t)(*flinks--));\r\n      } else {\r\n\tif (!(LJ_64 && irt_islightud(ir->t)))\r\n\t  emit_movmroi(as, RID_BASE, ofs+4, irt_toitype(ir->t));\r\n      }\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_rr(as, XO_TEST, RID_RET, RID_RET);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n  emit_loada(as, tmp, J2G(as->J));\r\n  emit_loadi(as, ra_releasetmp(as, ASMREF_TMP2), as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_sjcc(as, CC_B, l_end);\r\n  emit_opgl(as, XO_ARITH(XOg_CMP), tmp, gc.threshold);\r\n  emit_getgl(as, tmp, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->realign) {  /* Realigned loops use short jumps. */\r\n    as->realign = NULL;  /* Stop another retry. */\r\n    lua_assert(((intptr_t)target & 15) == 0);\r\n    if (as->loopinv) {  /* Inverted loop branch? */\r\n      p -= 5;\r\n      p[0] = XI_JMP;\r\n      lua_assert(target - p >= -128);\r\n      p[-1] = (MCode)(target - p);  /* Patch sjcc. */\r\n      if (as->loopinv == 2)\r\n\tp[-3] = (MCode)(target - p + 2);  /* Patch opt. short jp. */\r\n    } else {\r\n      lua_assert(target - p >= -128);\r\n      p[-1] = (MCode)(int8_t)(target - p);  /* Patch short jmp. */\r\n      p[-2] = XI_JMPs;\r\n    }\r\n  } else {\r\n    MCode *newloop;\r\n    p[-5] = XI_JMP;\r\n    if (as->loopinv) {  /* Inverted loop branch? */\r\n      /* asm_guardcc already inverted the jcc and patched the jmp. */\r\n      p -= 5;\r\n      newloop = target+4;\r\n      *(int32_t *)(p-4) = (int32_t)(target - p);  /* Patch jcc. */\r\n      if (as->loopinv == 2) {\r\n\t*(int32_t *)(p-10) = (int32_t)(target - p + 6);  /* Patch opt. jp. */\r\n\tnewloop = target+8;\r\n      }\r\n    } else {  /* Otherwise just patch jmp. */\r\n      *(int32_t *)(p-4) = (int32_t)(target - p);\r\n      newloop = target+3;\r\n    }\r\n    /* Realign small loops and shorten the loop branch. */\r\n    if (newloop >= p - 128) {\r\n      as->realign = newloop;  /* Force a retry and remember alignment. */\r\n      as->curins = as->stopins;  /* Abort asm_trace now. */\r\n      as->T->nins = as->orignins;  /* Remove any added renames. */\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_rr(as, XO_MOV, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce or reload BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_rr(as, XO_MOV, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  /* Note: don't use as->mcp swap + emit_*: emit_op overwrites more bytes. */\r\n  MCode *p = as->mctop;\r\n  MCode *target, *q;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    p -= ((as->flags & JIT_F_LEA_AGU) ? 7 : 6) + (LJ_64 ? 1 : 0);\r\n  } else {\r\n    MCode *p1;\r\n    /* Patch stack adjustment. */\r\n    if (checki8(spadj)) {\r\n      p -= 3;\r\n      p1 = p-6;\r\n      *p1 = (MCode)spadj;\r\n    } else {\r\n      p1 = p-9;\r\n      *(int32_t *)p1 = spadj;\r\n    }\r\n    if ((as->flags & JIT_F_LEA_AGU)) {\r\n#if LJ_64\r\n      p1[-4] = 0x48;\r\n#endif\r\n      p1[-3] = (MCode)XI_LEA;\r\n      p1[-2] = MODRM(checki8(spadj) ? XM_OFS8 : XM_OFS32, RID_ESP, RID_ESP);\r\n      p1[-1] = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n    } else {\r\n#if LJ_64\r\n      p1[-3] = 0x48;\r\n#endif\r\n      p1[-2] = (MCode)(checki8(spadj) ? XI_ARITHi8 : XI_ARITHi);\r\n      p1[-1] = MODRM(XM_REG, XOg_ADD, RID_ESP);\r\n    }\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_JMP;\r\n  /* Drop unused mcode tail. Fill with NOPs to make the prefetcher happy. */\r\n  for (q = as->mctop-1; q >= p; q--)\r\n    *q = XI_NOP;\r\n  as->mctop = p;\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  /* Realign and leave room for backwards loop branch or exit branch. */\r\n  if (as->realign) {\r\n    int i = ((int)(intptr_t)as->realign) & 15;\r\n    /* Fill unused mcode tail with NOPs to make the prefetcher happy. */\r\n    while (i-- > 0)\r\n      *--p = XI_NOP;\r\n    as->mctop = p;\r\n    p -= (as->loopinv ? 5 : 2);  /* Space for short/near jmp. */\r\n  } else {\r\n    p -= 5;  /* Space for exit branch (near jmp). */\r\n  }\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    /* Leave room for ESP adjustment: add esp, imm or lea esp, [esp+imm] */\r\n    as->mcp = p - (((as->flags & JIT_F_LEA_AGU) ? 7 : 6)  + (LJ_64 ? 1 : 0));\r\n    as->invmcp = NULL;\r\n  }\r\n}\r\n\r\n/* -- Instruction dispatch ------------------------------------------------ */\r\n\r\n/* Assemble a single instruction. */\r\nstatic void asm_ir(ASMState *as, IRIns *ir)\r\n{\r\n  switch ((IROp)ir->o) {\r\n  /* Miscellaneous ops. */\r\n  case IR_LOOP: asm_loop(as); break;\r\n  case IR_NOP: case IR_XBAR: lua_assert(!ra_used(ir)); break;\r\n  case IR_USE:\r\n    ra_alloc1(as, ir->op1, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR); break;\r\n  case IR_PHI: asm_phi(as, ir); break;\r\n  case IR_HIOP: asm_hiop(as, ir); break;\r\n  case IR_GCSTEP: asm_gcstep(as, ir); break;\r\n\r\n  /* Guarded assertions. */\r\n  case IR_LT: case IR_GE: case IR_LE: case IR_GT:\r\n  case IR_ULT: case IR_UGE: case IR_ULE: case IR_UGT:\r\n  case IR_EQ: case IR_NE: case IR_ABC:\r\n    asm_comp(as, ir, asm_compmap[ir->o]);\r\n    break;\r\n\r\n  case IR_RETF: asm_retf(as, ir); break;\r\n\r\n  /* Bit ops. */\r\n  case IR_BNOT: asm_neg_not(as, ir, XOg_NOT); break;\r\n  case IR_BSWAP: asm_bitswap(as, ir); break;\r\n\r\n  case IR_BAND: asm_intarith(as, ir, XOg_AND); break;\r\n  case IR_BOR:  asm_intarith(as, ir, XOg_OR); break;\r\n  case IR_BXOR: asm_intarith(as, ir, XOg_XOR); break;\r\n\r\n  case IR_BSHL: asm_bitshift(as, ir, XOg_SHL); break;\r\n  case IR_BSHR: asm_bitshift(as, ir, XOg_SHR); break;\r\n  case IR_BSAR: asm_bitshift(as, ir, XOg_SAR); break;\r\n  case IR_BROL: asm_bitshift(as, ir, XOg_ROL); break;\r\n  case IR_BROR: asm_bitshift(as, ir, XOg_ROR); break;\r\n\r\n  /* Arithmetic ops. */\r\n  case IR_ADD: asm_add(as, ir); break;\r\n  case IR_SUB:\r\n    if (irt_isnum(ir->t))\r\n      asm_fparith(as, ir, XO_SUBSD);\r\n    else  /* Note: no need for LEA trick here. i-k is encoded as i+(-k). */\r\n      asm_intarith(as, ir, XOg_SUB);\r\n    break;\r\n  case IR_MUL:\r\n    if (irt_isnum(ir->t))\r\n      asm_fparith(as, ir, XO_MULSD);\r\n    else\r\n      asm_intarith(as, ir, XOg_X_IMUL);\r\n    break;\r\n  case IR_DIV:\r\n#if LJ_64 && LJ_HASFFI\r\n    if (!irt_isnum(ir->t))\r\n      asm_arith64(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_divi64 :\r\n\t\t\t\t\t     IRCALL_lj_carith_divu64);\r\n    else\r\n#endif\r\n      asm_fparith(as, ir, XO_DIVSD);\r\n    break;\r\n  case IR_MOD:\r\n#if LJ_64 && LJ_HASFFI\r\n    if (!irt_isint(ir->t))\r\n      asm_arith64(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_modi64 :\r\n\t\t\t\t\t     IRCALL_lj_carith_modu64);\r\n    else\r\n#endif\r\n      asm_intmod(as, ir);\r\n    break;\r\n\r\n  case IR_NEG:\r\n    if (irt_isnum(ir->t))\r\n      asm_fparith(as, ir, XO_XORPS);\r\n    else\r\n      asm_neg_not(as, ir, XOg_NEG);\r\n    break;\r\n  case IR_ABS: asm_fparith(as, ir, XO_ANDPS); break;\r\n\r\n  case IR_MIN:\r\n    if (irt_isnum(ir->t))\r\n      asm_fparith(as, ir, XO_MINSD);\r\n    else\r\n      asm_min_max(as, ir, CC_G);\r\n    break;\r\n  case IR_MAX:\r\n    if (irt_isnum(ir->t))\r\n      asm_fparith(as, ir, XO_MAXSD);\r\n    else\r\n      asm_min_max(as, ir, CC_L);\r\n    break;\r\n\r\n  case IR_FPMATH: case IR_ATAN2: case IR_LDEXP:\r\n    asm_fpmath(as, ir);\r\n    break;\r\n  case IR_POW:\r\n#if LJ_64 && LJ_HASFFI\r\n    if (!irt_isnum(ir->t))\r\n      asm_arith64(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_powi64 :\r\n\t\t\t\t\t     IRCALL_lj_carith_powu64);\r\n    else\r\n#endif\r\n      asm_fppowi(as, ir);\r\n    break;\r\n\r\n  /* Overflow-checking arithmetic ops. Note: don't use LEA here! */\r\n  case IR_ADDOV: asm_intarith(as, ir, XOg_ADD); break;\r\n  case IR_SUBOV: asm_intarith(as, ir, XOg_SUB); break;\r\n  case IR_MULOV: asm_intarith(as, ir, XOg_X_IMUL); break;\r\n\r\n  /* Memory references. */\r\n  case IR_AREF: asm_aref(as, ir); break;\r\n  case IR_HREF: asm_href(as, ir); break;\r\n  case IR_HREFK: asm_hrefk(as, ir); break;\r\n  case IR_NEWREF: asm_newref(as, ir); break;\r\n  case IR_UREFO: case IR_UREFC: asm_uref(as, ir); break;\r\n  case IR_FREF: asm_fref(as, ir); break;\r\n  case IR_STRREF: asm_strref(as, ir); break;\r\n\r\n  /* Loads and stores. */\r\n  case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n    asm_ahuvload(as, ir);\r\n    break;\r\n  case IR_FLOAD: case IR_XLOAD: asm_fxload(as, ir); break;\r\n  case IR_SLOAD: asm_sload(as, ir); break;\r\n\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: asm_ahustore(as, ir); break;\r\n  case IR_FSTORE: case IR_XSTORE: asm_fxstore(as, ir); break;\r\n\r\n  /* Allocations. */\r\n  case IR_SNEW: case IR_XSNEW: asm_snew(as, ir); break;\r\n  case IR_TNEW: asm_tnew(as, ir); break;\r\n  case IR_TDUP: asm_tdup(as, ir); break;\r\n  case IR_CNEW: case IR_CNEWI: asm_cnew(as, ir); break;\r\n\r\n  /* Write barriers. */\r\n  case IR_TBAR: asm_tbar(as, ir); break;\r\n  case IR_OBAR: asm_obar(as, ir); break;\r\n\r\n  /* Type conversions. */\r\n  case IR_TOBIT: asm_tobit(as, ir); break;\r\n  case IR_CONV: asm_conv(as, ir); break;\r\n  case IR_TOSTR: asm_tostr(as, ir); break;\r\n  case IR_STRTO: asm_strto(as, ir); break;\r\n\r\n  /* Calls. */\r\n  case IR_CALLN: case IR_CALLL: case IR_CALLS: asm_call(as, ir); break;\r\n  case IR_CALLXS: asm_callx(as, ir); break;\r\n  case IR_CARG: break;\r\n\r\n  default:\r\n    setintV(&as->J->errinfo, ir->o);\r\n    lj_trace_err_info(as->J, LJ_TRERR_NYIIR);\r\n    break;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  int nslots;\r\n  asm_collectargs(as, ir, ci, args);\r\n  nslots = asm_count_call_slots(as, ci, args);\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n#if LJ_64\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n#else\r\n  return irt_isfp(ir->t) ? REGSP_INIT : REGSP_HINT(RID_RET);\r\n#endif\r\n}\r\n\r\n/* Target-specific setup. */\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_exitstub_setup(as, as->T->nsnap);\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MSize len = T->szmcode;\r\n  MCode *px = exitstub_addr(J, exitno) - 6;\r\n  MCode *pe = p+len-6;\r\n  uint32_t stateaddr = u32ptr(&J2G(J)->vmstate);\r\n  if (len > 5 && p[len-5] == XI_JMP && p+len-6 + *(int32_t *)(p+len-4) == px)\r\n    *(int32_t *)(p+len-4) = jmprel(p+len, target);\r\n  /* Do not patch parent exit for a stack check. Skip beyond vmstate update. */\r\n  for (; p < pe; p++)\r\n    if (*(uint32_t *)(p+(LJ_64 ? 3 : 2)) == stateaddr && p[0] == XI_MOVmi) {\r\n      p += LJ_64 ? 11 : 10;\r\n      break;\r\n    }\r\n  lua_assert(p < pe);\r\n  for (; p < pe; p++) {\r\n    if ((*(uint16_t *)p & 0xf0ff) == 0x800f && p + *(int32_t *)(p+2) == px) {\r\n      *(int32_t *)(p+2) = jmprel(p+6, target);\r\n      p += 5;\r\n    }\r\n  }\r\n  lj_mcode_sync(T->mcode, T->mcode + T->szmcode);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_bc.c",
    "content": "/*\r\n** Bytecode instruction modes.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bc_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* Bytecode offsets and bytecode instruction modes. */\r\n#include \"lj_bcdef.h\"\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_bc.h",
    "content": "/*\r\n** Bytecode instruction format.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_BC_H\r\n#define _LJ_BC_H\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* Bytecode instruction format, 32 bit wide, fields of 8 or 16 bit:\r\n**\r\n** +----+----+----+----+\r\n** | B  | C  | A  | OP | Format ABC\r\n** +----+----+----+----+\r\n** |    D    | A  | OP | Format AD\r\n** +--------------------\r\n** MSB               LSB\r\n**\r\n** In-memory instructions are always stored in host byte order.\r\n*/\r\n\r\n/* Operand ranges and related constants. */\r\n#define BCMAX_A\t\t0xff\r\n#define BCMAX_B\t\t0xff\r\n#define BCMAX_C\t\t0xff\r\n#define BCMAX_D\t\t0xffff\r\n#define BCBIAS_J\t0x8000\r\n#define NO_REG\t\tBCMAX_A\r\n#define NO_JMP\t\t(~(BCPos)0)\r\n\r\n/* Macros to get instruction fields. */\r\n#define bc_op(i)\t((BCOp)((i)&0xff))\r\n#define bc_a(i)\t\t((BCReg)(((i)>>8)&0xff))\r\n#define bc_b(i)\t\t((BCReg)((i)>>24))\r\n#define bc_c(i)\t\t((BCReg)(((i)>>16)&0xff))\r\n#define bc_d(i)\t\t((BCReg)((i)>>16))\r\n#define bc_j(i)\t\t((ptrdiff_t)bc_d(i)-BCBIAS_J)\r\n\r\n/* Macros to set instruction fields. */\r\n#define setbc_byte(p, x, ofs) \\\r\n  ((uint8_t *)(p))[LJ_ENDIAN_SELECT(ofs, 3-ofs)] = (uint8_t)(x)\r\n#define setbc_op(p, x)\tsetbc_byte(p, (x), 0)\r\n#define setbc_a(p, x)\tsetbc_byte(p, (x), 1)\r\n#define setbc_b(p, x)\tsetbc_byte(p, (x), 3)\r\n#define setbc_c(p, x)\tsetbc_byte(p, (x), 2)\r\n#define setbc_d(p, x) \\\r\n  ((uint16_t *)(p))[LJ_ENDIAN_SELECT(1, 0)] = (uint16_t)(x)\r\n#define setbc_j(p, x)\tsetbc_d(p, (BCPos)((int32_t)(x)+BCBIAS_J))\r\n\r\n/* Macros to compose instructions. */\r\n#define BCINS_ABC(o, a, b, c) \\\r\n  (((BCIns)(o))|((BCIns)(a)<<8)|((BCIns)(b)<<24)|((BCIns)(c)<<16))\r\n#define BCINS_AD(o, a, d) \\\r\n  (((BCIns)(o))|((BCIns)(a)<<8)|((BCIns)(d)<<16))\r\n#define BCINS_AJ(o, a, j)\tBCINS_AD(o, a, (BCPos)((int32_t)(j)+BCBIAS_J))\r\n\r\n/* Bytecode instruction definition. Order matters, see below.\r\n**\r\n** (name, filler, Amode, Bmode, Cmode or Dmode, metamethod)\r\n**\r\n** The opcode name suffixes specify the type for RB/RC or RD:\r\n** V = variable slot\r\n** S = string const\r\n** N = number const\r\n** P = primitive type (~itype)\r\n** B = unsigned byte literal\r\n** M = multiple args/results\r\n*/\r\n#define BCDEF(_) \\\r\n  /* Comparison ops. ORDER OPR. */ \\\r\n  _(ISLT,\tvar,\t___,\tvar,\tlt) \\\r\n  _(ISGE,\tvar,\t___,\tvar,\tlt) \\\r\n  _(ISLE,\tvar,\t___,\tvar,\tle) \\\r\n  _(ISGT,\tvar,\t___,\tvar,\tle) \\\r\n  \\\r\n  _(ISEQV,\tvar,\t___,\tvar,\teq) \\\r\n  _(ISNEV,\tvar,\t___,\tvar,\teq) \\\r\n  _(ISEQS,\tvar,\t___,\tstr,\teq) \\\r\n  _(ISNES,\tvar,\t___,\tstr,\teq) \\\r\n  _(ISEQN,\tvar,\t___,\tnum,\teq) \\\r\n  _(ISNEN,\tvar,\t___,\tnum,\teq) \\\r\n  _(ISEQP,\tvar,\t___,\tpri,\teq) \\\r\n  _(ISNEP,\tvar,\t___,\tpri,\teq) \\\r\n  \\\r\n  /* Unary test and copy ops. */ \\\r\n  _(ISTC,\tdst,\t___,\tvar,\t___) \\\r\n  _(ISFC,\tdst,\t___,\tvar,\t___) \\\r\n  _(IST,\t___,\t___,\tvar,\t___) \\\r\n  _(ISF,\t___,\t___,\tvar,\t___) \\\r\n  \\\r\n  /* Unary ops. */ \\\r\n  _(MOV,\tdst,\t___,\tvar,\t___) \\\r\n  _(NOT,\tdst,\t___,\tvar,\t___) \\\r\n  _(UNM,\tdst,\t___,\tvar,\tunm) \\\r\n  _(LEN,\tdst,\t___,\tvar,\tlen) \\\r\n  \\\r\n  /* Binary ops. ORDER OPR. VV last, POW must be next. */ \\\r\n  _(ADDVN,\tdst,\tvar,\tnum,\tadd) \\\r\n  _(SUBVN,\tdst,\tvar,\tnum,\tsub) \\\r\n  _(MULVN,\tdst,\tvar,\tnum,\tmul) \\\r\n  _(DIVVN,\tdst,\tvar,\tnum,\tdiv) \\\r\n  _(MODVN,\tdst,\tvar,\tnum,\tmod) \\\r\n  \\\r\n  _(ADDNV,\tdst,\tvar,\tnum,\tadd) \\\r\n  _(SUBNV,\tdst,\tvar,\tnum,\tsub) \\\r\n  _(MULNV,\tdst,\tvar,\tnum,\tmul) \\\r\n  _(DIVNV,\tdst,\tvar,\tnum,\tdiv) \\\r\n  _(MODNV,\tdst,\tvar,\tnum,\tmod) \\\r\n  \\\r\n  _(ADDVV,\tdst,\tvar,\tvar,\tadd) \\\r\n  _(SUBVV,\tdst,\tvar,\tvar,\tsub) \\\r\n  _(MULVV,\tdst,\tvar,\tvar,\tmul) \\\r\n  _(DIVVV,\tdst,\tvar,\tvar,\tdiv) \\\r\n  _(MODVV,\tdst,\tvar,\tvar,\tmod) \\\r\n  \\\r\n  _(POW,\tdst,\tvar,\tvar,\tpow) \\\r\n  _(CAT,\tdst,\trbase,\trbase,\tconcat) \\\r\n  \\\r\n  /* Constant ops. */ \\\r\n  _(KSTR,\tdst,\t___,\tstr,\t___) \\\r\n  _(KCDATA,\tdst,\t___,\tcdata,\t___) \\\r\n  _(KSHORT,\tdst,\t___,\tlits,\t___) \\\r\n  _(KNUM,\tdst,\t___,\tnum,\t___) \\\r\n  _(KPRI,\tdst,\t___,\tpri,\t___) \\\r\n  _(KNIL,\tbase,\t___,\tbase,\t___) \\\r\n  \\\r\n  /* Upvalue and function ops. */ \\\r\n  _(UGET,\tdst,\t___,\tuv,\t___) \\\r\n  _(USETV,\tuv,\t___,\tvar,\t___) \\\r\n  _(USETS,\tuv,\t___,\tstr,\t___) \\\r\n  _(USETN,\tuv,\t___,\tnum,\t___) \\\r\n  _(USETP,\tuv,\t___,\tpri,\t___) \\\r\n  _(UCLO,\trbase,\t___,\tjump,\t___) \\\r\n  _(FNEW,\tdst,\t___,\tfunc,\tgc) \\\r\n  \\\r\n  /* Table ops. */ \\\r\n  _(TNEW,\tdst,\t___,\tlit,\tgc) \\\r\n  _(TDUP,\tdst,\t___,\ttab,\tgc) \\\r\n  _(GGET,\tdst,\t___,\tstr,\tindex) \\\r\n  _(GSET,\tvar,\t___,\tstr,\tnewindex) \\\r\n  _(TGETV,\tdst,\tvar,\tvar,\tindex) \\\r\n  _(TGETS,\tdst,\tvar,\tstr,\tindex) \\\r\n  _(TGETB,\tdst,\tvar,\tlit,\tindex) \\\r\n  _(TSETV,\tvar,\tvar,\tvar,\tnewindex) \\\r\n  _(TSETS,\tvar,\tvar,\tstr,\tnewindex) \\\r\n  _(TSETB,\tvar,\tvar,\tlit,\tnewindex) \\\r\n  _(TSETM,\tbase,\t___,\tnum,\tnewindex) \\\r\n  \\\r\n  /* Calls and vararg handling. T = tail call. */ \\\r\n  _(CALLM,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(CALL,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(CALLMT,\tbase,\t___,\tlit,\tcall) \\\r\n  _(CALLT,\tbase,\t___,\tlit,\tcall) \\\r\n  _(ITERC,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(ITERN,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(VARG,\tbase,\tlit,\tlit,\t___) \\\r\n  _(ISNEXT,\tbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  /* Returns. */ \\\r\n  _(RETM,\tbase,\t___,\tlit,\t___) \\\r\n  _(RET,\trbase,\t___,\tlit,\t___) \\\r\n  _(RET0,\trbase,\t___,\tlit,\t___) \\\r\n  _(RET1,\trbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  /* Loops and branches. I/J = interp/JIT, I/C/L = init/call/loop. */ \\\r\n  _(FORI,\tbase,\t___,\tjump,\t___) \\\r\n  _(JFORI,\tbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  _(FORL,\tbase,\t___,\tjump,\t___) \\\r\n  _(IFORL,\tbase,\t___,\tjump,\t___) \\\r\n  _(JFORL,\tbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(ITERL,\tbase,\t___,\tjump,\t___) \\\r\n  _(IITERL,\tbase,\t___,\tjump,\t___) \\\r\n  _(JITERL,\tbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(LOOP,\trbase,\t___,\tjump,\t___) \\\r\n  _(ILOOP,\trbase,\t___,\tjump,\t___) \\\r\n  _(JLOOP,\trbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(JMP,\trbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  /* Function headers. I/J = interp/JIT, F/V/C = fixarg/vararg/C func. */ \\\r\n  _(FUNCF,\trbase,\t___,\t___,\t___) \\\r\n  _(IFUNCF,\trbase,\t___,\t___,\t___) \\\r\n  _(JFUNCF,\trbase,\t___,\tlit,\t___) \\\r\n  _(FUNCV,\trbase,\t___,\t___,\t___) \\\r\n  _(IFUNCV,\trbase,\t___,\t___,\t___) \\\r\n  _(JFUNCV,\trbase,\t___,\tlit,\t___) \\\r\n  _(FUNCC,\trbase,\t___,\t___,\t___) \\\r\n  _(FUNCCW,\trbase,\t___,\t___,\t___)\r\n\r\n/* Bytecode opcode numbers. */\r\ntypedef enum {\r\n#define BCENUM(name, ma, mb, mc, mt)\tBC_##name,\r\nBCDEF(BCENUM)\r\n#undef BCENUM\r\n  BC__MAX\r\n} BCOp;\r\n\r\nLJ_STATIC_ASSERT((int)BC_ISEQV+1 == (int)BC_ISNEV);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQV^1) == (int)BC_ISNEV);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQS^1) == (int)BC_ISNES);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQN^1) == (int)BC_ISNEN);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQP^1) == (int)BC_ISNEP);\r\nLJ_STATIC_ASSERT(((int)BC_ISLT^1) == (int)BC_ISGE);\r\nLJ_STATIC_ASSERT(((int)BC_ISLE^1) == (int)BC_ISGT);\r\nLJ_STATIC_ASSERT(((int)BC_ISLT^3) == (int)BC_ISGT);\r\nLJ_STATIC_ASSERT((int)BC_IST-(int)BC_ISTC == (int)BC_ISF-(int)BC_ISFC);\r\nLJ_STATIC_ASSERT((int)BC_CALLT-(int)BC_CALL == (int)BC_CALLMT-(int)BC_CALLM);\r\nLJ_STATIC_ASSERT((int)BC_CALLMT + 1 == (int)BC_CALLT);\r\nLJ_STATIC_ASSERT((int)BC_RETM + 1 == (int)BC_RET);\r\nLJ_STATIC_ASSERT((int)BC_FORL + 1 == (int)BC_IFORL);\r\nLJ_STATIC_ASSERT((int)BC_FORL + 2 == (int)BC_JFORL);\r\nLJ_STATIC_ASSERT((int)BC_ITERL + 1 == (int)BC_IITERL);\r\nLJ_STATIC_ASSERT((int)BC_ITERL + 2 == (int)BC_JITERL);\r\nLJ_STATIC_ASSERT((int)BC_LOOP + 1 == (int)BC_ILOOP);\r\nLJ_STATIC_ASSERT((int)BC_LOOP + 2 == (int)BC_JLOOP);\r\nLJ_STATIC_ASSERT((int)BC_FUNCF + 1 == (int)BC_IFUNCF);\r\nLJ_STATIC_ASSERT((int)BC_FUNCF + 2 == (int)BC_JFUNCF);\r\nLJ_STATIC_ASSERT((int)BC_FUNCV + 1 == (int)BC_IFUNCV);\r\nLJ_STATIC_ASSERT((int)BC_FUNCV + 2 == (int)BC_JFUNCV);\r\n\r\n/* This solves a circular dependency problem, change as needed. */\r\n#define FF_next_N\t4\r\n\r\n/* Stack slots used by FORI/FORL, relative to operand A. */\r\nenum {\r\n  FORL_IDX, FORL_STOP, FORL_STEP, FORL_EXT\r\n};\r\n\r\n/* Bytecode operand modes. ORDER BCMode */\r\ntypedef enum {\r\n  BCMnone, BCMdst, BCMbase, BCMvar, BCMrbase, BCMuv,  /* Mode A must be <= 7 */\r\n  BCMlit, BCMlits, BCMpri, BCMnum, BCMstr, BCMtab, BCMfunc, BCMjump, BCMcdata,\r\n  BCM_max\r\n} BCMode;\r\n#define BCM___\t\tBCMnone\r\n\r\n#define bcmode_a(op)\t((BCMode)(lj_bc_mode[op] & 7))\r\n#define bcmode_b(op)\t((BCMode)((lj_bc_mode[op]>>3) & 15))\r\n#define bcmode_c(op)\t((BCMode)((lj_bc_mode[op]>>7) & 15))\r\n#define bcmode_d(op)\tbcmode_c(op)\r\n#define bcmode_hasd(op)\t((lj_bc_mode[op] & (15<<3)) == (BCMnone<<3))\r\n#define bcmode_mm(op)\t((MMS)(lj_bc_mode[op]>>11))\r\n\r\n#define BCMODE(name, ma, mb, mc, mm) \\\r\n  (BCM##ma|(BCM##mb<<3)|(BCM##mc<<7)|(MM_##mm<<11)),\r\n#define BCMODE_FF\t0\r\n\r\nstatic LJ_AINLINE int bc_isret(BCOp op)\r\n{\r\n  return (op == BC_RETM || op == BC_RET || op == BC_RET0 || op == BC_RET1);\r\n}\r\n\r\nLJ_DATA const uint16_t lj_bc_mode[];\r\nLJ_DATA const uint16_t lj_bc_ofs[];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_bcdump.h",
    "content": "/*\r\n** Bytecode dump definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_BCDUMP_H\r\n#define _LJ_BCDUMP_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lex.h\"\r\n\r\n/* -- Bytecode dump format ------------------------------------------------ */\r\n\r\n/*\r\n** dump   = header proto+ 0U\r\n** header = ESC 'L' 'J' versionB flagsU [namelenU nameB*]\r\n** proto  = lengthU pdata\r\n** pdata  = phead bcinsW* uvdataH* kgc* knum* [debugB*]\r\n** phead  = flagsB numparamsB framesizeB numuvB numkgcU numknU numbcU\r\n**          [debuglenU [firstlineU numlineU]]\r\n** kgc    = kgctypeU { ktab | (loU hiU) | (rloU rhiU iloU ihiU) | strB* }\r\n** knum   = intU0 | (loU1 hiU)\r\n** ktab   = narrayU nhashU karray* khash*\r\n** karray = ktabk\r\n** khash  = ktabk ktabk\r\n** ktabk  = ktabtypeU { intU | (loU hiU) | strB* }\r\n**\r\n** B = 8 bit, H = 16 bit, W = 32 bit, U = ULEB128 of W, U0/U1 = ULEB128 of W+1\r\n*/\r\n\r\n/* Bytecode dump header. */\r\n#define BCDUMP_HEAD1\t\t0x1b\r\n#define BCDUMP_HEAD2\t\t0x4c\r\n#define BCDUMP_HEAD3\t\t0x4a\r\n\r\n/* If you perform *any* kind of private modifications to the bytecode itself\r\n** or to the dump format, you *must* set BCDUMP_VERSION to 0x80 or higher.\r\n*/\r\n#define BCDUMP_VERSION\t\t1\r\n\r\n/* Compatibility flags. */\r\n#define BCDUMP_F_BE\t\t0x01\r\n#define BCDUMP_F_STRIP\t\t0x02\r\n#define BCDUMP_F_FFI\t\t0x04\r\n\r\n#define BCDUMP_F_KNOWN\t\t(BCDUMP_F_FFI*2-1)\r\n\r\n/* Type codes for the GC constants of a prototype. Plus length for strings. */\r\nenum {\r\n  BCDUMP_KGC_CHILD, BCDUMP_KGC_TAB, BCDUMP_KGC_I64, BCDUMP_KGC_U64,\r\n  BCDUMP_KGC_COMPLEX, BCDUMP_KGC_STR\r\n};\r\n\r\n/* Type codes for the keys/values of a constant table. */\r\nenum {\r\n  BCDUMP_KTAB_NIL, BCDUMP_KTAB_FALSE, BCDUMP_KTAB_TRUE,\r\n  BCDUMP_KTAB_INT, BCDUMP_KTAB_NUM, BCDUMP_KTAB_STR\r\n};\r\n\r\n/* -- Bytecode reader/writer ---------------------------------------------- */\r\n\r\nLJ_FUNC int lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer,\r\n\t\t       void *data, int strip);\r\nLJ_FUNC GCproto *lj_bcread(LexState *ls);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_bcread.c",
    "content": "/*\r\n** Bytecode reader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bcread_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lualib.h\"\r\n#endif\r\n#include \"lj_lex.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_state.h\"\r\n\r\n/* Reuse some lexer fields for our own purposes. */\r\n#define bcread_flags(ls)\tls->level\r\n#define bcread_swap(ls) \\\r\n  ((bcread_flags(ls) & BCDUMP_F_BE) != LJ_BE*BCDUMP_F_BE)\r\n#define bcread_oldtop(L, ls)\trestorestack(L, ls->lastline)\r\n#define bcread_savetop(L, ls, top) \\\r\n  ls->lastline = (BCLine)savestack(L, (top))\r\n\r\n/* -- Input buffer handling ----------------------------------------------- */\r\n\r\n/* Throw reader error. */\r\nstatic LJ_NOINLINE void bcread_error(LexState *ls, ErrMsg em)\r\n{\r\n  lua_State *L = ls->L;\r\n  const char *name = ls->chunkarg;\r\n  if (*name == BCDUMP_HEAD1) name = \"(binary)\";\r\n  else if (*name == '@' || *name == '=') name++;\r\n  lj_str_pushf(L, \"%s: %s\", name, err2msg(em));\r\n  lj_err_throw(L, LUA_ERRSYNTAX);\r\n}\r\n\r\n/* Resize input buffer. */\r\nstatic void bcread_resize(LexState *ls, MSize len)\r\n{\r\n  if (ls->sb.sz < len) {\r\n    MSize sz = ls->sb.sz * 2;\r\n    while (len > sz) sz = sz * 2;\r\n    lj_str_resizebuf(ls->L, &ls->sb, sz);\r\n    /* Caveat: this may change ls->sb.buf which may affect ls->p. */\r\n  }\r\n}\r\n\r\n/* Refill buffer if needed. */\r\nstatic LJ_NOINLINE void bcread_fill(LexState *ls, MSize len, int need)\r\n{\r\n  lua_assert(len != 0);\r\n  if (len > LJ_MAX_MEM || ls->current < 0)\r\n    bcread_error(ls, LJ_ERR_BCBAD);\r\n  do {\r\n    const char *buf;\r\n    size_t size;\r\n    if (ls->n) {  /* Copy remainder to buffer. */\r\n      if (ls->sb.n) {  /* Move down in buffer. */\r\n\tlua_assert(ls->p + ls->n == ls->sb.buf + ls->sb.n);\r\n\tif (ls->n != ls->sb.n)\r\n\t  memmove(ls->sb.buf, ls->p, ls->n);\r\n      } else {  /* Copy from buffer provided by reader. */\r\n\tbcread_resize(ls, len);\r\n\tmemcpy(ls->sb.buf, ls->p, ls->n);\r\n      }\r\n      ls->p = ls->sb.buf;\r\n    }\r\n    ls->sb.n = ls->n;\r\n    buf = ls->rfunc(ls->L, ls->rdata, &size);  /* Get more data from reader. */\r\n    if (buf == NULL || size == 0) {  /* EOF? */\r\n      if (need) bcread_error(ls, LJ_ERR_BCBAD);\r\n      ls->current = -1;  /* Only bad if we get called again. */\r\n      break;\r\n    }\r\n    if (ls->sb.n) {  /* Append to buffer. */\r\n      MSize n = ls->sb.n + (MSize)size;\r\n      bcread_resize(ls, n < len ? len : n);\r\n      memcpy(ls->sb.buf + ls->sb.n, buf, size);\r\n      ls->n = ls->sb.n = n;\r\n      ls->p = ls->sb.buf;\r\n    } else {  /* Return buffer provided by reader. */\r\n      ls->n = (MSize)size;\r\n      ls->p = buf;\r\n    }\r\n  } while (ls->n < len);\r\n}\r\n\r\n/* Need a certain number of bytes. */\r\nstatic LJ_AINLINE void bcread_need(LexState *ls, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ls->n < len))\r\n    bcread_fill(ls, len, 1);\r\n}\r\n\r\n/* Want to read up to a certain number of bytes, but may need less. */\r\nstatic LJ_AINLINE void bcread_want(LexState *ls, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ls->n < len))\r\n    bcread_fill(ls, len, 0);\r\n}\r\n\r\n#define bcread_dec(ls)\t\tcheck_exp(ls->n > 0, ls->n--)\r\n#define bcread_consume(ls, len)\tcheck_exp(ls->n >= (len), ls->n -= (len))\r\n\r\n/* Return memory block from buffer. */\r\nstatic uint8_t *bcread_mem(LexState *ls, MSize len)\r\n{\r\n  uint8_t *p = (uint8_t *)ls->p;\r\n  bcread_consume(ls, len);\r\n  ls->p = (char *)p + len;\r\n  return p;\r\n}\r\n\r\n/* Copy memory block from buffer. */\r\nstatic void bcread_block(LexState *ls, void *q, MSize len)\r\n{\r\n  memcpy(q, bcread_mem(ls, len), len);\r\n}\r\n\r\n/* Read byte from buffer. */\r\nstatic LJ_AINLINE uint32_t bcread_byte(LexState *ls)\r\n{\r\n  bcread_dec(ls);\r\n  return (uint32_t)(uint8_t)*ls->p++;\r\n}\r\n\r\n/* Read ULEB128 value from buffer. */\r\nstatic uint32_t bcread_uleb128(LexState *ls)\r\n{\r\n  const uint8_t *p = (const uint8_t *)ls->p;\r\n  uint32_t v = *p++;\r\n  if (LJ_UNLIKELY(v >= 0x80)) {\r\n    int sh = 0;\r\n    v &= 0x7f;\r\n    do {\r\n     v |= ((*p & 0x7f) << (sh += 7));\r\n     bcread_dec(ls);\r\n   } while (*p++ >= 0x80);\r\n  }\r\n  bcread_dec(ls);\r\n  ls->p = (char *)p;\r\n  return v;\r\n}\r\n\r\n/* Read top 32 bits of 33 bit ULEB128 value from buffer. */\r\nstatic uint32_t bcread_uleb128_33(LexState *ls)\r\n{\r\n  const uint8_t *p = (const uint8_t *)ls->p;\r\n  uint32_t v = (*p++ >> 1);\r\n  if (LJ_UNLIKELY(v >= 0x40)) {\r\n    int sh = -1;\r\n    v &= 0x3f;\r\n    do {\r\n     v |= ((*p & 0x7f) << (sh += 7));\r\n     bcread_dec(ls);\r\n   } while (*p++ >= 0x80);\r\n  }\r\n  bcread_dec(ls);\r\n  ls->p = (char *)p;\r\n  return v;\r\n}\r\n\r\n/* -- Bytecode reader ----------------------------------------------------- */\r\n\r\n/* Read debug info of a prototype. */\r\nstatic void bcread_dbg(LexState *ls, GCproto *pt, MSize sizedbg)\r\n{\r\n  void *lineinfo = (void *)proto_lineinfo(pt);\r\n  bcread_block(ls, lineinfo, sizedbg);\r\n  /* Swap lineinfo if the endianess differs. */\r\n  if (bcread_swap(ls) && pt->numline >= 256) {\r\n    MSize i, n = pt->sizebc-1;\r\n    if (pt->numline < 65536) {\r\n      uint16_t *p = (uint16_t *)lineinfo;\r\n      for (i = 0; i < n; i++) p[i] = (uint16_t)((p[i] >> 8)|(p[i] << 8));\r\n    } else {\r\n      uint32_t *p = (uint32_t *)lineinfo;\r\n      for (i = 0; i < n; i++) p[i] = lj_bswap(p[i]);\r\n    }\r\n  }\r\n}\r\n\r\n/* Find pointer to varinfo. */\r\nstatic const void *bcread_varinfo(GCproto *pt)\r\n{\r\n  const uint8_t *p = proto_uvinfo(pt);\r\n  MSize n = pt->sizeuv;\r\n  if (n) while (*p++ || --n) ;\r\n  return p;\r\n}\r\n\r\n/* Read a single constant key/value of a template table. */\r\nstatic void bcread_ktabk(LexState *ls, TValue *o)\r\n{\r\n  MSize tp = bcread_uleb128(ls);\r\n  if (tp >= BCDUMP_KTAB_STR) {\r\n    MSize len = tp - BCDUMP_KTAB_STR;\r\n    const char *p = (const char *)bcread_mem(ls, len);\r\n    setstrV(ls->L, o, lj_str_new(ls->L, p, len));\r\n  } else if (tp == BCDUMP_KTAB_INT) {\r\n    setintV(o, (int32_t)bcread_uleb128(ls));\r\n  } else if (tp == BCDUMP_KTAB_NUM) {\r\n    o->u32.lo = bcread_uleb128(ls);\r\n    o->u32.hi = bcread_uleb128(ls);\r\n  } else {\r\n    lua_assert(tp <= BCDUMP_KTAB_TRUE);\r\n    setitype(o, ~tp);\r\n  }\r\n}\r\n\r\n/* Read a template table. */\r\nstatic GCtab *bcread_ktab(LexState *ls)\r\n{\r\n  MSize narray = bcread_uleb128(ls);\r\n  MSize nhash = bcread_uleb128(ls);\r\n  GCtab *t = lj_tab_new(ls->L, narray, hsize2hbits(nhash));\r\n  if (narray) {  /* Read array entries. */\r\n    MSize i;\r\n    TValue *o = tvref(t->array);\r\n    for (i = 0; i < narray; i++, o++)\r\n      bcread_ktabk(ls, o);\r\n  }\r\n  if (nhash) {  /* Read hash entries. */\r\n    MSize i;\r\n    for (i = 0; i < nhash; i++) {\r\n      TValue key;\r\n      bcread_ktabk(ls, &key);\r\n      lua_assert(!tvisnil(&key));\r\n      bcread_ktabk(ls, lj_tab_set(ls->L, t, &key));\r\n    }\r\n  }\r\n  return t;\r\n}\r\n\r\n/* Read GC constants of a prototype. */\r\nstatic void bcread_kgc(LexState *ls, GCproto *pt, MSize sizekgc)\r\n{\r\n  MSize i;\r\n  GCRef *kr = mref(pt->k, GCRef) - (ptrdiff_t)sizekgc;\r\n  for (i = 0; i < sizekgc; i++, kr++) {\r\n    MSize tp = bcread_uleb128(ls);\r\n    if (tp >= BCDUMP_KGC_STR) {\r\n      MSize len = tp - BCDUMP_KGC_STR;\r\n      const char *p = (const char *)bcread_mem(ls, len);\r\n      setgcref(*kr, obj2gco(lj_str_new(ls->L, p, len)));\r\n    } else if (tp == BCDUMP_KGC_TAB) {\r\n      setgcref(*kr, obj2gco(bcread_ktab(ls)));\r\n#if LJ_HASFFI\r\n    } else if (tp != BCDUMP_KGC_CHILD) {\r\n      CTypeID id = tp == BCDUMP_KGC_COMPLEX ? CTID_COMPLEX_DOUBLE :\r\n\t\t   tp == BCDUMP_KGC_I64 ? CTID_INT64 : CTID_UINT64;\r\n      CTSize sz = tp == BCDUMP_KGC_COMPLEX ? 16 : 8;\r\n      GCcdata *cd = lj_cdata_new_(ls->L, id, sz);\r\n      TValue *p = (TValue *)cdataptr(cd);\r\n      setgcref(*kr, obj2gco(cd));\r\n      p[0].u32.lo = bcread_uleb128(ls);\r\n      p[0].u32.hi = bcread_uleb128(ls);\r\n      if (tp == BCDUMP_KGC_COMPLEX) {\r\n\tp[1].u32.lo = bcread_uleb128(ls);\r\n\tp[1].u32.hi = bcread_uleb128(ls);\r\n      }\r\n#endif\r\n    } else {\r\n      lua_State *L = ls->L;\r\n      lua_assert(tp == BCDUMP_KGC_CHILD);\r\n      if (L->top <= bcread_oldtop(L, ls))  /* Stack underflow? */\r\n\tbcread_error(ls, LJ_ERR_BCBAD);\r\n      L->top--;\r\n      setgcref(*kr, obj2gco(protoV(L->top)));\r\n    }\r\n  }\r\n}\r\n\r\n/* Read number constants of a prototype. */\r\nstatic void bcread_knum(LexState *ls, GCproto *pt, MSize sizekn)\r\n{\r\n  MSize i;\r\n  TValue *o = mref(pt->k, TValue);\r\n  for (i = 0; i < sizekn; i++, o++) {\r\n    int isnum = (ls->p[0] & 1);\r\n    uint32_t lo = bcread_uleb128_33(ls);\r\n    if (isnum) {\r\n      o->u32.lo = lo;\r\n      o->u32.hi = bcread_uleb128(ls);\r\n    } else {\r\n      setintV(o, lo);\r\n    }\r\n  }\r\n}\r\n\r\n/* Read bytecode instructions. */\r\nstatic void bcread_bytecode(LexState *ls, GCproto *pt, MSize sizebc)\r\n{\r\n  BCIns *bc = proto_bc(pt);\r\n  bc[0] = BCINS_AD((pt->flags & PROTO_VARARG) ? BC_FUNCV : BC_FUNCF,\r\n\t\t   pt->framesize, 0);\r\n  bcread_block(ls, bc+1, (sizebc-1)*(MSize)sizeof(BCIns));\r\n  /* Swap bytecode instructions if the endianess differs. */\r\n  if (bcread_swap(ls)) {\r\n    MSize i;\r\n    for (i = 1; i < sizebc; i++) bc[i] = lj_bswap(bc[i]);\r\n  }\r\n}\r\n\r\n/* Read upvalue refs. */\r\nstatic void bcread_uv(LexState *ls, GCproto *pt, MSize sizeuv)\r\n{\r\n  if (sizeuv) {\r\n    uint16_t *uv = proto_uv(pt);\r\n    bcread_block(ls, uv, sizeuv*2);\r\n    /* Swap upvalue refs if the endianess differs. */\r\n    if (bcread_swap(ls)) {\r\n      MSize i;\r\n      for (i = 0; i < sizeuv; i++)\r\n\tuv[i] = (uint16_t)((uv[i] >> 8)|(uv[i] << 8));\r\n    }\r\n  }\r\n}\r\n\r\n/* Read a prototype. */\r\nstatic GCproto *bcread_proto(LexState *ls)\r\n{\r\n  GCproto *pt;\r\n  MSize framesize, numparams, flags, sizeuv, sizekgc, sizekn, sizebc, sizept;\r\n  MSize ofsk, ofsuv, ofsdbg;\r\n  MSize sizedbg = 0;\r\n  BCLine firstline = 0, numline = 0;\r\n  MSize len, startn;\r\n\r\n  /* Read length. */\r\n  if (ls->n > 0 && ls->p[0] == 0) {  /* Shortcut EOF. */\r\n    ls->n--; ls->p++;\r\n    return NULL;\r\n  }\r\n  bcread_want(ls, 5);\r\n  len = bcread_uleb128(ls);\r\n  if (!len) return NULL;  /* EOF */\r\n  bcread_need(ls, len);\r\n  startn = ls->n;\r\n\r\n  /* Read prototype header. */\r\n  flags = bcread_byte(ls);\r\n  numparams = bcread_byte(ls);\r\n  framesize = bcread_byte(ls);\r\n  sizeuv = bcread_byte(ls);\r\n  sizekgc = bcread_uleb128(ls);\r\n  sizekn = bcread_uleb128(ls);\r\n  sizebc = bcread_uleb128(ls) + 1;\r\n  if (!(bcread_flags(ls) & BCDUMP_F_STRIP)) {\r\n    sizedbg = bcread_uleb128(ls);\r\n    if (sizedbg) {\r\n      firstline = bcread_uleb128(ls);\r\n      numline = bcread_uleb128(ls);\r\n    }\r\n  }\r\n\r\n  /* Calculate total size of prototype including all colocated arrays. */\r\n  sizept = (MSize)sizeof(GCproto) +\r\n\t   sizebc*(MSize)sizeof(BCIns) +\r\n\t   sizekgc*(MSize)sizeof(GCRef);\r\n  sizept = (sizept + (MSize)sizeof(TValue)-1) & ~((MSize)sizeof(TValue)-1);\r\n  ofsk = sizept; sizept += sizekn*(MSize)sizeof(TValue);\r\n  ofsuv = sizept; sizept += ((sizeuv+1)&~1)*2;\r\n  ofsdbg = sizept; sizept += sizedbg;\r\n\r\n  /* Allocate prototype object and initialize its fields. */\r\n  pt = (GCproto *)lj_mem_newgco(ls->L, (MSize)sizept);\r\n  pt->gct = ~LJ_TPROTO;\r\n  pt->numparams = (uint8_t)numparams;\r\n  pt->framesize = (uint8_t)framesize;\r\n  pt->sizebc = sizebc;\r\n  setmref(pt->k, (char *)pt + ofsk);\r\n  setmref(pt->uv, (char *)pt + ofsuv);\r\n  pt->sizekgc = 0;  /* Set to zero until fully initialized. */\r\n  pt->sizekn = sizekn;\r\n  pt->sizept = sizept;\r\n  pt->sizeuv = (uint8_t)sizeuv;\r\n  pt->flags = (uint8_t)flags;\r\n  pt->trace = 0;\r\n  setgcref(pt->chunkname, obj2gco(ls->chunkname));\r\n\r\n  /* Close potentially uninitialized gap between bc and kgc. */\r\n  *(uint32_t *)((char *)pt + ofsk - sizeof(GCRef)*(sizekgc+1)) = 0;\r\n\r\n  /* Read bytecode instructions and upvalue refs. */\r\n  bcread_bytecode(ls, pt, sizebc);\r\n  bcread_uv(ls, pt, sizeuv);\r\n\r\n  /* Read constants. */\r\n  bcread_kgc(ls, pt, sizekgc);\r\n  pt->sizekgc = sizekgc;\r\n  bcread_knum(ls, pt, sizekn);\r\n\r\n  /* Read and initialize debug info. */\r\n  pt->firstline = firstline;\r\n  pt->numline = numline;\r\n  if (sizedbg) {\r\n    MSize sizeli = (sizebc-1) << (numline < 256 ? 0 : numline < 65536 ? 1 : 2);\r\n    setmref(pt->lineinfo, (char *)pt + ofsdbg);\r\n    setmref(pt->uvinfo, (char *)pt + ofsdbg + sizeli);\r\n    bcread_dbg(ls, pt, sizedbg);\r\n    setmref(pt->varinfo, bcread_varinfo(pt));\r\n  } else {\r\n    setmref(pt->lineinfo, NULL);\r\n    setmref(pt->uvinfo, NULL);\r\n    setmref(pt->varinfo, NULL);\r\n  }\r\n\r\n  if (len != startn - ls->n)\r\n    bcread_error(ls, LJ_ERR_BCBAD);\r\n  return pt;\r\n}\r\n\r\n/* Read and check header of bytecode dump. */\r\nstatic int bcread_header(LexState *ls)\r\n{\r\n  uint32_t flags;\r\n  bcread_want(ls, 3+5+5);\r\n  if (bcread_byte(ls) != BCDUMP_HEAD2 ||\r\n      bcread_byte(ls) != BCDUMP_HEAD3 ||\r\n      bcread_byte(ls) != BCDUMP_VERSION) return 0;\r\n  bcread_flags(ls) = flags = bcread_uleb128(ls);\r\n  if ((flags & ~(BCDUMP_F_KNOWN)) != 0) return 0;\r\n  if ((flags & BCDUMP_F_FFI)) {\r\n#if LJ_HASFFI\r\n    lua_State *L = ls->L;\r\n    if (!ctype_ctsG(G(L))) {\r\n      ptrdiff_t oldtop = savestack(L, L->top);\r\n      luaopen_ffi(L);  /* Load FFI library on-demand. */\r\n      L->top = restorestack(L, oldtop);\r\n    }\r\n#else\r\n    return 0;\r\n#endif\r\n  }\r\n  if ((flags & BCDUMP_F_STRIP)) {\r\n    ls->chunkname = lj_str_newz(ls->L, ls->chunkarg);\r\n  } else {\r\n    MSize len = bcread_uleb128(ls);\r\n    bcread_need(ls, len);\r\n    ls->chunkname = lj_str_new(ls->L, (const char *)bcread_mem(ls, len), len);\r\n  }\r\n  return 1;  /* Ok. */\r\n}\r\n\r\n/* Read a bytecode dump. */\r\nGCproto *lj_bcread(LexState *ls)\r\n{\r\n  lua_State *L = ls->L;\r\n  lua_assert(ls->current == BCDUMP_HEAD1);\r\n  bcread_savetop(L, ls, L->top);\r\n  lj_str_resetbuf(&ls->sb);\r\n  /* Check for a valid bytecode dump header. */\r\n  if (!bcread_header(ls))\r\n    bcread_error(ls, LJ_ERR_BCFMT);\r\n  for (;;) {  /* Process all prototypes in the bytecode dump. */\r\n    GCproto *pt = bcread_proto(ls);\r\n    if (!pt) break;\r\n    setprotoV(L, L->top, pt);\r\n    incr_top(L);\r\n  }\r\n  if ((int32_t)ls->n > 0 || L->top-1 != bcread_oldtop(L, ls))\r\n    bcread_error(ls, LJ_ERR_BCBAD);\r\n  /* Pop off last prototype. */\r\n  L->top--;\r\n  return protoV(L->top);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_bcwrite.c",
    "content": "/*\r\n** Bytecode writer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bcwrite_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#if LJ_HASJIT\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_jit.h\"\r\n#endif\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Context for bytecode writer. */\r\ntypedef struct BCWriteCtx {\r\n  SBuf sb;\t\t\t/* Output buffer. */\r\n  lua_State *L;\t\t\t/* Lua state. */\r\n  GCproto *pt;\t\t\t/* Root prototype. */\r\n  lua_Writer wfunc;\t\t/* Writer callback. */\r\n  void *wdata;\t\t\t/* Writer callback data. */\r\n  int strip;\t\t\t/* Strip debug info. */\r\n  int status;\t\t\t/* Status from writer callback. */\r\n} BCWriteCtx;\r\n\r\n/* -- Output buffer handling ---------------------------------------------- */\r\n\r\n/* Resize buffer if needed. */\r\nstatic LJ_NOINLINE void bcwrite_resize(BCWriteCtx *ctx, MSize len)\r\n{\r\n  MSize sz = ctx->sb.sz * 2;\r\n  while (ctx->sb.n + len > sz) sz = sz * 2;\r\n  lj_str_resizebuf(ctx->L, &ctx->sb, sz);\r\n}\r\n\r\n/* Need a certain amount of buffer space. */\r\nstatic LJ_AINLINE void bcwrite_need(BCWriteCtx *ctx, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ctx->sb.n + len > ctx->sb.sz))\r\n    bcwrite_resize(ctx, len);\r\n}\r\n\r\n/* Add memory block to buffer. */\r\nstatic void bcwrite_block(BCWriteCtx *ctx, const void *p, MSize len)\r\n{\r\n  uint8_t *q = (uint8_t *)(ctx->sb.buf + ctx->sb.n);\r\n  MSize i;\r\n  ctx->sb.n += len;\r\n  for (i = 0; i < len; i++) q[i] = ((uint8_t *)p)[i];\r\n}\r\n\r\n/* Add byte to buffer. */\r\nstatic LJ_AINLINE void bcwrite_byte(BCWriteCtx *ctx, uint8_t b)\r\n{\r\n  ctx->sb.buf[ctx->sb.n++] = b;\r\n}\r\n\r\n/* Add ULEB128 value to buffer. */\r\nstatic void bcwrite_uleb128(BCWriteCtx *ctx, uint32_t v)\r\n{\r\n  MSize n = ctx->sb.n;\r\n  uint8_t *p = (uint8_t *)ctx->sb.buf;\r\n  for (; v >= 0x80; v >>= 7)\r\n    p[n++] = (uint8_t)((v & 0x7f) | 0x80);\r\n  p[n++] = (uint8_t)v;\r\n  ctx->sb.n = n;\r\n}\r\n\r\n/* -- Bytecode writer ----------------------------------------------------- */\r\n\r\n/* Write a single constant key/value of a template table. */\r\nstatic void bcwrite_ktabk(BCWriteCtx *ctx, cTValue *o, int narrow)\r\n{\r\n  bcwrite_need(ctx, 1+10);\r\n  if (tvisstr(o)) {\r\n    const GCstr *str = strV(o);\r\n    MSize len = str->len;\r\n    bcwrite_need(ctx, 5+len);\r\n    bcwrite_uleb128(ctx, BCDUMP_KTAB_STR+len);\r\n    bcwrite_block(ctx, strdata(str), len);\r\n  } else if (tvisint(o)) {\r\n    bcwrite_byte(ctx, BCDUMP_KTAB_INT);\r\n    bcwrite_uleb128(ctx, intV(o));\r\n  } else if (tvisnum(o)) {\r\n    if (!LJ_DUALNUM && narrow) {  /* Narrow number constants to integers. */\r\n      lua_Number num = numV(o);\r\n      int32_t k = lj_num2int(num);\r\n      if (num == (lua_Number)k) {  /* -0 is never a constant. */\r\n\tbcwrite_byte(ctx, BCDUMP_KTAB_INT);\r\n\tbcwrite_uleb128(ctx, k);\r\n\treturn;\r\n      }\r\n    }\r\n    bcwrite_byte(ctx, BCDUMP_KTAB_NUM);\r\n    bcwrite_uleb128(ctx, o->u32.lo);\r\n    bcwrite_uleb128(ctx, o->u32.hi);\r\n  } else {\r\n    lua_assert(tvispri(o));\r\n    bcwrite_byte(ctx, BCDUMP_KTAB_NIL+~itype(o));\r\n  }\r\n}\r\n\r\n/* Write a template table. */\r\nstatic void bcwrite_ktab(BCWriteCtx *ctx, const GCtab *t)\r\n{\r\n  MSize narray = 0, nhash = 0;\r\n  if (t->asize > 0) {  /* Determine max. length of array part. */\r\n    ptrdiff_t i;\r\n    TValue *array = tvref(t->array);\r\n    for (i = (ptrdiff_t)t->asize-1; i >= 0; i--)\r\n      if (!tvisnil(&array[i]))\r\n\tbreak;\r\n    narray = (MSize)(i+1);\r\n  }\r\n  if (t->hmask > 0) {  /* Count number of used hash slots. */\r\n    MSize i, hmask = t->hmask;\r\n    Node *node = noderef(t->node);\r\n    for (i = 0; i <= hmask; i++)\r\n      nhash += !tvisnil(&node[i].val);\r\n  }\r\n  /* Write number of array slots and hash slots. */\r\n  bcwrite_uleb128(ctx, narray);\r\n  bcwrite_uleb128(ctx, nhash);\r\n  if (narray) {  /* Write array entries (may contain nil). */\r\n    MSize i;\r\n    TValue *o = tvref(t->array);\r\n    for (i = 0; i < narray; i++, o++)\r\n      bcwrite_ktabk(ctx, o, 1);\r\n  }\r\n  if (nhash) {  /* Write hash entries. */\r\n    MSize i = nhash;\r\n    Node *node = noderef(t->node) + t->hmask;\r\n    for (;; node--)\r\n      if (!tvisnil(&node->val)) {\r\n\tbcwrite_ktabk(ctx, &node->key, 0);\r\n\tbcwrite_ktabk(ctx, &node->val, 1);\r\n\tif (--i == 0) break;\r\n      }\r\n  }\r\n}\r\n\r\n/* Write GC constants of a prototype. */\r\nstatic void bcwrite_kgc(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize i, sizekgc = pt->sizekgc;\r\n  GCRef *kr = mref(pt->k, GCRef) - (ptrdiff_t)sizekgc;\r\n  for (i = 0; i < sizekgc; i++, kr++) {\r\n    GCobj *o = gcref(*kr);\r\n    MSize tp, need = 1;\r\n    /* Determine constant type and needed size. */\r\n    if (o->gch.gct == ~LJ_TSTR) {\r\n      tp = BCDUMP_KGC_STR + gco2str(o)->len;\r\n      need = 5+gco2str(o)->len;\r\n    } else if (o->gch.gct == ~LJ_TPROTO) {\r\n      lua_assert((pt->flags & PROTO_CHILD));\r\n      tp = BCDUMP_KGC_CHILD;\r\n#if LJ_HASFFI\r\n    } else if (o->gch.gct == ~LJ_TCDATA) {\r\n      CTypeID id = gco2cd(o)->ctypeid;\r\n      need = 1+4*5;\r\n      if (id == CTID_INT64) {\r\n\ttp = BCDUMP_KGC_I64;\r\n      } else if (id == CTID_UINT64) {\r\n\ttp = BCDUMP_KGC_U64;\r\n      } else {\r\n\tlua_assert(id == CTID_COMPLEX_DOUBLE);\r\n\ttp = BCDUMP_KGC_COMPLEX;\r\n      }\r\n#endif\r\n    } else {\r\n      lua_assert(o->gch.gct == ~LJ_TTAB);\r\n      tp = BCDUMP_KGC_TAB;\r\n      need = 1+2*5;\r\n    }\r\n    /* Write constant type. */\r\n    bcwrite_need(ctx, need);\r\n    bcwrite_uleb128(ctx, tp);\r\n    /* Write constant data (if any). */\r\n    if (tp >= BCDUMP_KGC_STR) {\r\n      bcwrite_block(ctx, strdata(gco2str(o)), gco2str(o)->len);\r\n    } else if (tp == BCDUMP_KGC_TAB) {\r\n      bcwrite_ktab(ctx, gco2tab(o));\r\n#if LJ_HASFFI\r\n    } else if (tp != BCDUMP_KGC_CHILD) {\r\n      cTValue *p = (TValue *)cdataptr(gco2cd(o));\r\n      bcwrite_uleb128(ctx, p[0].u32.lo);\r\n      bcwrite_uleb128(ctx, p[0].u32.hi);\r\n      if (tp == BCDUMP_KGC_COMPLEX) {\r\n\tbcwrite_uleb128(ctx, p[1].u32.lo);\r\n\tbcwrite_uleb128(ctx, p[1].u32.hi);\r\n      }\r\n#endif\r\n    }\r\n  }\r\n}\r\n\r\n/* Write number constants of a prototype. */\r\nstatic void bcwrite_knum(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize i, sizekn = pt->sizekn;\r\n  cTValue *o = mref(pt->k, TValue);\r\n  bcwrite_need(ctx, 10*sizekn);\r\n  for (i = 0; i < sizekn; i++, o++) {\r\n    int32_t k;\r\n    if (tvisint(o)) {\r\n      k = intV(o);\r\n      goto save_int;\r\n    } else {\r\n      /* Write a 33 bit ULEB128 for the int (lsb=0) or loword (lsb=1). */\r\n      if (!LJ_DUALNUM) {  /* Narrow number constants to integers. */\r\n\tlua_Number num = numV(o);\r\n\tk = lj_num2int(num);\r\n\tif (num == (lua_Number)k) {  /* -0 is never a constant. */\r\n\tsave_int:\r\n\t  bcwrite_uleb128(ctx, 2*(uint32_t)k | ((uint32_t)k & 0x80000000u));\r\n\t  if (k < 0) {\r\n\t    char *p = &ctx->sb.buf[ctx->sb.n-1];\r\n\t    *p = (*p & 7) | ((k>>27) & 0x18);\r\n\t  }\r\n\t  continue;\r\n\t}\r\n      }\r\n      bcwrite_uleb128(ctx, 1+(2*o->u32.lo | (o->u32.lo & 0x80000000u)));\r\n      if (o->u32.lo >= 0x80000000u) {\r\n\tchar *p = &ctx->sb.buf[ctx->sb.n-1];\r\n\t*p = (*p & 7) | ((o->u32.lo>>27) & 0x18);\r\n      }\r\n      bcwrite_uleb128(ctx, o->u32.hi);\r\n    }\r\n  }\r\n}\r\n\r\n/* Write bytecode instructions. */\r\nstatic void bcwrite_bytecode(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize nbc = pt->sizebc-1;  /* Omit the [JI]FUNC* header. */\r\n#if LJ_HASJIT\r\n  uint8_t *p = (uint8_t *)&ctx->sb.buf[ctx->sb.n];\r\n#endif\r\n  bcwrite_block(ctx, proto_bc(pt)+1, nbc*(MSize)sizeof(BCIns));\r\n#if LJ_HASJIT\r\n  /* Unpatch modified bytecode containing ILOOP/JLOOP etc. */\r\n  if ((pt->flags & PROTO_ILOOP) || pt->trace) {\r\n    jit_State *J = L2J(ctx->L);\r\n    MSize i;\r\n    for (i = 0; i < nbc; i++, p += sizeof(BCIns)) {\r\n      BCOp op = (BCOp)p[LJ_ENDIAN_SELECT(0, 3)];\r\n      if (op == BC_IFORL || op == BC_IITERL || op == BC_ILOOP ||\r\n\t  op == BC_JFORI) {\r\n\tp[LJ_ENDIAN_SELECT(0, 3)] = (uint8_t)(op-BC_IFORL+BC_FORL);\r\n      } else if (op == BC_JFORL || op == BC_JITERL || op == BC_JLOOP) {\r\n\tBCReg rd = p[LJ_ENDIAN_SELECT(2, 1)] + (p[LJ_ENDIAN_SELECT(3, 0)] << 8);\r\n\tBCIns ins = traceref(J, rd)->startins;\r\n\tp[LJ_ENDIAN_SELECT(0, 3)] = (uint8_t)(op-BC_JFORL+BC_FORL);\r\n\tp[LJ_ENDIAN_SELECT(2, 1)] = bc_c(ins);\r\n\tp[LJ_ENDIAN_SELECT(3, 0)] = bc_b(ins);\r\n      }\r\n    }\r\n  }\r\n#endif\r\n}\r\n\r\n/* Write prototype. */\r\nstatic void bcwrite_proto(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize sizedbg = 0;\r\n\r\n  /* Recursively write children of prototype. */\r\n  if ((pt->flags & PROTO_CHILD)) {\r\n    ptrdiff_t i, n = pt->sizekgc;\r\n    GCRef *kr = mref(pt->k, GCRef) - 1;\r\n    for (i = 0; i < n; i++, kr--) {\r\n      GCobj *o = gcref(*kr);\r\n      if (o->gch.gct == ~LJ_TPROTO)\r\n\tbcwrite_proto(ctx, gco2pt(o));\r\n    }\r\n  }\r\n\r\n  /* Start writing the prototype info to a buffer. */\r\n  lj_str_resetbuf(&ctx->sb);\r\n  ctx->sb.n = 5;  /* Leave room for final size. */\r\n  bcwrite_need(ctx, 4+6*5+(pt->sizebc-1)*(MSize)sizeof(BCIns)+pt->sizeuv*2);\r\n\r\n  /* Write prototype header. */\r\n  bcwrite_byte(ctx, (pt->flags & (PROTO_CHILD|PROTO_VARARG|PROTO_FFI)));\r\n  bcwrite_byte(ctx, pt->numparams);\r\n  bcwrite_byte(ctx, pt->framesize);\r\n  bcwrite_byte(ctx, pt->sizeuv);\r\n  bcwrite_uleb128(ctx, pt->sizekgc);\r\n  bcwrite_uleb128(ctx, pt->sizekn);\r\n  bcwrite_uleb128(ctx, pt->sizebc-1);\r\n  if (!ctx->strip) {\r\n    if (proto_lineinfo(pt))\r\n      sizedbg = pt->sizept - (MSize)((char *)proto_lineinfo(pt) - (char *)pt);\r\n    bcwrite_uleb128(ctx, sizedbg);\r\n    if (sizedbg) {\r\n      bcwrite_uleb128(ctx, pt->firstline);\r\n      bcwrite_uleb128(ctx, pt->numline);\r\n    }\r\n  }\r\n\r\n  /* Write bytecode instructions and upvalue refs. */\r\n  bcwrite_bytecode(ctx, pt);\r\n  bcwrite_block(ctx, proto_uv(pt), pt->sizeuv*2);\r\n\r\n  /* Write constants. */\r\n  bcwrite_kgc(ctx, pt);\r\n  bcwrite_knum(ctx, pt);\r\n\r\n  /* Write debug info, if not stripped. */\r\n  if (sizedbg) {\r\n    bcwrite_need(ctx, sizedbg);\r\n    bcwrite_block(ctx, proto_lineinfo(pt), sizedbg);\r\n  }\r\n\r\n  /* Pass buffer to writer function. */\r\n  if (ctx->status == 0) {\r\n    MSize n = ctx->sb.n - 5;\r\n    MSize nn = (lj_fls(n)+8)*9 >> 6;\r\n    ctx->sb.n = 5 - nn;\r\n    bcwrite_uleb128(ctx, n);  /* Fill in final size. */\r\n    lua_assert(ctx->sb.n == 5);\r\n    ctx->status = ctx->wfunc(ctx->L, ctx->sb.buf+5-nn, nn+n, ctx->wdata);\r\n  }\r\n}\r\n\r\n/* Write header of bytecode dump. */\r\nstatic void bcwrite_header(BCWriteCtx *ctx)\r\n{\r\n  GCstr *chunkname = proto_chunkname(ctx->pt);\r\n  const char *name = strdata(chunkname);\r\n  MSize len = chunkname->len;\r\n  lj_str_resetbuf(&ctx->sb);\r\n  bcwrite_need(ctx, 5+5+len);\r\n  bcwrite_byte(ctx, BCDUMP_HEAD1);\r\n  bcwrite_byte(ctx, BCDUMP_HEAD2);\r\n  bcwrite_byte(ctx, BCDUMP_HEAD3);\r\n  bcwrite_byte(ctx, BCDUMP_VERSION);\r\n  bcwrite_byte(ctx, (ctx->strip ? BCDUMP_F_STRIP : 0) +\r\n\t\t   (LJ_BE ? BCDUMP_F_BE : 0) +\r\n\t\t   ((ctx->pt->flags & PROTO_FFI) ? BCDUMP_F_FFI : 0));\r\n  if (!ctx->strip) {\r\n    bcwrite_uleb128(ctx, len);\r\n    bcwrite_block(ctx, name, len);\r\n  }\r\n  ctx->status = ctx->wfunc(ctx->L, ctx->sb.buf, ctx->sb.n, ctx->wdata);\r\n}\r\n\r\n/* Write footer of bytecode dump. */\r\nstatic void bcwrite_footer(BCWriteCtx *ctx)\r\n{\r\n  if (ctx->status == 0) {\r\n    uint8_t zero = 0;\r\n    ctx->status = ctx->wfunc(ctx->L, &zero, 1, ctx->wdata);\r\n  }\r\n}\r\n\r\n/* Protected callback for bytecode writer. */\r\nstatic TValue *cpwriter(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  BCWriteCtx *ctx = (BCWriteCtx *)ud;\r\n  UNUSED(dummy);\r\n  lj_str_resizebuf(L, &ctx->sb, 1024);  /* Avoids resize for most prototypes. */\r\n  bcwrite_header(ctx);\r\n  bcwrite_proto(ctx, ctx->pt);\r\n  bcwrite_footer(ctx);\r\n  return NULL;\r\n}\r\n\r\n/* Write bytecode for a prototype. */\r\nint lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer, void *data,\r\n\t      int strip)\r\n{\r\n  BCWriteCtx ctx;\r\n  int status;\r\n  ctx.L = L;\r\n  ctx.pt = pt;\r\n  ctx.wfunc = writer;\r\n  ctx.wdata = data;\r\n  ctx.strip = strip;\r\n  ctx.status = 0;\r\n  lj_str_initbuf(&ctx.sb);\r\n  status = lj_vm_cpcall(L, NULL, &ctx, cpwriter);\r\n  if (status == 0) status = ctx.status;\r\n  lj_str_freebuf(G(ctx.L), &ctx.sb);\r\n  return status;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_carith.c",
    "content": "/*\r\n** C data arithmetic.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_carith.h\"\r\n\r\n/* -- C data arithmetic --------------------------------------------------- */\r\n\r\n/* Binary operands of an operator converted to ctypes. */\r\ntypedef struct CDArith {\r\n  uint8_t *p[2];\r\n  CType *ct[2];\r\n} CDArith;\r\n\r\n/* Check arguments for arithmetic metamethods. */\r\nstatic int carith_checkarg(lua_State *L, CTState *cts, CDArith *ca)\r\n{\r\n  TValue *o = L->base;\r\n  int ok = 1;\r\n  MSize i;\r\n  if (o+1 >= L->top)\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  for (i = 0; i < 2; i++, o++) {\r\n    if (tviscdata(o)) {\r\n      GCcdata *cd = cdataV(o);\r\n      CTypeID id = (CTypeID)cd->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      uint8_t *p = (uint8_t *)cdataptr(cd);\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = (uint8_t *)cdata_getptr(p, ct->size);\r\n\tif (ctype_isref(ct->info)) ct = ctype_rawchild(cts, ct);\r\n      } else if (ctype_isfunc(ct->info)) {\r\n\tp = (uint8_t *)*(void **)p;\r\n\tct = ctype_get(cts,\r\n\t  lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR));\r\n      }\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      ca->ct[i] = ct;\r\n      ca->p[i] = p;\r\n    } else if (tvisint(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_INT32);\r\n      ca->p[i] = (uint8_t *)&o->i;\r\n    } else if (tvisnum(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_DOUBLE);\r\n      ca->p[i] = (uint8_t *)&o->n;\r\n    } else if (tvisnil(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_P_VOID);\r\n      ca->p[i] = (uint8_t *)0;\r\n    } else if (tvisstr(o)) {\r\n      TValue *o2 = i == 0 ? o+1 : o-1;\r\n      CType *ct = ctype_raw(cts, cdataV(o2)->ctypeid);\r\n      ca->ct[i] = NULL;\r\n      ca->p[i] = (uint8_t *)strVdata(o);\r\n      ok = 0;\r\n      if (ctype_isenum(ct->info)) {\r\n\tCTSize ofs;\r\n\tCType *cct = lj_ctype_getfield(cts, ct, strV(o), &ofs);\r\n\tif (cct && ctype_isconstval(cct->info)) {\r\n\t  ca->ct[i] = ctype_child(cts, cct);\r\n\t  ca->p[i] = (uint8_t *)&cct->size;  /* Assumes ct does not grow. */\r\n\t  ok = 1;\r\n\t} else {\r\n\t  ca->ct[1-i] = ct;  /* Use enum to improve error message. */\r\n\t  ca->p[1-i] = NULL;\r\n\t  break;\r\n\t}\r\n      }\r\n    } else {\r\n      ca->ct[i] = NULL;\r\n      ca->p[i] = (void *)(intptr_t)1;  /* To make it unequal. */\r\n      ok = 0;\r\n    }\r\n  }\r\n  return ok;\r\n}\r\n\r\n/* Pointer arithmetic. */\r\nstatic int carith_ptr(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  CType *ctp = ca->ct[0];\r\n  uint8_t *pp = ca->p[0];\r\n  ptrdiff_t idx;\r\n  CTSize sz;\r\n  CTypeID id;\r\n  GCcdata *cd;\r\n  if (ctype_isptr(ctp->info) || ctype_isrefarray(ctp->info)) {\r\n    if ((mm == MM_sub || mm == MM_eq || mm == MM_lt || mm == MM_le) &&\r\n\t(ctype_isptr(ca->ct[1]->info) || ctype_isrefarray(ca->ct[1]->info))) {\r\n      uint8_t *pp2 = ca->p[1];\r\n      if (mm == MM_eq) {  /* Pointer equality. Incompatible pointers are ok. */\r\n\tsetboolV(L->top-1, (pp == pp2));\r\n\treturn 1;\r\n      }\r\n      if (!lj_cconv_compatptr(cts, ctp, ca->ct[1], CCF_IGNQUAL))\r\n\treturn 0;\r\n      if (mm == MM_sub) {  /* Pointer difference. */\r\n\tintptr_t diff;\r\n\tsz = lj_ctype_size(cts, ctype_cid(ctp->info));  /* Element size. */\r\n\tif (sz == 0 || sz == CTSIZE_INVALID)\r\n\t  return 0;\r\n\tdiff = ((intptr_t)pp - (intptr_t)pp2) / (int32_t)sz;\r\n\t/* All valid pointer differences on x64 are in (-2^47, +2^47),\r\n\t** which fits into a double without loss of precision.\r\n\t*/\r\n\tsetintptrV(L->top-1, (int32_t)diff);\r\n\treturn 1;\r\n      } else if (mm == MM_lt) {  /* Pointer comparison (unsigned). */\r\n\tsetboolV(L->top-1, ((uintptr_t)pp < (uintptr_t)pp2));\r\n\treturn 1;\r\n      } else {\r\n\tlua_assert(mm == MM_le);\r\n\tsetboolV(L->top-1, ((uintptr_t)pp <= (uintptr_t)pp2));\r\n\treturn 1;\r\n      }\r\n    }\r\n    if (!((mm == MM_add || mm == MM_sub) && ctype_isnum(ca->ct[1]->info)))\r\n      return 0;\r\n    lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ca->ct[1],\r\n\t\t   (uint8_t *)&idx, ca->p[1], 0);\r\n    if (mm == MM_sub) idx = -idx;\r\n  } else if (mm == MM_add && ctype_isnum(ctp->info) &&\r\n      (ctype_isptr(ca->ct[1]->info) || ctype_isrefarray(ca->ct[1]->info))) {\r\n    /* Swap pointer and index. */\r\n    ctp = ca->ct[1]; pp = ca->p[1];\r\n    lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ca->ct[0],\r\n\t\t   (uint8_t *)&idx, ca->p[0], 0);\r\n  } else {\r\n    return 0;\r\n  }\r\n  sz = lj_ctype_size(cts, ctype_cid(ctp->info));  /* Element size. */\r\n  if (sz == CTSIZE_INVALID)\r\n    return 0;\r\n  pp += idx*(int32_t)sz;  /* Compute pointer + index. */\r\n  id = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ctp->info)),\r\n\t\t       CTSIZE_PTR);\r\n  cd = lj_cdata_new(cts, id, CTSIZE_PTR);\r\n  *(uint8_t **)cdataptr(cd) = pp;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* 64 bit integer arithmetic. */\r\nstatic int carith_int64(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  if (ctype_isnum(ca->ct[0]->info) && ca->ct[0]->size <= 8 &&\r\n      ctype_isnum(ca->ct[1]->info) && ca->ct[1]->size <= 8) {\r\n    CTypeID id = (((ca->ct[0]->info & CTF_UNSIGNED) && ca->ct[0]->size == 8) ||\r\n\t\t  ((ca->ct[1]->info & CTF_UNSIGNED) && ca->ct[1]->size == 8)) ?\r\n\t\t CTID_UINT64 : CTID_INT64;\r\n    CType *ct = ctype_get(cts, id);\r\n    GCcdata *cd;\r\n    uint64_t u0, u1, *up;\r\n    lj_cconv_ct_ct(cts, ct, ca->ct[0], (uint8_t *)&u0, ca->p[0], 0);\r\n    if (mm != MM_unm)\r\n      lj_cconv_ct_ct(cts, ct, ca->ct[1], (uint8_t *)&u1, ca->p[1], 0);\r\n    switch (mm) {\r\n    case MM_eq:\r\n      setboolV(L->top-1, (u0 == u1));\r\n      return 1;\r\n    case MM_lt:\r\n      setboolV(L->top-1,\r\n\t       id == CTID_INT64 ? ((int64_t)u0 < (int64_t)u1) : (u0 < u1));\r\n      return 1;\r\n    case MM_le:\r\n      setboolV(L->top-1,\r\n\t       id == CTID_INT64 ? ((int64_t)u0 <= (int64_t)u1) : (u0 <= u1));\r\n      return 1;\r\n    default: break;\r\n    }\r\n    cd = lj_cdata_new(cts, id, 8);\r\n    up = (uint64_t *)cdataptr(cd);\r\n    setcdataV(L, L->top-1, cd);\r\n    switch (mm) {\r\n    case MM_add: *up = u0 + u1; break;\r\n    case MM_sub: *up = u0 - u1; break;\r\n    case MM_mul: *up = u0 * u1; break;\r\n    case MM_div:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_divi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_divu64(u0, u1);\r\n      break;\r\n    case MM_mod:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_modi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_modu64(u0, u1);\r\n      break;\r\n    case MM_pow:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_powi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_powu64(u0, u1);\r\n      break;\r\n    case MM_unm: *up = (uint64_t)-(int64_t)u0; break;\r\n    default: lua_assert(0); break;\r\n    }\r\n    lj_gc_check(L);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Handle ctype arithmetic metamethods. */\r\nstatic int lj_carith_meta(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  cTValue *tv = NULL;\r\n  if (tviscdata(L->base)) {\r\n    CTypeID id = cdataV(L->base)->ctypeid;\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n    tv = lj_ctype_meta(cts, id, mm);\r\n  }\r\n  if (!tv && L->base+1 < L->top && tviscdata(L->base+1)) {\r\n    CTypeID id = cdataV(L->base+1)->ctypeid;\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n    tv = lj_ctype_meta(cts, id, mm);\r\n  }\r\n  if (!tv) {\r\n    const char *repr[2];\r\n    int i, isenum = -1, isstr = -1;\r\n    if (mm == MM_eq) {  /* Equality checks never raise an error. */\r\n      int eq = ca->p[0] == ca->p[1];\r\n      setboolV(L->top-1, eq);\r\n      setboolV(&G(L)->tmptv2, eq);  /* Remember for trace recorder. */\r\n      return 1;\r\n    }\r\n    for (i = 0; i < 2; i++) {\r\n      if (ca->ct[i] && tviscdata(L->base+i)) {\r\n\tif (ctype_isenum(ca->ct[i]->info)) isenum = i;\r\n\trepr[i] = strdata(lj_ctype_repr(L, ctype_typeid(cts, ca->ct[i]), NULL));\r\n      } else {\r\n\tif (tvisstr(&L->base[i])) isstr = i;\r\n\trepr[i] = lj_typename(&L->base[i]);\r\n      }\r\n    }\r\n    if ((isenum ^ isstr) == 1)\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADCONV, repr[isstr], repr[isenum]);\r\n    lj_err_callerv(L, mm == MM_len ? LJ_ERR_FFI_BADLEN :\r\n\t\t      mm == MM_concat ? LJ_ERR_FFI_BADCONCAT :\r\n\t\t      mm < MM_add ? LJ_ERR_FFI_BADCOMP : LJ_ERR_FFI_BADARITH,\r\n\t\t   repr[0], repr[1]);\r\n  }\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\n/* Arithmetic operators for cdata. */\r\nint lj_carith_op(lua_State *L, MMS mm)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CDArith ca;\r\n  if (carith_checkarg(L, cts, &ca)) {\r\n    if (carith_int64(L, cts, &ca, mm) || carith_ptr(L, cts, &ca, mm)) {\r\n      copyTV(L, &G(L)->tmptv2, L->top-1);  /* Remember for trace recorder. */\r\n      return 1;\r\n    }\r\n  }\r\n  return lj_carith_meta(L, cts, &ca, mm);\r\n}\r\n\r\n/* -- 64 bit integer arithmetic helpers ----------------------------------- */\r\n\r\n#if LJ_32 && LJ_HASJIT\r\n/* Signed/unsigned 64 bit multiplication. */\r\nint64_t lj_carith_mul64(int64_t a, int64_t b)\r\n{\r\n  return a * b;\r\n}\r\n#endif\r\n\r\n/* Unsigned 64 bit division. */\r\nuint64_t lj_carith_divu64(uint64_t a, uint64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  return a / b;\r\n}\r\n\r\n/* Signed 64 bit division. */\r\nint64_t lj_carith_divi64(int64_t a, int64_t b)\r\n{\r\n  if (b == 0 || (a == (int64_t)U64x(80000000,00000000) && b == -1))\r\n    return U64x(80000000,00000000);\r\n  return a / b;\r\n}\r\n\r\n/* Unsigned 64 bit modulo. */\r\nuint64_t lj_carith_modu64(uint64_t a, uint64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  return a % b;\r\n}\r\n\r\n/* Signed 64 bit modulo. */\r\nint64_t lj_carith_modi64(int64_t a, int64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  if (a == (int64_t)U64x(80000000,00000000) && b == -1) return 0;\r\n  return a % b;\r\n}\r\n\r\n/* Unsigned 64 bit x^k. */\r\nuint64_t lj_carith_powu64(uint64_t x, uint64_t k)\r\n{\r\n  uint64_t y;\r\n  if (k == 0)\r\n    return 1;\r\n  for (; (k & 1) == 0; k >>= 1) x *= x;\r\n  y = x;\r\n  if ((k >>= 1) != 0) {\r\n    for (;;) {\r\n      x *= x;\r\n      if (k == 1) break;\r\n      if (k & 1) y *= x;\r\n      k >>= 1;\r\n    }\r\n    y *= x;\r\n  }\r\n  return y;\r\n}\r\n\r\n/* Signed 64 bit x^k. */\r\nint64_t lj_carith_powi64(int64_t x, int64_t k)\r\n{\r\n  if (k == 0)\r\n    return 1;\r\n  if (k < 0) {\r\n    if (x == 0)\r\n      return U64x(7fffffff,ffffffff);\r\n    else if (x == 1)\r\n      return 1;\r\n    else if (x == -1)\r\n      return (k & 1) ? -1 : 1;\r\n    else\r\n      return 0;\r\n  }\r\n  return (int64_t)lj_carith_powu64((uint64_t)x, (uint64_t)k);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_carith.h",
    "content": "/*\r\n** C data arithmetic.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CARITH_H\r\n#define _LJ_CARITH_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\nLJ_FUNC int lj_carith_op(lua_State *L, MMS mm);\r\n\r\n#if LJ_32 && LJ_HASJIT\r\nLJ_FUNC int64_t lj_carith_mul64(int64_t x, int64_t k);\r\n#endif\r\nLJ_FUNC uint64_t lj_carith_divu64(uint64_t a, uint64_t b);\r\nLJ_FUNC int64_t lj_carith_divi64(int64_t a, int64_t b);\r\nLJ_FUNC uint64_t lj_carith_modu64(uint64_t a, uint64_t b);\r\nLJ_FUNC int64_t lj_carith_modi64(int64_t a, int64_t b);\r\nLJ_FUNC uint64_t lj_carith_powu64(uint64_t x, uint64_t k);\r\nLJ_FUNC int64_t lj_carith_powi64(int64_t x, int64_t k);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ccall.c",
    "content": "/*\r\n** FFI C call handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_trace.h\"\r\n\r\n/* Target-specific handling of register arguments. */\r\n#if LJ_TARGET_X86\r\n/* -- x86 calling conventions --------------------------------------------- */\r\n\r\n#if LJ_ABI_WIN\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs bigger than 8 by reference (on stack only). */ \\\r\n  cc->retref = (sz > 8); \\\r\n  if (cc->retref) cc->stack[nsp++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET\r\n\r\n#else\r\n\r\n#if LJ_TARGET_OSX\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size 1, 2, 4 or 8 in registers. */ \\\r\n  cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \\\r\n  if (cc->retref) { \\\r\n    if (ngpr < maxgpr) \\\r\n      cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n    else \\\r\n      cc->stack[nsp++] = (GPRArg)dp; \\\r\n  } else {  /* Struct with single FP field ends up in FPR. */ \\\r\n    cc->resx87 = ccall_classify_struct(cts, ctr); \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  if (cc->resx87) sp = (uint8_t *)&cc->fpr[0]; \\\r\n  memcpy(dp, sp, ctr->size);\r\n\r\n#else\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference (in reg or on stack). */ \\\r\n  if (ngpr < maxgpr) \\\r\n    cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n  else \\\r\n    cc->stack[nsp++] = (GPRArg)dp;\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Return complex float in GPRs and complex double by reference. */ \\\r\n  cc->retref = (sz > 8); \\\r\n  if (cc->retref) { \\\r\n    if (ngpr < maxgpr) \\\r\n      cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n    else \\\r\n      cc->stack[nsp++] = (GPRArg)dp; \\\r\n  }\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!cc->retref) \\\r\n    *(int64_t *)dp = *(int64_t *)sp;  /* Copy complex float from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  ngpr = maxgpr;  /* Pass all structs by value on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 1;  /* Pass complex by value on stack. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (!isfp) {  /* Only non-FP values may be passed in registers. */ \\\r\n    if (n > 1) {  /* Anything > 32 bit is passed on the stack. */ \\\r\n      if (!LJ_ABI_WIN) ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } else if (ngpr + 1 <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64 && LJ_ABI_WIN\r\n/* -- Windows/x64 calling conventions ------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size 1, 2, 4 or 8 in a GPR. */ \\\r\n  cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!cc->retref) \\\r\n    *(int64_t *)dp = *(int64_t *)sp;  /* Copy complex float from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass structs of size 1, 2, 4 or 8 in a GPR by value. */ \\\r\n  if (!(sz == 1 || sz == 2 || sz == 4 || sz == 8)) { \\\r\n    rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n    sz = CTSIZE_PTR;  /* Pass all other structs by reference. */ \\\r\n  }\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex float in a GPR and complex double by reference. */ \\\r\n  if (sz != 2*sizeof(float)) { \\\r\n    rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n    sz = CTSIZE_PTR; \\\r\n  }\r\n\r\n/* Windows/x64 argument registers are strictly positional (use ngpr). */\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (ngpr < maxgpr) { dp = &cc->fpr[ngpr++]; nfpr = ngpr; goto done; } \\\r\n  } else { \\\r\n    if (ngpr < maxgpr) { dp = &cc->gpr[ngpr++]; goto done; } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64\r\n/* -- POSIX/x64 calling conventions --------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  if (ccall_classify_struct(cts, ctr, rcl, 0)) { \\\r\n    cc->retref = 1;  /* Return struct by reference. */ \\\r\n    cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n  } else { \\\r\n    cc->retref = 0;  /* Return small structs in registers. */ \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  ccall_classify_struct(cts, ctr, rcl, 0); \\\r\n  ccall_struct_ret(cc, rcl, dp, ctr->size);\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in one or two FPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (ctr->size == 2*sizeof(float)) {  /* Copy complex float from FPR. */ \\\r\n    *(int64_t *)dp = cc->fpr[0].l[0]; \\\r\n  } else {  /* Copy non-contiguous complex double from FPRs. */ \\\r\n    ((int64_t *)dp)[0] = cc->fpr[0].l[0]; \\\r\n    ((int64_t *)dp)[1] = cc->fpr[1].l[0]; \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  if (!ccall_classify_struct(cts, d, rcl, 0)) { \\\r\n    cc->nsp = nsp; cc->ngpr = ngpr; cc->nfpr = nfpr; \\\r\n    if (ccall_struct_arg(cc, cts, d, rcl, o, narg)) goto err_nyi; \\\r\n    nsp = cc->nsp; ngpr = cc->ngpr; nfpr = cc->nfpr; \\\r\n    continue; \\\r\n  }  /* Pass all other structs by value on stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 2;  /* Pass complex in FPRs or on stack. Needs postprocessing. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) {  /* Try to pass argument in FPRs. */ \\\r\n    int n2 = ctype_isvector(d->info) ? 1 : n; \\\r\n    if (nfpr + n2 <= CCALL_NARG_FPR) { \\\r\n      dp = &cc->fpr[nfpr]; \\\r\n      nfpr += n2; \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    /* Note that reordering is explicitly allowed in the x64 ABI. */ \\\r\n    if (n <= 2 && ngpr + n <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_ARM\r\n/* -- ARM calling conventions --------------------------------------------- */\r\n\r\n#if LJ_ABI_SOFTFP\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size <= 4 in a GPR. */ \\\r\n  cc->retref = !(sz <= 4); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  cc->retref = 1;  /* Return all complex values by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  UNUSED(dp); /* Nothing to do. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG_FP1\r\n#define CCALL_HANDLE_REGARG_FP2\r\n\r\n#else\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = !ccall_classify_struct(cts, ctr, ct); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  if (ccall_classify_struct(cts, ctr, ct) > 1) sp = (uint8_t *)&cc->fpr[0]; \\\r\n  memcpy(dp, sp, ctr->size);\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  if (!(ct->info & CTF_VARARG)) cc->retref = 0;  /* Return complex in FPRs. */\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!(ct->info & CTF_VARARG)) memcpy(dp, &cc->fpr[0], ctr->size);\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  isfp = (ccall_classify_struct(cts, d, ct) > 1);\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 1;  /* Pass complex by value in FPRs or on stack. */\r\n\r\n#define CCALL_HANDLE_REGARG_FP1 \\\r\n  if (isfp && !(ct->info & CTF_VARARG)) { \\\r\n    if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \\\r\n      if (nfpr + (n >> 1) <= CCALL_NARG_FPR) { \\\r\n\tdp = &cc->fpr[nfpr]; \\\r\n\tnfpr += (n >> 1); \\\r\n\tgoto done; \\\r\n      } \\\r\n    } else { \\\r\n      if (sz > 1 && fprodd != nfpr) fprodd = 0; \\\r\n      if (fprodd) { \\\r\n\tif (2*nfpr+n <= 2*CCALL_NARG_FPR+1) { \\\r\n\t  dp = (void *)&cc->fpr[fprodd-1].f[1]; \\\r\n\t  nfpr += (n >> 1); \\\r\n\t  if ((n & 1)) fprodd = 0; else fprodd = nfpr-1; \\\r\n\t  goto done; \\\r\n\t} \\\r\n      } else { \\\r\n\tif (2*nfpr+n <= 2*CCALL_NARG_FPR) { \\\r\n\t  dp = (void *)&cc->fpr[nfpr]; \\\r\n\t  nfpr += (n >> 1); \\\r\n\t  if ((n & 1)) fprodd = ++nfpr; else fprodd = 0; \\\r\n\t  goto done; \\\r\n\t} \\\r\n      } \\\r\n    } \\\r\n    fprodd = 0;  /* No reordering after the first FP value is on stack. */ \\\r\n  } else {\r\n\r\n#define CCALL_HANDLE_REGARG_FP2\t}\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  CCALL_HANDLE_REGARG_FP1 \\\r\n  if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \\\r\n    if (ngpr < maxgpr) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n  } \\\r\n  if (ngpr < maxgpr) { \\\r\n    dp = &cc->gpr[ngpr]; \\\r\n    if (ngpr + n > maxgpr) { \\\r\n      nsp += ngpr + n - maxgpr;  /* Assumes contiguous gpr/stack fields. */ \\\r\n      if (nsp > CCALL_MAXSTACK) goto err_nyi;  /* Too many arguments. */ \\\r\n      ngpr = maxgpr; \\\r\n    } else { \\\r\n      ngpr += n; \\\r\n    } \\\r\n    goto done; \\\r\n  } CCALL_HANDLE_REGARG_FP2\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if ((ct->info & CTF_VARARG)) sp = (uint8_t *)&cc->gpr[0];\r\n\r\n#elif LJ_TARGET_PPC\r\n/* -- PPC calling conventions --------------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in 2 or 4 GPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  memcpy(dp, sp, ctr->size);  /* Copy complex from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n  sz = CTSIZE_PTR;  /* Pass all structs by reference. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) {  /* Try to pass argument in FPRs. */ \\\r\n    if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n      dp = &cc->fpr[nfpr]; \\\r\n      nfpr += 1; \\\r\n      d = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */ \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    if (n > 1) { \\\r\n      lua_assert(n == 2 || n == 4);  /* int64_t or complex (float). */ \\\r\n      if (ctype_isinteger(d->info)) \\\r\n\tngpr = (ngpr + 1u) & ~1u;  /* Align int64_t to regpair. */ \\\r\n      else if (ngpr + n > maxgpr) \\\r\n\tngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    ctr = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */\r\n\r\n#elif LJ_TARGET_PPCSPE\r\n/* -- PPC/SPE calling conventions ----------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in 2 or 4 GPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  memcpy(dp, sp, ctr->size);  /* Copy complex from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n  sz = CTSIZE_PTR;  /* Pass all structs by reference. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n/* PPC/SPE has a softfp ABI. */\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (n > 1) {  /* Doesn't fit in a single GPR? */ \\\r\n    lua_assert(n == 2 || n == 4);  /* int64_t, double or complex (float). */ \\\r\n    if (n == 2) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Only align 64 bit value to regpair. */ \\\r\n    else if (ngpr + n > maxgpr) \\\r\n      ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n  } \\\r\n  if (ngpr + n <= maxgpr) { \\\r\n    dp = &cc->gpr[ngpr]; \\\r\n    ngpr += n; \\\r\n    goto done; \\\r\n  }\r\n\r\n#elif LJ_TARGET_MIPS\r\n/* -- MIPS calling conventions -------------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in 1 or 2 FPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (ctr->size == 2*sizeof(float)) {  /* Copy complex float from FPRs. */ \\\r\n    ((float *)dp)[0] = cc->fpr[0].f; \\\r\n    ((float *)dp)[1] = cc->fpr[1].f; \\\r\n  } else {  /* Copy complex double from FPRs. */ \\\r\n    ((double *)dp)[0] = cc->fpr[0].d; \\\r\n    ((double *)dp)[1] = cc->fpr[1].d; \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp && nfpr < CCALL_NARG_FPR && !(ct->info & CTF_VARARG)) { \\\r\n    /* Try to pass argument in FPRs. */ \\\r\n    dp = n == 1 ? (void *)&cc->fpr[nfpr].f : (void *)&cc->fpr[nfpr].d; \\\r\n    nfpr++; ngpr += n; \\\r\n    goto done; \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    nfpr = CCALL_NARG_FPR; \\\r\n    if ((d->info & CTF_ALIGN) > CTALIGN_PTR) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr < maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      if (ngpr + n > maxgpr) { \\\r\n\tnsp += ngpr + n - maxgpr;  /* Assumes contiguous gpr/stack fields. */ \\\r\n\tif (nsp > CCALL_MAXSTACK) goto err_nyi;  /* Too many arguments. */ \\\r\n\tngpr = maxgpr; \\\r\n      } else { \\\r\n\tngpr += n; \\\r\n      } \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    sp = (uint8_t *)&cc->fpr[0].f;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CCALL_HANDLE_STRUCTRET2\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  memcpy(dp, sp, ctr->size);  /* Copy struct return value from GPRs. */\r\n#endif\r\n\r\n/* -- x86 OSX ABI struct classification ----------------------------------- */\r\n\r\n#if LJ_TARGET_X86 && LJ_TARGET_OSX\r\n\r\n/* Check for struct with single FP field. */\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct)\r\n{\r\n  CTSize sz = ct->size;\r\n  if (!(sz == sizeof(float) || sz == sizeof(double))) return 0;\r\n  if ((ct->info & CTF_UNION)) return 0;\r\n  while (ct->sib) {\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      CType *sct = ctype_rawchild(cts, ct);\r\n      if (ctype_isfp(sct->info)) {\r\n\tif (sct->size == sz)\r\n\t  return (sz >> 2);  /* Return 1 for float or 2 for double. */\r\n      } else if (ctype_isstruct(sct->info)) {\r\n\tif (sct->size)\r\n\t  return ccall_classify_struct(cts, sct);\r\n      } else {\r\n\tbreak;\r\n      }\r\n    } else if (ctype_isbitfield(ct->info)) {\r\n      break;\r\n    } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      CType *sct = ctype_rawchild(cts, ct);\r\n      if (sct->size)\r\n\treturn ccall_classify_struct(cts, sct);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n#endif\r\n\r\n/* -- x64 struct classification ------------------------------------------- */\r\n\r\n#if LJ_TARGET_X64 && !LJ_ABI_WIN\r\n\r\n/* Register classes for x64 struct classification. */\r\n#define CCALL_RCL_INT\t1\r\n#define CCALL_RCL_SSE\t2\r\n#define CCALL_RCL_MEM\t4\r\n/* NYI: classify vectors. */\r\n\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs);\r\n\r\n/* Classify a C type. */\r\nstatic void ccall_classify_ct(CTState *cts, CType *ct, int *rcl, CTSize ofs)\r\n{\r\n  if (ctype_isarray(ct->info)) {\r\n    CType *cct = ctype_rawchild(cts, ct);\r\n    CTSize eofs, esz = cct->size, asz = ct->size;\r\n    for (eofs = 0; eofs < asz; eofs += esz)\r\n      ccall_classify_ct(cts, cct, rcl, ofs+eofs);\r\n  } else if (ctype_isstruct(ct->info)) {\r\n    ccall_classify_struct(cts, ct, rcl, ofs);\r\n  } else {\r\n    int cl = ctype_isfp(ct->info) ? CCALL_RCL_SSE : CCALL_RCL_INT;\r\n    lua_assert(ctype_hassize(ct->info));\r\n    if ((ofs & (ct->size-1))) cl = CCALL_RCL_MEM;  /* Unaligned. */\r\n    rcl[(ofs >= 8)] |= cl;\r\n  }\r\n}\r\n\r\n/* Recursively classify a struct based on its fields. */\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs)\r\n{\r\n  if (ct->size > 16) return CCALL_RCL_MEM;  /* Too big, gets memory class. */\r\n  while (ct->sib) {\r\n    CTSize fofs;\r\n    ct = ctype_get(cts, ct->sib);\r\n    fofs = ofs+ct->size;\r\n    if (ctype_isfield(ct->info))\r\n      ccall_classify_ct(cts, ctype_rawchild(cts, ct), rcl, fofs);\r\n    else if (ctype_isbitfield(ct->info))\r\n      rcl[(fofs >= 8)] |= CCALL_RCL_INT;  /* NYI: unaligned bitfields? */\r\n    else if (ctype_isxattrib(ct->info, CTA_SUBTYPE))\r\n      ccall_classify_struct(cts, ctype_rawchild(cts, ct), rcl, fofs);\r\n  }\r\n  return ((rcl[0]|rcl[1]) & CCALL_RCL_MEM);  /* Memory class? */\r\n}\r\n\r\n/* Try to split up a small struct into registers. */\r\nstatic int ccall_struct_reg(CCallState *cc, GPRArg *dp, int *rcl)\r\n{\r\n  MSize ngpr = cc->ngpr, nfpr = cc->nfpr;\r\n  uint32_t i;\r\n  for (i = 0; i < 2; i++) {\r\n    lua_assert(!(rcl[i] & CCALL_RCL_MEM));\r\n    if ((rcl[i] & CCALL_RCL_INT)) {  /* Integer class takes precedence. */\r\n      if (ngpr >= CCALL_NARG_GPR) return 1;  /* Register overflow. */\r\n      cc->gpr[ngpr++] = dp[i];\r\n    } else if ((rcl[i] & CCALL_RCL_SSE)) {\r\n      if (nfpr >= CCALL_NARG_FPR) return 1;  /* Register overflow. */\r\n      cc->fpr[nfpr++].l[0] = dp[i];\r\n    }\r\n  }\r\n  cc->ngpr = ngpr; cc->nfpr = nfpr;\r\n  return 0;  /* Ok. */\r\n}\r\n\r\n/* Pass a small struct argument. */\r\nstatic int ccall_struct_arg(CCallState *cc, CTState *cts, CType *d, int *rcl,\r\n\t\t\t    TValue *o, int narg)\r\n{\r\n  GPRArg dp[2];\r\n  dp[0] = dp[1] = 0;\r\n  /* Convert to temp. struct. */\r\n  lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));\r\n  if (ccall_struct_reg(cc, dp, rcl)) {  /* Register overflow? Pass on stack. */\r\n    MSize nsp = cc->nsp, n = rcl[1] ? 2 : 1;\r\n    if (nsp + n > CCALL_MAXSTACK) return 1;  /* Too many arguments. */\r\n    cc->nsp = nsp + n;\r\n    memcpy(&cc->stack[nsp], dp, n*CTSIZE_PTR);\r\n  }\r\n  return 0;  /* Ok. */\r\n}\r\n\r\n/* Combine returned small struct. */\r\nstatic void ccall_struct_ret(CCallState *cc, int *rcl, uint8_t *dp, CTSize sz)\r\n{\r\n  GPRArg sp[2];\r\n  MSize ngpr = 0, nfpr = 0;\r\n  uint32_t i;\r\n  for (i = 0; i < 2; i++) {\r\n    if ((rcl[i] & CCALL_RCL_INT)) {  /* Integer class takes precedence. */\r\n      sp[i] = cc->gpr[ngpr++];\r\n    } else if ((rcl[i] & CCALL_RCL_SSE)) {\r\n      sp[i] = cc->fpr[nfpr++].l[0];\r\n    }\r\n  }\r\n  memcpy(dp, sp, sz);\r\n}\r\n#endif\r\n\r\n/* -- ARM hard-float ABI struct classification ---------------------------- */\r\n\r\n#if LJ_TARGET_ARM && !LJ_ABI_SOFTFP\r\n\r\n/* Classify a struct based on its fields. */\r\nstatic unsigned int ccall_classify_struct(CTState *cts, CType *ct, CType *ctf)\r\n{\r\n  CTSize sz = ct->size;\r\n  unsigned int r = 0, n = 0, isu = (ct->info & CTF_UNION);\r\n  if ((ctf->info & CTF_VARARG)) goto noth;\r\n  while (ct->sib) {\r\n    CType *sct;\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n      if (ctype_isfp(sct->info)) {\r\n\tr |= sct->size;\r\n\tif (!isu) n++; else if (n == 0) n = 1;\r\n      } else if (ctype_iscomplex(sct->info)) {\r\n\tr |= (sct->size >> 1);\r\n\tif (!isu) n += 2; else if (n < 2) n = 2;\r\n      } else if (ctype_isstruct(sct->info)) {\r\n\tgoto substruct;\r\n      } else {\r\n\tgoto noth;\r\n      }\r\n    } else if (ctype_isbitfield(ct->info)) {\r\n      goto noth;\r\n    } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n    substruct:\r\n      if (sct->size > 0) {\r\n\tunsigned int s = ccall_classify_struct(cts, sct, ctf);\r\n\tif (s <= 1) goto noth;\r\n\tr |= (s & 255);\r\n\tif (!isu) n += (s >> 8); else if (n < (s >>8)) n = (s >> 8);\r\n      }\r\n    }\r\n  }\r\n  if ((r == 4 || r == 8) && n <= 4)\r\n    return r + (n << 8);\r\nnoth:  /* Not a homogeneous float/double aggregate. */\r\n  return (sz <= 4);  /* Return structs of size <= 4 in a GPR. */\r\n}\r\n\r\n#endif\r\n\r\n/* -- Common C call handling ---------------------------------------------- */\r\n\r\n/* Infer the destination CTypeID for a vararg argument. */\r\nCTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o)\r\n{\r\n  if (tvisnumber(o)) {\r\n    return CTID_DOUBLE;\r\n  } else if (tviscdata(o)) {\r\n    CTypeID id = cdataV(o)->ctypeid;\r\n    CType *s = ctype_get(cts, id);\r\n    if (ctype_isrefarray(s->info)) {\r\n      return lj_ctype_intern(cts,\r\n\t       CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(s->info)), CTSIZE_PTR);\r\n    } else if (ctype_isstruct(s->info) || ctype_isfunc(s->info)) {\r\n      /* NYI: how to pass a struct by value in a vararg argument? */\r\n      return lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR);\r\n    } else if (ctype_isfp(s->info) && s->size == sizeof(float)) {\r\n      return CTID_DOUBLE;\r\n    } else {\r\n      return id;\r\n    }\r\n  } else if (tvisstr(o)) {\r\n    return CTID_P_CCHAR;\r\n  } else if (tvisbool(o)) {\r\n    return CTID_BOOL;\r\n  } else {\r\n    return CTID_P_VOID;\r\n  }\r\n}\r\n\r\n/* Setup arguments for C call. */\r\nstatic int ccall_set_args(lua_State *L, CTState *cts, CType *ct,\r\n\t\t\t  CCallState *cc)\r\n{\r\n  int gcsteps = 0;\r\n  TValue *o, *top = L->top;\r\n  CTypeID fid;\r\n  CType *ctr;\r\n  MSize maxgpr, ngpr = 0, nsp = 0, narg;\r\n#if CCALL_NARG_FPR\r\n  MSize nfpr = 0;\r\n#if LJ_TARGET_ARM\r\n  MSize fprodd = 0;\r\n#endif\r\n#endif\r\n\r\n  /* Clear unused regs to get some determinism in case of misdeclaration. */\r\n  memset(cc->gpr, 0, sizeof(cc->gpr));\r\n#if CCALL_NUM_FPR\r\n  memset(cc->fpr, 0, sizeof(cc->fpr));\r\n#endif\r\n\r\n#if LJ_TARGET_X86\r\n  /* x86 has several different calling conventions. */\r\n  cc->resx87 = 0;\r\n  switch (ctype_cconv(ct->info)) {\r\n  case CTCC_FASTCALL: maxgpr = 2; break;\r\n  case CTCC_THISCALL: maxgpr = 1; break;\r\n  default: maxgpr = 0; break;\r\n  }\r\n#else\r\n  maxgpr = CCALL_NARG_GPR;\r\n#endif\r\n\r\n  /* Perform required setup for some result types. */\r\n  ctr = ctype_rawchild(cts, ct);\r\n  if (ctype_isvector(ctr->info)) {\r\n    if (!(CCALL_VECTOR_REG && (ctr->size == 8 || ctr->size == 16)))\r\n      goto err_nyi;\r\n  } else if (ctype_iscomplex(ctr->info) || ctype_isstruct(ctr->info)) {\r\n    /* Preallocate cdata object and anchor it after arguments. */\r\n    CTSize sz = ctr->size;\r\n    GCcdata *cd = lj_cdata_new(cts, ctype_cid(ct->info), sz);\r\n    void *dp = cdataptr(cd);\r\n    setcdataV(L, L->top++, cd);\r\n    if (ctype_isstruct(ctr->info)) {\r\n      CCALL_HANDLE_STRUCTRET\r\n    } else {\r\n      CCALL_HANDLE_COMPLEXRET\r\n    }\r\n#if LJ_TARGET_X86\r\n  } else if (ctype_isfp(ctr->info)) {\r\n    cc->resx87 = ctr->size == sizeof(float) ? 1 : 2;\r\n#endif\r\n  }\r\n\r\n  /* Skip initial attributes. */\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) break;\r\n    fid = ctf->sib;\r\n  }\r\n\r\n  /* Walk through all passed arguments. */\r\n  for (o = L->base+1, narg = 1; o < top; o++, narg++) {\r\n    CTypeID did;\r\n    CType *d;\r\n    CTSize sz;\r\n    MSize n, isfp = 0, isva = 0;\r\n    void *dp, *rp = NULL;\r\n\r\n    if (fid) {  /* Get argument type from field. */\r\n      CType *ctf = ctype_get(cts, fid);\r\n      fid = ctf->sib;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      did = ctype_cid(ctf->info);\r\n    } else {\r\n      if (!(ct->info & CTF_VARARG))\r\n\tlj_err_caller(L, LJ_ERR_FFI_NUMARG);  /* Too many arguments. */\r\n      did = lj_ccall_ctid_vararg(cts, o);  /* Infer vararg type. */\r\n      isva = 1;\r\n    }\r\n    d = ctype_raw(cts, did);\r\n    sz = d->size;\r\n\r\n    /* Find out how (by value/ref) and where (GPR/FPR) to pass an argument. */\r\n    if (ctype_isnum(d->info)) {\r\n      if (sz > 8) goto err_nyi;\r\n      if ((d->info & CTF_FP))\r\n\tisfp = 1;\r\n    } else if (ctype_isvector(d->info)) {\r\n      if (CCALL_VECTOR_REG && (sz == 8 || sz == 16))\r\n\tisfp = 1;\r\n      else\r\n\tgoto err_nyi;\r\n    } else if (ctype_isstruct(d->info)) {\r\n      CCALL_HANDLE_STRUCTARG\r\n    } else if (ctype_iscomplex(d->info)) {\r\n      CCALL_HANDLE_COMPLEXARG\r\n    } else {\r\n      sz = CTSIZE_PTR;\r\n    }\r\n    sz = (sz + CTSIZE_PTR-1) & ~(CTSIZE_PTR-1);\r\n    n = sz / CTSIZE_PTR;  /* Number of GPRs or stack slots needed. */\r\n\r\n    CCALL_HANDLE_REGARG  /* Handle register arguments. */\r\n\r\n    /* Otherwise pass argument on stack. */\r\n    if (CCALL_ALIGN_STACKARG && !rp && (d->info & CTF_ALIGN) > CTALIGN_PTR) {\r\n      MSize align = (1u << ctype_align(d->info-CTALIGN_PTR)) -1;\r\n      nsp = (nsp + align) & ~align;  /* Align argument on stack. */\r\n    }\r\n    if (nsp + n > CCALL_MAXSTACK) {  /* Too many arguments. */\r\n    err_nyi:\r\n      lj_err_caller(L, LJ_ERR_FFI_NYICALL);\r\n    }\r\n    dp = &cc->stack[nsp];\r\n    nsp += n;\r\n    isva = 0;\r\n\r\n  done:\r\n    if (rp) {  /* Pass by reference. */\r\n      gcsteps++;\r\n      *(void **)dp = rp;\r\n      dp = rp;\r\n    }\r\n    lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));\r\n    /* Extend passed integers to 32 bits at least. */\r\n    if (ctype_isinteger_or_bool(d->info) && d->size < 4) {\r\n      if (d->info & CTF_UNSIGNED)\r\n\t*(uint32_t *)dp = d->size == 1 ? (uint32_t)*(uint8_t *)dp :\r\n\t\t\t\t\t (uint32_t)*(uint16_t *)dp;\r\n      else\r\n\t*(int32_t *)dp = d->size == 1 ? (int32_t)*(int8_t *)dp :\r\n\t\t\t\t\t(int32_t)*(int16_t *)dp;\r\n    }\r\n#if LJ_TARGET_X64 && LJ_ABI_WIN\r\n    if (isva) {  /* Windows/x64 mirrors varargs in both register sets. */\r\n      if (nfpr == ngpr)\r\n\tcc->gpr[ngpr-1] = cc->fpr[ngpr-1].l[0];\r\n      else\r\n\tcc->fpr[ngpr-1].l[0] = cc->gpr[ngpr-1];\r\n    }\r\n#else\r\n    UNUSED(isva);\r\n#endif\r\n#if LJ_TARGET_X64 && !LJ_ABI_WIN\r\n    if (isfp == 2 && n == 2 && (uint8_t *)dp == (uint8_t *)&cc->fpr[nfpr-2]) {\r\n      cc->fpr[nfpr-1].d[0] = cc->fpr[nfpr-2].d[1];  /* Split complex double. */\r\n      cc->fpr[nfpr-2].d[1] = 0;\r\n    }\r\n#else\r\n    UNUSED(isfp);\r\n#endif\r\n  }\r\n  if (fid) lj_err_caller(L, LJ_ERR_FFI_NUMARG);  /* Too few arguments. */\r\n\r\n#if LJ_TARGET_X64 || LJ_TARGET_PPC\r\n  cc->nfpr = nfpr;  /* Required for vararg functions. */\r\n#endif\r\n  cc->nsp = nsp;\r\n  cc->spadj = (CCALL_SPS_FREE + CCALL_SPS_EXTRA)*CTSIZE_PTR;\r\n  if (nsp > CCALL_SPS_FREE)\r\n    cc->spadj += (((nsp-CCALL_SPS_FREE)*CTSIZE_PTR + 15u) & ~15u);\r\n  return gcsteps;\r\n}\r\n\r\n/* Get results from C call. */\r\nstatic int ccall_get_results(lua_State *L, CTState *cts, CType *ct,\r\n\t\t\t     CCallState *cc, int *ret)\r\n{\r\n  CType *ctr = ctype_rawchild(cts, ct);\r\n  uint8_t *sp = (uint8_t *)&cc->gpr[0];\r\n  if (ctype_isvoid(ctr->info)) {\r\n    *ret = 0;  /* Zero results. */\r\n    return 0;  /* No additional GC step. */\r\n  }\r\n  *ret = 1;  /* One result. */\r\n  if (ctype_isstruct(ctr->info)) {\r\n    /* Return cdata object which is already on top of stack. */\r\n    if (!cc->retref) {\r\n      void *dp = cdataptr(cdataV(L->top-1));  /* Use preallocated object. */\r\n      CCALL_HANDLE_STRUCTRET2\r\n    }\r\n    return 1;  /* One GC step. */\r\n  }\r\n  if (ctype_iscomplex(ctr->info)) {\r\n    /* Return cdata object which is already on top of stack. */\r\n    void *dp = cdataptr(cdataV(L->top-1));  /* Use preallocated object. */\r\n    CCALL_HANDLE_COMPLEXRET2\r\n    return 1;  /* One GC step. */\r\n  }\r\n  if (LJ_BE && ctype_isinteger_or_bool(ctr->info) && ctr->size < CTSIZE_PTR)\r\n    sp += (CTSIZE_PTR - ctr->size);\r\n#if CCALL_NUM_FPR\r\n  if (ctype_isfp(ctr->info) || ctype_isvector(ctr->info))\r\n    sp = (uint8_t *)&cc->fpr[0];\r\n#endif\r\n#ifdef CCALL_HANDLE_RET\r\n  CCALL_HANDLE_RET\r\n#endif\r\n  /* No reference types end up here, so there's no need for the CTypeID. */\r\n  lua_assert(!(ctype_isrefarray(ctr->info) || ctype_isstruct(ctr->info)));\r\n  return lj_cconv_tv_ct(cts, ctr, 0, L->top-1, sp);\r\n}\r\n\r\n/* Call C function. */\r\nint lj_ccall_func(lua_State *L, GCcdata *cd)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  CTSize sz = CTSIZE_PTR;\r\n  if (ctype_isptr(ct->info)) {\r\n    sz = ct->size;\r\n    ct = ctype_rawchild(cts, ct);\r\n  }\r\n  if (ctype_isfunc(ct->info)) {\r\n    CCallState cc;\r\n    int gcsteps, ret;\r\n    cc.func = (void (*)(void))cdata_getptr(cdataptr(cd), sz);\r\n    gcsteps = ccall_set_args(L, cts, ct, &cc);\r\n    ct = (CType *)((intptr_t)ct-(intptr_t)cts->tab);\r\n    cts->cb.slot = ~0u;\r\n    lj_vm_ffi_call(&cc);\r\n    if (cts->cb.slot != ~0u) {  /* Blacklist function that called a callback. */\r\n      TValue tv;\r\n      setlightudV(&tv, (void *)cc.func);\r\n      setboolV(lj_tab_set(L, cts->miscmap, &tv), 1);\r\n    }\r\n    ct = (CType *)((intptr_t)ct+(intptr_t)cts->tab);  /* May be reallocated. */\r\n    gcsteps += ccall_get_results(L, cts, ct, &cc, &ret);\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n    /* Automatically detect __stdcall and fix up C function declaration. */\r\n    if (cc.spadj && ctype_cconv(ct->info) == CTCC_CDECL) {\r\n      CTF_INSERT(ct->info, CCONV, CTCC_STDCALL);\r\n      lj_trace_abort(G(L));\r\n    }\r\n#endif\r\n    while (gcsteps-- > 0)\r\n      lj_gc_check(L);\r\n    return ret;\r\n  }\r\n  return -1;  /* Not a function. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ccall.h",
    "content": "/*\r\n** FFI C call handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCALL_H\r\n#define _LJ_CCALL_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* -- C calling conventions ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n\r\n#if LJ_TARGET_X86\r\n#define CCALL_NARG_GPR\t\t2\t/* For fastcall arguments. */\r\n#define CCALL_NARG_FPR\t\t0\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t1\t/* For FP results on x87 stack. */\r\n#define CCALL_ALIGN_STACKARG\t0\t/* Don't align argument on stack. */\r\n#elif LJ_ABI_WIN\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NARG_FPR\t\t4\r\n#define CCALL_NRET_GPR\t\t1\r\n#define CCALL_NRET_FPR\t\t1\r\n#define CCALL_SPS_EXTRA\t\t4\r\n#else\r\n#define CCALL_NARG_GPR\t\t6\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t2\r\n#define CCALL_VECTOR_REG\t1\t/* Pass vectors in registers. */\r\n#endif\r\n\r\n#define CCALL_SPS_FREE\t\t1\r\n#define CCALL_ALIGN_CALLSTATE\t16\r\n\r\ntypedef LJ_ALIGN(16) union FPRArg {\r\n  double d[2];\r\n  float f[4];\r\n  uint8_t b[16];\r\n  uint16_t s[8];\r\n  int i[4];\r\n  int64_t l[2];\r\n} FPRArg;\r\n\r\ntypedef intptr_t GPRArg;\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NRET_GPR\t\t2\t/* For softfp double. */\r\n#if LJ_ABI_SOFTFP\r\n#define CCALL_NARG_FPR\t\t0\r\n#define CCALL_NRET_FPR\t\t0\r\n#else\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_FPR\t\t4\r\n#endif\r\n#define CCALL_SPS_FREE\t\t0\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef union FPRArg {\r\n  double d;\r\n  float f[2];\r\n} FPRArg;\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CCALL_NARG_GPR\t\t8\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_GPR\t\t4\t/* For complex double. */\r\n#define CCALL_NRET_FPR\t\t1\r\n#define CCALL_SPS_EXTRA\t\t4\r\n#define CCALL_SPS_FREE\t\t0\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef double FPRArg;\r\n\r\n#elif LJ_TARGET_PPCSPE\r\n\r\n#define CCALL_NARG_GPR\t\t8\r\n#define CCALL_NARG_FPR\t\t0\r\n#define CCALL_NRET_GPR\t\t4\t/* For softfp complex double. */\r\n#define CCALL_NRET_FPR\t\t0\r\n#define CCALL_SPS_FREE\t\t0\t/* NYI */\r\n\r\ntypedef intptr_t GPRArg;\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NARG_FPR\t\t2\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t2\r\n#define CCALL_SPS_EXTRA\t\t7\r\n#define CCALL_SPS_FREE\t\t1\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef union FPRArg {\r\n  double d;\r\n  struct { LJ_ENDIAN_LOHI(float f; , float g;) };\r\n} FPRArg;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CCALL_SPS_EXTRA\r\n#define CCALL_SPS_EXTRA\t\t0\r\n#endif\r\n#ifndef CCALL_VECTOR_REG\r\n#define CCALL_VECTOR_REG\t0\r\n#endif\r\n#ifndef CCALL_ALIGN_STACKARG\r\n#define CCALL_ALIGN_STACKARG\t1\r\n#endif\r\n#ifndef CCALL_ALIGN_CALLSTATE\r\n#define CCALL_ALIGN_CALLSTATE\t8\r\n#endif\r\n\r\n#define CCALL_NUM_GPR \\\r\n  (CCALL_NARG_GPR > CCALL_NRET_GPR ? CCALL_NARG_GPR : CCALL_NRET_GPR)\r\n#define CCALL_NUM_FPR \\\r\n  (CCALL_NARG_FPR > CCALL_NRET_FPR ? CCALL_NARG_FPR : CCALL_NRET_FPR)\r\n\r\n/* Check against constants in lj_ctype.h. */\r\nLJ_STATIC_ASSERT(CCALL_NUM_GPR <= CCALL_MAX_GPR);\r\nLJ_STATIC_ASSERT(CCALL_NUM_FPR <= CCALL_MAX_FPR);\r\n\r\n#define CCALL_MAXSTACK\t\t32\r\n\r\n/* -- C call state -------------------------------------------------------- */\r\n\r\ntypedef LJ_ALIGN(CCALL_ALIGN_CALLSTATE) struct CCallState {\r\n  void (*func)(void);\t\t/* Pointer to called function. */\r\n  uint32_t spadj;\t\t/* Stack pointer adjustment. */\r\n  uint8_t nsp;\t\t\t/* Number of stack slots. */\r\n  uint8_t retref;\t\t/* Return value by reference. */\r\n#if LJ_TARGET_X64\r\n  uint8_t ngpr;\t\t\t/* Number of arguments in GPRs. */\r\n  uint8_t nfpr;\t\t\t/* Number of arguments in FPRs. */\r\n#elif LJ_TARGET_X86\r\n  uint8_t resx87;\t\t/* Result on x87 stack: 1:float, 2:double. */\r\n#elif LJ_TARGET_PPC\r\n  uint8_t nfpr;\t\t\t/* Number of arguments in FPRs. */\r\n#endif\r\n#if LJ_32\r\n  int32_t align1;\r\n#endif\r\n#if CCALL_NUM_FPR\r\n  FPRArg fpr[CCALL_NUM_FPR];\t/* Arguments/results in FPRs. */\r\n#endif\r\n  GPRArg gpr[CCALL_NUM_GPR];\t/* Arguments/results in GPRs. */\r\n  GPRArg stack[CCALL_MAXSTACK];\t/* Stack slots. */\r\n} CCallState;\r\n\r\n/* -- C call handling ----------------------------------------------------- */\r\n\r\n/* Really belongs to lj_vm.h. */\r\nLJ_ASMF void LJ_FASTCALL lj_vm_ffi_call(CCallState *cc);\r\n\r\nLJ_FUNC CTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o);\r\nLJ_FUNC int lj_ccall_func(lua_State *L, GCcdata *cd);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ccallback.c",
    "content": "/*\r\n** FFI C callback handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ccallback.h\"\r\n#include \"lj_target.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Target-specific handling of callback slots -------------------------- */\r\n\r\n#define CALLBACK_MCODE_SIZE\t(LJ_PAGESIZE * LJ_NUM_CBPAGE)\r\n\r\n#if LJ_OS_NOJIT\r\n\r\n/* Disabled callback support. */\r\n#define CALLBACK_SLOT2OFS(slot)\t(0*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t(0*(ofs))\r\n#define CALLBACK_MAX_SLOT\t0\r\n\r\n#elif LJ_TARGET_X86ORX64\r\n\r\n#define CALLBACK_MCODE_HEAD\t(LJ_64 ? 8 : 0)\r\n#define CALLBACK_MCODE_GROUP\t(-2+1+2+5+(LJ_64 ? 6 : 5))\r\n\r\n#define CALLBACK_SLOT2OFS(slot) \\\r\n  (CALLBACK_MCODE_HEAD + CALLBACK_MCODE_GROUP*((slot)/32) + 4*(slot))\r\n\r\nstatic MSize CALLBACK_OFS2SLOT(MSize ofs)\r\n{\r\n  MSize group;\r\n  ofs -= CALLBACK_MCODE_HEAD;\r\n  group = ofs / (32*4 + CALLBACK_MCODE_GROUP);\r\n  return (ofs % (32*4 + CALLBACK_MCODE_GROUP))/4 + group*32;\r\n}\r\n\r\n#define CALLBACK_MAX_SLOT \\\r\n  (((CALLBACK_MCODE_SIZE-CALLBACK_MCODE_HEAD)/(CALLBACK_MCODE_GROUP+4*32))*32)\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t32\r\n#define CALLBACK_SLOT2OFS(slot)\t\t(CALLBACK_MCODE_HEAD + 8*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t\t(((ofs)-CALLBACK_MCODE_HEAD)/8)\r\n#define CALLBACK_MAX_SLOT\t\t(CALLBACK_OFS2SLOT(CALLBACK_MCODE_SIZE))\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t24\r\n#define CALLBACK_SLOT2OFS(slot)\t\t(CALLBACK_MCODE_HEAD + 8*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t\t(((ofs)-CALLBACK_MCODE_HEAD)/8)\r\n#define CALLBACK_MAX_SLOT\t\t(CALLBACK_OFS2SLOT(CALLBACK_MCODE_SIZE))\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t24\r\n#define CALLBACK_SLOT2OFS(slot)\t\t(CALLBACK_MCODE_HEAD + 8*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t\t(((ofs)-CALLBACK_MCODE_HEAD)/8)\r\n#define CALLBACK_MAX_SLOT\t\t(CALLBACK_OFS2SLOT(CALLBACK_MCODE_SIZE))\r\n\r\n#else\r\n\r\n/* Missing support for this architecture. */\r\n#define CALLBACK_SLOT2OFS(slot)\t(0*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t(0*(ofs))\r\n#define CALLBACK_MAX_SLOT\t0\r\n\r\n#endif\r\n\r\n/* Convert callback slot number to callback function pointer. */\r\nstatic void *callback_slot2ptr(CTState *cts, MSize slot)\r\n{\r\n  return (uint8_t *)cts->cb.mcode + CALLBACK_SLOT2OFS(slot);\r\n}\r\n\r\n/* Convert callback function pointer to slot number. */\r\nMSize lj_ccallback_ptr2slot(CTState *cts, void *p)\r\n{\r\n  uintptr_t ofs = (uintptr_t)((uint8_t *)p -(uint8_t *)cts->cb.mcode);\r\n  if (ofs < CALLBACK_MCODE_SIZE) {\r\n    MSize slot = CALLBACK_OFS2SLOT((MSize)ofs);\r\n    if (CALLBACK_SLOT2OFS(slot) == (MSize)ofs)\r\n      return slot;\r\n  }\r\n  return ~0u;  /* Not a known callback function pointer. */\r\n}\r\n\r\n/* Initialize machine code for callback function pointers. */\r\n#if LJ_OS_NOJIT\r\n/* Disabled callback support. */\r\n#define callback_mcode_init(g, p)\tUNUSED(p)\r\n#elif LJ_TARGET_X86ORX64\r\nstatic void callback_mcode_init(global_State *g, uint8_t *page)\r\n{\r\n  uint8_t *p = page;\r\n  uint8_t *target = (uint8_t *)(void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n#if LJ_64\r\n  *(void **)p = target; p += 8;\r\n#endif\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    /* mov al, slot; jmp group */\r\n    *p++ = XI_MOVrib | RID_EAX; *p++ = (uint8_t)slot;\r\n    if ((slot & 31) == 31 || slot == CALLBACK_MAX_SLOT-1) {\r\n      /* push ebp/rbp; mov ah, slot>>8; mov ebp, &g. */\r\n      *p++ = XI_PUSH + RID_EBP;\r\n      *p++ = XI_MOVrib | (RID_EAX+4); *p++ = (uint8_t)(slot >> 8);\r\n      *p++ = XI_MOVri | RID_EBP;\r\n      *(int32_t *)p = i32ptr(g); p += 4;\r\n#if LJ_64\r\n      /* jmp [rip-pageofs] where lj_vm_ffi_callback is stored. */\r\n      *p++ = XI_GROUP5; *p++ = XM_OFS0 + (XOg_JMP<<3) + RID_EBP;\r\n      *(int32_t *)p = (int32_t)(page-(p+4)); p += 4;\r\n#else\r\n      /* jmp lj_vm_ffi_callback. */\r\n      *p++ = XI_JMP; *(int32_t *)p = target-(p+4); p += 4;\r\n#endif\r\n    } else {\r\n      *p++ = XI_JMPs; *p++ = (uint8_t)((2+2)*(31-(slot&31)) - 2);\r\n    }\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_ARM\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  /* This must match with the saveregs macro in buildvm_arm.dasc. */\r\n  *p++ = ARMI_SUB|ARMF_D(RID_R12)|ARMF_N(RID_R12)|ARMF_M(RID_PC);\r\n  *p++ = ARMI_PUSH|ARMF_N(RID_SP)|RSET_RANGE(RID_R4,RID_R11+1)|RID2RSET(RID_LR);\r\n  *p++ = ARMI_SUB|ARMI_K12|ARMF_D(RID_R12)|ARMF_N(RID_R12)|CALLBACK_MCODE_HEAD;\r\n  *p++ = ARMI_STR|ARMI_LS_P|ARMI_LS_W|ARMF_D(RID_R12)|ARMF_N(RID_SP)|(CFRAME_SIZE-4*9);\r\n  *p++ = ARMI_LDR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_R12)|ARMF_N(RID_PC);\r\n  *p++ = ARMI_LDR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_PC)|ARMF_N(RID_PC);\r\n  *p++ = u32ptr(g);\r\n  *p++ = u32ptr(target);\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p++ = ARMI_MOV|ARMF_D(RID_R12)|ARMF_M(RID_PC);\r\n    *p = ARMI_B | ((page-p-2) & 0x00ffffffu);\r\n    p++;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_PPC\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  *p++ = PPCI_LIS | PPCF_T(RID_TMP) | (u32ptr(target) >> 16);\r\n  *p++ = PPCI_LIS | PPCF_T(RID_R12) | (u32ptr(g) >> 16);\r\n  *p++ = PPCI_ORI | PPCF_A(RID_TMP)|PPCF_T(RID_TMP) | (u32ptr(target) & 0xffff);\r\n  *p++ = PPCI_ORI | PPCF_A(RID_R12)|PPCF_T(RID_R12) | (u32ptr(g) & 0xffff);\r\n  *p++ = PPCI_MTCTR | PPCF_T(RID_TMP);\r\n  *p++ = PPCI_BCTR;\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p++ = PPCI_LI | PPCF_T(RID_R11) | slot;\r\n    *p = PPCI_B | (((page-p) & 0x00ffffffu) << 2);\r\n    p++;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_MIPS\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  *p++ = MIPSI_SW | MIPSF_T(RID_R1)|MIPSF_S(RID_SP) | 0;\r\n  *p++ = MIPSI_LUI | MIPSF_T(RID_R3) | (u32ptr(target) >> 16);\r\n  *p++ = MIPSI_LUI | MIPSF_T(RID_R2) | (u32ptr(g) >> 16);\r\n  *p++ = MIPSI_ORI | MIPSF_T(RID_R3)|MIPSF_S(RID_R3) |(u32ptr(target)&0xffff);\r\n  *p++ = MIPSI_JR | MIPSF_S(RID_R3);\r\n  *p++ = MIPSI_ORI | MIPSF_T(RID_R2)|MIPSF_S(RID_R2) | (u32ptr(g)&0xffff);\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p = MIPSI_B | ((page-p-1) & 0x0000ffffu);\r\n    p++;\r\n    *p++ = MIPSI_LI | MIPSF_T(RID_R1) | slot;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#else\r\n/* Missing support for this architecture. */\r\n#define callback_mcode_init(g, p)\tUNUSED(p)\r\n#endif\r\n\r\n/* -- Machine code management --------------------------------------------- */\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#elif LJ_TARGET_POSIX\r\n\r\n#include <sys/mman.h>\r\n#ifndef MAP_ANONYMOUS\r\n#define MAP_ANONYMOUS   MAP_ANON\r\n#endif\r\n\r\n#endif\r\n\r\n/* Allocate and initialize area for callback function pointers. */\r\nstatic void callback_mcode_new(CTState *cts)\r\n{\r\n  size_t sz = (size_t)CALLBACK_MCODE_SIZE;\r\n  void *p;\r\n  if (CALLBACK_MAX_SLOT == 0)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#if LJ_TARGET_WINDOWS\r\n  p = VirtualAlloc(NULL, sz, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  if (!p)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#elif LJ_TARGET_POSIX\r\n  p = mmap(NULL, sz, (PROT_READ|PROT_WRITE), MAP_PRIVATE|MAP_ANONYMOUS,\r\n\t   -1, 0);\r\n  if (p == MAP_FAILED)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#else\r\n  /* Fallback allocator. Fails if memory is not executable by default. */\r\n  p = lj_mem_new(cts->L, sz);\r\n#endif\r\n  cts->cb.mcode = p;\r\n  callback_mcode_init(cts->g, p);\r\n  lj_mcode_sync(p, (char *)p + sz);\r\n#if LJ_TARGET_WINDOWS\r\n  {\r\n    DWORD oprot;\r\n    VirtualProtect(p, sz, PAGE_EXECUTE_READ, &oprot);\r\n  }\r\n#elif LJ_TARGET_POSIX\r\n  mprotect(p, sz, (PROT_READ|PROT_EXEC));\r\n#endif\r\n}\r\n\r\n/* Free area for callback function pointers. */\r\nvoid lj_ccallback_mcode_free(CTState *cts)\r\n{\r\n  size_t sz = (size_t)CALLBACK_MCODE_SIZE;\r\n  void *p = cts->cb.mcode;\r\n  if (p == NULL) return;\r\n#if LJ_TARGET_WINDOWS\r\n  VirtualFree(p, 0, MEM_RELEASE);\r\n  UNUSED(sz);\r\n#elif LJ_TARGET_POSIX\r\n  munmap(p, sz);\r\n#else\r\n  lj_mem_free(cts->g, p, sz);\r\n#endif\r\n}\r\n\r\n/* -- C callback entry ---------------------------------------------------- */\r\n\r\n/* Target-specific handling of register arguments. Similar to lj_ccall.c. */\r\n#if LJ_TARGET_X86\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (!isfp) {  /* Only non-FP values may be passed in registers. */ \\\r\n    if (n > 1) {  /* Anything > 32 bit is passed on the stack. */ \\\r\n      if (!LJ_ABI_WIN) ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } else if (ngpr + 1 <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64 && LJ_ABI_WIN\r\n\r\n/* Windows/x64 argument registers are strictly positional (use ngpr). */\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (ngpr < maxgpr) { sp = &cts->cb.fpr[ngpr++]; UNUSED(nfpr); goto done; } \\\r\n  } else { \\\r\n    if (ngpr < maxgpr) { sp = &cts->cb.gpr[ngpr++]; goto done; } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (nfpr + n <= CCALL_NARG_FPR) { \\\r\n      sp = &cts->cb.fpr[nfpr]; \\\r\n      nfpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  } else { \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#if LJ_ABI_SOFTFP\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP1\tUNUSED(isfp);\r\n#define CALLBACK_HANDLE_REGARG_FP2\r\n\r\n#else\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP1 \\\r\n  if (isfp) { \\\r\n    if (n == 1) { \\\r\n      if (fprodd) { \\\r\n\tsp = &cts->cb.fpr[fprodd-1]; \\\r\n\tfprodd = 0; \\\r\n\tgoto done; \\\r\n      } else if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n\tsp = &cts->cb.fpr[nfpr++]; \\\r\n\tfprodd = nfpr; \\\r\n\tgoto done; \\\r\n      } \\\r\n    } else { \\\r\n      if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n\tsp = &cts->cb.fpr[nfpr++]; \\\r\n\tgoto done; \\\r\n      } \\\r\n    } \\\r\n    fprodd = 0;  /* No reordering after the first FP value is on stack. */ \\\r\n  } else {\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP2\t}\r\n\r\n#endif\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  CALLBACK_HANDLE_REGARG_FP1 \\\r\n  if (n > 1) ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n  if (ngpr + n <= maxgpr) { \\\r\n    sp = &cts->cb.gpr[ngpr]; \\\r\n    ngpr += n; \\\r\n    goto done; \\\r\n  } CALLBACK_HANDLE_REGARG_FP2\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n      sp = &cts->cb.fpr[nfpr++]; \\\r\n      cta = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */ \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    if (n > 1) { \\\r\n      lua_assert(ctype_isinteger(cta->info) && n == 2);  /* int64_t. */ \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align int64_t to regpair. */ \\\r\n    } \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CALLBACK_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    *(double *)dp = *(float *)dp;  /* FPRs always hold doubles. */\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp && nfpr < CCALL_NARG_FPR) {  /* Try to pass argument in FPRs. */ \\\r\n    sp = (void *)((uint8_t *)&cts->cb.fpr[nfpr] + ((LJ_BE && n==1) ? 4 : 0)); \\\r\n    nfpr++; ngpr += n; \\\r\n    goto done; \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    nfpr = CCALL_NARG_FPR; \\\r\n    if (n > 1) ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CALLBACK_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    ((float *)dp)[1] = *(float *)dp;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n/* Convert and push callback arguments to Lua stack. */\r\nstatic void callback_conv_args(CTState *cts, lua_State *L)\r\n{\r\n  TValue *o = L->top;\r\n  intptr_t *stack = cts->cb.stack;\r\n  MSize slot = cts->cb.slot;\r\n  CTypeID id = 0, rid, fid;\r\n  int gcsteps = 0;\r\n  CType *ct;\r\n  GCfunc *fn;\r\n  MSize ngpr = 0, nsp = 0, maxgpr = CCALL_NARG_GPR;\r\n#if CCALL_NARG_FPR\r\n  MSize nfpr = 0;\r\n#if LJ_TARGET_ARM\r\n  MSize fprodd = 0;\r\n#endif\r\n#endif\r\n\r\n  if (slot < cts->cb.sizeid && (id = cts->cb.cbid[slot]) != 0) {\r\n    ct = ctype_get(cts, id);\r\n    rid = ctype_cid(ct->info);\r\n    fn = funcV(lj_tab_getint(cts->miscmap, (int32_t)slot));\r\n  } else {  /* Must set up frame first, before throwing the error. */\r\n    ct = NULL;\r\n    rid = 0;\r\n    fn = (GCfunc *)L;\r\n  }\r\n  o->u32.lo = LJ_CONT_FFI_CALLBACK;  /* Continuation returns from callback. */\r\n  o->u32.hi = rid;  /* Return type. x86: +(spadj<<16). */\r\n  o++;\r\n  setframe_gc(o, obj2gco(fn));\r\n  setframe_ftsz(o, (int)((char *)(o+1) - (char *)L->base) + FRAME_CONT);\r\n  L->top = L->base = ++o;\r\n  if (!ct)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_BADCBACK);\r\n  if (isluafunc(fn))\r\n    setcframe_pc(L->cframe, proto_bc(funcproto(fn))+1);\r\n  lj_state_checkstack(L, LUA_MINSTACK);  /* May throw. */\r\n  o = L->base;  /* Might have been reallocated. */\r\n\r\n#if LJ_TARGET_X86\r\n  /* x86 has several different calling conventions. */\r\n  switch (ctype_cconv(ct->info)) {\r\n  case CTCC_FASTCALL: maxgpr = 2; break;\r\n  case CTCC_THISCALL: maxgpr = 1; break;\r\n  default: maxgpr = 0; break;\r\n  }\r\n#endif\r\n\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) {\r\n      CType *cta;\r\n      void *sp;\r\n      CTSize sz;\r\n      int isfp;\r\n      MSize n;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      cta = ctype_rawchild(cts, ctf);\r\n      isfp = ctype_isfp(cta->info);\r\n      sz = (cta->size + CTSIZE_PTR-1) & ~(CTSIZE_PTR-1);\r\n      n = sz / CTSIZE_PTR;  /* Number of GPRs or stack slots needed. */\r\n\r\n      CALLBACK_HANDLE_REGARG  /* Handle register arguments. */\r\n\r\n      /* Otherwise pass argument on stack. */\r\n      if (CCALL_ALIGN_STACKARG && LJ_32 && sz == 8)\r\n\tnsp = (nsp + 1) & ~1u;  /* Align 64 bit argument on stack. */\r\n      sp = &stack[nsp];\r\n      nsp += n;\r\n\r\n    done:\r\n      if (LJ_BE && cta->size < CTSIZE_PTR)\r\n\tsp = (void *)((uint8_t *)sp + CTSIZE_PTR-cta->size);\r\n      gcsteps += lj_cconv_tv_ct(cts, cta, 0, o++, sp);\r\n    }\r\n    fid = ctf->sib;\r\n  }\r\n  L->top = o;\r\n#if LJ_TARGET_X86\r\n  /* Store stack adjustment for returns from non-cdecl callbacks. */\r\n  if (ctype_cconv(ct->info) != CTCC_CDECL)\r\n    (L->base-2)->u32.hi |= (nsp << (16+2));\r\n#endif\r\n  while (gcsteps-- > 0)\r\n    lj_gc_check(L);\r\n}\r\n\r\n/* Convert Lua object to callback result. */\r\nstatic void callback_conv_result(CTState *cts, lua_State *L, TValue *o)\r\n{\r\n  CType *ctr = ctype_raw(cts, (uint16_t)(L->base-2)->u32.hi);\r\n#if LJ_TARGET_X86\r\n  cts->cb.gpr[2] = 0;\r\n#endif\r\n  if (!ctype_isvoid(ctr->info)) {\r\n    uint8_t *dp = (uint8_t *)&cts->cb.gpr[0];\r\n#if CCALL_NUM_FPR\r\n    if (ctype_isfp(ctr->info))\r\n      dp = (uint8_t *)&cts->cb.fpr[0];\r\n#endif\r\n    lj_cconv_ct_tv(cts, ctr, dp, o, 0);\r\n#ifdef CALLBACK_HANDLE_RET\r\n    CALLBACK_HANDLE_RET\r\n#endif\r\n    /* Extend returned integers to (at least) 32 bits. */\r\n    if (ctype_isinteger_or_bool(ctr->info) && ctr->size < 4) {\r\n      if (ctr->info & CTF_UNSIGNED)\r\n\t*(uint32_t *)dp = ctr->size == 1 ? (uint32_t)*(uint8_t *)dp :\r\n\t\t\t\t\t   (uint32_t)*(uint16_t *)dp;\r\n      else\r\n\t*(int32_t *)dp = ctr->size == 1 ? (int32_t)*(int8_t *)dp :\r\n\t\t\t\t\t  (int32_t)*(int16_t *)dp;\r\n    }\r\n#if LJ_TARGET_X86\r\n    if (ctype_isfp(ctr->info))\r\n      cts->cb.gpr[2] = ctr->size == sizeof(float) ? 1 : 2;\r\n#endif\r\n  }\r\n}\r\n\r\n/* Enter callback. */\r\nlua_State * LJ_FASTCALL lj_ccallback_enter(CTState *cts, void *cf)\r\n{\r\n  lua_State *L = cts->L;\r\n  global_State *g = cts->g;\r\n  lua_assert(L != NULL);\r\n  if (gcref(g->jit_L)) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_FFI_BADCBACK));\r\n    if (g->panic) g->panic(L);\r\n    exit(EXIT_FAILURE);\r\n  }\r\n  lj_trace_abort(g);  /* Never record across callback. */\r\n  /* Setup C frame. */\r\n  cframe_prev(cf) = L->cframe;\r\n  setcframe_L(cf, L);\r\n  cframe_errfunc(cf) = -1;\r\n  cframe_nres(cf) = 0;\r\n  L->cframe = cf;\r\n  callback_conv_args(cts, L);\r\n  return L;  /* Now call the function on this stack. */\r\n}\r\n\r\n/* Leave callback. */\r\nvoid LJ_FASTCALL lj_ccallback_leave(CTState *cts, TValue *o)\r\n{\r\n  lua_State *L = cts->L;\r\n  GCfunc *fn;\r\n  TValue *obase = L->base;\r\n  L->base = L->top;  /* Keep continuation frame for throwing errors. */\r\n  if (o >= L->base) {\r\n    /* PC of RET* is lost. Point to last line for result conv. errors. */\r\n    fn = curr_func(L);\r\n    if (isluafunc(fn)) {\r\n      GCproto *pt = funcproto(fn);\r\n      setcframe_pc(L->cframe, proto_bc(pt)+pt->sizebc+1);\r\n    }\r\n  }\r\n  callback_conv_result(cts, L, o);\r\n  /* Finally drop C frame and continuation frame. */\r\n  L->cframe = cframe_prev(L->cframe);\r\n  L->top -= 2;\r\n  L->base = obase;\r\n  cts->cb.slot = 0;  /* Blacklist C function that called the callback. */\r\n}\r\n\r\n/* -- C callback management ----------------------------------------------- */\r\n\r\n/* Get an unused slot in the callback slot table. */\r\nstatic MSize callback_slot_new(CTState *cts, CType *ct)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  CTypeID1 *cbid = cts->cb.cbid;\r\n  MSize top;\r\n  for (top = cts->cb.topid; top < cts->cb.sizeid; top++)\r\n    if (LJ_LIKELY(cbid[top] == 0))\r\n      goto found;\r\n#if CALLBACK_MAX_SLOT\r\n  if (top >= CALLBACK_MAX_SLOT)\r\n#endif\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n  if (!cts->cb.mcode)\r\n    callback_mcode_new(cts);\r\n  lj_mem_growvec(cts->L, cbid, cts->cb.sizeid, CALLBACK_MAX_SLOT, CTypeID1);\r\n  cts->cb.cbid = cbid;\r\n  memset(cbid+top, 0, (cts->cb.sizeid-top)*sizeof(CTypeID1));\r\nfound:\r\n  cbid[top] = id;\r\n  cts->cb.topid = top+1;\r\n  return top;\r\n}\r\n\r\n/* Check for function pointer and supported argument/result types. */\r\nstatic CType *callback_checkfunc(CTState *cts, CType *ct)\r\n{\r\n  int narg = 0;\r\n  if (!ctype_isptr(ct->info) || (LJ_64 && ct->size != CTSIZE_PTR))\r\n    return NULL;\r\n  ct = ctype_rawchild(cts, ct);\r\n  if (ctype_isfunc(ct->info)) {\r\n    CType *ctr = ctype_rawchild(cts, ct);\r\n    CTypeID fid = ct->sib;\r\n    if (!(ctype_isvoid(ctr->info) || ctype_isenum(ctr->info) ||\r\n\t  ctype_isptr(ctr->info) || (ctype_isnum(ctr->info) && ctr->size <= 8)))\r\n      return NULL;\r\n    if ((ct->info & CTF_VARARG))\r\n      return NULL;\r\n    while (fid) {\r\n      CType *ctf = ctype_get(cts, fid);\r\n      if (!ctype_isattrib(ctf->info)) {\r\n\tCType *cta;\r\n\tlua_assert(ctype_isfield(ctf->info));\r\n\tcta = ctype_rawchild(cts, ctf);\r\n\tif (!(ctype_isenum(cta->info) || ctype_isptr(cta->info) ||\r\n\t      (ctype_isnum(cta->info) && cta->size <= 8)) ||\r\n\t    ++narg >= LUA_MINSTACK-3)\r\n\t  return NULL;\r\n      }\r\n      fid = ctf->sib;\r\n    }\r\n    return ct;\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Create a new callback and return the callback function pointer. */\r\nvoid *lj_ccallback_new(CTState *cts, CType *ct, GCfunc *fn)\r\n{\r\n  ct = callback_checkfunc(cts, ct);\r\n  if (ct) {\r\n    MSize slot = callback_slot_new(cts, ct);\r\n    GCtab *t = cts->miscmap;\r\n    setfuncV(cts->L, lj_tab_setint(cts->L, t, (int32_t)slot), fn);\r\n    lj_gc_anybarriert(cts->L, t);\r\n    return callback_slot2ptr(cts, slot);\r\n  }\r\n  return NULL;  /* Bad conversion. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ccallback.h",
    "content": "/*\r\n** FFI C callback handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCALLBACK_H\r\n#define _LJ_CCALLBACK_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Really belongs to lj_vm.h. */\r\nLJ_ASMF void lj_vm_ffi_callback(void);\r\n\r\nLJ_FUNC MSize lj_ccallback_ptr2slot(CTState *cts, void *p);\r\nLJ_FUNCA lua_State * LJ_FASTCALL lj_ccallback_enter(CTState *cts, void *cf);\r\nLJ_FUNCA void LJ_FASTCALL lj_ccallback_leave(CTState *cts, TValue *o);\r\nLJ_FUNC void *lj_ccallback_new(CTState *cts, CType *ct, GCfunc *fn);\r\nLJ_FUNC void lj_ccallback_mcode_free(CTState *cts);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cconv.c",
    "content": "/*\r\n** C type conversions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_ccallback.h\"\r\n\r\n/* -- Conversion errors --------------------------------------------------- */\r\n\r\n/* Bad conversion. */\r\nLJ_NORET static void cconv_err_conv(CTState *cts, CType *d, CType *s,\r\n\t\t\t\t    CTInfo flags)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  const char *src;\r\n  if ((flags & CCF_FROMTV))\r\n    src = lj_obj_typename[1+(ctype_isnum(s->info) ? LUA_TNUMBER :\r\n\t\t\t     ctype_isarray(s->info) ? LUA_TSTRING : LUA_TNIL)];\r\n  else\r\n    src = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, s), NULL));\r\n  if (CCF_GETARG(flags))\r\n    lj_err_argv(cts->L, CCF_GETARG(flags), LJ_ERR_FFI_BADCONV, src, dst);\r\n  else\r\n    lj_err_callerv(cts->L, LJ_ERR_FFI_BADCONV, src, dst);\r\n}\r\n\r\n/* Bad conversion from TValue. */\r\nLJ_NORET static void cconv_err_convtv(CTState *cts, CType *d, TValue *o,\r\n\t\t\t\t      CTInfo flags)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  const char *src = lj_typename(o);\r\n  if (CCF_GETARG(flags))\r\n    lj_err_argv(cts->L, CCF_GETARG(flags), LJ_ERR_FFI_BADCONV, src, dst);\r\n  else\r\n    lj_err_callerv(cts->L, LJ_ERR_FFI_BADCONV, src, dst);\r\n}\r\n\r\n/* Initializer overflow. */\r\nLJ_NORET static void cconv_err_initov(CTState *cts, CType *d)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  lj_err_callerv(cts->L, LJ_ERR_FFI_INITOV, dst);\r\n}\r\n\r\n/* -- C type compatibility checks ----------------------------------------- */\r\n\r\n/* Get raw type and qualifiers for a child type. Resolves enums, too. */\r\nstatic CType *cconv_childqual(CTState *cts, CType *ct, CTInfo *qual)\r\n{\r\n  ct = ctype_child(cts, ct);\r\n  for (;;) {\r\n    if (ctype_isattrib(ct->info)) {\r\n      if (ctype_attrib(ct->info) == CTA_QUAL) *qual |= ct->size;\r\n    } else if (!ctype_isenum(ct->info)) {\r\n      break;\r\n    }\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n  *qual |= (ct->info & CTF_QUAL);\r\n  return ct;\r\n}\r\n\r\n/* Check for compatible types when converting to a pointer.\r\n** Note: these checks are more relaxed than what C99 mandates.\r\n*/\r\nint lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags)\r\n{\r\n  if (!((flags & CCF_CAST) || d == s)) {\r\n    CTInfo dqual = 0, squal = 0;\r\n    d = cconv_childqual(cts, d, &dqual);\r\n    if (!ctype_isstruct(s->info))\r\n      s = cconv_childqual(cts, s, &squal);\r\n    if ((flags & CCF_SAME)) {\r\n      if (dqual != squal)\r\n\treturn 0;  /* Different qualifiers. */\r\n    } else if (!(flags & CCF_IGNQUAL)) {\r\n      if ((dqual & squal) != squal)\r\n\treturn 0;  /* Discarded qualifiers. */\r\n      if (ctype_isvoid(d->info) || ctype_isvoid(s->info))\r\n\treturn 1;  /* Converting to/from void * is always ok. */\r\n    }\r\n    if (ctype_type(d->info) != ctype_type(s->info) ||\r\n\td->size != s->size)\r\n      return 0;  /* Different type or different size. */\r\n    if (ctype_isnum(d->info)) {\r\n      if (((d->info ^ s->info) & (CTF_BOOL|CTF_FP)))\r\n\treturn 0;  /* Different numeric types. */\r\n    } else if (ctype_ispointer(d->info)) {\r\n      /* Check child types for compatibility. */\r\n      return lj_cconv_compatptr(cts, d, s, flags|CCF_SAME);\r\n    } else if (ctype_isstruct(d->info)) {\r\n      if (d != s)\r\n\treturn 0;  /* Must be exact same type for struct/union. */\r\n    } else if (ctype_isfunc(d->info)) {\r\n      /* NYI: structural equality of functions. */\r\n    }\r\n  }\r\n  return 1;  /* Types are compatible. */\r\n}\r\n\r\n/* -- C type to C type conversion ----------------------------------------- */\r\n\r\n/* Convert C type to C type. Caveat: expects to get the raw CType!\r\n**\r\n** Note: This is only used by the interpreter and not optimized at all.\r\n** The JIT compiler will do a much better job specializing for each case.\r\n*/\r\nvoid lj_cconv_ct_ct(CTState *cts, CType *d, CType *s,\r\n\t\t    uint8_t *dp, uint8_t *sp, CTInfo flags)\r\n{\r\n  CTSize dsize = d->size, ssize = s->size;\r\n  CTInfo dinfo = d->info, sinfo = s->info;\r\n  void *tmpptr;\r\n\r\n  lua_assert(!ctype_isenum(dinfo) && !ctype_isenum(sinfo));\r\n  lua_assert(!ctype_isattrib(dinfo) && !ctype_isattrib(sinfo));\r\n\r\n  if (ctype_type(dinfo) > CT_MAYCONVERT || ctype_type(sinfo) > CT_MAYCONVERT)\r\n    goto err_conv;\r\n\r\n  /* Some basic sanity checks. */\r\n  lua_assert(!ctype_isnum(dinfo) || dsize > 0);\r\n  lua_assert(!ctype_isnum(sinfo) || ssize > 0);\r\n  lua_assert(!ctype_isbool(dinfo) || dsize == 1 || dsize == 4);\r\n  lua_assert(!ctype_isbool(sinfo) || ssize == 1 || ssize == 4);\r\n  lua_assert(!ctype_isinteger(dinfo) || (1u<<lj_fls(dsize)) == dsize);\r\n  lua_assert(!ctype_isinteger(sinfo) || (1u<<lj_fls(ssize)) == ssize);\r\n\r\n  switch (cconv_idx2(dinfo, sinfo)) {\r\n  /* Destination is a bool. */\r\n  case CCX(B, B):\r\n    /* Source operand is already normalized. */\r\n    if (dsize == 1) *dp = *sp; else *(int *)dp = *sp;\r\n    break;\r\n  case CCX(B, I): {\r\n    MSize i;\r\n    uint8_t b = 0;\r\n    for (i = 0; i < ssize; i++) b |= sp[i];\r\n    b = (b != 0);\r\n    if (dsize == 1) *dp = b; else *(int *)dp = b;\r\n    break;\r\n    }\r\n  case CCX(B, F): {\r\n    uint8_t b;\r\n    if (ssize == sizeof(double)) b = (*(double *)sp != 0);\r\n    else if (ssize == sizeof(float)) b = (*(float *)sp != 0);\r\n    else goto err_conv;  /* NYI: long double. */\r\n    if (dsize == 1) *dp = b; else *(int *)dp = b;\r\n    break;\r\n    }\r\n\r\n  /* Destination is an integer. */\r\n  case CCX(I, B):\r\n  case CCX(I, I):\r\n  conv_I_I:\r\n    if (dsize > ssize) {  /* Zero-extend or sign-extend LSB. */\r\n#if LJ_LE\r\n      uint8_t fill = (!(sinfo & CTF_UNSIGNED) && (sp[ssize-1]&0x80)) ? 0xff : 0;\r\n      memcpy(dp, sp, ssize);\r\n      memset(dp + ssize, fill, dsize-ssize);\r\n#else\r\n      uint8_t fill = (!(sinfo & CTF_UNSIGNED) && (sp[0]&0x80)) ? 0xff : 0;\r\n      memset(dp, fill, dsize-ssize);\r\n      memcpy(dp + (dsize-ssize), sp, ssize);\r\n#endif\r\n    } else {  /* Copy LSB. */\r\n#if LJ_LE\r\n      memcpy(dp, sp, dsize);\r\n#else\r\n      memcpy(dp, sp + (ssize-dsize), dsize);\r\n#endif\r\n    }\r\n    break;\r\n  case CCX(I, F): {\r\n    double n;  /* Always convert via double. */\r\n  conv_I_F:\r\n    /* Convert source to double. */\r\n    if (ssize == sizeof(double)) n = *(double *)sp;\r\n    else if (ssize == sizeof(float)) n = (double)*(float *)sp;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    /* Then convert double to integer. */\r\n    /* The conversion must exactly match the semantics of JIT-compiled code! */\r\n    if (dsize < 4 || (dsize == 4 && !(dinfo & CTF_UNSIGNED))) {\r\n      int32_t i = (int32_t)n;\r\n      if (dsize == 4) *(int32_t *)dp = i;\r\n      else if (dsize == 2) *(int16_t *)dp = (int16_t)i;\r\n      else *(int8_t *)dp = (int8_t)i;\r\n    } else if (dsize == 4) {\r\n      *(uint32_t *)dp = (uint32_t)n;\r\n    } else if (dsize == 8) {\r\n      if (!(dinfo & CTF_UNSIGNED))\r\n\t*(int64_t *)dp = (int64_t)n;\r\n      else\r\n\t*(uint64_t *)dp = lj_num2u64(n);\r\n    } else {\r\n      goto err_conv;  /* NYI: conversion to >64 bit integers. */\r\n    }\r\n    break;\r\n    }\r\n  case CCX(I, C):\r\n    s = ctype_child(cts, s);\r\n    sinfo = s->info;\r\n    ssize = s->size;\r\n    goto conv_I_F;  /* Just convert re. */\r\n  case CCX(I, P):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    goto conv_I_I;\r\n  case CCX(I, A):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    ssize = CTSIZE_PTR;\r\n    tmpptr = sp;\r\n    sp = (uint8_t *)&tmpptr;\r\n    goto conv_I_I;\r\n\r\n  /* Destination is a floating-point number. */\r\n  case CCX(F, B):\r\n  case CCX(F, I): {\r\n    double n;  /* Always convert via double. */\r\n  conv_F_I:\r\n    /* First convert source to double. */\r\n    /* The conversion must exactly match the semantics of JIT-compiled code! */\r\n    if (ssize < 4 || (ssize == 4 && !(sinfo & CTF_UNSIGNED))) {\r\n      int32_t i;\r\n      if (ssize == 4) {\r\n\ti = *(int32_t *)sp;\r\n      } else if (!(sinfo & CTF_UNSIGNED)) {\r\n\tif (ssize == 2) i = *(int16_t *)sp;\r\n\telse i = *(int8_t *)sp;\r\n      } else {\r\n\tif (ssize == 2) i = *(uint16_t *)sp;\r\n\telse i = *(uint8_t *)sp;\r\n      }\r\n      n = (double)i;\r\n    } else if (ssize == 4) {\r\n      n = (double)*(uint32_t *)sp;\r\n    } else if (ssize == 8) {\r\n      if (!(sinfo & CTF_UNSIGNED)) n = (double)*(int64_t *)sp;\r\n      else n = (double)*(uint64_t *)sp;\r\n    } else {\r\n      goto err_conv;  /* NYI: conversion from >64 bit integers. */\r\n    }\r\n    /* Convert double to destination. */\r\n    if (dsize == sizeof(double)) *(double *)dp = n;\r\n    else if (dsize == sizeof(float)) *(float *)dp = (float)n;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    break;\r\n    }\r\n  case CCX(F, F): {\r\n    double n;  /* Always convert via double. */\r\n  conv_F_F:\r\n    if (ssize == dsize) goto copyval;\r\n    /* Convert source to double. */\r\n    if (ssize == sizeof(double)) n = *(double *)sp;\r\n    else if (ssize == sizeof(float)) n = (double)*(float *)sp;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    /* Convert double to destination. */\r\n    if (dsize == sizeof(double)) *(double *)dp = n;\r\n    else if (dsize == sizeof(float)) *(float *)dp = (float)n;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    break;\r\n    }\r\n  case CCX(F, C):\r\n    s = ctype_child(cts, s);\r\n    sinfo = s->info;\r\n    ssize = s->size;\r\n    goto conv_F_F;  /* Ignore im, and convert from re. */\r\n\r\n  /* Destination is a complex number. */\r\n  case CCX(C, I):\r\n    d = ctype_child(cts, d);\r\n    dinfo = d->info;\r\n    dsize = d->size;\r\n    memset(dp + dsize, 0, dsize);  /* Clear im. */\r\n    goto conv_F_I;  /* Convert to re. */\r\n  case CCX(C, F):\r\n    d = ctype_child(cts, d);\r\n    dinfo = d->info;\r\n    dsize = d->size;\r\n    memset(dp + dsize, 0, dsize);  /* Clear im. */\r\n    goto conv_F_F;  /* Convert to re. */\r\n\r\n  case CCX(C, C):\r\n    if (dsize != ssize) {  /* Different types: convert re/im separately. */\r\n      CType *dc = ctype_child(cts, d);\r\n      CType *sc = ctype_child(cts, s);\r\n      lj_cconv_ct_ct(cts, dc, sc, dp, sp, flags);\r\n      lj_cconv_ct_ct(cts, dc, sc, dp + dc->size, sp + sc->size, flags);\r\n      return;\r\n    }\r\n    goto copyval;  /* Otherwise this is easy. */\r\n\r\n  /* Destination is a vector. */\r\n  case CCX(V, I):\r\n  case CCX(V, F):\r\n  case CCX(V, C): {\r\n    CType *dc = ctype_child(cts, d);\r\n    CTSize esize;\r\n    /* First convert the scalar to the first element. */\r\n    lj_cconv_ct_ct(cts, dc, s, dp, sp, flags);\r\n    /* Then replicate it to the other elements (splat). */\r\n    for (sp = dp, esize = dc->size; dsize > esize; dsize -= esize) {\r\n      dp += esize;\r\n      memcpy(dp, sp, esize);\r\n    }\r\n    break;\r\n    }\r\n\r\n  case CCX(V, V):\r\n    /* Copy same-sized vectors, even for different lengths/element-types. */\r\n    if (dsize != ssize) goto err_conv;\r\n    goto copyval;\r\n\r\n  /* Destination is a pointer. */\r\n  case CCX(P, I):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    dinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    goto conv_I_I;\r\n\r\n  case CCX(P, F):\r\n    if (!(flags & CCF_CAST) || !(flags & CCF_FROMTV)) goto err_conv;\r\n    /* The signed conversion is cheaper. x64 really has 47 bit pointers. */\r\n    dinfo = CTINFO(CT_NUM, (LJ_64 && dsize == 8) ? 0 : CTF_UNSIGNED);\r\n    goto conv_I_F;\r\n\r\n  case CCX(P, P):\r\n    if (!lj_cconv_compatptr(cts, d, s, flags)) goto err_conv;\r\n    cdata_setptr(dp, dsize, cdata_getptr(sp, ssize));\r\n    break;\r\n\r\n  case CCX(P, A):\r\n  case CCX(P, S):\r\n    if (!lj_cconv_compatptr(cts, d, s, flags)) goto err_conv;\r\n    cdata_setptr(dp, dsize, sp);\r\n    break;\r\n\r\n  /* Destination is an array. */\r\n  case CCX(A, A):\r\n    if ((flags & CCF_CAST) || (d->info & CTF_VLA) || dsize != ssize ||\r\n\td->size == CTSIZE_INVALID || !lj_cconv_compatptr(cts, d, s, flags))\r\n      goto err_conv;\r\n    goto copyval;\r\n\r\n  /* Destination is a struct/union. */\r\n  case CCX(S, S):\r\n    if ((flags & CCF_CAST) || (d->info & CTF_VLA) || d != s)\r\n      goto err_conv;  /* Must be exact same type. */\r\ncopyval:  /* Copy value. */\r\n    lua_assert(dsize == ssize);\r\n    memcpy(dp, sp, dsize);\r\n    break;\r\n\r\n  default:\r\n  err_conv:\r\n    cconv_err_conv(cts, d, s, flags);\r\n  }\r\n}\r\n\r\n/* -- C type to TValue conversion ----------------------------------------- */\r\n\r\n/* Convert C type to TValue. Caveat: expects to get the raw CType! */\r\nint lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid,\r\n\t\t   TValue *o, uint8_t *sp)\r\n{\r\n  CTInfo sinfo = s->info;\r\n  if (ctype_isnum(sinfo)) {\r\n    if (!ctype_isbool(sinfo)) {\r\n      if (ctype_isinteger(sinfo) && s->size > 4) goto copyval;\r\n      if (LJ_DUALNUM && ctype_isinteger(sinfo)) {\r\n\tint32_t i;\r\n\tlj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT32), s,\r\n\t\t       (uint8_t *)&i, sp, 0);\r\n\tif ((sinfo & CTF_UNSIGNED) && i < 0)\r\n\t  setnumV(o, (lua_Number)(uint32_t)i);\r\n\telse\r\n\t  setintV(o, i);\r\n      } else {\r\n\tlj_cconv_ct_ct(cts, ctype_get(cts, CTID_DOUBLE), s,\r\n\t\t       (uint8_t *)&o->n, sp, 0);\r\n\t/* Numbers are NOT canonicalized here! Beware of uninitialized data. */\r\n\tlua_assert(tvisnum(o));\r\n      }\r\n    } else {\r\n      uint32_t b = s->size == 1 ? (*sp != 0) : (*(int *)sp != 0);\r\n      setboolV(o, b);\r\n      setboolV(&cts->g->tmptv2, b);  /* Remember for trace recorder. */\r\n    }\r\n    return 0;\r\n  } else if (ctype_isrefarray(sinfo) || ctype_isstruct(sinfo)) {\r\n    /* Create reference. */\r\n    setcdataV(cts->L, o, lj_cdata_newref(cts, sp, sid));\r\n    return 1;  /* Need GC step. */\r\n  } else {\r\n    GCcdata *cd;\r\n    CTSize sz;\r\n  copyval:  /* Copy value. */\r\n    sz = s->size;\r\n    lua_assert(sz != CTSIZE_INVALID);\r\n    /* Attributes are stripped, qualifiers are kept (but mostly ignored). */\r\n    cd = lj_cdata_new(cts, ctype_typeid(cts, s), sz);\r\n    setcdataV(cts->L, o, cd);\r\n    memcpy(cdataptr(cd), sp, sz);\r\n    return 1;  /* Need GC step. */\r\n  }\r\n}\r\n\r\n/* Convert bitfield to TValue. */\r\nint lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp)\r\n{\r\n  CTInfo info = s->info;\r\n  CTSize pos, bsz;\r\n  uint32_t val;\r\n  lua_assert(ctype_isbitfield(info));\r\n  /* NYI: packed bitfields may cause misaligned reads. */\r\n  switch (ctype_bitcsz(info)) {\r\n  case 4: val = *(uint32_t *)sp; break;\r\n  case 2: val = *(uint16_t *)sp; break;\r\n  case 1: val = *(uint8_t *)sp; break;\r\n  default: lua_assert(0); val = 0; break;\r\n  }\r\n  /* Check if a packed bitfield crosses a container boundary. */\r\n  pos = ctype_bitpos(info);\r\n  bsz = ctype_bitbsz(info);\r\n  lua_assert(pos < 8*ctype_bitcsz(info));\r\n  lua_assert(bsz > 0 && bsz <= 8*ctype_bitcsz(info));\r\n  if (pos + bsz > 8*ctype_bitcsz(info))\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_NYIPACKBIT);\r\n  if (!(info & CTF_BOOL)) {\r\n    CTSize shift = 32 - bsz;\r\n    if (!(info & CTF_UNSIGNED)) {\r\n      setintV(o, (int32_t)(val << (shift-pos)) >> shift);\r\n    } else {\r\n      val = (val << (shift-pos)) >> shift;\r\n      if (!LJ_DUALNUM || (int32_t)val < 0)\r\n\tsetnumV(o, (lua_Number)(uint32_t)val);\r\n      else\r\n\tsetintV(o, (int32_t)val);\r\n    }\r\n  } else {\r\n    lua_assert(bsz == 1);\r\n    setboolV(o, (val >> pos) & 1);\r\n  }\r\n  return 0;  /* No GC step needed. */\r\n}\r\n\r\n/* -- TValue to C type conversion ----------------------------------------- */\r\n\r\n/* Convert table to array. */\r\nstatic void cconv_array_tab(CTState *cts, CType *d,\r\n\t\t\t    uint8_t *dp, GCtab *t, CTInfo flags)\r\n{\r\n  int32_t i;\r\n  CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n  CTSize size = d->size, esize = dc->size, ofs = 0;\r\n  for (i = 0; ; i++) {\r\n    TValue *tv = (TValue *)lj_tab_getint(t, i);\r\n    if (!tv || tvisnil(tv)) {\r\n      if (i == 0) continue;  /* Try again for 1-based tables. */\r\n      break;  /* Stop at first nil. */\r\n    }\r\n    if (ofs >= size)\r\n      cconv_err_initov(cts, d);\r\n    lj_cconv_ct_tv(cts, dc, dp + ofs, tv, flags);\r\n    ofs += esize;\r\n  }\r\n  if (size != CTSIZE_INVALID) {  /* Only fill up arrays with known size. */\r\n    if (ofs == esize) {  /* Replicate a single element. */\r\n      for (; ofs < size; ofs += esize) memcpy(dp + ofs, dp, esize);\r\n    } else {  /* Otherwise fill the remainder with zero. */\r\n      memset(dp + ofs, 0, size - ofs);\r\n    }\r\n  }\r\n}\r\n\r\n/* Convert table to sub-struct/union. */\r\nstatic void cconv_substruct_tab(CTState *cts, CType *d, uint8_t *dp,\r\n\t\t\t\tGCtab *t, int32_t *ip, CTInfo flags)\r\n{\r\n  CTypeID id = d->sib;\r\n  while (id) {\r\n    CType *df = ctype_get(cts, id);\r\n    id = df->sib;\r\n    if (ctype_isfield(df->info) || ctype_isbitfield(df->info)) {\r\n      TValue *tv;\r\n      int32_t i = *ip, iz = i;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      if (i >= 0) {\r\n      retry:\r\n\ttv = (TValue *)lj_tab_getint(t, i);\r\n\tif (!tv || tvisnil(tv)) {\r\n\t  if (i == 0) { i = 1; goto retry; }  /* 1-based tables. */\r\n\t  if (iz == 0) { *ip = i = -1; goto tryname; }  /* Init named fields. */\r\n\t  break;  /* Stop at first nil. */\r\n\t}\r\n\t*ip = i + 1;\r\n      } else {\r\n      tryname:\r\n\ttv = (TValue *)lj_tab_getstr(t, gco2str(gcref(df->name)));\r\n\tif (!tv || tvisnil(tv)) continue;\r\n      }\r\n      if (ctype_isfield(df->info))\r\n\tlj_cconv_ct_tv(cts, ctype_rawchild(cts, df), dp+df->size, tv, flags);\r\n      else\r\n\tlj_cconv_bf_tv(cts, df, dp+df->size, tv);\r\n      if ((d->info & CTF_UNION)) break;\r\n    } else if (ctype_isxattrib(df->info, CTA_SUBTYPE)) {\r\n      cconv_substruct_tab(cts, ctype_rawchild(cts, df),\r\n\t\t\t  dp+df->size, t, ip, flags);\r\n    }  /* Ignore all other entries in the chain. */\r\n  }\r\n}\r\n\r\n/* Convert table to struct/union. */\r\nstatic void cconv_struct_tab(CTState *cts, CType *d,\r\n\t\t\t     uint8_t *dp, GCtab *t, CTInfo flags)\r\n{\r\n  int32_t i = 0;\r\n  memset(dp, 0, d->size);  /* Much simpler to clear the struct first. */\r\n  cconv_substruct_tab(cts, d, dp, t, &i, flags);\r\n}\r\n\r\n/* Convert TValue to C type. Caveat: expects to get the raw CType! */\r\nvoid lj_cconv_ct_tv(CTState *cts, CType *d,\r\n\t\t    uint8_t *dp, TValue *o, CTInfo flags)\r\n{\r\n  CTypeID sid = CTID_P_VOID;\r\n  CType *s;\r\n  void *tmpptr;\r\n  uint8_t tmpbool, *sp = (uint8_t *)&tmpptr;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    sp = (uint8_t *)&o->i;\r\n    sid = CTID_INT32;\r\n    flags |= CCF_FROMTV;\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    sp = (uint8_t *)&o->n;\r\n    sid = CTID_DOUBLE;\r\n    flags |= CCF_FROMTV;\r\n  } else if (tviscdata(o)) {\r\n    sp = cdataptr(cdataV(o));\r\n    sid = cdataV(o)->ctypeid;\r\n    s = ctype_get(cts, sid);\r\n    if (ctype_isref(s->info)) {  /* Resolve reference for value. */\r\n      lua_assert(s->size == CTSIZE_PTR);\r\n      sp = *(void **)sp;\r\n      sid = ctype_cid(s->info);\r\n    }\r\n    s = ctype_raw(cts, sid);\r\n    if (ctype_isfunc(s->info)) {\r\n      sid = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|sid), CTSIZE_PTR);\r\n    } else {\r\n      if (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n      goto doconv;\r\n    }\r\n  } else if (tvisstr(o)) {\r\n    GCstr *str = strV(o);\r\n    if (ctype_isenum(d->info)) {  /* Match string against enum constant. */\r\n      CTSize ofs;\r\n      CType *cct = lj_ctype_getfield(cts, d, str, &ofs);\r\n      if (!cct || !ctype_isconstval(cct->info))\r\n\tgoto err_conv;\r\n      lua_assert(d->size == 4);\r\n      sp = (uint8_t *)&cct->size;\r\n      sid = ctype_cid(cct->info);\r\n    } else if (ctype_isrefarray(d->info)) {  /* Copy string to array. */\r\n      CType *dc = ctype_rawchild(cts, d);\r\n      CTSize sz = str->len+1;\r\n      if (!ctype_isinteger(dc->info) || dc->size != 1)\r\n\tgoto err_conv;\r\n      if (d->size != 0 && d->size < sz)\r\n\tsz = d->size;\r\n      memcpy(dp, strdata(str), sz);\r\n      return;\r\n    } else {  /* Otherwise pass it as a const char[]. */\r\n      sp = (uint8_t *)strdata(str);\r\n      sid = CTID_A_CCHAR;\r\n      flags |= CCF_FROMTV;\r\n    }\r\n  } else if (tvistab(o)) {\r\n    if (ctype_isarray(d->info)) {\r\n      cconv_array_tab(cts, d, dp, tabV(o), flags);\r\n      return;\r\n    } else if (ctype_isstruct(d->info)) {\r\n      cconv_struct_tab(cts, d, dp, tabV(o), flags);\r\n      return;\r\n    } else {\r\n      goto err_conv;\r\n    }\r\n  } else if (tvisbool(o)) {\r\n    tmpbool = boolV(o);\r\n    sp = &tmpbool;\r\n    sid = CTID_BOOL;\r\n  } else if (tvisnil(o)) {\r\n    tmpptr = (void *)0;\r\n    flags |= CCF_FROMTV;\r\n  } else if (tvisudata(o)) {\r\n    GCudata *ud = udataV(o);\r\n    tmpptr = uddata(ud);\r\n    if (ud->udtype == UDTYPE_IO_FILE)\r\n      tmpptr = *(void **)tmpptr;\r\n  } else if (tvislightud(o)) {\r\n    tmpptr = lightudV(o);\r\n  } else if (tvisfunc(o)) {\r\n    void *p = lj_ccallback_new(cts, d, funcV(o));\r\n    if (p) {\r\n      *(void **)dp = p;\r\n      return;\r\n    }\r\n    goto err_conv;\r\n  } else {\r\n  err_conv:\r\n    cconv_err_convtv(cts, d, o, flags);\r\n  }\r\n  s = ctype_get(cts, sid);\r\ndoconv:\r\n  if (ctype_isenum(d->info)) d = ctype_child(cts, d);\r\n  lj_cconv_ct_ct(cts, d, s, dp, sp, flags);\r\n}\r\n\r\n/* Convert TValue to bitfield. */\r\nvoid lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o)\r\n{\r\n  CTInfo info = d->info;\r\n  CTSize pos, bsz;\r\n  uint32_t val, mask;\r\n  lua_assert(ctype_isbitfield(info));\r\n  if ((info & CTF_BOOL)) {\r\n    uint8_t tmpbool;\r\n    lua_assert(ctype_bitbsz(info) == 1);\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_BOOL), &tmpbool, o, 0);\r\n    val = tmpbool;\r\n  } else {\r\n    CTypeID did = (info & CTF_UNSIGNED) ? CTID_UINT32 : CTID_INT32;\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, did), (uint8_t *)&val, o, 0);\r\n  }\r\n  pos = ctype_bitpos(info);\r\n  bsz = ctype_bitbsz(info);\r\n  lua_assert(pos < 8*ctype_bitcsz(info));\r\n  lua_assert(bsz > 0 && bsz <= 8*ctype_bitcsz(info));\r\n  /* Check if a packed bitfield crosses a container boundary. */\r\n  if (pos + bsz > 8*ctype_bitcsz(info))\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_NYIPACKBIT);\r\n  mask = ((1u << bsz) - 1u) << pos;\r\n  val = (val << pos) & mask;\r\n  /* NYI: packed bitfields may cause misaligned reads/writes. */\r\n  switch (ctype_bitcsz(info)) {\r\n  case 4: *(uint32_t *)dp = (*(uint32_t *)dp & ~mask) | (uint32_t)val; break;\r\n  case 2: *(uint16_t *)dp = (*(uint16_t *)dp & ~mask) | (uint16_t)val; break;\r\n  case 1: *(uint8_t *)dp = (*(uint8_t *)dp & ~mask) | (uint8_t)val; break;\r\n  default: lua_assert(0); break;\r\n  }\r\n}\r\n\r\n/* -- Initialize C type with TValues -------------------------------------- */\r\n\r\n/* Initialize an array with TValues. */\r\nstatic void cconv_array_init(CTState *cts, CType *d, CTSize sz, uint8_t *dp,\r\n\t\t\t     TValue *o, MSize len)\r\n{\r\n  CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n  CTSize ofs, esize = dc->size;\r\n  MSize i;\r\n  if (len*esize > sz)\r\n    cconv_err_initov(cts, d);\r\n  for (i = 0, ofs = 0; i < len; i++, ofs += esize)\r\n    lj_cconv_ct_tv(cts, dc, dp + ofs, o + i, 0);\r\n  if (ofs == esize) {  /* Replicate a single element. */\r\n    for (; ofs < sz; ofs += esize) memcpy(dp + ofs, dp, esize);\r\n  } else {  /* Otherwise fill the remainder with zero. */\r\n    memset(dp + ofs, 0, sz - ofs);\r\n  }\r\n}\r\n\r\n/* Initialize a sub-struct/union with TValues. */\r\nstatic void cconv_substruct_init(CTState *cts, CType *d, uint8_t *dp,\r\n\t\t\t\t TValue *o, MSize len, MSize *ip)\r\n{\r\n  CTypeID id = d->sib;\r\n  while (id) {\r\n    CType *df = ctype_get(cts, id);\r\n    id = df->sib;\r\n    if (ctype_isfield(df->info) || ctype_isbitfield(df->info)) {\r\n      MSize i = *ip;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      if (i >= len) break;\r\n      *ip = i + 1;\r\n      if (ctype_isfield(df->info))\r\n\tlj_cconv_ct_tv(cts, ctype_rawchild(cts, df), dp+df->size, o + i, 0);\r\n      else\r\n\tlj_cconv_bf_tv(cts, df, dp+df->size, o + i);\r\n      if ((d->info & CTF_UNION)) break;\r\n    } else if (ctype_isxattrib(df->info, CTA_SUBTYPE)) {\r\n      cconv_substruct_init(cts, ctype_rawchild(cts, df),\r\n\t\t\t   dp+df->size, o, len, ip);\r\n      if ((d->info & CTF_UNION)) break;\r\n    }  /* Ignore all other entries in the chain. */\r\n  }\r\n}\r\n\r\n/* Initialize a struct/union with TValues. */\r\nstatic void cconv_struct_init(CTState *cts, CType *d, CTSize sz, uint8_t *dp,\r\n\t\t\t      TValue *o, MSize len)\r\n{\r\n  MSize i = 0;\r\n  memset(dp, 0, sz);  /* Much simpler to clear the struct first. */\r\n  cconv_substruct_init(cts, d, dp, o, len, &i);\r\n  if (i < len)\r\n    cconv_err_initov(cts, d);\r\n}\r\n\r\n/* Check whether to use a multi-value initializer.\r\n** This is true if an aggregate is to be initialized with a value.\r\n** Valarrays are treated as values here so ct_tv handles (V|C, I|F).\r\n*/\r\nint lj_cconv_multi_init(CTState *cts, CType *d, TValue *o)\r\n{\r\n  if (!(ctype_isrefarray(d->info) || ctype_isstruct(d->info)))\r\n    return 0;  /* Destination is not an aggregate. */\r\n  if (tvistab(o) || (tvisstr(o) && !ctype_isstruct(d->info)))\r\n    return 0;  /* Initializer is not a value. */\r\n  if (tviscdata(o) && lj_ctype_rawref(cts, cdataV(o)->ctypeid) == d)\r\n    return 0;  /* Source and destination are identical aggregates. */\r\n  return 1;  /* Otherwise the initializer is a value. */\r\n}\r\n\r\n/* Initialize C type with TValues. Caveat: expects to get the raw CType! */\r\nvoid lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz,\r\n\t\t      uint8_t *dp, TValue *o, MSize len)\r\n{\r\n  if (len == 0)\r\n    memset(dp, 0, sz);\r\n  else if (len == 1 && !lj_cconv_multi_init(cts, d, o))\r\n    lj_cconv_ct_tv(cts, d, dp, o, 0);\r\n  else if (ctype_isarray(d->info))  /* Also handles valarray init with len>1. */\r\n    cconv_array_init(cts, d, sz, dp, o, len);\r\n  else if (ctype_isstruct(d->info))\r\n    cconv_struct_init(cts, d, sz, dp, o, len);\r\n  else\r\n    cconv_err_initov(cts, d);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cconv.h",
    "content": "/*\r\n** C type conversions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCONV_H\r\n#define _LJ_CCONV_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Compressed C type index. ORDER CCX. */\r\nenum {\r\n  CCX_B,\t/* Bool. */\r\n  CCX_I,\t/* Integer. */\r\n  CCX_F,\t/* Floating-point number. */\r\n  CCX_C,\t/* Complex. */\r\n  CCX_V,\t/* Vector. */\r\n  CCX_P,\t/* Pointer. */\r\n  CCX_A,\t/* Refarray. */\r\n  CCX_S\t\t/* Struct/union. */\r\n};\r\n\r\n/* Convert C type info to compressed C type index. ORDER CT. ORDER CCX. */\r\nstatic LJ_AINLINE uint32_t cconv_idx(CTInfo info)\r\n{\r\n  uint32_t idx = ((info >> 26) & 15u);  /* Dispatch bits. */\r\n  lua_assert(ctype_type(info) <= CT_MAYCONVERT);\r\n#if LJ_64\r\n  idx = ((uint32_t)(U64x(f436fff5,fff7f021) >> 4*idx) & 15u);\r\n#else\r\n  idx = (((idx < 8 ? 0xfff7f021u : 0xf436fff5) >> 4*(idx & 7u)) & 15u);\r\n#endif\r\n  lua_assert(idx < 8);\r\n  return idx;\r\n}\r\n\r\n#define cconv_idx2(dinfo, sinfo) \\\r\n  ((cconv_idx((dinfo)) << 3) + cconv_idx((sinfo)))\r\n\r\n#define CCX(dst, src)\t\t((CCX_##dst << 3) + CCX_##src)\r\n\r\n/* Conversion flags. */\r\n#define CCF_CAST\t0x00000001u\r\n#define CCF_FROMTV\t0x00000002u\r\n#define CCF_SAME\t0x00000004u\r\n#define CCF_IGNQUAL\t0x00000008u\r\n\r\n#define CCF_ARG_SHIFT\t8\r\n#define CCF_ARG(n)\t((n) << CCF_ARG_SHIFT)\r\n#define CCF_GETARG(f)\t((f) >> CCF_ARG_SHIFT)\r\n\r\nLJ_FUNC int lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags);\r\nLJ_FUNC void lj_cconv_ct_ct(CTState *cts, CType *d, CType *s,\r\n\t\t\t    uint8_t *dp, uint8_t *sp, CTInfo flags);\r\nLJ_FUNC int lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid,\r\n\t\t\t   TValue *o, uint8_t *sp);\r\nLJ_FUNC int lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp);\r\nLJ_FUNC void lj_cconv_ct_tv(CTState *cts, CType *d,\r\n\t\t\t    uint8_t *dp, TValue *o, CTInfo flags);\r\nLJ_FUNC void lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o);\r\nLJ_FUNC int lj_cconv_multi_init(CTState *cts, CType *d, TValue *o);\r\nLJ_FUNC void lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz,\r\n\t\t\t      uint8_t *dp, TValue *o, MSize len);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cdata.c",
    "content": "/*\r\n** C data management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n\r\n/* -- C data allocation --------------------------------------------------- */\r\n\r\n/* Allocate a new C data object holding a reference to another object. */\r\nGCcdata *lj_cdata_newref(CTState *cts, const void *p, CTypeID id)\r\n{\r\n  CTypeID refid = lj_ctype_intern(cts, CTINFO_REF(id), CTSIZE_PTR);\r\n  GCcdata *cd = lj_cdata_new(cts, refid, CTSIZE_PTR);\r\n  *(const void **)cdataptr(cd) = p;\r\n  return cd;\r\n}\r\n\r\n/* Allocate variable-sized or specially aligned C data object. */\r\nGCcdata *lj_cdata_newv(CTState *cts, CTypeID id, CTSize sz, CTSize align)\r\n{\r\n  global_State *g;\r\n  MSize extra = sizeof(GCcdataVar) + sizeof(GCcdata) +\r\n\t\t(align > CT_MEMALIGN ? (1u<<align) - (1u<<CT_MEMALIGN) : 0);\r\n  char *p = lj_mem_newt(cts->L, extra + sz, char);\r\n  uintptr_t adata = (uintptr_t)p + sizeof(GCcdataVar) + sizeof(GCcdata);\r\n  uintptr_t almask = (1u << align) - 1u;\r\n  GCcdata *cd = (GCcdata *)(((adata + almask) & ~almask) - sizeof(GCcdata));\r\n  lua_assert((char *)cd - p < 65536);\r\n  cdatav(cd)->offset = (uint16_t)((char *)cd - p);\r\n  cdatav(cd)->extra = extra;\r\n  cdatav(cd)->len = sz;\r\n  g = cts->g;\r\n  setgcrefr(cd->nextgc, g->gc.root);\r\n  setgcref(g->gc.root, obj2gco(cd));\r\n  newwhite(g, obj2gco(cd));\r\n  cd->marked |= 0x80;\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = id;\r\n  return cd;\r\n}\r\n\r\n/* Free a C data object. */\r\nvoid LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd)\r\n{\r\n  if (LJ_UNLIKELY(cd->marked & LJ_GC_CDATA_FIN)) {\r\n    GCobj *root;\r\n    makewhite(g, obj2gco(cd));\r\n    markfinalized(obj2gco(cd));\r\n    if ((root = gcref(g->gc.mmudata)) != NULL) {\r\n      setgcrefr(cd->nextgc, root->gch.nextgc);\r\n      setgcref(root->gch.nextgc, obj2gco(cd));\r\n      setgcref(g->gc.mmudata, obj2gco(cd));\r\n    } else {\r\n      setgcref(cd->nextgc, obj2gco(cd));\r\n      setgcref(g->gc.mmudata, obj2gco(cd));\r\n    }\r\n  } else if (LJ_LIKELY(!cdataisv(cd))) {\r\n    CType *ct = ctype_raw(ctype_ctsG(g), cd->ctypeid);\r\n    CTSize sz = ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR;\r\n    lua_assert(ctype_hassize(ct->info) || ctype_isfunc(ct->info) ||\r\n\t       ctype_isextern(ct->info));\r\n    lj_mem_free(g, cd, sizeof(GCcdata) + sz);\r\n  } else {\r\n    lj_mem_free(g, memcdatav(cd), sizecdatav(cd));\r\n  }\r\n}\r\n\r\nTValue * LJ_FASTCALL lj_cdata_setfin(lua_State *L, GCcdata *cd)\r\n{\r\n  global_State *g = G(L);\r\n  GCtab *t = ctype_ctsG(g)->finalizer;\r\n  if (gcref(t->metatable)) {\r\n    /* Add cdata to finalizer table, if still enabled. */\r\n    TValue *tv, tmp;\r\n    setcdataV(L, &tmp, cd);\r\n    lj_gc_anybarriert(L, t);\r\n    tv = lj_tab_set(L, t, &tmp);\r\n    cd->marked |= LJ_GC_CDATA_FIN;\r\n    return tv;\r\n  } else {\r\n    /* Otherwise return dummy TValue. */\r\n    return &g->tmptv;\r\n  }\r\n}\r\n\r\n/* -- C data indexing ----------------------------------------------------- */\r\n\r\n/* Index C data by a TValue. Return CType and pointer. */\r\nCType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key, uint8_t **pp,\r\n\t\t      CTInfo *qual)\r\n{\r\n  uint8_t *p = (uint8_t *)cdataptr(cd);\r\n  CType *ct = ctype_get(cts, cd->ctypeid);\r\n  ptrdiff_t idx;\r\n\r\n  /* Resolve reference for cdata object. */\r\n  if (ctype_isref(ct->info)) {\r\n    lua_assert(ct->size == CTSIZE_PTR);\r\n    p = *(uint8_t **)p;\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n\r\ncollect_attrib:\r\n  /* Skip attributes and collect qualifiers. */\r\n  while (ctype_isattrib(ct->info)) {\r\n    if (ctype_attrib(ct->info) == CTA_QUAL) *qual |= ct->size;\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n  lua_assert(!ctype_isref(ct->info));  /* Interning rejects refs to refs. */\r\n\r\n  if (tvisint(key)) {\r\n    idx = (ptrdiff_t)intV(key);\r\n    goto integer_key;\r\n  } else if (tvisnum(key)) {  /* Numeric key. */\r\n    idx = LJ_64 ? (ptrdiff_t)numV(key) : (ptrdiff_t)lj_num2int(numV(key));\r\n  integer_key:\r\n    if (ctype_ispointer(ct->info)) {\r\n      CTSize sz = lj_ctype_size(cts, ctype_cid(ct->info));  /* Element size. */\r\n      if (sz == CTSIZE_INVALID)\r\n\tlj_err_caller(cts->L, LJ_ERR_FFI_INVSIZE);\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = (uint8_t *)cdata_getptr(p, ct->size);\r\n      } else if ((ct->info & (CTF_VECTOR|CTF_COMPLEX))) {\r\n\tif ((ct->info & CTF_COMPLEX)) idx &= 1;\r\n\t*qual |= CTF_CONST;  /* Valarray elements are constant. */\r\n      }\r\n      *pp = p + idx*(int32_t)sz;\r\n      return ct;\r\n    }\r\n  } else if (tviscdata(key)) {  /* Integer cdata key. */\r\n    GCcdata *cdk = cdataV(key);\r\n    CType *ctk = ctype_raw(cts, cdk->ctypeid);\r\n    if (ctype_isenum(ctk->info)) ctk = ctype_child(cts, ctk);\r\n    if (ctype_isinteger(ctk->info)) {\r\n      lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ctk,\r\n\t\t     (uint8_t *)&idx, cdataptr(cdk), 0);\r\n      goto integer_key;\r\n    }\r\n  } else if (tvisstr(key)) {  /* String key. */\r\n    GCstr *name = strV(key);\r\n    if (ctype_isstruct(ct->info)) {\r\n      CTSize ofs;\r\n      CType *fct = lj_ctype_getfieldq(cts, ct, name, &ofs, qual);\r\n      if (fct) {\r\n\t*pp = p + ofs;\r\n\treturn fct;\r\n      }\r\n    } else if (ctype_iscomplex(ct->info)) {\r\n      if (name->len == 2) {\r\n\t*qual |= CTF_CONST;  /* Complex fields are constant. */\r\n\tif (strdata(name)[0] == 'r' && strdata(name)[1] == 'e') {\r\n\t  *pp = p;\r\n\t  return ct;\r\n\t} else if (strdata(name)[0] == 'i' && strdata(name)[1] == 'm') {\r\n\t  *pp = p + (ct->size >> 1);\r\n\t  return ct;\r\n\t}\r\n      }\r\n    } else if (cd->ctypeid == CTID_CTYPEID) {\r\n      /* Allow indexing a (pointer to) struct constructor to get constants. */\r\n      CType *sct = ctype_raw(cts, *(CTypeID *)p);\r\n      if (ctype_isptr(sct->info))\r\n\tsct = ctype_rawchild(cts, sct);\r\n      if (ctype_isstruct(sct->info)) {\r\n\tCTSize ofs;\r\n\tCType *fct = lj_ctype_getfield(cts, sct, name, &ofs);\r\n\tif (fct && ctype_isconstval(fct->info))\r\n\t  return fct;\r\n      }\r\n      ct = sct;  /* Allow resolving metamethods for constructors, too. */\r\n    }\r\n  }\r\n  if (ctype_isptr(ct->info)) {  /* Automatically perform '->'. */\r\n    if (ctype_isstruct(ctype_rawchild(cts, ct)->info)) {\r\n      p = (uint8_t *)cdata_getptr(p, ct->size);\r\n      ct = ctype_child(cts, ct);\r\n      goto collect_attrib;\r\n    }\r\n  }\r\n  *qual |= 1;  /* Lookup failed. */\r\n  return ct;  /* But return the resolved raw type. */\r\n}\r\n\r\n/* -- C data getters ------------------------------------------------------ */\r\n\r\n/* Get constant value and convert to TValue. */\r\nstatic void cdata_getconst(CTState *cts, TValue *o, CType *ct)\r\n{\r\n  CType *ctt = ctype_child(cts, ct);\r\n  lua_assert(ctype_isinteger(ctt->info) && ctt->size <= 4);\r\n  /* Constants are already zero-extended/sign-extended to 32 bits. */\r\n  if ((ctt->info & CTF_UNSIGNED) && (int32_t)ct->size < 0)\r\n    setnumV(o, (lua_Number)(uint32_t)ct->size);\r\n  else\r\n    setintV(o, (int32_t)ct->size);\r\n}\r\n\r\n/* Get C data value and convert to TValue. */\r\nint lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp)\r\n{\r\n  CTypeID sid;\r\n\r\n  if (ctype_isconstval(s->info)) {\r\n    cdata_getconst(cts, o, s);\r\n    return 0;  /* No GC step needed. */\r\n  } else if (ctype_isbitfield(s->info)) {\r\n    return lj_cconv_tv_bf(cts, s, o, sp);\r\n  }\r\n\r\n  /* Get child type of pointer/array/field. */\r\n  lua_assert(ctype_ispointer(s->info) || ctype_isfield(s->info));\r\n  sid = ctype_cid(s->info);\r\n  s = ctype_get(cts, sid);\r\n\r\n  /* Resolve reference for field. */\r\n  if (ctype_isref(s->info)) {\r\n    lua_assert(s->size == CTSIZE_PTR);\r\n    sp = *(uint8_t **)sp;\r\n    sid = ctype_cid(s->info);\r\n    s = ctype_get(cts, sid);\r\n  }\r\n\r\n  /* Skip attributes. */\r\n  while (ctype_isattrib(s->info))\r\n    s = ctype_child(cts, s);\r\n\r\n  return lj_cconv_tv_ct(cts, s, sid, o, sp);\r\n}\r\n\r\n/* -- C data setters ------------------------------------------------------ */\r\n\r\n/* Convert TValue and set C data value. */\r\nvoid lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o, CTInfo qual)\r\n{\r\n  if (ctype_isconstval(d->info)) {\r\n    goto err_const;\r\n  } else if (ctype_isbitfield(d->info)) {\r\n    if (((d->info|qual) & CTF_CONST)) goto err_const;\r\n    lj_cconv_bf_tv(cts, d, dp, o);\r\n    return;\r\n  }\r\n\r\n  /* Get child type of pointer/array/field. */\r\n  lua_assert(ctype_ispointer(d->info) || ctype_isfield(d->info));\r\n  d = ctype_child(cts, d);\r\n\r\n  /* Resolve reference for field. */\r\n  if (ctype_isref(d->info)) {\r\n    lua_assert(d->size == CTSIZE_PTR);\r\n    dp = *(uint8_t **)dp;\r\n    d = ctype_child(cts, d);\r\n  }\r\n\r\n  /* Skip attributes and collect qualifiers. */\r\n  for (;;) {\r\n    if (ctype_isattrib(d->info)) {\r\n      if (ctype_attrib(d->info) == CTA_QUAL) qual |= d->size;\r\n    } else {\r\n      break;\r\n    }\r\n    d = ctype_child(cts, d);\r\n  }\r\n\r\n  lua_assert(ctype_hassize(d->info) && !ctype_isvoid(d->info));\r\n\r\n  if (((d->info|qual) & CTF_CONST)) {\r\n  err_const:\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_WRCONST);\r\n  }\r\n\r\n  lj_cconv_ct_tv(cts, d, dp, o, 0);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cdata.h",
    "content": "/*\r\n** C data management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CDATA_H\r\n#define _LJ_CDATA_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Get C data pointer. */\r\nstatic LJ_AINLINE void *cdata_getptr(void *p, CTSize sz)\r\n{\r\n  if (LJ_64 && sz == 4) {  /* Support 32 bit pointers on 64 bit targets. */\r\n    return ((void *)(uintptr_t)*(uint32_t *)p);\r\n  } else {\r\n    lua_assert(sz == CTSIZE_PTR);\r\n    return *(void **)p;\r\n  }\r\n}\r\n\r\n/* Set C data pointer. */\r\nstatic LJ_AINLINE void cdata_setptr(void *p, CTSize sz, const void *v)\r\n{\r\n  if (LJ_64 && sz == 4) {  /* Support 32 bit pointers on 64 bit targets. */\r\n    *(uint32_t *)p = (uint32_t)(uintptr_t)v;\r\n  } else {\r\n    lua_assert(sz == CTSIZE_PTR);\r\n    *(void **)p = (void *)v;\r\n  }\r\n}\r\n\r\n/* Allocate fixed-size C data object. */\r\nstatic LJ_AINLINE GCcdata *lj_cdata_new(CTState *cts, CTypeID id, CTSize sz)\r\n{\r\n  GCcdata *cd;\r\n#ifdef LUA_USE_ASSERT\r\n  CType *ct = ctype_raw(cts, id);\r\n  lua_assert((ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR) == sz);\r\n#endif\r\n  cd = (GCcdata *)lj_mem_newgco(cts->L, sizeof(GCcdata) + sz);\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = ctype_check(cts, id);\r\n  return cd;\r\n}\r\n\r\n/* Variant which works without a valid CTState. */\r\nstatic LJ_AINLINE GCcdata *lj_cdata_new_(lua_State *L, CTypeID id, CTSize sz)\r\n{\r\n  GCcdata *cd = (GCcdata *)lj_mem_newgco(L, sizeof(GCcdata) + sz);\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = id;\r\n  return cd;\r\n}\r\n\r\nLJ_FUNC GCcdata *lj_cdata_newref(CTState *cts, const void *pp, CTypeID id);\r\nLJ_FUNC GCcdata *lj_cdata_newv(CTState *cts, CTypeID id, CTSize sz,\r\n\t\t\t       CTSize align);\r\n\r\nLJ_FUNC void LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd);\r\nLJ_FUNCA TValue * LJ_FASTCALL lj_cdata_setfin(lua_State *L, GCcdata *cd);\r\n\r\nLJ_FUNC CType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key,\r\n\t\t\t      uint8_t **pp, CTInfo *qual);\r\nLJ_FUNC int lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp);\r\nLJ_FUNC void lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o,\r\n\t\t\t  CTInfo qual);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_char.c",
    "content": "/*\r\n** Character types.\r\n** Donated to the public domain.\r\n**\r\n** This is intended to replace the problematic libc single-byte NLS functions.\r\n** These just don't make sense anymore with UTF-8 locales becoming the norm\r\n** on POSIX systems. It never worked too well on Windows systems since hardly\r\n** anyone bothered to call setlocale().\r\n**\r\n** This table is hardcoded for ASCII. Identifiers include the characters\r\n** 128-255, too. This allows for the use of all non-ASCII chars as identifiers\r\n** in the lexer. This is a broad definition, but works well in practice\r\n** for both UTF-8 locales and most single-byte locales (such as ISO-8859-*).\r\n**\r\n** If you really need proper character types for UTF-8 strings, please use\r\n** an add-on library such as slnunicode: http://luaforge.net/projects/sln/\r\n*/\r\n\r\n#define lj_char_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_char.h\"\r\n\r\nLJ_DATADEF const uint8_t lj_char_bits[257] = {\r\n    0,\r\n    1,  1,  1,  1,  1,  1,  1,  1,  1,  3,  3,  3,  3,  3,  1,  1,\r\n    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,\r\n    2,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,\r\n  152,152,152,152,152,152,152,152,152,152,  4,  4,  4,  4,  4,  4,\r\n    4,176,176,176,176,176,176,160,160,160,160,160,160,160,160,160,\r\n  160,160,160,160,160,160,160,160,160,160,160,  4,  4,  4,  4,132,\r\n    4,208,208,208,208,208,208,192,192,192,192,192,192,192,192,192,\r\n  192,192,192,192,192,192,192,192,192,192,192,  4,  4,  4,  4,  1,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128\r\n};\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_char.h",
    "content": "/*\r\n** Character types.\r\n** Donated to the public domain.\r\n*/\r\n\r\n#ifndef _LJ_CHAR_H\r\n#define _LJ_CHAR_H\r\n\r\n#include \"lj_def.h\"\r\n\r\n#define LJ_CHAR_CNTRL\t0x01\r\n#define LJ_CHAR_SPACE\t0x02\r\n#define LJ_CHAR_PUNCT\t0x04\r\n#define LJ_CHAR_DIGIT\t0x08\r\n#define LJ_CHAR_XDIGIT\t0x10\r\n#define LJ_CHAR_UPPER\t0x20\r\n#define LJ_CHAR_LOWER\t0x40\r\n#define LJ_CHAR_IDENT\t0x80\r\n#define LJ_CHAR_ALPHA\t(LJ_CHAR_LOWER|LJ_CHAR_UPPER)\r\n#define LJ_CHAR_ALNUM\t(LJ_CHAR_ALPHA|LJ_CHAR_DIGIT)\r\n#define LJ_CHAR_GRAPH\t(LJ_CHAR_ALNUM|LJ_CHAR_PUNCT)\r\n\r\n/* Only pass -1 or 0..255 to these macros. Never pass a signed char! */\r\n#define lj_char_isa(c, t)\t((lj_char_bits+1)[(c)] & t)\r\n#define lj_char_iscntrl(c)\tlj_char_isa((c), LJ_CHAR_CNTRL)\r\n#define lj_char_isspace(c)\tlj_char_isa((c), LJ_CHAR_SPACE)\r\n#define lj_char_ispunct(c)\tlj_char_isa((c), LJ_CHAR_PUNCT)\r\n#define lj_char_isdigit(c)\tlj_char_isa((c), LJ_CHAR_DIGIT)\r\n#define lj_char_isxdigit(c)\tlj_char_isa((c), LJ_CHAR_XDIGIT)\r\n#define lj_char_isupper(c)\tlj_char_isa((c), LJ_CHAR_UPPER)\r\n#define lj_char_islower(c)\tlj_char_isa((c), LJ_CHAR_LOWER)\r\n#define lj_char_isident(c)\tlj_char_isa((c), LJ_CHAR_IDENT)\r\n#define lj_char_isalpha(c)\tlj_char_isa((c), LJ_CHAR_ALPHA)\r\n#define lj_char_isalnum(c)\tlj_char_isa((c), LJ_CHAR_ALNUM)\r\n#define lj_char_isgraph(c)\tlj_char_isa((c), LJ_CHAR_GRAPH)\r\n\r\n#define lj_char_toupper(c)\t((c) - (lj_char_islower(c) >> 1))\r\n#define lj_char_tolower(c)\t((c) + lj_char_isupper(c))\r\n\r\nLJ_DATA const uint8_t lj_char_bits[257];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_clib.c",
    "content": "/*\r\n** FFI C library loader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_clib.h\"\r\n\r\n/* -- OS-specific functions ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_DLOPEN\r\n\r\n#include <dlfcn.h>\r\n#include <stdio.h>\r\n\r\n#if defined(RTLD_DEFAULT)\r\n#define CLIB_DEFHANDLE\tRTLD_DEFAULT\r\n#elif LJ_TARGET_OSX || LJ_TARGET_BSD\r\n#define CLIB_DEFHANDLE\t((void *)(intptr_t)-2)\r\n#else\r\n#define CLIB_DEFHANDLE\tNULL\r\n#endif\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error_(lua_State *L)\r\n{\r\n  lj_err_callermsg(L, dlerror());\r\n}\r\n\r\n#define clib_error(L, fmt, name)\tclib_error_(L)\r\n\r\n#if defined(__CYGWIN__)\r\n#define CLIB_SOPREFIX\t\"cyg\"\r\n#else\r\n#define CLIB_SOPREFIX\t\"lib\"\r\n#endif\r\n\r\n#if LJ_TARGET_OSX\r\n#define CLIB_SOEXT\t\"%s.dylib\"\r\n#elif defined(__CYGWIN__)\r\n#define CLIB_SOEXT\t\"%s.dll\"\r\n#else\r\n#define CLIB_SOEXT\t\"%s.so\"\r\n#endif\r\n\r\nstatic const char *clib_extname(lua_State *L, const char *name)\r\n{\r\n  if (!strchr(name, '/')\r\n#ifdef __CYGWIN__\r\n      && !strchr(name, '\\\\')\r\n#endif\r\n     ) {\r\n    if (!strchr(name, '.')) {\r\n      name = lj_str_pushf(L, CLIB_SOEXT, name);\r\n      L->top--;\r\n#ifdef __CYGWIN__\r\n    } else {\r\n      return name;\r\n#endif\r\n    }\r\n    if (!(name[0] == CLIB_SOPREFIX[0] && name[1] == CLIB_SOPREFIX[1] &&\r\n\t  name[2] == CLIB_SOPREFIX[2])) {\r\n      name = lj_str_pushf(L, CLIB_SOPREFIX \"%s\", name);\r\n      L->top--;\r\n    }\r\n  }\r\n  return name;\r\n}\r\n\r\n/* Check for a recognized ld script line. */\r\nstatic const char *clib_check_lds(lua_State *L, const char *buf)\r\n{\r\n  char *p, *e;\r\n  if ((!strncmp(buf, \"GROUP\", 5) || !strncmp(buf, \"INPUT\", 5)) &&\r\n      (p = strchr(buf, '('))) {\r\n    while (*++p == ' ') ;\r\n    for (e = p; *e && *e != ' ' && *e != ')'; e++) ;\r\n    return strdata(lj_str_new(L, p, e-p));\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Quick and dirty solution to resolve shared library name from ld script. */\r\nstatic const char *clib_resolve_lds(lua_State *L, const char *name)\r\n{\r\n  FILE *fp = fopen(name, \"r\");\r\n  const char *p = NULL;\r\n  if (fp) {\r\n    char buf[256];\r\n    if (fgets(buf, sizeof(buf), fp)) {\r\n      if (!strncmp(buf, \"/* GNU ld script\", 16)) {  /* ld script magic? */\r\n\twhile (fgets(buf, sizeof(buf), fp)) {  /* Check all lines. */\r\n\t  p = clib_check_lds(L, buf);\r\n\t  if (p) break;\r\n\t}\r\n      } else {  /* Otherwise check only the first line. */\r\n\tp = clib_check_lds(L, buf);\r\n      }\r\n    }\r\n    fclose(fp);\r\n  }\r\n  return p;\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  void *h = dlopen(clib_extname(L, name),\r\n\t\t   RTLD_LAZY | (global?RTLD_GLOBAL:RTLD_LOCAL));\r\n  if (!h) {\r\n    const char *e, *err = dlerror();\r\n    if (*err == '/' && (e = strchr(err, ':')) &&\r\n\t(name = clib_resolve_lds(L, strdata(lj_str_new(L, err, e-err))))) {\r\n      h = dlopen(name, RTLD_LAZY | (global?RTLD_GLOBAL:RTLD_LOCAL));\r\n      if (h) return h;\r\n      err = dlerror();\r\n    }\r\n    lj_err_callermsg(L, err);\r\n  }\r\n  return h;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  if (cl->handle && cl->handle != CLIB_DEFHANDLE)\r\n    dlclose(cl->handle);\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  void *p = dlsym(cl->handle, name);\r\n  return p;\r\n}\r\n\r\n#elif LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#ifndef GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\r\n#define GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\t4\r\n#define GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT\t2\r\nBOOL WINAPI GetModuleHandleExA(DWORD, LPCSTR, HMODULE*);\r\n#endif\r\n\r\n#define CLIB_DEFHANDLE\t((void *)-1)\r\n\r\n/* Default libraries. */\r\nenum {\r\n  CLIB_HANDLE_EXE,\r\n  CLIB_HANDLE_DLL,\r\n  CLIB_HANDLE_CRT,\r\n  CLIB_HANDLE_KERNEL32,\r\n  CLIB_HANDLE_USER32,\r\n  CLIB_HANDLE_GDI32,\r\n  CLIB_HANDLE_MAX\r\n};\r\n\r\nstatic void *clib_def_handle[CLIB_HANDLE_MAX];\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error(lua_State *L, const char *fmt,\r\n\t\t\t\t\t    const char *name)\r\n{\r\n  DWORD err = GetLastError();\r\n  char buf[128];\r\n  if (!FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS|FORMAT_MESSAGE_FROM_SYSTEM,\r\n\t\t      NULL, err, 0, buf, sizeof(buf), NULL))\r\n    buf[0] = '\\0';\r\n  lj_err_callermsg(L, lj_str_pushf(L, fmt, name, buf));\r\n}\r\n\r\nstatic int clib_needext(const char *s)\r\n{\r\n  while (*s) {\r\n    if (*s == '/' || *s == '\\\\' || *s == '.') return 0;\r\n    s++;\r\n  }\r\n  return 1;\r\n}\r\n\r\nstatic const char *clib_extname(lua_State *L, const char *name)\r\n{\r\n  if (clib_needext(name)) {\r\n    name = lj_str_pushf(L, \"%s.dll\", name);\r\n    L->top--;\r\n  }\r\n  return name;\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  DWORD oldwerr = GetLastError();\r\n  void *h = (void *)LoadLibraryA(clib_extname(L, name));\r\n  if (!h) clib_error(L, \"cannot load module \" LUA_QS \": %s\", name);\r\n  SetLastError(oldwerr);\r\n  UNUSED(global);\r\n  return h;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  if (cl->handle == CLIB_DEFHANDLE) {\r\n    MSize i;\r\n    for (i = CLIB_HANDLE_KERNEL32; i < CLIB_HANDLE_MAX; i++) {\r\n      void *h = clib_def_handle[i];\r\n      if (h) {\r\n\tclib_def_handle[i] = NULL;\r\n\tFreeLibrary((HINSTANCE)h);\r\n      }\r\n    }\r\n  } else if (cl->handle) {\r\n    FreeLibrary((HINSTANCE)cl->handle);\r\n  }\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  void *p = NULL;\r\n  if (cl->handle == CLIB_DEFHANDLE) {  /* Search default libraries. */\r\n    MSize i;\r\n    for (i = 0; i < CLIB_HANDLE_MAX; i++) {\r\n      HINSTANCE h = (HINSTANCE)clib_def_handle[i];\r\n      if (!(void *)h) {  /* Resolve default library handles (once). */\r\n\tswitch (i) {\r\n\tcase CLIB_HANDLE_EXE: GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT, NULL, &h); break;\r\n\tcase CLIB_HANDLE_DLL:\r\n\t  GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t     (const char *)clib_def_handle, &h);\r\n\t  break;\r\n\tcase CLIB_HANDLE_CRT:\r\n\t  GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t     (const char *)&_fmode, &h);\r\n\t  break;\r\n\tcase CLIB_HANDLE_KERNEL32: h = LoadLibraryA(\"kernel32.dll\"); break;\r\n\tcase CLIB_HANDLE_USER32: h = LoadLibraryA(\"user32.dll\"); break;\r\n\tcase CLIB_HANDLE_GDI32: h = LoadLibraryA(\"gdi32.dll\"); break;\r\n\t}\r\n\tif (!h) continue;\r\n\tclib_def_handle[i] = (void *)h;\r\n      }\r\n      p = (void *)GetProcAddress(h, name);\r\n      if (p) break;\r\n    }\r\n  } else {\r\n    p = (void *)GetProcAddress((HINSTANCE)cl->handle, name);\r\n  }\r\n  return p;\r\n}\r\n\r\n#else\r\n\r\n#define CLIB_DEFHANDLE\tNULL\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error(lua_State *L, const char *fmt,\r\n\t\t\t\t\t    const char *name)\r\n{\r\n  lj_err_callermsg(L, lj_str_pushf(L, fmt, name, \"no support for this OS\"));\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  lj_err_callermsg(L, \"no support for loading dynamic libraries for this OS\");\r\n  UNUSED(name); UNUSED(global);\r\n  return NULL;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  UNUSED(cl);\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  UNUSED(cl); UNUSED(name);\r\n  return NULL;\r\n}\r\n\r\n#endif\r\n\r\n/* -- C library indexing -------------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n/* Compute argument size for fastcall/stdcall functions. */\r\nstatic CTSize clib_func_argsize(CTState *cts, CType *ct)\r\n{\r\n  CTSize n = 0;\r\n  while (ct->sib) {\r\n    CType *d;\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      d = ctype_rawchild(cts, ct);\r\n      n += ((d->size + 3) & ~3);\r\n    }\r\n  }\r\n  return n;\r\n}\r\n#endif\r\n\r\n/* Get redirected or mangled external symbol. */\r\nstatic const char *clib_extsym(CTState *cts, CType *ct, GCstr *name)\r\n{\r\n  if (ct->sib) {\r\n    CType *ctf = ctype_get(cts, ct->sib);\r\n    if (ctype_isxattrib(ctf->info, CTA_REDIR))\r\n      return strdata(gco2str(gcref(ctf->name)));\r\n  }\r\n  return strdata(name);\r\n}\r\n\r\n/* Index a C library by name. */\r\nTValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name)\r\n{\r\n  TValue *tv = lj_tab_setstr(L, cl->cache, name);\r\n  if (LJ_UNLIKELY(tvisnil(tv))) {\r\n    CTState *cts = ctype_cts(L);\r\n    CType *ct;\r\n    CTypeID id = lj_ctype_getname(cts, &ct, name, CLNS_INDEX);\r\n    if (!id)\r\n      lj_err_callerv(L, LJ_ERR_FFI_NODECL, strdata(name));\r\n    if (ctype_isconstval(ct->info)) {\r\n      CType *ctt = ctype_child(cts, ct);\r\n      lua_assert(ctype_isinteger(ctt->info) && ctt->size <= 4);\r\n      if ((ctt->info & CTF_UNSIGNED) && (int32_t)ct->size < 0)\r\n\tsetnumV(tv, (lua_Number)(uint32_t)ct->size);\r\n      else\r\n\tsetintV(tv, (int32_t)ct->size);\r\n    } else {\r\n      const char *sym = clib_extsym(cts, ct, name);\r\n#if LJ_TARGET_WINDOWS\r\n      DWORD oldwerr = GetLastError();\r\n#endif\r\n      void *p = clib_getsym(cl, sym);\r\n      GCcdata *cd;\r\n      lua_assert(ctype_isfunc(ct->info) || ctype_isextern(ct->info));\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n      /* Retry with decorated name for fastcall/stdcall functions. */\r\n      if (!p && ctype_isfunc(ct->info)) {\r\n\tCTInfo cconv = ctype_cconv(ct->info);\r\n\tif (cconv == CTCC_FASTCALL || cconv == CTCC_STDCALL) {\r\n\t  CTSize sz = clib_func_argsize(cts, ct);\r\n\t  const char *symd = lj_str_pushf(L,\r\n\t\t\t       cconv == CTCC_FASTCALL ? \"@%s@%d\" : \"_%s@%d\",\r\n\t\t\t       sym, sz);\r\n\t  L->top--;\r\n\t  p = clib_getsym(cl, symd);\r\n\t}\r\n      }\r\n#endif\r\n      if (!p)\r\n\tclib_error(L, \"cannot resolve symbol \" LUA_QS \": %s\", sym);\r\n#if LJ_TARGET_WINDOWS\r\n      SetLastError(oldwerr);\r\n#endif\r\n      cd = lj_cdata_new(cts, id, CTSIZE_PTR);\r\n      *(void **)cdataptr(cd) = p;\r\n      setcdataV(L, tv, cd);\r\n    }\r\n  }\r\n  return tv;\r\n}\r\n\r\n/* -- C library management ------------------------------------------------ */\r\n\r\n/* Create a new CLibrary object and push it on the stack. */\r\nstatic CLibrary *clib_new(lua_State *L, GCtab *mt)\r\n{\r\n  GCtab *t = lj_tab_new(L, 0, 0);\r\n  GCudata *ud = lj_udata_new(L, sizeof(CLibrary), t);\r\n  CLibrary *cl = (CLibrary *)uddata(ud);\r\n  cl->cache = t;\r\n  ud->udtype = UDTYPE_FFI_CLIB;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcref(ud->metatable, obj2gco(mt));\r\n  setudataV(L, L->top++, ud);\r\n  return cl;\r\n}\r\n\r\n/* Load a C library. */\r\nvoid lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global)\r\n{\r\n  void *handle = clib_loadlib(L, strdata(name), global);\r\n  CLibrary *cl = clib_new(L, mt);\r\n  cl->handle = handle;\r\n}\r\n\r\n/* Unload a C library. */\r\nvoid lj_clib_unload(CLibrary *cl)\r\n{\r\n  clib_unloadlib(cl);\r\n  cl->handle = NULL;\r\n}\r\n\r\n/* Create the default C library object. */\r\nvoid lj_clib_default(lua_State *L, GCtab *mt)\r\n{\r\n  CLibrary *cl = clib_new(L, mt);\r\n  cl->handle = CLIB_DEFHANDLE;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_clib.h",
    "content": "/*\r\n** FFI C library loader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CLIB_H\r\n#define _LJ_CLIB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Namespace for C library indexing. */\r\n#define CLNS_INDEX\t((1u<<CT_FUNC)|(1u<<CT_EXTERN)|(1u<<CT_CONSTVAL))\r\n\r\n/* C library namespace. */\r\ntypedef struct CLibrary {\r\n  void *handle;\t\t/* Opaque handle for dynamic library loader. */\r\n  GCtab *cache;\t\t/* Cache for resolved symbols. Anchored in ud->env. */\r\n} CLibrary;\r\n\r\nLJ_FUNC TValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name);\r\nLJ_FUNC void lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global);\r\nLJ_FUNC void lj_clib_unload(CLibrary *cl);\r\nLJ_FUNC void lj_clib_default(lua_State *L, GCtab *mt);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cparse.c",
    "content": "/*\r\n** C declaration parser.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/*\r\n** Important note: this is NOT a validating C parser! This is a minimal\r\n** C declaration parser, solely for use by the LuaJIT FFI.\r\n**\r\n** It ought to return correct results for properly formed C declarations,\r\n** but it may accept some invalid declarations, too (and return nonsense).\r\n** Also, it shows rather generic error messages to avoid unnecessary bloat.\r\n** If in doubt, please check the input against your favorite C compiler.\r\n*/\r\n\r\n/* -- C lexer ------------------------------------------------------------- */\r\n\r\n/* C lexer token names. */\r\nstatic const char *const ctoknames[] = {\r\n#define CTOKSTR(name, str)\tstr,\r\nCTOKDEF(CTOKSTR)\r\n#undef CTOKSTR\r\n  NULL\r\n};\r\n\r\n/* Forward declaration. */\r\nLJ_NORET static void cp_err(CPState *cp, ErrMsg em);\r\n\r\nstatic const char *cp_tok2str(CPState *cp, CPToken tok)\r\n{\r\n  lua_assert(tok < CTOK_FIRSTDECL);\r\n  if (tok > CTOK_OFS)\r\n    return ctoknames[tok-CTOK_OFS-1];\r\n  else if (!lj_char_iscntrl(tok))\r\n    return lj_str_pushf(cp->L, \"%c\", tok);\r\n  else\r\n    return lj_str_pushf(cp->L, \"char(%d)\", tok);\r\n}\r\n\r\n/* End-of-line? */\r\nstatic LJ_AINLINE int cp_iseol(CPChar c)\r\n{\r\n  return (c == '\\n' || c == '\\r');\r\n}\r\n\r\n/* Peek next raw character. */\r\nstatic LJ_AINLINE CPChar cp_rawpeek(CPState *cp)\r\n{\r\n  return (CPChar)(uint8_t)(*cp->p);\r\n}\r\n\r\nstatic LJ_NOINLINE CPChar cp_get_bs(CPState *cp);\r\n\r\n/* Get next character. */\r\nstatic LJ_AINLINE CPChar cp_get(CPState *cp)\r\n{\r\n  cp->c = (CPChar)(uint8_t)(*cp->p++);\r\n  if (LJ_LIKELY(cp->c != '\\\\')) return cp->c;\r\n  return cp_get_bs(cp);\r\n}\r\n\r\n/* Transparently skip backslash-escaped line breaks. */\r\nstatic LJ_NOINLINE CPChar cp_get_bs(CPState *cp)\r\n{\r\n  CPChar c2, c = cp_rawpeek(cp);\r\n  if (!cp_iseol(c)) return cp->c;\r\n  cp->p++;\r\n  c2 = cp_rawpeek(cp);\r\n  if (cp_iseol(c2) && c2 != c) cp->p++;\r\n  cp->linenumber++;\r\n  return cp_get(cp);\r\n}\r\n\r\n/* Grow save buffer. */\r\nstatic LJ_NOINLINE void cp_save_grow(CPState *cp, CPChar c)\r\n{\r\n  MSize newsize;\r\n  if (cp->sb.sz >= CPARSE_MAX_BUF/2)\r\n    cp_err(cp, LJ_ERR_XELEM);\r\n  newsize = cp->sb.sz * 2;\r\n  lj_str_resizebuf(cp->L, &cp->sb, newsize);\r\n  cp->sb.buf[cp->sb.n++] = (char)c;\r\n}\r\n\r\n/* Save character in buffer. */\r\nstatic LJ_AINLINE void cp_save(CPState *cp, CPChar c)\r\n{\r\n  if (LJ_UNLIKELY(cp->sb.n + 1 > cp->sb.sz))\r\n    cp_save_grow(cp, c);\r\n  else\r\n    cp->sb.buf[cp->sb.n++] = (char)c;\r\n}\r\n\r\n/* Skip line break. Handles \"\\n\", \"\\r\", \"\\r\\n\" or \"\\n\\r\". */\r\nstatic void cp_newline(CPState *cp)\r\n{\r\n  CPChar c = cp_rawpeek(cp);\r\n  if (cp_iseol(c) && c != cp->c) cp->p++;\r\n  cp->linenumber++;\r\n}\r\n\r\nLJ_NORET static void cp_errmsg(CPState *cp, CPToken tok, ErrMsg em, ...)\r\n{\r\n  const char *msg, *tokstr;\r\n  lua_State *L;\r\n  va_list argp;\r\n  if (tok == 0) {\r\n    tokstr = NULL;\r\n  } else if (tok == CTOK_IDENT || tok == CTOK_INTEGER || tok == CTOK_STRING ||\r\n\t     tok >= CTOK_FIRSTDECL) {\r\n    if (cp->sb.n == 0) cp_save(cp, '$');\r\n    cp_save(cp, '\\0');\r\n    tokstr = cp->sb.buf;\r\n  } else {\r\n    tokstr = cp_tok2str(cp, tok);\r\n  }\r\n  L = cp->L;\r\n  va_start(argp, em);\r\n  msg = lj_str_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  if (tokstr)\r\n    msg = lj_str_pushf(L, err2msg(LJ_ERR_XNEAR), msg, tokstr);\r\n  if (cp->linenumber > 1)\r\n    msg = lj_str_pushf(L, \"%s at line %d\", msg, cp->linenumber);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err_token(CPState *cp, CPToken tok)\r\n{\r\n  cp_errmsg(cp, cp->tok, LJ_ERR_XTOKEN, cp_tok2str(cp, tok));\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err_badidx(CPState *cp, CType *ct)\r\n{\r\n  GCstr *s = lj_ctype_repr(cp->cts->L, ctype_typeid(cp->cts, ct), NULL);\r\n  cp_errmsg(cp, 0, LJ_ERR_FFI_BADIDX, strdata(s));\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err(CPState *cp, ErrMsg em)\r\n{\r\n  cp_errmsg(cp, 0, em);\r\n}\r\n\r\n/* -- Main lexical scanner ------------------------------------------------ */\r\n\r\n/* Parse number literal. Only handles int32_t/uint32_t right now. */\r\nstatic CPToken cp_number(CPState *cp)\r\n{\r\n  StrScanFmt fmt;\r\n  TValue o;\r\n  do { cp_save(cp, cp->c); } while (lj_char_isident(cp_get(cp)));\r\n  cp_save(cp, '\\0');\r\n  fmt = lj_strscan_scan((const uint8_t *)cp->sb.buf, &o, STRSCAN_OPT_C);\r\n  if (fmt == STRSCAN_INT) cp->val.id = CTID_INT32;\r\n  else if (fmt == STRSCAN_U32) cp->val.id = CTID_UINT32;\r\n  else if (!(cp->mode & CPARSE_MODE_SKIP))\r\n    cp_errmsg(cp, CTOK_INTEGER, LJ_ERR_XNUMBER);\r\n  cp->val.u32 = (uint32_t)o.i;\r\n  return CTOK_INTEGER;\r\n}\r\n\r\n/* Parse identifier or keyword. */\r\nstatic CPToken cp_ident(CPState *cp)\r\n{\r\n  do { cp_save(cp, cp->c); } while (lj_char_isident(cp_get(cp)));\r\n  cp->str = lj_str_new(cp->L, cp->sb.buf, cp->sb.n);\r\n  cp->val.id = lj_ctype_getname(cp->cts, &cp->ct, cp->str, cp->tmask);\r\n  if (ctype_type(cp->ct->info) == CT_KW)\r\n    return ctype_cid(cp->ct->info);\r\n  return CTOK_IDENT;\r\n}\r\n\r\n/* Parse parameter. */\r\nstatic CPToken cp_param(CPState *cp)\r\n{\r\n  CPChar c = cp_get(cp);\r\n  TValue *o = cp->param;\r\n  if (lj_char_isident(c) || c == '$')  /* Reserve $xyz for future extensions. */\r\n    cp_errmsg(cp, c, LJ_ERR_XSYNTAX);\r\n  if (!o || o >= cp->L->top)\r\n    cp_err(cp, LJ_ERR_FFI_NUMPARAM);\r\n  cp->param = o+1;\r\n  if (tvisstr(o)) {\r\n    cp->str = strV(o);\r\n    cp->val.id = 0;\r\n    cp->ct = &cp->cts->tab[0];\r\n    return CTOK_IDENT;\r\n  } else if (tvisnumber(o)) {\r\n    cp->val.i32 = numberVint(o);\r\n    cp->val.id = CTID_INT32;\r\n    return CTOK_INTEGER;\r\n  } else {\r\n    GCcdata *cd;\r\n    if (!tviscdata(o))\r\n      lj_err_argtype(cp->L, (int)(o-cp->L->base)+1, \"type parameter\");\r\n    cd = cdataV(o);\r\n    if (cd->ctypeid == CTID_CTYPEID)\r\n      cp->val.id = *(CTypeID *)cdataptr(cd);\r\n    else\r\n      cp->val.id = cd->ctypeid;\r\n    return '$';\r\n  }\r\n}\r\n\r\n/* Parse string or character constant. */\r\nstatic CPToken cp_string(CPState *cp)\r\n{\r\n  CPChar delim = cp->c;\r\n  cp_get(cp);\r\n  while (cp->c != delim) {\r\n    CPChar c = cp->c;\r\n    if (c == '\\0') cp_errmsg(cp, CTOK_EOF, LJ_ERR_XSTR);\r\n    if (c == '\\\\') {\r\n      c = cp_get(cp);\r\n      switch (c) {\r\n      case '\\0': cp_errmsg(cp, CTOK_EOF, LJ_ERR_XSTR); break;\r\n      case 'a': c = '\\a'; break;\r\n      case 'b': c = '\\b'; break;\r\n      case 'f': c = '\\f'; break;\r\n      case 'n': c = '\\n'; break;\r\n      case 'r': c = '\\r'; break;\r\n      case 't': c = '\\t'; break;\r\n      case 'v': c = '\\v'; break;\r\n      case 'e': c = 27; break;\r\n      case 'x':\r\n\tc = 0;\r\n\twhile (lj_char_isxdigit(cp_get(cp)))\r\n\t  c = (c<<4) + (lj_char_isdigit(cp->c) ? cp->c-'0' : (cp->c&15)+9);\r\n\tcp_save(cp, (c & 0xff));\r\n\tcontinue;\r\n      default:\r\n\tif (lj_char_isdigit(c)) {\r\n\t  c -= '0';\r\n\t  if (lj_char_isdigit(cp_get(cp))) {\r\n\t    c = c*8 + (cp->c - '0');\r\n\t    if (lj_char_isdigit(cp_get(cp))) {\r\n\t      c = c*8 + (cp->c - '0');\r\n\t      cp_get(cp);\r\n\t    }\r\n\t  }\r\n\t  cp_save(cp, (c & 0xff));\r\n\t  continue;\r\n\t}\r\n\tbreak;\r\n      }\r\n    }\r\n    cp_save(cp, c);\r\n    cp_get(cp);\r\n  }\r\n  cp_get(cp);\r\n  if (delim == '\"') {\r\n    cp->str = lj_str_new(cp->L, cp->sb.buf, cp->sb.n);\r\n    return CTOK_STRING;\r\n  } else {\r\n    if (cp->sb.n != 1) cp_err_token(cp, '\\'');\r\n    cp->val.i32 = (int32_t)(char)cp->sb.buf[0];\r\n    cp->val.id = CTID_INT32;\r\n    return CTOK_INTEGER;\r\n  }\r\n}\r\n\r\n/* Skip C comment. */\r\nstatic void cp_comment_c(CPState *cp)\r\n{\r\n  do {\r\n    if (cp_get(cp) == '*') {\r\n      do {\r\n\tif (cp_get(cp) == '/') { cp_get(cp); return; }\r\n      } while (cp->c == '*');\r\n    }\r\n    if (cp_iseol(cp->c)) cp_newline(cp);\r\n  } while (cp->c != '\\0');\r\n}\r\n\r\n/* Skip C++ comment. */\r\nstatic void cp_comment_cpp(CPState *cp)\r\n{\r\n  while (!cp_iseol(cp_get(cp)) && cp->c != '\\0')\r\n    ;\r\n}\r\n\r\n/* Lexical scanner for C. Only a minimal subset is implemented. */\r\nstatic CPToken cp_next_(CPState *cp)\r\n{\r\n  lj_str_resetbuf(&cp->sb);\r\n  for (;;) {\r\n    if (lj_char_isident(cp->c))\r\n      return lj_char_isdigit(cp->c) ? cp_number(cp) : cp_ident(cp);\r\n    switch (cp->c) {\r\n    case '\\n': case '\\r': cp_newline(cp);  /* fallthrough. */\r\n    case ' ': case '\\t': case '\\v': case '\\f': cp_get(cp); break;\r\n    case '\"': case '\\'': return cp_string(cp);\r\n    case '/':\r\n      if (cp_get(cp) == '*') cp_comment_c(cp);\r\n      else if (cp->c == '/') cp_comment_cpp(cp);\r\n      else return '/';\r\n      break;\r\n    case '|':\r\n      if (cp_get(cp) != '|') return '|'; cp_get(cp); return CTOK_OROR;\r\n    case '&':\r\n      if (cp_get(cp) != '&') return '&'; cp_get(cp); return CTOK_ANDAND;\r\n    case '=':\r\n      if (cp_get(cp) != '=') return '='; cp_get(cp); return CTOK_EQ;\r\n    case '!':\r\n      if (cp_get(cp) != '=') return '!'; cp_get(cp); return CTOK_NE;\r\n    case '<':\r\n      if (cp_get(cp) == '=') { cp_get(cp); return CTOK_LE; }\r\n      else if (cp->c == '<') { cp_get(cp); return CTOK_SHL; }\r\n      return '<';\r\n    case '>':\r\n      if (cp_get(cp) == '=') { cp_get(cp); return CTOK_GE; }\r\n      else if (cp->c == '>') { cp_get(cp); return CTOK_SHR; }\r\n      return '>';\r\n    case '-':\r\n      if (cp_get(cp) != '>') return '-'; cp_get(cp); return CTOK_DEREF;\r\n    case '$':\r\n      return cp_param(cp);\r\n    case '\\0': return CTOK_EOF;\r\n    default: { CPToken c = cp->c; cp_get(cp); return c; }\r\n    }\r\n  }\r\n}\r\n\r\nstatic LJ_NOINLINE CPToken cp_next(CPState *cp)\r\n{\r\n  return (cp->tok = cp_next_(cp));\r\n}\r\n\r\n/* -- C parser ------------------------------------------------------------ */\r\n\r\n/* Namespaces for resolving identifiers. */\r\n#define CPNS_DEFAULT \\\r\n  ((1u<<CT_KW)|(1u<<CT_TYPEDEF)|(1u<<CT_FUNC)|(1u<<CT_EXTERN)|(1u<<CT_CONSTVAL))\r\n#define CPNS_STRUCT\t((1u<<CT_KW)|(1u<<CT_STRUCT)|(1u<<CT_ENUM))\r\n\r\ntypedef CTypeID CPDeclIdx;\t/* Index into declaration stack. */\r\ntypedef uint32_t CPscl;\t\t/* Storage class flags. */\r\n\r\n/* Type declaration context. */\r\ntypedef struct CPDecl {\r\n  CPDeclIdx top;\t/* Top of declaration stack. */\r\n  CPDeclIdx pos;\t/* Insertion position in declaration chain. */\r\n  CPDeclIdx specpos;\t/* Saved position for declaration specifier. */\r\n  uint32_t mode;\t/* Declarator mode. */\r\n  CPState *cp;\t\t/* C parser state. */\r\n  GCstr *name;\t\t/* Name of declared identifier (if direct). */\r\n  GCstr *redir;\t\t/* Redirected symbol name. */\r\n  CTypeID nameid;\t/* Existing typedef for declared identifier. */\r\n  CTInfo attr;\t\t/* Attributes. */\r\n  CTInfo fattr;\t\t/* Function attributes. */\r\n  CTInfo specattr;\t/* Saved attributes. */\r\n  CTInfo specfattr;\t/* Saved function attributes. */\r\n  CTSize bits;\t\t/* Field size in bits (if any). */\r\n  CType stack[CPARSE_MAX_DECLSTACK];  /* Type declaration stack. */\r\n} CPDecl;\r\n\r\n/* Forward declarations. */\r\nstatic CPscl cp_decl_spec(CPState *cp, CPDecl *decl, CPscl scl);\r\nstatic void cp_declarator(CPState *cp, CPDecl *decl);\r\nstatic CTypeID cp_decl_abstract(CPState *cp);\r\n\r\n/* Initialize C parser state. Caller must set up: L, p, srcname, mode. */\r\nstatic void cp_init(CPState *cp)\r\n{\r\n  cp->linenumber = 1;\r\n  cp->depth = 0;\r\n  cp->curpack = 0;\r\n  cp->packstack[0] = 255;\r\n  lj_str_initbuf(&cp->sb);\r\n  lj_str_resizebuf(cp->L, &cp->sb, LJ_MIN_SBUF);\r\n  lua_assert(cp->p != NULL);\r\n  cp_get(cp);  /* Read-ahead first char. */\r\n  cp->tok = 0;\r\n  cp->tmask = CPNS_DEFAULT;\r\n  cp_next(cp);  /* Read-ahead first token. */\r\n}\r\n\r\n/* Cleanup C parser state. */\r\nstatic void cp_cleanup(CPState *cp)\r\n{\r\n  global_State *g = G(cp->L);\r\n  lj_str_freebuf(g, &cp->sb);\r\n}\r\n\r\n/* Check and consume optional token. */\r\nstatic int cp_opt(CPState *cp, CPToken tok)\r\n{\r\n  if (cp->tok == tok) { cp_next(cp); return 1; }\r\n  return 0;\r\n}\r\n\r\n/* Check and consume token. */\r\nstatic void cp_check(CPState *cp, CPToken tok)\r\n{\r\n  if (cp->tok != tok) cp_err_token(cp, tok);\r\n  cp_next(cp);\r\n}\r\n\r\n/* Check if the next token may start a type declaration. */\r\nstatic int cp_istypedecl(CPState *cp)\r\n{\r\n  if (cp->tok >= CTOK_FIRSTDECL && cp->tok <= CTOK_LASTDECL) return 1;\r\n  if (cp->tok == CTOK_IDENT && ctype_istypedef(cp->ct->info)) return 1;\r\n  if (cp->tok == '$') return 1;\r\n  return 0;\r\n}\r\n\r\n/* -- Constant expression evaluator --------------------------------------- */\r\n\r\n/* Forward declarations. */\r\nstatic void cp_expr_unary(CPState *cp, CPValue *k);\r\nstatic void cp_expr_sub(CPState *cp, CPValue *k, int pri);\r\n\r\n/* Please note that type handling is very weak here. Most ops simply\r\n** assume integer operands. Accessors are only needed to compute types and\r\n** return synthetic values. The only purpose of the expression evaluator\r\n** is to compute the values of constant expressions one would typically\r\n** find in C header files. And again: this is NOT a validating C parser!\r\n*/\r\n\r\n/* Parse comma separated expression and return last result. */\r\nstatic void cp_expr_comma(CPState *cp, CPValue *k)\r\n{\r\n  do { cp_expr_sub(cp, k, 0); } while (cp_opt(cp, ','));\r\n}\r\n\r\n/* Parse sizeof/alignof operator. */\r\nstatic void cp_expr_sizeof(CPState *cp, CPValue *k, int wantsz)\r\n{\r\n  CTSize sz;\r\n  CTInfo info;\r\n  if (cp_opt(cp, '(')) {\r\n    if (cp_istypedecl(cp))\r\n      k->id = cp_decl_abstract(cp);\r\n    else\r\n      cp_expr_comma(cp, k);\r\n    cp_check(cp, ')');\r\n  } else {\r\n    cp_expr_unary(cp, k);\r\n  }\r\n  info = lj_ctype_info(cp->cts, k->id, &sz);\r\n  if (wantsz) {\r\n    if (sz != CTSIZE_INVALID)\r\n      k->u32 = sz;\r\n    else if (k->id != CTID_A_CCHAR)  /* Special case for sizeof(\"string\"). */\r\n      cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n  } else {\r\n    k->u32 = 1u << ctype_align(info);\r\n  }\r\n  k->id = CTID_UINT32;  /* Really size_t. */\r\n}\r\n\r\n/* Parse prefix operators. */\r\nstatic void cp_expr_prefix(CPState *cp, CPValue *k)\r\n{\r\n  if (cp->tok == CTOK_INTEGER) {\r\n    *k = cp->val; cp_next(cp);\r\n  } else if (cp_opt(cp, '+')) {\r\n    cp_expr_unary(cp, k);  /* Nothing to do (well, integer promotion). */\r\n  } else if (cp_opt(cp, '-')) {\r\n    cp_expr_unary(cp, k); k->i32 = -k->i32;\r\n  } else if (cp_opt(cp, '~')) {\r\n    cp_expr_unary(cp, k); k->i32 = ~k->i32;\r\n  } else if (cp_opt(cp, '!')) {\r\n    cp_expr_unary(cp, k); k->i32 = !k->i32; k->id = CTID_INT32;\r\n  } else if (cp_opt(cp, '(')) {\r\n    if (cp_istypedecl(cp)) {  /* Cast operator. */\r\n      CTypeID id = cp_decl_abstract(cp);\r\n      cp_check(cp, ')');\r\n      cp_expr_unary(cp, k);\r\n      k->id = id;  /* No conversion performed. */\r\n    } else {  /* Sub-expression. */\r\n      cp_expr_comma(cp, k);\r\n      cp_check(cp, ')');\r\n    }\r\n  } else if (cp_opt(cp, '*')) {  /* Indirection. */\r\n    CType *ct;\r\n    cp_expr_unary(cp, k);\r\n    ct = lj_ctype_rawref(cp->cts, k->id);\r\n    if (!ctype_ispointer(ct->info))\r\n      cp_err_badidx(cp, ct);\r\n    k->u32 = 0; k->id = ctype_cid(ct->info);\r\n  } else if (cp_opt(cp, '&')) {  /* Address operator. */\r\n    cp_expr_unary(cp, k);\r\n    k->id = lj_ctype_intern(cp->cts, CTINFO(CT_PTR, CTALIGN_PTR+k->id),\r\n\t\t\t    CTSIZE_PTR);\r\n  } else if (cp_opt(cp, CTOK_SIZEOF)) {\r\n    cp_expr_sizeof(cp, k, 1);\r\n  } else if (cp_opt(cp, CTOK_ALIGNOF)) {\r\n    cp_expr_sizeof(cp, k, 0);\r\n  } else if (cp->tok == CTOK_IDENT) {\r\n    if (ctype_type(cp->ct->info) == CT_CONSTVAL) {\r\n      k->u32 = cp->ct->size; k->id = ctype_cid(cp->ct->info);\r\n    } else if (ctype_type(cp->ct->info) == CT_EXTERN) {\r\n      k->u32 = cp->val.id; k->id = ctype_cid(cp->ct->info);\r\n    } else if (ctype_type(cp->ct->info) == CT_FUNC) {\r\n      k->u32 = cp->val.id; k->id = cp->val.id;\r\n    } else {\r\n      goto err_expr;\r\n    }\r\n    cp_next(cp);\r\n  } else if (cp->tok == CTOK_STRING) {\r\n    CTSize sz = cp->str->len;\r\n    while (cp_next(cp) == CTOK_STRING)\r\n      sz += cp->str->len;\r\n    k->u32 = sz + 1;\r\n    k->id = CTID_A_CCHAR;\r\n  } else {\r\n  err_expr:\r\n    cp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n  }\r\n}\r\n\r\n/* Parse postfix operators. */\r\nstatic void cp_expr_postfix(CPState *cp, CPValue *k)\r\n{\r\n  for (;;) {\r\n    CType *ct;\r\n    if (cp_opt(cp, '[')) {  /* Array/pointer index. */\r\n      CPValue k2;\r\n      cp_expr_comma(cp, &k2);\r\n      ct = lj_ctype_rawref(cp->cts, k->id);\r\n      if (!ctype_ispointer(ct->info)) {\r\n\tct = lj_ctype_rawref(cp->cts, k2.id);\r\n\tif (!ctype_ispointer(ct->info))\r\n\t  cp_err_badidx(cp, ct);\r\n      }\r\n      cp_check(cp, ']');\r\n      k->u32 = 0;\r\n    } else if (cp->tok == '.' || cp->tok == CTOK_DEREF) {  /* Struct deref. */\r\n      CTSize ofs;\r\n      CType *fct;\r\n      ct = lj_ctype_rawref(cp->cts, k->id);\r\n      if (cp->tok == CTOK_DEREF) {\r\n\tif (!ctype_ispointer(ct->info))\r\n\t  cp_err_badidx(cp, ct);\r\n\tct = lj_ctype_rawref(cp->cts, ctype_cid(ct->info));\r\n      }\r\n      cp_next(cp);\r\n      if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n      if (!ctype_isstruct(ct->info) || ct->size == CTSIZE_INVALID ||\r\n\t  !(fct = lj_ctype_getfield(cp->cts, ct, cp->str, &ofs)) ||\r\n\t  ctype_isbitfield(fct->info)) {\r\n\tGCstr *s = lj_ctype_repr(cp->cts->L, ctype_typeid(cp->cts, ct), NULL);\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_BADMEMBER, strdata(s), strdata(cp->str));\r\n      }\r\n      ct = fct;\r\n      k->u32 = ctype_isconstval(ct->info) ? ct->size : 0;\r\n      cp_next(cp);\r\n    } else {\r\n      return;\r\n    }\r\n    k->id = ctype_cid(ct->info);\r\n  }\r\n}\r\n\r\n/* Parse infix operators. */\r\nstatic void cp_expr_infix(CPState *cp, CPValue *k, int pri)\r\n{\r\n  CPValue k2;\r\n  k2.u32 = 0; k2.id = 0;  /* Silence the compiler. */\r\n  for (;;) {\r\n    switch (pri) {\r\n    case 0:\r\n      if (cp_opt(cp, '?')) {\r\n\tCPValue k3;\r\n\tcp_expr_comma(cp, &k2);  /* Right-associative. */\r\n\tcp_check(cp, ':');\r\n\tcp_expr_sub(cp, &k3, 0);\r\n\tk->u32 = k->u32 ? k2.u32 : k3.u32;\r\n\tk->id = k2.id > k3.id ? k2.id : k3.id;\r\n\tcontinue;\r\n      }\r\n    case 1:\r\n      if (cp_opt(cp, CTOK_OROR)) {\r\n\tcp_expr_sub(cp, &k2, 2); k->i32 = k->u32 || k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 2:\r\n      if (cp_opt(cp, CTOK_ANDAND)) {\r\n\tcp_expr_sub(cp, &k2, 3); k->i32 = k->u32 && k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 3:\r\n      if (cp_opt(cp, '|')) {\r\n\tcp_expr_sub(cp, &k2, 4); k->u32 = k->u32 | k2.u32; goto arith_result;\r\n      }\r\n    case 4:\r\n      if (cp_opt(cp, '^')) {\r\n\tcp_expr_sub(cp, &k2, 5); k->u32 = k->u32 ^ k2.u32; goto arith_result;\r\n      }\r\n    case 5:\r\n      if (cp_opt(cp, '&')) {\r\n\tcp_expr_sub(cp, &k2, 6); k->u32 = k->u32 & k2.u32; goto arith_result;\r\n      }\r\n    case 6:\r\n      if (cp_opt(cp, CTOK_EQ)) {\r\n\tcp_expr_sub(cp, &k2, 7); k->i32 = k->u32 == k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_NE)) {\r\n\tcp_expr_sub(cp, &k2, 7); k->i32 = k->u32 != k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 7:\r\n      if (cp_opt(cp, '<')) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 < k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 < k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '>')) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 > k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 > k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_LE)) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 <= k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 <= k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_GE)) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 >= k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 >= k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 8:\r\n      if (cp_opt(cp, CTOK_SHL)) {\r\n\tcp_expr_sub(cp, &k2, 9); k->u32 = k->u32 << k2.u32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_SHR)) {\r\n\tcp_expr_sub(cp, &k2, 9);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 >> k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 >> k2.u32;\r\n\tcontinue;\r\n      }\r\n    case 9:\r\n      if (cp_opt(cp, '+')) {\r\n\tcp_expr_sub(cp, &k2, 10); k->u32 = k->u32 + k2.u32;\r\n      arith_result:\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '-')) {\r\n\tcp_expr_sub(cp, &k2, 10); k->u32 = k->u32 - k2.u32; goto arith_result;\r\n      }\r\n    case 10:\r\n      if (cp_opt(cp, '*')) {\r\n\tcp_expr_unary(cp, &k2); k->u32 = k->u32 * k2.u32; goto arith_result;\r\n      } else if (cp_opt(cp, '/')) {\r\n\tcp_expr_unary(cp, &k2);\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tif (k2.u32 == 0 ||\r\n\t    (k->id == CTID_INT32 && k->u32 == 0x80000000u && k2.i32 == -1))\r\n\t  cp_err(cp, LJ_ERR_BADVAL);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 / k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 / k2.u32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '%')) {\r\n\tcp_expr_unary(cp, &k2);\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tif (k2.u32 == 0 ||\r\n\t    (k->id == CTID_INT32 && k->u32 == 0x80000000u && k2.i32 == -1))\r\n\t  cp_err(cp, LJ_ERR_BADVAL);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 % k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 % k2.u32;\r\n\tcontinue;\r\n      }\r\n    default:\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\n/* Parse and evaluate unary expression. */\r\nstatic void cp_expr_unary(CPState *cp, CPValue *k)\r\n{\r\n  if (++cp->depth > CPARSE_MAX_DECLDEPTH) cp_err(cp, LJ_ERR_XLEVELS);\r\n  cp_expr_prefix(cp, k);\r\n  cp_expr_postfix(cp, k);\r\n  cp->depth--;\r\n}\r\n\r\n/* Parse and evaluate sub-expression. */\r\nstatic void cp_expr_sub(CPState *cp, CPValue *k, int pri)\r\n{\r\n  cp_expr_unary(cp, k);\r\n  cp_expr_infix(cp, k, pri);\r\n}\r\n\r\n/* Parse constant integer expression. */\r\nstatic void cp_expr_kint(CPState *cp, CPValue *k)\r\n{\r\n  CType *ct;\r\n  cp_expr_sub(cp, k, 0);\r\n  ct = ctype_raw(cp->cts, k->id);\r\n  if (!ctype_isinteger(ct->info)) cp_err(cp, LJ_ERR_BADVAL);\r\n}\r\n\r\n/* Parse (non-negative) size expression. */\r\nstatic CTSize cp_expr_ksize(CPState *cp)\r\n{\r\n  CPValue k;\r\n  cp_expr_kint(cp, &k);\r\n  if (k.u32 >= 0x80000000u) cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n  return k.u32;\r\n}\r\n\r\n/* -- Type declaration stack management ----------------------------------- */\r\n\r\n/* Add declaration element behind the insertion position. */\r\nstatic CPDeclIdx cp_add(CPDecl *decl, CTInfo info, CTSize size)\r\n{\r\n  CPDeclIdx top = decl->top;\r\n  if (top >= CPARSE_MAX_DECLSTACK) cp_err(decl->cp, LJ_ERR_XLEVELS);\r\n  decl->stack[top].info = info;\r\n  decl->stack[top].size = size;\r\n  decl->stack[top].sib = 0;\r\n  setgcrefnull(decl->stack[top].name);\r\n  decl->stack[top].next = decl->stack[decl->pos].next;\r\n  decl->stack[decl->pos].next = (CTypeID1)top;\r\n  decl->top = top+1;\r\n  return top;\r\n}\r\n\r\n/* Push declaration element before the insertion position. */\r\nstatic CPDeclIdx cp_push(CPDecl *decl, CTInfo info, CTSize size)\r\n{\r\n  return (decl->pos = cp_add(decl, info, size));\r\n}\r\n\r\n/* Push or merge attributes. */\r\nstatic void cp_push_attributes(CPDecl *decl)\r\n{\r\n  CType *ct = &decl->stack[decl->pos];\r\n  if (ctype_isfunc(ct->info)) {  /* Ok to modify in-place. */\r\n#if LJ_TARGET_X86\r\n    if ((decl->fattr & CTFP_CCONV))\r\n      ct->info = (ct->info & (CTMASK_NUM|CTF_VARARG|CTMASK_CID)) +\r\n\t\t (decl->fattr & ~CTMASK_CID);\r\n#endif\r\n  } else {\r\n    if ((decl->attr & CTFP_ALIGNED) && !(decl->mode & CPARSE_MODE_FIELD))\r\n      cp_push(decl, CTINFO(CT_ATTRIB, CTATTRIB(CTA_ALIGN)),\r\n\t      ctype_align(decl->attr));\r\n  }\r\n}\r\n\r\n/* Push unrolled type to declaration stack and merge qualifiers. */\r\nstatic void cp_push_type(CPDecl *decl, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(decl->cp->cts, id);\r\n  CTInfo info = ct->info;\r\n  CTSize size = ct->size;\r\n  switch (ctype_type(info)) {\r\n  case CT_STRUCT: case CT_ENUM:\r\n    cp_push(decl, CTINFO(CT_TYPEDEF, id), 0);  /* Don't copy unique types. */\r\n    if ((decl->attr & CTF_QUAL)) {  /* Push unmerged qualifiers. */\r\n      cp_push(decl, CTINFO(CT_ATTRIB, CTATTRIB(CTA_QUAL)),\r\n\t      (decl->attr & CTF_QUAL));\r\n      decl->attr &= ~CTF_QUAL;\r\n    }\r\n    break;\r\n  case CT_ATTRIB:\r\n    if (ctype_isxattrib(info, CTA_QUAL))\r\n      decl->attr &= ~size;  /* Remove redundant qualifiers. */\r\n    cp_push_type(decl, ctype_cid(info));  /* Unroll. */\r\n    cp_push(decl, info & ~CTMASK_CID, size);  /* Copy type. */\r\n    break;\r\n  case CT_ARRAY:\r\n    cp_push_type(decl, ctype_cid(info));  /* Unroll. */\r\n    cp_push(decl, info & ~CTMASK_CID, size);  /* Copy type. */\r\n    decl->stack[decl->pos].sib = 1;  /* Mark as already checked and sized. */\r\n    /* Note: this is not copied to the ct->sib in the C type table. */\r\n    break;\r\n  case CT_FUNC:\r\n    /* Copy type, link parameters (shared). */\r\n    decl->stack[cp_push(decl, info, size)].sib = ct->sib;\r\n    break;\r\n  default:\r\n    /* Copy type, merge common qualifiers. */\r\n    cp_push(decl, info|(decl->attr & CTF_QUAL), size);\r\n    decl->attr &= ~CTF_QUAL;\r\n    break;\r\n  }\r\n}\r\n\r\n/* Consume the declaration element chain and intern the C type. */\r\nstatic CTypeID cp_decl_intern(CPState *cp, CPDecl *decl)\r\n{\r\n  CTypeID id = 0;\r\n  CPDeclIdx idx = 0;\r\n  CTSize csize = CTSIZE_INVALID;\r\n  CTSize cinfo = 0;\r\n  do {\r\n    CType *ct = &decl->stack[idx];\r\n    CTInfo info = ct->info;\r\n    CTInfo size = ct->size;\r\n    /* The cid is already part of info for copies of pointers/functions. */\r\n    idx = ct->next;\r\n    if (ctype_istypedef(info)) {\r\n      lua_assert(id == 0);\r\n      id = ctype_cid(info);\r\n      /* Always refetch info/size, since struct/enum may have been completed. */\r\n      cinfo = ctype_get(cp->cts, id)->info;\r\n      csize = ctype_get(cp->cts, id)->size;\r\n      lua_assert(ctype_isstruct(cinfo) || ctype_isenum(cinfo));\r\n    } else if (ctype_isfunc(info)) {  /* Intern function. */\r\n      CType *fct;\r\n      CTypeID fid;\r\n      CTypeID sib;\r\n      if (id) {\r\n\tCType *refct = ctype_raw(cp->cts, id);\r\n\t/* Reject function or refarray return types. */\r\n\tif (ctype_isfunc(refct->info) || ctype_isrefarray(refct->info))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n      }\r\n      /* No intervening attributes allowed, skip forward. */\r\n      while (idx) {\r\n\tCType *ctn = &decl->stack[idx];\r\n\tif (!ctype_isattrib(ctn->info)) break;\r\n\tidx = ctn->next;  /* Skip attribute. */\r\n      }\r\n      sib = ct->sib;  /* Next line may reallocate the C type table. */\r\n      fid = lj_ctype_new(cp->cts, &fct);\r\n      csize = CTSIZE_INVALID;\r\n      fct->info = cinfo = info + id;\r\n      fct->size = size;\r\n      fct->sib = sib;\r\n      id = fid;\r\n    } else if (ctype_isattrib(info)) {\r\n      if (ctype_isxattrib(info, CTA_QUAL))\r\n\tcinfo |= size;\r\n      else if (ctype_isxattrib(info, CTA_ALIGN))\r\n\tCTF_INSERT(cinfo, ALIGN, size);\r\n      id = lj_ctype_intern(cp->cts, info+id, size);\r\n      /* Inherit csize/cinfo from original type. */\r\n    } else {\r\n      if (ctype_isnum(info)) {  /* Handle mode/vector-size attributes. */\r\n\tlua_assert(id == 0);\r\n\tif (!(info & CTF_BOOL)) {\r\n\t  CTSize msize = ctype_msizeP(decl->attr);\r\n\t  CTSize vsize = ctype_vsizeP(decl->attr);\r\n\t  if (msize && (!(info & CTF_FP) || (msize == 4 || msize == 8))) {\r\n\t    CTSize malign = lj_fls(msize);\r\n\t    if (malign > 4) malign = 4;  /* Limit alignment. */\r\n\t    CTF_INSERT(info, ALIGN, malign);\r\n\t    size = msize;  /* Override size via mode. */\r\n\t  }\r\n\t  if (vsize) {  /* Vector size set? */\r\n\t    CTSize esize = lj_fls(size);\r\n\t    if (vsize >= esize) {\r\n\t      /* Intern the element type first. */\r\n\t      id = lj_ctype_intern(cp->cts, info, size);\r\n\t      /* Then create a vector (array) with vsize alignment. */\r\n\t      size = (1u << vsize);\r\n\t      if (vsize > 4) vsize = 4;  /* Limit alignment. */\r\n\t      if (ctype_align(info) > vsize) vsize = ctype_align(info);\r\n\t      info = CTINFO(CT_ARRAY, (info & CTF_QUAL) + CTF_VECTOR +\r\n\t\t\t\t      CTALIGN(vsize));\r\n\t    }\r\n\t  }\r\n\t}\r\n      } else if (ctype_isptr(info)) {\r\n\t/* Reject pointer/ref to ref. */\r\n\tif (id && ctype_isref(ctype_raw(cp->cts, id)->info))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n\tif (ctype_isref(info)) {\r\n\t  info &= ~CTF_VOLATILE;  /* Refs are always const, never volatile. */\r\n\t  /* No intervening attributes allowed, skip forward. */\r\n\t  while (idx) {\r\n\t    CType *ctn = &decl->stack[idx];\r\n\t    if (!ctype_isattrib(ctn->info)) break;\r\n\t    idx = ctn->next;  /* Skip attribute. */\r\n\t  }\r\n\t}\r\n      } else if (ctype_isarray(info)) {  /* Check for valid array size etc. */\r\n\tif (ct->sib == 0) {  /* Only check/size arrays not copied by unroll. */\r\n\t  if (ctype_isref(cinfo))  /* Reject arrays of refs. */\r\n\t    cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n\t  /* Reject VLS or unknown-sized types. */\r\n\t  if (ctype_isvltype(cinfo) || csize == CTSIZE_INVALID)\r\n\t    cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\t  /* a[] and a[?] keep their invalid size. */\r\n\t  if (size != CTSIZE_INVALID) {\r\n\t    uint64_t xsz = (uint64_t)size * csize;\r\n\t    if (xsz >= 0x80000000u) cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\t    size = (CTSize)xsz;\r\n\t  }\r\n\t}\r\n\tif ((cinfo & CTF_ALIGN) > (info & CTF_ALIGN))  /* Find max. align. */\r\n\t  info = (info & ~CTF_ALIGN) | (cinfo & CTF_ALIGN);\r\n\tinfo |= (cinfo & CTF_QUAL);  /* Inherit qual. */\r\n      } else {\r\n\tlua_assert(ctype_isvoid(info));\r\n      }\r\n      csize = size;\r\n      cinfo = info+id;\r\n      id = lj_ctype_intern(cp->cts, info+id, size);\r\n    }\r\n  } while (idx);\r\n  return id;\r\n}\r\n\r\n/* -- C declaration parser ------------------------------------------------ */\r\n\r\n#define H_(le, be)\tLJ_ENDIAN_SELECT(0x##le, 0x##be)\r\n\r\n/* Reset declaration state to declaration specifier. */\r\nstatic void cp_decl_reset(CPDecl *decl)\r\n{\r\n  decl->pos = decl->specpos;\r\n  decl->top = decl->specpos+1;\r\n  decl->stack[decl->specpos].next = 0;\r\n  decl->attr = decl->specattr;\r\n  decl->fattr = decl->specfattr;\r\n  decl->name = NULL;\r\n  decl->redir = NULL;\r\n}\r\n\r\n/* Parse constant initializer. */\r\n/* NYI: FP constants and strings as initializers. */\r\nstatic CTypeID cp_decl_constinit(CPState *cp, CType **ctp, CTypeID ctypeid)\r\n{\r\n  CType *ctt = ctype_get(cp->cts, ctypeid);\r\n  CTInfo info;\r\n  CTSize size;\r\n  CPValue k;\r\n  CTypeID constid;\r\n  while (ctype_isattrib(ctt->info)) {  /* Skip attributes. */\r\n    ctypeid = ctype_cid(ctt->info);  /* Update ID, too. */\r\n    ctt = ctype_get(cp->cts, ctypeid);\r\n  }\r\n  info = ctt->info;\r\n  size = ctt->size;\r\n  if (!ctype_isinteger(info) || !(info & CTF_CONST) || size > 4)\r\n    cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n  cp_check(cp, '=');\r\n  cp_expr_sub(cp, &k, 0);\r\n  constid = lj_ctype_new(cp->cts, ctp);\r\n  (*ctp)->info = CTINFO(CT_CONSTVAL, CTF_CONST|ctypeid);\r\n  k.u32 <<= 8*(4-size);\r\n  if ((info & CTF_UNSIGNED))\r\n    k.u32 >>= 8*(4-size);\r\n  else\r\n    k.u32 = (uint32_t)((int32_t)k.u32 >> 8*(4-size));\r\n  (*ctp)->size = k.u32;\r\n  return constid;\r\n}\r\n\r\n/* Parse size in parentheses as part of attribute. */\r\nstatic CTSize cp_decl_sizeattr(CPState *cp)\r\n{\r\n  CTSize sz;\r\n  uint32_t oldtmask = cp->tmask;\r\n  cp->tmask = CPNS_DEFAULT;  /* Required for expression evaluator. */\r\n  cp_check(cp, '(');\r\n  sz = cp_expr_ksize(cp);\r\n  cp->tmask = oldtmask;\r\n  cp_check(cp, ')');\r\n  return sz;\r\n}\r\n\r\n/* Parse alignment attribute. */\r\nstatic void cp_decl_align(CPState *cp, CPDecl *decl)\r\n{\r\n  CTSize al = 4;  /* Unspecified alignment is 16 bytes. */\r\n  if (cp->tok == '(') {\r\n    al = cp_decl_sizeattr(cp);\r\n    al = al ? lj_fls(al) : 0;\r\n  }\r\n  CTF_INSERT(decl->attr, ALIGN, al);\r\n  decl->attr |= CTFP_ALIGNED;\r\n}\r\n\r\n/* Parse GCC asm(\"name\") redirect. */\r\nstatic void cp_decl_asm(CPState *cp, CPDecl *decl)\r\n{\r\n  UNUSED(decl);\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  if (cp->tok == CTOK_STRING) {\r\n    GCstr *str = cp->str;\r\n    while (cp_next(cp) == CTOK_STRING) {\r\n      lj_str_pushf(cp->L, \"%s%s\", strdata(str), strdata(cp->str));\r\n      cp->L->top--;\r\n      str = strV(cp->L->top);\r\n    }\r\n    decl->redir = str;\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse GCC __attribute__((mode(...))). */\r\nstatic void cp_decl_mode(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_check(cp, '(');\r\n  if (cp->tok == CTOK_IDENT) {\r\n    const char *s = strdata(cp->str);\r\n    CTSize sz = 0, vlen = 0;\r\n    if (s[0] == '_' && s[1] == '_') s += 2;\r\n    if (*s == 'V') {\r\n      s++;\r\n      vlen = *s++ - '0';\r\n      if (*s >= '0' && *s <= '9')\r\n\tvlen = vlen*10 + (*s++ - '0');\r\n    }\r\n    switch (*s++) {\r\n    case 'Q': sz = 1; break;\r\n    case 'H': sz = 2; break;\r\n    case 'S': sz = 4; break;\r\n    case 'D': sz = 8; break;\r\n    case 'T': sz = 16; break;\r\n    case 'O': sz = 32; break;\r\n    default: goto bad_size;\r\n    }\r\n    if (*s == 'I' || *s == 'F') {\r\n      CTF_INSERT(decl->attr, MSIZEP, sz);\r\n      if (vlen) CTF_INSERT(decl->attr, VSIZEP, lj_fls(vlen*sz));\r\n    }\r\n  bad_size:\r\n    cp_next(cp);\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse GCC __attribute__((...)). */\r\nstatic void cp_decl_gccattribute(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  cp_check(cp, '(');\r\n  while (cp->tok != ')') {\r\n    if (cp->tok == CTOK_IDENT) {\r\n      GCstr *attrstr = cp->str;\r\n      cp_next(cp);\r\n      switch (attrstr->hash) {\r\n      case H_(64a9208e,8ce14319): case H_(8e6331b2,95a282af):  /* aligned */\r\n\tcp_decl_align(cp, decl);\r\n\tbreak;\r\n      case H_(42eb47de,f0ede26c): case H_(29f48a09,cf383e0c):  /* packed */\r\n\tdecl->attr |= CTFP_PACKED;\r\n\tbreak;\r\n      case H_(0a84eef6,8dfab04c): case H_(995cf92c,d5696591):  /* mode */\r\n\tcp_decl_mode(cp, decl);\r\n\tbreak;\r\n      case H_(0ab31997,2d5213fa): case H_(bf875611,200e9990):  /* vector_size */\r\n\t{\r\n\t  CTSize vsize = cp_decl_sizeattr(cp);\r\n\t  if (vsize) CTF_INSERT(decl->attr, VSIZEP, lj_fls(vsize));\r\n\t}\r\n\tbreak;\r\n#if LJ_TARGET_X86\r\n      case H_(5ad22db8,c689b848): case H_(439150fa,65ea78cb):  /* regparm */\r\n\tCTF_INSERT(decl->fattr, REGPARM, cp_decl_sizeattr(cp));\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(18fc0b98,7ff4c074): case H_(4e62abed,0a747424):  /* cdecl */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_CDECL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(72b2e41b,494c5a44): case H_(f2356d59,f25fc9bd):  /* thiscall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_THISCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(0d0ffc42,ab746f88): case H_(21c54ba1,7f0ca7e3):  /* fastcall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_FASTCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(ef76b040,9412e06a): case H_(de56697b,c750e6e1):  /* stdcall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_STDCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(ea78b622,f234bd8e): case H_(252ffb06,8d50f34b):  /* sseregparm */\r\n\tdecl->fattr |= CTF_SSEREGPARM;\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n#endif\r\n      default:  /* Skip all other attributes. */\r\n\tgoto skip_attr;\r\n      }\r\n    } else if (cp->tok >= CTOK_FIRSTDECL) {  /* For __attribute((const)) etc. */\r\n      cp_next(cp);\r\n    skip_attr:\r\n      if (cp_opt(cp, '(')) {\r\n\twhile (cp->tok != ')' && cp->tok != CTOK_EOF) cp_next(cp);\r\n\tcp_check(cp, ')');\r\n      }\r\n    } else {\r\n      break;\r\n    }\r\n    if (!cp_opt(cp, ',')) break;\r\n  }\r\n  cp_check(cp, ')');\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse MSVC __declspec(...). */\r\nstatic void cp_decl_msvcattribute(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  while (cp->tok == CTOK_IDENT) {\r\n    GCstr *attrstr = cp->str;\r\n    cp_next(cp);\r\n    switch (attrstr->hash) {\r\n    case H_(bc2395fa,98f267f8):  /* align */\r\n      cp_decl_align(cp, decl);\r\n      break;\r\n    default:  /* Ignore all other attributes. */\r\n      if (cp_opt(cp, '(')) {\r\n\twhile (cp->tok != ')' && cp->tok != CTOK_EOF) cp_next(cp);\r\n\tcp_check(cp, ')');\r\n      }\r\n      break;\r\n    }\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse declaration attributes (and common qualifiers). */\r\nstatic void cp_decl_attributes(CPState *cp, CPDecl *decl)\r\n{\r\n  for (;;) {\r\n    switch (cp->tok) {\r\n    case CTOK_CONST: decl->attr |= CTF_CONST; break;\r\n    case CTOK_VOLATILE: decl->attr |= CTF_VOLATILE; break;\r\n    case CTOK_RESTRICT: break;  /* Ignore. */\r\n    case CTOK_EXTENSION: break;  /* Ignore. */\r\n    case CTOK_ATTRIBUTE: cp_decl_gccattribute(cp, decl); continue;\r\n    case CTOK_ASM: cp_decl_asm(cp, decl); continue;\r\n    case CTOK_DECLSPEC: cp_decl_msvcattribute(cp, decl); continue;\r\n    case CTOK_CCDECL:\r\n#if LJ_TARGET_X86\r\n      CTF_INSERT(decl->fattr, CCONV, cp->ct->size);\r\n      decl->fattr |= CTFP_CCONV;\r\n#endif\r\n      break;\r\n    case CTOK_PTRSZ:\r\n#if LJ_64\r\n      CTF_INSERT(decl->attr, MSIZEP, cp->ct->size);\r\n#endif\r\n      break;\r\n    default: return;\r\n    }\r\n    cp_next(cp);\r\n  }\r\n}\r\n\r\n/* Parse struct/union/enum name. */\r\nstatic CTypeID cp_struct_name(CPState *cp, CPDecl *sdecl, CTInfo info)\r\n{\r\n  CTypeID sid;\r\n  CType *ct;\r\n  cp->tmask = CPNS_STRUCT;\r\n  cp_next(cp);\r\n  cp_decl_attributes(cp, sdecl);\r\n  cp->tmask = CPNS_DEFAULT;\r\n  if (cp->tok != '{') {\r\n    if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n    if (cp->val.id) {  /* Name of existing struct/union/enum. */\r\n      sid = cp->val.id;\r\n      ct = cp->ct;\r\n      if ((ct->info ^ info) & (CTMASK_NUM|CTF_UNION))  /* Wrong type. */\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(gco2str(gcref(ct->name))));\r\n    } else {  /* Create named, incomplete struct/union/enum. */\r\n      if ((cp->mode & CPARSE_MODE_NOIMPLICIT))\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_BADTAG, strdata(cp->str));\r\n      sid = lj_ctype_new(cp->cts, &ct);\r\n      ct->info = info;\r\n      ct->size = CTSIZE_INVALID;\r\n      ctype_setname(ct, cp->str);\r\n      lj_ctype_addname(cp->cts, ct, sid);\r\n    }\r\n    cp_next(cp);\r\n  } else {  /* Create anonymous, incomplete struct/union/enum. */\r\n    sid = lj_ctype_new(cp->cts, &ct);\r\n    ct->info = info;\r\n    ct->size = CTSIZE_INVALID;\r\n  }\r\n  if (cp->tok == '{') {\r\n    if (ct->size != CTSIZE_INVALID || ct->sib)\r\n      cp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(gco2str(gcref(ct->name))));\r\n    ct->sib = 1;  /* Indicate the type is currently being defined. */\r\n  }\r\n  return sid;\r\n}\r\n\r\n/* Determine field alignment. */\r\nstatic CTSize cp_field_align(CPState *cp, CType *ct, CTInfo info)\r\n{\r\n  CTSize align = ctype_align(info);\r\n  UNUSED(cp); UNUSED(ct);\r\n#if (LJ_TARGET_X86 && !LJ_ABI_WIN) || (LJ_TARGET_ARM && __APPLE__)\r\n  /* The SYSV i386 and iOS ABIs limit alignment of non-vector fields to 2^2. */\r\n  if (align > 2 && !(info & CTFP_ALIGNED)) {\r\n    if (ctype_isarray(info) && !(info & CTF_VECTOR)) {\r\n      do {\r\n\tct = ctype_rawchild(cp->cts, ct);\r\n\tinfo = ct->info;\r\n      } while (ctype_isarray(info) && !(info & CTF_VECTOR));\r\n    }\r\n    if (ctype_isnum(info) || ctype_isenum(info))\r\n      align = 2;\r\n  }\r\n#endif\r\n  return align;\r\n}\r\n\r\n/* Layout struct/union fields. */\r\nstatic void cp_struct_layout(CPState *cp, CTypeID sid, CTInfo sattr)\r\n{\r\n  CTSize bofs = 0, bmaxofs = 0;  /* Bit offset and max. bit offset. */\r\n  CTSize maxalign = ctype_align(sattr);\r\n  CType *sct = ctype_get(cp->cts, sid);\r\n  CTInfo sinfo = sct->info;\r\n  CTypeID fieldid = sct->sib;\r\n  while (fieldid) {\r\n    CType *ct = ctype_get(cp->cts, fieldid);\r\n    CTInfo attr = ct->size;  /* Field declaration attributes (temp.). */\r\n\r\n    if (ctype_isfield(ct->info) ||\r\n\t(ctype_isxattrib(ct->info, CTA_SUBTYPE) && attr)) {\r\n      CTSize align, amask;  /* Alignment (pow2) and alignment mask (bits). */\r\n      CTSize sz;\r\n      CTInfo info = lj_ctype_info(cp->cts, ctype_cid(ct->info), &sz);\r\n      CTSize bsz, csz = 8*sz;  /* Field size and container size (in bits). */\r\n      sinfo |= (info & (CTF_QUAL|CTF_VLA));  /* Merge pseudo-qualifiers. */\r\n\r\n      /* Check for size overflow and determine alignment. */\r\n      if (sz >= 0x20000000u || bofs + csz < bofs || (info & CTF_VLA)) {\r\n\tif (!(sz == CTSIZE_INVALID && ctype_isarray(info) &&\r\n\t      !(sinfo & CTF_UNION)))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\tcsz = sz = 0;  /* Treat a[] and a[?] as zero-sized. */\r\n      }\r\n      align = cp_field_align(cp, ct, info);\r\n      if (((attr|sattr) & CTFP_PACKED) ||\r\n\t  ((attr & CTFP_ALIGNED) && ctype_align(attr) > align))\r\n\talign = ctype_align(attr);\r\n      if (cp->packstack[cp->curpack] < align)\r\n\talign = cp->packstack[cp->curpack];\r\n      if (align > maxalign) maxalign = align;\r\n      amask = (8u << align) - 1;\r\n\r\n      bsz = ctype_bitcsz(ct->info);  /* Bitfield size (temp.). */\r\n      if (bsz == CTBSZ_FIELD || !ctype_isfield(ct->info)) {\r\n\tbsz = csz;  /* Regular fields or subtypes always fill the container. */\r\n\tbofs = (bofs + amask) & ~amask;  /* Start new aligned field. */\r\n\tct->size = (bofs >> 3);  /* Store field offset. */\r\n      } else {  /* Bitfield. */\r\n\tif (bsz == 0 || (attr & CTFP_ALIGNED) ||\r\n\t    (!((attr|sattr) & CTFP_PACKED) && (bofs & amask) + bsz > csz))\r\n\t  bofs = (bofs + amask) & ~amask;  /* Start new aligned field. */\r\n\r\n\t/* Prefer regular field over bitfield. */\r\n\tif (bsz == csz && (bofs & amask) == 0) {\r\n\t  ct->info = CTINFO(CT_FIELD, ctype_cid(ct->info));\r\n\t  ct->size = (bofs >> 3);  /* Store field offset. */\r\n\t} else {\r\n\t  ct->info = CTINFO(CT_BITFIELD,\r\n\t    (info & (CTF_QUAL|CTF_UNSIGNED|CTF_BOOL)) +\r\n\t    (csz << (CTSHIFT_BITCSZ-3)) + (bsz << CTSHIFT_BITBSZ));\r\n#if LJ_BE\r\n\t  ct->info += ((csz - (bofs & (csz-1)) - bsz) << CTSHIFT_BITPOS);\r\n#else\r\n\t  ct->info += ((bofs & (csz-1)) << CTSHIFT_BITPOS);\r\n#endif\r\n\t  ct->size = ((bofs & ~(csz-1)) >> 3);  /* Store container offset. */\r\n\t}\r\n      }\r\n\r\n      /* Determine next offset or max. offset. */\r\n      if ((sinfo & CTF_UNION)) {\r\n\tif (bsz > bmaxofs) bmaxofs = bsz;\r\n      } else {\r\n\tbofs += bsz;\r\n      }\r\n    }  /* All other fields in the chain are already set up. */\r\n\r\n    fieldid = ct->sib;\r\n  }\r\n\r\n  /* Complete struct/union. */\r\n  sct->info = sinfo + CTALIGN(maxalign);\r\n  bofs = (sinfo & CTF_UNION) ? bmaxofs : bofs;\r\n  maxalign = (8u << maxalign) - 1;\r\n  sct->size = (((bofs + maxalign) & ~maxalign) >> 3);\r\n}\r\n\r\n/* Parse struct/union declaration. */\r\nstatic CTypeID cp_decl_struct(CPState *cp, CPDecl *sdecl, CTInfo sinfo)\r\n{\r\n  CTypeID sid = cp_struct_name(cp, sdecl, sinfo);\r\n  if (cp_opt(cp, '{')) {  /* Struct/union definition. */\r\n    CTypeID lastid = sid;\r\n    int lastdecl = 0;\r\n    while (cp->tok != '}') {\r\n      CPDecl decl;\r\n      CPscl scl = cp_decl_spec(cp, &decl, CDF_STATIC);\r\n      decl.mode = scl ? CPARSE_MODE_DIRECT :\r\n\tCPARSE_MODE_DIRECT|CPARSE_MODE_ABSTRACT|CPARSE_MODE_FIELD;\r\n\r\n      for (;;) {\r\n\tCTypeID ctypeid;\r\n\r\n\tif (lastdecl) cp_err_token(cp, '}');\r\n\r\n\t/* Parse field declarator. */\r\n\tdecl.bits = CTSIZE_INVALID;\r\n\tcp_declarator(cp, &decl);\r\n\tctypeid = cp_decl_intern(cp, &decl);\r\n\r\n\tif ((scl & CDF_STATIC)) {  /* Static constant in struct namespace. */\r\n\t  CType *ct;\r\n\t  CTypeID fieldid = cp_decl_constinit(cp, &ct, ctypeid);\r\n\t  ctype_get(cp->cts, lastid)->sib = fieldid;\r\n\t  lastid = fieldid;\r\n\t  ctype_setname(ct, decl.name);\r\n\t} else {\r\n\t  CTSize bsz = CTBSZ_FIELD;  /* Temp. for layout phase. */\r\n\t  CType *ct;\r\n\t  CTypeID fieldid = lj_ctype_new(cp->cts, &ct);  /* Do this first. */\r\n\t  CType *tct = ctype_raw(cp->cts, ctypeid);\r\n\r\n\t  if (decl.bits == CTSIZE_INVALID) {  /* Regular field. */\r\n\t    if (ctype_isarray(tct->info) && tct->size == CTSIZE_INVALID)\r\n\t      lastdecl = 1;  /* a[] or a[?] must be the last declared field. */\r\n\r\n\t    /* Accept transparent struct/union/enum. */\r\n\t    if (!decl.name) {\r\n\t      if (!((ctype_isstruct(tct->info) && !(tct->info & CTF_VLA)) ||\r\n\t\t    ctype_isenum(tct->info)))\r\n\t\tcp_err_token(cp, CTOK_IDENT);\r\n\t      ct->info = CTINFO(CT_ATTRIB, CTATTRIB(CTA_SUBTYPE) + ctypeid);\r\n\t      ct->size = ctype_isstruct(tct->info) ?\r\n\t\t\t (decl.attr|0x80000000u) : 0;  /* For layout phase. */\r\n\t      goto add_field;\r\n\t    }\r\n\t  } else {  /* Bitfield. */\r\n\t    bsz = decl.bits;\r\n\t    if (!ctype_isinteger_or_bool(tct->info) ||\r\n\t\t(bsz == 0 && decl.name) || 8*tct->size > CTBSZ_MAX ||\r\n\t\tbsz > ((tct->info & CTF_BOOL) ? 1 : 8*tct->size))\r\n\t      cp_errmsg(cp, ':', LJ_ERR_BADVAL);\r\n\t  }\r\n\r\n\t  /* Create temporary field for layout phase. */\r\n\t  ct->info = CTINFO(CT_FIELD, ctypeid + (bsz << CTSHIFT_BITCSZ));\r\n\t  ct->size = decl.attr;\r\n\t  if (decl.name) ctype_setname(ct, decl.name);\r\n\r\n\tadd_field:\r\n\t  ctype_get(cp->cts, lastid)->sib = fieldid;\r\n\t  lastid = fieldid;\r\n\t}\r\n\tif (!cp_opt(cp, ',')) break;\r\n\tcp_decl_reset(&decl);\r\n      }\r\n      cp_check(cp, ';');\r\n    }\r\n    cp_check(cp, '}');\r\n    ctype_get(cp->cts, lastid)->sib = 0;  /* Drop sib = 1 for empty structs. */\r\n    cp_decl_attributes(cp, sdecl);  /* Layout phase needs postfix attributes. */\r\n    cp_struct_layout(cp, sid, sdecl->attr);\r\n  }\r\n  return sid;\r\n}\r\n\r\n/* Parse enum declaration. */\r\nstatic CTypeID cp_decl_enum(CPState *cp, CPDecl *sdecl)\r\n{\r\n  CTypeID eid = cp_struct_name(cp, sdecl, CTINFO(CT_ENUM, CTID_VOID));\r\n  CTInfo einfo = CTINFO(CT_ENUM, CTALIGN(2) + CTID_UINT32);\r\n  CTSize esize = 4;  /* Only 32 bit enums are supported. */\r\n  if (cp_opt(cp, '{')) {  /* Enum definition. */\r\n    CPValue k;\r\n    CTypeID lastid = eid;\r\n    k.u32 = 0;\r\n    k.id = CTID_INT32;\r\n    do {\r\n      GCstr *name = cp->str;\r\n      if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n      if (cp->val.id) cp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(name));\r\n      cp_next(cp);\r\n      if (cp_opt(cp, '=')) {\r\n\tcp_expr_kint(cp, &k);\r\n\tif (k.id == CTID_UINT32) {\r\n\t  /* C99 says that enum constants are always (signed) integers.\r\n\t  ** But since unsigned constants like 0x80000000 are quite common,\r\n\t  ** those are left as uint32_t.\r\n\t  */\r\n\t  if (k.i32 >= 0) k.id = CTID_INT32;\r\n\t} else {\r\n\t  /* OTOH it's common practice and even mandated by some ABIs\r\n\t  ** that the enum type itself is unsigned, unless there are any\r\n\t  ** negative constants.\r\n\t  */\r\n\t  k.id = CTID_INT32;\r\n\t  if (k.i32 < 0) einfo = CTINFO(CT_ENUM, CTALIGN(2) + CTID_INT32);\r\n\t}\r\n      }\r\n      /* Add named enum constant. */\r\n      {\r\n\tCType *ct;\r\n\tCTypeID constid = lj_ctype_new(cp->cts, &ct);\r\n\tctype_get(cp->cts, lastid)->sib = constid;\r\n\tlastid = constid;\r\n\tctype_setname(ct, name);\r\n\tct->info = CTINFO(CT_CONSTVAL, CTF_CONST|k.id);\r\n\tct->size = k.u32++;\r\n\tif (k.u32 == 0x80000000u) k.id = CTID_UINT32;\r\n\tlj_ctype_addname(cp->cts, ct, constid);\r\n      }\r\n      if (!cp_opt(cp, ',')) break;\r\n    } while (cp->tok != '}');  /* Trailing ',' is ok. */\r\n    cp_check(cp, '}');\r\n    /* Complete enum. */\r\n    ctype_get(cp->cts, eid)->info = einfo;\r\n    ctype_get(cp->cts, eid)->size = esize;\r\n  }\r\n  return eid;\r\n}\r\n\r\n/* Parse declaration specifiers. */\r\nstatic CPscl cp_decl_spec(CPState *cp, CPDecl *decl, CPscl scl)\r\n{\r\n  uint32_t cds = 0, sz = 0;\r\n  CTypeID tdef = 0;\r\n\r\n  decl->cp = cp;\r\n  decl->mode = cp->mode;\r\n  decl->name = NULL;\r\n  decl->redir = NULL;\r\n  decl->attr = 0;\r\n  decl->fattr = 0;\r\n  decl->pos = decl->top = 0;\r\n  decl->stack[0].next = 0;\r\n\r\n  for (;;) {  /* Parse basic types. */\r\n    cp_decl_attributes(cp, decl);\r\n    if (cp->tok >= CTOK_FIRSTDECL && cp->tok <= CTOK_LASTDECLFLAG) {\r\n      uint32_t cbit;\r\n      if (cp->ct->size) {\r\n\tif (sz) goto end_decl;\r\n\tsz = cp->ct->size;\r\n      }\r\n      cbit = (1u << (cp->tok - CTOK_FIRSTDECL));\r\n      cds = cds | cbit | ((cbit & cds & CDF_LONG) << 1);\r\n      if (cp->tok >= CTOK_FIRSTSCL) {\r\n\tif (!(scl & cbit)) cp_errmsg(cp, cp->tok, LJ_ERR_FFI_BADSCL);\r\n      } else if (tdef) {\r\n\tgoto end_decl;\r\n      }\r\n      cp_next(cp);\r\n      continue;\r\n    }\r\n    if (sz || tdef ||\r\n\t(cds & (CDF_SHORT|CDF_LONG|CDF_SIGNED|CDF_UNSIGNED|CDF_COMPLEX)))\r\n      break;\r\n    switch (cp->tok) {\r\n    case CTOK_STRUCT:\r\n      tdef = cp_decl_struct(cp, decl, CTINFO(CT_STRUCT, 0));\r\n      continue;\r\n    case CTOK_UNION:\r\n      tdef = cp_decl_struct(cp, decl, CTINFO(CT_STRUCT, CTF_UNION));\r\n      continue;\r\n    case CTOK_ENUM:\r\n      tdef = cp_decl_enum(cp, decl);\r\n      continue;\r\n    case CTOK_IDENT:\r\n      if (ctype_istypedef(cp->ct->info)) {\r\n\ttdef = ctype_cid(cp->ct->info);  /* Get typedef. */\r\n\tcp_next(cp);\r\n\tcontinue;\r\n      }\r\n      break;\r\n    case '$':\r\n      tdef = cp->val.id;\r\n      cp_next(cp);\r\n      continue;\r\n    default:\r\n      break;\r\n    }\r\n    break;\r\n  }\r\nend_decl:\r\n\r\n  if ((cds & CDF_COMPLEX))  /* Use predefined complex types. */\r\n    tdef = sz == 4 ? CTID_COMPLEX_FLOAT : CTID_COMPLEX_DOUBLE;\r\n\r\n  if (tdef) {\r\n    cp_push_type(decl, tdef);\r\n  } else if ((cds & CDF_VOID)) {\r\n    cp_push(decl, CTINFO(CT_VOID, (decl->attr & CTF_QUAL)), CTSIZE_INVALID);\r\n    decl->attr &= ~CTF_QUAL;\r\n  } else {\r\n    /* Determine type info and size. */\r\n    CTInfo info = CTINFO(CT_NUM, (cds & CDF_UNSIGNED) ? CTF_UNSIGNED : 0);\r\n    if ((cds & CDF_BOOL)) {\r\n      if ((cds & ~(CDF_SCL|CDF_BOOL|CDF_INT|CDF_SIGNED|CDF_UNSIGNED)))\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_INVTYPE);\r\n      info |= CTF_BOOL;\r\n      if (!(cds & CDF_SIGNED)) info |= CTF_UNSIGNED;\r\n      if (!sz) {\r\n\tsz = 1;\r\n      }\r\n    } else if ((cds & CDF_FP)) {\r\n      info = CTINFO(CT_NUM, CTF_FP);\r\n      if ((cds & CDF_LONG)) sz = sizeof(long double);\r\n    } else if ((cds & CDF_CHAR)) {\r\n      if ((cds & (CDF_CHAR|CDF_SIGNED|CDF_UNSIGNED)) == CDF_CHAR)\r\n\tinfo |= CTF_UCHAR;  /* Handle platforms where char is unsigned. */\r\n    } else if ((cds & CDF_SHORT)) {\r\n      sz = sizeof(short);\r\n    } else if ((cds & CDF_LONGLONG)) {\r\n      sz = 8;\r\n    } else if ((cds & CDF_LONG)) {\r\n      info |= CTF_LONG;\r\n      sz = sizeof(long);\r\n    } else if (!sz) {\r\n      if (!(cds & (CDF_SIGNED|CDF_UNSIGNED)))\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_FFI_DECLSPEC);\r\n      sz = sizeof(int);\r\n    }\r\n    lua_assert(sz != 0);\r\n    info += CTALIGN(lj_fls(sz));  /* Use natural alignment. */\r\n    info += (decl->attr & CTF_QUAL);  /* Merge qualifiers. */\r\n    cp_push(decl, info, sz);\r\n    decl->attr &= ~CTF_QUAL;\r\n  }\r\n  decl->specpos = decl->pos;\r\n  decl->specattr = decl->attr;\r\n  decl->specfattr = decl->fattr;\r\n  return (cds & CDF_SCL);  /* Return storage class. */\r\n}\r\n\r\n/* Parse array declaration. */\r\nstatic void cp_decl_array(CPState *cp, CPDecl *decl)\r\n{\r\n  CTInfo info = CTINFO(CT_ARRAY, 0);\r\n  CTSize nelem = CTSIZE_INVALID;  /* Default size for a[] or a[?]. */\r\n  cp_decl_attributes(cp, decl);\r\n  if (cp_opt(cp, '?'))\r\n    info |= CTF_VLA;  /* Create variable-length array a[?]. */\r\n  else if (cp->tok != ']')\r\n    nelem = cp_expr_ksize(cp);\r\n  cp_check(cp, ']');\r\n  cp_add(decl, info, nelem);\r\n}\r\n\r\n/* Parse function declaration. */\r\nstatic void cp_decl_func(CPState *cp, CPDecl *fdecl)\r\n{\r\n  CTSize nargs = 0;\r\n  CTInfo info = CTINFO(CT_FUNC, 0);\r\n  CTypeID lastid = 0, anchor = 0;\r\n  if (cp->tok != ')') {\r\n    do {\r\n      CPDecl decl;\r\n      CTypeID ctypeid, fieldid;\r\n      CType *ct;\r\n      if (cp_opt(cp, '.')) {  /* Vararg function. */\r\n\tcp_check(cp, '.');  /* Workaround for the minimalistic lexer. */\r\n\tcp_check(cp, '.');\r\n\tinfo |= CTF_VARARG;\r\n\tbreak;\r\n      }\r\n      cp_decl_spec(cp, &decl, CDF_REGISTER);\r\n      decl.mode = CPARSE_MODE_DIRECT|CPARSE_MODE_ABSTRACT;\r\n      cp_declarator(cp, &decl);\r\n      ctypeid = cp_decl_intern(cp, &decl);\r\n      ct = ctype_raw(cp->cts, ctypeid);\r\n      if (ctype_isvoid(ct->info))\r\n\tbreak;\r\n      else if (ctype_isrefarray(ct->info))\r\n\tctypeid = lj_ctype_intern(cp->cts,\r\n\t  CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ct->info)), CTSIZE_PTR);\r\n      else if (ctype_isfunc(ct->info))\r\n\tctypeid = lj_ctype_intern(cp->cts,\r\n\t  CTINFO(CT_PTR, CTALIGN_PTR|ctypeid), CTSIZE_PTR);\r\n      /* Add new parameter. */\r\n      fieldid = lj_ctype_new(cp->cts, &ct);\r\n      if (anchor)\r\n\tctype_get(cp->cts, lastid)->sib = fieldid;\r\n      else\r\n\tanchor = fieldid;\r\n      lastid = fieldid;\r\n      if (decl.name) ctype_setname(ct, decl.name);\r\n      ct->info = CTINFO(CT_FIELD, ctypeid);\r\n      ct->size = nargs++;\r\n    } while (cp_opt(cp, ','));\r\n  }\r\n  cp_check(cp, ')');\r\n  if (cp_opt(cp, '{')) {  /* Skip function definition. */\r\n    int level = 1;\r\n    cp->mode |= CPARSE_MODE_SKIP;\r\n    for (;;) {\r\n      if (cp->tok == '{') level++;\r\n      else if (cp->tok == '}' && --level == 0) break;\r\n      else if (cp->tok == CTOK_EOF) cp_err_token(cp, '}');\r\n      cp_next(cp);\r\n    }\r\n    cp->mode &= ~CPARSE_MODE_SKIP;\r\n    cp->tok = ';';  /* Ok for cp_decl_multi(), error in cp_decl_single(). */\r\n  }\r\n  info |= (fdecl->fattr & ~CTMASK_CID);\r\n  fdecl->fattr = 0;\r\n  fdecl->stack[cp_add(fdecl, info, nargs)].sib = anchor;\r\n}\r\n\r\n/* Parse declarator. */\r\nstatic void cp_declarator(CPState *cp, CPDecl *decl)\r\n{\r\n  if (++cp->depth > CPARSE_MAX_DECLDEPTH) cp_err(cp, LJ_ERR_XLEVELS);\r\n\r\n  for (;;) {  /* Head of declarator. */\r\n    if (cp_opt(cp, '*')) {  /* Pointer. */\r\n      CTSize sz;\r\n      CTInfo info;\r\n      cp_decl_attributes(cp, decl);\r\n      sz = CTSIZE_PTR;\r\n      info = CTINFO(CT_PTR, CTALIGN_PTR);\r\n#if LJ_64\r\n      if (ctype_msizeP(decl->attr) == 4) {\r\n\tsz = 4;\r\n\tinfo = CTINFO(CT_PTR, CTALIGN(2));\r\n      }\r\n#endif\r\n      info += (decl->attr & (CTF_QUAL|CTF_REF));\r\n      decl->attr &= ~(CTF_QUAL|(CTMASK_MSIZEP<<CTSHIFT_MSIZEP));\r\n      cp_push(decl, info, sz);\r\n    } else if (cp_opt(cp, '&') || cp_opt(cp, CTOK_ANDAND)) {  /* Reference. */\r\n      decl->attr &= ~(CTF_QUAL|(CTMASK_MSIZEP<<CTSHIFT_MSIZEP));\r\n      cp_push(decl, CTINFO_REF(0), CTSIZE_PTR);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n\r\n  if (cp_opt(cp, '(')) {  /* Inner declarator. */\r\n    CPDeclIdx pos;\r\n    cp_decl_attributes(cp, decl);\r\n    /* Resolve ambiguity between inner declarator and 1st function parameter. */\r\n    if ((decl->mode & CPARSE_MODE_ABSTRACT) &&\r\n\t(cp->tok == ')' || cp_istypedecl(cp))) goto func_decl;\r\n    pos = decl->pos;\r\n    cp_declarator(cp, decl);\r\n    cp_check(cp, ')');\r\n    decl->pos = pos;\r\n  } else if (cp->tok == CTOK_IDENT) {  /* Direct declarator. */\r\n    if (!(decl->mode & CPARSE_MODE_DIRECT)) cp_err_token(cp, CTOK_EOF);\r\n    decl->name = cp->str;\r\n    decl->nameid = cp->val.id;\r\n    cp_next(cp);\r\n  } else {  /* Abstract declarator. */\r\n    if (!(decl->mode & CPARSE_MODE_ABSTRACT)) cp_err_token(cp, CTOK_IDENT);\r\n  }\r\n\r\n  for (;;) {  /* Tail of declarator. */\r\n    if (cp_opt(cp, '[')) {  /* Array. */\r\n      cp_decl_array(cp, decl);\r\n    } else if (cp_opt(cp, '(')) {  /* Function. */\r\n    func_decl:\r\n      cp_decl_func(cp, decl);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n\r\n  if ((decl->mode & CPARSE_MODE_FIELD) && cp_opt(cp, ':'))  /* Field width. */\r\n    decl->bits = cp_expr_ksize(cp);\r\n\r\n  /* Process postfix attributes. */\r\n  cp_decl_attributes(cp, decl);\r\n  cp_push_attributes(decl);\r\n\r\n  cp->depth--;\r\n}\r\n\r\n/* Parse an abstract type declaration and return it's C type ID. */\r\nstatic CTypeID cp_decl_abstract(CPState *cp)\r\n{\r\n  CPDecl decl;\r\n  cp_decl_spec(cp, &decl, 0);\r\n  decl.mode = CPARSE_MODE_ABSTRACT;\r\n  cp_declarator(cp, &decl);\r\n  return cp_decl_intern(cp, &decl);\r\n}\r\n\r\n/* Handle pragmas. */\r\nstatic void cp_pragma(CPState *cp, BCLine pragmaline)\r\n{\r\n  cp_next(cp);\r\n  if (cp->tok == CTOK_IDENT &&\r\n      cp->str->hash == H_(e79b999f,42ca3e85))  {  /* pack */\r\n    cp_next(cp);\r\n    cp_check(cp, '(');\r\n    if (cp->tok == CTOK_IDENT) {\r\n      if (cp->str->hash == H_(738e923c,a1b65954)) {  /* push */\r\n\tif (cp->curpack < CPARSE_MAX_PACKSTACK) {\r\n\t  cp->packstack[cp->curpack+1] = cp->packstack[cp->curpack];\r\n\t  cp->curpack++;\r\n\t}\r\n      } else if (cp->str->hash == H_(6c71cf27,6c71cf27)) {  /* pop */\r\n\tif (cp->curpack > 0) cp->curpack--;\r\n      } else {\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n      }\r\n      cp_next(cp);\r\n      if (!cp_opt(cp, ',')) goto end_pack;\r\n    }\r\n    if (cp->tok == CTOK_INTEGER) {\r\n      cp->packstack[cp->curpack] = cp->val.u32 ? lj_fls(cp->val.u32) : 0;\r\n      cp_next(cp);\r\n    } else {\r\n      cp->packstack[cp->curpack] = 255;\r\n    }\r\n  end_pack:\r\n    cp_check(cp, ')');\r\n  } else {  /* Ignore all other pragmas. */\r\n    while (cp->tok != CTOK_EOF && cp->linenumber == pragmaline)\r\n      cp_next(cp);\r\n  }\r\n}\r\n\r\n/* Parse multiple C declarations of types or extern identifiers. */\r\nstatic void cp_decl_multi(CPState *cp)\r\n{\r\n  int first = 1;\r\n  while (cp->tok != CTOK_EOF) {\r\n    CPDecl decl;\r\n    CPscl scl;\r\n    if (cp_opt(cp, ';')) {  /* Skip empty statements. */\r\n      first = 0;\r\n      continue;\r\n    }\r\n    if (cp->tok == '#') {  /* Workaround, since we have no preprocessor, yet. */\r\n      BCLine pragmaline = cp->linenumber;\r\n      if (!(cp_next(cp) == CTOK_IDENT &&\r\n\t    cp->str->hash == H_(f5e6b4f8,1d509107)))  /* pragma */\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n      cp_pragma(cp, pragmaline);\r\n      continue;\r\n    }\r\n    scl = cp_decl_spec(cp, &decl, CDF_TYPEDEF|CDF_EXTERN|CDF_STATIC);\r\n    if ((cp->tok == ';' || cp->tok == CTOK_EOF) &&\r\n\tctype_istypedef(decl.stack[0].info)) {\r\n      CTInfo info = ctype_rawchild(cp->cts, &decl.stack[0])->info;\r\n      if (ctype_isstruct(info) || ctype_isenum(info))\r\n\tgoto decl_end;  /* Accept empty declaration of struct/union/enum. */\r\n    }\r\n    for (;;) {\r\n      CTypeID ctypeid;\r\n      cp_declarator(cp, &decl);\r\n      ctypeid = cp_decl_intern(cp, &decl);\r\n      if (decl.name && !decl.nameid) {  /* NYI: redeclarations are ignored. */\r\n\tCType *ct;\r\n\tCTypeID id;\r\n\tif ((scl & CDF_TYPEDEF)) {  /* Create new typedef. */\r\n\t  id = lj_ctype_new(cp->cts, &ct);\r\n\t  ct->info = CTINFO(CT_TYPEDEF, ctypeid);\r\n\t  goto noredir;\r\n\t} else if (ctype_isfunc(ctype_get(cp->cts, ctypeid)->info)) {\r\n\t  /* Treat both static and extern function declarations as extern. */\r\n\t  ct = ctype_get(cp->cts, ctypeid);\r\n\t  /* We always get new anonymous functions (typedefs are copied). */\r\n\t  lua_assert(gcref(ct->name) == NULL);\r\n\t  id = ctypeid;  /* Just name it. */\r\n\t} else if ((scl & CDF_STATIC)) {  /* Accept static constants. */\r\n\t  id = cp_decl_constinit(cp, &ct, ctypeid);\r\n\t  goto noredir;\r\n\t} else {  /* External references have extern or no storage class. */\r\n\t  id = lj_ctype_new(cp->cts, &ct);\r\n\t  ct->info = CTINFO(CT_EXTERN, ctypeid);\r\n\t}\r\n\tif (decl.redir) {  /* Add attribute for redirected symbol name. */\r\n\t  CType *cta;\r\n\t  CTypeID aid = lj_ctype_new(cp->cts, &cta);\r\n\t  ct = ctype_get(cp->cts, id);  /* Table may have been reallocated. */\r\n\t  cta->info = CTINFO(CT_ATTRIB, CTATTRIB(CTA_REDIR));\r\n\t  cta->sib = ct->sib;\r\n\t  ct->sib = aid;\r\n\t  ctype_setname(cta, decl.redir);\r\n\t}\r\n      noredir:\r\n\tctype_setname(ct, decl.name);\r\n\tlj_ctype_addname(cp->cts, ct, id);\r\n      }\r\n      if (!cp_opt(cp, ',')) break;\r\n      cp_decl_reset(&decl);\r\n    }\r\n  decl_end:\r\n    if (cp->tok == CTOK_EOF && first) break;  /* May omit ';' for 1 decl. */\r\n    first = 0;\r\n    cp_check(cp, ';');\r\n  }\r\n}\r\n\r\n/* Parse a single C type declaration. */\r\nstatic void cp_decl_single(CPState *cp)\r\n{\r\n  CPDecl decl;\r\n  cp_decl_spec(cp, &decl, 0);\r\n  cp_declarator(cp, &decl);\r\n  cp->val.id = cp_decl_intern(cp, &decl);\r\n  if (cp->tok != CTOK_EOF) cp_err_token(cp, CTOK_EOF);\r\n}\r\n\r\n#undef H_\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Protected callback for C parser. */\r\nstatic TValue *cpcparser(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  CPState *cp = (CPState *)ud;\r\n  UNUSED(dummy);\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  cp_init(cp);\r\n  if ((cp->mode & CPARSE_MODE_MULTI))\r\n    cp_decl_multi(cp);\r\n  else\r\n    cp_decl_single(cp);\r\n  if (cp->param && cp->param != cp->L->top)\r\n    cp_err(cp, LJ_ERR_FFI_NUMPARAM);\r\n  lua_assert(cp->depth == 0);\r\n  return NULL;\r\n}\r\n\r\n/* C parser. */\r\nint lj_cparse(CPState *cp)\r\n{\r\n  LJ_CTYPE_SAVE(cp->cts);\r\n  int errcode = lj_vm_cpcall(cp->L, NULL, cp, cpcparser);\r\n  if (errcode)\r\n    LJ_CTYPE_RESTORE(cp->cts);\r\n  cp_cleanup(cp);\r\n  return errcode;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_cparse.h",
    "content": "/*\r\n** C declaration parser.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CPARSE_H\r\n#define _LJ_CPARSE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* C parser limits. */\r\n#define CPARSE_MAX_BUF\t\t32768\t/* Max. token buffer size. */\r\n#define CPARSE_MAX_DECLSTACK\t100\t/* Max. declaration stack depth. */\r\n#define CPARSE_MAX_DECLDEPTH\t20\t/* Max. recursive declaration depth. */\r\n#define CPARSE_MAX_PACKSTACK\t7\t/* Max. pack pragma stack depth. */\r\n\r\n/* Flags for C parser mode. */\r\n#define CPARSE_MODE_MULTI\t1\t/* Process multiple declarations. */\r\n#define CPARSE_MODE_ABSTRACT\t2\t/* Accept abstract declarators. */\r\n#define CPARSE_MODE_DIRECT\t4\t/* Accept direct declarators. */\r\n#define CPARSE_MODE_FIELD\t8\t/* Accept field width in bits, too. */\r\n#define CPARSE_MODE_NOIMPLICIT\t16\t/* Reject implicit declarations. */\r\n#define CPARSE_MODE_SKIP\t32\t/* Skip definitions, ignore errors. */\r\n\r\ntypedef int CPChar;\t/* C parser character. Unsigned ext. from char. */\r\ntypedef int CPToken;\t/* C parser token. */\r\n\r\n/* C parser internal value representation. */\r\ntypedef struct CPValue {\r\n  union {\r\n    int32_t i32;\t/* Value for CTID_INT32. */\r\n    uint32_t u32;\t/* Value for CTID_UINT32. */\r\n  };\r\n  CTypeID id;\t\t/* C Type ID of the value. */\r\n} CPValue;\r\n\r\n/* C parser state. */\r\ntypedef struct CPState {\r\n  CPChar c;\t\t/* Current character. */\r\n  CPToken tok;\t\t/* Current token. */\r\n  CPValue val;\t\t/* Token value. */\r\n  GCstr *str;\t\t/* Interned string of identifier/keyword. */\r\n  CType *ct;\t\t/* C type table entry. */\r\n  const char *p;\t/* Current position in input buffer. */\r\n  SBuf sb;\t\t/* String buffer for tokens. */\r\n  lua_State *L;\t\t/* Lua state. */\r\n  CTState *cts;\t\t/* C type state. */\r\n  TValue *param;\t/* C type parameters. */\r\n  const char *srcname;\t/* Current source name. */\r\n  BCLine linenumber;\t/* Input line counter. */\r\n  int depth;\t\t/* Recursive declaration depth. */\r\n  uint32_t tmask;\t/* Type mask for next identifier. */\r\n  uint32_t mode;\t/* C parser mode. */\r\n  uint8_t packstack[CPARSE_MAX_PACKSTACK];  /* Stack for pack pragmas. */\r\n  uint8_t curpack;\t/* Current position in pack pragma stack. */\r\n} CPState;\r\n\r\nLJ_FUNC int lj_cparse(CPState *cp);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_crecord.c",
    "content": "/*\r\n** Trace recorder for C data operations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ffrecord_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT && LJ_HASFFI\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_clib.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_crecord.h\"\r\n#include \"lj_dispatch.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n#define emitconv(a, dt, st, flags) \\\r\n  emitir(IRT(IR_CONV, (dt)), (a), (st)|((dt) << 5)|(flags))\r\n\r\n/* -- C type checks ------------------------------------------------------- */\r\n\r\nstatic GCcdata *argv2cdata(jit_State *J, TRef tr, cTValue *o)\r\n{\r\n  GCcdata *cd;\r\n  TRef trtypeid;\r\n  if (!tref_iscdata(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  cd = cdataV(o);\r\n  /* Specialize to the CTypeID. */\r\n  trtypeid = emitir(IRT(IR_FLOAD, IRT_U16), tr, IRFL_CDATA_CTYPEID);\r\n  emitir(IRTG(IR_EQ, IRT_INT), trtypeid, lj_ir_kint(J, (int32_t)cd->ctypeid));\r\n  return cd;\r\n}\r\n\r\n/* Specialize to the CTypeID held by a cdata constructor. */\r\nstatic CTypeID crec_constructor(jit_State *J, GCcdata *cd, TRef tr)\r\n{\r\n  CTypeID id;\r\n  lua_assert(tref_iscdata(tr) && cd->ctypeid == CTID_CTYPEID);\r\n  id = *(CTypeID *)cdataptr(cd);\r\n  tr = emitir(IRT(IR_FLOAD, IRT_INT), tr, IRFL_CDATA_INT);\r\n  emitir(IRTG(IR_EQ, IRT_INT), tr, lj_ir_kint(J, (int32_t)id));\r\n  return id;\r\n}\r\n\r\nstatic CTypeID argv2ctype(jit_State *J, TRef tr, cTValue *o)\r\n{\r\n  if (tref_isstr(tr)) {\r\n    GCstr *s = strV(o);\r\n    CPState cp;\r\n    CTypeID oldtop;\r\n    /* Specialize to the string containing the C type declaration. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, s));\r\n    cp.L = J->L;\r\n    cp.cts = ctype_ctsG(J2G(J));\r\n    oldtop = cp.cts->top;\r\n    cp.srcname = strdata(s);\r\n    cp.p = strdata(s);\r\n    cp.param = NULL;\r\n    cp.mode = CPARSE_MODE_ABSTRACT|CPARSE_MODE_NOIMPLICIT;\r\n    if (lj_cparse(&cp) || cp.cts->top > oldtop)  /* Avoid new struct defs. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    return cp.val.id;\r\n  } else {\r\n    GCcdata *cd = argv2cdata(J, tr, o);\r\n    return cd->ctypeid == CTID_CTYPEID ? crec_constructor(J, cd, tr) :\r\n\t\t\t\t\tcd->ctypeid;\r\n  }\r\n}\r\n\r\n/* Convert CType to IRType (if possible). */\r\nstatic IRType crec_ct2irt(CTState *cts, CType *ct)\r\n{\r\n  if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n  if (LJ_LIKELY(ctype_isnum(ct->info))) {\r\n    if ((ct->info & CTF_FP)) {\r\n      if (ct->size == sizeof(double))\r\n\treturn IRT_NUM;\r\n      else if (ct->size == sizeof(float))\r\n\treturn IRT_FLOAT;\r\n    } else {\r\n      uint32_t b = lj_fls(ct->size);\r\n      if (b <= 3)\r\n\treturn IRT_I8 + 2*b + ((ct->info & CTF_UNSIGNED) ? 1 : 0);\r\n    }\r\n  } else if (ctype_isptr(ct->info)) {\r\n    return (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n  } else if (ctype_iscomplex(ct->info)) {\r\n    if (ct->size == 2*sizeof(double))\r\n      return IRT_NUM;\r\n    else if (ct->size == 2*sizeof(float))\r\n      return IRT_FLOAT;\r\n  }\r\n  return IRT_CDATA;\r\n}\r\n\r\n/* -- Optimized memory fill and copy -------------------------------------- */\r\n\r\n/* Maximum length and unroll of inlined copy/fill. */\r\n#define CREC_COPY_MAXUNROLL\t\t16\r\n#define CREC_COPY_MAXLEN\t\t128\r\n\r\n#define CREC_FILL_MAXUNROLL\t\t16\r\n\r\n/* Number of windowed registers used for optimized memory copy. */\r\n#if LJ_TARGET_X86\r\n#define CREC_COPY_REGWIN\t\t2\r\n#elif LJ_TARGET_PPC || LJ_TARGET_MIPS\r\n#define CREC_COPY_REGWIN\t\t8\r\n#else\r\n#define CREC_COPY_REGWIN\t\t4\r\n#endif\r\n\r\n/* List of memory offsets for copy/fill. */\r\ntypedef struct CRecMemList {\r\n  CTSize ofs;\t\t/* Offset in bytes. */\r\n  IRType tp;\t\t/* Type of load/store. */\r\n  TRef trofs;\t\t/* TRef of interned offset. */\r\n  TRef trval;\t\t/* TRef of load value. */\r\n} CRecMemList;\r\n\r\n/* Generate copy list for element-wise struct copy. */\r\nstatic MSize crec_copy_struct(CRecMemList *ml, CTState *cts, CType *ct)\r\n{\r\n  CTypeID fid = ct->sib;\r\n  MSize mlp = 0;\r\n  while (fid) {\r\n    CType *df = ctype_get(cts, fid);\r\n    fid = df->sib;\r\n    if (ctype_isfield(df->info)) {\r\n      CType *cct;\r\n      IRType tp;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      cct = ctype_rawchild(cts, df);  /* Field type. */\r\n      tp = crec_ct2irt(cts, cct);\r\n      if (tp == IRT_CDATA) return 0;  /* NYI: aggregates. */\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = df->size;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      if (ctype_iscomplex(cct->info)) {\r\n\tif (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n\tml[mlp].ofs = df->size + (cct->size >> 1);\r\n\tml[mlp].tp = tp;\r\n\tmlp++;\r\n      }\r\n    } else if (!ctype_isconstval(df->info)) {\r\n      /* NYI: bitfields and sub-structures. */\r\n      return 0;\r\n    }\r\n  }\r\n  return mlp;\r\n}\r\n\r\n/* Generate unrolled copy list, from highest to lowest step size/alignment. */\r\nstatic MSize crec_copy_unroll(CRecMemList *ml, CTSize len, CTSize step,\r\n\t\t\t      IRType tp)\r\n{\r\n  CTSize ofs = 0;\r\n  MSize mlp = 0;\r\n  if (tp == IRT_CDATA) tp = IRT_U8 + 2*lj_fls(step);\r\n  do {\r\n    while (ofs + step <= len) {\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = ofs;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      ofs += step;\r\n    }\r\n    step >>= 1;\r\n    tp -= 2;\r\n  } while (ofs < len);\r\n  return mlp;\r\n}\r\n\r\n/*\r\n** Emit copy list with windowed loads/stores.\r\n** LJ_TARGET_UNALIGNED: may emit unaligned loads/stores (not marked as such).\r\n*/\r\nstatic void crec_copy_emit(jit_State *J, CRecMemList *ml, MSize mlp,\r\n\t\t\t   TRef trdst, TRef trsrc)\r\n{\r\n  MSize i, j, rwin = 0;\r\n  for (i = 0, j = 0; i < mlp; ) {\r\n    TRef trofs = lj_ir_kintp(J, ml[i].ofs);\r\n    TRef trsptr = emitir(IRT(IR_ADD, IRT_PTR), trsrc, trofs);\r\n    ml[i].trval = emitir(IRT(IR_XLOAD, ml[i].tp), trsptr, 0);\r\n    ml[i].trofs = trofs;\r\n    i++;\r\n    rwin += (LJ_SOFTFP && ml[i].tp == IRT_NUM) ? 2 : 1;\r\n    if (rwin >= CREC_COPY_REGWIN || i >= mlp) {  /* Flush buffered stores. */\r\n      rwin = 0;\r\n      for ( ; j < i; j++) {\r\n\tTRef trdptr = emitir(IRT(IR_ADD, IRT_PTR), trdst, ml[j].trofs);\r\n\temitir(IRT(IR_XSTORE, ml[j].tp), trdptr, ml[j].trval);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Optimized memory copy. */\r\nstatic void crec_copy(jit_State *J, TRef trdst, TRef trsrc, TRef trlen,\r\n\t\t      CType *ct)\r\n{\r\n  if (tref_isk(trlen)) {  /* Length must be constant. */\r\n    CRecMemList ml[CREC_COPY_MAXUNROLL];\r\n    MSize mlp = 0;\r\n    CTSize step = 1, len = (CTSize)IR(tref_ref(trlen))->i;\r\n    IRType tp = IRT_CDATA;\r\n    int needxbar = 0;\r\n    if (len == 0) return;  /* Shortcut. */\r\n    if (len > CREC_COPY_MAXLEN) goto fallback;\r\n    if (ct) {\r\n      CTState *cts = ctype_ctsG(J2G(J));\r\n      lua_assert(ctype_isarray(ct->info) || ctype_isstruct(ct->info));\r\n      if (ctype_isarray(ct->info)) {\r\n\tCType *cct = ctype_rawchild(cts, ct);\r\n\ttp = crec_ct2irt(cts, cct);\r\n\tif (tp == IRT_CDATA) goto rawcopy;\r\n\tstep = lj_ir_type_size[tp];\r\n\tlua_assert((len & (step-1)) == 0);\r\n      } else if ((ct->info & CTF_UNION)) {\r\n\tstep = (1u << ctype_align(ct->info));\r\n\tgoto rawcopy;\r\n      } else {\r\n\tmlp = crec_copy_struct(ml, cts, ct);\r\n\tgoto emitcopy;\r\n      }\r\n    } else {\r\n    rawcopy:\r\n      needxbar = 1;\r\n      if (LJ_TARGET_UNALIGNED || step >= CTSIZE_PTR)\r\n\tstep = CTSIZE_PTR;\r\n    }\r\n    mlp = crec_copy_unroll(ml, len, step, tp);\r\n  emitcopy:\r\n    if (mlp) {\r\n      crec_copy_emit(J, ml, mlp, trdst, trsrc);\r\n      if (needxbar)\r\n\temitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n      return;\r\n    }\r\n  }\r\nfallback:\r\n  /* Call memcpy. Always needs a barrier to disable alias analysis. */\r\n  lj_ir_call(J, IRCALL_memcpy, trdst, trsrc, trlen);\r\n  emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* Generate unrolled fill list, from highest to lowest step size/alignment. */\r\nstatic MSize crec_fill_unroll(CRecMemList *ml, CTSize len, CTSize step)\r\n{\r\n  CTSize ofs = 0;\r\n  MSize mlp = 0;\r\n  IRType tp = IRT_U8 + 2*lj_fls(step);\r\n  do {\r\n    while (ofs + step <= len) {\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = ofs;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      ofs += step;\r\n    }\r\n    step >>= 1;\r\n    tp -= 2;\r\n  } while (ofs < len);\r\n  return mlp;\r\n}\r\n\r\n/*\r\n** Emit stores for fill list.\r\n** LJ_TARGET_UNALIGNED: may emit unaligned stores (not marked as such).\r\n*/\r\nstatic void crec_fill_emit(jit_State *J, CRecMemList *ml, MSize mlp,\r\n\t\t\t   TRef trdst, TRef trfill)\r\n{\r\n  MSize i;\r\n  for (i = 0; i < mlp; i++) {\r\n    TRef trofs = lj_ir_kintp(J, ml[i].ofs);\r\n    TRef trdptr = emitir(IRT(IR_ADD, IRT_PTR), trdst, trofs);\r\n    emitir(IRT(IR_XSTORE, ml[i].tp), trdptr, trfill);\r\n  }\r\n}\r\n\r\n/* Optimized memory fill. */\r\nstatic void crec_fill(jit_State *J, TRef trdst, TRef trlen, TRef trfill,\r\n\t\t      CTSize step)\r\n{\r\n  if (tref_isk(trlen)) {  /* Length must be constant. */\r\n    CRecMemList ml[CREC_FILL_MAXUNROLL];\r\n    MSize mlp;\r\n    CTSize len = (CTSize)IR(tref_ref(trlen))->i;\r\n    if (len == 0) return;  /* Shortcut. */\r\n    if (LJ_TARGET_UNALIGNED || step >= CTSIZE_PTR)\r\n      step = CTSIZE_PTR;\r\n    if (step * CREC_FILL_MAXUNROLL < len) goto fallback;\r\n    mlp = crec_fill_unroll(ml, len, step);\r\n    if (!mlp) goto fallback;\r\n    if (tref_isk(trfill) || ml[0].tp != IRT_U8)\r\n      trfill = emitconv(trfill, IRT_INT, IRT_U8, 0);\r\n    if (ml[0].tp != IRT_U8) {  /* Scatter U8 to U16/U32/U64. */\r\n      if (CTSIZE_PTR == 8 && ml[0].tp == IRT_U64) {\r\n\tif (tref_isk(trfill))  /* Pointless on x64 with zero-extended regs. */\r\n\t  trfill = emitconv(trfill, IRT_U64, IRT_U32, 0);\r\n\ttrfill = emitir(IRT(IR_MUL, IRT_U64), trfill,\r\n\t\t\tlj_ir_kint64(J, U64x(01010101,01010101)));\r\n      } else {\r\n\ttrfill = emitir(IRTI(IR_MUL), trfill,\r\n\t\t   lj_ir_kint(J, ml[0].tp == IRT_U16 ? 0x0101 : 0x01010101));\r\n      }\r\n    }\r\n    crec_fill_emit(J, ml, mlp, trdst, trfill);\r\n  } else {\r\nfallback:\r\n    /* Call memset. Always needs a barrier to disable alias analysis. */\r\n    lj_ir_call(J, IRCALL_memset, trdst, trfill, trlen);  /* Note: arg order! */\r\n  }\r\n  emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* -- Convert C type to C type -------------------------------------------- */\r\n\r\n/*\r\n** This code mirrors the code in lj_cconv.c. It performs the same steps\r\n** for the trace recorder that lj_cconv.c does for the interpreter.\r\n**\r\n** One major difference is that we can get away with much fewer checks\r\n** here. E.g. checks for casts, constness or correct types can often be\r\n** omitted, even if they might fail. The interpreter subsequently throws\r\n** an error, which aborts the trace.\r\n**\r\n** All operations are specialized to their C types, so the on-trace\r\n** outcome must be the same as the outcome in the interpreter. If the\r\n** interpreter doesn't throw an error, then the trace is correct, too.\r\n** Care must be taken not to generate invalid (temporary) IR or to\r\n** trigger asserts.\r\n*/\r\n\r\n/* Determine whether a passed number or cdata number is non-zero. */\r\nstatic int crec_isnonzero(CType *s, void *p)\r\n{\r\n  if (p == (void *)0)\r\n    return 0;\r\n  if (p == (void *)1)\r\n    return 1;\r\n  if ((s->info & CTF_FP)) {\r\n    if (s->size == sizeof(float))\r\n      return (*(float *)p != 0);\r\n    else\r\n      return (*(double *)p != 0);\r\n  } else {\r\n    if (s->size == 1)\r\n      return (*(uint8_t *)p != 0);\r\n    else if (s->size == 2)\r\n      return (*(uint16_t *)p != 0);\r\n    else if (s->size == 4)\r\n      return (*(uint32_t *)p != 0);\r\n    else\r\n      return (*(uint64_t *)p != 0);\r\n  }\r\n}\r\n\r\nstatic TRef crec_ct_ct(jit_State *J, CType *d, CType *s, TRef dp, TRef sp,\r\n\t\t       void *svisnz)\r\n{\r\n  IRType dt = crec_ct2irt(ctype_ctsG(J2G(J)), d);\r\n  IRType st = crec_ct2irt(ctype_ctsG(J2G(J)), s);\r\n  CTSize dsize = d->size, ssize = s->size;\r\n  CTInfo dinfo = d->info, sinfo = s->info;\r\n\r\n  if (ctype_type(dinfo) > CT_MAYCONVERT || ctype_type(sinfo) > CT_MAYCONVERT)\r\n    goto err_conv;\r\n\r\n  /*\r\n  ** Note: Unlike lj_cconv_ct_ct(), sp holds the _value_ of pointers and\r\n  ** numbers up to 8 bytes. Otherwise sp holds a pointer.\r\n  */\r\n\r\n  switch (cconv_idx2(dinfo, sinfo)) {\r\n  /* Destination is a bool. */\r\n  case CCX(B, B):\r\n    goto xstore;  /* Source operand is already normalized. */\r\n  case CCX(B, I):\r\n  case CCX(B, F):\r\n    if (st != IRT_CDATA) {\r\n      /* Specialize to the result of a comparison against 0. */\r\n      TRef zero = (st == IRT_NUM  || st == IRT_FLOAT) ? lj_ir_knum(J, 0) :\r\n\t\t  (st == IRT_I64 || st == IRT_U64) ? lj_ir_kint64(J, 0) :\r\n\t\t  lj_ir_kint(J, 0);\r\n      int isnz = crec_isnonzero(s, svisnz);\r\n      emitir(IRTG(isnz ? IR_NE : IR_EQ, st), sp, zero);\r\n      sp = lj_ir_kint(J, isnz);\r\n      goto xstore;\r\n    }\r\n    goto err_nyi;\r\n\r\n  /* Destination is an integer. */\r\n  case CCX(I, B):\r\n  case CCX(I, I):\r\n  conv_I_I:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    /* Extend 32 to 64 bit integer. */\r\n    if (dsize == 8 && ssize < 8 && !(LJ_64 && (sinfo & CTF_UNSIGNED)))\r\n      sp = emitconv(sp, dt, ssize < 4 ? IRT_INT : st,\r\n\t\t    (sinfo & CTF_UNSIGNED) ? 0 : IRCONV_SEXT);\r\n    else if (dsize < 8 && ssize == 8)  /* Truncate from 64 bit integer. */\r\n      sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, st, 0);\r\n    else if (st == IRT_INT)\r\n      sp = lj_opt_narrow_toint(J, sp);\r\n  xstore:\r\n    if (dt == IRT_I64 || dt == IRT_U64) lj_needsplit(J);\r\n    if (dp == 0) return sp;\r\n    emitir(IRT(IR_XSTORE, dt), dp, sp);\r\n    break;\r\n  case CCX(I, C):\r\n    sp = emitir(IRT(IR_XLOAD, st), sp, 0);  /* Load re. */\r\n    /* fallthrough */\r\n  case CCX(I, F):\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, st, IRCONV_TRUNC|IRCONV_ANY);\r\n    goto xstore;\r\n  case CCX(I, P):\r\n  case CCX(I, A):\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    ssize = CTSIZE_PTR;\r\n    st = IRT_UINTP;\r\n    if (((dsize ^ ssize) & 8) == 0) {  /* Must insert no-op type conversion. */\r\n      sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, IRT_PTR, 0);\r\n      goto xstore;\r\n    }\r\n    goto conv_I_I;\r\n\r\n  /* Destination is a floating-point number. */\r\n  case CCX(F, B):\r\n  case CCX(F, I):\r\n  conv_F_I:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    sp = emitconv(sp, dt, ssize < 4 ? IRT_INT : st, 0);\r\n    goto xstore;\r\n  case CCX(F, C):\r\n    sp = emitir(IRT(IR_XLOAD, st), sp, 0);  /* Load re. */\r\n    /* fallthrough */\r\n  case CCX(F, F):\r\n  conv_F_F:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    if (dt != st) sp = emitconv(sp, dt, st, 0);\r\n    goto xstore;\r\n\r\n  /* Destination is a complex number. */\r\n  case CCX(C, I):\r\n  case CCX(C, F):\r\n    {  /* Clear im. */\r\n      TRef ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, (dsize >> 1)));\r\n      emitir(IRT(IR_XSTORE, dt), ptr, lj_ir_knum(J, 0));\r\n    }\r\n    /* Convert to re. */\r\n    if ((sinfo & CTF_FP)) goto conv_F_F; else goto conv_F_I;\r\n\r\n  case CCX(C, C):\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    {\r\n      TRef re, im, ptr;\r\n      re = emitir(IRT(IR_XLOAD, st), sp, 0);\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, (ssize >> 1)));\r\n      im = emitir(IRT(IR_XLOAD, st), ptr, 0);\r\n      if (dt != st) {\r\n\tre = emitconv(re, dt, st, 0);\r\n\tim = emitconv(im, dt, st, 0);\r\n      }\r\n      emitir(IRT(IR_XSTORE, dt), dp, re);\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, (dsize >> 1)));\r\n      emitir(IRT(IR_XSTORE, dt), ptr, im);\r\n    }\r\n    break;\r\n\r\n  /* Destination is a vector. */\r\n  case CCX(V, I):\r\n  case CCX(V, F):\r\n  case CCX(V, C):\r\n  case CCX(V, V):\r\n    goto err_nyi;\r\n\r\n  /* Destination is a pointer. */\r\n  case CCX(P, P):\r\n  case CCX(P, A):\r\n  case CCX(P, S):\r\n    /* There are only 32 bit pointers/addresses on 32 bit machines.\r\n    ** Also ok on x64, since all 32 bit ops clear the upper part of the reg.\r\n    */\r\n    goto xstore;\r\n  case CCX(P, I):\r\n    if (st == IRT_CDATA) goto err_nyi;\r\n    if (!LJ_64 && ssize == 8)  /* Truncate from 64 bit integer. */\r\n      sp = emitconv(sp, IRT_U32, st, 0);\r\n    goto xstore;\r\n  case CCX(P, F):\r\n    if (st == IRT_CDATA) goto err_nyi;\r\n    /* The signed conversion is cheaper. x64 really has 47 bit pointers. */\r\n    sp = emitconv(sp, (LJ_64 && dsize == 8) ? IRT_I64 : IRT_U32,\r\n\t\t  st, IRCONV_TRUNC|IRCONV_ANY);\r\n    goto xstore;\r\n\r\n  /* Destination is an array. */\r\n  case CCX(A, A):\r\n  /* Destination is a struct/union. */\r\n  case CCX(S, S):\r\n    if (dp == 0) goto err_conv;\r\n    crec_copy(J, dp, sp, lj_ir_kint(J, dsize), d);\r\n    break;\r\n\r\n  default:\r\n  err_conv:\r\n  err_nyi:\r\n    lj_trace_err(J, LJ_TRERR_NYICONV);\r\n    break;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Convert C type to TValue (load) ------------------------------------- */\r\n\r\nstatic TRef crec_tv_ct(jit_State *J, CType *s, CTypeID sid, TRef sp)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  IRType t = crec_ct2irt(cts, s);\r\n  CTInfo sinfo = s->info;\r\n  if (ctype_isnum(sinfo)) {\r\n    TRef tr;\r\n    if (t == IRT_CDATA)\r\n      goto err_nyi;  /* NYI: copyval of >64 bit integers. */\r\n    tr = emitir(IRT(IR_XLOAD, t), sp, 0);\r\n    if (t == IRT_FLOAT || t == IRT_U32) {  /* Keep uint32_t/float as numbers. */\r\n      return emitconv(tr, IRT_NUM, t, 0);\r\n    } else if (t == IRT_I64 || t == IRT_U64) {  /* Box 64 bit integer. */\r\n      sp = tr;\r\n      lj_needsplit(J);\r\n    } else if ((sinfo & CTF_BOOL)) {\r\n      /* Assume not equal to zero. Fixup and emit pending guard later. */\r\n      lj_ir_set(J, IRTGI(IR_NE), tr, lj_ir_kint(J, 0));\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      return tr;\r\n    }\r\n  } else if (ctype_isptr(sinfo) || ctype_isenum(sinfo)) {\r\n    sp = emitir(IRT(IR_XLOAD, t), sp, 0);  /* Box pointers and enums. */\r\n  } else if (ctype_isrefarray(sinfo) || ctype_isstruct(sinfo)) {\r\n    cts->L = J->L;\r\n    sid = lj_ctype_intern(cts, CTINFO_REF(sid), CTSIZE_PTR);  /* Create ref. */\r\n  } else if (ctype_iscomplex(sinfo)) {  /* Unbox/box complex. */\r\n    ptrdiff_t esz = (ptrdiff_t)(s->size >> 1);\r\n    TRef ptr, tr1, tr2, dp;\r\n    dp = emitir(IRTG(IR_CNEW, IRT_CDATA), lj_ir_kint(J, sid), TREF_NIL);\r\n    tr1 = emitir(IRT(IR_XLOAD, t), sp, 0);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, esz));\r\n    tr2 = emitir(IRT(IR_XLOAD, t), ptr, 0);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, sizeof(GCcdata)));\r\n    emitir(IRT(IR_XSTORE, t), ptr, tr1);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, sizeof(GCcdata)+esz));\r\n    emitir(IRT(IR_XSTORE, t), ptr, tr2);\r\n    return dp;\r\n  } else {\r\n    /* NYI: copyval of vectors. */\r\n  err_nyi:\r\n    lj_trace_err(J, LJ_TRERR_NYICONV);\r\n  }\r\n  /* Box pointer, ref, enum or 64 bit integer. */\r\n  return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, sid), sp);\r\n}\r\n\r\n/* -- Convert TValue to C type (store) ------------------------------------ */\r\n\r\nstatic TRef crec_ct_tv(jit_State *J, CType *d, TRef dp, TRef sp, cTValue *sval)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID sid = CTID_P_VOID;\r\n  void *svisnz = 0;\r\n  CType *s;\r\n  if (LJ_LIKELY(tref_isinteger(sp))) {\r\n    sid = CTID_INT32;\r\n    svisnz = (void *)(intptr_t)(tvisint(sval)?(intV(sval)!=0):!tviszero(sval));\r\n  } else if (tref_isnum(sp)) {\r\n    sid = CTID_DOUBLE;\r\n    svisnz = (void *)(intptr_t)(tvisint(sval)?(intV(sval)!=0):!tviszero(sval));\r\n  } else if (tref_isbool(sp)) {\r\n    sp = lj_ir_kint(J, tref_istrue(sp) ? 1 : 0);\r\n    sid = CTID_BOOL;\r\n  } else if (tref_isnil(sp)) {\r\n    sp = lj_ir_kptr(J, NULL);\r\n  } else if (tref_isudata(sp)) {\r\n    GCudata *ud = udataV(sval);\r\n    if (ud->udtype == UDTYPE_IO_FILE) {\r\n      TRef tr = emitir(IRT(IR_FLOAD, IRT_U8), sp, IRFL_UDATA_UDTYPE);\r\n      emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, UDTYPE_IO_FILE));\r\n      sp = emitir(IRT(IR_FLOAD, IRT_PTR), sp, IRFL_UDATA_FILE);\r\n    } else {\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCudata)));\r\n    }\r\n  } else if (tref_isstr(sp)) {\r\n    if (ctype_isenum(d->info)) {  /* Match string against enum constant. */\r\n      GCstr *str = strV(sval);\r\n      CTSize ofs;\r\n      CType *cct = lj_ctype_getfield(cts, d, str, &ofs);\r\n      /* Specialize to the name of the enum constant. */\r\n      emitir(IRTG(IR_EQ, IRT_STR), sp, lj_ir_kstr(J, str));\r\n      if (cct && ctype_isconstval(cct->info)) {\r\n\tlua_assert(ctype_child(cts, cct)->size == 4);\r\n\tsvisnz = (void *)(intptr_t)(ofs != 0);\r\n\tsp = lj_ir_kint(J, (int32_t)ofs);\r\n\tsid = ctype_cid(cct->info);\r\n      }  /* else: interpreter will throw. */\r\n    } else if (ctype_isrefarray(d->info)) {  /* Copy string to array. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);  /* NYI */\r\n    } else {  /* Otherwise pass the string data as a const char[]. */\r\n      /* Don't use STRREF. It folds with SNEW, which loses the trailing NUL. */\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCstr)));\r\n      sid = CTID_A_CCHAR;\r\n    }\r\n  } else {  /* NYI: tref_istab(sp), tref_islightud(sp). */\r\n    IRType t;\r\n    sid = argv2cdata(J, sp, sval)->ctypeid;\r\n    s = ctype_raw(cts, sid);\r\n    svisnz = cdataptr(cdataV(sval));\r\n    t = crec_ct2irt(cts, s);\r\n    if (ctype_isptr(s->info)) {\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_PTR);\r\n      if (ctype_isref(s->info)) {\r\n\tsvisnz = *(void **)svisnz;\r\n\ts = ctype_rawchild(cts, s);\r\n\tif (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n\tt = crec_ct2irt(cts, s);\r\n      } else {\r\n\tgoto doconv;\r\n      }\r\n    } else if (t == IRT_I64 || t == IRT_U64) {\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_INT64);\r\n      lj_needsplit(J);\r\n      goto doconv;\r\n    } else if (t == IRT_INT || t == IRT_U32) {\r\n      if (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_INT);\r\n      goto doconv;\r\n    } else {\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCcdata)));\r\n    }\r\n    if (ctype_isnum(s->info) && t != IRT_CDATA)\r\n      sp = emitir(IRT(IR_XLOAD, t), sp, 0);  /* Load number value. */\r\n    goto doconv;\r\n  }\r\n  s = ctype_get(cts, sid);\r\ndoconv:\r\n  if (ctype_isenum(d->info)) d = ctype_child(cts, d);\r\n  return crec_ct_ct(J, d, s, dp, sp, svisnz);\r\n}\r\n\r\n/* -- C data metamethods -------------------------------------------------- */\r\n\r\n/* This would be rather difficult in FOLD, so do it here:\r\n** (base+k)+(idx*sz)+ofs ==> (base+idx*sz)+(ofs+k)\r\n** (base+(idx+k)*sz)+ofs ==> (base+idx*sz)+(ofs+k*sz)\r\n*/\r\nstatic TRef crec_reassoc_ofs(jit_State *J, TRef tr, ptrdiff_t *ofsp, MSize sz)\r\n{\r\n  IRIns *ir = IR(tref_ref(tr));\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && irref_isk(ir->op2) &&\r\n      (ir->o == IR_ADD || ir->o == IR_ADDOV || ir->o == IR_SUBOV)) {\r\n    IRIns *irk = IR(ir->op2);\r\n    ptrdiff_t k;\r\n    if (LJ_64 && irk->o == IR_KINT64)\r\n      k = (ptrdiff_t)ir_kint64(irk)->u64 * sz;\r\n    else\r\n      k = (ptrdiff_t)irk->i * sz;\r\n    if (ir->o == IR_SUBOV) *ofsp -= k; else *ofsp += k;\r\n    tr = ir->op1;  /* Not a TRef, but the caller doesn't care. */\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Record ctype __index/__newindex metamethods. */\r\nstatic void crec_index_meta(jit_State *J, CTState *cts, CType *ct,\r\n\t\t\t    RecordFFData *rd)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  cTValue *tv = lj_ctype_meta(cts, id, rd->data ? MM_newindex : MM_index);\r\n  if (!tv)\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  if (tvisfunc(tv)) {\r\n    J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n    rd->nres = -1;  /* Pending tailcall. */\r\n  } else if (rd->data == 0 && tvistab(tv) && tref_isstr(J->base[1])) {\r\n    /* Specialize to result of __index lookup. */\r\n    cTValue *o = lj_tab_get(J->L, tabV(tv), &rd->argv[1]);\r\n    J->base[0] = lj_record_constify(J, o);\r\n    if (!J->base[0])\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    /* Always specialize to the key. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, strV(&rd->argv[1])));\r\n  } else {\r\n    /* NYI: resolving of non-function metamethods. */\r\n    /* NYI: non-string keys for __index table. */\r\n    /* NYI: stores to __newindex table. */\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_index(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef idx, ptr = J->base[0];\r\n  ptrdiff_t ofs = sizeof(GCcdata);\r\n  GCcdata *cd = argv2cdata(J, ptr, &rd->argv[0]);\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  CTypeID sid = 0;\r\n\r\n  /* Resolve pointer or reference for cdata object. */\r\n  if (ctype_isptr(ct->info)) {\r\n    IRType t = (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n    if (ctype_isref(ct->info)) ct = ctype_rawchild(cts, ct);\r\n    ptr = emitir(IRT(IR_FLOAD, t), ptr, IRFL_CDATA_PTR);\r\n    ofs = 0;\r\n    ptr = crec_reassoc_ofs(J, ptr, &ofs, 1);\r\n  }\r\n\r\nagain:\r\n  idx = J->base[1];\r\n  if (tref_isnumber(idx)) {\r\n    idx = lj_opt_narrow_cindex(J, idx);\r\n    if (ctype_ispointer(ct->info)) {\r\n      CTSize sz;\r\n  integer_key:\r\n      if ((ct->info & CTF_COMPLEX))\r\n\tidx = emitir(IRT(IR_BAND, IRT_INTP), idx, lj_ir_kintp(J, 1));\r\n      sz = lj_ctype_size(cts, (sid = ctype_cid(ct->info)));\r\n      idx = crec_reassoc_ofs(J, idx, &ofs, sz);\r\n#if LJ_TARGET_ARM || LJ_TARGET_PPC\r\n      /* Hoist base add to allow fusion of index/shift into operands. */\r\n      if (LJ_LIKELY(J->flags & JIT_F_OPT_LOOP) && ofs\r\n#if LJ_TARGET_ARM\r\n\t  && (sz == 1 || sz == 4)\r\n#endif\r\n\t  ) {\r\n\tptr = emitir(IRT(IR_ADD, IRT_PTR), ptr, lj_ir_kintp(J, ofs));\r\n\tofs = 0;\r\n      }\r\n#endif\r\n      idx = emitir(IRT(IR_MUL, IRT_INTP), idx, lj_ir_kintp(J, sz));\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), idx, ptr);\r\n    }\r\n  } else if (tref_iscdata(idx)) {\r\n    GCcdata *cdk = cdataV(&rd->argv[1]);\r\n    CType *ctk = ctype_raw(cts, cdk->ctypeid);\r\n    IRType t = crec_ct2irt(cts, ctk);\r\n    if (ctype_ispointer(ct->info) && t >= IRT_I8 && t <= IRT_U64) {\r\n      if (ctk->size == 8) {\r\n\tidx = emitir(IRT(IR_FLOAD, t), idx, IRFL_CDATA_INT64);\r\n      } else if (ctk->size == 4) {\r\n\tidx = emitir(IRT(IR_FLOAD, t), idx, IRFL_CDATA_INT);\r\n      } else {\r\n\tidx = emitir(IRT(IR_ADD, IRT_PTR), idx,\r\n\t\t     lj_ir_kintp(J, sizeof(GCcdata)));\r\n\tidx = emitir(IRT(IR_XLOAD, t), idx, 0);\r\n      }\r\n      if (LJ_64 && ctk->size < sizeof(intptr_t) && !(ctk->info & CTF_UNSIGNED))\r\n\tidx = emitconv(idx, IRT_INTP, IRT_INT, IRCONV_SEXT);\r\n      if (!LJ_64 && ctk->size > sizeof(intptr_t)) {\r\n\tidx = emitconv(idx, IRT_INTP, t, 0);\r\n\tlj_needsplit(J);\r\n      }\r\n      goto integer_key;\r\n    }\r\n  } else if (tref_isstr(idx)) {\r\n    GCstr *name = strV(&rd->argv[1]);\r\n    if (cd && cd->ctypeid == CTID_CTYPEID)\r\n      ct = ctype_raw(cts, crec_constructor(J, cd, ptr));\r\n    if (ctype_isstruct(ct->info)) {\r\n      CTSize fofs;\r\n      CType *fct;\r\n      fct = lj_ctype_getfield(cts, ct, name, &fofs);\r\n      if (fct) {\r\n\t/* Always specialize to the field name. */\r\n\temitir(IRTG(IR_EQ, IRT_STR), idx, lj_ir_kstr(J, name));\r\n\tif (ctype_isconstval(fct->info)) {\r\n\t  if (fct->size >= 0x80000000u &&\r\n\t      (ctype_child(cts, fct)->info & CTF_UNSIGNED)) {\r\n\t    J->base[0] = lj_ir_knum(J, (lua_Number)(uint32_t)fct->size);\r\n\t    return;\r\n\t  }\r\n\t  J->base[0] = lj_ir_kint(J, (int32_t)fct->size);\r\n\t  return;  /* Interpreter will throw for newindex. */\r\n\t} else if (ctype_isbitfield(fct->info)) {\r\n\t  lj_trace_err(J, LJ_TRERR_NYICONV);\r\n\t} else {\r\n\t  lua_assert(ctype_isfield(fct->info));\r\n\t  sid = ctype_cid(fct->info);\r\n\t}\r\n\tofs += (ptrdiff_t)fofs;\r\n      }\r\n    } else if (ctype_iscomplex(ct->info)) {\r\n      if (name->len == 2 &&\r\n\t  ((strdata(name)[0] == 'r' && strdata(name)[1] == 'e') ||\r\n\t   (strdata(name)[0] == 'i' && strdata(name)[1] == 'm'))) {\r\n\t/* Always specialize to the field name. */\r\n\temitir(IRTG(IR_EQ, IRT_STR), idx, lj_ir_kstr(J, name));\r\n\tif (strdata(name)[0] == 'i') ofs += (ct->size >> 1);\r\n\tsid = ctype_cid(ct->info);\r\n      }\r\n    }\r\n  }\r\n  if (!sid) {\r\n    if (ctype_isptr(ct->info)) {  /* Automatically perform '->'. */\r\n      CType *cct = ctype_rawchild(cts, ct);\r\n      if (ctype_isstruct(cct->info)) {\r\n\tct = cct;\r\n\tcd = NULL;\r\n\tif (tref_isstr(idx)) goto again;\r\n      }\r\n    }\r\n    crec_index_meta(J, cts, ct, rd);\r\n    return;\r\n  }\r\n\r\n  if (ofs)\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), ptr, lj_ir_kintp(J, ofs));\r\n\r\n  /* Resolve reference for field. */\r\n  ct = ctype_get(cts, sid);\r\n  if (ctype_isref(ct->info)) {\r\n    ptr = emitir(IRT(IR_XLOAD, IRT_PTR), ptr, 0);\r\n    sid = ctype_cid(ct->info);\r\n    ct = ctype_get(cts, sid);\r\n  }\r\n\r\n  while (ctype_isattrib(ct->info))\r\n    ct = ctype_child(cts, ct);  /* Skip attributes. */\r\n\r\n  if (rd->data == 0) {  /* __index metamethod. */\r\n    J->base[0] = crec_tv_ct(J, ct, sid, ptr);\r\n  } else {  /* __newindex metamethod. */\r\n    rd->nres = 0;\r\n    J->needsnap = 1;\r\n    crec_ct_tv(J, ct, ptr, J->base[2], &rd->argv[2]);\r\n  }\r\n}\r\n\r\n/* Record setting a finalizer. */\r\nstatic void crec_finalizer(jit_State *J, TRef trcd, cTValue *fin)\r\n{\r\n  TRef trlo = lj_ir_call(J, IRCALL_lj_cdata_setfin, trcd);\r\n  TRef trhi = emitir(IRT(IR_ADD, IRT_P32), trlo, lj_ir_kint(J, 4));\r\n  if (LJ_BE) { TRef tmp = trlo; trlo = trhi; trhi = tmp; }\r\n  if (tvisfunc(fin)) {\r\n    emitir(IRT(IR_XSTORE, IRT_P32), trlo, lj_ir_kfunc(J, funcV(fin)));\r\n    emitir(IRTI(IR_XSTORE), trhi, lj_ir_kint(J, LJ_TFUNC));\r\n  } else if (tviscdata(fin)) {\r\n    emitir(IRT(IR_XSTORE, IRT_P32), trlo,\r\n\t   lj_ir_kgc(J, obj2gco(cdataV(fin)), IRT_CDATA));\r\n    emitir(IRTI(IR_XSTORE), trhi, lj_ir_kint(J, LJ_TCDATA));\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  J->needsnap = 1;\r\n}\r\n\r\n/* Record cdata allocation. */\r\nstatic void crec_alloc(jit_State *J, RecordFFData *rd, CTypeID id)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  CType *d = ctype_raw(cts, id);\r\n  TRef trid;\r\n  if (!sz || sz > 128 || (info & CTF_VLA) || ctype_align(info) > CT_MEMALIGN)\r\n    lj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: large/special allocations. */\r\n  trid = lj_ir_kint(J, id);\r\n  /* Use special instruction to box pointer or 32/64 bit integer. */\r\n  if (ctype_isptr(info) || (ctype_isinteger(info) && (sz == 4 || sz == 8))) {\r\n    TRef sp = J->base[1] ? crec_ct_tv(J, d, 0, J->base[1], &rd->argv[1]) :\r\n\t      ctype_isptr(info) ? lj_ir_kptr(J, NULL) :\r\n\t      sz == 4 ? lj_ir_kint(J, 0) :\r\n\t      (lj_needsplit(J), lj_ir_kint64(J, 0));\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA), trid, sp);\r\n  } else {\r\n    TRef trcd = emitir(IRTG(IR_CNEW, IRT_CDATA), trid, TREF_NIL);\r\n    cTValue *fin;\r\n    J->base[0] = trcd;\r\n    if (J->base[1] && !J->base[2] &&\r\n\t!lj_cconv_multi_init(cts, d, &rd->argv[1])) {\r\n      goto single_init;\r\n    } else if (ctype_isarray(d->info)) {\r\n      CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n      CTSize ofs, esize = dc->size;\r\n      TRef sp = 0;\r\n      TValue tv;\r\n      TValue *sval = &tv;\r\n      MSize i;\r\n      tv.u64 = 0;\r\n      if (!(ctype_isnum(dc->info) || ctype_isptr(dc->info)))\r\n\tlj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: init array of aggregates. */\r\n      for (i = 1, ofs = 0; ofs < sz; ofs += esize) {\r\n\tTRef dp = emitir(IRT(IR_ADD, IRT_PTR), trcd,\r\n\t\t\t lj_ir_kintp(J, ofs + sizeof(GCcdata)));\r\n\tif (J->base[i]) {\r\n\t  sp = J->base[i];\r\n\t  sval = &rd->argv[i];\r\n\t  i++;\r\n\t} else if (i != 2) {\r\n\t  sp = ctype_isnum(dc->info) ? lj_ir_kint(J, 0) : TREF_NIL;\r\n\t}\r\n\tcrec_ct_tv(J, dc, dp, sp, sval);\r\n      }\r\n    } else if (ctype_isstruct(d->info)) {\r\n      CTypeID fid = d->sib;\r\n      MSize i = 1;\r\n      while (fid) {\r\n\tCType *df = ctype_get(cts, fid);\r\n\tfid = df->sib;\r\n\tif (ctype_isfield(df->info)) {\r\n\t  CType *dc;\r\n\t  TRef sp, dp;\r\n\t  TValue tv;\r\n\t  TValue *sval = &tv;\r\n\t  setintV(&tv, 0);\r\n\t  if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n\t  dc = ctype_rawchild(cts, df);  /* Field type. */\r\n\t  if (!(ctype_isnum(dc->info) || ctype_isptr(dc->info) ||\r\n\t\tctype_isenum(dc->info)))\r\n\t    lj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: init aggregates. */\r\n\t  if (J->base[i]) {\r\n\t    sp = J->base[i];\r\n\t    sval = &rd->argv[i];\r\n\t    i++;\r\n\t  } else {\r\n\t    sp = ctype_isptr(dc->info) ? TREF_NIL : lj_ir_kint(J, 0);\r\n\t  }\r\n\t  dp = emitir(IRT(IR_ADD, IRT_PTR), trcd,\r\n\t\t      lj_ir_kintp(J, df->size + sizeof(GCcdata)));\r\n\t  crec_ct_tv(J, dc, dp, sp, sval);\r\n\t} else if (!ctype_isconstval(df->info)) {\r\n\t  /* NYI: init bitfields and sub-structures. */\r\n\t  lj_trace_err(J, LJ_TRERR_NYICONV);\r\n\t}\r\n      }\r\n    } else {\r\n      TRef dp;\r\n    single_init:\r\n      dp = emitir(IRT(IR_ADD, IRT_PTR), trcd, lj_ir_kintp(J, sizeof(GCcdata)));\r\n      if (J->base[1]) {\r\n\tcrec_ct_tv(J, d, dp, J->base[1], &rd->argv[1]);\r\n      } else {\r\n\tTValue tv;\r\n\ttv.u64 = 0;\r\n\tcrec_ct_tv(J, d, dp, lj_ir_kint(J, 0), &tv);\r\n      }\r\n    }\r\n    /* Handle __gc metamethod. */\r\n    fin = lj_ctype_meta(cts, id, MM_gc);\r\n    if (fin)\r\n      crec_finalizer(J, trcd, fin);\r\n  }\r\n}\r\n\r\n/* Record argument conversions. */\r\nstatic TRef crec_call_args(jit_State *J, RecordFFData *rd,\r\n\t\t\t   CTState *cts, CType *ct)\r\n{\r\n  TRef args[CCI_NARGS_MAX];\r\n  CTypeID fid;\r\n  MSize i, n;\r\n  TRef tr, *base;\r\n  cTValue *o;\r\n#if LJ_TARGET_X86\r\n#if LJ_ABI_WIN\r\n  TRef *arg0 = NULL, *arg1 = NULL;\r\n#endif\r\n  int ngpr = 0;\r\n  if (ctype_cconv(ct->info) == CTCC_THISCALL)\r\n    ngpr = 1;\r\n  else if (ctype_cconv(ct->info) == CTCC_FASTCALL)\r\n    ngpr = 2;\r\n#endif\r\n\r\n  /* Skip initial attributes. */\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) break;\r\n    fid = ctf->sib;\r\n  }\r\n  args[0] = TREF_NIL;\r\n  for (n = 0, base = J->base+1, o = rd->argv+1; *base; n++, base++, o++) {\r\n    CTypeID did;\r\n    CType *d;\r\n\r\n    if (n >= CCI_NARGS_MAX)\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n\r\n    if (fid) {  /* Get argument type from field. */\r\n      CType *ctf = ctype_get(cts, fid);\r\n      fid = ctf->sib;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      did = ctype_cid(ctf->info);\r\n    } else {\r\n      if (!(ct->info & CTF_VARARG))\r\n\tlj_trace_err(J, LJ_TRERR_NYICALL);  /* Too many arguments. */\r\n      did = lj_ccall_ctid_vararg(cts, o);  /* Infer vararg type. */\r\n    }\r\n    d = ctype_raw(cts, did);\r\n    if (!(ctype_isnum(d->info) || ctype_isptr(d->info) ||\r\n\t  ctype_isenum(d->info)))\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n    tr = crec_ct_tv(J, d, 0, *base, o);\r\n    if (ctype_isinteger_or_bool(d->info)) {\r\n      if (d->size < 4) {\r\n\tif ((d->info & CTF_UNSIGNED))\r\n\t  tr = emitconv(tr, IRT_INT, d->size==1 ? IRT_U8 : IRT_U16, 0);\r\n\telse\r\n\t  tr = emitconv(tr, IRT_INT, d->size==1 ? IRT_I8 : IRT_I16,IRCONV_SEXT);\r\n      }\r\n    } else if (LJ_SOFTFP && ctype_isfp(d->info) && d->size > 4) {\r\n      lj_needsplit(J);\r\n    }\r\n#if LJ_TARGET_X86\r\n    /* 64 bit args must not end up in registers for fastcall/thiscall. */\r\n#if LJ_ABI_WIN\r\n    if (!ctype_isfp(d->info)) {\r\n      /* Sigh, the Windows/x86 ABI allows reordering across 64 bit args. */\r\n      if (tref_typerange(tr, IRT_I64, IRT_U64)) {\r\n\tif (ngpr) {\r\n\t  arg0 = &args[n]; args[n++] = TREF_NIL; ngpr--;\r\n\t  if (ngpr) {\r\n\t    arg1 = &args[n]; args[n++] = TREF_NIL; ngpr--;\r\n\t  }\r\n\t}\r\n      } else {\r\n\tif (arg0) { *arg0 = tr; arg0 = NULL; n--; continue; }\r\n\tif (arg1) { *arg1 = tr; arg1 = NULL; n--; continue; }\r\n\tif (ngpr) ngpr--;\r\n      }\r\n    }\r\n#else\r\n    if (!ctype_isfp(d->info) && ngpr) {\r\n      if (tref_typerange(tr, IRT_I64, IRT_U64)) {\r\n\t/* No reordering for other x86 ABIs. Simply add alignment args. */\r\n\tdo { args[n++] = TREF_NIL; } while (--ngpr);\r\n      } else {\r\n\tngpr--;\r\n      }\r\n    }\r\n#endif\r\n#endif\r\n    args[n] = tr;\r\n  }\r\n  tr = args[0];\r\n  for (i = 1; i < n; i++)\r\n    tr = emitir(IRT(IR_CARG, IRT_NIL), tr, args[i]);\r\n  return tr;\r\n}\r\n\r\n/* Create a snapshot for the caller, simulating a 'false' return value. */\r\nstatic void crec_snap_caller(jit_State *J)\r\n{\r\n  lua_State *L = J->L;\r\n  TValue *base = L->base, *top = L->top;\r\n  const BCIns *pc = J->pc;\r\n  TRef ftr = J->base[-1];\r\n  ptrdiff_t delta;\r\n  if (!frame_islua(base-1) || J->framedepth <= 0)\r\n    lj_trace_err(J, LJ_TRERR_NYICALL);\r\n  J->pc = frame_pc(base-1); delta = 1+bc_a(J->pc[-1]);\r\n  L->top = base; L->base = base - delta;\r\n  J->base[-1] = TREF_FALSE;\r\n  J->base -= delta; J->baseslot -= (BCReg)delta;\r\n  J->maxslot = (BCReg)delta; J->framedepth--;\r\n  lj_snap_add(J);\r\n  L->base = base; L->top = top;\r\n  J->framedepth++; J->maxslot = 1;\r\n  J->base += delta; J->baseslot += (BCReg)delta;\r\n  J->base[-1] = ftr; J->pc = pc;\r\n}\r\n\r\n/* Record function call. */\r\nstatic int crec_call(jit_State *J, RecordFFData *rd, GCcdata *cd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  IRType tp = IRT_PTR;\r\n  if (ctype_isptr(ct->info)) {\r\n    tp = (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n    ct = ctype_rawchild(cts, ct);\r\n  }\r\n  if (ctype_isfunc(ct->info)) {\r\n    TRef func = emitir(IRT(IR_FLOAD, tp), J->base[0], IRFL_CDATA_PTR);\r\n    CType *ctr = ctype_rawchild(cts, ct);\r\n    IRType t = crec_ct2irt(cts, ctr);\r\n    TRef tr;\r\n    TValue tv;\r\n    /* Check for blacklisted C functions that might call a callback. */\r\n    setlightudV(&tv,\r\n\t\tcdata_getptr(cdataptr(cd), (LJ_64 && tp == IRT_P64) ? 8 : 4));\r\n    if (tvistrue(lj_tab_get(J->L, cts->miscmap, &tv)))\r\n      lj_trace_err(J, LJ_TRERR_BLACKL);\r\n    if (ctype_isvoid(ctr->info)) {\r\n      t = IRT_NIL;\r\n      rd->nres = 0;\r\n    } else if (!(ctype_isnum(ctr->info) || ctype_isptr(ctr->info) ||\r\n\t\t ctype_isenum(ctr->info)) || t == IRT_CDATA) {\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n    }\r\n    if ((ct->info & CTF_VARARG)\r\n#if LJ_TARGET_X86\r\n\t|| ctype_cconv(ct->info) != CTCC_CDECL\r\n#endif\r\n\t)\r\n      func = emitir(IRT(IR_CARG, IRT_NIL), func,\r\n\t\t    lj_ir_kint(J, ctype_typeid(cts, ct)));\r\n    tr = emitir(IRT(IR_CALLXS, t), crec_call_args(J, rd, cts, ct), func);\r\n    if (ctype_isbool(ctr->info)) {\r\n      if (frame_islua(J->L->base-1) && bc_b(frame_pc(J->L->base-1)[-1]) == 1) {\r\n\t/* Don't check result if ignored. */\r\n\ttr = TREF_NIL;\r\n      } else {\r\n\tcrec_snap_caller(J);\r\n#if LJ_TARGET_X86ORX64\r\n\t/* Note: only the x86/x64 backend supports U8 and only for EQ(tr, 0). */\r\n\tlj_ir_set(J, IRTG(IR_NE, IRT_U8), tr, lj_ir_kint(J, 0));\r\n#else\r\n\tlj_ir_set(J, IRTGI(IR_NE), tr, lj_ir_kint(J, 0));\r\n#endif\r\n\tJ->postproc = LJ_POST_FIXGUARDSNAP;\r\n\ttr = TREF_TRUE;\r\n      }\r\n    } else if (t == IRT_PTR || (LJ_64 && t == IRT_P32) ||\r\n\t       t == IRT_I64 || t == IRT_U64 || ctype_isenum(ctr->info)) {\r\n      TRef trid = lj_ir_kint(J, ctype_cid(ct->info));\r\n      tr = emitir(IRTG(IR_CNEWI, IRT_CDATA), trid, tr);\r\n      if (t == IRT_I64 || t == IRT_U64) lj_needsplit(J);\r\n    } else if (t == IRT_FLOAT || t == IRT_U32) {\r\n      tr = emitconv(tr, IRT_NUM, t, 0);\r\n    } else if (t == IRT_I8 || t == IRT_I16) {\r\n      tr = emitconv(tr, IRT_INT, t, IRCONV_SEXT);\r\n    } else if (t == IRT_U8 || t == IRT_U16) {\r\n      tr = emitconv(tr, IRT_INT, t, 0);\r\n    }\r\n    J->base[0] = tr;\r\n    J->needsnap = 1;\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_call(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  GCcdata *cd = argv2cdata(J, J->base[0], &rd->argv[0]);\r\n  CTypeID id = cd->ctypeid;\r\n  CType *ct;\r\n  cTValue *tv;\r\n  MMS mm = MM_call;\r\n  if (id == CTID_CTYPEID) {\r\n    id = crec_constructor(J, cd, J->base[0]);\r\n    mm = MM_new;\r\n  } else if (crec_call(J, rd, cd)) {\r\n    return;\r\n  }\r\n  /* Record ctype __call/__new metamethod. */\r\n  ct = ctype_raw(cts, id);\r\n  tv = lj_ctype_meta(cts, ctype_isptr(ct->info) ? ctype_cid(ct->info) : id, mm);\r\n  if (tv) {\r\n    if (tvisfunc(tv)) {\r\n      J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n      rd->nres = -1;  /* Pending tailcall. */\r\n      return;\r\n    }\r\n  } else if (mm == MM_new) {\r\n    crec_alloc(J, rd, id);\r\n    return;\r\n  }\r\n  /* No metamethod or NYI: non-function metamethods. */\r\n  lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n}\r\n\r\nstatic TRef crec_arith_int64(jit_State *J, TRef *sp, CType **s, MMS mm)\r\n{\r\n  if (ctype_isnum(s[0]->info) && ctype_isnum(s[1]->info)) {\r\n    IRType dt;\r\n    CTypeID id;\r\n    TRef tr;\r\n    MSize i;\r\n    IROp op;\r\n    lj_needsplit(J);\r\n    if (((s[0]->info & CTF_UNSIGNED) && s[0]->size == 8) ||\r\n\t((s[1]->info & CTF_UNSIGNED) && s[1]->size == 8)) {\r\n      dt = IRT_U64; id = CTID_UINT64;\r\n    } else {\r\n      dt = IRT_I64; id = CTID_INT64;\r\n      if (mm < MM_add &&\r\n\t  !((s[0]->info | s[1]->info) & CTF_FP) &&\r\n\t  s[0]->size == 4 && s[1]->size == 4) {  /* Try to narrow comparison. */\r\n\tif (!((s[0]->info ^ s[1]->info) & CTF_UNSIGNED) ||\r\n\t    (tref_isk(sp[1]) && IR(tref_ref(sp[1]))->i >= 0)) {\r\n\t  dt = (s[0]->info & CTF_UNSIGNED) ? IRT_U32 : IRT_INT;\r\n\t  goto comp;\r\n\t} else if (tref_isk(sp[0]) && IR(tref_ref(sp[0]))->i >= 0) {\r\n\t  dt = (s[1]->info & CTF_UNSIGNED) ? IRT_U32 : IRT_INT;\r\n\t  goto comp;\r\n\t}\r\n      }\r\n    }\r\n    for (i = 0; i < 2; i++) {\r\n      IRType st = tref_type(sp[i]);\r\n      if (st == IRT_NUM || st == IRT_FLOAT)\r\n\tsp[i] = emitconv(sp[i], dt, st, IRCONV_TRUNC|IRCONV_ANY);\r\n      else if (!(st == IRT_I64 || st == IRT_U64))\r\n\tsp[i] = emitconv(sp[i], dt, IRT_INT,\r\n\t\t\t (s[i]->info & CTF_UNSIGNED) ? 0 : IRCONV_SEXT);\r\n    }\r\n    if (mm < MM_add) {\r\n    comp:\r\n      /* Assume true comparison. Fixup and emit pending guard later. */\r\n      if (mm == MM_eq) {\r\n\top = IR_EQ;\r\n      } else {\r\n\top = mm == MM_lt ? IR_LT : IR_LE;\r\n\tif (dt == IRT_U32 || dt == IRT_U64)\r\n\t  op += (IR_ULT-IR_LT);\r\n      }\r\n      lj_ir_set(J, IRTG(op, dt), sp[0], sp[1]);\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      tr = emitir(IRT(mm+(int)IR_ADD-(int)MM_add, dt), sp[0], sp[1]);\r\n    }\r\n    return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic TRef crec_arith_ptr(jit_State *J, TRef *sp, CType **s, MMS mm)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ctp = s[0];\r\n  if (ctype_isptr(ctp->info) || ctype_isrefarray(ctp->info)) {\r\n    if ((mm == MM_sub || mm == MM_eq || mm == MM_lt || mm == MM_le) &&\r\n\t(ctype_isptr(s[1]->info) || ctype_isrefarray(s[1]->info))) {\r\n      if (mm == MM_sub) {  /* Pointer difference. */\r\n\tTRef tr;\r\n\tCTSize sz = lj_ctype_size(cts, ctype_cid(ctp->info));\r\n\tif (sz == 0 || (sz & (sz-1)) != 0)\r\n\t  return 0;  /* NYI: integer division. */\r\n\ttr = emitir(IRT(IR_SUB, IRT_INTP), sp[0], sp[1]);\r\n\ttr = emitir(IRT(IR_BSAR, IRT_INTP), tr, lj_ir_kint(J, lj_fls(sz)));\r\n#if LJ_64\r\n\ttr = emitconv(tr, IRT_NUM, IRT_INTP, 0);\r\n#endif\r\n\treturn tr;\r\n      } else {  /* Pointer comparison (unsigned). */\r\n\t/* Assume true comparison. Fixup and emit pending guard later. */\r\n\tIROp op = mm == MM_eq ? IR_EQ : mm == MM_lt ? IR_ULT : IR_ULE;\r\n\tlj_ir_set(J, IRTG(op, IRT_PTR), sp[0], sp[1]);\r\n\tJ->postproc = LJ_POST_FIXGUARD;\r\n\treturn TREF_TRUE;\r\n      }\r\n    }\r\n    if (!((mm == MM_add || mm == MM_sub) && ctype_isnum(s[1]->info)))\r\n      return 0;\r\n  } else if (mm == MM_add && ctype_isnum(ctp->info) &&\r\n\t     (ctype_isptr(s[1]->info) || ctype_isrefarray(s[1]->info))) {\r\n    TRef tr = sp[0]; sp[0] = sp[1]; sp[1] = tr;  /* Swap pointer and index. */\r\n    ctp = s[1];\r\n  } else {\r\n    return 0;\r\n  }\r\n  {\r\n    TRef tr = sp[1];\r\n    IRType t = tref_type(tr);\r\n    CTSize sz = lj_ctype_size(cts, ctype_cid(ctp->info));\r\n    CTypeID id;\r\n#if LJ_64\r\n    if (t == IRT_NUM || t == IRT_FLOAT)\r\n      tr = emitconv(tr, IRT_INTP, t, IRCONV_TRUNC|IRCONV_ANY);\r\n    else if (!(t == IRT_I64 || t == IRT_U64))\r\n      tr = emitconv(tr, IRT_INTP, IRT_INT,\r\n\t\t    ((t - IRT_I8) & 1) ? 0 : IRCONV_SEXT);\r\n#else\r\n    if (!tref_typerange(sp[1], IRT_I8, IRT_U32)) {\r\n      tr = emitconv(tr, IRT_INTP, t,\r\n\t\t    (t == IRT_NUM || t == IRT_FLOAT) ?\r\n\t\t    IRCONV_TRUNC|IRCONV_ANY : 0);\r\n    }\r\n#endif\r\n    tr = emitir(IRT(IR_MUL, IRT_INTP), tr, lj_ir_kintp(J, sz));\r\n    tr = emitir(IRT(mm+(int)IR_ADD-(int)MM_add, IRT_PTR), sp[0], tr);\r\n    id = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ctp->info)),\r\n\t\t\t CTSIZE_PTR);\r\n    return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n  }\r\n}\r\n\r\n/* Record ctype arithmetic metamethods. */\r\nstatic TRef crec_arith_meta(jit_State *J, TRef *sp, CType **s, CTState *cts,\r\n\t\t\t    RecordFFData *rd)\r\n{\r\n  cTValue *tv = NULL;\r\n  if (J->base[0]) {\r\n    if (tviscdata(&rd->argv[0])) {\r\n      CTypeID id = argv2cdata(J, J->base[0], &rd->argv[0])->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n      tv = lj_ctype_meta(cts, id, (MMS)rd->data);\r\n    }\r\n    if (!tv && J->base[1] && tviscdata(&rd->argv[1])) {\r\n      CTypeID id = argv2cdata(J, J->base[1], &rd->argv[1])->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n      tv = lj_ctype_meta(cts, id, (MMS)rd->data);\r\n    }\r\n  }\r\n  if (tv) {\r\n    if (tvisfunc(tv)) {\r\n      J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n      rd->nres = -1;  /* Pending tailcall. */\r\n      return 0;\r\n    }  /* NYI: non-function metamethods. */\r\n  } else if ((MMS)rd->data == MM_eq) {  /* Fallback cdata pointer comparison. */\r\n    if (sp[0] && sp[1] && ctype_isnum(s[0]->info) == ctype_isnum(s[1]->info)) {\r\n      /* Assume true comparison. Fixup and emit pending guard later. */\r\n      lj_ir_set(J, IRTG(IR_EQ, IRT_PTR), sp[0], sp[1]);\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      return TREF_FALSE;\r\n    }\r\n  }\r\n  lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  return 0;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_arith(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef sp[2];\r\n  CType *s[2];\r\n  MSize i;\r\n  for (i = 0; i < 2; i++) {\r\n    TRef tr = J->base[i];\r\n    CType *ct = ctype_get(cts, CTID_DOUBLE);\r\n    if (!tr) {\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    } else if (tref_iscdata(tr)) {\r\n      CTypeID id = argv2cdata(J, tr, &rd->argv[i])->ctypeid;\r\n      IRType t;\r\n      ct = ctype_raw(cts, id);\r\n      t = crec_ct2irt(cts, ct);\r\n      if (ctype_isptr(ct->info)) {  /* Resolve pointer or reference. */\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_PTR);\r\n\tif (ctype_isref(ct->info)) {\r\n\t  ct = ctype_rawchild(cts, ct);\r\n\t  t = crec_ct2irt(cts, ct);\r\n\t}\r\n      } else if (t == IRT_I64 || t == IRT_U64) {\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_INT64);\r\n\tlj_needsplit(J);\r\n\tgoto ok;\r\n      } else if (t == IRT_INT || t == IRT_U32) {\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_INT);\r\n\tif (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n\tgoto ok;\r\n      } else if (ctype_isfunc(ct->info)) {\r\n\ttr = emitir(IRT(IR_FLOAD, IRT_PTR), tr, IRFL_CDATA_PTR);\r\n\tct = ctype_get(cts,\r\n\t  lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR));\r\n\tgoto ok;\r\n      } else {\r\n\ttr = emitir(IRT(IR_ADD, IRT_PTR), tr, lj_ir_kintp(J, sizeof(GCcdata)));\r\n      }\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      if (ctype_isnum(ct->info)) {\r\n\tif (t == IRT_CDATA) {\r\n\t  tr = 0;\r\n\t} else {\r\n\t  if (t == IRT_I64 || t == IRT_U64) lj_needsplit(J);\r\n\t  tr = emitir(IRT(IR_XLOAD, t), tr, 0);\r\n\t}\r\n      }\r\n    } else if (tref_isnil(tr)) {\r\n      tr = lj_ir_kptr(J, NULL);\r\n      ct = ctype_get(cts, CTID_P_VOID);\r\n    } else if (tref_isinteger(tr)) {\r\n      ct = ctype_get(cts, CTID_INT32);\r\n    } else if (tref_isstr(tr)) {\r\n      TRef tr2 = J->base[1-i];\r\n      CTypeID id = argv2cdata(J, tr2, &rd->argv[1-i])->ctypeid;\r\n      ct = ctype_raw(cts, id);\r\n      if (ctype_isenum(ct->info)) {  /* Match string against enum constant. */\r\n\tGCstr *str = strV(&rd->argv[i]);\r\n\tCTSize ofs;\r\n\tCType *cct = lj_ctype_getfield(cts, ct, str, &ofs);\r\n\tif (cct && ctype_isconstval(cct->info)) {\r\n\t  /* Specialize to the name of the enum constant. */\r\n\t  emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, str));\r\n\t  ct = ctype_child(cts, cct);\r\n\t  tr = lj_ir_kint(J, (int32_t)ofs);\r\n\t} else {  /* Interpreter will throw or return false. */\r\n\t  ct = ctype_get(cts, CTID_P_VOID);\r\n\t}\r\n      } else if (ctype_isptr(ct->info)) {\r\n\ttr = emitir(IRT(IR_ADD, IRT_PTR), tr, lj_ir_kintp(J, sizeof(GCstr)));\r\n      } else {\r\n\tct = ctype_get(cts, CTID_P_VOID);\r\n      }\r\n    } else if (!tref_isnum(tr)) {\r\n      tr = 0;\r\n      ct = ctype_get(cts, CTID_P_VOID);\r\n    }\r\n  ok:\r\n    s[i] = ct;\r\n    sp[i] = tr;\r\n  }\r\n  {\r\n    TRef tr;\r\n    if (!(tr = crec_arith_int64(J, sp, s, (MMS)rd->data)) &&\r\n\t!(tr = crec_arith_ptr(J, sp, s, (MMS)rd->data)) &&\r\n\t!(tr = crec_arith_meta(J, sp, s, cts, rd)))\r\n      return;\r\n    J->base[0] = tr;\r\n    /* Fixup cdata comparisons, too. Avoids some cdata escapes. */\r\n    if (J->postproc == LJ_POST_FIXGUARD && frame_iscont(J->L->base-1) &&\r\n\t!irt_isguard(J->guardemit)) {\r\n      const BCIns *pc = frame_contpc(J->L->base-1) - 1;\r\n      if (bc_op(*pc) <= BC_ISNEP) {\r\n\tsetframe_pc(&J2G(J)->tmptv, pc);\r\n\tJ2G(J)->tmptv.u32.lo = ((tref_istrue(tr) ^ bc_op(*pc)) & 1);\r\n\tJ->postproc = LJ_POST_FIXCOMP;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* -- C library namespace metamethods ------------------------------------- */\r\n\r\nvoid LJ_FASTCALL recff_clib_index(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  if (tref_isudata(J->base[0]) && tref_isstr(J->base[1]) &&\r\n      udataV(&rd->argv[0])->udtype == UDTYPE_FFI_CLIB) {\r\n    CLibrary *cl = (CLibrary *)uddata(udataV(&rd->argv[0]));\r\n    GCstr *name = strV(&rd->argv[1]);\r\n    CType *ct;\r\n    CTypeID id = lj_ctype_getname(cts, &ct, name, CLNS_INDEX);\r\n    cTValue *tv = lj_tab_getstr(cl->cache, name);\r\n    rd->nres = rd->data;\r\n    if (id && tv && !tvisnil(tv)) {\r\n      /* Specialize to the symbol name and make the result a constant. */\r\n      emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, name));\r\n      if (ctype_isconstval(ct->info)) {\r\n\tif (ct->size >= 0x80000000u &&\r\n\t    (ctype_child(cts, ct)->info & CTF_UNSIGNED))\r\n\t  J->base[0] = lj_ir_knum(J, (lua_Number)(uint32_t)ct->size);\r\n\telse\r\n\t  J->base[0] = lj_ir_kint(J, (int32_t)ct->size);\r\n      } else if (ctype_isextern(ct->info)) {\r\n\tCTypeID sid = ctype_cid(ct->info);\r\n\tvoid *sp = *(void **)cdataptr(cdataV(tv));\r\n\tTRef ptr;\r\n\tct = ctype_raw(cts, sid);\r\n\tif (LJ_64 && !checkptr32(sp))\r\n\t  ptr = lj_ir_kintp(J, (uintptr_t)sp);\r\n\telse\r\n\t  ptr = lj_ir_kptr(J, sp);\r\n\tif (rd->data) {\r\n\t  J->base[0] = crec_tv_ct(J, ct, sid, ptr);\r\n\t} else {\r\n\t  J->needsnap = 1;\r\n\t  crec_ct_tv(J, ct, ptr, J->base[2], &rd->argv[2]);\r\n\t}\r\n      } else {\r\n\tJ->base[0] = lj_ir_kgc(J, obj2gco(cdataV(tv)), IRT_CDATA);\r\n      }\r\n    } else {\r\n      lj_trace_err(J, LJ_TRERR_NOCACHE);\r\n    }\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\n/* -- FFI library functions ----------------------------------------------- */\r\n\r\nstatic TRef crec_toint(jit_State *J, CTState *cts, TRef sp, TValue *sval)\r\n{\r\n  return crec_ct_tv(J, ctype_get(cts, CTID_INT32), 0, sp, sval);\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_new(jit_State *J, RecordFFData *rd)\r\n{\r\n  crec_alloc(J, rd, argv2ctype(J, J->base[0], &rd->argv[0]));\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_errno(jit_State *J, RecordFFData *rd)\r\n{\r\n  UNUSED(rd);\r\n  if (J->base[0])\r\n    lj_trace_err(J, LJ_TRERR_NYICALL);\r\n  J->base[0] = lj_ir_call(J, IRCALL_lj_vm_errno);\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_string(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    TRef trlen = J->base[1];\r\n    if (!tref_isnil(trlen)) {\r\n      trlen = crec_toint(J, cts, trlen, &rd->argv[1]);\r\n      tr = crec_ct_tv(J, ctype_get(cts, CTID_P_CVOID), 0, tr, &rd->argv[0]);\r\n    } else {\r\n      tr = crec_ct_tv(J, ctype_get(cts, CTID_P_CCHAR), 0, tr, &rd->argv[0]);\r\n      trlen = lj_ir_call(J, IRCALL_strlen, tr);\r\n    }\r\n    J->base[0] = emitir(IRT(IR_XSNEW, IRT_STR), tr, trlen);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_copy(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef trdst = J->base[0], trsrc = J->base[1], trlen = J->base[2];\r\n  if (trdst && trsrc && (trlen || tref_isstr(trsrc))) {\r\n    trdst = crec_ct_tv(J, ctype_get(cts, CTID_P_VOID), 0, trdst, &rd->argv[0]);\r\n    trsrc = crec_ct_tv(J, ctype_get(cts, CTID_P_CVOID), 0, trsrc, &rd->argv[1]);\r\n    if (trlen) {\r\n      trlen = crec_toint(J, cts, trlen, &rd->argv[2]);\r\n    } else {\r\n      trlen = emitir(IRTI(IR_FLOAD), J->base[1], IRFL_STR_LEN);\r\n      trlen = emitir(IRTI(IR_ADD), trlen, lj_ir_kint(J, 1));\r\n    }\r\n    rd->nres = 0;\r\n    crec_copy(J, trdst, trsrc, trlen, NULL);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_fill(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef trdst = J->base[0], trlen = J->base[1], trfill = J->base[2];\r\n  if (trdst && trlen) {\r\n    CTSize step = 1;\r\n    if (tviscdata(&rd->argv[0])) {  /* Get alignment of original destination. */\r\n      CTSize sz;\r\n      CType *ct = ctype_raw(cts, cdataV(&rd->argv[0])->ctypeid);\r\n      if (ctype_isptr(ct->info))\r\n\tct = ctype_rawchild(cts, ct);\r\n      step = (1u<<ctype_align(lj_ctype_info(cts, ctype_typeid(cts, ct), &sz)));\r\n    }\r\n    trdst = crec_ct_tv(J, ctype_get(cts, CTID_P_VOID), 0, trdst, &rd->argv[0]);\r\n    trlen = crec_toint(J, cts, trlen, &rd->argv[1]);\r\n    if (trfill)\r\n      trfill = crec_toint(J, cts, trfill, &rd->argv[2]);\r\n    else\r\n      trfill = lj_ir_kint(J, 0);\r\n    rd->nres = 0;\r\n    crec_fill(J, trdst, trlen, trfill, step);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_typeof(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (tref_iscdata(J->base[0])) {\r\n    TRef trid = lj_ir_kint(J, argv2ctype(J, J->base[0], &rd->argv[0]));\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA),\r\n\t\t\tlj_ir_kint(J, CTID_CTYPEID), trid);\r\n  } else {\r\n    setfuncV(J->L, &J->errinfo, J->fn);\r\n    lj_trace_err_info(J, LJ_TRERR_NYIFFU);\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_istype(jit_State *J, RecordFFData *rd)\r\n{\r\n  argv2ctype(J, J->base[0], &rd->argv[0]);\r\n  if (tref_iscdata(J->base[1])) {\r\n    argv2ctype(J, J->base[1], &rd->argv[1]);\r\n    J->postproc = LJ_POST_FIXBOOL;\r\n    J->base[0] = TREF_TRUE;\r\n  } else {\r\n    J->base[0] = TREF_FALSE;\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_abi(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (tref_isstr(J->base[0])) {\r\n    /* Specialize to the ABI string to make the boolean result a constant. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[0], lj_ir_kstr(J, strV(&rd->argv[0])));\r\n    J->postproc = LJ_POST_FIXBOOL;\r\n    J->base[0] = TREF_TRUE;\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n}\r\n\r\n/* Record ffi.sizeof(), ffi.alignof(), ffi.offsetof(). */\r\nvoid LJ_FASTCALL recff_ffi_xof(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTypeID id = argv2ctype(J, J->base[0], &rd->argv[0]);\r\n  if (rd->data == FF_ffi_sizeof) {\r\n    CType *ct = lj_ctype_rawref(ctype_ctsG(J2G(J)), id);\r\n    if (ctype_isvltype(ct->info))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  } else if (rd->data == FF_ffi_offsetof) {  /* Specialize to the field name. */\r\n    if (!tref_isstr(J->base[1]))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, strV(&rd->argv[1])));\r\n    rd->nres = 3;  /* Just in case. */\r\n  }\r\n  J->postproc = LJ_POST_FIXCONST;\r\n  J->base[0] = J->base[1] = J->base[2] = TREF_NIL;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_gc(jit_State *J, RecordFFData *rd)\r\n{\r\n  argv2cdata(J, J->base[0], &rd->argv[0]);\r\n  crec_finalizer(J, J->base[0], &rd->argv[1]);\r\n}\r\n\r\n/* -- Miscellaneous library functions ------------------------------------- */\r\n\r\nvoid LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *d, *ct = lj_ctype_rawref(cts, cdataV(&rd->argv[0])->ctypeid);\r\n  if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n  if (ctype_isnum(ct->info) || ctype_iscomplex(ct->info)) {\r\n    if (ctype_isinteger_or_bool(ct->info) && ct->size <= 4 &&\r\n\t!(ct->size == 4 && (ct->info & CTF_UNSIGNED)))\r\n      d = ctype_get(cts, CTID_INT32);\r\n    else\r\n      d = ctype_get(cts, CTID_DOUBLE);\r\n    J->base[0] = crec_ct_tv(J, d, 0, J->base[0], &rd->argv[0]);\r\n  } else {\r\n    J->base[0] = TREF_NIL;\r\n  }\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n#undef emitconv\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_crecord.h",
    "content": "/*\r\n** Trace recorder for C data operations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CRECORD_H\r\n#define _LJ_CRECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ffrecord.h\"\r\n\r\n#if LJ_HASJIT && LJ_HASFFI\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_index(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_call(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_arith(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_clib_index(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_new(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_errno(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_string(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_copy(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_fill(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_typeof(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_istype(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_abi(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_xof(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_gc(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ctype.c",
    "content": "/*\r\n** C type management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_ccallback.h\"\r\n\r\n/* -- C type definitions -------------------------------------------------- */\r\n\r\n/* Predefined typedefs. */\r\n#define CTTDDEF(_) \\\r\n  /* Vararg handling. */ \\\r\n  _(\"va_list\",\t\t\tP_VOID) \\\r\n  _(\"__builtin_va_list\",\tP_VOID) \\\r\n  _(\"__gnuc_va_list\",\t\tP_VOID) \\\r\n  /* From stddef.h. */ \\\r\n  _(\"ptrdiff_t\",\t\tINT_PSZ) \\\r\n  _(\"size_t\",\t\t\tUINT_PSZ) \\\r\n  _(\"wchar_t\",\t\t\tWCHAR) \\\r\n  /* Subset of stdint.h. */ \\\r\n  _(\"int8_t\",\t\t\tINT8) \\\r\n  _(\"int16_t\",\t\t\tINT16) \\\r\n  _(\"int32_t\",\t\t\tINT32) \\\r\n  _(\"int64_t\",\t\t\tINT64) \\\r\n  _(\"uint8_t\",\t\t\tUINT8) \\\r\n  _(\"uint16_t\",\t\t\tUINT16) \\\r\n  _(\"uint32_t\",\t\t\tUINT32) \\\r\n  _(\"uint64_t\",\t\t\tUINT64) \\\r\n  _(\"intptr_t\",\t\t\tINT_PSZ) \\\r\n  _(\"uintptr_t\",\t\tUINT_PSZ) \\\r\n  /* End of typedef list. */\r\n\r\n/* Keywords (only the ones we actually care for). */\r\n#define CTKWDEF(_) \\\r\n  /* Type specifiers. */ \\\r\n  _(\"void\",\t\t-1,\tCTOK_VOID) \\\r\n  _(\"_Bool\",\t\t0,\tCTOK_BOOL) \\\r\n  _(\"bool\",\t\t1,\tCTOK_BOOL) \\\r\n  _(\"char\",\t\t1,\tCTOK_CHAR) \\\r\n  _(\"int\",\t\t4,\tCTOK_INT) \\\r\n  _(\"__int8\",\t\t1,\tCTOK_INT) \\\r\n  _(\"__int16\",\t\t2,\tCTOK_INT) \\\r\n  _(\"__int32\",\t\t4,\tCTOK_INT) \\\r\n  _(\"__int64\",\t\t8,\tCTOK_INT) \\\r\n  _(\"float\",\t\t4,\tCTOK_FP) \\\r\n  _(\"double\",\t\t8,\tCTOK_FP) \\\r\n  _(\"long\",\t\t0,\tCTOK_LONG) \\\r\n  _(\"short\",\t\t0,\tCTOK_SHORT) \\\r\n  _(\"_Complex\",\t\t0,\tCTOK_COMPLEX) \\\r\n  _(\"complex\",\t\t0,\tCTOK_COMPLEX) \\\r\n  _(\"__complex\",\t0,\tCTOK_COMPLEX) \\\r\n  _(\"__complex__\",\t0,\tCTOK_COMPLEX) \\\r\n  _(\"signed\",\t\t0,\tCTOK_SIGNED) \\\r\n  _(\"__signed\",\t\t0,\tCTOK_SIGNED) \\\r\n  _(\"__signed__\",\t0,\tCTOK_SIGNED) \\\r\n  _(\"unsigned\",\t\t0,\tCTOK_UNSIGNED) \\\r\n  /* Type qualifiers. */ \\\r\n  _(\"const\",\t\t0,\tCTOK_CONST) \\\r\n  _(\"__const\",\t\t0,\tCTOK_CONST) \\\r\n  _(\"__const__\",\t0,\tCTOK_CONST) \\\r\n  _(\"volatile\",\t\t0,\tCTOK_VOLATILE) \\\r\n  _(\"__volatile\",\t0,\tCTOK_VOLATILE) \\\r\n  _(\"__volatile__\",\t0,\tCTOK_VOLATILE) \\\r\n  _(\"restrict\",\t\t0,\tCTOK_RESTRICT) \\\r\n  _(\"__restrict\",\t0,\tCTOK_RESTRICT) \\\r\n  _(\"__restrict__\",\t0,\tCTOK_RESTRICT) \\\r\n  _(\"inline\",\t\t0,\tCTOK_INLINE) \\\r\n  _(\"__inline\",\t\t0,\tCTOK_INLINE) \\\r\n  _(\"__inline__\",\t0,\tCTOK_INLINE) \\\r\n  /* Storage class specifiers. */ \\\r\n  _(\"typedef\",\t\t0,\tCTOK_TYPEDEF) \\\r\n  _(\"extern\",\t\t0,\tCTOK_EXTERN) \\\r\n  _(\"static\",\t\t0,\tCTOK_STATIC) \\\r\n  _(\"auto\",\t\t0,\tCTOK_AUTO) \\\r\n  _(\"register\",\t\t0,\tCTOK_REGISTER) \\\r\n  /* GCC Attributes. */ \\\r\n  _(\"__extension__\",\t0,\tCTOK_EXTENSION) \\\r\n  _(\"__attribute\",\t0,\tCTOK_ATTRIBUTE) \\\r\n  _(\"__attribute__\",\t0,\tCTOK_ATTRIBUTE) \\\r\n  _(\"asm\",\t\t0,\tCTOK_ASM) \\\r\n  _(\"__asm\",\t\t0,\tCTOK_ASM) \\\r\n  _(\"__asm__\",\t\t0,\tCTOK_ASM) \\\r\n  /* MSVC Attributes. */ \\\r\n  _(\"__declspec\",\t0,\tCTOK_DECLSPEC) \\\r\n  _(\"__cdecl\",\t\tCTCC_CDECL,\tCTOK_CCDECL) \\\r\n  _(\"__thiscall\",\tCTCC_THISCALL,\tCTOK_CCDECL) \\\r\n  _(\"__fastcall\",\tCTCC_FASTCALL,\tCTOK_CCDECL) \\\r\n  _(\"__stdcall\",\tCTCC_STDCALL,\tCTOK_CCDECL) \\\r\n  _(\"__ptr32\",\t\t4,\tCTOK_PTRSZ) \\\r\n  _(\"__ptr64\",\t\t8,\tCTOK_PTRSZ) \\\r\n  /* Other type specifiers. */ \\\r\n  _(\"struct\",\t\t0,\tCTOK_STRUCT) \\\r\n  _(\"union\",\t\t0,\tCTOK_UNION) \\\r\n  _(\"enum\",\t\t0,\tCTOK_ENUM) \\\r\n  /* Operators. */ \\\r\n  _(\"sizeof\",\t\t0,\tCTOK_SIZEOF) \\\r\n  _(\"__alignof\",\t0,\tCTOK_ALIGNOF) \\\r\n  _(\"__alignof__\",\t0,\tCTOK_ALIGNOF) \\\r\n  /* End of keyword list. */\r\n\r\n/* Type info for predefined types. Size merged in. */\r\nstatic CTInfo lj_ctype_typeinfo[] = {\r\n#define CTTYINFODEF(id, sz, ct, info)\tCTINFO((ct),(((sz)&0x3fu)<<10)+(info)),\r\n#define CTTDINFODEF(name, id)\t\tCTINFO(CT_TYPEDEF, CTID_##id),\r\n#define CTKWINFODEF(name, sz, kw)\tCTINFO(CT_KW,(((sz)&0x3fu)<<10)+(kw)),\r\nCTTYDEF(CTTYINFODEF)\r\nCTTDDEF(CTTDINFODEF)\r\nCTKWDEF(CTKWINFODEF)\r\n#undef CTTYINFODEF\r\n#undef CTTDINFODEF\r\n#undef CTKWINFODEF\r\n  0\r\n};\r\n\r\n/* Predefined type names collected in a single string. */\r\nstatic const char * const lj_ctype_typenames =\r\n#define CTTDNAMEDEF(name, id)\t\tname \"\\0\"\r\n#define CTKWNAMEDEF(name, sz, cds)\tname \"\\0\"\r\nCTTDDEF(CTTDNAMEDEF)\r\nCTKWDEF(CTKWNAMEDEF)\r\n#undef CTTDNAMEDEF\r\n#undef CTKWNAMEDEF\r\n;\r\n\r\n#define CTTYPEINFO_NUM\t\t(sizeof(lj_ctype_typeinfo)/sizeof(CTInfo)-1)\r\n#ifdef LUAJIT_CTYPE_CHECK_ANCHOR\r\n#define CTTYPETAB_MIN\t\tCTTYPEINFO_NUM\r\n#else\r\n#define CTTYPETAB_MIN\t\t128\r\n#endif\r\n\r\n/* -- C type interning ---------------------------------------------------- */\r\n\r\n#define ct_hashtype(info, size)\t(hashrot(info, size) & CTHASH_MASK)\r\n#define ct_hashname(name) \\\r\n  (hashrot(u32ptr(name), u32ptr(name) + HASH_BIAS) & CTHASH_MASK)\r\n\r\n/* Create new type element. */\r\nCTypeID lj_ctype_new(CTState *cts, CType **ctp)\r\n{\r\n  CTypeID id = cts->top;\r\n  CType *ct;\r\n  lua_assert(cts->L);\r\n  if (LJ_UNLIKELY(id >= cts->sizetab)) {\r\n    if (id >= CTID_MAX) lj_err_msg(cts->L, LJ_ERR_TABOV);\r\n#ifdef LUAJIT_CTYPE_CHECK_ANCHOR\r\n    ct = lj_mem_newvec(cts->L, id+1, CType);\r\n    memcpy(ct, cts->tab, id*sizeof(CType));\r\n    memset(cts->tab, 0, id*sizeof(CType));\r\n    lj_mem_freevec(cts->g, cts->tab, cts->sizetab, CType);\r\n    cts->tab = ct;\r\n    cts->sizetab = id+1;\r\n#else\r\n    lj_mem_growvec(cts->L, cts->tab, cts->sizetab, CTID_MAX, CType);\r\n#endif\r\n  }\r\n  cts->top = id+1;\r\n  *ctp = ct = &cts->tab[id];\r\n  ct->info = 0;\r\n  ct->size = 0;\r\n  ct->sib = 0;\r\n  ct->next = 0;\r\n  setgcrefnull(ct->name);\r\n  return id;\r\n}\r\n\r\n/* Intern a type element. */\r\nCTypeID lj_ctype_intern(CTState *cts, CTInfo info, CTSize size)\r\n{\r\n  uint32_t h = ct_hashtype(info, size);\r\n  CTypeID id = cts->hash[h];\r\n  lua_assert(cts->L);\r\n  while (id) {\r\n    CType *ct = ctype_get(cts, id);\r\n    if (ct->info == info && ct->size == size)\r\n      return id;\r\n    id = ct->next;\r\n  }\r\n  id = cts->top;\r\n  if (LJ_UNLIKELY(id >= cts->sizetab)) {\r\n    if (id >= CTID_MAX) lj_err_msg(cts->L, LJ_ERR_TABOV);\r\n    lj_mem_growvec(cts->L, cts->tab, cts->sizetab, CTID_MAX, CType);\r\n  }\r\n  cts->top = id+1;\r\n  cts->tab[id].info = info;\r\n  cts->tab[id].size = size;\r\n  cts->tab[id].sib = 0;\r\n  cts->tab[id].next = cts->hash[h];\r\n  setgcrefnull(cts->tab[id].name);\r\n  cts->hash[h] = (CTypeID1)id;\r\n  return id;\r\n}\r\n\r\n/* Add type element to hash table. */\r\nstatic void ctype_addtype(CTState *cts, CType *ct, CTypeID id)\r\n{\r\n  uint32_t h = ct_hashtype(ct->info, ct->size);\r\n  ct->next = cts->hash[h];\r\n  cts->hash[h] = (CTypeID1)id;\r\n}\r\n\r\n/* Add named element to hash table. */\r\nvoid lj_ctype_addname(CTState *cts, CType *ct, CTypeID id)\r\n{\r\n  uint32_t h = ct_hashname(gcref(ct->name));\r\n  ct->next = cts->hash[h];\r\n  cts->hash[h] = (CTypeID1)id;\r\n}\r\n\r\n/* Get a C type by name, matching the type mask. */\r\nCTypeID lj_ctype_getname(CTState *cts, CType **ctp, GCstr *name, uint32_t tmask)\r\n{\r\n  CTypeID id = cts->hash[ct_hashname(name)];\r\n  while (id) {\r\n    CType *ct = ctype_get(cts, id);\r\n    if (gcref(ct->name) == obj2gco(name) &&\r\n\t((tmask >> ctype_type(ct->info)) & 1)) {\r\n      *ctp = ct;\r\n      return id;\r\n    }\r\n    id = ct->next;\r\n  }\r\n  *ctp = &cts->tab[0];  /* Simplify caller logic. ctype_get() would assert. */\r\n  return 0;\r\n}\r\n\r\n/* Get a struct/union/enum/function field by name. */\r\nCType *lj_ctype_getfieldq(CTState *cts, CType *ct, GCstr *name, CTSize *ofs,\r\n\t\t\t  CTInfo *qual)\r\n{\r\n  while (ct->sib) {\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (gcref(ct->name) == obj2gco(name)) {\r\n      *ofs = ct->size;\r\n      return ct;\r\n    }\r\n    if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      CType *fct, *cct = ctype_child(cts, ct);\r\n      CTInfo q = 0;\r\n      while (ctype_isattrib(cct->info)) {\r\n\tif (ctype_attrib(cct->info) == CTA_QUAL) q |= cct->size;\r\n\tcct = ctype_child(cts, cct);\r\n      }\r\n      fct = lj_ctype_getfieldq(cts, cct, name, ofs, qual);\r\n      if (fct) {\r\n\tif (qual) *qual |= q;\r\n\t*ofs += ct->size;\r\n\treturn fct;\r\n      }\r\n    }\r\n  }\r\n  return NULL;  /* Not found. */\r\n}\r\n\r\n/* -- C type information -------------------------------------------------- */\r\n\r\n/* Follow references and get raw type for a C type ID. */\r\nCType *lj_ctype_rawref(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  while (ctype_isattrib(ct->info) || ctype_isref(ct->info))\r\n    ct = ctype_child(cts, ct);\r\n  return ct;\r\n}\r\n\r\n/* Get size for a C type ID. Does NOT support VLA/VLS. */\r\nCTSize lj_ctype_size(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_raw(cts, id);\r\n  return ctype_hassize(ct->info) ? ct->size : CTSIZE_INVALID;\r\n}\r\n\r\n/* Get size for a variable-length C type. Does NOT support other C types. */\r\nCTSize lj_ctype_vlsize(CTState *cts, CType *ct, CTSize nelem)\r\n{\r\n  uint64_t xsz = 0;\r\n  if (ctype_isstruct(ct->info)) {\r\n    CTypeID arrid = 0, fid = ct->sib;\r\n    xsz = ct->size;  /* Add the struct size. */\r\n    while (fid) {\r\n      CType *ctf = ctype_get(cts, fid);\r\n      if (ctype_type(ctf->info) == CT_FIELD)\r\n\tarrid = ctype_cid(ctf->info);  /* Remember last field of VLS. */\r\n      fid = ctf->sib;\r\n    }\r\n    ct = ctype_raw(cts, arrid);\r\n  }\r\n  lua_assert(ctype_isvlarray(ct->info));  /* Must be a VLA. */\r\n  ct = ctype_rawchild(cts, ct);  /* Get array element. */\r\n  lua_assert(ctype_hassize(ct->info));\r\n  /* Calculate actual size of VLA and check for overflow. */\r\n  xsz += (uint64_t)ct->size * nelem;\r\n  return xsz < 0x80000000u ? (CTSize)xsz : CTSIZE_INVALID;\r\n}\r\n\r\n/* Get type, qualifiers, size and alignment for a C type ID. */\r\nCTInfo lj_ctype_info(CTState *cts, CTypeID id, CTSize *szp)\r\n{\r\n  CTInfo qual = 0;\r\n  CType *ct = ctype_get(cts, id);\r\n  for (;;) {\r\n    CTInfo info = ct->info;\r\n    if (ctype_isenum(info)) {\r\n      /* Follow child. Need to look at its attributes, too. */\r\n    } else if (ctype_isattrib(info)) {\r\n      if (ctype_isxattrib(info, CTA_QUAL))\r\n\tqual |= ct->size;\r\n      else if (ctype_isxattrib(info, CTA_ALIGN) && !(qual & CTFP_ALIGNED))\r\n\tqual |= CTFP_ALIGNED + CTALIGN(ct->size);\r\n    } else {\r\n      if (!(qual & CTFP_ALIGNED)) qual |= (info & CTF_ALIGN);\r\n      qual |= (info & ~(CTF_ALIGN|CTMASK_CID));\r\n      lua_assert(ctype_hassize(info) || ctype_isfunc(info));\r\n      *szp = ctype_isfunc(info) ? CTSIZE_INVALID : ct->size;\r\n      break;\r\n    }\r\n    ct = ctype_get(cts, ctype_cid(info));\r\n  }\r\n  return qual;\r\n}\r\n\r\n/* Get ctype metamethod. */\r\ncTValue *lj_ctype_meta(CTState *cts, CTypeID id, MMS mm)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  cTValue *tv;\r\n  while (ctype_isattrib(ct->info) || ctype_isref(ct->info)) {\r\n    id = ctype_cid(ct->info);\r\n    ct = ctype_get(cts, id);\r\n  }\r\n  if (ctype_isptr(ct->info) &&\r\n      ctype_isfunc(ctype_get(cts, ctype_cid(ct->info))->info))\r\n    tv = lj_tab_getstr(cts->miscmap, &cts->g->strempty);\r\n  else\r\n    tv = lj_tab_getinth(cts->miscmap, -(int32_t)id);\r\n  if (tv && tvistab(tv) &&\r\n      (tv = lj_tab_getstr(tabV(tv), mmname_str(cts->g, mm))) && !tvisnil(tv))\r\n    return tv;\r\n  return NULL;\r\n}\r\n\r\n/* -- C type representation ----------------------------------------------- */\r\n\r\n/* Fixed max. length of a C type representation. */\r\n#define CTREPR_MAX\t\t512\r\n\r\ntypedef struct CTRepr {\r\n  char *pb, *pe;\r\n  CTState *cts;\r\n  lua_State *L;\r\n  int needsp;\r\n  int ok;\r\n  char buf[CTREPR_MAX];\r\n} CTRepr;\r\n\r\n/* Prepend string. */\r\nstatic void ctype_prepstr(CTRepr *ctr, const char *str, MSize len)\r\n{\r\n  char *p = ctr->pb;\r\n  if (ctr->buf + len+1 > p) { ctr->ok = 0; return; }\r\n  if (ctr->needsp) *--p = ' ';\r\n  ctr->needsp = 1;\r\n  p -= len;\r\n  while (len-- > 0) p[len] = str[len];\r\n  ctr->pb = p;\r\n}\r\n\r\n#define ctype_preplit(ctr, str)\tctype_prepstr((ctr), \"\" str, sizeof(str)-1)\r\n\r\n/* Prepend char. */\r\nstatic void ctype_prepc(CTRepr *ctr, int c)\r\n{\r\n  if (ctr->buf >= ctr->pb) { ctr->ok = 0; return; }\r\n  *--ctr->pb = c;\r\n}\r\n\r\n/* Prepend number. */\r\nstatic void ctype_prepnum(CTRepr *ctr, uint32_t n)\r\n{\r\n  char *p = ctr->pb;\r\n  if (ctr->buf + 10+1 > p) { ctr->ok = 0; return; }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  ctr->pb = p;\r\n  ctr->needsp = 0;\r\n}\r\n\r\n/* Append char. */\r\nstatic void ctype_appc(CTRepr *ctr, int c)\r\n{\r\n  if (ctr->pe >= ctr->buf + CTREPR_MAX) { ctr->ok = 0; return; }\r\n  *ctr->pe++ = c;\r\n}\r\n\r\n/* Append number. */\r\nstatic void ctype_appnum(CTRepr *ctr, uint32_t n)\r\n{\r\n  char buf[10];\r\n  char *p = buf+sizeof(buf);\r\n  char *q = ctr->pe;\r\n  if (q > ctr->buf + CTREPR_MAX - 10) { ctr->ok = 0; return; }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  do { *q++ = *p++; } while (p < buf+sizeof(buf));\r\n  ctr->pe = q;\r\n}\r\n\r\n/* Prepend qualifiers. */\r\nstatic void ctype_prepqual(CTRepr *ctr, CTInfo info)\r\n{\r\n  if ((info & CTF_VOLATILE)) ctype_preplit(ctr, \"volatile\");\r\n  if ((info & CTF_CONST)) ctype_preplit(ctr, \"const\");\r\n}\r\n\r\n/* Prepend named type. */\r\nstatic void ctype_preptype(CTRepr *ctr, CType *ct, CTInfo qual, const char *t)\r\n{\r\n  if (gcref(ct->name)) {\r\n    GCstr *str = gco2str(gcref(ct->name));\r\n    ctype_prepstr(ctr, strdata(str), str->len);\r\n  } else {\r\n    if (ctr->needsp) ctype_prepc(ctr, ' ');\r\n    ctype_prepnum(ctr, ctype_typeid(ctr->cts, ct));\r\n    ctr->needsp = 1;\r\n  }\r\n  ctype_prepstr(ctr, t, (MSize)strlen(t));\r\n  ctype_prepqual(ctr, qual);\r\n}\r\n\r\nstatic void ctype_repr(CTRepr *ctr, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(ctr->cts, id);\r\n  CTInfo qual = 0;\r\n  int ptrto = 0;\r\n  for (;;) {\r\n    CTInfo info = ct->info;\r\n    CTSize size = ct->size;\r\n    switch (ctype_type(info)) {\r\n    case CT_NUM:\r\n      if ((info & CTF_BOOL)) {\r\n\tctype_preplit(ctr, \"bool\");\r\n      } else if ((info & CTF_FP)) {\r\n\tif (size == sizeof(double)) ctype_preplit(ctr, \"double\");\r\n\telse if (size == sizeof(float)) ctype_preplit(ctr, \"float\");\r\n\telse ctype_preplit(ctr, \"long double\");\r\n      } else if (size == 1) {\r\n\tif (!((info ^ CTF_UCHAR) & CTF_UNSIGNED)) ctype_preplit(ctr, \"char\");\r\n\telse if (CTF_UCHAR) ctype_preplit(ctr, \"signed char\");\r\n\telse ctype_preplit(ctr, \"unsigned char\");\r\n      } else if (size < 8) {\r\n\tif (size == 4) ctype_preplit(ctr, \"int\");\r\n\telse ctype_preplit(ctr, \"short\");\r\n\tif ((info & CTF_UNSIGNED)) ctype_preplit(ctr, \"unsigned\");\r\n      } else {\r\n\tctype_preplit(ctr, \"_t\");\r\n\tctype_prepnum(ctr, size*8);\r\n\tctype_preplit(ctr, \"int\");\r\n\tif ((info & CTF_UNSIGNED)) ctype_prepc(ctr, 'u');\r\n      }\r\n      ctype_prepqual(ctr, (qual|info));\r\n      return;\r\n    case CT_VOID:\r\n      ctype_preplit(ctr, \"void\");\r\n      ctype_prepqual(ctr, (qual|info));\r\n      return;\r\n    case CT_STRUCT:\r\n      ctype_preptype(ctr, ct, qual, (info & CTF_UNION) ? \"union\" : \"struct\");\r\n      return;\r\n    case CT_ENUM:\r\n      if (id == CTID_CTYPEID) {\r\n\tctype_preplit(ctr, \"ctype\");\r\n\treturn;\r\n      }\r\n      ctype_preptype(ctr, ct, qual, \"enum\");\r\n      return;\r\n    case CT_ATTRIB:\r\n      if (ctype_attrib(info) == CTA_QUAL) qual |= size;\r\n      break;\r\n    case CT_PTR:\r\n      if ((info & CTF_REF)) {\r\n\tctype_prepc(ctr, '&');\r\n      } else {\r\n\tctype_prepqual(ctr, (qual|info));\r\n\tif (LJ_64 && size == 4) ctype_preplit(ctr, \"__ptr32\");\r\n\tctype_prepc(ctr, '*');\r\n      }\r\n      qual = 0;\r\n      ptrto = 1;\r\n      ctr->needsp = 1;\r\n      break;\r\n    case CT_ARRAY:\r\n      if (ctype_isrefarray(info)) {\r\n\tctr->needsp = 1;\r\n\tif (ptrto) { ptrto = 0; ctype_prepc(ctr, '('); ctype_appc(ctr, ')'); }\r\n\tctype_appc(ctr, '[');\r\n\tif (size != CTSIZE_INVALID) {\r\n\t  CTSize csize = ctype_child(ctr->cts, ct)->size;\r\n\t  ctype_appnum(ctr, csize ? size/csize : 0);\r\n\t} else if ((info & CTF_VLA)) {\r\n\t  ctype_appc(ctr, '?');\r\n\t}\r\n\tctype_appc(ctr, ']');\r\n      } else if ((info & CTF_COMPLEX)) {\r\n\tif (size == 2*sizeof(float)) ctype_preplit(ctr, \"float\");\r\n\tctype_preplit(ctr, \"complex\");\r\n\treturn;\r\n      } else {\r\n\tctype_preplit(ctr, \")))\");\r\n\tctype_prepnum(ctr, size);\r\n\tctype_preplit(ctr, \"__attribute__((vector_size(\");\r\n      }\r\n      break;\r\n    case CT_FUNC:\r\n      ctr->needsp = 1;\r\n      if (ptrto) { ptrto = 0; ctype_prepc(ctr, '('); ctype_appc(ctr, ')'); }\r\n      ctype_appc(ctr, '(');\r\n      ctype_appc(ctr, ')');\r\n      break;\r\n    default:\r\n      lua_assert(0);\r\n      break;\r\n    }\r\n    ct = ctype_get(ctr->cts, ctype_cid(info));\r\n  }\r\n}\r\n\r\n/* Return a printable representation of a C type. */\r\nGCstr *lj_ctype_repr(lua_State *L, CTypeID id, GCstr *name)\r\n{\r\n  global_State *g = G(L);\r\n  CTRepr ctr;\r\n  ctr.pb = ctr.pe = &ctr.buf[CTREPR_MAX/2];\r\n  ctr.cts = ctype_ctsG(g);\r\n  ctr.L = L;\r\n  ctr.ok = 1;\r\n  ctr.needsp = 0;\r\n  if (name) ctype_prepstr(&ctr, strdata(name), name->len);\r\n  ctype_repr(&ctr, id);\r\n  if (LJ_UNLIKELY(!ctr.ok)) return lj_str_newlit(L, \"?\");\r\n  return lj_str_new(L, ctr.pb, ctr.pe - ctr.pb);\r\n}\r\n\r\n/* Convert int64_t/uint64_t to string with 'LL' or 'ULL' suffix. */\r\nGCstr *lj_ctype_repr_int64(lua_State *L, uint64_t n, int isunsigned)\r\n{\r\n  char buf[1+20+3];\r\n  char *p = buf+sizeof(buf);\r\n  int sign = 0;\r\n  *--p = 'L'; *--p = 'L';\r\n  if (isunsigned) {\r\n    *--p = 'U';\r\n  } else if ((int64_t)n < 0) {\r\n    n = (uint64_t)-(int64_t)n;\r\n    sign = 1;\r\n  }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  if (sign) *--p = '-';\r\n  return lj_str_new(L, p, (size_t)(buf+sizeof(buf)-p));\r\n}\r\n\r\n/* Convert complex to string with 'i' or 'I' suffix. */\r\nGCstr *lj_ctype_repr_complex(lua_State *L, void *sp, CTSize size)\r\n{\r\n  char buf[2*LJ_STR_NUMBUF+2+1];\r\n  TValue re, im;\r\n  size_t len;\r\n  if (size == 2*sizeof(double)) {\r\n    re.n = *(double *)sp; im.n = ((double *)sp)[1];\r\n  } else {\r\n    re.n = (double)*(float *)sp; im.n = (double)((float *)sp)[1];\r\n  }\r\n  len = lj_str_bufnum(buf, &re);\r\n  if (!(im.u32.hi & 0x80000000u) || im.n != im.n) buf[len++] = '+';\r\n  len += lj_str_bufnum(buf+len, &im);\r\n  buf[len] = buf[len-1] >= 'a' ? 'I' : 'i';\r\n  return lj_str_new(L, buf, len+1);\r\n}\r\n\r\n/* -- C type state -------------------------------------------------------- */\r\n\r\n/* Initialize C type table and state. */\r\nCTState *lj_ctype_init(lua_State *L)\r\n{\r\n  CTState *cts = lj_mem_newt(L, sizeof(CTState), CTState);\r\n  CType *ct = lj_mem_newvec(L, CTTYPETAB_MIN, CType);\r\n  const char *name = lj_ctype_typenames;\r\n  CTypeID id;\r\n  memset(cts, 0, sizeof(CTState));\r\n  cts->tab = ct;\r\n  cts->sizetab = CTTYPETAB_MIN;\r\n  cts->top = CTTYPEINFO_NUM;\r\n  cts->L = NULL;\r\n  cts->g = G(L);\r\n  for (id = 0; id < CTTYPEINFO_NUM; id++, ct++) {\r\n    CTInfo info = lj_ctype_typeinfo[id];\r\n    ct->size = (CTSize)((int32_t)(info << 16) >> 26);\r\n    ct->info = info & 0xffff03ffu;\r\n    ct->sib = 0;\r\n    if (ctype_type(info) == CT_KW || ctype_istypedef(info)) {\r\n      size_t len = strlen(name);\r\n      GCstr *str = lj_str_new(L, name, len);\r\n      ctype_setname(ct, str);\r\n      name += len+1;\r\n      lj_ctype_addname(cts, ct, id);\r\n    } else {\r\n      setgcrefnull(ct->name);\r\n      ct->next = 0;\r\n      if (!ctype_isenum(info)) ctype_addtype(cts, ct, id);\r\n    }\r\n  }\r\n  setmref(G(L)->ctype_state, cts);\r\n  return cts;\r\n}\r\n\r\n/* Free C type table and state. */\r\nvoid lj_ctype_freestate(global_State *g)\r\n{\r\n  CTState *cts = ctype_ctsG(g);\r\n  if (cts) {\r\n    lj_ccallback_mcode_free(cts);\r\n    lj_mem_freevec(g, cts->tab, cts->sizetab, CType);\r\n    lj_mem_freevec(g, cts->cb.cbid, cts->cb.sizeid, CTypeID1);\r\n    lj_mem_freet(g, cts);\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ctype.h",
    "content": "/*\r\n** C type management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CTYPE_H\r\n#define _LJ_CTYPE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* -- C type definitions -------------------------------------------------- */\r\n\r\n/* C type numbers. Highest 4 bits of C type info. ORDER CT. */\r\nenum {\r\n  /* Externally visible types. */\r\n  CT_NUM,\t\t/* Integer or floating-point numbers. */\r\n  CT_STRUCT,\t\t/* Struct or union. */\r\n  CT_PTR,\t\t/* Pointer or reference. */\r\n  CT_ARRAY,\t\t/* Array or complex type. */\r\n  CT_MAYCONVERT = CT_ARRAY,\r\n  CT_VOID,\t\t/* Void type. */\r\n  CT_ENUM,\t\t/* Enumeration. */\r\n  CT_HASSIZE = CT_ENUM,  /* Last type where ct->size holds the actual size. */\r\n  CT_FUNC,\t\t/* Function. */\r\n  CT_TYPEDEF,\t\t/* Typedef. */\r\n  CT_ATTRIB,\t\t/* Miscellaneous attributes. */\r\n  /* Internal element types. */\r\n  CT_FIELD,\t\t/* Struct/union field or function parameter. */\r\n  CT_BITFIELD,\t\t/* Struct/union bitfield. */\r\n  CT_CONSTVAL,\t\t/* Constant value. */\r\n  CT_EXTERN,\t\t/* External reference. */\r\n  CT_KW\t\t\t/* Keyword. */\r\n};\r\n\r\nLJ_STATIC_ASSERT(((int)CT_PTR & (int)CT_ARRAY) == CT_PTR);\r\nLJ_STATIC_ASSERT(((int)CT_STRUCT & (int)CT_ARRAY) == CT_STRUCT);\r\n\r\n/*\r\n**  ---------- info ------------\r\n** |type      flags...  A   cid | size   |  sib  | next  | name  |\r\n** +----------------------------+--------+-------+-------+-------+--\r\n** |NUM       BFvcUL..  A       | size   |       | type  |       |\r\n** |STRUCT    ..vcU..V  A       | size   | field | name? | name? |\r\n** |PTR       ..vcR...  A   cid | size   |       | type  |       |\r\n** |ARRAY     VCvc...V  A   cid | size   |       | type  |       |\r\n** |VOID      ..vc....  A       | size   |       | type  |       |\r\n** |ENUM                A   cid | size   | const | name? | name? |\r\n** |FUNC      ....VS.. cc   cid | nargs  | field | name? | name? |\r\n** |TYPEDEF                 cid |        |       | name  | name  |\r\n** |ATTRIB        attrnum   cid | attr   | sib?  | type? |       |\r\n** |FIELD                   cid | offset | field |       | name? |\r\n** |BITFIELD  B.vcU csz bsz pos | offset | field |       | name? |\r\n** |CONSTVAL     c          cid | value  | const | name  | name  |\r\n** |EXTERN                  cid |        | sib?  | name  | name  |\r\n** |KW                      tok | size   |       | name  | name  |\r\n** +----------------------------+--------+-------+-------+-------+--\r\n**        ^^  ^^--- bits used for C type conversion dispatch\r\n*/\r\n\r\n/* C type info flags.     TFFArrrr  */\r\n#define CTF_BOOL\t0x08000000u\t/* Boolean: NUM, BITFIELD. */\r\n#define CTF_FP\t\t0x04000000u\t/* Floating-point: NUM. */\r\n#define CTF_CONST\t0x02000000u\t/* Const qualifier. */\r\n#define CTF_VOLATILE\t0x01000000u\t/* Volatile qualifier. */\r\n#define CTF_UNSIGNED\t0x00800000u\t/* Unsigned: NUM, BITFIELD. */\r\n#define CTF_LONG\t0x00400000u\t/* Long: NUM. */\r\n#define CTF_VLA\t\t0x00100000u\t/* Variable-length: ARRAY, STRUCT. */\r\n#define CTF_REF\t\t0x00800000u\t/* Reference: PTR. */\r\n#define CTF_VECTOR\t0x08000000u\t/* Vector: ARRAY. */\r\n#define CTF_COMPLEX\t0x04000000u\t/* Complex: ARRAY. */\r\n#define CTF_UNION\t0x00800000u\t/* Union: STRUCT. */\r\n#define CTF_VARARG\t0x00800000u\t/* Vararg: FUNC. */\r\n#define CTF_SSEREGPARM\t0x00400000u\t/* SSE register parameters: FUNC. */\r\n\r\n#define CTF_QUAL\t(CTF_CONST|CTF_VOLATILE)\r\n#define CTF_ALIGN\t(CTMASK_ALIGN<<CTSHIFT_ALIGN)\r\n#define CTF_UCHAR\t((char)-1 > 0 ? CTF_UNSIGNED : 0)\r\n\r\n/* Flags used in parser.  .F.Ammvf   cp->attr  */\r\n#define CTFP_ALIGNED\t0x00000001u\t/* cp->attr + ALIGN */\r\n#define CTFP_PACKED\t0x00000002u\t/* cp->attr */\r\n/*                        ...C...f   cp->fattr */\r\n#define CTFP_CCONV\t0x00000001u\t/* cp->fattr + CCONV/[SSE]REGPARM */\r\n\r\n/* C type info bitfields. */\r\n#define CTMASK_CID\t0x0000ffffu\t/* Max. 65536 type IDs. */\r\n#define CTMASK_NUM\t0xf0000000u\t/* Max. 16 type numbers. */\r\n#define CTSHIFT_NUM\t28\r\n#define CTMASK_ALIGN\t15\t\t/* Max. alignment is 2^15. */\r\n#define CTSHIFT_ALIGN\t16\r\n#define CTMASK_ATTRIB\t255\t\t/* Max. 256 attributes. */\r\n#define CTSHIFT_ATTRIB\t16\r\n#define CTMASK_CCONV\t3\t\t/* Max. 4 calling conventions. */\r\n#define CTSHIFT_CCONV\t16\r\n#define CTMASK_REGPARM\t3\t\t/* Max. 0-3 regparms. */\r\n#define CTSHIFT_REGPARM\t18\r\n/* Bitfields only used in parser. */\r\n#define CTMASK_VSIZEP\t15\t\t/* Max. vector size is 2^15. */\r\n#define CTSHIFT_VSIZEP\t4\r\n#define CTMASK_MSIZEP\t255\t\t/* Max. type size (via mode) is 128. */\r\n#define CTSHIFT_MSIZEP\t8\r\n\r\n/* Info bits for BITFIELD. Max. size of bitfield is 64 bits. */\r\n#define CTBSZ_MAX\t32\t\t/* Max. size of bitfield is 32 bit. */\r\n#define CTBSZ_FIELD\t127\t\t/* Temp. marker for regular field. */\r\n#define CTMASK_BITPOS\t127\r\n#define CTMASK_BITBSZ\t127\r\n#define CTMASK_BITCSZ\t127\r\n#define CTSHIFT_BITPOS\t0\r\n#define CTSHIFT_BITBSZ\t8\r\n#define CTSHIFT_BITCSZ\t16\r\n\r\n#define CTF_INSERT(info, field, val) \\\r\n  info = (info & ~(CTMASK_##field<<CTSHIFT_##field)) | \\\r\n\t  (((CTSize)(val) & CTMASK_##field) << CTSHIFT_##field)\r\n\r\n/* Calling conventions. ORDER CC */\r\nenum { CTCC_CDECL, CTCC_THISCALL, CTCC_FASTCALL, CTCC_STDCALL };\r\n\r\n/* Attribute numbers. */\r\nenum {\r\n  CTA_NONE,\t\t/* Ignored attribute. Must be zero. */\r\n  CTA_QUAL,\t\t/* Unmerged qualifiers. */\r\n  CTA_ALIGN,\t\t/* Alignment override. */\r\n  CTA_SUBTYPE,\t\t/* Transparent sub-type. */\r\n  CTA_REDIR,\t\t/* Redirected symbol name. */\r\n  CTA_BAD,\t\t/* To catch bad IDs. */\r\n  CTA__MAX\r\n};\r\n\r\n/* Special sizes. */\r\n#define CTSIZE_INVALID\t0xffffffffu\r\n\r\ntypedef uint32_t CTInfo;\t/* Type info. */\r\ntypedef uint32_t CTSize;\t/* Type size. */\r\ntypedef uint32_t CTypeID;\t/* Type ID. */\r\ntypedef uint16_t CTypeID1;\t/* Minimum-sized type ID. */\r\n\r\n/* C type table element. */\r\ntypedef struct CType {\r\n  CTInfo info;\t\t/* Type info. */\r\n  CTSize size;\t\t/* Type size or other info. */\r\n  CTypeID1 sib;\t\t/* Sibling element. */\r\n  CTypeID1 next;\t/* Next element in hash chain. */\r\n  GCRef name;\t\t/* Element name (GCstr). */\r\n} CType;\r\n\r\n#define CTHASH_SIZE\t128\t/* Number of hash anchors. */\r\n#define CTHASH_MASK\t(CTHASH_SIZE-1)\r\n\r\n/* Simplify target-specific configuration. Checked in lj_ccall.h. */\r\n#define CCALL_MAX_GPR\t\t8\r\n#define CCALL_MAX_FPR\t\t8\r\n\r\ntypedef LJ_ALIGN(8) union FPRCBArg { double d; float f[2]; } FPRCBArg;\r\n\r\n/* C callback state. Defined here, to avoid dragging in lj_ccall.h. */\r\n\r\ntypedef LJ_ALIGN(8) struct CCallback {\r\n  FPRCBArg fpr[CCALL_MAX_FPR];\t/* Arguments/results in FPRs. */\r\n  intptr_t gpr[CCALL_MAX_GPR];\t/* Arguments/results in GPRs. */\r\n  intptr_t *stack;\t\t/* Pointer to arguments on stack. */\r\n  void *mcode;\t\t\t/* Machine code for callback func. pointers. */\r\n  CTypeID1 *cbid;\t\t/* Callback type table. */\r\n  MSize sizeid;\t\t\t/* Size of callback type table. */\r\n  MSize topid;\t\t\t/* Highest unused callback type table slot. */\r\n  MSize slot;\t\t\t/* Current callback slot. */\r\n} CCallback;\r\n\r\n/* C type state. */\r\ntypedef struct CTState {\r\n  CType *tab;\t\t/* C type table. */\r\n  CTypeID top;\t\t/* Current top of C type table. */\r\n  MSize sizetab;\t/* Size of C type table. */\r\n  lua_State *L;\t\t/* Lua state (needed for errors and allocations). */\r\n  global_State *g;\t/* Global state. */\r\n  GCtab *finalizer;\t/* Map of cdata to finalizer. */\r\n  GCtab *miscmap;\t/* Map of -CTypeID to metatable and cb slot to func. */\r\n  CCallback cb;\t\t/* Temporary callback state. */\r\n  CTypeID1 hash[CTHASH_SIZE];  /* Hash anchors for C type table. */\r\n} CTState;\r\n\r\n#define CTINFO(ct, flags)\t(((CTInfo)(ct) << CTSHIFT_NUM) + (flags))\r\n#define CTALIGN(al)\t\t((CTSize)(al) << CTSHIFT_ALIGN)\r\n#define CTATTRIB(at)\t\t((CTInfo)(at) << CTSHIFT_ATTRIB)\r\n\r\n#define ctype_type(info)\t((info) >> CTSHIFT_NUM)\r\n#define ctype_cid(info)\t\t((CTypeID)((info) & CTMASK_CID))\r\n#define ctype_align(info)\t(((info) >> CTSHIFT_ALIGN) & CTMASK_ALIGN)\r\n#define ctype_attrib(info)\t(((info) >> CTSHIFT_ATTRIB) & CTMASK_ATTRIB)\r\n#define ctype_bitpos(info)\t(((info) >> CTSHIFT_BITPOS) & CTMASK_BITPOS)\r\n#define ctype_bitbsz(info)\t(((info) >> CTSHIFT_BITBSZ) & CTMASK_BITBSZ)\r\n#define ctype_bitcsz(info)\t(((info) >> CTSHIFT_BITCSZ) & CTMASK_BITCSZ)\r\n#define ctype_vsizeP(info)\t(((info) >> CTSHIFT_VSIZEP) & CTMASK_VSIZEP)\r\n#define ctype_msizeP(info)\t(((info) >> CTSHIFT_MSIZEP) & CTMASK_MSIZEP)\r\n#define ctype_cconv(info)\t(((info) >> CTSHIFT_CCONV) & CTMASK_CCONV)\r\n\r\n/* Simple type checks. */\r\n#define ctype_isnum(info)\t(ctype_type((info)) == CT_NUM)\r\n#define ctype_isvoid(info)\t(ctype_type((info)) == CT_VOID)\r\n#define ctype_isptr(info)\t(ctype_type((info)) == CT_PTR)\r\n#define ctype_isarray(info)\t(ctype_type((info)) == CT_ARRAY)\r\n#define ctype_isstruct(info)\t(ctype_type((info)) == CT_STRUCT)\r\n#define ctype_isfunc(info)\t(ctype_type((info)) == CT_FUNC)\r\n#define ctype_isenum(info)\t(ctype_type((info)) == CT_ENUM)\r\n#define ctype_istypedef(info)\t(ctype_type((info)) == CT_TYPEDEF)\r\n#define ctype_isattrib(info)\t(ctype_type((info)) == CT_ATTRIB)\r\n#define ctype_isfield(info)\t(ctype_type((info)) == CT_FIELD)\r\n#define ctype_isbitfield(info)\t(ctype_type((info)) == CT_BITFIELD)\r\n#define ctype_isconstval(info)\t(ctype_type((info)) == CT_CONSTVAL)\r\n#define ctype_isextern(info)\t(ctype_type((info)) == CT_EXTERN)\r\n#define ctype_hassize(info)\t(ctype_type((info)) <= CT_HASSIZE)\r\n\r\n/* Combined type and flag checks. */\r\n#define ctype_isinteger(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_BOOL|CTF_FP)) == CTINFO(CT_NUM, 0))\r\n#define ctype_isinteger_or_bool(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_FP)) == CTINFO(CT_NUM, 0))\r\n#define ctype_isbool(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_BOOL)) == CTINFO(CT_NUM, CTF_BOOL))\r\n#define ctype_isfp(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_FP)) == CTINFO(CT_NUM, CTF_FP))\r\n\r\n#define ctype_ispointer(info) \\\r\n  ((ctype_type(info) >> 1) == (CT_PTR >> 1))  /* Pointer or array. */\r\n#define ctype_isref(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_REF)) == CTINFO(CT_PTR, CTF_REF))\r\n\r\n#define ctype_isrefarray(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VECTOR|CTF_COMPLEX)) == CTINFO(CT_ARRAY, 0))\r\n#define ctype_isvector(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VECTOR)) == CTINFO(CT_ARRAY, CTF_VECTOR))\r\n#define ctype_iscomplex(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_COMPLEX)) == CTINFO(CT_ARRAY, CTF_COMPLEX))\r\n\r\n#define ctype_isvltype(info) \\\r\n  (((info) & ((CTMASK_NUM|CTF_VLA) - (2u<<CTSHIFT_NUM))) == \\\r\n   CTINFO(CT_STRUCT, CTF_VLA))  /* VL array or VL struct. */\r\n#define ctype_isvlarray(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VLA)) == CTINFO(CT_ARRAY, CTF_VLA))\r\n\r\n#define ctype_isxattrib(info, at) \\\r\n  (((info) & (CTMASK_NUM|CTATTRIB(CTMASK_ATTRIB))) == \\\r\n   CTINFO(CT_ATTRIB, CTATTRIB(at)))\r\n\r\n/* Target-dependent sizes and alignments. */\r\n#if LJ_64\r\n#define CTSIZE_PTR\t8\r\n#define CTALIGN_PTR\tCTALIGN(3)\r\n#else\r\n#define CTSIZE_PTR\t4\r\n#define CTALIGN_PTR\tCTALIGN(2)\r\n#endif\r\n\r\n#define CTINFO_REF(ref) \\\r\n  CTINFO(CT_PTR, (CTF_CONST|CTF_REF|CTALIGN_PTR) + (ref))\r\n\r\n#define CT_MEMALIGN\t3\t/* Alignment guaranteed by memory allocator. */\r\n\r\n/* -- Predefined types ---------------------------------------------------- */\r\n\r\n/* Target-dependent types. */\r\n#if LJ_TARGET_PPC || LJ_TARGET_PPCSPE\r\n#define CTTYDEFP(_) \\\r\n  _(LINT32,\t\t4,\tCT_NUM, CTF_LONG|CTALIGN(2))\r\n#else\r\n#define CTTYDEFP(_)\r\n#endif\r\n\r\n/* Common types. */\r\n#define CTTYDEF(_) \\\r\n  _(NONE,\t\t0,\tCT_ATTRIB, CTATTRIB(CTA_BAD)) \\\r\n  _(VOID,\t\t-1,\tCT_VOID, CTALIGN(0)) \\\r\n  _(CVOID,\t\t-1,\tCT_VOID, CTF_CONST|CTALIGN(0)) \\\r\n  _(BOOL,\t\t1,\tCT_NUM, CTF_BOOL|CTF_UNSIGNED|CTALIGN(0)) \\\r\n  _(CCHAR,\t\t1,\tCT_NUM, CTF_CONST|CTF_UCHAR|CTALIGN(0)) \\\r\n  _(INT8,\t\t1,\tCT_NUM, CTALIGN(0)) \\\r\n  _(UINT8,\t\t1,\tCT_NUM, CTF_UNSIGNED|CTALIGN(0)) \\\r\n  _(INT16,\t\t2,\tCT_NUM, CTALIGN(1)) \\\r\n  _(UINT16,\t\t2,\tCT_NUM, CTF_UNSIGNED|CTALIGN(1)) \\\r\n  _(INT32,\t\t4,\tCT_NUM, CTALIGN(2)) \\\r\n  _(UINT32,\t\t4,\tCT_NUM, CTF_UNSIGNED|CTALIGN(2)) \\\r\n  _(INT64,\t\t8,\tCT_NUM, CTF_LONG|CTALIGN(3)) \\\r\n  _(UINT64,\t\t8,\tCT_NUM, CTF_UNSIGNED|CTF_LONG|CTALIGN(3)) \\\r\n  _(FLOAT,\t\t4,\tCT_NUM, CTF_FP|CTALIGN(2)) \\\r\n  _(DOUBLE,\t\t8,\tCT_NUM, CTF_FP|CTALIGN(3)) \\\r\n  _(COMPLEX_FLOAT,\t8,\tCT_ARRAY, CTF_COMPLEX|CTALIGN(2)|CTID_FLOAT) \\\r\n  _(COMPLEX_DOUBLE,\t16,\tCT_ARRAY, CTF_COMPLEX|CTALIGN(3)|CTID_DOUBLE) \\\r\n  _(P_VOID,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_VOID) \\\r\n  _(P_CVOID,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_CVOID) \\\r\n  _(P_CCHAR,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_CCHAR) \\\r\n  _(A_CCHAR,\t\t-1,\tCT_ARRAY, CTF_CONST|CTALIGN(0)|CTID_CCHAR) \\\r\n  _(CTYPEID,\t\t4,\tCT_ENUM, CTALIGN(2)|CTID_INT32) \\\r\n  CTTYDEFP(_) \\\r\n  /* End of type list. */\r\n\r\n/* Public predefined type IDs. */\r\nenum {\r\n#define CTTYIDDEF(id, sz, ct, info)\tCTID_##id,\r\nCTTYDEF(CTTYIDDEF)\r\n#undef CTTYIDDEF\r\n  /* Predefined typedefs and keywords follow. */\r\n  CTID_MAX = 65536\r\n};\r\n\r\n/* Target-dependent type IDs. */\r\n#if LJ_64\r\n#define CTID_INT_PSZ\tCTID_INT64\r\n#define CTID_UINT_PSZ\tCTID_UINT64\r\n#else\r\n#define CTID_INT_PSZ\tCTID_INT32\r\n#define CTID_UINT_PSZ\tCTID_UINT32\r\n#endif\r\n\r\n#if LJ_ABI_WIN\r\n#define CTID_WCHAR\tCTID_UINT16\r\n#elif LJ_TARGET_PPC\r\n#define CTID_WCHAR\tCTID_LINT32\r\n#else\r\n#define CTID_WCHAR\tCTID_INT32\r\n#endif\r\n\r\n/* -- C tokens and keywords ----------------------------------------------- */\r\n\r\n/* C lexer keywords. */\r\n#define CTOKDEF(_) \\\r\n  _(IDENT, \"<identifier>\") _(STRING, \"<string>\") \\\r\n  _(INTEGER, \"<integer>\") _(EOF, \"<eof>\") \\\r\n  _(OROR, \"||\") _(ANDAND, \"&&\") _(EQ, \"==\") _(NE, \"!=\") \\\r\n  _(LE, \"<=\") _(GE, \">=\") _(SHL, \"<<\") _(SHR, \">>\") _(DEREF, \"->\")\r\n\r\n/* Simple declaration specifiers. */\r\n#define CDSDEF(_) \\\r\n  _(VOID) _(BOOL) _(CHAR) _(INT) _(FP) \\\r\n  _(LONG) _(LONGLONG) _(SHORT) _(COMPLEX) _(SIGNED) _(UNSIGNED) \\\r\n  _(CONST) _(VOLATILE) _(RESTRICT) _(INLINE) \\\r\n  _(TYPEDEF) _(EXTERN) _(STATIC) _(AUTO) _(REGISTER)\r\n\r\n/* C keywords. */\r\n#define CKWDEF(_) \\\r\n  CDSDEF(_) _(EXTENSION) _(ASM) _(ATTRIBUTE) \\\r\n  _(DECLSPEC) _(CCDECL) _(PTRSZ) \\\r\n  _(STRUCT) _(UNION) _(ENUM) \\\r\n  _(SIZEOF) _(ALIGNOF)\r\n\r\n/* C token numbers. */\r\nenum {\r\n  CTOK_OFS = 255,\r\n#define CTOKNUM(name, sym)\tCTOK_##name,\r\n#define CKWNUM(name)\t\tCTOK_##name,\r\nCTOKDEF(CTOKNUM)\r\nCKWDEF(CKWNUM)\r\n#undef CTOKNUM\r\n#undef CKWNUM\r\n  CTOK_FIRSTDECL = CTOK_VOID,\r\n  CTOK_FIRSTSCL = CTOK_TYPEDEF,\r\n  CTOK_LASTDECLFLAG = CTOK_REGISTER,\r\n  CTOK_LASTDECL = CTOK_ENUM\r\n};\r\n\r\n/* Declaration specifier flags. */\r\nenum {\r\n#define CDSFLAG(name)\tCDF_##name = (1u << (CTOK_##name - CTOK_FIRSTDECL)),\r\nCDSDEF(CDSFLAG)\r\n#undef CDSFLAG\r\n  CDF__END\r\n};\r\n\r\n#define CDF_SCL  (CDF_TYPEDEF|CDF_EXTERN|CDF_STATIC|CDF_AUTO|CDF_REGISTER)\r\n\r\n/* -- C type management --------------------------------------------------- */\r\n\r\n#define ctype_ctsG(g)\t\t(mref((g)->ctype_state, CTState))\r\n\r\n/* Get C type state. */\r\nstatic LJ_AINLINE CTState *ctype_cts(lua_State *L)\r\n{\r\n  CTState *cts = ctype_ctsG(G(L));\r\n  cts->L = L;  /* Save L for errors and allocations. */\r\n  return cts;\r\n}\r\n\r\n/* Save and restore state of C type table. */\r\n#define LJ_CTYPE_SAVE(cts)\tCTState savects_ = *(cts)\r\n#define LJ_CTYPE_RESTORE(cts) \\\r\n  ((cts)->top = savects_.top, \\\r\n   memcpy((cts)->hash, savects_.hash, sizeof(savects_.hash)))\r\n\r\n/* Check C type ID for validity when assertions are enabled. */\r\nstatic LJ_AINLINE CTypeID ctype_check(CTState *cts, CTypeID id)\r\n{\r\n  lua_assert(id > 0 && id < cts->top); UNUSED(cts);\r\n  return id;\r\n}\r\n\r\n/* Get C type for C type ID. */\r\nstatic LJ_AINLINE CType *ctype_get(CTState *cts, CTypeID id)\r\n{\r\n  return &cts->tab[ctype_check(cts, id)];\r\n}\r\n\r\n/* Get C type ID for a C type. */\r\n#define ctype_typeid(cts, ct)\t((CTypeID)((ct) - (cts)->tab))\r\n\r\n/* Get child C type. */\r\nstatic LJ_AINLINE CType *ctype_child(CTState *cts, CType *ct)\r\n{\r\n  lua_assert(!(ctype_isvoid(ct->info) || ctype_isstruct(ct->info) ||\r\n\t     ctype_isbitfield(ct->info)));  /* These don't have children. */\r\n  return ctype_get(cts, ctype_cid(ct->info));\r\n}\r\n\r\n/* Get raw type for a C type ID. */\r\nstatic LJ_AINLINE CType *ctype_raw(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  while (ctype_isattrib(ct->info)) ct = ctype_child(cts, ct);\r\n  return ct;\r\n}\r\n\r\n/* Get raw type of the child of a C type. */\r\nstatic LJ_AINLINE CType *ctype_rawchild(CTState *cts, CType *ct)\r\n{\r\n  do { ct = ctype_child(cts, ct); } while (ctype_isattrib(ct->info));\r\n  return ct;\r\n}\r\n\r\n/* Set the name of a C type table element. */\r\nstatic LJ_AINLINE void ctype_setname(CType *ct, GCstr *s)\r\n{\r\n  /* NOBARRIER: mark string as fixed -- the C type table is never collected. */\r\n  fixstring(s);\r\n  setgcref(ct->name, obj2gco(s));\r\n}\r\n\r\nLJ_FUNC CTypeID lj_ctype_new(CTState *cts, CType **ctp);\r\nLJ_FUNC CTypeID lj_ctype_intern(CTState *cts, CTInfo info, CTSize size);\r\nLJ_FUNC void lj_ctype_addname(CTState *cts, CType *ct, CTypeID id);\r\nLJ_FUNC CTypeID lj_ctype_getname(CTState *cts, CType **ctp, GCstr *name,\r\n\t\t\t\t uint32_t tmask);\r\nLJ_FUNC CType *lj_ctype_getfieldq(CTState *cts, CType *ct, GCstr *name,\r\n\t\t\t\t  CTSize *ofs, CTInfo *qual);\r\n#define lj_ctype_getfield(cts, ct, name, ofs) \\\r\n  lj_ctype_getfieldq((cts), (ct), (name), (ofs), NULL)\r\nLJ_FUNC CType *lj_ctype_rawref(CTState *cts, CTypeID id);\r\nLJ_FUNC CTSize lj_ctype_size(CTState *cts, CTypeID id);\r\nLJ_FUNC CTSize lj_ctype_vlsize(CTState *cts, CType *ct, CTSize nelem);\r\nLJ_FUNC CTInfo lj_ctype_info(CTState *cts, CTypeID id, CTSize *szp);\r\nLJ_FUNC cTValue *lj_ctype_meta(CTState *cts, CTypeID id, MMS mm);\r\nLJ_FUNC GCstr *lj_ctype_repr(lua_State *L, CTypeID id, GCstr *name);\r\nLJ_FUNC GCstr *lj_ctype_repr_int64(lua_State *L, uint64_t n, int isunsigned);\r\nLJ_FUNC GCstr *lj_ctype_repr_complex(lua_State *L, void *sp, CTSize size);\r\nLJ_FUNC CTState *lj_ctype_init(lua_State *L);\r\nLJ_FUNC void lj_ctype_freestate(global_State *g);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_debug.c",
    "content": "/*\r\n** Debugging and introspection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_debug_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_vm.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n\r\n/* -- Frames -------------------------------------------------------------- */\r\n\r\n/* Get frame corresponding to a level. */\r\ncTValue *lj_debug_frame(lua_State *L, int level, int *size)\r\n{\r\n  cTValue *frame, *nextframe, *bot = tvref(L->stack);\r\n  /* Traverse frames backwards. */\r\n  for (nextframe = frame = L->base-1; frame > bot; ) {\r\n    if (frame_gc(frame) == obj2gco(L))\r\n      level++;  /* Skip dummy frames. See lj_meta_call(). */\r\n    if (level-- == 0) {\r\n      *size = (int)(nextframe - frame);\r\n      return frame;  /* Level found. */\r\n    }\r\n    nextframe = frame;\r\n    if (frame_islua(frame)) {\r\n      frame = frame_prevl(frame);\r\n    } else {\r\n      if (frame_isvarg(frame))\r\n\tlevel++;  /* Skip vararg pseudo-frame. */\r\n      frame = frame_prevd(frame);\r\n    }\r\n  }\r\n  *size = level;\r\n  return NULL;  /* Level not found. */\r\n}\r\n\r\n/* Invalid bytecode position. */\r\n#define NO_BCPOS\t(~(BCPos)0)\r\n\r\n/* Return bytecode position for function/frame or NO_BCPOS. */\r\nstatic BCPos debug_framepc(lua_State *L, GCfunc *fn, cTValue *nextframe)\r\n{\r\n  const BCIns *ins;\r\n  GCproto *pt;\r\n  BCPos pos;\r\n  lua_assert(fn->c.gct == ~LJ_TFUNC || fn->c.gct == ~LJ_TTHREAD);\r\n  if (!isluafunc(fn)) {  /* Cannot derive a PC for non-Lua functions. */\r\n    return NO_BCPOS;\r\n  } else if (nextframe == NULL) {  /* Lua function on top. */\r\n    void *cf = cframe_raw(L->cframe);\r\n    if (cf == NULL || (char *)cframe_pc(cf) == (char *)cframe_L(cf))\r\n      return NO_BCPOS;\r\n    ins = cframe_pc(cf);  /* Only happens during error/hook handling. */\r\n  } else {\r\n    if (frame_islua(nextframe)) {\r\n      ins = frame_pc(nextframe);\r\n    } else if (frame_iscont(nextframe)) {\r\n      ins = frame_contpc(nextframe);\r\n    } else {\r\n      /* Lua function below errfunc/gc/hook: find cframe to get the PC. */\r\n      void *cf = cframe_raw(L->cframe);\r\n      TValue *f = L->base-1;\r\n      for (;;) {\r\n\tif (cf == NULL)\r\n\t  return NO_BCPOS;\r\n\twhile (cframe_nres(cf) < 0) {\r\n\t  if (f >= restorestack(L, -cframe_nres(cf)))\r\n\t    break;\r\n\t  cf = cframe_raw(cframe_prev(cf));\r\n\t  if (cf == NULL)\r\n\t    return NO_BCPOS;\r\n\t}\r\n\tif (f < nextframe)\r\n\t  break;\r\n\tif (frame_islua(f)) {\r\n\t  f = frame_prevl(f);\r\n\t} else {\r\n\t  if (frame_isc(f) || (LJ_HASFFI && frame_iscont(f) &&\r\n\t\t\t       (f-1)->u32.lo == LJ_CONT_FFI_CALLBACK))\r\n\t    cf = cframe_raw(cframe_prev(cf));\r\n\t  f = frame_prevd(f);\r\n\t}\r\n      }\r\n      ins = cframe_pc(cf);\r\n    }\r\n  }\r\n  pt = funcproto(fn);\r\n  pos = proto_bcpos(pt, ins) - 1;\r\n#if LJ_HASJIT\r\n  if (pos > pt->sizebc) {  /* Undo the effects of lj_trace_exit for JLOOP. */\r\n    GCtrace *T = (GCtrace *)((char *)(ins-1) - offsetof(GCtrace, startins));\r\n    lua_assert(bc_isret(bc_op(ins[-1])));\r\n    pos = proto_bcpos(pt, mref(T->startpc, const BCIns));\r\n  }\r\n#endif\r\n  return pos;\r\n}\r\n\r\n/* -- Line numbers -------------------------------------------------------- */\r\n\r\n/* Get line number for a bytecode position. */\r\nBCLine LJ_FASTCALL lj_debug_line(GCproto *pt, BCPos pc)\r\n{\r\n  const void *lineinfo = proto_lineinfo(pt);\r\n  if (pc <= pt->sizebc && lineinfo) {\r\n    BCLine first = pt->firstline;\r\n    if (pc == pt->sizebc) return first + pt->numline;\r\n    if (pc-- == 0) return first;\r\n    if (pt->numline < 256)\r\n      return first + (BCLine)((const uint8_t *)lineinfo)[pc];\r\n    else if (pt->numline < 65536)\r\n      return first + (BCLine)((const uint16_t *)lineinfo)[pc];\r\n    else\r\n      return first + (BCLine)((const uint32_t *)lineinfo)[pc];\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Get line number for function/frame. */\r\nstatic BCLine debug_frameline(lua_State *L, GCfunc *fn, cTValue *nextframe)\r\n{\r\n  BCPos pc = debug_framepc(L, fn, nextframe);\r\n  if (pc != NO_BCPOS) {\r\n    GCproto *pt = funcproto(fn);\r\n    lua_assert(pc <= pt->sizebc);\r\n    return lj_debug_line(pt, pc);\r\n  }\r\n  return -1;\r\n}\r\n\r\n/* -- Variable names ------------------------------------------------------ */\r\n\r\n/* Read ULEB128 value. */\r\nstatic uint32_t debug_read_uleb128(const uint8_t **pp)\r\n{\r\n  const uint8_t *p = *pp;\r\n  uint32_t v = *p++;\r\n  if (LJ_UNLIKELY(v >= 0x80)) {\r\n    int sh = 0;\r\n    v &= 0x7f;\r\n    do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80);\r\n  }\r\n  *pp = p;\r\n  return v;\r\n}\r\n\r\n/* Get name of a local variable from slot number and PC. */\r\nstatic const char *debug_varname(const GCproto *pt, BCPos pc, BCReg slot)\r\n{\r\n  const uint8_t *p = proto_varinfo(pt);\r\n  if (p) {\r\n    BCPos lastpc = 0;\r\n    for (;;) {\r\n      const char *name = (const char *)p;\r\n      uint32_t vn = *p++;\r\n      BCPos startpc, endpc;\r\n      if (vn < VARNAME__MAX) {\r\n\tif (vn == VARNAME_END) break;  /* End of varinfo. */\r\n      } else {\r\n\twhile (*p++) ;  /* Skip over variable name string. */\r\n      }\r\n      lastpc = startpc = lastpc + debug_read_uleb128(&p);\r\n      if (startpc > pc) break;\r\n      endpc = startpc + debug_read_uleb128(&p);\r\n      if (pc < endpc && slot-- == 0) {\r\n\tif (vn < VARNAME__MAX) {\r\n#define VARNAMESTR(name, str)\tstr \"\\0\"\r\n\t  name = VARNAMEDEF(VARNAMESTR);\r\n#undef VARNAMESTR\r\n\t  if (--vn) while (*name++ || --vn) ;\r\n\t}\r\n\treturn name;\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Get name of local variable from 1-based slot number and function/frame. */\r\nstatic TValue *debug_localname(lua_State *L, const lua_Debug *ar,\r\n\t\t\t       const char **name, BCReg slot1)\r\n{\r\n  uint32_t offset = (uint32_t)ar->i_ci & 0xffff;\r\n  uint32_t size = (uint32_t)ar->i_ci >> 16;\r\n  TValue *frame = tvref(L->stack) + offset;\r\n  TValue *nextframe = size ? frame + size : NULL;\r\n  GCfunc *fn = frame_func(frame);\r\n  BCPos pc = debug_framepc(L, fn, nextframe);\r\n  if (!nextframe) nextframe = L->top;\r\n  if ((int)slot1 < 0) {  /* Negative slot number is for varargs. */\r\n    if (pc != NO_BCPOS) {\r\n      GCproto *pt = funcproto(fn);\r\n      if ((pt->flags & PROTO_VARARG)) {\r\n\tslot1 = pt->numparams + (BCReg)(-(int)slot1);\r\n\tif (frame_isvarg(frame)) {  /* Vararg frame has been set up? (pc!=0) */\r\n\t  nextframe = frame;\r\n\t  frame = frame_prevd(frame);\r\n\t}\r\n\tif (frame + slot1 < nextframe) {\r\n\t  *name = \"(*vararg)\";\r\n\t  return frame+slot1;\r\n\t}\r\n      }\r\n    }\r\n    return NULL;\r\n  }\r\n  if (pc != NO_BCPOS &&\r\n      (*name = debug_varname(funcproto(fn), pc, slot1-1)) != NULL)\r\n    ;\r\n  else if (slot1 > 0 && frame + slot1 < nextframe)\r\n    *name = \"(*temporary)\";\r\n  return frame+slot1;\r\n}\r\n\r\n/* Get name of upvalue. */\r\nconst char *lj_debug_uvname(GCproto *pt, uint32_t idx)\r\n{\r\n  const uint8_t *p = proto_uvinfo(pt);\r\n  lua_assert(idx < pt->sizeuv);\r\n  if (!p) return \"\";\r\n  if (idx) while (*p++ || --idx) ;\r\n  return (const char *)p;\r\n}\r\n\r\n/* Get name and value of upvalue. */\r\nconst char *lj_debug_uvnamev(cTValue *o, uint32_t idx, TValue **tvp)\r\n{\r\n  if (tvisfunc(o)) {\r\n    GCfunc *fn = funcV(o);\r\n    if (isluafunc(fn)) {\r\n      GCproto *pt = funcproto(fn);\r\n      if (idx < pt->sizeuv) {\r\n\t*tvp = uvval(&gcref(fn->l.uvptr[idx])->uv);\r\n\treturn lj_debug_uvname(pt, idx);\r\n      }\r\n    } else {\r\n      if (idx < fn->c.nupvalues) {\r\n\t*tvp = &fn->c.upvalue[idx];\r\n\treturn \"\";\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Deduce name of an object from slot number and PC. */\r\nconst char *lj_debug_slotname(GCproto *pt, const BCIns *ip, BCReg slot,\r\n\t\t\t      const char **name)\r\n{\r\n  const char *lname;\r\nrestart:\r\n  lname = debug_varname(pt, proto_bcpos(pt, ip), slot);\r\n  if (lname != NULL) { *name = lname; return \"local\"; }\r\n  while (--ip > proto_bc(pt)) {\r\n    BCIns ins = *ip;\r\n    BCOp op = bc_op(ins);\r\n    BCReg ra = bc_a(ins);\r\n    if (bcmode_a(op) == BCMbase) {\r\n      if (slot >= ra && (op != BC_KNIL || slot <= bc_d(ins)))\r\n\treturn NULL;\r\n    } else if (bcmode_a(op) == BCMdst && ra == slot) {\r\n      switch (bc_op(ins)) {\r\n      case BC_MOV:\r\n\tif (ra == slot) { slot = bc_d(ins); goto restart; }\r\n\tbreak;\r\n      case BC_GGET:\r\n\t*name = strdata(gco2str(proto_kgc(pt, ~(ptrdiff_t)bc_d(ins))));\r\n\treturn \"global\";\r\n      case BC_TGETS:\r\n\t*name = strdata(gco2str(proto_kgc(pt, ~(ptrdiff_t)bc_c(ins))));\r\n\tif (ip > proto_bc(pt)) {\r\n\t  BCIns insp = ip[-1];\r\n\t  if (bc_op(insp) == BC_MOV && bc_a(insp) == ra+1 &&\r\n\t      bc_d(insp) == bc_b(ins))\r\n\t    return \"method\";\r\n\t}\r\n\treturn \"field\";\r\n      case BC_UGET:\r\n\t*name = lj_debug_uvname(pt, bc_d(ins));\r\n\treturn \"upvalue\";\r\n      default:\r\n\treturn NULL;\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Deduce function name from caller of a frame. */\r\nconst char *lj_debug_funcname(lua_State *L, TValue *frame, const char **name)\r\n{\r\n  TValue *pframe;\r\n  GCfunc *fn;\r\n  BCPos pc;\r\n  if (frame <= tvref(L->stack))\r\n    return NULL;\r\n  if (frame_isvarg(frame))\r\n    frame = frame_prevd(frame);\r\n  pframe = frame_prev(frame);\r\n  fn = frame_func(pframe);\r\n  pc = debug_framepc(L, fn, frame);\r\n  if (pc != NO_BCPOS) {\r\n    GCproto *pt = funcproto(fn);\r\n    const BCIns *ip = &proto_bc(pt)[check_exp(pc < pt->sizebc, pc)];\r\n    MMS mm = bcmode_mm(bc_op(*ip));\r\n    if (mm == MM_call) {\r\n      BCReg slot = bc_a(*ip);\r\n      if (bc_op(*ip) == BC_ITERC) slot -= 3;\r\n      return lj_debug_slotname(pt, ip, slot, name);\r\n    } else if (mm != MM__MAX) {\r\n      *name = strdata(mmname_str(G(L), mm));\r\n      return \"metamethod\";\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* -- Source code locations ----------------------------------------------- */\r\n\r\n/* Generate shortened source name. */\r\nvoid lj_debug_shortname(char *out, GCstr *str)\r\n{\r\n  const char *src = strdata(str);\r\n  if (*src == '=') {\r\n    strncpy(out, src+1, LUA_IDSIZE);  /* Remove first char. */\r\n    out[LUA_IDSIZE-1] = '\\0';  /* Ensures null termination. */\r\n  } else if (*src == '@') {  /* Output \"source\", or \"...source\". */\r\n    size_t len = str->len-1;\r\n    src++;  /* Skip the `@' */\r\n    if (len >= LUA_IDSIZE) {\r\n      src += len-(LUA_IDSIZE-4);  /* Get last part of file name. */\r\n      *out++ = '.'; *out++ = '.'; *out++ = '.';\r\n    }\r\n    strcpy(out, src);\r\n  } else {  /* Output [string \"string\"]. */\r\n    size_t len;  /* Length, up to first control char. */\r\n    for (len = 0; len < LUA_IDSIZE-12; len++)\r\n      if (((const unsigned char *)src)[len] < ' ') break;\r\n    strcpy(out, \"[string \\\"\"); out += 9;\r\n    if (src[len] != '\\0') {  /* Must truncate? */\r\n      if (len > LUA_IDSIZE-15) len = LUA_IDSIZE-15;\r\n      strncpy(out, src, len); out += len;\r\n      strcpy(out, \"...\"); out += 3;\r\n    } else {\r\n      strcpy(out, src); out += len;\r\n    }\r\n    strcpy(out, \"\\\"]\");\r\n  }\r\n}\r\n\r\n/* Add current location of a frame to error message. */\r\nvoid lj_debug_addloc(lua_State *L, const char *msg,\r\n\t\t     cTValue *frame, cTValue *nextframe)\r\n{\r\n  if (frame) {\r\n    GCfunc *fn = frame_func(frame);\r\n    if (isluafunc(fn)) {\r\n      BCLine line = debug_frameline(L, fn, nextframe);\r\n      if (line >= 0) {\r\n\tchar buf[LUA_IDSIZE];\r\n\tlj_debug_shortname(buf, proto_chunkname(funcproto(fn)));\r\n\tlj_str_pushf(L, \"%s:%d: %s\", buf, line, msg);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  lj_str_pushf(L, \"%s\", msg);\r\n}\r\n\r\n/* Push location string for a bytecode position to Lua stack. */\r\nvoid lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc)\r\n{\r\n  GCstr *name = proto_chunkname(pt);\r\n  const char *s = strdata(name);\r\n  MSize i, len = name->len;\r\n  BCLine line = lj_debug_line(pt, pc);\r\n  if (*s == '@') {\r\n    s++; len--;\r\n    for (i = len; i > 0; i--)\r\n      if (s[i] == '/' || s[i] == '\\\\') {\r\n\ts += i+1;\r\n\tbreak;\r\n      }\r\n    lj_str_pushf(L, \"%s:%d\", s, line);\r\n  } else if (len > 40) {\r\n    lj_str_pushf(L, \"%p:%d\", pt, line);\r\n  } else if (*s == '=') {\r\n    lj_str_pushf(L, \"%s:%d\", s+1, line);\r\n  } else {\r\n    lj_str_pushf(L, \"\\\"%s\\\":%d\", s, line);\r\n  }\r\n}\r\n\r\n/* -- Public debug API ---------------------------------------------------- */\r\n\r\n/* lua_getupvalue() and lua_setupvalue() are in lj_api.c. */\r\n\r\nLUA_API const char *lua_getlocal(lua_State *L, const lua_Debug *ar, int n)\r\n{\r\n  const char *name = NULL;\r\n  if (ar) {\r\n    TValue *o = debug_localname(L, ar, &name, (BCReg)n);\r\n    if (name) {\r\n      copyTV(L, L->top, o);\r\n      incr_top(L);\r\n    }\r\n  } else if (tvisfunc(L->top-1) && isluafunc(funcV(L->top-1))) {\r\n    name = debug_varname(funcproto(funcV(L->top-1)), 0, (BCReg)n-1);\r\n  }\r\n  return name;\r\n}\r\n\r\nLUA_API const char *lua_setlocal(lua_State *L, const lua_Debug *ar, int n)\r\n{\r\n  const char *name = NULL;\r\n  TValue *o = debug_localname(L, ar, &name, (BCReg)n);\r\n  if (name)\r\n    copyTV(L, o, L->top-1);\r\n  L->top--;\r\n  return name;\r\n}\r\n\r\nint lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar, int ext)\r\n{\r\n  int opt_f = 0, opt_L = 0;\r\n  TValue *frame = NULL;\r\n  TValue *nextframe = NULL;\r\n  GCfunc *fn;\r\n  if (*what == '>') {\r\n    TValue *func = L->top - 1;\r\n    api_check(L, tvisfunc(func));\r\n    fn = funcV(func);\r\n    L->top--;\r\n    what++;\r\n  } else {\r\n    uint32_t offset = (uint32_t)ar->i_ci & 0xffff;\r\n    uint32_t size = (uint32_t)ar->i_ci >> 16;\r\n    lua_assert(offset != 0);\r\n    frame = tvref(L->stack) + offset;\r\n    if (size) nextframe = frame + size;\r\n    lua_assert(frame <= tvref(L->maxstack) &&\r\n\t       (!nextframe || nextframe <= tvref(L->maxstack)));\r\n    fn = frame_func(frame);\r\n    lua_assert(fn->c.gct == ~LJ_TFUNC);\r\n  }\r\n  for (; *what; what++) {\r\n    if (*what == 'S') {\r\n      if (isluafunc(fn)) {\r\n\tGCproto *pt = funcproto(fn);\r\n\tBCLine firstline = pt->firstline;\r\n\tGCstr *name = proto_chunkname(pt);\r\n\tar->source = strdata(name);\r\n\tlj_debug_shortname(ar->short_src, name);\r\n\tar->linedefined = (int)firstline;\r\n\tar->lastlinedefined = (int)(firstline + pt->numline);\r\n\tar->what = (firstline || !pt->numline) ? \"Lua\" : \"main\";\r\n      } else {\r\n\tar->source = \"=[C]\";\r\n\tar->short_src[0] = '[';\r\n\tar->short_src[1] = 'C';\r\n\tar->short_src[2] = ']';\r\n\tar->short_src[3] = '\\0';\r\n\tar->linedefined = -1;\r\n\tar->lastlinedefined = -1;\r\n\tar->what = \"C\";\r\n      }\r\n    } else if (*what == 'l') {\r\n      ar->currentline = frame ? debug_frameline(L, fn, nextframe) : -1;\r\n    } else if (*what == 'u') {\r\n      ar->nups = fn->c.nupvalues;\r\n      if (ext) {\r\n\tif (isluafunc(fn)) {\r\n\t  GCproto *pt = funcproto(fn);\r\n\t  ar->nparams = pt->numparams;\r\n\t  ar->isvararg = !!(pt->flags & PROTO_VARARG);\r\n\t} else {\r\n\t  ar->nparams = 0;\r\n\t  ar->isvararg = 1;\r\n\t}\r\n      }\r\n    } else if (*what == 'n') {\r\n      ar->namewhat = frame ? lj_debug_funcname(L, frame, &ar->name) : NULL;\r\n      if (ar->namewhat == NULL) {\r\n\tar->namewhat = \"\";\r\n\tar->name = NULL;\r\n      }\r\n    } else if (*what == 'f') {\r\n      opt_f = 1;\r\n    } else if (*what == 'L') {\r\n      opt_L = 1;\r\n    } else {\r\n      return 0;  /* Bad option. */\r\n    }\r\n  }\r\n  if (opt_f) {\r\n    setfuncV(L, L->top, fn);\r\n    incr_top(L);\r\n  }\r\n  if (opt_L) {\r\n    if (isluafunc(fn)) {\r\n      GCtab *t = lj_tab_new(L, 0, 0);\r\n      GCproto *pt = funcproto(fn);\r\n      const void *lineinfo = proto_lineinfo(pt);\r\n      if (lineinfo) {\r\n\tBCLine first = pt->firstline;\r\n\tint sz = pt->numline < 256 ? 1 : pt->numline < 65536 ? 2 : 4;\r\n\tMSize i, szl = pt->sizebc-1;\r\n\tfor (i = 0; i < szl; i++) {\r\n\t  BCLine line = first +\r\n\t    (sz == 1 ? (BCLine)((const uint8_t *)lineinfo)[i] :\r\n\t     sz == 2 ? (BCLine)((const uint16_t *)lineinfo)[i] :\r\n\t     (BCLine)((const uint32_t *)lineinfo)[i]);\r\n\t  setboolV(lj_tab_setint(L, t, line), 1);\r\n\t}\r\n      }\r\n      settabV(L, L->top, t);\r\n    } else {\r\n      setnilV(L->top);\r\n    }\r\n    incr_top(L);\r\n  }\r\n  return 1;  /* Ok. */\r\n}\r\n\r\nLUA_API int lua_getinfo(lua_State *L, const char *what, lua_Debug *ar)\r\n{\r\n  return lj_debug_getinfo(L, what, (lj_Debug *)ar, 0);\r\n}\r\n\r\nLUA_API int lua_getstack(lua_State *L, int level, lua_Debug *ar)\r\n{\r\n  int size;\r\n  cTValue *frame = lj_debug_frame(L, level, &size);\r\n  if (frame) {\r\n    ar->i_ci = (size << 16) + (int)(frame - tvref(L->stack));\r\n    return 1;\r\n  } else {\r\n    ar->i_ci = level - size;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Number of frames for the leading and trailing part of a traceback. */\r\n#define TRACEBACK_LEVELS1\t12\r\n#define TRACEBACK_LEVELS2\t10\r\n\r\nLUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, const char *msg,\r\n\t\t\t\tint level)\r\n{\r\n  int top = (int)(L->top - L->base);\r\n  int lim = TRACEBACK_LEVELS1;\r\n  lua_Debug ar;\r\n  if (msg) lua_pushfstring(L, \"%s\\n\", msg);\r\n  lua_pushliteral(L, \"stack traceback:\");\r\n  while (lua_getstack(L1, level++, &ar)) {\r\n    GCfunc *fn;\r\n    if (level > lim) {\r\n      if (!lua_getstack(L1, level + TRACEBACK_LEVELS2, &ar)) {\r\n\tlevel--;\r\n      } else {\r\n\tlua_pushliteral(L, \"\\n\\t...\");\r\n\tlua_getstack(L1, -10, &ar);\r\n\tlevel = ar.i_ci - TRACEBACK_LEVELS2;\r\n      }\r\n      lim = 2147483647;\r\n      continue;\r\n    }\r\n    lua_getinfo(L1, \"Snlf\", &ar);\r\n    fn = funcV(L1->top-1); L1->top--;\r\n    if (isffunc(fn) && !*ar.namewhat)\r\n      lua_pushfstring(L, \"\\n\\t[builtin#%d]:\", fn->c.ffid);\r\n    else\r\n      lua_pushfstring(L, \"\\n\\t%s:\", ar.short_src);\r\n    if (ar.currentline > 0)\r\n      lua_pushfstring(L, \"%d:\", ar.currentline);\r\n    if (*ar.namewhat) {\r\n      lua_pushfstring(L, \" in function \" LUA_QS, ar.name);\r\n    } else {\r\n      if (*ar.what == 'm') {\r\n\tlua_pushliteral(L, \" in main chunk\");\r\n      } else if (*ar.what == 'C') {\r\n\tlua_pushfstring(L, \" at %p\", fn->c.f);\r\n      } else {\r\n\tlua_pushfstring(L, \" in function <%s:%d>\",\r\n\t\t\tar.short_src, ar.linedefined);\r\n      }\r\n    }\r\n    if ((int)(L->top - L->base) - top >= 15)\r\n      lua_concat(L, (int)(L->top - L->base) - top);\r\n  }\r\n  lua_concat(L, (int)(L->top - L->base) - top);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_debug.h",
    "content": "/*\r\n** Debugging and introspection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DEBUG_H\r\n#define _LJ_DEBUG_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\ntypedef struct lj_Debug {\r\n  /* Common fields. Must be in the same order as in lua.h. */\r\n  int event;\r\n  const char *name;\r\n  const char *namewhat;\r\n  const char *what;\r\n  const char *source;\r\n  int currentline;\r\n  int nups;\r\n  int linedefined;\r\n  int lastlinedefined;\r\n  char short_src[LUA_IDSIZE];\r\n  int i_ci;\r\n  /* Extended fields. Only valid if lj_debug_getinfo() is called with ext = 1.*/\r\n  int nparams;\r\n  int isvararg;\r\n} lj_Debug;\r\n\r\nLJ_FUNC cTValue *lj_debug_frame(lua_State *L, int level, int *size);\r\nLJ_FUNC BCLine LJ_FASTCALL lj_debug_line(GCproto *pt, BCPos pc);\r\nLJ_FUNC const char *lj_debug_uvname(GCproto *pt, uint32_t idx);\r\nLJ_FUNC const char *lj_debug_uvnamev(cTValue *o, uint32_t idx, TValue **tvp);\r\nLJ_FUNC const char *lj_debug_slotname(GCproto *pt, const BCIns *pc,\r\n\t\t\t\t      BCReg slot, const char **name);\r\nLJ_FUNC const char *lj_debug_funcname(lua_State *L, TValue *frame,\r\n\t\t\t\t      const char **name);\r\nLJ_FUNC void lj_debug_shortname(char *out, GCstr *str);\r\nLJ_FUNC void lj_debug_addloc(lua_State *L, const char *msg,\r\n\t\t\t     cTValue *frame, cTValue *nextframe);\r\nLJ_FUNC void lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc);\r\nLJ_FUNC int lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar,\r\n\t\t\t     int ext);\r\n\r\n/* Fixed internal variable names. */\r\n#define VARNAMEDEF(_) \\\r\n  _(FOR_IDX, \"(for index)\") \\\r\n  _(FOR_STOP, \"(for limit)\") \\\r\n  _(FOR_STEP, \"(for step)\") \\\r\n  _(FOR_GEN, \"(for generator)\") \\\r\n  _(FOR_STATE, \"(for state)\") \\\r\n  _(FOR_CTL, \"(for control)\")\r\n\r\nenum {\r\n  VARNAME_END,\r\n#define VARNAMEENUM(name, str)\tVARNAME_##name,\r\n  VARNAMEDEF(VARNAMEENUM)\r\n#undef VARNAMEENUM\r\n  VARNAME__MAX\r\n};\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_def.h",
    "content": "/*\r\n** LuaJIT common internal definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DEF_H\r\n#define _LJ_DEF_H\r\n\r\n#include \"lua.h\"\r\n\r\n#if defined(_MSC_VER)\r\n/* MSVC is stuck in the last century and doesn't have C99's stdint.h. */\r\ntypedef __int8 int8_t;\r\ntypedef __int16 int16_t;\r\ntypedef __int32 int32_t;\r\ntypedef __int64 int64_t;\r\ntypedef unsigned __int8 uint8_t;\r\ntypedef unsigned __int16 uint16_t;\r\ntypedef unsigned __int32 uint32_t;\r\ntypedef unsigned __int64 uint64_t;\r\n#ifdef _WIN64\r\ntypedef __int64 intptr_t;\r\ntypedef unsigned __int64 uintptr_t;\r\n#else\r\ntypedef __int32 intptr_t;\r\ntypedef unsigned __int32 uintptr_t;\r\n#endif\r\n#elif defined(__symbian__)\r\n/* Cough. */\r\ntypedef signed char int8_t;\r\ntypedef short int int16_t;\r\ntypedef int int32_t;\r\ntypedef long long int64_t;\r\ntypedef unsigned char uint8_t;\r\ntypedef unsigned short int uint16_t;\r\ntypedef unsigned int uint32_t;\r\ntypedef unsigned long long uint64_t;\r\ntypedef int intptr_t;\r\ntypedef unsigned int uintptr_t;\r\n#else\r\n#include <stdint.h>\r\n#endif\r\n\r\n/* Needed everywhere. */\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n/* Various VM limits. */\r\n#define LJ_MAX_MEM\t0x7fffff00\t/* Max. total memory allocation. */\r\n#define LJ_MAX_ALLOC\tLJ_MAX_MEM\t/* Max. individual allocation length. */\r\n#define LJ_MAX_STR\tLJ_MAX_MEM\t/* Max. string length. */\r\n#define LJ_MAX_UDATA\tLJ_MAX_MEM\t/* Max. userdata length. */\r\n\r\n#define LJ_MAX_STRTAB\t(1<<26)\t\t/* Max. string table size. */\r\n#define LJ_MAX_HBITS\t26\t\t/* Max. hash bits. */\r\n#define LJ_MAX_ABITS\t28\t\t/* Max. bits of array key. */\r\n#define LJ_MAX_ASIZE\t((1<<(LJ_MAX_ABITS-1))+1)  /* Max. array part size. */\r\n#define LJ_MAX_COLOSIZE\t16\t\t/* Max. elems for colocated array. */\r\n\r\n#define LJ_MAX_LINE\tLJ_MAX_MEM\t/* Max. source code line number. */\r\n#define LJ_MAX_XLEVEL\t200\t\t/* Max. syntactic nesting level. */\r\n#define LJ_MAX_BCINS\t(1<<26)\t\t/* Max. # of bytecode instructions. */\r\n#define LJ_MAX_SLOTS\t250\t\t/* Max. # of slots in a Lua func. */\r\n#define LJ_MAX_LOCVAR\t200\t\t/* Max. # of local variables. */\r\n#define LJ_MAX_UPVAL\t60\t\t/* Max. # of upvalues. */\r\n\r\n#define LJ_MAX_IDXCHAIN\t100\t\t/* __index/__newindex chain limit. */\r\n#define LJ_STACK_EXTRA\t5\t\t/* Extra stack space (metamethods). */\r\n\r\n#define LJ_NUM_CBPAGE\t1\t\t/* Number of FFI callback pages. */\r\n\r\n/* Minimum table/buffer sizes. */\r\n#define LJ_MIN_GLOBAL\t6\t\t/* Min. global table size (hbits). */\r\n#define LJ_MIN_REGISTRY\t2\t\t/* Min. registry size (hbits). */\r\n#define LJ_MIN_STRTAB\t256\t\t/* Min. string table size (pow2). */\r\n#define LJ_MIN_SBUF\t32\t\t/* Min. string buffer length. */\r\n#define LJ_MIN_VECSZ\t8\t\t/* Min. size for growable vectors. */\r\n#define LJ_MIN_IRSZ\t32\t\t/* Min. size for growable IR. */\r\n#define LJ_MIN_K64SZ\t16\t\t/* Min. size for chained K64Array. */\r\n\r\n/* JIT compiler limits. */\r\n#define LJ_MAX_JSLOTS\t250\t\t/* Max. # of stack slots for a trace. */\r\n#define LJ_MAX_PHI\t64\t\t/* Max. # of PHIs for a loop. */\r\n#define LJ_MAX_EXITSTUBGR\t16\t/* Max. # of exit stub groups. */\r\n\r\n/* Various macros. */\r\n#ifndef UNUSED\r\n#define UNUSED(x)\t((void)(x))\t/* to avoid warnings */\r\n#endif\r\n\r\n#define U64x(hi, lo)\t(((uint64_t)0x##hi << 32) + (uint64_t)0x##lo)\r\n#define i32ptr(p)\t((int32_t)(intptr_t)(void *)(p))\r\n#define u32ptr(p)\t((uint32_t)(intptr_t)(void *)(p))\r\n\r\n#define checki8(x)\t((x) == (int32_t)(int8_t)(x))\r\n#define checku8(x)\t((x) == (int32_t)(uint8_t)(x))\r\n#define checki16(x)\t((x) == (int32_t)(int16_t)(x))\r\n#define checku16(x)\t((x) == (int32_t)(uint16_t)(x))\r\n#define checki32(x)\t((x) == (int32_t)(x))\r\n#define checku32(x)\t((x) == (uint32_t)(x))\r\n#define checkptr32(x)\t((uintptr_t)(x) == (uint32_t)(uintptr_t)(x))\r\n\r\n/* Every half-decent C compiler transforms this into a rotate instruction. */\r\n#define lj_rol(x, n)\t(((x)<<(n)) | ((x)>>(-(int)(n)&(8*sizeof(x)-1))))\r\n#define lj_ror(x, n)\t(((x)<<(-(int)(n)&(8*sizeof(x)-1))) | ((x)>>(n)))\r\n\r\n/* A really naive Bloom filter. But sufficient for our needs. */\r\ntypedef uintptr_t BloomFilter;\r\n#define BLOOM_MASK\t(8*sizeof(BloomFilter) - 1)\r\n#define bloombit(x)\t((uintptr_t)1 << ((x) & BLOOM_MASK))\r\n#define bloomset(b, x)\t((b) |= bloombit((x)))\r\n#define bloomtest(b, x)\t((b) & bloombit((x)))\r\n\r\n#if defined(__GNUC__) || defined(__psp2__)\r\n\r\n#define LJ_NORET\t__attribute__((noreturn))\r\n#define LJ_ALIGN(n)\t__attribute__((aligned(n)))\r\n#define LJ_INLINE\tinline\r\n#define LJ_AINLINE\tinline __attribute__((always_inline))\r\n#define LJ_NOINLINE\t__attribute__((noinline))\r\n\r\n#if defined(__ELF__) || defined(__MACH__) || defined(__psp2__)\r\n#if !((defined(__sun__) && defined(__svr4__)) || defined(__CELLOS_LV2__))\r\n#define LJ_NOAPI\textern __attribute__((visibility(\"hidden\")))\r\n#endif\r\n#endif\r\n\r\n/* Note: it's only beneficial to use fastcall on x86 and then only for up to\r\n** two non-FP args. The amalgamated compile covers all LJ_FUNC cases. Only\r\n** indirect calls and related tail-called C functions are marked as fastcall.\r\n*/\r\n#if defined(__i386__)\r\n#define LJ_FASTCALL\t__attribute__((fastcall))\r\n#endif\r\n\r\n#define LJ_LIKELY(x)\t__builtin_expect(!!(x), 1)\r\n#define LJ_UNLIKELY(x)\t__builtin_expect(!!(x), 0)\r\n\r\n#define lj_ffs(x)\t((uint32_t)__builtin_ctz(x))\r\n/* Don't ask ... */\r\n#if defined(__INTEL_COMPILER) && (defined(__i386__) || defined(__x86_64__))\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  uint32_t r; __asm__(\"bsrl %1, %0\" : \"=r\" (r) : \"rm\" (x) : \"cc\"); return r;\r\n}\r\n#else\r\n#define lj_fls(x)\t((uint32_t)(__builtin_clz(x)^31))\r\n#endif\r\n\r\n#if defined(__arm__)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n#if defined(__psp2__)\r\n  return __builtin_rev(x);\r\n#else\r\n  uint32_t r;\r\n#if __ARM_ARCH_6__ || __ARM_ARCH_6J__ || __ARM_ARCH_6T2__ || __ARM_ARCH_6Z__ ||\\\r\n    __ARM_ARCH_6ZK__ || __ARM_ARCH_7__ || __ARM_ARCH_7A__ || __ARM_ARCH_7R__\r\n  __asm__(\"rev %0, %1\" : \"=r\" (r) : \"r\" (x));\r\n  return r;\r\n#else\r\n#ifdef __thumb__\r\n  r = x ^ lj_ror(x, 16);\r\n#else\r\n  __asm__(\"eor %0, %1, %1, ror #16\" : \"=r\" (r) : \"r\" (x));\r\n#endif\r\n  return ((r & 0xff00ffffu) >> 8) ^ lj_ror(x, 8);\r\n#endif\r\n#endif\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return ((uint64_t)lj_bswap((uint32_t)x)<<32) | lj_bswap((uint32_t)(x>>32));\r\n}\r\n#elif (__GNUC__ > 4) || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  return (uint32_t)__builtin_bswap32((int32_t)x);\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return (uint64_t)__builtin_bswap64((int64_t)x);\r\n}\r\n#elif defined(__i386__) || defined(__x86_64__)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  uint32_t r; __asm__(\"bswap %0\" : \"=r\" (r) : \"0\" (x)); return r;\r\n}\r\n\r\n#if defined(__i386__)\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return ((uint64_t)lj_bswap((uint32_t)x)<<32) | lj_bswap((uint32_t)(x>>32));\r\n}\r\n#else\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  uint64_t r; __asm__(\"bswap %0\" : \"=r\" (r) : \"0\" (x)); return r;\r\n}\r\n#endif\r\n#else\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  return (x << 24) | ((x & 0xff00) << 8) | ((x >> 8) & 0xff00) | (x >> 24);\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return (uint64_t)lj_bswap((uint32_t)(x >> 32)) |\r\n\t ((uint64_t)lj_bswap((uint32_t)x) << 32);\r\n}\r\n#endif\r\n\r\ntypedef union __attribute__((packed)) Unaligned16 {\r\n  uint16_t u;\r\n  uint8_t b[2];\r\n} Unaligned16;\r\n\r\ntypedef union __attribute__((packed)) Unaligned32 {\r\n  uint32_t u;\r\n  uint8_t b[4];\r\n} Unaligned32;\r\n\r\n/* Unaligned load of uint16_t. */\r\nstatic LJ_AINLINE uint16_t lj_getu16(const void *p)\r\n{\r\n  return ((const Unaligned16 *)p)->u;\r\n}\r\n\r\n/* Unaligned load of uint32_t. */\r\nstatic LJ_AINLINE uint32_t lj_getu32(const void *p)\r\n{\r\n  return ((const Unaligned32 *)p)->u;\r\n}\r\n\r\n#elif defined(_MSC_VER)\r\n\r\n#define LJ_NORET\t__declspec(noreturn)\r\n#define LJ_ALIGN(n)\t__declspec(align(n))\r\n#define LJ_INLINE\t__inline\r\n#define LJ_AINLINE\t__forceinline\r\n#define LJ_NOINLINE\t__declspec(noinline)\r\n#if defined(_M_IX86)\r\n#define LJ_FASTCALL\t__fastcall\r\n#endif\r\n\r\n#ifdef _M_PPC\r\nunsigned int _CountLeadingZeros(long);\r\n#pragma intrinsic(_CountLeadingZeros)\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  return _CountLeadingZeros(x) ^ 31;\r\n}\r\n#else\r\nunsigned char _BitScanForward(uint32_t *, unsigned long);\r\nunsigned char _BitScanReverse(uint32_t *, unsigned long);\r\n#pragma intrinsic(_BitScanForward)\r\n#pragma intrinsic(_BitScanReverse)\r\n\r\nstatic LJ_AINLINE uint32_t lj_ffs(uint32_t x)\r\n{\r\n  uint32_t r; _BitScanForward(&r, x); return r;\r\n}\r\n\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  uint32_t r; _BitScanReverse(&r, x); return r;\r\n}\r\n#endif\r\n\r\nunsigned long _byteswap_ulong(unsigned long);\r\nuint64_t _byteswap_uint64(uint64_t);\r\n#define lj_bswap(x)\t(_byteswap_ulong((x)))\r\n#define lj_bswap64(x)\t(_byteswap_uint64((x)))\r\n\r\n#if defined(_M_PPC) && defined(LUAJIT_NO_UNALIGNED)\r\n/*\r\n** Replacement for unaligned loads on Xbox 360. Disabled by default since it's\r\n** usually more costly than the occasional stall when crossing a cache-line.\r\n*/\r\nstatic LJ_AINLINE uint16_t lj_getu16(const void *v)\r\n{\r\n  const uint8_t *p = (const uint8_t *)v;\r\n  return (uint16_t)((p[0]<<8) | p[1]);\r\n}\r\nstatic LJ_AINLINE uint32_t lj_getu32(const void *v)\r\n{\r\n  const uint8_t *p = (const uint8_t *)v;\r\n  return (uint32_t)((p[0]<<24) | (p[1]<<16) | (p[2]<<8) | p[3]);\r\n}\r\n#else\r\n/* Unaligned loads are generally ok on x86/x64. */\r\n#define lj_getu16(p)\t(*(uint16_t *)(p))\r\n#define lj_getu32(p)\t(*(uint32_t *)(p))\r\n#endif\r\n\r\n#else\r\n#error \"missing defines for your compiler\"\r\n#endif\r\n\r\n/* Optional defines. */\r\n#ifndef LJ_FASTCALL\r\n#define LJ_FASTCALL\r\n#endif\r\n#ifndef LJ_NORET\r\n#define LJ_NORET\r\n#endif\r\n#ifndef LJ_NOAPI\r\n#define LJ_NOAPI\textern\r\n#endif\r\n#ifndef LJ_LIKELY\r\n#define LJ_LIKELY(x)\t(x)\r\n#define LJ_UNLIKELY(x)\t(x)\r\n#endif\r\n\r\n/* Attributes for internal functions. */\r\n#define LJ_DATA\t\tLJ_NOAPI\r\n#define LJ_DATADEF\r\n#define LJ_ASMF\t\tLJ_NOAPI\r\n#define LJ_FUNCA\tLJ_NOAPI\r\n#if defined(ljamalg_c)\r\n#define LJ_FUNC\t\tstatic\r\n#else\r\n#define LJ_FUNC\t\tLJ_NOAPI\r\n#endif\r\n#define LJ_FUNC_NORET\tLJ_FUNC LJ_NORET\r\n#define LJ_FUNCA_NORET\tLJ_FUNCA LJ_NORET\r\n#define LJ_ASMF_NORET\tLJ_ASMF LJ_NORET\r\n\r\n/* Runtime assertions. */\r\n#ifdef lua_assert\r\n#define check_exp(c, e)\t\t(lua_assert(c), (e))\r\n#define api_check(l, e)\t\tlua_assert(e)\r\n#else\r\n#define lua_assert(c)\t\t((void)0)\r\n#define check_exp(c, e)\t\t(e)\r\n#define api_check\t\tluai_apicheck\r\n#endif\r\n\r\n/* Static assertions. */\r\n#define LJ_ASSERT_NAME2(name, line)\tname ## line\r\n#define LJ_ASSERT_NAME(line)\t\tLJ_ASSERT_NAME2(lj_assert_, line)\r\n#ifdef __COUNTER__\r\n#define LJ_STATIC_ASSERT(cond) \\\r\n  extern void LJ_ASSERT_NAME(__COUNTER__)(int STATIC_ASSERTION_FAILED[(cond)?1:-1])\r\n#else\r\n#define LJ_STATIC_ASSERT(cond) \\\r\n  extern void LJ_ASSERT_NAME(__LINE__)(int STATIC_ASSERTION_FAILED[(cond)?1:-1])\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_dispatch.c",
    "content": "/*\r\n** Instruction dispatch handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_dispatch_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n#if LJ_HASFFI\r\n#include \"lj_ccallback.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"luajit.h\"\r\n\r\n/* Bump GG_NUM_ASMFF in lj_dispatch.h as needed. Ugly. */\r\nLJ_STATIC_ASSERT(GG_NUM_ASMFF == FF_NUM_ASMFUNC);\r\n\r\n/* -- Dispatch table management ------------------------------------------- */\r\n\r\n#if LJ_TARGET_MIPS\r\n#include <math.h>\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L,\r\n\t\t\t\t\t\t\t  lua_State *co);\r\n\r\n#define GOTFUNC(name)\t(ASMFunction)name,\r\nstatic const ASMFunction dispatch_got[] = {\r\n  GOTDEF(GOTFUNC)\r\n};\r\n#undef GOTFUNC\r\n#endif\r\n\r\n/* Initialize instruction dispatch table and hot counters. */\r\nvoid lj_dispatch_init(GG_State *GG)\r\n{\r\n  uint32_t i;\r\n  ASMFunction *disp = GG->dispatch;\r\n  for (i = 0; i < GG_LEN_SDISP; i++)\r\n    disp[GG_LEN_DDISP+i] = disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n  for (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n    disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n  /* The JIT engine is off by default. luaopen_jit() turns it on. */\r\n  disp[BC_FORL] = disp[BC_IFORL];\r\n  disp[BC_ITERL] = disp[BC_IITERL];\r\n  disp[BC_LOOP] = disp[BC_ILOOP];\r\n  disp[BC_FUNCF] = disp[BC_IFUNCF];\r\n  disp[BC_FUNCV] = disp[BC_IFUNCV];\r\n  GG->g.bc_cfunc_ext = GG->g.bc_cfunc_int = BCINS_AD(BC_FUNCC, LUA_MINSTACK, 0);\r\n  for (i = 0; i < GG_NUM_ASMFF; i++)\r\n    GG->bcff[i] = BCINS_AD(BC__MAX+i, 0, 0);\r\n#if LJ_TARGET_MIPS\r\n  memcpy(GG->got, dispatch_got, LJ_GOT__MAX*4);\r\n#endif\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Initialize hotcount table. */\r\nvoid lj_dispatch_init_hotcount(global_State *g)\r\n{\r\n  int32_t hotloop = G2J(g)->param[JIT_P_hotloop];\r\n  HotCount start = (HotCount)(hotloop*HOTCOUNT_LOOP - 1);\r\n  HotCount *hotcount = G2GG(g)->hotcount;\r\n  uint32_t i;\r\n  for (i = 0; i < HOTCOUNT_SIZE; i++)\r\n    hotcount[i] = start;\r\n}\r\n#endif\r\n\r\n/* Internal dispatch mode bits. */\r\n#define DISPMODE_JIT\t0x01\t/* JIT compiler on. */\r\n#define DISPMODE_REC\t0x02\t/* Recording active. */\r\n#define DISPMODE_INS\t0x04\t/* Override instruction dispatch. */\r\n#define DISPMODE_CALL\t0x08\t/* Override call dispatch. */\r\n#define DISPMODE_RET\t0x10\t/* Override return dispatch. */\r\n\r\n/* Update dispatch table depending on various flags. */\r\nvoid lj_dispatch_update(global_State *g)\r\n{\r\n  uint8_t oldmode = g->dispatchmode;\r\n  uint8_t mode = 0;\r\n#if LJ_HASJIT\r\n  mode |= (G2J(g)->flags & JIT_F_ON) ? DISPMODE_JIT : 0;\r\n  mode |= G2J(g)->state != LJ_TRACE_IDLE ?\r\n\t    (DISPMODE_REC|DISPMODE_INS|DISPMODE_CALL) : 0;\r\n#endif\r\n  mode |= (g->hookmask & (LUA_MASKLINE|LUA_MASKCOUNT)) ? DISPMODE_INS : 0;\r\n  mode |= (g->hookmask & LUA_MASKCALL) ? DISPMODE_CALL : 0;\r\n  mode |= (g->hookmask & LUA_MASKRET) ? DISPMODE_RET : 0;\r\n  if (oldmode != mode) {  /* Mode changed? */\r\n    ASMFunction *disp = G2GG(g)->dispatch;\r\n    ASMFunction f_forl, f_iterl, f_loop, f_funcf, f_funcv;\r\n    g->dispatchmode = mode;\r\n\r\n    /* Hotcount if JIT is on, but not while recording. */\r\n    if ((mode & (DISPMODE_JIT|DISPMODE_REC)) == DISPMODE_JIT) {\r\n      f_forl = makeasmfunc(lj_bc_ofs[BC_FORL]);\r\n      f_iterl = makeasmfunc(lj_bc_ofs[BC_ITERL]);\r\n      f_loop = makeasmfunc(lj_bc_ofs[BC_LOOP]);\r\n      f_funcf = makeasmfunc(lj_bc_ofs[BC_FUNCF]);\r\n      f_funcv = makeasmfunc(lj_bc_ofs[BC_FUNCV]);\r\n    } else {  /* Otherwise use the non-hotcounting instructions. */\r\n      f_forl = disp[GG_LEN_DDISP+BC_IFORL];\r\n      f_iterl = disp[GG_LEN_DDISP+BC_IITERL];\r\n      f_loop = disp[GG_LEN_DDISP+BC_ILOOP];\r\n      f_funcf = makeasmfunc(lj_bc_ofs[BC_IFUNCF]);\r\n      f_funcv = makeasmfunc(lj_bc_ofs[BC_IFUNCV]);\r\n    }\r\n    /* Init static counting instruction dispatch first (may be copied below). */\r\n    disp[GG_LEN_DDISP+BC_FORL] = f_forl;\r\n    disp[GG_LEN_DDISP+BC_ITERL] = f_iterl;\r\n    disp[GG_LEN_DDISP+BC_LOOP] = f_loop;\r\n\r\n    /* Set dynamic instruction dispatch. */\r\n    if ((oldmode ^ mode) & (DISPMODE_REC|DISPMODE_INS)) {\r\n      /* Need to update the whole table. */\r\n      if (!(mode & (DISPMODE_REC|DISPMODE_INS))) {  /* No ins dispatch? */\r\n\t/* Copy static dispatch table to dynamic dispatch table. */\r\n\tmemcpy(&disp[0], &disp[GG_LEN_DDISP], GG_LEN_SDISP*sizeof(ASMFunction));\r\n\t/* Overwrite with dynamic return dispatch. */\r\n\tif ((mode & DISPMODE_RET)) {\r\n\t  disp[BC_RETM] = lj_vm_rethook;\r\n\t  disp[BC_RET] = lj_vm_rethook;\r\n\t  disp[BC_RET0] = lj_vm_rethook;\r\n\t  disp[BC_RET1] = lj_vm_rethook;\r\n\t}\r\n      } else {\r\n\t/* The recording dispatch also checks for hooks. */\r\n\tASMFunction f = (mode & DISPMODE_REC) ? lj_vm_record : lj_vm_inshook;\r\n\tuint32_t i;\r\n\tfor (i = 0; i < GG_LEN_SDISP; i++)\r\n\t  disp[i] = f;\r\n      }\r\n    } else if (!(mode & (DISPMODE_REC|DISPMODE_INS))) {\r\n      /* Otherwise set dynamic counting ins. */\r\n      disp[BC_FORL] = f_forl;\r\n      disp[BC_ITERL] = f_iterl;\r\n      disp[BC_LOOP] = f_loop;\r\n      /* Set dynamic return dispatch. */\r\n      if ((mode & DISPMODE_RET)) {\r\n\tdisp[BC_RETM] = lj_vm_rethook;\r\n\tdisp[BC_RET] = lj_vm_rethook;\r\n\tdisp[BC_RET0] = lj_vm_rethook;\r\n\tdisp[BC_RET1] = lj_vm_rethook;\r\n      } else {\r\n\tdisp[BC_RETM] = disp[GG_LEN_DDISP+BC_RETM];\r\n\tdisp[BC_RET] = disp[GG_LEN_DDISP+BC_RET];\r\n\tdisp[BC_RET0] = disp[GG_LEN_DDISP+BC_RET0];\r\n\tdisp[BC_RET1] = disp[GG_LEN_DDISP+BC_RET1];\r\n      }\r\n    }\r\n\r\n    /* Set dynamic call dispatch. */\r\n    if ((oldmode ^ mode) & DISPMODE_CALL) {  /* Update the whole table? */\r\n      uint32_t i;\r\n      if ((mode & DISPMODE_CALL) == 0) {  /* No call hooks? */\r\n\tfor (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n\t  disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n      } else {\r\n\tfor (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n\t  disp[i] = lj_vm_callhook;\r\n      }\r\n    }\r\n    if (!(mode & DISPMODE_CALL)) {  /* Overwrite dynamic counting ins. */\r\n      disp[BC_FUNCF] = f_funcf;\r\n      disp[BC_FUNCV] = f_funcv;\r\n    }\r\n\r\n#if LJ_HASJIT\r\n    /* Reset hotcounts for JIT off to on transition. */\r\n    if ((mode & DISPMODE_JIT) && !(oldmode & DISPMODE_JIT))\r\n      lj_dispatch_init_hotcount(g);\r\n#endif\r\n  }\r\n}\r\n\r\n/* -- JIT mode setting ---------------------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n/* Set JIT mode for a single prototype. */\r\nstatic void setptmode(global_State *g, GCproto *pt, int mode)\r\n{\r\n  if ((mode & LUAJIT_MODE_ON)) {  /* (Re-)enable JIT compilation. */\r\n    pt->flags &= ~PROTO_NOJIT;\r\n    lj_trace_reenableproto(pt);  /* Unpatch all ILOOP etc. bytecodes. */\r\n  } else {  /* Flush and/or disable JIT compilation. */\r\n    if (!(mode & LUAJIT_MODE_FLUSH))\r\n      pt->flags |= PROTO_NOJIT;\r\n    lj_trace_flushproto(g, pt);  /* Flush all traces of prototype. */\r\n  }\r\n}\r\n\r\n/* Recursively set the JIT mode for all children of a prototype. */\r\nstatic void setptmode_all(global_State *g, GCproto *pt, int mode)\r\n{\r\n  ptrdiff_t i;\r\n  if (!(pt->flags & PROTO_CHILD)) return;\r\n  for (i = -(ptrdiff_t)pt->sizekgc; i < 0; i++) {\r\n    GCobj *o = proto_kgc(pt, i);\r\n    if (o->gch.gct == ~LJ_TPROTO) {\r\n      setptmode(g, gco2pt(o), mode);\r\n      setptmode_all(g, gco2pt(o), mode);\r\n    }\r\n  }\r\n}\r\n#endif\r\n\r\n/* Public API function: control the JIT engine. */\r\nint luaJIT_setmode(lua_State *L, int idx, int mode)\r\n{\r\n  global_State *g = G(L);\r\n  int mm = mode & LUAJIT_MODE_MASK;\r\n  lj_trace_abort(g);  /* Abort recording on any state change. */\r\n  /* Avoid pulling the rug from under our own feet. */\r\n  if ((g->hookmask & HOOK_GC))\r\n    lj_err_caller(L, LJ_ERR_NOGCMM);\r\n  switch (mm) {\r\n#if LJ_HASJIT\r\n  case LUAJIT_MODE_ENGINE:\r\n    if ((mode & LUAJIT_MODE_FLUSH)) {\r\n      lj_trace_flushall(L);\r\n    } else {\r\n      if (!(mode & LUAJIT_MODE_ON))\r\n\tG2J(g)->flags &= ~(uint32_t)JIT_F_ON;\r\n#if LJ_TARGET_X86ORX64\r\n      else if ((G2J(g)->flags & JIT_F_SSE2))\r\n\tG2J(g)->flags |= (uint32_t)JIT_F_ON;\r\n      else\r\n\treturn 0;  /* Don't turn on JIT compiler without SSE2 support. */\r\n#else\r\n      else\r\n\tG2J(g)->flags |= (uint32_t)JIT_F_ON;\r\n#endif\r\n      lj_dispatch_update(g);\r\n    }\r\n    break;\r\n  case LUAJIT_MODE_FUNC:\r\n  case LUAJIT_MODE_ALLFUNC:\r\n  case LUAJIT_MODE_ALLSUBFUNC: {\r\n    cTValue *tv = idx == 0 ? frame_prev(L->base-1) :\r\n\t\t  idx > 0 ? L->base + (idx-1) : L->top + idx;\r\n    GCproto *pt;\r\n    if ((idx == 0 || tvisfunc(tv)) && isluafunc(&gcval(tv)->fn))\r\n      pt = funcproto(&gcval(tv)->fn);  /* Cannot use funcV() for frame slot. */\r\n    else if (tvisproto(tv))\r\n      pt = protoV(tv);\r\n    else\r\n      return 0;  /* Failed. */\r\n    if (mm != LUAJIT_MODE_ALLSUBFUNC)\r\n      setptmode(g, pt, mode);\r\n    if (mm != LUAJIT_MODE_FUNC)\r\n      setptmode_all(g, pt, mode);\r\n    break;\r\n    }\r\n  case LUAJIT_MODE_TRACE:\r\n    if (!(mode & LUAJIT_MODE_FLUSH))\r\n      return 0;  /* Failed. */\r\n    lj_trace_flush(G2J(g), idx);\r\n    break;\r\n#else\r\n  case LUAJIT_MODE_ENGINE:\r\n  case LUAJIT_MODE_FUNC:\r\n  case LUAJIT_MODE_ALLFUNC:\r\n  case LUAJIT_MODE_ALLSUBFUNC:\r\n    UNUSED(idx);\r\n    if ((mode & LUAJIT_MODE_ON))\r\n      return 0;  /* Failed. */\r\n    break;\r\n#endif\r\n  case LUAJIT_MODE_WRAPCFUNC:\r\n    if ((mode & LUAJIT_MODE_ON)) {\r\n      if (idx != 0) {\r\n\tcTValue *tv = idx > 0 ? L->base + (idx-1) : L->top + idx;\r\n\tif (tvislightud(tv))\r\n\t  g->wrapf = (lua_CFunction)lightudV(tv);\r\n\telse\r\n\t  return 0;  /* Failed. */\r\n      } else {\r\n\treturn 0;  /* Failed. */\r\n      }\r\n      g->bc_cfunc_ext = BCINS_AD(BC_FUNCCW, 0, 0);\r\n    } else {\r\n      g->bc_cfunc_ext = BCINS_AD(BC_FUNCC, 0, 0);\r\n    }\r\n    break;\r\n  default:\r\n    return 0;  /* Failed. */\r\n  }\r\n  return 1;  /* OK. */\r\n}\r\n\r\n/* Enforce (dynamic) linker error for version mismatches. See luajit.c. */\r\nLUA_API void LUAJIT_VERSION_SYM(void)\r\n{\r\n}\r\n\r\n/* -- Hooks --------------------------------------------------------------- */\r\n\r\n/* This function can be called asynchronously (e.g. during a signal). */\r\nLUA_API int lua_sethook(lua_State *L, lua_Hook func, int mask, int count)\r\n{\r\n  global_State *g = G(L);\r\n  mask &= HOOK_EVENTMASK;\r\n  if (func == NULL || mask == 0) { mask = 0; func = NULL; }  /* Consistency. */\r\n  g->hookf = func;\r\n  g->hookcount = g->hookcstart = (int32_t)count;\r\n  g->hookmask = (uint8_t)((g->hookmask & ~HOOK_EVENTMASK) | mask);\r\n  lj_trace_abort(g);  /* Abort recording on any hook change. */\r\n  lj_dispatch_update(g);\r\n  return 1;\r\n}\r\n\r\nLUA_API lua_Hook lua_gethook(lua_State *L)\r\n{\r\n  return G(L)->hookf;\r\n}\r\n\r\nLUA_API int lua_gethookmask(lua_State *L)\r\n{\r\n  return G(L)->hookmask & HOOK_EVENTMASK;\r\n}\r\n\r\nLUA_API int lua_gethookcount(lua_State *L)\r\n{\r\n  return (int)G(L)->hookcstart;\r\n}\r\n\r\n/* Call a hook. */\r\nstatic void callhook(lua_State *L, int event, BCLine line)\r\n{\r\n  global_State *g = G(L);\r\n  lua_Hook hookf = g->hookf;\r\n  if (hookf && !hook_active(g)) {\r\n    lua_Debug ar;\r\n    lj_trace_abort(g);  /* Abort recording on any hook call. */\r\n    ar.event = event;\r\n    ar.currentline = line;\r\n    /* Top frame, nextframe = NULL. */\r\n    ar.i_ci = (int)((L->base-1) - tvref(L->stack));\r\n    lj_state_checkstack(L, 1+LUA_MINSTACK);\r\n    hook_enter(g);\r\n    hookf(L, &ar);\r\n    lua_assert(hook_active(g));\r\n    hook_leave(g);\r\n  }\r\n}\r\n\r\n/* -- Dispatch callbacks -------------------------------------------------- */\r\n\r\n/* Calculate number of used stack slots in the current frame. */\r\nstatic BCReg cur_topslot(GCproto *pt, const BCIns *pc, uint32_t nres)\r\n{\r\n  BCIns ins = pc[-1];\r\n  if (bc_op(ins) == BC_UCLO)\r\n    ins = pc[bc_j(ins)];\r\n  switch (bc_op(ins)) {\r\n  case BC_CALLM: case BC_CALLMT: return bc_a(ins) + bc_c(ins) + nres-1+1;\r\n  case BC_RETM: return bc_a(ins) + bc_d(ins) + nres-1;\r\n  case BC_TSETM: return bc_a(ins) + nres-1;\r\n  default: return pt->framesize;\r\n  }\r\n}\r\n\r\n/* Instruction dispatch. Used by instr/line/return hooks or when recording. */\r\nvoid LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  GCfunc *fn = curr_func(L);\r\n  GCproto *pt = funcproto(fn);\r\n  void *cf = cframe_raw(L->cframe);\r\n  const BCIns *oldpc = cframe_pc(cf);\r\n  global_State *g = G(L);\r\n  BCReg slots;\r\n  setcframe_pc(cf, pc);\r\n  slots = cur_topslot(pt, pc, cframe_multres_n(cf));\r\n  L->top = L->base + slots;  /* Fix top. */\r\n#if LJ_HASJIT\r\n  {\r\n    jit_State *J = G2J(g);\r\n    if (J->state != LJ_TRACE_IDLE) {\r\n#ifdef LUA_USE_ASSERT\r\n      ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n      J->L = L;\r\n      lj_trace_ins(J, pc-1);  /* The interpreter bytecode PC is offset by 1. */\r\n      lua_assert(L->top - L->base == delta);\r\n    }\r\n  }\r\n#endif\r\n  if ((g->hookmask & LUA_MASKCOUNT) && g->hookcount == 0) {\r\n    g->hookcount = g->hookcstart;\r\n    callhook(L, LUA_HOOKCOUNT, -1);\r\n    L->top = L->base + slots;  /* Fix top again. */\r\n  }\r\n  if ((g->hookmask & LUA_MASKLINE)) {\r\n    BCPos npc = proto_bcpos(pt, pc) - 1;\r\n    BCPos opc = proto_bcpos(pt, oldpc) - 1;\r\n    BCLine line = lj_debug_line(pt, npc);\r\n    if (pc <= oldpc || opc >= pt->sizebc || line != lj_debug_line(pt, opc)) {\r\n      callhook(L, LUA_HOOKLINE, line);\r\n      L->top = L->base + slots;  /* Fix top again. */\r\n    }\r\n  }\r\n  if ((g->hookmask & LUA_MASKRET) && bc_isret(bc_op(pc[-1])))\r\n    callhook(L, LUA_HOOKRET, -1);\r\n  ERRNO_RESTORE\r\n}\r\n\r\n/* Initialize call. Ensure stack space and return # of missing parameters. */\r\nstatic int call_init(lua_State *L, GCfunc *fn)\r\n{\r\n  if (isluafunc(fn)) {\r\n    GCproto *pt = funcproto(fn);\r\n    int numparams = pt->numparams;\r\n    int gotparams = (int)(L->top - L->base);\r\n    int need = pt->framesize;\r\n    if ((pt->flags & PROTO_VARARG)) need += 1+gotparams;\r\n    lj_state_checkstack(L, (MSize)need);\r\n    numparams -= gotparams;\r\n    return numparams >= 0 ? numparams : 0;\r\n  } else {\r\n    lj_state_checkstack(L, LUA_MINSTACK);\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Call dispatch. Used by call hooks, hot calls or when recording. */\r\nASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  GCfunc *fn = curr_func(L);\r\n  BCOp op;\r\n  global_State *g = G(L);\r\n#if LJ_HASJIT\r\n  jit_State *J = G2J(g);\r\n#endif\r\n  int missing = call_init(L, fn);\r\n#if LJ_HASJIT\r\n  J->L = L;\r\n  if ((uintptr_t)pc & 1) {  /* Marker for hot call. */\r\n#ifdef LUA_USE_ASSERT\r\n    ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n    pc = (const BCIns *)((uintptr_t)pc & ~(uintptr_t)1);\r\n    lj_trace_hot(J, pc);\r\n    lua_assert(L->top - L->base == delta);\r\n    goto out;\r\n  } else if (J->state != LJ_TRACE_IDLE &&\r\n\t     !(g->hookmask & (HOOK_GC|HOOK_VMEVENT))) {\r\n#ifdef LUA_USE_ASSERT\r\n    ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n    /* Record the FUNC* bytecodes, too. */\r\n    lj_trace_ins(J, pc-1);  /* The interpreter bytecode PC is offset by 1. */\r\n    lua_assert(L->top - L->base == delta);\r\n  }\r\n#endif\r\n  if ((g->hookmask & LUA_MASKCALL)) {\r\n    int i;\r\n    for (i = 0; i < missing; i++)  /* Add missing parameters. */\r\n      setnilV(L->top++);\r\n    callhook(L, LUA_HOOKCALL, -1);\r\n    /* Preserve modifications of missing parameters by lua_setlocal(). */\r\n    while (missing-- > 0 && tvisnil(L->top - 1))\r\n      L->top--;\r\n  }\r\n#if LJ_HASJIT\r\nout:\r\n#endif\r\n  op = bc_op(pc[-1]);  /* Get FUNC* op. */\r\n#if LJ_HASJIT\r\n  /* Use the non-hotcounting variants if JIT is off or while recording. */\r\n  if ((!(J->flags & JIT_F_ON) || J->state != LJ_TRACE_IDLE) &&\r\n      (op == BC_FUNCF || op == BC_FUNCV))\r\n    op = (BCOp)((int)op+(int)BC_IFUNCF-(int)BC_FUNCF);\r\n#endif\r\n  ERRNO_RESTORE\r\n  return makeasmfunc(lj_bc_ofs[op]);  /* Return static dispatch target. */\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_dispatch.h",
    "content": "/*\r\n** Instruction dispatch handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DISPATCH_H\r\n#define _LJ_DISPATCH_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n\r\n#if LJ_TARGET_MIPS\r\n/* Need our own global offset table for the dreaded MIPS calling conventions. */\r\n#if LJ_HASJIT\r\n#define JITGOTDEF(_)\t_(lj_trace_exit) _(lj_trace_hot)\r\n#else\r\n#define JITGOTDEF(_)\r\n#endif\r\n#if LJ_HASFFI\r\n#define FFIGOTDEF(_) \\\r\n  _(lj_meta_equal_cd) _(lj_ccallback_enter) _(lj_ccallback_leave)\r\n#else\r\n#define FFIGOTDEF(_)\r\n#endif\r\n#define GOTDEF(_) \\\r\n  _(floor) _(ceil) _(trunc) _(log) _(log10) _(exp) _(sin) _(cos) _(tan) \\\r\n  _(asin) _(acos) _(atan) _(sinh) _(cosh) _(tanh) _(frexp) _(modf) _(atan2) \\\r\n  _(pow) _(fmod) _(ldexp) \\\r\n  _(lj_dispatch_call) _(lj_dispatch_ins) _(lj_err_throw) \\\r\n  _(lj_ffh_coroutine_wrap_err) _(lj_func_closeuv) _(lj_func_newL_gc) \\\r\n  _(lj_gc_barrieruv) _(lj_gc_step) _(lj_gc_step_fixtop) _(lj_meta_arith) \\\r\n  _(lj_meta_call) _(lj_meta_cat) _(lj_meta_comp) _(lj_meta_equal) \\\r\n  _(lj_meta_for) _(lj_meta_len) _(lj_meta_tget) _(lj_meta_tset) \\\r\n  _(lj_state_growstack) _(lj_str_fromnum) _(lj_str_fromnumber) _(lj_str_new) \\\r\n  _(lj_tab_dup) _(lj_tab_get) _(lj_tab_getinth) _(lj_tab_len) _(lj_tab_new) \\\r\n  _(lj_tab_newkey) _(lj_tab_next) _(lj_tab_reasize) \\\r\n  JITGOTDEF(_) FFIGOTDEF(_)\r\n\r\nenum {\r\n#define GOTENUM(name) LJ_GOT_##name,\r\nGOTDEF(GOTENUM)\r\n#undef GOTENUM\r\n  LJ_GOT__MAX\r\n};\r\n#endif\r\n\r\n/* Type of hot counter. Must match the code in the assembler VM. */\r\n/* 16 bits are sufficient. Only 0.0015% overhead with maximum slot penalty. */\r\ntypedef uint16_t HotCount;\r\n\r\n/* Number of hot counter hash table entries (must be a power of two). */\r\n#define HOTCOUNT_SIZE\t\t64\r\n#define HOTCOUNT_PCMASK\t\t((HOTCOUNT_SIZE-1)*sizeof(HotCount))\r\n\r\n/* Hotcount decrements. */\r\n#define HOTCOUNT_LOOP\t\t2\r\n#define HOTCOUNT_CALL\t\t1\r\n\r\n/* This solves a circular dependency problem -- bump as needed. Sigh. */\r\n#define GG_NUM_ASMFF\t62\r\n\r\n#define GG_LEN_DDISP\t(BC__MAX + GG_NUM_ASMFF)\r\n#define GG_LEN_SDISP\tBC_FUNCF\r\n#define GG_LEN_DISP\t(GG_LEN_DDISP + GG_LEN_SDISP)\r\n\r\n/* Global state, main thread and extra fields are allocated together. */\r\ntypedef struct GG_State {\r\n  lua_State L;\t\t\t\t/* Main thread. */\r\n  global_State g;\t\t\t/* Global state. */\r\n#if LJ_TARGET_MIPS\r\n  ASMFunction got[LJ_GOT__MAX];\t\t/* Global offset table. */\r\n#endif\r\n#if LJ_HASJIT\r\n  jit_State J;\t\t\t\t/* JIT state. */\r\n  HotCount hotcount[HOTCOUNT_SIZE];\t/* Hot counters. */\r\n#endif\r\n  ASMFunction dispatch[GG_LEN_DISP];\t/* Instruction dispatch tables. */\r\n  BCIns bcff[GG_NUM_ASMFF];\t\t/* Bytecode for ASM fast functions. */\r\n} GG_State;\r\n\r\n#define GG_OFS(field)\t((int)offsetof(GG_State, field))\r\n#define G2GG(gl)\t((GG_State *)((char *)(gl) - GG_OFS(g)))\r\n#define J2GG(j)\t\t((GG_State *)((char *)(j) - GG_OFS(J)))\r\n#define L2GG(L)\t\t(G2GG(G(L)))\r\n#define J2G(J)\t\t(&J2GG(J)->g)\r\n#define G2J(gl)\t\t(&G2GG(gl)->J)\r\n#define L2J(L)\t\t(&L2GG(L)->J)\r\n#define GG_G2DISP\t(GG_OFS(dispatch) - GG_OFS(g))\r\n#define GG_DISP2G\t(GG_OFS(g) - GG_OFS(dispatch))\r\n#define GG_DISP2J\t(GG_OFS(J) - GG_OFS(dispatch))\r\n#define GG_DISP2HOT\t(GG_OFS(hotcount) - GG_OFS(dispatch))\r\n#define GG_DISP2STATIC\t(GG_LEN_DDISP*(int)sizeof(ASMFunction))\r\n\r\n#define hotcount_get(gg, pc) \\\r\n  (gg)->hotcount[(u32ptr(pc)>>2) & (HOTCOUNT_SIZE-1)]\r\n#define hotcount_set(gg, pc, val) \\\r\n  (hotcount_get((gg), (pc)) = (HotCount)(val))\r\n\r\n/* Dispatch table management. */\r\nLJ_FUNC void lj_dispatch_init(GG_State *GG);\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_dispatch_init_hotcount(global_State *g);\r\n#endif\r\nLJ_FUNC void lj_dispatch_update(global_State *g);\r\n\r\n/* Instruction dispatch callback for hooks or when recording. */\r\nLJ_FUNCA void LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc);\r\nLJ_FUNCA ASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns*pc);\r\nLJ_FUNCA void LJ_FASTCALL lj_dispatch_return(lua_State *L, const BCIns *pc);\r\n\r\n#if LJ_HASFFI && !defined(_BUILDVM_H)\r\n/* Save/restore errno and GetLastError() around hooks, exits and recording. */\r\n#include <errno.h>\r\n#if LJ_TARGET_WINDOWS\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n#define ERRNO_SAVE\tint olderr = errno; DWORD oldwerr = GetLastError();\r\n#define ERRNO_RESTORE\terrno = olderr; SetLastError(oldwerr);\r\n#else\r\n#define ERRNO_SAVE\tint olderr = errno;\r\n#define ERRNO_RESTORE\terrno = olderr;\r\n#endif\r\n#else\r\n#define ERRNO_SAVE\r\n#define ERRNO_RESTORE\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_emit_arm.h",
    "content": "/*\r\n** ARM instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Constant encoding --------------------------------------------------- */\r\n\r\nstatic uint8_t emit_invai[16] = {\r\n  /* AND */ (ARMI_AND^ARMI_BIC) >> 21,\r\n  /* EOR */ 0,\r\n  /* SUB */ (ARMI_SUB^ARMI_ADD) >> 21,\r\n  /* RSB */ 0,\r\n  /* ADD */ (ARMI_ADD^ARMI_SUB) >> 21,\r\n  /* ADC */ (ARMI_ADC^ARMI_SBC) >> 21,\r\n  /* SBC */ (ARMI_SBC^ARMI_ADC) >> 21,\r\n  /* RSC */ 0,\r\n  /* TST */ 0,\r\n  /* TEQ */ 0,\r\n  /* CMP */ (ARMI_CMP^ARMI_CMN) >> 21,\r\n  /* CMN */ (ARMI_CMN^ARMI_CMP) >> 21,\r\n  /* ORR */ 0,\r\n  /* MOV */ (ARMI_MOV^ARMI_MVN) >> 21,\r\n  /* BIC */ (ARMI_BIC^ARMI_AND) >> 21,\r\n  /* MVN */ (ARMI_MVN^ARMI_MOV) >> 21\r\n};\r\n\r\n/* Encode constant in K12 format for data processing instructions. */\r\nstatic uint32_t emit_isk12(ARMIns ai, int32_t n)\r\n{\r\n  uint32_t invai, i, m = (uint32_t)n;\r\n  /* K12: unsigned 8 bit value, rotated in steps of two bits. */\r\n  for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))\r\n    if (m <= 255) return ARMI_K12|m|i;\r\n  /* Otherwise try negation/complement with the inverse instruction. */\r\n  invai = emit_invai[((ai >> 21) & 15)];\r\n  if (!invai) return 0;  /* Failed. No inverse instruction. */\r\n  m = ~(uint32_t)n;\r\n  if (invai == ((ARMI_SUB^ARMI_ADD) >> 21) ||\r\n      invai == (ARMI_CMP^ARMI_CMN) >> 21) m++;\r\n  for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))\r\n    if (m <= 255) return ARMI_K12|(invai<<21)|m|i;\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_dnm(ASMState *as, ARMIns ai, Reg rd, Reg rn, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_N(rn) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_dm(ASMState *as, ARMIns ai, Reg rd, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_dn(ASMState *as, ARMIns ai, Reg rd, Reg rn)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_N(rn);\r\n}\r\n\r\nstatic void emit_nm(ASMState *as, ARMIns ai, Reg rn, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_N(rn) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_d(ASMState *as, ARMIns ai, Reg rd)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd);\r\n}\r\n\r\nstatic void emit_n(ASMState *as, ARMIns ai, Reg rn)\r\n{\r\n  *--as->mcp = ai | ARMF_N(rn);\r\n}\r\n\r\nstatic void emit_m(ASMState *as, ARMIns ai, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_lsox(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -255 && ofs <= 255);\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMI_LSX_I | ARMF_D(rd) | ARMF_N(rn) |\r\n\t       ((ofs & 0xf0) << 4) | (ofs & 0x0f);\r\n}\r\n\r\nstatic void emit_lso(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -4095 && ofs <= 4095);\r\n  /* Combine LDR/STR pairs to LDRD/STRD. */\r\n  if (*as->mcp == (ai|ARMI_LS_P|ARMI_LS_U|ARMF_D(rd^1)|ARMF_N(rn)|(ofs^4)) &&\r\n      (ai & ~(ARMI_LDR^ARMI_STR)) == ARMI_STR && rd != rn &&\r\n      (uint32_t)ofs <= 252 && !(ofs & 3) && !((rd ^ (ofs >>2)) & 1) &&\r\n      as->mcp != as->mcloop) {\r\n    as->mcp++;\r\n    emit_lsox(as, ai == ARMI_LDR ? ARMI_LDRD : ARMI_STRD, rd&~1, rn, ofs&~4);\r\n    return;\r\n  }\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMF_D(rd) | ARMF_N(rn) | ofs;\r\n}\r\n\r\n#if !LJ_SOFTFP\r\nstatic void emit_vlso(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -1020 && ofs <= 1020 && (ofs&3) == 0);\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMF_D(rd & 15) | ARMF_N(rn) | (ofs >> 2);\r\n}\r\n#endif\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer spills of BASE/L. */\r\n#define emit_canremat(ref)\t((ref) < ASMREF_L)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg d, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != d);\r\n    if (emit_canremat(ref)) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      uint32_t k = emit_isk12(ARMI_ADD, delta);\r\n      if (k) {\r\n\tif (k == ARMI_K12)\r\n\t  emit_dm(as, ARMI_MOV, d, r);\r\n\telse\r\n\t  emit_dn(as, ARMI_ADD^k, d, r);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Try to find a two step delta relative to another constant. */\r\nstatic int emit_kdelta2(ASMState *as, Reg d, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != d);\r\n    if (emit_canremat(ref)) {\r\n      int32_t other = ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i;\r\n      if (other) {\r\n\tint32_t delta = i - other;\r\n\tuint32_t sh, inv = 0, k2, k;\r\n\tif (delta < 0) { delta = -delta; inv = ARMI_ADD^ARMI_SUB; }\r\n\tsh = lj_ffs(delta) & ~1;\r\n\tk2 = emit_isk12(0, delta & (255 << sh));\r\n\tk = emit_isk12(0, delta & ~(255 << sh));\r\n\tif (k) {\r\n\t  emit_dn(as, ARMI_ADD^k2^inv, d, d);\r\n\t  emit_dn(as, ARMI_ADD^k^inv, d, r);\r\n\t  return 1;\r\n\t}\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  uint32_t k = emit_isk12(ARMI_MOV, i);\r\n  lua_assert(rset_test(as->freeset, r) || r == RID_TMP);\r\n  if (k) {\r\n    /* Standard K12 constant. */\r\n    emit_d(as, ARMI_MOV^k, r);\r\n  } else if ((as->flags & JIT_F_ARMV6T2) && (uint32_t)i < 0x00010000u) {\r\n    /* 16 bit loword constant for ARMv6T2. */\r\n    emit_d(as, ARMI_MOVW|(i & 0x0fff)|((i & 0xf000)<<4), r);\r\n  } else if (emit_kdelta1(as, r, i)) {\r\n    /* One step delta relative to another constant. */\r\n  } else if ((as->flags & JIT_F_ARMV6T2)) {\r\n    /* 32 bit hiword/loword constant for ARMv6T2. */\r\n    emit_d(as, ARMI_MOVT|((i>>16) & 0x0fff)|(((i>>16) & 0xf000)<<4), r);\r\n    emit_d(as, ARMI_MOVW|(i & 0x0fff)|((i & 0xf000)<<4), r);\r\n  } else if (emit_kdelta2(as, r, i)) {\r\n    /* Two step delta relative to another constant. */\r\n  } else {\r\n    /* Otherwise construct the constant with up to 4 instructions. */\r\n    /* NYI: use mvn+bic, use pc-relative loads. */\r\n    for (;;) {\r\n      uint32_t sh = lj_ffs(i) & ~1;\r\n      int32_t m = i & (255 << sh);\r\n      i &= ~(255 << sh);\r\n      if (i == 0) {\r\n\temit_d(as, ARMI_MOV ^ emit_isk12(0, m), r);\r\n\tbreak;\r\n      }\r\n      emit_dn(as, ARMI_ORR ^ emit_isk12(0, m), r, r);\r\n    }\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, ARMIns ai, Reg r, void *p)\r\n{\r\n  int32_t i = i32ptr(p);\r\n  emit_lso(as, ai, r, ra_allock(as, (i & ~4095), rset_exclude(RSET_GPR, r)),\r\n\t   (i & 4095));\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Load a number constant into an FPR. */\r\nstatic void emit_loadn(ASMState *as, Reg r, cTValue *tv)\r\n{\r\n  int32_t i;\r\n  if ((as->flags & JIT_F_VFPV3) && !tv->u32.lo) {\r\n    uint32_t hi = tv->u32.hi;\r\n    uint32_t b = ((hi >> 22) & 0x1ff);\r\n    if (!(hi & 0xffff) && (b == 0x100 || b == 0x0ff)) {\r\n      *--as->mcp = ARMI_VMOVI_D | ARMF_D(r & 15) |\r\n\t\t   ((tv->u32.hi >> 12) & 0x00080000) |\r\n\t\t   ((tv->u32.hi >> 4) & 0x00070000) |\r\n\t\t   ((tv->u32.hi >> 16) & 0x0000000f);\r\n      return;\r\n    }\r\n  }\r\n  i = i32ptr(tv);\r\n  emit_vlso(as, ARMI_VLDR_D, r,\r\n\t    ra_allock(as, (i & ~1020), RSET_GPR), (i & 1020));\r\n}\r\n#endif\r\n\r\n/* Get/set global_State fields. */\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsptr(as, ARMI_LDR, (r), (void *)&J2G(as->J)->field)\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsptr(as, ARMI_STR, (r), (void *)&J2G(as->J)->field)\r\n\r\n/* Trace number is determined from pc of exit instruction. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_branch(ASMState *as, ARMIns ai, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = (target - p) - 1;\r\n  lua_assert(((delta + 0x00800000) >> 24) == 0);\r\n  *--p = ai | ((uint32_t)delta & 0x00ffffffu);\r\n  as->mcp = p;\r\n}\r\n\r\n#define emit_jmp(as, target) emit_branch(as, ARMI_B, (target))\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = ((char *)target - (char *)p) - 8;\r\n  if ((((delta>>2) + 0x00800000) >> 24) == 0) {\r\n    if ((delta & 1))\r\n      *p = ARMI_BLX | ((uint32_t)(delta>>2) & 0x00ffffffu) | ((delta&2) << 27);\r\n    else\r\n      *p = ARMI_BL | ((uint32_t)(delta>>2) & 0x00ffffffu);\r\n  } else {  /* Target out of range: need indirect call. But don't use R0-R3. */\r\n    Reg r = ra_allock(as, i32ptr(target), RSET_RANGE(RID_R4, RID_R12+1));\r\n    *p = ARMI_BLXr | ARMF_M(r);\r\n  }\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (dst >= RID_MAX_GPR) {\r\n    emit_dm(as, irt_isnum(ir->t) ? ARMI_VMOV_D : ARMI_VMOV_S,\r\n\t    (dst & 15), (src & 15));\r\n    return;\r\n  }\r\n#endif\r\n  if (as->mcp != as->mcloop) {  /* Swap early registers for loads/stores. */\r\n    MCode ins = *as->mcp, swp = (src^dst);\r\n    if ((ins & 0x0c000000) == 0x04000000 && (ins & 0x02000010) != 0x02000010) {\r\n      if (!((ins ^ (dst << 16)) & 0x000f0000))\r\n\t*as->mcp = ins ^ (swp << 16);  /* Swap N in load/store. */\r\n      if (!(ins & 0x00100000) && !((ins ^ (dst << 12)) & 0x0000f000))\r\n\t*as->mcp = ins ^ (swp << 12);  /* Swap D in store. */\r\n    }\r\n  }\r\n  emit_dm(as, ARMI_MOV, dst, src);\r\n}\r\n\r\n/* Generic load of register from stack slot. */\r\nstatic void emit_spload(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (r >= RID_MAX_GPR)\r\n    emit_vlso(as, irt_isnum(ir->t) ? ARMI_VLDR_D : ARMI_VLDR_S, r, RID_SP, ofs);\r\n  else\r\n#endif\r\n    emit_lso(as, ARMI_LDR, r, RID_SP, ofs);\r\n}\r\n\r\n/* Generic store of register to stack slot. */\r\nstatic void emit_spstore(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (r >= RID_MAX_GPR)\r\n    emit_vlso(as, irt_isnum(ir->t) ? ARMI_VSTR_D : ARMI_VSTR_S, r, RID_SP, ofs);\r\n  else\r\n#endif\r\n    emit_lso(as, ARMI_STR, r, RID_SP, ofs);\r\n}\r\n\r\n/* Emit an arithmetic/logic operation with a constant operand. */\r\nstatic void emit_opk(ASMState *as, ARMIns ai, Reg dest, Reg src,\r\n\t\t     int32_t i, RegSet allow)\r\n{\r\n  uint32_t k = emit_isk12(ai, i);\r\n  if (k)\r\n    emit_dn(as, ai^k, dest, src);\r\n  else\r\n    emit_dnm(as, ai, dest, src, ra_allock(as, i, allow));\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs)\r\n    emit_opk(as, ARMI_ADD, r, r, ofs, rset_exclude(RSET_GPR, r));\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_SP, -(ofs))\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_emit_mips.h",
    "content": "/*\r\n** MIPS instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_dst(ASMState *as, MIPSIns mi, Reg rd, Reg rs, Reg rt)\r\n{\r\n  *--as->mcp = mi | MIPSF_D(rd) | MIPSF_S(rs) | MIPSF_T(rt);\r\n}\r\n\r\nstatic void emit_dta(ASMState *as, MIPSIns mi, Reg rd, Reg rt, uint32_t a)\r\n{\r\n  *--as->mcp = mi | MIPSF_D(rd) | MIPSF_T(rt) | MIPSF_A(a);\r\n}\r\n\r\n#define emit_ds(as, mi, rd, rs)\t\temit_dst(as, (mi), (rd), (rs), 0)\r\n#define emit_tg(as, mi, rt, rg)\t\temit_dst(as, (mi), (rg)&31, 0, (rt))\r\n\r\nstatic void emit_tsi(ASMState *as, MIPSIns mi, Reg rt, Reg rs, int32_t i)\r\n{\r\n  *--as->mcp = mi | MIPSF_T(rt) | MIPSF_S(rs) | (i & 0xffff);\r\n}\r\n\r\n#define emit_ti(as, mi, rt, i)\t\temit_tsi(as, (mi), (rt), 0, (i))\r\n#define emit_hsi(as, mi, rh, rs, i)\temit_tsi(as, (mi), (rh) & 31, (rs), (i))\r\n\r\nstatic void emit_fgh(ASMState *as, MIPSIns mi, Reg rf, Reg rg, Reg rh)\r\n{\r\n  *--as->mcp = mi | MIPSF_F(rf&31) | MIPSF_G(rg&31) | MIPSF_H(rh&31);\r\n}\r\n\r\n#define emit_fg(as, mi, rf, rg)\t\temit_fgh(as, (mi), (rf), (rg), 0)\r\n\r\nstatic void emit_rotr(ASMState *as, Reg dest, Reg src, Reg tmp, uint32_t shift)\r\n{\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    emit_dta(as, MIPSI_ROTR, dest, src, shift);\r\n  } else {\r\n    emit_dst(as, MIPSI_OR, dest, dest, tmp);\r\n    emit_dta(as, MIPSI_SLL, dest, src, (-shift)&31);\r\n    emit_dta(as, MIPSI_SRL, tmp, src, shift);\r\n  }\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg t, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != t);\r\n    if (ref < ASMREF_L) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      if (checki16(delta)) {\r\n\temit_tsi(as, MIPSI_ADDIU, t, r, delta);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  if (checki16(i)) {\r\n    emit_ti(as, MIPSI_LI, r, i);\r\n  } else {\r\n    if ((i & 0xffff)) {\r\n      int32_t jgl = i32ptr(J2G(as->J));\r\n      if ((uint32_t)(i-jgl) < 65536) {\r\n\temit_tsi(as, MIPSI_ADDIU, r, RID_JGL, i-jgl-32768);\r\n\treturn;\r\n      } else if (emit_kdelta1(as, r, i)) {\r\n\treturn;\r\n      } else if ((i >> 16) == 0) {\r\n\temit_tsi(as, MIPSI_ORI, r, RID_ZERO, i);\r\n\treturn;\r\n      }\r\n      emit_tsi(as, MIPSI_ORI, r, r, i);\r\n    }\r\n    emit_ti(as, MIPSI_LUI, r, (i >> 16));\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\nstatic void ra_allockreg(ASMState *as, int32_t k, Reg r);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, MIPSIns mi, Reg r, void *p, RegSet allow)\r\n{\r\n  int32_t jgl = i32ptr(J2G(as->J));\r\n  int32_t i = i32ptr(p);\r\n  Reg base;\r\n  if ((uint32_t)(i-jgl) < 65536) {\r\n    i = i-jgl-32768;\r\n    base = RID_JGL;\r\n  } else {\r\n    base = ra_allock(as, i-(int16_t)i, allow);\r\n  }\r\n  emit_tsi(as, mi, r, base, i);\r\n}\r\n\r\n#define emit_loadn(as, r, tv) \\\r\n  emit_lsptr(as, MIPSI_LDC1, ((r) & 31), (void *)(tv), RSET_GPR)\r\n\r\n/* Get/set global_State fields. */\r\nstatic void emit_lsglptr(ASMState *as, MIPSIns mi, Reg r, int32_t ofs)\r\n{\r\n  emit_tsi(as, mi, r, RID_JGL, ofs-32768);\r\n}\r\n\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsglptr(as, MIPSI_LW, (r), (int32_t)offsetof(global_State, field))\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsglptr(as, MIPSI_SW, (r), (int32_t)offsetof(global_State, field))\r\n\r\n/* Trace number is determined from per-trace exit stubs. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_branch(ASMState *as, MIPSIns mi, Reg rs, Reg rt, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(((delta + 0x8000) >> 16) == 0);\r\n  *--p = mi | MIPSF_S(rs) | MIPSF_T(rt) | ((uint32_t)delta & 0xffffu);\r\n  as->mcp = p;\r\n}\r\n\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  *--as->mcp = MIPSI_NOP;\r\n  emit_branch(as, MIPSI_B, RID_ZERO, RID_ZERO, (target));\r\n}\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *--p = MIPSI_NOP;\r\n  if ((((uintptr_t)target ^ (uintptr_t)p) >> 28) == 0)\r\n    *--p = MIPSI_JAL | (((uintptr_t)target >>2) & 0x03ffffffu);\r\n  else  /* Target out of range: need indirect call. */\r\n    *--p = MIPSI_JALR | MIPSF_S(RID_CFUNCADDR);\r\n  as->mcp = p;\r\n  ra_allockreg(as, i32ptr(target), RID_CFUNCADDR);\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n#define emit_move(as, dst, src) \\\r\n  emit_ds(as, MIPSI_MOVE, (dst), (src))\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  if (dst < RID_MAX_GPR)\r\n    emit_move(as, dst, src);\r\n  else\r\n    emit_fg(as, irt_isnum(ir->t) ? MIPSI_MOV_D : MIPSI_MOV_S, dst, src);\r\n}\r\n\r\n/* Generic load of register from stack slot. */\r\nstatic void emit_spload(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tsi(as, MIPSI_LW, r, RID_SP, ofs);\r\n  else\r\n    emit_tsi(as, irt_isnum(ir->t) ? MIPSI_LDC1 : MIPSI_LWC1,\r\n\t     (r & 31), RID_SP, ofs);\r\n}\r\n\r\n/* Generic store of register to stack slot. */\r\nstatic void emit_spstore(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tsi(as, MIPSI_SW, r, RID_SP, ofs);\r\n  else\r\n    emit_tsi(as, irt_isnum(ir->t) ? MIPSI_SDC1 : MIPSI_SWC1,\r\n\t     (r&31), RID_SP, ofs);\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    lua_assert(checki16(ofs));\r\n    emit_tsi(as, MIPSI_ADDIU, r, r, ofs);\r\n  }\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_SP, -(ofs))\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_emit_ppc.h",
    "content": "/*\r\n** PPC instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_tab(ASMState *as, PPCIns pi, Reg rt, Reg ra, Reg rb)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rt) | PPCF_A(ra) | PPCF_B(rb);\r\n}\r\n\r\n#define emit_asb(as, pi, ra, rs, rb)\temit_tab(as, (pi), (rs), (ra), (rb))\r\n#define emit_as(as, pi, ra, rs)\t\temit_tab(as, (pi), (rs), (ra), 0)\r\n#define emit_ab(as, pi, ra, rb)\t\temit_tab(as, (pi), 0, (ra), (rb))\r\n\r\nstatic void emit_tai(ASMState *as, PPCIns pi, Reg rt, Reg ra, int32_t i)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rt) | PPCF_A(ra) | (i & 0xffff);\r\n}\r\n\r\n#define emit_ti(as, pi, rt, i)\t\temit_tai(as, (pi), (rt), 0, (i))\r\n#define emit_ai(as, pi, ra, i)\t\temit_tai(as, (pi), 0, (ra), (i))\r\n#define emit_asi(as, pi, ra, rs, i)\temit_tai(as, (pi), (rs), (ra), (i))\r\n\r\n#define emit_fab(as, pi, rf, ra, rb) \\\r\n  emit_tab(as, (pi), (rf)&31, (ra)&31, (rb)&31)\r\n#define emit_fb(as, pi, rf, rb)\t\temit_tab(as, (pi), (rf)&31, 0, (rb)&31)\r\n#define emit_fac(as, pi, rf, ra, rc) \\\r\n  emit_tab(as, (pi) | PPCF_C((rc) & 31), (rf)&31, (ra)&31, 0)\r\n#define emit_facb(as, pi, rf, ra, rc, rb) \\\r\n  emit_tab(as, (pi) | PPCF_C((rc) & 31), (rf)&31, (ra)&31, (rb)&31)\r\n#define emit_fai(as, pi, rf, ra, i)\temit_tai(as, (pi), (rf)&31, (ra), (i))\r\n\r\nstatic void emit_rot(ASMState *as, PPCIns pi, Reg ra, Reg rs,\r\n\t\t     int32_t n, int32_t b, int32_t e)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rs) | PPCF_A(ra) | PPCF_B(n) |\r\n\t       PPCF_MB(b) | PPCF_ME(e);\r\n}\r\n\r\nstatic void emit_slwi(ASMState *as, Reg ra, Reg rs, int32_t n)\r\n{\r\n  lua_assert(n >= 0 && n < 32);\r\n  emit_rot(as, PPCI_RLWINM, ra, rs, n, 0, 31-n);\r\n}\r\n\r\nstatic void emit_rotlwi(ASMState *as, Reg ra, Reg rs, int32_t n)\r\n{\r\n  lua_assert(n >= 0 && n < 32);\r\n  emit_rot(as, PPCI_RLWINM, ra, rs, n, 0, 31);\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg t, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != t);\r\n    if (ref < ASMREF_L) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      if (checki16(delta)) {\r\n\temit_tai(as, PPCI_ADDI, t, r, delta);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  if (checki16(i)) {\r\n    emit_ti(as, PPCI_LI, r, i);\r\n  } else {\r\n    if ((i & 0xffff)) {\r\n      int32_t jgl = i32ptr(J2G(as->J));\r\n      if ((uint32_t)(i-jgl) < 65536) {\r\n\temit_tai(as, PPCI_ADDI, r, RID_JGL, i-jgl-32768);\r\n\treturn;\r\n      } else if (emit_kdelta1(as, r, i)) {\r\n\treturn;\r\n      }\r\n      emit_asi(as, PPCI_ORI, r, r, i);\r\n    }\r\n    emit_ti(as, PPCI_LIS, r, (i >> 16));\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, PPCIns pi, Reg r, void *p, RegSet allow)\r\n{\r\n  int32_t jgl = i32ptr(J2G(as->J));\r\n  int32_t i = i32ptr(p);\r\n  Reg base;\r\n  if ((uint32_t)(i-jgl) < 65536) {\r\n    i = i-jgl-32768;\r\n    base = RID_JGL;\r\n  } else {\r\n    base = ra_allock(as, i-(int16_t)i, allow);\r\n  }\r\n  emit_tai(as, pi, r, base, i);\r\n}\r\n\r\n#define emit_loadn(as, r, tv) \\\r\n  emit_lsptr(as, PPCI_LFD, ((r) & 31), (void *)(tv), RSET_GPR)\r\n\r\n/* Get/set global_State fields. */\r\nstatic void emit_lsglptr(ASMState *as, PPCIns pi, Reg r, int32_t ofs)\r\n{\r\n  emit_tai(as, pi, r, RID_JGL, ofs-32768);\r\n}\r\n\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsglptr(as, PPCI_LWZ, (r), (int32_t)offsetof(global_State, field))\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsglptr(as, PPCI_STW, (r), (int32_t)offsetof(global_State, field))\r\n\r\n/* Trace number is determined from per-trace exit stubs. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_condbranch(ASMState *as, PPCIns pi, PPCCC cc, MCode *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  lua_assert(((delta + 0x8000) >> 16) == 0);\r\n  pi ^= (delta & 0x8000) * (PPCF_Y/0x8000);\r\n  *p = pi | PPCF_CC(cc) | ((uint32_t)delta & 0xffffu);\r\n}\r\n\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  *p = PPCI_B | (delta & 0x03fffffcu);\r\n}\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  if ((((delta>>2) + 0x00800000) >> 24) == 0) {\r\n    *p = PPCI_BL | (delta & 0x03fffffcu);\r\n  } else {  /* Target out of range: need indirect call. Don't use arg reg. */\r\n    RegSet allow = RSET_GPR & ~RSET_RANGE(RID_R0, REGARG_LASTGPR+1);\r\n    Reg r = ra_allock(as, i32ptr(target), allow);\r\n    *p = PPCI_BCTRL;\r\n    p[-1] = PPCI_MTCTR | PPCF_T(r);\r\n    as->mcp = p-1;\r\n  }\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n#define emit_mr(as, dst, src) \\\r\n  emit_asb(as, PPCI_MR, (dst), (src), (src))\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  UNUSED(ir);\r\n  if (dst < RID_MAX_GPR)\r\n    emit_mr(as, dst, src);\r\n  else\r\n    emit_fb(as, PPCI_FMR, dst, src);\r\n}\r\n\r\n/* Generic load of register from stack slot. */\r\nstatic void emit_spload(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tai(as, PPCI_LWZ, r, RID_SP, ofs);\r\n  else\r\n    emit_fai(as, irt_isnum(ir->t) ? PPCI_LFD : PPCI_LFS, r, RID_SP, ofs);\r\n}\r\n\r\n/* Generic store of register to stack slot. */\r\nstatic void emit_spstore(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tai(as, PPCI_STW, r, RID_SP, ofs);\r\n  else\r\n    emit_fai(as, irt_isnum(ir->t) ? PPCI_STFD : PPCI_STFS, r, RID_SP, ofs);\r\n}\r\n\r\n/* Emit a compare (for equality) with a constant operand. */\r\nstatic void emit_cmpi(ASMState *as, Reg r, int32_t k)\r\n{\r\n  if (checki16(k)) {\r\n    emit_ai(as, PPCI_CMPWI, r, k);\r\n  } else if (checku16(k)) {\r\n    emit_ai(as, PPCI_CMPLWI, r, k);\r\n  } else {\r\n    emit_ai(as, PPCI_CMPLWI, RID_TMP, k);\r\n    emit_asi(as, PPCI_XORIS, RID_TMP, r, (k >> 16));\r\n  }\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    emit_tai(as, PPCI_ADDI, r, r, ofs);\r\n    if (!checki16(ofs))\r\n      emit_tai(as, PPCI_ADDIS, r, r, (ofs + 32768) >> 16);\r\n  }\r\n}\r\n\r\nstatic void emit_spsub(ASMState *as, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    emit_tai(as, PPCI_STWU, RID_TMP, RID_SP, -ofs);\r\n    emit_tai(as, PPCI_ADDI, RID_TMP, RID_SP,\r\n\t     CFRAME_SIZE + (as->parent ? as->parent->spadjust : 0));\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_emit_x86.h",
    "content": "/*\r\n** x86/x64 instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\n#define MODRM(mode, r1, r2)\t((MCode)((mode)+(((r1)&7)<<3)+((r2)&7)))\r\n\r\n#if LJ_64\r\n#define REXRB(p, rr, rb) \\\r\n    { MCode rex = 0x40 + (((rr)>>1)&4) + (((rb)>>3)&1); \\\r\n      if (rex != 0x40) *--(p) = rex; }\r\n#define FORCE_REX\t\t0x200\r\n#define REX_64\t\t\t(FORCE_REX|0x080000)\r\n#else\r\n#define REXRB(p, rr, rb)\t((void)0)\r\n#define FORCE_REX\t\t0\r\n#define REX_64\t\t\t0\r\n#endif\r\n\r\n#define emit_i8(as, i)\t\t(*--as->mcp = (MCode)(i))\r\n#define emit_i32(as, i)\t\t(*(int32_t *)(as->mcp-4) = (i), as->mcp -= 4)\r\n#define emit_u32(as, u)\t\t(*(uint32_t *)(as->mcp-4) = (u), as->mcp -= 4)\r\n\r\n#define emit_x87op(as, xo) \\\r\n  (*(uint16_t *)(as->mcp-2) = (uint16_t)(xo), as->mcp -= 2)\r\n\r\n/* op */\r\nstatic LJ_AINLINE MCode *emit_op(x86Op xo, Reg rr, Reg rb, Reg rx,\r\n\t\t\t\t MCode *p, int delta)\r\n{\r\n  int n = (int8_t)xo;\r\n#if defined(__GNUC__)\r\n  if (__builtin_constant_p(xo) && n == -2)\r\n    p[delta-2] = (MCode)(xo >> 24);\r\n  else if (__builtin_constant_p(xo) && n == -3)\r\n    *(uint16_t *)(p+delta-3) = (uint16_t)(xo >> 16);\r\n  else\r\n#endif\r\n    *(uint32_t *)(p+delta-5) = (uint32_t)xo;\r\n  p += n + delta;\r\n#if LJ_64\r\n  {\r\n    uint32_t rex = 0x40 + ((rr>>1)&(4+(FORCE_REX>>1)))+((rx>>2)&2)+((rb>>3)&1);\r\n    if (rex != 0x40) {\r\n      rex |= (rr >> 16);\r\n      if (n == -4) { *p = (MCode)rex; rex = (MCode)(xo >> 8); }\r\n      else if ((xo & 0xffffff) == 0x6600fd) { *p = (MCode)rex; rex = 0x66; }\r\n      *--p = (MCode)rex;\r\n    }\r\n  }\r\n#else\r\n  UNUSED(rr); UNUSED(rb); UNUSED(rx);\r\n#endif\r\n  return p;\r\n}\r\n\r\n/* op + modrm */\r\n#define emit_opm(xo, mode, rr, rb, p, delta) \\\r\n  (p[(delta)-1] = MODRM((mode), (rr), (rb)), \\\r\n   emit_op((xo), (rr), (rb), 0, (p), (delta)))\r\n\r\n/* op + modrm + sib */\r\n#define emit_opmx(xo, mode, scale, rr, rb, rx, p) \\\r\n  (p[-1] = MODRM((scale), (rx), (rb)), \\\r\n   p[-2] = MODRM((mode), (rr), RID_ESP), \\\r\n   emit_op((xo), (rr), (rb), (rx), (p), -1))\r\n\r\n/* op r1, r2 */\r\nstatic void emit_rr(ASMState *as, x86Op xo, Reg r1, Reg r2)\r\n{\r\n  MCode *p = as->mcp;\r\n  as->mcp = emit_opm(xo, XM_REG, r1, r2, p, 0);\r\n}\r\n\r\n#if LJ_64 && defined(LUA_USE_ASSERT)\r\n/* [addr] is sign-extended in x64 and must be in lower 2G (not 4G). */\r\nstatic int32_t ptr2addr(const void *p)\r\n{\r\n  lua_assert((uintptr_t)p < (uintptr_t)0x80000000);\r\n  return i32ptr(p);\r\n}\r\n#else\r\n#define ptr2addr(p)\t(i32ptr((p)))\r\n#endif\r\n\r\n/* op r, [addr] */\r\nstatic void emit_rma(ASMState *as, x86Op xo, Reg rr, const void *addr)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = ptr2addr(addr);\r\n#if LJ_64\r\n  p[-5] = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n  as->mcp = emit_opm(xo, XM_OFS0, rr, RID_ESP, p, -5);\r\n#else\r\n  as->mcp = emit_opm(xo, XM_OFS0, rr, RID_EBP, p, -4);\r\n#endif\r\n}\r\n\r\n/* op r, [base+ofs] */\r\nstatic void emit_rmro(ASMState *as, x86Op xo, Reg rr, Reg rb, int32_t ofs)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode;\r\n  if (ra_hasreg(rb)) {\r\n    if (ofs == 0 && (rb&7) != RID_EBP) {\r\n      mode = XM_OFS0;\r\n    } else if (checki8(ofs)) {\r\n      *--p = (MCode)ofs;\r\n      mode = XM_OFS8;\r\n    } else {\r\n      p -= 4;\r\n      *(int32_t *)p = ofs;\r\n      mode = XM_OFS32;\r\n    }\r\n    if ((rb&7) == RID_ESP)\r\n      *--p = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n  } else {\r\n    *(int32_t *)(p-4) = ofs;\r\n#if LJ_64\r\n    p[-5] = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n    p -= 5;\r\n    rb = RID_ESP;\r\n#else\r\n    p -= 4;\r\n    rb = RID_EBP;\r\n#endif\r\n    mode = XM_OFS0;\r\n  }\r\n  as->mcp = emit_opm(xo, mode, rr, rb, p, 0);\r\n}\r\n\r\n/* op r, [base+idx*scale+ofs] */\r\nstatic void emit_rmrxo(ASMState *as, x86Op xo, Reg rr, Reg rb, Reg rx,\r\n\t\t       x86Mode scale, int32_t ofs)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode;\r\n  if (ofs == 0 && (rb&7) != RID_EBP) {\r\n    mode = XM_OFS0;\r\n  } else if (checki8(ofs)) {\r\n    mode = XM_OFS8;\r\n    *--p = (MCode)ofs;\r\n  } else {\r\n    mode = XM_OFS32;\r\n    p -= 4;\r\n    *(int32_t *)p = ofs;\r\n  }\r\n  as->mcp = emit_opmx(xo, mode, scale, rr, rb, rx, p);\r\n}\r\n\r\n/* op r, i */\r\nstatic void emit_gri(ASMState *as, x86Group xg, Reg rb, int32_t i)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    *--p = (MCode)i;\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    p -= 4;\r\n    *(int32_t *)p = i;\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  as->mcp = emit_opm(xo, XM_REG, (Reg)(xg & 7) | (rb & REX_64), rb, p, 0);\r\n}\r\n\r\n/* op [base+ofs], i */\r\nstatic void emit_gmroi(ASMState *as, x86Group xg, Reg rb, int32_t ofs,\r\n\t\t       int32_t i)\r\n{\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    emit_i8(as, i);\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    emit_i32(as, i);\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  emit_rmro(as, xo, (Reg)(xg & 7), rb, ofs);\r\n}\r\n\r\n#define emit_shifti(as, xg, r, i) \\\r\n  (emit_i8(as, (i)), emit_rr(as, XO_SHIFTi, (Reg)(xg), (r)))\r\n\r\n/* op r, rm/mrm */\r\nstatic void emit_mrm(ASMState *as, x86Op xo, Reg rr, Reg rb)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode = XM_REG;\r\n  if (rb == RID_MRM) {\r\n    rb = as->mrm.base;\r\n    if (rb == RID_NONE) {\r\n      rb = RID_EBP;\r\n      mode = XM_OFS0;\r\n      p -= 4;\r\n      *(int32_t *)p = as->mrm.ofs;\r\n      if (as->mrm.idx != RID_NONE)\r\n\tgoto mrmidx;\r\n#if LJ_64\r\n      *--p = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n      rb = RID_ESP;\r\n#endif\r\n    } else {\r\n      if (as->mrm.ofs == 0 && (rb&7) != RID_EBP) {\r\n\tmode = XM_OFS0;\r\n      } else if (checki8(as->mrm.ofs)) {\r\n\t*--p = (MCode)as->mrm.ofs;\r\n\tmode = XM_OFS8;\r\n      } else {\r\n\tp -= 4;\r\n\t*(int32_t *)p = as->mrm.ofs;\r\n\tmode = XM_OFS32;\r\n      }\r\n      if (as->mrm.idx != RID_NONE) {\r\n      mrmidx:\r\n\tas->mcp = emit_opmx(xo, mode, as->mrm.scale, rr, rb, as->mrm.idx, p);\r\n\treturn;\r\n      }\r\n      if ((rb&7) == RID_ESP)\r\n\t*--p = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n    }\r\n  }\r\n  as->mcp = emit_opm(xo, mode, rr, rb, p, 0);\r\n}\r\n\r\n/* op rm/mrm, i */\r\nstatic void emit_gmrmi(ASMState *as, x86Group xg, Reg rb, int32_t i)\r\n{\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    emit_i8(as, i);\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    emit_i32(as, i);\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  emit_mrm(as, xo, (Reg)(xg & 7) | (rb & REX_64), (rb & ~REX_64));\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Instruction selection for XMM moves. */\r\n#define XMM_MOVRR(as)\t((as->flags & JIT_F_SPLIT_XMM) ? XO_MOVSD : XO_MOVAPS)\r\n#define XMM_MOVRM(as)\t((as->flags & JIT_F_SPLIT_XMM) ? XO_MOVLPD : XO_MOVSD)\r\n\r\n/* mov [base+ofs], i */\r\nstatic void emit_movmroi(ASMState *as, Reg base, int32_t ofs, int32_t i)\r\n{\r\n  emit_i32(as, i);\r\n  emit_rmro(as, XO_MOVmi, 0, base, ofs);\r\n}\r\n\r\n/* mov [base+ofs], r */\r\n#define emit_movtomro(as, r, base, ofs) \\\r\n  emit_rmro(as, XO_MOVto, (r), (base), (ofs))\r\n\r\n/* Get/set global_State fields. */\r\n#define emit_opgl(as, xo, r, field) \\\r\n  emit_rma(as, (xo), (r), (void *)&J2G(as->J)->field)\r\n#define emit_getgl(as, r, field)\temit_opgl(as, XO_MOV, (r), field)\r\n#define emit_setgl(as, r, field)\temit_opgl(as, XO_MOVto, (r), field)\r\n\r\n#define emit_setvmstate(as, i) \\\r\n  (emit_i32(as, i), emit_opgl(as, XO_MOVmi, 0, vmstate))\r\n\r\n/* mov r, i / xor r, r */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  /* XOR r,r is shorter, but modifies the flags. This is bad for HIOP. */\r\n  if (i == 0 && !(LJ_32 && (IR(as->curins)->o == IR_HIOP ||\r\n\t\t\t    (as->curins+1 < as->T->nins &&\r\n\t\t\t     IR(as->curins+1)->o == IR_HIOP)))) {\r\n    emit_rr(as, XO_ARITH(XOg_XOR), r, r);\r\n  } else {\r\n    MCode *p = as->mcp;\r\n    *(int32_t *)(p-4) = i;\r\n    p[-5] = (MCode)(XI_MOVri+(r&7));\r\n    p -= 5;\r\n    REXRB(p, 0, r);\r\n    as->mcp = p;\r\n  }\r\n}\r\n\r\n/* mov r, addr */\r\n#define emit_loada(as, r, addr) \\\r\n  emit_loadi(as, (r), ptr2addr((addr)))\r\n\r\n#if LJ_64\r\n/* mov r, imm64 or shorter 32 bit extended load. */\r\nstatic void emit_loadu64(ASMState *as, Reg r, uint64_t u64)\r\n{\r\n  if (checku32(u64)) {  /* 32 bit load clears upper 32 bits. */\r\n    emit_loadi(as, r, (int32_t)u64);\r\n  } else if (checki32((int64_t)u64)) {  /* Sign-extended 32 bit load. */\r\n    MCode *p = as->mcp;\r\n    *(int32_t *)(p-4) = (int32_t)u64;\r\n    as->mcp = emit_opm(XO_MOVmi, XM_REG, REX_64, r, p, -4);\r\n  } else {  /* Full-size 64 bit load. */\r\n    MCode *p = as->mcp;\r\n    *(uint64_t *)(p-8) = u64;\r\n    p[-9] = (MCode)(XI_MOVri+(r&7));\r\n    p[-10] = 0x48 + ((r>>3)&1);\r\n    p -= 10;\r\n    as->mcp = p;\r\n  }\r\n}\r\n#endif\r\n\r\n/* movsd r, [&tv->n] / xorps r, r */\r\nstatic void emit_loadn(ASMState *as, Reg r, cTValue *tv)\r\n{\r\n  if (tvispzero(tv))  /* Use xor only for +0. */\r\n    emit_rr(as, XO_XORPS, r, r);\r\n  else\r\n    emit_rma(as, XMM_MOVRM(as), r, &tv->n);\r\n}\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for short jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* jmp short target */\r\nstatic void emit_sjmp(ASMState *as, MCLabel target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int8_t)delta);\r\n  p[-1] = (MCode)(int8_t)delta;\r\n  p[-2] = XI_JMPs;\r\n  as->mcp = p - 2;\r\n}\r\n#endif\r\n\r\n/* jcc short target */\r\nstatic void emit_sjcc(ASMState *as, int cc, MCLabel target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int8_t)delta);\r\n  p[-1] = (MCode)(int8_t)delta;\r\n  p[-2] = (MCode)(XI_JCCs+(cc&15));\r\n  as->mcp = p - 2;\r\n}\r\n\r\n/* jcc short (pending target) */\r\nstatic MCLabel emit_sjcc_label(ASMState *as, int cc)\r\n{\r\n  MCode *p = as->mcp;\r\n  p[-1] = 0;\r\n  p[-2] = (MCode)(XI_JCCs+(cc&15));\r\n  as->mcp = p - 2;\r\n  return p;\r\n}\r\n\r\n/* Fixup jcc short target. */\r\nstatic void emit_sfixup(ASMState *as, MCLabel source)\r\n{\r\n  source[-1] = (MCode)(as->mcp-source);\r\n}\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\n/* Compute relative 32 bit offset for jump and call instructions. */\r\nstatic LJ_AINLINE int32_t jmprel(MCode *p, MCode *target)\r\n{\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int32_t)delta);\r\n  return (int32_t)delta;\r\n}\r\n\r\n/* jcc target */\r\nstatic void emit_jcc(ASMState *as, int cc, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = (MCode)(XI_JCCn+(cc&15));\r\n  p[-6] = 0x0f;\r\n  as->mcp = p - 6;\r\n}\r\n\r\n/* jmp target */\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_JMP;\r\n  as->mcp = p - 5;\r\n}\r\n\r\n/* call target */\r\nstatic void emit_call_(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n#if LJ_64\r\n  if (target-p != (int32_t)(target-p)) {\r\n    /* Assumes RID_RET is never an argument to calls and always clobbered. */\r\n    emit_rr(as, XO_GROUP5, XOg_CALL, RID_RET);\r\n    emit_loadu64(as, RID_RET, (uint64_t)target);\r\n    return;\r\n  }\r\n#endif\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_CALL;\r\n  as->mcp = p - 5;\r\n}\r\n\r\n#define emit_call(as, f)\temit_call_(as, (MCode *)(void *)(f))\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n/* Use 64 bit operations to handle 64 bit IR types. */\r\n#if LJ_64\r\n#define REX_64IR(ir, r)\t\t((r) + (irt_is64((ir)->t) ? REX_64 : 0))\r\n#else\r\n#define REX_64IR(ir, r)\t\t(r)\r\n#endif\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  UNUSED(ir);\r\n  if (dst < RID_MAX_GPR)\r\n    emit_rr(as, XO_MOV, REX_64IR(ir, dst), src);\r\n  else\r\n    emit_rr(as, XMM_MOVRR(as), dst, src);\r\n}\r\n\r\n/* Generic load of register from stack slot. */\r\nstatic void emit_spload(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_rmro(as, XO_MOV, REX_64IR(ir, r), RID_ESP, ofs);\r\n  else\r\n    emit_rmro(as, irt_isnum(ir->t) ? XMM_MOVRM(as) : XO_MOVSS, r, RID_ESP, ofs);\r\n}\r\n\r\n/* Generic store of register to stack slot. */\r\nstatic void emit_spstore(ASMState *as, IRIns *ir, Reg r, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_rmro(as, XO_MOVto, REX_64IR(ir, r), RID_ESP, ofs);\r\n  else\r\n    emit_rmro(as, irt_isnum(ir->t) ? XO_MOVSDto : XO_MOVSSto, r, RID_ESP, ofs);\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    if ((as->flags & JIT_F_LEA_AGU))\r\n      emit_rmro(as, XO_LEA, r, r, ofs);\r\n    else\r\n      emit_gri(as, XG_ARITHi(XOg_ADD), r, ofs);\r\n  }\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_ESP|REX_64, -(ofs))\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_err.c",
    "content": "/*\r\n** Error handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_err_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/*\r\n** LuaJIT can either use internal or external frame unwinding:\r\n**\r\n** - Internal frame unwinding (INT) is free-standing and doesn't require\r\n**   any OS or library support.\r\n**\r\n** - External frame unwinding (EXT) uses the system-provided unwind handler.\r\n**\r\n** Pros and Cons:\r\n**\r\n** - EXT requires unwind tables for *all* functions on the C stack between\r\n**   the pcall/catch and the error/throw. This is the default on x64,\r\n**   but needs to be manually enabled on x86/PPC for non-C++ code.\r\n**\r\n** - INT is faster when actually throwing errors (but this happens rarely).\r\n**   Setting up error handlers is zero-cost in any case.\r\n**\r\n** - EXT provides full interoperability with C++ exceptions. You can throw\r\n**   Lua errors or C++ exceptions through a mix of Lua frames and C++ frames.\r\n**   C++ destructors are called as needed. C++ exceptions caught by pcall\r\n**   are converted to the string \"C++ exception\". Lua errors can be caught\r\n**   with catch (...) in C++.\r\n**\r\n** - INT has only limited support for automatically catching C++ exceptions\r\n**   on POSIX systems using DWARF2 stack unwinding. Other systems may use\r\n**   the wrapper function feature. Lua errors thrown through C++ frames\r\n**   cannot be caught by C++ code and C++ destructors are not run.\r\n**\r\n** EXT is the default on x64 systems, INT is the default on all other systems.\r\n**\r\n** EXT can be manually enabled on POSIX systems using GCC and DWARF2 stack\r\n** unwinding with -DLUAJIT_UNWIND_EXTERNAL. *All* C code must be compiled\r\n** with -funwind-tables (or -fexceptions). This includes LuaJIT itself (set\r\n** TARGET_CFLAGS), all of your C/Lua binding code, all loadable C modules\r\n** and all C libraries that have callbacks which may be used to call back\r\n** into Lua. C++ code must *not* be compiled with -fno-exceptions.\r\n**\r\n** EXT cannot be enabled on WIN32 since system exceptions use code-driven SEH.\r\n** EXT is mandatory on WIN64 since the calling convention has an abundance\r\n** of callee-saved registers (rbx, rbp, rsi, rdi, r12-r15, xmm6-xmm15).\r\n** EXT is mandatory on POSIX/x64 since the interpreter doesn't save r12/r13.\r\n*/\r\n\r\n#if defined(__GNUC__) && (LJ_TARGET_X64 || defined(LUAJIT_UNWIND_EXTERNAL))\r\n#define LJ_UNWIND_EXT\t1\r\n#elif LJ_TARGET_X64 && LJ_TARGET_WINDOWS\r\n#define LJ_UNWIND_EXT\t1\r\n#endif\r\n\r\n/* -- Error messages ------------------------------------------------------ */\r\n\r\n/* Error message strings. */\r\nLJ_DATADEF const char *lj_err_allmsg =\r\n#define ERRDEF(name, msg)\tmsg \"\\0\"\r\n#include \"lj_errmsg.h\"\r\n;\r\n\r\n/* -- Internal frame unwinding -------------------------------------------- */\r\n\r\n/* Unwind Lua stack and move error message to new top. */\r\nLJ_NOINLINE static void unwindstack(lua_State *L, TValue *top)\r\n{\r\n  lj_func_closeuv(L, top);\r\n  if (top < L->top-1) {\r\n    copyTV(L, top, L->top-1);\r\n    L->top = top+1;\r\n  }\r\n  lj_state_relimitstack(L);\r\n}\r\n\r\n/* Unwind until stop frame. Optionally cleanup frames. */\r\nstatic void *err_unwind(lua_State *L, void *stopcf, int errcode)\r\n{\r\n  TValue *frame = L->base-1;\r\n  void *cf = L->cframe;\r\n  while (cf) {\r\n    int32_t nres = cframe_nres(cframe_raw(cf));\r\n    if (nres < 0) {  /* C frame without Lua frame? */\r\n      TValue *top = restorestack(L, -nres);\r\n      if (frame < top) {  /* Frame reached? */\r\n\tif (errcode) {\r\n\t  L->cframe = cframe_prev(cf);\r\n\t  L->base = frame+1;\r\n\t  unwindstack(L, top);\r\n\t}\r\n\treturn cf;\r\n      }\r\n    }\r\n    if (frame <= tvref(L->stack))\r\n      break;\r\n    switch (frame_typep(frame)) {\r\n    case FRAME_LUA:  /* Lua frame. */\r\n    case FRAME_LUAP:\r\n      frame = frame_prevl(frame);\r\n      break;\r\n    case FRAME_C:  /* C frame. */\r\n#if LJ_HASFFI\r\n    unwind_c:\r\n#endif\r\n#if LJ_UNWIND_EXT\r\n      if (errcode) {\r\n\tL->cframe = cframe_prev(cf);\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tunwindstack(L, frame);\r\n      } else if (cf != stopcf) {\r\n\tcf = cframe_prev(cf);\r\n\tframe = frame_prevd(frame);\r\n\tbreak;\r\n      }\r\n      return NULL;  /* Continue unwinding. */\r\n#else\r\n      UNUSED(stopcf);\r\n      cf = cframe_prev(cf);\r\n      frame = frame_prevd(frame);\r\n      break;\r\n#endif\r\n    case FRAME_CP:  /* Protected C frame. */\r\n      if (cframe_canyield(cf)) {  /* Resume? */\r\n\tif (errcode) {\r\n\t  hook_leave(G(L));  /* Assumes nobody uses coroutines inside hooks. */\r\n\t  L->cframe = NULL;\r\n\t  L->status = (uint8_t)errcode;\r\n\t}\r\n\treturn cf;\r\n      }\r\n      if (errcode) {\r\n\tL->cframe = cframe_prev(cf);\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tunwindstack(L, frame);\r\n      }\r\n      return cf;\r\n    case FRAME_CONT:  /* Continuation frame. */\r\n#if LJ_HASFFI\r\n      if ((frame-1)->u32.lo == LJ_CONT_FFI_CALLBACK)\r\n\tgoto unwind_c;\r\n#endif\r\n    case FRAME_VARG:  /* Vararg frame. */\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_PCALL:  /* FF pcall() frame. */\r\n    case FRAME_PCALLH:  /* FF pcall() frame inside hook. */\r\n      if (errcode) {\r\n\tif (errcode == LUA_YIELD) {\r\n\t  frame = frame_prevd(frame);\r\n\t  break;\r\n\t}\r\n\tif (frame_typep(frame) == FRAME_PCALL)\r\n\t  hook_leave(G(L));\r\n\tL->cframe = cf;\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tunwindstack(L, L->base);\r\n      }\r\n      return (void *)((intptr_t)cf | CFRAME_UNWIND_FF);\r\n    }\r\n  }\r\n  /* No C frame. */\r\n  if (errcode) {\r\n    L->cframe = NULL;\r\n    L->base = tvref(L->stack)+1;\r\n    unwindstack(L, L->base);\r\n    if (G(L)->panic)\r\n      G(L)->panic(L);\r\n    exit(EXIT_FAILURE);\r\n  }\r\n  return L;  /* Anything non-NULL will do. */\r\n}\r\n\r\n/* -- External frame unwinding -------------------------------------------- */\r\n\r\n#if defined(__GNUC__) && !LJ_NO_UNWIND && !LJ_TARGET_WINDOWS\r\n\r\n/*\r\n** We have to use our own definitions instead of the mandatory (!) unwind.h,\r\n** since various OS, distros and compilers mess up the header installation.\r\n*/\r\n\r\ntypedef struct _Unwind_Exception\r\n{\r\n  uint64_t exclass;\r\n  void (*excleanup)(int, struct _Unwind_Exception *);\r\n  uintptr_t p1, p2;\r\n} __attribute__((__aligned__)) _Unwind_Exception;\r\n\r\ntypedef struct _Unwind_Context _Unwind_Context;\r\n\r\n#define _URC_OK\t\t\t0\r\n#define _URC_FATAL_PHASE1_ERROR\t3\r\n#define _URC_HANDLER_FOUND\t6\r\n#define _URC_INSTALL_CONTEXT\t7\r\n#define _URC_CONTINUE_UNWIND\t8\r\n#define _URC_FAILURE\t\t9\r\n\r\n#if !LJ_TARGET_ARM\r\n\r\nextern uintptr_t _Unwind_GetCFA(_Unwind_Context *);\r\nextern void _Unwind_SetGR(_Unwind_Context *, int, uintptr_t);\r\nextern void _Unwind_SetIP(_Unwind_Context *, uintptr_t);\r\nextern void _Unwind_DeleteException(_Unwind_Exception *);\r\nextern int _Unwind_RaiseException(_Unwind_Exception *);\r\n\r\n#define _UA_SEARCH_PHASE\t1\r\n#define _UA_CLEANUP_PHASE\t2\r\n#define _UA_HANDLER_FRAME\t4\r\n#define _UA_FORCE_UNWIND\t8\r\n\r\n#define LJ_UEXCLASS\t\t0x4c55414a49543200ULL\t/* LUAJIT2\\0 */\r\n#define LJ_UEXCLASS_MAKE(c)\t(LJ_UEXCLASS | (uint64_t)(c))\r\n#define LJ_UEXCLASS_CHECK(cl)\t(((cl) ^ LJ_UEXCLASS) <= 0xff)\r\n#define LJ_UEXCLASS_ERRCODE(cl)\t((int)((cl) & 0xff))\r\n\r\n/* DWARF2 personality handler referenced from interpreter .eh_frame. */\r\nLJ_FUNCA int lj_err_unwind_dwarf(int version, int actions,\r\n  uint64_t uexclass, _Unwind_Exception *uex, _Unwind_Context *ctx)\r\n{\r\n  void *cf;\r\n  lua_State *L;\r\n  if (version != 1)\r\n    return _URC_FATAL_PHASE1_ERROR;\r\n  UNUSED(uexclass);\r\n  cf = (void *)_Unwind_GetCFA(ctx);\r\n  L = cframe_L(cf);\r\n  if ((actions & _UA_SEARCH_PHASE)) {\r\n#if LJ_UNWIND_EXT\r\n    if (err_unwind(L, cf, 0) == NULL)\r\n      return _URC_CONTINUE_UNWIND;\r\n#endif\r\n    if (!LJ_UEXCLASS_CHECK(uexclass)) {\r\n      setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n    }\r\n    return _URC_HANDLER_FOUND;\r\n  }\r\n  if ((actions & _UA_CLEANUP_PHASE)) {\r\n    int errcode;\r\n    if (LJ_UEXCLASS_CHECK(uexclass)) {\r\n      errcode = LJ_UEXCLASS_ERRCODE(uexclass);\r\n    } else {\r\n      if ((actions & _UA_HANDLER_FRAME))\r\n\t_Unwind_DeleteException(uex);\r\n      errcode = LUA_ERRRUN;\r\n    }\r\n#if LJ_UNWIND_EXT\r\n    cf = err_unwind(L, cf, errcode);\r\n    if ((actions & _UA_FORCE_UNWIND)) {\r\n      return _URC_CONTINUE_UNWIND;\r\n    } else if (cf) {\r\n      _Unwind_SetGR(ctx, LJ_TARGET_EHRETREG, errcode);\r\n      _Unwind_SetIP(ctx, (uintptr_t)(cframe_unwind_ff(cf) ?\r\n\t\t\t\t     lj_vm_unwind_ff_eh :\r\n\t\t\t\t     lj_vm_unwind_c_eh));\r\n      return _URC_INSTALL_CONTEXT;\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    else if ((actions & _UA_HANDLER_FRAME)) {\r\n      /* Workaround for ancient libgcc bug. Still present in RHEL 5.5. :-/\r\n      ** Real fix: http://gcc.gnu.org/viewcvs/trunk/gcc/unwind-dw2.c?r1=121165&r2=124837&pathrev=153877&diff_format=h\r\n      */\r\n      _Unwind_SetGR(ctx, LJ_TARGET_EHRETREG, errcode);\r\n      _Unwind_SetIP(ctx, (uintptr_t)lj_vm_unwind_rethrow);\r\n      return _URC_INSTALL_CONTEXT;\r\n    }\r\n#endif\r\n#else\r\n    /* This is not the proper way to escape from the unwinder. We get away with\r\n    ** it on non-x64 because the interpreter restores all callee-saved regs.\r\n    */\r\n    lj_err_throw(L, errcode);\r\n#endif\r\n  }\r\n  return _URC_CONTINUE_UNWIND;\r\n}\r\n\r\n#if LJ_UNWIND_EXT\r\n#if LJ_TARGET_OSX || defined(__OpenBSD__)\r\n/* Sorry, no thread safety for OSX. Complain to Apple, not me. */\r\nstatic _Unwind_Exception static_uex;\r\n#else\r\nstatic __thread _Unwind_Exception static_uex;\r\n#endif\r\n\r\n/* Raise DWARF2 exception. */\r\nstatic void err_raise_ext(int errcode)\r\n{\r\n  static_uex.exclass = LJ_UEXCLASS_MAKE(errcode);\r\n  static_uex.excleanup = NULL;\r\n  _Unwind_RaiseException(&static_uex);\r\n}\r\n#endif\r\n\r\n#else\r\n\r\nextern void _Unwind_DeleteException(void *);\r\nextern int __gnu_unwind_frame (void *, _Unwind_Context *);\r\nextern int _Unwind_VRS_Set(_Unwind_Context *, int, uint32_t, int, void *);\r\nextern int _Unwind_VRS_Get(_Unwind_Context *, int, uint32_t, int, void *);\r\n\r\nstatic inline uint32_t _Unwind_GetGR(_Unwind_Context *ctx, int r)\r\n{\r\n  uint32_t v;\r\n  _Unwind_VRS_Get(ctx, 0, r, 0, &v);\r\n  return v;\r\n}\r\n\r\nstatic inline void _Unwind_SetGR(_Unwind_Context *ctx, int r, uint32_t v)\r\n{\r\n  _Unwind_VRS_Set(ctx, 0, r, 0, &v);\r\n}\r\n\r\n#define _US_VIRTUAL_UNWIND_FRAME\t0\r\n#define _US_UNWIND_FRAME_STARTING\t1\r\n#define _US_ACTION_MASK\t\t\t3\r\n#define _US_FORCE_UNWIND\t\t8\r\n\r\n/* ARM unwinder personality handler referenced from interpreter .ARM.extab. */\r\nLJ_FUNCA int lj_err_unwind_arm(int state, void *ucb, _Unwind_Context *ctx)\r\n{\r\n  void *cf = (void *)_Unwind_GetGR(ctx, 13);\r\n  lua_State *L = cframe_L(cf);\r\n  if ((state & _US_ACTION_MASK) == _US_VIRTUAL_UNWIND_FRAME) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n    return _URC_HANDLER_FOUND;\r\n  }\r\n  if ((state&(_US_ACTION_MASK|_US_FORCE_UNWIND)) == _US_UNWIND_FRAME_STARTING) {\r\n    _Unwind_DeleteException(ucb);\r\n    _Unwind_SetGR(ctx, 15, (uint32_t)(void *)lj_err_throw);\r\n    _Unwind_SetGR(ctx, 0, (uint32_t)L);\r\n    _Unwind_SetGR(ctx, 1, (uint32_t)LUA_ERRRUN);\r\n    return _URC_INSTALL_CONTEXT;\r\n  }\r\n  if (__gnu_unwind_frame(ucb, ctx) != _URC_OK)\r\n    return _URC_FAILURE;\r\n  return _URC_CONTINUE_UNWIND;\r\n}\r\n\r\n#endif\r\n\r\n#elif LJ_TARGET_X64 && LJ_TARGET_WINDOWS\r\n\r\n/*\r\n** Someone in Redmond owes me several days of my life. A lot of this is\r\n** undocumented or just plain wrong on MSDN. Some of it can be gathered\r\n** from 3rd party docs or must be found by trial-and-error. They really\r\n** don't want you to write your own language-specific exception handler\r\n** or to interact gracefully with MSVC. :-(\r\n**\r\n** Apparently MSVC doesn't call C++ destructors for foreign exceptions\r\n** unless you compile your C++ code with /EHa. Unfortunately this means\r\n** catch (...) also catches things like access violations. The use of\r\n** _set_se_translator doesn't really help, because it requires /EHa, too.\r\n*/\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n/* Taken from: http://www.nynaeve.net/?p=99 */\r\ntypedef struct UndocumentedDispatcherContext {\r\n  ULONG64 ControlPc;\r\n  ULONG64 ImageBase;\r\n  PRUNTIME_FUNCTION FunctionEntry;\r\n  ULONG64 EstablisherFrame;\r\n  ULONG64 TargetIp;\r\n  PCONTEXT ContextRecord;\r\n  void (*LanguageHandler)(void);\r\n  PVOID HandlerData;\r\n  PUNWIND_HISTORY_TABLE HistoryTable;\r\n  ULONG ScopeIndex;\r\n  ULONG Fill0;\r\n} UndocumentedDispatcherContext;\r\n\r\n/* Another wild guess. */\r\nextern void __DestructExceptionObject(EXCEPTION_RECORD *rec, int nothrow);\r\n\r\n#ifdef MINGW_SDK_INIT\r\n/* Workaround for broken MinGW64 declaration. */\r\nVOID RtlUnwindEx_FIXED(PVOID,PVOID,PVOID,PVOID,PVOID,PVOID) asm(\"RtlUnwindEx\");\r\n#define RtlUnwindEx RtlUnwindEx_FIXED\r\n#endif\r\n\r\n#define LJ_MSVC_EXCODE\t\t((DWORD)0xe06d7363)\r\n#define LJ_GCC_EXCODE\t\t((DWORD)0x20474343)\r\n\r\n#define LJ_EXCODE\t\t((DWORD)0xe24c4a00)\r\n#define LJ_EXCODE_MAKE(c)\t(LJ_EXCODE | (DWORD)(c))\r\n#define LJ_EXCODE_CHECK(cl)\t(((cl) ^ LJ_EXCODE) <= 0xff)\r\n#define LJ_EXCODE_ERRCODE(cl)\t((int)((cl) & 0xff))\r\n\r\n/* Win64 exception handler for interpreter frame. */\r\nLJ_FUNCA EXCEPTION_DISPOSITION lj_err_unwind_win64(EXCEPTION_RECORD *rec,\r\n  void *cf, CONTEXT *ctx, UndocumentedDispatcherContext *dispatch)\r\n{\r\n  lua_State *L = cframe_L(cf);\r\n  int errcode = LJ_EXCODE_CHECK(rec->ExceptionCode) ?\r\n\t\tLJ_EXCODE_ERRCODE(rec->ExceptionCode) : LUA_ERRRUN;\r\n  if ((rec->ExceptionFlags & 6)) {  /* EH_UNWINDING|EH_EXIT_UNWIND */\r\n    /* Unwind internal frames. */\r\n    err_unwind(L, cf, errcode);\r\n  } else {\r\n    void *cf2 = err_unwind(L, cf, 0);\r\n    if (cf2) {  /* We catch it, so start unwinding the upper frames. */\r\n      if (rec->ExceptionCode == LJ_MSVC_EXCODE ||\r\n\t  rec->ExceptionCode == LJ_GCC_EXCODE) {\r\n\t__DestructExceptionObject(rec, 1);\r\n\tsetstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n      } else if (!LJ_EXCODE_CHECK(rec->ExceptionCode)) {\r\n\t/* Don't catch access violations etc. */\r\n\treturn ExceptionContinueSearch;\r\n      }\r\n      /* Unwind the stack and call all handlers for all lower C frames\r\n      ** (including ourselves) again with EH_UNWINDING set. Then set\r\n      ** rsp = cf, rax = errcode and jump to the specified target.\r\n      */\r\n      RtlUnwindEx(cf, (void *)((cframe_unwind_ff(cf2) && errcode != LUA_YIELD) ?\r\n\t\t\t       lj_vm_unwind_ff_eh :\r\n\t\t\t       lj_vm_unwind_c_eh),\r\n\t\t  rec, (void *)(uintptr_t)errcode, ctx, dispatch->HistoryTable);\r\n      /* RtlUnwindEx should never return. */\r\n    }\r\n  }\r\n  return ExceptionContinueSearch;\r\n}\r\n\r\n/* Raise Windows exception. */\r\nstatic void err_raise_ext(int errcode)\r\n{\r\n  RaiseException(LJ_EXCODE_MAKE(errcode), 1 /* EH_NONCONTINUABLE */, 0, NULL);\r\n}\r\n\r\n#endif\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\n/* Throw error. Find catch frame, unwind stack and continue. */\r\nLJ_NOINLINE void LJ_FASTCALL lj_err_throw(lua_State *L, int errcode)\r\n{\r\n  global_State *g = G(L);\r\n  lj_trace_abort(g);\r\n  setgcrefnull(g->jit_L);\r\n  L->status = 0;\r\n#if LJ_UNWIND_EXT\r\n  err_raise_ext(errcode);\r\n  /*\r\n  ** A return from this function signals a corrupt C stack that cannot be\r\n  ** unwound. We have no choice but to call the panic function and exit.\r\n  **\r\n  ** Usually this is caused by a C function without unwind information.\r\n  ** This should never happen on x64, but may happen if you've manually\r\n  ** enabled LUAJIT_UNWIND_EXTERNAL and forgot to recompile *every*\r\n  ** non-C++ file with -funwind-tables.\r\n  */\r\n  if (G(L)->panic)\r\n    G(L)->panic(L);\r\n#else\r\n  {\r\n    void *cf = err_unwind(L, NULL, errcode);\r\n    if (cframe_unwind_ff(cf))\r\n      lj_vm_unwind_ff(cframe_raw(cf));\r\n    else\r\n      lj_vm_unwind_c(cframe_raw(cf), errcode);\r\n  }\r\n#endif\r\n  exit(EXIT_FAILURE);\r\n}\r\n\r\n/* Return string object for error message. */\r\nLJ_NOINLINE GCstr *lj_err_str(lua_State *L, ErrMsg em)\r\n{\r\n  return lj_str_newz(L, err2msg(em));\r\n}\r\n\r\n/* Out-of-memory error. */\r\nLJ_NOINLINE void lj_err_mem(lua_State *L)\r\n{\r\n  if (L->status == LUA_ERRERR+1)  /* Don't touch the stack during lua_open. */\r\n    lj_vm_unwind_c(L->cframe, LUA_ERRMEM);\r\n  setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRMEM));\r\n  lj_err_throw(L, LUA_ERRMEM);\r\n}\r\n\r\n/* Find error function for runtime errors. Requires an extra stack traversal. */\r\nstatic ptrdiff_t finderrfunc(lua_State *L)\r\n{\r\n  cTValue *frame = L->base-1, *bot = tvref(L->stack);\r\n  void *cf = L->cframe;\r\n  while (frame > bot && cf) {\r\n    while (cframe_nres(cframe_raw(cf)) < 0) {  /* cframe without frame? */\r\n      if (frame >= restorestack(L, -cframe_nres(cf)))\r\n\tbreak;\r\n      if (cframe_errfunc(cf) >= 0)  /* Error handler not inherited (-1)? */\r\n\treturn cframe_errfunc(cf);\r\n      cf = cframe_prev(cf);  /* Else unwind cframe and continue searching. */\r\n      if (cf == NULL)\r\n\treturn 0;\r\n    }\r\n    switch (frame_typep(frame)) {\r\n    case FRAME_LUA:\r\n    case FRAME_LUAP:\r\n      frame = frame_prevl(frame);\r\n      break;\r\n    case FRAME_C:\r\n      cf = cframe_prev(cf);\r\n      /* fallthrough */\r\n    case FRAME_VARG:\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_CONT:\r\n#if LJ_HASFFI\r\n      if ((frame-1)->u32.lo == LJ_CONT_FFI_CALLBACK)\r\n\tcf = cframe_prev(cf);\r\n#endif\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_CP:\r\n      if (cframe_canyield(cf)) return 0;\r\n      if (cframe_errfunc(cf) >= 0)\r\n\treturn cframe_errfunc(cf);\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_PCALL:\r\n    case FRAME_PCALLH:\r\n      if (frame_ftsz(frame) >= (ptrdiff_t)(2*sizeof(TValue)))  /* xpcall? */\r\n\treturn savestack(L, frame-1);  /* Point to xpcall's errorfunc. */\r\n      return 0;\r\n    default:\r\n      lua_assert(0);\r\n      return 0;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Runtime error. */\r\nLJ_NOINLINE void lj_err_run(lua_State *L)\r\n{\r\n  ptrdiff_t ef = finderrfunc(L);\r\n  if (ef) {\r\n    TValue *errfunc = restorestack(L, ef);\r\n    TValue *top = L->top;\r\n    lj_trace_abort(G(L));\r\n    if (!tvisfunc(errfunc) || L->status == LUA_ERRERR) {\r\n      setstrV(L, top-1, lj_err_str(L, LJ_ERR_ERRERR));\r\n      lj_err_throw(L, LUA_ERRERR);\r\n    }\r\n    L->status = LUA_ERRERR;\r\n    copyTV(L, top, top-1);\r\n    copyTV(L, top-1, errfunc);\r\n    L->top = top+1;\r\n    lj_vm_call(L, top, 1+1);  /* Stack: |errfunc|msg| -> |msg| */\r\n  }\r\n  lj_err_throw(L, LUA_ERRRUN);\r\n}\r\n\r\n/* Formatted runtime error message. */\r\nLJ_NORET LJ_NOINLINE static void err_msgv(lua_State *L, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  if (curr_funcisL(L)) L->top = curr_topL(L);\r\n  msg = lj_str_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  lj_debug_addloc(L, msg, L->base-1, NULL);\r\n  lj_err_run(L);\r\n}\r\n\r\n/* Non-vararg variant for better calling conventions. */\r\nLJ_NOINLINE void lj_err_msg(lua_State *L, ErrMsg em)\r\n{\r\n  err_msgv(L, em);\r\n}\r\n\r\n/* Lexer error. */\r\nLJ_NOINLINE void lj_err_lex(lua_State *L, GCstr *src, const char *tok,\r\n\t\t\t    BCLine line, ErrMsg em, va_list argp)\r\n{\r\n  char buff[LUA_IDSIZE];\r\n  const char *msg;\r\n  lj_debug_shortname(buff, src);\r\n  msg = lj_str_pushvf(L, err2msg(em), argp);\r\n  msg = lj_str_pushf(L, \"%s:%d: %s\", buff, line, msg);\r\n  if (tok)\r\n    lj_str_pushf(L, err2msg(LJ_ERR_XNEAR), msg, tok);\r\n  lj_err_throw(L, LUA_ERRSYNTAX);\r\n}\r\n\r\n/* Typecheck error for operands. */\r\nLJ_NOINLINE void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm)\r\n{\r\n  const char *tname = lj_typename(o);\r\n  const char *opname = err2msg(opm);\r\n  if (curr_funcisL(L)) {\r\n    GCproto *pt = curr_proto(L);\r\n    const BCIns *pc = cframe_Lpc(L) - 1;\r\n    const char *oname = NULL;\r\n    const char *kind = lj_debug_slotname(pt, pc, (BCReg)(o-L->base), &oname);\r\n    if (kind)\r\n      err_msgv(L, LJ_ERR_BADOPRT, opname, kind, oname, tname);\r\n  }\r\n  err_msgv(L, LJ_ERR_BADOPRV, opname, tname);\r\n}\r\n\r\n/* Typecheck error for ordered comparisons. */\r\nLJ_NOINLINE void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2)\r\n{\r\n  const char *t1 = lj_typename(o1);\r\n  const char *t2 = lj_typename(o2);\r\n  err_msgv(L, t1 == t2 ? LJ_ERR_BADCMPV : LJ_ERR_BADCMPT, t1, t2);\r\n  /* This assumes the two \"boolean\" entries are commoned by the C compiler. */\r\n}\r\n\r\n/* Typecheck error for __call. */\r\nLJ_NOINLINE void lj_err_optype_call(lua_State *L, TValue *o)\r\n{\r\n  /* Gross hack if lua_[p]call or pcall/xpcall fail for a non-callable object:\r\n  ** L->base still points to the caller. So add a dummy frame with L instead\r\n  ** of a function. See lua_getstack().\r\n  */\r\n  const BCIns *pc = cframe_Lpc(L);\r\n  if (((ptrdiff_t)pc & FRAME_TYPE) != FRAME_LUA) {\r\n    const char *tname = lj_typename(o);\r\n    setframe_pc(o, pc);\r\n    setframe_gc(o, obj2gco(L));\r\n    L->top = L->base = o+1;\r\n    err_msgv(L, LJ_ERR_BADCALL, tname);\r\n  }\r\n  lj_err_optype(L, o, LJ_ERR_OPCALL);\r\n}\r\n\r\n/* Error in context of caller. */\r\nLJ_NOINLINE void lj_err_callermsg(lua_State *L, const char *msg)\r\n{\r\n  TValue *frame = L->base-1;\r\n  TValue *pframe = NULL;\r\n  if (frame_islua(frame)) {\r\n    pframe = frame_prevl(frame);\r\n  } else if (frame_iscont(frame)) {\r\n#if LJ_HASFFI\r\n    if ((frame-1)->u32.lo == LJ_CONT_FFI_CALLBACK) {\r\n      pframe = frame;\r\n      frame = NULL;\r\n    } else\r\n#endif\r\n    {\r\n      pframe = frame_prevd(frame);\r\n#if LJ_HASFFI\r\n      /* Remove frame for FFI metamethods. */\r\n      if (frame_func(frame)->c.ffid >= FF_ffi_meta___index &&\r\n\t  frame_func(frame)->c.ffid <= FF_ffi_meta___tostring) {\r\n\tL->base = pframe+1;\r\n\tL->top = frame;\r\n\tsetcframe_pc(cframe_raw(L->cframe), frame_contpc(frame));\r\n      }\r\n#endif\r\n    }\r\n  }\r\n  lj_debug_addloc(L, msg, pframe, frame);\r\n  lj_err_run(L);\r\n}\r\n\r\n/* Formatted error in context of caller. */\r\nLJ_NOINLINE void lj_err_callerv(lua_State *L, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  msg = lj_str_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\n/* Error in context of caller. */\r\nLJ_NOINLINE void lj_err_caller(lua_State *L, ErrMsg em)\r\n{\r\n  lj_err_callermsg(L, err2msg(em));\r\n}\r\n\r\n/* Argument error message. */\r\nLJ_NORET LJ_NOINLINE static void err_argmsg(lua_State *L, int narg,\r\n\t\t\t\t\t    const char *msg)\r\n{\r\n  const char *fname = \"?\";\r\n  const char *ftype = lj_debug_funcname(L, L->base - 1, &fname);\r\n  if (narg < 0 && narg > LUA_REGISTRYINDEX)\r\n    narg = (int)(L->top - L->base) + narg + 1;\r\n  if (ftype && ftype[3] == 'h' && --narg == 0)  /* Check for \"method\". */\r\n    msg = lj_str_pushf(L, err2msg(LJ_ERR_BADSELF), fname, msg);\r\n  else\r\n    msg = lj_str_pushf(L, err2msg(LJ_ERR_BADARG), narg, fname, msg);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\n/* Formatted argument error. */\r\nLJ_NOINLINE void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  msg = lj_str_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  err_argmsg(L, narg, msg);\r\n}\r\n\r\n/* Argument error. */\r\nLJ_NOINLINE void lj_err_arg(lua_State *L, int narg, ErrMsg em)\r\n{\r\n  err_argmsg(L, narg, err2msg(em));\r\n}\r\n\r\n/* Typecheck error for arguments. */\r\nLJ_NOINLINE void lj_err_argtype(lua_State *L, int narg, const char *xname)\r\n{\r\n  const char *tname, *msg;\r\n  if (narg <= LUA_REGISTRYINDEX) {\r\n    if (narg >= LUA_GLOBALSINDEX) {\r\n      tname = lj_obj_itypename[~LJ_TTAB];\r\n    } else {\r\n      GCfunc *fn = curr_func(L);\r\n      int idx = LUA_GLOBALSINDEX - narg;\r\n      if (idx <= fn->c.nupvalues)\r\n\ttname = lj_typename(&fn->c.upvalue[idx-1]);\r\n      else\r\n\ttname = lj_obj_typename[0];\r\n    }\r\n  } else {\r\n    TValue *o = narg < 0 ? L->top + narg : L->base + narg-1;\r\n    tname = o < L->top ? lj_typename(o) : lj_obj_typename[0];\r\n  }\r\n  msg = lj_str_pushf(L, err2msg(LJ_ERR_BADTYPE), xname, tname);\r\n  err_argmsg(L, narg, msg);\r\n}\r\n\r\n/* Typecheck error for arguments. */\r\nLJ_NOINLINE void lj_err_argt(lua_State *L, int narg, int tt)\r\n{\r\n  lj_err_argtype(L, narg, lj_obj_typename[tt+1]);\r\n}\r\n\r\n/* -- Public error handling API ------------------------------------------- */\r\n\r\nLUA_API lua_CFunction lua_atpanic(lua_State *L, lua_CFunction panicf)\r\n{\r\n  lua_CFunction old = G(L)->panic;\r\n  G(L)->panic = panicf;\r\n  return old;\r\n}\r\n\r\n/* Forwarders for the public API (C calling convention and no LJ_NORET). */\r\nLUA_API int lua_error(lua_State *L)\r\n{\r\n  lj_err_run(L);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API int luaL_argerror(lua_State *L, int narg, const char *msg)\r\n{\r\n  err_argmsg(L, narg, msg);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API int luaL_typerror(lua_State *L, int narg, const char *xname)\r\n{\r\n  lj_err_argtype(L, narg, xname);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API void luaL_where(lua_State *L, int level)\r\n{\r\n  int size;\r\n  cTValue *frame = lj_debug_frame(L, level, &size);\r\n  lj_debug_addloc(L, \"\", frame, size ? frame+size : NULL);\r\n}\r\n\r\nLUALIB_API int luaL_error(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  msg = lj_str_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  lj_err_callermsg(L, msg);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_err.h",
    "content": "/*\r\n** Error handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ERR_H\r\n#define _LJ_ERR_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\ntypedef enum {\r\n#define ERRDEF(name, msg) \\\r\n  LJ_ERR_##name, LJ_ERR_##name##_ = LJ_ERR_##name + sizeof(msg)-1,\r\n#include \"lj_errmsg.h\"\r\n  LJ_ERR__MAX\r\n} ErrMsg;\r\n\r\nLJ_DATA const char *lj_err_allmsg;\r\n#define err2msg(em)\t(lj_err_allmsg+(int)(em))\r\n\r\nLJ_FUNC GCstr *lj_err_str(lua_State *L, ErrMsg em);\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_err_throw(lua_State *L, int errcode);\r\nLJ_FUNC_NORET void lj_err_mem(lua_State *L);\r\nLJ_FUNC_NORET void lj_err_run(lua_State *L);\r\nLJ_FUNC_NORET void lj_err_msg(lua_State *L, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_lex(lua_State *L, GCstr *src, const char *tok,\r\n\t\t\t      BCLine line, ErrMsg em, va_list argp);\r\nLJ_FUNC_NORET void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm);\r\nLJ_FUNC_NORET void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2);\r\nLJ_FUNC_NORET void lj_err_optype_call(lua_State *L, TValue *o);\r\nLJ_FUNC_NORET void lj_err_callermsg(lua_State *L, const char *msg);\r\nLJ_FUNC_NORET void lj_err_callerv(lua_State *L, ErrMsg em, ...);\r\nLJ_FUNC_NORET void lj_err_caller(lua_State *L, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_arg(lua_State *L, int narg, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...);\r\nLJ_FUNC_NORET void lj_err_argtype(lua_State *L, int narg, const char *xname);\r\nLJ_FUNC_NORET void lj_err_argt(lua_State *L, int narg, int tt);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_errmsg.h",
    "content": "/*\r\n** VM error messages.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* This file may be included multiple times with different ERRDEF macros. */\r\n\r\n/* Basic error handling. */\r\nERRDEF(ERRMEM,\t\"not enough memory\")\r\nERRDEF(ERRERR,\t\"error in error handling\")\r\nERRDEF(ERRCPP,\t\"C++ exception\")\r\n\r\n/* Allocations. */\r\nERRDEF(STROV,\t\"string length overflow\")\r\nERRDEF(UDATAOV,\t\"userdata length overflow\")\r\nERRDEF(STKOV,\t\"stack overflow\")\r\nERRDEF(STKOVM,\t\"stack overflow (%s)\")\r\nERRDEF(TABOV,\t\"table overflow\")\r\n\r\n/* Table indexing. */\r\nERRDEF(NANIDX,\t\"table index is NaN\")\r\nERRDEF(NILIDX,\t\"table index is nil\")\r\nERRDEF(NEXTIDX,\t\"invalid key to \" LUA_QL(\"next\"))\r\n\r\n/* Metamethod resolving. */\r\nERRDEF(BADCALL,\t\"attempt to call a %s value\")\r\nERRDEF(BADOPRT,\t\"attempt to %s %s \" LUA_QS \" (a %s value)\")\r\nERRDEF(BADOPRV,\t\"attempt to %s a %s value\")\r\nERRDEF(BADCMPT,\t\"attempt to compare %s with %s\")\r\nERRDEF(BADCMPV,\t\"attempt to compare two %s values\")\r\nERRDEF(GETLOOP,\t\"loop in gettable\")\r\nERRDEF(SETLOOP,\t\"loop in settable\")\r\nERRDEF(OPCALL,\t\"call\")\r\nERRDEF(OPINDEX,\t\"index\")\r\nERRDEF(OPARITH,\t\"perform arithmetic on\")\r\nERRDEF(OPCAT,\t\"concatenate\")\r\nERRDEF(OPLEN,\t\"get length of\")\r\n\r\n/* Type checks. */\r\nERRDEF(BADSELF,\t\"calling \" LUA_QS \" on bad self (%s)\")\r\nERRDEF(BADARG,\t\"bad argument #%d to \" LUA_QS \" (%s)\")\r\nERRDEF(BADTYPE,\t\"%s expected, got %s\")\r\nERRDEF(BADVAL,\t\"invalid value\")\r\nERRDEF(NOVAL,\t\"value expected\")\r\nERRDEF(NOCORO,\t\"coroutine expected\")\r\nERRDEF(NOTABN,\t\"nil or table expected\")\r\nERRDEF(NOLFUNC,\t\"Lua function expected\")\r\nERRDEF(NOFUNCL,\t\"function or level expected\")\r\nERRDEF(NOSFT,\t\"string/function/table expected\")\r\nERRDEF(NOPROXY,\t\"boolean or proxy expected\")\r\nERRDEF(FORINIT,\tLUA_QL(\"for\") \" initial value must be a number\")\r\nERRDEF(FORLIM,\tLUA_QL(\"for\") \" limit must be a number\")\r\nERRDEF(FORSTEP,\tLUA_QL(\"for\") \" step must be a number\")\r\n\r\n/* C API checks. */\r\nERRDEF(NOENV,\t\"no calling environment\")\r\nERRDEF(CYIELD,\t\"attempt to yield across C-call boundary\")\r\nERRDEF(BADLU,\t\"bad light userdata pointer\")\r\nERRDEF(NOGCMM,\t\"bad action while in __gc metamethod\")\r\n#if LJ_TARGET_WINDOWS\r\nERRDEF(BADFPU,\t\"bad FPU precision (use D3DCREATE_FPU_PRESERVE with DirectX)\")\r\n#endif\r\n\r\n/* Standard library function errors. */\r\nERRDEF(ASSERT,\t\"assertion failed!\")\r\nERRDEF(PROTMT,\t\"cannot change a protected metatable\")\r\nERRDEF(UNPACK,\t\"too many results to unpack\")\r\nERRDEF(RDRSTR,\t\"reader function must return a string\")\r\nERRDEF(PRTOSTR,\tLUA_QL(\"tostring\") \" must return a string to \" LUA_QL(\"print\"))\r\nERRDEF(IDXRNG,\t\"index out of range\")\r\nERRDEF(BASERNG,\t\"base out of range\")\r\nERRDEF(LVLRNG,\t\"level out of range\")\r\nERRDEF(INVLVL,\t\"invalid level\")\r\nERRDEF(INVOPT,\t\"invalid option\")\r\nERRDEF(INVOPTM,\t\"invalid option \" LUA_QS)\r\nERRDEF(INVFMT,\t\"invalid format\")\r\nERRDEF(SETFENV,\tLUA_QL(\"setfenv\") \" cannot change environment of given object\")\r\nERRDEF(CORUN,\t\"cannot resume running coroutine\")\r\nERRDEF(CODEAD,\t\"cannot resume dead coroutine\")\r\nERRDEF(COSUSP,\t\"cannot resume non-suspended coroutine\")\r\nERRDEF(TABINS,\t\"wrong number of arguments to \" LUA_QL(\"insert\"))\r\nERRDEF(TABCAT,\t\"invalid value (%s) at index %d in table for \" LUA_QL(\"concat\"))\r\nERRDEF(TABSORT,\t\"invalid order function for sorting\")\r\nERRDEF(IOCLFL,\t\"attempt to use a closed file\")\r\nERRDEF(IOSTDCL,\t\"standard file is closed\")\r\nERRDEF(OSUNIQF,\t\"unable to generate a unique filename\")\r\nERRDEF(OSDATEF,\t\"field \" LUA_QS \" missing in date table\")\r\nERRDEF(STRDUMP,\t\"unable to dump given function\")\r\nERRDEF(STRSLC,\t\"string slice too long\")\r\nERRDEF(STRPATB,\t\"missing \" LUA_QL(\"[\") \" after \" LUA_QL(\"%f\") \" in pattern\")\r\nERRDEF(STRPATC,\t\"invalid pattern capture\")\r\nERRDEF(STRPATE,\t\"malformed pattern (ends with \" LUA_QL(\"%\") \")\")\r\nERRDEF(STRPATM,\t\"malformed pattern (missing \" LUA_QL(\"]\") \")\")\r\nERRDEF(STRPATU,\t\"unbalanced pattern\")\r\nERRDEF(STRPATX,\t\"pattern too complex\")\r\nERRDEF(STRCAPI,\t\"invalid capture index\")\r\nERRDEF(STRCAPN,\t\"too many captures\")\r\nERRDEF(STRCAPU,\t\"unfinished capture\")\r\nERRDEF(STRFMTO,\t\"invalid option \" LUA_QL(\"%%%c\") \" to \" LUA_QL(\"format\"))\r\nERRDEF(STRFMTR,\t\"invalid format (repeated flags)\")\r\nERRDEF(STRFMTW,\t\"invalid format (width or precision too long)\")\r\nERRDEF(STRGSRV,\t\"invalid replacement value (a %s)\")\r\nERRDEF(BADMODN,\t\"name conflict for module \" LUA_QS)\r\n#if LJ_HASJIT\r\nERRDEF(JITPROT,\t\"runtime code generation failed, restricted kernel?\")\r\n#if LJ_TARGET_X86ORX64\r\nERRDEF(NOJIT,\t\"JIT compiler disabled, CPU does not support SSE2\")\r\n#else\r\nERRDEF(NOJIT,\t\"JIT compiler disabled\")\r\n#endif\r\n#elif defined(LJ_ARCH_NOJIT)\r\nERRDEF(NOJIT,\t\"no JIT compiler for this architecture (yet)\")\r\n#else\r\nERRDEF(NOJIT,\t\"JIT compiler permanently disabled by build option\")\r\n#endif\r\nERRDEF(JITOPT,\t\"unknown or malformed optimization flag \" LUA_QS)\r\n\r\n/* Lexer/parser errors. */\r\nERRDEF(XMODE,\t\"attempt to load chunk with wrong mode\")\r\nERRDEF(XNEAR,\t\"%s near \" LUA_QS)\r\nERRDEF(XELEM,\t\"lexical element too long\")\r\nERRDEF(XLINES,\t\"chunk has too many lines\")\r\nERRDEF(XLEVELS,\t\"chunk has too many syntax levels\")\r\nERRDEF(XNUMBER,\t\"malformed number\")\r\nERRDEF(XLSTR,\t\"unfinished long string\")\r\nERRDEF(XLCOM,\t\"unfinished long comment\")\r\nERRDEF(XSTR,\t\"unfinished string\")\r\nERRDEF(XESC,\t\"invalid escape sequence\")\r\nERRDEF(XLDELIM,\t\"invalid long string delimiter\")\r\nERRDEF(XTOKEN,\tLUA_QS \" expected\")\r\nERRDEF(XJUMP,\t\"control structure too long\")\r\nERRDEF(XSLOTS,\t\"function or expression too complex\")\r\nERRDEF(XLIMC,\t\"chunk has more than %d local variables\")\r\nERRDEF(XLIMM,\t\"main function has more than %d %s\")\r\nERRDEF(XLIMF,\t\"function at line %d has more than %d %s\")\r\nERRDEF(XMATCH,\tLUA_QS \" expected (to close \" LUA_QS \" at line %d)\")\r\nERRDEF(XFIXUP,\t\"function too long for return fixup\")\r\nERRDEF(XPARAM,\t\"<name> or \" LUA_QL(\"...\") \" expected\")\r\n#if !LJ_52\r\nERRDEF(XAMBIG,\t\"ambiguous syntax (function call x new statement)\")\r\n#endif\r\nERRDEF(XFUNARG,\t\"function arguments expected\")\r\nERRDEF(XSYMBOL,\t\"unexpected symbol\")\r\nERRDEF(XDOTS,\t\"cannot use \" LUA_QL(\"...\") \" outside a vararg function\")\r\nERRDEF(XSYNTAX,\t\"syntax error\")\r\nERRDEF(XFOR,\tLUA_QL(\"=\") \" or \" LUA_QL(\"in\") \" expected\")\r\nERRDEF(XBREAK,\t\"no loop to break\")\r\nERRDEF(XLUNDEF,\t\"undefined label \" LUA_QS)\r\nERRDEF(XLDUP,\t\"duplicate label \" LUA_QS)\r\nERRDEF(XGSCOPE,\t\"<goto %s> jumps into the scope of local \" LUA_QS)\r\n\r\n/* Bytecode reader errors. */\r\nERRDEF(BCFMT,\t\"cannot load incompatible bytecode\")\r\nERRDEF(BCBAD,\t\"cannot load malformed bytecode\")\r\n\r\n#if LJ_HASFFI\r\n/* FFI errors. */\r\nERRDEF(FFI_INVTYPE,\t\"invalid C type\")\r\nERRDEF(FFI_INVSIZE,\t\"size of C type is unknown or too large\")\r\nERRDEF(FFI_BADSCL,\t\"bad storage class\")\r\nERRDEF(FFI_DECLSPEC,\t\"declaration specifier expected\")\r\nERRDEF(FFI_BADTAG,\t\"undeclared or implicit tag \" LUA_QS)\r\nERRDEF(FFI_REDEF,\t\"attempt to redefine \" LUA_QS)\r\nERRDEF(FFI_NUMPARAM,\t\"wrong number of type parameters\")\r\nERRDEF(FFI_INITOV,\t\"too many initializers for \" LUA_QS)\r\nERRDEF(FFI_BADCONV,\t\"cannot convert \" LUA_QS \" to \" LUA_QS)\r\nERRDEF(FFI_BADLEN,\t\"attempt to get length of \" LUA_QS)\r\nERRDEF(FFI_BADCONCAT,\t\"attempt to concatenate \" LUA_QS \" and \" LUA_QS)\r\nERRDEF(FFI_BADARITH,\t\"attempt to perform arithmetic on \" LUA_QS \" and \" LUA_QS)\r\nERRDEF(FFI_BADCOMP,\t\"attempt to compare \" LUA_QS \" with \" LUA_QS)\r\nERRDEF(FFI_BADCALL,\tLUA_QS \" is not callable\")\r\nERRDEF(FFI_NUMARG,\t\"wrong number of arguments for function call\")\r\nERRDEF(FFI_BADMEMBER,\tLUA_QS \" has no member named \" LUA_QS)\r\nERRDEF(FFI_BADIDX,\tLUA_QS \" cannot be indexed\")\r\nERRDEF(FFI_BADIDXW,\tLUA_QS \" cannot be indexed with \" LUA_QS)\r\nERRDEF(FFI_BADMM,\tLUA_QS \" has no \" LUA_QS \" metamethod\")\r\nERRDEF(FFI_WRCONST,\t\"attempt to write to constant location\")\r\nERRDEF(FFI_NODECL,\t\"missing declaration for symbol \" LUA_QS)\r\nERRDEF(FFI_BADCBACK,\t\"bad callback\")\r\n#if LJ_OS_NOJIT\r\nERRDEF(FFI_CBACKOV,\t\"no support for callbacks on this OS\")\r\n#else\r\nERRDEF(FFI_CBACKOV,\t\"too many callbacks\")\r\n#endif\r\nERRDEF(FFI_NYIPACKBIT,\t\"NYI: packed bit fields\")\r\nERRDEF(FFI_NYICALL,\t\"NYI: cannot call this C function (yet)\")\r\n#endif\r\n\r\n#undef ERRDEF\r\n\r\n/* Detecting unused error messages:\r\n   awk -F, '/^ERRDEF/ { gsub(/ERRDEF./, \"\"); printf \"grep -q LJ_ERR_%s *.[ch] || echo %s\\n\", $1, $1}' lj_errmsg.h | sh\r\n*/\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ff.h",
    "content": "/*\r\n** Fast function IDs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FF_H\r\n#define _LJ_FF_H\r\n\r\n/* Fast function ID. */\r\ntypedef enum {\r\n  FF_LUA_ = FF_LUA,\t/* Lua function (must be 0). */\r\n  FF_C_ = FF_C,\t\t/* Regular C function (must be 1). */\r\n#define FFDEF(name)\tFF_##name,\r\n#include \"lj_ffdef.h\"\r\n  FF__MAX\r\n} FastFunc;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ffrecord.c",
    "content": "/*\r\n** Fast function call recorder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ffrecord_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_crecord.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* -- Fast function recording handlers ------------------------------------ */\r\n\r\n/* Conventions for fast function call handlers:\r\n**\r\n** The argument slots start at J->base[0]. All of them are guaranteed to be\r\n** valid and type-specialized references. J->base[J->maxslot] is set to 0\r\n** as a sentinel. The runtime argument values start at rd->argv[0].\r\n**\r\n** In general fast functions should check for presence of all of their\r\n** arguments and for the correct argument types. Some simplifications\r\n** are allowed if the interpreter throws instead. But even if recording\r\n** is aborted, the generated IR must be consistent (no zero-refs).\r\n**\r\n** The number of results in rd->nres is set to 1. Handlers that return\r\n** a different number of results need to override it. A negative value\r\n** prevents return processing (e.g. for pending calls).\r\n**\r\n** Results need to be stored starting at J->base[0]. Return processing\r\n** moves them to the right slots later.\r\n**\r\n** The per-ffid auxiliary data is the value of the 2nd part of the\r\n** LJLIB_REC() annotation. This allows handling similar functionality\r\n** in a common handler.\r\n*/\r\n\r\n/* Type of handler to record a fast function. */\r\ntypedef void (LJ_FASTCALL *RecordFunc)(jit_State *J, RecordFFData *rd);\r\n\r\n/* Get runtime value of int argument. */\r\nstatic int32_t argv2int(jit_State *J, TValue *o)\r\n{\r\n  if (!lj_strscan_numberobj(o))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  return tvisint(o) ? intV(o) : lj_num2int(numV(o));\r\n}\r\n\r\n/* Get runtime value of string argument. */\r\nstatic GCstr *argv2str(jit_State *J, TValue *o)\r\n{\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    return strV(o);\r\n  } else {\r\n    GCstr *s;\r\n    if (!tvisnumber(o))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    if (tvisint(o))\r\n      s = lj_str_fromint(J->L, intV(o));\r\n    else\r\n      s = lj_str_fromnum(J->L, &o->n);\r\n    setstrV(J->L, o, s);\r\n    return s;\r\n  }\r\n}\r\n\r\n/* Return number of results wanted by caller. */\r\nstatic ptrdiff_t results_wanted(jit_State *J)\r\n{\r\n  TValue *frame = J->L->base-1;\r\n  if (frame_islua(frame))\r\n    return (ptrdiff_t)bc_b(frame_pc(frame)[-1]) - 1;\r\n  else\r\n    return -1;\r\n}\r\n\r\n/* Throw error for unsupported variant of fast function. */\r\nLJ_NORET static void recff_nyiu(jit_State *J)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYIFFU);\r\n}\r\n\r\n/* Fallback handler for all fast functions that are not recorded (yet). */\r\nstatic void LJ_FASTCALL recff_nyi(jit_State *J, RecordFFData *rd)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYIFF);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* C functions can have arbitrary side-effects and are not recorded (yet). */\r\nstatic void LJ_FASTCALL recff_c(jit_State *J, RecordFFData *rd)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYICF);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* -- Base library fast functions ----------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_assert(jit_State *J, RecordFFData *rd)\r\n{\r\n  /* Arguments already specialized. The interpreter throws for nil/false. */\r\n  rd->nres = J->maxslot;  /* Pass through all arguments. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_type(jit_State *J, RecordFFData *rd)\r\n{\r\n  /* Arguments already specialized. Result is a constant string. Neat, huh? */\r\n  uint32_t t;\r\n  if (tvisnumber(&rd->argv[0]))\r\n    t = ~LJ_TNUMX;\r\n  else if (LJ_64 && tvislightud(&rd->argv[0]))\r\n    t = ~LJ_TLIGHTUD;\r\n  else\r\n    t = ~itype(&rd->argv[0]);\r\n  J->base[0] = lj_ir_kstr(J, strV(&J->fn->c.upvalue[t]));\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_getmetatable(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    RecordIndex ix;\r\n    ix.tab = tr;\r\n    copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n    if (lj_record_mm_lookup(J, &ix, MM_metatable))\r\n      J->base[0] = ix.mobj;\r\n    else\r\n      J->base[0] = ix.mt;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_setmetatable(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  TRef mt = J->base[1];\r\n  if (tref_istab(tr) && (tref_istab(mt) || (mt && tref_isnil(mt)))) {\r\n    TRef fref, mtref;\r\n    RecordIndex ix;\r\n    ix.tab = tr;\r\n    copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n    lj_record_mm_lookup(J, &ix, MM_metatable); /* Guard for no __metatable. */\r\n    fref = emitir(IRT(IR_FREF, IRT_P32), tr, IRFL_TAB_META);\r\n    mtref = tref_isnil(mt) ? lj_ir_knull(J, IRT_TAB) : mt;\r\n    emitir(IRT(IR_FSTORE, IRT_TAB), fref, mtref);\r\n    if (!tref_isnil(mt))\r\n      emitir(IRT(IR_TBAR, IRT_TAB), tr, 0);\r\n    J->base[0] = tr;\r\n    J->needsnap = 1;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawget(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0]; ix.key = J->base[1];\r\n  if (tref_istab(ix.tab) && ix.key) {\r\n    ix.val = 0; ix.idxchain = 0;\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    copyTV(J->L, &ix.keyv, &rd->argv[1]);\r\n    J->base[0] = lj_record_idx(J, &ix);\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawset(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0]; ix.key = J->base[1]; ix.val = J->base[2];\r\n  if (tref_istab(ix.tab) && ix.key && ix.val) {\r\n    ix.idxchain = 0;\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    copyTV(J->L, &ix.keyv, &rd->argv[1]);\r\n    copyTV(J->L, &ix.valv, &rd->argv[2]);\r\n    lj_record_idx(J, &ix);\r\n    /* Pass through table at J->base[0] as result. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawequal(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tra = J->base[0];\r\n  TRef trb = J->base[1];\r\n  if (tra && trb) {\r\n    int diff = lj_record_objcmp(J, tra, trb, &rd->argv[0], &rd->argv[1]);\r\n    J->base[0] = diff ? TREF_FALSE : TREF_TRUE;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\n#if LJ_52\r\nstatic void LJ_FASTCALL recff_rawlen(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isstr(tr))\r\n    J->base[0] = emitir(IRTI(IR_FLOAD), tr, IRFL_STR_LEN);\r\n  else if (tref_istab(tr))\r\n    J->base[0] = lj_ir_call(J, IRCALL_lj_tab_len, tr);\r\n  /* else: Interpreter will throw. */\r\n  UNUSED(rd);\r\n}\r\n#endif\r\n\r\n/* Determine mode of select() call. */\r\nint32_t lj_ffrecord_select_mode(jit_State *J, TRef tr, TValue *tv)\r\n{\r\n  if (tref_isstr(tr) && *strVdata(tv) == '#') {  /* select('#', ...) */\r\n    if (strV(tv)->len == 1) {\r\n      emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, strV(tv)));\r\n    } else {\r\n      TRef trptr = emitir(IRT(IR_STRREF, IRT_P32), tr, lj_ir_kint(J, 0));\r\n      TRef trchar = emitir(IRT(IR_XLOAD, IRT_U8), trptr, IRXLOAD_READONLY);\r\n      emitir(IRTG(IR_EQ, IRT_INT), trchar, lj_ir_kint(J, '#'));\r\n    }\r\n    return 0;\r\n  } else {  /* select(n, ...) */\r\n    int32_t start = argv2int(J, tv);\r\n    if (start == 0) lj_trace_err(J, LJ_TRERR_BADTYPE);  /* A bit misleading. */\r\n    return start;\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_select(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    ptrdiff_t start = lj_ffrecord_select_mode(J, tr, &rd->argv[0]);\r\n    if (start == 0) {  /* select('#', ...) */\r\n      J->base[0] = lj_ir_kint(J, J->maxslot - 1);\r\n    } else if (tref_isk(tr)) {  /* select(k, ...) */\r\n      ptrdiff_t n = (ptrdiff_t)J->maxslot;\r\n      if (start < 0) start += n;\r\n      else if (start > n) start = n;\r\n      rd->nres = n - start;\r\n      if (start >= 1) {\r\n\tptrdiff_t i;\r\n\tfor (i = 0; i < n - start; i++)\r\n\t  J->base[i] = J->base[start+i];\r\n      }  /* else: Interpreter will throw. */\r\n    } else {\r\n      recff_nyiu(J);\r\n    }\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_tonumber(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  TRef base = J->base[1];\r\n  if (tr && !tref_isnil(base)) {\r\n    base = lj_opt_narrow_toint(J, base);\r\n    if (!tref_isk(base) || IR(tref_ref(base))->i != 10)\r\n      recff_nyiu(J);\r\n  }\r\n  if (tref_isnumber_str(tr)) {\r\n    if (tref_isstr(tr)) {\r\n      TValue tmp;\r\n      if (!lj_strscan_num(strV(&rd->argv[0]), &tmp))\r\n\trecff_nyiu(J);  /* Would need an inverted STRTO for this case. */\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    }\r\n#if LJ_HASFFI\r\n  } else if (tref_iscdata(tr)) {\r\n    lj_crecord_tonumber(J, rd);\r\n    return;\r\n#endif\r\n  } else {\r\n    tr = TREF_NIL;\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic TValue *recff_metacall_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  lj_record_tailcall(J, 0, 1);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\nstatic int recff_metacall(jit_State *J, RecordFFData *rd, MMS mm)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n  if (lj_record_mm_lookup(J, &ix, mm)) {  /* Has metamethod? */\r\n    int errcode;\r\n    TValue argv0;\r\n    /* Temporarily insert metamethod below object. */\r\n    J->base[1] = J->base[0];\r\n    J->base[0] = ix.mobj;\r\n    copyTV(J->L, &argv0, &rd->argv[0]);\r\n    copyTV(J->L, &rd->argv[1], &rd->argv[0]);\r\n    copyTV(J->L, &rd->argv[0], &ix.mobjv);\r\n    /* Need to protect lj_record_tailcall because it may throw. */\r\n    errcode = lj_vm_cpcall(J->L, NULL, J, recff_metacall_cp);\r\n    /* Always undo Lua stack changes to avoid confusing the interpreter. */\r\n    copyTV(J->L, &rd->argv[0], &argv0);\r\n    if (errcode)\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    rd->nres = -1;  /* Pending call. */\r\n    return 1;  /* Tailcalled to metamethod. */\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_tostring(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isstr(tr)) {\r\n    /* Ignore __tostring in the string base metatable. */\r\n    /* Pass on result in J->base[0]. */\r\n  } else if (!recff_metacall(J, rd, MM_tostring)) {\r\n    if (tref_isnumber(tr)) {\r\n      J->base[0] = emitir(IRT(IR_TOSTR, IRT_STR), tr, 0);\r\n    } else if (tref_ispri(tr)) {\r\n      J->base[0] = lj_ir_kstr(J, strV(&J->fn->c.upvalue[tref_type(tr)]));\r\n    } else {\r\n      recff_nyiu(J);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_ipairs_aux(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  if (tref_istab(ix.tab)) {\r\n    if (!tvisnumber(&rd->argv[1]))  /* No support for string coercion. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    setintV(&ix.keyv, numberVint(&rd->argv[1])+1);\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    ix.val = 0; ix.idxchain = 0;\r\n    ix.key = lj_opt_narrow_toint(J, J->base[1]);\r\n    J->base[0] = ix.key = emitir(IRTI(IR_ADD), ix.key, lj_ir_kint(J, 1));\r\n    J->base[1] = lj_record_idx(J, &ix);\r\n    rd->nres = tref_isnil(J->base[1]) ? 0 : 2;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_ipairs(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (!(LJ_52 && recff_metacall(J, rd, MM_ipairs))) {\r\n    TRef tab = J->base[0];\r\n    if (tref_istab(tab)) {\r\n      J->base[0] = lj_ir_kfunc(J, funcV(&J->fn->c.upvalue[0]));\r\n      J->base[1] = tab;\r\n      J->base[2] = lj_ir_kint(J, 0);\r\n      rd->nres = 3;\r\n    }  /* else: Interpreter will throw. */\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_pcall(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (J->maxslot >= 1) {\r\n    lj_record_call(J, 0, J->maxslot - 1);\r\n    rd->nres = -1;  /* Pending call. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic TValue *recff_xpcall_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  lj_record_call(J, 1, J->maxslot - 2);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_xpcall(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (J->maxslot >= 2) {\r\n    TValue argv0, argv1;\r\n    TRef tmp;\r\n    int errcode;\r\n    /* Swap function and traceback. */\r\n    tmp = J->base[0]; J->base[0] = J->base[1]; J->base[1] = tmp;\r\n    copyTV(J->L, &argv0, &rd->argv[0]);\r\n    copyTV(J->L, &argv1, &rd->argv[1]);\r\n    copyTV(J->L, &rd->argv[0], &argv1);\r\n    copyTV(J->L, &rd->argv[1], &argv0);\r\n    /* Need to protect lj_record_call because it may throw. */\r\n    errcode = lj_vm_cpcall(J->L, NULL, J, recff_xpcall_cp);\r\n    /* Always undo Lua stack swap to avoid confusing the interpreter. */\r\n    copyTV(J->L, &rd->argv[0], &argv0);\r\n    copyTV(J->L, &rd->argv[1], &argv1);\r\n    if (errcode)\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    rd->nres = -1;  /* Pending call. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\n/* -- Math library fast functions ----------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_math_abs(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  J->base[0] = emitir(IRTN(IR_ABS), tr, lj_ir_knum_abs(J));\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record rounding functions math.floor and math.ceil. */\r\nstatic void LJ_FASTCALL recff_math_round(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (!tref_isinteger(tr)) {  /* Pass through integers unmodified. */\r\n    tr = emitir(IRTN(IR_FPMATH), lj_ir_tonum(J, tr), rd->data);\r\n    /* Result is integral (or NaN/Inf), but may not fit an int32_t. */\r\n    if (LJ_DUALNUM) {  /* Try to narrow using a guarded conversion to int. */\r\n      lua_Number n = lj_vm_foldfpm(numberVnum(&rd->argv[0]), rd->data);\r\n      if (n == (lua_Number)lj_num2int(n))\r\n\ttr = emitir(IRTGI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_CHECK);\r\n    }\r\n    J->base[0] = tr;\r\n  }\r\n}\r\n\r\n/* Record unary math.* functions, mapped to IR_FPMATH opcode. */\r\nstatic void LJ_FASTCALL recff_math_unary(jit_State *J, RecordFFData *rd)\r\n{\r\n  J->base[0] = emitir(IRTN(IR_FPMATH), lj_ir_tonum(J, J->base[0]), rd->data);\r\n}\r\n\r\n/* Record math.log. */\r\nstatic void LJ_FASTCALL recff_math_log(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  if (J->base[1]) {\r\n#ifdef LUAJIT_NO_LOG2\r\n    uint32_t fpm = IRFPM_LOG;\r\n#else\r\n    uint32_t fpm = IRFPM_LOG2;\r\n#endif\r\n    TRef trb = lj_ir_tonum(J, J->base[1]);\r\n    tr = emitir(IRTN(IR_FPMATH), tr, fpm);\r\n    trb = emitir(IRTN(IR_FPMATH), trb, fpm);\r\n    trb = emitir(IRTN(IR_DIV), lj_ir_knum_one(J), trb);\r\n    tr = emitir(IRTN(IR_MUL), tr, trb);\r\n  } else {\r\n    tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_LOG);\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.atan2. */\r\nstatic void LJ_FASTCALL recff_math_atan2(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n  J->base[0] = emitir(IRTN(IR_ATAN2), tr, tr2);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.ldexp. */\r\nstatic void LJ_FASTCALL recff_math_ldexp(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n#if LJ_TARGET_X86ORX64\r\n  TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n#else\r\n  TRef tr2 = lj_opt_narrow_toint(J, J->base[1]);\r\n#endif\r\n  J->base[0] = emitir(IRTN(IR_LDEXP), tr, tr2);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.asin, math.acos, math.atan. */\r\nstatic void LJ_FASTCALL recff_math_atrig(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef y = lj_ir_tonum(J, J->base[0]);\r\n  TRef x = lj_ir_knum_one(J);\r\n  uint32_t ffid = rd->data;\r\n  if (ffid != FF_math_atan) {\r\n    TRef tmp = emitir(IRTN(IR_MUL), y, y);\r\n    tmp = emitir(IRTN(IR_SUB), x, tmp);\r\n    tmp = emitir(IRTN(IR_FPMATH), tmp, IRFPM_SQRT);\r\n    if (ffid == FF_math_asin) { x = tmp; } else { x = y; y = tmp; }\r\n  }\r\n  J->base[0] = emitir(IRTN(IR_ATAN2), y, x);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_htrig(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  J->base[0] = emitir(IRTN(IR_CALLN), tr, rd->data);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_modf(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isinteger(tr)) {\r\n    J->base[0] = tr;\r\n    J->base[1] = lj_ir_kint(J, 0);\r\n  } else {\r\n    TRef trt;\r\n    tr = lj_ir_tonum(J, tr);\r\n    trt = emitir(IRTN(IR_FPMATH), tr, IRFPM_TRUNC);\r\n    J->base[0] = trt;\r\n    J->base[1] = emitir(IRTN(IR_SUB), tr, trt);\r\n  }\r\n  rd->nres = 2;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_degrad(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  TRef trm = lj_ir_knum(J, numV(&J->fn->c.upvalue[0]));\r\n  J->base[0] = emitir(IRTN(IR_MUL), tr, trm);\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_pow(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  if (!tref_isnumber_str(J->base[1]))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  J->base[0] = lj_opt_narrow_pow(J, tr, J->base[1], &rd->argv[1]);\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_minmax(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonumber(J, J->base[0]);\r\n  uint32_t op = rd->data;\r\n  BCReg i;\r\n  for (i = 1; J->base[i] != 0; i++) {\r\n    TRef tr2 = lj_ir_tonumber(J, J->base[i]);\r\n    IRType t = IRT_INT;\r\n    if (!(tref_isinteger(tr) && tref_isinteger(tr2))) {\r\n      if (tref_isinteger(tr)) tr = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n      if (tref_isinteger(tr2)) tr2 = emitir(IRTN(IR_CONV), tr2, IRCONV_NUM_INT);\r\n      t = IRT_NUM;\r\n    }\r\n    tr = emitir(IRT(op, t), tr, tr2);\r\n  }\r\n  J->base[0] = tr;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_random(jit_State *J, RecordFFData *rd)\r\n{\r\n  GCudata *ud = udataV(&J->fn->c.upvalue[0]);\r\n  TRef tr, one;\r\n  lj_ir_kgc(J, obj2gco(ud), IRT_UDATA);  /* Prevent collection. */\r\n  tr = lj_ir_call(J, IRCALL_lj_math_random_step, lj_ir_kptr(J, uddata(ud)));\r\n  one = lj_ir_knum_one(J);\r\n  tr = emitir(IRTN(IR_SUB), tr, one);\r\n  if (J->base[0]) {\r\n    TRef tr1 = lj_ir_tonum(J, J->base[0]);\r\n    if (J->base[1]) {  /* d = floor(d*(r2-r1+1.0)) + r1 */\r\n      TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n      tr2 = emitir(IRTN(IR_SUB), tr2, tr1);\r\n      tr2 = emitir(IRTN(IR_ADD), tr2, one);\r\n      tr = emitir(IRTN(IR_MUL), tr, tr2);\r\n      tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_FLOOR);\r\n      tr = emitir(IRTN(IR_ADD), tr, tr1);\r\n    } else {  /* d = floor(d*r1) + 1.0 */\r\n      tr = emitir(IRTN(IR_MUL), tr, tr1);\r\n      tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_FLOOR);\r\n      tr = emitir(IRTN(IR_ADD), tr, one);\r\n    }\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\n/* -- Bit library fast functions ------------------------------------------ */\r\n\r\n/* Record unary bit.tobit, bit.bnot, bit.bswap. */\r\nstatic void LJ_FASTCALL recff_bit_unary(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n  J->base[0] = (rd->data == IR_TOBIT) ? tr : emitir(IRTI(rd->data), tr, 0);\r\n}\r\n\r\n/* Record N-ary bit.band, bit.bor, bit.bxor. */\r\nstatic void LJ_FASTCALL recff_bit_nary(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n  uint32_t op = rd->data;\r\n  BCReg i;\r\n  for (i = 1; J->base[i] != 0; i++)\r\n    tr = emitir(IRTI(op), tr, lj_opt_narrow_tobit(J, J->base[i]));\r\n  J->base[0] = tr;\r\n}\r\n\r\n/* Record bit shifts. */\r\nstatic void LJ_FASTCALL recff_bit_shift(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n  TRef tsh = lj_opt_narrow_tobit(J, J->base[1]);\r\n  IROp op = (IROp)rd->data;\r\n  if (!(op < IR_BROL ? LJ_TARGET_MASKSHIFT : LJ_TARGET_MASKROT) &&\r\n      !tref_isk(tsh))\r\n    tsh = emitir(IRTI(IR_BAND), tsh, lj_ir_kint(J, 31));\r\n#ifdef LJ_TARGET_UNIFYROT\r\n  if (op == (LJ_TARGET_UNIFYROT == 1 ? IR_BROR : IR_BROL)) {\r\n    op = LJ_TARGET_UNIFYROT == 1 ? IR_BROL : IR_BROR;\r\n    tsh = emitir(IRTI(IR_NEG), tsh, tsh);\r\n  }\r\n#endif\r\n  J->base[0] = emitir(IRTI(op), tr, tsh);\r\n}\r\n\r\n/* -- String library fast functions --------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_string_len(jit_State *J, RecordFFData *rd)\r\n{\r\n  J->base[0] = emitir(IRTI(IR_FLOAD), lj_ir_tostr(J, J->base[0]), IRFL_STR_LEN);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Handle string.byte (rd->data = 0) and string.sub (rd->data = 1). */\r\nstatic void LJ_FASTCALL recff_string_range(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef trstr = lj_ir_tostr(J, J->base[0]);\r\n  TRef trlen = emitir(IRTI(IR_FLOAD), trstr, IRFL_STR_LEN);\r\n  TRef tr0 = lj_ir_kint(J, 0);\r\n  TRef trstart, trend;\r\n  GCstr *str = argv2str(J, &rd->argv[0]);\r\n  int32_t start, end;\r\n  if (rd->data) {  /* string.sub(str, start [,end]) */\r\n    start = argv2int(J, &rd->argv[1]);\r\n    trstart = lj_opt_narrow_toint(J, J->base[1]);\r\n    trend = J->base[2];\r\n    if (tref_isnil(trend)) {\r\n      trend = lj_ir_kint(J, -1);\r\n      end = -1;\r\n    } else {\r\n      trend = lj_opt_narrow_toint(J, trend);\r\n      end = argv2int(J, &rd->argv[2]);\r\n    }\r\n  } else {  /* string.byte(str, [,start [,end]]) */\r\n    if (tref_isnil(J->base[1])) {\r\n      start = 1;\r\n      trstart = lj_ir_kint(J, 1);\r\n    } else {\r\n      start = argv2int(J, &rd->argv[1]);\r\n      trstart = lj_opt_narrow_toint(J, J->base[1]);\r\n    }\r\n    if (J->base[1] && !tref_isnil(J->base[2])) {\r\n      trend = lj_opt_narrow_toint(J, J->base[2]);\r\n      end = argv2int(J, &rd->argv[2]);\r\n    } else {\r\n      trend = trstart;\r\n      end = start;\r\n    }\r\n  }\r\n  if (end < 0) {\r\n    emitir(IRTGI(IR_LT), trend, tr0);\r\n    trend = emitir(IRTI(IR_ADD), emitir(IRTI(IR_ADD), trlen, trend),\r\n\t\t   lj_ir_kint(J, 1));\r\n    end = end+(int32_t)str->len+1;\r\n  } else if ((MSize)end <= str->len) {\r\n    emitir(IRTGI(IR_ULE), trend, trlen);\r\n  } else {\r\n    emitir(IRTGI(IR_GT), trend, trlen);\r\n    end = (int32_t)str->len;\r\n    trend = trlen;\r\n  }\r\n  if (start < 0) {\r\n    emitir(IRTGI(IR_LT), trstart, tr0);\r\n    trstart = emitir(IRTI(IR_ADD), trlen, trstart);\r\n    start = start+(int32_t)str->len;\r\n    emitir(start < 0 ? IRTGI(IR_LT) : IRTGI(IR_GE), trstart, tr0);\r\n    if (start < 0) {\r\n      trstart = tr0;\r\n      start = 0;\r\n    }\r\n  } else {\r\n    if (start == 0) {\r\n      emitir(IRTGI(IR_EQ), trstart, tr0);\r\n      trstart = tr0;\r\n    } else {\r\n      trstart = emitir(IRTI(IR_ADD), trstart, lj_ir_kint(J, -1));\r\n      emitir(IRTGI(IR_GE), trstart, tr0);\r\n      start--;\r\n    }\r\n  }\r\n  if (rd->data) {  /* Return string.sub result. */\r\n    if (end - start >= 0) {\r\n      /* Also handle empty range here, to avoid extra traces. */\r\n      TRef trptr, trslen = emitir(IRTI(IR_SUB), trend, trstart);\r\n      emitir(IRTGI(IR_GE), trslen, tr0);\r\n      trptr = emitir(IRT(IR_STRREF, IRT_P32), trstr, trstart);\r\n      J->base[0] = emitir(IRT(IR_SNEW, IRT_STR), trptr, trslen);\r\n    } else {  /* Range underflow: return empty string. */\r\n      emitir(IRTGI(IR_LT), trend, trstart);\r\n      J->base[0] = lj_ir_kstr(J, lj_str_new(J->L, strdata(str), 0));\r\n    }\r\n  } else {  /* Return string.byte result(s). */\r\n    ptrdiff_t i, len = end - start;\r\n    if (len > 0) {\r\n      TRef trslen = emitir(IRTI(IR_SUB), trend, trstart);\r\n      emitir(IRTGI(IR_EQ), trslen, lj_ir_kint(J, (int32_t)len));\r\n      if (J->baseslot + len > LJ_MAX_JSLOTS)\r\n\tlj_trace_err_info(J, LJ_TRERR_STACKOV);\r\n      rd->nres = len;\r\n      for (i = 0; i < len; i++) {\r\n\tTRef tmp = emitir(IRTI(IR_ADD), trstart, lj_ir_kint(J, (int32_t)i));\r\n\ttmp = emitir(IRT(IR_STRREF, IRT_P32), trstr, tmp);\r\n\tJ->base[i] = emitir(IRT(IR_XLOAD, IRT_U8), tmp, IRXLOAD_READONLY);\r\n      }\r\n    } else {  /* Empty range or range underflow: return no results. */\r\n      emitir(IRTGI(IR_LE), trend, trstart);\r\n      rd->nres = 0;\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Table library fast functions ---------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_table_getn(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (tref_istab(J->base[0]))\r\n    J->base[0] = lj_ir_call(J, IRCALL_lj_tab_len, J->base[0]);\r\n  /* else: Interpreter will throw. */\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_table_remove(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tab = J->base[0];\r\n  rd->nres = 0;\r\n  if (tref_istab(tab)) {\r\n    if (tref_isnil(J->base[1])) {  /* Simple pop: t[#t] = nil */\r\n      TRef trlen = lj_ir_call(J, IRCALL_lj_tab_len, tab);\r\n      GCtab *t = tabV(&rd->argv[0]);\r\n      MSize len = lj_tab_len(t);\r\n      emitir(IRTGI(len ? IR_NE : IR_EQ), trlen, lj_ir_kint(J, 0));\r\n      if (len) {\r\n\tRecordIndex ix;\r\n\tix.tab = tab;\r\n\tix.key = trlen;\r\n\tsettabV(J->L, &ix.tabv, t);\r\n\tsetintV(&ix.keyv, len);\r\n\tix.idxchain = 0;\r\n\tif (results_wanted(J) != 0) {  /* Specialize load only if needed. */\r\n\t  ix.val = 0;\r\n\t  J->base[0] = lj_record_idx(J, &ix);  /* Load previous value. */\r\n\t  rd->nres = 1;\r\n\t  /* Assumes ix.key/ix.tab is not modified for raw lj_record_idx(). */\r\n\t}\r\n\tix.val = TREF_NIL;\r\n\tlj_record_idx(J, &ix);  /* Remove value. */\r\n      }\r\n    } else {  /* Complex case: remove in the middle. */\r\n      recff_nyiu(J);\r\n    }\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_table_insert(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  ix.val = J->base[1];\r\n  rd->nres = 0;\r\n  if (tref_istab(ix.tab) && ix.val) {\r\n    if (!J->base[2]) {  /* Simple push: t[#t+1] = v */\r\n      TRef trlen = lj_ir_call(J, IRCALL_lj_tab_len, ix.tab);\r\n      GCtab *t = tabV(&rd->argv[0]);\r\n      ix.key = emitir(IRTI(IR_ADD), trlen, lj_ir_kint(J, 1));\r\n      settabV(J->L, &ix.tabv, t);\r\n      setintV(&ix.keyv, lj_tab_len(t) + 1);\r\n      ix.idxchain = 0;\r\n      lj_record_idx(J, &ix);  /* Set new value. */\r\n    } else {  /* Complex case: insert in the middle. */\r\n      recff_nyiu(J);\r\n    }\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\n/* -- I/O library fast functions ------------------------------------------ */\r\n\r\n/* Get FILE* for I/O function. Any I/O error aborts recording, so there's\r\n** no need to encode the alternate cases for any of the guards.\r\n*/\r\nstatic TRef recff_io_fp(jit_State *J, TRef *udp, int32_t id)\r\n{\r\n  TRef tr, ud, fp;\r\n  if (id) {  /* io.func() */\r\n    tr = lj_ir_kptr(J, &J2G(J)->gcroot[id]);\r\n    ud = emitir(IRT(IR_XLOAD, IRT_UDATA), tr, 0);\r\n  } else {  /* fp:method() */\r\n    ud = J->base[0];\r\n    if (!tref_isudata(ud))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    tr = emitir(IRT(IR_FLOAD, IRT_U8), ud, IRFL_UDATA_UDTYPE);\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, UDTYPE_IO_FILE));\r\n  }\r\n  *udp = ud;\r\n  fp = emitir(IRT(IR_FLOAD, IRT_PTR), ud, IRFL_UDATA_FILE);\r\n  emitir(IRTG(IR_NE, IRT_PTR), fp, lj_ir_knull(J, IRT_PTR));\r\n  return fp;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_io_write(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef ud, fp = recff_io_fp(J, &ud, rd->data);\r\n  TRef zero = lj_ir_kint(J, 0);\r\n  TRef one = lj_ir_kint(J, 1);\r\n  ptrdiff_t i = rd->data == 0 ? 1 : 0;\r\n  for (; J->base[i]; i++) {\r\n    TRef str = lj_ir_tostr(J, J->base[i]);\r\n    TRef buf = emitir(IRT(IR_STRREF, IRT_P32), str, zero);\r\n    TRef len = emitir(IRTI(IR_FLOAD), str, IRFL_STR_LEN);\r\n    if (tref_isk(len) && IR(tref_ref(len))->i == 1) {\r\n      TRef tr = emitir(IRT(IR_XLOAD, IRT_U8), buf, IRXLOAD_READONLY);\r\n      tr = lj_ir_call(J, IRCALL_fputc, tr, fp);\r\n      if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n\temitir(IRTGI(IR_NE), tr, lj_ir_kint(J, -1));\r\n    } else {\r\n      TRef tr = lj_ir_call(J, IRCALL_fwrite, buf, one, len, fp);\r\n      if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n\temitir(IRTGI(IR_EQ), tr, len);\r\n    }\r\n  }\r\n  J->base[0] = LJ_52 ? ud : TREF_TRUE;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_io_flush(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef ud, fp = recff_io_fp(J, &ud, rd->data);\r\n  TRef tr = lj_ir_call(J, IRCALL_fflush, fp);\r\n  if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, 0));\r\n  J->base[0] = TREF_TRUE;\r\n}\r\n\r\n/* -- Record calls to fast functions -------------------------------------- */\r\n\r\n#include \"lj_recdef.h\"\r\n\r\nstatic uint32_t recdef_lookup(GCfunc *fn)\r\n{\r\n  if (fn->c.ffid < sizeof(recff_idmap)/sizeof(recff_idmap[0]))\r\n    return recff_idmap[fn->c.ffid];\r\n  else\r\n    return 0;\r\n}\r\n\r\n/* Record entry to a fast function or C function. */\r\nvoid lj_ffrecord_func(jit_State *J)\r\n{\r\n  RecordFFData rd;\r\n  uint32_t m = recdef_lookup(J->fn);\r\n  rd.data = m & 0xff;\r\n  rd.nres = 1;  /* Default is one result. */\r\n  rd.argv = J->L->base;\r\n  J->base[J->maxslot] = 0;  /* Mark end of arguments. */\r\n  (recff_func[m >> 8])(J, &rd);  /* Call recff_* handler. */\r\n  if (rd.nres >= 0) {\r\n    if (J->postproc == LJ_POST_NONE) J->postproc = LJ_POST_FFRETRY;\r\n    lj_record_ret(J, 0, rd.nres);\r\n  }\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ffrecord.h",
    "content": "/*\r\n** Fast function call recorder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FFRECORD_H\r\n#define _LJ_FFRECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* Data used by handlers to record a fast function. */\r\ntypedef struct RecordFFData {\r\n  TValue *argv;\t\t/* Runtime argument values. */\r\n  ptrdiff_t nres;\t/* Number of returned results (defaults to 1). */\r\n  uint32_t data;\t/* Per-ffid auxiliary data (opcode, literal etc.). */\r\n} RecordFFData;\r\n\r\nLJ_FUNC int32_t lj_ffrecord_select_mode(jit_State *J, TRef tr, TValue *tv);\r\nLJ_FUNC void lj_ffrecord_func(jit_State *J);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_frame.h",
    "content": "/*\r\n** Stack frames.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FRAME_H\r\n#define _LJ_FRAME_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* -- Lua stack frame ----------------------------------------------------- */\r\n\r\n/* Frame type markers in callee function slot (callee base-1). */\r\nenum {\r\n  FRAME_LUA, FRAME_C, FRAME_CONT, FRAME_VARG,\r\n  FRAME_LUAP, FRAME_CP, FRAME_PCALL, FRAME_PCALLH\r\n};\r\n#define FRAME_TYPE\t\t3\r\n#define FRAME_P\t\t\t4\r\n#define FRAME_TYPEP\t\t(FRAME_TYPE|FRAME_P)\r\n\r\n/* Macros to access and modify Lua frames. */\r\n#define frame_gc(f)\t\t(gcref((f)->fr.func))\r\n#define frame_func(f)\t\t(&frame_gc(f)->fn)\r\n#define frame_ftsz(f)\t\t((f)->fr.tp.ftsz)\r\n\r\n#define frame_type(f)\t\t(frame_ftsz(f) & FRAME_TYPE)\r\n#define frame_typep(f)\t\t(frame_ftsz(f) & FRAME_TYPEP)\r\n#define frame_islua(f)\t\t(frame_type(f) == FRAME_LUA)\r\n#define frame_isc(f)\t\t(frame_type(f) == FRAME_C)\r\n#define frame_iscont(f)\t\t(frame_typep(f) == FRAME_CONT)\r\n#define frame_isvarg(f)\t\t(frame_typep(f) == FRAME_VARG)\r\n#define frame_ispcall(f)\t((frame_ftsz(f) & 6) == FRAME_PCALL)\r\n\r\n#define frame_pc(f)\t\t(mref((f)->fr.tp.pcr, const BCIns))\r\n#define frame_contpc(f)\t\t(frame_pc((f)-1))\r\n#if LJ_64\r\n#define frame_contf(f) \\\r\n  ((ASMFunction)(void *)((intptr_t)lj_vm_asm_begin + \\\r\n\t\t\t (intptr_t)(int32_t)((f)-1)->u32.lo))\r\n#else\r\n#define frame_contf(f)\t\t((ASMFunction)gcrefp(((f)-1)->gcr, void))\r\n#endif\r\n#define frame_delta(f)\t\t(frame_ftsz(f) >> 3)\r\n#define frame_sized(f)\t\t(frame_ftsz(f) & ~FRAME_TYPEP)\r\n\r\n#define frame_prevl(f)\t\t((f) - (1+bc_a(frame_pc(f)[-1])))\r\n#define frame_prevd(f)\t\t((TValue *)((char *)(f) - frame_sized(f)))\r\n#define frame_prev(f)\t\t(frame_islua(f)?frame_prevl(f):frame_prevd(f))\r\n/* Note: this macro does not skip over FRAME_VARG. */\r\n\r\n#define setframe_pc(f, pc)\t(setmref((f)->fr.tp.pcr, (pc)))\r\n#define setframe_ftsz(f, sz)\t((f)->fr.tp.ftsz = (sz))\r\n#define setframe_gc(f, p)\t(setgcref((f)->fr.func, (p)))\r\n\r\n/* -- C stack frame ------------------------------------------------------- */\r\n\r\n/* Macros to access and modify the C stack frame chain. */\r\n\r\n/* These definitions must match with the arch-specific *.dasc files. */\r\n#if LJ_TARGET_X86\r\n#define CFRAME_OFS_ERRF\t\t(15*4)\r\n#define CFRAME_OFS_NRES\t\t(14*4)\r\n#define CFRAME_OFS_PREV\t\t(13*4)\r\n#define CFRAME_OFS_L\t\t(12*4)\r\n#define CFRAME_OFS_PC\t\t(6*4)\r\n#define CFRAME_OFS_MULTRES\t(5*4)\r\n#define CFRAME_SIZE\t\t(12*4)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#elif LJ_TARGET_X64\r\n#if LJ_ABI_WIN\r\n#define CFRAME_OFS_PREV\t\t(13*8)\r\n#define CFRAME_OFS_PC\t\t(25*4)\r\n#define CFRAME_OFS_L\t\t(24*4)\r\n#define CFRAME_OFS_ERRF\t\t(23*4)\r\n#define CFRAME_OFS_NRES\t\t(22*4)\r\n#define CFRAME_OFS_MULTRES\t(21*4)\r\n#define CFRAME_SIZE\t\t(10*8)\r\n#define CFRAME_SIZE_JIT\t\t(CFRAME_SIZE + 9*16 + 4*8)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#else\r\n#define CFRAME_OFS_PREV\t\t(4*8)\r\n#define CFRAME_OFS_PC\t\t(7*4)\r\n#define CFRAME_OFS_L\t\t(6*4)\r\n#define CFRAME_OFS_ERRF\t\t(5*4)\r\n#define CFRAME_OFS_NRES\t\t(4*4)\r\n#define CFRAME_OFS_MULTRES\t(1*4)\r\n#define CFRAME_SIZE\t\t(10*8)\r\n#define CFRAME_SIZE_JIT\t\t(CFRAME_SIZE + 16)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#define CFRAME_OFS_ERRF\t\t24\r\n#define CFRAME_OFS_NRES\t\t20\r\n#define CFRAME_OFS_PREV\t\t16\r\n#define CFRAME_OFS_L\t\t12\r\n#define CFRAME_OFS_PC\t\t8\r\n#define CFRAME_OFS_MULTRES\t4\r\n#if LJ_ARCH_HASFPU\r\n#define CFRAME_SIZE\t\t128\r\n#else\r\n#define CFRAME_SIZE\t\t64\r\n#endif\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_TARGET_PPC\r\n#if LJ_TARGET_XBOX360\r\n#define CFRAME_OFS_ERRF\t\t424\r\n#define CFRAME_OFS_NRES\t\t420\r\n#define CFRAME_OFS_PREV\t\t400\r\n#define CFRAME_OFS_L\t\t416\r\n#define CFRAME_OFS_PC\t\t412\r\n#define CFRAME_OFS_MULTRES\t408\r\n#define CFRAME_SIZE\t\t384\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_ARCH_PPC64\r\n#define CFRAME_OFS_ERRF\t\t472\r\n#define CFRAME_OFS_NRES\t\t468\r\n#define CFRAME_OFS_PREV\t\t448\r\n#define CFRAME_OFS_L\t\t464\r\n#define CFRAME_OFS_PC\t\t460\r\n#define CFRAME_OFS_MULTRES\t456\r\n#define CFRAME_SIZE\t\t400\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#else\r\n#define CFRAME_OFS_ERRF\t\t48\r\n#define CFRAME_OFS_NRES\t\t44\r\n#define CFRAME_OFS_PREV\t\t40\r\n#define CFRAME_OFS_L\t\t36\r\n#define CFRAME_OFS_PC\t\t32\r\n#define CFRAME_OFS_MULTRES\t28\r\n#define CFRAME_SIZE\t\t272\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#endif\r\n#elif LJ_TARGET_PPCSPE\r\n#define CFRAME_OFS_ERRF\t\t28\r\n#define CFRAME_OFS_NRES\t\t24\r\n#define CFRAME_OFS_PREV\t\t20\r\n#define CFRAME_OFS_L\t\t16\r\n#define CFRAME_OFS_PC\t\t12\r\n#define CFRAME_OFS_MULTRES\t8\r\n#define CFRAME_SIZE\t\t184\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_TARGET_MIPS\r\n#define CFRAME_OFS_ERRF\t\t124\r\n#define CFRAME_OFS_NRES\t\t120\r\n#define CFRAME_OFS_PREV\t\t116\r\n#define CFRAME_OFS_L\t\t112\r\n#define CFRAME_OFS_PC\t\t20\r\n#define CFRAME_OFS_MULTRES\t16\r\n#define CFRAME_SIZE\t\t112\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#else\r\n#error \"Missing CFRAME_* definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CFRAME_SIZE_JIT\r\n#define CFRAME_SIZE_JIT\t\tCFRAME_SIZE\r\n#endif\r\n\r\n#define CFRAME_RESUME\t\t1\r\n#define CFRAME_UNWIND_FF\t2  /* Only used in unwinder. */\r\n#define CFRAME_RAWMASK\t\t(~(intptr_t)(CFRAME_RESUME|CFRAME_UNWIND_FF))\r\n\r\n#define cframe_errfunc(cf)\t(*(int32_t *)(((char *)(cf))+CFRAME_OFS_ERRF))\r\n#define cframe_nres(cf)\t\t(*(int32_t *)(((char *)(cf))+CFRAME_OFS_NRES))\r\n#define cframe_prev(cf)\t\t(*(void **)(((char *)(cf))+CFRAME_OFS_PREV))\r\n#define cframe_multres(cf)  (*(uint32_t *)(((char *)(cf))+CFRAME_OFS_MULTRES))\r\n#define cframe_multres_n(cf)\t(cframe_multres((cf)) >> CFRAME_SHIFT_MULTRES)\r\n#define cframe_L(cf) \\\r\n  (&gcref(*(GCRef *)(((char *)(cf))+CFRAME_OFS_L))->th)\r\n#define cframe_pc(cf) \\\r\n  (mref(*(MRef *)(((char *)(cf))+CFRAME_OFS_PC), const BCIns))\r\n#define setcframe_L(cf, L) \\\r\n  (setmref(*(MRef *)(((char *)(cf))+CFRAME_OFS_L), (L)))\r\n#define setcframe_pc(cf, pc) \\\r\n  (setmref(*(MRef *)(((char *)(cf))+CFRAME_OFS_PC), (pc)))\r\n#define cframe_canyield(cf)\t((intptr_t)(cf) & CFRAME_RESUME)\r\n#define cframe_unwind_ff(cf)\t((intptr_t)(cf) & CFRAME_UNWIND_FF)\r\n#define cframe_raw(cf)\t\t((void *)((intptr_t)(cf) & CFRAME_RAWMASK))\r\n#define cframe_Lpc(L)\t\tcframe_pc(cframe_raw(L->cframe))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_func.c",
    "content": "/*\r\n** Function handling (prototypes, functions and upvalues).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_func_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Prototypes ---------------------------------------------------------- */\r\n\r\nvoid LJ_FASTCALL lj_func_freeproto(global_State *g, GCproto *pt)\r\n{\r\n  lj_mem_free(g, pt, pt->sizept);\r\n}\r\n\r\n/* -- Upvalues ------------------------------------------------------------ */\r\n\r\nstatic void unlinkuv(GCupval *uv)\r\n{\r\n  lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n  setgcrefr(uvnext(uv)->prev, uv->prev);\r\n  setgcrefr(uvprev(uv)->next, uv->next);\r\n}\r\n\r\n/* Find existing open upvalue for a stack slot or create a new one. */\r\nstatic GCupval *func_finduv(lua_State *L, TValue *slot)\r\n{\r\n  global_State *g = G(L);\r\n  GCRef *pp = &L->openupval;\r\n  GCupval *p;\r\n  GCupval *uv;\r\n  /* Search the sorted list of open upvalues. */\r\n  while (gcref(*pp) != NULL && uvval((p = gco2uv(gcref(*pp)))) >= slot) {\r\n    lua_assert(!p->closed && uvval(p) != &p->tv);\r\n    if (uvval(p) == slot) {  /* Found open upvalue pointing to same slot? */\r\n      if (isdead(g, obj2gco(p)))  /* Resurrect it, if it's dead. */\r\n\tflipwhite(obj2gco(p));\r\n      return p;\r\n    }\r\n    pp = &p->nextgc;\r\n  }\r\n  /* No matching upvalue found. Create a new one. */\r\n  uv = lj_mem_newt(L, sizeof(GCupval), GCupval);\r\n  newwhite(g, uv);\r\n  uv->gct = ~LJ_TUPVAL;\r\n  uv->closed = 0;  /* Still open. */\r\n  setmref(uv->v, slot);  /* Pointing to the stack slot. */\r\n  /* NOBARRIER: The GCupval is new (marked white) and open. */\r\n  setgcrefr(uv->nextgc, *pp);  /* Insert into sorted list of open upvalues. */\r\n  setgcref(*pp, obj2gco(uv));\r\n  setgcref(uv->prev, obj2gco(&g->uvhead));  /* Insert into GC list, too. */\r\n  setgcrefr(uv->next, g->uvhead.next);\r\n  setgcref(uvnext(uv)->prev, obj2gco(uv));\r\n  setgcref(g->uvhead.next, obj2gco(uv));\r\n  lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n  return uv;\r\n}\r\n\r\n/* Create an empty and closed upvalue. */\r\nstatic GCupval *func_emptyuv(lua_State *L)\r\n{\r\n  GCupval *uv = (GCupval *)lj_mem_newgco(L, sizeof(GCupval));\r\n  uv->gct = ~LJ_TUPVAL;\r\n  uv->closed = 1;\r\n  setnilV(&uv->tv);\r\n  setmref(uv->v, &uv->tv);\r\n  return uv;\r\n}\r\n\r\n/* Close all open upvalues pointing to some stack level or above. */\r\nvoid LJ_FASTCALL lj_func_closeuv(lua_State *L, TValue *level)\r\n{\r\n  GCupval *uv;\r\n  global_State *g = G(L);\r\n  while (gcref(L->openupval) != NULL &&\r\n\t uvval((uv = gco2uv(gcref(L->openupval)))) >= level) {\r\n    GCobj *o = obj2gco(uv);\r\n    lua_assert(!isblack(o) && !uv->closed && uvval(uv) != &uv->tv);\r\n    setgcrefr(L->openupval, uv->nextgc);  /* No longer in open list. */\r\n    if (isdead(g, o)) {\r\n      lj_func_freeuv(g, uv);\r\n    } else {\r\n      unlinkuv(uv);\r\n      lj_gc_closeuv(g, uv);\r\n    }\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL lj_func_freeuv(global_State *g, GCupval *uv)\r\n{\r\n  if (!uv->closed)\r\n    unlinkuv(uv);\r\n  lj_mem_freet(g, uv);\r\n}\r\n\r\n/* -- Functions (closures) ------------------------------------------------ */\r\n\r\nGCfunc *lj_func_newC(lua_State *L, MSize nelems, GCtab *env)\r\n{\r\n  GCfunc *fn = (GCfunc *)lj_mem_newgco(L, sizeCfunc(nelems));\r\n  fn->c.gct = ~LJ_TFUNC;\r\n  fn->c.ffid = FF_C;\r\n  fn->c.nupvalues = (uint8_t)nelems;\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  setmref(fn->c.pc, &G(L)->bc_cfunc_ext);\r\n  setgcref(fn->c.env, obj2gco(env));\r\n  return fn;\r\n}\r\n\r\nstatic GCfunc *func_newL(lua_State *L, GCproto *pt, GCtab *env)\r\n{\r\n  uint32_t count;\r\n  GCfunc *fn = (GCfunc *)lj_mem_newgco(L, sizeLfunc((MSize)pt->sizeuv));\r\n  fn->l.gct = ~LJ_TFUNC;\r\n  fn->l.ffid = FF_LUA;\r\n  fn->l.nupvalues = 0;  /* Set to zero until upvalues are initialized. */\r\n  /* NOBARRIER: Really a setgcref. But the GCfunc is new (marked white). */\r\n  setmref(fn->l.pc, proto_bc(pt));\r\n  setgcref(fn->l.env, obj2gco(env));\r\n  /* Saturating 3 bit counter (0..7) for created closures. */\r\n  count = (uint32_t)pt->flags + PROTO_CLCOUNT;\r\n  pt->flags = (uint8_t)(count - ((count >> PROTO_CLC_BITS) & PROTO_CLCOUNT));\r\n  return fn;\r\n}\r\n\r\n/* Create a new Lua function with empty upvalues. */\r\nGCfunc *lj_func_newL_empty(lua_State *L, GCproto *pt, GCtab *env)\r\n{\r\n  GCfunc *fn = func_newL(L, pt, env);\r\n  MSize i, nuv = pt->sizeuv;\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  for (i = 0; i < nuv; i++) {\r\n    GCupval *uv = func_emptyuv(L);\r\n    uv->dhash = (uint32_t)(uintptr_t)pt ^ ((uint32_t)proto_uv(pt)[i] << 24);\r\n    setgcref(fn->l.uvptr[i], obj2gco(uv));\r\n  }\r\n  fn->l.nupvalues = (uint8_t)nuv;\r\n  return fn;\r\n}\r\n\r\n/* Do a GC check and create a new Lua function with inherited upvalues. */\r\nGCfunc *lj_func_newL_gc(lua_State *L, GCproto *pt, GCfuncL *parent)\r\n{\r\n  GCfunc *fn;\r\n  GCRef *puv;\r\n  MSize i, nuv;\r\n  TValue *base;\r\n  lj_gc_check_fixtop(L);\r\n  fn = func_newL(L, pt, tabref(parent->env));\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  puv = parent->uvptr;\r\n  nuv = pt->sizeuv;\r\n  base = L->base;\r\n  for (i = 0; i < nuv; i++) {\r\n    uint32_t v = proto_uv(pt)[i];\r\n    GCupval *uv;\r\n    if ((v & PROTO_UV_LOCAL)) {\r\n      uv = func_finduv(L, base + (v & 0xff));\r\n      uv->immutable = ((v / PROTO_UV_IMMUTABLE) & 1);\r\n      uv->dhash = (uint32_t)(uintptr_t)mref(parent->pc, char) ^ (v << 24);\r\n    } else {\r\n      uv = &gcref(puv[v])->uv;\r\n    }\r\n    setgcref(fn->l.uvptr[i], obj2gco(uv));\r\n  }\r\n  fn->l.nupvalues = (uint8_t)nuv;\r\n  return fn;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_func_free(global_State *g, GCfunc *fn)\r\n{\r\n  MSize size = isluafunc(fn) ? sizeLfunc((MSize)fn->l.nupvalues) :\r\n\t\t\t       sizeCfunc((MSize)fn->c.nupvalues);\r\n  lj_mem_free(g, fn, size);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_func.h",
    "content": "/*\r\n** Function handling (prototypes, functions and upvalues).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FUNC_H\r\n#define _LJ_FUNC_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Prototypes. */\r\nLJ_FUNC void LJ_FASTCALL lj_func_freeproto(global_State *g, GCproto *pt);\r\n\r\n/* Upvalues. */\r\nLJ_FUNCA void LJ_FASTCALL lj_func_closeuv(lua_State *L, TValue *level);\r\nLJ_FUNC void LJ_FASTCALL lj_func_freeuv(global_State *g, GCupval *uv);\r\n\r\n/* Functions (closures). */\r\nLJ_FUNC GCfunc *lj_func_newC(lua_State *L, MSize nelems, GCtab *env);\r\nLJ_FUNC GCfunc *lj_func_newL_empty(lua_State *L, GCproto *pt, GCtab *env);\r\nLJ_FUNCA GCfunc *lj_func_newL_gc(lua_State *L, GCproto *pt, GCfuncL *parent);\r\nLJ_FUNC void LJ_FASTCALL lj_func_free(global_State *g, GCfunc *c);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_gc.c",
    "content": "/*\r\n** Garbage collector.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_gc_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n#define GCSTEPSIZE\t1024u\r\n#define GCSWEEPMAX\t40\r\n#define GCSWEEPCOST\t10\r\n#define GCFINALIZECOST\t100\r\n\r\n/* Macros to set GCobj colors and flags. */\r\n#define white2gray(x)\t\t((x)->gch.marked &= (uint8_t)~LJ_GC_WHITES)\r\n#define gray2black(x)\t\t((x)->gch.marked |= LJ_GC_BLACK)\r\n#define isfinalized(u)\t\t((u)->marked & LJ_GC_FINALIZED)\r\n\r\n/* -- Mark phase ---------------------------------------------------------- */\r\n\r\n/* Mark a TValue (if needed). */\r\n#define gc_marktv(g, tv) \\\r\n  { lua_assert(!tvisgcv(tv) || (~itype(tv) == gcval(tv)->gch.gct)); \\\r\n    if (tviswhite(tv)) gc_mark(g, gcV(tv)); }\r\n\r\n/* Mark a GCobj (if needed). */\r\n#define gc_markobj(g, o) \\\r\n  { if (iswhite(obj2gco(o))) gc_mark(g, obj2gco(o)); }\r\n\r\n/* Mark a string object. */\r\n#define gc_mark_str(s)\t\t((s)->marked &= (uint8_t)~LJ_GC_WHITES)\r\n\r\n/* Mark a white GCobj. */\r\nstatic void gc_mark(global_State *g, GCobj *o)\r\n{\r\n  int gct = o->gch.gct;\r\n  lua_assert(iswhite(o) && !isdead(g, o));\r\n  white2gray(o);\r\n  if (LJ_UNLIKELY(gct == ~LJ_TUDATA)) {\r\n    GCtab *mt = tabref(gco2ud(o)->metatable);\r\n    gray2black(o);  /* Userdata are never gray. */\r\n    if (mt) gc_markobj(g, mt);\r\n    gc_markobj(g, tabref(gco2ud(o)->env));\r\n  } else if (LJ_UNLIKELY(gct == ~LJ_TUPVAL)) {\r\n    GCupval *uv = gco2uv(o);\r\n    gc_marktv(g, uvval(uv));\r\n    if (uv->closed)\r\n      gray2black(o);  /* Closed upvalues are never gray. */\r\n  } else if (gct != ~LJ_TSTR && gct != ~LJ_TCDATA) {\r\n    lua_assert(gct == ~LJ_TFUNC || gct == ~LJ_TTAB ||\r\n\t       gct == ~LJ_TTHREAD || gct == ~LJ_TPROTO);\r\n    setgcrefr(o->gch.gclist, g->gc.gray);\r\n    setgcref(g->gc.gray, o);\r\n  }\r\n}\r\n\r\n/* Mark GC roots. */\r\nstatic void gc_mark_gcroot(global_State *g)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < GCROOT_MAX; i++)\r\n    if (gcref(g->gcroot[i]) != NULL)\r\n      gc_markobj(g, gcref(g->gcroot[i]));\r\n}\r\n\r\n/* Start a GC cycle and mark the root set. */\r\nstatic void gc_mark_start(global_State *g)\r\n{\r\n  setgcrefnull(g->gc.gray);\r\n  setgcrefnull(g->gc.grayagain);\r\n  setgcrefnull(g->gc.weak);\r\n  gc_markobj(g, mainthread(g));\r\n  gc_markobj(g, tabref(mainthread(g)->env));\r\n  gc_marktv(g, &g->registrytv);\r\n  gc_mark_gcroot(g);\r\n  g->gc.state = GCSpropagate;\r\n}\r\n\r\n/* Mark open upvalues. */\r\nstatic void gc_mark_uv(global_State *g)\r\n{\r\n  GCupval *uv;\r\n  for (uv = uvnext(&g->uvhead); uv != &g->uvhead; uv = uvnext(uv)) {\r\n    lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n    if (isgray(obj2gco(uv)))\r\n      gc_marktv(g, uvval(uv));\r\n  }\r\n}\r\n\r\n/* Mark userdata in mmudata list. */\r\nstatic void gc_mark_mmudata(global_State *g)\r\n{\r\n  GCobj *root = gcref(g->gc.mmudata);\r\n  GCobj *u = root;\r\n  if (u) {\r\n    do {\r\n      u = gcnext(u);\r\n      makewhite(g, u);  /* Could be from previous GC. */\r\n      gc_mark(g, u);\r\n    } while (u != root);\r\n  }\r\n}\r\n\r\n/* Separate userdata objects to be finalized to mmudata list. */\r\nsize_t lj_gc_separateudata(global_State *g, int all)\r\n{\r\n  size_t m = 0;\r\n  GCRef *p = &mainthread(g)->nextgc;\r\n  GCobj *o;\r\n  while ((o = gcref(*p)) != NULL) {\r\n    if (!(iswhite(o) || all) || isfinalized(gco2ud(o))) {\r\n      p = &o->gch.nextgc;  /* Nothing to do. */\r\n    } else if (!lj_meta_fastg(g, tabref(gco2ud(o)->metatable), MM_gc)) {\r\n      markfinalized(o);  /* Done, as there's no __gc metamethod. */\r\n      p = &o->gch.nextgc;\r\n    } else {  /* Otherwise move userdata to be finalized to mmudata list. */\r\n      m += sizeudata(gco2ud(o));\r\n      markfinalized(o);\r\n      *p = o->gch.nextgc;\r\n      if (gcref(g->gc.mmudata)) {  /* Link to end of mmudata list. */\r\n\tGCobj *root = gcref(g->gc.mmudata);\r\n\tsetgcrefr(o->gch.nextgc, root->gch.nextgc);\r\n\tsetgcref(root->gch.nextgc, o);\r\n\tsetgcref(g->gc.mmudata, o);\r\n      } else {  /* Create circular list. */\r\n\tsetgcref(o->gch.nextgc, o);\r\n\tsetgcref(g->gc.mmudata, o);\r\n      }\r\n    }\r\n  }\r\n  return m;\r\n}\r\n\r\n/* -- Propagation phase --------------------------------------------------- */\r\n\r\n/* Traverse a table. */\r\nstatic int gc_traverse_tab(global_State *g, GCtab *t)\r\n{\r\n  int weak = 0;\r\n  cTValue *mode;\r\n  GCtab *mt = tabref(t->metatable);\r\n  if (mt)\r\n    gc_markobj(g, mt);\r\n  mode = lj_meta_fastg(g, mt, MM_mode);\r\n  if (mode && tvisstr(mode)) {  /* Valid __mode field? */\r\n    const char *modestr = strVdata(mode);\r\n    int c;\r\n    while ((c = *modestr++)) {\r\n      if (c == 'k') weak |= LJ_GC_WEAKKEY;\r\n      else if (c == 'v') weak |= LJ_GC_WEAKVAL;\r\n      else if (c == 'K') weak = (int)(~0u & ~LJ_GC_WEAKVAL);\r\n    }\r\n    if (weak > 0) {  /* Weak tables are cleared in the atomic phase. */\r\n      t->marked = (uint8_t)((t->marked & ~LJ_GC_WEAK) | weak);\r\n      setgcrefr(t->gclist, g->gc.weak);\r\n      setgcref(g->gc.weak, obj2gco(t));\r\n    }\r\n  }\r\n  if (weak == LJ_GC_WEAK)  /* Nothing to mark if both keys/values are weak. */\r\n    return 1;\r\n  if (!(weak & LJ_GC_WEAKVAL)) {  /* Mark array part. */\r\n    MSize i, asize = t->asize;\r\n    for (i = 0; i < asize; i++)\r\n      gc_marktv(g, arrayslot(t, i));\r\n  }\r\n  if (t->hmask > 0) {  /* Mark hash part. */\r\n    Node *node = noderef(t->node);\r\n    MSize i, hmask = t->hmask;\r\n    for (i = 0; i <= hmask; i++) {\r\n      Node *n = &node[i];\r\n      if (!tvisnil(&n->val)) {  /* Mark non-empty slot. */\r\n\tlua_assert(!tvisnil(&n->key));\r\n\tif (!(weak & LJ_GC_WEAKKEY)) gc_marktv(g, &n->key);\r\n\tif (!(weak & LJ_GC_WEAKVAL)) gc_marktv(g, &n->val);\r\n      }\r\n    }\r\n  }\r\n  return weak;\r\n}\r\n\r\n/* Traverse a function. */\r\nstatic void gc_traverse_func(global_State *g, GCfunc *fn)\r\n{\r\n  gc_markobj(g, tabref(fn->c.env));\r\n  if (isluafunc(fn)) {\r\n    uint32_t i;\r\n    lua_assert(fn->l.nupvalues <= funcproto(fn)->sizeuv);\r\n    gc_markobj(g, funcproto(fn));\r\n    for (i = 0; i < fn->l.nupvalues; i++)  /* Mark Lua function upvalues. */\r\n      gc_markobj(g, &gcref(fn->l.uvptr[i])->uv);\r\n  } else {\r\n    uint32_t i;\r\n    for (i = 0; i < fn->c.nupvalues; i++)  /* Mark C function upvalues. */\r\n      gc_marktv(g, &fn->c.upvalue[i]);\r\n  }\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Mark a trace. */\r\nstatic void gc_marktrace(global_State *g, TraceNo traceno)\r\n{\r\n  GCobj *o = obj2gco(traceref(G2J(g), traceno));\r\n  lua_assert(traceno != G2J(g)->cur.traceno);\r\n  if (iswhite(o)) {\r\n    white2gray(o);\r\n    setgcrefr(o->gch.gclist, g->gc.gray);\r\n    setgcref(g->gc.gray, o);\r\n  }\r\n}\r\n\r\n/* Traverse a trace. */\r\nstatic void gc_traverse_trace(global_State *g, GCtrace *T)\r\n{\r\n  IRRef ref;\r\n  if (T->traceno == 0) return;\r\n  for (ref = T->nk; ref < REF_TRUE; ref++) {\r\n    IRIns *ir = &T->ir[ref];\r\n    if (ir->o == IR_KGC)\r\n      gc_markobj(g, ir_kgc(ir));\r\n  }\r\n  if (T->link) gc_marktrace(g, T->link);\r\n  if (T->nextroot) gc_marktrace(g, T->nextroot);\r\n  if (T->nextside) gc_marktrace(g, T->nextside);\r\n  gc_markobj(g, gcref(T->startpt));\r\n}\r\n\r\n/* The current trace is a GC root while not anchored in the prototype (yet). */\r\n#define gc_traverse_curtrace(g)\tgc_traverse_trace(g, &G2J(g)->cur)\r\n#else\r\n#define gc_traverse_curtrace(g)\tUNUSED(g)\r\n#endif\r\n\r\n/* Traverse a prototype. */\r\nstatic void gc_traverse_proto(global_State *g, GCproto *pt)\r\n{\r\n  ptrdiff_t i;\r\n  gc_mark_str(proto_chunkname(pt));\r\n  for (i = -(ptrdiff_t)pt->sizekgc; i < 0; i++)  /* Mark collectable consts. */\r\n    gc_markobj(g, proto_kgc(pt, i));\r\n#if LJ_HASJIT\r\n  if (pt->trace) gc_marktrace(g, pt->trace);\r\n#endif\r\n}\r\n\r\n/* Traverse the frame structure of a stack. */\r\nstatic MSize gc_traverse_frames(global_State *g, lua_State *th)\r\n{\r\n  TValue *frame, *top = th->top-1, *bot = tvref(th->stack);\r\n  /* Note: extra vararg frame not skipped, marks function twice (harmless). */\r\n  for (frame = th->base-1; frame > bot; frame = frame_prev(frame)) {\r\n    GCfunc *fn = frame_func(frame);\r\n    TValue *ftop = frame;\r\n    if (isluafunc(fn)) ftop += funcproto(fn)->framesize;\r\n    if (ftop > top) top = ftop;\r\n    gc_markobj(g, fn);  /* Need to mark hidden function (or L). */\r\n  }\r\n  top++;  /* Correct bias of -1 (frame == base-1). */\r\n  if (top > tvref(th->maxstack)) top = tvref(th->maxstack);\r\n  return (MSize)(top - bot);  /* Return minimum needed stack size. */\r\n}\r\n\r\n/* Traverse a thread object. */\r\nstatic void gc_traverse_thread(global_State *g, lua_State *th)\r\n{\r\n  TValue *o, *top = th->top;\r\n  for (o = tvref(th->stack)+1; o < top; o++)\r\n    gc_marktv(g, o);\r\n  if (g->gc.state == GCSatomic) {\r\n    top = tvref(th->stack) + th->stacksize;\r\n    for (; o < top; o++)  /* Clear unmarked slots. */\r\n      setnilV(o);\r\n  }\r\n  gc_markobj(g, tabref(th->env));\r\n  lj_state_shrinkstack(th, gc_traverse_frames(g, th));\r\n}\r\n\r\n/* Propagate one gray object. Traverse it and turn it black. */\r\nstatic size_t propagatemark(global_State *g)\r\n{\r\n  GCobj *o = gcref(g->gc.gray);\r\n  int gct = o->gch.gct;\r\n  lua_assert(isgray(o));\r\n  gray2black(o);\r\n  setgcrefr(g->gc.gray, o->gch.gclist);  /* Remove from gray list. */\r\n  if (LJ_LIKELY(gct == ~LJ_TTAB)) {\r\n    GCtab *t = gco2tab(o);\r\n    if (gc_traverse_tab(g, t) > 0)\r\n      black2gray(o);  /* Keep weak tables gray. */\r\n    return sizeof(GCtab) + sizeof(TValue) * t->asize +\r\n\t\t\t   sizeof(Node) * (t->hmask + 1);\r\n  } else if (LJ_LIKELY(gct == ~LJ_TFUNC)) {\r\n    GCfunc *fn = gco2func(o);\r\n    gc_traverse_func(g, fn);\r\n    return isluafunc(fn) ? sizeLfunc((MSize)fn->l.nupvalues) :\r\n\t\t\t   sizeCfunc((MSize)fn->c.nupvalues);\r\n  } else if (LJ_LIKELY(gct == ~LJ_TPROTO)) {\r\n    GCproto *pt = gco2pt(o);\r\n    gc_traverse_proto(g, pt);\r\n    return pt->sizept;\r\n  } else if (LJ_LIKELY(gct == ~LJ_TTHREAD)) {\r\n    lua_State *th = gco2th(o);\r\n    setgcrefr(th->gclist, g->gc.grayagain);\r\n    setgcref(g->gc.grayagain, o);\r\n    black2gray(o);  /* Threads are never black. */\r\n    gc_traverse_thread(g, th);\r\n    return sizeof(lua_State) + sizeof(TValue) * th->stacksize;\r\n  } else {\r\n#if LJ_HASJIT\r\n    GCtrace *T = gco2trace(o);\r\n    gc_traverse_trace(g, T);\r\n    return ((sizeof(GCtrace)+7)&~7) + (T->nins-T->nk)*sizeof(IRIns) +\r\n\t   T->nsnap*sizeof(SnapShot) + T->nsnapmap*sizeof(SnapEntry);\r\n#else\r\n    lua_assert(0);\r\n    return 0;\r\n#endif\r\n  }\r\n}\r\n\r\n/* Propagate all gray objects. */\r\nstatic size_t gc_propagate_gray(global_State *g)\r\n{\r\n  size_t m = 0;\r\n  while (gcref(g->gc.gray) != NULL)\r\n    m += propagatemark(g);\r\n  return m;\r\n}\r\n\r\n/* -- Sweep phase --------------------------------------------------------- */\r\n\r\n/* Try to shrink some common data structures. */\r\nstatic void gc_shrink(global_State *g, lua_State *L)\r\n{\r\n  if (g->strnum <= (g->strmask >> 2) && g->strmask > LJ_MIN_STRTAB*2-1)\r\n    lj_str_resize(L, g->strmask >> 1);  /* Shrink string table. */\r\n  if (g->tmpbuf.sz > LJ_MIN_SBUF*2)\r\n    lj_str_resizebuf(L, &g->tmpbuf, g->tmpbuf.sz >> 1);  /* Shrink temp buf. */\r\n}\r\n\r\n/* Type of GC free functions. */\r\ntypedef void (LJ_FASTCALL *GCFreeFunc)(global_State *g, GCobj *o);\r\n\r\n/* GC free functions for LJ_TSTR .. LJ_TUDATA. ORDER LJ_T */\r\nstatic const GCFreeFunc gc_freefunc[] = {\r\n  (GCFreeFunc)lj_str_free,\r\n  (GCFreeFunc)lj_func_freeuv,\r\n  (GCFreeFunc)lj_state_free,\r\n  (GCFreeFunc)lj_func_freeproto,\r\n  (GCFreeFunc)lj_func_free,\r\n#if LJ_HASJIT\r\n  (GCFreeFunc)lj_trace_free,\r\n#else\r\n  (GCFreeFunc)0,\r\n#endif\r\n#if LJ_HASFFI\r\n  (GCFreeFunc)lj_cdata_free,\r\n#else\r\n  (GCFreeFunc)0,\r\n#endif\r\n  (GCFreeFunc)lj_tab_free,\r\n  (GCFreeFunc)lj_udata_free\r\n};\r\n\r\n/* Full sweep of a GC list. */\r\n#define gc_fullsweep(g, p)\tgc_sweep(g, (p), LJ_MAX_MEM)\r\n\r\n/* Partial sweep of a GC list. */\r\nstatic GCRef *gc_sweep(global_State *g, GCRef *p, uint32_t lim)\r\n{\r\n  /* Mask with other white and LJ_GC_FIXED. Or LJ_GC_SFIXED on shutdown. */\r\n  int ow = otherwhite(g);\r\n  GCobj *o;\r\n  while ((o = gcref(*p)) != NULL && lim-- > 0) {\r\n    if (o->gch.gct == ~LJ_TTHREAD)  /* Need to sweep open upvalues, too. */\r\n      gc_fullsweep(g, &gco2th(o)->openupval);\r\n    if (((o->gch.marked ^ LJ_GC_WHITES) & ow)) {  /* Black or current white? */\r\n      lua_assert(!isdead(g, o) || (o->gch.marked & LJ_GC_FIXED));\r\n      makewhite(g, o);  /* Value is alive, change to the current white. */\r\n      p = &o->gch.nextgc;\r\n    } else {  /* Otherwise value is dead, free it. */\r\n      lua_assert(isdead(g, o) || ow == LJ_GC_SFIXED);\r\n      setgcrefr(*p, o->gch.nextgc);\r\n      if (o == gcref(g->gc.root))\r\n\tsetgcrefr(g->gc.root, o->gch.nextgc);  /* Adjust list anchor. */\r\n      gc_freefunc[o->gch.gct - ~LJ_TSTR](g, o);\r\n    }\r\n  }\r\n  return p;\r\n}\r\n\r\n/* Check whether we can clear a key or a value slot from a table. */\r\nstatic int gc_mayclear(cTValue *o, int val)\r\n{\r\n  if (tvisgcv(o)) {  /* Only collectable objects can be weak references. */\r\n    if (tvisstr(o)) {  /* But strings cannot be used as weak references. */\r\n      gc_mark_str(strV(o));  /* And need to be marked. */\r\n      return 0;\r\n    }\r\n    if (iswhite(gcV(o)))\r\n      return 1;  /* Object is about to be collected. */\r\n    if (tvisudata(o) && val && isfinalized(udataV(o)))\r\n      return 1;  /* Finalized userdata is dropped only from values. */\r\n  }\r\n  return 0;  /* Cannot clear. */\r\n}\r\n\r\n/* Clear collected entries from weak tables. */\r\nstatic void gc_clearweak(GCobj *o)\r\n{\r\n  while (o) {\r\n    GCtab *t = gco2tab(o);\r\n    lua_assert((t->marked & LJ_GC_WEAK));\r\n    if ((t->marked & LJ_GC_WEAKVAL)) {\r\n      MSize i, asize = t->asize;\r\n      for (i = 0; i < asize; i++) {\r\n\t/* Clear array slot when value is about to be collected. */\r\n\tTValue *tv = arrayslot(t, i);\r\n\tif (gc_mayclear(tv, 1))\r\n\t  setnilV(tv);\r\n      }\r\n    }\r\n    if (t->hmask > 0) {\r\n      Node *node = noderef(t->node);\r\n      MSize i, hmask = t->hmask;\r\n      for (i = 0; i <= hmask; i++) {\r\n\tNode *n = &node[i];\r\n\t/* Clear hash slot when key or value is about to be collected. */\r\n\tif (!tvisnil(&n->val) && (gc_mayclear(&n->key, 0) ||\r\n\t\t\t\t  gc_mayclear(&n->val, 1)))\r\n\t  setnilV(&n->val);\r\n      }\r\n    }\r\n    o = gcref(t->gclist);\r\n  }\r\n}\r\n\r\n/* Call a userdata or cdata finalizer. */\r\nstatic void gc_call_finalizer(global_State *g, lua_State *L,\r\n\t\t\t      cTValue *mo, GCobj *o)\r\n{\r\n  /* Save and restore lots of state around the __gc callback. */\r\n  uint8_t oldh = hook_save(g);\r\n  MSize oldt = g->gc.threshold;\r\n  int errcode;\r\n  TValue *top;\r\n  lj_trace_abort(g);\r\n  top = L->top;\r\n  L->top = top+2;\r\n  hook_entergc(g);  /* Disable hooks and new traces during __gc. */\r\n  g->gc.threshold = LJ_MAX_MEM;  /* Prevent GC steps. */\r\n  copyTV(L, top, mo);\r\n  setgcV(L, top+1, o, ~o->gch.gct);\r\n  errcode = lj_vm_pcall(L, top+1, 1+0, -1);  /* Stack: |mo|o| -> | */\r\n  hook_restore(g, oldh);\r\n  g->gc.threshold = oldt;  /* Restore GC threshold. */\r\n  if (errcode)\r\n    lj_err_throw(L, errcode);  /* Propagate errors. */\r\n}\r\n\r\n/* Finalize one userdata or cdata object from the mmudata list. */\r\nstatic void gc_finalize(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  GCobj *o = gcnext(gcref(g->gc.mmudata));\r\n  cTValue *mo;\r\n  lua_assert(gcref(g->jit_L) == NULL);  /* Must not be called on trace. */\r\n  /* Unchain from list of userdata to be finalized. */\r\n  if (o == gcref(g->gc.mmudata))\r\n    setgcrefnull(g->gc.mmudata);\r\n  else\r\n    setgcrefr(gcref(g->gc.mmudata)->gch.nextgc, o->gch.nextgc);\r\n#if LJ_HASFFI\r\n  if (o->gch.gct == ~LJ_TCDATA) {\r\n    TValue tmp, *tv;\r\n    /* Add cdata back to the GC list and make it white. */\r\n    setgcrefr(o->gch.nextgc, g->gc.root);\r\n    setgcref(g->gc.root, o);\r\n    makewhite(g, o);\r\n    o->gch.marked &= (uint8_t)~LJ_GC_CDATA_FIN;\r\n    /* Resolve finalizer. */\r\n    setcdataV(L, &tmp, gco2cd(o));\r\n    tv = lj_tab_set(L, ctype_ctsG(g)->finalizer, &tmp);\r\n    if (!tvisnil(tv)) {\r\n      g->gc.nocdatafin = 0;\r\n      copyTV(L, &tmp, tv);\r\n      setnilV(tv);  /* Clear entry in finalizer table. */\r\n      gc_call_finalizer(g, L, &tmp, o);\r\n    }\r\n    return;\r\n  }\r\n#endif\r\n  /* Add userdata back to the main userdata list and make it white. */\r\n  setgcrefr(o->gch.nextgc, mainthread(g)->nextgc);\r\n  setgcref(mainthread(g)->nextgc, o);\r\n  makewhite(g, o);\r\n  /* Resolve the __gc metamethod. */\r\n  mo = lj_meta_fastg(g, tabref(gco2ud(o)->metatable), MM_gc);\r\n  if (mo)\r\n    gc_call_finalizer(g, L, mo, o);\r\n}\r\n\r\n/* Finalize all userdata objects from mmudata list. */\r\nvoid lj_gc_finalize_udata(lua_State *L)\r\n{\r\n  while (gcref(G(L)->gc.mmudata) != NULL)\r\n    gc_finalize(L);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Finalize all cdata objects from finalizer table. */\r\nvoid lj_gc_finalize_cdata(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  CTState *cts = ctype_ctsG(g);\r\n  if (cts) {\r\n    GCtab *t = cts->finalizer;\r\n    Node *node = noderef(t->node);\r\n    ptrdiff_t i;\r\n    setgcrefnull(t->metatable);  /* Mark finalizer table as disabled. */\r\n    for (i = (ptrdiff_t)t->hmask; i >= 0; i--)\r\n      if (!tvisnil(&node[i].val) && tviscdata(&node[i].key)) {\r\n\tGCobj *o = gcV(&node[i].key);\r\n\tTValue tmp;\r\n\tmakewhite(g, o);\r\n\to->gch.marked &= (uint8_t)~LJ_GC_CDATA_FIN;\r\n\tcopyTV(L, &tmp, &node[i].val);\r\n\tsetnilV(&node[i].val);\r\n\tgc_call_finalizer(g, L, &tmp, o);\r\n      }\r\n  }\r\n}\r\n#endif\r\n\r\n/* Free all remaining GC objects. */\r\nvoid lj_gc_freeall(global_State *g)\r\n{\r\n  MSize i, strmask;\r\n  /* Free everything, except super-fixed objects (the main thread). */\r\n  g->gc.currentwhite = LJ_GC_WHITES | LJ_GC_SFIXED;\r\n  gc_fullsweep(g, &g->gc.root);\r\n  strmask = g->strmask;\r\n  for (i = 0; i <= strmask; i++)  /* Free all string hash chains. */\r\n    gc_fullsweep(g, &g->strhash[i]);\r\n}\r\n\r\n/* -- Collector ----------------------------------------------------------- */\r\n\r\n/* Atomic part of the GC cycle, transitioning from mark to sweep phase. */\r\nstatic void atomic(global_State *g, lua_State *L)\r\n{\r\n  size_t udsize;\r\n\r\n  gc_mark_uv(g);  /* Need to remark open upvalues (the thread may be dead). */\r\n  gc_propagate_gray(g);  /* Propagate any left-overs. */\r\n\r\n  setgcrefr(g->gc.gray, g->gc.weak);  /* Empty the list of weak tables. */\r\n  setgcrefnull(g->gc.weak);\r\n  lua_assert(!iswhite(obj2gco(mainthread(g))));\r\n  gc_markobj(g, L);  /* Mark running thread. */\r\n  gc_traverse_curtrace(g);  /* Traverse current trace. */\r\n  gc_mark_gcroot(g);  /* Mark GC roots (again). */\r\n  gc_propagate_gray(g);  /* Propagate all of the above. */\r\n\r\n  setgcrefr(g->gc.gray, g->gc.grayagain);  /* Empty the 2nd chance list. */\r\n  setgcrefnull(g->gc.grayagain);\r\n  gc_propagate_gray(g);  /* Propagate it. */\r\n\r\n  udsize = lj_gc_separateudata(g, 0);  /* Separate userdata to be finalized. */\r\n  gc_mark_mmudata(g);  /* Mark them. */\r\n  udsize += gc_propagate_gray(g);  /* And propagate the marks. */\r\n\r\n  /* All marking done, clear weak tables. */\r\n  gc_clearweak(gcref(g->gc.weak));\r\n\r\n  /* Prepare for sweep phase. */\r\n  g->gc.currentwhite = (uint8_t)otherwhite(g);  /* Flip current white. */\r\n  g->strempty.marked = g->gc.currentwhite;\r\n  setmref(g->gc.sweep, &g->gc.root);\r\n  g->gc.estimate = g->gc.total - (MSize)udsize;  /* Initial estimate. */\r\n}\r\n\r\n/* GC state machine. Returns a cost estimate for each step performed. */\r\nstatic size_t gc_onestep(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  switch (g->gc.state) {\r\n  case GCSpause:\r\n    gc_mark_start(g);  /* Start a new GC cycle by marking all GC roots. */\r\n    return 0;\r\n  case GCSpropagate:\r\n    if (gcref(g->gc.gray) != NULL)\r\n      return propagatemark(g);  /* Propagate one gray object. */\r\n    g->gc.state = GCSatomic;  /* End of mark phase. */\r\n    return 0;\r\n  case GCSatomic:\r\n    if (gcref(g->jit_L))  /* Don't run atomic phase on trace. */\r\n      return LJ_MAX_MEM;\r\n    atomic(g, L);\r\n    g->gc.state = GCSsweepstring;  /* Start of sweep phase. */\r\n    g->gc.sweepstr = 0;\r\n    return 0;\r\n  case GCSsweepstring: {\r\n    MSize old = g->gc.total;\r\n    gc_fullsweep(g, &g->strhash[g->gc.sweepstr++]);  /* Sweep one chain. */\r\n    if (g->gc.sweepstr > g->strmask)\r\n      g->gc.state = GCSsweep;  /* All string hash chains sweeped. */\r\n    lua_assert(old >= g->gc.total);\r\n    g->gc.estimate -= old - g->gc.total;\r\n    return GCSWEEPCOST;\r\n    }\r\n  case GCSsweep: {\r\n    MSize old = g->gc.total;\r\n    setmref(g->gc.sweep, gc_sweep(g, mref(g->gc.sweep, GCRef), GCSWEEPMAX));\r\n    lua_assert(old >= g->gc.total);\r\n    g->gc.estimate -= old - g->gc.total;\r\n    if (gcref(*mref(g->gc.sweep, GCRef)) == NULL) {\r\n      gc_shrink(g, L);\r\n      if (gcref(g->gc.mmudata)) {  /* Need any finalizations? */\r\n\tg->gc.state = GCSfinalize;\r\n#if LJ_HASFFI\r\n\tg->gc.nocdatafin = 1;\r\n#endif\r\n      } else {  /* Otherwise skip this phase to help the JIT. */\r\n\tg->gc.state = GCSpause;  /* End of GC cycle. */\r\n\tg->gc.debt = 0;\r\n      }\r\n    }\r\n    return GCSWEEPMAX*GCSWEEPCOST;\r\n    }\r\n  case GCSfinalize:\r\n    if (gcref(g->gc.mmudata) != NULL) {\r\n      if (gcref(g->jit_L))  /* Don't call finalizers on trace. */\r\n\treturn LJ_MAX_MEM;\r\n      gc_finalize(L);  /* Finalize one userdata object. */\r\n      if (g->gc.estimate > GCFINALIZECOST)\r\n\tg->gc.estimate -= GCFINALIZECOST;\r\n      return GCFINALIZECOST;\r\n    }\r\n#if LJ_HASFFI\r\n    if (!g->gc.nocdatafin) lj_tab_rehash(L, ctype_ctsG(g)->finalizer);\r\n#endif\r\n    g->gc.state = GCSpause;  /* End of GC cycle. */\r\n    g->gc.debt = 0;\r\n    return 0;\r\n  default:\r\n    lua_assert(0);\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Perform a limited amount of incremental GC steps. */\r\nint LJ_FASTCALL lj_gc_step(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  MSize lim;\r\n  int32_t ostate = g->vmstate;\r\n  setvmstate(g, GC);\r\n  lim = (GCSTEPSIZE/100) * g->gc.stepmul;\r\n  if (lim == 0)\r\n    lim = LJ_MAX_MEM;\r\n  if (g->gc.total > g->gc.threshold)\r\n    g->gc.debt += g->gc.total - g->gc.threshold;\r\n  do {\r\n    lim -= (MSize)gc_onestep(L);\r\n    if (g->gc.state == GCSpause) {\r\n      g->gc.threshold = (g->gc.estimate/100) * g->gc.pause;\r\n      g->vmstate = ostate;\r\n      return 1;  /* Finished a GC cycle. */\r\n    }\r\n  } while ((int32_t)lim > 0);\r\n  if (g->gc.debt < GCSTEPSIZE) {\r\n    g->gc.threshold = g->gc.total + GCSTEPSIZE;\r\n    g->vmstate = ostate;\r\n    return -1;\r\n  } else {\r\n    g->gc.debt -= GCSTEPSIZE;\r\n    g->gc.threshold = g->gc.total;\r\n    g->vmstate = ostate;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Ditto, but fix the stack top first. */\r\nvoid LJ_FASTCALL lj_gc_step_fixtop(lua_State *L)\r\n{\r\n  if (curr_funcisL(L)) L->top = curr_topL(L);\r\n  lj_gc_step(L);\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Perform multiple GC steps. Called from JIT-compiled code. */\r\nint LJ_FASTCALL lj_gc_step_jit(global_State *g, MSize steps)\r\n{\r\n  lua_State *L = gco2th(gcref(g->jit_L));\r\n  L->base = mref(G(L)->jit_base, TValue);\r\n  L->top = curr_topL(L);\r\n  while (steps-- > 0 && lj_gc_step(L) == 0)\r\n    ;\r\n  /* Return 1 to force a trace exit. */\r\n  return (G(L)->gc.state == GCSatomic || G(L)->gc.state == GCSfinalize);\r\n}\r\n#endif\r\n\r\n/* Perform a full GC cycle. */\r\nvoid lj_gc_fullgc(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  int32_t ostate = g->vmstate;\r\n  setvmstate(g, GC);\r\n  if (g->gc.state <= GCSatomic) {  /* Caught somewhere in the middle. */\r\n    setmref(g->gc.sweep, &g->gc.root);  /* Sweep everything (preserving it). */\r\n    setgcrefnull(g->gc.gray);  /* Reset lists from partial propagation. */\r\n    setgcrefnull(g->gc.grayagain);\r\n    setgcrefnull(g->gc.weak);\r\n    g->gc.state = GCSsweepstring;  /* Fast forward to the sweep phase. */\r\n    g->gc.sweepstr = 0;\r\n  }\r\n  while (g->gc.state == GCSsweepstring || g->gc.state == GCSsweep)\r\n    gc_onestep(L);  /* Finish sweep. */\r\n  lua_assert(g->gc.state == GCSfinalize || g->gc.state == GCSpause);\r\n  /* Now perform a full GC. */\r\n  g->gc.state = GCSpause;\r\n  do { gc_onestep(L); } while (g->gc.state != GCSpause);\r\n  g->gc.threshold = (g->gc.estimate/100) * g->gc.pause;\r\n  g->vmstate = ostate;\r\n}\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\n/* Move the GC propagation frontier forward. */\r\nvoid lj_gc_barrierf(global_State *g, GCobj *o, GCobj *v)\r\n{\r\n  lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));\r\n  lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n  lua_assert(o->gch.gct != ~LJ_TTAB);\r\n  /* Preserve invariant during propagation. Otherwise it doesn't matter. */\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_mark(g, v);  /* Move frontier forward. */\r\n  else\r\n    makewhite(g, o);  /* Make it white to avoid the following barrier. */\r\n}\r\n\r\n/* Specialized barrier for closed upvalue. Pass &uv->tv. */\r\nvoid LJ_FASTCALL lj_gc_barrieruv(global_State *g, TValue *tv)\r\n{\r\n#define TV2MARKED(x) \\\r\n  (*((uint8_t *)(x) - offsetof(GCupval, tv) + offsetof(GCupval, marked)))\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_mark(g, gcV(tv));\r\n  else\r\n    TV2MARKED(tv) = (TV2MARKED(tv) & (uint8_t)~LJ_GC_COLORS) | curwhite(g);\r\n#undef TV2MARKED\r\n}\r\n\r\n/* Close upvalue. Also needs a write barrier. */\r\nvoid lj_gc_closeuv(global_State *g, GCupval *uv)\r\n{\r\n  GCobj *o = obj2gco(uv);\r\n  /* Copy stack slot to upvalue itself and point to the copy. */\r\n  copyTV(mainthread(g), &uv->tv, uvval(uv));\r\n  setmref(uv->v, &uv->tv);\r\n  uv->closed = 1;\r\n  setgcrefr(o->gch.nextgc, g->gc.root);\r\n  setgcref(g->gc.root, o);\r\n  if (isgray(o)) {  /* A closed upvalue is never gray, so fix this. */\r\n    if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic) {\r\n      gray2black(o);  /* Make it black and preserve invariant. */\r\n      if (tviswhite(&uv->tv))\r\n\tlj_gc_barrierf(g, o, gcV(&uv->tv));\r\n    } else {\r\n      makewhite(g, o);  /* Make it white, i.e. sweep the upvalue. */\r\n      lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Mark a trace if it's saved during the propagation phase. */\r\nvoid lj_gc_barriertrace(global_State *g, uint32_t traceno)\r\n{\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_marktrace(g, traceno);\r\n}\r\n#endif\r\n\r\n/* -- Allocator ----------------------------------------------------------- */\r\n\r\n/* Call pluggable memory allocator to allocate or resize a fragment. */\r\nvoid *lj_mem_realloc(lua_State *L, void *p, MSize osz, MSize nsz)\r\n{\r\n  global_State *g = G(L);\r\n  lua_assert((osz == 0) == (p == NULL));\r\n  p = g->allocf(g->allocd, p, osz, nsz);\r\n  if (p == NULL && nsz > 0)\r\n    lj_err_mem(L);\r\n  lua_assert((nsz == 0) == (p == NULL));\r\n  lua_assert(checkptr32(p));\r\n  g->gc.total = (g->gc.total - osz) + nsz;\r\n  return p;\r\n}\r\n\r\n/* Allocate new GC object and link it to the root set. */\r\nvoid * LJ_FASTCALL lj_mem_newgco(lua_State *L, MSize size)\r\n{\r\n  global_State *g = G(L);\r\n  GCobj *o = (GCobj *)g->allocf(g->allocd, NULL, 0, size);\r\n  if (o == NULL)\r\n    lj_err_mem(L);\r\n  lua_assert(checkptr32(o));\r\n  g->gc.total += size;\r\n  setgcrefr(o->gch.nextgc, g->gc.root);\r\n  setgcref(g->gc.root, o);\r\n  newwhite(g, o);\r\n  return o;\r\n}\r\n\r\n/* Resize growable vector. */\r\nvoid *lj_mem_grow(lua_State *L, void *p, MSize *szp, MSize lim, MSize esz)\r\n{\r\n  MSize sz = (*szp) << 1;\r\n  if (sz < LJ_MIN_VECSZ)\r\n    sz = LJ_MIN_VECSZ;\r\n  if (sz > lim)\r\n    sz = lim;\r\n  p = lj_mem_realloc(L, p, (*szp)*esz, sz*esz);\r\n  *szp = sz;\r\n  return p;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_gc.h",
    "content": "/*\r\n** Garbage collector.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_GC_H\r\n#define _LJ_GC_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Garbage collector states. Order matters. */\r\nenum {\r\n  GCSpause, GCSpropagate, GCSatomic, GCSsweepstring, GCSsweep, GCSfinalize\r\n};\r\n\r\n/* Bitmasks for marked field of GCobj. */\r\n#define LJ_GC_WHITE0\t0x01\r\n#define LJ_GC_WHITE1\t0x02\r\n#define LJ_GC_BLACK\t0x04\r\n#define LJ_GC_FINALIZED\t0x08\r\n#define LJ_GC_WEAKKEY\t0x08\r\n#define LJ_GC_WEAKVAL\t0x10\r\n#define LJ_GC_CDATA_FIN\t0x10\r\n#define LJ_GC_FIXED\t0x20\r\n#define LJ_GC_SFIXED\t0x40\r\n\r\n#define LJ_GC_WHITES\t(LJ_GC_WHITE0 | LJ_GC_WHITE1)\r\n#define LJ_GC_COLORS\t(LJ_GC_WHITES | LJ_GC_BLACK)\r\n#define LJ_GC_WEAK\t(LJ_GC_WEAKKEY | LJ_GC_WEAKVAL)\r\n\r\n/* Macros to test and set GCobj colors. */\r\n#define iswhite(x)\t((x)->gch.marked & LJ_GC_WHITES)\r\n#define isblack(x)\t((x)->gch.marked & LJ_GC_BLACK)\r\n#define isgray(x)\t(!((x)->gch.marked & (LJ_GC_BLACK|LJ_GC_WHITES)))\r\n#define tviswhite(x)\t(tvisgcv(x) && iswhite(gcV(x)))\r\n#define otherwhite(g)\t(g->gc.currentwhite ^ LJ_GC_WHITES)\r\n#define isdead(g, v)\t((v)->gch.marked & otherwhite(g) & LJ_GC_WHITES)\r\n\r\n#define curwhite(g)\t((g)->gc.currentwhite & LJ_GC_WHITES)\r\n#define newwhite(g, x)\t(obj2gco(x)->gch.marked = (uint8_t)curwhite(g))\r\n#define makewhite(g, x) \\\r\n  ((x)->gch.marked = ((x)->gch.marked & (uint8_t)~LJ_GC_COLORS) | curwhite(g))\r\n#define flipwhite(x)\t((x)->gch.marked ^= LJ_GC_WHITES)\r\n#define black2gray(x)\t((x)->gch.marked &= (uint8_t)~LJ_GC_BLACK)\r\n#define fixstring(s)\t((s)->marked |= LJ_GC_FIXED)\r\n#define markfinalized(x)\t((x)->gch.marked |= LJ_GC_FINALIZED)\r\n\r\n/* Collector. */\r\nLJ_FUNC size_t lj_gc_separateudata(global_State *g, int all);\r\nLJ_FUNC void lj_gc_finalize_udata(lua_State *L);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_gc_finalize_cdata(lua_State *L);\r\n#else\r\n#define lj_gc_finalize_cdata(L)\t\tUNUSED(L)\r\n#endif\r\nLJ_FUNC void lj_gc_freeall(global_State *g);\r\nLJ_FUNCA int LJ_FASTCALL lj_gc_step(lua_State *L);\r\nLJ_FUNCA void LJ_FASTCALL lj_gc_step_fixtop(lua_State *L);\r\n#if LJ_HASJIT\r\nLJ_FUNC int LJ_FASTCALL lj_gc_step_jit(global_State *g, MSize steps);\r\n#endif\r\nLJ_FUNC void lj_gc_fullgc(lua_State *L);\r\n\r\n/* GC check: drive collector forward if the GC threshold has been reached. */\r\n#define lj_gc_check(L) \\\r\n  { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \\\r\n      lj_gc_step(L); }\r\n#define lj_gc_check_fixtop(L) \\\r\n  { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \\\r\n      lj_gc_step_fixtop(L); }\r\n\r\n/* Write barriers. */\r\nLJ_FUNC void lj_gc_barrierf(global_State *g, GCobj *o, GCobj *v);\r\nLJ_FUNCA void LJ_FASTCALL lj_gc_barrieruv(global_State *g, TValue *tv);\r\nLJ_FUNC void lj_gc_closeuv(global_State *g, GCupval *uv);\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_gc_barriertrace(global_State *g, uint32_t traceno);\r\n#endif\r\n\r\n/* Move the GC propagation frontier back for tables (make it gray again). */\r\nstatic LJ_AINLINE void lj_gc_barrierback(global_State *g, GCtab *t)\r\n{\r\n  GCobj *o = obj2gco(t);\r\n  lua_assert(isblack(o) && !isdead(g, o));\r\n  lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n  black2gray(o);\r\n  setgcrefr(t->gclist, g->gc.grayagain);\r\n  setgcref(g->gc.grayagain, o);\r\n}\r\n\r\n/* Barrier for stores to table objects. TValue and GCobj variant. */\r\n#define lj_gc_anybarriert(L, t)  \\\r\n  { if (LJ_UNLIKELY(isblack(obj2gco(t)))) lj_gc_barrierback(G(L), (t)); }\r\n#define lj_gc_barriert(L, t, tv) \\\r\n  { if (tviswhite(tv) && isblack(obj2gco(t))) \\\r\n      lj_gc_barrierback(G(L), (t)); }\r\n#define lj_gc_objbarriert(L, t, o)  \\\r\n  { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) \\\r\n      lj_gc_barrierback(G(L), (t)); }\r\n\r\n/* Barrier for stores to any other object. TValue and GCobj variant. */\r\n#define lj_gc_barrier(L, p, tv) \\\r\n  { if (tviswhite(tv) && isblack(obj2gco(p))) \\\r\n      lj_gc_barrierf(G(L), obj2gco(p), gcV(tv)); }\r\n#define lj_gc_objbarrier(L, p, o) \\\r\n  { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \\\r\n      lj_gc_barrierf(G(L), obj2gco(p), obj2gco(o)); }\r\n\r\n/* Allocator. */\r\nLJ_FUNC void *lj_mem_realloc(lua_State *L, void *p, MSize osz, MSize nsz);\r\nLJ_FUNC void * LJ_FASTCALL lj_mem_newgco(lua_State *L, MSize size);\r\nLJ_FUNC void *lj_mem_grow(lua_State *L, void *p,\r\n\t\t\t  MSize *szp, MSize lim, MSize esz);\r\n\r\n#define lj_mem_new(L, s)\tlj_mem_realloc(L, NULL, 0, (s))\r\n\r\nstatic LJ_AINLINE void lj_mem_free(global_State *g, void *p, size_t osize)\r\n{\r\n  g->gc.total -= (MSize)osize;\r\n  g->allocf(g->allocd, p, osize, 0);\r\n}\r\n\r\n#define lj_mem_newvec(L, n, t)\t((t *)lj_mem_new(L, (MSize)((n)*sizeof(t))))\r\n#define lj_mem_reallocvec(L, p, on, n, t) \\\r\n  ((p) = (t *)lj_mem_realloc(L, p, (on)*sizeof(t), (MSize)((n)*sizeof(t))))\r\n#define lj_mem_growvec(L, p, n, m, t) \\\r\n  ((p) = (t *)lj_mem_grow(L, (p), &(n), (m), (MSize)sizeof(t)))\r\n#define lj_mem_freevec(g, p, n, t)\tlj_mem_free(g, (p), (n)*sizeof(t))\r\n\r\n#define lj_mem_newobj(L, t)\t((t *)lj_mem_newgco(L, sizeof(t)))\r\n#define lj_mem_newt(L, s, t)\t((t *)lj_mem_new(L, (s)))\r\n#define lj_mem_freet(g, p)\tlj_mem_free(g, (p), sizeof(*(p)))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_gdbjit.c",
    "content": "/*\r\n** Client for the GDB JIT API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_gdbjit_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_dispatch.h\"\r\n\r\n/* This is not compiled in by default.\r\n** Enable with -DLUAJIT_USE_GDBJIT in the Makefile and recompile everything.\r\n*/\r\n#ifdef LUAJIT_USE_GDBJIT\r\n\r\n/* The GDB JIT API allows JIT compilers to pass debug information about\r\n** JIT-compiled code back to GDB. You need at least GDB 7.0 or higher\r\n** to see it in action.\r\n**\r\n** This is a passive API, so it works even when not running under GDB\r\n** or when attaching to an already running process. Alas, this implies\r\n** enabling it always has a non-negligible overhead -- do not use in\r\n** release mode!\r\n**\r\n** The LuaJIT GDB JIT client is rather minimal at the moment. It gives\r\n** each trace a symbol name and adds a source location and frame unwind\r\n** information. Obviously LuaJIT itself and any embedding C application\r\n** should be compiled with debug symbols, too (see the Makefile).\r\n**\r\n** Traces are named TRACE_1, TRACE_2, ... these correspond to the trace\r\n** numbers from -jv or -jdump. Use \"break TRACE_1\" or \"tbreak TRACE_1\" etc.\r\n** to set breakpoints on specific traces (even ahead of their creation).\r\n**\r\n** The source location for each trace allows listing the corresponding\r\n** source lines with the GDB command \"list\" (but only if the Lua source\r\n** has been loaded from a file). Currently this is always set to the\r\n** location where the trace has been started.\r\n**\r\n** Frame unwind information can be inspected with the GDB command\r\n** \"info frame\". This also allows proper backtraces across JIT-compiled\r\n** code with the GDB command \"bt\".\r\n**\r\n** You probably want to add the following settings to a .gdbinit file\r\n** (or add them to ~/.gdbinit):\r\n**   set disassembly-flavor intel\r\n**   set breakpoint pending on\r\n**\r\n** Here's a sample GDB session:\r\n** ------------------------------------------------------------------------\r\n\r\n$ cat >x.lua\r\nfor outer=1,100 do\r\n  for inner=1,100 do end\r\nend\r\n^D\r\n\r\n$ luajit -jv x.lua\r\n[TRACE   1 x.lua:2]\r\n[TRACE   2 (1/3) x.lua:1 -> 1]\r\n\r\n$ gdb --quiet --args luajit x.lua\r\n(gdb) tbreak TRACE_1\r\nFunction \"TRACE_1\" not defined.\r\nTemporary breakpoint 1 (TRACE_1) pending.\r\n(gdb) run\r\nStarting program: luajit x.lua\r\n\r\nTemporary breakpoint 1, TRACE_1 () at x.lua:2\r\n2\t  for inner=1,100 do end\r\n(gdb) list\r\n1\tfor outer=1,100 do\r\n2\t  for inner=1,100 do end\r\n3\tend\r\n(gdb) bt\r\n#0  TRACE_1 () at x.lua:2\r\n#1  0x08053690 in lua_pcall [...]\r\n[...]\r\n#7  0x0806ff90 in main [...]\r\n(gdb) disass TRACE_1\r\nDump of assembler code for function TRACE_1:\r\n0xf7fd9fba <TRACE_1+0>:\tmov    DWORD PTR ds:0xf7e0e2a0,0x1\r\n0xf7fd9fc4 <TRACE_1+10>:\tmovsd  xmm7,QWORD PTR [edx+0x20]\r\n[...]\r\n0xf7fd9ff8 <TRACE_1+62>:\tjmp    0xf7fd2014\r\nEnd of assembler dump.\r\n(gdb) tbreak TRACE_2\r\nFunction \"TRACE_2\" not defined.\r\nTemporary breakpoint 2 (TRACE_2) pending.\r\n(gdb) cont\r\nContinuing.\r\n\r\nTemporary breakpoint 2, TRACE_2 () at x.lua:1\r\n1\tfor outer=1,100 do\r\n(gdb) info frame\r\nStack level 0, frame at 0xffffd7c0:\r\n eip = 0xf7fd9f60 in TRACE_2 (x.lua:1); saved eip 0x8053690\r\n called by frame at 0xffffd7e0\r\n source language unknown.\r\n Arglist at 0xffffd78c, args:\r\n Locals at 0xffffd78c, Previous frame's sp is 0xffffd7c0\r\n Saved registers:\r\n  ebx at 0xffffd7ac, ebp at 0xffffd7b8, esi at 0xffffd7b0, edi at 0xffffd7b4,\r\n  eip at 0xffffd7bc\r\n(gdb)\r\n\r\n** ------------------------------------------------------------------------\r\n*/\r\n\r\n/* -- GDB JIT API --------------------------------------------------------- */\r\n\r\n/* GDB JIT actions. */\r\nenum {\r\n  GDBJIT_NOACTION = 0,\r\n  GDBJIT_REGISTER,\r\n  GDBJIT_UNREGISTER\r\n};\r\n\r\n/* GDB JIT entry. */\r\ntypedef struct GDBJITentry {\r\n  struct GDBJITentry *next_entry;\r\n  struct GDBJITentry *prev_entry;\r\n  const char *symfile_addr;\r\n  uint64_t symfile_size;\r\n} GDBJITentry;\r\n\r\n/* GDB JIT descriptor. */\r\ntypedef struct GDBJITdesc {\r\n  uint32_t version;\r\n  uint32_t action_flag;\r\n  GDBJITentry *relevant_entry;\r\n  GDBJITentry *first_entry;\r\n} GDBJITdesc;\r\n\r\nGDBJITdesc __jit_debug_descriptor = {\r\n  1, GDBJIT_NOACTION, NULL, NULL\r\n};\r\n\r\n/* GDB sets a breakpoint at this function. */\r\nvoid LJ_NOINLINE __jit_debug_register_code()\r\n{\r\n  __asm__ __volatile__(\"\");\r\n};\r\n\r\n/* -- In-memory ELF object definitions ------------------------------------ */\r\n\r\n/* ELF definitions. */\r\ntypedef struct ELFheader {\r\n  uint8_t emagic[4];\r\n  uint8_t eclass;\r\n  uint8_t eendian;\r\n  uint8_t eversion;\r\n  uint8_t eosabi;\r\n  uint8_t eabiversion;\r\n  uint8_t epad[7];\r\n  uint16_t type;\r\n  uint16_t machine;\r\n  uint32_t version;\r\n  uintptr_t entry;\r\n  uintptr_t phofs;\r\n  uintptr_t shofs;\r\n  uint32_t flags;\r\n  uint16_t ehsize;\r\n  uint16_t phentsize;\r\n  uint16_t phnum;\r\n  uint16_t shentsize;\r\n  uint16_t shnum;\r\n  uint16_t shstridx;\r\n} ELFheader;\r\n\r\ntypedef struct ELFsectheader {\r\n  uint32_t name;\r\n  uint32_t type;\r\n  uintptr_t flags;\r\n  uintptr_t addr;\r\n  uintptr_t ofs;\r\n  uintptr_t size;\r\n  uint32_t link;\r\n  uint32_t info;\r\n  uintptr_t align;\r\n  uintptr_t entsize;\r\n} ELFsectheader;\r\n\r\n#define ELFSECT_IDX_ABS\t\t0xfff1\r\n\r\nenum {\r\n  ELFSECT_TYPE_PROGBITS = 1,\r\n  ELFSECT_TYPE_SYMTAB = 2,\r\n  ELFSECT_TYPE_STRTAB = 3,\r\n  ELFSECT_TYPE_NOBITS = 8\r\n};\r\n\r\n#define ELFSECT_FLAGS_WRITE\t1\r\n#define ELFSECT_FLAGS_ALLOC\t2\r\n#define ELFSECT_FLAGS_EXEC\t4\r\n\r\ntypedef struct ELFsymbol {\r\n#if LJ_64\r\n  uint32_t name;\r\n  uint8_t info;\r\n  uint8_t other;\r\n  uint16_t sectidx;\r\n  uintptr_t value;\r\n  uint64_t size;\r\n#else\r\n  uint32_t name;\r\n  uintptr_t value;\r\n  uint32_t size;\r\n  uint8_t info;\r\n  uint8_t other;\r\n  uint16_t sectidx;\r\n#endif\r\n} ELFsymbol;\r\n\r\nenum {\r\n  ELFSYM_TYPE_FUNC = 2,\r\n  ELFSYM_TYPE_FILE = 4,\r\n  ELFSYM_BIND_LOCAL = 0 << 4,\r\n  ELFSYM_BIND_GLOBAL = 1 << 4,\r\n};\r\n\r\n/* DWARF definitions. */\r\n#define DW_CIE_VERSION\t1\r\n\r\nenum {\r\n  DW_CFA_nop = 0x0,\r\n  DW_CFA_offset_extended = 0x5,\r\n  DW_CFA_def_cfa = 0xc,\r\n  DW_CFA_def_cfa_offset = 0xe,\r\n  DW_CFA_offset_extended_sf = 0x11,\r\n  DW_CFA_advance_loc = 0x40,\r\n  DW_CFA_offset = 0x80\r\n};\r\n\r\nenum {\r\n  DW_EH_PE_udata4 = 3,\r\n  DW_EH_PE_textrel = 0x20\r\n};\r\n\r\nenum {\r\n  DW_TAG_compile_unit = 0x11\r\n};\r\n\r\nenum {\r\n  DW_children_no = 0,\r\n  DW_children_yes = 1\r\n};\r\n\r\nenum {\r\n  DW_AT_name = 0x03,\r\n  DW_AT_stmt_list = 0x10,\r\n  DW_AT_low_pc = 0x11,\r\n  DW_AT_high_pc = 0x12\r\n};\r\n\r\nenum {\r\n  DW_FORM_addr = 0x01,\r\n  DW_FORM_data4 = 0x06,\r\n  DW_FORM_string = 0x08\r\n};\r\n\r\nenum {\r\n  DW_LNS_extended_op = 0,\r\n  DW_LNS_copy = 1,\r\n  DW_LNS_advance_pc = 2,\r\n  DW_LNS_advance_line = 3\r\n};\r\n\r\nenum {\r\n  DW_LNE_end_sequence = 1,\r\n  DW_LNE_set_address = 2\r\n};\r\n\r\nenum {\r\n#if LJ_TARGET_X86\r\n  DW_REG_AX, DW_REG_CX, DW_REG_DX, DW_REG_BX,\r\n  DW_REG_SP, DW_REG_BP, DW_REG_SI, DW_REG_DI,\r\n  DW_REG_RA,\r\n#elif LJ_TARGET_X64\r\n  /* Yes, the order is strange, but correct. */\r\n  DW_REG_AX, DW_REG_DX, DW_REG_CX, DW_REG_BX,\r\n  DW_REG_SI, DW_REG_DI, DW_REG_BP, DW_REG_SP,\r\n  DW_REG_8, DW_REG_9, DW_REG_10, DW_REG_11,\r\n  DW_REG_12, DW_REG_13, DW_REG_14, DW_REG_15,\r\n  DW_REG_RA,\r\n#elif LJ_TARGET_ARM\r\n  DW_REG_SP = 13,\r\n  DW_REG_RA = 14,\r\n#elif LJ_TARGET_PPC\r\n  DW_REG_SP = 1,\r\n  DW_REG_RA = 65,\r\n  DW_REG_CR = 70,\r\n#elif LJ_TARGET_MIPS\r\n  DW_REG_SP = 29,\r\n  DW_REG_RA = 31,\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n};\r\n\r\n/* Minimal list of sections for the in-memory ELF object. */\r\nenum {\r\n  GDBJIT_SECT_NULL,\r\n  GDBJIT_SECT_text,\r\n  GDBJIT_SECT_eh_frame,\r\n  GDBJIT_SECT_shstrtab,\r\n  GDBJIT_SECT_strtab,\r\n  GDBJIT_SECT_symtab,\r\n  GDBJIT_SECT_debug_info,\r\n  GDBJIT_SECT_debug_abbrev,\r\n  GDBJIT_SECT_debug_line,\r\n  GDBJIT_SECT__MAX\r\n};\r\n\r\nenum {\r\n  GDBJIT_SYM_UNDEF,\r\n  GDBJIT_SYM_FILE,\r\n  GDBJIT_SYM_FUNC,\r\n  GDBJIT_SYM__MAX\r\n};\r\n\r\n/* In-memory ELF object. */\r\ntypedef struct GDBJITobj {\r\n  ELFheader hdr;\t\t\t/* ELF header. */\r\n  ELFsectheader sect[GDBJIT_SECT__MAX];\t/* ELF sections. */\r\n  ELFsymbol sym[GDBJIT_SYM__MAX];\t/* ELF symbol table. */\r\n  uint8_t space[4096];\t\t\t/* Space for various section data. */\r\n} GDBJITobj;\r\n\r\n/* Combined structure for GDB JIT entry and ELF object. */\r\ntypedef struct GDBJITentryobj {\r\n  GDBJITentry entry;\r\n  size_t sz;\r\n  GDBJITobj obj;\r\n} GDBJITentryobj;\r\n\r\n/* Template for in-memory ELF header. */\r\nstatic const ELFheader elfhdr_template = {\r\n  .emagic = { 0x7f, 'E', 'L', 'F' },\r\n  .eclass = LJ_64 ? 2 : 1,\r\n  .eendian = LJ_ENDIAN_SELECT(1, 2),\r\n  .eversion = 1,\r\n#if LJ_TARGET_LINUX\r\n  .eosabi = 0,  /* Nope, it's not 3. */\r\n#elif defined(__FreeBSD__)\r\n  .eosabi = 9,\r\n#elif defined(__NetBSD__)\r\n  .eosabi = 2,\r\n#elif defined(__OpenBSD__)\r\n  .eosabi = 12,\r\n#elif defined(__DragonFly__)\r\n  .eosabi = 0,\r\n#elif (defined(__sun__) && defined(__svr4__))\r\n  .eosabi = 6,\r\n#else\r\n  .eosabi = 0,\r\n#endif\r\n  .eabiversion = 0,\r\n  .epad = { 0, 0, 0, 0, 0, 0, 0 },\r\n  .type = 1,\r\n#if LJ_TARGET_X86\r\n  .machine = 3,\r\n#elif LJ_TARGET_X64\r\n  .machine = 62,\r\n#elif LJ_TARGET_ARM\r\n  .machine = 40,\r\n#elif LJ_TARGET_PPC\r\n  .machine = 20,\r\n#elif LJ_TARGET_MIPS\r\n  .machine = 8,\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n  .version = 1,\r\n  .entry = 0,\r\n  .phofs = 0,\r\n  .shofs = offsetof(GDBJITobj, sect),\r\n  .flags = 0,\r\n  .ehsize = sizeof(ELFheader),\r\n  .phentsize = 0,\r\n  .phnum = 0,\r\n  .shentsize = sizeof(ELFsectheader),\r\n  .shnum = GDBJIT_SECT__MAX,\r\n  .shstridx = GDBJIT_SECT_shstrtab\r\n};\r\n\r\n/* -- In-memory ELF object generation ------------------------------------- */\r\n\r\n/* Context for generating the ELF object for the GDB JIT API. */\r\ntypedef struct GDBJITctx {\r\n  uint8_t *p;\t\t/* Pointer to next address in obj.space. */\r\n  uint8_t *startp;\t/* Pointer to start address in obj.space. */\r\n  GCtrace *T;\t\t/* Generate symbols for this trace. */\r\n  uintptr_t mcaddr;\t/* Machine code address. */\r\n  MSize szmcode;\t/* Size of machine code. */\r\n  MSize spadjp;\t\t/* Stack adjustment for parent trace or interpreter. */\r\n  MSize spadj;\t\t/* Stack adjustment for trace itself. */\r\n  BCLine lineno;\t/* Starting line number. */\r\n  const char *filename;\t/* Starting file name. */\r\n  size_t objsize;\t/* Final size of ELF object. */\r\n  GDBJITobj obj;\t/* In-memory ELF object. */\r\n} GDBJITctx;\r\n\r\n/* Add a zero-terminated string. */\r\nstatic uint32_t gdbjit_strz(GDBJITctx *ctx, const char *str)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  uint32_t ofs = (uint32_t)(p - ctx->startp);\r\n  do {\r\n    *p++ = (uint8_t)*str;\r\n  } while (*str++);\r\n  ctx->p = p;\r\n  return ofs;\r\n}\r\n\r\n/* Append a decimal number. */\r\nstatic void gdbjit_catnum(GDBJITctx *ctx, uint32_t n)\r\n{\r\n  if (n >= 10) { uint32_t m = n / 10; n = n % 10; gdbjit_catnum(ctx, m); }\r\n  *ctx->p++ = '0' + n;\r\n}\r\n\r\n/* Add a ULEB128 value. */\r\nstatic void gdbjit_uleb128(GDBJITctx *ctx, uint32_t v)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  for (; v >= 0x80; v >>= 7)\r\n    *p++ = (uint8_t)((v & 0x7f) | 0x80);\r\n  *p++ = (uint8_t)v;\r\n  ctx->p = p;\r\n}\r\n\r\n/* Add a SLEB128 value. */\r\nstatic void gdbjit_sleb128(GDBJITctx *ctx, int32_t v)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  for (; (uint32_t)(v+0x40) >= 0x80; v >>= 7)\r\n    *p++ = (uint8_t)((v & 0x7f) | 0x80);\r\n  *p++ = (uint8_t)(v & 0x7f);\r\n  ctx->p = p;\r\n}\r\n\r\n/* Shortcuts to generate DWARF structures. */\r\n#define DB(x)\t\t(*p++ = (x))\r\n#define DI8(x)\t\t(*(int8_t *)p = (x), p++)\r\n#define DU16(x)\t\t(*(uint16_t *)p = (x), p += 2)\r\n#define DU32(x)\t\t(*(uint32_t *)p = (x), p += 4)\r\n#define DADDR(x)\t(*(uintptr_t *)p = (x), p += sizeof(uintptr_t))\r\n#define DUV(x)\t\t(ctx->p = p, gdbjit_uleb128(ctx, (x)), p = ctx->p)\r\n#define DSV(x)\t\t(ctx->p = p, gdbjit_sleb128(ctx, (x)), p = ctx->p)\r\n#define DSTR(str)\t(ctx->p = p, gdbjit_strz(ctx, (str)), p = ctx->p)\r\n#define DALIGNNOP(s)\twhile ((uintptr_t)p & ((s)-1)) *p++ = DW_CFA_nop\r\n#define DSECT(name, stmt) \\\r\n  { uint32_t *szp_##name = (uint32_t *)p; p += 4; stmt \\\r\n    *szp_##name = (uint32_t)((p-(uint8_t *)szp_##name)-4); } \\\r\n\r\n/* Initialize ELF section headers. */\r\nstatic void LJ_FASTCALL gdbjit_secthdr(GDBJITctx *ctx)\r\n{\r\n  ELFsectheader *sect;\r\n\r\n  *ctx->p++ = '\\0';  /* Empty string at start of string table. */\r\n\r\n#define SECTDEF(id, tp, al) \\\r\n  sect = &ctx->obj.sect[GDBJIT_SECT_##id]; \\\r\n  sect->name = gdbjit_strz(ctx, \".\" #id); \\\r\n  sect->type = ELFSECT_TYPE_##tp; \\\r\n  sect->align = (al)\r\n\r\n  SECTDEF(text, NOBITS, 16);\r\n  sect->flags = ELFSECT_FLAGS_ALLOC|ELFSECT_FLAGS_EXEC;\r\n  sect->addr = ctx->mcaddr;\r\n  sect->ofs = 0;\r\n  sect->size = ctx->szmcode;\r\n\r\n  SECTDEF(eh_frame, PROGBITS, sizeof(uintptr_t));\r\n  sect->flags = ELFSECT_FLAGS_ALLOC;\r\n\r\n  SECTDEF(shstrtab, STRTAB, 1);\r\n  SECTDEF(strtab, STRTAB, 1);\r\n\r\n  SECTDEF(symtab, SYMTAB, sizeof(uintptr_t));\r\n  sect->ofs = offsetof(GDBJITobj, sym);\r\n  sect->size = sizeof(ctx->obj.sym);\r\n  sect->link = GDBJIT_SECT_strtab;\r\n  sect->entsize = sizeof(ELFsymbol);\r\n  sect->info = GDBJIT_SYM_FUNC;\r\n\r\n  SECTDEF(debug_info, PROGBITS, 1);\r\n  SECTDEF(debug_abbrev, PROGBITS, 1);\r\n  SECTDEF(debug_line, PROGBITS, 1);\r\n\r\n#undef SECTDEF\r\n}\r\n\r\n/* Initialize symbol table. */\r\nstatic void LJ_FASTCALL gdbjit_symtab(GDBJITctx *ctx)\r\n{\r\n  ELFsymbol *sym;\r\n\r\n  *ctx->p++ = '\\0';  /* Empty string at start of string table. */\r\n\r\n  sym = &ctx->obj.sym[GDBJIT_SYM_FILE];\r\n  sym->name = gdbjit_strz(ctx, \"JIT mcode\");\r\n  sym->sectidx = ELFSECT_IDX_ABS;\r\n  sym->info = ELFSYM_TYPE_FILE|ELFSYM_BIND_LOCAL;\r\n\r\n  sym = &ctx->obj.sym[GDBJIT_SYM_FUNC];\r\n  sym->name = gdbjit_strz(ctx, \"TRACE_\"); ctx->p--;\r\n  gdbjit_catnum(ctx, ctx->T->traceno); *ctx->p++ = '\\0';\r\n  sym->sectidx = GDBJIT_SECT_text;\r\n  sym->value = 0;\r\n  sym->size = ctx->szmcode;\r\n  sym->info = ELFSYM_TYPE_FUNC|ELFSYM_BIND_GLOBAL;\r\n}\r\n\r\n/* Initialize .eh_frame section. */\r\nstatic void LJ_FASTCALL gdbjit_ehframe(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  uint8_t *framep = p;\r\n\r\n  /* Emit DWARF EH CIE. */\r\n  DSECT(CIE,\r\n    DU32(0);\t\t\t/* Offset to CIE itself. */\r\n    DB(DW_CIE_VERSION);\r\n    DSTR(\"zR\");\t\t\t/* Augmentation. */\r\n    DUV(1);\t\t\t/* Code alignment factor. */\r\n    DSV(-(int32_t)sizeof(uintptr_t));  /* Data alignment factor. */\r\n    DB(DW_REG_RA);\t\t/* Return address register. */\r\n    DB(1); DB(DW_EH_PE_textrel|DW_EH_PE_udata4);  /* Augmentation data. */\r\n    DB(DW_CFA_def_cfa); DUV(DW_REG_SP); DUV(sizeof(uintptr_t));\r\n#if LJ_TARGET_PPC\r\n    DB(DW_CFA_offset_extended_sf); DB(DW_REG_RA); DSV(-1);\r\n#else\r\n    DB(DW_CFA_offset|DW_REG_RA); DUV(1);\r\n#endif\r\n    DALIGNNOP(sizeof(uintptr_t));\r\n  )\r\n\r\n  /* Emit DWARF EH FDE. */\r\n  DSECT(FDE,\r\n    DU32((uint32_t)(p-framep));\t/* Offset to CIE. */\r\n    DU32(0);\t\t\t/* Machine code offset relative to .text. */\r\n    DU32(ctx->szmcode);\t\t/* Machine code length. */\r\n    DB(0);\t\t\t/* Augmentation data. */\r\n    /* Registers saved in CFRAME. */\r\n#if LJ_TARGET_X86\r\n    DB(DW_CFA_offset|DW_REG_BP); DUV(2);\r\n    DB(DW_CFA_offset|DW_REG_DI); DUV(3);\r\n    DB(DW_CFA_offset|DW_REG_SI); DUV(4);\r\n    DB(DW_CFA_offset|DW_REG_BX); DUV(5);\r\n#elif LJ_TARGET_X64\r\n    DB(DW_CFA_offset|DW_REG_BP); DUV(2);\r\n    DB(DW_CFA_offset|DW_REG_BX); DUV(3);\r\n    DB(DW_CFA_offset|DW_REG_15); DUV(4);\r\n    DB(DW_CFA_offset|DW_REG_14); DUV(5);\r\n    /* Extra registers saved for JIT-compiled code. */\r\n    DB(DW_CFA_offset|DW_REG_13); DUV(9);\r\n    DB(DW_CFA_offset|DW_REG_12); DUV(10);\r\n#elif LJ_TARGET_ARM\r\n    {\r\n      int i;\r\n      for (i = 11; i >= 4; i--) { DB(DW_CFA_offset|i); DUV(2+(11-i)); }\r\n    }\r\n#elif LJ_TARGET_PPC\r\n    {\r\n      int i;\r\n      DB(DW_CFA_offset_extended); DB(DW_REG_CR); DUV(55);\r\n      for (i = 14; i <= 31; i++) {\r\n\tDB(DW_CFA_offset|i); DUV(37+(31-i));\r\n\tDB(DW_CFA_offset|32|i); DUV(2+2*(31-i));\r\n      }\r\n    }\r\n#elif LJ_TARGET_MIPS\r\n    {\r\n      int i;\r\n      DB(DW_CFA_offset|30); DUV(2);\r\n      for (i = 23; i >= 16; i--) { DB(DW_CFA_offset|i); DUV(26-i); }\r\n      for (i = 30; i >= 20; i -= 2) { DB(DW_CFA_offset|32|i); DUV(42-i); }\r\n    }\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n    if (ctx->spadjp != ctx->spadj) {  /* Parent/interpreter stack frame size. */\r\n      DB(DW_CFA_def_cfa_offset); DUV(ctx->spadjp);\r\n      DB(DW_CFA_advance_loc|1);  /* Only an approximation. */\r\n    }\r\n    DB(DW_CFA_def_cfa_offset); DUV(ctx->spadj);  /* Trace stack frame size. */\r\n    DALIGNNOP(sizeof(uintptr_t));\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n/* Initialize .debug_info section. */\r\nstatic void LJ_FASTCALL gdbjit_debuginfo(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  DSECT(info,\r\n    DU16(2);\t\t\t/* DWARF version. */\r\n    DU32(0);\t\t\t/* Abbrev offset. */\r\n    DB(sizeof(uintptr_t));\t/* Pointer size. */\r\n\r\n    DUV(1);\t\t\t/* Abbrev #1: DW_TAG_compile_unit. */\r\n    DSTR(ctx->filename);\t/* DW_AT_name. */\r\n    DADDR(ctx->mcaddr);\t\t/* DW_AT_low_pc. */\r\n    DADDR(ctx->mcaddr + ctx->szmcode);  /* DW_AT_high_pc. */\r\n    DU32(0);\t\t\t/* DW_AT_stmt_list. */\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n/* Initialize .debug_abbrev section. */\r\nstatic void LJ_FASTCALL gdbjit_debugabbrev(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  /* Abbrev #1: DW_TAG_compile_unit. */\r\n  DUV(1); DUV(DW_TAG_compile_unit);\r\n  DB(DW_children_no);\r\n  DUV(DW_AT_name);\tDUV(DW_FORM_string);\r\n  DUV(DW_AT_low_pc);\tDUV(DW_FORM_addr);\r\n  DUV(DW_AT_high_pc);\tDUV(DW_FORM_addr);\r\n  DUV(DW_AT_stmt_list);\tDUV(DW_FORM_data4);\r\n  DB(0); DB(0);\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n#define DLNE(op, s)\t(DB(DW_LNS_extended_op), DUV(1+(s)), DB((op)))\r\n\r\n/* Initialize .debug_line section. */\r\nstatic void LJ_FASTCALL gdbjit_debugline(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  DSECT(line,\r\n    DU16(2);\t\t\t/* DWARF version. */\r\n    DSECT(header,\r\n      DB(1);\t\t\t/* Minimum instruction length. */\r\n      DB(1);\t\t\t/* is_stmt. */\r\n      DI8(0);\t\t\t/* Line base for special opcodes. */\r\n      DB(2);\t\t\t/* Line range for special opcodes. */\r\n      DB(3+1);\t\t\t/* Opcode base at DW_LNS_advance_line+1. */\r\n      DB(0); DB(1); DB(1);\t/* Standard opcode lengths. */\r\n      /* Directory table. */\r\n      DB(0);\r\n      /* File name table. */\r\n      DSTR(ctx->filename); DUV(0); DUV(0); DUV(0);\r\n      DB(0);\r\n    )\r\n\r\n    DLNE(DW_LNE_set_address, sizeof(uintptr_t)); DADDR(ctx->mcaddr);\r\n    if (ctx->lineno) {\r\n      DB(DW_LNS_advance_line); DSV(ctx->lineno-1);\r\n    }\r\n    DB(DW_LNS_copy);\r\n    DB(DW_LNS_advance_pc); DUV(ctx->szmcode);\r\n    DLNE(DW_LNE_end_sequence, 0);\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n#undef DLNE\r\n\r\n/* Undef shortcuts. */\r\n#undef DB\r\n#undef DI8\r\n#undef DU16\r\n#undef DU32\r\n#undef DADDR\r\n#undef DUV\r\n#undef DSV\r\n#undef DSTR\r\n#undef DALIGNNOP\r\n#undef DSECT\r\n\r\n/* Type of a section initializer callback. */\r\ntypedef void (LJ_FASTCALL *GDBJITinitf)(GDBJITctx *ctx);\r\n\r\n/* Call section initializer and set the section offset and size. */\r\nstatic void gdbjit_initsect(GDBJITctx *ctx, int sect, GDBJITinitf initf)\r\n{\r\n  ctx->startp = ctx->p;\r\n  ctx->obj.sect[sect].ofs = (uintptr_t)((char *)ctx->p - (char *)&ctx->obj);\r\n  initf(ctx);\r\n  ctx->obj.sect[sect].size = (uintptr_t)(ctx->p - ctx->startp);\r\n}\r\n\r\n#define SECTALIGN(p, a) \\\r\n  ((p) = (uint8_t *)(((uintptr_t)(p) + ((a)-1)) & ~(uintptr_t)((a)-1)))\r\n\r\n/* Build in-memory ELF object. */\r\nstatic void gdbjit_buildobj(GDBJITctx *ctx)\r\n{\r\n  GDBJITobj *obj = &ctx->obj;\r\n  /* Fill in ELF header and clear structures. */\r\n  memcpy(&obj->hdr, &elfhdr_template, sizeof(ELFheader));\r\n  memset(&obj->sect, 0, sizeof(ELFsectheader)*GDBJIT_SECT__MAX);\r\n  memset(&obj->sym, 0, sizeof(ELFsymbol)*GDBJIT_SYM__MAX);\r\n  /* Initialize sections. */\r\n  ctx->p = obj->space;\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_shstrtab, gdbjit_secthdr);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_strtab, gdbjit_symtab);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_info, gdbjit_debuginfo);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_abbrev, gdbjit_debugabbrev);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_line, gdbjit_debugline);\r\n  SECTALIGN(ctx->p, sizeof(uintptr_t));\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_eh_frame, gdbjit_ehframe);\r\n  ctx->objsize = (size_t)((char *)ctx->p - (char *)obj);\r\n  lua_assert(ctx->objsize < sizeof(GDBJITobj));\r\n}\r\n\r\n#undef SECTALIGN\r\n\r\n/* -- Interface to GDB JIT API -------------------------------------------- */\r\n\r\n/* Add new entry to GDB JIT symbol chain. */\r\nstatic void gdbjit_newentry(lua_State *L, GDBJITctx *ctx)\r\n{\r\n  /* Allocate memory for GDB JIT entry and ELF object. */\r\n  MSize sz = (MSize)(sizeof(GDBJITentryobj) - sizeof(GDBJITobj) + ctx->objsize);\r\n  GDBJITentryobj *eo = lj_mem_newt(L, sz, GDBJITentryobj);\r\n  memcpy(&eo->obj, &ctx->obj, ctx->objsize);  /* Copy ELF object. */\r\n  eo->sz = sz;\r\n  ctx->T->gdbjit_entry = (void *)eo;\r\n  /* Link new entry to chain and register it. */\r\n  eo->entry.prev_entry = NULL;\r\n  eo->entry.next_entry = __jit_debug_descriptor.first_entry;\r\n  if (eo->entry.next_entry)\r\n    eo->entry.next_entry->prev_entry = &eo->entry;\r\n  eo->entry.symfile_addr = (const char *)&eo->obj;\r\n  eo->entry.symfile_size = ctx->objsize;\r\n  __jit_debug_descriptor.first_entry = &eo->entry;\r\n  __jit_debug_descriptor.relevant_entry = &eo->entry;\r\n  __jit_debug_descriptor.action_flag = GDBJIT_REGISTER;\r\n  __jit_debug_register_code();\r\n}\r\n\r\n/* Add debug info for newly compiled trace and notify GDB. */\r\nvoid lj_gdbjit_addtrace(jit_State *J, GCtrace *T)\r\n{\r\n  GDBJITctx ctx;\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  TraceNo parent = T->ir[REF_BASE].op1;\r\n  const BCIns *startpc = mref(T->startpc, const BCIns);\r\n  ctx.T = T;\r\n  ctx.mcaddr = (uintptr_t)T->mcode;\r\n  ctx.szmcode = T->szmcode;\r\n  ctx.spadjp = CFRAME_SIZE_JIT +\r\n\t       (MSize)(parent ? traceref(J, parent)->spadjust : 0);\r\n  ctx.spadj = CFRAME_SIZE_JIT + T->spadjust;\r\n  lua_assert(startpc >= proto_bc(pt) && startpc < proto_bc(pt) + pt->sizebc);\r\n  ctx.lineno = lj_debug_line(pt, proto_bcpos(pt, startpc));\r\n  ctx.filename = proto_chunknamestr(pt);\r\n  if (*ctx.filename == '@' || *ctx.filename == '=')\r\n    ctx.filename++;\r\n  else\r\n    ctx.filename = \"(string)\";\r\n  gdbjit_buildobj(&ctx);\r\n  gdbjit_newentry(J->L, &ctx);\r\n}\r\n\r\n/* Delete debug info for trace and notify GDB. */\r\nvoid lj_gdbjit_deltrace(jit_State *J, GCtrace *T)\r\n{\r\n  GDBJITentryobj *eo = (GDBJITentryobj *)T->gdbjit_entry;\r\n  if (eo) {\r\n    if (eo->entry.prev_entry)\r\n      eo->entry.prev_entry->next_entry = eo->entry.next_entry;\r\n    else\r\n      __jit_debug_descriptor.first_entry = eo->entry.next_entry;\r\n    if (eo->entry.next_entry)\r\n      eo->entry.next_entry->prev_entry = eo->entry.prev_entry;\r\n    __jit_debug_descriptor.relevant_entry = &eo->entry;\r\n    __jit_debug_descriptor.action_flag = GDBJIT_UNREGISTER;\r\n    __jit_debug_register_code();\r\n    lj_mem_free(J2G(J), eo, eo->sz);\r\n  }\r\n}\r\n\r\n#endif\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_gdbjit.h",
    "content": "/*\r\n** Client for the GDB JIT API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_GDBJIT_H\r\n#define _LJ_GDBJIT_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT && defined(LUAJIT_USE_GDBJIT)\r\n\r\nLJ_FUNC void lj_gdbjit_addtrace(jit_State *J, GCtrace *T);\r\nLJ_FUNC void lj_gdbjit_deltrace(jit_State *J, GCtrace *T);\r\n\r\n#else\r\n#define lj_gdbjit_addtrace(J, T)\tUNUSED(T)\r\n#define lj_gdbjit_deltrace(J, T)\tUNUSED(T)\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ir.c",
    "content": "/*\r\n** SSA IR (Intermediate Representation) emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ir_c\r\n#define LUA_CORE\r\n\r\n/* For pointers to libc/libm functions. */\r\n#include <stdio.h>\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_carith.h\"\r\n#endif\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t\t(&J->fold.ins)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)        (lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* -- IR tables ----------------------------------------------------------- */\r\n\r\n/* IR instruction modes. */\r\nLJ_DATADEF const uint8_t lj_ir_mode[IR__MAX+1] = {\r\nIRDEF(IRMODE)\r\n  0\r\n};\r\n\r\n/* IR type sizes. */\r\nLJ_DATADEF const uint8_t lj_ir_type_size[IRT__MAX+1] = {\r\n#define IRTSIZE(name, size)\tsize,\r\nIRTDEF(IRTSIZE)\r\n#undef IRTSIZE\r\n  0\r\n};\r\n\r\n/* C call info for CALL* instructions. */\r\nLJ_DATADEF const CCallInfo lj_ir_callinfo[] = {\r\n#define IRCALLCI(cond, name, nargs, kind, type, flags) \\\r\n  { (ASMFunction)IRCALLCOND_##cond(name), \\\r\n    (nargs)|(CCI_CALL_##kind)|(IRT_##type<<CCI_OTSHIFT)|(flags) },\r\nIRCALLDEF(IRCALLCI)\r\n#undef IRCALLCI\r\n  { NULL, 0 }\r\n};\r\n\r\n/* -- IR emitter ---------------------------------------------------------- */\r\n\r\n/* Grow IR buffer at the top. */\r\nvoid LJ_FASTCALL lj_ir_growtop(jit_State *J)\r\n{\r\n  IRIns *baseir = J->irbuf + J->irbotlim;\r\n  MSize szins = J->irtoplim - J->irbotlim;\r\n  if (szins) {\r\n    baseir = (IRIns *)lj_mem_realloc(J->L, baseir, szins*sizeof(IRIns),\r\n\t\t\t\t     2*szins*sizeof(IRIns));\r\n    J->irtoplim = J->irbotlim + 2*szins;\r\n  } else {\r\n    baseir = (IRIns *)lj_mem_realloc(J->L, NULL, 0, LJ_MIN_IRSZ*sizeof(IRIns));\r\n    J->irbotlim = REF_BASE - LJ_MIN_IRSZ/4;\r\n    J->irtoplim = J->irbotlim + LJ_MIN_IRSZ;\r\n  }\r\n  J->cur.ir = J->irbuf = baseir - J->irbotlim;\r\n}\r\n\r\n/* Grow IR buffer at the bottom or shift it up. */\r\nstatic void lj_ir_growbot(jit_State *J)\r\n{\r\n  IRIns *baseir = J->irbuf + J->irbotlim;\r\n  MSize szins = J->irtoplim - J->irbotlim;\r\n  lua_assert(szins != 0);\r\n  lua_assert(J->cur.nk == J->irbotlim);\r\n  if (J->cur.nins + (szins >> 1) < J->irtoplim) {\r\n    /* More than half of the buffer is free on top: shift up by a quarter. */\r\n    MSize ofs = szins >> 2;\r\n    memmove(baseir + ofs, baseir, (J->cur.nins - J->irbotlim)*sizeof(IRIns));\r\n    J->irbotlim -= ofs;\r\n    J->irtoplim -= ofs;\r\n    J->cur.ir = J->irbuf = baseir - J->irbotlim;\r\n  } else {\r\n    /* Double the buffer size, but split the growth amongst top/bottom. */\r\n    IRIns *newbase = lj_mem_newt(J->L, 2*szins*sizeof(IRIns), IRIns);\r\n    MSize ofs = szins >= 256 ? 128 : (szins >> 1);  /* Limit bottom growth. */\r\n    memcpy(newbase + ofs, baseir, (J->cur.nins - J->irbotlim)*sizeof(IRIns));\r\n    lj_mem_free(G(J->L), baseir, szins*sizeof(IRIns));\r\n    J->irbotlim -= ofs;\r\n    J->irtoplim = J->irbotlim + 2*szins;\r\n    J->cur.ir = J->irbuf = newbase - J->irbotlim;\r\n  }\r\n}\r\n\r\n/* Emit IR without any optimizations. */\r\nTRef LJ_FASTCALL lj_ir_emit(jit_State *J)\r\n{\r\n  IRRef ref = lj_ir_nextins(J);\r\n  IRIns *ir = IR(ref);\r\n  IROp op = fins->o;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\n  ir->o = op;\r\n  ir->op1 = fins->op1;\r\n  ir->op2 = fins->op2;\r\n  J->guardemit.irt |= fins->t.irt;\r\n  return TREF(ref, irt_t((ir->t = fins->t)));\r\n}\r\n\r\n/* Emit call to a C function. */\r\nTRef lj_ir_call(jit_State *J, IRCallID id, ...)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  uint32_t n = CCI_NARGS(ci);\r\n  TRef tr = TREF_NIL;\r\n  va_list argp;\r\n  va_start(argp, id);\r\n  if ((ci->flags & CCI_L)) n--;\r\n  if (n > 0)\r\n    tr = va_arg(argp, IRRef);\r\n  while (n-- > 1)\r\n    tr = emitir(IRT(IR_CARG, IRT_NIL), tr, va_arg(argp, IRRef));\r\n  va_end(argp);\r\n  if (CCI_OP(ci) == IR_CALLS)\r\n    J->needsnap = 1;  /* Need snapshot after call with side effect. */\r\n  return emitir(CCI_OPTYPE(ci), tr, id);\r\n}\r\n\r\n/* -- Interning of constants ---------------------------------------------- */\r\n\r\n/*\r\n** IR instructions for constants are kept between J->cur.nk >= ref < REF_BIAS.\r\n** They are chained like all other instructions, but grow downwards.\r\n** The are interned (like strings in the VM) to facilitate reference\r\n** comparisons. The same constant must get the same reference.\r\n*/\r\n\r\n/* Get ref of next IR constant and optionally grow IR.\r\n** Note: this may invalidate all IRIns *!\r\n*/\r\nstatic LJ_AINLINE IRRef ir_nextk(jit_State *J)\r\n{\r\n  IRRef ref = J->cur.nk;\r\n  if (LJ_UNLIKELY(ref <= J->irbotlim)) lj_ir_growbot(J);\r\n  J->cur.nk = --ref;\r\n  return ref;\r\n}\r\n\r\n/* Intern int32_t constant. */\r\nTRef LJ_FASTCALL lj_ir_kint(jit_State *J, int32_t k)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  for (ref = J->chain[IR_KINT]; ref; ref = cir[ref].prev)\r\n    if (cir[ref].i == k)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->i = k;\r\n  ir->t.irt = IRT_INT;\r\n  ir->o = IR_KINT;\r\n  ir->prev = J->chain[IR_KINT];\r\n  J->chain[IR_KINT] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_INT);\r\n}\r\n\r\n/* The MRef inside the KNUM/KINT64 IR instructions holds the address of the\r\n** 64 bit constant. The constants themselves are stored in a chained array\r\n** and shared across traces.\r\n**\r\n** Rationale for choosing this data structure:\r\n** - The address of the constants is embedded in the generated machine code\r\n**   and must never move. A resizable array or hash table wouldn't work.\r\n** - Most apps need very few non-32 bit integer constants (less than a dozen).\r\n** - Linear search is hard to beat in terms of speed and low complexity.\r\n*/\r\ntypedef struct K64Array {\r\n  MRef next;\t\t\t/* Pointer to next list. */\r\n  MSize numk;\t\t\t/* Number of used elements in this array. */\r\n  TValue k[LJ_MIN_K64SZ];\t/* Array of constants. */\r\n} K64Array;\r\n\r\n/* Free all chained arrays. */\r\nvoid lj_ir_k64_freeall(jit_State *J)\r\n{\r\n  K64Array *k;\r\n  for (k = mref(J->k64, K64Array); k; ) {\r\n    K64Array *next = mref(k->next, K64Array);\r\n    lj_mem_free(J2G(J), k, sizeof(K64Array));\r\n    k = next;\r\n  }\r\n}\r\n\r\n/* Find 64 bit constant in chained array or add it. */\r\ncTValue *lj_ir_k64_find(jit_State *J, uint64_t u64)\r\n{\r\n  K64Array *k, *kp = NULL;\r\n  TValue *ntv;\r\n  MSize idx;\r\n  /* Search for the constant in the whole chain of arrays. */\r\n  for (k = mref(J->k64, K64Array); k; k = mref(k->next, K64Array)) {\r\n    kp = k;  /* Remember previous element in list. */\r\n    for (idx = 0; idx < k->numk; idx++) {  /* Search one array. */\r\n      TValue *tv = &k->k[idx];\r\n      if (tv->u64 == u64)  /* Needed for +-0/NaN/absmask. */\r\n\treturn tv;\r\n    }\r\n  }\r\n  /* Constant was not found, need to add it. */\r\n  if (!(kp && kp->numk < LJ_MIN_K64SZ)) {  /* Allocate a new array. */\r\n    K64Array *kn = lj_mem_newt(J->L, sizeof(K64Array), K64Array);\r\n    setmref(kn->next, NULL);\r\n    kn->numk = 0;\r\n    if (kp)\r\n      setmref(kp->next, kn);  /* Chain to the end of the list. */\r\n    else\r\n      setmref(J->k64, kn);  /* Link first array. */\r\n    kp = kn;\r\n  }\r\n  ntv = &kp->k[kp->numk++];  /* Add to current array. */\r\n  ntv->u64 = u64;\r\n  return ntv;\r\n}\r\n\r\n/* Intern 64 bit constant, given by its address. */\r\nTRef lj_ir_k64(jit_State *J, IROp op, cTValue *tv)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  IRType t = op == IR_KNUM ? IRT_NUM : IRT_I64;\r\n  for (ref = J->chain[op]; ref; ref = cir[ref].prev)\r\n    if (ir_k64(&cir[ref]) == tv)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  lua_assert(checkptr32(tv));\r\n  setmref(ir->ptr, tv);\r\n  ir->t.irt = t;\r\n  ir->o = op;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern FP constant, given by its 64 bit pattern. */\r\nTRef lj_ir_knum_u64(jit_State *J, uint64_t u64)\r\n{\r\n  return lj_ir_k64(J, IR_KNUM, lj_ir_k64_find(J, u64));\r\n}\r\n\r\n/* Intern 64 bit integer constant. */\r\nTRef lj_ir_kint64(jit_State *J, uint64_t u64)\r\n{\r\n  return lj_ir_k64(J, IR_KINT64, lj_ir_k64_find(J, u64));\r\n}\r\n\r\n/* Check whether a number is int and return it. -0 is NOT considered an int. */\r\nstatic int numistrueint(lua_Number n, int32_t *kp)\r\n{\r\n  int32_t k = lj_num2int(n);\r\n  if (n == (lua_Number)k) {\r\n    if (kp) *kp = k;\r\n    if (k == 0) {  /* Special check for -0. */\r\n      TValue tv;\r\n      setnumV(&tv, n);\r\n      if (tv.u32.hi != 0)\r\n\treturn 0;\r\n    }\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Intern number as int32_t constant if possible, otherwise as FP constant. */\r\nTRef lj_ir_knumint(jit_State *J, lua_Number n)\r\n{\r\n  int32_t k;\r\n  if (numistrueint(n, &k))\r\n    return lj_ir_kint(J, k);\r\n  else\r\n    return lj_ir_knum(J, n);\r\n}\r\n\r\n/* Intern GC object \"constant\". */\r\nTRef lj_ir_kgc(jit_State *J, GCobj *o, IRType t)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  lua_assert(!isdead(J2G(J), o));\r\n  for (ref = J->chain[IR_KGC]; ref; ref = cir[ref].prev)\r\n    if (ir_kgc(&cir[ref]) == o)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  /* NOBARRIER: Current trace is a GC root. */\r\n  setgcref(ir->gcr, o);\r\n  ir->t.irt = (uint8_t)t;\r\n  ir->o = IR_KGC;\r\n  ir->prev = J->chain[IR_KGC];\r\n  J->chain[IR_KGC] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern 32 bit pointer constant. */\r\nTRef lj_ir_kptr_(jit_State *J, IROp op, void *ptr)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  lua_assert((void *)(intptr_t)i32ptr(ptr) == ptr);\r\n  for (ref = J->chain[op]; ref; ref = cir[ref].prev)\r\n    if (mref(cir[ref].ptr, void) == ptr)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  setmref(ir->ptr, ptr);\r\n  ir->t.irt = IRT_P32;\r\n  ir->o = op;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_P32);\r\n}\r\n\r\n/* Intern typed NULL constant. */\r\nTRef lj_ir_knull(jit_State *J, IRType t)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  for (ref = J->chain[IR_KNULL]; ref; ref = cir[ref].prev)\r\n    if (irt_t(cir[ref].t) == t)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->i = 0;\r\n  ir->t.irt = (uint8_t)t;\r\n  ir->o = IR_KNULL;\r\n  ir->prev = J->chain[IR_KNULL];\r\n  J->chain[IR_KNULL] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern key slot. */\r\nTRef lj_ir_kslot(jit_State *J, TRef key, IRRef slot)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef2 op12 = IRREF2((IRRef1)key, (IRRef1)slot);\r\n  IRRef ref;\r\n  /* Const part is not touched by CSE/DCE, so 0-65535 is ok for IRMlit here. */\r\n  lua_assert(tref_isk(key) && slot == (IRRef)(IRRef1)slot);\r\n  for (ref = J->chain[IR_KSLOT]; ref; ref = cir[ref].prev)\r\n    if (cir[ref].op12 == op12)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->op12 = op12;\r\n  ir->t.irt = IRT_P32;\r\n  ir->o = IR_KSLOT;\r\n  ir->prev = J->chain[IR_KSLOT];\r\n  J->chain[IR_KSLOT] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_P32);\r\n}\r\n\r\n/* -- Access to IR constants ---------------------------------------------- */\r\n\r\n/* Copy value of IR constant. */\r\nvoid lj_ir_kvalue(lua_State *L, TValue *tv, const IRIns *ir)\r\n{\r\n  UNUSED(L);\r\n  lua_assert(ir->o != IR_KSLOT);  /* Common mistake. */\r\n  switch (ir->o) {\r\n  case IR_KPRI: setitype(tv, irt_toitype(ir->t)); break;\r\n  case IR_KINT: setintV(tv, ir->i); break;\r\n  case IR_KGC: setgcV(L, tv, ir_kgc(ir), irt_toitype(ir->t)); break;\r\n  case IR_KPTR: case IR_KKPTR: case IR_KNULL:\r\n    setlightudV(tv, mref(ir->ptr, void));\r\n    break;\r\n  case IR_KNUM: setnumV(tv, ir_knum(ir)->n); break;\r\n#if LJ_HASFFI\r\n  case IR_KINT64: {\r\n    GCcdata *cd = lj_cdata_new_(L, CTID_INT64, 8);\r\n    *(uint64_t *)cdataptr(cd) = ir_kint64(ir)->u64;\r\n    setcdataV(L, tv, cd);\r\n    break;\r\n    }\r\n#endif\r\n  default: lua_assert(0); break;\r\n  }\r\n}\r\n\r\n/* -- Convert IR operand types -------------------------------------------- */\r\n\r\n/* Convert from string to number. */\r\nTRef LJ_FASTCALL lj_ir_tonumber(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isnumber(tr)) {\r\n    if (tref_isstr(tr))\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    else\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Convert from integer or string to number. */\r\nTRef LJ_FASTCALL lj_ir_tonum(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isnum(tr)) {\r\n    if (tref_isinteger(tr))\r\n      tr = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n    else if (tref_isstr(tr))\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    else\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Convert from integer or number to string. */\r\nTRef LJ_FASTCALL lj_ir_tostr(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isstr(tr)) {\r\n    if (!tref_isnumber(tr))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    tr = emitir(IRT(IR_TOSTR, IRT_STR), tr, 0);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* -- Miscellaneous IR ops ------------------------------------------------ */\r\n\r\n/* Evaluate numeric comparison. */\r\nint lj_ir_numcmp(lua_Number a, lua_Number b, IROp op)\r\n{\r\n  switch (op) {\r\n  case IR_EQ: return (a == b);\r\n  case IR_NE: return (a != b);\r\n  case IR_LT: return (a < b);\r\n  case IR_GE: return (a >= b);\r\n  case IR_LE: return (a <= b);\r\n  case IR_GT: return (a > b);\r\n  case IR_ULT: return !(a >= b);\r\n  case IR_UGE: return !(a < b);\r\n  case IR_ULE: return !(a > b);\r\n  case IR_UGT: return !(a <= b);\r\n  default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n/* Evaluate string comparison. */\r\nint lj_ir_strcmp(GCstr *a, GCstr *b, IROp op)\r\n{\r\n  int res = lj_str_cmp(a, b);\r\n  switch (op) {\r\n  case IR_LT: return (res < 0);\r\n  case IR_GE: return (res >= 0);\r\n  case IR_LE: return (res <= 0);\r\n  case IR_GT: return (res > 0);\r\n  default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n/* Rollback IR to previous state. */\r\nvoid lj_ir_rollback(jit_State *J, IRRef ref)\r\n{\r\n  IRRef nins = J->cur.nins;\r\n  while (nins > ref) {\r\n    IRIns *ir;\r\n    nins--;\r\n    ir = IR(nins);\r\n    J->chain[ir->o] = ir->prev;\r\n  }\r\n  J->cur.nins = nins;\r\n}\r\n\r\n#undef IR\r\n#undef fins\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ir.h",
    "content": "/*\r\n** SSA IR (Intermediate Representation) format.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IR_H\r\n#define _LJ_IR_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* -- IR instructions ----------------------------------------------------- */\r\n\r\n/* IR instruction definition. Order matters, see below. ORDER IR */\r\n#define IRDEF(_) \\\r\n  /* Guarded assertions. */ \\\r\n  /* Must be properly aligned to flip opposites (^1) and (un)ordered (^4). */ \\\r\n  _(LT,\t\tN , ref, ref) \\\r\n  _(GE,\t\tN , ref, ref) \\\r\n  _(LE,\t\tN , ref, ref) \\\r\n  _(GT,\t\tN , ref, ref) \\\r\n  \\\r\n  _(ULT,\tN , ref, ref) \\\r\n  _(UGE,\tN , ref, ref) \\\r\n  _(ULE,\tN , ref, ref) \\\r\n  _(UGT,\tN , ref, ref) \\\r\n  \\\r\n  _(EQ,\t\tC , ref, ref) \\\r\n  _(NE,\t\tC , ref, ref) \\\r\n  \\\r\n  _(ABC,\tN , ref, ref) \\\r\n  _(RETF,\tS , ref, ref) \\\r\n  \\\r\n  /* Miscellaneous ops. */ \\\r\n  _(NOP,\tN , ___, ___) \\\r\n  _(BASE,\tN , lit, lit) \\\r\n  _(PVAL,\tN , lit, ___) \\\r\n  _(GCSTEP,\tS , ___, ___) \\\r\n  _(HIOP,\tS , ref, ref) \\\r\n  _(LOOP,\tS , ___, ___) \\\r\n  _(USE,\tS , ref, ___) \\\r\n  _(PHI,\tS , ref, ref) \\\r\n  _(RENAME,\tS , ref, lit) \\\r\n  \\\r\n  /* Constants. */ \\\r\n  _(KPRI,\tN , ___, ___) \\\r\n  _(KINT,\tN , cst, ___) \\\r\n  _(KGC,\tN , cst, ___) \\\r\n  _(KPTR,\tN , cst, ___) \\\r\n  _(KKPTR,\tN , cst, ___) \\\r\n  _(KNULL,\tN , cst, ___) \\\r\n  _(KNUM,\tN , cst, ___) \\\r\n  _(KINT64,\tN , cst, ___) \\\r\n  _(KSLOT,\tN , ref, lit) \\\r\n  \\\r\n  /* Bit ops. */ \\\r\n  _(BNOT,\tN , ref, ___) \\\r\n  _(BSWAP,\tN , ref, ___) \\\r\n  _(BAND,\tC , ref, ref) \\\r\n  _(BOR,\tC , ref, ref) \\\r\n  _(BXOR,\tC , ref, ref) \\\r\n  _(BSHL,\tN , ref, ref) \\\r\n  _(BSHR,\tN , ref, ref) \\\r\n  _(BSAR,\tN , ref, ref) \\\r\n  _(BROL,\tN , ref, ref) \\\r\n  _(BROR,\tN , ref, ref) \\\r\n  \\\r\n  /* Arithmetic ops. ORDER ARITH */ \\\r\n  _(ADD,\tC , ref, ref) \\\r\n  _(SUB,\tN , ref, ref) \\\r\n  _(MUL,\tC , ref, ref) \\\r\n  _(DIV,\tN , ref, ref) \\\r\n  _(MOD,\tN , ref, ref) \\\r\n  _(POW,\tN , ref, ref) \\\r\n  _(NEG,\tN , ref, ref) \\\r\n  \\\r\n  _(ABS,\tN , ref, ref) \\\r\n  _(ATAN2,\tN , ref, ref) \\\r\n  _(LDEXP,\tN , ref, ref) \\\r\n  _(MIN,\tC , ref, ref) \\\r\n  _(MAX,\tC , ref, ref) \\\r\n  _(FPMATH,\tN , ref, lit) \\\r\n  \\\r\n  /* Overflow-checking arithmetic ops. */ \\\r\n  _(ADDOV,\tCW, ref, ref) \\\r\n  _(SUBOV,\tNW, ref, ref) \\\r\n  _(MULOV,\tCW, ref, ref) \\\r\n  \\\r\n  /* Memory ops. A = array, H = hash, U = upvalue, F = field, S = stack. */ \\\r\n  \\\r\n  /* Memory references. */ \\\r\n  _(AREF,\tR , ref, ref) \\\r\n  _(HREFK,\tR , ref, ref) \\\r\n  _(HREF,\tL , ref, ref) \\\r\n  _(NEWREF,\tS , ref, ref) \\\r\n  _(UREFO,\tLW, ref, lit) \\\r\n  _(UREFC,\tLW, ref, lit) \\\r\n  _(FREF,\tR , ref, lit) \\\r\n  _(STRREF,\tN , ref, ref) \\\r\n  \\\r\n  /* Loads and Stores. These must be in the same order. */ \\\r\n  _(ALOAD,\tL , ref, ___) \\\r\n  _(HLOAD,\tL , ref, ___) \\\r\n  _(ULOAD,\tL , ref, ___) \\\r\n  _(FLOAD,\tL , ref, lit) \\\r\n  _(XLOAD,\tL , ref, lit) \\\r\n  _(SLOAD,\tL , lit, lit) \\\r\n  _(VLOAD,\tL , ref, ___) \\\r\n  \\\r\n  _(ASTORE,\tS , ref, ref) \\\r\n  _(HSTORE,\tS , ref, ref) \\\r\n  _(USTORE,\tS , ref, ref) \\\r\n  _(FSTORE,\tS , ref, ref) \\\r\n  _(XSTORE,\tS , ref, ref) \\\r\n  \\\r\n  /* Allocations. */ \\\r\n  _(SNEW,\tN , ref, ref)  /* CSE is ok, not marked as A. */ \\\r\n  _(XSNEW,\tA , ref, ref) \\\r\n  _(TNEW,\tAW, lit, lit) \\\r\n  _(TDUP,\tAW, ref, ___) \\\r\n  _(CNEW,\tAW, ref, ref) \\\r\n  _(CNEWI,\tNW, ref, ref)  /* CSE is ok, not marked as A. */ \\\r\n  \\\r\n  /* Barriers. */ \\\r\n  _(TBAR,\tS , ref, ___) \\\r\n  _(OBAR,\tS , ref, ref) \\\r\n  _(XBAR,\tS , ___, ___) \\\r\n  \\\r\n  /* Type conversions. */ \\\r\n  _(CONV,\tNW, ref, lit) \\\r\n  _(TOBIT,\tN , ref, ref) \\\r\n  _(TOSTR,\tN , ref, ___) \\\r\n  _(STRTO,\tN , ref, ___) \\\r\n  \\\r\n  /* Calls. */ \\\r\n  _(CALLN,\tN , ref, lit) \\\r\n  _(CALLL,\tL , ref, lit) \\\r\n  _(CALLS,\tS , ref, lit) \\\r\n  _(CALLXS,\tS , ref, ref) \\\r\n  _(CARG,\tN , ref, ref) \\\r\n  \\\r\n  /* End of list. */\r\n\r\n/* IR opcodes (max. 256). */\r\ntypedef enum {\r\n#define IRENUM(name, m, m1, m2)\tIR_##name,\r\nIRDEF(IRENUM)\r\n#undef IRENUM\r\n  IR__MAX\r\n} IROp;\r\n\r\n/* Stored opcode. */\r\ntypedef uint8_t IROp1;\r\n\r\nLJ_STATIC_ASSERT(((int)IR_EQ^1) == (int)IR_NE);\r\nLJ_STATIC_ASSERT(((int)IR_LT^1) == (int)IR_GE);\r\nLJ_STATIC_ASSERT(((int)IR_LE^1) == (int)IR_GT);\r\nLJ_STATIC_ASSERT(((int)IR_LT^3) == (int)IR_GT);\r\nLJ_STATIC_ASSERT(((int)IR_LT^4) == (int)IR_ULT);\r\n\r\n/* Delta between xLOAD and xSTORE. */\r\n#define IRDELTA_L2S\t\t((int)IR_ASTORE - (int)IR_ALOAD)\r\n\r\nLJ_STATIC_ASSERT((int)IR_HLOAD + IRDELTA_L2S == (int)IR_HSTORE);\r\nLJ_STATIC_ASSERT((int)IR_ULOAD + IRDELTA_L2S == (int)IR_USTORE);\r\nLJ_STATIC_ASSERT((int)IR_FLOAD + IRDELTA_L2S == (int)IR_FSTORE);\r\nLJ_STATIC_ASSERT((int)IR_XLOAD + IRDELTA_L2S == (int)IR_XSTORE);\r\n\r\n/* -- Named IR literals --------------------------------------------------- */\r\n\r\n/* FPMATH sub-functions. ORDER FPM. */\r\n#define IRFPMDEF(_) \\\r\n  _(FLOOR) _(CEIL) _(TRUNC)  /* Must be first and in this order. */ \\\r\n  _(SQRT) _(EXP) _(EXP2) _(LOG) _(LOG2) _(LOG10) \\\r\n  _(SIN) _(COS) _(TAN) \\\r\n  _(OTHER)\r\n\r\ntypedef enum {\r\n#define FPMENUM(name)\t\tIRFPM_##name,\r\nIRFPMDEF(FPMENUM)\r\n#undef FPMENUM\r\n  IRFPM__MAX\r\n} IRFPMathOp;\r\n\r\n/* FLOAD fields. */\r\n#define IRFLDEF(_) \\\r\n  _(STR_LEN,\toffsetof(GCstr, len)) \\\r\n  _(FUNC_ENV,\toffsetof(GCfunc, l.env)) \\\r\n  _(FUNC_PC,\toffsetof(GCfunc, l.pc)) \\\r\n  _(TAB_META,\toffsetof(GCtab, metatable)) \\\r\n  _(TAB_ARRAY,\toffsetof(GCtab, array)) \\\r\n  _(TAB_NODE,\toffsetof(GCtab, node)) \\\r\n  _(TAB_ASIZE,\toffsetof(GCtab, asize)) \\\r\n  _(TAB_HMASK,\toffsetof(GCtab, hmask)) \\\r\n  _(TAB_NOMM,\toffsetof(GCtab, nomm)) \\\r\n  _(UDATA_META,\toffsetof(GCudata, metatable)) \\\r\n  _(UDATA_UDTYPE, offsetof(GCudata, udtype)) \\\r\n  _(UDATA_FILE,\tsizeof(GCudata)) \\\r\n  _(CDATA_CTYPEID, offsetof(GCcdata, ctypeid)) \\\r\n  _(CDATA_PTR,\tsizeof(GCcdata)) \\\r\n  _(CDATA_INT, sizeof(GCcdata)) \\\r\n  _(CDATA_INT64, sizeof(GCcdata)) \\\r\n  _(CDATA_INT64_4, sizeof(GCcdata) + 4)\r\n\r\ntypedef enum {\r\n#define FLENUM(name, ofs)\tIRFL_##name,\r\nIRFLDEF(FLENUM)\r\n#undef FLENUM\r\n  IRFL__MAX\r\n} IRFieldID;\r\n\r\n/* SLOAD mode bits, stored in op2. */\r\n#define IRSLOAD_PARENT\t\t0x01\t/* Coalesce with parent trace. */\r\n#define IRSLOAD_FRAME\t\t0x02\t/* Load hiword of frame. */\r\n#define IRSLOAD_TYPECHECK\t0x04\t/* Needs type check. */\r\n#define IRSLOAD_CONVERT\t\t0x08\t/* Number to integer conversion. */\r\n#define IRSLOAD_READONLY\t0x10\t/* Read-only, omit slot store. */\r\n#define IRSLOAD_INHERIT\t\t0x20\t/* Inherited by exits/side traces. */\r\n\r\n/* XLOAD mode, stored in op2. */\r\n#define IRXLOAD_READONLY\t1\t/* Load from read-only data. */\r\n#define IRXLOAD_VOLATILE\t2\t/* Load from volatile data. */\r\n#define IRXLOAD_UNALIGNED\t4\t/* Unaligned load. */\r\n\r\n/* CONV mode, stored in op2. */\r\n#define IRCONV_SRCMASK\t\t0x001f\t/* Source IRType. */\r\n#define IRCONV_DSTMASK\t\t0x03e0\t/* Dest. IRType (also in ir->t). */\r\n#define IRCONV_DSH\t\t5\r\n#define IRCONV_NUM_INT\t\t((IRT_NUM<<IRCONV_DSH)|IRT_INT)\r\n#define IRCONV_INT_NUM\t\t((IRT_INT<<IRCONV_DSH)|IRT_NUM)\r\n#define IRCONV_TRUNC\t\t0x0400\t/* Truncate number to integer. */\r\n#define IRCONV_SEXT\t\t0x0800\t/* Sign-extend integer to integer. */\r\n#define IRCONV_MODEMASK\t\t0x0fff\r\n#define IRCONV_CONVMASK\t\t0xf000\r\n#define IRCONV_CSH\t\t12\r\n/* Number to integer conversion mode. Ordered by strength of the checks. */\r\n#define IRCONV_TOBIT  (0<<IRCONV_CSH)\t/* None. Cache only: TOBIT conv. */\r\n#define IRCONV_ANY    (1<<IRCONV_CSH)\t/* Any FP number is ok. */\r\n#define IRCONV_INDEX  (2<<IRCONV_CSH)\t/* Check + special backprop rules. */\r\n#define IRCONV_CHECK  (3<<IRCONV_CSH)\t/* Number checked for integerness. */\r\n\r\n/* -- IR operands --------------------------------------------------------- */\r\n\r\n/* IR operand mode (2 bit). */\r\ntypedef enum {\r\n  IRMref,\t\t/* IR reference. */\r\n  IRMlit,\t\t/* 16 bit unsigned literal. */\r\n  IRMcst,\t\t/* Constant literal: i, gcr or ptr. */\r\n  IRMnone\t\t/* Unused operand. */\r\n} IRMode;\r\n#define IRM___\t\tIRMnone\r\n\r\n/* Mode bits: Commutative, {Normal/Ref, Alloc, Load, Store}, Non-weak guard. */\r\n#define IRM_C\t\t\t0x10\r\n\r\n#define IRM_N\t\t\t0x00\r\n#define IRM_R\t\t\tIRM_N\r\n#define IRM_A\t\t\t0x20\r\n#define IRM_L\t\t\t0x40\r\n#define IRM_S\t\t\t0x60\r\n\r\n#define IRM_W\t\t\t0x80\r\n\r\n#define IRM_NW\t\t\t(IRM_N|IRM_W)\r\n#define IRM_CW\t\t\t(IRM_C|IRM_W)\r\n#define IRM_AW\t\t\t(IRM_A|IRM_W)\r\n#define IRM_LW\t\t\t(IRM_L|IRM_W)\r\n\r\n#define irm_op1(m)\t\t((IRMode)((m)&3))\r\n#define irm_op2(m)\t\t((IRMode)(((m)>>2)&3))\r\n#define irm_iscomm(m)\t\t((m) & IRM_C)\r\n#define irm_kind(m)\t\t((m) & IRM_S)\r\n\r\n#define IRMODE(name, m, m1, m2)\t(((IRM##m1)|((IRM##m2)<<2)|(IRM_##m))^IRM_W),\r\n\r\nLJ_DATA const uint8_t lj_ir_mode[IR__MAX+1];\r\n\r\n/* -- IR instruction types ------------------------------------------------ */\r\n\r\n/* Map of itypes to non-negative numbers. ORDER LJ_T.\r\n** LJ_TUPVAL/LJ_TTRACE never appear in a TValue. Use these itypes for\r\n** IRT_P32 and IRT_P64, which never escape the IR.\r\n** The various integers are only used in the IR and can only escape to\r\n** a TValue after implicit or explicit conversion. Their types must be\r\n** contiguous and next to IRT_NUM (see the typerange macros below).\r\n*/\r\n#define IRTDEF(_) \\\r\n  _(NIL, 4) _(FALSE, 4) _(TRUE, 4) _(LIGHTUD, LJ_64 ? 8 : 4) _(STR, 4) \\\r\n  _(P32, 4) _(THREAD, 4) _(PROTO, 4) _(FUNC, 4) _(P64, 8) _(CDATA, 4) \\\r\n  _(TAB, 4) _(UDATA, 4) \\\r\n  _(FLOAT, 4) _(NUM, 8) _(I8, 1) _(U8, 1) _(I16, 2) _(U16, 2) \\\r\n  _(INT, 4) _(U32, 4) _(I64, 8) _(U64, 8) \\\r\n  _(SOFTFP, 4)  /* There is room for 9 more types. */\r\n\r\n/* IR result type and flags (8 bit). */\r\ntypedef enum {\r\n#define IRTENUM(name, size)\tIRT_##name,\r\nIRTDEF(IRTENUM)\r\n#undef IRTENUM\r\n  IRT__MAX,\r\n\r\n  /* Native pointer type and the corresponding integer type. */\r\n  IRT_PTR = LJ_64 ? IRT_P64 : IRT_P32,\r\n  IRT_INTP = LJ_64 ? IRT_I64 : IRT_INT,\r\n  IRT_UINTP = LJ_64 ? IRT_U64 : IRT_U32,\r\n\r\n  /* Additional flags. */\r\n  IRT_MARK = 0x20,\t/* Marker for misc. purposes. */\r\n  IRT_ISPHI = 0x40,\t/* Instruction is left or right PHI operand. */\r\n  IRT_GUARD = 0x80,\t/* Instruction is a guard. */\r\n\r\n  /* Masks. */\r\n  IRT_TYPE = 0x1f,\r\n  IRT_T = 0xff\r\n} IRType;\r\n\r\n#define irtype_ispri(irt)\t((uint32_t)(irt) <= IRT_TRUE)\r\n\r\n/* Stored IRType. */\r\ntypedef struct IRType1 { uint8_t irt; } IRType1;\r\n\r\n#define IRT(o, t)\t\t((uint32_t)(((o)<<8) | (t)))\r\n#define IRTI(o)\t\t\t(IRT((o), IRT_INT))\r\n#define IRTN(o)\t\t\t(IRT((o), IRT_NUM))\r\n#define IRTG(o, t)\t\t(IRT((o), IRT_GUARD|(t)))\r\n#define IRTGI(o)\t\t(IRT((o), IRT_GUARD|IRT_INT))\r\n\r\n#define irt_t(t)\t\t((IRType)(t).irt)\r\n#define irt_type(t)\t\t((IRType)((t).irt & IRT_TYPE))\r\n#define irt_sametype(t1, t2)\t((((t1).irt ^ (t2).irt) & IRT_TYPE) == 0)\r\n#define irt_typerange(t, first, last) \\\r\n  ((uint32_t)((t).irt & IRT_TYPE) - (uint32_t)(first) <= (uint32_t)(last-first))\r\n\r\n#define irt_isnil(t)\t\t(irt_type(t) == IRT_NIL)\r\n#define irt_ispri(t)\t\t((uint32_t)irt_type(t) <= IRT_TRUE)\r\n#define irt_islightud(t)\t(irt_type(t) == IRT_LIGHTUD)\r\n#define irt_isstr(t)\t\t(irt_type(t) == IRT_STR)\r\n#define irt_istab(t)\t\t(irt_type(t) == IRT_TAB)\r\n#define irt_iscdata(t)\t\t(irt_type(t) == IRT_CDATA)\r\n#define irt_isfloat(t)\t\t(irt_type(t) == IRT_FLOAT)\r\n#define irt_isnum(t)\t\t(irt_type(t) == IRT_NUM)\r\n#define irt_isint(t)\t\t(irt_type(t) == IRT_INT)\r\n#define irt_isi8(t)\t\t(irt_type(t) == IRT_I8)\r\n#define irt_isu8(t)\t\t(irt_type(t) == IRT_U8)\r\n#define irt_isi16(t)\t\t(irt_type(t) == IRT_I16)\r\n#define irt_isu16(t)\t\t(irt_type(t) == IRT_U16)\r\n#define irt_isu32(t)\t\t(irt_type(t) == IRT_U32)\r\n#define irt_isi64(t)\t\t(irt_type(t) == IRT_I64)\r\n#define irt_isu64(t)\t\t(irt_type(t) == IRT_U64)\r\n\r\n#define irt_isfp(t)\t\t(irt_isnum(t) || irt_isfloat(t))\r\n#define irt_isinteger(t)\t(irt_typerange((t), IRT_I8, IRT_INT))\r\n#define irt_isgcv(t)\t\t(irt_typerange((t), IRT_STR, IRT_UDATA))\r\n#define irt_isaddr(t)\t\t(irt_typerange((t), IRT_LIGHTUD, IRT_UDATA))\r\n#define irt_isint64(t)\t\t(irt_typerange((t), IRT_I64, IRT_U64))\r\n\r\n#if LJ_64\r\n#define IRT_IS64 \\\r\n  ((1u<<IRT_NUM)|(1u<<IRT_I64)|(1u<<IRT_U64)|(1u<<IRT_P64)|(1u<<IRT_LIGHTUD))\r\n#else\r\n#define IRT_IS64 \\\r\n  ((1u<<IRT_NUM)|(1u<<IRT_I64)|(1u<<IRT_U64))\r\n#endif\r\n\r\n#define irt_is64(t)\t\t((IRT_IS64 >> irt_type(t)) & 1)\r\n#define irt_is64orfp(t)\t\t(((IRT_IS64|(1u<<IRT_FLOAT))>>irt_type(t)) & 1)\r\n\r\n#define irt_size(t)\t\t(lj_ir_type_size[irt_t((t))])\r\n\r\nLJ_DATA const uint8_t lj_ir_type_size[];\r\n\r\nstatic LJ_AINLINE IRType itype2irt(const TValue *tv)\r\n{\r\n  if (tvisint(tv))\r\n    return IRT_INT;\r\n  else if (tvisnum(tv))\r\n    return IRT_NUM;\r\n#if LJ_64\r\n  else if (tvislightud(tv))\r\n    return IRT_LIGHTUD;\r\n#endif\r\n  else\r\n    return (IRType)~itype(tv);\r\n}\r\n\r\nstatic LJ_AINLINE uint32_t irt_toitype_(IRType t)\r\n{\r\n  lua_assert(!LJ_64 || t != IRT_LIGHTUD);\r\n  if (LJ_DUALNUM && t > IRT_NUM) {\r\n    return LJ_TISNUM;\r\n  } else {\r\n    lua_assert(t <= IRT_NUM);\r\n    return ~(uint32_t)t;\r\n  }\r\n}\r\n\r\n#define irt_toitype(t)\t\tirt_toitype_(irt_type((t)))\r\n\r\n#define irt_isguard(t)\t\t((t).irt & IRT_GUARD)\r\n#define irt_ismarked(t)\t\t((t).irt & IRT_MARK)\r\n#define irt_setmark(t)\t\t((t).irt |= IRT_MARK)\r\n#define irt_clearmark(t)\t((t).irt &= ~IRT_MARK)\r\n#define irt_isphi(t)\t\t((t).irt & IRT_ISPHI)\r\n#define irt_setphi(t)\t\t((t).irt |= IRT_ISPHI)\r\n#define irt_clearphi(t)\t\t((t).irt &= ~IRT_ISPHI)\r\n\r\n/* Stored combined IR opcode and type. */\r\ntypedef uint16_t IROpT;\r\n\r\n/* -- IR references ------------------------------------------------------- */\r\n\r\n/* IR references. */\r\ntypedef uint16_t IRRef1;\t/* One stored reference. */\r\ntypedef uint32_t IRRef2;\t/* Two stored references. */\r\ntypedef uint32_t IRRef;\t\t/* Used to pass around references. */\r\n\r\n/* Fixed references. */\r\nenum {\r\n  REF_BIAS =\t0x8000,\r\n  REF_TRUE =\tREF_BIAS-3,\r\n  REF_FALSE =\tREF_BIAS-2,\r\n  REF_NIL =\tREF_BIAS-1,\t/* \\--- Constants grow downwards. */\r\n  REF_BASE =\tREF_BIAS,\t/* /--- IR grows upwards. */\r\n  REF_FIRST =\tREF_BIAS+1,\r\n  REF_DROP =\t0xffff\r\n};\r\n\r\n/* Note: IRMlit operands must be < REF_BIAS, too!\r\n** This allows for fast and uniform manipulation of all operands\r\n** without looking up the operand mode in lj_ir_mode:\r\n** - CSE calculates the maximum reference of two operands.\r\n**   This must work with mixed reference/literal operands, too.\r\n** - DCE marking only checks for operand >= REF_BIAS.\r\n** - LOOP needs to substitute reference operands.\r\n**   Constant references and literals must not be modified.\r\n*/\r\n\r\n#define IRREF2(lo, hi)\t\t((IRRef2)(lo) | ((IRRef2)(hi) << 16))\r\n\r\n#define irref_isk(ref)\t\t((ref) < REF_BIAS)\r\n\r\n/* Tagged IR references (32 bit).\r\n**\r\n** +-------+-------+---------------+\r\n** |  irt  | flags |      ref      |\r\n** +-------+-------+---------------+\r\n**\r\n** The tag holds a copy of the IRType and speeds up IR type checks.\r\n*/\r\ntypedef uint32_t TRef;\r\n\r\n#define TREF_REFMASK\t\t0x0000ffff\r\n#define TREF_FRAME\t\t0x00010000\r\n#define TREF_CONT\t\t0x00020000\r\n\r\n#define TREF(ref, t)\t\t((TRef)((ref) + ((t)<<24)))\r\n\r\n#define tref_ref(tr)\t\t((IRRef1)(tr))\r\n#define tref_t(tr)\t\t((IRType)((tr)>>24))\r\n#define tref_type(tr)\t\t((IRType)(((tr)>>24) & IRT_TYPE))\r\n#define tref_typerange(tr, first, last) \\\r\n  ((((tr)>>24) & IRT_TYPE) - (TRef)(first) <= (TRef)(last-first))\r\n\r\n#define tref_istype(tr, t)\t(((tr) & (IRT_TYPE<<24)) == ((t)<<24))\r\n#define tref_isnil(tr)\t\t(tref_istype((tr), IRT_NIL))\r\n#define tref_isfalse(tr)\t(tref_istype((tr), IRT_FALSE))\r\n#define tref_istrue(tr)\t\t(tref_istype((tr), IRT_TRUE))\r\n#define tref_isstr(tr)\t\t(tref_istype((tr), IRT_STR))\r\n#define tref_isfunc(tr)\t\t(tref_istype((tr), IRT_FUNC))\r\n#define tref_iscdata(tr)\t(tref_istype((tr), IRT_CDATA))\r\n#define tref_istab(tr)\t\t(tref_istype((tr), IRT_TAB))\r\n#define tref_isudata(tr)\t(tref_istype((tr), IRT_UDATA))\r\n#define tref_isnum(tr)\t\t(tref_istype((tr), IRT_NUM))\r\n#define tref_isint(tr)\t\t(tref_istype((tr), IRT_INT))\r\n\r\n#define tref_isbool(tr)\t\t(tref_typerange((tr), IRT_FALSE, IRT_TRUE))\r\n#define tref_ispri(tr)\t\t(tref_typerange((tr), IRT_NIL, IRT_TRUE))\r\n#define tref_istruecond(tr)\t(!tref_typerange((tr), IRT_NIL, IRT_FALSE))\r\n#define tref_isinteger(tr)\t(tref_typerange((tr), IRT_I8, IRT_INT))\r\n#define tref_isnumber(tr)\t(tref_typerange((tr), IRT_NUM, IRT_INT))\r\n#define tref_isnumber_str(tr)\t(tref_isnumber((tr)) || tref_isstr((tr)))\r\n#define tref_isgcv(tr)\t\t(tref_typerange((tr), IRT_STR, IRT_UDATA))\r\n\r\n#define tref_isk(tr)\t\t(irref_isk(tref_ref((tr))))\r\n#define tref_isk2(tr1, tr2)\t(irref_isk(tref_ref((tr1) | (tr2))))\r\n\r\n#define TREF_PRI(t)\t\t(TREF(REF_NIL-(t), (t)))\r\n#define TREF_NIL\t\t(TREF_PRI(IRT_NIL))\r\n#define TREF_FALSE\t\t(TREF_PRI(IRT_FALSE))\r\n#define TREF_TRUE\t\t(TREF_PRI(IRT_TRUE))\r\n\r\n/* -- IR format ----------------------------------------------------------- */\r\n\r\n/* IR instruction format (64 bit).\r\n**\r\n**    16      16     8   8   8   8\r\n** +-------+-------+---+---+---+---+\r\n** |  op1  |  op2  | t | o | r | s |\r\n** +-------+-------+---+---+---+---+\r\n** |  op12/i/gco   |   ot  | prev  | (alternative fields in union)\r\n** +---------------+-------+-------+\r\n**        32           16      16\r\n**\r\n** prev is only valid prior to register allocation and then reused for r + s.\r\n*/\r\n\r\ntypedef union IRIns {\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      IRRef1 op1;\t/* IR operand 1. */\r\n    , IRRef1 op2;\t/* IR operand 2. */\r\n    )\r\n    IROpT ot;\t\t/* IR opcode and type (overlaps t and o). */\r\n    IRRef1 prev;\t/* Previous ins in same chain (overlaps r and s). */\r\n  };\r\n  struct {\r\n    IRRef2 op12;\t/* IR operand 1 and 2 (overlaps op1 and op2). */\r\n    LJ_ENDIAN_LOHI(\r\n      IRType1 t;\t/* IR type. */\r\n    , IROp1 o;\t\t/* IR opcode. */\r\n    )\r\n    LJ_ENDIAN_LOHI(\r\n      uint8_t r;\t/* Register allocation (overlaps prev). */\r\n    , uint8_t s;\t/* Spill slot allocation (overlaps prev). */\r\n    )\r\n  };\r\n  int32_t i;\t\t/* 32 bit signed integer literal (overlaps op12). */\r\n  GCRef gcr;\t\t/* GCobj constant (overlaps op12). */\r\n  MRef ptr;\t\t/* Pointer constant (overlaps op12). */\r\n} IRIns;\r\n\r\n#define ir_kgc(ir)\tcheck_exp((ir)->o == IR_KGC, gcref((ir)->gcr))\r\n#define ir_kstr(ir)\t(gco2str(ir_kgc((ir))))\r\n#define ir_ktab(ir)\t(gco2tab(ir_kgc((ir))))\r\n#define ir_kfunc(ir)\t(gco2func(ir_kgc((ir))))\r\n#define ir_kcdata(ir)\t(gco2cd(ir_kgc((ir))))\r\n#define ir_knum(ir)\tcheck_exp((ir)->o == IR_KNUM, mref((ir)->ptr, cTValue))\r\n#define ir_kint64(ir)\tcheck_exp((ir)->o == IR_KINT64, mref((ir)->ptr,cTValue))\r\n#define ir_k64(ir) \\\r\n  check_exp((ir)->o == IR_KNUM || (ir)->o == IR_KINT64, mref((ir)->ptr,cTValue))\r\n#define ir_kptr(ir) \\\r\n  check_exp((ir)->o == IR_KPTR || (ir)->o == IR_KKPTR, mref((ir)->ptr, void))\r\n\r\n/* A store or any other op with a non-weak guard has a side-effect. */\r\nstatic LJ_AINLINE int ir_sideeff(IRIns *ir)\r\n{\r\n  return (((ir->t.irt | ~IRT_GUARD) & lj_ir_mode[ir->o]) >= IRM_S);\r\n}\r\n\r\nLJ_STATIC_ASSERT((int)IRT_GUARD == (int)IRM_W);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_ircall.h",
    "content": "/*\r\n** IR CALL* instruction definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IRCALL_H\r\n#define _LJ_IRCALL_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n\r\n/* C call info for CALL* instructions. */\r\ntypedef struct CCallInfo {\r\n  ASMFunction func;\t\t/* Function pointer. */\r\n  uint32_t flags;\t\t/* Number of arguments and flags. */\r\n} CCallInfo;\r\n\r\n#define CCI_NARGS(ci)\t\t((ci)->flags & 0xff)\t/* Extract # of args. */\r\n#define CCI_NARGS_MAX\t\t32\t\t\t/* Max. # of args. */\r\n\r\n#define CCI_OTSHIFT\t\t16\r\n#define CCI_OPTYPE(ci)\t\t((ci)->flags >> CCI_OTSHIFT)  /* Get op/type. */\r\n#define CCI_OPSHIFT\t\t24\r\n#define CCI_OP(ci)\t\t((ci)->flags >> CCI_OPSHIFT)  /* Get op. */\r\n\r\n#define CCI_CALL_N\t\t(IR_CALLN << CCI_OPSHIFT)\r\n#define CCI_CALL_L\t\t(IR_CALLL << CCI_OPSHIFT)\r\n#define CCI_CALL_S\t\t(IR_CALLS << CCI_OPSHIFT)\r\n#define CCI_CALL_FN\t\t(CCI_CALL_N|CCI_CC_FASTCALL)\r\n#define CCI_CALL_FL\t\t(CCI_CALL_L|CCI_CC_FASTCALL)\r\n#define CCI_CALL_FS\t\t(CCI_CALL_S|CCI_CC_FASTCALL)\r\n\r\n/* C call info flags. */\r\n#define CCI_L\t\t\t0x0100\t/* Implicit L arg. */\r\n#define CCI_CASTU64\t\t0x0200\t/* Cast u64 result to number. */\r\n#define CCI_NOFPRCLOBBER\t0x0400\t/* Does not clobber any FPRs. */\r\n#define CCI_VARARG\t\t0x0800\t/* Vararg function. */\r\n\r\n#define CCI_CC_MASK\t\t0x3000\t/* Calling convention mask. */\r\n#define CCI_CC_SHIFT\t\t12\r\n/* ORDER CC */\r\n#define CCI_CC_CDECL\t\t0x0000\t/* Default cdecl calling convention. */\r\n#define CCI_CC_THISCALL\t\t0x1000\t/* Thiscall calling convention. */\r\n#define CCI_CC_FASTCALL\t\t0x2000\t/* Fastcall calling convention. */\r\n#define CCI_CC_STDCALL\t\t0x3000\t/* Stdcall calling convention. */\r\n\r\n/* Helpers for conditional function definitions. */\r\n#define IRCALLCOND_ANY(x)\t\tx\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#define IRCALLCOND_FPMATH(x)\t\tNULL\r\n#else\r\n#define IRCALLCOND_FPMATH(x)\t\tx\r\n#endif\r\n\r\n#if LJ_SOFTFP\r\n#define IRCALLCOND_SOFTFP(x)\t\tx\r\n#if LJ_HASFFI\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tx\r\n#else\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tNULL\r\n#endif\r\n#else\r\n#define IRCALLCOND_SOFTFP(x)\t\tNULL\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tNULL\r\n#endif\r\n\r\n#define LJ_NEED_FP64\t(LJ_TARGET_ARM || LJ_TARGET_PPC || LJ_TARGET_MIPS)\r\n\r\n#if LJ_HASFFI && (LJ_SOFTFP || LJ_NEED_FP64)\r\n#define IRCALLCOND_FP64_FFI(x)\t\tx\r\n#else\r\n#define IRCALLCOND_FP64_FFI(x)\t\tNULL\r\n#endif\r\n\r\n#if LJ_HASFFI\r\n#define IRCALLCOND_FFI(x)\t\tx\r\n#if LJ_32\r\n#define IRCALLCOND_FFI32(x)\t\tx\r\n#else\r\n#define IRCALLCOND_FFI32(x)\t\tNULL\r\n#endif\r\n#else\r\n#define IRCALLCOND_FFI(x)\t\tNULL\r\n#define IRCALLCOND_FFI32(x)\t\tNULL\r\n#endif\r\n\r\n#if LJ_TARGET_X86\r\n#define CCI_RANDFPR\t0\t/* Clang on OSX/x86 is overzealous. */\r\n#else\r\n#define CCI_RANDFPR\tCCI_NOFPRCLOBBER\r\n#endif\r\n\r\n#if LJ_SOFTFP\r\n#define ARG1_FP\t\t2\t/* Treat as 2 32 bit arguments. */\r\n#else\r\n#define ARG1_FP\t\t1\r\n#endif\r\n\r\n#if LJ_32\r\n#define ARG2_64\t\t4\t/* Treat as 4 32 bit arguments. */\r\n#else\r\n#define ARG2_64\t\t2\r\n#endif\r\n\r\n/* Function definitions for CALL* instructions. */\r\n#define IRCALLDEF(_) \\\r\n  _(ANY,\tlj_str_cmp,\t\t2,  FN, INT, CCI_NOFPRCLOBBER) \\\r\n  _(ANY,\tlj_str_new,\t\t3,   S, STR, CCI_L) \\\r\n  _(ANY,\tlj_strscan_num,\t\t2,  FN, INT, 0) \\\r\n  _(ANY,\tlj_str_fromint,\t\t2,  FN, STR, CCI_L) \\\r\n  _(ANY,\tlj_str_fromnum,\t\t2,  FN, STR, CCI_L) \\\r\n  _(ANY,\tlj_tab_new1,\t\t2,  FS, TAB, CCI_L) \\\r\n  _(ANY,\tlj_tab_dup,\t\t2,  FS, TAB, CCI_L) \\\r\n  _(ANY,\tlj_tab_newkey,\t\t3,   S, P32, CCI_L) \\\r\n  _(ANY,\tlj_tab_len,\t\t1,  FL, INT, 0) \\\r\n  _(ANY,\tlj_gc_step_jit,\t\t2,  FS, NIL, CCI_L) \\\r\n  _(ANY,\tlj_gc_barrieruv,\t2,  FS, NIL, 0) \\\r\n  _(ANY,\tlj_mem_newgco,\t\t2,  FS, P32, CCI_L) \\\r\n  _(ANY,\tlj_math_random_step, 1, FS, NUM, CCI_CASTU64|CCI_RANDFPR)\\\r\n  _(ANY,\tlj_vm_modi,\t\t2,  FN, INT, 0) \\\r\n  _(ANY,\tsinh,\t\t\tARG1_FP,  N, NUM, 0) \\\r\n  _(ANY,\tcosh,\t\t\tARG1_FP,  N, NUM, 0) \\\r\n  _(ANY,\ttanh,\t\t\tARG1_FP,  N, NUM, 0) \\\r\n  _(ANY,\tfputc,\t\t\t2,  S, INT, 0) \\\r\n  _(ANY,\tfwrite,\t\t\t4,  S, INT, 0) \\\r\n  _(ANY,\tfflush,\t\t\t1,  S, INT, 0) \\\r\n  /* ORDER FPM */ \\\r\n  _(FPMATH,\tlj_vm_floor,\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlj_vm_ceil,\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlj_vm_trunc,\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tsqrt,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\texp,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlj_vm_exp2,\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlog,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlj_vm_log2,\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlog10,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tsin,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tcos,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\ttan,\t\t\tARG1_FP,   N, NUM, 0) \\\r\n  _(FPMATH,\tlj_vm_powi,\t\tARG1_FP+1, N, NUM, 0) \\\r\n  _(FPMATH,\tpow,\t\t\tARG1_FP*2, N, NUM, 0) \\\r\n  _(FPMATH,\tatan2,\t\t\tARG1_FP*2, N, NUM, 0) \\\r\n  _(FPMATH,\tldexp,\t\t\tARG1_FP+1, N, NUM, 0) \\\r\n  _(SOFTFP,\tlj_vm_tobit,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP,\tsoftfp_add,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_sub,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_mul,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_div,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_cmp,\t\t4,   N, NIL, 0) \\\r\n  _(SOFTFP,\tsoftfp_i2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_d2i,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_ui2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_d2ui,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_d2f,\t\t2,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_i2f,\t\t1,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_ui2f,\t\t1,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2i,\t\t1,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2ui,\t\t1,   N, INT, 0) \\\r\n  _(FP64_FFI,\tfp64_l2d,\t\t2,   N, NUM, 0) \\\r\n  _(FP64_FFI,\tfp64_ul2d,\t\t2,   N, NUM, 0) \\\r\n  _(FP64_FFI,\tfp64_l2f,\t\t2,   N, FLOAT, 0) \\\r\n  _(FP64_FFI,\tfp64_ul2f,\t\t2,   N, FLOAT, 0) \\\r\n  _(FP64_FFI,\tfp64_d2l,\t\tARG1_FP,   N, I64, 0) \\\r\n  _(FP64_FFI,\tfp64_d2ul,\t\tARG1_FP,   N, U64, 0) \\\r\n  _(FP64_FFI,\tfp64_f2l,\t\t1,   N, I64, 0) \\\r\n  _(FP64_FFI,\tfp64_f2ul,\t\t1,   N, U64, 0) \\\r\n  _(FFI,\tlj_carith_divi64,\tARG2_64,   N, I64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_divu64,\tARG2_64,   N, U64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_modi64,\tARG2_64,   N, I64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_modu64,\tARG2_64,   N, U64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_powi64,\tARG2_64,   N, I64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_powu64,\tARG2_64,   N, U64, CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_cdata_setfin,\t2,        FN, P32, CCI_L) \\\r\n  _(FFI,\tstrlen,\t\t\t1,         L, INTP, 0) \\\r\n  _(FFI,\tmemcpy,\t\t\t3,         S, PTR, 0) \\\r\n  _(FFI,\tmemset,\t\t\t3,         S, PTR, 0) \\\r\n  _(FFI,\tlj_vm_errno,\t\t0,         S, INT, CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_mul64,\tARG2_64,   N, I64, CCI_NOFPRCLOBBER)\r\n  \\\r\n  /* End of list. */\r\n\r\ntypedef enum {\r\n#define IRCALLENUM(cond, name, nargs, kind, type, flags)\tIRCALL_##name,\r\nIRCALLDEF(IRCALLENUM)\r\n#undef IRCALLENUM\r\n  IRCALL__MAX\r\n} IRCallID;\r\n\r\nLJ_FUNC TRef lj_ir_call(jit_State *J, IRCallID id, ...);\r\n\r\nLJ_DATA const CCallInfo lj_ir_callinfo[IRCALL__MAX+1];\r\n\r\n/* Soft-float declarations. */\r\n#if LJ_SOFTFP\r\n#if LJ_TARGET_ARM\r\n#define softfp_add __aeabi_dadd\r\n#define softfp_sub __aeabi_dsub\r\n#define softfp_mul __aeabi_dmul\r\n#define softfp_div __aeabi_ddiv\r\n#define softfp_cmp __aeabi_cdcmple\r\n#define softfp_i2d __aeabi_i2d\r\n#define softfp_d2i __aeabi_d2iz\r\n#define softfp_ui2d __aeabi_ui2d\r\n#define softfp_f2d __aeabi_f2d\r\n#define softfp_d2ui __aeabi_d2uiz\r\n#define softfp_d2f __aeabi_d2f\r\n#define softfp_i2f __aeabi_i2f\r\n#define softfp_ui2f __aeabi_ui2f\r\n#define softfp_f2i __aeabi_f2iz\r\n#define softfp_f2ui __aeabi_f2uiz\r\n#define fp64_l2d __aeabi_l2d\r\n#define fp64_ul2d __aeabi_ul2d\r\n#define fp64_l2f __aeabi_l2f\r\n#define fp64_ul2f __aeabi_ul2f\r\n#if LJ_TARGET_IOS\r\n#define fp64_d2l __fixdfdi\r\n#define fp64_d2ul __fixunsdfdi\r\n#define fp64_f2l __fixsfdi\r\n#define fp64_f2ul __fixunssfdi\r\n#else\r\n#define fp64_d2l __aeabi_d2lz\r\n#define fp64_d2ul __aeabi_d2ulz\r\n#define fp64_f2l __aeabi_f2lz\r\n#define fp64_f2ul __aeabi_f2ulz\r\n#endif\r\n#else\r\n#error \"Missing soft-float definitions for target architecture\"\r\n#endif\r\nextern double softfp_add(double a, double b);\r\nextern double softfp_sub(double a, double b);\r\nextern double softfp_mul(double a, double b);\r\nextern double softfp_div(double a, double b);\r\nextern void softfp_cmp(double a, double b);\r\nextern double softfp_i2d(int32_t a);\r\nextern int32_t softfp_d2i(double a);\r\n#if LJ_HASFFI\r\nextern double softfp_ui2d(uint32_t a);\r\nextern double softfp_f2d(float a);\r\nextern uint32_t softfp_d2ui(double a);\r\nextern float softfp_d2f(double a);\r\nextern float softfp_i2f(int32_t a);\r\nextern float softfp_ui2f(uint32_t a);\r\nextern int32_t softfp_f2i(float a);\r\nextern uint32_t softfp_f2ui(float a);\r\n#endif\r\n#endif\r\n\r\n#if LJ_HASFFI && LJ_NEED_FP64 && !(LJ_TARGET_ARM && LJ_SOFTFP)\r\n#ifdef __GNUC__\r\n#define fp64_l2d __floatdidf\r\n#define fp64_ul2d __floatundidf\r\n#define fp64_l2f __floatdisf\r\n#define fp64_ul2f __floatundisf\r\n#define fp64_d2l __fixdfdi\r\n#define fp64_d2ul __fixunsdfdi\r\n#define fp64_f2l __fixsfdi\r\n#define fp64_f2ul __fixunssfdi\r\n#else\r\n#error \"Missing fp64 helper definitions for this compiler\"\r\n#endif\r\n#endif\r\n\r\n#if LJ_HASFFI && (LJ_SOFTFP || LJ_NEED_FP64)\r\nextern double fp64_l2d(int64_t a);\r\nextern double fp64_ul2d(uint64_t a);\r\nextern float fp64_l2f(int64_t a);\r\nextern float fp64_ul2f(uint64_t a);\r\nextern int64_t fp64_d2l(double a);\r\nextern uint64_t fp64_d2ul(double a);\r\nextern int64_t fp64_f2l(float a);\r\nextern uint64_t fp64_f2ul(float a);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_iropt.h",
    "content": "/*\r\n** Common header for IR emitter and optimizations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IROPT_H\r\n#define _LJ_IROPT_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* IR emitter. */\r\nLJ_FUNC void LJ_FASTCALL lj_ir_growtop(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_emit(jit_State *J);\r\n\r\n/* Save current IR in J->fold.ins, but do not emit it (yet). */\r\nstatic LJ_AINLINE void lj_ir_set_(jit_State *J, uint16_t ot, IRRef1 a, IRRef1 b)\r\n{\r\n  J->fold.ins.ot = ot; J->fold.ins.op1 = a; J->fold.ins.op2 = b;\r\n}\r\n\r\n#define lj_ir_set(J, ot, a, b) \\\r\n  lj_ir_set_(J, (uint16_t)(ot), (IRRef1)(a), (IRRef1)(b))\r\n\r\n/* Get ref of next IR instruction and optionally grow IR.\r\n** Note: this may invalidate all IRIns*!\r\n*/\r\nstatic LJ_AINLINE IRRef lj_ir_nextins(jit_State *J)\r\n{\r\n  IRRef ref = J->cur.nins;\r\n  if (LJ_UNLIKELY(ref >= J->irtoplim)) lj_ir_growtop(J);\r\n  J->cur.nins = ref + 1;\r\n  return ref;\r\n}\r\n\r\n/* Interning of constants. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_kint(jit_State *J, int32_t k);\r\nLJ_FUNC void lj_ir_k64_freeall(jit_State *J);\r\nLJ_FUNC TRef lj_ir_k64(jit_State *J, IROp op, cTValue *tv);\r\nLJ_FUNC cTValue *lj_ir_k64_find(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_knum_u64(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_knumint(jit_State *J, lua_Number n);\r\nLJ_FUNC TRef lj_ir_kint64(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_kgc(jit_State *J, GCobj *o, IRType t);\r\nLJ_FUNC TRef lj_ir_kptr_(jit_State *J, IROp op, void *ptr);\r\nLJ_FUNC TRef lj_ir_knull(jit_State *J, IRType t);\r\nLJ_FUNC TRef lj_ir_kslot(jit_State *J, TRef key, IRRef slot);\r\n\r\n#if LJ_64\r\n#define lj_ir_kintp(J, k)\tlj_ir_kint64(J, (uint64_t)(k))\r\n#else\r\n#define lj_ir_kintp(J, k)\tlj_ir_kint(J, (int32_t)(k))\r\n#endif\r\n\r\nstatic LJ_AINLINE TRef lj_ir_knum(jit_State *J, lua_Number n)\r\n{\r\n  TValue tv;\r\n  tv.n = n;\r\n  return lj_ir_knum_u64(J, tv.u64);\r\n}\r\n\r\n#define lj_ir_kstr(J, str)\tlj_ir_kgc(J, obj2gco((str)), IRT_STR)\r\n#define lj_ir_ktab(J, tab)\tlj_ir_kgc(J, obj2gco((tab)), IRT_TAB)\r\n#define lj_ir_kfunc(J, func)\tlj_ir_kgc(J, obj2gco((func)), IRT_FUNC)\r\n#define lj_ir_kptr(J, ptr)\tlj_ir_kptr_(J, IR_KPTR, (ptr))\r\n#define lj_ir_kkptr(J, ptr)\tlj_ir_kptr_(J, IR_KKPTR, (ptr))\r\n\r\n/* Special FP constants. */\r\n#define lj_ir_knum_zero(J)\tlj_ir_knum_u64(J, U64x(00000000,00000000))\r\n#define lj_ir_knum_one(J)\tlj_ir_knum_u64(J, U64x(3ff00000,00000000))\r\n#define lj_ir_knum_tobit(J)\tlj_ir_knum_u64(J, U64x(43380000,00000000))\r\n\r\n/* Special 128 bit SIMD constants. */\r\n#define lj_ir_knum_abs(J)\tlj_ir_k64(J, IR_KNUM, LJ_KSIMD(J, LJ_KSIMD_ABS))\r\n#define lj_ir_knum_neg(J)\tlj_ir_k64(J, IR_KNUM, LJ_KSIMD(J, LJ_KSIMD_NEG))\r\n\r\n/* Access to constants. */\r\nLJ_FUNC void lj_ir_kvalue(lua_State *L, TValue *tv, const IRIns *ir);\r\n\r\n/* Convert IR operand types. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tonumber(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tonum(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tostr(jit_State *J, TRef tr);\r\n\r\n/* Miscellaneous IR ops. */\r\nLJ_FUNC int lj_ir_numcmp(lua_Number a, lua_Number b, IROp op);\r\nLJ_FUNC int lj_ir_strcmp(GCstr *a, GCstr *b, IROp op);\r\nLJ_FUNC void lj_ir_rollback(jit_State *J, IRRef ref);\r\n\r\n/* Emit IR instructions with on-the-fly optimizations. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fold(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_cse(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_cselim(jit_State *J, IRRef lim);\r\n\r\n/* Special return values for the fold functions. */\r\nenum {\r\n  NEXTFOLD,\t\t/* Couldn't fold, pass on. */\r\n  RETRYFOLD,\t\t/* Retry fold with modified fins. */\r\n  KINTFOLD,\t\t/* Return ref for int constant in fins->i. */\r\n  FAILFOLD,\t\t/* Guard would always fail. */\r\n  DROPFOLD,\t\t/* Guard eliminated. */\r\n  MAX_FOLD\r\n};\r\n\r\n#define INTFOLD(k)\t((J->fold.ins.i = (k)), (TRef)KINTFOLD)\r\n#define INT64FOLD(k)\t(lj_ir_kint64(J, (k)))\r\n#define CONDFOLD(cond)\t((TRef)FAILFOLD + (TRef)(cond))\r\n#define LEFTFOLD\t(J->fold.ins.op1)\r\n#define RIGHTFOLD\t(J->fold.ins.op2)\r\n#define CSEFOLD\t\t(lj_opt_cse(J))\r\n#define EMITFOLD\t(lj_ir_emit(J))\r\n\r\n/* Load/store forwarding. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_aload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_hload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_uload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_fload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_xload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_tab_len(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_hrefk(jit_State *J);\r\nLJ_FUNC int LJ_FASTCALL lj_opt_fwd_href_nokey(jit_State *J);\r\nLJ_FUNC int LJ_FASTCALL lj_opt_fwd_tptr(jit_State *J, IRRef lim);\r\nLJ_FUNC int lj_opt_fwd_wasnonnil(jit_State *J, IROpT loadop, IRRef xref);\r\n\r\n/* Dead-store elimination. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_ahstore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_ustore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_fstore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_xstore(jit_State *J);\r\n\r\n/* Narrowing. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_convert(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_index(jit_State *J, TRef key);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_toint(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_tobit(jit_State *J, TRef tr);\r\n#if LJ_HASFFI\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_cindex(jit_State *J, TRef key);\r\n#endif\r\nLJ_FUNC TRef lj_opt_narrow_arith(jit_State *J, TRef rb, TRef rc,\r\n\t\t\t\t TValue *vb, TValue *vc, IROp op);\r\nLJ_FUNC TRef lj_opt_narrow_unm(jit_State *J, TRef rc, TValue *vc);\r\nLJ_FUNC TRef lj_opt_narrow_mod(jit_State *J, TRef rb, TRef rc, TValue *vc);\r\nLJ_FUNC TRef lj_opt_narrow_pow(jit_State *J, TRef rb, TRef rc, TValue *vc);\r\nLJ_FUNC IRType lj_opt_narrow_forl(jit_State *J, cTValue *forbase);\r\n\r\n/* Optimization passes. */\r\nLJ_FUNC void lj_opt_dce(jit_State *J);\r\nLJ_FUNC int lj_opt_loop(jit_State *J);\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\nLJ_FUNC void lj_opt_split(jit_State *J);\r\n#else\r\n#define lj_opt_split(J)\t\tUNUSED(J)\r\n#endif\r\nLJ_FUNC void lj_opt_sink(jit_State *J);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_jit.h",
    "content": "/*\r\n** Common definitions for the JIT compiler.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_JIT_H\r\n#define _LJ_JIT_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n\r\n/* JIT engine flags. */\r\n#define JIT_F_ON\t\t0x00000001\r\n\r\n/* CPU-specific JIT engine flags. */\r\n#if LJ_TARGET_X86ORX64\r\n#define JIT_F_CMOV\t\t0x00000010\r\n#define JIT_F_SSE2\t\t0x00000020\r\n#define JIT_F_SSE3\t\t0x00000040\r\n#define JIT_F_SSE4_1\t\t0x00000080\r\n#define JIT_F_P4\t\t0x00000100\r\n#define JIT_F_PREFER_IMUL\t0x00000200\r\n#define JIT_F_SPLIT_XMM\t\t0x00000400\r\n#define JIT_F_LEA_AGU\t\t0x00000800\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_CMOV\r\n#define JIT_F_CPUSTRING\t\t\"\\4CMOV\\4SSE2\\4SSE3\\6SSE4.1\\2P4\\3AMD\\2K8\\4ATOM\"\r\n#elif LJ_TARGET_ARM\r\n#define JIT_F_ARMV6_\t\t0x00000010\r\n#define JIT_F_ARMV6T2_\t\t0x00000020\r\n#define JIT_F_ARMV7\t\t0x00000040\r\n#define JIT_F_VFPV2\t\t0x00000080\r\n#define JIT_F_VFPV3\t\t0x00000100\r\n\r\n#define JIT_F_ARMV6\t\t(JIT_F_ARMV6_|JIT_F_ARMV6T2_|JIT_F_ARMV7)\r\n#define JIT_F_ARMV6T2\t\t(JIT_F_ARMV6T2_|JIT_F_ARMV7)\r\n#define JIT_F_VFP\t\t(JIT_F_VFPV2|JIT_F_VFPV3)\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_ARMV6_\r\n#define JIT_F_CPUSTRING\t\t\"\\5ARMv6\\7ARMv6T2\\5ARMv7\\5VFPv2\\5VFPv3\"\r\n#elif LJ_TARGET_PPC\r\n#define JIT_F_SQRT\t\t0x00000010\r\n#define JIT_F_ROUND\t\t0x00000020\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_SQRT\r\n#define JIT_F_CPUSTRING\t\t\"\\4SQRT\\5ROUND\"\r\n#elif LJ_TARGET_MIPS\r\n#define JIT_F_MIPS32R2\t\t0x00000010\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_MIPS32R2\r\n#define JIT_F_CPUSTRING\t\t\"\\010MIPS32R2\"\r\n#else\r\n#define JIT_F_CPU_FIRST\t\t0\r\n#define JIT_F_CPUSTRING\t\t\"\"\r\n#endif\r\n\r\n/* Optimization flags. */\r\n#define JIT_F_OPT_MASK\t\t0x0fff0000\r\n\r\n#define JIT_F_OPT_FOLD\t\t0x00010000\r\n#define JIT_F_OPT_CSE\t\t0x00020000\r\n#define JIT_F_OPT_DCE\t\t0x00040000\r\n#define JIT_F_OPT_FWD\t\t0x00080000\r\n#define JIT_F_OPT_DSE\t\t0x00100000\r\n#define JIT_F_OPT_NARROW\t0x00200000\r\n#define JIT_F_OPT_LOOP\t\t0x00400000\r\n#define JIT_F_OPT_ABC\t\t0x00800000\r\n#define JIT_F_OPT_SINK\t\t0x01000000\r\n#define JIT_F_OPT_FUSE\t\t0x02000000\r\n\r\n/* Optimizations names for -O. Must match the order above. */\r\n#define JIT_F_OPT_FIRST\t\tJIT_F_OPT_FOLD\r\n#define JIT_F_OPTSTRING\t\\\r\n  \"\\4fold\\3cse\\3dce\\3fwd\\3dse\\6narrow\\4loop\\3abc\\4sink\\4fuse\"\r\n\r\n/* Optimization levels set a fixed combination of flags. */\r\n#define JIT_F_OPT_0\t0\r\n#define JIT_F_OPT_1\t(JIT_F_OPT_FOLD|JIT_F_OPT_CSE|JIT_F_OPT_DCE)\r\n#define JIT_F_OPT_2\t(JIT_F_OPT_1|JIT_F_OPT_NARROW|JIT_F_OPT_LOOP)\r\n#define JIT_F_OPT_3\t(JIT_F_OPT_2|\\\r\n  JIT_F_OPT_FWD|JIT_F_OPT_DSE|JIT_F_OPT_ABC|JIT_F_OPT_SINK|JIT_F_OPT_FUSE)\r\n#define JIT_F_OPT_DEFAULT\tJIT_F_OPT_3\r\n\r\n#if LJ_TARGET_WINDOWS || LJ_64\r\n/* See: http://blogs.msdn.com/oldnewthing/archive/2003/10/08/55239.aspx */\r\n#define JIT_P_sizemcode_DEFAULT\t\t64\r\n#else\r\n/* Could go as low as 4K, but the mmap() overhead would be rather high. */\r\n#define JIT_P_sizemcode_DEFAULT\t\t32\r\n#endif\r\n\r\n/* Optimization parameters and their defaults. Length is a char in octal! */\r\n#define JIT_PARAMDEF(_) \\\r\n  _(\\010, maxtrace,\t1000)\t/* Max. # of traces in cache. */ \\\r\n  _(\\011, maxrecord,\t4000)\t/* Max. # of recorded IR instructions. */ \\\r\n  _(\\012, maxirconst,\t500)\t/* Max. # of IR constants of a trace. */ \\\r\n  _(\\007, maxside,\t100)\t/* Max. # of side traces of a root trace. */ \\\r\n  _(\\007, maxsnap,\t500)\t/* Max. # of snapshots for a trace. */ \\\r\n  \\\r\n  _(\\007, hotloop,\t56)\t/* # of iter. to detect a hot loop/call. */ \\\r\n  _(\\007, hotexit,\t10)\t/* # of taken exits to start a side trace. */ \\\r\n  _(\\007, tryside,\t4)\t/* # of attempts to compile a side trace. */ \\\r\n  \\\r\n  _(\\012, instunroll,\t4)\t/* Max. unroll for instable loops. */ \\\r\n  _(\\012, loopunroll,\t15)\t/* Max. unroll for loop ops in side traces. */ \\\r\n  _(\\012, callunroll,\t3)\t/* Max. unroll for recursive calls. */ \\\r\n  _(\\011, recunroll,\t2)\t/* Min. unroll for true recursion. */ \\\r\n  \\\r\n  /* Size of each machine code area (in KBytes). */ \\\r\n  _(\\011, sizemcode,\tJIT_P_sizemcode_DEFAULT) \\\r\n  /* Max. total size of all machine code areas (in KBytes). */ \\\r\n  _(\\010, maxmcode,\t512) \\\r\n  /* End of list. */\r\n\r\nenum {\r\n#define JIT_PARAMENUM(len, name, value)\tJIT_P_##name,\r\nJIT_PARAMDEF(JIT_PARAMENUM)\r\n#undef JIT_PARAMENUM\r\n  JIT_P__MAX\r\n};\r\n\r\n#define JIT_PARAMSTR(len, name, value)\t#len #name\r\n#define JIT_P_STRING\tJIT_PARAMDEF(JIT_PARAMSTR)\r\n\r\n/* Trace compiler state. */\r\ntypedef enum {\r\n  LJ_TRACE_IDLE,\t/* Trace compiler idle. */\r\n  LJ_TRACE_ACTIVE = 0x10,\r\n  LJ_TRACE_RECORD,\t/* Bytecode recording active. */\r\n  LJ_TRACE_START,\t/* New trace started. */\r\n  LJ_TRACE_END,\t\t/* End of trace. */\r\n  LJ_TRACE_ASM,\t\t/* Assemble trace. */\r\n  LJ_TRACE_ERR\t\t/* Trace aborted with error. */\r\n} TraceState;\r\n\r\n/* Post-processing action. */\r\ntypedef enum {\r\n  LJ_POST_NONE,\t\t/* No action. */\r\n  LJ_POST_FIXCOMP,\t/* Fixup comparison and emit pending guard. */\r\n  LJ_POST_FIXGUARD,\t/* Fixup and emit pending guard. */\r\n  LJ_POST_FIXGUARDSNAP,\t/* Fixup and emit pending guard and snapshot. */\r\n  LJ_POST_FIXBOOL,\t/* Fixup boolean result. */\r\n  LJ_POST_FIXCONST,\t/* Fixup constant results. */\r\n  LJ_POST_FFRETRY\t/* Suppress recording of retried fast functions. */\r\n} PostProc;\r\n\r\n/* Machine code type. */\r\n#if LJ_TARGET_X86ORX64\r\ntypedef uint8_t MCode;\r\n#else\r\ntypedef uint32_t MCode;\r\n#endif\r\n\r\n/* Stack snapshot header. */\r\ntypedef struct SnapShot {\r\n  uint16_t mapofs;\t/* Offset into snapshot map. */\r\n  IRRef1 ref;\t\t/* First IR ref for this snapshot. */\r\n  uint8_t nslots;\t/* Number of valid slots. */\r\n  uint8_t topslot;\t/* Maximum frame extent. */\r\n  uint8_t nent;\t\t/* Number of compressed entries. */\r\n  uint8_t count;\t/* Count of taken exits for this snapshot. */\r\n} SnapShot;\r\n\r\n#define SNAPCOUNT_DONE\t255\t/* Already compiled and linked a side trace. */\r\n\r\n/* Compressed snapshot entry. */\r\ntypedef uint32_t SnapEntry;\r\n\r\n#define SNAP_FRAME\t\t0x010000\t/* Frame slot. */\r\n#define SNAP_CONT\t\t0x020000\t/* Continuation slot. */\r\n#define SNAP_NORESTORE\t\t0x040000\t/* No need to restore slot. */\r\n#define SNAP_SOFTFPNUM\t\t0x080000\t/* Soft-float number. */\r\nLJ_STATIC_ASSERT(SNAP_FRAME == TREF_FRAME);\r\nLJ_STATIC_ASSERT(SNAP_CONT == TREF_CONT);\r\n\r\n#define SNAP(slot, flags, ref)\t(((SnapEntry)(slot) << 24) + (flags) + (ref))\r\n#define SNAP_TR(slot, tr) \\\r\n  (((SnapEntry)(slot) << 24) + ((tr) & (TREF_CONT|TREF_FRAME|TREF_REFMASK)))\r\n#define SNAP_MKPC(pc)\t\t((SnapEntry)u32ptr(pc))\r\n#define SNAP_MKFTSZ(ftsz)\t((SnapEntry)(ftsz))\r\n#define snap_ref(sn)\t\t((sn) & 0xffff)\r\n#define snap_slot(sn)\t\t((BCReg)((sn) >> 24))\r\n#define snap_isframe(sn)\t((sn) & SNAP_FRAME)\r\n#define snap_pc(sn)\t\t((const BCIns *)(uintptr_t)(sn))\r\n#define snap_setref(sn, ref)\t(((sn) & (0xffff0000&~SNAP_NORESTORE)) | (ref))\r\n\r\n/* Snapshot and exit numbers. */\r\ntypedef uint32_t SnapNo;\r\ntypedef uint32_t ExitNo;\r\n\r\n/* Trace number. */\r\ntypedef uint32_t TraceNo;\t/* Used to pass around trace numbers. */\r\ntypedef uint16_t TraceNo1;\t/* Stored trace number. */\r\n\r\n/* Type of link. ORDER LJ_TRLINK */\r\ntypedef enum {\r\n  LJ_TRLINK_NONE,\t\t/* Incomplete trace. No link, yet. */\r\n  LJ_TRLINK_ROOT,\t\t/* Link to other root trace. */\r\n  LJ_TRLINK_LOOP,\t\t/* Loop to same trace. */\r\n  LJ_TRLINK_TAILREC,\t\t/* Tail-recursion. */\r\n  LJ_TRLINK_UPREC,\t\t/* Up-recursion. */\r\n  LJ_TRLINK_DOWNREC,\t\t/* Down-recursion. */\r\n  LJ_TRLINK_INTERP,\t\t/* Fallback to interpreter. */\r\n  LJ_TRLINK_RETURN\t\t/* Return to interpreter. */\r\n} TraceLink;\r\n\r\n/* Trace object. */\r\ntypedef struct GCtrace {\r\n  GCHeader;\r\n  uint8_t topslot;\t/* Top stack slot already checked to be allocated. */\r\n  uint8_t linktype;\t/* Type of link. */\r\n  IRRef nins;\t\t/* Next IR instruction. Biased with REF_BIAS. */\r\n  GCRef gclist;\r\n  IRIns *ir;\t\t/* IR instructions/constants. Biased with REF_BIAS. */\r\n  IRRef nk;\t\t/* Lowest IR constant. Biased with REF_BIAS. */\r\n  uint16_t nsnap;\t/* Number of snapshots. */\r\n  uint16_t nsnapmap;\t/* Number of snapshot map elements. */\r\n  SnapShot *snap;\t/* Snapshot array. */\r\n  SnapEntry *snapmap;\t/* Snapshot map. */\r\n  GCRef startpt;\t/* Starting prototype. */\r\n  MRef startpc;\t\t/* Bytecode PC of starting instruction. */\r\n  BCIns startins;\t/* Original bytecode of starting instruction. */\r\n  MSize szmcode;\t/* Size of machine code. */\r\n  MCode *mcode;\t\t/* Start of machine code. */\r\n  MSize mcloop;\t\t/* Offset of loop start in machine code. */\r\n  uint16_t nchild;\t/* Number of child traces (root trace only). */\r\n  uint16_t spadjust;\t/* Stack pointer adjustment (offset in bytes). */\r\n  TraceNo1 traceno;\t/* Trace number. */\r\n  TraceNo1 link;\t/* Linked trace (or self for loops). */\r\n  TraceNo1 root;\t/* Root trace of side trace (or 0 for root traces). */\r\n  TraceNo1 nextroot;\t/* Next root trace for same prototype. */\r\n  TraceNo1 nextside;\t/* Next side trace of same root trace. */\r\n  uint8_t sinktags;\t/* Trace has SINK tags. */\r\n  uint8_t unused1;\r\n#ifdef LUAJIT_USE_GDBJIT\r\n  void *gdbjit_entry;\t/* GDB JIT entry. */\r\n#endif\r\n} GCtrace;\r\n\r\n#define gco2trace(o)\tcheck_exp((o)->gch.gct == ~LJ_TTRACE, (GCtrace *)(o))\r\n#define traceref(J, n) \\\r\n  check_exp((n)>0 && (MSize)(n)<J->sizetrace, (GCtrace *)gcref(J->trace[(n)]))\r\n\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCtrace, gclist));\r\n\r\nstatic LJ_AINLINE MSize snap_nextofs(GCtrace *T, SnapShot *snap)\r\n{\r\n  if (snap+1 == &T->snap[T->nsnap])\r\n    return T->nsnapmap;\r\n  else\r\n    return (snap+1)->mapofs;\r\n}\r\n\r\n/* Round-robin penalty cache for bytecodes leading to aborted traces. */\r\ntypedef struct HotPenalty {\r\n  MRef pc;\t\t/* Starting bytecode PC. */\r\n  uint16_t val;\t\t/* Penalty value, i.e. hotcount start. */\r\n  uint16_t reason;\t/* Abort reason (really TraceErr). */\r\n} HotPenalty;\r\n\r\n#define PENALTY_SLOTS\t64\t/* Penalty cache slot. Must be a power of 2. */\r\n#define PENALTY_MIN\t(36*2)\t/* Minimum penalty value. */\r\n#define PENALTY_MAX\t60000\t/* Maximum penalty value. */\r\n#define PENALTY_RNDBITS\t4\t/* # of random bits to add to penalty value. */\r\n\r\n/* Round-robin backpropagation cache for narrowing conversions. */\r\ntypedef struct BPropEntry {\r\n  IRRef1 key;\t\t/* Key: original reference. */\r\n  IRRef1 val;\t\t/* Value: reference after conversion. */\r\n  IRRef mode;\t\t/* Mode for this entry (currently IRCONV_*). */\r\n} BPropEntry;\r\n\r\n/* Number of slots for the backpropagation cache. Must be a power of 2. */\r\n#define BPROP_SLOTS\t16\r\n\r\n/* Scalar evolution analysis cache. */\r\ntypedef struct ScEvEntry {\r\n  MRef pc;\t\t/* Bytecode PC of FORI. */\r\n  IRRef1 idx;\t\t/* Index reference. */\r\n  IRRef1 start;\t\t/* Constant start reference. */\r\n  IRRef1 stop;\t\t/* Constant stop reference. */\r\n  IRRef1 step;\t\t/* Constant step reference. */\r\n  IRType1 t;\t\t/* Scalar type. */\r\n  uint8_t dir;\t\t/* Direction. 1: +, 0: -. */\r\n} ScEvEntry;\r\n\r\n/* 128 bit SIMD constants. */\r\nenum {\r\n  LJ_KSIMD_ABS,\r\n  LJ_KSIMD_NEG,\r\n  LJ_KSIMD__MAX\r\n};\r\n\r\n/* Get 16 byte aligned pointer to SIMD constant. */\r\n#define LJ_KSIMD(J, n) \\\r\n  ((TValue *)(((intptr_t)&J->ksimd[2*(n)] + 15) & ~(intptr_t)15))\r\n\r\n/* Set/reset flag to activate the SPLIT pass for the current trace. */\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n#define lj_needsplit(J)\t\t(J->needsplit = 1)\r\n#define lj_resetsplit(J)\t(J->needsplit = 0)\r\n#else\r\n#define lj_needsplit(J)\t\tUNUSED(J)\r\n#define lj_resetsplit(J)\tUNUSED(J)\r\n#endif\r\n\r\n/* Fold state is used to fold instructions on-the-fly. */\r\ntypedef struct FoldState {\r\n  IRIns ins;\t\t/* Currently emitted instruction. */\r\n  IRIns left;\t\t/* Instruction referenced by left operand. */\r\n  IRIns right;\t\t/* Instruction referenced by right operand. */\r\n} FoldState;\r\n\r\n/* JIT compiler state. */\r\ntypedef struct jit_State {\r\n  GCtrace cur;\t\t/* Current trace. */\r\n\r\n  lua_State *L;\t\t/* Current Lua state. */\r\n  const BCIns *pc;\t/* Current PC. */\r\n  GCfunc *fn;\t\t/* Current function. */\r\n  GCproto *pt;\t\t/* Current prototype. */\r\n  TRef *base;\t\t/* Current frame base, points into J->slots. */\r\n\r\n  uint32_t flags;\t/* JIT engine flags. */\r\n  BCReg maxslot;\t/* Relative to baseslot. */\r\n  BCReg baseslot;\t/* Current frame base, offset into J->slots. */\r\n\r\n  uint8_t mergesnap;\t/* Allowed to merge with next snapshot. */\r\n  uint8_t needsnap;\t/* Need snapshot before recording next bytecode. */\r\n  IRType1 guardemit;\t/* Accumulated IRT_GUARD for emitted instructions. */\r\n  uint8_t bcskip;\t/* Number of bytecode instructions to skip. */\r\n\r\n  FoldState fold;\t/* Fold state. */\r\n\r\n  const BCIns *bc_min;\t/* Start of allowed bytecode range for root trace. */\r\n  MSize bc_extent;\t/* Extent of the range. */\r\n\r\n  TraceState state;\t/* Trace compiler state. */\r\n\r\n  int32_t instunroll;\t/* Unroll counter for instable loops. */\r\n  int32_t loopunroll;\t/* Unroll counter for loop ops in side traces. */\r\n  int32_t tailcalled;\t/* Number of successive tailcalls. */\r\n  int32_t framedepth;\t/* Current frame depth. */\r\n  int32_t retdepth;\t/* Return frame depth (count of RETF). */\r\n\r\n  MRef k64;\t\t/* Pointer to chained array of 64 bit constants. */\r\n  TValue ksimd[LJ_KSIMD__MAX*2+1];  /* 16 byte aligned SIMD constants. */\r\n\r\n  IRIns *irbuf;\t\t/* Temp. IR instruction buffer. Biased with REF_BIAS. */\r\n  IRRef irtoplim;\t/* Upper limit of instuction buffer (biased). */\r\n  IRRef irbotlim;\t/* Lower limit of instuction buffer (biased). */\r\n  IRRef loopref;\t/* Last loop reference or ref of final LOOP (or 0). */\r\n\r\n  MSize sizesnap;\t/* Size of temp. snapshot buffer. */\r\n  SnapShot *snapbuf;\t/* Temp. snapshot buffer. */\r\n  SnapEntry *snapmapbuf;  /* Temp. snapshot map buffer. */\r\n  MSize sizesnapmap;\t/* Size of temp. snapshot map buffer. */\r\n\r\n  PostProc postproc;\t/* Required post-processing after execution. */\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n  int needsplit;\t/* Need SPLIT pass. */\r\n#endif\r\n\r\n  GCRef *trace;\t\t/* Array of traces. */\r\n  TraceNo freetrace;\t/* Start of scan for next free trace. */\r\n  MSize sizetrace;\t/* Size of trace array. */\r\n\r\n  IRRef1 chain[IR__MAX];  /* IR instruction skip-list chain anchors. */\r\n  TRef slot[LJ_MAX_JSLOTS+LJ_STACK_EXTRA];  /* Stack slot map. */\r\n\r\n  int32_t param[JIT_P__MAX];  /* JIT engine parameters. */\r\n\r\n  MCode *exitstubgroup[LJ_MAX_EXITSTUBGR];  /* Exit stub group addresses. */\r\n\r\n  HotPenalty penalty[PENALTY_SLOTS];  /* Penalty slots. */\r\n  uint32_t penaltyslot;\t/* Round-robin index into penalty slots. */\r\n  uint32_t prngstate;\t/* PRNG state. */\r\n\r\n  BPropEntry bpropcache[BPROP_SLOTS];  /* Backpropagation cache slots. */\r\n  uint32_t bpropslot;\t/* Round-robin index into bpropcache slots. */\r\n\r\n  ScEvEntry scev;\t/* Scalar evolution analysis cache slots. */\r\n\r\n  const BCIns *startpc;\t/* Bytecode PC of starting instruction. */\r\n  TraceNo parent;\t/* Parent of current side trace (0 for root traces). */\r\n  ExitNo exitno;\t/* Exit number in parent of current side trace. */\r\n\r\n  BCIns *patchpc;\t/* PC for pending re-patch. */\r\n  BCIns patchins;\t/* Instruction for pending re-patch. */\r\n\r\n  int mcprot;\t\t/* Protection of current mcode area. */\r\n  MCode *mcarea;\t/* Base of current mcode area. */\r\n  MCode *mctop;\t\t/* Top of current mcode area. */\r\n  MCode *mcbot;\t\t/* Bottom of current mcode area. */\r\n  size_t szmcarea;\t/* Size of current mcode area. */\r\n  size_t szallmcarea;\t/* Total size of all allocated mcode areas. */\r\n\r\n  TValue errinfo;\t/* Additional info element for trace errors. */\r\n}\r\n#if LJ_TARGET_ARM\r\nLJ_ALIGN(16)\t\t/* For DISPATCH-relative addresses in assembler part. */\r\n#endif\r\njit_State;\r\n\r\n/* Trivial PRNG e.g. used for penalty randomization. */\r\nstatic LJ_AINLINE uint32_t LJ_PRNG_BITS(jit_State *J, int bits)\r\n{\r\n  /* Yes, this LCG is very weak, but that doesn't matter for our use case. */\r\n  J->prngstate = J->prngstate * 1103515245 + 12345;\r\n  return J->prngstate >> (32-bits);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_lex.c",
    "content": "/*\r\n** Lexical analyzer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_lex_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lualib.h\"\r\n#endif\r\n#include \"lj_state.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_parse.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* Lua lexer token names. */\r\nstatic const char *const tokennames[] = {\r\n#define TKSTR1(name)\t\t#name,\r\n#define TKSTR2(name, sym)\t#sym,\r\nTKDEF(TKSTR1, TKSTR2)\r\n#undef TKSTR1\r\n#undef TKSTR2\r\n  NULL\r\n};\r\n\r\n/* -- Buffer handling ----------------------------------------------------- */\r\n\r\n#define char2int(c)\t\t((int)(uint8_t)(c))\r\n#define next(ls) \\\r\n  (ls->current = (ls->n--) > 0 ? char2int(*ls->p++) : fillbuf(ls))\r\n#define save_and_next(ls)\t(save(ls, ls->current), next(ls))\r\n#define currIsNewline(ls)\t(ls->current == '\\n' || ls->current == '\\r')\r\n#define END_OF_STREAM\t\t(-1)\r\n\r\nstatic int fillbuf(LexState *ls)\r\n{\r\n  size_t sz;\r\n  const char *buf = ls->rfunc(ls->L, ls->rdata, &sz);\r\n  if (buf == NULL || sz == 0) return END_OF_STREAM;\r\n  ls->n = (MSize)sz - 1;\r\n  ls->p = buf;\r\n  return char2int(*(ls->p++));\r\n}\r\n\r\nstatic LJ_NOINLINE void save_grow(LexState *ls, int c)\r\n{\r\n  MSize newsize;\r\n  if (ls->sb.sz >= LJ_MAX_STR/2)\r\n    lj_lex_error(ls, 0, LJ_ERR_XELEM);\r\n  newsize = ls->sb.sz * 2;\r\n  lj_str_resizebuf(ls->L, &ls->sb, newsize);\r\n  ls->sb.buf[ls->sb.n++] = (char)c;\r\n}\r\n\r\nstatic LJ_AINLINE void save(LexState *ls, int c)\r\n{\r\n  if (LJ_UNLIKELY(ls->sb.n + 1 > ls->sb.sz))\r\n    save_grow(ls, c);\r\n  else\r\n    ls->sb.buf[ls->sb.n++] = (char)c;\r\n}\r\n\r\nstatic void inclinenumber(LexState *ls)\r\n{\r\n  int old = ls->current;\r\n  lua_assert(currIsNewline(ls));\r\n  next(ls);  /* skip `\\n' or `\\r' */\r\n  if (currIsNewline(ls) && ls->current != old)\r\n    next(ls);  /* skip `\\n\\r' or `\\r\\n' */\r\n  if (++ls->linenumber >= LJ_MAX_LINE)\r\n    lj_lex_error(ls, ls->token, LJ_ERR_XLINES);\r\n}\r\n\r\n/* -- Scanner for terminals ----------------------------------------------- */\r\n\r\n/* Parse a number literal. */\r\nstatic void lex_number(LexState *ls, TValue *tv)\r\n{\r\n  StrScanFmt fmt;\r\n  int c, xp = 'e';\r\n  lua_assert(lj_char_isdigit(ls->current));\r\n  if ((c = ls->current) == '0') {\r\n    save_and_next(ls);\r\n    if ((ls->current | 0x20) == 'x') xp = 'p';\r\n  }\r\n  while (lj_char_isident(ls->current) || ls->current == '.' ||\r\n\t ((ls->current == '-' || ls->current == '+') && (c | 0x20) == xp)) {\r\n    c = ls->current;\r\n    save_and_next(ls);\r\n  }\r\n  save(ls, '\\0');\r\n  fmt = lj_strscan_scan((const uint8_t *)ls->sb.buf, tv,\r\n\t  (LJ_DUALNUM ? STRSCAN_OPT_TOINT : STRSCAN_OPT_TONUM) |\r\n\t  (LJ_HASFFI ? (STRSCAN_OPT_LL|STRSCAN_OPT_IMAG) : 0));\r\n  if (LJ_DUALNUM && fmt == STRSCAN_INT) {\r\n    setitype(tv, LJ_TISNUM);\r\n  } else if (fmt == STRSCAN_NUM) {\r\n    /* Already in correct format. */\r\n#if LJ_HASFFI\r\n  } else if (fmt != STRSCAN_ERROR) {\r\n    lua_State *L = ls->L;\r\n    GCcdata *cd;\r\n    lua_assert(fmt == STRSCAN_I64 || fmt == STRSCAN_U64 || fmt == STRSCAN_IMAG);\r\n    if (!ctype_ctsG(G(L))) {\r\n      ptrdiff_t oldtop = savestack(L, L->top);\r\n      luaopen_ffi(L);  /* Load FFI library on-demand. */\r\n      L->top = restorestack(L, oldtop);\r\n    }\r\n    if (fmt == STRSCAN_IMAG) {\r\n      cd = lj_cdata_new_(L, CTID_COMPLEX_DOUBLE, 2*sizeof(double));\r\n      ((double *)cdataptr(cd))[0] = 0;\r\n      ((double *)cdataptr(cd))[1] = numV(tv);\r\n    } else {\r\n      cd = lj_cdata_new_(L, fmt==STRSCAN_I64 ? CTID_INT64 : CTID_UINT64, 8);\r\n      *(uint64_t *)cdataptr(cd) = tv->u64;\r\n    }\r\n    lj_parse_keepcdata(ls, tv, cd);\r\n#endif\r\n  } else {\r\n    lua_assert(fmt == STRSCAN_ERROR);\r\n    lj_lex_error(ls, TK_number, LJ_ERR_XNUMBER);\r\n  }\r\n}\r\n\r\nstatic int skip_sep(LexState *ls)\r\n{\r\n  int count = 0;\r\n  int s = ls->current;\r\n  lua_assert(s == '[' || s == ']');\r\n  save_and_next(ls);\r\n  while (ls->current == '=') {\r\n    save_and_next(ls);\r\n    count++;\r\n  }\r\n  return (ls->current == s) ? count : (-count) - 1;\r\n}\r\n\r\nstatic void read_long_string(LexState *ls, TValue *tv, int sep)\r\n{\r\n  save_and_next(ls);  /* skip 2nd `[' */\r\n  if (currIsNewline(ls))  /* string starts with a newline? */\r\n    inclinenumber(ls);  /* skip it */\r\n  for (;;) {\r\n    switch (ls->current) {\r\n    case END_OF_STREAM:\r\n      lj_lex_error(ls, TK_eof, tv ? LJ_ERR_XLSTR : LJ_ERR_XLCOM);\r\n      break;\r\n    case ']':\r\n      if (skip_sep(ls) == sep) {\r\n\tsave_and_next(ls);  /* skip 2nd `]' */\r\n\tgoto endloop;\r\n      }\r\n      break;\r\n    case '\\n':\r\n    case '\\r':\r\n      save(ls, '\\n');\r\n      inclinenumber(ls);\r\n      if (!tv) lj_str_resetbuf(&ls->sb);  /* avoid wasting space */\r\n      break;\r\n    default:\r\n      if (tv) save_and_next(ls);\r\n      else next(ls);\r\n      break;\r\n    }\r\n  } endloop:\r\n  if (tv) {\r\n    GCstr *str = lj_parse_keepstr(ls, ls->sb.buf + (2 + (MSize)sep),\r\n\t\t\t\t      ls->sb.n - 2*(2 + (MSize)sep));\r\n    setstrV(ls->L, tv, str);\r\n  }\r\n}\r\n\r\nstatic void read_string(LexState *ls, int delim, TValue *tv)\r\n{\r\n  save_and_next(ls);\r\n  while (ls->current != delim) {\r\n    switch (ls->current) {\r\n    case END_OF_STREAM:\r\n      lj_lex_error(ls, TK_eof, LJ_ERR_XSTR);\r\n      continue;\r\n    case '\\n':\r\n    case '\\r':\r\n      lj_lex_error(ls, TK_string, LJ_ERR_XSTR);\r\n      continue;\r\n    case '\\\\': {\r\n      int c = next(ls);  /* Skip the '\\\\'. */\r\n      switch (c) {\r\n      case 'a': c = '\\a'; break;\r\n      case 'b': c = '\\b'; break;\r\n      case 'f': c = '\\f'; break;\r\n      case 'n': c = '\\n'; break;\r\n      case 'r': c = '\\r'; break;\r\n      case 't': c = '\\t'; break;\r\n      case 'v': c = '\\v'; break;\r\n      case 'x':  /* Hexadecimal escape '\\xXX'. */\r\n\tc = (next(ls) & 15u) << 4;\r\n\tif (!lj_char_isdigit(ls->current)) {\r\n\t  if (!lj_char_isxdigit(ls->current)) goto err_xesc;\r\n\t  c += 9 << 4;\r\n\t}\r\n\tc += (next(ls) & 15u);\r\n\tif (!lj_char_isdigit(ls->current)) {\r\n\t  if (!lj_char_isxdigit(ls->current)) goto err_xesc;\r\n\t  c += 9;\r\n\t}\r\n\tbreak;\r\n      case 'z':  /* Skip whitespace. */\r\n\tnext(ls);\r\n\twhile (lj_char_isspace(ls->current))\r\n\t  if (currIsNewline(ls)) inclinenumber(ls); else next(ls);\r\n\tcontinue;\r\n      case '\\n': case '\\r': save(ls, '\\n'); inclinenumber(ls); continue;\r\n      case '\\\\': case '\\\"': case '\\'': break;\r\n      case END_OF_STREAM: continue;\r\n      default:\r\n\tif (!lj_char_isdigit(c))\r\n\t  goto err_xesc;\r\n\tc -= '0';  /* Decimal escape '\\ddd'. */\r\n\tif (lj_char_isdigit(next(ls))) {\r\n\t  c = c*10 + (ls->current - '0');\r\n\t  if (lj_char_isdigit(next(ls))) {\r\n\t    c = c*10 + (ls->current - '0');\r\n\t    if (c > 255) {\r\n\t    err_xesc:\r\n\t      lj_lex_error(ls, TK_string, LJ_ERR_XESC);\r\n\t    }\r\n\t    next(ls);\r\n\t  }\r\n\t}\r\n\tsave(ls, c);\r\n\tcontinue;\r\n      }\r\n      save(ls, c);\r\n      next(ls);\r\n      continue;\r\n      }\r\n    default:\r\n      save_and_next(ls);\r\n      break;\r\n    }\r\n  }\r\n  save_and_next(ls);  /* skip delimiter */\r\n  setstrV(ls->L, tv, lj_parse_keepstr(ls, ls->sb.buf + 1, ls->sb.n - 2));\r\n}\r\n\r\n/* -- Main lexical scanner ------------------------------------------------ */\r\n\r\nstatic int llex(LexState *ls, TValue *tv)\r\n{\r\n  lj_str_resetbuf(&ls->sb);\r\n  for (;;) {\r\n    if (lj_char_isident(ls->current)) {\r\n      GCstr *s;\r\n      if (lj_char_isdigit(ls->current)) {  /* Numeric literal. */\r\n\tlex_number(ls, tv);\r\n\treturn TK_number;\r\n      }\r\n      /* Identifier or reserved word. */\r\n      do {\r\n\tsave_and_next(ls);\r\n      } while (lj_char_isident(ls->current));\r\n      s = lj_parse_keepstr(ls, ls->sb.buf, ls->sb.n);\r\n      setstrV(ls->L, tv, s);\r\n      if (s->reserved > 0)  /* Reserved word? */\r\n\treturn TK_OFS + s->reserved;\r\n      return TK_name;\r\n    }\r\n    switch (ls->current) {\r\n    case '\\n':\r\n    case '\\r':\r\n      inclinenumber(ls);\r\n      continue;\r\n    case ' ':\r\n    case '\\t':\r\n    case '\\v':\r\n    case '\\f':\r\n      next(ls);\r\n      continue;\r\n    case '-':\r\n      next(ls);\r\n      if (ls->current != '-') return '-';\r\n      /* else is a comment */\r\n      next(ls);\r\n      if (ls->current == '[') {\r\n\tint sep = skip_sep(ls);\r\n\tlj_str_resetbuf(&ls->sb);  /* `skip_sep' may dirty the buffer */\r\n\tif (sep >= 0) {\r\n\t  read_long_string(ls, NULL, sep);  /* long comment */\r\n\t  lj_str_resetbuf(&ls->sb);\r\n\t  continue;\r\n\t}\r\n      }\r\n      /* else short comment */\r\n      while (!currIsNewline(ls) && ls->current != END_OF_STREAM)\r\n\tnext(ls);\r\n      continue;\r\n    case '[': {\r\n      int sep = skip_sep(ls);\r\n      if (sep >= 0) {\r\n\tread_long_string(ls, tv, sep);\r\n\treturn TK_string;\r\n      } else if (sep == -1) {\r\n\treturn '[';\r\n      } else {\r\n\tlj_lex_error(ls, TK_string, LJ_ERR_XLDELIM);\r\n\tcontinue;\r\n      }\r\n      }\r\n    case '=':\r\n      next(ls);\r\n      if (ls->current != '=') return '='; else { next(ls); return TK_eq; }\r\n    case '<':\r\n      next(ls);\r\n      if (ls->current != '=') return '<'; else { next(ls); return TK_le; }\r\n    case '>':\r\n      next(ls);\r\n      if (ls->current != '=') return '>'; else { next(ls); return TK_ge; }\r\n    case '~':\r\n      next(ls);\r\n      if (ls->current != '=') return '~'; else { next(ls); return TK_ne; }\r\n    case ':':\r\n      next(ls);\r\n      if (ls->current != ':') return ':'; else { next(ls); return TK_label; }\r\n    case '\"':\r\n    case '\\'':\r\n      read_string(ls, ls->current, tv);\r\n      return TK_string;\r\n    case '.':\r\n      save_and_next(ls);\r\n      if (ls->current == '.') {\r\n\tnext(ls);\r\n\tif (ls->current == '.') {\r\n\t  next(ls);\r\n\t  return TK_dots;   /* ... */\r\n\t}\r\n\treturn TK_concat;   /* .. */\r\n      } else if (!lj_char_isdigit(ls->current)) {\r\n\treturn '.';\r\n      } else {\r\n\tlex_number(ls, tv);\r\n\treturn TK_number;\r\n      }\r\n    case END_OF_STREAM:\r\n      return TK_eof;\r\n    default: {\r\n      int c = ls->current;\r\n      next(ls);\r\n      return c;  /* Single-char tokens (+ - / ...). */\r\n    }\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Lexer API ----------------------------------------------------------- */\r\n\r\n/* Setup lexer state. */\r\nint lj_lex_setup(lua_State *L, LexState *ls)\r\n{\r\n  int header = 0;\r\n  ls->L = L;\r\n  ls->fs = NULL;\r\n  ls->n = 0;\r\n  ls->p = NULL;\r\n  ls->vstack = NULL;\r\n  ls->sizevstack = 0;\r\n  ls->vtop = 0;\r\n  ls->bcstack = NULL;\r\n  ls->sizebcstack = 0;\r\n  ls->token = 0;\r\n  ls->lookahead = TK_eof;  /* No look-ahead token. */\r\n  ls->linenumber = 1;\r\n  ls->lastline = 1;\r\n  lj_str_resizebuf(ls->L, &ls->sb, LJ_MIN_SBUF);\r\n  next(ls);  /* Read-ahead first char. */\r\n  if (ls->current == 0xef && ls->n >= 2 && char2int(ls->p[0]) == 0xbb &&\r\n      char2int(ls->p[1]) == 0xbf) {  /* Skip UTF-8 BOM (if buffered). */\r\n    ls->n -= 2;\r\n    ls->p += 2;\r\n    next(ls);\r\n    header = 1;\r\n  }\r\n  if (ls->current == '#') {  /* Skip POSIX #! header line. */\r\n    do {\r\n      next(ls);\r\n      if (ls->current == END_OF_STREAM) return 0;\r\n    } while (!currIsNewline(ls));\r\n    inclinenumber(ls);\r\n    header = 1;\r\n  }\r\n  if (ls->current == LUA_SIGNATURE[0]) {  /* Bytecode dump. */\r\n    if (header) {\r\n      /*\r\n      ** Loading bytecode with an extra header is disabled for security\r\n      ** reasons. This may circumvent the usual check for bytecode vs.\r\n      ** Lua code by looking at the first char. Since this is a potential\r\n      ** security violation no attempt is made to echo the chunkname either.\r\n      */\r\n      setstrV(L, L->top++, lj_err_str(L, LJ_ERR_BCBAD));\r\n      lj_err_throw(L, LUA_ERRSYNTAX);\r\n    }\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Cleanup lexer state. */\r\nvoid lj_lex_cleanup(lua_State *L, LexState *ls)\r\n{\r\n  global_State *g = G(L);\r\n  lj_mem_freevec(g, ls->bcstack, ls->sizebcstack, BCInsLine);\r\n  lj_mem_freevec(g, ls->vstack, ls->sizevstack, VarInfo);\r\n  lj_str_freebuf(g, &ls->sb);\r\n}\r\n\r\nvoid lj_lex_next(LexState *ls)\r\n{\r\n  ls->lastline = ls->linenumber;\r\n  if (LJ_LIKELY(ls->lookahead == TK_eof)) {  /* No lookahead token? */\r\n    ls->token = llex(ls, &ls->tokenval);  /* Get next token. */\r\n  } else {  /* Otherwise return lookahead token. */\r\n    ls->token = ls->lookahead;\r\n    ls->lookahead = TK_eof;\r\n    ls->tokenval = ls->lookaheadval;\r\n  }\r\n}\r\n\r\nLexToken lj_lex_lookahead(LexState *ls)\r\n{\r\n  lua_assert(ls->lookahead == TK_eof);\r\n  ls->lookahead = llex(ls, &ls->lookaheadval);\r\n  return ls->lookahead;\r\n}\r\n\r\nconst char *lj_lex_token2str(LexState *ls, LexToken token)\r\n{\r\n  if (token > TK_OFS)\r\n    return tokennames[token-TK_OFS-1];\r\n  else if (!lj_char_iscntrl(token))\r\n    return lj_str_pushf(ls->L, \"%c\", token);\r\n  else\r\n    return lj_str_pushf(ls->L, \"char(%d)\", token);\r\n}\r\n\r\nvoid lj_lex_error(LexState *ls, LexToken token, ErrMsg em, ...)\r\n{\r\n  const char *tok;\r\n  va_list argp;\r\n  if (token == 0) {\r\n    tok = NULL;\r\n  } else if (token == TK_name || token == TK_string || token == TK_number) {\r\n    save(ls, '\\0');\r\n    tok = ls->sb.buf;\r\n  } else {\r\n    tok = lj_lex_token2str(ls, token);\r\n  }\r\n  va_start(argp, em);\r\n  lj_err_lex(ls->L, ls->chunkname, tok, ls->linenumber, em, argp);\r\n  va_end(argp);\r\n}\r\n\r\nvoid lj_lex_init(lua_State *L)\r\n{\r\n  uint32_t i;\r\n  for (i = 0; i < TK_RESERVED; i++) {\r\n    GCstr *s = lj_str_newz(L, tokennames[i]);\r\n    fixstring(s);  /* Reserved words are never collected. */\r\n    s->reserved = (uint8_t)(i+1);\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_lex.h",
    "content": "/*\r\n** Lexical analyzer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_LEX_H\r\n#define _LJ_LEX_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n\r\n/* Lua lexer tokens. */\r\n#define TKDEF(_, __) \\\r\n  _(and) _(break) _(do) _(else) _(elseif) _(end) _(false) \\\r\n  _(for) _(function) _(goto) _(if) _(in) _(local) _(nil) _(not) _(or) \\\r\n  _(repeat) _(return) _(then) _(true) _(until) _(while) \\\r\n  __(concat, ..) __(dots, ...) __(eq, ==) __(ge, >=) __(le, <=) __(ne, ~=) \\\r\n  __(label, ::) __(number, <number>) __(name, <name>) __(string, <string>) \\\r\n  __(eof, <eof>)\r\n\r\nenum {\r\n  TK_OFS = 256,\r\n#define TKENUM1(name)\t\tTK_##name,\r\n#define TKENUM2(name, sym)\tTK_##name,\r\nTKDEF(TKENUM1, TKENUM2)\r\n#undef TKENUM1\r\n#undef TKENUM2\r\n  TK_RESERVED = TK_while - TK_OFS\r\n};\r\n\r\ntypedef int LexToken;\r\n\r\n/* Combined bytecode ins/line. Only used during bytecode generation. */\r\ntypedef struct BCInsLine {\r\n  BCIns ins;\t\t/* Bytecode instruction. */\r\n  BCLine line;\t\t/* Line number for this bytecode. */\r\n} BCInsLine;\r\n\r\n/* Info for local variables. Only used during bytecode generation. */\r\ntypedef struct VarInfo {\r\n  GCRef name;\t\t/* Local variable name or goto/label name. */\r\n  BCPos startpc;\t/* First point where the local variable is active. */\r\n  BCPos endpc;\t\t/* First point where the local variable is dead. */\r\n  uint8_t slot;\t\t/* Variable slot. */\r\n  uint8_t info;\t\t/* Variable/goto/label info. */\r\n} VarInfo;\r\n\r\n/* Lua lexer state. */\r\ntypedef struct LexState {\r\n  struct FuncState *fs;\t/* Current FuncState. Defined in lj_parse.c. */\r\n  struct lua_State *L;\t/* Lua state. */\r\n  TValue tokenval;\t/* Current token value. */\r\n  TValue lookaheadval;\t/* Lookahead token value. */\r\n  int current;\t\t/* Current character (charint). */\r\n  LexToken token;\t/* Current token. */\r\n  LexToken lookahead;\t/* Lookahead token. */\r\n  MSize n;\t\t/* Bytes left in input buffer. */\r\n  const char *p;\t/* Current position in input buffer. */\r\n  SBuf sb;\t\t/* String buffer for tokens. */\r\n  lua_Reader rfunc;\t/* Reader callback. */\r\n  void *rdata;\t\t/* Reader callback data. */\r\n  BCLine linenumber;\t/* Input line counter. */\r\n  BCLine lastline;\t/* Line of last token. */\r\n  GCstr *chunkname;\t/* Current chunk name (interned string). */\r\n  const char *chunkarg;\t/* Chunk name argument. */\r\n  const char *mode;\t/* Allow loading bytecode (b) and/or source text (t). */\r\n  VarInfo *vstack;\t/* Stack for names and extents of local variables. */\r\n  MSize sizevstack;\t/* Size of variable stack. */\r\n  MSize vtop;\t\t/* Top of variable stack. */\r\n  BCInsLine *bcstack;\t/* Stack for bytecode instructions/line numbers. */\r\n  MSize sizebcstack;\t/* Size of bytecode stack. */\r\n  uint32_t level;\t/* Syntactical nesting level. */\r\n} LexState;\r\n\r\nLJ_FUNC int lj_lex_setup(lua_State *L, LexState *ls);\r\nLJ_FUNC void lj_lex_cleanup(lua_State *L, LexState *ls);\r\nLJ_FUNC void lj_lex_next(LexState *ls);\r\nLJ_FUNC LexToken lj_lex_lookahead(LexState *ls);\r\nLJ_FUNC const char *lj_lex_token2str(LexState *ls, LexToken token);\r\nLJ_FUNC_NORET void lj_lex_error(LexState *ls, LexToken token, ErrMsg em, ...);\r\nLJ_FUNC void lj_lex_init(lua_State *L);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_lib.c",
    "content": "/*\r\n** Library function support.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_lib_c\r\n#define LUA_CORE\r\n\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- Library initialization ---------------------------------------------- */\r\n\r\nstatic GCtab *lib_create_table(lua_State *L, const char *libname, int hsize)\r\n{\r\n  if (libname) {\r\n    luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n    lua_getfield(L, -1, libname);\r\n    if (!tvistab(L->top-1)) {\r\n      L->top--;\r\n      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, hsize) != NULL)\r\n\tlj_err_callerv(L, LJ_ERR_BADMODN, libname);\r\n      settabV(L, L->top, tabV(L->top-1));\r\n      L->top++;\r\n      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */\r\n    }\r\n    L->top--;\r\n    settabV(L, L->top-1, tabV(L->top));\r\n  } else {\r\n    lua_createtable(L, 0, hsize);\r\n  }\r\n  return tabV(L->top-1);\r\n}\r\n\r\nvoid lj_lib_register(lua_State *L, const char *libname,\r\n\t\t     const uint8_t *p, const lua_CFunction *cf)\r\n{\r\n  GCtab *env = tabref(L->env);\r\n  GCfunc *ofn = NULL;\r\n  int ffid = *p++;\r\n  BCIns *bcff = &L2GG(L)->bcff[*p++];\r\n  GCtab *tab = lib_create_table(L, libname, *p++);\r\n  ptrdiff_t tpos = L->top - L->base;\r\n\r\n  /* Avoid barriers further down. */\r\n  lj_gc_anybarriert(L, tab);\r\n  tab->nomm = 0;\r\n\r\n  for (;;) {\r\n    uint32_t tag = *p++;\r\n    MSize len = tag & LIBINIT_LENMASK;\r\n    tag &= LIBINIT_TAGMASK;\r\n    if (tag != LIBINIT_STRING) {\r\n      const char *name;\r\n      MSize nuv = (MSize)(L->top - L->base - tpos);\r\n      GCfunc *fn = lj_func_newC(L, nuv, env);\r\n      if (nuv) {\r\n\tL->top = L->base + tpos;\r\n\tmemcpy(fn->c.upvalue, L->top, sizeof(TValue)*nuv);\r\n      }\r\n      fn->c.ffid = (uint8_t)(ffid++);\r\n      name = (const char *)p;\r\n      p += len;\r\n      if (tag == LIBINIT_CF)\r\n\tsetmref(fn->c.pc, &G(L)->bc_cfunc_int);\r\n      else\r\n\tsetmref(fn->c.pc, bcff++);\r\n      if (tag == LIBINIT_ASM_)\r\n\tfn->c.f = ofn->c.f;  /* Copy handler from previous function. */\r\n      else\r\n\tfn->c.f = *cf++;  /* Get cf or handler from C function table. */\r\n      if (len) {\r\n\t/* NOBARRIER: See above for common barrier. */\r\n\tsetfuncV(L, lj_tab_setstr(L, tab, lj_str_new(L, name, len)), fn);\r\n      }\r\n      ofn = fn;\r\n    } else {\r\n      switch (tag | len) {\r\n      case LIBINIT_SET:\r\n\tL->top -= 2;\r\n\tif (tvisstr(L->top+1) && strV(L->top+1)->len == 0)\r\n\t  env = tabV(L->top);\r\n\telse  /* NOBARRIER: See above for common barrier. */\r\n\t  copyTV(L, lj_tab_set(L, tab, L->top+1), L->top);\r\n\tbreak;\r\n      case LIBINIT_NUMBER:\r\n\tmemcpy(&L->top->n, p, sizeof(double));\r\n\tL->top++;\r\n\tp += sizeof(double);\r\n\tbreak;\r\n      case LIBINIT_COPY:\r\n\tcopyTV(L, L->top, L->top - *p++);\r\n\tL->top++;\r\n\tbreak;\r\n      case LIBINIT_LASTCL:\r\n\tsetfuncV(L, L->top++, ofn);\r\n\tbreak;\r\n      case LIBINIT_FFID:\r\n\tffid++;\r\n\tbreak;\r\n      case LIBINIT_END:\r\n\treturn;\r\n      default:\r\n\tsetstrV(L, L->top++, lj_str_new(L, (const char *)p, len));\r\n\tp += len;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Type checks --------------------------------------------------------- */\r\n\r\nTValue *lj_lib_checkany(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  return o;\r\n}\r\n\r\nGCstr *lj_lib_checkstr(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o < L->top) {\r\n    if (LJ_LIKELY(tvisstr(o))) {\r\n      return strV(o);\r\n    } else if (tvisnumber(o)) {\r\n      GCstr *s = lj_str_fromnumber(L, o);\r\n      setstrV(L, o, s);\r\n      return s;\r\n    }\r\n  }\r\n  lj_err_argt(L, narg, LUA_TSTRING);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nGCstr *lj_lib_optstr(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  return (o < L->top && !tvisnil(o)) ? lj_lib_checkstr(L, narg) : NULL;\r\n}\r\n\r\n#if LJ_DUALNUM\r\nvoid lj_lib_checknumber(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n}\r\n#endif\r\n\r\nlua_Number lj_lib_checknum(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top &&\r\n\t(tvisnumber(o) || (tvisstr(o) && lj_strscan_num(strV(o), o)))))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_UNLIKELY(tvisint(o))) {\r\n    lua_Number n = (lua_Number)intV(o);\r\n    setnumV(o, n);\r\n    return n;\r\n  } else {\r\n    return numV(o);\r\n  }\r\n}\r\n\r\nint32_t lj_lib_checkint(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else {\r\n    int32_t i = lj_num2int(numV(o));\r\n    if (LJ_DUALNUM) setintV(o, i);\r\n    return i;\r\n  }\r\n}\r\n\r\nint32_t lj_lib_optint(lua_State *L, int narg, int32_t def)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  return (o < L->top && !tvisnil(o)) ? lj_lib_checkint(L, narg) : def;\r\n}\r\n\r\nint32_t lj_lib_checkbit(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else {\r\n    int32_t i = lj_num2bit(numV(o));\r\n    if (LJ_DUALNUM) setintV(o, i);\r\n    return i;\r\n  }\r\n}\r\n\r\nGCfunc *lj_lib_checkfunc(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tvisfunc(o)))\r\n    lj_err_argt(L, narg, LUA_TFUNCTION);\r\n  return funcV(o);\r\n}\r\n\r\nGCtab *lj_lib_checktab(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tvistab(o)))\r\n    lj_err_argt(L, narg, LUA_TTABLE);\r\n  return tabV(o);\r\n}\r\n\r\nGCtab *lj_lib_checktabornil(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o < L->top) {\r\n    if (tvistab(o))\r\n      return tabV(o);\r\n    else if (tvisnil(o))\r\n      return NULL;\r\n  }\r\n  lj_err_arg(L, narg, LJ_ERR_NOTABN);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nint lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst)\r\n{\r\n  GCstr *s = def >= 0 ? lj_lib_optstr(L, narg) : lj_lib_checkstr(L, narg);\r\n  if (s) {\r\n    const char *opt = strdata(s);\r\n    MSize len = s->len;\r\n    int i;\r\n    for (i = 0; *(const uint8_t *)lst; i++) {\r\n      if (*(const uint8_t *)lst == len && memcmp(opt, lst+1, len) == 0)\r\n\treturn i;\r\n      lst += 1+*(const uint8_t *)lst;\r\n    }\r\n    lj_err_argv(L, narg, LJ_ERR_INVOPTM, opt);\r\n  }\r\n  return def;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_lib.h",
    "content": "/*\r\n** Library function support.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_LIB_H\r\n#define _LJ_LIB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/*\r\n** A fallback handler is called by the assembler VM if the fast path fails:\r\n**\r\n** - too few arguments:   unrecoverable.\r\n** - wrong argument type:   recoverable, if coercion succeeds.\r\n** - bad argument value:  unrecoverable.\r\n** - stack overflow:        recoverable, if stack reallocation succeeds.\r\n** - extra handling:        recoverable.\r\n**\r\n** The unrecoverable cases throw an error with lj_err_arg(), lj_err_argtype(),\r\n** lj_err_caller() or lj_err_callermsg().\r\n** The recoverable cases return 0 or the number of results + 1.\r\n** The assembler VM retries the fast path only if 0 is returned.\r\n** This time the fallback must not be called again or it gets stuck in a loop.\r\n*/\r\n\r\n/* Return values from fallback handler. */\r\n#define FFH_RETRY\t0\r\n#define FFH_UNREACHABLE\tFFH_RETRY\r\n#define FFH_RES(n)\t((n)+1)\r\n#define FFH_TAILCALL\t(-1)\r\n\r\nLJ_FUNC TValue *lj_lib_checkany(lua_State *L, int narg);\r\nLJ_FUNC GCstr *lj_lib_checkstr(lua_State *L, int narg);\r\nLJ_FUNC GCstr *lj_lib_optstr(lua_State *L, int narg);\r\n#if LJ_DUALNUM\r\nLJ_FUNC void lj_lib_checknumber(lua_State *L, int narg);\r\n#else\r\n#define lj_lib_checknumber(L, narg)\tlj_lib_checknum((L), (narg))\r\n#endif\r\nLJ_FUNC lua_Number lj_lib_checknum(lua_State *L, int narg);\r\nLJ_FUNC int32_t lj_lib_checkint(lua_State *L, int narg);\r\nLJ_FUNC int32_t lj_lib_optint(lua_State *L, int narg, int32_t def);\r\nLJ_FUNC int32_t lj_lib_checkbit(lua_State *L, int narg);\r\nLJ_FUNC GCfunc *lj_lib_checkfunc(lua_State *L, int narg);\r\nLJ_FUNC GCtab *lj_lib_checktab(lua_State *L, int narg);\r\nLJ_FUNC GCtab *lj_lib_checktabornil(lua_State *L, int narg);\r\nLJ_FUNC int lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst);\r\n\r\n/* Avoid including lj_frame.h. */\r\n#define lj_lib_upvalue(L, n) \\\r\n  (&gcref((L->base-1)->fr.func)->fn.c.upvalue[(n)-1])\r\n\r\n#if LJ_TARGET_WINDOWS\r\n#define lj_lib_checkfpu(L) \\\r\n  do { setnumV(L->top++, (lua_Number)1437217655); \\\r\n    if (lua_tointeger(L, -1) != 1437217655) lj_err_caller(L, LJ_ERR_BADFPU); \\\r\n    L->top--; } while (0)\r\n#else\r\n#define lj_lib_checkfpu(L)\tUNUSED(L)\r\n#endif\r\n\r\n/* Push internal function on the stack. */\r\nstatic LJ_AINLINE void lj_lib_pushcc(lua_State *L, lua_CFunction f,\r\n\t\t\t\t     int id, int n)\r\n{\r\n  GCfunc *fn;\r\n  lua_pushcclosure(L, f, n);\r\n  fn = funcV(L->top-1);\r\n  fn->c.ffid = (uint8_t)id;\r\n  setmref(fn->c.pc, &G(L)->bc_cfunc_int);\r\n}\r\n\r\n#define lj_lib_pushcf(L, fn, id)\t(lj_lib_pushcc(L, (fn), (id), 0))\r\n\r\n/* Library function declarations. Scanned by buildvm. */\r\n#define LJLIB_CF(name)\t\tstatic int lj_cf_##name(lua_State *L)\r\n#define LJLIB_ASM(name)\t\tstatic int lj_ffh_##name(lua_State *L)\r\n#define LJLIB_ASM_(name)\r\n#define LJLIB_SET(name)\r\n#define LJLIB_PUSH(arg)\r\n#define LJLIB_REC(handler)\r\n#define LJLIB_NOREGUV\r\n#define LJLIB_NOREG\r\n\r\n#define LJ_LIB_REG(L, regname, name) \\\r\n  lj_lib_register(L, regname, lj_lib_init_##name, lj_lib_cf_##name)\r\n\r\nLJ_FUNC void lj_lib_register(lua_State *L, const char *libname,\r\n\t\t\t     const uint8_t *init, const lua_CFunction *cf);\r\n\r\n/* Library init data tags. */\r\n#define LIBINIT_LENMASK\t0x3f\r\n#define LIBINIT_TAGMASK\t0xc0\r\n#define LIBINIT_CF\t0x00\r\n#define LIBINIT_ASM\t0x40\r\n#define LIBINIT_ASM_\t0x80\r\n#define LIBINIT_STRING\t0xc0\r\n#define LIBINIT_MAXSTR\t0x39\r\n#define LIBINIT_SET\t0xfa\r\n#define LIBINIT_NUMBER\t0xfb\r\n#define LIBINIT_COPY\t0xfc\r\n#define LIBINIT_LASTCL\t0xfd\r\n#define LIBINIT_FFID\t0xfe\r\n#define LIBINIT_END\t0xff\r\n\r\n/* Exported library functions. */\r\n\r\ntypedef struct RandomState RandomState;\r\nLJ_FUNC uint64_t LJ_FASTCALL lj_math_random_step(RandomState *rs);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_load.c",
    "content": "/*\r\n** Load and dump code.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n\r\n#define lj_load_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_parse.h\"\r\n\r\n/* -- Load Lua source code and bytecode ----------------------------------- */\r\n\r\nstatic TValue *cpparser(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  LexState *ls = (LexState *)ud;\r\n  GCproto *pt;\r\n  GCfunc *fn;\r\n  int bc;\r\n  UNUSED(dummy);\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  bc = lj_lex_setup(L, ls);\r\n  if (ls->mode && !strchr(ls->mode, bc ? 'b' : 't')) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_XMODE));\r\n    lj_err_throw(L, LUA_ERRSYNTAX);\r\n  }\r\n  pt = bc ? lj_bcread(ls) : lj_parse(ls);\r\n  fn = lj_func_newL_empty(L, pt, tabref(L->env));\r\n  /* Don't combine above/below into one statement. */\r\n  setfuncV(L, L->top++, fn);\r\n  return NULL;\r\n}\r\n\r\nLUA_API int lua_loadx(lua_State *L, lua_Reader reader, void *data,\r\n\t\t      const char *chunkname, const char *mode)\r\n{\r\n  LexState ls;\r\n  int status;\r\n  ls.rfunc = reader;\r\n  ls.rdata = data;\r\n  ls.chunkarg = chunkname ? chunkname : \"?\";\r\n  ls.mode = mode;\r\n  lj_str_initbuf(&ls.sb);\r\n  status = lj_vm_cpcall(L, NULL, &ls, cpparser);\r\n  lj_lex_cleanup(L, &ls);\r\n  lj_gc_check(L);\r\n  return status;\r\n}\r\n\r\nLUA_API int lua_load(lua_State *L, lua_Reader reader, void *data,\r\n\t\t     const char *chunkname)\r\n{\r\n  return lua_loadx(L, reader, data, chunkname, NULL);\r\n}\r\n\r\ntypedef struct FileReaderCtx {\r\n  FILE *fp;\r\n  char buf[LUAL_BUFFERSIZE];\r\n} FileReaderCtx;\r\n\r\nstatic const char *reader_file(lua_State *L, void *ud, size_t *size)\r\n{\r\n  FileReaderCtx *ctx = (FileReaderCtx *)ud;\r\n  UNUSED(L);\r\n  if (feof(ctx->fp)) return NULL;\r\n  *size = fread(ctx->buf, 1, sizeof(ctx->buf), ctx->fp);\r\n  return *size > 0 ? ctx->buf : NULL;\r\n}\r\n\r\nLUALIB_API int luaL_loadfilex(lua_State *L, const char *filename,\r\n\t\t\t      const char *mode)\r\n{\r\n  FileReaderCtx ctx;\r\n  int status;\r\n  const char *chunkname;\r\n  if (filename) {\r\n    ctx.fp = fopen(filename, \"rb\");\r\n    if (ctx.fp == NULL) {\r\n      lua_pushfstring(L, \"cannot open %s: %s\", filename, strerror(errno));\r\n      return LUA_ERRFILE;\r\n    }\r\n    chunkname = lua_pushfstring(L, \"@%s\", filename);\r\n  } else {\r\n    ctx.fp = stdin;\r\n    chunkname = \"=stdin\";\r\n  }\r\n  status = lua_loadx(L, reader_file, &ctx, chunkname, mode);\r\n  if (ferror(ctx.fp)) {\r\n    L->top -= filename ? 2 : 1;\r\n    lua_pushfstring(L, \"cannot read %s: %s\", chunkname+1, strerror(errno));\r\n    if (filename)\r\n      fclose(ctx.fp);\r\n    return LUA_ERRFILE;\r\n  }\r\n  if (filename) {\r\n    L->top--;\r\n    copyTV(L, L->top-1, L->top);\r\n    fclose(ctx.fp);\r\n  }\r\n  return status;\r\n}\r\n\r\nLUALIB_API int luaL_loadfile(lua_State *L, const char *filename)\r\n{\r\n  return luaL_loadfilex(L, filename, NULL);\r\n}\r\n\r\ntypedef struct StringReaderCtx {\r\n  const char *str;\r\n  size_t size;\r\n} StringReaderCtx;\r\n\r\nstatic const char *reader_string(lua_State *L, void *ud, size_t *size)\r\n{\r\n  StringReaderCtx *ctx = (StringReaderCtx *)ud;\r\n  UNUSED(L);\r\n  if (ctx->size == 0) return NULL;\r\n  *size = ctx->size;\r\n  ctx->size = 0;\r\n  return ctx->str;\r\n}\r\n\r\nLUALIB_API int luaL_loadbufferx(lua_State *L, const char *buf, size_t size,\r\n\t\t\t\tconst char *name, const char *mode)\r\n{\r\n  StringReaderCtx ctx;\r\n  ctx.str = buf;\r\n  ctx.size = size;\r\n  return lua_loadx(L, reader_string, &ctx, name, mode);\r\n}\r\n\r\nLUALIB_API int luaL_loadbuffer(lua_State *L, const char *buf, size_t size,\r\n\t\t\t       const char *name)\r\n{\r\n  return luaL_loadbufferx(L, buf, size, name, NULL);\r\n}\r\n\r\nLUALIB_API int luaL_loadstring(lua_State *L, const char *s)\r\n{\r\n  return luaL_loadbuffer(L, s, strlen(s), s);\r\n}\r\n\r\n/* -- Dump bytecode ------------------------------------------------------- */\r\n\r\nLUA_API int lua_dump(lua_State *L, lua_Writer writer, void *data)\r\n{\r\n  cTValue *o = L->top-1;\r\n  api_check(L, L->top > L->base);\r\n  if (tvisfunc(o) && isluafunc(funcV(o)))\r\n    return lj_bcwrite(L, funcproto(funcV(o)), writer, data, 0);\r\n  else\r\n    return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_mcode.c",
    "content": "/*\r\n** Machine code management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_mcode_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#endif\r\n#if LJ_HASJIT || LJ_HASFFI\r\n#include \"lj_vm.h\"\r\n#endif\r\n\r\n/* -- OS-specific functions ----------------------------------------------- */\r\n\r\n#if LJ_HASJIT || LJ_HASFFI\r\n\r\n/* Define this if you want to run LuaJIT with Valgrind. */\r\n#ifdef LUAJIT_USE_VALGRIND\r\n#include <valgrind/valgrind.h>\r\n#endif\r\n\r\n#if LJ_TARGET_IOS\r\nvoid sys_icache_invalidate(void *start, size_t len);\r\n#endif\r\n\r\n/* Synchronize data/instruction cache. */\r\nvoid lj_mcode_sync(void *start, void *end)\r\n{\r\n#ifdef LUAJIT_USE_VALGRIND\r\n  VALGRIND_DISCARD_TRANSLATIONS(start, (char *)end-(char *)start);\r\n#endif\r\n#if LJ_TARGET_X86ORX64\r\n  UNUSED(start); UNUSED(end);\r\n#elif LJ_TARGET_IOS\r\n  sys_icache_invalidate(start, (char *)end-(char *)start);\r\n#elif LJ_TARGET_PPC\r\n  lj_vm_cachesync(start, end);\r\n#elif defined(__GNUC__)\r\n  __clear_cache(start, end);\r\n#else\r\n#error \"Missing builtin to flush instruction cache\"\r\n#endif\r\n}\r\n\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#define MCPROT_RW\tPAGE_READWRITE\r\n#define MCPROT_RX\tPAGE_EXECUTE_READ\r\n#define MCPROT_RWX\tPAGE_EXECUTE_READWRITE\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, DWORD prot)\r\n{\r\n  void *p = VirtualAlloc((void *)hint, sz,\r\n\t\t\t MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, prot);\r\n  if (!p && !hint)\r\n    lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n  return p;\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  UNUSED(J); UNUSED(sz);\r\n  VirtualFree(p, 0, MEM_RELEASE);\r\n}\r\n\r\nstatic int mcode_setprot(void *p, size_t sz, DWORD prot)\r\n{\r\n  DWORD oprot;\r\n  return !VirtualProtect(p, sz, prot, &oprot);\r\n}\r\n\r\n#elif LJ_TARGET_POSIX\r\n\r\n#include <sys/mman.h>\r\n\r\n#ifndef MAP_ANONYMOUS\r\n#define MAP_ANONYMOUS\tMAP_ANON\r\n#endif\r\n\r\n#define MCPROT_RW\t(PROT_READ|PROT_WRITE)\r\n#define MCPROT_RX\t(PROT_READ|PROT_EXEC)\r\n#define MCPROT_RWX\t(PROT_READ|PROT_WRITE|PROT_EXEC)\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, int prot)\r\n{\r\n  void *p = mmap((void *)hint, sz, prot, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);\r\n  if (p == MAP_FAILED) {\r\n    if (!hint) lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n    p = NULL;\r\n  }\r\n  return p;\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  UNUSED(J);\r\n  munmap(p, sz);\r\n}\r\n\r\nstatic int mcode_setprot(void *p, size_t sz, int prot)\r\n{\r\n  return mprotect(p, sz, prot);\r\n}\r\n\r\n#elif LJ_64\r\n\r\n#error \"Missing OS support for explicit placement of executable memory\"\r\n\r\n#else\r\n\r\n/* Fallback allocator. This will fail if memory is not executable by default. */\r\n#define LUAJIT_UNPROTECT_MCODE\r\n#define MCPROT_RW\t0\r\n#define MCPROT_RX\t0\r\n#define MCPROT_RWX\t0\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, int prot)\r\n{\r\n  UNUSED(hint); UNUSED(prot);\r\n  return lj_mem_new(J->L, sz);\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  lj_mem_free(J2G(J), p, sz);\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area protection ----------------------------------------------- */\r\n\r\n/* Define this ONLY if page protection twiddling becomes a bottleneck. */\r\n#ifdef LUAJIT_UNPROTECT_MCODE\r\n\r\n/* It's generally considered to be a potential security risk to have\r\n** pages with simultaneous write *and* execute access in a process.\r\n**\r\n** Do not even think about using this mode for server processes or\r\n** apps handling untrusted external data (such as a browser).\r\n**\r\n** The security risk is not in LuaJIT itself -- but if an adversary finds\r\n** any *other* flaw in your C application logic, then any RWX memory page\r\n** simplifies writing an exploit considerably.\r\n*/\r\n#define MCPROT_GEN\tMCPROT_RWX\r\n#define MCPROT_RUN\tMCPROT_RWX\r\n\r\nstatic void mcode_protect(jit_State *J, int prot)\r\n{\r\n  UNUSED(J); UNUSED(prot);\r\n}\r\n\r\n#else\r\n\r\n/* This is the default behaviour and much safer:\r\n**\r\n** Most of the time the memory pages holding machine code are executable,\r\n** but NONE of them is writable.\r\n**\r\n** The current memory area is marked read-write (but NOT executable) only\r\n** during the short time window while the assembler generates machine code.\r\n*/\r\n#define MCPROT_GEN\tMCPROT_RW\r\n#define MCPROT_RUN\tMCPROT_RX\r\n\r\n/* Protection twiddling failed. Probably due to kernel security. */\r\nstatic LJ_NOINLINE void mcode_protfail(jit_State *J)\r\n{\r\n  lua_CFunction panic = J2G(J)->panic;\r\n  if (panic) {\r\n    lua_State *L = J->L;\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_JITPROT));\r\n    panic(L);\r\n  }\r\n}\r\n\r\n/* Change protection of MCode area. */\r\nstatic void mcode_protect(jit_State *J, int prot)\r\n{\r\n  if (J->mcprot != prot) {\r\n    if (LJ_UNLIKELY(mcode_setprot(J->mcarea, J->szmcarea, prot)))\r\n      mcode_protfail(J);\r\n    J->mcprot = prot;\r\n  }\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area allocation ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_X64\r\n#define mcode_validptr(p)\t((p) && (uintptr_t)(p) < (uintptr_t)1<<47)\r\n#else\r\n#define mcode_validptr(p)\t((p) && (uintptr_t)(p) < 0xffff0000)\r\n#endif\r\n\r\n#ifdef LJ_TARGET_JUMPRANGE\r\n\r\n/* Get memory within relative jump distance of our code in 64 bit mode. */\r\nstatic void *mcode_alloc(jit_State *J, size_t sz)\r\n{\r\n  /* Target an address in the static assembler code (64K aligned).\r\n  ** Try addresses within a distance of target-range/2+1MB..target+range/2-1MB.\r\n  ** Use half the jump range so every address in the range can reach any other.\r\n  */\r\n#if LJ_TARGET_MIPS\r\n  /* Use the middle of the 256MB-aligned region. */\r\n  uintptr_t target = ((uintptr_t)(void *)lj_vm_exit_handler & 0xf0000000u) +\r\n\t\t     0x08000000u;\r\n#else\r\n  uintptr_t target = (uintptr_t)(void *)lj_vm_exit_handler & ~(uintptr_t)0xffff;\r\n#endif\r\n  const uintptr_t range = (1u << (LJ_TARGET_JUMPRANGE-1)) - (1u << 21);\r\n  /* First try a contiguous area below the last one. */\r\n  uintptr_t hint = J->mcarea ? (uintptr_t)J->mcarea - sz : 0;\r\n  int i;\r\n  for (i = 0; i < 32; i++) {  /* 32 attempts ought to be enough ... */\r\n    if (mcode_validptr(hint)) {\r\n      void *p = mcode_alloc_at(J, hint, sz, MCPROT_GEN);\r\n\r\n      if (mcode_validptr(p) &&\r\n\t  ((uintptr_t)p + sz - target < range || target - (uintptr_t)p < range))\r\n\treturn p;\r\n      if (p) mcode_free(J, p, sz);  /* Free badly placed area. */\r\n    }\r\n    /* Next try probing pseudo-random addresses. */\r\n    do {\r\n      hint = (0x78fb ^ LJ_PRNG_BITS(J, 15)) << 16;  /* 64K aligned. */\r\n    } while (!(hint + sz < range));\r\n    hint = target + hint - (range>>1);\r\n  }\r\n  lj_trace_err(J, LJ_TRERR_MCODEAL);  /* Give up. OS probably ignores hints? */\r\n  return NULL;\r\n}\r\n\r\n#else\r\n\r\n/* All memory addresses are reachable by relative jumps. */\r\nstatic void *mcode_alloc(jit_State *J, size_t sz)\r\n{\r\n#ifdef __OpenBSD__\r\n  /* Allow better executable memory allocation for OpenBSD W^X mode. */\r\n  void *p = mcode_alloc_at(J, 0, sz, MCPROT_RUN);\r\n  if (p && mcode_setprot(p, sz, MCPROT_GEN)) {\r\n    mcode_free(J, p, sz);\r\n    return NULL;\r\n  }\r\n  return p;\r\n#else\r\n  return mcode_alloc_at(J, 0, sz, MCPROT_GEN);\r\n#endif\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area management ----------------------------------------------- */\r\n\r\n/* Linked list of MCode areas. */\r\ntypedef struct MCLink {\r\n  MCode *next;\t\t/* Next area. */\r\n  size_t size;\t\t/* Size of current area. */\r\n} MCLink;\r\n\r\n/* Allocate a new MCode area. */\r\nstatic void mcode_allocarea(jit_State *J)\r\n{\r\n  MCode *oldarea = J->mcarea;\r\n  size_t sz = (size_t)J->param[JIT_P_sizemcode] << 10;\r\n  sz = (sz + LJ_PAGESIZE-1) & ~(size_t)(LJ_PAGESIZE - 1);\r\n  J->mcarea = (MCode *)mcode_alloc(J, sz);\r\n  J->szmcarea = sz;\r\n  J->mcprot = MCPROT_GEN;\r\n  J->mctop = (MCode *)((char *)J->mcarea + J->szmcarea);\r\n  J->mcbot = (MCode *)((char *)J->mcarea + sizeof(MCLink));\r\n  ((MCLink *)J->mcarea)->next = oldarea;\r\n  ((MCLink *)J->mcarea)->size = sz;\r\n  J->szallmcarea += sz;\r\n}\r\n\r\n/* Free all MCode areas. */\r\nvoid lj_mcode_free(jit_State *J)\r\n{\r\n  MCode *mc = J->mcarea;\r\n  J->mcarea = NULL;\r\n  J->szallmcarea = 0;\r\n  while (mc) {\r\n    MCode *next = ((MCLink *)mc)->next;\r\n    mcode_free(J, mc, ((MCLink *)mc)->size);\r\n    mc = next;\r\n  }\r\n}\r\n\r\n/* -- MCode transactions -------------------------------------------------- */\r\n\r\n/* Reserve the remainder of the current MCode area. */\r\nMCode *lj_mcode_reserve(jit_State *J, MCode **lim)\r\n{\r\n  if (!J->mcarea)\r\n    mcode_allocarea(J);\r\n  else\r\n    mcode_protect(J, MCPROT_GEN);\r\n  *lim = J->mcbot;\r\n  return J->mctop;\r\n}\r\n\r\n/* Commit the top part of the current MCode area. */\r\nvoid lj_mcode_commit(jit_State *J, MCode *top)\r\n{\r\n  J->mctop = top;\r\n  mcode_protect(J, MCPROT_RUN);\r\n}\r\n\r\n/* Abort the reservation. */\r\nvoid lj_mcode_abort(jit_State *J)\r\n{\r\n  if (J->mcarea)\r\n    mcode_protect(J, MCPROT_RUN);\r\n}\r\n\r\n/* Set/reset protection to allow patching of MCode areas. */\r\nMCode *lj_mcode_patch(jit_State *J, MCode *ptr, int finish)\r\n{\r\n#ifdef LUAJIT_UNPROTECT_MCODE\r\n  UNUSED(J); UNUSED(ptr); UNUSED(finish);\r\n  return NULL;\r\n#else\r\n  if (finish) {\r\n    if (J->mcarea == ptr)\r\n      mcode_protect(J, MCPROT_RUN);\r\n    else if (LJ_UNLIKELY(mcode_setprot(ptr, ((MCLink *)ptr)->size, MCPROT_RUN)))\r\n      mcode_protfail(J);\r\n    return NULL;\r\n  } else {\r\n    MCode *mc = J->mcarea;\r\n    /* Try current area first to use the protection cache. */\r\n    if (ptr >= mc && ptr < (MCode *)((char *)mc + J->szmcarea)) {\r\n      mcode_protect(J, MCPROT_GEN);\r\n      return mc;\r\n    }\r\n    /* Otherwise search through the list of MCode areas. */\r\n    for (;;) {\r\n      mc = ((MCLink *)mc)->next;\r\n      lua_assert(mc != NULL);\r\n      if (ptr >= mc && ptr < (MCode *)((char *)mc + ((MCLink *)mc)->size)) {\r\n\tif (LJ_UNLIKELY(mcode_setprot(mc, ((MCLink *)mc)->size, MCPROT_GEN)))\r\n\t  mcode_protfail(J);\r\n\treturn mc;\r\n      }\r\n    }\r\n  }\r\n#endif\r\n}\r\n\r\n/* Limit of MCode reservation reached. */\r\nvoid lj_mcode_limiterr(jit_State *J, size_t need)\r\n{\r\n  size_t sizemcode, maxmcode;\r\n  lj_mcode_abort(J);\r\n  sizemcode = (size_t)J->param[JIT_P_sizemcode] << 10;\r\n  sizemcode = (sizemcode + LJ_PAGESIZE-1) & ~(size_t)(LJ_PAGESIZE - 1);\r\n  maxmcode = (size_t)J->param[JIT_P_maxmcode] << 10;\r\n  if ((size_t)need > sizemcode)\r\n    lj_trace_err(J, LJ_TRERR_MCODEOV);  /* Too long for any area. */\r\n  if (J->szallmcarea + sizemcode > maxmcode)\r\n    lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n  mcode_allocarea(J);\r\n  lj_trace_err(J, LJ_TRERR_MCODELM);  /* Retry with new area. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_mcode.h",
    "content": "/*\r\n** Machine code management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_MCODE_H\r\n#define _LJ_MCODE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT || LJ_HASFFI\r\nLJ_FUNC void lj_mcode_sync(void *start, void *end);\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_jit.h\"\r\n\r\nLJ_FUNC void lj_mcode_free(jit_State *J);\r\nLJ_FUNC MCode *lj_mcode_reserve(jit_State *J, MCode **lim);\r\nLJ_FUNC void lj_mcode_commit(jit_State *J, MCode *m);\r\nLJ_FUNC void lj_mcode_abort(jit_State *J);\r\nLJ_FUNC MCode *lj_mcode_patch(jit_State *J, MCode *ptr, int finish);\r\nLJ_FUNC_NORET void lj_mcode_limiterr(jit_State *J, size_t need);\r\n\r\n#define lj_mcode_commitbot(J, m)\t(J->mcbot = (m))\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_meta.c",
    "content": "/*\r\n** Metamethod handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_meta_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* -- Metamethod handling ------------------------------------------------- */\r\n\r\n/* String interning of metamethod names for fast indexing. */\r\nvoid lj_meta_init(lua_State *L)\r\n{\r\n#define MMNAME(name)\t\"__\" #name\r\n  const char *metanames = MMDEF(MMNAME);\r\n#undef MMNAME\r\n  global_State *g = G(L);\r\n  const char *p, *q;\r\n  uint32_t mm;\r\n  for (mm = 0, p = metanames; *p; mm++, p = q) {\r\n    GCstr *s;\r\n    for (q = p+2; *q && *q != '_'; q++) ;\r\n    s = lj_str_new(L, p, (size_t)(q-p));\r\n    /* NOBARRIER: g->gcroot[] is a GC root. */\r\n    setgcref(g->gcroot[GCROOT_MMNAME+mm], obj2gco(s));\r\n  }\r\n}\r\n\r\n/* Negative caching of a few fast metamethods. See the lj_meta_fast() macro. */\r\ncTValue *lj_meta_cache(GCtab *mt, MMS mm, GCstr *name)\r\n{\r\n  cTValue *mo = lj_tab_getstr(mt, name);\r\n  lua_assert(mm <= MM_FAST);\r\n  if (!mo || tvisnil(mo)) {  /* No metamethod? */\r\n    mt->nomm |= (uint8_t)(1u<<mm);  /* Set negative cache flag. */\r\n    return NULL;\r\n  }\r\n  return mo;\r\n}\r\n\r\n/* Lookup metamethod for object. */\r\ncTValue *lj_meta_lookup(lua_State *L, cTValue *o, MMS mm)\r\n{\r\n  GCtab *mt;\r\n  if (tvistab(o))\r\n    mt = tabref(tabV(o)->metatable);\r\n  else if (tvisudata(o))\r\n    mt = tabref(udataV(o)->metatable);\r\n  else\r\n    mt = tabref(basemt_obj(G(L), o));\r\n  if (mt) {\r\n    cTValue *mo = lj_tab_getstr(mt, mmname_str(G(L), mm));\r\n    if (mo)\r\n      return mo;\r\n  }\r\n  return niltv(L);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Tailcall from C function. */\r\nint lj_meta_tailcall(lua_State *L, cTValue *tv)\r\n{\r\n  TValue *base = L->base;\r\n  TValue *top = L->top;\r\n  const BCIns *pc = frame_pc(base-1);  /* Preserve old PC from frame. */\r\n  copyTV(L, base-1, tv);  /* Replace frame with new object. */\r\n  top->u32.lo = LJ_CONT_TAILCALL;\r\n  setframe_pc(top, pc);\r\n  setframe_gc(top+1, obj2gco(L));  /* Dummy frame object. */\r\n  setframe_ftsz(top+1, (int)((char *)(top+2) - (char *)base) + FRAME_CONT);\r\n  L->base = L->top = top+2;\r\n  /*\r\n  ** before:   [old_mo|PC]    [... ...]\r\n  **                         ^base     ^top\r\n  ** after:    [new_mo|itype] [... ...] [NULL|PC] [dummy|delta]\r\n  **                                                           ^base/top\r\n  ** tailcall: [new_mo|PC]    [... ...]\r\n  **                         ^base     ^top\r\n  */\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* Setup call to metamethod to be run by Assembler VM. */\r\nstatic TValue *mmcall(lua_State *L, ASMFunction cont, cTValue *mo,\r\n\t\t    cTValue *a, cTValue *b)\r\n{\r\n  /*\r\n  **           |-- framesize -> top       top+1       top+2 top+3\r\n  ** before:   [func slots ...]\r\n  ** mm setup: [func slots ...] [cont|?]  [mo|tmtype] [a]   [b]\r\n  ** in asm:   [func slots ...] [cont|PC] [mo|delta]  [a]   [b]\r\n  **           ^-- func base                          ^-- mm base\r\n  ** after mm: [func slots ...]           [result]\r\n  **                ^-- copy to base[PC_RA] --/     for lj_cont_ra\r\n  **                          istruecond + branch   for lj_cont_cond*\r\n  **                                       ignore   for lj_cont_nop\r\n  ** next PC:  [func slots ...]\r\n  */\r\n  TValue *top = L->top;\r\n  if (curr_funcisL(L)) top = curr_topL(L);\r\n  setcont(top, cont);  /* Assembler VM stores PC in upper word. */\r\n  copyTV(L, top+1, mo);  /* Store metamethod and two arguments. */\r\n  copyTV(L, top+2, a);\r\n  copyTV(L, top+3, b);\r\n  return top+2;  /* Return new base. */\r\n}\r\n\r\n/* -- C helpers for some instructions, called from assembler VM ----------- */\r\n\r\n/* Helper for TGET*. __index chain and metamethod. */\r\ncTValue *lj_meta_tget(lua_State *L, cTValue *o, cTValue *k)\r\n{\r\n  int loop;\r\n  for (loop = 0; loop < LJ_MAX_IDXCHAIN; loop++) {\r\n    cTValue *mo;\r\n    if (LJ_LIKELY(tvistab(o))) {\r\n      GCtab *t = tabV(o);\r\n      cTValue *tv = lj_tab_get(L, t, k);\r\n      if (!tvisnil(tv) ||\r\n\t  !(mo = lj_meta_fast(L, tabref(t->metatable), MM_index)))\r\n\treturn tv;\r\n    } else if (tvisnil(mo = lj_meta_lookup(L, o, MM_index))) {\r\n      lj_err_optype(L, o, LJ_ERR_OPINDEX);\r\n      return NULL;  /* unreachable */\r\n    }\r\n    if (tvisfunc(mo)) {\r\n      L->top = mmcall(L, lj_cont_ra, mo, o, k);\r\n      return NULL;  /* Trigger metamethod call. */\r\n    }\r\n    o = mo;\r\n  }\r\n  lj_err_msg(L, LJ_ERR_GETLOOP);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\n/* Helper for TSET*. __newindex chain and metamethod. */\r\nTValue *lj_meta_tset(lua_State *L, cTValue *o, cTValue *k)\r\n{\r\n  TValue tmp;\r\n  int loop;\r\n  for (loop = 0; loop < LJ_MAX_IDXCHAIN; loop++) {\r\n    cTValue *mo;\r\n    if (LJ_LIKELY(tvistab(o))) {\r\n      GCtab *t = tabV(o);\r\n      cTValue *tv = lj_tab_get(L, t, k);\r\n      if (LJ_LIKELY(!tvisnil(tv))) {\r\n\tt->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n\tlj_gc_anybarriert(L, t);\r\n\treturn (TValue *)tv;\r\n      } else if (!(mo = lj_meta_fast(L, tabref(t->metatable), MM_newindex))) {\r\n\tt->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n\tlj_gc_anybarriert(L, t);\r\n\tif (tv != niltv(L))\r\n\t  return (TValue *)tv;\r\n\tif (tvisnil(k)) lj_err_msg(L, LJ_ERR_NILIDX);\r\n\telse if (tvisint(k)) { setnumV(&tmp, (lua_Number)intV(k)); k = &tmp; }\r\n\telse if (tvisnum(k) && tvisnan(k)) lj_err_msg(L, LJ_ERR_NANIDX);\r\n\treturn lj_tab_newkey(L, t, k);\r\n      }\r\n    } else if (tvisnil(mo = lj_meta_lookup(L, o, MM_newindex))) {\r\n      lj_err_optype(L, o, LJ_ERR_OPINDEX);\r\n      return NULL;  /* unreachable */\r\n    }\r\n    if (tvisfunc(mo)) {\r\n      L->top = mmcall(L, lj_cont_nop, mo, o, k);\r\n      /* L->top+2 = v filled in by caller. */\r\n      return NULL;  /* Trigger metamethod call. */\r\n    }\r\n    copyTV(L, &tmp, mo);\r\n    o = &tmp;\r\n  }\r\n  lj_err_msg(L, LJ_ERR_SETLOOP);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nstatic cTValue *str2num(cTValue *o, TValue *n)\r\n{\r\n  if (tvisnum(o))\r\n    return o;\r\n  else if (tvisint(o))\r\n    return (setnumV(n, (lua_Number)intV(o)), n);\r\n  else if (tvisstr(o) && lj_strscan_num(strV(o), n))\r\n    return n;\r\n  else\r\n    return NULL;\r\n}\r\n\r\n/* Helper for arithmetic instructions. Coercion, metamethod. */\r\nTValue *lj_meta_arith(lua_State *L, TValue *ra, cTValue *rb, cTValue *rc,\r\n\t\t      BCReg op)\r\n{\r\n  MMS mm = bcmode_mm(op);\r\n  TValue tempb, tempc;\r\n  cTValue *b, *c;\r\n  if ((b = str2num(rb, &tempb)) != NULL &&\r\n      (c = str2num(rc, &tempc)) != NULL) {  /* Try coercion first. */\r\n    setnumV(ra, lj_vm_foldarith(numV(b), numV(c), (int)mm-MM_add));\r\n    return NULL;\r\n  } else {\r\n    cTValue *mo = lj_meta_lookup(L, rb, mm);\r\n    if (tvisnil(mo)) {\r\n      mo = lj_meta_lookup(L, rc, mm);\r\n      if (tvisnil(mo)) {\r\n\tif (str2num(rb, &tempb) == NULL) rc = rb;\r\n\tlj_err_optype(L, rc, LJ_ERR_OPARITH);\r\n\treturn NULL;  /* unreachable */\r\n      }\r\n    }\r\n    return mmcall(L, lj_cont_ra, mo, rb, rc);\r\n  }\r\n}\r\n\r\n/* In-place coercion of a number to a string. */\r\nstatic LJ_AINLINE int tostring(lua_State *L, TValue *o)\r\n{\r\n  if (tvisstr(o)) {\r\n    return 1;\r\n  } else if (tvisnumber(o)) {\r\n    setstrV(L, o, lj_str_fromnumber(L, o));\r\n    return 1;\r\n  } else {\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Helper for CAT. Coercion, iterative concat, __concat metamethod. */\r\nTValue *lj_meta_cat(lua_State *L, TValue *top, int left)\r\n{\r\n  int fromc = 0;\r\n  if (left < 0) { left = -left; fromc = 1; }\r\n  do {\r\n    int n = 1;\r\n    if (!(tvisstr(top-1) || tvisnumber(top-1)) || !tostring(L, top)) {\r\n      cTValue *mo = lj_meta_lookup(L, top-1, MM_concat);\r\n      if (tvisnil(mo)) {\r\n\tmo = lj_meta_lookup(L, top, MM_concat);\r\n\tif (tvisnil(mo)) {\r\n\t  if (tvisstr(top-1) || tvisnumber(top-1)) top++;\r\n\t  lj_err_optype(L, top-1, LJ_ERR_OPCAT);\r\n\t  return NULL;  /* unreachable */\r\n\t}\r\n      }\r\n      /* One of the top two elements is not a string, call __cat metamethod:\r\n      **\r\n      ** before:    [...][CAT stack .........................]\r\n      **                                 top-1     top         top+1 top+2\r\n      ** pick two:  [...][CAT stack ...] [o1]      [o2]\r\n      ** setup mm:  [...][CAT stack ...] [cont|?]  [mo|tmtype] [o1]  [o2]\r\n      ** in asm:    [...][CAT stack ...] [cont|PC] [mo|delta]  [o1]  [o2]\r\n      **            ^-- func base                              ^-- mm base\r\n      ** after mm:  [...][CAT stack ...] <--push-- [result]\r\n      ** next step: [...][CAT stack .............]\r\n      */\r\n      copyTV(L, top+2, top);  /* Careful with the order of stack copies! */\r\n      copyTV(L, top+1, top-1);\r\n      copyTV(L, top, mo);\r\n      setcont(top-1, lj_cont_cat);\r\n      return top+1;  /* Trigger metamethod call. */\r\n    } else if (strV(top)->len == 0) {  /* Shortcut. */\r\n      (void)tostring(L, top-1);\r\n    } else {\r\n      /* Pick as many strings as possible from the top and concatenate them:\r\n      **\r\n      ** before:    [...][CAT stack ...........................]\r\n      ** pick str:  [...][CAT stack ...] [...... strings ......]\r\n      ** concat:    [...][CAT stack ...] [result]\r\n      ** next step: [...][CAT stack ............]\r\n      */\r\n      MSize tlen = strV(top)->len;\r\n      char *buffer;\r\n      int i;\r\n      for (n = 1; n <= left && tostring(L, top-n); n++) {\r\n\tMSize len = strV(top-n)->len;\r\n\tif (len >= LJ_MAX_STR - tlen)\r\n\t  lj_err_msg(L, LJ_ERR_STROV);\r\n\ttlen += len;\r\n      }\r\n      buffer = lj_str_needbuf(L, &G(L)->tmpbuf, tlen);\r\n      n--;\r\n      tlen = 0;\r\n      for (i = n; i >= 0; i--) {\r\n\tMSize len = strV(top-i)->len;\r\n\tmemcpy(buffer + tlen, strVdata(top-i), len);\r\n\ttlen += len;\r\n      }\r\n      setstrV(L, top-n, lj_str_new(L, buffer, tlen));\r\n    }\r\n    left -= n;\r\n    top -= n;\r\n  } while (left >= 1);\r\n  if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) {\r\n    if (!fromc) L->top = curr_topL(L);\r\n    lj_gc_step(L);\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Helper for LEN. __len metamethod. */\r\nTValue * LJ_FASTCALL lj_meta_len(lua_State *L, cTValue *o)\r\n{\r\n  cTValue *mo = lj_meta_lookup(L, o, MM_len);\r\n  if (tvisnil(mo)) {\r\n    if (LJ_52 && tvistab(o))\r\n      tabref(tabV(o)->metatable)->nomm |= (uint8_t)(1u<<MM_len);\r\n    else\r\n      lj_err_optype(L, o, LJ_ERR_OPLEN);\r\n    return NULL;\r\n  }\r\n  return mmcall(L, lj_cont_ra, mo, o, LJ_52 ? o : niltv(L));\r\n}\r\n\r\n/* Helper for equality comparisons. __eq metamethod. */\r\nTValue *lj_meta_equal(lua_State *L, GCobj *o1, GCobj *o2, int ne)\r\n{\r\n  /* Field metatable must be at same offset for GCtab and GCudata! */\r\n  cTValue *mo = lj_meta_fast(L, tabref(o1->gch.metatable), MM_eq);\r\n  if (mo) {\r\n    TValue *top;\r\n    uint32_t it;\r\n    if (tabref(o1->gch.metatable) != tabref(o2->gch.metatable)) {\r\n      cTValue *mo2 = lj_meta_fast(L, tabref(o2->gch.metatable), MM_eq);\r\n      if (mo2 == NULL || !lj_obj_equal(mo, mo2))\r\n\treturn (TValue *)(intptr_t)ne;\r\n    }\r\n    top = curr_top(L);\r\n    setcont(top, ne ? lj_cont_condf : lj_cont_condt);\r\n    copyTV(L, top+1, mo);\r\n    it = ~(uint32_t)o1->gch.gct;\r\n    setgcV(L, top+2, o1, it);\r\n    setgcV(L, top+3, o2, it);\r\n    return top+2;  /* Trigger metamethod call. */\r\n  }\r\n  return (TValue *)(intptr_t)ne;\r\n}\r\n\r\n#if LJ_HASFFI\r\nTValue * LJ_FASTCALL lj_meta_equal_cd(lua_State *L, BCIns ins)\r\n{\r\n  ASMFunction cont = (bc_op(ins) & 1) ? lj_cont_condf : lj_cont_condt;\r\n  int op = (int)bc_op(ins) & ~1;\r\n  TValue tv;\r\n  cTValue *mo, *o2, *o1 = &L->base[bc_a(ins)];\r\n  cTValue *o1mm = o1;\r\n  if (op == BC_ISEQV) {\r\n    o2 = &L->base[bc_d(ins)];\r\n    if (!tviscdata(o1mm)) o1mm = o2;\r\n  } else if (op == BC_ISEQS) {\r\n    setstrV(L, &tv, gco2str(proto_kgc(curr_proto(L), ~(ptrdiff_t)bc_d(ins))));\r\n    o2 = &tv;\r\n  } else if (op == BC_ISEQN) {\r\n    o2 = &mref(curr_proto(L)->k, cTValue)[bc_d(ins)];\r\n  } else {\r\n    lua_assert(op == BC_ISEQP);\r\n    setitype(&tv, ~bc_d(ins));\r\n    o2 = &tv;\r\n  }\r\n  mo = lj_meta_lookup(L, o1mm, MM_eq);\r\n  if (LJ_LIKELY(!tvisnil(mo)))\r\n    return mmcall(L, cont, mo, o1, o2);\r\n  else\r\n    return (TValue *)(intptr_t)(bc_op(ins) & 1);\r\n}\r\n#endif\r\n\r\n/* Helper for ordered comparisons. String compare, __lt/__le metamethods. */\r\nTValue *lj_meta_comp(lua_State *L, cTValue *o1, cTValue *o2, int op)\r\n{\r\n  if (LJ_HASFFI && (tviscdata(o1) || tviscdata(o2))) {\r\n    ASMFunction cont = (op & 1) ? lj_cont_condf : lj_cont_condt;\r\n    MMS mm = (op & 2) ? MM_le : MM_lt;\r\n    cTValue *mo = lj_meta_lookup(L, tviscdata(o1) ? o1 : o2, mm);\r\n    if (LJ_UNLIKELY(tvisnil(mo))) goto err;\r\n    return mmcall(L, cont, mo, o1, o2);\r\n  } else if (LJ_52 || itype(o1) == itype(o2)) {\r\n    /* Never called with two numbers. */\r\n    if (tvisstr(o1) && tvisstr(o2)) {\r\n      int32_t res = lj_str_cmp(strV(o1), strV(o2));\r\n      return (TValue *)(intptr_t)(((op&2) ? res <= 0 : res < 0) ^ (op&1));\r\n    } else {\r\n    trymt:\r\n      while (1) {\r\n\tASMFunction cont = (op & 1) ? lj_cont_condf : lj_cont_condt;\r\n\tMMS mm = (op & 2) ? MM_le : MM_lt;\r\n\tcTValue *mo = lj_meta_lookup(L, o1, mm);\r\n#if LJ_52\r\n\tif (tvisnil(mo) && tvisnil((mo = lj_meta_lookup(L, o2, mm))))\r\n#else\r\n\tcTValue *mo2 = lj_meta_lookup(L, o2, mm);\r\n\tif (tvisnil(mo) || !lj_obj_equal(mo, mo2))\r\n#endif\r\n\t{\r\n\t  if (op & 2) {  /* MM_le not found: retry with MM_lt. */\r\n\t    cTValue *ot = o1; o1 = o2; o2 = ot;  /* Swap operands. */\r\n\t    op ^= 3;  /* Use LT and flip condition. */\r\n\t    continue;\r\n\t  }\r\n\t  goto err;\r\n\t}\r\n\treturn mmcall(L, cont, mo, o1, o2);\r\n      }\r\n    }\r\n  } else if (tvisbool(o1) && tvisbool(o2)) {\r\n    goto trymt;\r\n  } else {\r\n  err:\r\n    lj_err_comp(L, o1, o2);\r\n    return NULL;\r\n  }\r\n}\r\n\r\n/* Helper for calls. __call metamethod. */\r\nvoid lj_meta_call(lua_State *L, TValue *func, TValue *top)\r\n{\r\n  cTValue *mo = lj_meta_lookup(L, func, MM_call);\r\n  TValue *p;\r\n  if (!tvisfunc(mo))\r\n    lj_err_optype_call(L, func);\r\n  for (p = top; p > func; p--) copyTV(L, p, p-1);\r\n  copyTV(L, func, mo);\r\n}\r\n\r\n/* Helper for FORI. Coercion. */\r\nvoid LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o)\r\n{\r\n  if (!lj_strscan_numberobj(o)) lj_err_msg(L, LJ_ERR_FORINIT);\r\n  if (!lj_strscan_numberobj(o+1)) lj_err_msg(L, LJ_ERR_FORLIM);\r\n  if (!lj_strscan_numberobj(o+2)) lj_err_msg(L, LJ_ERR_FORSTEP);\r\n  if (LJ_DUALNUM) {\r\n    /* Ensure all slots are integers or all slots are numbers. */\r\n    int32_t k[3];\r\n    int nint = 0;\r\n    ptrdiff_t i;\r\n    for (i = 0; i <= 2; i++) {\r\n      if (tvisint(o+i)) {\r\n\tk[i] = intV(o+i); nint++;\r\n      } else {\r\n\tk[i] = lj_num2int(numV(o+i)); nint += ((lua_Number)k[i] == numV(o+i));\r\n      }\r\n    }\r\n    if (nint == 3) {  /* Narrow to integers. */\r\n      setintV(o, k[0]);\r\n      setintV(o+1, k[1]);\r\n      setintV(o+2, k[2]);\r\n    } else if (nint != 0) {  /* Widen to numbers. */\r\n      if (tvisint(o)) setnumV(o, (lua_Number)intV(o));\r\n      if (tvisint(o+1)) setnumV(o+1, (lua_Number)intV(o+1));\r\n      if (tvisint(o+2)) setnumV(o+2, (lua_Number)intV(o+2));\r\n    }\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_meta.h",
    "content": "/*\r\n** Metamethod handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_META_H\r\n#define _LJ_META_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Metamethod handling */\r\nLJ_FUNC void lj_meta_init(lua_State *L);\r\nLJ_FUNC cTValue *lj_meta_cache(GCtab *mt, MMS mm, GCstr *name);\r\nLJ_FUNC cTValue *lj_meta_lookup(lua_State *L, cTValue *o, MMS mm);\r\n#if LJ_HASFFI\r\nLJ_FUNC int lj_meta_tailcall(lua_State *L, cTValue *tv);\r\n#endif\r\n\r\n#define lj_meta_fastg(g, mt, mm) \\\r\n  ((mt) == NULL ? NULL : ((mt)->nomm & (1u<<(mm))) ? NULL : \\\r\n   lj_meta_cache(mt, mm, mmname_str(g, mm)))\r\n#define lj_meta_fast(L, mt, mm)\tlj_meta_fastg(G(L), mt, mm)\r\n\r\n/* C helpers for some instructions, called from assembler VM. */\r\nLJ_FUNCA cTValue *lj_meta_tget(lua_State *L, cTValue *o, cTValue *k);\r\nLJ_FUNCA TValue *lj_meta_tset(lua_State *L, cTValue *o, cTValue *k);\r\nLJ_FUNCA TValue *lj_meta_arith(lua_State *L, TValue *ra, cTValue *rb,\r\n\t\t\t       cTValue *rc, BCReg op);\r\nLJ_FUNCA TValue *lj_meta_cat(lua_State *L, TValue *top, int left);\r\nLJ_FUNCA TValue * LJ_FASTCALL lj_meta_len(lua_State *L, cTValue *o);\r\nLJ_FUNCA TValue *lj_meta_equal(lua_State *L, GCobj *o1, GCobj *o2, int ne);\r\nLJ_FUNCA TValue * LJ_FASTCALL lj_meta_equal_cd(lua_State *L, BCIns ins);\r\nLJ_FUNCA TValue *lj_meta_comp(lua_State *L, cTValue *o1, cTValue *o2, int op);\r\nLJ_FUNCA void lj_meta_call(lua_State *L, TValue *func, TValue *top);\r\nLJ_FUNCA void LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_obj.c",
    "content": "/*\r\n** Miscellaneous object handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_obj_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Object type names. */\r\nLJ_DATADEF const char *const lj_obj_typename[] = {  /* ORDER LUA_T */\r\n  \"no value\", \"nil\", \"boolean\", \"userdata\", \"number\", \"string\",\r\n  \"table\", \"function\", \"userdata\", \"thread\", \"proto\", \"cdata\"\r\n};\r\n\r\nLJ_DATADEF const char *const lj_obj_itypename[] = {  /* ORDER LJ_T */\r\n  \"nil\", \"boolean\", \"boolean\", \"userdata\", \"string\", \"upval\", \"thread\",\r\n  \"proto\", \"function\", \"trace\", \"cdata\", \"table\", \"userdata\", \"number\"\r\n};\r\n\r\n/* Compare two objects without calling metamethods. */\r\nint lj_obj_equal(cTValue *o1, cTValue *o2)\r\n{\r\n  if (itype(o1) == itype(o2)) {\r\n    if (tvispri(o1))\r\n      return 1;\r\n    if (!tvisnum(o1))\r\n      return gcrefeq(o1->gcr, o2->gcr);\r\n  } else if (!tvisnumber(o1) || !tvisnumber(o2)) {\r\n    return 0;\r\n  }\r\n  return numberVnum(o1) == numberVnum(o2);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_obj.h",
    "content": "/*\r\n** LuaJIT VM tags, values and objects.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef _LJ_OBJ_H\r\n#define _LJ_OBJ_H\r\n\r\n#include \"lua.h\"\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* -- Memory references (32 bit address space) ---------------------------- */\r\n\r\n/* Memory size. */\r\ntypedef uint32_t MSize;\r\n\r\n/* Memory reference */\r\ntypedef struct MRef {\r\n  uint32_t ptr32;\t/* Pseudo 32 bit pointer. */\r\n} MRef;\r\n\r\n#define mref(r, t)\t((t *)(void *)(uintptr_t)(r).ptr32)\r\n\r\n#define setmref(r, p)\t((r).ptr32 = (uint32_t)(uintptr_t)(void *)(p))\r\n#define setmrefr(r, v)\t((r).ptr32 = (v).ptr32)\r\n\r\n/* -- GC object references (32 bit address space) ------------------------- */\r\n\r\n/* GCobj reference */\r\ntypedef struct GCRef {\r\n  uint32_t gcptr32;\t/* Pseudo 32 bit pointer. */\r\n} GCRef;\r\n\r\n/* Common GC header for all collectable objects. */\r\n#define GCHeader\tGCRef nextgc; uint8_t marked; uint8_t gct\r\n/* This occupies 6 bytes, so use the next 2 bytes for non-32 bit fields. */\r\n\r\n#define gcref(r)\t((GCobj *)(uintptr_t)(r).gcptr32)\r\n#define gcrefp(r, t)\t((t *)(void *)(uintptr_t)(r).gcptr32)\r\n#define gcrefu(r)\t((r).gcptr32)\r\n#define gcrefi(r)\t((int32_t)(r).gcptr32)\r\n#define gcrefeq(r1, r2)\t((r1).gcptr32 == (r2).gcptr32)\r\n#define gcnext(gc)\t(gcref((gc)->gch.nextgc))\r\n\r\n#define setgcref(r, gc)\t((r).gcptr32 = (uint32_t)(uintptr_t)&(gc)->gch)\r\n#define setgcrefi(r, i)\t((r).gcptr32 = (uint32_t)(i))\r\n#define setgcrefp(r, p)\t((r).gcptr32 = (uint32_t)(uintptr_t)(p))\r\n#define setgcrefnull(r)\t((r).gcptr32 = 0)\r\n#define setgcrefr(r, v)\t((r).gcptr32 = (v).gcptr32)\r\n\r\n/* IMPORTANT NOTE:\r\n**\r\n** All uses of the setgcref* macros MUST be accompanied with a write barrier.\r\n**\r\n** This is to ensure the integrity of the incremental GC. The invariant\r\n** to preserve is that a black object never points to a white object.\r\n** I.e. never store a white object into a field of a black object.\r\n**\r\n** It's ok to LEAVE OUT the write barrier ONLY in the following cases:\r\n** - The source is not a GC object (NULL).\r\n** - The target is a GC root. I.e. everything in global_State.\r\n** - The target is a lua_State field (threads are never black).\r\n** - The target is a stack slot, see setgcV et al.\r\n** - The target is an open upvalue, i.e. pointing to a stack slot.\r\n** - The target is a newly created object (i.e. marked white). But make\r\n**   sure nothing invokes the GC inbetween.\r\n** - The target and the source are the same object (self-reference).\r\n** - The target already contains the object (e.g. moving elements around).\r\n**\r\n** The most common case is a store to a stack slot. All other cases where\r\n** a barrier has been omitted are annotated with a NOBARRIER comment.\r\n**\r\n** The same logic applies for stores to table slots (array part or hash\r\n** part). ALL uses of lj_tab_set* require a barrier for the stored value\r\n** *and* the stored key, based on the above rules. In practice this means\r\n** a barrier is needed if *either* of the key or value are a GC object.\r\n**\r\n** It's ok to LEAVE OUT the write barrier in the following special cases:\r\n** - The stored value is nil. The key doesn't matter because it's either\r\n**   not resurrected or lj_tab_newkey() will take care of the key barrier.\r\n** - The key doesn't matter if the *previously* stored value is guaranteed\r\n**   to be non-nil (because the key is kept alive in the table).\r\n** - The key doesn't matter if it's guaranteed not to be part of the table,\r\n**   since lj_tab_newkey() takes care of the key barrier. This applies\r\n**   trivially to new tables, but watch out for resurrected keys. Storing\r\n**   a nil value leaves the key in the table!\r\n**\r\n** In case of doubt use lj_gc_anybarriert() as it's rather cheap. It's used\r\n** by the interpreter for all table stores.\r\n**\r\n** Note: In contrast to Lua's GC, LuaJIT's GC does *not* specially mark\r\n** dead keys in tables. The reference is left in, but it's guaranteed to\r\n** be never dereferenced as long as the value is nil. It's ok if the key is\r\n** freed or if any object subsequently gets the same address.\r\n**\r\n** Not destroying dead keys helps to keep key hash slots stable. This avoids\r\n** specialization back-off for HREFK when a value flips between nil and\r\n** non-nil and the GC gets in the way. It also allows safely hoisting\r\n** HREF/HREFK across GC steps. Dead keys are only removed if a table is\r\n** resized (i.e. by NEWREF) and xREF must not be CSEd across a resize.\r\n**\r\n** The trade-off is that a write barrier for tables must take the key into\r\n** account, too. Implicitly resurrecting the key by storing a non-nil value\r\n** may invalidate the incremental GC invariant.\r\n*/\r\n\r\n/* -- Common type definitions --------------------------------------------- */\r\n\r\n/* Types for handling bytecodes. Need this here, details in lj_bc.h. */\r\ntypedef uint32_t BCIns;  /* Bytecode instruction. */\r\ntypedef uint32_t BCPos;  /* Bytecode position. */\r\ntypedef uint32_t BCReg;  /* Bytecode register. */\r\ntypedef int32_t BCLine;  /* Bytecode line number. */\r\n\r\n/* Internal assembler functions. Never call these directly from C. */\r\ntypedef void (*ASMFunction)(void);\r\n\r\n/* Resizable string buffer. Need this here, details in lj_str.h. */\r\ntypedef struct SBuf {\r\n  char *buf;\t\t/* String buffer base. */\r\n  MSize n;\t\t/* String buffer length. */\r\n  MSize sz;\t\t/* String buffer size. */\r\n} SBuf;\r\n\r\n/* -- Tags and values ----------------------------------------------------- */\r\n\r\n/* Frame link. */\r\ntypedef union {\r\n  int32_t ftsz;\t\t/* Frame type and size of previous frame. */\r\n  MRef pcr;\t\t/* Overlaps PC for Lua frames. */\r\n} FrameLink;\r\n\r\n/* Tagged value. */\r\ntypedef LJ_ALIGN(8) union TValue {\r\n  uint64_t u64;\t\t/* 64 bit pattern overlaps number. */\r\n  lua_Number n;\t\t/* Number object overlaps split tag/value object. */\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      union {\r\n\tGCRef gcr;\t/* GCobj reference (if any). */\r\n\tint32_t i;\t/* Integer value. */\r\n      };\r\n    , uint32_t it;\t/* Internal object tag. Must overlap MSW of number. */\r\n    )\r\n  };\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      GCRef func;\t/* Function for next frame (or dummy L). */\r\n    , FrameLink tp;\t/* Link to previous frame. */\r\n    )\r\n  } fr;\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      uint32_t lo;\t/* Lower 32 bits of number. */\r\n    , uint32_t hi;\t/* Upper 32 bits of number. */\r\n    )\r\n  } u32;\r\n} TValue;\r\n\r\ntypedef const TValue cTValue;\r\n\r\n#define tvref(r)\t(mref(r, TValue))\r\n\r\n/* More external and GCobj tags for internal objects. */\r\n#define LAST_TT\t\tLUA_TTHREAD\r\n#define LUA_TPROTO\t(LAST_TT+1)\r\n#define LUA_TCDATA\t(LAST_TT+2)\r\n\r\n/* Internal object tags.\r\n**\r\n** Internal tags overlap the MSW of a number object (must be a double).\r\n** Interpreted as a double these are special NaNs. The FPU only generates\r\n** one type of NaN (0xfff8_0000_0000_0000). So MSWs > 0xfff80000 are available\r\n** for use as internal tags. Small negative numbers are used to shorten the\r\n** encoding of type comparisons (reg/mem against sign-ext. 8 bit immediate).\r\n**\r\n**                  ---MSW---.---LSW---\r\n** primitive types |  itype  |         |\r\n** lightuserdata   |  itype  |  void * |  (32 bit platforms)\r\n** lightuserdata   |ffff|    void *    |  (64 bit platforms, 47 bit pointers)\r\n** GC objects      |  itype  |  GCRef  |\r\n** int (LJ_DUALNUM)|  itype  |   int   |\r\n** number           -------double------\r\n**\r\n** ORDER LJ_T\r\n** Primitive types nil/false/true must be first, lightuserdata next.\r\n** GC objects are at the end, table/userdata must be lowest.\r\n** Also check lj_ir.h for similar ordering constraints.\r\n*/\r\n#define LJ_TNIL\t\t\t(~0u)\r\n#define LJ_TFALSE\t\t(~1u)\r\n#define LJ_TTRUE\t\t(~2u)\r\n#define LJ_TLIGHTUD\t\t(~3u)\r\n#define LJ_TSTR\t\t\t(~4u)\r\n#define LJ_TUPVAL\t\t(~5u)\r\n#define LJ_TTHREAD\t\t(~6u)\r\n#define LJ_TPROTO\t\t(~7u)\r\n#define LJ_TFUNC\t\t(~8u)\r\n#define LJ_TTRACE\t\t(~9u)\r\n#define LJ_TCDATA\t\t(~10u)\r\n#define LJ_TTAB\t\t\t(~11u)\r\n#define LJ_TUDATA\t\t(~12u)\r\n/* This is just the canonical number type used in some places. */\r\n#define LJ_TNUMX\t\t(~13u)\r\n\r\n/* Integers have itype == LJ_TISNUM doubles have itype < LJ_TISNUM */\r\n#if LJ_64\r\n#define LJ_TISNUM\t\t0xfffeffffu\r\n#else\r\n#define LJ_TISNUM\t\tLJ_TNUMX\r\n#endif\r\n#define LJ_TISTRUECOND\t\tLJ_TFALSE\r\n#define LJ_TISPRI\t\tLJ_TTRUE\r\n#define LJ_TISGCV\t\t(LJ_TSTR+1)\r\n#define LJ_TISTABUD\t\tLJ_TTAB\r\n\r\n/* -- String object ------------------------------------------------------- */\r\n\r\n/* String object header. String payload follows. */\r\ntypedef struct GCstr {\r\n  GCHeader;\r\n  uint8_t reserved;\t/* Used by lexer for fast lookup of reserved words. */\r\n  uint8_t unused;\r\n  MSize hash;\t\t/* Hash of string. */\r\n  MSize len;\t\t/* Size of string. */\r\n} GCstr;\r\n\r\n#define strref(r)\t(&gcref((r))->str)\r\n#define strdata(s)\t((const char *)((s)+1))\r\n#define strdatawr(s)\t((char *)((s)+1))\r\n#define strVdata(o)\tstrdata(strV(o))\r\n#define sizestring(s)\t(sizeof(struct GCstr)+(s)->len+1)\r\n\r\n/* -- Userdata object ----------------------------------------------------- */\r\n\r\n/* Userdata object. Payload follows. */\r\ntypedef struct GCudata {\r\n  GCHeader;\r\n  uint8_t udtype;\t/* Userdata type. */\r\n  uint8_t unused2;\r\n  GCRef env;\t\t/* Should be at same offset in GCfunc. */\r\n  MSize len;\t\t/* Size of payload. */\r\n  GCRef metatable;\t/* Must be at same offset in GCtab. */\r\n  uint32_t align1;\t/* To force 8 byte alignment of the payload. */\r\n} GCudata;\r\n\r\n/* Userdata types. */\r\nenum {\r\n  UDTYPE_USERDATA,\t/* Regular userdata. */\r\n  UDTYPE_IO_FILE,\t/* I/O library FILE. */\r\n  UDTYPE_FFI_CLIB,\t/* FFI C library namespace. */\r\n  UDTYPE__MAX\r\n};\r\n\r\n#define uddata(u)\t((void *)((u)+1))\r\n#define sizeudata(u)\t(sizeof(struct GCudata)+(u)->len)\r\n\r\n/* -- C data object ------------------------------------------------------- */\r\n\r\n/* C data object. Payload follows. */\r\ntypedef struct GCcdata {\r\n  GCHeader;\r\n  uint16_t ctypeid;\t/* C type ID. */\r\n} GCcdata;\r\n\r\n/* Prepended to variable-sized or realigned C data objects. */\r\ntypedef struct GCcdataVar {\r\n  uint16_t offset;\t/* Offset to allocated memory (relative to GCcdata). */\r\n  uint16_t extra;\t/* Extra space allocated (incl. GCcdata + GCcdatav). */\r\n  MSize len;\t\t/* Size of payload. */\r\n} GCcdataVar;\r\n\r\n#define cdataptr(cd)\t((void *)((cd)+1))\r\n#define cdataisv(cd)\t((cd)->marked & 0x80)\r\n#define cdatav(cd)\t((GCcdataVar *)((char *)(cd) - sizeof(GCcdataVar)))\r\n#define cdatavlen(cd)\tcheck_exp(cdataisv(cd), cdatav(cd)->len)\r\n#define sizecdatav(cd)\t(cdatavlen(cd) + cdatav(cd)->extra)\r\n#define memcdatav(cd)\t((void *)((char *)(cd) - cdatav(cd)->offset))\r\n\r\n/* -- Prototype object ---------------------------------------------------- */\r\n\r\n#define SCALE_NUM_GCO\t((int32_t)sizeof(lua_Number)/sizeof(GCRef))\r\n#define round_nkgc(n)\t(((n) + SCALE_NUM_GCO-1) & ~(SCALE_NUM_GCO-1))\r\n\r\ntypedef struct GCproto {\r\n  GCHeader;\r\n  uint8_t numparams;\t/* Number of parameters. */\r\n  uint8_t framesize;\t/* Fixed frame size. */\r\n  MSize sizebc;\t\t/* Number of bytecode instructions. */\r\n  GCRef gclist;\r\n  MRef k;\t\t/* Split constant array (points to the middle). */\r\n  MRef uv;\t\t/* Upvalue list. local slot|0x8000 or parent uv idx. */\r\n  MSize sizekgc;\t/* Number of collectable constants. */\r\n  MSize sizekn;\t\t/* Number of lua_Number constants. */\r\n  MSize sizept;\t\t/* Total size including colocated arrays. */\r\n  uint8_t sizeuv;\t/* Number of upvalues. */\r\n  uint8_t flags;\t/* Miscellaneous flags (see below). */\r\n  uint16_t trace;\t/* Anchor for chain of root traces. */\r\n  /* ------ The following fields are for debugging/tracebacks only ------ */\r\n  GCRef chunkname;\t/* Name of the chunk this function was defined in. */\r\n  BCLine firstline;\t/* First line of the function definition. */\r\n  BCLine numline;\t/* Number of lines for the function definition. */\r\n  MRef lineinfo;\t/* Compressed map from bytecode ins. to source line. */\r\n  MRef uvinfo;\t\t/* Upvalue names. */\r\n  MRef varinfo;\t\t/* Names and compressed extents of local variables. */\r\n} GCproto;\r\n\r\n/* Flags for prototype. */\r\n#define PROTO_CHILD\t\t0x01\t/* Has child prototypes. */\r\n#define PROTO_VARARG\t\t0x02\t/* Vararg function. */\r\n#define PROTO_FFI\t\t0x04\t/* Uses BC_KCDATA for FFI datatypes. */\r\n#define PROTO_NOJIT\t\t0x08\t/* JIT disabled for this function. */\r\n#define PROTO_ILOOP\t\t0x10\t/* Patched bytecode with ILOOP etc. */\r\n/* Only used during parsing. */\r\n#define PROTO_HAS_RETURN\t0x20\t/* Already emitted a return. */\r\n#define PROTO_FIXUP_RETURN\t0x40\t/* Need to fixup emitted returns. */\r\n/* Top bits used for counting created closures. */\r\n#define PROTO_CLCOUNT\t\t0x20\t/* Base of saturating 3 bit counter. */\r\n#define PROTO_CLC_BITS\t\t3\r\n#define PROTO_CLC_POLY\t\t(3*PROTO_CLCOUNT)  /* Polymorphic threshold. */\r\n\r\n#define PROTO_UV_LOCAL\t\t0x8000\t/* Upvalue for local slot. */\r\n#define PROTO_UV_IMMUTABLE\t0x4000\t/* Immutable upvalue. */\r\n\r\n#define proto_kgc(pt, idx) \\\r\n  check_exp((uintptr_t)(intptr_t)(idx) >= (uintptr_t)-(intptr_t)(pt)->sizekgc, \\\r\n\t    gcref(mref((pt)->k, GCRef)[(idx)]))\r\n#define proto_knumtv(pt, idx) \\\r\n  check_exp((uintptr_t)(idx) < (pt)->sizekn, &mref((pt)->k, TValue)[(idx)])\r\n#define proto_bc(pt)\t\t((BCIns *)((char *)(pt) + sizeof(GCproto)))\r\n#define proto_bcpos(pt, pc)\t((BCPos)((pc) - proto_bc(pt)))\r\n#define proto_uv(pt)\t\t(mref((pt)->uv, uint16_t))\r\n\r\n#define proto_chunkname(pt)\t(strref((pt)->chunkname))\r\n#define proto_chunknamestr(pt)\t(strdata(proto_chunkname((pt))))\r\n#define proto_lineinfo(pt)\t(mref((pt)->lineinfo, const void))\r\n#define proto_uvinfo(pt)\t(mref((pt)->uvinfo, const uint8_t))\r\n#define proto_varinfo(pt)\t(mref((pt)->varinfo, const uint8_t))\r\n\r\n/* -- Upvalue object ------------------------------------------------------ */\r\n\r\ntypedef struct GCupval {\r\n  GCHeader;\r\n  uint8_t closed;\t/* Set if closed (i.e. uv->v == &uv->u.value). */\r\n  uint8_t immutable;\t/* Immutable value. */\r\n  union {\r\n    TValue tv;\t\t/* If closed: the value itself. */\r\n    struct {\t\t/* If open: double linked list, anchored at thread. */\r\n      GCRef prev;\r\n      GCRef next;\r\n    };\r\n  };\r\n  MRef v;\t\t/* Points to stack slot (open) or above (closed). */\r\n  uint32_t dhash;\t/* Disambiguation hash: dh1 != dh2 => cannot alias. */\r\n} GCupval;\r\n\r\n#define uvprev(uv_)\t(&gcref((uv_)->prev)->uv)\r\n#define uvnext(uv_)\t(&gcref((uv_)->next)->uv)\r\n#define uvval(uv_)\t(mref((uv_)->v, TValue))\r\n\r\n/* -- Function object (closures) ------------------------------------------ */\r\n\r\n/* Common header for functions. env should be at same offset in GCudata. */\r\n#define GCfuncHeader \\\r\n  GCHeader; uint8_t ffid; uint8_t nupvalues; \\\r\n  GCRef env; GCRef gclist; MRef pc\r\n\r\ntypedef struct GCfuncC {\r\n  GCfuncHeader;\r\n  lua_CFunction f;\t/* C function to be called. */\r\n  TValue upvalue[1];\t/* Array of upvalues (TValue). */\r\n} GCfuncC;\r\n\r\ntypedef struct GCfuncL {\r\n  GCfuncHeader;\r\n  GCRef uvptr[1];\t/* Array of _pointers_ to upvalue objects (GCupval). */\r\n} GCfuncL;\r\n\r\ntypedef union GCfunc {\r\n  GCfuncC c;\r\n  GCfuncL l;\r\n} GCfunc;\r\n\r\n#define FF_LUA\t\t0\r\n#define FF_C\t\t1\r\n#define isluafunc(fn)\t((fn)->c.ffid == FF_LUA)\r\n#define iscfunc(fn)\t((fn)->c.ffid == FF_C)\r\n#define isffunc(fn)\t((fn)->c.ffid > FF_C)\r\n#define funcproto(fn) \\\r\n  check_exp(isluafunc(fn), (GCproto *)(mref((fn)->l.pc, char)-sizeof(GCproto)))\r\n#define sizeCfunc(n)\t(sizeof(GCfuncC)-sizeof(TValue)+sizeof(TValue)*(n))\r\n#define sizeLfunc(n)\t(sizeof(GCfuncL)-sizeof(GCRef)+sizeof(GCRef)*(n))\r\n\r\n/* -- Table object -------------------------------------------------------- */\r\n\r\n/* Hash node. */\r\ntypedef struct Node {\r\n  TValue val;\t\t/* Value object. Must be first field. */\r\n  TValue key;\t\t/* Key object. */\r\n  MRef next;\t\t/* Hash chain. */\r\n  MRef freetop;\t\t/* Top of free elements (stored in t->node[0]). */\r\n} Node;\r\n\r\nLJ_STATIC_ASSERT(offsetof(Node, val) == 0);\r\n\r\ntypedef struct GCtab {\r\n  GCHeader;\r\n  uint8_t nomm;\t\t/* Negative cache for fast metamethods. */\r\n  int8_t colo;\t\t/* Array colocation. */\r\n  MRef array;\t\t/* Array part. */\r\n  GCRef gclist;\r\n  GCRef metatable;\t/* Must be at same offset in GCudata. */\r\n  MRef node;\t\t/* Hash part. */\r\n  uint32_t asize;\t/* Size of array part (keys [0, asize-1]). */\r\n  uint32_t hmask;\t/* Hash part mask (size of hash part - 1). */\r\n} GCtab;\r\n\r\n#define sizetabcolo(n)\t((n)*sizeof(TValue) + sizeof(GCtab))\r\n#define tabref(r)\t(&gcref((r))->tab)\r\n#define noderef(r)\t(mref((r), Node))\r\n#define nextnode(n)\t(mref((n)->next, Node))\r\n\r\n/* -- State objects ------------------------------------------------------- */\r\n\r\n/* VM states. */\r\nenum {\r\n  LJ_VMST_INTERP,\t/* Interpreter. */\r\n  LJ_VMST_C,\t\t/* C function. */\r\n  LJ_VMST_GC,\t\t/* Garbage collector. */\r\n  LJ_VMST_EXIT,\t\t/* Trace exit handler. */\r\n  LJ_VMST_RECORD,\t/* Trace recorder. */\r\n  LJ_VMST_OPT,\t\t/* Optimizer. */\r\n  LJ_VMST_ASM,\t\t/* Assembler. */\r\n  LJ_VMST__MAX\r\n};\r\n\r\n#define setvmstate(g, st)\t((g)->vmstate = ~LJ_VMST_##st)\r\n\r\n/* Metamethods. ORDER MM */\r\n#ifdef LJ_HASFFI\r\n#define MMDEF_FFI(_) _(new)\r\n#else\r\n#define MMDEF_FFI(_)\r\n#endif\r\n\r\n#if LJ_52 || LJ_HASFFI\r\n#define MMDEF_PAIRS(_) _(pairs) _(ipairs)\r\n#else\r\n#define MMDEF_PAIRS(_)\r\n#define MM_pairs\t255\r\n#define MM_ipairs\t255\r\n#endif\r\n\r\n#define MMDEF(_) \\\r\n  _(index) _(newindex) _(gc) _(mode) _(eq) _(len) \\\r\n  /* Only the above (fast) metamethods are negative cached (max. 8). */ \\\r\n  _(lt) _(le) _(concat) _(call) \\\r\n  /* The following must be in ORDER ARITH. */ \\\r\n  _(add) _(sub) _(mul) _(div) _(mod) _(pow) _(unm) \\\r\n  /* The following are used in the standard libraries. */ \\\r\n  _(metatable) _(tostring) MMDEF_FFI(_) MMDEF_PAIRS(_)\r\n\r\ntypedef enum {\r\n#define MMENUM(name)\tMM_##name,\r\nMMDEF(MMENUM)\r\n#undef MMENUM\r\n  MM__MAX,\r\n  MM____ = MM__MAX,\r\n  MM_FAST = MM_len\r\n} MMS;\r\n\r\n/* GC root IDs. */\r\ntypedef enum {\r\n  GCROOT_MMNAME,\t/* Metamethod names. */\r\n  GCROOT_MMNAME_LAST = GCROOT_MMNAME + MM__MAX-1,\r\n  GCROOT_BASEMT,\t/* Metatables for base types. */\r\n  GCROOT_BASEMT_NUM = GCROOT_BASEMT + ~LJ_TNUMX,\r\n  GCROOT_IO_INPUT,\t/* Userdata for default I/O input file. */\r\n  GCROOT_IO_OUTPUT,\t/* Userdata for default I/O output file. */\r\n  GCROOT_MAX\r\n} GCRootID;\r\n\r\n#define basemt_it(g, it)\t((g)->gcroot[GCROOT_BASEMT+~(it)])\r\n#define basemt_obj(g, o)\t((g)->gcroot[GCROOT_BASEMT+itypemap(o)])\r\n#define mmname_str(g, mm)\t(strref((g)->gcroot[GCROOT_MMNAME+(mm)]))\r\n\r\ntypedef struct GCState {\r\n  MSize total;\t\t/* Memory currently allocated. */\r\n  MSize threshold;\t/* Memory threshold. */\r\n  uint8_t currentwhite;\t/* Current white color. */\r\n  uint8_t state;\t/* GC state. */\r\n  uint8_t nocdatafin;\t/* No cdata finalizer called. */\r\n  uint8_t unused2;\r\n  MSize sweepstr;\t/* Sweep position in string table. */\r\n  GCRef root;\t\t/* List of all collectable objects. */\r\n  MRef sweep;\t\t/* Sweep position in root list. */\r\n  GCRef gray;\t\t/* List of gray objects. */\r\n  GCRef grayagain;\t/* List of objects for atomic traversal. */\r\n  GCRef weak;\t\t/* List of weak tables (to be cleared). */\r\n  GCRef mmudata;\t/* List of userdata (to be finalized). */\r\n  MSize stepmul;\t/* Incremental GC step granularity. */\r\n  MSize debt;\t\t/* Debt (how much GC is behind schedule). */\r\n  MSize estimate;\t/* Estimate of memory actually in use. */\r\n  MSize pause;\t\t/* Pause between successive GC cycles. */\r\n} GCState;\r\n\r\n/* Global state, shared by all threads of a Lua universe. */\r\ntypedef struct global_State {\r\n  GCRef *strhash;\t/* String hash table (hash chain anchors). */\r\n  MSize strmask;\t/* String hash mask (size of hash table - 1). */\r\n  MSize strnum;\t\t/* Number of strings in hash table. */\r\n  lua_Alloc allocf;\t/* Memory allocator. */\r\n  void *allocd;\t\t/* Memory allocator data. */\r\n  GCState gc;\t\t/* Garbage collector. */\r\n  SBuf tmpbuf;\t\t/* Temporary buffer for string concatenation. */\r\n  Node nilnode;\t\t/* Fallback 1-element hash part (nil key and value). */\r\n  GCstr strempty;\t/* Empty string. */\r\n  uint8_t stremptyz;\t/* Zero terminator of empty string. */\r\n  uint8_t hookmask;\t/* Hook mask. */\r\n  uint8_t dispatchmode;\t/* Dispatch mode. */\r\n  uint8_t vmevmask;\t/* VM event mask. */\r\n  GCRef mainthref;\t/* Link to main thread. */\r\n  TValue registrytv;\t/* Anchor for registry. */\r\n  TValue tmptv, tmptv2;\t/* Temporary TValues. */\r\n  GCupval uvhead;\t/* Head of double-linked list of all open upvalues. */\r\n  int32_t hookcount;\t/* Instruction hook countdown. */\r\n  int32_t hookcstart;\t/* Start count for instruction hook counter. */\r\n  lua_Hook hookf;\t/* Hook function. */\r\n  lua_CFunction wrapf;\t/* Wrapper for C function calls. */\r\n  lua_CFunction panic;\t/* Called as a last resort for errors. */\r\n  volatile int32_t vmstate;  /* VM state or current JIT code trace number. */\r\n  BCIns bc_cfunc_int;\t/* Bytecode for internal C function calls. */\r\n  BCIns bc_cfunc_ext;\t/* Bytecode for external C function calls. */\r\n  GCRef jit_L;\t\t/* Current JIT code lua_State or NULL. */\r\n  MRef jit_base;\t/* Current JIT code L->base. */\r\n  MRef ctype_state;\t/* Pointer to C type state. */\r\n  GCRef gcroot[GCROOT_MAX];  /* GC roots. */\r\n} global_State;\r\n\r\n#define mainthread(g)\t(&gcref(g->mainthref)->th)\r\n#define niltv(L) \\\r\n  check_exp(tvisnil(&G(L)->nilnode.val), &G(L)->nilnode.val)\r\n#define niltvg(g) \\\r\n  check_exp(tvisnil(&(g)->nilnode.val), &(g)->nilnode.val)\r\n\r\n/* Hook management. Hook event masks are defined in lua.h. */\r\n#define HOOK_EVENTMASK\t\t0x0f\r\n#define HOOK_ACTIVE\t\t0x10\r\n#define HOOK_ACTIVE_SHIFT\t4\r\n#define HOOK_VMEVENT\t\t0x20\r\n#define HOOK_GC\t\t\t0x40\r\n#define hook_active(g)\t\t((g)->hookmask & HOOK_ACTIVE)\r\n#define hook_enter(g)\t\t((g)->hookmask |= HOOK_ACTIVE)\r\n#define hook_entergc(g)\t\t((g)->hookmask |= (HOOK_ACTIVE|HOOK_GC))\r\n#define hook_vmevent(g)\t\t((g)->hookmask |= (HOOK_ACTIVE|HOOK_VMEVENT))\r\n#define hook_leave(g)\t\t((g)->hookmask &= ~HOOK_ACTIVE)\r\n#define hook_save(g)\t\t((g)->hookmask & ~HOOK_EVENTMASK)\r\n#define hook_restore(g, h) \\\r\n  ((g)->hookmask = ((g)->hookmask & HOOK_EVENTMASK) | (h))\r\n\r\n/* Per-thread state object. */\r\nstruct lua_State {\r\n  GCHeader;\r\n  uint8_t dummy_ffid;\t/* Fake FF_C for curr_funcisL() on dummy frames. */\r\n  uint8_t status;\t/* Thread status. */\r\n  MRef glref;\t\t/* Link to global state. */\r\n  GCRef gclist;\t\t/* GC chain. */\r\n  TValue *base;\t\t/* Base of currently executing function. */\r\n  TValue *top;\t\t/* First free slot in the stack. */\r\n  MRef maxstack;\t/* Last free slot in the stack. */\r\n  MRef stack;\t\t/* Stack base. */\r\n  GCRef openupval;\t/* List of open upvalues in the stack. */\r\n  GCRef env;\t\t/* Thread environment (table of globals). */\r\n  void *cframe;\t\t/* End of C stack frame chain. */\r\n  MSize stacksize;\t/* True stack size (incl. LJ_STACK_EXTRA). */\r\n};\r\n\r\n#define G(L)\t\t\t(mref(L->glref, global_State))\r\n#define registry(L)\t\t(&G(L)->registrytv)\r\n\r\n/* Macros to access the currently executing (Lua) function. */\r\n#define curr_func(L)\t\t(&gcref((L->base-1)->fr.func)->fn)\r\n#define curr_funcisL(L)\t\t(isluafunc(curr_func(L)))\r\n#define curr_proto(L)\t\t(funcproto(curr_func(L)))\r\n#define curr_topL(L)\t\t(L->base + curr_proto(L)->framesize)\r\n#define curr_top(L)\t\t(curr_funcisL(L) ? curr_topL(L) : L->top)\r\n\r\n/* -- GC object definition and conversions -------------------------------- */\r\n\r\n/* GC header for generic access to common fields of GC objects. */\r\ntypedef struct GChead {\r\n  GCHeader;\r\n  uint8_t unused1;\r\n  uint8_t unused2;\r\n  GCRef env;\r\n  GCRef gclist;\r\n  GCRef metatable;\r\n} GChead;\r\n\r\n/* The env field SHOULD be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, env) == offsetof(GCfuncL, env));\r\nLJ_STATIC_ASSERT(offsetof(GChead, env) == offsetof(GCudata, env));\r\n\r\n/* The metatable field MUST be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, metatable) == offsetof(GCtab, metatable));\r\nLJ_STATIC_ASSERT(offsetof(GChead, metatable) == offsetof(GCudata, metatable));\r\n\r\n/* The gclist field MUST be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(lua_State, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCproto, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCfuncL, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCtab, gclist));\r\n\r\ntypedef union GCobj {\r\n  GChead gch;\r\n  GCstr str;\r\n  GCupval uv;\r\n  lua_State th;\r\n  GCproto pt;\r\n  GCfunc fn;\r\n  GCcdata cd;\r\n  GCtab tab;\r\n  GCudata ud;\r\n} GCobj;\r\n\r\n/* Macros to convert a GCobj pointer into a specific value. */\r\n#define gco2str(o)\tcheck_exp((o)->gch.gct == ~LJ_TSTR, &(o)->str)\r\n#define gco2uv(o)\tcheck_exp((o)->gch.gct == ~LJ_TUPVAL, &(o)->uv)\r\n#define gco2th(o)\tcheck_exp((o)->gch.gct == ~LJ_TTHREAD, &(o)->th)\r\n#define gco2pt(o)\tcheck_exp((o)->gch.gct == ~LJ_TPROTO, &(o)->pt)\r\n#define gco2func(o)\tcheck_exp((o)->gch.gct == ~LJ_TFUNC, &(o)->fn)\r\n#define gco2cd(o)\tcheck_exp((o)->gch.gct == ~LJ_TCDATA, &(o)->cd)\r\n#define gco2tab(o)\tcheck_exp((o)->gch.gct == ~LJ_TTAB, &(o)->tab)\r\n#define gco2ud(o)\tcheck_exp((o)->gch.gct == ~LJ_TUDATA, &(o)->ud)\r\n\r\n/* Macro to convert any collectable object into a GCobj pointer. */\r\n#define obj2gco(v)\t((GCobj *)(v))\r\n\r\n/* -- TValue getters/setters ---------------------------------------------- */\r\n\r\n#ifdef LUA_USE_ASSERT\r\n#include \"lj_gc.h\"\r\n#endif\r\n\r\n/* Macros to test types. */\r\n#define itype(o)\t((o)->it)\r\n#define tvisnil(o)\t(itype(o) == LJ_TNIL)\r\n#define tvisfalse(o)\t(itype(o) == LJ_TFALSE)\r\n#define tvistrue(o)\t(itype(o) == LJ_TTRUE)\r\n#define tvisbool(o)\t(tvisfalse(o) || tvistrue(o))\r\n#if LJ_64\r\n#define tvislightud(o)\t(((int32_t)itype(o) >> 15) == -2)\r\n#else\r\n#define tvislightud(o)\t(itype(o) == LJ_TLIGHTUD)\r\n#endif\r\n#define tvisstr(o)\t(itype(o) == LJ_TSTR)\r\n#define tvisfunc(o)\t(itype(o) == LJ_TFUNC)\r\n#define tvisthread(o)\t(itype(o) == LJ_TTHREAD)\r\n#define tvisproto(o)\t(itype(o) == LJ_TPROTO)\r\n#define tviscdata(o)\t(itype(o) == LJ_TCDATA)\r\n#define tvistab(o)\t(itype(o) == LJ_TTAB)\r\n#define tvisudata(o)\t(itype(o) == LJ_TUDATA)\r\n#define tvisnumber(o)\t(itype(o) <= LJ_TISNUM)\r\n#define tvisint(o)\t(LJ_DUALNUM && itype(o) == LJ_TISNUM)\r\n#define tvisnum(o)\t(itype(o) < LJ_TISNUM)\r\n\r\n#define tvistruecond(o)\t(itype(o) < LJ_TISTRUECOND)\r\n#define tvispri(o)\t(itype(o) >= LJ_TISPRI)\r\n#define tvistabud(o)\t(itype(o) <= LJ_TISTABUD)  /* && !tvisnum() */\r\n#define tvisgcv(o)\t((itype(o) - LJ_TISGCV) > (LJ_TNUMX - LJ_TISGCV))\r\n\r\n/* Special macros to test numbers for NaN, +0, -0, +1 and raw equality. */\r\n#define tvisnan(o)\t((o)->n != (o)->n)\r\n#if LJ_64\r\n#define tviszero(o)\t(((o)->u64 << 1) == 0)\r\n#else\r\n#define tviszero(o)\t(((o)->u32.lo | ((o)->u32.hi << 1)) == 0)\r\n#endif\r\n#define tvispzero(o)\t((o)->u64 == 0)\r\n#define tvismzero(o)\t((o)->u64 == U64x(80000000,00000000))\r\n#define tvispone(o)\t((o)->u64 == U64x(3ff00000,00000000))\r\n#define rawnumequal(o1, o2)\t((o1)->u64 == (o2)->u64)\r\n\r\n/* Macros to convert type ids. */\r\n#if LJ_64\r\n#define itypemap(o) \\\r\n  (tvisnumber(o) ? ~LJ_TNUMX : tvislightud(o) ? ~LJ_TLIGHTUD : ~itype(o))\r\n#else\r\n#define itypemap(o)\t(tvisnumber(o) ? ~LJ_TNUMX : ~itype(o))\r\n#endif\r\n\r\n/* Macros to get tagged values. */\r\n#define gcval(o)\t(gcref((o)->gcr))\r\n#define boolV(o)\tcheck_exp(tvisbool(o), (LJ_TFALSE - (o)->it))\r\n#if LJ_64\r\n#define lightudV(o) \\\r\n  check_exp(tvislightud(o), (void *)((o)->u64 & U64x(00007fff,ffffffff)))\r\n#else\r\n#define lightudV(o)\tcheck_exp(tvislightud(o), gcrefp((o)->gcr, void))\r\n#endif\r\n#define gcV(o)\t\tcheck_exp(tvisgcv(o), gcval(o))\r\n#define strV(o)\t\tcheck_exp(tvisstr(o), &gcval(o)->str)\r\n#define funcV(o)\tcheck_exp(tvisfunc(o), &gcval(o)->fn)\r\n#define threadV(o)\tcheck_exp(tvisthread(o), &gcval(o)->th)\r\n#define protoV(o)\tcheck_exp(tvisproto(o), &gcval(o)->pt)\r\n#define cdataV(o)\tcheck_exp(tviscdata(o), &gcval(o)->cd)\r\n#define tabV(o)\t\tcheck_exp(tvistab(o), &gcval(o)->tab)\r\n#define udataV(o)\tcheck_exp(tvisudata(o), &gcval(o)->ud)\r\n#define numV(o)\t\tcheck_exp(tvisnum(o), (o)->n)\r\n#define intV(o)\t\tcheck_exp(tvisint(o), (int32_t)(o)->i)\r\n\r\n/* Macros to set tagged values. */\r\n#define setitype(o, i)\t\t((o)->it = (i))\r\n#define setnilV(o)\t\t((o)->it = LJ_TNIL)\r\n#define setboolV(o, x)\t\t((o)->it = LJ_TFALSE-(uint32_t)(x))\r\n\r\nstatic LJ_AINLINE void setlightudV(TValue *o, void *p)\r\n{\r\n#if LJ_64\r\n  o->u64 = (uint64_t)p | (((uint64_t)0xffff) << 48);\r\n#else\r\n  setgcrefp(o->gcr, p); setitype(o, LJ_TLIGHTUD);\r\n#endif\r\n}\r\n\r\n#if LJ_64\r\n#define checklightudptr(L, p) \\\r\n  (((uint64_t)(p) >> 47) ? (lj_err_msg(L, LJ_ERR_BADLU), NULL) : (p))\r\n#define setcont(o, f) \\\r\n  ((o)->u64 = (uint64_t)(void *)(f) - (uint64_t)lj_vm_asm_begin)\r\n#else\r\n#define checklightudptr(L, p)\t(p)\r\n#define setcont(o, f)\t\tsetlightudV((o), (void *)(f))\r\n#endif\r\n\r\n#define tvchecklive(L, o) \\\r\n  UNUSED(L), lua_assert(!tvisgcv(o) || \\\r\n  ((~itype(o) == gcval(o)->gch.gct) && !isdead(G(L), gcval(o))))\r\n\r\nstatic LJ_AINLINE void setgcV(lua_State *L, TValue *o, GCobj *v, uint32_t itype)\r\n{\r\n  setgcref(o->gcr, v); setitype(o, itype); tvchecklive(L, o);\r\n}\r\n\r\n#define define_setV(name, type, tag) \\\r\nstatic LJ_AINLINE void name(lua_State *L, TValue *o, type *v) \\\r\n{ \\\r\n  setgcV(L, o, obj2gco(v), tag); \\\r\n}\r\ndefine_setV(setstrV, GCstr, LJ_TSTR)\r\ndefine_setV(setthreadV, lua_State, LJ_TTHREAD)\r\ndefine_setV(setprotoV, GCproto, LJ_TPROTO)\r\ndefine_setV(setfuncV, GCfunc, LJ_TFUNC)\r\ndefine_setV(setcdataV, GCcdata, LJ_TCDATA)\r\ndefine_setV(settabV, GCtab, LJ_TTAB)\r\ndefine_setV(setudataV, GCudata, LJ_TUDATA)\r\n\r\n#define setnumV(o, x)\t\t((o)->n = (x))\r\n#define setnanV(o)\t\t((o)->u64 = U64x(fff80000,00000000))\r\n#define setpinfV(o)\t\t((o)->u64 = U64x(7ff00000,00000000))\r\n#define setminfV(o)\t\t((o)->u64 = U64x(fff00000,00000000))\r\n\r\nstatic LJ_AINLINE void setintV(TValue *o, int32_t i)\r\n{\r\n#if LJ_DUALNUM\r\n  o->i = (uint32_t)i; setitype(o, LJ_TISNUM);\r\n#else\r\n  o->n = (lua_Number)i;\r\n#endif\r\n}\r\n\r\nstatic LJ_AINLINE void setint64V(TValue *o, int64_t i)\r\n{\r\n  if (LJ_DUALNUM && LJ_LIKELY(i == (int64_t)(int32_t)i))\r\n    setintV(o, (int32_t)i);\r\n  else\r\n    setnumV(o, (lua_Number)i);\r\n}\r\n\r\n#if LJ_64\r\n#define setintptrV(o, i)\tsetint64V((o), (i))\r\n#else\r\n#define setintptrV(o, i)\tsetintV((o), (i))\r\n#endif\r\n\r\n/* Copy tagged values. */\r\nstatic LJ_AINLINE void copyTV(lua_State *L, TValue *o1, const TValue *o2)\r\n{\r\n  *o1 = *o2; tvchecklive(L, o1);\r\n}\r\n\r\n/* -- Number to integer conversion ---------------------------------------- */\r\n\r\n#if LJ_SOFTFP\r\nLJ_ASMF int32_t lj_vm_tobit(double x);\r\n#endif\r\n\r\nstatic LJ_AINLINE int32_t lj_num2bit(lua_Number n)\r\n{\r\n#if LJ_SOFTFP\r\n  return lj_vm_tobit(n);\r\n#else\r\n  TValue o;\r\n  o.n = n + 6755399441055744.0;  /* 2^52 + 2^51 */\r\n  return (int32_t)o.u32.lo;\r\n#endif\r\n}\r\n\r\n#if LJ_TARGET_X86 && !defined(__SSE2__)\r\n#define lj_num2int(n)   lj_num2bit((n))\r\n#else\r\n#define lj_num2int(n)   ((int32_t)(n))\r\n#endif\r\n\r\nstatic LJ_AINLINE uint64_t lj_num2u64(lua_Number n)\r\n{\r\n#ifdef _MSC_VER\r\n  if (n >= 9223372036854775808.0)  /* They think it's a feature. */\r\n    return (uint64_t)(int64_t)(n - 18446744073709551616.0);\r\n  else\r\n#endif\r\n    return (uint64_t)n;\r\n}\r\n\r\nstatic LJ_AINLINE int32_t numberVint(cTValue *o)\r\n{\r\n  if (LJ_LIKELY(tvisint(o)))\r\n    return intV(o);\r\n  else\r\n    return lj_num2int(numV(o));\r\n}\r\n\r\nstatic LJ_AINLINE lua_Number numberVnum(cTValue *o)\r\n{\r\n  if (LJ_UNLIKELY(tvisint(o)))\r\n    return (lua_Number)intV(o);\r\n  else\r\n    return numV(o);\r\n}\r\n\r\n/* -- Miscellaneous object handling --------------------------------------- */\r\n\r\n/* Names and maps for internal and external object tags. */\r\nLJ_DATA const char *const lj_obj_typename[1+LUA_TCDATA+1];\r\nLJ_DATA const char *const lj_obj_itypename[~LJ_TNUMX+1];\r\n\r\n#define lj_typename(o)\t(lj_obj_itypename[itypemap(o)])\r\n\r\n/* Compare two objects without calling metamethods. */\r\nLJ_FUNC int lj_obj_equal(cTValue *o1, cTValue *o2);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_dce.c",
    "content": "/*\r\n** DCE: Dead Code Elimination. Pre-LOOP only -- ASM already performs DCE.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_dce_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Scan through all snapshots and mark all referenced instructions. */\r\nstatic void dce_marksnap(jit_State *J)\r\n{\r\n  SnapNo i, nsnap = J->cur.nsnap;\r\n  for (i = 0; i < nsnap; i++) {\r\n    SnapShot *snap = &J->cur.snap[i];\r\n    SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n    MSize n, nent = snap->nent;\r\n    for (n = 0; n < nent; n++) {\r\n      IRRef ref = snap_ref(map[n]);\r\n      if (ref >= REF_FIRST)\r\n\tirt_setmark(IR(ref)->t);\r\n    }\r\n  }\r\n}\r\n\r\n/* Backwards propagate marks. Replace unused instructions with NOPs. */\r\nstatic void dce_propagate(jit_State *J)\r\n{\r\n  IRRef1 *pchain[IR__MAX];\r\n  IRRef ins;\r\n  uint32_t i;\r\n  for (i = 0; i < IR__MAX; i++) pchain[i] = &J->chain[i];\r\n  for (ins = J->cur.nins-1; ins >= REF_FIRST; ins--) {\r\n    IRIns *ir = IR(ins);\r\n    if (irt_ismarked(ir->t)) {\r\n      irt_clearmark(ir->t);\r\n      pchain[ir->o] = &ir->prev;\r\n    } else if (!ir_sideeff(ir)) {\r\n      *pchain[ir->o] = ir->prev;  /* Reroute original instruction chain. */\r\n      ir->t.irt = IRT_NIL;\r\n      ir->o = IR_NOP;  /* Replace instruction with NOP. */\r\n      ir->op1 = ir->op2 = 0;\r\n      ir->prev = 0;\r\n      continue;\r\n    }\r\n    if (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t);\r\n    if (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t);\r\n  }\r\n}\r\n\r\n/* Dead Code Elimination.\r\n**\r\n** First backpropagate marks for all used instructions. Then replace\r\n** the unused ones with a NOP. Note that compressing the IR to eliminate\r\n** the NOPs does not pay off.\r\n*/\r\nvoid lj_opt_dce(jit_State *J)\r\n{\r\n  if ((J->flags & JIT_F_OPT_DCE)) {\r\n    dce_marksnap(J);\r\n    dce_propagate(J);\r\n    memset(J->bpropcache, 0, sizeof(J->bpropcache));  /* Invalidate cache. */\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_fold.c",
    "content": "/*\r\n** FOLD: Constant Folding, Algebraic Simplifications and Reassociation.\r\n** ABCelim: Array Bounds Check Elimination.\r\n** CSE: Common-Subexpression Elimination.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_fold_c\r\n#define LUA_CORE\r\n\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_carith.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* Here's a short description how the FOLD engine processes instructions:\r\n**\r\n** The FOLD engine receives a single instruction stored in fins (J->fold.ins).\r\n** The instruction and its operands are used to select matching fold rules.\r\n** These are applied iteratively until a fixed point is reached.\r\n**\r\n** The 8 bit opcode of the instruction itself plus the opcodes of the\r\n** two instructions referenced by its operands form a 24 bit key\r\n** 'ins left right' (unused operands -> 0, literals -> lowest 8 bits).\r\n**\r\n** This key is used for partial matching against the fold rules. The\r\n** left/right operand fields of the key are successively masked with\r\n** the 'any' wildcard, from most specific to least specific:\r\n**\r\n**   ins left right\r\n**   ins any  right\r\n**   ins left any\r\n**   ins any  any\r\n**\r\n** The masked key is used to lookup a matching fold rule in a semi-perfect\r\n** hash table. If a matching rule is found, the related fold function is run.\r\n** Multiple rules can share the same fold function. A fold rule may return\r\n** one of several special values:\r\n**\r\n** - NEXTFOLD means no folding was applied, because an additional test\r\n**   inside the fold function failed. Matching continues against less\r\n**   specific fold rules. Finally the instruction is passed on to CSE.\r\n**\r\n** - RETRYFOLD means the instruction was modified in-place. Folding is\r\n**   retried as if this instruction had just been received.\r\n**\r\n** All other return values are terminal actions -- no further folding is\r\n** applied:\r\n**\r\n** - INTFOLD(i) returns a reference to the integer constant i.\r\n**\r\n** - LEFTFOLD and RIGHTFOLD return the left/right operand reference\r\n**   without emitting an instruction.\r\n**\r\n** - CSEFOLD and EMITFOLD pass the instruction directly to CSE or emit\r\n**   it without passing through any further optimizations.\r\n**\r\n** - FAILFOLD, DROPFOLD and CONDFOLD only apply to instructions which have\r\n**   no result (e.g. guarded assertions): FAILFOLD means the guard would\r\n**   always fail, i.e. the current trace is pointless. DROPFOLD means\r\n**   the guard is always true and has been eliminated. CONDFOLD is a\r\n**   shortcut for FAILFOLD + cond (i.e. drop if true, otherwise fail).\r\n**\r\n** - Any other return value is interpreted as an IRRef or TRef. This\r\n**   can be a reference to an existing or a newly created instruction.\r\n**   Only the least-significant 16 bits (IRRef1) are used to form a TRef\r\n**   which is finally returned to the caller.\r\n**\r\n** The FOLD engine receives instructions both from the trace recorder and\r\n** substituted instructions from LOOP unrolling. This means all types\r\n** of instructions may end up here, even though the recorder bypasses\r\n** FOLD in some cases. Thus all loads, stores and allocations must have\r\n** an any/any rule to avoid being passed on to CSE.\r\n**\r\n** Carefully read the following requirements before adding or modifying\r\n** any fold rules:\r\n**\r\n** Requirement #1: All fold rules must preserve their destination type.\r\n**\r\n** Consistently use INTFOLD() (KINT result) or lj_ir_knum() (KNUM result).\r\n** Never use lj_ir_knumint() which can have either a KINT or KNUM result.\r\n**\r\n** Requirement #2: Fold rules should not create *new* instructions which\r\n** reference operands *across* PHIs.\r\n**\r\n** E.g. a RETRYFOLD with 'fins->op1 = fleft->op1' is invalid if the\r\n** left operand is a PHI. Then fleft->op1 would point across the PHI\r\n** frontier to an invariant instruction. Adding a PHI for this instruction\r\n** would be counterproductive. The solution is to add a barrier which\r\n** prevents folding across PHIs, i.e. 'PHIBARRIER(fleft)' in this case.\r\n** The only exception is for recurrences with high latencies like\r\n** repeated int->num->int conversions.\r\n**\r\n** One could relax this condition a bit if the referenced instruction is\r\n** a PHI, too. But this often leads to worse code due to excessive\r\n** register shuffling.\r\n**\r\n** Note: returning *existing* instructions (e.g. LEFTFOLD) is ok, though.\r\n** Even returning fleft->op1 would be ok, because a new PHI will added,\r\n** if needed. But again, this leads to excessive register shuffling and\r\n** should be avoided.\r\n**\r\n** Requirement #3: The set of all fold rules must be monotonic to guarantee\r\n** termination.\r\n**\r\n** The goal is optimization, so one primarily wants to add strength-reducing\r\n** rules. This means eliminating an instruction or replacing an instruction\r\n** with one or more simpler instructions. Don't add fold rules which point\r\n** into the other direction.\r\n**\r\n** Some rules (like commutativity) do not directly reduce the strength of\r\n** an instruction, but enable other fold rules (e.g. by moving constants\r\n** to the right operand). These rules must be made unidirectional to avoid\r\n** cycles.\r\n**\r\n** Rule of thumb: the trace recorder expands the IR and FOLD shrinks it.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t(&J->fold.ins)\r\n#define fleft\t\t(&J->fold.left)\r\n#define fright\t\t(&J->fold.right)\r\n#define knumleft\t(ir_knum(fleft)->n)\r\n#define knumright\t(ir_knum(fright)->n)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Fold function type. Fastcall on x86 significantly reduces their size. */\r\ntypedef IRRef (LJ_FASTCALL *FoldFunc)(jit_State *J);\r\n\r\n/* Macros for the fold specs, so buildvm can recognize them. */\r\n#define LJFOLD(x)\r\n#define LJFOLDX(x)\r\n#define LJFOLDF(name)\tstatic TRef LJ_FASTCALL fold_##name(jit_State *J)\r\n/* Note: They must be at the start of a line or buildvm ignores them! */\r\n\r\n/* Barrier to prevent using operands across PHIs. */\r\n#define PHIBARRIER(ir)\tif (irt_isphi((ir)->t)) return NEXTFOLD\r\n\r\n/* Barrier to prevent folding across a GC step.\r\n** GC steps can only happen at the head of a trace and at LOOP.\r\n** And the GC is only driven forward if there is at least one allocation.\r\n*/\r\n#define gcstep_barrier(J, ref) \\\r\n  ((ref) < J->chain[IR_LOOP] && \\\r\n   (J->chain[IR_SNEW] || J->chain[IR_XSNEW] || \\\r\n    J->chain[IR_TNEW] || J->chain[IR_TDUP] || \\\r\n    J->chain[IR_CNEW] || J->chain[IR_CNEWI] || J->chain[IR_TOSTR]))\r\n\r\n/* -- Constant folding for FP numbers ------------------------------------- */\r\n\r\nLJFOLD(ADD KNUM KNUM)\r\nLJFOLD(SUB KNUM KNUM)\r\nLJFOLD(MUL KNUM KNUM)\r\nLJFOLD(DIV KNUM KNUM)\r\nLJFOLD(NEG KNUM KNUM)\r\nLJFOLD(ABS KNUM KNUM)\r\nLJFOLD(ATAN2 KNUM KNUM)\r\nLJFOLD(LDEXP KNUM KNUM)\r\nLJFOLD(MIN KNUM KNUM)\r\nLJFOLD(MAX KNUM KNUM)\r\nLJFOLDF(kfold_numarith)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number b = knumright;\r\n  lua_Number y = lj_vm_foldarith(a, b, fins->o - IR_ADD);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\nLJFOLD(LDEXP KNUM KINT)\r\nLJFOLDF(kfold_ldexp)\r\n{\r\n#if LJ_TARGET_X86ORX64\r\n  UNUSED(J);\r\n  return NEXTFOLD;\r\n#else\r\n  return lj_ir_knum(J, ldexp(knumleft, fright->i));\r\n#endif\r\n}\r\n\r\nLJFOLD(FPMATH KNUM any)\r\nLJFOLDF(kfold_fpmath)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number y = lj_vm_foldfpm(a, fins->op2);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\nLJFOLD(POW KNUM KINT)\r\nLJFOLDF(kfold_numpow)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number b = (lua_Number)fright->i;\r\n  lua_Number y = lj_vm_foldarith(a, b, IR_POW - IR_ADD);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\n/* Must not use kfold_kref for numbers (could be NaN). */\r\nLJFOLD(EQ KNUM KNUM)\r\nLJFOLD(NE KNUM KNUM)\r\nLJFOLD(LT KNUM KNUM)\r\nLJFOLD(GE KNUM KNUM)\r\nLJFOLD(LE KNUM KNUM)\r\nLJFOLD(GT KNUM KNUM)\r\nLJFOLD(ULT KNUM KNUM)\r\nLJFOLD(UGE KNUM KNUM)\r\nLJFOLD(ULE KNUM KNUM)\r\nLJFOLD(UGT KNUM KNUM)\r\nLJFOLDF(kfold_numcomp)\r\n{\r\n  return CONDFOLD(lj_ir_numcmp(knumleft, knumright, (IROp)fins->o));\r\n}\r\n\r\n/* -- Constant folding for 32 bit integers -------------------------------- */\r\n\r\nstatic int32_t kfold_intop(int32_t k1, int32_t k2, IROp op)\r\n{\r\n  switch (op) {\r\n  case IR_ADD: k1 += k2; break;\r\n  case IR_SUB: k1 -= k2; break;\r\n  case IR_MUL: k1 *= k2; break;\r\n  case IR_MOD: k1 = lj_vm_modi(k1, k2); break;\r\n  case IR_NEG: k1 = -k1; break;\r\n  case IR_BAND: k1 &= k2; break;\r\n  case IR_BOR: k1 |= k2; break;\r\n  case IR_BXOR: k1 ^= k2; break;\r\n  case IR_BSHL: k1 <<= (k2 & 31); break;\r\n  case IR_BSHR: k1 = (int32_t)((uint32_t)k1 >> (k2 & 31)); break;\r\n  case IR_BSAR: k1 >>= (k2 & 31); break;\r\n  case IR_BROL: k1 = (int32_t)lj_rol((uint32_t)k1, (k2 & 31)); break;\r\n  case IR_BROR: k1 = (int32_t)lj_ror((uint32_t)k1, (k2 & 31)); break;\r\n  case IR_MIN: k1 = k1 < k2 ? k1 : k2; break;\r\n  case IR_MAX: k1 = k1 > k2 ? k1 : k2; break;\r\n  default: lua_assert(0); break;\r\n  }\r\n  return k1;\r\n}\r\n\r\nLJFOLD(ADD KINT KINT)\r\nLJFOLD(SUB KINT KINT)\r\nLJFOLD(MUL KINT KINT)\r\nLJFOLD(MOD KINT KINT)\r\nLJFOLD(NEG KINT KINT)\r\nLJFOLD(BAND KINT KINT)\r\nLJFOLD(BOR KINT KINT)\r\nLJFOLD(BXOR KINT KINT)\r\nLJFOLD(BSHL KINT KINT)\r\nLJFOLD(BSHR KINT KINT)\r\nLJFOLD(BSAR KINT KINT)\r\nLJFOLD(BROL KINT KINT)\r\nLJFOLD(BROR KINT KINT)\r\nLJFOLD(MIN KINT KINT)\r\nLJFOLD(MAX KINT KINT)\r\nLJFOLDF(kfold_intarith)\r\n{\r\n  return INTFOLD(kfold_intop(fleft->i, fright->i, (IROp)fins->o));\r\n}\r\n\r\nLJFOLD(ADDOV KINT KINT)\r\nLJFOLD(SUBOV KINT KINT)\r\nLJFOLD(MULOV KINT KINT)\r\nLJFOLDF(kfold_intovarith)\r\n{\r\n  lua_Number n = lj_vm_foldarith((lua_Number)fleft->i, (lua_Number)fright->i,\r\n\t\t\t\t fins->o - IR_ADDOV);\r\n  int32_t k = lj_num2int(n);\r\n  if (n != (lua_Number)k)\r\n    return FAILFOLD;\r\n  return INTFOLD(k);\r\n}\r\n\r\nLJFOLD(BNOT KINT)\r\nLJFOLDF(kfold_bnot)\r\n{\r\n  return INTFOLD(~fleft->i);\r\n}\r\n\r\nLJFOLD(BSWAP KINT)\r\nLJFOLDF(kfold_bswap)\r\n{\r\n  return INTFOLD((int32_t)lj_bswap((uint32_t)fleft->i));\r\n}\r\n\r\nLJFOLD(LT KINT KINT)\r\nLJFOLD(GE KINT KINT)\r\nLJFOLD(LE KINT KINT)\r\nLJFOLD(GT KINT KINT)\r\nLJFOLD(ULT KINT KINT)\r\nLJFOLD(UGE KINT KINT)\r\nLJFOLD(ULE KINT KINT)\r\nLJFOLD(UGT KINT KINT)\r\nLJFOLD(ABC KINT KINT)\r\nLJFOLDF(kfold_intcomp)\r\n{\r\n  int32_t a = fleft->i, b = fright->i;\r\n  switch ((IROp)fins->o) {\r\n  case IR_LT: return CONDFOLD(a < b);\r\n  case IR_GE: return CONDFOLD(a >= b);\r\n  case IR_LE: return CONDFOLD(a <= b);\r\n  case IR_GT: return CONDFOLD(a > b);\r\n  case IR_ULT: return CONDFOLD((uint32_t)a < (uint32_t)b);\r\n  case IR_UGE: return CONDFOLD((uint32_t)a >= (uint32_t)b);\r\n  case IR_ULE: return CONDFOLD((uint32_t)a <= (uint32_t)b);\r\n  case IR_ABC:\r\n  case IR_UGT: return CONDFOLD((uint32_t)a > (uint32_t)b);\r\n  default: lua_assert(0); return FAILFOLD;\r\n  }\r\n}\r\n\r\nLJFOLD(UGE any KINT)\r\nLJFOLDF(kfold_intcomp0)\r\n{\r\n  if (fright->i == 0)\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding for 64 bit integers -------------------------------- */\r\n\r\nstatic uint64_t kfold_int64arith(uint64_t k1, uint64_t k2, IROp op)\r\n{\r\n  switch (op) {\r\n#if LJ_64 || LJ_HASFFI\r\n  case IR_ADD: k1 += k2; break;\r\n  case IR_SUB: k1 -= k2; break;\r\n#endif\r\n#if LJ_HASFFI\r\n  case IR_MUL: k1 *= k2; break;\r\n  case IR_BAND: k1 &= k2; break;\r\n  case IR_BOR: k1 |= k2; break;\r\n  case IR_BXOR: k1 ^= k2; break;\r\n#endif\r\n  default: UNUSED(k2); lua_assert(0); break;\r\n  }\r\n  return k1;\r\n}\r\n\r\nLJFOLD(ADD KINT64 KINT64)\r\nLJFOLD(SUB KINT64 KINT64)\r\nLJFOLD(MUL KINT64 KINT64)\r\nLJFOLD(BAND KINT64 KINT64)\r\nLJFOLD(BOR KINT64 KINT64)\r\nLJFOLD(BXOR KINT64 KINT64)\r\nLJFOLDF(kfold_int64arith)\r\n{\r\n  return INT64FOLD(kfold_int64arith(ir_k64(fleft)->u64,\r\n\t\t\t\t    ir_k64(fright)->u64, (IROp)fins->o));\r\n}\r\n\r\nLJFOLD(DIV KINT64 KINT64)\r\nLJFOLD(MOD KINT64 KINT64)\r\nLJFOLD(POW KINT64 KINT64)\r\nLJFOLDF(kfold_int64arith2)\r\n{\r\n#if LJ_HASFFI\r\n  uint64_t k1 = ir_k64(fleft)->u64, k2 = ir_k64(fright)->u64;\r\n  if (irt_isi64(fins->t)) {\r\n    k1 = fins->o == IR_DIV ? lj_carith_divi64((int64_t)k1, (int64_t)k2) :\r\n\t fins->o == IR_MOD ? lj_carith_modi64((int64_t)k1, (int64_t)k2) :\r\n\t\t\t     lj_carith_powi64((int64_t)k1, (int64_t)k2);\r\n  } else {\r\n    k1 = fins->o == IR_DIV ? lj_carith_divu64(k1, k2) :\r\n\t fins->o == IR_MOD ? lj_carith_modu64(k1, k2) :\r\n\t\t\t     lj_carith_powu64(k1, k2);\r\n  }\r\n  return INT64FOLD(k1);\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BSHL KINT64 KINT)\r\nLJFOLD(BSHR KINT64 KINT)\r\nLJFOLD(BSAR KINT64 KINT)\r\nLJFOLD(BROL KINT64 KINT)\r\nLJFOLD(BROR KINT64 KINT)\r\nLJFOLDF(kfold_int64shift)\r\n{\r\n#if LJ_HASFFI || LJ_64\r\n  uint64_t k = ir_k64(fleft)->u64;\r\n  int32_t sh = (fright->i & 63);\r\n  switch ((IROp)fins->o) {\r\n  case IR_BSHL: k <<= sh; break;\r\n#if LJ_HASFFI\r\n  case IR_BSHR: k >>= sh; break;\r\n  case IR_BSAR: k = (uint64_t)((int64_t)k >> sh); break;\r\n  case IR_BROL: k = lj_rol(k, sh); break;\r\n  case IR_BROR: k = lj_ror(k, sh); break;\r\n#endif\r\n  default: lua_assert(0); break;\r\n  }\r\n  return INT64FOLD(k);\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BNOT KINT64)\r\nLJFOLDF(kfold_bnot64)\r\n{\r\n#if LJ_HASFFI\r\n  return INT64FOLD(~ir_k64(fleft)->u64);\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BSWAP KINT64)\r\nLJFOLDF(kfold_bswap64)\r\n{\r\n#if LJ_HASFFI\r\n  return INT64FOLD(lj_bswap64(ir_k64(fleft)->u64));\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(LT KINT64 KINT64)\r\nLJFOLD(GE KINT64 KINT64)\r\nLJFOLD(LE KINT64 KINT64)\r\nLJFOLD(GT KINT64 KINT64)\r\nLJFOLD(ULT KINT64 KINT64)\r\nLJFOLD(UGE KINT64 KINT64)\r\nLJFOLD(ULE KINT64 KINT64)\r\nLJFOLD(UGT KINT64 KINT64)\r\nLJFOLDF(kfold_int64comp)\r\n{\r\n#if LJ_HASFFI\r\n  uint64_t a = ir_k64(fleft)->u64, b = ir_k64(fright)->u64;\r\n  switch ((IROp)fins->o) {\r\n  case IR_LT: return CONDFOLD(a < b);\r\n  case IR_GE: return CONDFOLD(a >= b);\r\n  case IR_LE: return CONDFOLD(a <= b);\r\n  case IR_GT: return CONDFOLD(a > b);\r\n  case IR_ULT: return CONDFOLD((uint64_t)a < (uint64_t)b);\r\n  case IR_UGE: return CONDFOLD((uint64_t)a >= (uint64_t)b);\r\n  case IR_ULE: return CONDFOLD((uint64_t)a <= (uint64_t)b);\r\n  case IR_UGT: return CONDFOLD((uint64_t)a > (uint64_t)b);\r\n  default: lua_assert(0); return FAILFOLD;\r\n  }\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(UGE any KINT64)\r\nLJFOLDF(kfold_int64comp0)\r\n{\r\n#if LJ_HASFFI\r\n  if (ir_k64(fright)->u64 == 0)\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\n/* -- Constant folding for strings ---------------------------------------- */\r\n\r\nLJFOLD(SNEW KKPTR KINT)\r\nLJFOLDF(kfold_snew_kptr)\r\n{\r\n  GCstr *s = lj_str_new(J->L, (const char *)ir_kptr(fleft), (size_t)fright->i);\r\n  return lj_ir_kstr(J, s);\r\n}\r\n\r\nLJFOLD(SNEW any KINT)\r\nLJFOLDF(kfold_snew_empty)\r\n{\r\n  if (fright->i == 0)\r\n    return lj_ir_kstr(J, &J2G(J)->strempty);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(STRREF KGC KINT)\r\nLJFOLDF(kfold_strref)\r\n{\r\n  GCstr *str = ir_kstr(fleft);\r\n  lua_assert((MSize)fright->i <= str->len);\r\n  return lj_ir_kkptr(J, (char *)strdata(str) + fright->i);\r\n}\r\n\r\nLJFOLD(STRREF SNEW any)\r\nLJFOLDF(kfold_strref_snew)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if (irref_isk(fins->op2) && fright->i == 0) {\r\n    return fleft->op1;  /* strref(snew(ptr, len), 0) ==> ptr */\r\n  } else {\r\n    /* Reassociate: strref(snew(strref(str, a), len), b) ==> strref(str, a+b) */\r\n    IRIns *ir = IR(fleft->op1);\r\n    if (ir->o == IR_STRREF) {\r\n      IRRef1 str = ir->op1;  /* IRIns * is not valid across emitir. */\r\n      PHIBARRIER(ir);\r\n      fins->op2 = emitir(IRTI(IR_ADD), ir->op2, fins->op2); /* Clobbers fins! */\r\n      fins->op1 = str;\r\n      fins->ot = IRT(IR_STRREF, IRT_P32);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CALLN CARG IRCALL_lj_str_cmp)\r\nLJFOLDF(kfold_strcmp)\r\n{\r\n  if (irref_isk(fleft->op1) && irref_isk(fleft->op2)) {\r\n    GCstr *a = ir_kstr(IR(fleft->op1));\r\n    GCstr *b = ir_kstr(IR(fleft->op2));\r\n    return INTFOLD(lj_str_cmp(a, b));\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding of pointer arithmetic ------------------------------ */\r\n\r\nLJFOLD(ADD KGC KINT)\r\nLJFOLD(ADD KGC KINT64)\r\nLJFOLDF(kfold_add_kgc)\r\n{\r\n  GCobj *o = ir_kgc(fleft);\r\n#if LJ_64\r\n  ptrdiff_t ofs = (ptrdiff_t)ir_kint64(fright)->u64;\r\n#else\r\n  ptrdiff_t ofs = fright->i;\r\n#endif\r\n#if LJ_HASFFI\r\n  if (irt_iscdata(fleft->t)) {\r\n    CType *ct = ctype_raw(ctype_ctsG(J2G(J)), gco2cd(o)->ctypeid);\r\n    if (ctype_isnum(ct->info) || ctype_isenum(ct->info) ||\r\n\tctype_isptr(ct->info) || ctype_isfunc(ct->info) ||\r\n\tctype_iscomplex(ct->info) || ctype_isvector(ct->info))\r\n      return lj_ir_kkptr(J, (char *)o + ofs);\r\n  }\r\n#endif\r\n  return lj_ir_kptr(J, (char *)o + ofs);\r\n}\r\n\r\nLJFOLD(ADD KPTR KINT)\r\nLJFOLD(ADD KPTR KINT64)\r\nLJFOLD(ADD KKPTR KINT)\r\nLJFOLD(ADD KKPTR KINT64)\r\nLJFOLDF(kfold_add_kptr)\r\n{\r\n  void *p = ir_kptr(fleft);\r\n#if LJ_64\r\n  ptrdiff_t ofs = (ptrdiff_t)ir_kint64(fright)->u64;\r\n#else\r\n  ptrdiff_t ofs = fright->i;\r\n#endif\r\n  return lj_ir_kptr_(J, fleft->o, (char *)p + ofs);\r\n}\r\n\r\nLJFOLD(ADD any KGC)\r\nLJFOLD(ADD any KPTR)\r\nLJFOLD(ADD any KKPTR)\r\nLJFOLDF(kfold_add_kright)\r\n{\r\n  if (fleft->o == IR_KINT || fleft->o == IR_KINT64) {\r\n    IRRef1 tmp = fins->op1; fins->op1 = fins->op2; fins->op2 = tmp;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding of conversions ------------------------------------- */\r\n\r\nLJFOLD(TOBIT KNUM KNUM)\r\nLJFOLDF(kfold_tobit)\r\n{\r\n  return INTFOLD(lj_num2bit(knumleft));\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_NUM_INT)\r\nLJFOLDF(kfold_conv_kint_num)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_NUM_U32)\r\nLJFOLDF(kfold_conv_kintu32_num)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)(uint32_t)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_INT_I8)\r\nLJFOLD(CONV KINT IRCONV_INT_U8)\r\nLJFOLD(CONV KINT IRCONV_INT_I16)\r\nLJFOLD(CONV KINT IRCONV_INT_U16)\r\nLJFOLDF(kfold_conv_kint_ext)\r\n{\r\n  int32_t k = fleft->i;\r\n  if ((fins->op2 & IRCONV_SRCMASK) == IRT_I8) k = (int8_t)k;\r\n  else if ((fins->op2 & IRCONV_SRCMASK) == IRT_U8) k = (uint8_t)k;\r\n  else if ((fins->op2 & IRCONV_SRCMASK) == IRT_I16) k = (int16_t)k;\r\n  else k = (uint16_t)k;\r\n  return INTFOLD(k);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_I64_INT)\r\nLJFOLD(CONV KINT IRCONV_U64_INT)\r\nLJFOLD(CONV KINT IRCONV_I64_U32)\r\nLJFOLD(CONV KINT IRCONV_U64_U32)\r\nLJFOLDF(kfold_conv_kint_i64)\r\n{\r\n  if ((fins->op2 & IRCONV_SEXT))\r\n    return INT64FOLD((uint64_t)(int64_t)fleft->i);\r\n  else\r\n    return INT64FOLD((uint64_t)(int64_t)(uint32_t)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_NUM_I64)\r\nLJFOLDF(kfold_conv_kint64_num_i64)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)(int64_t)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_NUM_U64)\r\nLJFOLDF(kfold_conv_kint64_num_u64)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_INT_I64)\r\nLJFOLD(CONV KINT64 IRCONV_U32_I64)\r\nLJFOLDF(kfold_conv_kint64_int_i64)\r\n{\r\n  return INTFOLD((int32_t)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_INT_NUM)\r\nLJFOLDF(kfold_conv_knum_int_num)\r\n{\r\n  lua_Number n = knumleft;\r\n  if (!(fins->op2 & IRCONV_TRUNC)) {\r\n    int32_t k = lj_num2int(n);\r\n    if (irt_isguard(fins->t) && n != (lua_Number)k) {\r\n      /* We're about to create a guard which always fails, like CONV +1.5.\r\n      ** Some pathological loops cause this during LICM, e.g.:\r\n      **   local x,k,t = 0,1.5,{1,[1.5]=2}\r\n      **   for i=1,200 do x = x+ t[k]; k = k == 1 and 1.5 or 1 end\r\n      **   assert(x == 300)\r\n      */\r\n      return FAILFOLD;\r\n    }\r\n    return INTFOLD(k);\r\n  } else {\r\n    return INTFOLD((int32_t)n);\r\n  }\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_U32_NUM)\r\nLJFOLDF(kfold_conv_knum_u32_num)\r\n{\r\n  lua_assert((fins->op2 & IRCONV_TRUNC));\r\n#ifdef _MSC_VER\r\n  {  /* Workaround for MSVC bug. */\r\n    volatile uint32_t u = (uint32_t)knumleft;\r\n    return INTFOLD((int32_t)u);\r\n  }\r\n#else\r\n  return INTFOLD((int32_t)(uint32_t)knumleft);\r\n#endif\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_I64_NUM)\r\nLJFOLDF(kfold_conv_knum_i64_num)\r\n{\r\n  lua_assert((fins->op2 & IRCONV_TRUNC));\r\n  return INT64FOLD((uint64_t)(int64_t)knumleft);\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_U64_NUM)\r\nLJFOLDF(kfold_conv_knum_u64_num)\r\n{\r\n  lua_assert((fins->op2 & IRCONV_TRUNC));\r\n  return INT64FOLD(lj_num2u64(knumleft));\r\n}\r\n\r\nLJFOLD(TOSTR KNUM)\r\nLJFOLDF(kfold_tostr_knum)\r\n{\r\n  return lj_ir_kstr(J, lj_str_fromnum(J->L, &knumleft));\r\n}\r\n\r\nLJFOLD(TOSTR KINT)\r\nLJFOLDF(kfold_tostr_kint)\r\n{\r\n  return lj_ir_kstr(J, lj_str_fromint(J->L, fleft->i));\r\n}\r\n\r\nLJFOLD(STRTO KGC)\r\nLJFOLDF(kfold_strto)\r\n{\r\n  TValue n;\r\n  if (lj_strscan_num(ir_kstr(fleft), &n))\r\n    return lj_ir_knum(J, numV(&n));\r\n  return FAILFOLD;\r\n}\r\n\r\n/* -- Constant folding of equality checks --------------------------------- */\r\n\r\n/* Don't constant-fold away FLOAD checks against KNULL. */\r\nLJFOLD(EQ FLOAD KNULL)\r\nLJFOLD(NE FLOAD KNULL)\r\nLJFOLDX(lj_opt_cse)\r\n\r\n/* But fold all other KNULL compares, since only KNULL is equal to KNULL. */\r\nLJFOLD(EQ any KNULL)\r\nLJFOLD(NE any KNULL)\r\nLJFOLD(EQ KNULL any)\r\nLJFOLD(NE KNULL any)\r\nLJFOLD(EQ KINT KINT)  /* Constants are unique, so same refs <==> same value. */\r\nLJFOLD(NE KINT KINT)\r\nLJFOLD(EQ KINT64 KINT64)\r\nLJFOLD(NE KINT64 KINT64)\r\nLJFOLD(EQ KGC KGC)\r\nLJFOLD(NE KGC KGC)\r\nLJFOLDF(kfold_kref)\r\n{\r\n  return CONDFOLD((fins->op1 == fins->op2) ^ (fins->o == IR_NE));\r\n}\r\n\r\n/* -- Algebraic shortcuts ------------------------------------------------- */\r\n\r\nLJFOLD(FPMATH FPMATH IRFPM_FLOOR)\r\nLJFOLD(FPMATH FPMATH IRFPM_CEIL)\r\nLJFOLD(FPMATH FPMATH IRFPM_TRUNC)\r\nLJFOLDF(shortcut_round)\r\n{\r\n  IRFPMathOp op = (IRFPMathOp)fleft->op2;\r\n  if (op == IRFPM_FLOOR || op == IRFPM_CEIL || op == IRFPM_TRUNC)\r\n    return LEFTFOLD;  /* round(round_left(x)) = round_left(x) */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ABS ABS KNUM)\r\nLJFOLDF(shortcut_left)\r\n{\r\n  return LEFTFOLD;  /* f(g(x)) ==> g(x) */\r\n}\r\n\r\nLJFOLD(ABS NEG KNUM)\r\nLJFOLDF(shortcut_dropleft)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op1 = fleft->op1;  /* abs(neg(x)) ==> abs(x) */\r\n  return RETRYFOLD;\r\n}\r\n\r\n/* Note: no safe shortcuts with STRTO and TOSTR (\"1e2\" ==> +100 ==> \"100\"). */\r\nLJFOLD(NEG NEG any)\r\nLJFOLD(BNOT BNOT)\r\nLJFOLD(BSWAP BSWAP)\r\nLJFOLDF(shortcut_leftleft)\r\n{\r\n  PHIBARRIER(fleft);  /* See above. Fold would be ok, but not beneficial. */\r\n  return fleft->op1;  /* f(g(x)) ==> x */\r\n}\r\n\r\n/* -- FP algebraic simplifications ---------------------------------------- */\r\n\r\n/* FP arithmetic is tricky -- there's not much to simplify.\r\n** Please note the following common pitfalls before sending \"improvements\":\r\n**   x+0 ==> x  is INVALID for x=-0\r\n**   0-x ==> -x is INVALID for x=+0\r\n**   x*0 ==> 0  is INVALID for x=-0, x=+-Inf or x=NaN\r\n*/\r\n\r\nLJFOLD(ADD NEG any)\r\nLJFOLDF(simplify_numadd_negx)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->o = IR_SUB;  /* (-a) + b ==> b - a */\r\n  fins->op1 = fins->op2;\r\n  fins->op2 = fleft->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(ADD any NEG)\r\nLJFOLDF(simplify_numadd_xneg)\r\n{\r\n  PHIBARRIER(fright);\r\n  fins->o = IR_SUB;  /* a + (-b) ==> a - b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KNUM)\r\nLJFOLDF(simplify_numsub_k)\r\n{\r\n  lua_Number n = knumright;\r\n  if (n == 0.0)  /* x - (+-0) ==> x */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB NEG KNUM)\r\nLJFOLDF(simplify_numsub_negk)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op2 = fleft->op1;  /* (-x) - k ==> (-k) - x */\r\n  fins->op1 = (IRRef1)lj_ir_knum(J, -knumright);\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB any NEG)\r\nLJFOLDF(simplify_numsub_xneg)\r\n{\r\n  PHIBARRIER(fright);\r\n  fins->o = IR_ADD;  /* a - (-b) ==> a + b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KNUM)\r\nLJFOLD(DIV any KNUM)\r\nLJFOLDF(simplify_nummuldiv_k)\r\n{\r\n  lua_Number n = knumright;\r\n  if (n == 1.0) {  /* x o 1 ==> x */\r\n    return LEFTFOLD;\r\n  } else if (n == -1.0) {  /* x o -1 ==> -x */\r\n    fins->o = IR_NEG;\r\n    fins->op2 = (IRRef1)lj_ir_knum_neg(J);\r\n    return RETRYFOLD;\r\n  } else if (fins->o == IR_MUL && n == 2.0) {  /* x * 2 ==> x + x */\r\n    fins->o = IR_ADD;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  } else if (fins->o == IR_DIV) {  /* x / 2^k ==> x * 2^-k */\r\n    uint64_t u = ir_knum(fright)->u64;\r\n    uint32_t ex = ((uint32_t)(u >> 52) & 0x7ff);\r\n    if ((u & U64x(000fffff,ffffffff)) == 0 && ex - 1 < 0x7fd) {\r\n      u = (u & ((uint64_t)1 << 63)) | ((uint64_t)(0x7fe - ex) << 52);\r\n      fins->o = IR_MUL;  /* Multiply by exact reciprocal. */\r\n      fins->op2 = lj_ir_knum_u64(J, u);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL NEG KNUM)\r\nLJFOLD(DIV NEG KNUM)\r\nLJFOLDF(simplify_nummuldiv_negk)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op1 = fleft->op1;  /* (-a) o k ==> a o (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_knum(J, -knumright);\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(MUL NEG NEG)\r\nLJFOLD(DIV NEG NEG)\r\nLJFOLDF(simplify_nummuldiv_negneg)\r\n{\r\n  PHIBARRIER(fleft);\r\n  PHIBARRIER(fright);\r\n  fins->op1 = fleft->op1;  /* (-a) o (-b) ==> a o b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(POW any KINT)\r\nLJFOLDF(simplify_numpow_xk)\r\n{\r\n  int32_t k = fright->i;\r\n  TRef ref = fins->op1;\r\n  if (k == 0)  /* x ^ 0 ==> 1 */\r\n    return lj_ir_knum_one(J);  /* Result must be a number, not an int. */\r\n  if (k == 1)  /* x ^ 1 ==> x */\r\n    return LEFTFOLD;\r\n  if ((uint32_t)(k+65536) > 2*65536u)  /* Limit code explosion. */\r\n    return NEXTFOLD;\r\n  if (k < 0) {  /* x ^ (-k) ==> (1/x) ^ k. */\r\n    ref = emitir(IRTN(IR_DIV), lj_ir_knum_one(J), ref);\r\n    k = -k;\r\n  }\r\n  /* Unroll x^k for 1 <= k <= 65536. */\r\n  for (; (k & 1) == 0; k >>= 1)  /* Handle leading zeros. */\r\n    ref = emitir(IRTN(IR_MUL), ref, ref);\r\n  if ((k >>= 1) != 0) {  /* Handle trailing bits. */\r\n    TRef tmp = emitir(IRTN(IR_MUL), ref, ref);\r\n    for (; k != 1; k >>= 1) {\r\n      if (k & 1)\r\n\tref = emitir(IRTN(IR_MUL), ref, tmp);\r\n      tmp = emitir(IRTN(IR_MUL), tmp, tmp);\r\n    }\r\n    ref = emitir(IRTN(IR_MUL), ref, tmp);\r\n  }\r\n  return ref;\r\n}\r\n\r\nLJFOLD(POW KNUM any)\r\nLJFOLDF(simplify_numpow_kx)\r\n{\r\n  lua_Number n = knumleft;\r\n  if (n == 2.0) {  /* 2.0 ^ i ==> ldexp(1.0, tonum(i)) */\r\n    fins->o = IR_CONV;\r\n#if LJ_TARGET_X86ORX64\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = IRCONV_NUM_INT;\r\n    fins->op2 = (IRRef1)lj_opt_fold(J);\r\n#endif\r\n    fins->op1 = (IRRef1)lj_ir_knum_one(J);\r\n    fins->o = IR_LDEXP;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Simplify conversions ------------------------------------------------ */\r\n\r\nLJFOLD(CONV CONV IRCONV_NUM_INT)  /* _NUM */\r\nLJFOLDF(shortcut_conv_num_int)\r\n{\r\n  PHIBARRIER(fleft);\r\n  /* Only safe with a guarded conversion to int. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_NUM && irt_isguard(fleft->t))\r\n    return fleft->op1;  /* f(g(x)) ==> x */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_INT_NUM)  /* _INT */\r\nLJFOLD(CONV CONV IRCONV_U32_NUM)  /* _U32*/\r\nLJFOLDF(simplify_conv_int_num)\r\n{\r\n  /* Fold even across PHI to avoid expensive num->int conversions in loop. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) ==\r\n      ((fins->op2 & IRCONV_DSTMASK) >> IRCONV_DSH))\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_I64_NUM)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U64_NUM)  /* _INT or _U32 */\r\nLJFOLDF(simplify_conv_i64_num)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    /* Reduce to a sign-extension. */\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = ((IRT_I64<<5)|IRT_INT|IRCONV_SEXT);\r\n    return RETRYFOLD;\r\n  } else if ((fleft->op2 & IRCONV_SRCMASK) == IRT_U32) {\r\n#if LJ_TARGET_X64\r\n    return fleft->op1;\r\n#else\r\n    /* Reduce to a zero-extension. */\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRT_I64<<5)|IRT_U32;\r\n    return RETRYFOLD;\r\n#endif\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_INT_I64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_INT_U64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U32_I64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U32_U64)  /* _INT or _U32 */\r\nLJFOLDF(simplify_conv_int_i64)\r\n{\r\n  int src;\r\n  PHIBARRIER(fleft);\r\n  src = (fleft->op2 & IRCONV_SRCMASK);\r\n  if (src == IRT_INT || src == IRT_U32) {\r\n    if (src == ((fins->op2 & IRCONV_DSTMASK) >> IRCONV_DSH)) {\r\n      return fleft->op1;\r\n    } else {\r\n      fins->op2 = ((fins->op2 & IRCONV_DSTMASK) | src);\r\n      fins->op1 = fleft->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_FLOAT_NUM)  /* _FLOAT */\r\nLJFOLDF(simplify_conv_flt_num)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_FLOAT)\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Shortcut TOBIT + IRT_NUM <- IRT_INT/IRT_U32 conversion. */\r\nLJFOLD(TOBIT CONV KNUM)\r\nLJFOLDF(simplify_tobit_conv)\r\n{\r\n  /* Fold even across PHI to avoid expensive num->int conversions in loop. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    lua_assert(irt_isnum(fleft->t));\r\n    return fleft->op1;\r\n  } else if ((fleft->op2 & IRCONV_SRCMASK) == IRT_U32) {\r\n    lua_assert(irt_isnum(fleft->t));\r\n    fins->o = IR_CONV;\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRT_INT<<5)|IRT_U32;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Shortcut floor/ceil/round + IRT_NUM <- IRT_INT/IRT_U32 conversion. */\r\nLJFOLD(FPMATH CONV IRFPM_FLOOR)\r\nLJFOLD(FPMATH CONV IRFPM_CEIL)\r\nLJFOLD(FPMATH CONV IRFPM_TRUNC)\r\nLJFOLDF(simplify_floor_conv)\r\n{\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT ||\r\n      (fleft->op2 & IRCONV_SRCMASK) == IRT_U32)\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Strength reduction of widening. */\r\nLJFOLD(CONV any IRCONV_I64_INT)\r\nLJFOLD(CONV any IRCONV_U64_INT)\r\nLJFOLDF(simplify_conv_sext)\r\n{\r\n  IRRef ref = fins->op1;\r\n  int64_t ofs = 0;\r\n  if (!(fins->op2 & IRCONV_SEXT))\r\n    return NEXTFOLD;\r\n  PHIBARRIER(fleft);\r\n  if (fleft->o == IR_XLOAD && (irt_isu8(fleft->t) || irt_isu16(fleft->t)))\r\n    goto ok_reduce;\r\n  if (fleft->o == IR_ADD && irref_isk(fleft->op2)) {\r\n    ofs = (int64_t)IR(fleft->op2)->i;\r\n    ref = fleft->op1;\r\n  }\r\n  /* Use scalar evolution analysis results to strength-reduce sign-extension. */\r\n  if (ref == J->scev.idx) {\r\n    IRRef lo = J->scev.dir ? J->scev.start : J->scev.stop;\r\n    lua_assert(irt_isint(J->scev.t));\r\n    if (lo && IR(lo)->i + ofs >= 0) {\r\n    ok_reduce:\r\n#if LJ_TARGET_X64\r\n      /* Eliminate widening. All 32 bit ops do an implicit zero-extension. */\r\n      return LEFTFOLD;\r\n#else\r\n      /* Reduce to a (cheaper) zero-extension. */\r\n      fins->op2 &= ~IRCONV_SEXT;\r\n      return RETRYFOLD;\r\n#endif\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Strength reduction of narrowing. */\r\nLJFOLD(CONV ADD IRCONV_INT_I64)\r\nLJFOLD(CONV SUB IRCONV_INT_I64)\r\nLJFOLD(CONV MUL IRCONV_INT_I64)\r\nLJFOLD(CONV ADD IRCONV_INT_U64)\r\nLJFOLD(CONV SUB IRCONV_INT_U64)\r\nLJFOLD(CONV MUL IRCONV_INT_U64)\r\nLJFOLD(CONV ADD IRCONV_U32_I64)\r\nLJFOLD(CONV SUB IRCONV_U32_I64)\r\nLJFOLD(CONV MUL IRCONV_U32_I64)\r\nLJFOLD(CONV ADD IRCONV_U32_U64)\r\nLJFOLD(CONV SUB IRCONV_U32_U64)\r\nLJFOLD(CONV MUL IRCONV_U32_U64)\r\nLJFOLDF(simplify_conv_narrow)\r\n{\r\n  IROp op = (IROp)fleft->o;\r\n  IRType t = irt_type(fins->t);\r\n  IRRef op1 = fleft->op1, op2 = fleft->op2, mode = fins->op2;\r\n  PHIBARRIER(fleft);\r\n  op1 = emitir(IRTI(IR_CONV), op1, mode);\r\n  op2 = emitir(IRTI(IR_CONV), op2, mode);\r\n  fins->ot = IRT(op, t);\r\n  fins->op1 = op1;\r\n  fins->op2 = op2;\r\n  return RETRYFOLD;\r\n}\r\n\r\n/* Special CSE rule for CONV. */\r\nLJFOLD(CONV any any)\r\nLJFOLDF(cse_conv)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    IRRef op1 = fins->op1, op2 = (fins->op2 & IRCONV_MODEMASK);\r\n    uint8_t guard = irt_isguard(fins->t);\r\n    IRRef ref = J->chain[IR_CONV];\r\n    while (ref > op1) {\r\n      IRIns *ir = IR(ref);\r\n      /* Commoning with stronger checks is ok. */\r\n      if (ir->op1 == op1 && (ir->op2 & IRCONV_MODEMASK) == op2 &&\r\n\t  irt_isguard(ir->t) >= guard)\r\n\treturn ref;\r\n      ref = ir->prev;\r\n    }\r\n  }\r\n  return EMITFOLD;  /* No fallthrough to regular CSE. */\r\n}\r\n\r\n/* FP conversion narrowing. */\r\nLJFOLD(TOBIT ADD KNUM)\r\nLJFOLD(TOBIT SUB KNUM)\r\nLJFOLD(CONV ADD IRCONV_INT_NUM)\r\nLJFOLD(CONV SUB IRCONV_INT_NUM)\r\nLJFOLD(CONV ADD IRCONV_I64_NUM)\r\nLJFOLD(CONV SUB IRCONV_I64_NUM)\r\nLJFOLDF(narrow_convert)\r\n{\r\n  PHIBARRIER(fleft);\r\n  /* Narrowing ignores PHIs and repeating it inside the loop is not useful. */\r\n  if (J->chain[IR_LOOP])\r\n    return NEXTFOLD;\r\n  lua_assert(fins->o != IR_CONV || (fins->op2&IRCONV_CONVMASK) != IRCONV_TOBIT);\r\n  return lj_opt_narrow_convert(J);\r\n}\r\n\r\n/* -- Integer algebraic simplifications ----------------------------------- */\r\n\r\nLJFOLD(ADD any KINT)\r\nLJFOLD(ADDOV any KINT)\r\nLJFOLD(SUBOV any KINT)\r\nLJFOLDF(simplify_intadd_k)\r\n{\r\n  if (fright->i == 0)  /* i o 0 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MULOV any KINT)\r\nLJFOLDF(simplify_intmul_k)\r\n{\r\n  if (fright->i == 0)  /* i * 0 ==> 0 */\r\n    return RIGHTFOLD;\r\n  if (fright->i == 1)  /* i * 1 ==> i */\r\n    return LEFTFOLD;\r\n  if (fright->i == 2) {  /* i * 2 ==> i + i */\r\n    fins->o = IR_ADDOV;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KINT)\r\nLJFOLDF(simplify_intsub_k)\r\n{\r\n  if (fright->i == 0)  /* i - 0 ==> i */\r\n    return LEFTFOLD;\r\n  fins->o = IR_ADD;  /* i - k ==> i + (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_kint(J, -fright->i);  /* Overflow for -2^31 ok. */\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB KINT any)\r\nLJFOLD(SUB KINT64 any)\r\nLJFOLDF(simplify_intsub_kleft)\r\n{\r\n  if (fleft->o == IR_KINT ? (fleft->i == 0) : (ir_kint64(fleft)->u64 == 0)) {\r\n    fins->o = IR_NEG;  /* 0 - i ==> -i */\r\n    fins->op1 = fins->op2;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ADD any KINT64)\r\nLJFOLDF(simplify_intadd_k64)\r\n{\r\n  if (ir_kint64(fright)->u64 == 0)  /* i + 0 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KINT64)\r\nLJFOLDF(simplify_intsub_k64)\r\n{\r\n  uint64_t k = ir_kint64(fright)->u64;\r\n  if (k == 0)  /* i - 0 ==> i */\r\n    return LEFTFOLD;\r\n  fins->o = IR_ADD;  /* i - k ==> i + (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_kint64(J, (uint64_t)-(int64_t)k);\r\n  return RETRYFOLD;\r\n}\r\n\r\nstatic TRef simplify_intmul_k(jit_State *J, int32_t k)\r\n{\r\n  /* Note: many more simplifications are possible, e.g. 2^k1 +- 2^k2.\r\n  ** But this is mainly intended for simple address arithmetic.\r\n  ** Also it's easier for the backend to optimize the original multiplies.\r\n  */\r\n  if (k == 1) {  /* i * 1 ==> i */\r\n    return LEFTFOLD;\r\n  } else if ((k & (k-1)) == 0) {  /* i * 2^k ==> i << k */\r\n    fins->o = IR_BSHL;\r\n    fins->op2 = lj_ir_kint(J, lj_fls((uint32_t)k));\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KINT)\r\nLJFOLDF(simplify_intmul_k32)\r\n{\r\n  if (fright->i == 0)  /* i * 0 ==> 0 */\r\n    return INTFOLD(0);\r\n  else if (fright->i > 0)\r\n    return simplify_intmul_k(J, fright->i);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KINT64)\r\nLJFOLDF(simplify_intmul_k64)\r\n{\r\n  if (ir_kint64(fright)->u64 == 0)  /* i * 0 ==> 0 */\r\n    return INT64FOLD(0);\r\n#if LJ_64\r\n  /* NYI: SPLIT for BSHL and 32 bit backend support. */\r\n  else if (ir_kint64(fright)->u64 < 0x80000000u)\r\n    return simplify_intmul_k(J, (int32_t)ir_kint64(fright)->u64);\r\n#endif\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MOD any KINT)\r\nLJFOLDF(simplify_intmod_k)\r\n{\r\n  int32_t k = fright->i;\r\n  lua_assert(k != 0);\r\n  if (k > 0 && (k & (k-1)) == 0) {  /* i % (2^k) ==> i & (2^k-1) */\r\n    fins->o = IR_BAND;\r\n    fins->op2 = lj_ir_kint(J, k-1);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MOD KINT any)\r\nLJFOLDF(simplify_intmod_kleft)\r\n{\r\n  if (fleft->i == 0)\r\n    return INTFOLD(0);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any any)\r\nLJFOLD(SUBOV any any)\r\nLJFOLDF(simplify_intsub)\r\n{\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))  /* i - i ==> 0 */\r\n    return irt_is64(fins->t) ? INT64FOLD(0) : INTFOLD(0);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB ADD any)\r\nLJFOLDF(simplify_intsubadd_leftcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    if (fins->op2 == fleft->op1)  /* (i + j) - i ==> j */\r\n      return fleft->op2;\r\n    if (fins->op2 == fleft->op2)  /* (i + j) - j ==> i */\r\n      return fleft->op1;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB SUB any)\r\nLJFOLDF(simplify_intsubsub_leftcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    if (fins->op2 == fleft->op1) {  /* (i - j) - i ==> 0 - j */\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      fins->op2 = fleft->op2;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any SUB)\r\nLJFOLDF(simplify_intsubsub_rightcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fright);\r\n    if (fins->op1 == fright->op1)  /* i - (i - j) ==> j */\r\n      return fright->op2;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any ADD)\r\nLJFOLDF(simplify_intsubadd_rightcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fright);\r\n    if (fins->op1 == fright->op1) {  /* i - (i + j) ==> 0 - j */\r\n      fins->op2 = fright->op2;\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      return RETRYFOLD;\r\n    }\r\n    if (fins->op1 == fright->op2) {  /* i - (j + i) ==> 0 - j */\r\n      fins->op2 = fright->op1;\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB ADD ADD)\r\nLJFOLDF(simplify_intsubaddadd_cancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    PHIBARRIER(fright);\r\n    if (fleft->op1 == fright->op1) {  /* (i + j1) - (i + j2) ==> j1 - j2 */\r\n      fins->op1 = fleft->op2;\r\n      fins->op2 = fright->op2;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op1 == fright->op2) {  /* (i + j1) - (j2 + i) ==> j1 - j2 */\r\n      fins->op1 = fleft->op2;\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op2 == fright->op1) {  /* (j1 + i) - (i + j2) ==> j1 - j2 */\r\n      fins->op1 = fleft->op1;\r\n      fins->op2 = fright->op2;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op2 == fright->op2) {  /* (j1 + i) - (j2 + i) ==> j1 - j2 */\r\n      fins->op1 = fleft->op1;\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND any KINT)\r\nLJFOLD(BAND any KINT64)\r\nLJFOLDF(simplify_band_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i & 0 ==> 0 */\r\n    return RIGHTFOLD;\r\n  if (k == -1)  /* i & -1 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BOR any KINT)\r\nLJFOLD(BOR any KINT64)\r\nLJFOLDF(simplify_bor_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i | 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == -1)  /* i | -1 ==> -1 */\r\n    return RIGHTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BXOR any KINT)\r\nLJFOLD(BXOR any KINT64)\r\nLJFOLDF(simplify_bxor_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i xor 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == -1) {  /* i xor -1 ==> ~i */\r\n    fins->o = IR_BNOT;\r\n    fins->op2 = 0;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL any KINT)\r\nLJFOLD(BSHR any KINT)\r\nLJFOLD(BSAR any KINT)\r\nLJFOLD(BROL any KINT)\r\nLJFOLD(BROR any KINT)\r\nLJFOLDF(simplify_shift_ik)\r\n{\r\n  int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n  int32_t k = (fright->i & mask);\r\n  if (k == 0)  /* i o 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == 1 && fins->o == IR_BSHL) {  /* i << 1 ==> i + i */\r\n    fins->o = IR_ADD;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  }\r\n  if (k != fright->i) {  /* i o k ==> i o (k & mask) */\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;\r\n  }\r\n#ifndef LJ_TARGET_UNIFYROT\r\n  if (fins->o == IR_BROR) {  /* bror(i, k) ==> brol(i, (-k)&mask) */\r\n    fins->o = IR_BROL;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, (-k)&mask);\r\n    return RETRYFOLD;\r\n  }\r\n#endif\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL any BAND)\r\nLJFOLD(BSHR any BAND)\r\nLJFOLD(BSAR any BAND)\r\nLJFOLD(BROL any BAND)\r\nLJFOLD(BROR any BAND)\r\nLJFOLDF(simplify_shift_andk)\r\n{\r\n  IRIns *irk = IR(fright->op2);\r\n  PHIBARRIER(fright);\r\n  if ((fins->o < IR_BROL ? LJ_TARGET_MASKSHIFT : LJ_TARGET_MASKROT) &&\r\n      irk->o == IR_KINT) {  /* i o (j & mask) ==> i o j */\r\n    int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n    int32_t k = irk->i & mask;\r\n    if (k == mask) {\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL KINT any)\r\nLJFOLD(BSHR KINT any)\r\nLJFOLD(BSHL KINT64 any)\r\nLJFOLD(BSHR KINT64 any)\r\nLJFOLDF(simplify_shift1_ki)\r\n{\r\n  int64_t k = fleft->o == IR_KINT ? (int64_t)fleft->i :\r\n\t\t\t\t    (int64_t)ir_k64(fleft)->u64;\r\n  if (k == 0)  /* 0 o i ==> 0 */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSAR KINT any)\r\nLJFOLD(BROL KINT any)\r\nLJFOLD(BROR KINT any)\r\nLJFOLD(BSAR KINT64 any)\r\nLJFOLD(BROL KINT64 any)\r\nLJFOLD(BROR KINT64 any)\r\nLJFOLDF(simplify_shift2_ki)\r\n{\r\n  int64_t k = fleft->o == IR_KINT ? (int64_t)fleft->i :\r\n\t\t\t\t    (int64_t)ir_k64(fleft)->u64;\r\n  if (k == 0 || k == -1)  /* 0 o i ==> 0; -1 o i ==> -1 */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL BAND KINT)\r\nLJFOLD(BSHR BAND KINT)\r\nLJFOLD(BROL BAND KINT)\r\nLJFOLD(BROR BAND KINT)\r\nLJFOLDF(simplify_shiftk_andk)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  PHIBARRIER(fleft);\r\n  if (irk->o == IR_KINT) {  /* (i & k1) o k2 ==> (i o k2) & (k1 o k2) */\r\n    int32_t k = kfold_intop(irk->i, fright->i, (IROp)fins->o);\r\n    fins->op1 = fleft->op1;\r\n    fins->op1 = (IRRef1)lj_opt_fold(J);\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    fins->ot = IRTI(IR_BAND);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND BSHL KINT)\r\nLJFOLD(BAND BSHR KINT)\r\nLJFOLDF(simplify_andk_shiftk)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT &&\r\n      kfold_intop(-1, irk->i, (IROp)fleft->o) == fright->i)\r\n    return LEFTFOLD;  /* (i o k1) & k2 ==> i, if (-1 o k1) == k2 */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Reassociation ------------------------------------------------------- */\r\n\r\nLJFOLD(ADD ADD KINT)\r\nLJFOLD(MUL MUL KINT)\r\nLJFOLD(BAND BAND KINT)\r\nLJFOLD(BOR BOR KINT)\r\nLJFOLD(BXOR BXOR KINT)\r\nLJFOLDF(reassoc_intarith_k)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT) {\r\n    int32_t k = kfold_intop(irk->i, fright->i, (IROp)fins->o);\r\n    if (k == irk->i)  /* (i o k1) o k2 ==> i o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;  /* (i o k1) o k2 ==> i o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ADD ADD KINT64)\r\nLJFOLD(MUL MUL KINT64)\r\nLJFOLD(BAND BAND KINT64)\r\nLJFOLD(BOR BOR KINT64)\r\nLJFOLD(BXOR BXOR KINT64)\r\nLJFOLDF(reassoc_intarith_k64)\r\n{\r\n#if LJ_HASFFI || LJ_64\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT64) {\r\n    uint64_t k = kfold_int64arith(ir_k64(irk)->u64,\r\n\t\t\t\t  ir_k64(fright)->u64, (IROp)fins->o);\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint64(J, k);\r\n    return RETRYFOLD;  /* (i o k1) o k2 ==> i o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(MIN MIN any)\r\nLJFOLD(MAX MAX any)\r\nLJFOLD(BAND BAND any)\r\nLJFOLD(BOR BOR any)\r\nLJFOLDF(reassoc_dup)\r\n{\r\n  if (fins->op2 == fleft->op1 || fins->op2 == fleft->op2)\r\n    return LEFTFOLD;  /* (a o b) o a ==> a o b; (a o b) o b ==> a o b */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BXOR BXOR any)\r\nLJFOLDF(reassoc_bxor)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if (fins->op2 == fleft->op1)  /* (a xor b) xor a ==> b */\r\n    return fleft->op2;\r\n  if (fins->op2 == fleft->op2)  /* (a xor b) xor b ==> a */\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL BSHL KINT)\r\nLJFOLD(BSHR BSHR KINT)\r\nLJFOLD(BSAR BSAR KINT)\r\nLJFOLD(BROL BROL KINT)\r\nLJFOLD(BROR BROR KINT)\r\nLJFOLDF(reassoc_shift)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  PHIBARRIER(fleft);  /* The (shift any KINT) rule covers k2 == 0 and more. */\r\n  if (irk->o == IR_KINT) {  /* (i o k1) o k2 ==> i o (k1 + k2) */\r\n    int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n    int32_t k = (irk->i & mask) + (fright->i & mask);\r\n    if (k > mask) {  /* Combined shift too wide? */\r\n      if (fins->o == IR_BSHL || fins->o == IR_BSHR)\r\n\treturn mask == 31 ? INTFOLD(0) : INT64FOLD(0);\r\n      else if (fins->o == IR_BSAR)\r\n\tk = mask;\r\n      else\r\n\tk &= mask;\r\n    }\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN MIN KNUM)\r\nLJFOLD(MAX MAX KNUM)\r\nLJFOLD(MIN MIN KINT)\r\nLJFOLD(MAX MAX KINT)\r\nLJFOLDF(reassoc_minmax_k)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KNUM) {\r\n    lua_Number a = ir_knum(irk)->n;\r\n    lua_Number y = lj_vm_foldarith(a, knumright, fins->o - IR_ADD);\r\n    if (a == y)  /* (x o k1) o k2 ==> x o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_knum(J, y);\r\n    return RETRYFOLD;  /* (x o k1) o k2 ==> x o (k1 o k2) */\r\n  } else if (irk->o == IR_KINT) {\r\n    int32_t a = irk->i;\r\n    int32_t y = kfold_intop(a, fright->i, fins->o);\r\n    if (a == y)  /* (x o k1) o k2 ==> x o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, y);\r\n    return RETRYFOLD;  /* (x o k1) o k2 ==> x o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN MAX any)\r\nLJFOLD(MAX MIN any)\r\nLJFOLDF(reassoc_minmax_left)\r\n{\r\n  if (fins->op2 == fleft->op1 || fins->op2 == fleft->op2)\r\n    return RIGHTFOLD;  /* (b o1 a) o2 b ==> b; (a o1 b) o2 b ==> b */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN any MAX)\r\nLJFOLD(MAX any MIN)\r\nLJFOLDF(reassoc_minmax_right)\r\n{\r\n  if (fins->op1 == fright->op1 || fins->op1 == fright->op2)\r\n    return LEFTFOLD;  /* a o2 (a o1 b) ==> a; a o2 (b o1 a) ==> a */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Array bounds check elimination -------------------------------------- */\r\n\r\n/* Eliminate ABC across PHIs to handle t[i-1] forwarding case.\r\n** ABC(asize, (i+k)+(-k)) ==> ABC(asize, i), but only if it already exists.\r\n** Could be generalized to (i+k1)+k2 ==> i+(k1+k2), but needs better disambig.\r\n*/\r\nLJFOLD(ABC any ADD)\r\nLJFOLDF(abc_fwd)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_ABC)) {\r\n    if (irref_isk(fright->op2)) {\r\n      IRIns *add2 = IR(fright->op1);\r\n      if (add2->o == IR_ADD && irref_isk(add2->op2) &&\r\n\t  IR(fright->op2)->i == -IR(add2->op2)->i) {\r\n\tIRRef ref = J->chain[IR_ABC];\r\n\tIRRef lim = add2->op1;\r\n\tif (fins->op1 > lim) lim = fins->op1;\r\n\twhile (ref > lim) {\r\n\t  IRIns *ir = IR(ref);\r\n\t  if (ir->op1 == fins->op1 && ir->op2 == add2->op1)\r\n\t    return DROPFOLD;\r\n\t  ref = ir->prev;\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Eliminate ABC for constants.\r\n** ABC(asize, k1), ABC(asize k2) ==> ABC(asize, max(k1, k2))\r\n** Drop second ABC if k2 is lower. Otherwise patch first ABC with k2.\r\n*/\r\nLJFOLD(ABC any KINT)\r\nLJFOLDF(abc_k)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_ABC)) {\r\n    IRRef ref = J->chain[IR_ABC];\r\n    IRRef asize = fins->op1;\r\n    while (ref > asize) {\r\n      IRIns *ir = IR(ref);\r\n      if (ir->op1 == asize && irref_isk(ir->op2)) {\r\n\tint32_t k = IR(ir->op2)->i;\r\n\tif (fright->i > k)\r\n\t  ir->op2 = fins->op2;\r\n\treturn DROPFOLD;\r\n      }\r\n      ref = ir->prev;\r\n    }\r\n    return EMITFOLD;  /* Already performed CSE. */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Eliminate invariant ABC inside loop. */\r\nLJFOLD(ABC any any)\r\nLJFOLDF(abc_invar)\r\n{\r\n  /* Invariant ABC marked as PTR. Drop if op1 is invariant, too. */\r\n  if (!irt_isint(fins->t) && fins->op1 < J->chain[IR_LOOP] &&\r\n      !irt_isphi(IR(fins->op1)->t))\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Commutativity ------------------------------------------------------- */\r\n\r\n/* The refs of commutative ops are canonicalized. Lower refs go to the right.\r\n** Rationale behind this:\r\n** - It (also) moves constants to the right.\r\n** - It reduces the number of FOLD rules (e.g. (BOR any KINT) suffices).\r\n** - It helps CSE to find more matches.\r\n** - The assembler generates better code with constants at the right.\r\n*/\r\n\r\nLJFOLD(ADD any any)\r\nLJFOLD(MUL any any)\r\nLJFOLD(ADDOV any any)\r\nLJFOLD(MULOV any any)\r\nLJFOLDF(comm_swap)\r\n{\r\n  if (fins->op1 < fins->op2) {  /* Move lower ref to the right. */\r\n    IRRef1 tmp = fins->op1;\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = tmp;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(EQ any any)\r\nLJFOLD(NE any any)\r\nLJFOLDF(comm_equal)\r\n{\r\n  /* For non-numbers only: x == x ==> drop; x ~= x ==> fail */\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))\r\n    return CONDFOLD(fins->o == IR_EQ);\r\n  return fold_comm_swap(J);\r\n}\r\n\r\nLJFOLD(LT any any)\r\nLJFOLD(GE any any)\r\nLJFOLD(LE any any)\r\nLJFOLD(GT any any)\r\nLJFOLD(ULT any any)\r\nLJFOLD(UGE any any)\r\nLJFOLD(ULE any any)\r\nLJFOLD(UGT any any)\r\nLJFOLDF(comm_comp)\r\n{\r\n  /* For non-numbers only: x <=> x ==> drop; x <> x ==> fail */\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))\r\n    return CONDFOLD((fins->o ^ (fins->o >> 1)) & 1);\r\n  if (fins->op1 < fins->op2) {  /* Move lower ref to the right. */\r\n    IRRef1 tmp = fins->op1;\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = tmp;\r\n    fins->o ^= 3; /* GT <-> LT, GE <-> LE, does not affect U */\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND any any)\r\nLJFOLD(BOR any any)\r\nLJFOLD(MIN any any)\r\nLJFOLD(MAX any any)\r\nLJFOLDF(comm_dup)\r\n{\r\n  if (fins->op1 == fins->op2)  /* x o x ==> x */\r\n    return LEFTFOLD;\r\n  return fold_comm_swap(J);\r\n}\r\n\r\nLJFOLD(BXOR any any)\r\nLJFOLDF(comm_bxor)\r\n{\r\n  if (fins->op1 == fins->op2)  /* i xor i ==> 0 */\r\n    return irt_is64(fins->t) ? INT64FOLD(0) : INTFOLD(0);\r\n  return fold_comm_swap(J);\r\n}\r\n\r\n/* -- Simplification of compound expressions ------------------------------ */\r\n\r\nstatic TRef kfold_xload(jit_State *J, IRIns *ir, const void *p)\r\n{\r\n  int32_t k;\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_NUM: return lj_ir_knum_u64(J, *(uint64_t *)p);\r\n  case IRT_I8: k = (int32_t)*(int8_t *)p; break;\r\n  case IRT_U8: k = (int32_t)*(uint8_t *)p; break;\r\n  case IRT_I16: k = (int32_t)(int16_t)lj_getu16(p); break;\r\n  case IRT_U16: k = (int32_t)(uint16_t)lj_getu16(p); break;\r\n  case IRT_INT: case IRT_U32: k = (int32_t)lj_getu32(p); break;\r\n  case IRT_I64: case IRT_U64: return lj_ir_kint64(J, *(uint64_t *)p);\r\n  default: return 0;\r\n  }\r\n  return lj_ir_kint(J, k);\r\n}\r\n\r\n/* Turn: string.sub(str, a, b) == kstr\r\n** into: string.byte(str, a) == string.byte(kstr, 1) etc.\r\n** Note: this creates unaligned XLOADs on x86/x64.\r\n*/\r\nLJFOLD(EQ SNEW KGC)\r\nLJFOLD(NE SNEW KGC)\r\nLJFOLDF(merge_eqne_snew_kgc)\r\n{\r\n  GCstr *kstr = ir_kstr(fright);\r\n  int32_t len = (int32_t)kstr->len;\r\n  lua_assert(irt_isstr(fins->t));\r\n\r\n#if LJ_TARGET_UNALIGNED\r\n#define FOLD_SNEW_MAX_LEN\t4  /* Handle string lengths 0, 1, 2, 3, 4. */\r\n#define FOLD_SNEW_TYPE8\t\tIRT_I8\t/* Creates shorter immediates. */\r\n#else\r\n#define FOLD_SNEW_MAX_LEN\t1  /* Handle string lengths 0 or 1. */\r\n#define FOLD_SNEW_TYPE8\t\tIRT_U8  /* Prefer unsigned loads. */\r\n#endif\r\n\r\n  PHIBARRIER(fleft);\r\n  if (len <= FOLD_SNEW_MAX_LEN) {\r\n    IROp op = (IROp)fins->o;\r\n    IRRef strref = fleft->op1;\r\n    if (IR(strref)->o != IR_STRREF)\r\n      return NEXTFOLD;\r\n    if (op == IR_EQ) {\r\n      emitir(IRTGI(IR_EQ), fleft->op2, lj_ir_kint(J, len));\r\n      /* Caveat: fins/fleft/fright is no longer valid after emitir. */\r\n    } else {\r\n      /* NE is not expanded since this would need an OR of two conds. */\r\n      if (!irref_isk(fleft->op2))  /* Only handle the constant length case. */\r\n\treturn NEXTFOLD;\r\n      if (IR(fleft->op2)->i != len)\r\n\treturn DROPFOLD;\r\n    }\r\n    if (len > 0) {\r\n      /* A 4 byte load for length 3 is ok -- all strings have an extra NUL. */\r\n      uint16_t ot = (uint16_t)(len == 1 ? IRT(IR_XLOAD, FOLD_SNEW_TYPE8) :\r\n\t\t\t       len == 2 ? IRT(IR_XLOAD, IRT_U16) :\r\n\t\t\t       IRTI(IR_XLOAD));\r\n      TRef tmp = emitir(ot, strref,\r\n\t\t\tIRXLOAD_READONLY | (len > 1 ? IRXLOAD_UNALIGNED : 0));\r\n      TRef val = kfold_xload(J, IR(tref_ref(tmp)), strdata(kstr));\r\n      if (len == 3)\r\n\ttmp = emitir(IRTI(IR_BAND), tmp,\r\n\t\t     lj_ir_kint(J, LJ_ENDIAN_SELECT(0x00ffffff, 0xffffff00)));\r\n      fins->op1 = (IRRef1)tmp;\r\n      fins->op2 = (IRRef1)val;\r\n      fins->ot = (IROpT)IRTGI(op);\r\n      return RETRYFOLD;\r\n    } else {\r\n      return DROPFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Loads --------------------------------------------------------------- */\r\n\r\n/* Loads cannot be folded or passed on to CSE in general.\r\n** Alias analysis is needed to check for forwarding opportunities.\r\n**\r\n** Caveat: *all* loads must be listed here or they end up at CSE!\r\n*/\r\n\r\nLJFOLD(ALOAD any)\r\nLJFOLDX(lj_opt_fwd_aload)\r\n\r\n/* From HREF fwd (see below). Must eliminate, not supported by fwd/backend. */\r\nLJFOLD(HLOAD KKPTR)\r\nLJFOLDF(kfold_hload_kkptr)\r\n{\r\n  UNUSED(J);\r\n  lua_assert(ir_kptr(fleft) == niltvg(J2G(J)));\r\n  return TREF_NIL;\r\n}\r\n\r\nLJFOLD(HLOAD any)\r\nLJFOLDX(lj_opt_fwd_hload)\r\n\r\nLJFOLD(ULOAD any)\r\nLJFOLDX(lj_opt_fwd_uload)\r\n\r\nLJFOLD(CALLL any IRCALL_lj_tab_len)\r\nLJFOLDX(lj_opt_fwd_tab_len)\r\n\r\n/* Upvalue refs are really loads, but there are no corresponding stores.\r\n** So CSE is ok for them, except for UREFO across a GC step (see below).\r\n** If the referenced function is const, its upvalue addresses are const, too.\r\n** This can be used to improve CSE by looking for the same address,\r\n** even if the upvalues originate from a different function.\r\n*/\r\nLJFOLD(UREFO KGC any)\r\nLJFOLD(UREFC KGC any)\r\nLJFOLDF(cse_uref)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    IRRef ref = J->chain[fins->o];\r\n    GCfunc *fn = ir_kfunc(fleft);\r\n    GCupval *uv = gco2uv(gcref(fn->l.uvptr[(fins->op2 >> 8)]));\r\n    while (ref > 0) {\r\n      IRIns *ir = IR(ref);\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn2 = ir_kfunc(IR(ir->op1));\r\n\tif (gco2uv(gcref(fn2->l.uvptr[(ir->op2 >> 8)])) == uv) {\r\n\t  if (fins->o == IR_UREFO && gcstep_barrier(J, ref))\r\n\t    break;\r\n\t  return ref;\r\n\t}\r\n      }\r\n      ref = ir->prev;\r\n    }\r\n  }\r\n  return EMITFOLD;\r\n}\r\n\r\nLJFOLD(HREFK any any)\r\nLJFOLDX(lj_opt_fwd_hrefk)\r\n\r\nLJFOLD(HREF TNEW any)\r\nLJFOLDF(fwd_href_tnew)\r\n{\r\n  if (lj_opt_fwd_href_nokey(J))\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(HREF TDUP KPRI)\r\nLJFOLD(HREF TDUP KGC)\r\nLJFOLD(HREF TDUP KNUM)\r\nLJFOLDF(fwd_href_tdup)\r\n{\r\n  TValue keyv;\r\n  lj_ir_kvalue(J->L, &keyv, fright);\r\n  if (lj_tab_get(J->L, ir_ktab(IR(fleft->op1)), &keyv) == niltvg(J2G(J)) &&\r\n      lj_opt_fwd_href_nokey(J))\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* We can safely FOLD/CSE array/hash refs and field loads, since there\r\n** are no corresponding stores. But we need to check for any NEWREF with\r\n** an aliased table, as it may invalidate all of the pointers and fields.\r\n** Only HREF needs the NEWREF check -- AREF and HREFK already depend on\r\n** FLOADs. And NEWREF itself is treated like a store (see below).\r\n*/\r\nLJFOLD(FLOAD TNEW IRFL_TAB_ASIZE)\r\nLJFOLDF(fload_tab_tnew_asize)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD(fleft->op1);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TNEW IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_tnew_hmask)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((1 << fleft->op2)-1);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TDUP IRFL_TAB_ASIZE)\r\nLJFOLDF(fload_tab_tdup_asize)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((int32_t)ir_ktab(IR(fleft->op1))->asize);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TDUP IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_tdup_hmask)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((int32_t)ir_ktab(IR(fleft->op1))->hmask);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(HREF any any)\r\nLJFOLD(FLOAD any IRFL_TAB_ARRAY)\r\nLJFOLD(FLOAD any IRFL_TAB_NODE)\r\nLJFOLD(FLOAD any IRFL_TAB_ASIZE)\r\nLJFOLD(FLOAD any IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_ah)\r\n{\r\n  TRef tr = lj_opt_cse(J);\r\n  return lj_opt_fwd_tptr(J, tref_ref(tr)) ? tr : EMITFOLD;\r\n}\r\n\r\n/* Strings are immutable, so we can safely FOLD/CSE the related FLOAD. */\r\nLJFOLD(FLOAD KGC IRFL_STR_LEN)\r\nLJFOLDF(fload_str_len_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return INTFOLD((int32_t)ir_kstr(fleft)->len);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD SNEW IRFL_STR_LEN)\r\nLJFOLDF(fload_str_len_snew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD)) {\r\n    PHIBARRIER(fleft);\r\n    return fleft->op2;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* The C type ID of cdata objects is immutable. */\r\nLJFOLD(FLOAD KGC IRFL_CDATA_CTYPEID)\r\nLJFOLDF(fload_cdata_typeid_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return INTFOLD((int32_t)ir_kcdata(fleft)->ctypeid);\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Get the contents of immutable cdata objects. */\r\nLJFOLD(FLOAD KGC IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD KGC IRFL_CDATA_INT)\r\nLJFOLD(FLOAD KGC IRFL_CDATA_INT64)\r\nLJFOLDF(fload_cdata_int64_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD)) {\r\n    void *p = cdataptr(ir_kcdata(fleft));\r\n    if (irt_is64(fins->t))\r\n      return INT64FOLD(*(uint64_t *)p);\r\n    else\r\n      return INTFOLD(*(int32_t *)p);\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD CNEW IRFL_CDATA_CTYPEID)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_CTYPEID)\r\nLJFOLDF(fload_cdata_typeid_cnew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return fleft->op1;  /* No PHI barrier needed. CNEW/CNEWI op1 is const. */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Pointer, int and int64 cdata objects are immutable. */\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_INT)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_INT64)\r\nLJFOLDF(fload_cdata_ptr_int64_cnew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return fleft->op2;  /* Fold even across PHI to avoid allocations. */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD any IRFL_STR_LEN)\r\nLJFOLD(FLOAD any IRFL_CDATA_CTYPEID)\r\nLJFOLD(FLOAD any IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD any IRFL_CDATA_INT)\r\nLJFOLD(FLOAD any IRFL_CDATA_INT64)\r\nLJFOLD(VLOAD any any)  /* Vararg loads have no corresponding stores. */\r\nLJFOLDX(lj_opt_cse)\r\n\r\n/* All other field loads need alias analysis. */\r\nLJFOLD(FLOAD any any)\r\nLJFOLDX(lj_opt_fwd_fload)\r\n\r\n/* This is for LOOP only. Recording handles SLOADs internally. */\r\nLJFOLD(SLOAD any any)\r\nLJFOLDF(fwd_sload)\r\n{\r\n  if ((fins->op2 & IRSLOAD_FRAME)) {\r\n    TRef tr = lj_opt_cse(J);\r\n    return tref_ref(tr) < J->chain[IR_RETF] ? EMITFOLD : tr;\r\n  } else {\r\n    lua_assert(J->slot[fins->op1] != 0);\r\n    return J->slot[fins->op1];\r\n  }\r\n}\r\n\r\n/* Only fold for KKPTR. The pointer _and_ the contents must be const. */\r\nLJFOLD(XLOAD KKPTR any)\r\nLJFOLDF(xload_kptr)\r\n{\r\n  TRef tr = kfold_xload(J, fins, ir_kptr(fleft));\r\n  return tr ? tr : NEXTFOLD;\r\n}\r\n\r\nLJFOLD(XLOAD any any)\r\nLJFOLDX(lj_opt_fwd_xload)\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\n/* Write barriers are amenable to CSE, but not across any incremental\r\n** GC steps.\r\n**\r\n** The same logic applies to open upvalue references, because a stack\r\n** may be resized during a GC step (not the current stack, but maybe that\r\n** of a coroutine).\r\n*/\r\nLJFOLD(TBAR any)\r\nLJFOLD(OBAR any any)\r\nLJFOLD(UREFO any any)\r\nLJFOLDF(barrier_tab)\r\n{\r\n  TRef tr = lj_opt_cse(J);\r\n  if (gcstep_barrier(J, tref_ref(tr)))  /* CSE across GC step? */\r\n    return EMITFOLD;  /* Raw emit. Assumes fins is left intact by CSE. */\r\n  return tr;\r\n}\r\n\r\nLJFOLD(TBAR TNEW)\r\nLJFOLD(TBAR TDUP)\r\nLJFOLDF(barrier_tnew_tdup)\r\n{\r\n  /* New tables are always white and never need a barrier. */\r\n  if (fins->op1 < J->chain[IR_LOOP])  /* Except across a GC step. */\r\n    return NEXTFOLD;\r\n  return DROPFOLD;\r\n}\r\n\r\n/* -- Stores and allocations ---------------------------------------------- */\r\n\r\n/* Stores and allocations cannot be folded or passed on to CSE in general.\r\n** But some stores can be eliminated with dead-store elimination (DSE).\r\n**\r\n** Caveat: *all* stores and allocs must be listed here or they end up at CSE!\r\n*/\r\n\r\nLJFOLD(ASTORE any any)\r\nLJFOLD(HSTORE any any)\r\nLJFOLDX(lj_opt_dse_ahstore)\r\n\r\nLJFOLD(USTORE any any)\r\nLJFOLDX(lj_opt_dse_ustore)\r\n\r\nLJFOLD(FSTORE any any)\r\nLJFOLDX(lj_opt_dse_fstore)\r\n\r\nLJFOLD(XSTORE any any)\r\nLJFOLDX(lj_opt_dse_xstore)\r\n\r\nLJFOLD(NEWREF any any)  /* Treated like a store. */\r\nLJFOLD(CALLS any any)\r\nLJFOLD(CALLL any any)  /* Safeguard fallback. */\r\nLJFOLD(CALLXS any any)\r\nLJFOLD(XBAR)\r\nLJFOLD(RETF any any)  /* Modifies BASE. */\r\nLJFOLD(TNEW any any)\r\nLJFOLD(TDUP any)\r\nLJFOLD(CNEW any any)\r\nLJFOLD(XSNEW any any)\r\nLJFOLDX(lj_ir_emit)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Every entry in the generated hash table is a 32 bit pattern:\r\n**\r\n** xxxxxxxx iiiiiii lllllll rrrrrrrrrr\r\n**\r\n**   xxxxxxxx = 8 bit index into fold function table\r\n**    iiiiiii = 7 bit folded instruction opcode\r\n**    lllllll = 7 bit left instruction opcode\r\n** rrrrrrrrrr = 8 bit right instruction opcode or 10 bits from literal field\r\n*/\r\n\r\n#include \"lj_folddef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Fold IR instruction. */\r\nTRef LJ_FASTCALL lj_opt_fold(jit_State *J)\r\n{\r\n  uint32_t key, any;\r\n  IRRef ref;\r\n\r\n  if (LJ_UNLIKELY((J->flags & JIT_F_OPT_MASK) != JIT_F_OPT_DEFAULT)) {\r\n    lua_assert(((JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE|JIT_F_OPT_DSE) |\r\n\t\tJIT_F_OPT_DEFAULT) == JIT_F_OPT_DEFAULT);\r\n    /* Folding disabled? Chain to CSE, but not for loads/stores/allocs. */\r\n    if (!(J->flags & JIT_F_OPT_FOLD) && irm_kind(lj_ir_mode[fins->o]) == IRM_N)\r\n      return lj_opt_cse(J);\r\n\r\n    /* No FOLD, forwarding or CSE? Emit raw IR for loads, except for SLOAD. */\r\n    if ((J->flags & (JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE)) !=\r\n\t\t    (JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE) &&\r\n\tirm_kind(lj_ir_mode[fins->o]) == IRM_L && fins->o != IR_SLOAD)\r\n      return lj_ir_emit(J);\r\n\r\n    /* No FOLD or DSE? Emit raw IR for stores. */\r\n    if ((J->flags & (JIT_F_OPT_FOLD|JIT_F_OPT_DSE)) !=\r\n\t\t    (JIT_F_OPT_FOLD|JIT_F_OPT_DSE) &&\r\n\tirm_kind(lj_ir_mode[fins->o]) == IRM_S)\r\n      return lj_ir_emit(J);\r\n  }\r\n\r\n  /* Fold engine start/retry point. */\r\nretry:\r\n  /* Construct key from opcode and operand opcodes (unless literal/none). */\r\n  key = ((uint32_t)fins->o << 17);\r\n  if (fins->op1 >= J->cur.nk) {\r\n    key += (uint32_t)IR(fins->op1)->o << 10;\r\n    *fleft = *IR(fins->op1);\r\n  }\r\n  if (fins->op2 >= J->cur.nk) {\r\n    key += (uint32_t)IR(fins->op2)->o;\r\n    *fright = *IR(fins->op2);\r\n  } else {\r\n    key += (fins->op2 & 0x3ffu);  /* Literal mask. Must include IRCONV_*MASK. */\r\n  }\r\n\r\n  /* Check for a match in order from most specific to least specific. */\r\n  any = 0;\r\n  for (;;) {\r\n    uint32_t k = key | (any & 0x1ffff);\r\n    uint32_t h = fold_hashkey(k);\r\n    uint32_t fh = fold_hash[h];  /* Lookup key in semi-perfect hash table. */\r\n    if ((fh & 0xffffff) == k || (fh = fold_hash[h+1], (fh & 0xffffff) == k)) {\r\n      ref = (IRRef)tref_ref(fold_func[fh >> 24](J));\r\n      if (ref != NEXTFOLD)\r\n\tbreak;\r\n    }\r\n    if (any == 0xfffff)  /* Exhausted folding. Pass on to CSE. */\r\n      return lj_opt_cse(J);\r\n    any = (any | (any >> 10)) ^ 0xffc00;\r\n  }\r\n\r\n  /* Return value processing, ordered by frequency. */\r\n  if (LJ_LIKELY(ref >= MAX_FOLD))\r\n    return TREF(ref, irt_t(IR(ref)->t));\r\n  if (ref == RETRYFOLD)\r\n    goto retry;\r\n  if (ref == KINTFOLD)\r\n    return lj_ir_kint(J, fins->i);\r\n  if (ref == FAILFOLD)\r\n    lj_trace_err(J, LJ_TRERR_GFAIL);\r\n  lua_assert(ref == DROPFOLD);\r\n  return REF_DROP;\r\n}\r\n\r\n/* -- Common-Subexpression Elimination ------------------------------------ */\r\n\r\n/* CSE an IR instruction. This is very fast due to the skip-list chains. */\r\nTRef LJ_FASTCALL lj_opt_cse(jit_State *J)\r\n{\r\n  /* Avoid narrow to wide store-to-load forwarding stall */\r\n  IRRef2 op12 = (IRRef2)fins->op1 + ((IRRef2)fins->op2 << 16);\r\n  IROp op = fins->o;\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    /* Limited search for same operands in per-opcode chain. */\r\n    IRRef ref = J->chain[op];\r\n    IRRef lim = fins->op1;\r\n    if (fins->op2 > lim) lim = fins->op2;  /* Relies on lit < REF_BIAS. */\r\n    while (ref > lim) {\r\n      if (IR(ref)->op12 == op12)\r\n\treturn TREF(ref, irt_t(IR(ref)->t));  /* Common subexpression found. */\r\n      ref = IR(ref)->prev;\r\n    }\r\n  }\r\n  /* Otherwise emit IR (inlined for speed). */\r\n  {\r\n    IRRef ref = lj_ir_nextins(J);\r\n    IRIns *ir = IR(ref);\r\n    ir->prev = J->chain[op];\r\n    ir->op12 = op12;\r\n    J->chain[op] = (IRRef1)ref;\r\n    ir->o = fins->o;\r\n    J->guardemit.irt |= fins->t.irt;\r\n    return TREF(ref, irt_t((ir->t = fins->t)));\r\n  }\r\n}\r\n\r\n/* CSE with explicit search limit. */\r\nTRef LJ_FASTCALL lj_opt_cselim(jit_State *J, IRRef lim)\r\n{\r\n  IRRef ref = J->chain[fins->o];\r\n  IRRef2 op12 = (IRRef2)fins->op1 + ((IRRef2)fins->op2 << 16);\r\n  while (ref > lim) {\r\n    if (IR(ref)->op12 == op12)\r\n      return ref;\r\n    ref = IR(ref)->prev;\r\n  }\r\n  return lj_ir_emit(J);\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#undef IR\r\n#undef fins\r\n#undef fleft\r\n#undef fright\r\n#undef knumleft\r\n#undef knumright\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_loop.c",
    "content": "/*\r\n** LOOP: Loop Optimizations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_loop_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Loop optimization:\r\n**\r\n** Traditional Loop-Invariant Code Motion (LICM) splits the instructions\r\n** of a loop into invariant and variant instructions. The invariant\r\n** instructions are hoisted out of the loop and only the variant\r\n** instructions remain inside the loop body.\r\n**\r\n** Unfortunately LICM is mostly useless for compiling dynamic languages.\r\n** The IR has many guards and most of the subsequent instructions are\r\n** control-dependent on them. The first non-hoistable guard would\r\n** effectively prevent hoisting of all subsequent instructions.\r\n**\r\n** That's why we use a special form of unrolling using copy-substitution,\r\n** combined with redundancy elimination:\r\n**\r\n** The recorded instruction stream is re-emitted to the compiler pipeline\r\n** with substituted operands. The substitution table is filled with the\r\n** refs returned by re-emitting each instruction. This can be done\r\n** on-the-fly, because the IR is in strict SSA form, where every ref is\r\n** defined before its use.\r\n**\r\n** This aproach generates two code sections, separated by the LOOP\r\n** instruction:\r\n**\r\n** 1. The recorded instructions form a kind of pre-roll for the loop. It\r\n** contains a mix of invariant and variant instructions and performs\r\n** exactly one loop iteration (but not necessarily the 1st iteration).\r\n**\r\n** 2. The loop body contains only the variant instructions and performs\r\n** all remaining loop iterations.\r\n**\r\n** On first sight that looks like a waste of space, because the variant\r\n** instructions are present twice. But the key insight is that the\r\n** pre-roll honors the control-dependencies for *both* the pre-roll itself\r\n** *and* the loop body!\r\n**\r\n** It also means one doesn't have to explicitly model control-dependencies\r\n** (which, BTW, wouldn't help LICM much). And it's much easier to\r\n** integrate sparse snapshotting with this approach.\r\n**\r\n** One of the nicest aspects of this approach is that all of the\r\n** optimizations of the compiler pipeline (FOLD, CSE, FWD, etc.) can be\r\n** reused with only minor restrictions (e.g. one should not fold\r\n** instructions across loop-carried dependencies).\r\n**\r\n** But in general all optimizations can be applied which only need to look\r\n** backwards into the generated instruction stream. At any point in time\r\n** during the copy-substitution process this contains both a static loop\r\n** iteration (the pre-roll) and a dynamic one (from the to-be-copied\r\n** instruction up to the end of the partial loop body).\r\n**\r\n** Since control-dependencies are implicitly kept, CSE also applies to all\r\n** kinds of guards. The major advantage is that all invariant guards can\r\n** be hoisted, too.\r\n**\r\n** Load/store forwarding works across loop iterations, too. This is\r\n** important if loop-carried dependencies are kept in upvalues or tables.\r\n** E.g. 'self.idx = self.idx + 1' deep down in some OO-style method may\r\n** become a forwarded loop-recurrence after inlining.\r\n**\r\n** Since the IR is in SSA form, loop-carried dependencies have to be\r\n** modeled with PHI instructions. The potential candidates for PHIs are\r\n** collected on-the-fly during copy-substitution. After eliminating the\r\n** redundant ones, PHI instructions are emitted *below* the loop body.\r\n**\r\n** Note that this departure from traditional SSA form doesn't change the\r\n** semantics of the PHI instructions themselves. But it greatly simplifies\r\n** on-the-fly generation of the IR and the machine code.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- PHI elimination ----------------------------------------------------- */\r\n\r\n/* Emit or eliminate collected PHIs. */\r\nstatic void loop_emit_phi(jit_State *J, IRRef1 *subst, IRRef1 *phi, IRRef nphi,\r\n\t\t\t  SnapNo onsnap)\r\n{\r\n  int passx = 0;\r\n  IRRef i, j, nslots;\r\n  IRRef invar = J->chain[IR_LOOP];\r\n  /* Pass #1: mark redundant and potentially redundant PHIs. */\r\n  for (i = 0, j = 0; i < nphi; i++) {\r\n    IRRef lref = phi[i];\r\n    IRRef rref = subst[lref];\r\n    if (lref == rref || rref == REF_DROP) {  /* Invariants are redundant. */\r\n      irt_clearphi(IR(lref)->t);\r\n    } else {\r\n      phi[j++] = (IRRef1)lref;\r\n      if (!(IR(rref)->op1 == lref || IR(rref)->op2 == lref)) {\r\n\t/* Quick check for simple recurrences failed, need pass2. */\r\n\tirt_setmark(IR(lref)->t);\r\n\tpassx = 1;\r\n      }\r\n    }\r\n  }\r\n  nphi = j;\r\n  /* Pass #2: traverse variant part and clear marks of non-redundant PHIs. */\r\n  if (passx) {\r\n    SnapNo s;\r\n    for (i = J->cur.nins-1; i > invar; i--) {\r\n      IRIns *ir = IR(i);\r\n      if (!irref_isk(ir->op2)) irt_clearmark(IR(ir->op2)->t);\r\n      if (!irref_isk(ir->op1)) {\r\n\tirt_clearmark(IR(ir->op1)->t);\r\n\tif (ir->op1 < invar &&\r\n\t    ir->o >= IR_CALLN && ir->o <= IR_CARG) {  /* ORDER IR */\r\n\t  ir = IR(ir->op1);\r\n\t  while (ir->o == IR_CARG) {\r\n\t    if (!irref_isk(ir->op2)) irt_clearmark(IR(ir->op2)->t);\r\n\t    if (irref_isk(ir->op1)) break;\r\n\t    ir = IR(ir->op1);\r\n\t    irt_clearmark(ir->t);\r\n\t  }\r\n\t}\r\n      }\r\n    }\r\n    for (s = J->cur.nsnap-1; s >= onsnap; s--) {\r\n      SnapShot *snap = &J->cur.snap[s];\r\n      SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n      MSize n, nent = snap->nent;\r\n      for (n = 0; n < nent; n++) {\r\n\tIRRef ref = snap_ref(map[n]);\r\n\tif (!irref_isk(ref)) irt_clearmark(IR(ref)->t);\r\n      }\r\n    }\r\n  }\r\n  /* Pass #3: add PHIs for variant slots without a corresponding SLOAD. */\r\n  nslots = J->baseslot+J->maxslot;\r\n  for (i = 1; i < nslots; i++) {\r\n    IRRef ref = tref_ref(J->slot[i]);\r\n    while (!irref_isk(ref) && ref != subst[ref]) {\r\n      IRIns *ir = IR(ref);\r\n      irt_clearmark(ir->t);  /* Unmark potential uses, too. */\r\n      if (irt_isphi(ir->t) || irt_ispri(ir->t))\r\n\tbreak;\r\n      irt_setphi(ir->t);\r\n      if (nphi >= LJ_MAX_PHI)\r\n\tlj_trace_err(J, LJ_TRERR_PHIOV);\r\n      phi[nphi++] = (IRRef1)ref;\r\n      ref = subst[ref];\r\n      if (ref > invar)\r\n\tbreak;\r\n    }\r\n  }\r\n  /* Pass #4: propagate non-redundant PHIs. */\r\n  while (passx) {\r\n    passx = 0;\r\n    for (i = 0; i < nphi; i++) {\r\n      IRRef lref = phi[i];\r\n      IRIns *ir = IR(lref);\r\n      if (!irt_ismarked(ir->t)) {  /* Propagate only from unmarked PHIs. */\r\n\tIRIns *irr = IR(subst[lref]);\r\n\tif (irt_ismarked(irr->t)) {  /* Right ref points to other PHI? */\r\n\t  irt_clearmark(irr->t);  /* Mark that PHI as non-redundant. */\r\n\t  passx = 1;  /* Retry. */\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  /* Pass #5: emit PHI instructions or eliminate PHIs. */\r\n  for (i = 0; i < nphi; i++) {\r\n    IRRef lref = phi[i];\r\n    IRIns *ir = IR(lref);\r\n    if (!irt_ismarked(ir->t)) {  /* Emit PHI if not marked. */\r\n      IRRef rref = subst[lref];\r\n      if (rref > invar)\r\n\tirt_setphi(IR(rref)->t);\r\n      emitir_raw(IRT(IR_PHI, irt_type(ir->t)), lref, rref);\r\n    } else {  /* Otherwise eliminate PHI. */\r\n      irt_clearmark(ir->t);\r\n      irt_clearphi(ir->t);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Loop unrolling using copy-substitution ------------------------------ */\r\n\r\n/* Copy-substitute snapshot. */\r\nstatic void loop_subst_snap(jit_State *J, SnapShot *osnap,\r\n\t\t\t    SnapEntry *loopmap, IRRef1 *subst)\r\n{\r\n  SnapEntry *nmap, *omap = &J->cur.snapmap[osnap->mapofs];\r\n  SnapEntry *nextmap = &J->cur.snapmap[snap_nextofs(&J->cur, osnap)];\r\n  MSize nmapofs;\r\n  MSize on, ln, nn, onent = osnap->nent;\r\n  BCReg nslots = osnap->nslots;\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap];\r\n  if (irt_isguard(J->guardemit)) {  /* Guard inbetween? */\r\n    nmapofs = J->cur.nsnapmap;\r\n    J->cur.nsnap++;  /* Add new snapshot. */\r\n  } else {  /* Otherwise overwrite previous snapshot. */\r\n    snap--;\r\n    nmapofs = snap->mapofs;\r\n  }\r\n  J->guardemit.irt = 0;\r\n  /* Setup new snapshot. */\r\n  snap->mapofs = (uint16_t)nmapofs;\r\n  snap->ref = (IRRef1)J->cur.nins;\r\n  snap->nslots = nslots;\r\n  snap->topslot = osnap->topslot;\r\n  snap->count = 0;\r\n  nmap = &J->cur.snapmap[nmapofs];\r\n  /* Substitute snapshot slots. */\r\n  on = ln = nn = 0;\r\n  while (on < onent) {\r\n    SnapEntry osn = omap[on], lsn = loopmap[ln];\r\n    if (snap_slot(lsn) < snap_slot(osn)) {  /* Copy slot from loop map. */\r\n      nmap[nn++] = lsn;\r\n      ln++;\r\n    } else {  /* Copy substituted slot from snapshot map. */\r\n      if (snap_slot(lsn) == snap_slot(osn)) ln++;  /* Shadowed loop slot. */\r\n      if (!irref_isk(snap_ref(osn)))\r\n\tosn = snap_setref(osn, subst[snap_ref(osn)]);\r\n      nmap[nn++] = osn;\r\n      on++;\r\n    }\r\n  }\r\n  while (snap_slot(loopmap[ln]) < nslots)  /* Copy remaining loop slots. */\r\n    nmap[nn++] = loopmap[ln++];\r\n  snap->nent = (uint8_t)nn;\r\n  omap += onent;\r\n  nmap += nn;\r\n  while (omap < nextmap)  /* Copy PC + frame links. */\r\n    *nmap++ = *omap++;\r\n  J->cur.nsnapmap = (uint16_t)(nmap - J->cur.snapmap);\r\n}\r\n\r\n/* Unroll loop. */\r\nstatic void loop_unroll(jit_State *J)\r\n{\r\n  IRRef1 phi[LJ_MAX_PHI];\r\n  uint32_t nphi = 0;\r\n  IRRef1 *subst;\r\n  SnapNo onsnap;\r\n  SnapShot *osnap, *loopsnap;\r\n  SnapEntry *loopmap, *psentinel;\r\n  IRRef ins, invar;\r\n\r\n  /* Use temp buffer for substitution table.\r\n  ** Only non-constant refs in [REF_BIAS,invar) are valid indexes.\r\n  ** Caveat: don't call into the VM or run the GC or the buffer may be gone.\r\n  */\r\n  invar = J->cur.nins;\r\n  subst = (IRRef1 *)lj_str_needbuf(J->L, &G(J->L)->tmpbuf,\r\n\t\t\t\t   (invar-REF_BIAS)*sizeof(IRRef1)) - REF_BIAS;\r\n  subst[REF_BASE] = REF_BASE;\r\n\r\n  /* LOOP separates the pre-roll from the loop body. */\r\n  emitir_raw(IRTG(IR_LOOP, IRT_NIL), 0, 0);\r\n\r\n  /* Grow snapshot buffer and map for copy-substituted snapshots.\r\n  ** Need up to twice the number of snapshots minus #0 and loop snapshot.\r\n  ** Need up to twice the number of entries plus fallback substitutions\r\n  ** from the loop snapshot entries for each new snapshot.\r\n  ** Caveat: both calls may reallocate J->cur.snap and J->cur.snapmap!\r\n  */\r\n  onsnap = J->cur.nsnap;\r\n  lj_snap_grow_buf(J, 2*onsnap-2);\r\n  lj_snap_grow_map(J, J->cur.nsnapmap*2+(onsnap-2)*J->cur.snap[onsnap-1].nent);\r\n\r\n  /* The loop snapshot is used for fallback substitutions. */\r\n  loopsnap = &J->cur.snap[onsnap-1];\r\n  loopmap = &J->cur.snapmap[loopsnap->mapofs];\r\n  /* The PC of snapshot #0 and the loop snapshot must match. */\r\n  psentinel = &loopmap[loopsnap->nent];\r\n  lua_assert(*psentinel == J->cur.snapmap[J->cur.snap[0].nent]);\r\n  *psentinel = SNAP(255, 0, 0);  /* Replace PC with temporary sentinel. */\r\n\r\n  /* Start substitution with snapshot #1 (#0 is empty for root traces). */\r\n  osnap = &J->cur.snap[1];\r\n\r\n  /* Copy and substitute all recorded instructions and snapshots. */\r\n  for (ins = REF_FIRST; ins < invar; ins++) {\r\n    IRIns *ir;\r\n    IRRef op1, op2;\r\n\r\n    if (ins >= osnap->ref)  /* Instruction belongs to next snapshot? */\r\n      loop_subst_snap(J, osnap++, loopmap, subst);  /* Copy-substitute it. */\r\n\r\n    /* Substitute instruction operands. */\r\n    ir = IR(ins);\r\n    op1 = ir->op1;\r\n    if (!irref_isk(op1)) op1 = subst[op1];\r\n    op2 = ir->op2;\r\n    if (!irref_isk(op2)) op2 = subst[op2];\r\n    if (irm_kind(lj_ir_mode[ir->o]) == IRM_N &&\r\n\top1 == ir->op1 && op2 == ir->op2) {  /* Regular invariant ins? */\r\n      subst[ins] = (IRRef1)ins;  /* Shortcut. */\r\n    } else {\r\n      /* Re-emit substituted instruction to the FOLD/CSE/etc. pipeline. */\r\n      IRType1 t = ir->t;  /* Get this first, since emitir may invalidate ir. */\r\n      IRRef ref = tref_ref(emitir(ir->ot & ~IRT_ISPHI, op1, op2));\r\n      subst[ins] = (IRRef1)ref;\r\n      if (ref != ins) {\r\n\tIRIns *irr = IR(ref);\r\n\tif (ref < invar) {  /* Loop-carried dependency? */\r\n\t  /* Potential PHI? */\r\n\t  if (!irref_isk(ref) && !irt_isphi(irr->t) && !irt_ispri(irr->t)) {\r\n\t    irt_setphi(irr->t);\r\n\t    if (nphi >= LJ_MAX_PHI)\r\n\t      lj_trace_err(J, LJ_TRERR_PHIOV);\r\n\t    phi[nphi++] = (IRRef1)ref;\r\n\t  }\r\n\t  /* Check all loop-carried dependencies for type instability. */\r\n\t  if (!irt_sametype(t, irr->t)) {\r\n\t    if (irt_isinteger(t) && irt_isinteger(irr->t))\r\n\t      continue;\r\n\t    else if (irt_isnum(t) && irt_isinteger(irr->t))  /* Fix int->num. */\r\n\t      ref = tref_ref(emitir(IRTN(IR_CONV), ref, IRCONV_NUM_INT));\r\n\t    else if (irt_isnum(irr->t) && irt_isinteger(t))  /* Fix num->int. */\r\n\t      ref = tref_ref(emitir(IRTGI(IR_CONV), ref,\r\n\t\t\t\t    IRCONV_INT_NUM|IRCONV_CHECK));\r\n\t    else\r\n\t      lj_trace_err(J, LJ_TRERR_TYPEINS);\r\n\t    subst[ins] = (IRRef1)ref;\r\n\t    irr = IR(ref);\r\n\t    goto phiconv;\r\n\t  }\r\n\t} else if (ref != REF_DROP && irr->o == IR_CONV &&\r\n\t\t   ref > invar && irr->op1 < invar) {\r\n\t  /* May need an extra PHI for a CONV. */\r\n\t  ref = irr->op1;\r\n\t  irr = IR(ref);\r\n\tphiconv:\r\n\t  if (ref < invar && !irref_isk(ref) && !irt_isphi(irr->t)) {\r\n\t    irt_setphi(irr->t);\r\n\t    if (nphi >= LJ_MAX_PHI)\r\n\t      lj_trace_err(J, LJ_TRERR_PHIOV);\r\n\t    phi[nphi++] = (IRRef1)ref;\r\n\t  }\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  if (!irt_isguard(J->guardemit))  /* Drop redundant snapshot. */\r\n    J->cur.nsnapmap = (uint16_t)J->cur.snap[--J->cur.nsnap].mapofs;\r\n  lua_assert(J->cur.nsnapmap <= J->sizesnapmap);\r\n  *psentinel = J->cur.snapmap[J->cur.snap[0].nent];  /* Restore PC. */\r\n\r\n  loop_emit_phi(J, subst, phi, nphi, onsnap);\r\n}\r\n\r\n/* Undo any partial changes made by the loop optimization. */\r\nstatic void loop_undo(jit_State *J, IRRef ins, SnapNo nsnap, MSize nsnapmap)\r\n{\r\n  ptrdiff_t i;\r\n  SnapShot *snap = &J->cur.snap[nsnap-1];\r\n  SnapEntry *map = J->cur.snapmap;\r\n  map[snap->mapofs + snap->nent] = map[J->cur.snap[0].nent];  /* Restore PC. */\r\n  J->cur.nsnapmap = (uint16_t)nsnapmap;\r\n  J->cur.nsnap = nsnap;\r\n  J->guardemit.irt = 0;\r\n  lj_ir_rollback(J, ins);\r\n  for (i = 0; i < BPROP_SLOTS; i++) {  /* Remove backprop. cache entries. */\r\n    BPropEntry *bp = &J->bpropcache[i];\r\n    if (bp->val >= ins)\r\n      bp->key = 0;\r\n  }\r\n  for (ins--; ins >= REF_FIRST; ins--) {  /* Remove flags. */\r\n    IRIns *ir = IR(ins);\r\n    irt_clearphi(ir->t);\r\n    irt_clearmark(ir->t);\r\n  }\r\n}\r\n\r\n/* Protected callback for loop optimization. */\r\nstatic TValue *cploop_opt(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  UNUSED(L); UNUSED(dummy);\r\n  loop_unroll((jit_State *)ud);\r\n  return NULL;\r\n}\r\n\r\n/* Loop optimization. */\r\nint lj_opt_loop(jit_State *J)\r\n{\r\n  IRRef nins = J->cur.nins;\r\n  SnapNo nsnap = J->cur.nsnap;\r\n  MSize nsnapmap = J->cur.nsnapmap;\r\n  int errcode = lj_vm_cpcall(J->L, NULL, J, cploop_opt);\r\n  if (LJ_UNLIKELY(errcode)) {\r\n    lua_State *L = J->L;\r\n    if (errcode == LUA_ERRRUN && tvisnumber(L->top-1)) {  /* Trace error? */\r\n      int32_t e = numberVint(L->top-1);\r\n      switch ((TraceError)e) {\r\n      case LJ_TRERR_TYPEINS:  /* Type instability. */\r\n      case LJ_TRERR_GFAIL:  /* Guard would always fail. */\r\n\t/* Unrolling via recording fixes many cases, e.g. a flipped boolean. */\r\n\tif (--J->instunroll < 0)  /* But do not unroll forever. */\r\n\t  break;\r\n\tL->top--;  /* Remove error object. */\r\n\tloop_undo(J, nins, nsnap, nsnapmap);\r\n\treturn 1;  /* Loop optimization failed, continue recording. */\r\n      default:\r\n\tbreak;\r\n      }\r\n    }\r\n    lj_err_throw(L, errcode);  /* Propagate all other errors. */\r\n  }\r\n  return 0;  /* Loop optimization is ok. */\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n#undef emitir_raw\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_mem.c",
    "content": "/*\r\n** Memory access optimizations.\r\n** AA: Alias Analysis using high-level semantic disambiguation.\r\n** FWD: Load Forwarding (L2L) + Store Forwarding (S2L).\r\n** DSE: Dead-Store Elimination.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_mem_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t(&J->fold.ins)\r\n#define fleft\t\t(&J->fold.left)\r\n#define fright\t\t(&J->fold.right)\r\n\r\n/*\r\n** Caveat #1: return value is not always a TRef -- only use with tref_ref().\r\n** Caveat #2: FWD relies on active CSE for xREF operands -- see lj_opt_fold().\r\n*/\r\n\r\n/* Return values from alias analysis. */\r\ntypedef enum {\r\n  ALIAS_NO,\t/* The two refs CANNOT alias (exact). */\r\n  ALIAS_MAY,\t/* The two refs MAY alias (inexact). */\r\n  ALIAS_MUST\t/* The two refs MUST alias (exact). */\r\n} AliasRet;\r\n\r\n/* -- ALOAD/HLOAD forwarding and ASTORE/HSTORE elimination ---------------- */\r\n\r\n/* Simplified escape analysis: check for intervening stores. */\r\nstatic AliasRet aa_escape(jit_State *J, IRIns *ir, IRIns *stop)\r\n{\r\n  IRRef ref = (IRRef)(ir - J->cur.ir);  /* The ref that might be stored. */\r\n  for (ir++; ir < stop; ir++)\r\n    if (ir->op2 == ref &&\r\n\t(ir->o == IR_ASTORE || ir->o == IR_HSTORE ||\r\n\t ir->o == IR_USTORE || ir->o == IR_FSTORE))\r\n      return ALIAS_MAY;  /* Reference was stored and might alias. */\r\n  return ALIAS_NO;  /* Reference was not stored. */\r\n}\r\n\r\n/* Alias analysis for two different table references. */\r\nstatic AliasRet aa_table(jit_State *J, IRRef ta, IRRef tb)\r\n{\r\n  IRIns *taba = IR(ta), *tabb = IR(tb);\r\n  int newa, newb;\r\n  lua_assert(ta != tb);\r\n  lua_assert(irt_istab(taba->t) && irt_istab(tabb->t));\r\n  /* Disambiguate new allocations. */\r\n  newa = (taba->o == IR_TNEW || taba->o == IR_TDUP);\r\n  newb = (tabb->o == IR_TNEW || tabb->o == IR_TDUP);\r\n  if (newa && newb)\r\n    return ALIAS_NO;  /* Two different allocations never alias. */\r\n  if (newb) {  /* At least one allocation? */\r\n    IRIns *tmp = taba; taba = tabb; tabb = tmp;\r\n  } else if (!newa) {\r\n    return ALIAS_MAY;  /* Anything else: we just don't know. */\r\n  }\r\n  return aa_escape(J, taba, tabb);\r\n}\r\n\r\n/* Alias analysis for array and hash access using key-based disambiguation. */\r\nstatic AliasRet aa_ahref(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  IRRef ka = refa->op2;\r\n  IRRef kb = refb->op2;\r\n  IRIns *keya, *keyb;\r\n  IRRef ta, tb;\r\n  if (refa == refb)\r\n    return ALIAS_MUST;  /* Shortcut for same refs. */\r\n  keya = IR(ka);\r\n  if (keya->o == IR_KSLOT) { ka = keya->op1; keya = IR(ka); }\r\n  keyb = IR(kb);\r\n  if (keyb->o == IR_KSLOT) { kb = keyb->op1; keyb = IR(kb); }\r\n  ta = (refa->o==IR_HREFK || refa->o==IR_AREF) ? IR(refa->op1)->op1 : refa->op1;\r\n  tb = (refb->o==IR_HREFK || refb->o==IR_AREF) ? IR(refb->op1)->op1 : refb->op1;\r\n  if (ka == kb) {\r\n    /* Same key. Check for same table with different ref (NEWREF vs. HREF). */\r\n    if (ta == tb)\r\n      return ALIAS_MUST;  /* Same key, same table. */\r\n    else\r\n      return aa_table(J, ta, tb);  /* Same key, possibly different table. */\r\n  }\r\n  if (irref_isk(ka) && irref_isk(kb))\r\n    return ALIAS_NO;  /* Different constant keys. */\r\n  if (refa->o == IR_AREF) {\r\n    /* Disambiguate array references based on index arithmetic. */\r\n    int32_t ofsa = 0, ofsb = 0;\r\n    IRRef basea = ka, baseb = kb;\r\n    lua_assert(refb->o == IR_AREF);\r\n    /* Gather base and offset from t[base] or t[base+-ofs]. */\r\n    if (keya->o == IR_ADD && irref_isk(keya->op2)) {\r\n      basea = keya->op1;\r\n      ofsa = IR(keya->op2)->i;\r\n      if (basea == kb && ofsa != 0)\r\n\treturn ALIAS_NO;  /* t[base+-ofs] vs. t[base]. */\r\n    }\r\n    if (keyb->o == IR_ADD && irref_isk(keyb->op2)) {\r\n      baseb = keyb->op1;\r\n      ofsb = IR(keyb->op2)->i;\r\n      if (ka == baseb && ofsb != 0)\r\n\treturn ALIAS_NO;  /* t[base] vs. t[base+-ofs]. */\r\n    }\r\n    if (basea == baseb && ofsa != ofsb)\r\n      return ALIAS_NO;  /* t[base+-o1] vs. t[base+-o2] and o1 != o2. */\r\n  } else {\r\n    /* Disambiguate hash references based on the type of their keys. */\r\n    lua_assert((refa->o==IR_HREF || refa->o==IR_HREFK || refa->o==IR_NEWREF) &&\r\n\t       (refb->o==IR_HREF || refb->o==IR_HREFK || refb->o==IR_NEWREF));\r\n    if (!irt_sametype(keya->t, keyb->t))\r\n      return ALIAS_NO;  /* Different key types. */\r\n  }\r\n  if (ta == tb)\r\n    return ALIAS_MAY;  /* Same table, cannot disambiguate keys. */\r\n  else\r\n    return aa_table(J, ta, tb);  /* Try to disambiguate tables. */\r\n}\r\n\r\n/* Array and hash load forwarding. */\r\nstatic TRef fwd_ahload(jit_State *J, IRRef xref)\r\n{\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[fins->o+IRDELTA_L2S];\r\n  while (ref > xref) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_ahref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* No conflicting store (yet): const-fold loads from allocations. */\r\n  {\r\n    IRIns *ir = (xr->o == IR_HREFK || xr->o == IR_AREF) ? IR(xr->op1) : xr;\r\n    IRRef tab = ir->op1;\r\n    ir = IR(tab);\r\n    if (ir->o == IR_TNEW || (ir->o == IR_TDUP && irref_isk(xr->op2))) {\r\n      /* A NEWREF with a number key may end up pointing to the array part.\r\n      ** But it's referenced from HSTORE and not found in the ASTORE chain.\r\n      ** For now simply consider this a conflict without forwarding anything.\r\n      */\r\n      if (xr->o == IR_AREF) {\r\n\tIRRef ref2 = J->chain[IR_NEWREF];\r\n\twhile (ref2 > tab) {\r\n\t  IRIns *newref = IR(ref2);\r\n\t  if (irt_isnum(IR(newref->op2)->t))\r\n\t    goto cselim;\r\n\t  ref2 = newref->prev;\r\n\t}\r\n      }\r\n      /* NEWREF inhibits CSE for HREF, and dependent FLOADs from HREFK/AREF.\r\n      ** But the above search for conflicting stores was limited by xref.\r\n      ** So continue searching, limited by the TNEW/TDUP. Store forwarding\r\n      ** is ok, too. A conflict does NOT limit the search for a matching load.\r\n      */\r\n      while (ref > tab) {\r\n\tIRIns *store = IR(ref);\r\n\tswitch (aa_ahref(J, xr, IR(store->op1))) {\r\n\tcase ALIAS_NO:   break;  /* Continue searching. */\r\n\tcase ALIAS_MAY:  goto cselim;  /* Conflicting store. */\r\n\tcase ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n\t}\r\n\tref = store->prev;\r\n      }\r\n      lua_assert(ir->o != IR_TNEW || irt_isnil(fins->t));\r\n      if (irt_ispri(fins->t)) {\r\n\treturn TREF_PRI(irt_type(fins->t));\r\n      } else if (irt_isnum(fins->t) || (LJ_DUALNUM && irt_isint(fins->t)) ||\r\n\t\t irt_isstr(fins->t)) {\r\n\tTValue keyv;\r\n\tcTValue *tv;\r\n\tIRIns *key = IR(xr->op2);\r\n\tif (key->o == IR_KSLOT) key = IR(key->op1);\r\n\tlj_ir_kvalue(J->L, &keyv, key);\r\n\ttv = lj_tab_get(J->L, ir_ktab(IR(ir->op1)), &keyv);\r\n\tlua_assert(itype2irt(tv) == irt_type(fins->t));\r\n\tif (irt_isnum(fins->t))\r\n\t  return lj_ir_knum_u64(J, tv->u64);\r\n\telse if (LJ_DUALNUM && irt_isint(fins->t))\r\n\t  return lj_ir_kint(J, intV(tv));\r\n\telse\r\n\t  return lj_ir_kstr(J, strV(tv));\r\n      }\r\n      /* Othwerwise: don't intern as a constant. */\r\n    }\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  ref = J->chain[fins->o];\r\n  while (ref > lim) {\r\n    IRIns *load = IR(ref);\r\n    if (load->op1 == xref)\r\n      return ref;  /* Load forwarding. */\r\n    ref = load->prev;\r\n  }\r\n  return 0;  /* Conflict or no match. */\r\n}\r\n\r\n/* Reassociate ALOAD across PHIs to handle t[i-1] forwarding case. */\r\nstatic TRef fwd_aload_reassoc(jit_State *J)\r\n{\r\n  IRIns *irx = IR(fins->op1);\r\n  IRIns *key = IR(irx->op2);\r\n  if (key->o == IR_ADD && irref_isk(key->op2)) {\r\n    IRIns *add2 = IR(key->op1);\r\n    if (add2->o == IR_ADD && irref_isk(add2->op2) &&\r\n\tIR(key->op2)->i == -IR(add2->op2)->i) {\r\n      IRRef ref = J->chain[IR_AREF];\r\n      IRRef lim = add2->op1;\r\n      if (irx->op1 > lim) lim = irx->op1;\r\n      while (ref > lim) {\r\n\tIRIns *ir = IR(ref);\r\n\tif (ir->op1 == irx->op1 && ir->op2 == add2->op1)\r\n\t  return fwd_ahload(J, ref);\r\n\tref = ir->prev;\r\n      }\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* ALOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_aload(jit_State *J)\r\n{\r\n  IRRef ref;\r\n  if ((ref = fwd_ahload(J, fins->op1)) ||\r\n      (ref = fwd_aload_reassoc(J)))\r\n    return ref;\r\n  return EMITFOLD;\r\n}\r\n\r\n/* HLOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_hload(jit_State *J)\r\n{\r\n  IRRef ref = fwd_ahload(J, fins->op1);\r\n  if (ref)\r\n    return ref;\r\n  return EMITFOLD;\r\n}\r\n\r\n/* HREFK forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_hrefk(jit_State *J)\r\n{\r\n  IRRef tab = fleft->op1;\r\n  IRRef ref = J->chain[IR_NEWREF];\r\n  while (ref > tab) {\r\n    IRIns *newref = IR(ref);\r\n    if (tab == newref->op1) {\r\n      if (fright->op1 == newref->op2)\r\n\treturn ref;  /* Forward from NEWREF. */\r\n      else\r\n\tgoto docse;\r\n    } else if (aa_table(J, tab, newref->op1) != ALIAS_NO) {\r\n      goto docse;\r\n    }\r\n    ref = newref->prev;\r\n  }\r\n  /* No conflicting NEWREF: key location unchanged for HREFK of TDUP. */\r\n  if (IR(tab)->o == IR_TDUP)\r\n    fins->t.irt &= ~IRT_GUARD;  /* Drop HREFK guard. */\r\ndocse:\r\n  return CSEFOLD;\r\n}\r\n\r\n/* Check whether HREF of TNEW/TDUP can be folded to niltv. */\r\nint LJ_FASTCALL lj_opt_fwd_href_nokey(jit_State *J)\r\n{\r\n  IRRef lim = fins->op1;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* The key for an ASTORE may end up in the hash part after a NEWREF. */\r\n  if (irt_isnum(fright->t) && J->chain[IR_NEWREF] > lim) {\r\n    ref = J->chain[IR_ASTORE];\r\n    while (ref > lim) {\r\n      if (ref < J->chain[IR_NEWREF])\r\n\treturn 0;  /* Conflict. */\r\n      ref = IR(ref)->prev;\r\n    }\r\n  }\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_HSTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    if (aa_ahref(J, fins, IR(store->op1)) != ALIAS_NO)\r\n      return 0;  /* Conflict. */\r\n    ref = store->prev;\r\n  }\r\n\r\n  return 1;  /* No conflict. Can fold to niltv. */\r\n}\r\n\r\n/* Check whether there's no aliasing NEWREF for the left operand. */\r\nint LJ_FASTCALL lj_opt_fwd_tptr(jit_State *J, IRRef lim)\r\n{\r\n  IRRef ta = fins->op1;\r\n  IRRef ref = J->chain[IR_NEWREF];\r\n  while (ref > lim) {\r\n    IRIns *newref = IR(ref);\r\n    if (ta == newref->op1 || aa_table(J, ta, newref->op1) != ALIAS_NO)\r\n      return 0;  /* Conflict. */\r\n    ref = newref->prev;\r\n  }\r\n  return 1;  /* No conflict. Can safely FOLD/CSE. */\r\n}\r\n\r\n/* ASTORE/HSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_ahstore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;  /* xREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(xref);\r\n  IRRef1 *refp = &J->chain[fins->o];\r\n  IRRef ref = *refp;\r\n  while (ref > xref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_ahref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\t/* Store to MAYBE the same location. */\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\t/* Store to the same location. */\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards (includes conflicting loads). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || ir->o == IR_CALLL)\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- ULOAD forwarding ---------------------------------------------------- */\r\n\r\n/* The current alias analysis for upvalues is very simplistic. It only\r\n** disambiguates between the unique upvalues of the same function.\r\n** This is good enough for now, since most upvalues are read-only.\r\n**\r\n** A more precise analysis would be feasible with the help of the parser:\r\n** generate a unique key for every upvalue, even across all prototypes.\r\n** Lacking a realistic use-case, it's unclear whether this is beneficial.\r\n*/\r\nstatic AliasRet aa_uref(IRIns *refa, IRIns *refb)\r\n{\r\n  if (refa->o != refb->o)\r\n    return ALIAS_NO;  /* Different UREFx type. */\r\n  if (refa->op1 == refb->op1) {  /* Same function. */\r\n    if (refa->op2 == refb->op2)\r\n      return ALIAS_MUST;  /* Same function, same upvalue idx. */\r\n    else\r\n      return ALIAS_NO;  /* Same function, different upvalue idx. */\r\n  } else {  /* Different functions, check disambiguation hash values. */\r\n    if (((refa->op2 ^ refb->op2) & 0xff))\r\n      return ALIAS_NO;  /* Upvalues with different hash values cannot alias. */\r\n    else\r\n      return ALIAS_MAY;  /* No conclusion can be drawn for same hash value. */\r\n  }\r\n}\r\n\r\n/* ULOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_uload(jit_State *J)\r\n{\r\n  IRRef uref = fins->op1;\r\n  IRRef lim = REF_BASE;  /* Search limit. */\r\n  IRIns *xr = IR(uref);\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_USTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_uref(xr, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n\r\n  ref = J->chain[IR_ULOAD];\r\n  while (ref > lim) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->op1 == uref ||\r\n\t(IR(ir->op1)->op12 == IR(uref)->op12 && IR(ir->op1)->o == IR(uref)->o))\r\n      return ref;  /* Match for identical or equal UREFx (non-CSEable UREFO). */\r\n    ref = ir->prev;\r\n  }\r\n  return lj_ir_emit(J);\r\n}\r\n\r\n/* USTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_ustore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;  /* xREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(xref);\r\n  IRRef1 *refp = &J->chain[IR_USTORE];\r\n  IRRef ref = *refp;\r\n  while (ref > xref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_uref(xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\t/* Store to MAYBE the same location. */\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\t/* Store to the same location. */\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards (includes conflicting loads). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t))\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\tif (ref+1 < J->cur.nins &&\r\n\t    store[1].o == IR_OBAR && store[1].op1 == xref) {\r\n\t  IRRef1 *bp = &J->chain[IR_OBAR];\r\n\t  IRIns *obar;\r\n\t  for (obar = IR(*bp); *bp > ref+1; obar = IR(*bp))\r\n\t    bp = &obar->prev;\r\n\t  /* Remove OBAR, too. */\r\n\t  *bp = obar->prev;\r\n\t  obar->o = IR_NOP;\r\n\t  obar->t.irt = IRT_NIL;\r\n\t  obar->op1 = obar->op2 = 0;\r\n\t  obar->prev = 0;\r\n\t}\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- FLOAD forwarding and FSTORE elimination ----------------------------- */\r\n\r\n/* Alias analysis for field access.\r\n** Field loads are cheap and field stores are rare.\r\n** Simple disambiguation based on field types is good enough.\r\n*/\r\nstatic AliasRet aa_fref(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  if (refa->op2 != refb->op2)\r\n    return ALIAS_NO;  /* Different fields. */\r\n  if (refa->op1 == refb->op1)\r\n    return ALIAS_MUST;  /* Same field, same object. */\r\n  else if (refa->op2 >= IRFL_TAB_META && refa->op2 <= IRFL_TAB_NOMM)\r\n    return aa_table(J, refa->op1, refb->op1);  /* Disambiguate tables. */\r\n  else\r\n    return ALIAS_MAY;  /* Same field, possibly different object. */\r\n}\r\n\r\n/* Only the loads for mutable fields end up here (see FOLD). */\r\nTRef LJ_FASTCALL lj_opt_fwd_fload(jit_State *J)\r\n{\r\n  IRRef oref = fins->op1;  /* Object reference. */\r\n  IRRef fid = fins->op2;  /* Field ID. */\r\n  IRRef lim = oref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_FSTORE];\r\n  while (ref > oref) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_fref(J, fins, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* No conflicting store: const-fold field loads from allocations. */\r\n  if (fid == IRFL_TAB_META) {\r\n    IRIns *ir = IR(oref);\r\n    if (ir->o == IR_TNEW || ir->o == IR_TDUP)\r\n      return lj_ir_knull(J, IRT_TAB);\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  return lj_opt_cselim(J, lim);\r\n}\r\n\r\n/* FSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_fstore(jit_State *J)\r\n{\r\n  IRRef fref = fins->op1;  /* FREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(fref);\r\n  IRRef1 *refp = &J->chain[IR_FSTORE];\r\n  IRRef ref = *refp;\r\n  while (ref > fref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_fref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards or conflicting loads. */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || (ir->o == IR_FLOAD && ir->op2 == xr->op2))\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- XLOAD forwarding and XSTORE elimination ----------------------------- */\r\n\r\n/* Find cdata allocation for a reference (if any). */\r\nstatic IRIns *aa_findcnew(jit_State *J, IRIns *ir)\r\n{\r\n  while (ir->o == IR_ADD) {\r\n    if (!irref_isk(ir->op1)) {\r\n      IRIns *ir1 = aa_findcnew(J, IR(ir->op1));  /* Left-recursion. */\r\n      if (ir1) return ir1;\r\n    }\r\n    if (irref_isk(ir->op2)) return NULL;\r\n    ir = IR(ir->op2);  /* Flatten right-recursion. */\r\n  }\r\n  return ir->o == IR_CNEW ? ir : NULL;\r\n}\r\n\r\n/* Alias analysis for two cdata allocations. */\r\nstatic AliasRet aa_cnew(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  IRIns *cnewa = aa_findcnew(J, refa);\r\n  IRIns *cnewb = aa_findcnew(J, refb);\r\n  if (cnewa == cnewb)\r\n    return ALIAS_MAY;  /* Same allocation or neither is an allocation. */\r\n  if (cnewa && cnewb)\r\n    return ALIAS_NO;  /* Two different allocations never alias. */\r\n  if (cnewb) { cnewa = cnewb; refb = refa; }\r\n  return aa_escape(J, cnewa, refb);\r\n}\r\n\r\n/* Alias analysis for XLOAD/XSTORE. */\r\nstatic AliasRet aa_xref(jit_State *J, IRIns *refa, IRIns *xa, IRIns *xb)\r\n{\r\n  ptrdiff_t ofsa = 0, ofsb = 0;\r\n  IRIns *refb = IR(xb->op1);\r\n  IRIns *basea = refa, *baseb = refb;\r\n  if (refa == refb && irt_sametype(xa->t, xb->t))\r\n    return ALIAS_MUST;  /* Shortcut for same refs with identical type. */\r\n  /* Offset-based disambiguation. */\r\n  if (refa->o == IR_ADD && irref_isk(refa->op2)) {\r\n    IRIns *irk = IR(refa->op2);\r\n    basea = IR(refa->op1);\r\n    ofsa = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t    (ptrdiff_t)irk->i;\r\n  }\r\n  if (refb->o == IR_ADD && irref_isk(refb->op2)) {\r\n    IRIns *irk = IR(refb->op2);\r\n    baseb = IR(refb->op1);\r\n    ofsb = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t    (ptrdiff_t)irk->i;\r\n  }\r\n  /* Treat constified pointers like base vs. base+offset. */\r\n  if (basea->o == IR_KPTR && baseb->o == IR_KPTR) {\r\n    ofsb += (char *)ir_kptr(baseb) - (char *)ir_kptr(basea);\r\n    baseb = basea;\r\n  }\r\n  /* This implements (very) strict aliasing rules.\r\n  ** Different types do NOT alias, except for differences in signedness.\r\n  ** Type punning through unions is allowed (but forces a reload).\r\n  */\r\n  if (basea == baseb) {\r\n    ptrdiff_t sza = irt_size(xa->t), szb = irt_size(xb->t);\r\n    if (ofsa == ofsb) {\r\n      if (sza == szb && irt_isfp(xa->t) == irt_isfp(xb->t))\r\n\treturn ALIAS_MUST;  /* Same-sized, same-kind. May need to convert. */\r\n    } else if (ofsa + sza <= ofsb || ofsb + szb <= ofsa) {\r\n      return ALIAS_NO;  /* Non-overlapping base+-o1 vs. base+-o2. */\r\n    }\r\n    /* NYI: extract, extend or reinterpret bits (int <-> fp). */\r\n    return ALIAS_MAY;  /* Overlapping or type punning: force reload. */\r\n  }\r\n  if (!irt_sametype(xa->t, xb->t) &&\r\n      !(irt_typerange(xa->t, IRT_I8, IRT_U64) &&\r\n\t((xa->t.irt - IRT_I8) ^ (xb->t.irt - IRT_I8)) == 1))\r\n    return ALIAS_NO;\r\n  /* NYI: structural disambiguation. */\r\n  return aa_cnew(J, basea, baseb);  /* Try to disambiguate allocations. */\r\n}\r\n\r\n/* Return CSEd reference or 0. Caveat: swaps lower ref to the right! */\r\nstatic IRRef reassoc_trycse(jit_State *J, IROp op, IRRef op1, IRRef op2)\r\n{\r\n  IRRef ref = J->chain[op];\r\n  IRRef lim = op1;\r\n  if (op2 > lim) { lim = op2; op2 = op1; op1 = lim; }\r\n  while (ref > lim) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->op1 == op1 && ir->op2 == op2)\r\n      return ref;\r\n    ref = ir->prev;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Reassociate index references. */\r\nstatic IRRef reassoc_xref(jit_State *J, IRIns *ir)\r\n{\r\n  ptrdiff_t ofs = 0;\r\n  if (ir->o == IR_ADD && irref_isk(ir->op2)) {  /* Get constant offset. */\r\n    IRIns *irk = IR(ir->op2);\r\n    ofs = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t   (ptrdiff_t)irk->i;\r\n    ir = IR(ir->op1);\r\n  }\r\n  if (ir->o == IR_ADD) {  /* Add of base + index. */\r\n    /* Index ref > base ref for loop-carried dependences. Only check op1. */\r\n    IRIns *ir2, *ir1 = IR(ir->op1);\r\n    int32_t shift = 0;\r\n    IRRef idxref;\r\n    /* Determine index shifts. Don't bother with IR_MUL here. */\r\n    if (ir1->o == IR_BSHL && irref_isk(ir1->op2))\r\n      shift = IR(ir1->op2)->i;\r\n    else if (ir1->o == IR_ADD && ir1->op1 == ir1->op2)\r\n      shift = 1;\r\n    else\r\n      ir1 = ir;\r\n    ir2 = IR(ir1->op1);\r\n    /* A non-reassociated add. Must be a loop-carried dependence. */\r\n    if (ir2->o == IR_ADD && irt_isint(ir2->t) && irref_isk(ir2->op2))\r\n      ofs += (ptrdiff_t)IR(ir2->op2)->i << shift;\r\n    else\r\n      return 0;\r\n    idxref = ir2->op1;\r\n    /* Try to CSE the reassociated chain. Give up if not found. */\r\n    if (ir1 != ir &&\r\n\t!(idxref = reassoc_trycse(J, ir1->o, idxref,\r\n\t\t\t\t  ir1->o == IR_BSHL ? ir1->op2 : idxref)))\r\n      return 0;\r\n    if (!(idxref = reassoc_trycse(J, IR_ADD, idxref, ir->op2)))\r\n      return 0;\r\n    if (ofs != 0) {\r\n      IRRef refk = tref_ref(lj_ir_kintp(J, ofs));\r\n      if (!(idxref = reassoc_trycse(J, IR_ADD, idxref, refk)))\r\n\treturn 0;\r\n    }\r\n    return idxref;  /* Success, found a reassociated index reference. Phew. */\r\n  }\r\n  return 0;  /* Failure. */\r\n}\r\n\r\n/* XLOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_xload(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  if ((fins->op2 & IRXLOAD_READONLY))\r\n    goto cselim;\r\n  if ((fins->op2 & IRXLOAD_VOLATILE))\r\n    goto doemit;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_XSTORE];\r\nretry:\r\n  if (J->chain[IR_CALLXS] > lim) lim = J->chain[IR_CALLXS];\r\n  if (J->chain[IR_XBAR] > lim) lim = J->chain[IR_XBAR];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_xref(J, xr, fins, store)) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST:\r\n      /* Emit conversion if the loaded type doesn't match the forwarded type. */\r\n      if (!irt_sametype(fins->t, IR(store->op2)->t)) {\r\n\tIRType dt = irt_type(fins->t), st = irt_type(IR(store->op2)->t);\r\n\tif (dt == IRT_I8 || dt == IRT_I16) {  /* Trunc + sign-extend. */\r\n\t  st = dt | IRCONV_SEXT;\r\n\t  dt = IRT_INT;\r\n\t} else if (dt == IRT_U8 || dt == IRT_U16) {  /* Trunc + zero-extend. */\r\n\t  st = dt;\r\n\t  dt = IRT_INT;\r\n\t}\r\n\tfins->ot = IRT(IR_CONV, dt);\r\n\tfins->op1 = store->op2;\r\n\tfins->op2 = (dt<<5)|st;\r\n\treturn RETRYFOLD;\r\n      }\r\n      return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  ref = J->chain[IR_XLOAD];\r\n  while (ref > lim) {\r\n    /* CSE for XLOAD depends on the type, but not on the IRXLOAD_* flags. */\r\n    if (IR(ref)->op1 == xref && irt_sametype(IR(ref)->t, fins->t))\r\n      return ref;\r\n    ref = IR(ref)->prev;\r\n  }\r\n\r\n  /* Reassociate XLOAD across PHIs to handle a[i-1] forwarding case. */\r\n  if (!(fins->op2 & IRXLOAD_READONLY) && J->chain[IR_LOOP] &&\r\n      xref == fins->op1 && (xref = reassoc_xref(J, xr)) != 0) {\r\n    ref = J->chain[IR_XSTORE];\r\n    while (ref > lim)  /* Skip stores that have already been checked. */\r\n      ref = IR(ref)->prev;\r\n    lim = xref;\r\n    xr = IR(xref);\r\n    goto retry;  /* Retry with the reassociated reference. */\r\n  }\r\ndoemit:\r\n  return EMITFOLD;\r\n}\r\n\r\n/* XSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_xstore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRRef1 *refp = &J->chain[IR_XSTORE];\r\n  IRRef ref = *refp;\r\n  if (J->chain[IR_CALLXS] > lim) lim = J->chain[IR_CALLXS];\r\n  if (J->chain[IR_XBAR] > lim) lim = J->chain[IR_XBAR];\r\n  if (J->chain[IR_XSNEW] > lim) lim = J->chain[IR_XSNEW];\r\n  while (ref > lim) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_xref(J, xr, fins, store)) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards or any XLOADs (no AA performed). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || ir->o == IR_XLOAD)\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- Forwarding of lj_tab_len -------------------------------------------- */\r\n\r\n/* This is rather simplistic right now, but better than nothing. */\r\nTRef LJ_FASTCALL lj_opt_fwd_tab_len(jit_State *J)\r\n{\r\n  IRRef tab = fins->op1;  /* Table reference. */\r\n  IRRef lim = tab;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Any ASTORE is a conflict and limits the search. */\r\n  if (J->chain[IR_ASTORE] > lim) lim = J->chain[IR_ASTORE];\r\n\r\n  /* Search for conflicting HSTORE with numeric key. */\r\n  ref = J->chain[IR_HSTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    IRIns *href = IR(store->op1);\r\n    IRIns *key = IR(href->op2);\r\n    if (irt_isnum(key->o == IR_KSLOT ? IR(key->op1)->t : key->t)) {\r\n      lim = ref;  /* Conflicting store found, limits search for TLEN. */\r\n      break;\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  return lj_opt_cselim(J, lim);\r\n}\r\n\r\n/* -- ASTORE/HSTORE previous type analysis -------------------------------- */\r\n\r\n/* Check whether the previous value for a table store is non-nil.\r\n** This can be derived either from a previous store or from a previous\r\n** load (because all loads from tables perform a type check).\r\n**\r\n** The result of the analysis can be used to avoid the metatable check\r\n** and the guard against HREF returning niltv. Both of these are cheap,\r\n** so let's not spend too much effort on the analysis.\r\n**\r\n** A result of 1 is exact: previous value CANNOT be nil.\r\n** A result of 0 is inexact: previous value MAY be nil.\r\n*/\r\nint lj_opt_fwd_wasnonnil(jit_State *J, IROpT loadop, IRRef xref)\r\n{\r\n  /* First check stores. */\r\n  IRRef ref = J->chain[loadop+IRDELTA_L2S];\r\n  while (ref > xref) {\r\n    IRIns *store = IR(ref);\r\n    if (store->op1 == xref) {  /* Same xREF. */\r\n      /* A nil store MAY alias, but a non-nil store MUST alias. */\r\n      return !irt_isnil(store->t);\r\n    } else if (irt_isnil(store->t)) {  /* Must check any nil store. */\r\n      IRRef skref = IR(store->op1)->op2;\r\n      IRRef xkref = IR(xref)->op2;\r\n      /* Same key type MAY alias. Need ALOAD check due to multiple int types. */\r\n      if (loadop == IR_ALOAD || irt_sametype(IR(skref)->t, IR(xkref)->t)) {\r\n\tif (skref == xkref || !irref_isk(skref) || !irref_isk(xkref))\r\n\t  return 0;  /* A nil store with same const key or var key MAY alias. */\r\n\t/* Different const keys CANNOT alias. */\r\n      }  /* Different key types CANNOT alias. */\r\n    }  /* Other non-nil stores MAY alias. */\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* Check loads since nothing could be derived from stores. */\r\n  ref = J->chain[loadop];\r\n  while (ref > xref) {\r\n    IRIns *load = IR(ref);\r\n    if (load->op1 == xref) {  /* Same xREF. */\r\n      /* A nil load MAY alias, but a non-nil load MUST alias. */\r\n      return !irt_isnil(load->t);\r\n    }  /* Other non-nil loads MAY alias. */\r\n    ref = load->prev;\r\n  }\r\n  return 0;  /* Nothing derived at all, previous value MAY be nil. */\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#undef IR\r\n#undef fins\r\n#undef fleft\r\n#undef fright\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_narrow.c",
    "content": "/*\r\n** NARROW: Narrowing of numbers to integers (double to int32_t).\r\n** STRIPOV: Stripping of overflow checks.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_narrow_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* Rationale for narrowing optimizations:\r\n**\r\n** Lua has only a single number type and this is a FP double by default.\r\n** Narrowing doubles to integers does not pay off for the interpreter on a\r\n** current-generation x86/x64 machine. Most FP operations need the same\r\n** amount of execution resources as their integer counterparts, except\r\n** with slightly longer latencies. Longer latencies are a non-issue for\r\n** the interpreter, since they are usually hidden by other overhead.\r\n**\r\n** The total CPU execution bandwidth is the sum of the bandwidth of the FP\r\n** and the integer units, because they execute in parallel. The FP units\r\n** have an equal or higher bandwidth than the integer units. Not using\r\n** them means losing execution bandwidth. Moving work away from them to\r\n** the already quite busy integer units is a losing proposition.\r\n**\r\n** The situation for JIT-compiled code is a bit different: the higher code\r\n** density makes the extra latencies much more visible. Tight loops expose\r\n** the latencies for updating the induction variables. Array indexing\r\n** requires narrowing conversions with high latencies and additional\r\n** guards (to check that the index is really an integer). And many common\r\n** optimizations only work on integers.\r\n**\r\n** One solution would be speculative, eager narrowing of all number loads.\r\n** This causes many problems, like losing -0 or the need to resolve type\r\n** mismatches between traces. It also effectively forces the integer type\r\n** to have overflow-checking semantics. This impedes many basic\r\n** optimizations and requires adding overflow checks to all integer\r\n** arithmetic operations (whereas FP arithmetics can do without).\r\n**\r\n** Always replacing an FP op with an integer op plus an overflow check is\r\n** counter-productive on a current-generation super-scalar CPU. Although\r\n** the overflow check branches are highly predictable, they will clog the\r\n** execution port for the branch unit and tie up reorder buffers. This is\r\n** turning a pure data-flow dependency into a different data-flow\r\n** dependency (with slightly lower latency) *plus* a control dependency.\r\n** In general, you don't want to do this since latencies due to data-flow\r\n** dependencies can be well hidden by out-of-order execution.\r\n**\r\n** A better solution is to keep all numbers as FP values and only narrow\r\n** when it's beneficial to do so. LuaJIT uses predictive narrowing for\r\n** induction variables and demand-driven narrowing for index expressions,\r\n** integer arguments and bit operations. Additionally it can eliminate or\r\n** hoist most of the resulting overflow checks. Regular arithmetic\r\n** computations are never narrowed to integers.\r\n**\r\n** The integer type in the IR has convenient wrap-around semantics and\r\n** ignores overflow. Extra operations have been added for\r\n** overflow-checking arithmetic (ADDOV/SUBOV) instead of an extra type.\r\n** Apart from reducing overall complexity of the compiler, this also\r\n** nicely solves the problem where you want to apply algebraic\r\n** simplifications to ADD, but not to ADDOV. And the x86/x64 assembler can\r\n** use lea instead of an add for integer ADD, but not for ADDOV (lea does\r\n** not affect the flags, but it helps to avoid register moves).\r\n**\r\n**\r\n** All of the above has to be reconsidered for architectures with slow FP\r\n** operations or without a hardware FPU. The dual-number mode of LuaJIT\r\n** addresses this issue. Arithmetic operations are performed on integers\r\n** as far as possible and overflow checks are added as needed.\r\n**\r\n** This implies that narrowing for integer arguments and bit operations\r\n** should also strip overflow checks, e.g. replace ADDOV with ADD. The\r\n** original overflow guards are weak and can be eliminated by DCE, if\r\n** there's no other use.\r\n**\r\n** A slight twist is that it's usually beneficial to use overflow-checked\r\n** integer arithmetics if all inputs are already integers. This is the only\r\n** change that affects the single-number mode, too.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t\t(&J->fold.ins)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Elimination of narrowing type conversions --------------------------- */\r\n\r\n/* Narrowing of index expressions and bit operations is demand-driven. The\r\n** trace recorder emits a narrowing type conversion (CONV.int.num or TOBIT)\r\n** in all of these cases (e.g. array indexing or string indexing). FOLD\r\n** already takes care of eliminating simple redundant conversions like\r\n** CONV.int.num(CONV.num.int(x)) ==> x.\r\n**\r\n** But the surrounding code is FP-heavy and arithmetic operations are\r\n** performed on FP numbers (for the single-number mode). Consider a common\r\n** example such as 'x=t[i+1]', with 'i' already an integer (due to induction\r\n** variable narrowing). The index expression would be recorded as\r\n**   CONV.int.num(ADD(CONV.num.int(i), 1))\r\n** which is clearly suboptimal.\r\n**\r\n** One can do better by recursively backpropagating the narrowing type\r\n** conversion across FP arithmetic operations. This turns FP ops into\r\n** their corresponding integer counterparts. Depending on the semantics of\r\n** the conversion they also need to check for overflow. Currently only ADD\r\n** and SUB are supported.\r\n**\r\n** The above example can be rewritten as\r\n**   ADDOV(CONV.int.num(CONV.num.int(i)), 1)\r\n** and then into ADDOV(i, 1) after folding of the conversions. The original\r\n** FP ops remain in the IR and are eliminated by DCE since all references to\r\n** them are gone.\r\n**\r\n** [In dual-number mode the trace recorder already emits ADDOV etc., but\r\n** this can be further reduced. See below.]\r\n**\r\n** Special care has to be taken to avoid narrowing across an operation\r\n** which is potentially operating on non-integral operands. One obvious\r\n** case is when an expression contains a non-integral constant, but ends\r\n** up as an integer index at runtime (like t[x+1.5] with x=0.5).\r\n**\r\n** Operations with two non-constant operands illustrate a similar problem\r\n** (like t[a+b] with a=1.5 and b=2.5). Backpropagation has to stop there,\r\n** unless it can be proven that either operand is integral (e.g. by CSEing\r\n** a previous conversion). As a not-so-obvious corollary this logic also\r\n** applies for a whole expression tree (e.g. t[(a+1)+(b+1)]).\r\n**\r\n** Correctness of the transformation is guaranteed by avoiding to expand\r\n** the tree by adding more conversions than the one we would need to emit\r\n** if not backpropagating. TOBIT employs a more optimistic rule, because\r\n** the conversion has special semantics, designed to make the life of the\r\n** compiler writer easier. ;-)\r\n**\r\n** Using on-the-fly backpropagation of an expression tree doesn't work\r\n** because it's unknown whether the transform is correct until the end.\r\n** This either requires IR rollback and cache invalidation for every\r\n** subtree or a two-pass algorithm. The former didn't work out too well,\r\n** so the code now combines a recursive collector with a stack-based\r\n** emitter.\r\n**\r\n** [A recursive backpropagation algorithm with backtracking, employing\r\n** skip-list lookup and round-robin caching, emitting stack operations\r\n** on-the-fly for a stack-based interpreter -- and all of that in a meager\r\n** kilobyte? Yep, compilers are a great treasure chest. Throw away your\r\n** textbooks and read the codebase of a compiler today!]\r\n**\r\n** There's another optimization opportunity for array indexing: it's\r\n** always accompanied by an array bounds-check. The outermost overflow\r\n** check may be delegated to the ABC operation. This works because ABC is\r\n** an unsigned comparison and wrap-around due to overflow creates negative\r\n** numbers.\r\n**\r\n** But this optimization is only valid for constants that cannot overflow\r\n** an int32_t into the range of valid array indexes [0..2^27+1). A check\r\n** for +-2^30 is safe since -2^31 - 2^30 wraps to 2^30 and 2^31-1 + 2^30\r\n** wraps to -2^30-1.\r\n**\r\n** It's also good enough in practice, since e.g. t[i+1] or t[i-10] are\r\n** quite common. So the above example finally ends up as ADD(i, 1)!\r\n**\r\n** Later on, the assembler is able to fuse the whole array reference and\r\n** the ADD into the memory operands of loads and other instructions. This\r\n** is why LuaJIT is able to generate very pretty (and fast) machine code\r\n** for array indexing. And that, my dear, concludes another story about\r\n** one of the hidden secrets of LuaJIT ...\r\n*/\r\n\r\n/* Maximum backpropagation depth and maximum stack size. */\r\n#define NARROW_MAX_BACKPROP\t100\r\n#define NARROW_MAX_STACK\t256\r\n\r\n/* The stack machine has a 32 bit instruction format: [IROpT | IRRef1]\r\n** The lower 16 bits hold a reference (or 0). The upper 16 bits hold\r\n** the IR opcode + type or one of the following special opcodes:\r\n*/\r\nenum {\r\n  NARROW_REF,\t\t/* Push ref. */\r\n  NARROW_CONV,\t\t/* Push conversion of ref. */\r\n  NARROW_SEXT,\t\t/* Push sign-extension of ref. */\r\n  NARROW_INT\t\t/* Push KINT ref. The next code holds an int32_t. */\r\n};\r\n\r\ntypedef uint32_t NarrowIns;\r\n\r\n#define NARROWINS(op, ref)\t(((op) << 16) + (ref))\r\n#define narrow_op(ins)\t\t((IROpT)((ins) >> 16))\r\n#define narrow_ref(ins)\t\t((IRRef1)(ins))\r\n\r\n/* Context used for narrowing of type conversions. */\r\ntypedef struct NarrowConv {\r\n  jit_State *J;\t\t/* JIT compiler state. */\r\n  NarrowIns *sp;\t/* Current stack pointer. */\r\n  NarrowIns *maxsp;\t/* Maximum stack pointer minus redzone. */\r\n  int lim;\t\t/* Limit on the number of emitted conversions. */\r\n  IRRef mode;\t\t/* Conversion mode (IRCONV_*). */\r\n  IRType t;\t\t/* Destination type: IRT_INT or IRT_I64. */\r\n  NarrowIns stack[NARROW_MAX_STACK];  /* Stack holding stack-machine code. */\r\n} NarrowConv;\r\n\r\n/* Lookup a reference in the backpropagation cache. */\r\nstatic BPropEntry *narrow_bpc_get(jit_State *J, IRRef1 key, IRRef mode)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < BPROP_SLOTS; i++) {\r\n    BPropEntry *bp = &J->bpropcache[i];\r\n    /* Stronger checks are ok, too. */\r\n    if (bp->key == key && bp->mode >= mode &&\r\n\t((bp->mode ^ mode) & IRCONV_MODEMASK) == 0)\r\n      return bp;\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Add an entry to the backpropagation cache. */\r\nstatic void narrow_bpc_set(jit_State *J, IRRef1 key, IRRef1 val, IRRef mode)\r\n{\r\n  uint32_t slot = J->bpropslot;\r\n  BPropEntry *bp = &J->bpropcache[slot];\r\n  J->bpropslot = (slot + 1) & (BPROP_SLOTS-1);\r\n  bp->key = key;\r\n  bp->val = val;\r\n  bp->mode = mode;\r\n}\r\n\r\n/* Backpropagate overflow stripping. */\r\nstatic void narrow_stripov_backprop(NarrowConv *nc, IRRef ref, int depth)\r\n{\r\n  jit_State *J = nc->J;\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_ADDOV || ir->o == IR_SUBOV ||\r\n      (ir->o == IR_MULOV && (nc->mode & IRCONV_CONVMASK) == IRCONV_ANY)) {\r\n    BPropEntry *bp = narrow_bpc_get(nc->J, ref, IRCONV_TOBIT);\r\n    if (bp) {\r\n      ref = bp->val;\r\n    } else if (++depth < NARROW_MAX_BACKPROP && nc->sp < nc->maxsp) {\r\n      NarrowIns *savesp = nc->sp;\r\n      narrow_stripov_backprop(nc, ir->op1, depth);\r\n      if (nc->sp < nc->maxsp) {\r\n\tnarrow_stripov_backprop(nc, ir->op2, depth);\r\n\tif (nc->sp < nc->maxsp) {\r\n\t  *nc->sp++ = NARROWINS(IRT(ir->o - IR_ADDOV + IR_ADD, IRT_INT), ref);\r\n\t  return;\r\n\t}\r\n      }\r\n      nc->sp = savesp;  /* Path too deep, need to backtrack. */\r\n    }\r\n  }\r\n  *nc->sp++ = NARROWINS(NARROW_REF, ref);\r\n}\r\n\r\n/* Backpropagate narrowing conversion. Return number of needed conversions. */\r\nstatic int narrow_conv_backprop(NarrowConv *nc, IRRef ref, int depth)\r\n{\r\n  jit_State *J = nc->J;\r\n  IRIns *ir = IR(ref);\r\n  IRRef cref;\r\n\r\n  if (nc->sp >= nc->maxsp) return 10;  /* Path too deep. */\r\n\r\n  /* Check the easy cases first. */\r\n  if (ir->o == IR_CONV && (ir->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    if ((nc->mode & IRCONV_CONVMASK) <= IRCONV_ANY)\r\n      narrow_stripov_backprop(nc, ir->op1, depth+1);\r\n    else\r\n      *nc->sp++ = NARROWINS(NARROW_REF, ir->op1);  /* Undo conversion. */\r\n    if (nc->t == IRT_I64)\r\n      *nc->sp++ = NARROWINS(NARROW_SEXT, 0);  /* Sign-extend integer. */\r\n    return 0;\r\n  } else if (ir->o == IR_KNUM) {  /* Narrow FP constant. */\r\n    lua_Number n = ir_knum(ir)->n;\r\n    if ((nc->mode & IRCONV_CONVMASK) == IRCONV_TOBIT) {\r\n      /* Allows a wider range of constants. */\r\n      int64_t k64 = (int64_t)n;\r\n      if (n == (lua_Number)k64) {  /* Only if const doesn't lose precision. */\r\n\t*nc->sp++ = NARROWINS(NARROW_INT, 0);\r\n\t*nc->sp++ = (NarrowIns)k64;  /* But always truncate to 32 bits. */\r\n\treturn 0;\r\n      }\r\n    } else {\r\n      int32_t k = lj_num2int(n);\r\n      /* Only if constant is a small integer. */\r\n      if (checki16(k) && n == (lua_Number)k) {\r\n\t*nc->sp++ = NARROWINS(NARROW_INT, 0);\r\n\t*nc->sp++ = (NarrowIns)k;\r\n\treturn 0;\r\n      }\r\n    }\r\n    return 10;  /* Never narrow other FP constants (this is rare). */\r\n  }\r\n\r\n  /* Try to CSE the conversion. Stronger checks are ok, too. */\r\n  cref = J->chain[fins->o];\r\n  while (cref > ref) {\r\n    IRIns *cr = IR(cref);\r\n    if (cr->op1 == ref &&\r\n\t(fins->o == IR_TOBIT ||\r\n\t ((cr->op2 & IRCONV_MODEMASK) == (nc->mode & IRCONV_MODEMASK) &&\r\n\t  irt_isguard(cr->t) >= irt_isguard(fins->t)))) {\r\n      *nc->sp++ = NARROWINS(NARROW_REF, cref);\r\n      return 0;  /* Already there, no additional conversion needed. */\r\n    }\r\n    cref = cr->prev;\r\n  }\r\n\r\n  /* Backpropagate across ADD/SUB. */\r\n  if (ir->o == IR_ADD || ir->o == IR_SUB) {\r\n    /* Try cache lookup first. */\r\n    IRRef mode = nc->mode;\r\n    BPropEntry *bp;\r\n    /* Inner conversions need a stronger check. */\r\n    if ((mode & IRCONV_CONVMASK) == IRCONV_INDEX && depth > 0)\r\n      mode += IRCONV_CHECK-IRCONV_INDEX;\r\n    bp = narrow_bpc_get(nc->J, (IRRef1)ref, mode);\r\n    if (bp) {\r\n      *nc->sp++ = NARROWINS(NARROW_REF, bp->val);\r\n      return 0;\r\n    } else if (nc->t == IRT_I64) {\r\n      /* Try sign-extending from an existing (checked) conversion to int. */\r\n      mode = (IRT_INT<<5)|IRT_NUM|IRCONV_INDEX;\r\n      bp = narrow_bpc_get(nc->J, (IRRef1)ref, mode);\r\n      if (bp) {\r\n\t*nc->sp++ = NARROWINS(NARROW_REF, bp->val);\r\n\t*nc->sp++ = NARROWINS(NARROW_SEXT, 0);\r\n\treturn 0;\r\n      }\r\n    }\r\n    if (++depth < NARROW_MAX_BACKPROP && nc->sp < nc->maxsp) {\r\n      NarrowIns *savesp = nc->sp;\r\n      int count = narrow_conv_backprop(nc, ir->op1, depth);\r\n      count += narrow_conv_backprop(nc, ir->op2, depth);\r\n      if (count <= nc->lim) {  /* Limit total number of conversions. */\r\n\t*nc->sp++ = NARROWINS(IRT(ir->o, nc->t), ref);\r\n\treturn count;\r\n      }\r\n      nc->sp = savesp;  /* Too many conversions, need to backtrack. */\r\n    }\r\n  }\r\n\r\n  /* Otherwise add a conversion. */\r\n  *nc->sp++ = NARROWINS(NARROW_CONV, ref);\r\n  return 1;\r\n}\r\n\r\n/* Emit the conversions collected during backpropagation. */\r\nstatic IRRef narrow_conv_emit(jit_State *J, NarrowConv *nc)\r\n{\r\n  /* The fins fields must be saved now -- emitir() overwrites them. */\r\n  IROpT guardot = irt_isguard(fins->t) ? IRTG(IR_ADDOV-IR_ADD, 0) : 0;\r\n  IROpT convot = fins->ot;\r\n  IRRef1 convop2 = fins->op2;\r\n  NarrowIns *next = nc->stack;  /* List of instructions from backpropagation. */\r\n  NarrowIns *last = nc->sp;\r\n  NarrowIns *sp = nc->stack;  /* Recycle the stack to store operands. */\r\n  while (next < last) {  /* Simple stack machine to process the ins. list. */\r\n    NarrowIns ref = *next++;\r\n    IROpT op = narrow_op(ref);\r\n    if (op == NARROW_REF) {\r\n      *sp++ = ref;\r\n    } else if (op == NARROW_CONV) {\r\n      *sp++ = emitir_raw(convot, ref, convop2);  /* Raw emit avoids a loop. */\r\n    } else if (op == NARROW_SEXT) {\r\n      lua_assert(sp >= nc->stack+1);\r\n      sp[-1] = emitir(IRT(IR_CONV, IRT_I64), sp[-1],\r\n\t\t      (IRT_I64<<5)|IRT_INT|IRCONV_SEXT);\r\n    } else if (op == NARROW_INT) {\r\n      lua_assert(next < last);\r\n      *sp++ = nc->t == IRT_I64 ?\r\n\t      lj_ir_kint64(J, (int64_t)(int32_t)*next++) :\r\n\t      lj_ir_kint(J, *next++);\r\n    } else {  /* Regular IROpT. Pops two operands and pushes one result. */\r\n      IRRef mode = nc->mode;\r\n      lua_assert(sp >= nc->stack+2);\r\n      sp--;\r\n      /* Omit some overflow checks for array indexing. See comments above. */\r\n      if ((mode & IRCONV_CONVMASK) == IRCONV_INDEX) {\r\n\tif (next == last && irref_isk(narrow_ref(sp[0])) &&\r\n\t  (uint32_t)IR(narrow_ref(sp[0]))->i + 0x40000000u < 0x80000000u)\r\n\t  guardot = 0;\r\n\telse  /* Otherwise cache a stronger check. */\r\n\t  mode += IRCONV_CHECK-IRCONV_INDEX;\r\n      }\r\n      sp[-1] = emitir(op+guardot, sp[-1], sp[0]);\r\n      /* Add to cache. */\r\n      if (narrow_ref(ref))\r\n\tnarrow_bpc_set(J, narrow_ref(ref), narrow_ref(sp[-1]), mode);\r\n    }\r\n  }\r\n  lua_assert(sp == nc->stack+1);\r\n  return nc->stack[0];\r\n}\r\n\r\n/* Narrow a type conversion of an arithmetic operation. */\r\nTRef LJ_FASTCALL lj_opt_narrow_convert(jit_State *J)\r\n{\r\n  if ((J->flags & JIT_F_OPT_NARROW)) {\r\n    NarrowConv nc;\r\n    nc.J = J;\r\n    nc.sp = nc.stack;\r\n    nc.maxsp = &nc.stack[NARROW_MAX_STACK-4];\r\n    nc.t = irt_type(fins->t);\r\n    if (fins->o == IR_TOBIT) {\r\n      nc.mode = IRCONV_TOBIT;  /* Used only in the backpropagation cache. */\r\n      nc.lim = 2;  /* TOBIT can use a more optimistic rule. */\r\n    } else {\r\n      nc.mode = fins->op2;\r\n      nc.lim = 1;\r\n    }\r\n    if (narrow_conv_backprop(&nc, fins->op1, 0) <= nc.lim)\r\n      return narrow_conv_emit(J, &nc);\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Narrowing of implicit conversions ----------------------------------- */\r\n\r\n/* Recursively strip overflow checks. */\r\nstatic TRef narrow_stripov(jit_State *J, TRef tr, int lastop, IRRef mode)\r\n{\r\n  IRRef ref = tref_ref(tr);\r\n  IRIns *ir = IR(ref);\r\n  int op = ir->o;\r\n  if (op >= IR_ADDOV && op <= lastop) {\r\n    BPropEntry *bp = narrow_bpc_get(J, ref, mode);\r\n    if (bp) {\r\n      return TREF(bp->val, irt_t(IR(bp->val)->t));\r\n    } else {\r\n      IRRef op1 = ir->op1, op2 = ir->op2;  /* The IR may be reallocated. */\r\n      op1 = narrow_stripov(J, op1, lastop, mode);\r\n      op2 = narrow_stripov(J, op2, lastop, mode);\r\n      tr = emitir(IRT(op - IR_ADDOV + IR_ADD,\r\n\t\t      ((mode & IRCONV_DSTMASK) >> IRCONV_DSH)), op1, op2);\r\n      narrow_bpc_set(J, ref, tref_ref(tr), mode);\r\n    }\r\n  } else if (LJ_64 && (mode & IRCONV_SEXT) && !irt_is64(ir->t)) {\r\n    tr = emitir(IRT(IR_CONV, IRT_INTP), tr, mode);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Narrow array index. */\r\nTRef LJ_FASTCALL lj_opt_narrow_index(jit_State *J, TRef tr)\r\n{\r\n  IRIns *ir;\r\n  lua_assert(tref_isnumber(tr));\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTGI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_INDEX);\r\n  /* Omit some overflow checks for array indexing. See comments above. */\r\n  ir = IR(tref_ref(tr));\r\n  if ((ir->o == IR_ADDOV || ir->o == IR_SUBOV) && irref_isk(ir->op2) &&\r\n      (uint32_t)IR(ir->op2)->i + 0x40000000u < 0x80000000u)\r\n    return emitir(IRTI(ir->o - IR_ADDOV + IR_ADD), ir->op1, ir->op2);\r\n  return tr;\r\n}\r\n\r\n/* Narrow conversion to integer operand (overflow undefined). */\r\nTRef LJ_FASTCALL lj_opt_narrow_toint(jit_State *J, TRef tr)\r\n{\r\n  if (tref_isstr(tr))\r\n    tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_ANY);\r\n  if (!tref_isinteger(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /*\r\n  ** Undefined overflow semantics allow stripping of ADDOV, SUBOV and MULOV.\r\n  ** Use IRCONV_TOBIT for the cache entries, since the semantics are the same.\r\n  */\r\n  return narrow_stripov(J, tr, IR_MULOV, (IRT_INT<<5)|IRT_INT|IRCONV_TOBIT);\r\n}\r\n\r\n/* Narrow conversion to bitop operand (overflow wrapped). */\r\nTRef LJ_FASTCALL lj_opt_narrow_tobit(jit_State *J, TRef tr)\r\n{\r\n  if (tref_isstr(tr))\r\n    tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTI(IR_TOBIT), tr, lj_ir_knum_tobit(J));\r\n  if (!tref_isinteger(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /*\r\n  ** Wrapped overflow semantics allow stripping of ADDOV and SUBOV.\r\n  ** MULOV cannot be stripped due to precision widening.\r\n  */\r\n  return narrow_stripov(J, tr, IR_SUBOV, (IRT_INT<<5)|IRT_INT|IRCONV_TOBIT);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Narrow C array index (overflow undefined). */\r\nTRef LJ_FASTCALL lj_opt_narrow_cindex(jit_State *J, TRef tr)\r\n{\r\n  lua_assert(tref_isnumber(tr));\r\n  if (tref_isnum(tr))\r\n    return emitir(IRT(IR_CONV, IRT_INTP), tr,\r\n\t\t  (IRT_INTP<<5)|IRT_NUM|IRCONV_TRUNC|IRCONV_ANY);\r\n  /* Undefined overflow semantics allow stripping of ADDOV, SUBOV and MULOV. */\r\n  return narrow_stripov(J, tr, IR_MULOV,\r\n\t\t\tLJ_64 ? ((IRT_INTP<<5)|IRT_INT|IRCONV_SEXT) :\r\n\t\t\t\t((IRT_INTP<<5)|IRT_INT|IRCONV_TOBIT));\r\n}\r\n#endif\r\n\r\n/* -- Narrowing of arithmetic operators ----------------------------------- */\r\n\r\n/* Check whether a number fits into an int32_t (-0 is ok, too). */\r\nstatic int numisint(lua_Number n)\r\n{\r\n  return (n == (lua_Number)lj_num2int(n));\r\n}\r\n\r\n/* Narrowing of arithmetic operations. */\r\nTRef lj_opt_narrow_arith(jit_State *J, TRef rb, TRef rc,\r\n\t\t\t TValue *vb, TValue *vc, IROp op)\r\n{\r\n  if (tref_isstr(rb)) {\r\n    rb = emitir(IRTG(IR_STRTO, IRT_NUM), rb, 0);\r\n    lj_strscan_num(strV(vb), vb);\r\n  }\r\n  if (tref_isstr(rc)) {\r\n    rc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n    lj_strscan_num(strV(vc), vc);\r\n  }\r\n  /* Must not narrow MUL in non-DUALNUM variant, because it loses -0. */\r\n  if ((op >= IR_ADD && op <= (LJ_DUALNUM ? IR_MUL : IR_SUB)) &&\r\n      tref_isinteger(rb) && tref_isinteger(rc) &&\r\n      numisint(lj_vm_foldarith(numberVnum(vb), numberVnum(vc),\r\n\t\t\t       (int)op - (int)IR_ADD)))\r\n    return emitir(IRTGI((int)op - (int)IR_ADD + (int)IR_ADDOV), rb, rc);\r\n  if (!tref_isnum(rb)) rb = emitir(IRTN(IR_CONV), rb, IRCONV_NUM_INT);\r\n  if (!tref_isnum(rc)) rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n  return emitir(IRTN(op), rb, rc);\r\n}\r\n\r\n/* Narrowing of unary minus operator. */\r\nTRef lj_opt_narrow_unm(jit_State *J, TRef rc, TValue *vc)\r\n{\r\n  if (tref_isstr(rc)) {\r\n    rc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n    lj_strscan_num(strV(vc), vc);\r\n  }\r\n  if (tref_isinteger(rc)) {\r\n    if ((uint32_t)numberVint(vc) != 0x80000000u)\r\n      return emitir(IRTGI(IR_SUBOV), lj_ir_kint(J, 0), rc);\r\n    rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n  }\r\n  return emitir(IRTN(IR_NEG), rc, lj_ir_knum_neg(J));\r\n}\r\n\r\n/* Narrowing of modulo operator. */\r\nTRef lj_opt_narrow_mod(jit_State *J, TRef rb, TRef rc, TValue *vc)\r\n{\r\n  TRef tmp;\r\n  if (tvisstr(vc) && !lj_strscan_num(strV(vc), vc))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  if ((LJ_DUALNUM || (J->flags & JIT_F_OPT_NARROW)) &&\r\n      tref_isinteger(rb) && tref_isinteger(rc) &&\r\n      (tvisint(vc) ? intV(vc) != 0 : !tviszero(vc))) {\r\n    emitir(IRTGI(IR_NE), rc, lj_ir_kint(J, 0));\r\n    return emitir(IRTI(IR_MOD), rb, rc);\r\n  }\r\n  /* b % c ==> b - floor(b/c)*c */\r\n  rb = lj_ir_tonum(J, rb);\r\n  rc = lj_ir_tonum(J, rc);\r\n  tmp = emitir(IRTN(IR_DIV), rb, rc);\r\n  tmp = emitir(IRTN(IR_FPMATH), tmp, IRFPM_FLOOR);\r\n  tmp = emitir(IRTN(IR_MUL), tmp, rc);\r\n  return emitir(IRTN(IR_SUB), rb, tmp);\r\n}\r\n\r\n/* Narrowing of power operator or math.pow. */\r\nTRef lj_opt_narrow_pow(jit_State *J, TRef rb, TRef rc, TValue *vc)\r\n{\r\n  if (tvisstr(vc) && !lj_strscan_num(strV(vc), vc))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /* Narrowing must be unconditional to preserve (-x)^i semantics. */\r\n  if (tvisint(vc) || numisint(numV(vc))) {\r\n    int checkrange = 0;\r\n    /* Split pow is faster for bigger exponents. But do this only for (+k)^i. */\r\n    if (tref_isk(rb) && (int32_t)ir_knum(IR(tref_ref(rb)))->u32.hi >= 0) {\r\n      int32_t k = numberVint(vc);\r\n      if (!(k >= -65536 && k <= 65536)) goto split_pow;\r\n      checkrange = 1;\r\n    }\r\n    if (!tref_isinteger(rc)) {\r\n      if (tref_isstr(rc))\r\n\trc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n      /* Guarded conversion to integer! */\r\n      rc = emitir(IRTGI(IR_CONV), rc, IRCONV_INT_NUM|IRCONV_CHECK);\r\n    }\r\n    if (checkrange && !tref_isk(rc)) {  /* Range guard: -65536 <= i <= 65536 */\r\n      TRef tmp = emitir(IRTI(IR_ADD), rc, lj_ir_kint(J, 65536));\r\n      emitir(IRTGI(IR_ULE), tmp, lj_ir_kint(J, 2*65536));\r\n    }\r\n    return emitir(IRTN(IR_POW), rb, rc);\r\n  }\r\nsplit_pow:\r\n  /* FOLD covers most cases, but some are easier to do here. */\r\n  if (tref_isk(rb) && tvispone(ir_knum(IR(tref_ref(rb)))))\r\n    return rb;  /* 1 ^ x ==> 1 */\r\n  rc = lj_ir_tonum(J, rc);\r\n  if (tref_isk(rc) && ir_knum(IR(tref_ref(rc)))->n == 0.5)\r\n    return emitir(IRTN(IR_FPMATH), rb, IRFPM_SQRT);  /* x ^ 0.5 ==> sqrt(x) */\r\n  /* Split up b^c into exp2(c*log2(b)). Assembler may rejoin later. */\r\n  rb = emitir(IRTN(IR_FPMATH), rb, IRFPM_LOG2);\r\n  rc = emitir(IRTN(IR_MUL), rb, rc);\r\n  return emitir(IRTN(IR_FPMATH), rc, IRFPM_EXP2);\r\n}\r\n\r\n/* -- Predictive narrowing of induction variables ------------------------- */\r\n\r\n/* Narrow a single runtime value. */\r\nstatic int narrow_forl(jit_State *J, cTValue *o)\r\n{\r\n  if (tvisint(o)) return 1;\r\n  if (LJ_DUALNUM || (J->flags & JIT_F_OPT_NARROW)) return numisint(numV(o));\r\n  return 0;\r\n}\r\n\r\n/* Narrow the FORL index type by looking at the runtime values. */\r\nIRType lj_opt_narrow_forl(jit_State *J, cTValue *tv)\r\n{\r\n  lua_assert(tvisnumber(&tv[FORL_IDX]) &&\r\n\t     tvisnumber(&tv[FORL_STOP]) &&\r\n\t     tvisnumber(&tv[FORL_STEP]));\r\n  /* Narrow only if the runtime values of start/stop/step are all integers. */\r\n  if (narrow_forl(J, &tv[FORL_IDX]) &&\r\n      narrow_forl(J, &tv[FORL_STOP]) &&\r\n      narrow_forl(J, &tv[FORL_STEP])) {\r\n    /* And if the loop index can't possibly overflow. */\r\n    lua_Number step = numberVnum(&tv[FORL_STEP]);\r\n    lua_Number sum = numberVnum(&tv[FORL_STOP]) + step;\r\n    if (0 <= step ? (sum <= 2147483647.0) : (sum >= -2147483648.0))\r\n      return IRT_INT;\r\n  }\r\n  return IRT_NUM;\r\n}\r\n\r\n#undef IR\r\n#undef fins\r\n#undef emitir\r\n#undef emitir_raw\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_sink.c",
    "content": "/*\r\n** SINK: Allocation Sinking and Store Sinking.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_sink_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_target.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Check whether the store ref points to an eligible allocation. */\r\nstatic IRIns *sink_checkalloc(jit_State *J, IRIns *irs)\r\n{\r\n  IRIns *ir = IR(irs->op1);\r\n  if (!irref_isk(ir->op2))\r\n    return NULL;  /* Non-constant key. */\r\n  if (ir->o == IR_HREFK || ir->o == IR_AREF)\r\n    ir = IR(ir->op1);\r\n  else if (!(ir->o == IR_HREF || ir->o == IR_NEWREF ||\r\n\t     ir->o == IR_FREF || ir->o == IR_ADD))\r\n    return NULL;  /* Unhandled reference type (for XSTORE). */\r\n  ir = IR(ir->op1);\r\n  if (!(ir->o == IR_TNEW || ir->o == IR_TDUP || ir->o == IR_CNEW))\r\n    return NULL;  /* Not an allocation. */\r\n  return ir;  /* Return allocation. */\r\n}\r\n\r\n/* Recursively check whether a value depends on a PHI. */\r\nstatic int sink_phidep(jit_State *J, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isphi(ir->t)) return 1;\r\n  if (ir->op1 >= REF_FIRST && sink_phidep(J, ir->op1)) return 1;\r\n  if (ir->op2 >= REF_FIRST && sink_phidep(J, ir->op2)) return 1;\r\n  return 0;\r\n}\r\n\r\n/* Check whether a value is a sinkable PHI or loop-invariant. */\r\nstatic int sink_checkphi(jit_State *J, IRIns *ira, IRRef ref)\r\n{\r\n  if (ref >= REF_FIRST) {\r\n    IRIns *ir = IR(ref);\r\n    if (irt_isphi(ir->t) || (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT &&\r\n\t\t\t     irt_isphi(IR(ir->op1)->t))) {\r\n      ira->prev++;\r\n      return 1;  /* Sinkable PHI. */\r\n    }\r\n    /* Otherwise the value must be loop-invariant. */\r\n    return ref < J->loopref && !sink_phidep(J, ref);\r\n  }\r\n  return 1;  /* Constant (non-PHI). */\r\n}\r\n\r\n/* Mark non-sinkable allocations using single-pass backward propagation.\r\n**\r\n** Roots for the marking process are:\r\n** - Some PHIs or snapshots (see below).\r\n** - Non-PHI, non-constant values stored to PHI allocations.\r\n** - All guards.\r\n** - Any remaining loads not eliminated by store-to-load forwarding.\r\n** - Stores with non-constant keys.\r\n** - All stored values.\r\n*/\r\nstatic void sink_mark_ins(jit_State *J)\r\n{\r\n  IRIns *ir, *irlast = IR(J->cur.nins-1);\r\n  for (ir = irlast ; ; ir--) {\r\n    switch (ir->o) {\r\n    case IR_BASE:\r\n      return;  /* Finished. */\r\n    case IR_CALLL:  /* IRCALL_lj_tab_len */\r\n    case IR_ALOAD: case IR_HLOAD: case IR_XLOAD: case IR_TBAR:\r\n      irt_setmark(IR(ir->op1)->t);  /* Mark ref for remaining loads. */\r\n      break;\r\n    case IR_FLOAD:\r\n      if (irt_ismarked(ir->t) || ir->op2 == IRFL_TAB_META)\r\n\tirt_setmark(IR(ir->op1)->t);  /* Mark table for remaining loads. */\r\n      break;\r\n    case IR_ASTORE: case IR_HSTORE: case IR_FSTORE: case IR_XSTORE: {\r\n      IRIns *ira = sink_checkalloc(J, ir);\r\n      if (!ira || (irt_isphi(ira->t) && !sink_checkphi(J, ira, ir->op2)))\r\n\tirt_setmark(IR(ir->op1)->t);  /* Mark ineligible ref. */\r\n      irt_setmark(IR(ir->op2)->t);  /* Mark stored value. */\r\n      break;\r\n      }\r\n#if LJ_HASFFI\r\n    case IR_CNEWI:\r\n      if (irt_isphi(ir->t) &&\r\n\t  (!sink_checkphi(J, ir, ir->op2) ||\r\n\t   (LJ_32 && ir+1 < irlast && (ir+1)->o == IR_HIOP &&\r\n\t    !sink_checkphi(J, ir, (ir+1)->op2))))\r\n\tirt_setmark(ir->t);  /* Mark ineligible allocation. */\r\n      /* fallthrough */\r\n#endif\r\n    case IR_USTORE:\r\n      irt_setmark(IR(ir->op2)->t);  /* Mark stored value. */\r\n      break;\r\n#if LJ_HASFFI\r\n    case IR_CALLXS:\r\n#endif\r\n    case IR_CALLS:\r\n      irt_setmark(IR(ir->op1)->t);  /* Mark (potentially) stored values. */\r\n      break;\r\n    case IR_PHI: {\r\n      IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n      irl->prev = irr->prev = 0;  /* Clear PHI value counts. */\r\n      if (irl->o == irr->o &&\r\n\t  (irl->o == IR_TNEW || irl->o == IR_TDUP ||\r\n\t   (LJ_HASFFI && (irl->o == IR_CNEW || irl->o == IR_CNEWI))))\r\n\tbreak;\r\n      irt_setmark(irl->t);\r\n      irt_setmark(irr->t);\r\n      break;\r\n      }\r\n    default:\r\n      if (irt_ismarked(ir->t) || irt_isguard(ir->t)) {  /* Propagate mark. */\r\n\tif (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t);\r\n\tif (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t);\r\n      }\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Mark all instructions referenced by a snapshot. */\r\nstatic void sink_mark_snap(jit_State *J, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    IRRef ref = snap_ref(map[n]);\r\n    if (!irref_isk(ref))\r\n      irt_setmark(IR(ref)->t);\r\n  }\r\n}\r\n\r\n/* Iteratively remark PHI refs with differing marks or PHI value counts. */\r\nstatic void sink_remark_phi(jit_State *J)\r\n{\r\n  IRIns *ir;\r\n  int remark;\r\n  do {\r\n    remark = 0;\r\n    for (ir = IR(J->cur.nins-1); ir->o == IR_PHI; ir--) {\r\n      IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n      if (((irl->t.irt ^ irr->t.irt) & IRT_MARK))\r\n\tremark = 1;\r\n      else if (irl->prev == irr->prev)\r\n\tcontinue;\r\n      irt_setmark(IR(ir->op1)->t);\r\n      irt_setmark(IR(ir->op2)->t);\r\n    }\r\n  } while (remark);\r\n}\r\n\r\n/* Sweep instructions and tag sunken allocations and stores. */\r\nstatic void sink_sweep_ins(jit_State *J)\r\n{\r\n  IRIns *ir, *irfirst = IR(J->cur.nk);\r\n  for (ir = IR(J->cur.nins-1) ; ir >= irfirst; ir--) {\r\n    switch (ir->o) {\r\n    case IR_ASTORE: case IR_HSTORE: case IR_FSTORE: case IR_XSTORE: {\r\n      IRIns *ira = sink_checkalloc(J, ir);\r\n      if (ira && !irt_ismarked(ira->t)) {\r\n\tint delta = (int)(ir - ira);\r\n\tir->prev = REGSP(RID_SINK, delta > 255 ? 255 : delta);\r\n      } else {\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n      }\r\n    case IR_NEWREF:\r\n      if (!irt_ismarked(IR(ir->op1)->t)) {\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n      } else {\r\n\tirt_clearmark(ir->t);\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n#if LJ_HASFFI\r\n    case IR_CNEW: case IR_CNEWI:\r\n#endif\r\n    case IR_TNEW: case IR_TDUP:\r\n      if (!irt_ismarked(ir->t)) {\r\n\tir->t.irt &= ~IRT_GUARD;\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n\tJ->cur.sinktags = 1;  /* Signal present SINK tags to assembler. */\r\n      } else {\r\n\tirt_clearmark(ir->t);\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n    case IR_PHI: {\r\n      IRIns *ira = IR(ir->op2);\r\n      if (!irt_ismarked(ira->t) &&\r\n\t  (ira->o == IR_TNEW || ira->o == IR_TDUP ||\r\n\t   (LJ_HASFFI && (ira->o == IR_CNEW || ira->o == IR_CNEWI)))) {\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n      } else {\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n      }\r\n    default:\r\n      irt_clearmark(ir->t);\r\n      ir->prev = REGSP_INIT;\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Allocation sinking and store sinking.\r\n**\r\n** 1. Mark all non-sinkable allocations.\r\n** 2. Then sink all remaining allocations and the related stores.\r\n*/\r\nvoid lj_opt_sink(jit_State *J)\r\n{\r\n  const uint32_t need = (JIT_F_OPT_SINK|JIT_F_OPT_FWD|\r\n\t\t\t JIT_F_OPT_DCE|JIT_F_OPT_CSE|JIT_F_OPT_FOLD);\r\n  if ((J->flags & need) == need &&\r\n      (J->chain[IR_TNEW] || J->chain[IR_TDUP] ||\r\n       (LJ_HASFFI && (J->chain[IR_CNEW] || J->chain[IR_CNEWI])))) {\r\n    if (!J->loopref)\r\n      sink_mark_snap(J, &J->cur.snap[J->cur.nsnap-1]);\r\n    sink_mark_ins(J);\r\n    if (J->loopref)\r\n      sink_remark_phi(J);\r\n    sink_sweep_ins(J);\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_opt_split.c",
    "content": "/*\r\n** SPLIT: Split 64 bit IR instructions into 32 bit IR instructions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_split_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT && (LJ_SOFTFP || (LJ_32 && LJ_HASFFI))\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* SPLIT pass:\r\n**\r\n** This pass splits up 64 bit IR instructions into multiple 32 bit IR\r\n** instructions. It's only active for soft-float targets or for 32 bit CPUs\r\n** which lack native 64 bit integer operations (the FFI is currently the\r\n** only emitter for 64 bit integer instructions).\r\n**\r\n** Splitting the IR in a separate pass keeps each 32 bit IR assembler\r\n** backend simple. Only a small amount of extra functionality needs to be\r\n** implemented. This is much easier than adding support for allocating\r\n** register pairs to each backend (believe me, I tried). A few simple, but\r\n** important optimizations can be performed by the SPLIT pass, which would\r\n** be tedious to do in the backend.\r\n**\r\n** The basic idea is to replace each 64 bit IR instruction with its 32 bit\r\n** equivalent plus an extra HIOP instruction. The splitted IR is not passed\r\n** through FOLD or any other optimizations, so each HIOP is guaranteed to\r\n** immediately follow it's counterpart. The actual functionality of HIOP is\r\n** inferred from the previous instruction.\r\n**\r\n** The operands of HIOP hold the hiword input references. The output of HIOP\r\n** is the hiword output reference, which is also used to hold the hiword\r\n** register or spill slot information. The register allocator treats this\r\n** instruction independently of any other instruction, which improves code\r\n** quality compared to using fixed register pairs.\r\n**\r\n** It's easier to split up some instructions into two regular 32 bit\r\n** instructions. E.g. XLOAD is split up into two XLOADs with two different\r\n** addresses. Obviously 64 bit constants need to be split up into two 32 bit\r\n** constants, too. Some hiword instructions can be entirely omitted, e.g.\r\n** when zero-extending a 32 bit value to 64 bits. 64 bit arguments for calls\r\n** are split up into two 32 bit arguments each.\r\n**\r\n** On soft-float targets, floating-point instructions are directly converted\r\n** to soft-float calls by the SPLIT pass (except for comparisons and MIN/MAX).\r\n** HIOP for number results has the type IRT_SOFTFP (\"sfp\" in -jdump).\r\n**\r\n** Here's the IR and x64 machine code for 'x.b = x.a + 1' for a struct with\r\n** two int64_t fields:\r\n**\r\n** 0100    p32 ADD    base  +8\r\n** 0101    i64 XLOAD  0100\r\n** 0102    i64 ADD    0101  +1\r\n** 0103    p32 ADD    base  +16\r\n** 0104    i64 XSTORE 0103  0102\r\n**\r\n**         mov rax, [esi+0x8]\r\n**         add rax, +0x01\r\n**         mov [esi+0x10], rax\r\n**\r\n** Here's the transformed IR and the x86 machine code after the SPLIT pass:\r\n**\r\n** 0100    p32 ADD    base  +8\r\n** 0101    int XLOAD  0100\r\n** 0102    p32 ADD    base  +12\r\n** 0103    int XLOAD  0102\r\n** 0104    int ADD    0101  +1\r\n** 0105    int HIOP   0103  +0\r\n** 0106    p32 ADD    base  +16\r\n** 0107    int XSTORE 0106  0104\r\n** 0108    int HIOP   0106  0105\r\n**\r\n**         mov eax, [esi+0x8]\r\n**         mov ecx, [esi+0xc]\r\n**         add eax, +0x01\r\n**         adc ecx, +0x00\r\n**         mov [esi+0x10], eax\r\n**         mov [esi+0x14], ecx\r\n**\r\n** You may notice the reassociated hiword address computation, which is\r\n** later fused into the mov operands by the assembler.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Directly emit the transformed IR without updating chains etc. */\r\nstatic IRRef split_emit(jit_State *J, uint16_t ot, IRRef1 op1, IRRef1 op2)\r\n{\r\n  IRRef nref = lj_ir_nextins(J);\r\n  IRIns *ir = IR(nref);\r\n  ir->ot = ot;\r\n  ir->op1 = op1;\r\n  ir->op2 = op2;\r\n  return nref;\r\n}\r\n\r\n#if LJ_SOFTFP\r\n/* Emit a (checked) number to integer conversion. */\r\nstatic IRRef split_num2int(jit_State *J, IRRef lo, IRRef hi, int check)\r\n{\r\n  IRRef tmp, res;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), lo, hi);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hi, lo);\r\n#endif\r\n  res = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_softfp_d2i);\r\n  if (check) {\r\n    tmp = split_emit(J, IRTI(IR_CALLN), res, IRCALL_softfp_i2d);\r\n    split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n    split_emit(J, IRTGI(IR_EQ), tmp, lo);\r\n    split_emit(J, IRTG(IR_HIOP, IRT_SOFTFP), tmp+1, hi);\r\n  }\r\n  return res;\r\n}\r\n\r\n/* Emit a CALLN with one split 64 bit argument. */\r\nstatic IRRef split_call_l(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t  IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n}\r\n\r\n/* Emit a CALLN with one split 64 bit argument and a 32 bit argument. */\r\nstatic IRRef split_call_li(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t   IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1, op2 = ir->op2;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n}\r\n#endif\r\n\r\n/* Emit a CALLN with two split 64 bit arguments. */\r\nstatic IRRef split_call_ll(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t   IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1, op2 = ir->op2;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, hisubst[op2]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, hisubst[op2]);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n#endif\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J,\r\n    IRT(IR_HIOP, (LJ_SOFTFP && irt_isnum(ir->t)) ? IRT_SOFTFP : IRT_INT),\r\n    tmp, tmp);\r\n}\r\n\r\n/* Get a pointer to the other 32 bit word (LE: hiword, BE: loword). */\r\nstatic IRRef split_ptr(jit_State *J, IRIns *oir, IRRef ref)\r\n{\r\n  IRRef nref = oir[ref].prev;\r\n  IRIns *ir = IR(nref);\r\n  int32_t ofs = 4;\r\n  if (ir->o == IR_KPTR)\r\n    return lj_ir_kptr(J, (char *)ir_kptr(ir) + ofs);\r\n  if (ir->o == IR_ADD && irref_isk(ir->op2) && !irt_isphi(oir[ref].t)) {\r\n    /* Reassociate address. */\r\n    ofs += IR(ir->op2)->i;\r\n    nref = ir->op1;\r\n    if (ofs == 0) return nref;\r\n  }\r\n  return split_emit(J, IRTI(IR_ADD), nref, lj_ir_kint(J, ofs));\r\n}\r\n\r\n/* Substitute references of a snapshot. */\r\nstatic void split_subst_snap(jit_State *J, SnapShot *snap, IRIns *oir)\r\n{\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRIns *ir = &oir[snap_ref(sn)];\r\n    if (!(LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && irref_isk(snap_ref(sn))))\r\n      map[n] = ((sn & 0xffff0000) | ir->prev);\r\n  }\r\n}\r\n\r\n/* Transform the old IR to the new IR. */\r\nstatic void split_ir(jit_State *J)\r\n{\r\n  IRRef nins = J->cur.nins, nk = J->cur.nk;\r\n  MSize irlen = nins - nk;\r\n  MSize need = (irlen+1)*(sizeof(IRIns) + sizeof(IRRef1));\r\n  IRIns *oir = (IRIns *)lj_str_needbuf(J->L, &G(J->L)->tmpbuf, need);\r\n  IRRef1 *hisubst;\r\n  IRRef ref, snref;\r\n  SnapShot *snap;\r\n\r\n  /* Copy old IR to buffer. */\r\n  memcpy(oir, IR(nk), irlen*sizeof(IRIns));\r\n  /* Bias hiword substitution table and old IR. Loword kept in field prev. */\r\n  hisubst = (IRRef1 *)&oir[irlen] - nk;\r\n  oir -= nk;\r\n\r\n  /* Remove all IR instructions, but retain IR constants. */\r\n  J->cur.nins = REF_FIRST;\r\n  J->loopref = 0;\r\n\r\n  /* Process constants and fixed references. */\r\n  for (ref = nk; ref <= REF_BASE; ref++) {\r\n    IRIns *ir = &oir[ref];\r\n    if ((LJ_SOFTFP && ir->o == IR_KNUM) || ir->o == IR_KINT64) {\r\n      /* Split up 64 bit constant. */\r\n      TValue tv = *ir_k64(ir);\r\n      ir->prev = lj_ir_kint(J, (int32_t)tv.u32.lo);\r\n      hisubst[ref] = lj_ir_kint(J, (int32_t)tv.u32.hi);\r\n    } else {\r\n      ir->prev = ref;  /* Identity substitution for loword. */\r\n      hisubst[ref] = 0;\r\n    }\r\n  }\r\n\r\n  /* Process old IR instructions. */\r\n  snap = J->cur.snap;\r\n  snref = snap->ref;\r\n  for (ref = REF_FIRST; ref < nins; ref++) {\r\n    IRIns *ir = &oir[ref];\r\n    IRRef nref = lj_ir_nextins(J);\r\n    IRIns *nir = IR(nref);\r\n    IRRef hi = 0;\r\n\r\n    if (ref >= snref) {\r\n      snap->ref = nref;\r\n      split_subst_snap(J, snap++, oir);\r\n      snref = snap < &J->cur.snap[J->cur.nsnap] ? snap->ref : ~(IRRef)0;\r\n    }\r\n\r\n    /* Copy-substitute old instruction to new instruction. */\r\n    nir->op1 = ir->op1 < nk ? ir->op1 : oir[ir->op1].prev;\r\n    nir->op2 = ir->op2 < nk ? ir->op2 : oir[ir->op2].prev;\r\n    ir->prev = nref;  /* Loword substitution. */\r\n    nir->o = ir->o;\r\n    nir->t.irt = ir->t.irt & ~(IRT_MARK|IRT_ISPHI);\r\n    hisubst[ref] = 0;\r\n\r\n    /* Split 64 bit instructions. */\r\n#if LJ_SOFTFP\r\n    if (irt_isnum(ir->t)) {\r\n      nir->t.irt = IRT_INT | (nir->t.irt & IRT_GUARD);  /* Turn into INT op. */\r\n      /* Note: hi ref = lo ref + 1! Required for SNAP_SOFTFPNUM logic. */\r\n      switch (ir->o) {\r\n      case IR_ADD:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_add);\r\n\tbreak;\r\n      case IR_SUB:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_sub);\r\n\tbreak;\r\n      case IR_MUL:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_mul);\r\n\tbreak;\r\n      case IR_DIV:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_div);\r\n\tbreak;\r\n      case IR_POW:\r\n\thi = split_call_li(J, hisubst, oir, ir, IRCALL_lj_vm_powi);\r\n\tbreak;\r\n      case IR_FPMATH:\r\n\t/* Try to rejoin pow from EXP2, MUL and LOG2. */\r\n\tif (nir->op2 == IRFPM_EXP2 && nir->op1 > J->loopref) {\r\n\t  IRIns *irp = IR(nir->op1);\r\n\t  if (irp->o == IR_CALLN && irp->op2 == IRCALL_softfp_mul) {\r\n\t    IRIns *irm4 = IR(irp->op1);\r\n\t    IRIns *irm3 = IR(irm4->op1);\r\n\t    IRIns *irm12 = IR(irm3->op1);\r\n\t    IRIns *irl1 = IR(irm12->op1);\r\n\t    if (irm12->op1 > J->loopref && irl1->o == IR_CALLN &&\r\n\t\tirl1->op2 == IRCALL_lj_vm_log2) {\r\n\t      IRRef tmp = irl1->op1;  /* Recycle first two args from LOG2. */\r\n\t      IRRef arg3 = irm3->op2, arg4 = irm4->op2;\r\n\t      J->cur.nins--;\r\n\t      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, arg3);\r\n\t      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, arg4);\r\n\t      ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_pow);\r\n\t      hi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n\t      break;\r\n\t    }\r\n\t  }\r\n\t}\r\n\thi = split_call_l(J, hisubst, oir, ir, IRCALL_lj_vm_floor + ir->op2);\r\n\tbreak;\r\n      case IR_ATAN2:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_atan2);\r\n\tbreak;\r\n      case IR_LDEXP:\r\n\thi = split_call_li(J, hisubst, oir, ir, IRCALL_ldexp);\r\n\tbreak;\r\n      case IR_NEG: case IR_ABS:\r\n\tnir->o = IR_CONV;  /* Pass through loword. */\r\n\tnir->op2 = (IRT_INT << 5) | IRT_INT;\r\n\thi = split_emit(J, IRT(ir->o == IR_NEG ? IR_BXOR : IR_BAND, IRT_SOFTFP),\r\n\t\t\thisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_SLOAD:\r\n\tif ((nir->op2 & IRSLOAD_CONVERT)) {  /* Convert from int to number. */\r\n\t  nir->op2 &= ~IRSLOAD_CONVERT;\r\n\t  ir->prev = nref = split_emit(J, IRTI(IR_CALLN), nref,\r\n\t\t\t\t       IRCALL_softfp_i2d);\r\n\t  hi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\t  break;\r\n\t}\r\n\t/* fallthrough */\r\n      case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n      case IR_STRTO:\r\n\thi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tbreak;\r\n      case IR_XLOAD: {\r\n\tIRIns inslo = *nir;  /* Save/undo the emit of the lo XLOAD. */\r\n\tJ->cur.nins--;\r\n\thi = split_ptr(J, oir, ir->op1);  /* Insert the hiref ADD. */\r\n\tnref = lj_ir_nextins(J);\r\n\tnir = IR(nref);\r\n\t*nir = inslo;  /* Re-emit lo XLOAD immediately before hi XLOAD. */\r\n\thi = split_emit(J, IRT(IR_XLOAD, IRT_SOFTFP), hi, ir->op2);\r\n#if LJ_LE\r\n\tir->prev = nref;\r\n#else\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n\t}\r\n      case IR_ASTORE: case IR_HSTORE: case IR_USTORE: case IR_XSTORE:\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nir->op1, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_CONV: {  /* Conversion to number. Others handled below. */\r\n\tIRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n\tUNUSED(st);\r\n#if LJ_32 && LJ_HASFFI\r\n\tif (st == IRT_I64 || st == IRT_U64) {\r\n\t  hi = split_call_l(J, hisubst, oir, ir,\r\n\t\t st == IRT_I64 ? IRCALL_fp64_l2d : IRCALL_fp64_ul2d);\r\n\t  break;\r\n\t}\r\n#endif\r\n\tlua_assert(st == IRT_INT ||\r\n\t\t   (LJ_32 && LJ_HASFFI && (st == IRT_U32 || st == IRT_FLOAT)));\r\n\tnir->o = IR_CALLN;\r\n#if LJ_32 && LJ_HASFFI\r\n\tnir->op2 = st == IRT_INT ? IRCALL_softfp_i2d :\r\n\t\t   st == IRT_FLOAT ? IRCALL_softfp_f2d :\r\n\t\t   IRCALL_softfp_ui2d;\r\n#else\r\n\tnir->op2 = IRCALL_softfp_i2d;\r\n#endif\r\n\thi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tbreak;\r\n\t}\r\n      case IR_CALLN:\r\n      case IR_CALLL:\r\n      case IR_CALLS:\r\n      case IR_CALLXS:\r\n\tgoto split_call;\r\n      case IR_PHI:\r\n\tif (nir->op1 == nir->op2)\r\n\t  J->cur.nins--;  /* Drop useless PHIs. */\r\n\tif (hisubst[ir->op1] != hisubst[ir->op2])\r\n\t  split_emit(J, IRT(IR_PHI, IRT_SOFTFP),\r\n\t\t     hisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_HIOP:\r\n\tJ->cur.nins--;  /* Drop joining HIOP. */\r\n\tir->prev = nir->op1;\r\n\thi = nir->op2;\r\n\tbreak;\r\n      default:\r\n\tlua_assert(ir->o <= IR_NE || ir->o == IR_MIN || ir->o == IR_MAX);\r\n\thi = split_emit(J, IRTG(IR_HIOP, IRT_SOFTFP),\r\n\t\t\thisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      }\r\n    } else\r\n#endif\r\n#if LJ_32 && LJ_HASFFI\r\n    if (irt_isint64(ir->t)) {\r\n      IRRef hiref = hisubst[ir->op1];\r\n      nir->t.irt = IRT_INT | (nir->t.irt & IRT_GUARD);  /* Turn into INT op. */\r\n      switch (ir->o) {\r\n      case IR_ADD:\r\n      case IR_SUB:\r\n\t/* Use plain op for hiword if loword cannot produce a carry/borrow. */\r\n\tif (irref_isk(nir->op2) && IR(nir->op2)->i == 0) {\r\n\t  ir->prev = nir->op1;  /* Pass through loword. */\r\n\t  nir->op1 = hiref; nir->op2 = hisubst[ir->op2];\r\n\t  hi = nref;\r\n\t  break;\r\n\t}\r\n\t/* fallthrough */\r\n      case IR_NEG:\r\n\thi = split_emit(J, IRTI(IR_HIOP), hiref, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_MUL:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_lj_carith_mul64);\r\n\tbreak;\r\n      case IR_DIV:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_divi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_divu64);\r\n\tbreak;\r\n      case IR_MOD:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_modi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_modu64);\r\n\tbreak;\r\n      case IR_POW:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_powi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_powu64);\r\n\tbreak;\r\n      case IR_FLOAD:\r\n\tlua_assert(ir->op2 == IRFL_CDATA_INT64);\r\n\thi = split_emit(J, IRTI(IR_FLOAD), nir->op1, IRFL_CDATA_INT64_4);\r\n#if LJ_BE\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n      case IR_XLOAD:\r\n\thi = split_emit(J, IRTI(IR_XLOAD), split_ptr(J, oir, ir->op1), ir->op2);\r\n#if LJ_BE\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n      case IR_XSTORE:\r\n\tsplit_emit(J, IRTI(IR_HIOP), nir->op1, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_CONV: {  /* Conversion to 64 bit integer. Others handled below. */\r\n\tIRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if LJ_SOFTFP\r\n\tif (st == IRT_NUM) {  /* NUM to 64 bit int conv. */\r\n\t  hi = split_call_l(J, hisubst, oir, ir,\r\n\t\t irt_isi64(ir->t) ? IRCALL_fp64_d2l : IRCALL_fp64_d2ul);\r\n\t} else if (st == IRT_FLOAT) {  /* FLOAT to 64 bit int conv. */\r\n\t  nir->o = IR_CALLN;\r\n\t  nir->op2 = irt_isi64(ir->t) ? IRCALL_fp64_f2l : IRCALL_fp64_f2ul;\r\n\t  hi = split_emit(J, IRTI(IR_HIOP), nref, nref);\r\n\t}\r\n#else\r\n\tif (st == IRT_NUM || st == IRT_FLOAT) {  /* FP to 64 bit int conv. */\r\n\t  hi = split_emit(J, IRTI(IR_HIOP), nir->op1, nref);\r\n\t}\r\n#endif\r\n\telse if (st == IRT_I64 || st == IRT_U64) {  /* 64/64 bit cast. */\r\n\t  /* Drop cast, since assembler doesn't care. */\r\n\t  goto fwdlo;\r\n\t} else if ((ir->op2 & IRCONV_SEXT)) {  /* Sign-extend to 64 bit. */\r\n\t  IRRef k31 = lj_ir_kint(J, 31);\r\n\t  nir = IR(nref);  /* May have been reallocated. */\r\n\t  ir->prev = nir->op1;  /* Pass through loword. */\r\n\t  nir->o = IR_BSAR;  /* hi = bsar(lo, 31). */\r\n\t  nir->op2 = k31;\r\n\t  hi = nref;\r\n\t} else {  /* Zero-extend to 64 bit. */\r\n\t  hi = lj_ir_kint(J, 0);\r\n\t  goto fwdlo;\r\n\t}\r\n\tbreak;\r\n\t}\r\n      case IR_CALLXS:\r\n\tgoto split_call;\r\n      case IR_PHI: {\r\n\tIRRef hiref2;\r\n\tif ((irref_isk(nir->op1) && irref_isk(nir->op2)) ||\r\n\t    nir->op1 == nir->op2)\r\n\t  J->cur.nins--;  /* Drop useless PHIs. */\r\n\thiref2 = hisubst[ir->op2];\r\n\tif (!((irref_isk(hiref) && irref_isk(hiref2)) || hiref == hiref2))\r\n\t  split_emit(J, IRTI(IR_PHI), hiref, hiref2);\r\n\tbreak;\r\n\t}\r\n      case IR_HIOP:\r\n\tJ->cur.nins--;  /* Drop joining HIOP. */\r\n\tir->prev = nir->op1;\r\n\thi = nir->op2;\r\n\tbreak;\r\n      default:\r\n\tlua_assert(ir->o <= IR_NE);  /* Comparisons. */\r\n\tsplit_emit(J, IRTGI(IR_HIOP), hiref, hisubst[ir->op2]);\r\n\tbreak;\r\n      }\r\n    } else\r\n#endif\r\n#if LJ_SOFTFP\r\n    if (ir->o == IR_SLOAD) {\r\n      if ((nir->op2 & IRSLOAD_CONVERT)) {  /* Convert from number to int. */\r\n\tnir->op2 &= ~IRSLOAD_CONVERT;\r\n\tif (!(nir->op2 & IRSLOAD_TYPECHECK))\r\n\t  nir->t.irt = IRT_INT;  /* Drop guard. */\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tir->prev = split_num2int(J, nref, nref+1, irt_isguard(ir->t));\r\n      }\r\n    } else if (ir->o == IR_TOBIT) {\r\n      IRRef tmp, op1 = ir->op1;\r\n      J->cur.nins--;\r\n#if LJ_LE\r\n      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n      ir->prev = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_lj_vm_tobit);\r\n    } else if (ir->o == IR_TOSTR) {\r\n      if (hisubst[ir->op1]) {\r\n\tif (irref_isk(ir->op1))\r\n\t  nir->op1 = ir->op1;\r\n\telse\r\n\t  split_emit(J, IRT(IR_HIOP, IRT_NIL), hisubst[ir->op1], nref);\r\n      }\r\n    } else if (ir->o == IR_HREF || ir->o == IR_NEWREF) {\r\n      if (irref_isk(ir->op2) && hisubst[ir->op2])\r\n\tnir->op2 = ir->op2;\r\n    } else\r\n#endif\r\n    if (ir->o == IR_CONV) {  /* See above, too. */\r\n      IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if LJ_32 && LJ_HASFFI\r\n      if (st == IRT_I64 || st == IRT_U64) {  /* Conversion from 64 bit int. */\r\n#if LJ_SOFTFP\r\n\tif (irt_isfloat(ir->t)) {\r\n\t  split_call_l(J, hisubst, oir, ir,\r\n\t\t       st == IRT_I64 ? IRCALL_fp64_l2f : IRCALL_fp64_ul2f);\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t}\r\n#else\r\n\tif (irt_isfp(ir->t)) {  /* 64 bit integer to FP conversion. */\r\n\t  ir->prev = split_emit(J, IRT(IR_HIOP, irt_type(ir->t)),\r\n\t\t\t\thisubst[ir->op1], nref);\r\n\t}\r\n#endif\r\n\telse {  /* Truncate to lower 32 bits. */\r\n\tfwdlo:\r\n\t  ir->prev = nir->op1;  /* Forward loword. */\r\n\t  /* Replace with NOP to avoid messing up the snapshot logic. */\r\n\t  nir->ot = IRT(IR_NOP, IRT_NIL);\r\n\t  nir->op1 = nir->op2 = 0;\r\n\t}\r\n      }\r\n#endif\r\n#if LJ_SOFTFP && LJ_32 && LJ_HASFFI\r\n      else if (irt_isfloat(ir->t)) {\r\n\tif (st == IRT_NUM) {\r\n\t  split_call_l(J, hisubst, oir, ir, IRCALL_softfp_d2f);\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t} else {\r\n\t  nir->o = IR_CALLN;\r\n\t  nir->op2 = st == IRT_INT ? IRCALL_softfp_i2f : IRCALL_softfp_ui2f;\r\n\t}\r\n      } else if (st == IRT_FLOAT) {\r\n\tnir->o = IR_CALLN;\r\n\tnir->op2 = irt_isint(ir->t) ? IRCALL_softfp_f2i : IRCALL_softfp_f2ui;\r\n      } else\r\n#endif\r\n#if LJ_SOFTFP\r\n      if (st == IRT_NUM || (LJ_32 && LJ_HASFFI && st == IRT_FLOAT)) {\r\n\tif (irt_isguard(ir->t)) {\r\n\t  lua_assert(st == IRT_NUM && irt_isint(ir->t));\r\n\t  J->cur.nins--;\r\n\t  ir->prev = split_num2int(J, nir->op1, hisubst[ir->op1], 1);\r\n\t} else {\r\n\t  split_call_l(J, hisubst, oir, ir,\r\n#if LJ_32 && LJ_HASFFI\r\n\t    st == IRT_NUM ?\r\n\t      (irt_isint(ir->t) ? IRCALL_softfp_d2i : IRCALL_softfp_d2ui) :\r\n\t      (irt_isint(ir->t) ? IRCALL_softfp_f2i : IRCALL_softfp_f2ui)\r\n#else\r\n\t    IRCALL_softfp_d2i\r\n#endif\r\n\t  );\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t}\r\n      }\r\n#endif\r\n    } else if (ir->o == IR_CALLXS) {\r\n      IRRef hiref;\r\n    split_call:\r\n      hiref = hisubst[ir->op1];\r\n      if (hiref) {\r\n\tIROpT ot = nir->ot;\r\n\tIRRef op2 = nir->op2;\r\n\tnir->ot = IRT(IR_CARG, IRT_NIL);\r\n#if LJ_LE\r\n\tnir->op2 = hiref;\r\n#else\r\n\tnir->op2 = nir->op1; nir->op1 = hiref;\r\n#endif\r\n\tir->prev = nref = split_emit(J, ot, nref, op2);\r\n      }\r\n      if (LJ_SOFTFP ? irt_is64(ir->t) : irt_isint64(ir->t))\r\n\thi = split_emit(J,\r\n\t  IRT(IR_HIOP, (LJ_SOFTFP && irt_isnum(ir->t)) ? IRT_SOFTFP : IRT_INT),\r\n\t  nref, nref);\r\n    } else if (ir->o == IR_CARG) {\r\n      IRRef hiref = hisubst[ir->op1];\r\n      if (hiref) {\r\n\tIRRef op2 = nir->op2;\r\n#if LJ_LE\r\n\tnir->op2 = hiref;\r\n#else\r\n\tnir->op2 = nir->op1; nir->op1 = hiref;\r\n#endif\r\n\tir->prev = nref = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, op2);\r\n\tnir = IR(nref);\r\n      }\r\n      hiref = hisubst[ir->op2];\r\n      if (hiref) {\r\n#if !LJ_TARGET_X86\r\n\tint carg = 0;\r\n\tIRIns *cir;\r\n\tfor (cir = IR(nir->op1); cir->o == IR_CARG; cir = IR(cir->op1))\r\n\t  carg++;\r\n\tif ((carg & 1) == 0) {  /* Align 64 bit arguments. */\r\n\t  IRRef op2 = nir->op2;\r\n\t  nir->op2 = REF_NIL;\r\n\t  nref = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, op2);\r\n\t  nir = IR(nref);\r\n\t}\r\n#endif\r\n#if LJ_BE\r\n\t{ IRRef tmp = nir->op2; nir->op2 = hiref; hiref = tmp; }\r\n#endif\r\n\tir->prev = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, hiref);\r\n      }\r\n    } else if (ir->o == IR_CNEWI) {\r\n      if (hisubst[ir->op2])\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_NIL), nref, hisubst[ir->op2]);\r\n    } else if (ir->o == IR_LOOP) {\r\n      J->loopref = nref;  /* Needed by assembler. */\r\n    }\r\n    hisubst[ref] = hi;  /* Store hiword substitution. */\r\n  }\r\n  if (snref == nins) {  /* Substitution for last snapshot. */\r\n    snap->ref = J->cur.nins;\r\n    split_subst_snap(J, snap, oir);\r\n  }\r\n\r\n  /* Add PHI marks. */\r\n  for (ref = J->cur.nins-1; ref >= REF_FIRST; ref--) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->o != IR_PHI) break;\r\n    if (!irref_isk(ir->op1)) irt_setphi(IR(ir->op1)->t);\r\n    if (ir->op2 > J->loopref) irt_setphi(IR(ir->op2)->t);\r\n  }\r\n}\r\n\r\n/* Protected callback for split pass. */\r\nstatic TValue *cpsplit(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  split_ir(J);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\n#if defined(LUA_USE_ASSERT) || LJ_SOFTFP\r\n/* Slow, but sure way to check whether a SPLIT pass is needed. */\r\nstatic int split_needsplit(jit_State *J)\r\n{\r\n  IRIns *ir, *irend;\r\n  IRRef ref;\r\n  for (ir = IR(REF_FIRST), irend = IR(J->cur.nins); ir < irend; ir++)\r\n    if (LJ_SOFTFP ? irt_is64orfp(ir->t) : irt_isint64(ir->t))\r\n      return 1;\r\n  if (LJ_SOFTFP) {\r\n    for (ref = J->chain[IR_SLOAD]; ref; ref = IR(ref)->prev)\r\n      if ((IR(ref)->op2 & IRSLOAD_CONVERT))\r\n\treturn 1;\r\n    if (J->chain[IR_TOBIT])\r\n      return 1;\r\n  }\r\n  for (ref = J->chain[IR_CONV]; ref; ref = IR(ref)->prev) {\r\n    IRType st = (IR(ref)->op2 & IRCONV_SRCMASK);\r\n    if ((LJ_SOFTFP && (st == IRT_NUM || st == IRT_FLOAT)) ||\r\n\tst == IRT_I64 || st == IRT_U64)\r\n      return 1;\r\n  }\r\n  return 0;  /* Nope. */\r\n}\r\n#endif\r\n\r\n/* SPLIT pass. */\r\nvoid lj_opt_split(jit_State *J)\r\n{\r\n#if LJ_SOFTFP\r\n  if (!J->needsplit)\r\n    J->needsplit = split_needsplit(J);\r\n#else\r\n  lua_assert(J->needsplit >= split_needsplit(J));  /* Verify flag. */\r\n#endif\r\n  if (J->needsplit) {\r\n    int errcode = lj_vm_cpcall(J->L, NULL, J, cpsplit);\r\n    if (errcode) {\r\n      /* Completely reset the trace to avoid inconsistent dump on abort. */\r\n      J->cur.nins = J->cur.nk = REF_BASE;\r\n      J->cur.nsnap = 0;\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    }\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_parse.c",
    "content": "/*\r\n** Lua parser (source code -> bytecode).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_parse_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_lex.h\"\r\n#include \"lj_parse.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n\r\n/* -- Parser structures and definitions ----------------------------------- */\r\n\r\n/* Expression kinds. */\r\ntypedef enum {\r\n  /* Constant expressions must be first and in this order: */\r\n  VKNIL,\r\n  VKFALSE,\r\n  VKTRUE,\r\n  VKSTR,\t/* sval = string value */\r\n  VKNUM,\t/* nval = number value */\r\n  VKLAST = VKNUM,\r\n  VKCDATA,\t/* nval = cdata value, not treated as a constant expression */\r\n  /* Non-constant expressions follow: */\r\n  VLOCAL,\t/* info = local register, aux = vstack index */\r\n  VUPVAL,\t/* info = upvalue index, aux = vstack index */\r\n  VGLOBAL,\t/* sval = string value */\r\n  VINDEXED,\t/* info = table register, aux = index reg/byte/string const */\r\n  VJMP,\t\t/* info = instruction PC */\r\n  VRELOCABLE,\t/* info = instruction PC */\r\n  VNONRELOC,\t/* info = result register */\r\n  VCALL,\t/* info = instruction PC, aux = base */\r\n  VVOID\r\n} ExpKind;\r\n\r\n/* Expression descriptor. */\r\ntypedef struct ExpDesc {\r\n  union {\r\n    struct {\r\n      uint32_t info;\t/* Primary info. */\r\n      uint32_t aux;\t/* Secondary info. */\r\n    } s;\r\n    TValue nval;\t/* Number value. */\r\n    GCstr *sval;\t/* String value. */\r\n  } u;\r\n  ExpKind k;\r\n  BCPos t;\t\t/* True condition jump list. */\r\n  BCPos f;\t\t/* False condition jump list. */\r\n} ExpDesc;\r\n\r\n/* Macros for expressions. */\r\n#define expr_hasjump(e)\t\t((e)->t != (e)->f)\r\n\r\n#define expr_isk(e)\t\t((e)->k <= VKLAST)\r\n#define expr_isk_nojump(e)\t(expr_isk(e) && !expr_hasjump(e))\r\n#define expr_isnumk(e)\t\t((e)->k == VKNUM)\r\n#define expr_isnumk_nojump(e)\t(expr_isnumk(e) && !expr_hasjump(e))\r\n#define expr_isstrk(e)\t\t((e)->k == VKSTR)\r\n\r\n#define expr_numtv(e)\t\tcheck_exp(expr_isnumk((e)), &(e)->u.nval)\r\n#define expr_numberV(e)\t\tnumberVnum(expr_numtv((e)))\r\n\r\n/* Initialize expression. */\r\nstatic LJ_AINLINE void expr_init(ExpDesc *e, ExpKind k, uint32_t info)\r\n{\r\n  e->k = k;\r\n  e->u.s.info = info;\r\n  e->f = e->t = NO_JMP;\r\n}\r\n\r\n/* Check number constant for +-0. */\r\nstatic int expr_numiszero(ExpDesc *e)\r\n{\r\n  TValue *o = expr_numtv(e);\r\n  return tvisint(o) ? (intV(o) == 0) : tviszero(o);\r\n}\r\n\r\n/* Per-function linked list of scope blocks. */\r\ntypedef struct FuncScope {\r\n  struct FuncScope *prev;\t/* Link to outer scope. */\r\n  MSize vstart;\t\t\t/* Start of block-local variables. */\r\n  uint8_t nactvar;\t\t/* Number of active vars outside the scope. */\r\n  uint8_t flags;\t\t/* Scope flags. */\r\n} FuncScope;\r\n\r\n#define FSCOPE_LOOP\t\t0x01\t/* Scope is a (breakable) loop. */\r\n#define FSCOPE_BREAK\t\t0x02\t/* Break used in scope. */\r\n#define FSCOPE_GOLA\t\t0x04\t/* Goto or label used in scope. */\r\n#define FSCOPE_UPVAL\t\t0x08\t/* Upvalue in scope. */\r\n#define FSCOPE_NOCLOSE\t\t0x10\t/* Do not close upvalues. */\r\n\r\n#define NAME_BREAK\t\t((GCstr *)(uintptr_t)1)\r\n\r\n/* Index into variable stack. */\r\ntypedef uint16_t VarIndex;\r\n#define LJ_MAX_VSTACK\t\t(65536 - LJ_MAX_UPVAL)\r\n\r\n/* Variable/goto/label info. */\r\n#define VSTACK_VAR_RW\t\t0x01\t/* R/W variable. */\r\n#define VSTACK_GOTO\t\t0x02\t/* Pending goto. */\r\n#define VSTACK_LABEL\t\t0x04\t/* Label. */\r\n\r\n/* Per-function state. */\r\ntypedef struct FuncState {\r\n  GCtab *kt;\t\t\t/* Hash table for constants. */\r\n  LexState *ls;\t\t\t/* Lexer state. */\r\n  lua_State *L;\t\t\t/* Lua state. */\r\n  FuncScope *bl;\t\t/* Current scope. */\r\n  struct FuncState *prev;\t/* Enclosing function. */\r\n  BCPos pc;\t\t\t/* Next bytecode position. */\r\n  BCPos lasttarget;\t\t/* Bytecode position of last jump target. */\r\n  BCPos jpc;\t\t\t/* Pending jump list to next bytecode. */\r\n  BCReg freereg;\t\t/* First free register. */\r\n  BCReg nactvar;\t\t/* Number of active local variables. */\r\n  BCReg nkn, nkgc;\t\t/* Number of lua_Number/GCobj constants */\r\n  BCLine linedefined;\t\t/* First line of the function definition. */\r\n  BCInsLine *bcbase;\t\t/* Base of bytecode stack. */\r\n  BCPos bclim;\t\t\t/* Limit of bytecode stack. */\r\n  MSize vbase;\t\t\t/* Base of variable stack for this function. */\r\n  uint8_t flags;\t\t/* Prototype flags. */\r\n  uint8_t numparams;\t\t/* Number of parameters. */\r\n  uint8_t framesize;\t\t/* Fixed frame size. */\r\n  uint8_t nuv;\t\t\t/* Number of upvalues */\r\n  VarIndex varmap[LJ_MAX_LOCVAR];  /* Map from register to variable idx. */\r\n  VarIndex uvmap[LJ_MAX_UPVAL];\t/* Map from upvalue to variable idx. */\r\n  VarIndex uvtmp[LJ_MAX_UPVAL];\t/* Temporary upvalue map. */\r\n} FuncState;\r\n\r\n/* Binary and unary operators. ORDER OPR */\r\ntypedef enum BinOpr {\r\n  OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW,  /* ORDER ARITH */\r\n  OPR_CONCAT,\r\n  OPR_NE, OPR_EQ,\r\n  OPR_LT, OPR_GE, OPR_LE, OPR_GT,\r\n  OPR_AND, OPR_OR,\r\n  OPR_NOBINOPR\r\n} BinOpr;\r\n\r\nLJ_STATIC_ASSERT((int)BC_ISGE-(int)BC_ISLT == (int)OPR_GE-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_ISLE-(int)BC_ISLT == (int)OPR_LE-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_ISGT-(int)BC_ISLT == (int)OPR_GT-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_SUBVV-(int)BC_ADDVV == (int)OPR_SUB-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_MULVV-(int)BC_ADDVV == (int)OPR_MUL-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_DIVVV-(int)BC_ADDVV == (int)OPR_DIV-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_MODVV-(int)BC_ADDVV == (int)OPR_MOD-(int)OPR_ADD);\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\nLJ_NORET LJ_NOINLINE static void err_syntax(LexState *ls, ErrMsg em)\r\n{\r\n  lj_lex_error(ls, ls->token, em);\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void err_token(LexState *ls, LexToken token)\r\n{\r\n  lj_lex_error(ls, ls->token, LJ_ERR_XTOKEN, lj_lex_token2str(ls, token));\r\n}\r\n\r\nLJ_NORET static void err_limit(FuncState *fs, uint32_t limit, const char *what)\r\n{\r\n  if (fs->linedefined == 0)\r\n    lj_lex_error(fs->ls, 0, LJ_ERR_XLIMM, limit, what);\r\n  else\r\n    lj_lex_error(fs->ls, 0, LJ_ERR_XLIMF, fs->linedefined, limit, what);\r\n}\r\n\r\n#define checklimit(fs, v, l, m)\t\tif ((v) >= (l)) err_limit(fs, l, m)\r\n#define checklimitgt(fs, v, l, m)\tif ((v) > (l)) err_limit(fs, l, m)\r\n#define checkcond(ls, c, em)\t\t{ if (!(c)) err_syntax(ls, em); }\r\n\r\n/* -- Management of constants --------------------------------------------- */\r\n\r\n/* Return bytecode encoding for primitive constant. */\r\n#define const_pri(e)\t\tcheck_exp((e)->k <= VKTRUE, (e)->k)\r\n\r\n#define tvhaskslot(o)\t((o)->u32.hi == 0)\r\n#define tvkslot(o)\t((o)->u32.lo)\r\n\r\n/* Add a number constant. */\r\nstatic BCReg const_num(FuncState *fs, ExpDesc *e)\r\n{\r\n  lua_State *L = fs->L;\r\n  TValue *o;\r\n  lua_assert(expr_isnumk(e));\r\n  o = lj_tab_set(L, fs->kt, &e->u.nval);\r\n  if (tvhaskslot(o))\r\n    return tvkslot(o);\r\n  o->u64 = fs->nkn;\r\n  return fs->nkn++;\r\n}\r\n\r\n/* Add a GC object constant. */\r\nstatic BCReg const_gc(FuncState *fs, GCobj *gc, uint32_t itype)\r\n{\r\n  lua_State *L = fs->L;\r\n  TValue key, *o;\r\n  setgcV(L, &key, gc, itype);\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  o = lj_tab_set(L, fs->kt, &key);\r\n  if (tvhaskslot(o))\r\n    return tvkslot(o);\r\n  o->u64 = fs->nkgc;\r\n  return fs->nkgc++;\r\n}\r\n\r\n/* Add a string constant. */\r\nstatic BCReg const_str(FuncState *fs, ExpDesc *e)\r\n{\r\n  lua_assert(expr_isstrk(e) || e->k == VGLOBAL);\r\n  return const_gc(fs, obj2gco(e->u.sval), LJ_TSTR);\r\n}\r\n\r\n/* Anchor string constant to avoid GC. */\r\nGCstr *lj_parse_keepstr(LexState *ls, const char *str, size_t len)\r\n{\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  lua_State *L = ls->L;\r\n  GCstr *s = lj_str_new(L, str, len);\r\n  TValue *tv = lj_tab_setstr(L, ls->fs->kt, s);\r\n  if (tvisnil(tv)) setboolV(tv, 1);\r\n  lj_gc_check(L);\r\n  return s;\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Anchor cdata to avoid GC. */\r\nvoid lj_parse_keepcdata(LexState *ls, TValue *tv, GCcdata *cd)\r\n{\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  lua_State *L = ls->L;\r\n  setcdataV(L, tv, cd);\r\n  setboolV(lj_tab_set(L, ls->fs->kt, tv), 1);\r\n}\r\n#endif\r\n\r\n/* -- Jump list handling -------------------------------------------------- */\r\n\r\n/* Get next element in jump list. */\r\nstatic BCPos jmp_next(FuncState *fs, BCPos pc)\r\n{\r\n  ptrdiff_t delta = bc_j(fs->bcbase[pc].ins);\r\n  if ((BCPos)delta == NO_JMP)\r\n    return NO_JMP;\r\n  else\r\n    return (BCPos)(((ptrdiff_t)pc+1)+delta);\r\n}\r\n\r\n/* Check if any of the instructions on the jump list produce no value. */\r\nstatic int jmp_novalue(FuncState *fs, BCPos list)\r\n{\r\n  for (; list != NO_JMP; list = jmp_next(fs, list)) {\r\n    BCIns p = fs->bcbase[list >= 1 ? list-1 : list].ins;\r\n    if (!(bc_op(p) == BC_ISTC || bc_op(p) == BC_ISFC || bc_a(p) == NO_REG))\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Patch register of test instructions. */\r\nstatic int jmp_patchtestreg(FuncState *fs, BCPos pc, BCReg reg)\r\n{\r\n  BCInsLine *ilp = &fs->bcbase[pc >= 1 ? pc-1 : pc];\r\n  BCOp op = bc_op(ilp->ins);\r\n  if (op == BC_ISTC || op == BC_ISFC) {\r\n    if (reg != NO_REG && reg != bc_d(ilp->ins)) {\r\n      setbc_a(&ilp->ins, reg);\r\n    } else {  /* Nothing to store or already in the right register. */\r\n      setbc_op(&ilp->ins, op+(BC_IST-BC_ISTC));\r\n      setbc_a(&ilp->ins, 0);\r\n    }\r\n  } else if (bc_a(ilp->ins) == NO_REG) {\r\n    if (reg == NO_REG) {\r\n      ilp->ins = BCINS_AJ(BC_JMP, bc_a(fs->bcbase[pc].ins), 0);\r\n    } else {\r\n      setbc_a(&ilp->ins, reg);\r\n      if (reg >= bc_a(ilp[1].ins))\r\n\tsetbc_a(&ilp[1].ins, reg+1);\r\n    }\r\n  } else {\r\n    return 0;  /* Cannot patch other instructions. */\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* Drop values for all instructions on jump list. */\r\nstatic void jmp_dropval(FuncState *fs, BCPos list)\r\n{\r\n  for (; list != NO_JMP; list = jmp_next(fs, list))\r\n    jmp_patchtestreg(fs, list, NO_REG);\r\n}\r\n\r\n/* Patch jump instruction to target. */\r\nstatic void jmp_patchins(FuncState *fs, BCPos pc, BCPos dest)\r\n{\r\n  BCIns *jmp = &fs->bcbase[pc].ins;\r\n  BCPos offset = dest-(pc+1)+BCBIAS_J;\r\n  lua_assert(dest != NO_JMP);\r\n  if (offset > BCMAX_D)\r\n    err_syntax(fs->ls, LJ_ERR_XJUMP);\r\n  setbc_d(jmp, offset);\r\n}\r\n\r\n/* Append to jump list. */\r\nstatic void jmp_append(FuncState *fs, BCPos *l1, BCPos l2)\r\n{\r\n  if (l2 == NO_JMP) {\r\n    return;\r\n  } else if (*l1 == NO_JMP) {\r\n    *l1 = l2;\r\n  } else {\r\n    BCPos list = *l1;\r\n    BCPos next;\r\n    while ((next = jmp_next(fs, list)) != NO_JMP)  /* Find last element. */\r\n      list = next;\r\n    jmp_patchins(fs, list, l2);\r\n  }\r\n}\r\n\r\n/* Patch jump list and preserve produced values. */\r\nstatic void jmp_patchval(FuncState *fs, BCPos list, BCPos vtarget,\r\n\t\t\t BCReg reg, BCPos dtarget)\r\n{\r\n  while (list != NO_JMP) {\r\n    BCPos next = jmp_next(fs, list);\r\n    if (jmp_patchtestreg(fs, list, reg))\r\n      jmp_patchins(fs, list, vtarget);  /* Jump to target with value. */\r\n    else\r\n      jmp_patchins(fs, list, dtarget);  /* Jump to default target. */\r\n    list = next;\r\n  }\r\n}\r\n\r\n/* Jump to following instruction. Append to list of pending jumps. */\r\nstatic void jmp_tohere(FuncState *fs, BCPos list)\r\n{\r\n  fs->lasttarget = fs->pc;\r\n  jmp_append(fs, &fs->jpc, list);\r\n}\r\n\r\n/* Patch jump list to target. */\r\nstatic void jmp_patch(FuncState *fs, BCPos list, BCPos target)\r\n{\r\n  if (target == fs->pc) {\r\n    jmp_tohere(fs, list);\r\n  } else {\r\n    lua_assert(target < fs->pc);\r\n    jmp_patchval(fs, list, target, NO_REG, target);\r\n  }\r\n}\r\n\r\n/* -- Bytecode register allocator ----------------------------------------- */\r\n\r\n/* Bump frame size. */\r\nstatic void bcreg_bump(FuncState *fs, BCReg n)\r\n{\r\n  BCReg sz = fs->freereg + n;\r\n  if (sz > fs->framesize) {\r\n    if (sz >= LJ_MAX_SLOTS)\r\n      err_syntax(fs->ls, LJ_ERR_XSLOTS);\r\n    fs->framesize = (uint8_t)sz;\r\n  }\r\n}\r\n\r\n/* Reserve registers. */\r\nstatic void bcreg_reserve(FuncState *fs, BCReg n)\r\n{\r\n  bcreg_bump(fs, n);\r\n  fs->freereg += n;\r\n}\r\n\r\n/* Free register. */\r\nstatic void bcreg_free(FuncState *fs, BCReg reg)\r\n{\r\n  if (reg >= fs->nactvar) {\r\n    fs->freereg--;\r\n    lua_assert(reg == fs->freereg);\r\n  }\r\n}\r\n\r\n/* Free register for expression. */\r\nstatic void expr_free(FuncState *fs, ExpDesc *e)\r\n{\r\n  if (e->k == VNONRELOC)\r\n    bcreg_free(fs, e->u.s.info);\r\n}\r\n\r\n/* -- Bytecode emitter ---------------------------------------------------- */\r\n\r\n/* Emit bytecode instruction. */\r\nstatic BCPos bcemit_INS(FuncState *fs, BCIns ins)\r\n{\r\n  BCPos pc = fs->pc;\r\n  LexState *ls = fs->ls;\r\n  jmp_patchval(fs, fs->jpc, pc, NO_REG, pc);\r\n  fs->jpc = NO_JMP;\r\n  if (LJ_UNLIKELY(pc >= fs->bclim)) {\r\n    ptrdiff_t base = fs->bcbase - ls->bcstack;\r\n    checklimit(fs, ls->sizebcstack, LJ_MAX_BCINS, \"bytecode instructions\");\r\n    lj_mem_growvec(fs->L, ls->bcstack, ls->sizebcstack, LJ_MAX_BCINS,BCInsLine);\r\n    fs->bclim = (BCPos)(ls->sizebcstack - base);\r\n    fs->bcbase = ls->bcstack + base;\r\n  }\r\n  fs->bcbase[pc].ins = ins;\r\n  fs->bcbase[pc].line = ls->lastline;\r\n  fs->pc = pc+1;\r\n  return pc;\r\n}\r\n\r\n#define bcemit_ABC(fs, o, a, b, c)\tbcemit_INS(fs, BCINS_ABC(o, a, b, c))\r\n#define bcemit_AD(fs, o, a, d)\t\tbcemit_INS(fs, BCINS_AD(o, a, d))\r\n#define bcemit_AJ(fs, o, a, j)\t\tbcemit_INS(fs, BCINS_AJ(o, a, j))\r\n\r\n#define bcptr(fs, e)\t\t\t(&(fs)->bcbase[(e)->u.s.info].ins)\r\n\r\n/* -- Bytecode emitter for expressions ------------------------------------ */\r\n\r\n/* Discharge non-constant expression to any register. */\r\nstatic void expr_discharge(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCIns ins;\r\n  if (e->k == VUPVAL) {\r\n    ins = BCINS_AD(BC_UGET, 0, e->u.s.info);\r\n  } else if (e->k == VGLOBAL) {\r\n    ins = BCINS_AD(BC_GGET, 0, const_str(fs, e));\r\n  } else if (e->k == VINDEXED) {\r\n    BCReg rc = e->u.s.aux;\r\n    if ((int32_t)rc < 0) {\r\n      ins = BCINS_ABC(BC_TGETS, 0, e->u.s.info, ~rc);\r\n    } else if (rc > BCMAX_C) {\r\n      ins = BCINS_ABC(BC_TGETB, 0, e->u.s.info, rc-(BCMAX_C+1));\r\n    } else {\r\n      bcreg_free(fs, rc);\r\n      ins = BCINS_ABC(BC_TGETV, 0, e->u.s.info, rc);\r\n    }\r\n    bcreg_free(fs, e->u.s.info);\r\n  } else if (e->k == VCALL) {\r\n    e->u.s.info = e->u.s.aux;\r\n    e->k = VNONRELOC;\r\n    return;\r\n  } else if (e->k == VLOCAL) {\r\n    e->k = VNONRELOC;\r\n    return;\r\n  } else {\r\n    return;\r\n  }\r\n  e->u.s.info = bcemit_INS(fs, ins);\r\n  e->k = VRELOCABLE;\r\n}\r\n\r\n/* Emit bytecode to set a range of registers to nil. */\r\nstatic void bcemit_nil(FuncState *fs, BCReg from, BCReg n)\r\n{\r\n  if (fs->pc > fs->lasttarget) {  /* No jumps to current position? */\r\n    BCIns *ip = &fs->bcbase[fs->pc-1].ins;\r\n    BCReg pto, pfrom = bc_a(*ip);\r\n    switch (bc_op(*ip)) {  /* Try to merge with the previous instruction. */\r\n    case BC_KPRI:\r\n      if (bc_d(*ip) != ~LJ_TNIL) break;\r\n      if (from == pfrom) {\r\n\tif (n == 1) return;\r\n      } else if (from == pfrom+1) {\r\n\tfrom = pfrom;\r\n\tn++;\r\n      } else {\r\n\tbreak;\r\n      }\r\n      *ip = BCINS_AD(BC_KNIL, from, from+n-1);  /* Replace KPRI. */\r\n      return;\r\n    case BC_KNIL:\r\n      pto = bc_d(*ip);\r\n      if (pfrom <= from && from <= pto+1) {  /* Can we connect both ranges? */\r\n\tif (from+n-1 > pto)\r\n\t  setbc_d(ip, from+n-1);  /* Patch previous instruction range. */\r\n\treturn;\r\n      }\r\n      break;\r\n    default:\r\n      break;\r\n    }\r\n  }\r\n  /* Emit new instruction or replace old instruction. */\r\n  bcemit_INS(fs, n == 1 ? BCINS_AD(BC_KPRI, from, VKNIL) :\r\n\t\t\t  BCINS_AD(BC_KNIL, from, from+n-1));\r\n}\r\n\r\n/* Discharge an expression to a specific register. Ignore branches. */\r\nstatic void expr_toreg_nobranch(FuncState *fs, ExpDesc *e, BCReg reg)\r\n{\r\n  BCIns ins;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKSTR) {\r\n    ins = BCINS_AD(BC_KSTR, reg, const_str(fs, e));\r\n  } else if (e->k == VKNUM) {\r\n#if LJ_DUALNUM\r\n    cTValue *tv = expr_numtv(e);\r\n    if (tvisint(tv) && checki16(intV(tv)))\r\n      ins = BCINS_AD(BC_KSHORT, reg, (BCReg)(uint16_t)intV(tv));\r\n    else\r\n#else\r\n    lua_Number n = expr_numberV(e);\r\n    int32_t k = lj_num2int(n);\r\n    if (checki16(k) && n == (lua_Number)k)\r\n      ins = BCINS_AD(BC_KSHORT, reg, (BCReg)(uint16_t)k);\r\n    else\r\n#endif\r\n      ins = BCINS_AD(BC_KNUM, reg, const_num(fs, e));\r\n#if LJ_HASFFI\r\n  } else if (e->k == VKCDATA) {\r\n    fs->flags |= PROTO_FFI;\r\n    ins = BCINS_AD(BC_KCDATA, reg,\r\n\t\t   const_gc(fs, obj2gco(cdataV(&e->u.nval)), LJ_TCDATA));\r\n#endif\r\n  } else if (e->k == VRELOCABLE) {\r\n    setbc_a(bcptr(fs, e), reg);\r\n    goto noins;\r\n  } else if (e->k == VNONRELOC) {\r\n    if (reg == e->u.s.info)\r\n      goto noins;\r\n    ins = BCINS_AD(BC_MOV, reg, e->u.s.info);\r\n  } else if (e->k == VKNIL) {\r\n    bcemit_nil(fs, reg, 1);\r\n    goto noins;\r\n  } else if (e->k <= VKTRUE) {\r\n    ins = BCINS_AD(BC_KPRI, reg, const_pri(e));\r\n  } else {\r\n    lua_assert(e->k == VVOID || e->k == VJMP);\r\n    return;\r\n  }\r\n  bcemit_INS(fs, ins);\r\nnoins:\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic BCPos bcemit_jmp(FuncState *fs);\r\n\r\n/* Discharge an expression to a specific register. */\r\nstatic void expr_toreg(FuncState *fs, ExpDesc *e, BCReg reg)\r\n{\r\n  expr_toreg_nobranch(fs, e, reg);\r\n  if (e->k == VJMP)\r\n    jmp_append(fs, &e->t, e->u.s.info);  /* Add it to the true jump list. */\r\n  if (expr_hasjump(e)) {  /* Discharge expression with branches. */\r\n    BCPos jend, jfalse = NO_JMP, jtrue = NO_JMP;\r\n    if (jmp_novalue(fs, e->t) || jmp_novalue(fs, e->f)) {\r\n      BCPos jval = (e->k == VJMP) ? NO_JMP : bcemit_jmp(fs);\r\n      jfalse = bcemit_AD(fs, BC_KPRI, reg, VKFALSE);\r\n      bcemit_AJ(fs, BC_JMP, fs->freereg, 1);\r\n      jtrue = bcemit_AD(fs, BC_KPRI, reg, VKTRUE);\r\n      jmp_tohere(fs, jval);\r\n    }\r\n    jend = fs->pc;\r\n    fs->lasttarget = jend;\r\n    jmp_patchval(fs, e->f, jend, reg, jfalse);\r\n    jmp_patchval(fs, e->t, jend, reg, jtrue);\r\n  }\r\n  e->f = e->t = NO_JMP;\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* Discharge an expression to the next free register. */\r\nstatic void expr_tonextreg(FuncState *fs, ExpDesc *e)\r\n{\r\n  expr_discharge(fs, e);\r\n  expr_free(fs, e);\r\n  bcreg_reserve(fs, 1);\r\n  expr_toreg(fs, e, fs->freereg - 1);\r\n}\r\n\r\n/* Discharge an expression to any register. */\r\nstatic BCReg expr_toanyreg(FuncState *fs, ExpDesc *e)\r\n{\r\n  expr_discharge(fs, e);\r\n  if (e->k == VNONRELOC) {\r\n    if (!expr_hasjump(e)) return e->u.s.info;  /* Already in a register. */\r\n    if (e->u.s.info >= fs->nactvar) {\r\n      expr_toreg(fs, e, e->u.s.info);  /* Discharge to temp. register. */\r\n      return e->u.s.info;\r\n    }\r\n  }\r\n  expr_tonextreg(fs, e);  /* Discharge to next register. */\r\n  return e->u.s.info;\r\n}\r\n\r\n/* Partially discharge expression to a value. */\r\nstatic void expr_toval(FuncState *fs, ExpDesc *e)\r\n{\r\n  if (expr_hasjump(e))\r\n    expr_toanyreg(fs, e);\r\n  else\r\n    expr_discharge(fs, e);\r\n}\r\n\r\n/* Emit store for LHS expression. */\r\nstatic void bcemit_store(FuncState *fs, ExpDesc *var, ExpDesc *e)\r\n{\r\n  BCIns ins;\r\n  if (var->k == VLOCAL) {\r\n    fs->ls->vstack[var->u.s.aux].info |= VSTACK_VAR_RW;\r\n    expr_free(fs, e);\r\n    expr_toreg(fs, e, var->u.s.info);\r\n    return;\r\n  } else if (var->k == VUPVAL) {\r\n    fs->ls->vstack[var->u.s.aux].info |= VSTACK_VAR_RW;\r\n    expr_toval(fs, e);\r\n    if (e->k <= VKTRUE)\r\n      ins = BCINS_AD(BC_USETP, var->u.s.info, const_pri(e));\r\n    else if (e->k == VKSTR)\r\n      ins = BCINS_AD(BC_USETS, var->u.s.info, const_str(fs, e));\r\n    else if (e->k == VKNUM)\r\n      ins = BCINS_AD(BC_USETN, var->u.s.info, const_num(fs, e));\r\n    else\r\n      ins = BCINS_AD(BC_USETV, var->u.s.info, expr_toanyreg(fs, e));\r\n  } else if (var->k == VGLOBAL) {\r\n    BCReg ra = expr_toanyreg(fs, e);\r\n    ins = BCINS_AD(BC_GSET, ra, const_str(fs, var));\r\n  } else {\r\n    BCReg ra, rc;\r\n    lua_assert(var->k == VINDEXED);\r\n    ra = expr_toanyreg(fs, e);\r\n    rc = var->u.s.aux;\r\n    if ((int32_t)rc < 0) {\r\n      ins = BCINS_ABC(BC_TSETS, ra, var->u.s.info, ~rc);\r\n    } else if (rc > BCMAX_C) {\r\n      ins = BCINS_ABC(BC_TSETB, ra, var->u.s.info, rc-(BCMAX_C+1));\r\n    } else {\r\n      /* Free late alloced key reg to avoid assert on free of value reg. */\r\n      /* This can only happen when called from expr_table(). */\r\n      lua_assert(e->k != VNONRELOC || ra < fs->nactvar ||\r\n\t\t rc < ra || (bcreg_free(fs, rc),1));\r\n      ins = BCINS_ABC(BC_TSETV, ra, var->u.s.info, rc);\r\n    }\r\n  }\r\n  bcemit_INS(fs, ins);\r\n  expr_free(fs, e);\r\n}\r\n\r\n/* Emit method lookup expression. */\r\nstatic void bcemit_method(FuncState *fs, ExpDesc *e, ExpDesc *key)\r\n{\r\n  BCReg idx, func, obj = expr_toanyreg(fs, e);\r\n  expr_free(fs, e);\r\n  func = fs->freereg;\r\n  bcemit_AD(fs, BC_MOV, func+1, obj);  /* Copy object to first argument. */\r\n  lua_assert(expr_isstrk(key));\r\n  idx = const_str(fs, key);\r\n  if (idx <= BCMAX_C) {\r\n    bcreg_reserve(fs, 2);\r\n    bcemit_ABC(fs, BC_TGETS, func, obj, idx);\r\n  } else {\r\n    bcreg_reserve(fs, 3);\r\n    bcemit_AD(fs, BC_KSTR, func+2, idx);\r\n    bcemit_ABC(fs, BC_TGETV, func, obj, func+2);\r\n    fs->freereg--;\r\n  }\r\n  e->u.s.info = func;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* -- Bytecode emitter for branches --------------------------------------- */\r\n\r\n/* Emit unconditional branch. */\r\nstatic BCPos bcemit_jmp(FuncState *fs)\r\n{\r\n  BCPos jpc = fs->jpc;\r\n  BCPos j = fs->pc - 1;\r\n  BCIns *ip = &fs->bcbase[j].ins;\r\n  fs->jpc = NO_JMP;\r\n  if ((int32_t)j >= (int32_t)fs->lasttarget && bc_op(*ip) == BC_UCLO) {\r\n    setbc_j(ip, NO_JMP);\r\n    fs->lasttarget = j+1;\r\n  } else {\r\n    j = bcemit_AJ(fs, BC_JMP, fs->freereg, NO_JMP);\r\n  }\r\n  jmp_append(fs, &j, jpc);\r\n  return j;\r\n}\r\n\r\n/* Invert branch condition of bytecode instruction. */\r\nstatic void invertcond(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCIns *ip = &fs->bcbase[e->u.s.info - 1].ins;\r\n  setbc_op(ip, bc_op(*ip)^1);\r\n}\r\n\r\n/* Emit conditional branch. */\r\nstatic BCPos bcemit_branch(FuncState *fs, ExpDesc *e, int cond)\r\n{\r\n  BCPos pc;\r\n  if (e->k == VRELOCABLE) {\r\n    BCIns *ip = bcptr(fs, e);\r\n    if (bc_op(*ip) == BC_NOT) {\r\n      *ip = BCINS_AD(cond ? BC_ISF : BC_IST, 0, bc_d(*ip));\r\n      return bcemit_jmp(fs);\r\n    }\r\n  }\r\n  if (e->k != VNONRELOC) {\r\n    bcreg_reserve(fs, 1);\r\n    expr_toreg_nobranch(fs, e, fs->freereg-1);\r\n  }\r\n  bcemit_AD(fs, cond ? BC_ISTC : BC_ISFC, NO_REG, e->u.s.info);\r\n  pc = bcemit_jmp(fs);\r\n  expr_free(fs, e);\r\n  return pc;\r\n}\r\n\r\n/* Emit branch on true condition. */\r\nstatic void bcemit_branch_t(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCPos pc;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKSTR || e->k == VKNUM || e->k == VKTRUE)\r\n    pc = NO_JMP;  /* Never jump. */\r\n  else if (e->k == VJMP)\r\n    invertcond(fs, e), pc = e->u.s.info;\r\n  else if (e->k == VKFALSE || e->k == VKNIL)\r\n    expr_toreg_nobranch(fs, e, NO_REG), pc = bcemit_jmp(fs);\r\n  else\r\n    pc = bcemit_branch(fs, e, 0);\r\n  jmp_append(fs, &e->f, pc);\r\n  jmp_tohere(fs, e->t);\r\n  e->t = NO_JMP;\r\n}\r\n\r\n/* Emit branch on false condition. */\r\nstatic void bcemit_branch_f(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCPos pc;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKNIL || e->k == VKFALSE)\r\n    pc = NO_JMP;  /* Never jump. */\r\n  else if (e->k == VJMP)\r\n    pc = e->u.s.info;\r\n  else if (e->k == VKSTR || e->k == VKNUM || e->k == VKTRUE)\r\n    expr_toreg_nobranch(fs, e, NO_REG), pc = bcemit_jmp(fs);\r\n  else\r\n    pc = bcemit_branch(fs, e, 1);\r\n  jmp_append(fs, &e->t, pc);\r\n  jmp_tohere(fs, e->f);\r\n  e->f = NO_JMP;\r\n}\r\n\r\n/* -- Bytecode emitter for operators -------------------------------------- */\r\n\r\n/* Try constant-folding of arithmetic operators. */\r\nstatic int foldarith(BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  TValue o;\r\n  lua_Number n;\r\n  if (!expr_isnumk_nojump(e1) || !expr_isnumk_nojump(e2)) return 0;\r\n  n = lj_vm_foldarith(expr_numberV(e1), expr_numberV(e2), (int)opr-OPR_ADD);\r\n  setnumV(&o, n);\r\n  if (tvisnan(&o) || tvismzero(&o)) return 0;  /* Avoid NaN and -0 as consts. */\r\n  if (LJ_DUALNUM) {\r\n    int32_t k = lj_num2int(n);\r\n    if ((lua_Number)k == n) {\r\n      setintV(&e1->u.nval, k);\r\n      return 1;\r\n    }\r\n  }\r\n  setnumV(&e1->u.nval, n);\r\n  return 1;\r\n}\r\n\r\n/* Emit arithmetic operator. */\r\nstatic void bcemit_arith(FuncState *fs, BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  BCReg rb, rc, t;\r\n  uint32_t op;\r\n  if (foldarith(opr, e1, e2))\r\n    return;\r\n  if (opr == OPR_POW) {\r\n    op = BC_POW;\r\n    rc = expr_toanyreg(fs, e2);\r\n    rb = expr_toanyreg(fs, e1);\r\n  } else {\r\n    op = opr-OPR_ADD+BC_ADDVV;\r\n    /* Must discharge 2nd operand first since VINDEXED might free regs. */\r\n    expr_toval(fs, e2);\r\n    if (expr_isnumk(e2) && (rc = const_num(fs, e2)) <= BCMAX_C)\r\n      op -= BC_ADDVV-BC_ADDVN;\r\n    else\r\n      rc = expr_toanyreg(fs, e2);\r\n    /* 1st operand discharged by bcemit_binop_left, but need KNUM/KSHORT. */\r\n    lua_assert(expr_isnumk(e1) || e1->k == VNONRELOC);\r\n    expr_toval(fs, e1);\r\n    /* Avoid two consts to satisfy bytecode constraints. */\r\n    if (expr_isnumk(e1) && !expr_isnumk(e2) &&\r\n\t(t = const_num(fs, e1)) <= BCMAX_B) {\r\n      rb = rc; rc = t; op -= BC_ADDVV-BC_ADDNV;\r\n    } else {\r\n      rb = expr_toanyreg(fs, e1);\r\n    }\r\n  }\r\n  /* Using expr_free might cause asserts if the order is wrong. */\r\n  if (e1->k == VNONRELOC && e1->u.s.info >= fs->nactvar) fs->freereg--;\r\n  if (e2->k == VNONRELOC && e2->u.s.info >= fs->nactvar) fs->freereg--;\r\n  e1->u.s.info = bcemit_ABC(fs, op, 0, rb, rc);\r\n  e1->k = VRELOCABLE;\r\n}\r\n\r\n/* Emit comparison operator. */\r\nstatic void bcemit_comp(FuncState *fs, BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  ExpDesc *eret = e1;\r\n  BCIns ins;\r\n  expr_toval(fs, e1);\r\n  if (opr == OPR_EQ || opr == OPR_NE) {\r\n    BCOp op = opr == OPR_EQ ? BC_ISEQV : BC_ISNEV;\r\n    BCReg ra;\r\n    if (expr_isk(e1)) { e1 = e2; e2 = eret; }  /* Need constant in 2nd arg. */\r\n    ra = expr_toanyreg(fs, e1);  /* First arg must be in a reg. */\r\n    expr_toval(fs, e2);\r\n    switch (e2->k) {\r\n    case VKNIL: case VKFALSE: case VKTRUE:\r\n      ins = BCINS_AD(op+(BC_ISEQP-BC_ISEQV), ra, const_pri(e2));\r\n      break;\r\n    case VKSTR:\r\n      ins = BCINS_AD(op+(BC_ISEQS-BC_ISEQV), ra, const_str(fs, e2));\r\n      break;\r\n    case VKNUM:\r\n      ins = BCINS_AD(op+(BC_ISEQN-BC_ISEQV), ra, const_num(fs, e2));\r\n      break;\r\n    default:\r\n      ins = BCINS_AD(op, ra, expr_toanyreg(fs, e2));\r\n      break;\r\n    }\r\n  } else {\r\n    uint32_t op = opr-OPR_LT+BC_ISLT;\r\n    BCReg ra, rd;\r\n    if ((op-BC_ISLT) & 1) {  /* GT -> LT, GE -> LE */\r\n      e1 = e2; e2 = eret;  /* Swap operands. */\r\n      op = ((op-BC_ISLT)^3)+BC_ISLT;\r\n      expr_toval(fs, e1);\r\n    }\r\n    rd = expr_toanyreg(fs, e2);\r\n    ra = expr_toanyreg(fs, e1);\r\n    ins = BCINS_AD(op, ra, rd);\r\n  }\r\n  /* Using expr_free might cause asserts if the order is wrong. */\r\n  if (e1->k == VNONRELOC && e1->u.s.info >= fs->nactvar) fs->freereg--;\r\n  if (e2->k == VNONRELOC && e2->u.s.info >= fs->nactvar) fs->freereg--;\r\n  bcemit_INS(fs, ins);\r\n  eret->u.s.info = bcemit_jmp(fs);\r\n  eret->k = VJMP;\r\n}\r\n\r\n/* Fixup left side of binary operator. */\r\nstatic void bcemit_binop_left(FuncState *fs, BinOpr op, ExpDesc *e)\r\n{\r\n  if (op == OPR_AND) {\r\n    bcemit_branch_t(fs, e);\r\n  } else if (op == OPR_OR) {\r\n    bcemit_branch_f(fs, e);\r\n  } else if (op == OPR_CONCAT) {\r\n    expr_tonextreg(fs, e);\r\n  } else if (op == OPR_EQ || op == OPR_NE) {\r\n    if (!expr_isk_nojump(e)) expr_toanyreg(fs, e);\r\n  } else {\r\n    if (!expr_isnumk_nojump(e)) expr_toanyreg(fs, e);\r\n  }\r\n}\r\n\r\n/* Emit binary operator. */\r\nstatic void bcemit_binop(FuncState *fs, BinOpr op, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  if (op <= OPR_POW) {\r\n    bcemit_arith(fs, op, e1, e2);\r\n  } else if (op == OPR_AND) {\r\n    lua_assert(e1->t == NO_JMP);  /* List must be closed. */\r\n    expr_discharge(fs, e2);\r\n    jmp_append(fs, &e2->f, e1->f);\r\n    *e1 = *e2;\r\n  } else if (op == OPR_OR) {\r\n    lua_assert(e1->f == NO_JMP);  /* List must be closed. */\r\n    expr_discharge(fs, e2);\r\n    jmp_append(fs, &e2->t, e1->t);\r\n    *e1 = *e2;\r\n  } else if (op == OPR_CONCAT) {\r\n    expr_toval(fs, e2);\r\n    if (e2->k == VRELOCABLE && bc_op(*bcptr(fs, e2)) == BC_CAT) {\r\n      lua_assert(e1->u.s.info == bc_b(*bcptr(fs, e2))-1);\r\n      expr_free(fs, e1);\r\n      setbc_b(bcptr(fs, e2), e1->u.s.info);\r\n      e1->u.s.info = e2->u.s.info;\r\n    } else {\r\n      expr_tonextreg(fs, e2);\r\n      expr_free(fs, e2);\r\n      expr_free(fs, e1);\r\n      e1->u.s.info = bcemit_ABC(fs, BC_CAT, 0, e1->u.s.info, e2->u.s.info);\r\n    }\r\n    e1->k = VRELOCABLE;\r\n  } else {\r\n    lua_assert(op == OPR_NE || op == OPR_EQ ||\r\n\t       op == OPR_LT || op == OPR_GE || op == OPR_LE || op == OPR_GT);\r\n    bcemit_comp(fs, op, e1, e2);\r\n  }\r\n}\r\n\r\n/* Emit unary operator. */\r\nstatic void bcemit_unop(FuncState *fs, BCOp op, ExpDesc *e)\r\n{\r\n  if (op == BC_NOT) {\r\n    /* Swap true and false lists. */\r\n    { BCPos temp = e->f; e->f = e->t; e->t = temp; }\r\n    jmp_dropval(fs, e->f);\r\n    jmp_dropval(fs, e->t);\r\n    expr_discharge(fs, e);\r\n    if (e->k == VKNIL || e->k == VKFALSE) {\r\n      e->k = VKTRUE;\r\n      return;\r\n    } else if (expr_isk(e) || (LJ_HASFFI && e->k == VKCDATA)) {\r\n      e->k = VKFALSE;\r\n      return;\r\n    } else if (e->k == VJMP) {\r\n      invertcond(fs, e);\r\n      return;\r\n    } else if (e->k == VRELOCABLE) {\r\n      bcreg_reserve(fs, 1);\r\n      setbc_a(bcptr(fs, e), fs->freereg-1);\r\n      e->u.s.info = fs->freereg-1;\r\n      e->k = VNONRELOC;\r\n    } else {\r\n      lua_assert(e->k == VNONRELOC);\r\n    }\r\n  } else {\r\n    lua_assert(op == BC_UNM || op == BC_LEN);\r\n    if (op == BC_UNM && !expr_hasjump(e)) {  /* Constant-fold negations. */\r\n#if LJ_HASFFI\r\n      if (e->k == VKCDATA) {  /* Fold in-place since cdata is not interned. */\r\n\tGCcdata *cd = cdataV(&e->u.nval);\r\n\tint64_t *p = (int64_t *)cdataptr(cd);\r\n\tif (cd->ctypeid == CTID_COMPLEX_DOUBLE)\r\n\t  p[1] ^= (int64_t)U64x(80000000,00000000);\r\n\telse\r\n\t  *p = -*p;\r\n\treturn;\r\n      } else\r\n#endif\r\n      if (expr_isnumk(e) && !expr_numiszero(e)) {  /* Avoid folding to -0. */\r\n\tTValue *o = expr_numtv(e);\r\n\tif (tvisint(o)) {\r\n\t  int32_t k = intV(o);\r\n\t  if (k == -k)\r\n\t    setnumV(o, -(lua_Number)k);\r\n\t  else\r\n\t    setintV(o, -k);\r\n\t  return;\r\n\t} else {\r\n\t  o->u64 ^= U64x(80000000,00000000);\r\n\t  return;\r\n\t}\r\n      }\r\n    }\r\n    expr_toanyreg(fs, e);\r\n  }\r\n  expr_free(fs, e);\r\n  e->u.s.info = bcemit_AD(fs, op, 0, e->u.s.info);\r\n  e->k = VRELOCABLE;\r\n}\r\n\r\n/* -- Lexer support ------------------------------------------------------- */\r\n\r\n/* Check and consume optional token. */\r\nstatic int lex_opt(LexState *ls, LexToken tok)\r\n{\r\n  if (ls->token == tok) {\r\n    lj_lex_next(ls);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check and consume token. */\r\nstatic void lex_check(LexState *ls, LexToken tok)\r\n{\r\n  if (ls->token != tok)\r\n    err_token(ls, tok);\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Check for matching token. */\r\nstatic void lex_match(LexState *ls, LexToken what, LexToken who, BCLine line)\r\n{\r\n  if (!lex_opt(ls, what)) {\r\n    if (line == ls->linenumber) {\r\n      err_token(ls, what);\r\n    } else {\r\n      const char *swhat = lj_lex_token2str(ls, what);\r\n      const char *swho = lj_lex_token2str(ls, who);\r\n      lj_lex_error(ls, ls->token, LJ_ERR_XMATCH, swhat, swho, line);\r\n    }\r\n  }\r\n}\r\n\r\n/* Check for string token. */\r\nstatic GCstr *lex_str(LexState *ls)\r\n{\r\n  GCstr *s;\r\n  if (ls->token != TK_name && (LJ_52 || ls->token != TK_goto))\r\n    err_token(ls, TK_name);\r\n  s = strV(&ls->tokenval);\r\n  lj_lex_next(ls);\r\n  return s;\r\n}\r\n\r\n/* -- Variable handling --------------------------------------------------- */\r\n\r\n#define var_get(ls, fs, i)\t((ls)->vstack[(fs)->varmap[(i)]])\r\n\r\n/* Define a new local variable. */\r\nstatic void var_new(LexState *ls, BCReg n, GCstr *name)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  MSize vtop = ls->vtop;\r\n  checklimit(fs, fs->nactvar+n, LJ_MAX_LOCVAR, \"local variables\");\r\n  if (LJ_UNLIKELY(vtop >= ls->sizevstack)) {\r\n    if (ls->sizevstack >= LJ_MAX_VSTACK)\r\n      lj_lex_error(ls, 0, LJ_ERR_XLIMC, LJ_MAX_VSTACK);\r\n    lj_mem_growvec(ls->L, ls->vstack, ls->sizevstack, LJ_MAX_VSTACK, VarInfo);\r\n  }\r\n  lua_assert((uintptr_t)name < VARNAME__MAX ||\r\n\t     lj_tab_getstr(fs->kt, name) != NULL);\r\n  /* NOBARRIER: name is anchored in fs->kt and ls->vstack is not a GCobj. */\r\n  setgcref(ls->vstack[vtop].name, obj2gco(name));\r\n  fs->varmap[fs->nactvar+n] = (uint16_t)vtop;\r\n  ls->vtop = vtop+1;\r\n}\r\n\r\n#define var_new_lit(ls, n, v) \\\r\n  var_new(ls, (n), lj_parse_keepstr(ls, \"\" v, sizeof(v)-1))\r\n\r\n#define var_new_fixed(ls, n, vn) \\\r\n  var_new(ls, (n), (GCstr *)(uintptr_t)(vn))\r\n\r\n/* Add local variables. */\r\nstatic void var_add(LexState *ls, BCReg nvars)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg nactvar = fs->nactvar;\r\n  while (nvars--) {\r\n    VarInfo *v = &var_get(ls, fs, nactvar);\r\n    v->startpc = fs->pc;\r\n    v->slot = nactvar++;\r\n    v->info = 0;\r\n  }\r\n  fs->nactvar = nactvar;\r\n}\r\n\r\n/* Remove local variables. */\r\nstatic void var_remove(LexState *ls, BCReg tolevel)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  while (fs->nactvar > tolevel)\r\n    var_get(ls, fs, --fs->nactvar).endpc = fs->pc;\r\n}\r\n\r\n/* Lookup local variable name. */\r\nstatic BCReg var_lookup_local(FuncState *fs, GCstr *n)\r\n{\r\n  int i;\r\n  for (i = fs->nactvar-1; i >= 0; i--) {\r\n    if (n == strref(var_get(fs->ls, fs, i).name))\r\n      return (BCReg)i;\r\n  }\r\n  return (BCReg)-1;  /* Not found. */\r\n}\r\n\r\n/* Lookup or add upvalue index. */\r\nstatic MSize var_lookup_uv(FuncState *fs, MSize vidx, ExpDesc *e)\r\n{\r\n  MSize i, n = fs->nuv;\r\n  for (i = 0; i < n; i++)\r\n    if (fs->uvmap[i] == vidx)\r\n      return i;  /* Already exists. */\r\n  /* Otherwise create a new one. */\r\n  checklimit(fs, fs->nuv, LJ_MAX_UPVAL, \"upvalues\");\r\n  lua_assert(e->k == VLOCAL || e->k == VUPVAL);\r\n  fs->uvmap[n] = (uint16_t)vidx;\r\n  fs->uvtmp[n] = (uint16_t)(e->k == VLOCAL ? vidx : LJ_MAX_VSTACK+e->u.s.info);\r\n  fs->nuv = n+1;\r\n  return n;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void fscope_uvmark(FuncState *fs, BCReg level);\r\n\r\n/* Recursively lookup variables in enclosing functions. */\r\nstatic MSize var_lookup_(FuncState *fs, GCstr *name, ExpDesc *e, int first)\r\n{\r\n  if (fs) {\r\n    BCReg reg = var_lookup_local(fs, name);\r\n    if ((int32_t)reg >= 0) {  /* Local in this function? */\r\n      expr_init(e, VLOCAL, reg);\r\n      if (!first)\r\n\tfscope_uvmark(fs, reg);  /* Scope now has an upvalue. */\r\n      return (MSize)(e->u.s.aux = (uint32_t)fs->varmap[reg]);\r\n    } else {\r\n      MSize vidx = var_lookup_(fs->prev, name, e, 0);  /* Var in outer func? */\r\n      if ((int32_t)vidx >= 0) {  /* Yes, make it an upvalue here. */\r\n\te->u.s.info = (uint8_t)var_lookup_uv(fs, vidx, e);\r\n\te->k = VUPVAL;\r\n\treturn vidx;\r\n      }\r\n    }\r\n  } else {  /* Not found in any function, must be a global. */\r\n    expr_init(e, VGLOBAL, 0);\r\n    e->u.sval = name;\r\n  }\r\n  return (MSize)-1;  /* Global. */\r\n}\r\n\r\n/* Lookup variable name. */\r\n#define var_lookup(ls, e) \\\r\n  var_lookup_((ls)->fs, lex_str(ls), (e), 1)\r\n\r\n/* -- Goto an label handling ---------------------------------------------- */\r\n\r\n/* Add a new goto or label. */\r\nstatic MSize gola_new(LexState *ls, GCstr *name, uint8_t info, BCPos pc)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  MSize vtop = ls->vtop;\r\n  if (LJ_UNLIKELY(vtop >= ls->sizevstack)) {\r\n    if (ls->sizevstack >= LJ_MAX_VSTACK)\r\n      lj_lex_error(ls, 0, LJ_ERR_XLIMC, LJ_MAX_VSTACK);\r\n    lj_mem_growvec(ls->L, ls->vstack, ls->sizevstack, LJ_MAX_VSTACK, VarInfo);\r\n  }\r\n  lua_assert(name == NAME_BREAK || lj_tab_getstr(fs->kt, name) != NULL);\r\n  /* NOBARRIER: name is anchored in fs->kt and ls->vstack is not a GCobj. */\r\n  setgcref(ls->vstack[vtop].name, obj2gco(name));\r\n  ls->vstack[vtop].startpc = pc;\r\n  ls->vstack[vtop].slot = (uint8_t)fs->nactvar;\r\n  ls->vstack[vtop].info = info;\r\n  ls->vtop = vtop+1;\r\n  return vtop;\r\n}\r\n\r\n#define gola_isgoto(v)\t\t((v)->info & VSTACK_GOTO)\r\n#define gola_islabel(v)\t\t((v)->info & VSTACK_LABEL)\r\n#define gola_isgotolabel(v)\t((v)->info & (VSTACK_GOTO|VSTACK_LABEL))\r\n\r\n/* Patch goto to jump to label. */\r\nstatic void gola_patch(LexState *ls, VarInfo *vg, VarInfo *vl)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos pc = vg->startpc;\r\n  setgcrefnull(vg->name);  /* Invalidate pending goto. */\r\n  setbc_a(&fs->bcbase[pc].ins, vl->slot);\r\n  jmp_patch(fs, pc, vl->startpc);\r\n}\r\n\r\n/* Patch goto to close upvalues. */\r\nstatic void gola_close(LexState *ls, VarInfo *vg)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos pc = vg->startpc;\r\n  BCIns *ip = &fs->bcbase[pc].ins;\r\n  lua_assert(gola_isgoto(vg));\r\n  lua_assert(bc_op(*ip) == BC_JMP || bc_op(*ip) == BC_UCLO);\r\n  setbc_a(ip, vg->slot);\r\n  if (bc_op(*ip) == BC_JMP) {\r\n    BCPos next = jmp_next(fs, pc);\r\n    if (next != NO_JMP) jmp_patch(fs, next, pc);  /* Jump to UCLO. */\r\n    setbc_op(ip, BC_UCLO);  /* Turn into UCLO. */\r\n    setbc_j(ip, NO_JMP);\r\n  }\r\n}\r\n\r\n/* Resolve pending forward gotos for label. */\r\nstatic void gola_resolve(LexState *ls, FuncScope *bl, MSize idx)\r\n{\r\n  VarInfo *vg = ls->vstack + bl->vstart;\r\n  VarInfo *vl = ls->vstack + idx;\r\n  for (; vg < vl; vg++)\r\n    if (gcrefeq(vg->name, vl->name) && gola_isgoto(vg)) {\r\n      if (vg->slot < vl->slot) {\r\n\tGCstr *name = strref(var_get(ls, ls->fs, vg->slot).name);\r\n\tlua_assert((uintptr_t)name >= VARNAME__MAX);\r\n\tls->linenumber = ls->fs->bcbase[vg->startpc].line;\r\n\tlua_assert(strref(vg->name) != NAME_BREAK);\r\n\tlj_lex_error(ls, 0, LJ_ERR_XGSCOPE,\r\n\t\t     strdata(strref(vg->name)), strdata(name));\r\n      }\r\n      gola_patch(ls, vg, vl);\r\n    }\r\n}\r\n\r\n/* Fixup remaining gotos and labels for scope. */\r\nstatic void gola_fixup(LexState *ls, FuncScope *bl)\r\n{\r\n  VarInfo *v = ls->vstack + bl->vstart;\r\n  VarInfo *ve = ls->vstack + ls->vtop;\r\n  for (; v < ve; v++) {\r\n    GCstr *name = strref(v->name);\r\n    if (name != NULL) {  /* Only consider remaining valid gotos/labels. */\r\n      if (gola_islabel(v)) {\r\n\tVarInfo *vg;\r\n\tsetgcrefnull(v->name);  /* Invalidate label that goes out of scope. */\r\n\tfor (vg = v+1; vg < ve; vg++)  /* Resolve pending backward gotos. */\r\n\t  if (strref(vg->name) == name && gola_isgoto(vg)) {\r\n\t    if ((bl->flags&FSCOPE_UPVAL) && vg->slot > v->slot)\r\n\t      gola_close(ls, vg);\r\n\t    gola_patch(ls, vg, v);\r\n\t  }\r\n      } else if (gola_isgoto(v)) {\r\n\tif (bl->prev) {  /* Propagate goto or break to outer scope. */\r\n\t  bl->prev->flags |= name == NAME_BREAK ? FSCOPE_BREAK : FSCOPE_GOLA;\r\n\t  v->slot = bl->nactvar;\r\n\t  if ((bl->flags & FSCOPE_UPVAL))\r\n\t    gola_close(ls, v);\r\n\t} else {  /* No outer scope: undefined goto label or no loop. */\r\n\t  ls->linenumber = ls->fs->bcbase[v->startpc].line;\r\n\t  if (name == NAME_BREAK)\r\n\t    lj_lex_error(ls, 0, LJ_ERR_XBREAK);\r\n\t  else\r\n\t    lj_lex_error(ls, 0, LJ_ERR_XLUNDEF, strdata(name));\r\n\t}\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Find existing label. */\r\nstatic VarInfo *gola_findlabel(LexState *ls, GCstr *name)\r\n{\r\n  VarInfo *v = ls->vstack + ls->fs->bl->vstart;\r\n  VarInfo *ve = ls->vstack + ls->vtop;\r\n  for (; v < ve; v++)\r\n    if (strref(v->name) == name && gola_islabel(v))\r\n      return v;\r\n  return NULL;\r\n}\r\n\r\n/* -- Scope handling ------------------------------------------------------ */\r\n\r\n/* Begin a scope. */\r\nstatic void fscope_begin(FuncState *fs, FuncScope *bl, int flags)\r\n{\r\n  bl->nactvar = (uint8_t)fs->nactvar;\r\n  bl->flags = flags;\r\n  bl->vstart = fs->ls->vtop;\r\n  bl->prev = fs->bl;\r\n  fs->bl = bl;\r\n  lua_assert(fs->freereg == fs->nactvar);\r\n}\r\n\r\n/* End a scope. */\r\nstatic void fscope_end(FuncState *fs)\r\n{\r\n  FuncScope *bl = fs->bl;\r\n  LexState *ls = fs->ls;\r\n  fs->bl = bl->prev;\r\n  var_remove(ls, bl->nactvar);\r\n  fs->freereg = fs->nactvar;\r\n  lua_assert(bl->nactvar == fs->nactvar);\r\n  if ((bl->flags & (FSCOPE_UPVAL|FSCOPE_NOCLOSE)) == FSCOPE_UPVAL)\r\n    bcemit_AJ(fs, BC_UCLO, bl->nactvar, 0);\r\n  if ((bl->flags & FSCOPE_BREAK)) {\r\n    if ((bl->flags & FSCOPE_LOOP)) {\r\n      MSize idx = gola_new(ls, NAME_BREAK, VSTACK_LABEL, fs->pc);\r\n      ls->vtop = idx;  /* Drop break label immediately. */\r\n      gola_resolve(ls, bl, idx);\r\n      return;\r\n    }  /* else: need the fixup step to propagate the breaks. */\r\n  } else if (!(bl->flags & FSCOPE_GOLA)) {\r\n    return;\r\n  }\r\n  gola_fixup(ls, bl);\r\n}\r\n\r\n/* Mark scope as having an upvalue. */\r\nstatic void fscope_uvmark(FuncState *fs, BCReg level)\r\n{\r\n  FuncScope *bl;\r\n  for (bl = fs->bl; bl && bl->nactvar > level; bl = bl->prev)\r\n    ;\r\n  if (bl)\r\n    bl->flags |= FSCOPE_UPVAL;\r\n}\r\n\r\n/* -- Function state management ------------------------------------------- */\r\n\r\n/* Fixup bytecode for prototype. */\r\nstatic void fs_fixup_bc(FuncState *fs, GCproto *pt, BCIns *bc, MSize n)\r\n{\r\n  BCInsLine *base = fs->bcbase;\r\n  MSize i;\r\n  pt->sizebc = n;\r\n  bc[0] = BCINS_AD((fs->flags & PROTO_VARARG) ? BC_FUNCV : BC_FUNCF,\r\n\t\t   fs->framesize, 0);\r\n  for (i = 1; i < n; i++)\r\n    bc[i] = base[i].ins;\r\n}\r\n\r\n/* Fixup upvalues for child prototype, step #2. */\r\nstatic void fs_fixup_uv2(FuncState *fs, GCproto *pt)\r\n{\r\n  VarInfo *vstack = fs->ls->vstack;\r\n  uint16_t *uv = proto_uv(pt);\r\n  MSize i, n = pt->sizeuv;\r\n  for (i = 0; i < n; i++) {\r\n    VarIndex vidx = uv[i];\r\n    if (vidx >= LJ_MAX_VSTACK)\r\n      uv[i] = vidx - LJ_MAX_VSTACK;\r\n    else if ((vstack[vidx].info & VSTACK_VAR_RW))\r\n      uv[i] = vstack[vidx].slot | PROTO_UV_LOCAL;\r\n    else\r\n      uv[i] = vstack[vidx].slot | PROTO_UV_LOCAL | PROTO_UV_IMMUTABLE;\r\n  }\r\n}\r\n\r\n/* Fixup constants for prototype. */\r\nstatic void fs_fixup_k(FuncState *fs, GCproto *pt, void *kptr)\r\n{\r\n  GCtab *kt;\r\n  TValue *array;\r\n  Node *node;\r\n  MSize i, hmask;\r\n  checklimitgt(fs, fs->nkn, BCMAX_D+1, \"constants\");\r\n  checklimitgt(fs, fs->nkgc, BCMAX_D+1, \"constants\");\r\n  setmref(pt->k, kptr);\r\n  pt->sizekn = fs->nkn;\r\n  pt->sizekgc = fs->nkgc;\r\n  kt = fs->kt;\r\n  array = tvref(kt->array);\r\n  for (i = 0; i < kt->asize; i++)\r\n    if (tvhaskslot(&array[i])) {\r\n      TValue *tv = &((TValue *)kptr)[tvkslot(&array[i])];\r\n      if (LJ_DUALNUM)\r\n\tsetintV(tv, (int32_t)i);\r\n      else\r\n\tsetnumV(tv, (lua_Number)i);\r\n    }\r\n  node = noderef(kt->node);\r\n  hmask = kt->hmask;\r\n  for (i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    if (tvhaskslot(&n->val)) {\r\n      ptrdiff_t kidx = (ptrdiff_t)tvkslot(&n->val);\r\n      lua_assert(!tvisint(&n->key));\r\n      if (tvisnum(&n->key)) {\r\n\tTValue *tv = &((TValue *)kptr)[kidx];\r\n\tif (LJ_DUALNUM) {\r\n\t  lua_Number nn = numV(&n->key);\r\n\t  int32_t k = lj_num2int(nn);\r\n\t  lua_assert(!tvismzero(&n->key));\r\n\t  if ((lua_Number)k == nn)\r\n\t    setintV(tv, k);\r\n\t  else\r\n\t    *tv = n->key;\r\n\t} else {\r\n\t  *tv = n->key;\r\n\t}\r\n      } else {\r\n\tGCobj *o = gcV(&n->key);\r\n\tsetgcref(((GCRef *)kptr)[~kidx], o);\r\n\tlj_gc_objbarrier(fs->L, pt, o);\r\n\tif (tvisproto(&n->key))\r\n\t  fs_fixup_uv2(fs, gco2pt(o));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Fixup upvalues for prototype, step #1. */\r\nstatic void fs_fixup_uv1(FuncState *fs, GCproto *pt, uint16_t *uv)\r\n{\r\n  setmref(pt->uv, uv);\r\n  pt->sizeuv = fs->nuv;\r\n  memcpy(uv, fs->uvtmp, fs->nuv*sizeof(VarIndex));\r\n}\r\n\r\n#ifndef LUAJIT_DISABLE_DEBUGINFO\r\n/* Prepare lineinfo for prototype. */\r\nstatic size_t fs_prep_line(FuncState *fs, BCLine numline)\r\n{\r\n  return (fs->pc-1) << (numline < 256 ? 0 : numline < 65536 ? 1 : 2);\r\n}\r\n\r\n/* Fixup lineinfo for prototype. */\r\nstatic void fs_fixup_line(FuncState *fs, GCproto *pt,\r\n\t\t\t  void *lineinfo, BCLine numline)\r\n{\r\n  BCInsLine *base = fs->bcbase + 1;\r\n  BCLine first = fs->linedefined;\r\n  MSize i = 0, n = fs->pc-1;\r\n  pt->firstline = fs->linedefined;\r\n  pt->numline = numline;\r\n  setmref(pt->lineinfo, lineinfo);\r\n  if (LJ_LIKELY(numline < 256)) {\r\n    uint8_t *li = (uint8_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0 && delta < 256);\r\n      li[i] = (uint8_t)delta;\r\n    } while (++i < n);\r\n  } else if (LJ_LIKELY(numline < 65536)) {\r\n    uint16_t *li = (uint16_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0 && delta < 65536);\r\n      li[i] = (uint16_t)delta;\r\n    } while (++i < n);\r\n  } else {\r\n    uint32_t *li = (uint32_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0);\r\n      li[i] = (uint32_t)delta;\r\n    } while (++i < n);\r\n  }\r\n}\r\n\r\n/* Resize buffer if needed. */\r\nstatic LJ_NOINLINE void fs_buf_resize(LexState *ls, MSize len)\r\n{\r\n  MSize sz = ls->sb.sz * 2;\r\n  while (ls->sb.n + len > sz) sz = sz * 2;\r\n  lj_str_resizebuf(ls->L, &ls->sb, sz);\r\n}\r\n\r\nstatic LJ_AINLINE void fs_buf_need(LexState *ls, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ls->sb.n + len > ls->sb.sz))\r\n    fs_buf_resize(ls, len);\r\n}\r\n\r\n/* Add string to buffer. */\r\nstatic void fs_buf_str(LexState *ls, const char *str, MSize len)\r\n{\r\n  char *p = ls->sb.buf + ls->sb.n;\r\n  MSize i;\r\n  ls->sb.n += len;\r\n  for (i = 0; i < len; i++) p[i] = str[i];\r\n}\r\n\r\n/* Add ULEB128 value to buffer. */\r\nstatic void fs_buf_uleb128(LexState *ls, uint32_t v)\r\n{\r\n  MSize n = ls->sb.n;\r\n  uint8_t *p = (uint8_t *)ls->sb.buf;\r\n  for (; v >= 0x80; v >>= 7)\r\n    p[n++] = (uint8_t)((v & 0x7f) | 0x80);\r\n  p[n++] = (uint8_t)v;\r\n  ls->sb.n = n;\r\n}\r\n\r\n/* Prepare variable info for prototype. */\r\nstatic size_t fs_prep_var(LexState *ls, FuncState *fs, size_t *ofsvar)\r\n{\r\n  VarInfo *vs =ls->vstack, *ve;\r\n  MSize i, n;\r\n  BCPos lastpc;\r\n  lj_str_resetbuf(&ls->sb);  /* Copy to temp. string buffer. */\r\n  /* Store upvalue names. */\r\n  for (i = 0, n = fs->nuv; i < n; i++) {\r\n    GCstr *s = strref(vs[fs->uvmap[i]].name);\r\n    MSize len = s->len+1;\r\n    fs_buf_need(ls, len);\r\n    fs_buf_str(ls, strdata(s), len);\r\n  }\r\n  *ofsvar = ls->sb.n;\r\n  lastpc = 0;\r\n  /* Store local variable names and compressed ranges. */\r\n  for (ve = vs + ls->vtop, vs += fs->vbase; vs < ve; vs++) {\r\n    if (!gola_isgotolabel(vs)) {\r\n      GCstr *s = strref(vs->name);\r\n      BCPos startpc;\r\n      if ((uintptr_t)s < VARNAME__MAX) {\r\n\tfs_buf_need(ls, 1 + 2*5);\r\n\tls->sb.buf[ls->sb.n++] = (uint8_t)(uintptr_t)s;\r\n      } else {\r\n\tMSize len = s->len+1;\r\n\tfs_buf_need(ls, len + 2*5);\r\n\tfs_buf_str(ls, strdata(s), len);\r\n      }\r\n      startpc = vs->startpc;\r\n      fs_buf_uleb128(ls, startpc-lastpc);\r\n      fs_buf_uleb128(ls, vs->endpc-startpc);\r\n      lastpc = startpc;\r\n    }\r\n  }\r\n  fs_buf_need(ls, 1);\r\n  ls->sb.buf[ls->sb.n++] = '\\0';  /* Terminator for varinfo. */\r\n  return ls->sb.n;\r\n}\r\n\r\n/* Fixup variable info for prototype. */\r\nstatic void fs_fixup_var(LexState *ls, GCproto *pt, uint8_t *p, size_t ofsvar)\r\n{\r\n  setmref(pt->uvinfo, p);\r\n  setmref(pt->varinfo, (char *)p + ofsvar);\r\n  memcpy(p, ls->sb.buf, ls->sb.n);  /* Copy from temp. string buffer. */\r\n}\r\n#else\r\n\r\n/* Initialize with empty debug info, if disabled. */\r\n#define fs_prep_line(fs, numline)\t\t(UNUSED(numline), 0)\r\n#define fs_fixup_line(fs, pt, li, numline) \\\r\n  pt->firstline = pt->numline = 0, setmref((pt)->lineinfo, NULL)\r\n#define fs_prep_var(ls, fs, ofsvar)\t\t(UNUSED(ofsvar), 0)\r\n#define fs_fixup_var(ls, pt, p, ofsvar) \\\r\n  setmref((pt)->uvinfo, NULL), setmref((pt)->varinfo, NULL)\r\n\r\n#endif\r\n\r\n/* Check if bytecode op returns. */\r\nstatic int bcopisret(BCOp op)\r\n{\r\n  switch (op) {\r\n  case BC_CALLMT: case BC_CALLT:\r\n  case BC_RETM: case BC_RET: case BC_RET0: case BC_RET1:\r\n    return 1;\r\n  default:\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Fixup return instruction for prototype. */\r\nstatic void fs_fixup_ret(FuncState *fs)\r\n{\r\n  BCPos lastpc = fs->pc;\r\n  if (lastpc <= fs->lasttarget || !bcopisret(bc_op(fs->bcbase[lastpc-1].ins))) {\r\n    if ((fs->bl->flags & FSCOPE_UPVAL))\r\n      bcemit_AJ(fs, BC_UCLO, 0, 0);\r\n    bcemit_AD(fs, BC_RET0, 0, 1);  /* Need final return. */\r\n  }\r\n  fs->bl->flags |= FSCOPE_NOCLOSE;  /* Handled above. */\r\n  fscope_end(fs);\r\n  lua_assert(fs->bl == NULL);\r\n  /* May need to fixup returns encoded before first function was created. */\r\n  if (fs->flags & PROTO_FIXUP_RETURN) {\r\n    BCPos pc;\r\n    for (pc = 1; pc < lastpc; pc++) {\r\n      BCIns ins = fs->bcbase[pc].ins;\r\n      BCPos offset;\r\n      switch (bc_op(ins)) {\r\n      case BC_CALLMT: case BC_CALLT:\r\n      case BC_RETM: case BC_RET: case BC_RET0: case BC_RET1:\r\n\toffset = bcemit_INS(fs, ins);  /* Copy original instruction. */\r\n\tfs->bcbase[offset].line = fs->bcbase[pc].line;\r\n\toffset = offset-(pc+1)+BCBIAS_J;\r\n\tif (offset > BCMAX_D)\r\n\t  err_syntax(fs->ls, LJ_ERR_XFIXUP);\r\n\t/* Replace with UCLO plus branch. */\r\n\tfs->bcbase[pc].ins = BCINS_AD(BC_UCLO, 0, offset);\r\n\tbreak;\r\n      case BC_UCLO:\r\n\treturn;  /* We're done. */\r\n      default:\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Finish a FuncState and return the new prototype. */\r\nstatic GCproto *fs_finish(LexState *ls, BCLine line)\r\n{\r\n  lua_State *L = ls->L;\r\n  FuncState *fs = ls->fs;\r\n  BCLine numline = line - fs->linedefined;\r\n  size_t sizept, ofsk, ofsuv, ofsli, ofsdbg, ofsvar;\r\n  GCproto *pt;\r\n\r\n  /* Apply final fixups. */\r\n  fs_fixup_ret(fs);\r\n\r\n  /* Calculate total size of prototype including all colocated arrays. */\r\n  sizept = sizeof(GCproto) + fs->pc*sizeof(BCIns) + fs->nkgc*sizeof(GCRef);\r\n  sizept = (sizept + sizeof(TValue)-1) & ~(sizeof(TValue)-1);\r\n  ofsk = sizept; sizept += fs->nkn*sizeof(TValue);\r\n  ofsuv = sizept; sizept += ((fs->nuv+1)&~1)*2;\r\n  ofsli = sizept; sizept += fs_prep_line(fs, numline);\r\n  ofsdbg = sizept; sizept += fs_prep_var(ls, fs, &ofsvar);\r\n\r\n  /* Allocate prototype and initialize its fields. */\r\n  pt = (GCproto *)lj_mem_newgco(L, (MSize)sizept);\r\n  pt->gct = ~LJ_TPROTO;\r\n  pt->sizept = (MSize)sizept;\r\n  pt->trace = 0;\r\n  pt->flags = (uint8_t)(fs->flags & ~(PROTO_HAS_RETURN|PROTO_FIXUP_RETURN));\r\n  pt->numparams = fs->numparams;\r\n  pt->framesize = fs->framesize;\r\n  setgcref(pt->chunkname, obj2gco(ls->chunkname));\r\n\r\n  /* Close potentially uninitialized gap between bc and kgc. */\r\n  *(uint32_t *)((char *)pt + ofsk - sizeof(GCRef)*(fs->nkgc+1)) = 0;\r\n  fs_fixup_bc(fs, pt, (BCIns *)((char *)pt + sizeof(GCproto)), fs->pc);\r\n  fs_fixup_k(fs, pt, (void *)((char *)pt + ofsk));\r\n  fs_fixup_uv1(fs, pt, (uint16_t *)((char *)pt + ofsuv));\r\n  fs_fixup_line(fs, pt, (void *)((char *)pt + ofsli), numline);\r\n  fs_fixup_var(ls, pt, (uint8_t *)((char *)pt + ofsdbg), ofsvar);\r\n\r\n  lj_vmevent_send(L, BC,\r\n    setprotoV(L, L->top++, pt);\r\n  );\r\n\r\n  L->top--;  /* Pop table of constants. */\r\n  ls->vtop = fs->vbase;  /* Reset variable stack. */\r\n  ls->fs = fs->prev;\r\n  lua_assert(ls->fs != NULL || ls->token == TK_eof);\r\n  return pt;\r\n}\r\n\r\n/* Initialize a new FuncState. */\r\nstatic void fs_init(LexState *ls, FuncState *fs)\r\n{\r\n  lua_State *L = ls->L;\r\n  fs->prev = ls->fs; ls->fs = fs;  /* Append to list. */\r\n  fs->ls = ls;\r\n  fs->vbase = ls->vtop;\r\n  fs->L = L;\r\n  fs->pc = 0;\r\n  fs->lasttarget = 0;\r\n  fs->jpc = NO_JMP;\r\n  fs->freereg = 0;\r\n  fs->nkgc = 0;\r\n  fs->nkn = 0;\r\n  fs->nactvar = 0;\r\n  fs->nuv = 0;\r\n  fs->bl = NULL;\r\n  fs->flags = 0;\r\n  fs->framesize = 1;  /* Minimum frame size. */\r\n  fs->kt = lj_tab_new(L, 0, 0);\r\n  /* Anchor table of constants in stack to avoid being collected. */\r\n  settabV(L, L->top, fs->kt);\r\n  incr_top(L);\r\n}\r\n\r\n/* -- Expressions --------------------------------------------------------- */\r\n\r\n/* Forward declaration. */\r\nstatic void expr(LexState *ls, ExpDesc *v);\r\n\r\n/* Return string expression. */\r\nstatic void expr_str(LexState *ls, ExpDesc *e)\r\n{\r\n  expr_init(e, VKSTR, 0);\r\n  e->u.sval = lex_str(ls);\r\n}\r\n\r\n/* Return index expression. */\r\nstatic void expr_index(FuncState *fs, ExpDesc *t, ExpDesc *e)\r\n{\r\n  /* Already called: expr_toval(fs, e). */\r\n  t->k = VINDEXED;\r\n  if (expr_isnumk(e)) {\r\n#if LJ_DUALNUM\r\n    if (tvisint(expr_numtv(e))) {\r\n      int32_t k = intV(expr_numtv(e));\r\n      if (checku8(k)) {\r\n\tt->u.s.aux = BCMAX_C+1+(uint32_t)k;  /* 256..511: const byte key */\r\n\treturn;\r\n      }\r\n    }\r\n#else\r\n    lua_Number n = expr_numberV(e);\r\n    int32_t k = lj_num2int(n);\r\n    if (checku8(k) && n == (lua_Number)k) {\r\n      t->u.s.aux = BCMAX_C+1+(uint32_t)k;  /* 256..511: const byte key */\r\n      return;\r\n    }\r\n#endif\r\n  } else if (expr_isstrk(e)) {\r\n    BCReg idx = const_str(fs, e);\r\n    if (idx <= BCMAX_C) {\r\n      t->u.s.aux = ~idx;  /* -256..-1: const string key */\r\n      return;\r\n    }\r\n  }\r\n  t->u.s.aux = expr_toanyreg(fs, e);  /* 0..255: register */\r\n}\r\n\r\n/* Parse index expression with named field. */\r\nstatic void expr_field(LexState *ls, ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc key;\r\n  expr_toanyreg(fs, v);\r\n  lj_lex_next(ls);  /* Skip dot or colon. */\r\n  expr_str(ls, &key);\r\n  expr_index(fs, v, &key);\r\n}\r\n\r\n/* Parse index expression with brackets. */\r\nstatic void expr_bracket(LexState *ls, ExpDesc *v)\r\n{\r\n  lj_lex_next(ls);  /* Skip '['. */\r\n  expr(ls, v);\r\n  expr_toval(ls->fs, v);\r\n  lex_check(ls, ']');\r\n}\r\n\r\n/* Get value of constant expression. */\r\nstatic void expr_kvalue(TValue *v, ExpDesc *e)\r\n{\r\n  if (e->k <= VKTRUE) {\r\n    setitype(v, ~(uint32_t)e->k);\r\n  } else if (e->k == VKSTR) {\r\n    setgcref(v->gcr, obj2gco(e->u.sval));\r\n    setitype(v, LJ_TSTR);\r\n  } else {\r\n    lua_assert(tvisnumber(expr_numtv(e)));\r\n    *v = *expr_numtv(e);\r\n  }\r\n}\r\n\r\n/* Parse table constructor expression. */\r\nstatic void expr_table(LexState *ls, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCLine line = ls->linenumber;\r\n  GCtab *t = NULL;\r\n  int vcall = 0, needarr = 0, fixt = 0;\r\n  uint32_t narr = 1;  /* First array index. */\r\n  uint32_t nhash = 0;  /* Number of hash entries. */\r\n  BCReg freg = fs->freereg;\r\n  BCPos pc = bcemit_AD(fs, BC_TNEW, freg, 0);\r\n  expr_init(e, VNONRELOC, freg);\r\n  bcreg_reserve(fs, 1);\r\n  freg++;\r\n  lex_check(ls, '{');\r\n  while (ls->token != '}') {\r\n    ExpDesc key, val;\r\n    vcall = 0;\r\n    if (ls->token == '[') {\r\n      expr_bracket(ls, &key);  /* Already calls expr_toval. */\r\n      if (!expr_isk(&key)) expr_index(fs, e, &key);\r\n      if (expr_isnumk(&key) && expr_numiszero(&key)) needarr = 1; else nhash++;\r\n      lex_check(ls, '=');\r\n    } else if ((ls->token == TK_name || (!LJ_52 && ls->token == TK_goto)) &&\r\n\t       lj_lex_lookahead(ls) == '=') {\r\n      expr_str(ls, &key);\r\n      lex_check(ls, '=');\r\n      nhash++;\r\n    } else {\r\n      expr_init(&key, VKNUM, 0);\r\n      setintV(&key.u.nval, (int)narr);\r\n      narr++;\r\n      needarr = vcall = 1;\r\n    }\r\n    expr(ls, &val);\r\n    if (expr_isk(&key) && key.k != VKNIL &&\r\n\t(key.k == VKSTR || expr_isk_nojump(&val))) {\r\n      TValue k, *v;\r\n      if (!t) {  /* Create template table on demand. */\r\n\tBCReg kidx;\r\n\tt = lj_tab_new(fs->L, needarr ? narr : 0, hsize2hbits(nhash));\r\n\tkidx = const_gc(fs, obj2gco(t), LJ_TTAB);\r\n\tfs->bcbase[pc].ins = BCINS_AD(BC_TDUP, freg-1, kidx);\r\n      }\r\n      vcall = 0;\r\n      expr_kvalue(&k, &key);\r\n      v = lj_tab_set(fs->L, t, &k);\r\n      lj_gc_anybarriert(fs->L, t);\r\n      if (expr_isk_nojump(&val)) {  /* Add const key/value to template table. */\r\n\texpr_kvalue(v, &val);\r\n      } else {  /* Otherwise create dummy string key (avoids lj_tab_newkey). */\r\n\tsettabV(fs->L, v, t);  /* Preserve key with table itself as value. */\r\n\tfixt = 1;   /* Fix this later, after all resizes. */\r\n\tgoto nonconst;\r\n      }\r\n    } else {\r\n    nonconst:\r\n      if (val.k != VCALL) { expr_toanyreg(fs, &val); vcall = 0; }\r\n      if (expr_isk(&key)) expr_index(fs, e, &key);\r\n      bcemit_store(fs, e, &val);\r\n    }\r\n    fs->freereg = freg;\r\n    if (!lex_opt(ls, ',') && !lex_opt(ls, ';')) break;\r\n  }\r\n  lex_match(ls, '}', '{', line);\r\n  if (vcall) {\r\n    BCInsLine *ilp = &fs->bcbase[fs->pc-1];\r\n    ExpDesc en;\r\n    lua_assert(bc_a(ilp->ins) == freg &&\r\n\t       bc_op(ilp->ins) == (narr > 256 ? BC_TSETV : BC_TSETB));\r\n    expr_init(&en, VKNUM, 0);\r\n    en.u.nval.u32.lo = narr-1;\r\n    en.u.nval.u32.hi = 0x43300000;  /* Biased integer to avoid denormals. */\r\n    if (narr > 256) { fs->pc--; ilp--; }\r\n    ilp->ins = BCINS_AD(BC_TSETM, freg, const_num(fs, &en));\r\n    setbc_b(&ilp[-1].ins, 0);\r\n  }\r\n  if (pc == fs->pc-1) {  /* Make expr relocable if possible. */\r\n    e->u.s.info = pc;\r\n    fs->freereg--;\r\n    e->k = VRELOCABLE;\r\n  } else {\r\n    e->k = VNONRELOC;  /* May have been changed by expr_index. */\r\n  }\r\n  if (!t) {  /* Construct TNEW RD: hhhhhaaaaaaaaaaa. */\r\n    BCIns *ip = &fs->bcbase[pc].ins;\r\n    if (!needarr) narr = 0;\r\n    else if (narr < 3) narr = 3;\r\n    else if (narr > 0x7ff) narr = 0x7ff;\r\n    setbc_d(ip, narr|(hsize2hbits(nhash)<<11));\r\n  } else {\r\n    if (needarr && t->asize < narr)\r\n      lj_tab_reasize(fs->L, t, narr-1);\r\n    if (fixt) {  /* Fix value for dummy keys in template table. */\r\n      Node *node = noderef(t->node);\r\n      uint32_t i, hmask = t->hmask;\r\n      for (i = 0; i <= hmask; i++) {\r\n\tNode *n = &node[i];\r\n\tif (tvistab(&n->val)) {\r\n\t  lua_assert(tabV(&n->val) == t);\r\n\t  setnilV(&n->val);  /* Turn value into nil. */\r\n\t}\r\n      }\r\n    }\r\n    lj_gc_check(fs->L);\r\n  }\r\n}\r\n\r\n/* Parse function parameters. */\r\nstatic BCReg parse_params(LexState *ls, int needself)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg nparams = 0;\r\n  lex_check(ls, '(');\r\n  if (needself)\r\n    var_new_lit(ls, nparams++, \"self\");\r\n  if (ls->token != ')') {\r\n    do {\r\n      if (ls->token == TK_name || (!LJ_52 && ls->token == TK_goto)) {\r\n\tvar_new(ls, nparams++, lex_str(ls));\r\n      } else if (ls->token == TK_dots) {\r\n\tlj_lex_next(ls);\r\n\tfs->flags |= PROTO_VARARG;\r\n\tbreak;\r\n      } else {\r\n\terr_syntax(ls, LJ_ERR_XPARAM);\r\n      }\r\n    } while (lex_opt(ls, ','));\r\n  }\r\n  var_add(ls, nparams);\r\n  lua_assert(fs->nactvar == nparams);\r\n  bcreg_reserve(fs, nparams);\r\n  lex_check(ls, ')');\r\n  return nparams;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void parse_chunk(LexState *ls);\r\n\r\n/* Parse body of a function. */\r\nstatic void parse_body(LexState *ls, ExpDesc *e, int needself, BCLine line)\r\n{\r\n  FuncState fs, *pfs = ls->fs;\r\n  FuncScope bl;\r\n  GCproto *pt;\r\n  ptrdiff_t oldbase = pfs->bcbase - ls->bcstack;\r\n  fs_init(ls, &fs);\r\n  fscope_begin(&fs, &bl, 0);\r\n  fs.linedefined = line;\r\n  fs.numparams = (uint8_t)parse_params(ls, needself);\r\n  fs.bcbase = pfs->bcbase + pfs->pc;\r\n  fs.bclim = pfs->bclim - pfs->pc;\r\n  bcemit_AD(&fs, BC_FUNCF, 0, 0);  /* Placeholder. */\r\n  parse_chunk(ls);\r\n  if (ls->token != TK_end) lex_match(ls, TK_end, TK_function, line);\r\n  pt = fs_finish(ls, (ls->lastline = ls->linenumber));\r\n  pfs->bcbase = ls->bcstack + oldbase;  /* May have been reallocated. */\r\n  pfs->bclim = (BCPos)(ls->sizebcstack - oldbase);\r\n  /* Store new prototype in the constant array of the parent. */\r\n  expr_init(e, VRELOCABLE,\r\n\t    bcemit_AD(pfs, BC_FNEW, 0, const_gc(pfs, obj2gco(pt), LJ_TPROTO)));\r\n#if LJ_HASFFI\r\n  pfs->flags |= (fs.flags & PROTO_FFI);\r\n#endif\r\n  if (!(pfs->flags & PROTO_CHILD)) {\r\n    if (pfs->flags & PROTO_HAS_RETURN)\r\n      pfs->flags |= PROTO_FIXUP_RETURN;\r\n    pfs->flags |= PROTO_CHILD;\r\n  }\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Parse expression list. Last expression is left open. */\r\nstatic BCReg expr_list(LexState *ls, ExpDesc *v)\r\n{\r\n  BCReg n = 1;\r\n  expr(ls, v);\r\n  while (lex_opt(ls, ',')) {\r\n    expr_tonextreg(ls->fs, v);\r\n    expr(ls, v);\r\n    n++;\r\n  }\r\n  return n;\r\n}\r\n\r\n/* Parse function argument list. */\r\nstatic void parse_args(LexState *ls, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc args;\r\n  BCIns ins;\r\n  BCReg base;\r\n  BCLine line = ls->linenumber;\r\n  if (ls->token == '(') {\r\n#if !LJ_52\r\n    if (line != ls->lastline)\r\n      err_syntax(ls, LJ_ERR_XAMBIG);\r\n#endif\r\n    lj_lex_next(ls);\r\n    if (ls->token == ')') {  /* f(). */\r\n      args.k = VVOID;\r\n    } else {\r\n      expr_list(ls, &args);\r\n      if (args.k == VCALL)  /* f(a, b, g()) or f(a, b, ...). */\r\n\tsetbc_b(bcptr(fs, &args), 0);  /* Pass on multiple results. */\r\n    }\r\n    lex_match(ls, ')', '(', line);\r\n  } else if (ls->token == '{') {\r\n    expr_table(ls, &args);\r\n  } else if (ls->token == TK_string) {\r\n    expr_init(&args, VKSTR, 0);\r\n    args.u.sval = strV(&ls->tokenval);\r\n    lj_lex_next(ls);\r\n  } else {\r\n    err_syntax(ls, LJ_ERR_XFUNARG);\r\n    return;  /* Silence compiler. */\r\n  }\r\n  lua_assert(e->k == VNONRELOC);\r\n  base = e->u.s.info;  /* Base register for call. */\r\n  if (args.k == VCALL) {\r\n    ins = BCINS_ABC(BC_CALLM, base, 2, args.u.s.aux - base - 1);\r\n  } else {\r\n    if (args.k != VVOID)\r\n      expr_tonextreg(fs, &args);\r\n    ins = BCINS_ABC(BC_CALL, base, 2, fs->freereg - base);\r\n  }\r\n  expr_init(e, VCALL, bcemit_INS(fs, ins));\r\n  e->u.s.aux = base;\r\n  fs->bcbase[fs->pc - 1].line = line;\r\n  fs->freereg = base+1;  /* Leave one result by default. */\r\n}\r\n\r\n/* Parse primary expression. */\r\nstatic void expr_primary(LexState *ls, ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  /* Parse prefix expression. */\r\n  if (ls->token == '(') {\r\n    BCLine line = ls->linenumber;\r\n    lj_lex_next(ls);\r\n    expr(ls, v);\r\n    lex_match(ls, ')', '(', line);\r\n    expr_discharge(ls->fs, v);\r\n  } else if (ls->token == TK_name || (!LJ_52 && ls->token == TK_goto)) {\r\n    var_lookup(ls, v);\r\n  } else {\r\n    err_syntax(ls, LJ_ERR_XSYMBOL);\r\n  }\r\n  for (;;) {  /* Parse multiple expression suffixes. */\r\n    if (ls->token == '.') {\r\n      expr_field(ls, v);\r\n    } else if (ls->token == '[') {\r\n      ExpDesc key;\r\n      expr_toanyreg(fs, v);\r\n      expr_bracket(ls, &key);\r\n      expr_index(fs, v, &key);\r\n    } else if (ls->token == ':') {\r\n      ExpDesc key;\r\n      lj_lex_next(ls);\r\n      expr_str(ls, &key);\r\n      bcemit_method(fs, v, &key);\r\n      parse_args(ls, v);\r\n    } else if (ls->token == '(' || ls->token == TK_string || ls->token == '{') {\r\n      expr_tonextreg(fs, v);\r\n      parse_args(ls, v);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Parse simple expression. */\r\nstatic void expr_simple(LexState *ls, ExpDesc *v)\r\n{\r\n  switch (ls->token) {\r\n  case TK_number:\r\n    expr_init(v, (LJ_HASFFI && tviscdata(&ls->tokenval)) ? VKCDATA : VKNUM, 0);\r\n    copyTV(ls->L, &v->u.nval, &ls->tokenval);\r\n    break;\r\n  case TK_string:\r\n    expr_init(v, VKSTR, 0);\r\n    v->u.sval = strV(&ls->tokenval);\r\n    break;\r\n  case TK_nil:\r\n    expr_init(v, VKNIL, 0);\r\n    break;\r\n  case TK_true:\r\n    expr_init(v, VKTRUE, 0);\r\n    break;\r\n  case TK_false:\r\n    expr_init(v, VKFALSE, 0);\r\n    break;\r\n  case TK_dots: {  /* Vararg. */\r\n    FuncState *fs = ls->fs;\r\n    BCReg base;\r\n    checkcond(ls, fs->flags & PROTO_VARARG, LJ_ERR_XDOTS);\r\n    bcreg_reserve(fs, 1);\r\n    base = fs->freereg-1;\r\n    expr_init(v, VCALL, bcemit_ABC(fs, BC_VARG, base, 2, fs->numparams));\r\n    v->u.s.aux = base;\r\n    break;\r\n  }\r\n  case '{':  /* Table constructor. */\r\n    expr_table(ls, v);\r\n    return;\r\n  case TK_function:\r\n    lj_lex_next(ls);\r\n    parse_body(ls, v, 0, ls->linenumber);\r\n    return;\r\n  default:\r\n    expr_primary(ls, v);\r\n    return;\r\n  }\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Manage syntactic levels to avoid blowing up the stack. */\r\nstatic void synlevel_begin(LexState *ls)\r\n{\r\n  if (++ls->level >= LJ_MAX_XLEVEL)\r\n    lj_lex_error(ls, 0, LJ_ERR_XLEVELS);\r\n}\r\n\r\n#define synlevel_end(ls)\t((ls)->level--)\r\n\r\n/* Convert token to binary operator. */\r\nstatic BinOpr token2binop(LexToken tok)\r\n{\r\n  switch (tok) {\r\n  case '+':\treturn OPR_ADD;\r\n  case '-':\treturn OPR_SUB;\r\n  case '*':\treturn OPR_MUL;\r\n  case '/':\treturn OPR_DIV;\r\n  case '%':\treturn OPR_MOD;\r\n  case '^':\treturn OPR_POW;\r\n  case TK_concat: return OPR_CONCAT;\r\n  case TK_ne:\treturn OPR_NE;\r\n  case TK_eq:\treturn OPR_EQ;\r\n  case '<':\treturn OPR_LT;\r\n  case TK_le:\treturn OPR_LE;\r\n  case '>':\treturn OPR_GT;\r\n  case TK_ge:\treturn OPR_GE;\r\n  case TK_and:\treturn OPR_AND;\r\n  case TK_or:\treturn OPR_OR;\r\n  default:\treturn OPR_NOBINOPR;\r\n  }\r\n}\r\n\r\n/* Priorities for each binary operator. ORDER OPR. */\r\nstatic const struct {\r\n  uint8_t left;\t\t/* Left priority. */\r\n  uint8_t right;\t/* Right priority. */\r\n} priority[] = {\r\n  {6,6}, {6,6}, {7,7}, {7,7}, {7,7},\t/* ADD SUB MUL DIV MOD */\r\n  {10,9}, {5,4},\t\t\t/* POW CONCAT (right associative) */\r\n  {3,3}, {3,3},\t\t\t\t/* EQ NE */\r\n  {3,3}, {3,3}, {3,3}, {3,3},\t\t/* LT GE GT LE */\r\n  {2,2}, {1,1}\t\t\t\t/* AND OR */\r\n};\r\n\r\n#define UNARY_PRIORITY\t\t8  /* Priority for unary operators. */\r\n\r\n/* Forward declaration. */\r\nstatic BinOpr expr_binop(LexState *ls, ExpDesc *v, uint32_t limit);\r\n\r\n/* Parse unary expression. */\r\nstatic void expr_unop(LexState *ls, ExpDesc *v)\r\n{\r\n  BCOp op;\r\n  if (ls->token == TK_not) {\r\n    op = BC_NOT;\r\n  } else if (ls->token == '-') {\r\n    op = BC_UNM;\r\n  } else if (ls->token == '#') {\r\n    op = BC_LEN;\r\n  } else {\r\n    expr_simple(ls, v);\r\n    return;\r\n  }\r\n  lj_lex_next(ls);\r\n  expr_binop(ls, v, UNARY_PRIORITY);\r\n  bcemit_unop(ls->fs, op, v);\r\n}\r\n\r\n/* Parse binary expressions with priority higher than the limit. */\r\nstatic BinOpr expr_binop(LexState *ls, ExpDesc *v, uint32_t limit)\r\n{\r\n  BinOpr op;\r\n  synlevel_begin(ls);\r\n  expr_unop(ls, v);\r\n  op = token2binop(ls->token);\r\n  while (op != OPR_NOBINOPR && priority[op].left > limit) {\r\n    ExpDesc v2;\r\n    BinOpr nextop;\r\n    lj_lex_next(ls);\r\n    bcemit_binop_left(ls->fs, op, v);\r\n    /* Parse binary expression with higher priority. */\r\n    nextop = expr_binop(ls, &v2, priority[op].right);\r\n    bcemit_binop(ls->fs, op, v, &v2);\r\n    op = nextop;\r\n  }\r\n  synlevel_end(ls);\r\n  return op;  /* Return unconsumed binary operator (if any). */\r\n}\r\n\r\n/* Parse expression. */\r\nstatic void expr(LexState *ls, ExpDesc *v)\r\n{\r\n  expr_binop(ls, v, 0);  /* Priority 0: parse whole expression. */\r\n}\r\n\r\n/* Assign expression to the next register. */\r\nstatic void expr_next(LexState *ls)\r\n{\r\n  ExpDesc e;\r\n  expr(ls, &e);\r\n  expr_tonextreg(ls->fs, &e);\r\n}\r\n\r\n/* Parse conditional expression. */\r\nstatic BCPos expr_cond(LexState *ls)\r\n{\r\n  ExpDesc v;\r\n  expr(ls, &v);\r\n  if (v.k == VKNIL) v.k = VKFALSE;\r\n  bcemit_branch_t(ls->fs, &v);\r\n  return v.f;\r\n}\r\n\r\n/* -- Assignments --------------------------------------------------------- */\r\n\r\n/* List of LHS variables. */\r\ntypedef struct LHSVarList {\r\n  ExpDesc v;\t\t\t/* LHS variable. */\r\n  struct LHSVarList *prev;\t/* Link to previous LHS variable. */\r\n} LHSVarList;\r\n\r\n/* Eliminate write-after-read hazards for local variable assignment. */\r\nstatic void assign_hazard(LexState *ls, LHSVarList *lh, const ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg reg = v->u.s.info;  /* Check against this variable. */\r\n  BCReg tmp = fs->freereg;  /* Rename to this temp. register (if needed). */\r\n  int hazard = 0;\r\n  for (; lh; lh = lh->prev) {\r\n    if (lh->v.k == VINDEXED) {\r\n      if (lh->v.u.s.info == reg) {  /* t[i], t = 1, 2 */\r\n\thazard = 1;\r\n\tlh->v.u.s.info = tmp;\r\n      }\r\n      if (lh->v.u.s.aux == reg) {  /* t[i], i = 1, 2 */\r\n\thazard = 1;\r\n\tlh->v.u.s.aux = tmp;\r\n      }\r\n    }\r\n  }\r\n  if (hazard) {\r\n    bcemit_AD(fs, BC_MOV, tmp, reg);  /* Rename conflicting variable. */\r\n    bcreg_reserve(fs, 1);\r\n  }\r\n}\r\n\r\n/* Adjust LHS/RHS of an assignment. */\r\nstatic void assign_adjust(LexState *ls, BCReg nvars, BCReg nexps, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  int32_t extra = (int32_t)nvars - (int32_t)nexps;\r\n  if (e->k == VCALL) {\r\n    extra++;  /* Compensate for the VCALL itself. */\r\n    if (extra < 0) extra = 0;\r\n    setbc_b(bcptr(fs, e), extra+1);  /* Fixup call results. */\r\n    if (extra > 1) bcreg_reserve(fs, (BCReg)extra-1);\r\n  } else {\r\n    if (e->k != VVOID)\r\n      expr_tonextreg(fs, e);  /* Close last expression. */\r\n    if (extra > 0) {  /* Leftover LHS are set to nil. */\r\n      BCReg reg = fs->freereg;\r\n      bcreg_reserve(fs, (BCReg)extra);\r\n      bcemit_nil(fs, reg, (BCReg)extra);\r\n    }\r\n  }\r\n}\r\n\r\n/* Recursively parse assignment statement. */\r\nstatic void parse_assignment(LexState *ls, LHSVarList *lh, BCReg nvars)\r\n{\r\n  ExpDesc e;\r\n  checkcond(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED, LJ_ERR_XSYNTAX);\r\n  if (lex_opt(ls, ',')) {  /* Collect LHS list and recurse upwards. */\r\n    LHSVarList vl;\r\n    vl.prev = lh;\r\n    expr_primary(ls, &vl.v);\r\n    if (vl.v.k == VLOCAL)\r\n      assign_hazard(ls, lh, &vl.v);\r\n    checklimit(ls->fs, ls->level + nvars, LJ_MAX_XLEVEL, \"variable names\");\r\n    parse_assignment(ls, &vl, nvars+1);\r\n  } else {  /* Parse RHS. */\r\n    BCReg nexps;\r\n    lex_check(ls, '=');\r\n    nexps = expr_list(ls, &e);\r\n    if (nexps == nvars) {\r\n      if (e.k == VCALL) {\r\n\tif (bc_op(*bcptr(ls->fs, &e)) == BC_VARG) {  /* Vararg assignment. */\r\n\t  ls->fs->freereg--;\r\n\t  e.k = VRELOCABLE;\r\n\t} else {  /* Multiple call results. */\r\n\t  e.u.s.info = e.u.s.aux;  /* Base of call is not relocatable. */\r\n\t  e.k = VNONRELOC;\r\n\t}\r\n      }\r\n      bcemit_store(ls->fs, &lh->v, &e);\r\n      return;\r\n    }\r\n    assign_adjust(ls, nvars, nexps, &e);\r\n    if (nexps > nvars)\r\n      ls->fs->freereg -= nexps - nvars;  /* Drop leftover regs. */\r\n  }\r\n  /* Assign RHS to LHS and recurse downwards. */\r\n  expr_init(&e, VNONRELOC, ls->fs->freereg-1);\r\n  bcemit_store(ls->fs, &lh->v, &e);\r\n}\r\n\r\n/* Parse call statement or assignment. */\r\nstatic void parse_call_assign(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  LHSVarList vl;\r\n  expr_primary(ls, &vl.v);\r\n  if (vl.v.k == VCALL) {  /* Function call statement. */\r\n    setbc_b(bcptr(fs, &vl.v), 1);  /* No results. */\r\n  } else {  /* Start of an assignment. */\r\n    vl.prev = NULL;\r\n    parse_assignment(ls, &vl, 1);\r\n  }\r\n}\r\n\r\n/* Parse 'local' statement. */\r\nstatic void parse_local(LexState *ls)\r\n{\r\n  if (lex_opt(ls, TK_function)) {  /* Local function declaration. */\r\n    ExpDesc v, b;\r\n    FuncState *fs = ls->fs;\r\n    var_new(ls, 0, lex_str(ls));\r\n    expr_init(&v, VLOCAL, fs->freereg);\r\n    v.u.s.aux = fs->varmap[fs->freereg];\r\n    bcreg_reserve(fs, 1);\r\n    var_add(ls, 1);\r\n    parse_body(ls, &b, 0, ls->linenumber);\r\n    /* bcemit_store(fs, &v, &b) without setting VSTACK_VAR_RW. */\r\n    expr_free(fs, &b);\r\n    expr_toreg(fs, &b, v.u.s.info);\r\n    /* The upvalue is in scope, but the local is only valid after the store. */\r\n    var_get(ls, fs, fs->nactvar - 1).startpc = fs->pc;\r\n  } else {  /* Local variable declaration. */\r\n    ExpDesc e;\r\n    BCReg nexps, nvars = 0;\r\n    do {  /* Collect LHS. */\r\n      var_new(ls, nvars++, lex_str(ls));\r\n    } while (lex_opt(ls, ','));\r\n    if (lex_opt(ls, '=')) {  /* Optional RHS. */\r\n      nexps = expr_list(ls, &e);\r\n    } else {  /* Or implicitly set to nil. */\r\n      e.k = VVOID;\r\n      nexps = 0;\r\n    }\r\n    assign_adjust(ls, nvars, nexps, &e);\r\n    var_add(ls, nvars);\r\n  }\r\n}\r\n\r\n/* Parse 'function' statement. */\r\nstatic void parse_func(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs;\r\n  ExpDesc v, b;\r\n  int needself = 0;\r\n  lj_lex_next(ls);  /* Skip 'function'. */\r\n  /* Parse function name. */\r\n  var_lookup(ls, &v);\r\n  while (ls->token == '.')  /* Multiple dot-separated fields. */\r\n    expr_field(ls, &v);\r\n  if (ls->token == ':') {  /* Optional colon to signify method call. */\r\n    needself = 1;\r\n    expr_field(ls, &v);\r\n  }\r\n  parse_body(ls, &b, needself, line);\r\n  fs = ls->fs;\r\n  bcemit_store(fs, &v, &b);\r\n  fs->bcbase[fs->pc - 1].line = line;  /* Set line for the store. */\r\n}\r\n\r\n/* -- Control transfer statements ----------------------------------------- */\r\n\r\n/* Check for end of block. */\r\nstatic int endofblock(LexToken token)\r\n{\r\n  switch (token) {\r\n  case TK_else: case TK_elseif: case TK_end: case TK_until: case TK_eof:\r\n    return 1;\r\n  default:\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Parse 'return' statement. */\r\nstatic void parse_return(LexState *ls)\r\n{\r\n  BCIns ins;\r\n  FuncState *fs = ls->fs;\r\n  lj_lex_next(ls);  /* Skip 'return'. */\r\n  fs->flags |= PROTO_HAS_RETURN;\r\n  if (endofblock(ls->token) || ls->token == ';') {  /* Bare return. */\r\n    ins = BCINS_AD(BC_RET0, 0, 1);\r\n  } else {  /* Return with one or more values. */\r\n    ExpDesc e;  /* Receives the _last_ expression in the list. */\r\n    BCReg nret = expr_list(ls, &e);\r\n    if (nret == 1) {  /* Return one result. */\r\n      if (e.k == VCALL) {  /* Check for tail call. */\r\n\tBCIns *ip = bcptr(fs, &e);\r\n\t/* It doesn't pay off to add BC_VARGT just for 'return ...'. */\r\n\tif (bc_op(*ip) == BC_VARG) goto notailcall;\r\n\tfs->pc--;\r\n\tins = BCINS_AD(bc_op(*ip)-BC_CALL+BC_CALLT, bc_a(*ip), bc_c(*ip));\r\n      } else {  /* Can return the result from any register. */\r\n\tins = BCINS_AD(BC_RET1, expr_toanyreg(fs, &e), 2);\r\n      }\r\n    } else {\r\n      if (e.k == VCALL) {  /* Append all results from a call. */\r\n      notailcall:\r\n\tsetbc_b(bcptr(fs, &e), 0);\r\n\tins = BCINS_AD(BC_RETM, fs->nactvar, e.u.s.aux - fs->nactvar);\r\n      } else {\r\n\texpr_tonextreg(fs, &e);  /* Force contiguous registers. */\r\n\tins = BCINS_AD(BC_RET, fs->nactvar, nret+1);\r\n      }\r\n    }\r\n  }\r\n  if (fs->flags & PROTO_CHILD)\r\n    bcemit_AJ(fs, BC_UCLO, 0, 0);  /* May need to close upvalues first. */\r\n  bcemit_INS(fs, ins);\r\n}\r\n\r\n/* Parse 'break' statement. */\r\nstatic void parse_break(LexState *ls)\r\n{\r\n  ls->fs->bl->flags |= FSCOPE_BREAK;\r\n  gola_new(ls, NAME_BREAK, VSTACK_GOTO, bcemit_jmp(ls->fs));\r\n}\r\n\r\n/* Parse 'goto' statement. */\r\nstatic void parse_goto(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *name = lex_str(ls);\r\n  VarInfo *vl = gola_findlabel(ls, name);\r\n  if (vl)  /* Treat backwards goto within same scope like a loop. */\r\n    bcemit_AJ(fs, BC_LOOP, vl->slot, -1);  /* No BC range check. */\r\n  fs->bl->flags |= FSCOPE_GOLA;\r\n  gola_new(ls, name, VSTACK_GOTO, bcemit_jmp(fs));\r\n}\r\n\r\n/* Parse label. */\r\nstatic void parse_label(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *name;\r\n  MSize idx;\r\n  fs->lasttarget = fs->pc;\r\n  fs->bl->flags |= FSCOPE_GOLA;\r\n  lj_lex_next(ls);  /* Skip '::'. */\r\n  name = lex_str(ls);\r\n  if (gola_findlabel(ls, name))\r\n    lj_lex_error(ls, 0, LJ_ERR_XLDUP, strdata(name));\r\n  idx = gola_new(ls, name, VSTACK_LABEL, fs->pc);\r\n  lex_check(ls, TK_label);\r\n  /* Recursively parse trailing statements: labels and ';' (Lua 5.2 only). */\r\n  for (;;) {\r\n    if (ls->token == TK_label) {\r\n      synlevel_begin(ls);\r\n      parse_label(ls);\r\n      synlevel_end(ls);\r\n    } else if (LJ_52 && ls->token == ';') {\r\n      lj_lex_next(ls);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n  /* Trailing label is considered to be outside of scope. */\r\n  if (endofblock(ls->token) && ls->token != TK_until)\r\n    ls->vstack[idx].slot = fs->bl->nactvar;\r\n  gola_resolve(ls, fs->bl, idx);\r\n}\r\n\r\n/* -- Blocks, loops and conditional statements ---------------------------- */\r\n\r\n/* Parse a block. */\r\nstatic void parse_block(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  FuncScope bl;\r\n  fscope_begin(fs, &bl, 0);\r\n  parse_chunk(ls);\r\n  fscope_end(fs);\r\n}\r\n\r\n/* Parse 'while' statement. */\r\nstatic void parse_while(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos start, loop, condexit;\r\n  FuncScope bl;\r\n  lj_lex_next(ls);  /* Skip 'while'. */\r\n  start = fs->lasttarget = fs->pc;\r\n  condexit = expr_cond(ls);\r\n  fscope_begin(fs, &bl, FSCOPE_LOOP);\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AD(fs, BC_LOOP, fs->nactvar, 0);\r\n  parse_block(ls);\r\n  jmp_patch(fs, bcemit_jmp(fs), start);\r\n  lex_match(ls, TK_end, TK_while, line);\r\n  fscope_end(fs);\r\n  jmp_tohere(fs, condexit);\r\n  jmp_patchins(fs, loop, fs->pc);\r\n}\r\n\r\n/* Parse 'repeat' statement. */\r\nstatic void parse_repeat(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos loop = fs->lasttarget = fs->pc;\r\n  BCPos condexit;\r\n  FuncScope bl1, bl2;\r\n  fscope_begin(fs, &bl1, FSCOPE_LOOP);  /* Breakable loop scope. */\r\n  fscope_begin(fs, &bl2, 0);  /* Inner scope. */\r\n  lj_lex_next(ls);  /* Skip 'repeat'. */\r\n  bcemit_AD(fs, BC_LOOP, fs->nactvar, 0);\r\n  parse_chunk(ls);\r\n  lex_match(ls, TK_until, TK_repeat, line);\r\n  condexit = expr_cond(ls);  /* Parse condition (still inside inner scope). */\r\n  if (!(bl2.flags & FSCOPE_UPVAL)) {  /* No upvalues? Just end inner scope. */\r\n    fscope_end(fs);\r\n  } else {  /* Otherwise generate: cond: UCLO+JMP out, !cond: UCLO+JMP loop. */\r\n    parse_break(ls);  /* Break from loop and close upvalues. */\r\n    jmp_tohere(fs, condexit);\r\n    fscope_end(fs);  /* End inner scope and close upvalues. */\r\n    condexit = bcemit_jmp(fs);\r\n  }\r\n  jmp_patch(fs, condexit, loop);  /* Jump backwards if !cond. */\r\n  jmp_patchins(fs, loop, fs->pc);\r\n  fscope_end(fs);  /* End loop scope. */\r\n}\r\n\r\n/* Parse numeric 'for'. */\r\nstatic void parse_for_num(LexState *ls, GCstr *varname, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg base = fs->freereg;\r\n  FuncScope bl;\r\n  BCPos loop, loopend;\r\n  /* Hidden control variables. */\r\n  var_new_fixed(ls, FORL_IDX, VARNAME_FOR_IDX);\r\n  var_new_fixed(ls, FORL_STOP, VARNAME_FOR_STOP);\r\n  var_new_fixed(ls, FORL_STEP, VARNAME_FOR_STEP);\r\n  /* Visible copy of index variable. */\r\n  var_new(ls, FORL_EXT, varname);\r\n  lex_check(ls, '=');\r\n  expr_next(ls);\r\n  lex_check(ls, ',');\r\n  expr_next(ls);\r\n  if (lex_opt(ls, ',')) {\r\n    expr_next(ls);\r\n  } else {\r\n    bcemit_AD(fs, BC_KSHORT, fs->freereg, 1);  /* Default step is 1. */\r\n    bcreg_reserve(fs, 1);\r\n  }\r\n  var_add(ls, 3);  /* Hidden control variables. */\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AJ(fs, BC_FORI, base, NO_JMP);\r\n  fscope_begin(fs, &bl, 0);  /* Scope for visible variables. */\r\n  var_add(ls, 1);\r\n  bcreg_reserve(fs, 1);\r\n  parse_block(ls);\r\n  fscope_end(fs);\r\n  /* Perform loop inversion. Loop control instructions are at the end. */\r\n  loopend = bcemit_AJ(fs, BC_FORL, base, NO_JMP);\r\n  fs->bcbase[loopend].line = line;  /* Fix line for control ins. */\r\n  jmp_patchins(fs, loopend, loop+1);\r\n  jmp_patchins(fs, loop, fs->pc);\r\n}\r\n\r\n/* Try to predict whether the iterator is next() and specialize the bytecode.\r\n** Detecting next() and pairs() by name is simplistic, but quite effective.\r\n** The interpreter backs off if the check for the closure fails at runtime.\r\n*/\r\nstatic int predict_next(LexState *ls, FuncState *fs, BCPos pc)\r\n{\r\n  BCIns ins = fs->bcbase[pc].ins;\r\n  GCstr *name;\r\n  cTValue *o;\r\n  switch (bc_op(ins)) {\r\n  case BC_MOV:\r\n    name = gco2str(gcref(var_get(ls, fs, bc_d(ins)).name));\r\n    break;\r\n  case BC_UGET:\r\n    name = gco2str(gcref(ls->vstack[fs->uvmap[bc_d(ins)]].name));\r\n    break;\r\n  case BC_GGET:\r\n    /* There's no inverse index (yet), so lookup the strings. */\r\n    o = lj_tab_getstr(fs->kt, lj_str_newlit(ls->L, \"pairs\"));\r\n    if (o && tvhaskslot(o) && tvkslot(o) == bc_d(ins))\r\n      return 1;\r\n    o = lj_tab_getstr(fs->kt, lj_str_newlit(ls->L, \"next\"));\r\n    if (o && tvhaskslot(o) && tvkslot(o) == bc_d(ins))\r\n      return 1;\r\n    return 0;\r\n  default:\r\n    return 0;\r\n  }\r\n  return (name->len == 5 && !strcmp(strdata(name), \"pairs\")) ||\r\n\t (name->len == 4 && !strcmp(strdata(name), \"next\"));\r\n}\r\n\r\n/* Parse 'for' iterator. */\r\nstatic void parse_for_iter(LexState *ls, GCstr *indexname)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc e;\r\n  BCReg nvars = 0;\r\n  BCLine line;\r\n  BCReg base = fs->freereg + 3;\r\n  BCPos loop, loopend, exprpc = fs->pc;\r\n  FuncScope bl;\r\n  int isnext;\r\n  /* Hidden control variables. */\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_GEN);\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_STATE);\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_CTL);\r\n  /* Visible variables returned from iterator. */\r\n  var_new(ls, nvars++, indexname);\r\n  while (lex_opt(ls, ','))\r\n    var_new(ls, nvars++, lex_str(ls));\r\n  lex_check(ls, TK_in);\r\n  line = ls->linenumber;\r\n  assign_adjust(ls, 3, expr_list(ls, &e), &e);\r\n  bcreg_bump(fs, 3);  /* The iterator needs another 3 slots (func + 2 args). */\r\n  isnext = (nvars <= 5 && predict_next(ls, fs, exprpc));\r\n  var_add(ls, 3);  /* Hidden control variables. */\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AJ(fs, isnext ? BC_ISNEXT : BC_JMP, base, NO_JMP);\r\n  fscope_begin(fs, &bl, 0);  /* Scope for visible variables. */\r\n  var_add(ls, nvars-3);\r\n  bcreg_reserve(fs, nvars-3);\r\n  parse_block(ls);\r\n  fscope_end(fs);\r\n  /* Perform loop inversion. Loop control instructions are at the end. */\r\n  jmp_patchins(fs, loop, fs->pc);\r\n  bcemit_ABC(fs, isnext ? BC_ITERN : BC_ITERC, base, nvars-3+1, 2+1);\r\n  loopend = bcemit_AJ(fs, BC_ITERL, base, NO_JMP);\r\n  fs->bcbase[loopend-1].line = line;  /* Fix line for control ins. */\r\n  fs->bcbase[loopend].line = line;\r\n  jmp_patchins(fs, loopend, loop+1);\r\n}\r\n\r\n/* Parse 'for' statement. */\r\nstatic void parse_for(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *varname;\r\n  FuncScope bl;\r\n  fscope_begin(fs, &bl, FSCOPE_LOOP);\r\n  lj_lex_next(ls);  /* Skip 'for'. */\r\n  varname = lex_str(ls);  /* Get first variable name. */\r\n  if (ls->token == '=')\r\n    parse_for_num(ls, varname, line);\r\n  else if (ls->token == ',' || ls->token == TK_in)\r\n    parse_for_iter(ls, varname);\r\n  else\r\n    err_syntax(ls, LJ_ERR_XFOR);\r\n  lex_match(ls, TK_end, TK_for, line);\r\n  fscope_end(fs);  /* Resolve break list. */\r\n}\r\n\r\n/* Parse condition and 'then' block. */\r\nstatic BCPos parse_then(LexState *ls)\r\n{\r\n  BCPos condexit;\r\n  lj_lex_next(ls);  /* Skip 'if' or 'elseif'. */\r\n  condexit = expr_cond(ls);\r\n  lex_check(ls, TK_then);\r\n  parse_block(ls);\r\n  return condexit;\r\n}\r\n\r\n/* Parse 'if' statement. */\r\nstatic void parse_if(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos flist;\r\n  BCPos escapelist = NO_JMP;\r\n  flist = parse_then(ls);\r\n  while (ls->token == TK_elseif) {  /* Parse multiple 'elseif' blocks. */\r\n    jmp_append(fs, &escapelist, bcemit_jmp(fs));\r\n    jmp_tohere(fs, flist);\r\n    flist = parse_then(ls);\r\n  }\r\n  if (ls->token == TK_else) {  /* Parse optional 'else' block. */\r\n    jmp_append(fs, &escapelist, bcemit_jmp(fs));\r\n    jmp_tohere(fs, flist);\r\n    lj_lex_next(ls);  /* Skip 'else'. */\r\n    parse_block(ls);\r\n  } else {\r\n    jmp_append(fs, &escapelist, flist);\r\n  }\r\n  jmp_tohere(fs, escapelist);\r\n  lex_match(ls, TK_end, TK_if, line);\r\n}\r\n\r\n/* -- Parse statements ---------------------------------------------------- */\r\n\r\n/* Parse a statement. Returns 1 if it must be the last one in a chunk. */\r\nstatic int parse_stmt(LexState *ls)\r\n{\r\n  BCLine line = ls->linenumber;\r\n  switch (ls->token) {\r\n  case TK_if:\r\n    parse_if(ls, line);\r\n    break;\r\n  case TK_while:\r\n    parse_while(ls, line);\r\n    break;\r\n  case TK_do:\r\n    lj_lex_next(ls);\r\n    parse_block(ls);\r\n    lex_match(ls, TK_end, TK_do, line);\r\n    break;\r\n  case TK_for:\r\n    parse_for(ls, line);\r\n    break;\r\n  case TK_repeat:\r\n    parse_repeat(ls, line);\r\n    break;\r\n  case TK_function:\r\n    parse_func(ls, line);\r\n    break;\r\n  case TK_local:\r\n    lj_lex_next(ls);\r\n    parse_local(ls);\r\n    break;\r\n  case TK_return:\r\n    parse_return(ls);\r\n    return 1;  /* Must be last. */\r\n  case TK_break:\r\n    lj_lex_next(ls);\r\n    parse_break(ls);\r\n    return !LJ_52;  /* Must be last in Lua 5.1. */\r\n#if LJ_52\r\n  case ';':\r\n    lj_lex_next(ls);\r\n    break;\r\n#endif\r\n  case TK_label:\r\n    parse_label(ls);\r\n    break;\r\n  case TK_goto:\r\n    if (LJ_52 || lj_lex_lookahead(ls) == TK_name) {\r\n      lj_lex_next(ls);\r\n      parse_goto(ls);\r\n      break;\r\n    }  /* else: fallthrough */\r\n  default:\r\n    parse_call_assign(ls);\r\n    break;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* A chunk is a list of statements optionally separated by semicolons. */\r\nstatic void parse_chunk(LexState *ls)\r\n{\r\n  int islast = 0;\r\n  synlevel_begin(ls);\r\n  while (!islast && !endofblock(ls->token)) {\r\n    islast = parse_stmt(ls);\r\n    lex_opt(ls, ';');\r\n    lua_assert(ls->fs->framesize >= ls->fs->freereg &&\r\n\t       ls->fs->freereg >= ls->fs->nactvar);\r\n    ls->fs->freereg = ls->fs->nactvar;  /* Free registers after each stmt. */\r\n  }\r\n  synlevel_end(ls);\r\n}\r\n\r\n/* Entry point of bytecode parser. */\r\nGCproto *lj_parse(LexState *ls)\r\n{\r\n  FuncState fs;\r\n  FuncScope bl;\r\n  GCproto *pt;\r\n  lua_State *L = ls->L;\r\n#ifdef LUAJIT_DISABLE_DEBUGINFO\r\n  ls->chunkname = lj_str_newlit(L, \"=\");\r\n#else\r\n  ls->chunkname = lj_str_newz(L, ls->chunkarg);\r\n#endif\r\n  setstrV(L, L->top, ls->chunkname);  /* Anchor chunkname string. */\r\n  incr_top(L);\r\n  ls->level = 0;\r\n  fs_init(ls, &fs);\r\n  fs.linedefined = 0;\r\n  fs.numparams = 0;\r\n  fs.bcbase = NULL;\r\n  fs.bclim = 0;\r\n  fs.flags |= PROTO_VARARG;  /* Main chunk is always a vararg func. */\r\n  fscope_begin(&fs, &bl, 0);\r\n  bcemit_AD(&fs, BC_FUNCV, 0, 0);  /* Placeholder. */\r\n  lj_lex_next(ls);  /* Read-ahead first token. */\r\n  parse_chunk(ls);\r\n  if (ls->token != TK_eof)\r\n    err_token(ls, TK_eof);\r\n  pt = fs_finish(ls, ls->linenumber);\r\n  L->top--;  /* Drop chunkname. */\r\n  lua_assert(fs.prev == NULL);\r\n  lua_assert(ls->fs == NULL);\r\n  lua_assert(pt->sizeuv == 0);\r\n  return pt;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_parse.h",
    "content": "/*\r\n** Lua parser (source code -> bytecode).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_PARSE_H\r\n#define _LJ_PARSE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lex.h\"\r\n\r\nLJ_FUNC GCproto *lj_parse(LexState *ls);\r\nLJ_FUNC GCstr *lj_parse_keepstr(LexState *ls, const char *str, size_t l);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_parse_keepcdata(LexState *ls, TValue *tv, GCcdata *cd);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_record.c",
    "content": "/*\r\n** Trace recorder (bytecode -> SSA IR).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_record_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Sanity checks ------------------------------------------------------- */\r\n\r\n#ifdef LUA_USE_ASSERT\r\n/* Sanity check the whole IR -- sloooow. */\r\nstatic void rec_check_ir(jit_State *J)\r\n{\r\n  IRRef i, nins = J->cur.nins, nk = J->cur.nk;\r\n  lua_assert(nk <= REF_BIAS && nins >= REF_BIAS && nins < 65536);\r\n  for (i = nins-1; i >= nk; i--) {\r\n    IRIns *ir = IR(i);\r\n    uint32_t mode = lj_ir_mode[ir->o];\r\n    IRRef op1 = ir->op1;\r\n    IRRef op2 = ir->op2;\r\n    switch (irm_op1(mode)) {\r\n    case IRMnone: lua_assert(op1 == 0); break;\r\n    case IRMref: lua_assert(op1 >= nk);\r\n      lua_assert(i >= REF_BIAS ? op1 < i : op1 > i); break;\r\n    case IRMlit: break;\r\n    case IRMcst: lua_assert(i < REF_BIAS); continue;\r\n    }\r\n    switch (irm_op2(mode)) {\r\n    case IRMnone: lua_assert(op2 == 0); break;\r\n    case IRMref: lua_assert(op2 >= nk);\r\n      lua_assert(i >= REF_BIAS ? op2 < i : op2 > i); break;\r\n    case IRMlit: break;\r\n    case IRMcst: lua_assert(0); break;\r\n    }\r\n    if (ir->prev) {\r\n      lua_assert(ir->prev >= nk);\r\n      lua_assert(i >= REF_BIAS ? ir->prev < i : ir->prev > i);\r\n      lua_assert(ir->o == IR_NOP || IR(ir->prev)->o == ir->o);\r\n    }\r\n  }\r\n}\r\n\r\n/* Compare stack slots and frames of the recorder and the VM. */\r\nstatic void rec_check_slots(jit_State *J)\r\n{\r\n  BCReg s, nslots = J->baseslot + J->maxslot;\r\n  int32_t depth = 0;\r\n  cTValue *base = J->L->base - J->baseslot;\r\n  lua_assert(J->baseslot >= 1 && J->baseslot < LJ_MAX_JSLOTS);\r\n  lua_assert(J->baseslot == 1 || (J->slot[J->baseslot-1] & TREF_FRAME));\r\n  lua_assert(nslots < LJ_MAX_JSLOTS);\r\n  for (s = 0; s < nslots; s++) {\r\n    TRef tr = J->slot[s];\r\n    if (tr) {\r\n      cTValue *tv = &base[s];\r\n      IRRef ref = tref_ref(tr);\r\n      IRIns *ir;\r\n      lua_assert(ref >= J->cur.nk && ref < J->cur.nins);\r\n      ir = IR(ref);\r\n      lua_assert(irt_t(ir->t) == tref_t(tr));\r\n      if (s == 0) {\r\n\tlua_assert(tref_isfunc(tr));\r\n      } else if ((tr & TREF_FRAME)) {\r\n\tGCfunc *fn = gco2func(frame_gc(tv));\r\n\tBCReg delta = (BCReg)(tv - frame_prev(tv));\r\n\tlua_assert(tref_isfunc(tr));\r\n\tif (tref_isk(tr)) lua_assert(fn == ir_kfunc(ir));\r\n\tlua_assert(s > delta ? (J->slot[s-delta] & TREF_FRAME) : (s == delta));\r\n\tdepth++;\r\n      } else if ((tr & TREF_CONT)) {\r\n\tlua_assert(ir_kptr(ir) == gcrefp(tv->gcr, void));\r\n\tlua_assert((J->slot[s+1] & TREF_FRAME));\r\n\tdepth++;\r\n      } else {\r\n\tif (tvisnumber(tv))\r\n\t  lua_assert(tref_isnumber(tr));  /* Could be IRT_INT etc., too. */\r\n\telse\r\n\t  lua_assert(itype2irt(tv) == tref_type(tr));\r\n\tif (tref_isk(tr)) {  /* Compare constants. */\r\n\t  TValue tvk;\r\n\t  lj_ir_kvalue(J->L, &tvk, ir);\r\n\t  if (!(tvisnum(&tvk) && tvisnan(&tvk)))\r\n\t    lua_assert(lj_obj_equal(tv, &tvk));\r\n\t  else\r\n\t    lua_assert(tvisnum(tv) && tvisnan(tv));\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  lua_assert(J->framedepth == depth);\r\n}\r\n#endif\r\n\r\n/* -- Type handling and specialization ------------------------------------ */\r\n\r\n/* Note: these functions return tagged references (TRef). */\r\n\r\n/* Specialize a slot to a specific type. Note: slot can be negative! */\r\nstatic TRef sloadt(jit_State *J, int32_t slot, IRType t, int mode)\r\n{\r\n  /* Caller may set IRT_GUARD in t. */\r\n  TRef ref = emitir_raw(IRT(IR_SLOAD, t), (int32_t)J->baseslot+slot, mode);\r\n  J->base[slot] = ref;\r\n  return ref;\r\n}\r\n\r\n/* Specialize a slot to the runtime type. Note: slot can be negative! */\r\nstatic TRef sload(jit_State *J, int32_t slot)\r\n{\r\n  IRType t = itype2irt(&J->L->base[slot]);\r\n  TRef ref = emitir_raw(IRTG(IR_SLOAD, t), (int32_t)J->baseslot+slot,\r\n\t\t\tIRSLOAD_TYPECHECK);\r\n  if (irtype_ispri(t)) ref = TREF_PRI(t);  /* Canonicalize primitive refs. */\r\n  J->base[slot] = ref;\r\n  return ref;\r\n}\r\n\r\n/* Get TRef from slot. Load slot and specialize if not done already. */\r\n#define getslot(J, s)\t(J->base[(s)] ? J->base[(s)] : sload(J, (int32_t)(s)))\r\n\r\n/* Get TRef for current function. */\r\nstatic TRef getcurrf(jit_State *J)\r\n{\r\n  if (J->base[-1])\r\n    return J->base[-1];\r\n  lua_assert(J->baseslot == 1);\r\n  return sloadt(J, -1, IRT_FUNC, IRSLOAD_READONLY);\r\n}\r\n\r\n/* Compare for raw object equality.\r\n** Returns 0 if the objects are the same.\r\n** Returns 1 if they are different, but the same type.\r\n** Returns 2 for two different types.\r\n** Comparisons between primitives always return 1 -- no caller cares about it.\r\n*/\r\nint lj_record_objcmp(jit_State *J, TRef a, TRef b, cTValue *av, cTValue *bv)\r\n{\r\n  int diff = !lj_obj_equal(av, bv);\r\n  if (!tref_isk2(a, b)) {  /* Shortcut, also handles primitives. */\r\n    IRType ta = tref_isinteger(a) ? IRT_INT : tref_type(a);\r\n    IRType tb = tref_isinteger(b) ? IRT_INT : tref_type(b);\r\n    if (ta != tb) {\r\n      /* Widen mixed number/int comparisons to number/number comparison. */\r\n      if (ta == IRT_INT && tb == IRT_NUM) {\r\n\ta = emitir(IRTN(IR_CONV), a, IRCONV_NUM_INT);\r\n\tta = IRT_NUM;\r\n      } else if (ta == IRT_NUM && tb == IRT_INT) {\r\n\tb = emitir(IRTN(IR_CONV), b, IRCONV_NUM_INT);\r\n      } else {\r\n\treturn 2;  /* Two different types are never equal. */\r\n      }\r\n    }\r\n    emitir(IRTG(diff ? IR_NE : IR_EQ, ta), a, b);\r\n  }\r\n  return diff;\r\n}\r\n\r\n/* Constify a value. Returns 0 for non-representable object types. */\r\nTRef lj_record_constify(jit_State *J, cTValue *o)\r\n{\r\n  if (tvisgcv(o))\r\n    return lj_ir_kgc(J, gcV(o), itype2irt(o));\r\n  else if (tvisint(o))\r\n    return lj_ir_kint(J, intV(o));\r\n  else if (tvisnum(o))\r\n    return lj_ir_knumint(J, numV(o));\r\n  else if (tvisbool(o))\r\n    return TREF_PRI(itype2irt(o));\r\n  else\r\n    return 0;  /* Can't represent lightuserdata (pointless). */\r\n}\r\n\r\n/* -- Record loop ops ----------------------------------------------------- */\r\n\r\n/* Loop event. */\r\ntypedef enum {\r\n  LOOPEV_LEAVE,\t\t/* Loop is left or not entered. */\r\n  LOOPEV_ENTERLO,\t/* Loop is entered with a low iteration count left. */\r\n  LOOPEV_ENTER\t\t/* Loop is entered. */\r\n} LoopEvent;\r\n\r\n/* Canonicalize slots: convert integers to numbers. */\r\nstatic void canonicalize_slots(jit_State *J)\r\n{\r\n  BCReg s;\r\n  if (LJ_DUALNUM) return;\r\n  for (s = J->baseslot+J->maxslot-1; s >= 1; s--) {\r\n    TRef tr = J->slot[s];\r\n    if (tref_isinteger(tr)) {\r\n      IRIns *ir = IR(tref_ref(tr));\r\n      if (!(ir->o == IR_SLOAD && (ir->op2 & IRSLOAD_READONLY)))\r\n\tJ->slot[s] = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n    }\r\n  }\r\n}\r\n\r\n/* Stop recording. */\r\nstatic void rec_stop(jit_State *J, TraceLink linktype, TraceNo lnk)\r\n{\r\n  lj_trace_end(J);\r\n  J->cur.linktype = (uint8_t)linktype;\r\n  J->cur.link = (uint16_t)lnk;\r\n  /* Looping back at the same stack level? */\r\n  if (lnk == J->cur.traceno && J->framedepth + J->retdepth == 0) {\r\n    if ((J->flags & JIT_F_OPT_LOOP))  /* Shall we try to create a loop? */\r\n      goto nocanon;  /* Do not canonicalize or we lose the narrowing. */\r\n    if (J->cur.root)  /* Otherwise ensure we always link to the root trace. */\r\n      J->cur.link = J->cur.root;\r\n  }\r\n  canonicalize_slots(J);\r\nnocanon:\r\n  /* Note: all loop ops must set J->pc to the following instruction! */\r\n  lj_snap_add(J);  /* Add loop snapshot. */\r\n  J->needsnap = 0;\r\n  J->mergesnap = 1;  /* In case recording continues. */\r\n}\r\n\r\n/* Search bytecode backwards for a int/num constant slot initializer. */\r\nstatic TRef find_kinit(jit_State *J, const BCIns *endpc, BCReg slot, IRType t)\r\n{\r\n  /* This algorithm is rather simplistic and assumes quite a bit about\r\n  ** how the bytecode is generated. It works fine for FORI initializers,\r\n  ** but it won't necessarily work in other cases (e.g. iterator arguments).\r\n  ** It doesn't do anything fancy, either (like backpropagating MOVs).\r\n  */\r\n  const BCIns *pc, *startpc = proto_bc(J->pt);\r\n  for (pc = endpc-1; pc > startpc; pc--) {\r\n    BCIns ins = *pc;\r\n    BCOp op = bc_op(ins);\r\n    /* First try to find the last instruction that stores to this slot. */\r\n    if (bcmode_a(op) == BCMbase && bc_a(ins) <= slot) {\r\n      return 0;  /* Multiple results, e.g. from a CALL or KNIL. */\r\n    } else if (bcmode_a(op) == BCMdst && bc_a(ins) == slot) {\r\n      if (op == BC_KSHORT || op == BC_KNUM) {  /* Found const. initializer. */\r\n\t/* Now try to verify there's no forward jump across it. */\r\n\tconst BCIns *kpc = pc;\r\n\tfor (; pc > startpc; pc--)\r\n\t  if (bc_op(*pc) == BC_JMP) {\r\n\t    const BCIns *target = pc+bc_j(*pc)+1;\r\n\t    if (target > kpc && target <= endpc)\r\n\t      return 0;  /* Conditional assignment. */\r\n\t  }\r\n\tif (op == BC_KSHORT) {\r\n\t  int32_t k = (int32_t)(int16_t)bc_d(ins);\r\n\t  return t == IRT_INT ? lj_ir_kint(J, k) : lj_ir_knum(J, (lua_Number)k);\r\n\t} else {\r\n\t  cTValue *tv = proto_knumtv(J->pt, bc_d(ins));\r\n\t  if (t == IRT_INT) {\r\n\t    int32_t k = numberVint(tv);\r\n\t    if (tvisint(tv) || numV(tv) == (lua_Number)k)  /* -0 is ok here. */\r\n\t      return lj_ir_kint(J, k);\r\n\t    return 0;  /* Type mismatch. */\r\n\t  } else {\r\n\t    return lj_ir_knum(J, numberVnum(tv));\r\n\t  }\r\n\t}\r\n      }\r\n      return 0;  /* Non-constant initializer. */\r\n    }\r\n  }\r\n  return 0;  /* No assignment to this slot found? */\r\n}\r\n\r\n/* Load and optionally convert a FORI argument from a slot. */\r\nstatic TRef fori_load(jit_State *J, BCReg slot, IRType t, int mode)\r\n{\r\n  int conv = (tvisint(&J->L->base[slot]) != (t==IRT_INT)) ? IRSLOAD_CONVERT : 0;\r\n  return sloadt(J, (int32_t)slot,\r\n\t\tt + (((mode & IRSLOAD_TYPECHECK) ||\r\n\t\t      (conv && t == IRT_INT && !(mode >> 16))) ?\r\n\t\t     IRT_GUARD : 0),\r\n\t\tmode + conv);\r\n}\r\n\r\n/* Peek before FORI to find a const initializer. Otherwise load from slot. */\r\nstatic TRef fori_arg(jit_State *J, const BCIns *fori, BCReg slot,\r\n\t\t     IRType t, int mode)\r\n{\r\n  TRef tr = J->base[slot];\r\n  if (!tr) {\r\n    tr = find_kinit(J, fori, slot, t);\r\n    if (!tr)\r\n      tr = fori_load(J, slot, t, mode);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Return the direction of the FOR loop iterator.\r\n** It's important to exactly reproduce the semantics of the interpreter.\r\n*/\r\nstatic int rec_for_direction(cTValue *o)\r\n{\r\n  return (tvisint(o) ? intV(o) : (int32_t)o->u32.hi) >= 0;\r\n}\r\n\r\n/* Simulate the runtime behavior of the FOR loop iterator. */\r\nstatic LoopEvent rec_for_iter(IROp *op, cTValue *o, int isforl)\r\n{\r\n  lua_Number stopv = numberVnum(&o[FORL_STOP]);\r\n  lua_Number idxv = numberVnum(&o[FORL_IDX]);\r\n  lua_Number stepv = numberVnum(&o[FORL_STEP]);\r\n  if (isforl)\r\n    idxv += stepv;\r\n  if (rec_for_direction(&o[FORL_STEP])) {\r\n    if (idxv <= stopv) {\r\n      *op = IR_LE;\r\n      return idxv + 2*stepv > stopv ? LOOPEV_ENTERLO : LOOPEV_ENTER;\r\n    }\r\n    *op = IR_GT; return LOOPEV_LEAVE;\r\n  } else {\r\n    if (stopv <= idxv) {\r\n      *op = IR_GE;\r\n      return idxv + 2*stepv < stopv ? LOOPEV_ENTERLO : LOOPEV_ENTER;\r\n    }\r\n    *op = IR_LT; return LOOPEV_LEAVE;\r\n  }\r\n}\r\n\r\n/* Record checks for FOR loop overflow and step direction. */\r\nstatic void rec_for_check(jit_State *J, IRType t, int dir,\r\n\t\t\t  TRef stop, TRef step, int init)\r\n{\r\n  if (!tref_isk(step)) {\r\n    /* Non-constant step: need a guard for the direction. */\r\n    TRef zero = (t == IRT_INT) ? lj_ir_kint(J, 0) : lj_ir_knum_zero(J);\r\n    emitir(IRTG(dir ? IR_GE : IR_LT, t), step, zero);\r\n    /* Add hoistable overflow checks for a narrowed FORL index. */\r\n    if (init && t == IRT_INT) {\r\n      if (tref_isk(stop)) {\r\n\t/* Constant stop: optimize check away or to a range check for step. */\r\n\tint32_t k = IR(tref_ref(stop))->i;\r\n\tif (dir) {\r\n\t  if (k > 0)\r\n\t    emitir(IRTGI(IR_LE), step, lj_ir_kint(J, (int32_t)0x7fffffff-k));\r\n\t} else {\r\n\t  if (k < 0)\r\n\t    emitir(IRTGI(IR_GE), step, lj_ir_kint(J, (int32_t)0x80000000-k));\r\n\t}\r\n      } else {\r\n\t/* Stop+step variable: need full overflow check. */\r\n\tTRef tr = emitir(IRTGI(IR_ADDOV), step, stop);\r\n\temitir(IRTI(IR_USE), tr, 0);  /* ADDOV is weak. Avoid dead result. */\r\n      }\r\n    }\r\n  } else if (init && t == IRT_INT && !tref_isk(stop)) {\r\n    /* Constant step: optimize overflow check to a range check for stop. */\r\n    int32_t k = IR(tref_ref(step))->i;\r\n    k = (int32_t)(dir ? 0x7fffffff : 0x80000000) - k;\r\n    emitir(IRTGI(dir ? IR_LE : IR_GE), stop, lj_ir_kint(J, k));\r\n  }\r\n}\r\n\r\n/* Record a FORL instruction. */\r\nstatic void rec_for_loop(jit_State *J, const BCIns *fori, ScEvEntry *scev,\r\n\t\t\t int init)\r\n{\r\n  BCReg ra = bc_a(*fori);\r\n  cTValue *tv = &J->L->base[ra];\r\n  TRef idx = J->base[ra+FORL_IDX];\r\n  IRType t = idx ? tref_type(idx) :\r\n\t     (init || LJ_DUALNUM) ? lj_opt_narrow_forl(J, tv) : IRT_NUM;\r\n  int mode = IRSLOAD_INHERIT +\r\n    ((!LJ_DUALNUM || tvisint(tv) == (t == IRT_INT)) ? IRSLOAD_READONLY : 0);\r\n  TRef stop = fori_arg(J, fori, ra+FORL_STOP, t, mode);\r\n  TRef step = fori_arg(J, fori, ra+FORL_STEP, t, mode);\r\n  int tc, dir = rec_for_direction(&tv[FORL_STEP]);\r\n  lua_assert(bc_op(*fori) == BC_FORI || bc_op(*fori) == BC_JFORI);\r\n  scev->t.irt = t;\r\n  scev->dir = dir;\r\n  scev->stop = tref_ref(stop);\r\n  scev->step = tref_ref(step);\r\n  rec_for_check(J, t, dir, stop, step, init);\r\n  scev->start = tref_ref(find_kinit(J, fori, ra+FORL_IDX, IRT_INT));\r\n  tc = (LJ_DUALNUM &&\r\n\t!(scev->start && irref_isk(scev->stop) && irref_isk(scev->step) &&\r\n\t  tvisint(&tv[FORL_IDX]) == (t == IRT_INT))) ?\r\n\tIRSLOAD_TYPECHECK : 0;\r\n  if (tc) {\r\n    J->base[ra+FORL_STOP] = stop;\r\n    J->base[ra+FORL_STEP] = step;\r\n  }\r\n  if (!idx)\r\n    idx = fori_load(J, ra+FORL_IDX, t,\r\n\t\t    IRSLOAD_INHERIT + tc + (J->scev.start << 16));\r\n  if (!init)\r\n    J->base[ra+FORL_IDX] = idx = emitir(IRT(IR_ADD, t), idx, step);\r\n  J->base[ra+FORL_EXT] = idx;\r\n  scev->idx = tref_ref(idx);\r\n  setmref(scev->pc, fori);\r\n  J->maxslot = ra+FORL_EXT+1;\r\n}\r\n\r\n/* Record FORL/JFORL or FORI/JFORI. */\r\nstatic LoopEvent rec_for(jit_State *J, const BCIns *fori, int isforl)\r\n{\r\n  BCReg ra = bc_a(*fori);\r\n  TValue *tv = &J->L->base[ra];\r\n  TRef *tr = &J->base[ra];\r\n  IROp op;\r\n  LoopEvent ev;\r\n  TRef stop;\r\n  IRType t;\r\n  if (isforl) {  /* Handle FORL/JFORL opcodes. */\r\n    TRef idx = tr[FORL_IDX];\r\n    if (mref(J->scev.pc, const BCIns) == fori && tref_ref(idx) == J->scev.idx) {\r\n      t = J->scev.t.irt;\r\n      stop = J->scev.stop;\r\n      idx = emitir(IRT(IR_ADD, t), idx, J->scev.step);\r\n      tr[FORL_EXT] = tr[FORL_IDX] = idx;\r\n    } else {\r\n      ScEvEntry scev;\r\n      rec_for_loop(J, fori, &scev, 0);\r\n      t = scev.t.irt;\r\n      stop = scev.stop;\r\n    }\r\n  } else {  /* Handle FORI/JFORI opcodes. */\r\n    BCReg i;\r\n    lj_meta_for(J->L, tv);\r\n    t = (LJ_DUALNUM || tref_isint(tr[FORL_IDX])) ? lj_opt_narrow_forl(J, tv) :\r\n\t\t\t\t\t\t   IRT_NUM;\r\n    for (i = FORL_IDX; i <= FORL_STEP; i++) {\r\n      if (!tr[i]) sload(J, ra+i);\r\n      lua_assert(tref_isnumber_str(tr[i]));\r\n      if (tref_isstr(tr[i]))\r\n\ttr[i] = emitir(IRTG(IR_STRTO, IRT_NUM), tr[i], 0);\r\n      if (t == IRT_INT) {\r\n\tif (!tref_isinteger(tr[i]))\r\n\t  tr[i] = emitir(IRTGI(IR_CONV), tr[i], IRCONV_INT_NUM|IRCONV_CHECK);\r\n      } else {\r\n\tif (!tref_isnum(tr[i]))\r\n\t  tr[i] = emitir(IRTN(IR_CONV), tr[i], IRCONV_NUM_INT);\r\n      }\r\n    }\r\n    tr[FORL_EXT] = tr[FORL_IDX];\r\n    stop = tr[FORL_STOP];\r\n    rec_for_check(J, t, rec_for_direction(&tv[FORL_STEP]),\r\n\t\t  stop, tr[FORL_STEP], 1);\r\n  }\r\n\r\n  ev = rec_for_iter(&op, tv, isforl);\r\n  if (ev == LOOPEV_LEAVE) {\r\n    J->maxslot = ra+FORL_EXT+1;\r\n    J->pc = fori+1;\r\n  } else {\r\n    J->maxslot = ra;\r\n    J->pc = fori+bc_j(*fori)+1;\r\n  }\r\n  lj_snap_add(J);\r\n\r\n  emitir(IRTG(op, t), tr[FORL_IDX], stop);\r\n\r\n  if (ev == LOOPEV_LEAVE) {\r\n    J->maxslot = ra;\r\n    J->pc = fori+bc_j(*fori)+1;\r\n  } else {\r\n    J->maxslot = ra+FORL_EXT+1;\r\n    J->pc = fori+1;\r\n  }\r\n  J->needsnap = 1;\r\n  return ev;\r\n}\r\n\r\n/* Record ITERL/JITERL. */\r\nstatic LoopEvent rec_iterl(jit_State *J, const BCIns iterins)\r\n{\r\n  BCReg ra = bc_a(iterins);\r\n  lua_assert(J->base[ra] != 0);\r\n  if (!tref_isnil(J->base[ra])) {  /* Looping back? */\r\n    J->base[ra-1] = J->base[ra];  /* Copy result of ITERC to control var. */\r\n    J->maxslot = ra-1+bc_b(J->pc[-1]);\r\n    J->pc += bc_j(iterins)+1;\r\n    return LOOPEV_ENTER;\r\n  } else {\r\n    J->maxslot = ra-3;\r\n    J->pc++;\r\n    return LOOPEV_LEAVE;\r\n  }\r\n}\r\n\r\n/* Record LOOP/JLOOP. Now, that was easy. */\r\nstatic LoopEvent rec_loop(jit_State *J, BCReg ra)\r\n{\r\n  if (ra < J->maxslot) J->maxslot = ra;\r\n  J->pc++;\r\n  return LOOPEV_ENTER;\r\n}\r\n\r\n/* Check if a loop repeatedly failed to trace because it didn't loop back. */\r\nstatic int innerloopleft(jit_State *J, const BCIns *pc)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < PENALTY_SLOTS; i++)\r\n    if (mref(J->penalty[i].pc, const BCIns) == pc) {\r\n      if ((J->penalty[i].reason == LJ_TRERR_LLEAVE ||\r\n\t   J->penalty[i].reason == LJ_TRERR_LINNER) &&\r\n\t  J->penalty[i].val >= 2*PENALTY_MIN)\r\n\treturn 1;\r\n      break;\r\n    }\r\n  return 0;\r\n}\r\n\r\n/* Handle the case when an interpreted loop op is hit. */\r\nstatic void rec_loop_interp(jit_State *J, const BCIns *pc, LoopEvent ev)\r\n{\r\n  if (J->parent == 0) {\r\n    if (pc == J->startpc && J->framedepth + J->retdepth == 0) {\r\n      /* Same loop? */\r\n      if (ev == LOOPEV_LEAVE)  /* Must loop back to form a root trace. */\r\n\tlj_trace_err(J, LJ_TRERR_LLEAVE);\r\n      rec_stop(J, LJ_TRLINK_LOOP, J->cur.traceno);  /* Looping root trace. */\r\n    } else if (ev != LOOPEV_LEAVE) {  /* Entering inner loop? */\r\n      /* It's usually better to abort here and wait until the inner loop\r\n      ** is traced. But if the inner loop repeatedly didn't loop back,\r\n      ** this indicates a low trip count. In this case try unrolling\r\n      ** an inner loop even in a root trace. But it's better to be a bit\r\n      ** more conservative here and only do it for very short loops.\r\n      */\r\n      if (bc_j(*pc) != -1 && !innerloopleft(J, pc))\r\n\tlj_trace_err(J, LJ_TRERR_LINNER);  /* Root trace hit an inner loop. */\r\n      if ((ev != LOOPEV_ENTERLO &&\r\n\t   J->loopref && J->cur.nins - J->loopref > 24) || --J->loopunroll < 0)\r\n\tlj_trace_err(J, LJ_TRERR_LUNROLL);  /* Limit loop unrolling. */\r\n      J->loopref = J->cur.nins;\r\n    }\r\n  } else if (ev != LOOPEV_LEAVE) {  /* Side trace enters an inner loop. */\r\n    J->loopref = J->cur.nins;\r\n    if (--J->loopunroll < 0)\r\n      lj_trace_err(J, LJ_TRERR_LUNROLL);  /* Limit loop unrolling. */\r\n  }  /* Side trace continues across a loop that's left or not entered. */\r\n}\r\n\r\n/* Handle the case when an already compiled loop op is hit. */\r\nstatic void rec_loop_jit(jit_State *J, TraceNo lnk, LoopEvent ev)\r\n{\r\n  if (J->parent == 0) {  /* Root trace hit an inner loop. */\r\n    /* Better let the inner loop spawn a side trace back here. */\r\n    lj_trace_err(J, LJ_TRERR_LINNER);\r\n  } else if (ev != LOOPEV_LEAVE) {  /* Side trace enters a compiled loop. */\r\n    J->instunroll = 0;  /* Cannot continue across a compiled loop op. */\r\n    if (J->pc == J->startpc && J->framedepth + J->retdepth == 0)\r\n      rec_stop(J, LJ_TRLINK_LOOP, J->cur.traceno);  /* Form an extra loop. */\r\n    else\r\n      rec_stop(J, LJ_TRLINK_ROOT, lnk);  /* Link to the loop. */\r\n  }  /* Side trace continues across a loop that's left or not entered. */\r\n}\r\n\r\n/* -- Record calls and returns -------------------------------------------- */\r\n\r\n/* Specialize to the runtime value of the called function or its prototype. */\r\nstatic TRef rec_call_specialize(jit_State *J, GCfunc *fn, TRef tr)\r\n{\r\n  TRef kfunc;\r\n  if (isluafunc(fn)) {\r\n    GCproto *pt = funcproto(fn);\r\n    /* Too many closures created? Probably not a monomorphic function. */\r\n    if (pt->flags >= PROTO_CLC_POLY) {  /* Specialize to prototype instead. */\r\n      TRef trpt = emitir(IRT(IR_FLOAD, IRT_P32), tr, IRFL_FUNC_PC);\r\n      emitir(IRTG(IR_EQ, IRT_P32), trpt, lj_ir_kptr(J, proto_bc(pt)));\r\n      (void)lj_ir_kgc(J, obj2gco(pt), IRT_PROTO);  /* Prevent GC of proto. */\r\n      return tr;\r\n    }\r\n  }\r\n  /* Otherwise specialize to the function (closure) value itself. */\r\n  kfunc = lj_ir_kfunc(J, fn);\r\n  emitir(IRTG(IR_EQ, IRT_FUNC), tr, kfunc);\r\n  return kfunc;\r\n}\r\n\r\n/* Record call setup. */\r\nstatic void rec_call_setup(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  RecordIndex ix;\r\n  TValue *functv = &J->L->base[func];\r\n  TRef *fbase = &J->base[func];\r\n  ptrdiff_t i;\r\n  for (i = 0; i <= nargs; i++)\r\n    (void)getslot(J, func+i);  /* Ensure func and all args have a reference. */\r\n  if (!tref_isfunc(fbase[0])) {  /* Resolve __call metamethod. */\r\n    ix.tab = fbase[0];\r\n    copyTV(J->L, &ix.tabv, functv);\r\n    if (!lj_record_mm_lookup(J, &ix, MM_call) || !tref_isfunc(ix.mobj))\r\n      lj_trace_err(J, LJ_TRERR_NOMM);\r\n    for (i = ++nargs; i > 0; i--)  /* Shift arguments up. */\r\n      fbase[i] = fbase[i-1];\r\n    fbase[0] = ix.mobj;  /* Replace function. */\r\n    functv = &ix.mobjv;\r\n  }\r\n  fbase[0] = TREF_FRAME | rec_call_specialize(J, funcV(functv), fbase[0]);\r\n  J->maxslot = (BCReg)nargs;\r\n}\r\n\r\n/* Record call. */\r\nvoid lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  rec_call_setup(J, func, nargs);\r\n  /* Bump frame. */\r\n  J->framedepth++;\r\n  J->base += func+1;\r\n  J->baseslot += func+1;\r\n}\r\n\r\n/* Record tail call. */\r\nvoid lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  rec_call_setup(J, func, nargs);\r\n  if (frame_isvarg(J->L->base - 1)) {\r\n    BCReg cbase = (BCReg)frame_delta(J->L->base - 1);\r\n    if (--J->framedepth < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    func += cbase;\r\n  }\r\n  /* Move func + args down. */\r\n  memmove(&J->base[-1], &J->base[func], sizeof(TRef)*(J->maxslot+1));\r\n  /* Note: the new TREF_FRAME is now at J->base[-1] (even for slot #0). */\r\n  /* Tailcalls can form a loop, so count towards the loop unroll limit. */\r\n  if (++J->tailcalled > J->loopunroll)\r\n    lj_trace_err(J, LJ_TRERR_LUNROLL);\r\n}\r\n\r\n/* Check unroll limits for down-recursion. */\r\nstatic int check_downrec_unroll(jit_State *J, GCproto *pt)\r\n{\r\n  IRRef ptref;\r\n  for (ptref = J->chain[IR_KGC]; ptref; ptref = IR(ptref)->prev)\r\n    if (ir_kgc(IR(ptref)) == obj2gco(pt)) {\r\n      int count = 0;\r\n      IRRef ref;\r\n      for (ref = J->chain[IR_RETF]; ref; ref = IR(ref)->prev)\r\n\tif (IR(ref)->op1 == ptref)\r\n\t  count++;\r\n      if (count) {\r\n\tif (J->pc == J->startpc) {\r\n\t  if (count + J->tailcalled > J->param[JIT_P_recunroll])\r\n\t    return 1;\r\n\t} else {\r\n\t  lj_trace_err(J, LJ_TRERR_DOWNREC);\r\n\t}\r\n      }\r\n    }\r\n  return 0;\r\n}\r\n\r\n/* Record return. */\r\nvoid lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults)\r\n{\r\n  TValue *frame = J->L->base - 1;\r\n  ptrdiff_t i;\r\n  for (i = 0; i < gotresults; i++)\r\n    (void)getslot(J, rbase+i);  /* Ensure all results have a reference. */\r\n  while (frame_ispcall(frame)) {  /* Immediately resolve pcall() returns. */\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if (--J->framedepth < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    lua_assert(J->baseslot > 1);\r\n    gotresults++;\r\n    rbase += cbase;\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    J->base[--rbase] = TREF_TRUE;  /* Prepend true to results. */\r\n    frame = frame_prevd(frame);\r\n  }\r\n  /* Return to lower frame via interpreter for unhandled cases. */\r\n  if (J->framedepth == 0 && J->pt && bc_isret(bc_op(*J->pc)) &&\r\n       (!frame_islua(frame) ||\r\n\t(J->parent == 0 && !bc_isret(bc_op(J->cur.startins))))) {\r\n    /* NYI: specialize to frame type and return directly, not via RET*. */\r\n    for (i = 0; i < (ptrdiff_t)rbase; i++)\r\n      J->base[i] = 0;  /* Purge dead slots. */\r\n    J->maxslot = rbase + (BCReg)gotresults;\r\n    rec_stop(J, LJ_TRLINK_RETURN, 0);  /* Return to interpreter. */\r\n    return;\r\n  }\r\n  if (frame_isvarg(frame)) {\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if (--J->framedepth < 0)  /* NYI: return of vararg func to lower frame. */\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    lua_assert(J->baseslot > 1);\r\n    rbase += cbase;\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    frame = frame_prevd(frame);\r\n  }\r\n  if (frame_islua(frame)) {  /* Return to Lua frame. */\r\n    BCIns callins = *(frame_pc(frame)-1);\r\n    ptrdiff_t nresults = bc_b(callins) ? (ptrdiff_t)bc_b(callins)-1 :gotresults;\r\n    BCReg cbase = bc_a(callins);\r\n    GCproto *pt = funcproto(frame_func(frame - (cbase+1)));\r\n    if ((pt->flags & PROTO_NOJIT))\r\n      lj_trace_err(J, LJ_TRERR_CJITOFF);\r\n    if (J->framedepth == 0 && J->pt && frame == J->L->base - 1) {\r\n      if (check_downrec_unroll(J, pt)) {\r\n\tJ->maxslot = (BCReg)(rbase + gotresults);\r\n\tlj_snap_purge(J);\r\n\trec_stop(J, LJ_TRLINK_DOWNREC, J->cur.traceno);  /* Down-recursion. */\r\n\treturn;\r\n      }\r\n      lj_snap_add(J);\r\n    }\r\n    for (i = 0; i < nresults; i++)  /* Adjust results. */\r\n      J->base[i-1] = i < gotresults ? J->base[rbase+i] : TREF_NIL;\r\n    J->maxslot = cbase+(BCReg)nresults;\r\n    if (J->framedepth > 0) {  /* Return to a frame that is part of the trace. */\r\n      J->framedepth--;\r\n      lua_assert(J->baseslot > cbase+1);\r\n      J->baseslot -= cbase+1;\r\n      J->base -= cbase+1;\r\n    } else if (J->parent == 0 && !bc_isret(bc_op(J->cur.startins))) {\r\n      /* Return to lower frame would leave the loop in a root trace. */\r\n      lj_trace_err(J, LJ_TRERR_LLEAVE);\r\n    } else if (J->needsnap) {  /* Tailcalled to ff with side-effects. */\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);  /* No way to insert snapshot here. */\r\n    } else {  /* Return to lower frame. Guard for the target we return to. */\r\n      TRef trpt = lj_ir_kgc(J, obj2gco(pt), IRT_PROTO);\r\n      TRef trpc = lj_ir_kptr(J, (void *)frame_pc(frame));\r\n      emitir(IRTG(IR_RETF, IRT_P32), trpt, trpc);\r\n      J->retdepth++;\r\n      J->needsnap = 1;\r\n      lua_assert(J->baseslot == 1);\r\n      /* Shift result slots up and clear the slots of the new frame below. */\r\n      memmove(J->base + cbase, J->base-1, sizeof(TRef)*nresults);\r\n      memset(J->base-1, 0, sizeof(TRef)*(cbase+1));\r\n    }\r\n  } else if (frame_iscont(frame)) {  /* Return to continuation frame. */\r\n    ASMFunction cont = frame_contf(frame);\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if ((J->framedepth -= 2) < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    J->maxslot = cbase-2;\r\n    if (cont == lj_cont_ra) {\r\n      /* Copy result to destination slot. */\r\n      BCReg dst = bc_a(*(frame_contpc(frame)-1));\r\n      J->base[dst] = gotresults ? J->base[cbase+rbase] : TREF_NIL;\r\n      if (dst >= J->maxslot) J->maxslot = dst+1;\r\n    } else if (cont == lj_cont_nop) {\r\n      /* Nothing to do here. */\r\n    } else if (cont == lj_cont_cat) {\r\n      lua_assert(0);\r\n    } else {\r\n      /* Result type already specialized. */\r\n      lua_assert(cont == lj_cont_condf || cont == lj_cont_condt);\r\n    }\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_NYIRETL);  /* NYI: handle return to C frame. */\r\n  }\r\n  lua_assert(J->baseslot >= 1);\r\n}\r\n\r\n/* -- Metamethod handling ------------------------------------------------- */\r\n\r\n/* Prepare to record call to metamethod. */\r\nstatic BCReg rec_mm_prep(jit_State *J, ASMFunction cont)\r\n{\r\n  BCReg s, top = curr_proto(J->L)->framesize;\r\n  TRef trcont;\r\n  setcont(&J->L->base[top], cont);\r\n#if LJ_64\r\n  trcont = lj_ir_kptr(J, (void *)((int64_t)cont - (int64_t)lj_vm_asm_begin));\r\n#else\r\n  trcont = lj_ir_kptr(J, (void *)cont);\r\n#endif\r\n  J->base[top] = trcont | TREF_CONT;\r\n  J->framedepth++;\r\n  for (s = J->maxslot; s < top; s++)\r\n    J->base[s] = 0;  /* Clear frame gap to avoid resurrecting previous refs. */\r\n  return top+1;\r\n}\r\n\r\n/* Record metamethod lookup. */\r\nint lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm)\r\n{\r\n  RecordIndex mix;\r\n  GCtab *mt;\r\n  if (tref_istab(ix->tab)) {\r\n    mt = tabref(tabV(&ix->tabv)->metatable);\r\n    mix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_TAB_META);\r\n  } else if (tref_isudata(ix->tab)) {\r\n    int udtype = udataV(&ix->tabv)->udtype;\r\n    mt = tabref(udataV(&ix->tabv)->metatable);\r\n    /* The metatables of special userdata objects are treated as immutable. */\r\n    if (udtype != UDTYPE_USERDATA) {\r\n      cTValue *mo;\r\n      if (LJ_HASFFI && udtype == UDTYPE_FFI_CLIB) {\r\n\t/* Specialize to the C library namespace object. */\r\n\temitir(IRTG(IR_EQ, IRT_P32), ix->tab, lj_ir_kptr(J, udataV(&ix->tabv)));\r\n      } else {\r\n\t/* Specialize to the type of userdata. */\r\n\tTRef tr = emitir(IRT(IR_FLOAD, IRT_U8), ix->tab, IRFL_UDATA_UDTYPE);\r\n\temitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, udtype));\r\n      }\r\n  immutable_mt:\r\n      mo = lj_tab_getstr(mt, mmname_str(J2G(J), mm));\r\n      if (!mo || tvisnil(mo))\r\n\treturn 0;  /* No metamethod. */\r\n      /* Treat metamethod or index table as immutable, too. */\r\n      if (!(tvisfunc(mo) || tvistab(mo)))\r\n\tlj_trace_err(J, LJ_TRERR_BADTYPE);\r\n      copyTV(J->L, &ix->mobjv, mo);\r\n      ix->mobj = lj_ir_kgc(J, gcV(mo), tvisfunc(mo) ? IRT_FUNC : IRT_TAB);\r\n      ix->mtv = mt;\r\n      ix->mt = TREF_NIL;  /* Dummy value for comparison semantics. */\r\n      return 1;  /* Got metamethod or index table. */\r\n    }\r\n    mix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_UDATA_META);\r\n  } else {\r\n    /* Specialize to base metatable. Must flush mcode in lua_setmetatable(). */\r\n    mt = tabref(basemt_obj(J2G(J), &ix->tabv));\r\n    if (mt == NULL) {\r\n      ix->mt = TREF_NIL;\r\n      return 0;  /* No metamethod. */\r\n    }\r\n    /* The cdata metatable is treated as immutable. */\r\n    if (LJ_HASFFI && tref_iscdata(ix->tab)) goto immutable_mt;\r\n    ix->mt = mix.tab = lj_ir_ktab(J, mt);\r\n    goto nocheck;\r\n  }\r\n  ix->mt = mt ? mix.tab : TREF_NIL;\r\n  emitir(IRTG(mt ? IR_NE : IR_EQ, IRT_TAB), mix.tab, lj_ir_knull(J, IRT_TAB));\r\nnocheck:\r\n  if (mt) {\r\n    GCstr *mmstr = mmname_str(J2G(J), mm);\r\n    cTValue *mo = lj_tab_getstr(mt, mmstr);\r\n    if (mo && !tvisnil(mo))\r\n      copyTV(J->L, &ix->mobjv, mo);\r\n    ix->mtv = mt;\r\n    settabV(J->L, &mix.tabv, mt);\r\n    setstrV(J->L, &mix.keyv, mmstr);\r\n    mix.key = lj_ir_kstr(J, mmstr);\r\n    mix.val = 0;\r\n    mix.idxchain = 0;\r\n    ix->mobj = lj_record_idx(J, &mix);\r\n    return !tref_isnil(ix->mobj);  /* 1 if metamethod found, 0 if not. */\r\n  }\r\n  return 0;  /* No metamethod. */\r\n}\r\n\r\n/* Record call to arithmetic metamethod. */\r\nstatic TRef rec_mm_arith(jit_State *J, RecordIndex *ix, MMS mm)\r\n{\r\n  /* Set up metamethod call first to save ix->tab and ix->tabv. */\r\n  BCReg func = rec_mm_prep(J, lj_cont_ra);\r\n  TRef *base = J->base + func;\r\n  TValue *basev = J->L->base + func;\r\n  base[1] = ix->tab; base[2] = ix->key;\r\n  copyTV(J->L, basev+1, &ix->tabv);\r\n  copyTV(J->L, basev+2, &ix->keyv);\r\n  if (!lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n    if (mm != MM_unm) {\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, &ix->keyv);\r\n      if (lj_record_mm_lookup(J, ix, mm))  /* Lookup mm on 2nd operand. */\r\n\tgoto ok;\r\n    }\r\n    lj_trace_err(J, LJ_TRERR_NOMM);\r\n  }\r\nok:\r\n  base[0] = ix->mobj;\r\n  copyTV(J->L, basev+0, &ix->mobjv);\r\n  lj_record_call(J, func, 2);\r\n  return 0;  /* No result yet. */\r\n}\r\n\r\n/* Record call to __len metamethod. */\r\nstatic TRef rec_mm_len(jit_State *J, TRef tr, TValue *tv)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = tr;\r\n  copyTV(J->L, &ix.tabv, tv);\r\n  if (lj_record_mm_lookup(J, &ix, MM_len)) {\r\n    BCReg func = rec_mm_prep(J, lj_cont_ra);\r\n    TRef *base = J->base + func;\r\n    TValue *basev = J->L->base + func;\r\n    base[0] = ix.mobj; copyTV(J->L, basev+0, &ix.mobjv);\r\n    base[1] = tr; copyTV(J->L, basev+1, tv);\r\n#if LJ_52\r\n    base[2] = tr; copyTV(J->L, basev+2, tv);\r\n#else\r\n    base[2] = TREF_NIL; setnilV(basev+2);\r\n#endif\r\n    lj_record_call(J, func, 2);\r\n  } else {\r\n    if (LJ_52 && tref_istab(tr))\r\n      return lj_ir_call(J, IRCALL_lj_tab_len, tr);\r\n    lj_trace_err(J, LJ_TRERR_NOMM);\r\n  }\r\n  return 0;  /* No result yet. */\r\n}\r\n\r\n/* Call a comparison metamethod. */\r\nstatic void rec_mm_callcomp(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  BCReg func = rec_mm_prep(J, (op&1) ? lj_cont_condf : lj_cont_condt);\r\n  TRef *base = J->base + func;\r\n  TValue *tv = J->L->base + func;\r\n  base[0] = ix->mobj; base[1] = ix->val; base[2] = ix->key;\r\n  copyTV(J->L, tv+0, &ix->mobjv);\r\n  copyTV(J->L, tv+1, &ix->valv);\r\n  copyTV(J->L, tv+2, &ix->keyv);\r\n  lj_record_call(J, func, 2);\r\n}\r\n\r\n/* Record call to equality comparison metamethod (for tab and udata only). */\r\nstatic void rec_mm_equal(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  ix->tab = ix->val;\r\n  copyTV(J->L, &ix->tabv, &ix->valv);\r\n  if (lj_record_mm_lookup(J, ix, MM_eq)) {  /* Lookup mm on 1st operand. */\r\n    cTValue *bv;\r\n    TRef mo1 = ix->mobj;\r\n    TValue mo1v;\r\n    copyTV(J->L, &mo1v, &ix->mobjv);\r\n    /* Avoid the 2nd lookup and the objcmp if the metatables are equal. */\r\n    bv = &ix->keyv;\r\n    if (tvistab(bv) && tabref(tabV(bv)->metatable) == ix->mtv) {\r\n      TRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_TAB_META);\r\n      emitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n    } else if (tvisudata(bv) && tabref(udataV(bv)->metatable) == ix->mtv) {\r\n      TRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_UDATA_META);\r\n      emitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n    } else {  /* Lookup metamethod on 2nd operand and compare both. */\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, bv);\r\n      if (!lj_record_mm_lookup(J, ix, MM_eq) ||\r\n\t  lj_record_objcmp(J, mo1, ix->mobj, &mo1v, &ix->mobjv))\r\n\treturn;\r\n    }\r\n    rec_mm_callcomp(J, ix, op);\r\n  }\r\n}\r\n\r\n/* Record call to ordered comparison metamethods (for arbitrary objects). */\r\nstatic void rec_mm_comp(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  ix->tab = ix->val;\r\n  copyTV(J->L, &ix->tabv, &ix->valv);\r\n  while (1) {\r\n    MMS mm = (op & 2) ? MM_le : MM_lt;  /* Try __le + __lt or only __lt. */\r\n#if LJ_52\r\n    if (!lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, &ix->keyv);\r\n      if (!lj_record_mm_lookup(J, ix, mm))  /* Lookup mm on 2nd operand. */\r\n\tgoto nomatch;\r\n    }\r\n    rec_mm_callcomp(J, ix, op);\r\n    return;\r\n#else\r\n    if (lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n      cTValue *bv;\r\n      TRef mo1 = ix->mobj;\r\n      TValue mo1v;\r\n      copyTV(J->L, &mo1v, &ix->mobjv);\r\n      /* Avoid the 2nd lookup and the objcmp if the metatables are equal. */\r\n      bv = &ix->keyv;\r\n      if (tvistab(bv) && tabref(tabV(bv)->metatable) == ix->mtv) {\r\n\tTRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_TAB_META);\r\n\temitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n      } else if (tvisudata(bv) && tabref(udataV(bv)->metatable) == ix->mtv) {\r\n\tTRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_UDATA_META);\r\n\temitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n      } else {  /* Lookup metamethod on 2nd operand and compare both. */\r\n\tix->tab = ix->key;\r\n\tcopyTV(J->L, &ix->tabv, bv);\r\n\tif (!lj_record_mm_lookup(J, ix, mm) ||\r\n\t    lj_record_objcmp(J, mo1, ix->mobj, &mo1v, &ix->mobjv))\r\n\t  goto nomatch;\r\n      }\r\n      rec_mm_callcomp(J, ix, op);\r\n      return;\r\n    }\r\n#endif\r\n  nomatch:\r\n    /* Lookup failed. Retry with  __lt and swapped operands. */\r\n    if (!(op & 2)) break;  /* Already at __lt. Interpreter will throw. */\r\n    ix->tab = ix->key; ix->key = ix->val; ix->val = ix->tab;\r\n    copyTV(J->L, &ix->tabv, &ix->keyv);\r\n    copyTV(J->L, &ix->keyv, &ix->valv);\r\n    copyTV(J->L, &ix->valv, &ix->tabv);\r\n    op ^= 3;\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Setup call to cdata comparison metamethod. */\r\nstatic void rec_mm_comp_cdata(jit_State *J, RecordIndex *ix, int op, MMS mm)\r\n{\r\n  lj_snap_add(J);\r\n  if (tref_iscdata(ix->val)) {\r\n    ix->tab = ix->val;\r\n    copyTV(J->L, &ix->tabv, &ix->valv);\r\n  } else {\r\n    lua_assert(tref_iscdata(ix->key));\r\n    ix->tab = ix->key;\r\n    copyTV(J->L, &ix->tabv, &ix->keyv);\r\n  }\r\n  lj_record_mm_lookup(J, ix, mm);\r\n  rec_mm_callcomp(J, ix, op);\r\n}\r\n#endif\r\n\r\n/* -- Indexed access ------------------------------------------------------ */\r\n\r\n/* Record bounds-check. */\r\nstatic void rec_idx_abc(jit_State *J, TRef asizeref, TRef ikey, uint32_t asize)\r\n{\r\n  /* Try to emit invariant bounds checks. */\r\n  if ((J->flags & (JIT_F_OPT_LOOP|JIT_F_OPT_ABC)) ==\r\n      (JIT_F_OPT_LOOP|JIT_F_OPT_ABC)) {\r\n    IRRef ref = tref_ref(ikey);\r\n    IRIns *ir = IR(ref);\r\n    int32_t ofs = 0;\r\n    IRRef ofsref = 0;\r\n    /* Handle constant offsets. */\r\n    if (ir->o == IR_ADD && irref_isk(ir->op2)) {\r\n      ofsref = ir->op2;\r\n      ofs = IR(ofsref)->i;\r\n      ref = ir->op1;\r\n      ir = IR(ref);\r\n    }\r\n    /* Got scalar evolution analysis results for this reference? */\r\n    if (ref == J->scev.idx) {\r\n      int32_t stop;\r\n      lua_assert(irt_isint(J->scev.t) && ir->o == IR_SLOAD);\r\n      stop = numberVint(&(J->L->base - J->baseslot)[ir->op1 + FORL_STOP]);\r\n      /* Runtime value for stop of loop is within bounds? */\r\n      if ((uint64_t)stop + ofs < (uint64_t)asize) {\r\n\t/* Emit invariant bounds check for stop. */\r\n\temitir(IRTG(IR_ABC, IRT_P32), asizeref, ofs == 0 ? J->scev.stop :\r\n\t       emitir(IRTI(IR_ADD), J->scev.stop, ofsref));\r\n\t/* Emit invariant bounds check for start, if not const or negative. */\r\n\tif (!(J->scev.dir && J->scev.start &&\r\n\t      (int64_t)IR(J->scev.start)->i + ofs >= 0))\r\n\t  emitir(IRTG(IR_ABC, IRT_P32), asizeref, ikey);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  emitir(IRTGI(IR_ABC), asizeref, ikey);  /* Emit regular bounds check. */\r\n}\r\n\r\n/* Record indexed key lookup. */\r\nstatic TRef rec_idx_key(jit_State *J, RecordIndex *ix)\r\n{\r\n  TRef key;\r\n  GCtab *t = tabV(&ix->tabv);\r\n  ix->oldv = lj_tab_get(J->L, t, &ix->keyv);  /* Lookup previous value. */\r\n\r\n  /* Integer keys are looked up in the array part first. */\r\n  key = ix->key;\r\n  if (tref_isnumber(key)) {\r\n    int32_t k = numberVint(&ix->keyv);\r\n    if (!tvisint(&ix->keyv) && numV(&ix->keyv) != (lua_Number)k)\r\n      k = LJ_MAX_ASIZE;\r\n    if ((MSize)k < LJ_MAX_ASIZE) {  /* Potential array key? */\r\n      TRef ikey = lj_opt_narrow_index(J, key);\r\n      TRef asizeref = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_ASIZE);\r\n      if ((MSize)k < t->asize) {  /* Currently an array key? */\r\n\tTRef arrayref;\r\n\trec_idx_abc(J, asizeref, ikey, t->asize);\r\n\tarrayref = emitir(IRT(IR_FLOAD, IRT_P32), ix->tab, IRFL_TAB_ARRAY);\r\n\treturn emitir(IRT(IR_AREF, IRT_P32), arrayref, ikey);\r\n      } else {  /* Currently not in array (may be an array extension)? */\r\n\temitir(IRTGI(IR_ULE), asizeref, ikey);  /* Inv. bounds check. */\r\n\tif (k == 0 && tref_isk(key))\r\n\t  key = lj_ir_knum_zero(J);  /* Canonicalize 0 or +-0.0 to +0.0. */\r\n\t/* And continue with the hash lookup. */\r\n      }\r\n    } else if (!tref_isk(key)) {\r\n      /* We can rule out const numbers which failed the integerness test\r\n      ** above. But all other numbers are potential array keys.\r\n      */\r\n      if (t->asize == 0) {  /* True sparse tables have an empty array part. */\r\n\t/* Guard that the array part stays empty. */\r\n\tTRef tmp = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_ASIZE);\r\n\temitir(IRTGI(IR_EQ), tmp, lj_ir_kint(J, 0));\r\n      } else {\r\n\tlj_trace_err(J, LJ_TRERR_NYITMIX);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Otherwise the key is located in the hash part. */\r\n  if (t->hmask == 0) {  /* Shortcut for empty hash part. */\r\n    /* Guard that the hash part stays empty. */\r\n    TRef tmp = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_HMASK);\r\n    emitir(IRTGI(IR_EQ), tmp, lj_ir_kint(J, 0));\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  }\r\n  if (tref_isinteger(key))  /* Hash keys are based on numbers, not ints. */\r\n    key = emitir(IRTN(IR_CONV), key, IRCONV_NUM_INT);\r\n  if (tref_isk(key)) {\r\n    /* Optimize lookup of constant hash keys. */\r\n    MSize hslot = (MSize)((char *)ix->oldv - (char *)&noderef(t->node)[0].val);\r\n    if (t->hmask > 0 && hslot <= t->hmask*(MSize)sizeof(Node) &&\r\n\thslot <= 65535*(MSize)sizeof(Node)) {\r\n      TRef node, kslot;\r\n      TRef hm = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_HMASK);\r\n      emitir(IRTGI(IR_EQ), hm, lj_ir_kint(J, (int32_t)t->hmask));\r\n      node = emitir(IRT(IR_FLOAD, IRT_P32), ix->tab, IRFL_TAB_NODE);\r\n      kslot = lj_ir_kslot(J, key, hslot / sizeof(Node));\r\n      return emitir(IRTG(IR_HREFK, IRT_P32), node, kslot);\r\n    }\r\n  }\r\n  /* Fall back to a regular hash lookup. */\r\n  return emitir(IRT(IR_HREF, IRT_P32), ix->tab, key);\r\n}\r\n\r\n/* Determine whether a key is NOT one of the fast metamethod names. */\r\nstatic int nommstr(jit_State *J, TRef key)\r\n{\r\n  if (tref_isstr(key)) {\r\n    if (tref_isk(key)) {\r\n      GCstr *str = ir_kstr(IR(tref_ref(key)));\r\n      uint32_t mm;\r\n      for (mm = 0; mm <= MM_FAST; mm++)\r\n\tif (mmname_str(J2G(J), mm) == str)\r\n\t  return 0;  /* MUST be one the fast metamethod names. */\r\n    } else {\r\n      return 0;  /* Variable string key MAY be a metamethod name. */\r\n    }\r\n  }\r\n  return 1;  /* CANNOT be a metamethod name. */\r\n}\r\n\r\n/* Record indexed load/store. */\r\nTRef lj_record_idx(jit_State *J, RecordIndex *ix)\r\n{\r\n  TRef xref;\r\n  IROp xrefop, loadop;\r\n  cTValue *oldv;\r\n\r\n  while (!tref_istab(ix->tab)) { /* Handle non-table lookup. */\r\n    /* Never call raw lj_record_idx() on non-table. */\r\n    lua_assert(ix->idxchain != 0);\r\n    if (!lj_record_mm_lookup(J, ix, ix->val ? MM_newindex : MM_index))\r\n      lj_trace_err(J, LJ_TRERR_NOMM);\r\n  handlemm:\r\n    if (tref_isfunc(ix->mobj)) {  /* Handle metamethod call. */\r\n      BCReg func = rec_mm_prep(J, ix->val ? lj_cont_nop : lj_cont_ra);\r\n      TRef *base = J->base + func;\r\n      TValue *tv = J->L->base + func;\r\n      base[0] = ix->mobj; base[1] = ix->tab; base[2] = ix->key;\r\n      setfuncV(J->L, tv+0, funcV(&ix->mobjv));\r\n      copyTV(J->L, tv+1, &ix->tabv);\r\n      copyTV(J->L, tv+2, &ix->keyv);\r\n      if (ix->val) {\r\n\tbase[3] = ix->val;\r\n\tcopyTV(J->L, tv+3, &ix->valv);\r\n\tlj_record_call(J, func, 3);  /* mobj(tab, key, val) */\r\n\treturn 0;\r\n      } else {\r\n\tlj_record_call(J, func, 2);  /* res = mobj(tab, key) */\r\n\treturn 0;  /* No result yet. */\r\n      }\r\n    }\r\n    /* Otherwise retry lookup with metaobject. */\r\n    ix->tab = ix->mobj;\r\n    copyTV(J->L, &ix->tabv, &ix->mobjv);\r\n    if (--ix->idxchain == 0)\r\n      lj_trace_err(J, LJ_TRERR_IDXLOOP);\r\n  }\r\n\r\n  /* First catch nil and NaN keys for tables. */\r\n  if (tvisnil(&ix->keyv) || (tvisnum(&ix->keyv) && tvisnan(&ix->keyv))) {\r\n    if (ix->val)  /* Better fail early. */\r\n      lj_trace_err(J, LJ_TRERR_STORENN);\r\n    if (tref_isk(ix->key)) {\r\n      if (ix->idxchain && lj_record_mm_lookup(J, ix, MM_index))\r\n\tgoto handlemm;\r\n      return TREF_NIL;\r\n    }\r\n  }\r\n\r\n  /* Record the key lookup. */\r\n  xref = rec_idx_key(J, ix);\r\n  xrefop = IR(tref_ref(xref))->o;\r\n  loadop = xrefop == IR_AREF ? IR_ALOAD : IR_HLOAD;\r\n  /* The lj_meta_tset() inconsistency is gone, but better play safe. */\r\n  oldv = xrefop == IR_KKPTR ? (cTValue *)ir_kptr(IR(tref_ref(xref))) : ix->oldv;\r\n\r\n  if (ix->val == 0) {  /* Indexed load */\r\n    IRType t = itype2irt(oldv);\r\n    TRef res;\r\n    if (oldv == niltvg(J2G(J))) {\r\n      emitir(IRTG(IR_EQ, IRT_P32), xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      res = TREF_NIL;\r\n    } else {\r\n      res = emitir(IRTG(loadop, t), xref, 0);\r\n    }\r\n    if (t == IRT_NIL && ix->idxchain && lj_record_mm_lookup(J, ix, MM_index))\r\n      goto handlemm;\r\n    if (irtype_ispri(t)) res = TREF_PRI(t);  /* Canonicalize primitives. */\r\n    return res;\r\n  } else {  /* Indexed store. */\r\n    GCtab *mt = tabref(tabV(&ix->tabv)->metatable);\r\n    int keybarrier = tref_isgcv(ix->key) && !tref_isnil(ix->val);\r\n    if (tvisnil(oldv)) {  /* Previous value was nil? */\r\n      /* Need to duplicate the hasmm check for the early guards. */\r\n      int hasmm = 0;\r\n      if (ix->idxchain && mt) {\r\n\tcTValue *mo = lj_tab_getstr(mt, mmname_str(J2G(J), MM_newindex));\r\n\thasmm = mo && !tvisnil(mo);\r\n      }\r\n      if (hasmm)\r\n\temitir(IRTG(loadop, IRT_NIL), xref, 0);  /* Guard for nil value. */\r\n      else if (xrefop == IR_HREF)\r\n\temitir(IRTG(oldv == niltvg(J2G(J)) ? IR_EQ : IR_NE, IRT_P32),\r\n\t       xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      if (ix->idxchain && lj_record_mm_lookup(J, ix, MM_newindex)) {\r\n\tlua_assert(hasmm);\r\n\tgoto handlemm;\r\n      }\r\n      lua_assert(!hasmm);\r\n      if (oldv == niltvg(J2G(J))) {  /* Need to insert a new key. */\r\n\tTRef key = ix->key;\r\n\tif (tref_isinteger(key))  /* NEWREF needs a TValue as a key. */\r\n\t  key = emitir(IRTN(IR_CONV), key, IRCONV_NUM_INT);\r\n\txref = emitir(IRT(IR_NEWREF, IRT_P32), ix->tab, key);\r\n\tkeybarrier = 0;  /* NEWREF already takes care of the key barrier. */\r\n      }\r\n    } else if (!lj_opt_fwd_wasnonnil(J, loadop, tref_ref(xref))) {\r\n      /* Cannot derive that the previous value was non-nil, must do checks. */\r\n      if (xrefop == IR_HREF)  /* Guard against store to niltv. */\r\n\temitir(IRTG(IR_NE, IRT_P32), xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      if (ix->idxchain) {  /* Metamethod lookup required? */\r\n\t/* A check for NULL metatable is cheaper (hoistable) than a load. */\r\n\tif (!mt) {\r\n\t  TRef mtref = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_TAB_META);\r\n\t  emitir(IRTG(IR_EQ, IRT_TAB), mtref, lj_ir_knull(J, IRT_TAB));\r\n\t} else {\r\n\t  IRType t = itype2irt(oldv);\r\n\t  emitir(IRTG(loadop, t), xref, 0);  /* Guard for non-nil value. */\r\n\t}\r\n      }\r\n    } else {\r\n      keybarrier = 0;  /* Previous non-nil value kept the key alive. */\r\n    }\r\n    /* Convert int to number before storing. */\r\n    if (!LJ_DUALNUM && tref_isinteger(ix->val))\r\n      ix->val = emitir(IRTN(IR_CONV), ix->val, IRCONV_NUM_INT);\r\n    emitir(IRT(loadop+IRDELTA_L2S, tref_type(ix->val)), xref, ix->val);\r\n    if (keybarrier || tref_isgcv(ix->val))\r\n      emitir(IRT(IR_TBAR, IRT_NIL), ix->tab, 0);\r\n    /* Invalidate neg. metamethod cache for stores with certain string keys. */\r\n    if (!nommstr(J, ix->key)) {\r\n      TRef fref = emitir(IRT(IR_FREF, IRT_P32), ix->tab, IRFL_TAB_NOMM);\r\n      emitir(IRT(IR_FSTORE, IRT_U8), fref, lj_ir_kint(J, 0));\r\n    }\r\n    J->needsnap = 1;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* -- Upvalue access ------------------------------------------------------ */\r\n\r\n/* Check whether upvalue is immutable and ok to constify. */\r\nstatic int rec_upvalue_constify(jit_State *J, GCupval *uvp)\r\n{\r\n  if (uvp->immutable) {\r\n    cTValue *o = uvval(uvp);\r\n    /* Don't constify objects that may retain large amounts of memory. */\r\n#if LJ_HASFFI\r\n    if (tviscdata(o)) {\r\n      GCcdata *cd = cdataV(o);\r\n      if (!cdataisv(cd) && !(cd->marked & LJ_GC_CDATA_FIN)) {\r\n\tCType *ct = ctype_raw(ctype_ctsG(J2G(J)), cd->ctypeid);\r\n\tif (!ctype_hassize(ct->info) || ct->size <= 16)\r\n\t  return 1;\r\n      }\r\n      return 0;\r\n    }\r\n#else\r\n    UNUSED(J);\r\n#endif\r\n    if (!(tvistab(o) || tvisudata(o) || tvisthread(o)))\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Record upvalue load/store. */\r\nstatic TRef rec_upvalue(jit_State *J, uint32_t uv, TRef val)\r\n{\r\n  GCupval *uvp = &gcref(J->fn->l.uvptr[uv])->uv;\r\n  TRef fn = getcurrf(J);\r\n  IRRef uref;\r\n  int needbarrier = 0;\r\n  if (rec_upvalue_constify(J, uvp)) {  /* Try to constify immutable upvalue. */\r\n    TRef tr, kfunc;\r\n    lua_assert(val == 0);\r\n    if (!tref_isk(fn)) {  /* Late specialization of current function. */\r\n      if (J->pt->flags >= PROTO_CLC_POLY)\r\n\tgoto noconstify;\r\n      kfunc = lj_ir_kfunc(J, J->fn);\r\n      emitir(IRTG(IR_EQ, IRT_FUNC), fn, kfunc);\r\n      J->base[-1] = TREF_FRAME | kfunc;\r\n      fn = kfunc;\r\n    }\r\n    tr = lj_record_constify(J, uvval(uvp));\r\n    if (tr)\r\n      return tr;\r\n  }\r\nnoconstify:\r\n  /* Note: this effectively limits LJ_MAX_UPVAL to 127. */\r\n  uv = (uv << 8) | (hashrot(uvp->dhash, uvp->dhash + HASH_BIAS) & 0xff);\r\n  if (!uvp->closed) {\r\n    /* In current stack? */\r\n    if (uvval(uvp) >= tvref(J->L->stack) &&\r\n\tuvval(uvp) < tvref(J->L->maxstack)) {\r\n      int32_t slot = (int32_t)(uvval(uvp) - (J->L->base - J->baseslot));\r\n      if (slot >= 0) {  /* Aliases an SSA slot? */\r\n\tslot -= (int32_t)J->baseslot;  /* Note: slot number may be negative! */\r\n\t/* NYI: add IR to guard that it's still aliasing the same slot. */\r\n\tif (val == 0) {\r\n\t  return getslot(J, slot);\r\n\t} else {\r\n\t  J->base[slot] = val;\r\n\t  if (slot >= (int32_t)J->maxslot) J->maxslot = (BCReg)(slot+1);\r\n\t  return 0;\r\n\t}\r\n      }\r\n    }\r\n    uref = tref_ref(emitir(IRTG(IR_UREFO, IRT_P32), fn, uv));\r\n  } else {\r\n    needbarrier = 1;\r\n    uref = tref_ref(emitir(IRTG(IR_UREFC, IRT_P32), fn, uv));\r\n  }\r\n  if (val == 0) {  /* Upvalue load */\r\n    IRType t = itype2irt(uvval(uvp));\r\n    TRef res = emitir(IRTG(IR_ULOAD, t), uref, 0);\r\n    if (irtype_ispri(t)) res = TREF_PRI(t);  /* Canonicalize primitive refs. */\r\n    return res;\r\n  } else {  /* Upvalue store. */\r\n    /* Convert int to number before storing. */\r\n    if (!LJ_DUALNUM && tref_isinteger(val))\r\n      val = emitir(IRTN(IR_CONV), val, IRCONV_NUM_INT);\r\n    emitir(IRT(IR_USTORE, tref_type(val)), uref, val);\r\n    if (needbarrier && tref_isgcv(val))\r\n      emitir(IRT(IR_OBAR, IRT_NIL), uref, val);\r\n    J->needsnap = 1;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* -- Record calls to Lua functions --------------------------------------- */\r\n\r\n/* Check unroll limits for calls. */\r\nstatic void check_call_unroll(jit_State *J, TraceNo lnk)\r\n{\r\n  cTValue *frame = J->L->base - 1;\r\n  void *pc = mref(frame_func(frame)->l.pc, void);\r\n  int32_t depth = J->framedepth;\r\n  int32_t count = 0;\r\n  if ((J->pt->flags & PROTO_VARARG)) depth--;  /* Vararg frame still missing. */\r\n  for (; depth > 0; depth--) {  /* Count frames with same prototype. */\r\n    if (frame_iscont(frame)) depth--;\r\n    frame = frame_prev(frame);\r\n    if (mref(frame_func(frame)->l.pc, void) == pc)\r\n      count++;\r\n  }\r\n  if (J->pc == J->startpc) {\r\n    if (count + J->tailcalled > J->param[JIT_P_recunroll]) {\r\n      J->pc++;\r\n      if (J->framedepth + J->retdepth == 0)\r\n\trec_stop(J, LJ_TRLINK_TAILREC, J->cur.traceno);  /* Tail-recursion. */\r\n      else\r\n\trec_stop(J, LJ_TRLINK_UPREC, J->cur.traceno);  /* Up-recursion. */\r\n    }\r\n  } else {\r\n    if (count > J->param[JIT_P_callunroll]) {\r\n      if (lnk) {  /* Possible tail- or up-recursion. */\r\n\tlj_trace_flush(J, lnk);  /* Flush trace that only returns. */\r\n\t/* Set a small, pseudo-random hotcount for a quick retry of JFUNC*. */\r\n\thotcount_set(J2GG(J), J->pc+1, LJ_PRNG_BITS(J, 4));\r\n      }\r\n      lj_trace_err(J, LJ_TRERR_CUNROLL);\r\n    }\r\n  }\r\n}\r\n\r\n/* Record Lua function setup. */\r\nstatic void rec_func_setup(jit_State *J)\r\n{\r\n  GCproto *pt = J->pt;\r\n  BCReg s, numparams = pt->numparams;\r\n  if ((pt->flags & PROTO_NOJIT))\r\n    lj_trace_err(J, LJ_TRERR_CJITOFF);\r\n  if (J->baseslot + pt->framesize >= LJ_MAX_JSLOTS)\r\n    lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  /* Fill up missing parameters with nil. */\r\n  for (s = J->maxslot; s < numparams; s++)\r\n    J->base[s] = TREF_NIL;\r\n  /* The remaining slots should never be read before they are written. */\r\n  J->maxslot = numparams;\r\n}\r\n\r\n/* Record Lua vararg function setup. */\r\nstatic void rec_func_vararg(jit_State *J)\r\n{\r\n  GCproto *pt = J->pt;\r\n  BCReg s, fixargs, vframe = J->maxslot+1;\r\n  lua_assert((pt->flags & PROTO_VARARG));\r\n  if (J->baseslot + vframe + pt->framesize >= LJ_MAX_JSLOTS)\r\n    lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  J->base[vframe-1] = J->base[-1];  /* Copy function up. */\r\n  /* Copy fixarg slots up and set their original slots to nil. */\r\n  fixargs = pt->numparams < J->maxslot ? pt->numparams : J->maxslot;\r\n  for (s = 0; s < fixargs; s++) {\r\n    J->base[vframe+s] = J->base[s];\r\n    J->base[s] = TREF_NIL;\r\n  }\r\n  J->maxslot = fixargs;\r\n  J->framedepth++;\r\n  J->base += vframe;\r\n  J->baseslot += vframe;\r\n}\r\n\r\n/* Record entry to a Lua function. */\r\nstatic void rec_func_lua(jit_State *J)\r\n{\r\n  rec_func_setup(J);\r\n  check_call_unroll(J, 0);\r\n}\r\n\r\n/* Record entry to an already compiled function. */\r\nstatic void rec_func_jit(jit_State *J, TraceNo lnk)\r\n{\r\n  GCtrace *T;\r\n  rec_func_setup(J);\r\n  T = traceref(J, lnk);\r\n  if (T->linktype == LJ_TRLINK_RETURN) {  /* Trace returns to interpreter? */\r\n    check_call_unroll(J, lnk);\r\n    /* Temporarily unpatch JFUNC* to continue recording across function. */\r\n    J->patchins = *J->pc;\r\n    J->patchpc = (BCIns *)J->pc;\r\n    *J->patchpc = T->startins;\r\n    return;\r\n  }\r\n  J->instunroll = 0;  /* Cannot continue across a compiled function. */\r\n  if (J->pc == J->startpc && J->framedepth + J->retdepth == 0)\r\n    rec_stop(J, LJ_TRLINK_TAILREC, J->cur.traceno);  /* Extra tail-recursion. */\r\n  else\r\n    rec_stop(J, LJ_TRLINK_ROOT, lnk);  /* Link to the function. */\r\n}\r\n\r\n/* -- Vararg handling ----------------------------------------------------- */\r\n\r\n/* Detect y = select(x, ...) idiom. */\r\nstatic int select_detect(jit_State *J)\r\n{\r\n  BCIns ins = J->pc[1];\r\n  if (bc_op(ins) == BC_CALLM && bc_b(ins) == 2 && bc_c(ins) == 1) {\r\n    cTValue *func = &J->L->base[bc_a(ins)];\r\n    if (tvisfunc(func) && funcV(func)->c.ffid == FF_select)\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Record vararg instruction. */\r\nstatic void rec_varg(jit_State *J, BCReg dst, ptrdiff_t nresults)\r\n{\r\n  int32_t numparams = J->pt->numparams;\r\n  ptrdiff_t nvararg = frame_delta(J->L->base-1) - numparams - 1;\r\n  lua_assert(frame_isvarg(J->L->base-1));\r\n  if (J->framedepth > 0) {  /* Simple case: varargs defined on-trace. */\r\n    ptrdiff_t i;\r\n    if (nvararg < 0) nvararg = 0;\r\n    if (nresults == -1) {\r\n      nresults = nvararg;\r\n      J->maxslot = dst + (BCReg)nvararg;\r\n    } else if (dst + nresults > J->maxslot) {\r\n      J->maxslot = dst + (BCReg)nresults;\r\n    }\r\n    for (i = 0; i < nresults; i++)\r\n      J->base[dst+i] = i < nvararg ? getslot(J, i - nvararg - 1) : TREF_NIL;\r\n  } else {  /* Unknown number of varargs passed to trace. */\r\n    TRef fr = emitir(IRTI(IR_SLOAD), 0, IRSLOAD_READONLY|IRSLOAD_FRAME);\r\n    int32_t frofs = 8*(1+numparams)+FRAME_VARG;\r\n    if (nresults >= 0) {  /* Known fixed number of results. */\r\n      ptrdiff_t i;\r\n      if (nvararg > 0) {\r\n\tptrdiff_t nload = nvararg >= nresults ? nresults : nvararg;\r\n\tTRef vbase;\r\n\tif (nvararg >= nresults)\r\n\t  emitir(IRTGI(IR_GE), fr, lj_ir_kint(J, frofs+8*(int32_t)nresults));\r\n\telse\r\n\t  emitir(IRTGI(IR_EQ), fr, lj_ir_kint(J, frame_ftsz(J->L->base-1)));\r\n\tvbase = emitir(IRTI(IR_SUB), REF_BASE, fr);\r\n\tvbase = emitir(IRT(IR_ADD, IRT_P32), vbase, lj_ir_kint(J, frofs-8));\r\n\tfor (i = 0; i < nload; i++) {\r\n\t  IRType t = itype2irt(&J->L->base[i-1-nvararg]);\r\n\t  TRef aref = emitir(IRT(IR_AREF, IRT_P32),\r\n\t\t\t     vbase, lj_ir_kint(J, (int32_t)i));\r\n\t  TRef tr = emitir(IRTG(IR_VLOAD, t), aref, 0);\r\n\t  if (irtype_ispri(t)) tr = TREF_PRI(t);  /* Canonicalize primitives. */\r\n\t  J->base[dst+i] = tr;\r\n\t}\r\n      } else {\r\n\temitir(IRTGI(IR_LE), fr, lj_ir_kint(J, frofs));\r\n\tnvararg = 0;\r\n      }\r\n      for (i = nvararg; i < nresults; i++)\r\n\tJ->base[dst+i] = TREF_NIL;\r\n      if (dst + (BCReg)nresults > J->maxslot)\r\n\tJ->maxslot = dst + (BCReg)nresults;\r\n    } else if (select_detect(J)) {  /* y = select(x, ...) */\r\n      TRef tridx = J->base[dst-1];\r\n      TRef tr = TREF_NIL;\r\n      ptrdiff_t idx = lj_ffrecord_select_mode(J, tridx, &J->L->base[dst-1]);\r\n      if (idx < 0) goto nyivarg;\r\n      if (idx != 0 && !tref_isinteger(tridx))\r\n\ttridx = emitir(IRTGI(IR_CONV), tridx, IRCONV_INT_NUM|IRCONV_INDEX);\r\n      if (idx != 0 && tref_isk(tridx)) {\r\n\temitir(IRTGI(idx <= nvararg ? IR_GE : IR_LT),\r\n\t       fr, lj_ir_kint(J, frofs+8*(int32_t)idx));\r\n\tfrofs -= 8;  /* Bias for 1-based index. */\r\n      } else if (idx <= nvararg) {  /* Compute size. */\r\n\tTRef tmp = emitir(IRTI(IR_ADD), fr, lj_ir_kint(J, -frofs));\r\n\tif (numparams)\r\n\t  emitir(IRTGI(IR_GE), tmp, lj_ir_kint(J, 0));\r\n\ttr = emitir(IRTI(IR_BSHR), tmp, lj_ir_kint(J, 3));\r\n\tif (idx != 0) {\r\n\t  tridx = emitir(IRTI(IR_ADD), tridx, lj_ir_kint(J, -1));\r\n\t  rec_idx_abc(J, tr, tridx, (uint32_t)nvararg);\r\n\t}\r\n      } else {\r\n\tTRef tmp = lj_ir_kint(J, frofs);\r\n\tif (idx != 0) {\r\n\t  TRef tmp2 = emitir(IRTI(IR_BSHL), tridx, lj_ir_kint(J, 3));\r\n\t  tmp = emitir(IRTI(IR_ADD), tmp2, tmp);\r\n\t} else {\r\n\t  tr = lj_ir_kint(J, 0);\r\n\t}\r\n\temitir(IRTGI(IR_LT), fr, tmp);\r\n      }\r\n      if (idx != 0 && idx <= nvararg) {\r\n\tIRType t;\r\n\tTRef aref, vbase = emitir(IRTI(IR_SUB), REF_BASE, fr);\r\n\tvbase = emitir(IRT(IR_ADD, IRT_P32), vbase, lj_ir_kint(J, frofs-8));\r\n\tt = itype2irt(&J->L->base[idx-2-nvararg]);\r\n\taref = emitir(IRT(IR_AREF, IRT_P32), vbase, tridx);\r\n\ttr = emitir(IRTG(IR_VLOAD, t), aref, 0);\r\n\tif (irtype_ispri(t)) tr = TREF_PRI(t);  /* Canonicalize primitives. */\r\n      }\r\n      J->base[dst-2] = tr;\r\n      J->maxslot = dst-1;\r\n      J->bcskip = 2;  /* Skip CALLM + select. */\r\n    } else {\r\n    nyivarg:\r\n      setintV(&J->errinfo, BC_VARG);\r\n      lj_trace_err_info(J, LJ_TRERR_NYIBC);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Record allocations -------------------------------------------------- */\r\n\r\nstatic TRef rec_tnew(jit_State *J, uint32_t ah)\r\n{\r\n  uint32_t asize = ah & 0x7ff;\r\n  uint32_t hbits = ah >> 11;\r\n  if (asize == 0x7ff) asize = 0x801;\r\n  return emitir(IRTG(IR_TNEW, IRT_TAB), asize, hbits);\r\n}\r\n\r\n/* -- Record bytecode ops ------------------------------------------------- */\r\n\r\n/* Prepare for comparison. */\r\nstatic void rec_comp_prep(jit_State *J)\r\n{\r\n  /* Prevent merging with snapshot #0 (GC exit) since we fixup the PC. */\r\n  if (J->cur.nsnap == 1 && J->cur.snap[0].ref == J->cur.nins)\r\n    emitir_raw(IRT(IR_NOP, IRT_NIL), 0, 0);\r\n  lj_snap_add(J);\r\n}\r\n\r\n/* Fixup comparison. */\r\nstatic void rec_comp_fixup(jit_State *J, const BCIns *pc, int cond)\r\n{\r\n  BCIns jmpins = pc[1];\r\n  const BCIns *npc = pc + 2 + (cond ? bc_j(jmpins) : 0);\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n  /* Set PC to opposite target to avoid re-recording the comp. in side trace. */\r\n  J->cur.snapmap[snap->mapofs + snap->nent] = SNAP_MKPC(npc);\r\n  J->needsnap = 1;\r\n  if (bc_a(jmpins) < J->maxslot) J->maxslot = bc_a(jmpins);\r\n  lj_snap_shrink(J);  /* Shrink last snapshot if possible. */\r\n}\r\n\r\n/* Record the next bytecode instruction (_before_ it's executed). */\r\nvoid lj_record_ins(jit_State *J)\r\n{\r\n  cTValue *lbase;\r\n  RecordIndex ix;\r\n  const BCIns *pc;\r\n  BCIns ins;\r\n  BCOp op;\r\n  TRef ra, rb, rc;\r\n\r\n  /* Perform post-processing action before recording the next instruction. */\r\n  if (LJ_UNLIKELY(J->postproc != LJ_POST_NONE)) {\r\n    switch (J->postproc) {\r\n    case LJ_POST_FIXCOMP:  /* Fixup comparison. */\r\n      pc = frame_pc(&J2G(J)->tmptv);\r\n      rec_comp_fixup(J, pc, (!tvistruecond(&J2G(J)->tmptv2) ^ (bc_op(*pc)&1)));\r\n      /* fallthrough */\r\n    case LJ_POST_FIXGUARD:  /* Fixup and emit pending guard. */\r\n    case LJ_POST_FIXGUARDSNAP:  /* Fixup and emit pending guard and snapshot. */\r\n      if (!tvistruecond(&J2G(J)->tmptv2)) {\r\n\tJ->fold.ins.o ^= 1;  /* Flip guard to opposite. */\r\n\tif (J->postproc == LJ_POST_FIXGUARDSNAP) {\r\n\t  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n\t  J->cur.snapmap[snap->mapofs+snap->nent-1]--;  /* False -> true. */\r\n\t}\r\n      }\r\n      lj_opt_fold(J);  /* Emit pending guard. */\r\n      /* fallthrough */\r\n    case LJ_POST_FIXBOOL:\r\n      if (!tvistruecond(&J2G(J)->tmptv2)) {\r\n\tBCReg s;\r\n\tTValue *tv = J->L->base;\r\n\tfor (s = 0; s < J->maxslot; s++)  /* Fixup stack slot (if any). */\r\n\t  if (J->base[s] == TREF_TRUE && tvisfalse(&tv[s])) {\r\n\t    J->base[s] = TREF_FALSE;\r\n\t    break;\r\n\t  }\r\n      }\r\n      break;\r\n    case LJ_POST_FIXCONST:\r\n      {\r\n\tBCReg s;\r\n\tTValue *tv = J->L->base;\r\n\tfor (s = 0; s < J->maxslot; s++)  /* Constify stack slots (if any). */\r\n\t  if (J->base[s] == TREF_NIL && !tvisnil(&tv[s]))\r\n\t    J->base[s] = lj_record_constify(J, &tv[s]);\r\n      }\r\n      break;\r\n    case LJ_POST_FFRETRY:  /* Suppress recording of retried fast function. */\r\n      if (bc_op(*J->pc) >= BC__MAX)\r\n\treturn;\r\n      break;\r\n    default: lua_assert(0); break;\r\n    }\r\n    J->postproc = LJ_POST_NONE;\r\n  }\r\n\r\n  /* Need snapshot before recording next bytecode (e.g. after a store). */\r\n  if (J->needsnap) {\r\n    J->needsnap = 0;\r\n    lj_snap_purge(J);\r\n    lj_snap_add(J);\r\n    J->mergesnap = 1;\r\n  }\r\n\r\n  /* Skip some bytecodes. */\r\n  if (LJ_UNLIKELY(J->bcskip > 0)) {\r\n    J->bcskip--;\r\n    return;\r\n  }\r\n\r\n  /* Record only closed loops for root traces. */\r\n  pc = J->pc;\r\n  if (J->framedepth == 0 &&\r\n     (MSize)((char *)pc - (char *)J->bc_min) >= J->bc_extent)\r\n    lj_trace_err(J, LJ_TRERR_LLEAVE);\r\n\r\n#ifdef LUA_USE_ASSERT\r\n  rec_check_slots(J);\r\n  rec_check_ir(J);\r\n#endif\r\n\r\n  /* Keep a copy of the runtime values of var/num/str operands. */\r\n#define rav\t(&ix.valv)\r\n#define rbv\t(&ix.tabv)\r\n#define rcv\t(&ix.keyv)\r\n\r\n  lbase = J->L->base;\r\n  ins = *pc;\r\n  op = bc_op(ins);\r\n  ra = bc_a(ins);\r\n  ix.val = 0;\r\n  switch (bcmode_a(op)) {\r\n  case BCMvar:\r\n    copyTV(J->L, rav, &lbase[ra]); ix.val = ra = getslot(J, ra); break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n  rb = bc_b(ins);\r\n  rc = bc_c(ins);\r\n  switch (bcmode_b(op)) {\r\n  case BCMnone: rb = 0; rc = bc_d(ins); break;  /* Upgrade rc to 'rd'. */\r\n  case BCMvar:\r\n    copyTV(J->L, rbv, &lbase[rb]); ix.tab = rb = getslot(J, rb); break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n  switch (bcmode_c(op)) {\r\n  case BCMvar:\r\n    copyTV(J->L, rcv, &lbase[rc]); ix.key = rc = getslot(J, rc); break;\r\n  case BCMpri: setitype(rcv, ~rc); ix.key = rc = TREF_PRI(IRT_NIL+rc); break;\r\n  case BCMnum: { cTValue *tv = proto_knumtv(J->pt, rc);\r\n    copyTV(J->L, rcv, tv); ix.key = rc = tvisint(tv) ? lj_ir_kint(J, intV(tv)) :\r\n    lj_ir_knumint(J, numV(tv)); } break;\r\n  case BCMstr: { GCstr *s = gco2str(proto_kgc(J->pt, ~(ptrdiff_t)rc));\r\n    setstrV(J->L, rcv, s); ix.key = rc = lj_ir_kstr(J, s); } break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n#if LJ_HASFFI\r\n    if (tref_iscdata(ra) || tref_iscdata(rc)) {\r\n      rec_mm_comp_cdata(J, &ix, op, ((int)op & 2) ? MM_le : MM_lt);\r\n      break;\r\n    }\r\n#endif\r\n    /* Emit nothing for two numeric or string consts. */\r\n    if (!(tref_isk2(ra,rc) && tref_isnumber_str(ra) && tref_isnumber_str(rc))) {\r\n      IRType ta = tref_isinteger(ra) ? IRT_INT : tref_type(ra);\r\n      IRType tc = tref_isinteger(rc) ? IRT_INT : tref_type(rc);\r\n      int irop;\r\n      if (ta != tc) {\r\n\t/* Widen mixed number/int comparisons to number/number comparison. */\r\n\tif (ta == IRT_INT && tc == IRT_NUM) {\r\n\t  ra = emitir(IRTN(IR_CONV), ra, IRCONV_NUM_INT);\r\n\t  ta = IRT_NUM;\r\n\t} else if (ta == IRT_NUM && tc == IRT_INT) {\r\n\t  rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n\t} else if (LJ_52) {\r\n\t  ta = IRT_NIL;  /* Force metamethod for different types. */\r\n\t} else if (!((ta == IRT_FALSE || ta == IRT_TRUE) &&\r\n\t\t     (tc == IRT_FALSE || tc == IRT_TRUE))) {\r\n\t  break;  /* Interpreter will throw for two different types. */\r\n\t}\r\n      }\r\n      rec_comp_prep(J);\r\n      irop = (int)op - (int)BC_ISLT + (int)IR_LT;\r\n      if (ta == IRT_NUM) {\r\n\tif ((irop & 1)) irop ^= 4;  /* ISGE/ISGT are unordered. */\r\n\tif (!lj_ir_numcmp(numberVnum(rav), numberVnum(rcv), (IROp)irop))\r\n\t  irop ^= 5;\r\n      } else if (ta == IRT_INT) {\r\n\tif (!lj_ir_numcmp(numberVnum(rav), numberVnum(rcv), (IROp)irop))\r\n\t  irop ^= 1;\r\n      } else if (ta == IRT_STR) {\r\n\tif (!lj_ir_strcmp(strV(rav), strV(rcv), (IROp)irop)) irop ^= 1;\r\n\tra = lj_ir_call(J, IRCALL_lj_str_cmp, ra, rc);\r\n\trc = lj_ir_kint(J, 0);\r\n\tta = IRT_INT;\r\n      } else {\r\n\trec_mm_comp(J, &ix, (int)op);\r\n\tbreak;\r\n      }\r\n      emitir(IRTG(irop, ta), ra, rc);\r\n      rec_comp_fixup(J, J->pc, ((int)op ^ irop) & 1);\r\n    }\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n  case BC_ISEQS: case BC_ISNES:\r\n  case BC_ISEQN: case BC_ISNEN:\r\n  case BC_ISEQP: case BC_ISNEP:\r\n#if LJ_HASFFI\r\n    if (tref_iscdata(ra) || tref_iscdata(rc)) {\r\n      rec_mm_comp_cdata(J, &ix, op, MM_eq);\r\n      break;\r\n    }\r\n#endif\r\n    /* Emit nothing for two non-table, non-udata consts. */\r\n    if (!(tref_isk2(ra, rc) && !(tref_istab(ra) || tref_isudata(ra)))) {\r\n      int diff;\r\n      rec_comp_prep(J);\r\n      diff = lj_record_objcmp(J, ra, rc, rav, rcv);\r\n      if (diff == 2 || !(tref_istab(ra) || tref_isudata(ra)))\r\n\trec_comp_fixup(J, J->pc, ((int)op & 1) == !diff);\r\n      else if (diff == 1)  /* Only check __eq if different, but same type. */\r\n\trec_mm_equal(J, &ix, (int)op);\r\n    }\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC:\r\n    if ((op & 1) == tref_istruecond(rc))\r\n      rc = 0;  /* Don't store if condition is not true. */\r\n    /* fallthrough */\r\n  case BC_IST: case BC_ISF:  /* Type specialization suffices. */\r\n    if (bc_a(pc[1]) < J->maxslot)\r\n      J->maxslot = bc_a(pc[1]);  /* Shrink used slots. */\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_NOT:\r\n    /* Type specialization already forces const result. */\r\n    rc = tref_istruecond(rc) ? TREF_FALSE : TREF_TRUE;\r\n    break;\r\n\r\n  case BC_LEN:\r\n    if (tref_isstr(rc))\r\n      rc = emitir(IRTI(IR_FLOAD), rc, IRFL_STR_LEN);\r\n    else if (!LJ_52 && tref_istab(rc))\r\n      rc = lj_ir_call(J, IRCALL_lj_tab_len, rc);\r\n    else\r\n      rc = rec_mm_len(J, rc, rcv);\r\n    break;\r\n\r\n  /* -- Arithmetic ops ---------------------------------------------------- */\r\n\r\n  case BC_UNM:\r\n    if (tref_isnumber_str(rc)) {\r\n      rc = lj_opt_narrow_unm(J, rc, rcv);\r\n    } else {\r\n      ix.tab = rc;\r\n      copyTV(J->L, &ix.tabv, rcv);\r\n      rc = rec_mm_arith(J, &ix, MM_unm);\r\n    }\r\n    break;\r\n\r\n  case BC_ADDNV: case BC_SUBNV: case BC_MULNV: case BC_DIVNV: case BC_MODNV:\r\n    /* Swap rb/rc and rbv/rcv. rav is temp. */\r\n    ix.tab = rc; ix.key = rc = rb; rb = ix.tab;\r\n    copyTV(J->L, rav, rbv);\r\n    copyTV(J->L, rbv, rcv);\r\n    copyTV(J->L, rcv, rav);\r\n    if (op == BC_MODNV)\r\n      goto recmod;\r\n    /* fallthrough */\r\n  case BC_ADDVN: case BC_SUBVN: case BC_MULVN: case BC_DIVVN:\r\n  case BC_ADDVV: case BC_SUBVV: case BC_MULVV: case BC_DIVVV: {\r\n    MMS mm = bcmode_mm(op);\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_arith(J, rb, rc, rbv, rcv,\r\n\t\t\t       (int)mm - (int)MM_add + (int)IR_ADD);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, mm);\r\n    break;\r\n    }\r\n\r\n  case BC_MODVN: case BC_MODVV:\r\n  recmod:\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_mod(J, rb, rc, rcv);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, MM_mod);\r\n    break;\r\n\r\n  case BC_POW:\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_pow(J, lj_ir_tonum(J, rb), rc, rcv);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, MM_pow);\r\n    break;\r\n\r\n  /* -- Constant and move ops --------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    /* Clear gap of method call to avoid resurrecting previous refs. */\r\n    if (ra > J->maxslot) J->base[ra-1] = 0;\r\n    break;\r\n  case BC_KSTR: case BC_KNUM: case BC_KPRI:\r\n    break;\r\n  case BC_KSHORT:\r\n    rc = lj_ir_kint(J, (int32_t)(int16_t)rc);\r\n    break;\r\n  case BC_KNIL:\r\n    while (ra <= rc)\r\n      J->base[ra++] = TREF_NIL;\r\n    if (rc >= J->maxslot) J->maxslot = rc+1;\r\n    break;\r\n#if LJ_HASFFI\r\n  case BC_KCDATA:\r\n    rc = lj_ir_kgc(J, proto_kgc(J->pt, ~(ptrdiff_t)rc), IRT_CDATA);\r\n    break;\r\n#endif\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    rc = rec_upvalue(J, rc, 0);\r\n    break;\r\n  case BC_USETV: case BC_USETS: case BC_USETN: case BC_USETP:\r\n    rec_upvalue(J, ra, rc);\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_GGET: case BC_GSET:\r\n    settabV(J->L, &ix.tabv, tabref(J->fn->l.env));\r\n    ix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), getcurrf(J), IRFL_FUNC_ENV);\r\n    ix.idxchain = LJ_MAX_IDXCHAIN;\r\n    rc = lj_record_idx(J, &ix);\r\n    break;\r\n\r\n  case BC_TGETB: case BC_TSETB:\r\n    setintV(&ix.keyv, (int32_t)rc);\r\n    ix.key = lj_ir_kint(J, (int32_t)rc);\r\n    /* fallthrough */\r\n  case BC_TGETV: case BC_TGETS: case BC_TSETV: case BC_TSETS:\r\n    ix.idxchain = LJ_MAX_IDXCHAIN;\r\n    rc = lj_record_idx(J, &ix);\r\n    break;\r\n\r\n  case BC_TNEW:\r\n    rc = rec_tnew(J, rc);\r\n    break;\r\n  case BC_TDUP:\r\n    rc = emitir(IRTG(IR_TDUP, IRT_TAB),\r\n\t\tlj_ir_ktab(J, gco2tab(proto_kgc(J->pt, ~(ptrdiff_t)rc))), 0);\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_ITERC:\r\n    J->base[ra] = getslot(J, ra-3);\r\n    J->base[ra+1] = getslot(J, ra-2);\r\n    J->base[ra+2] = getslot(J, ra-1);\r\n    { /* Do the actual copy now because lj_record_call needs the values. */\r\n      TValue *b = &J->L->base[ra];\r\n      copyTV(J->L, b, b-3);\r\n      copyTV(J->L, b+1, b-2);\r\n      copyTV(J->L, b+2, b-1);\r\n    }\r\n    lj_record_call(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  /* L->top is set to L->base+ra+rc+NARGS-1+1. See lj_dispatch_ins(). */\r\n  case BC_CALLM:\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra;\r\n    /* fallthrough */\r\n  case BC_CALL:\r\n    lj_record_call(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra;\r\n    /* fallthrough */\r\n  case BC_CALLT:\r\n    lj_record_tailcall(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  case BC_VARG:\r\n    rec_varg(J, ra, (ptrdiff_t)rb-1);\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    /* L->top is set to L->base+ra+rc+NRESULTS-1, see lj_dispatch_ins(). */\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra + 1;\r\n    /* fallthrough */\r\n  case BC_RET: case BC_RET0: case BC_RET1:\r\n    lj_record_ret(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORI:\r\n    if (rec_for(J, pc, 0) != LOOPEV_LEAVE)\r\n      J->loopref = J->cur.nins;\r\n    break;\r\n  case BC_JFORI:\r\n    lua_assert(bc_op(pc[(ptrdiff_t)rc-BCBIAS_J]) == BC_JFORL);\r\n    if (rec_for(J, pc, 0) != LOOPEV_LEAVE)  /* Link to existing loop. */\r\n      rec_stop(J, LJ_TRLINK_ROOT, bc_d(pc[(ptrdiff_t)rc-BCBIAS_J]));\r\n    /* Continue tracing if the loop is not entered. */\r\n    break;\r\n\r\n  case BC_FORL:\r\n    rec_loop_interp(J, pc, rec_for(J, pc+((ptrdiff_t)rc-BCBIAS_J), 1));\r\n    break;\r\n  case BC_ITERL:\r\n    rec_loop_interp(J, pc, rec_iterl(J, *pc));\r\n    break;\r\n  case BC_LOOP:\r\n    rec_loop_interp(J, pc, rec_loop(J, ra));\r\n    break;\r\n\r\n  case BC_JFORL:\r\n    rec_loop_jit(J, rc, rec_for(J, pc+bc_j(traceref(J, rc)->startins), 1));\r\n    break;\r\n  case BC_JITERL:\r\n    rec_loop_jit(J, rc, rec_iterl(J, traceref(J, rc)->startins));\r\n    break;\r\n  case BC_JLOOP:\r\n    rec_loop_jit(J, rc, rec_loop(J, ra));\r\n    break;\r\n\r\n  case BC_IFORL:\r\n  case BC_IITERL:\r\n  case BC_ILOOP:\r\n  case BC_IFUNCF:\r\n  case BC_IFUNCV:\r\n    lj_trace_err(J, LJ_TRERR_BLACKL);\r\n    break;\r\n\r\n  case BC_JMP:\r\n    if (ra < J->maxslot)\r\n      J->maxslot = ra;  /* Shrink used slots. */\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    rec_func_lua(J);\r\n    break;\r\n  case BC_JFUNCF:\r\n    rec_func_jit(J, rc);\r\n    break;\r\n\r\n  case BC_FUNCV:\r\n    rec_func_vararg(J);\r\n    rec_func_lua(J);\r\n    break;\r\n  case BC_JFUNCV:\r\n    lua_assert(0);  /* Cannot happen. No hotcall counting for varag funcs. */\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    lj_ffrecord_func(J);\r\n    break;\r\n\r\n  default:\r\n    if (op >= BC__MAX) {\r\n      lj_ffrecord_func(J);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case BC_ITERN:\r\n  case BC_ISNEXT:\r\n  case BC_CAT:\r\n  case BC_UCLO:\r\n  case BC_FNEW:\r\n  case BC_TSETM:\r\n    setintV(&J->errinfo, (int32_t)op);\r\n    lj_trace_err_info(J, LJ_TRERR_NYIBC);\r\n    break;\r\n  }\r\n\r\n  /* rc == 0 if we have no result yet, e.g. pending __index metamethod call. */\r\n  if (bcmode_a(op) == BCMdst && rc) {\r\n    J->base[ra] = rc;\r\n    if (ra >= J->maxslot) J->maxslot = ra+1;\r\n  }\r\n\r\n#undef rav\r\n#undef rbv\r\n#undef rcv\r\n\r\n  /* Limit the number of recorded IR instructions. */\r\n  if (J->cur.nins > REF_FIRST+(IRRef)J->param[JIT_P_maxrecord])\r\n    lj_trace_err(J, LJ_TRERR_TRACEOV);\r\n}\r\n\r\n/* -- Recording setup ----------------------------------------------------- */\r\n\r\n/* Setup recording for a root trace started by a hot loop. */\r\nstatic const BCIns *rec_setup_root(jit_State *J)\r\n{\r\n  /* Determine the next PC and the bytecode range for the loop. */\r\n  const BCIns *pcj, *pc = J->pc;\r\n  BCIns ins = *pc;\r\n  BCReg ra = bc_a(ins);\r\n  switch (bc_op(ins)) {\r\n  case BC_FORL:\r\n    J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    pc += 1+bc_j(ins);\r\n    J->bc_min = pc;\r\n    break;\r\n  case BC_ITERL:\r\n    lua_assert(bc_op(pc[-1]) == BC_ITERC);\r\n    J->maxslot = ra + bc_b(pc[-1]) - 1;\r\n    J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    pc += 1+bc_j(ins);\r\n    lua_assert(bc_op(pc[-1]) == BC_JMP);\r\n    J->bc_min = pc;\r\n    break;\r\n  case BC_LOOP:\r\n    /* Only check BC range for real loops, but not for \"repeat until true\". */\r\n    pcj = pc + bc_j(ins);\r\n    ins = *pcj;\r\n    if (bc_op(ins) == BC_JMP && bc_j(ins) < 0) {\r\n      J->bc_min = pcj+1 + bc_j(ins);\r\n      J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    }\r\n    J->maxslot = ra;\r\n    pc++;\r\n    break;\r\n  case BC_RET:\r\n  case BC_RET0:\r\n  case BC_RET1:\r\n    /* No bytecode range check for down-recursive root traces. */\r\n    J->maxslot = ra + bc_d(ins) - 1;\r\n    break;\r\n  case BC_FUNCF:\r\n    /* No bytecode range check for root traces started by a hot call. */\r\n    J->maxslot = J->pt->numparams;\r\n    pc++;\r\n    break;\r\n  default:\r\n    lua_assert(0);\r\n    break;\r\n  }\r\n  return pc;\r\n}\r\n\r\n/* Setup for recording a new trace. */\r\nvoid lj_record_setup(jit_State *J)\r\n{\r\n  uint32_t i;\r\n\r\n  /* Initialize state related to current trace. */\r\n  memset(J->slot, 0, sizeof(J->slot));\r\n  memset(J->chain, 0, sizeof(J->chain));\r\n  memset(J->bpropcache, 0, sizeof(J->bpropcache));\r\n  J->scev.idx = REF_NIL;\r\n  setmref(J->scev.pc, NULL);\r\n\r\n  J->baseslot = 1;  /* Invoking function is at base[-1]. */\r\n  J->base = J->slot + J->baseslot;\r\n  J->maxslot = 0;\r\n  J->framedepth = 0;\r\n  J->retdepth = 0;\r\n\r\n  J->instunroll = J->param[JIT_P_instunroll];\r\n  J->loopunroll = J->param[JIT_P_loopunroll];\r\n  J->tailcalled = 0;\r\n  J->loopref = 0;\r\n\r\n  J->bc_min = NULL;  /* Means no limit. */\r\n  J->bc_extent = ~(MSize)0;\r\n\r\n  /* Emit instructions for fixed references. Also triggers initial IR alloc. */\r\n  emitir_raw(IRT(IR_BASE, IRT_P32), J->parent, J->exitno);\r\n  for (i = 0; i <= 2; i++) {\r\n    IRIns *ir = IR(REF_NIL-i);\r\n    ir->i = 0;\r\n    ir->t.irt = (uint8_t)(IRT_NIL+i);\r\n    ir->o = IR_KPRI;\r\n    ir->prev = 0;\r\n  }\r\n  J->cur.nk = REF_TRUE;\r\n\r\n  J->startpc = J->pc;\r\n  setmref(J->cur.startpc, J->pc);\r\n  if (J->parent) {  /* Side trace. */\r\n    GCtrace *T = traceref(J, J->parent);\r\n    TraceNo root = T->root ? T->root : J->parent;\r\n    J->cur.root = (uint16_t)root;\r\n    J->cur.startins = BCINS_AD(BC_JMP, 0, 0);\r\n    /* Check whether we could at least potentially form an extra loop. */\r\n    if (J->exitno == 0 && T->snap[0].nent == 0) {\r\n      /* We can narrow a FORL for some side traces, too. */\r\n      if (J->pc > proto_bc(J->pt) && bc_op(J->pc[-1]) == BC_JFORI &&\r\n\t  bc_d(J->pc[bc_j(J->pc[-1])-1]) == root) {\r\n\tlj_snap_add(J);\r\n\trec_for_loop(J, J->pc-1, &J->scev, 1);\r\n\tgoto sidecheck;\r\n      }\r\n    } else {\r\n      J->startpc = NULL;  /* Prevent forming an extra loop. */\r\n    }\r\n    lj_snap_replay(J, T);\r\n  sidecheck:\r\n    if (traceref(J, J->cur.root)->nchild >= J->param[JIT_P_maxside] ||\r\n\tT->snap[J->exitno].count >= J->param[JIT_P_hotexit] +\r\n\t\t\t\t    J->param[JIT_P_tryside]) {\r\n      rec_stop(J, LJ_TRLINK_INTERP, 0);\r\n    }\r\n  } else {  /* Root trace. */\r\n    J->cur.root = 0;\r\n    J->cur.startins = *J->pc;\r\n    J->pc = rec_setup_root(J);\r\n    /* Note: the loop instruction itself is recorded at the end and not\r\n    ** at the start! So snapshot #0 needs to point to the *next* instruction.\r\n    */\r\n    lj_snap_add(J);\r\n    if (bc_op(J->cur.startins) == BC_FORL)\r\n      rec_for_loop(J, J->pc-1, &J->scev, 1);\r\n    if (1 + J->pt->framesize >= LJ_MAX_JSLOTS)\r\n      lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  }\r\n#ifdef LUAJIT_ENABLE_CHECKHOOK\r\n  /* Regularly check for instruction/line hooks from compiled code and\r\n  ** exit to the interpreter if the hooks are set.\r\n  **\r\n  ** This is a compile-time option and disabled by default, since the\r\n  ** hook checks may be quite expensive in tight loops.\r\n  **\r\n  ** Note this is only useful if hooks are *not* set most of the time.\r\n  ** Use this only if you want to *asynchronously* interrupt the execution.\r\n  **\r\n  ** You can set the instruction hook via lua_sethook() with a count of 1\r\n  ** from a signal handler or another native thread. Please have a look\r\n  ** at the first few functions in luajit.c for an example (Ctrl-C handler).\r\n  */\r\n  {\r\n    TRef tr = emitir(IRT(IR_XLOAD, IRT_U8),\r\n\t\t     lj_ir_kptr(J, &J2G(J)->hookmask), IRXLOAD_VOLATILE);\r\n    tr = emitir(IRTI(IR_BAND), tr, lj_ir_kint(J, (LUA_MASKLINE|LUA_MASKCOUNT)));\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, 0));\r\n  }\r\n#endif\r\n}\r\n\r\n#undef IR\r\n#undef emitir_raw\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_record.h",
    "content": "/*\r\n** Trace recorder (bytecode -> SSA IR).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_RECORD_H\r\n#define _LJ_RECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* Context for recording an indexed load/store. */\r\ntypedef struct RecordIndex {\r\n  TValue tabv;\t\t/* Runtime value of table (or indexed object). */\r\n  TValue keyv;\t\t/* Runtime value of key. */\r\n  TValue valv;\t\t/* Runtime value of stored value. */\r\n  TValue mobjv;\t\t/* Runtime value of metamethod object. */\r\n  GCtab *mtv;\t\t/* Runtime value of metatable object. */\r\n  cTValue *oldv;\t/* Runtime value of previously stored value. */\r\n  TRef tab;\t\t/* Table (or indexed object) reference. */\r\n  TRef key;\t\t/* Key reference. */\r\n  TRef val;\t\t/* Value reference for a store or 0 for a load. */\r\n  TRef mt;\t\t/* Metatable reference. */\r\n  TRef mobj;\t\t/* Metamethod object reference. */\r\n  int idxchain;\t\t/* Index indirections left or 0 for raw lookup. */\r\n} RecordIndex;\r\n\r\nLJ_FUNC int lj_record_objcmp(jit_State *J, TRef a, TRef b,\r\n\t\t\t     cTValue *av, cTValue *bv);\r\nLJ_FUNC TRef lj_record_constify(jit_State *J, cTValue *o);\r\n\r\nLJ_FUNC void lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs);\r\nLJ_FUNC void lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs);\r\nLJ_FUNC void lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults);\r\n\r\nLJ_FUNC int lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm);\r\nLJ_FUNC TRef lj_record_idx(jit_State *J, RecordIndex *ix);\r\n\r\nLJ_FUNC void lj_record_ins(jit_State *J);\r\nLJ_FUNC void lj_record_setup(jit_State *J);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_snap.c",
    "content": "/*\r\n** Snapshot handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_snap_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_target.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#endif\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Snapshot buffer allocation ------------------------------------------ */\r\n\r\n/* Grow snapshot buffer. */\r\nvoid lj_snap_grow_buf_(jit_State *J, MSize need)\r\n{\r\n  MSize maxsnap = (MSize)J->param[JIT_P_maxsnap];\r\n  if (need > maxsnap)\r\n    lj_trace_err(J, LJ_TRERR_SNAPOV);\r\n  lj_mem_growvec(J->L, J->snapbuf, J->sizesnap, maxsnap, SnapShot);\r\n  J->cur.snap = J->snapbuf;\r\n}\r\n\r\n/* Grow snapshot map buffer. */\r\nvoid lj_snap_grow_map_(jit_State *J, MSize need)\r\n{\r\n  if (need < 2*J->sizesnapmap)\r\n    need = 2*J->sizesnapmap;\r\n  else if (need < 64)\r\n    need = 64;\r\n  J->snapmapbuf = (SnapEntry *)lj_mem_realloc(J->L, J->snapmapbuf,\r\n\t\t    J->sizesnapmap*sizeof(SnapEntry), need*sizeof(SnapEntry));\r\n  J->cur.snapmap = J->snapmapbuf;\r\n  J->sizesnapmap = need;\r\n}\r\n\r\n/* -- Snapshot generation ------------------------------------------------- */\r\n\r\n/* Add all modified slots to the snapshot. */\r\nstatic MSize snapshot_slots(jit_State *J, SnapEntry *map, BCReg nslots)\r\n{\r\n  IRRef retf = J->chain[IR_RETF];  /* Limits SLOAD restore elimination. */\r\n  BCReg s;\r\n  MSize n = 0;\r\n  for (s = 0; s < nslots; s++) {\r\n    TRef tr = J->slot[s];\r\n    IRRef ref = tref_ref(tr);\r\n    if (ref) {\r\n      SnapEntry sn = SNAP_TR(s, tr);\r\n      IRIns *ir = IR(ref);\r\n      if (!(sn & (SNAP_CONT|SNAP_FRAME)) &&\r\n\t  ir->o == IR_SLOAD && ir->op1 == s && ref > retf) {\r\n\t/* No need to snapshot unmodified non-inherited slots. */\r\n\tif (!(ir->op2 & IRSLOAD_INHERIT))\r\n\t  continue;\r\n\t/* No need to restore readonly slots and unmodified non-parent slots. */\r\n\tif (!(LJ_DUALNUM && (ir->op2 & IRSLOAD_CONVERT)) &&\r\n\t    (ir->op2 & (IRSLOAD_READONLY|IRSLOAD_PARENT)) != IRSLOAD_PARENT)\r\n\t  sn |= SNAP_NORESTORE;\r\n      }\r\n      if (LJ_SOFTFP && irt_isnum(ir->t))\r\n\tsn |= SNAP_SOFTFPNUM;\r\n      map[n++] = sn;\r\n    }\r\n  }\r\n  return n;\r\n}\r\n\r\n/* Add frame links at the end of the snapshot. */\r\nstatic BCReg snapshot_framelinks(jit_State *J, SnapEntry *map)\r\n{\r\n  cTValue *frame = J->L->base - 1;\r\n  cTValue *lim = J->L->base - J->baseslot;\r\n  cTValue *ftop = frame + funcproto(frame_func(frame))->framesize;\r\n  MSize f = 0;\r\n  map[f++] = SNAP_MKPC(J->pc);  /* The current PC is always the first entry. */\r\n  while (frame > lim) {  /* Backwards traversal of all frames above base. */\r\n    if (frame_islua(frame)) {\r\n      map[f++] = SNAP_MKPC(frame_pc(frame));\r\n      frame = frame_prevl(frame);\r\n    } else if (frame_iscont(frame)) {\r\n      map[f++] = SNAP_MKFTSZ(frame_ftsz(frame));\r\n      map[f++] = SNAP_MKPC(frame_contpc(frame));\r\n      frame = frame_prevd(frame);\r\n    } else {\r\n      lua_assert(!frame_isc(frame));\r\n      map[f++] = SNAP_MKFTSZ(frame_ftsz(frame));\r\n      frame = frame_prevd(frame);\r\n      continue;\r\n    }\r\n    if (frame + funcproto(frame_func(frame))->framesize > ftop)\r\n      ftop = frame + funcproto(frame_func(frame))->framesize;\r\n  }\r\n  lua_assert(f == (MSize)(1 + J->framedepth));\r\n  return (BCReg)(ftop - lim);\r\n}\r\n\r\n/* Take a snapshot of the current stack. */\r\nstatic void snapshot_stack(jit_State *J, SnapShot *snap, MSize nsnapmap)\r\n{\r\n  BCReg nslots = J->baseslot + J->maxslot;\r\n  MSize nent;\r\n  SnapEntry *p;\r\n  /* Conservative estimate. */\r\n  lj_snap_grow_map(J, nsnapmap + nslots + (MSize)J->framedepth+1);\r\n  p = &J->cur.snapmap[nsnapmap];\r\n  nent = snapshot_slots(J, p, nslots);\r\n  snap->topslot = (uint8_t)snapshot_framelinks(J, p + nent);\r\n  snap->mapofs = (uint16_t)nsnapmap;\r\n  snap->ref = (IRRef1)J->cur.nins;\r\n  snap->nent = (uint8_t)nent;\r\n  snap->nslots = (uint8_t)nslots;\r\n  snap->count = 0;\r\n  J->cur.nsnapmap = (uint16_t)(nsnapmap + nent + 1 + J->framedepth);\r\n}\r\n\r\n/* Add or merge a snapshot. */\r\nvoid lj_snap_add(jit_State *J)\r\n{\r\n  MSize nsnap = J->cur.nsnap;\r\n  MSize nsnapmap = J->cur.nsnapmap;\r\n  /* Merge if no ins. inbetween or if requested and no guard inbetween. */\r\n  if (J->mergesnap ? !irt_isguard(J->guardemit) :\r\n      (nsnap > 0 && J->cur.snap[nsnap-1].ref == J->cur.nins)) {\r\n    if (nsnap == 1) {  /* But preserve snap #0 PC. */\r\n      emitir_raw(IRT(IR_NOP, IRT_NIL), 0, 0);\r\n      goto nomerge;\r\n    }\r\n    nsnapmap = J->cur.snap[--nsnap].mapofs;\r\n  } else {\r\n  nomerge:\r\n    lj_snap_grow_buf(J, nsnap+1);\r\n    J->cur.nsnap = (uint16_t)(nsnap+1);\r\n  }\r\n  J->mergesnap = 0;\r\n  J->guardemit.irt = 0;\r\n  snapshot_stack(J, &J->cur.snap[nsnap], nsnapmap);\r\n}\r\n\r\n/* -- Snapshot modification ----------------------------------------------- */\r\n\r\n#define SNAP_USEDEF_SLOTS\t(LJ_MAX_JSLOTS+LJ_STACK_EXTRA)\r\n\r\n/* Find unused slots with reaching-definitions bytecode data-flow analysis. */\r\nstatic BCReg snap_usedef(jit_State *J, uint8_t *udf,\r\n\t\t\t const BCIns *pc, BCReg maxslot)\r\n{\r\n  BCReg s;\r\n  GCobj *o;\r\n\r\n  if (maxslot == 0) return 0;\r\n#ifdef LUAJIT_USE_VALGRIND\r\n  /* Avoid errors for harmless reads beyond maxslot. */\r\n  memset(udf, 1, SNAP_USEDEF_SLOTS);\r\n#else\r\n  memset(udf, 1, maxslot);\r\n#endif\r\n\r\n  /* Treat open upvalues as used. */\r\n  o = gcref(J->L->openupval);\r\n  while (o) {\r\n    if (uvval(gco2uv(o)) < J->L->base) break;\r\n    udf[uvval(gco2uv(o)) - J->L->base] = 0;\r\n    o = gcref(o->gch.nextgc);\r\n  }\r\n\r\n#define USE_SLOT(s)\t\tudf[(s)] &= ~1\r\n#define DEF_SLOT(s)\t\tudf[(s)] *= 3\r\n\r\n  /* Scan through following bytecode and check for uses/defs. */\r\n  lua_assert(pc >= proto_bc(J->pt) && pc < proto_bc(J->pt) + J->pt->sizebc);\r\n  for (;;) {\r\n    BCIns ins = *pc++;\r\n    BCOp op = bc_op(ins);\r\n    switch (bcmode_b(op)) {\r\n    case BCMvar: USE_SLOT(bc_b(ins)); break;\r\n    default: break;\r\n    }\r\n    switch (bcmode_c(op)) {\r\n    case BCMvar: USE_SLOT(bc_c(ins)); break;\r\n    case BCMrbase:\r\n      lua_assert(op == BC_CAT);\r\n      for (s = bc_b(ins); s <= bc_c(ins); s++) USE_SLOT(s);\r\n      for (; s < maxslot; s++) DEF_SLOT(s);\r\n      break;\r\n    case BCMjump:\r\n    handle_jump: {\r\n      BCReg minslot = bc_a(ins);\r\n      if (op >= BC_FORI && op <= BC_JFORL) minslot += FORL_EXT;\r\n      else if (op >= BC_ITERL && op <= BC_JITERL) minslot += bc_b(pc[-2])-1;\r\n      else if (op == BC_UCLO) { pc += bc_j(ins); break; }\r\n      for (s = minslot; s < maxslot; s++) DEF_SLOT(s);\r\n      return minslot < maxslot ? minslot : maxslot;\r\n      }\r\n    case BCMlit:\r\n      if (op == BC_JFORL || op == BC_JITERL || op == BC_JLOOP) {\r\n\tgoto handle_jump;\r\n      } else if (bc_isret(op)) {\r\n\tBCReg top = op == BC_RETM ? maxslot : (bc_a(ins) + bc_d(ins)-1);\r\n\tfor (s = 0; s < bc_a(ins); s++) DEF_SLOT(s);\r\n\tfor (; s < top; s++) USE_SLOT(s);\r\n\tfor (; s < maxslot; s++) DEF_SLOT(s);\r\n\treturn 0;\r\n      }\r\n      break;\r\n    case BCMfunc: return maxslot;  /* NYI: will abort, anyway. */\r\n    default: break;\r\n    }\r\n    switch (bcmode_a(op)) {\r\n    case BCMvar: USE_SLOT(bc_a(ins)); break;\r\n    case BCMdst:\r\n       if (!(op == BC_ISTC || op == BC_ISFC)) DEF_SLOT(bc_a(ins));\r\n       break;\r\n    case BCMbase:\r\n      if (op >= BC_CALLM && op <= BC_VARG) {\r\n\tBCReg top = (op == BC_CALLM || op == BC_CALLMT || bc_c(ins) == 0) ?\r\n\t\t    maxslot : (bc_a(ins) + bc_c(ins));\r\n\ts = bc_a(ins) - ((op == BC_ITERC || op == BC_ITERN) ? 3 : 0);\r\n\tfor (; s < top; s++) USE_SLOT(s);\r\n\tfor (; s < maxslot; s++) DEF_SLOT(s);\r\n\tif (op == BC_CALLT || op == BC_CALLMT) {\r\n\t  for (s = 0; s < bc_a(ins); s++) DEF_SLOT(s);\r\n\t  return 0;\r\n\t}\r\n      } else if (op == BC_KNIL) {\r\n\tfor (s = bc_a(ins); s <= bc_d(ins); s++) DEF_SLOT(s);\r\n      } else if (op == BC_TSETM) {\r\n\tfor (s = bc_a(ins)-1; s < maxslot; s++) USE_SLOT(s);\r\n      }\r\n      break;\r\n    default: break;\r\n    }\r\n    lua_assert(pc >= proto_bc(J->pt) && pc < proto_bc(J->pt) + J->pt->sizebc);\r\n  }\r\n\r\n#undef USE_SLOT\r\n#undef DEF_SLOT\r\n\r\n  return 0;  /* unreachable */\r\n}\r\n\r\n/* Purge dead slots before the next snapshot. */\r\nvoid lj_snap_purge(jit_State *J)\r\n{\r\n  uint8_t udf[SNAP_USEDEF_SLOTS];\r\n  BCReg maxslot = J->maxslot;\r\n  BCReg s = snap_usedef(J, udf, J->pc, maxslot);\r\n  for (; s < maxslot; s++)\r\n    if (udf[s] != 0)\r\n      J->base[s] = 0;  /* Purge dead slots. */\r\n}\r\n\r\n/* Shrink last snapshot. */\r\nvoid lj_snap_shrink(jit_State *J)\r\n{\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, m, nlim, nent = snap->nent;\r\n  uint8_t udf[SNAP_USEDEF_SLOTS];\r\n  BCReg maxslot = J->maxslot;\r\n  BCReg minslot = snap_usedef(J, udf, snap_pc(map[nent]), maxslot);\r\n  BCReg baseslot = J->baseslot;\r\n  maxslot += baseslot;\r\n  minslot += baseslot;\r\n  snap->nslots = (uint8_t)maxslot;\r\n  for (n = m = 0; n < nent; n++) {  /* Remove unused slots from snapshot. */\r\n    BCReg s = snap_slot(map[n]);\r\n    if (s < minslot || (s < maxslot && udf[s-baseslot] == 0))\r\n      map[m++] = map[n];  /* Only copy used slots. */\r\n  }\r\n  snap->nent = (uint8_t)m;\r\n  nlim = J->cur.nsnapmap - snap->mapofs - 1;\r\n  while (n <= nlim) map[m++] = map[n++];  /* Move PC + frame links down. */\r\n  J->cur.nsnapmap = (uint16_t)(snap->mapofs + m);  /* Free up space in map. */\r\n}\r\n\r\n/* -- Snapshot access ----------------------------------------------------- */\r\n\r\n/* Initialize a Bloom Filter with all renamed refs.\r\n** There are very few renames (often none), so the filter has\r\n** very few bits set. This makes it suitable for negative filtering.\r\n*/\r\nstatic BloomFilter snap_renamefilter(GCtrace *T, SnapNo lim)\r\n{\r\n  BloomFilter rfilt = 0;\r\n  IRIns *ir;\r\n  for (ir = &T->ir[T->nins-1]; ir->o == IR_RENAME; ir--)\r\n    if (ir->op2 <= lim)\r\n      bloomset(rfilt, ir->op1);\r\n  return rfilt;\r\n}\r\n\r\n/* Process matching renames to find the original RegSP. */\r\nstatic RegSP snap_renameref(GCtrace *T, SnapNo lim, IRRef ref, RegSP rs)\r\n{\r\n  IRIns *ir;\r\n  for (ir = &T->ir[T->nins-1]; ir->o == IR_RENAME; ir--)\r\n    if (ir->op1 == ref && ir->op2 <= lim)\r\n      rs = ir->prev;\r\n  return rs;\r\n}\r\n\r\n/* Copy RegSP from parent snapshot to the parent links of the IR. */\r\nIRIns *lj_snap_regspmap(GCtrace *T, SnapNo snapno, IRIns *ir)\r\n{\r\n  SnapShot *snap = &T->snap[snapno];\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  BloomFilter rfilt = snap_renamefilter(T, snapno);\r\n  MSize n = 0;\r\n  IRRef ref = 0;\r\n  for ( ; ; ir++) {\r\n    uint32_t rs;\r\n    if (ir->o == IR_SLOAD) {\r\n      if (!(ir->op2 & IRSLOAD_PARENT)) break;\r\n      for ( ; ; n++) {\r\n\tlua_assert(n < snap->nent);\r\n\tif (snap_slot(map[n]) == ir->op1) {\r\n\t  ref = snap_ref(map[n++]);\r\n\t  break;\r\n\t}\r\n      }\r\n    } else if (LJ_SOFTFP && ir->o == IR_HIOP) {\r\n      ref++;\r\n    } else if (ir->o == IR_PVAL) {\r\n      ref = ir->op1 + REF_BIAS;\r\n    } else {\r\n      break;\r\n    }\r\n    rs = T->ir[ref].prev;\r\n    if (bloomtest(rfilt, ref))\r\n      rs = snap_renameref(T, snapno, ref, rs);\r\n    ir->prev = (uint16_t)rs;\r\n    lua_assert(regsp_used(rs));\r\n  }\r\n  return ir;\r\n}\r\n\r\n/* -- Snapshot replay ----------------------------------------------------- */\r\n\r\n/* Replay constant from parent trace. */\r\nstatic TRef snap_replay_const(jit_State *J, IRIns *ir)\r\n{\r\n  /* Only have to deal with constants that can occur in stack slots. */\r\n  switch ((IROp)ir->o) {\r\n  case IR_KPRI: return TREF_PRI(irt_type(ir->t));\r\n  case IR_KINT: return lj_ir_kint(J, ir->i);\r\n  case IR_KGC: return lj_ir_kgc(J, ir_kgc(ir), irt_t(ir->t));\r\n  case IR_KNUM: return lj_ir_k64(J, IR_KNUM, ir_knum(ir));\r\n  case IR_KINT64: return lj_ir_k64(J, IR_KINT64, ir_kint64(ir));\r\n  case IR_KPTR: return lj_ir_kptr(J, ir_kptr(ir));  /* Continuation. */\r\n  default: lua_assert(0); return TREF_NIL; break;\r\n  }\r\n}\r\n\r\n/* De-duplicate parent reference. */\r\nstatic TRef snap_dedup(jit_State *J, SnapEntry *map, MSize nmax, IRRef ref)\r\n{\r\n  MSize j;\r\n  for (j = 0; j < nmax; j++)\r\n    if (snap_ref(map[j]) == ref)\r\n      return J->slot[snap_slot(map[j])] & ~(SNAP_CONT|SNAP_FRAME);\r\n  return 0;\r\n}\r\n\r\n/* Emit parent reference with de-duplication. */\r\nstatic TRef snap_pref(jit_State *J, GCtrace *T, SnapEntry *map, MSize nmax,\r\n\t\t      BloomFilter seen, IRRef ref)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  TRef tr;\r\n  if (irref_isk(ref))\r\n    tr = snap_replay_const(J, ir);\r\n  else if (!regsp_used(ir->prev))\r\n    tr = 0;\r\n  else if (!bloomtest(seen, ref) || (tr = snap_dedup(J, map, nmax, ref)) == 0)\r\n    tr = emitir(IRT(IR_PVAL, irt_type(ir->t)), ref - REF_BIAS, 0);\r\n  return tr;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. Slow path. */\r\nstatic int snap_sunk_store2(jit_State *J, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n      irs->o == IR_FSTORE || irs->o == IR_XSTORE) {\r\n    IRIns *irk = IR(irs->op1);\r\n    if (irk->o == IR_AREF || irk->o == IR_HREFK)\r\n      irk = IR(irk->op1);\r\n    return (IR(irk->op1) == ira);\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. Fast path. */\r\nstatic LJ_AINLINE int snap_sunk_store(jit_State *J, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->s != 255)\r\n    return (ira + irs->s == irs);  /* Fast check. */\r\n  return snap_sunk_store2(J, ira, irs);\r\n}\r\n\r\n/* Replay snapshot state to setup side trace. */\r\nvoid lj_snap_replay(jit_State *J, GCtrace *T)\r\n{\r\n  SnapShot *snap = &T->snap[J->exitno];\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  BloomFilter seen = 0;\r\n  int pass23 = 0;\r\n  J->framedepth = 0;\r\n  /* Emit IR for slots inherited from parent snapshot. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = &T->ir[ref];\r\n    TRef tr;\r\n    /* The bloom filter avoids O(nent^2) overhead for de-duping slots. */\r\n    if (bloomtest(seen, ref) && (tr = snap_dedup(J, map, n, ref)) != 0)\r\n      goto setslot;\r\n    bloomset(seen, ref);\r\n    if (irref_isk(ref)) {\r\n      tr = snap_replay_const(J, ir);\r\n    } else if (!regsp_used(ir->prev)) {\r\n      pass23 = 1;\r\n      lua_assert(s != 0);\r\n      tr = s;\r\n    } else {\r\n      IRType t = irt_type(ir->t);\r\n      uint32_t mode = IRSLOAD_INHERIT|IRSLOAD_PARENT;\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM)) t = IRT_NUM;\r\n      if (ir->o == IR_SLOAD) mode |= (ir->op2 & IRSLOAD_READONLY);\r\n      tr = emitir_raw(IRT(IR_SLOAD, t), s, mode);\r\n    }\r\n  setslot:\r\n    J->slot[s] = tr | (sn&(SNAP_CONT|SNAP_FRAME));  /* Same as TREF_* flags. */\r\n    J->framedepth += ((sn & (SNAP_CONT|SNAP_FRAME)) && s);\r\n    if ((sn & SNAP_FRAME))\r\n      J->baseslot = s+1;\r\n  }\r\n  if (pass23) {\r\n    IRIns *irlast = &T->ir[snap->ref];\r\n    pass23 = 0;\r\n    /* Emit dependent PVALs. */\r\n    for (n = 0; n < nent; n++) {\r\n      SnapEntry sn = map[n];\r\n      IRRef refp = snap_ref(sn);\r\n      IRIns *ir = &T->ir[refp];\r\n      if (regsp_reg(ir->r) == RID_SUNK) {\r\n\tif (J->slot[snap_slot(sn)] != snap_slot(sn)) continue;\r\n\tpass23 = 1;\r\n\tlua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP ||\r\n\t\t   ir->o == IR_CNEW || ir->o == IR_CNEWI);\r\n\tif (ir->op1 >= T->nk) snap_pref(J, T, map, nent, seen, ir->op1);\r\n\tif (ir->op2 >= T->nk) snap_pref(J, T, map, nent, seen, ir->op2);\r\n\tif (LJ_HASFFI && ir->o == IR_CNEWI) {\r\n\t  if (LJ_32 && refp+1 < T->nins && (ir+1)->o == IR_HIOP)\r\n\t    snap_pref(J, T, map, nent, seen, (ir+1)->op2);\r\n\t} else {\r\n\t  IRIns *irs;\r\n\t  for (irs = ir+1; irs < irlast; irs++)\r\n\t    if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t      if (snap_pref(J, T, map, nent, seen, irs->op2) == 0)\r\n\t\tsnap_pref(J, T, map, nent, seen, T->ir[irs->op2].op1);\r\n\t      else if ((LJ_SOFTFP || (LJ_32 && LJ_HASFFI)) &&\r\n\t\t       irs+1 < irlast && (irs+1)->o == IR_HIOP)\r\n\t\tsnap_pref(J, T, map, nent, seen, (irs+1)->op2);\r\n\t    }\r\n\t}\r\n      } else if (!irref_isk(refp) && !regsp_used(ir->prev)) {\r\n\tlua_assert(ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n\tJ->slot[snap_slot(sn)] = snap_pref(J, T, map, nent, seen, ir->op1);\r\n      }\r\n    }\r\n    /* Replay sunk instructions. */\r\n    for (n = 0; pass23 && n < nent; n++) {\r\n      SnapEntry sn = map[n];\r\n      IRRef refp = snap_ref(sn);\r\n      IRIns *ir = &T->ir[refp];\r\n      if (regsp_reg(ir->r) == RID_SUNK) {\r\n\tTRef op1, op2;\r\n\tif (J->slot[snap_slot(sn)] != snap_slot(sn)) {  /* De-dup allocs. */\r\n\t  J->slot[snap_slot(sn)] = J->slot[J->slot[snap_slot(sn)]];\r\n\t  continue;\r\n\t}\r\n\top1 = ir->op1;\r\n\tif (op1 >= T->nk) op1 = snap_pref(J, T, map, nent, seen, op1);\r\n\top2 = ir->op2;\r\n\tif (op2 >= T->nk) op2 = snap_pref(J, T, map, nent, seen, op2);\r\n\tif (LJ_HASFFI && ir->o == IR_CNEWI) {\r\n\t  if (LJ_32 && refp+1 < T->nins && (ir+1)->o == IR_HIOP) {\r\n\t    lj_needsplit(J);  /* Emit joining HIOP. */\r\n\t    op2 = emitir_raw(IRT(IR_HIOP, IRT_I64), op2,\r\n\t\t\t     snap_pref(J, T, map, nent, seen, (ir+1)->op2));\r\n\t  }\r\n\t  J->slot[snap_slot(sn)] = emitir(ir->ot, op1, op2);\r\n\t} else {\r\n\t  IRIns *irs;\r\n\t  TRef tr = emitir(ir->ot, op1, op2);\r\n\t  J->slot[snap_slot(sn)] = tr;\r\n\t  for (irs = ir+1; irs < irlast; irs++)\r\n\t    if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t      IRIns *irr = &T->ir[irs->op1];\r\n\t      TRef val, key = irr->op2, tmp = tr;\r\n\t      if (irr->o != IR_FREF) {\r\n\t\tIRIns *irk = &T->ir[key];\r\n\t\tif (irr->o == IR_HREFK)\r\n\t\t  key = lj_ir_kslot(J, snap_replay_const(J, &T->ir[irk->op1]),\r\n\t\t\t\t    irk->op2);\r\n\t\telse\r\n\t\t  key = snap_replay_const(J, irk);\r\n\t\tif (irr->o == IR_HREFK || irr->o == IR_AREF) {\r\n\t\t  IRIns *irf = &T->ir[irr->op1];\r\n\t\t  tmp = emitir(irf->ot, tmp, irf->op2);\r\n\t\t}\r\n\t      }\r\n\t      tmp = emitir(irr->ot, tmp, key);\r\n\t      val = snap_pref(J, T, map, nent, seen, irs->op2);\r\n\t      if (val == 0) {\r\n\t\tIRIns *irc = &T->ir[irs->op2];\r\n\t\tlua_assert(irc->o == IR_CONV && irc->op2 == IRCONV_NUM_INT);\r\n\t\tval = snap_pref(J, T, map, nent, seen, irc->op1);\r\n\t\tval = emitir(IRTN(IR_CONV), val, IRCONV_NUM_INT);\r\n\t      } else if ((LJ_SOFTFP || (LJ_32 && LJ_HASFFI)) &&\r\n\t\t\t irs+1 < irlast && (irs+1)->o == IR_HIOP) {\r\n\t\tIRType t = IRT_I64;\r\n\t\tif (LJ_SOFTFP && irt_type((irs+1)->t) == IRT_SOFTFP)\r\n\t\t  t = IRT_NUM;\r\n\t\tlj_needsplit(J);\r\n\t\tif (irref_isk(irs->op2) && irref_isk((irs+1)->op2)) {\r\n\t\t  uint64_t k = (uint32_t)T->ir[irs->op2].i +\r\n\t\t\t       ((uint64_t)T->ir[(irs+1)->op2].i << 32);\r\n\t\t  val = lj_ir_k64(J, t == IRT_I64 ? IR_KINT64 : IR_KNUM,\r\n\t\t\t\t  lj_ir_k64_find(J, k));\r\n\t\t} else {\r\n\t\t  val = emitir_raw(IRT(IR_HIOP, t), val,\r\n\t\t\t  snap_pref(J, T, map, nent, seen, (irs+1)->op2));\r\n\t\t}\r\n\t\ttmp = emitir(IRT(irs->o, t), tmp, val);\r\n\t\tcontinue;\r\n\t      }\r\n\t      tmp = emitir(irs->ot, tmp, val);\r\n\t    } else if (LJ_HASFFI && irs->o == IR_XBAR && ir->o == IR_CNEW) {\r\n\t      emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n\t    }\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  J->base = J->slot + J->baseslot;\r\n  J->maxslot = snap->nslots - J->baseslot;\r\n  lj_snap_add(J);\r\n  if (pass23)  /* Need explicit GC step _after_ initial snapshot. */\r\n    emitir_raw(IRTG(IR_GCSTEP, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* -- Snapshot restore ---------------------------------------------------- */\r\n\r\nstatic void snap_unsink(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\tSnapNo snapno, BloomFilter rfilt,\r\n\t\t\tIRIns *ir, TValue *o);\r\n\r\n/* Restore a value from the trace exit state. */\r\nstatic void snap_restoreval(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\t    SnapNo snapno, BloomFilter rfilt,\r\n\t\t\t    IRRef ref, TValue *o)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  IRType1 t = ir->t;\r\n  RegSP rs = ir->prev;\r\n  if (irref_isk(ref)) {  /* Restore constant slot. */\r\n    lj_ir_kvalue(J->L, o, ir);\r\n    return;\r\n  }\r\n  if (LJ_UNLIKELY(bloomtest(rfilt, ref)))\r\n    rs = snap_renameref(T, snapno, ref, rs);\r\n  if (ra_hasspill(regsp_spill(rs))) {  /* Restore from spill slot. */\r\n    int32_t *sps = &ex->spill[regsp_spill(rs)];\r\n    if (irt_isinteger(t)) {\r\n      setintV(o, *sps);\r\n#if !LJ_SOFTFP\r\n    } else if (irt_isnum(t)) {\r\n      o->u64 = *(uint64_t *)sps;\r\n#endif\r\n    } else if (LJ_64 && irt_islightud(t)) {\r\n      /* 64 bit lightuserdata which may escape already has the tag bits. */\r\n      o->u64 = *(uint64_t *)sps;\r\n    } else {\r\n      lua_assert(!irt_ispri(t));  /* PRI refs never have a spill slot. */\r\n      setgcrefi(o->gcr, *sps);\r\n      setitype(o, irt_toitype(t));\r\n    }\r\n  } else {  /* Restore from register. */\r\n    Reg r = regsp_reg(rs);\r\n    if (ra_noreg(r)) {\r\n      lua_assert(ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n      snap_restoreval(J, T, ex, snapno, rfilt, ir->op1, o);\r\n      if (LJ_DUALNUM) setnumV(o, (lua_Number)intV(o));\r\n      return;\r\n    } else if (irt_isinteger(t)) {\r\n      setintV(o, (int32_t)ex->gpr[r-RID_MIN_GPR]);\r\n#if !LJ_SOFTFP\r\n    } else if (irt_isnum(t)) {\r\n      setnumV(o, ex->fpr[r-RID_MIN_FPR]);\r\n#endif\r\n    } else if (LJ_64 && irt_islightud(t)) {\r\n      /* 64 bit lightuserdata which may escape already has the tag bits. */\r\n      o->u64 = ex->gpr[r-RID_MIN_GPR];\r\n    } else {\r\n      if (!irt_ispri(t))\r\n\tsetgcrefi(o->gcr, ex->gpr[r-RID_MIN_GPR]);\r\n      setitype(o, irt_toitype(t));\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Restore raw data from the trace exit state. */\r\nstatic void snap_restoredata(GCtrace *T, ExitState *ex,\r\n\t\t\t     SnapNo snapno, BloomFilter rfilt,\r\n\t\t\t     IRRef ref, void *dst, CTSize sz)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  RegSP rs = ir->prev;\r\n  int32_t *src;\r\n  uint64_t tmp;\r\n  if (irref_isk(ref)) {\r\n    if (ir->o == IR_KNUM || ir->o == IR_KINT64) {\r\n      src = mref(ir->ptr, int32_t);\r\n    } else if (sz == 8) {\r\n      tmp = (uint64_t)(uint32_t)ir->i;\r\n      src = (int32_t *)&tmp;\r\n    } else {\r\n      src = &ir->i;\r\n    }\r\n  } else {\r\n    if (LJ_UNLIKELY(bloomtest(rfilt, ref)))\r\n      rs = snap_renameref(T, snapno, ref, rs);\r\n    if (ra_hasspill(regsp_spill(rs))) {\r\n      src = &ex->spill[regsp_spill(rs)];\r\n      if (sz == 8 && !irt_is64(ir->t)) {\r\n\ttmp = (uint64_t)(uint32_t)*src;\r\n\tsrc = (int32_t *)&tmp;\r\n      }\r\n    } else {\r\n      Reg r = regsp_reg(rs);\r\n      if (ra_noreg(r)) {\r\n\t/* Note: this assumes CNEWI is never used for SOFTFP split numbers. */\r\n\tlua_assert(sz == 8 && ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n\tsnap_restoredata(T, ex, snapno, rfilt, ir->op1, dst, 4);\r\n\t*(lua_Number *)dst = (lua_Number)*(int32_t *)dst;\r\n\treturn;\r\n      }\r\n      src = (int32_t *)&ex->gpr[r-RID_MIN_GPR];\r\n#if !LJ_SOFTFP\r\n      if (r >= RID_MAX_GPR) {\r\n\tsrc = (int32_t *)&ex->fpr[r-RID_MIN_FPR];\r\n#if LJ_TARGET_PPC\r\n\tif (sz == 4) {  /* PPC FPRs are always doubles. */\r\n\t  *(float *)dst = (float)*(double *)src;\r\n\t  return;\r\n\t}\r\n#else\r\n\tif (LJ_BE && sz == 4) src++;\r\n#endif\r\n      }\r\n#endif\r\n    }\r\n  }\r\n  lua_assert(sz == 1 || sz == 2 || sz == 4 || sz == 8);\r\n  if (sz == 4) *(int32_t *)dst = *src;\r\n  else if (sz == 8) *(int64_t *)dst = *(int64_t *)src;\r\n  else if (sz == 1) *(int8_t *)dst = (int8_t)*src;\r\n  else *(int16_t *)dst = (int16_t)*src;\r\n}\r\n#endif\r\n\r\n/* Unsink allocation from the trace exit state. Unsink sunk stores. */\r\nstatic void snap_unsink(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\tSnapNo snapno, BloomFilter rfilt,\r\n\t\t\tIRIns *ir, TValue *o)\r\n{\r\n  lua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP ||\r\n\t     ir->o == IR_CNEW || ir->o == IR_CNEWI);\r\n#if LJ_HASFFI\r\n  if (ir->o == IR_CNEW || ir->o == IR_CNEWI) {\r\n    CTState *cts = ctype_cts(J->L);\r\n    CTypeID id = (CTypeID)T->ir[ir->op1].i;\r\n    CTSize sz = lj_ctype_size(cts, id);\r\n    GCcdata *cd = lj_cdata_new(cts, id, sz);\r\n    setcdataV(J->L, o, cd);\r\n    if (ir->o == IR_CNEWI) {\r\n      uint8_t *p = (uint8_t *)cdataptr(cd);\r\n      lua_assert(sz == 4 || sz == 8);\r\n      if (LJ_32 && sz == 8 && ir+1 < T->ir + T->nins && (ir+1)->o == IR_HIOP) {\r\n\tsnap_restoredata(T, ex, snapno, rfilt, (ir+1)->op2, LJ_LE?p+4:p, 4);\r\n\tif (LJ_BE) p += 4;\r\n\tsz = 4;\r\n      }\r\n      snap_restoredata(T, ex, snapno, rfilt, ir->op2, p, sz);\r\n    } else {\r\n      IRIns *irs, *irlast = &T->ir[T->snap[snapno].ref];\r\n      for (irs = ir+1; irs < irlast; irs++)\r\n\tif (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t  IRIns *iro = &T->ir[T->ir[irs->op1].op2];\r\n\t  uint8_t *p = (uint8_t *)cd;\r\n\t  CTSize szs;\r\n\t  lua_assert(irs->o == IR_XSTORE && T->ir[irs->op1].o == IR_ADD);\r\n\t  lua_assert(iro->o == IR_KINT || iro->o == IR_KINT64);\r\n\t  if (irt_is64(irs->t)) szs = 8;\r\n\t  else if (irt_isi8(irs->t) || irt_isu8(irs->t)) szs = 1;\r\n\t  else if (irt_isi16(irs->t) || irt_isu16(irs->t)) szs = 2;\r\n\t  else szs = 4;\r\n\t  if (LJ_64 && iro->o == IR_KINT64)\r\n\t    p += (int64_t)ir_k64(iro)->u64;\r\n\t  else\r\n\t    p += iro->i;\r\n\t  lua_assert(p >= (uint8_t *)cdataptr(cd) &&\r\n\t\t     p + szs <= (uint8_t *)cdataptr(cd) + sz);\r\n\t  if (LJ_32 && irs+1 < T->ir + T->nins && (irs+1)->o == IR_HIOP) {\r\n\t    lua_assert(szs == 4);\r\n\t    snap_restoredata(T, ex, snapno, rfilt, (irs+1)->op2, LJ_LE?p+4:p,4);\r\n\t    if (LJ_BE) p += 4;\r\n\t  }\r\n\t  snap_restoredata(T, ex, snapno, rfilt, irs->op2, p, szs);\r\n\t}\r\n    }\r\n  } else\r\n#endif\r\n  {\r\n    IRIns *irs, *irlast;\r\n    GCtab *t = ir->o == IR_TNEW ? lj_tab_new(J->L, ir->op1, ir->op2) :\r\n\t\t\t\t  lj_tab_dup(J->L, ir_ktab(&T->ir[ir->op1]));\r\n    settabV(J->L, o, t);\r\n    irlast = &T->ir[T->snap[snapno].ref];\r\n    for (irs = ir+1; irs < irlast; irs++)\r\n      if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\tIRIns *irk = &T->ir[irs->op1];\r\n\tTValue tmp, *val;\r\n\tlua_assert(irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\t\t   irs->o == IR_FSTORE);\r\n\tif (irk->o == IR_FREF) {\r\n\t  lua_assert(irk->op2 == IRFL_TAB_META);\r\n\t  snap_restoreval(J, T, ex, snapno, rfilt, irs->op2, &tmp);\r\n\t  /* NOBARRIER: The table is new (marked white). */\r\n\t  setgcref(t->metatable, obj2gco(tabV(&tmp)));\r\n\t} else {\r\n\t  irk = &T->ir[irk->op2];\r\n\t  if (irk->o == IR_KSLOT) irk = &T->ir[irk->op1];\r\n\t  lj_ir_kvalue(J->L, &tmp, irk);\r\n\t  val = lj_tab_set(J->L, t, &tmp);\r\n\t  /* NOBARRIER: The table is new (marked white). */\r\n\t  snap_restoreval(J, T, ex, snapno, rfilt, irs->op2, val);\r\n\t  if (LJ_SOFTFP && irs+1 < T->ir + T->nins && (irs+1)->o == IR_HIOP) {\r\n\t    snap_restoreval(J, T, ex, snapno, rfilt, (irs+1)->op2, &tmp);\r\n\t    val->u32.hi = tmp.u32.lo;\r\n\t  }\r\n\t}\r\n      }\r\n  }\r\n}\r\n\r\n/* Restore interpreter state from exit state with the help of a snapshot. */\r\nconst BCIns *lj_snap_restore(jit_State *J, void *exptr)\r\n{\r\n  ExitState *ex = (ExitState *)exptr;\r\n  SnapNo snapno = J->exitno;  /* For now, snapno == exitno. */\r\n  GCtrace *T = traceref(J, J->parent);\r\n  SnapShot *snap = &T->snap[snapno];\r\n  MSize n, nent = snap->nent;\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &T->snapmap[snap_nextofs(T, snap)-1];\r\n  int32_t ftsz0;\r\n  TValue *frame;\r\n  BloomFilter rfilt = snap_renamefilter(T, snapno);\r\n  const BCIns *pc = snap_pc(map[nent]);\r\n  lua_State *L = J->L;\r\n\r\n  /* Set interpreter PC to the next PC to get correct error messages. */\r\n  setcframe_pc(cframe_raw(L->cframe), pc+1);\r\n\r\n  /* Make sure the stack is big enough for the slots from the snapshot. */\r\n  if (LJ_UNLIKELY(L->base + snap->topslot >= tvref(L->maxstack))) {\r\n    L->top = curr_topL(L);\r\n    lj_state_growstack(L, snap->topslot - curr_proto(L)->framesize);\r\n  }\r\n\r\n  /* Fill stack slots with data from the registers and spill slots. */\r\n  frame = L->base-1;\r\n  ftsz0 = frame_ftsz(frame);  /* Preserve link to previous frame in slot #0. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    if (!(sn & SNAP_NORESTORE)) {\r\n      TValue *o = &frame[snap_slot(sn)];\r\n      IRRef ref = snap_ref(sn);\r\n      IRIns *ir = &T->ir[ref];\r\n      if (ir->r == RID_SUNK) {\r\n\tMSize j;\r\n\tfor (j = 0; j < n; j++)\r\n\t  if (snap_ref(map[j]) == ref) {  /* De-duplicate sunk allocations. */\r\n\t    copyTV(L, o, &frame[snap_slot(map[j])]);\r\n\t    goto dupslot;\r\n\t  }\r\n\tsnap_unsink(J, T, ex, snapno, rfilt, ir, o);\r\n      dupslot:\r\n\tcontinue;\r\n      }\r\n      snap_restoreval(J, T, ex, snapno, rfilt, ref, o);\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && tvisint(o)) {\r\n\tTValue tmp;\r\n\tsnap_restoreval(J, T, ex, snapno, rfilt, ref+1, &tmp);\r\n\to->u32.hi = tmp.u32.lo;\r\n      } else if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\t/* Overwrite tag with frame link. */\r\n\to->fr.tp.ftsz = snap_slot(sn) != 0 ? (int32_t)*flinks-- : ftsz0;\r\n\tL->base = o+1;\r\n      }\r\n    }\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n\r\n  /* Compute current stack top. */\r\n  switch (bc_op(*pc)) {\r\n  default:\r\n    if (bc_op(*pc) < BC_FUNCF) {\r\n      L->top = curr_topL(L);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case BC_CALLM: case BC_CALLMT: case BC_RETM: case BC_TSETM:\r\n    L->top = frame + snap->nslots;\r\n    break;\r\n  }\r\n  return pc;\r\n}\r\n\r\n#undef IR\r\n#undef emitir_raw\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_snap.h",
    "content": "/*\r\n** Snapshot handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_SNAP_H\r\n#define _LJ_SNAP_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_snap_add(jit_State *J);\r\nLJ_FUNC void lj_snap_purge(jit_State *J);\r\nLJ_FUNC void lj_snap_shrink(jit_State *J);\r\nLJ_FUNC IRIns *lj_snap_regspmap(GCtrace *T, SnapNo snapno, IRIns *ir);\r\nLJ_FUNC void lj_snap_replay(jit_State *J, GCtrace *T);\r\nLJ_FUNC const BCIns *lj_snap_restore(jit_State *J, void *exptr);\r\nLJ_FUNC void lj_snap_grow_buf_(jit_State *J, MSize need);\r\nLJ_FUNC void lj_snap_grow_map_(jit_State *J, MSize need);\r\n\r\nstatic LJ_AINLINE void lj_snap_grow_buf(jit_State *J, MSize need)\r\n{\r\n  if (LJ_UNLIKELY(need > J->sizesnap)) lj_snap_grow_buf_(J, need);\r\n}\r\n\r\nstatic LJ_AINLINE void lj_snap_grow_map(jit_State *J, MSize need)\r\n{\r\n  if (LJ_UNLIKELY(need > J->sizesnapmap)) lj_snap_grow_map_(J, need);\r\n}\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_state.c",
    "content": "/*\r\n** State and stack handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_state_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_alloc.h\"\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Stack sizes. */\r\n#define LJ_STACK_MIN\tLUA_MINSTACK\t/* Min. stack size. */\r\n#define LJ_STACK_MAX\tLUAI_MAXSTACK\t/* Max. stack size. */\r\n#define LJ_STACK_START\t(2*LJ_STACK_MIN)\t/* Starting stack size. */\r\n#define LJ_STACK_MAXEX\t(LJ_STACK_MAX + 1 + LJ_STACK_EXTRA)\r\n\r\n/* Explanation of LJ_STACK_EXTRA:\r\n**\r\n** Calls to metamethods store their arguments beyond the current top\r\n** without checking for the stack limit. This avoids stack resizes which\r\n** would invalidate passed TValue pointers. The stack check is performed\r\n** later by the function header. This can safely resize the stack or raise\r\n** an error. Thus we need some extra slots beyond the current stack limit.\r\n**\r\n** Most metamethods need 4 slots above top (cont, mobj, arg1, arg2) plus\r\n** one extra slot if mobj is not a function. Only lj_meta_tset needs 5\r\n** slots above top, but then mobj is always a function. So we can get by\r\n** with 5 extra slots.\r\n*/\r\n\r\n/* Resize stack slots and adjust pointers in state. */\r\nstatic void resizestack(lua_State *L, MSize n)\r\n{\r\n  TValue *st, *oldst = tvref(L->stack);\r\n  ptrdiff_t delta;\r\n  MSize oldsize = L->stacksize;\r\n  MSize realsize = n + 1 + LJ_STACK_EXTRA;\r\n  GCobj *up;\r\n  lua_assert((MSize)(tvref(L->maxstack)-oldst)==L->stacksize-LJ_STACK_EXTRA-1);\r\n  st = (TValue *)lj_mem_realloc(L, tvref(L->stack),\r\n\t\t\t\t(MSize)(L->stacksize*sizeof(TValue)),\r\n\t\t\t\t(MSize)(realsize*sizeof(TValue)));\r\n  setmref(L->stack, st);\r\n  delta = (char *)st - (char *)oldst;\r\n  setmref(L->maxstack, st + n);\r\n  while (oldsize < realsize)  /* Clear new slots. */\r\n    setnilV(st + oldsize++);\r\n  L->stacksize = realsize;\r\n  L->base = (TValue *)((char *)L->base + delta);\r\n  L->top = (TValue *)((char *)L->top + delta);\r\n  for (up = gcref(L->openupval); up != NULL; up = gcnext(up))\r\n    setmref(gco2uv(up)->v, (TValue *)((char *)uvval(gco2uv(up)) + delta));\r\n  if (obj2gco(L) == gcref(G(L)->jit_L))\r\n    setmref(G(L)->jit_base, mref(G(L)->jit_base, char) + delta);\r\n}\r\n\r\n/* Relimit stack after error, in case the limit was overdrawn. */\r\nvoid lj_state_relimitstack(lua_State *L)\r\n{\r\n  if (L->stacksize > LJ_STACK_MAXEX && L->top-tvref(L->stack) < LJ_STACK_MAX-1)\r\n    resizestack(L, LJ_STACK_MAX);\r\n}\r\n\r\n/* Try to shrink the stack (called from GC). */\r\nvoid lj_state_shrinkstack(lua_State *L, MSize used)\r\n{\r\n  if (L->stacksize > LJ_STACK_MAXEX)\r\n    return;  /* Avoid stack shrinking while handling stack overflow. */\r\n  if (4*used < L->stacksize &&\r\n      2*(LJ_STACK_START+LJ_STACK_EXTRA) < L->stacksize &&\r\n      obj2gco(L) != gcref(G(L)->jit_L))  /* Don't shrink stack of live trace. */\r\n    resizestack(L, L->stacksize >> 1);\r\n}\r\n\r\n/* Try to grow stack. */\r\nvoid LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need)\r\n{\r\n  MSize n;\r\n  if (L->stacksize > LJ_STACK_MAXEX)  /* Overflow while handling overflow? */\r\n    lj_err_throw(L, LUA_ERRERR);\r\n  n = L->stacksize + need;\r\n  if (n > LJ_STACK_MAX) {\r\n    n += 2*LUA_MINSTACK;\r\n  } else if (n < 2*L->stacksize) {\r\n    n = 2*L->stacksize;\r\n    if (n >= LJ_STACK_MAX)\r\n      n = LJ_STACK_MAX;\r\n  }\r\n  resizestack(L, n);\r\n  if (L->stacksize > LJ_STACK_MAXEX)\r\n    lj_err_msg(L, LJ_ERR_STKOV);\r\n}\r\n\r\nvoid LJ_FASTCALL lj_state_growstack1(lua_State *L)\r\n{\r\n  lj_state_growstack(L, 1);\r\n}\r\n\r\n/* Allocate basic stack for new state. */\r\nstatic void stack_init(lua_State *L1, lua_State *L)\r\n{\r\n  TValue *stend, *st = lj_mem_newvec(L, LJ_STACK_START+LJ_STACK_EXTRA, TValue);\r\n  setmref(L1->stack, st);\r\n  L1->stacksize = LJ_STACK_START + LJ_STACK_EXTRA;\r\n  stend = st + L1->stacksize;\r\n  setmref(L1->maxstack, stend - LJ_STACK_EXTRA - 1);\r\n  L1->base = L1->top = st+1;\r\n  setthreadV(L1, st, L1);  /* Needed for curr_funcisL() on empty stack. */\r\n  while (st < stend)  /* Clear new slots. */\r\n    setnilV(st++);\r\n}\r\n\r\n/* -- State handling ------------------------------------------------------ */\r\n\r\n/* Open parts that may cause memory-allocation errors. */\r\nstatic TValue *cpluaopen(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  UNUSED(dummy);\r\n  UNUSED(ud);\r\n  stack_init(L, L);\r\n  /* NOBARRIER: State initialization, all objects are white. */\r\n  setgcref(L->env, obj2gco(lj_tab_new(L, 0, LJ_MIN_GLOBAL)));\r\n  settabV(L, registry(L), lj_tab_new(L, 0, LJ_MIN_REGISTRY));\r\n  lj_str_resize(L, LJ_MIN_STRTAB-1);\r\n  lj_meta_init(L);\r\n  lj_lex_init(L);\r\n  fixstring(lj_err_str(L, LJ_ERR_ERRMEM));  /* Preallocate memory error msg. */\r\n  g->gc.threshold = 4*g->gc.total;\r\n  lj_trace_initstate(g);\r\n  return NULL;\r\n}\r\n\r\nstatic void close_state(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lj_gc_freeall(g);\r\n  lua_assert(gcref(g->gc.root) == obj2gco(L));\r\n  lua_assert(g->strnum == 0);\r\n  lj_trace_freestate(g);\r\n#if LJ_HASFFI\r\n  lj_ctype_freestate(g);\r\n#endif\r\n  lj_mem_freevec(g, g->strhash, g->strmask+1, GCRef);\r\n  lj_str_freebuf(g, &g->tmpbuf);\r\n  lj_mem_freevec(g, tvref(L->stack), L->stacksize, TValue);\r\n  lua_assert(g->gc.total == sizeof(GG_State));\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\n  if (g->allocf == lj_alloc_f)\r\n    lj_alloc_destroy(g->allocd);\r\n  else\r\n#endif\r\n    g->allocf(g->allocd, G2GG(g), sizeof(GG_State), 0);\r\n}\r\n\r\n#if LJ_64 && !(defined(LUAJIT_USE_VALGRIND) && defined(LUAJIT_USE_SYSMALLOC))\r\nlua_State *lj_state_newstate(lua_Alloc f, void *ud)\r\n#else\r\nLUA_API lua_State *lua_newstate(lua_Alloc f, void *ud)\r\n#endif\r\n{\r\n  GG_State *GG = (GG_State *)f(ud, NULL, 0, sizeof(GG_State));\r\n  lua_State *L = &GG->L;\r\n  global_State *g = &GG->g;\r\n  if (GG == NULL || !checkptr32(GG)) return NULL;\r\n  memset(GG, 0, sizeof(GG_State));\r\n  L->gct = ~LJ_TTHREAD;\r\n  L->marked = LJ_GC_WHITE0 | LJ_GC_FIXED | LJ_GC_SFIXED;  /* Prevent free. */\r\n  L->dummy_ffid = FF_C;\r\n  setmref(L->glref, g);\r\n  g->gc.currentwhite = LJ_GC_WHITE0 | LJ_GC_FIXED;\r\n  g->strempty.marked = LJ_GC_WHITE0;\r\n  g->strempty.gct = ~LJ_TSTR;\r\n  g->allocf = f;\r\n  g->allocd = ud;\r\n  setgcref(g->mainthref, obj2gco(L));\r\n  setgcref(g->uvhead.prev, obj2gco(&g->uvhead));\r\n  setgcref(g->uvhead.next, obj2gco(&g->uvhead));\r\n  g->strmask = ~(MSize)0;\r\n  setnilV(registry(L));\r\n  setnilV(&g->nilnode.val);\r\n  setnilV(&g->nilnode.key);\r\n  setmref(g->nilnode.freetop, &g->nilnode);\r\n  lj_str_initbuf(&g->tmpbuf);\r\n  g->gc.state = GCSpause;\r\n  setgcref(g->gc.root, obj2gco(L));\r\n  setmref(g->gc.sweep, &g->gc.root);\r\n  g->gc.total = sizeof(GG_State);\r\n  g->gc.pause = LUAI_GCPAUSE;\r\n  g->gc.stepmul = LUAI_GCMUL;\r\n  lj_dispatch_init((GG_State *)L);\r\n  L->status = LUA_ERRERR+1;  /* Avoid touching the stack upon memory error. */\r\n  if (lj_vm_cpcall(L, NULL, NULL, cpluaopen) != 0) {\r\n    /* Memory allocation error: free partial state. */\r\n    close_state(L);\r\n    return NULL;\r\n  }\r\n  L->status = 0;\r\n  return L;\r\n}\r\n\r\nstatic TValue *cpfinalize(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  UNUSED(dummy);\r\n  UNUSED(ud);\r\n  lj_gc_finalize_cdata(L);\r\n  lj_gc_finalize_udata(L);\r\n  /* Frame pop omitted. */\r\n  return NULL;\r\n}\r\n\r\nLUA_API void lua_close(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  int i;\r\n  L = mainthread(g);  /* Only the main thread can be closed. */\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lj_gc_separateudata(g, 1);  /* Separate udata which have GC metamethods. */\r\n#if LJ_HASJIT\r\n  G2J(g)->flags &= ~JIT_F_ON;\r\n  G2J(g)->state = LJ_TRACE_IDLE;\r\n  lj_dispatch_update(g);\r\n#endif\r\n  for (i = 0;;) {\r\n    hook_enter(g);\r\n    L->status = 0;\r\n    L->cframe = NULL;\r\n    L->base = L->top = tvref(L->stack) + 1;\r\n    if (lj_vm_cpcall(L, NULL, NULL, cpfinalize) == 0) {\r\n      if (++i >= 10) break;\r\n      lj_gc_separateudata(g, 1);  /* Separate udata again. */\r\n      if (gcref(g->gc.mmudata) == NULL)  /* Until nothing is left to do. */\r\n\tbreak;\r\n    }\r\n  }\r\n  close_state(L);\r\n}\r\n\r\nlua_State *lj_state_new(lua_State *L)\r\n{\r\n  lua_State *L1 = lj_mem_newobj(L, lua_State);\r\n  L1->gct = ~LJ_TTHREAD;\r\n  L1->dummy_ffid = FF_C;\r\n  L1->status = 0;\r\n  L1->stacksize = 0;\r\n  setmref(L1->stack, NULL);\r\n  L1->cframe = NULL;\r\n  /* NOBARRIER: The lua_State is new (marked white). */\r\n  setgcrefnull(L1->openupval);\r\n  setmrefr(L1->glref, L->glref);\r\n  setgcrefr(L1->env, L->env);\r\n  stack_init(L1, L);  /* init stack */\r\n  lua_assert(iswhite(obj2gco(L1)));\r\n  return L1;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_state_free(global_State *g, lua_State *L)\r\n{\r\n  lua_assert(L != mainthread(g));\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lua_assert(gcref(L->openupval) == NULL);\r\n  lj_mem_freevec(g, tvref(L->stack), L->stacksize, TValue);\r\n  lj_mem_freet(g, L);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_state.h",
    "content": "/*\r\n** State and stack handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STATE_H\r\n#define _LJ_STATE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#define incr_top(L) \\\r\n  (++L->top >= tvref(L->maxstack) && (lj_state_growstack1(L), 0))\r\n\r\n#define savestack(L, p)\t\t((char *)(p) - mref(L->stack, char))\r\n#define restorestack(L, n)\t((TValue *)(mref(L->stack, char) + (n)))\r\n\r\nLJ_FUNC void lj_state_relimitstack(lua_State *L);\r\nLJ_FUNC void lj_state_shrinkstack(lua_State *L, MSize used);\r\nLJ_FUNCA void LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need);\r\nLJ_FUNC void LJ_FASTCALL lj_state_growstack1(lua_State *L);\r\n\r\nstatic LJ_AINLINE void lj_state_checkstack(lua_State *L, MSize need)\r\n{\r\n  if ((mref(L->maxstack, char) - (char *)L->top) <=\r\n      (ptrdiff_t)need*(ptrdiff_t)sizeof(TValue))\r\n    lj_state_growstack(L, need);\r\n}\r\n\r\nLJ_FUNC lua_State *lj_state_new(lua_State *L);\r\nLJ_FUNC void LJ_FASTCALL lj_state_free(global_State *g, lua_State *L);\r\n#if LJ_64\r\nLJ_FUNC lua_State *lj_state_newstate(lua_Alloc f, void *ud);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_str.c",
    "content": "/*\r\n** String handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lj_str_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_char.h\"\r\n\r\n/* -- String interning ---------------------------------------------------- */\r\n\r\n/* Ordered compare of strings. Assumes string data is 4-byte aligned. */\r\nint32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b)\r\n{\r\n  MSize i, n = a->len > b->len ? b->len : a->len;\r\n  for (i = 0; i < n; i += 4) {\r\n    /* Note: innocuous access up to end of string + 3. */\r\n    uint32_t va = *(const uint32_t *)(strdata(a)+i);\r\n    uint32_t vb = *(const uint32_t *)(strdata(b)+i);\r\n    if (va != vb) {\r\n#if LJ_LE\r\n      va = lj_bswap(va); vb = lj_bswap(vb);\r\n#endif\r\n      i -= n;\r\n      if ((int32_t)i >= -3) {\r\n\tva >>= 32+(i<<3); vb >>= 32+(i<<3);\r\n\tif (va == vb) break;\r\n      }\r\n      return va < vb ? -1 : 1;\r\n    }\r\n  }\r\n  return (int32_t)(a->len - b->len);\r\n}\r\n\r\n/* Fast string data comparison. Caveat: unaligned access to 1st string! */\r\nstatic LJ_AINLINE int str_fastcmp(const char *a, const char *b, MSize len)\r\n{\r\n  MSize i = 0;\r\n  lua_assert(len > 0);\r\n  lua_assert((((uintptr_t)a+len-1) & (LJ_PAGESIZE-1)) <= LJ_PAGESIZE-4);\r\n  do {  /* Note: innocuous access up to end of string + 3. */\r\n    uint32_t v = lj_getu32(a+i) ^ *(const uint32_t *)(b+i);\r\n    if (v) {\r\n      i -= len;\r\n#if LJ_LE\r\n      return (int32_t)i >= -3 ? (v << (32+(i<<3))) : 1;\r\n#else\r\n      return (int32_t)i >= -3 ? (v >> (32+(i<<3))) : 1;\r\n#endif\r\n    }\r\n    i += 4;\r\n  } while (i < len);\r\n  return 0;\r\n}\r\n\r\n/* Resize the string hash table (grow and shrink). */\r\nvoid lj_str_resize(lua_State *L, MSize newmask)\r\n{\r\n  global_State *g = G(L);\r\n  GCRef *newhash;\r\n  MSize i;\r\n  if (g->gc.state == GCSsweepstring || newmask >= LJ_MAX_STRTAB-1)\r\n    return;  /* No resizing during GC traversal or if already too big. */\r\n  newhash = lj_mem_newvec(L, newmask+1, GCRef);\r\n  memset(newhash, 0, (newmask+1)*sizeof(GCRef));\r\n  for (i = g->strmask; i != ~(MSize)0; i--) {  /* Rehash old table. */\r\n    GCobj *p = gcref(g->strhash[i]);\r\n    while (p) {  /* Follow each hash chain and reinsert all strings. */\r\n      MSize h = gco2str(p)->hash & newmask;\r\n      GCobj *next = gcnext(p);\r\n      /* NOBARRIER: The string table is a GC root. */\r\n      setgcrefr(p->gch.nextgc, newhash[h]);\r\n      setgcref(newhash[h], p);\r\n      p = next;\r\n    }\r\n  }\r\n  lj_mem_freevec(g, g->strhash, g->strmask+1, GCRef);\r\n  g->strmask = newmask;\r\n  g->strhash = newhash;\r\n}\r\n\r\n/* Intern a string and return string object. */\r\nGCstr *lj_str_new(lua_State *L, const char *str, size_t lenx)\r\n{\r\n  global_State *g;\r\n  GCstr *s;\r\n  GCobj *o;\r\n  MSize len = (MSize)lenx;\r\n  MSize a, b, h = len;\r\n  if (lenx >= LJ_MAX_STR)\r\n    lj_err_msg(L, LJ_ERR_STROV);\r\n  g = G(L);\r\n  /* Compute string hash. Constants taken from lookup3 hash by Bob Jenkins. */\r\n  if (len >= 4) {  /* Caveat: unaligned access! */\r\n    a = lj_getu32(str);\r\n    h ^= lj_getu32(str+len-4);\r\n    b = lj_getu32(str+(len>>1)-2);\r\n    h ^= b; h -= lj_rol(b, 14);\r\n    b += lj_getu32(str+(len>>2)-1);\r\n  } else if (len > 0) {\r\n    a = *(const uint8_t *)str;\r\n    h ^= *(const uint8_t *)(str+len-1);\r\n    b = *(const uint8_t *)(str+(len>>1));\r\n    h ^= b; h -= lj_rol(b, 14);\r\n  } else {\r\n    return &g->strempty;\r\n  }\r\n  a ^= h; a -= lj_rol(h, 11);\r\n  b ^= a; b -= lj_rol(a, 25);\r\n  h ^= b; h -= lj_rol(b, 16);\r\n  /* Check if the string has already been interned. */\r\n  o = gcref(g->strhash[h & g->strmask]);\r\n  if (LJ_LIKELY((((uintptr_t)str+len-1) & (LJ_PAGESIZE-1)) <= LJ_PAGESIZE-4)) {\r\n    while (o != NULL) {\r\n      GCstr *sx = gco2str(o);\r\n      if (sx->len == len && str_fastcmp(str, strdata(sx), len) == 0) {\r\n\t/* Resurrect if dead. Can only happen with fixstring() (keywords). */\r\n\tif (isdead(g, o)) flipwhite(o);\r\n\treturn sx;  /* Return existing string. */\r\n      }\r\n      o = gcnext(o);\r\n    }\r\n  } else {  /* Slow path: end of string is too close to a page boundary. */\r\n    while (o != NULL) {\r\n      GCstr *sx = gco2str(o);\r\n      if (sx->len == len && memcmp(str, strdata(sx), len) == 0) {\r\n\t/* Resurrect if dead. Can only happen with fixstring() (keywords). */\r\n\tif (isdead(g, o)) flipwhite(o);\r\n\treturn sx;  /* Return existing string. */\r\n      }\r\n      o = gcnext(o);\r\n    }\r\n  }\r\n  /* Nope, create a new string. */\r\n  s = lj_mem_newt(L, sizeof(GCstr)+len+1, GCstr);\r\n  newwhite(g, s);\r\n  s->gct = ~LJ_TSTR;\r\n  s->len = len;\r\n  s->hash = h;\r\n  s->reserved = 0;\r\n  memcpy(strdatawr(s), str, len);\r\n  strdatawr(s)[len] = '\\0';  /* Zero-terminate string. */\r\n  /* Add it to string hash table. */\r\n  h &= g->strmask;\r\n  s->nextgc = g->strhash[h];\r\n  /* NOBARRIER: The string table is a GC root. */\r\n  setgcref(g->strhash[h], obj2gco(s));\r\n  if (g->strnum++ > g->strmask)  /* Allow a 100% load factor. */\r\n    lj_str_resize(L, (g->strmask<<1)+1);  /* Grow string table. */\r\n  return s;  /* Return newly interned string. */\r\n}\r\n\r\nvoid LJ_FASTCALL lj_str_free(global_State *g, GCstr *s)\r\n{\r\n  g->strnum--;\r\n  lj_mem_free(g, s, sizestring(s));\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\n/* Print number to buffer. Canonicalizes non-finite values. */\r\nsize_t LJ_FASTCALL lj_str_bufnum(char *s, cTValue *o)\r\n{\r\n  if (LJ_LIKELY((o->u32.hi << 1) < 0xffe00000)) {  /* Finite? */\r\n    lua_Number n = o->n;\r\n#if __BIONIC__\r\n    if (tvismzero(o)) { s[0] = '-'; s[1] = '0'; return 2; }\r\n#endif\r\n    return (size_t)lua_number2str(s, n);\r\n  } else if (((o->u32.hi & 0x000fffff) | o->u32.lo) != 0) {\r\n    s[0] = 'n'; s[1] = 'a'; s[2] = 'n'; return 3;\r\n  } else if ((o->u32.hi & 0x80000000) == 0) {\r\n    s[0] = 'i'; s[1] = 'n'; s[2] = 'f'; return 3;\r\n  } else {\r\n    s[0] = '-'; s[1] = 'i'; s[2] = 'n'; s[3] = 'f'; return 4;\r\n  }\r\n}\r\n\r\n/* Print integer to buffer. Returns pointer to start. */\r\nchar * LJ_FASTCALL lj_str_bufint(char *p, int32_t k)\r\n{\r\n  uint32_t u = (uint32_t)(k < 0 ? -k : k);\r\n  p += 1+10;\r\n  do { *--p = (char)('0' + u % 10); } while (u /= 10);\r\n  if (k < 0) *--p = '-';\r\n  return p;\r\n}\r\n\r\n/* Convert number to string. */\r\nGCstr * LJ_FASTCALL lj_str_fromnum(lua_State *L, const lua_Number *np)\r\n{\r\n  char buf[LJ_STR_NUMBUF];\r\n  size_t len = lj_str_bufnum(buf, (TValue *)np);\r\n  return lj_str_new(L, buf, len);\r\n}\r\n\r\n/* Convert integer to string. */\r\nGCstr * LJ_FASTCALL lj_str_fromint(lua_State *L, int32_t k)\r\n{\r\n  char s[1+10];\r\n  char *p = lj_str_bufint(s, k);\r\n  return lj_str_new(L, p, (size_t)(s+sizeof(s)-p));\r\n}\r\n\r\nGCstr * LJ_FASTCALL lj_str_fromnumber(lua_State *L, cTValue *o)\r\n{\r\n  return tvisint(o) ? lj_str_fromint(L, intV(o)) : lj_str_fromnum(L, &o->n);\r\n}\r\n\r\n/* -- String formatting --------------------------------------------------- */\r\n\r\nstatic void addstr(lua_State *L, SBuf *sb, const char *str, MSize len)\r\n{\r\n  char *p;\r\n  MSize i;\r\n  if (sb->n + len > sb->sz) {\r\n    MSize sz = sb->sz * 2;\r\n    while (sb->n + len > sz) sz = sz * 2;\r\n    lj_str_resizebuf(L, sb, sz);\r\n  }\r\n  p = sb->buf + sb->n;\r\n  sb->n += len;\r\n  for (i = 0; i < len; i++) p[i] = str[i];\r\n}\r\n\r\nstatic void addchar(lua_State *L, SBuf *sb, int c)\r\n{\r\n  if (sb->n + 1 > sb->sz) {\r\n    MSize sz = sb->sz * 2;\r\n    lj_str_resizebuf(L, sb, sz);\r\n  }\r\n  sb->buf[sb->n++] = (char)c;\r\n}\r\n\r\n/* Push formatted message as a string object to Lua stack. va_list variant. */\r\nconst char *lj_str_pushvf(lua_State *L, const char *fmt, va_list argp)\r\n{\r\n  SBuf *sb = &G(L)->tmpbuf;\r\n  lj_str_needbuf(L, sb, (MSize)strlen(fmt));\r\n  lj_str_resetbuf(sb);\r\n  for (;;) {\r\n    const char *e = strchr(fmt, '%');\r\n    if (e == NULL) break;\r\n    addstr(L, sb, fmt, (MSize)(e-fmt));\r\n    /* This function only handles %s, %c, %d, %f and %p formats. */\r\n    switch (e[1]) {\r\n    case 's': {\r\n      const char *s = va_arg(argp, char *);\r\n      if (s == NULL) s = \"(null)\";\r\n      addstr(L, sb, s, (MSize)strlen(s));\r\n      break;\r\n      }\r\n    case 'c':\r\n      addchar(L, sb, va_arg(argp, int));\r\n      break;\r\n    case 'd': {\r\n      char buf[LJ_STR_INTBUF];\r\n      char *p = lj_str_bufint(buf, va_arg(argp, int32_t));\r\n      addstr(L, sb, p, (MSize)(buf+LJ_STR_INTBUF-p));\r\n      break;\r\n      }\r\n    case 'f': {\r\n      char buf[LJ_STR_NUMBUF];\r\n      TValue tv;\r\n      MSize len;\r\n      tv.n = (lua_Number)(va_arg(argp, LUAI_UACNUMBER));\r\n      len = (MSize)lj_str_bufnum(buf, &tv);\r\n      addstr(L, sb, buf, len);\r\n      break;\r\n      }\r\n    case 'p': {\r\n#define FMTP_CHARS\t(2*sizeof(ptrdiff_t))\r\n      char buf[2+FMTP_CHARS];\r\n      ptrdiff_t p = (ptrdiff_t)(va_arg(argp, void *));\r\n      ptrdiff_t i, lasti = 2+FMTP_CHARS;\r\n      if (p == 0) {\r\n\taddstr(L, sb, \"NULL\", 4);\r\n\tbreak;\r\n      }\r\n#if LJ_64\r\n      /* Shorten output for 64 bit pointers. */\r\n      lasti = 2+2*4+((p >> 32) ? 2+2*(lj_fls((uint32_t)(p >> 32))>>3) : 0);\r\n#endif\r\n      buf[0] = '0';\r\n      buf[1] = 'x';\r\n      for (i = lasti-1; i >= 2; i--, p >>= 4)\r\n\tbuf[i] = \"0123456789abcdef\"[(p & 15)];\r\n      addstr(L, sb, buf, (MSize)lasti);\r\n      break;\r\n      }\r\n    case '%':\r\n      addchar(L, sb, '%');\r\n      break;\r\n    default:\r\n      addchar(L, sb, '%');\r\n      addchar(L, sb, e[1]);\r\n      break;\r\n    }\r\n    fmt = e+2;\r\n  }\r\n  addstr(L, sb, fmt, (MSize)strlen(fmt));\r\n  setstrV(L, L->top, lj_str_new(L, sb->buf, sb->n));\r\n  incr_top(L);\r\n  return strVdata(L->top - 1);\r\n}\r\n\r\n/* Push formatted message as a string object to Lua stack. Vararg variant. */\r\nconst char *lj_str_pushf(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  msg = lj_str_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  return msg;\r\n}\r\n\r\n/* -- Buffer handling ----------------------------------------------------- */\r\n\r\nchar *lj_str_needbuf(lua_State *L, SBuf *sb, MSize sz)\r\n{\r\n  if (sz > sb->sz) {\r\n    if (sz < LJ_MIN_SBUF) sz = LJ_MIN_SBUF;\r\n    lj_str_resizebuf(L, sb, sz);\r\n  }\r\n  return sb->buf;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_str.h",
    "content": "/*\r\n** String handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STR_H\r\n#define _LJ_STR_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* String interning. */\r\nLJ_FUNC int32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b);\r\nLJ_FUNC void lj_str_resize(lua_State *L, MSize newmask);\r\nLJ_FUNCA GCstr *lj_str_new(lua_State *L, const char *str, size_t len);\r\nLJ_FUNC void LJ_FASTCALL lj_str_free(global_State *g, GCstr *s);\r\n\r\n#define lj_str_newz(L, s)\t(lj_str_new(L, s, strlen(s)))\r\n#define lj_str_newlit(L, s)\t(lj_str_new(L, \"\" s, sizeof(s)-1))\r\n\r\n/* Type conversions. */\r\nLJ_FUNC size_t LJ_FASTCALL lj_str_bufnum(char *s, cTValue *o);\r\nLJ_FUNC char * LJ_FASTCALL lj_str_bufint(char *p, int32_t k);\r\nLJ_FUNCA GCstr * LJ_FASTCALL lj_str_fromnum(lua_State *L, const lua_Number *np);\r\nLJ_FUNC GCstr * LJ_FASTCALL lj_str_fromint(lua_State *L, int32_t k);\r\nLJ_FUNCA GCstr * LJ_FASTCALL lj_str_fromnumber(lua_State *L, cTValue *o);\r\n\r\n#define LJ_STR_INTBUF\t\t(1+10)\r\n#define LJ_STR_NUMBUF\t\tLUAI_MAXNUMBER2STR\r\n\r\n/* String formatting. */\r\nLJ_FUNC const char *lj_str_pushvf(lua_State *L, const char *fmt, va_list argp);\r\nLJ_FUNC const char *lj_str_pushf(lua_State *L, const char *fmt, ...)\r\n#if defined(__GNUC__)\r\n  __attribute__ ((format (printf, 2, 3)))\r\n#endif\r\n  ;\r\n\r\n/* Resizable string buffers. Struct definition in lj_obj.h. */\r\nLJ_FUNC char *lj_str_needbuf(lua_State *L, SBuf *sb, MSize sz);\r\n\r\n#define lj_str_initbuf(sb)\t((sb)->buf = NULL, (sb)->sz = 0)\r\n#define lj_str_resetbuf(sb)\t((sb)->n = 0)\r\n#define lj_str_resizebuf(L, sb, size) \\\r\n  ((sb)->buf = (char *)lj_mem_realloc(L, (sb)->buf, (sb)->sz, (size)), \\\r\n   (sb)->sz = (size))\r\n#define lj_str_freebuf(g, sb)\tlj_mem_free(g, (void *)(sb)->buf, (sb)->sz)\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_strscan.c",
    "content": "/*\r\n** String scanning.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <math.h>\r\n\r\n#define lj_strscan_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* -- Scanning numbers ---------------------------------------------------- */\r\n\r\n/*\r\n** Rationale for the builtin string to number conversion library:\r\n**\r\n** It removes a dependency on libc's strtod(), which is a true portability\r\n** nightmare. Mainly due to the plethora of supported OS and toolchain\r\n** combinations. Sadly, the various implementations\r\n** a) are often buggy, incomplete (no hex floats) and/or imprecise,\r\n** b) sometimes crash or hang on certain inputs,\r\n** c) return non-standard NaNs that need to be filtered out, and\r\n** d) fail if the locale-specific decimal separator is not a dot,\r\n**    which can only be fixed with atrocious workarounds.\r\n**\r\n** Also, most of the strtod() implementations are hopelessly bloated,\r\n** which is not just an I-cache hog, but a problem for static linkage\r\n** on embedded systems, too.\r\n**\r\n** OTOH the builtin conversion function is very compact. Even though it\r\n** does a lot more, like parsing long longs, octal or imaginary numbers\r\n** and returning the result in different formats:\r\n** a) It needs less than 3 KB (!) of machine code (on x64 with -Os),\r\n** b) it doesn't perform any dynamic allocation and,\r\n** c) it needs only around 600 bytes of stack space.\r\n**\r\n** The builtin function is faster than strtod() for typical inputs, e.g.\r\n** \"123\", \"1.5\" or \"1e6\". Arguably, it's slower for very large exponents,\r\n** which are not very common (this could be fixed, if needed).\r\n**\r\n** And most importantly, the builtin function is equally precise on all\r\n** platforms. It correctly converts and rounds any input to a double.\r\n** If this is not the case, please send a bug report -- but PLEASE verify\r\n** that the implementation you're comparing to is not the culprit!\r\n**\r\n** The implementation quickly pre-scans the entire string first and\r\n** handles simple integers on-the-fly. Otherwise, it dispatches to the\r\n** base-specific parser. Hex and octal is straightforward.\r\n**\r\n** Decimal to binary conversion uses a fixed-length circular buffer in\r\n** base 100. Some simple cases are handled directly. For other cases, the\r\n** number in the buffer is up-scaled or down-scaled until the integer part\r\n** is in the proper range. Then the integer part is rounded and converted\r\n** to a double which is finally rescaled to the result. Denormals need\r\n** special treatment to prevent incorrect 'double rounding'.\r\n*/\r\n\r\n/* Definitions for circular decimal digit buffer (base 100 = 2 digits/byte). */\r\n#define STRSCAN_DIG\t1024\r\n#define STRSCAN_MAXDIG\t800\t\t/* 772 + extra are sufficient. */\r\n#define STRSCAN_DDIG\t(STRSCAN_DIG/2)\r\n#define STRSCAN_DMASK\t(STRSCAN_DDIG-1)\r\n\r\n/* Helpers for circular buffer. */\r\n#define DNEXT(a)\t(((a)+1) & STRSCAN_DMASK)\r\n#define DPREV(a)\t(((a)-1) & STRSCAN_DMASK)\r\n#define DLEN(lo, hi)\t((int32_t)(((lo)-(hi)) & STRSCAN_DMASK))\r\n\r\n#define casecmp(c, k)\t(((c) | 0x20) == k)\r\n\r\n/* Final conversion to double. */\r\nstatic void strscan_double(uint64_t x, TValue *o, int32_t ex2, int32_t neg)\r\n{\r\n  double n;\r\n\r\n  /* Avoid double rounding for denormals. */\r\n  if (LJ_UNLIKELY(ex2 <= -1075 && x != 0)) {\r\n    /* NYI: all of this generates way too much code on 32 bit CPUs. */\r\n#if defined(__GNUC__) && LJ_64\r\n    int32_t b = (int32_t)(__builtin_clzll(x)^63);\r\n#else\r\n    int32_t b = (x>>32) ? 32+(int32_t)lj_fls((uint32_t)(x>>32)) :\r\n\t\t\t  (int32_t)lj_fls((uint32_t)x);\r\n#endif\r\n    if ((int32_t)b + ex2 <= -1023 && (int32_t)b + ex2 >= -1075) {\r\n      uint64_t rb = (uint64_t)1 << (-1075-ex2);\r\n      if ((x & rb) && ((x & (rb+rb+rb-1)))) x += rb+rb;\r\n      x = (x & ~(rb+rb-1));\r\n    }\r\n  }\r\n\r\n  /* Convert to double using a signed int64_t conversion, then rescale. */\r\n  lua_assert((int64_t)x >= 0);\r\n  n = (double)(int64_t)x;\r\n  if (neg) n = -n;\r\n  if (ex2) n = ldexp(n, ex2);\r\n  o->n = n;\r\n}\r\n\r\n/* Parse hexadecimal number. */\r\nstatic StrScanFmt strscan_hex(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, uint32_t opt,\r\n\t\t\t      int32_t ex2, int32_t neg, uint32_t dig)\r\n{\r\n  uint64_t x = 0;\r\n  uint32_t i;\r\n\r\n  /* Scan hex digits. */\r\n  for (i = dig > 16 ? 16 : dig ; i; i--, p++) {\r\n    uint32_t d = (*p != '.' ? *p : *++p); if (d > '9') d += 9;\r\n    x = (x << 4) + (d & 15);\r\n  }\r\n\r\n  /* Summarize rounding-effect of excess digits. */\r\n  for (i = 16; i < dig; i++, p++)\r\n    x |= ((*p != '.' ? *p : *++p) != '0'), ex2 += 4;\r\n\r\n  /* Format-specific handling. */\r\n  switch (fmt) {\r\n  case STRSCAN_INT:\r\n    if (!(opt & STRSCAN_OPT_TONUM) && x < 0x80000000u+neg) {\r\n      o->i = neg ? -(int32_t)x : (int32_t)x;\r\n      return STRSCAN_INT;  /* Fast path for 32 bit integers. */\r\n    }\r\n    if (!(opt & STRSCAN_OPT_C)) { fmt = STRSCAN_NUM; break; }\r\n    /* fallthrough */\r\n  case STRSCAN_U32:\r\n    if (dig > 8) return STRSCAN_ERROR;\r\n    o->i = neg ? -(int32_t)x : (int32_t)x;\r\n    return STRSCAN_U32;\r\n  case STRSCAN_I64:\r\n  case STRSCAN_U64:\r\n    if (dig > 16) return STRSCAN_ERROR;\r\n    o->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n    return fmt;\r\n  default:\r\n    break;\r\n  }\r\n\r\n  /* Reduce range then convert to double. */\r\n  if ((x & U64x(c0000000,0000000))) { x = (x >> 2) | (x & 3); ex2 += 2; }\r\n  strscan_double(x, o, ex2, neg);\r\n  return fmt;\r\n}\r\n\r\n/* Parse octal number. */\r\nstatic StrScanFmt strscan_oct(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, int32_t neg, uint32_t dig)\r\n{\r\n  uint64_t x = 0;\r\n\r\n  /* Scan octal digits. */\r\n  if (dig > 22 || (dig == 22 && *p > '1')) return STRSCAN_ERROR;\r\n  while (dig-- > 0) {\r\n    if (!(*p >= '0' && *p <= '7')) return STRSCAN_ERROR;\r\n    x = (x << 3) + (*p++ & 7);\r\n  }\r\n\r\n  /* Format-specific handling. */\r\n  switch (fmt) {\r\n  case STRSCAN_INT:\r\n    if (x >= 0x80000000u+neg) fmt = STRSCAN_U32;\r\n    /* fallthrough */\r\n  case STRSCAN_U32:\r\n    if ((x >> 32)) return STRSCAN_ERROR;\r\n    o->i = neg ? -(int32_t)x : (int32_t)x;\r\n    break;\r\n  default:\r\n  case STRSCAN_I64:\r\n  case STRSCAN_U64:\r\n    o->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n    break;\r\n  }\r\n  return fmt;\r\n}\r\n\r\n/* Parse decimal number. */\r\nstatic StrScanFmt strscan_dec(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, uint32_t opt,\r\n\t\t\t      int32_t ex10, int32_t neg, uint32_t dig)\r\n{\r\n  uint8_t xi[STRSCAN_DDIG], *xip = xi;\r\n\r\n  if (dig) {\r\n    uint32_t i = dig;\r\n    if (i > STRSCAN_MAXDIG) {\r\n      ex10 += (int32_t)(i - STRSCAN_MAXDIG);\r\n      i = STRSCAN_MAXDIG;\r\n    }\r\n    /* Scan unaligned leading digit. */\r\n    if (((ex10^i) & 1))\r\n      *xip++ = ((*p != '.' ? *p : *++p) & 15), i--, p++;\r\n    /* Scan aligned double-digits. */\r\n    for ( ; i > 1; i -= 2) {\r\n      uint32_t d = 10 * ((*p != '.' ? *p : *++p) & 15); p++;\r\n      *xip++ = d + ((*p != '.' ? *p : *++p) & 15); p++;\r\n    }\r\n    /* Scan and realign trailing digit. */\r\n    if (i) *xip++ = 10 * ((*p != '.' ? *p : *++p) & 15), ex10--, dig++, p++;\r\n\r\n    /* Summarize rounding-effect of excess digits. */\r\n    if (dig > STRSCAN_MAXDIG) {\r\n      do {\r\n\tif ((*p != '.' ? *p : *++p) != '0') { xip[-1] |= 1; break; }\r\n\tp++;\r\n      } while (--dig > STRSCAN_MAXDIG);\r\n      dig = STRSCAN_MAXDIG;\r\n    } else {  /* Simplify exponent. */\r\n      while (ex10 > 0 && dig <= 18) *xip++ = 0, ex10 -= 2, dig += 2;\r\n    }\r\n  } else {  /* Only got zeros. */\r\n    ex10 = 0;\r\n    xi[0] = 0;\r\n  }\r\n\r\n  /* Fast path for numbers in integer format (but handles e.g. 1e6, too). */\r\n  if (dig <= 20 && ex10 == 0) {\r\n    uint8_t *xis;\r\n    uint64_t x = xi[0];\r\n    double n;\r\n    for (xis = xi+1; xis < xip; xis++) x = x * 100 + *xis;\r\n    if (!(dig == 20 && (xi[0] > 18 || (int64_t)x >= 0))) {  /* No overflow? */\r\n      /* Format-specific handling. */\r\n      switch (fmt) {\r\n      case STRSCAN_INT:\r\n\tif (!(opt & STRSCAN_OPT_TONUM) && x < 0x80000000u+neg) {\r\n\t  o->i = neg ? -(int32_t)x : (int32_t)x;\r\n\t  return STRSCAN_INT;  /* Fast path for 32 bit integers. */\r\n\t}\r\n\tif (!(opt & STRSCAN_OPT_C)) { fmt = STRSCAN_NUM; goto plainnumber; }\r\n\t/* fallthrough */\r\n      case STRSCAN_U32:\r\n\tif ((x >> 32) != 0) return STRSCAN_ERROR;\r\n\to->i = neg ? -(int32_t)x : (int32_t)x;\r\n\treturn STRSCAN_U32;\r\n      case STRSCAN_I64:\r\n      case STRSCAN_U64:\r\n\to->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n\treturn fmt;\r\n      default:\r\n      plainnumber:  /* Fast path for plain numbers < 2^63. */\r\n\tif ((int64_t)x < 0) break;\r\n\tn = (double)(int64_t)x;\r\n\tif (neg) n = -n;\r\n\to->n = n;\r\n\treturn fmt;\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Slow non-integer path. */\r\n  if (fmt == STRSCAN_INT) {\r\n    if ((opt & STRSCAN_OPT_C)) return STRSCAN_ERROR;\r\n    fmt = STRSCAN_NUM;\r\n  } else if (fmt > STRSCAN_INT) {\r\n    return STRSCAN_ERROR;\r\n  }\r\n  {\r\n    uint32_t hi = 0, lo = (uint32_t)(xip-xi);\r\n    int32_t ex2 = 0, idig = (int32_t)lo + (ex10 >> 1);\r\n\r\n    lua_assert(lo > 0 && (ex10 & 1) == 0);\r\n\r\n    /* Handle simple overflow/underflow. */\r\n    if (idig > 310/2) { if (neg) setminfV(o); else setpinfV(o); return fmt; }\r\n    else if (idig < -326/2) { o->n = neg ? -0.0 : 0.0; return fmt; }\r\n\r\n    /* Scale up until we have at least 17 or 18 integer part digits. */\r\n    while (idig < 9 && idig < DLEN(lo, hi)) {\r\n      uint32_t i, cy = 0;\r\n      ex2 -= 6;\r\n      for (i = DPREV(lo); ; i = DPREV(i)) {\r\n\tuint32_t d = (xi[i] << 6) + cy;\r\n\tcy = (((d >> 2) * 5243) >> 17); d = d - cy * 100;  /* Div/mod 100. */\r\n\txi[i] = (uint8_t)d;\r\n\tif (i == hi) break;\r\n\tif (d == 0 && i == DPREV(lo)) lo = i;\r\n      }\r\n      if (cy) {\r\n\thi = DPREV(hi);\r\n\tif (xi[DPREV(lo)] == 0) lo = DPREV(lo);\r\n\telse if (hi == lo) { lo = DPREV(lo); xi[DPREV(lo)] |= xi[lo]; }\r\n\txi[hi] = (uint8_t)cy; idig++;\r\n      }\r\n    }\r\n\r\n    /* Scale down until no more than 17 or 18 integer part digits remain. */\r\n    while (idig > 9) {\r\n      uint32_t i = hi, cy = 0;\r\n      ex2 += 6;\r\n      do {\r\n\tcy += xi[i];\r\n\txi[i] = (cy >> 6);\r\n\tcy = 100 * (cy & 0x3f);\r\n\tif (xi[i] == 0 && i == hi) hi = DNEXT(hi), idig--;\r\n\ti = DNEXT(i);\r\n      } while (i != lo);\r\n      while (cy) {\r\n\tif (hi == lo) { xi[DPREV(lo)] |= 1; break; }\r\n\txi[lo] = (cy >> 6); lo = DNEXT(lo);\r\n\tcy = 100 * (cy & 0x3f);\r\n      }\r\n    }\r\n\r\n    /* Collect integer part digits and convert to rescaled double. */\r\n    {\r\n      uint64_t x = xi[hi];\r\n      uint32_t i;\r\n      for (i = DNEXT(hi); --idig > 0 && i != lo; i = DNEXT(i))\r\n\tx = x * 100 + xi[i];\r\n      if (i == lo) {\r\n\twhile (--idig >= 0) x = x * 100;\r\n      } else {  /* Gather round bit from remaining digits. */\r\n\tx <<= 1; ex2--;\r\n\tdo {\r\n\t  if (xi[i]) { x |= 1; break; }\r\n\t  i = DNEXT(i);\r\n\t} while (i != lo);\r\n      }\r\n      strscan_double(x, o, ex2, neg);\r\n    }\r\n  }\r\n  return fmt;\r\n}\r\n\r\n/* Scan string containing a number. Returns format. Returns value in o. */\r\nStrScanFmt lj_strscan_scan(const uint8_t *p, TValue *o, uint32_t opt)\r\n{\r\n  int32_t neg = 0;\r\n\r\n  /* Remove leading space, parse sign and non-numbers. */\r\n  if (LJ_UNLIKELY(!lj_char_isdigit(*p))) {\r\n    while (lj_char_isspace(*p)) p++;\r\n    if (*p == '+' || *p == '-') neg = (*p++ == '-');\r\n    if (LJ_UNLIKELY(*p >= 'A')) {  /* Parse \"inf\", \"infinity\" or \"nan\". */\r\n      TValue tmp;\r\n      setnanV(&tmp);\r\n      if (casecmp(p[0],'i') && casecmp(p[1],'n') && casecmp(p[2],'f')) {\r\n\tif (neg) setminfV(&tmp); else setpinfV(&tmp);\r\n\tp += 3;\r\n\tif (casecmp(p[0],'i') && casecmp(p[1],'n') && casecmp(p[2],'i') &&\r\n\t    casecmp(p[3],'t') && casecmp(p[4],'y')) p += 5;\r\n      } else if (casecmp(p[0],'n') && casecmp(p[1],'a') && casecmp(p[2],'n')) {\r\n\tp += 3;\r\n      }\r\n      while (lj_char_isspace(*p)) p++;\r\n      if (*p) return STRSCAN_ERROR;\r\n      o->u64 = tmp.u64;\r\n      return STRSCAN_NUM;\r\n    }\r\n  }\r\n\r\n  /* Parse regular number. */\r\n  {\r\n    StrScanFmt fmt = STRSCAN_INT;\r\n    int cmask = LJ_CHAR_DIGIT;\r\n    int base = (opt & STRSCAN_OPT_C) && *p == '0' ? 0 : 10;\r\n    const uint8_t *sp, *dp = NULL;\r\n    uint32_t dig = 0, hasdig = 0, x = 0;\r\n    int32_t ex = 0;\r\n\r\n    /* Determine base and skip leading zeros. */\r\n    if (LJ_UNLIKELY(*p <= '0')) {\r\n      if (*p == '0' && casecmp(p[1], 'x'))\r\n\tbase = 16, cmask = LJ_CHAR_XDIGIT, p += 2;\r\n      for ( ; ; p++) {\r\n\tif (*p == '0') {\r\n\t  hasdig = 1;\r\n\t} else if (*p == '.') {\r\n\t  if (dp) return STRSCAN_ERROR;\r\n\t  dp = p;\r\n\t} else {\r\n\t  break;\r\n\t}\r\n      }\r\n    }\r\n\r\n    /* Preliminary digit and decimal point scan. */\r\n    for (sp = p; ; p++) {\r\n      if (LJ_LIKELY(lj_char_isa(*p, cmask))) {\r\n\tx = x * 10 + (*p & 15);  /* For fast path below. */\r\n\tdig++;\r\n      } else if (*p == '.') {\r\n\tif (dp) return STRSCAN_ERROR;\r\n\tdp = p;\r\n      } else {\r\n\tbreak;\r\n      }\r\n    }\r\n    if (!(hasdig | dig)) return STRSCAN_ERROR;\r\n\r\n    /* Handle decimal point. */\r\n    if (dp) {\r\n      fmt = STRSCAN_NUM;\r\n      if (dig) {\r\n\tex = (int32_t)(dp-(p-1)); dp = p-1;\r\n\twhile (ex < 0 && *dp-- == '0') ex++, dig--;  /* Skip trailing zeros. */\r\n\tif (base == 16) ex *= 4;\r\n      }\r\n    }\r\n\r\n    /* Parse exponent. */\r\n    if (casecmp(*p, (uint32_t)(base == 16 ? 'p' : 'e'))) {\r\n      uint32_t xx;\r\n      int negx = 0;\r\n      fmt = STRSCAN_NUM; p++;\r\n      if (*p == '+' || *p == '-') negx = (*p++ == '-');\r\n      if (!lj_char_isdigit(*p)) return STRSCAN_ERROR;\r\n      xx = (*p++ & 15);\r\n      while (lj_char_isdigit(*p)) {\r\n\tif (xx < 65536) xx = xx * 10 + (*p & 15);\r\n\tp++;\r\n      }\r\n      ex += negx ? -(int32_t)xx : (int32_t)xx;\r\n    }\r\n\r\n    /* Parse suffix. */\r\n    if (*p) {\r\n      /* I (IMAG), U (U32), LL (I64), ULL/LLU (U64), L (long), UL/LU (ulong). */\r\n      /* NYI: f (float). Not needed until cp_number() handles non-integers. */\r\n      if (casecmp(*p, 'i')) {\r\n\tif (!(opt & STRSCAN_OPT_IMAG)) return STRSCAN_ERROR;\r\n\tp++; fmt = STRSCAN_IMAG;\r\n      } else if (fmt == STRSCAN_INT) {\r\n\tif (casecmp(*p, 'u')) p++, fmt = STRSCAN_U32;\r\n\tif (casecmp(*p, 'l')) {\r\n\t  p++;\r\n\t  if (casecmp(*p, 'l')) p++, fmt += STRSCAN_I64 - STRSCAN_INT;\r\n\t  else if (!(opt & STRSCAN_OPT_C)) return STRSCAN_ERROR;\r\n\t  else if (sizeof(long) == 8) fmt += STRSCAN_I64 - STRSCAN_INT;\r\n\t}\r\n\tif (casecmp(*p, 'u') && (fmt == STRSCAN_INT || fmt == STRSCAN_I64))\r\n\t  p++, fmt += STRSCAN_U32 - STRSCAN_INT;\r\n\tif ((fmt == STRSCAN_U32 && !(opt & STRSCAN_OPT_C)) ||\r\n\t    (fmt >= STRSCAN_I64 && !(opt & STRSCAN_OPT_LL)))\r\n\t  return STRSCAN_ERROR;\r\n      }\r\n      while (lj_char_isspace(*p)) p++;\r\n      if (*p) return STRSCAN_ERROR;\r\n    }\r\n\r\n    /* Fast path for decimal 32 bit integers. */\r\n    if (fmt == STRSCAN_INT && base == 10 &&\r\n\t(dig < 10 || (dig == 10 && *sp <= '2' && x < 0x80000000u+neg))) {\r\n      int32_t y = neg ? -(int32_t)x : (int32_t)x;\r\n      if ((opt & STRSCAN_OPT_TONUM)) {\r\n\to->n = (double)y;\r\n\treturn STRSCAN_NUM;\r\n      } else {\r\n\to->i = y;\r\n\treturn STRSCAN_INT;\r\n      }\r\n    }\r\n\r\n    /* Dispatch to base-specific parser. */\r\n    if (base == 0 && !(fmt == STRSCAN_NUM || fmt == STRSCAN_IMAG))\r\n      return strscan_oct(sp, o, fmt, neg, dig);\r\n    if (base == 16)\r\n      fmt = strscan_hex(sp, o, fmt, opt, ex, neg, dig);\r\n    else\r\n      fmt = strscan_dec(sp, o, fmt, opt, ex, neg, dig);\r\n\r\n    /* Try to convert number to integer, if requested. */\r\n    if (fmt == STRSCAN_NUM && (opt & STRSCAN_OPT_TOINT)) {\r\n      double n = o->n;\r\n      int32_t i = lj_num2int(n);\r\n      if (n == (lua_Number)i) { o->i = i; return STRSCAN_INT; }\r\n    }\r\n    return fmt;\r\n  }\r\n}\r\n\r\nint LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o)\r\n{\r\n  StrScanFmt fmt = lj_strscan_scan((const uint8_t *)strdata(str), o,\r\n\t\t\t\t   STRSCAN_OPT_TONUM);\r\n  lua_assert(fmt == STRSCAN_ERROR || fmt == STRSCAN_NUM);\r\n  return (fmt != STRSCAN_ERROR);\r\n}\r\n\r\n#if LJ_DUALNUM\r\nint LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o)\r\n{\r\n  StrScanFmt fmt = lj_strscan_scan((const uint8_t *)strdata(str), o,\r\n\t\t\t\t   STRSCAN_OPT_TOINT);\r\n  lua_assert(fmt == STRSCAN_ERROR || fmt == STRSCAN_NUM || fmt == STRSCAN_INT);\r\n  if (fmt == STRSCAN_INT) setitype(o, LJ_TISNUM);\r\n  return (fmt != STRSCAN_ERROR);\r\n}\r\n#endif\r\n\r\n#undef DNEXT\r\n#undef DPREV\r\n#undef DLEN\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_strscan.h",
    "content": "/*\r\n** String scanning.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STRSCAN_H\r\n#define _LJ_STRSCAN_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Options for accepted/returned formats. */\r\n#define STRSCAN_OPT_TOINT\t0x01  /* Convert to int32_t, if possible. */\r\n#define STRSCAN_OPT_TONUM\t0x02  /* Always convert to double. */\r\n#define STRSCAN_OPT_IMAG\t0x04\r\n#define STRSCAN_OPT_LL\t\t0x08\r\n#define STRSCAN_OPT_C\t\t0x10\r\n\r\n/* Returned format. */\r\ntypedef enum {\r\n  STRSCAN_ERROR,\r\n  STRSCAN_NUM, STRSCAN_IMAG,\r\n  STRSCAN_INT, STRSCAN_U32, STRSCAN_I64, STRSCAN_U64,\r\n} StrScanFmt;\r\n\r\nLJ_FUNC StrScanFmt lj_strscan_scan(const uint8_t *p, TValue *o, uint32_t opt);\r\nLJ_FUNC int LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o);\r\n#if LJ_DUALNUM\r\nLJ_FUNC int LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o);\r\n#else\r\n#define lj_strscan_number(s, o)\t\tlj_strscan_num((s), (o))\r\n#endif\r\n\r\n/* Check for number or convert string to number/int in-place (!). */\r\nstatic LJ_AINLINE int lj_strscan_numberobj(TValue *o)\r\n{\r\n  return tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), o));\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_tab.c",
    "content": "/*\r\n** Table handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_tab_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n\r\n/* -- Object hashing ------------------------------------------------------ */\r\n\r\n/* Hash values are masked with the table hash mask and used as an index. */\r\nstatic LJ_AINLINE Node *hashmask(const GCtab *t, uint32_t hash)\r\n{\r\n  Node *n = noderef(t->node);\r\n  return &n[hash & t->hmask];\r\n}\r\n\r\n/* String hashes are precomputed when they are interned. */\r\n#define hashstr(t, s)\t\thashmask(t, (s)->hash)\r\n\r\n#define hashlohi(t, lo, hi)\thashmask((t), hashrot((lo), (hi)))\r\n#define hashnum(t, o)\t\thashlohi((t), (o)->u32.lo, ((o)->u32.hi << 1))\r\n#define hashptr(t, p)\t\thashlohi((t), u32ptr(p), u32ptr(p) + HASH_BIAS)\r\n#define hashgcref(t, r)\t\thashlohi((t), gcrefu(r), gcrefu(r) + HASH_BIAS)\r\n\r\n/* Hash an arbitrary key and return its anchor position in the hash table. */\r\nstatic Node *hashkey(const GCtab *t, cTValue *key)\r\n{\r\n  lua_assert(!tvisint(key));\r\n  if (tvisstr(key))\r\n    return hashstr(t, strV(key));\r\n  else if (tvisnum(key))\r\n    return hashnum(t, key);\r\n  else if (tvisbool(key))\r\n    return hashmask(t, boolV(key));\r\n  else\r\n    return hashgcref(t, key->gcr);\r\n  /* Only hash 32 bits of lightuserdata on a 64 bit CPU. Good enough? */\r\n}\r\n\r\n/* -- Table creation and destruction -------------------------------------- */\r\n\r\n/* Create new hash part for table. */\r\nstatic LJ_AINLINE void newhpart(lua_State *L, GCtab *t, uint32_t hbits)\r\n{\r\n  uint32_t hsize;\r\n  Node *node;\r\n  lua_assert(hbits != 0);\r\n  if (hbits > LJ_MAX_HBITS)\r\n    lj_err_msg(L, LJ_ERR_TABOV);\r\n  hsize = 1u << hbits;\r\n  node = lj_mem_newvec(L, hsize, Node);\r\n  setmref(node->freetop, &node[hsize]);\r\n  setmref(t->node, node);\r\n  t->hmask = hsize-1;\r\n}\r\n\r\n/*\r\n** Q: Why all of these copies of t->hmask, t->node etc. to local variables?\r\n** A: Because alias analysis for C is _really_ tough.\r\n**    Even state-of-the-art C compilers won't produce good code without this.\r\n*/\r\n\r\n/* Clear hash part of table. */\r\nstatic LJ_AINLINE void clearhpart(GCtab *t)\r\n{\r\n  uint32_t i, hmask = t->hmask;\r\n  Node *node = noderef(t->node);\r\n  lua_assert(t->hmask != 0);\r\n  for (i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    setmref(n->next, NULL);\r\n    setnilV(&n->key);\r\n    setnilV(&n->val);\r\n  }\r\n}\r\n\r\n/* Clear array part of table. */\r\nstatic LJ_AINLINE void clearapart(GCtab *t)\r\n{\r\n  uint32_t i, asize = t->asize;\r\n  TValue *array = tvref(t->array);\r\n  for (i = 0; i < asize; i++)\r\n    setnilV(&array[i]);\r\n}\r\n\r\n/* Create a new table. Note: the slots are not initialized (yet). */\r\nstatic GCtab *newtab(lua_State *L, uint32_t asize, uint32_t hbits)\r\n{\r\n  GCtab *t;\r\n  /* First try to colocate the array part. */\r\n  if (LJ_MAX_COLOSIZE != 0 && asize > 0 && asize <= LJ_MAX_COLOSIZE) {\r\n    lua_assert((sizeof(GCtab) & 7) == 0);\r\n    t = (GCtab *)lj_mem_newgco(L, sizetabcolo(asize));\r\n    t->gct = ~LJ_TTAB;\r\n    t->nomm = (uint8_t)~0;\r\n    t->colo = (int8_t)asize;\r\n    setmref(t->array, (TValue *)((char *)t + sizeof(GCtab)));\r\n    setgcrefnull(t->metatable);\r\n    t->asize = asize;\r\n    t->hmask = 0;\r\n    setmref(t->node, &G(L)->nilnode);\r\n  } else {  /* Otherwise separately allocate the array part. */\r\n    t = lj_mem_newobj(L, GCtab);\r\n    t->gct = ~LJ_TTAB;\r\n    t->nomm = (uint8_t)~0;\r\n    t->colo = 0;\r\n    setmref(t->array, NULL);\r\n    setgcrefnull(t->metatable);\r\n    t->asize = 0;  /* In case the array allocation fails. */\r\n    t->hmask = 0;\r\n    setmref(t->node, &G(L)->nilnode);\r\n    if (asize > 0) {\r\n      if (asize > LJ_MAX_ASIZE)\r\n\tlj_err_msg(L, LJ_ERR_TABOV);\r\n      setmref(t->array, lj_mem_newvec(L, asize, TValue));\r\n      t->asize = asize;\r\n    }\r\n  }\r\n  if (hbits)\r\n    newhpart(L, t, hbits);\r\n  return t;\r\n}\r\n\r\n/* Create a new table.\r\n**\r\n** IMPORTANT NOTE: The API differs from lua_createtable()!\r\n**\r\n** The array size is non-inclusive. E.g. asize=128 creates array slots\r\n** for 0..127, but not for 128. If you need slots 1..128, pass asize=129\r\n** (slot 0 is wasted in this case).\r\n**\r\n** The hash size is given in hash bits. hbits=0 means no hash part.\r\n** hbits=1 creates 2 hash slots, hbits=2 creates 4 hash slots and so on.\r\n*/\r\nGCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits)\r\n{\r\n  GCtab *t = newtab(L, asize, hbits);\r\n  clearapart(t);\r\n  if (t->hmask > 0) clearhpart(t);\r\n  return t;\r\n}\r\n\r\n#if LJ_HASJIT\r\nGCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize)\r\n{\r\n  GCtab *t = newtab(L, ahsize & 0xffffff, ahsize >> 24);\r\n  clearapart(t);\r\n  if (t->hmask > 0) clearhpart(t);\r\n  return t;\r\n}\r\n#endif\r\n\r\n/* Duplicate a table. */\r\nGCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt)\r\n{\r\n  GCtab *t;\r\n  uint32_t asize, hmask;\r\n  t = newtab(L, kt->asize, kt->hmask > 0 ? lj_fls(kt->hmask)+1 : 0);\r\n  lua_assert(kt->asize == t->asize && kt->hmask == t->hmask);\r\n  t->nomm = 0;  /* Keys with metamethod names may be present. */\r\n  asize = kt->asize;\r\n  if (asize > 0) {\r\n    TValue *array = tvref(t->array);\r\n    TValue *karray = tvref(kt->array);\r\n    if (asize < 64) {  /* An inlined loop beats memcpy for < 512 bytes. */\r\n      uint32_t i;\r\n      for (i = 0; i < asize; i++)\r\n\tcopyTV(L, &array[i], &karray[i]);\r\n    } else {\r\n      memcpy(array, karray, asize*sizeof(TValue));\r\n    }\r\n  }\r\n  hmask = kt->hmask;\r\n  if (hmask > 0) {\r\n    uint32_t i;\r\n    Node *node = noderef(t->node);\r\n    Node *knode = noderef(kt->node);\r\n    ptrdiff_t d = (char *)node - (char *)knode;\r\n    setmref(node->freetop, (Node *)((char *)noderef(knode->freetop) + d));\r\n    for (i = 0; i <= hmask; i++) {\r\n      Node *kn = &knode[i];\r\n      Node *n = &node[i];\r\n      Node *next = nextnode(kn);\r\n      /* Don't use copyTV here, since it asserts on a copy of a dead key. */\r\n      n->val = kn->val; n->key = kn->key;\r\n      setmref(n->next, next == NULL? next : (Node *)((char *)next + d));\r\n    }\r\n  }\r\n  return t;\r\n}\r\n\r\n/* Free a table. */\r\nvoid LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t)\r\n{\r\n  if (t->hmask > 0)\r\n    lj_mem_freevec(g, noderef(t->node), t->hmask+1, Node);\r\n  if (t->asize > 0 && LJ_MAX_COLOSIZE != 0 && t->colo <= 0)\r\n    lj_mem_freevec(g, tvref(t->array), t->asize, TValue);\r\n  if (LJ_MAX_COLOSIZE != 0 && t->colo)\r\n    lj_mem_free(g, t, sizetabcolo((uint32_t)t->colo & 0x7f));\r\n  else\r\n    lj_mem_freet(g, t);\r\n}\r\n\r\n/* -- Table resizing ------------------------------------------------------ */\r\n\r\n/* Resize a table to fit the new array/hash part sizes. */\r\nstatic void resizetab(lua_State *L, GCtab *t, uint32_t asize, uint32_t hbits)\r\n{\r\n  Node *oldnode = noderef(t->node);\r\n  uint32_t oldasize = t->asize;\r\n  uint32_t oldhmask = t->hmask;\r\n  if (asize > oldasize) {  /* Array part grows? */\r\n    TValue *array;\r\n    uint32_t i;\r\n    if (asize > LJ_MAX_ASIZE)\r\n      lj_err_msg(L, LJ_ERR_TABOV);\r\n    if (LJ_MAX_COLOSIZE != 0 && t->colo > 0) {\r\n      /* A colocated array must be separated and copied. */\r\n      TValue *oarray = tvref(t->array);\r\n      array = lj_mem_newvec(L, asize, TValue);\r\n      t->colo = (int8_t)(t->colo | 0x80);  /* Mark as separated (colo < 0). */\r\n      for (i = 0; i < oldasize; i++)\r\n\tcopyTV(L, &array[i], &oarray[i]);\r\n    } else {\r\n      array = (TValue *)lj_mem_realloc(L, tvref(t->array),\r\n\t\t\t  oldasize*sizeof(TValue), asize*sizeof(TValue));\r\n    }\r\n    setmref(t->array, array);\r\n    t->asize = asize;\r\n    for (i = oldasize; i < asize; i++)  /* Clear newly allocated slots. */\r\n      setnilV(&array[i]);\r\n  }\r\n  /* Create new (empty) hash part. */\r\n  if (hbits) {\r\n    newhpart(L, t, hbits);\r\n    clearhpart(t);\r\n  } else {\r\n    global_State *g = G(L);\r\n    setmref(t->node, &g->nilnode);\r\n    t->hmask = 0;\r\n  }\r\n  if (asize < oldasize) {  /* Array part shrinks? */\r\n    TValue *array = tvref(t->array);\r\n    uint32_t i;\r\n    t->asize = asize;  /* Note: This 'shrinks' even colocated arrays. */\r\n    for (i = asize; i < oldasize; i++)  /* Reinsert old array values. */\r\n      if (!tvisnil(&array[i]))\r\n\tcopyTV(L, lj_tab_setinth(L, t, (int32_t)i), &array[i]);\r\n    /* Physically shrink only separated arrays. */\r\n    if (LJ_MAX_COLOSIZE != 0 && t->colo <= 0)\r\n      setmref(t->array, lj_mem_realloc(L, array,\r\n\t      oldasize*sizeof(TValue), asize*sizeof(TValue)));\r\n  }\r\n  if (oldhmask > 0) {  /* Reinsert pairs from old hash part. */\r\n    global_State *g;\r\n    uint32_t i;\r\n    for (i = 0; i <= oldhmask; i++) {\r\n      Node *n = &oldnode[i];\r\n      if (!tvisnil(&n->val))\r\n\tcopyTV(L, lj_tab_set(L, t, &n->key), &n->val);\r\n    }\r\n    g = G(L);\r\n    lj_mem_freevec(g, oldnode, oldhmask+1, Node);\r\n  }\r\n}\r\n\r\nstatic uint32_t countint(cTValue *key, uint32_t *bins)\r\n{\r\n  lua_assert(!tvisint(key));\r\n  if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if ((uint32_t)k < LJ_MAX_ASIZE && nk == (lua_Number)k) {\r\n      bins[(k > 2 ? lj_fls((uint32_t)(k-1)) : 0)]++;\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic uint32_t countarray(const GCtab *t, uint32_t *bins)\r\n{\r\n  uint32_t na, b, i;\r\n  if (t->asize == 0) return 0;\r\n  for (na = i = b = 0; b < LJ_MAX_ABITS; b++) {\r\n    uint32_t n, top = 2u << b;\r\n    TValue *array;\r\n    if (top >= t->asize) {\r\n      top = t->asize-1;\r\n      if (i > top)\r\n\tbreak;\r\n    }\r\n    array = tvref(t->array);\r\n    for (n = 0; i <= top; i++)\r\n      if (!tvisnil(&array[i]))\r\n\tn++;\r\n    bins[b] += n;\r\n    na += n;\r\n  }\r\n  return na;\r\n}\r\n\r\nstatic uint32_t counthash(const GCtab *t, uint32_t *bins, uint32_t *narray)\r\n{\r\n  uint32_t total, na, i, hmask = t->hmask;\r\n  Node *node = noderef(t->node);\r\n  for (total = na = 0, i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    if (!tvisnil(&n->val)) {\r\n      na += countint(&n->key, bins);\r\n      total++;\r\n    }\r\n  }\r\n  *narray += na;\r\n  return total;\r\n}\r\n\r\nstatic uint32_t bestasize(uint32_t bins[], uint32_t *narray)\r\n{\r\n  uint32_t b, sum, na = 0, sz = 0, nn = *narray;\r\n  for (b = 0, sum = 0; 2*nn > (1u<<b) && sum != nn; b++)\r\n    if (bins[b] > 0 && 2*(sum += bins[b]) > (1u<<b)) {\r\n      sz = (2u<<b)+1;\r\n      na = sum;\r\n    }\r\n  *narray = sz;\r\n  return na;\r\n}\r\n\r\nstatic void rehashtab(lua_State *L, GCtab *t, cTValue *ek)\r\n{\r\n  uint32_t bins[LJ_MAX_ABITS];\r\n  uint32_t total, asize, na, i;\r\n  for (i = 0; i < LJ_MAX_ABITS; i++) bins[i] = 0;\r\n  asize = countarray(t, bins);\r\n  total = 1 + asize;\r\n  total += counthash(t, bins, &asize);\r\n  asize += countint(ek, bins);\r\n  na = bestasize(bins, &asize);\r\n  total -= na;\r\n  resizetab(L, t, asize, hsize2hbits(total));\r\n}\r\n\r\n#if LJ_HASFFI\r\nvoid lj_tab_rehash(lua_State *L, GCtab *t)\r\n{\r\n  rehashtab(L, t, niltv(L));\r\n}\r\n#endif\r\n\r\nvoid lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize)\r\n{\r\n  resizetab(L, t, nasize+1, t->hmask > 0 ? lj_fls(t->hmask)+1 : 0);\r\n}\r\n\r\n/* -- Table getters ------------------------------------------------------- */\r\n\r\ncTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key)\r\n{\r\n  TValue k;\r\n  Node *n;\r\n  k.n = (lua_Number)key;\r\n  n = hashnum(t, &k);\r\n  do {\r\n    if (tvisnum(&n->key) && n->key.n == k.n)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return NULL;\r\n}\r\n\r\ncTValue *lj_tab_getstr(GCtab *t, GCstr *key)\r\n{\r\n  Node *n = hashstr(t, key);\r\n  do {\r\n    if (tvisstr(&n->key) && strV(&n->key) == key)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return NULL;\r\n}\r\n\r\ncTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  if (tvisstr(key)) {\r\n    cTValue *tv = lj_tab_getstr(t, strV(key));\r\n    if (tv)\r\n      return tv;\r\n  } else if (tvisint(key)) {\r\n    cTValue *tv = lj_tab_getint(t, intV(key));\r\n    if (tv)\r\n      return tv;\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if (nk == (lua_Number)k) {\r\n      cTValue *tv = lj_tab_getint(t, k);\r\n      if (tv)\r\n\treturn tv;\r\n    } else {\r\n      goto genlookup;  /* Else use the generic lookup. */\r\n    }\r\n  } else if (!tvisnil(key)) {\r\n    Node *n;\r\n  genlookup:\r\n    n = hashkey(t, key);\r\n    do {\r\n      if (lj_obj_equal(&n->key, key))\r\n\treturn &n->val;\r\n    } while ((n = nextnode(n)));\r\n  }\r\n  return niltv(L);\r\n}\r\n\r\n/* -- Table setters ------------------------------------------------------- */\r\n\r\n/* Insert new key. Use Brent's variation to optimize the chain length. */\r\nTValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  Node *n = hashkey(t, key);\r\n  if (!tvisnil(&n->val) || t->hmask == 0) {\r\n    Node *nodebase = noderef(t->node);\r\n    Node *collide, *freenode = noderef(nodebase->freetop);\r\n    lua_assert(freenode >= nodebase && freenode <= nodebase+t->hmask+1);\r\n    do {\r\n      if (freenode == nodebase) {  /* No free node found? */\r\n\trehashtab(L, t, key);  /* Rehash table. */\r\n\treturn lj_tab_set(L, t, key);  /* Retry key insertion. */\r\n      }\r\n    } while (!tvisnil(&(--freenode)->key));\r\n    setmref(nodebase->freetop, freenode);\r\n    lua_assert(freenode != &G(L)->nilnode);\r\n    collide = hashkey(t, &n->key);\r\n    if (collide != n) {  /* Colliding node not the main node? */\r\n      while (noderef(collide->next) != n)  /* Find predecessor. */\r\n\tcollide = nextnode(collide);\r\n      setmref(collide->next, freenode);  /* Relink chain. */\r\n      /* Copy colliding node into free node and free main node. */\r\n      freenode->val = n->val;\r\n      freenode->key = n->key;\r\n      freenode->next = n->next;\r\n      setmref(n->next, NULL);\r\n      setnilV(&n->val);\r\n      /* Rechain pseudo-resurrected string keys with colliding hashes. */\r\n      while (nextnode(freenode)) {\r\n\tNode *nn = nextnode(freenode);\r\n\tif (tvisstr(&nn->key) && !tvisnil(&nn->val) &&\r\n\t    hashstr(t, strV(&nn->key)) == n) {\r\n\t  freenode->next = nn->next;\r\n\t  nn->next = n->next;\r\n\t  setmref(n->next, nn);\r\n\t} else {\r\n\t  freenode = nn;\r\n\t}\r\n      }\r\n    } else {  /* Otherwise use free node. */\r\n      setmrefr(freenode->next, n->next);  /* Insert into chain. */\r\n      setmref(n->next, freenode);\r\n      n = freenode;\r\n    }\r\n  }\r\n  n->key.u64 = key->u64;\r\n  if (LJ_UNLIKELY(tvismzero(&n->key)))\r\n    n->key.u64 = 0;\r\n  lj_gc_anybarriert(L, t);\r\n  lua_assert(tvisnil(&n->val));\r\n  return &n->val;\r\n}\r\n\r\nTValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key)\r\n{\r\n  TValue k;\r\n  Node *n;\r\n  k.n = (lua_Number)key;\r\n  n = hashnum(t, &k);\r\n  do {\r\n    if (tvisnum(&n->key) && n->key.n == k.n)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return lj_tab_newkey(L, t, &k);\r\n}\r\n\r\nTValue *lj_tab_setstr(lua_State *L, GCtab *t, GCstr *key)\r\n{\r\n  TValue k;\r\n  Node *n = hashstr(t, key);\r\n  do {\r\n    if (tvisstr(&n->key) && strV(&n->key) == key)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  setstrV(L, &k, key);\r\n  return lj_tab_newkey(L, t, &k);\r\n}\r\n\r\nTValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  Node *n;\r\n  t->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n  if (tvisstr(key)) {\r\n    return lj_tab_setstr(L, t, strV(key));\r\n  } else if (tvisint(key)) {\r\n    return lj_tab_setint(L, t, intV(key));\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if (nk == (lua_Number)k)\r\n      return lj_tab_setint(L, t, k);\r\n    if (tvisnan(key))\r\n      lj_err_msg(L, LJ_ERR_NANIDX);\r\n    /* Else use the generic lookup. */\r\n  } else if (tvisnil(key)) {\r\n    lj_err_msg(L, LJ_ERR_NILIDX);\r\n  }\r\n  n = hashkey(t, key);\r\n  do {\r\n    if (lj_obj_equal(&n->key, key))\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return lj_tab_newkey(L, t, key);\r\n}\r\n\r\n/* -- Table traversal ----------------------------------------------------- */\r\n\r\n/* Get the traversal index of a key. */\r\nstatic uint32_t keyindex(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  TValue tmp;\r\n  if (tvisint(key)) {\r\n    int32_t k = intV(key);\r\n    if ((uint32_t)k < t->asize)\r\n      return (uint32_t)k;  /* Array key indexes: [0..t->asize-1] */\r\n    setnumV(&tmp, (lua_Number)k);\r\n    key = &tmp;\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if ((uint32_t)k < t->asize && nk == (lua_Number)k)\r\n      return (uint32_t)k;  /* Array key indexes: [0..t->asize-1] */\r\n  }\r\n  if (!tvisnil(key)) {\r\n    Node *n = hashkey(t, key);\r\n    do {\r\n      if (lj_obj_equal(&n->key, key))\r\n\treturn t->asize + (uint32_t)(n - noderef(t->node));\r\n\t/* Hash key indexes: [t->asize..t->asize+t->nmask] */\r\n    } while ((n = nextnode(n)));\r\n    if (key->u32.hi == 0xfffe7fff)  /* ITERN was despecialized while running. */\r\n      return key->u32.lo - 1;\r\n    lj_err_msg(L, LJ_ERR_NEXTIDX);\r\n    return 0;  /* unreachable */\r\n  }\r\n  return ~0u;  /* A nil key starts the traversal. */\r\n}\r\n\r\n/* Advance to the next step in a table traversal. */\r\nint lj_tab_next(lua_State *L, GCtab *t, TValue *key)\r\n{\r\n  uint32_t i = keyindex(L, t, key);  /* Find predecessor key index. */\r\n  for (i++; i < t->asize; i++)  /* First traverse the array keys. */\r\n    if (!tvisnil(arrayslot(t, i))) {\r\n      setintV(key, i);\r\n      copyTV(L, key+1, arrayslot(t, i));\r\n      return 1;\r\n    }\r\n  for (i -= t->asize; i <= t->hmask; i++) {  /* Then traverse the hash keys. */\r\n    Node *n = &noderef(t->node)[i];\r\n    if (!tvisnil(&n->val)) {\r\n      copyTV(L, key, &n->key);\r\n      copyTV(L, key+1, &n->val);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* End of traversal. */\r\n}\r\n\r\n/* -- Table length calculation -------------------------------------------- */\r\n\r\nstatic MSize unbound_search(GCtab *t, MSize j)\r\n{\r\n  cTValue *tv;\r\n  MSize i = j;  /* i is zero or a present index */\r\n  j++;\r\n  /* find `i' and `j' such that i is present and j is not */\r\n  while ((tv = lj_tab_getint(t, (int32_t)j)) && !tvisnil(tv)) {\r\n    i = j;\r\n    j *= 2;\r\n    if (j > (MSize)(INT_MAX-2)) {  /* overflow? */\r\n      /* table was built with bad purposes: resort to linear search */\r\n      i = 1;\r\n      while ((tv = lj_tab_getint(t, (int32_t)i)) && !tvisnil(tv)) i++;\r\n      return i - 1;\r\n    }\r\n  }\r\n  /* now do a binary search between them */\r\n  while (j - i > 1) {\r\n    MSize m = (i+j)/2;\r\n    cTValue *tvb = lj_tab_getint(t, (int32_t)m);\r\n    if (tvb && !tvisnil(tvb)) i = m; else j = m;\r\n  }\r\n  return i;\r\n}\r\n\r\n/*\r\n** Try to find a boundary in table `t'. A `boundary' is an integer index\r\n** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).\r\n*/\r\nMSize LJ_FASTCALL lj_tab_len(GCtab *t)\r\n{\r\n  MSize j = (MSize)t->asize;\r\n  if (j > 1 && tvisnil(arrayslot(t, j-1))) {\r\n    MSize i = 1;\r\n    while (j - i > 1) {\r\n      MSize m = (i+j)/2;\r\n      if (tvisnil(arrayslot(t, m-1))) j = m; else i = m;\r\n    }\r\n    return i-1;\r\n  }\r\n  if (j) j--;\r\n  if (t->hmask <= 0)\r\n    return j;\r\n  return unbound_search(t, j);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_tab.h",
    "content": "/*\r\n** Table handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TAB_H\r\n#define _LJ_TAB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Hash constants. Tuned using a brute force search. */\r\n#define HASH_BIAS\t(-0x04c11db7)\r\n#define HASH_ROT1\t14\r\n#define HASH_ROT2\t5\r\n#define HASH_ROT3\t13\r\n\r\n/* Scramble the bits of numbers and pointers. */\r\nstatic LJ_AINLINE uint32_t hashrot(uint32_t lo, uint32_t hi)\r\n{\r\n#if LJ_TARGET_X86ORX64\r\n  /* Prefer variant that compiles well for a 2-operand CPU. */\r\n  lo ^= hi; hi = lj_rol(hi, HASH_ROT1);\r\n  lo -= hi; hi = lj_rol(hi, HASH_ROT2);\r\n  hi ^= lo; hi -= lj_rol(lo, HASH_ROT3);\r\n#else\r\n  lo ^= hi;\r\n  lo = lo - lj_rol(hi, HASH_ROT1);\r\n  hi = lo ^ lj_rol(hi, HASH_ROT1 + HASH_ROT2);\r\n  hi = hi - lj_rol(lo, HASH_ROT3);\r\n#endif\r\n  return hi;\r\n}\r\n\r\n#define hsize2hbits(s)\t((s) ? ((s)==1 ? 1 : 1+lj_fls((uint32_t)((s)-1))) : 0)\r\n\r\nLJ_FUNCA GCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits);\r\n#if LJ_HASJIT\r\nLJ_FUNC GCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize);\r\n#endif\r\nLJ_FUNCA GCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt);\r\nLJ_FUNC void LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_tab_rehash(lua_State *L, GCtab *t);\r\n#endif\r\nLJ_FUNCA void lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize);\r\n\r\n/* Caveat: all getters except lj_tab_get() can return NULL! */\r\n\r\nLJ_FUNCA cTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key);\r\nLJ_FUNC cTValue *lj_tab_getstr(GCtab *t, GCstr *key);\r\nLJ_FUNCA cTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key);\r\n\r\n/* Caveat: all setters require a write barrier for the stored value. */\r\n\r\nLJ_FUNCA TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key);\r\nLJ_FUNC TValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key);\r\nLJ_FUNC TValue *lj_tab_setstr(lua_State *L, GCtab *t, GCstr *key);\r\nLJ_FUNC TValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key);\r\n\r\n#define inarray(t, key)\t\t((MSize)(key) < (MSize)(t)->asize)\r\n#define arrayslot(t, i)\t\t(&tvref((t)->array)[(i)])\r\n#define lj_tab_getint(t, key) \\\r\n  (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_getinth((t), (key)))\r\n#define lj_tab_setint(L, t, key) \\\r\n  (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_setinth(L, (t), (key)))\r\n\r\nLJ_FUNCA int lj_tab_next(lua_State *L, GCtab *t, TValue *key);\r\nLJ_FUNCA MSize LJ_FASTCALL lj_tab_len(GCtab *t);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_target.h",
    "content": "/*\r\n** Definitions for target CPU.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_H\r\n#define _LJ_TARGET_H\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* -- Registers and spill slots ------------------------------------------- */\r\n\r\n/* Register type (uint8_t in ir->r). */\r\ntypedef uint32_t Reg;\r\n\r\n/* The hi-bit is NOT set for an allocated register. This means the value\r\n** can be directly used without masking. The hi-bit is set for a register\r\n** allocation hint or for RID_INIT, RID_SINK or RID_SUNK.\r\n*/\r\n#define RID_NONE\t\t0x80\r\n#define RID_MASK\t\t0x7f\r\n#define RID_INIT\t\t(RID_NONE|RID_MASK)\r\n#define RID_SINK\t\t(RID_INIT-1)\r\n#define RID_SUNK\t\t(RID_INIT-2)\r\n\r\n#define ra_noreg(r)\t\t((r) & RID_NONE)\r\n#define ra_hasreg(r)\t\t(!((r) & RID_NONE))\r\n\r\n/* The ra_hashint() macro assumes a previous test for ra_noreg(). */\r\n#define ra_hashint(r)\t\t((r) < RID_SUNK)\r\n#define ra_gethint(r)\t\t((Reg)((r) & RID_MASK))\r\n#define ra_sethint(rr, r)\trr = (uint8_t)((r)|RID_NONE)\r\n#define ra_samehint(r1, r2)\t(ra_gethint((r1)^(r2)) == 0)\r\n\r\n/* Spill slot 0 means no spill slot has been allocated. */\r\n#define SPS_NONE\t\t0\r\n\r\n#define ra_hasspill(s)\t\t((s) != SPS_NONE)\r\n\r\n/* Combined register and spill slot (uint16_t in ir->prev). */\r\ntypedef uint32_t RegSP;\r\n\r\n#define REGSP(r, s)\t\t((r) + ((s) << 8))\r\n#define REGSP_HINT(r)\t\t((r)|RID_NONE)\r\n#define REGSP_INIT\t\tREGSP(RID_INIT, 0)\r\n\r\n#define regsp_reg(rs)\t\t((rs) & 255)\r\n#define regsp_spill(rs)\t\t((rs) >> 8)\r\n#define regsp_used(rs) \\\r\n  (((rs) & ~REGSP(RID_MASK, 0)) != REGSP(RID_NONE, 0))\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Bitset for registers. 32 registers suffice for most architectures.\r\n** Note that one set holds bits for both GPRs and FPRs.\r\n*/\r\n#if LJ_TARGET_PPC || LJ_TARGET_MIPS\r\ntypedef uint64_t RegSet;\r\n#else\r\ntypedef uint32_t RegSet;\r\n#endif\r\n\r\n#define RID2RSET(r)\t\t(((RegSet)1) << (r))\r\n#define RSET_EMPTY\t\t((RegSet)0)\r\n#define RSET_RANGE(lo, hi)\t((RID2RSET((hi)-(lo))-1) << (lo))\r\n\r\n#define rset_test(rs, r)\t((int)((rs) >> (r)) & 1)\r\n#define rset_set(rs, r)\t\t(rs |= RID2RSET(r))\r\n#define rset_clear(rs, r)\t(rs &= ~RID2RSET(r))\r\n#define rset_exclude(rs, r)\t(rs & ~RID2RSET(r))\r\n#if LJ_TARGET_PPC || LJ_TARGET_MIPS\r\n#define rset_picktop(rs)\t((Reg)(__builtin_clzll(rs)^63))\r\n#define rset_pickbot(rs)\t((Reg)__builtin_ctzll(rs))\r\n#else\r\n#define rset_picktop(rs)\t((Reg)lj_fls(rs))\r\n#define rset_pickbot(rs)\t((Reg)lj_ffs(rs))\r\n#endif\r\n\r\n/* -- Register allocation cost -------------------------------------------- */\r\n\r\n/* The register allocation heuristic keeps track of the cost for allocating\r\n** a specific register:\r\n**\r\n** A free register (obviously) has a cost of 0 and a 1-bit in the free mask.\r\n**\r\n** An already allocated register has the (non-zero) IR reference in the lowest\r\n** bits and the result of a blended cost-model in the higher bits.\r\n**\r\n** The allocator first checks the free mask for a hit. Otherwise an (unrolled)\r\n** linear search for the minimum cost is used. The search doesn't need to\r\n** keep track of the position of the minimum, which makes it very fast.\r\n** The lowest bits of the minimum cost show the desired IR reference whose\r\n** register is the one to evict.\r\n**\r\n** Without the cost-model this degenerates to the standard heuristics for\r\n** (reverse) linear-scan register allocation. Since code generation is done\r\n** in reverse, a live interval extends from the last use to the first def.\r\n** For an SSA IR the IR reference is the first (and only) def and thus\r\n** trivially marks the end of the interval. The LSRA heuristics says to pick\r\n** the register whose live interval has the furthest extent, i.e. the lowest\r\n** IR reference in our case.\r\n**\r\n** A cost-model should take into account other factors, like spill-cost and\r\n** restore- or rematerialization-cost, which depend on the kind of instruction.\r\n** E.g. constants have zero spill costs, variant instructions have higher\r\n** costs than invariants and PHIs should preferably never be spilled.\r\n**\r\n** Here's a first cut at simple, but effective blended cost-model for R-LSRA:\r\n** - Due to careful design of the IR, constants already have lower IR\r\n**   references than invariants and invariants have lower IR references\r\n**   than variants.\r\n** - The cost in the upper 16 bits is the sum of the IR reference and a\r\n**   weighted score. The score currently only takes into account whether\r\n**   the IRT_ISPHI bit is set in the instruction type.\r\n** - The PHI weight is the minimum distance (in IR instructions) a PHI\r\n**   reference has to be further apart from a non-PHI reference to be spilled.\r\n** - It should be a power of two (for speed) and must be between 2 and 32768.\r\n**   Good values for the PHI weight seem to be between 40 and 150.\r\n** - Further study is required.\r\n*/\r\n#define REGCOST_PHI_WEIGHT\t64\r\n\r\n/* Cost for allocating a specific register. */\r\ntypedef uint32_t RegCost;\r\n\r\n/* Note: assumes 16 bit IRRef1. */\r\n#define REGCOST(cost, ref)\t((RegCost)(ref) + ((RegCost)(cost) << 16))\r\n#define regcost_ref(rc)\t\t((IRRef1)(rc))\r\n\r\n#define REGCOST_T(t) \\\r\n  ((RegCost)((t)&IRT_ISPHI) * (((RegCost)(REGCOST_PHI_WEIGHT)<<16)/IRT_ISPHI))\r\n#define REGCOST_REF_T(ref, t)\t(REGCOST((ref), (ref)) + REGCOST_T((t)))\r\n\r\n/* -- Target-specific definitions ----------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_target_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_target_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_target_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_target_mips.h\"\r\n#else\r\n#error \"Missing include for target CPU\"\r\n#endif\r\n\r\n#ifdef EXITSTUBS_PER_GROUP\r\n/* Return the address of an exit stub. */\r\nstatic LJ_AINLINE char *exitstub_addr_(char **group, uint32_t exitno)\r\n{\r\n  lua_assert(group[exitno / EXITSTUBS_PER_GROUP] != NULL);\r\n  return (char *)group[exitno / EXITSTUBS_PER_GROUP] +\r\n\t EXITSTUB_SPACING*(exitno % EXITSTUBS_PER_GROUP);\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_addr(J, exitno) \\\r\n  ((MCode *)exitstub_addr_((char **)((J)->exitstubgroup), (exitno)))\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_target_arm.h",
    "content": "/*\r\n** Definitions for ARM CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_ARM_H\r\n#define _LJ_TARGET_ARM_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(R1) _(R2) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(SP) _(LR) _(PC)\r\n#if LJ_SOFTFP\r\n#define FPRDEF(_)\r\n#else\r\n#define FPRDEF(_) \\\r\n  _(D0) _(D1) _(D2) _(D3) _(D4) _(D5) _(D6) _(D7) \\\r\n  _(D8) _(D9) _(D10) _(D11) _(D12) _(D13) _(D14) _(D15)\r\n#endif\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_TMP = RID_LR,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R0,\r\n  RID_RETLO = RID_R0,\r\n  RID_RETHI = RID_R1,\r\n#if LJ_SOFTFP\r\n  RID_FPRET = RID_R0,\r\n#else\r\n  RID_FPRET = RID_D0,\r\n#endif\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R9,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R6,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R7,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R8,\t\t/* Interpreter L. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_PC+1,\r\n  RID_MIN_FPR = RID_MAX_GPR,\r\n#if LJ_SOFTFP\r\n  RID_MAX_FPR = RID_MIN_FPR,\r\n#else\r\n  RID_MAX_FPR = RID_D15+1,\r\n#endif\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except sp, lr and pc. */\r\n#define RSET_GPR\t\t(RSET_RANGE(RID_MIN_GPR, RID_R12+1))\r\n#define RSET_GPREVEN \\\r\n  (RID2RSET(RID_R0)|RID2RSET(RID_R2)|RID2RSET(RID_R4)|RID2RSET(RID_R6)| \\\r\n   RID2RSET(RID_R8)|RID2RSET(RID_R10))\r\n#define RSET_GPRODD \\\r\n  (RID2RSET(RID_R1)|RID2RSET(RID_R3)|RID2RSET(RID_R5)|RID2RSET(RID_R7)| \\\r\n   RID2RSET(RID_R9)|RID2RSET(RID_R11))\r\n#if LJ_SOFTFP\r\n#define RSET_FPR\t\t0\r\n#else\r\n#define RSET_FPR\t\t(RSET_RANGE(RID_MIN_FPR, RID_MAX_FPR))\r\n#endif\r\n#define RSET_ALL\t\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\t\tRSET_ALL\r\n\r\n/* ABI-specific register sets. lr is an implicit scratch register. */\r\n#define RSET_SCRATCH_GPR_\t(RSET_RANGE(RID_R0, RID_R3+1)|RID2RSET(RID_R12))\r\n#ifdef __APPLE__\r\n#define RSET_SCRATCH_GPR\t(RSET_SCRATCH_GPR_|RID2RSET(RID_R9))\r\n#else\r\n#define RSET_SCRATCH_GPR\tRSET_SCRATCH_GPR_\r\n#endif\r\n#if LJ_SOFTFP\r\n#define RSET_SCRATCH_FPR\t0\r\n#else\r\n#define RSET_SCRATCH_FPR\t(RSET_RANGE(RID_D0, RID_D7+1))\r\n#endif\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R0\r\n#define REGARG_LASTGPR\t\tRID_R3\r\n#define REGARG_NUMGPR\t\t4\r\n#if LJ_ABI_SOFTFP\r\n#define REGARG_FIRSTFPR\t\t0\r\n#define REGARG_LASTFPR\t\t0\r\n#define REGARG_NUMFPR\t\t0\r\n#else\r\n#define REGARG_FIRSTFPR\t\tRID_D0\r\n#define REGARG_LASTFPR\t\tRID_D7\r\n#define REGARG_NUMFPR\t\t8\r\n#endif\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use. Reserve min. two 32 bit slots.\r\n*/\r\n#define SPS_FIXED\t2\r\n#define SPS_FIRST\t2\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 1) & ~1)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n#if !LJ_SOFTFP\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n#endif\r\n  int32_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* PC after instruction that caused an exit. Used to find the trace number. */\r\n#define EXITSTATE_PCREG\t\tRID_PC\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n#define EXITSTUB_SPACING        4\r\n#define EXITSTUBS_PER_GROUP     32\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define ARMF_CC(ai, cc)\t(((ai) ^ ARMI_CCAL) | ((cc) << 28))\r\n#define ARMF_N(r)\t((r) << 16)\r\n#define ARMF_D(r)\t((r) << 12)\r\n#define ARMF_S(r)\t((r) << 8)\r\n#define ARMF_M(r)\t(r)\r\n#define ARMF_SH(sh, n)\t(((sh) << 5) | ((n) << 7))\r\n#define ARMF_RSH(sh, r)\t(0x10 | ((sh) << 5) | ARMF_S(r))\r\n\r\ntypedef enum ARMIns {\r\n  ARMI_CCAL = 0xe0000000,\r\n  ARMI_S = 0x000100000,\r\n  ARMI_K12 = 0x02000000,\r\n  ARMI_KNEG = 0x00200000,\r\n  ARMI_LS_W = 0x00200000,\r\n  ARMI_LS_U = 0x00800000,\r\n  ARMI_LS_P = 0x01000000,\r\n  ARMI_LS_R = 0x02000000,\r\n  ARMI_LSX_I = 0x00400000,\r\n\r\n  ARMI_AND = 0xe0000000,\r\n  ARMI_EOR = 0xe0200000,\r\n  ARMI_SUB = 0xe0400000,\r\n  ARMI_RSB = 0xe0600000,\r\n  ARMI_ADD = 0xe0800000,\r\n  ARMI_ADC = 0xe0a00000,\r\n  ARMI_SBC = 0xe0c00000,\r\n  ARMI_RSC = 0xe0e00000,\r\n  ARMI_TST = 0xe1100000,\r\n  ARMI_TEQ = 0xe1300000,\r\n  ARMI_CMP = 0xe1500000,\r\n  ARMI_CMN = 0xe1700000,\r\n  ARMI_ORR = 0xe1800000,\r\n  ARMI_MOV = 0xe1a00000,\r\n  ARMI_BIC = 0xe1c00000,\r\n  ARMI_MVN = 0xe1e00000,\r\n\r\n  ARMI_NOP = 0xe1a00000,\r\n\r\n  ARMI_MUL = 0xe0000090,\r\n  ARMI_SMULL = 0xe0c00090,\r\n\r\n  ARMI_LDR = 0xe4100000,\r\n  ARMI_LDRB = 0xe4500000,\r\n  ARMI_LDRH = 0xe01000b0,\r\n  ARMI_LDRSB = 0xe01000d0,\r\n  ARMI_LDRSH = 0xe01000f0,\r\n  ARMI_LDRD = 0xe00000d0,\r\n  ARMI_STR = 0xe4000000,\r\n  ARMI_STRB = 0xe4400000,\r\n  ARMI_STRH = 0xe00000b0,\r\n  ARMI_STRD = 0xe00000f0,\r\n  ARMI_PUSH = 0xe92d0000,\r\n\r\n  ARMI_B = 0xea000000,\r\n  ARMI_BL = 0xeb000000,\r\n  ARMI_BLX = 0xfa000000,\r\n  ARMI_BLXr = 0xe12fff30,\r\n\r\n  /* ARMv6 */\r\n  ARMI_REV = 0xe6bf0f30,\r\n  ARMI_SXTB = 0xe6af0070,\r\n  ARMI_SXTH = 0xe6bf0070,\r\n  ARMI_UXTB = 0xe6ef0070,\r\n  ARMI_UXTH = 0xe6ff0070,\r\n\r\n  /* ARMv6T2 */\r\n  ARMI_MOVW = 0xe3000000,\r\n  ARMI_MOVT = 0xe3400000,\r\n\r\n  /* VFP */\r\n  ARMI_VMOV_D = 0xeeb00b40,\r\n  ARMI_VMOV_S = 0xeeb00a40,\r\n  ARMI_VMOVI_D = 0xeeb00b00,\r\n\r\n  ARMI_VMOV_R_S = 0xee100a10,\r\n  ARMI_VMOV_S_R = 0xee000a10,\r\n  ARMI_VMOV_RR_D = 0xec500b10,\r\n  ARMI_VMOV_D_RR = 0xec400b10,\r\n\r\n  ARMI_VADD_D = 0xee300b00,\r\n  ARMI_VSUB_D = 0xee300b40,\r\n  ARMI_VMUL_D = 0xee200b00,\r\n  ARMI_VMLA_D = 0xee000b00,\r\n  ARMI_VMLS_D = 0xee000b40,\r\n  ARMI_VNMLS_D = 0xee100b00,\r\n  ARMI_VDIV_D = 0xee800b00,\r\n\r\n  ARMI_VABS_D = 0xeeb00bc0,\r\n  ARMI_VNEG_D = 0xeeb10b40,\r\n  ARMI_VSQRT_D = 0xeeb10bc0,\r\n\r\n  ARMI_VCMP_D = 0xeeb40b40,\r\n  ARMI_VCMPZ_D = 0xeeb50b40,\r\n\r\n  ARMI_VMRS = 0xeef1fa10,\r\n\r\n  ARMI_VCVT_S32_F32 = 0xeebd0ac0,\r\n  ARMI_VCVT_S32_F64 = 0xeebd0bc0,\r\n  ARMI_VCVT_U32_F32 = 0xeebc0ac0,\r\n  ARMI_VCVT_U32_F64 = 0xeebc0bc0,\r\n  ARMI_VCVTR_S32_F32 = 0xeebd0a40,\r\n  ARMI_VCVTR_S32_F64 = 0xeebd0b40,\r\n  ARMI_VCVTR_U32_F32 = 0xeebc0a40,\r\n  ARMI_VCVTR_U32_F64 = 0xeebc0b40,\r\n  ARMI_VCVT_F32_S32 = 0xeeb80ac0,\r\n  ARMI_VCVT_F64_S32 = 0xeeb80bc0,\r\n  ARMI_VCVT_F32_U32 = 0xeeb80a40,\r\n  ARMI_VCVT_F64_U32 = 0xeeb80b40,\r\n  ARMI_VCVT_F32_F64 = 0xeeb70bc0,\r\n  ARMI_VCVT_F64_F32 = 0xeeb70ac0,\r\n\r\n  ARMI_VLDR_S = 0xed100a00,\r\n  ARMI_VLDR_D = 0xed100b00,\r\n  ARMI_VSTR_S = 0xed000a00,\r\n  ARMI_VSTR_D = 0xed000b00,\r\n} ARMIns;\r\n\r\ntypedef enum ARMShift {\r\n  ARMSH_LSL, ARMSH_LSR, ARMSH_ASR, ARMSH_ROR\r\n} ARMShift;\r\n\r\n/* ARM condition codes. */\r\ntypedef enum ARMCC {\r\n  CC_EQ, CC_NE, CC_CS, CC_CC, CC_MI, CC_PL, CC_VS, CC_VC,\r\n  CC_HI, CC_LS, CC_GE, CC_LT, CC_GT, CC_LE, CC_AL,\r\n  CC_HS = CC_CS, CC_LO = CC_CC\r\n} ARMCC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_target_mips.h",
    "content": "/*\r\n** Definitions for MIPS CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_MIPS_H\r\n#define _LJ_TARGET_MIPS_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(R1) _(R2) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(R13) _(R14) _(R15) \\\r\n  _(R16) _(R17) _(R18) _(R19) _(R20) _(R21) _(R22) _(R23) \\\r\n  _(R24) _(R25) _(SYS1) _(SYS2) _(R28) _(SP) _(R30) _(RA)\r\n#define FPRDEF(_) \\\r\n  _(F0) _(F1) _(F2) _(F3) _(F4) _(F5) _(F6) _(F7) \\\r\n  _(F8) _(F9) _(F10) _(F11) _(F12) _(F13) _(F14) _(F15) \\\r\n  _(F16) _(F17) _(F18) _(F19) _(F20) _(F21) _(F22) _(F23) \\\r\n  _(F24) _(F25) _(F26) _(F27) _(F28) _(F29) _(F30) _(F31)\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_ZERO = RID_R0,\r\n  RID_TMP = RID_RA,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R2,\r\n#if LJ_LE\r\n  RID_RETHI = RID_R3,\r\n  RID_RETLO = RID_R2,\r\n#else\r\n  RID_RETHI = RID_R2,\r\n  RID_RETLO = RID_R3,\r\n#endif\r\n  RID_FPRET = RID_F0,\r\n  RID_CFUNCADDR = RID_R25,\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R16,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R18,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R19,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R20,\t\t/* Interpreter L. */\r\n  RID_JGL = RID_R30,\t\t/* On-trace: global_State + 32768. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_RA+1,\r\n  RID_MIN_FPR = RID_F0,\r\n  RID_MAX_FPR = RID_F31+1,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\t/* Only even regs are used. */\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except ZERO, TMP, SP, SYS1, SYS2 and JGL. */\r\n#define RSET_FIXED \\\r\n  (RID2RSET(RID_ZERO)|RID2RSET(RID_TMP)|RID2RSET(RID_SP)|\\\r\n   RID2RSET(RID_SYS1)|RID2RSET(RID_SYS2)|RID2RSET(RID_JGL))\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR) - RSET_FIXED)\r\n#define RSET_FPR \\\r\n  (RID2RSET(RID_F0)|RID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(RID_F6)|\\\r\n   RID2RSET(RID_F8)|RID2RSET(RID_F10)|RID2RSET(RID_F12)|RID2RSET(RID_F14)|\\\r\n   RID2RSET(RID_F16)|RID2RSET(RID_F18)|RID2RSET(RID_F20)|RID2RSET(RID_F22)|\\\r\n   RID2RSET(RID_F24)|RID2RSET(RID_F26)|RID2RSET(RID_F28)|RID2RSET(RID_F30))\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#define RSET_SCRATCH_GPR \\\r\n  (RSET_RANGE(RID_R1, RID_R15+1)|\\\r\n   RID2RSET(RID_R24)|RID2RSET(RID_R25)|RID2RSET(RID_R28))\r\n#define RSET_SCRATCH_FPR \\\r\n  (RID2RSET(RID_F0)|RID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(RID_F6)|\\\r\n   RID2RSET(RID_F8)|RID2RSET(RID_F10)|RID2RSET(RID_F12)|RID2RSET(RID_F14)|\\\r\n   RID2RSET(RID_F16)|RID2RSET(RID_F18))\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R4\r\n#define REGARG_LASTGPR\t\tRID_R7\r\n#define REGARG_NUMGPR\t\t4\r\n#define REGARG_FIRSTFPR\t\tRID_F12\r\n#define REGARG_LASTFPR\t\tRID_F14\r\n#define REGARG_NUMFPR\t\t2\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use.\r\n*/\r\n#define SPS_FIXED\t5\r\n#define SPS_FIRST\t4\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 1) & ~1)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  int32_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n/* Return the address of a per-trace exit stub. */\r\nstatic LJ_AINLINE uint32_t *exitstub_trace_addr_(uint32_t *p)\r\n{\r\n  while (*p == 0x00000000) p++;  /* Skip MIPSI_NOP. */\r\n  return p;\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_trace_addr(T, exitno) \\\r\n  exitstub_trace_addr_((MCode *)((char *)(T)->mcode + (T)->szmcode))\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define MIPSF_S(r)\t((r) << 21)\r\n#define MIPSF_T(r)\t((r) << 16)\r\n#define MIPSF_D(r)\t((r) << 11)\r\n#define MIPSF_R(r)\t((r) << 21)\r\n#define MIPSF_H(r)\t((r) << 16)\r\n#define MIPSF_G(r)\t((r) << 11)\r\n#define MIPSF_F(r)\t((r) << 6)\r\n#define MIPSF_A(n)\t((n) << 6)\r\n#define MIPSF_M(n)\t((n) << 11)\r\n\r\ntypedef enum MIPSIns {\r\n  /* Integer instructions. */\r\n  MIPSI_MOVE = 0x00000021,\r\n  MIPSI_NOP = 0x00000000,\r\n\r\n  MIPSI_LI = 0x24000000,\r\n  MIPSI_LU = 0x34000000,\r\n  MIPSI_LUI = 0x3c000000,\r\n\r\n  MIPSI_ADDIU = 0x24000000,\r\n  MIPSI_ANDI = 0x30000000,\r\n  MIPSI_ORI = 0x34000000,\r\n  MIPSI_XORI = 0x38000000,\r\n  MIPSI_SLTI = 0x28000000,\r\n  MIPSI_SLTIU = 0x2c000000,\r\n\r\n  MIPSI_ADDU = 0x00000021,\r\n  MIPSI_SUBU = 0x00000023,\r\n  MIPSI_MUL = 0x70000002,\r\n  MIPSI_AND = 0x00000024,\r\n  MIPSI_OR = 0x00000025,\r\n  MIPSI_XOR = 0x00000026,\r\n  MIPSI_NOR = 0x00000027,\r\n  MIPSI_SLT = 0x0000002a,\r\n  MIPSI_SLTU = 0x0000002b,\r\n  MIPSI_MOVZ = 0x0000000a,\r\n  MIPSI_MOVN = 0x0000000b,\r\n\r\n  MIPSI_SLL = 0x00000000,\r\n  MIPSI_SRL = 0x00000002,\r\n  MIPSI_SRA = 0x00000003,\r\n  MIPSI_ROTR = 0x00200002,\t/* MIPS32R2 */\r\n  MIPSI_SLLV = 0x00000004,\r\n  MIPSI_SRLV = 0x00000006,\r\n  MIPSI_SRAV = 0x00000007,\r\n  MIPSI_ROTRV = 0x00000046,\t/* MIPS32R2 */\r\n\r\n  MIPSI_SEB = 0x7c000420,\t/* MIPS32R2 */\r\n  MIPSI_SEH = 0x7c000620,\t/* MIPS32R2 */\r\n  MIPSI_WSBH = 0x7c0000a0,\t/* MIPS32R2 */\r\n\r\n  MIPSI_B = 0x10000000,\r\n  MIPSI_J = 0x08000000,\r\n  MIPSI_JAL = 0x0c000000,\r\n  MIPSI_JR = 0x00000008,\r\n  MIPSI_JALR = 0x0000f809,\r\n\r\n  MIPSI_BEQ = 0x10000000,\r\n  MIPSI_BNE = 0x14000000,\r\n  MIPSI_BLEZ = 0x18000000,\r\n  MIPSI_BGTZ = 0x1c000000,\r\n  MIPSI_BLTZ = 0x04000000,\r\n  MIPSI_BGEZ = 0x04010000,\r\n\r\n  /* Load/store instructions. */\r\n  MIPSI_LW = 0x8c000000,\r\n  MIPSI_SW = 0xac000000,\r\n  MIPSI_LB = 0x80000000,\r\n  MIPSI_SB = 0xa0000000,\r\n  MIPSI_LH = 0x84000000,\r\n  MIPSI_SH = 0xa4000000,\r\n  MIPSI_LBU = 0x90000000,\r\n  MIPSI_LHU = 0x94000000,\r\n  MIPSI_LWC1 = 0xc4000000,\r\n  MIPSI_SWC1 = 0xe4000000,\r\n  MIPSI_LDC1 = 0xd4000000,\r\n  MIPSI_SDC1 = 0xf4000000,\r\n\r\n  /* FP instructions. */\r\n  MIPSI_MOV_S = 0x46000006,\r\n  MIPSI_MOV_D = 0x46200006,\r\n  MIPSI_MOVT_D = 0x46210011,\r\n  MIPSI_MOVF_D = 0x46200011,\r\n\r\n  MIPSI_ABS_D = 0x46200005,\r\n  MIPSI_NEG_D = 0x46200007,\r\n\r\n  MIPSI_ADD_D = 0x46200000,\r\n  MIPSI_SUB_D = 0x46200001,\r\n  MIPSI_MUL_D = 0x46200002,\r\n  MIPSI_DIV_D = 0x46200003,\r\n  MIPSI_SQRT_D = 0x46200004,\r\n\r\n  MIPSI_ADD_S = 0x46000000,\r\n  MIPSI_SUB_S = 0x46000001,\r\n\r\n  MIPSI_CVT_D_S = 0x46000021,\r\n  MIPSI_CVT_W_S = 0x46000024,\r\n  MIPSI_CVT_S_D = 0x46200020,\r\n  MIPSI_CVT_W_D = 0x46200024,\r\n  MIPSI_CVT_S_W = 0x46800020,\r\n  MIPSI_CVT_D_W = 0x46800021,\r\n\r\n  MIPSI_TRUNC_W_S = 0x4600000d,\r\n  MIPSI_TRUNC_W_D = 0x4620000d,\r\n  MIPSI_FLOOR_W_S = 0x4600000f,\r\n  MIPSI_FLOOR_W_D = 0x4620000f,\r\n\r\n  MIPSI_MFC1 = 0x44000000,\r\n  MIPSI_MTC1 = 0x44800000,\r\n\r\n  MIPSI_BC1F = 0x45000000,\r\n  MIPSI_BC1T = 0x45010000,\r\n\r\n  MIPSI_C_EQ_D = 0x46200032,\r\n  MIPSI_C_OLT_D = 0x46200034,\r\n  MIPSI_C_ULT_D = 0x46200035,\r\n  MIPSI_C_OLE_D = 0x46200036,\r\n  MIPSI_C_ULE_D = 0x46200037,\r\n\r\n} MIPSIns;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_target_ppc.h",
    "content": "/*\r\n** Definitions for PPC CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_PPC_H\r\n#define _LJ_TARGET_PPC_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(SP) _(SYS1) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(SYS2) _(R14) _(R15) \\\r\n  _(R16) _(R17) _(R18) _(R19) _(R20) _(R21) _(R22) _(R23) \\\r\n  _(R24) _(R25) _(R26) _(R27) _(R28) _(R29) _(R30) _(R31)\r\n#define FPRDEF(_) \\\r\n  _(F0) _(F1) _(F2) _(F3) _(F4) _(F5) _(F6) _(F7) \\\r\n  _(F8) _(F9) _(F10) _(F11) _(F12) _(F13) _(F14) _(F15) \\\r\n  _(F16) _(F17) _(F18) _(F19) _(F20) _(F21) _(F22) _(F23) \\\r\n  _(F24) _(F25) _(F26) _(F27) _(F28) _(F29) _(F30) _(F31)\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_TMP = RID_R0,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R3,\r\n  RID_RETHI = RID_R3,\r\n  RID_RETLO = RID_R4,\r\n  RID_FPRET = RID_F1,\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R14,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R16,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R17,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R18,\t\t/* Interpreter L. */\r\n  RID_JGL = RID_R31,\t\t/* On-trace: global_State + 32768. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_R31+1,\r\n  RID_MIN_FPR = RID_F0,\r\n  RID_MAX_FPR = RID_F31+1,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except TMP, SP, SYS1, SYS2 and JGL. */\r\n#define RSET_FIXED \\\r\n  (RID2RSET(RID_TMP)|RID2RSET(RID_SP)|RID2RSET(RID_SYS1)|\\\r\n   RID2RSET(RID_SYS2)|RID2RSET(RID_JGL))\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR) - RSET_FIXED)\r\n#define RSET_FPR\tRSET_RANGE(RID_MIN_FPR, RID_MAX_FPR)\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#define RSET_SCRATCH_GPR\t(RSET_RANGE(RID_R3, RID_R12+1))\r\n#define RSET_SCRATCH_FPR\t(RSET_RANGE(RID_F0, RID_F13+1))\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R3\r\n#define REGARG_LASTGPR\t\tRID_R10\r\n#define REGARG_NUMGPR\t\t8\r\n#define REGARG_FIRSTFPR\t\tRID_F1\r\n#define REGARG_LASTFPR\t\tRID_F8\r\n#define REGARG_NUMFPR\t\t8\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use.\r\n** [sp+12] tmplo word \\\r\n** [sp+ 8] tmphi word / tmp dword, parameter area for callee\r\n** [sp+ 4] tmpw, LR of callee\r\n** [sp+ 0] stack chain\r\n*/\r\n#define SPS_FIXED\t7\r\n#define SPS_FIRST\t4\r\n\r\n/* Stack offsets for temporary slots. Used for FP<->int conversions etc. */\r\n#define SPOFS_TMPW\t4\r\n#define SPOFS_TMP\t8\r\n#define SPOFS_TMPHI\t8\r\n#define SPOFS_TMPLO\t12\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 3) & ~3)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  int32_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n/* Return the address of a per-trace exit stub. */\r\nstatic LJ_AINLINE uint32_t *exitstub_trace_addr_(uint32_t *p, uint32_t exitno)\r\n{\r\n  while (*p == 0x60000000) p++;  /* Skip PPCI_NOP. */\r\n  return p + 3 + exitno;\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_trace_addr(T, exitno) \\\r\n  exitstub_trace_addr_((MCode *)((char *)(T)->mcode + (T)->szmcode), (exitno))\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define PPCF_CC(cc)\t((((cc) & 3) << 16) | (((cc) & 4) << 22))\r\n#define PPCF_T(r)\t((r) << 21)\r\n#define PPCF_A(r)\t((r) << 16)\r\n#define PPCF_B(r)\t((r) << 11)\r\n#define PPCF_C(r)\t((r) << 6)\r\n#define PPCF_MB(n)\t((n) << 6)\r\n#define PPCF_ME(n)\t((n) << 1)\r\n#define PPCF_Y\t\t0x00200000\r\n#define PPCF_DOT\t0x00000001\r\n\r\ntypedef enum PPCIns {\r\n  /* Integer instructions. */\r\n  PPCI_MR = 0x7c000378,\r\n  PPCI_NOP = 0x60000000,\r\n\r\n  PPCI_LI = 0x38000000,\r\n  PPCI_LIS = 0x3c000000,\r\n\r\n  PPCI_ADD = 0x7c000214,\r\n  PPCI_ADDC = 0x7c000014,\r\n  PPCI_ADDO = 0x7c000614,\r\n  PPCI_ADDE = 0x7c000114,\r\n  PPCI_ADDZE = 0x7c000194,\r\n  PPCI_ADDME = 0x7c0001d4,\r\n  PPCI_ADDI = 0x38000000,\r\n  PPCI_ADDIS = 0x3c000000,\r\n  PPCI_ADDIC = 0x30000000,\r\n  PPCI_ADDICDOT = 0x34000000,\r\n\r\n  PPCI_SUBF = 0x7c000050,\r\n  PPCI_SUBFC = 0x7c000010,\r\n  PPCI_SUBFO = 0x7c000450,\r\n  PPCI_SUBFE = 0x7c000110,\r\n  PPCI_SUBFZE = 0x7c000190,\r\n  PPCI_SUBFME = 0x7c0001d0,\r\n  PPCI_SUBFIC = 0x20000000,\r\n\r\n  PPCI_NEG = 0x7c0000d0,\r\n\r\n  PPCI_AND = 0x7c000038,\r\n  PPCI_ANDC = 0x7c000078,\r\n  PPCI_NAND = 0x7c0003b8,\r\n  PPCI_ANDIDOT = 0x70000000,\r\n  PPCI_ANDISDOT = 0x74000000,\r\n\r\n  PPCI_OR = 0x7c000378,\r\n  PPCI_NOR = 0x7c0000f8,\r\n  PPCI_ORI = 0x60000000,\r\n  PPCI_ORIS = 0x64000000,\r\n\r\n  PPCI_XOR = 0x7c000278,\r\n  PPCI_EQV = 0x7c000238,\r\n  PPCI_XORI = 0x68000000,\r\n  PPCI_XORIS = 0x6c000000,\r\n\r\n  PPCI_CMPW = 0x7c000000,\r\n  PPCI_CMPLW = 0x7c000040,\r\n  PPCI_CMPWI = 0x2c000000,\r\n  PPCI_CMPLWI = 0x28000000,\r\n\r\n  PPCI_MULLW = 0x7c0001d6,\r\n  PPCI_MULLI = 0x1c000000,\r\n  PPCI_MULLWO = 0x7c0005d6,\r\n\r\n  PPCI_EXTSB = 0x7c000774,\r\n  PPCI_EXTSH = 0x7c000734,\r\n\r\n  PPCI_SLW = 0x7c000030,\r\n  PPCI_SRW = 0x7c000430,\r\n  PPCI_SRAW = 0x7c000630,\r\n  PPCI_SRAWI = 0x7c000670,\r\n\r\n  PPCI_RLWNM = 0x5c000000,\r\n  PPCI_RLWINM = 0x54000000,\r\n  PPCI_RLWIMI = 0x50000000,\r\n\r\n  PPCI_B = 0x48000000,\r\n  PPCI_BL = 0x48000001,\r\n  PPCI_BC = 0x40800000,\r\n  PPCI_BCL = 0x40800001,\r\n  PPCI_BCTR = 0x4e800420,\r\n  PPCI_BCTRL = 0x4e800421,\r\n\r\n  PPCI_CRANDC = 0x4c000102,\r\n  PPCI_CRXOR = 0x4c000182,\r\n  PPCI_CRAND = 0x4c000202,\r\n  PPCI_CREQV = 0x4c000242,\r\n  PPCI_CRORC = 0x4c000342,\r\n  PPCI_CROR = 0x4c000382,\r\n\r\n  PPCI_MFLR = 0x7c0802a6,\r\n  PPCI_MTCTR = 0x7c0903a6,\r\n\r\n  PPCI_MCRXR = 0x7c000400,\r\n\r\n  /* Load/store instructions. */\r\n  PPCI_LWZ = 0x80000000,\r\n  PPCI_LBZ = 0x88000000,\r\n  PPCI_STW = 0x90000000,\r\n  PPCI_STB = 0x98000000,\r\n  PPCI_LHZ = 0xa0000000,\r\n  PPCI_LHA = 0xa8000000,\r\n  PPCI_STH = 0xb0000000,\r\n\r\n  PPCI_STWU = 0x94000000,\r\n\r\n  PPCI_LFS = 0xc0000000,\r\n  PPCI_LFD = 0xc8000000,\r\n  PPCI_STFS = 0xd0000000,\r\n  PPCI_STFD = 0xd8000000,\r\n\r\n  PPCI_LWZX = 0x7c00002e,\r\n  PPCI_LBZX = 0x7c0000ae,\r\n  PPCI_STWX = 0x7c00012e,\r\n  PPCI_STBX = 0x7c0001ae,\r\n  PPCI_LHZX = 0x7c00022e,\r\n  PPCI_LHAX = 0x7c0002ae,\r\n  PPCI_STHX = 0x7c00032e,\r\n\r\n  PPCI_LWBRX = 0x7c00042c,\r\n  PPCI_STWBRX = 0x7c00052c,\r\n\r\n  PPCI_LFSX = 0x7c00042e,\r\n  PPCI_LFDX = 0x7c0004ae,\r\n  PPCI_STFSX = 0x7c00052e,\r\n  PPCI_STFDX = 0x7c0005ae,\r\n\r\n  /* FP instructions. */\r\n  PPCI_FMR = 0xfc000090,\r\n  PPCI_FNEG = 0xfc000050,\r\n  PPCI_FABS = 0xfc000210,\r\n\r\n  PPCI_FRSP = 0xfc000018,\r\n  PPCI_FCTIWZ = 0xfc00001e,\r\n\r\n  PPCI_FADD = 0xfc00002a,\r\n  PPCI_FSUB = 0xfc000028,\r\n  PPCI_FMUL = 0xfc000032,\r\n  PPCI_FDIV = 0xfc000024,\r\n  PPCI_FSQRT = 0xfc00002c,\r\n\r\n  PPCI_FMADD = 0xfc00003a,\r\n  PPCI_FMSUB = 0xfc000038,\r\n  PPCI_FNMSUB = 0xfc00003c,\r\n\r\n  PPCI_FCMPU = 0xfc000000,\r\n  PPCI_FSEL = 0xfc00002e,\r\n} PPCIns;\r\n\r\ntypedef enum PPCCC {\r\n  CC_GE, CC_LE, CC_NE, CC_NS, CC_LT, CC_GT, CC_EQ, CC_SO\r\n} PPCCC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_target_x86.h",
    "content": "/*\r\n** Definitions for x86 and x64 CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_X86_H\r\n#define _LJ_TARGET_X86_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#if LJ_64\r\n#define GPRDEF(_) \\\r\n  _(EAX) _(ECX) _(EDX) _(EBX) _(ESP) _(EBP) _(ESI) _(EDI) \\\r\n  _(R8D) _(R9D) _(R10D) _(R11D) _(R12D) _(R13D) _(R14D) _(R15D)\r\n#define FPRDEF(_) \\\r\n  _(XMM0) _(XMM1) _(XMM2) _(XMM3) _(XMM4) _(XMM5) _(XMM6) _(XMM7) \\\r\n  _(XMM8) _(XMM9) _(XMM10) _(XMM11) _(XMM12) _(XMM13) _(XMM14) _(XMM15)\r\n#else\r\n#define GPRDEF(_) \\\r\n  _(EAX) _(ECX) _(EDX) _(EBX) _(ESP) _(EBP) _(ESI) _(EDI)\r\n#define FPRDEF(_) \\\r\n  _(XMM0) _(XMM1) _(XMM2) _(XMM3) _(XMM4) _(XMM5) _(XMM6) _(XMM7)\r\n#endif\r\n#define VRIDDEF(_) \\\r\n  _(MRM)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_MRM = RID_MAX,\t\t/* Pseudo-id for ModRM operand. */\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_EAX,\r\n#if LJ_64\r\n  RID_FPRET = RID_XMM0,\r\n#else\r\n  RID_RETLO = RID_EAX,\r\n  RID_RETHI = RID_EDX,\r\n#endif\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_EDX,\t\t/* Interpreter BASE. */\r\n#if LJ_64 && !LJ_ABI_WIN\r\n  RID_LPC = RID_EBX,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R14D,\t/* Interpreter DISPATCH table. */\r\n#else\r\n  RID_LPC = RID_ESI,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_EBX,\t/* Interpreter DISPATCH table. */\r\n#endif\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_EAX,\r\n  RID_MIN_FPR = RID_XMM0,\r\n  RID_MAX_GPR = RID_MIN_FPR,\r\n  RID_MAX_FPR = RID_MAX,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR,\r\n};\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except the stack pointer. */\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR)-RID2RSET(RID_ESP))\r\n#define RSET_FPR\t(RSET_RANGE(RID_MIN_FPR, RID_MAX_FPR))\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#if LJ_64\r\n/* Note: this requires the use of FORCE_REX! */\r\n#define RSET_GPR8\tRSET_GPR\r\n#else\r\n#define RSET_GPR8\t(RSET_RANGE(RID_EAX, RID_EBX+1))\r\n#endif\r\n\r\n/* ABI-specific register sets. */\r\n#define RSET_ACD\t(RID2RSET(RID_EAX)|RID2RSET(RID_ECX)|RID2RSET(RID_EDX))\r\n#if LJ_64\r\n#if LJ_ABI_WIN\r\n/* Windows x64 ABI. */\r\n#define RSET_SCRATCH \\\r\n  (RSET_ACD|RSET_RANGE(RID_R8D, RID_R11D+1)|RSET_RANGE(RID_XMM0, RID_XMM5+1))\r\n#define REGARG_GPRS \\\r\n  (RID_ECX|((RID_EDX|((RID_R8D|(RID_R9D<<5))<<5))<<5))\r\n#define REGARG_NUMGPR\t4\r\n#define REGARG_NUMFPR\t4\r\n#define REGARG_FIRSTFPR\tRID_XMM0\r\n#define REGARG_LASTFPR\tRID_XMM3\r\n#define STACKARG_OFS\t(4*8)\r\n#else\r\n/* The rest of the civilized x64 world has a common ABI. */\r\n#define RSET_SCRATCH \\\r\n  (RSET_ACD|RSET_RANGE(RID_ESI, RID_R11D+1)|RSET_FPR)\r\n#define REGARG_GPRS \\\r\n  (RID_EDI|((RID_ESI|((RID_EDX|((RID_ECX|((RID_R8D|(RID_R9D \\\r\n   <<5))<<5))<<5))<<5))<<5))\r\n#define REGARG_NUMGPR\t6\r\n#define REGARG_NUMFPR\t8\r\n#define REGARG_FIRSTFPR\tRID_XMM0\r\n#define REGARG_LASTFPR\tRID_XMM7\r\n#define STACKARG_OFS\t0\r\n#endif\r\n#else\r\n/* Common x86 ABI. */\r\n#define RSET_SCRATCH\t(RSET_ACD|RSET_FPR)\r\n#define REGARG_GPRS\t(RID_ECX|(RID_EDX<<5))  /* Fastcall only. */\r\n#define REGARG_NUMGPR\t2  /* Fastcall only. */\r\n#define REGARG_NUMFPR\t0\r\n#define STACKARG_OFS\t0\r\n#endif\r\n\r\n#if LJ_64\r\n/* Prefer the low 8 regs of each type to reduce REX prefixes. */\r\n#undef rset_picktop\r\n#define rset_picktop(rs)\t(lj_fls(lj_bswap(rs)) ^ 0x18)\r\n#endif\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use. Reserve min. two 32 bit slots.\r\n*/\r\n#if LJ_64\r\n#if LJ_ABI_WIN\r\n#define SPS_FIXED\t(4*2)\r\n#define SPS_FIRST\t(4*2)\t/* Don't use callee register save area. */\r\n#else\r\n#define SPS_FIXED\t4\r\n#define SPS_FIRST\t2\r\n#endif\r\n#else\r\n#define SPS_FIXED\t6\r\n#define SPS_FIRST\t2\r\n#endif\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 3) & ~3)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  intptr_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Limited by the range of a short fwd jump (127): (2+2)*(32-1)-2 = 122. */\r\n#define EXITSTUB_SPACING\t(2+2)\r\n#define EXITSTUBS_PER_GROUP\t32\r\n\r\n/* -- x86 ModRM operand encoding ------------------------------------------ */\r\n\r\ntypedef enum {\r\n  XM_OFS0 = 0x00, XM_OFS8 = 0x40, XM_OFS32 = 0x80, XM_REG = 0xc0,\r\n  XM_SCALE1 = 0x00, XM_SCALE2 = 0x40, XM_SCALE4 = 0x80, XM_SCALE8 = 0xc0,\r\n  XM_MASK = 0xc0\r\n} x86Mode;\r\n\r\n/* Structure to hold variable ModRM operand. */\r\ntypedef struct {\r\n  int32_t ofs;\t\t/* Offset. */\r\n  uint8_t base;\t\t/* Base register or RID_NONE. */\r\n  uint8_t idx;\t\t/* Index register or RID_NONE. */\r\n  uint8_t scale;\t/* Index scale (XM_SCALE1 .. XM_SCALE8). */\r\n} x86ModRM;\r\n\r\n/* -- Opcodes ------------------------------------------------------------- */\r\n\r\n/* Macros to construct variable-length x86 opcodes. -(len+1) is in LSB. */\r\n#define XO_(o)\t\t((uint32_t)(0x0000fe + (0x##o<<24)))\r\n#define XO_FPU(a,b)\t((uint32_t)(0x00fd + (0x##a<<16)+(0x##b<<24)))\r\n#define XO_0f(o)\t((uint32_t)(0x0f00fd + (0x##o<<24)))\r\n#define XO_66(o)\t((uint32_t)(0x6600fd + (0x##o<<24)))\r\n#define XO_660f(o)\t((uint32_t)(0x0f66fc + (0x##o<<24)))\r\n#define XO_f20f(o)\t((uint32_t)(0x0ff2fc + (0x##o<<24)))\r\n#define XO_f30f(o)\t((uint32_t)(0x0ff3fc + (0x##o<<24)))\r\n\r\n/* This list of x86 opcodes is not intended to be complete. Opcodes are only\r\n** included when needed. Take a look at DynASM or jit.dis_x86 to see the\r\n** whole mess.\r\n*/\r\ntypedef enum {\r\n  /* Fixed length opcodes. XI_* prefix. */\r\n  XI_NOP =\t0x90,\r\n  XI_XCHGa =\t0x90,\r\n  XI_CALL =\t0xe8,\r\n  XI_JMP =\t0xe9,\r\n  XI_JMPs =\t0xeb,\r\n  XI_PUSH =\t0x50, /* Really 50+r. */\r\n  XI_JCCs =\t0x70, /* Really 7x. */\r\n  XI_JCCn =\t0x80, /* Really 0f8x. */\r\n  XI_LEA =\t0x8d,\r\n  XI_MOVrib =\t0xb0, /* Really b0+r. */\r\n  XI_MOVri =\t0xb8, /* Really b8+r. */\r\n  XI_ARITHib =\t0x80,\r\n  XI_ARITHi =\t0x81,\r\n  XI_ARITHi8 =\t0x83,\r\n  XI_PUSHi8 =\t0x6a,\r\n  XI_TESTb =\t0x84,\r\n  XI_TEST =\t0x85,\r\n  XI_MOVmi =\t0xc7,\r\n  XI_GROUP5 =\t0xff,\r\n\r\n  /* Note: little-endian byte-order! */\r\n  XI_FLDZ =\t0xeed9,\r\n  XI_FLD1 =\t0xe8d9,\r\n  XI_FLDLG2 =\t0xecd9,\r\n  XI_FLDLN2 =\t0xedd9,\r\n  XI_FDUP =\t0xc0d9,  /* Really fld st0. */\r\n  XI_FPOP =\t0xd8dd,  /* Really fstp st0. */\r\n  XI_FPOP1 =\t0xd9dd,  /* Really fstp st1. */\r\n  XI_FRNDINT =\t0xfcd9,\r\n  XI_FSIN =\t0xfed9,\r\n  XI_FCOS =\t0xffd9,\r\n  XI_FPTAN =\t0xf2d9,\r\n  XI_FPATAN =\t0xf3d9,\r\n  XI_FSCALE =\t0xfdd9,\r\n  XI_FYL2X =\t0xf1d9,\r\n\r\n  /* Variable-length opcodes. XO_* prefix. */\r\n  XO_MOV =\tXO_(8b),\r\n  XO_MOVto =\tXO_(89),\r\n  XO_MOVtow =\tXO_66(89),\r\n  XO_MOVtob =\tXO_(88),\r\n  XO_MOVmi =\tXO_(c7),\r\n  XO_MOVmib =\tXO_(c6),\r\n  XO_LEA =\tXO_(8d),\r\n  XO_ARITHib =\tXO_(80),\r\n  XO_ARITHi =\tXO_(81),\r\n  XO_ARITHi8 =\tXO_(83),\r\n  XO_ARITHiw8 =\tXO_66(83),\r\n  XO_SHIFTi =\tXO_(c1),\r\n  XO_SHIFT1 =\tXO_(d1),\r\n  XO_SHIFTcl =\tXO_(d3),\r\n  XO_IMUL =\tXO_0f(af),\r\n  XO_IMULi =\tXO_(69),\r\n  XO_IMULi8 =\tXO_(6b),\r\n  XO_CMP =\tXO_(3b),\r\n  XO_TESTb =\tXO_(84),\r\n  XO_TEST =\tXO_(85),\r\n  XO_GROUP3b =\tXO_(f6),\r\n  XO_GROUP3 =\tXO_(f7),\r\n  XO_GROUP5b =\tXO_(fe),\r\n  XO_GROUP5 =\tXO_(ff),\r\n  XO_MOVZXb =\tXO_0f(b6),\r\n  XO_MOVZXw =\tXO_0f(b7),\r\n  XO_MOVSXb =\tXO_0f(be),\r\n  XO_MOVSXw =\tXO_0f(bf),\r\n  XO_MOVSXd =\tXO_(63),\r\n  XO_BSWAP =\tXO_0f(c8),\r\n  XO_CMOV =\tXO_0f(40),\r\n\r\n  XO_MOVSD =\tXO_f20f(10),\r\n  XO_MOVSDto =\tXO_f20f(11),\r\n  XO_MOVSS =\tXO_f30f(10),\r\n  XO_MOVSSto =\tXO_f30f(11),\r\n  XO_MOVLPD =\tXO_660f(12),\r\n  XO_MOVAPS =\tXO_0f(28),\r\n  XO_XORPS =\tXO_0f(57),\r\n  XO_ANDPS =\tXO_0f(54),\r\n  XO_ADDSD =\tXO_f20f(58),\r\n  XO_SUBSD =\tXO_f20f(5c),\r\n  XO_MULSD =\tXO_f20f(59),\r\n  XO_DIVSD =\tXO_f20f(5e),\r\n  XO_SQRTSD =\tXO_f20f(51),\r\n  XO_MINSD =\tXO_f20f(5d),\r\n  XO_MAXSD =\tXO_f20f(5f),\r\n  XO_ROUNDSD =\t0x0b3a0ffc,  /* Really 66 0f 3a 0b. See asm_fpmath. */\r\n  XO_UCOMISD =\tXO_660f(2e),\r\n  XO_CVTSI2SD =\tXO_f20f(2a),\r\n  XO_CVTSD2SI =\tXO_f20f(2d),\r\n  XO_CVTTSD2SI=\tXO_f20f(2c),\r\n  XO_CVTSI2SS =\tXO_f30f(2a),\r\n  XO_CVTSS2SI =\tXO_f30f(2d),\r\n  XO_CVTTSS2SI=\tXO_f30f(2c),\r\n  XO_CVTSS2SD =\tXO_f30f(5a),\r\n  XO_CVTSD2SS =\tXO_f20f(5a),\r\n  XO_ADDSS =\tXO_f30f(58),\r\n  XO_MOVD =\tXO_660f(6e),\r\n  XO_MOVDto =\tXO_660f(7e),\r\n\r\n  XO_FLDd =\tXO_(d9), XOg_FLDd = 0,\r\n  XO_FLDq =\tXO_(dd), XOg_FLDq = 0,\r\n  XO_FILDd =\tXO_(db), XOg_FILDd = 0,\r\n  XO_FILDq =\tXO_(df), XOg_FILDq = 5,\r\n  XO_FSTPd =\tXO_(d9), XOg_FSTPd = 3,\r\n  XO_FSTPq =\tXO_(dd), XOg_FSTPq = 3,\r\n  XO_FISTPq =\tXO_(df), XOg_FISTPq = 7,\r\n  XO_FISTTPq =\tXO_(dd), XOg_FISTTPq = 1,\r\n  XO_FADDq =\tXO_(dc), XOg_FADDq = 0,\r\n  XO_FLDCW =\tXO_(d9), XOg_FLDCW = 5,\r\n  XO_FNSTCW =\tXO_(d9), XOg_FNSTCW = 7\r\n} x86Op;\r\n\r\n/* x86 opcode groups. */\r\ntypedef uint32_t x86Group;\r\n\r\n#define XG_(i8, i, g)\t((x86Group)(((i8) << 16) + ((i) << 8) + (g)))\r\n#define XG_ARITHi(g)\tXG_(XI_ARITHi8, XI_ARITHi, g)\r\n#define XG_TOXOi(xg)\t((x86Op)(0x000000fe + (((xg)<<16) & 0xff000000)))\r\n#define XG_TOXOi8(xg)\t((x86Op)(0x000000fe + (((xg)<<8) & 0xff000000)))\r\n\r\n#define XO_ARITH(a)\t((x86Op)(0x030000fe + ((a)<<27)))\r\n#define XO_ARITHw(a)\t((x86Op)(0x036600fd + ((a)<<27)))\r\n\r\ntypedef enum {\r\n  XOg_ADD, XOg_OR, XOg_ADC, XOg_SBB, XOg_AND, XOg_SUB, XOg_XOR, XOg_CMP,\r\n  XOg_X_IMUL\r\n} x86Arith;\r\n\r\ntypedef enum {\r\n  XOg_ROL, XOg_ROR, XOg_RCL, XOg_RCR, XOg_SHL, XOg_SHR, XOg_SAL, XOg_SAR\r\n} x86Shift;\r\n\r\ntypedef enum {\r\n  XOg_TEST, XOg_TEST_, XOg_NOT, XOg_NEG, XOg_MUL, XOg_IMUL, XOg_DIV, XOg_IDIV\r\n} x86Group3;\r\n\r\ntypedef enum {\r\n  XOg_INC, XOg_DEC, XOg_CALL, XOg_CALLfar, XOg_JMP, XOg_JMPfar, XOg_PUSH\r\n} x86Group5;\r\n\r\n/* x86 condition codes. */\r\ntypedef enum {\r\n  CC_O, CC_NO, CC_B, CC_NB, CC_E, CC_NE, CC_BE, CC_NBE,\r\n  CC_S, CC_NS, CC_P, CC_NP, CC_L, CC_NL, CC_LE, CC_NLE,\r\n  CC_C = CC_B, CC_NAE = CC_C, CC_NC = CC_NB, CC_AE = CC_NB,\r\n  CC_Z = CC_E, CC_NZ = CC_NE, CC_NA = CC_BE, CC_A = CC_NBE,\r\n  CC_PE = CC_P, CC_PO = CC_NP, CC_NGE = CC_L, CC_GE = CC_NL,\r\n  CC_NG = CC_LE, CC_G = CC_NLE\r\n} x86CC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_trace.c",
    "content": "/*\r\n** Trace management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_trace_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_gdbjit.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_asm.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n#include \"lj_target.h\"\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\n/* Synchronous abort with error message. */\r\nvoid lj_trace_err(jit_State *J, TraceError e)\r\n{\r\n  setnilV(&J->errinfo);  /* No error info. */\r\n  setintV(J->L->top++, (int32_t)e);\r\n  lj_err_throw(J->L, LUA_ERRRUN);\r\n}\r\n\r\n/* Synchronous abort with error message and error info. */\r\nvoid lj_trace_err_info(jit_State *J, TraceError e)\r\n{\r\n  setintV(J->L->top++, (int32_t)e);\r\n  lj_err_throw(J->L, LUA_ERRRUN);\r\n}\r\n\r\n/* -- Trace management ---------------------------------------------------- */\r\n\r\n/* The current trace is first assembled in J->cur. The variable length\r\n** arrays point to shared, growable buffers (J->irbuf etc.). When trace\r\n** recording ends successfully, the current trace and its data structures\r\n** are copied to a new (compact) GCtrace object.\r\n*/\r\n\r\n/* Find a free trace number. */\r\nstatic TraceNo trace_findfree(jit_State *J)\r\n{\r\n  MSize osz, lim;\r\n  if (J->freetrace == 0)\r\n    J->freetrace = 1;\r\n  for (; J->freetrace < J->sizetrace; J->freetrace++)\r\n    if (traceref(J, J->freetrace) == NULL)\r\n      return J->freetrace++;\r\n  /* Need to grow trace array. */\r\n  lim = (MSize)J->param[JIT_P_maxtrace] + 1;\r\n  if (lim < 2) lim = 2; else if (lim > 65535) lim = 65535;\r\n  osz = J->sizetrace;\r\n  if (osz >= lim)\r\n    return 0;  /* Too many traces. */\r\n  lj_mem_growvec(J->L, J->trace, J->sizetrace, lim, GCRef);\r\n  for (; osz < J->sizetrace; osz++)\r\n    setgcrefnull(J->trace[osz]);\r\n  return J->freetrace;\r\n}\r\n\r\n#define TRACE_APPENDVEC(field, szfield, tp) \\\r\n  T->field = (tp *)p; \\\r\n  memcpy(p, J->cur.field, J->cur.szfield*sizeof(tp)); \\\r\n  p += J->cur.szfield*sizeof(tp);\r\n\r\n#ifdef LUAJIT_USE_PERFTOOLS\r\n/*\r\n** Create symbol table of JIT-compiled code. For use with Linux perf tools.\r\n** Example usage:\r\n**   perf record -f -e cycles luajit test.lua\r\n**   perf report -s symbol\r\n**   rm perf.data /tmp/perf-*.map\r\n*/\r\n#include <stdio.h>\r\n#include <unistd.h>\r\n\r\nstatic void perftools_addtrace(GCtrace *T)\r\n{\r\n  static FILE *fp;\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  const BCIns *startpc = mref(T->startpc, const BCIns);\r\n  const char *name = proto_chunknamestr(pt);\r\n  BCLine lineno;\r\n  if (name[0] == '@' || name[0] == '=')\r\n    name++;\r\n  else\r\n    name = \"(string)\";\r\n  lua_assert(startpc >= proto_bc(pt) && startpc < proto_bc(pt) + pt->sizebc);\r\n  lineno = lj_debug_line(pt, proto_bcpos(pt, startpc));\r\n  if (!fp) {\r\n    char fname[40];\r\n    sprintf(fname, \"/tmp/perf-%d.map\", getpid());\r\n    if (!(fp = fopen(fname, \"w\"))) return;\r\n    setlinebuf(fp);\r\n  }\r\n  fprintf(fp, \"%lx %x TRACE_%d::%s:%u\\n\",\r\n\t  (long)T->mcode, T->szmcode, T->traceno, name, lineno);\r\n}\r\n#endif\r\n\r\n/* Save current trace by copying and compacting it. */\r\nstatic void trace_save(jit_State *J)\r\n{\r\n  size_t sztr = ((sizeof(GCtrace)+7)&~7);\r\n  size_t szins = (J->cur.nins-J->cur.nk)*sizeof(IRIns);\r\n  size_t sz = sztr + szins +\r\n\t      J->cur.nsnap*sizeof(SnapShot) +\r\n\t      J->cur.nsnapmap*sizeof(SnapEntry);\r\n  GCtrace *T = lj_mem_newt(J->L, (MSize)sz, GCtrace);\r\n  char *p = (char *)T + sztr;\r\n  memcpy(T, &J->cur, sizeof(GCtrace));\r\n  setgcrefr(T->nextgc, J2G(J)->gc.root);\r\n  setgcrefp(J2G(J)->gc.root, T);\r\n  newwhite(J2G(J), T);\r\n  T->gct = ~LJ_TTRACE;\r\n  T->ir = (IRIns *)p - J->cur.nk;\r\n  memcpy(p, J->cur.ir+J->cur.nk, szins);\r\n  p += szins;\r\n  TRACE_APPENDVEC(snap, nsnap, SnapShot)\r\n  TRACE_APPENDVEC(snapmap, nsnapmap, SnapEntry)\r\n  J->cur.traceno = 0;\r\n  setgcrefp(J->trace[T->traceno], T);\r\n  lj_gc_barriertrace(J2G(J), T->traceno);\r\n  lj_gdbjit_addtrace(J, T);\r\n#ifdef LUAJIT_USE_PERFTOOLS\r\n  perftools_addtrace(T);\r\n#endif\r\n}\r\n\r\nvoid LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T)\r\n{\r\n  jit_State *J = G2J(g);\r\n  if (T->traceno) {\r\n    lj_gdbjit_deltrace(J, T);\r\n    if (T->traceno < J->freetrace)\r\n      J->freetrace = T->traceno;\r\n    setgcrefnull(J->trace[T->traceno]);\r\n  }\r\n  lj_mem_free(g, T,\r\n    ((sizeof(GCtrace)+7)&~7) + (T->nins-T->nk)*sizeof(IRIns) +\r\n    T->nsnap*sizeof(SnapShot) + T->nsnapmap*sizeof(SnapEntry));\r\n}\r\n\r\n/* Re-enable compiling a prototype by unpatching any modified bytecode. */\r\nvoid lj_trace_reenableproto(GCproto *pt)\r\n{\r\n  if ((pt->flags & PROTO_ILOOP)) {\r\n    BCIns *bc = proto_bc(pt);\r\n    BCPos i, sizebc = pt->sizebc;;\r\n    pt->flags &= ~PROTO_ILOOP;\r\n    if (bc_op(bc[0]) == BC_IFUNCF)\r\n      setbc_op(&bc[0], BC_FUNCF);\r\n    for (i = 1; i < sizebc; i++) {\r\n      BCOp op = bc_op(bc[i]);\r\n      if (op == BC_IFORL || op == BC_IITERL || op == BC_ILOOP)\r\n\tsetbc_op(&bc[i], (int)op+(int)BC_LOOP-(int)BC_ILOOP);\r\n    }\r\n  }\r\n}\r\n\r\n/* Unpatch the bytecode modified by a root trace. */\r\nstatic void trace_unpatch(jit_State *J, GCtrace *T)\r\n{\r\n  BCOp op = bc_op(T->startins);\r\n  BCIns *pc = mref(T->startpc, BCIns);\r\n  UNUSED(J);\r\n  if (op == BC_JMP)\r\n    return;  /* No need to unpatch branches in parent traces (yet). */\r\n  switch (bc_op(*pc)) {\r\n  case BC_JFORL:\r\n    lua_assert(traceref(J, bc_d(*pc)) == T);\r\n    *pc = T->startins;\r\n    pc += bc_j(T->startins);\r\n    lua_assert(bc_op(*pc) == BC_JFORI);\r\n    setbc_op(pc, BC_FORI);\r\n    break;\r\n  case BC_JITERL:\r\n  case BC_JLOOP:\r\n    lua_assert(op == BC_ITERL || op == BC_LOOP || bc_isret(op));\r\n    *pc = T->startins;\r\n    break;\r\n  case BC_JMP:\r\n    lua_assert(op == BC_ITERL);\r\n    pc += bc_j(*pc)+2;\r\n    if (bc_op(*pc) == BC_JITERL) {\r\n      lua_assert(traceref(J, bc_d(*pc)) == T);\r\n      *pc = T->startins;\r\n    }\r\n    break;\r\n  case BC_JFUNCF:\r\n    lua_assert(op == BC_FUNCF);\r\n    *pc = T->startins;\r\n    break;\r\n  default:  /* Already unpatched. */\r\n    break;\r\n  }\r\n}\r\n\r\n/* Flush a root trace. */\r\nstatic void trace_flushroot(jit_State *J, GCtrace *T)\r\n{\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  lua_assert(T->root == 0 && pt != NULL);\r\n  /* First unpatch any modified bytecode. */\r\n  trace_unpatch(J, T);\r\n  /* Unlink root trace from chain anchored in prototype. */\r\n  if (pt->trace == T->traceno) {  /* Trace is first in chain. Easy. */\r\n    pt->trace = T->nextroot;\r\n  } else if (pt->trace) {  /* Otherwise search in chain of root traces. */\r\n    GCtrace *T2 = traceref(J, pt->trace);\r\n    if (T2) {\r\n      for (; T2->nextroot; T2 = traceref(J, T2->nextroot))\r\n\tif (T2->nextroot == T->traceno) {\r\n\t  T2->nextroot = T->nextroot;  /* Unlink from chain. */\r\n\t  break;\r\n\t}\r\n    }\r\n  }\r\n}\r\n\r\n/* Flush a trace. Only root traces are considered. */\r\nvoid lj_trace_flush(jit_State *J, TraceNo traceno)\r\n{\r\n  if (traceno > 0 && traceno < J->sizetrace) {\r\n    GCtrace *T = traceref(J, traceno);\r\n    if (T && T->root == 0)\r\n      trace_flushroot(J, T);\r\n  }\r\n}\r\n\r\n/* Flush all traces associated with a prototype. */\r\nvoid lj_trace_flushproto(global_State *g, GCproto *pt)\r\n{\r\n  while (pt->trace != 0)\r\n    trace_flushroot(G2J(g), traceref(G2J(g), pt->trace));\r\n}\r\n\r\n/* Flush all traces. */\r\nint lj_trace_flushall(lua_State *L)\r\n{\r\n  jit_State *J = L2J(L);\r\n  ptrdiff_t i;\r\n  if ((J2G(J)->hookmask & HOOK_GC))\r\n    return 1;\r\n  for (i = (ptrdiff_t)J->sizetrace-1; i > 0; i--) {\r\n    GCtrace *T = traceref(J, i);\r\n    if (T) {\r\n      if (T->root == 0)\r\n\ttrace_flushroot(J, T);\r\n      lj_gdbjit_deltrace(J, T);\r\n      T->traceno = 0;\r\n      setgcrefnull(J->trace[i]);\r\n    }\r\n  }\r\n  J->cur.traceno = 0;\r\n  J->freetrace = 0;\r\n  /* Clear penalty cache. */\r\n  memset(J->penalty, 0, sizeof(J->penalty));\r\n  /* Free the whole machine code and invalidate all exit stub groups. */\r\n  lj_mcode_free(J);\r\n  memset(J->exitstubgroup, 0, sizeof(J->exitstubgroup));\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"flush\"));\r\n  );\r\n  return 0;\r\n}\r\n\r\n/* Initialize JIT compiler state. */\r\nvoid lj_trace_initstate(global_State *g)\r\n{\r\n  jit_State *J = G2J(g);\r\n  TValue *tv;\r\n  /* Initialize SIMD constants. */\r\n  tv = LJ_KSIMD(J, LJ_KSIMD_ABS);\r\n  tv[0].u64 = U64x(7fffffff,ffffffff);\r\n  tv[1].u64 = U64x(7fffffff,ffffffff);\r\n  tv = LJ_KSIMD(J, LJ_KSIMD_NEG);\r\n  tv[0].u64 = U64x(80000000,00000000);\r\n  tv[1].u64 = U64x(80000000,00000000);\r\n}\r\n\r\n/* Free everything associated with the JIT compiler state. */\r\nvoid lj_trace_freestate(global_State *g)\r\n{\r\n  jit_State *J = G2J(g);\r\n#ifdef LUA_USE_ASSERT\r\n  {  /* This assumes all traces have already been freed. */\r\n    ptrdiff_t i;\r\n    for (i = 1; i < (ptrdiff_t)J->sizetrace; i++)\r\n      lua_assert(i == (ptrdiff_t)J->cur.traceno || traceref(J, i) == NULL);\r\n  }\r\n#endif\r\n  lj_mcode_free(J);\r\n  lj_ir_k64_freeall(J);\r\n  lj_mem_freevec(g, J->snapmapbuf, J->sizesnapmap, SnapEntry);\r\n  lj_mem_freevec(g, J->snapbuf, J->sizesnap, SnapShot);\r\n  lj_mem_freevec(g, J->irbuf + J->irbotlim, J->irtoplim - J->irbotlim, IRIns);\r\n  lj_mem_freevec(g, J->trace, J->sizetrace, GCRef);\r\n}\r\n\r\n/* -- Penalties and blacklisting ------------------------------------------ */\r\n\r\n/* Blacklist a bytecode instruction. */\r\nstatic void blacklist_pc(GCproto *pt, BCIns *pc)\r\n{\r\n  setbc_op(pc, (int)bc_op(*pc)+(int)BC_ILOOP-(int)BC_LOOP);\r\n  pt->flags |= PROTO_ILOOP;\r\n}\r\n\r\n/* Penalize a bytecode instruction. */\r\nstatic void penalty_pc(jit_State *J, GCproto *pt, BCIns *pc, TraceError e)\r\n{\r\n  uint32_t i, val = PENALTY_MIN;\r\n  for (i = 0; i < PENALTY_SLOTS; i++)\r\n    if (mref(J->penalty[i].pc, const BCIns) == pc) {  /* Cache slot found? */\r\n      /* First try to bump its hotcount several times. */\r\n      val = ((uint32_t)J->penalty[i].val << 1) +\r\n\t    LJ_PRNG_BITS(J, PENALTY_RNDBITS);\r\n      if (val > PENALTY_MAX) {\r\n\tblacklist_pc(pt, pc);  /* Blacklist it, if that didn't help. */\r\n\treturn;\r\n      }\r\n      goto setpenalty;\r\n    }\r\n  /* Assign a new penalty cache slot. */\r\n  i = J->penaltyslot;\r\n  J->penaltyslot = (J->penaltyslot + 1) & (PENALTY_SLOTS-1);\r\n  setmref(J->penalty[i].pc, pc);\r\nsetpenalty:\r\n  J->penalty[i].val = (uint16_t)val;\r\n  J->penalty[i].reason = e;\r\n  hotcount_set(J2GG(J), pc+1, val);\r\n}\r\n\r\n/* -- Trace compiler state machine ---------------------------------------- */\r\n\r\n/* Start tracing. */\r\nstatic void trace_start(jit_State *J)\r\n{\r\n  lua_State *L;\r\n  TraceNo traceno;\r\n\r\n  if ((J->pt->flags & PROTO_NOJIT)) {  /* JIT disabled for this proto? */\r\n    if (J->parent == 0) {\r\n      /* Lazy bytecode patching to disable hotcount events. */\r\n      lua_assert(bc_op(*J->pc) == BC_FORL || bc_op(*J->pc) == BC_ITERL ||\r\n\t\t bc_op(*J->pc) == BC_LOOP || bc_op(*J->pc) == BC_FUNCF);\r\n      setbc_op(J->pc, (int)bc_op(*J->pc)+(int)BC_ILOOP-(int)BC_LOOP);\r\n      J->pt->flags |= PROTO_ILOOP;\r\n    }\r\n    J->state = LJ_TRACE_IDLE;  /* Silently ignored. */\r\n    return;\r\n  }\r\n\r\n  /* Get a new trace number. */\r\n  traceno = trace_findfree(J);\r\n  if (LJ_UNLIKELY(traceno == 0)) {  /* No free trace? */\r\n    lua_assert((J2G(J)->hookmask & HOOK_GC) == 0);\r\n    lj_trace_flushall(J->L);\r\n    J->state = LJ_TRACE_IDLE;  /* Silently ignored. */\r\n    return;\r\n  }\r\n  setgcrefp(J->trace[traceno], &J->cur);\r\n\r\n  /* Setup enough of the current trace to be able to send the vmevent. */\r\n  memset(&J->cur, 0, sizeof(GCtrace));\r\n  J->cur.traceno = traceno;\r\n  J->cur.nins = J->cur.nk = REF_BASE;\r\n  J->cur.ir = J->irbuf;\r\n  J->cur.snap = J->snapbuf;\r\n  J->cur.snapmap = J->snapmapbuf;\r\n  J->mergesnap = 0;\r\n  J->needsnap = 0;\r\n  J->bcskip = 0;\r\n  J->guardemit.irt = 0;\r\n  J->postproc = LJ_POST_NONE;\r\n  lj_resetsplit(J);\r\n  setgcref(J->cur.startpt, obj2gco(J->pt));\r\n\r\n  L = J->L;\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"start\"));\r\n    setintV(L->top++, traceno);\r\n    setfuncV(L, L->top++, J->fn);\r\n    setintV(L->top++, proto_bcpos(J->pt, J->pc));\r\n    if (J->parent) {\r\n      setintV(L->top++, J->parent);\r\n      setintV(L->top++, J->exitno);\r\n    }\r\n  );\r\n  lj_record_setup(J);\r\n}\r\n\r\n/* Stop tracing. */\r\nstatic void trace_stop(jit_State *J)\r\n{\r\n  BCIns *pc = mref(J->cur.startpc, BCIns);\r\n  BCOp op = bc_op(J->cur.startins);\r\n  GCproto *pt = &gcref(J->cur.startpt)->pt;\r\n  TraceNo traceno = J->cur.traceno;\r\n  lua_State *L;\r\n\r\n  switch (op) {\r\n  case BC_FORL:\r\n    setbc_op(pc+bc_j(J->cur.startins), BC_JFORI);  /* Patch FORI, too. */\r\n    /* fallthrough */\r\n  case BC_LOOP:\r\n  case BC_ITERL:\r\n  case BC_FUNCF:\r\n    /* Patch bytecode of starting instruction in root trace. */\r\n    setbc_op(pc, (int)op+(int)BC_JLOOP-(int)BC_LOOP);\r\n    setbc_d(pc, traceno);\r\n  addroot:\r\n    /* Add to root trace chain in prototype. */\r\n    J->cur.nextroot = pt->trace;\r\n    pt->trace = (TraceNo1)traceno;\r\n    break;\r\n  case BC_RET:\r\n  case BC_RET0:\r\n  case BC_RET1:\r\n    *pc = BCINS_AD(BC_JLOOP, J->cur.snap[0].nslots, traceno);\r\n    goto addroot;\r\n  case BC_JMP:\r\n    /* Patch exit branch in parent to side trace entry. */\r\n    lua_assert(J->parent != 0 && J->cur.root != 0);\r\n    lj_asm_patchexit(J, traceref(J, J->parent), J->exitno, J->cur.mcode);\r\n    /* Avoid compiling a side trace twice (stack resizing uses parent exit). */\r\n    traceref(J, J->parent)->snap[J->exitno].count = SNAPCOUNT_DONE;\r\n    /* Add to side trace chain in root trace. */\r\n    {\r\n      GCtrace *root = traceref(J, J->cur.root);\r\n      root->nchild++;\r\n      J->cur.nextside = root->nextside;\r\n      root->nextside = (TraceNo1)traceno;\r\n    }\r\n    break;\r\n  default:\r\n    lua_assert(0);\r\n    break;\r\n  }\r\n\r\n  /* Commit new mcode only after all patching is done. */\r\n  lj_mcode_commit(J, J->cur.mcode);\r\n  J->postproc = LJ_POST_NONE;\r\n  trace_save(J);\r\n\r\n  L = J->L;\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"stop\"));\r\n    setintV(L->top++, traceno);\r\n  );\r\n}\r\n\r\n/* Start a new root trace for down-recursion. */\r\nstatic int trace_downrec(jit_State *J)\r\n{\r\n  /* Restart recording at the return instruction. */\r\n  lua_assert(J->pt != NULL);\r\n  lua_assert(bc_isret(bc_op(*J->pc)));\r\n  if (bc_op(*J->pc) == BC_RETM)\r\n    return 0;  /* NYI: down-recursion with RETM. */\r\n  J->parent = 0;\r\n  J->exitno = 0;\r\n  J->state = LJ_TRACE_RECORD;\r\n  trace_start(J);\r\n  return 1;\r\n}\r\n\r\n/* Abort tracing. */\r\nstatic int trace_abort(jit_State *J)\r\n{\r\n  lua_State *L = J->L;\r\n  TraceError e = LJ_TRERR_RECERR;\r\n  TraceNo traceno;\r\n\r\n  J->postproc = LJ_POST_NONE;\r\n  lj_mcode_abort(J);\r\n  if (tvisnumber(L->top-1))\r\n    e = (TraceError)numberVint(L->top-1);\r\n  if (e == LJ_TRERR_MCODELM) {\r\n    L->top--;  /* Remove error object */\r\n    J->state = LJ_TRACE_ASM;\r\n    return 1;  /* Retry ASM with new MCode area. */\r\n  }\r\n  /* Penalize or blacklist starting bytecode instruction. */\r\n  if (J->parent == 0 && !bc_isret(bc_op(J->cur.startins)))\r\n    penalty_pc(J, &gcref(J->cur.startpt)->pt, mref(J->cur.startpc, BCIns), e);\r\n\r\n  /* Is there anything to abort? */\r\n  traceno = J->cur.traceno;\r\n  if (traceno) {\r\n    ptrdiff_t errobj = savestack(L, L->top-1);  /* Stack may be resized. */\r\n    J->cur.link = 0;\r\n    J->cur.linktype = LJ_TRLINK_NONE;\r\n    lj_vmevent_send(L, TRACE,\r\n      TValue *frame;\r\n      const BCIns *pc;\r\n      GCfunc *fn;\r\n      setstrV(L, L->top++, lj_str_newlit(L, \"abort\"));\r\n      setintV(L->top++, traceno);\r\n      /* Find original Lua function call to generate a better error message. */\r\n      frame = J->L->base-1;\r\n      pc = J->pc;\r\n      while (!isluafunc(frame_func(frame))) {\r\n\tpc = (frame_iscont(frame) ? frame_contpc(frame) : frame_pc(frame)) - 1;\r\n\tframe = frame_prev(frame);\r\n      }\r\n      fn = frame_func(frame);\r\n      setfuncV(L, L->top++, fn);\r\n      setintV(L->top++, proto_bcpos(funcproto(fn), pc));\r\n      copyTV(L, L->top++, restorestack(L, errobj));\r\n      copyTV(L, L->top++, &J->errinfo);\r\n    );\r\n    /* Drop aborted trace after the vmevent (which may still access it). */\r\n    setgcrefnull(J->trace[traceno]);\r\n    if (traceno < J->freetrace)\r\n      J->freetrace = traceno;\r\n    J->cur.traceno = 0;\r\n  }\r\n  L->top--;  /* Remove error object */\r\n  if (e == LJ_TRERR_DOWNREC)\r\n    return trace_downrec(J);\r\n  else if (e == LJ_TRERR_MCODEAL)\r\n    lj_trace_flushall(L);\r\n  return 0;\r\n}\r\n\r\n/* Perform pending re-patch of a bytecode instruction. */\r\nstatic LJ_AINLINE void trace_pendpatch(jit_State *J, int force)\r\n{\r\n  if (LJ_UNLIKELY(J->patchpc)) {\r\n    if (force || J->bcskip == 0) {\r\n      *J->patchpc = J->patchins;\r\n      J->patchpc = NULL;\r\n    } else {\r\n      J->bcskip = 0;\r\n    }\r\n  }\r\n}\r\n\r\n/* State machine for the trace compiler. Protected callback. */\r\nstatic TValue *trace_state(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  UNUSED(dummy);\r\n  do {\r\n  retry:\r\n    switch (J->state) {\r\n    case LJ_TRACE_START:\r\n      J->state = LJ_TRACE_RECORD;  /* trace_start() may change state. */\r\n      trace_start(J);\r\n      lj_dispatch_update(J2G(J));\r\n      break;\r\n\r\n    case LJ_TRACE_RECORD:\r\n      trace_pendpatch(J, 0);\r\n      setvmstate(J2G(J), RECORD);\r\n      lj_vmevent_send_(L, RECORD,\r\n\t/* Save/restore tmptv state for trace recorder. */\r\n\tTValue savetv = J2G(J)->tmptv;\r\n\tTValue savetv2 = J2G(J)->tmptv2;\r\n\tsetintV(L->top++, J->cur.traceno);\r\n\tsetfuncV(L, L->top++, J->fn);\r\n\tsetintV(L->top++, J->pt ? (int32_t)proto_bcpos(J->pt, J->pc) : -1);\r\n\tsetintV(L->top++, J->framedepth);\r\n      ,\r\n\tJ2G(J)->tmptv = savetv;\r\n\tJ2G(J)->tmptv2 = savetv2;\r\n      );\r\n      lj_record_ins(J);\r\n      break;\r\n\r\n    case LJ_TRACE_END:\r\n      trace_pendpatch(J, 1);\r\n      J->loopref = 0;\r\n      if ((J->flags & JIT_F_OPT_LOOP) &&\r\n\t  J->cur.link == J->cur.traceno && J->framedepth + J->retdepth == 0) {\r\n\tsetvmstate(J2G(J), OPT);\r\n\tlj_opt_dce(J);\r\n\tif (lj_opt_loop(J)) {  /* Loop optimization failed? */\r\n\t  J->cur.link = 0;\r\n\t  J->cur.linktype = LJ_TRLINK_NONE;\r\n\t  J->loopref = J->cur.nins;\r\n\t  J->state = LJ_TRACE_RECORD;  /* Try to continue recording. */\r\n\t  break;\r\n\t}\r\n\tJ->loopref = J->chain[IR_LOOP];  /* Needed by assembler. */\r\n      }\r\n      lj_opt_split(J);\r\n      lj_opt_sink(J);\r\n      if (!J->loopref) J->cur.snap[J->cur.nsnap-1].count = SNAPCOUNT_DONE;\r\n      J->state = LJ_TRACE_ASM;\r\n      break;\r\n\r\n    case LJ_TRACE_ASM:\r\n      setvmstate(J2G(J), ASM);\r\n      lj_asm_trace(J, &J->cur);\r\n      trace_stop(J);\r\n      setvmstate(J2G(J), INTERP);\r\n      J->state = LJ_TRACE_IDLE;\r\n      lj_dispatch_update(J2G(J));\r\n      return NULL;\r\n\r\n    default:  /* Trace aborted asynchronously. */\r\n      setintV(L->top++, (int32_t)LJ_TRERR_RECERR);\r\n      /* fallthrough */\r\n    case LJ_TRACE_ERR:\r\n      trace_pendpatch(J, 1);\r\n      if (trace_abort(J))\r\n\tgoto retry;\r\n      setvmstate(J2G(J), INTERP);\r\n      J->state = LJ_TRACE_IDLE;\r\n      lj_dispatch_update(J2G(J));\r\n      return NULL;\r\n    }\r\n  } while (J->state > LJ_TRACE_RECORD);\r\n  return NULL;\r\n}\r\n\r\n/* -- Event handling ------------------------------------------------------ */\r\n\r\n/* A bytecode instruction is about to be executed. Record it. */\r\nvoid lj_trace_ins(jit_State *J, const BCIns *pc)\r\n{\r\n  /* Note: J->L must already be set. pc is the true bytecode PC here. */\r\n  J->pc = pc;\r\n  J->fn = curr_func(J->L);\r\n  J->pt = isluafunc(J->fn) ? funcproto(J->fn) : NULL;\r\n  while (lj_vm_cpcall(J->L, NULL, (void *)J, trace_state) != 0)\r\n    J->state = LJ_TRACE_ERR;\r\n}\r\n\r\n/* A hotcount triggered. Start recording a root trace. */\r\nvoid LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc)\r\n{\r\n  /* Note: pc is the interpreter bytecode PC here. It's offset by 1. */\r\n  ERRNO_SAVE\r\n  /* Reset hotcount. */\r\n  hotcount_set(J2GG(J), pc, J->param[JIT_P_hotloop]*HOTCOUNT_LOOP);\r\n  /* Only start a new trace if not recording or inside __gc call or vmevent. */\r\n  if (J->state == LJ_TRACE_IDLE &&\r\n      !(J2G(J)->hookmask & (HOOK_GC|HOOK_VMEVENT))) {\r\n    J->parent = 0;  /* Root trace. */\r\n    J->exitno = 0;\r\n    J->state = LJ_TRACE_START;\r\n    lj_trace_ins(J, pc-1);\r\n  }\r\n  ERRNO_RESTORE\r\n}\r\n\r\n/* Check for a hot side exit. If yes, start recording a side trace. */\r\nstatic void trace_hotside(jit_State *J, const BCIns *pc)\r\n{\r\n  SnapShot *snap = &traceref(J, J->parent)->snap[J->exitno];\r\n  if (!(J2G(J)->hookmask & (HOOK_GC|HOOK_VMEVENT)) &&\r\n      snap->count != SNAPCOUNT_DONE &&\r\n      ++snap->count >= J->param[JIT_P_hotexit]) {\r\n    lua_assert(J->state == LJ_TRACE_IDLE);\r\n    /* J->parent is non-zero for a side trace. */\r\n    J->state = LJ_TRACE_START;\r\n    lj_trace_ins(J, pc);\r\n  }\r\n}\r\n\r\n/* Tiny struct to pass data to protected call. */\r\ntypedef struct ExitDataCP {\r\n  jit_State *J;\r\n  void *exptr;\t\t/* Pointer to exit state. */\r\n  const BCIns *pc;\t/* Restart interpreter at this PC. */\r\n} ExitDataCP;\r\n\r\n/* Need to protect lj_snap_restore because it may throw. */\r\nstatic TValue *trace_exit_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  ExitDataCP *exd = (ExitDataCP *)ud;\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  exd->pc = lj_snap_restore(exd->J, exd->exptr);\r\n  UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\n#ifndef LUAJIT_DISABLE_VMEVENT\r\n/* Push all registers from exit state. */\r\nstatic void trace_exit_regs(lua_State *L, ExitState *ex)\r\n{\r\n  int32_t i;\r\n  setintV(L->top++, RID_NUM_GPR);\r\n  setintV(L->top++, RID_NUM_FPR);\r\n  for (i = 0; i < RID_NUM_GPR; i++) {\r\n    if (sizeof(ex->gpr[i]) == sizeof(int32_t))\r\n      setintV(L->top++, (int32_t)ex->gpr[i]);\r\n    else\r\n      setnumV(L->top++, (lua_Number)ex->gpr[i]);\r\n  }\r\n#if !LJ_SOFTFP\r\n  for (i = 0; i < RID_NUM_FPR; i++) {\r\n    setnumV(L->top, ex->fpr[i]);\r\n    if (LJ_UNLIKELY(tvisnan(L->top)))\r\n      setnanV(L->top);\r\n    L->top++;\r\n  }\r\n#endif\r\n}\r\n#endif\r\n\r\n#ifdef EXITSTATE_PCREG\r\n/* Determine trace number from pc of exit instruction. */\r\nstatic TraceNo trace_exit_find(jit_State *J, MCode *pc)\r\n{\r\n  TraceNo traceno;\r\n  for (traceno = 1; traceno < J->sizetrace; traceno++) {\r\n    GCtrace *T = traceref(J, traceno);\r\n    if (T && pc >= T->mcode && pc < (MCode *)((char *)T->mcode + T->szmcode))\r\n      return traceno;\r\n  }\r\n  lua_assert(0);\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* A trace exited. Restore interpreter state. */\r\nint LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr)\r\n{\r\n  ERRNO_SAVE\r\n  lua_State *L = J->L;\r\n  ExitState *ex = (ExitState *)exptr;\r\n  ExitDataCP exd;\r\n  int errcode;\r\n  const BCIns *pc;\r\n  void *cf;\r\n  GCtrace *T;\r\n#ifdef EXITSTATE_PCREG\r\n  J->parent = trace_exit_find(J, (MCode *)(intptr_t)ex->gpr[EXITSTATE_PCREG]);\r\n#endif\r\n  T = traceref(J, J->parent); UNUSED(T);\r\n#ifdef EXITSTATE_CHECKEXIT\r\n  if (J->exitno == T->nsnap) {  /* Treat stack check like a parent exit. */\r\n    lua_assert(T->root != 0);\r\n    J->exitno = T->ir[REF_BASE].op2;\r\n    J->parent = T->ir[REF_BASE].op1;\r\n    T = traceref(J, J->parent);\r\n  }\r\n#endif\r\n  lua_assert(T != NULL && J->exitno < T->nsnap);\r\n  exd.J = J;\r\n  exd.exptr = exptr;\r\n  errcode = lj_vm_cpcall(L, NULL, &exd, trace_exit_cp);\r\n  if (errcode)\r\n    return -errcode;  /* Return negated error code. */\r\n\r\n  lj_vmevent_send(L, TEXIT,\r\n    lj_state_checkstack(L, 4+RID_NUM_GPR+RID_NUM_FPR+LUA_MINSTACK);\r\n    setintV(L->top++, J->parent);\r\n    setintV(L->top++, J->exitno);\r\n    trace_exit_regs(L, ex);\r\n  );\r\n\r\n  pc = exd.pc;\r\n  cf = cframe_raw(L->cframe);\r\n  setcframe_pc(cf, pc);\r\n  if (G(L)->gc.state == GCSatomic || G(L)->gc.state == GCSfinalize) {\r\n    if (!(G(L)->hookmask & HOOK_GC))\r\n      lj_gc_step(L);  /* Exited because of GC: drive GC forward. */\r\n  } else {\r\n    trace_hotside(J, pc);\r\n  }\r\n  if (bc_op(*pc) == BC_JLOOP) {\r\n    BCIns *retpc = &traceref(J, bc_d(*pc))->startins;\r\n    if (bc_isret(bc_op(*retpc))) {\r\n      if (J->state == LJ_TRACE_RECORD) {\r\n\tJ->patchins = *pc;\r\n\tJ->patchpc = (BCIns *)pc;\r\n\t*J->patchpc = *retpc;\r\n\tJ->bcskip = 1;\r\n      } else {\r\n\tpc = retpc;\r\n\tsetcframe_pc(cf, pc);\r\n      }\r\n    }\r\n  }\r\n  /* Return MULTRES or 0. */\r\n  ERRNO_RESTORE\r\n  switch (bc_op(*pc)) {\r\n  case BC_CALLM: case BC_CALLMT:\r\n    return (int)((BCReg)(L->top - L->base) - bc_a(*pc) - bc_c(*pc));\r\n  case BC_RETM:\r\n    return (int)((BCReg)(L->top - L->base) + 1 - bc_a(*pc) - bc_d(*pc));\r\n  case BC_TSETM:\r\n    return (int)((BCReg)(L->top - L->base) + 1 - bc_a(*pc));\r\n  default:\r\n    if (bc_op(*pc) >= BC_FUNCF)\r\n      return (int)((BCReg)(L->top - L->base) + 1);\r\n    return 0;\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_trace.h",
    "content": "/*\r\n** Trace management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TRACE_H\r\n#define _LJ_TRACE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#include \"lj_dispatch.h\"\r\n\r\n/* Trace errors. */\r\ntypedef enum {\r\n#define TREDEF(name, msg)\tLJ_TRERR_##name,\r\n#include \"lj_traceerr.h\"\r\n  LJ_TRERR__MAX\r\n} TraceError;\r\n\r\nLJ_FUNC_NORET void lj_trace_err(jit_State *J, TraceError e);\r\nLJ_FUNC_NORET void lj_trace_err_info(jit_State *J, TraceError e);\r\n\r\n/* Trace management. */\r\nLJ_FUNC void LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T);\r\nLJ_FUNC void lj_trace_reenableproto(GCproto *pt);\r\nLJ_FUNC void lj_trace_flushproto(global_State *g, GCproto *pt);\r\nLJ_FUNC void lj_trace_flush(jit_State *J, TraceNo traceno);\r\nLJ_FUNC int lj_trace_flushall(lua_State *L);\r\nLJ_FUNC void lj_trace_initstate(global_State *g);\r\nLJ_FUNC void lj_trace_freestate(global_State *g);\r\n\r\n/* Event handling. */\r\nLJ_FUNC void lj_trace_ins(jit_State *J, const BCIns *pc);\r\nLJ_FUNCA void LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc);\r\nLJ_FUNCA int LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr);\r\n\r\n/* Signal asynchronous abort of trace or end of trace. */\r\n#define lj_trace_abort(g)\t(G2J(g)->state &= ~LJ_TRACE_ACTIVE)\r\n#define lj_trace_end(J)\t\t(J->state = LJ_TRACE_END)\r\n\r\n#else\r\n\r\n#define lj_trace_flushall(L)\t(UNUSED(L), 0)\r\n#define lj_trace_initstate(g)\tUNUSED(g)\r\n#define lj_trace_freestate(g)\tUNUSED(g)\r\n#define lj_trace_abort(g)\tUNUSED(g)\r\n#define lj_trace_end(J)\t\tUNUSED(J)\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_traceerr.h",
    "content": "/*\r\n** Trace compiler error messages.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* This file may be included multiple times with different TREDEF macros. */\r\n\r\n/* Recording. */\r\nTREDEF(RECERR,\t\"error thrown or hook called during recording\")\r\nTREDEF(TRACEOV,\t\"trace too long\")\r\nTREDEF(STACKOV,\t\"trace too deep\")\r\nTREDEF(SNAPOV,\t\"too many snapshots\")\r\nTREDEF(BLACKL,\t\"blacklisted\")\r\nTREDEF(NYIBC,\t\"NYI: bytecode %d\")\r\n\r\n/* Recording loop ops. */\r\nTREDEF(LLEAVE,\t\"leaving loop in root trace\")\r\nTREDEF(LINNER,\t\"inner loop in root trace\")\r\nTREDEF(LUNROLL,\t\"loop unroll limit reached\")\r\n\r\n/* Recording calls/returns. */\r\nTREDEF(BADTYPE,\t\"bad argument type\")\r\nTREDEF(CJITOFF,\t\"JIT compilation disabled for function\")\r\nTREDEF(CUNROLL,\t\"call unroll limit reached\")\r\nTREDEF(DOWNREC,\t\"down-recursion, restarting\")\r\nTREDEF(NYICF,\t\"NYI: C function %p\")\r\nTREDEF(NYIFF,\t\"NYI: FastFunc %s\")\r\nTREDEF(NYIFFU,\t\"NYI: unsupported variant of FastFunc %s\")\r\nTREDEF(NYIRETL,\t\"NYI: return to lower frame\")\r\n\r\n/* Recording indexed load/store. */\r\nTREDEF(STORENN,\t\"store with nil or NaN key\")\r\nTREDEF(NOMM,\t\"missing metamethod\")\r\nTREDEF(IDXLOOP,\t\"looping index lookup\")\r\nTREDEF(NYITMIX,\t\"NYI: mixed sparse/dense table\")\r\n\r\n/* Recording C data operations. */\r\nTREDEF(NOCACHE,\t\"symbol not in cache\")\r\nTREDEF(NYICONV,\t\"NYI: unsupported C type conversion\")\r\nTREDEF(NYICALL,\t\"NYI: unsupported C function type\")\r\n\r\n/* Optimizations. */\r\nTREDEF(GFAIL,\t\"guard would always fail\")\r\nTREDEF(PHIOV,\t\"too many PHIs\")\r\nTREDEF(TYPEINS,\t\"persistent type instability\")\r\n\r\n/* Assembler. */\r\nTREDEF(MCODEAL,\t\"failed to allocate mcode memory\")\r\nTREDEF(MCODEOV,\t\"machine code too long\")\r\nTREDEF(MCODELM,\t\"hit mcode limit (retrying)\")\r\nTREDEF(SPILLOV,\t\"too many spill slots\")\r\nTREDEF(BADRA,\t\"inconsistent register allocation\")\r\nTREDEF(NYIIR,\t\"NYI: cannot assemble IR instruction %d\")\r\nTREDEF(NYIPHI,\t\"NYI: PHI shuffling too complex\")\r\nTREDEF(NYICOAL,\t\"NYI: register coalescing too complex\")\r\n\r\n#undef TREDEF\r\n\r\n/* Detecting unused error messages:\r\n   awk -F, '/^TREDEF/ { gsub(/TREDEF./, \"\"); printf \"grep -q LJ_TRERR_%s *.[ch] || echo %s\\n\", $1, $1}' lj_traceerr.h | sh\r\n*/\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_udata.c",
    "content": "/*\r\n** Userdata handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_udata_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_udata.h\"\r\n\r\nGCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env)\r\n{\r\n  GCudata *ud = lj_mem_newt(L, sizeof(GCudata) + sz, GCudata);\r\n  global_State *g = G(L);\r\n  newwhite(g, ud);  /* Not finalized. */\r\n  ud->gct = ~LJ_TUDATA;\r\n  ud->udtype = UDTYPE_USERDATA;\r\n  ud->len = sz;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcrefnull(ud->metatable);\r\n  setgcref(ud->env, obj2gco(env));\r\n  /* Chain to userdata list (after main thread). */\r\n  setgcrefr(ud->nextgc, mainthread(g)->nextgc);\r\n  setgcref(mainthread(g)->nextgc, obj2gco(ud));\r\n  return ud;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud)\r\n{\r\n  lj_mem_free(g, ud, sizeudata(ud));\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_udata.h",
    "content": "/*\r\n** Userdata handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_UDATA_H\r\n#define _LJ_UDATA_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\nLJ_FUNC GCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env);\r\nLJ_FUNC void LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_vm.h",
    "content": "/*\r\n** Assembler VM interface definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_VM_H\r\n#define _LJ_VM_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Entry points for ASM parts of VM. */\r\nLJ_ASMF void lj_vm_call(lua_State *L, TValue *base, int nres1);\r\nLJ_ASMF int lj_vm_pcall(lua_State *L, TValue *base, int nres1, ptrdiff_t ef);\r\ntypedef TValue *(*lua_CPFunction)(lua_State *L, lua_CFunction func, void *ud);\r\nLJ_ASMF int lj_vm_cpcall(lua_State *L, lua_CFunction func, void *ud,\r\n\t\t\t lua_CPFunction cp);\r\nLJ_ASMF int lj_vm_resume(lua_State *L, TValue *base, int nres1, ptrdiff_t ef);\r\nLJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_c(void *cframe, int errcode);\r\nLJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_ff(void *cframe);\r\nLJ_ASMF void lj_vm_unwind_c_eh(void);\r\nLJ_ASMF void lj_vm_unwind_ff_eh(void);\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF void lj_vm_unwind_rethrow(void);\r\n#endif\r\n\r\n/* Miscellaneous functions. */\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF int lj_vm_cpuid(uint32_t f, uint32_t res[4]);\r\n#endif\r\n#if LJ_TARGET_PPC\r\nvoid lj_vm_cachesync(void *start, void *end);\r\n#endif\r\nLJ_ASMF double lj_vm_foldarith(double x, double y, int op);\r\n#if LJ_HASJIT\r\nLJ_ASMF double lj_vm_foldfpm(double x, int op);\r\n#endif\r\n#if !LJ_ARCH_HASFPU\r\n/* Declared in lj_obj.h: LJ_ASMF int32_t lj_vm_tobit(double x); */\r\n#endif\r\n\r\n/* Dispatch targets for recording and hooks. */\r\nLJ_ASMF void lj_vm_record(void);\r\nLJ_ASMF void lj_vm_inshook(void);\r\nLJ_ASMF void lj_vm_rethook(void);\r\nLJ_ASMF void lj_vm_callhook(void);\r\n\r\n/* Trace exit handling. */\r\nLJ_ASMF void lj_vm_exit_handler(void);\r\nLJ_ASMF void lj_vm_exit_interp(void);\r\n\r\n/* Internal math helper functions. */\r\n#if LJ_TARGET_X86ORX64 || LJ_TARGET_PPC\r\n#define lj_vm_floor\tfloor\r\n#define lj_vm_ceil\tceil\r\n#else\r\nLJ_ASMF double lj_vm_floor(double);\r\nLJ_ASMF double lj_vm_ceil(double);\r\n#if LJ_TARGET_ARM\r\nLJ_ASMF double lj_vm_floor_sf(double);\r\nLJ_ASMF double lj_vm_ceil_sf(double);\r\n#endif\r\n#endif\r\n#if defined(LUAJIT_NO_LOG2) || LJ_TARGET_X86ORX64\r\nLJ_ASMF double lj_vm_log2(double);\r\n#else\r\n#define lj_vm_log2\tlog2\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF void lj_vm_floor_sse(void);\r\nLJ_ASMF void lj_vm_ceil_sse(void);\r\nLJ_ASMF void lj_vm_trunc_sse(void);\r\nLJ_ASMF void lj_vm_exp_x87(void);\r\nLJ_ASMF void lj_vm_exp2_x87(void);\r\nLJ_ASMF void lj_vm_pow_sse(void);\r\nLJ_ASMF void lj_vm_powi_sse(void);\r\n#else\r\n#if LJ_TARGET_PPC\r\n#define lj_vm_trunc\ttrunc\r\n#else\r\nLJ_ASMF double lj_vm_trunc(double);\r\n#if LJ_TARGET_ARM\r\nLJ_ASMF double lj_vm_trunc_sf(double);\r\n#endif\r\n#endif\r\nLJ_ASMF double lj_vm_powi(double, int32_t);\r\n#ifdef LUAJIT_NO_EXP2\r\nLJ_ASMF double lj_vm_exp2(double);\r\n#else\r\n#define lj_vm_exp2\texp2\r\n#endif\r\n#endif\r\nLJ_ASMF int32_t LJ_FASTCALL lj_vm_modi(int32_t, int32_t);\r\n#if LJ_HASFFI\r\nLJ_ASMF int lj_vm_errno(void);\r\n#endif\r\n#endif\r\n\r\n/* Continuations for metamethods. */\r\nLJ_ASMF void lj_cont_cat(void);  /* Continue with concatenation. */\r\nLJ_ASMF void lj_cont_ra(void);  /* Store result in RA from instruction. */\r\nLJ_ASMF void lj_cont_nop(void);  /* Do nothing, just continue execution. */\r\nLJ_ASMF void lj_cont_condt(void);  /* Branch if result is true. */\r\nLJ_ASMF void lj_cont_condf(void);  /* Branch if result is false. */\r\nLJ_ASMF void lj_cont_hook(void);  /* Continue from hook yield. */\r\n\r\nenum { LJ_CONT_TAILCALL, LJ_CONT_FFI_CALLBACK };  /* Special continuations. */\r\n\r\n/* Start of the ASM code. */\r\nLJ_ASMF char lj_vm_asm_begin[];\r\n\r\n/* Bytecode offsets are relative to lj_vm_asm_begin. */\r\n#define makeasmfunc(ofs)\t((ASMFunction)(lj_vm_asm_begin + (ofs)))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_vmevent.c",
    "content": "/*\r\n** VM event handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lj_vmevent_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n\r\nptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev)\r\n{\r\n  global_State *g = G(L);\r\n  GCstr *s = lj_str_newlit(L, LJ_VMEVENTS_REGKEY);\r\n  cTValue *tv = lj_tab_getstr(tabV(registry(L)), s);\r\n  if (tvistab(tv)) {\r\n    int hash = VMEVENT_HASH(ev);\r\n    tv = lj_tab_getint(tabV(tv), hash);\r\n    if (tv && tvisfunc(tv)) {\r\n      lj_state_checkstack(L, LUA_MINSTACK);\r\n      setfuncV(L, L->top++, funcV(tv));\r\n      return savestack(L, L->top);\r\n    }\r\n  }\r\n  g->vmevmask &= ~VMEVENT_MASK(ev);  /* No handler: cache this fact. */\r\n  return 0;\r\n}\r\n\r\nvoid lj_vmevent_call(lua_State *L, ptrdiff_t argbase)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldmask = g->vmevmask;\r\n  uint8_t oldh = hook_save(g);\r\n  int status;\r\n  g->vmevmask = 0;  /* Disable all events. */\r\n  hook_vmevent(g);\r\n  status = lj_vm_pcall(L, restorestack(L, argbase), 0+1, 0);\r\n  if (LJ_UNLIKELY(status)) {\r\n    /* Really shouldn't use stderr here, but where else to complain? */\r\n    L->top--;\r\n    fputs(\"VM handler failed: \", stderr);\r\n    fputs(tvisstr(L->top) ? strVdata(L->top) : \"?\", stderr);\r\n    fputc('\\n', stderr);\r\n  }\r\n  hook_restore(g, oldh);\r\n  if (g->vmevmask != VMEVENT_NOCACHE)\r\n    g->vmevmask = oldmask;  /* Restore event mask, but not if not modified. */\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_vmevent.h",
    "content": "/*\r\n** VM event handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_VMEVENT_H\r\n#define _LJ_VMEVENT_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Registry key for VM event handler table. */\r\n#define LJ_VMEVENTS_REGKEY\t\"_VMEVENTS\"\r\n#define LJ_VMEVENTS_HSIZE\t4\r\n\r\n#define VMEVENT_MASK(ev)\t((uint8_t)1 << ((int)(ev) & 7))\r\n#define VMEVENT_HASH(ev)\t((int)(ev) & ~7)\r\n#define VMEVENT_HASHIDX(h)\t((int)(h) << 3)\r\n#define VMEVENT_NOCACHE\t\t255\r\n\r\n#define VMEVENT_DEF(name, hash) \\\r\n  LJ_VMEVENT_##name##_, \\\r\n  LJ_VMEVENT_##name = ((LJ_VMEVENT_##name##_) & 7)|((hash) << 3)\r\n\r\n/* VM event IDs. */\r\ntypedef enum {\r\n  VMEVENT_DEF(BC,\t0x00003883),\r\n  VMEVENT_DEF(TRACE,\t0xb2d91467),\r\n  VMEVENT_DEF(RECORD,\t0x9284bf4f),\r\n  VMEVENT_DEF(TEXIT,\t0xb29df2b0),\r\n  LJ_VMEVENT__MAX\r\n} VMEvent;\r\n\r\n#ifdef LUAJIT_DISABLE_VMEVENT\r\n#define lj_vmevent_send(L, ev, args)\t\tUNUSED(L)\r\n#define lj_vmevent_send_(L, ev, args, post)\tUNUSED(L)\r\n#else\r\n#define lj_vmevent_send(L, ev, args) \\\r\n  if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \\\r\n    ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \\\r\n    if (argbase) { \\\r\n      args \\\r\n      lj_vmevent_call(L, argbase); \\\r\n    } \\\r\n  }\r\n#define lj_vmevent_send_(L, ev, args, post) \\\r\n  if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \\\r\n    ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \\\r\n    if (argbase) { \\\r\n      args \\\r\n      lj_vmevent_call(L, argbase); \\\r\n      post \\\r\n    } \\\r\n  }\r\n\r\nLJ_FUNC ptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev);\r\nLJ_FUNC void lj_vmevent_call(lua_State *L, ptrdiff_t argbase);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lj_vmmath.c",
    "content": "/*\r\n** Math helper functions for assembler VM.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_vmmath_c\r\n#define LUA_CORE\r\n\r\n#include <errno.h>\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Helper functions for generated machine code ------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n/* Wrapper functions to avoid linker issues on OSX. */\r\nLJ_FUNCA double lj_vm_sinh(double x) { return sinh(x); }\r\nLJ_FUNCA double lj_vm_cosh(double x) { return cosh(x); }\r\nLJ_FUNCA double lj_vm_tanh(double x) { return tanh(x); }\r\n#endif\r\n\r\n#if !LJ_TARGET_X86ORX64\r\ndouble lj_vm_foldarith(double x, double y, int op)\r\n{\r\n  switch (op) {\r\n  case IR_ADD - IR_ADD: return x+y; break;\r\n  case IR_SUB - IR_ADD: return x-y; break;\r\n  case IR_MUL - IR_ADD: return x*y; break;\r\n  case IR_DIV - IR_ADD: return x/y; break;\r\n  case IR_MOD - IR_ADD: return x-lj_vm_floor(x/y)*y; break;\r\n  case IR_POW - IR_ADD: return pow(x, y); break;\r\n  case IR_NEG - IR_ADD: return -x; break;\r\n  case IR_ABS - IR_ADD: return fabs(x); break;\r\n#if LJ_HASJIT\r\n  case IR_ATAN2 - IR_ADD: return atan2(x, y); break;\r\n  case IR_LDEXP - IR_ADD: return ldexp(x, (int)y); break;\r\n  case IR_MIN - IR_ADD: return x > y ? y : x; break;\r\n  case IR_MAX - IR_ADD: return x < y ? y : x; break;\r\n#endif\r\n  default: return x;\r\n  }\r\n}\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n\r\n#ifdef LUAJIT_NO_LOG2\r\ndouble lj_vm_log2(double a)\r\n{\r\n  return log(a) * 1.4426950408889634074;\r\n}\r\n#endif\r\n\r\n#ifdef LUAJIT_NO_EXP2\r\ndouble lj_vm_exp2(double a)\r\n{\r\n  return exp(a * 0.6931471805599453);\r\n}\r\n#endif\r\n\r\n#if !(LJ_TARGET_ARM || LJ_TARGET_PPC)\r\nint32_t LJ_FASTCALL lj_vm_modi(int32_t a, int32_t b)\r\n{\r\n  uint32_t y, ua, ub;\r\n  lua_assert(b != 0);  /* This must be checked before using this function. */\r\n  ua = a < 0 ? (uint32_t)-a : (uint32_t)a;\r\n  ub = b < 0 ? (uint32_t)-b : (uint32_t)b;\r\n  y = ua % ub;\r\n  if (y != 0 && (a^b) < 0) y = y - ub;\r\n  if (((int32_t)y^b) < 0) y = (uint32_t)-(int32_t)y;\r\n  return (int32_t)y;\r\n}\r\n#endif\r\n\r\n#if !LJ_TARGET_X86ORX64\r\n/* Unsigned x^k. */\r\nstatic double lj_vm_powui(double x, uint32_t k)\r\n{\r\n  double y;\r\n  lua_assert(k != 0);\r\n  for (; (k & 1) == 0; k >>= 1) x *= x;\r\n  y = x;\r\n  if ((k >>= 1) != 0) {\r\n    for (;;) {\r\n      x *= x;\r\n      if (k == 1) break;\r\n      if (k & 1) y *= x;\r\n      k >>= 1;\r\n    }\r\n    y *= x;\r\n  }\r\n  return y;\r\n}\r\n\r\n/* Signed x^k. */\r\ndouble lj_vm_powi(double x, int32_t k)\r\n{\r\n  if (k > 1)\r\n    return lj_vm_powui(x, (uint32_t)k);\r\n  else if (k == 1)\r\n    return x;\r\n  else if (k == 0)\r\n    return 1.0;\r\n  else\r\n    return 1.0 / lj_vm_powui(x, (uint32_t)-k);\r\n}\r\n\r\n/* Computes fpm(x) for extended math functions. */\r\ndouble lj_vm_foldfpm(double x, int fpm)\r\n{\r\n  switch (fpm) {\r\n  case IRFPM_FLOOR: return lj_vm_floor(x);\r\n  case IRFPM_CEIL: return lj_vm_ceil(x);\r\n  case IRFPM_TRUNC: return lj_vm_trunc(x);\r\n  case IRFPM_SQRT: return sqrt(x);\r\n  case IRFPM_EXP: return exp(x);\r\n  case IRFPM_EXP2: return lj_vm_exp2(x);\r\n  case IRFPM_LOG: return log(x);\r\n  case IRFPM_LOG2: return lj_vm_log2(x);\r\n  case IRFPM_LOG10: return log10(x);\r\n  case IRFPM_SIN: return sin(x);\r\n  case IRFPM_COS: return cos(x);\r\n  case IRFPM_TAN: return tan(x);\r\n  default: lua_assert(0);\r\n  }\r\n  return 0;\r\n}\r\n#endif\r\n\r\n#if LJ_HASFFI\r\nint lj_vm_errno(void)\r\n{\r\n  return errno;\r\n}\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/ljamalg.c",
    "content": "/*\r\n** LuaJIT core and libraries amalgamation.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/*\r\n+--------------------------------------------------------------------------+\r\n| WARNING: Compiling the amalgamation needs a lot of virtual memory        |\r\n| (around 300 MB with GCC 4.x)! If you don't have enough physical memory   |\r\n| your machine will start swapping to disk and the compile will not finish |\r\n| within a reasonable amount of time.                                      |\r\n| So either compile on a bigger machine or use the non-amalgamated build.  |\r\n+--------------------------------------------------------------------------+\r\n*/\r\n\r\n#define ljamalg_c\r\n#define LUA_CORE\r\n\r\n/* To get the mremap prototype. Must be defined before any system includes. */\r\n#if defined(__linux__) && !defined(_GNU_SOURCE)\r\n#define _GNU_SOURCE\r\n#endif\r\n\r\n#ifndef WINVER\r\n#define WINVER 0x0501\r\n#endif\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_gc.c\"\r\n#include \"lj_err.c\"\r\n#include \"lj_char.c\"\r\n#include \"lj_bc.c\"\r\n#include \"lj_obj.c\"\r\n#include \"lj_str.c\"\r\n#include \"lj_tab.c\"\r\n#include \"lj_func.c\"\r\n#include \"lj_udata.c\"\r\n#include \"lj_meta.c\"\r\n#include \"lj_debug.c\"\r\n#include \"lj_state.c\"\r\n#include \"lj_dispatch.c\"\r\n#include \"lj_vmevent.c\"\r\n#include \"lj_vmmath.c\"\r\n#include \"lj_strscan.c\"\r\n#include \"lj_api.c\"\r\n#include \"lj_lex.c\"\r\n#include \"lj_parse.c\"\r\n#include \"lj_bcread.c\"\r\n#include \"lj_bcwrite.c\"\r\n#include \"lj_load.c\"\r\n#include \"lj_ctype.c\"\r\n#include \"lj_cdata.c\"\r\n#include \"lj_cconv.c\"\r\n#include \"lj_ccall.c\"\r\n#include \"lj_ccallback.c\"\r\n#include \"lj_carith.c\"\r\n#include \"lj_clib.c\"\r\n#include \"lj_cparse.c\"\r\n#include \"lj_lib.c\"\r\n#include \"lj_ir.c\"\r\n#include \"lj_opt_mem.c\"\r\n#include \"lj_opt_fold.c\"\r\n#include \"lj_opt_narrow.c\"\r\n#include \"lj_opt_dce.c\"\r\n#include \"lj_opt_loop.c\"\r\n#include \"lj_opt_split.c\"\r\n#include \"lj_opt_sink.c\"\r\n#include \"lj_mcode.c\"\r\n#include \"lj_snap.c\"\r\n#include \"lj_record.c\"\r\n#include \"lj_crecord.c\"\r\n#include \"lj_ffrecord.c\"\r\n#include \"lj_asm.c\"\r\n#include \"lj_trace.c\"\r\n#include \"lj_gdbjit.c\"\r\n#include \"lj_alloc.c\"\r\n\r\n#include \"lib_aux.c\"\r\n#include \"lib_base.c\"\r\n#include \"lib_math.c\"\r\n#include \"lib_string.c\"\r\n#include \"lib_table.c\"\r\n#include \"lib_io.c\"\r\n#include \"lib_os.c\"\r\n#include \"lib_package.c\"\r\n#include \"lib_debug.c\"\r\n#include \"lib_bit.c\"\r\n#include \"lib_jit.c\"\r\n#include \"lib_ffi.c\"\r\n#include \"lib_init.c\"\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lua.h",
    "content": "/*\r\n** $Id: lua.h,v 1.218.1.5 2008/08/06 13:30:12 roberto Exp $\r\n** Lua - An Extensible Extension Language\r\n** Lua.org, PUC-Rio, Brazil (http://www.lua.org)\r\n** See Copyright Notice at the end of this file\r\n*/\r\n\r\n\r\n#ifndef lua_h\r\n#define lua_h\r\n\r\n#include <stdarg.h>\r\n#include <stddef.h>\r\n\r\n\r\n#include \"luaconf.h\"\r\n\r\n\r\n#define LUA_VERSION\t\"Lua 5.1\"\r\n#define LUA_RELEASE\t\"Lua 5.1.4\"\r\n#define LUA_VERSION_NUM\t501\r\n#define LUA_COPYRIGHT\t\"Copyright (C) 1994-2008 Lua.org, PUC-Rio\"\r\n#define LUA_AUTHORS\t\"R. Ierusalimschy, L. H. de Figueiredo & W. Celes\"\r\n\r\n\r\n/* mark for precompiled code (`<esc>Lua') */\r\n#define\tLUA_SIGNATURE\t\"\\033Lua\"\r\n\r\n/* option for multiple returns in `lua_pcall' and `lua_call' */\r\n#define LUA_MULTRET\t(-1)\r\n\r\n\r\n/*\r\n** pseudo-indices\r\n*/\r\n#define LUA_REGISTRYINDEX\t(-10000)\r\n#define LUA_ENVIRONINDEX\t(-10001)\r\n#define LUA_GLOBALSINDEX\t(-10002)\r\n#define lua_upvalueindex(i)\t(LUA_GLOBALSINDEX-(i))\r\n\r\n\r\n/* thread status; 0 is OK */\r\n#define LUA_YIELD\t1\r\n#define LUA_ERRRUN\t2\r\n#define LUA_ERRSYNTAX\t3\r\n#define LUA_ERRMEM\t4\r\n#define LUA_ERRERR\t5\r\n\r\n\r\ntypedef struct lua_State lua_State;\r\n\r\ntypedef int (*lua_CFunction) (lua_State *L);\r\n\r\n\r\n/*\r\n** functions that read/write blocks when loading/dumping Lua chunks\r\n*/\r\ntypedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);\r\n\r\ntypedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);\r\n\r\n\r\n/*\r\n** prototype for memory-allocation functions\r\n*/\r\ntypedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);\r\n\r\n\r\n/*\r\n** basic types\r\n*/\r\n#define LUA_TNONE\t\t(-1)\r\n\r\n#define LUA_TNIL\t\t0\r\n#define LUA_TBOOLEAN\t\t1\r\n#define LUA_TLIGHTUSERDATA\t2\r\n#define LUA_TNUMBER\t\t3\r\n#define LUA_TSTRING\t\t4\r\n#define LUA_TTABLE\t\t5\r\n#define LUA_TFUNCTION\t\t6\r\n#define LUA_TUSERDATA\t\t7\r\n#define LUA_TTHREAD\t\t8\r\n\r\n\r\n\r\n/* minimum Lua stack available to a C function */\r\n#define LUA_MINSTACK\t20\r\n\r\n\r\n/*\r\n** generic extra include file\r\n*/\r\n#if defined(LUA_USER_H)\r\n#include LUA_USER_H\r\n#endif\r\n\r\n\r\n/* type of numbers in Lua */\r\ntypedef LUA_NUMBER lua_Number;\r\n\r\n\r\n/* type for integer functions */\r\ntypedef LUA_INTEGER lua_Integer;\r\n\r\n\r\n\r\n/*\r\n** state manipulation\r\n*/\r\nLUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);\r\nLUA_API void       (lua_close) (lua_State *L);\r\nLUA_API lua_State *(lua_newthread) (lua_State *L);\r\n\r\nLUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);\r\n\r\n\r\n/*\r\n** basic stack manipulation\r\n*/\r\nLUA_API int   (lua_gettop) (lua_State *L);\r\nLUA_API void  (lua_settop) (lua_State *L, int idx);\r\nLUA_API void  (lua_pushvalue) (lua_State *L, int idx);\r\nLUA_API void  (lua_remove) (lua_State *L, int idx);\r\nLUA_API void  (lua_insert) (lua_State *L, int idx);\r\nLUA_API void  (lua_replace) (lua_State *L, int idx);\r\nLUA_API int   (lua_checkstack) (lua_State *L, int sz);\r\n\r\nLUA_API void  (lua_xmove) (lua_State *from, lua_State *to, int n);\r\n\r\n\r\n/*\r\n** access functions (stack -> C)\r\n*/\r\n\r\nLUA_API int             (lua_isnumber) (lua_State *L, int idx);\r\nLUA_API int             (lua_isstring) (lua_State *L, int idx);\r\nLUA_API int             (lua_iscfunction) (lua_State *L, int idx);\r\nLUA_API int             (lua_isuserdata) (lua_State *L, int idx);\r\nLUA_API int             (lua_type) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_typename) (lua_State *L, int tp);\r\n\r\nLUA_API int            (lua_equal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_rawequal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_lessthan) (lua_State *L, int idx1, int idx2);\r\n\r\nLUA_API lua_Number      (lua_tonumber) (lua_State *L, int idx);\r\nLUA_API lua_Integer     (lua_tointeger) (lua_State *L, int idx);\r\nLUA_API int             (lua_toboolean) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_tolstring) (lua_State *L, int idx, size_t *len);\r\nLUA_API size_t          (lua_objlen) (lua_State *L, int idx);\r\nLUA_API lua_CFunction   (lua_tocfunction) (lua_State *L, int idx);\r\nLUA_API void\t       *(lua_touserdata) (lua_State *L, int idx);\r\nLUA_API lua_State      *(lua_tothread) (lua_State *L, int idx);\r\nLUA_API const void     *(lua_topointer) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** push functions (C -> stack)\r\n*/\r\nLUA_API void  (lua_pushnil) (lua_State *L);\r\nLUA_API void  (lua_pushnumber) (lua_State *L, lua_Number n);\r\nLUA_API void  (lua_pushinteger) (lua_State *L, lua_Integer n);\r\nLUA_API void  (lua_pushlstring) (lua_State *L, const char *s, size_t l);\r\nLUA_API void  (lua_pushstring) (lua_State *L, const char *s);\r\nLUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt,\r\n                                                      va_list argp);\r\nLUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...);\r\nLUA_API void  (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);\r\nLUA_API void  (lua_pushboolean) (lua_State *L, int b);\r\nLUA_API void  (lua_pushlightuserdata) (lua_State *L, void *p);\r\nLUA_API int   (lua_pushthread) (lua_State *L);\r\n\r\n\r\n/*\r\n** get functions (Lua -> stack)\r\n*/\r\nLUA_API void  (lua_gettable) (lua_State *L, int idx);\r\nLUA_API void  (lua_getfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawget) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawgeti) (lua_State *L, int idx, int n);\r\nLUA_API void  (lua_createtable) (lua_State *L, int narr, int nrec);\r\nLUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);\r\nLUA_API int   (lua_getmetatable) (lua_State *L, int objindex);\r\nLUA_API void  (lua_getfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** set functions (stack -> Lua)\r\n*/\r\nLUA_API void  (lua_settable) (lua_State *L, int idx);\r\nLUA_API void  (lua_setfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawset) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawseti) (lua_State *L, int idx, int n);\r\nLUA_API int   (lua_setmetatable) (lua_State *L, int objindex);\r\nLUA_API int   (lua_setfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** `load' and `call' functions (load and run Lua code)\r\n*/\r\nLUA_API void  (lua_call) (lua_State *L, int nargs, int nresults);\r\nLUA_API int   (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);\r\nLUA_API int   (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud);\r\nLUA_API int   (lua_load) (lua_State *L, lua_Reader reader, void *dt,\r\n                                        const char *chunkname);\r\n\r\nLUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data);\r\n\r\n\r\n/*\r\n** coroutine functions\r\n*/\r\nLUA_API int  (lua_yield) (lua_State *L, int nresults);\r\nLUA_API int  (lua_resume) (lua_State *L, int narg);\r\nLUA_API int  (lua_status) (lua_State *L);\r\n\r\n/*\r\n** garbage-collection function and options\r\n*/\r\n\r\n#define LUA_GCSTOP\t\t0\r\n#define LUA_GCRESTART\t\t1\r\n#define LUA_GCCOLLECT\t\t2\r\n#define LUA_GCCOUNT\t\t3\r\n#define LUA_GCCOUNTB\t\t4\r\n#define LUA_GCSTEP\t\t5\r\n#define LUA_GCSETPAUSE\t\t6\r\n#define LUA_GCSETSTEPMUL\t7\r\n\r\nLUA_API int (lua_gc) (lua_State *L, int what, int data);\r\n\r\n\r\n/*\r\n** miscellaneous functions\r\n*/\r\n\r\nLUA_API int   (lua_error) (lua_State *L);\r\n\r\nLUA_API int   (lua_next) (lua_State *L, int idx);\r\n\r\nLUA_API void  (lua_concat) (lua_State *L, int n);\r\n\r\nLUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);\r\nLUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);\r\n\r\n\r\n\r\n/*\r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define lua_pop(L,n)\t\tlua_settop(L, -(n)-1)\r\n\r\n#define lua_newtable(L)\t\tlua_createtable(L, 0, 0)\r\n\r\n#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))\r\n\r\n#define lua_pushcfunction(L,f)\tlua_pushcclosure(L, (f), 0)\r\n\r\n#define lua_strlen(L,i)\t\tlua_objlen(L, (i))\r\n\r\n#define lua_isfunction(L,n)\t(lua_type(L, (n)) == LUA_TFUNCTION)\r\n#define lua_istable(L,n)\t(lua_type(L, (n)) == LUA_TTABLE)\r\n#define lua_islightuserdata(L,n)\t(lua_type(L, (n)) == LUA_TLIGHTUSERDATA)\r\n#define lua_isnil(L,n)\t\t(lua_type(L, (n)) == LUA_TNIL)\r\n#define lua_isboolean(L,n)\t(lua_type(L, (n)) == LUA_TBOOLEAN)\r\n#define lua_isthread(L,n)\t(lua_type(L, (n)) == LUA_TTHREAD)\r\n#define lua_isnone(L,n)\t\t(lua_type(L, (n)) == LUA_TNONE)\r\n#define lua_isnoneornil(L, n)\t(lua_type(L, (n)) <= 0)\r\n\r\n#define lua_pushliteral(L, s)\t\\\r\n\tlua_pushlstring(L, \"\" s, (sizeof(s)/sizeof(char))-1)\r\n\r\n#define lua_setglobal(L,s)\tlua_setfield(L, LUA_GLOBALSINDEX, (s))\r\n#define lua_getglobal(L,s)\tlua_getfield(L, LUA_GLOBALSINDEX, (s))\r\n\r\n#define lua_tostring(L,i)\tlua_tolstring(L, (i), NULL)\r\n\r\n\r\n\r\n/*\r\n** compatibility macros and functions\r\n*/\r\n\r\n#define lua_open()\tluaL_newstate()\r\n\r\n#define lua_getregistry(L)\tlua_pushvalue(L, LUA_REGISTRYINDEX)\r\n\r\n#define lua_getgccount(L)\tlua_gc(L, LUA_GCCOUNT, 0)\r\n\r\n#define lua_Chunkreader\t\tlua_Reader\r\n#define lua_Chunkwriter\t\tlua_Writer\r\n\r\n\r\n/* hack */\r\nLUA_API void lua_setlevel\t(lua_State *from, lua_State *to);\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Debug API\r\n** =======================================================================\r\n*/\r\n\r\n\r\n/*\r\n** Event codes\r\n*/\r\n#define LUA_HOOKCALL\t0\r\n#define LUA_HOOKRET\t1\r\n#define LUA_HOOKLINE\t2\r\n#define LUA_HOOKCOUNT\t3\r\n#define LUA_HOOKTAILRET 4\r\n\r\n\r\n/*\r\n** Event masks\r\n*/\r\n#define LUA_MASKCALL\t(1 << LUA_HOOKCALL)\r\n#define LUA_MASKRET\t(1 << LUA_HOOKRET)\r\n#define LUA_MASKLINE\t(1 << LUA_HOOKLINE)\r\n#define LUA_MASKCOUNT\t(1 << LUA_HOOKCOUNT)\r\n\r\ntypedef struct lua_Debug lua_Debug;  /* activation record */\r\n\r\n\r\n/* Functions to be called by the debuger in specific events */\r\ntypedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);\r\n\r\n\r\nLUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);\r\nLUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);\r\nLUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);\r\nLUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);\r\nLUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);\r\nLUA_API lua_Hook lua_gethook (lua_State *L);\r\nLUA_API int lua_gethookmask (lua_State *L);\r\nLUA_API int lua_gethookcount (lua_State *L);\r\n\r\n/* From Lua 5.2. */\r\nLUA_API void *lua_upvalueid (lua_State *L, int idx, int n);\r\nLUA_API void lua_upvaluejoin (lua_State *L, int idx1, int n1, int idx2, int n2);\r\nLUA_API int lua_loadx (lua_State *L, lua_Reader reader, void *dt,\r\n\t\t       const char *chunkname, const char *mode);\r\n\r\n\r\nstruct lua_Debug {\r\n  int event;\r\n  const char *name;\t/* (n) */\r\n  const char *namewhat;\t/* (n) `global', `local', `field', `method' */\r\n  const char *what;\t/* (S) `Lua', `C', `main', `tail' */\r\n  const char *source;\t/* (S) */\r\n  int currentline;\t/* (l) */\r\n  int nups;\t\t/* (u) number of upvalues */\r\n  int linedefined;\t/* (S) */\r\n  int lastlinedefined;\t/* (S) */\r\n  char short_src[LUA_IDSIZE]; /* (S) */\r\n  /* private part */\r\n  int i_ci;  /* active function */\r\n};\r\n\r\n/* }====================================================================== */\r\n\r\n\r\n/******************************************************************************\r\n* Copyright (C) 1994-2008 Lua.org, PUC-Rio.  All rights reserved.\r\n*\r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including\r\n* without limitation the rights to use, copy, modify, merge, publish,\r\n* distribute, sublicense, and/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject to\r\n* the following conditions:\r\n*\r\n* The above copyright notice and this permission notice shall be\r\n* included in all copies or substantial portions of the Software.\r\n*\r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n******************************************************************************/\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lua.hpp",
    "content": "// C++ wrapper for LuaJIT header files.\r\n\r\nextern \"C\" {\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n#include \"luajit.h\"\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/luaconf.h",
    "content": "/*\r\n** Configuration header.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef luaconf_h\r\n#define luaconf_h\r\n\r\n#ifndef WINVER\r\n#define WINVER 0x0501\r\n#endif\r\n#include <limits.h>\r\n#include <stddef.h>\r\n\r\n/* Default path for loading Lua and C modules with require(). */\r\n#if defined(_WIN32)\r\n/*\r\n** In Windows, any exclamation mark ('!') in the path is replaced by the\r\n** path of the directory of the executable file of the current process.\r\n*/\r\n#define LUA_LDIR\t\"!\\\\lua\\\\\"\r\n#define LUA_CDIR\t\"!\\\\\"\r\n#define LUA_PATH_DEFAULT \\\r\n  \".\\\\?.lua;\" LUA_LDIR\"?.lua;\" LUA_LDIR\"?\\\\init.lua;\"\r\n#define LUA_CPATH_DEFAULT \\\r\n  \".\\\\?.dll;\" LUA_CDIR\"?.dll;\" LUA_CDIR\"loadall.dll\"\r\n#else\r\n/*\r\n** Note to distribution maintainers: do NOT patch the following lines!\r\n** Please read ../doc/install.html#distro and pass PREFIX=/usr instead.\r\n*/\r\n#ifndef LUA_MULTILIB\r\n#define LUA_MULTILIB\t\"lib\"\r\n#endif\r\n#ifndef LUA_LMULTILIB\r\n#define LUA_LMULTILIB\t\"lib\"\r\n#endif\r\n#define LUA_LROOT\t\"/usr/local\"\r\n#define LUA_LUADIR\t\"/lua/5.1/\"\r\n#define LUA_LJDIR\t\"/luajit-2.0.4/\"\r\n\r\n#ifdef LUA_ROOT\r\n#define LUA_JROOT\tLUA_ROOT\r\n#define LUA_RLDIR\tLUA_ROOT \"/share\" LUA_LUADIR\r\n#define LUA_RCDIR\tLUA_ROOT \"/\" LUA_MULTILIB LUA_LUADIR\r\n#define LUA_RLPATH\t\";\" LUA_RLDIR \"?.lua;\" LUA_RLDIR \"?/init.lua\"\r\n#define LUA_RCPATH\t\";\" LUA_RCDIR \"?.so\"\r\n#else\r\n#define LUA_JROOT\tLUA_LROOT\r\n#define LUA_RLPATH\r\n#define LUA_RCPATH\r\n#endif\r\n\r\n#define LUA_JPATH\t\";\" LUA_JROOT \"/share\" LUA_LJDIR \"?.lua\"\r\n#define LUA_LLDIR\tLUA_LROOT \"/share\" LUA_LUADIR\r\n#define LUA_LCDIR\tLUA_LROOT \"/\" LUA_LMULTILIB LUA_LUADIR\r\n#define LUA_LLPATH\t\";\" LUA_LLDIR \"?.lua;\" LUA_LLDIR \"?/init.lua\"\r\n#define LUA_LCPATH1\t\";\" LUA_LCDIR \"?.so\"\r\n#define LUA_LCPATH2\t\";\" LUA_LCDIR \"loadall.so\"\r\n\r\n#define LUA_PATH_DEFAULT\t\"./?.lua\" LUA_JPATH LUA_LLPATH LUA_RLPATH\r\n#define LUA_CPATH_DEFAULT\t\"./?.so\" LUA_LCPATH1 LUA_RCPATH LUA_LCPATH2\r\n#endif\r\n\r\n/* Environment variable names for path overrides and initialization code. */\r\n#define LUA_PATH\t\"LUA_PATH\"\r\n#define LUA_CPATH\t\"LUA_CPATH\"\r\n#define LUA_INIT\t\"LUA_INIT\"\r\n\r\n/* Special file system characters. */\r\n#if defined(_WIN32)\r\n#define LUA_DIRSEP\t\"\\\\\"\r\n#else\r\n#define LUA_DIRSEP\t\"/\"\r\n#endif\r\n#define LUA_PATHSEP\t\";\"\r\n#define LUA_PATH_MARK\t\"?\"\r\n#define LUA_EXECDIR\t\"!\"\r\n#define LUA_IGMARK\t\"-\"\r\n#define LUA_PATH_CONFIG \\\r\n  LUA_DIRSEP \"\\n\" LUA_PATHSEP \"\\n\" LUA_PATH_MARK \"\\n\" \\\r\n  LUA_EXECDIR \"\\n\" LUA_IGMARK\r\n\r\n/* Quoting in error messages. */\r\n#define LUA_QL(x)\t\"'\" x \"'\"\r\n#define LUA_QS\t\tLUA_QL(\"%s\")\r\n\r\n/* Various tunables. */\r\n#define LUAI_MAXSTACK\t65500\t/* Max. # of stack slots for a thread (<64K). */\r\n#define LUAI_MAXCSTACK\t8000\t/* Max. # of stack slots for a C func (<10K). */\r\n#define LUAI_GCPAUSE\t200\t/* Pause GC until memory is at 200%. */\r\n#define LUAI_GCMUL\t200\t/* Run GC at 200% of allocation speed. */\r\n#define LUA_MAXCAPTURES\t32\t/* Max. pattern captures. */\r\n\r\n/* Compatibility with older library function names. */\r\n#define LUA_COMPAT_MOD\t\t/* OLD: math.mod, NEW: math.fmod */\r\n#define LUA_COMPAT_GFIND\t/* OLD: string.gfind, NEW: string.gmatch */\r\n\r\n/* Configuration for the frontend (the luajit executable). */\r\n#if defined(luajit_c)\r\n#define LUA_PROGNAME\t\"luajit\"  /* Fallback frontend name. */\r\n#define LUA_PROMPT\t\"> \"\t/* Interactive prompt. */\r\n#define LUA_PROMPT2\t\">> \"\t/* Continuation prompt. */\r\n#define LUA_MAXINPUT\t512\t/* Max. input line length. */\r\n#endif\r\n\r\n/* Note: changing the following defines breaks the Lua 5.1 ABI. */\r\n#define LUA_INTEGER\tptrdiff_t\r\n#define LUA_IDSIZE\t150\t/* Size of lua_Debug.short_src. */\r\n/*\r\n** Size of lauxlib and io.* on-stack buffers. Weird workaround to avoid using\r\n** unreasonable amounts of stack space, but still retain ABI compatibility.\r\n** Blame Lua for depending on BUFSIZ in the ABI, blame **** for wrecking it.\r\n*/\r\n#define LUAL_BUFFERSIZE\t(BUFSIZ > 16384 ? 8192 : BUFSIZ)\r\n\r\n/* The following defines are here only for compatibility with luaconf.h\r\n** from the standard Lua distribution. They must not be changed for LuaJIT.\r\n*/\r\n#define LUA_NUMBER_DOUBLE\r\n#define LUA_NUMBER\t\tdouble\r\n#define LUAI_UACNUMBER\t\tdouble\r\n#define LUA_NUMBER_SCAN\t\t\"%lf\"\r\n#define LUA_NUMBER_FMT\t\t\"%.14g\"\r\n#define lua_number2str(s, n)\tsprintf((s), LUA_NUMBER_FMT, (n))\r\n#define LUAI_MAXNUMBER2STR\t32\r\n#define LUA_INTFRMLEN\t\t\"l\"\r\n#define LUA_INTFRM_T\t\tlong\r\n\r\n/* Linkage of public API functions. */\r\n#if defined(LUA_BUILD_AS_DLL)\r\n#if defined(LUA_CORE) || defined(LUA_LIB)\r\n#define LUA_API\t\t__declspec(dllexport)\r\n#else\r\n#define LUA_API\t\t__declspec(dllimport)\r\n#endif\r\n#else\r\n#define LUA_API\t\textern\r\n#endif\r\n\r\n#define LUALIB_API\tLUA_API\r\n\r\n/* Support for internal assertions. */\r\n#if defined(LUA_USE_ASSERT) || defined(LUA_USE_APICHECK)\r\n#include <assert.h>\r\n#endif\r\n#ifdef LUA_USE_ASSERT\r\n#define lua_assert(x)\t\tassert(x)\r\n#endif\r\n#ifdef LUA_USE_APICHECK\r\n#define luai_apicheck(L, o)\t{ (void)L; assert(o); }\r\n#else\r\n#define luai_apicheck(L, o)\t{ (void)L; }\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/luajit.c",
    "content": "/*\r\n** LuaJIT frontend. Runs commands, scripts, read-eval-print (REPL) etc.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define luajit_c\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n#include \"luajit.h\"\r\n\r\n#include \"lj_arch.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <unistd.h>\r\n#define lua_stdin_is_tty()\tisatty(0)\r\n#elif LJ_TARGET_WINDOWS\r\n#include <io.h>\r\n#ifdef __BORLANDC__\r\n#define lua_stdin_is_tty()\tisatty(_fileno(stdin))\r\n#else\r\n#define lua_stdin_is_tty()\t_isatty(_fileno(stdin))\r\n#endif\r\n#else\r\n#define lua_stdin_is_tty()\t1\r\n#endif\r\n\r\n#if !LJ_TARGET_CONSOLE\r\n#include <signal.h>\r\n#endif\r\n\r\nstatic lua_State *globalL = NULL;\r\nstatic const char *progname = LUA_PROGNAME;\r\n\r\n#if !LJ_TARGET_CONSOLE\r\nstatic void lstop(lua_State *L, lua_Debug *ar)\r\n{\r\n  (void)ar;  /* unused arg. */\r\n  lua_sethook(L, NULL, 0, 0);\r\n  /* Avoid luaL_error -- a C hook doesn't add an extra frame. */\r\n  luaL_where(L, 0);\r\n  lua_pushfstring(L, \"%sinterrupted!\", lua_tostring(L, -1));\r\n  lua_error(L);\r\n}\r\n\r\nstatic void laction(int i)\r\n{\r\n  signal(i, SIG_DFL); /* if another SIGINT happens before lstop,\r\n\t\t\t terminate process (default action) */\r\n  lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);\r\n}\r\n#endif\r\n\r\nstatic void print_usage(void)\r\n{\r\n  fprintf(stderr,\r\n  \"usage: %s [options]... [script [args]...].\\n\"\r\n  \"Available options are:\\n\"\r\n  \"  -e chunk  Execute string \" LUA_QL(\"chunk\") \".\\n\"\r\n  \"  -l name   Require library \" LUA_QL(\"name\") \".\\n\"\r\n  \"  -b ...    Save or list bytecode.\\n\"\r\n  \"  -j cmd    Perform LuaJIT control command.\\n\"\r\n  \"  -O[opt]   Control LuaJIT optimizations.\\n\"\r\n  \"  -i        Enter interactive mode after executing \" LUA_QL(\"script\") \".\\n\"\r\n  \"  -v        Show version information.\\n\"\r\n  \"  -E        Ignore environment variables.\\n\"\r\n  \"  --        Stop handling options.\\n\"\r\n  \"  -         Execute stdin and stop handling options.\\n\"\r\n  ,\r\n  progname);\r\n  fflush(stderr);\r\n}\r\n\r\nstatic void l_message(const char *pname, const char *msg)\r\n{\r\n  if (pname) fprintf(stderr, \"%s: \", pname);\r\n  fprintf(stderr, \"%s\\n\", msg);\r\n  fflush(stderr);\r\n}\r\n\r\nstatic int report(lua_State *L, int status)\r\n{\r\n  if (status && !lua_isnil(L, -1)) {\r\n    const char *msg = lua_tostring(L, -1);\r\n    if (msg == NULL) msg = \"(error object is not a string)\";\r\n    l_message(progname, msg);\r\n    lua_pop(L, 1);\r\n  }\r\n  return status;\r\n}\r\n\r\nstatic int traceback(lua_State *L)\r\n{\r\n  if (!lua_isstring(L, 1)) { /* Non-string error object? Try metamethod. */\r\n    if (lua_isnoneornil(L, 1) ||\r\n\t!luaL_callmeta(L, 1, \"__tostring\") ||\r\n\t!lua_isstring(L, -1))\r\n      return 1;  /* Return non-string error object. */\r\n    lua_remove(L, 1);  /* Replace object by result of __tostring metamethod. */\r\n  }\r\n  luaL_traceback(L, L, lua_tostring(L, 1), 1);\r\n  return 1;\r\n}\r\n\r\nstatic int docall(lua_State *L, int narg, int clear)\r\n{\r\n  int status;\r\n  int base = lua_gettop(L) - narg;  /* function index */\r\n  lua_pushcfunction(L, traceback);  /* push traceback function */\r\n  lua_insert(L, base);  /* put it under chunk and args */\r\n#if !LJ_TARGET_CONSOLE\r\n  signal(SIGINT, laction);\r\n#endif\r\n  status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);\r\n#if !LJ_TARGET_CONSOLE\r\n  signal(SIGINT, SIG_DFL);\r\n#endif\r\n  lua_remove(L, base);  /* remove traceback function */\r\n  /* force a complete garbage collection in case of errors */\r\n  if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0);\r\n  return status;\r\n}\r\n\r\nstatic void print_version(void)\r\n{\r\n  fputs(LUAJIT_VERSION \" -- \" LUAJIT_COPYRIGHT \". \" LUAJIT_URL \"\\n\", stdout);\r\n}\r\n\r\nstatic void print_jit_status(lua_State *L)\r\n{\r\n  int n;\r\n  const char *s;\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit\");  /* Get jit.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_getfield(L, -1, \"status\");\r\n  lua_remove(L, -2);\r\n  n = lua_gettop(L);\r\n  lua_call(L, 0, LUA_MULTRET);\r\n  fputs(lua_toboolean(L, n) ? \"JIT: ON\" : \"JIT: OFF\", stdout);\r\n  for (n++; (s = lua_tostring(L, n)); n++) {\r\n    putc(' ', stdout);\r\n    fputs(s, stdout);\r\n  }\r\n  putc('\\n', stdout);\r\n}\r\n\r\nstatic int getargs(lua_State *L, char **argv, int n)\r\n{\r\n  int narg;\r\n  int i;\r\n  int argc = 0;\r\n  while (argv[argc]) argc++;  /* count total number of arguments */\r\n  narg = argc - (n + 1);  /* number of arguments to the script */\r\n  luaL_checkstack(L, narg + 3, \"too many arguments to script\");\r\n  for (i = n+1; i < argc; i++)\r\n    lua_pushstring(L, argv[i]);\r\n  lua_createtable(L, narg, n + 1);\r\n  for (i = 0; i < argc; i++) {\r\n    lua_pushstring(L, argv[i]);\r\n    lua_rawseti(L, -2, i - n);\r\n  }\r\n  return narg;\r\n}\r\n\r\nstatic int dofile(lua_State *L, const char *name)\r\n{\r\n  int status = luaL_loadfile(L, name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\nstatic int dostring(lua_State *L, const char *s, const char *name)\r\n{\r\n  int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\nstatic int dolibrary(lua_State *L, const char *name)\r\n{\r\n  lua_getglobal(L, \"require\");\r\n  lua_pushstring(L, name);\r\n  return report(L, docall(L, 1, 1));\r\n}\r\n\r\nstatic void write_prompt(lua_State *L, int firstline)\r\n{\r\n  const char *p;\r\n  lua_getfield(L, LUA_GLOBALSINDEX, firstline ? \"_PROMPT\" : \"_PROMPT2\");\r\n  p = lua_tostring(L, -1);\r\n  if (p == NULL) p = firstline ? LUA_PROMPT : LUA_PROMPT2;\r\n  fputs(p, stdout);\r\n  fflush(stdout);\r\n  lua_pop(L, 1);  /* remove global */\r\n}\r\n\r\nstatic int incomplete(lua_State *L, int status)\r\n{\r\n  if (status == LUA_ERRSYNTAX) {\r\n    size_t lmsg;\r\n    const char *msg = lua_tolstring(L, -1, &lmsg);\r\n    const char *tp = msg + lmsg - (sizeof(LUA_QL(\"<eof>\")) - 1);\r\n    if (strstr(msg, LUA_QL(\"<eof>\")) == tp) {\r\n      lua_pop(L, 1);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* else... */\r\n}\r\n\r\nstatic int pushline(lua_State *L, int firstline)\r\n{\r\n  char buf[LUA_MAXINPUT];\r\n  write_prompt(L, firstline);\r\n  if (fgets(buf, LUA_MAXINPUT, stdin)) {\r\n    size_t len = strlen(buf);\r\n    if (len > 0 && buf[len-1] == '\\n')\r\n      buf[len-1] = '\\0';\r\n    if (firstline && buf[0] == '=')\r\n      lua_pushfstring(L, \"return %s\", buf+1);\r\n    else\r\n      lua_pushstring(L, buf);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int loadline(lua_State *L)\r\n{\r\n  int status;\r\n  lua_settop(L, 0);\r\n  if (!pushline(L, 1))\r\n    return -1;  /* no input */\r\n  for (;;) {  /* repeat until gets a complete line */\r\n    status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), \"=stdin\");\r\n    if (!incomplete(L, status)) break;  /* cannot try to add lines? */\r\n    if (!pushline(L, 0))  /* no more input? */\r\n      return -1;\r\n    lua_pushliteral(L, \"\\n\");  /* add a new line... */\r\n    lua_insert(L, -2);  /* ...between the two lines */\r\n    lua_concat(L, 3);  /* join them */\r\n  }\r\n  lua_remove(L, 1);  /* remove line */\r\n  return status;\r\n}\r\n\r\nstatic void dotty(lua_State *L)\r\n{\r\n  int status;\r\n  const char *oldprogname = progname;\r\n  progname = NULL;\r\n  while ((status = loadline(L)) != -1) {\r\n    if (status == 0) status = docall(L, 0, 0);\r\n    report(L, status);\r\n    if (status == 0 && lua_gettop(L) > 0) {  /* any result to print? */\r\n      lua_getglobal(L, \"print\");\r\n      lua_insert(L, 1);\r\n      if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)\r\n\tl_message(progname,\r\n\t  lua_pushfstring(L, \"error calling \" LUA_QL(\"print\") \" (%s)\",\r\n\t\t\t      lua_tostring(L, -1)));\r\n    }\r\n  }\r\n  lua_settop(L, 0);  /* clear stack */\r\n  fputs(\"\\n\", stdout);\r\n  fflush(stdout);\r\n  progname = oldprogname;\r\n}\r\n\r\nstatic int handle_script(lua_State *L, char **argv, int n)\r\n{\r\n  int status;\r\n  const char *fname;\r\n  int narg = getargs(L, argv, n);  /* collect arguments */\r\n  lua_setglobal(L, \"arg\");\r\n  fname = argv[n];\r\n  if (strcmp(fname, \"-\") == 0 && strcmp(argv[n-1], \"--\") != 0)\r\n    fname = NULL;  /* stdin */\r\n  status = luaL_loadfile(L, fname);\r\n  lua_insert(L, -(narg+1));\r\n  if (status == 0)\r\n    status = docall(L, narg, 0);\r\n  else\r\n    lua_pop(L, narg);\r\n  return report(L, status);\r\n}\r\n\r\n/* Load add-on module. */\r\nstatic int loadjitmodule(lua_State *L)\r\n{\r\n  lua_getglobal(L, \"require\");\r\n  lua_pushliteral(L, \"jit.\");\r\n  lua_pushvalue(L, -3);\r\n  lua_concat(L, 2);\r\n  if (lua_pcall(L, 1, 1, 0)) {\r\n    const char *msg = lua_tostring(L, -1);\r\n    if (msg && !strncmp(msg, \"module \", 7))\r\n      goto nomodule;\r\n    return report(L, 1);\r\n  }\r\n  lua_getfield(L, -1, \"start\");\r\n  if (lua_isnil(L, -1)) {\r\n  nomodule:\r\n    l_message(progname,\r\n\t      \"unknown luaJIT command or jit.* modules not installed\");\r\n    return 1;\r\n  }\r\n  lua_remove(L, -2);  /* Drop module table. */\r\n  return 0;\r\n}\r\n\r\n/* Run command with options. */\r\nstatic int runcmdopt(lua_State *L, const char *opt)\r\n{\r\n  int narg = 0;\r\n  if (opt && *opt) {\r\n    for (;;) {  /* Split arguments. */\r\n      const char *p = strchr(opt, ',');\r\n      narg++;\r\n      if (!p) break;\r\n      if (p == opt)\r\n\tlua_pushnil(L);\r\n      else\r\n\tlua_pushlstring(L, opt, (size_t)(p - opt));\r\n      opt = p + 1;\r\n    }\r\n    if (*opt)\r\n      lua_pushstring(L, opt);\r\n    else\r\n      lua_pushnil(L);\r\n  }\r\n  return report(L, lua_pcall(L, narg, 0, 0));\r\n}\r\n\r\n/* JIT engine control command: try jit library first or load add-on module. */\r\nstatic int dojitcmd(lua_State *L, const char *cmd)\r\n{\r\n  const char *opt = strchr(cmd, '=');\r\n  lua_pushlstring(L, cmd, opt ? (size_t)(opt - cmd) : strlen(cmd));\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit\");  /* Get jit.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_pushvalue(L, -2);\r\n  lua_gettable(L, -2);  /* Lookup library function. */\r\n  if (!lua_isfunction(L, -1)) {\r\n    lua_pop(L, 2);  /* Drop non-function and jit.* table, keep module name. */\r\n    if (loadjitmodule(L))\r\n      return 1;\r\n  } else {\r\n    lua_remove(L, -2);  /* Drop jit.* table. */\r\n  }\r\n  lua_remove(L, -2);  /* Drop module name. */\r\n  return runcmdopt(L, opt ? opt+1 : opt);\r\n}\r\n\r\n/* Optimization flags. */\r\nstatic int dojitopt(lua_State *L, const char *opt)\r\n{\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit.opt\");  /* Get jit.opt.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_getfield(L, -1, \"start\");\r\n  lua_remove(L, -2);\r\n  return runcmdopt(L, opt);\r\n}\r\n\r\n/* Save or list bytecode. */\r\nstatic int dobytecode(lua_State *L, char **argv)\r\n{\r\n  int narg = 0;\r\n  lua_pushliteral(L, \"bcsave\");\r\n  if (loadjitmodule(L))\r\n    return 1;\r\n  if (argv[0][2]) {\r\n    narg++;\r\n    argv[0][1] = '-';\r\n    lua_pushstring(L, argv[0]+1);\r\n  }\r\n  for (argv++; *argv != NULL; narg++, argv++)\r\n    lua_pushstring(L, *argv);\r\n  return report(L, lua_pcall(L, narg, 0, 0));\r\n}\r\n\r\n/* check that argument has no extra characters at the end */\r\n#define notail(x)\t{if ((x)[2] != '\\0') return -1;}\r\n\r\n#define FLAGS_INTERACTIVE\t1\r\n#define FLAGS_VERSION\t\t2\r\n#define FLAGS_EXEC\t\t4\r\n#define FLAGS_OPTION\t\t8\r\n#define FLAGS_NOENV\t\t16\r\n\r\nstatic int collectargs(char **argv, int *flags)\r\n{\r\n  int i;\r\n  for (i = 1; argv[i] != NULL; i++) {\r\n    if (argv[i][0] != '-')  /* Not an option? */\r\n      return i;\r\n    switch (argv[i][1]) {  /* Check option. */\r\n    case '-':\r\n      notail(argv[i]);\r\n      return (argv[i+1] != NULL ? i+1 : 0);\r\n    case '\\0':\r\n      return i;\r\n    case 'i':\r\n      notail(argv[i]);\r\n      *flags |= FLAGS_INTERACTIVE;\r\n      /* fallthrough */\r\n    case 'v':\r\n      notail(argv[i]);\r\n      *flags |= FLAGS_VERSION;\r\n      break;\r\n    case 'e':\r\n      *flags |= FLAGS_EXEC;\r\n    case 'j':  /* LuaJIT extension */\r\n    case 'l':\r\n      *flags |= FLAGS_OPTION;\r\n      if (argv[i][2] == '\\0') {\r\n\ti++;\r\n\tif (argv[i] == NULL) return -1;\r\n      }\r\n      break;\r\n    case 'O': break;  /* LuaJIT extension */\r\n    case 'b':  /* LuaJIT extension */\r\n      if (*flags) return -1;\r\n      *flags |= FLAGS_EXEC;\r\n      return 0;\r\n    case 'E':\r\n      *flags |= FLAGS_NOENV;\r\n      break;\r\n    default: return -1;  /* invalid option */\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int runargs(lua_State *L, char **argv, int n)\r\n{\r\n  int i;\r\n  for (i = 1; i < n; i++) {\r\n    if (argv[i] == NULL) continue;\r\n    lua_assert(argv[i][0] == '-');\r\n    switch (argv[i][1]) {  /* option */\r\n    case 'e': {\r\n      const char *chunk = argv[i] + 2;\r\n      if (*chunk == '\\0') chunk = argv[++i];\r\n      lua_assert(chunk != NULL);\r\n      if (dostring(L, chunk, \"=(command line)\") != 0)\r\n\treturn 1;\r\n      break;\r\n      }\r\n    case 'l': {\r\n      const char *filename = argv[i] + 2;\r\n      if (*filename == '\\0') filename = argv[++i];\r\n      lua_assert(filename != NULL);\r\n      if (dolibrary(L, filename))\r\n\treturn 1;  /* stop if file fails */\r\n      break;\r\n      }\r\n    case 'j': {  /* LuaJIT extension */\r\n      const char *cmd = argv[i] + 2;\r\n      if (*cmd == '\\0') cmd = argv[++i];\r\n      lua_assert(cmd != NULL);\r\n      if (dojitcmd(L, cmd))\r\n\treturn 1;\r\n      break;\r\n      }\r\n    case 'O':  /* LuaJIT extension */\r\n      if (dojitopt(L, argv[i] + 2))\r\n\treturn 1;\r\n      break;\r\n    case 'b':  /* LuaJIT extension */\r\n      return dobytecode(L, argv+i);\r\n    default: break;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int handle_luainit(lua_State *L)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  const char *init = NULL;\r\n#else\r\n  const char *init = getenv(LUA_INIT);\r\n#endif\r\n  if (init == NULL)\r\n    return 0;  /* status OK */\r\n  else if (init[0] == '@')\r\n    return dofile(L, init+1);\r\n  else\r\n    return dostring(L, init, \"=\" LUA_INIT);\r\n}\r\n\r\nstatic struct Smain {\r\n  char **argv;\r\n  int argc;\r\n  int status;\r\n} smain;\r\n\r\nstatic int pmain(lua_State *L)\r\n{\r\n  struct Smain *s = &smain;\r\n  char **argv = s->argv;\r\n  int script;\r\n  int flags = 0;\r\n  globalL = L;\r\n  if (argv[0] && argv[0][0]) progname = argv[0];\r\n  LUAJIT_VERSION_SYM();  /* linker-enforced version check */\r\n  script = collectargs(argv, &flags);\r\n  if (script < 0) {  /* invalid args? */\r\n    print_usage();\r\n    s->status = 1;\r\n    return 0;\r\n  }\r\n  if ((flags & FLAGS_NOENV)) {\r\n    lua_pushboolean(L, 1);\r\n    lua_setfield(L, LUA_REGISTRYINDEX, \"LUA_NOENV\");\r\n  }\r\n  lua_gc(L, LUA_GCSTOP, 0);  /* stop collector during initialization */\r\n  luaL_openlibs(L);  /* open libraries */\r\n  lua_gc(L, LUA_GCRESTART, -1);\r\n  if (!(flags & FLAGS_NOENV)) {\r\n    s->status = handle_luainit(L);\r\n    if (s->status != 0) return 0;\r\n  }\r\n  if ((flags & FLAGS_VERSION)) print_version();\r\n  s->status = runargs(L, argv, (script > 0) ? script : s->argc);\r\n  if (s->status != 0) return 0;\r\n  if (script) {\r\n    s->status = handle_script(L, argv, script);\r\n    if (s->status != 0) return 0;\r\n  }\r\n  if ((flags & FLAGS_INTERACTIVE)) {\r\n    print_jit_status(L);\r\n    dotty(L);\r\n  } else if (script == 0 && !(flags & (FLAGS_EXEC|FLAGS_VERSION))) {\r\n    if (lua_stdin_is_tty()) {\r\n      print_version();\r\n      print_jit_status(L);\r\n      dotty(L);\r\n    } else {\r\n      dofile(L, NULL);  /* executes stdin as a file */\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n  int status;\r\n  lua_State *L = lua_open();  /* create state */\r\n  if (L == NULL) {\r\n    l_message(argv[0], \"cannot create state: not enough memory\");\r\n    return EXIT_FAILURE;\r\n  }\r\n  smain.argc = argc;\r\n  smain.argv = argv;\r\n  status = lua_cpcall(L, pmain, NULL);\r\n  report(L, status);\r\n  lua_close(L);\r\n  return (status || smain.status) ? EXIT_FAILURE : EXIT_SUCCESS;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/luajit.h",
    "content": "/*\r\n** LuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/\r\n**\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n**\r\n** Permission is hereby granted, free of charge, to any person obtaining\r\n** a copy of this software and associated documentation files (the\r\n** \"Software\"), to deal in the Software without restriction, including\r\n** without limitation the rights to use, copy, modify, merge, publish,\r\n** distribute, sublicense, and/or sell copies of the Software, and to\r\n** permit persons to whom the Software is furnished to do so, subject to\r\n** the following conditions:\r\n**\r\n** The above copyright notice and this permission notice shall be\r\n** included in all copies or substantial portions of the Software.\r\n**\r\n** THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n**\r\n** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n*/\r\n\r\n#ifndef _LUAJIT_H\r\n#define _LUAJIT_H\r\n\r\n#include \"lua.h\"\r\n\r\n#define LUAJIT_VERSION\t\t\"LuaJIT 2.0.4\"\r\n#define LUAJIT_VERSION_NUM\t20004  /* Version 2.0.4 = 02.00.04. */\r\n#define LUAJIT_VERSION_SYM\tluaJIT_version_2_0_4\r\n#define LUAJIT_COPYRIGHT\t\"Copyright (C) 2005-2015 Mike Pall\"\r\n#define LUAJIT_URL\t\t\"http://luajit.org/\"\r\n\r\n/* Modes for luaJIT_setmode. */\r\n#define LUAJIT_MODE_MASK\t0x00ff\r\n\r\nenum {\r\n  LUAJIT_MODE_ENGINE,\t\t/* Set mode for whole JIT engine. */\r\n  LUAJIT_MODE_DEBUG,\t\t/* Set debug mode (idx = level). */\r\n\r\n  LUAJIT_MODE_FUNC,\t\t/* Change mode for a function. */\r\n  LUAJIT_MODE_ALLFUNC,\t\t/* Recurse into subroutine protos. */\r\n  LUAJIT_MODE_ALLSUBFUNC,\t/* Change only the subroutines. */\r\n\r\n  LUAJIT_MODE_TRACE,\t\t/* Flush a compiled trace. */\r\n\r\n  LUAJIT_MODE_WRAPCFUNC = 0x10,\t/* Set wrapper mode for C function calls. */\r\n\r\n  LUAJIT_MODE_MAX\r\n};\r\n\r\n/* Flags or'ed in to the mode. */\r\n#define LUAJIT_MODE_OFF\t\t0x0000\t/* Turn feature off. */\r\n#define LUAJIT_MODE_ON\t\t0x0100\t/* Turn feature on. */\r\n#define LUAJIT_MODE_FLUSH\t0x0200\t/* Flush JIT-compiled code. */\r\n\r\n/* LuaJIT public C API. */\r\n\r\n/* Control the JIT engine. */\r\nLUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);\r\n\r\n/* Enforce (dynamic) linker error for version mismatches. Call from main. */\r\nLUA_API void LUAJIT_VERSION_SYM(void);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/lualib.h",
    "content": "/*\r\n** Standard library header.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LUALIB_H\r\n#define _LUALIB_H\r\n\r\n#include \"lua.h\"\r\n\r\n#define LUA_FILEHANDLE\t\"FILE*\"\r\n\r\n#define LUA_COLIBNAME\t\"coroutine\"\r\n#define LUA_MATHLIBNAME\t\"math\"\r\n#define LUA_STRLIBNAME\t\"string\"\r\n#define LUA_TABLIBNAME\t\"table\"\r\n#define LUA_IOLIBNAME\t\"io\"\r\n#define LUA_OSLIBNAME\t\"os\"\r\n#define LUA_LOADLIBNAME\t\"package\"\r\n#define LUA_DBLIBNAME\t\"debug\"\r\n#define LUA_BITLIBNAME\t\"bit\"\r\n#define LUA_JITLIBNAME\t\"jit\"\r\n#define LUA_FFILIBNAME\t\"ffi\"\r\n\r\nLUALIB_API int luaopen_base(lua_State *L);\r\nLUALIB_API int luaopen_math(lua_State *L);\r\nLUALIB_API int luaopen_string(lua_State *L);\r\nLUALIB_API int luaopen_table(lua_State *L);\r\nLUALIB_API int luaopen_io(lua_State *L);\r\nLUALIB_API int luaopen_os(lua_State *L);\r\nLUALIB_API int luaopen_package(lua_State *L);\r\nLUALIB_API int luaopen_debug(lua_State *L);\r\nLUALIB_API int luaopen_bit(lua_State *L);\r\nLUALIB_API int luaopen_jit(lua_State *L);\r\nLUALIB_API int luaopen_ffi(lua_State *L);\r\n\r\nLUALIB_API void luaL_openlibs(lua_State *L);\r\n\r\n#ifndef lua_assert\r\n#define lua_assert(x)\t((void)0)\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/msvcbuild.bat",
    "content": "@rem Script to build LuaJIT with MSVC.\r\n@rem Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n@rem\r\n@rem Either open a \"Visual Studio .NET Command Prompt\"\r\n@rem (Note that the Express Edition does not contain an x64 compiler)\r\n@rem -or-\r\n@rem Open a \"Windows SDK Command Shell\" and set the compiler environment:\r\n@rem     setenv /release /x86\r\n@rem   -or-\r\n@rem     setenv /release /x64\r\n@rem\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n\r\n@setlocal\r\n@set LJCOMPILE=cl /nologo /c /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set LJLIB=lib /nologo /nodefaultlib\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set LJDLLNAME=lua51.dll\r\n@set LJLIBNAME=lua51.lib\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@set DASMFLAGS=-D WIN -D JIT -D FFI -D P64\r\n@set LJARCH=x64\r\n@minilua\r\n@if errorlevel 8 goto :X64\r\n@set DASMFLAGS=-D WIN -D JIT -D FFI\r\n@set LJARCH=x86\r\n:X64\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_x86.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m peobj -o lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% /Zi\r\n@set LJLINK=%LJLINK% /debug\r\n:NODEBUG\r\n@if \"%1\"==\"amalg\" goto :AMALGDLL\r\n@if \"%1\"==\"static\" goto :STATIC\r\n%LJCOMPILE% /MT /DLUA_BUILD_AS_DLL lj_*.c lib_*.c slua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /DLL /out:%LJDLLNAME% lj_*.obj lib_*.obj slua.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :MTDLL\r\n:STATIC\r\n%LJCOMPILE% lj_*.c lib_*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:%LJLIBNAME% lj_*.obj lib_*.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :MTDLL\r\n:AMALGDLL\r\n%LJCOMPILE% /MT /DLUA_BUILD_AS_DLL ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /DLL /out:%LJDLLNAME% ljamalg.obj lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\n:MTDLL\r\nif exist %LJDLLNAME%.manifest^\r\n  %LJMT% -manifest %LJDLLNAME%.manifest -outputresource:%LJDLLNAME%;2\r\n\r\n%LJCOMPILE% luajit.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:luajit.exe luajit.obj %LJLIBNAME%\r\n@if errorlevel 1 goto :BAD\r\nif exist luajit.exe.manifest^\r\n  %LJMT% -manifest luajit.exe.manifest -outputresource:luajit.exe\r\n\r\n@del *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for Windows/%LJARCH% ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo You must open a \"Visual Studio .NET Command Prompt\" to run this script\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/ps4build.bat",
    "content": "@rem Script to build LuaJIT with the PS4 SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (64 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined SCE_ORBIS_SDK_DIR goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Check for 64 bit host compiler.\r\n@minilua\r\n@if not errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D P64\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_x86.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_X64 -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m elfasm -o lj_vm.s\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%SCE_ORBIS_SDK_DIR%\\host_tools\\bin\\orbis-clang\" -c -Wall -DLUAJIT_DISABLE_FFI\r\n@set LJLIB=\"%SCE_ORBIS_SDK_DIR%\\host_tools\\bin\\orbis-ar\" rcus\r\n@set INCLUDE=\"\"\r\n\r\norbis-as -o lj_vm.o lj_vm.s\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% -g -O0\r\n@set TARGETLIB=libluajitD.a\r\ngoto :BUILD\r\n:NODEBUG\r\n@set LJCOMPILE=%LJCOMPILE% -O2\r\n@set TARGETLIB=libluajit.a\r\n:BUILD\r\ndel %TARGETLIB%\r\n@if \"%1\"==\"amalg\" goto :AMALG\r\nfor %%f in (lj_*.c lib_*.c) do (\r\n  %LJCOMPILE% %%f\r\n  @if errorlevel 1 goto :BAD\r\n)\r\n\r\n%LJLIB% %TARGETLIB% lj_*.o lib_*.o\r\n@if errorlevel 1 goto :BAD\r\n@goto :NOAMALG\r\n:AMALG\r\n%LJCOMPILE% ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% %TARGETLIB% ljamalg.o lj_vm.o\r\n@if errorlevel 1 goto :BAD\r\n:NOAMALG\r\n\r\n@del *.o *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for PS4 ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (64 bit host compiler). The PS4 Orbis SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/psvitabuild.bat",
    "content": "@rem Script to build LuaJIT with the PS Vita SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (32 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined SCE_PSP2_SDK_DIR goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Check for 32 bit host compiler.\r\n@minilua\r\n@if errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D FPU -D HFABI\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_arm.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_ARM -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLJ_TARGET_PSVITA=1 host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m elfasm -o lj_vm.s\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2snc\" -c -w -DLUAJIT_DISABLE_FFI -DLUAJIT_USE_SYSMALLOC\r\n@set LJLIB=\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2ld32\" -r --output=\r\n@set INCLUDE=\"\"\r\n\r\n\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2as\" -o lj_vm.o lj_vm.s\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% -g -O0\r\n@set TARGETLIB=libluajitD.a\r\ngoto :BUILD\r\n:NODEBUG\r\n@set LJCOMPILE=%LJCOMPILE% -O2\r\n@set TARGETLIB=libluajit.a\r\n:BUILD\r\ndel %TARGETLIB%\r\n\r\n%LJCOMPILE% ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB%%TARGETLIB% ljamalg.o lj_vm.o\r\n@if errorlevel 1 goto :BAD\r\n\r\n@del *.o *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for PS Vita ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (32 bit host compiler). The PS Vita SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/slua.c",
    "content": "// The MIT License (MIT)\r\n\r\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\r\n// \r\n// Permission is hereby granted, free of charge, to any person obtaining a copy\r\n// of this software and associated documentation files (the \"Software\"), to deal\r\n// in the Software without restriction, including without limitation the rights\r\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n// copies of the Software, and to permit persons to whom the Software is\r\n// furnished to do so, subject to the following conditions:\r\n// \r\n// The above copyright notice and this permission notice shall be included in\r\n// all copies or substantial portions of the Software.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n// THE SOFTWARE.\r\n\r\n\r\n#define MT_VEC2 1\r\n#define MT_VEC3 2\r\n#define MT_VEC4 3\r\n#define MT_Q\t4\r\n#define MT_COLOR\t5\r\n\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include <stdio.h>\r\n#include <string.h>\r\n\r\n#ifdef _WIN32\r\n#include <float.h>\r\n#define isnan _isnan\r\n#define snprintf _snprintf\r\n#else\r\n#include <math.h>\r\n#endif\r\n\r\nstatic const luaL_Reg s_lib_preload[] = {\r\n\t// { \"lpeg\", luaopen_lpeg },\r\n\t// { \"pb\",    luaopen_pb }, // any 3rd lualibs added here\r\n\t\t{ NULL, NULL }\r\n};\r\n\r\n#if LUA_VERSION_NUM >= 503\r\n\r\nstatic const char *luaL_findtable(lua_State *L, int idx,\r\n\tconst char *fname, int szhint) {\r\n\tconst char *e;\r\n\tif (idx) lua_pushvalue(L, idx);\r\n\tdo {\r\n\t\te = strchr(fname, '.');\r\n\t\tif (e == NULL) e = fname + strlen(fname);\r\n\t\tlua_pushlstring(L, fname, e - fname);\r\n\t\tif (lua_rawget(L, -2) == LUA_TNIL) {  /* no such field? */\r\n\t\t\tlua_pop(L, 1);  /* remove this nil */\r\n\t\t\tlua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */\r\n\t\t\tlua_pushlstring(L, fname, e - fname);\r\n\t\t\tlua_pushvalue(L, -2);\r\n\t\t\tlua_settable(L, -4);  /* set new table into field */\r\n\t\t}\r\n\t\telse if (!lua_istable(L, -1)) {  /* field has a non-table value? */\r\n\t\t\tlua_pop(L, 2);  /* remove table and value */\r\n\t\t\treturn fname;  /* return problematic part of the name */\r\n\t\t}\r\n\t\tlua_remove(L, -2);  /* remove previous table */\r\n\t\tfname = e + 1;\r\n\t} while (*e == '.');\r\n\treturn NULL;\r\n}\r\n\r\n#else\r\n\r\nstatic int lua_absindex(lua_State *L, int index) {\r\n\treturn index > 0 ? index : lua_gettop(L) + index + 1;\r\n}\r\n\r\n#endif\r\n\r\n\r\n\r\nLUA_API void luaS_openextlibs(lua_State *L) {\r\n\tconst luaL_Reg *lib;\r\n\r\n\tluaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\",\r\n\t\tsizeof(s_lib_preload) / sizeof(s_lib_preload[0]) - 1);\r\n\r\n\tfor (lib = s_lib_preload; lib->func; lib++) {\r\n\t\tlua_pushcfunction(L, lib->func);\r\n\t\tlua_setfield(L, -2, lib->name);\r\n\t}\r\n\r\n\tlua_pop(L, 1);\r\n}\r\n\r\nLUA_API void luaS_newuserdata(lua_State *L, int val)\r\n{\r\n\tint* pointer = (int*)lua_newuserdata(L, sizeof(int));\r\n\t*pointer = val;\r\n}\r\n\r\nLUA_API int luaS_rawnetobj(lua_State *L, int index)\r\n{\r\n\tint *ud;\r\n\r\n\tif (lua_istable(L, index))\r\n\t{\r\n\t\tlua_pushvalue(L, index);\r\n\t\twhile (lua_istable(L, -1))\r\n\t\t{\r\n\t\t\tlua_pushstring(L, \"__base\");\r\n\t\t\tlua_rawget(L, -2);\r\n\t\t\tlua_remove(L, -2);\r\n\t\t}\r\n\t\tif (lua_isuserdata(L, -1) > 0)\r\n\t\t\tlua_replace(L, index);\r\n\t\telse\r\n\t\t\treturn -1;\r\n\t}\r\n\r\n\tud = lua_touserdata(L, index);\r\n\treturn (ud != NULL)?*ud:-1;\r\n}\r\n\r\nLUA_API void luaS_pushuserdata(lua_State *L, void* ptr)\r\n{\r\n\tvoid** pointer = (void**)lua_newuserdata(L, sizeof(void*));\r\n\t*pointer = ptr;\r\n}\r\n\r\n\r\nLUA_API const char* luaS_tolstring32(lua_State *L, int index, int* len) {\r\n\tsize_t l;\r\n\tconst char* ret = lua_tolstring(L, index, &l);\r\n\t*len = (int)l;\r\n\treturn ret;\r\n}\r\n\r\n#if LUA_VERSION_NUM>=503\r\nstatic int k(lua_State *L, int status, lua_KContext ctx) {\r\n\treturn status;\r\n}\r\n\r\nLUA_API int luaS_yield(lua_State *L, int nrets) {\r\n\treturn k(L, lua_yieldk(L, nrets, 0, k), 0);\r\n}\r\n\r\nLUA_API int luaS_pcall(lua_State *L, int nargs, int nresults, int err) {\r\n\treturn k(L, lua_pcallk(L, nargs, nresults, err, 0, k), 0);\r\n}\r\n#endif\r\n\r\n\r\n\r\nstatic void getmetatable(lua_State *L, const char* key) {\r\n\tchar ns[256];\r\n\tsnprintf(ns, 256, \"UnityEngine.%s.Instance\", key);\r\n\r\n\tlua_getglobal(L, ns);\r\n}\r\n\r\nstatic void setmetatable(lua_State *L, int p, int what) {\r\n\r\n\tint ref;\r\n\t\r\n#if LUA_VERSION_NUM>=503\r\n\tlua_pushglobaltable(L);\r\n\tlua_rawgeti(L, -1, what);\r\n\tlua_remove(L, -2);\r\n#else\r\n\tlua_rawgeti(L, LUA_GLOBALSINDEX, what);\r\n#endif\r\n\tif (!lua_isnil(L, -1)) {\r\n\t\tref = (int)lua_tointeger(L, -1);\r\n\t\tlua_pop(L, 1);\r\n\t\tif (ref != LUA_REFNIL)\r\n\t\t{\r\n\t\t\tlua_rawgeti(L, LUA_REGISTRYINDEX, ref);\r\n\t\t}\r\n\t}\r\n\telse {\r\n\t\tlua_pop(L, 1);\r\n\r\n\t\tswitch (what) {\r\n\t\tcase MT_VEC2:\r\n\t\t\tgetmetatable(L, \"Vector2\");\r\n\t\t\tbreak;\r\n\t\tcase MT_VEC3:\r\n\t\t\tgetmetatable(L, \"Vector3\");\r\n\t\t\tbreak;\r\n\t\tcase MT_VEC4:\r\n\t\t\tgetmetatable(L, \"Vector4\");\r\n\t\t\tbreak;\r\n\t\tcase MT_Q:\r\n\t\t\tgetmetatable(L, \"Quaternion\");\r\n\t\t\tbreak;\r\n\t\tcase MT_COLOR:\r\n\t\t\tgetmetatable(L, \"Color\");\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tlua_pushvalue(L, -1);\r\n\t\tref = luaL_ref(L, LUA_REGISTRYINDEX);\r\n#if LUA_VERSION_NUM >= 503\r\n\t\tlua_pushglobaltable(L);\r\n\t\tlua_pushinteger(L, ref);\r\n\t\tlua_rawseti(L, -2, what);\r\n\t\tlua_pop(L, 1);\r\n#else\r\n\t\tlua_pushinteger(L, ref);\r\n\t\tlua_rawseti(L, LUA_GLOBALSINDEX, what);\r\n#endif\r\n\t}\r\n\r\n\tlua_setmetatable(L, p);\r\n}\r\n\r\n\r\n\r\nLUA_API int luaS_checkluatype(lua_State *L, int p, const char *t) {\r\n\tint top;\r\n\tconst char* b;\r\n\r\n\tp=lua_absindex(L,p);\r\n\tif (lua_type(L, p) != LUA_TTABLE)\r\n\t\treturn 0;\r\n\ttop = lua_gettop(L);\r\n\tif (lua_getmetatable(L, p) == 0)\r\n\t\treturn 0;\r\n\r\n\tlua_pushstring(L, \"__typename\");\r\n\tlua_rawget(L, -2);\r\n\tif (lua_isnil(L, -1))\r\n\t{\r\n\t\tlua_settop(L, top);\r\n\t\treturn 0;\r\n\t}\r\n\tif (t != NULL) {\r\n\t\tb = lua_tostring(L, -1);\r\n\t\tlua_settop(L, top);\r\n\t\treturn strcmp(t, b) == 0;\r\n\t}\r\n\tlua_settop(L, top);\r\n\treturn 1;\r\n}\r\n\r\n\r\nLUA_API int luaS_checkVector4(lua_State *L, int p, float* x, float *y, float *z, float *w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector4(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_VEC4);\r\n}\r\n\r\nLUA_API int luaS_checkVector3(lua_State *L, int p, float* x, float *y, float *z) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tluaL_checktype(L, p, LUA_TTABLE);\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 3);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector3(lua_State *L, float x, float y, float z) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tsetmetatable(L, -2, MT_VEC3);\r\n}\r\n\r\nLUA_API int luaS_checkVector2(lua_State *L, int p, float* x, float *y) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 2);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector2(lua_State *L, float x, float y) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tsetmetatable(L, -2, MT_VEC2);\r\n}\r\n\r\nLUA_API int luaS_checkQuaternion(lua_State *L, int p, float* x, float *y, float *z, float* w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API int luaS_checkColor(lua_State *L, int p, float* x, float *y, float *z, float* w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushQuaternion(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_Q);\r\n}\r\n\r\nLUA_API void luaS_pushColor(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_COLOR);\r\n}\r\n\r\n\r\n\r\nstatic void setelement(lua_State* L, int p, float v, const char* key) {\r\n\tif (!isnan(v)) {\r\n\t\tlua_pushstring(L, key);\r\n\t\tlua_pushnumber(L, v);\r\n\t\tlua_settable(L, p);\r\n\t}\r\n}\r\n\r\n\r\nstatic void setelementid(lua_State* L, int p, float v, int id) {\r\n\tif (!isnan(v)) {\r\n\t\tlua_pushnumber(L, v);\r\n\t\tlua_rawseti(L, p, id);\r\n\t}\r\n}\r\n\r\nLUA_API void luaS_setDataVec(lua_State *L, int p, float x, float y, float z, float w) {\r\n\tp=lua_absindex(L,p);\r\n\tsetelementid(L, p, x, 1);\r\n\tsetelementid(L, p, y, 2);\r\n\tsetelementid(L, p, z, 3);\r\n\tsetelementid(L, p, w, 4);\r\n}\r\n\r\nLUA_API void luaS_setColor(lua_State *L, int p, float x, float y, float z, float w) {\r\n\tp=lua_absindex(L,p);\r\n\tsetelement(L, p, x, \"r\");\r\n\tsetelement(L, p, y, \"g\");\r\n\tsetelement(L, p, z, \"b\");\r\n\tsetelement(L, p, w, \"a\");\r\n}\r\n\r\nstatic void cacheud(lua_State *l, int index, int cref) {\r\n\tlua_rawgeti(l, LUA_REGISTRYINDEX, cref);\r\n\tlua_pushvalue(l, -2);\r\n\tlua_rawseti(l, -2, index);\r\n\tlua_pop(l, 1);\r\n}\r\n\r\n\r\nLUA_API int luaS_pushobject(lua_State *l, int index, const char* t, int gco, int cref) {\r\n\r\n\tint is_reflect = 0;\r\n\r\n\tluaS_newuserdata(l, index);\r\n\tif (gco) cacheud(l, index, cref);\r\n\r\n\r\n\tluaL_getmetatable(l, t);\r\n\tif (lua_isnil(l, -1))\r\n\t{\r\n\t\tlua_pop(l, 1);\r\n\t\tluaL_getmetatable(l, \"LuaVarObject\");\r\n\t\tis_reflect = 1;\r\n\t}\r\n\r\n\tlua_setmetatable(l, -2);\r\n\treturn is_reflect;\r\n}\r\n\r\nLUA_API int luaS_getcacheud(lua_State *l, int index, int cref) {\r\n\tlua_rawgeti(l, LUA_REGISTRYINDEX, cref);\r\n\tlua_rawgeti(l, -1, index);\r\n\tif (!lua_isnil(l, -1))\r\n\t{\r\n\t\tlua_remove(l, -2);\r\n\t\treturn 1;\r\n\t}\r\n\tlua_pop(l, 2);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API int luaS_subclassof(lua_State *l, int p, const char* t) {\r\n\r\n\tconst char* tname;\r\n\tint ok;\r\n\tint top = lua_gettop(l);\r\n\r\n\tlua_pushvalue(l, p);\r\n\twhile (lua_istable(l, -1))\r\n\t{\r\n\t\tlua_pushstring(l, \"__base\");\r\n\t\tlua_rawget(l, -2);\r\n\t}\r\n\r\n\tif (lua_isnil(l, -1)) {\r\n\t\tlua_settop(l, top);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tif (t != NULL) {\r\n\t\tlua_getmetatable(l, -1);\r\n\t\tlua_getfield(l, -1, \"__typename\");\r\n\t\ttname = lua_tostring(l, -1);\r\n\t\tok = strcmp(tname, t);\r\n\t\tlua_settop(l, top);\r\n\t\treturn ok == 0;\r\n\t}\r\n\treturn 1;\r\n}\r\n\r\n\r\n#if LUA_VERSION_NUM>=502\r\nLUALIB_API int luaS_rawlen(lua_State *L, int idx)\r\n{\r\n\tsize_t ret = lua_rawlen(L, idx);\r\n\treturn (int)ret;\r\n}\r\n#else\r\nLUALIB_API int luaS_objlen(lua_State *L, int idx)\r\n{\r\n\tsize_t ret = lua_objlen(L, idx);\r\n\treturn (int)ret;\r\n}\r\n#endif\r\n\r\n\r\nLUALIB_API void  luaS_pushlstring(lua_State *L, const char *s, int l)\r\n{\r\n\tlua_pushlstring(L, s, (size_t)l);\r\n}\r\n\r\nLUALIB_API int luaLS_loadbuffer(lua_State *L, const char *buff, int sz, const char *name)\r\n{\r\n\treturn luaL_loadbuffer(L, buff, (size_t)sz, name);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/vm_arm.dasc",
    "content": "|// Low-level VM code for ARM CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch arm\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|\r\n|// The following must be C callee-save.\r\n|.define MASKR8,\tr4\t// 255*8 constant for fast bytecode decoding.\r\n|.define KBASE,\t\tr5\t// Constants of current Lua function.\r\n|.define PC,\t\tr6\t// Next PC.\r\n|.define DISPATCH,\tr7\t// Opcode dispatch table.\r\n|.define LREG,\t\tr8\t// Register holding lua_State (also in SAVE_L).\r\n|\r\n|// C callee-save in EABI, but often refetched. Temporary in iOS 3.0+.\r\n|.define BASE,\t\tr9\t// Base of current Lua stack frame.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA/RC.\r\n|.define RA,\t\tr10\t// Callee-save.\r\n|.define RC,\t\tr11\t// Callee-save.\r\n|.define RB,\t\tr12\r\n|.define OP,\t\tr12\t// Overlaps RB, must not be lr.\r\n|.define INS,\t\tlr\r\n|\r\n|// Calling conventions. Also used as temporaries.\r\n|.define CARG1,\t\tr0\r\n|.define CARG2,\t\tr1\r\n|.define CARG3,\t\tr2\r\n|.define CARG4,\t\tr3\r\n|.define CARG12,\tr0\t// For 1st soft-fp double.\r\n|.define CARG34,\tr2\t// For 2nd soft-fp double.\r\n|\r\n|.define CRET1,\t\tr0\r\n|.define CRET2,\t\tr1\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.define SAVE_R4,\t[sp, #28]\r\n|.define CFRAME_SPACE,\t#28\r\n|.define SAVE_ERRF,\t[sp, #24]\r\n|.define SAVE_NRES,\t[sp, #20]\r\n|.define SAVE_CFRAME,\t[sp, #16]\r\n|.define SAVE_L,\t[sp, #12]\r\n|.define SAVE_PC,\t[sp, #8]\r\n|.define SAVE_MULTRES,\t[sp, #4]\r\n|.define ARG5,\t\t[sp]\r\n|\r\n|.define TMPDhi,\t[sp, #4]\r\n|.define TMPDlo,\t[sp]\r\n|.define TMPD,\t\t[sp]\r\n|.define TMPDp,\t\tsp\r\n|\r\n|.if FPU\r\n|.macro saveregs\r\n|  push {r5, r6, r7, r8, r9, r10, r11, lr}\r\n|  vpush {d8-d15}\r\n|  sub sp, sp, CFRAME_SPACE+4\r\n|  str r4, SAVE_R4\r\n|.endmacro\r\n|.macro restoreregs_ret\r\n|  ldr r4, SAVE_R4\r\n|  add sp, sp, CFRAME_SPACE+4\r\n|  vpop {d8-d15}\r\n|  pop {r5, r6, r7, r8, r9, r10, r11, pc}\r\n|.endmacro\r\n|.else\r\n|.macro saveregs\r\n|  push {r4, r5, r6, r7, r8, r9, r10, r11, lr}\r\n|  sub sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro restoreregs_ret\r\n|  add sp, sp, CFRAME_SPACE\r\n|  pop {r4, r5, r6, r7, r8, r9, r10, r11, pc}\r\n|.endmacro\r\n|.endif\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; ud; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_FUNC,\t#-8\r\n|.define FRAME_PC,\t#-4\r\n|\r\n|.macro decode_RA8, dst, ins; and dst, MASKR8, ins, lsr #5; .endmacro\r\n|.macro decode_RB8, dst, ins; and dst, MASKR8, ins, lsr #21; .endmacro\r\n|.macro decode_RC8, dst, ins; and dst, MASKR8, ins, lsr #13; .endmacro\r\n|.macro decode_RD, dst, ins; lsr dst, ins, #16; .endmacro\r\n|.macro decode_OP, dst, ins; and dst, ins, #255; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  ldrb OP, [PC]\r\n|.endmacro\r\n|.macro ins_NEXT2\r\n|   ldr INS, [PC], #4\r\n|.endmacro\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT3\r\n|  ldr OP, [DISPATCH, OP, lsl #2]\r\n|   decode_RA8 RA, INS\r\n|   decode_RD RC, INS\r\n|  bx OP\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|  ins_NEXT3\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|  .define ins_next3, ins_NEXT3\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|  .endmacro\r\n|  .macro ins_next3\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Avoid register name substitution for field name.\r\n#define field_pc\tpc\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  ldr PC, LFUNC:CARG3->field_pc\r\n|  ldrb OP, [PC]  // STALL: load PC. early PC.\r\n|   ldr INS, [PC], #4\r\n|  ldr OP, [DISPATCH, OP, lsl #2]  // STALL: load OP. early OP.\r\n|   decode_RA8 RA, INS\r\n|   add RA, RA, BASE\r\n|  bx OP\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  str PC, [BASE, FRAME_PC]\r\n|  ins_callt  // STALL: locked PC.\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checktp, reg, tp; cmn reg, #-tp; .endmacro\r\n|.macro checktpeq, reg, tp; cmneq reg, #-tp; .endmacro\r\n|.macro checktpne, reg, tp; cmnne reg, #-tp; .endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR; bne target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB; bne target; .endmacro\r\n|.macro checkfunc, reg, target; checktp reg, LJ_TFUNC; bne target; .endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotcheck, delta\r\n|  lsr CARG1, PC, #1\r\n|  and CARG1, CARG1, #126\r\n|  sub CARG1, CARG1, #-GG_DISP2HOT\r\n|  ldrh CARG2, [DISPATCH, CARG1]\r\n|  subs CARG2, CARG2, #delta\r\n|  strh CARG2, [DISPATCH, CARG1]\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP\r\n|  blo ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL\r\n|  blo ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro mv_vmstate, reg, st; mvn reg, #LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate, reg; str reg, [DISPATCH, #DISPATCH_GL(vmstate)]; .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  ldr tmp, [DISPATCH, #DISPATCH_GL(gc.grayagain)]\r\n|   bic mark, mark, #LJ_GC_BLACK\t\t// black2gray(tab)\r\n|  str tab, [DISPATCH, #DISPATCH_GL(gc.grayagain)]\r\n|   strb mark, tab->marked\r\n|  str tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|.macro .IOS, a, b\r\n|.if IOS\r\n|  a, b\r\n|.endif\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n#if !LJ_DUALNUM\r\n#error \"Only dual-number mode supported for ARM target\"\r\n#endif\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: RB = previous base.\r\n  |  tst PC, #FRAME_P\r\n  |  beq ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  ldr PC, [RB, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |   mvn CARG2, #~LJ_TTRUE\r\n  |  mov BASE, RB\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   str CARG2, [RA, FRAME_PC]\t\t// Prepend true to results.\r\n  |  sub RA, RA, #8\r\n  |\r\n  |->vm_returnc:\r\n  |  adds RC, RC, #8\t\t\t// RC = (nresults+1)*8.\r\n  |  mov CRET1, #LUA_YIELD\r\n  |  beq ->vm_unwind_c_eh\r\n  |  str RC, SAVE_MULTRES\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |  beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RC/MULTRES = (nresults+1)*8, PC = return\r\n  |  // CARG1 = PC & FRAME_TYPE\r\n  |  bic RB, PC, #FRAME_TYPEP\r\n  |   cmp CARG1, #FRAME_C\r\n  |  sub RB, BASE, RB\t\t\t// RB = previous base.\r\n  |   bne ->vm_returnp\r\n  |\r\n  |  str RB, L->base\r\n  |   ldr KBASE, SAVE_NRES\r\n  |    mv_vmstate CARG4, C\r\n  |   sub BASE, BASE, #8\r\n  |  subs CARG3, RC, #8\r\n  |   lsl KBASE, KBASE, #3\t\t// KBASE = (nresults_wanted+1)*8\r\n  |    st_vmstate CARG4\r\n  |  beq >2\r\n  |1:\r\n  |  subs CARG3, CARG3, #8\r\n  |   ldrd CARG12, [RA], #8\r\n  |   strd CARG12, [BASE], #8\r\n  |  bne <1\r\n  |2:\r\n  |  cmp KBASE, RC\t\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  str BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  ldr RC, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   mov CRET1, #0\t\t\t// Ok return status for vm_pcall.\r\n  |  str RC, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs_ret\r\n  |\r\n  |6:\r\n  |  blt >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  ldr CARG3, L->maxstack\r\n  |   mvn CARG2, #~LJ_TNIL\r\n  |  cmp BASE, CARG3\r\n  |  bhs >8\r\n  |   str CARG2, [BASE, #4]\r\n  |  add RC, RC, #8\r\n  |  add BASE, BASE, #8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  sub CARG1, RC, KBASE\r\n  |  cmp KBASE, #0\t\t\t// LUA_MULTRET+1 case?\r\n  |  subne BASE, BASE, CARG1\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  str BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |  lsr CARG2, KBASE, #3\r\n  |  mov CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mov sp, CARG1\r\n  |  mov CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |   mv_vmstate CARG4, C\r\n  |  ldr GL:CARG3, L->glref\r\n  |   str CARG4, GL:CARG3->vmstate\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  bic CARG1, CARG1, #~CFRAME_RAWMASK\t// Use two steps: bic sp is deprecated.\r\n  |  mov sp, CARG1\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |   mov MASKR8, #255\r\n  |    mov RC, #16\t\t\t// 2 results: false + error message.\r\n  |   lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |  ldr BASE, L->base\r\n  |   ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |    mvn CARG1, #~LJ_TFALSE\r\n  |  sub RA, BASE, #8\t\t\t// Results start at BASE-8.\r\n  |  ldr PC, [BASE, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |   add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |   mv_vmstate CARG2, INTERP\r\n  |    str CARG1, [BASE, #-4]\t\t// Prepend false to error message.\r\n  |   st_vmstate CARG2\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  // CARG1 = L\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |    mov CARG1, L\r\n  |  str BASE, L->base\r\n  |   add PC, PC, #4\t\t\t// Must point after first instruction.\r\n  |  str RC, L->top\r\n  |   lsr CARG2, RA, #3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->base\r\n  |   ldr RC, L->top\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |    ldr DISPATCH, L:CARG1->glref\t// Setup pointer to dispatch table.\r\n  |  mov BASE, CARG2\r\n  |    add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |   str L, SAVE_L\r\n  |  mov PC, #FRAME_CP\r\n  |   str CARG3, SAVE_NRES\r\n  |    add CARG2, sp, #CFRAME_RESUME\r\n  |  ldrb CARG1, L->status\r\n  |   str CARG3, SAVE_ERRF\r\n  |    str CARG2, L->cframe\r\n  |   str CARG3, SAVE_CFRAME\r\n  |  cmp CARG1, #0\r\n  |   str L, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |  beq >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  mov RA, BASE\r\n  |   ldr BASE, L->base\r\n  |   ldr CARG1, L->top\r\n  |    mov MASKR8, #255\r\n  |     strb CARG3, L->status\r\n  |   sub RC, CARG1, BASE\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |     mv_vmstate CARG2, INTERP\r\n  |   add RC, RC, #8\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |     st_vmstate CARG2\r\n  |   str RC, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_CP\r\n  |  str CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  ldr RC, L:CARG1->cframe\r\n  |   str CARG3, SAVE_NRES\r\n  |    mov L, CARG1\r\n  |   str CARG1, SAVE_L\r\n  |    mov BASE, CARG2\r\n  |  str sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   str CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  str RC, SAVE_CFRAME\r\n  |    add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  ldr RB, L->base\t\t\t// RB = old base (for vmeta_call).\r\n  |   ldr CARG1, L->top\r\n  |    mov MASKR8, #255\r\n  |  add PC, PC, BASE\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |  sub PC, PC, RB\t\t\t// PC = frame delta + frame type\r\n  |    mv_vmstate CARG2, INTERP\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |    st_vmstate CARG2\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // RB = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  ldrd CARG34, [BASE, FRAME_FUNC]\r\n  |  checkfunc CARG4, ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, CARG3 = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |   ldr RA, L:CARG1->stack\r\n  |  str CARG1, SAVE_L\r\n  |   ldr RB, L->top\r\n  |  str CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |  ldr RC, L->cframe\r\n  |   sub RA, RA, RB\t\t\t// Compute -savestack(L, L->top).\r\n  |  str sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |  mov RB, #0\r\n  |   str RA, SAVE_NRES\t\t\t// Neg. delta means cframe w/o frame.\r\n  |  str RB, SAVE_ERRF\t\t\t// No error function.\r\n  |  str RC, SAVE_CFRAME\r\n  |  blx CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |   ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  movs BASE, CRET1\r\n  |    mov PC, #FRAME_CP\r\n  |   add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |  bne <3\t\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RC = (nresults+1)*8\r\n  |  ldr LFUNC:CARG3, [RB, FRAME_FUNC]\r\n  |    ldr CARG1, [BASE, #-16]\t\t// Get continuation.\r\n  |   mov CARG4, BASE\r\n  |   mov BASE, RB\t\t\t// Restore caller BASE.\r\n  |.if FFI\r\n  |    cmp CARG1, #1\r\n  |.endif\r\n  |   ldr PC, [CARG4, #-12]\t\t// Restore PC from [cont|PC].\r\n  |  ldr CARG3, LFUNC:CARG3->field_pc\r\n  |    mvn INS, #~LJ_TNIL\r\n  |    add CARG2, RA, RC\r\n  |    str INS, [CARG2, #-4]\t\t// Ensure one valid arg.\r\n  |.if FFI\r\n  |    bls >1\r\n  |.endif\r\n  |  ldr KBASE, [CARG3, #PC2PROTO(k)]\r\n  |  // BASE = base, RA = resultptr, CARG4 = meta base\r\n  |    bx CARG1\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  beq ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |  sub CARG4, CARG4, #16\r\n  |  sub RC, CARG4, BASE\r\n  |  b ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, CARG4 = meta base\r\n  |  ldr INS, [PC, #-4]\r\n  |   sub CARG2, CARG4, #16\r\n  |   ldrd CARG34, [RA]\r\n  |     str BASE, L->base\r\n  |  decode_RB8 RC, INS\r\n  |   decode_RA8 RA, INS\r\n  |  add CARG1, BASE, RC\r\n  |  subs CARG1, CARG2, CARG1\r\n  |   strdne CARG34, [CARG2]\r\n  |   movne CARG3, CARG1\r\n  |  bne ->BC_CAT_Z\r\n  |   strd CARG34, [BASE, RA]\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  add CARG2, BASE, RB\r\n  |  b >2\r\n  |\r\n  |->vmeta_tgets:\r\n  |  sub CARG2, DISPATCH, #-DISPATCH_GL(tmptv)\r\n  |   mvn CARG4, #~LJ_TTAB\r\n  |  str TAB:RB, [CARG2]\r\n  |   str CARG4, [CARG2, #4]\r\n  |2:\r\n  |   mvn CARG4, #~LJ_TSTR\r\n  |  str STR:RC, TMPDlo\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// RC = index\r\n  |  decode_RB8 RB, INS\r\n  |   str RC, TMPDlo\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |  add CARG2, BASE, RB\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  beq >3\r\n  |  ldrd CARG34, [CRET1]\r\n  |   ins_next1\r\n  |   ins_next2\r\n  |  strd CARG34, [BASE, RA]\r\n  |   ins_next3\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |   rsb CARG1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #16\t\t// 2 args for func(t, k).\r\n  |    str PC, [BASE, #-12]\t\t// [cont|PC]\r\n  |   add PC, CARG1, BASE\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  add CARG2, BASE, RB\r\n  |  b >2\r\n  |\r\n  |->vmeta_tsets:\r\n  |  sub CARG2, DISPATCH, #-DISPATCH_GL(tmptv)\r\n  |   mvn CARG4, #~LJ_TTAB\r\n  |  str TAB:RB, [CARG2]\r\n  |   str CARG4, [CARG2, #4]\r\n  |2:\r\n  |   mvn CARG4, #~LJ_TSTR\r\n  |  str STR:RC, TMPDlo\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// RC = index\r\n  |  decode_RB8 RB, INS\r\n  |   str RC, TMPDlo\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |  add CARG2, BASE, RB\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |   ldrd CARG34, [BASE, RA]\r\n  |  beq >3\r\n  |   ins_next1\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  strd CARG34, [CRET1]\r\n  |   ins_next2\r\n  |   ins_next3\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |   rsb CARG1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #24\t\t// 3 args for func(t, k, v).\r\n  |   strd CARG34, [BASE, #16]\t\t// Copy value to third argument.\r\n  |    str PC, [BASE, #-12]\t\t// [cont|PC]\r\n  |   add PC, CARG1, BASE\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  mov CARG1, L\r\n  |   sub PC, PC, #4\r\n  |  mov CARG2, RA\r\n  |   str BASE, L->base\r\n  |  mov CARG3, RC\r\n  |   str PC, SAVE_PC\r\n  |  decode_OP CARG4, INS\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #1\r\n  |  bhi ->vmeta_binop\r\n  |4:\r\n  |  ldrh RB, [PC, #2]\r\n  |   add PC, PC, #4\r\n  |  add RB, PC, RB, lsl #2\r\n  |  subhs PC, RB, #0x20000\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  ldr INS, [PC, #-4]\r\n  |   ldrd CARG12, [RA]\r\n  |  decode_RA8 CARG3, INS\r\n  |   strd CARG12, [BASE, CARG3]\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  ldr CARG2, [RA, #4]\r\n  |   mvn CARG1, #~LJ_TTRUE\r\n  |  cmp CARG1, CARG2\t\t\t// Branch if result is true.\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  ldr CARG2, [RA, #4]\r\n  |  checktp CARG2, LJ_TFALSE\t\t// Branch if result is false.\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |   mov CARG2, INS\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal_cd\t\t// (lua_State *L, BCIns op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG3, BASE, RB\r\n  |   add CARG4, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG4, BASE, RB\r\n  |   add CARG3, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_unm:\r\n  |  ldr INS, [PC, #-8]\r\n  |   sub PC, PC, #4\r\n  |  add CARG3, BASE, RC\r\n  |  add CARG4, BASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG3, BASE, RB\r\n  |   add CARG4, BASE, RC\r\n  |1:\r\n  |  decode_OP OP, INS\r\n  |   add CARG2, BASE, RA\r\n  |    str BASE, L->base\r\n  |   mov CARG1, L\r\n  |    str PC, SAVE_PC\r\n  |  str OP, ARG5\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  beq ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub CARG2, CRET1, BASE\r\n  |   str PC, [CRET1, #-12]\t\t// [cont|PC]\r\n  |  add PC, CARG2, #FRAME_CONT\r\n  |   mov BASE, CRET1\r\n  |    mov NARGS8:RC, #16\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  add CARG2, BASE, RC\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n  |  .IOS ldr BASE, L->base\r\n#if LJ_52\r\n  |  cmp CRET1, #0\r\n  |  bne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  ldr TAB:CARG1, [BASE, RC]\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // RB = old base, BASE = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str RB, L->base\t\t\t// This is the callers base!\r\n  |  sub CARG2, BASE, #8\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, BASE, NARGS8:RC\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  .IOS mov BASE, RA\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  sub CARG2, RA, #8\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, RA, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  .IOS ldr BASE, L->base\r\n  |  ldr LFUNC:CARG3, [RA, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |    add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  b ->BC_CALLT2_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, RA\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |  .IOS ldr BASE, L->base\r\n  |.if JIT\r\n  |   ldrb OP, [PC, #-4]\r\n  |.endif\r\n  |  ldr INS, [PC, #-4]\r\n  |.if JIT\r\n  |   cmp OP, #BC_JFORI\r\n  |.endif\r\n  |  decode_RA8 RA, INS\r\n  |  decode_RD RC, INS\r\n  |.if JIT\r\n  |   beq =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  ldrd CARG12, [BASE]\r\n  |   ldrd CARG34, [BASE, #8]\r\n  |    cmp NARGS8:RC, #16\r\n  |    blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc_1 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc_2 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmnlo CARG4, #-LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_d, name\r\n  |  .ffunc name\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\r\n  |  vldr d0, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_dd, name\r\n  |  .ffunc name\r\n  |  ldr CARG2, [BASE, #4]\r\n  |  ldr CARG4, [BASE, #12]\r\n  |   cmp NARGS8:RC, #16\r\n  |  vldr d0, [BASE]\r\n  |  vldr d1, [BASE, #8]\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmnlo CARG4, #-LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses CARG1 and CARG2.\r\n  |.macro ffgccheck\r\n  |  ldr CARG1, [DISPATCH, #DISPATCH_GL(gc.total)]\r\n  |  ldr CARG2, [DISPATCH, #DISPATCH_GL(gc.threshold)]\r\n  |  cmp CARG1, CARG2\r\n  |  blge ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  checktp CARG2, LJ_TTRUE\r\n  |  bhi ->fff_fallback\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |  mov RB, BASE\r\n  |  subs RA, NARGS8:RC, #8\r\n  |   add RC, NARGS8:RC, #8\t\t// Compute (nresults+1)*8.\r\n  |  beq ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |1:\r\n  |   ldrd CARG12, [RB, #8]\r\n  |  subs RA, RA, #8\r\n  |   strd CARG12, [RB], #8\r\n  |  bne <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc type\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  mvnlo CARG2, #~LJ_TISNUM\r\n  |  rsb CARG4, CARG2, #(int)(offsetof(GCfuncC, upvalue)>>3)-1\r\n  |  lsl CARG4, CARG4, #3\r\n  |  ldrd CARG12, [CFUNC:CARG3, CARG4]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  checktp CARG2, LJ_TTAB\r\n  |  cmnne CARG2, #-LJ_TUDATA\r\n  |  bne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n  |2:\r\n  |   mvn CARG2, #~LJ_TNIL\r\n  |   ldr STR:RC, [DISPATCH, #DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])]\r\n  |  cmp TAB:RB, #0\r\n  |  beq ->fff_restv\r\n  |  ldr CARG3, TAB:RB->hmask\r\n  |   ldr CARG4, STR:RC->hash\r\n  |    ldr NODE:INS, TAB:RB->node\r\n  |  and CARG3, CARG3, CARG4\t\t// idx = str->hash & tab->hmask\r\n  |  add CARG3, CARG3, CARG3, lsl #1\r\n  |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  ldrd CARG34, NODE:INS->key  // STALL: early NODE:INS.\r\n  |   ldrd CARG12, NODE:INS->val\r\n  |    ldr NODE:INS, NODE:INS->next\r\n  |  checktp CARG4, LJ_TSTR\r\n  |  cmpeq CARG3, STR:RC\r\n  |  beq >5\r\n  |  cmp NODE:INS, #0\r\n  |  bne <3\r\n  |4:\r\n  |  mov CARG1, RB\t\t\t// Use metatable as default result.\r\n  |  mvn CARG2, #~LJ_TTAB\r\n  |  b ->fff_restv\r\n  |5:\r\n  |  checktp CARG2, LJ_TNIL\r\n  |  bne ->fff_restv\r\n  |  b <4\r\n  |\r\n  |6:\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  mvnhs CARG2, CARG2\r\n  |  movlo CARG2, #~LJ_TISNUM\r\n  |  add CARG4, DISPATCH, CARG2, lsl #2\r\n  |  ldr TAB:RB, [CARG4, #DISPATCH_GL(gcroot[GCROOT_BASEMT])]\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  checktp CARG2, LJ_TTAB\r\n  |   ldreq TAB:RB, TAB:CARG1->metatable\r\n  |  checktpeq CARG4, LJ_TTAB\r\n  |    ldrbeq CARG4, TAB:CARG1->marked\r\n  |   cmpeq TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n  |    tst CARG4, #LJ_GC_BLACK\t\t// isblack(table)\r\n  |     str TAB:CARG3, TAB:CARG1->metatable\r\n  |    beq ->fff_restv\r\n  |  barrierback TAB:CARG1, CARG4, CARG3\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  ldrd CARG34, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |   mov CARG2, CARG3\r\n  |  checktab CARG4, ->fff_fallback\r\n  |   mov CARG1, L\r\n  |   add CARG3, BASE, #8\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  .IOS mov BASE, RA\r\n  |  ldrd CARG12, [CRET1]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   bne ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bls ->fff_restv\r\n  |  b ->fff_fallback\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  checktp CARG2, LJ_TSTR\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq ->fff_restv\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  ldr CARG4, [DISPATCH, #DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])]\r\n  |   str BASE, L->base\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmpls CARG4, #0\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  bhi ->fff_fallback\r\n  |  ffgccheck\r\n  |  mov CARG1, L\r\n  |  mov CARG2, BASE\r\n  |  bl extern lj_str_fromnumber\t// (lua_State *L, cTValue *o)\r\n  |  // Returns GCstr *.\r\n  |  ldr BASE, L->base\r\n  |  mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |   mvn CARG4, #~LJ_TNIL\r\n  |  checktab CARG2, ->fff_fallback\r\n  |   strd CARG34, [BASE, NARGS8:RC]\t// Set missing 2nd arg to nil.\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  mov CARG2, CARG1\r\n  |    str BASE, L->base\t\t// Add frame since C call can throw.\r\n  |  mov CARG1, L\r\n  |    str BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  add CARG3, BASE, #8\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  mvneq CRET2, #~LJ_TNIL\r\n  |  beq ->fff_restv\t\t\t// End of traversal: return nil.\r\n  |  ldrd CARG12, [BASE, #8]\t\t// Copy key and value to results.\r\n  |   ldrd CARG34, [BASE, #16]\r\n  |    mov RC, #(2+1)*8\r\n  |  strd CARG12, [BASE, #-8]\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktab CARG2, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n#endif\r\n  |   ldrd CFUNC:CARG34, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cmp TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n#endif\r\n  |  mvn CARG2, #~LJ_TNIL\r\n  |    mov RC, #(3+1)*8\r\n  |   strd CFUNC:CARG34, [BASE, #-8]\r\n  |  str CARG2, [BASE, #12]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  checktp CARG2, LJ_TTAB\r\n  |  checktpeq CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  ldr RB, TAB:CARG1->asize\r\n  |   ldr RC, TAB:CARG1->array\r\n  |  add CARG3, CARG3, #1\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  cmp CARG3, RB\r\n  |   add RC, RC, CARG3, lsl #3\r\n  |  strd CARG34, [BASE, #-8]\r\n  |   ldrdlo CARG12, [RC]\r\n  |   mov RC, #(0+1)*8\r\n  |  bhs >2\t\t\t\t// Not in array part?\r\n  |1:\r\n  |   checktp CARG2, LJ_TNIL\r\n  |   movne RC, #(2+1)*8\r\n  |   strdne CARG12, [BASE]\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  ldr RB, TAB:CARG1->hmask\r\n  |   mov CARG2, CARG3\r\n  |  cmp RB, #0\r\n  |  beq ->fff_res\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  .IOS mov BASE, RA\r\n  |  cmp CRET1, #0\r\n  |  beq ->fff_res\r\n  |  ldrd CARG12, [CRET1]\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktab CARG2, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n#endif\r\n  |   ldrd CFUNC:CARG34, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cmp TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n#endif\r\n  |  mov CARG1, #0\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |    mov RC, #(3+1)*8\r\n  |   strd CFUNC:CARG34, [BASE, #-8]\r\n  |  strd CARG12, [BASE, #8]\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  ldrb RA, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  tst RA, #HOOK_ACTIVE\t\t// Remember active hook before pcall.\r\n  |   mov RB, BASE\r\n  |   add BASE, BASE, #8\r\n  |  moveq PC, #8+FRAME_PCALL\r\n  |  movne PC, #8+FRAME_PCALLH\r\n  |   sub NARGS8:RC, NARGS8:RC, #8\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  ldrb RA, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  checkfunc CARG4, ->fff_fallback\t// Traceback must be a function.\r\n  |   mov RB, BASE\r\n  |  strd CARG12, [BASE, #8]\t\t// Swap function and traceback.\r\n  |   strd CARG34, [BASE]\r\n  |  tst RA, #HOOK_ACTIVE\t\t// Remember active hook before pcall.\r\n  |   add BASE, BASE, #16\r\n  |  moveq PC, #16+FRAME_PCALL\r\n  |  movne PC, #16+FRAME_PCALLH\r\n  |   sub NARGS8:RC, NARGS8:RC, #16\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  checktp CARG2, LJ_TTHREAD\r\n  |  bne ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  ldr L:CARG1, CFUNC:CARG3->upvalue[0].gcr\r\n  |.endif\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |     str BASE, L->base\r\n  |  ldr CARG2, L:CARG1->top\r\n  |   ldrb RA, L:CARG1->status\r\n  |    ldr RB, L:CARG1->base\r\n  |  add CARG3, CARG2, NARGS8:RC\r\n  |  add CARG4, CARG2, RA\r\n  |   str PC, SAVE_PC\r\n  |  cmp CARG4, RB\r\n  |  beq ->fff_fallback\r\n  |   ldr CARG4, L:CARG1->maxstack\r\n  |    ldr RB, L:CARG1->cframe\r\n  |   cmp RA, #LUA_YIELD\r\n  |   cmpls CARG3, CARG4\r\n  |    cmpls RB, #0\r\n  |    bhi ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  sub CARG3, CARG3, #8\t\t// Keep resumed thread in stack for GC.\r\n  |  add BASE, BASE, #8\r\n  |  sub NARGS8:RC, NARGS8:RC, #8\r\n  |.endif\r\n  |  str CARG3, L:CARG1->top\r\n  |  str BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |   ldrd CARG34, [BASE, RB]\r\n  |  cmp RB, NARGS8:RC\r\n  |   strdne CARG34, [CARG2, RB]\r\n  |  add RB, RB, #8\r\n  |  bne <2\r\n  |\r\n  |  mov CARG3, #0\r\n  |   mov L:RA, L:CARG1\r\n  |  mov CARG4, #0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  ldr CARG3, L:RA->base\r\n  |    mv_vmstate CARG2, INTERP\r\n  |  ldr CARG4, L:RA->top\r\n  |    st_vmstate CARG2\r\n  |   cmp CRET1, #LUA_YIELD\r\n  |  ldr BASE, L->base\r\n  |   bhi >8\r\n  |  subs RC, CARG4, CARG3\r\n  |   ldr CARG1, L->maxstack\r\n  |   add CARG2, BASE, RC\r\n  |  beq >6\t\t\t\t// No results?\r\n  |  cmp CARG2, CARG1\r\n  |   mov RB, #0\r\n  |  bhi >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  sub CARG4, RC, #8\r\n  |   str CARG3, L:RA->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |   ldrd CARG12, [CARG3, RB]\r\n  |  cmp RB, CARG4\r\n  |   strd CARG12, [BASE, RB]\r\n  |  add RB, RB, #8\r\n  |  bne <5\r\n  |6:\r\n  |.if resume\r\n  |  mvn CARG3, #~LJ_TTRUE\r\n  |   add RC, RC, #16\r\n  |7:\r\n  |  str CARG3, [BASE, #-4]\t\t// Prepend true/false to results.\r\n  |   sub RA, BASE, #8\r\n  |.else\r\n  |   mov RA, BASE\r\n  |   add RC, RC, #8\r\n  |.endif\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   str PC, SAVE_PC\r\n  |   str RC, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  ldrd CARG12, [CARG4, #-8]!\r\n  |   mvn CARG3, #~LJ_TFALSE\r\n  |    mov RC, #(2+1)*8\r\n  |  str CARG4, L:RA->top\t\t// Remove error from coroutine stack.\r\n  |  strd CARG12, [BASE]\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mov CARG1, L\r\n  |  mov CARG2, L:RA\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |  // Never returns.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mov CARG1, L\r\n  |  lsr CARG2, RC, #3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov CRET1, #0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  ldr CARG1, L->cframe\r\n  |   add CARG2, BASE, NARGS8:RC\r\n  |   str BASE, L->base\r\n  |  tst CARG1, #CFRAME_RESUME\r\n  |   str CARG2, L->top\r\n  |    mov CRET1, #LUA_YIELD\r\n  |   mov CARG3, #0\r\n  |  beq ->fff_fallback\r\n  |   str CARG3, L->cframe\r\n  |    strb CRET1, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_1 math_ .. func\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  beq ->fff_restv\r\n  |  bhi ->fff_fallback\r\n  |  // Round FP value and normalize result.\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  bpl >2\t\t\t\t// |x| < 1?\r\n  |  mvn CARG4, #0x3e0\r\n  |    subs RB, CARG4, RB, asr #21\r\n  |  lsl CARG4, CARG2, #11\r\n  |   lsl CARG3, CARG1, #11\r\n  |  orr CARG4, CARG4, #0x80000000\r\n  |   rsb INS, RB, #32\r\n  |  orr CARG4, CARG4, CARG1, lsr #21\r\n  |    bls >3\t\t\t\t// |x| >= 2^31?\r\n  |   orr CARG3, CARG3, CARG4, lsl INS\r\n  |  lsr CARG1, CARG4, RB\r\n  |.if \"func\" == \"floor\"\r\n  |   tst CARG3, CARG2, asr #31\r\n  |   addne CARG1, CARG1, #1\r\n  |.else\r\n  |   bics CARG3, CARG3, CARG2, asr #31\r\n  |   addsne CARG1, CARG1, #1\r\n  |   ldrdvs CARG12, >9\r\n  |   bvs ->fff_restv\r\n  |.endif\r\n  |    cmp CARG2, #0\r\n  |    rsblt CARG1, CARG1, #0\r\n  |1:\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |2:  // |x| < 1\r\n  |  bcs ->fff_restv\t\t\t// |x| is not finite.\r\n  |  orr CARG3, CARG3, CARG1\t\t// ztest = abs(hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  tst CARG3, CARG2, asr #31\t\t// return (ztest & sign) == 0 ? 0 : -1\r\n  |  moveq CARG1, #0\r\n  |  mvnne CARG1, #0\r\n  |.else\r\n  |  bics CARG3, CARG3, CARG2, asr #31\t// return (ztest & ~sign) == 0 ? 0 : 1\r\n  |  moveq CARG1, #0\r\n  |  movne CARG1, #1\r\n  |.endif\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |3:  // |x| >= 2^31. Check for x == -(2^31).\r\n  |  cmpeq CARG4, #0x80000000\r\n  |.if \"func\" == \"floor\"\r\n  |  cmpeq CARG3, #0\r\n  |.endif\r\n  |  bne >4\r\n  |  cmp CARG2, #0\r\n  |  movmi CARG1, #0x80000000\r\n  |  bmi <1\r\n  |4:\r\n  |  bl ->vm_..func.._sf\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.align 8\r\n  |9:\r\n  |  .long 0x00000000, 0x41e00000\t// 2^31.\r\n  |\r\n  |.ffunc_1 math_abs\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhi ->fff_fallback\r\n  |  bicne CARG2, CARG2, #0x80000000\r\n  |  bne ->fff_restv\r\n  |  cmp CARG1, #0\r\n  |  rsbslt CARG1, CARG1, #0\r\n  |  ldrdvs CARG12, <9\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG12 = TValue result.\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |->fff_res1:\r\n  |  // PC = return.\r\n  |  mov RC, #(1+1)*8\r\n  |->fff_res:\r\n  |  // RC = (nresults+1)*8, PC = return.\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |  ldreq INS, [PC, #-4]\r\n  |   str RC, SAVE_MULTRES\r\n  |  sub RA, BASE, #8\r\n  |  bne ->vm_return\r\n  |  decode_RB8 RB, INS\r\n  |5:\r\n  |  cmp RB, RC\t\t\t\t// More results expected?\r\n  |  bhi >6\r\n  |  decode_RA8 CARG1, INS\r\n  |   ins_next1\r\n  |   ins_next2\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  sub BASE, RA, CARG1\r\n  |   ins_next3\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  add CARG2, RA, RC\r\n  |  mvn CARG1, #~LJ_TNIL\r\n  |   add RC, RC, #8\r\n  |  str CARG1, [CARG2, #-4]\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |.if HFABI\r\n  |  .ffunc_d math_ .. func\r\n  |.else\r\n  |  .ffunc_n math_ .. func\r\n  |.endif\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern func\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |.if HFABI\r\n  |  .ffunc_dd math_ .. func\r\n  |.else\r\n  |  .ffunc_nn math_ .. func\r\n  |.endif\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern func\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.if FPU\r\n  |  .ffunc_d math_sqrt\r\n  |  vsqrt.f64 d0, d0\r\n  |->fff_resd:\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  vstr d0, [BASE, #-8]\r\n  |  b ->fff_res1\r\n  |.else\r\n  |  math_extern sqrt\r\n  |.endif\r\n  |\r\n  |.ffunc math_log\r\n  |.if HFABI\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |  vldr d0, [BASE]\r\n  |   bne ->fff_fallback\r\n  |.else\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |   bne ->fff_fallback\r\n  |.endif\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern log\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |->ff_math_deg:\r\n  |.if FPU\r\n  |  .ffunc_d math_rad\r\n  |  vldr d1, CFUNC:CARG3->upvalue[0]\r\n  |  vmul.f64 d0, d0, d1\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  .ffunc_n math_rad\r\n  |  ldrd CARG34, CFUNC:CARG3->upvalue[0]\r\n  |  bl extern __aeabi_dmul\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |\r\n  |.if HFABI\r\n  |  .ffunc math_ldexp\r\n  |  ldr CARG4, [BASE, #4]\r\n  |  ldrd CARG12, [BASE, #8]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  vldr d0, [BASE]\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern ldexp\t\t\t// (double x, int exp)\r\n  |  .IOS mov BASE, RA\r\n  |  b ->fff_resd\r\n  |.else\r\n  |.ffunc_2 math_ldexp\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern ldexp\t\t\t// (double x, int exp)\r\n  |  .IOS mov BASE, RA\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |\r\n  |.if HFABI\r\n  |.ffunc_d math_frexp\r\n  |  mov CARG1, sp\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern frexp\r\n  |  .IOS mov BASE, RA\r\n  |   ldr CARG3, [sp]\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  vstr d0, [BASE, #-8]\r\n  |    mov RC, #(2+1)*8\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |.else\r\n  |.ffunc_n math_frexp\r\n  |  mov CARG3, sp\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern frexp\r\n  |  .IOS mov BASE, RA\r\n  |   ldr CARG3, [sp]\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |    mov RC, #(2+1)*8\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.if HFABI\r\n  |.ffunc_d math_modf\r\n  |  sub CARG1, BASE, #8\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern modf\r\n  |  .IOS mov BASE, RA\r\n  |   mov RC, #(2+1)*8\r\n  |  vstr d0, [BASE]\r\n  |  b ->fff_res\r\n  |.else\r\n  |.ffunc_n math_modf\r\n  |  sub CARG3, BASE, #8\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern modf\r\n  |  .IOS mov BASE, RA\r\n  |   mov RC, #(2+1)*8\r\n  |  strd CARG12, [BASE]\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.macro math_minmax, name, cond, fcond\r\n  |.if FPU\r\n  |  .ffunc_1 name\r\n  |   add RB, BASE, RC\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |   add RA, BASE, #8\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  ldrd CARG34, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne >3\r\n  |  cmp CARG1, CARG3\r\n  |   add RA, RA, #8\r\n  |  mov..cond CARG1, CARG3\r\n  |  b <1\r\n  |3:  // Convert intermediate result to number and continue below.\r\n  |  vmov s4, CARG1\r\n  |  bhi ->fff_fallback\r\n  |  vldr d1, [RA]\r\n  |  vcvt.f64.s32 d0, s4\r\n  |  b >6\r\n  |\r\n  |4:\r\n  |  vldr d0, [BASE]\r\n  |  bhi ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  ldrd CARG34, [RA]\r\n  |  vldr d1, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_resd\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs >7\r\n  |6:\r\n  |  vcmp.f64 d0, d1\r\n  |  vmrs\r\n  |   add RA, RA, #8\r\n  |  vmov..fcond.f64 d0, d1\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |  vmov s4, CARG3\r\n  |  bhi ->fff_fallback\r\n  |  vcvt.f64.s32 d1, s4\r\n  |  b <6\r\n  |\r\n  |.else\r\n  |\r\n  |  .ffunc_1 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |   mov RA, #8\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |   cmp RA, RC\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne >3\r\n  |  cmp CARG1, CARG3\r\n  |   add RA, RA, #8\r\n  |  mov..cond CARG1, CARG3\r\n  |  b <1\r\n  |3:  // Convert intermediate result to number and continue below.\r\n  |  bhi ->fff_fallback\r\n  |  bl extern __aeabi_i2d\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |  b >6\r\n  |\r\n  |4:\r\n  |  bhi ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |   cmp RA, RC\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs >7\r\n  |6:\r\n  |  bl extern __aeabi_cdcmple\r\n  |   add RA, RA, #8\r\n  |  mov..fcond CARG1, CARG3\r\n  |  mov..fcond CARG2, CARG4\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |  bhi ->fff_fallback\r\n  |  strd CARG12, TMPD\r\n  |  mov CARG1, CARG3\r\n  |  bl extern __aeabi_i2d\r\n  |  ldrd CARG34, TMPD\r\n  |  b <6\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, gt, hi\r\n  |  math_minmax math_max, lt, lo\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc_1 string_len\r\n  |  checkstr CARG2, ->fff_fallback\r\n  |  ldr CARG1, STR:CARG1->len\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  ldrd CARG12, [BASE]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |   cmp NARGS8:RC, #8\r\n  |   checktpeq CARG2, LJ_TSTR\t\t// Need exactly 1 argument.\r\n  |   bne ->fff_fallback\r\n  |  ldr CARG3, STR:CARG1->len\r\n  |   ldrb CARG1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  cmp CARG3, #0\r\n  |  moveq RC, #(0+1)*8\r\n  |  movne RC, #(1+1)*8\r\n  |   strd CARG12, [BASE, #-8]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |   checktpeq CARG2, LJ_TISNUM\r\n  |   bicseq CARG4, CARG1, #255\r\n  |  mov CARG3, #1\r\n  |   bne ->fff_fallback\r\n  |  str CARG1, TMPD\r\n  |  mov CARG2, TMPDp\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  // CARG2 = str, CARG3 = len.\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |  // Returns GCstr *.\r\n  |  ldr BASE, L->base\r\n  |   mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |   ldrd CARG34, [BASE, #16]\r\n  |    cmp NARGS8:RC, #16\r\n  |     mvn RB, #0\r\n  |    beq >1\r\n  |    blo ->fff_fallback\r\n  |   checktp CARG4, LJ_TISNUM\r\n  |    mov RB, CARG3\r\n  |   bne ->fff_fallback\r\n  |1:\r\n  |  ldrd CARG34, [BASE, #8]\r\n  |  checktp CARG2, LJ_TSTR\r\n  |   ldreq CARG2, STR:CARG1->len\r\n  |  checktpeq CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  // CARG1 = str, CARG2 = str->len, CARG3 = start, RB = end\r\n  |  add CARG4, CARG2, #1\r\n  |  cmp CARG3, #0\t\t\t// if (start < 0) start += len+1\r\n  |  addlt CARG3, CARG3, CARG4\r\n  |  cmp CARG3, #1\t\t\t// if (start < 1) start = 1\r\n  |  movlt CARG3, #1\r\n  |  cmp RB, #0\t\t\t\t// if (end < 0) end += len+1\r\n  |  addlt RB, RB, CARG4\r\n  |  bic RB, RB, RB, asr #31\t\t// if (end < 0) end = 0\r\n  |  cmp RB, CARG2\t\t\t// if (end > len) end = len\r\n  |   add CARG1, STR:CARG1, #sizeof(GCstr)-1\r\n  |  movgt RB, CARG2\r\n  |   add CARG2, CARG1, CARG3\r\n  |  subs CARG3, RB, CARG3\t\t// len = end - start\r\n  |   add CARG3, CARG3, #1\t\t// len += 1\r\n  |  bge ->fff_newstr\r\n  |->fff_emptystr:\r\n  |  sub STR:CARG1, DISPATCH, #-DISPATCH_GL(strempty)\r\n  |  mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_rep\t\t\t// Only handle the 1-char case inline.\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |   ldrd CARG34, [BASE, #8]\r\n  |    cmp NARGS8:RC, #16\r\n  |    bne ->fff_fallback\t\t// Exactly 2 arguments\r\n  |  checktp CARG2, LJ_TSTR\r\n  |   checktpeq CARG4, LJ_TISNUM\r\n  |   bne ->fff_fallback\r\n  |  subs CARG4, CARG3, #1\r\n  |   ldr CARG2, STR:CARG1->len\r\n  |  blt ->fff_emptystr\t\t\t// Count <= 0?\r\n  |   cmp CARG2, #1\r\n  |   blo ->fff_emptystr\t\t// Zero-length string?\r\n  |   bne ->fff_fallback\t\t// Fallback for > 1-char strings.\r\n  |  ldr RB, [DISPATCH, #DISPATCH_GL(tmpbuf.sz)]\r\n  |   ldr CARG2, [DISPATCH, #DISPATCH_GL(tmpbuf.buf)]\r\n  |   ldr CARG1, STR:CARG1[1]\r\n  |  cmp RB, CARG3\r\n  |  blo ->fff_fallback\r\n  |1:  // Fill buffer with char.\r\n  |   strb CARG1, [CARG2, CARG4]\r\n  |  subs CARG4, CARG4, #1\r\n  |  bge <1\r\n  |  b ->fff_newstr\r\n  |\r\n  |.ffunc string_reverse\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  checkstr CARG2, ->fff_fallback\r\n  |  ldr CARG3, STR:CARG1->len\r\n  |   ldr RB, [DISPATCH, #DISPATCH_GL(tmpbuf.sz)]\r\n  |    ldr CARG2, [DISPATCH, #DISPATCH_GL(tmpbuf.buf)]\r\n  |  mov CARG4, CARG3\r\n  |  add CARG1, STR:CARG1, #sizeof(GCstr)\r\n  |   cmp RB, CARG3\r\n  |   blo ->fff_fallback\r\n  |1:  // Reverse string copy.\r\n  |  ldrb RB, [CARG1], #1\r\n  |   subs CARG4, CARG4, #1\r\n  |   blt ->fff_newstr\r\n  |  strb RB, [CARG2, CARG4]\r\n  |  b <1\r\n  |\r\n  |.macro ffstring_case, name, lo\r\n  |  .ffunc name\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  checkstr CARG2, ->fff_fallback\r\n  |  ldr CARG3, STR:CARG1->len\r\n  |   ldr RB, [DISPATCH, #DISPATCH_GL(tmpbuf.sz)]\r\n  |    ldr CARG2, [DISPATCH, #DISPATCH_GL(tmpbuf.buf)]\r\n  |  mov CARG4, #0\r\n  |  add CARG1, STR:CARG1, #sizeof(GCstr)\r\n  |   cmp RB, CARG3\r\n  |   blo ->fff_fallback\r\n  |1:  // ASCII case conversion.\r\n  |  ldrb RB, [CARG1, CARG4]\r\n  |   cmp CARG4, CARG3\r\n  |   bhs ->fff_newstr\r\n  |  sub RC, RB, #lo\r\n  |  cmp RC, #26\r\n  |  eorlo RB, RB, #0x20\r\n  |  strb RB, [CARG2, CARG4]\r\n  |   add CARG4, CARG4, #1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |ffstring_case string_lower, 65\r\n  |ffstring_case string_upper, 97\r\n  |\r\n  |//-- Table library ------------------------------------------------------\r\n  |\r\n  |.ffunc_1 table_getn\r\n  |  checktab CARG2, ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n  |  // Returns uint32_t (but less than 2^31).\r\n  |  .IOS mov BASE, RA\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |// FP number to bit conversion for soft-float. Clobbers r0-r3.\r\n  |->vm_tobit_fb:\r\n  |  bhi ->fff_fallback\r\n  |->vm_tobit:\r\n  |  lsl RB, CARG2, #1\r\n  |  adds RB, RB, #0x00200000\r\n  |  movpl CARG1, #0\t\t\t// |x| < 1?\r\n  |  bxpl lr\r\n  |  mvn CARG4, #0x3e0\r\n  |  subs RB, CARG4, RB, asr #21\r\n  |  bmi >1\t\t\t\t// |x| >= 2^32?\r\n  |  lsl CARG4, CARG2, #11\r\n  |  orr CARG4, CARG4, #0x80000000\r\n  |  orr CARG4, CARG4, CARG1, lsr #21\r\n  |   cmp CARG2, #0\r\n  |  lsr CARG1, CARG4, RB\r\n  |   rsblt CARG1, CARG1, #0\r\n  |  bx lr\r\n  |1:\r\n  |  add RB, RB, #21\r\n  |  lsr CARG4, CARG1, RB\r\n  |  rsb RB, RB, #20\r\n  |  lsl CARG1, CARG2, #12\r\n  |   cmp CARG2, #0\r\n  |  orr CARG1, CARG4, CARG1, lsl RB\r\n  |   rsblt CARG1, CARG1, #0\r\n  |  bx lr\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_1 bit_..name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit tobit\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  mov CARG3, CARG1\r\n  |  mov RA, #8\r\n  |1:\r\n  |  ldrd CARG12, [BASE, RA]\r\n  |   cmp RA, NARGS8:RC\r\n  |    add RA, RA, #8\r\n  |   bge >2\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |  ins CARG3, CARG3, CARG1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, orr\r\n  |.ffunc_bit_op bxor, eor\r\n  |\r\n  |2:\r\n  |  mvn CARG4, #~LJ_TISNUM\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG34, [BASE, #-8]\r\n  |  b ->fff_res1\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  eor CARG3, CARG1, CARG1, ror #16\r\n  |  bic CARG3, CARG3, #0x00ff0000\r\n  |  ror CARG1, CARG1, #8\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  eor CARG1, CARG1, CARG3, lsr #8\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  mvn CARG1, CARG1\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc bit_..name\r\n  |  ldrd CARG12, [BASE, #8]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |.if shmod == 0\r\n  |  and RA, CARG1, #31\r\n  |.else\r\n  |  rsb RA, CARG1, #0\r\n  |.endif\r\n  |  ldrd CARG12, [BASE]\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |  ins CARG1, CARG1, RA\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, lsl, 0\r\n  |.ffunc_bit_sh rshift, lsr, 0\r\n  |.ffunc_bit_sh arshift, asr, 0\r\n  |.ffunc_bit_sh rol, ror, 1\r\n  |.ffunc_bit_sh ror, ror, 0\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |   ldr CARG3, [BASE, FRAME_FUNC]\r\n  |  ldr CARG2, L->maxstack\r\n  |  add CARG1, BASE, NARGS8:RC\r\n  |    ldr PC, [BASE, FRAME_PC]\t\t// Fallback may overwrite PC.\r\n  |  str CARG1, L->top\r\n  |   ldr CARG3, CFUNC:CARG3->f\r\n  |    str BASE, L->base\r\n  |  add CARG1, CARG1, #8*LUA_MINSTACK\r\n  |    str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  cmp CARG1, CARG2\r\n  |   mov CARG1, L\r\n  |  bhi >5\t\t\t\t// Need to grow stack.\r\n  |   blx CARG3\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |   ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |   lsl RC, CRET1, #3\r\n  |   sub RA, BASE, #8\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |   ldr CARG1, L->top\r\n  |    ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   bic CARG2, PC, #FRAME_TYPEP\r\n  |  ldreq INS, [PC, #-4]\r\n  |  andeq CARG2, MASKR8, INS, lsr #5\t// Conditional decode_RA8.\r\n  |  addeq CARG2, CARG2, #8\r\n  |  sub RB, BASE, CARG2\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->base\r\n  |  cmp CARG1, CARG1\t\t\t// Set zero-flag to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  mov RA, lr\r\n  |   str BASE, L->base\r\n  |  add CARG2, BASE, NARGS8:RC\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  str CARG2, L->top\r\n  |  mov CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |   ldr BASE, L->base\r\n  |  mov lr, RA\t\t\t\t// Help return address predictor.\r\n  |   ldr CFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |  bx lr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  tst CARG1, #HOOK_VMEVENT\t\t// No recording while in vmevent.\r\n  |  bne >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |   ldr CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  tst CARG1, #HOOK_ACTIVE\r\n  |  bne >1\r\n  |   sub CARG2, CARG2, #1\r\n  |  tst CARG1, #LUA_MASKLINE|LUA_MASKCOUNT\r\n  |   strne CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  tst CARG1, #HOOK_ACTIVE\t\t// Hook already active?\r\n  |  beq >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |  decode_OP OP, INS\r\n  |  add OP, DISPATCH, OP, lsl #2\r\n  |  ldr pc, [OP, #GG_DISP2STATIC]\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |   ldr CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  tst CARG1, #HOOK_ACTIVE\t\t// Hook already active?\r\n  |  bne <5\r\n  |  tst CARG1, #LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beq <5\r\n  |   subs CARG2, CARG2, #1\r\n  |   str CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |   beq >1\r\n  |  tst CARG1, #LUA_MASKLINE\r\n  |  beq <5\r\n  |1:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, PC\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  ldr BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  ldrb OP, [PC, #-4]\r\n  |   ldr INS, [PC, #-4]\r\n  |  add OP, DISPATCH, OP, lsl #2\r\n  |  ldr OP, [OP, #GG_DISP2STATIC]\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RD RC, INS\r\n  |  bx OP\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  ldr CARG1, [CARG4, #-24]\r\n  |   add PC, PC, #4\r\n  |  str CARG1, SAVE_MULTRES\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Same as curr_topL(L).\r\n  |   sub CARG1, DISPATCH, #-GG_DISP2J\r\n  |   str PC, SAVE_PC\r\n  |  ldr CARG3, LFUNC:CARG3->field_pc\r\n  |   mov CARG2, PC\r\n  |   str L, [DISPATCH, #DISPATCH_J(L)]\r\n  |  ldrb CARG3, [CARG3, #PC2PROTO(framesize)]\r\n  |   str BASE, L->base\r\n  |  add CARG3, BASE, CARG3, lsl #3\r\n  |  str CARG3, L->top\r\n  |  bl extern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  orr CARG2, PC, #1\r\n  |1:\r\n  |.endif\r\n  |  add CARG4, BASE, RC\r\n  |   str PC, SAVE_PC\r\n  |    mov CARG1, L\r\n  |   str BASE, L->base\r\n  |    sub RA, RA, BASE\r\n  |  str CARG4, L->top\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  ldr BASE, L->base\r\n  |   ldr CARG4, L->top\r\n  |    mov CARG2, #0\r\n  |  add RA, BASE, RA\r\n  |   sub NARGS8:RC, CARG4, BASE\r\n  |    str CARG2, SAVE_PC\t\t// Invalidate for subsequent line hook.\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   ldr INS, [PC, #-4]\r\n  |  bx CRET1\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  sub sp, sp, #12\r\n  |  push {r0,r1,r2,r3,r4,r5,r6,r7,r8,r9,r10,r11,r12}\r\n  |  ldr CARG1, [sp, #64]\t// Load original value of lr.\r\n  |   ldr DISPATCH, [lr]\t// Load DISPATCH.\r\n  |    add CARG3, sp, #64\t// Recompute original value of sp.\r\n  |   mv_vmstate CARG4, EXIT\r\n  |    str CARG3, [sp, #52]\t// Store sp in RID_SP\r\n  |   st_vmstate CARG4\r\n  |  ldr CARG2, [CARG1, #-4]!\t// Get exit instruction.\r\n  |   str CARG1, [sp, #56]\t// Store exit pc in RID_LR and RID_PC.\r\n  |   str CARG1, [sp, #60]\r\n  |.if FPU\r\n  |  vpush {d0-d15}\r\n  |.endif\r\n  |  lsl CARG2, CARG2, #8\r\n  |  add CARG1, CARG1, CARG2, asr #6\r\n  |   ldr CARG2, [lr, #4]\t// Load exit stub group offset.\r\n  |   sub CARG1, CARG1, lr\r\n  |  ldr L, [DISPATCH, #DISPATCH_GL(jit_L)]\r\n  |   add CARG1, CARG2, CARG1, lsr #2\t// Compute exit number.\r\n  |    ldr BASE, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n  |   str CARG1, [DISPATCH, #DISPATCH_J(exitno)]\r\n  |   mov CARG4, #0\r\n  |  str L, [DISPATCH, #DISPATCH_J(L)]\r\n  |    str BASE, L->base\r\n  |   str CARG4, [DISPATCH, #DISPATCH_GL(jit_L)]\r\n  |  sub CARG1, DISPATCH, #-GG_DISP2J\r\n  |  mov CARG2, sp\r\n  |  bl extern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  ldr CARG2, L->cframe\r\n  |   ldr BASE, L->base\r\n  |  bic CARG2, CARG2, #~CFRAME_RAWMASK\t// Use two steps: bic sp is deprecated.\r\n  |  mov sp, CARG2\r\n  |   ldr PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  str L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |  b >1\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |  // CARG1 = MULTRES or negated error code, BASE, PC and DISPATCH set.\r\n  |.if JIT\r\n  |  ldr L, SAVE_L\r\n  |1:\r\n  |  cmp CARG1, #0\r\n  |  blt >3\t\t\t\t// Check for error from exit.\r\n  |   lsl RC, CARG1, #3\r\n  |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n  |   str RC, SAVE_MULTRES\r\n  |   mov CARG3, #0\r\n  |  ldr CARG2, LFUNC:CARG2->field_pc\r\n  |   str CARG3, [DISPATCH, #DISPATCH_GL(jit_L)]\r\n  |    mv_vmstate CARG4, INTERP\r\n  |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  ldrb OP, [PC]\r\n  |     mov MASKR8, #255\r\n  |   ldr INS, [PC], #4\r\n  |     lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |    st_vmstate CARG4\r\n  |  cmp OP, #BC_FUNCF\t\t\t// Function header?\r\n  |  ldr OP, [DISPATCH, OP, lsl #2]\r\n  |   decode_RA8 RA, INS\r\n  |   lsrlo RC, INS, #16\t// No: Decode operands A*8 and D.\r\n  |   subhs RC, RC, #8\r\n  |   addhs RA, RA, BASE\t// Yes: RA = BASE+framesize*8, RC = nargs*8\r\n  |  bx OP\r\n  |\r\n  |3:  // Rethrow error from the right C frame.\r\n  |  rsb CARG2, CARG1, #0\r\n  |  mov CARG1, L\r\n  |  bl extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called from JIT code.\r\n  |//\r\n  |// double lj_vm_floor/ceil/trunc(double x);\r\n  |.macro vm_round, func, hf\r\n  |.if hf == 1\r\n  |  vmov CARG1, CARG2, d0\r\n  |.endif\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  bpl >2\t\t\t\t// |x| < 1?\r\n  |  mvn CARG4, #0x3cc\r\n  |  subs RB, CARG4, RB, asr #21\t// 2^0: RB = 51, 2^51: RB = 0.\r\n  |  bxlo lr\t\t\t\t// |x| >= 2^52: done.\r\n  |  mvn CARG4, #1\r\n  |   bic CARG3, CARG1, CARG4, lsl RB\t// ztest = lo & ~lomask\r\n  |  and CARG1, CARG1, CARG4, lsl RB\t// lo &= lomask\r\n  |  subs RB, RB, #32\r\n  |   bicpl CARG4, CARG2, CARG4, lsl RB\t// |x| <= 2^20: ztest |= hi & ~himask\r\n  |   orrpl CARG3, CARG3, CARG4\r\n  |   mvnpl CARG4, #1\r\n  |  andpl CARG2, CARG2, CARG4, lsl RB\t// |x| <= 2^20: hi &= himask\r\n  |.if \"func\" == \"floor\"\r\n  |   tst CARG3, CARG2, asr #31\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\r\n  |   bics CARG3, CARG3, CARG2, asr #31\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |.if hf == 1\r\n  |  vmoveq d0, CARG1, CARG2\r\n  |.endif\r\n  |  bxeq lr\t\t\t\t// iszero: done.\r\n  |  mvn CARG4, #1\r\n  |  cmp RB, #0\r\n  |  lslpl CARG3, CARG4, RB\r\n  |  mvnmi CARG3, #0\r\n  |  add RB, RB, #32\r\n  |  subs CARG1, CARG1, CARG4, lsl RB\t// lo = lo-lomask\r\n  |  sbc CARG2, CARG2, CARG3\t\t// hi = hi-himask+carry\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |\r\n  |2:  // |x| < 1:\r\n  |  bxcs lr\t\t\t\t// |x| is not finite.\r\n  |  orr CARG3, CARG3, CARG1\t\t// ztest = (2*hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  tst CARG3, CARG2, asr #31\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\r\n  |  bics CARG3, CARG3, CARG2, asr #31\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |  mov CARG1, #0\t\t\t// lo = 0\r\n  |  and CARG2, CARG2, #0x80000000\r\n  |  ldrne CARG4, <9\t\t\t// hi = sign(x) | (iszero ? 0.0 : 1.0)\r\n  |  orrne CARG2, CARG2, CARG4\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |.endmacro\r\n  |\r\n  |9:\r\n  |  .long 0x3ff00000\t\t\t// hiword(+1.0)\r\n  |\r\n  |->vm_floor:\r\n  |.if HFABI\r\n  |  vm_round floor, 1\r\n  |.endif\r\n  |->vm_floor_sf:\r\n  |  vm_round floor, 0\r\n  |\r\n  |->vm_ceil:\r\n  |.if HFABI\r\n  |  vm_round ceil, 1\r\n  |.endif\r\n  |->vm_ceil_sf:\r\n  |  vm_round ceil, 0\r\n  |\r\n  |.macro vm_trunc, hf\r\n  |.if JIT\r\n  |.if hf == 1\r\n  |  vmov CARG1, CARG2, d0\r\n  |.endif\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  andpl CARG2, CARG2, #0x80000000\t// |x| < 1? hi = sign(x), lo = 0.\r\n  |  movpl CARG1, #0\r\n  |.if hf == 1\r\n  |  vmovpl d0, CARG1, CARG2\r\n  |.endif\r\n  |  bxpl lr\r\n  |  mvn CARG4, #0x3cc\r\n  |  subs RB, CARG4, RB, asr #21\t// 2^0: RB = 51, 2^51: RB = 0.\r\n  |  bxlo lr\t\t\t\t// |x| >= 2^52: already done.\r\n  |  mvn CARG4, #1\r\n  |  and CARG1, CARG1, CARG4, lsl RB\t// lo &= lomask\r\n  |  subs RB, RB, #32\r\n  |  andpl CARG2, CARG2, CARG4, lsl RB\t// |x| <= 2^20: hi &= himask\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |->vm_trunc:\r\n  |.if HFABI\r\n  |  vm_trunc 1\r\n  |.endif\r\n  |->vm_trunc_sf:\r\n  |  vm_trunc 0\r\n  |\r\n  |  // double lj_vm_mod(double dividend, double divisor);\r\n  |->vm_mod:\r\n  |.if FPU\r\n  |  // Special calling convention. Also, RC (r11) is not preserved.\r\n  |  vdiv.f64 d0, d6, d7\r\n  |   mov RC, lr\r\n  |  vmov CARG1, CARG2, d0\r\n  |  bl ->vm_floor_sf\r\n  |  vmov d0, CARG1, CARG2\r\n  |  vmul.f64 d0, d0, d7\r\n  |   mov lr, RC\r\n  |  vsub.f64 d6, d6, d0\r\n  |  bx lr\r\n  |.else\r\n  |  push {r0, r1, r2, r3, r4, lr}\r\n  |  bl extern __aeabi_ddiv\r\n  |  bl ->vm_floor_sf\r\n  |  ldrd CARG34, [sp, #8]\r\n  |  bl extern __aeabi_dmul\r\n  |  ldrd CARG34, [sp]\r\n  |  eor CARG2, CARG2, #0x80000000\r\n  |  bl extern __aeabi_dadd\r\n  |  add sp, sp, #20\r\n  |  pop {pc}\r\n  |.endif\r\n  |\r\n  |  // int lj_vm_modi(int dividend, int divisor);\r\n  |->vm_modi:\r\n  |  ands RB, CARG1, #0x80000000\r\n  |  rsbmi CARG1, CARG1, #0\t\t// a = |dividend|\r\n  |  eor RB, RB, CARG2, asr #1\t\t// Keep signdiff and sign(divisor).\r\n  |  cmp CARG2, #0\r\n  |  rsbmi CARG2, CARG2, #0\t\t// b = |divisor|\r\n  |  subs CARG4, CARG2, #1\r\n  |  cmpne CARG1, CARG2\r\n  |  moveq CARG1, #0\t\t\t// if (b == 1 || a == b) a = 0\r\n  |  tsthi CARG2, CARG4\r\n  |  andeq CARG1, CARG1, CARG4\t\t// else if ((b & (b-1)) == 0) a &= b-1\r\n  |  bls >1\r\n  |  // Use repeated subtraction to get the remainder.\r\n  |  clz CARG3, CARG1\r\n  |  clz CARG4, CARG2\r\n  |  sub CARG4, CARG4, CARG3\r\n  |  rsbs CARG3, CARG4, #31\t\t// entry = (31-(clz(b)-clz(a)))*8\r\n  |  addne pc, pc, CARG3, lsl #3\t// Duff's device.\r\n  |  nop\r\n  {\r\n    int i;\r\n    for (i = 31; i >= 0; i--) {\r\n      |  cmp CARG1, CARG2, lsl #i\r\n      |  subhs CARG1, CARG1, CARG2, lsl #i\r\n    }\r\n  }\r\n  |1:\r\n  |  cmp CARG1, #0\r\n  |  cmpne RB, #0\r\n  |  submi CARG1, CARG1, CARG2\t\t// if (y != 0 && signdiff) y = y - b\r\n  |  eors CARG2, CARG1, RB, lsl #1\r\n  |  rsbmi CARG1, CARG1, #0\t\t// if (sign(divisor) != sign(y)) y = -y\r\n  |  bx lr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions.\r\n  |// Saveregs already performed. Callback slot number in [sp], g in r12.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  ldr CTSTATE, GL:r12->ctype_state\r\n  |   add DISPATCH, r12, #GG_G2DISP\r\n  |.if FPU\r\n  |  str r4, SAVE_R4\r\n  |  add r4, sp, CFRAME_SPACE+4+8*8\r\n  |  vstmdb r4!, {d8-d15}\r\n  |.endif\r\n  |.if HFABI\r\n  |  add r12, CTSTATE, #offsetof(CTState, cb.fpr[8])\r\n  |.endif\r\n  |  strd CARG34, CTSTATE->cb.gpr[2]\r\n  |  strd CARG12, CTSTATE->cb.gpr[0]\r\n  |.if HFABI\r\n  |  vstmdb r12!, {d0-d7}\r\n  |.endif\r\n  |  ldr CARG4, [sp]\r\n  |   add CARG3, sp, #CFRAME_SIZE\r\n  |    mov CARG1, CTSTATE\r\n  |  lsr CARG4, CARG4, #3\r\n  |   str CARG3, CTSTATE->cb.stack\r\n  |    mov CARG2, sp\r\n  |  str CARG4, CTSTATE->cb.slot\r\n  |  str CTSTATE, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  bl extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // Returns lua_State *.\r\n  |  ldr BASE, L:CRET1->base\r\n  |    mv_vmstate CARG2, INTERP\r\n  |  ldr RC, L:CRET1->top\r\n  |    mov MASKR8, #255\r\n  |   ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |    mov L, CRET1\r\n  |  sub RC, RC, BASE\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |    st_vmstate CARG2\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  ldr CTSTATE, [DISPATCH, #DISPATCH_GL(ctype_state)]\r\n  |   str BASE, L->base\r\n  |   str CARG4, L->top\r\n  |  str L, CTSTATE->L\r\n  |  mov CARG1, CTSTATE\r\n  |  mov CARG2, RA\r\n  |  bl extern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |  ldrd CARG12, CTSTATE->cb.gpr[0]\r\n  |.if HFABI\r\n  |  vldr d0, CTSTATE->cb.fpr[0]\r\n  |.endif\r\n  |  b ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, r4\r\n  |  push {CCSTATE, r5, r11, lr}\r\n  |  mov CCSTATE, CARG1\r\n  |  ldr CARG1, CCSTATE:CARG1->spadj\r\n  |   ldrb CARG2, CCSTATE->nsp\r\n  |    add CARG3, CCSTATE, #offsetof(CCallState, stack)\r\n  |.if HFABI\r\n  |  add RB, CCSTATE, #offsetof(CCallState, fpr[0])\r\n  |.endif\r\n  |  mov r11, sp\r\n  |  sub sp, sp, CARG1\t\t\t// Readjust stack.\r\n  |   subs CARG2, CARG2, #1\r\n  |.if HFABI\r\n  |  vldm RB, {d0-d7}\r\n  |.endif\r\n  |    ldr RB, CCSTATE->func\r\n  |   bmi >2\r\n  |1:  // Copy stack slots.\r\n  |  ldr CARG4, [CARG3, CARG2, lsl #2]\r\n  |  str CARG4, [sp, CARG2, lsl #2]\r\n  |  subs CARG2, CARG2, #1\r\n  |  bpl <1\r\n  |2:\r\n  |  ldrd CARG12, CCSTATE->gpr[0]\r\n  |  ldrd CARG34, CCSTATE->gpr[2]\r\n  |  blx RB\r\n  |  mov sp, r11\r\n  |.if HFABI\r\n  |  add r12, CCSTATE, #offsetof(CCallState, fpr[4])\r\n  |.endif\r\n  |  strd CRET1, CCSTATE->gpr[0]\r\n  |.if HFABI\r\n  |  vstmdb r12!, {d0-d3}\r\n  |.endif\r\n  |  pop {CCSTATE, r5, r11, pc}\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RC = src2, JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, BASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bne >3\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  bne >4\r\n    |  cmp CARG1, CARG3\r\n    if (op == BC_ISLT) {\r\n      |  sublt PC, RB, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subge PC, RB, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  suble PC, RB, #0x20000\r\n    } else {\r\n      |  subgt PC, RB, #0x20000\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |3: // CARG12 is not an integer.\r\n    |.if FPU\r\n    |   vldr d0, [RA]\r\n    |  bhi ->vmeta_comp\r\n    |  // d0 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |   vldr d1, [RC]\r\n    |  blo >5\r\n    |  bhi ->vmeta_comp\r\n    |  // d0 is a number, CARG3 is an integer.\r\n    |  vmov s4, CARG3\r\n    |  vcvt.f64.s32 d1, s4\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, CARG34 is not an integer.\r\n    |   vldr d1, [RC]\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG1 is an integer, d1 is a number.\r\n    |  vmov s4, CARG1\r\n    |  vcvt.f64.s32 d0, s4\r\n    |5:  // d0 and d1 are numbers.\r\n    |  vcmp.f64 d0, d1\r\n    |  vmrs\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    if (op == BC_ISLT) {\r\n      |  sublo PC, RB, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subhs PC, RB, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  subls PC, RB, #0x20000\r\n    } else {\r\n      |  subhi PC, RB, #0x20000\r\n    }\r\n    |  b <1\r\n    |.else\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG12 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  movlo RA, RB\t\t\t// Save RB.\r\n    |  blo >5\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG12 is a number, CARG3 is an integer.\r\n    |  mov CARG1, CARG3\r\n    |  mov RC, RA\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  mov CARG3, CARG1\r\n    |  mov CARG4, CARG2\r\n    |  ldrd CARG12, [RC]\t\t// Restore first operand.\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, CARG34 is not an integer.\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG1 is an integer, CARG34 is a number.\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  ldrd CARG34, [RC]\t\t// Restore second operand.\r\n    |5:  // CARG12 and CARG34 are numbers.\r\n    |  bl extern __aeabi_cdcmple\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    if (op == BC_ISLT) {\r\n      |  sublo PC, RA, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subhs PC, RA, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  subls PC, RA, #0x20000\r\n    } else {\r\n      |  subhi PC, RA, #0x20000\r\n    }\r\n    |  b <1\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RC = src2, JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, BASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  cmnls CARG4, #-LJ_TISNUM\r\n    if (vk) {\r\n      |  bls ->BC_ISEQN_Z\r\n    } else {\r\n      |  bls ->BC_ISNEN_Z\r\n    }\r\n    |  // Either or both types are not numbers.\r\n    |.if FFI\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  checktpne CARG4, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG2, CARG4\t\t\t// Compare types.\r\n    |  bne >2\t\t\t\t// Not the same type?\r\n    |  checktp CARG2, LJ_TISPRI\r\n    |  bhs >1\t\t\t\t// Same type and primitive type?\r\n    |\r\n    |  // Same types and not a primitive type. Compare GCobj or pvalue.\r\n    |  cmp CARG1, CARG3\r\n    if (vk) {\r\n      |  bne >3\t\t\t\t// Different GCobjs or pvalues?\r\n      |1:  // Branch if same.\r\n      |  sub PC, RB, #0x20000\r\n      |2:  // Different.\r\n      |  ins_next\r\n      |3:\r\n      |  checktp CARG2, LJ_TISTABUD\r\n      |  bhi <2\t\t\t\t// Different objects and not table/ud?\r\n    } else {\r\n      |  beq >1\t\t\t\t// Same GCobjs or pvalues?\r\n      |  checktp CARG2, LJ_TISTABUD\r\n      |  bhi >2\t\t\t\t// Different objects and not table/ud?\r\n    }\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    if (vk) {\r\n      |  beq <2\t\t\t// No metatable?\r\n    } else {\r\n      |  beq >2\t\t\t// No metatable?\r\n    }\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |   mov CARG4, #1-vk\t\t// ne = 0 or 1.\r\n    |   mov CARG2, CARG1\r\n    |  tst RA, #1<<MM_eq\r\n    |  beq ->vmeta_equal\t\t// 'no __eq' flag not set?\r\n    if (vk) {\r\n      |  b <2\r\n    } else {\r\n      |2:  // Branch if different.\r\n      |  sub PC, RB, #0x20000\r\n      |1:  // Same.\r\n      |  ins_next\r\n    }\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RC = str_const (~), JMP with RC = target\r\n    |   mvn RC, RC\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldr STR:CARG3, [KBASE, RC, lsl #2]\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TSTR\r\n    |.if FFI\r\n    |  bne >7\r\n    |  cmp CARG1, CARG3\r\n    |.else\r\n    |  cmpeq CARG1, CARG3\r\n    |.endif\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n      |1:\r\n    } else {\r\n      |1:\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  ins_next\r\n    |\r\n    |.if FFI\r\n    |7:\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  bne <1\r\n    |  b ->vmeta_equal_cd\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RC = num_const (~), JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, KBASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:\r\n    } else {\r\n      |->BC_ISNEN_Z:\r\n    }\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bne >3\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  bne >4\r\n    |  cmp CARG1, CARG3\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n      |1:\r\n    } else {\r\n      |1:\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // CARG12 is not an integer.\r\n    |.if FFI\r\n    |  bhi >7\r\n    |.else\r\n    if (!vk) {\r\n      |  subhi PC, RB, #0x20000\r\n    }\r\n    |  bhi <2\r\n    |.endif\r\n    |.if FPU\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  vmov s4, CARG3\r\n    |   vldr d0, [RA]\r\n    |  vldrlo d1, [RC]\r\n    |  vcvths.f64.s32 d1, s4\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, d1 is a number.\r\n    |  vmov s4, CARG1\r\n    |   vldr d1, [RC]\r\n    |  vcvt.f64.s32 d0, s4\r\n    |5:  // d0 and d1 are numbers.\r\n    |  vcmp.f64 d0, d1\r\n    |  vmrs\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n    } else {\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  b <2\r\n    |.else\r\n    |  // CARG12 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  movlo RA, RB\t\t\t// Save RB.\r\n    |  blo >5\r\n    |  // CARG12 is a number, CARG3 is an integer.\r\n    |  mov CARG1, CARG3\r\n    |  mov RC, RA\r\n    |4:  // CARG1 is an integer, CARG34 is a number.\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  ldrd CARG34, [RC]\t\t// Restore other operand.\r\n    |5:  // CARG12 and CARG34 are numbers.\r\n    |  bl extern __aeabi_cdcmpeq\r\n    if (vk) {\r\n      |  subeq PC, RA, #0x20000\r\n    } else {\r\n      |  subne PC, RA, #0x20000\r\n    }\r\n    |  b <2\r\n    |.endif\r\n    |\r\n    |.if FFI\r\n    |7:\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  bne <1\r\n    |  b ->vmeta_equal_cd\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RC = primitive_type (~), JMP with RC = target\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |   ldrh RB, [PC, #2]\r\n    |   add PC, PC, #4\r\n    |  mvn RC, RC\r\n    |   add RB, PC, RB, lsl #2\r\n    |.if FFI\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG2, RC\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n    } else {\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RC = src, JMP with RC = target\r\n    |  add RC, BASE, RC, lsl #3\r\n    |   ldrh RB, [PC, #2]\r\n    |  ldrd CARG12, [RC]\r\n    |   add PC, PC, #4\r\n    |   add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TTRUE\r\n    if (op == BC_ISTC || op == BC_IST) {\r\n      |  subls PC, RB, #0x20000\r\n      if (op == BC_ISTC) {\r\n\t|  strdls CARG12, [BASE, RA]\r\n      }\r\n    } else {\r\n      |  subhi PC, RB, #0x20000\r\n      if (op == BC_ISFC) {\r\n\t|  strdhi CARG12, [BASE, RA]\r\n      }\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |   ins_next1\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RC = src\r\n    |  add RC, BASE, RC, lsl #3\r\n    |   ins_next1\r\n    |  ldr CARG1, [RC, #4]\r\n    |   add RA, BASE, RA\r\n    |   ins_next2\r\n    |  checktp CARG1, LJ_TTRUE\r\n    |  mvnls CARG2, #~LJ_TFALSE\r\n    |  mvnhi CARG2, #~LJ_TTRUE\r\n    |  str CARG2, [RA, #4]\r\n    |   ins_next3\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bhi ->vmeta_unm\r\n    |  eorne CARG2, CARG2, #0x80000000\r\n    |  bne >5\r\n    |  rsbseq CARG1, CARG1, #0\r\n    |  ldrdvs CARG12, >9\r\n    |5:\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |.align 8\r\n    |9:\r\n    |  .long 0x00000000, 0x41e00000\t// 2^31.\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |  checkstr CARG2, >2\r\n    |  ldr CARG1, STR:CARG1->len\r\n    |1:\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |2:\r\n    |  checktab CARG2, ->vmeta_len\r\n#if LJ_52\r\n    |  ldr TAB:CARG3, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG3, #0\r\n    |  bne >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  .IOS mov RC, BASE\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  .IOS mov BASE, RC\r\n    |  b <1\r\n#if LJ_52\r\n    |9:\r\n    |  ldrb CARG4, TAB:CARG3->nomm\r\n    |  tst CARG4, #1<<MM_len\r\n    |  bne <3\t\t\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithcheck, cond, ncond, target\r\n    ||if (vk == 1) {\r\n    |   cmn CARG4, #-LJ_TISNUM\r\n    |    cmn..cond CARG2, #-LJ_TISNUM\r\n    ||} else {\r\n    |   cmn CARG2, #-LJ_TISNUM\r\n    |    cmn..cond CARG4, #-LJ_TISNUM\r\n    ||}\r\n    |  b..ncond target\r\n    |.endmacro\r\n    |.macro ins_arithcheck_int, target\r\n    |  ins_arithcheck eq, ne, target\r\n    |.endmacro\r\n    |.macro ins_arithcheck_num, target\r\n    |  ins_arithcheck lo, hs, target\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpre\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   .if FPU\r\n    |   ldrd CARG12, [RB, BASE]!\r\n    |    ldrd CARG34, [RC, KBASE]!\r\n    |   .else\r\n    |   ldrd CARG12, [BASE, RB]\r\n    |    ldrd CARG34, [KBASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||case 1:\r\n    |   .if FPU\r\n    |   ldrd CARG34, [RB, BASE]!\r\n    |    ldrd CARG12, [RC, KBASE]!\r\n    |   .else\r\n    |   ldrd CARG34, [BASE, RB]\r\n    |    ldrd CARG12, [KBASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||default:\r\n    |   .if FPU\r\n    |   ldrd CARG12, [RB, BASE]!\r\n    |    ldrd CARG34, [RC, BASE]!\r\n    |   .else\r\n    |   ldrd CARG12, [BASE, RB]\r\n    |    ldrd CARG34, [BASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpre_fpu, reg1, reg2\r\n    |.if FPU\r\n    ||if (vk == 1) {\r\n    |  vldr reg2, [RB]\r\n    |  vldr reg1, [RC]\r\n    ||} else {\r\n    |  vldr reg1, [RB]\r\n    |  vldr reg2, [RC]\r\n    ||}\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpost_fpu, reg\r\n    |   ins_next1\r\n    |  add RA, BASE, RA\r\n    |   ins_next2\r\n    |  vstr reg, [RA]\r\n    |   ins_next3\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfallback, ins\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ins ->vmeta_arith_vn\r\n    ||  break;\r\n    ||case 1:\r\n    |   ins ->vmeta_arith_nv\r\n    ||  break;\r\n    ||default:\r\n    |   ins ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins, fpins, fpcall\r\n    |  ins_arithpre\r\n    |.if \"intins\" ~= \"vm_modi\" and not FPU\r\n    |   ins_next1\r\n    |.endif\r\n    |  ins_arithcheck_int >5\r\n    |.if \"intins\" == \"smull\"\r\n    |  smull CARG1, RC, CARG3, CARG1\r\n    |  cmp RC, CARG1, asr #31\r\n    |  ins_arithfallback bne\r\n    |.elif \"intins\" == \"vm_modi\"\r\n    |  movs CARG2, CARG3\r\n    |  ins_arithfallback beq\r\n    |  bl ->vm_modi\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |.else\r\n    |  intins CARG1, CARG1, CARG3\r\n    |  ins_arithfallback bvs\r\n    |.endif\r\n    |4:\r\n    |.if \"intins\" == \"vm_modi\" or FPU\r\n    |   ins_next1\r\n    |.endif\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |5:  // FP variant.\r\n    |  ins_arithpre_fpu d6, d7\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |.if FPU\r\n    |.if \"intins\" == \"vm_modi\"\r\n    |  bl fpcall\r\n    |.else\r\n    |  fpins d6, d6, d7\r\n    |.endif\r\n    |  ins_arithpost_fpu d6\r\n    |.else\r\n    |  bl fpcall\r\n    |.if \"intins\" ~= \"vm_modi\"\r\n    |  ins_next1\r\n    |.endif\r\n    |  b <4\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfp, fpins, fpcall\r\n    |  ins_arithpre\r\n    |.if \"fpins\" ~= \"extern\" or HFABI\r\n    |  ins_arithpre_fpu d0, d1\r\n    |.endif\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |.if \"fpins\" == \"extern\"\r\n    |  .IOS mov RC, BASE\r\n    |  bl fpcall\r\n    |  .IOS mov BASE, RC\r\n    |.elif FPU\r\n    |  fpins d0, d0, d1\r\n    |.else\r\n    |  bl fpcall\r\n    |.endif\r\n    |.if (\"fpins\" ~= \"extern\" or HFABI) and FPU\r\n    |  ins_arithpost_fpu d0\r\n    |.else\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arithdn adds, vadd.f64, extern __aeabi_dadd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arithdn subs, vsub.f64, extern __aeabi_dsub\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arithdn smull, vmul.f64, extern __aeabi_dmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arithfp vdiv.f64, extern __aeabi_ddiv\r\n    break;\r\n  case BC_MODVN: case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithdn vm_modi, vm_mod, ->vm_mod\r\n    break;\r\n  case BC_POW:\r\n    |  // NYI: (partial) integer arithmetic.\r\n    |  ins_arithfp extern, extern pow\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  decode_RB8 RC, INS\r\n    |   decode_RC8 RB, INS\r\n    |  // RA = dst*8, RC = src_start*8, RB = src_end*8  (note: RB/RC swapped!)\r\n    |  sub CARG3, RB, RC\r\n    |   str BASE, L->base\r\n    |  add CARG2, BASE, RB\r\n    |->BC_CAT_Z:\r\n    |  // RA = dst*8, RC = src_start*8, CARG2 = top-1\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  lsr CARG3, CARG3, #3\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  ldr BASE, L->base\r\n    |  cmp CRET1, #0\r\n    |  bne ->vmeta_binop\r\n    |  ldrd CARG34, [BASE, RC]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\t\t// Copy result to RA.\r\n    |   ins_next3\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |  ldr CARG1, [KBASE, RC, lsl #2]\r\n    |  mvn CARG2, #~LJ_TSTR\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RC = cdata_const (~)\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |  ldr CARG1, [KBASE, RC, lsl #2]\r\n    |  mvn CARG2, #~LJ_TCDATA\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, (RC = int16_literal)\r\n    |  mov CARG1, INS, asr #16\t\t\t// Refetch sign-extended reg.\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RC = num_const\r\n    |  lsl RC, RC, #3\r\n    |   ins_next1\r\n    |  ldrd CARG12, [KBASE, RC]\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RC = primitive_type (~)\r\n    |  add RA, BASE, RA\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  str RC, [RA, #4]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RC = end\r\n    |  add RA, BASE, RA\r\n    |   add RC, BASE, RC, lsl #3\r\n    |  mvn CARG1, #~LJ_TNIL\r\n    |  str CARG1, [RA, #4]\r\n    |   add RA, RA, #8\r\n    |1:\r\n    |  str CARG1, [RA, #4]\r\n    |  cmp RA, RC\r\n    |   add RA, RA, #8\r\n    |  blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RC = uvnum\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsl RC, RC, #2\r\n    |   add RC, RC, #offsetof(GCfuncL, uvptr)\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RC]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |  ldrd CARG34, [CARG2]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RC = src\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    lsl RC, RC, #3\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldrd CARG34, [BASE, RC]\r\n    |  ldrb RB, UPVAL:CARG2->marked\r\n    |  ldrb RC, UPVAL:CARG2->closed\r\n    |    ldr CARG2, UPVAL:CARG2->v\r\n    |  tst RB, #LJ_GC_BLACK\t\t// isblack(uv)\r\n    |   add RB, CARG4, #-LJ_TISGCV\r\n    |  cmpne RC, #0\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >2\t\t\t\t// Upvalue is closed and black?\r\n    |1:\r\n    |   ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  cmn RB, #-(LJ_TNUMX - LJ_TISGCV)\r\n    |   ldrbhi RC, GCOBJ:CARG3->gch.marked\r\n    |  bls <1\t\t\t\t// tvisgcv(v)\r\n    |    sub CARG1, DISPATCH, #-GG_DISP2G\r\n    |   tst RC, #LJ_GC_WHITES\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if IOS\r\n    |  beq <1\r\n    |  mov RC, BASE\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RC\r\n    |.else\r\n    |  blne extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.endif\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RC = str_const (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    mvn RC, RC\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldr STR:CARG3, [KBASE, RC, lsl #2]\r\n    |  ldrb RB, UPVAL:CARG2->marked\r\n    |     ldrb RC, UPVAL:CARG2->closed\r\n    |   ldr CARG2, UPVAL:CARG2->v\r\n    |    mvn CARG4, #~LJ_TSTR\r\n    |  tst RB, #LJ_GC_BLACK\t\t// isblack(uv)\r\n    |    ldrb RB, STR:CARG3->marked\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >2\r\n    |1:\r\n    |   ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  tst RB, #LJ_GC_WHITES\t\t// iswhite(str)\r\n    |  cmpne RC, #0\r\n    |   sub CARG1, DISPATCH, #-GG_DISP2G\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if IOS\r\n    |  beq <1\r\n    |  mov RC, BASE\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RC\r\n    |.else\r\n    |  blne extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.endif\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RC = num_const\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    lsl RC, RC, #3\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldrd CARG34, [KBASE, RC]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [CARG2]\r\n    |   ins_next3\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RC = primitive_type (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |   mvn RC, RC\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  str RC, [CARG2, #4]\r\n    |   ins_next3\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RC = target\r\n    |  ldr CARG3, L->openupval\r\n    |   add RC, PC, RC, lsl #2\r\n    |   str BASE, L->base\r\n    |  cmp CARG3, #0\r\n    |   sub PC, RC, #0x20000\r\n    |  beq >1\r\n    |   mov CARG1, L\r\n    |   add CARG2, BASE, RA\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  ldr BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RC = proto_const (~) (holding function prototype)\r\n    |  mvn RC, RC\r\n    |   str BASE, L->base\r\n    |  ldr CARG2, [KBASE, RC, lsl #2]\r\n    |   str PC, SAVE_PC\r\n    |  ldr CARG3, [BASE, FRAME_FUNC]\r\n    |   mov CARG1, L\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  ldr BASE, L->base\r\n    |  mvn CARG2, #~LJ_TFUNC\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RC = (hbits|asize) | tab_const (~)\r\n    if (op == BC_TDUP) {\r\n      |  mvn RC, RC\r\n    }\r\n    |  ldr CARG3, [DISPATCH, #DISPATCH_GL(gc.total)]\r\n    |   ldr CARG4, [DISPATCH, #DISPATCH_GL(gc.threshold)]\r\n    |    str BASE, L->base\r\n    |    str PC, SAVE_PC\r\n    |  cmp CARG3, CARG4\r\n    |   mov CARG1, L\r\n    |  bhs >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  lsl CARG2, RC, #21\r\n      |   lsr CARG3, RC, #11\r\n      |  asr RC, CARG2, #21\r\n      |  lsr CARG2, CARG2, #21\r\n      |  cmn RC, #1\r\n      |  addeq CARG2, CARG2, #2\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns GCtab *.\r\n    } else {\r\n      |  ldr CARG2, [KBASE, RC, lsl #2]\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns GCtab *.\r\n    }\r\n    |  ldr BASE, L->base\r\n    |  mvn CARG2, #~LJ_TTAB\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |5:\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mov CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n  case BC_GSET:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   mvn RC, RC\r\n    |  ldr TAB:CARG1, LFUNC:CARG2->env\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  ldrd TAB:CARG12, [BASE, RB]\r\n    |   ldrd CARG34, [BASE, RC]\r\n    |  checktab CARG2, ->vmeta_tgetv  // STALL: load CARG12.\r\n    |   checktp CARG4, LJ_TISNUM\t// Integer key?\r\n    |  ldreq CARG4, TAB:CARG1->array\r\n    |    ldreq CARG2, TAB:CARG1->asize\r\n    |   bne >9\r\n    |\r\n    |  add CARG4, CARG4, CARG3, lsl #3\r\n    |    cmp CARG3, CARG2\t\t// In array part?\r\n    |  ldrdlo CARG34, [CARG4]\r\n    |    bhs ->vmeta_tgetv\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  beq >5\r\n    |1:\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG2, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG2, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG2->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  decode_RB8 RB, INS\t\t// Restore RB.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |9:\r\n    |  checktp CARG4, LJ_TSTR\t\t// String key?\r\n    |   moveq STR:RC, CARG3\r\n    |  beq ->BC_TGETS_Z\r\n    |  b ->vmeta_tgetv\r\n    break;\r\n  case BC_TGETS:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst*8, RB = table*8, RC = str_const (~)\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]  // STALL: early RC.\r\n    |  checktab CARG2, ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // (TAB:RB =) TAB:CARG1 = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  ldr CARG3, TAB:CARG1->hmask\r\n    |   ldr CARG4, STR:RC->hash\r\n    |    ldr NODE:INS, TAB:CARG1->node\r\n    |     mov TAB:RB, TAB:CARG1\r\n    |  and CARG3, CARG3, CARG4\t\t\t// idx = str->hash & tab->hmask\r\n    |  add CARG3, CARG3, CARG3, lsl #1\r\n    |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n    |1:\r\n    |  ldrd CARG12, NODE:INS->key  // STALL: early NODE:INS.\r\n    |   ldrd CARG34, NODE:INS->val\r\n    |    ldr NODE:INS, NODE:INS->next\r\n    |  checktp CARG2, LJ_TSTR\r\n    |  cmpeq CARG1, STR:RC\r\n    |  bne >4\r\n    |   checktp CARG4, LJ_TNIL\r\n    |   beq >5\r\n    |3:\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  cmp NODE:INS, #0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |   mov CARG3, #0  // Optional clear of undef. value (during load stall).\r\n    |   mvn CARG4, #~LJ_TNIL\r\n    |  cmp TAB:CARG1, #0\r\n    |  beq <3\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG1->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst*8, RB = table*8, RC = index\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |  checktab CARG2, ->vmeta_tgetb  // STALL: load CARG12.\r\n    |   ldr CARG3, TAB:CARG1->asize\r\n    |  ldr CARG4, TAB:CARG1->array\r\n    |  lsl CARG2, RC, #3\r\n    |   cmp RC, CARG3\r\n    |  ldrdlo CARG34, [CARG4, CARG2]\r\n    |   bhs ->vmeta_tgetb\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  beq >5\r\n    |1:\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG2, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG2, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG2->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  ldrd TAB:CARG12, [BASE, RB]\r\n    |   ldrd CARG34, [BASE, RC]\r\n    |  checktab CARG2, ->vmeta_tsetv  // STALL: load CARG12.\r\n    |   checktp CARG4, LJ_TISNUM\t// Integer key?\r\n    |  ldreq CARG2, TAB:CARG1->array\r\n    |    ldreq CARG4, TAB:CARG1->asize\r\n    |   bne >9\r\n    |\r\n    |  add CARG2, CARG2, CARG3, lsl #3\r\n    |    cmp CARG3, CARG4\t\t// In array part?\r\n    |  ldrlo INS, [CARG2, #4]\r\n    |    bhs ->vmeta_tsetv\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp INS, LJ_TNIL\r\n    |  ldrb INS, TAB:CARG1->marked\r\n    |   ldrd CARG34, [BASE, RA]\r\n    |  beq >5\r\n    |1:\r\n    |  tst INS, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >7\r\n    |2:\r\n    |   ins_next2\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |  tst RA, #1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  ldr INS, [PC, #-4]\t\t// Restore RA and RB.\r\n    |  decode_RB8 RB, INS\r\n    |  decode_RA8 RA, INS\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG1, INS, CARG3\r\n    |  b <2\r\n    |\r\n    |9:\r\n    |  checktp CARG4, LJ_TSTR\t\t// String key?\r\n    |   moveq STR:RC, CARG3\r\n    |  beq ->BC_TSETS_Z\r\n    |  b ->vmeta_tsetv\r\n    break;\r\n  case BC_TSETS:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src*8, RB = table*8, RC = str_const (~)\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]  // STALL: early RC.\r\n    |  checktab CARG2, ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // (TAB:RB =) TAB:CARG1 = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  ldr CARG3, TAB:CARG1->hmask\r\n    |   ldr CARG4, STR:RC->hash\r\n    |    ldr NODE:INS, TAB:CARG1->node\r\n    |     mov TAB:RB, TAB:CARG1\r\n    |  and CARG3, CARG3, CARG4\t\t\t// idx = str->hash & tab->hmask\r\n    |  add CARG3, CARG3, CARG3, lsl #1\r\n    |   mov CARG4, #0\r\n    |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n    |   strb CARG4, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |1:\r\n    |  ldrd CARG12, NODE:INS->key\r\n    |   ldr CARG4, NODE:INS->val.it\r\n    |    ldr NODE:CARG3, NODE:INS->next\r\n    |  checktp CARG2, LJ_TSTR\r\n    |  cmpeq CARG1, STR:RC\r\n    |  bne >5\r\n    |  ldrb CARG2, TAB:RB->marked\r\n    |   checktp CARG4, LJ_TNIL\t\t// Key found, but nil value?\r\n    |    ldrd CARG34, [BASE, RA]\r\n    |   beq >4\r\n    |2:\r\n    |  tst CARG2, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |    strd CARG34, NODE:INS->val\r\n    |  bne >7\r\n    |3:\r\n    |   ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |  cmp TAB:CARG1, #0\r\n    |  beq <2\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG1, TAB:CARG1->nomm\r\n    |  tst CARG1, #1<<MM_newindex\r\n    |  bne <2\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  movs NODE:INS, NODE:CARG3\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |   mov CARG3, TMPDp\r\n    |   str PC, SAVE_PC\r\n    |  cmp TAB:CARG1, #0\t\t// No metatable: continue.\r\n    |   str BASE, L->base\r\n    |  ldrbne CARG2, TAB:CARG1->nomm\r\n    |   mov CARG1, L\r\n    |  beq >6\r\n    |  tst CARG2, #1<<MM_newindex\r\n    |  beq ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mvn CARG4, #~LJ_TSTR\r\n    |   str STR:RC, TMPDlo\r\n    |   mov CARG2, TAB:RB\r\n    |  str CARG4, TMPDhi\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  ldr BASE, L->base\r\n    |  ldrd CARG34, [BASE, RA]\r\n    |  strd CARG34, [CRET1]\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, CARG2, CARG3\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src*8, RB = table*8, RC = index\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |  checktab CARG2, ->vmeta_tsetb  // STALL: load CARG12.\r\n    |   ldr CARG3, TAB:CARG1->asize\r\n    |  ldr RB, TAB:CARG1->array\r\n    |  lsl CARG2, RC, #3\r\n    |   cmp RC, CARG3\r\n    |  ldrdlo CARG34, [CARG2, RB]!\r\n    |   bhs ->vmeta_tsetb\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  ldrb INS, TAB:CARG1->marked\r\n    |   ldrd CARG34, [BASE, RA]\r\n    |  beq >5\r\n    |1:\r\n    |  tst INS, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |    strd CARG34, [CARG2]\r\n    |  bne >7\r\n    |2:\r\n    |   ins_next2\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |  tst RA, #1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  ldr INS, [PC, #-4]\t\t// Restore INS.\r\n    |  decode_RA8 RA, INS\r\n    |  b ->vmeta_tsetb\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG1, INS, CARG3\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RC = num_const (start index)\r\n    |  add RA, BASE, RA\r\n    |1:\r\n    |   ldr RB, SAVE_MULTRES\r\n    |  ldr TAB:CARG2, [RA, #-8]\t\t// Guaranteed to be a table.\r\n    |  ldr CARG1, [KBASE, RC, lsl #3]\t// Integer constant is in lo-word.\r\n    |   subs RB, RB, #8\r\n    |  ldr CARG4, TAB:CARG2->asize\r\n    |   beq >4\t\t\t\t// Nothing to copy?\r\n    |  add CARG3, CARG1, RB, lsr #3\r\n    |  cmp CARG3, CARG4\r\n    |   ldr CARG4, TAB:CARG2->array\r\n    |    add RB, RA, RB\r\n    |  bhi >5\r\n    |   add INS, CARG4, CARG1, lsl #3\r\n    |    ldrb CARG1, TAB:CARG2->marked\r\n    |3:  // Copy result slots to table.\r\n    |   ldrd CARG34, [RA], #8\r\n    |   strd CARG34, [INS], #8\r\n    |  cmp RA, RB\r\n    |  blo <3\r\n    |    tst CARG1, #LJ_GC_BLACK\t// isblack(table)\r\n    |    bne >7\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   str BASE, L->base\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  .IOS ldr BASE, L->base\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, CARG1, CARG3\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = nresults+1,) RC = extra_nargs\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |  decode_RC8 NARGS8:RC, INS\r\n    |  add NARGS8:RC, NARGS8:RC, CARG1\r\n    |  b ->BC_CALL_Z\r\n    break;\r\n  case BC_CALL:\r\n    |  decode_RC8 NARGS8:RC, INS\r\n    |  // RA = base*8, (RB = nresults+1,) RC = (nargs+1)*8\r\n    |->BC_CALL_Z:\r\n    |  mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |  ldrd CARG34, [BASE, RA]!\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add BASE, BASE, #8\r\n    |  checkfunc CARG4, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |  add NARGS8:RC, CARG1, RC, lsl #3\r\n    |  b ->BC_CALLT1_Z\r\n    break;\r\n  case BC_CALLT:\r\n    |  lsl NARGS8:RC, RC, #3\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |->BC_CALLT1_Z:\r\n    |  ldrd LFUNC:CARG34, [RA, BASE]!\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add RA, RA, #8\r\n    |  checkfunc CARG4, ->vmeta_callt\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |->BC_CALLT2_Z:\r\n    |   mov RB, #0\r\n    |   ldrb CARG4, LFUNC:CARG3->ffid\r\n    |  tst PC, #FRAME_TYPE\r\n    |  bne >7\r\n    |1:\r\n    |  str LFUNC:CARG3, [BASE, FRAME_FUNC]  // Copy function down, but keep PC.\r\n    |  cmp NARGS8:RC, #0\r\n    |  beq >3\r\n    |2:\r\n    |  ldrd CARG12, [RA, RB]\r\n    |   add INS, RB, #8\r\n    |   cmp INS, NARGS8:RC\r\n    |  strd CARG12, [BASE, RB]\r\n    |    mov RB, INS\r\n    |   bne <2\r\n    |3:\r\n    |  cmp CARG4, #1\t\t\t// (> FF_C) Calling a fast function?\r\n    |  bhi >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  ldr INS, [PC, #-4]\r\n    |  decode_RA8 RA, INS\r\n    |  sub CARG1, BASE, RA\r\n    |  ldr LFUNC:CARG1, [CARG1, #-16]\r\n    |  ldr CARG1, LFUNC:CARG1->field_pc\r\n    |  ldr KBASE, [CARG1, #PC2PROTO(k)]\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  eor PC, PC, #FRAME_VARG\r\n    |  tst PC, #FRAME_TYPEP\t\t// Vararg frame below?\r\n    |  movne CARG4, #0\t\t\t// Clear ffid if no Lua function below.\r\n    |  bne <1\r\n    |  sub BASE, BASE, PC\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  tst PC, #FRAME_TYPE\r\n    |  movne CARG4, #0\t\t\t// Clear ffid if no Lua function below.\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |  add RA, BASE, RA\r\n    |   mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |  ldrd CARG34, [RA, #-16]\r\n    |   ldrd CARG12, [RA, #-8]\r\n    |    add BASE, RA, #8\r\n    |  strd CARG34, [RA, #8]\t\t// Copy state.\r\n    |   strd CARG12, [RA, #16]\t\t// Copy control var.\r\n    |  // STALL: locked CARG34.\r\n    |  ldrd LFUNC:CARG34, [RA, #-24]\r\n    |    mov NARGS8:RC, #16\t\t// Iterators get 2 arguments.\r\n    |  // STALL: load CARG34.\r\n    |  strd LFUNC:CARG34, [RA]\t\t// Copy callable.\r\n    |  checkfunc CARG4, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA\r\n    |  ldr TAB:RB, [RA, #-16]\r\n    |  ldr CARG1, [RA, #-8]\t\t// Get index from control var.\r\n    |  ldr INS, TAB:RB->asize\r\n    |   ldr CARG2, TAB:RB->array\r\n    |    add PC, PC, #4\r\n    |1:  // Traverse array part.\r\n    |  subs RC, CARG1, INS\r\n    |   add CARG3, CARG2, CARG1, lsl #3\r\n    |  bhs >5\t\t\t\t// Index points after array part?\r\n    |   ldrd CARG34, [CARG3]\r\n    |   checktp CARG4, LJ_TNIL\r\n    |   addeq CARG1, CARG1, #1\t\t// Skip holes in array part.\r\n    |   beq <1\r\n    |  ldrh RC, [PC, #-2]\r\n    |   mvn CARG2, #~LJ_TISNUM\r\n    |    strd CARG34, [RA, #8]\r\n    |  add RC, PC, RC, lsl #2\r\n    |    add RB, CARG1, #1\r\n    |   strd CARG12, [RA]\r\n    |  sub PC, RC, #0x20000\r\n    |    str RB, [RA, #-8]\t\t// Update control var.\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  ldr CARG4, TAB:RB->hmask\r\n    |   ldr NODE:RB, TAB:RB->node\r\n    |6:\r\n    |   add CARG1, RC, RC, lsl #1\r\n    |  cmp RC, CARG4\t\t\t// End of iteration? Branch to ITERL+1.\r\n    |   add NODE:CARG3, NODE:RB, CARG1, lsl #3  // node = tab->node + idx*3*8\r\n    |  bhi <3\r\n    |   ldrd CARG12, NODE:CARG3->val\r\n    |   checktp CARG2, LJ_TNIL\r\n    |   add RC, RC, #1\r\n    |   beq <6\t\t\t\t// Skip holes in hash part.\r\n    |  ldrh RB, [PC, #-2]\r\n    |   add RC, RC, INS\r\n    |    ldrd CARG34, NODE:CARG3->key\r\n    |   str RC, [RA, #-8]\t\t// Update control var.\r\n    |   strd CARG12, [RA, #8]\r\n    |  add RC, PC, RB, lsl #2\r\n    |  sub PC, RC, #0x20000\r\n    |    strd CARG34, [RA]\r\n    |  b <3\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RC = target (points to ITERN)\r\n    |  add RA, BASE, RA\r\n    |     add RC, PC, RC, lsl #2\r\n    |  ldrd CFUNC:CARG12, [RA, #-24]\r\n    |   ldr CARG3, [RA, #-12]\r\n    |    ldr CARG4, [RA, #-4]\r\n    |  checktp CARG2, LJ_TFUNC\r\n    |  ldrbeq CARG1, CFUNC:CARG1->ffid\r\n    |   checktpeq CARG3, LJ_TTAB\r\n    |    checktpeq CARG4, LJ_TNIL\r\n    |  cmpeq CARG1, #FF_next_N\r\n    |     subeq PC, RC, #0x20000\r\n    |  bne >5\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  mov CARG1, #0\r\n    |  mvn CARG2, #0x00018000\r\n    |  strd CARG1, [RA, #-8]\t\t// Initialize control var.\r\n    |1:\r\n    |   ins_next3\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov CARG1, #BC_JMP\r\n    |   mov OP, #BC_ITERC\r\n    |  strb CARG1, [PC, #-4]\r\n    |   sub PC, RC, #0x20000\r\n    |   strb OP, [PC]\t\t\t// Subsumes ins_next1.\r\n    |   ins_next2\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  ldr CARG1, [BASE, FRAME_PC]\r\n    |  add RC, BASE, RC\r\n    |   add RA, BASE, RA\r\n    |  add RC, RC, #FRAME_VARG\r\n    |   add CARG4, RA, RB\r\n    |  sub CARG3, BASE, #8\t\t// CARG3 = vtop\r\n    |  sub RC, RC, CARG1\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  cmp RB, #0\r\n    |   sub CARG1, CARG3, RC\r\n    |  beq >5\t\t\t\t// Copy all varargs?\r\n    |   sub CARG4, CARG4, #16\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  cmp RC, CARG3\r\n    |  ldrdlo CARG12, [RC], #8\r\n    |  mvnhs CARG2, #~LJ_TNIL\r\n    |   cmp RA, CARG4\r\n    |  strd CARG12, [RA], #8\r\n    |   blo <1\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  ldr CARG4, L->maxstack\r\n    |   cmp CARG1, #0\r\n    |   movle RB, #8\t\t\t// MULTRES = (0+1)*8\r\n    |   addgt RB, CARG1, #8\r\n    |  add CARG2, RA, CARG1\r\n    |   str RB, SAVE_MULTRES\r\n    |   ble <2\r\n    |  cmp CARG2, CARG4\r\n    |  bhi >7\r\n    |6:\r\n    |   ldrd CARG12, [RC], #8\r\n    |   strd CARG12, [RA], #8\r\n    |  cmp RC, CARG3\r\n    |  blo <6\r\n    |  b <2\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  lsr CARG2, CARG1, #3\r\n    |   str RA, L->top\r\n    |  mov CARG1, L\r\n    |   str BASE, L->base\r\n    |  sub RC, RC, BASE\t\t\t// Need delta, because BASE may change.\r\n    |   str PC, SAVE_PC\r\n    |  sub RA, RA, BASE\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  ldr BASE, L->base\r\n    |  add RA, BASE, RA\r\n    |  add RC, BASE, RC\r\n    |  sub CARG3, BASE, #8\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RC = extra results\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |   ldr PC, [BASE, FRAME_PC]\r\n    |    add RA, BASE, RA\r\n    |  add RC, CARG1, RC, lsl #3\r\n    |  b ->BC_RETM_Z\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |    add RA, BASE, RA\r\n    |->BC_RETM_Z:\r\n    |   str RC, SAVE_MULTRES\r\n    |1:\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |  bne ->BC_RETV2_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RC = (nresults+1)*8, PC = return\r\n    |  ldr INS, [PC, #-4]\r\n    |  subs CARG4, RC, #8\r\n    |   sub CARG3, BASE, #8\r\n    |  beq >3\r\n    |2:\r\n    |  ldrd CARG12, [RA], #8\r\n    |   add BASE, BASE, #8\r\n    |   subs CARG4, CARG4, #8\r\n    |  strd CARG12, [BASE, #-16]\r\n    |   bne <2\r\n    |3:\r\n    |  decode_RA8 RA, INS\r\n    |  sub CARG4, CARG3, RA\r\n    |   decode_RB8 RB, INS\r\n    |  ldr LFUNC:CARG1, [CARG4, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RB, RC\t\t\t// More results expected?\r\n    |  bhi >6\r\n    |  mov BASE, CARG4\r\n    |  ldr CARG2, LFUNC:CARG1->field_pc\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |   ins_next3\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  mvn CARG2, #~LJ_TNIL\r\n    |  add BASE, BASE, #8\r\n    |   add RC, RC, #8\r\n    |  str CARG2, [BASE, #-12]\r\n    |  b <5\r\n    |\r\n    |->BC_RETV1_Z:  // Non-standard return case.\r\n    |  add RA, BASE, RA\r\n    |->BC_RETV2_Z:\r\n    |  tst CARG2, #FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, CARG2\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |   str RC, SAVE_MULTRES\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |   ldreq INS, [PC, #-4]\r\n    |  bne ->BC_RETV1_Z\r\n    if (op == BC_RET1) {\r\n      |  ldrd CARG12, [BASE, RA]\r\n    }\r\n    |  sub CARG4, BASE, #8\r\n    |   decode_RA8 RA, INS\r\n    if (op == BC_RET1) {\r\n      |  strd CARG12, [CARG4]\r\n    }\r\n    |  sub BASE, CARG4, RA\r\n    |   decode_RB8 RB, INS\r\n    |  ldr LFUNC:CARG1, [BASE, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RB, RC\r\n    |  bhi >6\r\n    |  ldr CARG2, LFUNC:CARG1->field_pc\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |   ins_next3\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  sub CARG2, CARG4, #4\r\n    |  mvn CARG3, #~LJ_TNIL\r\n    |  str CARG3, [CARG2, RC]\r\n    |  add RC, RC, #8\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA];      .define FOR_TIDX,  [RA, #4]\r\n  |.define FOR_STOP, [RA, #8];  .define FOR_TSTOP, [RA, #12]\r\n  |.define FOR_STEP, [RA, #16]; .define FOR_TSTEP, [RA, #20]\r\n  |.define FOR_EXT,  [RA, #24]; .define FOR_TEXT,  [RA, #28]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RC = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    if (op != BC_JFORL) {\r\n      |   add RC, PC, RC, lsl #2\r\n    }\r\n    if (!vk) {\r\n      |  ldrd CARG34, FOR_STOP\r\n      |   checktp CARG2, LJ_TISNUM\r\n      |  ldr RB, FOR_TSTEP\r\n      |   bne >5\r\n      |  checktp CARG4, LJ_TISNUM\r\n      |   ldr CARG4, FOR_STEP\r\n      |  checktpeq RB, LJ_TISNUM\r\n      |  bne ->vmeta_for\r\n      |  cmp CARG4, #0\r\n      |  blt >4\r\n      |  cmp CARG1, CARG3\r\n    } else {\r\n      |  ldrd CARG34, FOR_STEP\r\n      |   checktp CARG2, LJ_TISNUM\r\n      |   bne >5\r\n      |  adds CARG1, CARG1, CARG3\r\n      |   ldr CARG4, FOR_STOP\r\n      if (op == BC_IFORL) {\r\n\t|  addvs RC, PC, #0x20000\t\t// Overflow: prevent branch.\r\n      } else {\r\n\t|  bvs >2\t\t\t\t// Overflow: do not enter mcode.\r\n      }\r\n      |  cmp CARG3, #0\r\n      |  blt >4\r\n      |  cmp CARG1, CARG4\r\n    }\r\n    |1:\r\n    if (op == BC_FORI) {\r\n      |  subgt PC, RC, #0x20000\r\n    } else if (op == BC_JFORI) {\r\n      |  sub PC, RC, #0x20000\r\n      |  ldrhle RC, [PC, #-2]\r\n    } else if (op == BC_IFORL) {\r\n      |  suble PC, RC, #0x20000\r\n    }\r\n    if (vk) {\r\n      |  strd CARG12, FOR_IDX\r\n    }\r\n    |2:\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, FOR_EXT\r\n    if (op == BC_JFORI || op == BC_JFORL) {\r\n      |  ble =>BC_JLOOP\r\n    }\r\n    |3:\r\n    |   ins_next3\r\n    |\r\n    |4:  // Invert check for negative step.\r\n    if (!vk) {\r\n      |  cmp CARG3, CARG1\r\n    } else {\r\n      |  cmp CARG4, CARG1\r\n    }\r\n    |  b <1\r\n    |\r\n    |5:  // FP loop.\r\n    if (!vk) {\r\n      |  cmnlo CARG4, #-LJ_TISNUM\r\n      |  cmnlo RB, #-LJ_TISNUM\r\n      |  bhs ->vmeta_for\r\n      |.if FPU\r\n      |  vldr d0, FOR_IDX\r\n      |  vldr d1, FOR_STOP\r\n      |  cmp RB, #0\r\n      |  vstr d0, FOR_EXT\r\n      |.else\r\n      |  cmp RB, #0\r\n      |   strd CARG12, FOR_EXT\r\n      |  blt >8\r\n      |.endif\r\n    } else {\r\n      |.if FPU\r\n      |  vldr d0, FOR_IDX\r\n      |  vldr d2, FOR_STEP\r\n      |  vldr d1, FOR_STOP\r\n      |  cmp CARG4, #0\r\n      |  vadd.f64 d0, d0, d2\r\n      |.else\r\n      |  cmp CARG4, #0\r\n      |  blt >8\r\n      |  bl extern __aeabi_dadd\r\n      |   strd CARG12, FOR_IDX\r\n      |  ldrd CARG34, FOR_STOP\r\n      |   strd CARG12, FOR_EXT\r\n      |.endif\r\n    }\r\n    |6:\r\n    |.if FPU\r\n    |  vcmpge.f64 d0, d1\r\n    |  vcmplt.f64 d1, d0\r\n    |  vmrs\r\n    |.else\r\n    |  bl extern __aeabi_cdcmple\r\n    |.endif\r\n    if (vk) {\r\n      |.if FPU\r\n      |  vstr d0, FOR_IDX\r\n      |  vstr d0, FOR_EXT\r\n      |.endif\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  subhi PC, RC, #0x20000\r\n    } else if (op == BC_JFORI) {\r\n      |  sub PC, RC, #0x20000\r\n      |  ldrhls RC, [PC, #-2]\r\n      |  bls =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |  subls PC, RC, #0x20000\r\n    } else {\r\n      |  bls =>BC_JLOOP\r\n    }\r\n    |  ins_next1\r\n    |  ins_next2\r\n    |  b <3\r\n    |\r\n    |.if not FPU\r\n    |8:  // Invert check for negative step.\r\n    if (vk) {\r\n      |  bl extern __aeabi_dadd\r\n      |  strd CARG12, FOR_IDX\r\n      |  strd CARG12, FOR_EXT\r\n    }\r\n    |  mov CARG3, CARG1\r\n    |  mov CARG4, CARG2\r\n    |  ldrd CARG12, FOR_STOP\r\n    |  b <6\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RC = target\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    if (op == BC_JITERL) {\r\n      |  cmn CARG2, #-LJ_TNIL\t\t// Stop if iterator returned nil.\r\n      |  strdne CARG12, [RA, #-8]\r\n      |  bne =>BC_JLOOP\r\n    } else {\r\n      |   add RC, PC, RC, lsl #2\r\n      |  // STALL: load CARG12.\r\n      |  cmn CARG2, #-LJ_TNIL\t\t// Stop if iterator returned nil.\r\n      |  subne PC, RC, #0x20000\t\t// Otherwise save control var + branch.\r\n      |  strdne CARG12, [RA, #-8]\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RC = target (loop extent)\r\n    |  // Note: RA/RC is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RC = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base (ignored), RC = traceno\r\n    |  ldr CARG1, [DISPATCH, #DISPATCH_J(trace)]\r\n    |   mov CARG2, #0  // Traces on ARM don't store the trace number, so use 0.\r\n    |  ldr TRACE:RC, [CARG1, RC, lsl #2]\r\n    |   st_vmstate CARG2\r\n    |  ldr RA, TRACE:RC->mcode\r\n    |   str BASE, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n    |   str L, [DISPATCH, #DISPATCH_GL(jit_L)]\r\n    |  bx RA\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RC = target\r\n    |  add RC, PC, RC, lsl #2\r\n    |  sub PC, RC, #0x20000\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   ldrb CARG2, [PC, #-4+PC2PROTO(numparams)]\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |  bhi ->vm_growstack_l\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n      |  ins_next2\r\n    }\r\n    |2:\r\n    |  cmp NARGS8:RC, CARG2, lsl #3\t// Check for missing parameters.\r\n    |   mvn CARG4, #~LJ_TNIL\r\n    |  blo >3\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD RC, INS\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  ins_next3\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  strd CARG34, [BASE, NARGS8:RC]\r\n    |  add NARGS8:RC, NARGS8:RC, #8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   add CARG4, BASE, RC\r\n    |  add RA, RA, RC\r\n    |   str LFUNC:CARG3, [CARG4]\t// Store copy of LFUNC.\r\n    |   add CARG2, RC, #8+FRAME_VARG\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |   str CARG2, [CARG4, #4]\t\t// Store delta + FRAME_VARG.\r\n    |  bhs ->vm_growstack_l\r\n    |  ldrb RB, [PC, #-4+PC2PROTO(numparams)]\r\n    |   mov RA, BASE\r\n    |   mov RC, CARG4\r\n    |  cmp RB, #0\r\n    |   add BASE, CARG4, #8\r\n    |  beq >3\r\n    |  mvn CARG3, #~LJ_TNIL\r\n    |1:\r\n    |  cmp RA, RC\t\t\t// Less args than parameters?\r\n    |   ldrdlo CARG12, [RA], #8\r\n    |   movhs CARG2, CARG3\r\n    |    strlo CARG3, [RA, #-4]\t\t// Clear old fixarg slot (help the GC).\r\n    |2:\r\n    |  subs RB, RB, #1\r\n    |   strd CARG12, [CARG4, #8]!\r\n    |  bne <1\r\n    |3:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  ldr CARG4, CFUNC:CARG3->f\r\n    } else {\r\n      |  ldr CARG4, [DISPATCH, #DISPATCH_GL(wrapf)]\r\n    }\r\n    |   add CARG2, RA, NARGS8:RC\r\n    |   ldr CARG1, L->maxstack\r\n    |  add RC, BASE, NARGS8:RC\r\n    |    str BASE, L->base\r\n    |   cmp CARG2, CARG1\r\n    |  str RC, L->top\r\n    if (op == BC_FUNCCW) {\r\n      |  ldr CARG2, CFUNC:CARG3->f\r\n    }\r\n    |    mv_vmstate CARG3, C\r\n    |  mov CARG1, L\r\n    |   bhi ->vm_growstack_c\t\t// Need to grow stack.\r\n    |    st_vmstate CARG3\r\n    |  blx CARG4\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  ldr BASE, L->base\r\n    |    mv_vmstate CARG3, INTERP\r\n    |   ldr CRET2, L->top\r\n    |   lsl RC, CRET1, #3\r\n    |    st_vmstate CARG3\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   sub RA, CRET2, RC\t\t// RA = L->top - nresults*8\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",%%progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 0xe\\n\"\t\t\t\t/* Return address is in lr. */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 0xd\\n\\t.uleb128 0\\n\"\t/* def_cfa sp */\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 1\\n\",\t\t/* offset lr */\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 11; i >= (LJ_ARCH_HASFPU ? 5 : 4); i--)  /* offset r4-r11 */\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 2+(11-i));\r\n#if LJ_ARCH_HASFPU\r\n    for (i = 15; i >= 8; i--)  /* offset d8-d15 */\r\n      fprintf(ctx->fp, \"\\t.byte 5\\n\\t.uleb128 %d, %d\\n\",\r\n\t64+2*i, 10+2*(15-i));\r\n    fprintf(ctx->fp, \"\\t.byte 0x84\\n\\t.uleb128 %d\\n\", 25);  /* offset r4 */\r\n#endif\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 1\\n\"\t\t/* offset lr */\r\n\t\"\\t.byte 0x8b\\n\\t.uleb128 2\\n\"\t\t/* offset r11 */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 3\\n\"\t\t/* offset r5 */\r\n\t\"\\t.byte 0x84\\n\\t.uleb128 4\\n\"\t\t/* offset r4 */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xb\\n\"\t\t/* def_cfa_register r11 */\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/vm_mips.dasc",
    "content": "|// Low-level VM code for MIPS CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch mips\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// Don't use: r0 = 0, r26/r27 = reserved, r28 = gp, r29 = sp, r31 = ra\r\n|\r\n|// The following must be C callee-save (but BASE is often refetched).\r\n|.define BASE,\t\tr16\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tr17\t// Constants of current Lua function.\r\n|.define PC,\t\tr18\t// Next PC.\r\n|.define DISPATCH,\tr19\t// Opcode dispatch table.\r\n|.define LREG,\t\tr20\t// Register holding lua_State (also in SAVE_L).\r\n|.define MULTRES,\tr21\t// Size of multi-result: (nresults+1)*8.\r\n|// NYI: r22 currently unused.\r\n|\r\n|.define JGL,\t\tr30\t// On-trace: global_State + 32768.\r\n|\r\n|// Constants for type-comparisons, stores and conversions. C callee-save.\r\n|.define TISNIL,\tr30\r\n|.define TOBIT,\t\tf30\t// 2^52 + 2^51.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA.\r\n|.define RA,\t\tr23\t// Callee-save.\r\n|.define RB,\t\tr8\r\n|.define RC,\t\tr9\r\n|.define RD,\t\tr10\r\n|.define INS,\t\tr11\r\n|\r\n|.define AT,\t\tr1\t// Assembler temporary.\r\n|.define TMP0,\t\tr12\r\n|.define TMP1,\t\tr13\r\n|.define TMP2,\t\tr14\r\n|.define TMP3,\t\tr15\r\n|\r\n|// Calling conventions.\r\n|.define CFUNCADDR,\tr25\r\n|.define CARG1,\t\tr4\r\n|.define CARG2,\t\tr5\r\n|.define CARG3,\t\tr6\r\n|.define CARG4,\t\tr7\r\n|\r\n|.define CRET1,\t\tr2\r\n|.define CRET2,\t\tr3\r\n|\r\n|.define FARG1,\t\tf12\r\n|.define FARG2,\t\tf14\r\n|\r\n|.define FRET1,\t\tf0\r\n|.define FRET2,\t\tf2\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.define CFRAME_SPACE,\t112\t// Delta for sp.\r\n|\r\n|.define SAVE_ERRF,\t124(sp)\t// 32 bit C frame info.\r\n|.define SAVE_NRES,\t120(sp)\r\n|.define SAVE_CFRAME,\t116(sp)\r\n|.define SAVE_L,\t112(sp)\r\n|//----- 8 byte aligned, ^^^^ 16 byte register save area, owned by interpreter.\r\n|.define SAVE_GPR_,\t72\t// .. 72+10*4: 32 bit GPR saves.\r\n|.define SAVE_FPR_,\t24\t// .. 24+6*8: 64 bit FPR saves.\r\n|.define SAVE_PC,\t20(sp)\r\n|.define ARG5,\t\t16(sp)\r\n|.define CSAVE_4,\t12(sp)\r\n|.define CSAVE_3,\t8(sp)\r\n|.define CSAVE_2,\t4(sp)\r\n|.define CSAVE_1,\t0(sp)\r\n|//----- 8 byte aligned, ^^^^ 16 byte register save area, owned by callee.\r\n|\r\n|.define ARG5_OFS,\t16\r\n|.define SAVE_MULTRES,\tARG5\r\n|\r\n|.macro saveregs\r\n|  addiu sp, sp, -CFRAME_SPACE\r\n|  sw ra, SAVE_GPR_+9*4(sp)\r\n|  sw r30, SAVE_GPR_+8*4(sp)\r\n|   sdc1 f30, SAVE_FPR_+5*8(sp)\r\n|  sw r23, SAVE_GPR_+7*4(sp)\r\n|  sw r22, SAVE_GPR_+6*4(sp)\r\n|   sdc1 f28, SAVE_FPR_+4*8(sp)\r\n|  sw r21, SAVE_GPR_+5*4(sp)\r\n|  sw r20, SAVE_GPR_+4*4(sp)\r\n|   sdc1 f26, SAVE_FPR_+3*8(sp)\r\n|  sw r19, SAVE_GPR_+3*4(sp)\r\n|  sw r18, SAVE_GPR_+2*4(sp)\r\n|   sdc1 f24, SAVE_FPR_+2*8(sp)\r\n|  sw r17, SAVE_GPR_+1*4(sp)\r\n|  sw r16, SAVE_GPR_+0*4(sp)\r\n|   sdc1 f22, SAVE_FPR_+1*8(sp)\r\n|   sdc1 f20, SAVE_FPR_+0*8(sp)\r\n|.endmacro\r\n|\r\n|.macro restoreregs_ret\r\n|  lw ra, SAVE_GPR_+9*4(sp)\r\n|  lw r30, SAVE_GPR_+8*4(sp)\r\n|   ldc1 f30, SAVE_FPR_+5*8(sp)\r\n|  lw r23, SAVE_GPR_+7*4(sp)\r\n|  lw r22, SAVE_GPR_+6*4(sp)\r\n|   ldc1 f28, SAVE_FPR_+4*8(sp)\r\n|  lw r21, SAVE_GPR_+5*4(sp)\r\n|  lw r20, SAVE_GPR_+4*4(sp)\r\n|   ldc1 f26, SAVE_FPR_+3*8(sp)\r\n|  lw r19, SAVE_GPR_+3*4(sp)\r\n|  lw r18, SAVE_GPR_+2*4(sp)\r\n|   ldc1 f24, SAVE_FPR_+2*8(sp)\r\n|  lw r17, SAVE_GPR_+1*4(sp)\r\n|  lw r16, SAVE_GPR_+0*4(sp)\r\n|   ldc1 f22, SAVE_FPR_+1*8(sp)\r\n|   ldc1 f20, SAVE_FPR_+0*8(sp)\r\n|  jr ra\r\n|  addiu sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; .long 0xf0f0f0f0; .endmacro\r\n|\r\n|// Macros to mark delay slots.\r\n|.macro ., a; a; .endmacro\r\n|.macro ., a,b; a,b; .endmacro\r\n|.macro ., a,b,c; a,b,c; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Endian-specific defines.\r\n|.define FRAME_PC,\tLJ_ENDIAN_SELECT(-4,-8)\r\n|.define FRAME_FUNC,\tLJ_ENDIAN_SELECT(-8,-4)\r\n|.define HI,\t\tLJ_ENDIAN_SELECT(4,0)\r\n|.define LO,\t\tLJ_ENDIAN_SELECT(0,4)\r\n|.define OFS_RD,\tLJ_ENDIAN_SELECT(2,0)\r\n|.define OFS_RA,\tLJ_ENDIAN_SELECT(1,2)\r\n|.define OFS_OP,\tLJ_ENDIAN_SELECT(0,3)\r\n|\r\n|// Instruction decode.\r\n|.macro decode_OP1, dst, ins; andi dst, ins, 0xff; .endmacro\r\n|.macro decode_OP4a, dst, ins; andi dst, ins, 0xff; .endmacro\r\n|.macro decode_OP4b, dst; sll dst, dst, 2; .endmacro\r\n|.macro decode_RC4a, dst, ins; srl dst, ins, 14; .endmacro\r\n|.macro decode_RC4b, dst; andi dst, dst, 0x3fc; .endmacro\r\n|.macro decode_RD4b, dst; sll dst, dst, 2; .endmacro\r\n|.macro decode_RA8a, dst, ins; srl dst, ins, 5; .endmacro\r\n|.macro decode_RA8b, dst; andi dst, dst, 0x7f8; .endmacro\r\n|.macro decode_RB8a, dst, ins; srl dst, ins, 21; .endmacro\r\n|.macro decode_RB8b, dst; andi dst, dst, 0x7f8; .endmacro\r\n|.macro decode_RD8a, dst, ins; srl dst, ins, 16; .endmacro\r\n|.macro decode_RD8b, dst; sll dst, dst, 3; .endmacro\r\n|.macro decode_RDtoRC8, dst, src; andi dst, src, 0x7f8; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  lw INS, 0(PC)\r\n|   addiu PC, PC, 4\r\n|.endmacro\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT2\r\n|  decode_OP4a TMP1, INS\r\n|  decode_OP4b TMP1\r\n|  addu TMP0, DISPATCH, TMP1\r\n|   decode_RD8a RD, INS\r\n|  lw AT, 0(TMP0)\r\n|   decode_RA8a RA, INS\r\n|   decode_RD8b RD\r\n|  jr AT\r\n|   decode_RA8b RA\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  lw PC, LFUNC:RB->pc\r\n|  lw INS, 0(PC)\r\n|   addiu PC, PC, 4\r\n|  decode_OP4a TMP1, INS\r\n|   decode_RA8a RA, INS\r\n|  decode_OP4b TMP1\r\n|   decode_RA8b RA\r\n|  addu TMP0, DISPATCH, TMP1\r\n|  lw TMP0, 0(TMP0)\r\n|  jr TMP0\r\n|   addu RA, RA, BASE\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  sw PC, FRAME_PC(BASE)\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|.macro branch_RD\r\n|  srl TMP0, RD, 1\r\n|  lui AT, (-(BCBIAS_J*4 >> 16) & 65535)\r\n|  addu TMP0, TMP0, AT\r\n|  addu PC, PC, TMP0\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n#define GG_DISP2GOT\t\t(GG_OFS(got) - GG_OFS(dispatch))\r\n#define DISPATCH_GOT(name)\t(GG_DISP2GOT + 4*LJ_GOT_##name)\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro load_got, func\r\n|  lw CFUNCADDR, DISPATCH_GOT(func)(DISPATCH)\r\n|.endmacro\r\n|// Much faster. Sadly, there's no easy way to force the required code layout.\r\n|// .macro call_intern, func; bal extern func; .endmacro\r\n|.macro call_intern, func; jalr CFUNCADDR; .endmacro\r\n|.macro call_extern; jalr CFUNCADDR; .endmacro\r\n|.macro jmp_extern; jr CFUNCADDR; .endmacro\r\n|\r\n|.macro hotcheck, delta, target\r\n|  srl TMP1, PC, 1\r\n|  andi TMP1, TMP1, 126\r\n|  addu TMP1, TMP1, DISPATCH\r\n|  lhu TMP2, GG_DISP2HOT(TMP1)\r\n|  addiu TMP2, TMP2, -delta\r\n|  bltz TMP2, target\r\n|.  sh TMP2, GG_DISP2HOT(TMP1)\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP, ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL, ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state. Uses TMP0.\r\n|.macro li_vmstate, st; li TMP0, ~LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate; sw TMP0, DISPATCH_GL(vmstate)(DISPATCH); .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp, target\r\n|  lw tmp, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   andi mark, mark, ~LJ_GC_BLACK & 255\t\t// black2gray(tab)\r\n|  sw tab, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   sb mark, tab->marked\r\n|  b target\r\n|.  sw tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: TMP2 = previous base.\r\n  |  andi AT, PC, FRAME_P\r\n  |  beqz AT, ->cont_dispatch\r\n  |.  li TMP1, LJ_TTRUE\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  lw PC, FRAME_PC(TMP2)\t\t// Fetch PC of previous frame.\r\n  |  move BASE, TMP2\t\t\t// Restore caller base.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   sw TMP1, FRAME_PC(RA)\t\t// Prepend true to results.\r\n  |   addiu RA, RA, -8\r\n  |\r\n  |->vm_returnc:\r\n  |   addiu RD, RD, 8\t\t\t// RD = (nresults+1)*8.\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |   beqz RD, ->vm_unwind_c_eh\r\n  |.   li CRET1, LUA_YIELD\r\n  |  beqz TMP0, ->BC_RET_Z\t\t// Handle regular return to Lua.\r\n  |.  move MULTRES, RD\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RD/MULTRES = (nresults+1)*8, PC = return\r\n  |  // TMP0 = PC & FRAME_TYPE\r\n  |   li TMP2, -8\r\n  |  xori AT, TMP0, FRAME_C\r\n  |   and TMP2, PC, TMP2\r\n  |  bnez AT, ->vm_returnp\r\n  |   subu TMP2, BASE, TMP2\t\t// TMP2 = previous base.\r\n  |\r\n  |  addiu TMP1, RD, -8\r\n  |   sw TMP2, L->base\r\n  |    li_vmstate C\r\n  |   lw TMP2, SAVE_NRES\r\n  |   addiu BASE, BASE, -8\r\n  |    st_vmstate\r\n  |  beqz TMP1, >2\r\n  |.   sll TMP2, TMP2, 3\r\n  |1:\r\n  |  addiu TMP1, TMP1, -8\r\n  |   ldc1 f0, 0(RA)\r\n  |    addiu RA, RA, 8\r\n  |   sdc1 f0, 0(BASE)\r\n  |  bnez TMP1, <1\r\n  |.  addiu BASE, BASE, 8\r\n  |\r\n  |2:\r\n  |  bne TMP2, RD, >6\r\n  |3:\r\n  |.  sw BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  lw TMP0, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   move CRET1, r0\t\t\t// Ok return status for vm_pcall.\r\n  |  sw TMP0, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs_ret\r\n  |\r\n  |6:\r\n  |  lw TMP1, L->maxstack\r\n  |  slt AT, TMP2, RD\r\n  |  bnez AT, >7\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |.  slt AT, BASE, TMP1\r\n  |  beqz AT, >8\r\n  |.  nop\r\n  |  sw TISNIL, HI(BASE)\r\n  |  addiu RD, RD, 8\r\n  |  b <2\r\n  |.  addiu BASE, BASE, 8\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  subu TMP0, RD, TMP2\r\n  |  subu TMP0, BASE, TMP0\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |.  movn BASE, TMP0, TMP2\t\t// LUA_MULTRET+1 case?\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  load_got lj_state_growstack\r\n  |   move MULTRES, RD\r\n  |  srl CARG2, TMP2, 3\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |    lw TMP2, SAVE_NRES\r\n  |  lw BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |   move RD, MULTRES\r\n  |  b <2\r\n  |.   sll TMP2, TMP2, 3\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  move sp, CARG1\r\n  |  move CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lw L, SAVE_L\r\n  |   li TMP0, ~LJ_VMST_C\r\n  |  lw GL:TMP1, L->glref\r\n  |  b ->vm_leave_unw\r\n  |.  sw TMP0, GL:TMP1->vmstate\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  li AT, -4\r\n  |  and sp, CARG1, AT\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lw L, SAVE_L\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |     li TISNIL, LJ_TNIL\r\n  |  lw BASE, L->base\r\n  |   lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     mtc1 TMP3, TOBIT\r\n  |  li TMP1, LJ_TFALSE\r\n  |    li_vmstate INTERP\r\n  |  lw PC, FRAME_PC(BASE)\t\t// Fetch PC of previous frame.\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |  addiu RA, BASE, -8\t\t\t// Results start at BASE-8.\r\n  |   addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |  sw TMP1, HI(RA)\t\t\t// Prepend false to error message.\r\n  |    st_vmstate\r\n  |  b ->vm_returnc\r\n  |.  li RD, 16\t\t\t\t// 2 results: false + error message.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  b >2\r\n  |.  li CARG2, LUA_MINSTACK\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  addu RC, BASE, RC\r\n  |   subu RA, RA, BASE\r\n  |  sw BASE, L->base\r\n  |   addiu PC, PC, 4\t\t\t// Must point after first instruction.\r\n  |  sw RC, L->top\r\n  |   srl CARG2, RA, 3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |  load_got lj_state_growstack\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  lw BASE, L->base\r\n  |  lw RC, L->top\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  subu RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  move L, CARG1\r\n  |    lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  move BASE, CARG2\r\n  |    lbu TMP1, L->status\r\n  |   sw L, SAVE_L\r\n  |  li PC, FRAME_CP\r\n  |  addiu TMP0, sp, CFRAME_RESUME\r\n  |    addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |   sw r0, SAVE_NRES\r\n  |   sw r0, SAVE_ERRF\r\n  |  sw TMP0, L->cframe\r\n  |   sw r0, SAVE_CFRAME\r\n  |    beqz TMP1, >3\r\n  |.  sw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  move RA, BASE\r\n  |   lw BASE, L->base\r\n  |   lw TMP1, L->top\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   subu RD, TMP1, BASE\r\n  |     mtc1 TMP3, TOBIT\r\n  |    sb r0, L->status\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |    li_vmstate INTERP\r\n  |   addiu RD, RD, 8\r\n  |    st_vmstate\r\n  |   move MULTRES, RD\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |  beqz TMP0, ->BC_RET_Z\r\n  |.    li TISNIL, LJ_TNIL\r\n  |  b ->vm_return\r\n  |.  nop\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  sw CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |.  li PC, FRAME_CP\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  li PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  lw TMP1, L:CARG1->cframe\r\n  |   sw CARG3, SAVE_NRES\r\n  |    move L, CARG1\r\n  |   sw CARG1, SAVE_L\r\n  |    move BASE, CARG2\r\n  |  sw sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   sw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  sw TMP1, SAVE_CFRAME\r\n  |    addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  lw TMP2, L->base\t\t\t// TMP2 = old base (used in vmeta_call).\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   lw TMP1, L->top\r\n  |     mtc1 TMP3, TOBIT\r\n  |  addu PC, PC, BASE\r\n  |   subu NARGS8:RC, TMP1, BASE\r\n  |  subu PC, PC, TMP2\t\t\t// PC = frame delta + frame type\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |    li_vmstate INTERP\r\n  |     li TISNIL, LJ_TNIL\r\n  |    st_vmstate\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  lw TMP0, FRAME_PC(BASE)\r\n  |  li AT, LJ_TFUNC\r\n  |  bne TMP0, AT, ->vmeta_call\r\n  |.  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  move L, CARG1\r\n  |   lw TMP0, L:CARG1->stack\r\n  |  sw CARG1, SAVE_L\r\n  |   lw TMP1, L->top\r\n  |  sw CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   subu TMP0, TMP0, TMP1\t\t// Compute -savestack(L, L->top).\r\n  |    lw TMP1, L->cframe\r\n  |    sw sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |   sw TMP0, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  sw r0, SAVE_ERRF\t\t\t// No error function.\r\n  |  move CFUNCADDR, CARG4\r\n  |  jalr CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.   sw TMP1, SAVE_CFRAME\r\n  |  move BASE, CRET1\r\n  |   lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |    li PC, FRAME_CP\r\n  |  bnez CRET1, <3\t\t\t// Else continue with the call.\r\n  |.  addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |.  nop\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// The lj_meta_* functions (except for lj_meta_cat) don't reallocate the\r\n  |// stack, so BASE doesn't need to be reloaded across these calls.\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RD = (nresults+1)*8\r\n  |  lw TMP0, -16+LO(BASE)\t\t// Continuation.\r\n  |   move RB, BASE\r\n  |   move BASE, TMP2\t\t\t// Restore caller BASE.\r\n  |    lw LFUNC:TMP1, FRAME_FUNC(TMP2)\r\n  |.if FFI\r\n  |  sltiu AT, TMP0, 2\r\n  |.endif\r\n  |     lw PC, -16+HI(RB)\t\t// Restore PC from [cont|PC].\r\n  |   addu TMP2, RA, RD\r\n  |    lw TMP1, LFUNC:TMP1->pc\r\n  |.if FFI\r\n  |  bnez AT, >1\r\n  |.endif\r\n  |.  sw TISNIL, -8+HI(TMP2)\t\t// Ensure one valid arg.\r\n  |  // BASE = base, RA = resultptr, RB = meta base\r\n  |  jr TMP0\t\t\t\t// Jump to continuation.\r\n  |.  lw KBASE, PC2PROTO(k)(TMP1)\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  bnez TMP0, ->cont_ffi_callback\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |.  addiu TMP1, RB, -16\r\n  |  b ->vm_call_tail\r\n  |.  subu RC, TMP1, BASE\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, RB = meta base\r\n  |  lw INS, -4(PC)\r\n  |   addiu CARG2, RB, -16\r\n  |   ldc1 f0, 0(RA)\r\n  |  decode_RB8a MULTRES, INS\r\n  |   decode_RA8a RA, INS\r\n  |  decode_RB8b MULTRES\r\n  |   decode_RA8b RA\r\n  |  addu TMP1, BASE, MULTRES\r\n  |   sw BASE, L->base\r\n  |   subu CARG3, CARG2, TMP1\r\n  |  bne TMP1, CARG2, ->BC_CAT_Z\r\n  |.  sdc1 f0, 0(CARG2)\r\n  |  addu RA, BASE, RA\r\n  |  b ->cont_nop\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TSTR\r\n  |  sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP0, HI(CARG3)\r\n  |\r\n  |->vmeta_tgets:\r\n  |  addiu CARG2, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TTAB\r\n  |  sw TAB:RB, LO(CARG2)\r\n  |   addiu CARG3, DISPATCH, DISPATCH_GL(tmptv2)\r\n  |  sw TMP0, HI(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP1, HI(CARG3)\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// TMP0 = index\r\n  |  mtc1 TMP0, f0\r\n  |  cvt.d.w f0, f0\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  sdc1 f0, 0(CARG3)\r\n  |\r\n  |->vmeta_tgetv:\r\n  |1:\r\n  |  load_got lj_meta_tget\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |.  move CARG1, L\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  beqz CRET1, >3\r\n  |.  addiu TMP1, BASE, -FRAME_CONT\r\n  |  ldc1 f0, 0(CRET1)\r\n  |  ins_next1\r\n  |   sdc1 f0, 0(RA)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  lw BASE, L->top\r\n  |  sw PC, -16+HI(BASE)\t\t// [cont|PC]\r\n  |   subu PC, BASE, TMP1\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |.  li NARGS8:RC, 16\t\t\t// 2 args for func(t, k).\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TSTR\r\n  |  sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP0, HI(CARG3)\r\n  |\r\n  |->vmeta_tsets:\r\n  |  addiu CARG2, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TTAB\r\n  |  sw TAB:RB, LO(CARG2)\r\n  |   addiu CARG3, DISPATCH, DISPATCH_GL(tmptv2)\r\n  |  sw TMP0, HI(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP1, HI(CARG3)\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// TMP0 = index\r\n  |  mtc1 TMP0, f0\r\n  |  cvt.d.w f0, f0\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  sdc1 f0, 0(CARG3)\r\n  |\r\n  |->vmeta_tsetv:\r\n  |1:\r\n  |  load_got lj_meta_tset\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |.  move CARG1, L\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  beqz CRET1, >3\r\n  |.  ldc1 f0, 0(RA)\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  ins_next1\r\n  |   sdc1 f0, 0(CRET1)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  addiu TMP1, BASE, -FRAME_CONT\r\n  |  lw BASE, L->top\r\n  |  sw PC, -16+HI(BASE)\t\t// [cont|PC]\r\n  |   subu PC, BASE, TMP1\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |  sdc1 f0, 16(BASE)\t\t\t// Copy value to third argument.\r\n  |  b ->vm_call_dispatch_f\r\n  |.  li NARGS8:RC, 24\t\t\t// 3 args for func(t, k, v)\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  // CARG2, CARG3 are already set by BC_ISLT/BC_ISGE/BC_ISLE/BC_ISGT.\r\n  |  load_got lj_meta_comp\r\n  |  addiu PC, PC, -4\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  decode_OP1 CARG4, INS\r\n  |  call_intern lj_meta_comp\t// (lua_State *L, TValue *o1, *o2, int op)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  sltiu AT, CRET1, 2\r\n  |  beqz AT, ->vmeta_binop\r\n  |   negu TMP2, CRET1\r\n  |4:\r\n  |  lhu RD, OFS_RD(PC)\r\n  |   addiu PC, PC, 4\r\n  |   lui TMP1, (-(BCBIAS_J*4 >> 16) & 65535)\r\n  |  sll RD, RD, 2\r\n  |  addu RD, RD, TMP1\r\n  |  and RD, RD, TMP2\r\n  |  addu PC, PC, RD\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  lbu TMP1, -4+OFS_RA(PC)\r\n  |   ldc1 f0, 0(RA)\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, BASE, TMP1\r\n  |  b ->cont_nop\r\n  |.  sdc1 f0, 0(TMP1)\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  lw TMP0, HI(RA)\r\n  |  sltiu AT, TMP0, LJ_TISTRUECOND\r\n  |  b <4\r\n  |.  negu TMP2, AT\t\t\t// Branch if result is true.\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  lw TMP0, HI(RA)\r\n  |  sltiu AT, TMP0, LJ_TISTRUECOND\r\n  |  b <4\r\n  |.  addiu TMP2, AT, -1\t\t// Branch if result is false.\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  load_got lj_meta_equal\r\n  |  addiu PC, PC, -4\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.  nop\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  load_got lj_meta_equal_cd\r\n  |  move CARG2, INS\r\n  |  addiu PC, PC, -4\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_equal_cd\t// (lua_State *L, BCIns op)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.  nop\r\n  |.endif\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_unm:\r\n  |  move CARG4, CARG3\r\n  |\r\n  |->vmeta_arith:\r\n  |  load_got lj_meta_arith\r\n  |  decode_OP1 TMP0, INS\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  move CARG2, RA\r\n  |  sw TMP0, ARG5\r\n  |  call_intern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |.  move CARG1, L\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  beqz CRET1, ->cont_nop\r\n  |.  nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  subu TMP1, CRET1, BASE\r\n  |   sw PC, -16+HI(CRET1)\t\t// [cont|PC]\r\n  |   move TMP2, BASE\r\n  |  addiu PC, TMP1, FRAME_CONT\r\n  |   move BASE, CRET1\r\n  |  b ->vm_call_dispatch\r\n  |.  li NARGS8:RC, 16\t\t\t// 2 args for func(o1, o2).\r\n  |\r\n  |->vmeta_len:\r\n  |  // CARG2 already set by BC_LEN.\r\n#if LJ_52\r\n  |  move MULTRES, CARG1\r\n#endif\r\n  |  load_got lj_meta_len\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |.  move CARG1, L\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  bnez CRET1, ->vmeta_binop\t\t// Binop call for compatibility.\r\n  |.  nop\r\n  |  b ->BC_LEN_Z\r\n  |.  move CARG1, MULTRES\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |.  nop\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8\r\n  |  load_got lj_meta_call\r\n  |   sw TMP2, L->base\t\t\t// This is the callers base!\r\n  |  addiu CARG2, BASE, -8\r\n  |   sw PC, SAVE_PC\r\n  |  addu CARG3, BASE, RC\r\n  |   move MULTRES, NARGS8:RC\r\n  |  call_intern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |.  move CARG1, L\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   addiu NARGS8:RC, MULTRES, 8\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  load_got lj_meta_call\r\n  |   sw BASE, L->base\r\n  |  addiu CARG2, RA, -8\r\n  |   sw PC, SAVE_PC\r\n  |  addu CARG3, RA, RC\r\n  |   move MULTRES, NARGS8:RC\r\n  |  call_intern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |.  move CARG1, L\r\n  |  lw TMP1, FRAME_PC(BASE)\r\n  |   lw LFUNC:RB, FRAME_FUNC(RA)\t// Guaranteed to be a function here.\r\n  |  b ->BC_CALLT_Z\r\n  |.  addiu NARGS8:RC, MULTRES, 8\t// Got one more argument now.\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  load_got lj_meta_for\r\n  |   sw BASE, L->base\r\n  |  move CARG2, RA\r\n  |   sw PC, SAVE_PC\r\n  |  move MULTRES, INS\r\n  |  call_intern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |.  move CARG1, L\r\n  |.if JIT\r\n  |  decode_OP1 TMP0, MULTRES\r\n  |  li AT, BC_JFORI\r\n  |.endif\r\n  |  decode_RA8a RA, MULTRES\r\n  |   decode_RD8a RD, MULTRES\r\n  |  decode_RA8b RA\r\n  |.if JIT\r\n  |  beq TMP0, AT, =>BC_JFORI\r\n  |.  decode_RD8b RD\r\n  |  b =>BC_FORI\r\n  |.  nop\r\n  |.else\r\n  |  b =>BC_FORI\r\n  |.  decode_RD8b RD\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  lw CARG3, HI(BASE)\r\n  |    lw CARG1, LO(BASE)\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.   lw CARG4, 8+HI(BASE)\r\n  |   lw CARG1, LO(BASE)\r\n  |    lw CARG2, 8+LO(BASE)\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\t// Caveat: has delay slot!\r\n  |->ff_ .. name:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\t// Caveat: has delay slot!\r\n  |->ff_ .. name:\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.  lw CARG4, 8+HI(BASE)\r\n  |  ldc1 FARG1, 0(BASE)\r\n  |  ldc1 FARG2, 8(BASE)\r\n  |  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  sltiu TMP1, CARG4, LJ_TISNUM\r\n  |  and TMP0, TMP0, TMP1\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses TMP0 and TMP1 and has delay slot!\r\n  |.macro ffgccheck\r\n  |  lw TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n  |  lw TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n  |  subu AT, TMP0, TMP1\r\n  |  bgezal AT, ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  sltiu AT, CARG3, LJ_TISTRUECOND\r\n  |  beqz AT, ->fff_fallback\r\n  |.  addiu RA, BASE, -8\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  addiu RD, NARGS8:RC, 8\t\t// Compute (nresults+1)*8.\r\n  |  addu TMP2, RA, NARGS8:RC\r\n  |   sw CARG3, HI(RA)\r\n  |  addiu TMP1, BASE, 8\r\n  |  beq BASE, TMP2, ->fff_res\t\t// Done if exactly 1 argument.\r\n  |.  sw CARG1, LO(RA)\r\n  |1:\r\n  |  ldc1 f0, 0(TMP1)\r\n  |  sdc1 f0, -8(TMP1)\r\n  |  bne TMP1, TMP2, <1\r\n  |.  addiu TMP1, TMP1, 8\r\n  |  b ->fff_res\r\n  |.  nop\r\n  |\r\n  |.ffunc type\r\n  |  lw CARG3, HI(BASE)\r\n  |  li TMP1, LJ_TISNUM\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  movz TMP1, CARG3, TMP0\r\n  |  not TMP1, TMP1\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, CFUNC:RB, TMP1\r\n  |  b ->fff_resn\r\n  |.  ldc1 FRET1, CFUNC:TMP1->upvalue\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, >6\r\n  |.  li AT, LJ_TUDATA\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  lw TAB:CARG1, TAB:CARG1->metatable\r\n  |2:\r\n  |  lw STR:RC, DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])(DISPATCH)\r\n  |  beqz TAB:CARG1, ->fff_restv\r\n  |.  li CARG3, LJ_TNIL\r\n  |  lw TMP0, TAB:CARG1->hmask\r\n  |   li CARG3, LJ_TTAB\t\t\t// Use metatable as default result.\r\n  |  lw TMP1, STR:RC->hash\r\n  |  lw NODE:TMP2, TAB:CARG1->node\r\n  |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n  |  sll TMP0, TMP1, 5\r\n  |  sll TMP1, TMP1, 3\r\n  |  subu TMP1, TMP0, TMP1\r\n  |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n  |  li AT, LJ_TSTR\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  lw CARG4, offsetof(Node, key)+HI(NODE:TMP2)\r\n  |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n  |    lw NODE:TMP3, NODE:TMP2->next\r\n  |  bne CARG4, AT, >4\r\n  |.    lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n  |  beq TMP0, STR:RC, >5\r\n  |.    lw TMP1, offsetof(Node, val)+LO(NODE:TMP2)\r\n  |4:\r\n  |  beqz NODE:TMP3, ->fff_restv\t// Not found, keep default result.\r\n  |.  move NODE:TMP2, NODE:TMP3\r\n  |  b <3\r\n  |.  nop\r\n  |5:\r\n  |  beq CARG2, TISNIL, ->fff_restv\t// Ditto for nil value.\r\n  |.  nop\r\n  |  move CARG3, CARG2\t\t\t// Return value of mt.__metatable.\r\n  |  b ->fff_restv\r\n  |.  move CARG1, TMP1\r\n  |\r\n  |6:\r\n  |  beq CARG3, AT, <1\r\n  |.  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  li TMP1, LJ_TISNUM\r\n  |  movz TMP1, CARG3, TMP0\r\n  |  not TMP1, TMP1\r\n  |  sll TMP1, TMP1, 2\r\n  |  addu TMP1, DISPATCH, TMP1\r\n  |  b <2\r\n  |.  lw TAB:CARG1, DISPATCH_GL(gcroot[GCROOT_BASEMT])(TMP1)\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  addiu CARG4, CARG4, -LJ_TTAB\r\n  |  lw TAB:TMP1, TAB:CARG1->metatable\r\n  |   lbu TMP3, TAB:CARG1->marked\r\n  |  or AT, CARG4, TAB:TMP1\r\n  |  bnez AT, ->fff_fallback\r\n  |.  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n  |  beqz AT, ->fff_restv\r\n  |.  sw TAB:CARG2, TAB:CARG1->metatable\r\n  |  barrierback TAB:CARG1, TMP3, TMP0, ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  lw CARG4, HI(BASE)\r\n  |   sltiu AT, NARGS8:RC, 16\r\n  |    lw TAB:CARG2, LO(BASE)\r\n  |  load_got lj_tab_get\r\n  |  addiu CARG4, CARG4, -LJ_TTAB\r\n  |  or AT, AT, CARG4\r\n  |  bnez AT, ->fff_fallback\r\n  |   addiu CARG3, BASE, 8\r\n  |  call_intern lj_tab_get\t// (lua_State *L, GCtab *t, cTValue *key)\r\n  |.  move CARG1, L\r\n  |  // Returns cTValue *.\r\n  |  b ->fff_resn\r\n  |.  ldc1 FRET1, 0(CRET1)\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  lw CARG1, HI(BASE)\r\n  |  xori AT, NARGS8:RC, 8\r\n  |  sltiu CARG1, CARG1, LJ_TISNUM\r\n  |  movn CARG1, r0, AT\r\n  |  beqz CARG1, ->fff_fallback\t\t// Exactly one number argument.\r\n  |.  ldc1 FRET1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  li AT, LJ_TSTR\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq CARG3, AT, ->fff_restv\t\t\t// String key?\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |.  lw TMP1, DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])(DISPATCH)\r\n  |  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  sltiu TMP1, TMP1, 1\r\n  |  and TMP0, TMP0, TMP1\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.  sw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  ffgccheck\r\n  |.  sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  load_got lj_str_fromnum\r\n  |  move CARG1, L\r\n  |  call_intern lj_str_fromnum\t\t// (lua_State *L, lua_Number *np)\r\n  |.  move CARG2, BASE\r\n  |  // Returns GCstr *.\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |.  move CARG1, CRET1\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc next\r\n  |  lw CARG1, HI(BASE)\r\n  |   lw TAB:CARG2, LO(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  addu TMP2, BASE, NARGS8:RC\r\n  |  li AT, LJ_TTAB\r\n  |   sw TISNIL, HI(TMP2)\t\t// Set missing 2nd arg to nil.\r\n  |  bne CARG1, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |  load_got lj_tab_next\r\n  |   sw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |   sw BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  addiu CARG3, BASE, 8\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_tab_next\t\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |.  move CARG1, L\r\n  |  // Returns 0 at end of traversal.\r\n  |  beqz CRET1, ->fff_restv\t\t// End of traversal: return nil.\r\n  |.  li CARG3, LJ_TNIL\r\n  |  ldc1 f0, 8(BASE)\t\t\t// Copy key and value to results.\r\n  |    addiu RA, BASE, -8\r\n  |   ldc1 f2, 16(BASE)\r\n  |    li RD, (2+1)*8\r\n  |  sdc1 f0, 0(RA)\r\n  |  b ->fff_res\r\n  |.  sdc1 f2, 8(RA)\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n#if LJ_52\r\n  |  lw TAB:TMP2, TAB:CARG1->metatable\r\n  |   ldc1 f0, CFUNC:RB->upvalue[0]\r\n  |  bnez TAB:TMP2, ->fff_fallback\r\n#else\r\n  |  ldc1 f0, CFUNC:RB->upvalue[0]\r\n#endif\r\n  |.  addiu RA, BASE, -8\r\n  |   sw TISNIL, 8+HI(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |.ffunc ipairs_aux\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |    lw TAB:CARG1, LO(BASE)\r\n  |   lw CARG4, 8+HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.  ldc1 FARG2, 8(BASE)\r\n  |   addiu CARG3, CARG3, -LJ_TTAB\r\n  |  sltiu AT, CARG4, LJ_TISNUM\r\n  |   li TMP0, 1\r\n  |  movn AT, r0, CARG3\r\n  |   mtc1 TMP0, FARG1\r\n  |  beqz AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |   cvt.w.d FRET1, FARG2\r\n  |  cvt.d.w FARG1, FARG1\r\n  |   lw TMP0, TAB:CARG1->asize\r\n  |   lw TMP1, TAB:CARG1->array\r\n  |  mfc1 TMP2, FRET1\r\n  |   addiu RA, BASE, -8\r\n  |  add.d FARG2, FARG2, FARG1\r\n  |  addiu TMP2, TMP2, 1\r\n  |  sltu AT, TMP2, TMP0\r\n  |   sll TMP3, TMP2, 3\r\n  |   addu TMP3, TMP1, TMP3\r\n  |  beqz AT, >2\t\t\t// Not in array part?\r\n  |.  sdc1 FARG2, 0(RA)\r\n  |  lw TMP2, HI(TMP3)\r\n  |  ldc1 f0, 0(TMP3)\r\n  |1:\r\n  |  beq TMP2, TISNIL, ->fff_res\t// End of iteration, return 0 results.\r\n  |.  li RD, (0+1)*8\r\n  |   li RD, (2+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 8(RA)\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  lw TMP0, TAB:CARG1->hmask\r\n  |  load_got lj_tab_getinth\r\n  |  beqz TMP0, ->fff_res\r\n  |.  li RD, (0+1)*8\r\n  |  call_intern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |.  move CARG2, TMP2\r\n  |  // Returns cTValue * or NULL.\r\n  |  beqz CRET1, ->fff_res\r\n  |.  li RD, (0+1)*8\r\n  |  lw TMP2, HI(CRET1)\r\n  |  b <1\r\n  |.  ldc1 f0, 0(CRET1)\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n#if LJ_52\r\n  |  lw TAB:TMP2, TAB:CARG1->metatable\r\n  |   ldc1 f0, CFUNC:RB->upvalue[0]\r\n  |  bnez TAB:TMP2, ->fff_fallback\r\n#else\r\n  |  ldc1 f0, CFUNC:RB->upvalue[0]\r\n#endif\r\n  |.  addiu RA, BASE, -8\r\n  |   sw r0, 8+HI(BASE)\r\n  |   sw r0, 8+LO(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |   move TMP2, BASE\r\n  |   addiu BASE, BASE, 8\r\n  |  // Remember active hook before pcall.\r\n  |  srl TMP3, TMP3, HOOK_ACTIVE_SHIFT\r\n  |  andi TMP3, TMP3, 1\r\n  |  addiu PC, TMP3, 8+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n  |\r\n  |.ffunc xpcall\r\n  |    sltiu AT, NARGS8:RC, 16\r\n  |  lw CARG4, 8+HI(BASE)\r\n  |    bnez AT, ->fff_fallback\r\n  |.  ldc1 FARG2, 8(BASE)\r\n  |   ldc1 FARG1, 0(BASE)\r\n  |    lbu TMP1, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  li AT, LJ_TFUNC\r\n  |   move TMP2, BASE\r\n  |  bne CARG4, AT, ->fff_fallback  // Traceback must be a function.\r\n  |   addiu BASE, BASE, 16\r\n  |  // Remember active hook before pcall.\r\n  |  srl TMP3, TMP3, HOOK_ACTIVE_SHIFT\r\n  |   sdc1 FARG2, 0(TMP2)\t\t// Swap function and traceback.\r\n  |  andi TMP3, TMP3, 1\r\n  |   sdc1 FARG1, 8(TMP2)\r\n  |  addiu PC, TMP3, 16+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |.  addiu NARGS8:RC, NARGS8:RC, -16\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  li AT, LJ_TTHREAD\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  lw L:CARG1, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  lbu TMP0, L:CARG1->status\r\n  |   lw TMP1, L:CARG1->cframe\r\n  |    lw CARG2, L:CARG1->top\r\n  |    lw TMP2, L:CARG1->base\r\n  |  addiu TMP3, TMP0, -LUA_YIELD\r\n  |  bgtz TMP3, ->fff_fallback\t\t// st > LUA_YIELD?\r\n  |.   xor TMP2, TMP2, CARG2\r\n  |  bnez TMP1, ->fff_fallback\t\t// cframe != 0?\r\n  |.  or AT, TMP2, TMP0\r\n  |  lw TMP0, L:CARG1->maxstack\r\n  |  beqz AT, ->fff_fallback\t\t// base == top && st == 0?\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |  addu TMP2, CARG2, NARGS8:RC\r\n  |  sltu AT, TMP0, TMP2\r\n  |  bnez AT, ->fff_fallback\t\t// Stack overflow?\r\n  |.  sw PC, SAVE_PC\r\n  |   sw BASE, L->base\r\n  |1:\r\n  |.if resume\r\n  |  addiu BASE, BASE, 8\t\t// Keep resumed thread in stack for GC.\r\n  |  addiu NARGS8:RC, NARGS8:RC, -8\r\n  |  addiu TMP2, TMP2, -8\r\n  |.endif\r\n  |  sw TMP2, L:CARG1->top\r\n  |  addu TMP1, BASE, NARGS8:RC\r\n  |  move CARG3, CARG2\r\n  |  sw BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |   ldc1 f0, 0(BASE)\r\n  |  sltu AT, BASE, TMP1\r\n  |  beqz AT, >3\r\n  |.  addiu BASE, BASE, 8\r\n  |   sdc1 f0, 0(CARG3)\r\n  |  b <2\r\n  |.  addiu CARG3, CARG3, 8\r\n  |3:\r\n  |  bal ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |.  move L:RA, L:CARG1\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  lw TMP2, L:RA->base\r\n  |   sltiu AT, CRET1, LUA_YIELD+1\r\n  |  lw TMP3, L:RA->top\r\n  |    li_vmstate INTERP\r\n  |  lw BASE, L->base\r\n  |    st_vmstate\r\n  |   beqz AT, >8\r\n  |. subu RD, TMP3, TMP2\r\n  |   lw TMP0, L->maxstack\r\n  |  beqz RD, >6\t\t\t// No results?\r\n  |.  addu TMP1, BASE, RD\r\n  |  sltu AT, TMP0, TMP1\r\n  |  bnez AT, >9\t\t\t// Need to grow stack?\r\n  |.  addu TMP3, TMP2, RD\r\n  |  sw TMP2, L:RA->top\t\t\t// Clear coroutine stack.\r\n  |  move TMP1, BASE\r\n  |5:  // Move results from coroutine.\r\n  |   ldc1 f0, 0(TMP2)\r\n  |  addiu TMP2, TMP2, 8\r\n  |  sltu AT, TMP2, TMP3\r\n  |   sdc1 f0, 0(TMP1)\r\n  |  bnez AT, <5\r\n  |.  addiu TMP1, TMP1, 8\r\n  |6:\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |.if resume\r\n  |  li TMP1, LJ_TTRUE\r\n  |   addiu RA, BASE, -8\r\n  |  sw TMP1, -8+HI(BASE)\t\t// Prepend true to results.\r\n  |  addiu RD, RD, 16\r\n  |.else\r\n  |  move RA, BASE\r\n  |  addiu RD, RD, 8\r\n  |.endif\r\n  |7:\r\n  |  sw PC, SAVE_PC\r\n  |  beqz TMP0, ->BC_RET_Z\r\n  |.  move MULTRES, RD\r\n  |  b ->vm_return\r\n  |.  nop\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  addiu TMP3, TMP3, -8\r\n  |   li TMP1, LJ_TFALSE\r\n  |  ldc1 f0, 0(TMP3)\r\n  |   sw TMP3, L:RA->top\t\t// Remove error from coroutine stack.\r\n  |    li RD, (2+1)*8\r\n  |   sw TMP1, -8+HI(BASE)\t\t// Prepend false to results.\r\n  |    addiu RA, BASE, -8\r\n  |  sdc1 f0, 0(BASE)\t\t\t// Copy error message.\r\n  |  b <7\r\n  |.  andi TMP0, PC, FRAME_TYPE\r\n  |.else\r\n  |  load_got lj_ffh_coroutine_wrap_err\r\n  |  move CARG2, L:RA\r\n  |  call_intern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |.  move CARG1, L\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  load_got lj_state_growstack\r\n  |  srl CARG2, RD, 3\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  b <4\r\n  |.  li CRET1, 0\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  lw TMP0, L->cframe\r\n  |   addu TMP1, BASE, NARGS8:RC\r\n  |   sw BASE, L->base\r\n  |  andi TMP0, TMP0, CFRAME_RESUME\r\n  |   sw TMP1, L->top\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.   li CRET1, LUA_YIELD\r\n  |  sw r0, L->cframe\r\n  |  b ->vm_leave_unw\r\n  |.   sb CRET1, L->status\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.ffunc_n math_abs\r\n  |.  abs.d FRET1, FARG1\r\n  |->fff_resn:\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  addiu RA, BASE, -8\r\n  |  b ->fff_res1\r\n  |.  sdc1 FRET1, -8(BASE)\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG3/CARG1 = TValue result.\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |   sw CARG3, -8+HI(BASE)\r\n  |  addiu RA, BASE, -8\r\n  |   sw CARG1, -8+LO(BASE)\r\n  |->fff_res1:\r\n  |  // RA = results, PC = return.\r\n  |  li RD, (1+1)*8\r\n  |->fff_res:\r\n  |  // RA = results, RD = (nresults+1)*8, PC = return.\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |  bnez TMP0, ->vm_return\r\n  |.  move MULTRES, RD\r\n  |  lw INS, -4(PC)\r\n  |  decode_RB8a RB, INS\r\n  |  decode_RB8b RB\r\n  |5:\r\n  |  sltu AT, RD, RB\r\n  |  bnez AT, >6\t\t\t// More results expected?\r\n  |.  decode_RA8a TMP0, INS\r\n  |  decode_RA8b TMP0\r\n  |  ins_next1\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |   subu BASE, RA, TMP0\r\n  |  ins_next2\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  addu TMP1, RA, RD\r\n  |   addiu RD, RD, 8\r\n  |  b <5\r\n  |.  sw TISNIL, -8+HI(TMP1)\r\n  |\r\n  |.macro math_extern, func\r\n  |->ff_math_ .. func:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  load_got func\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  nop\r\n  |  call_extern\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |.  load_got func\r\n  |  call_extern\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_n math_ .. func\r\n  |.  nop\r\n  |  bal ->vm_ .. func\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.ffunc math_log\r\n  |  lw CARG3, HI(BASE)\r\n  |  li AT, 8\r\n  |  bne NARGS8:RC, AT, ->fff_fallback\t// Exactly 1 argument.\r\n  |.  load_got log\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  nop\r\n  |  call_extern\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.ffunc_n math_sqrt\r\n  |.  sqrt.d FRET1, FARG1\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |->ff_math_deg:\r\n  |.ffunc_n math_rad\r\n  |.  ldc1 FARG2, CFUNC:RB->upvalue[0]\r\n  |  b ->fff_resn\r\n  |.  mul.d FRET1, FARG1, FARG2\r\n  |\r\n  |.ffunc_nn math_ldexp\r\n  |  cvt.w.d FARG2, FARG2\r\n  |  load_got ldexp\r\n  |  mfc1 CARG3, FARG2\r\n  |  call_extern\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |  load_got frexp\r\n  |   lw PC, FRAME_PC(BASE)\r\n  |  call_extern\r\n  |.  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |   lw TMP1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  addiu RA, BASE, -8\r\n  |   mtc1 TMP1, FARG2\r\n  |  sdc1 FRET1, 0(RA)\r\n  |   cvt.d.w FARG2, FARG2\r\n  |   sdc1 FARG2, 8(RA)\r\n  |  b ->fff_res\r\n  |.  li RD, (2+1)*8\r\n  |\r\n  |.ffunc_n math_modf\r\n  |  load_got modf\r\n  |   lw PC, FRAME_PC(BASE)\r\n  |  call_extern\r\n  |.  addiu CARG3, BASE, -8\r\n  |  addiu RA, BASE, -8\r\n  |  sdc1 FRET1, 0(BASE)\r\n  |  b ->fff_res\r\n  |.  li RD, (2+1)*8\r\n  |\r\n  |.macro math_minmax, name, ismax\r\n  |->ff_ .. name:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  ldc1 FRET1, 0(BASE)\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  addu TMP2, BASE, NARGS8:RC\r\n  |  addiu TMP1, BASE, 8\r\n  |  beq TMP1, TMP2, ->fff_resn\r\n  |1:\r\n  |.  lw CARG3, HI(TMP1)\r\n  |  ldc1 FARG1, 0(TMP1)\r\n  |   addiu TMP1, TMP1, 8\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.if ismax\r\n  |.  c.olt.d FARG1, FRET1\r\n  |.else\r\n  |.  c.olt.d FRET1, FARG1\r\n  |.endif\r\n  |  bne TMP1, TMP2, <1\r\n  |.  movf.d FRET1, FARG1\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, 0\r\n  |  math_minmax math_max, 1\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc_1 string_len\r\n  |  li AT, LJ_TSTR\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  nop\r\n  |  b ->fff_resi\r\n  |.  lw CRET1, STR:CARG1->len\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  lw CARG3, HI(BASE)\r\n  |   lw STR:CARG1, LO(BASE)\r\n  |  xori AT, NARGS8:RC, 8\r\n  |  addiu CARG3, CARG3, -LJ_TSTR\r\n  |  or AT, AT, CARG3\r\n  |  bnez AT, ->fff_fallback\t\t// Need exactly 1 string argument.\r\n  |.  nop\r\n  |  lw TMP0, STR:CARG1->len\r\n  |   lbu TMP1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |    addiu RA, BASE, -8\r\n  |  sltu RD, r0, TMP0\r\n  |   mtc1 TMP1, f0\r\n  |  addiu RD, RD, 1\r\n  |   cvt.d.w f0, f0\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  sll RD, RD, 3\t\t\t// RD = ((str->len != 0)+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  lw CARG3, HI(BASE)\r\n  |   ldc1 FARG1, 0(BASE)\r\n  |  li AT, 8\r\n  |  bne NARGS8:RC, AT, ->fff_fallback\t// Exactly 1 argument.\r\n  |.  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  li CARG3, 1\r\n  |   cvt.w.d FARG1, FARG1\r\n  |  addiu CARG2, sp, ARG5_OFS\r\n  |  sltiu AT, TMP0, 256\r\n  |   mfc1 TMP0, FARG1\r\n  |  beqz AT, ->fff_fallback\r\n  |.  sw TMP0, ARG5\r\n  |->fff_newstr:\r\n  |  load_got lj_str_new\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |.  move CARG1, L\r\n  |  // Returns GCstr *.\r\n  |  lw BASE, L->base\r\n  |  move CARG1, CRET1\r\n  |  b ->fff_restv\r\n  |.  li CARG3, LJ_TSTR\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  addiu AT, NARGS8:RC, -16\r\n  |   lw CARG3, 16+HI(BASE)\r\n  |    ldc1 f0, 16(BASE)\r\n  |   lw TMP0, HI(BASE)\r\n  |    lw STR:CARG1, LO(BASE)\r\n  |  bltz AT, ->fff_fallback\r\n  |   lw CARG2, 8+HI(BASE)\r\n  |    ldc1 f2, 8(BASE)\r\n  |  beqz AT, >1\r\n  |.  li CARG4, -1\r\n  |   cvt.w.d f0, f0\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  mfc1 CARG4, f0\r\n  |1:\r\n  |  sltiu AT, CARG2, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  li AT, LJ_TSTR\r\n  |  cvt.w.d f2, f2\r\n  |  bne TMP0, AT, ->fff_fallback\r\n  |.  lw CARG2, STR:CARG1->len\r\n  |  mfc1 CARG3, f2\r\n  |  // STR:CARG1 = str, CARG2 = str->len, CARG3 = start, CARG4 = end\r\n  |  slt AT, CARG4, r0\r\n  |  addiu TMP0, CARG2, 1\r\n  |  addu TMP1, CARG4, TMP0\r\n  |   slt TMP3, CARG3, r0\r\n  |  movn CARG4, TMP1, AT\t\t// if (end < 0) end += len+1\r\n  |   addu TMP1, CARG3, TMP0\r\n  |   movn CARG3, TMP1, TMP3\t\t// if (start < 0) start += len+1\r\n  |   li TMP2, 1\r\n  |  slt AT, CARG4, r0\r\n  |   slt TMP3, r0, CARG3\r\n  |  movn CARG4, r0, AT\t\t\t// if (end < 0) end = 0\r\n  |   movz CARG3, TMP2, TMP3\t\t// if (start < 1) start = 1\r\n  |  slt AT, CARG2, CARG4\r\n  |  movn CARG4, CARG2, AT\t\t// if (end > len) end = len\r\n  |   addu CARG2, STR:CARG1, CARG3\r\n  |  subu CARG3, CARG4, CARG3\t\t// len = end - start\r\n  |   addiu CARG2, CARG2, sizeof(GCstr)-1\r\n  |  bgez CARG3, ->fff_newstr\r\n  |.  addiu CARG3, CARG3, 1\t\t// len++\r\n  |->fff_emptystr:  // Return empty string.\r\n  |  addiu STR:CARG1, DISPATCH, DISPATCH_GL(strempty)\r\n  |  b ->fff_restv\r\n  |.  li CARG3, LJ_TSTR\r\n  |\r\n  |.ffunc string_rep\t\t\t// Only handle the 1-char case inline.\r\n  |  ffgccheck\r\n  |  lw TMP0, HI(BASE)\r\n  |   addiu AT, NARGS8:RC, -16\t\t// Exactly 2 arguments.\r\n  |  lw CARG4, 8+HI(BASE)\r\n  |   lw STR:CARG1, LO(BASE)\r\n  |  addiu TMP0, TMP0, -LJ_TSTR\r\n  |   ldc1 f0, 8(BASE)\r\n  |  or AT, AT, TMP0\r\n  |  bnez AT, ->fff_fallback\r\n  |.  sltiu AT, CARG4, LJ_TISNUM\r\n  |   cvt.w.d f0, f0\r\n  |  beqz AT, ->fff_fallback\r\n  |.  lw TMP0, STR:CARG1->len\r\n  |   mfc1 CARG3, f0\r\n  |  lw TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  li AT, 1\r\n  |   blez CARG3, ->fff_emptystr\t// Count <= 0?\r\n  |.   sltu AT, AT, TMP0\r\n  |  beqz TMP0, ->fff_emptystr\t\t// Zero length string?\r\n  |.  sltu TMP0, TMP1, CARG3\r\n  |  or AT, AT, TMP0\r\n  |   lw CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  bnez AT, ->fff_fallback\t\t// Fallback for > 1-char strings.\r\n  |.  lbu TMP0, STR:CARG1[1]\r\n  |  addu TMP2, CARG2, CARG3\r\n  |1:  // Fill buffer with char. Yes, this is suboptimal code (do you care?).\r\n  |  addiu TMP2, TMP2, -1\r\n  |  sltu AT, CARG2, TMP2\r\n  |  bnez AT, <1\r\n  |.  sb TMP0, 0(TMP2)\r\n  |  b ->fff_newstr\r\n  |.  nop\r\n  |\r\n  |.ffunc string_reverse\r\n  |  ffgccheck\r\n  |  lw CARG3, HI(BASE)\r\n  |   lw STR:CARG1, LO(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  li AT, LJ_TSTR\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  lw CARG3, STR:CARG1->len\r\n  |   addiu CARG1, STR:CARG1, #STR\r\n  |   lw CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  sltu AT, TMP1, CARG3\r\n  |  bnez AT, ->fff_fallback\r\n  |.  addu TMP3, CARG1, CARG3\r\n  |  addu CARG4, CARG2, CARG3\r\n  |1:  // Reverse string copy.\r\n  |   lbu TMP1, 0(CARG1)\r\n  |  sltu AT, CARG1, TMP3\r\n  |  beqz AT, ->fff_newstr\r\n  |.  addiu CARG1, CARG1, 1\r\n  |  addiu CARG4, CARG4, -1\r\n  |  b <1\r\n  |   sb TMP1, 0(CARG4)\r\n  |\r\n  |.macro ffstring_case, name, lo\r\n  |  .ffunc name\r\n  |  ffgccheck\r\n  |  lw CARG3, HI(BASE)\r\n  |   lw STR:CARG1, LO(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  li AT, LJ_TSTR\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  lw CARG3, STR:CARG1->len\r\n  |   addiu CARG1, STR:CARG1, #STR\r\n  |   lw CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  sltu AT, TMP1, CARG3\r\n  |  bnez AT, ->fff_fallback\r\n  |.  addu TMP3, CARG1, CARG3\r\n  |  move CARG4, CARG2\r\n  |1:  // ASCII case conversion.\r\n  |   lbu TMP1, 0(CARG1)\r\n  |  sltu AT, CARG1, TMP3\r\n  |  beqz AT, ->fff_newstr\r\n  |.  addiu TMP0, TMP1, -lo\r\n  |   xori TMP2, TMP1, 0x20\r\n  |   sltiu AT, TMP0, 26\r\n  |   movn TMP1, TMP2, AT\r\n  |  addiu CARG1, CARG1, 1\r\n  |   sb TMP1, 0(CARG4)\r\n  |  b <1\r\n  |.  addiu CARG4, CARG4, 1\r\n  |.endmacro\r\n  |\r\n  |ffstring_case string_lower, 65\r\n  |ffstring_case string_upper, 97\r\n  |\r\n  |//-- Table library ------------------------------------------------------\r\n  |\r\n  |.ffunc_1 table_getn\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  load_got lj_tab_len\r\n  |  call_intern lj_tab_len\t\t// (GCtab *t)\r\n  |.  nop\r\n  |  // Returns uint32_t (but less than 2^31).\r\n  |  b ->fff_resi\r\n  |.  nop\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_n bit_..name\r\n  |.  add.d FARG1, FARG1, TOBIT\r\n  |  mfc1 CRET1, FARG1\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  addiu TMP1, BASE, 8\r\n  |  addu TMP2, BASE, NARGS8:RC\r\n  |1:\r\n  |  lw CARG4, HI(TMP1)\r\n  |  beq TMP1, TMP2, ->fff_resi\r\n  |.  ldc1 FARG1, 0(TMP1)\r\n  |  sltiu AT, CARG4, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |  add.d FARG1, FARG1, TOBIT\r\n  |  mfc1 CARG2, FARG1\r\n  |  ins CRET1, CRET1, CARG2\r\n  |  b <1\r\n  |.  addiu TMP1, TMP1, 8\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, or\r\n  |.ffunc_bit_op bxor, xor\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  srl TMP0, CRET1, 24\r\n  |   srl TMP2, CRET1, 8\r\n  |  sll TMP1, CRET1, 24\r\n  |   andi TMP2, TMP2, 0xff00\r\n  |  or TMP0, TMP0, TMP1\r\n  |   andi CRET1, CRET1, 0xff00\r\n  |  or TMP0, TMP0, TMP2\r\n  |   sll CRET1, CRET1, 8\r\n  |  b ->fff_resi\r\n  |.  or CRET1, TMP0, CRET1\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  b ->fff_resi\r\n  |.  not CRET1, CRET1\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc_nn bit_..name\r\n  |.  add.d FARG1, FARG1, TOBIT\r\n  |  add.d FARG2, FARG2, TOBIT\r\n  |  mfc1 CARG1, FARG1\r\n  |  mfc1 CARG2, FARG2\r\n  |.if shmod == 1\r\n  |  li AT, 32\r\n  |  subu TMP0, AT, CARG2\r\n  |  sllv CARG2, CARG1, CARG2\r\n  |  srlv CARG1, CARG1, TMP0\r\n  |.elif shmod == 2\r\n  |  li AT, 32\r\n  |  subu TMP0, AT, CARG2\r\n  |  srlv CARG2, CARG1, CARG2\r\n  |  sllv CARG1, CARG1, TMP0\r\n  |.endif\r\n  |  b ->fff_resi\r\n  |.  ins CRET1, CARG1, CARG2\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, sllv, 0\r\n  |.ffunc_bit_sh rshift, srlv, 0\r\n  |.ffunc_bit_sh arshift, srav, 0\r\n  |// Can't use rotrv, since it's only in MIPS32R2.\r\n  |.ffunc_bit_sh rol, or, 1\r\n  |.ffunc_bit_sh ror, or, 2\r\n  |\r\n  |.ffunc_bit tobit\r\n  |->fff_resi:\r\n  |  mtc1 CRET1, FRET1\r\n  |  b ->fff_resn\r\n  |.  cvt.d.w FRET1, FRET1\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RB = CFUNC, RC = nargs*8\r\n  |  lw TMP3, CFUNC:RB->f\r\n  |    addu TMP1, BASE, NARGS8:RC\r\n  |   lw PC, FRAME_PC(BASE)\t\t// Fallback may overwrite PC.\r\n  |    addiu TMP0, TMP1, 8*LUA_MINSTACK\r\n  |     lw TMP2, L->maxstack\r\n  |   sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  sltu AT, TMP2, TMP0\r\n  |     sw BASE, L->base\r\n  |    sw TMP1, L->top\r\n  |  bnez AT, >5\t\t\t// Need to grow stack.\r\n  |.  move CFUNCADDR, TMP3\r\n  |  jalr TMP3\t\t\t\t// (lua_State *L)\r\n  |.  move CARG1, L\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  lw BASE, L->base\r\n  |   sll RD, CRET1, 3\r\n  |  bgtz CRET1, ->fff_res\t\t// Returned nresults+1?\r\n  |.  addiu RA, BASE, -8\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |  lw TMP0, L->top\r\n  |   lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  bnez CRET1, ->vm_call_tail\t\t// Returned -1?\r\n  |.  subu NARGS8:RC, TMP0, BASE\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |   li AT, -4\r\n  |  bnez TMP0, >3\r\n  |.  and TMP1, PC, AT\r\n  |  lbu TMP1, OFS_RA(PC)\r\n  |  sll TMP1, TMP1, 3\r\n  |  addiu TMP1, TMP1, 8\r\n  |3:\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |.  subu TMP2, BASE, TMP1\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  load_got lj_state_growstack\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  lw BASE, L->base\r\n  |  b <1\r\n  |.  li CRET1, 0\t\t\t// Force retry.\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  move MULTRES, ra\r\n  |  load_got lj_gc_step\r\n  |   sw BASE, L->base\r\n  |  addu TMP0, BASE, NARGS8:RC\r\n  |   sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  sw TMP0, L->top\r\n  |  call_intern lj_gc_step\t\t// (lua_State *L)\r\n  |.  move CARG1, L\r\n  |   lw BASE, L->base\r\n  |  move ra, MULTRES\r\n  |    lw TMP0, L->top\r\n  |  lw CFUNC:RB, FRAME_FUNC(BASE)\r\n  |  jr ra\r\n  |.  subu NARGS8:RC, TMP0, BASE\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_VMEVENT\t// No recording while in vmevent.\r\n  |  bnez AT, >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |.  lw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\r\n  |  bnez AT, >1\r\n  |.  addiu TMP2, TMP2, -1\r\n  |  andi AT, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqz AT, >1\r\n  |.  nop\r\n  |  b >1\r\n  |.  sw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  beqz AT, >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |.  lw AT, GG_DISP2STATIC(TMP0)\t// Assumes TMP0 holds DISPATCH+OP*4.\r\n  |  jr AT\r\n  |.  nop\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  lw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  bnez AT, <5\r\n  |.  andi AT, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqz AT, <5\r\n  |.  addiu TMP2, TMP2, -1\r\n  |  beqz TMP2, >1\r\n  |.  sw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, LUA_MASKLINE\r\n  |  beqz AT, <5\r\n  |1:\r\n  |.  load_got lj_dispatch_ins\r\n  |   sw MULTRES, SAVE_MULTRES\r\n  |  move CARG2, PC\r\n  |   sw BASE, L->base\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  call_intern lj_dispatch_ins\t// (lua_State *L, const BCIns *pc)\r\n  |.  move CARG1, L\r\n  |3:\r\n  |  lw BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  lw INS, -4(PC)\r\n  |  decode_OP4a TMP1, INS\r\n  |  decode_OP4b TMP1\r\n  |  addu TMP0, DISPATCH, TMP1\r\n  |   decode_RD8a RD, INS\r\n  |  lw AT, GG_DISP2STATIC(TMP0)\r\n  |   decode_RA8a RA, INS\r\n  |   decode_RD8b RD\r\n  |  jr AT\r\n  |   decode_RA8b RA\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  addiu PC, PC, 4\r\n  |  b <4\r\n  |.  lw MULTRES, -24+LO(RB)\t\t// Restore MULTRES for *M ins.\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |   addiu CARG1, DISPATCH, GG_DISP2J\r\n  |   sw PC, SAVE_PC\r\n  |  lw TMP1, LFUNC:TMP1->pc\r\n  |   move CARG2, PC\r\n  |   sw L, DISPATCH_J(L)(DISPATCH)\r\n  |  lbu TMP1, PC2PROTO(framesize)(TMP1)\r\n  |  load_got lj_trace_hot\r\n  |   sw BASE, L->base\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, BASE, TMP1\r\n  |  call_intern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |.  sw TMP1, L->top\r\n  |  b <3\r\n  |.  nop\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |.  move CARG2, PC\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  ori CARG2, PC, 1\r\n  |1:\r\n  |.endif\r\n  |  load_got lj_dispatch_call\r\n  |  addu TMP0, BASE, RC\r\n  |   sw PC, SAVE_PC\r\n  |   sw BASE, L->base\r\n  |  subu RA, RA, BASE\r\n  |   sw TMP0, L->top\r\n  |  call_intern lj_dispatch_call\t// (lua_State *L, const BCIns *pc)\r\n  |.  move CARG1, L\r\n  |  // Returns ASMFunction.\r\n  |  lw BASE, L->base\r\n  |   lw TMP0, L->top\r\n  |   sw r0, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  subu NARGS8:RC, TMP0, BASE\r\n  |  addu RA, BASE, RA\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  jr CRET1\r\n  |.  lw INS, -4(PC)\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro savex_, a, b\r\n  |  sdc1 f..a, 16+a*8(sp)\r\n  |  sw r..a, 16+32*8+a*4(sp)\r\n  |  sw r..b, 16+32*8+b*4(sp)\r\n  |.endmacro\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  addiu sp, sp, -(16+32*8+32*4)\r\n  |  savex_ 0, 1\r\n  |  savex_ 2, 3\r\n  |  savex_ 4, 5\r\n  |  savex_ 6, 7\r\n  |  savex_ 8, 9\r\n  |  savex_ 10, 11\r\n  |  savex_ 12, 13\r\n  |  savex_ 14, 15\r\n  |  savex_ 16, 17\r\n  |  savex_ 18, 19\r\n  |  savex_ 20, 21\r\n  |  savex_ 22, 23\r\n  |  savex_ 24, 25\r\n  |  savex_ 26, 27\r\n  |  sdc1 f28, 16+28*8(sp)\r\n  |  sw r28, 16+32*8+28*4(sp)\r\n  |  sdc1 f30, 16+30*8(sp)\r\n  |  sw r30, 16+32*8+30*4(sp)\r\n  |  sw r0, 16+32*8+31*4(sp)\t\t// Clear RID_TMP.\r\n  |  li_vmstate EXIT\r\n  |   addiu TMP2, sp, 16+32*8+32*4\t// Recompute original value of sp.\r\n  |  addiu DISPATCH, JGL, -GG_DISP2G-32768\r\n  |  lw TMP1, 0(TMP2)\t\t\t// Load exit number.\r\n  |  st_vmstate\r\n  |   sw TMP2, 16+32*8+29*4(sp)\t\t// Store sp in RID_SP.\r\n  |  lw L, DISPATCH_GL(jit_L)(DISPATCH)\r\n  |  lw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  load_got lj_trace_exit\r\n  |  sw L, DISPATCH_J(L)(DISPATCH)\r\n  |  sw ra, DISPATCH_J(parent)(DISPATCH)  // Store trace number.\r\n  |  sw TMP1, DISPATCH_J(exitno)(DISPATCH)  // Store exit number.\r\n  |  addiu CARG1, DISPATCH, GG_DISP2J\r\n  |  sw BASE, L->base\r\n  |  call_intern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |.  addiu CARG2, sp, 16\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  lw TMP1, L->cframe\r\n  |  li AT, -4\r\n  |   lw BASE, L->base\r\n  |  and sp, TMP1, AT\r\n  |   lw PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  b >1\r\n  |.  sw L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |.if JIT\r\n  |  // CRET1 = MULTRES or negated error code, BASE, PC and JGL set.\r\n  |  lw L, SAVE_L\r\n  |  addiu DISPATCH, JGL, -GG_DISP2G-32768\r\n  |1:\r\n  |  bltz CRET1, >3\t\t\t// Check for error from exit.\r\n  |.  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |    lui TMP3, 0x59c0\t\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  sll MULTRES, CRET1, 3\r\n  |    li TISNIL, LJ_TNIL\r\n  |  sw MULTRES, SAVE_MULTRES\r\n  |    mtc1 TMP3, TOBIT\r\n  |  lw TMP1, LFUNC:TMP1->pc\r\n  |   sw r0, DISPATCH_GL(jit_L)(DISPATCH)\r\n  |  lw KBASE, PC2PROTO(k)(TMP1)\r\n  |    cvt.d.s TOBIT, TOBIT\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  lw INS, 0(PC)\r\n  |   addiu PC, PC, 4\r\n  |    // Assumes TISNIL == ~LJ_VMST_INTERP == -1\r\n  |    sw TISNIL, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  decode_OP4a TMP1, INS\r\n  |  decode_OP4b TMP1\r\n  |    sltiu TMP2, TMP1, BC_FUNCF*4\t// Function header?\r\n  |  addu TMP0, DISPATCH, TMP1\r\n  |   decode_RD8a RD, INS\r\n  |  lw AT, 0(TMP0)\r\n  |   decode_RA8a RA, INS\r\n  |    beqz TMP2, >2\r\n  |.  decode_RA8b RA\r\n  |  jr AT\r\n  |.  decode_RD8b RD\r\n  |2:\r\n  |  addiu RC, MULTRES, -8\r\n  |  jr AT\r\n  |.  addu RA, RA, BASE\r\n  |\r\n  |3:  // Rethrow error from the right C frame.\r\n  |  load_got lj_err_throw\r\n  |  negu CARG2, CRET1\r\n  |  call_intern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.  move CARG1, L\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Modifies AT, TMP0, FRET1, FRET2, f4. Keeps all others incl. FARG1.\r\n  |.macro vm_round, func\r\n  |  lui TMP0, 0x4330\t\t\t// Hiword of 2^52 (double).\r\n  |  mtc1 r0, f4\r\n  |  mtc1 TMP0, f5\r\n  |  abs.d FRET2, FARG1\t\t\t// |x|\r\n  |    mfc1 AT, f13\r\n  |  c.olt.d 0, FRET2, f4\r\n  |   add.d FRET1, FRET2, f4\t\t// (|x| + 2^52) - 2^52\r\n  |  bc1f 0, >1\t\t\t\t// Truncate only if |x| < 2^52.\r\n  |.  sub.d FRET1, FRET1, f4\r\n  |    slt AT, AT, r0\r\n  |.if \"func\" == \"ceil\"\r\n  |   lui TMP0, 0xbff0\t\t\t// Hiword of -1 (double). Preserves -0.\r\n  |.else\r\n  |   lui TMP0, 0x3ff0\t\t\t// Hiword of +1 (double).\r\n  |.endif\r\n  |.if \"func\" == \"trunc\"\r\n  |   mtc1 TMP0, f5\r\n  |  c.olt.d 0, FRET2, FRET1\t\t// |x| < result?\r\n  |   sub.d FRET2, FRET1, f4\r\n  |  movt.d FRET1, FRET2, 0\t\t// If yes, subtract +1.\r\n  |  neg.d FRET2, FRET1\r\n  |  jr ra\r\n  |.  movn.d FRET1, FRET2, AT\t\t// Merge sign bit back in.\r\n  |.else\r\n  |  neg.d FRET2, FRET1\r\n  |   mtc1 TMP0, f5\r\n  |  movn.d FRET1, FRET2, AT\t\t// Merge sign bit back in.\r\n  |.if \"func\" == \"ceil\"\r\n  |  c.olt.d 0, FRET1, FARG1\t\t// x > result?\r\n  |.else\r\n  |  c.olt.d 0, FARG1, FRET1\t\t// x < result?\r\n  |.endif\r\n  |   sub.d FRET2, FRET1, f4\t\t// If yes, subtract +-1.\r\n  |  jr ra\r\n  |.  movt.d FRET1, FRET2, 0\r\n  |.endif\r\n  |1:\r\n  |  jr ra\r\n  |.  mov.d FRET1, FARG1\r\n  |.endmacro\r\n  |\r\n  |->vm_floor:\r\n  |  vm_round floor\r\n  |->vm_ceil:\r\n  |  vm_round ceil\r\n  |->vm_trunc:\r\n  |.if JIT\r\n  |  vm_round trunc\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in r1, g in r2.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs\r\n  |  lw CTSTATE, GL:r2->ctype_state\r\n  |   addiu DISPATCH, r2, GG_G2DISP\r\n  |  load_got lj_ccallback_enter\r\n  |  sw r1, CTSTATE->cb.slot\r\n  |  sw CARG1, CTSTATE->cb.gpr[0]\r\n  |  sw CARG2, CTSTATE->cb.gpr[1]\r\n  |   sdc1 FARG1, CTSTATE->cb.fpr[0]\r\n  |  sw CARG3, CTSTATE->cb.gpr[2]\r\n  |  sw CARG4, CTSTATE->cb.gpr[3]\r\n  |   sdc1 FARG2, CTSTATE->cb.fpr[1]\r\n  |  addiu TMP0, sp, CFRAME_SPACE+16\r\n  |  sw TMP0, CTSTATE->cb.stack\r\n  |  sw r0, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   move CARG2, sp\r\n  |  call_intern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |.  move CARG1, CTSTATE\r\n  |  // Returns lua_State *.\r\n  |  lw BASE, L:CRET1->base\r\n  |  lw RC, L:CRET1->top\r\n  |   move L, CRET1\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |     mtc1 TMP3, TOBIT\r\n  |    li_vmstate INTERP\r\n  |     li TISNIL, LJ_TNIL\r\n  |  subu RC, RC, BASE\r\n  |    st_vmstate\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  load_got lj_ccallback_leave\r\n  |  lw CTSTATE, DISPATCH_GL(ctype_state)(DISPATCH)\r\n  |   sw BASE, L->base\r\n  |   sw RB, L->top\r\n  |  sw L, CTSTATE->L\r\n  |  move CARG2, RA\r\n  |  call_intern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |.  move CARG1, CTSTATE\r\n  |  lw CRET1, CTSTATE->cb.gpr[0]\r\n  |   ldc1 FRET1, CTSTATE->cb.fpr[0]\r\n  |  lw CRET2, CTSTATE->cb.gpr[1]\r\n  |  b ->vm_leave_unw\r\n  |.  ldc1 FRET2, CTSTATE->cb.fpr[1]\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, CARG1\r\n  |  lw TMP1, CCSTATE->spadj\r\n  |   lbu CARG2, CCSTATE->nsp\r\n  |  move TMP2, sp\r\n  |  subu sp, sp, TMP1\r\n  |  sw ra, -4(TMP2)\r\n  |   sll CARG2, CARG2, 2\r\n  |  sw r16, -8(TMP2)\r\n  |  sw CCSTATE, -12(TMP2)\r\n  |  move r16, TMP2\r\n  |  addiu TMP1, CCSTATE, offsetof(CCallState, stack)\r\n  |  addiu TMP2, sp, 16\r\n  |  beqz CARG2, >2\r\n  |.  addu TMP3, TMP1, CARG2\r\n  |1:\r\n  |   lw TMP0, 0(TMP1)\r\n  |  addiu TMP1, TMP1, 4\r\n  |  sltu AT, TMP1, TMP3\r\n  |   sw TMP0, 0(TMP2)\r\n  |  bnez AT, <1\r\n  |.  addiu TMP2, TMP2, 4\r\n  |2:\r\n  |  lw CFUNCADDR, CCSTATE->func\r\n  |  lw CARG2, CCSTATE->gpr[1]\r\n  |  lw CARG3, CCSTATE->gpr[2]\r\n  |  lw CARG4, CCSTATE->gpr[3]\r\n  |  ldc1 FARG1, CCSTATE->fpr[0]\r\n  |  ldc1 FARG2, CCSTATE->fpr[1]\r\n  |  jalr CFUNCADDR\r\n  |.  lw CARG1, CCSTATE->gpr[0]\t\t// Do this last, since CCSTATE is CARG1.\r\n  |  lw CCSTATE:TMP1, -12(r16)\r\n  |  lw TMP2, -8(r16)\r\n  |  lw ra, -4(r16)\r\n  |  sw CRET1, CCSTATE:TMP1->gpr[0]\r\n  |  sw CRET2, CCSTATE:TMP1->gpr[1]\r\n  |  sdc1 FRET1, CCSTATE:TMP1->fpr[0]\r\n  |  sdc1 FRET2, CCSTATE:TMP1->fpr[1]\r\n  |  move sp, r16\r\n  |  jr ra\r\n  |.  move r16, TMP2\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  addu CARG2, BASE, RA\r\n    |   addu CARG3, BASE, RD\r\n    |  lw TMP0, HI(CARG2)\r\n    |   lw TMP1, HI(CARG3)\r\n    |   ldc1 f0, 0(CARG2)\r\n    |   ldc1 f2, 0(CARG3)\r\n    |  sltiu TMP0, TMP0, LJ_TISNUM\r\n    |   sltiu TMP1, TMP1, LJ_TISNUM\r\n    |    lhu TMP2, OFS_RD(PC)\r\n    |  and TMP0, TMP0, TMP1\r\n    |    addiu PC, PC, 4\r\n    |  beqz TMP0, ->vmeta_comp\r\n    |.   lui TMP1, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |    decode_RD4b TMP2\r\n    |    addu TMP2, TMP2, TMP1\r\n    if (op == BC_ISLT || op == BC_ISGE) {\r\n      |  c.olt.d f0, f2\r\n    } else {\r\n      |  c.ole.d f0, f2\r\n    }\r\n    if (op == BC_ISLT || op == BC_ISLE) {\r\n      |  movf TMP2, r0\r\n    } else {\r\n      |  movt TMP2, r0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   ldc1 f0, 0(RA)\r\n    |  addu RD, BASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |   lw TMP1, HI(RD)\r\n    |   ldc1 f2, 0(RD)\r\n    |    lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |  sltiu CARG1, TMP1, LJ_TISNUM\r\n    |    decode_RD4b TMP2\r\n    |  and AT, AT, CARG1\r\n    |  beqz AT, >5\r\n    |.   addu TMP2, TMP2, TMP3\r\n    |  c.eq.d f0, f2\r\n    if (vk) {\r\n      |  movf TMP2, r0\r\n    } else {\r\n      |  movt TMP2, r0\r\n    }\r\n    |1:\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    |5:  // Either or both types are not numbers.\r\n    |  lw CARG2, LO(RA)\r\n    |  lw CARG3, LO(RD)\r\n    |.if FFI\r\n    |  li TMP3, LJ_TCDATA\r\n    |  beq TMP0, TMP3, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  sltiu AT, TMP0, LJ_TISPRI\t\t// Not a primitive?\r\n    |.if FFI\r\n    |  beq TMP1, TMP3, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  xor TMP3, CARG2, CARG3\t\t\t// Same tv?\r\n    |  xor TMP1, TMP1, TMP0\t\t\t// Same type?\r\n    |  sltiu CARG1, TMP0, LJ_TISTABUD+1\t\t// Table or userdata?\r\n    |  movz TMP3, r0, AT\t\t\t// Ignore tv if primitive.\r\n    |  movn CARG1, r0, TMP1\t\t\t// Tab/ud and same type?\r\n    |  or AT, TMP1, TMP3\t\t\t// Same type && (pri||same tv).\r\n    |  movz CARG1, r0, AT\r\n    |  beqz CARG1, <1\t// Done if not tab/ud or not same type or same tv.\r\n    if (vk) {\r\n      |.  movn TMP2, r0, AT\r\n    } else {\r\n      |.  movz TMP2, r0, AT\r\n    }\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  lw TAB:TMP1, TAB:CARG2->metatable\r\n    |  beqz TAB:TMP1, <1\t\t// No metatable?\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP1->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_eq\r\n    |  bnez TMP1, <1\t\t\t// Or 'no __eq' flag set?\r\n    |.  nop\r\n    |  b ->vmeta_equal\t\t\t// Handle __eq metamethod.\r\n    |.  li CARG4, 1-vk\t\t\t// ne = 0 or 1.\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RD = str_const*8 (~), JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   srl RD, RD, 1\r\n    |  lw STR:TMP3, LO(RA)\r\n    |   subu RD, KBASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |.if FFI\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  lw STR:TMP1, -4(RD)\t\t// KBASE-4-str_const*4\r\n    |  addiu TMP0, TMP0, -LJ_TSTR\r\n    |   decode_RD4b TMP2\r\n    |  xor TMP1, STR:TMP1, STR:TMP3\r\n    |  or TMP0, TMP0, TMP1\r\n    |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |   addu TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  movn TMP2, r0, TMP0\r\n    } else {\r\n      |  movz TMP2, r0, TMP0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RD = num_const*8, JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   ldc1 f0, 0(RA)\r\n    |  addu RD, KBASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |   ldc1 f2, 0(RD)\r\n    |    lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |    decode_RD4b TMP2\r\n    |.if FFI\r\n    |  beqz AT, >5\r\n    |.else\r\n    |  beqz AT, >1\r\n    |.endif\r\n    |.   addu TMP2, TMP2, TMP3\r\n    |   c.eq.d f0, f2\r\n    if (vk) {\r\n      |  movf TMP2, r0\r\n      |  addu PC, PC, TMP2\r\n      |1:\r\n    } else {\r\n      |  movt TMP2, r0\r\n      |1:\r\n      |  addu PC, PC, TMP2\r\n    }\r\n    |  ins_next\r\n    |.if FFI\r\n    |5:\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.  nop\r\n    |  b <1\r\n    |.  nop\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RD = primitive_type*8 (~), JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   srl TMP1, RD, 3\r\n    |  lw TMP0, HI(RA)\r\n    |    lhu TMP2, OFS_RD(PC)\r\n    |   not TMP1, TMP1\r\n    |    addiu PC, PC, 4\r\n    |.if FFI\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  xor TMP0, TMP0, TMP1\r\n    |  decode_RD4b TMP2\r\n    |  lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  addu TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  movn TMP2, r0, TMP0\r\n    } else {\r\n      |  movz TMP2, r0, TMP0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RD = src*8, JMP with RD = target\r\n    |  addu RD, BASE, RD\r\n    |   lhu TMP2, OFS_RD(PC)\r\n    |  lw TMP0, HI(RD)\r\n    |   addiu PC, PC, 4\r\n    if (op == BC_IST || op == BC_ISF) {\r\n      |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n      |   decode_RD4b TMP2\r\n      |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n      |   addu TMP2, TMP2, TMP3\r\n      if (op == BC_IST) {\r\n\t|  movz TMP2, r0, TMP0\r\n      } else {\r\n\t|  movn TMP2, r0, TMP0\r\n      }\r\n      |  addu PC, PC, TMP2\r\n    } else {\r\n      |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n      |  ldc1 f0, 0(RD)\r\n      if (op == BC_ISTC) {\r\n\t|  beqz TMP0, >1\r\n      } else {\r\n\t|  bnez TMP0, >1\r\n      }\r\n      |.  addu RA, BASE, RA\r\n      |   decode_RD4b TMP2\r\n      |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n      |   addu TMP2, TMP2, TMP3\r\n      |  sdc1 f0, 0(RA)\r\n      |   addu PC, PC, TMP2\r\n      |1:\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu RD, BASE, RD\r\n    |  addu RA, BASE, RA\r\n    |  ldc1 f0, 0(RD)\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu RD, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(RD)\r\n    |   li TMP1, LJ_TFALSE\r\n    |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n    |  addiu TMP1, TMP0, LJ_TTRUE\r\n    |  ins_next1\r\n    |  sw TMP1, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu CARG3, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(CARG3)\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |  beqz AT, ->vmeta_unm\r\n    |.  neg.d f0, f0\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu CARG2, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(CARG2)\r\n    |   lw CARG1, LO(CARG2)\r\n    |  li AT, LJ_TSTR\r\n    |  bne TMP0, AT, >2\r\n    |.  li AT, LJ_TTAB\r\n    |  lw CRET1, STR:CARG1->len\r\n    |1:\r\n    |  mtc1 CRET1, f0\r\n    |  cvt.d.w f0, f0\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |2:\r\n    |  bne TMP0, AT, ->vmeta_len\r\n    |.  nop\r\n#if LJ_52\r\n    |  lw TAB:TMP2, TAB:CARG1->metatable\r\n    |  bnez TAB:TMP2, >9\r\n    |.  nop\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  load_got lj_tab_len\r\n    |  call_intern lj_tab_len\t\t// (GCtab *t)\r\n    |.  nop\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n    |.  nop\r\n#if LJ_52\r\n    |9:\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_len\r\n    |  bnez TMP0, <3\t\t\t// 'no __len' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_len\r\n    |.  nop\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   addu CARG3, BASE, RB\r\n    |    addu CARG4, KBASE, RC\r\n    |   lw TMP1, HI(CARG3)\r\n    |   ldc1 f20, 0(CARG3)\r\n    |    ldc1 f22, 0(CARG4)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    ||  break;\r\n    ||case 1:\r\n    |   addu CARG4, BASE, RB\r\n    |    addu CARG3, KBASE, RC\r\n    |   lw TMP1, HI(CARG4)\r\n    |   ldc1 f22, 0(CARG4)\r\n    |    ldc1 f20, 0(CARG3)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    ||  break;\r\n    ||default:\r\n    |   addu CARG3, BASE, RB\r\n    |    addu CARG4, BASE, RC\r\n    |   lw TMP1, HI(CARG3)\r\n    |    lw TMP2, HI(CARG4)\r\n    |   ldc1 f20, 0(CARG3)\r\n    |    ldc1 f22, 0(CARG4)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    |   sltiu TMP0, TMP2, LJ_TISNUM\r\n    |   and AT, AT, TMP0\r\n    ||  break;\r\n    ||}\r\n    |  beqz AT, ->vmeta_arith\r\n    |.  addu RA, BASE, RA\r\n    |.endmacro\r\n    |\r\n    |.macro fpmod, a, b, c\r\n    |->BC_MODVN_Z:\r\n    |  bal ->vm_floor\t\t\t// floor(b/c)\r\n    |.  div.d FARG1, b, c\r\n    |  mul.d a, FRET1, c\r\n    |  sub.d a, b, a\t\t\t// b - floor(b/c)*c\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, ins\r\n    |  ins_arithpre\r\n    |.if \"ins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.  nop\r\n    |.else\r\n    |  ins f0, f20, f22\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith add.d\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith sub.d\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith mul.d\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith div.d\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arith fpmod\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arith fpmod_\r\n    break;\r\n  case BC_POW:\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG3, BASE, RB\r\n    |   addu CARG4, BASE, RC\r\n    |  lw TMP1, HI(CARG3)\r\n    |   lw TMP2, HI(CARG4)\r\n    |  ldc1 FARG1, 0(CARG3)\r\n    |   ldc1 FARG2, 0(CARG4)\r\n    |  sltiu AT, TMP1, LJ_TISNUM\r\n    |  sltiu TMP0, TMP2, LJ_TISNUM\r\n    |  and AT, AT, TMP0\r\n    |  load_got pow\r\n    |  beqz AT, ->vmeta_arith\r\n    |.  addu RA, BASE, RA\r\n    |  call_extern\r\n    |.  nop\r\n    |  ins_next1\r\n    |  sdc1 FRET1, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  // RA = dst*8, RB = src_start*8, RC = src_end*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  subu CARG3, RC, RB\r\n    |   sw BASE, L->base\r\n    |  addu CARG2, BASE, RC\r\n    |  move MULTRES, RB\r\n    |->BC_CAT_Z:\r\n    |  load_got lj_meta_cat\r\n    |  srl CARG3, CARG3, 3\r\n    |   sw PC, SAVE_PC\r\n    |  call_intern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |.  move CARG1, L\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  bnez CRET1, ->vmeta_binop\r\n    |.  lw BASE, L->base\r\n    |  addu RB, BASE, MULTRES\r\n    |  ldc1 f0, 0(RB)\r\n    |   addu RA, BASE, RA\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\t\t\t// Copy result from RB to RA.\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n    |  srl TMP1, RD, 1\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  ins_next1\r\n    |  lw TMP0, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    |  addu RA, BASE, RA\r\n    |   li TMP2, LJ_TSTR\r\n    |  sw TMP0, LO(RA)\r\n    |   sw TMP2, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RD = cdata_const*8 (~)\r\n    |  srl TMP1, RD, 1\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  ins_next1\r\n    |  lw TMP0, -4(TMP1)\t\t// KBASE-4-cdata_const*4\r\n    |  addu RA, BASE, RA\r\n    |   li TMP2, LJ_TCDATA\r\n    |  sw TMP0, LO(RA)\r\n    |   sw TMP2, HI(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, RD = int16_literal*8\r\n    |  sra RD, INS, 16\r\n    |  mtc1 RD, f0\r\n    |  addu RA, BASE, RA\r\n    |  cvt.d.w f0, f0\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RD = num_const*8\r\n    |  addu RD, KBASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  ldc1 f0, 0(RD)\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RD = primitive_type*8 (~)\r\n    |  srl TMP1, RD, 3\r\n    |   addu RA, BASE, RA\r\n    |  not TMP0, TMP1\r\n    |  ins_next1\r\n    |   sw TMP0, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RD = end*8\r\n    |  addu RA, BASE, RA\r\n    |  sw TISNIL, HI(RA)\r\n    |   addiu RA, RA, 8\r\n    |  addu RD, BASE, RD\r\n    |1:\r\n    |  sw TISNIL, HI(RA)\r\n    |  slt AT, RA, RD\r\n    |  bnez AT, <1\r\n    |.  addiu RA, RA, 8\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RD = uvnum*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RD, RD, 1\r\n    |   addu RD, RD, LFUNC:RB\r\n    |  lw UPVAL:RB, LFUNC:RD->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  ldc1 f0, 0(TMP1)\r\n    |  addu RA, BASE, RA\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RD = src*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srl RA, RA, 1\r\n    |   addu RD, BASE, RD\r\n    |    addu RA, RA, LFUNC:RB\r\n    |   ldc1 f0, 0(RD)\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  lbu TMP3, UPVAL:RB->marked\r\n    |   lw CARG2, UPVAL:RB->v\r\n    |  andi TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |  lbu TMP0, UPVAL:RB->closed\r\n    |   lw TMP2, HI(RD)\r\n    |   sdc1 f0, 0(CARG2)\r\n    |  li AT, LJ_GC_BLACK|1\r\n    |  or TMP3, TMP3, TMP0\r\n    |  beq TMP3, AT, >2\t\t\t// Upvalue is closed and black?\r\n    |.  addiu TMP2, TMP2, -(LJ_TNUMX+1)\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  sltiu AT, TMP2, LJ_TISGCV - (LJ_TNUMX+1)\r\n    |  beqz AT, <1\t\t\t// tvisgcv(v)\r\n    |.  lw TMP1, LO(RD)\r\n    |  lbu TMP3, GCOBJ:TMP1->gch.marked\r\n    |  andi TMP3, TMP3, LJ_GC_WHITES\t// iswhite(v)\r\n    |  beqz TMP3, <1\r\n    |.  load_got lj_gc_barrieruv\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  call_intern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.  addiu CARG1, DISPATCH, GG_DISP2G\r\n    |  b <1\r\n    |.  nop\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RD = str_const*8 (~)\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srl RA, RA, 1\r\n    |   srl TMP1, RD, 1\r\n    |    addu RA, RA, LFUNC:RB\r\n    |   subu TMP1, KBASE, TMP1\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |   lw STR:TMP1, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    |  lbu TMP2, UPVAL:RB->marked\r\n    |   lw CARG2, UPVAL:RB->v\r\n    |   lbu TMP3, STR:TMP1->marked\r\n    |  andi AT, TMP2, LJ_GC_BLACK\t// isblack(uv)\r\n    |   lbu TMP2, UPVAL:RB->closed\r\n    |   li TMP0, LJ_TSTR\r\n    |   sw STR:TMP1, LO(CARG2)\r\n    |  bnez AT, >2\r\n    |.  sw TMP0, HI(CARG2)\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  beqz TMP2, <1\r\n    |.  andi AT, TMP3, LJ_GC_WHITES\t// iswhite(str)\r\n    |  beqz AT, <1\r\n    |.  load_got lj_gc_barrieruv\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  call_intern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.  addiu CARG1, DISPATCH, GG_DISP2G\r\n    |  b <1\r\n    |.  nop\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RD = num_const*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RA, RA, 1\r\n    |    addu RD, KBASE, RD\r\n    |   addu RA, RA, LFUNC:RB\r\n    |    ldc1 f0, 0(RD)\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  sdc1 f0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RD = primitive_type*8 (~)\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RA, RA, 1\r\n    |    srl TMP0, RD, 3\r\n    |   addu RA, RA, LFUNC:RB\r\n    |    not TMP0, TMP0\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  sw TMP0, HI(TMP1)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RD = target\r\n    |  lw TMP2, L->openupval\r\n    |  branch_RD\t\t\t// Do this first since RD is not saved.\r\n    |  load_got lj_func_closeuv\r\n    |   sw BASE, L->base\r\n    |  beqz TMP2, >1\r\n    |.  move CARG1, L\r\n    |  call_intern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |.  addu CARG2, BASE, RA\r\n    |  lw BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RD = proto_const*8 (~) (holding function prototype)\r\n    |  srl TMP1, RD, 1\r\n    |  load_got lj_func_newL_gc\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  lw CARG3, FRAME_FUNC(BASE)\r\n    |  lw CARG2, -4(TMP1)\t\t// KBASE-4-tab_const*4\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  call_intern lj_func_newL_gc\r\n    |.  move CARG1, L\r\n    |  // Returns GCfuncL *.\r\n    |  lw BASE, L->base\r\n    |   li TMP0, LJ_TFUNC\r\n    |  ins_next1\r\n    |  addu RA, BASE, RA\r\n    |  sw TMP0, HI(RA)\r\n    |  sw LFUNC:CRET1, LO(RA)\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RD = (hbits|asize)*8 | tab_const*8 (~)\r\n    |  lw TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n    |  lw TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  load_got lj_tab_new\r\n      |  srl CARG2, RD, 3\r\n      |  andi CARG2, CARG2, 0x7ff\r\n      |  li TMP0, 0x801\r\n      |  addiu AT, CARG2, -0x7ff\r\n      |   srl CARG3, RD, 14\r\n      |  movz CARG2, TMP0, AT\r\n      |  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  call_intern lj_tab_new\r\n      |.  move CARG1, L\r\n      |  // Returns Table *.\r\n    } else {\r\n      |  load_got lj_tab_dup\r\n      |  srl TMP1, RD, 1\r\n      |  subu TMP1, KBASE, TMP1\r\n      |  move CARG1, L\r\n      |  call_intern lj_tab_dup\t\t// (lua_State *L, Table *kt)\r\n      |.  lw CARG2, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n      |  // Returns Table *.\r\n    }\r\n    |  lw BASE, L->base\r\n    |  ins_next1\r\n    |  addu RA, BASE, RA\r\n    |   li TMP0, LJ_TTAB\r\n    |  sw TAB:CRET1, LO(RA)\r\n    |   sw TMP0, HI(RA)\r\n    |  ins_next2\r\n    |5:\r\n    |  load_got lj_gc_step_fixtop\r\n    |  move MULTRES, RD\r\n    |  call_intern lj_gc_step_fixtop\t// (lua_State *L)\r\n    |.  move CARG1, L\r\n    |  b <1\r\n    |.  move RD, MULTRES\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n  case BC_GSET:\r\n    |  // RA = src*8, RD = str_const*8 (~)\r\n    |  lw LFUNC:TMP2, FRAME_FUNC(BASE)\r\n    |   srl TMP1, RD, 1\r\n    |   subu TMP1, KBASE, TMP1\r\n    |  lw TAB:RB, LFUNC:TMP2->env\r\n    |  lw STR:RC, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    |.  addu RA, BASE, RA\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG2, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |  lw TMP1, HI(CARG2)\r\n    |   lw TMP2, HI(CARG3)\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  bne TMP1, AT, ->vmeta_tgetv\r\n    |.  addu RA, BASE, RA\r\n    |  sltiu AT, TMP2, LJ_TISNUM\r\n    |  beqz AT, >5\r\n    |.  li AT, LJ_TSTR\r\n    |\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  cvt.w.d f2, f0\r\n    |   lw TMP0, TAB:RB->asize\r\n    |  mfc1 TMP2, f2\r\n    |  cvt.d.w f4, f2\r\n    |   lw TMP1, TAB:RB->array\r\n    |  c.eq.d f0, f4\r\n    |  sltu AT, TMP2, TMP0\r\n    |  movf AT, r0\r\n    |   sll TMP2, TMP2, 3\r\n    |  beqz AT, ->vmeta_tgetv\t\t// Integer key and in array part?\r\n    |.  addu TMP2, TMP1, TMP2\r\n    |  lw TMP0, HI(TMP2)\r\n    |  beq TMP0, TISNIL, >2\r\n    |.  ldc1 f0, 0(TMP2)\r\n    |1:\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_index\r\n    |  bnez TMP0, <1\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgetv\r\n    |.  nop\r\n    |\r\n    |5:\r\n    |  bne TMP2, AT, ->vmeta_tgetv\r\n    |.  lw STR:RC, LO(CARG3)\r\n    |  b ->BC_TGETS_Z\t\t\t// String key?\r\n    |.  nop\r\n    break;\r\n  case BC_TGETS:\r\n    |  // RA = dst*8, RB = table*8, RC = str_const*4 (~)\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RC4a RC, INS\r\n    |  lw TMP0, HI(CARG2)\r\n    |   decode_RC4b RC\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   subu CARG3, KBASE, RC\r\n    |   lw STR:RC, -4(CARG3)\t\t// KBASE-4-str_const*4\r\n    |  bne TMP0, AT, ->vmeta_tgets1\r\n    |.  addu RA, BASE, RA\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  lw TMP0, TAB:RB->hmask\r\n    |  lw TMP1, STR:RC->hash\r\n    |  lw NODE:TMP2, TAB:RB->node\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  sll TMP0, TMP1, 5\r\n    |  sll TMP1, TMP1, 3\r\n    |  subu TMP1, TMP0, TMP1\r\n    |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lw CARG1, offsetof(Node, key)+HI(NODE:TMP2)\r\n    |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n    |    lw NODE:TMP1, NODE:TMP2->next\r\n    |    lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n    |  addiu CARG1, CARG1, -LJ_TSTR\r\n    |   xor TMP0, TMP0, STR:RC\r\n    |  or AT, CARG1, TMP0\r\n    |  bnez AT, >4\r\n    |.  lw TAB:TMP3, TAB:RB->metatable\r\n    |    beq CARG2, TISNIL, >5\t\t// Key found, but nil value?\r\n    |.    lw CARG1, offsetof(Node, val)+LO(NODE:TMP2)\r\n    |3:\r\n    |  ins_next1\r\n    |    sw CARG2, HI(RA)\r\n    |     sw CARG1, LO(RA)\r\n    |  ins_next2\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  bnez NODE:TMP1, <1\r\n    |.  move NODE:TMP2, NODE:TMP1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  beqz TAB:TMP3, <3\t\t// No metatable: done.\r\n    |.  li CARG2, LJ_TNIL\r\n    |  lbu TMP0, TAB:TMP3->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_index\r\n    |  bnez TMP0, <3\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgets\r\n    |.  nop\r\n    break;\r\n  case BC_TGETB:\r\n    |  // RA = dst*8, RB = table*8, RC = index*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  lw CARG1, HI(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   addu RA, BASE, RA\r\n    |  bne CARG1, AT, ->vmeta_tgetb\r\n    |.  srl TMP0, RC, 3\r\n    |  lw TMP1, TAB:RB->asize\r\n    |   lw TMP2, TAB:RB->array\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, ->vmeta_tgetb\r\n    |.  addu RC, TMP2, RC\r\n    |  lw TMP1, HI(RC)\r\n    |  beq TMP1, TISNIL, >5\r\n    |.  ldc1 f0, 0(RC)\r\n    |1:\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP2->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_index\r\n    |  bnez TMP1, <1\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgetb\t\t\t// Caveat: preserve TMP0!\r\n    |.  nop\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG2, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |  lw TMP1, HI(CARG2)\r\n    |   lw TMP2, HI(CARG3)\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  bne TMP1, AT, ->vmeta_tsetv\r\n    |.  addu RA, BASE, RA\r\n    |  sltiu AT, TMP2, LJ_TISNUM\r\n    |  beqz AT, >5\r\n    |.  li AT, LJ_TSTR\r\n    |\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  cvt.w.d f2, f0\r\n    |   lw TMP0, TAB:RB->asize\r\n    |  mfc1 TMP2, f2\r\n    |  cvt.d.w f4, f2\r\n    |   lw TMP1, TAB:RB->array\r\n    |  c.eq.d f0, f4\r\n    |  sltu AT, TMP2, TMP0\r\n    |  movf AT, r0\r\n    |   sll TMP2, TMP2, 3\r\n    |  beqz AT, ->vmeta_tsetv\t\t// Integer key and in array part?\r\n    |.  addu TMP1, TMP1, TMP2\r\n    |   lbu TMP3, TAB:RB->marked\r\n    |  lw TMP0, HI(TMP1)\r\n    |  beq TMP0, TISNIL, >3\r\n    |.  ldc1 f0, 0(RA)\r\n    |1:\r\n    |   andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   bnez AT, >7\r\n    |.  sdc1 f0, 0(TMP1)\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP2, TAB:TMP2->nomm\r\n    |  andi TMP2, TMP2, 1<<MM_newindex\r\n    |  bnez TMP2, <1\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsetv\r\n    |.  nop\r\n    |\r\n    |5:\r\n    |  bne TMP2, AT, ->vmeta_tsetv\r\n    |.  lw STR:RC, LO(CARG3)\r\n    |  b ->BC_TSETS_Z\t\t\t// String key?\r\n    |.  nop\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  // RA = src*8, RB = table*8, RC = str_const*8 (~)\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RC4a RC, INS\r\n    |  lw TMP0, HI(CARG2)\r\n    |   decode_RC4b RC\r\n    |  li AT, LJ_TTAB\r\n    |   subu CARG3, KBASE, RC\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |   lw STR:RC, -4(CARG3)\t\t// KBASE-4-str_const*4\r\n    |  bne TMP0, AT, ->vmeta_tsets1\r\n    |.  addu RA, BASE, RA\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = BASE+src*8\r\n    |  lw TMP0, TAB:RB->hmask\r\n    |  lw TMP1, STR:RC->hash\r\n    |  lw NODE:TMP2, TAB:RB->node\r\n    |   sb r0, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  sll TMP0, TMP1, 5\r\n    |  sll TMP1, TMP1, 3\r\n    |  subu TMP1, TMP0, TMP1\r\n    |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |   ldc1 f20, 0(RA)\r\n    |1:\r\n    |  lw CARG1, offsetof(Node, key)+HI(NODE:TMP2)\r\n    |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n    |  li AT, LJ_TSTR\r\n    |    lw NODE:TMP1, NODE:TMP2->next\r\n    |  bne CARG1, AT, >5\r\n    |.   lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n    |   bne TMP0, STR:RC, >5\r\n    |.    lbu TMP3, TAB:RB->marked\r\n    |    beq CARG2, TISNIL, >4\t\t// Key found, but nil value?\r\n    |.    lw TAB:TMP0, TAB:RB->metatable\r\n    |2:\r\n    |  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bnez AT, >7\r\n    |.  sdc1 f20, NODE:TMP2->val\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  beqz TAB:TMP0, <2\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP0, TAB:TMP0->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_newindex\r\n    |  bnez TMP0, <2\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsets\r\n    |.  nop\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  bnez NODE:TMP1, <1\r\n    |.  move NODE:TMP2, NODE:TMP1\r\n    |  // End of hash chain: key not found, add a new one\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, >6\t\t// No metatable: continue.\r\n    |.  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_newindex\r\n    |  beqz TMP0, ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |.  li AT, LJ_TSTR\r\n    |6:\r\n    |  load_got lj_tab_newkey\r\n    |  sw STR:RC, LO(CARG3)\r\n    |  sw AT, HI(CARG3)\r\n    |   sw BASE, L->base\r\n    |  move CARG2, TAB:RB\r\n    |   sw PC, SAVE_PC\r\n    |  call_intern lj_tab_newkey\t// (lua_State *L, GCtab *t, TValue *k\r\n    |.  move CARG1, L\r\n    |  // Returns TValue *.\r\n    |  lw BASE, L->base\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |.  sdc1 f20, 0(CRET1)\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  // RA = src*8, RB = table*8, RC = index*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  lw CARG1, HI(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   addu RA, BASE, RA\r\n    |  bne CARG1, AT, ->vmeta_tsetb\r\n    |.  srl TMP0, RC, 3\r\n    |  lw TMP1, TAB:RB->asize\r\n    |   lw TMP2, TAB:RB->array\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, ->vmeta_tsetb\r\n    |.  addu RC, TMP2, RC\r\n    |  lw TMP1, HI(RC)\r\n    |   lbu TMP3, TAB:RB->marked\r\n    |  beq TMP1, TISNIL, >5\r\n    |.  ldc1 f0, 0(RA)\r\n    |1:\r\n    |  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bnez AT, >7\r\n    |.  sdc1 f0, 0(RC)\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP2->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_newindex\r\n    |  bnez TMP1, <1\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsetb\t\t\t// Caveat: preserve TMP0!\r\n    |.  nop\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RD = num_const*8 (start index)\r\n    |  addu RA, BASE, RA\r\n    |1:\r\n    |   addu TMP3, KBASE, RD\r\n    |  lw TAB:CARG2, -8+LO(RA)\t\t// Guaranteed to be a table.\r\n    |    addiu TMP0, MULTRES, -8\r\n    |   lw TMP3, LO(TMP3)\t\t// Integer constant is in lo-word.\r\n    |    beqz TMP0, >4\t\t\t// Nothing to copy?\r\n    |.    srl CARG3, TMP0, 3\r\n    |  addu CARG3, CARG3, TMP3\r\n    |  lw TMP2, TAB:CARG2->asize\r\n    |   sll TMP1, TMP3, 3\r\n    |    lbu TMP3, TAB:CARG2->marked\r\n    |   lw CARG1, TAB:CARG2->array\r\n    |  sltu AT, TMP2, CARG3\r\n    |  bnez AT, >5\r\n    |.  addu TMP2, RA, TMP0\r\n    |   addu TMP1, TMP1, CARG1\r\n    |  andi TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |3:  // Copy result slots to table.\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  sltu AT, RA, TMP2\r\n    |   sdc1 f0, 0(TMP1)\r\n    |  bnez AT, <3\r\n    |.   addiu TMP1, TMP1, 8\r\n    |  bnez TMP0, >7\r\n    |. nop\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |  load_got lj_tab_reasize\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  move BASE, RD\r\n    |  call_intern lj_tab_reasize\t// (lua_State *L, GCtab *t, int nasize)\r\n    |.  move CARG1, L\r\n    |  // Must not reallocate the stack.\r\n    |  move RD, BASE\r\n    |  b <1\r\n    |.  lw BASE, L->base\t// Reload BASE for lack of a saved register.\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP0, <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = extra_nargs*8\r\n    |  decode_RDtoRC8 NARGS8:RC, RD\r\n    |  b ->BC_CALL_Z\r\n    |.  addu NARGS8:RC, NARGS8:RC, MULTRES\r\n    break;\r\n  case BC_CALL:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = (nargs+1)*8\r\n    |  decode_RDtoRC8 NARGS8:RC, RD\r\n    |->BC_CALL_Z:\r\n    |  move TMP2, BASE\r\n    |  addu BASE, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP0, HI(BASE)\r\n    |   lw LFUNC:RB, LO(BASE)\r\n    |   addiu BASE, BASE, 8\r\n    |  bne TMP0, AT, ->vmeta_call\r\n    |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs*8\r\n    |  addu NARGS8:RD, NARGS8:RD, MULTRES\t// BC_CALLT gets RC from RD.\r\n    |  // Fall through. Assumes BC_CALLT follows.\r\n    break;\r\n  case BC_CALLT:\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |  addu RA, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP0, HI(RA)\r\n    |   lw LFUNC:RB, LO(RA)\r\n    |   move NARGS8:RC, RD\r\n    |    lw TMP1, FRAME_PC(BASE)\r\n    |   addiu RA, RA, 8\r\n    |  bne TMP0, AT, ->vmeta_callt\r\n    |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n    |->BC_CALLT_Z:\r\n    |  andi TMP0, TMP1, FRAME_TYPE\t// Caveat: preserve TMP0 until the 'or'.\r\n    |   lbu TMP3, LFUNC:RB->ffid\r\n    |  bnez TMP0, >7\r\n    |.  xori TMP2, TMP1, FRAME_VARG\r\n    |1:\r\n    |  sw LFUNC:RB, FRAME_FUNC(BASE)\t// Copy function down, but keep PC.\r\n    |  sltiu AT, TMP3, 2\t\t// (> FF_C) Calling a fast function?\r\n    |  move TMP2, BASE\r\n    |  beqz NARGS8:RC, >3\r\n    |.  move TMP3, NARGS8:RC\r\n    |2:\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  addiu TMP3, TMP3, -8\r\n    |   sdc1 f0, 0(TMP2)\r\n    |  bnez TMP3, <2\r\n    |.   addiu TMP2, TMP2, 8\r\n    |3:\r\n    |  or TMP0, TMP0, AT\r\n    |  beqz TMP0, >5\r\n    |.  nop\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  lw INS, -4(TMP1)\r\n    |  decode_RA8a RA, INS\r\n    |  decode_RA8b RA\r\n    |  subu TMP1, BASE, RA\r\n    |  lw LFUNC:TMP1, -8+FRAME_FUNC(TMP1)\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  b <4\r\n    |.  lw KBASE, PC2PROTO(k)(TMP1)\t// Need to prepare KBASE.\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  andi AT, TMP2, FRAME_TYPEP\r\n    |  bnez AT, <1\t\t\t// Vararg frame below?\r\n    |.  subu TMP2, BASE, TMP2\t\t// Relocate BASE down.\r\n    |  move BASE, TMP2\r\n    |  lw TMP1, FRAME_PC(TMP2)\r\n    |  b <1\r\n    |.  andi TMP0, TMP1, FRAME_TYPE\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 ((2+1)*8))\r\n    |  move TMP2, BASE\r\n    |  addu BASE, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP1, -24+HI(BASE)\r\n    |   lw LFUNC:RB, -24+LO(BASE)\r\n    |    ldc1 f2, -8(BASE)\r\n    |    ldc1 f0, -16(BASE)\r\n    |  sw TMP1, HI(BASE)\t\t// Copy callable.\r\n    |   sw LFUNC:RB, LO(BASE)\r\n    |    sdc1 f2, 16(BASE)\t\t// Copy control var.\r\n    |    sdc1 f0, 8(BASE)\t\t// Copy state.\r\n    |   addiu BASE, BASE, 8\r\n    |  bne TMP1, AT, ->vmeta_call\r\n    |.  li NARGS8:RC, 16\t\t// Iterators get 2 arguments.\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 (2+1)*8)\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  addu RA, BASE, RA\r\n    |  lw TAB:RB, -16+LO(RA)\r\n    |  lw RC, -8+LO(RA)\t\t\t// Get index from control var.\r\n    |  lw TMP0, TAB:RB->asize\r\n    |  lw TMP1, TAB:RB->array\r\n    |   addiu PC, PC, 4\r\n    |1:  // Traverse array part.\r\n    |  sltu AT, RC, TMP0\r\n    |  beqz AT, >5\t\t\t// Index points after array part?\r\n    |.  sll TMP3, RC, 3\r\n    |  addu TMP3, TMP1, TMP3\r\n    |  lw TMP2, HI(TMP3)\r\n    |   ldc1 f0, 0(TMP3)\r\n    |    mtc1 RC, f2\r\n    |     lhu RD, -4+OFS_RD(PC)\r\n    |  beq TMP2, TISNIL, <1\t\t// Skip holes in array part.\r\n    |.  addiu RC, RC, 1\r\n    |    cvt.d.w f2, f2\r\n    |     lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |   sdc1 f0, 8(RA)\r\n    |     decode_RD4b RD\r\n    |     addu RD, RD, TMP3\r\n    |   sw RC, -8+LO(RA)\t\t// Update control var.\r\n    |     addu PC, PC, RD\r\n    |    sdc1 f2, 0(RA)\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  lw TMP1, TAB:RB->hmask\r\n    |  subu RC, RC, TMP0\r\n    |   lw TMP2, TAB:RB->node\r\n    |6:\r\n    |  sltu AT, TMP1, RC\t\t// End of iteration? Branch to ITERL+1.\r\n    |  bnez AT, <3\r\n    |.  sll TMP3, RC, 5\r\n    |   sll RB, RC, 3\r\n    |   subu TMP3, TMP3, RB\r\n    |  addu NODE:TMP3, TMP3, TMP2\r\n    |  lw RB, HI(NODE:TMP3)\r\n    |  ldc1 f0, 0(NODE:TMP3)\r\n    |     lhu RD, -4+OFS_RD(PC)\r\n    |  beq RB, TISNIL, <6\t\t// Skip holes in hash part.\r\n    |.  addiu RC, RC, 1\r\n    |   ldc1 f2, NODE:TMP3->key\r\n    |     lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sdc1 f0, 8(RA)\r\n    |    addu RC, RC, TMP0\r\n    |     decode_RD4b RD\r\n    |     addu RD, RD, TMP3\r\n    |   sdc1 f2, 0(RA)\r\n    |     addu PC, PC, RD\r\n    |  b <3\r\n    |.  sw RC, -8+LO(RA)\t\t// Update control var.\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RD = target (points to ITERN)\r\n    |  addu RA, BASE, RA\r\n    |  lw TMP0, -24+HI(RA)\r\n    |  lw CFUNC:TMP1, -24+LO(RA)\r\n    |   lw TMP2, -16+HI(RA)\r\n    |    lw TMP3, -8+HI(RA)\r\n    |  li AT, LJ_TFUNC\r\n    |  bne TMP0, AT, >5\r\n    |.  addiu TMP2, TMP2, -LJ_TTAB\r\n    |  lbu TMP1, CFUNC:TMP1->ffid\r\n    |  addiu TMP3, TMP3, -LJ_TNIL\r\n    |   srl TMP0, RD, 1\r\n    |  or TMP2, TMP2, TMP3\r\n    |  addiu TMP1, TMP1, -FF_next_N\r\n    |   addu TMP0, PC, TMP0\r\n    |  or TMP1, TMP1, TMP2\r\n    |  bnez TMP1, >5\r\n    |.  lui TMP2, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  addu PC, TMP0, TMP2\r\n    |  lui TMP1, 0xfffe\r\n    |  ori TMP1, TMP1, 0x7fff\r\n    |  sw r0, -8+LO(RA)\t\t\t// Initialize control var.\r\n    |  sw TMP1, -8+HI(RA)\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  li TMP3, BC_JMP\r\n    |   li TMP1, BC_ITERC\r\n    |  sb TMP3, -4+OFS_OP(PC)\r\n    |   addu PC, TMP0, TMP2\r\n    |  b <1\r\n    |.  sb TMP1, OFS_OP(PC)\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  lw TMP0, FRAME_PC(BASE)\r\n    |  decode_RDtoRC8 RC, RD\r\n    |   decode_RB8a RB, INS\r\n    |  addu RC, BASE, RC\r\n    |   decode_RB8b RB\r\n    |   addu RA, BASE, RA\r\n    |  addiu RC, RC, FRAME_VARG\r\n    |   addu TMP2, RA, RB\r\n    |  addiu TMP3, BASE, -8\t\t// TMP3 = vtop\r\n    |  subu RC, RC, TMP0\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  beqz RB, >5\t\t\t// Copy all varargs?\r\n    |.  subu TMP1, TMP3, RC\r\n    |  addiu TMP2, TMP2, -16\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  lw CARG1, HI(RC)\r\n    |  sltu AT, RC, TMP3\r\n    |   lw CARG2, LO(RC)\r\n    |    addiu RC, RC, 8\r\n    |  movz CARG1, TISNIL, AT\r\n    |  sw CARG1, HI(RA)\r\n    |   sw CARG2, LO(RA)\r\n    |  sltu AT, RA, TMP2\r\n    |  bnez AT, <1\r\n    |.   addiu RA, RA, 8\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  lw TMP0, L->maxstack\r\n    |  blez TMP1, <3\t\t\t// No vararg slots?\r\n    |.  li MULTRES, 8\t\t\t// MULTRES = (0+1)*8\r\n    |  addu TMP2, RA, TMP1\r\n    |  sltu AT, TMP0, TMP2\r\n    |  bnez AT, >7\r\n    |.  addiu MULTRES, TMP1, 8\r\n    |6:\r\n    |  ldc1 f0, 0(RC)\r\n    |   addiu RC, RC, 8\r\n    |  sdc1 f0, 0(RA)\r\n    |  sltu AT, RC, TMP3\r\n    |  bnez AT, <6\t\t\t// More vararg slots?\r\n    |.  addiu RA, RA, 8\r\n    |  b <3\r\n    |.  nop\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  load_got lj_state_growstack\r\n    |   sw RA, L->top\r\n    |  subu RA, RA, BASE\r\n    |   sw BASE, L->base\r\n    |  subu BASE, RC, BASE\t\t// Need delta, because BASE may change.\r\n    |   sw PC, SAVE_PC\r\n    |  srl CARG2, TMP1, 3\r\n    |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n    |.  move CARG1, L\r\n    |  move RC, BASE\r\n    |  lw BASE, L->base\r\n    |  addu RA, BASE, RA\r\n    |  addu RC, BASE, RC\r\n    |  b <6\r\n    |.  addiu TMP3, BASE, -8\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RD = extra_nresults*8\r\n    |  addu RD, RD, MULTRES\t\t// MULTRES >= 8, so RD >= 8.\r\n    |  // Fall through. Assumes BC_RET follows.\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lw PC, FRAME_PC(BASE)\r\n    |   addu RA, BASE, RA\r\n    |    move MULTRES, RD\r\n    |1:\r\n    |  andi TMP0, PC, FRAME_TYPE\r\n    |  bnez TMP0, ->BC_RETV_Z\r\n    |.  xori TMP1, PC, FRAME_VARG\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RD = (nresults+1)*8, PC = return\r\n    |   lw INS, -4(PC)\r\n    |    addiu TMP2, BASE, -8\r\n    |    addiu RC, RD, -8\r\n    |  decode_RA8a TMP0, INS\r\n    |   decode_RB8a RB, INS\r\n    |  decode_RA8b TMP0\r\n    |   decode_RB8b RB\r\n    |   addu TMP3, TMP2, RB\r\n    |  beqz RC, >3\r\n    |.  subu BASE, TMP2, TMP0\r\n    |2:\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  addiu RC, RC, -8\r\n    |   sdc1 f0, 0(TMP2)\r\n    |  bnez RC, <2\r\n    |.   addiu TMP2, TMP2, 8\r\n    |3:\r\n    |  addiu TMP3, TMP3, -8\r\n    |5:\r\n    |  sltu AT, TMP2, TMP3\r\n    |  bnez AT, >6\r\n    |.  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  lw KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  sw TISNIL, HI(TMP2)\r\n    |  b <5\r\n    |.  addiu TMP2, TMP2, 8\r\n    |\r\n    |->BC_RETV_Z:  // Non-standard return case.\r\n    |  andi TMP2, TMP1, FRAME_TYPEP\r\n    |  bnez TMP2, ->vm_return\r\n    |.  nop\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  subu BASE, BASE, TMP1\r\n    |  b <1\r\n    |.  lw PC, FRAME_PC(BASE)\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lw PC, FRAME_PC(BASE)\r\n    |   addu RA, BASE, RA\r\n    |    move MULTRES, RD\r\n    |  andi TMP0, PC, FRAME_TYPE\r\n    |  bnez TMP0, ->BC_RETV_Z\r\n    |.  xori TMP1, PC, FRAME_VARG\r\n    |\r\n    |  lw INS, -4(PC)\r\n    |   addiu TMP2, BASE, -8\r\n    if (op == BC_RET1) {\r\n      |  ldc1 f0, 0(RA)\r\n    }\r\n    |  decode_RB8a RB, INS\r\n    |   decode_RA8a RA, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RA8b RA\r\n    if (op == BC_RET1) {\r\n      |  sdc1 f0, 0(TMP2)\r\n    }\r\n    |   subu BASE, TMP2, RA\r\n    |5:\r\n    |  sltu AT, RD, RB\r\n    |  bnez AT, >6\r\n    |.  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  lw KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  addiu TMP2, TMP2, 8\r\n    |  addiu RD, RD, 8\r\n    |  b <5\r\n    if (op == BC_RET1) {\r\n      |.  sw TISNIL, HI(TMP2)\r\n    } else {\r\n      |.  sw TISNIL, -8+HI(TMP2)\r\n    }\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RD = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  addu RA, BASE, RA\r\n    if (vk) {\r\n      |  ldc1 f0, FORL_IDX*8(RA)\r\n      |  ldc1 f4, FORL_STEP*8(RA)\r\n      |  ldc1 f2, FORL_STOP*8(RA)\r\n      |   lw TMP3, FORL_STEP*8+HI(RA)\r\n      |  add.d f0, f0, f4\r\n      |  sdc1 f0, FORL_IDX*8(RA)\r\n    } else {\r\n      |  lw TMP1, FORL_IDX*8+HI(RA)\r\n      |  lw TMP3, FORL_STEP*8+HI(RA)\r\n      |  lw TMP2, FORL_STOP*8+HI(RA)\r\n      |  sltiu TMP1, TMP1, LJ_TISNUM\r\n      |  sltiu TMP0, TMP3, LJ_TISNUM\r\n      |  sltiu TMP2, TMP2, LJ_TISNUM\r\n      |  and TMP1, TMP1, TMP0\r\n      |  and TMP1, TMP1, TMP2\r\n      |   ldc1 f0, FORL_IDX*8(RA)\r\n      |  beqz TMP1, ->vmeta_for\r\n      |.  ldc1 f2, FORL_STOP*8(RA)\r\n    }\r\n    if (op != BC_JFORL) {\r\n      |  srl RD, RD, 1\r\n      |  lui TMP0, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    }\r\n    |  c.le.d 0, f0, f2\r\n    |  c.le.d 1, f2, f0\r\n    |  sdc1 f0, FORL_EXT*8(RA)\r\n    if (op == BC_JFORI) {\r\n      |  li TMP1, 1\r\n      |  li TMP2, 1\r\n      |   addu TMP0, RD, TMP0\r\n      |  slt TMP3, TMP3, r0\r\n      |  movf TMP1, r0, 0\r\n      |   addu PC, PC, TMP0\r\n      |  movf TMP2, r0, 1\r\n      |   lhu RD, -4+OFS_RD(PC)\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  bnez TMP1, =>BC_JLOOP\r\n      |.  decode_RD8b RD\r\n    } else if (op == BC_JFORL) {\r\n      |  li TMP1, 1\r\n      |  li TMP2, 1\r\n      |  slt TMP3, TMP3, r0\r\n      |  movf TMP1, r0, 0\r\n      |  movf TMP2, r0, 1\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  bnez TMP1, =>BC_JLOOP\r\n      |.  nop\r\n    } else {\r\n      |  addu TMP1, RD, TMP0\r\n      |  slt TMP3, TMP3, r0\r\n      |  move TMP2, TMP1\r\n      if (op == BC_FORI) {\r\n\t|  movt TMP1, r0, 0\r\n\t|  movt TMP2, r0, 1\r\n      } else {\r\n\t|  movf TMP1, r0, 0\r\n\t|  movf TMP2, r0, 1\r\n      }\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  addu PC, PC, TMP1\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RD = target\r\n    |  addu RA, BASE, RA\r\n    |  lw TMP1, HI(RA)\r\n    |  beq TMP1, TISNIL, >1\t\t// Stop if iterator returned nil.\r\n    |.  lw TMP2, LO(RA)\r\n    if (op == BC_JITERL) {\r\n      |  sw TMP1, -8+HI(RA)\r\n      |  b =>BC_JLOOP\r\n      |.  sw TMP2, -8+LO(RA)\r\n    } else {\r\n      |  branch_RD\t\t\t// Otherwise save control var + branch.\r\n      |  sw TMP1, -8+HI(RA)\r\n      |   sw TMP2, -8+LO(RA)\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base*8 (ignored), RD = traceno*8\r\n    |  lw TMP1, DISPATCH_J(trace)(DISPATCH)\r\n    |  srl RD, RD, 1\r\n    |   li AT, 0\r\n    |  addu TMP1, TMP1, RD\r\n    |  // Traces on MIPS don't store the trace number, so use 0.\r\n    |   sw AT, DISPATCH_GL(vmstate)(DISPATCH)\r\n    |  lw TRACE:TMP2, 0(TMP1)\r\n    |   sw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n    |   sw L, DISPATCH_GL(jit_L)(DISPATCH)\r\n    |  lw TMP2, TRACE:TMP2->mcode\r\n    |  jr TMP2\r\n    |.  addiu JGL, DISPATCH, GG_DISP2G+32768\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RD = target\r\n    |  branch_RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lw TMP2, L->maxstack\r\n    |   lbu TMP1, -4+PC2PROTO(numparams)(PC)\r\n    |    lw KBASE, -4+PC2PROTO(k)(PC)\r\n    |  sltu AT, TMP2, RA\r\n    |  bnez AT, ->vm_growstack_l\r\n    |.  sll TMP1, TMP1, 3\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n    }\r\n    |2:\r\n    |  sltu AT, NARGS8:RC, TMP1\t\t// Check for missing parameters.\r\n    |  bnez AT, >3\r\n    |.  addu AT, BASE, NARGS8:RC\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD8a RD, INS\r\n      |  b =>BC_JLOOP\r\n      |.  decode_RD8b RD\r\n    } else {\r\n      |  ins_next2\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  sw TISNIL, HI(AT)\r\n    |  b <2\r\n    |.  addiu NARGS8:RC, NARGS8:RC, 8\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |   addu TMP1, BASE, RC\r\n    |  lw TMP2, L->maxstack\r\n    |  addu TMP0, RA, RC\r\n    |   sw LFUNC:RB, LO(TMP1)\t\t// Store copy of LFUNC.\r\n    |   addiu TMP3, RC, 8+FRAME_VARG\r\n    |  sltu AT, TMP0, TMP2\r\n    |    lw KBASE, -4+PC2PROTO(k)(PC)\r\n    |  beqz AT, ->vm_growstack_l\r\n    |.  sw TMP3, HI(TMP1)\t\t// Store delta + FRAME_VARG.\r\n    |  lbu TMP2, -4+PC2PROTO(numparams)(PC)\r\n    |   move RA, BASE\r\n    |   move RC, TMP1\r\n    |  ins_next1\r\n    |  beqz TMP2, >3\r\n    |.  addiu BASE, TMP1, 8\r\n    |1:\r\n    |  lw TMP0, HI(RA)\r\n    |   lw TMP3, LO(RA)\r\n    |  sltu AT, RA, RC\t\t\t// Less args than parameters?\r\n    |  move CARG1, TMP0\r\n    |  movz TMP0, TISNIL, AT\t\t// Clear missing parameters.\r\n    |  movn CARG1, TISNIL, AT\t\t// Clear old fixarg slot (help the GC).\r\n    |   sw TMP3, 8+LO(TMP1)\r\n    |    addiu TMP2, TMP2, -1\r\n    |  sw TMP0, 8+HI(TMP1)\r\n    |    addiu TMP1, TMP1, 8\r\n    |  sw CARG1, HI(RA)\r\n    |  bnez TMP2, <1\r\n    |.   addiu RA, RA, 8\r\n    |3:\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  lw CFUNCADDR, CFUNC:RB->f\r\n    } else {\r\n      |  lw CFUNCADDR, DISPATCH_GL(wrapf)(DISPATCH)\r\n    }\r\n    |  addu TMP1, RA, NARGS8:RC\r\n    |  lw TMP2, L->maxstack\r\n    |   addu RC, BASE, NARGS8:RC\r\n    |  sw BASE, L->base\r\n    |  sltu AT, TMP2, TMP1\r\n    |   sw RC, L->top\r\n    |    li_vmstate C\r\n    if (op == BC_FUNCCW) {\r\n      |  lw CARG2, CFUNC:RB->f\r\n    }\r\n    |  bnez AT, ->vm_growstack_c\t// Need to grow stack.\r\n    |.  move CARG1, L\r\n    |  jalr CFUNCADDR\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |.   st_vmstate\r\n    |  // Returns nresults.\r\n    |  lw BASE, L->base\r\n    |   sll RD, CRET1, 3\r\n    |  lw TMP1, L->top\r\n    |    li_vmstate INTERP\r\n    |  lw PC, FRAME_PC(BASE)\t\t// Fetch PC of caller.\r\n    |   subu RA, TMP1, RD\t\t// RA = L->top - nresults*8\r\n    |  b ->vm_returnc\r\n    |.   st_vmstate\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.4byte .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.4byte 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.4byte .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.4byte .Lframe0\\n\"\r\n\t\"\\t.4byte .Lbegin\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.sleb128 1\\n\"\r\n\t\"\\t.byte 0x9e\\n\\t.sleb128 2\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 23; i >= 16; i--)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 26-i);\r\n    for (i = 30; i >= 20; i -= 2)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+32+i, 42-i);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.4byte .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.4byte .Lframe0\\n\"\r\n\t\"\\t.4byte lj_vm_ffi_call\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.uleb128 1\\n\"\r\n\t\"\\t.byte 0x90\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x10\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"aw\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\"\\t.globl lj_err_unwind_dwarf\\n\"\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.4byte .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.4byte 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.4byte lj_err_unwind_dwarf\\n\"\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.4byte .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.4byte .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.4byte .Lbegin\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.sleb128 1\\n\"\r\n\t\"\\t.byte 0x9e\\n\\t.sleb128 2\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 23; i >= 16; i--)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 26-i);\r\n    for (i = 30; i >= 20; i -= 2)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+32+i, 42-i);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE2:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.4byte .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.4byte 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.4byte .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.4byte .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.4byte lj_vm_ffi_call\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x9f\\n\\t.uleb128 1\\n\"\r\n\t\"\\t.byte 0x90\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x10\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/vm_ppc.dasc",
    "content": "|// Low-level VM code for PowerPC CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch ppc\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// DynASM defines used by the PPC port:\r\n|//\r\n|// P64     64 bit pointers (only for GPR64 testing).\r\n|//         Note: a full PPC64 _LP64 port is not planned.\r\n|// GPR64   64 bit registers (but possibly 32 bit pointers, e.g. PS3).\r\n|//         Affects reg saves, stack layout, carry/overflow/dot flags etc.\r\n|// FRAME32 Use 32 bit frame layout, even with GPR64 (Xbox 360).\r\n|// TOC     Need table of contents (64 bit or 32 bit variant, e.g. PS3).\r\n|//         Function pointers are really a struct: code, TOC, env (optional).\r\n|// TOCENV  Function pointers have an environment pointer, too (not on PS3).\r\n|// PPE     Power Processor Element of Cell (PS3) or Xenon (Xbox 360).\r\n|//         Must avoid (slow) micro-coded instructions.\r\n|\r\n|.if P64\r\n|.define TOC, 1\r\n|.define TOCENV, 1\r\n|.macro lpx, a, b, c; ldx a, b, c; .endmacro\r\n|.macro lp, a, b; ld a, b; .endmacro\r\n|.macro stp, a, b; std a, b; .endmacro\r\n|.define decode_OPP, decode_OP8\r\n|.if FFI\r\n|// Missing: Calling conventions, 64 bit regs, TOC.\r\n|.error lib_ffi not yet implemented for PPC64\r\n|.endif\r\n|.else\r\n|.macro lpx, a, b, c; lwzx a, b, c; .endmacro\r\n|.macro lp, a, b; lwz a, b; .endmacro\r\n|.macro stp, a, b; stw a, b; .endmacro\r\n|.define decode_OPP, decode_OP4\r\n|.endif\r\n|\r\n|// Convenience macros for TOC handling.\r\n|.if TOC\r\n|// Linker needs a TOC patch area for every external call relocation.\r\n|.macro blex, target; bl extern target@plt; nop; .endmacro\r\n|.macro .toc, a, b; a, b; .endmacro\r\n|.if P64\r\n|.define TOC_OFS,\t 8\r\n|.define ENV_OFS,\t16\r\n|.else\r\n|.define TOC_OFS,\t4\r\n|.define ENV_OFS,\t8\r\n|.endif\r\n|.else  // No TOC.\r\n|.macro blex, target; bl extern target@plt; .endmacro\r\n|.macro .toc, a, b; .endmacro\r\n|.endif\r\n|.macro .tocenv, a, b; .if TOCENV; a, b; .endif; .endmacro\r\n|\r\n|.macro .gpr64, a, b; .if GPR64; a, b; .endif; .endmacro\r\n|\r\n|.macro andix., y, a, i\r\n|.if PPE\r\n|  rlwinm y, a, 0, 31-lj_fls(i), 31-lj_ffs(i)\r\n|  cmpwi y, 0\r\n|.else\r\n|  andi. y, a, i\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro clrso, reg\r\n|.if PPE\r\n|  li reg, 0\r\n|  mtxer reg\r\n|.else\r\n|  mcrxr cr0\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro checkov, reg, noov\r\n|.if PPE\r\n|  mfxer reg\r\n|  add reg, reg, reg\r\n|  cmpwi reg, 0\r\n|   li reg, 0\r\n|   mtxer reg\r\n|  bgey noov\r\n|.else\r\n|  mcrxr cr0\r\n|  bley noov\r\n|.endif\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// Don't use: r1 = sp, r2 and r13 = reserved (TOC, TLS or SDATA)\r\n|\r\n|// The following must be C callee-save (but BASE is often refetched).\r\n|.define BASE,\t\tr14\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tr15\t// Constants of current Lua function.\r\n|.define PC,\t\tr16\t// Next PC.\r\n|.define DISPATCH,\tr17\t// Opcode dispatch table.\r\n|.define LREG,\t\tr18\t// Register holding lua_State (also in SAVE_L).\r\n|.define MULTRES,\tr19\t// Size of multi-result: (nresults+1)*8.\r\n|.define JGL,\t\tr31\t// On-trace: global_State + 32768.\r\n|\r\n|// Constants for type-comparisons, stores and conversions. C callee-save.\r\n|.define TISNUM,\tr22\r\n|.define TISNIL,\tr23\r\n|.define ZERO,\t\tr24\r\n|.define TOBIT,\t\tf30\t// 2^52 + 2^51.\r\n|.define TONUM,\t\tf31\t// 2^52 + 2^51 + 2^31.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA.\r\n|.define RA,\t\tr20\t// Callee-save.\r\n|.define RB,\t\tr10\r\n|.define RC,\t\tr11\r\n|.define RD,\t\tr12\r\n|.define INS,\t\tr7\t// Overlaps CARG5.\r\n|\r\n|.define TMP0,\t\tr0\r\n|.define TMP1,\t\tr8\r\n|.define TMP2,\t\tr9\r\n|.define TMP3,\t\tr6\t// Overlaps CARG4.\r\n|\r\n|// Saved temporaries.\r\n|.define SAVE0,\t\tr21\r\n|\r\n|// Calling conventions.\r\n|.define CARG1,\t\tr3\r\n|.define CARG2,\t\tr4\r\n|.define CARG3,\t\tr5\r\n|.define CARG4,\t\tr6\t// Overlaps TMP3.\r\n|.define CARG5,\t\tr7\t// Overlaps INS.\r\n|\r\n|.define FARG1,\t\tf1\r\n|.define FARG2,\t\tf2\r\n|\r\n|.define CRET1,\t\tr3\r\n|.define CRET2,\t\tr4\r\n|\r\n|.define TOCREG,\tr2\t// TOC register (only used by C code).\r\n|.define ENVREG,\tr11\t// Environment pointer (nested C functions).\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.if GPR64\r\n|.if FRAME32\r\n|\r\n|//\t\t\t456(sp) // \\ 32/64 bit C frame info\r\n|.define TONUM_LO,\t452(sp) // |\r\n|.define TONUM_HI,\t448(sp) // |\r\n|.define TMPD_LO,\t444(sp) // |\r\n|.define TMPD_HI,\t440(sp) // |\r\n|.define SAVE_CR,\t432(sp) // | 64 bit CR save.\r\n|.define SAVE_ERRF,\t424(sp) //  > Parameter save area.\r\n|.define SAVE_NRES,\t420(sp) // |\r\n|.define SAVE_L,\t416(sp) // |\r\n|.define SAVE_PC,\t412(sp) // |\r\n|.define SAVE_MULTRES,\t408(sp) // |\r\n|.define SAVE_CFRAME,\t400(sp) // / 64 bit C frame chain.\r\n|//\t\t\t392(sp) // Reserved.\r\n|.define CFRAME_SPACE,\t384     // Delta for sp.\r\n|// Back chain for sp:\t384(sp) <-- sp entering interpreter\r\n|.define SAVE_LR,\t376(sp) // 32 bit LR stored in hi-part.\r\n|.define SAVE_GPR_,\t232     // .. 232+18*8: 64 bit GPR saves.\r\n|.define SAVE_FPR_,\t88      // .. 88+18*8: 64 bit FPR saves.\r\n|//\t\t\t80(sp) // Needed for 16 byte stack frame alignment.\r\n|//\t\t\t16(sp)  // Callee parameter save area (ABI mandated).\r\n|//\t\t\t8(sp)   // Reserved\r\n|// Back chain for sp:\t0(sp)   <-- sp while in interpreter\r\n|// 32 bit sp stored in hi-part of 0(sp).\r\n|\r\n|.define TMPD_BLO,\t447(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.else\r\n|\r\n|//\t\t\t508(sp) // \\ 32 bit C frame info.\r\n|.define SAVE_ERRF,\t472(sp) // |\r\n|.define SAVE_NRES,\t468(sp) // |\r\n|.define SAVE_L,\t464(sp) //  > Parameter save area.\r\n|.define SAVE_PC,\t460(sp) // |\r\n|.define SAVE_MULTRES,\t456(sp) // |\r\n|.define SAVE_CFRAME,\t448(sp) // / 64 bit C frame chain.\r\n|.define SAVE_LR,\t416(sp)\r\n|.define CFRAME_SPACE,\t400     // Delta for sp.\r\n|// Back chain for sp:\t400(sp) <-- sp entering interpreter\r\n|.define SAVE_FPR_,\t256     // .. 256+18*8: 64 bit FPR saves.\r\n|.define SAVE_GPR_,\t112     // .. 112+18*8: 64 bit GPR saves.\r\n|//\t\t\t48(sp)  // Callee parameter save area (ABI mandated).\r\n|.define SAVE_TOC,\t40(sp)  // TOC save area.\r\n|.define TMPD_LO,\t36(sp)  // \\ Link editor temp (ABI mandated).\r\n|.define TMPD_HI,\t32(sp)  // /\r\n|.define TONUM_LO,\t28(sp)  // \\ Compiler temp (ABI mandated).\r\n|.define TONUM_HI,\t24(sp)  // /\r\n|// Next frame lr:\t16(sp)\r\n|.define SAVE_CR,\t8(sp)  // 64 bit CR save.\r\n|// Back chain for sp:\t0(sp)\t<-- sp while in interpreter\r\n|\r\n|.define TMPD_BLO,\t39(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.endif\r\n|.else\r\n|\r\n|.define SAVE_LR,\t276(sp)\r\n|.define CFRAME_SPACE,\t272     // Delta for sp.\r\n|// Back chain for sp:\t272(sp) <-- sp entering interpreter\r\n|.define SAVE_FPR_,\t128     // .. 128+18*8: 64 bit FPR saves.\r\n|.define SAVE_GPR_,\t56      // .. 56+18*4: 32 bit GPR saves.\r\n|.define SAVE_CR,\t52(sp)  // 32 bit CR save.\r\n|.define SAVE_ERRF,\t48(sp)  // 32 bit C frame info.\r\n|.define SAVE_NRES,\t44(sp)\r\n|.define SAVE_CFRAME,\t40(sp)\r\n|.define SAVE_L,\t36(sp)\r\n|.define SAVE_PC,\t32(sp)\r\n|.define SAVE_MULTRES,\t28(sp)\r\n|.define UNUSED1,\t24(sp)\r\n|.define TMPD_LO,\t20(sp)\r\n|.define TMPD_HI,\t16(sp)\r\n|.define TONUM_LO,\t12(sp)\r\n|.define TONUM_HI,\t8(sp)\r\n|// Next frame lr:\t4(sp)\r\n|// Back chain for sp:\t0(sp)\t<-- sp while in interpreter\r\n|\r\n|.define TMPD_BLO,\t23(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.endif\r\n|\r\n|.macro save_, reg\r\n|.if GPR64\r\n|  std r..reg, SAVE_GPR_+(reg-14)*8(sp)\r\n|.else\r\n|  stw r..reg, SAVE_GPR_+(reg-14)*4(sp)\r\n|.endif\r\n|  stfd f..reg, SAVE_FPR_+(reg-14)*8(sp)\r\n|.endmacro\r\n|.macro rest_, reg\r\n|.if GPR64\r\n|  ld r..reg, SAVE_GPR_+(reg-14)*8(sp)\r\n|.else\r\n|  lwz r..reg, SAVE_GPR_+(reg-14)*4(sp)\r\n|.endif\r\n|  lfd f..reg, SAVE_FPR_+(reg-14)*8(sp)\r\n|.endmacro\r\n|\r\n|.macro saveregs\r\n|.if GPR64 and not FRAME32\r\n|  stdu sp, -CFRAME_SPACE(sp)\r\n|.else\r\n|  stwu sp, -CFRAME_SPACE(sp)\r\n|.endif\r\n|  save_ 14; save_ 15; save_ 16\r\n|  mflr r0\r\n|  save_ 17; save_ 18; save_ 19; save_ 20; save_ 21; save_ 22\r\n|.if GPR64 and not FRAME32\r\n|  std r0, SAVE_LR\r\n|.else\r\n|  stw r0, SAVE_LR\r\n|.endif\r\n|  save_ 23; save_ 24; save_ 25\r\n|  mfcr r0\r\n|  save_ 26; save_ 27; save_ 28; save_ 29; save_ 30; save_ 31\r\n|.if GPR64\r\n|  std r0, SAVE_CR\r\n|.else\r\n|  stw r0, SAVE_CR\r\n|.endif\r\n|  .toc std TOCREG, SAVE_TOC\r\n|.endmacro\r\n|\r\n|.macro restoreregs\r\n|.if GPR64 and not FRAME32\r\n|  ld r0, SAVE_LR\r\n|.else\r\n|  lwz r0, SAVE_LR\r\n|.endif\r\n|.if GPR64\r\n|  ld r12, SAVE_CR\r\n|.else\r\n|  lwz r12, SAVE_CR\r\n|.endif\r\n|  rest_ 14; rest_ 15; rest_ 16; rest_ 17; rest_ 18; rest_ 19\r\n|  mtlr r0;\r\n|.if PPE; mtocrf 0x20, r12; .else; mtcrf 0x38, r12; .endif\r\n|  rest_ 20; rest_ 21; rest_ 22; rest_ 23; rest_ 24; rest_ 25\r\n|.if PPE; mtocrf 0x10, r12; .endif\r\n|  rest_ 26; rest_ 27; rest_ 28; rest_ 29; rest_ 30; rest_ 31\r\n|.if PPE; mtocrf 0x08, r12; .endif\r\n|  addi sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// These basic macros should really be part of DynASM.\r\n|.macro srwi, rx, ry, n; rlwinm rx, ry, 32-n, n, 31; .endmacro\r\n|.macro slwi, rx, ry, n; rlwinm rx, ry, n, 0, 31-n; .endmacro\r\n|.macro rotlwi, rx, ry, n; rlwinm rx, ry, n, 0, 31; .endmacro\r\n|.macro rotlw, rx, ry, rn; rlwnm rx, ry, rn, 0, 31; .endmacro\r\n|.macro subi, rx, ry, i; addi rx, ry, -i; .endmacro\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; tw 4, sp, sp; .endmacro\r\n|\r\n|// int/FP conversions.\r\n|.macro tonum_i, freg, reg\r\n|  xoris reg, reg, 0x8000\r\n|  stw reg, TONUM_LO\r\n|  lfd freg, TONUM_D\r\n|  fsub freg, freg, TONUM\r\n|.endmacro\r\n|\r\n|.macro tonum_u, freg, reg\r\n|  stw reg, TONUM_LO\r\n|  lfd freg, TONUM_D\r\n|  fsub freg, freg, TOBIT\r\n|.endmacro\r\n|\r\n|.macro toint, reg, freg, tmpfreg\r\n|  fctiwz tmpfreg, freg\r\n|  stfd tmpfreg, TMPD\r\n|  lwz reg, TMPD_LO\r\n|.endmacro\r\n|\r\n|.macro toint, reg, freg\r\n|  toint reg, freg, freg\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_PC,\t-8\r\n|.define FRAME_FUNC,\t-4\r\n|\r\n|// Instruction decode.\r\n|.macro decode_OP4, dst, ins; rlwinm dst, ins, 2, 22, 29; .endmacro\r\n|.macro decode_OP8, dst, ins; rlwinm dst, ins, 3, 21, 28; .endmacro\r\n|.macro decode_RA8, dst, ins; rlwinm dst, ins, 27, 21, 28; .endmacro\r\n|.macro decode_RB8, dst, ins; rlwinm dst, ins, 11, 21, 28; .endmacro\r\n|.macro decode_RC8, dst, ins; rlwinm dst, ins, 19, 21, 28; .endmacro\r\n|.macro decode_RD8, dst, ins; rlwinm dst, ins, 19, 13, 28; .endmacro\r\n|\r\n|.macro decode_OP1, dst, ins; rlwinm dst, ins, 0, 24, 31; .endmacro\r\n|.macro decode_RD4, dst, ins; rlwinm dst, ins, 18, 14, 29; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|.endmacro\r\n|// Instruction decode+dispatch. Note: optimized for e300!\r\n|.macro ins_NEXT2\r\n|  decode_OPP TMP1, INS\r\n|  lpx TMP0, DISPATCH, TMP1\r\n|  mtctr TMP0\r\n|   decode_RB8 RB, INS\r\n|   decode_RD8 RD, INS\r\n|   decode_RA8 RA, INS\r\n|   decode_RC8 RC, INS\r\n|  bctr\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  lwz PC, LFUNC:RB->pc\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|  decode_OPP TMP1, INS\r\n|   decode_RA8 RA, INS\r\n|  lpx TMP0, DISPATCH, TMP1\r\n|   add RA, RA, BASE\r\n|  mtctr TMP0\r\n|  bctr\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  stw PC, FRAME_PC(BASE)\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checknum, reg; cmplw reg, TISNUM; .endmacro\r\n|.macro checknum, cr, reg; cmplw cr, reg, TISNUM; .endmacro\r\n|.macro checkstr, reg; cmpwi reg, LJ_TSTR; .endmacro\r\n|.macro checktab, reg; cmpwi reg, LJ_TTAB; .endmacro\r\n|.macro checkfunc, reg; cmpwi reg, LJ_TFUNC; .endmacro\r\n|.macro checknil, reg; cmpwi reg, LJ_TNIL; .endmacro\r\n|\r\n|.macro branch_RD\r\n|  srwi TMP0, RD, 1\r\n|  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n|  add PC, PC, TMP0\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotcheck, delta, target\r\n|  rlwinm TMP1, PC, 31, 25, 30\r\n|  addi TMP1, TMP1, GG_DISP2HOT\r\n|  lhzx TMP2, DISPATCH, TMP1\r\n|  addic. TMP2, TMP2, -delta\r\n|  sthx TMP2, DISPATCH, TMP1\r\n|  blt target\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP, ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL, ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state. Uses TMP0.\r\n|.macro li_vmstate, st; li TMP0, ~LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate; stw TMP0, DISPATCH_GL(vmstate)(DISPATCH); .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  lwz tmp, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|  // Assumes LJ_GC_BLACK is 0x04.\r\n|   rlwinm mark, mark, 0, 30, 28\t\t// black2gray(tab)\r\n|  stw tab, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   stb mark, tab->marked\r\n|  stw tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: TMP2 = previous base.\r\n  |  andix. TMP0, PC, FRAME_P\r\n  |   li TMP1, LJ_TTRUE\r\n  |  beq ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  lwz PC, FRAME_PC(TMP2)\t\t// Fetch PC of previous frame.\r\n  |  mr BASE, TMP2\t\t\t// Restore caller base.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   stwu TMP1, FRAME_PC(RA)\t\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  addi RD, RD, 8\t\t\t// RD = (nresults+1)*8.\r\n  |   andix. TMP0, PC, FRAME_TYPE\r\n  |  cmpwi cr1, RD, 0\r\n  |  li CRET1, LUA_YIELD\r\n  |  beq cr1, ->vm_unwind_c_eh\r\n  |  mr MULTRES, RD\r\n  |   beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RD/MULTRES = (nresults+1)*8, PC = return\r\n  |  // TMP0 = PC & FRAME_TYPE\r\n  |  cmpwi TMP0, FRAME_C\r\n  |   rlwinm TMP2, PC, 0, 0, 28\r\n  |    li_vmstate C\r\n  |   sub TMP2, BASE, TMP2\t\t// TMP2 = previous base.\r\n  |  bney ->vm_returnp\r\n  |\r\n  |  addic. TMP1, RD, -8\r\n  |   stp TMP2, L->base\r\n  |   lwz TMP2, SAVE_NRES\r\n  |    subi BASE, BASE, 8\r\n  |    st_vmstate\r\n  |   slwi TMP2, TMP2, 3\r\n  |  beq >2\r\n  |1:\r\n  |  addic. TMP1, TMP1, -8\r\n  |   lfd f0, 0(RA)\r\n  |    addi RA, RA, 8\r\n  |   stfd f0, 0(BASE)\r\n  |    addi BASE, BASE, 8\r\n  |  bney <1\r\n  |\r\n  |2:\r\n  |  cmpw TMP2, RD\t\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  stp BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  lp TMP0, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   li CRET1, 0\t\t\t// Ok return status for vm_pcall.\r\n  |  stp TMP0, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  blr\r\n  |\r\n  |6:\r\n  |  ble >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  lwz TMP1, L->maxstack\r\n  |  cmplw BASE, TMP1\r\n  |  bge >8\r\n  |  stw TISNIL, 0(BASE)\r\n  |  addi RD, RD, 8\r\n  |  addi BASE, BASE, 8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  subfic TMP3, TMP2, 0\t\t// LUA_MULTRET+1 case?\r\n  |   sub TMP0, RD, TMP2\r\n  |  subfe TMP1, TMP1, TMP1\t\t// TMP1 = TMP2 == 0 ? 0 : -1\r\n  |   and TMP0, TMP0, TMP1\r\n  |  sub BASE, BASE, TMP0\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  stp BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |   mr SAVE0, RD\r\n  |  srwi CARG2, TMP2, 3\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |    lwz TMP2, SAVE_NRES\r\n  |   mr RD, SAVE0\r\n  |    slwi TMP2, TMP2, 3\r\n  |  lp BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mr sp, CARG1\r\n  |  mr CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |  .toc ld TOCREG, SAVE_TOC\r\n  |   li TMP0, ~LJ_VMST_C\r\n  |  lwz GL:TMP1, L->glref\r\n  |   stw TMP0, GL:TMP1->vmstate\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |.if GPR64\r\n  |  rldicr sp, CARG1, 0, 61\r\n  |.else\r\n  |  rlwinm sp, CARG1, 0, 0, 29\r\n  |.endif\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |  .toc ld TOCREG, SAVE_TOC\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |  lp BASE, L->base\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     li ZERO, 0\r\n  |     stw TMP3, TMPD\r\n  |  li TMP1, LJ_TFALSE\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     li TISNIL, LJ_TNIL\r\n  |    li_vmstate INTERP\r\n  |     lfs TOBIT, TMPD\r\n  |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of previous frame.\r\n  |  la RA, -8(BASE)\t\t\t// Results start at BASE-8.\r\n  |     stw TMP3, TMPD\r\n  |   addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  stw TMP1, 0(RA)\t\t\t// Prepend false to error message.\r\n  |  li RD, 16\t\t\t\t// 2 results: false + error message.\r\n  |    st_vmstate\r\n  |     lfs TONUM, TMPD\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |  stp BASE, L->base\r\n  |   addi PC, PC, 4\t\t\t// Must point after first instruction.\r\n  |  stp RC, L->top\r\n  |   srwi CARG2, RA, 3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lp BASE, L->base\r\n  |  lp RC, L->top\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  mr BASE, CARG2\r\n  |    lbz TMP1, L->status\r\n  |   stw L, SAVE_L\r\n  |  li PC, FRAME_CP\r\n  |  addi TMP0, sp, CFRAME_RESUME\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |   stw CARG3, SAVE_NRES\r\n  |    cmplwi TMP1, 0\r\n  |   stw CARG3, SAVE_ERRF\r\n  |  stp TMP0, L->cframe\r\n  |   stp CARG3, SAVE_CFRAME\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |    beq >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  mr RA, BASE\r\n  |   lp BASE, L->base\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |   lp TMP1, L->top\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |    stb CARG3, L->status\r\n  |     stw TMP3, TMPD\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     lfs TOBIT, TMPD\r\n  |   sub RD, TMP1, BASE\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |   addi RD, RD, 8\r\n  |     stw TMP0, TONUM_HI\r\n  |    li_vmstate INTERP\r\n  |     li ZERO, 0\r\n  |    st_vmstate\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   mr MULTRES, RD\r\n  |     lfs TONUM, TMPD\r\n  |     li TISNIL, LJ_TNIL\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  li PC, FRAME_CP\r\n  |  stw CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  li PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  lp TMP1, L:CARG1->cframe\r\n  |   stw CARG3, SAVE_NRES\r\n  |    mr L, CARG1\r\n  |   stw CARG1, SAVE_L\r\n  |    mr BASE, CARG2\r\n  |  stp sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  stp TMP1, SAVE_CFRAME\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  lp TMP2, L->base\t\t\t// TMP2 = old base (used in vmeta_call).\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |   lp TMP1, L->top\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  add PC, PC, BASE\r\n  |     stw TMP3, TMPD\r\n  |     li ZERO, 0\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     lfs TOBIT, TMPD\r\n  |  sub PC, PC, TMP2\t\t\t// PC = frame delta + frame type\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |   sub NARGS8:RC, TMP1, BASE\r\n  |     stw TMP0, TONUM_HI\r\n  |    li_vmstate INTERP\r\n  |     lfs TONUM, TMPD\r\n  |     li TISNIL, LJ_TNIL\r\n  |    st_vmstate\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  lwz TMP0, FRAME_PC(BASE)\r\n  |   lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  checkfunc TMP0; bne ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |   lwz TMP0, L:CARG1->stack\r\n  |  stw CARG1, SAVE_L\r\n  |   lp TMP1, L->top\r\n  |  stw CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   sub TMP0, TMP0, TMP1\t\t// Compute -savestack(L, L->top).\r\n  |    lp TMP1, L->cframe\r\n  |    stp sp, L->cframe\t\t// Add our C frame to cframe chain.\r\n  |  .toc lp CARG4, 0(CARG4)\r\n  |  li TMP2, 0\r\n  |   stw TMP0, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  stw TMP2, SAVE_ERRF\t\t// No error function.\r\n  |    stp TMP1, SAVE_CFRAME\r\n  |  mtctr CARG4\r\n  |  bctrl\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.if PPE\r\n  |  mr BASE, CRET1\r\n  |  cmpwi CRET1, 0\r\n  |.else\r\n  |  mr. BASE, CRET1\r\n  |.endif\r\n  |   lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |    li PC, FRAME_CP\r\n  |   addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  bne <3\t\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// The lj_meta_* functions (except for lj_meta_cat) don't reallocate the\r\n  |// stack, so BASE doesn't need to be reloaded across these calls.\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RD = (nresults+1)*8\r\n  |  lwz TMP0, -12(BASE)\t\t// Continuation.\r\n  |   mr RB, BASE\r\n  |   mr BASE, TMP2\t\t\t// Restore caller BASE.\r\n  |    lwz LFUNC:TMP1, FRAME_FUNC(TMP2)\r\n  |.if FFI\r\n  |  cmplwi TMP0, 1\r\n  |.endif\r\n  |     lwz PC, -16(RB)\t\t\t// Restore PC from [cont|PC].\r\n  |   subi TMP2, RD, 8\r\n  |    lwz TMP1, LFUNC:TMP1->pc\r\n  |   stwx TISNIL, RA, TMP2\t\t// Ensure one valid arg.\r\n  |.if FFI\r\n  |  ble >1\r\n  |.endif\r\n  |    lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |  // BASE = base, RA = resultptr, RB = meta base\r\n  |  mtctr TMP0\r\n  |  bctr\t\t\t\t// Jump to continuation.\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  beq ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |  subi TMP1, RB, 16\r\n  |  sub RC, TMP1, BASE\r\n  |  b ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, RB = meta base\r\n  |  lwz INS, -4(PC)\r\n  |   subi CARG2, RB, 16\r\n  |  decode_RB8 SAVE0, INS\r\n  |   lfd f0, 0(RA)\r\n  |  add TMP1, BASE, SAVE0\r\n  |   stp BASE, L->base\r\n  |  cmplw TMP1, CARG2\r\n  |   sub CARG3, CARG2, TMP1\r\n  |  decode_RA8 RA, INS\r\n  |   stfd f0, 0(CARG2)\r\n  |  bney ->BC_CAT_Z\r\n  |   stfdx f0, BASE, RA\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TSTR\r\n  |   decode_RB8 RB, INS\r\n  |  stw STR:RC, 4(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  stw TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgets:\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TTAB\r\n  |  stw TAB:RB, 4(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |  stw TMP0, 0(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   stw STR:RC, 4(CARG3)\r\n  |   stw TMP1, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// TMP0 = index\r\n  |.if not DUALNUM\r\n  |  tonum_u f0, TMP0\r\n  |.endif\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(CARG3)\r\n  |  stw TMP0, 4(CARG3)\r\n  |.else\r\n  |  stfd f0, 0(CARG3)\r\n  |.endif\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq >3\r\n  |   lfd f0, 0(CRET1)\r\n  |  ins_next1\r\n  |   stfdx f0, BASE, RA\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lp BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 16\t\t\t// 2 args for func(t, k).\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TSTR\r\n  |   decode_RB8 RB, INS\r\n  |  stw STR:RC, 4(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  stw TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsets:\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TTAB\r\n  |  stw TAB:RB, 4(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |  stw TMP0, 0(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   stw STR:RC, 4(CARG3)\r\n  |   stw TMP1, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// TMP0 = index\r\n  |.if not DUALNUM\r\n  |  tonum_u f0, TMP0\r\n  |.endif\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(CARG3)\r\n  |  stw TMP0, 4(CARG3)\r\n  |.else\r\n  |  stfd f0, 0(CARG3)\r\n  |.endif\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |   lfdx f0, BASE, RA\r\n  |  beq >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  ins_next1\r\n  |   stfd f0, 0(CRET1)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lp BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 24\t\t\t// 3 args for func(t, k, v)\r\n  |  stfd f0, 16(BASE)\t\t\t// Copy value to third argument.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  mr CARG1, L\r\n  |   subi PC, PC, 4\r\n  |.if DUALNUM\r\n  |  mr CARG2, RA\r\n  |.else\r\n  |  add CARG2, BASE, RA\r\n  |.endif\r\n  |   stw PC, SAVE_PC\r\n  |.if DUALNUM\r\n  |  mr CARG3, RD\r\n  |.else\r\n  |  add CARG3, BASE, RD\r\n  |.endif\r\n  |   stp BASE, L->base\r\n  |  decode_OP1 CARG4, INS\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  cmplwi CRET1, 1\r\n  |  bgt ->vmeta_binop\r\n  |  subfic CRET1, CRET1, 0\r\n  |4:\r\n  |  lwz INS, 0(PC)\r\n  |   addi PC, PC, 4\r\n  |  decode_RD4 TMP2, INS\r\n  |  addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n  |  and TMP2, TMP2, CRET1\r\n  |  add PC, PC, TMP2\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  lwz INS, -4(PC)\r\n  |   lfd f0, 0(RA)\r\n  |  decode_RA8 TMP1, INS\r\n  |   stfdx f0, BASE, TMP1\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |  .gpr64 extsw TMP0, TMP0\r\n  |  subfic TMP0, TMP0, LJ_TTRUE\t// Branch if result is true.\r\n  |  subfe CRET1, CRET1, CRET1\r\n  |  not CRET1, CRET1\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |  .gpr64 extsw TMP0, TMP0\r\n  |  subfic TMP0, TMP0, LJ_TTRUE\t// Branch if result is false.\r\n  |  subfe CRET1, CRET1, CRET1\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  subi PC, PC, 4\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  mr CARG2, INS\r\n  |  subi PC, PC, 4\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_equal_cd\t\t// (lua_State *L, BCIns op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  add CARG3, KBASE, RC\r\n  |  add CARG4, BASE, RB\r\n  |  b >1\r\n  |->vmeta_arith_nv2:\r\n  |.if DUALNUM\r\n  |  mr CARG3, RC\r\n  |  mr CARG4, RB\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vmeta_unm:\r\n  |  mr CARG3, RD\r\n  |  mr CARG4, RD\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, BASE, RC\r\n  |.if DUALNUM\r\n  |  b >1\r\n  |.endif\r\n  |->vmeta_arith_vn2:\r\n  |->vmeta_arith_vv2:\r\n  |.if DUALNUM\r\n  |  mr CARG3, RB\r\n  |  mr CARG4, RC\r\n  |.endif\r\n  |1:\r\n  |  add CARG2, BASE, RA\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  decode_OP1 CARG5, INS\t\t// Caveat: CARG5 overlaps INS.\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub TMP1, CRET1, BASE\r\n  |   stw PC, -16(CRET1)\t\t// [cont|PC]\r\n  |   mr TMP2, BASE\r\n  |  addi PC, TMP1, FRAME_CONT\r\n  |   mr BASE, CRET1\r\n  |  li NARGS8:RC, 16\t\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n#if LJ_52\r\n  |  mr SAVE0, CARG1\r\n#endif\r\n  |  mr CARG2, RD\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  cmplwi CRET1, 0\r\n  |  bne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  mr CARG1, SAVE0\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stp TMP2, L->base\t\t\t// This is the callers base!\r\n  |  subi CARG2, BASE, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, BASE, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  subi CARG2, RA, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, RA, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz TMP1, FRAME_PC(BASE)\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |   lwz LFUNC:RB, FRAME_FUNC(RA)\t// Guaranteed to be a function here.\r\n  |  b ->BC_CALLT_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  mr CARG2, RA\r\n  |   stw PC, SAVE_PC\r\n  |  mr SAVE0, INS\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |.if JIT\r\n  |   decode_OP1 TMP0, SAVE0\r\n  |.endif\r\n  |  decode_RA8 RA, SAVE0\r\n  |.if JIT\r\n  |   cmpwi TMP0, BC_JFORI\r\n  |.endif\r\n  |  decode_RD8 RD, SAVE0\r\n  |.if JIT\r\n  |   beqy =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz CARG4, 8(BASE)\r\n  |   lwz CARG1, 4(BASE)\r\n  |    lwz CARG2, 12(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |    lfd FARG2, 8(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  checknum CARG4; bge ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses TMP0 and TMP1.\r\n  |.macro ffgccheck\r\n  |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n  |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n  |  cmplw TMP0, TMP1\r\n  |  bgel ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  li TMP1, LJ_TFALSE\r\n  |   la RA, -8(BASE)\r\n  |  cmplw cr1, CARG3, TMP1\r\n  |    lwz PC, FRAME_PC(BASE)\r\n  |  bge cr1, ->fff_fallback\r\n  |   stw CARG3, 0(RA)\r\n  |  addi RD, NARGS8:RC, 8\t\t// Compute (nresults+1)*8.\r\n  |   stw CARG1, 4(RA)\r\n  |  beq ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |  li TMP1, 8\r\n  |  subi RC, RC, 8\r\n  |1:\r\n  |  cmplw TMP1, RC\r\n  |   lfdx f0, BASE, TMP1\r\n  |   stfdx f0, RA, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bney <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc type\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  .gpr64 extsw CARG1, CARG1\r\n  |  subfc TMP0, TISNUM, CARG1\r\n  |  subfe TMP2, CARG1, CARG1\r\n  |  orc TMP1, TMP2, TMP0\r\n  |  addi TMP1, TMP1, ~LJ_TISNUM+1\r\n  |  slwi TMP1, TMP1, 3\r\n  |   la TMP2, CFUNC:RB->upvalue\r\n  |  lfdx FARG1, TMP2, TMP1\r\n  |  b ->fff_resn\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  checktab CARG3; bne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  lwz TAB:CARG1, TAB:CARG1->metatable\r\n  |2:\r\n  |  li CARG3, LJ_TNIL\r\n  |   cmplwi TAB:CARG1, 0\r\n  |  lwz STR:RC, DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])(DISPATCH)\r\n  |   beq ->fff_restv\r\n  |  lwz TMP0, TAB:CARG1->hmask\r\n  |   li CARG3, LJ_TTAB\t\t\t// Use metatable as default result.\r\n  |  lwz TMP1, STR:RC->hash\r\n  |  lwz NODE:TMP2, TAB:CARG1->node\r\n  |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n  |  slwi TMP0, TMP1, 5\r\n  |  slwi TMP1, TMP1, 3\r\n  |  sub TMP1, TMP0, TMP1\r\n  |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  lwz CARG4, NODE:TMP2->key\r\n  |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n  |    lwz CARG2, NODE:TMP2->val\r\n  |     lwz TMP1, 4+offsetof(Node, val)(NODE:TMP2)\r\n  |  checkstr CARG4; bne >4\r\n  |   cmpw TMP0, STR:RC; beq >5\r\n  |4:\r\n  |  lwz NODE:TMP2, NODE:TMP2->next\r\n  |  cmplwi NODE:TMP2, 0\r\n  |  beq ->fff_restv\t\t\t// Not found, keep default result.\r\n  |  b <3\r\n  |5:\r\n  |  checknil CARG2\r\n  |  beq ->fff_restv\t\t\t// Ditto for nil value.\r\n  |  mr CARG3, CARG2\t\t\t// Return value of mt.__metatable.\r\n  |  mr CARG1, TMP1\r\n  |  b ->fff_restv\r\n  |\r\n  |6:\r\n  |  cmpwi CARG3, LJ_TUDATA; beq <1\r\n  |  .gpr64 extsw CARG3, CARG3\r\n  |  subfc TMP0, TISNUM, CARG3\r\n  |  subfe TMP2, CARG3, CARG3\r\n  |  orc TMP1, TMP2, TMP0\r\n  |  addi TMP1, TMP1, ~LJ_TISNUM+1\r\n  |  slwi TMP1, TMP1, 2\r\n  |   la TMP2, DISPATCH_GL(gcroot[GCROOT_BASEMT])(DISPATCH)\r\n  |  lwzx TAB:CARG1, TMP2, TMP1\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |   checktab CARG3; bne ->fff_fallback\r\n  |  lwz TAB:TMP1, TAB:CARG1->metatable\r\n  |   checktab CARG4; bne ->fff_fallback\r\n  |  cmplwi TAB:TMP1, 0\r\n  |   lbz TMP3, TAB:CARG1->marked\r\n  |  bne ->fff_fallback\r\n  |   andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n  |    stw TAB:CARG2, TAB:CARG1->metatable\r\n  |   beq ->fff_restv\r\n  |  barrierback TAB:CARG1, TMP3, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG4, 0(BASE)\r\n  |    lwz TAB:CARG2, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checktab CARG4; bne ->fff_fallback\r\n  |   la CARG3, 8(BASE)\r\n  |   mr CARG1, L\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  lfd FARG1, 0(CRET1)\r\n  |  b ->fff_resn\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly one argument.\r\n  |   checknum CARG1; bgt ->fff_fallback\r\n  |  b ->fff_resn\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  checkstr CARG3\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq ->fff_restv\t\t\t// String key?\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  lwz TMP0, DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])(DISPATCH)\r\n  |  checknum CARG3\r\n  |  cmplwi cr1, TMP0, 0\r\n  |   stp BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  crorc 4*cr0+eq, 4*cr0+gt, 4*cr1+eq\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  beq ->fff_fallback\r\n  |  ffgccheck\r\n  |  mr CARG1, L\r\n  |  mr CARG2, BASE\r\n  |.if DUALNUM\r\n  |  bl extern lj_str_fromnumber\t// (lua_State *L, cTValue *o)\r\n  |.else\r\n  |  bl extern lj_str_fromnum\t\t// (lua_State *L, lua_Number *np)\r\n  |.endif\r\n  |  // Returns GCstr *.\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc next\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |    lwz TAB:CARG2, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |   stwx TISNIL, BASE, NARGS8:RC\t// Set missing 2nd arg to nil.\r\n  |  checktab CARG1\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n  |   stp BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  la CARG3, 8(BASE)\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  cmplwi CRET1, 0\r\n  |   li CARG3, LJ_TNIL\r\n  |  beq ->fff_restv\t\t\t// End of traversal: return nil.\r\n  |  lfd f0, 8(BASE)\t\t\t// Copy key and value to results.\r\n  |   la RA, -8(BASE)\r\n  |  lfd f1, 16(BASE)\r\n  |  stfd f0, 0(RA)\r\n  |   li RD, (2+1)*8\r\n  |  stfd f1, 8(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktab CARG3\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |   stw TISNIL, 8(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc ipairs_aux\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz TAB:CARG1, 4(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP2, 12(BASE)\r\n  |.else\r\n  |    lfd FARG2, 8(BASE)\r\n  |.endif\r\n  |  blt ->fff_fallback\r\n  |  checktab CARG3\r\n  |  checknum cr1, CARG4\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |.if DUALNUM\r\n  |  bne ->fff_fallback\r\n  |  bne cr1, ->fff_fallback\r\n  |.else\r\n  |    lus TMP0, 0x3ff0\r\n  |    stw ZERO, TMPD_LO\r\n  |  bne ->fff_fallback\r\n  |    stw TMP0, TMPD_HI\r\n  |  bge cr1, ->fff_fallback\r\n  |    lfd FARG1, TMPD\r\n  |  toint TMP2, FARG2, f0\r\n  |.endif\r\n  |   lwz TMP0, TAB:CARG1->asize\r\n  |   lwz TMP1, TAB:CARG1->array\r\n  |.if not DUALNUM\r\n  |  fadd FARG2, FARG2, FARG1\r\n  |.endif\r\n  |  addi TMP2, TMP2, 1\r\n  |   la RA, -8(BASE)\r\n  |  cmplw TMP0, TMP2\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(RA)\r\n  |   slwi TMP3, TMP2, 3\r\n  |  stw TMP2, 4(RA)\r\n  |.else\r\n  |   slwi TMP3, TMP2, 3\r\n  |  stfd FARG2, 0(RA)\r\n  |.endif\r\n  |  ble >2\t\t\t\t// Not in array part?\r\n  |  lwzx TMP2, TMP1, TMP3\r\n  |  lfdx f0, TMP1, TMP3\r\n  |1:\r\n  |  checknil TMP2\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\t\t\t// End of iteration, return 0 results.\r\n  |   li RD, (2+1)*8\r\n  |  stfd f0, 8(RA)\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  lwz TMP0, TAB:CARG1->hmask\r\n  |  cmplwi TMP0, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |   mr CARG2, TMP2\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  cmplwi CRET1, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |  lwz TMP2, 0(CRET1)\r\n  |  lfd f0, 0(CRET1)\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktab CARG3\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 8(BASE)\r\n  |.else\r\n  |  stw ZERO, 8(BASE)\r\n  |.endif\r\n  |   stw ZERO, 12(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  blt ->fff_fallback\r\n  |   mr TMP2, BASE\r\n  |   la BASE, 8(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP3, TMP3, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |   subi NARGS8:RC, NARGS8:RC, 8\r\n  |  addi PC, TMP3, 8+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc xpcall\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG4, 8(BASE)\r\n  |    lfd FARG2, 8(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  lbz TMP1, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |   mr TMP2, BASE\r\n  |  checkfunc CARG4; bne ->fff_fallback  // Traceback must be a function.\r\n  |   la BASE, 16(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP1, TMP1, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |    stfd FARG2, 0(TMP2)\t\t// Swap function and traceback.\r\n  |  subi NARGS8:RC, NARGS8:RC, 16\r\n  |    stfd FARG1, 8(TMP2)\r\n  |  addi PC, TMP1, 16+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  cmpwi CARG3, LJ_TTHREAD; bne ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  lwz L:CARG1, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  lbz TMP0, L:CARG1->status\r\n  |   lp TMP1, L:CARG1->cframe\r\n  |    lp CARG2, L:CARG1->top\r\n  |  cmplwi cr0, TMP0, LUA_YIELD\r\n  |    lp TMP2, L:CARG1->base\r\n  |   cmplwi cr1, TMP1, 0\r\n  |   lwz TMP0, L:CARG1->maxstack\r\n  |    cmplw cr7, CARG2, TMP2\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  crorc 4*cr6+lt, 4*cr0+gt, 4*cr1+eq\t\t// st>LUA_YIELD || cframe!=0\r\n  |   add TMP2, CARG2, NARGS8:RC\r\n  |  crandc 4*cr6+gt, 4*cr7+eq, 4*cr0+eq\t// base==top && st!=LUA_YIELD\r\n  |   cmplw cr1, TMP2, TMP0\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr6+gt\r\n  |   stw PC, SAVE_PC\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr1+gt\t\t// cond1 || cond2 || stackov\r\n  |   stp BASE, L->base\r\n  |  blt cr6, ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  addi BASE, BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |  subi NARGS8:RC, NARGS8:RC, 8\r\n  |  subi TMP2, TMP2, 8\r\n  |.endif\r\n  |  stp TMP2, L:CARG1->top\r\n  |  li TMP1, 0\r\n  |  stp BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |  cmpw TMP1, NARGS8:RC\r\n  |   lfdx f0, BASE, TMP1\r\n  |  beq >3\r\n  |   stfdx f0, CARG2, TMP1\r\n  |  addi TMP1, TMP1, 8\r\n  |  b <2\r\n  |3:\r\n  |  li CARG3, 0\r\n  |   mr L:SAVE0, L:CARG1\r\n  |  li CARG4, 0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  lp TMP2, L:SAVE0->base\r\n  |   cmplwi CRET1, LUA_YIELD\r\n  |  lp TMP3, L:SAVE0->top\r\n  |    li_vmstate INTERP\r\n  |  lp BASE, L->base\r\n  |    st_vmstate\r\n  |   bgt >8\r\n  |  sub RD, TMP3, TMP2\r\n  |   lwz TMP0, L->maxstack\r\n  |  cmplwi RD, 0\r\n  |   add TMP1, BASE, RD\r\n  |  beq >6\t\t\t\t// No results?\r\n  |  cmplw TMP1, TMP0\r\n  |   li TMP1, 0\r\n  |  bgt >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  subi TMP3, RD, 8\r\n  |   stp TMP2, L:SAVE0->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |  cmplw TMP1, TMP3\r\n  |   lfdx f0, TMP2, TMP1\r\n  |   stfdx f0, BASE, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bne <5\r\n  |6:\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |.if resume\r\n  |  li TMP1, LJ_TTRUE\r\n  |   la RA, -8(BASE)\r\n  |  stw TMP1, -8(BASE)\t\t\t// Prepend true to results.\r\n  |  addi RD, RD, 16\r\n  |.else\r\n  |  mr RA, BASE\r\n  |  addi RD, RD, 8\r\n  |.endif\r\n  |7:\r\n  |    stw PC, SAVE_PC\r\n  |   mr MULTRES, RD\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |  la TMP3, -8(TMP3)\r\n  |   li TMP1, LJ_TFALSE\r\n  |  lfd f0, 0(TMP3)\r\n  |   stp TMP3, L:SAVE0->top\t\t// Remove error from coroutine stack.\r\n  |    li RD, (2+1)*8\r\n  |   stw TMP1, -8(BASE)\t\t// Prepend false to results.\r\n  |    la RA, -8(BASE)\r\n  |  stfd f0, 0(BASE)\t\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mr CARG1, L\r\n  |  mr CARG2, L:SAVE0\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mr CARG1, L\r\n  |  srwi CARG2, RD, 3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  li CRET1, 0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  lp TMP0, L->cframe\r\n  |   add TMP1, BASE, NARGS8:RC\r\n  |   stp BASE, L->base\r\n  |  andix. TMP0, TMP0, CFRAME_RESUME\r\n  |   stp TMP1, L->top\r\n  |    li CRET1, LUA_YIELD\r\n  |  beq ->fff_fallback\r\n  |   stp ZERO, L->cframe\r\n  |    stb CRET1, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.ffunc_1 math_abs\r\n  |  checknum CARG3\r\n  |.if DUALNUM\r\n  |  bne >2\r\n  |  srawi TMP1, CARG1, 31\r\n  |  xor TMP2, TMP1, CARG1\r\n  |.if GPR64\r\n  |  lus TMP0, 0x8000\r\n  |  sub CARG1, TMP2, TMP1\r\n  |  cmplw CARG1, TMP0\r\n  |  beq >1\r\n  |.else\r\n  |  sub. CARG1, TMP2, TMP1\r\n  |  blt >1\r\n  |.endif\r\n  |->fff_resi:\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |  la RA, -8(BASE)\r\n  |  stw TISNUM, -8(BASE)\r\n  |  stw CRET1, -4(BASE)\r\n  |  b ->fff_res1\r\n  |1:\r\n  |  lus CARG3, 0x41e0\t// 2^31.\r\n  |  li CARG1, 0\r\n  |  b ->fff_restv\r\n  |2:\r\n  |.endif\r\n  |  bge ->fff_fallback\r\n  |  rlwinm CARG3, CARG3, 0, 1, 31\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG3/CARG1 = TValue result.\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |   stw CARG3, -8(BASE)\r\n  |  la RA, -8(BASE)\r\n  |   stw CARG1, -4(BASE)\r\n  |->fff_res1:\r\n  |  // RA = results, PC = return.\r\n  |  li RD, (1+1)*8\r\n  |->fff_res:\r\n  |  // RA = results, RD = (nresults+1)*8, PC = return.\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   mr MULTRES, RD\r\n  |  bney ->vm_return\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RB8 RB, INS\r\n  |5:\r\n  |  cmplw RB, RD\t\t\t// More results expected?\r\n  |   decode_RA8 TMP0, INS\r\n  |  bgt >6\r\n  |  ins_next1\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |   sub BASE, RA, TMP0\r\n  |  ins_next2\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  subi TMP1, RD, 8\r\n  |   addi RD, RD, 8\r\n  |  stwx TISNIL, RA, TMP1\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc_n math_ .. func\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_1 math_ .. func\r\n  |   checknum CARG3; beqy ->fff_restv\r\n  |  rlwinm TMP2, CARG3, 12, 21, 31\r\n  |   bge ->fff_fallback\r\n  |  addic. TMP2, TMP2, -1023\t\t// exp = exponent(x) - 1023\r\n  |  cmplwi cr1, TMP2, 31\t\t// 0 <= exp < 31?\r\n  |   subfic TMP0, TMP2, 31\r\n  |  blt >3\r\n  |  slwi TMP1, CARG3, 11\r\n  |   srwi TMP3, CARG1, 21\r\n  |  oris TMP1, TMP1, 0x8000\r\n  |   addi TMP2, TMP2, 1\r\n  |  or TMP1, TMP1, TMP3\r\n  |   slwi CARG2, CARG1, 11\r\n  |  bge cr1, >4\r\n  |   slw TMP3, TMP1, TMP2\r\n  |  srw RD, TMP1, TMP0\r\n  |   or TMP3, TMP3, CARG2\r\n  |  srawi TMP2, CARG3, 31\r\n  |.if \"func\" == \"floor\"\r\n  |  and TMP1, TMP3, TMP2\r\n  |  addic TMP0, TMP1, -1\r\n  |  subfe TMP1, TMP0, TMP1\r\n  |  add CARG1, RD, TMP1\r\n  |  xor CARG1, CARG1, TMP2\r\n  |  sub CARG1, CARG1, TMP2\r\n  |  b ->fff_resi\r\n  |.else\r\n  |  andc TMP1, TMP3, TMP2\r\n  |  addic TMP0, TMP1, -1\r\n  |  subfe TMP1, TMP0, TMP1\r\n  |  add CARG1, RD, TMP1\r\n  |  cmpw CARG1, RD\r\n  |  xor CARG1, CARG1, TMP2\r\n  |  sub CARG1, CARG1, TMP2\r\n  |  bge ->fff_resi\r\n  |  // Overflow to 2^31.\r\n  |  lus CARG3, 0x41e0\t\t\t// 2^31.\r\n  |  li CARG1, 0\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |3:  // |x| < 1\r\n  |  slwi TMP2, CARG3, 1\r\n  |   srawi TMP1, CARG3, 31\r\n  |  or TMP2, CARG1, TMP2\t\t// ztest = (hi+hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  and TMP1, TMP2, TMP1\t\t// (ztest & sign) == 0 ? 0 : -1\r\n  |  subfic TMP2, TMP1, 0\r\n  |  subfe CARG1, CARG1, CARG1\r\n  |.else\r\n  |  andc TMP1, TMP2, TMP1\t\t// (ztest & ~sign) == 0 ? 0 : 1\r\n  |  addic TMP2, TMP1, -1\r\n  |  subfe CARG1, TMP2, TMP1\r\n  |.endif\r\n  |  b ->fff_resi\r\n  |4:  // exp >= 31. Check for -(2^31).\r\n  |  xoris TMP1, TMP1, 0x8000\r\n  |  srawi TMP2, CARG3, 31\r\n  |.if \"func\" == \"floor\"\r\n  |  or TMP1, TMP1, CARG2\r\n  |.endif\r\n  |.if PPE\r\n  |  orc TMP1, TMP1, TMP2\r\n  |  cmpwi TMP1, 0\r\n  |.else\r\n  |  orc. TMP1, TMP1, TMP2\r\n  |.endif\r\n  |  crand 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n  |  lus CARG1, 0x8000\t\t\t// -(2^31).\r\n  |  beqy ->fff_resi\r\n  |5:\r\n  |  lfd FARG1, 0(BASE)\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.if DUALNUM\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |.else\r\n  |  // NYI: use internal implementation.\r\n  |  math_extern floor\r\n  |  math_extern ceil\r\n  |.endif\r\n  |\r\n  |.if SQRT\r\n  |.ffunc_n math_sqrt\r\n  |  fsqrt FARG1, FARG1\r\n  |  b ->fff_resn\r\n  |.else\r\n  |  math_extern sqrt\r\n  |.endif\r\n  |\r\n  |.ffunc math_log\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  blex log\r\n  |  b ->fff_resn\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |->ff_math_deg:\r\n  |.ffunc_n math_rad\r\n  |  lfd FARG2, CFUNC:RB->upvalue[0]\r\n  |  fmul FARG1, FARG1, FARG2\r\n  |  b ->fff_resn\r\n  |\r\n  |.if DUALNUM\r\n  |.ffunc math_ldexp\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |.if GPR64\r\n  |    lwz CARG2, 12(BASE)\r\n  |.else\r\n  |    lwz CARG1, 12(BASE)\r\n  |.endif\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  checknum CARG4; bne ->fff_fallback\r\n  |.else\r\n  |.ffunc_nn math_ldexp\r\n  |.if GPR64\r\n  |  toint CARG2, FARG2\r\n  |.else\r\n  |  toint CARG1, FARG2\r\n  |.endif\r\n  |.endif\r\n  |  blex ldexp\r\n  |  b ->fff_resn\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |.if GPR64\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |.else\r\n  |  la CARG1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |.endif\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  blex frexp\r\n  |   lwz TMP1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   la RA, -8(BASE)\r\n  |.if not DUALNUM\r\n  |   tonum_i FARG2, TMP1\r\n  |.endif\r\n  |  stfd FARG1, 0(RA)\r\n  |  li RD, (2+1)*8\r\n  |.if DUALNUM\r\n  |   stw TISNUM, 8(RA)\r\n  |   stw TMP1, 12(RA)\r\n  |.else\r\n  |   stfd FARG2, 8(RA)\r\n  |.endif\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_n math_modf\r\n  |.if GPR64\r\n  |  la CARG2, -8(BASE)\r\n  |.else\r\n  |  la CARG1, -8(BASE)\r\n  |.endif\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  blex modf\r\n  |   la RA, -8(BASE)\r\n  |  stfd FARG1, 0(BASE)\r\n  |  li RD, (2+1)*8\r\n  |  b ->fff_res\r\n  |\r\n  |.macro math_minmax, name, ismax\r\n  |.if DUALNUM\r\n  |  .ffunc_1 name\r\n  |  checknum CARG3\r\n  |   addi TMP1, BASE, 8\r\n  |   add TMP2, BASE, NARGS8:RC\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |  lwz CARG2, 4(TMP1)\r\n  |   bge cr1, ->fff_resi\r\n  |  checknum CARG4\r\n  |   xoris TMP0, CARG1, 0x8000\r\n  |   xoris TMP3, CARG2, 0x8000\r\n  |  bne >3\r\n  |  subfc TMP3, TMP3, TMP0\r\n  |  subfe TMP0, TMP0, TMP0\r\n  |.if ismax\r\n  |  andc TMP3, TMP3, TMP0\r\n  |.else\r\n  |  and TMP3, TMP3, TMP0\r\n  |.endif\r\n  |  add CARG1, TMP3, CARG2\r\n  |.if GPR64\r\n  |  rldicl CARG1, CARG1, 0, 32\r\n  |.endif\r\n  |   addi TMP1, TMP1, 8\r\n  |  b <1\r\n  |3:\r\n  |  bge ->fff_fallback\r\n  |  // Convert intermediate result to number and continue below.\r\n  |  tonum_i FARG1, CARG1\r\n  |  lfd FARG2, 0(TMP1)\r\n  |  b >6\r\n  |4:\r\n  |   lfd FARG1, 0(BASE)\r\n  |  bge ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |  lfd FARG2, 0(TMP1)\r\n  |   bge cr1, ->fff_resn\r\n  |  checknum CARG4; bge >7\r\n  |6:\r\n  |  fsub f0, FARG1, FARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |.if ismax\r\n  |  fsel FARG1, f0, FARG1, FARG2\r\n  |.else\r\n  |  fsel FARG1, f0, FARG2, FARG1\r\n  |.endif\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |   lwz CARG2, 4(TMP1)\r\n  |  bne ->fff_fallback\r\n  |  tonum_i FARG2, CARG2\r\n  |  b <6\r\n  |.else\r\n  |  .ffunc_n name\r\n  |  li TMP1, 8\r\n  |1:\r\n  |   lwzx CARG2, BASE, TMP1\r\n  |   lfdx FARG2, BASE, TMP1\r\n  |  cmplw cr1, TMP1, NARGS8:RC\r\n  |   checknum CARG2\r\n  |  bge cr1, ->fff_resn\r\n  |   bge ->fff_fallback\r\n  |  fsub f0, FARG1, FARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |.if ismax\r\n  |  fsel FARG1, f0, FARG1, FARG2\r\n  |.else\r\n  |  fsel FARG1, f0, FARG2, FARG1\r\n  |.endif\r\n  |  b <1\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, 0\r\n  |  math_minmax math_max, 1\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc_1 string_len\r\n  |  checkstr CARG3; bne ->fff_fallback\r\n  |  lwz CRET1, STR:CARG1->len\r\n  |  b ->fff_resi\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |   checkstr CARG3\r\n  |   bne ->fff_fallback\r\n  |  lwz TMP0, STR:CARG1->len\r\n  |.if DUALNUM\r\n  |   lbz CARG1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   li RD, (0+1)*8\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  cmplwi TMP0, 0\r\n  |   la RA, -8(BASE)\r\n  |  beqy ->fff_res\r\n  |  b ->fff_resi\r\n  |.else\r\n  |   lbz TMP1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |  addic TMP3, TMP0, -1\t\t// RD = ((str->len != 0)+1)*8\r\n  |  subfe RD, TMP3, TMP0\r\n  |   stw TMP1, TONUM_LO\t\t// Inlined tonum_u f0, TMP1.\r\n  |  addi RD, RD, 1\r\n  |   lfd f0, TONUM_D\r\n  |  la RA, -8(BASE)\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |   fsub f0, f0, TOBIT\r\n  |  slwi RD, RD, 3\r\n  |   stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP0, 4(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 1 argument.\r\n  |  checknum CARG3; bne ->fff_fallback\r\n  |   la CARG2, 7(BASE)\r\n  |.else\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 1 argument.\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  toint TMP0, FARG1\r\n  |   la CARG2, TMPD_BLO\r\n  |.endif\r\n  |   li CARG3, 1\r\n  |  cmplwi TMP0, 255; bgt ->fff_fallback\r\n  |->fff_newstr:\r\n  |  mr CARG1, L\r\n  |  stp BASE, L->base\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |  // Returns GCstr *.\r\n  |  lp BASE, L->base\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 16(BASE)\r\n  |.if not DUALNUM\r\n  |    lfd f0, 16(BASE)\r\n  |.endif\r\n  |   lwz TMP0, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |   lwz CARG2, 8(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP1, 12(BASE)\r\n  |.else\r\n  |    lfd f1, 8(BASE)\r\n  |.endif\r\n  |   li TMP2, -1\r\n  |  beq >1\r\n  |.if DUALNUM\r\n  |  checknum CARG3\r\n  |   lwz TMP2, 20(BASE)\r\n  |  bne ->fff_fallback\r\n  |1:\r\n  |  checknum CARG2; bne ->fff_fallback\r\n  |.else\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  toint TMP2, f0\r\n  |1:\r\n  |  checknum CARG2; bge ->fff_fallback\r\n  |.endif\r\n  |  checkstr TMP0; bne ->fff_fallback\r\n  |.if not DUALNUM\r\n  |   toint TMP1, f1\r\n  |.endif\r\n  |   lwz TMP0, STR:CARG1->len\r\n  |  cmplw TMP0, TMP2\t\t\t// len < end? (unsigned compare)\r\n  |   addi TMP3, TMP2, 1\r\n  |  blt >5\r\n  |2:\r\n  |  cmpwi TMP1, 0\t\t\t// start <= 0?\r\n  |   add TMP3, TMP1, TMP0\r\n  |  ble >7\r\n  |3:\r\n  |  sub CARG3, TMP2, TMP1\r\n  |    addi CARG2, STR:CARG1, #STR-1\r\n  |  srawi TMP0, CARG3, 31\r\n  |   addi CARG3, CARG3, 1\r\n  |    add CARG2, CARG2, TMP1\r\n  |  andc CARG3, CARG3, TMP0\r\n  |.if GPR64\r\n  |  rldicl CARG2, CARG2, 0, 32\r\n  |  rldicl CARG3, CARG3, 0, 32\r\n  |.endif\r\n  |  b ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  cmpw TMP0, TMP2\t\t\t// len >= end? (signed compare)\r\n  |   add TMP2, TMP0, TMP3\t\t// Negative end: end = end+len+1.\r\n  |  bge <2\r\n  |   mr TMP2, TMP0\t\t\t// Overflow: end = len.\r\n  |  b <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |  .gpr64 extsw TMP1, TMP1\r\n  |  addic CARG3, TMP1, -1\r\n  |  subfe CARG3, CARG3, CARG3\r\n  |   srawi CARG2, TMP3, 31\t\t// Note: modifies carry.\r\n  |  andc TMP3, TMP3, CARG3\r\n  |   andc TMP1, TMP3, CARG2\r\n  |  addi TMP1, TMP1, 1\t\t\t// start = 1 + (start ? start+len : 0)\r\n  |  b <3\r\n  |\r\n  |.ffunc string_rep\t\t\t// Only handle the 1-char case inline.\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz TMP0, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |.if DUALNUM\r\n  |    lwz CARG3, 12(BASE)\r\n  |.else\r\n  |    lfd FARG2, 8(BASE)\r\n  |.endif\r\n  |  bne ->fff_fallback\t\t\t// Exactly 2 arguments.\r\n  |  checkstr TMP0; bne ->fff_fallback\r\n  |.if DUALNUM\r\n  |  checknum CARG4; bne ->fff_fallback\r\n  |.else\r\n  |  checknum CARG4; bge ->fff_fallback\r\n  |    toint CARG3, FARG2\r\n  |.endif\r\n  |   lwz TMP0, STR:CARG1->len\r\n  |  cmpwi CARG3, 0\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  ble >2\t\t\t\t// Count <= 0? (or non-int)\r\n  |   cmplwi TMP0, 1\r\n  |  subi TMP2, CARG3, 1\r\n  |   blt >2\t\t\t\t// Zero length string?\r\n  |  cmplw cr1, TMP1, CARG3\r\n  |   bne ->fff_fallback\t\t// Fallback for > 1-char strings.\r\n  |   lbz TMP0, STR:CARG1[1]\r\n  |   lp CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  blt cr1, ->fff_fallback\r\n  |1:  // Fill buffer with char. Yes, this is suboptimal code (do you care?).\r\n  |  cmplwi TMP2, 0\r\n  |   stbx TMP0, CARG2, TMP2\r\n  |   subi TMP2, TMP2, 1\r\n  |  bne <1\r\n  |  b ->fff_newstr\r\n  |2:  // Return empty string.\r\n  |  la STR:CARG1, DISPATCH_GL(strempty)(DISPATCH)\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_reverse\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checkstr CARG3\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  bne ->fff_fallback\r\n  |  lwz CARG3, STR:CARG1->len\r\n  |   la CARG1, #STR(STR:CARG1)\r\n  |   lp CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |   li TMP2, 0\r\n  |  cmplw TMP1, CARG3\r\n  |   subi TMP3, CARG3, 1\r\n  |  blt ->fff_fallback\r\n  |1:  // Reverse string copy.\r\n  |  cmpwi TMP3, 0\r\n  |   lbzx TMP1, CARG1, TMP2\r\n  |  blty ->fff_newstr\r\n  |   stbx TMP1, CARG2, TMP3\r\n  |  subi TMP3, TMP3, 1\r\n  |  addi TMP2, TMP2, 1\r\n  |  b <1\r\n  |\r\n  |.macro ffstring_case, name, lo\r\n  |  .ffunc name\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checkstr CARG3\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  bne ->fff_fallback\r\n  |  lwz CARG3, STR:CARG1->len\r\n  |   la CARG1, #STR(STR:CARG1)\r\n  |   lp CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  cmplw TMP1, CARG3\r\n  |   li TMP2, 0\r\n  |  blt ->fff_fallback\r\n  |1:  // ASCII case conversion.\r\n  |  cmplw TMP2, CARG3\r\n  |   lbzx TMP1, CARG1, TMP2\r\n  |  bgey ->fff_newstr\r\n  |   subi TMP0, TMP1, lo\r\n  |    xori TMP3, TMP1, 0x20\r\n  |   addic TMP0, TMP0, -26\r\n  |   subfe TMP3, TMP3, TMP3\r\n  |   rlwinm TMP3, TMP3, 0, 26, 26\t// x &= 0x20.\r\n  |   xor TMP1, TMP1, TMP3\r\n  |   stbx TMP1, CARG2, TMP2\r\n  |  addi TMP2, TMP2, 1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |ffstring_case string_lower, 65\r\n  |ffstring_case string_upper, 97\r\n  |\r\n  |//-- Table library ------------------------------------------------------\r\n  |\r\n  |.ffunc_1 table_getn\r\n  |  checktab CARG3; bne ->fff_fallback\r\n  |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n  |  // Returns uint32_t (but less than 2^31).\r\n  |  b ->fff_resi\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |.if DUALNUM\r\n  |  .ffunc_1 bit_..name\r\n  |  checknum CARG3; bnel ->fff_tobit_fb\r\n  |.else\r\n  |  .ffunc_n bit_..name\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  addi TMP1, BASE, 8\r\n  |  add TMP2, BASE, NARGS8:RC\r\n  |1:\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |.if DUALNUM\r\n  |  lwz CARG2, 4(TMP1)\r\n  |.else\r\n  |  lfd FARG1, 0(TMP1)\r\n  |.endif\r\n  |   bgey cr1, ->fff_resi\r\n  |  checknum CARG4\r\n  |.if DUALNUM\r\n  |  bnel ->fff_bitop_fb\r\n  |.else\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  bge ->fff_fallback\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |.endif\r\n  |  ins CARG1, CARG1, CARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, or\r\n  |.ffunc_bit_op bxor, xor\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  rotlwi TMP0, CARG1, 8\r\n  |  rlwimi TMP0, CARG1, 24, 0, 7\r\n  |  rlwimi TMP0, CARG1, 24, 16, 23\r\n  |  mr CRET1, TMP0\r\n  |  b ->fff_resi\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  not CRET1, CARG1\r\n  |  b ->fff_resi\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |.if DUALNUM\r\n  |  .ffunc_2 bit_..name\r\n  |  checknum CARG3; bnel ->fff_tobit_fb\r\n  |  // Note: no inline conversion from number for 2nd argument!\r\n  |  checknum CARG4; bne ->fff_fallback\r\n  |.else\r\n  |  .ffunc_nn bit_..name\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  fadd FARG2, FARG2, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |  stfd FARG2, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |.endif\r\n  |.if shmod == 1\r\n  |  rlwinm CARG2, CARG2, 0, 27, 31\r\n  |.elif shmod == 2\r\n  |  neg CARG2, CARG2\r\n  |.endif\r\n  |  ins CRET1, CARG1, CARG2\r\n  |  b ->fff_resi\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, slw, 1\r\n  |.ffunc_bit_sh rshift, srw, 1\r\n  |.ffunc_bit_sh arshift, sraw, 1\r\n  |.ffunc_bit_sh rol, rotlw, 0\r\n  |.ffunc_bit_sh ror, rotlw, 2\r\n  |\r\n  |.ffunc_bit tobit\r\n  |.if DUALNUM\r\n  |  b ->fff_resi\r\n  |.else\r\n  |->fff_resi:\r\n  |  tonum_i FARG1, CRET1\r\n  |.endif\r\n  |->fff_resn:\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |  la RA, -8(BASE)\r\n  |  stfd FARG1, -8(BASE)\r\n  |  b ->fff_res1\r\n  |\r\n  |// Fallback FP number to bit conversion.\r\n  |->fff_tobit_fb:\r\n  |.if DUALNUM\r\n  |  lfd FARG1, 0(BASE)\r\n  |  bgt ->fff_fallback\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |  blr\r\n  |.endif\r\n  |->fff_bitop_fb:\r\n  |.if DUALNUM\r\n  |  lfd FARG1, 0(TMP1)\r\n  |  bgt ->fff_fallback\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |  blr\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RB = CFUNC, RC = nargs*8\r\n  |  lp TMP3, CFUNC:RB->f\r\n  |    add TMP1, BASE, NARGS8:RC\r\n  |   lwz PC, FRAME_PC(BASE)\t\t// Fallback may overwrite PC.\r\n  |    addi TMP0, TMP1, 8*LUA_MINSTACK\r\n  |     lwz TMP2, L->maxstack\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  .toc lp TMP3, 0(TMP3)\r\n  |  cmplw TMP0, TMP2\r\n  |     stp BASE, L->base\r\n  |    stp TMP1, L->top\r\n  |   mr CARG1, L\r\n  |  bgt >5\t\t\t\t// Need to grow stack.\r\n  |  mtctr TMP3\r\n  |  bctrl\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  lp BASE, L->base\r\n  |  cmpwi CRET1, 0\r\n  |   slwi RD, CRET1, 3\r\n  |   la RA, -8(BASE)\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |  lp TMP0, L->top\r\n  |   lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   rlwinm TMP1, PC, 0, 0, 28\r\n  |  bne >3\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RA8 TMP1, INS\r\n  |  addi TMP1, TMP1, 8\r\n  |3:\r\n  |  sub TMP2, BASE, TMP1\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lp BASE, L->base\r\n  |  cmpw TMP0, TMP0\t\t\t// Set 4*cr0+eq to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  mflr SAVE0\r\n  |   stp BASE, L->base\r\n  |  add TMP0, BASE, NARGS8:RC\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  stp TMP0, L->top\r\n  |  mr CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |   lp BASE, L->base\r\n  |  mtlr SAVE0\r\n  |    lp TMP0, L->top\r\n  |   sub NARGS8:RC, TMP0, BASE\r\n  |   lwz CFUNC:RB, FRAME_FUNC(BASE)\r\n  |  blr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_VMEVENT\t// No recording while in vmevent.\r\n  |  bne >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |   lwz TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\r\n  |  bne >1\r\n  |   subi TMP2, TMP2, 1\r\n  |  andi. TMP0, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqy >1\r\n  |   stw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |  beq >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\t// Assumes decode_OPP TMP1, INS.\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  lwz TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |   rlwinm TMP0, TMP3, 31-LUA_HOOKLINE, 31, 0\r\n  |  bne <5\r\n  |\r\n  |   cmpwi cr1, TMP0, 0\r\n  |  addic. TMP2, TMP2, -1\r\n  |   beq cr1, <5\r\n  |  stw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  beq >1\r\n  |   bge cr1, <5\r\n  |1:\r\n  |  mr CARG1, L\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  mr CARG2, PC\r\n  |   stp BASE, L->base\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  lp BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  lwz INS, -4(PC)\r\n  |  decode_OPP TMP1, INS\r\n  |   decode_RB8 RB, INS\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\r\n  |   decode_RD8 RD, INS\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RC8 RC, INS\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  addi PC, PC, 4\r\n  |  lwz MULTRES, -20(RB)\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |   addi CARG1, DISPATCH, GG_DISP2J\r\n  |   stw PC, SAVE_PC\r\n  |  lwz TMP1, LFUNC:TMP1->pc\r\n  |   mr CARG2, PC\r\n  |   stw L, DISPATCH_J(L)(DISPATCH)\r\n  |  lbz TMP1, PC2PROTO(framesize)(TMP1)\r\n  |   stp BASE, L->base\r\n  |  slwi TMP1, TMP1, 3\r\n  |  add TMP1, BASE, TMP1\r\n  |  stp TMP1, L->top\r\n  |  bl extern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mr CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  ori CARG2, PC, 1\r\n  |1:\r\n  |.endif\r\n  |  add TMP0, BASE, RC\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  sub RA, RA, BASE\r\n  |   stp TMP0, L->top\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  lp BASE, L->base\r\n  |   lp TMP0, L->top\r\n  |   stw ZERO, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  add RA, BASE, RA\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  lwz INS, -4(PC)\r\n  |  mtctr CRET1\r\n  |  bctr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro savex_, a, b, c, d\r\n  |  stfd f..a, 16+a*8(sp)\r\n  |  stfd f..b, 16+b*8(sp)\r\n  |  stfd f..c, 16+c*8(sp)\r\n  |  stfd f..d, 16+d*8(sp)\r\n  |.endmacro\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  addi sp, sp, -(16+32*8+32*4)\r\n  |  stmw r2, 16+32*8+2*4(sp)\r\n  |    addi DISPATCH, JGL, -GG_DISP2G-32768\r\n  |    li CARG2, ~LJ_VMST_EXIT\r\n  |   lwz CARG1, 16+32*8+32*4(sp)\t// Get stack chain.\r\n  |    stw CARG2, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  savex_ 0,1,2,3\r\n  |   stw CARG1, 0(sp)\t\t\t// Store extended stack chain.\r\n  |   clrso TMP1\r\n  |  savex_ 4,5,6,7\r\n  |   addi CARG2, sp, 16+32*8+32*4\t// Recompute original value of sp.\r\n  |  savex_ 8,9,10,11\r\n  |   stw CARG2, 16+32*8+1*4(sp)\t// Store sp in RID_SP.\r\n  |  savex_ 12,13,14,15\r\n  |   mflr CARG3\r\n  |   li TMP1, 0\r\n  |  savex_ 16,17,18,19\r\n  |   stw TMP1, 16+32*8+0*4(sp)\t\t// Clear RID_TMP.\r\n  |  savex_ 20,21,22,23\r\n  |   lhz CARG4, 2(CARG3)\t\t// Load trace number.\r\n  |  savex_ 24,25,26,27\r\n  |  lwz L, DISPATCH_GL(jit_L)(DISPATCH)\r\n  |  savex_ 28,29,30,31\r\n  |   sub CARG3, TMP0, CARG3\t\t// Compute exit number.\r\n  |  lp BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |   srwi CARG3, CARG3, 2\r\n  |  stw L, DISPATCH_J(L)(DISPATCH)\r\n  |   subi CARG3, CARG3, 2\r\n  |  stw TMP1, DISPATCH_GL(jit_L)(DISPATCH)\r\n  |   stw CARG4, DISPATCH_J(parent)(DISPATCH)\r\n  |  stp BASE, L->base\r\n  |  addi CARG1, DISPATCH, GG_DISP2J\r\n  |   stw CARG3, DISPATCH_J(exitno)(DISPATCH)\r\n  |  addi CARG2, sp, 16\r\n  |  bl extern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  lp TMP1, L->cframe\r\n  |  lwz TMP2, 0(sp)\r\n  |   lp BASE, L->base\r\n  |.if GPR64\r\n  |  rldicr sp, TMP1, 0, 61\r\n  |.else\r\n  |  rlwinm sp, TMP1, 0, 0, 29\r\n  |.endif\r\n  |   lwz PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  stw TMP2, 0(sp)\r\n  |  stw L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |  b >1\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |.if JIT\r\n  |  // CARG1 = MULTRES or negated error code, BASE, PC and JGL set.\r\n  |  lwz L, SAVE_L\r\n  |  addi DISPATCH, JGL, -GG_DISP2G-32768\r\n  |1:\r\n  |  cmpwi CARG1, 0\r\n  |  blt >3\t\t\t\t// Check for error from exit.\r\n  |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |   slwi MULTRES, CARG1, 3\r\n  |    li TMP2, 0\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  lwz TMP1, LFUNC:TMP1->pc\r\n  |    stw TMP2, DISPATCH_GL(jit_L)(DISPATCH)\r\n  |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |  // Setup type comparison constants.\r\n  |  li TISNUM, LJ_TISNUM\r\n  |  lus TMP3, 0x59c0\t\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  stw TMP3, TMPD\r\n  |  li ZERO, 0\r\n  |  ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |  lfs TOBIT, TMPD\r\n  |  stw TMP3, TMPD\r\n  |  lus TMP0, 0x4338\t\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |    li TISNIL, LJ_TNIL\r\n  |  stw TMP0, TONUM_HI\r\n  |  lfs TONUM, TMPD\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  lwz INS, 0(PC)\r\n  |   addi PC, PC, 4\r\n  |    // Assumes TISNIL == ~LJ_VMST_INTERP == -1.\r\n  |    stw TISNIL, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  decode_OPP TMP1, INS\r\n  |   decode_RA8 RA, INS\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |  mtctr TMP0\r\n  |  cmplwi TMP1, BC_FUNCF*4\t\t// Function header?\r\n  |  bge >2\r\n  |   decode_RB8 RB, INS\r\n  |   decode_RD8 RD, INS\r\n  |   decode_RC8 RC, INS\r\n  |  bctr\r\n  |2:\r\n  |   subi RC, MULTRES, 8\r\n  |   add RA, RA, BASE\r\n  |  bctr\r\n  |\r\n  |3:  // Rethrow error from the right C frame.\r\n  |  neg CARG2, CARG1\r\n  |  mr CARG1, L\r\n  |  bl extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// NYI: Use internal implementations of floor, ceil, trunc.\r\n  |\r\n  |->vm_modi:\r\n  |  divwo. TMP0, CARG1, CARG2\r\n  |  bso >1\r\n  |.if GPR64\r\n  |   xor CARG3, CARG1, CARG2\r\n  |   cmpwi CARG3, 0\r\n  |.else\r\n  |   xor. CARG3, CARG1, CARG2\r\n  |.endif\r\n  |  mullw TMP0, TMP0, CARG2\r\n  |  sub CARG1, CARG1, TMP0\r\n  |   bgelr\r\n  |  cmpwi CARG1, 0; beqlr\r\n  |  add CARG1, CARG1, CARG2\r\n  |  blr\r\n  |1:\r\n  |  cmpwi CARG2, 0\r\n  |   li CARG1, 0\r\n  |  beqlr\r\n  |  clrso TMP0\t\t\t// Clear SO for -2147483648 % -1 and return 0.\r\n  |  blr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// void lj_vm_cachesync(void *start, void *end)\r\n  |// Flush D-Cache and invalidate I-Cache. Assumes 32 byte cache line size.\r\n  |// This is a good lower bound, except for very ancient PPC models.\r\n  |->vm_cachesync:\r\n  |.if JIT or FFI\r\n  |  // Compute start of first cache line and number of cache lines.\r\n  |  rlwinm CARG1, CARG1, 0, 0, 26\r\n  |  sub CARG2, CARG2, CARG1\r\n  |  addi CARG2, CARG2, 31\r\n  |  rlwinm. CARG2, CARG2, 27, 5, 31\r\n  |  beqlr\r\n  |  mtctr CARG2\r\n  |  mr CARG3, CARG1\r\n  |1:  // Flush D-Cache.\r\n  |  dcbst r0, CARG1\r\n  |  addi CARG1, CARG1, 32\r\n  |  bdnz <1\r\n  |  sync\r\n  |  mtctr CARG2\r\n  |1:  // Invalidate I-Cache.\r\n  |  icbi r0, CARG3\r\n  |  addi CARG3, CARG3, 32\r\n  |  bdnz <1\r\n  |  isync\r\n  |  blr\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in r11, g in r12.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs\r\n  |  lwz CTSTATE, GL:r12->ctype_state\r\n  |   addi DISPATCH, r12, GG_G2DISP\r\n  |  stw r11, CTSTATE->cb.slot\r\n  |  stw r3, CTSTATE->cb.gpr[0]\r\n  |   stfd f1, CTSTATE->cb.fpr[0]\r\n  |  stw r4, CTSTATE->cb.gpr[1]\r\n  |   stfd f2, CTSTATE->cb.fpr[1]\r\n  |  stw r5, CTSTATE->cb.gpr[2]\r\n  |   stfd f3, CTSTATE->cb.fpr[2]\r\n  |  stw r6, CTSTATE->cb.gpr[3]\r\n  |   stfd f4, CTSTATE->cb.fpr[3]\r\n  |  stw r7, CTSTATE->cb.gpr[4]\r\n  |   stfd f5, CTSTATE->cb.fpr[4]\r\n  |  stw r8, CTSTATE->cb.gpr[5]\r\n  |   stfd f6, CTSTATE->cb.fpr[5]\r\n  |  stw r9, CTSTATE->cb.gpr[6]\r\n  |   stfd f7, CTSTATE->cb.fpr[6]\r\n  |  stw r10, CTSTATE->cb.gpr[7]\r\n  |   stfd f8, CTSTATE->cb.fpr[7]\r\n  |  addi TMP0, sp, CFRAME_SPACE+8\r\n  |  stw TMP0, CTSTATE->cb.stack\r\n  |   mr CARG1, CTSTATE\r\n  |  stw CTSTATE, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |   mr CARG2, sp\r\n  |  bl extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // Returns lua_State *.\r\n  |  lp BASE, L:CRET1->base\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |  lp RC, L:CRET1->top\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |     li ZERO, 0\r\n  |   mr L, CRET1\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     stw TMP0, TONUM_HI\r\n  |     li TISNIL, LJ_TNIL\r\n  |    li_vmstate INTERP\r\n  |     lfs TOBIT, TMPD\r\n  |     stw TMP3, TMPD\r\n  |  sub RC, RC, BASE\r\n  |    st_vmstate\r\n  |     lfs TONUM, TMPD\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  lwz CTSTATE, DISPATCH_GL(ctype_state)(DISPATCH)\r\n  |   stp BASE, L->base\r\n  |   stp RB, L->top\r\n  |  stp L, CTSTATE->L\r\n  |  mr CARG1, CTSTATE\r\n  |  mr CARG2, RA\r\n  |  bl extern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |  lwz CRET1, CTSTATE->cb.gpr[0]\r\n  |  lfd FARG1, CTSTATE->cb.fpr[0]\r\n  |  lwz CRET2, CTSTATE->cb.gpr[1]\r\n  |  b ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, CARG1\r\n  |  lwz TMP1, CCSTATE->spadj\r\n  |    mflr TMP0\r\n  |   lbz CARG2, CCSTATE->nsp\r\n  |   lbz CARG3, CCSTATE->nfpr\r\n  |  neg TMP1, TMP1\r\n  |    stw TMP0, 4(sp)\r\n  |   cmpwi cr1, CARG3, 0\r\n  |  mr TMP2, sp\r\n  |   addic. CARG2, CARG2, -1\r\n  |  stwux sp, sp, TMP1\r\n  |   crnot 4*cr1+eq, 4*cr1+eq\t\t// For vararg calls.\r\n  |  stw r14, -4(TMP2)\r\n  |  stw CCSTATE, -8(TMP2)\r\n  |  mr r14, TMP2\r\n  |  la TMP1, CCSTATE->stack\r\n  |   slwi CARG2, CARG2, 2\r\n  |   blty >2\r\n  |  la TMP2, 8(sp)\r\n  |1:\r\n  |  lwzx TMP0, TMP1, CARG2\r\n  |  stwx TMP0, TMP2, CARG2\r\n  |   addic. CARG2, CARG2, -4\r\n  |  bge <1\r\n  |2:\r\n  |  bney cr1, >3\r\n  |  lfd f1, CCSTATE->fpr[0]\r\n  |  lfd f2, CCSTATE->fpr[1]\r\n  |  lfd f3, CCSTATE->fpr[2]\r\n  |  lfd f4, CCSTATE->fpr[3]\r\n  |  lfd f5, CCSTATE->fpr[4]\r\n  |  lfd f6, CCSTATE->fpr[5]\r\n  |  lfd f7, CCSTATE->fpr[6]\r\n  |  lfd f8, CCSTATE->fpr[7]\r\n  |3:\r\n  |   lp TMP0, CCSTATE->func\r\n  |  lwz CARG2, CCSTATE->gpr[1]\r\n  |  lwz CARG3, CCSTATE->gpr[2]\r\n  |  lwz CARG4, CCSTATE->gpr[3]\r\n  |  lwz CARG5, CCSTATE->gpr[4]\r\n  |   mtctr TMP0\r\n  |  lwz r8, CCSTATE->gpr[5]\r\n  |  lwz r9, CCSTATE->gpr[6]\r\n  |  lwz r10, CCSTATE->gpr[7]\r\n  |  lwz CARG1, CCSTATE->gpr[0]\t\t// Do this last, since CCSTATE is CARG1.\r\n  |   bctrl\r\n  |  lwz CCSTATE:TMP1, -8(r14)\r\n  |  lwz TMP2, -4(r14)\r\n  |   lwz TMP0, 4(r14)\r\n  |  stw CARG1, CCSTATE:TMP1->gpr[0]\r\n  |  stfd FARG1, CCSTATE:TMP1->fpr[0]\r\n  |  stw CARG2, CCSTATE:TMP1->gpr[1]\r\n  |   mtlr TMP0\r\n  |  stw CARG3, CCSTATE:TMP1->gpr[2]\r\n  |   mr sp, r14\r\n  |  stw CARG4, CCSTATE:TMP1->gpr[3]\r\n  |   mr r14, TMP2\r\n  |  blr\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, BASE\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr0, TMP0\r\n    |   lwz CARG3, 4(RD)\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  checknum cr1, TMP1\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bne cr0, >7\r\n    |  bne cr1, >8\r\n    |   cmpw CARG2, CARG3\r\n    if (op == BC_ISLT) {\r\n      |  bge >2\r\n    } else if (op == BC_ISGE) {\r\n      |  blt >2\r\n    } else if (op == BC_ISLE) {\r\n      |  bgt >2\r\n    } else {\r\n      |  ble >2\r\n    }\r\n    |1:\r\n    |  add PC, PC, TMP2\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  bgt cr0, ->vmeta_comp\r\n    |  // RA is a number.\r\n    |   lfd f0, 0(RA)\r\n    |  bgt cr1, ->vmeta_comp\r\n    |  blt cr1, >4\r\n    |  // RA is a number, RD is an integer.\r\n    |  tonum_i f1, CARG3\r\n    |  b >5\r\n    |\r\n    |8: // RA is an integer, RD is not an integer.\r\n    |  bgt cr1, ->vmeta_comp\r\n    |  // RA is an integer, RD is a number.\r\n    |  tonum_i f0, CARG2\r\n    |4:\r\n    |  lfd f1, 0(RD)\r\n    |5:\r\n    |  fcmpu cr0, f0, f1\r\n    if (op == BC_ISLT) {\r\n      |  bge <2\r\n    } else if (op == BC_ISGE) {\r\n      |  blt <2\r\n    } else if (op == BC_ISLE) {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  bge <2\r\n    } else {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  blt <2\r\n    }\r\n    |  b <1\r\n    |.else\r\n    |  lwzx TMP0, BASE, RA\r\n    |    addi PC, PC, 4\r\n    |   lfdx f0, BASE, RA\r\n    |  lwzx TMP1, BASE, RD\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |   lfdx f1, BASE, RD\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  bge cr0, ->vmeta_comp\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge cr1, ->vmeta_comp\r\n    |  fcmpu cr0, f0, f1\r\n    if (op == BC_ISLT) {\r\n      |  bge >1\r\n    } else if (op == BC_ISGE) {\r\n      |  blt >1\r\n    } else if (op == BC_ISLE) {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  bge >1\r\n    } else {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  blt >1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, BASE\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |   lwz CARG3, 4(RD)\r\n    |  cror 4*cr7+gt, 4*cr0+gt, 4*cr1+gt\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    if (vk) {\r\n      |  ble cr7, ->BC_ISEQN_Z\r\n    } else {\r\n      |  ble cr7, ->BC_ISNEN_Z\r\n    }\r\n    |.else\r\n    |  lwzux TMP0, RA, BASE\r\n    |   lwz TMP2, 0(PC)\r\n    |    lfd f0, 0(RA)\r\n    |   addi PC, PC, 4\r\n    |  lwzux TMP1, RD, BASE\r\n    |  checknum cr0, TMP0\r\n    |   decode_RD4 TMP2, TMP2\r\n    |    lfd f1, 0(RD)\r\n    |  checknum cr1, TMP1\r\n    |   addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge cr0, >5\r\n    |  bge cr1, >5\r\n    |  fcmpu cr0, f0, f1\r\n    if (vk) {\r\n      |  bne >1\r\n      |  add PC, PC, TMP2\r\n    } else {\r\n      |  beq >1\r\n      |  add PC, PC, TMP2\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    |5:  // Either or both types are not numbers.\r\n    |.if not DUALNUM\r\n    |    lwz CARG2, 4(RA)\r\n    |    lwz CARG3, 4(RD)\r\n    |.endif\r\n    |.if FFI\r\n    |  cmpwi cr7, TMP0, LJ_TCDATA\r\n    |  cmpwi cr5, TMP1, LJ_TCDATA\r\n    |.endif\r\n    |   not TMP3, TMP0\r\n    |  cmplw TMP0, TMP1\r\n    |   cmplwi cr1, TMP3, ~LJ_TISPRI\t\t// Primitive?\r\n    |.if FFI\r\n    |  cror 4*cr7+eq, 4*cr7+eq, 4*cr5+eq\r\n    |.endif\r\n    |   cmplwi cr6, TMP3, ~LJ_TISTABUD\t\t// Table or userdata?\r\n    |.if FFI\r\n    |  beq cr7, ->vmeta_equal_cd\r\n    |.endif\r\n    |    cmplw cr5, CARG2, CARG3\r\n    |  crandc 4*cr0+gt, 4*cr0+eq, 4*cr1+gt\t// 2: Same type and primitive.\r\n    |  crorc 4*cr0+lt, 4*cr5+eq, 4*cr0+eq\t// 1: Same tv or different type.\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr5+eq\t// 0: Same type and same tv.\r\n    |   mr SAVE0, PC\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr0+gt\t// 0 or 2.\r\n    |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+gt\t// 1 or 2.\r\n    if (vk) {\r\n      |  bne cr0, >6\r\n      |  add PC, PC, TMP2\r\n      |6:\r\n    } else {\r\n      |  beq cr0, >6\r\n      |  add PC, PC, TMP2\r\n      |6:\r\n    }\r\n    |.if DUALNUM\r\n    |  bge cr0, >2\t\t\t// Done if 1 or 2.\r\n    |1:\r\n    |  ins_next\r\n    |2:\r\n    |.else\r\n    |  blt cr0, <1\t\t\t// Done if 1 or 2.\r\n    |.endif\r\n    |  blt cr6, <1\t\t\t// Done if not tab/ud.\r\n    |\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  lwz TAB:TMP2, TAB:CARG2->metatable\r\n    |   li CARG4, 1-vk\t\t\t// ne = 0 or 1.\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable?\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_eq\r\n    |  bne <1\t\t\t\t// Or 'no __eq' flag set?\r\n    |  mr PC, SAVE0\t\t\t// Restore old PC.\r\n    |  b ->vmeta_equal\t\t\t// Handle __eq metamethod.\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RD = str_const*8 (~), JMP with RD = target\r\n    |  lwzux TMP0, RA, BASE\r\n    |   srwi RD, RD, 1\r\n    |  lwz STR:TMP3, 4(RA)\r\n    |    lwz TMP2, 0(PC)\r\n    |   subfic RD, RD, -4\r\n    |    addi PC, PC, 4\r\n    |.if FFI\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |.endif\r\n    |   lwzx STR:TMP1, KBASE, RD\t// KBASE-4-str_const*4\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  subfic TMP0, TMP0, LJ_TSTR\r\n    |.if FFI\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  sub TMP1, STR:TMP1, STR:TMP3\r\n    |  or TMP0, TMP0, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  subfic TMP0, TMP0, 0\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  subfe TMP1, TMP1, TMP1\r\n    if (vk) {\r\n      |  andc TMP2, TMP2, TMP1\r\n    } else {\r\n      |  and TMP2, TMP2, TMP1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RD = num_const*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, KBASE\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |   lwz CARG3, 4(RD)\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:\r\n    } else {\r\n      |->BC_ISNEN_Z:\r\n    }\r\n    |  bne cr0, >7\r\n    |  bne cr1, >8\r\n    |   cmpw CARG2, CARG3\r\n    |4:\r\n    |.else\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:  // Dummy label.\r\n    } else {\r\n      |->BC_ISNEN_Z:  // Dummy label.\r\n    }\r\n    |  lwzx TMP0, BASE, RA\r\n    |    addi PC, PC, 4\r\n    |   lfdx f0, BASE, RA\r\n    |    lwz TMP2, -4(PC)\r\n    |  lfdx f1, KBASE, RD\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  checknum TMP0\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge >3\r\n    |  fcmpu cr0, f0, f1\r\n    |.endif\r\n    if (vk) {\r\n      |  bne >1\r\n      |  add PC, PC, TMP2\r\n      |1:\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n    } else {\r\n      |  beq >2\r\n      |1:\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n      |  add PC, PC, TMP2\r\n      |2:\r\n    }\r\n    |  ins_next\r\n    |.if FFI\r\n    |3:\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |  b <1\r\n    |.endif\r\n    |.if DUALNUM\r\n    |7:  // RA is not an integer.\r\n    |  bge cr0, <3\r\n    |  // RA is a number.\r\n    |   lfd f0, 0(RA)\r\n    |  blt cr1, >1\r\n    |  // RA is a number, RD is an integer.\r\n    |  tonum_i f1, CARG3\r\n    |  b >2\r\n    |\r\n    |8: // RA is an integer, RD is a number.\r\n    |  tonum_i f0, CARG2\r\n    |1:\r\n    |  lfd f1, 0(RD)\r\n    |2:\r\n    |  fcmpu cr0, f0, f1\r\n    |  b <4\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RD = primitive_type*8 (~), JMP with RD = target\r\n    |  lwzx TMP0, BASE, RA\r\n    |   srwi TMP1, RD, 3\r\n    |    lwz TMP2, 0(PC)\r\n    |   not TMP1, TMP1\r\n    |    addi PC, PC, 4\r\n    |.if FFI\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |.endif\r\n    |  sub TMP0, TMP0, TMP1\r\n    |.if FFI\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  addic TMP0, TMP0, -1\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  subfe TMP1, TMP1, TMP1\r\n    if (vk) {\r\n      |  and TMP2, TMP2, TMP1\r\n    } else {\r\n      |  andc TMP2, TMP2, TMP1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RD = src*8, JMP with RD = target\r\n    |  lwzx TMP0, BASE, RD\r\n    |   lwz INS, 0(PC)\r\n    |   addi PC, PC, 4\r\n    if (op == BC_IST || op == BC_ISF) {\r\n      |  .gpr64 extsw TMP0, TMP0\r\n      |  subfic TMP0, TMP0, LJ_TTRUE\r\n      |   decode_RD4 TMP2, INS\r\n      |  subfe TMP1, TMP1, TMP1\r\n      |   addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n      if (op == BC_IST) {\r\n\t|  andc TMP2, TMP2, TMP1\r\n      } else {\r\n\t|  and TMP2, TMP2, TMP1\r\n      }\r\n      |  add PC, PC, TMP2\r\n    } else {\r\n      |  li TMP1, LJ_TFALSE\r\n      |   lfdx f0, BASE, RD\r\n      |  cmplw TMP0, TMP1\r\n      if (op == BC_ISTC) {\r\n\t|  bge >1\r\n      } else {\r\n\t|  blt >1\r\n      }\r\n      |  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n      |  decode_RD4 TMP2, INS\r\n      |   stfdx f0, BASE, RA\r\n      |  add PC, PC, TMP2\r\n      |1:\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  lfdx f0, BASE, RD\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  lwzx TMP0, BASE, RD\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  subfic TMP1, TMP0, LJ_TTRUE\r\n    |  adde TMP0, TMP0, TMP1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  lwzux TMP1, RD, BASE\r\n    |   lwz TMP0, 4(RD)\r\n    |  checknum TMP1\r\n    |.if DUALNUM\r\n    |  bne >5\r\n    |.if GPR64\r\n    |  lus TMP2, 0x8000\r\n    |  neg TMP0, TMP0\r\n    |  cmplw TMP0, TMP2\r\n    |  beq >4\r\n    |.else\r\n    |  nego. TMP0, TMP0\r\n    |  bso >4\r\n    |1:\r\n    |.endif\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |   stw TMP0, 4(RA)\r\n    |3:\r\n    |  ins_next2\r\n    |4:\r\n    |.if not GPR64\r\n    |  // Potential overflow.\r\n    |  checkov TMP1, <1\t\t\t// Ignore unrelated overflow.\r\n    |.endif\r\n    |  lus TMP1, 0x41e0\t\t\t// 2^31.\r\n    |  li TMP0, 0\r\n    |  b >7\r\n    |.endif\r\n    |5:\r\n    |  bge ->vmeta_unm\r\n    |  xoris TMP1, TMP1, 0x8000\r\n    |7:\r\n    |  ins_next1\r\n    |  stwux TMP1, RA, BASE\r\n    |   stw TMP0, 4(RA)\r\n    |.if DUALNUM\r\n    |  b <3\r\n    |.else\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  lwzux TMP0, RD, BASE\r\n    |   lwz CARG1, 4(RD)\r\n    |  checkstr TMP0; bne >2\r\n    |  lwz CRET1, STR:CARG1->len\r\n    |1:\r\n    |.if DUALNUM\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |   stw CRET1, 4(RA)\r\n    |.else\r\n    |  tonum_u f0, CRET1\t\t// Result is a non-negative integer.\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |.endif\r\n    |  ins_next2\r\n    |2:\r\n    |  checktab TMP0; bne ->vmeta_len\r\n#if LJ_52\r\n    |  lwz TAB:TMP2, TAB:CARG1->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  bne >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n#if LJ_52\r\n    |9:\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_len\r\n    |  bne <3\t\t\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   .if DUALNUM\r\n    |     lwzx TMP2, KBASE, RC\r\n    |   .endif\r\n    |    lfdx f14, BASE, RB\r\n    |    lfdx f15, KBASE, RC\r\n    |   .if DUALNUM\r\n    |     checknum cr0, TMP1\r\n    |     checknum cr1, TMP2\r\n    |     crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |     bge ->vmeta_arith_vn\r\n    |   .else\r\n    |     checknum TMP1; bge ->vmeta_arith_vn\r\n    |   .endif\r\n    ||  break;\r\n    ||case 1:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   .if DUALNUM\r\n    |     lwzx TMP2, KBASE, RC\r\n    |   .endif\r\n    |    lfdx f15, BASE, RB\r\n    |    lfdx f14, KBASE, RC\r\n    |   .if DUALNUM\r\n    |     checknum cr0, TMP1\r\n    |     checknum cr1, TMP2\r\n    |     crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |     bge ->vmeta_arith_nv\r\n    |   .else\r\n    |     checknum TMP1; bge ->vmeta_arith_nv\r\n    |   .endif\r\n    ||  break;\r\n    ||default:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   lwzx TMP2, BASE, RC\r\n    |    lfdx f14, BASE, RB\r\n    |    lfdx f15, BASE, RC\r\n    |   checknum cr0, TMP1\r\n    |   checknum cr1, TMP2\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |   bge ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfallback, ins\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ins ->vmeta_arith_vn2\r\n    ||  break;\r\n    ||case 1:\r\n    |   ins ->vmeta_arith_nv2\r\n    ||  break;\r\n    ||default:\r\n    |   ins ->vmeta_arith_vv2\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro intmod, a, b, c\r\n    |  bl ->vm_modi\r\n    |.endmacro\r\n    |\r\n    |.macro fpmod, a, b, c\r\n    |->BC_MODVN_Z:\r\n    |  fdiv FARG1, b, c\r\n    |  // NYI: Use internal implementation of floor.\r\n    |  blex floor\t\t\t// floor(b/c)\r\n    |  fmul a, FARG1, c\r\n    |  fsub a, b, a\t\t\t// b - floor(b/c)*c\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfp, fpins\r\n    |  ins_arithpre\r\n    |.if \"fpins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.else\r\n    |  fpins f0, f14, f15\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins, fpins\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, KBASE\r\n    |    lwz CARG1, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG2, 4(RC)\r\n    ||  break;\r\n    ||case 1:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, KBASE\r\n    |    lwz CARG2, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG1, 4(RC)\r\n    ||  break;\r\n    ||default:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, BASE\r\n    |    lwz CARG1, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG2, 4(RC)\r\n    ||  break;\r\n    ||}\r\n    |  checknum cr1, TMP2\r\n    |  bne >5\r\n    |  bne cr1, >5\r\n    |  intins CARG1, CARG1, CARG2\r\n    |  bso >4\r\n    |1:\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |  stw CARG1, 4(RA)\r\n    |2:\r\n    |  ins_next2\r\n    |4:  // Overflow.\r\n    |  checkov TMP0, <1\t\t\t// Ignore unrelated overflow.\r\n    |  ins_arithfallback b\r\n    |5:  // FP variant.\r\n    ||if (vk == 1) {\r\n    |  lfd f15, 0(RB)\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  lfd f14, 0(RC)\r\n    ||} else {\r\n    |  lfd f14, 0(RB)\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  lfd f15, 0(RC)\r\n    ||}\r\n    |   ins_arithfallback bge\r\n    |.if \"fpins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.else\r\n    |  fpins f0, f14, f15\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |  b <2\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, intins, fpins\r\n    |.if DUALNUM\r\n    |  ins_arithdn intins, fpins\r\n    |.else\r\n    |  ins_arithfp fpins\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |.if GPR64\r\n    |.macro addo32., y, a, b\r\n    |  // Need to check overflow for (a<<32) + (b<<32).\r\n    |  rldicr TMP0, a, 32, 31\r\n    |  rldicr TMP3, b, 32, 31\r\n    |  addo. TMP0, TMP0, TMP3\r\n    |  add y, a, b\r\n    |.endmacro\r\n    |  ins_arith addo32., fadd\r\n    |.else\r\n    |  ins_arith addo., fadd\r\n    |.endif\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |.if GPR64\r\n    |.macro subo32., y, a, b\r\n    |  // Need to check overflow for (a<<32) - (b<<32).\r\n    |  rldicr TMP0, a, 32, 31\r\n    |  rldicr TMP3, b, 32, 31\r\n    |  subo. TMP0, TMP0, TMP3\r\n    |  sub y, a, b\r\n    |.endmacro\r\n    |  ins_arith subo32., fsub\r\n    |.else\r\n    |  ins_arith subo., fsub\r\n    |.endif\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith mullwo., fmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arithfp fdiv\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arith intmod, fpmod\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arith intmod, fpmod_\r\n    break;\r\n  case BC_POW:\r\n    |  // NYI: (partial) integer arithmetic.\r\n    |  lwzx TMP1, BASE, RB\r\n    |   lfdx FARG1, BASE, RB\r\n    |  lwzx TMP2, BASE, RC\r\n    |   lfdx FARG2, BASE, RC\r\n    |  checknum cr0, TMP1\r\n    |  checknum cr1, TMP2\r\n    |  crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  bge ->vmeta_arith_vv\r\n    |  blex pow\r\n    |  ins_next1\r\n    |  stfdx FARG1, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  // RA = dst*8, RB = src_start*8, RC = src_end*8\r\n    |  sub CARG3, RC, RB\r\n    |   stp BASE, L->base\r\n    |  add CARG2, BASE, RC\r\n    |  mr SAVE0, RB\r\n    |->BC_CAT_Z:\r\n    |   stw PC, SAVE_PC\r\n    |  mr CARG1, L\r\n    |  srwi CARG3, CARG3, 3\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  cmplwi CRET1, 0\r\n    |   lp BASE, L->base\r\n    |  bne ->vmeta_binop\r\n    |  ins_next1\r\n    |  lfdx f0, BASE, SAVE0\t\t// Copy result from RB to RA.\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  ins_next1\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-str_const*4\r\n    |  li TMP2, LJ_TSTR\r\n    |  stwux TMP2, RA, BASE\r\n    |  stw TMP0, 4(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RD = cdata_const*8 (~)\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  ins_next1\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-cdata_const*4\r\n    |  li TMP2, LJ_TCDATA\r\n    |  stwux TMP2, RA, BASE\r\n    |  stw TMP0, 4(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, RD = int16_literal*8\r\n    |.if DUALNUM\r\n    |  slwi RD, RD, 13\r\n    |  srawi RD, RD, 16\r\n    |  ins_next1\r\n    |   stwux TISNUM, RA, BASE\r\n    |   stw RD, 4(RA)\r\n    |  ins_next2\r\n    |.else\r\n    |  // The soft-float approach is faster.\r\n    |  slwi RD, RD, 13\r\n    |  srawi TMP1, RD, 31\r\n    |  xor TMP2, TMP1, RD\r\n    |  sub TMP2, TMP2, TMP1\t\t// TMP2 = abs(x)\r\n    |  cntlzw TMP3, TMP2\r\n    |  subfic TMP1, TMP3, 0x40d\t\t// TMP1 = exponent-1\r\n    |   slw TMP2, TMP2, TMP3\t\t// TMP2 = left aligned mantissa\r\n    |    subfic TMP3, RD, 0\r\n    |  slwi TMP1, TMP1, 20\r\n    |   rlwimi RD, TMP2, 21, 1, 31\t// hi = sign(x) | (mantissa>>11)\r\n    |    subfe TMP0, TMP0, TMP0\r\n    |   add RD, RD, TMP1\t\t// hi = hi + exponent-1\r\n    |    and RD, RD, TMP0\t\t// hi = x == 0 ? 0 : hi\r\n    |  ins_next1\r\n    |    stwux RD, RA, BASE\r\n    |    stw ZERO, 4(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RD = num_const*8\r\n    |  ins_next1\r\n    |  lfdx f0, KBASE, RD\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RD = primitive_type*8 (~)\r\n    |  srwi TMP1, RD, 3\r\n    |  not TMP0, TMP1\r\n    |  ins_next1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RD = end*8\r\n    |  stwx TISNIL, BASE, RA\r\n    |   addi RA, RA, 8\r\n    |1:\r\n    |  stwx TISNIL, BASE, RA\r\n    |  cmpw RA, RD\r\n    |   addi RA, RA, 8\r\n    |  blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RD = uvnum*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RD, RD, 1\r\n    |   addi RD, RD, offsetof(GCfuncL, uvptr)\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RD\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  lfd f0, 0(TMP1)\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RD = src*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srwi RA, RA, 1\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   lfdux f0, RD, BASE\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andix. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |    lbz TMP0, UPVAL:RB->closed\r\n    |   lwz TMP2, 0(RD)\r\n    |   stfd f0, 0(CARG2)\r\n    |    cmplwi cr1, TMP0, 0\r\n    |   lwz TMP1, 4(RD)\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   subi TMP2, TMP2, (LJ_TNUMX+1)\r\n    |  bne >2\t\t\t\t// Upvalue is closed and black?\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  cmplwi TMP2, LJ_TISGCV - (LJ_TNUMX+1)\r\n    |  bge <1\t\t\t\t// tvisgcv(v)\r\n    |  lbz TMP3, GCOBJ:TMP1->gch.marked\r\n    |  andix. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(v)\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |    srwi RA, RA, 1\r\n    |   subfic TMP1, TMP1, -4\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   lwzx STR:TMP1, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andix. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |   lbz TMP3, STR:TMP1->marked\r\n    |   lbz TMP2, UPVAL:RB->closed\r\n    |   li TMP0, LJ_TSTR\r\n    |   stw STR:TMP1, 4(CARG2)\r\n    |   stw TMP0, 0(CARG2)\r\n    |  bne >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  andix. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(str)\r\n    |   cmplwi cr1, TMP2, 0\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RD = num_const*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    lfdx f0, KBASE, RD\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  stfd f0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RD = primitive_type*8 (~)\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |    srwi TMP0, RD, 3\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    not TMP0, TMP0\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  stw TMP0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RD = target\r\n    |  lwz TMP1, L->openupval\r\n    |  branch_RD\t\t\t// Do this first since RD is not saved.\r\n    |   stp BASE, L->base\r\n    |  cmplwi TMP1, 0\r\n    |   mr CARG1, L\r\n    |  beq >1\r\n    |   add CARG2, BASE, RA\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  lp BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RD = proto_const*8 (~) (holding function prototype)\r\n    |  srwi TMP1, RD, 1\r\n    |   stp BASE, L->base\r\n    |  subfic TMP1, TMP1, -4\r\n    |   stw PC, SAVE_PC\r\n    |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n    |   mr CARG1, L\r\n    |  lwz CARG3, FRAME_FUNC(BASE)\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  lp BASE, L->base\r\n    |   li TMP0, LJ_TFUNC\r\n    |  stwux TMP0, RA, BASE\r\n    |  stw LFUNC:CRET1, 4(RA)\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RD = (hbits|asize)*8 | tab_const*8 (~)\r\n    |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n    |   mr CARG1, L\r\n    |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n    |   stp BASE, L->base\r\n    |  cmplw TMP0, TMP1\r\n    |   stw PC, SAVE_PC\r\n    |  bge >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  rlwinm CARG2, RD, 29, 21, 31\r\n      |  rlwinm CARG3, RD, 18, 27, 31\r\n      |  cmpwi CARG2, 0x7ff; beq >3\r\n      |2:\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns Table *.\r\n    } else {\r\n      |  srwi TMP1, RD, 1\r\n      |  subfic TMP1, TMP1, -4\r\n      |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns Table *.\r\n    }\r\n    |  lp BASE, L->base\r\n    |   li TMP0, LJ_TTAB\r\n    |  stwux TMP0, RA, BASE\r\n    |  stw TAB:CRET1, 4(RA)\r\n    |  ins_next\r\n    if (op == BC_TNEW) {\r\n      |3:\r\n      |  li CARG2, 0x801\r\n      |  b <2\r\n    }\r\n    |5:\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mr RD, SAVE0\r\n    |  mr CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n  case BC_GSET:\r\n    |  // RA = src*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:TMP2, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |  lwz TAB:RB, LFUNC:TMP2->env\r\n    |   subfic TMP1, TMP1, -4\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |  lwzux CARG2, RC, BASE\r\n    |   lwz TAB:RB, 4(RB)\r\n    |.if DUALNUM\r\n    |   lwz RC, 4(RC)\r\n    |.else\r\n    |   lfd f0, 0(RC)\r\n    |.endif\r\n    |  checktab CARG1\r\n    |   checknum cr1, CARG2\r\n    |  bne ->vmeta_tgetv\r\n    |.if DUALNUM\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |   bne cr1, >5\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  cmplw TMP0, RC\r\n    |   slwi TMP2, RC, 3\r\n    |.else\r\n    |   bge cr1, >5\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  fctiwz f1, f0\r\n    |    fadd f2, f0, TOBIT\r\n    |  stfd f1, TMPD\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |    fsub f2, f2, TOBIT\r\n    |  lwz TMP2, TMPD_LO\r\n    |   lwz TMP1, TAB:RB->array\r\n    |    fcmpu cr1, f0, f2\r\n    |  cmplw cr0, TMP0, TMP2\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+eq\r\n    |   slwi TMP2, TMP2, 3\r\n    |.endif\r\n    |  ble ->vmeta_tgetv\t\t// Integer key and in array part?\r\n    |  lwzx TMP0, TMP1, TMP2\r\n    |   lfdx f14, TMP1, TMP2\r\n    |  checknil TMP0; beq >2\r\n    |1:\r\n    |  ins_next1\r\n    |   stfdx f14, BASE, RA\r\n    |  ins_next2\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |5:\r\n    |  checkstr CARG2; bne ->vmeta_tgetv\r\n    |.if not DUALNUM\r\n    |  lwz STR:RC, 4(RC)\r\n    |.endif\r\n    |  b ->BC_TGETS_Z\t\t\t// String key?\r\n    break;\r\n  case BC_TGETS:\r\n    |  // RA = dst*8, RB = table*8, RC = str_const*8 (~)\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP1, RC, 1\r\n    |    lwz TAB:RB, 4(RB)\r\n    |   subfic TMP1, TMP1, -4\r\n    |  checktab CARG1\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  bne ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lwz CARG1, NODE:TMP2->key\r\n    |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n    |    lwz CARG2, NODE:TMP2->val\r\n    |     lwz TMP1, 4+offsetof(Node, val)(NODE:TMP2)\r\n    |  checkstr CARG1; bne >4\r\n    |   cmpw TMP0, STR:RC; bne >4\r\n    |    checknil CARG2; beq >5\t\t// Key found, but nil value?\r\n    |3:\r\n    |    stwux CARG2, RA, BASE\r\n    |     stw TMP1, 4(RA)\r\n    |  ins_next\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  lwz NODE:TMP2, NODE:TMP2->next\r\n    |  cmplwi NODE:TMP2, 0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |   li CARG2, LJ_TNIL\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <3\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_index\r\n    |  bne <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  // RA = dst*8, RB = table*8, RC = index*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP0, RC, 3\r\n    |   lwz TAB:RB, 4(RB)\r\n    |  checktab CARG1; bne ->vmeta_tgetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |  cmplw TMP0, TMP1; bge ->vmeta_tgetb\r\n    |  lwzx TMP1, TMP2, RC\r\n    |   lfdx f0, TMP2, RC\r\n    |  checknil TMP1; beq >5\r\n    |1:\r\n    |  ins_next1\r\n    |   stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\t\t\t// Caveat: preserve TMP0!\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |  lwzux CARG2, RC, BASE\r\n    |   lwz TAB:RB, 4(RB)\r\n    |.if DUALNUM\r\n    |   lwz RC, 4(RC)\r\n    |.else\r\n    |   lfd f0, 0(RC)\r\n    |.endif\r\n    |  checktab CARG1\r\n    |   checknum cr1, CARG2\r\n    |  bne ->vmeta_tsetv\r\n    |.if DUALNUM\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |   bne cr1, >5\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  cmplw TMP0, RC\r\n    |   slwi TMP0, RC, 3\r\n    |.else\r\n    |   bge cr1, >5\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  fctiwz f1, f0\r\n    |    fadd f2, f0, TOBIT\r\n    |  stfd f1, TMPD\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |    fsub f2, f2, TOBIT\r\n    |  lwz TMP2, TMPD_LO\r\n    |   lwz TMP1, TAB:RB->array\r\n    |    fcmpu cr1, f0, f2\r\n    |  cmplw cr0, TMP0, TMP2\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+eq\r\n    |   slwi TMP0, TMP2, 3\r\n    |.endif\r\n    |  ble ->vmeta_tsetv\t\t// Integer key and in array part?\r\n    |   lwzx TMP2, TMP1, TMP0\r\n    |  lbz TMP3, TAB:RB->marked\r\n    |    lfdx f14, BASE, RA\r\n    |   checknil TMP2; beq >3\r\n    |1:\r\n    |  andix. TMP2, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |    stfdx f14, TMP1, TMP0\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |5:\r\n    |  checkstr CARG2; bne ->vmeta_tsetv\r\n    |.if not DUALNUM\r\n    |  lwz STR:RC, 4(RC)\r\n    |.endif\r\n    |  b ->BC_TSETS_Z\t\t\t// String key?\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  // RA = src*8, RB = table*8, RC = str_const*8 (~)\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP1, RC, 1\r\n    |    lwz TAB:RB, 4(RB)\r\n    |   subfic TMP1, TMP1, -4\r\n    |  checktab CARG1\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  bne ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = src*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |    stb ZERO, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |    lfdx f14, BASE, RA\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lwz CARG1, NODE:TMP2->key\r\n    |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n    |    lwz CARG2, NODE:TMP2->val\r\n    |     lwz NODE:TMP1, NODE:TMP2->next\r\n    |  checkstr CARG1; bne >5\r\n    |   cmpw TMP0, STR:RC; bne >5\r\n    |    checknil CARG2; beq >4\t\t// Key found, but nil value?\r\n    |2:\r\n    |  andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |    stfd f14, NODE:TMP2->val\r\n    |  bne >7\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <2\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_newindex\r\n    |  bne <2\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  cmplwi NODE:TMP1, 0\r\n    |   mr NODE:TMP2, NODE:TMP1\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |   la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n    |   stw PC, SAVE_PC\r\n    |   mr CARG1, L\r\n    |  cmplwi TAB:TMP1, 0\r\n    |   stp BASE, L->base\r\n    |  beq >6\t\t\t\t// No metatable: continue.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_newindex\r\n    |  beq ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  li TMP0, LJ_TSTR\r\n    |   stw STR:RC, 4(CARG3)\r\n    |   mr CARG2, TAB:RB\r\n    |  stw TMP0, 0(CARG3)\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  lp BASE, L->base\r\n    |  stfd f14, 0(CRET1)\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  // RA = src*8, RB = table*8, RC = index*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP0, RC, 3\r\n    |   lwz TAB:RB, 4(RB)\r\n    |  checktab CARG1; bne ->vmeta_tsetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  cmplw TMP0, TMP1\r\n    |   lfdx f14, BASE, RA\r\n    |  bge ->vmeta_tsetb\r\n    |  lwzx TMP1, TMP2, RC\r\n    |  checknil TMP1; beq >5\r\n    |1:\r\n    |  andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   stfdx f14, TMP2, RC\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP1, TAB:TMP1->nomm\r\n    |  andix. TMP1, TMP1, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetb\t\t\t// Caveat: preserve TMP0!\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RD = num_const*8 (start index)\r\n    |  add RA, BASE, RA\r\n    |1:\r\n    |   add TMP3, KBASE, RD\r\n    |  lwz TAB:CARG2, -4(RA)\t\t// Guaranteed to be a table.\r\n    |    addic. TMP0, MULTRES, -8\r\n    |   lwz TMP3, 4(TMP3)\t\t// Integer constant is in lo-word.\r\n    |    srwi CARG3, TMP0, 3\r\n    |    beq >4\t\t\t\t// Nothing to copy?\r\n    |  add CARG3, CARG3, TMP3\r\n    |  lwz TMP2, TAB:CARG2->asize\r\n    |   slwi TMP1, TMP3, 3\r\n    |    lbz TMP3, TAB:CARG2->marked\r\n    |  cmplw CARG3, TMP2\r\n    |   add TMP2, RA, TMP0\r\n    |   lwz TMP0, TAB:CARG2->array\r\n    |  bgt >5\r\n    |   add TMP1, TMP1, TMP0\r\n    |    andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |3:  // Copy result slots to table.\r\n    |   lfd f0, 0(RA)\r\n    |  addi RA, RA, 8\r\n    |  cmpw cr1, RA, TMP2\r\n    |   stfd f0, 0(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  blt cr1, <3\r\n    |  bne >7\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   stp BASE, L->base\r\n    |  mr CARG1, L\r\n    |   stw PC, SAVE_PC\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  mr RD, SAVE0\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP0\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALL follows.\r\n    break;\r\n  case BC_CALL:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = (nargs+1)*8\r\n    |  mr TMP2, BASE\r\n    |  lwzux TMP0, BASE, RA\r\n    |   lwz LFUNC:RB, 4(BASE)\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |   addi BASE, BASE, 8\r\n    |  checkfunc TMP0; bne ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows.\r\n    break;\r\n  case BC_CALLT:\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |  lwzux TMP0, RA, BASE\r\n    |   lwz LFUNC:RB, 4(RA)\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |    lwz TMP1, FRAME_PC(BASE)\r\n    |  checkfunc TMP0\r\n    |   addi RA, RA, 8\r\n    |  bne ->vmeta_callt\r\n    |->BC_CALLT_Z:\r\n    |  andix. TMP0, TMP1, FRAME_TYPE\t// Caveat: preserve cr0 until the crand.\r\n    |   lbz TMP3, LFUNC:RB->ffid\r\n    |    xori TMP2, TMP1, FRAME_VARG\r\n    |    cmplwi cr1, NARGS8:RC, 0\r\n    |  bne >7\r\n    |1:\r\n    |  stw LFUNC:RB, FRAME_FUNC(BASE)\t// Copy function down, but keep PC.\r\n    |  li TMP2, 0\r\n    |   cmplwi cr7, TMP3, 1\t\t// (> FF_C) Calling a fast function?\r\n    |    beq cr1, >3\r\n    |2:\r\n    |  addi TMP3, TMP2, 8\r\n    |   lfdx f0, RA, TMP2\r\n    |  cmplw cr1, TMP3, NARGS8:RC\r\n    |   stfdx f0, BASE, TMP2\r\n    |  mr TMP2, TMP3\r\n    |  bne cr1, <2\r\n    |3:\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+gt\r\n    |  beq >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  lwz INS, -4(TMP1)\r\n    |  decode_RA8 RA, INS\r\n    |  sub TMP1, BASE, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC-8(TMP1)\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\t// Need to prepare KBASE.\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  andix. TMP0, TMP2, FRAME_TYPEP\r\n    |  bne <1\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, BASE, TMP2\t\t// Relocate BASE down.\r\n    |  lwz TMP1, FRAME_PC(BASE)\r\n    |  andix. TMP0, TMP1, FRAME_TYPE\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 ((2+1)*8))\r\n    |  mr TMP2, BASE\r\n    |  add BASE, BASE, RA\r\n    |  lwz TMP1, -24(BASE)\r\n    |   lwz LFUNC:RB, -20(BASE)\r\n    |    lfd f1, -8(BASE)\r\n    |    lfd f0, -16(BASE)\r\n    |  stw TMP1, 0(BASE)\t\t// Copy callable.\r\n    |   stw LFUNC:RB, 4(BASE)\r\n    |  checkfunc TMP1\r\n    |    stfd f1, 16(BASE)\t\t// Copy control var.\r\n    |     li NARGS8:RC, 16\t\t// Iterators get 2 arguments.\r\n    |    stfdu f0, 8(BASE)\t\t// Copy state.\r\n    |  bne ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 (2+1)*8)\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA\r\n    |  lwz TAB:RB, -12(RA)\r\n    |  lwz RC, -4(RA)\t\t\t// Get index from control var.\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |  lwz TMP1, TAB:RB->array\r\n    |   addi PC, PC, 4\r\n    |1:  // Traverse array part.\r\n    |  cmplw RC, TMP0\r\n    |   slwi TMP3, RC, 3\r\n    |  bge >5\t\t\t\t// Index points after array part?\r\n    |  lwzx TMP2, TMP1, TMP3\r\n    |   lfdx f0, TMP1, TMP3\r\n    |  checknil TMP2\r\n    |     lwz INS, -4(PC)\r\n    |  beq >4\r\n    |.if DUALNUM\r\n    |   stw RC, 4(RA)\r\n    |   stw TISNUM, 0(RA)\r\n    |.else\r\n    |   tonum_u f1, RC\r\n    |.endif\r\n    |    addi RC, RC, 1\r\n    |     addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |  stfd f0, 8(RA)\r\n    |     decode_RD4 TMP1, INS\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |     add PC, TMP1, TMP3\r\n    |.if not DUALNUM\r\n    |   stfd f1, 0(RA)\r\n    |.endif\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  addi RC, RC, 1\r\n    |  b <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  lwz TMP1, TAB:RB->hmask\r\n    |  sub RC, RC, TMP0\r\n    |   lwz TMP2, TAB:RB->node\r\n    |6:\r\n    |  cmplw RC, TMP1\t\t\t// End of iteration? Branch to ITERL+1.\r\n    |   slwi TMP3, RC, 5\r\n    |  bgty <3\r\n    |   slwi RB, RC, 3\r\n    |   sub TMP3, TMP3, RB\r\n    |  lwzx RB, TMP2, TMP3\r\n    |  lfdx f0, TMP2, TMP3\r\n    |   add NODE:TMP3, TMP2, TMP3\r\n    |  checknil RB\r\n    |     lwz INS, -4(PC)\r\n    |  beq >7\r\n    |   lfd f1, NODE:TMP3->key\r\n    |     addis TMP2, PC, -(BCBIAS_J*4 >> 16)\r\n    |  stfd f0, 8(RA)\r\n    |    add RC, RC, TMP0\r\n    |     decode_RD4 TMP1, INS\r\n    |   stfd f1, 0(RA)\r\n    |    addi RC, RC, 1\r\n    |     add PC, TMP1, TMP2\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |  b <3\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  addi RC, RC, 1\r\n    |  b <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RD = target (points to ITERN)\r\n    |  add RA, BASE, RA\r\n    |  lwz TMP0, -24(RA)\r\n    |  lwz CFUNC:TMP1, -20(RA)\r\n    |   lwz TMP2, -16(RA)\r\n    |    lwz TMP3, -8(RA)\r\n    |   cmpwi cr0, TMP2, LJ_TTAB\r\n    |  cmpwi cr1, TMP0, LJ_TFUNC\r\n    |    cmpwi cr6, TMP3, LJ_TNIL\r\n    |  bne cr1, >5\r\n    |  lbz TMP1, CFUNC:TMP1->ffid\r\n    |   crand 4*cr0+eq, 4*cr0+eq, 4*cr6+eq\r\n    |  cmpwi cr7, TMP1, FF_next_N\r\n    |    srwi TMP0, RD, 1\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+eq\r\n    |    add TMP3, PC, TMP0\r\n    |  bne cr0, >5\r\n    |  lus TMP1, 0xfffe\r\n    |  ori TMP1, TMP1, 0x7fff\r\n    |  stw ZERO, -4(RA)\t\t\t// Initialize control var.\r\n    |  stw TMP1, -8(RA)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  li TMP0, BC_JMP\r\n    |   li TMP1, BC_ITERC\r\n    |  stb TMP0, -1(PC)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |   stb TMP1, 3(PC)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  lwz TMP0, FRAME_PC(BASE)\r\n    |  add RC, BASE, RC\r\n    |   add RA, BASE, RA\r\n    |  addi RC, RC, FRAME_VARG\r\n    |   add TMP2, RA, RB\r\n    |  subi TMP3, BASE, 8\t\t// TMP3 = vtop\r\n    |  sub RC, RC, TMP0\t\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  cmplwi cr1, RB, 0\r\n    |.if PPE\r\n    |   sub TMP1, TMP3, RC\r\n    |   cmpwi TMP1, 0\r\n    |.else\r\n    |   sub. TMP1, TMP3, RC\r\n    |.endif\r\n    |  beq cr1, >5\t\t\t// Copy all varargs?\r\n    |   subi TMP2, TMP2, 16\r\n    |   ble >2\t\t\t\t// No vararg slots?\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  lfd f0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  stfd f0, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   cmplw cr1, RC, TMP3\r\n    |  bge >3\t\t\t\t// All destination slots filled?\r\n    |    addi RA, RA, 8\r\n    |   blt cr1, <1\t\t\t// More vararg slots?\r\n    |2:  // Fill up remainder with nil.\r\n    |  stw TISNIL, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   addi RA, RA, 8\r\n    |  blt <2\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  lwz TMP0, L->maxstack\r\n    |   li MULTRES, 8\t\t\t// MULTRES = (0+1)*8\r\n    |  bley <3\t\t\t\t// No vararg slots?\r\n    |  add TMP2, RA, TMP1\r\n    |  cmplw TMP2, TMP0\r\n    |   addi MULTRES, TMP1, 8\r\n    |  bgt >7\r\n    |6:\r\n    |  lfd f0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  stfd f0, 0(RA)\r\n    |  cmplw RC, TMP3\r\n    |   addi RA, RA, 8\r\n    |  blt <6\t\t\t\t// More vararg slots?\r\n    |  b <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mr CARG1, L\r\n    |   stp RA, L->top\r\n    |  sub SAVE0, RC, BASE\t\t// Need delta, because BASE may change.\r\n    |   stp BASE, L->base\r\n    |  sub RA, RA, BASE\r\n    |   stw PC, SAVE_PC\r\n    |  srwi CARG2, TMP1, 3\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  lp BASE, L->base\r\n    |  add RA, BASE, RA\r\n    |  add RC, BASE, SAVE0\r\n    |  subi TMP3, BASE, 8\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RD = extra_nresults*8\r\n    |  add RD, RD, MULTRES\t\t// MULTRES >= 8, so RD >= 8.\r\n    |  // Fall through. Assumes BC_RET follows.\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |1:\r\n    |  andix. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bne ->BC_RETV_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RD = (nresults+1)*8, PC = return\r\n    |   lwz INS, -4(PC)\r\n    |  cmpwi RD, 8\r\n    |   subi TMP2, BASE, 8\r\n    |   subi RC, RD, 8\r\n    |   decode_RB8 RB, INS\r\n    |  beq >3\r\n    |   li TMP1, 0\r\n    |2:\r\n    |  addi TMP3, TMP1, 8\r\n    |   lfdx f0, RA, TMP1\r\n    |  cmpw TMP3, RC\r\n    |   stfdx f0, TMP2, TMP1\r\n    |  beq >3\r\n    |  addi TMP1, TMP3, 8\r\n    |   lfdx f1, RA, TMP3\r\n    |  cmpw TMP1, RC\r\n    |   stfdx f1, TMP2, TMP3\r\n    |  bne <2\r\n    |3:\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  stwx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    |\r\n    |->BC_RETV_Z:  // Non-standard return case.\r\n    |  andix. TMP2, TMP1, FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, TMP1\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |  andix. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bney ->BC_RETV_Z\r\n    |\r\n    |  lwz INS, -4(PC)\r\n    |   subi TMP2, BASE, 8\r\n    |  decode_RB8 RB, INS\r\n    if (op == BC_RET1) {\r\n      |  lfd f0, 0(RA)\r\n      |  stfd f0, 0(TMP2)\r\n    }\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  stwx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RD = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |.if DUALNUM\r\n    |  // Integer loop.\r\n    |  lwzux TMP1, RA, BASE\r\n    |   lwz CARG1, FORL_IDX*8+4(RA)\r\n    |  cmplw cr0, TMP1, TISNUM\r\n    if (vk) {\r\n      |   lwz CARG3, FORL_STEP*8+4(RA)\r\n      |  bne >9\r\n      |.if GPR64\r\n      |  // Need to check overflow for (a<<32) + (b<<32).\r\n      |  rldicr TMP0, CARG1, 32, 31\r\n      |  rldicr TMP2, CARG3, 32, 31\r\n      |  add CARG1, CARG1, CARG3\r\n      |  addo. TMP0, TMP0, TMP2\r\n      |.else\r\n      |  addo. CARG1, CARG1, CARG3\r\n      |.endif\r\n      |    cmpwi cr6, CARG3, 0\r\n      |   lwz CARG2, FORL_STOP*8+4(RA)\r\n      |  bso >6\r\n      |4:\r\n      |  stw CARG1, FORL_IDX*8+4(RA)\r\n    } else {\r\n      |  lwz TMP3, FORL_STEP*8(RA)\r\n      |   lwz CARG3, FORL_STEP*8+4(RA)\r\n      |  lwz TMP2, FORL_STOP*8(RA)\r\n      |   lwz CARG2, FORL_STOP*8+4(RA)\r\n      |  cmplw cr7, TMP3, TISNUM\r\n      |  cmplw cr1, TMP2, TISNUM\r\n      |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+eq\r\n      |  crand 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n      |    cmpwi cr6, CARG3, 0\r\n      |  bne >9\r\n    }\r\n    |    blt cr6, >5\r\n    |  cmpw CARG1, CARG2\r\n    |1:\r\n    |   stw TISNUM, FORL_EXT*8(RA)\r\n    if (op != BC_JFORL) {\r\n      |  srwi RD, RD, 1\r\n    }\r\n    |   stw CARG1, FORL_EXT*8+4(RA)\r\n    if (op != BC_JFORL) {\r\n      |  add RD, PC, RD\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  bgt >3  // See FP loop below.\r\n    } else if (op == BC_JFORI) {\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n      |  bley >7\r\n    } else if (op == BC_IFORL) {\r\n      |  bgt >2\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else {\r\n      |  bley =>BC_JLOOP\r\n    }\r\n    |2:\r\n    |  ins_next\r\n    |5:  // Invert check for negative step.\r\n    |  cmpw CARG2, CARG1\r\n    |  b <1\r\n    if (vk) {\r\n      |6:  // Potential overflow.\r\n      |  checkov TMP0, <4\t\t// Ignore unrelated overflow.\r\n      |  b <2\r\n    }\r\n    |.endif\r\n    if (vk) {\r\n      |.if DUALNUM\r\n      |9:  // FP loop.\r\n      |  lfd f1, FORL_IDX*8(RA)\r\n      |.else\r\n      |  lfdux f1, RA, BASE\r\n      |.endif\r\n      |  lfd f3, FORL_STEP*8(RA)\r\n      |  lfd f2, FORL_STOP*8(RA)\r\n      |   lwz TMP3, FORL_STEP*8(RA)\r\n      |  fadd f1, f1, f3\r\n      |  stfd f1, FORL_IDX*8(RA)\r\n    } else {\r\n      |.if DUALNUM\r\n      |9:  // FP loop.\r\n      |.else\r\n      |  lwzux TMP1, RA, BASE\r\n      |  lwz TMP3, FORL_STEP*8(RA)\r\n      |  lwz TMP2, FORL_STOP*8(RA)\r\n      |  cmplw cr0, TMP1, TISNUM\r\n      |  cmplw cr7, TMP3, TISNUM\r\n      |  cmplw cr1, TMP2, TISNUM\r\n      |.endif\r\n      |   lfd f1, FORL_IDX*8(RA)\r\n      |  crand 4*cr0+lt, 4*cr0+lt, 4*cr7+lt\r\n      |  crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n      |   lfd f2, FORL_STOP*8(RA)\r\n      |  bge ->vmeta_for\r\n    }\r\n    |  cmpwi cr6, TMP3, 0\r\n    if (op != BC_JFORL) {\r\n      |  srwi RD, RD, 1\r\n    }\r\n    |   stfd f1, FORL_EXT*8(RA)\r\n    if (op != BC_JFORL) {\r\n      |  add RD, PC, RD\r\n    }\r\n    |  fcmpu cr0, f1, f2\r\n    if (op == BC_JFORI) {\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    }\r\n    |  blt cr6, >5\r\n    if (op == BC_FORI) {\r\n      |  bgt >3\r\n    } else if (op == BC_IFORL) {\r\n      |.if DUALNUM\r\n      |  bgty <2\r\n      |.else\r\n      |  bgt >2\r\n      |.endif\r\n      |1:\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else if (op == BC_JFORI) {\r\n      |  bley >7\r\n    } else {\r\n      |  bley =>BC_JLOOP\r\n    }\r\n    |.if DUALNUM\r\n    |  b <2\r\n    |.else\r\n    |2:\r\n    |  ins_next\r\n    |.endif\r\n    |5:  // Negative step.\r\n    if (op == BC_FORI) {\r\n      |  bge <2\r\n      |3:  // Used by integer loop, too.\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else if (op == BC_IFORL) {\r\n      |  bgey <1\r\n    } else if (op == BC_JFORI) {\r\n      |  bgey >7\r\n    } else {\r\n      |  bgey =>BC_JLOOP\r\n    }\r\n    |  b <2\r\n    if (op == BC_JFORI) {\r\n      |7:\r\n      |  lwz INS, -4(PC)\r\n      |  decode_RD8 RD, INS\r\n      |  b =>BC_JLOOP\r\n    }\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RD = target\r\n    |  lwzux TMP1, RA, BASE\r\n    |   lwz TMP2, 4(RA)\r\n    |  checknil TMP1; beq >1\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  stw TMP1, -8(RA)\r\n      |   stw TMP2, -4(RA)\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  branch_RD\t\t\t// Otherwise save control var + branch.\r\n      |  stw TMP1, -8(RA)\r\n      |   stw TMP2, -4(RA)\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base*8 (ignored), RD = traceno*8\r\n    |  lwz TMP1, DISPATCH_J(trace)(DISPATCH)\r\n    |  srwi RD, RD, 1\r\n    |  // Traces on PPC don't store the trace number, so use 0.\r\n    |   stw ZERO, DISPATCH_GL(vmstate)(DISPATCH)\r\n    |  lwzx TRACE:TMP2, TMP1, RD\r\n    |  clrso TMP1\r\n    |  lp TMP2, TRACE:TMP2->mcode\r\n    |   stw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n    |  mtctr TMP2\r\n    |   stw L, DISPATCH_GL(jit_L)(DISPATCH)\r\n    |   addi JGL, DISPATCH, GG_DISP2G+32768\r\n    |  bctr\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RD = target\r\n    |  branch_RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   lbz TMP1, -4+PC2PROTO(numparams)(PC)\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw RA, TMP2\r\n    |   slwi TMP1, TMP1, 3\r\n    |  bgt ->vm_growstack_l\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n    }\r\n    |2:\r\n    |  cmplw NARGS8:RC, TMP1\t\t// Check for missing parameters.\r\n    |  blt >3\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD8 RD, INS\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  ins_next2\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  stwx TISNIL, BASE, NARGS8:RC\r\n    |  addi NARGS8:RC, NARGS8:RC, 8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   add TMP1, BASE, RC\r\n    |  add TMP0, RA, RC\r\n    |   stw LFUNC:RB, 4(TMP1)\t\t// Store copy of LFUNC.\r\n    |   addi TMP3, RC, 8+FRAME_VARG\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw TMP0, TMP2\r\n    |   stw TMP3, 0(TMP1)\t\t// Store delta + FRAME_VARG.\r\n    |  bge ->vm_growstack_l\r\n    |  lbz TMP2, -4+PC2PROTO(numparams)(PC)\r\n    |   mr RA, BASE\r\n    |   mr RC, TMP1\r\n    |  ins_next1\r\n    |  cmpwi TMP2, 0\r\n    |   addi BASE, TMP1, 8\r\n    |  beq >3\r\n    |1:\r\n    |  cmplw RA, RC\t\t\t// Less args than parameters?\r\n    |   lwz TMP0, 0(RA)\r\n    |   lwz TMP3, 4(RA)\r\n    |  bge >4\r\n    |    stw TISNIL, 0(RA)\t\t// Clear old fixarg slot (help the GC).\r\n    |    addi RA, RA, 8\r\n    |2:\r\n    |  addic. TMP2, TMP2, -1\r\n    |   stw TMP0, 8(TMP1)\r\n    |   stw TMP3, 12(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  bne <1\r\n    |3:\r\n    |  ins_next2\r\n    |\r\n    |4:  // Clear missing parameters.\r\n    |  li TMP0, LJ_TNIL\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  lp RD, CFUNC:RB->f\r\n    } else {\r\n      |  lp RD, DISPATCH_GL(wrapf)(DISPATCH)\r\n    }\r\n    |   add TMP1, RA, NARGS8:RC\r\n    |   lwz TMP2, L->maxstack\r\n    |  .toc lp TMP3, 0(RD)\r\n    |    add RC, BASE, NARGS8:RC\r\n    |   stp BASE, L->base\r\n    |   cmplw TMP1, TMP2\r\n    |    stp RC, L->top\r\n    |     li_vmstate C\r\n    |.if TOC\r\n    |  mtctr TMP3\r\n    |.else\r\n    |  mtctr RD\r\n    |.endif\r\n    if (op == BC_FUNCCW) {\r\n      |  lp CARG2, CFUNC:RB->f\r\n    }\r\n    |  mr CARG1, L\r\n    |   bgt ->vm_growstack_c\t\t// Need to grow stack.\r\n    |  .toc lp TOCREG, TOC_OFS(RD)\r\n    |  .tocenv lp ENVREG, ENV_OFS(RD)\r\n    |     st_vmstate\r\n    |  bctrl\t\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  lp BASE, L->base\r\n    |  .toc ld TOCREG, SAVE_TOC\r\n    |   slwi RD, CRET1, 3\r\n    |  lp TMP1, L->top\r\n    |    li_vmstate INTERP\r\n    |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of caller.\r\n    |   sub RA, TMP1, RD\t\t// RA = L->top - nresults*8\r\n    |    st_vmstate\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.uleb128 55\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 37+(31-i), 0x80+32+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_TARGET_PS3\r\n\t\"\\t.long .lj_vm_ffi_call\\n\"\r\n#else\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n#endif\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xe\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#if !LJ_NO_UNWIND\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.uleb128 55\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 37+(31-i), 0x80+32+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE2:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xe\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/vm_ppcspe.dasc",
    "content": "|// Low-level VM code for PowerPC/e500 CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch ppc\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// Don't use: r1 = sp, r2 and r13 = reserved and/or small data area ptr\r\n|\r\n|// The following must be C callee-save (but BASE is often refetched).\r\n|.define BASE,\t\tr14\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tr15\t// Constants of current Lua function.\r\n|.define PC,\t\tr16\t// Next PC.\r\n|.define DISPATCH,\tr17\t// Opcode dispatch table.\r\n|.define LREG,\t\tr18\t// Register holding lua_State (also in SAVE_L).\r\n|.define MULTRES,\tr19\t// Size of multi-result: (nresults+1)*8.\r\n|\r\n|// Constants for vectorized type-comparisons (hi+low GPR). C callee-save.\r\n|.define TISNUM,\tr22\r\n|.define TISSTR,\tr23\r\n|.define TISTAB,\tr24\r\n|.define TISFUNC,\tr25\r\n|.define TISNIL,\tr26\r\n|.define TOBIT,\t\tr27\r\n|.define ZERO,\t\tTOBIT\t// Zero in lo word.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA.\r\n|.define RA,\t\tr20\t// Callee-save.\r\n|.define RB,\t\tr10\r\n|.define RC,\t\tr11\r\n|.define RD,\t\tr12\r\n|.define INS,\t\tr7\t// Overlaps CARG5.\r\n|\r\n|.define TMP0,\t\tr0\r\n|.define TMP1,\t\tr8\r\n|.define TMP2,\t\tr9\r\n|.define TMP3,\t\tr6\t// Overlaps CARG4.\r\n|\r\n|// Saved temporaries.\r\n|.define SAVE0,\t\tr21\r\n|\r\n|// Calling conventions.\r\n|.define CARG1,\t\tr3\r\n|.define CARG2,\t\tr4\r\n|.define CARG3,\t\tr5\r\n|.define CARG4,\t\tr6\t// Overlaps TMP3.\r\n|.define CARG5,\t\tr7\t// Overlaps INS.\r\n|\r\n|.define CRET1,\t\tr3\r\n|.define CRET2,\t\tr4\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.define SAVE_LR,\t188(sp)\r\n|.define CFRAME_SPACE,\t184\t// Delta for sp.\r\n|// Back chain for sp:\t184(sp)\t<-- sp entering interpreter\r\n|.define SAVE_r31,\t176(sp)\t// 64 bit register saves.\r\n|.define SAVE_r30,\t168(sp)\r\n|.define SAVE_r29,\t160(sp)\r\n|.define SAVE_r28,\t152(sp)\r\n|.define SAVE_r27,\t144(sp)\r\n|.define SAVE_r26,\t136(sp)\r\n|.define SAVE_r25,\t128(sp)\r\n|.define SAVE_r24,\t120(sp)\r\n|.define SAVE_r23,\t112(sp)\r\n|.define SAVE_r22,\t104(sp)\r\n|.define SAVE_r21,\t96(sp)\r\n|.define SAVE_r20,\t88(sp)\r\n|.define SAVE_r19,\t80(sp)\r\n|.define SAVE_r18,\t72(sp)\r\n|.define SAVE_r17,\t64(sp)\r\n|.define SAVE_r16,\t56(sp)\r\n|.define SAVE_r15,\t48(sp)\r\n|.define SAVE_r14,\t40(sp)\r\n|.define SAVE_CR,\t36(sp)\r\n|.define UNUSED1,\t32(sp)\r\n|.define SAVE_ERRF,\t28(sp)\t// 32 bit C frame info.\r\n|.define SAVE_NRES,\t24(sp)\r\n|.define SAVE_CFRAME,\t20(sp)\r\n|.define SAVE_L,\t16(sp)\r\n|.define SAVE_PC,\t12(sp)\r\n|.define SAVE_MULTRES,\t8(sp)\r\n|// Next frame lr:\t4(sp)\r\n|// Back chain for sp:\t0(sp)\t<-- sp while in interpreter\r\n|\r\n|.macro save_, reg; evstdd reg, SAVE_..reg; .endmacro\r\n|.macro rest_, reg; evldd reg, SAVE_..reg; .endmacro\r\n|\r\n|.macro saveregs\r\n|  stwu sp, -CFRAME_SPACE(sp)\r\n|  save_ r14; save_ r15; save_ r16; save_ r17; save_ r18; save_ r19\r\n|  mflr r0; mfcr r12\r\n|  save_ r20; save_ r21; save_ r22; save_ r23; save_ r24; save_ r25\r\n|  stw  r0, SAVE_LR; stw r12, SAVE_CR\r\n|  save_ r26; save_ r27; save_ r28; save_ r29; save_ r30; save_ r31\r\n|.endmacro\r\n|\r\n|.macro restoreregs\r\n|  lwz r0, SAVE_LR; lwz r12, SAVE_CR\r\n|  rest_ r14; rest_ r15; rest_ r16; rest_ r17; rest_ r18; rest_ r19\r\n|  mtlr r0; mtcrf 0x38, r12\r\n|  rest_ r20; rest_ r21; rest_ r22; rest_ r23; rest_ r24; rest_ r25\r\n|  rest_ r26; rest_ r27; rest_ r28; rest_ r29; rest_ r30; rest_ r31\r\n|  addi sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// These basic macros should really be part of DynASM.\r\n|.macro srwi, rx, ry, n; rlwinm rx, ry, 32-n, n, 31; .endmacro\r\n|.macro slwi, rx, ry, n; rlwinm rx, ry, n, 0, 31-n; .endmacro\r\n|.macro rotlwi, rx, ry, n; rlwinm rx, ry, n, 0, 31; .endmacro\r\n|.macro rotlw, rx, ry, rn; rlwnm rx, ry, rn, 0, 31; .endmacro\r\n|.macro subi, rx, ry, i; addi rx, ry, -i; .endmacro\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; tw 4, sp, sp; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_PC,\t-8\r\n|.define FRAME_FUNC,\t-4\r\n|\r\n|// Instruction decode.\r\n|.macro decode_OP4, dst, ins; rlwinm dst, ins, 2, 22, 29; .endmacro\r\n|.macro decode_RA8, dst, ins; rlwinm dst, ins, 27, 21, 28; .endmacro\r\n|.macro decode_RB8, dst, ins; rlwinm dst, ins, 11, 21, 28; .endmacro\r\n|.macro decode_RC8, dst, ins; rlwinm dst, ins, 19, 21, 28; .endmacro\r\n|.macro decode_RD8, dst, ins; rlwinm dst, ins, 19, 13, 28; .endmacro\r\n|\r\n|.macro decode_OP1, dst, ins; rlwinm dst, ins, 0, 24, 31; .endmacro\r\n|.macro decode_RD4, dst, ins; rlwinm dst, ins, 18, 14, 29; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|.endmacro\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT2\r\n|  decode_OP4 TMP1, INS\r\n|   decode_RB8 RB, INS\r\n|   decode_RD8 RD, INS\r\n|  lwzx TMP0, DISPATCH, TMP1\r\n|   decode_RA8 RA, INS\r\n|   decode_RC8 RC, INS\r\n|  mtctr TMP0\r\n|  bctr\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  lwz PC, LFUNC:RB->pc\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|  decode_OP4 TMP1, INS\r\n|   decode_RA8 RA, INS\r\n|  lwzx TMP0, DISPATCH, TMP1\r\n|   add RA, RA, BASE\r\n|  mtctr TMP0\r\n|  bctr\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  stw PC, FRAME_PC(BASE)\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checknum, reg; evcmpltu reg, TISNUM; .endmacro\r\n|.macro checkstr, reg; evcmpeq reg, TISSTR; .endmacro\r\n|.macro checktab, reg; evcmpeq reg, TISTAB; .endmacro\r\n|.macro checkfunc, reg; evcmpeq reg, TISFUNC; .endmacro\r\n|.macro checknil, reg; evcmpeq reg, TISNIL; .endmacro\r\n|.macro checkok, label; blt label; .endmacro\r\n|.macro checkfail, label; bge label; .endmacro\r\n|.macro checkanyfail, label; bns label; .endmacro\r\n|.macro checkallok, label; bso label; .endmacro\r\n|\r\n|.macro branch_RD\r\n|  srwi TMP0, RD, 1\r\n|  add PC, PC, TMP0\r\n|  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotloop\r\n|  NYI\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  NYI\r\n|.endmacro\r\n|\r\n|// Set current VM state. Uses TMP0.\r\n|.macro li_vmstate, st; li TMP0, ~LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate; stw TMP0, DISPATCH_GL(vmstate)(DISPATCH); .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  lwz tmp, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|  // Assumes LJ_GC_BLACK is 0x04.\r\n|   rlwinm mark, mark, 0, 30, 28\t\t// black2gray(tab)\r\n|  stw tab, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   stb mark, tab->marked\r\n|  stw tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: TMP2 = previous base.\r\n  |  andi. TMP0, PC, FRAME_P\r\n  |   evsplati TMP1, LJ_TTRUE\r\n  |  beq ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  lwz PC, FRAME_PC(TMP2)\t\t// Fetch PC of previous frame.\r\n  |  mr BASE, TMP2\t\t\t// Restore caller base.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   stwu TMP1, FRAME_PC(RA)\t\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  addi RD, RD, 8\t\t\t// RD = (nresults+1)*8.\r\n  |   andi. TMP0, PC, FRAME_TYPE\r\n  |  cmpwi cr1, RD, 0\r\n  |  li CRET1, LUA_YIELD\r\n  |  beq cr1, ->vm_unwind_c_eh\r\n  |  mr MULTRES, RD\r\n  |   beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RD/MULTRES = (nresults+1)*8, PC = return\r\n  |  // TMP0 = PC & FRAME_TYPE\r\n  |  cmpwi TMP0, FRAME_C\r\n  |   rlwinm TMP2, PC, 0, 0, 28\r\n  |    li_vmstate C\r\n  |   sub TMP2, BASE, TMP2\t\t// TMP2 = previous base.\r\n  |  bne ->vm_returnp\r\n  |\r\n  |  addic. TMP1, RD, -8\r\n  |   stw TMP2, L->base\r\n  |   lwz TMP2, SAVE_NRES\r\n  |    subi BASE, BASE, 8\r\n  |    st_vmstate\r\n  |   slwi TMP2, TMP2, 3\r\n  |  beq >2\r\n  |1:\r\n  |  addic. TMP1, TMP1, -8\r\n  |   evldd TMP0, 0(RA)\r\n  |    addi RA, RA, 8\r\n  |   evstdd TMP0, 0(BASE)\r\n  |    addi BASE, BASE, 8\r\n  |  bne <1\r\n  |\r\n  |2:\r\n  |  cmpw TMP2, RD\t\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  stw BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  lwz TMP0, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   li CRET1, 0\t\t\t// Ok return status for vm_pcall.\r\n  |  stw TMP0, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  blr\r\n  |\r\n  |6:\r\n  |  ble >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  lwz TMP1, L->maxstack\r\n  |  cmplw BASE, TMP1\r\n  |  bge >8\r\n  |  evstdd TISNIL, 0(BASE)\r\n  |  addi RD, RD, 8\r\n  |  addi BASE, BASE, 8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |   sub TMP0, RD, TMP2\r\n  |  cmpwi TMP2, 0\t\t\t// LUA_MULTRET+1 case?\r\n  |   sub TMP0, BASE, TMP0\t\t// Subtract the difference.\r\n  |  iseleq BASE, BASE, TMP0\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  stw BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |   mr SAVE0, RD\r\n  |  mr CARG2, TMP2\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |    lwz TMP2, SAVE_NRES\r\n  |   mr RD, SAVE0\r\n  |    slwi TMP2, TMP2, 3\r\n  |  lwz BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mr sp, CARG1\r\n  |  mr CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |   li TMP0, ~LJ_VMST_C\r\n  |  lwz GL:TMP1, L->glref\r\n  |   stw TMP0, GL:TMP1->vmstate\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  rlwinm sp, CARG1, 0, 0, 29\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |     evsplati TISNUM, LJ_TISNUM+1\t// Setup type comparison constants.\r\n  |     evsplati TISFUNC, LJ_TFUNC\r\n  |     lus TOBIT, 0x4338\r\n  |     evsplati TISTAB, LJ_TTAB\r\n  |     li TMP0, 0\r\n  |  lwz BASE, L->base\r\n  |     evmergelo TOBIT, TOBIT, TMP0\r\n  |   lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     evsplati TISSTR, LJ_TSTR\r\n  |  li TMP1, LJ_TFALSE\r\n  |     evsplati TISNIL, LJ_TNIL\r\n  |    li_vmstate INTERP\r\n  |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of previous frame.\r\n  |  la RA, -8(BASE)\t\t\t// Results start at BASE-8.\r\n  |   addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  stw TMP1, 0(RA)\t\t\t// Prepend false to error message.\r\n  |  li RD, 16\t\t\t\t// 2 results: false + error message.\r\n  |    st_vmstate\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |  stw BASE, L->base\r\n  |   addi PC, PC, 4\t\t\t// Must point after first instruction.\r\n  |  stw RC, L->top\r\n  |   srwi CARG2, RA, 3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lwz BASE, L->base\r\n  |  lwz RC, L->top\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  mr BASE, CARG2\r\n  |    lbz TMP1, L->status\r\n  |   stw L, SAVE_L\r\n  |  li PC, FRAME_CP\r\n  |  addi TMP0, sp, CFRAME_RESUME\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |   stw CARG3, SAVE_NRES\r\n  |    cmplwi TMP1, 0\r\n  |   stw CARG3, SAVE_ERRF\r\n  |  stw TMP0, L->cframe\r\n  |   stw CARG3, SAVE_CFRAME\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |    beq >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  mr RA, BASE\r\n  |   lwz BASE, L->base\r\n  |    evsplati TISNUM, LJ_TISNUM+1\t// Setup type comparison constants.\r\n  |   lwz TMP1, L->top\r\n  |    evsplati TISFUNC, LJ_TFUNC\r\n  |    lus TOBIT, 0x4338\r\n  |    evsplati TISTAB, LJ_TTAB\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |    li TMP2, 0\r\n  |    evsplati TISSTR, LJ_TSTR\r\n  |   sub RD, TMP1, BASE\r\n  |    evmergelo TOBIT, TOBIT, TMP2\r\n  |    stb CARG3, L->status\r\n  |  andi. TMP0, PC, FRAME_TYPE\r\n  |    li_vmstate INTERP\r\n  |   addi RD, RD, 8\r\n  |    evsplati TISNIL, LJ_TNIL\r\n  |   mr MULTRES, RD\r\n  |    st_vmstate\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  li PC, FRAME_CP\r\n  |  stw CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  li PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  lwz TMP1, L:CARG1->cframe\r\n  |   stw CARG3, SAVE_NRES\r\n  |    mr L, CARG1\r\n  |   stw CARG1, SAVE_L\r\n  |    mr BASE, CARG2\r\n  |  stw sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  stw TMP1, SAVE_CFRAME\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  lwz TMP2, L->base\t\t\t// TMP2 = old base (used in vmeta_call).\r\n  |    evsplati TISNUM, LJ_TISNUM+1\t// Setup type comparison constants.\r\n  |   lwz TMP1, L->top\r\n  |    evsplati TISFUNC, LJ_TFUNC\r\n  |  add PC, PC, BASE\r\n  |    evsplati TISTAB, LJ_TTAB\r\n  |    lus TOBIT, 0x4338\r\n  |    li TMP0, 0\r\n  |  sub PC, PC, TMP2\t\t\t// PC = frame delta + frame type\r\n  |    evsplati TISSTR, LJ_TSTR\r\n  |   sub NARGS8:RC, TMP1, BASE\r\n  |    evmergelo TOBIT, TOBIT, TMP0\r\n  |    li_vmstate INTERP\r\n  |    evsplati TISNIL, LJ_TNIL\r\n  |    st_vmstate\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  li TMP0, -8\r\n  |  evlddx LFUNC:RB, BASE, TMP0\r\n  |  checkfunc LFUNC:RB\r\n  |  checkfail ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |   lwz TMP0, L:CARG1->stack\r\n  |  stw CARG1, SAVE_L\r\n  |   lwz TMP1, L->top\r\n  |  stw CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   sub TMP0, TMP0, TMP1\t\t// Compute -savestack(L, L->top).\r\n  |    lwz TMP1, L->cframe\r\n  |    stw sp, L->cframe\t\t// Add our C frame to cframe chain.\r\n  |  li TMP2, 0\r\n  |   stw TMP0, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  stw TMP2, SAVE_ERRF\t\t// No error function.\r\n  |    stw TMP1, SAVE_CFRAME\r\n  |  mtctr CARG4\r\n  |  bctrl\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |  mr. BASE, CRET1\r\n  |   lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |    li PC, FRAME_CP\r\n  |   addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  bne <3\t\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// The lj_meta_* functions (except for lj_meta_cat) don't reallocate the\r\n  |// stack, so BASE doesn't need to be reloaded across these calls.\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RD = (nresults+1)*8\r\n  |  lwz TMP0, -12(BASE)\t\t// Continuation.\r\n  |   mr RB, BASE\r\n  |   mr BASE, TMP2\t\t\t// Restore caller BASE.\r\n  |    lwz LFUNC:TMP1, FRAME_FUNC(TMP2)\r\n  |  cmplwi TMP0, 0\r\n  |     lwz PC, -16(RB)\t\t\t// Restore PC from [cont|PC].\r\n  |  beq >1\r\n  |   subi TMP2, RD, 8\r\n  |    lwz TMP1, LFUNC:TMP1->pc\r\n  |   evstddx TISNIL, RA, TMP2\t\t// Ensure one valid arg.\r\n  |    lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |  // BASE = base, RA = resultptr, RB = meta base\r\n  |  mtctr TMP0\r\n  |  bctr\t\t\t\t// Jump to continuation.\r\n  |\r\n  |1:  // Tail call from C function.\r\n  |  subi TMP1, RB, 16\r\n  |  sub RC, TMP1, BASE\r\n  |  b ->vm_call_tail\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, RB = meta base\r\n  |  lwz INS, -4(PC)\r\n  |   subi CARG2, RB, 16\r\n  |  decode_RB8 SAVE0, INS\r\n  |   evldd TMP0, 0(RA)\r\n  |  add TMP1, BASE, SAVE0\r\n  |   stw BASE, L->base\r\n  |  cmplw TMP1, CARG2\r\n  |   sub CARG3, CARG2, TMP1\r\n  |  decode_RA8 RA, INS\r\n  |   evstdd TMP0, 0(CARG2)\r\n  |  bne ->BC_CAT_Z\r\n  |   evstddx TMP0, BASE, RA\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  evmergelo STR:RC, TISSTR, STR:RC\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   decode_RB8 RB, INS\r\n  |  evstdd STR:RC, 0(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgets:\r\n  |  evmergelo TAB:RB, TISTAB, TAB:RB\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   evmergelo STR:RC, TISSTR, STR:RC\r\n  |  evstdd TAB:RB, 0(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |   evstdd STR:RC, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// TMP0 = index\r\n  |  efdcfsi TMP0, TMP0\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |  evstdd TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stw BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq >3\r\n  |  evldd TMP0, 0(CRET1)\r\n  |  evstddx TMP0, BASE, RA\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lwz BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 16\t\t\t// 2 args for func(t, k).\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  evmergelo STR:RC, TISSTR, STR:RC\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   decode_RB8 RB, INS\r\n  |  evstdd STR:RC, 0(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsets:\r\n  |  evmergelo TAB:RB, TISTAB, TAB:RB\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   evmergelo STR:RC, TISSTR, STR:RC\r\n  |  evstdd TAB:RB, 0(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |   evstdd STR:RC, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// TMP0 = index\r\n  |  efdcfsi TMP0, TMP0\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |  evstdd TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stw BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |   evlddx TMP0, BASE, RA\r\n  |  beq >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |   evstdd TMP0, 0(CRET1)\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lwz BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 24\t\t\t// 3 args for func(t, k, v)\r\n  |  evstdd TMP0, 16(BASE)\t\t// Copy value to third argument.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  mr CARG1, L\r\n  |   subi PC, PC, 4\r\n  |  add CARG2, BASE, RA\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, BASE, RD\r\n  |   stw BASE, L->base\r\n  |  decode_OP1 CARG4, INS\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  cmplwi CRET1, 1\r\n  |  bgt ->vmeta_binop\r\n  |4:\r\n  |  lwz INS, 0(PC)\r\n  |   addi PC, PC, 4\r\n  |  decode_RD4 TMP2, INS\r\n  |  addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n  |  add TMP2, TMP2, TMP3\r\n  |  isellt PC, PC, TMP2\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  lwz INS, -4(PC)\r\n  |   evldd TMP0, 0(RA)\r\n  |  decode_RA8 TMP1, INS\r\n  |   evstddx TMP0, BASE, TMP1\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |   li TMP1, LJ_TTRUE\r\n  |  cmplw TMP1, TMP0\t\t\t// Branch if result is true.\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |   li TMP1, LJ_TFALSE\r\n  |  cmplw TMP0, TMP1\t\t\t// Branch if result is false.\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  subi PC, PC, 4\r\n  |   stw BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  add CARG3, KBASE, RC\r\n  |  add CARG4, BASE, RB\r\n  |  b >1\r\n  |\r\n  |->vmeta_unm:\r\n  |  add CARG3, BASE, RD\r\n  |  mr CARG4, CARG3\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, BASE, RC\r\n  |1:\r\n  |  add CARG2, BASE, RA\r\n  |   stw BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  decode_OP1 CARG5, INS\t\t// Caveat: CARG5 overlaps INS.\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub TMP1, CRET1, BASE\r\n  |   stw PC, -16(CRET1)\t\t// [cont|PC]\r\n  |   mr TMP2, BASE\r\n  |  addi PC, TMP1, FRAME_CONT\r\n  |   mr BASE, CRET1\r\n  |  li NARGS8:RC, 16\t\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n#if LJ_52\r\n  |  mr SAVE0, CARG1\r\n#endif\r\n  |  add CARG2, BASE, RD\r\n  |   stw BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  cmplwi CRET1, 0\r\n  |  bne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  mr CARG1, SAVE0\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stw TMP2, L->base\t\t\t// This is the callers base!\r\n  |  subi CARG2, BASE, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, BASE, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stw BASE, L->base\r\n  |  subi CARG2, RA, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, RA, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz TMP1, FRAME_PC(BASE)\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |   lwz LFUNC:RB, FRAME_FUNC(RA)\t// Guaranteed to be a function here.\r\n  |  b ->BC_CALLT_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mr CARG1, L\r\n  |   stw BASE, L->base\r\n  |  mr CARG2, RA\r\n  |   stw PC, SAVE_PC\r\n  |  mr SAVE0, INS\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |.if JIT\r\n  |   decode_OP1 TMP0, SAVE0\r\n  |.endif\r\n  |  decode_RA8 RA, SAVE0\r\n  |.if JIT\r\n  |   cmpwi TMP0, BC_JFORI\r\n  |.endif\r\n  |  decode_RD8 RD, SAVE0\r\n  |.if JIT\r\n  |   beq =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG1, 0(BASE)\r\n  |   evldd CARG2, 8(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc_1 name\r\n  |  checknum CARG1\r\n  |  checkfail ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc_2 name\r\n  |  evmergehi TMP0, CARG1, CARG2\r\n  |  checknum TMP0\r\n  |  checkanyfail ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses TMP0 and TMP1.\r\n  |.macro ffgccheck\r\n  |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n  |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n  |  cmplw TMP0, TMP1\r\n  |  bgel ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc assert\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd TMP0, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  evaddw TMP1, TISNIL, TISNIL\t// Synthesize LJ_TFALSE.\r\n  |  la RA, -8(BASE)\r\n  |   evcmpltu cr1, TMP0, TMP1\r\n  |    lwz PC, FRAME_PC(BASE)\r\n  |  bge cr1, ->fff_fallback\r\n  |   evstdd TMP0, 0(RA)\r\n  |  addi RD, NARGS8:RC, 8\t\t// Compute (nresults+1)*8.\r\n  |   beq ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |  li TMP1, 8\r\n  |  subi RC, RC, 8\r\n  |1:\r\n  |  cmplw TMP1, RC\r\n  |   evlddx TMP0, BASE, TMP1\r\n  |   evstddx TMP0, RA, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bne <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc type\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |    li TMP2, ~LJ_TNUMX\r\n  |  cmplw CARG1, TISNUM\r\n  |  not TMP1, CARG1\r\n  |  isellt TMP1, TMP2, TMP1\r\n  |  slwi TMP1, TMP1, 3\r\n  |   la TMP2, CFUNC:RB->upvalue\r\n  |  evlddx STR:CRET1, TMP2, TMP1\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  checktab CARG1\r\n  |   evmergehi TMP1, CARG1, CARG1\r\n  |  checkfail >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  lwz TAB:RB, TAB:CARG1->metatable\r\n  |2:\r\n  |  evmr CRET1, TISNIL\r\n  |   cmplwi TAB:RB, 0\r\n  |  lwz STR:RC, DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])(DISPATCH)\r\n  |   beq ->fff_restv\r\n  |  lwz TMP0, TAB:RB->hmask\r\n  |   evmergelo CRET1, TISTAB, TAB:RB\t// Use metatable as default result.\r\n  |  lwz TMP1, STR:RC->hash\r\n  |  lwz NODE:TMP2, TAB:RB->node\r\n  |   evmergelo STR:RC, TISSTR, STR:RC\r\n  |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n  |  slwi TMP0, TMP1, 5\r\n  |  slwi TMP1, TMP1, 3\r\n  |  sub TMP1, TMP0, TMP1\r\n  |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  evldd TMP0, NODE:TMP2->key\r\n  |   evldd TMP1, NODE:TMP2->val\r\n  |  evcmpeq TMP0, STR:RC\r\n  |   lwz NODE:TMP2, NODE:TMP2->next\r\n  |  checkallok >5\r\n  |   cmplwi NODE:TMP2, 0\r\n  |   beq ->fff_restv\t\t\t// Not found, keep default result.\r\n  |   b <3\r\n  |5:\r\n  |  checknil TMP1\r\n  |  checkok ->fff_restv\t\t// Ditto for nil value.\r\n  |  evmr CRET1, TMP1\t\t\t// Return value of mt.__metatable.\r\n  |  b ->fff_restv\r\n  |\r\n  |6:\r\n  |  cmpwi TMP1, LJ_TUDATA\r\n  |   not TMP1, TMP1\r\n  |  beq <1\r\n  |  checknum CARG1\r\n  |   slwi TMP1, TMP1, 2\r\n  |   li TMP2, 4*~LJ_TNUMX\r\n  |  isellt TMP1, TMP2, TMP1\r\n  |   la TMP2, DISPATCH_GL(gcroot[GCROOT_BASEMT])(DISPATCH)\r\n  |  lwzx TAB:RB, TMP2, TMP1\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  evmergehi TMP0, TAB:CARG1, TAB:CARG2\r\n  |  checktab TMP0\r\n  |  checkanyfail ->fff_fallback\r\n  |  lwz TAB:TMP1, TAB:CARG1->metatable\r\n  |  cmplwi TAB:TMP1, 0\r\n  |   lbz TMP3, TAB:CARG1->marked\r\n  |  bne ->fff_fallback\r\n  |   andi. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n  |    stw TAB:CARG2, TAB:CARG1->metatable\r\n  |   beq ->fff_restv\r\n  |  barrierback TAB:CARG1, TMP3, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checktab CARG2\r\n  |   la CARG3, 8(BASE)\r\n  |  checkfail ->fff_fallback\r\n  |   mr CARG1, L\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  evldd CRET1, 0(CRET1)\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly one argument.\r\n  |  checknum CARG1\r\n  |  checkok ->fff_restv\r\n  |  b ->fff_fallback\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  checkstr CARG1\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  checkok ->fff_restv\t\t// String key?\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  lwz TMP0, DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])(DISPATCH)\r\n  |  checknum CARG1\r\n  |  cmplwi cr1, TMP0, 0\r\n  |   stw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  crand 4*cr0+eq, 4*cr0+lt, 4*cr1+eq\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  bne ->fff_fallback\r\n  |  ffgccheck\r\n  |  mr CARG1, L\r\n  |  mr CARG2, BASE\r\n  |  bl extern lj_str_fromnum\t\t// (lua_State *L, lua_Number *np)\r\n  |  // Returns GCstr *.\r\n  |  evmergelo STR:CRET1, TISSTR, STR:CRET1\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc next\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |   evstddx TISNIL, BASE, NARGS8:RC\t// Set missing 2nd arg to nil.\r\n  |  checktab TAB:CARG2\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  checkfail ->fff_fallback\r\n  |   stw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  mr CARG1, L\r\n  |   stw BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  la CARG3, 8(BASE)\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  cmplwi CRET1, 0\r\n  |   evmr CRET1, TISNIL\r\n  |  beq ->fff_restv\t\t\t// End of traversal: return nil.\r\n  |  evldd TMP0, 8(BASE)\t\t// Copy key and value to results.\r\n  |   la RA, -8(BASE)\r\n  |  evldd TMP1, 16(BASE)\r\n  |  evstdd TMP0, 0(RA)\r\n  |   li RD, (2+1)*8\r\n  |  evstdd TMP1, 8(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktab TAB:CARG1\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  checkfail ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  evldd CFUNC:TMP0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  evldd CFUNC:TMP0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |   evstdd TISNIL, 8(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  evstdd CFUNC:TMP0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  checktab TAB:CARG1\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  checkfail ->fff_fallback\r\n  |  checknum CARG2\r\n  |    lus TMP3, 0x3ff0\r\n  |  checkfail ->fff_fallback\r\n  |  efdctsi TMP2, CARG2\r\n  |   lwz TMP0, TAB:CARG1->asize\r\n  |    evmergelo TMP3, TMP3, ZERO\r\n  |   lwz TMP1, TAB:CARG1->array\r\n  |  efdadd CARG2, CARG2, TMP3\r\n  |  addi TMP2, TMP2, 1\r\n  |   la RA, -8(BASE)\r\n  |  cmplw TMP0, TMP2\r\n  |   slwi TMP3, TMP2, 3\r\n  |  evstdd CARG2, 0(RA)\r\n  |  ble >2\t\t\t\t// Not in array part?\r\n  |  evlddx TMP1, TMP1, TMP3\r\n  |1:\r\n  |  checknil TMP1\r\n  |   li RD, (0+1)*8\r\n  |  checkok ->fff_res\t\t\t// End of iteration, return 0 results.\r\n  |   li RD, (2+1)*8\r\n  |  evstdd TMP1, 8(RA)\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  lwz TMP0, TAB:CARG1->hmask\r\n  |  cmplwi TMP0, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |   mr CARG2, TMP2\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  cmplwi CRET1, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |  evldd TMP1, 0(CRET1)\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktab TAB:CARG1\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  checkfail ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  evldd CFUNC:TMP0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  evldd CFUNC:TMP0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |    evsplati TMP1, 0\r\n  |  li RD, (3+1)*8\r\n  |    evstdd TMP1, 8(BASE)\r\n  |  evstdd CFUNC:TMP0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  blt ->fff_fallback\r\n  |   mr TMP2, BASE\r\n  |   la BASE, 8(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP3, TMP3, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |   subi NARGS8:RC, NARGS8:RC, 8\r\n  |  addi PC, TMP3, 8+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |   mr TMP2, BASE\r\n  |  checkfunc CARG2\t\t\t// Traceback must be a function.\r\n  |  checkfail ->fff_fallback\r\n  |   la BASE, 16(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP3, TMP3, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |   evstdd CARG2, 0(TMP2)\t\t// Swap function and traceback.\r\n  |  subi NARGS8:RC, NARGS8:RC, 16\r\n  |   evstdd CARG1, 8(TMP2)\r\n  |  addi PC, TMP3, 16+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  evmergehi TMP0, L:CARG1, L:CARG1\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  lwz L:CARG1, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |.if resume\r\n  |  cmpwi TMP0, LJ_TTHREAD\r\n  |  bne ->fff_fallback\r\n  |.endif\r\n  |  lbz TMP0, L:CARG1->status\r\n  |   lwz TMP1, L:CARG1->cframe\r\n  |    lwz CARG2, L:CARG1->top\r\n  |  cmplwi cr0, TMP0, LUA_YIELD\r\n  |    lwz TMP2, L:CARG1->base\r\n  |   cmplwi cr1, TMP1, 0\r\n  |   lwz TMP0, L:CARG1->maxstack\r\n  |    cmplw cr7, CARG2, TMP2\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  crorc 4*cr6+lt, 4*cr0+gt, 4*cr1+eq\t\t// st>LUA_YIELD || cframe!=0\r\n  |   add TMP2, CARG2, NARGS8:RC\r\n  |  crandc 4*cr6+gt, 4*cr7+eq, 4*cr0+eq\t// base==top && st!=LUA_YIELD\r\n  |   cmplw cr1, TMP2, TMP0\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr6+gt\r\n  |   stw PC, SAVE_PC\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr1+gt\t\t// cond1 || cond2 || stackov\r\n  |   stw BASE, L->base\r\n  |  blt cr6, ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  addi BASE, BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |  subi NARGS8:RC, NARGS8:RC, 8\r\n  |  subi TMP2, TMP2, 8\r\n  |.endif\r\n  |  stw TMP2, L:CARG1->top\r\n  |  li TMP1, 0\r\n  |  stw BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |  cmpw TMP1, NARGS8:RC\r\n  |   evlddx TMP0, BASE, TMP1\r\n  |  beq >3\r\n  |   evstddx TMP0, CARG2, TMP1\r\n  |  addi TMP1, TMP1, 8\r\n  |  b <2\r\n  |3:\r\n  |  li CARG3, 0\r\n  |   mr L:SAVE0, L:CARG1\r\n  |  li CARG4, 0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  lwz TMP2, L:SAVE0->base\r\n  |   cmplwi CRET1, LUA_YIELD\r\n  |  lwz TMP3, L:SAVE0->top\r\n  |    li_vmstate INTERP\r\n  |  lwz BASE, L->base\r\n  |    st_vmstate\r\n  |   bgt >8\r\n  |  sub RD, TMP3, TMP2\r\n  |   lwz TMP0, L->maxstack\r\n  |  cmplwi RD, 0\r\n  |   add TMP1, BASE, RD\r\n  |  beq >6\t\t\t\t// No results?\r\n  |  cmplw TMP1, TMP0\r\n  |   li TMP1, 0\r\n  |  bgt >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  subi TMP3, RD, 8\r\n  |   stw TMP2, L:SAVE0->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |  cmplw TMP1, TMP3\r\n  |   evlddx TMP0, TMP2, TMP1\r\n  |   evstddx TMP0, BASE, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bne <5\r\n  |6:\r\n  |  andi. TMP0, PC, FRAME_TYPE\r\n  |.if resume\r\n  |  li TMP1, LJ_TTRUE\r\n  |   la RA, -8(BASE)\r\n  |  stw TMP1, -8(BASE)\t\t\t// Prepend true to results.\r\n  |  addi RD, RD, 16\r\n  |.else\r\n  |  mr RA, BASE\r\n  |  addi RD, RD, 8\r\n  |.endif\r\n  |7:\r\n  |    stw PC, SAVE_PC\r\n  |   mr MULTRES, RD\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  andi. TMP0, PC, FRAME_TYPE\r\n  |  la TMP3, -8(TMP3)\r\n  |   li TMP1, LJ_TFALSE\r\n  |  evldd TMP0, 0(TMP3)\r\n  |   stw TMP3, L:SAVE0->top\t\t// Remove error from coroutine stack.\r\n  |    li RD, (2+1)*8\r\n  |   stw TMP1, -8(BASE)\t\t// Prepend false to results.\r\n  |    la RA, -8(BASE)\r\n  |  evstdd TMP0, 0(BASE)\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mr CARG1, L\r\n  |  mr CARG2, L:SAVE0\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mr CARG1, L\r\n  |  srwi CARG2, RD, 3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  li CRET1, 0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  lwz TMP0, L->cframe\r\n  |   add TMP1, BASE, NARGS8:RC\r\n  |   stw BASE, L->base\r\n  |  andi. TMP0, TMP0, CFRAME_RESUME\r\n  |   stw TMP1, L->top\r\n  |    li CRET1, LUA_YIELD\r\n  |  beq ->fff_fallback\r\n  |   stw ZERO, L->cframe\r\n  |    stb CRET1, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.ffunc_n math_abs\r\n  |  efdabs CRET1, CARG1\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CRET1 = TValue result.\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |   la RA, -8(BASE)\r\n  |  evstdd CRET1, 0(RA)\r\n  |->fff_res1:\r\n  |  // RA = results, PC = return.\r\n  |  li RD, (1+1)*8\r\n  |->fff_res:\r\n  |  // RA = results, RD = (nresults+1)*8, PC = return.\r\n  |  andi. TMP0, PC, FRAME_TYPE\r\n  |   mr MULTRES, RD\r\n  |  bne ->vm_return\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RB8 RB, INS\r\n  |5:\r\n  |  cmplw RB, RD\t\t\t// More results expected?\r\n  |   decode_RA8 TMP0, INS\r\n  |  bgt >6\r\n  |  ins_next1\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |   sub BASE, RA, TMP0\r\n  |  ins_next2\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  subi TMP1, RD, 8\r\n  |   addi RD, RD, 8\r\n  |  evstddx TISNIL, RA, TMP1\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc math_ .. func\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG2\r\n  |   evmergehi CARG1, CARG2, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  bl extern func@plt\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc math_ .. func\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG2, 0(BASE)\r\n  |   evldd CARG4, 8(BASE)\r\n  |  blt ->fff_fallback\r\n  |  evmergehi CARG1, CARG4, CARG2\r\n  |  checknum CARG1\r\n  |   evmergehi CARG3, CARG4, CARG4\r\n  |  checkanyfail ->fff_fallback\r\n  |  bl extern func@plt\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc math_ .. func\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG2\r\n  |   evmergehi CARG1, CARG2, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bl ->vm_..func.._hilo;\r\n  |  la RA, -8(BASE)\r\n  |  evstdd CRET2, 0(RA)\r\n  |  b ->fff_res1\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |  math_extern sqrt\r\n  |\r\n  |.ffunc math_log\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  bne ->fff_fallback                 // Need exactly 1 argument.\r\n  |  checknum CARG2\r\n  |   evmergehi CARG1, CARG2, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  bl extern log@plt\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |  b ->fff_restv\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |->ff_math_deg:\r\n  |.ffunc_n math_rad\r\n  |  evldd CARG2, CFUNC:RB->upvalue[0]\r\n  |  efdmul CRET1, CARG1, CARG2\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc math_ldexp\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG2, 0(BASE)\r\n  |   evldd CARG4, 8(BASE)\r\n  |  blt ->fff_fallback\r\n  |  evmergehi CARG1, CARG4, CARG2\r\n  |  checknum CARG1\r\n  |  checkanyfail ->fff_fallback\r\n  |  efdctsi CARG3, CARG4\r\n  |  bl extern ldexp@plt\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc math_frexp\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG2\r\n  |   evmergehi CARG1, CARG2, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bl extern frexp@plt\r\n  |   lwz TMP1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |   efdcfsi CRET2, TMP1\r\n  |   la RA, -8(BASE)\r\n  |  evstdd CRET1, 0(RA)\r\n  |  li RD, (2+1)*8\r\n  |   evstdd CRET2, 8(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc math_modf\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG2, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG2\r\n  |   evmergehi CARG1, CARG2, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  la CARG3, -8(BASE)\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bl extern modf@plt\r\n  |  evmergelo CRET1, CRET1, CRET2\r\n  |   la RA, -8(BASE)\r\n  |  evstdd CRET1, 0(BASE)\r\n  |  li RD, (2+1)*8\r\n  |  b ->fff_res\r\n  |\r\n  |.macro math_minmax, name, cmpop\r\n  |  .ffunc_1 name\r\n  |  checknum CARG1\r\n  |   li TMP1, 8\r\n  |  checkfail ->fff_fallback\r\n  |1:\r\n  |  evlddx CARG2, BASE, TMP1\r\n  |  cmplw cr1, TMP1, NARGS8:RC\r\n  |   checknum CARG2\r\n  |  bge cr1, ->fff_restv\t\t// Ok, since CRET1 = CARG1.\r\n  |   checkfail ->fff_fallback\r\n  |  cmpop CARG2, CARG1\r\n  |   addi TMP1, TMP1, 8\r\n  |  crmove 4*cr0+lt, 4*cr0+gt\r\n  |  evsel CARG1, CARG2, CARG1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, efdtstlt\r\n  |  math_minmax math_max, efdtstgt\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc_1 string_len\r\n  |  checkstr STR:CARG1\r\n  |  checkfail ->fff_fallback\r\n  |  lwz TMP0, STR:CARG1->len\r\n  |  efdcfsi CRET1, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd STR:CARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |  checkstr STR:CARG1\r\n  |   la RA, -8(BASE)\r\n  |  checkfail ->fff_fallback\r\n  |  lwz TMP0, STR:CARG1->len\r\n  |   li RD, (0+1)*8\r\n  |    lbz TMP1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   li TMP2, (1+1)*8\r\n  |  cmplwi TMP0, 0\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |    efdcfsi CRET1, TMP1\r\n  |  iseleq RD, RD, TMP2\r\n  |    evstdd CRET1, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 1 argument.\r\n  |  checknum CARG1\r\n  |   la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  checkfail ->fff_fallback\r\n  |  efdctsiz TMP0, CARG1\r\n  |   li CARG3, 1\r\n  |  cmplwi TMP0, 255\r\n  |   stb TMP0, 0(CARG2)\r\n  |  bgt ->fff_fallback\r\n  |->fff_newstr:\r\n  |  mr CARG1, L\r\n  |  stw BASE, L->base\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |  // Returns GCstr *.\r\n  |  lwz BASE, L->base\r\n  |   evmergelo STR:CRET1, TISSTR, STR:CRET1\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG3, 16(BASE)\r\n  |   evldd STR:CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |   evldd CARG2, 8(BASE)\r\n  |   li TMP2, -1\r\n  |  beq >1\r\n  |  checknum CARG3\r\n  |  checkfail ->fff_fallback\r\n  |  efdctsiz TMP2, CARG3\r\n  |1:\r\n  |  checknum CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  checkstr STR:CARG1\r\n  |   efdctsiz TMP1, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |   lwz TMP0, STR:CARG1->len\r\n  |  cmplw TMP0, TMP2\t\t\t// len < end? (unsigned compare)\r\n  |   add TMP3, TMP2, TMP0\r\n  |  blt >5\r\n  |2:\r\n  |  cmpwi TMP1, 0\t\t\t// start <= 0?\r\n  |   add TMP3, TMP1, TMP0\r\n  |  ble >7\r\n  |3:\r\n  |  sub. CARG3, TMP2, TMP1\r\n  |    addi CARG2, STR:CARG1, #STR-1\r\n  |   addi CARG3, CARG3, 1\r\n  |    add CARG2, CARG2, TMP1\r\n  |  isellt CARG3, r0, CARG3\r\n  |  b ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  cmpw TMP0, TMP2\r\n  |   addi TMP3, TMP3, 1\r\n  |  iselgt TMP2, TMP3, TMP0\t\t// end = end > len ? len : end+len+1\r\n  |  b <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |   cmpwi cr1, TMP3, 0\r\n  |  iseleq TMP1, r0, TMP3\r\n  |   isel TMP1, r0, TMP1, 4*cr1+lt\r\n  |  addi TMP1, TMP1, 1\t\t\t// start = 1 + (start ? start+len : 0)\r\n  |  b <3\r\n  |\r\n  |.ffunc string_rep\t\t\t// Only handle the 1-char case inline.\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   evldd CARG1, 0(BASE)\r\n  |   evldd CARG2, 8(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 2 arguments.\r\n  |  checknum CARG2\r\n  |  checkfail ->fff_fallback\r\n  |  checkstr STR:CARG1\r\n  |   efdctsiz CARG3, CARG2\r\n  |  checkfail ->fff_fallback\r\n  |   lwz TMP0, STR:CARG1->len\r\n  |  cmpwi CARG3, 0\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  ble >2\t\t\t\t// Count <= 0? (or non-int)\r\n  |   cmplwi TMP0, 1\r\n  |  subi TMP2, CARG3, 1\r\n  |   blt >2\t\t\t\t// Zero length string?\r\n  |  cmplw cr1, TMP1, CARG3\r\n  |   bne ->fff_fallback\t\t// Fallback for > 1-char strings.\r\n  |   lbz TMP0, STR:CARG1[1]\r\n  |   lwz CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  blt cr1, ->fff_fallback\r\n  |1:  // Fill buffer with char. Yes, this is suboptimal code (do you care?).\r\n  |  cmplwi TMP2, 0\r\n  |   stbx TMP0, CARG2, TMP2\r\n  |   subi TMP2, TMP2, 1\r\n  |  bne <1\r\n  |  b ->fff_newstr\r\n  |2:  // Return empty string.\r\n  |  la STR:CRET1, DISPATCH_GL(strempty)(DISPATCH)\r\n  |  evmergelo CRET1, TISSTR, STR:CRET1\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_reverse\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checkstr STR:CARG1\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  checkfail ->fff_fallback\r\n  |  lwz CARG3, STR:CARG1->len\r\n  |   la CARG1, #STR(STR:CARG1)\r\n  |   lwz CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |   li TMP2, 0\r\n  |  cmplw TMP1, CARG3\r\n  |   subi TMP3, CARG3, 1\r\n  |  blt ->fff_fallback\r\n  |1:  // Reverse string copy.\r\n  |  cmpwi TMP3, 0\r\n  |   lbzx TMP1, CARG1, TMP2\r\n  |  blt ->fff_newstr\r\n  |   stbx TMP1, CARG2, TMP3\r\n  |  subi TMP3, TMP3, 1\r\n  |  addi TMP2, TMP2, 1\r\n  |  b <1\r\n  |\r\n  |.macro ffstring_case, name, lo\r\n  |  .ffunc name\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   evldd CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checkstr STR:CARG1\r\n  |   lwz TMP1, DISPATCH_GL(tmpbuf.sz)(DISPATCH)\r\n  |  checkfail ->fff_fallback\r\n  |  lwz CARG3, STR:CARG1->len\r\n  |   la CARG1, #STR(STR:CARG1)\r\n  |   lwz CARG2, DISPATCH_GL(tmpbuf.buf)(DISPATCH)\r\n  |  cmplw TMP1, CARG3\r\n  |   li TMP2, 0\r\n  |  blt ->fff_fallback\r\n  |1:  // ASCII case conversion.\r\n  |  cmplw TMP2, CARG3\r\n  |   lbzx TMP1, CARG1, TMP2\r\n  |  bge ->fff_newstr\r\n  |   subi TMP0, TMP1, lo\r\n  |    xori TMP3, TMP1, 0x20\r\n  |   cmplwi TMP0, 26\r\n  |   isellt TMP1, TMP3, TMP1\r\n  |   stbx TMP1, CARG2, TMP2\r\n  |  addi TMP2, TMP2, 1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |ffstring_case string_lower, 65\r\n  |ffstring_case string_upper, 97\r\n  |\r\n  |//-- Table library ------------------------------------------------------\r\n  |\r\n  |.ffunc_1 table_getn\r\n  |  checktab CARG1\r\n  |  checkfail ->fff_fallback\r\n  |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n  |  // Returns uint32_t (but less than 2^31).\r\n  |  efdcfsi CRET1, CRET1\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_n bit_..name\r\n  |  efdadd CARG1, CARG1, TOBIT\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit tobit\r\n  |->fff_resbit:\r\n  |  efdcfsi CRET1, CARG1\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |   li TMP1, 8\r\n  |1:\r\n  |  evlddx CARG2, BASE, TMP1\r\n  |  cmplw cr1, TMP1, NARGS8:RC\r\n  |   checknum CARG2\r\n  |  bge cr1, ->fff_resbit\r\n  |   checkfail ->fff_fallback\r\n  |  efdadd CARG2, CARG2, TOBIT\r\n  |  ins CARG1, CARG1, CARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, or\r\n  |.ffunc_bit_op bxor, xor\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  rotlwi TMP0, CARG1, 8\r\n  |  rlwimi TMP0, CARG1, 24, 0, 7\r\n  |  rlwimi TMP0, CARG1, 24, 16, 23\r\n  |  efdcfsi CRET1, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  not TMP0, CARG1\r\n  |  efdcfsi CRET1, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc_nn bit_..name\r\n  |  efdadd CARG2, CARG2, TOBIT\r\n  |   efdadd CARG1, CARG1, TOBIT\r\n  |.if shmod == 1\r\n  |  rlwinm CARG2, CARG2, 0, 27, 31\r\n  |.elif shmod == 2\r\n  |  neg CARG2, CARG2\r\n  |.endif\r\n  |  ins TMP0, CARG1, CARG2\r\n  |  efdcfsi CRET1, TMP0\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, slw, 1\r\n  |.ffunc_bit_sh rshift, srw, 1\r\n  |.ffunc_bit_sh arshift, sraw, 1\r\n  |.ffunc_bit_sh rol, rotlw, 0\r\n  |.ffunc_bit_sh ror, rotlw, 2\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RB = CFUNC, RC = nargs*8\r\n  |  lwz TMP3, CFUNC:RB->f\r\n  |    add TMP1, BASE, NARGS8:RC\r\n  |   lwz PC, FRAME_PC(BASE)\t\t// Fallback may overwrite PC.\r\n  |    addi TMP0, TMP1, 8*LUA_MINSTACK\r\n  |     lwz TMP2, L->maxstack\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  cmplw TMP0, TMP2\r\n  |     stw BASE, L->base\r\n  |    stw TMP1, L->top\r\n  |   mr CARG1, L\r\n  |  bgt >5\t\t\t\t// Need to grow stack.\r\n  |  mtctr TMP3\r\n  |  bctrl\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  lwz BASE, L->base\r\n  |  cmpwi CRET1, 0\r\n  |   slwi RD, CRET1, 3\r\n  |   la RA, -8(BASE)\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |  lwz TMP0, L->top\r\n  |   lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  andi. TMP0, PC, FRAME_TYPE\r\n  |   rlwinm TMP1, PC, 0, 0, 28\r\n  |  bne >3\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RA8 TMP1, INS\r\n  |  addi TMP1, TMP1, 8\r\n  |3:\r\n  |  sub TMP2, BASE, TMP1\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lwz BASE, L->base\r\n  |  cmpw TMP0, TMP0\t\t\t// Set 4*cr0+eq to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  mflr SAVE0\r\n  |   stw BASE, L->base\r\n  |  add TMP0, BASE, NARGS8:RC\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  stw TMP0, L->top\r\n  |  mr CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |   lwz BASE, L->base\r\n  |  mtlr SAVE0\r\n  |    lwz TMP0, L->top\r\n  |   sub NARGS8:RC, TMP0, BASE\r\n  |   lwz CFUNC:RB, FRAME_FUNC(BASE)\r\n  |  blr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  NYI\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andi. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |  beq >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\t// Assumes decode_OP4 TMP1, INS.\r\n  |  lwzx TMP0, DISPATCH, TMP1\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  lwz TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |   rlwinm TMP0, TMP3, 31-LUA_HOOKLINE, 31, 0\r\n  |  bne <5\r\n  |\r\n  |   cmpwi cr1, TMP0, 0\r\n  |  addic. TMP2, TMP2, -1\r\n  |   beq cr1, <5\r\n  |  stw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  beq >1\r\n  |   bge cr1, <5\r\n  |1:\r\n  |  mr CARG1, L\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  mr CARG2, PC\r\n  |   stw BASE, L->base\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  lwz BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  lwz INS, -4(PC)\r\n  |  decode_OP4 TMP1, INS\r\n  |   decode_RB8 RB, INS\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\r\n  |   decode_RD8 RD, INS\r\n  |  lwzx TMP0, DISPATCH, TMP1\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RC8 RC, INS\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  addi PC, PC, 4\r\n  |  lwz MULTRES, -20(RB)\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  NYI\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mr CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  ori CARG2, PC, 1\r\n  |1:\r\n  |.endif\r\n  |  add TMP0, BASE, RC\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |   stw BASE, L->base\r\n  |  sub RA, RA, BASE\r\n  |   stw TMP0, L->top\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  lwz BASE, L->base\r\n  |   lwz TMP0, L->top\r\n  |   stw ZERO, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  add RA, BASE, RA\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  mtctr CRET1\r\n  |  bctr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  NYI\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |.if JIT\r\n  |  NYI\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called by math.floor/math.ceil fast functions\r\n  |// and from JIT code.\r\n  |//\r\n  |// This can be inlined if the CPU has the frin/friz/frip/frim instructions.\r\n  |// The alternative hard-float approaches have a deep dependency chain.\r\n  |// The resulting latency is at least 3x-7x the double-precision FP latency\r\n  |// (e500v2: 6cy, e600: 5cy, Cell: 10cy) or around 20-70 cycles.\r\n  |//\r\n  |// The soft-float approach is tedious, but much faster (e500v2: ~11cy/~6cy).\r\n  |// However it relies on a fast way to transfer the FP value to GPRs\r\n  |// (e500v2: 0cy for lo-word, 1cy for hi-word).\r\n  |//\r\n  |.macro vm_round, name, mode\r\n  |  // Used temporaries: TMP0, TMP1, TMP2, TMP3.\r\n  |->name.._efd:\t\t\t// Input: CARG2, output: CRET2\r\n  |  evmergehi CARG1, CARG2, CARG2\r\n  |->name.._hilo:\r\n  |  // Input: CARG1 (hi), CARG2 (hi, lo), output: CRET2\r\n  |  rlwinm TMP2, CARG1, 12, 21, 31\r\n  |  addic. TMP2, TMP2, -1023\t\t// exp = exponent(x) - 1023\r\n  |   li TMP1, -1\r\n  |  cmplwi cr1, TMP2, 51\t\t// 0 <= exp <= 51?\r\n  |   subfic TMP0, TMP2, 52\r\n  |  bgt cr1, >1\r\n  |   lus TMP3, 0xfff0\r\n  |  slw TMP0, TMP1, TMP0\t\t// lomask = -1 << (52-exp)\r\n  |   sraw TMP1, TMP3, TMP2\t\t// himask = (int32_t)0xfff00000 >> exp\r\n  |.if mode == 2\t\t// trunc(x):\r\n  |  evmergelo TMP0, TMP1, TMP0\r\n  |  evand CRET2, CARG2, TMP0\t\t// hi &= himask, lo &= lomask\r\n  |.else\r\n  |  andc TMP2, CARG2, TMP0\r\n  |   andc TMP3, CARG1, TMP1\r\n  |  or TMP2, TMP2, TMP3\t\t// ztest = (hi&~himask) | (lo&~lomask)\r\n  |   srawi TMP3, CARG1, 31\t\t// signmask = (int32_t)hi >> 31\r\n  |.if mode == 0\t\t// floor(x):\r\n  |  and. TMP2, TMP2, TMP3\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\t\t\t// ceil(x):\r\n  |  andc. TMP2, TMP2, TMP3\t\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |  and CARG2, CARG2, TMP0\t\t// lo &= lomask\r\n  |  and CARG1, CARG1, TMP1\t\t// hi &= himask\r\n  |   subc TMP0, CARG2, TMP0\r\n  |  iseleq TMP0, CARG2, TMP0\t\t// lo = iszero ? lo : lo-lomask\r\n  |   sube TMP1, CARG1, TMP1\r\n  |  iseleq TMP1, CARG1, TMP1\t\t// hi = iszero ? hi : hi-himask+carry\r\n  |  evmergelo CRET2, TMP1, TMP0\r\n  |.endif\r\n  |  blr\r\n  |1:\r\n  |  bgtlr\t\t\t\t// Already done if >=2^52, +-inf or nan.\r\n  |.if mode == 2\t\t// trunc(x):\r\n  |  rlwinm TMP1, CARG1, 0, 0, 0\t// hi = sign(x)\r\n  |  li TMP0, 0\r\n  |  evmergelo CRET2, TMP1, TMP0\r\n  |.else\r\n  |  rlwinm TMP2, CARG1, 0, 1, 31\r\n  |  srawi TMP0, CARG1, 31\t\t// signmask = (int32_t)hi >> 31\r\n  |  or TMP2, TMP2, CARG2\t\t// ztest = abs(hi) | lo\r\n  |   lus TMP1, 0x3ff0\r\n  |.if mode == 0\t\t// floor(x):\r\n  |  and. TMP2, TMP2, TMP0\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\t\t\t// ceil(x):\r\n  |  andc. TMP2, TMP2, TMP0\t\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |   li TMP0, 0\r\n  |  iseleq TMP1, r0, TMP1\r\n  |  rlwimi CARG1, TMP1, 0, 1, 31\t// hi = sign(x) | (iszero ? 0.0 : 1.0)\r\n  |  evmergelo CRET2, CARG1, TMP0\r\n  |.endif\r\n  |  blr\r\n  |.endmacro\r\n  |\r\n  |->vm_floor:\r\n  |  mflr CARG3\r\n  |  evmergelo CARG2, CARG1, CARG2\r\n  |  bl ->vm_floor_hilo\r\n  |  mtlr CARG3\r\n  |  evmergehi CRET1, CRET2, CRET2\r\n  |  blr\r\n  |\r\n  |  vm_round vm_floor, 0\r\n  |  vm_round vm_ceil,  1\r\n  |.if JIT\r\n  |  vm_round vm_trunc, 2\r\n  |.else\r\n  |->vm_trunc_efd:\r\n  |->vm_trunc_hilo:\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_ffi_call:\r\n  |.if FFI\r\n  |  NYI\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  evlddx TMP0, BASE, RA\r\n    |   addi PC, PC, 4\r\n    |  evlddx TMP1, BASE, RD\r\n    |   addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |   lwz TMP2, -4(PC)\r\n    |  evmergehi RB, TMP0, TMP1\r\n    |   decode_RD4 TMP2, TMP2\r\n    |  checknum RB\r\n    |   add TMP2, TMP2, TMP3\r\n    |  checkanyfail ->vmeta_comp\r\n    |  efdcmplt TMP0, TMP1\r\n    if (op == BC_ISLE || op == BC_ISGT) {\r\n      |  efdcmpeq cr1, TMP0, TMP1\r\n      |  cror 4*cr0+gt, 4*cr0+gt, 4*cr1+gt\r\n    }\r\n    if (op == BC_ISLT || op == BC_ISLE) {\r\n      |  iselgt PC, TMP2, PC\r\n    } else {\r\n      |  iselgt PC, PC, TMP2\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  evlddx CARG2, BASE, RA\r\n    |   addi PC, PC, 4\r\n    |  evlddx CARG3, BASE, RD\r\n    |   addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |   lwz TMP2, -4(PC)\r\n    |  evmergehi RB, CARG2, CARG3\r\n    |   decode_RD4 TMP2, TMP2\r\n    |  checknum RB\r\n    |   add TMP2, TMP2, TMP3\r\n    |  checkanyfail >5\r\n    |  efdcmpeq CARG2, CARG3\r\n    if (vk) {\r\n      |  iselgt PC, TMP2, PC\r\n    } else {\r\n      |  iselgt PC, PC, TMP2\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |5:  // Either or both types are not numbers.\r\n    |  evcmpeq CARG2, CARG3\r\n    |   not TMP3, RB\r\n    |   cmplwi cr1, TMP3, ~LJ_TISPRI\t\t// Primitive?\r\n    |  crorc 4*cr7+lt, 4*cr0+so, 4*cr0+lt\t// 1: Same tv or different type.\r\n    |   cmplwi cr6, TMP3, ~LJ_TISTABUD\t\t// Table or userdata?\r\n    |  crandc 4*cr7+gt, 4*cr0+lt, 4*cr1+gt\t// 2: Same type and primitive.\r\n    |   mr SAVE0, PC\r\n    if (vk) {\r\n      |  isel PC, TMP2, PC, 4*cr7+gt\r\n    } else {\r\n      |  isel TMP2, PC, TMP2, 4*cr7+gt\r\n    }\r\n    |  cror 4*cr7+lt, 4*cr7+lt, 4*cr7+gt\t// 1 or 2.\r\n    if (vk) {\r\n      |  isel PC, TMP2, PC, 4*cr0+so\r\n    } else {\r\n      |  isel PC, PC, TMP2, 4*cr0+so\r\n    }\r\n    |  blt cr7, <1\t\t\t// Done if 1 or 2.\r\n    |  blt cr6, <1\t\t\t// Done if not tab/ud.\r\n    |\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  lwz TAB:TMP2, TAB:CARG2->metatable\r\n    |   li CARG4, 1-vk\t\t\t// ne = 0 or 1.\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable?\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andi. TMP2, TMP2, 1<<MM_eq\r\n    |  bne <1\t\t\t\t// Or 'no __eq' flag set?\r\n    |  mr PC, SAVE0\t\t\t// Restore old PC.\r\n    |  b ->vmeta_equal\t\t\t// Handle __eq metamethod.\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RD = str_const*8 (~), JMP with RD = target\r\n    |  evlddx TMP0, BASE, RA\r\n    |   srwi RD, RD, 1\r\n    |    lwz INS, 0(PC)\r\n    |   subfic RD, RD, -4\r\n    |    addi PC, PC, 4\r\n    |   lwzx STR:TMP1, KBASE, RD\t// KBASE-4-str_const*4\r\n    |    addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |    decode_RD4 TMP2, INS\r\n    |   evmergelo STR:TMP1, TISSTR, STR:TMP1\r\n    |    add TMP2, TMP2, TMP3\r\n    |  evcmpeq TMP0, STR:TMP1\r\n    if (vk) {\r\n      |  isel PC, TMP2, PC, 4*cr0+so\r\n    } else {\r\n      |  isel PC, PC, TMP2, 4*cr0+so\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RD = num_const*8, JMP with RD = target\r\n    |  evlddx TMP0, BASE, RA\r\n    |   addi PC, PC, 4\r\n    |  evlddx TMP1, KBASE, RD\r\n    |   addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |   lwz INS, -4(PC)\r\n    |  checknum TMP0\r\n    |  checkfail >5\r\n    |  efdcmpeq TMP0, TMP1\r\n    |1:\r\n    |   decode_RD4 TMP2, INS\r\n    |   add TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  iselgt PC, TMP2, PC\r\n      |5:\r\n    } else {\r\n      |  iselgt PC, PC, TMP2\r\n    }\r\n    |3:\r\n    |  ins_next\r\n    if (!vk) {\r\n      |5:\r\n      |  decode_RD4 TMP2, INS\r\n      |  add PC, TMP2, TMP3\r\n      |  b <3\r\n    }\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RD = primitive_type*8 (~), JMP with RD = target\r\n    |  lwzx TMP0, BASE, RA\r\n    |   srwi TMP1, RD, 3\r\n    |    lwz INS, 0(PC)\r\n    |    addi PC, PC, 4\r\n    |   not TMP1, TMP1\r\n    |    addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |  cmplw TMP0, TMP1\r\n    |    decode_RD4 TMP2, INS\r\n    |    add TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  iseleq PC, TMP2, PC\r\n    } else {\r\n      |  iseleq PC, PC, TMP2\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RD = src*8, JMP with RD = target\r\n    |  evlddx TMP0, BASE, RD\r\n    |   evaddw TMP1, TISNIL, TISNIL\t// Synthesize LJ_TFALSE.\r\n    |   lwz INS, 0(PC)\r\n    |  evcmpltu TMP0, TMP1\r\n    |   addi PC, PC, 4\r\n    if (op == BC_IST || op == BC_ISF) {\r\n      |  addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n      |  decode_RD4 TMP2, INS\r\n      |  add TMP2, TMP2, TMP3\r\n      if (op == BC_IST) {\r\n\t|  isellt PC, TMP2, PC\r\n      } else {\r\n\t|  isellt PC, PC, TMP2\r\n      }\r\n    } else {\r\n      if (op == BC_ISTC) {\r\n\t|  checkfail >1\r\n      } else {\r\n\t|  checkok >1\r\n      }\r\n      |  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n      |  decode_RD4 TMP2, INS\r\n      |   evstddx TMP0, BASE, RA\r\n      |  add PC, PC, TMP2\r\n      |1:\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  evlddx TMP0, BASE, RD\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  lwzx TMP0, BASE, RD\r\n    |  subfic TMP1, TMP0, LJ_TTRUE\r\n    |  adde TMP0, TMP0, TMP1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  evlddx TMP0, BASE, RD\r\n    |  checknum TMP0\r\n    |  checkfail ->vmeta_unm\r\n    |  efdneg TMP0, TMP0\r\n    |  ins_next1\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  evlddx CARG1, BASE, RD\r\n    |  checkstr CARG1\r\n    |  checkfail >2\r\n    |  lwz CRET1, STR:CARG1->len\r\n    |1:\r\n    |  ins_next1\r\n    |  efdcfsi TMP0, CRET1\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    |2:\r\n    |  checktab CARG1\r\n    |  checkfail ->vmeta_len\r\n#if LJ_52\r\n    |  lwz TAB:TMP2, TAB:CARG1->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  bne >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n#if LJ_52\r\n    |9:\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andi. TMP0, TMP0, 1<<MM_len\r\n    |  bne <3\t\t\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre, t0, t1\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   evlddx t0, BASE, RB\r\n    |    checknum t0\r\n    |   evlddx t1, KBASE, RC\r\n    |    checkfail ->vmeta_arith_vn\r\n    ||  break;\r\n    ||case 1:\r\n    |   evlddx t1, BASE, RB\r\n    |    checknum t1\r\n    |   evlddx t0, KBASE, RC\r\n    |    checkfail ->vmeta_arith_nv\r\n    ||  break;\r\n    ||default:\r\n    |   evlddx t0, BASE, RB\r\n    |   evlddx t1, BASE, RC\r\n    |    evmergehi TMP2, t0, t1\r\n    |    checknum TMP2\r\n    |    checkanyfail ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, ins\r\n    |  ins_arithpre TMP0, TMP1\r\n    |  ins_next1\r\n    |  ins TMP0, TMP0, TMP1\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith efdadd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith efdsub\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith efdmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith efddiv\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arithpre RD, SAVE0\r\n    |->BC_MODVN_Z:\r\n    |  efddiv CARG2, RD, SAVE0\r\n    |  bl ->vm_floor_efd\t\t// floor(b/c)\r\n    |  efdmul TMP0, CRET2, SAVE0\r\n    |  ins_next1\r\n    |  efdsub TMP0, RD, TMP0\t\t// b - floor(b/c)*c\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithpre RD, SAVE0\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    break;\r\n  case BC_POW:\r\n    |  evlddx CARG2, BASE, RB\r\n    |  evlddx CARG4, BASE, RC\r\n    |  evmergehi CARG1, CARG4, CARG2\r\n    |  checknum CARG1\r\n    |   evmergehi CARG3, CARG4, CARG4\r\n    |  checkanyfail ->vmeta_arith_vv\r\n    |  bl extern pow@plt\r\n    |  evmergelo CRET2, CRET1, CRET2\r\n    |  evstddx CRET2, BASE, RA\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  // RA = dst*8, RB = src_start*8, RC = src_end*8\r\n    |  sub CARG3, RC, RB\r\n    |   stw BASE, L->base\r\n    |  add CARG2, BASE, RC\r\n    |  mr SAVE0, RB\r\n    |->BC_CAT_Z:\r\n    |   stw PC, SAVE_PC\r\n    |  mr CARG1, L\r\n    |  srwi CARG3, CARG3, 3\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  cmplwi CRET1, 0\r\n    |   lwz BASE, L->base\r\n    |  bne ->vmeta_binop\r\n    |  evlddx TMP0, BASE, SAVE0\t\t// Copy result from RB to RA.\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n    |  ins_next1\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-str_const*4\r\n    |  evmergelo TMP0, TISSTR, TMP0\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RD = cdata_const*8 (~)\r\n    |  ins_next1\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-cdata_const*4\r\n    |  li TMP2, LJ_TCDATA\r\n    |  evmergelo TMP0, TMP2, TMP0\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, RD = int16_literal*8\r\n    |  srwi TMP1, RD, 3\r\n    |  extsh TMP1, TMP1\r\n    |  ins_next1\r\n    |  efdcfsi TMP0, TMP1\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RD = num_const*8\r\n    |  evlddx TMP0, KBASE, RD\r\n    |  ins_next1\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RD = primitive_type*8 (~)\r\n    |  srwi TMP1, RD, 3\r\n    |  not TMP0, TMP1\r\n    |  ins_next1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RD = end*8\r\n    |  evstddx TISNIL, BASE, RA\r\n    |   addi RA, RA, 8\r\n    |1:\r\n    |  evstddx TISNIL, BASE, RA\r\n    |  cmpw RA, RD\r\n    |   addi RA, RA, 8\r\n    |  blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RD = uvnum*8\r\n    |  ins_next1\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RD, RD, 1\r\n    |   addi RD, RD, offsetof(GCfuncL, uvptr)\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RD\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  evldd TMP0, 0(TMP1)\r\n    |  evstddx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RD = src*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srwi RA, RA, 1\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   evlddx TMP1, BASE, RD\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andi. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |    lbz TMP0, UPVAL:RB->closed\r\n    |   evmergehi TMP2, TMP1, TMP1\r\n    |   evstdd TMP1, 0(CARG2)\r\n    |    cmplwi cr1, TMP0, 0\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   subi TMP2, TMP2, (LJ_TISNUM+1)\r\n    |  bne >2\t\t\t\t// Upvalue is closed and black?\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  cmplwi TMP2, LJ_TISGCV - (LJ_TISNUM+1)\r\n    |  bge <1\t\t\t\t// tvisgcv(v)\r\n    |  lbz TMP3, GCOBJ:TMP1->gch.marked\r\n    |  andi. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(v)\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |    srwi RA, RA, 1\r\n    |   subfic TMP1, TMP1, -4\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   lwzx STR:TMP1, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |   evmergelo STR:TMP1, TISSTR, STR:TMP1\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andi. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |   lbz TMP3, STR:TMP1->marked\r\n    |   lbz TMP2, UPVAL:RB->closed\r\n    |   evstdd STR:TMP1, 0(CARG2)\r\n    |  bne >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  andi. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(str)\r\n    |   cmplwi cr1, TMP2, 0\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RD = num_const*8\r\n    |  ins_next1\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    evlddx TMP0, KBASE, RD\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  evstdd TMP0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RD = primitive_type*8 (~)\r\n    |  ins_next1\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    srwi TMP0, RD, 3\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |    not TMP0, TMP0\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  stw TMP0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RD = target\r\n    |  lwz TMP1, L->openupval\r\n    |  branch_RD\t\t\t// Do this first since RD is not saved.\r\n    |   stw BASE, L->base\r\n    |  cmplwi TMP1, 0\r\n    |   mr CARG1, L\r\n    |  beq >1\r\n    |   add CARG2, BASE, RA\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  lwz BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RD = proto_const*8 (~) (holding function prototype)\r\n    |  srwi TMP1, RD, 1\r\n    |   stw BASE, L->base\r\n    |  subfic TMP1, TMP1, -4\r\n    |   stw PC, SAVE_PC\r\n    |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n    |   mr CARG1, L\r\n    |  lwz CARG3, FRAME_FUNC(BASE)\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  lwz BASE, L->base\r\n    |  evmergelo LFUNC:CRET1, TISFUNC, LFUNC:CRET1\r\n    |  evstddx LFUNC:CRET1, BASE, RA\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RD = (hbits|asize)*8 | tab_const*8 (~)\r\n    |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n    |   mr CARG1, L\r\n    |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n    |   stw BASE, L->base\r\n    |  cmplw TMP0, TMP1\r\n    |   stw PC, SAVE_PC\r\n    |  bge >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  rlwinm CARG2, RD, 29, 21, 31\r\n      |  rlwinm CARG3, RD, 18, 27, 31\r\n      |  cmpwi CARG2, 0x7ff\r\n      |   li TMP1, 0x801\r\n      |  iseleq CARG2, TMP1, CARG2\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns Table *.\r\n    } else {\r\n      |  srwi TMP1, RD, 1\r\n      |  subfic TMP1, TMP1, -4\r\n      |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns Table *.\r\n    }\r\n    |  lwz BASE, L->base\r\n    |  evmergelo TAB:CRET1, TISTAB, TAB:CRET1\r\n    |  evstddx TAB:CRET1, BASE, RA\r\n    |  ins_next\r\n    |5:\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mr RD, SAVE0\r\n    |  mr CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n  case BC_GSET:\r\n    |  // RA = src*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:TMP2, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |  lwz TAB:RB, LFUNC:TMP2->env\r\n    |   subfic TMP1, TMP1, -4\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   evlddx RC, BASE, RC\r\n    |  checktab TAB:RB\r\n    |  checkfail ->vmeta_tgetv\r\n    |  checknum RC\r\n    |  checkfail >5\r\n    |  // Convert number key to integer\r\n    |  efdctsi TMP2, RC\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |  efdcfsi TMP1, TMP2\r\n    |   cmplw cr0, TMP0, TMP2\r\n    |  efdcmpeq cr1, RC, TMP1\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+gt\r\n    |   slwi TMP2, TMP2, 3\r\n    |  ble ->vmeta_tgetv\t\t// Integer key and in array part?\r\n    |  evlddx TMP1, TMP1, TMP2\r\n    |  checknil TMP1\r\n    |  checkok >2\r\n    |1:\r\n    |  evstddx TMP1, BASE, RA\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andi. TMP0, TMP0, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |5:\r\n    |  checkstr STR:RC\t\t\t// String key?\r\n    |  checkok ->BC_TGETS_Z\r\n    |  b ->vmeta_tgetv\r\n    break;\r\n  case BC_TGETS:\r\n    |  // RA = dst*8, RB = table*8, RC = str_const*8 (~)\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   srwi TMP1, RC, 1\r\n    |  checktab TAB:RB\r\n    |   subfic TMP1, TMP1, -4\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  checkfail ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |   evmergelo STR:RC, TISSTR, STR:RC\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  evldd TMP0, NODE:TMP2->key\r\n    |   evldd TMP1, NODE:TMP2->val\r\n    |  evcmpeq TMP0, STR:RC\r\n    |  checkanyfail >4\r\n    |   checknil TMP1\r\n    |   checkok >5\t\t\t// Key found, but nil value?\r\n    |3:\r\n    |   evstddx TMP1, BASE, RA\r\n    |  ins_next\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  lwz NODE:TMP2, NODE:TMP2->next\r\n    |  cmplwi NODE:TMP2, 0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |   evmr TMP1, TISNIL\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <3\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andi. TMP0, TMP0, 1<<MM_index\r\n    |  bne <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  // RA = dst*8, RB = table*8, RC = index*8\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   srwi TMP0, RC, 3\r\n    |  checktab TAB:RB\r\n    |  checkfail ->vmeta_tgetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |  cmplw TMP0, TMP1\r\n    |  bge ->vmeta_tgetb\r\n    |  evlddx TMP1, TMP2, RC\r\n    |  checknil TMP1\r\n    |  checkok >5\r\n    |1:\r\n    |  ins_next1\r\n    |  evstddx TMP1, BASE, RA\r\n    |  ins_next2\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andi. TMP2, TMP2, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\t\t\t// Caveat: preserve TMP0!\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   evlddx RC, BASE, RC\r\n    |  checktab TAB:RB\r\n    |  checkfail ->vmeta_tsetv\r\n    |  checknum RC\r\n    |  checkfail >5\r\n    |  // Convert number key to integer\r\n    |  efdctsi TMP2, RC\r\n    |    evlddx SAVE0, BASE, RA\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |  efdcfsi TMP1, TMP2\r\n    |   cmplw cr0, TMP0, TMP2\r\n    |  efdcmpeq cr1, RC, TMP1\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+gt\r\n    |   slwi TMP0, TMP2, 3\r\n    |  ble ->vmeta_tsetv\t\t// Integer key and in array part?\r\n    |   lbz TMP3, TAB:RB->marked\r\n    |  evlddx TMP2, TMP1, TMP0\r\n    |  checknil TMP2\r\n    |  checkok >3\r\n    |1:\r\n    |  andi. TMP2, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   evstddx SAVE0, TMP1, TMP0\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andi. TMP2, TMP2, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |5:\r\n    |  checkstr STR:RC\t\t\t// String key?\r\n    |  checkok ->BC_TSETS_Z\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  // RA = src*8, RB = table*8, RC = str_const*8 (~)\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   srwi TMP1, RC, 1\r\n    |  checktab TAB:RB\r\n    |   subfic TMP1, TMP1, -4\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  checkfail ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = src*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |   evmergelo STR:RC, TISSTR, STR:RC\r\n    |    stb ZERO, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |    evlddx SAVE0, BASE, RA\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  evldd TMP0, NODE:TMP2->key\r\n    |   evldd TMP1, NODE:TMP2->val\r\n    |  evcmpeq TMP0, STR:RC\r\n    |  checkanyfail >5\r\n    |   checknil TMP1\r\n    |   checkok >4\t\t\t// Key found, but nil value?\r\n    |2:\r\n    |  andi. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |    evstdd SAVE0, NODE:TMP2->val\r\n    |  bne >7\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <2\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andi. TMP0, TMP0, 1<<MM_newindex\r\n    |  bne <2\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  lwz NODE:TMP2, NODE:TMP2->next\r\n    |  cmplwi NODE:TMP2, 0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |   la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n    |   stw PC, SAVE_PC\r\n    |   mr CARG1, L\r\n    |  cmplwi TAB:TMP1, 0\r\n    |   stw BASE, L->base\r\n    |  beq >6\t\t\t\t// No metatable: continue.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andi. TMP0, TMP0, 1<<MM_newindex\r\n    |  beq ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mr CARG2, TAB:RB\r\n    |  evstdd STR:RC, 0(CARG3)\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  lwz BASE, L->base\r\n    |  evstdd SAVE0, 0(CRET1)\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  // RA = src*8, RB = table*8, RC = index*8\r\n    |  evlddx TAB:RB, BASE, RB\r\n    |   srwi TMP0, RC, 3\r\n    |  checktab TAB:RB\r\n    |  checkfail ->vmeta_tsetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  cmplw TMP0, TMP1\r\n    |   evlddx SAVE0, BASE, RA\r\n    |  bge ->vmeta_tsetb\r\n    |  evlddx TMP1, TMP2, RC\r\n    |  checknil TMP1\r\n    |  checkok >5\r\n    |1:\r\n    |  andi. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   evstddx SAVE0, TMP2, RC\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP1, TAB:TMP1->nomm\r\n    |  andi. TMP1, TMP1, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetb\t\t\t// Caveat: preserve TMP0!\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RD = num_const*8 (start index)\r\n    |  add RA, BASE, RA\r\n    |1:\r\n    |   add TMP3, KBASE, RD\r\n    |  lwz TAB:CARG2, -4(RA)\t\t// Guaranteed to be a table.\r\n    |    addic. TMP0, MULTRES, -8\r\n    |   lwz TMP3, 4(TMP3)\t\t// Integer constant is in lo-word.\r\n    |    srwi CARG3, TMP0, 3\r\n    |    beq >4\t\t\t\t// Nothing to copy?\r\n    |  add CARG3, CARG3, TMP3\r\n    |  lwz TMP2, TAB:CARG2->asize\r\n    |   slwi TMP1, TMP3, 3\r\n    |    lbz TMP3, TAB:CARG2->marked\r\n    |  cmplw CARG3, TMP2\r\n    |   add TMP2, RA, TMP0\r\n    |   lwz TMP0, TAB:CARG2->array\r\n    |  bgt >5\r\n    |   add TMP1, TMP1, TMP0\r\n    |    andi. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |3:  // Copy result slots to table.\r\n    |   evldd TMP0, 0(RA)\r\n    |  addi RA, RA, 8\r\n    |  cmpw cr1, RA, TMP2\r\n    |   evstdd TMP0, 0(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  blt cr1, <3\r\n    |  bne >7\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   stw BASE, L->base\r\n    |  mr CARG1, L\r\n    |   stw PC, SAVE_PC\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  mr RD, SAVE0\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP0\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALL follows.\r\n    break;\r\n  case BC_CALL:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = (nargs+1)*8\r\n    |  evlddx LFUNC:RB, BASE, RA\r\n    |   mr TMP2, BASE\r\n    |   add BASE, BASE, RA\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |  checkfunc LFUNC:RB\r\n    |   addi BASE, BASE, 8\r\n    |  checkfail ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows.\r\n    break;\r\n  case BC_CALLT:\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |  evlddx LFUNC:RB, BASE, RA\r\n    |   add RA, BASE, RA\r\n    |    lwz TMP1, FRAME_PC(BASE)\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |  checkfunc LFUNC:RB\r\n    |   addi RA, RA, 8\r\n    |  checkfail ->vmeta_callt\r\n    |->BC_CALLT_Z:\r\n    |  andi. TMP0, TMP1, FRAME_TYPE\t// Caveat: preserve cr0 until the crand.\r\n    |   lbz TMP3, LFUNC:RB->ffid\r\n    |    xori TMP2, TMP1, FRAME_VARG\r\n    |    cmplwi cr1, NARGS8:RC, 0\r\n    |  bne >7\r\n    |1:\r\n    |  stw LFUNC:RB, FRAME_FUNC(BASE)\t// Copy function down, but keep PC.\r\n    |  li TMP2, 0\r\n    |   cmplwi cr7, TMP3, 1\t\t// (> FF_C) Calling a fast function?\r\n    |    beq cr1, >3\r\n    |2:\r\n    |  addi TMP3, TMP2, 8\r\n    |   evlddx TMP0, RA, TMP2\r\n    |  cmplw cr1, TMP3, NARGS8:RC\r\n    |   evstddx TMP0, BASE, TMP2\r\n    |  mr TMP2, TMP3\r\n    |  bne cr1, <2\r\n    |3:\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+gt\r\n    |  beq >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  lwz INS, -4(TMP1)\r\n    |  decode_RA8 RA, INS\r\n    |  sub TMP1, BASE, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC-8(TMP1)\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\t// Need to prepare KBASE.\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  andi. TMP0, TMP2, FRAME_TYPEP\r\n    |  bne <1\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, BASE, TMP2\t\t// Relocate BASE down.\r\n    |  lwz TMP1, FRAME_PC(BASE)\r\n    |  andi. TMP0, TMP1, FRAME_TYPE\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 ((2+1)*8))\r\n    |  subi RA, RA, 24\t\t\t// evldd doesn't support neg. offsets.\r\n    |   mr TMP2, BASE\r\n    |  evlddx LFUNC:RB, BASE, RA\r\n    |   add BASE, BASE, RA\r\n    |   evldd TMP0, 8(BASE)\r\n    |    evldd TMP1, 16(BASE)\r\n    |  evstdd LFUNC:RB, 24(BASE)\t// Copy callable.\r\n    |  checkfunc LFUNC:RB\r\n    |   evstdd TMP0, 32(BASE)\t\t// Copy state.\r\n    |     li NARGS8:RC, 16\t\t// Iterators get 2 arguments.\r\n    |    evstdd TMP1, 40(BASE)\t\t// Copy control var.\r\n    |     addi BASE, BASE, 32\r\n    |  checkfail ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 (2+1)*8)\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA\r\n    |  lwz TAB:RB, -12(RA)\r\n    |  lwz RC, -4(RA)\t\t\t// Get index from control var.\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |  lwz TMP1, TAB:RB->array\r\n    |   addi PC, PC, 4\r\n    |1:  // Traverse array part.\r\n    |  cmplw RC, TMP0\r\n    |   slwi TMP3, RC, 3\r\n    |  bge >5\t\t\t\t// Index points after array part?\r\n    |  evlddx TMP2, TMP1, TMP3\r\n    |  checknil TMP2\r\n    |     lwz INS, -4(PC)\r\n    |  checkok >4\r\n    |   efdcfsi TMP0, RC\r\n    |    addi RC, RC, 1\r\n    |     addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |  evstdd TMP2, 8(RA)\r\n    |     decode_RD4 TMP1, INS\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |     add PC, TMP1, TMP3\r\n    |   evstdd TMP0, 0(RA)\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  addi RC, RC, 1\r\n    |  b <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  lwz TMP1, TAB:RB->hmask\r\n    |  sub RC, RC, TMP0\r\n    |   lwz TMP2, TAB:RB->node\r\n    |6:\r\n    |  cmplw RC, TMP1\t\t\t// End of iteration? Branch to ITERL+1.\r\n    |   slwi TMP3, RC, 5\r\n    |  bgt <3\r\n    |   slwi RB, RC, 3\r\n    |   sub TMP3, TMP3, RB\r\n    |  evlddx RB, TMP2, TMP3\r\n    |   add NODE:TMP3, TMP2, TMP3\r\n    |  checknil RB\r\n    |     lwz INS, -4(PC)\r\n    |  checkok >7\r\n    |   evldd TMP3, NODE:TMP3->key\r\n    |     addis TMP2, PC, -(BCBIAS_J*4 >> 16)\r\n    |  evstdd RB, 8(RA)\r\n    |    add RC, RC, TMP0\r\n    |     decode_RD4 TMP1, INS\r\n    |   evstdd TMP3, 0(RA)\r\n    |    addi RC, RC, 1\r\n    |     add PC, TMP1, TMP2\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |  b <3\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  addi RC, RC, 1\r\n    |  b <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RD = target (points to ITERN)\r\n    |  add RA, BASE, RA\r\n    |   li TMP2, -24\r\n    |  evlddx CFUNC:TMP1, RA, TMP2\r\n    |   lwz TMP2, -16(RA)\r\n    |    lwz TMP3, -8(RA)\r\n    |  evmergehi TMP0, CFUNC:TMP1, CFUNC:TMP1\r\n    |   cmpwi cr0, TMP2, LJ_TTAB\r\n    |  cmpwi cr1, TMP0, LJ_TFUNC\r\n    |    cmpwi cr6, TMP3, LJ_TNIL\r\n    |  bne cr1, >5\r\n    |  lbz TMP1, CFUNC:TMP1->ffid\r\n    |   crand 4*cr0+eq, 4*cr0+eq, 4*cr6+eq\r\n    |  cmpwi cr7, TMP1, FF_next_N\r\n    |    srwi TMP0, RD, 1\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+eq\r\n    |    add TMP3, PC, TMP0\r\n    |  bne cr0, >5\r\n    |  lus TMP1, 0xfffe\r\n    |  ori TMP1, TMP1, 0x7fff\r\n    |  stw ZERO, -4(RA)\t\t\t// Initialize control var.\r\n    |  stw TMP1, -8(RA)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  li TMP0, BC_JMP\r\n    |   li TMP1, BC_ITERC\r\n    |  stb TMP0, -1(PC)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |   stb TMP1, 3(PC)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  lwz TMP0, FRAME_PC(BASE)\r\n    |  add RC, BASE, RC\r\n    |   add RA, BASE, RA\r\n    |  addi RC, RC, FRAME_VARG\r\n    |   add TMP2, RA, RB\r\n    |  subi TMP3, BASE, 8\t\t// TMP3 = vtop\r\n    |  sub RC, RC, TMP0\t\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  cmplwi cr1, RB, 0\r\n    |   sub. TMP1, TMP3, RC\r\n    |  beq cr1, >5\t\t\t// Copy all varargs?\r\n    |   subi TMP2, TMP2, 16\r\n    |   ble >2\t\t\t\t// No vararg slots?\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  evldd TMP0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  evstdd TMP0, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   cmplw cr1, RC, TMP3\r\n    |  bge >3\t\t\t\t// All destination slots filled?\r\n    |    addi RA, RA, 8\r\n    |   blt cr1, <1\t\t\t// More vararg slots?\r\n    |2:  // Fill up remainder with nil.\r\n    |  evstdd TISNIL, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   addi RA, RA, 8\r\n    |  blt <2\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  lwz TMP0, L->maxstack\r\n    |   li MULTRES, 8\t\t\t// MULTRES = (0+1)*8\r\n    |  ble <3\t\t\t\t// No vararg slots?\r\n    |  add TMP2, RA, TMP1\r\n    |  cmplw TMP2, TMP0\r\n    |   addi MULTRES, TMP1, 8\r\n    |  bgt >7\r\n    |6:\r\n    |  evldd TMP0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  evstdd TMP0, 0(RA)\r\n    |  cmplw RC, TMP3\r\n    |   addi RA, RA, 8\r\n    |  blt <6\t\t\t\t// More vararg slots?\r\n    |  b <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mr CARG1, L\r\n    |   stw RA, L->top\r\n    |  sub SAVE0, RC, BASE\t\t// Need delta, because BASE may change.\r\n    |   stw BASE, L->base\r\n    |  sub RA, RA, BASE\r\n    |   stw PC, SAVE_PC\r\n    |  srwi CARG2, TMP1, 3\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  lwz BASE, L->base\r\n    |  add RA, BASE, RA\r\n    |  add RC, BASE, SAVE0\r\n    |  subi TMP3, BASE, 8\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RD = extra_nresults*8\r\n    |  add RD, RD, MULTRES\t\t// MULTRES >= 8, so RD >= 8.\r\n    |  // Fall through. Assumes BC_RET follows.\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |1:\r\n    |  andi. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bne ->BC_RETV_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RD = (nresults+1)*8, PC = return\r\n    |   lwz INS, -4(PC)\r\n    |  cmpwi RD, 8\r\n    |   subi TMP2, BASE, 8\r\n    |   subi RC, RD, 8\r\n    |   decode_RB8 RB, INS\r\n    |  beq >3\r\n    |   li TMP1, 0\r\n    |2:\r\n    |  addi TMP3, TMP1, 8\r\n    |   evlddx TMP0, RA, TMP1\r\n    |  cmpw TMP3, RC\r\n    |   evstddx TMP0, TMP2, TMP1\r\n    |  beq >3\r\n    |  addi TMP1, TMP3, 8\r\n    |   evlddx TMP0, RA, TMP3\r\n    |  cmpw TMP1, RC\r\n    |   evstddx TMP0, TMP2, TMP3\r\n    |  bne <2\r\n    |3:\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  evstddx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    |\r\n    |->BC_RETV_Z:  // Non-standard return case.\r\n    |  andi. TMP2, TMP1, FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, TMP1\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |  andi. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bne ->BC_RETV_Z\r\n    |\r\n    |  lwz INS, -4(PC)\r\n    |   subi TMP2, BASE, 8\r\n    |  decode_RB8 RB, INS\r\n    if (op == BC_RET1) {\r\n      |  evldd TMP0, 0(RA)\r\n      |  evstdd TMP0, 0(TMP2)\r\n    }\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  evstddx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RD = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  add RA, BASE, RA\r\n    |  evldd TMP1, FORL_IDX*8(RA)\r\n    |  evldd TMP3, FORL_STEP*8(RA)\r\n    |  evldd TMP2, FORL_STOP*8(RA)\r\n    if (!vk) {\r\n      |  evcmpgtu cr0, TMP1, TISNUM\r\n      |  evcmpgtu cr7, TMP3, TISNUM\r\n      |  evcmpgtu cr1, TMP2, TISNUM\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr7+lt\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n      |  blt ->vmeta_for\r\n    }\r\n    if (vk) {\r\n      |  efdadd TMP1, TMP1, TMP3\r\n      |  evstdd TMP1, FORL_IDX*8(RA)\r\n    }\r\n    |   evcmpgts TMP3, TISNIL\r\n    |  evstdd TMP1, FORL_EXT*8(RA)\r\n    |   bge >2\r\n    |  efdcmpgt TMP1, TMP2\r\n    |1:\r\n    if (op != BC_JFORL) {\r\n      |  srwi RD, RD, 1\r\n      |  add RD, PC, RD\r\n      if (op == BC_JFORI) {\r\n\t|  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n      } else {\r\n\t|  addis RD, RD, -(BCBIAS_J*4 >> 16)\r\n      }\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  iselgt PC, RD, PC\r\n    } else if (op == BC_IFORL) {\r\n      |  iselgt PC, PC, RD\r\n    } else {\r\n      |  ble =>BC_JLOOP\r\n    }\r\n    |  ins_next\r\n    |2:\r\n    |  efdcmpgt TMP2, TMP1\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RD = target\r\n    |  evlddx TMP1, BASE, RA\r\n    |   subi RA, RA, 8\r\n    |  checknil TMP1\r\n    |  checkok >1\t\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  NYI\r\n    } else {\r\n      |  branch_RD\t\t\t// Otherwise save control var + branch.\r\n      |  evstddx TMP1, BASE, RA\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  NYI\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RD = target\r\n    |  branch_RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   lbz TMP1, -4+PC2PROTO(numparams)(PC)\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw RA, TMP2\r\n    |   slwi TMP1, TMP1, 3\r\n    |  bgt ->vm_growstack_l\r\n    |  ins_next1\r\n    |2:\r\n    |  cmplw NARGS8:RC, TMP1\t\t// Check for missing parameters.\r\n    |  ble >3\r\n    if (op == BC_JFUNCF) {\r\n      |  NYI\r\n    } else {\r\n      |  ins_next2\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  evstddx TISNIL, BASE, NARGS8:RC\r\n    |  addi NARGS8:RC, NARGS8:RC, 8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   add TMP1, BASE, RC\r\n    |  add TMP0, RA, RC\r\n    |   stw LFUNC:RB, 4(TMP1)\t\t// Store copy of LFUNC.\r\n    |   addi TMP3, RC, 8+FRAME_VARG\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw TMP0, TMP2\r\n    |   stw TMP3, 0(TMP1)\t\t// Store delta + FRAME_VARG.\r\n    |  bge ->vm_growstack_l\r\n    |  lbz TMP2, -4+PC2PROTO(numparams)(PC)\r\n    |   mr RA, BASE\r\n    |   mr RC, TMP1\r\n    |  ins_next1\r\n    |  cmpwi TMP2, 0\r\n    |   addi BASE, TMP1, 8\r\n    |  beq >3\r\n    |1:\r\n    |  cmplw RA, RC\t\t\t// Less args than parameters?\r\n    |   evldd TMP0, 0(RA)\r\n    |  bge >4\r\n    |    evstdd TISNIL, 0(RA)\t\t// Clear old fixarg slot (help the GC).\r\n    |    addi RA, RA, 8\r\n    |2:\r\n    |  addic. TMP2, TMP2, -1\r\n    |   evstdd TMP0, 8(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  bne <1\r\n    |3:\r\n    |  ins_next2\r\n    |\r\n    |4:  // Clear missing parameters.\r\n    |  evmr TMP0, TISNIL\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  lwz TMP3, CFUNC:RB->f\r\n    } else {\r\n      |  lwz TMP3, DISPATCH_GL(wrapf)(DISPATCH)\r\n    }\r\n    |   add TMP1, RA, NARGS8:RC\r\n    |   lwz TMP2, L->maxstack\r\n    |    add RC, BASE, NARGS8:RC\r\n    |   stw BASE, L->base\r\n    |   cmplw TMP1, TMP2\r\n    |    stw RC, L->top\r\n    |     li_vmstate C\r\n    |  mtctr TMP3\r\n    if (op == BC_FUNCCW) {\r\n      |  lwz CARG2, CFUNC:RB->f\r\n    }\r\n    |  mr CARG1, L\r\n    |   bgt ->vm_growstack_c\t\t// Need to grow stack.\r\n    |     st_vmstate\r\n    |  bctrl\t\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  lwz TMP1, L->top\r\n    |   slwi RD, CRET1, 3\r\n    |  lwz BASE, L->base\r\n    |    li_vmstate INTERP\r\n    |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of caller.\r\n    |   sub RA, TMP1, RD\t\t// RA = L->top - nresults*8\r\n    |    st_vmstate\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.sleb128 37\\n\",\r\n\t(int)ctx->codesz, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 5\\n\\t.uleb128 %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 1+2*(31-i), 1200+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .LASFDE1-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.sleb128 37\\n\",\r\n\t(int)ctx->codesz, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 5\\n\\t.uleb128 %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 1+2*(31-i), 1200+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\");\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/vm_x86.dasc",
    "content": "|// Low-level VM code for x86 CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.if P64\r\n|.arch x64\r\n|.else\r\n|.arch x86\r\n|.endif\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|.if P64\r\n|.define X64, 1\r\n|.define SSE, 1\r\n|.if WIN\r\n|.define X64WIN, 1\r\n|.endif\r\n|.endif\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// This is very fragile and has many dependencies. Caveat emptor.\r\n|.define BASE,\t\tedx\t\t// Not C callee-save, refetched anyway.\r\n|.if not X64\r\n|.define KBASE,\t\tedi\t\t// Must be C callee-save.\r\n|.define KBASEa,\tKBASE\r\n|.define PC,\t\tesi\t\t// Must be C callee-save.\r\n|.define PCa,\t\tPC\r\n|.define DISPATCH,\tebx\t\t// Must be C callee-save.\r\n|.elif X64WIN\r\n|.define KBASE,\t\tedi\t\t// Must be C callee-save.\r\n|.define KBASEa,\trdi\r\n|.define PC,\t\tesi\t\t// Must be C callee-save.\r\n|.define PCa,\t\trsi\r\n|.define DISPATCH,\tebx\t\t// Must be C callee-save.\r\n|.else\r\n|.define KBASE,\t\tr15d\t\t// Must be C callee-save.\r\n|.define KBASEa,\tr15\r\n|.define PC,\t\tebx\t\t// Must be C callee-save.\r\n|.define PCa,\t\trbx\r\n|.define DISPATCH,\tr14d\t\t// Must be C callee-save.\r\n|.endif\r\n|\r\n|.define RA,\t\tecx\r\n|.define RAH,\t\tch\r\n|.define RAL,\t\tcl\r\n|.define RB,\t\tebp\t\t// Must be ebp (C callee-save).\r\n|.define RC,\t\teax\t\t// Must be eax.\r\n|.define RCW,\t\tax\r\n|.define RCH,\t\tah\r\n|.define RCL,\t\tal\r\n|.define OP,\t\tRB\r\n|.define RD,\t\tRC\r\n|.define RDW,\t\tRCW\r\n|.define RDL,\t\tRCL\r\n|.if X64\r\n|.define RAa, rcx\r\n|.define RBa, rbp\r\n|.define RCa, rax\r\n|.define RDa, rax\r\n|.else\r\n|.define RAa, RA\r\n|.define RBa, RB\r\n|.define RCa, RC\r\n|.define RDa, RD\r\n|.endif\r\n|\r\n|.if not X64\r\n|.define FCARG1,\tecx\t\t// x86 fastcall arguments.\r\n|.define FCARG2,\tedx\r\n|.elif X64WIN\r\n|.define CARG1,\t\trcx\t\t// x64/WIN64 C call arguments.\r\n|.define CARG2,\t\trdx\r\n|.define CARG3,\t\tr8\r\n|.define CARG4,\t\tr9\r\n|.define CARG1d,\tecx\r\n|.define CARG2d,\tedx\r\n|.define CARG3d,\tr8d\r\n|.define CARG4d,\tr9d\r\n|.define FCARG1,\tCARG1d\t\t// Upwards compatible to x86 fastcall.\r\n|.define FCARG2,\tCARG2d\r\n|.else\r\n|.define CARG1,\t\trdi\t\t// x64/POSIX C call arguments.\r\n|.define CARG2,\t\trsi\r\n|.define CARG3,\t\trdx\r\n|.define CARG4,\t\trcx\r\n|.define CARG5,\t\tr8\r\n|.define CARG6,\t\tr9\r\n|.define CARG1d,\tedi\r\n|.define CARG2d,\tesi\r\n|.define CARG3d,\tedx\r\n|.define CARG4d,\tecx\r\n|.define CARG5d,\tr8d\r\n|.define CARG6d,\tr9d\r\n|.define FCARG1,\tCARG1d\t\t// Simulate x86 fastcall.\r\n|.define FCARG2,\tCARG2d\r\n|.endif\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|//-----------------------------------------------------------------------\r\n|.if not X64\t\t// x86 stack layout.\r\n|\r\n|.define CFRAME_SPACE,\taword*7\t\t\t// Delta for esp (see <--).\r\n|.macro saveregs_\r\n|  push edi; push esi; push ebx\r\n|  sub esp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push ebp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add esp, CFRAME_SPACE\r\n|  pop ebx; pop esi; pop edi; pop ebp\r\n|.endmacro\r\n|\r\n|.define SAVE_ERRF,\taword [esp+aword*15]\t// vm_pcall/vm_cpcall only.\r\n|.define SAVE_NRES,\taword [esp+aword*14]\r\n|.define SAVE_CFRAME,\taword [esp+aword*13]\r\n|.define SAVE_L,\taword [esp+aword*12]\r\n|//----- 16 byte aligned, ^^^ arguments from C caller\r\n|.define SAVE_RET,\taword [esp+aword*11]\t//<-- esp entering interpreter.\r\n|.define SAVE_R4,\taword [esp+aword*10]\r\n|.define SAVE_R3,\taword [esp+aword*9]\r\n|.define SAVE_R2,\taword [esp+aword*8]\r\n|//----- 16 byte aligned\r\n|.define SAVE_R1,\taword [esp+aword*7]\t//<-- esp after register saves.\r\n|.define SAVE_PC,\taword [esp+aword*6]\r\n|.define TMP2,\t\taword [esp+aword*5]\r\n|.define TMP1,\t\taword [esp+aword*4]\r\n|//----- 16 byte aligned\r\n|.define ARG4,\t\taword [esp+aword*3]\r\n|.define ARG3,\t\taword [esp+aword*2]\r\n|.define ARG2,\t\taword [esp+aword*1]\r\n|.define ARG1,\t\taword [esp]\t\t//<-- esp while in interpreter.\r\n|//----- 16 byte aligned, ^^^ arguments for C callee\r\n|\r\n|// FPARGx overlaps ARGx and ARG(x+1) on x86.\r\n|.define FPARG3,\tqword [esp+qword*1]\r\n|.define FPARG1,\tqword [esp]\r\n|// TMPQ overlaps TMP1/TMP2. ARG5/MULTRES overlap TMP1/TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [esp+aword*4]\r\n|.define TMP3,\t\tARG4\r\n|.define ARG5,\t\tTMP1\r\n|.define TMPa,\t\tTMP1\r\n|.define MULTRES,\tTMP2\r\n|\r\n|// Arguments for vm_call and vm_pcall.\r\n|.define INARG_BASE,\tSAVE_CFRAME\t\t// Overwritten by SAVE_CFRAME!\r\n|\r\n|// Arguments for vm_cpcall.\r\n|.define INARG_CP_CALL,\tSAVE_ERRF\r\n|.define INARG_CP_UD,\tSAVE_NRES\r\n|.define INARG_CP_FUNC,\tSAVE_CFRAME\r\n|\r\n|//-----------------------------------------------------------------------\r\n|.elif X64WIN\t\t// x64/Windows stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rdi; push rsi; push rbx\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|  pop rbx; pop rsi; pop rdi; pop rbp\r\n|.endmacro\r\n|\r\n|.define SAVE_CFRAME,\taword [rsp+aword*13]\r\n|.define SAVE_PC,\tdword [rsp+dword*25]\r\n|.define SAVE_L,\tdword [rsp+dword*24]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*23]\r\n|.define SAVE_NRES,\tdword [rsp+dword*22]\r\n|.define TMP2,\t\tdword [rsp+dword*21]\r\n|.define TMP1,\t\tdword [rsp+dword*20]\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by interpreter\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.define ARG5,\t\taword [rsp+aword*4]\r\n|.define CSAVE_4,\taword [rsp+aword*3]\r\n|.define CSAVE_3,\taword [rsp+aword*2]\r\n|.define CSAVE_2,\taword [rsp+aword*1]\r\n|.define CSAVE_1,\taword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by callee\r\n|\r\n|// TMPQ overlaps TMP1/TMP2. MULTRES overlaps TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [rsp+aword*10]\r\n|.define MULTRES,\tTMP2\r\n|.define TMPa,\t\tARG5\r\n|.define ARG5d,\t\tdword [rsp+aword*4]\r\n|.define TMP3,\t\tARG5d\r\n|\r\n|//-----------------------------------------------------------------------\r\n|.else\t\t\t// x64/POSIX stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rbx; push r15; push r14\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|  pop r14; pop r15; pop rbx; pop rbp\r\n|.endmacro\r\n|\r\n|//----- 16 byte aligned,\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.define SAVE_CFRAME,\taword [rsp+aword*4]\r\n|.define SAVE_PC,\tdword [rsp+dword*7]\r\n|.define SAVE_L,\tdword [rsp+dword*6]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*5]\r\n|.define SAVE_NRES,\tdword [rsp+dword*4]\r\n|.define TMPa,\t\taword [rsp+aword*1]\r\n|.define TMP2,\t\tdword [rsp+dword*1]\r\n|.define TMP1,\t\tdword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned\r\n|\r\n|// TMPQ overlaps TMP1/TMP2. MULTRES overlaps TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [rsp]\r\n|.define TMP3,\t\tdword [rsp+aword*1]\r\n|.define MULTRES,\tTMP2\r\n|\r\n|.endif\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Instruction headers.\r\n|.macro ins_A; .endmacro\r\n|.macro ins_AD; .endmacro\r\n|.macro ins_AJ; .endmacro\r\n|.macro ins_ABC; movzx RB, RCH; movzx RC, RCL; .endmacro\r\n|.macro ins_AB_; movzx RB, RCH; .endmacro\r\n|.macro ins_A_C; movzx RC, RCL; .endmacro\r\n|.macro ins_AND; not RDa; .endmacro\r\n|\r\n|// Instruction decode+dispatch. Carefully tuned (nope, lodsd is not faster).\r\n|.macro ins_NEXT\r\n|  mov RC, [PC]\r\n|  movzx RA, RCH\r\n|  movzx OP, RCL\r\n|  add PC, 4\r\n|  shr RC, 16\r\n|.if X64\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.else\r\n|  jmp aword [DISPATCH+OP*4]\r\n|.endif\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  // Around 10%-30% slower on Core2, a lot more slower on P4.\r\n|  .macro ins_next\r\n|    jmp ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1, [BASE-4] = PC\r\n|  mov PC, LFUNC:RB->pc\r\n|  mov RA, [PC]\r\n|  movzx OP, RAL\r\n|  movzx RA, RAH\r\n|  add PC, 4\r\n|.if X64\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.else\r\n|  jmp aword [DISPATCH+OP*4]\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n|  mov [BASE-4], PC\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checktp, reg, tp;  cmp dword [BASE+reg*8+4], tp; .endmacro\r\n|.macro checknum, reg, target; checktp reg, LJ_TISNUM; jae target; .endmacro\r\n|.macro checkint, reg, target; checktp reg, LJ_TISNUM; jne target; .endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR; jne target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB; jne target; .endmacro\r\n|\r\n|// These operands must be used with movzx.\r\n|.define PC_OP, byte [PC-4]\r\n|.define PC_RA, byte [PC-3]\r\n|.define PC_RB, byte [PC-1]\r\n|.define PC_RC, byte [PC-2]\r\n|.define PC_RD, word [PC-2]\r\n|\r\n|.macro branchPC, reg\r\n|  lea PC, [PC+reg*4-BCBIAS_J*4]\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|// Decrement hashed hotcount and trigger trace recorder if zero.\r\n|.macro hotloop, reg\r\n|  mov reg, PC\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_LOOP\r\n|  jb ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall, reg\r\n|  mov reg, PC\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_CALL\r\n|  jb ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro set_vmstate, st\r\n|  mov dword [DISPATCH+DISPATCH_GL(vmstate)], ~LJ_VMST_..st\r\n|.endmacro\r\n|\r\n|// x87 compares.\r\n|.macro fcomparepp\t\t\t// Compare and pop st0 >< st1.\r\n|  fucomip st1\r\n|  fpop\r\n|.endmacro\r\n|\r\n|.macro fdup; fld st0; .endmacro\r\n|.macro fpop1; fstp st1; .endmacro\r\n|\r\n|// Synthesize SSE FP constants.\r\n|.macro sseconst_abs, reg, tmp\t\t// Synthesize abs mask.\r\n|.if X64\r\n|  mov64 tmp, U64x(7fffffff,ffffffff); movd reg, tmp\r\n|.else\r\n|  pxor reg, reg; pcmpeqd reg, reg; psrlq reg, 1\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro sseconst_hi, reg, tmp, val\t// Synthesize hi-32 bit const.\r\n|.if X64\r\n|  mov64 tmp, U64x(val,00000000); movd reg, tmp\r\n|.else\r\n|  mov tmp, 0x .. val; movd reg, tmp; pshufd reg, reg, 0x51\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro sseconst_sign, reg, tmp\t\t// Synthesize sign mask.\r\n|  sseconst_hi reg, tmp, 80000000\r\n|.endmacro\r\n|.macro sseconst_1, reg, tmp\t\t// Synthesize 1.0.\r\n|  sseconst_hi reg, tmp, 3ff00000\r\n|.endmacro\r\n|.macro sseconst_m1, reg, tmp\t\t// Synthesize -1.0.\r\n|  sseconst_hi reg, tmp, bff00000\r\n|.endmacro\r\n|.macro sseconst_2p52, reg, tmp\t\t// Synthesize 2^52.\r\n|  sseconst_hi reg, tmp, 43300000\r\n|.endmacro\r\n|.macro sseconst_tobit, reg, tmp\t// Synthesize 2^52 + 2^51.\r\n|  sseconst_hi reg, tmp, 43380000\r\n|.endmacro\r\n|\r\n|// Move table write barrier back. Overwrites reg.\r\n|.macro barrierback, tab, reg\r\n|  and byte tab->marked, (uint8_t)~LJ_GC_BLACK\t// black2gray(tab)\r\n|  mov reg, [DISPATCH+DISPATCH_GL(gc.grayagain)]\r\n|  mov [DISPATCH+DISPATCH_GL(gc.grayagain)], tab\r\n|  mov tab->gclist, reg\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  test PC, FRAME_P\r\n  |  jz ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  and PC, -8\r\n  |  sub BASE, PC\t\t\t// Restore caller base.\r\n  |  lea RAa, [RA+PC-8]\t\t\t// Rebase RA and prepend one result.\r\n  |  mov PC, [BASE-4]\t\t\t// Fetch PC of previous frame.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |  mov dword [BASE+RA+4], LJ_TTRUE\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  add RD, 1\t\t\t\t// RD = nresults+1\r\n  |  jz ->vm_unwind_yield\r\n  |  mov MULTRES, RD\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultofs, RD = nresults+1 (= MULTRES), PC = return\r\n  |  xor PC, FRAME_C\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz ->vm_returnp\r\n  |\r\n  |  // Return to C.\r\n  |  set_vmstate C\r\n  |  and PC, -8\r\n  |  sub PC, BASE\r\n  |  neg PC\t\t\t\t// Previous base = BASE - delta.\r\n  |\r\n  |  sub RD, 1\r\n  |  jz >2\r\n  |1:  // Move results down.\r\n  |.if X64\r\n  |  mov RBa, [BASE+RA]\r\n  |  mov [BASE-8], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RA]\r\n  |  mov [BASE-8], RB\r\n  |  mov RB, [BASE+RA+4]\r\n  |  mov [BASE-4], RB\r\n  |.endif\r\n  |  add BASE, 8\r\n  |  sub RD, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, PC\r\n  |3:\r\n  |  mov RD, MULTRES\r\n  |  mov RA, SAVE_NRES\t\t\t// RA = wanted nresults+1\r\n  |4:\r\n  |  cmp RA, RD\r\n  |  jne >6\t\t\t\t// More/less results wanted?\r\n  |5:\r\n  |  sub BASE, 8\r\n  |  mov L:RB->top, BASE\r\n  |\r\n  |->vm_leave_cp:\r\n  |  mov RAa, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |  mov L:RB->cframe, RAa\r\n  |  xor eax, eax\t\t\t// Ok return status for vm_pcall.\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  ret\r\n  |\r\n  |6:\r\n  |  jb >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  cmp BASE, L:RB->maxstack\r\n  |  ja >8\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  add BASE, 8\r\n  |  add RD, 1\r\n  |  jmp <4\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  test RA, RA\r\n  |  jz <5\t\t\t\t// But check for LUA_MULTRET+1.\r\n  |  sub RA, RD\t\t\t\t// Negative result!\r\n  |  lea BASE, [BASE+RA*8]\t\t// Correct top.\r\n  |  jmp <5\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  mov L:RB->top, BASE\t\t// Save current top held in BASE (yes).\r\n  |  mov MULTRES, RD\t\t\t// Need to fill only remainder with nil.\r\n  |  mov FCARG2, RA\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->top\t\t// Need the (realloced) L->top in BASE.\r\n  |  jmp <3\r\n  |\r\n  |->vm_unwind_yield:\r\n  |  mov al, LUA_YIELD\r\n  |  jmp ->vm_unwind_c_eh\r\n  |\r\n  |->vm_unwind_c@8:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |.if X64\r\n  |  mov eax, CARG2d\t\t\t// Error return status for vm_pcall.\r\n  |  mov rsp, CARG1\r\n  |.else\r\n  |  mov eax, FCARG2\t\t\t// Error return status for vm_pcall.\r\n  |  mov esp, FCARG1\r\n  |.endif\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov GL:RB, L:RB->glref\r\n  |  mov dword GL:RB->vmstate, ~LJ_VMST_C\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_rethrow:\r\n  |.if X64 and not X64WIN\r\n  |  mov FCARG1, SAVE_L\r\n  |  mov FCARG2, eax\r\n  |  restoreregs\r\n  |  jmp extern lj_err_throw@8\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |->vm_unwind_ff@4:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |.if X64\r\n  |  and CARG1, CFRAME_RAWMASK\r\n  |  mov rsp, CARG1\r\n  |.else\r\n  |  and FCARG1, CFRAME_RAWMASK\r\n  |  mov esp, FCARG1\r\n  |.endif\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RAa, -8\t\t\t// Results start at BASE+RA = BASE-8.\r\n  |  mov RD, 1+1\t\t\t// Really 1+2 results, incr. later.\r\n  |  mov BASE, L:RB->base\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov PC, [BASE-4]\t\t\t// Fetch PC of previous frame.\r\n  |  mov dword [BASE-4], LJ_TFALSE\t// Prepend false to error message.\r\n  |  set_vmstate INTERP\r\n  |  jmp ->vm_returnc\t\t\t// Increments RD/MULTRES and returns.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  mov FCARG2, LUA_MINSTACK\r\n  |  jmp >2\r\n  |\r\n  |->vm_growstack_v:\t\t\t// Grow stack for vararg Lua function.\r\n  |  sub RD, 8\r\n  |  jmp >1\r\n  |\r\n  |->vm_growstack_f:\t\t\t// Grow stack for fixarg Lua function.\r\n  |  // BASE = new base, RD = nargs+1, RB = L, PC = first PC\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |1:\r\n  |  movzx RA, byte [PC-4+PC2PROTO(framesize)]\r\n  |  add PC, 4\t\t\t\t// Must point after first instruction.\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov SAVE_PC, PC\r\n  |  mov FCARG2, RA\r\n  |2:\r\n  |  // RB = L, L->base = new base, L->top = top\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  sub RD, BASE\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |.if X64\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |  mov RA, CARG2d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RA, INARG_BASE\t\t\t// Caveat: overlaps SAVE_CFRAME!\r\n  |.endif\r\n  |  mov PC, FRAME_CP\r\n  |  xor RD, RD\r\n  |  lea KBASEa, [esp+CFRAME_RESUME]\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov L:RB->cframe, KBASEa\r\n  |  mov SAVE_PC, RD\t\t\t// Any value outside of bytecode is ok.\r\n  |  mov SAVE_CFRAME, RDa\r\n  |.if X64\r\n  |  mov SAVE_NRES, RD\r\n  |  mov SAVE_ERRF, RD\r\n  |.endif\r\n  |  cmp byte L:RB->status, RDL\r\n  |  je >3\t\t\t\t// Initial resume (like a call).\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  set_vmstate INTERP\r\n  |  mov byte L:RB->status, RDL\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr RD, 3\r\n  |  add RD, 1\t\t\t\t// RD = nresults+1\r\n  |  sub RA, BASE\t\t\t// RA = resultofs\r\n  |  mov PC, [BASE-4]\r\n  |  mov MULTRES, RD\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PC, FRAME_CP\r\n  |.if X64\r\n  |  mov SAVE_ERRF, CARG4d\r\n  |.endif\r\n  |  jmp >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |.if X64\r\n  |  mov SAVE_NRES, CARG3d\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |  mov RA, CARG2d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RA, INARG_BASE\t\t\t// Caveat: overlaps SAVE_CFRAME!\r\n  |.endif\r\n  |\r\n  |  mov KBASEa, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASEa\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |.if X64\r\n  |  mov L:RB->cframe, rsp\r\n  |.else\r\n  |  mov L:RB->cframe, esp\r\n  |.endif\r\n  |\r\n  |2:  // Entry point for vm_cpcall below (RA = base, RB = L, PC = ftype).\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |\r\n  |3:  // Entry point for vm_resume above (RA = base, RB = L, PC = ftype).\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RB->base\t\t// BASE = old base (used in vmeta_call).\r\n  |  add PC, RA\r\n  |  sub PC, BASE\t\t\t// PC = frame delta + frame type\r\n  |\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr NARGS:RD, 3\r\n  |  add NARGS:RD, 1\t\t\t// RD = nargs+1\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  mov LFUNC:RB, [RA-8]\r\n  |  cmp dword [RA-4], LJ_TFUNC\r\n  |  jne ->vmeta_call\t\t\t// Ensure KBASE defined and != BASE.\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  mov BASE, RA\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RD = nargs+1, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |.if X64\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  // Caveat: INARG_CP_* and SAVE_CFRAME/SAVE_NRES/SAVE_ERRF overlap!\r\n  |  mov RC, INARG_CP_UD\t\t// Get args before they are overwritten.\r\n  |  mov RA, INARG_CP_FUNC\r\n  |  mov BASE, INARG_CP_CALL\r\n  |.endif\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |\r\n  |  mov KBASE, L:RB->stack\t\t// Compute -savestack(L, L->top).\r\n  |  sub KBASE, L:RB->top\r\n  |  mov SAVE_ERRF, 0\t\t\t// No error function.\r\n  |  mov SAVE_NRES, KBASE\t\t// Neg. delta means cframe w/o frame.\r\n  |  // Handler may change cframe_nres(L->cframe) or cframe_errfunc(L->cframe).\r\n  |\r\n  |.if X64\r\n  |  mov KBASEa, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASEa\r\n  |  mov L:RB->cframe, rsp\r\n  |\r\n  |  call CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.else\r\n  |  mov ARG3, RC\t\t\t// Have to copy args downwards.\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |\r\n  |  mov KBASE, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASE\r\n  |  mov L:RB->cframe, esp\r\n  |\r\n  |  call BASE\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.endif\r\n  |  // TValue * (new base) or NULL returned in eax (RC).\r\n  |  test RC, RC\r\n  |  jz ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |  mov RA, RC\r\n  |  mov PC, FRAME_CP\r\n  |  jmp <2\t\t\t\t// Else continue with the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultofs, RD = nresults+1 (also in MULTRES)\r\n  |  add RA, BASE\r\n  |  and PC, -8\r\n  |  mov RB, BASE\r\n  |  sub BASE, PC\t\t\t// Restore caller BASE.\r\n  |  mov dword [RA+RD*8-4], LJ_TNIL\t// Ensure one valid arg.\r\n  |  mov RC, RA\t\t\t\t// ... in [RC]\r\n  |  mov PC, [RB-12]\t\t\t// Restore PC from [cont|PC].\r\n  |.if X64\r\n  |  movsxd RAa, dword [RB-16]\t\t// May be negative on WIN64 with debug.\r\n  |.if FFI\r\n  |  cmp RA, 1\r\n  |  jbe >1\r\n  |.endif\r\n  |  lea KBASEa, qword [=>0]\r\n  |  add RAa, KBASEa\r\n  |.else\r\n  |  mov RA, dword [RB-16]\r\n  |.if FFI\r\n  |  cmp RA, 1\r\n  |  jbe >1\r\n  |.endif\r\n  |.endif\r\n  |  mov LFUNC:KBASE, [BASE-8]\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  // BASE = base, RC = result, RB = meta base\r\n  |  jmp RAa\t\t\t\t// Jump to continuation.\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  je ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: Tail call from C function.\r\n  |  sub RB, BASE\r\n  |  shr RB, 3\r\n  |  lea RD, [RB-1]\r\n  |  jmp ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// BASE = base, RC = result, RB = mbase\r\n  |  movzx RA, PC_RB\r\n  |  sub RB, 16\r\n  |  lea RA, [BASE+RA*8]\r\n  |  sub RA, RB\r\n  |  je ->cont_ra\r\n  |  neg RA\r\n  |  shr RA, 3\r\n  |.if X64WIN\r\n  |  mov CARG3d, RA\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\r\n  |  mov RCa, [RC]\r\n  |  mov [RB], RCa\r\n  |  mov CARG2d, RB\r\n  |.elif X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\r\n  |  mov CARG3d, RA\r\n  |  mov RAa, [RC]\r\n  |  mov [RB], RAa\r\n  |  mov CARG2d, RB\r\n  |.else\r\n  |  mov ARG3, RA\r\n  |  mov RA, [RC+4]\r\n  |  mov RC, [RC]\r\n  |  mov [RB+4], RA\r\n  |  mov [RB], RC\r\n  |  mov ARG2, RB\r\n  |.endif\r\n  |  jmp ->BC_CAT_Z\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets:\r\n  |  mov TMP1, RC\t\t\t// RC = GCstr *\r\n  |  mov TMP2, LJ_TSTR\r\n  |  lea RCa, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n  |  cmp PC_OP, BC_GGET\r\n  |  jne >1\r\n  |  lea RA, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RA], TAB:RB\t\t\t// RB = GCtab *\r\n  |  mov dword [RA+4], LJ_TTAB\r\n  |  mov RB, RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tgetb:\r\n  |  movzx RC, PC_RC\r\n  |.if DUALNUM\r\n  |  mov TMP2, LJ_TISNUM\r\n  |  mov TMP1, RC\r\n  |.elif SSE\r\n  |  cvtsi2sd xmm0, RC\r\n  |  movsd TMPQ, xmm0\r\n  |.else\r\n  |  mov ARG4, RC\r\n  |  fild ARG4\r\n  |  fstp TMPQ\r\n  |.endif\r\n  |  lea RCa, TMPQ\t\t\t// Store temp. TValue in TMPQ.\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  movzx RC, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RB, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |.if X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RB\r\n  |  mov CARG3, RCa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG2, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |->cont_ra:\t\t\t\t// BASE = base, RC = result\r\n  |  movzx RA, PC_RA\r\n  |.if X64\r\n  |  mov RBa, [RC]\r\n  |  mov [BASE+RA*8], RBa\r\n  |.else\r\n  |  mov RB, [RC+4]\r\n  |  mov RC, [RC]\r\n  |  mov [BASE+RA*8+4], RB\r\n  |  mov [BASE+RA*8], RC\r\n  |.endif\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-8]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RD, 2+1\t\t\t// 2 args for func(t, k).\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets:\r\n  |  mov TMP1, RC\t\t\t// RC = GCstr *\r\n  |  mov TMP2, LJ_TSTR\r\n  |  lea RCa, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n  |  cmp PC_OP, BC_GSET\r\n  |  jne >1\r\n  |  lea RA, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RA], TAB:RB\t\t\t// RB = GCtab *\r\n  |  mov dword [RA+4], LJ_TTAB\r\n  |  mov RB, RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tsetb:\r\n  |  movzx RC, PC_RC\r\n  |.if DUALNUM\r\n  |  mov TMP2, LJ_TISNUM\r\n  |  mov TMP1, RC\r\n  |.elif SSE\r\n  |  cvtsi2sd xmm0, RC\r\n  |  movsd TMPQ, xmm0\r\n  |.else\r\n  |  mov ARG4, RC\r\n  |  fild ARG4\r\n  |  fstp TMPQ\r\n  |.endif\r\n  |  lea RCa, TMPQ\t\t\t// Store temp. TValue in TMPQ.\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  movzx RC, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RB, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |.if X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RB\r\n  |  mov CARG3, RCa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG2, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  movzx RA, PC_RA\r\n  |.if X64\r\n  |  mov RBa, [BASE+RA*8]\r\n  |  mov [RC], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RA*8+4]\r\n  |  mov RA, [BASE+RA*8]\r\n  |  mov [RC+4], RB\r\n  |  mov [RC], RA\r\n  |.endif\r\n  |->cont_nop:\t\t\t\t// BASE = base, (RC = result)\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  movzx RC, PC_RA\r\n  |  // Copy value to third argument.\r\n  |.if X64\r\n  |  mov RBa, [BASE+RC*8]\r\n  |  mov [RA+16], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RC*8+4]\r\n  |  mov RC, [BASE+RC*8]\r\n  |  mov [RA+20], RB\r\n  |  mov [RA+16], RC\r\n  |.endif\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-8]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RD, 3+1\t\t\t// 3 args for func(t, k, v).\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |.if X64\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d == BASE.\r\n  |.if X64WIN\r\n  |  lea CARG3d, [BASE+RD*8]\r\n  |  lea CARG2d, [BASE+RA*8]\r\n  |.else\r\n  |  lea CARG2d, [BASE+RA*8]\r\n  |  lea CARG3d, [BASE+RD*8]\r\n  |.endif\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d/CARG4d == RA.\r\n  |  movzx CARG4d, PC_OP\r\n  |.else\r\n  |  movzx RB, PC_OP\r\n  |  lea RD, [BASE+RD*8]\r\n  |  lea RA, [BASE+RA*8]\r\n  |  mov ARG4, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RD\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_comp\t// (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |  cmp RC, 1\r\n  |  ja ->vmeta_binop\r\n  |4:\r\n  |  lea PC, [PC+4]\r\n  |  jb >6\r\n  |5:\r\n  |  movzx RD, PC_RD\r\n  |  branchPC RD\r\n  |6:\r\n  |  ins_next\r\n  |\r\n  |->cont_condt:\t\t\t// BASE = base, RC = result\r\n  |  add PC, 4\r\n  |  cmp dword [RC+4], LJ_TISTRUECOND\t// Branch if result is true.\r\n  |  jb <5\r\n  |  jmp <6\r\n  |\r\n  |->cont_condf:\t\t\t// BASE = base, RC = result\r\n  |  cmp dword [RC+4], LJ_TISTRUECOND\t// Branch if result is false.\r\n  |  jmp <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  sub PC, 4\r\n  |.if X64WIN\r\n  |  mov CARG3d, RD\r\n  |  mov CARG4d, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d == RA.\r\n  |.elif X64\r\n  |  mov CARG2d, RA\r\n  |  mov CARG4d, RB\t\t\t// Caveat: CARG4d == RA.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG3d, RD\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG4, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RD\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal\t// (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, 4\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG1, L:RB\r\n  |  mov FCARG2, dword [PC-4]\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal_cd@8\t// (lua_State *L, BCIns ins)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vno:\r\n  |.if DUALNUM\r\n  |  movzx RB, PC_RB\r\n  |.endif\r\n  |->vmeta_arith_vn:\r\n  |  lea RC, [KBASE+RC*8]\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_arith_nvo:\r\n  |.if DUALNUM\r\n  |  movzx RC, PC_RC\r\n  |.endif\r\n  |->vmeta_arith_nv:\r\n  |  lea RC, [KBASE+RC*8]\r\n  |  lea RB, [BASE+RB*8]\r\n  |  xchg RB, RC\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_unm:\r\n  |  lea RC, [BASE+RD*8]\r\n  |  mov RB, RC\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_arith_vvo:\r\n  |.if DUALNUM\r\n  |  movzx RB, PC_RB\r\n  |.endif\r\n  |->vmeta_arith_vv:\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |  lea RA, [BASE+RA*8]\r\n  |.if X64WIN\r\n  |  mov CARG3d, RB\r\n  |  mov CARG4d, RC\r\n  |  movzx RC, PC_OP\r\n  |  mov ARG5d, RC\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d == RA.\r\n  |.elif X64\r\n  |  movzx CARG5d, PC_OP\r\n  |  mov CARG2d, RA\r\n  |  mov CARG4d, RC\t\t\t// Caveat: CARG4d == RA.\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG3d, RB\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG3, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG4, RC\r\n  |  movzx RC, PC_OP\r\n  |  mov ARG2, RA\r\n  |  mov ARG5, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_arith\t// (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = base, RC = new base, stack = cont/func/o1/o2\r\n  |  mov RA, RC\r\n  |  sub RC, BASE\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RC+FRAME_CONT]\r\n  |  mov NARGS:RD, 2+1\t\t\t// 2 args for func(o1, o2).\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  lea FCARG2, [BASE+RD*8]\t\t// Caveat: FCARG2 == BASE\r\n  |  mov L:FCARG1, L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_len@8\t\t// (lua_State *L, TValue *o)\r\n  |  // NULL (retry) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n#if LJ_52\r\n  |  test RC, RC\r\n  |  jne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  movzx RD, PC_RD\r\n  |  mov TAB:FCARG1, [BASE+RD*8]\r\n  |  jmp ->BC_LEN_Z\r\n#else\r\n  |  jmp ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call_ra:\r\n  |  lea RA, [BASE+RA*8+8]\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // BASE = old base, RA = new base, RC = nargs+1, PC = return\r\n  |  mov TMP2, RA\t\t\t// Save RA, RC for us.\r\n  |  mov TMP1, NARGS:RD\r\n  |  sub RA, 8\r\n  |.if X64\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RA\r\n  |  lea CARG3d, [RA+NARGS:RD*8]\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n  |.else\r\n  |  lea RC, [RA+NARGS:RD*8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG2, RA\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\t\t// This is the callers base!\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RA, TMP2\r\n  |  mov NARGS:RD, TMP1\r\n  |  mov LFUNC:RB, [RA-8]\r\n  |  add NARGS:RD, 1\r\n  |  // This is fragile. L->base must not move, KBASE must always be defined.\r\n  |  cmp KBASE, BASE\t\t\t// Continue with CALLT if flag set.\r\n  |  je ->BC_CALLT_Z\r\n  |  mov BASE, RA\r\n  |  ins_call\t\t\t\t// Otherwise call resolved metamethod.\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, RA\t\t\t// Caveat: FCARG2 == BASE\r\n  |  mov L:FCARG1, L:RB\t\t\t// Caveat: FCARG1 == RA\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_for@8\t// (lua_State *L, TValue *base)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RC, [PC-4]\r\n  |  movzx RA, RCH\r\n  |  movzx OP, RCL\r\n  |  shr RC, 16\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Retry FORI or JFORI.\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4+GG_DISP2STATIC]\t// Retry FORI or JFORI.\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RD, 1+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RD, 2+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc_1 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  fld qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name, op\r\n  |  .ffunc_1 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  op\r\n  |  fld qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nsse, name, op\r\n  |  .ffunc_1 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  op xmm0, qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nsse, name\r\n  |  .ffunc_nsse name, movsd\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc_2 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM;  jae ->fff_fallback\r\n  |  fld qword [BASE]\r\n  |  fld qword [BASE+8]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nnsse, name\r\n  |  .ffunc_2 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM;  jae ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |  movsd xmm1, qword [BASE+8]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nnr, name\r\n  |  .ffunc_2 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM;  jae ->fff_fallback\r\n  |  fld qword [BASE+8]\r\n  |  fld qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses label 1.\r\n  |.macro ffgccheck\r\n  |  mov RB, [DISPATCH+DISPATCH_GL(gc.total)]\r\n  |  cmp RB, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n  |  jb >1\r\n  |  call ->fff_gcstep\r\n  |1:\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  mov RB, [BASE+4]\r\n  |  cmp RB, LJ_TISTRUECOND;  jae ->fff_fallback\r\n  |  mov PC, [BASE-4]\r\n  |  mov MULTRES, RD\r\n  |  mov [BASE-4], RB\r\n  |  mov RB, [BASE]\r\n  |  mov [BASE-8], RB\r\n  |  sub RD, 2\r\n  |  jz >2\r\n  |  mov RA, BASE\r\n  |1:\r\n  |  add RA, 8\r\n  |.if X64\r\n  |  mov RBa, [RA]\r\n  |  mov [RA-8], RBa\r\n  |.else\r\n  |  mov RB, [RA+4]\r\n  |  mov [RA-4], RB\r\n  |  mov RB, [RA]\r\n  |  mov [RA-8], RB\r\n  |.endif\r\n  |  sub RD, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov RD, MULTRES\r\n  |  jmp ->fff_res_\r\n  |\r\n  |.ffunc_1 type\r\n  |  mov RB, [BASE+4]\r\n  |.if X64\r\n  |  mov RA, RB\r\n  |  sar RA, 15\r\n  |  cmp RA, -2\r\n  |  je >3\r\n  |.endif\r\n  |  mov RC, ~LJ_TNUMX\r\n  |  not RB\r\n  |  cmp RC, RB\r\n  |  cmova RC, RB\r\n  |2:\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov STR:RC, [CFUNC:RB+RC*8+((char *)(&((GCfuncC *)0)->upvalue))]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RC\r\n  |  jmp ->fff_res1\r\n  |.if X64\r\n  |3:\r\n  |  mov RC, ~LJ_TLIGHTUD\r\n  |  jmp <2\r\n  |.endif\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  mov RB, [BASE+4]\r\n  |  mov PC, [BASE-4]\r\n  |  cmp RB, LJ_TTAB;  jne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov TAB:RB, TAB:RB->metatable\r\n  |2:\r\n  |  test TAB:RB, TAB:RB\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  jz ->fff_res1\r\n  |  mov STR:RC, [DISPATCH+DISPATCH_GL(gcroot)+4*(GCROOT_MMNAME+MM_metatable)]\r\n  |  mov dword [BASE-4], LJ_TTAB\t// Store metatable as default result.\r\n  |  mov [BASE-8], TAB:RB\r\n  |  mov RA, TAB:RB->hmask\r\n  |  and RA, STR:RC->hash\r\n  |  imul RA, #NODE\r\n  |  add NODE:RA, TAB:RB->node\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n  |  jne >4\r\n  |  cmp dword NODE:RA->key.gcr, STR:RC\r\n  |  je >5\r\n  |4:\r\n  |  mov NODE:RA, NODE:RA->next\r\n  |  test NODE:RA, NODE:RA\r\n  |  jnz <3\r\n  |  jmp ->fff_res1\t\t\t// Not found, keep default result.\r\n  |5:\r\n  |  mov RB, [RA+4]\r\n  |  cmp RB, LJ_TNIL;  je ->fff_res1\t// Ditto for nil value.\r\n  |  mov RC, [RA]\r\n  |  mov [BASE-4], RB\t\t\t// Return value of mt.__metatable.\r\n  |  mov [BASE-8], RC\r\n  |  jmp ->fff_res1\r\n  |\r\n  |6:\r\n  |  cmp RB, LJ_TUDATA;  je <1\r\n  |.if X64\r\n  |  cmp RB, LJ_TNUMX;  ja >8\r\n  |  cmp RB, LJ_TISNUM;  jbe >7\r\n  |  mov RB, LJ_TLIGHTUD\r\n  |  jmp >8\r\n  |7:\r\n  |.else\r\n  |  cmp RB, LJ_TISNUM;  ja >8\r\n  |.endif\r\n  |  mov RB, LJ_TNUMX\r\n  |8:\r\n  |  not RB\r\n  |  mov TAB:RB, [DISPATCH+RB*4+DISPATCH_GL(gcroot[GCROOT_BASEMT])]\r\n  |  jmp <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword TAB:RB->metatable, 0;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TTAB;  jne ->fff_fallback\r\n  |  mov TAB:RC, [BASE+8]\r\n  |  mov TAB:RB->metatable, TAB:RC\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TTAB\t\t// Return original table.\r\n  |  mov [BASE-8], TAB:RB\r\n  |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n  |  jz >1\r\n  |  // Possible write barrier. Table is black, but skip iswhite(mt) check.\r\n  |  barrierback TAB:RB, RC\r\n  |1:\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_2 rawget\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |.if X64WIN\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  lea CARG3d, [BASE+8]\r\n  |  mov CARG2d, [BASE]\t\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG1d, SAVE_L\r\n  |.elif X64\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG2d, [BASE]\r\n  |  lea CARG3d, [BASE+8]\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG1d, SAVE_L\r\n  |.else\r\n  |  mov TAB:RD, [BASE]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG2, TAB:RD\r\n  |  mov ARG1, L:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  add BASE, 8\r\n  |  mov ARG3, BASE\r\n  |.endif\r\n  |  call extern lj_tab_get\t// (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // cTValue * returned in eax (RD).\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  // Copy table slot.\r\n  |.if X64\r\n  |  mov RBa, [RD]\r\n  |  mov PC, [BASE-4]\r\n  |  mov [BASE-8], RBa\r\n  |.else\r\n  |  mov RB, [RD]\r\n  |  mov RD, [RD+4]\r\n  |  mov PC, [BASE-4]\r\n  |  mov [BASE-8], RB\r\n  |  mov [BASE-4], RD\r\n  |.endif\r\n  |  jmp ->fff_res1\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\t// Exactly one argument.\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >1\r\n  |  mov RB, dword [BASE]; jmp ->fff_resi\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]; jmp ->fff_resxmm0\r\n  |.else\r\n  |  fld qword [BASE]; jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  mov PC, [BASE-4]\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne >3\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  mov STR:RD, [BASE]\r\n  |2:\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RD\r\n  |  jmp ->fff_res1\r\n  |3:  // Handle numbers inline, unless a number base metatable is present.\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  ja ->fff_fallback\r\n  |  cmp dword [DISPATCH+DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])], 0\r\n  |  jne ->fff_fallback\r\n  |  ffgccheck\t\t\t\t// Caveat: uses label 1.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |.if X64 and not X64WIN\r\n  |  mov FCARG2, BASE\t\t\t// Otherwise: FCARG2 == BASE\r\n  |.endif\r\n  |  mov L:FCARG1, L:RB\r\n  |.if DUALNUM\r\n  |  call extern lj_str_fromnumber@8\t// (lua_State *L, cTValue *o)\r\n  |.else\r\n  |  call extern lj_str_fromnum@8\t// (lua_State *L, lua_Number *np)\r\n  |.endif\r\n  |  // GCstr returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <2\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |  je >2\t\t\t\t// Missing 2nd arg?\r\n  |1:\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov L:RB->top, BASE\t\t// Dummy frame length is ok.\r\n  |  mov PC, [BASE-4]\r\n  |.if X64WIN\r\n  |  lea CARG3d, [BASE+8]\r\n  |  mov CARG2d, [BASE]\t\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG1d, L:RB\r\n  |.elif X64\r\n  |  mov CARG2d, [BASE]\r\n  |  lea CARG3d, [BASE+8]\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov TAB:RD, [BASE]\r\n  |  mov ARG2, TAB:RD\r\n  |  mov ARG1, L:RB\r\n  |  add BASE, 8\r\n  |  mov ARG3, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\t\t\t// Needed for ITERN fallback.\r\n  |  call extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Flag returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  test RD, RD;  jz >3\t\t// End of traversal?\r\n  |  // Copy key and value to results.\r\n  |.if X64\r\n  |  mov RBa, [BASE+8]\r\n  |  mov RDa, [BASE+16]\r\n  |  mov [BASE-8], RBa\r\n  |  mov [BASE], RDa\r\n  |.else\r\n  |  mov RB, [BASE+8]\r\n  |  mov RD, [BASE+12]\r\n  |  mov [BASE-8], RB\r\n  |  mov [BASE-4], RD\r\n  |  mov RB, [BASE+16]\r\n  |  mov RD, [BASE+20]\r\n  |  mov [BASE], RB\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |->fff_res2:\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |2:  // Set missing 2nd arg to nil.\r\n  |  mov dword [BASE+12], LJ_TNIL\r\n  |  jmp <1\r\n  |3:  // End of traversal: return nil.\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n#if LJ_52\r\n  |  cmp dword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov CFUNC:RD, CFUNC:RB->upvalue[0]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TFUNC\r\n  |  mov [BASE-8], CFUNC:RD\r\n  |  mov dword [BASE+12], LJ_TNIL\r\n  |  mov RD, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  mov PC, [BASE-4]\r\n  |.if DUALNUM\r\n  |  mov RD, dword [BASE+8]\r\n  |  add RD, 1\r\n  |  mov dword [BASE-4], LJ_TISNUM\r\n  |  mov dword [BASE-8], RD\r\n  |.elif SSE\r\n  |  movsd xmm0, qword [BASE+8]\r\n  |  sseconst_1 xmm1, RBa\r\n  |  addsd xmm0, xmm1\r\n  |  cvtsd2si RD, xmm0\r\n  |  movsd qword [BASE-8], xmm0\r\n  |.else\r\n  |  fld qword [BASE+8]\r\n  |  fld1\r\n  |  faddp st1\r\n  |  fist ARG1\r\n  |  fstp qword [BASE-8]\r\n  |  mov RD, ARG1\r\n  |.endif\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp RD, TAB:RB->asize;  jae >2\t// Not in array part?\r\n  |  shl RD, 3\r\n  |  add RD, TAB:RB->array\r\n  |1:\r\n  |  cmp dword [RD+4], LJ_TNIL;  je ->fff_res0\r\n  |  // Copy array slot.\r\n  |.if X64\r\n  |  mov RBa, [RD]\r\n  |  mov [BASE], RBa\r\n  |.else\r\n  |  mov RB, [RD]\r\n  |  mov RD, [RD+4]\r\n  |  mov [BASE], RB\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |  jmp ->fff_res2\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  cmp dword TAB:RB->hmask, 0; je ->fff_res0\r\n  |  mov FCARG1, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov FCARG2, RD\t\t\t// Caveat: FCARG2 == BASE\r\n  |  call extern lj_tab_getinth@8\t// (GCtab *t, int32_t key)\r\n  |  // cTValue * or NULL returned in eax (RD).\r\n  |  mov BASE, RB\r\n  |  test RD, RD\r\n  |  jnz <1\r\n  |->fff_res0:\r\n  |  mov RD, 1+0\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n#if LJ_52\r\n  |  cmp dword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov CFUNC:RD, CFUNC:RB->upvalue[0]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TFUNC\r\n  |  mov [BASE-8], CFUNC:RD\r\n  |.if DUALNUM\r\n  |  mov dword [BASE+12], LJ_TISNUM\r\n  |  mov dword [BASE+8], 0\r\n  |.elif SSE\r\n  |  xorps xmm0, xmm0\r\n  |  movsd qword [BASE+8], xmm0\r\n  |.else\r\n  |  fldz\r\n  |  fstp qword [BASE+8]\r\n  |.endif\r\n  |  mov RD, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc_1 pcall\r\n  |  lea RA, [BASE+8]\r\n  |  sub NARGS:RD, 1\r\n  |  mov PC, 8+FRAME_PCALL\r\n  |1:\r\n  |  movzx RB, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  shr RB, HOOK_ACTIVE_SHIFT\r\n  |  and RB, 1\r\n  |  add PC, RB\t\t\t\t// Remember active hook before pcall.\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  cmp dword [BASE+12], LJ_TFUNC;  jne ->fff_fallback\r\n  |  mov RB, [BASE+4]\t\t\t// Swap function and traceback.\r\n  |  mov [BASE+12], RB\r\n  |  mov dword [BASE+4], LJ_TFUNC\r\n  |  mov LFUNC:RB, [BASE]\r\n  |  mov PC, [BASE+8]\r\n  |  mov [BASE+8], LFUNC:RB\r\n  |  mov [BASE], PC\r\n  |  lea RA, [BASE+16]\r\n  |  sub NARGS:RD, 2\r\n  |  mov PC, 16+FRAME_PCALL\r\n  |  jmp <1\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  mov L:RB, [BASE]\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov L:RB, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  mov PC, [BASE-4]\r\n  |  mov SAVE_PC, PC\r\n  |.if X64\r\n  |  mov TMP1, L:RB\r\n  |.else\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |.if resume\r\n  |  cmp dword [BASE+4], LJ_TTHREAD;  jne ->fff_fallback\r\n  |.endif\r\n  |  cmp aword L:RB->cframe, 0; jne ->fff_fallback\r\n  |  cmp byte L:RB->status, LUA_YIELD;  ja ->fff_fallback\r\n  |  mov RA, L:RB->top\r\n  |  je >1\t\t\t\t// Status != LUA_YIELD (i.e. 0)?\r\n  |  cmp RA, L:RB->base\t\t\t// Check for presence of initial func.\r\n  |  je ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  lea PC, [RA+NARGS:RD*8-16]\t\t// Check stack space (-1-thread).\r\n  |.else\r\n  |  lea PC, [RA+NARGS:RD*8-8]\t\t// Check stack space (-1).\r\n  |.endif\r\n  |  cmp PC, L:RB->maxstack; ja ->fff_fallback\r\n  |  mov L:RB->top, PC\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |.if resume\r\n  |  add BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |.endif\r\n  |  mov L:RB->top, BASE\r\n  |.if resume\r\n  |  lea RB, [BASE+NARGS:RD*8-24]\t// RB = end of source for stack move.\r\n  |.else\r\n  |  lea RB, [BASE+NARGS:RD*8-16]\t// RB = end of source for stack move.\r\n  |.endif\r\n  |  sub RBa, PCa\t\t\t// Relative to PC.\r\n  |\r\n  |  cmp PC, RA\r\n  |  je >3\r\n  |2:  // Move args to coroutine.\r\n  |.if X64\r\n  |  mov RCa, [PC+RB]\r\n  |  mov [PC-8], RCa\r\n  |.else\r\n  |  mov RC, [PC+RB+4]\r\n  |  mov [PC-4], RC\r\n  |  mov RC, [PC+RB]\r\n  |  mov [PC-8], RC\r\n  |.endif\r\n  |  sub PC, 8\r\n  |  cmp PC, RA\r\n  |  jne <2\r\n  |3:\r\n  |.if X64\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, TMP1\r\n  |.else\r\n  |  mov ARG2, RA\r\n  |  xor RA, RA\r\n  |  mov ARG4, RA\r\n  |  mov ARG3, RA\r\n  |.endif\r\n  |  call ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  set_vmstate INTERP\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |.if X64\r\n  |  mov L:PC, TMP1\r\n  |.else\r\n  |  mov L:PC, ARG1\t\t\t// The callee doesn't modify SAVE_L.\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  cmp eax, LUA_YIELD\r\n  |  ja >8\r\n  |4:\r\n  |  mov RA, L:PC->base\r\n  |  mov KBASE, L:PC->top\r\n  |  mov L:PC->top, RA\t\t\t// Clear coroutine stack.\r\n  |  mov PC, KBASE\r\n  |  sub PC, RA\r\n  |  je >6\t\t\t\t// No results?\r\n  |  lea RD, [BASE+PC]\r\n  |  shr PC, 3\r\n  |  cmp RD, L:RB->maxstack\r\n  |  ja >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  mov RB, BASE\r\n  |  sub RBa, RAa\r\n  |5:  // Move results from coroutine.\r\n  |.if X64\r\n  |  mov RDa, [RA]\r\n  |  mov [RA+RB], RDa\r\n  |.else\r\n  |  mov RD, [RA]\r\n  |  mov [RA+RB], RD\r\n  |  mov RD, [RA+4]\r\n  |  mov [RA+RB+4], RD\r\n  |.endif\r\n  |  add RA, 8\r\n  |  cmp RA, KBASE\r\n  |  jne <5\r\n  |6:\r\n  |.if resume\r\n  |  lea RD, [PC+2]\t\t\t// nresults+1 = 1 + true + results.\r\n  |  mov dword [BASE-4], LJ_TTRUE\t// Prepend true to results.\r\n  |.else\r\n  |  lea RD, [PC+1]\t\t\t// nresults+1 = 1 + results.\r\n  |.endif\r\n  |7:\r\n  |  mov PC, SAVE_PC\r\n  |  mov MULTRES, RD\r\n  |.if resume\r\n  |  mov RAa, -8\r\n  |.else\r\n  |  xor RA, RA\r\n  |.endif\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  mov dword [BASE-4], LJ_TFALSE\t// Prepend false to results.\r\n  |  mov RA, L:PC->top\r\n  |  sub RA, 8\r\n  |  mov L:PC->top, RA\t\t\t// Clear error from coroutine stack.\r\n  |  // Copy error message.\r\n  |.if X64\r\n  |  mov RDa, [RA]\r\n  |  mov [BASE], RDa\r\n  |.else\r\n  |  mov RD, [RA]\r\n  |  mov [BASE], RD\r\n  |  mov RD, [RA+4]\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |  mov RD, 1+2\t\t\t// nresults+1 = 1 + false + error.\r\n  |  jmp <7\r\n  |.else\r\n  |  mov FCARG2, L:PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_ffh_coroutine_wrap_err@8  // (lua_State *L, lua_State *co)\r\n  |  // Error function does not return.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |.if X64\r\n  |  mov L:RA, TMP1\r\n  |.else\r\n  |  mov L:RA, ARG1\t\t\t// The callee doesn't modify SAVE_L.\r\n  |.endif\r\n  |  mov L:RA->top, KBASE\t\t// Undo coroutine stack clearing.\r\n  |  mov FCARG2, PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |.if X64\r\n  |  mov L:PC, TMP1\r\n  |.else\r\n  |  mov L:PC, ARG1\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <4\t\t\t\t// Retry the stack move.\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  mov L:RB, SAVE_L\r\n  |  test aword L:RB->cframe, CFRAME_RESUME\r\n  |  jz ->fff_fallback\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB->top, RD\r\n  |  xor RD, RD\r\n  |  mov aword L:RB->cframe, RDa\r\n  |  mov al, LUA_YIELD\r\n  |  mov byte L:RB->status, al\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.if not DUALNUM\r\n  |->fff_resi:  // Dummy.\r\n  |.endif\r\n  |\r\n  |.if SSE\r\n  |->fff_resn:\r\n  |  mov PC, [BASE-4]\r\n  |  fstp qword [BASE-8]\r\n  |  jmp ->fff_res1\r\n  |.endif\r\n  |\r\n  |  .ffunc_1 math_abs\r\n  |.if DUALNUM\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jne >2\r\n  |  mov RB, dword [BASE]\r\n  |  cmp RB, 0; jns ->fff_resi\r\n  |  neg RB; js >1\r\n  |->fff_resbit:\r\n  |->fff_resi:\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TISNUM\r\n  |  mov dword [BASE-8], RB\r\n  |  jmp ->fff_res1\r\n  |1:\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], 0x41e00000  // 2^31.\r\n  |  mov dword [BASE-8], 0\r\n  |  jmp ->fff_res1\r\n  |2:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |.endif\r\n  |\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]\r\n  |  sseconst_abs xmm1, RDa\r\n  |  andps xmm0, xmm1\r\n  |->fff_resxmm0:\r\n  |  mov PC, [BASE-4]\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  // fallthrough\r\n  |.else\r\n  |  fld qword [BASE]\r\n  |  fabs\r\n  |  // fallthrough\r\n  |->fff_resxmm0:  // Dummy.\r\n  |->fff_resn:\r\n  |  mov PC, [BASE-4]\r\n  |  fstp qword [BASE-8]\r\n  |.endif\r\n  |\r\n  |->fff_res1:\r\n  |  mov RD, 1+1\r\n  |->fff_res:\r\n  |  mov MULTRES, RD\r\n  |->fff_res_:\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz >7\r\n  |5:\r\n  |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n  |  ja >6\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  movzx RA, PC_RA\r\n  |  not RAa\t\t\t\t// Note: ~RA = -(RA+1)\r\n  |  lea BASE, [BASE+RA*8]\t\t// base = base - (RA+1)*8\r\n  |  ins_next\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  mov dword [BASE+RD*8-12], LJ_TNIL\r\n  |  add RD, 1\r\n  |  jmp <5\r\n  |\r\n  |7:  // Non-standard return case.\r\n  |  mov RAa, -8\t\t\t// Results start at BASE+RA = BASE-8.\r\n  |  jmp ->vm_return\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc math_ .. func\r\n  |.if DUALNUM\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jne >1\r\n  |  mov RB, dword [BASE]; jmp ->fff_resi\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |.endif\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]\r\n  |  call ->vm_ .. func\r\n  |  .if DUALNUM\r\n  |    cvtsd2si RB, xmm0\r\n  |    cmp RB, 0x80000000\r\n  |    jne ->fff_resi\r\n  |    cvtsi2sd xmm1, RB\r\n  |    ucomisd xmm0, xmm1\r\n  |    jp ->fff_resxmm0\r\n  |    je ->fff_resi\r\n  |  .endif\r\n  |  jmp ->fff_resxmm0\r\n  |.else\r\n  |  fld qword [BASE]\r\n  |  call ->vm_ .. func\r\n  |  .if DUALNUM\r\n  |    fist ARG1\r\n  |    mov RB, ARG1\r\n  |    cmp RB, 0x80000000; jne >2\r\n  |    fdup\r\n  |    fild ARG1\r\n  |    fcomparepp\r\n  |    jp ->fff_resn\r\n  |    jne ->fff_resn\r\n  |2:\r\n  |    fpop\r\n  |    jmp ->fff_resi\r\n  | .else\r\n  |    jmp ->fff_resn\r\n  | .endif\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.if SSE\r\n  |.ffunc_nsse math_sqrt, sqrtsd; jmp ->fff_resxmm0\r\n  |.else\r\n  |.ffunc_n math_sqrt; fsqrt; jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.ffunc math_log\r\n  |  cmp NARGS:RD, 1+1; jne ->fff_fallback\t// Exactly one argument.\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |  fldln2; fld qword [BASE]; fyl2x; jmp ->fff_resn\r\n  |\r\n  |.ffunc_n math_log10, fldlg2;\tfyl2x;\t\tjmp ->fff_resn\r\n  |.ffunc_n math_exp;\tcall ->vm_exp_x87;\tjmp ->fff_resn\r\n  |\r\n  |.ffunc_n math_sin;\tfsin;\t\t\tjmp ->fff_resn\r\n  |.ffunc_n math_cos;\tfcos;\t\t\tjmp ->fff_resn\r\n  |.ffunc_n math_tan;\tfptan; fpop;\t\tjmp ->fff_resn\r\n  |\r\n  |.ffunc_n math_asin\r\n  |  fdup; fmul st0; fld1; fsubrp st1; fsqrt; fpatan\r\n  |  jmp ->fff_resn\r\n  |.ffunc_n math_acos\r\n  |  fdup; fmul st0; fld1; fsubrp st1; fsqrt; fxch; fpatan\r\n  |  jmp ->fff_resn\r\n  |.ffunc_n math_atan;\tfld1; fpatan;\t\tjmp ->fff_resn\r\n  |\r\n  |.macro math_extern, func\r\n  |.if SSE\r\n  |  .ffunc_nsse math_ .. func\r\n  |  .if not X64\r\n  |    movsd FPARG1, xmm0\r\n  |  .endif\r\n  |.else\r\n  |  .ffunc_n math_ .. func\r\n  |  fstp FPARG1\r\n  |.endif\r\n  |  mov RB, BASE\r\n  |  call extern lj_vm_ .. func\r\n  |  mov BASE, RB\r\n  |  .if X64\r\n  |    jmp ->fff_resxmm0\r\n  |  .else\r\n  |    jmp ->fff_resn\r\n  |  .endif\r\n  |.endmacro\r\n  |\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |\r\n  |->ff_math_deg:\r\n  |.if SSE\r\n  |.ffunc_nsse math_rad\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mulsd xmm0, qword CFUNC:RB->upvalue[0]\r\n  |  jmp ->fff_resxmm0\r\n  |.else\r\n  |.ffunc_n math_rad\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  fmul qword CFUNC:RB->upvalue[0]\r\n  |  jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.ffunc_nn math_atan2;\tfpatan;\t\tjmp ->fff_resn\r\n  |.ffunc_nnr math_ldexp;\tfscale; fpop1;\tjmp ->fff_resn\r\n  |\r\n  |.ffunc_1 math_frexp\r\n  |  mov RB, [BASE+4]\r\n  |  cmp RB, LJ_TISNUM;  jae ->fff_fallback\r\n  |  mov PC, [BASE-4]\r\n  |  mov RC, [BASE]\r\n  |  mov [BASE-4], RB; mov [BASE-8], RC\r\n  |  shl RB, 1; cmp RB, 0xffe00000; jae >3\r\n  |  or RC, RB; jz >3\r\n  |  mov RC, 1022\r\n  |  cmp RB, 0x00200000; jb >4\r\n  |1:\r\n  |  shr RB, 21; sub RB, RC\t\t// Extract and unbias exponent.\r\n  |.if SSE\r\n  |  cvtsi2sd xmm0, RB\r\n  |.else\r\n  |  mov TMP1, RB; fild TMP1\r\n  |.endif\r\n  |  mov RB, [BASE-4]\r\n  |  and RB, 0x800fffff\t\t\t// Mask off exponent.\r\n  |  or RB, 0x3fe00000\t\t\t// Put mantissa in range [0.5,1) or 0.\r\n  |  mov [BASE-4], RB\r\n  |2:\r\n  |.if SSE\r\n  |  movsd qword [BASE], xmm0\r\n  |.else\r\n  |  fstp qword [BASE]\r\n  |.endif\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |3:  // Return +-0, +-Inf, NaN unmodified and an exponent of 0.\r\n  |.if SSE\r\n  |  xorps xmm0, xmm0; jmp <2\r\n  |.else\r\n  |  fldz; jmp <2\r\n  |.endif\r\n  |4:  // Handle denormals by multiplying with 2^54 and adjusting the bias.\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]\r\n  |  sseconst_hi xmm1, RBa, 43500000  // 2^54.\r\n  |  mulsd xmm0, xmm1\r\n  |  movsd qword [BASE-8], xmm0\r\n  |.else\r\n  |  fld qword [BASE]\r\n  |  mov TMP1, 0x5a800000; fmul TMP1\t// x = x*2^54\r\n  |  fstp qword [BASE-8]\r\n  |.endif\r\n  |  mov RB, [BASE-4]; mov RC, 1076; shl RB, 1; jmp <1\r\n  |\r\n  |.if SSE\r\n  |.ffunc_nsse math_modf\r\n  |.else\r\n  |.ffunc_n math_modf\r\n  |.endif\r\n  |  mov RB, [BASE+4]\r\n  |  mov PC, [BASE-4]\r\n  |  shl RB, 1; cmp RB, 0xffe00000; je >4\t// +-Inf?\r\n  |.if SSE\r\n  |  movaps xmm4, xmm0\r\n  |  call ->vm_trunc\r\n  |  subsd xmm4, xmm0\r\n  |1:\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  movsd qword [BASE], xmm4\r\n  |.else\r\n  |  fdup\r\n  |  call ->vm_trunc\r\n  |  fsub st1, st0\r\n  |1:\r\n  |  fstp qword [BASE-8]\r\n  |  fstp qword [BASE]\r\n  |.endif\r\n  |  mov RC, [BASE-4]; mov RB, [BASE+4]\r\n  |  xor RC, RB; js >3\t\t\t\t// Need to adjust sign?\r\n  |2:\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |3:\r\n  |  xor RB, 0x80000000; mov [BASE+4], RB\t// Flip sign of fraction.\r\n  |  jmp <2\r\n  |4:\r\n  |.if SSE\r\n  |  xorps xmm4, xmm4; jmp <1\t\t\t// Return +-Inf and +-0.\r\n  |.else\r\n  |  fldz; fxch; jmp <1\t\t\t\t// Return +-Inf and +-0.\r\n  |.endif\r\n  |\r\n  |.ffunc_nnr math_fmod\r\n  |1: ; fprem; fnstsw ax; and ax, 0x400; jnz <1\r\n  |  fpop1\r\n  |  jmp ->fff_resn\r\n  |\r\n  |.if SSE\r\n  |.ffunc_nnsse math_pow;\tcall ->vm_pow;\tjmp ->fff_resxmm0\r\n  |.else\r\n  |.ffunc_nn math_pow;\t\tcall ->vm_pow;\tjmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.macro math_minmax, name, cmovop, fcmovop, sseop\r\n  |  .ffunc name\r\n  |  mov RA, 2\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >4\r\n  |  mov RB, dword [BASE]\r\n  |1:  // Handle integers.\r\n  |  cmp RA, RD; jae ->fff_resi\r\n  |  cmp dword [BASE+RA*8-4], LJ_TISNUM; jne >3\r\n  |  cmp RB, dword [BASE+RA*8-8]\r\n  |  cmovop RB, dword [BASE+RA*8-8]\r\n  |  add RA, 1\r\n  |  jmp <1\r\n  |3:\r\n  |  ja ->fff_fallback\r\n  |  // Convert intermediate result to number and continue below.\r\n  |.if SSE\r\n  |  cvtsi2sd xmm0, RB\r\n  |.else\r\n  |  mov TMP1, RB\r\n  |  fild TMP1\r\n  |.endif\r\n  |  jmp >6\r\n  |4:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]\r\n  |5:  // Handle numbers or integers.\r\n  |  cmp RA, RD; jae ->fff_resxmm0\r\n  |  cmp dword [BASE+RA*8-4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jb >6\r\n  |  ja ->fff_fallback\r\n  |  cvtsi2sd xmm1, dword [BASE+RA*8-8]\r\n  |  jmp >7\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |6:\r\n  |  movsd xmm1, qword [BASE+RA*8-8]\r\n  |7:\r\n  |  sseop xmm0, xmm1\r\n  |  add RA, 1\r\n  |  jmp <5\r\n  |.else\r\n  |  fld qword [BASE]\r\n  |5:  // Handle numbers or integers.\r\n  |  cmp RA, RD; jae ->fff_resn\r\n  |  cmp dword [BASE+RA*8-4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jb >6\r\n  |  ja >9\r\n  |  fild dword [BASE+RA*8-8]\r\n  |  jmp >7\r\n  |.else\r\n  |  jae >9\r\n  |.endif\r\n  |6:\r\n  |  fld qword [BASE+RA*8-8]\r\n  |7:\r\n  |  fucomi st1; fcmovop st1; fpop1\r\n  |  add RA, 1\r\n  |  jmp <5\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, cmovg, fcmovnbe, minsd\r\n  |  math_minmax math_max, cmovl, fcmovbe, maxsd\r\n  |.if not SSE\r\n  |9:\r\n  |  fpop; jmp ->fff_fallback\r\n  |.endif\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc_1 string_len\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |.if DUALNUM\r\n  |  mov RB, dword STR:RB->len; jmp ->fff_resi\r\n  |.elif SSE\r\n  |  cvtsi2sd xmm0, dword STR:RB->len; jmp ->fff_resxmm0\r\n  |.else\r\n  |  fild dword STR:RB->len; jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |  mov PC, [BASE-4]\r\n  |  cmp dword STR:RB->len, 1\r\n  |  jb ->fff_res0\t\t\t// Return no results for empty string.\r\n  |  movzx RB, byte STR:RB[1]\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resi\r\n  |.elif SSE\r\n  |  cvtsi2sd xmm0, RB; jmp ->fff_resxmm0\r\n  |.else\r\n  |  mov TMP1, RB; fild TMP1; jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\t// *Exactly* 1 arg.\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |  mov RB, dword [BASE]\r\n  |  cmp RB, 255;  ja ->fff_fallback\r\n  |  mov TMP2, RB\r\n  |.elif SSE\r\n  |  jae ->fff_fallback\r\n  |  cvttsd2si RB, qword [BASE]\r\n  |  cmp RB, 255;  ja ->fff_fallback\r\n  |  mov TMP2, RB\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |  fld qword [BASE]\r\n  |  fistp TMP2\r\n  |  cmp TMP2, 255;  ja ->fff_fallback\r\n  |.endif\r\n  |.if X64\r\n  |  mov TMP3, 1\r\n  |.else\r\n  |  mov ARG3, 1\r\n  |.endif\r\n  |  lea RDa, TMP2\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |.if X64\r\n  |  mov CARG3d, TMP3\t\t\t// Zero-extended to size_t.\r\n  |  mov CARG2, RDa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG2, RD\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |  // GCstr * returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RD\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  mov TMP2, -1\r\n  |  cmp NARGS:RD, 1+2;  jb ->fff_fallback\r\n  |  jna >1\r\n  |  cmp dword [BASE+20], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |  mov RB, dword [BASE+16]\r\n  |  mov TMP2, RB\r\n  |.elif SSE\r\n  |  jae ->fff_fallback\r\n  |  cvttsd2si RB, qword [BASE+16]\r\n  |  mov TMP2, RB\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |  fld qword [BASE+16]\r\n  |  fistp TMP2\r\n  |.endif\r\n  |1:\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  mov STR:RB, [BASE]\r\n  |  mov TMP3, STR:RB\r\n  |  mov RB, STR:RB->len\r\n  |.if DUALNUM\r\n  |  mov RA, dword [BASE+8]\r\n  |.elif SSE\r\n  |  cvttsd2si RA, qword [BASE+8]\r\n  |.else\r\n  |  fld qword [BASE+8]\r\n  |  fistp ARG3\r\n  |  mov RA, ARG3\r\n  |.endif\r\n  |  mov RC, TMP2\r\n  |  cmp RB, RC\t\t\t\t// len < end? (unsigned compare)\r\n  |  jb >5\r\n  |2:\r\n  |  test RA, RA\t\t\t// start <= 0?\r\n  |  jle >7\r\n  |3:\r\n  |  mov STR:RB, TMP3\r\n  |  sub RC, RA\t\t\t\t// start > end?\r\n  |  jl ->fff_emptystr\r\n  |  lea RB, [STR:RB+RA+#STR-1]\r\n  |  add RC, 1\r\n  |4:\r\n  |.if X64\r\n  |  mov TMP3, RC\r\n  |.else\r\n  |  mov ARG3, RC\r\n  |.endif\r\n  |  mov RD, RB\r\n  |  jmp ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  jl >6\r\n  |  lea RC, [RC+RB+1]\t\t\t// end = end+(len+1)\r\n  |  jmp <2\r\n  |6:  // Overflow.\r\n  |  mov RC, RB\t\t\t\t// end = len\r\n  |  jmp <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |  je >8\r\n  |  add RA, RB\t\t\t\t// start = start+(len+1)\r\n  |  add RA, 1\r\n  |  jg <3\t\t\t\t// start > 0?\r\n  |8:  // Underflow.\r\n  |  mov RA, 1\t\t\t\t// start = 1\r\n  |  jmp <3\r\n  |\r\n  |->fff_emptystr:  // Range underflow.\r\n  |  xor RC, RC\t\t\t\t// Zero length. Any ptr in RB is ok.\r\n  |  jmp <4\r\n  |\r\n  |.ffunc string_rep\t\t\t// Only handle the 1-char case inline.\r\n  |  ffgccheck\r\n  |  cmp NARGS:RD, 2+1; jne ->fff_fallback\t// Exactly 2 arguments.\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM\r\n  |  mov STR:RB, [BASE]\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |  mov RC, dword [BASE+8]\r\n  |.elif SSE\r\n  |  jae ->fff_fallback\r\n  |  cvttsd2si RC, qword [BASE+8]\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |  fld qword [BASE+8]\r\n  |  fistp TMP2\r\n  |  mov RC, TMP2\r\n  |.endif\r\n  |  test RC, RC\r\n  |  jle ->fff_emptystr\t\t\t// Count <= 0? (or non-int)\r\n  |  cmp dword STR:RB->len, 1\r\n  |  jb ->fff_emptystr\t\t\t// Zero length string?\r\n  |  jne ->fff_fallback_2\t\t// Fallback for > 1-char strings.\r\n  |  cmp [DISPATCH+DISPATCH_GL(tmpbuf.sz)], RC;  jb ->fff_fallback_2\r\n  |  movzx RA, byte STR:RB[1]\r\n  |  mov RB, [DISPATCH+DISPATCH_GL(tmpbuf.buf)]\r\n  |.if X64\r\n  |  mov TMP3, RC\r\n  |.else\r\n  |  mov ARG3, RC\r\n  |.endif\r\n  |1:  // Fill buffer with char. Yes, this is suboptimal code (do you care?).\r\n  |  mov [RB], RAL\r\n  |  add RB, 1\r\n  |  sub RC, 1\r\n  |  jnz <1\r\n  |  mov RD, [DISPATCH+DISPATCH_GL(tmpbuf.buf)]\r\n  |  jmp ->fff_newstr\r\n  |\r\n  |.ffunc_1 string_reverse\r\n  |  ffgccheck\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |  mov RC, STR:RB->len\r\n  |  test RC, RC\r\n  |  jz ->fff_emptystr\t\t\t// Zero length string?\r\n  |  cmp [DISPATCH+DISPATCH_GL(tmpbuf.sz)], RC;  jb ->fff_fallback_1\r\n  |  add RB, #STR\r\n  |  mov TMP2, PC\t\t\t// Need another temp register.\r\n  |.if X64\r\n  |  mov TMP3, RC\r\n  |.else\r\n  |  mov ARG3, RC\r\n  |.endif\r\n  |  mov PC, [DISPATCH+DISPATCH_GL(tmpbuf.buf)]\r\n  |1:\r\n  |  movzx RA, byte [RB]\r\n  |  add RB, 1\r\n  |  sub RC, 1\r\n  |  mov [PC+RC], RAL\r\n  |  jnz <1\r\n  |  mov RD, PC\r\n  |  mov PC, TMP2\r\n  |  jmp ->fff_newstr\r\n  |\r\n  |.macro ffstring_case, name, lo, hi\r\n  |  .ffunc_1 name\r\n  |  ffgccheck\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |  mov RC, STR:RB->len\r\n  |  cmp [DISPATCH+DISPATCH_GL(tmpbuf.sz)], RC;  jb ->fff_fallback_1\r\n  |  add RB, #STR\r\n  |  mov TMP2, PC\t\t\t// Need another temp register.\r\n  |.if X64\r\n  |  mov TMP3, RC\r\n  |.else\r\n  |  mov ARG3, RC\r\n  |.endif\r\n  |  mov PC, [DISPATCH+DISPATCH_GL(tmpbuf.buf)]\r\n  |  jmp >3\r\n  |1:  // ASCII case conversion. Yes, this is suboptimal code (do you care?).\r\n  |  movzx RA, byte [RB+RC]\r\n  |  cmp RA, lo\r\n  |  jb >2\r\n  |  cmp RA, hi\r\n  |  ja >2\r\n  |  xor RA, 0x20\r\n  |2:\r\n  |  mov [PC+RC], RAL\r\n  |3:\r\n  |  sub RC, 1\r\n  |  jns <1\r\n  |  mov RD, PC\r\n  |  mov PC, TMP2\r\n  |  jmp ->fff_newstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_case string_lower, 0x41, 0x5a\r\n  |ffstring_case string_upper, 0x61, 0x7a\r\n  |\r\n  |//-- Table library ------------------------------------------------------\r\n  |\r\n  |.ffunc_1 table_getn\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov TAB:FCARG1, [BASE]\r\n  |  call extern lj_tab_len@4\t\t// LJ_FASTCALL (GCtab *t)\r\n  |  // Length of table returned in eax (RD).\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |.if DUALNUM\r\n  |  mov RB, RD; jmp ->fff_resi\r\n  |.elif SSE\r\n  |  cvtsi2sd xmm0, RD; jmp ->fff_resxmm0\r\n  |.else\r\n  |  mov ARG1, RD; fild ARG1; jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.define TOBIT_BIAS, 0x59c00000\t// 2^52 + 2^51 (float, not double!).\r\n  |\r\n  |.macro .ffunc_bit, name, kind, fdef\r\n  |  fdef name\r\n  |.if kind == 2\r\n  |.if SSE\r\n  |  sseconst_tobit xmm1, RBa\r\n  |.else\r\n  |  mov TMP1, TOBIT_BIAS\r\n  |.endif\r\n  |.endif\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >1\r\n  |  mov RB, dword [BASE]\r\n  |.if kind > 0\r\n  |  jmp >2\r\n  |.else\r\n  |  jmp ->fff_resbit\r\n  |.endif\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |.if SSE\r\n  |  movsd xmm0, qword [BASE]\r\n  |.if kind < 2\r\n  |  sseconst_tobit xmm1, RBa\r\n  |.endif\r\n  |  addsd xmm0, xmm1\r\n  |  movd RB, xmm0\r\n  |.else\r\n  |  fld qword [BASE]\r\n  |.if kind < 2\r\n  |  mov TMP1, TOBIT_BIAS\r\n  |.endif\r\n  |  fadd TMP1\r\n  |  fstp FPARG1\r\n  |.if kind > 0\r\n  |  mov RB, ARG1\r\n  |.endif\r\n  |.endif\r\n  |2:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit, name, kind\r\n  |  .ffunc_bit name, kind, .ffunc_1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit bit_tobit, 0\r\n  |.if DUALNUM or SSE\r\n  |.if not SSE\r\n  |  mov RB, ARG1\r\n  |.endif\r\n  |  jmp ->fff_resbit\r\n  |.else\r\n  |  fild ARG1\r\n  |  jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name, 2\r\n  |  mov TMP2, NARGS:RD\t\t\t// Save for fallback.\r\n  |  lea RD, [BASE+NARGS:RD*8-16]\r\n  |1:\r\n  |  cmp RD, BASE\r\n  |  jbe ->fff_resbit\r\n  |  cmp dword [RD+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >2\r\n  |  ins RB, dword [RD]\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |2:\r\n  |  ja ->fff_fallback_bit_op\r\n  |.else\r\n  |  jae ->fff_fallback_bit_op\r\n  |.endif\r\n  |.if SSE\r\n  |  movsd xmm0, qword [RD]\r\n  |  addsd xmm0, xmm1\r\n  |  movd RA, xmm0\r\n  |  ins RB, RA\r\n  |.else\r\n  |  fld qword [RD]\r\n  |  fadd TMP1\r\n  |  fstp FPARG1\r\n  |  ins RB, ARG1\r\n  |.endif\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op bit_band, and\r\n  |.ffunc_bit_op bit_bor, or\r\n  |.ffunc_bit_op bit_bxor, xor\r\n  |\r\n  |.ffunc_bit bit_bswap, 1\r\n  |  bswap RB\r\n  |  jmp ->fff_resbit\r\n  |\r\n  |.ffunc_bit bit_bnot, 1\r\n  |  not RB\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resbit\r\n  |.elif SSE\r\n  |->fff_resbit:\r\n  |  cvtsi2sd xmm0, RB\r\n  |  jmp ->fff_resxmm0\r\n  |.else\r\n  |->fff_resbit:\r\n  |  mov ARG1, RB\r\n  |  fild ARG1\r\n  |  jmp ->fff_resn\r\n  |.endif\r\n  |\r\n  |->fff_fallback_bit_op:\r\n  |  mov NARGS:RD, TMP2\t\t\t// Restore for fallback\r\n  |  jmp ->fff_fallback\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins\r\n  |.if DUALNUM\r\n  |  .ffunc_bit name, 1, .ffunc_2\r\n  |  // Note: no inline conversion from number for 2nd argument!\r\n  |  cmp dword [BASE+12], LJ_TISNUM; jne ->fff_fallback\r\n  |  mov RA, dword [BASE+8]\r\n  |.elif SSE\r\n  |  .ffunc_nnsse name\r\n  |  sseconst_tobit xmm2, RBa\r\n  |  addsd xmm0, xmm2\r\n  |  addsd xmm1, xmm2\r\n  |  movd RB, xmm0\r\n  |  movd RA, xmm1\r\n  |.else\r\n  |  .ffunc_nn name\r\n  |  mov TMP1, TOBIT_BIAS\r\n  |  fadd TMP1\r\n  |  fstp FPARG3\r\n  |  fadd TMP1\r\n  |  fstp FPARG1\r\n  |  mov RA, ARG3\r\n  |  mov RB, ARG1\r\n  |.endif\r\n  |  ins RB, cl\t\t\t\t// Assumes RA is ecx.\r\n  |  jmp ->fff_resbit\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh bit_lshift, shl\r\n  |.ffunc_bit_sh bit_rshift, shr\r\n  |.ffunc_bit_sh bit_arshift, sar\r\n  |.ffunc_bit_sh bit_rol, rol\r\n  |.ffunc_bit_sh bit_ror, ror\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback_2:\r\n  |  mov NARGS:RD, 1+2\t\t\t// Other args are ignored, anyway.\r\n  |  jmp ->fff_fallback\r\n  |->fff_fallback_1:\r\n  |  mov NARGS:RD, 1+1\t\t\t// Other args are ignored, anyway.\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  mov L:RB, SAVE_L\r\n  |  mov PC, [BASE-4]\t\t\t// Fallback may overwrite PC.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  lea RA, [RD+8*LUA_MINSTACK]\t// Ensure enough space for handler.\r\n  |  mov L:RB->top, RD\r\n  |  mov CFUNC:RD, [BASE-8]\r\n  |  cmp RA, L:RB->maxstack\r\n  |  ja >5\t\t\t\t// Need to grow stack.\r\n  |.if X64\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |  call aword CFUNC:RD->f\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  test RD, RD;  jg ->fff_res\t\t// Returned nresults+1?\r\n  |1:\r\n  |  mov RA, L:RB->top\r\n  |  sub RA, BASE\r\n  |  shr RA, 3\r\n  |  test RD, RD\r\n  |  lea NARGS:RD, [RA+1]\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  jne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  mov RA, BASE\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz >3\r\n  |  movzx RB, PC_RA\r\n  |  not RBa\t\t\t\t// Note: ~RB = -(RB+1)\r\n  |  lea BASE, [BASE+RB*8]\t\t// base = base - (RB+1)*8\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |3:\r\n  |  mov RB, PC\r\n  |  and RB, -8\r\n  |  sub BASE, RB\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov FCARG2, LUA_MINSTACK\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  xor RD, RD\t\t\t\t// Simulate a return 0.\r\n  |  jmp <1\t\t\t\t// Dumb retry (goes through ff first).\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  pop RBa\t\t\t\t// Must keep stack at same level.\r\n  |  mov TMPa, RBa\t\t\t// Save return address\r\n  |  mov L:RB, SAVE_L\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov FCARG1, L:RB\r\n  |  mov L:RB->top, RD\r\n  |  call extern lj_gc_step@4\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  mov RBa, TMPa\r\n  |  push RBa\t\t\t\t// Restore return address.\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_VMEVENT\t\t// No recording while in vmevent.\r\n  |  jnz >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |  test RDL, HOOK_ACTIVE\r\n  |  jnz >1\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >1\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |  jmp >1\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >5\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jz >1\r\n  |  test RDL, LUA_MASKLINE\r\n  |  jz >5\r\n  |1:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, PC\t\t\t// Caveat: FCARG2 == BASE\r\n  |  mov FCARG1, L:RB\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  call extern lj_dispatch_ins@8\t// (lua_State *L, BCIns *pc)\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |4:\r\n  |  movzx RA, PC_RA\r\n  |5:\r\n  |  movzx OP, PC_OP\r\n  |  movzx RD, PC_RD\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Re-dispatch to static ins.\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4+GG_DISP2STATIC]\t// Re-dispatch to static ins.\r\n  |.endif\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  add PC, 4\r\n  |  mov RA, [RB-24]\r\n  |  mov MULTRES, RA\t\t\t// Restore MULTRES for *M ins.\r\n  |  jmp <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  mov LFUNC:RB, [BASE-8]\t\t// Same as curr_topL(L).\r\n  |  mov RB, LFUNC:RB->pc\r\n  |  movzx RD, byte [RB+PC2PROTO(framesize)]\r\n  |  lea RD, [BASE+RD*8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov FCARG2, PC\r\n  |  lea FCARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RBa\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_trace_hot@8\t\t// (jit_State *J, const BCIns *pc)\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov SAVE_PC, PC\r\n  |.if JIT\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  mov SAVE_PC, PC\r\n  |  or PC, 1\t\t\t\t// Marker for hot call.\r\n  |1:\r\n  |.endif\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov FCARG2, PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_dispatch_call@8\t// (lua_State *L, const BCIns *pc)\r\n  |  // ASMFunction returned in eax/rax (RDa).\r\n  |  mov SAVE_PC, 0\t\t\t// Invalidate for subsequent line hook.\r\n  |.if JIT\r\n  |  and PC, -2\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  mov RAa, RDa\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  mov RBa, RAa\r\n  |  movzx RA, PC_RA\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  jmp RBa\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Called from an exit stub with the exit number on the stack.\r\n  |// The 16 bit exit number is stored with two (sign-extended) push imm8.\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |.if X64\r\n  |  push r13; push r12\r\n  |  push r11; push r10; push r9; push r8\r\n  |  push rdi; push rsi; push rbp; lea rbp, [rsp+88]; push rbp\r\n  |  push rbx; push rdx; push rcx; push rax\r\n  |  movzx RC, byte [rbp-8]\t\t// Reconstruct exit number.\r\n  |  mov RCH, byte [rbp-16]\r\n  |  mov [rbp-8], r15; mov [rbp-16], r14\r\n  |.else\r\n  |  push ebp; lea ebp, [esp+12]; push ebp\r\n  |  push ebx; push edx; push ecx; push eax\r\n  |  movzx RC, byte [ebp-4]\t\t// Reconstruct exit number.\r\n  |  mov RCH, byte [ebp-8]\r\n  |  mov [ebp-4], edi; mov [ebp-8], esi\r\n  |.endif\r\n  |  // Caveat: DISPATCH is ebx.\r\n  |  mov DISPATCH, [ebp]\r\n  |  mov RA, [DISPATCH+DISPATCH_GL(vmstate)]\t// Get trace number.\r\n  |  set_vmstate EXIT\r\n  |  mov [DISPATCH+DISPATCH_J(exitno)], RC\r\n  |  mov [DISPATCH+DISPATCH_J(parent)], RA\r\n  |.if X64\r\n  |.if X64WIN\r\n  |  sub rsp, 16*8+4*8\t\t\t// Room for SSE regs + save area.\r\n  |.else\r\n  |  sub rsp, 16*8\t\t\t// Room for SSE regs.\r\n  |.endif\r\n  |  add rbp, -128\r\n  |  movsd qword [rbp-8],   xmm15; movsd qword [rbp-16],  xmm14\r\n  |  movsd qword [rbp-24],  xmm13; movsd qword [rbp-32],  xmm12\r\n  |  movsd qword [rbp-40],  xmm11; movsd qword [rbp-48],  xmm10\r\n  |  movsd qword [rbp-56],  xmm9;  movsd qword [rbp-64],  xmm8\r\n  |  movsd qword [rbp-72],  xmm7;  movsd qword [rbp-80],  xmm6\r\n  |  movsd qword [rbp-88],  xmm5;  movsd qword [rbp-96],  xmm4\r\n  |  movsd qword [rbp-104], xmm3;  movsd qword [rbp-112], xmm2\r\n  |  movsd qword [rbp-120], xmm1;  movsd qword [rbp-128], xmm0\r\n  |.else\r\n  |  sub esp, 8*8+16\t\t\t// Room for SSE regs + args.\r\n  |  movsd qword [ebp-40], xmm7; movsd qword [ebp-48], xmm6\r\n  |  movsd qword [ebp-56], xmm5; movsd qword [ebp-64], xmm4\r\n  |  movsd qword [ebp-72], xmm3; movsd qword [ebp-80], xmm2\r\n  |  movsd qword [ebp-88], xmm1; movsd qword [ebp-96], xmm0\r\n  |.endif\r\n  |  // Caveat: RB is ebp.\r\n  |  mov L:RB, [DISPATCH+DISPATCH_GL(jit_L)]\r\n  |  mov BASE, [DISPATCH+DISPATCH_GL(jit_base)]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RBa\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_L)], 0\r\n  |  mov L:RB->base, BASE\r\n  |.if X64WIN\r\n  |  lea CARG2, [rsp+4*8]\r\n  |.elif X64\r\n  |  mov CARG2, rsp\r\n  |.else\r\n  |  lea FCARG2, [esp+16]\r\n  |.endif\r\n  |  lea FCARG1, [DISPATCH+GG_DISP2J]\r\n  |  call extern lj_trace_exit@8\t// (jit_State *J, ExitState *ex)\r\n  |  // MULTRES or negated error code returned in eax (RD).\r\n  |  mov RAa, L:RB->cframe\r\n  |  and RAa, CFRAME_RAWMASK\r\n  |.if X64WIN\r\n  |  // Reposition stack later.\r\n  |.elif X64\r\n  |  mov rsp, RAa\t\t\t// Reposition stack to C frame.\r\n  |.else\r\n  |  mov esp, RAa\t\t\t// Reposition stack to C frame.\r\n  |.endif\r\n  |  mov [RAa+CFRAME_OFS_L], L:RB\t// Set SAVE_L (on-trace resume/yield).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [RAa+CFRAME_OFS_PC]\t// Get SAVE_PC.\r\n  |.if X64\r\n  |  jmp >1\r\n  |.endif\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |  // RD = MULTRES or negated error code, BASE, PC and DISPATCH set.\r\n  |.if JIT\r\n  |.if X64\r\n  |  // Restore additional callee-save registers only used in compiled code.\r\n  |.if X64WIN\r\n  |  lea RAa, [rsp+9*16+4*8]\r\n  |1:\r\n  |  movdqa xmm15, [RAa-9*16]\r\n  |  movdqa xmm14, [RAa-8*16]\r\n  |  movdqa xmm13, [RAa-7*16]\r\n  |  movdqa xmm12, [RAa-6*16]\r\n  |  movdqa xmm11, [RAa-5*16]\r\n  |  movdqa xmm10, [RAa-4*16]\r\n  |  movdqa xmm9, [RAa-3*16]\r\n  |  movdqa xmm8, [RAa-2*16]\r\n  |  movdqa xmm7, [RAa-1*16]\r\n  |  mov rsp, RAa\t\t\t// Reposition stack to C frame.\r\n  |  movdqa xmm6, [RAa]\r\n  |  mov r15, CSAVE_3\r\n  |  mov r14, CSAVE_4\r\n  |.else\r\n  |  add rsp, 16\t\t\t// Reposition stack to C frame.\r\n  |1:\r\n  |.endif\r\n  |  mov r13, TMPa\r\n  |  mov r12, TMPQ\r\n  |.endif\r\n  |  test RD, RD; js >3\t\t\t// Check for error from exit.\r\n  |  mov MULTRES, RD\r\n  |  mov LFUNC:KBASE, [BASE-8]\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_L)], 0\r\n  |  set_vmstate INTERP\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  mov RC, [PC]\r\n  |  movzx RA, RCH\r\n  |  movzx OP, RCL\r\n  |  add PC, 4\r\n  |  shr RC, 16\r\n  |  cmp OP, BC_FUNCF\t\t\t// Function header?\r\n  |  jb >2\r\n  |  mov RC, MULTRES\t\t\t// RC/RD holds nres+1.\r\n  |2:\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8]\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4]\r\n  |.endif\r\n  |\r\n  |3:  // Rethrow error from the right C frame.\r\n  |  neg RD\r\n  |  mov FCARG1, L:RB\r\n  |  mov FCARG2, RD\r\n  |  call extern lj_err_throw@8\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called by math.floor/math.ceil fast functions\r\n  |// and from JIT code.\r\n  |\r\n  |// x87 variant: Arg/ret on x87 stack. No int/xmm registers modified.\r\n  |.macro vm_round_x87, mode1, mode2\r\n  |  fnstcw word [esp+4]\t\t// Caveat: overwrites ARG1 and ARG2.\r\n  |  mov [esp+8], eax\r\n  |  mov ax, mode1\r\n  |  or ax, [esp+4]\r\n  |.if mode2 ~= 0xffff\r\n  |  and ax, mode2\r\n  |.endif\r\n  |  mov [esp+6], ax\r\n  |  fldcw word [esp+6]\r\n  |  frndint\r\n  |  fldcw word [esp+4]\r\n  |  mov eax, [esp+8]\r\n  |  ret\r\n  |.endmacro\r\n  |\r\n  |// SSE variant: arg/ret is xmm0. xmm0-xmm3 and RD (eax) modified.\r\n  |.macro vm_round_sse, mode\r\n  |  sseconst_abs xmm2, RDa\r\n  |  sseconst_2p52 xmm3, RDa\r\n  |  movaps xmm1, xmm0\r\n  |  andpd xmm1, xmm2\t\t\t// |x|\r\n  |  ucomisd xmm3, xmm1\t\t\t// No truncation if 2^52 <= |x|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |.if mode == 2\t\t// trunc(x)?\r\n  |  movaps xmm0, xmm1\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  sseconst_1 xmm3, RDa\r\n  |  cmpsd xmm0, xmm1, 1\t\t// |x| < result?\r\n  |  andpd xmm0, xmm3\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract -1.\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |.else\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |  .if mode == 1\t\t// ceil(x)?\r\n  |    sseconst_m1 xmm2, RDa\t\t// Must subtract -1 to preserve -0.\r\n  |    cmpsd xmm0, xmm1, 6\t\t// x > result?\r\n  |  .else\t\t\t// floor(x)?\r\n  |    sseconst_1 xmm2, RDa\r\n  |    cmpsd xmm0, xmm1, 1\t\t// x < result?\r\n  |  .endif\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract +-1.\r\n  |.endif\r\n  |  movaps xmm0, xmm1\r\n  |1:\r\n  |  ret\r\n  |.endmacro\r\n  |\r\n  |.macro vm_round, name, ssemode, mode1, mode2\r\n  |->name:\r\n  |.if not SSE\r\n  |  vm_round_x87 mode1, mode2\r\n  |.endif\r\n  |->name .. _sse:\r\n  |  vm_round_sse ssemode\r\n  |.endmacro\r\n  |\r\n  |  vm_round vm_floor, 0, 0x0400, 0xf7ff\r\n  |  vm_round vm_ceil,  1, 0x0800, 0xfbff\r\n  |  vm_round vm_trunc, 2, 0x0c00, 0xffff\r\n  |\r\n  |// FP modulo x%y. Called by BC_MOD* and vm_arith.\r\n  |->vm_mod:\r\n  |.if SSE\r\n  |// Args in xmm0/xmm1, return value in xmm0.\r\n  |// Caveat: xmm0-xmm5 and RC (eax) modified!\r\n  |  movaps xmm5, xmm0\r\n  |  divsd xmm0, xmm1\r\n  |  sseconst_abs xmm2, RDa\r\n  |  sseconst_2p52 xmm3, RDa\r\n  |  movaps xmm4, xmm0\r\n  |  andpd xmm4, xmm2\t\t\t// |x/y|\r\n  |  ucomisd xmm3, xmm4\t\t\t// No truncation if 2^52 <= |x/y|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |  addsd xmm4, xmm3\t\t\t// (|x/y| + 2^52) - 2^52\r\n  |  subsd xmm4, xmm3\r\n  |  orpd xmm4, xmm2\t\t\t// Merge sign bit back in.\r\n  |  sseconst_1 xmm2, RDa\r\n  |  cmpsd xmm0, xmm4, 1\t\t// x/y < result?\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm4, xmm0\t\t\t// If yes, subtract 1.0.\r\n  |  movaps xmm0, xmm5\r\n  |  mulsd xmm1, xmm4\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |1:\r\n  |  mulsd xmm1, xmm0\r\n  |  movaps xmm0, xmm5\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |.else\r\n  |// Args/ret on x87 stack (y on top). No xmm registers modified.\r\n  |// Caveat: needs 3 slots on x87 stack! RC (eax) modified!\r\n  |  fld st1\r\n  |  fdiv st1\r\n  |  fnstcw word [esp+4]\r\n  |  mov ax, 0x0400\r\n  |  or ax, [esp+4]\r\n  |  and ax, 0xf7ff\r\n  |  mov [esp+6], ax\r\n  |  fldcw word [esp+6]\r\n  |  frndint\r\n  |  fldcw word [esp+4]\r\n  |  fmulp st1\r\n  |  fsubp st1\r\n  |  ret\r\n  |.endif\r\n  |\r\n  |// FP log2(x). Called by math.log(x, base).\r\n  |->vm_log2:\r\n  |.if X64WIN\r\n  |  movsd qword [rsp+8], xmm0\t\t// Use scratch area.\r\n  |  fld1\r\n  |  fld qword [rsp+8]\r\n  |  fyl2x\r\n  |  fstp qword [rsp+8]\r\n  |  movsd xmm0, qword [rsp+8]\r\n  |.elif X64\r\n  |  movsd qword [rsp-8], xmm0\t\t// Use red zone.\r\n  |  fld1\r\n  |  fld qword [rsp-8]\r\n  |  fyl2x\r\n  |  fstp qword [rsp-8]\r\n  |  movsd xmm0, qword [rsp-8]\r\n  |.else\r\n  |  fld1\r\n  |  fld qword [esp+4]\r\n  |  fyl2x\r\n  |.endif\r\n  |  ret\r\n  |\r\n  |// FP exponentiation e^x and 2^x. Called by math.exp fast function and\r\n  |// from JIT code. Arg/ret on x87 stack. No int/xmm regs modified.\r\n  |// Caveat: needs 3 slots on x87 stack!\r\n  |->vm_exp_x87:\r\n  |  fldl2e; fmulp st1\t\t\t\t// e^x ==> 2^(x*log2(e))\r\n  |->vm_exp2_x87:\r\n  |  .if X64WIN\r\n  |    .define expscratch, dword [rsp+8]\t// Use scratch area.\r\n  |  .elif X64\r\n  |    .define expscratch, dword [rsp-8]\t// Use red zone.\r\n  |  .else\r\n  |    .define expscratch, dword [esp+4]\t// Needs 4 byte scratch area.\r\n  |  .endif\r\n  |  fst expscratch\t\t\t\t// Caveat: overwrites ARG1.\r\n  |  cmp expscratch, 0x7f800000; je >1\t\t// Special case: e^+Inf = +Inf\r\n  |  cmp expscratch, 0xff800000; je >2\t\t// Special case: e^-Inf = 0\r\n  |->vm_exp2raw:  // Entry point for vm_pow. Without +-Inf check.\r\n  |  fdup; frndint; fsub st1, st0; fxch\t\t// Split into frac/int part.\r\n  |  f2xm1; fld1; faddp st1; fscale; fpop1\t// ==> (2^frac-1 +1) << int\r\n  |1:\r\n  |  ret\r\n  |2:\r\n  |  fpop; fldz; ret\r\n  |\r\n  |// Generic power function x^y. Called by BC_POW, math.pow fast function,\r\n  |// and vm_arith.\r\n  |// Args/ret on x87 stack (y on top). RC (eax) modified.\r\n  |// Caveat: needs 3 slots on x87 stack!\r\n  |->vm_pow:\r\n  |.if not SSE\r\n  |  fist dword [esp+4]\t\t\t// Store/reload int before comparison.\r\n  |  fild dword [esp+4]\t\t\t// Integral exponent used in vm_powi.\r\n  |  fucomip st1\r\n  |  jnz >8\t\t\t\t// Branch for FP exponents.\r\n  |  jp >9\t\t\t\t// Branch for NaN exponent.\r\n  |  fpop\t\t\t\t// Pop y and fallthrough to vm_powi.\r\n  |\r\n  |// FP/int power function x^i. Arg1/ret on x87 stack.\r\n  |// Arg2 (int) on C stack. RC (eax) modified.\r\n  |// Caveat: needs 2 slots on x87 stack!\r\n  |  mov eax, [esp+4]\r\n  |  cmp eax, 1; jle >6\t\t\t// i<=1?\r\n  |  // Now 1 < (unsigned)i <= 0x80000000.\r\n  |1:  // Handle leading zeros.\r\n  |  test eax, 1; jnz >2\r\n  |  fmul st0\r\n  |  shr eax, 1\r\n  |  jmp <1\r\n  |2:\r\n  |  shr eax, 1; jz >5\r\n  |  fdup\r\n  |3:  // Handle trailing bits.\r\n  |  fmul st0\r\n  |  shr eax, 1; jz >4\r\n  |  jnc <3\r\n  |  fmul st1, st0\r\n  |  jmp <3\r\n  |4:\r\n  |  fmulp st1\r\n  |5:\r\n  |  ret\r\n  |6:\r\n  |  je <5\t\t\t\t// x^1 ==> x\r\n  |  jb >7\r\n  |  fld1; fdivrp st1\r\n  |  neg eax\r\n  |  cmp eax, 1; je <5\t\t\t// x^-1 ==> 1/x\r\n  |  jmp <1\t\t\t\t// x^-i ==> (1/x)^i\r\n  |7:\r\n  |  fpop; fld1\t\t\t\t// x^0 ==> 1\r\n  |  ret\r\n  |\r\n  |8:  // FP/FP power function x^y.\r\n  |  fst dword [esp+4]\r\n  |  fxch\r\n  |  fst dword [esp+8]\r\n  |  mov eax, [esp+4]; shl eax, 1\r\n  |  cmp eax, 0xff000000; je >2\t\t\t// x^+-Inf?\r\n  |  mov eax, [esp+8]; shl eax, 1; je >4\t// +-0^y?\r\n  |  cmp eax, 0xff000000; je >4\t\t\t// +-Inf^y?\r\n  |  fyl2x\r\n  |  jmp ->vm_exp2raw\r\n  |\r\n  |9:  // Handle x^NaN.\r\n  |  fld1\r\n  |  fucomip st2\r\n  |  je >1\t\t\t\t// 1^NaN ==> 1\r\n  |  fxch\t\t\t\t// x^NaN ==> NaN\r\n  |1:\r\n  |  fpop\r\n  |  ret\r\n  |\r\n  |2:  // Handle x^+-Inf.\r\n  |  fabs\r\n  |  fld1\r\n  |  fucomip st1\r\n  |  je >3\t\t\t\t\t// +-1^+-Inf ==> 1\r\n  |  fpop; fabs; fldz; mov eax, 0; setc al\r\n  |  ror eax, 1; xor eax, [esp+4]; jns >3\t// |x|<>1, x^+-Inf ==> +Inf/0\r\n  |  fxch\r\n  |3:\r\n  |  fpop1; fabs\r\n  |  ret\r\n  |\r\n  |4:  // Handle +-0^y or +-Inf^y.\r\n  |  cmp dword [esp+4], 0; jge <3\t\t// y >= 0, x^y ==> |x|\r\n  |  fpop; fpop\r\n  |  test eax, eax; jz >5\t\t\t// y < 0, +-0^y ==> +Inf\r\n  |  fldz\t\t\t\t\t// y < 0, +-Inf^y ==> 0\r\n  |  ret\r\n  |5:\r\n  |  mov dword [esp+4], 0x7f800000\t\t// Return +Inf.\r\n  |  fld dword [esp+4]\r\n  |  ret\r\n  |.endif\r\n  |\r\n  |// Args in xmm0/xmm1. Ret in xmm0. xmm0-xmm2 and RC (eax) modified.\r\n  |// Needs 16 byte scratch area for x86. Also called from JIT code.\r\n  |->vm_pow_sse:\r\n  |  cvtsd2si eax, xmm1\r\n  |  cvtsi2sd xmm2, eax\r\n  |  ucomisd xmm1, xmm2\r\n  |  jnz >8\t\t\t\t// Branch for FP exponents.\r\n  |  jp >9\t\t\t\t// Branch for NaN exponent.\r\n  |  // Fallthrough to vm_powi_sse.\r\n  |\r\n  |// Args in xmm0/eax. Ret in xmm0. xmm0-xmm1 and eax modified.\r\n  |->vm_powi_sse:\r\n  |  cmp eax, 1; jle >6\t\t\t// i<=1?\r\n  |  // Now 1 < (unsigned)i <= 0x80000000.\r\n  |1:  // Handle leading zeros.\r\n  |  test eax, 1; jnz >2\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1\r\n  |  jmp <1\r\n  |2:\r\n  |  shr eax, 1; jz >5\r\n  |  movaps xmm1, xmm0\r\n  |3:  // Handle trailing bits.\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1; jz >4\r\n  |  jnc <3\r\n  |  mulsd xmm1, xmm0\r\n  |  jmp <3\r\n  |4:\r\n  |  mulsd xmm0, xmm1\r\n  |5:\r\n  |  ret\r\n  |6:\r\n  |  je <5\t\t\t\t// x^1 ==> x\r\n  |  jb >7\t\t\t\t// x^0 ==> 1\r\n  |  neg eax\r\n  |  call <1\r\n  |  sseconst_1 xmm1, RDa\r\n  |  divsd xmm1, xmm0\r\n  |  movaps xmm0, xmm1\r\n  |  ret\r\n  |7:\r\n  |  sseconst_1 xmm0, RDa\r\n  |  ret\r\n  |\r\n  |8:  // FP/FP power function x^y.\r\n  |.if X64\r\n  |  movd rax, xmm1; shl rax, 1\r\n  |  rol rax, 12; cmp rax, 0xffe; je >2\t\t// x^+-Inf?\r\n  |  movd rax, xmm0; shl rax, 1; je >4\t\t// +-0^y?\r\n  |  rol rax, 12; cmp rax, 0xffe; je >5\t\t// +-Inf^y?\r\n  |  .if X64WIN\r\n  |    movsd qword [rsp+16], xmm1\t\t// Use scratch area.\r\n  |    movsd qword [rsp+8], xmm0\r\n  |    fld qword [rsp+16]\r\n  |    fld qword [rsp+8]\r\n  |  .else\r\n  |    movsd qword [rsp-16], xmm1\t\t// Use red zone.\r\n  |    movsd qword [rsp-8], xmm0\r\n  |    fld qword [rsp-16]\r\n  |    fld qword [rsp-8]\r\n  |  .endif\r\n  |.else\r\n  |  movsd qword [esp+12], xmm1\t\t\t// Needs 16 byte scratch area.\r\n  |  movsd qword [esp+4], xmm0\r\n  |  cmp dword [esp+12], 0; jne >1\r\n  |  mov eax, [esp+16]; shl eax, 1\r\n  |  cmp eax, 0xffe00000; je >2\t\t\t// x^+-Inf?\r\n  |1:\r\n  |  cmp dword [esp+4], 0; jne >1\r\n  |  mov eax, [esp+8]; shl eax, 1; je >4\t// +-0^y?\r\n  |  cmp eax, 0xffe00000; je >5\t\t\t// +-Inf^y?\r\n  |1:\r\n  |  fld qword [esp+12]\r\n  |  fld qword [esp+4]\r\n  |.endif\r\n  |  fyl2x\t\t\t\t\t// y*log2(x)\r\n  |  fdup; frndint; fsub st1, st0; fxch\t\t// Split into frac/int part.\r\n  |  f2xm1; fld1; faddp st1; fscale; fpop1\t// ==> (2^frac-1 +1) << int\r\n  |.if X64WIN\r\n  |  fstp qword [rsp+8]\t\t\t\t// Use scratch area.\r\n  |  movsd xmm0, qword [rsp+8]\r\n  |.elif X64\r\n  |  fstp qword [rsp-8]\t\t\t\t// Use red zone.\r\n  |  movsd xmm0, qword [rsp-8]\r\n  |.else\r\n  |  fstp qword [esp+4]\t\t\t\t// Needs 8 byte scratch area.\r\n  |  movsd xmm0, qword [esp+4]\r\n  |.endif\r\n  |  ret\r\n  |\r\n  |9:  // Handle x^NaN.\r\n  |  sseconst_1 xmm2, RDa\r\n  |  ucomisd xmm0, xmm2; je >1\t\t\t// 1^NaN ==> 1\r\n  |  movaps xmm0, xmm1\t\t\t\t// x^NaN ==> NaN\r\n  |1:\r\n  |  ret\r\n  |\r\n  |2:  // Handle x^+-Inf.\r\n  |  sseconst_abs xmm2, RDa\r\n  |  andpd xmm0, xmm2\t\t\t\t// |x|\r\n  |  sseconst_1 xmm2, RDa\r\n  |  ucomisd xmm0, xmm2; je <1\t\t\t// +-1^+-Inf ==> 1\r\n  |  movmskpd eax, xmm1\r\n  |  xorps xmm0, xmm0\r\n  |  mov ah, al; setc al; xor al, ah; jne <1\t// |x|<>1, x^+-Inf ==> +Inf/0\r\n  |3:\r\n  |  sseconst_hi xmm0, RDa, 7ff00000  // +Inf\r\n  |  ret\r\n  |\r\n  |4:  // Handle +-0^y.\r\n  |  movmskpd eax, xmm1; test eax, eax; jnz <3\t// y < 0, +-0^y ==> +Inf\r\n  |  xorps xmm0, xmm0\t\t\t\t// y >= 0, +-0^y ==> 0\r\n  |  ret\r\n  |\r\n  |5:  // Handle +-Inf^y.\r\n  |  movmskpd eax, xmm1; test eax, eax; jz <3\t// y >= 0, +-Inf^y ==> +Inf\r\n  |  xorps xmm0, xmm0\t\t\t\t// y < 0, +-Inf^y ==> 0\r\n  |  ret\r\n  |\r\n  |// Callable from C: double lj_vm_foldfpm(double x, int fpm)\r\n  |// Computes fpm(x) for extended math functions. ORDER FPM.\r\n  |->vm_foldfpm:\r\n  |.if JIT\r\n  |.if X64\r\n  |  .if X64WIN\r\n  |    .define fpmop, CARG2d\r\n  |  .else\r\n  |    .define fpmop, CARG1d\r\n  |  .endif\r\n  |  cmp fpmop, 1; jb ->vm_floor; je ->vm_ceil\r\n  |  cmp fpmop, 3; jb ->vm_trunc; ja >2\r\n  |  sqrtsd xmm0, xmm0; ret\r\n  |2:\r\n  |  .if X64WIN\r\n  |    movsd qword [rsp+8], xmm0\t// Use scratch area.\r\n  |    fld qword [rsp+8]\r\n  |  .else\r\n  |    movsd qword [rsp-8], xmm0\t// Use red zone.\r\n  |    fld qword [rsp-8]\r\n  |  .endif\r\n  |  cmp fpmop, 5; ja >2\r\n  |  .if X64WIN; pop rax; .endif\r\n  |  je >1\r\n  |  call ->vm_exp_x87\r\n  |  .if X64WIN; push rax; .endif\r\n  |  jmp >7\r\n  |1:\r\n  |  call ->vm_exp2_x87\r\n  |  .if X64WIN; push rax; .endif\r\n  |  jmp >7\r\n  |2: ; cmp fpmop, 7; je >1; ja >2\r\n  |  fldln2; fxch; fyl2x; jmp >7\r\n  |1: ; fld1; fxch; fyl2x; jmp >7\r\n  |2: ; cmp fpmop, 9; je >1; ja >2\r\n  |  fldlg2; fxch; fyl2x; jmp >7\r\n  |1: ; fsin; jmp >7\r\n  |2: ; cmp fpmop, 11; je >1; ja >9\r\n  |   fcos; jmp >7\r\n  |1: ; fptan; fpop\r\n  |7:\r\n  |  .if X64WIN\r\n  |    fstp qword [rsp+8]\t\t// Use scratch area.\r\n  |    movsd xmm0, qword [rsp+8]\r\n  |  .else\r\n  |    fstp qword [rsp-8]\t\t// Use red zone.\r\n  |    movsd xmm0, qword [rsp-8]\r\n  |  .endif\r\n  |  ret\r\n  |.else  // x86 calling convention.\r\n  |  .define fpmop, eax\r\n  |.if SSE\r\n  |  mov fpmop, [esp+12]\r\n  |  movsd xmm0, qword [esp+4]\r\n  |  cmp fpmop, 1; je >1; ja >2\r\n  |  call ->vm_floor; jmp >7\r\n  |1: ; call ->vm_ceil; jmp >7\r\n  |2: ; cmp fpmop, 3; je >1; ja >2\r\n  |  call ->vm_trunc; jmp >7\r\n  |1:\r\n  |  sqrtsd xmm0, xmm0\r\n  |7:\r\n  |  movsd qword [esp+4], xmm0\t// Overwrite callee-owned args.\r\n  |  fld qword [esp+4]\r\n  |  ret\r\n  |2: ; fld qword [esp+4]\r\n  |  cmp fpmop, 5; jb ->vm_exp_x87; je ->vm_exp2_x87\r\n  |2: ; cmp fpmop, 7; je >1; ja >2\r\n  |  fldln2; fxch; fyl2x; ret\r\n  |1: ; fld1; fxch; fyl2x; ret\r\n  |2: ; cmp fpmop, 9; je >1; ja >2\r\n  |  fldlg2; fxch; fyl2x; ret\r\n  |1: ; fsin; ret\r\n  |2: ; cmp fpmop, 11; je >1; ja >9\r\n  |   fcos; ret\r\n  |1: ; fptan; fpop; ret\r\n  |.else\r\n  |  mov fpmop, [esp+12]\r\n  |  fld qword [esp+4]\r\n  |  cmp fpmop, 1; jb ->vm_floor; je ->vm_ceil\r\n  |  cmp fpmop, 3; jb ->vm_trunc; ja >2\r\n  |  fsqrt; ret\r\n  |2: ; cmp fpmop, 5; jb ->vm_exp_x87; je ->vm_exp2_x87\r\n  |  cmp fpmop, 7; je >1; ja >2\r\n  |  fldln2; fxch; fyl2x; ret\r\n  |1: ; fld1; fxch; fyl2x; ret\r\n  |2: ; cmp fpmop, 9; je >1; ja >2\r\n  |  fldlg2; fxch; fyl2x; ret\r\n  |1: ; fsin; ret\r\n  |2: ; cmp fpmop, 11; je >1; ja >9\r\n  |   fcos; ret\r\n  |1: ; fptan; fpop; ret\r\n  |.endif\r\n  |.endif\r\n  |9: ; int3\t\t\t\t\t// Bad fpm.\r\n  |.endif\r\n  |\r\n  |// Callable from C: double lj_vm_foldarith(double x, double y, int op)\r\n  |// Compute x op y for basic arithmetic operators (+ - * / % ^ and unary -)\r\n  |// and basic math functions. ORDER ARITH\r\n  |->vm_foldarith:\r\n  |.if X64\r\n  |\r\n  |  .if X64WIN\r\n  |    .define foldop, CARG3d\r\n  |  .else\r\n  |    .define foldop, CARG1d\r\n  |  .endif\r\n  |  cmp foldop, 1; je >1; ja >2\r\n  |  addsd xmm0, xmm1; ret\r\n  |1: ; subsd xmm0, xmm1; ret\r\n  |2: ; cmp foldop, 3; je >1; ja >2\r\n  |  mulsd xmm0, xmm1; ret\r\n  |1: ; divsd xmm0, xmm1; ret\r\n  |2: ; cmp foldop, 5; jb ->vm_mod; je ->vm_pow\r\n  |  cmp foldop, 7; je >1; ja >2\r\n  |  sseconst_sign xmm1, RDa; xorps xmm0, xmm1; ret\r\n  |1: ; sseconst_abs xmm1, RDa; andps xmm0, xmm1; ret\r\n  |2: ; cmp foldop, 9; ja >2\r\n  |.if X64WIN\r\n  |  movsd qword [rsp+8], xmm0\t// Use scratch area.\r\n  |  movsd qword [rsp+16], xmm1\r\n  |  fld qword [rsp+8]\r\n  |  fld qword [rsp+16]\r\n  |.else\r\n  |  movsd qword [rsp-8], xmm0\t// Use red zone.\r\n  |  movsd qword [rsp-16], xmm1\r\n  |  fld qword [rsp-8]\r\n  |  fld qword [rsp-16]\r\n  |.endif\r\n  |  je >1\r\n  |  fpatan\r\n  |7:\r\n  |.if X64WIN\r\n  |  fstp qword [rsp+8]\t\t// Use scratch area.\r\n  |  movsd xmm0, qword [rsp+8]\r\n  |.else\r\n  |  fstp qword [rsp-8]\t\t// Use red zone.\r\n  |  movsd xmm0, qword [rsp-8]\r\n  |.endif\r\n  |  ret\r\n  |1: ; fxch; fscale; fpop1; jmp <7\r\n  |2: ; cmp foldop, 11; je >1; ja >9\r\n  |  minsd xmm0, xmm1; ret\r\n  |1: ; maxsd xmm0, xmm1; ret\r\n  |9: ; int3\t\t\t\t// Bad op.\r\n  |\r\n  |.elif SSE  // x86 calling convention with SSE ops.\r\n  |\r\n  |  .define foldop, eax\r\n  |  mov foldop, [esp+20]\r\n  |  movsd xmm0, qword [esp+4]\r\n  |  movsd xmm1, qword [esp+12]\r\n  |  cmp foldop, 1; je >1; ja >2\r\n  |  addsd xmm0, xmm1\r\n  |7:\r\n  |  movsd qword [esp+4], xmm0\t// Overwrite callee-owned args.\r\n  |  fld qword [esp+4]\r\n  |  ret\r\n  |1: ; subsd xmm0, xmm1; jmp <7\r\n  |2: ; cmp foldop, 3; je >1; ja >2\r\n  |  mulsd xmm0, xmm1; jmp <7\r\n  |1: ; divsd xmm0, xmm1; jmp <7\r\n  |2: ; cmp foldop, 5\r\n  |  je >1; ja >2\r\n  |  call ->vm_mod; jmp <7\r\n  |1: ; pop edx; call ->vm_pow; push edx; jmp <7  // Writes to scratch area.\r\n  |2: ; cmp foldop, 7; je >1; ja >2\r\n  |  sseconst_sign xmm1, RDa; xorps xmm0, xmm1; jmp <7\r\n  |1: ; sseconst_abs xmm1, RDa; andps xmm0, xmm1; jmp <7\r\n  |2: ; cmp foldop, 9; ja >2\r\n  |  fld qword [esp+4]\t\t// Reload from stack\r\n  |  fld qword [esp+12]\r\n  |  je >1\r\n  |  fpatan; ret\r\n  |1: ; fxch; fscale; fpop1; ret\r\n  |2: ; cmp foldop, 11; je >1; ja >9\r\n  |  minsd xmm0, xmm1; jmp <7\r\n  |1: ; maxsd xmm0, xmm1; jmp <7\r\n  |9: ; int3\t\t\t\t// Bad op.\r\n  |\r\n  |.else  // x86 calling convention with x87 ops.\r\n  |\r\n  |  mov eax, [esp+20]\r\n  |  fld qword [esp+4]\r\n  |  fld qword [esp+12]\r\n  |  cmp eax, 1; je >1; ja >2\r\n  |  faddp st1; ret\r\n  |1: ; fsubp st1; ret\r\n  |2: ; cmp eax, 3; je >1; ja >2\r\n  |  fmulp st1; ret\r\n  |1: ; fdivp st1; ret\r\n  |2: ; cmp eax, 5; jb ->vm_mod; je ->vm_pow\r\n  |  cmp eax, 7; je >1; ja >2\r\n  |  fpop; fchs; ret\r\n  |1: ; fpop; fabs; ret\r\n  |2: ; cmp eax, 9; je >1; ja >2\r\n  |  fpatan; ret\r\n  |1: ; fxch; fscale; fpop1; ret\r\n  |2: ; cmp eax, 11; je >1; ja >9\r\n  |  fucomi st1; fcmovnbe st1; fpop1; ret\r\n  |1: ; fucomi st1; fcmovbe st1; fpop1; ret\r\n  |9: ; int3\t\t\t\t// Bad op.\r\n  |\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// int lj_vm_cpuid(uint32_t f, uint32_t res[4])\r\n  |->vm_cpuid:\r\n  |.if X64\r\n  |  mov eax, CARG1d\r\n  |  .if X64WIN; push rsi; mov rsi, CARG2; .endif\r\n  |  push rbx\r\n  |  cpuid\r\n  |  mov [rsi], eax\r\n  |  mov [rsi+4], ebx\r\n  |  mov [rsi+8], ecx\r\n  |  mov [rsi+12], edx\r\n  |  pop rbx\r\n  |  .if X64WIN; pop rsi; .endif\r\n  |  ret\r\n  |.else\r\n  |  pushfd\r\n  |  pop edx\r\n  |  mov ecx, edx\r\n  |  xor edx, 0x00200000\t\t// Toggle ID bit in flags.\r\n  |  push edx\r\n  |  popfd\r\n  |  pushfd\r\n  |  pop edx\r\n  |  xor eax, eax\t\t\t// Zero means no features supported.\r\n  |  cmp ecx, edx\r\n  |  jz >1\t\t\t\t// No ID toggle means no CPUID support.\r\n  |  mov eax, [esp+4]\t\t\t// Argument 1 is function number.\r\n  |  push edi\r\n  |  push ebx\r\n  |  cpuid\r\n  |  mov edi, [esp+16]\t\t\t// Argument 2 is result area.\r\n  |  mov [edi], eax\r\n  |  mov [edi+4], ebx\r\n  |  mov [edi+8], ecx\r\n  |  mov [edi+12], edx\r\n  |  pop ebx\r\n  |  pop edi\r\n  |1:\r\n  |  ret\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Assertions ---------------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->assert_bad_for_arg_type:\r\n#ifdef LUA_USE_ASSERT\r\n  |  int3\r\n#endif\r\n  |  int3\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in ah/al.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |.if not X64\r\n  |  sub esp, 16\t\t\t// Leave room for SAVE_ERRF etc.\r\n  |.endif\r\n  |  saveregs_\t// ebp/rbp already saved. ebp now holds global_State *.\r\n  |  lea DISPATCH, [ebp+GG_G2DISP]\r\n  |  mov CTSTATE, GL:ebp->ctype_state\r\n  |  movzx eax, ax\r\n  |  mov CTSTATE->cb.slot, eax\r\n  |.if X64\r\n  |  mov CTSTATE->cb.gpr[0], CARG1\r\n  |  mov CTSTATE->cb.gpr[1], CARG2\r\n  |  mov CTSTATE->cb.gpr[2], CARG3\r\n  |  mov CTSTATE->cb.gpr[3], CARG4\r\n  |  movsd qword CTSTATE->cb.fpr[0], xmm0\r\n  |  movsd qword CTSTATE->cb.fpr[1], xmm1\r\n  |  movsd qword CTSTATE->cb.fpr[2], xmm2\r\n  |  movsd qword CTSTATE->cb.fpr[3], xmm3\r\n  |.if X64WIN\r\n  |  lea rax, [rsp+CFRAME_SIZE+4*8]\r\n  |.else\r\n  |  lea rax, [rsp+CFRAME_SIZE]\r\n  |  mov CTSTATE->cb.gpr[4], CARG5\r\n  |  mov CTSTATE->cb.gpr[5], CARG6\r\n  |  movsd qword CTSTATE->cb.fpr[4], xmm4\r\n  |  movsd qword CTSTATE->cb.fpr[5], xmm5\r\n  |  movsd qword CTSTATE->cb.fpr[6], xmm6\r\n  |  movsd qword CTSTATE->cb.fpr[7], xmm7\r\n  |.endif\r\n  |  mov CTSTATE->cb.stack, rax\r\n  |  mov CARG2, rsp\r\n  |.else\r\n  |  lea eax, [esp+CFRAME_SIZE+16]\r\n  |  mov CTSTATE->cb.gpr[0], FCARG1\r\n  |  mov CTSTATE->cb.gpr[1], FCARG2\r\n  |  mov CTSTATE->cb.stack, eax\r\n  |  mov FCARG1, [esp+CFRAME_SIZE+12]\t// Move around misplaced retaddr/ebp.\r\n  |  mov FCARG2, [esp+CFRAME_SIZE+8]\r\n  |  mov SAVE_RET, FCARG1\r\n  |  mov SAVE_R4, FCARG2\r\n  |  mov FCARG2, esp\r\n  |.endif\r\n  |  mov SAVE_PC, CTSTATE\t\t// Any value outside of bytecode is ok.\r\n  |  mov FCARG1, CTSTATE\r\n  |  call extern lj_ccallback_enter@8\t// (CTState *cts, void *cf)\r\n  |  // lua_State * returned in eax (RD).\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RD->base\r\n  |  mov RD, L:RD->top\r\n  |  sub RD, BASE\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  shr RD, 3\r\n  |  add RD, 1\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  mov L:RA, SAVE_L\r\n  |  mov CTSTATE, [DISPATCH+DISPATCH_GL(ctype_state)]\r\n  |  mov aword CTSTATE->L, L:RAa\r\n  |  mov L:RA->base, BASE\r\n  |  mov L:RA->top, RB\r\n  |  mov FCARG1, CTSTATE\r\n  |  mov FCARG2, RC\r\n  |  call extern lj_ccallback_leave@8\t// (CTState *cts, TValue *o)\r\n  |.if X64\r\n  |  mov rax, CTSTATE->cb.gpr[0]\r\n  |  movsd xmm0, qword CTSTATE->cb.fpr[0]\r\n  |  jmp ->vm_leave_unw\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov eax, CTSTATE->cb.gpr[0]\r\n  |  mov edx, CTSTATE->cb.gpr[1]\r\n  |  cmp dword CTSTATE->cb.gpr[2], 1\r\n  |  jb >7\r\n  |  je >6\r\n  |  fld qword CTSTATE->cb.fpr[0].d\r\n  |  jmp >7\r\n  |6:\r\n  |  fld dword CTSTATE->cb.fpr[0].f\r\n  |7:\r\n  |  mov ecx, L:RB->top\r\n  |  movzx ecx, word [ecx+6]\t\t// Get stack adjustment and copy up.\r\n  |  mov SAVE_L, ecx\t\t\t// Must be one slot above SAVE_RET\r\n  |  restoreregs\r\n  |  pop ecx\t\t\t\t// Move return addr from SAVE_RET.\r\n  |  add esp, [esp]\t\t\t// Adjust stack.\r\n  |  add esp, 16\r\n  |  push ecx\r\n  |  ret\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call@4:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |.if X64\r\n  |  .type CCSTATE, CCallState, rbx\r\n  |  push rbp; mov rbp, rsp; push rbx; mov CCSTATE, CARG1\r\n  |.else\r\n  |  .type CCSTATE, CCallState, ebx\r\n  |  push ebp; mov ebp, esp; push ebx; mov CCSTATE, FCARG1\r\n  |.endif\r\n  |\r\n  |  // Readjust stack.\r\n  |.if X64\r\n  |  mov eax, CCSTATE->spadj\r\n  |  sub rsp, rax\r\n  |.else\r\n  |  sub esp, CCSTATE->spadj\r\n  |.if WIN\r\n  |  mov CCSTATE->spadj, esp\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |  // Copy stack slots.\r\n  |  movzx ecx, byte CCSTATE->nsp\r\n  |  sub ecx, 1\r\n  |  js >2\r\n  |1:\r\n  |.if X64\r\n  |  mov rax, [CCSTATE+rcx*8+offsetof(CCallState, stack)]\r\n  |  mov [rsp+rcx*8+CCALL_SPS_EXTRA*8], rax\r\n  |.else\r\n  |  mov eax, [CCSTATE+ecx*4+offsetof(CCallState, stack)]\r\n  |  mov [esp+ecx*4], eax\r\n  |.endif\r\n  |  sub ecx, 1\r\n  |  jns <1\r\n  |2:\r\n  |\r\n  |.if X64\r\n  |  movzx eax, byte CCSTATE->nfpr\r\n  |  mov CARG1, CCSTATE->gpr[0]\r\n  |  mov CARG2, CCSTATE->gpr[1]\r\n  |  mov CARG3, CCSTATE->gpr[2]\r\n  |  mov CARG4, CCSTATE->gpr[3]\r\n  |.if not X64WIN\r\n  |  mov CARG5, CCSTATE->gpr[4]\r\n  |  mov CARG6, CCSTATE->gpr[5]\r\n  |.endif\r\n  |  test eax, eax; jz >5\r\n  |  movaps xmm0, CCSTATE->fpr[0]\r\n  |  movaps xmm1, CCSTATE->fpr[1]\r\n  |  movaps xmm2, CCSTATE->fpr[2]\r\n  |  movaps xmm3, CCSTATE->fpr[3]\r\n  |.if not X64WIN\r\n  |  cmp eax, 4; jbe >5\r\n  |  movaps xmm4, CCSTATE->fpr[4]\r\n  |  movaps xmm5, CCSTATE->fpr[5]\r\n  |  movaps xmm6, CCSTATE->fpr[6]\r\n  |  movaps xmm7, CCSTATE->fpr[7]\r\n  |.endif\r\n  |5:\r\n  |.else\r\n  |  mov FCARG1, CCSTATE->gpr[0]\r\n  |  mov FCARG2, CCSTATE->gpr[1]\r\n  |.endif\r\n  |\r\n  |  call aword CCSTATE->func\r\n  |\r\n  |.if X64\r\n  |  mov CCSTATE->gpr[0], rax\r\n  |  movaps CCSTATE->fpr[0], xmm0\r\n  |.if not X64WIN\r\n  |  mov CCSTATE->gpr[1], rdx\r\n  |  movaps CCSTATE->fpr[1], xmm1\r\n  |.endif\r\n  |.else\r\n  |  mov CCSTATE->gpr[0], eax\r\n  |  mov CCSTATE->gpr[1], edx\r\n  |  cmp byte CCSTATE->resx87, 1\r\n  |  jb >7\r\n  |  je >6\r\n  |  fstp qword CCSTATE->fpr[0].d[0]\r\n  |  jmp >7\r\n  |6:\r\n  |  fstp dword CCSTATE->fpr[0].f[0]\r\n  |7:\r\n  |.if WIN\r\n  |  sub CCSTATE->spadj, esp\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |.if X64\r\n  |  mov rbx, [rbp-8]; leave; ret\r\n  |.else\r\n  |  mov ebx, [ebp-4]; leave; ret\r\n  |.endif\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |// Note: aligning all instructions does not pay off.\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  |.macro jmp_comp, lt, ge, le, gt, target\r\n  ||switch (op) {\r\n  ||case BC_ISLT:\r\n  |   lt target\r\n  ||break;\r\n  ||case BC_ISGE:\r\n  |   ge target\r\n  ||break;\r\n  ||case BC_ISLE:\r\n  |   le target\r\n  ||break;\r\n  ||case BC_ISGT:\r\n  |   gt target\r\n  ||break;\r\n  ||default: break;  /* Shut up GCC. */\r\n  ||}\r\n  |.endmacro\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1, RD = src2, JMP with RD = target\r\n    |  ins_AD\r\n    |.if DUALNUM\r\n    |  checkint RA, >7\r\n    |  checkint RD, >8\r\n    |  mov RB, dword [BASE+RA*8]\r\n    |  add PC, 4\r\n    |  cmp RB, dword [BASE+RD*8]\r\n    |  jmp_comp jge, jl, jg, jle, >9\r\n    |6:\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is a number.\r\n    |  cmp dword [BASE+RD*8+4], LJ_TISNUM; jb >1; jne ->vmeta_comp\r\n    |  // RA is a number, RD is an integer.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm0, dword [BASE+RD*8]\r\n    |  jmp >2\r\n    |.else\r\n    |  fld qword [BASE+RA*8]\r\n    |  fild dword [BASE+RD*8]\r\n    |  jmp >3\r\n    |.endif\r\n    |\r\n    |8:  // RA is an integer, RD is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is an integer, RD is a number.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm1, dword [BASE+RA*8]\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |  add PC, 4\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp_comp jbe, ja, jb, jae, <9\r\n    |  jmp <6\r\n    |.else\r\n    |  fild dword [BASE+RA*8]\r\n    |  jmp >2\r\n    |.endif\r\n    |.else\r\n    |  checknum RA, ->vmeta_comp\r\n    |  checknum RD, ->vmeta_comp\r\n    |.endif\r\n    |.if SSE\r\n    |1:\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |2:\r\n    |  add PC, 4\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |3:\r\n    |.else\r\n    |1:\r\n    |  fld qword [BASE+RA*8]\t\t// Reverse order, i.e like cmp D, A.\r\n    |2:\r\n    |  fld qword [BASE+RD*8]\r\n    |3:\r\n    |  add PC, 4\r\n    |  fcomparepp\r\n    |.endif\r\n    |  // Unordered: all of ZF CF PF set, ordered: PF clear.\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    |.if DUALNUM\r\n    |  jmp_comp jbe, ja, jb, jae, <9\r\n    |  jmp <6\r\n    |.else\r\n    |  jmp_comp jbe, ja, jb, jae, >1\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  ins_AD\t// RA = src1, RD = src2, JMP with RD = target\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  add PC, 4\r\n    |.if DUALNUM\r\n    |  cmp RB, LJ_TISNUM; jne >7\r\n    |  checkint RA, >8\r\n    |  mov RB, dword [BASE+RD*8]\r\n    |  cmp RB, dword [BASE+RA*8]\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RD is not an integer.\r\n    |  ja >5\r\n    |  // RD is a number.\r\n    |  cmp dword [BASE+RA*8+4], LJ_TISNUM; jb >1; jne >5\r\n    |  // RD is a number, RA is an integer.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm0, dword [BASE+RA*8]\r\n    |.else\r\n    |  fild dword [BASE+RA*8]\r\n    |.endif\r\n    |  jmp >2\r\n    |\r\n    |8:  // RD is an integer, RA is not an integer.\r\n    |  ja >5\r\n    |  // RD is an integer, RA is a number.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm0, dword [BASE+RD*8]\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |.else\r\n    |  fild dword [BASE+RD*8]\r\n    |  fld qword [BASE+RA*8]\r\n    |.endif\r\n    |  jmp >4\r\n    |\r\n    |.else\r\n    |  cmp RB, LJ_TISNUM; jae >5\r\n    |  checknum RA, >5\r\n    |.endif\r\n    |.if SSE\r\n    |1:\r\n    |  movsd xmm0, qword [BASE+RA*8]\r\n    |2:\r\n    |  ucomisd xmm0, qword [BASE+RD*8]\r\n    |4:\r\n    |.else\r\n    |1:\r\n    |  fld qword [BASE+RA*8]\r\n    |2:\r\n    |  fld qword [BASE+RD*8]\r\n    |4:\r\n    |  fcomparepp\r\n    |.endif\r\n  iseqne_fp:\r\n    if (vk) {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  jne >2\r\n    } else {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  je >1\r\n    }\r\n  iseqne_end:\r\n    if (vk) {\r\n      |1:\t\t\t\t// EQ: Branch to the target.\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\t\t\t\t// NE: Fallthrough to next instruction.\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n    } else {\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n      |2:\t\t\t\t// NE: Branch to the target.\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |1:\t\t\t\t// EQ: Fallthrough to next instruction.\r\n    }\r\n    if (LJ_DUALNUM && (op == BC_ISEQV || op == BC_ISNEV ||\r\n\t\t       op == BC_ISEQN || op == BC_ISNEN)) {\r\n      |  jmp <9\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    if (op == BC_ISEQV || op == BC_ISNEV) {\r\n      |5:  // Either or both types are not numbers.\r\n      |.if FFI\r\n      |  cmp RB, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  checktp RA, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |.endif\r\n      |  checktp RA, RB\t\t\t// Compare types.\r\n      |  jne <2\t\t\t\t// Not the same type?\r\n      |  cmp RB, LJ_TISPRI\r\n      |  jae <1\t\t\t\t// Same type and primitive type?\r\n      |\r\n      |  // Same types and not a primitive type. Compare GCobj or pvalue.\r\n      |  mov RA, [BASE+RA*8]\r\n      |  mov RD, [BASE+RD*8]\r\n      |  cmp RA, RD\r\n      |  je <1\t\t\t\t// Same GCobjs or pvalues?\r\n      |  cmp RB, LJ_TISTABUD\r\n      |  ja <2\t\t\t\t// Different objects and not table/ud?\r\n      |.if X64\r\n      |  cmp RB, LJ_TUDATA\t\t// And not 64 bit lightuserdata.\r\n      |  jb <2\r\n      |.endif\r\n      |\r\n      |  // Different tables or userdatas. Need to check __eq metamethod.\r\n      |  // Field metatable must be at same offset for GCtab and GCudata!\r\n      |  mov TAB:RB, TAB:RA->metatable\r\n      |  test TAB:RB, TAB:RB\r\n      |  jz <2\t\t\t\t// No metatable?\r\n      |  test byte TAB:RB->nomm, 1<<MM_eq\r\n      |  jnz <2\t\t\t\t// Or 'no __eq' flag set?\r\n      if (vk) {\r\n\t|  xor RB, RB\t\t\t// ne = 0\r\n      } else {\r\n\t|  mov RB, 1\t\t\t// ne = 1\r\n      }\r\n      |  jmp ->vmeta_equal\t\t// Handle __eq metamethod.\r\n    } else {\r\n      |.if FFI\r\n      |3:\r\n      |  cmp RB, LJ_TCDATA\r\n      if (LJ_DUALNUM && vk) {\r\n\t|  jne <9\r\n      } else {\r\n\t|  jne <2\r\n      }\r\n      |  jmp ->vmeta_equal_cd\r\n      |.endif\r\n    }\r\n    break;\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  ins_AND\t// RA = src, RD = str const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, LJ_TSTR; jne >3\r\n    |  mov RA, [BASE+RA*8]\r\n    |  cmp RA, [KBASE+RD*4]\r\n  iseqne_test:\r\n    if (vk) {\r\n      |  jne >2\r\n    } else {\r\n      |  je >1\r\n    }\r\n    goto iseqne_end;\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  ins_AD\t// RA = src, RD = num const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |.if DUALNUM\r\n    |  cmp RB, LJ_TISNUM; jne >7\r\n    |  cmp dword [KBASE+RD*8+4], LJ_TISNUM; jne >8\r\n    |  mov RB, dword [KBASE+RD*8]\r\n    |  cmp RB, dword [BASE+RA*8]\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja >3\r\n    |  // RA is a number.\r\n    |  cmp dword [KBASE+RD*8+4], LJ_TISNUM; jb >1\r\n    |  // RA is a number, RD is an integer.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm0, dword [KBASE+RD*8]\r\n    |.else\r\n    |  fild dword [KBASE+RD*8]\r\n    |.endif\r\n    |  jmp >2\r\n    |\r\n    |8:  // RA is an integer, RD is a number.\r\n    |.if SSE\r\n    |  cvtsi2sd xmm0, dword [BASE+RA*8]\r\n    |  ucomisd xmm0, qword [KBASE+RD*8]\r\n    |.else\r\n    |  fild dword [BASE+RA*8]\r\n    |  fld qword [KBASE+RD*8]\r\n    |.endif\r\n    |  jmp >4\r\n    |.else\r\n    |  cmp RB, LJ_TISNUM; jae >3\r\n    |.endif\r\n    |.if SSE\r\n    |1:\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |2:\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |4:\r\n    |.else\r\n    |1:\r\n    |  fld qword [KBASE+RD*8]\r\n    |2:\r\n    |  fld qword [BASE+RA*8]\r\n    |4:\r\n    |  fcomparepp\r\n    |.endif\r\n    goto iseqne_fp;\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  ins_AND\t// RA = src, RD = primitive type (~), JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, RD\r\n    if (!LJ_HASFFI) goto iseqne_test;\r\n    if (vk) {\r\n      |  jne >3\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n      |3:\r\n      |  cmp RB, LJ_TCDATA; jne <2\r\n      |  jmp ->vmeta_equal_cd\r\n    } else {\r\n      |  je >2\r\n      |  cmp RB, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n    }\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  ins_AD\t// RA = dst or unused, RD = src, JMP with RD = target\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, LJ_TISTRUECOND\r\n    if (op == BC_IST || op == BC_ISTC) {\r\n      |  jae >1\r\n    } else {\r\n      |  jb >1\r\n    }\r\n    if (op == BC_ISTC || op == BC_ISFC) {\r\n      |  mov [BASE+RA*8+4], RB\r\n      |  mov RB, [BASE+RD*8]\r\n      |  mov [BASE+RA*8], RB\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |1:\t\t\t\t\t// Fallthrough to the next instruction.\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |.if X64\r\n    |  mov RBa, [BASE+RD*8]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  mov RD, [BASE+RD*8]\r\n    |  mov [BASE+RA*8+4], RB\r\n    |  mov [BASE+RA*8], RD\r\n    |.endif\r\n    |  ins_next_\r\n    break;\r\n  case BC_NOT:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  xor RB, RB\r\n    |  checktp RD, LJ_TISTRUECOND\r\n    |  adc RB, LJ_TTRUE\r\n    |  mov [BASE+RA*8+4], RB\r\n    |  ins_next\r\n    break;\r\n  case BC_UNM:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |.if DUALNUM\r\n    |  checkint RD, >5\r\n    |  mov RB, [BASE+RD*8]\r\n    |  neg RB\r\n    |  jo >4\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RB\r\n    |9:\r\n    |  ins_next\r\n    |4:\r\n    |  mov dword [BASE+RA*8+4], 0x41e00000  // 2^31.\r\n    |  mov dword [BASE+RA*8], 0\r\n    |  jmp <9\r\n    |5:\r\n    |  ja ->vmeta_unm\r\n    |.else\r\n    |  checknum RD, ->vmeta_unm\r\n    |.endif\r\n    |.if SSE\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |  sseconst_sign xmm1, RDa\r\n    |  xorps xmm0, xmm1\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fld qword [BASE+RD*8]\r\n    |  fchs\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |.if DUALNUM\r\n    |  jmp <9\r\n    |.else\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_LEN:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  checkstr RD, >2\r\n    |  mov STR:RD, [BASE+RD*8]\r\n    |.if DUALNUM\r\n    |  mov RD, dword STR:RD->len\r\n    |1:\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RD\r\n    |.elif SSE\r\n    |  xorps xmm0, xmm0\r\n    |  cvtsi2sd xmm0, dword STR:RD->len\r\n    |1:\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fild dword STR:RD->len\r\n    |1:\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |  ins_next\r\n    |2:\r\n    |  checktab RD, ->vmeta_len\r\n    |  mov TAB:FCARG1, [BASE+RD*8]\r\n#if LJ_52\r\n    |  mov TAB:RB, TAB:FCARG1->metatable\r\n    |  cmp TAB:RB, 0\r\n    |  jnz >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |  call extern lj_tab_len@4\t\t// (GCtab *t)\r\n    |  // Length of table returned in eax (RD).\r\n    |.if DUALNUM\r\n    |  // Nothing to do.\r\n    |.elif SSE\r\n    |  cvtsi2sd xmm0, RD\r\n    |.else\r\n    |  mov ARG1, RD\r\n    |  fild ARG1\r\n    |.endif\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  movzx RA, PC_RA\r\n    |  jmp <1\r\n#if LJ_52\r\n    |9:  // Check for __len.\r\n    |  test byte TAB:RB->nomm, 1<<MM_len\r\n    |  jnz <3\r\n    |  jmp ->vmeta_len\t\t\t// 'no __len' flag NOT set: check.\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre, x87ins, sseins, ssereg\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   checknum RB, ->vmeta_arith_vn\r\n    |   .if DUALNUM\r\n    |     cmp dword [KBASE+RC*8+4], LJ_TISNUM; jae ->vmeta_arith_vn\r\n    |   .endif\r\n    |   .if SSE\r\n    |     movsd xmm0, qword [BASE+RB*8]\r\n    |     sseins ssereg, qword [KBASE+RC*8]\r\n    |   .else\r\n    |     fld qword [BASE+RB*8]\r\n    |     x87ins qword [KBASE+RC*8]\r\n    |   .endif\r\n    ||  break;\r\n    ||case 1:\r\n    |   checknum RB, ->vmeta_arith_nv\r\n    |   .if DUALNUM\r\n    |     cmp dword [KBASE+RC*8+4], LJ_TISNUM; jae ->vmeta_arith_nv\r\n    |   .endif\r\n    |   .if SSE\r\n    |     movsd xmm0, qword [KBASE+RC*8]\r\n    |     sseins ssereg, qword [BASE+RB*8]\r\n    |   .else\r\n    |     fld qword [KBASE+RC*8]\r\n    |     x87ins qword [BASE+RB*8]\r\n    |   .endif\r\n    ||  break;\r\n    ||default:\r\n    |   checknum RB, ->vmeta_arith_vv\r\n    |   checknum RC, ->vmeta_arith_vv\r\n    |   .if SSE\r\n    |     movsd xmm0, qword [BASE+RB*8]\r\n    |     sseins ssereg, qword [BASE+RC*8]\r\n    |   .else\r\n    |     fld qword [BASE+RB*8]\r\n    |     x87ins qword [BASE+RC*8]\r\n    |   .endif\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   checkint RB, ->vmeta_arith_vn\r\n    |   cmp dword [KBASE+RC*8+4], LJ_TISNUM; jne ->vmeta_arith_vn\r\n    |   mov RB, [BASE+RB*8]\r\n    |   intins RB, [KBASE+RC*8]; jo ->vmeta_arith_vno\r\n    ||  break;\r\n    ||case 1:\r\n    |   checkint RB, ->vmeta_arith_nv\r\n    |   cmp dword [KBASE+RC*8+4], LJ_TISNUM; jne ->vmeta_arith_nv\r\n    |   mov RC, [KBASE+RC*8]\r\n    |   intins RC, [BASE+RB*8]; jo ->vmeta_arith_nvo\r\n    ||  break;\r\n    ||default:\r\n    |   checkint RB, ->vmeta_arith_vv\r\n    |   checkint RC, ->vmeta_arith_vv\r\n    |   mov RB, [BASE+RB*8]\r\n    |   intins RB, [BASE+RC*8]; jo ->vmeta_arith_vvo\r\n    ||  break;\r\n    ||}\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    ||if (vk == 1) {\r\n    |   mov dword [BASE+RA*8], RC\r\n    ||} else {\r\n    |   mov dword [BASE+RA*8], RB\r\n    ||}\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpost\r\n    |.if SSE\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, x87ins, sseins\r\n    |  ins_arithpre x87ins, sseins, xmm0\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, intins, x87ins, sseins\r\n    |.if DUALNUM\r\n    |  ins_arithdn intins\r\n    |.else\r\n    |  ins_arith, x87ins, sseins\r\n    |.endif\r\n    |.endmacro\r\n\r\n    |  // RA = dst, RB = src1 or num const, RC = src2 or num const\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith add, fadd, addsd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith sub, fsub, subsd\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith imul, fmul, mulsd\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith fdiv, divsd\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arithpre fld, movsd, xmm1\r\n    |->BC_MODVN_Z:\r\n    |  call ->vm_mod\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithpre fld, movsd, xmm1\r\n    |  jmp ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    break;\r\n  case BC_POW:\r\n    |  ins_arithpre fld, movsd, xmm1\r\n    |  call ->vm_pow\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  ins_ABC\t// RA = dst, RB = src_start, RC = src_end\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\r\n    |  lea CARG2d, [BASE+RC*8]\r\n    |  mov CARG3d, RC\r\n    |  sub CARG3d, RB\r\n    |->BC_CAT_Z:\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  lea RA, [BASE+RC*8]\r\n    |  sub RC, RB\r\n    |  mov ARG2, RA\r\n    |  mov ARG3, RC\r\n    |->BC_CAT_Z:\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  test RC, RC\r\n    |  jnz ->vmeta_binop\r\n    |  movzx RB, PC_RB\t\t\t// Copy result to Stk[RA] from Stk[RB].\r\n    |  movzx RA, PC_RA\r\n    |.if X64\r\n    |  mov RCa, [BASE+RB*8]\r\n    |  mov [BASE+RA*8], RCa\r\n    |.else\r\n    |  mov RC, [BASE+RB*8+4]\r\n    |  mov RB, [BASE+RB*8]\r\n    |  mov [BASE+RA*8+4], RC\r\n    |  mov [BASE+RA*8], RB\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov RD, [KBASE+RD*4]\r\n    |  mov dword [BASE+RA*8+4], LJ_TSTR\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  ins_AND\t// RA = dst, RD = cdata const (~)\r\n    |  mov RD, [KBASE+RD*4]\r\n    |  mov dword [BASE+RA*8+4], LJ_TCDATA\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  ins_AD\t// RA = dst, RD = signed int16 literal\r\n    |.if DUALNUM\r\n    |  movsx RD, RDW\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RD\r\n    |.elif SSE\r\n    |  movsx RD, RDW\t\t\t// Sign-extend literal.\r\n    |  cvtsi2sd xmm0, RD\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fild PC_RD\t\t\t// Refetch signed RD from instruction.\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_KNUM:\r\n    |  ins_AD\t// RA = dst, RD = num const\r\n    |.if SSE\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fld qword [KBASE+RD*8]\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_KPRI:\r\n    |  ins_AND\t// RA = dst, RD = primitive type (~)\r\n    |  mov [BASE+RA*8+4], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KNIL:\r\n    |  ins_AD\t// RA = dst_start, RD = dst_end\r\n    |  lea RA, [BASE+RA*8+12]\r\n    |  lea RD, [BASE+RD*8+4]\r\n    |  mov RB, LJ_TNIL\r\n    |  mov [RA-8], RB\t\t\t// Sets minimum 2 slots.\r\n    |1:\r\n    |  mov [RA], RB\r\n    |  add RA, 8\r\n    |  cmp RA, RD\r\n    |  jbe <1\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  ins_AD\t// RA = dst, RD = upvalue #\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RD*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RB, UPVAL:RB->v\r\n    |.if X64\r\n    |  mov RDa, [RB]\r\n    |  mov [BASE+RA*8], RDa\r\n    |.else\r\n    |  mov RD, [RB+4]\r\n    |  mov RB, [RB]\r\n    |  mov [BASE+RA*8+4], RD\r\n    |  mov [BASE+RA*8], RB\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_USETV:\r\n#define TV2MARKOFS \\\r\n ((int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv))\r\n    |  ins_AD\t// RA = upvalue #, RD = src\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  mov RB, UPVAL:RB->v\r\n    |  mov RA, [BASE+RD*8]\r\n    |  mov RD, [BASE+RD*8+4]\r\n    |  mov [RB], RA\r\n    |  mov [RB+4], RD\r\n    |  jz >1\r\n    |  // Check barrier for closed upvalue.\r\n    |  test byte [RB+TV2MARKOFS], LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Upvalue is black. Check if new value is collectable and white.\r\n    |  sub RD, LJ_TISGCV\r\n    |  cmp RD, LJ_TNUMX - LJ_TISGCV\t\t\t// tvisgcv(v)\r\n    |  jbe <1\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(v)\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if X64 and not X64WIN\r\n    |  mov FCARG2, RB\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |.else\r\n    |  xchg FCARG2, RB\t\t\t// Save BASE (FCARG2 == BASE).\r\n    |.endif\r\n    |  lea GL:FCARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv@8\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n#undef TV2MARKOFS\r\n  case BC_USETS:\r\n    |  ins_AND\t// RA = upvalue #, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov GCOBJ:RA, [KBASE+RD*4]\r\n    |  mov RD, UPVAL:RB->v\r\n    |  mov [RD], GCOBJ:RA\r\n    |  mov dword [RD+4], LJ_TSTR\r\n    |  test byte UPVAL:RB->marked, LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(str)\r\n    |  jz <1\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  mov RB, BASE\t\t\t// Save BASE (FCARG2 == BASE).\r\n    |  mov FCARG2, RD\r\n    |  lea GL:FCARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv@8\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n  case BC_USETN:\r\n    |  ins_AD\t// RA = upvalue #, RD = num const\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |.if SSE\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |.else\r\n    |  fld qword [KBASE+RD*8]\r\n    |.endif\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RA, UPVAL:RB->v\r\n    |.if SSE\r\n    |  movsd qword [RA], xmm0\r\n    |.else\r\n    |  fstp qword [RA]\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_USETP:\r\n    |  ins_AND\t// RA = upvalue #, RD = primitive type (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RA, UPVAL:RB->v\r\n    |  mov [RA+4], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_UCLO:\r\n    |  ins_AD\t// RA = level, RD = target\r\n    |  branchPC RD\t\t\t// Do this first to free RD.\r\n    |  mov L:RB, SAVE_L\r\n    |  cmp dword L:RB->openupval, 0\r\n    |  je >1\r\n    |  mov L:RB->base, BASE\r\n    |  lea FCARG2, [BASE+RA*8]\t\t// Caveat: FCARG2 == BASE\r\n    |  mov L:FCARG1, L:RB\t\t// Caveat: FCARG1 == RA\r\n    |  call extern lj_func_closeuv@8\t// (lua_State *L, TValue *level)\r\n    |  mov BASE, L:RB->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  ins_AND\t// RA = dst, RD = proto const (~) (holding function prototype)\r\n    |.if X64\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n    |  mov CARG3d, [BASE-8]\r\n    |  mov CARG2d, [KBASE+RD*4]\t\t// Fetch GCproto *.\r\n    |  mov CARG1d, L:RB\r\n    |.else\r\n    |  mov LFUNC:RA, [BASE-8]\r\n    |  mov PROTO:RD, [KBASE+RD*4]\t// Fetch GCproto *.\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG3, LFUNC:RA\r\n    |  mov ARG2, PROTO:RD\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  call extern lj_func_newL_gc\r\n    |  // GCfuncL * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], LFUNC:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TFUNC\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n    |  ins_AD\t// RA = dst, RD = hbits|asize\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov SAVE_PC, PC\r\n    |  jae >5\r\n    |1:\r\n    |.if X64\r\n    |  mov CARG3d, RD\r\n    |  and RD, 0x7ff\r\n    |  shr CARG3d, 11\r\n    |.else\r\n    |  mov RA, RD\r\n    |  and RD, 0x7ff\r\n    |  shr RA, 11\r\n    |  mov ARG3, RA\r\n    |.endif\r\n    |  cmp RD, 0x7ff\r\n    |  je >3\r\n    |2:\r\n    |.if X64\r\n    |  mov L:CARG1d, L:RB\r\n    |  mov CARG2d, RD\r\n    |.else\r\n    |  mov ARG1, L:RB\r\n    |  mov ARG2, RD\r\n    |.endif\r\n    |  call extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TTAB\r\n    |  ins_next\r\n    |3:  // Turn 0x7ff into 0x801.\r\n    |  mov RD, 0x801\r\n    |  jmp <2\r\n    |5:\r\n    |  mov L:FCARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop@4\t// (lua_State *L)\r\n    |  movzx RD, PC_RD\r\n    |  jmp <1\r\n    break;\r\n  case BC_TDUP:\r\n    |  ins_AND\t// RA = dst, RD = table const (~) (holding template table)\r\n    |  mov L:RB, SAVE_L\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  mov SAVE_PC, PC\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov L:RB->base, BASE\r\n    |  jae >3\r\n    |2:\r\n    |  mov TAB:FCARG2, [KBASE+RD*4]\t// Caveat: FCARG2 == BASE\r\n    |  mov L:FCARG1, L:RB\t\t// Caveat: FCARG1 == RA\r\n    |  call extern lj_tab_dup@8\t\t// (lua_State *L, Table *kt)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TTAB\r\n    |  ins_next\r\n    |3:\r\n    |  mov L:FCARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop@4\t// (lua_State *L)\r\n    |  movzx RD, PC_RD\t\t\t// Need to reload RD.\r\n    |  not RDa\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*4]\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_GSET:\r\n    |  ins_AND\t// RA = src, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*4]\r\n    |  jmp ->BC_TSETS_Z\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = key\r\n    |  checktab RB, ->vmeta_tgetv\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |.if SSE\r\n    |  movsd xmm0, qword [BASE+RC*8]\r\n    |  cvtsd2si RC, xmm0\r\n    |  cvtsi2sd xmm1, RC\r\n    |  ucomisd xmm0, xmm1\r\n    |.else\r\n    |  fld qword [BASE+RC*8]\r\n    |  fist ARG1\r\n    |  fild ARG1\r\n    |  fcomparepp\r\n    |  mov RC, ARG1\r\n    |.endif\r\n    |  jne ->vmeta_tgetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RC, TAB:RB->asize\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tgetv\t\t// Not in array part? Use fallback.\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >2\r\n    |  // Get array slot.\r\n    |.if X64\r\n    |  mov RBa, [RC]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [RC]\r\n    |  mov RC, [RC+4]\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |.endif\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz >3\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetv\t\t\t// 'no __index' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |3:\r\n    |  mov dword [BASE+RA*8+4], LJ_TNIL\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  checkstr RC, ->vmeta_tgetv\r\n    |  mov STR:RC, [BASE+RC*8]\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_TGETS:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = str const (~)\r\n    |  not RCa\r\n    |  mov STR:RC, [KBASE+RC*4]\r\n    |  checktab RB, ->vmeta_tgets\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |->BC_TGETS_Z:\t// RB = GCtab *, RC = GCstr *, refetches PC_RA.\r\n    |  mov RA, TAB:RB->hmask\r\n    |  and RA, STR:RC->hash\r\n    |  imul RA, #NODE\r\n    |  add NODE:RA, TAB:RB->node\r\n    |1:\r\n    |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n    |  jne >4\r\n    |  cmp dword NODE:RA->key.gcr, STR:RC\r\n    |  jne >4\r\n    |  // Ok, key found. Assumes: offsetof(Node, val) == 0\r\n    |  cmp dword [RA+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >5\t\t\t\t// Key found, but nil value?\r\n    |  movzx RC, PC_RA\r\n    |  // Get node value.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  mov [BASE+RC*8], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov RA, [RA+4]\r\n    |  mov [BASE+RC*8], RB\r\n    |  mov [BASE+RC*8+4], RA\r\n    |.endif\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:\r\n    |  movzx RC, PC_RA\r\n    |  mov dword [BASE+RC*8+4], LJ_TNIL\r\n    |  jmp <2\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  mov NODE:RA, NODE:RA->next\r\n    |  test NODE:RA, NODE:RA\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test TAB:RA, TAB:RA\r\n    |  jz <3\t\t\t\t// No metatable: done.\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jnz <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  jmp ->vmeta_tgets\t\t// Caveat: preserve STR:RC.\r\n    break;\r\n  case BC_TGETB:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = byte literal\r\n    |  checktab RB, ->vmeta_tgetb\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tgetb\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >2\r\n    |  // Get array slot.\r\n    |.if X64\r\n    |  mov RBa, [RC]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [RC]\r\n    |  mov RC, [RC+4]\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |.endif\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz >3\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetb\t\t\t// 'no __index' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |3:\r\n    |  mov dword [BASE+RA*8+4], LJ_TNIL\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = key\r\n    |  checktab RB, ->vmeta_tsetv\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |.if SSE\r\n    |  movsd xmm0, qword [BASE+RC*8]\r\n    |  cvtsd2si RC, xmm0\r\n    |  cvtsi2sd xmm1, RC\r\n    |  ucomisd xmm0, xmm1\r\n    |.else\r\n    |  fld qword [BASE+RC*8]\r\n    |  fist ARG1\r\n    |  fild ARG1\r\n    |  fcomparepp\r\n    |  mov RC, ARG1\r\n    |.endif\r\n    |  jne ->vmeta_tsetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RC, TAB:RB->asize\t\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tsetv\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:  // Set array slot.\r\n    |.if X64\r\n    |  mov RBa, [BASE+RA*8]\r\n    |  mov [RC], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  mov RA, [BASE+RA*8]\r\n    |  mov [RC+4], RB\r\n    |  mov [RC], RA\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <1\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetv\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  checkstr RC, ->vmeta_tsetv\r\n    |  mov STR:RC, [BASE+RC*8]\r\n    |  jmp ->BC_TSETS_Z\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RA\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = str const (~)\r\n    |  not RCa\r\n    |  mov STR:RC, [KBASE+RC*4]\r\n    |  checktab RB, ->vmeta_tsets\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |->BC_TSETS_Z:\t// RB = GCtab *, RC = GCstr *, refetches PC_RA.\r\n    |  mov RA, TAB:RB->hmask\r\n    |  and RA, STR:RC->hash\r\n    |  imul RA, #NODE\r\n    |  mov byte TAB:RB->nomm, 0\t\t// Clear metamethod cache.\r\n    |  add NODE:RA, TAB:RB->node\r\n    |1:\r\n    |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n    |  jne >5\r\n    |  cmp dword NODE:RA->key.gcr, STR:RC\r\n    |  jne >5\r\n    |  // Ok, key found. Assumes: offsetof(Node, val) == 0\r\n    |  cmp dword [RA+4], LJ_TNIL\r\n    |  je >4\t\t\t\t// Previous value is nil?\r\n    |2:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |3:  // Set node value.\r\n    |  movzx RC, PC_RA\r\n    |.if X64\r\n    |  mov RBa, [BASE+RC*8]\r\n    |  mov [RA], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RC*8+4]\r\n    |  mov RC, [BASE+RC*8]\r\n    |  mov [RA+4], RB\r\n    |  mov [RA], RC\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <2\r\n    |  mov TMP1, RA\t\t\t// Save RA.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  mov RA, TMP1\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  mov NODE:RA, NODE:RA->next\r\n    |  test NODE:RA, NODE:RA\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test TAB:RA, TAB:RA\r\n    |  jz >6\t\t\t\t// No metatable: continue.\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mov TMP1, STR:RC\r\n    |  mov TMP2, LJ_TSTR\r\n    |  mov TMP3, TAB:RB\t\t\t// Save TAB:RB for us.\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\r\n    |  lea CARG3, TMP1\r\n    |  mov CARG2d, TAB:RB\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  lea RC, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n    |  mov ARG2, TAB:RB\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG3, RC\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_newkey\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Handles write barrier for the new key. TValue * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  mov TAB:RB, TMP3\t\t\t// Need TAB:RB for barrier.\r\n    |  mov RA, eax\r\n    |  jmp <2\t\t\t\t// Must check write barrier for value.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RC\t\t// Destroys STR:RC.\r\n    |  jmp <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = byte literal\r\n    |  checktab RB, ->vmeta_tsetb\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tsetb\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\t // Set array slot.\r\n    |.if X64\r\n    |  mov RAa, [BASE+RA*8]\r\n    |  mov [RC], RAa\r\n    |.else\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  mov RA, [BASE+RA*8]\r\n    |  mov [RC+4], RB\r\n    |  mov [RC], RA\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <1\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetb\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RA\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  ins_AD\t// RA = base (table at base-1), RD = num const (start index)\r\n    |  mov TMP1, KBASE\t\t\t// Need one more free register.\r\n    |  mov KBASE, dword [KBASE+RD*8]\t// Integer constant is in lo-word.\r\n    |1:\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov TAB:RB, [RA-8]\t\t// Guaranteed to be a table.\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\r\n    |  mov RD, MULTRES\r\n    |  sub RD, 1\r\n    |  jz >4\t\t\t\t// Nothing to copy?\r\n    |  add RD, KBASE\t\t\t// Compute needed size.\r\n    |  cmp RD, TAB:RB->asize\r\n    |  ja >5\t\t\t\t// Doesn't fit into array part?\r\n    |  sub RD, KBASE\r\n    |  shl KBASE, 3\r\n    |  add KBASE, TAB:RB->array\r\n    |3:  // Copy result slots to table.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  add RA, 8\r\n    |  mov [KBASE], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov [KBASE], RB\r\n    |  mov RB, [RA+4]\r\n    |  add RA, 8\r\n    |  mov [KBASE+4], RB\r\n    |.endif\r\n    |  add KBASE, 8\r\n    |  sub RD, 1\r\n    |  jnz <3\r\n    |4:\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n    |  mov CARG2d, TAB:RB\r\n    |  mov CARG3d, RD\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  mov ARG2, TAB:RB\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\r\n    |  mov ARG3, RD\r\n    |  mov ARG1, L:RB\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_reasize\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\t\t\t\t// Retry.\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RD\r\n    |  jmp <2\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALL: case BC_CALLM:\r\n    |  ins_A_C\t// RA = base, (RB = nresults+1,) RC = nargs+1 | extra_nargs\r\n    if (op == BC_CALLM) {\r\n      |  add NARGS:RD, MULTRES\r\n    }\r\n    |  cmp dword [BASE+RA*8+4], LJ_TFUNC\r\n    |  mov LFUNC:RB, [BASE+RA*8]\r\n    |  jne ->vmeta_call_ra\r\n    |  lea BASE, [BASE+RA*8+8]\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  ins_AD\t// RA = base, RD = extra_nargs\r\n    |  add NARGS:RD, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows and ins_AD is a no-op.\r\n    break;\r\n  case BC_CALLT:\r\n    |  ins_AD\t// RA = base, RD = nargs+1\r\n    |  lea RA, [BASE+RA*8+8]\r\n    |  mov KBASE, BASE\t\t\t// Use KBASE for move + vmeta_call hint.\r\n    |  mov LFUNC:RB, [RA-8]\r\n    |  cmp dword [RA-4], LJ_TFUNC\r\n    |  jne ->vmeta_call\r\n    |->BC_CALLT_Z:\r\n    |  mov PC, [BASE-4]\r\n    |  test PC, FRAME_TYPE\r\n    |  jnz >7\r\n    |1:\r\n    |  mov [BASE-8], LFUNC:RB\t\t// Copy function down, reloaded below.\r\n    |  mov MULTRES, NARGS:RD\r\n    |  sub NARGS:RD, 1\r\n    |  jz >3\r\n    |2:  // Move args down.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  add RA, 8\r\n    |  mov [KBASE], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov [KBASE], RB\r\n    |  mov RB, [RA+4]\r\n    |  add RA, 8\r\n    |  mov [KBASE+4], RB\r\n    |.endif\r\n    |  add KBASE, 8\r\n    |  sub NARGS:RD, 1\r\n    |  jnz <2\r\n    |\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |3:\r\n    |  mov NARGS:RD, MULTRES\r\n    |  cmp byte LFUNC:RB->ffid, 1\t// (> FF_C) Calling a fast function?\r\n    |  ja >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function.\r\n    |  test PC, FRAME_TYPE\t\t// Lua frame below?\r\n    |  jnz <4\r\n    |  movzx RA, PC_RA\r\n    |  not RAa\r\n    |  mov LFUNC:KBASE, [BASE+RA*8-8]\t// Need to prepare KBASE.\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  jmp <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  sub PC, FRAME_VARG\r\n    |  test PC, FRAME_TYPEP\r\n    |  jnz >8\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, PC\t\t\t// Need to relocate BASE/KBASE down.\r\n    |  mov KBASE, BASE\r\n    |  mov PC, [BASE-4]\r\n    |  jmp <1\r\n    |8:\r\n    |  add PC, FRAME_VARG\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  ins_A\t// RA = base, (RB = nresults+1,) RC = nargs+1 (2+1)\r\n    |  lea RA, [BASE+RA*8+8]\t\t// fb = base+1\r\n    |.if X64\r\n    |  mov RBa, [RA-24]\t\t\t// Copy state. fb[0] = fb[-3].\r\n    |  mov RCa, [RA-16]\t\t\t// Copy control var. fb[1] = fb[-2].\r\n    |  mov [RA], RBa\r\n    |  mov [RA+8], RCa\r\n    |.else\r\n    |  mov RB, [RA-24]\t\t\t// Copy state. fb[0] = fb[-3].\r\n    |  mov RC, [RA-20]\r\n    |  mov [RA], RB\r\n    |  mov [RA+4], RC\r\n    |  mov RB, [RA-16]\t\t\t// Copy control var. fb[1] = fb[-2].\r\n    |  mov RC, [RA-12]\r\n    |  mov [RA+8], RB\r\n    |  mov [RA+12], RC\r\n    |.endif\r\n    |  mov LFUNC:RB, [RA-32]\t\t// Copy callable. fb[-1] = fb[-4]\r\n    |  mov RC, [RA-28]\r\n    |  mov [RA-8], LFUNC:RB\r\n    |  mov [RA-4], RC\r\n    |  cmp RC, LJ_TFUNC\t\t\t// Handle like a regular 2-arg call.\r\n    |  mov NARGS:RD, 2+1\r\n    |  jne ->vmeta_call\r\n    |  mov BASE, RA\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  ins_A\t// RA = base, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  mov TMP1, KBASE\t\t\t// Need two more free registers.\r\n    |  mov TMP2, DISPATCH\r\n    |  mov TAB:RB, [BASE+RA*8-16]\r\n    |  mov RC, [BASE+RA*8-8]\t\t// Get index from control var.\r\n    |  mov DISPATCH, TAB:RB->asize\r\n    |  add PC, 4\r\n    |  mov KBASE, TAB:RB->array\r\n    |1:  // Traverse array part.\r\n    |  cmp RC, DISPATCH; jae >5\t\t// Index points after array part?\r\n    |  cmp dword [KBASE+RC*8+4], LJ_TNIL; je >4\r\n    |.if DUALNUM\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RC\r\n    |.elif SSE\r\n    |  cvtsi2sd xmm0, RC\r\n    |.else\r\n    |  fild dword [BASE+RA*8-8]\r\n    |.endif\r\n    |  // Copy array slot to returned value.\r\n    |.if X64\r\n    |  mov RBa, [KBASE+RC*8]\r\n    |  mov [BASE+RA*8+8], RBa\r\n    |.else\r\n    |  mov RB, [KBASE+RC*8+4]\r\n    |  mov [BASE+RA*8+12], RB\r\n    |  mov RB, [KBASE+RC*8]\r\n    |  mov [BASE+RA*8+8], RB\r\n    |.endif\r\n    |  add RC, 1\r\n    |  // Return array index as a numeric key.\r\n    |.if DUALNUM\r\n    |  // See above.\r\n    |.elif SSE\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.else\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |  mov [BASE+RA*8-8], RC\t\t// Update control var.\r\n    |2:\r\n    |  movzx RD, PC_RD\t\t\t// Get target from ITERL.\r\n    |  branchPC RD\r\n    |3:\r\n    |  mov DISPATCH, TMP2\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  add RC, 1\r\n    |.if not (DUALNUM or SSE)\r\n    |  mov [BASE+RA*8-8], RC\r\n    |.endif\r\n    |  jmp <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  sub RC, DISPATCH\r\n    |6:\r\n    |  cmp RC, TAB:RB->hmask; ja <3\t// End of iteration? Branch to ITERL+1.\r\n    |  imul KBASE, RC, #NODE\r\n    |  add NODE:KBASE, TAB:RB->node\r\n    |  cmp dword NODE:KBASE->val.it, LJ_TNIL; je >7\r\n    |  lea DISPATCH, [RC+DISPATCH+1]\r\n    |  // Copy key and value from hash slot.\r\n    |.if X64\r\n    |  mov RBa, NODE:KBASE->key\r\n    |  mov RCa, NODE:KBASE->val\r\n    |  mov [BASE+RA*8], RBa\r\n    |  mov [BASE+RA*8+8], RCa\r\n    |.else\r\n    |  mov RB, NODE:KBASE->key.gcr\r\n    |  mov RC, NODE:KBASE->key.it\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |  mov RB, NODE:KBASE->val.gcr\r\n    |  mov RC, NODE:KBASE->val.it\r\n    |  mov [BASE+RA*8+8], RB\r\n    |  mov [BASE+RA*8+12], RC\r\n    |.endif\r\n    |  mov [BASE+RA*8-8], DISPATCH\r\n    |  jmp <2\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  add RC, 1\r\n    |  jmp <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  ins_AD\t// RA = base, RD = target (points to ITERN)\r\n    |  cmp dword [BASE+RA*8-20], LJ_TFUNC; jne >5\r\n    |  mov CFUNC:RB, [BASE+RA*8-24]\r\n    |  cmp dword [BASE+RA*8-12], LJ_TTAB; jne >5\r\n    |  cmp dword [BASE+RA*8-4], LJ_TNIL; jne >5\r\n    |  cmp byte CFUNC:RB->ffid, FF_next_N; jne >5\r\n    |  branchPC RD\r\n    |  mov dword [BASE+RA*8-8], 0\t// Initialize control var.\r\n    |  mov dword [BASE+RA*8-4], 0xfffe7fff\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov PC_OP, BC_JMP\r\n    |  branchPC RD\r\n    |  mov byte [PC], BC_ITERC\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  ins_ABC\t// RA = base, RB = nresults+1, RC = numparams\r\n    |  mov TMP1, KBASE\t\t\t// Need one more free register.\r\n    |  lea KBASE, [BASE+RC*8+(8+FRAME_VARG)]\r\n    |  lea RA, [BASE+RA*8]\r\n    |  sub KBASE, [BASE-4]\r\n    |  // Note: KBASE may now be even _above_ BASE if nargs was < numparams.\r\n    |  test RB, RB\r\n    |  jz >5\t\t\t\t// Copy all varargs?\r\n    |  lea RB, [RA+RB*8-8]\r\n    |  cmp KBASE, BASE\t\t\t// No vararg slots?\r\n    |  jnb >2\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |.if X64\r\n    |  mov RCa, [KBASE-8]\r\n    |  add KBASE, 8\r\n    |  mov [RA], RCa\r\n    |.else\r\n    |  mov RC, [KBASE-8]\r\n    |  mov [RA], RC\r\n    |  mov RC, [KBASE-4]\r\n    |  add KBASE, 8\r\n    |  mov [RA+4], RC\r\n    |.endif\r\n    |  add RA, 8\r\n    |  cmp RA, RB\t\t\t// All destination slots filled?\r\n    |  jnb >3\r\n    |  cmp KBASE, BASE\t\t\t// No more vararg slots?\r\n    |  jb <1\r\n    |2:  // Fill up remainder with nil.\r\n    |  mov dword [RA+4], LJ_TNIL\r\n    |  add RA, 8\r\n    |  cmp RA, RB\r\n    |  jb <2\r\n    |3:\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  mov MULTRES, 1\t\t\t// MULTRES = 0+1\r\n    |  mov RC, BASE\r\n    |  sub RC, KBASE\r\n    |  jbe <3\t\t\t\t// No vararg slots?\r\n    |  mov RB, RC\r\n    |  shr RB, 3\r\n    |  add RB, 1\r\n    |  mov MULTRES, RB\t\t\t// MULTRES = #varargs+1\r\n    |  mov L:RB, SAVE_L\r\n    |  add RC, RA\r\n    |  cmp RC, L:RB->maxstack\r\n    |  ja >7\t\t\t\t// Need to grow stack?\r\n    |6:  // Copy all vararg slots.\r\n    |.if X64\r\n    |  mov RCa, [KBASE-8]\r\n    |  add KBASE, 8\r\n    |  mov [RA], RCa\r\n    |.else\r\n    |  mov RC, [KBASE-8]\r\n    |  mov [RA], RC\r\n    |  mov RC, [KBASE-4]\r\n    |  add KBASE, 8\r\n    |  mov [RA+4], RC\r\n    |.endif\r\n    |  add RA, 8\r\n    |  cmp KBASE, BASE\t\t\t// No more vararg slots?\r\n    |  jb <6\r\n    |  jmp <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mov L:RB->base, BASE\r\n    |  mov L:RB->top, RA\r\n    |  mov SAVE_PC, PC\r\n    |  sub KBASE, BASE\t\t\t// Need delta, because BASE may change.\r\n    |  mov FCARG2, MULTRES\r\n    |  sub FCARG2, 1\r\n    |  mov FCARG1, L:RB\r\n    |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n    |  mov BASE, L:RB->base\r\n    |  mov RA, L:RB->top\r\n    |  add KBASE, BASE\r\n    |  jmp <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  ins_AD\t// RA = results, RD = extra_nresults\r\n    |  add RD, MULTRES\t\t\t// MULTRES >=1, so RD >=1.\r\n    |  // Fall through. Assumes BC_RET follows and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_RET: case BC_RET0: case BC_RET1:\r\n    |  ins_AD\t// RA = results, RD = nresults+1\r\n    if (op != BC_RET0) {\r\n      |  shl RA, 3\r\n    }\r\n    |1:\r\n    |  mov PC, [BASE-4]\r\n    |  mov MULTRES, RD\t\t\t// Save nresults+1.\r\n    |  test PC, FRAME_TYPE\t\t// Check frame type marker.\r\n    |  jnz >7\t\t\t\t// Not returning to a fixarg Lua func?\r\n    switch (op) {\r\n    case BC_RET:\r\n      |->BC_RET_Z:\r\n      |  mov KBASE, BASE\t\t// Use KBASE for result move.\r\n      |  sub RD, 1\r\n      |  jz >3\r\n      |2:  // Move results down.\r\n      |.if X64\r\n      |  mov RBa, [KBASE+RA]\r\n      |  mov [KBASE-8], RBa\r\n      |.else\r\n      |  mov RB, [KBASE+RA]\r\n      |  mov [KBASE-8], RB\r\n      |  mov RB, [KBASE+RA+4]\r\n      |  mov [KBASE-4], RB\r\n      |.endif\r\n      |  add KBASE, 8\r\n      |  sub RD, 1\r\n      |  jnz <2\r\n      |3:\r\n      |  mov RD, MULTRES\t\t// Note: MULTRES may be >255.\r\n      |  movzx RB, PC_RB\t\t// So cannot compare with RDL!\r\n      |5:\r\n      |  cmp RB, RD\t\t\t// More results expected?\r\n      |  ja >6\r\n      break;\r\n    case BC_RET1:\r\n      |.if X64\r\n      |  mov RBa, [BASE+RA]\r\n      |  mov [BASE-8], RBa\r\n      |.else\r\n      |  mov RB, [BASE+RA+4]\r\n      |  mov [BASE-4], RB\r\n      |  mov RB, [BASE+RA]\r\n      |  mov [BASE-8], RB\r\n      |.endif\r\n      /* fallthrough */\r\n    case BC_RET0:\r\n      |5:\r\n      |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n      |  ja >6\r\n    default:\r\n      break;\r\n    }\r\n    |  movzx RA, PC_RA\r\n    |  not RAa\t\t\t\t// Note: ~RA = -(RA+1)\r\n    |  lea BASE, [BASE+RA*8]\t\t// base = base - (RA+1)*8\r\n    |  mov LFUNC:KBASE, [BASE-8]\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  ins_next\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    if (op == BC_RET) {\r\n      |  mov dword [KBASE-4], LJ_TNIL\t// Note: relies on shifted base.\r\n      |  add KBASE, 8\r\n    } else {\r\n      |  mov dword [BASE+RD*8-12], LJ_TNIL\r\n    }\r\n    |  add RD, 1\r\n    |  jmp <5\r\n    |\r\n    |7:  // Non-standard return case.\r\n    |  lea RB, [PC-FRAME_VARG]\r\n    |  test RB, FRAME_TYPEP\r\n    |  jnz ->vm_return\r\n    |  // Return from vararg function: relocate BASE down and RA up.\r\n    |  sub BASE, RB\r\n    if (op != BC_RET0) {\r\n      |  add RA, RB\r\n    }\r\n    |  jmp <1\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA];    .define FOR_TIDX,  dword [RA+4]\r\n  |.define FOR_STOP, [RA+8];  .define FOR_TSTOP, dword [RA+12]\r\n  |.define FOR_STEP, [RA+16]; .define FOR_TSTEP, dword [RA+20]\r\n  |.define FOR_EXT,  [RA+24]; .define FOR_TEXT,  dword [RA+28]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_IFORL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  ins_AJ\t// RA = base, RD = target (after end of loop or start of loop)\r\n    |  lea RA, [BASE+RA*8]\r\n    if (LJ_DUALNUM) {\r\n      |  cmp FOR_TIDX, LJ_TISNUM; jne >9\r\n      if (!vk) {\r\n\t|  cmp FOR_TSTOP, LJ_TISNUM; jne ->vmeta_for\r\n\t|  cmp FOR_TSTEP, LJ_TISNUM; jne ->vmeta_for\r\n\t|  mov RB, dword FOR_IDX\r\n\t|  cmp dword FOR_STEP, 0; jl >5\r\n      } else {\r\n#ifdef LUA_USE_ASSERT\r\n\t|  cmp FOR_TSTOP, LJ_TISNUM; jne ->assert_bad_for_arg_type\r\n\t|  cmp FOR_TSTEP, LJ_TISNUM; jne ->assert_bad_for_arg_type\r\n#endif\r\n\t|  mov RB, dword FOR_STEP\r\n\t|  test RB, RB; js >5\r\n\t|  add RB, dword FOR_IDX; jo >1\r\n\t|  mov dword FOR_IDX, RB\r\n      }\r\n      |  cmp RB, dword FOR_STOP\r\n      |  mov FOR_TEXT, LJ_TISNUM\r\n      |  mov dword FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jle >7\r\n\t|1:\r\n\t|6:\r\n\t|  branchPC RD\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RD, PC_RD\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      } else if (op == BC_IFORL) {\r\n\t|  jg >7\r\n\t|6:\r\n\t|  branchPC RD\r\n\t|1:\r\n      } else {\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      }\r\n      |7:\r\n      |  ins_next\r\n      |\r\n      |5:  // Invert check for negative step.\r\n      if (vk) {\r\n\t|  add RB, dword FOR_IDX; jo <1\r\n\t|  mov dword FOR_IDX, RB\r\n      }\r\n      |  cmp RB, dword FOR_STOP\r\n      |  mov FOR_TEXT, LJ_TISNUM\r\n      |  mov dword FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jge <7\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RD, PC_RD\r\n\t|  jge =>BC_JLOOP\r\n      } else if (op == BC_IFORL) {\r\n\t|  jl <7\r\n      } else {\r\n\t|  jge =>BC_JLOOP\r\n      }\r\n      |  jmp <6\r\n      |9:  // Fallback to FP variant.\r\n    } else if (!vk) {\r\n      |  cmp FOR_TIDX, LJ_TISNUM\r\n    }\r\n    if (!vk) {\r\n      |  jae ->vmeta_for\r\n      |  cmp FOR_TSTOP, LJ_TISNUM; jae ->vmeta_for\r\n    } else {\r\n#ifdef LUA_USE_ASSERT\r\n      |  cmp FOR_TSTOP, LJ_TISNUM; jae ->assert_bad_for_arg_type\r\n      |  cmp FOR_TSTEP, LJ_TISNUM; jae ->assert_bad_for_arg_type\r\n#endif\r\n    }\r\n    |  mov RB, FOR_TSTEP\t\t// Load type/hiword of for step.\r\n    if (!vk) {\r\n      |  cmp RB, LJ_TISNUM; jae ->vmeta_for\r\n    }\r\n    |.if SSE\r\n    |  movsd xmm0, qword FOR_IDX\r\n    |  movsd xmm1, qword FOR_STOP\r\n    if (vk) {\r\n      |  addsd xmm0, qword FOR_STEP\r\n      |  movsd qword FOR_IDX, xmm0\r\n      |  test RB, RB; js >3\r\n    } else {\r\n      |  jl >3\r\n    }\r\n    |  ucomisd xmm1, xmm0\r\n    |1:\r\n    |  movsd qword FOR_EXT, xmm0\r\n    |.else\r\n    |  fld qword FOR_STOP\r\n    |  fld qword FOR_IDX\r\n    if (vk) {\r\n      |  fadd qword FOR_STEP\t\t// nidx = idx + step\r\n      |  fst qword FOR_IDX\r\n      |  fst qword FOR_EXT\r\n      |  test RB, RB; js >1\r\n    } else {\r\n      |  fst qword FOR_EXT\r\n      |  jl >1\r\n    }\r\n    |  fxch\t\t\t\t// Swap lim/(n)idx if step non-negative.\r\n    |1:\r\n    |  fcomparepp\r\n    |.endif\r\n    if (op == BC_FORI) {\r\n      |.if DUALNUM\r\n      |  jnb <7\r\n      |.else\r\n      |  jnb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else if (op == BC_JFORI) {\r\n      |  branchPC RD\r\n      |  movzx RD, PC_RD\r\n      |  jnb =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |.if DUALNUM\r\n      |  jb <7\r\n      |.else\r\n      |  jb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else {\r\n      |  jnb =>BC_JLOOP\r\n    }\r\n    |.if DUALNUM\r\n    |  jmp <6\r\n    |.else\r\n    |2:\r\n    |  ins_next\r\n    |.endif\r\n    |.if SSE\r\n    |3:  // Invert comparison if step is negative.\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp <1\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_IITERL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  ins_AJ\t// RA = base, RD = target\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov RB, [RA+4]\r\n    |  cmp RB, LJ_TNIL; je >1\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  mov [RA-4], RB\r\n      |  mov RB, [RA]\r\n      |  mov [RA-8], RB\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  branchPC RD\t\t\t// Otherwise save control var + branch.\r\n      |  mov RD, [RA]\r\n      |  mov [RA-4], RB\r\n      |  mov [RA-8], RD\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n  |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_ILOOP follows and ins_A is a no-op.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  ins_AD\t// RA = base (ignored), RD = traceno\r\n    |  mov RA, [DISPATCH+DISPATCH_J(trace)]\r\n    |  mov TRACE:RD, [RA+RD*4]\r\n    |  mov RDa, TRACE:RD->mcode\r\n    |  mov L:RB, SAVE_L\r\n    |  mov [DISPATCH+DISPATCH_GL(jit_base)], BASE\r\n    |  mov [DISPATCH+DISPATCH_GL(jit_L)], L:RB\r\n    |  // Save additional callee-save registers only used in compiled code.\r\n    |.if X64WIN\r\n    |  mov TMPQ, r12\r\n    |  mov TMPa, r13\r\n    |  mov CSAVE_4, r14\r\n    |  mov CSAVE_3, r15\r\n    |  mov RAa, rsp\r\n    |  sub rsp, 9*16+4*8\r\n    |  movdqa [RAa], xmm6\r\n    |  movdqa [RAa-1*16], xmm7\r\n    |  movdqa [RAa-2*16], xmm8\r\n    |  movdqa [RAa-3*16], xmm9\r\n    |  movdqa [RAa-4*16], xmm10\r\n    |  movdqa [RAa-5*16], xmm11\r\n    |  movdqa [RAa-6*16], xmm12\r\n    |  movdqa [RAa-7*16], xmm13\r\n    |  movdqa [RAa-8*16], xmm14\r\n    |  movdqa [RAa-9*16], xmm15\r\n    |.elif X64\r\n    |  mov TMPQ, r12\r\n    |  mov TMPa, r13\r\n    |  sub rsp, 16\r\n    |.endif\r\n    |  jmp RDa\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  ins_AJ\t// RA = unused, RD = target\r\n    |  branchPC RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n   /*\r\n   ** Reminder: A function may be called with func/args above L->maxstack,\r\n   ** i.e. occupying EXTRA_STACK slots. And vmeta_call may add one extra slot,\r\n   ** too. This means all FUNC* ops (including fast functions) must check\r\n   ** for stack overflow _before_ adding more slots!\r\n   */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall RB\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    | // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [BASE+RA*8]\t\t// Top of frame.\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_f\r\n    |  movzx RA, byte [PC-4+PC2PROTO(numparams)]\r\n    |  cmp NARGS:RD, RA\t\t\t// Check for missing parameters.\r\n    |  jbe >3\r\n    |2:\r\n    if (op == BC_JFUNCF) {\r\n      |  movzx RD, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov dword [BASE+NARGS:RD*8-4], LJ_TNIL\r\n    |  add NARGS:RD, 1\r\n    |  cmp NARGS:RD, RA\r\n    |  jbe <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    | int3  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  lea RB, [NARGS:RD*8+FRAME_VARG]\r\n    |  lea RD, [BASE+NARGS:RD*8]\r\n    |  mov LFUNC:KBASE, [BASE-8]\r\n    |  mov [RD-4], RB\t\t\t// Store delta + FRAME_VARG.\r\n    |  mov [RD-8], LFUNC:KBASE\t\t// Store copy of LFUNC.\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [RD+RA*8]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_v\t\t// Need to grow stack.\r\n    |  mov RA, BASE\r\n    |  mov BASE, RD\r\n    |  movzx RB, byte [PC-4+PC2PROTO(numparams)]\r\n    |  test RB, RB\r\n    |  jz >2\r\n    |1:  // Copy fixarg slots up to new frame.\r\n    |  add RA, 8\r\n    |  cmp RA, BASE\r\n    |  jnb >3\t\t\t\t// Less args than parameters?\r\n    |  mov KBASE, [RA-8]\r\n    |  mov [RD], KBASE\r\n    |  mov KBASE, [RA-4]\r\n    |  mov [RD+4], KBASE\r\n    |  add RD, 8\r\n    |  mov dword [RA-4], LJ_TNIL\t// Clear old fixarg slot (help the GC).\r\n    |  sub RB, 1\r\n    |  jnz <1\r\n    |2:\r\n    if (op == BC_JFUNCV) {\r\n      |  movzx RD, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov dword [RD+4], LJ_TNIL\r\n    |  add RD, 8\r\n    |  sub RB, 1\r\n    |  jnz <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  ins_AD  // BASE = new base, RA = ins RA|RD (unused), RD = nargs+1\r\n    |  mov CFUNC:RB, [BASE-8]\r\n    |  mov KBASEa, CFUNC:RB->f\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RD, [BASE+NARGS:RD*8-8]\r\n    |  mov L:RB->base, BASE\r\n    |  lea RA, [RD+8*LUA_MINSTACK]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  mov L:RB->top, RD\r\n    if (op == BC_FUNCC) {\r\n      |.if X64\r\n      |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n      |.else\r\n      |  mov ARG1, L:RB\r\n      |.endif\r\n    } else {\r\n      |.if X64\r\n      |  mov CARG2, KBASEa\r\n      |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n      |.else\r\n      |  mov ARG2, KBASEa\r\n      |  mov ARG1, L:RB\r\n      |.endif\r\n    }\r\n    |  ja ->vm_growstack_c\t\t// Need to grow stack.\r\n    |  set_vmstate C\r\n    if (op == BC_FUNCC) {\r\n      |  call KBASEa\t\t\t// (lua_State *L)\r\n    } else {\r\n      |  // (lua_State *L, lua_CFunction f)\r\n      |  call aword [DISPATCH+DISPATCH_GL(wrapf)]\r\n    }\r\n    |  set_vmstate INTERP\r\n    |  // nresults returned in eax (RD).\r\n    |  mov BASE, L:RB->base\r\n    |  lea RA, [BASE+RD*8]\r\n    |  neg RA\r\n    |  add RA, L:RB->top\t\t// RA = (L->top-(L->base+nresults))*8\r\n    |  mov PC, [BASE-4]\t\t\t// Fetch PC of caller.\r\n    |  jmp ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n  dasm_growpc(Dst, BC__MAX);\r\n  build_subroutines(ctx);\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n#if LJ_64\r\n#define SZPTR\t\"8\"\r\n#define BSZPTR\t\"3\"\r\n#define REG_SP\t\"0x7\"\r\n#define REG_RA\t\"0x10\"\r\n#else\r\n#define SZPTR\t\"4\"\r\n#define BSZPTR\t\"2\"\r\n#define REG_SP\t\"0x4\"\r\n#define REG_RA\t\"0x8\"\r\n#endif\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_64\r\n\t\"\\t.quad .Lbegin\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n#else\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0x87\\n\\t.uleb128 0x3\\n\"\t/* offset edi */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x4\\n\"\t/* offset esi */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x5\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE0:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_64\r\n\t\"\\t.quad lj_vm_ffi_call\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n#else\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 8\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x5\\n\"\t\t/* def_cfa_register ebp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#if (defined(__sun__) && defined(__svr4__))\r\n#if LJ_64\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@unwind\\n\");\r\n#else\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"aw\\\",@progbits\\n\");\r\n#endif\r\n#else\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n#endif\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n#if LJ_64\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n#else\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0x87\\n\\t.uleb128 0x3\\n\"\t/* offset edi */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x4\\n\"\t/* offset esi */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x5\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE2:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n#else\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 8\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x5\\n\"\t\t/* def_cfa_register ebp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  /* Mental note: never let Apple design an assembler.\r\n  ** Or a linker. Or a plastic case. But I digress.\r\n  */\r\n  case BUILD_machasm: {\r\n#if LJ_HASFFI\r\n    int fcsize = 0;\r\n#endif\r\n    int i;\r\n    fprintf(ctx->fp, \"\\t.section __TEXT,__eh_frame,coalesced,no_toc+strip_static_syms+live_support\\n\");\r\n    fprintf(ctx->fp,\r\n\t\"EH_frame1:\\n\"\r\n\t\"\\t.set L$set$x,LECIEX-LSCIEX\\n\"\r\n\t\"\\t.long L$set$x\\n\"\r\n\t\"LSCIEX:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.ascii \\\"zPR\\\\0\\\"\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.byte 128-\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.byte 6\\n\"\t\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x9b\\n\"\t\t\t/* indirect|pcrel|sdata4 */\r\n#if LJ_64\r\n\t\"\\t.long _lj_err_unwind_dwarf+4@GOTPCREL\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.byte \" REG_SP \"\\n\\t.byte \" SZPTR \"\\n\"\r\n#else\r\n\t\"\\t.long L_lj_err_unwind_dwarf$non_lazy_ptr-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.byte 0x5\\n\\t.byte 0x4\\n\"  /* esp=5 on 32 bit MACH-O. */\r\n#endif\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.byte 0x1\\n\"\r\n\t\"\\t.align \" BSZPTR \"\\n\"\r\n\t\"LECIEX:\\n\\n\");\r\n    for (i = 0; i < ctx->nsym; i++) {\r\n      const char *name = ctx->sym[i].name;\r\n      int32_t size = ctx->sym[i+1].ofs - ctx->sym[i].ofs;\r\n      if (size == 0) continue;\r\n#if LJ_HASFFI\r\n      if (!strcmp(name, \"_lj_vm_ffi_call\")) { fcsize = size; continue; }\r\n#endif\r\n      fprintf(ctx->fp,\r\n\t  \"%s.eh:\\n\"\r\n\t  \"LSFDE%d:\\n\"\r\n\t  \"\\t.set L$set$%d,LEFDE%d-LASFDE%d\\n\"\r\n\t  \"\\t.long L$set$%d\\n\"\r\n\t  \"LASFDE%d:\\n\"\r\n\t  \"\\t.long LASFDE%d-EH_frame1\\n\"\r\n\t  \"\\t.long %s-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n\t  \"\\t.byte 0xe\\n\\t.byte %d\\n\"\t\t/* def_cfa_offset */\r\n#if LJ_64\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n\t  \"\\t.byte 0x8f\\n\\t.byte 0x4\\n\"\t\t/* offset r15 */\r\n\t  \"\\t.byte 0x8e\\n\\t.byte 0x5\\n\"\t\t/* offset r14 */\r\n#else\r\n\t  \"\\t.byte 0x84\\n\\t.byte 0x2\\n\"\t\t/* offset ebp (4 for MACH-O)*/\r\n\t  \"\\t.byte 0x87\\n\\t.byte 0x3\\n\"\t\t/* offset edi */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x4\\n\"\t\t/* offset esi */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x5\\n\"\t\t/* offset ebx */\r\n#endif\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LEFDE%d:\\n\\n\",\r\n\t  name, i, i, i, i, i, i, i, name, size, CFRAME_SIZE, i);\r\n    }\r\n#if LJ_HASFFI\r\n    if (fcsize) {\r\n      fprintf(ctx->fp,\r\n\t  \"EH_frame2:\\n\"\r\n\t  \"\\t.set L$set$y,LECIEY-LSCIEY\\n\"\r\n\t  \"\\t.long L$set$y\\n\"\r\n\t  \"LSCIEY:\\n\"\r\n\t  \"\\t.long 0\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.ascii \\\"zR\\\\0\\\"\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.byte 128-\" SZPTR \"\\n\"\r\n\t  \"\\t.byte \" REG_RA \"\\n\"\r\n\t  \"\\t.byte 1\\n\"\t\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t  \"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t  \"\\t.byte 0xc\\n\\t.byte \" REG_SP \"\\n\\t.byte \" SZPTR \"\\n\"\r\n#else\r\n\t  \"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t  \"\\t.byte 0xc\\n\\t.byte 0x5\\n\\t.byte 0x4\\n\"  /* esp=5 on 32 bit MACH. */\r\n#endif\r\n\t  \"\\t.byte 0x80+\" REG_RA \"\\n\\t.byte 0x1\\n\"\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LECIEY:\\n\\n\");\r\n      fprintf(ctx->fp,\r\n\t  \"_lj_vm_ffi_call.eh:\\n\"\r\n\t  \"LSFDEY:\\n\"\r\n\t  \"\\t.set L$set$yy,LEFDEY-LASFDEY\\n\"\r\n\t  \"\\t.long L$set$yy\\n\"\r\n\t  \"LASFDEY:\\n\"\r\n\t  \"\\t.long LASFDEY-EH_frame2\\n\"\r\n\t  \"\\t.long _lj_vm_ffi_call-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t  \"\\t.byte 0xe\\n\\t.byte 16\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0xd\\n\\t.byte 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n#else\r\n\t  \"\\t.byte 0xe\\n\\t.byte 8\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x84\\n\\t.byte 0x2\\n\"\t\t/* offset ebp (4 for MACH-O)*/\r\n\t  \"\\t.byte 0xd\\n\\t.byte 0x4\\n\"\t\t/* def_cfa_register ebp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset ebx */\r\n#endif\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LEFDEY:\\n\\n\", fcsize);\r\n    }\r\n#endif\r\n#if LJ_64\r\n    fprintf(ctx->fp, \"\\t.subsections_via_symbols\\n\");\r\n#else\r\n    fprintf(ctx->fp,\r\n      \"\\t.non_lazy_symbol_pointer\\n\"\r\n      \"L_lj_err_unwind_dwarf$non_lazy_ptr:\\n\"\r\n      \".indirect_symbol _lj_err_unwind_dwarf\\n\"\r\n      \".long 0\\n\");\r\n#endif\r\n    }\r\n    break;\r\n  default:  /* Difficult for other modes. */\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.0.4/src/xedkbuild.bat",
    "content": "@rem Script to build LuaJIT with the Xbox 360 SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (32 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined XEDK goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Error out for 64 bit host compiler\r\n@minilua\r\n@if errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D GPR64 -D FRAME32 -D PPE -D SQRT -D DUALNUM\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_ppc.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% /D_XBOX_VER=200 /DLUAJIT_TARGET=LUAJIT_ARCH_PPC  host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m peobj -o lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%XEDK%\\bin\\win32\\cl\" /nologo /c /MT /O2 /W3 /GF /Gm- /GR- /GS- /Gy /openmp- /D_CRT_SECURE_NO_DEPRECATE /DNDEBUG /D_XBOX /D_LIB /DLUAJIT_USE_SYSMALLOC\r\n@set LJLIB=\"%XEDK%\\bin\\win32\\lib\" /nologo\r\n@set \"INCLUDE=%XEDK%\\include\\xbox\"\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set \"LJCOMPILE=%LJCOMPILE% /Zi\"\r\n:NODEBUG\r\n@if \"%1\"==\"amalg\" goto :AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL lj_*.c lib_*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit20.lib lj_*.obj lib_*.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :NOAMALG\r\n:AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit20.lib ljamalg.obj lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\n:NOAMALG\r\n\r\n@del *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for Xbox 360 ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (32 bit host compiler). The Xbox 360 SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.1.0/COPYRIGHT",
    "content": "===============================================================================\r\nLuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/\r\n\r\nCopyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n\r\n[ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n\r\n===============================================================================\r\n[ LuaJIT includes code from Lua 5.1/5.2, which has this license statement: ]\r\n\r\nCopyright (C) 1994-2012 Lua.org, PUC-Rio.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n\r\n===============================================================================\r\n[ LuaJIT includes code from dlmalloc, which has this license statement: ]\r\n\r\nThis is a version (aka dlmalloc) of malloc/free/realloc written by\r\nDoug Lea and released to the public domain, as explained at\r\nhttp://creativecommons.org/licenses/publicdomain\r\n\r\n===============================================================================\r\n"
  },
  {
    "path": "build/luajit-2.1.0/Makefile",
    "content": "##############################################################################\r\n# LuaJIT top level Makefile for installation. Requires GNU Make.\r\n#\r\n# Please read doc/install.html before changing any variables!\r\n#\r\n# Suitable for POSIX platforms (Linux, *BSD, OSX etc.).\r\n# Note: src/Makefile has many more configurable options.\r\n#\r\n# ##### This Makefile is NOT useful for Windows! #####\r\n# For MSVC, please follow the instructions given in src/msvcbuild.bat.\r\n# For MinGW and Cygwin, cd to src and run make with the Makefile there.\r\n#\r\n# Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n##############################################################################\r\n\r\nMAJVER=  2\r\nMINVER=  1\r\nRELVER=  0\r\nPREREL=  -beta1\r\nVERSION= $(MAJVER).$(MINVER).$(RELVER)$(PREREL)\r\nABIVER=  5.1\r\n\r\n##############################################################################\r\n#\r\n# Change the installation path as needed. This automatically adjusts\r\n# the paths in src/luaconf.h, too. Note: PREFIX must be an absolute path!\r\n#\r\nexport PREFIX= /usr/local\r\nexport MULTILIB= lib\r\n##############################################################################\r\n\r\nDPREFIX= $(DESTDIR)$(PREFIX)\r\nINSTALL_BIN=   $(DPREFIX)/bin\r\nINSTALL_LIB=   $(DPREFIX)/$(MULTILIB)\r\nINSTALL_SHARE= $(DPREFIX)/share\r\nINSTALL_INC=   $(DPREFIX)/include/luajit-$(MAJVER).$(MINVER)\r\n\r\nINSTALL_LJLIBD= $(INSTALL_SHARE)/luajit-$(VERSION)\r\nINSTALL_JITLIB= $(INSTALL_LJLIBD)/jit\r\nINSTALL_LMODD= $(INSTALL_SHARE)/lua\r\nINSTALL_LMOD= $(INSTALL_LMODD)/$(ABIVER)\r\nINSTALL_CMODD= $(INSTALL_LIB)/lua\r\nINSTALL_CMOD= $(INSTALL_CMODD)/$(ABIVER)\r\nINSTALL_MAN= $(INSTALL_SHARE)/man/man1\r\nINSTALL_PKGCONFIG= $(INSTALL_LIB)/pkgconfig\r\n\r\nINSTALL_TNAME= luajit-$(VERSION)\r\nINSTALL_TSYMNAME= luajit\r\nINSTALL_ANAME= libluajit-$(ABIVER).a\r\nINSTALL_SONAME= libluajit-$(ABIVER).so.$(MAJVER).$(MINVER).$(RELVER)\r\nINSTALL_SOSHORT= libluajit-$(ABIVER).so\r\nINSTALL_DYLIBNAME= libluajit-$(ABIVER).$(MAJVER).$(MINVER).$(RELVER).dylib\r\nINSTALL_DYLIBSHORT1= libluajit-$(ABIVER).dylib\r\nINSTALL_DYLIBSHORT2= libluajit-$(ABIVER).$(MAJVER).dylib\r\nINSTALL_PCNAME= luajit.pc\r\n\r\nINSTALL_STATIC= $(INSTALL_LIB)/$(INSTALL_ANAME)\r\nINSTALL_DYN= $(INSTALL_LIB)/$(INSTALL_SONAME)\r\nINSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_SOSHORT)\r\nINSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_SOSHORT)\r\nINSTALL_T= $(INSTALL_BIN)/$(INSTALL_TNAME)\r\nINSTALL_TSYM= $(INSTALL_BIN)/$(INSTALL_TSYMNAME)\r\nINSTALL_PC= $(INSTALL_PKGCONFIG)/$(INSTALL_PCNAME)\r\n\r\nINSTALL_DIRS= $(INSTALL_BIN) $(INSTALL_LIB) $(INSTALL_INC) $(INSTALL_MAN) \\\r\n  $(INSTALL_PKGCONFIG) $(INSTALL_JITLIB) $(INSTALL_LMOD) $(INSTALL_CMOD)\r\nUNINSTALL_DIRS= $(INSTALL_JITLIB) $(INSTALL_LJLIBD) $(INSTALL_INC) \\\r\n  $(INSTALL_LMOD) $(INSTALL_LMODD) $(INSTALL_CMOD) $(INSTALL_CMODD)\r\n\r\nRM= rm -f\r\nMKDIR= mkdir -p\r\nRMDIR= rmdir 2>/dev/null\r\nSYMLINK= ln -sf\r\nINSTALL_X= install -m 0755\r\nINSTALL_F= install -m 0644\r\nUNINSTALL= $(RM)\r\nLDCONFIG= ldconfig -n\r\nSED_PC= sed -e \"s|^prefix=.*|prefix=$(PREFIX)|\" \\\r\n            -e \"s|^multilib=.*|multilib=$(MULTILIB)|\"\r\n\r\nFILE_T= luajit\r\nFILE_A= libluajit.a\r\nFILE_SO= libluajit.so\r\nFILE_MAN= luajit.1\r\nFILE_PC= luajit.pc\r\nFILES_INC= lua.h lualib.h lauxlib.h luaconf.h lua.hpp luajit.h\r\nFILES_JITLIB= bc.lua bcsave.lua dump.lua p.lua v.lua zone.lua \\\r\n\t      dis_x86.lua dis_x64.lua dis_arm.lua dis_ppc.lua \\\r\n\t      dis_mips.lua dis_mipsel.lua vmdef.lua\r\n\r\nifeq (,$(findstring Windows,$(OS)))\r\n  ifeq (Darwin,$(shell uname -s))\r\n    INSTALL_SONAME= $(INSTALL_DYLIBNAME)\r\n    INSTALL_SHORT1= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT1)\r\n    INSTALL_SHORT2= $(INSTALL_LIB)/$(INSTALL_DYLIBSHORT2)\r\n    LDCONFIG= :\r\n  endif\r\nendif\r\n\r\n##############################################################################\r\n\r\nINSTALL_DEP= src/luajit\r\n\r\ndefault all $(INSTALL_DEP):\r\n\t@echo \"==== Building LuaJIT $(VERSION) ====\"\r\n\t$(MAKE) -C src\r\n\t@echo \"==== Successfully built LuaJIT $(VERSION) ====\"\r\n\r\ninstall: $(INSTALL_DEP)\r\n\t@echo \"==== Installing LuaJIT $(VERSION) to $(PREFIX) ====\"\r\n\t$(MKDIR) $(INSTALL_DIRS)\r\n\tcd src && $(INSTALL_X) $(FILE_T) $(INSTALL_T)\r\n\tcd src && test -f $(FILE_A) && $(INSTALL_F) $(FILE_A) $(INSTALL_STATIC) || :\r\n\t$(RM) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2)\r\n\tcd src && test -f $(FILE_SO) && \\\r\n\t  $(INSTALL_X) $(FILE_SO) $(INSTALL_DYN) && \\\r\n\t  $(LDCONFIG) $(INSTALL_LIB) && \\\r\n\t  $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT1) && \\\r\n\t  $(SYMLINK) $(INSTALL_SONAME) $(INSTALL_SHORT2) || :\r\n\tcd etc && $(INSTALL_F) $(FILE_MAN) $(INSTALL_MAN)\r\n\tcd etc && $(SED_PC) $(FILE_PC) > $(FILE_PC).tmp && \\\r\n\t  $(INSTALL_F) $(FILE_PC).tmp $(INSTALL_PC) && \\\r\n\t  $(RM) $(FILE_PC).tmp\r\n\tcd src && $(INSTALL_F) $(FILES_INC) $(INSTALL_INC)\r\n\tcd src/jit && $(INSTALL_F) $(FILES_JITLIB) $(INSTALL_JITLIB)\r\n\t@echo \"==== Successfully installed LuaJIT $(VERSION) to $(PREFIX) ====\"\r\n\t@echo \"\"\r\n\t@echo \"Note: the development releases deliberately do NOT install a symlink for luajit\"\r\n\t@echo \"You can do this now by running this command (with sudo):\"\r\n\t@echo \"\"\r\n\t@echo \"  $(SYMLINK) $(INSTALL_TNAME) $(INSTALL_TSYM)\"\r\n\t@echo \"\"\r\n\r\n\r\nuninstall:\r\n\t@echo \"==== Uninstalling LuaJIT $(VERSION) from $(PREFIX) ====\"\r\n\t$(UNINSTALL) $(INSTALL_T) $(INSTALL_STATIC) $(INSTALL_DYN) $(INSTALL_SHORT1) $(INSTALL_SHORT2) $(INSTALL_MAN)/$(FILE_MAN) $(INSTALL_PC)\r\n\tfor file in $(FILES_JITLIB); do \\\r\n\t  $(UNINSTALL) $(INSTALL_JITLIB)/$$file; \\\r\n\t  done\r\n\tfor file in $(FILES_INC); do \\\r\n\t  $(UNINSTALL) $(INSTALL_INC)/$$file; \\\r\n\t  done\r\n\t$(LDCONFIG) $(INSTALL_LIB)\r\n\t$(RMDIR) $(UNINSTALL_DIRS) || :\r\n\t@echo \"==== Successfully uninstalled LuaJIT $(VERSION) from $(PREFIX) ====\"\r\n\r\n##############################################################################\r\n\r\namalg:\r\n\t@echo \"Building LuaJIT $(VERSION)\"\r\n\t$(MAKE) -C src amalg\r\n\r\nclean:\r\n\t$(MAKE) -C src clean\r\n\r\n.PHONY: all install amalg clean\r\n\r\n##############################################################################\r\n"
  },
  {
    "path": "build/luajit-2.1.0/README",
    "content": "README for LuaJIT 2.1.0-beta1\r\n-----------------------------\r\n\r\nLuaJIT is a Just-In-Time (JIT) compiler for the Lua programming language.\r\n\r\nProject Homepage: http://luajit.org/\r\n\r\nLuaJIT is Copyright (C) 2005-2015 Mike Pall.\r\nLuaJIT is free software, released under the MIT license.\r\nSee full Copyright Notice in the COPYRIGHT file or in luajit.h.\r\n\r\nDocumentation for LuaJIT is available in HTML format.\r\nPlease point your favorite browser to:\r\n\r\n doc/luajit.html\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/bluequad-print.css",
    "content": "/* Copyright (C) 2004-2015 Mike Pall.\r\n *\r\n * You are welcome to use the general ideas of this design for your own sites.\r\n * But please do not steal the stylesheet, the layout or the color scheme.\r\n */\r\nbody {\r\n  font-family: serif;\r\n  font-size: 11pt;\r\n  margin: 0 3em;\r\n  padding: 0;\r\n  border: none;\r\n}\r\na:link, a:visited, a:hover, a:active {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #0000ff;\r\n}\r\nh1, h2, h3 {\r\n  font-family: sans-serif;\r\n  font-weight: bold;\r\n  text-align: left;\r\n  margin: 0.5em 0;\r\n  padding: 0;\r\n}\r\nh1 {\r\n  font-size: 200%;\r\n}\r\nh2 {\r\n  font-size: 150%;\r\n}\r\nh3 {\r\n  font-size: 125%;\r\n}\r\np {\r\n  margin: 0 0 0.5em 0;\r\n  padding: 0;\r\n}\r\nul, ol {\r\n  margin: 0.5em 0;\r\n  padding: 0 0 0 2em;\r\n}\r\nul {\r\n  list-style: outside square;\r\n}\r\nol {\r\n  list-style: outside decimal;\r\n}\r\nli {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndl {\r\n  margin: 1em 0;\r\n  padding: 1em;\r\n  border: 1px solid black;\r\n}\r\ndt {\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndt sup {\r\n  float: right;\r\n  margin-left: 1em;\r\n}\r\ndd {\r\n  margin: 0.5em 0 0 2em;\r\n  padding: 0;\r\n}\r\ntable {\r\n  table-layout: fixed;\r\n  width: 100%;\r\n  margin: 1em 0;\r\n  padding: 0;\r\n  border: 1px solid black;\r\n  border-spacing: 0;\r\n  border-collapse: collapse;\r\n}\r\ntr {\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n}\r\ntd {\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 0.2em 0.5em;\r\n  border-top: 1px solid black;\r\n  border-bottom: 1px solid black;\r\n}\r\ntr.separate td {\r\n  border-top: double;\r\n}\r\ntt, pre, code, kbd, samp {\r\n  font-family: monospace;\r\n  font-size: 75%;\r\n}\r\nkbd {\r\n  font-weight: bolder;\r\n}\r\nblockquote, pre {\r\n  margin: 1em 2em;\r\n  padding: 0;\r\n}\r\nimg {\r\n  border: none;\r\n  vertical-align: baseline;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\nimg.left {\r\n  float: left;\r\n  margin: 0.5em 1em 0.5em 0;\r\n}\r\nimg.right {\r\n  float: right;\r\n  margin: 0.5em 0 0.5em 1em;\r\n}\r\n.flush {\r\n  clear: both;\r\n  visibility: hidden;\r\n}\r\n.hide, .noprint, #nav {\r\n  display: none !important;\r\n}\r\n.pagebreak {\r\n  page-break-before: always;\r\n}\r\n#site {\r\n  text-align: right;\r\n  font-family: sans-serif;\r\n  font-weight: bold;\r\n  margin: 0 1em;\r\n  border-bottom: 1pt solid black;\r\n}\r\n#site a {\r\n  font-size: 1.2em;\r\n}\r\n#site a:link, #site a:visited {\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#logo {\r\n  color: #ff8000;\r\n}\r\n#head {\r\n  clear: both;\r\n  margin: 0 1em;\r\n}\r\n#main {\r\n  line-height: 1.3;\r\n  text-align: justify;\r\n  margin: 1em;\r\n}\r\n#foot {\r\n  clear: both;\r\n  font-size: 80%;\r\n  text-align: center;\r\n  margin: 0 1.25em;\r\n  padding: 0.5em 0 0 0;\r\n  border-top: 1pt solid black;\r\n  page-break-before: avoid;\r\n  page-break-after: avoid;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/bluequad.css",
    "content": "/* Copyright (C) 2004-2015 Mike Pall.\r\n *\r\n * You are welcome to use the general ideas of this design for your own sites.\r\n * But please do not steal the stylesheet, the layout or the color scheme.\r\n */\r\n/* colorscheme:\r\n *\r\n * site  |  head   #4162bf/white   | #6078bf/#e6ecff\r\n * ------+------   ----------------+-------------------\r\n * nav   |  main   #bfcfff         | #e6ecff/black\r\n *\r\n * nav:  hiback   loback     #c5d5ff #b9c9f9\r\n *       hiborder loborder   #e6ecff #97a7d7\r\n *       link     hover      #2142bf #ff0000\r\n *\r\n * link: link visited hover  #2142bf #8122bf #ff0000\r\n *\r\n * main: boxback  boxborder  #f0f4ff #bfcfff\r\n */\r\nbody {\r\n  font-family: Verdana, Arial, Helvetica, sans-serif;\r\n  font-size: 10pt;\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n  background: #e0e0e0;\r\n  color: #000000;\r\n}\r\na:link {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #2142bf;\r\n}\r\na:visited {\r\n  text-decoration: none;\r\n  background: transparent;\r\n  color: #8122bf;\r\n}\r\na:hover, a:active {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #ff0000;\r\n}\r\nh1, h2, h3 {\r\n  font-weight: bold;\r\n  text-align: left;\r\n  margin: 0.5em 0;\r\n  padding: 0;\r\n  background: transparent;\r\n}\r\nh1 {\r\n  font-size: 200%;\r\n  line-height: 3em; /* really 6em relative to body, match #site span */\r\n  margin: 0;\r\n}\r\nh2 {\r\n  font-size: 150%;\r\n  color: #606060;\r\n}\r\nh3 {\r\n  font-size: 125%;\r\n  color: #404040;\r\n}\r\np {\r\n  max-width: 600px;\r\n  margin: 0 0 0.5em 0;\r\n  padding: 0;\r\n}\r\nb {\r\n  color: #404040;\r\n}\r\nul, ol {\r\n  max-width: 600px;\r\n  margin: 0.5em 0;\r\n  padding: 0 0 0 2em;\r\n}\r\nul {\r\n  list-style: outside square;\r\n}\r\nol {\r\n  list-style: outside decimal;\r\n}\r\nli {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndl {\r\n  max-width: 600px;\r\n  margin: 1em 0;\r\n  padding: 1em;\r\n  border: 1px solid #bfcfff;\r\n  background: #f0f4ff;\r\n}\r\ndt {\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\ndt sup {\r\n  float: right;\r\n  margin-left: 1em;\r\n  color: #808080;\r\n}\r\ndt a:visited {\r\n  text-decoration: none;\r\n  color: #2142bf;\r\n}\r\ndt a:hover, dt a:active {\r\n  text-decoration: none;\r\n  color: #ff0000;\r\n}\r\ndd {\r\n  margin: 0.5em 0 0 2em;\r\n  padding: 0;\r\n}\r\ndiv.tablewrap { /* for IE *sigh* */\r\n  max-width: 600px;\r\n}\r\ntable {\r\n  table-layout: fixed;\r\n  border-spacing: 0;\r\n  border-collapse: collapse;\r\n  max-width: 600px;\r\n  width: 100%;\r\n  margin: 1em 0;\r\n  padding: 0;\r\n  border: 1px solid #bfcfff;\r\n}\r\ntr {\r\n  margin: 0;\r\n  padding: 0;\r\n  border: none;\r\n}\r\ntr.odd {\r\n  background: #f0f4ff;\r\n}\r\ntr.separate td {\r\n  border-top: 1px solid #bfcfff;\r\n}\r\ntd {\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 0.2em 0.5em;\r\n  border: none;\r\n}\r\ntt, code, kbd, samp {\r\n  font-family: Courier New, Courier, monospace;\r\n  line-height: 1.2;\r\n  font-size: 110%;\r\n}\r\nkbd {\r\n  font-weight: bolder;\r\n}\r\nblockquote, pre {\r\n  max-width: 600px;\r\n  margin: 1em 2em;\r\n  padding: 0;\r\n}\r\npre {\r\n  line-height: 1.1;\r\n}\r\npre.code {\r\n  line-height: 1.4;\r\n  margin: 0.5em 0 1em 0.5em;\r\n  padding: 0.5em 1em;\r\n  border: 1px solid #bfcfff;\r\n  background: #f0f4ff;\r\n}\r\npre.mark {\r\n  padding-left: 2em;\r\n}\r\nspan.codemark {\r\n  position:absolute;\r\n  left: 16em;\r\n  color: #4040c0;\r\n}\r\nspan.mark {\r\n  color: #4040c0;\r\n  font-family: Courier New, Courier, monospace;\r\n  line-height: 1.1;\r\n}\r\nimg {\r\n  border: none;\r\n  vertical-align: baseline;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\nimg.left {\r\n  float: left;\r\n  margin: 0.5em 1em 0.5em 0;\r\n}\r\nimg.right {\r\n  float: right;\r\n  margin: 0.5em 0 0.5em 1em;\r\n}\r\n.indent {\r\n  padding-left: 1em;\r\n}\r\n.flush {\r\n  clear: both;\r\n  visibility: hidden;\r\n}\r\n.hide, .noscreen {\r\n  display: none !important;\r\n}\r\n.ext {\r\n  color: #ff8000;\r\n}\r\n.new {\r\n  font-size: 6pt;\r\n  vertical-align: middle;\r\n  background: #ff8000;\r\n  color: #ffffff;\r\n}\r\n#site {\r\n  clear: both;\r\n  float: left;\r\n  width: 13em;\r\n  text-align: center;\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 0;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#site a {\r\n  font-size: 200%;\r\n}\r\n#site a:link, #site a:visited {\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#site span {\r\n  line-height: 3em; /* really 6em relative to body, match h1 */\r\n}\r\n#logo {\r\n  color: #ffb380;\r\n}\r\n#head {\r\n  margin: 0;\r\n  padding: 0 0 0 2em;\r\n  border-left: solid 13em #4162bf;\r\n  border-right: solid 3em #6078bf;\r\n  background: #6078bf;\r\n  color: #e6ecff;\r\n}\r\n#nav {\r\n  clear: both;\r\n  float: left;\r\n  overflow: hidden;\r\n  text-align: left;\r\n  line-height: 1.5;\r\n  width: 13em;\r\n  padding-top: 1em;\r\n  background: transparent;\r\n}\r\n#nav ul {\r\n  list-style: none outside;\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\n#nav li {\r\n  margin: 0;\r\n  padding: 0;\r\n}\r\n#nav a {\r\n  display: block;\r\n  text-decoration: none;\r\n  font-weight: bold;\r\n  margin: 0;\r\n  padding: 2px 1em;\r\n  border-top: 1px solid transparent;\r\n  border-bottom: 1px solid transparent;\r\n  background: transparent;\r\n  color: #2142bf;\r\n}\r\n#nav a:hover, #nav a:active {\r\n  text-decoration: none;\r\n  border-top: 1px solid #97a7d7;\r\n  border-bottom: 1px solid #e6ecff;\r\n  background: #b9c9f9;\r\n  color: #ff0000;\r\n}\r\n#nav a.current, #nav a.current:hover, #nav a.current:active {\r\n  border-top: 1px solid #e6ecff;\r\n  border-bottom: 1px solid #97a7d7;\r\n  background: #c5d5ff;\r\n  color: #2142bf;\r\n}\r\n#nav ul ul a {\r\n  padding: 0 1em 0 1.7em;\r\n}\r\n#nav ul ul ul a {\r\n  padding: 0 0.5em 0 2.4em;\r\n}\r\n#main {\r\n  line-height: 1.5;\r\n  text-align: left;\r\n  margin: 0;\r\n  padding: 1em 2em;\r\n  border-left: solid 13em #bfcfff;\r\n  border-right: solid 3em #e6ecff;\r\n  background: #e6ecff;\r\n}\r\n#foot {\r\n  clear: both;\r\n  font-size: 80%;\r\n  text-align: center;\r\n  margin: 0;\r\n  padding: 0.5em;\r\n  background: #6078bf;\r\n  color: #ffffff;\r\n}\r\n#foot a:link, #foot a:visited {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #ffffff;\r\n}\r\n#foot a:hover, #foot a:active {\r\n  text-decoration: underline;\r\n  background: transparent;\r\n  color: #bfcfff;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/changes.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>LuaJIT Change History</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ndiv.major { max-width: 600px; padding: 1em; margin: 1em 0 1em 0; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>LuaJIT Change History</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis is a list of changes between the released versions of LuaJIT.<br>\r\nThe current <span style=\"color: #0000c0;\">stable version</span> is <strong>LuaJIT&nbsp;2.0.4</strong>.<br>\r\n</p>\r\n<p>\r\nPlease check the\r\n<a href=\"http://luajit.org/changes.html\"><span class=\"ext\">&raquo;</span>&nbsp;Online Change History</a>\r\nto see whether newer versions are available.\r\n</p>\r\n\r\n<div class=\"major\" style=\"background: #d0d0ff;\">\r\n<h2 id=\"LuaJIT-2.1.0-beta1\">LuaJIT 2.1.0-beta1 &mdash; 2015-08-25</h2>\r\n<p>\r\nThis is a brief summary of the major changes in LuaJIT 2.1 compared to 2.0.\r\nPlease take a look at the commit history for more details.\r\n</p>\r\n<ul>\r\n<li>Changes to the VM core:\r\n<ul>\r\n<li>Add low-overhead profiler (<tt>-jp</tt>).</li>\r\n<li>Add <tt>LJ_GC64</tt> mode: 64 bit GC object references (really: 47 bit). Interpreter-only for now.</li>\r\n<li>Add <tt>LJ_FR2</tt> mode: Two-slot frame info. Required by <tt>LJ_GC64</tt> mode.</li>\r\n<li>Add <tt>table.new()</tt> and <tt>table.clear()</tt>.</li>\r\n<li>Parse binary number literals (<tt>0bxxx</tt>).</li>\r\n</ul></li>\r\n<li>Improvements to the JIT compiler:\r\n<ul>\r\n<li>Add trace stitching (disabled for now).</li>\r\n<li>Compile various builtins: <tt>string.char()</tt>, <tt>string.reverse()</tt>, <tt>string.lower()</tt>, <tt>string.upper()</tt>, <tt>string.rep()</tt>, <tt>string.format()</tt>, <tt>table.concat()</tt>, <tt>bit.tohex()</tt>, <tt>getfenv(0)</tt>, <tt>debug.getmetatable()</tt>.</li>\r\n<li>Compile <tt>string.find()</tt> for fixed string searches (no patterns).</li>\r\n<li>Compile <tt>BC_TSETM</tt>, e.g. <tt>{1,2,3,f()}</tt>.</li>\r\n<li>Compile string concatenations (<tt>BC_CAT</tt>).</li>\r\n<li>Compile <tt>__concat</tt> metamethod.</li>\r\n<li>Various minor optimizations.</li>\r\n</ul></li>\r\n<li>Internal Changes:\r\n<ul>\r\n<li>Add support for embedding LuaJIT bytecode for builtins.</li>\r\n<li>Replace various builtins with embedded bytecode.</li>\r\n<li>Refactor string buffers and string formatting.</li>\r\n<li>Remove obsolete non-truncating number to integer conversions.</li>\r\n</ul></li>\r\n<li>Ports:\r\n<ul>\r\n<li>Add Xbox One port (<tt>LJ_GC64</tt> mode).</li>\r\n<li>ARM64: Add port of the interpreter (<tt>LJ_GC64</tt> mode).</li>\r\n<li>x64: Add separate port of the interpreter to <tt>LJ_GC64</tt> mode.</li>\r\n<li>x86/x64: Drop internal x87 math functions. Use libm functions.</li>\r\n<li>x86: Remove x87 support from interpreter. SSE2 is mandatory now.</li>\r\n<li>PPC/e500: Drop support for this architecture.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>FFI: Add 64 bit bitwise operations.</li>\r\n<li>FFI: Compile VLA/VLS and large cdata allocations with default initialization.</li>\r\n<li>FFI: Compile conversions from functions to function pointers.</li>\r\n<li>FFI: Compile lightuserdata to <tt>void *</tt> conversion.</li>\r\n<li>FFI: Compile <tt>ffi.gc(cdata, nil)</tt>, too.</li>\r\n<li>FFI: Add <tt>ffi.typeinfo()</tt>.</li>\r\n</ul></li>\r\n</ul>\r\n</div>\r\n\r\n<div class=\"major\" style=\"background: #ffffd0;\">\r\n<h2 id=\"LuaJIT-2.0.4\">LuaJIT 2.0.4 &mdash; 2015-05-14</h2>\r\n<ul>\r\n<li>Fix stack check in narrowing optimization.</li>\r\n<li>Fix Lua/C API typecheck error for special indexes.</li>\r\n<li>Fix string to number conversion.</li>\r\n<li>Fix lexer error for chunks without tokens.</li>\r\n<li>Don't compile <tt>IR_RETF</tt> after <tt>CALLT</tt> to ff with-side effects.</li>\r\n<li>Fix <tt>BC_UCLO</tt>/<tt>BC_JMP</tt> join optimization in Lua parser.</li>\r\n<li>Fix corner case in string to number conversion.</li>\r\n<li>Gracefully handle <tt>lua_error()</tt> for a suspended coroutine.</li>\r\n<li>Avoid error messages when building with Clang.</li>\r\n<li>Fix snapshot #0 handling for traces with a stack check on entry.</li>\r\n<li>Fix fused constant loads under high register pressure.</li>\r\n<li>Invalidate backpropagation cache after DCE.</li>\r\n<li>Fix ABC elimination.</li>\r\n<li>Fix debug info for main chunk of stripped bytecode.</li>\r\n<li>Fix FOLD rule for <tt>string.sub(s, ...) == k</tt>.</li>\r\n<li>Fix FOLD rule for <tt>STRREF</tt> of <tt>SNEW</tt>.</li>\r\n<li>Fix frame traversal while searching for error function.</li>\r\n<li>Prevent GC estimate miscalculation due to buffer growth.</li>\r\n<li>Prevent adding side traces for stack checks.</li>\r\n<li>Fix top slot calculation for snapshots with continuations.</li>\r\n<li>Fix check for reuse of SCEV results in <tt>FORL</tt>.</li>\r\n<li>Add PS Vita port.</li>\r\n<li>Fix compatibility issues with Illumos.</li>\r\n<li>Fix DragonFly build (unsupported).</li>\r\n<li>OpenBSD/x86: Better executable memory allocation for W^X mode.</li>\r\n<li>x86: Fix argument checks for <tt>ipairs()</tt> iterator.</li>\r\n<li>x86: <tt>lj_math_random_step()</tt> clobbers XMM regs on OSX Clang.</li>\r\n<li>x86: Fix code generation for unused result of <tt>math.random()</tt>.</li>\r\n<li>x64: Allow building with <tt>LUAJIT_USE_SYSMALLOC</tt> and <tt>LUAJIT_USE_VALGRIND</tt>.</li>\r\n<li>x86/x64: Fix argument check for bit shifts.</li>\r\n<li>x86/x64: Fix code generation for fused test/arith ops.</li>\r\n<li>ARM: Fix write barrier check in <tt>BC_USETS</tt>.</li>\r\n<li>PPC: Fix red zone overflow in machine code generation.</li>\r\n<li>PPC: Don't use <tt>mcrxr</tt> on PPE.</li>\r\n<li>Various archs: Fix excess stack growth in interpreter.</li>\r\n<li>FFI: Fix FOLD rule for <tt>TOBIT</tt> + <tt>CONV num.u32</tt>.</li>\r\n<li>FFI: Prevent DSE across <tt>ffi.string()</tt>.</li>\r\n<li>FFI: No meta fallback when indexing pointer to incomplete struct.</li>\r\n<li>FFI: Fix initialization of unions of subtypes.</li>\r\n<li>FFI: Fix cdata vs. non-cdata arithmetic and comparisons.</li>\r\n<li>FFI: Fix <tt>__index</tt>/<tt>__newindex</tt> metamethod resolution for ctypes.</li>\r\n<li>FFI: Fix compilation of reference field access.</li>\r\n<li>FFI: Fix frame traversal for backtraces with FFI callbacks.</li>\r\n<li>FFI: Fix recording of indexing a struct pointer ctype object itself.</li>\r\n<li>FFI: Allow non-scalar cdata to be compared for equality by address.</li>\r\n<li>FFI: Fix pseudo type conversions for type punning.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.3\">LuaJIT 2.0.3 &mdash; 2014-03-12</h2>\r\n<ul>\r\n<li>Add PS4 port.</li>\r\n<li>Add support for multilib distro builds.</li>\r\n<li>Fix OSX build.</li>\r\n<li>Fix MinGW build.</li>\r\n<li>Fix Xbox 360 build.</li>\r\n<li>Improve ULOAD forwarding for open upvalues.</li>\r\n<li>Fix GC steps threshold handling when called by JIT-compiled code.</li>\r\n<li>Fix argument checks for <tt>math.deg()</tt> and <tt>math.rad()</tt>.</li>\r\n<li>Fix <tt>jit.flush(func|true)</tt>.</li>\r\n<li>Respect <tt>jit.off(func)</tt> when returning to a function, too.</li>\r\n<li>Fix compilation of <tt>string.byte(s, nil, n)</tt>.</li>\r\n<li>Fix line number for relocated bytecode after closure fixup</li>\r\n<li>Fix frame traversal for backtraces.</li>\r\n<li>Fix ABC elimination.</li>\r\n<li>Fix handling of redundant PHIs.</li>\r\n<li>Fix snapshot restore for exit to function header.</li>\r\n<li>Fix type punning alias analysis for constified pointers</li>\r\n<li>Fix call unroll checks in the presence of metamethod frames.</li>\r\n<li>Fix initial maxslot for down-recursive traces.</li>\r\n<li>Prevent BASE register coalescing if parent uses <tt>IR_RETF</tt>.</li>\r\n<li>Don't purge modified function from stack slots in <tt>BC_RET</tt>.</li>\r\n<li>Fix recording of <tt>BC_VARG</tt>.</li>\r\n<li>Don't access dangling reference to reallocated IR.</li>\r\n<li>Fix frame depth display for bytecode dump in <tt>-jdump</tt>.</li>\r\n<li>ARM: Fix register allocation when rematerializing FPRs.</li>\r\n<li>x64: Fix store to upvalue for lightuserdata values.</li>\r\n<li>FFI: Add missing GC steps for callback argument conversions.</li>\r\n<li>FFI: Properly unload loaded DLLs.</li>\r\n<li>FFI: Fix argument checks for <tt>ffi.string()</tt>.</li>\r\n<li>FFI/x64: Fix passing of vector arguments to calls.</li>\r\n<li>FFI: Rehash finalizer table after GC cycle, if needed.</li>\r\n<li>FFI: Fix <tt>cts-&gt;L</tt> for cdata unsinking in snapshot restore.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.2\">LuaJIT 2.0.2 &mdash; 2013-06-03</h2>\r\n<ul>\r\n<li>Fix memory access check for fast string interning.</li>\r\n<li>Fix MSVC intrinsics for older versions.</li>\r\n<li>Add missing GC steps for <tt>io.*</tt> functions.</li>\r\n<li>Fix spurious red zone overflows in machine code generation.</li>\r\n<li>Fix jump-range constrained mcode allocation.</li>\r\n<li>Inhibit DSE for implicit loads via calls.</li>\r\n<li>Fix builtin string to number conversion for overflow digits.</li>\r\n<li>Fix optional argument handling while recording builtins.</li>\r\n<li>Fix optional argument handling in <tt>table.concat()</tt>.</li>\r\n<li>Add partial support for building with MingW64 GCC 4.8-SEH.</li>\r\n<li>Add missing PHI barrier to <tt>string.sub(str, a, b) == kstr</tt> FOLD rule.</li>\r\n<li>Fix compatibility issues with Illumos.</li>\r\n<li>ARM: Fix cache flush/sync for exit stubs of JIT-compiled code.</li>\r\n<li>MIPS: Fix cache flush/sync for JIT-compiled code jump area.</li>\r\n<li>PPC: Add <tt>plt</tt> suffix for external calls from assembler code.</li>\r\n<li>FFI: Fix snapshot substitution in SPLIT pass.</li>\r\n<li>FFI/x86: Fix register allocation for 64 bit comparisons.</li>\r\n<li>FFI: Fix tailcall in lowest frame to C&nbsp;function with bool result.</li>\r\n<li>FFI: Ignore <tt>long</tt> type specifier in <tt>ffi.istype()</tt>.</li>\r\n<li>FFI: Fix calling conventions for 32 bit OSX and iOS simulator (struct returns).</li>\r\n<li>FFI: Fix calling conventions for ARM hard-float EABI (nested structs).</li>\r\n<li>FFI: Improve error messages for arithmetic and comparison operators.</li>\r\n<li>FFI: Insert no-op type conversion for pointer to integer cast.</li>\r\n<li>FFI: Fix unroll limit for <tt>ffi.fill()</tt>.</li>\r\n<li>FFI: Must sink <tt>XBAR</tt> together with <tt>XSTORE</tt>s.</li>\r\n<li>FFI: Preserve intermediate string for <tt>const&nbsp;char&nbsp;*</tt> conversion.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.1\">LuaJIT 2.0.1 &mdash; 2013-02-19</h2>\r\n<ul>\r\n<li>Don't clear frame for out-of-memory error.</li>\r\n<li>Leave hook when resume catches error thrown from hook.</li>\r\n<li>Add missing GC steps for template table creation.</li>\r\n<li>Fix discharge order of comparisons in Lua parser.</li>\r\n<li>Improve buffer handling for <tt>io.read()</tt>.</li>\r\n<li>OSX: Add support for Mach-O object files to <tt>-b</tt> option.</li>\r\n<li>Fix PS3 port.</li>\r\n<li>Fix/enable Xbox 360 port.</li>\r\n<li>x86/x64: Always mark ref for shift count as non-weak.</li>\r\n<li>x64: Don't fuse implicitly 32-to-64 extended operands.</li>\r\n<li>ARM: Fix armhf call argument handling.</li>\r\n<li>ARM: Fix code generation for integer math.min/math.max.</li>\r\n<li>PPC/e500: Fix <tt>lj_vm_floor()</tt> for Inf/NaN.</li>\r\n<li>FFI: Change priority of table initializer variants for structs.</li>\r\n<li>FFI: Fix code generation for bool call result check on x86/x64.</li>\r\n<li>FFI: Load FFI library on-demand for bytecode with cdata literals.</li>\r\n<li>FFI: Fix handling of qualified transparent structs/unions.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0\">LuaJIT 2.0.0 &mdash; 2012-11-08</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n  <li>Fix Android/x86 build.</li>\r\n  <li>Fix recording of equality comparisons with <tt>__eq</tt> metamethods.</li>\r\n  <li>Fix detection of immutable upvalues.</li>\r\n  <li>Replace error with PANIC for callbacks from JIT-compiled code.</li>\r\n  <li>Fix builtin string to number conversion for <tt>INT_MIN</tt>.</li>\r\n  <li>Don't create unneeded array part for template tables.</li>\r\n  <li>Fix <tt>CONV.num.int</tt> sinking.</li>\r\n  <li>Don't propagate implicitly widened number to index metamethods.</li>\r\n  <li>ARM: Fix ordered comparisons of number vs. non-number.</li>\r\n  <li>FFI: Fix code generation for replay of sunk float fields.</li>\r\n  <li>FFI: Fix signedness of bool.</li>\r\n  <li>FFI: Fix recording of bool call result check on x86/x64.</li>\r\n  <li>FFI: Fix stack-adjustment for <tt>__thiscall</tt> callbacks.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta11\">LuaJIT 2.0.0-beta11 &mdash; 2012-10-16</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n  <li>Use ARM VFP instructions, if available (build-time detection).</li>\r\n  <li>Add support for ARM hard-float EABI (<tt>armhf</tt>).</li>\r\n  <li>Add PS3 port.</li>\r\n  <li>Add many features from Lua&nbsp;5.2, e.g. <tt>goto</tt>/labels.\r\n  Refer to <a href=\"extensions.html#lua52\">this list</a>.</li>\r\n  <li>FFI: Add parameterized C types.</li>\r\n  <li>FFI: Add support for copy constructors.</li>\r\n  <li>FFI: Equality comparisons never raise an error (treat as unequal instead).</li>\r\n  <li>FFI: Box all accessed or returned enums.</li>\r\n  <li>FFI: Check for <tt>__new</tt> metamethod when calling a constructor.</li>\r\n  <li>FFI: Handle <tt>__pairs</tt>/<tt>__ipairs</tt> metamethods for cdata objects.</li>\r\n  <li>FFI: Convert <tt>io.*</tt> file handle to <tt>FILE *</tt> pointer (but as a <tt>void *</tt>).</li>\r\n  <li>FFI: Detect and support type punning through unions.</li>\r\n  <li>FFI: Improve various error messages.</li>\r\n</ul></li>\r\n<li>Build-system reorganization:\r\n<ul>\r\n  <li>Reorganize directory layout:<br>\r\n  <tt>lib/*</tt> &rarr; <tt>src/jit/*</tt><br>\r\n  <tt>src/buildvm_*.dasc</tt> &rarr; <tt>src/vm_*.dasc</tt><br>\r\n  <tt>src/buildvm_*.h</tt> &rarr; removed<br>\r\n  <tt>src/buildvm*</tt> &rarr; <tt>src/host/*</tt></li>\r\n  <li>Add minified Lua interpreter plus Lua BitOp (<tt>minilua</tt>) to run DynASM.</li>\r\n  <li>Change DynASM bit operations to use Lua BitOp</li>\r\n  <li>Translate only <tt>vm_*.dasc</tt> for detected target architecture.</li>\r\n  <li>Improve target detection for <tt>msvcbuild.bat</tt>.</li>\r\n  <li>Fix build issues on Cygwin and MinGW with optional MSys.</li>\r\n  <li>Handle cross-compiles with FPU/no-FPU or hard-fp/soft-fp ABI mismatch.</li>\r\n  <li>Remove some library functions for no-JIT/no-FFI builds.</li>\r\n  <li>Add uninstall target to top-level Makefile.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n  <li>Preserve snapshot #0 PC for all traces.</li>\r\n  <li>Fix argument checks for <tt>coroutine.create()</tt>.</li>\r\n  <li>Command line prints version and JIT status to <tt>stdout</tt>, not <tt>stderr</tt>.</li>\r\n  <li>Fix userdata <tt>__gc</tt> separations at Lua state close.</li>\r\n  <li>Fix <tt>TDUP</tt> to <tt>HLOAD</tt> forwarding for <tt>LJ_DUALNUM</tt> builds.</li>\r\n  <li>Fix buffer check in bytecode writer.</li>\r\n  <li>Make <tt>os.date()</tt> thread-safe.</li>\r\n  <li>Add missing declarations for MSVC intrinsics.</li>\r\n  <li>Fix dispatch table modifications for return hooks.</li>\r\n  <li>Workaround for MSVC conversion bug (<tt>double</tt> &rarr; <tt>uint32_t</tt> &rarr; <tt>int32_t</tt>).</li>\r\n  <li>Fix FOLD rule <tt>(i-j)-i => 0-j</tt>.</li>\r\n  <li>Never use DWARF unwinder on Windows.</li>\r\n  <li>Fix shrinking of direct mapped blocks in builtin allocator.</li>\r\n  <li>Limit recursion depth in <tt>string.match()</tt> et al.</li>\r\n  <li>Fix late despecialization of <tt>ITERN</tt> after loop has been entered.</li>\r\n  <li>Fix <tt>'f'</tt> and <tt>'L'</tt> options for <tt>debug.getinfo()</tt> and <tt>lua_getinfo()</tt>.</li>\r\n  <li>Fix <tt>package.searchpath()</tt>.</li>\r\n  <li>OSX: Change dylib names to be consistent with other platforms.</li>\r\n  <li>Android: Workaround for broken <tt>sprintf(\"%g\",&nbsp;-0.0)</tt>.</li>\r\n  <li>x86: Remove support for ancient CPUs without <tt>CMOV</tt> (before Pentium Pro).</li>\r\n  <li>x86: Fix register allocation for calls returning register pair.</li>\r\n  <li>x86/x64: Fix fusion of unsigned byte comparisons with swapped operands.</li>\r\n  <li>ARM: Fix <tt>tonumber()</tt> argument check.</li>\r\n  <li>ARM: Fix modulo operator and <tt>math.floor()</tt>/<tt>math.ceil()</tt> for <tt>inf</tt>/<tt>nan</tt>.</li>\r\n  <li>ARM: Invoke SPLIT pass for leftover <tt>IR_TOBIT</tt>.</li>\r\n  <li>ARM: Fix BASE register coalescing.</li>\r\n  <li>PPC: Fix interpreter state setup in callbacks.</li>\r\n  <li>PPC: Fix <tt>string.sub()</tt> range check.</li>\r\n  <li>MIPS: Support generation of MIPS/MIPSEL bytecode object files.</li>\r\n  <li>MIPS: Fix calls to <tt>floor()</tt>/<tt>ceil()</tt><tt>/trunc()</tt>.</li>\r\n  <li>ARM/PPC: Detect more target architecture variants.</li>\r\n  <li>ARM/PPC/e500/MIPS: Fix tailcalls from fast functions, esp. <tt>tostring()</tt>.</li>\r\n  <li>ARM/PPC/MIPS: Fix rematerialization of FP constants.</li>\r\n  <li>FFI: Don't call <tt>FreeLibrary()</tt> on our own EXE/DLL.</li>\r\n  <li>FFI: Resolve metamethods for constructors, too.</li>\r\n  <li>FFI: Properly disable callbacks on iOS (would require executable memory).</li>\r\n  <li>FFI: Fix cdecl string parsing during recording.</li>\r\n  <li>FFI: Show address pointed to for <tt>tostring(ref)</tt>, too.</li>\r\n  <li>FFI: Fix alignment of C call argument/return structure.</li>\r\n  <li>FFI: Initialize all fields of standard types.</li>\r\n  <li>FFI: Fix callback handling when new C&nbsp;types are declared in callback.</li>\r\n  <li>FFI: Fix recording of constructors for pointers.</li>\r\n  <li>FFI: Always resolve metamethods for pointers to structs.</li>\r\n  <li>FFI: Correctly propagate alignment when interning nested types.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n  <li>Add allocation sinking and store sinking optimization.</li>\r\n  <li>Constify immutable upvalues.</li>\r\n  <li>Add builtin string to integer or FP number conversion. Improves cross-platform consistency and correctness.</li>\r\n  <li>Create string hash slots in template tables for non-const values, too. Avoids later table resizes.</li>\r\n  <li>Eliminate <tt>HREFK</tt> guard for template table references.</li>\r\n  <li>Add various new FOLD rules.</li>\r\n  <li>Don't use stack unwinding for <tt>lua_yield()</tt> (slow on x64).</li>\r\n  <li>ARM, PPC, MIPS: Improve <tt>XLOAD</tt> operand fusion and register hinting.</li>\r\n  <li>PPC, MIPS: Compile <tt>math.sqrt()</tt> to sqrt instruction, if available.</li>\r\n  <li>FFI: Fold <tt>KPTR</tt> + constant offset in SPLIT pass.</li>\r\n  <li>FFI: Optimize/inline <tt>ffi.copy()</tt> and <tt>ffi.fill()</tt>.</li>\r\n  <li>FFI: Compile and optimize array/struct copies.</li>\r\n  <li>FFI: Compile <tt>ffi.typeof(cdata|ctype)</tt>, <tt>ffi.sizeof()</tt>, <tt>ffi.alignof()</tt>, <tt>ffi.offsetof()</tt> and <tt>ffi.gc()</tt>.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta10\">LuaJIT 2.0.0-beta10 &mdash; 2012-05-09</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>The MIPS of LuaJIT is complete. It requires a CPU conforming to the\r\nMIPS32&nbsp;R1 architecture with hardware FPU. O32 hard-fp ABI,\r\nlittle-endian or big-endian.</li>\r\n<li>Auto-detect target arch via cross-compiler. No need for\r\n<tt>TARGET=arch</tt> anymore.</li>\r\n<li>Make DynASM compatible with Lua 5.2.</li>\r\n<li>From Lua 5.2: Try <tt>__tostring</tt> metamethod on non-string error\r\nmessages..</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix parsing of hex literals with exponents.</li>\r\n<li>Fix bytecode dump for certain number constants.</li>\r\n<li>Fix argument type in error message for relative arguments.</li>\r\n<li>Fix argument error handling on Lua stacks without a frame.</li>\r\n<li>Add missing mcode limit check in assembler backend.</li>\r\n<li>Fix compilation on OpenBSD.</li>\r\n<li>Avoid recursive GC steps after GC-triggered trace exit.</li>\r\n<li>Replace <tt>&lt;unwind.h&gt;</tt> definitions with our own.</li>\r\n<li>Fix OSX build issues. Bump minimum required OSX version to 10.4.</li>\r\n<li>Fix discharge order of comparisons in Lua parser.</li>\r\n<li>Ensure running <tt>__gc</tt> of userdata created in <tt>__gc</tt>\r\nat state close.</li>\r\n<li>Limit number of userdata <tt>__gc</tt> separations at state close.</li>\r\n<li>Fix bytecode <tt>JMP</tt> slot range when optimizing\r\n<tt>and</tt>/<tt>or</tt> with constant LHS.</li>\r\n<li>Fix DSE of <tt>USTORE</tt>.</li>\r\n<li>Make <tt>lua_concat()</tt> work from C&nbsp;hook with partial frame.</li>\r\n<li>Add required PHIs for implicit conversions, e.g. via <tt>XREF</tt>\r\nforwarding.</li>\r\n<li>Add more comparison variants to Valgrind suppressions file.</li>\r\n<li>Disable loading bytecode with an extra header (BOM or <tt>#!</tt>).</li>\r\n<li>Fix PHI stack slot syncing.</li>\r\n<li>ARM: Reorder type/value tests to silence Valgrind.</li>\r\n<li>ARM: Fix register allocation for <tt>ldrd</tt>-optimized\r\n<tt>HREFK</tt>.</li>\r\n<li>ARM: Fix conditional branch fixup for <tt>OBAR</tt>.</li>\r\n<li>ARM: Invoke SPLIT pass for <tt>double</tt> args in FFI call.</li>\r\n<li>ARM: Handle all <tt>CALL*</tt> ops with <tt>double</tt> results in\r\nSPLIT pass.</li>\r\n<li>ARM: Fix rejoin of <tt>POW</tt> in SPLIT pass.</li>\r\n<li>ARM: Fix compilation of <tt>math.sinh</tt>, <tt>math.cosh</tt>,\r\n<tt>math.tanh</tt>.</li>\r\n<li>ARM, PPC: Avoid pointless arg clearing in <tt>BC_IFUNCF</tt>.</li>\r\n<li>PPC: Fix resume after yield from hook.</li>\r\n<li>PPC: Fix argument checking for <tt>rawget()</tt>.</li>\r\n<li>PPC: Fix fusion of floating-point <tt>XLOAD</tt>/<tt>XSTORE</tt>.</li>\r\n<li>PPC: Fix <tt>HREFK</tt> code generation for huge tables.</li>\r\n<li>PPC: Use builtin D-Cache/I-Cache sync code.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Ignore empty statements in <tt>ffi.cdef()</tt>.</li>\r\n<li>Ignore number parsing errors while skipping definitions.</li>\r\n<li>Don't touch frame in callbacks with tailcalls to fast functions.</li>\r\n<li>Fix library unloading on POSIX systems.</li>\r\n<li>Finalize cdata before userdata when closing the state.</li>\r\n<li>Change <tt>ffi.load()</tt> library name resolution for Cygwin.</li>\r\n<li>Fix resolving of function name redirects on Windows/x86.</li>\r\n<li>Fix symbol resolving error messages on Windows.</li>\r\n<li>Fix blacklisting of C functions calling callbacks.</li>\r\n<li>Fix result type of pointer difference.</li>\r\n<li>Use correct PC in FFI metamethod error message.</li>\r\n<li>Allow <tt>'typedef _Bool int BOOL;'</tt> for the Windows API.</li>\r\n<li>Don't record test for bool result of call, if ignored.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta9\">LuaJIT 2.0.0-beta9 &mdash; 2011-12-14</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>PPC port of LuaJIT is complete. Default is the dual-number port\r\n(usually faster). Single-number port selectable via <tt>src/Makefile</tt>\r\nat build time.</li>\r\n<li>Add FFI callback support.</li>\r\n<li>Extend <tt>-b</tt> to generate <tt>.c</tt>, <tt>.h</tt> or <tt>.obj/.o</tt>\r\nfiles with embedded bytecode.</li>\r\n<li>Allow loading embedded bytecode with <tt>require()</tt>.</li>\r\n<li>From Lua 5.2: Change to <tt>'\\z'</tt> escape. Reject undefined escape\r\nsequences.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix OSX 10.7 build. Fix <tt>install_name</tt> and versioning on OSX.</li>\r\n<li>Fix iOS build.</li>\r\n<li>Install <tt>dis_arm.lua</tt>, too.</li>\r\n<li>Mark installed shared library as executable.</li>\r\n<li>Add debug option to <tt>msvcbuild.bat</tt> and improve error handling.</li>\r\n<li>Fix data-flow analysis for iterators.</li>\r\n<li>Fix forced unwinding triggered by external unwinder.</li>\r\n<li>Record missing <tt>for</tt> loop slot loads (return to lower frame).</li>\r\n<li>Always use ANSI variants of Windows system functions.</li>\r\n<li>Fix GC barrier for multi-result table constructor (<tt>TSETM</tt>).</li>\r\n<li>Fix/add various FOLD rules.</li>\r\n<li>Add potential PHI for number conversions due to type instability.</li>\r\n<li>Do not eliminate PHIs only referenced from other PHIs.</li>\r\n<li>Correctly anchor implicit number to string conversions in Lua/C API.</li>\r\n<li>Fix various stack limit checks.</li>\r\n<li>x64: Use thread-safe exceptions for external unwinding (GCC platforms).</li>\r\n<li>x64: Fix result type of cdata index conversions.</li>\r\n<li>x64: Fix <tt>math.random()</tt> and <tt>bit.bswap()</tt> code generation.</li>\r\n<li>x64: Fix <tt>lightuserdata</tt> comparisons.</li>\r\n<li>x64: Always extend stack-passed arguments to pointer size.</li>\r\n<li>ARM: Many fixes to code generation backend.</li>\r\n<li>PPC/e500: Fix dispatch for binop metamethods.</li>\r\n<li>PPC/e500: Save/restore condition registers when entering/leaving the VM.</li>\r\n<li>PPC/e500: Fix write barrier in stores of strings to upvalues.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Fix C comment parsing.</li>\r\n<li>Fix snapshot optimization for cdata comparisons.</li>\r\n<li>Fix recording of const/enum lookups in namespaces.</li>\r\n<li>Fix call argument and return handling for <tt>I8/U8/I16/U16</tt> types.</li>\r\n<li>Fix unfused loads of float fields.</li>\r\n<li>Fix <tt>ffi.string()</tt> recording.</li>\r\n<li>Save <tt>GetLastError()</tt> around <tt>ffi.load()</tt> and symbol\r\nresolving, too.</li>\r\n<li>Improve ld script detection in <tt>ffi.load()</tt>.</li>\r\n<li>Record loads/stores to external variables in namespaces.</li>\r\n<li>Compile calls to stdcall, fastcall and vararg functions.</li>\r\n<li>Treat function ctypes like pointers in comparisons.</li>\r\n<li>Resolve <tt>__call</tt> metamethod for pointers, too.</li>\r\n<li>Record C function calls with bool return values.</li>\r\n<li>Record <tt>ffi.errno()</tt>.</li>\r\n<li>x86: Fix number to <tt>uint32_t</tt> conversion rounding.</li>\r\n<li>x86: Fix 64 bit arithmetic in assembler backend.</li>\r\n<li>x64: Fix struct-by-value calling conventions.</li>\r\n<li>ARM: Ensure invocation of SPLIT pass for float conversions.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Display trace types with <tt>-jv</tt> and <tt>-jdump</tt>.</li>\r\n<li>Record isolated calls. But prefer recording loops over calls.</li>\r\n<li>Specialize to prototype for non-monomorphic functions. Solves the\r\ntrace-explosion problem for closure-heavy programming styles.</li>\r\n<li>Always generate a portable <tt>vmdef.lua</tt>. Easier for distros.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta8\">LuaJIT 2.0.0-beta8 &mdash; 2011-06-23</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>Soft-float ARM port of LuaJIT is complete.</li>\r\n<li>Add support for bytecode loading/saving and <tt>-b</tt> command line\r\noption.</li>\r\n<li>From Lua 5.2: <tt>__len</tt> metamethod for tables\r\n(disabled by default).</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>ARM: Misc. fixes for interpreter.</li>\r\n<li>x86/x64: Fix <tt>bit.*</tt> argument checking in interpreter.</li>\r\n<li>Catch early out-of-memory in memory allocator initialization.</li>\r\n<li>Fix data-flow analysis for paths leading to an upvalue close.</li>\r\n<li>Fix check for missing arguments in <tt>string.format()</tt>.</li>\r\n<li>Fix Solaris/x86 build (note: not a supported target).</li>\r\n<li>Fix recording of loops with instable directions in side traces.</li>\r\n<li>x86/x64: Fix fusion of comparisons with <tt>u8</tt>/<tt>u16</tt>\r\n<tt>XLOAD</tt>.</li>\r\n<li>x86/x64: Fix register allocation for variable shifts.</li>\r\n</ul></li>\r\n<li>FFI library:\r\n<ul>\r\n<li>Add <tt>ffi.errno()</tt>. Save <tt>errno</tt>/<tt>GetLastError()</tt>\r\naround allocations etc.</li>\r\n<li>Fix <tt>__gc</tt> for VLA/VLS cdata objects.</li>\r\n<li>Fix recording of casts from 32 bit cdata pointers to integers.</li>\r\n<li><tt>tonumber(cdata)</tt> returns <tt>nil</tt> for non-numbers.</li>\r\n<li>Show address pointed to for <tt>tostring(pointer)</tt>.</li>\r\n<li>Print <tt>NULL</tt> pointers as <tt>\"cdata&lt;... *&gt;: NULL\"</tt>.</li>\r\n<li>Support <tt>__tostring</tt> metamethod for pointers to structs, too.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>More tuning for loop unrolling heuristics.</li>\r\n<li>Flatten and compress in-memory debug info (saves ~70%).</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta7\">LuaJIT 2.0.0-beta7 &mdash; 2011-05-05</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>ARM port of the LuaJIT interpreter is complete.</li>\r\n<li>FFI library: Add <tt>ffi.gc()</tt>, <tt>ffi.metatype()</tt>,\r\n<tt>ffi.istype()</tt>.</li>\r\n<li>FFI library: Resolve ld script redirection in <tt>ffi.load()</tt>.</li>\r\n<li>From Lua 5.2: <tt>package.searchpath()</tt>, <tt>fp:read(\"*L\")</tt>,\r\n<tt>load(string)</tt>.</li>\r\n<li>From Lua 5.2, disabled by default: empty statement,\r\n<tt>table.unpack()</tt>, modified <tt>coroutine.running()</tt>.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>FFI library: numerous fixes.</li>\r\n<li>Fix type mismatches in store-to-load forwarding.</li>\r\n<li>Fix error handling within metamethods.</li>\r\n<li>Fix <tt>table.maxn()</tt>.</li>\r\n<li>Improve accuracy of <tt>x^-k</tt> on x64.</li>\r\n<li>Fix code generation for Intel Atom in x64 mode.</li>\r\n<li>Fix narrowing of POW.</li>\r\n<li>Fix recording of retried fast functions.</li>\r\n<li>Fix code generation for <tt>bit.bnot()</tt> and multiplies.</li>\r\n<li>Fix error location within cpcall frames.</li>\r\n<li>Add workaround for old libgcc unwind bug.</li>\r\n<li>Fix <tt>lua_yield()</tt> and <tt>getmetatable(lightuserdata)</tt> on x64.</li>\r\n<li>Misc. fixes for PPC/e500 interpreter.</li>\r\n<li>Fix stack slot updates for down-recursion.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Add dual-number mode (int/double) for the VM. Enabled for ARM.</li>\r\n<li>Improve narrowing of arithmetic operators and <tt>for</tt> loops.</li>\r\n<li>Tune loop unrolling heuristics and increase trace recorder limits.</li>\r\n<li>Eliminate dead slots in snapshots using bytecode data-flow analysis.</li>\r\n<li>Avoid phantom stores to proxy tables.</li>\r\n<li>Optimize lookups in empty proxy tables.</li>\r\n<li>Improve bytecode optimization of <tt>and</tt>/<tt>or</tt> operators.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta6\">LuaJIT 2.0.0-beta6 &mdash; 2011-02-11</h2>\r\n<ul>\r\n<li>New features:\r\n<ul>\r\n<li>PowerPC/e500v2 port of the LuaJIT interpreter is complete.</li>\r\n<li>Various minor features from Lua 5.2: Hex escapes in literals,\r\n<tt>'\\*'</tt> escape, reversible <tt>string.format(\"%q\",s)</tt>,\r\n<tt>\"%g\"</tt> pattern, <tt>table.sort</tt> checks callbacks,\r\n<tt>os.exit(status|true|false[,close])</tt>.</li>\r\n<li>Lua 5.2 <tt>__pairs</tt> and <tt>__ipairs</tt> metamethods\r\n(disabled by default).</li>\r\n<li>Initial release of the FFI library.</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix <tt>string.format()</tt> for non-finite numbers.</li>\r\n<li>Fix memory leak when compiled to use the built-in allocator.</li>\r\n<li>x86/x64: Fix unnecessary resize in <tt>TSETM</tt> bytecode.</li>\r\n<li>Fix various GC issues with traces and <tt>jit.flush()</tt>.</li>\r\n<li>x64: Fix fusion of indexes for array references.</li>\r\n<li>x86/x64: Fix stack overflow handling for coroutine results.</li>\r\n<li>Enable low-2GB memory allocation on FreeBSD/x64.</li>\r\n<li>Fix <tt>collectgarbage(\"count\")</tt> result if more than 2GB is in use.</li>\r\n<li>Fix parsing of hex floats.</li>\r\n<li>x86/x64: Fix loop branch inversion with trailing\r\n<tt>HREF+NE/EQ</tt>.</li>\r\n<li>Add <tt>jit.os</tt> string.</li>\r\n<li><tt>coroutine.create()</tt> permits running C functions, too.</li>\r\n<li>Fix OSX build to work with newer ld64 versions.</li>\r\n<li>Fix bytecode optimization of <tt>and</tt>/<tt>or</tt> operators.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Emit specialized bytecode for <tt>pairs()</tt>/<tt>next()</tt>.</li>\r\n<li>Improve bytecode coalescing of <tt>nil</tt> constants.</li>\r\n<li>Compile calls to vararg functions.</li>\r\n<li>Compile <tt>select()</tt>.</li>\r\n<li>Improve alias analysis, esp. for loads from allocations.</li>\r\n<li>Tuning of various compiler heuristics.</li>\r\n<li>Refactor and extend IR conversion instructions.</li>\r\n<li>x86/x64: Various backend enhancements related to the FFI.</li>\r\n<li>Add SPLIT pass to split 64 bit IR instructions for 32 bit CPUs.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta5\">LuaJIT 2.0.0-beta5 &mdash; 2010-08-24</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix trace exit dispatch to function headers.</li>\r\n<li>Fix Windows and OSX builds with LUAJIT_DISABLE_JIT.</li>\r\n<li>Reorganize and fix placement of generated machine code on x64.</li>\r\n<li>Fix TNEW in x64 interpreter.</li>\r\n<li>Do not eliminate PHIs for values only referenced from side exits.</li>\r\n<li>OS-independent canonicalization of strings for non-finite numbers.</li>\r\n<li>Fix <tt>string.char()</tt> range check on x64.</li>\r\n<li>Fix <tt>tostring()</tt> resolving within <tt>print()</tt>.</li>\r\n<li>Fix error handling for <tt>next()</tt>.</li>\r\n<li>Fix passing of constant arguments to external calls on x64.</li>\r\n<li>Fix interpreter argument check for two-argument SSE math functions.</li>\r\n<li>Fix C frame chain corruption caused by <tt>lua_cpcall()</tt>.</li>\r\n<li>Fix return from <tt>pcall()</tt> within active hook.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Replace on-trace GC frame syncing with interpreter exit.</li>\r\n<li>Improve hash lookup specialization by not removing dead keys during GC.</li>\r\n<li>Turn traces into true GC objects.</li>\r\n<li>Avoid starting a GC cycle immediately after library init.</li>\r\n<li>Add weak guards to improve dead-code elimination.</li>\r\n<li>Speed up string interning.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta4\">LuaJIT 2.0.0-beta4 &mdash; 2010-03-28</h2>\r\n<ul>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix precondition for on-trace creation of table keys.</li>\r\n<li>Fix <tt>{f()}</tt> on x64 when table is resized.</li>\r\n<li>Fix folding of ordered comparisons with same references.</li>\r\n<li>Fix snapshot restores for multi-result bytecodes.</li>\r\n<li>Fix potential hang when recording bytecode with nested closures.</li>\r\n<li>Fix recording of <tt>getmetatable()</tt>, <tt>tonumber()</tt> and bad argument types.</li>\r\n<li>Fix SLOAD fusion across returns to lower frames.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Add array bounds check elimination. <tt>-Oabc</tt> is enabled by default.</li>\r\n<li>More tuning for x64, e.g. smaller table objects.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta3\">LuaJIT 2.0.0-beta3 &mdash; 2010-03-07</h2>\r\n<ul>\r\n<li>LuaJIT x64 port:\r\n<ul>\r\n<li>Port integrated memory allocator to Linux/x64, Windows/x64 and OSX/x64.</li>\r\n<li>Port interpreter and JIT compiler to x64.</li>\r\n<li>Port DynASM to x64.</li>\r\n<li>Many 32/64 bit cleanups in the VM.</li>\r\n<li>Allow building the interpreter with either x87 or SSE2 arithmetics.</li>\r\n<li>Add external unwinding and C++ exception interop (default on x64).</li>\r\n</ul></li>\r\n<li>Correctness and completeness:\r\n<ul>\r\n<li>Fix constructor bytecode generation for certain conditional values.</li>\r\n<li>Fix some cases of ordered string comparisons.</li>\r\n<li>Fix <tt>lua_tocfunction()</tt>.</li>\r\n<li>Fix cutoff register in JMP bytecode for some conditional expressions.</li>\r\n<li>Fix PHI marking algorithm for references from variant slots.</li>\r\n<li>Fix <tt>package.cpath</tt> for non-default PREFIX.</li>\r\n<li>Fix DWARF2 frame unwind information for interpreter on OSX.</li>\r\n<li>Drive the GC forward on string allocations in the parser.</li>\r\n<li>Implement call/return hooks (zero-cost if disabled).</li>\r\n<li>Implement yield from C hooks.</li>\r\n<li>Disable JIT compiler on older non-SSE2 CPUs instead of aborting.</li>\r\n</ul></li>\r\n<li>Structural and performance enhancements:\r\n<ul>\r\n<li>Compile recursive code (tail-, up- and down-recursion).</li>\r\n<li>Improve heuristics for bytecode penalties and blacklisting.</li>\r\n<li>Split CALL/FUNC recording and clean up fast function call semantics.</li>\r\n<li>Major redesign of internal function call handling.</li>\r\n<li>Improve FOR loop const specialization and integerness checks.</li>\r\n<li>Switch to pre-initialized stacks. Avoid frame-clearing.</li>\r\n<li>Colocation of prototypes and related data: bytecode, constants, debug info.</li>\r\n<li>Cleanup parser and streamline bytecode generation.</li>\r\n<li>Add support for weak IR references to register allocator.</li>\r\n<li>Switch to compressed, extensible snapshots.</li>\r\n<li>Compile returns to frames below the start frame.</li>\r\n<li>Improve alias analysis of upvalues using a disambiguation hash value.</li>\r\n<li>Compile floor/ceil/trunc to SSE2 helper calls or SSE4.1 instructions.</li>\r\n<li>Add generic C call handling to IR and backend.</li>\r\n<li>Improve KNUM fuse vs. load heuristics.</li>\r\n<li>Compile various <tt>io.*()</tt> functions.</li>\r\n<li>Compile <tt>math.sinh()</tt>, <tt>math.cosh()</tt>, <tt>math.tanh()</tt>\r\nand <tt>math.random()</tt>.</li>\r\n</ul></li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta2\">LuaJIT 2.0.0-beta2 &mdash; 2009-11-09</h2>\r\n<ul>\r\n<li>Reorganize build system. Build static+shared library on POSIX.</li>\r\n<li>Allow C++ exception conversion on all platforms\r\nusing a wrapper function.</li>\r\n<li>Automatically catch C++ exceptions and rethrow Lua error\r\n(DWARF2 only).</li>\r\n<li>Check for the correct x87 FPU precision at strategic points.</li>\r\n<li>Always use wrappers for libm functions.</li>\r\n<li>Resurrect metamethod name strings before copying them.</li>\r\n<li>Mark current trace, even if compiler is idle.</li>\r\n<li>Ensure FILE metatable is created only once.</li>\r\n<li>Fix type comparisons when different integer types are involved.</li>\r\n<li>Fix <tt>getmetatable()</tt> recording.</li>\r\n<li>Fix TDUP with dead keys in template table.</li>\r\n<li><tt>jit.flush(tr)</tt> returns status.\r\nPrevent manual flush of a trace that's still linked.</li>\r\n<li>Improve register allocation heuristics for invariant references.</li>\r\n<li>Compile the push/pop variants of <tt>table.insert()</tt> and\r\n<tt>table.remove()</tt>.</li>\r\n<li>Compatibility with MSVC <tt>link&nbsp/debug</tt>.</li>\r\n<li>Fix <tt>lua_iscfunction()</tt>.</li>\r\n<li>Fix <tt>math.random()</tt> when compiled with <tt>-fpic</tt> (OSX).</li>\r\n<li>Fix <tt>table.maxn()</tt>.</li>\r\n<li>Bump <tt>MACOSX_DEPLOYMENT_TARGET</tt> to <tt>10.4</tt></li>\r\n<li><tt>luaL_check*()</tt> and <tt>luaL_opt*()</tt> now support\r\nnegative arguments, too.<br>\r\nThis matches the behavior of Lua 5.1, but not the specification.</li>\r\n</ul>\r\n\r\n<h2 id=\"LuaJIT-2.0.0-beta1\">LuaJIT 2.0.0-beta1 &mdash; 2009-10-31</h2>\r\n<ul>\r\n<li>This is the first public release of LuaJIT 2.0.</li>\r\n<li>The whole VM has been rewritten from the ground up, so there's\r\nno point in listing differences over earlier versions.</li>\r\n</ul>\r\n</div>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/contact.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Contact</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Contact</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nPlease send general questions to the\r\n<a href=\"http://luajit.org/list.html\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT mailing list</a>.\r\nYou can also send any questions you have directly to me:\r\n</p>\r\n\r\n<script type=\"text/javascript\">\r\n<!--\r\nvar xS=\"@-:\\\" .0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ<abc>defghijklmnopqrstuvwxyz\";function xD(s)\r\n{var len=s.length;var r=\"\";for(var i=0;i<len;i++)\r\n{var c=s.charAt(i);var n=xS.indexOf(c);if(n!=-1)c=xS.charAt(69-n);r+=c;}\r\ndocument.write(\"<\"+\"p>\"+r+\"<\"+\"/p>\\n\");}\r\n//-->\r\n</script>\r\n<script type=\"text/javascript\">\r\n<!--\r\nxD(\"fyZKB8xv\\\"FJytmz8.KAB0u52D\")\r\n//--></script>\r\n<noscript>\r\n<p><img src=\"img/contact.png\" alt=\"Contact info in image\" width=\"170\" height=\"13\">\r\n</p>\r\n</noscript>\r\n\r\n<h2>Copyright</h2>\r\n<p>\r\nAll documentation is\r\nCopyright &copy; 2005-2015 Mike Pall.\r\n</p>\r\n\r\n\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_c_api.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Lua/C API Extensions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Lua/C API Extensions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT adds some extensions to the standard Lua/C API. The LuaJIT include\r\ndirectory must be in the compiler search path (<tt>-I<i>path</i></tt>)\r\nto be able to include the required header for C code:\r\n</p>\r\n<pre class=\"code\">\r\n#include \"luajit.h\"\r\n</pre>\r\n<p>\r\nOr for C++ code:\r\n</p>\r\n<pre class=\"code\">\r\n#include \"lua.hpp\"\r\n</pre>\r\n\r\n<h2 id=\"luaJIT_setmode\"><tt>luaJIT_setmode(L, idx, mode)</tt>\r\n&mdash; Control VM</h2>\r\n<p>\r\nThis is a C API extension to allow control of the VM from C code. The\r\nfull prototype of <tt>LuaJIT_setmode</tt> is:\r\n</p>\r\n<pre class=\"code\">\r\nLUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);\r\n</pre>\r\n<p>\r\nThe returned status is either success (<tt>1</tt>) or failure (<tt>0</tt>).\r\nThe second argument is either <tt>0</tt> or a stack index (similar to the\r\nother Lua/C API functions).\r\n</p>\r\n<p>\r\nThe third argument specifies the mode, which is 'or'ed with a flag.\r\nThe flag can be <tt>LUAJIT_MODE_OFF</tt> to turn a feature on,\r\n<tt>LUAJIT_MODE_ON</tt> to turn a feature off, or\r\n<tt>LUAJIT_MODE_FLUSH</tt> to flush cached code.\r\n</p>\r\n<p>\r\nThe following modes are defined:\r\n</p>\r\n\r\n<h3 id=\"mode_engine\"><tt>luaJIT_setmode(L, 0, LUAJIT_MODE_ENGINE|flag)</tt></h3>\r\n<p>\r\nTurn the whole JIT compiler on or off or flush the whole cache of compiled code.\r\n</p>\r\n\r\n<h3 id=\"mode_func\"><tt>luaJIT_setmode(L, idx, LUAJIT_MODE_FUNC|flag)</tt><br>\r\n<tt>luaJIT_setmode(L, idx, LUAJIT_MODE_ALLFUNC|flag)</tt><br>\r\n<tt>luaJIT_setmode(L, idx, LUAJIT_MODE_ALLSUBFUNC|flag)</tt></h3>\r\n<p>\r\nThis sets the mode for the function at the stack index <tt>idx</tt> or\r\nthe parent of the calling function (<tt>idx = 0</tt>). It either\r\nenables JIT compilation for a function, disables it and flushes any\r\nalready compiled code or only flushes already compiled code. This\r\napplies recursively to all sub-functions of the function with\r\n<tt>LUAJIT_MODE_ALLFUNC</tt> or only to the sub-functions with\r\n<tt>LUAJIT_MODE_ALLSUBFUNC</tt>.\r\n</p>\r\n\r\n<h3 id=\"mode_trace\"><tt>luaJIT_setmode(L, trace,<br>\r\n&nbsp;&nbsp;LUAJIT_MODE_TRACE|LUAJIT_MODE_FLUSH)</tt></h3>\r\n<p>\r\nFlushes the specified root trace and all of its side traces from the cache.\r\nThe code for the trace will be retained as long as there are any other\r\ntraces which link to it.\r\n</p>\r\n\r\n<h3 id=\"mode_wrapcfunc\"><tt>luaJIT_setmode(L, idx, LUAJIT_MODE_WRAPCFUNC|flag)</tt></h3>\r\n<p>\r\nThis mode defines a wrapper function for calls to C functions. If\r\ncalled with <tt>LUAJIT_MODE_ON</tt>, the stack index at <tt>idx</tt>\r\nmust be a <tt>lightuserdata</tt> object holding a pointer to the wrapper\r\nfunction. From now on all C functions are called through the wrapper\r\nfunction. If called with <tt>LUAJIT_MODE_OFF</tt> this mode is turned\r\noff and all C functions are directly called.\r\n</p>\r\n<p>\r\nThe wrapper function can be used for debugging purposes or to catch\r\nand convert foreign exceptions. But please read the section on\r\n<a href=\"extensions.html#exceptions\">C++&nbsp;exception interoperability</a>\r\nfirst. Recommended usage can be seen in this C++ code excerpt:\r\n</p>\r\n<pre class=\"code\">\r\n#include &lt;exception&gt;\r\n#include \"lua.hpp\"\r\n\r\n// Catch C++ exceptions and convert them to Lua error messages.\r\n// Customize as needed for your own exception classes.\r\nstatic int wrap_exceptions(lua_State *L, lua_CFunction f)\r\n{\r\n  try {\r\n    return f(L);  // Call wrapped function and return result.\r\n  } catch (const char *s) {  // Catch and convert exceptions.\r\n    lua_pushstring(L, s);\r\n  } catch (std::exception& e) {\r\n    lua_pushstring(L, e.what());\r\n  } catch (...) {\r\n    lua_pushliteral(L, \"caught (...)\");\r\n  }\r\n  return lua_error(L);  // Rethrow as a Lua error.\r\n}\r\n\r\nstatic int myinit(lua_State *L)\r\n{\r\n  ...\r\n  // Define wrapper function and enable it.\r\n  lua_pushlightuserdata(L, (void *)wrap_exceptions);\r\n  luaJIT_setmode(L, -1, LUAJIT_MODE_WRAPCFUNC|LUAJIT_MODE_ON);\r\n  lua_pop(L, 1);\r\n  ...\r\n}\r\n</pre>\r\n<p>\r\nNote that you can only define <b>a single global wrapper function</b>,\r\nso be careful when using this mechanism from multiple C++ modules.\r\nAlso note that this mechanism is not without overhead.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_ffi.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Library</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Library</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\n\r\nThe FFI library allows <b>calling external C&nbsp;functions</b> and\r\n<b>using C&nbsp;data structures</b> from pure Lua code.\r\n\r\n</p>\r\n<p>\r\n\r\nThe FFI library largely obviates the need to write tedious manual\r\nLua/C bindings in C. No need to learn a separate binding language\r\n&mdash; <b>it parses plain C&nbsp;declarations!</b> These can be\r\ncut-n-pasted from C&nbsp;header files or reference manuals. It's up to\r\nthe task of binding large libraries without the need for dealing with\r\nfragile binding generators.\r\n\r\n</p>\r\n<p>\r\nThe FFI library is tightly integrated into LuaJIT (it's not available\r\nas a separate module). The code generated by the JIT-compiler for\r\naccesses to C&nbsp;data structures from Lua code is on par with the\r\ncode a C&nbsp;compiler would generate. Calls to C&nbsp;functions can\r\nbe inlined in JIT-compiled code, unlike calls to functions bound via\r\nthe classic Lua/C API.\r\n</p>\r\n<p>\r\nThis page gives a short introduction to the usage of the FFI library.\r\n<em>Please use the FFI sub-topics in the navigation bar to learn more.</em>\r\n</p>\r\n\r\n<h2 id=\"call\">Motivating Example: Calling External C Functions</h2>\r\n<p>\r\nIt's really easy to call an external C&nbsp;library function:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&#9312;\r\n&#9313;\r\n\r\n\r\n&#9314;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">int printf(const char *fmt, ...);</span>\r\n]]\r\nffi.C.printf(\"Hello %s!\", \"world\")\r\n</pre>\r\n<p>\r\nSo, let's pick that apart:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> Load the FFI library.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> Add a C&nbsp;declaration\r\nfor the function. The part inside the double-brackets (in green) is\r\njust standard C&nbsp;syntax.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Call the named\r\nC&nbsp;function &mdash; Yes, it's that simple!\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nActually, what goes on behind the scenes is far from simple: <span\r\nstyle=\"color:#4040c0;\">&#9314;</span> makes use of the standard\r\nC&nbsp;library namespace <tt>ffi.C</tt>. Indexing this namespace with\r\na symbol name (<tt>\"printf\"</tt>) automatically binds it to the\r\nstandard C&nbsp;library. The result is a special kind of object which,\r\nwhen called, runs the <tt>printf</tt> function. The arguments passed\r\nto this function are automatically converted from Lua objects to the\r\ncorresponding C&nbsp;types.\r\n</p>\r\n<p>\r\nOk, so maybe the use of <tt>printf()</tt> wasn't such a spectacular\r\nexample. You could have done that with <tt>io.write()</tt> and\r\n<tt>string.format()</tt>, too. But you get the idea ...\r\n</p>\r\n<p>\r\nSo here's something to pop up a message box on Windows:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">int MessageBoxA(void *w, const char *txt, const char *cap, int type);</span>\r\n]]\r\nffi.C.MessageBoxA(nil, \"Hello world!\", \"Test\", 0)\r\n</pre>\r\n<p>\r\nBing! Again, that was far too easy, no?\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nCompare this with the effort required to bind that function using the\r\nclassic Lua/C API: create an extra C&nbsp;file, add a C&nbsp;function\r\nthat retrieves and checks the argument types passed from Lua and calls\r\nthe actual C&nbsp;function, add a list of module functions and their\r\nnames, add a <tt>luaopen_*</tt> function and register all module\r\nfunctions, compile and link it into a shared library (DLL), move it to\r\nthe proper path, add Lua code that loads the module aaaand ... finally\r\ncall the binding function. Phew!\r\n</p>\r\n\r\n<h2 id=\"cdata\">Motivating Example: Using C Data Structures</h2>\r\n<p>\r\nThe FFI library allows you to create and access C&nbsp;data\r\nstructures. Of course the main use for this is for interfacing with\r\nC&nbsp;functions. But they can be used stand-alone, too.\r\n</p>\r\n<p>\r\nLua is built upon high-level data types. They are flexible, extensible\r\nand dynamic. That's why we all love Lua so much. Alas, this can be\r\ninefficient for certain tasks, where you'd really want a low-level\r\ndata type. E.g. a large array of a fixed structure needs to be\r\nimplemented with a big table holding lots of tiny tables. This imposes\r\nboth a substantial memory overhead as well as a performance overhead.\r\n</p>\r\n<p>\r\nHere's a sketch of a library that operates on color images plus a\r\nsimple benchmark. First, the plain Lua version:\r\n</p>\r\n<pre class=\"code\">\r\nlocal floor = math.floor\r\n\r\nlocal function image_ramp_green(n)\r\n  local img = {}\r\n  local f = 255/(n-1)\r\n  for i=1,n do\r\n    img[i] = { red = 0, green = floor((i-1)*f), blue = 0, alpha = 255 }\r\n  end\r\n  return img\r\nend\r\n\r\nlocal function image_to_grey(img, n)\r\n  for i=1,n do\r\n    local y = floor(0.3*img[i].red + 0.59*img[i].green + 0.11*img[i].blue)\r\n    img[i].red = y; img[i].green = y; img[i].blue = y\r\n  end\r\nend\r\n\r\nlocal N = 400*400\r\nlocal img = image_ramp_green(N)\r\nfor i=1,1000 do\r\n  image_to_grey(img, N)\r\nend\r\n</pre>\r\n<p>\r\nThis creates a table with 160.000 pixels, each of which is a table\r\nholding four number values in the range of 0-255. First an image with\r\na green ramp is created (1D for simplicity), then the image is\r\nconverted to greyscale 1000 times. Yes, that's silly, but I was in\r\nneed of a simple example ...\r\n</p>\r\n<p>\r\nAnd here's the FFI version. The modified parts have been marked in\r\nbold:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&#9312;\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n\r\n&#9314;\r\n&#9315;\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9314;\r\n&#9316;</span><b>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n</b><span style=\"color:#00a000;\">typedef struct { uint8_t red, green, blue, alpha; } rgba_pixel;</span><b>\r\n]]</b>\r\n\r\nlocal function image_ramp_green(n)\r\n  <b>local img = ffi.new(\"rgba_pixel[?]\", n)</b>\r\n  local f = 255/(n-1)\r\n  for i=<b>0,n-1</b> do\r\n    <b>img[i].green = i*f</b>\r\n    <b>img[i].alpha = 255</b>\r\n  end\r\n  return img\r\nend\r\n\r\nlocal function image_to_grey(img, n)\r\n  for i=<b>0,n-1</b> do\r\n    local y = <b>0.3*img[i].red + 0.59*img[i].green + 0.11*img[i].blue</b>\r\n    img[i].red = y; img[i].green = y; img[i].blue = y\r\n  end\r\nend\r\n\r\nlocal N = 400*400\r\nlocal img = image_ramp_green(N)\r\nfor i=1,1000 do\r\n  image_to_grey(img, N)\r\nend\r\n</pre>\r\n<p>\r\nOk, so that wasn't too difficult:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> First, load the FFI\r\nlibrary and declare the low-level data type. Here we choose a\r\n<tt>struct</tt> which holds four byte fields, one for each component\r\nof a 4x8&nbsp;bit RGBA pixel.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> Creating the data\r\nstructure with <tt>ffi.new()</tt> is straightforward &mdash; the\r\n<tt>'?'</tt> is a placeholder for the number of elements of a\r\nvariable-length array.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> C&nbsp;arrays are\r\nzero-based, so the indexes have to run from <tt>0</tt> to\r\n<tt>n-1</tt>. One might want to allocate one more element instead to\r\nsimplify converting legacy code.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> Since <tt>ffi.new()</tt>\r\nzero-fills the array by default, we only need to set the green and the\r\nalpha fields.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> The calls to\r\n<tt>math.floor()</tt> can be omitted here, because floating-point\r\nnumbers are already truncated towards zero when converting them to an\r\ninteger. This happens implicitly when the number is stored in the\r\nfields of each pixel.\r\n</p>\r\n<p>\r\nNow let's have a look at the impact of the changes: first, memory\r\nconsumption for the image is down from 22&nbsp;Megabytes to\r\n640&nbsp;Kilobytes (400*400*4 bytes). That's a factor of 35x less! So,\r\nyes, tables do have a noticeable overhead. BTW: The original program\r\nwould consume 40&nbsp;Megabytes in plain Lua (on x64).\r\n</p>\r\n<p>\r\nNext, performance: the pure Lua version runs in 9.57 seconds (52.9\r\nseconds with the Lua interpreter) and the FFI version runs in 0.48\r\nseconds on my machine (YMMV). That's a factor of 20x faster (110x\r\nfaster than the Lua interpreter).\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nThe avid reader may notice that converting the pure Lua version over\r\nto use array indexes for the colors (<tt>[1]</tt> instead of\r\n<tt>.red</tt>, <tt>[2]</tt> instead of <tt>.green</tt> etc.) ought to\r\nbe more compact and faster. This is certainly true (by a factor of\r\n~1.7x). Switching to a struct-of-arrays would help, too.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nHowever the resulting code would be less idiomatic and rather\r\nerror-prone. And it still doesn't get even close to the performance of\r\nthe FFI version of the code. Also, high-level data structures cannot\r\nbe easily passed to other C&nbsp;functions, especially I/O functions,\r\nwithout undue conversion penalties.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_ffi_api.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>ffi.* API Functions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.abitable { width: 30em; line-height: 1.2; }\r\ntr.abihead td { font-weight: bold; }\r\ntd.abiparam { font-weight: bold; width: 6em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1><tt>ffi.*</tt> API Functions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page describes the API functions provided by the FFI library in\r\ndetail. It's recommended to read through the\r\n<a href=\"ext_ffi.html\">introduction</a> and the\r\n<a href=\"ext_ffi_tutorial.html\">FFI tutorial</a> first.\r\n</p>\r\n\r\n<h2 id=\"glossary\">Glossary</h2>\r\n<ul>\r\n<li><b>cdecl</b> &mdash; An abstract C&nbsp;type declaration (a Lua\r\nstring).</li>\r\n<li><b>ctype</b> &mdash; A C&nbsp;type object. This is a special kind of\r\n<b>cdata</b> returned by <tt>ffi.typeof()</tt>. It serves as a\r\n<b>cdata</b> <a href=\"#ffi_new\">constructor</a> when called.</li>\r\n<li><b>cdata</b> &mdash; A C&nbsp;data object. It holds a value of the\r\ncorresponding <b>ctype</b>.</li>\r\n<li><b>ct</b> &mdash; A C&nbsp;type specification which can be used for\r\nmost of the API functions. Either a <b>cdecl</b>, a <b>ctype</b> or a\r\n<b>cdata</b> serving as a template type.</li>\r\n<li><b>cb</b> &mdash; A callback object. This is a C&nbsp;data object\r\nholding a special function pointer. Calling this function from\r\nC&nbsp;code runs an associated Lua function.</li>\r\n<li><b>VLA</b> &mdash; A variable-length array is declared with a\r\n<tt>?</tt> instead of the number of elements, e.g. <tt>\"int[?]\"</tt>.\r\nThe number of elements (<tt>nelem</tt>) must be given when it's\r\n<a href=\"#ffi_new\">created</a>.</li>\r\n<li><b>VLS</b> &mdash; A variable-length struct is a <tt>struct</tt> C\r\ntype where the last element is a <b>VLA</b>. The same rules for\r\ndeclaration and creation apply.</li>\r\n</ul>\r\n\r\n<h2 id=\"decl\">Declaring and Accessing External Symbols</h2>\r\n<p>\r\nExternal symbols must be declared first and can then be accessed by\r\nindexing a <a href=\"ext_ffi_semantics.html#clib\">C&nbsp;library\r\nnamespace</a>, which automatically binds the symbol to a specific\r\nlibrary.\r\n</p>\r\n\r\n<h3 id=\"ffi_cdef\"><tt>ffi.cdef(def)</tt></h3>\r\n<p>\r\nAdds multiple C&nbsp;declarations for types or external symbols (named\r\nvariables or functions). <tt>def</tt> must be a Lua string. It's\r\nrecommended to use the syntactic sugar for string arguments as\r\nfollows:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">typedef struct foo { int a, b; } foo_t;  // Declare a struct and typedef.\r\nint dofoo(foo_t *f, int n);  /* Declare an external C function. */</span>\r\n]]\r\n</pre>\r\n<p>\r\nThe contents of the string (the part in green above) must be a\r\nsequence of\r\n<a href=\"ext_ffi_semantics.html#clang\">C&nbsp;declarations</a>,\r\nseparated by semicolons. The trailing semicolon for a single\r\ndeclaration may be omitted.\r\n</p>\r\n<p>\r\nPlease note that external symbols are only <em>declared</em>, but they\r\nare <em>not bound</em> to any specific address, yet. Binding is\r\nachieved with C&nbsp;library namespaces (see below).\r\n</p>\r\n<p style=\"color: #c00000;\">\r\nC&nbsp;declarations are not passed through a C&nbsp;pre-processor,\r\nyet. No pre-processor tokens are allowed, except for\r\n<tt>#pragma&nbsp;pack</tt>. Replace <tt>#define</tt> in existing\r\nC&nbsp;header files with <tt>enum</tt>, <tt>static&nbsp;const</tt>\r\nor <tt>typedef</tt> and/or pass the files through an external\r\nC&nbsp;pre-processor (once). Be careful not to include unneeded or\r\nredundant declarations from unrelated header files.\r\n</p>\r\n\r\n<h3 id=\"ffi_C\"><tt>ffi.C</tt></h3>\r\n<p>\r\nThis is the default C&nbsp;library namespace &mdash; note the\r\nuppercase <tt>'C'</tt>. It binds to the default set of symbols or\r\nlibraries on the target system. These are more or less the same as a\r\nC&nbsp;compiler would offer by default, without specifying extra link\r\nlibraries.\r\n</p>\r\n<p>\r\nOn POSIX systems, this binds to symbols in the default or global\r\nnamespace. This includes all exported symbols from the executable and\r\nany libraries loaded into the global namespace. This includes at least\r\n<tt>libc</tt>, <tt>libm</tt>, <tt>libdl</tt> (on Linux),\r\n<tt>libgcc</tt> (if compiled with GCC), as well as any exported\r\nsymbols from the Lua/C&nbsp;API provided by LuaJIT itself.\r\n</p>\r\n<p>\r\nOn Windows systems, this binds to symbols exported from the\r\n<tt>*.exe</tt>, the <tt>lua51.dll</tt> (i.e. the Lua/C&nbsp;API\r\nprovided by LuaJIT itself), the C&nbsp;runtime library LuaJIT was linked\r\nwith (<tt>msvcrt*.dll</tt>), <tt>kernel32.dll</tt>,\r\n<tt>user32.dll</tt> and <tt>gdi32.dll</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_load\"><tt>clib = ffi.load(name [,global])</tt></h3>\r\n<p>\r\nThis loads the dynamic library given by <tt>name</tt> and returns\r\na new C&nbsp;library namespace which binds to its symbols. On POSIX\r\nsystems, if <tt>global</tt> is <tt>true</tt>, the library symbols are\r\nloaded into the global namespace, too.\r\n</p>\r\n<p>\r\nIf <tt>name</tt> is a path, the library is loaded from this path.\r\nOtherwise <tt>name</tt> is canonicalized in a system-dependent way and\r\nsearched in the default search path for dynamic libraries:\r\n</p>\r\n<p>\r\nOn POSIX systems, if the name contains no dot, the extension\r\n<tt>.so</tt> is appended. Also, the <tt>lib</tt> prefix is prepended\r\nif necessary. So <tt>ffi.load(\"z\")</tt> looks for <tt>\"libz.so\"</tt>\r\nin the default shared library search path.\r\n</p>\r\n<p>\r\nOn Windows systems, if the name contains no dot, the extension\r\n<tt>.dll</tt> is appended. So <tt>ffi.load(\"ws2_32\")</tt> looks for\r\n<tt>\"ws2_32.dll\"</tt> in the default DLL search path.\r\n</p>\r\n\r\n<h2 id=\"create\">Creating cdata Objects</h2>\r\n<p>\r\nThe following API functions create cdata objects (<tt>type()</tt>\r\nreturns <tt>\"cdata\"</tt>). All created cdata objects are\r\n<a href=\"ext_ffi_semantics.html#gc\">garbage collected</a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_new\"><tt>cdata = ffi.new(ct [,nelem] [,init...])<br>\r\ncdata = <em>ctype</em>([nelem,] [init...])</tt></h3>\r\n<p>\r\nCreates a cdata object for the given <tt>ct</tt>. VLA/VLS types\r\nrequire the <tt>nelem</tt> argument. The second syntax uses a ctype as\r\na constructor and is otherwise fully equivalent.\r\n</p>\r\n<p>\r\nThe cdata object is initialized according to the\r\n<a href=\"ext_ffi_semantics.html#init\">rules for initializers</a>,\r\nusing the optional <tt>init</tt> arguments. Excess initializers cause\r\nan error.\r\n</p>\r\n<p>\r\nPerformance notice: if you want to create many objects of one kind,\r\nparse the cdecl only once and get its ctype with\r\n<tt>ffi.typeof()</tt>. Then use the ctype as a constructor repeatedly.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nPlease note that an anonymous <tt>struct</tt> declaration implicitly\r\ncreates a new and distinguished ctype every time you use it for\r\n<tt>ffi.new()</tt>. This is probably <b>not</b> what you want,\r\nespecially if you create more than one cdata object. Different anonymous\r\n<tt>structs</tt> are not considered assignment-compatible by the\r\nC&nbsp;standard, even though they may have the same fields! Also, they\r\nare considered different types by the JIT-compiler, which may cause an\r\nexcessive number of traces. It's strongly suggested to either declare\r\na named <tt>struct</tt> or <tt>typedef</tt> with <tt>ffi.cdef()</tt>\r\nor to create a single ctype object for an anonymous <tt>struct</tt>\r\nwith <tt>ffi.typeof()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_typeof\"><tt>ctype = ffi.typeof(ct)</tt></h3>\r\n<p>\r\nCreates a ctype object for the given <tt>ct</tt>.\r\n</p>\r\n<p>\r\nThis function is especially useful to parse a cdecl only once and then\r\nuse the resulting ctype object as a <a href=\"#ffi_new\">constructor</a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_cast\"><tt>cdata = ffi.cast(ct, init)</tt></h3>\r\n<p>\r\nCreates a scalar cdata object for the given <tt>ct</tt>. The cdata\r\nobject is initialized with <tt>init</tt> using the \"cast\" variant of\r\nthe <a href=\"ext_ffi_semantics.html#convert\">C&nbsp;type conversion\r\nrules</a>.\r\n</p>\r\n<p>\r\nThis functions is mainly useful to override the pointer compatibility\r\nchecks or to convert pointers to addresses or vice versa.\r\n</p>\r\n\r\n<h3 id=\"ffi_metatype\"><tt>ctype = ffi.metatype(ct, metatable)</tt></h3>\r\n<p>\r\nCreates a ctype object for the given <tt>ct</tt> and associates it with\r\na metatable. Only <tt>struct</tt>/<tt>union</tt> types, complex numbers\r\nand vectors are allowed. Other types may be wrapped in a\r\n<tt>struct</tt>, if needed.\r\n</p>\r\n<p>\r\nThe association with a metatable is permanent and cannot be changed\r\nafterwards. Neither the contents of the <tt>metatable</tt> nor the\r\ncontents of an <tt>__index</tt> table (if any) may be modified\r\nafterwards. The associated metatable automatically applies to all uses\r\nof this type, no matter how the objects are created or where they\r\noriginate from. Note that pre-defined operations on types have\r\nprecedence (e.g. declared field names cannot be overriden).\r\n</p>\r\n<p>\r\nAll standard Lua metamethods are implemented. These are called directly,\r\nwithout shortcuts and on any mix of types. For binary operations, the\r\nleft operand is checked first for a valid ctype metamethod. The\r\n<tt>__gc</tt> metamethod only applies to <tt>struct</tt>/<tt>union</tt>\r\ntypes and performs an implicit <a href=\"#ffi_gc\"><tt>ffi.gc()</tt></a>\r\ncall during creation of an instance.\r\n</p>\r\n\r\n<h3 id=\"ffi_gc\"><tt>cdata = ffi.gc(cdata, finalizer)</tt></h3>\r\n<p>\r\nAssociates a finalizer with a pointer or aggregate cdata object. The\r\ncdata object is returned unchanged.\r\n</p>\r\n<p>\r\nThis function allows safe integration of unmanaged resources into the\r\nautomatic memory management of the LuaJIT garbage collector. Typical\r\nusage:\r\n</p>\r\n<pre class=\"code\">\r\nlocal p = ffi.gc(ffi.C.malloc(n), ffi.C.free)\r\n...\r\np = nil -- Last reference to p is gone.\r\n-- GC will eventually run finalizer: ffi.C.free(p)\r\n</pre>\r\n<p>\r\nA cdata finalizer works like the <tt>__gc</tt> metamethod for userdata\r\nobjects: when the last reference to a cdata object is gone, the\r\nassociated finalizer is called with the cdata object as an argument. The\r\nfinalizer can be a Lua function or a cdata function or cdata function\r\npointer. An existing finalizer can be removed by setting a <tt>nil</tt>\r\nfinalizer, e.g. right before explicitly deleting a resource:\r\n</p>\r\n<pre class=\"code\">\r\nffi.C.free(ffi.gc(p, nil)) -- Manually free the memory.\r\n</pre>\r\n\r\n<h2 id=\"info\">C&nbsp;Type Information</h2>\r\n<p>\r\nThe following API functions return information about C&nbsp;types.\r\nThey are most useful for inspecting cdata objects.\r\n</p>\r\n\r\n<h3 id=\"ffi_sizeof\"><tt>size = ffi.sizeof(ct [,nelem])</tt></h3>\r\n<p>\r\nReturns the size of <tt>ct</tt> in bytes. Returns <tt>nil</tt> if\r\nthe size is not known (e.g. for <tt>\"void\"</tt> or function types).\r\nRequires <tt>nelem</tt> for VLA/VLS types, except for cdata objects.\r\n</p>\r\n\r\n<h3 id=\"ffi_alignof\"><tt>align = ffi.alignof(ct)</tt></h3>\r\n<p>\r\nReturns the minimum required alignment for <tt>ct</tt> in bytes.\r\n</p>\r\n\r\n<h3 id=\"ffi_offsetof\"><tt>ofs [,bpos,bsize] = ffi.offsetof(ct, field)</tt></h3>\r\n<p>\r\nReturns the offset (in bytes) of <tt>field</tt> relative to the start\r\nof <tt>ct</tt>, which must be a <tt>struct</tt>. Additionally returns\r\nthe position and the field size (in bits) for bit fields.\r\n</p>\r\n\r\n<h3 id=\"ffi_istype\"><tt>status = ffi.istype(ct, obj)</tt></h3>\r\n<p>\r\nReturns <tt>true</tt> if <tt>obj</tt> has the C&nbsp;type given by\r\n<tt>ct</tt>. Returns <tt>false</tt> otherwise.\r\n</p>\r\n<p>\r\nC&nbsp;type qualifiers (<tt>const</tt> etc.) are ignored. Pointers are\r\nchecked with the standard pointer compatibility rules, but without any\r\nspecial treatment for <tt>void&nbsp;*</tt>. If <tt>ct</tt> specifies a\r\n<tt>struct</tt>/<tt>union</tt>, then a pointer to this type is accepted,\r\ntoo. Otherwise the types must match exactly.\r\n</p>\r\n<p>\r\nNote: this function accepts all kinds of Lua objects for the\r\n<tt>obj</tt> argument, but always returns <tt>false</tt> for non-cdata\r\nobjects.\r\n</p>\r\n\r\n<h2 id=\"util\">Utility Functions</h2>\r\n\r\n<h3 id=\"ffi_errno\"><tt>err = ffi.errno([newerr])</tt></h3>\r\n<p>\r\nReturns the error number set by the last C&nbsp;function call which\r\nindicated an error condition. If the optional <tt>newerr</tt> argument\r\nis present, the error number is set to the new value and the previous\r\nvalue is returned.\r\n</p>\r\n<p>\r\nThis function offers a portable and OS-independent way to get and set the\r\nerror number. Note that only <em>some</em> C&nbsp;functions set the error\r\nnumber. And it's only significant if the function actually indicated an\r\nerror condition (e.g. with a return value of <tt>-1</tt> or\r\n<tt>NULL</tt>). Otherwise, it may or may not contain any previously set\r\nvalue.\r\n</p>\r\n<p>\r\nYou're advised to call this function only when needed and as close as\r\npossible after the return of the related C&nbsp;function. The\r\n<tt>errno</tt> value is preserved across hooks, memory allocations,\r\ninvocations of the JIT compiler and other internal VM activity. The same\r\napplies to the value returned by <tt>GetLastError()</tt> on Windows, but\r\nyou need to declare and call it yourself.\r\n</p>\r\n\r\n<h3 id=\"ffi_string\"><tt>str = ffi.string(ptr [,len])</tt></h3>\r\n<p>\r\nCreates an interned Lua string from the data pointed to by\r\n<tt>ptr</tt>.\r\n</p>\r\n<p>\r\nIf the optional argument <tt>len</tt> is missing, <tt>ptr</tt> is\r\nconverted to a <tt>\"char&nbsp;*\"</tt> and the data is assumed to be\r\nzero-terminated. The length of the string is computed with\r\n<tt>strlen()</tt>.\r\n</p>\r\n<p>\r\nOtherwise <tt>ptr</tt> is converted to a <tt>\"void&nbsp;*\"</tt> and\r\n<tt>len</tt> gives the length of the data. The data may contain\r\nembedded zeros and need not be byte-oriented (though this may cause\r\nendianess issues).\r\n</p>\r\n<p>\r\nThis function is mainly useful to convert (temporary)\r\n<tt>\"const&nbsp;char&nbsp;*\"</tt> pointers returned by\r\nC&nbsp;functions to Lua strings and store them or pass them to other\r\nfunctions expecting a Lua string. The Lua string is an (interned) copy\r\nof the data and bears no relation to the original data area anymore.\r\nLua strings are 8&nbsp;bit clean and may be used to hold arbitrary,\r\nnon-character data.\r\n</p>\r\n<p>\r\nPerformance notice: it's faster to pass the length of the string, if\r\nit's known. E.g. when the length is returned by a C&nbsp;call like\r\n<tt>sprintf()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_copy\"><tt>ffi.copy(dst, src, len)<br>\r\nffi.copy(dst, str)</tt></h3>\r\n<p>\r\nCopies the data pointed to by <tt>src</tt> to <tt>dst</tt>.\r\n<tt>dst</tt> is converted to a <tt>\"void&nbsp;*\"</tt> and <tt>src</tt>\r\nis converted to a <tt>\"const void&nbsp;*\"</tt>.\r\n</p>\r\n<p>\r\nIn the first syntax, <tt>len</tt> gives the number of bytes to copy.\r\nCaveat: if <tt>src</tt> is a Lua string, then <tt>len</tt> must not\r\nexceed <tt>#src+1</tt>.\r\n</p>\r\n<p>\r\nIn the second syntax, the source of the copy must be a Lua string. All\r\nbytes of the string <em>plus a zero-terminator</em> are copied to\r\n<tt>dst</tt> (i.e. <tt>#src+1</tt> bytes).\r\n</p>\r\n<p>\r\nPerformance notice: <tt>ffi.copy()</tt> may be used as a faster\r\n(inlinable) replacement for the C&nbsp;library functions\r\n<tt>memcpy()</tt>, <tt>strcpy()</tt> and <tt>strncpy()</tt>.\r\n</p>\r\n\r\n<h3 id=\"ffi_fill\"><tt>ffi.fill(dst, len [,c])</tt></h3>\r\n<p>\r\nFills the data pointed to by <tt>dst</tt> with <tt>len</tt> constant\r\nbytes, given by <tt>c</tt>. If <tt>c</tt> is omitted, the data is\r\nzero-filled.\r\n</p>\r\n<p>\r\nPerformance notice: <tt>ffi.fill()</tt> may be used as a faster\r\n(inlinable) replacement for the C&nbsp;library function\r\n<tt>memset(dst,&nbsp;c,&nbsp;len)</tt>. Please note the different\r\norder of arguments!\r\n</p>\r\n\r\n<h2 id=\"target\">Target-specific Information</h2>\r\n\r\n<h3 id=\"ffi_abi\"><tt>status = ffi.abi(param)</tt></h3>\r\n<p>\r\nReturns <tt>true</tt> if <tt>param</tt> (a Lua string) applies for the\r\ntarget ABI (Application Binary Interface). Returns <tt>false</tt>\r\notherwise. The following parameters are currently defined:\r\n</p>\r\n<table class=\"abitable\">\r\n<tr class=\"abihead\">\r\n<td class=\"abiparam\">Parameter</td>\r\n<td class=\"abidesc\">Description</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">32bit</td><td class=\"abidesc\">32 bit architecture</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">64bit</td><td class=\"abidesc\">64 bit architecture</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">le</td><td class=\"abidesc\">Little-endian architecture</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">be</td><td class=\"abidesc\">Big-endian architecture</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"abiparam\">fpu</td><td class=\"abidesc\">Target has a hardware FPU</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">softfp</td><td class=\"abidesc\">softfp calling conventions</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"abiparam\">hardfp</td><td class=\"abidesc\">hardfp calling conventions</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"abiparam\">eabi</td><td class=\"abidesc\">EABI variant of the standard ABI</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"abiparam\">win</td><td class=\"abidesc\">Windows variant of the standard ABI</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"abiparam\">gc64</td><td class=\"abidesc\">64 bit GC references</td></tr>\r\n</table>\r\n\r\n<h3 id=\"ffi_os\"><tt>ffi.os</tt></h3>\r\n<p>\r\nContains the target OS name. Same contents as\r\n<a href=\"ext_jit.html#jit_os\"><tt>jit.os</tt></a>.\r\n</p>\r\n\r\n<h3 id=\"ffi_arch\"><tt>ffi.arch</tt></h3>\r\n<p>\r\nContains the target architecture name. Same contents as\r\n<a href=\"ext_jit.html#jit_arch\"><tt>jit.arch</tt></a>.\r\n</p>\r\n\r\n<h2 id=\"callback\">Methods for Callbacks</h2>\r\n<p>\r\nThe C&nbsp;types for <a href=\"ext_ffi_semantics.html#callback\">callbacks</a>\r\nhave some extra methods:\r\n</p>\r\n\r\n<h3 id=\"callback_free\"><tt>cb:free()</tt></h3>\r\n<p>\r\nFree the resources associated with a callback. The associated Lua\r\nfunction is unanchored and may be garbage collected. The callback\r\nfunction pointer is no longer valid and must not be called anymore\r\n(it may be reused by a subsequently created callback).\r\n</p>\r\n\r\n<h3 id=\"callback_set\"><tt>cb:set(func)</tt></h3>\r\n<p>\r\nAssociate a new Lua function with a callback. The C&nbsp;type of the\r\ncallback and the callback function pointer are unchanged.\r\n</p>\r\n<p>\r\nThis method is useful to dynamically switch the receiver of callbacks\r\nwithout creating a new callback each time and registering it again (e.g.\r\nwith a GUI library).\r\n</p>\r\n\r\n<h2 id=\"extended\">Extended Standard Library Functions</h2>\r\n<p>\r\nThe following standard library functions have been extended to work\r\nwith cdata objects:\r\n</p>\r\n\r\n<h3 id=\"tonumber\"><tt>n = tonumber(cdata)</tt></h3>\r\n<p>\r\nConverts a number cdata object to a <tt>double</tt> and returns it as\r\na Lua number. This is particularly useful for boxed 64&nbsp;bit\r\ninteger values. Caveat: this conversion may incur a precision loss.\r\n</p>\r\n\r\n<h3 id=\"tostring\"><tt>s = tostring(cdata)</tt></h3>\r\n<p>\r\nReturns a string representation of the value of 64&nbsp;bit integers\r\n(<tt><b>\"</b>nnn<b>LL\"</b></tt> or <tt><b>\"</b>nnn<b>ULL\"</b></tt>) or\r\ncomplex numbers (<tt><b>\"</b>re&plusmn;im<b>i\"</b></tt>). Otherwise\r\nreturns a string representation of the C&nbsp;type of a ctype object\r\n(<tt><b>\"ctype&lt;</b>type<b>&gt;\"</b></tt>) or a cdata object\r\n(<tt><b>\"cdata&lt;</b>type<b>&gt;:&nbsp;</b>address\"</tt>), unless you\r\noverride it with a <tt>__tostring</tt> metamethod (see\r\n<a href=\"#ffi_metatype\"><tt>ffi.metatype()</tt></a>).\r\n</p>\r\n\r\n<h3 id=\"pairs\"><tt>iter, obj, start = pairs(cdata)<br>\r\niter, obj, start = ipairs(cdata)<br></tt></h3>\r\n<p>\r\nCalls the <tt>__pairs</tt> or <tt>__ipairs</tt> metamethod of the\r\ncorresponding ctype.\r\n</p>\r\n\r\n<h2 id=\"literals\">Extensions to the Lua Parser</h2>\r\n<p>\r\nThe parser for Lua source code treats numeric literals with the\r\nsuffixes <tt>LL</tt> or <tt>ULL</tt> as signed or unsigned 64&nbsp;bit\r\nintegers. Case doesn't matter, but uppercase is recommended for\r\nreadability. It handles decimal (<tt>42LL</tt>), hexadecimal\r\n(<tt>0x2aLL</tt>) and binary (<tt>0b101010LL</tt>) literals.\r\n</p>\r\n<p>\r\nThe imaginary part of complex numbers can be specified by suffixing\r\nnumber literals with <tt>i</tt> or <tt>I</tt>, e.g. <tt>12.5i</tt>.\r\nCaveat: you'll need to use <tt>1i</tt> to get an imaginary part with\r\nthe value one, since <tt>i</tt> itself still refers to a variable\r\nnamed <tt>i</tt>.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_ffi_semantics.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Semantics</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.convtable { line-height: 1.2; }\r\ntr.convhead td { font-weight: bold; }\r\ntd.convop { font-style: italic; width: 40%; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Semantics</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page describes the detailed semantics underlying the FFI library\r\nand its interaction with both Lua and C&nbsp;code.\r\n</p>\r\n<p>\r\nGiven that the FFI library is designed to interface with C&nbsp;code\r\nand that declarations can be written in plain C&nbsp;syntax, <b>it\r\nclosely follows the C&nbsp;language semantics</b>, wherever possible.\r\nSome minor concessions are needed for smoother interoperation with Lua\r\nlanguage semantics.\r\n</p>\r\n<p>\r\nPlease don't be overwhelmed by the contents of this page &mdash; this\r\nis a reference and you may need to consult it, if in doubt. It doesn't\r\nhurt to skim this page, but most of the semantics \"just work\" as you'd\r\nexpect them to work. It should be straightforward to write\r\napplications using the LuaJIT FFI for developers with a C or C++\r\nbackground.\r\n</p>\r\n\r\n<h2 id=\"clang\">C Language Support</h2>\r\n<p>\r\nThe FFI library has a built-in C&nbsp;parser with a minimal memory\r\nfootprint. It's used by the <a href=\"ext_ffi_api.html\">ffi.* library\r\nfunctions</a> to declare C&nbsp;types or external symbols.\r\n</p>\r\n<p>\r\nIt's only purpose is to parse C&nbsp;declarations, as found e.g. in\r\nC&nbsp;header files. Although it does evaluate constant expressions,\r\nit's <em>not</em> a C&nbsp;compiler. The body of <tt>inline</tt>\r\nC&nbsp;function definitions is simply ignored.\r\n</p>\r\n<p>\r\nAlso, this is <em>not</em> a validating C&nbsp;parser. It expects and\r\naccepts correctly formed C&nbsp;declarations, but it may choose to\r\nignore bad declarations or show rather generic error messages. If in\r\ndoubt, please check the input against your favorite C&nbsp;compiler.\r\n</p>\r\n<p>\r\nThe C&nbsp;parser complies to the <b>C99 language standard</b> plus\r\nthe following extensions:\r\n</p>\r\n<ul>\r\n\r\n<li>The <tt>'\\e'</tt> escape in character and string literals.</li>\r\n\r\n<li>The C99/C++ boolean type, declared with the keywords <tt>bool</tt>\r\nor <tt>_Bool</tt>.</li>\r\n\r\n<li>Complex numbers, declared with the keywords <tt>complex</tt> or\r\n<tt>_Complex</tt>.</li>\r\n\r\n<li>Two complex number types: <tt>complex</tt> (aka\r\n<tt>complex&nbsp;double</tt>) and <tt>complex&nbsp;float</tt>.</li>\r\n\r\n<li>Vector types, declared with the GCC <tt>mode</tt> or\r\n<tt>vector_size</tt> attribute.</li>\r\n\r\n<li>Unnamed ('transparent') <tt>struct</tt>/<tt>union</tt> fields\r\ninside a <tt>struct</tt>/<tt>union</tt>.</li>\r\n\r\n<li>Incomplete <tt>enum</tt> declarations, handled like incomplete\r\n<tt>struct</tt> declarations.</li>\r\n\r\n<li>Unnamed <tt>enum</tt> fields inside a\r\n<tt>struct</tt>/<tt>union</tt>. This is similar to a scoped C++\r\n<tt>enum</tt>, except that declared constants are visible in the\r\nglobal namespace, too.</li>\r\n\r\n<li>Scoped <tt>static&nbsp;const</tt> declarations inside a\r\n<tt>struct</tt>/<tt>union</tt> (from C++).</li>\r\n\r\n<li>Zero-length arrays (<tt>[0]</tt>), empty\r\n<tt>struct</tt>/<tt>union</tt>, variable-length arrays (VLA,\r\n<tt>[?]</tt>) and variable-length structs (VLS, with a trailing\r\nVLA).</li>\r\n\r\n<li>C++ reference types (<tt>int&nbsp;&amp;x</tt>).</li>\r\n\r\n<li>Alternate GCC keywords with '<tt>__</tt>', e.g.\r\n<tt>__const__</tt>.</li>\r\n\r\n<li>GCC <tt>__attribute__</tt> with the following attributes:\r\n<tt>aligned</tt>, <tt>packed</tt>, <tt>mode</tt>,\r\n<tt>vector_size</tt>, <tt>cdecl</tt>, <tt>fastcall</tt>,\r\n<tt>stdcall</tt>, <tt>thiscall</tt>.</li>\r\n\r\n<li>The GCC <tt>__extension__</tt> keyword and the GCC\r\n<tt>__alignof__</tt> operator.</li>\r\n\r\n<li>GCC <tt>__asm__(\"symname\")</tt> symbol name redirection for\r\nfunction declarations.</li>\r\n\r\n<li>MSVC keywords for fixed-length types: <tt>__int8</tt>,\r\n<tt>__int16</tt>, <tt>__int32</tt> and <tt>__int64</tt>.</li>\r\n\r\n<li>MSVC <tt>__cdecl</tt>, <tt>__fastcall</tt>, <tt>__stdcall</tt>,\r\n<tt>__thiscall</tt>, <tt>__ptr32</tt>, <tt>__ptr64</tt>,\r\n<tt>__declspec(align(n))</tt> and <tt>#pragma&nbsp;pack</tt>.</li>\r\n\r\n<li>All other GCC/MSVC-specific attributes are ignored.</li>\r\n\r\n</ul>\r\n<p>\r\nThe following C&nbsp;types are pre-defined by the C&nbsp;parser (like\r\na <tt>typedef</tt>, except re-declarations will be ignored):\r\n</p>\r\n<ul>\r\n\r\n<li>Vararg handling: <tt>va_list</tt>, <tt>__builtin_va_list</tt>,\r\n<tt>__gnuc_va_list</tt>.</li>\r\n\r\n<li>From <tt>&lt;stddef.h&gt;</tt>: <tt>ptrdiff_t</tt>,\r\n<tt>size_t</tt>, <tt>wchar_t</tt>.</li>\r\n\r\n<li>From <tt>&lt;stdint.h&gt;</tt>: <tt>int8_t</tt>, <tt>int16_t</tt>,\r\n<tt>int32_t</tt>, <tt>int64_t</tt>, <tt>uint8_t</tt>,\r\n<tt>uint16_t</tt>, <tt>uint32_t</tt>, <tt>uint64_t</tt>,\r\n<tt>intptr_t</tt>, <tt>uintptr_t</tt>.</li>\r\n\r\n</ul>\r\n<p>\r\nYou're encouraged to use these types in preference to\r\ncompiler-specific extensions or target-dependent standard types.\r\nE.g. <tt>char</tt> differs in signedness and <tt>long</tt> differs in\r\nsize, depending on the target architecture and platform ABI.\r\n</p>\r\n<p>\r\nThe following C&nbsp;features are <b>not</b> supported:\r\n</p>\r\n<ul>\r\n\r\n<li>A declaration must always have a type specifier; it doesn't\r\ndefault to an <tt>int</tt> type.</li>\r\n\r\n<li>Old-style empty function declarations (K&amp;R) are not allowed.\r\nAll C&nbsp;functions must have a proper prototype declaration. A\r\nfunction declared without parameters (<tt>int&nbsp;foo();</tt>) is\r\ntreated as a function taking zero arguments, like in C++.</li>\r\n\r\n<li>The <tt>long double</tt> C&nbsp;type is parsed correctly, but\r\nthere's no support for the related conversions, accesses or arithmetic\r\noperations.</li>\r\n\r\n<li>Wide character strings and character literals are not\r\nsupported.</li>\r\n\r\n<li><a href=\"#status\">See below</a> for features that are currently\r\nnot implemented.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"convert\">C Type Conversion Rules</h2>\r\n\r\n<h3 id=\"convert_tolua\">Conversions from C&nbsp;types to Lua objects</h3>\r\n<p>\r\nThese conversion rules apply for <em>read accesses</em> to\r\nC&nbsp;types: indexing pointers, arrays or\r\n<tt>struct</tt>/<tt>union</tt> types; reading external variables or\r\nconstant values; retrieving return values from C&nbsp;calls:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>int8_t</tt>, <tt>int16_t</tt></td><td class=\"convop\">&rarr;<sup>sign-ext</sup> <tt>int32_t</tt> &rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>uint8_t</tt>, <tt>uint16_t</tt></td><td class=\"convop\">&rarr;<sup>zero-ext</sup> <tt>int32_t</tt> &rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>int32_t</tt>, <tt>uint32_t</tt></td><td class=\"convop\">&rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>int64_t</tt>, <tt>uint64_t</tt></td><td class=\"convop\">boxed value</td><td class=\"convout\">64 bit int cdata</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr; <tt>double</tt></td><td class=\"convout\">number</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\"><tt>bool</tt></td><td class=\"convop\">0 &rarr; <tt>false</tt>, otherwise <tt>true</tt></td><td class=\"convout\">boolean</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>enum</tt></td><td class=\"convop\">boxed value</td><td class=\"convout\">enum cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">boxed value</td><td class=\"convout\">complex cdata</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Vector</td><td class=\"convop\">boxed value</td><td class=\"convout\">vector cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">boxed value</td><td class=\"convout\">pointer cdata</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">boxed reference</td><td class=\"convout\">reference cdata</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">boxed reference</td><td class=\"convout\">reference cdata</td></tr>\r\n</table>\r\n<p>\r\nBitfields are treated like their underlying type.\r\n</p>\r\n<p>\r\nReference types are dereferenced <em>before</em> a conversion can take\r\nplace &mdash; the conversion is applied to the C&nbsp;type pointed to\r\nby the reference.\r\n</p>\r\n\r\n<h3 id=\"convert_fromlua\">Conversions from Lua objects to C&nbsp;types</h3>\r\n<p>\r\nThese conversion rules apply for <em>write accesses</em> to\r\nC&nbsp;types: indexing pointers, arrays or\r\n<tt>struct</tt>/<tt>union</tt> types; initializing cdata objects;\r\ncasts to C&nbsp;types; writing to external variables; passing\r\narguments to C&nbsp;calls:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">number</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">boolean</td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">nil</td><td class=\"convop\"><tt>NULL</tt> &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">lightuserdata</td><td class=\"convop\">lightuserdata address &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">userdata</td><td class=\"convop\">userdata payload &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">io.* file</td><td class=\"convop\">get FILE * handle &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">string</td><td class=\"convop\">match against <tt>enum</tt> constant</td><td class=\"convout\"><tt>enum</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">string</td><td class=\"convop\">copy string data + zero-byte</td><td class=\"convout\"><tt>int8_t[]</tt>, <tt>uint8_t[]</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">string</td><td class=\"convop\">string data &rarr;</td><td class=\"convout\"><tt>const char[]</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">function</td><td class=\"convop\"><a href=\"#callback\">create callback</a> &rarr;</td><td class=\"convout\">C function type</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">table</td><td class=\"convop\"><a href=\"#init_table\">table initializer</a></td><td class=\"convout\">Array</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">table</td><td class=\"convop\"><a href=\"#init_table\">table initializer</a></td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">cdata</td><td class=\"convop\">cdata payload &rarr;</td><td class=\"convout\">C type</td></tr>\r\n</table>\r\n<p>\r\nIf the result type of this conversion doesn't match the\r\nC&nbsp;type of the destination, the\r\n<a href=\"#convert_between\">conversion rules between C&nbsp;types</a>\r\nare applied.\r\n</p>\r\n<p>\r\nReference types are immutable after initialization (\"no re-seating of\r\nreferences\"). For initialization purposes or when passing values to\r\nreference parameters, they are treated like pointers. Note that unlike\r\nin C++, there's no way to implement automatic reference generation of\r\nvariables under the Lua language semantics. If you want to call a\r\nfunction with a reference parameter, you need to explicitly pass a\r\none-element array.\r\n</p>\r\n\r\n<h3 id=\"convert_between\">Conversions between C&nbsp;types</h3>\r\n<p>\r\nThese conversion rules are more or less the same as the standard\r\nC&nbsp;conversion rules. Some rules only apply to casts, or require\r\npointer or type compatibility:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Signed integer</td><td class=\"convop\">&rarr;<sup>narrow or sign-extend</sup></td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Unsigned integer</td><td class=\"convop\">&rarr;<sup>narrow or zero-extend</sup></td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Integer</td><td class=\"convop\">&rarr;<sup>round</sup></td><td class=\"convout\"><tt>double</tt>, <tt>float</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>trunc</sup> <tt>int32_t</tt> &rarr;<sup>narrow</sup></td><td class=\"convout\"><tt>(u)int8_t</tt>, <tt>(u)int16_t</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>trunc</sup></td><td class=\"convout\"><tt>(u)int32_t</tt>, <tt>(u)int64_t</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>double</tt>, <tt>float</tt></td><td class=\"convop\">&rarr;<sup>round</sup></td><td class=\"convout\"><tt>float</tt>, <tt>double</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">n == 0 &rarr; 0, otherwise 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>bool</tt></td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\">Number</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">convert real part</td><td class=\"convout\">Number</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert real part, imag = 0</td><td class=\"convout\">Complex number</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Complex number</td><td class=\"convop\">convert real and imag part</td><td class=\"convout\">Complex number</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert scalar and replicate</td><td class=\"convout\">Vector</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Vector</td><td class=\"convop\">copy (same size)</td><td class=\"convout\">Vector</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">take base address (compat)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">take base address (compat)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Function</td><td class=\"convop\">take function address</td><td class=\"convout\">Function pointer</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Number</td><td class=\"convop\">convert via <tt>uintptr_t</tt> (cast)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">convert address (compat/cast)</td><td class=\"convout\">Pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Pointer</td><td class=\"convop\">convert address (cast)</td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">convert base address (cast)</td><td class=\"convout\">Integer</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">Array</td><td class=\"convop\">copy (compat)</td><td class=\"convout\">Array</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt></td><td class=\"convop\">copy (identical type)</td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt></td></tr>\r\n</table>\r\n<p>\r\nBitfields or <tt>enum</tt> types are treated like their underlying\r\ntype.\r\n</p>\r\n<p>\r\nConversions not listed above will raise an error. E.g. it's not\r\npossible to convert a pointer to a complex number or vice versa.\r\n</p>\r\n\r\n<h3 id=\"convert_vararg\">Conversions for vararg C&nbsp;function arguments</h3>\r\n<p>\r\nThe following default conversion rules apply when passing Lua objects\r\nto the variable argument part of vararg C&nbsp;functions:\r\n</p>\r\n<table class=\"convtable\">\r\n<tr class=\"convhead\">\r\n<td class=\"convin\">Input</td>\r\n<td class=\"convop\">Conversion</td>\r\n<td class=\"convout\">Output</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">number</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">boolean</td><td class=\"convop\"><tt>false</tt> &rarr; 0, <tt>true</tt> &rarr; 1</td><td class=\"convout\"><tt>bool</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\">nil</td><td class=\"convop\"><tt>NULL</tt> &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">userdata</td><td class=\"convop\">userdata payload &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">lightuserdata</td><td class=\"convop\">lightuserdata address &rarr;</td><td class=\"convout\"><tt>(void *)</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"convin\">string</td><td class=\"convop\">string data &rarr;</td><td class=\"convout\"><tt>const char *</tt></td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"convin\"><tt>float</tt> cdata</td><td class=\"convop\">&rarr;</td><td class=\"convout\"><tt>double</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Array cdata</td><td class=\"convop\">take base address</td><td class=\"convout\">Element pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\"><tt>struct</tt>/<tt>union</tt> cdata</td><td class=\"convop\">take base address</td><td class=\"convout\"><tt>struct</tt>/<tt>union</tt> pointer</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"convin\">Function cdata</td><td class=\"convop\">take function address</td><td class=\"convout\">Function pointer</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"convin\">Any other cdata</td><td class=\"convop\">no conversion</td><td class=\"convout\">C type</td></tr>\r\n</table>\r\n<p>\r\nTo pass a Lua object, other than a cdata object, as a specific type,\r\nyou need to override the conversion rules: create a temporary cdata\r\nobject with a constructor or a cast and initialize it with the value\r\nto pass:\r\n</p>\r\n<p>\r\nAssuming <tt>x</tt> is a Lua number, here's how to pass it as an\r\ninteger to a vararg function:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\nint printf(const char *fmt, ...);\r\n]]\r\nffi.C.printf(\"integer value: %d\\n\", ffi.new(\"int\", x))\r\n</pre>\r\n<p>\r\nIf you don't do this, the default Lua number &rarr; <tt>double</tt>\r\nconversion rule applies. A vararg C&nbsp;function expecting an integer\r\nwill see a garbled or uninitialized value.\r\n</p>\r\n\r\n<h2 id=\"init\">Initializers</h2>\r\n<p>\r\nCreating a cdata object with\r\n<a href=\"ext_ffi_api.html#ffi_new\"><tt>ffi.new()</tt></a> or the\r\nequivalent constructor syntax always initializes its contents, too.\r\nDifferent rules apply, depending on the number of optional\r\ninitializers and the C&nbsp;types involved:\r\n</p>\r\n<ul>\r\n<li>If no initializers are given, the object is filled with zero bytes.</li>\r\n\r\n<li>Scalar types (numbers and pointers) accept a single initializer.\r\nThe Lua object is <a href=\"#convert_fromlua\">converted to the scalar\r\nC&nbsp;type</a>.</li>\r\n\r\n<li>Valarrays (complex numbers and vectors) are treated like scalars\r\nwhen a single initializer is given. Otherwise they are treated like\r\nregular arrays.</li>\r\n\r\n<li>Aggregate types (arrays and structs) accept either a single cdata\r\ninitializer of the same type (copy constructor), a single\r\n<a href=\"#init_table\">table initializer</a>, or a flat list of\r\ninitializers.</li>\r\n\r\n<li>The elements of an array are initialized, starting at index zero.\r\nIf a single initializer is given for an array, it's repeated for all\r\nremaining elements. This doesn't happen if two or more initializers\r\nare given: all remaining uninitialized elements are filled with zero\r\nbytes.</li>\r\n\r\n<li>Byte arrays may also be initialized with a Lua string. This copies\r\nthe whole string plus a terminating zero-byte. The copy stops early only\r\nif the array has a known, fixed size.</li>\r\n\r\n<li>The fields of a <tt>struct</tt> are initialized in the order of\r\ntheir declaration. Uninitialized fields are filled with zero\r\nbytes.</li>\r\n\r\n<li>Only the first field of a <tt>union</tt> can be initialized with a\r\nflat initializer.</li>\r\n\r\n<li>Elements or fields which are aggregates themselves are initialized\r\nwith a <em>single</em> initializer, but this may be a table\r\ninitializer or a compatible aggregate.</li>\r\n\r\n<li>Excess initializers cause an error.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"init_table\">Table Initializers</h2>\r\n<p>\r\nThe following rules apply if a Lua table is used to initialize an\r\nArray or a <tt>struct</tt>/<tt>union</tt>:\r\n</p>\r\n<ul>\r\n\r\n<li>If the table index <tt>[0]</tt> is non-<tt>nil</tt>, then the\r\ntable is assumed to be zero-based. Otherwise it's assumed to be\r\none-based.</li>\r\n\r\n<li>Array elements, starting at index zero, are initialized one-by-one\r\nwith the consecutive table elements, starting at either index\r\n<tt>[0]</tt> or <tt>[1]</tt>. This process stops at the first\r\n<tt>nil</tt> table element.</li>\r\n\r\n<li>If exactly one array element was initialized, it's repeated for\r\nall the remaining elements. Otherwise all remaining uninitialized\r\nelements are filled with zero bytes.</li>\r\n\r\n<li>The above logic only applies to arrays with a known fixed size.\r\nA VLA is only initialized with the element(s) given in the table.\r\nDepending on the use case, you may need to explicitly add a\r\n<tt>NULL</tt> or <tt>0</tt> terminator to a VLA.</li>\r\n\r\n<li>A <tt>struct</tt>/<tt>union</tt> can be initialized in the\r\norder of the declaration of its fields. Each field is initialized with\r\nconsecutive table elements, starting at either index <tt>[0]</tt>\r\nor <tt>[1]</tt>. This process stops at the first <tt>nil</tt> table\r\nelement.</li>\r\n\r\n<li>Otherwise, if neither index <tt>[0]</tt> nor <tt>[1]</tt> is present,\r\na <tt>struct</tt>/<tt>union</tt> is initialized by looking up each field\r\nname (as a string key) in the table. Each non-<tt>nil</tt> value is\r\nused to initialize the corresponding field.</li>\r\n\r\n<li>Uninitialized fields of a <tt>struct</tt> are filled with zero\r\nbytes, except for the trailing VLA of a VLS.</li>\r\n\r\n<li>Initialization of a <tt>union</tt> stops after one field has been\r\ninitialized. If no field has been initialized, the <tt>union</tt> is\r\nfilled with zero bytes.</li>\r\n\r\n<li>Elements or fields which are aggregates themselves are initialized\r\nwith a <em>single</em> initializer, but this may be a nested table\r\ninitializer (or a compatible aggregate).</li>\r\n\r\n<li>Excess initializers for an array cause an error. Excess\r\ninitializers for a <tt>struct</tt>/<tt>union</tt> are ignored.\r\nUnrelated table entries are ignored, too.</li>\r\n\r\n</ul>\r\n<p>\r\nExample:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\n\r\nffi.cdef[[\r\nstruct foo { int a, b; };\r\nunion bar { int i; double d; };\r\nstruct nested { int x; struct foo y; };\r\n]]\r\n\r\nffi.new(\"int[3]\", {})            --> 0, 0, 0\r\nffi.new(\"int[3]\", {1})           --> 1, 1, 1\r\nffi.new(\"int[3]\", {1,2})         --> 1, 2, 0\r\nffi.new(\"int[3]\", {1,2,3})       --> 1, 2, 3\r\nffi.new(\"int[3]\", {[0]=1})       --> 1, 1, 1\r\nffi.new(\"int[3]\", {[0]=1,2})     --> 1, 2, 0\r\nffi.new(\"int[3]\", {[0]=1,2,3})   --> 1, 2, 3\r\nffi.new(\"int[3]\", {[0]=1,2,3,4}) --> error: too many initializers\r\n\r\nffi.new(\"struct foo\", {})            --> a = 0, b = 0\r\nffi.new(\"struct foo\", {1})           --> a = 1, b = 0\r\nffi.new(\"struct foo\", {1,2})         --> a = 1, b = 2\r\nffi.new(\"struct foo\", {[0]=1,2})     --> a = 1, b = 2\r\nffi.new(\"struct foo\", {b=2})         --> a = 0, b = 2\r\nffi.new(\"struct foo\", {a=1,b=2,c=3}) --> a = 1, b = 2  'c' is ignored\r\n\r\nffi.new(\"union bar\", {})        --> i = 0, d = 0.0\r\nffi.new(\"union bar\", {1})       --> i = 1, d = ?\r\nffi.new(\"union bar\", {[0]=1,2}) --> i = 1, d = ?    '2' is ignored\r\nffi.new(\"union bar\", {d=2})     --> i = ?, d = 2.0\r\n\r\nffi.new(\"struct nested\", {1,{2,3}})     --> x = 1, y.a = 2, y.b = 3\r\nffi.new(\"struct nested\", {x=1,y={2,3}}) --> x = 1, y.a = 2, y.b = 3\r\n</pre>\r\n\r\n<h2 id=\"cdata_ops\">Operations on cdata Objects</h2>\r\n<p>\r\nAll of the standard Lua operators can be applied to cdata objects or a\r\nmix of a cdata object and another Lua object. The following list shows\r\nthe pre-defined operations.\r\n</p>\r\n<p>\r\nReference types are dereferenced <em>before</em> performing each of\r\nthe operations below &mdash; the operation is applied to the\r\nC&nbsp;type pointed to by the reference.\r\n</p>\r\n<p>\r\nThe pre-defined operations are always tried first before deferring to a\r\nmetamethod or index table (if any) for the corresponding ctype (except\r\nfor <tt>__new</tt>). An error is raised if the metamethod lookup or\r\nindex table lookup fails.\r\n</p>\r\n\r\n<h3 id=\"cdata_array\">Indexing a cdata object</h3>\r\n<ul>\r\n\r\n<li><b>Indexing a pointer/array</b>: a cdata pointer/array can be\r\nindexed by a cdata number or a Lua number. The element address is\r\ncomputed as the base address plus the number value multiplied by the\r\nelement size in bytes. A read access loads the element value and\r\n<a href=\"#convert_tolua\">converts it to a Lua object</a>. A write\r\naccess <a href=\"#convert_fromlua\">converts a Lua object to the element\r\ntype</a> and stores the converted value to the element. An error is\r\nraised if the element size is undefined or a write access to a\r\nconstant element is attempted.</li>\r\n\r\n<li><b>Dereferencing a <tt>struct</tt>/<tt>union</tt> field</b>: a\r\ncdata <tt>struct</tt>/<tt>union</tt> or a pointer to a\r\n<tt>struct</tt>/<tt>union</tt> can be dereferenced by a string key,\r\ngiving the field name. The field address is computed as the base\r\naddress plus the relative offset of the field. A read access loads the\r\nfield value and <a href=\"#convert_tolua\">converts it to a Lua\r\nobject</a>. A write access <a href=\"#convert_fromlua\">converts a Lua\r\nobject to the field type</a> and stores the converted value to the\r\nfield. An error is raised if a write access to a constant\r\n<tt>struct</tt>/<tt>union</tt> or a constant field is attempted.\r\nScoped enum constants or static constants are treated like a constant\r\nfield.</li>\r\n\r\n<li><b>Indexing a complex number</b>: a complex number can be indexed\r\neither by a cdata number or a Lua number with the values 0 or 1, or by\r\nthe strings <tt>\"re\"</tt> or <tt>\"im\"</tt>. A read access loads the\r\nreal part (<tt>[0]</tt>, <tt>.re</tt>) or the imaginary part\r\n(<tt>[1]</tt>, <tt>.im</tt>) part of a complex number and\r\n<a href=\"#convert_tolua\">converts it to a Lua number</a>. The\r\nsub-parts of a complex number are immutable &mdash; assigning to an\r\nindex of a complex number raises an error. Accessing out-of-bound\r\nindexes returns unspecified results, but is guaranteed not to trigger\r\nmemory access violations.</li>\r\n\r\n<li><b>Indexing a vector</b>: a vector is treated like an array for\r\nindexing purposes, except the vector elements are immutable &mdash;\r\nassigning to an index of a vector raises an error.</li>\r\n\r\n</ul>\r\n<p>\r\nA ctype object can be indexed with a string key, too. The only\r\npre-defined operation is reading scoped constants of\r\n<tt>struct</tt>/<tt>union</tt> types. All other accesses defer\r\nto the corresponding metamethods or index tables (if any).\r\n</p>\r\n<p>\r\nNote: since there's (deliberately) no address-of operator, a cdata\r\nobject holding a value type is effectively immutable after\r\ninitialization. The JIT compiler benefits from this fact when applying\r\ncertain optimizations.\r\n</p>\r\n<p>\r\nAs a consequence, the <em>elements</em> of complex numbers and\r\nvectors are immutable. But the elements of an aggregate holding these\r\ntypes <em>may</em> be modified of course. I.e. you cannot assign to\r\n<tt>foo.c.im</tt>, but you can assign a (newly created) complex number\r\nto <tt>foo.c</tt>.\r\n</p>\r\n<p>\r\nThe JIT compiler implements strict aliasing rules: accesses to different\r\ntypes do <b>not</b> alias, except for differences in signedness (this\r\napplies even to <tt>char</tt> pointers, unlike C99). Type punning\r\nthrough unions is explicitly detected and allowed.\r\n</p>\r\n\r\n<h3 id=\"cdata_call\">Calling a cdata object</h3>\r\n<ul>\r\n\r\n<li><b>Constructor</b>: a ctype object can be called and used as a\r\n<a href=\"ext_ffi_api.html#ffi_new\">constructor</a>. This is equivalent\r\nto <tt>ffi.new(ct, ...)</tt>, unless a <tt>__new</tt> metamethod is\r\ndefined. The <tt>__new</tt> metamethod is called with the ctype object\r\nplus any other arguments passed to the contructor. Note that you have to\r\nuse <tt>ffi.new</tt> inside of it, since calling <tt>ct(...)</tt> would\r\ncause infinite recursion.</li>\r\n\r\n<li><b>C&nbsp;function call</b>: a cdata function or cdata function\r\npointer can be called. The passed arguments are\r\n<a href=\"#convert_fromlua\">converted to the C&nbsp;types</a> of the\r\nparameters given by the function declaration. Arguments passed to the\r\nvariable argument part of vararg C&nbsp;function use\r\n<a href=\"#convert_vararg\">special conversion rules</a>. This\r\nC&nbsp;function is called and the return value (if any) is\r\n<a href=\"#convert_tolua\">converted to a Lua object</a>.<br>\r\nOn Windows/x86 systems, <tt>__stdcall</tt> functions are automatically\r\ndetected and a function declared as <tt>__cdecl</tt> (the default) is\r\nsilently fixed up after the first call.</li>\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_arith\">Arithmetic on cdata objects</h3>\r\n<ul>\r\n\r\n<li><b>Pointer arithmetic</b>: a cdata pointer/array and a cdata\r\nnumber or a Lua number can be added or subtracted. The number must be\r\non the right hand side for a subtraction. The result is a pointer of\r\nthe same type with an address plus or minus the number value\r\nmultiplied by the element size in bytes. An error is raised if the\r\nelement size is undefined.</li>\r\n\r\n<li><b>Pointer difference</b>: two compatible cdata pointers/arrays\r\ncan be subtracted. The result is the difference between their\r\naddresses, divided by the element size in bytes. An error is raised if\r\nthe element size is undefined or zero.</li>\r\n\r\n<li><b>64&nbsp;bit integer arithmetic</b>: the standard arithmetic\r\noperators (<tt>+&nbsp;-&nbsp;*&nbsp;/&nbsp;%&nbsp;^</tt> and unary\r\nminus) can be applied to two cdata numbers, or a cdata number and a\r\nLua number. If one of them is an <tt>uint64_t</tt>, the other side is\r\nconverted to an <tt>uint64_t</tt> and an unsigned arithmetic operation\r\nis performed. Otherwise both sides are converted to an\r\n<tt>int64_t</tt> and a signed arithmetic operation is performed. The\r\nresult is a boxed 64&nbsp;bit cdata object.<br>\r\n\r\nIf one of the operands is an <tt>enum</tt> and the other operand is a\r\nstring, the string is converted to the value of a matching <tt>enum</tt>\r\nconstant before the above conversion.<br>\r\n\r\nThese rules ensure that 64&nbsp;bit integers are \"sticky\". Any\r\nexpression involving at least one 64&nbsp;bit integer operand results\r\nin another one. The undefined cases for the division, modulo and power\r\noperators return <tt>2LL&nbsp;^&nbsp;63</tt> or\r\n<tt>2ULL&nbsp;^&nbsp;63</tt>.<br>\r\n\r\nYou'll have to explicitly convert a 64&nbsp;bit integer to a Lua\r\nnumber (e.g. for regular floating-point calculations) with\r\n<tt>tonumber()</tt>. But note this may incur a precision loss.</li>\r\n\r\n<li><b>64&nbsp;bit bitwise operations</b>: the rules for 64&nbsp;bit\r\narithmetic operators apply analogously.<br>\r\n\r\nUnlike the other <tt>bit.*</tt> operations, <tt>bit.tobit()</tt>\r\nconverts a cdata number via <tt>int64_t</tt> to <tt>int32_t</tt> and\r\nreturns a Lua number.<br>\r\n\r\nFor <tt>bit.band()</tt>, <tt>bit.bor()</tt> and <tt>bit.bxor()</tt>, the\r\nconversion to <tt>int64_t</tt> or <tt>uint64_t</tt> applies to\r\n<em>all</em> arguments, if <em>any</em> argument is a cdata number.<br>\r\n\r\nFor all other operations, only the first argument is used to determine\r\nthe output type. This implies that a cdata number as a shift count for\r\nshifts and rotates is accepted, but that alone does <em>not</em> cause\r\na cdata number output.\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_comp\">Comparisons of cdata objects</h3>\r\n<ul>\r\n\r\n<li><b>Pointer comparison</b>: two compatible cdata pointers/arrays\r\ncan be compared. The result is the same as an unsigned comparison of\r\ntheir addresses. <tt>nil</tt> is treated like a <tt>NULL</tt> pointer,\r\nwhich is compatible with any other pointer type.</li>\r\n\r\n<li><b>64&nbsp;bit integer comparison</b>: two cdata numbers, or a\r\ncdata number and a Lua number can be compared with each other. If one\r\nof them is an <tt>uint64_t</tt>, the other side is converted to an\r\n<tt>uint64_t</tt> and an unsigned comparison is performed. Otherwise\r\nboth sides are converted to an <tt>int64_t</tt> and a signed\r\ncomparison is performed.<br>\r\n\r\nIf one of the operands is an <tt>enum</tt> and the other operand is a\r\nstring, the string is converted to the value of a matching <tt>enum</tt>\r\nconstant before the above conversion.<br>\r\n\r\n<li><b>Comparisons for equality/inequality</b> never raise an error.\r\nEven incompatible pointers can be compared for equality by address. Any\r\nother incompatible comparison (also with non-cdata objects) treats the\r\ntwo sides as unequal.</li>\r\n\r\n</ul>\r\n\r\n<h3 id=\"cdata_key\">cdata objects as table keys</h3>\r\n<p>\r\nLua tables may be indexed by cdata objects, but this doesn't provide\r\nany useful semantics &mdash; <b>cdata objects are unsuitable as table\r\nkeys!</b>\r\n</p>\r\n<p>\r\nA cdata object is treated like any other garbage-collected object and\r\nis hashed and compared by its address for table indexing. Since\r\nthere's no interning for cdata value types, the same value may be\r\nboxed in different cdata objects with different addresses. Thus\r\n<tt>t[1LL+1LL]</tt> and <tt>t[2LL]</tt> usually <b>do not</b> point to\r\nthe same hash slot and they certainly <b>do not</b> point to the same\r\nhash slot as <tt>t[2]</tt>.\r\n</p>\r\n<p>\r\nIt would seriously drive up implementation complexity and slow down\r\nthe common case, if one were to add extra handling for by-value\r\nhashing and comparisons to Lua tables. Given the ubiquity of their use\r\ninside the VM, this is not acceptable.\r\n</p>\r\n<p>\r\nThere are three viable alternatives, if you really need to use cdata\r\nobjects as keys:\r\n</p>\r\n<ul>\r\n\r\n<li>If you can get by with the precision of Lua numbers\r\n(52&nbsp;bits), then use <tt>tonumber()</tt> on a cdata number or\r\ncombine multiple fields of a cdata aggregate to a Lua number. Then use\r\nthe resulting Lua number as a key when indexing tables.<br>\r\nOne obvious benefit: <tt>t[tonumber(2LL)]</tt> <b>does</b> point to\r\nthe same slot as <tt>t[2]</tt>.</li>\r\n\r\n<li>Otherwise use either <tt>tostring()</tt> on 64&nbsp;bit integers\r\nor complex numbers or combine multiple fields of a cdata aggregate to\r\na Lua string (e.g. with\r\n<a href=\"ext_ffi_api.html#ffi_string\"><tt>ffi.string()</tt></a>). Then\r\nuse the resulting Lua string as a key when indexing tables.</li>\r\n\r\n<li>Create your own specialized hash table implementation using the\r\nC&nbsp;types provided by the FFI library, just like you would in\r\nC&nbsp;code. Ultimately this may give much better performance than the\r\nother alternatives or what a generic by-value hash table could\r\npossibly provide.</li>\r\n\r\n</ul>\r\n\r\n<h2 id=\"param\">Parameterized Types</h2>\r\n<p>\r\nTo facilitate some abstractions, the two functions\r\n<a href=\"ext_ffi_api.html#ffi_typeof\"><tt>ffi.typeof</tt></a> and\r\n<a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a> support\r\nparameterized types in C&nbsp;declarations. Note: none of the other API\r\nfunctions taking a cdecl allow this.\r\n</p>\r\n<p>\r\nAny place you can write a <b><tt>typedef</tt> name</b>, an\r\n<b>identifier</b> or a <b>number</b> in a declaration, you can write\r\n<tt>$</tt> (the dollar sign) instead. These placeholders are replaced in\r\norder of appearance with the arguments following the cdecl string:\r\n</p>\r\n<pre class=\"code\">\r\n-- Declare a struct with a parameterized field type and name:\r\nffi.cdef([[\r\ntypedef struct { $ $; } foo_t;\r\n]], type1, name1)\r\n\r\n-- Anonymous struct with dynamic names:\r\nlocal bar_t = ffi.typeof(\"struct { int $, $; }\", name1, name2)\r\n-- Derived pointer type:\r\nlocal bar_ptr_t = ffi.typeof(\"$ *\", bar_t)\r\n\r\n-- Parameterized dimensions work even where a VLA won't work:\r\nlocal matrix_t = ffi.typeof(\"uint8_t[$][$]\", width, height)\r\n</pre>\r\n<p>\r\nCaveat: this is <em>not</em> simple text substitution! A passed ctype or\r\ncdata object is treated like the underlying type, a passed string is\r\nconsidered an identifier and a number is considered a number. You must\r\nnot mix this up: e.g. passing <tt>\"int\"</tt> as a string doesn't work in\r\nplace of a type, you'd need to use <tt>ffi.typeof(\"int\")</tt> instead.\r\n</p>\r\n<p>\r\nThe main use for parameterized types are libraries implementing abstract\r\ndata types\r\n(<a href=\"http://www.freelists.org/post/luajit/ffi-type-of-pointer-to,8\"><span class=\"ext\">&raquo;</span>&nbsp;example</a>),\r\nsimilar to what can be achieved with C++ template metaprogramming.\r\nAnother use case are derived types of anonymous structs, which avoids\r\npollution of the global struct namespace.\r\n</p>\r\n<p>\r\nPlease note that parameterized types are a nice tool and indispensable\r\nfor certain use cases. But you'll want to use them sparingly in regular\r\ncode, e.g. when all types are actually fixed.\r\n</p>\r\n\r\n<h2 id=\"gc\">Garbage Collection of cdata Objects</h2>\r\n<p>\r\nAll explicitly (<tt>ffi.new()</tt>, <tt>ffi.cast()</tt> etc.) or\r\nimplicitly (accessors) created cdata objects are garbage collected.\r\nYou need to ensure to retain valid references to cdata objects\r\nsomewhere on a Lua stack, an upvalue or in a Lua table while they are\r\nstill in use. Once the last reference to a cdata object is gone, the\r\ngarbage collector will automatically free the memory used by it (at\r\nthe end of the next GC cycle).\r\n</p>\r\n<p>\r\nPlease note that pointers themselves are cdata objects, however they\r\nare <b>not</b> followed by the garbage collector. So e.g. if you\r\nassign a cdata array to a pointer, you must keep the cdata object\r\nholding the array alive as long as the pointer is still in use:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\ntypedef struct { int *a; } foo_t;\r\n]]\r\n\r\nlocal s = ffi.new(\"foo_t\", ffi.new(\"int[10]\")) -- <span style=\"color:#c00000;\">WRONG!</span>\r\n\r\nlocal a = ffi.new(\"int[10]\") -- <span style=\"color:#00a000;\">OK</span>\r\nlocal s = ffi.new(\"foo_t\", a)\r\n-- Now do something with 's', but keep 'a' alive until you're done.\r\n</pre>\r\n<p>\r\nSimilar rules apply for Lua strings which are implicitly converted to\r\n<tt>\"const&nbsp;char&nbsp;*\"</tt>: the string object itself must be\r\nreferenced somewhere or it'll be garbage collected eventually. The\r\npointer will then point to stale data, which may have already been\r\noverwritten. Note that <em>string literals</em> are automatically kept\r\nalive as long as the function containing it (actually its prototype)\r\nis not garbage collected.\r\n</p>\r\n<p>\r\nObjects which are passed as an argument to an external C&nbsp;function\r\nare kept alive until the call returns. So it's generally safe to\r\ncreate temporary cdata objects in argument lists. This is a common\r\nidiom for <a href=\"#convert_vararg\">passing specific C&nbsp;types to\r\nvararg functions</a>.\r\n</p>\r\n<p>\r\nMemory areas returned by C functions (e.g. from <tt>malloc()</tt>)\r\nmust be manually managed, of course (or use\r\n<a href=\"ext_ffi_api.html#ffi_gc\"><tt>ffi.gc()</tt></a>). Pointers to\r\ncdata objects are indistinguishable from pointers returned by C\r\nfunctions (which is one of the reasons why the GC cannot follow them).\r\n</p>\r\n\r\n<h2 id=\"callback\">Callbacks</h2>\r\n<p>\r\nThe LuaJIT FFI automatically generates special callback functions\r\nwhenever a Lua function is converted to a C&nbsp;function pointer. This\r\nassociates the generated callback function pointer with the C&nbsp;type\r\nof the function pointer and the Lua function object (closure).\r\n</p>\r\n<p>\r\nThis can happen implicitly due to the usual conversions, e.g. when\r\npassing a Lua function to a function pointer argument. Or you can use\r\n<tt>ffi.cast()</tt> to explicitly cast a Lua function to a\r\nC&nbsp;function pointer.\r\n</p>\r\n<p>\r\nCurrently only certain C&nbsp;function types can be used as callback\r\nfunctions. Neither C&nbsp;vararg functions nor functions with\r\npass-by-value aggregate argument or result types are supported. There\r\nare no restrictions for the kind of Lua functions that can be called\r\nfrom the callback &mdash; no checks for the proper number of arguments\r\nare made. The return value of the Lua function will be converted to the\r\nresult type and an error will be thrown for invalid conversions.\r\n</p>\r\n<p>\r\nIt's allowed to throw errors across a callback invocation, but it's not\r\nadvisable in general. Do this only if you know the C&nbsp;function, that\r\ncalled the callback, copes with the forced stack unwinding and doesn't\r\nleak resources.\r\n</p>\r\n<p>\r\nOne thing that's not allowed, is to let an FFI call into a C&nbsp;function\r\nget JIT-compiled, which in turn calls a callback, calling into Lua again.\r\nUsually this attempt is caught by the interpreter first and the\r\nC&nbsp;function is blacklisted for compilation.\r\n</p>\r\n<p>\r\nHowever, this heuristic may fail under specific circumstances: e.g. a\r\nmessage polling function might not run Lua callbacks right away and the call\r\ngets JIT-compiled. If it later happens to call back into Lua (e.g. a rarely\r\ninvoked error callback), you'll get a VM PANIC with the message\r\n<tt>\"bad callback\"</tt>. Then you'll need to manually turn off\r\nJIT-compilation with\r\n<a href=\"ext_jit.html#jit_onoff_func\"><tt>jit.off()</tt></a> for the\r\nsurrounding Lua function that invokes such a message polling function (or\r\nsimilar).\r\n</p>\r\n\r\n<h3 id=\"callback_resources\">Callback resource handling</h3>\r\n<p>\r\nCallbacks take up resources &mdash; you can only have a limited number\r\nof them at the same time (500&nbsp;-&nbsp;1000, depending on the\r\narchitecture). The associated Lua functions are anchored to prevent\r\ngarbage collection, too.\r\n</p>\r\n<p>\r\n<b>Callbacks due to implicit conversions are permanent!</b> There is no\r\nway to guess their lifetime, since the C&nbsp;side might store the\r\nfunction pointer for later use (typical for GUI toolkits). The associated\r\nresources cannot be reclaimed until termination:\r\n</p>\r\n<pre class=\"code\">\r\nffi.cdef[[\r\ntypedef int (__stdcall *WNDENUMPROC)(void *hwnd, intptr_t l);\r\nint EnumWindows(WNDENUMPROC func, intptr_t l);\r\n]]\r\n\r\n-- Implicit conversion to a callback via function pointer argument.\r\nlocal count = 0\r\nffi.C.EnumWindows(function(hwnd, l)\r\n  count = count + 1\r\n  return true\r\nend, 0)\r\n-- The callback is permanent and its resources cannot be reclaimed!\r\n-- Ok, so this may not be a problem, if you do this only once.\r\n</pre>\r\n<p>\r\nNote: this example shows that you <em>must</em> properly declare\r\n<tt>__stdcall</tt> callbacks on Windows/x86 systems. The calling\r\nconvention cannot be automatically detected, unlike for\r\n<tt>__stdcall</tt> calls <em>to</em> Windows functions.\r\n</p>\r\n<p>\r\nFor some use cases it's necessary to free up the resources or to\r\ndynamically redirect callbacks. Use an explicit cast to a\r\nC&nbsp;function pointer and keep the resulting cdata object. Then use\r\nthe <a href=\"ext_ffi_api.html#callback_free\"><tt>cb:free()</tt></a>\r\nor <a href=\"ext_ffi_api.html#callback_set\"><tt>cb:set()</tt></a> methods\r\non the cdata object:\r\n</p>\r\n<pre class=\"code\">\r\n-- Explicitly convert to a callback via cast.\r\nlocal count = 0\r\nlocal cb = ffi.cast(\"WNDENUMPROC\", function(hwnd, l)\r\n  count = count + 1\r\n  return true\r\nend)\r\n\r\n-- Pass it to a C function.\r\nffi.C.EnumWindows(cb, 0)\r\n-- EnumWindows doesn't need the callback after it returns, so free it.\r\n\r\ncb:free()\r\n-- The callback function pointer is no longer valid and its resources\r\n-- will be reclaimed. The created Lua closure will be garbage collected.\r\n</pre>\r\n\r\n<h3 id=\"callback_performance\">Callback performance</h3>\r\n<p>\r\n<b>Callbacks are slow!</b> First, the C&nbsp;to Lua transition itself\r\nhas an unavoidable cost, similar to a <tt>lua_call()</tt> or\r\n<tt>lua_pcall()</tt>. Argument and result marshalling add to that cost.\r\nAnd finally, neither the C&nbsp;compiler nor LuaJIT can inline or\r\noptimize across the language barrier and hoist repeated computations out\r\nof a callback function.\r\n</p>\r\n<p>\r\nDo not use callbacks for performance-sensitive work: e.g. consider a\r\nnumerical integration routine which takes a user-defined function to\r\nintegrate over. It's a bad idea to call a user-defined Lua function from\r\nC&nbsp;code millions of times. The callback overhead will be absolutely\r\ndetrimental for performance.\r\n</p>\r\n<p>\r\nIt's considerably faster to write the numerical integration routine\r\nitself in Lua &mdash; the JIT compiler will be able to inline the\r\nuser-defined function and optimize it together with its calling context,\r\nwith very competitive performance.\r\n</p>\r\n<p>\r\nAs a general guideline: <b>use callbacks only when you must</b>, because\r\nof existing C&nbsp;APIs. E.g. callback performance is irrelevant for a\r\nGUI application, which waits for user input most of the time, anyway.\r\n</p>\r\n<p>\r\nFor new designs <b>avoid push-style APIs</b>: a C&nbsp;function repeatedly\r\ncalling a callback for each result. Instead <b>use pull-style APIs</b>:\r\ncall a C&nbsp;function repeatedly to get a new result. Calls from Lua\r\nto C via the FFI are much faster than the other way round. Most well-designed\r\nlibraries already use pull-style APIs (read/write, get/put).\r\n</p>\r\n\r\n<h2 id=\"clib\">C Library Namespaces</h2>\r\n<p>\r\nA C&nbsp;library namespace is a special kind of object which allows\r\naccess to the symbols contained in shared libraries or the default\r\nsymbol namespace. The default\r\n<a href=\"ext_ffi_api.html#ffi_C\"><tt>ffi.C</tt></a> namespace is\r\nautomatically created when the FFI library is loaded. C&nbsp;library\r\nnamespaces for specific shared libraries may be created with the\r\n<a href=\"ext_ffi_api.html#ffi_load\"><tt>ffi.load()</tt></a> API\r\nfunction.\r\n</p>\r\n<p>\r\nIndexing a C&nbsp;library namespace object with a symbol name (a Lua\r\nstring) automatically binds it to the library. First the symbol type\r\nis resolved &mdash; it must have been declared with\r\n<a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a>. Then the\r\nsymbol address is resolved by searching for the symbol name in the\r\nassociated shared libraries or the default symbol namespace. Finally,\r\nthe resulting binding between the symbol name, the symbol type and its\r\naddress is cached. Missing symbol declarations or nonexistent symbol\r\nnames cause an error.\r\n</p>\r\n<p>\r\nThis is what happens on a <b>read access</b> for the different kinds of\r\nsymbols:\r\n</p>\r\n<ul>\r\n\r\n<li>External functions: a cdata object with the type of the function\r\nand its address is returned.</li>\r\n\r\n<li>External variables: the symbol address is dereferenced and the\r\nloaded value is <a href=\"#convert_tolua\">converted to a Lua object</a>\r\nand returned.</li>\r\n\r\n<li>Constant values (<tt>static&nbsp;const</tt> or <tt>enum</tt>\r\nconstants): the constant is <a href=\"#convert_tolua\">converted to a\r\nLua object</a> and returned.</li>\r\n\r\n</ul>\r\n<p>\r\nThis is what happens on a <b>write access</b>:\r\n</p>\r\n<ul>\r\n\r\n<li>External variables: the value to be written is\r\n<a href=\"#convert_fromlua\">converted to the C&nbsp;type</a> of the\r\nvariable and then stored at the symbol address.</li>\r\n\r\n<li>Writing to constant variables or to any other symbol type causes\r\nan error, like any other attempted write to a constant location.</li>\r\n\r\n</ul>\r\n<p>\r\nC&nbsp;library namespaces themselves are garbage collected objects. If\r\nthe last reference to the namespace object is gone, the garbage\r\ncollector will eventually release the shared library reference and\r\nremove all memory associated with the namespace. Since this may\r\ntrigger the removal of the shared library from the memory of the\r\nrunning process, it's generally <em>not safe</em> to use function\r\ncdata objects obtained from a library if the namespace object may be\r\nunreferenced.\r\n</p>\r\n<p>\r\nPerformance notice: the JIT compiler specializes to the identity of\r\nnamespace objects and to the strings used to index it. This\r\neffectively turns function cdata objects into constants. It's not\r\nuseful and actually counter-productive to explicitly cache these\r\nfunction objects, e.g. <tt>local strlen = ffi.C.strlen</tt>. OTOH it\r\n<em>is</em> useful to cache the namespace itself, e.g. <tt>local C =\r\nffi.C</tt>.\r\n</p>\r\n\r\n<h2 id=\"policy\">No Hand-holding!</h2>\r\n<p>\r\nThe FFI library has been designed as <b>a low-level library</b>. The\r\ngoal is to interface with C&nbsp;code and C&nbsp;data types with a\r\nminimum of overhead. This means <b>you can do anything you can do\r\nfrom&nbsp;C</b>: access all memory, overwrite anything in memory, call\r\nmachine code at any memory address and so on.\r\n</p>\r\n<p>\r\nThe FFI library provides <b>no memory safety</b>, unlike regular Lua\r\ncode. It will happily allow you to dereference a <tt>NULL</tt>\r\npointer, to access arrays out of bounds or to misdeclare\r\nC&nbsp;functions. If you make a mistake, your application might crash,\r\njust like equivalent C&nbsp;code would.\r\n</p>\r\n<p>\r\nThis behavior is inevitable, since the goal is to provide full\r\ninteroperability with C&nbsp;code. Adding extra safety measures, like\r\nbounds checks, would be futile. There's no way to detect\r\nmisdeclarations of C&nbsp;functions, since shared libraries only\r\nprovide symbol names, but no type information. Likewise there's no way\r\nto infer the valid range of indexes for a returned pointer.\r\n</p>\r\n<p>\r\nAgain: the FFI library is a low-level library. This implies it needs\r\nto be used with care, but it's flexibility and performance often\r\noutweigh this concern. If you're a C or C++ developer, it'll be easy\r\nto apply your existing knowledge. OTOH writing code for the FFI\r\nlibrary is not for the faint of heart and probably shouldn't be the\r\nfirst exercise for someone with little experience in Lua, C or C++.\r\n</p>\r\n<p>\r\nAs a corollary of the above, the FFI library is <b>not safe for use by\r\nuntrusted Lua code</b>. If you're sandboxing untrusted Lua code, you\r\ndefinitely don't want to give this code access to the FFI library or\r\nto <em>any</em> cdata object (except 64&nbsp;bit integers or complex\r\nnumbers). Any properly engineered Lua sandbox needs to provide safety\r\nwrappers for many of the standard Lua library functions &mdash;\r\nsimilar wrappers need to be written for high-level operations on FFI\r\ndata types, too.\r\n</p>\r\n\r\n<h2 id=\"status\">Current Status</h2>\r\n<p>\r\nThe initial release of the FFI library has some limitations and is\r\nmissing some features. Most of these will be fixed in future releases.\r\n</p>\r\n<p>\r\n<a href=\"#clang\">C language support</a> is\r\ncurrently incomplete:\r\n</p>\r\n<ul>\r\n<li>C&nbsp;declarations are not passed through a C&nbsp;pre-processor,\r\nyet.</li>\r\n<li>The C&nbsp;parser is able to evaluate most constant expressions\r\ncommonly found in C&nbsp;header files. However it doesn't handle the\r\nfull range of C&nbsp;expression semantics and may fail for some\r\nobscure constructs.</li>\r\n<li><tt>static const</tt> declarations only work for integer types\r\nup to 32&nbsp;bits. Neither declaring string constants nor\r\nfloating-point constants is supported.</li>\r\n<li>Packed <tt>struct</tt> bitfields that cross container boundaries\r\nare not implemented.</li>\r\n<li>Native vector types may be defined with the GCC <tt>mode</tt> or\r\n<tt>vector_size</tt> attribute. But no operations other than loading,\r\nstoring and initializing them are supported, yet.</li>\r\n<li>The <tt>volatile</tt> type qualifier is currently ignored by\r\ncompiled code.</li>\r\n<li><a href=\"ext_ffi_api.html#ffi_cdef\"><tt>ffi.cdef</tt></a> silently\r\nignores most re-declarations. Note: avoid re-declarations which do not\r\nconform to C99. The implementation will eventually be changed to\r\nperform strict checks.</li>\r\n</ul>\r\n<p>\r\nThe JIT compiler already handles a large subset of all FFI operations.\r\nIt automatically falls back to the interpreter for unimplemented\r\noperations (you can check for this with the\r\n<a href=\"running.html#opt_j\"><tt>-jv</tt></a> command line option).\r\nThe following operations are currently not compiled and may exhibit\r\nsuboptimal performance, especially when used in inner loops:\r\n</p>\r\n<ul>\r\n<li>Bitfield accesses and initializations.</li>\r\n<li>Vector operations.</li>\r\n<li>Table initializers.</li>\r\n<li>Initialization of nested <tt>struct</tt>/<tt>union</tt> types.</li>\r\n<li>Non-default initialization of VLA/VLS or large C&nbsp;types\r\n(&gt; 128&nbsp;bytes or &gt; 16 array elements.</li>\r\n<li>Conversions from lightuserdata to <tt>void&nbsp;*</tt>.</li>\r\n<li>Pointer differences for element sizes that are not a power of\r\ntwo.</li>\r\n<li>Calls to C&nbsp;functions with aggregates passed or returned by\r\nvalue.</li>\r\n<li>Calls to ctype metamethods which are not plain functions.</li>\r\n<li>ctype <tt>__newindex</tt> tables and non-string lookups in ctype\r\n<tt>__index</tt> tables.</li>\r\n<li><tt>tostring()</tt> for cdata types.</li>\r\n<li>Calls to <tt>ffi.cdef()</tt>, <tt>ffi.load()</tt> and\r\n<tt>ffi.metatype()</tt>.</li>\r\n</ul>\r\n<p>\r\nOther missing features:\r\n</p>\r\n<ul>\r\n<li>Arithmetic for <tt>complex</tt> numbers.</li>\r\n<li>Passing structs by value to vararg C&nbsp;functions.</li>\r\n<li><a href=\"extensions.html#exceptions\">C++ exception interoperability</a>\r\ndoes not extend to C&nbsp;functions called via the FFI, if the call is\r\ncompiled.</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_ffi_tutorial.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>FFI Tutorial</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.idiomtable { font-size: 90%; line-height: 1.2; }\r\ntable.idiomtable tt { font-size: 100%; }\r\ntable.idiomtable td { vertical-align: top; }\r\ntr.idiomhead td { font-weight: bold; }\r\ntd.idiomlua b { font-weight: normal; color: #2142bf; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>FFI Tutorial</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a class=\"current\" href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThis page is intended to give you an overview of the features of the FFI\r\nlibrary by presenting a few use cases and guidelines.\r\n</p>\r\n<p>\r\nThis page makes no attempt to explain all of the FFI library, though.\r\nYou'll want to have a look at the <a href=\"ext_ffi_api.html\">ffi.* API\r\nfunction reference</a> and the <a href=\"ext_ffi_semantics.html\">FFI\r\nsemantics</a> to learn more.\r\n</p>\r\n\r\n<h2 id=\"load\">Loading the FFI Library</h2>\r\n<p>\r\nThe FFI library is built into LuaJIT by default, but it's not loaded\r\nand initialized by default. The suggested way to use the FFI library\r\nis to add the following to the start of every Lua file that needs one\r\nof its functions:\r\n</p>\r\n<pre class=\"code\">\r\nlocal ffi = require(\"ffi\")\r\n</pre>\r\n<p>\r\nPlease note this doesn't define an <tt>ffi</tt> variable in the table\r\nof globals &mdash; you really need to use the local variable. The\r\n<tt>require</tt> function ensures the library is only loaded once.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote: If you want to experiment with the FFI from the interactive prompt\r\nof the command line executable, omit the <tt>local</tt>, as it doesn't\r\npreserve local variables across lines.\r\n</p>\r\n\r\n<h2 id=\"sleep\">Accessing Standard System Functions</h2>\r\n<p>\r\nThe following code explains how to access standard system functions.\r\nWe slowly print two lines of dots by sleeping for 10&nbsp;milliseconds\r\nafter each dot:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n&#9314;\r\n&#9315;\r\n\r\n\r\n\r\n&#9316;\r\n\r\n\r\n\r\n\r\n\r\n&#9317;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">void Sleep(int ms);\r\nint poll(struct pollfd *fds, unsigned long nfds, int timeout);</span>\r\n]]\r\n\r\nlocal sleep\r\nif ffi.os == \"Windows\" then\r\n  function sleep(s)\r\n    ffi.C.Sleep(s*1000)\r\n  end\r\nelse\r\n  function sleep(s)\r\n    ffi.C.poll(nil, 0, s*1000)\r\n  end\r\nend\r\n\r\nfor i=1,160 do\r\n  io.write(\".\"); io.flush()\r\n  sleep(0.01)\r\nend\r\nio.write(\"\\n\")\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines the\r\nC&nbsp;library functions we're going to use. The part inside the\r\ndouble-brackets (in green) is just standard C&nbsp;syntax. You can\r\nusually get this info from the C&nbsp;header files or the\r\ndocumentation provided by each C&nbsp;library or C&nbsp;compiler.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> The difficulty we're\r\nfacing here, is that there are different standards to choose from.\r\nWindows has a simple <tt>Sleep()</tt> function. On other systems there\r\nare a variety of functions available to achieve sub-second sleeps, but\r\nwith no clear consensus. Thankfully <tt>poll()</tt> can be used for\r\nthis task, too, and it's present on most non-Windows systems. The\r\ncheck for <tt>ffi.os</tt> makes sure we use the Windows-specific\r\nfunction only on Windows systems.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Here we're wrapping the\r\ncall to the C&nbsp;function in a Lua function. This isn't strictly\r\nnecessary, but it's helpful to deal with system-specific issues only\r\nin one part of the code. The way we're wrapping it ensures the check\r\nfor the OS is only done during initialization and not for every call.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> A more subtle point is\r\nthat we defined our <tt>sleep()</tt> function (for the sake of this\r\nexample) as taking the number of seconds, but accepting fractional\r\nseconds. Multiplying this by 1000 gets us milliseconds, but that still\r\nleaves it a Lua number, which is a floating-point value. Alas, the\r\n<tt>Sleep()</tt> function only accepts an integer value. Luckily for\r\nus, the FFI library automatically performs the conversion when calling\r\nthe function (truncating the FP value towards zero, like in C).\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nSome readers will notice that <tt>Sleep()</tt> is part of\r\n<tt>KERNEL32.DLL</tt> and is also a <tt>stdcall</tt> function. So how\r\ncan this possibly work? The FFI library provides the <tt>ffi.C</tt>\r\ndefault C&nbsp;library namespace, which allows calling functions from\r\nthe default set of libraries, like a C&nbsp;compiler would. Also, the\r\nFFI library automatically detects <tt>stdcall</tt> functions, so you\r\ndon't need to declare them as such.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> The <tt>poll()</tt>\r\nfunction takes a couple more arguments we're not going to use. You can\r\nsimply use <tt>nil</tt> to pass a <tt>NULL</tt> pointer and <tt>0</tt>\r\nfor the <tt>nfds</tt> parameter. Please note that the\r\nnumber&nbsp;<tt>0</tt> <em>does not convert to a pointer value</em>,\r\nunlike in C++. You really have to pass pointers to pointer arguments\r\nand numbers to number arguments.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nThe page on <a href=\"ext_ffi_semantics.html\">FFI semantics</a> has all\r\nof the gory details about\r\n<a href=\"ext_ffi_semantics.html#convert\">conversions between Lua\r\nobjects and C&nbsp;types</a>. For the most part you don't have to deal\r\nwith this, as it's performed automatically and it's carefully designed\r\nto bridge the semantic differences between Lua and C.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> Now that we have defined\r\nour own <tt>sleep()</tt> function, we can just call it from plain Lua\r\ncode. That wasn't so bad, huh? Turning these boring animated dots into\r\na fascinating best-selling game is left as an exercise for the reader.\r\n:-)\r\n</p>\r\n\r\n<h2 id=\"zlib\">Accessing the zlib Compression Library</h2>\r\n<p>\r\nThe following code shows how to access the <a\r\nhref=\"http://zlib.net/\">zlib</a> compression library from Lua code.\r\nWe'll define two convenience wrapper functions that take a string and\r\ncompress or uncompress it to another string:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9313;\r\n\r\n\r\n&#9314;\r\n\r\n&#9315;\r\n\r\n\r\n&#9316;\r\n\r\n\r\n&#9317;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n&#9318;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">unsigned long compressBound(unsigned long sourceLen);\r\nint compress2(uint8_t *dest, unsigned long *destLen,\r\n\t      const uint8_t *source, unsigned long sourceLen, int level);\r\nint uncompress(uint8_t *dest, unsigned long *destLen,\r\n\t       const uint8_t *source, unsigned long sourceLen);</span>\r\n]]\r\nlocal zlib = ffi.load(ffi.os == \"Windows\" and \"zlib1\" or \"z\")\r\n\r\nlocal function compress(txt)\r\n  local n = zlib.compressBound(#txt)\r\n  local buf = ffi.new(\"uint8_t[?]\", n)\r\n  local buflen = ffi.new(\"unsigned long[1]\", n)\r\n  local res = zlib.compress2(buf, buflen, txt, #txt, 9)\r\n  assert(res == 0)\r\n  return ffi.string(buf, buflen[0])\r\nend\r\n\r\nlocal function uncompress(comp, n)\r\n  local buf = ffi.new(\"uint8_t[?]\", n)\r\n  local buflen = ffi.new(\"unsigned long[1]\", n)\r\n  local res = zlib.uncompress(buf, buflen, comp, #comp)\r\n  assert(res == 0)\r\n  return ffi.string(buf, buflen[0])\r\nend\r\n\r\n-- Simple test code.\r\nlocal txt = string.rep(\"abcd\", 1000)\r\nprint(\"Uncompressed size: \", #txt)\r\nlocal c = compress(txt)\r\nprint(\"Compressed size: \", #c)\r\nlocal txt2 = uncompress(c, #txt)\r\nassert(txt2 == txt)\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines some of the\r\nC&nbsp;functions provided by zlib. For the sake of this example, some\r\ntype indirections have been reduced and it uses the pre-defined\r\nfixed-size integer types, while still adhering to the zlib API/ABI.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> This loads the zlib shared\r\nlibrary. On POSIX systems it's named <tt>libz.so</tt> and usually\r\ncomes pre-installed. Since <tt>ffi.load()</tt> automatically adds any\r\nmissing standard prefixes/suffixes, we can simply load the\r\n<tt>\"z\"</tt> library. On Windows it's named <tt>zlib1.dll</tt> and\r\nyou'll have to download it first from the\r\n<a href=\"http://zlib.net/\"><span class=\"ext\">&raquo;</span>&nbsp;zlib site</a>. The check for\r\n<tt>ffi.os</tt> makes sure we pass the right name to\r\n<tt>ffi.load()</tt>.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> First, the maximum size of\r\nthe compression buffer is obtained by calling the\r\n<tt>zlib.compressBound</tt> function with the length of the\r\nuncompressed string. The next line allocates a byte buffer of this\r\nsize. The <tt>[?]</tt> in the type specification indicates a\r\nvariable-length array (VLA). The actual number of elements of this\r\narray is given as the 2nd argument to <tt>ffi.new()</tt>.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> This may look strange at\r\nfirst, but have a look at the declaration of the <tt>compress2</tt>\r\nfunction from zlib: the destination length is defined as a pointer!\r\nThis is because you pass in the maximum buffer size and get back the\r\nactual length that was used.\r\n</p>\r\n<p>\r\nIn C you'd pass in the address of a local variable\r\n(<tt>&amp;buflen</tt>). But since there's no address-of operator in\r\nLua, we'll just pass in a one-element array. Conveniently it can be\r\ninitialized with the maximum buffer size in one step. Calling the\r\nactual <tt>zlib.compress2</tt> function is then straightforward.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> We want to return the\r\ncompressed data as a Lua string, so we'll use <tt>ffi.string()</tt>.\r\nIt needs a pointer to the start of the data and the actual length. The\r\nlength has been returned in the <tt>buflen</tt> array, so we'll just\r\nget it from there.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote that since the function returns now, the <tt>buf</tt> and\r\n<tt>buflen</tt> variables will eventually be garbage collected. This\r\nis fine, because <tt>ffi.string()</tt> has copied the contents to a\r\nnewly created (interned) Lua string. If you plan to call this function\r\nlots of times, consider reusing the buffers and/or handing back the\r\nresults in buffers instead of strings. This will reduce the overhead\r\nfor garbage collection and string interning.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> The <tt>uncompress</tt>\r\nfunctions does the exact opposite of the <tt>compress</tt> function.\r\nThe compressed data doesn't include the size of the original string,\r\nso this needs to be passed in. Otherwise no surprises here.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9318;</span> The code, that makes use\r\nof the functions we just defined, is just plain Lua code. It doesn't\r\nneed to know anything about the LuaJIT FFI &mdash; the convenience\r\nwrapper functions completely hide it.\r\n</p>\r\n<p>\r\nOne major advantage of the LuaJIT FFI is that you are now able to\r\nwrite those wrappers <em>in Lua</em>. And at a fraction of the time it\r\nwould cost you to create an extra C&nbsp;module using the Lua/C API.\r\nMany of the simpler C&nbsp;functions can probably be used directly\r\nfrom your Lua code, without any wrappers.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nSide note: the zlib API uses the <tt>long</tt> type for passing\r\nlengths and sizes around. But all those zlib functions actually only\r\ndeal with 32&nbsp;bit values. This is an unfortunate choice for a\r\npublic API, but may be explained by zlib's history &mdash; we'll just\r\nhave to deal with it.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nFirst, you should know that a <tt>long</tt> is a 64&nbsp;bit type e.g.\r\non POSIX/x64 systems, but a 32&nbsp;bit type on Windows/x64 and on\r\n32&nbsp;bit systems. Thus a <tt>long</tt> result can be either a plain\r\nLua number or a boxed 64&nbsp;bit integer cdata object, depending on\r\nthe target system.\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nOk, so the <tt>ffi.*</tt> functions generally accept cdata objects\r\nwherever you'd want to use a number. That's why we get a away with\r\npassing <tt>n</tt> to <tt>ffi.string()</tt> above. But other Lua\r\nlibrary functions or modules don't know how to deal with this. So for\r\nmaximum portability one needs to use <tt>tonumber()</tt> on returned\r\n<tt>long</tt> results before passing them on. Otherwise the\r\napplication might work on some systems, but would fail in a POSIX/x64\r\nenvironment.\r\n</p>\r\n\r\n<h2 id=\"metatype\">Defining Metamethods for a C&nbsp;Type</h2>\r\n<p>\r\nThe following code explains how to define metamethods for a C type.\r\nWe define a simple point type and add some operations to it:\r\n</p>\r\n<pre class=\"code mark\">\r\n<span class=\"codemark\">&nbsp;\r\n&#9312;\r\n\r\n\r\n\r\n&#9313;\r\n\r\n&#9314;\r\n\r\n&#9315;\r\n\r\n\r\n\r\n&#9316;\r\n\r\n&#9317;</span>local ffi = require(\"ffi\")\r\nffi.cdef[[\r\n<span style=\"color:#00a000;\">typedef struct { double x, y; } point_t;</span>\r\n]]\r\n\r\nlocal point\r\nlocal mt = {\r\n  __add = function(a, b) return point(a.x+b.x, a.y+b.y) end,\r\n  __len = function(a) return math.sqrt(a.x*a.x + a.y*a.y) end,\r\n  __index = {\r\n    area = function(a) return a.x*a.x + a.y*a.y end,\r\n  },\r\n}\r\npoint = ffi.metatype(\"point_t\", mt)\r\n\r\nlocal a = point(3, 4)\r\nprint(a.x, a.y)  --> 3  4\r\nprint(#a)        --> 5\r\nprint(a:area())  --> 25\r\nlocal b = a + point(0.5, 8)\r\nprint(#b)        --> 12.5\r\n</pre>\r\n<p>\r\nHere's the step-by-step explanation:\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9312;</span> This defines the C&nbsp;type for a\r\ntwo-dimensional point object.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9313;</span> We have to declare the variable\r\nholding the point constructor first, because it's used inside of a\r\nmetamethod.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9314;</span> Let's define an <tt>__add</tt>\r\nmetamethod which adds the coordinates of two points and creates a new\r\npoint object. For simplicity, this function assumes that both arguments\r\nare points. But it could be any mix of objects, if at least one operand\r\nis of the required type (e.g. adding a point plus a number or vice\r\nversa). Our <tt>__len</tt> metamethod returns the distance of a point to\r\nthe origin.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9315;</span> If we run out of operators, we can\r\ndefine named methods, too. Here the <tt>__index</tt> table defines an\r\n<tt>area</tt> function. For custom indexing needs, one might want to\r\ndefine <tt>__index</tt> and <tt>__newindex</tt> <em>functions</em> instead.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9316;</span> This associates the metamethods with\r\nour C&nbsp;type. This only needs to be done once. For convenience, a\r\nconstructor is returned by\r\n<a href=\"ext_ffi_api.html#ffi_metatype\"><tt>ffi.metatype()</tt></a>.\r\nWe're not required to use it, though. The original C&nbsp;type can still\r\nbe used e.g. to create an array of points. The metamethods automatically\r\napply to any and all uses of this type.\r\n</p>\r\n<p>\r\nPlease note that the association with a metatable is permanent and\r\n<b>the metatable must not be modified afterwards!</b> Ditto for the\r\n<tt>__index</tt> table.\r\n</p>\r\n<p>\r\n<span class=\"mark\">&#9317;</span> Here are some simple usage examples\r\nfor the point type and their expected results. The pre-defined\r\noperations (such as <tt>a.x</tt>) can be freely mixed with the newly\r\ndefined metamethods. Note that <tt>area</tt> is a method and must be\r\ncalled with the Lua syntax for methods: <tt>a:area()</tt>, not\r\n<tt>a.area()</tt>.\r\n</p>\r\n<p>\r\nThe C&nbsp;type metamethod mechanism is most useful when used in\r\nconjunction with C&nbsp;libraries that are written in an object-oriented\r\nstyle. Creators return a pointer to a new instance and methods take an\r\ninstance pointer as the first argument. Sometimes you can just point\r\n<tt>__index</tt> to the library namespace and <tt>__gc</tt> to the\r\ndestructor and you're done. But often enough you'll want to add\r\nconvenience wrappers, e.g. to return actual Lua strings or when\r\nreturning multiple values.\r\n</p>\r\n<p>\r\nSome C libraries only declare instance pointers as an opaque\r\n<tt>void&nbsp;*</tt> type. In this case you can use a fake type for all\r\ndeclarations, e.g. a pointer to a named (incomplete) struct will do:\r\n<tt>typedef struct foo_type *foo_handle</tt>. The C&nbsp;side doesn't\r\nknow what you declare with the LuaJIT FFI, but as long as the underlying\r\ntypes are compatible, everything still works.\r\n</p>\r\n\r\n<h2 id=\"idioms\">Translating C&nbsp;Idioms</h2>\r\n<p>\r\nHere's a list of common C&nbsp;idioms and their translation to the\r\nLuaJIT FFI:\r\n</p>\r\n<table class=\"idiomtable\">\r\n<tr class=\"idiomhead\">\r\n<td class=\"idiomdesc\">Idiom</td>\r\n<td class=\"idiomc\">C&nbsp;code</td>\r\n<td class=\"idiomlua\">Lua code</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"idiomdesc\">Pointer dereference<br><tt>int *p;</tt></td><td class=\"idiomc\"><tt>x = *p;<br>*p = y;</tt></td><td class=\"idiomlua\"><tt>x = <b>p[0]</b><br><b>p[0]</b> = y</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"idiomdesc\">Pointer indexing<br><tt>int i, *p;</tt></td><td class=\"idiomc\"><tt>x = p[i];<br>p[i+1] = y;</tt></td><td class=\"idiomlua\"><tt>x = p[i]<br>p[i+1] = y</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Array indexing<br><tt>int i, a[];</tt></td><td class=\"idiomc\"><tt>x = a[i];<br>a[i+1] = y;</tt></td><td class=\"idiomlua\"><tt>x = a[i]<br>a[i+1] = y</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\"><tt>struct</tt>/<tt>union</tt> dereference<br><tt>struct foo s;</tt></td><td class=\"idiomc\"><tt>x = s.field;<br>s.field = y;</tt></td><td class=\"idiomlua\"><tt>x = s.field<br>s.field = y</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\"><tt>struct</tt>/<tt>union</tt> pointer deref.<br><tt>struct foo *sp;</tt></td><td class=\"idiomc\"><tt>x = sp->field;<br>sp->field = y;</tt></td><td class=\"idiomlua\"><tt>x = <b>s.field</b><br><b>s.field</b> = y</tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\">Pointer arithmetic<br><tt>int i, *p;</tt></td><td class=\"idiomc\"><tt>x = p + i;<br>y = p - i;</tt></td><td class=\"idiomlua\"><tt>x = p + i<br>y = p - i</tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Pointer difference<br><tt>int *p1, *p2;</tt></td><td class=\"idiomc\"><tt>x = p1 - p2;</tt></td><td class=\"idiomlua\"><tt>x = p1 - p2</tt></td></tr>\r\n<tr class=\"even\">\r\n<td class=\"idiomdesc\">Array element pointer<br><tt>int i, a[];</tt></td><td class=\"idiomc\"><tt>x = &amp;a[i];</tt></td><td class=\"idiomlua\"><tt>x = <b>a+i</b></tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\">Cast pointer to address<br><tt>int *p;</tt></td><td class=\"idiomc\"><tt>x = (intptr_t)p;</tt></td><td class=\"idiomlua\"><tt>x = <b>tonumber(<br>&nbsp;ffi.cast(\"intptr_t\",<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p))</b></tt></td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"idiomdesc\">Functions with outargs<br><tt>void foo(int *inoutlen);</tt></td><td class=\"idiomc\"><tt>int len = x;<br>foo(&amp;len);<br>y = len;</tt></td><td class=\"idiomlua\"><tt><b>local len =<br>&nbsp;&nbsp;ffi.new(\"int[1]\", x)<br>foo(len)<br>y = len[0]</b></tt></td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"idiomdesc\"><a href=\"ext_ffi_semantics.html#convert_vararg\">Vararg conversions</a><br><tt>int printf(char *fmt, ...);</tt></td><td class=\"idiomc\"><tt>printf(\"%g\", 1.0);<br>printf(\"%d\", 1);<br>&nbsp;</tt></td><td class=\"idiomlua\"><tt>printf(\"%g\", 1);<br>printf(\"%d\",<br>&nbsp;&nbsp;<b>ffi.new(\"int\", 1)</b>)</tt></td></tr>\r\n</table>\r\n\r\n<h2 id=\"cache\">To Cache or Not to Cache</h2>\r\n<p>\r\nIt's a common Lua idiom to cache library functions in local variables\r\nor upvalues, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nlocal byte, char = string.byte, string.char\r\nlocal function foo(x)\r\n  return char(byte(x)+1)\r\nend\r\n</pre>\r\n<p>\r\nThis replaces several hash-table lookups with a (faster) direct use of\r\na local or an upvalue. This is less important with LuaJIT, since the\r\nJIT compiler optimizes hash-table lookups a lot and is even able to\r\nhoist most of them out of the inner loops. It can't eliminate\r\n<em>all</em> of them, though, and it saves some typing for often-used\r\nfunctions. So there's still a place for this, even with LuaJIT.\r\n</p>\r\n<p>\r\nThe situation is a bit different with C&nbsp;function calls via the\r\nFFI library. The JIT compiler has special logic to eliminate <em>all\r\nof the lookup overhead</em> for functions resolved from a\r\n<a href=\"ext_ffi_semantics.html#clib\">C&nbsp;library namespace</a>!\r\nThus it's not helpful and actually counter-productive to cache\r\nindividual C&nbsp;functions like this:\r\n</p>\r\n<pre class=\"code\">\r\nlocal <b>funca</b>, <b>funcb</b> = ffi.C.funca, ffi.C.funcb -- <span style=\"color:#c00000;\">Not helpful!</span>\r\nlocal function foo(x, n)\r\n  for i=1,n do <b>funcb</b>(<b>funca</b>(x, i), 1) end\r\nend\r\n</pre>\r\n<p>\r\nThis turns them into indirect calls and generates bigger and slower\r\nmachine code. Instead you'll want to cache the namespace itself and\r\nrely on the JIT compiler to eliminate the lookups:\r\n</p>\r\n<pre class=\"code\">\r\nlocal <b>C</b> = ffi.C          -- <span style=\"color:#00a000;\">Instead use this!</span>\r\nlocal function foo(x, n)\r\n  for i=1,n do <b>C.funcb</b>(<b>C.funca</b>(x, i), 1) end\r\nend\r\n</pre>\r\n<p>\r\nThis generates both shorter and faster code. So <b>don't cache\r\nC&nbsp;functions</b>, but <b>do</b> cache namespaces! Most often the\r\nnamespace is already in a local variable at an outer scope, e.g. from\r\n<tt>local&nbsp;lib&nbsp;=&nbsp;ffi.load(...)</tt>. Note that copying\r\nit to a local variable in the function scope is unnecessary.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_jit.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>jit.* Library</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1><tt>jit.*</tt> Library</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nThe functions in this built-in module control the behavior of the JIT\r\ncompiler engine. Note that JIT-compilation is fully automatic &mdash;\r\nyou probably won't need to use any of the following functions unless\r\nyou have special needs.\r\n</p>\r\n\r\n<h3 id=\"jit_onoff\"><tt>jit.on()<br>\r\njit.off()</tt></h3>\r\n<p>\r\nTurns the whole JIT compiler on (default) or off.\r\n</p>\r\n<p>\r\nThese functions are typically used with the command line options\r\n<tt>-j on</tt> or <tt>-j off</tt>.\r\n</p>\r\n\r\n<h3 id=\"jit_flush\"><tt>jit.flush()</tt></h3>\r\n<p>\r\nFlushes the whole cache of compiled code.\r\n</p>\r\n\r\n<h3 id=\"jit_onoff_func\"><tt>jit.on(func|true [,true|false])<br>\r\njit.off(func|true [,true|false])<br>\r\njit.flush(func|true [,true|false])</tt></h3>\r\n<p>\r\n<tt>jit.on</tt> enables JIT compilation for a Lua function (this is\r\nthe default).\r\n</p>\r\n<p>\r\n<tt>jit.off</tt> disables JIT compilation for a Lua function and\r\nflushes any already compiled code from the code cache.\r\n</p>\r\n<p>\r\n<tt>jit.flush</tt> flushes the code, but doesn't affect the\r\nenable/disable status.\r\n</p>\r\n<p>\r\nThe current function, i.e. the Lua function calling this library\r\nfunction, can also be specified by passing <tt>true</tt> as the first\r\nargument.\r\n</p>\r\n<p>\r\nIf the second argument is <tt>true</tt>, JIT compilation is also\r\nenabled, disabled or flushed recursively for all sub-functions of a\r\nfunction. With <tt>false</tt> only the sub-functions are affected.\r\n</p>\r\n<p>\r\nThe <tt>jit.on</tt> and <tt>jit.off</tt> functions only set a flag\r\nwhich is checked when the function is about to be compiled. They do\r\nnot trigger immediate compilation.\r\n</p>\r\n<p>\r\nTypical usage is <tt>jit.off(true, true)</tt> in the main chunk\r\nof a module to turn off JIT compilation for the whole module for\r\ndebugging purposes.\r\n</p>\r\n\r\n<h3 id=\"jit_flush_tr\"><tt>jit.flush(tr)</tt></h3>\r\n<p>\r\nFlushes the root trace, specified by its number, and all of its side\r\ntraces from the cache. The code for the trace will be retained as long\r\nas there are any other traces which link to it.\r\n</p>\r\n\r\n<h3 id=\"jit_status\"><tt>status, ... = jit.status()</tt></h3>\r\n<p>\r\nReturns the current status of the JIT compiler. The first result is\r\neither <tt>true</tt> or <tt>false</tt> if the JIT compiler is turned\r\non or off. The remaining results are strings for CPU-specific features\r\nand enabled optimizations.\r\n</p>\r\n\r\n<h3 id=\"jit_version\"><tt>jit.version</tt></h3>\r\n<p>\r\nContains the LuaJIT version string.\r\n</p>\r\n\r\n<h3 id=\"jit_version_num\"><tt>jit.version_num</tt></h3>\r\n<p>\r\nContains the version number of the LuaJIT core. Version xx.yy.zz\r\nis represented by the decimal number xxyyzz.\r\n</p>\r\n\r\n<h3 id=\"jit_os\"><tt>jit.os</tt></h3>\r\n<p>\r\nContains the target OS name:\r\n\"Windows\", \"Linux\", \"OSX\", \"BSD\", \"POSIX\" or \"Other\".\r\n</p>\r\n\r\n<h3 id=\"jit_arch\"><tt>jit.arch</tt></h3>\r\n<p>\r\nContains the target architecture name:\r\n\"x86\", \"x64\", \"arm\", \"ppc\", or \"mips\".\r\n</p>\r\n\r\n<h2 id=\"jit_opt\"><tt>jit.opt.*</tt> &mdash; JIT compiler optimization control</h2>\r\n<p>\r\nThis sub-module provides the backend for the <tt>-O</tt> command line\r\noption.\r\n</p>\r\n<p>\r\nYou can also use it programmatically, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\njit.opt.start(2) -- same as -O2\r\njit.opt.start(\"-dce\")\r\njit.opt.start(\"hotloop=10\", \"hotexit=2\")\r\n</pre>\r\n<p>\r\nUnlike in LuaJIT 1.x, the module is built-in and\r\n<b>optimization is turned on by default!</b>\r\nIt's no longer necessary to run <tt>require(\"jit.opt\").start()</tt>,\r\nwhich was one of the ways to enable optimization.\r\n</p>\r\n\r\n<h2 id=\"jit_util\"><tt>jit.util.*</tt> &mdash; JIT compiler introspection</h2>\r\n<p>\r\nThis sub-module holds functions to introspect the bytecode, generated\r\ntraces, the IR and the generated machine code. The functionality\r\nprovided by this module is still in flux and therefore undocumented.\r\n</p>\r\n<p>\r\nThe debug modules <tt>-jbc</tt>, <tt>-jv</tt> and <tt>-jdump</tt> make\r\nextensive use of these functions. Please check out their source code,\r\nif you want to know more.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/ext_profiler.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Profiler</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Profiler</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a class=\"current\" href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT has an integrated statistical profiler with very low overhead. It\r\nallows sampling the currently executing stack and other parameters in\r\nregular intervals.\r\n</p>\r\n<p>\r\nThe integrated profiler can be accessed from three levels:\r\n</p>\r\n<ul>\r\n<li>The <a href=\"#hl_profiler\">bundled high-level profiler</a>, invoked by the\r\n<a href=\"#j_p\"><tt>-jp</tt></a> command line option.</li>\r\n<li>A <a href=\"#ll_lua_api\">low-level Lua API</a> to control the profiler.</li>\r\n<li>A <a href=\"#ll_c_api\">low-level C API</a> to control the profiler.</li>\r\n</ul>\r\n\r\n<h2 id=\"hl_profiler\">High-Level Profiler</h2>\r\n<p>\r\nThe bundled high-level profiler offers basic profiling functionality. It\r\ngenerates simple textual summaries or source code annotations. It can be\r\naccessed with the <a href=\"#j_p\"><tt>-jp</tt></a> command line option\r\nor from Lua code by loading the underlying <tt>jit.p</tt> module.\r\n</p>\r\n<p>\r\nTo cut to the chase &mdash; run this to get a CPU usage profile by\r\nfunction name:\r\n</p>\r\n<pre class=\"code\">\r\nluajit -jp myapp.lua\r\n</pre>\r\n<p>\r\nIt's <em>not</em> a stated goal of the bundled profiler to add every\r\npossible option or to cater for special profiling needs. The low-level\r\nprofiler APIs are documented below. They may be used by third-party\r\nauthors to implement advanced functionality, e.g. IDE integration or\r\ngraphical profilers.\r\n</p>\r\n<p>\r\nNote: Sampling works for both interpreted and JIT-compiled code. The\r\nresults for JIT-compiled code may sometimes be surprising. LuaJIT\r\nheavily optimizes and inlines Lua code &mdash; there's no simple\r\none-to-one correspondence between source code lines and the sampled\r\nmachine code.\r\n</p>\r\n\r\n<h3 id=\"j_p\"><tt>-jp=[options[,output]]</tt></h3>\r\n<p>\r\nThe <tt>-jp</tt> command line option starts the high-level profiler.\r\nWhen the application run by the command line terminates, the profiler\r\nstops and writes the results to <tt>stdout</tt> or to the specified\r\n<tt>output</tt> file.\r\n</p>\r\n<p>\r\nThe <tt>options</tt> argument specifies how the profiling is to be\r\nperformed:\r\n</p>\r\n<ul>\r\n<li><tt>f</tt> &mdash; Stack dump: function name, otherwise module:line.\r\nThis is the default mode.</li>\r\n<li><tt>F</tt> &mdash; Stack dump: ditto, but dump module:name.</li>\r\n<li><tt>l</tt> &mdash; Stack dump: module:line.</li>\r\n<li><tt>&lt;number&gt;</tt> &mdash; stack dump depth (callee &larr;\r\ncaller). Default: 1.</li>\r\n<li><tt>-&lt;number&gt;</tt> &mdash; Inverse stack dump depth (caller\r\n&rarr; callee).</li>\r\n<li><tt>s</tt> &mdash; Split stack dump after first stack level. Implies\r\ndepth&nbsp;&ge;&nbsp;2 or depth&nbsp;&le;&nbsp;-2.</li>\r\n<li><tt>p</tt> &mdash; Show full path for module names.</li>\r\n<li><tt>v</tt> &mdash; Show VM states.</li>\r\n<li><tt>z</tt> &mdash; Show <a href=\"#jit_zone\">zones</a>.</li>\r\n<li><tt>r</tt> &mdash; Show raw sample counts. Default: show percentages.</li>\r\n<li><tt>a</tt> &mdash; Annotate excerpts from source code files.</li>\r\n<li><tt>A</tt> &mdash; Annotate complete source code files.</li>\r\n<li><tt>G</tt> &mdash; Produce raw output suitable for graphical tools.</li>\r\n<li><tt>m&lt;number&gt;</tt> &mdash; Minimum sample percentage to be shown.\r\nDefault: 3%.</li>\r\n<li><tt>i&lt;number&gt;</tt> &mdash; Sampling interval in milliseconds.\r\nDefault: 10ms.<br>\r\nNote: The actual sampling precision is OS-dependent.</li>\r\n</ul>\r\n<p>\r\nThe default output for <tt>-jp</tt> is a list of the most CPU consuming\r\nspots in the application. Increasing the stack dump depth with (say)\r\n<tt>-jp=2</tt> may help to point out the main callers or callees of\r\nhotspots. But sample aggregation is still flat per unique stack dump.\r\n</p>\r\n<p>\r\nTo get a two-level view (split view) of callers/callees, use\r\n<tt>-jp=s</tt> or <tt>-jp=-s</tt>. The percentages shown for the second\r\nlevel are relative to the first level.\r\n</p>\r\n<p>\r\nTo see how much time is spent in each line relative to a function, use\r\n<tt>-jp=fl</tt>.\r\n</p>\r\n<p>\r\nTo see how much time is spent in different VM states or\r\n<a href=\"#jit_zone\">zones</a>, use <tt>-jp=v</tt> or <tt>-jp=z</tt>.\r\n</p>\r\n<p>\r\nCombinations of <tt>v/z</tt> with <tt>f/F/l</tt> produce two-level\r\nviews, e.g. <tt>-jp=vf</tt> or <tt>-jp=fv</tt>. This shows the time\r\nspent in a VM state or zone vs. hotspots. This can be used to answer\r\nquestions like \"Which time consuming functions are only interpreted?\" or\r\n\"What's the garbage collector overhead for a specific function?\".\r\n</p>\r\n<p>\r\nMultiple options can be combined &mdash; but not all combinations make\r\nsense, see above. E.g. <tt>-jp=3si4m1</tt> samples three stack levels\r\ndeep in 4ms intervals and shows a split view of the CPU consuming\r\nfunctions and their callers with a 1% threshold.\r\n</p>\r\n<p>\r\nSource code annotations produced by <tt>-jp=a</tt> or <tt>-jp=A</tt> are\r\nalways flat and at the line level. Obviously, the source code files need\r\nto be readable by the profiler script.\r\n</p>\r\n<p>\r\nThe high-level profiler can also be started and stopped from Lua code with:\r\n</p>\r\n<pre class=\"code\">\r\nrequire(\"jit.p\").start(options, output)\r\n...\r\nrequire(\"jit.p\").stop()\r\n</pre>\r\n\r\n<h3 id=\"jit_zone\"><tt>jit.zone</tt> &mdash; Zones</h3>\r\n<p>\r\nZones can be used to provide information about different parts of an\r\napplication to the high-level profiler. E.g. a game could make use of an\r\n<tt>\"AI\"</tt> zone, a <tt>\"PHYS\"</tt> zone, etc. Zones are hierarchical,\r\norganized as a stack.\r\n</p>\r\n<p>\r\nThe <tt>jit.zone</tt> module needs to be loaded explicitly:\r\n</p>\r\n<pre class=\"code\">\r\nlocal zone = require(\"jit.zone\")\r\n</pre>\r\n<ul>\r\n<li><tt>zone(\"name\")</tt> pushes a named zone to the zone stack.</li>\r\n<li><tt>zone()</tt> pops the current zone from the zone stack and\r\nreturns its name.</li>\r\n<li><tt>zone:get()</tt> returns the current zone name or <tt>nil</tt>.</li>\r\n<li><tt>zone:flush()</tt> flushes the zone stack.</li>\r\n</ul>\r\n<p>\r\nTo show the time spent in each zone use <tt>-jp=z</tt>. To show the time\r\nspent relative to hotspots use e.g. <tt>-jp=zf</tt> or <tt>-jp=fz</tt>.\r\n</p>\r\n\r\n<h2 id=\"ll_lua_api\">Low-level Lua API</h2>\r\n<p>\r\nThe <tt>jit.profile</tt> module gives access to the low-level API of the\r\nprofiler from Lua code. This module needs to be loaded explicitly:\r\n<pre class=\"code\">\r\nlocal profile = require(\"jit.profile\")\r\n</pre>\r\n<p>\r\nThis module can be used to implement your own higher-level profiler.\r\nA typical profiling run starts the profiler, captures stack dumps in\r\nthe profiler callback, adds them to a hash table to aggregate the number\r\nof samples, stops the profiler and then analyzes all of the captured\r\nstack dumps. Other parameters can be sampled in the profiler callback,\r\ntoo. But it's important not to spend too much time in the callback,\r\nsince this may skew the statistics.\r\n</p>\r\n\r\n<h3 id=\"profile_start\"><tt>profile.start(mode, cb)</tt>\r\n&mdash; Start profiler</h3>\r\n<p>\r\nThis function starts the profiler. The <tt>mode</tt> argument is a\r\nstring holding options:\r\n</p>\r\n<ul>\r\n<li><tt>f</tt> &mdash; Profile with precision down to the function level.</li>\r\n<li><tt>l</tt> &mdash; Profile with precision down to the line level.</li>\r\n<li><tt>i&lt;number&gt;</tt> &mdash; Sampling interval in milliseconds (default\r\n10ms).</br>\r\nNote: The actual sampling precision is OS-dependent.\r\n</li>\r\n</ul>\r\n<p>\r\nThe <tt>cb</tt> argument is a callback function which is called with\r\nthree arguments: <tt>(thread, samples, vmstate)</tt>. The callback is\r\ncalled on a separate coroutine, the <tt>thread</tt> argument is the\r\nstate that holds the stack to sample for profiling. Note: do\r\n<em>not</em> modify the stack of that state or call functions on it.\r\n</p>\r\n<p>\r\n<tt>samples</tt> gives the number of accumulated samples since the last\r\ncallback (usually 1).\r\n</p>\r\n<p>\r\n<tt>vmstate</tt> holds the VM state at the time the profiling timer\r\ntriggered. This may or may not correspond to the state of the VM when\r\nthe profiling callback is called. The state is either <tt>'N'</tt>\r\nnative (compiled) code, <tt>'I'</tt> interpreted code, <tt>'C'</tt>\r\nC&nbsp;code, <tt>'G'</tt> the garbage collector, or <tt>'J'</tt> the JIT\r\ncompiler.\r\n</p>\r\n\r\n<h3 id=\"profile_stop\"><tt>profile.stop()</tt>\r\n&mdash; Stop profiler</h3>\r\n<p>\r\nThis function stops the profiler.\r\n</p>\r\n\r\n<h3 id=\"profile_dump\"><tt>dump = profile.dumpstack([thread,] fmt, depth)</tt>\r\n&mdash; Dump stack </h3>\r\n<p>\r\nThis function allows taking stack dumps in an efficient manner. It\r\nreturns a string with a stack dump for the <tt>thread</tt> (coroutine),\r\nformatted according to the <tt>fmt</tt> argument:\r\n</p>\r\n<ul>\r\n<li><tt>p</tt> &mdash; Preserve the full path for module names. Otherwise\r\nonly the file name is used.</li>\r\n<li><tt>f</tt> &mdash; Dump the function name if it can be derived. Otherwise\r\nuse module:line.</li>\r\n<li><tt>F</tt> &mdash; Ditto, but dump module:name.</li>\r\n<li><tt>l</tt> &mdash; Dump module:line.</li>\r\n<li><tt>Z</tt> &mdash; Zap the following characters for the last dumped\r\nframe.</li>\r\n<li>All other characters are added verbatim to the output string.</li>\r\n</ul>\r\n<p>\r\nThe <tt>depth</tt> argument gives the number of frames to dump, starting\r\nat the topmost frame of the thread. A negative number dumps the frames in\r\ninverse order.\r\n</p>\r\n<p>\r\nThe first example prints a list of the current module names and line\r\nnumbers of up to 10 frames in separate lines. The second example prints\r\nsemicolon-separated function names for all frames (up to 100) in inverse\r\norder:\r\n</p>\r\n<pre class=\"code\">\r\nprint(profile.dumpstack(thread, \"l\\n\", 10))\r\nprint(profile.dumpstack(thread, \"lZ;\", -100))\r\n</pre>\r\n\r\n<h2 id=\"ll_c_api\">Low-level C API</h2>\r\n<p>\r\nThe profiler can be controlled directly from C&nbsp;code, e.g. for\r\nuse by IDEs. The declarations are in <tt>\"luajit.h\"</tt> (see\r\n<a href=\"ext_c_api.html\">Lua/C API</a> extensions).\r\n</p>\r\n\r\n<h3 id=\"luaJIT_profile_start\"><tt>luaJIT_profile_start(L, mode, cb, data)</tt>\r\n&mdash; Start profiler</h3>\r\n<p>\r\nThis function starts the profiler. <a href=\"#profile_start\">See\r\nabove</a> for a description of the <tt>mode</tt> argument.\r\n</p>\r\n<p>\r\nThe <tt>cb</tt> argument is a callback function with the following\r\ndeclaration:\r\n</p>\r\n<pre class=\"code\">\r\ntypedef void (*luaJIT_profile_callback)(void *data, lua_State *L,\r\n                                        int samples, int vmstate);\r\n</pre>\r\n<p>\r\n<tt>data</tt> is available for use by the callback. <tt>L</tt> is the\r\nstate that holds the stack to sample for profiling. Note: do\r\n<em>not</em> modify this stack or call functions on this stack &mdash;\r\nuse a separate coroutine for this purpose. <a href=\"#profile_start\">See\r\nabove</a> for a description of <tt>samples</tt> and <tt>vmstate</tt>.\r\n</p>\r\n\r\n<h3 id=\"luaJIT_profile_stop\"><tt>luaJIT_profile_stop(L)</tt>\r\n&mdash; Stop profiler</h3>\r\n<p>\r\nThis function stops the profiler.\r\n</p>\r\n\r\n<h3 id=\"luaJIT_profile_dumpstack\"><tt>p = luaJIT_profile_dumpstack(L, fmt, depth, len)</tt>\r\n&mdash; Dump stack </h3>\r\n<p>\r\nThis function allows taking stack dumps in an efficient manner.\r\n<a href=\"#profile_dump\">See above</a> for a description of <tt>fmt</tt>\r\nand <tt>depth</tt>.\r\n</p>\r\n<p>\r\nThis function returns a <tt>const&nbsp;char&nbsp;*</tt> pointing to a\r\nprivate string buffer of the profiler. The <tt>int&nbsp;*len</tt>\r\nargument returns the length of the output string. The buffer is\r\noverwritten on the next call and deallocated when the profiler stops.\r\nYou either need to consume the content immediately or copy it for later\r\nuse.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/extensions.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Extensions</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.exc {\r\n  line-height: 1.2;\r\n}\r\ntr.exchead td {\r\n  font-weight: bold;\r\n}\r\ntd.excplatform {\r\n  width: 48%;\r\n}\r\ntd.exccompiler {\r\n  width: 29%;\r\n}\r\ntd.excinterop {\r\n  width: 23%;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Extensions</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is fully upwards-compatible with Lua 5.1. It supports all\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#5\"><span class=\"ext\">&raquo;</span>&nbsp;standard Lua\r\nlibrary functions</a> and the full set of\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#3\"><span class=\"ext\">&raquo;</span>&nbsp;Lua/C API\r\nfunctions</a>.\r\n</p>\r\n<p>\r\nLuaJIT is also fully ABI-compatible to Lua 5.1 at the linker/dynamic\r\nloader level. This means you can compile a C&nbsp;module against the\r\nstandard Lua headers and load the same shared library from either Lua\r\nor LuaJIT.\r\n</p>\r\n<p>\r\nLuaJIT extends the standard Lua VM with new functionality and adds\r\nseveral extension modules. Please note this page is only about\r\n<em>functional</em> enhancements and not about performance enhancements,\r\nsuch as the optimized VM, the faster interpreter or the JIT compiler.\r\n</p>\r\n\r\n<h2 id=\"modules\">Extensions Modules</h2>\r\n<p>\r\nLuaJIT comes with several built-in extension modules:\r\n</p>\r\n\r\n<h3 id=\"bit\"><tt>bit.*</tt> &mdash; Bitwise operations</h3>\r\n<p>\r\nLuaJIT supports all bitwise operations as defined by\r\n<a href=\"http://bitop.luajit.org\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp</a>:\r\n</p>\r\n<pre class=\"code\">\r\nbit.tobit  bit.tohex  bit.bnot    bit.band bit.bor  bit.bxor\r\nbit.lshift bit.rshift bit.arshift bit.rol  bit.ror  bit.bswap\r\n</pre>\r\n<p>\r\nThis module is a LuaJIT built-in &mdash; you don't need to download or\r\ninstall Lua BitOp. The Lua BitOp site has full documentation for all\r\n<a href=\"http://bitop.luajit.org/api.html\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp API functions</a>.\r\nThe FFI adds support for\r\n<a href=\"ext_ffi_semantics.html#cdata_arith\">64&nbsp;bit bitwise operations</a>,\r\nusing the same API functions.\r\n</p>\r\n<p>\r\nPlease make sure to <tt>require</tt> the module before using any of\r\nits functions:\r\n</p>\r\n<pre class=\"code\">\r\nlocal bit = require(\"bit\")\r\n</pre>\r\n<p>\r\nAn already installed Lua BitOp module is ignored by LuaJIT.\r\nThis way you can use bit operations from both Lua and LuaJIT on a\r\nshared installation.\r\n</p>\r\n\r\n<h3 id=\"ffi\"><tt>ffi.*</tt> &mdash; FFI library</h3>\r\n<p>\r\nThe <a href=\"ext_ffi.html\">FFI library</a> allows calling external\r\nC&nbsp;functions and the use of C&nbsp;data structures from pure Lua\r\ncode.\r\n</p>\r\n\r\n<h3 id=\"jit\"><tt>jit.*</tt> &mdash; JIT compiler control</h3>\r\n<p>\r\nThe functions in this module\r\n<a href=\"ext_jit.html\">control the behavior of the JIT compiler engine</a>.\r\n</p>\r\n\r\n<h3 id=\"c_api\">C API extensions</h3>\r\n<p>\r\nLuaJIT adds some\r\n<a href=\"ext_c_api.html\">extra functions to the Lua/C API</a>.\r\n</p>\r\n\r\n<h3 id=\"profiler\">Profiler</h3>\r\n<p>\r\nLuaJIT has an <a href=\"ext_profiler.html\">integrated profiler</a>.\r\n</p>\r\n\r\n<h2 id=\"library\">Enhanced Standard Library Functions</h2>\r\n\r\n<h3 id=\"xpcall\"><tt>xpcall(f, err [,args...])</tt> passes arguments</h3>\r\n<p>\r\nUnlike the standard implementation in Lua 5.1, <tt>xpcall()</tt>\r\npasses any arguments after the error function to the function\r\nwhich is called in a protected context.\r\n</p>\r\n\r\n<h3 id=\"load\"><tt>loadfile()</tt> etc. handle UTF-8 source code</h3>\r\n<p>\r\nNon-ASCII characters are handled transparently by the Lua source code parser.\r\nThis allows the use of UTF-8 characters in identifiers and strings.\r\nA UTF-8 BOM is skipped at the start of the source code.\r\n</p>\r\n\r\n<h3 id=\"tostring\"><tt>tostring()</tt> etc. canonicalize NaN and &plusmn;Inf</h3>\r\n<p>\r\nAll number-to-string conversions consistently convert non-finite numbers\r\nto the same strings on all platforms. NaN results in <tt>\"nan\"</tt>,\r\npositive infinity results in <tt>\"inf\"</tt> and negative infinity results\r\nin <tt>\"-inf\"</tt>.\r\n</p>\r\n\r\n<h3 id=\"tonumber\"><tt>tonumber()</tt> etc. use builtin string to number conversion</h3>\r\n<p>\r\nAll string-to-number conversions consistently convert integer and\r\nfloating-point inputs in decimal, hexadecimal and binary on all platforms.\r\n<tt>strtod()</tt> is <em>not</em> used anymore, which avoids numerous\r\nproblems with poor C library implementations. The builtin conversion\r\nfunction provides full precision according to the IEEE-754 standard, it\r\nworks independently of the current locale and it supports hex floating-point\r\nnumbers (e.g. <tt>0x1.5p-3</tt>).\r\n</p>\r\n\r\n<h3 id=\"string_dump\"><tt>string.dump(f [,strip])</tt> generates portable bytecode</h3>\r\n<p>\r\nAn extra argument has been added to <tt>string.dump()</tt>. If set to\r\n<tt>true</tt>, 'stripped' bytecode without debug information is\r\ngenerated. This speeds up later bytecode loading and reduces memory\r\nusage. See also the\r\n<a href=\"running.html#opt_b\"><tt>-b</tt> command line option</a>.\r\n</p>\r\n<p>\r\nThe generated bytecode is portable and can be loaded on any architecture\r\nthat LuaJIT supports, independent of word size or endianess. However the\r\nbytecode compatibility versions must match. Bytecode stays compatible\r\nfor dot releases (x.y.0 &rarr; x.y.1), but may change with major or\r\nminor releases (2.0 &rarr; 2.1) or between any beta release. Foreign\r\nbytecode (e.g. from Lua 5.1) is incompatible and cannot be loaded.\r\n</p>\r\n<p>\r\nNote: <tt>LJ_GC64</tt> mode requires a different frame layout, which implies\r\na different, incompatible bytecode format for ports that use this mode (e.g.\r\nARM64). This may be rectified in the future.\r\n</p>\r\n\r\n<h3 id=\"table_new\"><tt>table.new(narray, nhash)</tt> allocates a pre-sized table</h3>\r\n<p>\r\nAn extra library function <tt>table.new()</tt> can be made available via\r\n<tt>require(\"table.new\")</tt>. This creates a pre-sized table, just like\r\nthe C API equivalent <tt>lua_createtable()</tt>. This is useful for big\r\ntables if the final table size is known and automatic table resizing is\r\ntoo expensive.\r\n</p>\r\n\r\n<h3 id=\"table_clear\"><tt>table.clear(tab)</tt> clears a table</h3>\r\n<p>\r\nAn extra library function <tt>table.clear()</tt> can be made available\r\nvia <tt>require(\"table.clear\")</tt>. This clears all keys and values\r\nfrom a table, but preserves the allocated array/hash sizes. This is\r\nuseful when a table, which is linked from multiple places, needs to be\r\ncleared and/or when recycling a table for use by the same context. This\r\navoids managing backlinks, saves an allocation and the overhead of\r\nincremental array/hash part growth.\r\n</p>\r\n<p>\r\nPlease note this function is meant for very specific situations. In most\r\ncases it's better to replace the (usually single) link with a new table\r\nand let the GC do its work.\r\n</p>\r\n\r\n<h3 id=\"math_random\">Enhanced PRNG for <tt>math.random()</tt></h3>\r\n<p>\r\nLuaJIT uses a Tausworthe PRNG with period 2^223 to implement\r\n<tt>math.random()</tt> and <tt>math.randomseed()</tt>. The quality of\r\nthe PRNG results is much superior compared to the standard Lua\r\nimplementation which uses the platform-specific ANSI rand().\r\n</p>\r\n<p>\r\nThe PRNG generates the same sequences from the same seeds on all\r\nplatforms and makes use of all bits in the seed argument.\r\n<tt>math.random()</tt> without arguments generates 52 pseudo-random bits\r\nfor every call. The result is uniformly distributed between 0.0 and 1.0.\r\nIt's correctly scaled up and rounded for <tt>math.random(n&nbsp;[,m])</tt> to\r\npreserve uniformity.\r\n</p>\r\n\r\n<h3 id=\"io\"><tt>io.*</tt> functions handle 64&nbsp;bit file offsets</h3>\r\n<p>\r\nThe file I/O functions in the standard <tt>io.*</tt> library handle\r\n64&nbsp;bit file offsets. In particular this means it's possible\r\nto open files larger than 2&nbsp;Gigabytes and to reposition or obtain\r\nthe current file position for offsets beyond 2&nbsp;GB\r\n(<tt>fp:seek()</tt> method).\r\n</p>\r\n\r\n<h3 id=\"debug_meta\"><tt>debug.*</tt> functions identify metamethods</h3>\r\n<p>\r\n<tt>debug.getinfo()</tt> and <tt>lua_getinfo()</tt> also return information\r\nabout invoked metamethods. The <tt>namewhat</tt> field is set to\r\n<tt>\"metamethod\"</tt> and the <tt>name</tt> field has the name of\r\nthe corresponding metamethod (e.g. <tt>\"__index\"</tt>).\r\n</p>\r\n\r\n<h2 id=\"resumable\">Fully Resumable VM</h2>\r\n<p>\r\nThe LuaJIT VM is fully resumable. This means you can yield from a\r\ncoroutine even across contexts, where this would not possible with\r\nthe standard Lua&nbsp;5.1 VM: e.g. you can yield across <tt>pcall()</tt>\r\nand <tt>xpcall()</tt>, across iterators and across metamethods.\r\n</p>\r\n\r\n<h2 id=\"lua52\">Extensions from Lua 5.2</h2>\r\n<p>\r\nLuaJIT supports some language and library extensions from Lua&nbsp;5.2.\r\nFeatures that are unlikely to break existing code are unconditionally\r\nenabled:\r\n</p>\r\n<ul>\r\n<li><tt>goto</tt> and <tt>::labels::</tt>.</li>\r\n<li>Hex escapes <tt>'\\x3F'</tt> and <tt>'\\*'</tt> escape in strings.</li>\r\n<li><tt>load(string|reader [, chunkname [,mode [,env]]])</tt>.</li>\r\n<li><tt>loadstring()</tt> is an alias for <tt>load()</tt>.</li>\r\n<li><tt>loadfile(filename [,mode [,env]])</tt>.</li>\r\n<li><tt>math.log(x [,base])</tt>.\r\n<li><tt>string.rep(s, n [,sep])</tt>.\r\n<li><tt>string.format()</tt>: <tt>%q</tt> reversible.\r\n<tt>%s</tt> checks <tt>__tostring</tt>.\r\n<tt>%a</tt> and <tt>\"%A</tt> added.</li>\r\n<li>String matching pattern <tt>%g</tt> added.</li>\r\n<li><tt>io.read(\"*L\")</tt>.</li>\r\n<li><tt>io.lines()</tt> and <tt>file:lines()</tt> process\r\n<tt>io.read()</tt> options.</li>\r\n<li><tt>os.exit(status|true|false [,close])</tt>.</li>\r\n<li><tt>package.searchpath(name, path [, sep [, rep]])</tt>.</li>\r\n<li><tt>package.loadlib(name, \"*\")</tt>.</li>\r\n<li><tt>debug.getinfo()</tt> returns <tt>nparams</tt> and <tt>isvararg</tt>\r\nfor option <tt>\"u\"</tt>.</li>\r\n<li><tt>debug.getlocal()</tt> accepts function instead of level.</li>\r\n<li><tt>debug.getlocal()</tt> and <tt>debug.setlocal()</tt> accept negative\r\nindexes for varargs.</li>\r\n<li><tt>debug.getupvalue()</tt> and <tt>debug.setupvalue()</tt> handle\r\nC&nbsp;functions.</li>\r\n<li><tt>debug.upvalueid()</tt> and <tt>debug.upvaluejoin()</tt>.</li>\r\n<li>Command line option <tt>-E</tt>.</li>\r\n<li>Command line checks <tt>__tostring</tt> for errors.</li>\r\n</ul>\r\n<p>\r\nOther features are only enabled, if LuaJIT is built with\r\n<tt>-DLUAJIT_ENABLE_LUA52COMPAT</tt>:\r\n</p>\r\n<ul>\r\n<li><tt>goto</tt> is a keyword and not a valid variable name anymore.</li>\r\n<li><tt>break</tt> can be placed anywhere. Empty statements (<tt>;;</tt>)\r\nare allowed.</li>\r\n<li><tt>__lt</tt>, <tt>__le</tt> are invoked for mixed types.</li>\r\n<li><tt>__len</tt> for tables. <tt>rawlen()</tt> library function.</li>\r\n<li><tt>pairs()</tt> and <tt>ipairs()</tt> check for <tt>__pairs</tt> and\r\n<tt>__ipairs</tt>.</li>\r\n<li><tt>coroutine.running()</tt> returns two results.</li>\r\n<li><tt>table.pack()</tt> and <tt>table.unpack()</tt>\r\n(same as <tt>unpack()</tt>).</li>\r\n<li><tt>io.write()</tt> and <tt>file:write()</tt> return file handle\r\ninstead of <tt>true</tt>.</li>\r\n<li><tt>os.execute()</tt> and <tt>pipe:close()</tt> return detailed\r\nexit status.</li>\r\n<li><tt>debug.setmetatable()</tt> returns object.</li>\r\n<li><tt>debug.getuservalue()</tt> and <tt>debug.setuservalue()</tt>.</li>\r\n<li>Remove <tt>math.mod()</tt>, <tt>string.gfind()</tt>.\r\n</ul>\r\n<p>\r\nNote: this provides only partial compatibility with Lua 5.2 at the\r\nlanguage and Lua library level. LuaJIT is API+ABI-compatible with\r\nLua&nbsp;5.1, which prevents implementing features that would otherwise\r\nbreak the Lua/C API and ABI (e.g. <tt>_ENV</tt>).\r\n</p>\r\n\r\n<h2 id=\"exceptions\">C++ Exception Interoperability</h2>\r\n<p>\r\nLuaJIT has built-in support for interoperating with C++&nbsp;exceptions.\r\nThe available range of features depends on the target platform and\r\nthe toolchain used to compile LuaJIT:\r\n</p>\r\n<table class=\"exc\">\r\n<tr class=\"exchead\">\r\n<td class=\"excplatform\">Platform</td>\r\n<td class=\"exccompiler\">Compiler</td>\r\n<td class=\"excinterop\">Interoperability</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"excplatform\">POSIX/x64, DWARF2 unwinding</td>\r\n<td class=\"exccompiler\">GCC 4.3+</td>\r\n<td class=\"excinterop\"><b style=\"color: #00a000;\">Full</b></td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"excplatform\">Other platforms, DWARF2 unwinding</td>\r\n<td class=\"exccompiler\">GCC</td>\r\n<td class=\"excinterop\"><b style=\"color: #c06000;\">Limited</b></td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"excplatform\">Windows/x64</td>\r\n<td class=\"exccompiler\">MSVC or WinSDK</td>\r\n<td class=\"excinterop\"><b style=\"color: #00a000;\">Full</b></td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"excplatform\">Windows/x86</td>\r\n<td class=\"exccompiler\">Any</td>\r\n<td class=\"excinterop\"><b style=\"color: #a00000;\">No</b></td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"excplatform\">Other platforms</td>\r\n<td class=\"exccompiler\">Other compilers</td>\r\n<td class=\"excinterop\"><b style=\"color: #a00000;\">No</b></td>\r\n</tr>\r\n</table>\r\n<p>\r\n<b style=\"color: #00a000;\">Full interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>C++&nbsp;exceptions can be caught on the Lua side with <tt>pcall()</tt>,\r\n<tt>lua_pcall()</tt> etc.</li>\r\n<li>C++&nbsp;exceptions will be converted to the generic Lua error\r\n<tt>\"C++&nbsp;exception\"</tt>, unless you use the\r\n<a href=\"ext_c_api.html#mode_wrapcfunc\">C&nbsp;call wrapper</a> feature.</li>\r\n<li>It's safe to throw C++&nbsp;exceptions across non-protected Lua frames\r\non the C&nbsp;stack. The contents of the C++&nbsp;exception object\r\npass through unmodified.</li>\r\n<li>Lua errors can be caught on the C++ side with <tt>catch(...)</tt>.\r\nThe corresponding Lua error message can be retrieved from the Lua stack.</li>\r\n<li>Throwing Lua errors across C++ frames is safe. C++ destructors\r\nwill be called.</li>\r\n</ul>\r\n<p>\r\n<b style=\"color: #c06000;\">Limited interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>C++&nbsp;exceptions can be caught on the Lua side with <tt>pcall()</tt>,\r\n<tt>lua_pcall()</tt> etc.</li>\r\n<li>C++&nbsp;exceptions will be converted to the generic Lua error\r\n<tt>\"C++&nbsp;exception\"</tt>, unless you use the\r\n<a href=\"ext_c_api.html#mode_wrapcfunc\">C&nbsp;call wrapper</a> feature.</li>\r\n<li>C++&nbsp;exceptions will be caught by non-protected Lua frames and\r\nare rethrown as a generic Lua error. The C++&nbsp;exception object will\r\nbe destroyed.</li>\r\n<li>Lua errors <b>cannot</b> be caught on the C++ side.</li>\r\n<li>Throwing Lua errors across C++ frames will <b>not</b> call\r\nC++ destructors.</li>\r\n</ul>\r\n\r\n<p>\r\n<b style=\"color: #a00000;\">No interoperability</b> means:\r\n</p>\r\n<ul>\r\n<li>It's <b>not</b> safe to throw C++&nbsp;exceptions across Lua frames.</li>\r\n<li>C++&nbsp;exceptions <b>cannot</b> be caught on the Lua side.</li>\r\n<li>Lua errors <b>cannot</b> be caught on the C++ side.</li>\r\n<li>Throwing Lua errors across C++ frames will <b>not</b> call\r\nC++ destructors.</li>\r\n<li>Additionally, on Windows/x86 with SEH-based C++&nbsp;exceptions:\r\nit's <b>not</b> safe to throw a Lua error across any frames containing\r\na C++ function with any try/catch construct or using variables with\r\n(implicit) destructors. This also applies to any functions which may be\r\ninlined in such a function. It doesn't matter whether <tt>lua_error()</tt>\r\nis called inside or outside of a try/catch or whether any object actually\r\nneeds to be destroyed: the SEH chain is corrupted and this will eventually\r\nlead to the termination of the process.</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/faq.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Frequently Asked Questions (FAQ)</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ndd { margin-left: 1.5em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Frequently Asked Questions (FAQ)</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<dl>\r\n<dt>Q: Where can I learn more about LuaJIT and Lua?</dt>\r\n<dd>\r\n<ul style=\"padding: 0;\">\r\n<li>The <a href=\"http://luajit.org/list.html\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT mailing list</a> focuses on topics\r\nrelated to LuaJIT.</li>\r\n<li>The <a href=\"http://wiki.luajit.org/\"><span class=\"ext\">&raquo;</span>&nbsp;LuaJIT wiki</a> gathers community\r\nresources about LuaJIT.</li>\r\n<li>News about Lua itself can be found at the\r\n<a href=\"http://www.lua.org/lua-l.html\"><span class=\"ext\">&raquo;</span>&nbsp;Lua mailing list</a>.\r\nThe mailing list archives are worth checking out for older postings\r\nabout LuaJIT.</li>\r\n<li>The <a href=\"http://lua.org\"><span class=\"ext\">&raquo;</span>&nbsp;main Lua.org site</a> has complete\r\n<a href=\"http://www.lua.org/docs.html\"><span class=\"ext\">&raquo;</span>&nbsp;documentation</a> of the language\r\nand links to books and papers about Lua.</li>\r\n<li>The community-managed <a href=\"http://lua-users.org/wiki/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua Wiki</a>\r\nhas information about diverse topics.</li>\r\n</ul>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Where can I learn more about the compiler technology used by LuaJIT?</dt>\r\n<dd>\r\nI'm planning to write more documentation about the internals of LuaJIT.\r\nIn the meantime, please use the following Google Scholar searches\r\nto find relevant papers:<br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Trace+Compiler\"><span class=\"ext\">&raquo;</span>&nbsp;Trace Compiler</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=JIT+Compiler\"><span class=\"ext\">&raquo;</span>&nbsp;JIT Compiler</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Dynamic+Language+Optimizations\"><span class=\"ext\">&raquo;</span>&nbsp;Dynamic Language Optimizations</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=SSA+Form\"><span class=\"ext\">&raquo;</span>&nbsp;SSA Form</a><br>\r\nSearch for: <a href=\"http://scholar.google.com/scholar?q=Linear+Scan+Register+Allocation\"><span class=\"ext\">&raquo;</span>&nbsp;Linear Scan Register Allocation</a><br>\r\nHere is a list of the <a href=\"http://article.gmane.org/gmane.comp.lang.lua.general/58908\"><span class=\"ext\">&raquo;</span>&nbsp;innovative features in LuaJIT</a>.<br>\r\nAnd, you know, reading the source is of course the only way to enlightenment. :-)\r\n</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why do I get this error: \"attempt to index global 'arg' (a nil value)\"?<br>\r\nQ: My vararg functions fail after switching to LuaJIT!</dt>\r\n<dd>LuaJIT is compatible to the Lua 5.1 language standard. It doesn't\r\nsupport the implicit <tt>arg</tt> parameter for old-style vararg\r\nfunctions from Lua 5.0.<br>Please convert your code to the\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#2.5.9\"><span class=\"ext\">&raquo;</span>&nbsp;Lua 5.1\r\nvararg syntax</a>.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why do I get this error: \"bad FPU precision\"?<br>\r\n<dt>Q: I get weird behavior after initializing Direct3D.<br>\r\n<dt>Q: Some FPU operations crash after I load a Delphi DLL.<br>\r\n</dt>\r\n<dd>\r\n\r\nDirectX/Direct3D (up to version 9) sets the x87 FPU to single-precision\r\nmode by default. This violates the Windows ABI and interferes with the\r\noperation of many programs &mdash; LuaJIT is affected, too. Please make\r\nsure you always use the <tt>D3DCREATE_FPU_PRESERVE</tt> flag when\r\ninitializing Direct3D.<br>\r\n\r\nDirect3D version 10 or higher do not show this behavior anymore.\r\nConsider testing your application with older versions, too.<br>\r\n\r\nSimilarly, the Borland/Delphi runtime modifies the FPU control word and\r\nenables FP exceptions. Of course this violates the Windows ABI, too.\r\nPlease check the Delphi docs for the Set8087CW method.\r\n\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Sometimes Ctrl-C fails to stop my Lua program. Why?</dt>\r\n<dd>The interrupt signal handler sets a Lua debug hook. But this is\r\ncurrently ignored by compiled code (this will eventually be fixed). If\r\nyour program is running in a tight loop and never falls back to the\r\ninterpreter, the debug hook never runs and can't throw the\r\n\"interrupted!\" error.<br> In the meantime you have to press Ctrl-C\r\ntwice to get stop your program. That's similar to when it's stuck\r\nrunning inside a C function under the Lua interpreter.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Why doesn't my favorite power-patch for Lua apply against LuaJIT?</dt>\r\n<dd>Because it's a completely redesigned VM and has very little code\r\nin common with Lua anymore. Also, if the patch introduces changes to\r\nthe Lua semantics, these would need to be reflected everywhere in the\r\nVM, from the interpreter up to all stages of the compiler.<br> Please\r\nuse only standard Lua language constructs. For many common needs you\r\ncan use source transformations or use wrapper or proxy functions.\r\nThe compiler will happily optimize away such indirections.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: Lua runs everywhere. Why doesn't LuaJIT support my CPU?</dt>\r\n<dd>Because it's a compiler &mdash; it needs to generate native\r\nmachine code. This means the code generator must be ported to each\r\narchitecture. And the fast interpreter is written in assembler and\r\nmust be ported, too. This is quite an undertaking.<br>\r\nThe <a href=\"install.html\">install documentation</a> shows the supported\r\narchitectures. Other architectures will follow based on sufficient user\r\ndemand and/or sponsoring.</dd>\r\n</dl>\r\n\r\n<dl>\r\n<dt>Q: When will feature X be added? When will the next version be released?</dt>\r\n<dd>When it's ready.<br>\r\nC'mon, it's open source &mdash; I'm doing it on my own time and you're\r\ngetting it for free. You can either contribute a patch or sponsor\r\nthe development of certain features, if they are important to you.\r\n</dd>\r\n</dl>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/install.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Installation</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.compat {\r\n  line-height: 1.2;\r\n  font-size: 80%;\r\n}\r\ntable.compat td {\r\n  border: 1px solid #bfcfff;\r\n  height: 2.5em;\r\n}\r\ntable.compat tr.compathead td {\r\n  font-weight: bold;\r\n  border-bottom: 2px solid #bfcfff;\r\n}\r\ntr.compathead td.compatos {\r\n  vertical-align: top;\r\n}\r\ntable.compat td.compatcpu {\r\n  width: 18%;\r\n  border-right: 2px solid #bfcfff;\r\n}\r\ntd.compatos {\r\n  width: 21%;\r\n  vertical-align: middle;\r\n}\r\ntd.compatno {\r\n  background-color: #d0d0d0;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Installation</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a class=\"current\" href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is only distributed as a source package. This page explains\r\nhow to build and install LuaJIT with different operating systems\r\nand C&nbsp;compilers.\r\n</p>\r\n<p>\r\nFor the impatient (on POSIX systems):\r\n</p>\r\n<pre class=\"code\">\r\nmake &amp;&amp; sudo make install\r\n</pre>\r\n<p>\r\nLuaJIT currently builds out-of-the box on most systems.\r\nHere's the compatibility matrix for the supported combinations of\r\noperating systems, CPUs and compilers:\r\n</p>\r\n<table class=\"compat\">\r\n<tr class=\"compathead\">\r\n<td class=\"compatcpu\">CPU / OS</td>\r\n<td class=\"compatos\"><a href=\"#posix\">Linux</a> or<br><a href=\"#android\">Android</a></td>\r\n<td class=\"compatos\"><a href=\"#posix\">*BSD, Other</a></td>\r\n<td class=\"compatos\"><a href=\"#posix\">OSX 10.4+</a> or<br><a href=\"#ios\">iOS 3.0+</a></td>\r\n<td class=\"compatos\"><a href=\"#windows\">Windows<br>XP/Vista/7</a></td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"compatcpu\">x86 (32 bit)</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">GCC 4.x<br>GCC 3.4</td>\r\n<td class=\"compatos\">MSVC, MSVC/EE<br>WinSDK<br>MinGW, Cygwin</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\">x64 (64 bit)</td>\r\n<td class=\"compatos\">GCC 4.x</td>\r\n<td class=\"compatos\">ORBIS (<a href=\"#ps4\">PS4</a>)</td>\r\n<td class=\"compatos\">GCC 4.x</td>\r\n<td class=\"compatos\">MSVC + SDK v7.0<br>WinSDK v7.0<br>Durango (<a href=\"#xboxone\">Xbox One</a>)</td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">ARMv5+<br>ARM9E+</a></td>\r\n<td class=\"compatos\">GCC 4.2+</td>\r\n<td class=\"compatos\">GCC 4.2+<br>PSP2 (<a href=\"#psvita\">PS VITA</a>)</td>\r\n<td class=\"compatos\">GCC 4.2+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">ARM64</a></td>\r\n<td class=\"compatos\">GCC 4.8+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos\">Clang 3.5+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"odd\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">PPC</a></td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos\">GCC 4.3+<br>GCC 4.1 (<a href=\"#ps3\">PS3</a>)</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos\">XEDK (<a href=\"#xbox360\">Xbox 360</a>)</td>\r\n</tr>\r\n<tr class=\"even\">\r\n<td class=\"compatcpu\"><a href=\"#cross2\">MIPS</a></td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos\">GCC 4.3+</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n<td class=\"compatos compatno\">&nbsp;</td>\r\n</tr>\r\n</table>\r\n\r\n<h2>Configuring LuaJIT</h2>\r\n<p>\r\nThe standard configuration should work fine for most installations.\r\nUsually there is no need to tweak the settings. The following files\r\nhold all user-configurable settings:\r\n</p>\r\n<ul>\r\n<li><tt>src/luaconf.h</tt> sets some configuration variables.</li>\r\n<li><tt>Makefile</tt> has settings for <b>installing</b> LuaJIT (POSIX\r\nonly).</li>\r\n<li><tt>src/Makefile</tt> has settings for <b>compiling</b> LuaJIT\r\nunder POSIX, MinGW or Cygwin.</li>\r\n<li><tt>src/msvcbuild.bat</tt> has settings for compiling LuaJIT with\r\nMSVC or WinSDK.</li>\r\n</ul>\r\n<p>\r\nPlease read the instructions given in these files, before changing\r\nany settings.\r\n</p>\r\n\r\n<h2 id=\"posix\">POSIX Systems (Linux, OSX, *BSD etc.)</h2>\r\n<h3>Prerequisites</h3>\r\n<p>\r\nDepending on your distribution, you may need to install a package for\r\nGCC, the development headers and/or a complete SDK. E.g. on a current\r\nDebian/Ubuntu, install <tt>libc6-dev</tt> with the package manager.\r\n</p>\r\n<p>\r\nDownload the current source package of LuaJIT (pick the .tar.gz),\r\nif you haven't already done so. Move it to a directory of your choice,\r\nopen a terminal window and change to this directory. Now unpack the archive\r\nand change to the newly created directory:\r\n</p>\r\n<pre class=\"code\">\r\ntar zxf LuaJIT-2.0.4.tar.gz\r\ncd LuaJIT-2.0.4</pre>\r\n<h3>Building LuaJIT</h3>\r\n<p>\r\nThe supplied Makefiles try to auto-detect the settings needed for your\r\noperating system and your compiler. They need to be run with GNU Make,\r\nwhich is probably the default on your system, anyway. Simply run:\r\n</p>\r\n<pre class=\"code\">\r\nmake\r\n</pre>\r\n<p>\r\nThis always builds a native x86, x64 or PPC binary, depending on the host OS\r\nyou're running this command on. Check the section on\r\n<a href=\"#cross\">cross-compilation</a> for more options.\r\n</p>\r\n<p>\r\nBy default, modules are only searched under the prefix <tt>/usr/local</tt>.\r\nYou can add an extra prefix to the search paths by appending the\r\n<tt>PREFIX</tt> option, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nmake PREFIX=/home/myself/lj2\r\n</pre>\r\n<p>\r\nNote for OSX: if the <tt>MACOSX_DEPLOYMENT_TARGET</tt> environment\r\nvariable is not set, then it's forced to <tt>10.4</tt>.\r\n</p>\r\n<h3>Installing LuaJIT</h3>\r\n<p>\r\nThe top-level Makefile installs LuaJIT by default under\r\n<tt>/usr/local</tt>, i.e. the executable ends up in\r\n<tt>/usr/local/bin</tt> and so on. You need root privileges\r\nto write to this path. So, assuming sudo is installed on your system,\r\nrun the following command and enter your sudo password:\r\n</p>\r\n<pre class=\"code\">\r\nsudo make install\r\n</pre>\r\n<p>\r\nOtherwise specify the directory prefix as an absolute path, e.g.:\r\n</p>\r\n<pre class=\"code\">\r\nmake install PREFIX=/home/myself/lj2\r\n</pre>\r\n<p>\r\nObviously the prefixes given during build and installation need to be the same.\r\n</p>\r\n\r\n<h2 id=\"windows\">Windows Systems</h2>\r\n<h3>Prerequisites</h3>\r\n<p>\r\nEither install one of the open source SDKs\r\n(<a href=\"http://mingw.org/\"><span class=\"ext\">&raquo;</span>&nbsp;MinGW</a> or\r\n<a href=\"http://www.cygwin.com/\"><span class=\"ext\">&raquo;</span>&nbsp;Cygwin</a>), which come with a modified\r\nGCC plus the required development headers.\r\n</p>\r\n<p>\r\nOr install Microsoft's Visual C++ (MSVC). The freely downloadable\r\n<a href=\"http://www.microsoft.com/Express/VC/\"><span class=\"ext\">&raquo;</span>&nbsp;Express Edition</a>\r\nworks just fine, but only contains an x86 compiler.\r\n</p>\r\n<p>\r\nThe freely downloadable\r\n<a href=\"http://msdn.microsoft.com/en-us/windowsserver/bb980924.aspx\"><span class=\"ext\">&raquo;</span>&nbsp;Windows SDK</a>\r\nonly comes with command line tools, but this is all you need to build LuaJIT.\r\nIt contains x86 and x64 compilers.\r\n</p>\r\n<p>\r\nNext, download the source package and unpack it using an archive manager\r\n(e.g. the Windows Explorer) to a directory of your choice.\r\n</p>\r\n<h3>Building with MSVC</h3>\r\n<p>\r\nOpen a \"Visual Studio .NET Command Prompt\", <tt>cd</tt> to the\r\ndirectory where you've unpacked the sources and run these commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nmsvcbuild\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Building with the Windows SDK</h3>\r\n<p>\r\nOpen a \"Windows SDK Command Shell\" and select the x86 compiler:\r\n</p>\r\n<pre class=\"code\">\r\nsetenv /release /x86\r\n</pre>\r\n<p>\r\nOr select the x64 compiler:\r\n</p>\r\n<pre class=\"code\">\r\nsetenv /release /x64\r\n</pre>\r\n<p>\r\nThen <tt>cd</tt> to the directory where you've unpacked the sources\r\nand run these commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nmsvcbuild\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Building with MinGW or Cygwin</h3>\r\n<p>\r\nOpen a command prompt window and make sure the MinGW or Cygwin programs\r\nare in your path. Then <tt>cd</tt> to the directory where\r\nyou've unpacked the sources and run this command for MinGW:\r\n</p>\r\n<pre class=\"code\">\r\nmingw32-make\r\n</pre>\r\n<p>\r\nOr this command for Cygwin:\r\n</p>\r\n<pre class=\"code\">\r\nmake\r\n</pre>\r\n<p>\r\nThen follow the installation instructions below.\r\n</p>\r\n<h3>Installing LuaJIT</h3>\r\n<p>\r\nCopy <tt>luajit.exe</tt> and <tt>lua51.dll</tt> (built in the <tt>src</tt>\r\ndirectory) to a newly created directory (any location is ok).\r\nAdd <tt>lua</tt> and <tt>lua\\jit</tt> directories below it and copy\r\nall Lua files from the <tt>src\\jit</tt> directory of the distribution\r\nto the latter directory.\r\n</p>\r\n<p>\r\nThere are no hardcoded\r\nabsolute path names &mdash; all modules are loaded relative to the\r\ndirectory where <tt>luajit.exe</tt> is installed\r\n(see <tt>src/luaconf.h</tt>).\r\n</p>\r\n\r\n<h2 id=\"cross\">Cross-compiling LuaJIT</h2>\r\n<p>\r\nThe GNU Makefile-based build system allows cross-compiling on any host\r\nfor any supported target, as long as both architectures have the same\r\npointer size. If you want to cross-compile to any 32 bit target on an\r\nx64 OS, you need to install the multilib development package (e.g.\r\n<tt>libc6-dev-i386</tt> on Debian/Ubuntu) and build a 32 bit host part\r\n(<tt>HOST_CC=\"gcc -m32\"</tt>).\r\n</p>\r\n<p>\r\nYou need to specify <tt>TARGET_SYS</tt> whenever the host OS and the\r\ntarget OS differ, or you'll get assembler or linker errors. E.g. if\r\nyou're compiling on a Windows or OSX host for embedded Linux or Android,\r\nyou need to add <tt>TARGET_SYS=Linux</tt> to the examples below. For a\r\nminimal target OS, you may need to disable the built-in allocator in\r\n<tt>src/Makefile</tt> and use <tt>TARGET_SYS=Other</tt>. The examples\r\nbelow only show some popular targets &mdash; please check the comments\r\nin <tt>src/Makefile</tt> for more details.\r\n</p>\r\n<pre class=\"code\">\r\n# Cross-compile to a 32 bit binary on a multilib x64 OS\r\nmake CC=\"gcc -m32\"\r\n\r\n# Cross-compile on Debian/Ubuntu for Windows (mingw32 package)\r\nmake HOST_CC=\"gcc -m32\" CROSS=i586-mingw32msvc- TARGET_SYS=Windows\r\n</pre>\r\n<p id=\"cross2\">\r\nThe <tt>CROSS</tt> prefix allows specifying a standard GNU cross-compile\r\ntoolchain (Binutils, GCC and a matching libc). The prefix may vary\r\ndepending on the <tt>--target</tt> the toolchain was built for (note the\r\n<tt>CROSS</tt> prefix has a trailing <tt>\"-\"</tt>). The examples below\r\nuse the canonical toolchain triplets for Linux.\r\n</p>\r\n<p>\r\nSince there's often no easy way to detect CPU features at runtime, it's\r\nimportant to compile with the proper CPU or architecture settings. You\r\ncan specify these when building the toolchain yourself. Or add\r\n<tt>-mcpu=...</tt> or <tt>-march=...</tt> to <tt>TARGET_CFLAGS</tt>. For\r\nARM it's important to have the correct <tt>-mfloat-abi=...</tt> setting,\r\ntoo. Otherwise LuaJIT may not run at the full performance of your target\r\nCPU.\r\n</p>\r\n<pre class=\"code\">\r\n# ARM soft-float\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabi- \\\r\n     TARGET_CFLAGS=\"-mfloat-abi=soft\"\r\n\r\n# ARM soft-float ABI with VFP (example for Cortex-A8)\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabi- \\\r\n     TARGET_CFLAGS=\"-mcpu=cortex-a8 -mfloat-abi=softfp\"\r\n\r\n# ARM hard-float ABI with VFP (armhf, requires recent toolchain)\r\nmake HOST_CC=\"gcc -m32\" CROSS=arm-linux-gnueabihf-\r\n\r\n# ARM64 (requires x64 host)\r\nmake CROSS=aarch64-linux-\r\n\r\n# PPC\r\nmake HOST_CC=\"gcc -m32\" CROSS=powerpc-linux-gnu-\r\n\r\n# MIPS big-endian\r\nmake HOST_CC=\"gcc -m32\" CROSS=mips-linux-\r\n# MIPS little-endian\r\nmake HOST_CC=\"gcc -m32\" CROSS=mipsel-linux-\r\n</pre>\r\n<p>\r\nYou can cross-compile for <b id=\"android\">Android</b> using the <a href=\"http://developer.android.com/sdk/ndk/index.html\"><span class=\"ext\">&raquo;</span>&nbsp;Android NDK</a>.\r\nThe environment variables need to match the install locations and the\r\ndesired target platform. E.g. Android&nbsp;4.0 corresponds to ABI level&nbsp;14.\r\nFor details check the folder <tt>docs</tt> in the NDK directory.\r\n</p>\r\n<p>\r\nOnly a few common variations for the different CPUs, ABIs and platforms\r\nare listed. Please use your own judgement for which combination you want\r\nto build/deploy or which lowest common denominator you want to pick:\r\n</p>\r\n<pre class=\"code\">\r\n# Android/ARM, armeabi (ARMv5TE soft-float), Android 2.2+ (Froyo)\r\nNDK=/opt/android/ndk\r\nNDKABI=8\r\nNDKVER=$NDK/toolchains/arm-linux-androideabi-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/arm-linux-androideabi-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n\r\n# Android/ARM, armeabi-v7a (ARMv7 VFP), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/arm-linux-androideabi-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/arm-linux-androideabi-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\nNDKARCH=\"-march=armv7-a -mfloat-abi=softfp -Wl,--fix-cortex-a8\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF $NDKARCH\"\r\n\r\n# Android/MIPS, mips (MIPS32R1 hard-float), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/mipsel-linux-android-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/mipsel-linux-android-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-mips\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n\r\n# Android/x86, x86 (i686 SSE3), Android 4.0+ (ICS)\r\nNDK=/opt/android/ndk\r\nNDKABI=14\r\nNDKVER=$NDK/toolchains/x86-4.6\r\nNDKP=$NDKVER/prebuilt/linux-x86/bin/i686-linux-android-\r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-x86\"\r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_FLAGS=\"$NDKF\"\r\n</pre>\r\n<p>\r\nYou can cross-compile for <b id=\"ios\">iOS 3.0+</b> (iPhone/iPad) using the <a href=\"http://developer.apple.com/devcenter/ios/index.action\"><span class=\"ext\">&raquo;</span>&nbsp;iOS SDK</a>.\r\nThe environment variables need to match the iOS SDK version:\r\n</p>\r\n<p style=\"font-size: 8pt;\">\r\nNote: <b>the JIT compiler is disabled for iOS</b>, because regular iOS Apps\r\nare not allowed to generate code at runtime. You'll only get the performance\r\nof the LuaJIT interpreter on iOS. This is still faster than plain Lua, but\r\nmuch slower than the JIT compiler. Please complain to Apple, not me.\r\nOr use Android. :-p\r\n</p>\r\n<pre class=\"code\">\r\nIXCODE=`xcode-select -print-path`\r\nISDK=$IXCODE/Platforms/iPhoneOS.platform/Developer\r\nISDKVER=iPhoneOS6.0.sdk\r\nISDKP=$ISDK/usr/bin/\r\nISDKF=\"-arch armv7 -isysroot $ISDK/SDKs/$ISDKVER\"\r\nmake HOST_CC=\"gcc -m32 -arch i386\" CROSS=$ISDKP TARGET_FLAGS=\"$ISDKF\" \\\r\n     TARGET_SYS=iOS\r\n</pre>\r\n\r\n<h3 id=\"consoles\">Cross-compiling for consoles</h3>\r\n<p>\r\nBuilding LuaJIT for consoles requires both a supported host compiler\r\n(x86 or x64) and a cross-compiler (to PPC or ARM) from the official\r\nconsole SDK.\r\n</p>\r\n<p>\r\nDue to restrictions on consoles, the JIT compiler is disabled and only\r\nthe fast interpreter is built. This is still faster than plain Lua,\r\nbut much slower than the JIT compiler. The FFI is disabled, too, since\r\nit's not very useful in such an environment.\r\n</p>\r\n<p>\r\nThe following commands build a static library <tt>libluajit.a</tt>,\r\nwhich can be linked against your game, just like the Lua library.\r\n</p>\r\n<p>\r\nTo cross-compile for <b id=\"ps3\">PS3</b> from a Linux host (requires\r\n32&nbsp;bit GCC, i.e. multilib Linux/x64) or a Windows host (requires\r\n32&nbsp;bit MinGW), run this command:\r\n</p>\r\n<pre class=\"code\">\r\nmake HOST_CC=\"gcc -m32\" CROSS=ppu-lv2-\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"ps4\">PS4</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (64&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and\r\nrun the following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nps4build\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"psvita\">PS Vita</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (32&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and\r\nrun the following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\npsvitabuild\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"xbox360\">Xbox 360</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (32&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and run\r\nthe following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nxedkbuild\r\n</pre>\r\n<p>\r\nTo cross-compile for <b id=\"xboxone\">Xbox One</b> from a Windows host,\r\nopen a \"Visual Studio .NET Command Prompt\" (64&nbsp;bit host compiler),\r\n<tt>cd</tt> to the directory where you've unpacked the sources and run\r\nthe following commands:\r\n</p>\r\n<pre class=\"code\">\r\ncd src\r\nxb1build\r\n</pre>\r\n\r\n<h2 id=\"embed\">Embedding LuaJIT</h2>\r\n<p>\r\nLuaJIT is API-compatible with Lua 5.1. If you've already embedded Lua\r\ninto your application, you probably don't need to do anything to switch\r\nto LuaJIT, except link with a different library:\r\n</p>\r\n<ul>\r\n<li>It's strongly suggested to build LuaJIT separately using the supplied\r\nbuild system. Please do <em>not</em> attempt to integrate the individual\r\nsource files into your build tree. You'll most likely get the internal build\r\ndependencies wrong or mess up the compiler flags. Treat LuaJIT like any\r\nother external library and link your application with either the dynamic\r\nor static library, depending on your needs.</li>\r\n<li>If you want to load C modules compiled for plain Lua\r\nwith <tt>require()</tt>, you need to make sure the public symbols\r\n(e.g. <tt>lua_pushnumber</tt>) are exported, too:\r\n<ul><li>On POSIX systems you can either link to the shared library\r\nor link the static library into your application. In the latter case\r\nyou'll need to export all public symbols from your main executable\r\n(e.g. <tt>-Wl,-E</tt> on Linux) and add the external dependencies\r\n(e.g. <tt>-lm -ldl</tt> on Linux).</li>\r\n<li>Since Windows symbols are bound to a specific DLL name, you need to\r\nlink to the <tt>lua51.dll</tt> created by the LuaJIT build (do not rename\r\nthe DLL). You may link LuaJIT statically on Windows only if you don't\r\nintend to load Lua/C modules at runtime.\r\n</li></ul>\r\n</li>\r\n<li>\r\nIf you're building a 64 bit application on OSX which links directly or\r\nindirectly against LuaJIT, you need to link your main executable\r\nwith these flags:\r\n<pre class=\"code\">\r\n-pagezero_size 10000 -image_base 100000000\r\n</pre>\r\nAlso, it's recommended to <tt>rebase</tt> all (self-compiled) shared libraries\r\nwhich are loaded at runtime on OSX/x64 (e.g. C extension modules for Lua).\r\nSee: <tt>man rebase</tt>\r\n</li>\r\n</ul>\r\n<p>Additional hints for initializing LuaJIT using the C API functions:</p>\r\n<ul>\r\n<li>Here's a\r\n<a href=\"http://lua-users.org/wiki/SimpleLuaApiExample\"><span class=\"ext\">&raquo;</span>&nbsp;simple example</a>\r\nfor embedding Lua or LuaJIT into your application.</li>\r\n<li>Make sure you use <tt>luaL_newstate</tt>. Avoid using\r\n<tt>lua_newstate</tt>, since this uses the (slower) default memory\r\nallocator from your system (no support for this on x64).</li>\r\n<li>Make sure you use <tt>luaL_openlibs</tt> and not the old Lua 5.0 style\r\nof calling <tt>luaopen_base</tt> etc. directly.</li>\r\n<li>To change or extend the list of standard libraries to load, copy\r\n<tt>src/lib_init.c</tt> to your project and modify it accordingly.\r\nMake sure the <tt>jit</tt> library is loaded or the JIT compiler\r\nwill not be activated.</li>\r\n<li>The <tt>bit.*</tt> module for bitwise operations\r\nis already built-in. There's no need to statically link\r\n<a href=\"http://bitop.luajit.org/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua BitOp</a> to your application.</li>\r\n</ul>\r\n\r\n<h2 id=\"distro\">Hints for Distribution Maintainers</h2>\r\n<p>\r\nThe LuaJIT build system has extra provisions for the needs of most\r\nPOSIX-based distributions. If you're a package maintainer for\r\na distribution, <em>please</em> make use of these features and\r\navoid patching, subverting, autotoolizing or messing up the build system\r\nin unspeakable ways.\r\n</p>\r\n<p>\r\nThere should be absolutely no need to patch <tt>luaconf.h</tt> or any\r\nof the Makefiles. And please do not hand-pick files for your packages &mdash;\r\nsimply use whatever <tt>make install</tt> creates. There's a reason\r\nfor all of the files <em>and</em> directories it creates.\r\n</p>\r\n<p>\r\nThe build system uses GNU make and auto-detects most settings based on\r\nthe host you're building it on. This should work fine for native builds,\r\neven when sandboxed. You may need to pass some of the following flags to\r\n<em>both</em> the <tt>make</tt> and the <tt>make install</tt> command lines\r\nfor a regular distribution build:\r\n</p>\r\n<ul>\r\n<li><tt>PREFIX</tt> overrides the installation path and should usually\r\nbe set to <tt>/usr</tt>. Setting this also changes the module paths and\r\nthe paths needed to locate the shared library.</li>\r\n<li><tt>DESTDIR</tt> is an absolute path which allows you to install\r\nto a shadow tree instead of the root tree of the build system.</li>\r\n<li><tt>MULTILIB</tt> sets the architecture-specific library path component\r\nfor multilib systems. The default is <tt>lib</tt>.</li>\r\n<li>Have a look at the top-level <tt>Makefile</tt> and <tt>src/Makefile</tt>\r\nfor additional variables to tweak. The following variables <em>may</em> be\r\noverridden, but it's <em>not</em> recommended, except for special needs\r\nlike cross-builds:\r\n<tt>BUILDMODE, CC, HOST_CC, STATIC_CC, DYNAMIC_CC, CFLAGS, HOST_CFLAGS,\r\nTARGET_CFLAGS, LDFLAGS, HOST_LDFLAGS, TARGET_LDFLAGS, TARGET_SHLDFLAGS,\r\nTARGET_FLAGS, LIBS, HOST_LIBS, TARGET_LIBS, CROSS, HOST_SYS, TARGET_SYS\r\n</tt></li>\r\n</ul>\r\n<p>\r\nThe build system has a special target for an amalgamated build, i.e.\r\n<tt>make amalg</tt>. This compiles the LuaJIT core as one huge C file\r\nand allows GCC to generate faster and shorter code. Alas, this requires\r\nlots of memory during the build. This may be a problem for some users,\r\nthat's why it's not enabled by default. But it shouldn't be a problem for\r\nmost build farms. It's recommended that binary distributions use this\r\ntarget for their LuaJIT builds.\r\n</p>\r\n<p>\r\nThe tl;dr version of the above:\r\n</p>\r\n<pre class=\"code\">\r\nmake amalg PREFIX=/usr && \\\r\nmake install PREFIX=/usr DESTDIR=/tmp/buildroot\r\n</pre>\r\n<p>\r\nFinally, if you encounter any difficulties, please\r\n<a href=\"contact.html\">contact me</a> first, instead of releasing a broken\r\npackage onto unsuspecting users. Because they'll usually gonna complain\r\nto me (the upstream) and not you (the package maintainer), anyway.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/luajit.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>LuaJIT</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<meta name=\"description\" content=\"LuaJIT is a Just-In-Time (JIT) compiler for the Lua language.\">\r\n<style type=\"text/css\">\r\ntable.feature {\r\n  width: inherit;\r\n  line-height: 1.2;\r\n  margin: 0;\r\n}\r\ntable.feature td {\r\n  width: 80px;\r\n  height: 40px;\r\n  vertical-align: middle;\r\n  text-align: center;\r\n  font-weight: bold;\r\n  border: 4px solid #e6ecff;\r\n  border-radius: 12px;\r\n}\r\ntable.os td {\r\n  background: #7080d0;\r\n  background-image: linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -moz-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -webkit-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -o-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n  background-image: -ms-linear-gradient(#4060c0 10%, #b0b0ff 95%);\r\n}\r\ntable.os1 td {\r\n  color: #ffff80;\r\n}\r\ntable.os2 td {\r\n  color: #ffa040;\r\n}\r\ntable.os3 td {\r\n  color: #40ffff;\r\n}\r\ntable.compiler td {\r\n  color: #2080ff;\r\n  background: #62bf41;\r\n  background-image: linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -moz-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -webkit-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -o-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n  background-image: -ms-linear-gradient(#62bf41 10%, #b0ffb0 95%);\r\n}\r\ntable.cpu td {\r\n  color: #ffff00;\r\n  background: #cf7251;\r\n  background-image: linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -moz-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -webkit-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -o-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n  background-image: -ms-linear-gradient(#bf6241 10%, #ffb0b0 95%);\r\n}\r\ntable.fcompat td {\r\n  color: #2060e0;\r\n  background: #61cfcf;\r\n  background-image: linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -moz-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -webkit-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -o-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n  background-image: -ms-linear-gradient(#41bfbf 10%, #b0ffff 95%);\r\n}\r\ntable.stats td {\r\n  color: #ffffff;\r\n  background: #a0a0a0;\r\n  background-image: linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -moz-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -webkit-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -o-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n  background-image: -ms-linear-gradient(#808080 10%, #d0d0d0 95%);\r\n}\r\ntable.stats td.speed {\r\n  color: #ff4020;\r\n}\r\ntable.stats td.kb {\r\n  color: #ffff80;\r\n  background: #808080;\r\n  background-image: linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -moz-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -webkit-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -o-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n  background-image: -ms-linear-gradient(#606060 10%, #c0c0c0 95%);\r\n}\r\ntable.feature small {\r\n  font-size: 50%;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>LuaJIT</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a class=\"current\" href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT is a <b>Just-In-Time Compiler</b> (JIT) for the\r\n<a href=\"http://www.lua.org/\"><span class=\"ext\">&raquo;</span>&nbsp;Lua</a> programming language.\r\nLua is a powerful, dynamic and light-weight programming language.\r\nIt may be embedded or used as a general-purpose, stand-alone language.\r\n</p>\r\n<p>\r\nLuaJIT is Copyright &copy; 2005-2015 Mike Pall, released under the\r\n<a href=\"http://www.opensource.org/licenses/mit-license.php\"><span class=\"ext\">&raquo;</span>&nbsp;MIT open source license</a>.\r\n</p>\r\n<p>\r\n</p>\r\n\r\n<h2>Compatibility</h2>\r\n<table class=\"feature os os1\">\r\n<tr><td>Windows</td><td>Linux</td><td>BSD</td><td>OSX</td><td>POSIX</td></tr>\r\n</table>\r\n<table class=\"feature os os2\">\r\n<tr><td><span style=\"font-size:90%;\">Embedded</span></td><td>Android</td><td>iOS</td></tr>\r\n</table>\r\n<table class=\"feature os os3\">\r\n<tr><td>PS3</td><td>PS4</td><td>PS Vita</td><td>Xbox 360</td><td>Xbox One</td></tr>\r\n</table>\r\n<table class=\"feature compiler\">\r\n<tr><td>GCC</td><td>CLANG<br>LLVM</td><td>MSVC</td></tr>\r\n</table>\r\n<table class=\"feature cpu\">\r\n<tr><td>x86</td><td>x64</td><td>ARM</td><td>ARM64</td><td>PPC</td><td>MIPS</td></tr>\r\n</table>\r\n<table class=\"feature fcompat\">\r\n<tr><td>Lua&nbsp;5.1<br>API+ABI</td><td>+&nbsp;JIT</td><td>+&nbsp;BitOp</td><td>+&nbsp;FFI</td><td>Drop-in<br>DLL/.so</td></tr>\r\n</table>\r\n\r\n<h2>Overview</h2>\r\n<table class=\"feature stats\">\r\n<tr>\r\n<td class=\"speed\">3x<br>-&nbsp;&nbsp;100x</td>\r\n<td class=\"kb\">115&nbsp;<small>KB</small><br>VM</td>\r\n<td class=\"kb\">90&nbsp;<small>KB</small><br>JIT</td>\r\n<td class=\"kloc\">63&nbsp;<small>KLOC</small><br>C</td>\r\n<td class=\"kloc\">24&nbsp;<small>KLOC</small><br>ASM</td>\r\n<td class=\"kloc\">11&nbsp;<small>KLOC</small><br>Lua</td>\r\n</tr>\r\n</table>\r\n<p style=\"margin-top: 1em;\">\r\nLuaJIT has been successfully used as a <b>scripting middleware</b> in\r\ngames, appliances, network and graphics apps, numerical simulations,\r\ntrading platforms and many other specialty applications. It scales from\r\nembedded devices, smartphones, desktops up to server farms. It combines\r\nhigh flexibility with <a href=\"http://luajit.org/performance.html\"><span class=\"ext\">&raquo;</span>&nbsp;high performance</a>\r\nand an unmatched <b>low memory footprint</b>.\r\n</p>\r\n<p>\r\nLuaJIT has been in continuous development since 2005. It's widely\r\nconsidered to be <b>one of the fastest dynamic language\r\nimplementations</b>. It has outperformed other dynamic languages on many\r\ncross-language benchmarks since its first release &mdash; often by a\r\nsubstantial margin.\r\n</p>\r\n<p>\r\nFor <b>LuaJIT 2.0</b>, the whole VM has been rewritten from the ground up\r\nand relentlessly optimized for performance. It combines a <b>high-speed\r\ninterpreter</b>, written in assembler, with a <b>state-of-the-art JIT\r\ncompiler</b>.\r\n</p>\r\n<p>\r\nAn innovative <b>trace compiler</b> is integrated with advanced,\r\nSSA-based optimizations and highly tuned code generation backends.\r\nA substantial reduction of the overhead associated with dynamic languages\r\nallows it to break into the performance range traditionally reserved for\r\noffline, static language compilers.\r\n</p>\r\n\r\n<h2>More ...</h2>\r\n<p>\r\nPlease select a sub-topic in the navigation bar to learn more about LuaJIT.\r\n</p>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/running.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Running LuaJIT</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\ntable.opt {\r\n  line-height: 1.2;\r\n}\r\ntr.opthead td {\r\n  font-weight: bold;\r\n}\r\ntd.flag_name {\r\n  width: 4em;\r\n}\r\ntd.flag_level {\r\n  width: 2em;\r\n  text-align: center;\r\n}\r\ntd.param_name {\r\n  width: 6em;\r\n}\r\ntd.param_default {\r\n  width: 4em;\r\n  text-align: right;\r\n}\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Running LuaJIT</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a class=\"current\" href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\nLuaJIT has only a single stand-alone executable, called <tt>luajit</tt> on\r\nPOSIX systems or <tt>luajit.exe</tt> on Windows. It can be used to run simple\r\nLua statements or whole Lua applications from the command line. It has an\r\ninteractive mode, too.\r\n</p>\r\n\r\n<h2 id=\"options\">Command Line Options</h2>\r\n<p>\r\nThe <tt>luajit</tt> stand-alone executable is just a slightly modified\r\nversion of the regular <tt>lua</tt> stand-alone executable.\r\nIt supports the same basic options, too. <tt>luajit&nbsp;-h</tt>\r\nprints a short list of the available options. Please have a look at the\r\n<a href=\"http://www.lua.org/manual/5.1/manual.html#6\"><span class=\"ext\">&raquo;</span>&nbsp;Lua manual</a>\r\nfor details.\r\n</p>\r\n<p>\r\nLuaJIT has some additional options:\r\n</p>\r\n\r\n<h3 id=\"opt_b\"><tt>-b[options] input output</tt></h3>\r\n<p>\r\nThis option saves or lists bytecode. The following additional options\r\nare accepted:\r\n</p>\r\n<ul>\r\n<li><tt>-l</tt> &mdash; Only list bytecode.</li>\r\n<li><tt>-s</tt> &mdash; Strip debug info (this is the default).</li>\r\n<li><tt>-g</tt> &mdash; Keep debug info.</li>\r\n<li><tt>-n name</tt> &mdash; Set module name (default: auto-detect from input name)</li>\r\n<li><tt>-t type</tt> &mdash; Set output file type (default: auto-detect from output name).</li>\r\n<li><tt>-a arch</tt> &mdash; Override architecture for object files (default: native).</li>\r\n<li><tt>-o os</tt> &mdash; Override OS for object files (default: native).</li>\r\n<li><tt>-e chunk</tt> &mdash; Use chunk string as input.</li>\r\n<li><tt>-</tt> (a single minus sign) &mdash; Use stdin as input and/or stdout as output.</li>\r\n</ul>\r\n<p>\r\nThe output file type is auto-detected from the extension of the output\r\nfile name:\r\n</p>\r\n<ul>\r\n<li><tt>c</tt> &mdash; C source file, exported bytecode data.</li>\r\n<li><tt>h</tt> &mdash; C header file, static bytecode data.</li>\r\n<li><tt>obj</tt> or <tt>o</tt> &mdash; Object file, exported bytecode data\r\n(OS- and architecture-specific).</li>\r\n<li><tt>raw</tt> or any other extension &mdash; Raw bytecode file (portable).\r\n</ul>\r\n<p>\r\nNotes:\r\n</p>\r\n<ul>\r\n<li>See also <a href=\"extensions.html#string_dump\">string.dump()</a>\r\nfor information on bytecode portability and compatibility.</li>\r\n<li>A file in raw bytecode format is auto-detected and can be loaded like\r\nany Lua source file. E.g. directly from the command line or with\r\n<tt>loadfile()</tt>, <tt>dofile()</tt> etc.</li>\r\n<li>To statically embed the bytecode of a module in your application,\r\ngenerate an object file and just link it with your application.</li>\r\n<li>On most ELF-based systems (e.g. Linux) you need to explicitly export the\r\nglobal symbols when linking your application, e.g. with: <tt>-Wl,-E</tt></li>\r\n<li><tt>require()</tt> tries to load embedded bytecode data from exported\r\nsymbols (in <tt>*.exe</tt> or <tt>lua51.dll</tt> on Windows) and from\r\nshared libraries in <tt>package.cpath</tt>.</li>\r\n</ul>\r\n<p>\r\nTypical usage examples:\r\n</p>\r\n<pre class=\"code\">\r\nluajit -b test.lua test.out                 # Save bytecode to test.out\r\nluajit -bg test.lua test.out                # Keep debug info\r\nluajit -be \"print('hello world')\" test.out  # Save cmdline script\r\n\r\nluajit -bl test.lua                         # List to stdout\r\nluajit -bl test.lua test.txt                # List to test.txt\r\nluajit -ble \"print('hello world')\"          # List cmdline script\r\n\r\nluajit -b test.lua test.obj                 # Generate object file\r\n# Link test.obj with your application and load it with require(\"test\")\r\n</pre>\r\n\r\n<h3 id=\"opt_j\"><tt>-j cmd[=arg[,arg...]]</tt></h3>\r\n<p>\r\nThis option performs a LuaJIT control command or activates one of the\r\nloadable extension modules. The command is first looked up in the\r\n<tt>jit.*</tt> library. If no matching function is found, a module\r\nnamed <tt>jit.&lt;cmd&gt;</tt> is loaded and the <tt>start()</tt>\r\nfunction of the module is called with the specified arguments (if\r\nany). The space between <tt>-j</tt> and <tt>cmd</tt> is optional.\r\n</p>\r\n<p>\r\nHere are the available LuaJIT control commands:\r\n</p>\r\n<ul>\r\n<li id=\"j_on\"><tt>-jon</tt> &mdash; Turns the JIT compiler on (default).</li>\r\n<li id=\"j_off\"><tt>-joff</tt> &mdash; Turns the JIT compiler off (only use the interpreter).</li>\r\n<li id=\"j_flush\"><tt>-jflush</tt> &mdash; Flushes the whole cache of compiled code.</li>\r\n<li id=\"j_v\"><tt>-jv</tt> &mdash; Shows verbose information about the progress of the JIT compiler.</li>\r\n<li id=\"j_dump\"><tt>-jdump</tt> &mdash; Dumps the code and structures used in various compiler stages.</li>\r\n<li id=\"j_p\"><tt>-jp</tt> &mdash; Start the <a href=\"ext_profiler.html\">integrated profiler</a>.</li>\r\n</ul>\r\n<p>\r\nThe <tt>-jv</tt> and <tt>-jdump</tt> commands are extension modules\r\nwritten in Lua. They are mainly used for debugging the JIT compiler\r\nitself. For a description of their options and output format, please\r\nread the comment block at the start of their source.\r\nThey can be found in the <tt>lib</tt> directory of the source\r\ndistribution or installed under the <tt>jit</tt> directory. By default\r\nthis is <tt>/usr/local/share/luajit-2.0.4/jit</tt> on POSIX\r\nsystems.\r\n</p>\r\n\r\n<h3 id=\"opt_O\"><tt>-O[level]</tt><br>\r\n<tt>-O[+]flag</tt>&nbsp;&nbsp;&nbsp;<tt>-O-flag</tt><br>\r\n<tt>-Oparam=value</tt></h3>\r\n<p>\r\nThis options allows fine-tuned control of the optimizations used by\r\nthe JIT compiler. This is mainly intended for debugging LuaJIT itself.\r\nPlease note that the JIT compiler is extremely fast (we are talking\r\nabout the microsecond to millisecond range). Disabling optimizations\r\ndoesn't have any visible impact on its overhead, but usually generates\r\ncode that runs slower.\r\n</p>\r\n<p>\r\nThe first form sets an optimization level &mdash; this enables a\r\nspecific mix of optimization flags. <tt>-O0</tt> turns off all\r\noptimizations and higher numbers enable more optimizations. Omitting\r\nthe level (i.e. just <tt>-O</tt>) sets the default optimization level,\r\nwhich is <tt>-O3</tt> in the current version.\r\n</p>\r\n<p>\r\nThe second form adds or removes individual optimization flags.\r\nThe third form sets a parameter for the VM or the JIT compiler\r\nto a specific value.\r\n</p>\r\n<p>\r\nYou can either use this option multiple times (like <tt>-Ocse\r\n-O-dce -Ohotloop=10</tt>) or separate several settings with a comma\r\n(like <tt>-O+cse,-dce,hotloop=10</tt>). The settings are applied from\r\nleft to right and later settings override earlier ones. You can freely\r\nmix the three forms, but note that setting an optimization level\r\noverrides all earlier flags.\r\n</p>\r\n<p>\r\nHere are the available flags and at what optimization levels they\r\nare enabled:\r\n</p>\r\n<table class=\"opt\">\r\n<tr class=\"opthead\">\r\n<td class=\"flag_name\">Flag</td>\r\n<td class=\"flag_level\">-O1</td>\r\n<td class=\"flag_level\">-O2</td>\r\n<td class=\"flag_level\">-O3</td>\r\n<td class=\"flag_desc\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"flag_name\">fold</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Constant Folding, Simplifications and Reassociation</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">cse</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Common-Subexpression Elimination</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">dce</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Dead-Code Elimination</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">narrow</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Narrowing of numbers to integers</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">loop</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Loop Optimizations (code hoisting)</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">fwd</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Load Forwarding (L2L) and Store Forwarding (S2L)</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">dse</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Dead-Store Elimination</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">abc</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Array Bounds Check Elimination</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"flag_name\">sink</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Allocation/Store Sinking</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"flag_name\">fuse</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&nbsp;</td><td class=\"flag_level\">&bull;</td><td class=\"flag_desc\">Fusion of operands into instructions</td></tr>\r\n</table>\r\n<p>\r\nHere are the parameters and their default settings:\r\n</p>\r\n<table class=\"opt\">\r\n<tr class=\"opthead\">\r\n<td class=\"param_name\">Parameter</td>\r\n<td class=\"param_default\">Default</td>\r\n<td class=\"param_desc\">&nbsp;</td>\r\n</tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">maxtrace</td><td class=\"param_default\">1000</td><td class=\"param_desc\">Max. number of traces in the cache</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxrecord</td><td class=\"param_default\">4000</td><td class=\"param_desc\">Max. number of recorded IR instructions</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">maxirconst</td><td class=\"param_default\">500</td><td class=\"param_desc\">Max. number of IR constants of a trace</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxside</td><td class=\"param_default\">100</td><td class=\"param_desc\">Max. number of side traces of a root trace</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">maxsnap</td><td class=\"param_default\">500</td><td class=\"param_desc\">Max. number of snapshots for a trace</td></tr>\r\n<tr class=\"even separate\">\r\n<td class=\"param_name\">hotloop</td><td class=\"param_default\">56</td><td class=\"param_desc\">Number of iterations to detect a hot loop or hot call</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">hotexit</td><td class=\"param_default\">10</td><td class=\"param_desc\">Number of taken exits to start a side trace</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">tryside</td><td class=\"param_default\">4</td><td class=\"param_desc\">Number of attempts to compile a side trace</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">instunroll</td><td class=\"param_default\">4</td><td class=\"param_desc\">Max. unroll factor for instable loops</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">loopunroll</td><td class=\"param_default\">15</td><td class=\"param_desc\">Max. unroll factor for loop ops in side traces</td></tr>\r\n<tr class=\"odd\">\r\n<td class=\"param_name\">callunroll</td><td class=\"param_default\">3</td><td class=\"param_desc\">Max. unroll factor for pseudo-recursive calls</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">recunroll</td><td class=\"param_default\">2</td><td class=\"param_desc\">Min. unroll factor for true recursion</td></tr>\r\n<tr class=\"odd separate\">\r\n<td class=\"param_name\">sizemcode</td><td class=\"param_default\">32</td><td class=\"param_desc\">Size of each machine code area in KBytes (Windows: 64K)</td></tr>\r\n<tr class=\"even\">\r\n<td class=\"param_name\">maxmcode</td><td class=\"param_default\">512</td><td class=\"param_desc\">Max. total size of all machine code areas in KBytes</td></tr>\r\n</table>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/doc/status.html",
    "content": "<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01//EN\" \"http://www.w3.org/TR/html4/strict.dtd\">\r\n<html>\r\n<head>\r\n<title>Status</title>\r\n<meta http-equiv=\"Content-Type\" content=\"text/html; charset=iso-8859-1\">\r\n<meta name=\"Author\" content=\"Mike Pall\">\r\n<meta name=\"Copyright\" content=\"Copyright (C) 2005-2015, Mike Pall\">\r\n<meta name=\"Language\" content=\"en\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad.css\" media=\"screen\">\r\n<link rel=\"stylesheet\" type=\"text/css\" href=\"bluequad-print.css\" media=\"print\">\r\n<style type=\"text/css\">\r\nul li { padding-bottom: 0.3em; }\r\n</style>\r\n</head>\r\n<body>\r\n<div id=\"site\">\r\n<a href=\"http://luajit.org\"><span>Lua<span id=\"logo\">JIT</span></span></a>\r\n</div>\r\n<div id=\"head\">\r\n<h1>Status</h1>\r\n</div>\r\n<div id=\"nav\">\r\n<ul><li>\r\n<a href=\"luajit.html\">LuaJIT</a>\r\n<ul><li>\r\n<a href=\"http://luajit.org/download.html\">Download <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"install.html\">Installation</a>\r\n</li><li>\r\n<a href=\"running.html\">Running</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"extensions.html\">Extensions</a>\r\n<ul><li>\r\n<a href=\"ext_ffi.html\">FFI Library</a>\r\n<ul><li>\r\n<a href=\"ext_ffi_tutorial.html\">FFI Tutorial</a>\r\n</li><li>\r\n<a href=\"ext_ffi_api.html\">ffi.* API</a>\r\n</li><li>\r\n<a href=\"ext_ffi_semantics.html\">FFI Semantics</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"ext_jit.html\">jit.* Library</a>\r\n</li><li>\r\n<a href=\"ext_c_api.html\">Lua/C API</a>\r\n</li><li>\r\n<a href=\"ext_profiler.html\">Profiler</a>\r\n</li></ul>\r\n</li><li>\r\n<a class=\"current\" href=\"status.html\">Status</a>\r\n<ul><li>\r\n<a href=\"changes.html\">Changes</a>\r\n</li></ul>\r\n</li><li>\r\n<a href=\"faq.html\">FAQ</a>\r\n</li><li>\r\n<a href=\"http://luajit.org/performance.html\">Performance <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://wiki.luajit.org/\">Wiki <span class=\"ext\">&raquo;</span></a>\r\n</li><li>\r\n<a href=\"http://luajit.org/list.html\">Mailing List <span class=\"ext\">&raquo;</span></a>\r\n</li></ul>\r\n</div>\r\n<div id=\"main\">\r\n<p>\r\n<span style=\"color: #0000c0;\">LuaJIT&nbsp;2.0</span> is the current\r\n<span style=\"color: #0000c0;\">stable branch</span>. This branch is in\r\nfeature-freeze &mdash; new features will only be added to LuaJIT&nbsp;2.1.\r\n</p>\r\n\r\n<h2>Current Status</h2>\r\n<p>\r\nLuaJIT ought to run all Lua&nbsp;5.1-compatible source code just fine.\r\nIt's considered a serious bug if the VM crashes or produces unexpected\r\nresults &mdash; please report this.\r\n</p>\r\n<p>\r\nKnown incompatibilities and issues in LuaJIT&nbsp;2.0:\r\n</p>\r\n<ul>\r\n<li>\r\nThere are some differences in <b>implementation-defined</b> behavior.\r\nThese either have a good reason, are arbitrary design choices\r\nor are due to quirks in the VM. The latter cases may get fixed if a\r\ndemonstrable need is shown.\r\n</li>\r\n<li>\r\nThe Lua <b>debug API</b> is missing a couple of features (return\r\nhooks for non-Lua functions) and shows slightly different behavior\r\nin LuaJIT (no per-coroutine hooks, no tail call counting).\r\n</li>\r\n<li>\r\nSome checks are missing in the JIT-compiled code for obscure situations\r\nwith <b>open upvalues aliasing</b> one of the SSA slots later on (or\r\nvice versa). Bonus points, if you can find a real world test case for\r\nthis.\r\n</li>\r\n<li>\r\nCurrently some <b>out-of-memory</b> errors from <b>on-trace code</b> are not\r\nhandled correctly. The error may fall through an on-trace\r\n<tt>pcall</tt> or it may be passed on to the function set with\r\n<tt>lua_atpanic</tt> on x64. This issue will be fixed with the new\r\ngarbage collector.\r\n</li>\r\n</ul>\r\n<br class=\"flush\">\r\n</div>\r\n<div id=\"foot\">\r\n<hr class=\"hide\">\r\nCopyright &copy; 2005-2015 Mike Pall\r\n<span class=\"noprint\">\r\n&middot;\r\n<a href=\"contact.html\">Contact</a>\r\n</span>\r\n</div>\r\n</body>\r\n</html>\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_arm.h",
    "content": "/*\r\n** DynASM ARM encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"arm\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC,\r\n  DASM_IMM, DASM_IMM12, DASM_IMM16, DASM_IMML8, DASM_IMML12, DASM_IMMV8,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\nstatic int dasm_imm12(unsigned int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < 16; i++, n = (n << 2) | (n >> 30))\r\n    if (n <= 255) return (int)(n + (i << 8));\r\n  return -1;\r\n}\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16);\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n      case DASM_IMM16:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n\tif ((ins & 0x8000))\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMMV8:\r\n\tCK((n & 3) == 0, RANGE_I);\r\n\tn >>= 2;\r\n      case DASM_IMML8:\r\n      case DASM_IMML12:\r\n\tCK(n >= 0 ? ((n>>((ins>>5)&31)) == 0) :\r\n\t\t    (((-n)>>((ins>>5)&31)) == 0), RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM12:\r\n\tCK(dasm_imm12((unsigned int)n) != -1, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: case DASM_IMM12: case DASM_IMM16:\r\n\tcase DASM_IMML8: case DASM_IMML12: case DASM_IMMV8: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xe1a00000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) - 4;\r\n\tpatchrel:\r\n\t  if ((ins & 0x800) == 0) {\r\n\t    CK((n & 3) == 0 && ((n+0x02000000) >> 26) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n >> 2) & 0x00ffffff);\r\n\t  } else if ((ins & 0x1000)) {\r\n\t    CK((n & 3) == 0 && -256 <= n && n <= 256, RANGE_REL);\r\n\t    goto patchimml8;\r\n\t  } else if ((ins & 0x2000) == 0) {\r\n\t    CK((n & 3) == 0 && -4096 <= n && n <= 4096, RANGE_REL);\r\n\t    goto patchimml;\r\n\t  } else {\r\n\t    CK((n & 3) == 0 && -1020 <= n && n <= 1020, RANGE_REL);\r\n\t    n >>= 2;\r\n\t    goto patchimml;\r\n\t  }\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= ((n>>((ins>>10)&31)) & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tcase DASM_IMM12:\r\n\t  cp[-1] |= dasm_imm12((unsigned int)n);\r\n\t  break;\r\n\tcase DASM_IMM16:\r\n\t  cp[-1] |= ((n & 0xf000) << 4) | (n & 0x0fff);\r\n\t  break;\r\n\tcase DASM_IMML8: patchimml8:\r\n\t  cp[-1] |= n >= 0 ? (0x00800000 | (n & 0x0f) | ((n & 0xf0) << 4)) :\r\n\t\t\t     ((-n & 0x0f) | ((-n & 0xf0) << 4));\r\n\t  break;\r\n\tcase DASM_IMML12: case DASM_IMMV8: patchimml:\r\n\t  cp[-1] |= n >= 0 ? (0x00800000 | n) : (-n);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_arm.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM ARM module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"arm\",\r\n  description =\t\"DynASM ARM module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable, rawget = assert, setmetatable, rawget\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch, gsub = _s.match, _s.gmatch, _s.gsub\r\nlocal concat, sort, insert = table.concat, table.sort, table.insert\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr, sar = bit.band, bit.lshift, bit.rshift, bit.arshift\r\nlocal ror, tohex = bit.ror, bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\", \"IMM12\", \"IMM16\", \"IMML8\", \"IMML12\", \"IMMV8\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n <= 0x000fffff then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  if n <= 0x000fffff then\r\n    insert(actlist, pos+1, n)\r\n    n = map_action.ESC * 0x10000\r\n  end\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\n\r\n-- Ext. register name -> int. name.\r\nlocal map_archdef = { sp = \"r13\", lr = \"r14\", pc = \"r15\", }\r\n\r\n-- Int. register name -> ext. name.\r\nlocal map_reg_rev = { r13 = \"sp\", r14 = \"lr\", r15 = \"pc\", }\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  return map_reg_rev[s] or s\r\nend\r\n\r\nlocal map_shift = { lsl = 0, lsr = 1, asr = 2, ror = 3, }\r\n\r\nlocal map_cond = {\r\n  eq = 0, ne = 1, cs = 2, cc = 3, mi = 4, pl = 5, vs = 6, vc = 7,\r\n  hi = 8, ls = 9, ge = 10, lt = 11, gt = 12, le = 13, al = 14,\r\n  hs = 2, lo = 3,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for ARM instructions.\r\nlocal map_op = {\r\n  -- Basic data processing instructions.\r\n  and_3 = \"e0000000DNPs\",\r\n  eor_3 = \"e0200000DNPs\",\r\n  sub_3 = \"e0400000DNPs\",\r\n  rsb_3 = \"e0600000DNPs\",\r\n  add_3 = \"e0800000DNPs\",\r\n  adc_3 = \"e0a00000DNPs\",\r\n  sbc_3 = \"e0c00000DNPs\",\r\n  rsc_3 = \"e0e00000DNPs\",\r\n  tst_2 = \"e1100000NP\",\r\n  teq_2 = \"e1300000NP\",\r\n  cmp_2 = \"e1500000NP\",\r\n  cmn_2 = \"e1700000NP\",\r\n  orr_3 = \"e1800000DNPs\",\r\n  mov_2 = \"e1a00000DPs\",\r\n  bic_3 = \"e1c00000DNPs\",\r\n  mvn_2 = \"e1e00000DPs\",\r\n\r\n  and_4 = \"e0000000DNMps\",\r\n  eor_4 = \"e0200000DNMps\",\r\n  sub_4 = \"e0400000DNMps\",\r\n  rsb_4 = \"e0600000DNMps\",\r\n  add_4 = \"e0800000DNMps\",\r\n  adc_4 = \"e0a00000DNMps\",\r\n  sbc_4 = \"e0c00000DNMps\",\r\n  rsc_4 = \"e0e00000DNMps\",\r\n  tst_3 = \"e1100000NMp\",\r\n  teq_3 = \"e1300000NMp\",\r\n  cmp_3 = \"e1500000NMp\",\r\n  cmn_3 = \"e1700000NMp\",\r\n  orr_4 = \"e1800000DNMps\",\r\n  mov_3 = \"e1a00000DMps\",\r\n  bic_4 = \"e1c00000DNMps\",\r\n  mvn_3 = \"e1e00000DMps\",\r\n\r\n  lsl_3 = \"e1a00000DMws\",\r\n  lsr_3 = \"e1a00020DMws\",\r\n  asr_3 = \"e1a00040DMws\",\r\n  ror_3 = \"e1a00060DMws\",\r\n  rrx_2 = \"e1a00060DMs\",\r\n\r\n  -- Multiply and multiply-accumulate.\r\n  mul_3 = \"e0000090NMSs\",\r\n  mla_4 = \"e0200090NMSDs\",\r\n  umaal_4 = \"e0400090DNMSs\",\t-- v6\r\n  mls_4 = \"e0600090DNMSs\",\t-- v6T2\r\n  umull_4 = \"e0800090DNMSs\",\r\n  umlal_4 = \"e0a00090DNMSs\",\r\n  smull_4 = \"e0c00090DNMSs\",\r\n  smlal_4 = \"e0e00090DNMSs\",\r\n\r\n  -- Halfword multiply and multiply-accumulate.\r\n  smlabb_4 = \"e1000080NMSD\",\t-- v5TE\r\n  smlatb_4 = \"e10000a0NMSD\",\t-- v5TE\r\n  smlabt_4 = \"e10000c0NMSD\",\t-- v5TE\r\n  smlatt_4 = \"e10000e0NMSD\",\t-- v5TE\r\n  smlawb_4 = \"e1200080NMSD\",\t-- v5TE\r\n  smulwb_3 = \"e12000a0NMS\",\t-- v5TE\r\n  smlawt_4 = \"e12000c0NMSD\",\t-- v5TE\r\n  smulwt_3 = \"e12000e0NMS\",\t-- v5TE\r\n  smlalbb_4 = \"e1400080NMSD\",\t-- v5TE\r\n  smlaltb_4 = \"e14000a0NMSD\",\t-- v5TE\r\n  smlalbt_4 = \"e14000c0NMSD\",\t-- v5TE\r\n  smlaltt_4 = \"e14000e0NMSD\",\t-- v5TE\r\n  smulbb_3 = \"e1600080NMS\",\t-- v5TE\r\n  smultb_3 = \"e16000a0NMS\",\t-- v5TE\r\n  smulbt_3 = \"e16000c0NMS\",\t-- v5TE\r\n  smultt_3 = \"e16000e0NMS\",\t-- v5TE\r\n\r\n  -- Miscellaneous data processing instructions.\r\n  clz_2 = \"e16f0f10DM\", -- v5T\r\n  rev_2 = \"e6bf0f30DM\", -- v6\r\n  rev16_2 = \"e6bf0fb0DM\", -- v6\r\n  revsh_2 = \"e6ff0fb0DM\", -- v6\r\n  sel_3 = \"e6800fb0DNM\", -- v6\r\n  usad8_3 = \"e780f010NMS\", -- v6\r\n  usada8_4 = \"e7800010NMSD\", -- v6\r\n  rbit_2 = \"e6ff0f30DM\", -- v6T2\r\n  movw_2 = \"e3000000DW\", -- v6T2\r\n  movt_2 = \"e3400000DW\", -- v6T2\r\n  -- Note: the X encodes width-1, not width.\r\n  sbfx_4 = \"e7a00050DMvX\", -- v6T2\r\n  ubfx_4 = \"e7e00050DMvX\", -- v6T2\r\n  -- Note: the X encodes the msb field, not the width.\r\n  bfc_3 = \"e7c0001fDvX\", -- v6T2\r\n  bfi_4 = \"e7c00010DMvX\", -- v6T2\r\n\r\n  -- Packing and unpacking instructions.\r\n  pkhbt_3 = \"e6800010DNM\", pkhbt_4 = \"e6800010DNMv\", -- v6\r\n  pkhtb_3 = \"e6800050DNM\", pkhtb_4 = \"e6800050DNMv\", -- v6\r\n  sxtab_3 = \"e6a00070DNM\", sxtab_4 = \"e6a00070DNMv\", -- v6\r\n  sxtab16_3 = \"e6800070DNM\", sxtab16_4 = \"e6800070DNMv\", -- v6\r\n  sxtah_3 = \"e6b00070DNM\", sxtah_4 = \"e6b00070DNMv\", -- v6\r\n  sxtb_2 = \"e6af0070DM\", sxtb_3 = \"e6af0070DMv\", -- v6\r\n  sxtb16_2 = \"e68f0070DM\", sxtb16_3 = \"e68f0070DMv\", -- v6\r\n  sxth_2 = \"e6bf0070DM\", sxth_3 = \"e6bf0070DMv\", -- v6\r\n  uxtab_3 = \"e6e00070DNM\", uxtab_4 = \"e6e00070DNMv\", -- v6\r\n  uxtab16_3 = \"e6c00070DNM\", uxtab16_4 = \"e6c00070DNMv\", -- v6\r\n  uxtah_3 = \"e6f00070DNM\", uxtah_4 = \"e6f00070DNMv\", -- v6\r\n  uxtb_2 = \"e6ef0070DM\", uxtb_3 = \"e6ef0070DMv\", -- v6\r\n  uxtb16_2 = \"e6cf0070DM\", uxtb16_3 = \"e6cf0070DMv\", -- v6\r\n  uxth_2 = \"e6ff0070DM\", uxth_3 = \"e6ff0070DMv\", -- v6\r\n\r\n  -- Saturating instructions.\r\n  qadd_3 = \"e1000050DMN\",\t-- v5TE\r\n  qsub_3 = \"e1200050DMN\",\t-- v5TE\r\n  qdadd_3 = \"e1400050DMN\",\t-- v5TE\r\n  qdsub_3 = \"e1600050DMN\",\t-- v5TE\r\n  -- Note: the X for ssat* encodes sat_imm-1, not sat_imm.\r\n  ssat_3 = \"e6a00010DXM\", ssat_4 = \"e6a00010DXMp\", -- v6\r\n  usat_3 = \"e6e00010DXM\", usat_4 = \"e6e00010DXMp\", -- v6\r\n  ssat16_3 = \"e6a00f30DXM\", -- v6\r\n  usat16_3 = \"e6e00f30DXM\", -- v6\r\n\r\n  -- Parallel addition and subtraction.\r\n  sadd16_3 = \"e6100f10DNM\", -- v6\r\n  sasx_3 = \"e6100f30DNM\", -- v6\r\n  ssax_3 = \"e6100f50DNM\", -- v6\r\n  ssub16_3 = \"e6100f70DNM\", -- v6\r\n  sadd8_3 = \"e6100f90DNM\", -- v6\r\n  ssub8_3 = \"e6100ff0DNM\", -- v6\r\n  qadd16_3 = \"e6200f10DNM\", -- v6\r\n  qasx_3 = \"e6200f30DNM\", -- v6\r\n  qsax_3 = \"e6200f50DNM\", -- v6\r\n  qsub16_3 = \"e6200f70DNM\", -- v6\r\n  qadd8_3 = \"e6200f90DNM\", -- v6\r\n  qsub8_3 = \"e6200ff0DNM\", -- v6\r\n  shadd16_3 = \"e6300f10DNM\", -- v6\r\n  shasx_3 = \"e6300f30DNM\", -- v6\r\n  shsax_3 = \"e6300f50DNM\", -- v6\r\n  shsub16_3 = \"e6300f70DNM\", -- v6\r\n  shadd8_3 = \"e6300f90DNM\", -- v6\r\n  shsub8_3 = \"e6300ff0DNM\", -- v6\r\n  uadd16_3 = \"e6500f10DNM\", -- v6\r\n  uasx_3 = \"e6500f30DNM\", -- v6\r\n  usax_3 = \"e6500f50DNM\", -- v6\r\n  usub16_3 = \"e6500f70DNM\", -- v6\r\n  uadd8_3 = \"e6500f90DNM\", -- v6\r\n  usub8_3 = \"e6500ff0DNM\", -- v6\r\n  uqadd16_3 = \"e6600f10DNM\", -- v6\r\n  uqasx_3 = \"e6600f30DNM\", -- v6\r\n  uqsax_3 = \"e6600f50DNM\", -- v6\r\n  uqsub16_3 = \"e6600f70DNM\", -- v6\r\n  uqadd8_3 = \"e6600f90DNM\", -- v6\r\n  uqsub8_3 = \"e6600ff0DNM\", -- v6\r\n  uhadd16_3 = \"e6700f10DNM\", -- v6\r\n  uhasx_3 = \"e6700f30DNM\", -- v6\r\n  uhsax_3 = \"e6700f50DNM\", -- v6\r\n  uhsub16_3 = \"e6700f70DNM\", -- v6\r\n  uhadd8_3 = \"e6700f90DNM\", -- v6\r\n  uhsub8_3 = \"e6700ff0DNM\", -- v6\r\n\r\n  -- Load/store instructions.\r\n  str_2 = \"e4000000DL\", str_3 = \"e4000000DL\", str_4 = \"e4000000DL\",\r\n  strb_2 = \"e4400000DL\", strb_3 = \"e4400000DL\", strb_4 = \"e4400000DL\",\r\n  ldr_2 = \"e4100000DL\", ldr_3 = \"e4100000DL\", ldr_4 = \"e4100000DL\",\r\n  ldrb_2 = \"e4500000DL\", ldrb_3 = \"e4500000DL\", ldrb_4 = \"e4500000DL\",\r\n  strh_2 = \"e00000b0DL\", strh_3 = \"e00000b0DL\",\r\n  ldrh_2 = \"e01000b0DL\", ldrh_3 = \"e01000b0DL\",\r\n  ldrd_2 = \"e00000d0DL\", ldrd_3 = \"e00000d0DL\", -- v5TE\r\n  ldrsb_2 = \"e01000d0DL\", ldrsb_3 = \"e01000d0DL\",\r\n  strd_2 = \"e00000f0DL\", strd_3 = \"e00000f0DL\", -- v5TE\r\n  ldrsh_2 = \"e01000f0DL\", ldrsh_3 = \"e01000f0DL\",\r\n\r\n  ldm_2 = \"e8900000oR\", ldmia_2 = \"e8900000oR\", ldmfd_2 = \"e8900000oR\",\r\n  ldmda_2 = \"e8100000oR\", ldmfa_2 = \"e8100000oR\",\r\n  ldmdb_2 = \"e9100000oR\", ldmea_2 = \"e9100000oR\",\r\n  ldmib_2 = \"e9900000oR\", ldmed_2 = \"e9900000oR\",\r\n  stm_2 = \"e8800000oR\", stmia_2 = \"e8800000oR\", stmfd_2 = \"e8800000oR\",\r\n  stmda_2 = \"e8000000oR\", stmfa_2 = \"e8000000oR\",\r\n  stmdb_2 = \"e9000000oR\", stmea_2 = \"e9000000oR\",\r\n  stmib_2 = \"e9800000oR\", stmed_2 = \"e9800000oR\",\r\n  pop_1 = \"e8bd0000R\", push_1 = \"e92d0000R\",\r\n\r\n  -- Branch instructions.\r\n  b_1 = \"ea000000B\",\r\n  bl_1 = \"eb000000B\",\r\n  blx_1 = \"e12fff30C\",\r\n  bx_1 = \"e12fff10M\",\r\n\r\n  -- Miscellaneous instructions.\r\n  nop_0 = \"e1a00000\",\r\n  mrs_1 = \"e10f0000D\",\r\n  bkpt_1 = \"e1200070K\", -- v5T\r\n  svc_1 = \"ef000000T\", swi_1 = \"ef000000T\",\r\n  ud_0 = \"e7f001f0\",\r\n\r\n  -- VFP instructions.\r\n  [\"vadd.f32_3\"] = \"ee300a00dnm\",\r\n  [\"vadd.f64_3\"] = \"ee300b00Gdnm\",\r\n  [\"vsub.f32_3\"] = \"ee300a40dnm\",\r\n  [\"vsub.f64_3\"] = \"ee300b40Gdnm\",\r\n  [\"vmul.f32_3\"] = \"ee200a00dnm\",\r\n  [\"vmul.f64_3\"] = \"ee200b00Gdnm\",\r\n  [\"vnmul.f32_3\"] = \"ee200a40dnm\",\r\n  [\"vnmul.f64_3\"] = \"ee200b40Gdnm\",\r\n  [\"vmla.f32_3\"] = \"ee000a00dnm\",\r\n  [\"vmla.f64_3\"] = \"ee000b00Gdnm\",\r\n  [\"vmls.f32_3\"] = \"ee000a40dnm\",\r\n  [\"vmls.f64_3\"] = \"ee000b40Gdnm\",\r\n  [\"vnmla.f32_3\"] = \"ee100a40dnm\",\r\n  [\"vnmla.f64_3\"] = \"ee100b40Gdnm\",\r\n  [\"vnmls.f32_3\"] = \"ee100a00dnm\",\r\n  [\"vnmls.f64_3\"] = \"ee100b00Gdnm\",\r\n  [\"vdiv.f32_3\"] = \"ee800a00dnm\",\r\n  [\"vdiv.f64_3\"] = \"ee800b00Gdnm\",\r\n\r\n  [\"vabs.f32_2\"] = \"eeb00ac0dm\",\r\n  [\"vabs.f64_2\"] = \"eeb00bc0Gdm\",\r\n  [\"vneg.f32_2\"] = \"eeb10a40dm\",\r\n  [\"vneg.f64_2\"] = \"eeb10b40Gdm\",\r\n  [\"vsqrt.f32_2\"] = \"eeb10ac0dm\",\r\n  [\"vsqrt.f64_2\"] = \"eeb10bc0Gdm\",\r\n  [\"vcmp.f32_2\"] = \"eeb40a40dm\",\r\n  [\"vcmp.f64_2\"] = \"eeb40b40Gdm\",\r\n  [\"vcmpe.f32_2\"] = \"eeb40ac0dm\",\r\n  [\"vcmpe.f64_2\"] = \"eeb40bc0Gdm\",\r\n  [\"vcmpz.f32_1\"] = \"eeb50a40d\",\r\n  [\"vcmpz.f64_1\"] = \"eeb50b40Gd\",\r\n  [\"vcmpze.f32_1\"] = \"eeb50ac0d\",\r\n  [\"vcmpze.f64_1\"] = \"eeb50bc0Gd\",\r\n\r\n  vldr_2 = \"ed100a00dl|ed100b00Gdl\",\r\n  vstr_2 = \"ed000a00dl|ed000b00Gdl\",\r\n  vldm_2 = \"ec900a00or\",\r\n  vldmia_2 = \"ec900a00or\",\r\n  vldmdb_2 = \"ed100a00or\",\r\n  vpop_1 = \"ecbd0a00r\",\r\n  vstm_2 = \"ec800a00or\",\r\n  vstmia_2 = \"ec800a00or\",\r\n  vstmdb_2 = \"ed000a00or\",\r\n  vpush_1 = \"ed2d0a00r\",\r\n\r\n  [\"vmov.f32_2\"] = \"eeb00a40dm|eeb00a00dY\",\t-- #imm is VFPv3 only\r\n  [\"vmov.f64_2\"] = \"eeb00b40Gdm|eeb00b00GdY\",\t-- #imm is VFPv3 only\r\n  vmov_2 = \"ee100a10Dn|ee000a10nD\",\r\n  vmov_3 = \"ec500a10DNm|ec400a10mDN|ec500b10GDNm|ec400b10GmDN\",\r\n\r\n  vmrs_0 = \"eef1fa10\",\r\n  vmrs_1 = \"eef10a10D\",\r\n  vmsr_1 = \"eee10a10D\",\r\n\r\n  [\"vcvt.s32.f32_2\"] = \"eebd0ac0dm\",\r\n  [\"vcvt.s32.f64_2\"] = \"eebd0bc0dGm\",\r\n  [\"vcvt.u32.f32_2\"] = \"eebc0ac0dm\",\r\n  [\"vcvt.u32.f64_2\"] = \"eebc0bc0dGm\",\r\n  [\"vcvtr.s32.f32_2\"] = \"eebd0a40dm\",\r\n  [\"vcvtr.s32.f64_2\"] = \"eebd0b40dGm\",\r\n  [\"vcvtr.u32.f32_2\"] = \"eebc0a40dm\",\r\n  [\"vcvtr.u32.f64_2\"] = \"eebc0b40dGm\",\r\n  [\"vcvt.f32.s32_2\"] = \"eeb80ac0dm\",\r\n  [\"vcvt.f64.s32_2\"] = \"eeb80bc0GdFm\",\r\n  [\"vcvt.f32.u32_2\"] = \"eeb80a40dm\",\r\n  [\"vcvt.f64.u32_2\"] = \"eeb80b40GdFm\",\r\n  [\"vcvt.f32.f64_2\"] = \"eeb70bc0dGm\",\r\n  [\"vcvt.f64.f32_2\"] = \"eeb70ac0GdFm\",\r\n\r\n  -- VFPv4 only:\r\n  [\"vfma.f32_3\"] = \"eea00a00dnm\",\r\n  [\"vfma.f64_3\"] = \"eea00b00Gdnm\",\r\n  [\"vfms.f32_3\"] = \"eea00a40dnm\",\r\n  [\"vfms.f64_3\"] = \"eea00b40Gdnm\",\r\n  [\"vfnma.f32_3\"] = \"ee900a40dnm\",\r\n  [\"vfnma.f64_3\"] = \"ee900b40Gdnm\",\r\n  [\"vfnms.f32_3\"] = \"ee900a00dnm\",\r\n  [\"vfnms.f64_3\"] = \"ee900b00Gdnm\",\r\n\r\n  -- NYI: Advanced SIMD instructions.\r\n\r\n  -- NYI: I have no need for these instructions right now:\r\n  -- swp, swpb, strex, ldrex, strexd, ldrexd, strexb, ldrexb, strexh, ldrexh\r\n  -- msr, nopv6, yield, wfe, wfi, sev, dbg, bxj, smc, srs, rfe\r\n  -- cps, setend, pli, pld, pldw, clrex, dsb, dmb, isb\r\n  -- stc, ldc, mcr, mcr2, mrc, mrc2, mcrr, mcrr2, mrrc, mrrc2, cdp, cdp2\r\n}\r\n\r\n-- Add mnemonics for \"s\" variants.\r\ndo\r\n  local t = {}\r\n  for k,v in pairs(map_op) do\r\n    if sub(v, -1) == \"s\" then\r\n      local v2 = sub(v, 1, 2)..char(byte(v, 3)+1)..sub(v, 4, -2)\r\n      t[sub(k, 1, -3)..\"s\"..sub(k, -2)] = v2\r\n    end\r\n  end\r\n  for k,v in pairs(t) do\r\n    map_op[k] = v\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r1?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r(1?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 15 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_gpr_pm(expr)\r\n  local pm, expr2 = match(expr, \"^([+-]?)(.*)$\")\r\n  return parse_gpr(expr2), (pm == \"-\")\r\nend\r\n\r\nlocal function parse_vr(expr, tp)\r\n  local t, r = match(expr, \"^([sd])([0-9]+)$\")\r\n  if t == tp then\r\n    r = tonumber(r)\r\n    if r <= 31 then\r\n      if t == \"s\" then return shr(r, 1), band(r, 1) end\r\n      return band(r, 15), shr(r, 4)\r\n    end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_reglist(reglist)\r\n  reglist = match(reglist, \"^{%s*([^}]*)}$\")\r\n  if not reglist then werror(\"register list expected\") end\r\n  local rr = 0\r\n  for p in gmatch(reglist..\",\", \"%s*([^,]*),\") do\r\n    local rbit = shl(1, parse_gpr(gsub(p, \"%s+$\", \"\")))\r\n    if band(rr, rbit) ~= 0 then\r\n      werror(\"duplicate register `\"..p..\"'\")\r\n    end\r\n    rr = rr + rbit\r\n  end\r\n  return rr\r\nend\r\n\r\nlocal function parse_vrlist(reglist)\r\n  local ta, ra, tb, rb = match(reglist,\r\n\t\t\t   \"^{%s*([sd])([0-9]+)%s*%-%s*([sd])([0-9]+)%s*}$\")\r\n  ra, rb = tonumber(ra), tonumber(rb)\r\n  if ta and ta == tb and ra and rb and ra <= 31 and rb <= 31 and ra <= rb then\r\n    local nr = rb+1 - ra\r\n    if ta == \"s\" then\r\n      return shl(shr(ra,1),12)+shl(band(ra,1),22) + nr\r\n    else\r\n      return shl(band(ra,15),12)+shl(shr(ra,4),22) + nr*2 + 0x100\r\n    end\r\n  end\r\n  werror(\"register list expected\")\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm12(imm)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = band(n)\r\n    for i=0,-15,-1 do\r\n      if shr(m, 8) == 0 then return m + shl(band(i, 15), 8) end\r\n      m = ror(m, 2)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM12\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm16(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = tonumber(imm)\r\n  if n then\r\n    if shr(n, 16) == 0 then return band(n, 0x0fff) + shl(band(n, 0xf000), 4) end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM16\", 32*16, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm_load(imm, ext)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    if ext then\r\n      if n >= -255 and n <= 255 then\r\n\tlocal up = 0x00800000\r\n\tif n < 0 then n = -n; up = 0 end\r\n\treturn shl(band(n, 0xf0), 4) + band(n, 0x0f) + up\r\n      end\r\n    else\r\n      if n >= -4095 and n <= 4095 then\r\n\tif n >= 0 then return n+0x00800000 end\r\n\treturn -n\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(ext and \"IMML8\" or \"IMML12\", 32768 + shl(ext and 8 or 12, 5), imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_shift(shift, gprok)\r\n  if shift == \"rrx\" then\r\n    return 3 * 32\r\n  else\r\n    local s, s2 = match(shift, \"^(%S+)%s*(.*)$\")\r\n    s = map_shift[s]\r\n    if not s then werror(\"expected shift operand\") end\r\n    if sub(s2, 1, 1) == \"#\" then\r\n      return parse_imm(s2, 5, 7, 0, false) + shl(s, 5)\r\n    else\r\n      if not gprok then werror(\"expected immediate shift operand\") end\r\n      return shl(parse_gpr(s2), 8) + shl(s, 5) + 16\r\n    end\r\n  end\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\nlocal function parse_load(params, nparams, n, op)\r\n  local oplo = band(op, 255)\r\n  local ext, ldrd = (oplo ~= 0), (oplo == 208)\r\n  local d\r\n  if (ldrd or oplo == 240) then\r\n    d = band(shr(op, 12), 15)\r\n    if band(d, 1) ~= 0 then werror(\"odd destination register\") end\r\n  end\r\n  local pn = params[n]\r\n  local p1, wb = match(pn, \"^%[%s*(.-)%s*%](!?)$\")\r\n  local p2 = params[n+1]\r\n  if not p1 then\r\n    if not p2 then\r\n      if match(pn, \"^[<>=%-]\") or match(pn, \"^extern%s+\") then\r\n\tlocal mode, n, s = parse_label(pn, false)\r\n\twaction(\"REL_\"..mode, n + (ext and 0x1800 or 0x0800), s, 1)\r\n\treturn op + 15 * 65536 + 0x01000000 + (ext and 0x00400000 or 0)\r\n      end\r\n      local reg, tailr = match(pn, \"^([%w_:]+)%s*(.*)$\")\r\n      if reg and tailr ~= \"\" then\r\n\tlocal d, tp = parse_gpr(reg)\r\n\tif tp then\r\n\t  waction(ext and \"IMML8\" or \"IMML12\", 32768 + 32*(ext and 8 or 12),\r\n\t\t  format(tp.ctypefmt, tailr))\r\n\t  return op + shl(d, 16) + 0x01000000 + (ext and 0x00400000 or 0)\r\n\tend\r\n      end\r\n    end\r\n    werror(\"expected address operand\")\r\n  end\r\n  if wb == \"!\" then op = op + 0x00200000 end\r\n  if p2 then\r\n    if wb == \"!\" then werror(\"bad use of '!'\") end\r\n    local p3 = params[n+2]\r\n    op = op + shl(parse_gpr(p1), 16)\r\n    local imm = match(p2, \"^#(.*)$\")\r\n    if imm then\r\n      local m = parse_imm_load(imm, ext)\r\n      if p3 then werror(\"too many parameters\") end\r\n      op = op + m + (ext and 0x00400000 or 0)\r\n    else\r\n      local m, neg = parse_gpr_pm(p2)\r\n      if ldrd and (m == d or m-1 == d) then werror(\"register conflict\") end\r\n      op = op + m + (neg and 0 or 0x00800000) + (ext and 0 or 0x02000000)\r\n      if p3 then op = op + parse_shift(p3) end\r\n    end\r\n  else\r\n    local p1a, p2 = match(p1, \"^([^,%s]*)%s*(.*)$\")\r\n    op = op + shl(parse_gpr(p1a), 16) + 0x01000000\r\n    if p2 ~= \"\" then\r\n      local imm = match(p2, \"^,%s*#(.*)$\")\r\n      if imm then\r\n\tlocal m = parse_imm_load(imm, ext)\r\n\top = op + m + (ext and 0x00400000 or 0)\r\n      else\r\n\tlocal p2a, p3 = match(p2, \"^,%s*([^,%s]*)%s*,?%s*(.*)$\")\r\n\tlocal m, neg = parse_gpr_pm(p2a)\r\n\tif ldrd and (m == d or m-1 == d) then werror(\"register conflict\") end\r\n\top = op + m + (neg and 0 or 0x00800000) + (ext and 0 or 0x02000000)\r\n\tif p3 ~= \"\" then\r\n\t  if ext then werror(\"too many parameters\") end\r\n\t  op = op + parse_shift(p3)\r\n\tend\r\n      end\r\n    else\r\n      if wb == \"!\" then werror(\"bad use of '!'\") end\r\n      op = op + (ext and 0x00c00000 or 0x00800000)\r\n    end\r\n  end\r\n  return op\r\nend\r\n\r\nlocal function parse_vload(q)\r\n  local reg, imm = match(q, \"^%[%s*([^,%s]*)%s*(.*)%]$\")\r\n  if reg then\r\n    local d = shl(parse_gpr(reg), 16)\r\n    if imm == \"\" then return d end\r\n    imm = match(imm, \"^,%s*#(.*)$\")\r\n    if imm then\r\n      local n = tonumber(imm)\r\n      if n then\r\n\tif n >= -1020 and n <= 1020 and n%4 == 0 then\r\n\t  return d + (n >= 0 and n/4+0x00800000 or -n/4)\r\n\tend\r\n\twerror(\"out of range immediate `\"..imm..\"'\")\r\n      else\r\n\twaction(\"IMMV8\", 32768 + 32*8, imm)\r\n\treturn d\r\n      end\r\n    end\r\n  else\r\n    if match(q, \"^[<>=%-]\") or match(q, \"^extern%s+\") then\r\n      local mode, n, s = parse_label(q, false)\r\n      waction(\"REL_\"..mode, n + 0x2800, s, 1)\r\n      return 15 * 65536\r\n    end\r\n    local reg, tailr = match(q, \"^([%w_:]+)%s*(.*)$\")\r\n    if reg and tailr ~= \"\" then\r\n      local d, tp = parse_gpr(reg)\r\n      if tp then\r\n\twaction(\"IMMV8\", 32768 + 32*8, format(tp.ctypefmt, tailr))\r\n\treturn shl(d, 16)\r\n      end\r\n    end\r\n  end\r\n  werror(\"expected address operand\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nlocal function parse_template(params, template, nparams, pos)\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n = 1\r\n  local vr = \"s\"\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    local q = params[n]\r\n    if p == \"D\" then\r\n      op = op + shl(parse_gpr(q), 12); n = n + 1\r\n    elseif p == \"N\" then\r\n      op = op + shl(parse_gpr(q), 16); n = n + 1\r\n    elseif p == \"S\" then\r\n      op = op + shl(parse_gpr(q), 8); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_gpr(q); n = n + 1\r\n    elseif p == \"d\" then\r\n      local r,h = parse_vr(q, vr); op = op+shl(r,12)+shl(h,22); n = n + 1\r\n    elseif p == \"n\" then\r\n      local r,h = parse_vr(q, vr); op = op+shl(r,16)+shl(h,7); n = n + 1\r\n    elseif p == \"m\" then\r\n      local r,h = parse_vr(q, vr); op = op+r+shl(h,5); n = n + 1\r\n    elseif p == \"P\" then\r\n      local imm = match(q, \"^#(.*)$\")\r\n      if imm then\r\n\top = op + parse_imm12(imm) + 0x02000000\r\n      else\r\n\top = op + parse_gpr(q)\r\n      end\r\n      n = n + 1\r\n    elseif p == \"p\" then\r\n      op = op + parse_shift(q, true); n = n + 1\r\n    elseif p == \"L\" then\r\n      op = parse_load(params, nparams, n, op)\r\n    elseif p == \"l\" then\r\n      op = op + parse_vload(q)\r\n    elseif p == \"B\" then\r\n      local mode, n, s = parse_label(q, false)\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n    elseif p == \"C\" then -- blx gpr vs. blx label.\r\n      if match(q, \"^([%w_]+):(r1?[0-9])$\") or match(q, \"^r(1?[0-9])$\") then\r\n\top = op + parse_gpr(q)\r\n      else\r\n\tif op < 0xe0000000 then werror(\"unconditional instruction\") end\r\n\tlocal mode, n, s = parse_label(q, false)\r\n\twaction(\"REL_\"..mode, n, s, 1)\r\n\top = 0xfa000000\r\n      end\r\n    elseif p == \"F\" then\r\n      vr = \"s\"\r\n    elseif p == \"G\" then\r\n      vr = \"d\"\r\n    elseif p == \"o\" then\r\n      local r, wb = match(q, \"^([^!]*)(!?)$\")\r\n      op = op + shl(parse_gpr(r), 16) + (wb == \"!\" and 0x00200000 or 0)\r\n      n = n + 1\r\n    elseif p == \"R\" then\r\n      op = op + parse_reglist(q); n = n + 1\r\n    elseif p == \"r\" then\r\n      op = op + parse_vrlist(q); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_imm16(q); n = n + 1\r\n    elseif p == \"v\" then\r\n      op = op + parse_imm(q, 5, 7, 0, false); n = n + 1\r\n    elseif p == \"w\" then\r\n      local imm = match(q, \"^#(.*)$\")\r\n      if imm then\r\n\top = op + parse_imm(q, 5, 7, 0, false); n = n + 1\r\n      else\r\n\top = op + shl(parse_gpr(q), 8) + 16\r\n      end\r\n    elseif p == \"X\" then\r\n      op = op + parse_imm(q, 5, 16, 0, false); n = n + 1\r\n    elseif p == \"Y\" then\r\n      local imm = tonumber(match(q, \"^#(.*)$\")); n = n + 1\r\n      if not imm or shr(imm, 8) ~= 0 then\r\n\twerror(\"bad immediate operand\")\r\n      end\r\n      op = op + shl(band(imm, 0xf0), 12) + band(imm, 0x0f)\r\n    elseif p == \"K\" then\r\n      local imm = tonumber(match(q, \"^#(.*)$\")); n = n + 1\r\n      if not imm or shr(imm, 16) ~= 0 then\r\n\twerror(\"bad immediate operand\")\r\n      end\r\n      op = op + shl(band(imm, 0xfff0), 4) + band(imm, 0x000f)\r\n    elseif p == \"T\" then\r\n      op = op + parse_imm(q, 24, 0, 0, false); n = n + 1\r\n    elseif p == \"s\" then\r\n      -- Ignored.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return template:gsub(\"%x%x%x%x%x%x%x%x\", \"\") end\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 3 positions.\r\n  if secpos+3 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n  local lpos, apos, spos = #actlist, #actargs, secpos\r\n\r\n  local ok, err\r\n  for t in gmatch(template, \"[^|]+\") do\r\n    ok, err = pcall(parse_template, params, t, nparams, pos)\r\n    if ok then return end\r\n    secpos = spos\r\n    actlist[lpos+1] = nil\r\n    actlist[lpos+2] = nil\r\n    actlist[lpos+3] = nil\r\n    actargs[apos+1] = nil\r\n    actargs[apos+2] = nil\r\n    actargs[apos+3] = nil\r\n  end\r\n  error(err, 0)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = function(t, k)\r\n    local v = map_coreop[k]\r\n    if v then return v end\r\n    local k1, cc, k2 = match(k, \"^(.-)(..)([._].*)$\")\r\n    local cv = map_cond[cc]\r\n    if cv then\r\n      local v = rawget(t, k1..k2)\r\n      if type(v) == \"string\" then\r\n\tlocal scv = format(\"%x\", cv)\r\n\treturn gsub(scv..sub(v, 2), \"|e\", \"|\"..scv)\r\n      end\r\n    end\r\n  end })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_arm64.h",
    "content": "/*\r\n** DynASM ARM64 encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"arm64\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC,\r\n  DASM_IMM, DASM_IMM6, DASM_IMM12, DASM_IMM13W, DASM_IMM13X, DASM_IMML,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\nstatic int dasm_imm12(unsigned int n)\r\n{\r\n  if ((n >> 12) == 0)\r\n    return n;\r\n  else if ((n & 0xff000fff) == 0)\r\n    return (n >> 12) | 0x1000;\r\n  else\r\n    return -1;\r\n}\r\n\r\nstatic int dasm_ffs(unsigned long long x)\r\n{\r\n  int n = -1;\r\n  while (x) { x >>= 1; n++; }\r\n  return n;\r\n}\r\n\r\nstatic int dasm_imm13(int lo, int hi)\r\n{\r\n  int inv = 0, w = 64, s = 0xfff, xa, xb;\r\n  unsigned long long n = (((unsigned long long)hi) << 32) | (unsigned int)lo;\r\n  unsigned long long m = 1ULL, a, b, c;\r\n  if (n & 1) { n = ~n; inv = 1; }\r\n  a = n & -n; b = (n+a)&-(n+a); c = (n+a-b)&-(n+a-b);\r\n  xa = dasm_ffs(a); xb = dasm_ffs(b);\r\n  if (c) {\r\n    w = dasm_ffs(c) - xa;\r\n    if (w == 32) m = 0x0000000100000001UL;\r\n    else if (w == 16) m = 0x0001000100010001UL;\r\n    else if (w == 8) m = 0x0101010101010101UL;\r\n    else if (w == 4) m = 0x1111111111111111UL;\r\n    else if (w == 2) m = 0x5555555555555555UL;\r\n    else return -1;\r\n    s = (-2*w & 0x3f) - 1;\r\n  } else if (!a) {\r\n    return -1;\r\n  } else if (xb == -1) {\r\n    xb = 64;\r\n  }\r\n  if ((b-a) * m != n) return -1;\r\n  if (inv) {\r\n    return ((w - xb) << 6) | (s+w+xa-xb);\r\n  } else {\r\n    return ((w - xa) << 6) | (s+xb-xa);\r\n  }\r\n  return -1;\r\n}\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16);\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n\tn >>= ((ins>>10)&31);\r\n#ifdef DASM_CHECKS\r\n\tif ((ins & 0x8000))\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM6:\r\n\tCK((n >> 6) == 0, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM12:\r\n\tCK(dasm_imm12((unsigned int)n) != -1, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM13W:\r\n\tCK(dasm_imm13(n, n) != -1, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMM13X: {\r\n\tint m = va_arg(ap, int);\r\n\tCK(dasm_imm13(n, m) != -1, RANGE_I);\r\n\tb[pos++] = n;\r\n\tb[pos++] = m;\r\n\tbreak;\r\n\t}\r\n      case DASM_IMML: {\r\n#ifdef DASM_CHECKS\r\n\tint scale = (p[-2] >> 30);\r\n\tCK((!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ||\r\n\t   (unsigned int)(n+256) < 512, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n\t}\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: case DASM_IMM6: case DASM_IMM12: case DASM_IMM13W:\r\n\tcase DASM_IMML: pos++; break;\r\n\tcase DASM_IMM13X: pos += 2; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xe1a00000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) + 4;\r\n\tpatchrel:\r\n\t  if (!(ins & 0xf800)) {  /* B, BL */\r\n\t    CK((n & 3) == 0 && ((n+0x08000000) >> 28) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n >> 2) & 0x03ffffff);\r\n\t  } else if ((ins & 0x800)) {  /* B.cond, CBZ, CBNZ, LDR* literal */\r\n\t    CK((n & 3) == 0 && ((n+0x00100000) >> 21) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n << 3) & 0x00ffffe0);\r\n\t  } else if ((ins & 0x3000) == 0x2000) {  /* ADR */\r\n\t    CK(((n+0x00100000) >> 21) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n << 3) & 0x00ffffe0) | ((n & 3) << 29);\r\n\t  } else if ((ins & 0x3000) == 0x3000) {  /* ADRP */\r\n\t    cp[-1] |= ((n >> 9) & 0x00ffffe0) | (((n >> 12) & 3) << 29);\r\n\t  } else if ((ins & 0x1000)) {  /* TBZ, TBNZ */\r\n\t    CK((n & 3) == 0 && ((n+0x00008000) >> 16) == 0, RANGE_REL);\r\n\t    cp[-1] |= ((n << 3) & 0x0007ffe0);\r\n\t  }\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tcase DASM_IMM6:\r\n\t  cp[-1] |= ((n&31) << 19) | ((n&32) << 26);\r\n\t  break;\r\n\tcase DASM_IMM12:\r\n\t  cp[-1] |= (dasm_imm12((unsigned int)n) << 10);\r\n\t  break;\r\n\tcase DASM_IMM13W:\r\n\t  cp[-1] |= (dasm_imm13(n, n) << 10);\r\n\t  break;\r\n\tcase DASM_IMM13X:\r\n\t  cp[-1] |= (dasm_imm13(n, *b++) << 10);\r\n\t  break;\r\n\tcase DASM_IMML: {\r\n\t  int scale = (p[-2] >> 30);\r\n\t  cp[-1] |= (!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ?\r\n\t    ((n << (10-scale)) | 0x01000000) : ((n & 511) << 12);\r\n\t  break;\r\n\t  }\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_arm64.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM ARM64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"arm\",\r\n  description =\t\"DynASM ARM64 module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2014-12-03\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable, rawget = assert, setmetatable, rawget\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch, gsub = _s.match, _s.gmatch, _s.gsub\r\nlocal concat, sort, insert = table.concat, table.sort, table.insert\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr, sar = bit.band, bit.lshift, bit.rshift, bit.arshift\r\nlocal ror, tohex = bit.ror, bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\", \"IMM6\", \"IMM12\", \"IMM13W\", \"IMM13X\", \"IMML\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n <= 0x000fffff then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  if n <= 0x000fffff then\r\n    insert(actlist, pos+1, n)\r\n    n = map_action.ESC * 0x10000\r\n  end\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\n\r\n-- Ext. register name -> int. name.\r\nlocal map_archdef = { xzr = \"@x31\", wzr = \"@w31\", lr = \"x30\", }\r\n\r\n-- Int. register name -> ext. name.\r\nlocal map_reg_rev = { [\"@x31\"] = \"xzr\", [\"@w31\"] = \"wzr\", x30 = \"lr\", }\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  return map_reg_rev[s] or s\r\nend\r\n\r\nlocal map_shift = { lsl = 0, lsr = 1, asr = 2, }\r\n\r\nlocal map_extend = {\r\n  uxtb = 0, uxth = 1, uxtw = 2, uxtx = 3,\r\n  sxtb = 4, sxth = 5, sxtw = 6, sxtx = 7,\r\n}\r\n\r\nlocal map_cond = {\r\n  eq = 0, ne = 1, cs = 2, cc = 3, mi = 4, pl = 5, vs = 6, vc = 7,\r\n  hi = 8, ls = 9, ge = 10, lt = 11, gt = 12, le = 13, al = 14,\r\n  hs = 2, lo = 3,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal parse_reg_type\r\n\r\nlocal function parse_reg(expr)\r\n  if not expr then werror(\"expected register name\") end\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(@?%l%d+)$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local ok31, rt, r = match(expr, \"^(@?)([xwqdshb])([123]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 30 or (r == 31 and ok31 ~= \"\" or (rt ~= \"w\" and rt ~= \"x\")) then\r\n      if not parse_reg_type then\r\n\tparse_reg_type = rt\r\n      elseif parse_reg_type ~= rt then\r\n\twerror(\"register size mismatch\")\r\n      end\r\n      return r, tp\r\n    end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_reg_base(expr)\r\n  if expr == \"sp\" then return 0x3e0 end\r\n  local base, tp = parse_reg(expr)\r\n  if parse_reg_type ~= \"x\" then werror(\"bad register type\") end\r\n  parse_reg_type = false\r\n  return shl(base, 5), tp\r\nend\r\n\r\nlocal parse_ctx = {}\r\n\r\nlocal loadenv = setfenv and function(s)\r\n  local code = loadstring(s, \"\")\r\n  if code then setfenv(code, parse_ctx) end\r\n  return code\r\nend or function(s)\r\n  return load(s, \"\", nil, parse_ctx)\r\nend\r\n\r\n-- Try to parse simple arithmetic, too, since some basic ops are aliases.\r\nlocal function parse_number(n)\r\n  local x = tonumber(n)\r\n  if x then return x end\r\n  local code = loadenv(\"return \"..n)\r\n  if code then\r\n    local ok, y = pcall(code)\r\n    if ok then return y end\r\n  end\r\n  return nil\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = parse_number(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm12(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = parse_number(imm)\r\n  if n then\r\n    if shr(n, 12) == 0 then\r\n      return shl(n, 10)\r\n    elseif band(n, 0xff000fff) == 0 then\r\n      return shr(n, 2) + 0x00400000\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM12\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm13(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = parse_number(imm)\r\n  local r64 = parse_reg_type == \"x\"\r\n  if n and n % 1 == 0 and n >= 0 and n <= 0xffffffff then\r\n    local inv = false\r\n    if band(n, 1) == 1 then n = bit.bnot(n); inv = true end\r\n    local t = {}\r\n    for i=1,32 do t[i] = band(n, 1); n = shr(n, 1) end\r\n    local b = table.concat(t)\r\n    b = b..(r64 and (inv and \"1\" or \"0\"):rep(32) or b)\r\n    local p0, p1, p0a, p1a = b:match(\"^(0+)(1+)(0*)(1*)\")\r\n    if p0 then\r\n      local w = p1a == \"\" and (r64 and 64 or 32) or #p1+#p0a\r\n      if band(w, w-1) == 0 and b == b:sub(1, w):rep(64/w) then\r\n\tlocal s = band(-2*w, 0x3f) - 1\r\n\tif w == 64 then s = s + 0x1000 end\r\n\tif inv then\r\n\t  return shl(w-#p1-#p0, 16) + shl(s+w-#p1, 10)\r\n\telse\r\n\t  return shl(w-#p0, 16) + shl(s+#p1, 10)\r\n\tend\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif r64 then\r\n    waction(\"IMM13X\", 0, format(\"(unsigned int)(%s)\", imm))\r\n    actargs[#actargs+1] = format(\"(unsigned int)((unsigned long long)(%s)>>32)\", imm)\r\n    return 0\r\n  else\r\n    waction(\"IMM13W\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm6(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = parse_number(imm)\r\n  if n then\r\n    if n >= 0 and n <= 63 then\r\n      return shl(band(n, 0x1f), 19) + (n >= 32 and 0x80000000 or 0)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMM6\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_imm_load(imm, scale)\r\n  local n = parse_number(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n and m >= 0 and m < 0x1000 then\r\n      return shl(m, 10) + 0x01000000 -- Scaled, unsigned 12 bit offset.\r\n    elseif n >= -256 and n < 256 then\r\n      return shl(band(n, 511), 12) -- Unscaled, signed 9 bit offset.\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    waction(\"IMML\", 0, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_fpimm(imm)\r\n  imm = match(imm, \"^#(.*)$\")\r\n  if not imm then werror(\"expected immediate operand\") end\r\n  local n = parse_number(imm)\r\n  if n then\r\n    local m, e = math.frexp(n)\r\n    local s, e2 = 0, band(e-2, 7)\r\n    if m < 0 then m = -m; s = 0x00100000 end\r\n    m = m*32-16\r\n    if m % 1 == 0 and m >= 0 and m <= 15 and sar(shl(e2, 29), 29)+2 == e then\r\n      return s + shl(e2, 17) + shl(m, 13)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  else\r\n    werror(\"NYI fpimm action\")\r\n  end\r\nend\r\n\r\nlocal function parse_shift(expr)\r\n  local s, s2 = match(expr, \"^(%S+)%s*(.*)$\")\r\n  s = map_shift[s]\r\n  if not s then werror(\"expected shift operand\") end\r\n  return parse_imm(s2, 6, 10, 0, false) + shl(s, 22)\r\nend\r\n\r\nlocal function parse_lslx16(expr)\r\n  local n = match(expr, \"^lsl%s*#(%d+)$\")\r\n  n = tonumber(n)\r\n  if not n then werror(\"expected shift operand\") end\r\n  if band(n, parse_reg_type == \"x\" and 0xffffffcf or 0xffffffef) ~= 0 then\r\n    werror(\"bad shift amount\")\r\n  end\r\n  return shl(n, 17)\r\nend\r\n\r\nlocal function parse_extend(expr)\r\n  local s, s2 = match(expr, \"^(%S+)%s*(.*)$\")\r\n  if s == \"lsl\" then\r\n    s = parse_reg_type == \"x\" and 3 or 2\r\n  else\r\n    s = map_extend[s]\r\n  end\r\n  if not s then werror(\"expected extend operand\") end\r\n  return (s2 == \"\" and 0 or parse_imm(s2, 3, 10, 0, false)) + shl(s, 13)\r\nend\r\n\r\nlocal function parse_cond(expr, inv)\r\n  local c = map_cond[expr]\r\n  if not c then werror(\"expected condition operand\") end\r\n  return shl(bit.bxor(c, inv), 12)\r\nend\r\n\r\nlocal function parse_load(params, nparams, n, op)\r\n  if params[n+2] then werror(\"too many operands\") end\r\n  local pn, p2 = params[n], params[n+1]\r\n  local p1, wb = match(pn, \"^%[%s*(.-)%s*%](!?)$\")\r\n  if not p1 then\r\n    if not p2 then\r\n      local reg, tailr = match(pn, \"^([%w_:]+)%s*(.*)$\")\r\n      if reg and tailr ~= \"\" then\r\n\tlocal base, tp = parse_reg_base(reg)\r\n\tif tp then\r\n\t  waction(\"IMML\", 0, format(tp.ctypefmt, tailr))\r\n\t  return op + base\r\n\tend\r\n      end\r\n    end\r\n    werror(\"expected address operand\")\r\n  end\r\n  local scale = shr(op, 30)\r\n  if p2 then\r\n    if wb == \"!\" then werror(\"bad use of '!'\") end\r\n    op = op + parse_reg_base(p1) + parse_imm(p2, 9, 12, 0, true) + 0x400\r\n  elseif wb == \"!\" then\r\n    local p1a, p2a = match(p1, \"^([^,%s]*)%s*,%s*(.*)$\")\r\n    if not p1a then werror(\"bad use of '!'\") end\r\n    op = op + parse_reg_base(p1a) + parse_imm(p2a, 9, 12, 0, true) + 0xc00\r\n  else\r\n    local p1a, p2a = match(p1, \"^([^,%s]*)%s*(.*)$\")\r\n    op = op + parse_reg_base(p1a)\r\n    if p2a ~= \"\" then\r\n      local imm = match(p2a, \"^,%s*#(.*)$\")\r\n      if imm then\r\n\top = op + parse_imm_load(imm, scale)\r\n      else\r\n\tlocal p2b, p3b, p3s = match(p2a, \"^,%s*([^,%s]*)%s*,?%s*(%S*)%s*(.*)$\")\r\n\top = op + shl(parse_reg(p2b), 16) + 0x00200800\r\n\tif parse_reg_type ~= \"x\" and parse_reg_type ~= \"w\" then\r\n\t  werror(\"bad index register type\")\r\n\tend\r\n\tif p3b == \"\" then\r\n\t  if parse_reg_type ~= \"x\" then werror(\"bad index register type\") end\r\n\t  op = op + 0x6000\r\n\telse\r\n\t  if p3s == \"\" or p3s == \"#0\" then\r\n\t  elseif p3s == \"#\"..scale then\r\n\t    op = op + 0x1000\r\n\t  else\r\n\t    werror(\"bad scale\")\r\n\t  end\r\n\t  if parse_reg_type == \"x\" then\r\n\t    if p3b == \"lsl\" and p3s ~= \"\" then op = op + 0x6000\r\n\t    elseif p3b == \"sxtx\" then op = op + 0xe000\r\n\t    else\r\n\t      werror(\"bad extend/shift specifier\")\r\n\t    end\r\n\t  else\r\n\t    if p3b == \"uxtw\" then op = op + 0x4000\r\n\t    elseif p3b == \"sxtw\" then op = op + 0xc000\r\n\t    else\r\n\t      werror(\"bad extend/shift specifier\")\r\n\t    end\r\n\t  end\r\n\tend\r\n      end\r\n    else\r\n      if wb == \"!\" then werror(\"bad use of '!'\") end\r\n      op = op + 0x01000000\r\n    end\r\n  end\r\n  return op\r\nend\r\n\r\nlocal function parse_load_pair(params, nparams, n, op)\r\n  if params[n+2] then werror(\"too many operands\") end\r\n  local pn, p2 = params[n], params[n+1]\r\n  local scale = shr(op, 30) == 0 and 2 or 3\r\n  local p1, wb = match(pn, \"^%[%s*(.-)%s*%](!?)$\")\r\n  if not p1 then\r\n    if not p2 then\r\n      local reg, tailr = match(pn, \"^([%w_:]+)%s*(.*)$\")\r\n      if reg and tailr ~= \"\" then\r\n\tlocal base, tp = parse_reg_base(reg)\r\n\tif tp then\r\n\t  waction(\"IMM\", 32768+7*32+15+scale*1024, format(tp.ctypefmt, tailr))\r\n\t  return op + base + 0x01000000\r\n\tend\r\n      end\r\n    end\r\n    werror(\"expected address operand\")\r\n  end\r\n  if p2 then\r\n    if wb == \"!\" then werror(\"bad use of '!'\") end\r\n    op = op + 0x00800000\r\n  else\r\n    local p1a, p2a = match(p1, \"^([^,%s]*)%s*,%s*(.*)$\")\r\n    if p1a then p1, p2 = p1a, p2a else p2 = \"#0\" end\r\n    op = op + (wb == \"!\" and 0x01800000 or 0x01000000)\r\n  end\r\n  return op + parse_reg_base(p1) + parse_imm(p2, 7, 15, scale, true)\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\nlocal function branch_type(op)\r\n  if band(op, 0x7c000000) == 0x14000000 then return 0 -- B, BL\r\n  elseif shr(op, 24) == 0x54 or band(op, 0x7e000000) == 0x34000000 or\r\n\t band(op, 0x3b000000) == 0x18000000 then\r\n    return 0x800 -- B.cond, CBZ, CBNZ, LDR* literal\r\n  elseif band(op, 0x7e000000) == 0x36000000 then return 0x1000 -- TBZ, TBNZ\r\n  elseif band(op, 0x9f000000) == 0x10000000 then return 0x2000 -- ADR\r\n  elseif band(op, 0x9f000000) == band(0x90000000) then return 0x3000 -- ADRP\r\n  else\r\n    assert(false, \"unknown branch type\")\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_op, op_template\r\n\r\nlocal function op_alias(opname, f)\r\n  return function(params, nparams)\r\n    if not params then return \"-> \"..opname:sub(1, -3) end\r\n    f(params, nparams)\r\n    op_template(params, map_op[opname], nparams)\r\n  end\r\nend\r\n\r\nlocal function alias_bfx(p)\r\n  p[4] = \"#(\"..p[3]:sub(2)..\")+(\"..p[4]:sub(2)..\")-1\"\r\nend\r\n\r\nlocal function alias_bfiz(p)\r\n  parse_reg(p[1])\r\n  if parse_reg_type == \"w\" then\r\n    p[3] = \"#-(\"..p[3]:sub(2)..\")%32\"\r\n    p[4] = \"#(\"..p[4]:sub(2)..\")-1\"\r\n  else\r\n    p[3] = \"#-(\"..p[3]:sub(2)..\")%64\"\r\n    p[4] = \"#(\"..p[4]:sub(2)..\")-1\"\r\n  end\r\nend\r\n\r\nlocal alias_lslimm = op_alias(\"ubfm_4\", function(p)\r\n  parse_reg(p[1])\r\n  local sh = p[3]:sub(2)\r\n  if parse_reg_type == \"w\" then\r\n    p[3] = \"#-(\"..sh..\")%32\"\r\n    p[4] = \"#31-(\"..sh..\")\"\r\n  else\r\n    p[3] = \"#-(\"..sh..\")%64\"\r\n    p[4] = \"#63-(\"..sh..\")\"\r\n  end\r\nend)\r\n\r\n-- Template strings for ARM instructions.\r\nmap_op = {\r\n  -- Basic data processing instructions.\r\n  add_3  = \"0b000000DNMg|11000000pDpNIg|8b206000pDpNMx\",\r\n  add_4  = \"0b000000DNMSg|0b200000DNMXg|8b200000pDpNMXx|8b200000pDpNxMwX\",\r\n  adds_3 = \"2b000000DNMg|31000000DpNIg|ab206000DpNMx\",\r\n  adds_4 = \"2b000000DNMSg|2b200000DNMXg|ab200000DpNMXx|ab200000DpNxMwX\",\r\n  cmn_2  = \"2b00001fNMg|3100001fpNIg|ab20601fpNMx\",\r\n  cmn_3  = \"2b00001fNMSg|2b20001fNMXg|ab20001fpNMXx|ab20001fpNxMwX\",\r\n\r\n  sub_3  = \"4b000000DNMg|51000000pDpNIg|cb206000pDpNMx\",\r\n  sub_4  = \"4b000000DNMSg|4b200000DNMXg|cb200000pDpNMXx|cb200000pDpNxMwX\",\r\n  subs_3 = \"6b000000DNMg|71000000DpNIg|eb206000DpNMx\",\r\n  subs_4 = \"6b000000DNMSg|6b200000DNMXg|eb200000DpNMXx|eb200000DpNxMwX\",\r\n  cmp_2  = \"6b00001fNMg|7100001fpNIg|eb20601fpNMx\",\r\n  cmp_3  = \"6b00001fNMSg|6b20001fNMXg|eb20001fpNMXx|eb20001fpNxMwX\",\r\n\r\n  neg_2  = \"4b0003e0DMg\",\r\n  neg_3  = \"4b0003e0DMSg\",\r\n  negs_2 = \"6b0003e0DMg\",\r\n  negs_3 = \"6b0003e0DMSg\",\r\n\r\n  adc_3  = \"1a000000DNMg\",\r\n  adcs_3 = \"3a000000DNMg\",\r\n  sbc_3  = \"5a000000DNMg\",\r\n  sbcs_3 = \"7a000000DNMg\",\r\n  ngc_2  = \"5a0003e0DMg\",\r\n  ngcs_2 = \"7a0003e0DMg\",\r\n\r\n  and_3  = \"0a000000DNMg|12000000pDNig\",\r\n  and_4  = \"0a000000DNMSg\",\r\n  orr_3  = \"2a000000DNMg|32000000pDNig\",\r\n  orr_4  = \"2a000000DNMSg\",\r\n  eor_3  = \"4a000000DNMg|52000000pDNig\",\r\n  eor_4  = \"4a000000DNMSg\",\r\n  ands_3 = \"6a000000DNMg|72000000DNig\",\r\n  ands_4 = \"6a000000DNMSg\",\r\n  tst_2  = \"6a00001fNMg|7200001fNig\",\r\n  tst_3  = \"6a00001fNMSg\",\r\n\r\n  bic_3  = \"0a200000DNMg\",\r\n  bic_4  = \"0a200000DNMSg\",\r\n  orn_3  = \"2a200000DNMg\",\r\n  orn_4  = \"2a200000DNMSg\",\r\n  eon_3  = \"4a200000DNMg\",\r\n  eon_4  = \"4a200000DNMSg\",\r\n  bics_3 = \"6a200000DNMg\",\r\n  bics_4 = \"6a200000DNMSg\",\r\n\r\n  movn_2 = \"12800000DWg\",\r\n  movn_3 = \"12800000DWRg\",\r\n  movz_2 = \"52800000DWg\",\r\n  movz_3 = \"52800000DWRg\",\r\n  movk_2 = \"72800000DWg\",\r\n  movk_3 = \"72800000DWRg\",\r\n\r\n  -- TODO: this doesn't cover all valid immediates for mov reg, #imm.\r\n  mov_2  = \"2a0003e0DMg|52800000DW|320003e0pDig|11000000pDpNg\",\r\n  mov_3  = \"2a0003e0DMSg\",\r\n  mvn_2  = \"2a2003e0DMg\",\r\n  mvn_3  = \"2a2003e0DMSg\",\r\n\r\n  adr_2  = \"10000000DBx\",\r\n  adrp_2 = \"90000000DBx\",\r\n\r\n  csel_4  = \"1a800000DNMCg\",\r\n  csinc_4 = \"1a800400DNMCg\",\r\n  csinv_4 = \"5a800000DNMCg\",\r\n  csneg_4 = \"5a800400DNMCg\",\r\n  cset_2  = \"1a9f07e0Dcg\",\r\n  csetm_2 = \"5a9f03e0Dcg\",\r\n  cinc_3  = \"1a800400DNmcg\",\r\n  cinv_3  = \"5a800000DNmcg\",\r\n  cneg_3  = \"5a800400DNmcg\",\r\n\r\n  ccmn_4 = \"3a400000NMVCg|3a400800N5VCg\",\r\n  ccmp_4 = \"7a400000NMVCg|7a400800N5VCg\",\r\n\r\n  madd_4 = \"1b000000DNMAg\",\r\n  msub_4 = \"1b008000DNMAg\",\r\n  mul_3  = \"1b007c00DNMg\",\r\n  mneg_3 = \"1b00fc00DNMg\",\r\n\r\n  smaddl_4 = \"9b200000DxNMwAx\",\r\n  smsubl_4 = \"9b208000DxNMwAx\",\r\n  smull_3  = \"9b207c00DxNMw\",\r\n  smnegl_3 = \"9b20fc00DxNMw\",\r\n  smulh_3  = \"9b407c00DNMx\",\r\n  umaddl_4 = \"9ba00000DxNMwAx\",\r\n  umsubl_4 = \"9ba08000DxNMwAx\",\r\n  umull_3  = \"9ba07c00DxNMw\",\r\n  umnegl_3 = \"9ba0fc00DxNMw\",\r\n  umulh_3  = \"9bc07c00DNMx\",\r\n\r\n  udiv_3 = \"1ac00800DNMg\",\r\n  sdiv_3 = \"1ac00c00DNMg\",\r\n\r\n  -- Bit operations.\r\n  sbfm_4 = \"13000000DN12w|93400000DN12x\",\r\n  bfm_4  = \"33000000DN12w|b3400000DN12x\",\r\n  ubfm_4 = \"53000000DN12w|d3400000DN12x\",\r\n  extr_4 = \"13800000DNM2w|93c00000DNM2x\",\r\n\r\n  sxtb_2 = \"13001c00DNw|93401c00DNx\",\r\n  sxth_2 = \"13003c00DNw|93403c00DNx\",\r\n  sxtw_2 = \"93407c00DxNw\",\r\n  uxtb_2 = \"53001c00DNw\",\r\n  uxth_2 = \"53003c00DNw\",\r\n\r\n  sbfx_4  = op_alias(\"sbfm_4\", alias_bfx),\r\n  bfxil_4 = op_alias(\"bfm_4\", alias_bfx),\r\n  ubfx_4  = op_alias(\"ubfm_4\", alias_bfx),\r\n  sbfiz_4 = op_alias(\"sbfm_4\", alias_bfiz),\r\n  bfi_4   = op_alias(\"bfm_4\", alias_bfiz),\r\n  ubfiz_4 = op_alias(\"ubfm_4\", alias_bfiz),\r\n\r\n  lsl_3  = function(params, nparams)\r\n    if params and params[3]:byte() == 35 then\r\n      return alias_lslimm(params, nparams)\r\n    else\r\n      return op_template(params, \"1ac02000DNMg\", nparams)\r\n    end\r\n  end,\r\n  lsr_3  = \"1ac02400DNMg|53007c00DN1w|d340fc00DN1x\",\r\n  asr_3  = \"1ac02800DNMg|13007c00DN1w|9340fc00DN1x\",\r\n  ror_3  = \"1ac02c00DNMg|13800000DNm2w|93c00000DNm2x\",\r\n\r\n  clz_2   = \"5ac01000DNg\",\r\n  cls_2   = \"5ac01400DNg\",\r\n  rbit_2  = \"5ac00000DNg\",\r\n  rev_2   = \"5ac00800DNw|dac00c00DNx\",\r\n  rev16_2 = \"5ac00400DNg\",\r\n  rev32_2 = \"dac00800DNx\",\r\n\r\n  -- Loads and stores.\r\n  [\"strb_*\"]  = \"38000000DwL\",\r\n  [\"ldrb_*\"]  = \"38400000DwL\",\r\n  [\"ldrsb_*\"] = \"38c00000DwL|38800000DxL\",\r\n  [\"strh_*\"]  = \"78000000DwL\",\r\n  [\"ldrh_*\"]  = \"78400000DwL\",\r\n  [\"ldrsh_*\"] = \"78c00000DwL|78800000DxL\",\r\n  [\"str_*\"]   = \"b8000000DwL|f8000000DxL|bc000000DsL|fc000000DdL\",\r\n  [\"ldr_*\"]   = \"18000000DwB|58000000DxB|1c000000DsB|5c000000DdB|b8400000DwL|f8400000DxL|bc400000DsL|fc400000DdL\",\r\n  [\"ldrsw_*\"] = \"98000000DxB|b8800000DxL\",\r\n  -- NOTE: ldur etc. are handled by ldr et al.\r\n\r\n  [\"stp_*\"]   = \"28000000DAwP|a8000000DAxP|2c000000DAsP|6c000000DAdP\",\r\n  [\"ldp_*\"]   = \"28400000DAwP|a8400000DAxP|2c400000DAsP|6c400000DAdP\",\r\n  [\"ldpsw_*\"] = \"68400000DAxP\",\r\n\r\n  -- Branches.\r\n  b_1    = \"14000000B\",\r\n  bl_1   = \"94000000B\",\r\n  blr_1  = \"d63f0000Nx\",\r\n  br_1   = \"d61f0000Nx\",\r\n  ret_0  = \"d65f03c0\",\r\n  ret_1  = \"d65f0000Nx\",\r\n  -- b.cond is added below.\r\n  cbz_2  = \"34000000DBg\",\r\n  cbnz_2 = \"35000000DBg\",\r\n  tbz_3  = \"36000000DTBw|36000000DTBx\",\r\n  tbnz_3 = \"37000000DTBw|37000000DTBx\",\r\n\r\n  -- Miscellaneous instructions.\r\n  -- TODO: hlt, hvc, smc, svc, eret, dcps[123], drps, mrs, msr\r\n  -- TODO: sys, sysl, ic, dc, at, tlbi\r\n  -- TODO: hint, yield, wfe, wfi, sev, sevl\r\n  -- TODO: clrex, dsb, dmb, isb\r\n  nop_0  = \"d503201f\",\r\n  brk_0  = \"d4200000\",\r\n  brk_1  = \"d4200000W\",\r\n\r\n  -- Floating point instructions.\r\n  fmov_2  = \"1e204000DNf|1e260000DwNs|1e270000DsNw|9e660000DxNd|9e670000DdNx|1e201000DFf\",\r\n  fabs_2  = \"1e20c000DNf\",\r\n  fneg_2  = \"1e214000DNf\",\r\n  fsqrt_2 = \"1e21c000DNf\",\r\n\r\n  fcvt_2  = \"1e22c000DdNs|1e624000DsNd\",\r\n\r\n  -- TODO: half-precision and fixed-point conversions.\r\n  fcvtas_2 = \"1e240000DwNs|9e240000DxNs|1e640000DwNd|9e640000DxNd\",\r\n  fcvtau_2 = \"1e250000DwNs|9e250000DxNs|1e650000DwNd|9e650000DxNd\",\r\n  fcvtms_2 = \"1e300000DwNs|9e300000DxNs|1e700000DwNd|9e700000DxNd\",\r\n  fcvtmu_2 = \"1e310000DwNs|9e310000DxNs|1e710000DwNd|9e710000DxNd\",\r\n  fcvtns_2 = \"1e200000DwNs|9e200000DxNs|1e600000DwNd|9e600000DxNd\",\r\n  fcvtnu_2 = \"1e210000DwNs|9e210000DxNs|1e610000DwNd|9e610000DxNd\",\r\n  fcvtps_2 = \"1e280000DwNs|9e280000DxNs|1e680000DwNd|9e680000DxNd\",\r\n  fcvtpu_2 = \"1e290000DwNs|9e290000DxNs|1e690000DwNd|9e690000DxNd\",\r\n  fcvtzs_2 = \"1e380000DwNs|9e380000DxNs|1e780000DwNd|9e780000DxNd\",\r\n  fcvtzu_2 = \"1e390000DwNs|9e390000DxNs|1e790000DwNd|9e790000DxNd\",\r\n\r\n  scvtf_2  = \"1e220000DsNw|9e220000DsNx|1e620000DdNw|9e620000DdNx\",\r\n  ucvtf_2  = \"1e230000DsNw|9e230000DsNx|1e630000DdNw|9e630000DdNx\",\r\n\r\n  frintn_2 = \"1e244000DNf\",\r\n  frintp_2 = \"1e24c000DNf\",\r\n  frintm_2 = \"1e254000DNf\",\r\n  frintz_2 = \"1e25c000DNf\",\r\n  frinta_2 = \"1e264000DNf\",\r\n  frintx_2 = \"1e274000DNf\",\r\n  frinti_2 = \"1e27c000DNf\",\r\n\r\n  fadd_3   = \"1e202800DNMf\",\r\n  fsub_3   = \"1e203800DNMf\",\r\n  fmul_3   = \"1e200800DNMf\",\r\n  fnmul_3  = \"1e208800DNMf\",\r\n  fdiv_3   = \"1e201800DNMf\",\r\n\r\n  fmadd_4  = \"1f000000DNMAf\",\r\n  fmsub_4  = \"1f008000DNMAf\",\r\n  fnmadd_4 = \"1f200000DNMAf\",\r\n  fnmsub_4 = \"1f208000DNMAf\",\r\n\r\n  fmax_3   = \"1e204800DNMf\",\r\n  fmaxnm_3 = \"1e206800DNMf\",\r\n  fmin_3   = \"1e205800DNMf\",\r\n  fminnm_3 = \"1e207800DNMf\",\r\n\r\n  fcmp_2   = \"1e202000NMf|1e202008NZf\",\r\n  fcmpe_2  = \"1e202010NMf|1e202018NZf\",\r\n\r\n  fccmp_4  = \"1e200400NMVCf\",\r\n  fccmpe_4 = \"1e200410NMVCf\",\r\n\r\n  fcsel_4  = \"1e200c00DNMCf\",\r\n\r\n  -- TODO: crc32*, aes*, sha*, pmull\r\n  -- TODO: SIMD instructions.\r\n}\r\n\r\nfor cond,c in pairs(map_cond) do\r\n  map_op[\"b\"..cond..\"_1\"] = tohex(0x54000000+c)..\"B\"\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nlocal function parse_template(params, template, nparams, pos)\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n = 1\r\n  local rtt = {}\r\n\r\n  parse_reg_type = false\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    local q = params[n]\r\n    if p == \"D\" then\r\n      op = op + parse_reg(q); n = n + 1\r\n    elseif p == \"N\" then\r\n      op = op + shl(parse_reg(q), 5); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + shl(parse_reg(q), 16); n = n + 1\r\n    elseif p == \"A\" then\r\n      op = op + shl(parse_reg(q), 10); n = n + 1\r\n    elseif p == \"m\" then\r\n      op = op + shl(parse_reg(params[n-1]), 16)\r\n\r\n    elseif p == \"p\" then\r\n      if q == \"sp\" then params[n] = \"@x31\" end\r\n    elseif p == \"g\" then\r\n      if parse_reg_type == \"x\" then\r\n\top = op + 0x80000000\r\n      elseif parse_reg_type ~= \"w\" then\r\n\twerror(\"bad register type\")\r\n      end\r\n      parse_reg_type = false\r\n    elseif p == \"f\" then\r\n      if parse_reg_type == \"d\" then\r\n\top = op + 0x00400000\r\n      elseif parse_reg_type ~= \"s\" then\r\n\twerror(\"bad register type\")\r\n      end\r\n      parse_reg_type = false\r\n    elseif p == \"x\" or p == \"w\" or p == \"d\" or p == \"s\" then\r\n      if parse_reg_type ~= p then\r\n\twerror(\"register size mismatch\")\r\n      end\r\n      parse_reg_type = false\r\n\r\n    elseif p == \"L\" then\r\n      op = parse_load(params, nparams, n, op)\r\n    elseif p == \"P\" then\r\n      op = parse_load_pair(params, nparams, n, op)\r\n\r\n    elseif p == \"B\" then\r\n      local mode, v, s = parse_label(q, false); n = n + 1\r\n      local m = branch_type(op)\r\n      waction(\"REL_\"..mode, v+m, s, 1)\r\n\r\n    elseif p == \"I\" then\r\n      op = op + parse_imm12(q); n = n + 1\r\n    elseif p == \"i\" then\r\n      op = op + parse_imm13(q); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_imm(q, 16, 5, 0, false); n = n + 1\r\n    elseif p == \"T\" then\r\n      op = op + parse_imm6(q); n = n + 1\r\n    elseif p == \"1\" then\r\n      op = op + parse_imm(q, 6, 16, 0, false); n = n + 1\r\n    elseif p == \"2\" then\r\n      op = op + parse_imm(q, 6, 10, 0, false); n = n + 1\r\n    elseif p == \"5\" then\r\n      op = op + parse_imm(q, 5, 16, 0, false); n = n + 1\r\n    elseif p == \"V\" then\r\n      op = op + parse_imm(q, 4, 0, 0, false); n = n + 1\r\n    elseif p == \"F\" then\r\n      op = op + parse_fpimm(q); n = n + 1\r\n    elseif p == \"Z\" then\r\n      if q ~= \"#0\" and q ~= \"#0.0\" then werror(\"expected zero immediate\") end\r\n      n = n + 1\r\n\r\n    elseif p == \"S\" then\r\n      op = op + parse_shift(q); n = n + 1\r\n    elseif p == \"X\" then\r\n      op = op + parse_extend(q); n = n + 1\r\n    elseif p == \"R\" then\r\n      op = op + parse_lslx16(q); n = n + 1\r\n    elseif p == \"C\" then\r\n      op = op + parse_cond(q, 0); n = n + 1\r\n    elseif p == \"c\" then\r\n      op = op + parse_cond(q, 1); n = n + 1\r\n\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\nfunction op_template(params, template, nparams)\r\n  if not params then return template:gsub(\"%x%x%x%x%x%x%x%x\", \"\") end\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 3 positions.\r\n  if secpos+3 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n  local lpos, apos, spos = #actlist, #actargs, secpos\r\n\r\n  local ok, err\r\n  for t in gmatch(template, \"[^|]+\") do\r\n    ok, err = pcall(parse_template, params, t, nparams, pos)\r\n    if ok then return end\r\n    secpos = spos\r\n    actlist[lpos+1] = nil\r\n    actlist[lpos+2] = nil\r\n    actlist[lpos+3] = nil\r\n    actargs[apos+1] = nil\r\n    actargs[apos+2] = nil\r\n    actargs[apos+3] = nil\r\n  end\r\n  error(err, 0)\r\nend\r\n\r\nmap_op[\".template__\"] = op_template\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_mips.h",
    "content": "/*\r\n** DynASM MIPS encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"mips\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC, DASM_IMM,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16) - 0xff00;\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n#endif\r\n\tn >>= ((ins>>10)&31);\r\n#ifdef DASM_CHECKS\r\n\tif (ins & 0x8000)\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16) - 0xff00;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16) - 0xff00;\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1);\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n);\r\n\t  if (ins & 2048)\r\n\t    n = n - (int)((char *)cp - base);\r\n\t  else\r\n\t    n = (n + (int)base) & 0x0fffffff;\r\n\tpatchrel:\r\n\t  CK((n & 3) == 0 &&\r\n\t     ((n + ((ins & 2048) ? 0x00020000 : 0)) >>\r\n\t       ((ins & 2048) ? 18 : 28)) == 0, RANGE_REL);\r\n\t  cp[-1] |= ((n>>2) & ((ins & 2048) ? 0x0000ffff: 0x03ffffff));\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_mips.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM MIPS module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"mips\",\r\n  description =\t\"DynASM MIPS module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2012-01-23\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable = assert, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch = _s.match, _s.gmatch\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, sar, tohex = bit.band, bit.lshift, bit.arshift, bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\",\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(0xff000000 + w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n >= 0xff000000 then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = { sp=\"r29\", ra=\"r31\" } -- Ext. register name -> int. name.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  if s == \"r29\" then return \"sp\"\r\n  elseif s == \"r31\" then return \"ra\" end\r\n  return s\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for MIPS instructions.\r\nlocal map_op = {\r\n  -- First-level opcodes.\r\n  j_1 =\t\t\"08000000J\",\r\n  jal_1 =\t\"0c000000J\",\r\n  b_1 =\t\t\"10000000B\",\r\n  beqz_2 =\t\"10000000SB\",\r\n  beq_3 =\t\"10000000STB\",\r\n  bnez_2 =\t\"14000000SB\",\r\n  bne_3 =\t\"14000000STB\",\r\n  blez_2 =\t\"18000000SB\",\r\n  bgtz_2 =\t\"1c000000SB\",\r\n  addi_3 =\t\"20000000TSI\",\r\n  li_2 =\t\"24000000TI\",\r\n  addiu_3 =\t\"24000000TSI\",\r\n  slti_3 =\t\"28000000TSI\",\r\n  sltiu_3 =\t\"2c000000TSI\",\r\n  andi_3 =\t\"30000000TSU\",\r\n  lu_2 =\t\"34000000TU\",\r\n  ori_3 =\t\"34000000TSU\",\r\n  xori_3 =\t\"38000000TSU\",\r\n  lui_2 =\t\"3c000000TU\",\r\n  beqzl_2 =\t\"50000000SB\",\r\n  beql_3 =\t\"50000000STB\",\r\n  bnezl_2 =\t\"54000000SB\",\r\n  bnel_3 =\t\"54000000STB\",\r\n  blezl_2 =\t\"58000000SB\",\r\n  bgtzl_2 =\t\"5c000000SB\",\r\n  lb_2 =\t\"80000000TO\",\r\n  lh_2 =\t\"84000000TO\",\r\n  lwl_2 =\t\"88000000TO\",\r\n  lw_2 =\t\"8c000000TO\",\r\n  lbu_2 =\t\"90000000TO\",\r\n  lhu_2 =\t\"94000000TO\",\r\n  lwr_2 =\t\"98000000TO\",\r\n  sb_2 =\t\"a0000000TO\",\r\n  sh_2 =\t\"a4000000TO\",\r\n  swl_2 =\t\"a8000000TO\",\r\n  sw_2 =\t\"ac000000TO\",\r\n  swr_2 =\t\"b8000000TO\",\r\n  cache_2 =\t\"bc000000NO\",\r\n  ll_2 =\t\"c0000000TO\",\r\n  lwc1_2 =\t\"c4000000HO\",\r\n  pref_2 =\t\"cc000000NO\",\r\n  ldc1_2 =\t\"d4000000HO\",\r\n  sc_2 =\t\"e0000000TO\",\r\n  swc1_2 =\t\"e4000000HO\",\r\n  sdc1_2 =\t\"f4000000HO\",\r\n\r\n  -- Opcode SPECIAL.\r\n  nop_0 =\t\"00000000\",\r\n  sll_3 =\t\"00000000DTA\",\r\n  movf_2 =\t\"00000001DS\",\r\n  movf_3 =\t\"00000001DSC\",\r\n  movt_2 =\t\"00010001DS\",\r\n  movt_3 =\t\"00010001DSC\",\r\n  srl_3 =\t\"00000002DTA\",\r\n  rotr_3 =\t\"00200002DTA\",\r\n  sra_3 =\t\"00000003DTA\",\r\n  sllv_3 =\t\"00000004DTS\",\r\n  srlv_3 =\t\"00000006DTS\",\r\n  rotrv_3 =\t\"00000046DTS\",\r\n  srav_3 =\t\"00000007DTS\",\r\n  jr_1 =\t\"00000008S\",\r\n  jalr_1 =\t\"0000f809S\",\r\n  jalr_2 =\t\"00000009DS\",\r\n  movz_3 =\t\"0000000aDST\",\r\n  movn_3 =\t\"0000000bDST\",\r\n  syscall_0 =\t\"0000000c\",\r\n  syscall_1 =\t\"0000000cY\",\r\n  break_0 =\t\"0000000d\",\r\n  break_1 =\t\"0000000dY\",\r\n  sync_0 =\t\"0000000f\",\r\n  mfhi_1 =\t\"00000010D\",\r\n  mthi_1 =\t\"00000011S\",\r\n  mflo_1 =\t\"00000012D\",\r\n  mtlo_1 =\t\"00000013S\",\r\n  mult_2 =\t\"00000018ST\",\r\n  multu_2 =\t\"00000019ST\",\r\n  div_2 =\t\"0000001aST\",\r\n  divu_2 =\t\"0000001bST\",\r\n  add_3 =\t\"00000020DST\",\r\n  move_2 =\t\"00000021DS\",\r\n  addu_3 =\t\"00000021DST\",\r\n  sub_3 =\t\"00000022DST\",\r\n  negu_2 =\t\"00000023DT\",\r\n  subu_3 =\t\"00000023DST\",\r\n  and_3 =\t\"00000024DST\",\r\n  or_3 =\t\"00000025DST\",\r\n  xor_3 =\t\"00000026DST\",\r\n  not_2 =\t\"00000027DS\",\r\n  nor_3 =\t\"00000027DST\",\r\n  slt_3 =\t\"0000002aDST\",\r\n  sltu_3 =\t\"0000002bDST\",\r\n  tge_2 =\t\"00000030ST\",\r\n  tge_3 =\t\"00000030STZ\",\r\n  tgeu_2 =\t\"00000031ST\",\r\n  tgeu_3 =\t\"00000031STZ\",\r\n  tlt_2 =\t\"00000032ST\",\r\n  tlt_3 =\t\"00000032STZ\",\r\n  tltu_2 =\t\"00000033ST\",\r\n  tltu_3 =\t\"00000033STZ\",\r\n  teq_2 =\t\"00000034ST\",\r\n  teq_3 =\t\"00000034STZ\",\r\n  tne_2 =\t\"00000036ST\",\r\n  tne_3 =\t\"00000036STZ\",\r\n\r\n  -- Opcode REGIMM.\r\n  bltz_2 =\t\"04000000SB\",\r\n  bgez_2 =\t\"04010000SB\",\r\n  bltzl_2 =\t\"04020000SB\",\r\n  bgezl_2 =\t\"04030000SB\",\r\n  tgei_2 =\t\"04080000SI\",\r\n  tgeiu_2 =\t\"04090000SI\",\r\n  tlti_2 =\t\"040a0000SI\",\r\n  tltiu_2 =\t\"040b0000SI\",\r\n  teqi_2 =\t\"040c0000SI\",\r\n  tnei_2 =\t\"040e0000SI\",\r\n  bltzal_2 =\t\"04100000SB\",\r\n  bal_1 =\t\"04110000B\",\r\n  bgezal_2 =\t\"04110000SB\",\r\n  bltzall_2 =\t\"04120000SB\",\r\n  bgezall_2 =\t\"04130000SB\",\r\n  synci_1 =\t\"041f0000O\",\r\n\r\n  -- Opcode SPECIAL2.\r\n  madd_2 =\t\"70000000ST\",\r\n  maddu_2 =\t\"70000001ST\",\r\n  mul_3 =\t\"70000002DST\",\r\n  msub_2 =\t\"70000004ST\",\r\n  msubu_2 =\t\"70000005ST\",\r\n  clz_2 =\t\"70000020DS=\",\r\n  clo_2 =\t\"70000021DS=\",\r\n  sdbbp_0 =\t\"7000003f\",\r\n  sdbbp_1 =\t\"7000003fY\",\r\n\r\n  -- Opcode SPECIAL3.\r\n  ext_4 =\t\"7c000000TSAM\", -- Note: last arg is msbd = size-1\r\n  ins_4 =\t\"7c000004TSAM\", -- Note: last arg is msb = pos+size-1\r\n  wsbh_2 =\t\"7c0000a0DT\",\r\n  seb_2 =\t\"7c000420DT\",\r\n  seh_2 =\t\"7c000620DT\",\r\n  rdhwr_2 =\t\"7c00003bTD\",\r\n\r\n  -- Opcode COP0.\r\n  mfc0_2 =\t\"40000000TD\",\r\n  mfc0_3 =\t\"40000000TDW\",\r\n  mtc0_2 =\t\"40800000TD\",\r\n  mtc0_3 =\t\"40800000TDW\",\r\n  rdpgpr_2 =\t\"41400000DT\",\r\n  di_0 =\t\"41606000\",\r\n  di_1 =\t\"41606000T\",\r\n  ei_0 =\t\"41606020\",\r\n  ei_1 =\t\"41606020T\",\r\n  wrpgpr_2 =\t\"41c00000DT\",\r\n  tlbr_0 =\t\"42000001\",\r\n  tlbwi_0 =\t\"42000002\",\r\n  tlbwr_0 =\t\"42000006\",\r\n  tlbp_0 =\t\"42000008\",\r\n  eret_0 =\t\"42000018\",\r\n  deret_0 =\t\"4200001f\",\r\n  wait_0 =\t\"42000020\",\r\n\r\n  -- Opcode COP1.\r\n  mfc1_2 =\t\"44000000TG\",\r\n  cfc1_2 =\t\"44400000TG\",\r\n  mfhc1_2 =\t\"44600000TG\",\r\n  mtc1_2 =\t\"44800000TG\",\r\n  ctc1_2 =\t\"44c00000TG\",\r\n  mthc1_2 =\t\"44e00000TG\",\r\n\r\n  bc1f_1 =\t\"45000000B\",\r\n  bc1f_2 =\t\"45000000CB\",\r\n  bc1t_1 =\t\"45010000B\",\r\n  bc1t_2 =\t\"45010000CB\",\r\n  bc1fl_1 =\t\"45020000B\",\r\n  bc1fl_2 =\t\"45020000CB\",\r\n  bc1tl_1 =\t\"45030000B\",\r\n  bc1tl_2 =\t\"45030000CB\",\r\n\r\n  [\"add.s_3\"] =\t\t\"46000000FGH\",\r\n  [\"sub.s_3\"] =\t\t\"46000001FGH\",\r\n  [\"mul.s_3\"] =\t\t\"46000002FGH\",\r\n  [\"div.s_3\"] =\t\t\"46000003FGH\",\r\n  [\"sqrt.s_2\"] =\t\"46000004FG\",\r\n  [\"abs.s_2\"] =\t\t\"46000005FG\",\r\n  [\"mov.s_2\"] =\t\t\"46000006FG\",\r\n  [\"neg.s_2\"] =\t\t\"46000007FG\",\r\n  [\"round.l.s_2\"] =\t\"46000008FG\",\r\n  [\"trunc.l.s_2\"] =\t\"46000009FG\",\r\n  [\"ceil.l.s_2\"] =\t\"4600000aFG\",\r\n  [\"floor.l.s_2\"] =\t\"4600000bFG\",\r\n  [\"round.w.s_2\"] =\t\"4600000cFG\",\r\n  [\"trunc.w.s_2\"] =\t\"4600000dFG\",\r\n  [\"ceil.w.s_2\"] =\t\"4600000eFG\",\r\n  [\"floor.w.s_2\"] =\t\"4600000fFG\",\r\n  [\"movf.s_2\"] =\t\"46000011FG\",\r\n  [\"movf.s_3\"] =\t\"46000011FGC\",\r\n  [\"movt.s_2\"] =\t\"46010011FG\",\r\n  [\"movt.s_3\"] =\t\"46010011FGC\",\r\n  [\"movz.s_3\"] =\t\"46000012FGT\",\r\n  [\"movn.s_3\"] =\t\"46000013FGT\",\r\n  [\"recip.s_2\"] =\t\"46000015FG\",\r\n  [\"rsqrt.s_2\"] =\t\"46000016FG\",\r\n  [\"cvt.d.s_2\"] =\t\"46000021FG\",\r\n  [\"cvt.w.s_2\"] =\t\"46000024FG\",\r\n  [\"cvt.l.s_2\"] =\t\"46000025FG\",\r\n  [\"cvt.ps.s_3\"] =\t\"46000026FGH\",\r\n  [\"c.f.s_2\"] =\t\t\"46000030GH\",\r\n  [\"c.f.s_3\"] =\t\t\"46000030VGH\",\r\n  [\"c.un.s_2\"] =\t\"46000031GH\",\r\n  [\"c.un.s_3\"] =\t\"46000031VGH\",\r\n  [\"c.eq.s_2\"] =\t\"46000032GH\",\r\n  [\"c.eq.s_3\"] =\t\"46000032VGH\",\r\n  [\"c.ueq.s_2\"] =\t\"46000033GH\",\r\n  [\"c.ueq.s_3\"] =\t\"46000033VGH\",\r\n  [\"c.olt.s_2\"] =\t\"46000034GH\",\r\n  [\"c.olt.s_3\"] =\t\"46000034VGH\",\r\n  [\"c.ult.s_2\"] =\t\"46000035GH\",\r\n  [\"c.ult.s_3\"] =\t\"46000035VGH\",\r\n  [\"c.ole.s_2\"] =\t\"46000036GH\",\r\n  [\"c.ole.s_3\"] =\t\"46000036VGH\",\r\n  [\"c.ule.s_2\"] =\t\"46000037GH\",\r\n  [\"c.ule.s_3\"] =\t\"46000037VGH\",\r\n  [\"c.sf.s_2\"] =\t\"46000038GH\",\r\n  [\"c.sf.s_3\"] =\t\"46000038VGH\",\r\n  [\"c.ngle.s_2\"] =\t\"46000039GH\",\r\n  [\"c.ngle.s_3\"] =\t\"46000039VGH\",\r\n  [\"c.seq.s_2\"] =\t\"4600003aGH\",\r\n  [\"c.seq.s_3\"] =\t\"4600003aVGH\",\r\n  [\"c.ngl.s_2\"] =\t\"4600003bGH\",\r\n  [\"c.ngl.s_3\"] =\t\"4600003bVGH\",\r\n  [\"c.lt.s_2\"] =\t\"4600003cGH\",\r\n  [\"c.lt.s_3\"] =\t\"4600003cVGH\",\r\n  [\"c.nge.s_2\"] =\t\"4600003dGH\",\r\n  [\"c.nge.s_3\"] =\t\"4600003dVGH\",\r\n  [\"c.le.s_2\"] =\t\"4600003eGH\",\r\n  [\"c.le.s_3\"] =\t\"4600003eVGH\",\r\n  [\"c.ngt.s_2\"] =\t\"4600003fGH\",\r\n  [\"c.ngt.s_3\"] =\t\"4600003fVGH\",\r\n\r\n  [\"add.d_3\"] =\t\t\"46200000FGH\",\r\n  [\"sub.d_3\"] =\t\t\"46200001FGH\",\r\n  [\"mul.d_3\"] =\t\t\"46200002FGH\",\r\n  [\"div.d_3\"] =\t\t\"46200003FGH\",\r\n  [\"sqrt.d_2\"] =\t\"46200004FG\",\r\n  [\"abs.d_2\"] =\t\t\"46200005FG\",\r\n  [\"mov.d_2\"] =\t\t\"46200006FG\",\r\n  [\"neg.d_2\"] =\t\t\"46200007FG\",\r\n  [\"round.l.d_2\"] =\t\"46200008FG\",\r\n  [\"trunc.l.d_2\"] =\t\"46200009FG\",\r\n  [\"ceil.l.d_2\"] =\t\"4620000aFG\",\r\n  [\"floor.l.d_2\"] =\t\"4620000bFG\",\r\n  [\"round.w.d_2\"] =\t\"4620000cFG\",\r\n  [\"trunc.w.d_2\"] =\t\"4620000dFG\",\r\n  [\"ceil.w.d_2\"] =\t\"4620000eFG\",\r\n  [\"floor.w.d_2\"] =\t\"4620000fFG\",\r\n  [\"movf.d_2\"] =\t\"46200011FG\",\r\n  [\"movf.d_3\"] =\t\"46200011FGC\",\r\n  [\"movt.d_2\"] =\t\"46210011FG\",\r\n  [\"movt.d_3\"] =\t\"46210011FGC\",\r\n  [\"movz.d_3\"] =\t\"46200012FGT\",\r\n  [\"movn.d_3\"] =\t\"46200013FGT\",\r\n  [\"recip.d_2\"] =\t\"46200015FG\",\r\n  [\"rsqrt.d_2\"] =\t\"46200016FG\",\r\n  [\"cvt.s.d_2\"] =\t\"46200020FG\",\r\n  [\"cvt.w.d_2\"] =\t\"46200024FG\",\r\n  [\"cvt.l.d_2\"] =\t\"46200025FG\",\r\n  [\"c.f.d_2\"] =\t\t\"46200030GH\",\r\n  [\"c.f.d_3\"] =\t\t\"46200030VGH\",\r\n  [\"c.un.d_2\"] =\t\"46200031GH\",\r\n  [\"c.un.d_3\"] =\t\"46200031VGH\",\r\n  [\"c.eq.d_2\"] =\t\"46200032GH\",\r\n  [\"c.eq.d_3\"] =\t\"46200032VGH\",\r\n  [\"c.ueq.d_2\"] =\t\"46200033GH\",\r\n  [\"c.ueq.d_3\"] =\t\"46200033VGH\",\r\n  [\"c.olt.d_2\"] =\t\"46200034GH\",\r\n  [\"c.olt.d_3\"] =\t\"46200034VGH\",\r\n  [\"c.ult.d_2\"] =\t\"46200035GH\",\r\n  [\"c.ult.d_3\"] =\t\"46200035VGH\",\r\n  [\"c.ole.d_2\"] =\t\"46200036GH\",\r\n  [\"c.ole.d_3\"] =\t\"46200036VGH\",\r\n  [\"c.ule.d_2\"] =\t\"46200037GH\",\r\n  [\"c.ule.d_3\"] =\t\"46200037VGH\",\r\n  [\"c.sf.d_2\"] =\t\"46200038GH\",\r\n  [\"c.sf.d_3\"] =\t\"46200038VGH\",\r\n  [\"c.ngle.d_2\"] =\t\"46200039GH\",\r\n  [\"c.ngle.d_3\"] =\t\"46200039VGH\",\r\n  [\"c.seq.d_2\"] =\t\"4620003aGH\",\r\n  [\"c.seq.d_3\"] =\t\"4620003aVGH\",\r\n  [\"c.ngl.d_2\"] =\t\"4620003bGH\",\r\n  [\"c.ngl.d_3\"] =\t\"4620003bVGH\",\r\n  [\"c.lt.d_2\"] =\t\"4620003cGH\",\r\n  [\"c.lt.d_3\"] =\t\"4620003cVGH\",\r\n  [\"c.nge.d_2\"] =\t\"4620003dGH\",\r\n  [\"c.nge.d_3\"] =\t\"4620003dVGH\",\r\n  [\"c.le.d_2\"] =\t\"4620003eGH\",\r\n  [\"c.le.d_3\"] =\t\"4620003eVGH\",\r\n  [\"c.ngt.d_2\"] =\t\"4620003fGH\",\r\n  [\"c.ngt.d_3\"] =\t\"4620003fVGH\",\r\n\r\n  [\"add.ps_3\"] =\t\"46c00000FGH\",\r\n  [\"sub.ps_3\"] =\t\"46c00001FGH\",\r\n  [\"mul.ps_3\"] =\t\"46c00002FGH\",\r\n  [\"abs.ps_2\"] =\t\"46c00005FG\",\r\n  [\"mov.ps_2\"] =\t\"46c00006FG\",\r\n  [\"neg.ps_2\"] =\t\"46c00007FG\",\r\n  [\"movf.ps_2\"] =\t\"46c00011FG\",\r\n  [\"movf.ps_3\"] =\t\"46c00011FGC\",\r\n  [\"movt.ps_2\"] =\t\"46c10011FG\",\r\n  [\"movt.ps_3\"] =\t\"46c10011FGC\",\r\n  [\"movz.ps_3\"] =\t\"46c00012FGT\",\r\n  [\"movn.ps_3\"] =\t\"46c00013FGT\",\r\n  [\"cvt.s.pu_2\"] =\t\"46c00020FG\",\r\n  [\"cvt.s.pl_2\"] =\t\"46c00028FG\",\r\n  [\"pll.ps_3\"] =\t\"46c0002cFGH\",\r\n  [\"plu.ps_3\"] =\t\"46c0002dFGH\",\r\n  [\"pul.ps_3\"] =\t\"46c0002eFGH\",\r\n  [\"puu.ps_3\"] =\t\"46c0002fFGH\",\r\n  [\"c.f.ps_2\"] =\t\"46c00030GH\",\r\n  [\"c.f.ps_3\"] =\t\"46c00030VGH\",\r\n  [\"c.un.ps_2\"] =\t\"46c00031GH\",\r\n  [\"c.un.ps_3\"] =\t\"46c00031VGH\",\r\n  [\"c.eq.ps_2\"] =\t\"46c00032GH\",\r\n  [\"c.eq.ps_3\"] =\t\"46c00032VGH\",\r\n  [\"c.ueq.ps_2\"] =\t\"46c00033GH\",\r\n  [\"c.ueq.ps_3\"] =\t\"46c00033VGH\",\r\n  [\"c.olt.ps_2\"] =\t\"46c00034GH\",\r\n  [\"c.olt.ps_3\"] =\t\"46c00034VGH\",\r\n  [\"c.ult.ps_2\"] =\t\"46c00035GH\",\r\n  [\"c.ult.ps_3\"] =\t\"46c00035VGH\",\r\n  [\"c.ole.ps_2\"] =\t\"46c00036GH\",\r\n  [\"c.ole.ps_3\"] =\t\"46c00036VGH\",\r\n  [\"c.ule.ps_2\"] =\t\"46c00037GH\",\r\n  [\"c.ule.ps_3\"] =\t\"46c00037VGH\",\r\n  [\"c.sf.ps_2\"] =\t\"46c00038GH\",\r\n  [\"c.sf.ps_3\"] =\t\"46c00038VGH\",\r\n  [\"c.ngle.ps_2\"] =\t\"46c00039GH\",\r\n  [\"c.ngle.ps_3\"] =\t\"46c00039VGH\",\r\n  [\"c.seq.ps_2\"] =\t\"46c0003aGH\",\r\n  [\"c.seq.ps_3\"] =\t\"46c0003aVGH\",\r\n  [\"c.ngl.ps_2\"] =\t\"46c0003bGH\",\r\n  [\"c.ngl.ps_3\"] =\t\"46c0003bVGH\",\r\n  [\"c.lt.ps_2\"] =\t\"46c0003cGH\",\r\n  [\"c.lt.ps_3\"] =\t\"46c0003cVGH\",\r\n  [\"c.nge.ps_2\"] =\t\"46c0003dGH\",\r\n  [\"c.nge.ps_3\"] =\t\"46c0003dVGH\",\r\n  [\"c.le.ps_2\"] =\t\"46c0003eGH\",\r\n  [\"c.le.ps_3\"] =\t\"46c0003eVGH\",\r\n  [\"c.ngt.ps_2\"] =\t\"46c0003fGH\",\r\n  [\"c.ngt.ps_3\"] =\t\"46c0003fVGH\",\r\n\r\n  [\"cvt.s.w_2\"] =\t\"46800020FG\",\r\n  [\"cvt.d.w_2\"] =\t\"46800021FG\",\r\n\r\n  [\"cvt.s.l_2\"] =\t\"46a00020FG\",\r\n  [\"cvt.d.l_2\"] =\t\"46a00021FG\",\r\n\r\n  -- Opcode COP1X.\r\n  lwxc1_2 =\t\t\"4c000000FX\",\r\n  ldxc1_2 =\t\t\"4c000001FX\",\r\n  luxc1_2 =\t\t\"4c000005FX\",\r\n  swxc1_2 =\t\t\"4c000008FX\",\r\n  sdxc1_2 =\t\t\"4c000009FX\",\r\n  suxc1_2 =\t\t\"4c00000dFX\",\r\n  prefx_2 =\t\t\"4c00000fMX\",\r\n  [\"alnv.ps_4\"] =\t\"4c00001eFGHS\",\r\n  [\"madd.s_4\"] =\t\"4c000020FRGH\",\r\n  [\"madd.d_4\"] =\t\"4c000021FRGH\",\r\n  [\"madd.ps_4\"] =\t\"4c000026FRGH\",\r\n  [\"msub.s_4\"] =\t\"4c000028FRGH\",\r\n  [\"msub.d_4\"] =\t\"4c000029FRGH\",\r\n  [\"msub.ps_4\"] =\t\"4c00002eFRGH\",\r\n  [\"nmadd.s_4\"] =\t\"4c000030FRGH\",\r\n  [\"nmadd.d_4\"] =\t\"4c000031FRGH\",\r\n  [\"nmadd.ps_4\"] =\t\"4c000036FRGH\",\r\n  [\"nmsub.s_4\"] =\t\"4c000038FRGH\",\r\n  [\"nmsub.d_4\"] =\t\"4c000039FRGH\",\r\n  [\"nmsub.ps_4\"] =\t\"4c00003eFRGH\",\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r[1-3]?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_fpr(expr)\r\n  local r = match(expr, \"^f([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  local n = tonumber(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^[rf]([1-3]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):([rf][1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_disp(disp)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = shl(parse_gpr(reg), 21)\r\n    local extname = match(imm, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      waction(\"REL_EXT\", map_extern[extname], nil, 1)\r\n      return r\r\n    else\r\n      return r + parse_imm(imm, 16, 0, 0, true)\r\n    end\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if tp then\r\n      waction(\"IMM\", 32768+16*32, format(tp.ctypefmt, tailr))\r\n      return shl(r, 21)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_index(idx)\r\n  local rt, rs = match(idx, \"^(.*)%(([%w_:]+)%)$\")\r\n  if rt then\r\n    rt = parse_gpr(rt)\r\n    rs = parse_gpr(rs)\r\n    return shl(rt, 16) + shl(rs, 21)\r\n  end\r\n  werror(\"bad index `\"..idx..\"'\")\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return sub(template, 9) end\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n = 1\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 2 positions (ins/ext).\r\n  if secpos+2 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    if p == \"D\" then\r\n      op = op + shl(parse_gpr(params[n]), 11); n = n + 1\r\n    elseif p == \"T\" then\r\n      op = op + shl(parse_gpr(params[n]), 16); n = n + 1\r\n    elseif p == \"S\" then\r\n      op = op + shl(parse_gpr(params[n]), 21); n = n + 1\r\n    elseif p == \"F\" then\r\n      op = op + shl(parse_fpr(params[n]), 6); n = n + 1\r\n    elseif p == \"G\" then\r\n      op = op + shl(parse_fpr(params[n]), 11); n = n + 1\r\n    elseif p == \"H\" then\r\n      op = op + shl(parse_fpr(params[n]), 16); n = n + 1\r\n    elseif p == \"R\" then\r\n      op = op + shl(parse_fpr(params[n]), 21); n = n + 1\r\n    elseif p == \"I\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, true); n = n + 1\r\n    elseif p == \"U\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, false); n = n + 1\r\n    elseif p == \"O\" then\r\n      op = op + parse_disp(params[n]); n = n + 1\r\n    elseif p == \"X\" then\r\n      op = op + parse_index(params[n]); n = n + 1\r\n    elseif p == \"B\" or p == \"J\" then\r\n      local mode, n, s = parse_label(params[n], false)\r\n      if p == \"B\" then n = n + 2048 end\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n      n = n + 1\r\n    elseif p == \"A\" then\r\n      op = op + parse_imm(params[n], 5, 6, 0, false); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_imm(params[n], 5, 11, 0, false); n = n + 1\r\n    elseif p == \"N\" then\r\n      op = op + parse_imm(params[n], 5, 16, 0, false); n = n + 1\r\n    elseif p == \"C\" then\r\n      op = op + parse_imm(params[n], 3, 18, 0, false); n = n + 1\r\n    elseif p == \"V\" then\r\n      op = op + parse_imm(params[n], 3, 8, 0, false); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_imm(params[n], 3, 0, 0, false); n = n + 1\r\n    elseif p == \"Y\" then\r\n      op = op + parse_imm(params[n], 20, 6, 0, false); n = n + 1\r\n    elseif p == \"Z\" then\r\n      op = op + parse_imm(params[n], 10, 6, 0, false); n = n + 1\r\n    elseif p == \"=\" then\r\n      op = op + shl(band(op, 0xf800), 5) -- Copy D to T for clz, clo.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_ppc.h",
    "content": "/*\r\n** DynASM PPC/PPC64 encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"ppc\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. */\r\nenum {\r\n  DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,\r\n  /* The following actions need a buffer position. */\r\n  DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,\r\n  /* The following actions also have an argument. */\r\n  DASM_REL_PC, DASM_LABEL_PC, DASM_IMM, DASM_IMMSH,\r\n  DASM__MAX\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_REL\t0x15000000\r\n#define DASM_S_UNDEF_LG\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned int *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    unsigned int ins = *p++;\r\n    unsigned int action = (ins >> 16);\r\n    if (action >= DASM__MAX) {\r\n      ofs += 4;\r\n    } else {\r\n      int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;\r\n      switch (action) {\r\n      case DASM_STOP: goto stop;\r\n      case DASM_SECTION:\r\n\tn = (ins & 255); CK(n < D->maxsection, RANGE_SEC);\r\n\tD->section = &D->sections[n]; goto stop;\r\n      case DASM_ESC: p++; ofs += 4; break;\r\n      case DASM_REL_EXT: break;\r\n      case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;\r\n      case DASM_REL_LG:\r\n\tn = (ins & 2047) - 10; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl += 10; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tbreak;\r\n      case DASM_LABEL_LG:\r\n\tpl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC:\r\n\tpl = D->pclabels + n; CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;\r\n\t}\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_IMM:\r\n#ifdef DASM_CHECKS\r\n\tCK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);\r\n#endif\r\n\tn >>= ((ins>>10)&31);\r\n#ifdef DASM_CHECKS\r\n\tif (ins & 0x8000)\r\n\t  CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);\r\n\telse\r\n\t  CK((n>>((ins>>5)&31)) == 0, RANGE_I);\r\n#endif\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      case DASM_IMMSH:\r\n\tCK((n >> 6) == 0, RANGE_I);\r\n\tb[pos++] = n;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_REL_EXT: break;\r\n\tcase DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;\r\n\tcase DASM_REL_LG: case DASM_REL_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;\r\n\tcase DASM_IMM: case DASM_IMMSH: pos++; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  char *base = (char *)buffer;\r\n  unsigned int *cp = (unsigned int *)buffer;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      while (1) {\r\n\tunsigned int ins = *p++;\r\n\tunsigned int action = (ins >> 16);\r\n\tint n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_STOP: case DASM_SECTION: goto stop;\r\n\tcase DASM_ESC: *cp++ = *p++; break;\r\n\tcase DASM_REL_EXT:\r\n\t  n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins & 2047), 1) - 4;\r\n\t  goto patchrel;\r\n\tcase DASM_ALIGN:\r\n\t  ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0x60000000;\r\n\t  break;\r\n\tcase DASM_REL_LG:\r\n\t  CK(n >= 0, UNDEF_LG);\r\n\tcase DASM_REL_PC:\r\n\t  CK(n >= 0, UNDEF_PC);\r\n\t  n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base);\r\n\tpatchrel:\r\n\t  CK((n & 3) == 0 &&\r\n\t      (((n+4) + ((ins & 2048) ? 0x00008000 : 0x02000000)) >>\r\n\t       ((ins & 2048) ? 16 : 26)) == 0, RANGE_REL);\r\n\t  cp[-1] |= ((n+4) & ((ins & 2048) ? 0x0000fffc: 0x03fffffc));\r\n\t  break;\r\n\tcase DASM_LABEL_LG:\r\n\t  ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);\r\n\t  break;\r\n\tcase DASM_LABEL_PC: break;\r\n\tcase DASM_IMM:\r\n\t  cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);\r\n\t  break;\r\n\tcase DASM_IMMSH:\r\n\t  cp[-1] |= (ins & 1) ? ((n&31)<<11)|((n&32)>>4) : ((n&31)<<6)|(n&32);\r\n\t  break;\r\n\tdefault: *cp++ = ins; break;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != (char *)cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n#undef CK\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_ppc.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM PPC/PPC64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n--\r\n-- Support for various extensions contributed by Caio Souza Oliveira.\r\n------------------------------------------------------------------------------\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\t\"ppc\",\r\n  description =\t\"DynASM PPC module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2015-01-14\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, setmetatable = assert, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal match, gmatch = _s.match, _s.gmatch\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr, sar = bit.band, bit.lshift, bit.rshift, bit.arshift\r\nlocal tohex = bit.tohex\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  \"STOP\", \"SECTION\", \"ESC\", \"REL_EXT\",\r\n  \"ALIGN\", \"REL_LG\", \"LABEL_LG\",\r\n  \"REL_PC\", \"LABEL_PC\", \"IMM\", \"IMMSH\"\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number.\r\nlocal map_action = {}\r\nfor n,name in ipairs(action_names) do\r\n  map_action[name] = n-1\r\nend\r\n\r\n-- Action list buffer.\r\nlocal actlist = {}\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  if nn == 0 then nn = 1; actlist[0] = map_action.STOP end\r\n  out:write(\"static const unsigned int \", name, \"[\", nn, \"] = {\\n\")\r\n  for i = 1,nn-1 do\r\n    assert(out:write(\"0x\", tohex(actlist[i]), \",\\n\"))\r\n  end\r\n  assert(out:write(\"0x\", tohex(actlist[nn]), \"\\n};\\n\\n\"))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add word to action list.\r\nlocal function wputxw(n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, val, a, num)\r\n  local w = assert(map_action[action], \"bad action name `\"..action..\"'\")\r\n  wputxw(w * 0x10000 + (val or 0))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  if #actlist == actargs[1] then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  wline(format(\"dasm_put(Dst, %s);\", concat(actargs, \", \")), true)\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped word.\r\nlocal function wputw(n)\r\n  if n <= 0xffffff then waction(\"ESC\") end\r\n  wputxw(n)\r\nend\r\n\r\n-- Reserve position for word.\r\nlocal function wpos()\r\n  local pos = #actlist+1\r\n  actlist[pos] = \"\"\r\n  return pos\r\nend\r\n\r\n-- Store word to reserved position.\r\nlocal function wputpos(pos, n)\r\n  assert(n >= 0 and n <= 0xffffffff and n % 1 == 0, \"word out of range\")\r\n  actlist[pos] = n\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 20\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 2047 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \", prefix, t[i], \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=20,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = 0\r\nlocal map_extern_ = {}\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n > 2047 then werror(\"too many extern labels\") end\r\n  next_extern = n + 1\r\n  t[name] = n\r\n  map_extern_[n] = name\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(format(\"  %s\\n\", map_extern_[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=0,next_extern-1 do\r\n    out:write(\"  \\\"\", map_extern_[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = { sp = \"r1\" } -- Ext. register name -> int. name.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for Dt... macros).\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  if s == \"r1\" then return \"sp\" end\r\n  return s\r\nend\r\n\r\nlocal map_cond = {\r\n  lt = 0, gt = 1, eq = 2, so = 3,\r\n  ge = 4, le = 5, ne = 6, ns = 7,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_op, op_template\r\n\r\nlocal function op_alias(opname, f)\r\n  return function(params, nparams)\r\n    if not params then return \"-> \"..opname:sub(1, -3) end\r\n    f(params, nparams)\r\n    op_template(params, map_op[opname], nparams)\r\n  end\r\nend\r\n\r\n-- Template strings for PPC instructions.\r\nmap_op = {\r\n  tdi_3 =\t\"08000000ARI\",\r\n  twi_3 =\t\"0c000000ARI\",\r\n  mulli_3 =\t\"1c000000RRI\",\r\n  subfic_3 =\t\"20000000RRI\",\r\n  cmplwi_3 =\t\"28000000XRU\",\r\n  cmplwi_2 =\t\"28000000-RU\",\r\n  cmpldi_3 =\t\"28200000XRU\",\r\n  cmpldi_2 =\t\"28200000-RU\",\r\n  cmpwi_3 =\t\"2c000000XRI\",\r\n  cmpwi_2 =\t\"2c000000-RI\",\r\n  cmpdi_3 =\t\"2c200000XRI\",\r\n  cmpdi_2 =\t\"2c200000-RI\",\r\n  addic_3 =\t\"30000000RRI\",\r\n  [\"addic._3\"] = \"34000000RRI\",\r\n  addi_3 =\t\"38000000RR0I\",\r\n  li_2 =\t\"38000000RI\",\r\n  la_2 =\t\"38000000RD\",\r\n  addis_3 =\t\"3c000000RR0I\",\r\n  lis_2 =\t\"3c000000RI\",\r\n  lus_2 =\t\"3c000000RU\",\r\n  bc_3 =\t\"40000000AAK\",\r\n  bcl_3 =\t\"40000001AAK\",\r\n  bdnz_1 =\t\"42000000K\",\r\n  bdz_1 =\t\"42400000K\",\r\n  sc_0 =\t\"44000000\",\r\n  b_1 =\t\t\"48000000J\",\r\n  bl_1 =\t\"48000001J\",\r\n  rlwimi_5 =\t\"50000000RR~AAA.\",\r\n  rlwinm_5 =\t\"54000000RR~AAA.\",\r\n  rlwnm_5 =\t\"5c000000RR~RAA.\",\r\n  ori_3 =\t\"60000000RR~U\",\r\n  nop_0 =\t\"60000000\",\r\n  oris_3 =\t\"64000000RR~U\",\r\n  xori_3 =\t\"68000000RR~U\",\r\n  xoris_3 =\t\"6c000000RR~U\",\r\n  [\"andi._3\"] =\t\"70000000RR~U\",\r\n  [\"andis._3\"] = \"74000000RR~U\",\r\n  lwz_2 =\t\"80000000RD\",\r\n  lwzu_2 =\t\"84000000RD\",\r\n  lbz_2 =\t\"88000000RD\",\r\n  lbzu_2 =\t\"8c000000RD\",\r\n  stw_2 =\t\"90000000RD\",\r\n  stwu_2 =\t\"94000000RD\",\r\n  stb_2 =\t\"98000000RD\",\r\n  stbu_2 =\t\"9c000000RD\",\r\n  lhz_2 =\t\"a0000000RD\",\r\n  lhzu_2 =\t\"a4000000RD\",\r\n  lha_2 =\t\"a8000000RD\",\r\n  lhau_2 =\t\"ac000000RD\",\r\n  sth_2 =\t\"b0000000RD\",\r\n  sthu_2 =\t\"b4000000RD\",\r\n  lmw_2 =\t\"b8000000RD\",\r\n  stmw_2 =\t\"bc000000RD\",\r\n  lfs_2 =\t\"c0000000FD\",\r\n  lfsu_2 =\t\"c4000000FD\",\r\n  lfd_2 =\t\"c8000000FD\",\r\n  lfdu_2 =\t\"cc000000FD\",\r\n  stfs_2 =\t\"d0000000FD\",\r\n  stfsu_2 =\t\"d4000000FD\",\r\n  stfd_2 =\t\"d8000000FD\",\r\n  stfdu_2 =\t\"dc000000FD\",\r\n  ld_2 =\t\"e8000000RD\", -- NYI: displacement must be divisible by 4.\r\n  ldu_2 =\t\"e8000001RD\",\r\n  lwa_2 =\t\"e8000002RD\",\r\n  std_2 =\t\"f8000000RD\",\r\n  stdu_2 =\t\"f8000001RD\",\r\n\r\n  subi_3 =\top_alias(\"addi_3\", function(p) p[3] = \"-(\"..p[3]..\")\" end),\r\n  subis_3 =\top_alias(\"addis_3\", function(p) p[3] = \"-(\"..p[3]..\")\" end),\r\n  subic_3 =\top_alias(\"addic_3\", function(p) p[3] = \"-(\"..p[3]..\")\" end),\r\n  [\"subic._3\"] = op_alias(\"addic._3\", function(p) p[3] = \"-(\"..p[3]..\")\" end),\r\n\r\n  rotlwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[4] = \"0\"; p[5] = \"31\"\r\n  end),\r\n  rotrwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[3] = \"32-(\"..p[3]..\")\"; p[4] = \"0\"; p[5] = \"31\"\r\n  end),\r\n  rotlw_3 =\top_alias(\"rlwnm_5\", function(p)\r\n    p[4] = \"0\"; p[5] = \"31\"\r\n  end),\r\n  slwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[5] = \"31-(\"..p[3]..\")\"; p[4] = \"0\"\r\n  end),\r\n  srwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[4] = p[3]; p[3] = \"32-(\"..p[3]..\")\"; p[5] = \"31\"\r\n  end),\r\n  clrlwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[4] = p[3]; p[3] = \"0\"; p[5] = \"31\"\r\n  end),\r\n  clrrwi_3 =\top_alias(\"rlwinm_5\", function(p)\r\n    p[5] = \"31-(\"..p[3]..\")\"; p[3] = \"0\"; p[4] = \"0\"\r\n  end),\r\n\r\n  -- Primary opcode 4:\r\n  mulhhwu_3 =\t\t\"10000010RRR.\",\r\n  machhwu_3 =\t\t\"10000018RRR.\",\r\n  mulhhw_3 =\t\t\"10000050RRR.\",\r\n  nmachhw_3 =\t\t\"1000005cRRR.\",\r\n  machhwsu_3 =\t\t\"10000098RRR.\",\r\n  machhws_3 =\t\t\"100000d8RRR.\",\r\n  nmachhws_3 =\t\t\"100000dcRRR.\",\r\n  mulchwu_3 =\t\t\"10000110RRR.\",\r\n  macchwu_3 =\t\t\"10000118RRR.\",\r\n  mulchw_3 =\t\t\"10000150RRR.\",\r\n  macchw_3 =\t\t\"10000158RRR.\",\r\n  nmacchw_3 =\t\t\"1000015cRRR.\",\r\n  macchwsu_3 =\t\t\"10000198RRR.\",\r\n  macchws_3 =\t\t\"100001d8RRR.\",\r\n  nmacchws_3 =\t\t\"100001dcRRR.\",\r\n  mullhw_3 =\t\t\"10000350RRR.\",\r\n  maclhw_3 =\t\t\"10000358RRR.\",\r\n  nmaclhw_3 =\t\t\"1000035cRRR.\",\r\n  maclhwsu_3 =\t\t\"10000398RRR.\",\r\n  maclhws_3 =\t\t\"100003d8RRR.\",\r\n  nmaclhws_3 =\t\t\"100003dcRRR.\",\r\n  machhwuo_3 =\t\t\"10000418RRR.\",\r\n  nmachhwo_3 =\t\t\"1000045cRRR.\",\r\n  machhwsuo_3 =\t\t\"10000498RRR.\",\r\n  machhwso_3 =\t\t\"100004d8RRR.\",\r\n  nmachhwso_3 =\t\t\"100004dcRRR.\",\r\n  macchwuo_3 =\t\t\"10000518RRR.\",\r\n  macchwo_3 =\t\t\"10000558RRR.\",\r\n  nmacchwo_3 =\t\t\"1000055cRRR.\",\r\n  macchwsuo_3 =\t\t\"10000598RRR.\",\r\n  macchwso_3 =\t\t\"100005d8RRR.\",\r\n  nmacchwso_3 =\t\t\"100005dcRRR.\",\r\n  maclhwo_3 =\t\t\"10000758RRR.\",\r\n  nmaclhwo_3 =\t\t\"1000075cRRR.\",\r\n  maclhwsuo_3 =\t\t\"10000798RRR.\",\r\n  maclhwso_3 =\t\t\"100007d8RRR.\",\r\n  nmaclhwso_3 =\t\t\"100007dcRRR.\",\r\n\r\n  vaddubm_3 =\t\t\"10000000VVV\",\r\n  vmaxub_3 =\t\t\"10000002VVV\",\r\n  vrlb_3 =\t\t\"10000004VVV\",\r\n  vcmpequb_3 =\t\t\"10000006VVV\",\r\n  vmuloub_3 =\t\t\"10000008VVV\",\r\n  vaddfp_3 =\t\t\"1000000aVVV\",\r\n  vmrghb_3 =\t\t\"1000000cVVV\",\r\n  vpkuhum_3 =\t\t\"1000000eVVV\",\r\n  vmhaddshs_4 =\t\t\"10000020VVVV\",\r\n  vmhraddshs_4 =\t\"10000021VVVV\",\r\n  vmladduhm_4 =\t\t\"10000022VVVV\",\r\n  vmsumubm_4 =\t\t\"10000024VVVV\",\r\n  vmsummbm_4 =\t\t\"10000025VVVV\",\r\n  vmsumuhm_4 =\t\t\"10000026VVVV\",\r\n  vmsumuhs_4 =\t\t\"10000027VVVV\",\r\n  vmsumshm_4 =\t\t\"10000028VVVV\",\r\n  vmsumshs_4 =\t\t\"10000029VVVV\",\r\n  vsel_4 =\t\t\"1000002aVVVV\",\r\n  vperm_4 =\t\t\"1000002bVVVV\",\r\n  vsldoi_4 =\t\t\"1000002cVVVP\",\r\n  vpermxor_4 =\t\t\"1000002dVVVV\",\r\n  vmaddfp_4 =\t\t\"1000002eVVVV~\",\r\n  vnmsubfp_4 =\t\t\"1000002fVVVV~\",\r\n  vaddeuqm_4 =\t\t\"1000003cVVVV\",\r\n  vaddecuq_4 =\t\t\"1000003dVVVV\",\r\n  vsubeuqm_4 =\t\t\"1000003eVVVV\",\r\n  vsubecuq_4 =\t\t\"1000003fVVVV\",\r\n  vadduhm_3 =\t\t\"10000040VVV\",\r\n  vmaxuh_3 =\t\t\"10000042VVV\",\r\n  vrlh_3 =\t\t\"10000044VVV\",\r\n  vcmpequh_3 =\t\t\"10000046VVV\",\r\n  vmulouh_3 =\t\t\"10000048VVV\",\r\n  vsubfp_3 =\t\t\"1000004aVVV\",\r\n  vmrghh_3 =\t\t\"1000004cVVV\",\r\n  vpkuwum_3 =\t\t\"1000004eVVV\",\r\n  vadduwm_3 =\t\t\"10000080VVV\",\r\n  vmaxuw_3 =\t\t\"10000082VVV\",\r\n  vrlw_3 =\t\t\"10000084VVV\",\r\n  vcmpequw_3 =\t\t\"10000086VVV\",\r\n  vmulouw_3 =\t\t\"10000088VVV\",\r\n  vmuluwm_3 =\t\t\"10000089VVV\",\r\n  vmrghw_3 =\t\t\"1000008cVVV\",\r\n  vpkuhus_3 =\t\t\"1000008eVVV\",\r\n  vaddudm_3 =\t\t\"100000c0VVV\",\r\n  vmaxud_3 =\t\t\"100000c2VVV\",\r\n  vrld_3 =\t\t\"100000c4VVV\",\r\n  vcmpeqfp_3 =\t\t\"100000c6VVV\",\r\n  vcmpequd_3 =\t\t\"100000c7VVV\",\r\n  vpkuwus_3 =\t\t\"100000ceVVV\",\r\n  vadduqm_3 =\t\t\"10000100VVV\",\r\n  vmaxsb_3 =\t\t\"10000102VVV\",\r\n  vslb_3 =\t\t\"10000104VVV\",\r\n  vmulosb_3 =\t\t\"10000108VVV\",\r\n  vrefp_2 =\t\t\"1000010aV-V\",\r\n  vmrglb_3 =\t\t\"1000010cVVV\",\r\n  vpkshus_3 =\t\t\"1000010eVVV\",\r\n  vaddcuq_3 =\t\t\"10000140VVV\",\r\n  vmaxsh_3 =\t\t\"10000142VVV\",\r\n  vslh_3 =\t\t\"10000144VVV\",\r\n  vmulosh_3 =\t\t\"10000148VVV\",\r\n  vrsqrtefp_2 =\t\t\"1000014aV-V\",\r\n  vmrglh_3 =\t\t\"1000014cVVV\",\r\n  vpkswus_3 =\t\t\"1000014eVVV\",\r\n  vaddcuw_3 =\t\t\"10000180VVV\",\r\n  vmaxsw_3 =\t\t\"10000182VVV\",\r\n  vslw_3 =\t\t\"10000184VVV\",\r\n  vmulosw_3 =\t\t\"10000188VVV\",\r\n  vexptefp_2 =\t\t\"1000018aV-V\",\r\n  vmrglw_3 =\t\t\"1000018cVVV\",\r\n  vpkshss_3 =\t\t\"1000018eVVV\",\r\n  vmaxsd_3 =\t\t\"100001c2VVV\",\r\n  vsl_3 =\t\t\"100001c4VVV\",\r\n  vcmpgefp_3 =\t\t\"100001c6VVV\",\r\n  vlogefp_2 =\t\t\"100001caV-V\",\r\n  vpkswss_3 =\t\t\"100001ceVVV\",\r\n  vadduhs_3 =\t\t\"10000240VVV\",\r\n  vminuh_3 =\t\t\"10000242VVV\",\r\n  vsrh_3 =\t\t\"10000244VVV\",\r\n  vcmpgtuh_3 =\t\t\"10000246VVV\",\r\n  vmuleuh_3 =\t\t\"10000248VVV\",\r\n  vrfiz_2 =\t\t\"1000024aV-V\",\r\n  vsplth_3 =\t\t\"1000024cVV3\",\r\n  vupkhsh_2 =\t\t\"1000024eV-V\",\r\n  vminuw_3 =\t\t\"10000282VVV\",\r\n  vminud_3 =\t\t\"100002c2VVV\",\r\n  vcmpgtud_3 =\t\t\"100002c7VVV\",\r\n  vrfim_2 =\t\t\"100002caV-V\",\r\n  vcmpgtsb_3 =\t\t\"10000306VVV\",\r\n  vcfux_3 =\t\t\"1000030aVVA~\",\r\n  vaddshs_3 =\t\t\"10000340VVV\",\r\n  vminsh_3 =\t\t\"10000342VVV\",\r\n  vsrah_3 =\t\t\"10000344VVV\",\r\n  vcmpgtsh_3 =\t\t\"10000346VVV\",\r\n  vmulesh_3 =\t\t\"10000348VVV\",\r\n  vcfsx_3 =\t\t\"1000034aVVA~\",\r\n  vspltish_2 =\t\t\"1000034cVS\",\r\n  vupkhpx_2 =\t\t\"1000034eV-V\",\r\n  vaddsws_3 =\t\t\"10000380VVV\",\r\n  vminsw_3 =\t\t\"10000382VVV\",\r\n  vsraw_3 =\t\t\"10000384VVV\",\r\n  vcmpgtsw_3 =\t\t\"10000386VVV\",\r\n  vmulesw_3 =\t\t\"10000388VVV\",\r\n  vctuxs_3 =\t\t\"1000038aVVA~\",\r\n  vspltisw_2 =\t\t\"1000038cVS\",\r\n  vminsd_3 =\t\t\"100003c2VVV\",\r\n  vsrad_3 =\t\t\"100003c4VVV\",\r\n  vcmpbfp_3 =\t\t\"100003c6VVV\",\r\n  vcmpgtsd_3 =\t\t\"100003c7VVV\",\r\n  vctsxs_3 =\t\t\"100003caVVA~\",\r\n  vupklpx_2 =\t\t\"100003ceV-V\",\r\n  vsububm_3 =\t\t\"10000400VVV\",\r\n  [\"bcdadd._4\"] =\t\"10000401VVVy.\",\r\n  vavgub_3 =\t\t\"10000402VVV\",\r\n  vand_3 =\t\t\"10000404VVV\",\r\n  [\"vcmpequb._3\"] =\t\"10000406VVV\",\r\n  vmaxfp_3 =\t\t\"1000040aVVV\",\r\n  vsubuhm_3 =\t\t\"10000440VVV\",\r\n  [\"bcdsub._4\"] =\t\"10000441VVVy.\",\r\n  vavguh_3 =\t\t\"10000442VVV\",\r\n  vandc_3 =\t\t\"10000444VVV\",\r\n  [\"vcmpequh._3\"] =\t\"10000446VVV\",\r\n  vminfp_3 =\t\t\"1000044aVVV\",\r\n  vpkudum_3 =\t\t\"1000044eVVV\",\r\n  vsubuwm_3 =\t\t\"10000480VVV\",\r\n  vavguw_3 =\t\t\"10000482VVV\",\r\n  vor_3 =\t\t\"10000484VVV\",\r\n  [\"vcmpequw._3\"] =\t\"10000486VVV\",\r\n  vpmsumw_3 =\t\t\"10000488VVV\",\r\n  [\"vcmpeqfp._3\"] =\t\"100004c6VVV\",\r\n  [\"vcmpequd._3\"] =\t\"100004c7VVV\",\r\n  vpkudus_3 =\t\t\"100004ceVVV\",\r\n  vavgsb_3 =\t\t\"10000502VVV\",\r\n  vavgsh_3 =\t\t\"10000542VVV\",\r\n  vorc_3 =\t\t\"10000544VVV\",\r\n  vbpermq_3 =\t\t\"1000054cVVV\",\r\n  vpksdus_3 =\t\t\"1000054eVVV\",\r\n  vavgsw_3 =\t\t\"10000582VVV\",\r\n  vsld_3 =\t\t\"100005c4VVV\",\r\n  [\"vcmpgefp._3\"] =\t\"100005c6VVV\",\r\n  vpksdss_3 =\t\t\"100005ceVVV\",\r\n  vsububs_3 =\t\t\"10000600VVV\",\r\n  mfvscr_1 =\t\t\"10000604V--\",\r\n  vsum4ubs_3 =\t\t\"10000608VVV\",\r\n  vsubuhs_3 =\t\t\"10000640VVV\",\r\n  mtvscr_1 =\t\t\"10000644--V\",\r\n  [\"vcmpgtuh._3\"] =\t\"10000646VVV\",\r\n  vsum4shs_3 =\t\t\"10000648VVV\",\r\n  vupkhsw_2 =\t\t\"1000064eV-V\",\r\n  vsubuws_3 =\t\t\"10000680VVV\",\r\n  vshasigmaw_4 =\t\"10000682VVYp\",\r\n  veqv_3 =\t\t\"10000684VVV\",\r\n  vsum2sws_3 =\t\t\"10000688VVV\",\r\n  vmrgow_3 =\t\t\"1000068cVVV\",\r\n  vshasigmad_4 =\t\"100006c2VVYp\",\r\n  vsrd_3 =\t\t\"100006c4VVV\",\r\n  [\"vcmpgtud._3\"] =\t\"100006c7VVV\",\r\n  vupklsw_2 =\t\t\"100006ceV-V\",\r\n  vupkslw_2 =\t\t\"100006ceV-V\",\r\n  vsubsbs_3 =\t\t\"10000700VVV\",\r\n  vclzb_2 =\t\t\"10000702V-V\",\r\n  vpopcntb_2 =\t\t\"10000703V-V\",\r\n  [\"vcmpgtsb._3\"] =\t\"10000706VVV\",\r\n  vsum4sbs_3 =\t\t\"10000708VVV\",\r\n  vsubshs_3 =\t\t\"10000740VVV\",\r\n  vclzh_2 =\t\t\"10000742V-V\",\r\n  vpopcnth_2 =\t\t\"10000743V-V\",\r\n  [\"vcmpgtsh._3\"] =\t\"10000746VVV\",\r\n  vsubsws_3 =\t\t\"10000780VVV\",\r\n  vclzw_2 =\t\t\"10000782V-V\",\r\n  vpopcntw_2 =\t\t\"10000783V-V\",\r\n  [\"vcmpgtsw._3\"] =\t\"10000786VVV\",\r\n  vsumsws_3 =\t\t\"10000788VVV\",\r\n  vmrgew_3 =\t\t\"1000078cVVV\",\r\n  vclzd_2 =\t\t\"100007c2V-V\",\r\n  vpopcntd_2 =\t\t\"100007c3V-V\",\r\n  [\"vcmpbfp._3\"] =\t\"100007c6VVV\",\r\n  [\"vcmpgtsd._3\"] =\t\"100007c7VVV\",\r\n\r\n  -- Primary opcode 19:\r\n  mcrf_2 =\t\"4c000000XX\",\r\n  isync_0 =\t\"4c00012c\",\r\n  crnor_3 =\t\"4c000042CCC\",\r\n  crnot_2 =\t\"4c000042CC=\",\r\n  crandc_3 =\t\"4c000102CCC\",\r\n  crxor_3 =\t\"4c000182CCC\",\r\n  crclr_1 =\t\"4c000182C==\",\r\n  crnand_3 =\t\"4c0001c2CCC\",\r\n  crand_3 =\t\"4c000202CCC\",\r\n  creqv_3 =\t\"4c000242CCC\",\r\n  crset_1 =\t\"4c000242C==\",\r\n  crorc_3 =\t\"4c000342CCC\",\r\n  cror_3 =\t\"4c000382CCC\",\r\n  crmove_2 =\t\"4c000382CC=\",\r\n  bclr_2 =\t\"4c000020AA\",\r\n  bclrl_2 =\t\"4c000021AA\",\r\n  bcctr_2 =\t\"4c000420AA\",\r\n  bcctrl_2 =\t\"4c000421AA\",\r\n  bctar_2 =\t\"4c000460AA\",\r\n  bctarl_2 =\t\"4c000461AA\",\r\n  blr_0 =\t\"4e800020\",\r\n  blrl_0 =\t\"4e800021\",\r\n  bctr_0 =\t\"4e800420\",\r\n  bctrl_0 =\t\"4e800421\",\r\n\r\n  -- Primary opcode 31:\r\n  cmpw_3 =\t\"7c000000XRR\",\r\n  cmpw_2 =\t\"7c000000-RR\",\r\n  cmpd_3 =\t\"7c200000XRR\",\r\n  cmpd_2 =\t\"7c200000-RR\",\r\n  tw_3 =\t\"7c000008ARR\",\r\n  lvsl_3 =\t\"7c00000cVRR\",\r\n  subfc_3 =\t\"7c000010RRR.\",\r\n  subc_3 =\t\"7c000010RRR~.\",\r\n  mulhdu_3 =\t\"7c000012RRR.\",\r\n  addc_3 =\t\"7c000014RRR.\",\r\n  mulhwu_3 =\t\"7c000016RRR.\",\r\n  isel_4 =\t\"7c00001eRRRC\",\r\n  isellt_3 =\t\"7c00001eRRR\",\r\n  iselgt_3 =\t\"7c00005eRRR\",\r\n  iseleq_3 =\t\"7c00009eRRR\",\r\n  mfcr_1 =\t\"7c000026R\",\r\n  mfocrf_2 =\t\"7c100026RG\",\r\n  mtcrf_2 =\t\"7c000120GR\",\r\n  mtocrf_2 =\t\"7c100120GR\",\r\n  lwarx_3 =\t\"7c000028RR0R\",\r\n  ldx_3 =\t\"7c00002aRR0R\",\r\n  lwzx_3 =\t\"7c00002eRR0R\",\r\n  slw_3 =\t\"7c000030RR~R.\",\r\n  cntlzw_2 =\t\"7c000034RR~\",\r\n  sld_3 =\t\"7c000036RR~R.\",\r\n  and_3 =\t\"7c000038RR~R.\",\r\n  cmplw_3 =\t\"7c000040XRR\",\r\n  cmplw_2 =\t\"7c000040-RR\",\r\n  cmpld_3 =\t\"7c200040XRR\",\r\n  cmpld_2 =\t\"7c200040-RR\",\r\n  lvsr_3 =\t\"7c00004cVRR\",\r\n  subf_3 =\t\"7c000050RRR.\",\r\n  sub_3 =\t\"7c000050RRR~.\",\r\n  lbarx_3 =\t\"7c000068RR0R\",\r\n  ldux_3 =\t\"7c00006aRR0R\",\r\n  dcbst_2 =\t\"7c00006c-RR\",\r\n  lwzux_3 =\t\"7c00006eRR0R\",\r\n  cntlzd_2 =\t\"7c000074RR~\",\r\n  andc_3 =\t\"7c000078RR~R.\",\r\n  td_3 =\t\"7c000088ARR\",\r\n  lvewx_3 =\t\"7c00008eVRR\",\r\n  mulhd_3 =\t\"7c000092RRR.\",\r\n  addg6s_3 =\t\"7c000094RRR\",\r\n  mulhw_3 =\t\"7c000096RRR.\",\r\n  dlmzb_3 =\t\"7c00009cRR~R.\",\r\n  ldarx_3 =\t\"7c0000a8RR0R\",\r\n  dcbf_2 =\t\"7c0000ac-RR\",\r\n  lbzx_3 =\t\"7c0000aeRR0R\",\r\n  lvx_3 =\t\"7c0000ceVRR\",\r\n  neg_2 =\t\"7c0000d0RR.\",\r\n  lharx_3 =\t\"7c0000e8RR0R\",\r\n  lbzux_3 =\t\"7c0000eeRR0R\",\r\n  popcntb_2 =\t\"7c0000f4RR~\",\r\n  not_2 =\t\"7c0000f8RR~%.\",\r\n  nor_3 =\t\"7c0000f8RR~R.\",\r\n  stvebx_3 =\t\"7c00010eVRR\",\r\n  subfe_3 =\t\"7c000110RRR.\",\r\n  sube_3 =\t\"7c000110RRR~.\",\r\n  adde_3 =\t\"7c000114RRR.\",\r\n  stdx_3 =\t\"7c00012aRR0R\",\r\n  [\"stwcx._3\"] =\t\"7c00012dRR0R.\",\r\n  stwx_3 =\t\"7c00012eRR0R\",\r\n  prtyw_2 =\t\"7c000134RR~\",\r\n  stvehx_3 =\t\"7c00014eVRR\",\r\n  stdux_3 =\t\"7c00016aRR0R\",\r\n  [\"stqcx._3\"] =\t\"7c00016dR:R0R.\",\r\n  stwux_3 =\t\"7c00016eRR0R\",\r\n  prtyd_2 =\t\"7c000174RR~\",\r\n  stvewx_3 =\t\"7c00018eVRR\",\r\n  subfze_2 =\t\"7c000190RR.\",\r\n  addze_2 =\t\"7c000194RR.\",\r\n  [\"stdcx._3\"] =\t\"7c0001adRR0R.\",\r\n  stbx_3 =\t\"7c0001aeRR0R\",\r\n  stvx_3 =\t\"7c0001ceVRR\",\r\n  subfme_2 =\t\"7c0001d0RR.\",\r\n  mulld_3 =\t\"7c0001d2RRR.\",\r\n  addme_2 =\t\"7c0001d4RR.\",\r\n  mullw_3 =\t\"7c0001d6RRR.\",\r\n  dcbtst_2 =\t\"7c0001ec-RR\",\r\n  stbux_3 =\t\"7c0001eeRR0R\",\r\n  bpermd_3 =\t\"7c0001f8RR~R\",\r\n  lvepxl_3 =\t\"7c00020eVRR\",\r\n  add_3 =\t\"7c000214RRR.\",\r\n  lqarx_3 =\t\"7c000228R:R0R\",\r\n  dcbt_2 =\t\"7c00022c-RR\",\r\n  lhzx_3 =\t\"7c00022eRR0R\",\r\n  cdtbcd_2 =\t\"7c000234RR~\",\r\n  eqv_3 =\t\"7c000238RR~R.\",\r\n  lvepx_3 =\t\"7c00024eVRR\",\r\n  eciwx_3 =\t\"7c00026cRR0R\",\r\n  lhzux_3 =\t\"7c00026eRR0R\",\r\n  cbcdtd_2 =\t\"7c000274RR~\",\r\n  xor_3 =\t\"7c000278RR~R.\",\r\n  mfspefscr_1 =\t\"7c0082a6R\",\r\n  mfxer_1 =\t\"7c0102a6R\",\r\n  mflr_1 =\t\"7c0802a6R\",\r\n  mfctr_1 =\t\"7c0902a6R\",\r\n  lwax_3 =\t\"7c0002aaRR0R\",\r\n  lhax_3 =\t\"7c0002aeRR0R\",\r\n  mftb_1 =\t\"7c0c42e6R\",\r\n  mftbu_1 =\t\"7c0d42e6R\",\r\n  lvxl_3 =\t\"7c0002ceVRR\",\r\n  lwaux_3 =\t\"7c0002eaRR0R\",\r\n  lhaux_3 =\t\"7c0002eeRR0R\",\r\n  popcntw_2 =\t\"7c0002f4RR~\",\r\n  divdeu_3 =\t\"7c000312RRR.\",\r\n  divweu_3 =\t\"7c000316RRR.\",\r\n  sthx_3 =\t\"7c00032eRR0R\",\r\n  orc_3 =\t\"7c000338RR~R.\",\r\n  ecowx_3 =\t\"7c00036cRR0R\",\r\n  sthux_3 =\t\"7c00036eRR0R\",\r\n  or_3 =\t\"7c000378RR~R.\",\r\n  mr_2 =\t\"7c000378RR~%.\",\r\n  divdu_3 =\t\"7c000392RRR.\",\r\n  divwu_3 =\t\"7c000396RRR.\",\r\n  mtspefscr_1 =\t\"7c0083a6R\",\r\n  mtxer_1 =\t\"7c0103a6R\",\r\n  mtlr_1 =\t\"7c0803a6R\",\r\n  mtctr_1 =\t\"7c0903a6R\",\r\n  dcbi_2 =\t\"7c0003ac-RR\",\r\n  nand_3 =\t\"7c0003b8RR~R.\",\r\n  dsn_2 =\t\"7c0003c6-RR\",\r\n  stvxl_3 =\t\"7c0003ceVRR\",\r\n  divd_3 =\t\"7c0003d2RRR.\",\r\n  divw_3 =\t\"7c0003d6RRR.\",\r\n  popcntd_2 =\t\"7c0003f4RR~\",\r\n  cmpb_3 =\t\"7c0003f8RR~R.\",\r\n  mcrxr_1 =\t\"7c000400X\",\r\n  lbdx_3 =\t\"7c000406RRR\",\r\n  subfco_3 =\t\"7c000410RRR.\",\r\n  subco_3 =\t\"7c000410RRR~.\",\r\n  addco_3 =\t\"7c000414RRR.\",\r\n  ldbrx_3 =\t\"7c000428RR0R\",\r\n  lswx_3 =\t\"7c00042aRR0R\",\r\n  lwbrx_3 =\t\"7c00042cRR0R\",\r\n  lfsx_3 =\t\"7c00042eFR0R\",\r\n  srw_3 =\t\"7c000430RR~R.\",\r\n  srd_3 =\t\"7c000436RR~R.\",\r\n  lhdx_3 =\t\"7c000446RRR\",\r\n  subfo_3 =\t\"7c000450RRR.\",\r\n  subo_3 =\t\"7c000450RRR~.\",\r\n  lfsux_3 =\t\"7c00046eFR0R\",\r\n  lwdx_3 =\t\"7c000486RRR\",\r\n  lswi_3 =\t\"7c0004aaRR0A\",\r\n  sync_0 =\t\"7c0004ac\",\r\n  lwsync_0 =\t\"7c2004ac\",\r\n  ptesync_0 =\t\"7c4004ac\",\r\n  lfdx_3 =\t\"7c0004aeFR0R\",\r\n  lddx_3 =\t\"7c0004c6RRR\",\r\n  nego_2 =\t\"7c0004d0RR.\",\r\n  lfdux_3 =\t\"7c0004eeFR0R\",\r\n  stbdx_3 =\t\"7c000506RRR\",\r\n  subfeo_3 =\t\"7c000510RRR.\",\r\n  subeo_3 =\t\"7c000510RRR~.\",\r\n  addeo_3 =\t\"7c000514RRR.\",\r\n  stdbrx_3 =\t\"7c000528RR0R\",\r\n  stswx_3 =\t\"7c00052aRR0R\",\r\n  stwbrx_3 =\t\"7c00052cRR0R\",\r\n  stfsx_3 =\t\"7c00052eFR0R\",\r\n  sthdx_3 =\t\"7c000546RRR\",\r\n  [\"stbcx._3\"] =\t\"7c00056dRRR\",\r\n  stfsux_3 =\t\"7c00056eFR0R\",\r\n  stwdx_3 =\t\"7c000586RRR\",\r\n  subfzeo_2 =\t\"7c000590RR.\",\r\n  addzeo_2 =\t\"7c000594RR.\",\r\n  stswi_3 =\t\"7c0005aaRR0A\",\r\n  [\"sthcx._3\"] =\t\"7c0005adRRR\",\r\n  stfdx_3 =\t\"7c0005aeFR0R\",\r\n  stddx_3 =\t\"7c0005c6RRR\",\r\n  subfmeo_2 =\t\"7c0005d0RR.\",\r\n  mulldo_3 =\t\"7c0005d2RRR.\",\r\n  addmeo_2 =\t\"7c0005d4RR.\",\r\n  mullwo_3 =\t\"7c0005d6RRR.\",\r\n  dcba_2 =\t\"7c0005ec-RR\",\r\n  stfdux_3 =\t\"7c0005eeFR0R\",\r\n  stvepxl_3 =\t\"7c00060eVRR\",\r\n  addo_3 =\t\"7c000614RRR.\",\r\n  lhbrx_3 =\t\"7c00062cRR0R\",\r\n  lfdpx_3 =\t\"7c00062eF:RR\",\r\n  sraw_3 =\t\"7c000630RR~R.\",\r\n  srad_3 =\t\"7c000634RR~R.\",\r\n  lfddx_3 =\t\"7c000646FRR\",\r\n  stvepx_3 =\t\"7c00064eVRR\",\r\n  srawi_3 =\t\"7c000670RR~A.\",\r\n  sradi_3 =\t\"7c000674RR~H.\",\r\n  eieio_0 =\t\"7c0006ac\",\r\n  lfiwax_3 =\t\"7c0006aeFR0R\",\r\n  divdeuo_3 =\t\"7c000712RRR.\",\r\n  divweuo_3 =\t\"7c000716RRR.\",\r\n  sthbrx_3 =\t\"7c00072cRR0R\",\r\n  stfdpx_3 =\t\"7c00072eF:RR\",\r\n  extsh_2 =\t\"7c000734RR~.\",\r\n  stfddx_3 =\t\"7c000746FRR\",\r\n  divdeo_3 =\t\"7c000752RRR.\",\r\n  divweo_3 =\t\"7c000756RRR.\",\r\n  extsb_2 =\t\"7c000774RR~.\",\r\n  divduo_3 =\t\"7c000792RRR.\",\r\n  divwou_3 =\t\"7c000796RRR.\",\r\n  icbi_2 =\t\"7c0007ac-RR\",\r\n  stfiwx_3 =\t\"7c0007aeFR0R\",\r\n  extsw_2 =\t\"7c0007b4RR~.\",\r\n  divdo_3 =\t\"7c0007d2RRR.\",\r\n  divwo_3 =\t\"7c0007d6RRR.\",\r\n  dcbz_2 =\t\"7c0007ec-RR\",\r\n\r\n  [\"tbegin._1\"] =\t\"7c00051d1\",\r\n  [\"tbegin._0\"] =\t\"7c00051d\",\r\n  [\"tend._1\"] =\t\t\"7c00055dY\",\r\n  [\"tend._0\"] =\t\t\"7c00055d\",\r\n  [\"tendall._0\"] =\t\"7e00055d\",\r\n  tcheck_1 =\t\t\"7c00059cX\",\r\n  [\"tsr._1\"] =\t\t\"7c0005dd1\",\r\n  [\"tsuspend._0\"] =\t\"7c0005dd\",\r\n  [\"tresume._0\"] =\t\"7c2005dd\",\r\n  [\"tabortwc._3\"] =\t\"7c00061dARR\",\r\n  [\"tabortdc._3\"] =\t\"7c00065dARR\",\r\n  [\"tabortwci._3\"] =\t\"7c00069dARS\",\r\n  [\"tabortdci._3\"] =\t\"7c0006ddARS\",\r\n  [\"tabort._1\"] =\t\"7c00071d-R-\",\r\n  [\"treclaim._1\"] =\t\"7c00075d-R\",\r\n  [\"trechkpt._0\"] =\t\"7c0007dd\",\r\n\r\n  lxsiwzx_3 =\t\"7c000018QRR\",\r\n  lxsiwax_3 =\t\"7c000098QRR\",\r\n  mfvsrd_2 =\t\"7c000066-Rq\",\r\n  mfvsrwz_2 =\t\"7c0000e6-Rq\",\r\n  stxsiwx_3 =\t\"7c000118QRR\",\r\n  mtvsrd_2 =\t\"7c000166QR\",\r\n  mtvsrwa_2 =\t\"7c0001a6QR\",\r\n  lxvdsx_3 =\t\"7c000298QRR\",\r\n  lxsspx_3 =\t\"7c000418QRR\",\r\n  lxsdx_3 =\t\"7c000498QRR\",\r\n  stxsspx_3 =\t\"7c000518QRR\",\r\n  stxsdx_3 =\t\"7c000598QRR\",\r\n  lxvw4x_3 =\t\"7c000618QRR\",\r\n  lxvd2x_3 =\t\"7c000698QRR\",\r\n  stxvw4x_3 =\t\"7c000718QRR\",\r\n  stxvd2x_3 =\t\"7c000798QRR\",\r\n\r\n  -- Primary opcode 30:\r\n  rldicl_4 =\t\"78000000RR~HM.\",\r\n  rldicr_4 =\t\"78000004RR~HM.\",\r\n  rldic_4 =\t\"78000008RR~HM.\",\r\n  rldimi_4 =\t\"7800000cRR~HM.\",\r\n  rldcl_4 =\t\"78000010RR~RM.\",\r\n  rldcr_4 =\t\"78000012RR~RM.\",\r\n\r\n  rotldi_3 =\top_alias(\"rldicl_4\", function(p)\r\n    p[4] = \"0\"\r\n  end),\r\n  rotrdi_3 =\top_alias(\"rldicl_4\", function(p)\r\n    p[3] = \"64-(\"..p[3]..\")\"; p[4] = \"0\"\r\n  end),\r\n  rotld_3 =\top_alias(\"rldcl_4\", function(p)\r\n    p[4] = \"0\"\r\n  end),\r\n  sldi_3 =\top_alias(\"rldicr_4\", function(p)\r\n    p[4] = \"63-(\"..p[3]..\")\"\r\n  end),\r\n  srdi_3 =\top_alias(\"rldicl_4\", function(p)\r\n    p[4] = p[3]; p[3] = \"64-(\"..p[3]..\")\"\r\n  end),\r\n  clrldi_3 =\top_alias(\"rldicl_4\", function(p)\r\n    p[4] = p[3]; p[3] = \"0\"\r\n  end),\r\n  clrrdi_3 =\top_alias(\"rldicr_4\", function(p)\r\n    p[4] = \"63-(\"..p[3]..\")\"; p[3] = \"0\"\r\n  end),\r\n\r\n  -- Primary opcode 56:\r\n  lq_2 =\t\"e0000000R:D\", -- NYI: displacement must be divisible by 8.\r\n\r\n  -- Primary opcode 57:\r\n  lfdp_2 =\t\"e4000000F:D\", -- NYI: displacement must be divisible by 4.\r\n\r\n  -- Primary opcode 59:\r\n  fdivs_3 =\t\"ec000024FFF.\",\r\n  fsubs_3 =\t\"ec000028FFF.\",\r\n  fadds_3 =\t\"ec00002aFFF.\",\r\n  fsqrts_2 =\t\"ec00002cF-F.\",\r\n  fres_2 =\t\"ec000030F-F.\",\r\n  fmuls_3 =\t\"ec000032FF-F.\",\r\n  frsqrtes_2 =\t\"ec000034F-F.\",\r\n  fmsubs_4 =\t\"ec000038FFFF~.\",\r\n  fmadds_4 =\t\"ec00003aFFFF~.\",\r\n  fnmsubs_4 =\t\"ec00003cFFFF~.\",\r\n  fnmadds_4 =\t\"ec00003eFFFF~.\",\r\n  fcfids_2 =\t\"ec00069cF-F.\",\r\n  fcfidus_2 =\t\"ec00079cF-F.\",\r\n\r\n  dadd_3 =\t\"ec000004FFF.\",\r\n  dqua_4 =\t\"ec000006FFFZ.\",\r\n  dmul_3 =\t\"ec000044FFF.\",\r\n  drrnd_4 =\t\"ec000046FFFZ.\",\r\n  dscli_3 =\t\"ec000084FF6.\",\r\n  dquai_4 =\t\"ec000086SF~FZ.\",\r\n  dscri_3 =\t\"ec0000c4FF6.\",\r\n  drintx_4 =\t\"ec0000c61F~FZ.\",\r\n  dcmpo_3 =\t\"ec000104XFF\",\r\n  dtstex_3 =\t\"ec000144XFF\",\r\n  dtstdc_3 =\t\"ec000184XF6\",\r\n  dtstdg_3 =\t\"ec0001c4XF6\",\r\n  drintn_4 =\t\"ec0001c61F~FZ.\",\r\n  dctdp_2 =\t\"ec000204F-F.\",\r\n  dctfix_2 =\t\"ec000244F-F.\",\r\n  ddedpd_3 =\t\"ec000284ZF~F.\",\r\n  dxex_2 =\t\"ec0002c4F-F.\",\r\n  dsub_3 =\t\"ec000404FFF.\",\r\n  ddiv_3 =\t\"ec000444FFF.\",\r\n  dcmpu_3 =\t\"ec000504XFF\",\r\n  dtstsf_3 =\t\"ec000544XFF\",\r\n  drsp_2 =\t\"ec000604F-F.\",\r\n  dcffix_2 =\t\"ec000644F-F.\",\r\n  denbcd_3 =\t\"ec000684YF~F.\",\r\n  diex_3 =\t\"ec0006c4FFF.\",\r\n\r\n  -- Primary opcode 60:\r\n  xsaddsp_3 =\t\t\"f0000000QQQ\",\r\n  xsmaddasp_3 =\t\t\"f0000008QQQ\",\r\n  xxsldwi_4 =\t\t\"f0000010QQQz\",\r\n  xsrsqrtesp_2 =\t\"f0000028Q-Q\",\r\n  xssqrtsp_2 =\t\t\"f000002cQ-Q\",\r\n  xxsel_4 =\t\t\"f0000030QQQQ\",\r\n  xssubsp_3 =\t\t\"f0000040QQQ\",\r\n  xsmaddmsp_3 =\t\t\"f0000048QQQ\",\r\n  xxpermdi_4 =\t\t\"f0000050QQQz\",\r\n  xsresp_2 =\t\t\"f0000068Q-Q\",\r\n  xsmulsp_3 =\t\t\"f0000080QQQ\",\r\n  xsmsubasp_3 =\t\t\"f0000088QQQ\",\r\n  xxmrghw_3 =\t\t\"f0000090QQQ\",\r\n  xsdivsp_3 =\t\t\"f00000c0QQQ\",\r\n  xsmsubmsp_3 =\t\t\"f00000c8QQQ\",\r\n  xsadddp_3 =\t\t\"f0000100QQQ\",\r\n  xsmaddadp_3 =\t\t\"f0000108QQQ\",\r\n  xscmpudp_3 =\t\t\"f0000118XQQ\",\r\n  xscvdpuxws_2 =\t\"f0000120Q-Q\",\r\n  xsrdpi_2 =\t\t\"f0000124Q-Q\",\r\n  xsrsqrtedp_2 =\t\"f0000128Q-Q\",\r\n  xssqrtdp_2 =\t\t\"f000012cQ-Q\",\r\n  xssubdp_3 =\t\t\"f0000140QQQ\",\r\n  xsmaddmdp_3 =\t\t\"f0000148QQQ\",\r\n  xscmpodp_3 =\t\t\"f0000158XQQ\",\r\n  xscvdpsxws_2 =\t\"f0000160Q-Q\",\r\n  xsrdpiz_2 =\t\t\"f0000164Q-Q\",\r\n  xsredp_2 =\t\t\"f0000168Q-Q\",\r\n  xsmuldp_3 =\t\t\"f0000180QQQ\",\r\n  xsmsubadp_3 =\t\t\"f0000188QQQ\",\r\n  xxmrglw_3 =\t\t\"f0000190QQQ\",\r\n  xsrdpip_2 =\t\t\"f00001a4Q-Q\",\r\n  xstsqrtdp_2 =\t\t\"f00001a8X-Q\",\r\n  xsrdpic_2 =\t\t\"f00001acQ-Q\",\r\n  xsdivdp_3 =\t\t\"f00001c0QQQ\",\r\n  xsmsubmdp_3 =\t\t\"f00001c8QQQ\",\r\n  xsrdpim_2 =\t\t\"f00001e4Q-Q\",\r\n  xstdivdp_3 =\t\t\"f00001e8XQQ\",\r\n  xvaddsp_3 =\t\t\"f0000200QQQ\",\r\n  xvmaddasp_3 =\t\t\"f0000208QQQ\",\r\n  xvcmpeqsp_3 =\t\t\"f0000218QQQ\",\r\n  xvcvspuxws_2 =\t\"f0000220Q-Q\",\r\n  xvrspi_2 =\t\t\"f0000224Q-Q\",\r\n  xvrsqrtesp_2 =\t\"f0000228Q-Q\",\r\n  xvsqrtsp_2 =\t\t\"f000022cQ-Q\",\r\n  xvsubsp_3 =\t\t\"f0000240QQQ\",\r\n  xvmaddmsp_3 =\t\t\"f0000248QQQ\",\r\n  xvcmpgtsp_3 =\t\t\"f0000258QQQ\",\r\n  xvcvspsxws_2 =\t\"f0000260Q-Q\",\r\n  xvrspiz_2 =\t\t\"f0000264Q-Q\",\r\n  xvresp_2 =\t\t\"f0000268Q-Q\",\r\n  xvmulsp_3 =\t\t\"f0000280QQQ\",\r\n  xvmsubasp_3 =\t\t\"f0000288QQQ\",\r\n  xxspltw_3 =\t\t\"f0000290QQg~\",\r\n  xvcmpgesp_3 =\t\t\"f0000298QQQ\",\r\n  xvcvuxwsp_2 =\t\t\"f00002a0Q-Q\",\r\n  xvrspip_2 =\t\t\"f00002a4Q-Q\",\r\n  xvtsqrtsp_2 =\t\t\"f00002a8X-Q\",\r\n  xvrspic_2 =\t\t\"f00002acQ-Q\",\r\n  xvdivsp_3 =\t\t\"f00002c0QQQ\",\r\n  xvmsubmsp_3 =\t\t\"f00002c8QQQ\",\r\n  xvcvsxwsp_2 =\t\t\"f00002e0Q-Q\",\r\n  xvrspim_2 =\t\t\"f00002e4Q-Q\",\r\n  xvtdivsp_3 =\t\t\"f00002e8XQQ\",\r\n  xvadddp_3 =\t\t\"f0000300QQQ\",\r\n  xvmaddadp_3 =\t\t\"f0000308QQQ\",\r\n  xvcmpeqdp_3 =\t\t\"f0000318QQQ\",\r\n  xvcvdpuxws_2 =\t\"f0000320Q-Q\",\r\n  xvrdpi_2 =\t\t\"f0000324Q-Q\",\r\n  xvrsqrtedp_2 =\t\"f0000328Q-Q\",\r\n  xvsqrtdp_2 =\t\t\"f000032cQ-Q\",\r\n  xvsubdp_3 =\t\t\"f0000340QQQ\",\r\n  xvmaddmdp_3 =\t\t\"f0000348QQQ\",\r\n  xvcmpgtdp_3 =\t\t\"f0000358QQQ\",\r\n  xvcvdpsxws_2 =\t\"f0000360Q-Q\",\r\n  xvrdpiz_2 =\t\t\"f0000364Q-Q\",\r\n  xvredp_2 =\t\t\"f0000368Q-Q\",\r\n  xvmuldp_3 =\t\t\"f0000380QQQ\",\r\n  xvmsubadp_3 =\t\t\"f0000388QQQ\",\r\n  xvcmpgedp_3 =\t\t\"f0000398QQQ\",\r\n  xvcvuxwdp_2 =\t\t\"f00003a0Q-Q\",\r\n  xvrdpip_2 =\t\t\"f00003a4Q-Q\",\r\n  xvtsqrtdp_2 =\t\t\"f00003a8X-Q\",\r\n  xvrdpic_2 =\t\t\"f00003acQ-Q\",\r\n  xvdivdp_3 =\t\t\"f00003c0QQQ\",\r\n  xvmsubmdp_3 =\t\t\"f00003c8QQQ\",\r\n  xvcvsxwdp_2 =\t\t\"f00003e0Q-Q\",\r\n  xvrdpim_2 =\t\t\"f00003e4Q-Q\",\r\n  xvtdivdp_3 =\t\t\"f00003e8XQQ\",\r\n  xsnmaddasp_3 =\t\"f0000408QQQ\",\r\n  xxland_3 =\t\t\"f0000410QQQ\",\r\n  xscvdpsp_2 =\t\t\"f0000424Q-Q\",\r\n  xscvdpspn_2 =\t\t\"f000042cQ-Q\",\r\n  xsnmaddmsp_3 =\t\"f0000448QQQ\",\r\n  xxlandc_3 =\t\t\"f0000450QQQ\",\r\n  xsrsp_2 =\t\t\"f0000464Q-Q\",\r\n  xsnmsubasp_3 =\t\"f0000488QQQ\",\r\n  xxlor_3 =\t\t\"f0000490QQQ\",\r\n  xscvuxdsp_2 =\t\t\"f00004a0Q-Q\",\r\n  xsnmsubmsp_3 =\t\"f00004c8QQQ\",\r\n  xxlxor_3 =\t\t\"f00004d0QQQ\",\r\n  xscvsxdsp_2 =\t\t\"f00004e0Q-Q\",\r\n  xsmaxdp_3 =\t\t\"f0000500QQQ\",\r\n  xsnmaddadp_3 =\t\"f0000508QQQ\",\r\n  xxlnor_3 =\t\t\"f0000510QQQ\",\r\n  xscvdpuxds_2 =\t\"f0000520Q-Q\",\r\n  xscvspdp_2 =\t\t\"f0000524Q-Q\",\r\n  xscvspdpn_2 =\t\t\"f000052cQ-Q\",\r\n  xsmindp_3 =\t\t\"f0000540QQQ\",\r\n  xsnmaddmdp_3 =\t\"f0000548QQQ\",\r\n  xxlorc_3 =\t\t\"f0000550QQQ\",\r\n  xscvdpsxds_2 =\t\"f0000560Q-Q\",\r\n  xsabsdp_2 =\t\t\"f0000564Q-Q\",\r\n  xscpsgndp_3 =\t\t\"f0000580QQQ\",\r\n  xsnmsubadp_3 =\t\"f0000588QQQ\",\r\n  xxlnand_3 =\t\t\"f0000590QQQ\",\r\n  xscvuxddp_2 =\t\t\"f00005a0Q-Q\",\r\n  xsnabsdp_2 =\t\t\"f00005a4Q-Q\",\r\n  xsnmsubmdp_3 =\t\"f00005c8QQQ\",\r\n  xxleqv_3 =\t\t\"f00005d0QQQ\",\r\n  xscvsxddp_2 =\t\t\"f00005e0Q-Q\",\r\n  xsnegdp_2 =\t\t\"f00005e4Q-Q\",\r\n  xvmaxsp_3 =\t\t\"f0000600QQQ\",\r\n  xvnmaddasp_3 =\t\"f0000608QQQ\",\r\n  [\"xvcmpeqsp._3\"] =\t\"f0000618QQQ\",\r\n  xvcvspuxds_2 =\t\"f0000620Q-Q\",\r\n  xvcvdpsp_2 =\t\t\"f0000624Q-Q\",\r\n  xvminsp_3 =\t\t\"f0000640QQQ\",\r\n  xvnmaddmsp_3 =\t\"f0000648QQQ\",\r\n  [\"xvcmpgtsp._3\"] =\t\"f0000658QQQ\",\r\n  xvcvspsxds_2 =\t\"f0000660Q-Q\",\r\n  xvabssp_2 =\t\t\"f0000664Q-Q\",\r\n  xvcpsgnsp_3 =\t\t\"f0000680QQQ\",\r\n  xvnmsubasp_3 =\t\"f0000688QQQ\",\r\n  [\"xvcmpgesp._3\"] =\t\"f0000698QQQ\",\r\n  xvcvuxdsp_2 =\t\t\"f00006a0Q-Q\",\r\n  xvnabssp_2 =\t\t\"f00006a4Q-Q\",\r\n  xvnmsubmsp_3 =\t\"f00006c8QQQ\",\r\n  xvcvsxdsp_2 =\t\t\"f00006e0Q-Q\",\r\n  xvnegsp_2 =\t\t\"f00006e4Q-Q\",\r\n  xvmaxdp_3 =\t\t\"f0000700QQQ\",\r\n  xvnmaddadp_3 =\t\"f0000708QQQ\",\r\n  [\"xvcmpeqdp._3\"] =\t\"f0000718QQQ\",\r\n  xvcvdpuxds_2 =\t\"f0000720Q-Q\",\r\n  xvcvspdp_2 =\t\t\"f0000724Q-Q\",\r\n  xvmindp_3 =\t\t\"f0000740QQQ\",\r\n  xvnmaddmdp_3 =\t\"f0000748QQQ\",\r\n  [\"xvcmpgtdp._3\"] =\t\"f0000758QQQ\",\r\n  xvcvdpsxds_2 =\t\"f0000760Q-Q\",\r\n  xvabsdp_2 =\t\t\"f0000764Q-Q\",\r\n  xvcpsgndp_3 =\t\t\"f0000780QQQ\",\r\n  xvnmsubadp_3 =\t\"f0000788QQQ\",\r\n  [\"xvcmpgedp._3\"] =\t\"f0000798QQQ\",\r\n  xvcvuxddp_2 =\t\t\"f00007a0Q-Q\",\r\n  xvnabsdp_2 =\t\t\"f00007a4Q-Q\",\r\n  xvnmsubmdp_3 =\t\"f00007c8QQQ\",\r\n  xvcvsxddp_2 =\t\t\"f00007e0Q-Q\",\r\n  xvnegdp_2 =\t\t\"f00007e4Q-Q\",\r\n\r\n  -- Primary opcode 61:\r\n  stfdp_2 =\t\"f4000000F:D\", -- NYI: displacement must be divisible by 4.\r\n\r\n  -- Primary opcode 62:\r\n  stq_2 =\t\"f8000002R:D\", -- NYI: displacement must be divisible by 8.\r\n\r\n  -- Primary opcode 63:\r\n  fdiv_3 =\t\"fc000024FFF.\",\r\n  fsub_3 =\t\"fc000028FFF.\",\r\n  fadd_3 =\t\"fc00002aFFF.\",\r\n  fsqrt_2 =\t\"fc00002cF-F.\",\r\n  fsel_4 =\t\"fc00002eFFFF~.\",\r\n  fre_2 =\t\"fc000030F-F.\",\r\n  fmul_3 =\t\"fc000032FF-F.\",\r\n  frsqrte_2 =\t\"fc000034F-F.\",\r\n  fmsub_4 =\t\"fc000038FFFF~.\",\r\n  fmadd_4 =\t\"fc00003aFFFF~.\",\r\n  fnmsub_4 =\t\"fc00003cFFFF~.\",\r\n  fnmadd_4 =\t\"fc00003eFFFF~.\",\r\n  fcmpu_3 =\t\"fc000000XFF\",\r\n  fcpsgn_3 =\t\"fc000010FFF.\",\r\n  fcmpo_3 =\t\"fc000040XFF\",\r\n  mtfsb1_1 =\t\"fc00004cA\",\r\n  fneg_2 =\t\"fc000050F-F.\",\r\n  mcrfs_2 =\t\"fc000080XX\",\r\n  mtfsb0_1 =\t\"fc00008cA\",\r\n  fmr_2 =\t\"fc000090F-F.\",\r\n  frsp_2 =\t\"fc000018F-F.\",\r\n  fctiw_2 =\t\"fc00001cF-F.\",\r\n  fctiwz_2 =\t\"fc00001eF-F.\",\r\n  ftdiv_2 =\t\"fc000100X-F.\",\r\n  fctiwu_2 =\t\"fc00011cF-F.\",\r\n  fctiwuz_2 =\t\"fc00011eF-F.\",\r\n  mtfsfi_2 =\t\"fc00010cAA\", -- NYI: upshift.\r\n  fnabs_2 =\t\"fc000110F-F.\",\r\n  ftsqrt_2 =\t\"fc000140X-F.\",\r\n  fabs_2 =\t\"fc000210F-F.\",\r\n  frin_2 =\t\"fc000310F-F.\",\r\n  friz_2 =\t\"fc000350F-F.\",\r\n  frip_2 =\t\"fc000390F-F.\",\r\n  frim_2 =\t\"fc0003d0F-F.\",\r\n  mffs_1 =\t\"fc00048eF.\",\r\n  -- NYI: mtfsf, mtfsb0, mtfsb1.\r\n  fctid_2 =\t\"fc00065cF-F.\",\r\n  fctidz_2 =\t\"fc00065eF-F.\",\r\n  fmrgow_3 =\t\"fc00068cFFF\",\r\n  fcfid_2 =\t\"fc00069cF-F.\",\r\n  fctidu_2 =\t\"fc00075cF-F.\",\r\n  fctiduz_2 =\t\"fc00075eF-F.\",\r\n  fmrgew_3 =\t\"fc00078cFFF\",\r\n  fcfidu_2 =\t\"fc00079cF-F.\",\r\n\r\n  daddq_3 =\t\"fc000004F:F:F:.\",\r\n  dquaq_4 =\t\"fc000006F:F:F:Z.\",\r\n  dmulq_3 =\t\"fc000044F:F:F:.\",\r\n  drrndq_4 =\t\"fc000046F:F:F:Z.\",\r\n  dscliq_3 =\t\"fc000084F:F:6.\",\r\n  dquaiq_4 =\t\"fc000086SF:~F:Z.\",\r\n  dscriq_3 =\t\"fc0000c4F:F:6.\",\r\n  drintxq_4 =\t\"fc0000c61F:~F:Z.\",\r\n  dcmpoq_3 =\t\"fc000104XF:F:\",\r\n  dtstexq_3 =\t\"fc000144XF:F:\",\r\n  dtstdcq_3 =\t\"fc000184XF:6\",\r\n  dtstdgq_3 =\t\"fc0001c4XF:6\",\r\n  drintnq_4 =\t\"fc0001c61F:~F:Z.\",\r\n  dctqpq_2 =\t\"fc000204F:-F:.\",\r\n  dctfixq_2 =\t\"fc000244F:-F:.\",\r\n  ddedpdq_3 =\t\"fc000284ZF:~F:.\",\r\n  dxexq_2 =\t\"fc0002c4F:-F:.\",\r\n  dsubq_3 =\t\"fc000404F:F:F:.\",\r\n  ddivq_3 =\t\"fc000444F:F:F:.\",\r\n  dcmpuq_3 =\t\"fc000504XF:F:\",\r\n  dtstsfq_3 =\t\"fc000544XF:F:\",\r\n  drdpq_2 =\t\"fc000604F:-F:.\",\r\n  dcffixq_2 =\t\"fc000644F:-F:.\",\r\n  denbcdq_3 =\t\"fc000684YF:~F:.\",\r\n  diexq_3 =\t\"fc0006c4F:FF:.\",\r\n\r\n  -- Primary opcode 4, SPE APU extension:\r\n  evaddw_3 =\t\t\"10000200RRR\",\r\n  evaddiw_3 =\t\t\"10000202RAR~\",\r\n  evsubw_3 =\t\t\"10000204RRR~\",\r\n  evsubiw_3 =\t\t\"10000206RAR~\",\r\n  evabs_2 =\t\t\"10000208RR\",\r\n  evneg_2 =\t\t\"10000209RR\",\r\n  evextsb_2 =\t\t\"1000020aRR\",\r\n  evextsh_2 =\t\t\"1000020bRR\",\r\n  evrndw_2 =\t\t\"1000020cRR\",\r\n  evcntlzw_2 =\t\t\"1000020dRR\",\r\n  evcntlsw_2 =\t\t\"1000020eRR\",\r\n  brinc_3 =\t\t\"1000020fRRR\",\r\n  evand_3 =\t\t\"10000211RRR\",\r\n  evandc_3 =\t\t\"10000212RRR\",\r\n  evxor_3 =\t\t\"10000216RRR\",\r\n  evor_3 =\t\t\"10000217RRR\",\r\n  evmr_2 =\t\t\"10000217RR=\",\r\n  evnor_3 =\t\t\"10000218RRR\",\r\n  evnot_2 =\t\t\"10000218RR=\",\r\n  eveqv_3 =\t\t\"10000219RRR\",\r\n  evorc_3 =\t\t\"1000021bRRR\",\r\n  evnand_3 =\t\t\"1000021eRRR\",\r\n  evsrwu_3 =\t\t\"10000220RRR\",\r\n  evsrws_3 =\t\t\"10000221RRR\",\r\n  evsrwiu_3 =\t\t\"10000222RRA\",\r\n  evsrwis_3 =\t\t\"10000223RRA\",\r\n  evslw_3 =\t\t\"10000224RRR\",\r\n  evslwi_3 =\t\t\"10000226RRA\",\r\n  evrlw_3 =\t\t\"10000228RRR\",\r\n  evsplati_2 =\t\t\"10000229RS\",\r\n  evrlwi_3 =\t\t\"1000022aRRA\",\r\n  evsplatfi_2 =\t\t\"1000022bRS\",\r\n  evmergehi_3 =\t\t\"1000022cRRR\",\r\n  evmergelo_3 =\t\t\"1000022dRRR\",\r\n  evcmpgtu_3 =\t\t\"10000230XRR\",\r\n  evcmpgtu_2 =\t\t\"10000230-RR\",\r\n  evcmpgts_3 =\t\t\"10000231XRR\",\r\n  evcmpgts_2 =\t\t\"10000231-RR\",\r\n  evcmpltu_3 =\t\t\"10000232XRR\",\r\n  evcmpltu_2 =\t\t\"10000232-RR\",\r\n  evcmplts_3 =\t\t\"10000233XRR\",\r\n  evcmplts_2 =\t\t\"10000233-RR\",\r\n  evcmpeq_3 =\t\t\"10000234XRR\",\r\n  evcmpeq_2 =\t\t\"10000234-RR\",\r\n  evsel_4 =\t\t\"10000278RRRW\",\r\n  evsel_3 =\t\t\"10000278RRR\",\r\n  evfsadd_3 =\t\t\"10000280RRR\",\r\n  evfssub_3 =\t\t\"10000281RRR\",\r\n  evfsabs_2 =\t\t\"10000284RR\",\r\n  evfsnabs_2 =\t\t\"10000285RR\",\r\n  evfsneg_2 =\t\t\"10000286RR\",\r\n  evfsmul_3 =\t\t\"10000288RRR\",\r\n  evfsdiv_3 =\t\t\"10000289RRR\",\r\n  evfscmpgt_3 =\t\t\"1000028cXRR\",\r\n  evfscmpgt_2 =\t\t\"1000028c-RR\",\r\n  evfscmplt_3 =\t\t\"1000028dXRR\",\r\n  evfscmplt_2 =\t\t\"1000028d-RR\",\r\n  evfscmpeq_3 =\t\t\"1000028eXRR\",\r\n  evfscmpeq_2 =\t\t\"1000028e-RR\",\r\n  evfscfui_2 =\t\t\"10000290R-R\",\r\n  evfscfsi_2 =\t\t\"10000291R-R\",\r\n  evfscfuf_2 =\t\t\"10000292R-R\",\r\n  evfscfsf_2 =\t\t\"10000293R-R\",\r\n  evfsctui_2 =\t\t\"10000294R-R\",\r\n  evfsctsi_2 =\t\t\"10000295R-R\",\r\n  evfsctuf_2 =\t\t\"10000296R-R\",\r\n  evfsctsf_2 =\t\t\"10000297R-R\",\r\n  evfsctuiz_2 =\t\t\"10000298R-R\",\r\n  evfsctsiz_2 =\t\t\"1000029aR-R\",\r\n  evfststgt_3 =\t\t\"1000029cXRR\",\r\n  evfststgt_2 =\t\t\"1000029c-RR\",\r\n  evfststlt_3 =\t\t\"1000029dXRR\",\r\n  evfststlt_2 =\t\t\"1000029d-RR\",\r\n  evfststeq_3 =\t\t\"1000029eXRR\",\r\n  evfststeq_2 =\t\t\"1000029e-RR\",\r\n  efsadd_3 =\t\t\"100002c0RRR\",\r\n  efssub_3 =\t\t\"100002c1RRR\",\r\n  efsabs_2 =\t\t\"100002c4RR\",\r\n  efsnabs_2 =\t\t\"100002c5RR\",\r\n  efsneg_2 =\t\t\"100002c6RR\",\r\n  efsmul_3 =\t\t\"100002c8RRR\",\r\n  efsdiv_3 =\t\t\"100002c9RRR\",\r\n  efscmpgt_3 =\t\t\"100002ccXRR\",\r\n  efscmpgt_2 =\t\t\"100002cc-RR\",\r\n  efscmplt_3 =\t\t\"100002cdXRR\",\r\n  efscmplt_2 =\t\t\"100002cd-RR\",\r\n  efscmpeq_3 =\t\t\"100002ceXRR\",\r\n  efscmpeq_2 =\t\t\"100002ce-RR\",\r\n  efscfd_2 =\t\t\"100002cfR-R\",\r\n  efscfui_2 =\t\t\"100002d0R-R\",\r\n  efscfsi_2 =\t\t\"100002d1R-R\",\r\n  efscfuf_2 =\t\t\"100002d2R-R\",\r\n  efscfsf_2 =\t\t\"100002d3R-R\",\r\n  efsctui_2 =\t\t\"100002d4R-R\",\r\n  efsctsi_2 =\t\t\"100002d5R-R\",\r\n  efsctuf_2 =\t\t\"100002d6R-R\",\r\n  efsctsf_2 =\t\t\"100002d7R-R\",\r\n  efsctuiz_2 =\t\t\"100002d8R-R\",\r\n  efsctsiz_2 =\t\t\"100002daR-R\",\r\n  efststgt_3 =\t\t\"100002dcXRR\",\r\n  efststgt_2 =\t\t\"100002dc-RR\",\r\n  efststlt_3 =\t\t\"100002ddXRR\",\r\n  efststlt_2 =\t\t\"100002dd-RR\",\r\n  efststeq_3 =\t\t\"100002deXRR\",\r\n  efststeq_2 =\t\t\"100002de-RR\",\r\n  efdadd_3 =\t\t\"100002e0RRR\",\r\n  efdsub_3 =\t\t\"100002e1RRR\",\r\n  efdcfuid_2 =\t\t\"100002e2R-R\",\r\n  efdcfsid_2 =\t\t\"100002e3R-R\",\r\n  efdabs_2 =\t\t\"100002e4RR\",\r\n  efdnabs_2 =\t\t\"100002e5RR\",\r\n  efdneg_2 =\t\t\"100002e6RR\",\r\n  efdmul_3 =\t\t\"100002e8RRR\",\r\n  efddiv_3 =\t\t\"100002e9RRR\",\r\n  efdctuidz_2 =\t\t\"100002eaR-R\",\r\n  efdctsidz_2 =\t\t\"100002ebR-R\",\r\n  efdcmpgt_3 =\t\t\"100002ecXRR\",\r\n  efdcmpgt_2 =\t\t\"100002ec-RR\",\r\n  efdcmplt_3 =\t\t\"100002edXRR\",\r\n  efdcmplt_2 =\t\t\"100002ed-RR\",\r\n  efdcmpeq_3 =\t\t\"100002eeXRR\",\r\n  efdcmpeq_2 =\t\t\"100002ee-RR\",\r\n  efdcfs_2 =\t\t\"100002efR-R\",\r\n  efdcfui_2 =\t\t\"100002f0R-R\",\r\n  efdcfsi_2 =\t\t\"100002f1R-R\",\r\n  efdcfuf_2 =\t\t\"100002f2R-R\",\r\n  efdcfsf_2 =\t\t\"100002f3R-R\",\r\n  efdctui_2 =\t\t\"100002f4R-R\",\r\n  efdctsi_2 =\t\t\"100002f5R-R\",\r\n  efdctuf_2 =\t\t\"100002f6R-R\",\r\n  efdctsf_2 =\t\t\"100002f7R-R\",\r\n  efdctuiz_2 =\t\t\"100002f8R-R\",\r\n  efdctsiz_2 =\t\t\"100002faR-R\",\r\n  efdtstgt_3 =\t\t\"100002fcXRR\",\r\n  efdtstgt_2 =\t\t\"100002fc-RR\",\r\n  efdtstlt_3 =\t\t\"100002fdXRR\",\r\n  efdtstlt_2 =\t\t\"100002fd-RR\",\r\n  efdtsteq_3 =\t\t\"100002feXRR\",\r\n  efdtsteq_2 =\t\t\"100002fe-RR\",\r\n  evlddx_3 =\t\t\"10000300RR0R\",\r\n  evldd_2 =\t\t\"10000301R8\",\r\n  evldwx_3 =\t\t\"10000302RR0R\",\r\n  evldw_2 =\t\t\"10000303R8\",\r\n  evldhx_3 =\t\t\"10000304RR0R\",\r\n  evldh_2 =\t\t\"10000305R8\",\r\n  evlwhex_3 =\t\t\"10000310RR0R\",\r\n  evlwhe_2 =\t\t\"10000311R4\",\r\n  evlwhoux_3 =\t\t\"10000314RR0R\",\r\n  evlwhou_2 =\t\t\"10000315R4\",\r\n  evlwhosx_3 =\t\t\"10000316RR0R\",\r\n  evlwhos_2 =\t\t\"10000317R4\",\r\n  evstddx_3 =\t\t\"10000320RR0R\",\r\n  evstdd_2 =\t\t\"10000321R8\",\r\n  evstdwx_3 =\t\t\"10000322RR0R\",\r\n  evstdw_2 =\t\t\"10000323R8\",\r\n  evstdhx_3 =\t\t\"10000324RR0R\",\r\n  evstdh_2 =\t\t\"10000325R8\",\r\n  evstwhex_3 =\t\t\"10000330RR0R\",\r\n  evstwhe_2 =\t\t\"10000331R4\",\r\n  evstwhox_3 =\t\t\"10000334RR0R\",\r\n  evstwho_2 =\t\t\"10000335R4\",\r\n  evstwwex_3 =\t\t\"10000338RR0R\",\r\n  evstwwe_2 =\t\t\"10000339R4\",\r\n  evstwwox_3 =\t\t\"1000033cRR0R\",\r\n  evstwwo_2 =\t\t\"1000033dR4\",\r\n  evmhessf_3 =\t\t\"10000403RRR\",\r\n  evmhossf_3 =\t\t\"10000407RRR\",\r\n  evmheumi_3 =\t\t\"10000408RRR\",\r\n  evmhesmi_3 =\t\t\"10000409RRR\",\r\n  evmhesmf_3 =\t\t\"1000040bRRR\",\r\n  evmhoumi_3 =\t\t\"1000040cRRR\",\r\n  evmhosmi_3 =\t\t\"1000040dRRR\",\r\n  evmhosmf_3 =\t\t\"1000040fRRR\",\r\n  evmhessfa_3 =\t\t\"10000423RRR\",\r\n  evmhossfa_3 =\t\t\"10000427RRR\",\r\n  evmheumia_3 =\t\t\"10000428RRR\",\r\n  evmhesmia_3 =\t\t\"10000429RRR\",\r\n  evmhesmfa_3 =\t\t\"1000042bRRR\",\r\n  evmhoumia_3 =\t\t\"1000042cRRR\",\r\n  evmhosmia_3 =\t\t\"1000042dRRR\",\r\n  evmhosmfa_3 =\t\t\"1000042fRRR\",\r\n  evmwhssf_3 =\t\t\"10000447RRR\",\r\n  evmwlumi_3 =\t\t\"10000448RRR\",\r\n  evmwhumi_3 =\t\t\"1000044cRRR\",\r\n  evmwhsmi_3 =\t\t\"1000044dRRR\",\r\n  evmwhsmf_3 =\t\t\"1000044fRRR\",\r\n  evmwssf_3 =\t\t\"10000453RRR\",\r\n  evmwumi_3 =\t\t\"10000458RRR\",\r\n  evmwsmi_3 =\t\t\"10000459RRR\",\r\n  evmwsmf_3 =\t\t\"1000045bRRR\",\r\n  evmwhssfa_3 =\t\t\"10000467RRR\",\r\n  evmwlumia_3 =\t\t\"10000468RRR\",\r\n  evmwhumia_3 =\t\t\"1000046cRRR\",\r\n  evmwhsmia_3 =\t\t\"1000046dRRR\",\r\n  evmwhsmfa_3 =\t\t\"1000046fRRR\",\r\n  evmwssfa_3 =\t\t\"10000473RRR\",\r\n  evmwumia_3 =\t\t\"10000478RRR\",\r\n  evmwsmia_3 =\t\t\"10000479RRR\",\r\n  evmwsmfa_3 =\t\t\"1000047bRRR\",\r\n  evmra_2 =\t\t\"100004c4RR\",\r\n  evdivws_3 =\t\t\"100004c6RRR\",\r\n  evdivwu_3 =\t\t\"100004c7RRR\",\r\n  evmwssfaa_3 =\t\t\"10000553RRR\",\r\n  evmwumiaa_3 =\t\t\"10000558RRR\",\r\n  evmwsmiaa_3 =\t\t\"10000559RRR\",\r\n  evmwsmfaa_3 =\t\t\"1000055bRRR\",\r\n  evmwssfan_3 =\t\t\"100005d3RRR\",\r\n  evmwumian_3 =\t\t\"100005d8RRR\",\r\n  evmwsmian_3 =\t\t\"100005d9RRR\",\r\n  evmwsmfan_3 =\t\t\"100005dbRRR\",\r\n  evmergehilo_3 =\t\"1000022eRRR\",\r\n  evmergelohi_3 =\t\"1000022fRRR\",\r\n  evlhhesplatx_3 =\t\"10000308RR0R\",\r\n  evlhhesplat_2 =\t\"10000309R2\",\r\n  evlhhousplatx_3 =\t\"1000030cRR0R\",\r\n  evlhhousplat_2 =\t\"1000030dR2\",\r\n  evlhhossplatx_3 =\t\"1000030eRR0R\",\r\n  evlhhossplat_2 =\t\"1000030fR2\",\r\n  evlwwsplatx_3 =\t\"10000318RR0R\",\r\n  evlwwsplat_2 =\t\"10000319R4\",\r\n  evlwhsplatx_3 =\t\"1000031cRR0R\",\r\n  evlwhsplat_2 =\t\"1000031dR4\",\r\n  evaddusiaaw_2 =\t\"100004c0RR\",\r\n  evaddssiaaw_2 =\t\"100004c1RR\",\r\n  evsubfusiaaw_2 =\t\"100004c2RR\",\r\n  evsubfssiaaw_2 =\t\"100004c3RR\",\r\n  evaddumiaaw_2 =\t\"100004c8RR\",\r\n  evaddsmiaaw_2 =\t\"100004c9RR\",\r\n  evsubfumiaaw_2 =\t\"100004caRR\",\r\n  evsubfsmiaaw_2 =\t\"100004cbRR\",\r\n  evmheusiaaw_3 =\t\"10000500RRR\",\r\n  evmhessiaaw_3 =\t\"10000501RRR\",\r\n  evmhessfaaw_3 =\t\"10000503RRR\",\r\n  evmhousiaaw_3 =\t\"10000504RRR\",\r\n  evmhossiaaw_3 =\t\"10000505RRR\",\r\n  evmhossfaaw_3 =\t\"10000507RRR\",\r\n  evmheumiaaw_3 =\t\"10000508RRR\",\r\n  evmhesmiaaw_3 =\t\"10000509RRR\",\r\n  evmhesmfaaw_3 =\t\"1000050bRRR\",\r\n  evmhoumiaaw_3 =\t\"1000050cRRR\",\r\n  evmhosmiaaw_3 =\t\"1000050dRRR\",\r\n  evmhosmfaaw_3 =\t\"1000050fRRR\",\r\n  evmhegumiaa_3 =\t\"10000528RRR\",\r\n  evmhegsmiaa_3 =\t\"10000529RRR\",\r\n  evmhegsmfaa_3 =\t\"1000052bRRR\",\r\n  evmhogumiaa_3 =\t\"1000052cRRR\",\r\n  evmhogsmiaa_3 =\t\"1000052dRRR\",\r\n  evmhogsmfaa_3 =\t\"1000052fRRR\",\r\n  evmwlusiaaw_3 =\t\"10000540RRR\",\r\n  evmwlssiaaw_3 =\t\"10000541RRR\",\r\n  evmwlumiaaw_3 =\t\"10000548RRR\",\r\n  evmwlsmiaaw_3 =\t\"10000549RRR\",\r\n  evmheusianw_3 =\t\"10000580RRR\",\r\n  evmhessianw_3 =\t\"10000581RRR\",\r\n  evmhessfanw_3 =\t\"10000583RRR\",\r\n  evmhousianw_3 =\t\"10000584RRR\",\r\n  evmhossianw_3 =\t\"10000585RRR\",\r\n  evmhossfanw_3 =\t\"10000587RRR\",\r\n  evmheumianw_3 =\t\"10000588RRR\",\r\n  evmhesmianw_3 =\t\"10000589RRR\",\r\n  evmhesmfanw_3 =\t\"1000058bRRR\",\r\n  evmhoumianw_3 =\t\"1000058cRRR\",\r\n  evmhosmianw_3 =\t\"1000058dRRR\",\r\n  evmhosmfanw_3 =\t\"1000058fRRR\",\r\n  evmhegumian_3 =\t\"100005a8RRR\",\r\n  evmhegsmian_3 =\t\"100005a9RRR\",\r\n  evmhegsmfan_3 =\t\"100005abRRR\",\r\n  evmhogumian_3 =\t\"100005acRRR\",\r\n  evmhogsmian_3 =\t\"100005adRRR\",\r\n  evmhogsmfan_3 =\t\"100005afRRR\",\r\n  evmwlusianw_3 =\t\"100005c0RRR\",\r\n  evmwlssianw_3 =\t\"100005c1RRR\",\r\n  evmwlumianw_3 =\t\"100005c8RRR\",\r\n  evmwlsmianw_3 =\t\"100005c9RRR\",\r\n\r\n  -- NYI: Book E instructions.\r\n}\r\n\r\n-- Add mnemonics for \".\" variants.\r\ndo\r\n  local t = {}\r\n  for k,v in pairs(map_op) do\r\n    if type(v) == \"string\" and sub(v, -1) == \".\" then\r\n      local v2 = sub(v, 1, 7)..char(byte(v, 8)+1)..sub(v, 9, -2)\r\n      t[sub(k, 1, -3)..\".\"..sub(k, -2)] = v2\r\n    end\r\n  end\r\n  for k,v in pairs(t) do\r\n    map_op[k] = v\r\n  end\r\nend\r\n\r\n-- Add more branch mnemonics.\r\nfor cond,c in pairs(map_cond) do\r\n  local b1 = \"b\"..cond\r\n  local c1 = shl(band(c, 3), 16) + (c < 4 and 0x01000000 or 0)\r\n  -- bX[l]\r\n  map_op[b1..\"_1\"] = tohex(0x40800000 + c1)..\"K\"\r\n  map_op[b1..\"y_1\"] = tohex(0x40a00000 + c1)..\"K\"\r\n  map_op[b1..\"l_1\"] = tohex(0x40800001 + c1)..\"K\"\r\n  map_op[b1..\"_2\"] = tohex(0x40800000 + c1)..\"-XK\"\r\n  map_op[b1..\"y_2\"] = tohex(0x40a00000 + c1)..\"-XK\"\r\n  map_op[b1..\"l_2\"] = tohex(0x40800001 + c1)..\"-XK\"\r\n  -- bXlr[l]\r\n  map_op[b1..\"lr_0\"] = tohex(0x4c800020 + c1)\r\n  map_op[b1..\"lrl_0\"] = tohex(0x4c800021 + c1)\r\n  map_op[b1..\"ctr_0\"] = tohex(0x4c800420 + c1)\r\n  map_op[b1..\"ctrl_0\"] = tohex(0x4c800421 + c1)\r\n  -- bXctr[l]\r\n  map_op[b1..\"lr_1\"] = tohex(0x4c800020 + c1)..\"-X\"\r\n  map_op[b1..\"lrl_1\"] = tohex(0x4c800021 + c1)..\"-X\"\r\n  map_op[b1..\"ctr_1\"] = tohex(0x4c800420 + c1)..\"-X\"\r\n  map_op[b1..\"ctrl_1\"] = tohex(0x4c800421 + c1)..\"-X\"\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function parse_gpr(expr)\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(r[1-3]?[0-9])$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    if not reg then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    expr = reg\r\n  end\r\n  local r = match(expr, \"^r([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r, tp end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_fpr(expr)\r\n  local r = match(expr, \"^f([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_vr(expr)\r\n  local r = match(expr, \"^v([1-3]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 31 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_vs(expr)\r\n  local r = match(expr, \"^vs([1-6]?[0-9])$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    if r <= 63 then return r end\r\n  end\r\n  werror(\"bad register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_cr(expr)\r\n  local r = match(expr, \"^cr([0-7])$\")\r\n  if r then return tonumber(r) end\r\n  werror(\"bad condition register name `\"..expr..\"'\")\r\nend\r\n\r\nlocal function parse_cond(expr)\r\n  local r, cond = match(expr, \"^4%*cr([0-7])%+(%w%w)$\")\r\n  if r then\r\n    r = tonumber(r)\r\n    local c = map_cond[cond]\r\n    if c and c < 4 then return r*4+c end\r\n  end\r\n  werror(\"bad condition bit name `\"..expr..\"'\")\r\nend\r\n\r\nlocal parse_ctx = {}\r\n\r\nlocal loadenv = setfenv and function(s)\r\n  local code = loadstring(s, \"\")\r\n  if code then setfenv(code, parse_ctx) end\r\n  return code\r\nend or function(s)\r\n  return load(s, \"\", nil, parse_ctx)\r\nend\r\n\r\n-- Try to parse simple arithmetic, too, since some basic ops are aliases.\r\nlocal function parse_number(n)\r\n  local x = tonumber(n)\r\n  if x then return x end\r\n  local code = loadenv(\"return \"..n)\r\n  if code then\r\n    local ok, y = pcall(code)\r\n    if ok then return y end\r\n  end\r\n  return nil\r\nend\r\n\r\nlocal function parse_imm(imm, bits, shift, scale, signed)\r\n  local n = parse_number(imm)\r\n  if n then\r\n    local m = sar(n, scale)\r\n    if shl(m, scale) == n then\r\n      if signed then\r\n\tlocal s = sar(m, bits-1)\r\n\tif s == 0 then return shl(m, shift)\r\n\telseif s == -1 then return shl(m + shl(1, bits), shift) end\r\n      else\r\n\tif sar(m, bits) == 0 then return shl(m, shift) end\r\n      end\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^[rfv]([1-3]?[0-9])$\") or\r\n\t match(imm, \"^vs([1-6]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):(r[1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    waction(\"IMM\", (signed and 32768 or 0)+scale*1024+bits*32+shift, imm)\r\n    return 0\r\n  end\r\nend\r\n\r\nlocal function parse_shiftmask(imm, isshift)\r\n  local n = parse_number(imm)\r\n  if n then\r\n    if shr(n, 6) == 0 then\r\n      local lsb = band(n, 31)\r\n      local msb = n - lsb\r\n      return isshift and (shl(lsb, 11)+shr(msb, 4)) or (shl(lsb, 6)+msb)\r\n    end\r\n    werror(\"out of range immediate `\"..imm..\"'\")\r\n  elseif match(imm, \"^r([1-3]?[0-9])$\") or\r\n\t match(imm, \"^([%w_]+):(r[1-3]?[0-9])$\") then\r\n    werror(\"expected immediate operand, got register\")\r\n  else\r\n    waction(\"IMMSH\", isshift and 1 or 0, imm)\r\n    return 0;\r\n  end\r\nend\r\n\r\nlocal function parse_disp(disp)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    return shl(r, 16) + parse_imm(imm, 16, 0, 0, true)\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    if tp then\r\n      waction(\"IMM\", 32768+16*32, format(tp.ctypefmt, tailr))\r\n      return shl(r, 16)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_u5disp(disp, scale)\r\n  local imm, reg = match(disp, \"^(.*)%(([%w_:]+)%)$\")\r\n  if imm then\r\n    local r = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    return shl(r, 16) + parse_imm(imm, 5, 11, scale, false)\r\n  end\r\n  local reg, tailr = match(disp, \"^([%w_:]+)%s*(.*)$\")\r\n  if reg and tailr ~= \"\" then\r\n    local r, tp = parse_gpr(reg)\r\n    if r == 0 then werror(\"cannot use r0 in displacement\") end\r\n    if tp then\r\n      waction(\"IMM\", scale*1024+5*32+11, format(tp.ctypefmt, tailr))\r\n      return shl(r, 16)\r\n    end\r\n  end\r\n  werror(\"bad displacement `\"..disp..\"'\")\r\nend\r\n\r\nlocal function parse_label(label, def)\r\n  local prefix = sub(label, 1, 2)\r\n  -- =>label (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"PC\", 0, sub(label, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"LG\", map_global[sub(label, 3)]\r\n  end\r\n  if def then\r\n    -- [1-9] (local label definition)\r\n    if match(label, \"^[1-9]$\") then\r\n      return \"LG\", 10+tonumber(label)\r\n    end\r\n  else\r\n    -- [<>][1-9] (local label reference)\r\n    local dir, lnum = match(label, \"^([<>])([1-9])$\")\r\n    if dir then -- Fwd: 1-9, Bkwd: 11-19.\r\n      return \"LG\", lnum + (dir == \">\" and 0 or 10)\r\n    end\r\n    -- extern label (extern label reference)\r\n    local extname = match(label, \"^extern%s+(%S+)$\")\r\n    if extname then\r\n      return \"EXT\", map_extern[extname]\r\n    end\r\n  end\r\n  werror(\"bad label `\"..label..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Handle opcodes defined with template strings.\r\nop_template = function(params, template, nparams)\r\n  if not params then return sub(template, 9) end\r\n  local op = tonumber(sub(template, 1, 8), 16)\r\n  local n, rs = 1, 26\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 3 positions (rlwinm).\r\n  if secpos+3 > maxsecpos then wflush() end\r\n  local pos = wpos()\r\n\r\n  -- Process each character.\r\n  for p in gmatch(sub(template, 9), \".\") do\r\n    if p == \"R\" then\r\n      rs = rs - 5; op = op + shl(parse_gpr(params[n]), rs); n = n + 1\r\n    elseif p == \"F\" then\r\n      rs = rs - 5; op = op + shl(parse_fpr(params[n]), rs); n = n + 1\r\n    elseif p == \"V\" then\r\n      rs = rs - 5; op = op + shl(parse_vr(params[n]), rs); n = n + 1\r\n    elseif p == \"Q\" then\r\n      local vs = parse_vs(params[n]); n = n + 1; rs = rs - 5\r\n      local sh = rs == 6 and 2 or 3 + band(shr(rs, 1), 3)\r\n      op = op + shl(band(vs, 31), rs) + shr(band(vs, 32), sh)\r\n    elseif p == \"q\" then\r\n      local vs = parse_vs(params[n]); n = n + 1\r\n      op = op + shl(band(vs, 31), 21) + shr(band(vs, 32), 5)\r\n    elseif p == \"A\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 5, rs, 0, false); n = n + 1\r\n    elseif p == \"S\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 5, rs, 0, true); n = n + 1\r\n    elseif p == \"I\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, true); n = n + 1\r\n    elseif p == \"U\" then\r\n      op = op + parse_imm(params[n], 16, 0, 0, false); n = n + 1\r\n    elseif p == \"D\" then\r\n      op = op + parse_disp(params[n]); n = n + 1\r\n    elseif p == \"2\" then\r\n      op = op + parse_u5disp(params[n], 1); n = n + 1\r\n    elseif p == \"4\" then\r\n      op = op + parse_u5disp(params[n], 2); n = n + 1\r\n    elseif p == \"8\" then\r\n      op = op + parse_u5disp(params[n], 3); n = n + 1\r\n    elseif p == \"C\" then\r\n      rs = rs - 5; op = op + shl(parse_cond(params[n]), rs); n = n + 1\r\n    elseif p == \"X\" then\r\n      rs = rs - 5; op = op + shl(parse_cr(params[n]), rs+2); n = n + 1\r\n    elseif p == \"1\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 1, rs, 0, false); n = n + 1\r\n    elseif p == \"g\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 2, rs, 0, false); n = n + 1\r\n    elseif p == \"3\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 3, rs, 0, false); n = n + 1\r\n    elseif p == \"P\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 4, rs, 0, false); n = n + 1\r\n    elseif p == \"p\" then\r\n      op = op + parse_imm(params[n], 4, rs, 0, false); n = n + 1\r\n    elseif p == \"6\" then\r\n      rs = rs - 6; op = op + parse_imm(params[n], 6, rs, 0, false); n = n + 1\r\n    elseif p == \"Y\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 1, rs+4, 0, false); n = n + 1\r\n    elseif p == \"y\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 1, rs+3, 0, false); n = n + 1\r\n    elseif p == \"Z\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 2, rs+3, 0, false); n = n + 1\r\n    elseif p == \"z\" then\r\n      rs = rs - 5; op = op + parse_imm(params[n], 2, rs+2, 0, false); n = n + 1\r\n    elseif p == \"W\" then\r\n      op = op + parse_cr(params[n]); n = n + 1\r\n    elseif p == \"G\" then\r\n      op = op + parse_imm(params[n], 8, 12, 0, false); n = n + 1\r\n    elseif p == \"H\" then\r\n      op = op + parse_shiftmask(params[n], true); n = n + 1\r\n    elseif p == \"M\" then\r\n      op = op + parse_shiftmask(params[n], false); n = n + 1\r\n    elseif p == \"J\" or p == \"K\" then\r\n      local mode, n, s = parse_label(params[n], false)\r\n      if p == \"K\" then n = n + 2048 end\r\n      waction(\"REL_\"..mode, n, s, 1)\r\n      n = n + 1\r\n    elseif p == \"0\" then\r\n      if band(shr(op, rs), 31) == 0 then werror(\"cannot use r0\") end\r\n    elseif p == \"=\" or p == \"%\" then\r\n      local t = band(shr(op, p == \"%\" and rs+5 or rs), 31)\r\n      rs = rs - 5\r\n      op = op + shl(t, rs)\r\n    elseif p == \"~\" then\r\n      local mm = shl(31, rs)\r\n      local lo = band(op, mm)\r\n      local hi = band(op, shl(mm, 5))\r\n      op = op - lo - hi + shl(lo, 5) + shr(hi, 5)\r\n    elseif p == \":\" then\r\n      if band(shr(op, rs), 1) ~= 0 then werror(\"register pair expected\") end\r\n    elseif p == \"-\" then\r\n      rs = rs - 5\r\n    elseif p == \".\" then\r\n      -- Ignored.\r\n    else\r\n      assert(false)\r\n    end\r\n  end\r\n  wputpos(pos, op)\r\nend\r\n\r\nmap_op[\".template__\"] = op_template\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_1\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local mode, n, s = parse_label(params[1], true)\r\n  if mode == \"EXT\" then werror(\"bad label definition\") end\r\n  waction(\"LABEL_\"..mode, n, s, 1)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nmap_op[\".long_*\"] = function(params)\r\n  if not params then return \"imm...\" end\r\n  for _,p in ipairs(params) do\r\n    local n = tonumber(p)\r\n    if not n then werror(\"bad immediate `\"..p..\"'\") end\r\n    if n < 0 then n = n + 2^32 end\r\n    wputw(n)\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1])\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", align-1, nil, 1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\", num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_proto.h",
    "content": "/*\r\n** DynASM encoding engine prototypes.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#ifndef _DASM_PROTO_H\r\n#define _DASM_PROTO_H\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n\r\n#define DASM_IDENT\t\"DynASM 1.3.0\"\r\n#define DASM_VERSION\t10300\t/* 1.3.0 */\r\n\r\n#ifndef Dst_DECL\r\n#define Dst_DECL\tdasm_State **Dst\r\n#endif\r\n\r\n#ifndef Dst_REF\r\n#define Dst_REF\t\t(*Dst)\r\n#endif\r\n\r\n#ifndef DASM_FDEF\r\n#define DASM_FDEF\textern\r\n#endif\r\n\r\n#ifndef DASM_M_GROW\r\n#define DASM_M_GROW(ctx, t, p, sz, need) \\\r\n  do { \\\r\n    size_t _sz = (sz), _need = (need); \\\r\n    if (_sz < _need) { \\\r\n      if (_sz < 16) _sz = 16; \\\r\n      while (_sz < _need) _sz += _sz; \\\r\n      (p) = (t *)realloc((p), _sz); \\\r\n      if ((p) == NULL) exit(1); \\\r\n      (sz) = _sz; \\\r\n    } \\\r\n  } while(0)\r\n#endif\r\n\r\n#ifndef DASM_M_FREE\r\n#define DASM_M_FREE(ctx, p, sz)\tfree(p)\r\n#endif\r\n\r\n/* Internal DynASM encoder state. */\r\ntypedef struct dasm_State dasm_State;\r\n\r\n\r\n/* Initialize and free DynASM state. */\r\nDASM_FDEF void dasm_init(Dst_DECL, int maxsection);\r\nDASM_FDEF void dasm_free(Dst_DECL);\r\n\r\n/* Setup global array. Must be called before dasm_setup(). */\r\nDASM_FDEF void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl);\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nDASM_FDEF void dasm_growpc(Dst_DECL, unsigned int maxpc);\r\n\r\n/* Setup encoder. */\r\nDASM_FDEF void dasm_setup(Dst_DECL, const void *actionlist);\r\n\r\n/* Feed encoder with actions. Calls are generated by pre-processor. */\r\nDASM_FDEF void dasm_put(Dst_DECL, int start, ...);\r\n\r\n/* Link sections and return the resulting size. */\r\nDASM_FDEF int dasm_link(Dst_DECL, size_t *szp);\r\n\r\n/* Encode sections into buffer. */\r\nDASM_FDEF int dasm_encode(Dst_DECL, void *buffer);\r\n\r\n/* Get PC label offset. */\r\nDASM_FDEF int dasm_getpclabel(Dst_DECL, unsigned int pc);\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nDASM_FDEF int dasm_checkstep(Dst_DECL, int secmatch);\r\n#else\r\n#define dasm_checkstep(a, b)\t0\r\n#endif\r\n\r\n\r\n#endif /* _DASM_PROTO_H */\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_x64.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM x64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n-- This module just sets 64 bit mode for the combined x86/x64 module.\r\n-- All the interesting stuff is there.\r\n------------------------------------------------------------------------------\r\n\r\nx64 = true -- Using a global is an ugly, but effective solution.\r\nreturn require(\"dasm_x86\")\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_x86.h",
    "content": "/*\r\n** DynASM x86 encoding engine.\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n** Released under the MIT license. See dynasm.lua for full copyright notice.\r\n*/\r\n\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n#define DASM_ARCH\t\t\"x86\"\r\n\r\n#ifndef DASM_EXTERN\r\n#define DASM_EXTERN(a,b,c,d)\t0\r\n#endif\r\n\r\n/* Action definitions. DASM_STOP must be 255. */\r\nenum {\r\n  DASM_DISP = 233,\r\n  DASM_IMM_S, DASM_IMM_B, DASM_IMM_W, DASM_IMM_D, DASM_IMM_WB, DASM_IMM_DB,\r\n  DASM_VREG, DASM_SPACE, DASM_SETLABEL, DASM_REL_A, DASM_REL_LG, DASM_REL_PC,\r\n  DASM_IMM_LG, DASM_IMM_PC, DASM_LABEL_LG, DASM_LABEL_PC, DASM_ALIGN,\r\n  DASM_EXTERN, DASM_ESC, DASM_MARK, DASM_SECTION, DASM_STOP\r\n};\r\n\r\n/* Maximum number of section buffer positions for a single dasm_put() call. */\r\n#define DASM_MAXSECPOS\t\t25\r\n\r\n/* DynASM encoder status codes. Action list offset or number are or'ed in. */\r\n#define DASM_S_OK\t\t0x00000000\r\n#define DASM_S_NOMEM\t\t0x01000000\r\n#define DASM_S_PHASE\t\t0x02000000\r\n#define DASM_S_MATCH_SEC\t0x03000000\r\n#define DASM_S_RANGE_I\t\t0x11000000\r\n#define DASM_S_RANGE_SEC\t0x12000000\r\n#define DASM_S_RANGE_LG\t\t0x13000000\r\n#define DASM_S_RANGE_PC\t\t0x14000000\r\n#define DASM_S_RANGE_VREG\t0x15000000\r\n#define DASM_S_UNDEF_L\t\t0x21000000\r\n#define DASM_S_UNDEF_PC\t\t0x22000000\r\n\r\n/* Macros to convert positions (8 bit section + 24 bit index). */\r\n#define DASM_POS2IDX(pos)\t((pos)&0x00ffffff)\r\n#define DASM_POS2BIAS(pos)\t((pos)&0xff000000)\r\n#define DASM_SEC2POS(sec)\t((sec)<<24)\r\n#define DASM_POS2SEC(pos)\t((pos)>>24)\r\n#define DASM_POS2PTR(D, pos)\t(D->sections[DASM_POS2SEC(pos)].rbuf + (pos))\r\n\r\n/* Action list type. */\r\ntypedef const unsigned char *dasm_ActList;\r\n\r\n/* Per-section structure. */\r\ntypedef struct dasm_Section {\r\n  int *rbuf;\t\t/* Biased buffer pointer (negative section bias). */\r\n  int *buf;\t\t/* True buffer pointer. */\r\n  size_t bsize;\t\t/* Buffer size in bytes. */\r\n  int pos;\t\t/* Biased buffer position. */\r\n  int epos;\t\t/* End of biased buffer position - max single put. */\r\n  int ofs;\t\t/* Byte offset into section. */\r\n} dasm_Section;\r\n\r\n/* Core structure holding the DynASM encoding state. */\r\nstruct dasm_State {\r\n  size_t psize;\t\t\t/* Allocated size of this structure. */\r\n  dasm_ActList actionlist;\t/* Current actionlist pointer. */\r\n  int *lglabels;\t\t/* Local/global chain/pos ptrs. */\r\n  size_t lgsize;\r\n  int *pclabels;\t\t/* PC label chains/pos ptrs. */\r\n  size_t pcsize;\r\n  void **globals;\t\t/* Array of globals (bias -10). */\r\n  dasm_Section *section;\t/* Pointer to active section. */\r\n  size_t codesize;\t\t/* Total size of all code sections. */\r\n  int maxsection;\t\t/* 0 <= sectionidx < maxsection. */\r\n  int status;\t\t\t/* Status code. */\r\n  dasm_Section sections[1];\t/* All sections. Alloc-extended. */\r\n};\r\n\r\n/* The size of the core structure depends on the max. number of sections. */\r\n#define DASM_PSZ(ms)\t(sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))\r\n\r\n\r\n/* Initialize DynASM state. */\r\nvoid dasm_init(Dst_DECL, int maxsection)\r\n{\r\n  dasm_State *D;\r\n  size_t psz = 0;\r\n  int i;\r\n  Dst_REF = NULL;\r\n  DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));\r\n  D = Dst_REF;\r\n  D->psize = psz;\r\n  D->lglabels = NULL;\r\n  D->lgsize = 0;\r\n  D->pclabels = NULL;\r\n  D->pcsize = 0;\r\n  D->globals = NULL;\r\n  D->maxsection = maxsection;\r\n  for (i = 0; i < maxsection; i++) {\r\n    D->sections[i].buf = NULL;  /* Need this for pass3. */\r\n    D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);\r\n    D->sections[i].bsize = 0;\r\n    D->sections[i].epos = 0;  /* Wrong, but is recalculated after resize. */\r\n  }\r\n}\r\n\r\n/* Free DynASM state. */\r\nvoid dasm_free(Dst_DECL)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  for (i = 0; i < D->maxsection; i++)\r\n    if (D->sections[i].buf)\r\n      DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);\r\n  if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);\r\n  if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);\r\n  DASM_M_FREE(Dst, D, D->psize);\r\n}\r\n\r\n/* Setup global label array. Must be called before dasm_setup(). */\r\nvoid dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  D->globals = gl - 10;  /* Negative bias to compensate for locals. */\r\n  DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));\r\n}\r\n\r\n/* Grow PC label array. Can be called after dasm_setup(), too. */\r\nvoid dasm_growpc(Dst_DECL, unsigned int maxpc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  size_t osz = D->pcsize;\r\n  DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));\r\n  memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);\r\n}\r\n\r\n/* Setup encoder. */\r\nvoid dasm_setup(Dst_DECL, const void *actionlist)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int i;\r\n  D->actionlist = (dasm_ActList)actionlist;\r\n  D->status = DASM_S_OK;\r\n  D->section = &D->sections[0];\r\n  memset((void *)D->lglabels, 0, D->lgsize);\r\n  if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);\r\n  for (i = 0; i < D->maxsection; i++) {\r\n    D->sections[i].pos = DASM_SEC2POS(i);\r\n    D->sections[i].ofs = 0;\r\n  }\r\n}\r\n\r\n\r\n#ifdef DASM_CHECKS\r\n#define CK(x, st) \\\r\n  do { if (!(x)) { \\\r\n    D->status = DASM_S_##st|(int)(p-D->actionlist-1); return; } } while (0)\r\n#define CKPL(kind, st) \\\r\n  do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \\\r\n    D->status=DASM_S_RANGE_##st|(int)(p-D->actionlist-1); return; } } while (0)\r\n#else\r\n#define CK(x, st)\t((void)0)\r\n#define CKPL(kind, st)\t((void)0)\r\n#endif\r\n\r\n/* Pass 1: Store actions and args, link branches/labels, estimate offsets. */\r\nvoid dasm_put(Dst_DECL, int start, ...)\r\n{\r\n  va_list ap;\r\n  dasm_State *D = Dst_REF;\r\n  dasm_ActList p = D->actionlist + start;\r\n  dasm_Section *sec = D->section;\r\n  int pos = sec->pos, ofs = sec->ofs, mrm = 4;\r\n  int *b;\r\n\r\n  if (pos >= sec->epos) {\r\n    DASM_M_GROW(Dst, int, sec->buf, sec->bsize,\r\n      sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));\r\n    sec->rbuf = sec->buf - DASM_POS2BIAS(pos);\r\n    sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);\r\n  }\r\n\r\n  b = sec->rbuf;\r\n  b[pos++] = start;\r\n\r\n  va_start(ap, start);\r\n  while (1) {\r\n    int action = *p++;\r\n    if (action < DASM_DISP) {\r\n      ofs++;\r\n    } else if (action <= DASM_REL_A) {\r\n      int n = va_arg(ap, int);\r\n      b[pos++] = n;\r\n      switch (action) {\r\n      case DASM_DISP:\r\n\tif (n == 0) { if ((mrm&7) == 4) mrm = p[-2]; if ((mrm&7) != 5) break; }\r\n      case DASM_IMM_DB: if (((n+128)&-256) == 0) goto ob;\r\n      case DASM_REL_A: /* Assumes ptrdiff_t is int. !x64 */\r\n      case DASM_IMM_D: ofs += 4; break;\r\n      case DASM_IMM_S: CK(((n+128)&-256) == 0, RANGE_I); goto ob;\r\n      case DASM_IMM_B: CK((n&-256) == 0, RANGE_I); ob: ofs++; break;\r\n      case DASM_IMM_WB: if (((n+128)&-256) == 0) goto ob;\r\n      case DASM_IMM_W: CK((n&-65536) == 0, RANGE_I); ofs += 2; break;\r\n      case DASM_SPACE: p++; ofs += n; break;\r\n      case DASM_SETLABEL: b[pos-2] = -0x40000000; break;  /* Neg. label ofs. */\r\n      case DASM_VREG: CK((n&-8) == 0 && (n != 4 || (*p&1) == 0), RANGE_VREG);\r\n\tif (*p++ == 1 && *p == DASM_DISP) mrm = n; continue;\r\n      }\r\n      mrm = 4;\r\n    } else {\r\n      int *pl, n;\r\n      switch (action) {\r\n      case DASM_REL_LG:\r\n      case DASM_IMM_LG:\r\n\tn = *p++; pl = D->lglabels + n;\r\n\t/* Bkwd rel or global. */\r\n\tif (n <= 246) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }\r\n\tpl -= 246; n = *pl;\r\n\tif (n < 0) n = 0;  /* Start new chain for fwd rel if label exists. */\r\n\tgoto linkrel;\r\n      case DASM_REL_PC:\r\n      case DASM_IMM_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);\r\n      putrel:\r\n\tn = *pl;\r\n\tif (n < 0) {  /* Label exists. Get label pos and store it. */\r\n\t  b[pos] = -n;\r\n\t} else {\r\n      linkrel:\r\n\t  b[pos] = n;  /* Else link to rel chain, anchored at label. */\r\n\t  *pl = pos;\r\n\t}\r\n\tpos++;\r\n\tofs += 4;  /* Maximum offset needed. */\r\n\tif (action == DASM_REL_LG || action == DASM_REL_PC)\r\n\t  b[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_LABEL_LG: pl = D->lglabels + *p++; CKPL(lg, LG); goto putlabel;\r\n      case DASM_LABEL_PC: pl = D->pclabels + va_arg(ap, int); CKPL(pc, PC);\r\n      putlabel:\r\n\tn = *pl;  /* n > 0: Collapse rel chain and replace with label pos. */\r\n\twhile (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos; }\r\n\t*pl = -pos;  /* Label exists now. */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_ALIGN:\r\n\tofs += *p++;  /* Maximum alignment needed (arg is 2**n-1). */\r\n\tb[pos++] = ofs;  /* Store pass1 offset estimate. */\r\n\tbreak;\r\n      case DASM_EXTERN: p += 2; ofs += 4; break;\r\n      case DASM_ESC: p++; ofs++; break;\r\n      case DASM_MARK: mrm = p[-2]; break;\r\n      case DASM_SECTION:\r\n\tn = *p; CK(n < D->maxsection, RANGE_SEC); D->section = &D->sections[n];\r\n      case DASM_STOP: goto stop;\r\n      }\r\n    }\r\n  }\r\nstop:\r\n  va_end(ap);\r\n  sec->pos = pos;\r\n  sec->ofs = ofs;\r\n}\r\n#undef CK\r\n\r\n/* Pass 2: Link sections, shrink branches/aligns, fix label offsets. */\r\nint dasm_link(Dst_DECL, size_t *szp)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  int secnum;\r\n  int ofs = 0;\r\n\r\n#ifdef DASM_CHECKS\r\n  *szp = 0;\r\n  if (D->status != DASM_S_OK) return D->status;\r\n  {\r\n    int pc;\r\n    for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)\r\n      if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;\r\n  }\r\n#endif\r\n\r\n  { /* Handle globals not defined in this translation unit. */\r\n    int idx;\r\n    for (idx = 10; idx*sizeof(int) < D->lgsize; idx++) {\r\n      int n = D->lglabels[idx];\r\n      /* Undefined label: Collapse rel chain and replace with marker (< 0). */\r\n      while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }\r\n    }\r\n  }\r\n\r\n  /* Combine all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->rbuf;\r\n    int pos = DASM_SEC2POS(secnum);\r\n    int lastpos = sec->pos;\r\n\r\n    while (pos != lastpos) {\r\n      dasm_ActList p = D->actionlist + b[pos++];\r\n      while (1) {\r\n\tint op, action = *p++;\r\n\tswitch (action) {\r\n\tcase DASM_REL_LG: p++; op = p[-3]; goto rel_pc;\r\n\tcase DASM_REL_PC: op = p[-2]; rel_pc: {\r\n\t  int shrink = op == 0xe9 ? 3 : ((op&0xf0) == 0x80 ? 4 : 0);\r\n\t  if (shrink) {  /* Shrinkable branch opcode? */\r\n\t    int lofs, lpos = b[pos];\r\n\t    if (lpos < 0) goto noshrink;  /* Ext global? */\r\n\t    lofs = *DASM_POS2PTR(D, lpos);\r\n\t    if (lpos > pos) {  /* Fwd label: add cumulative section offsets. */\r\n\t      int i;\r\n\t      for (i = secnum; i < DASM_POS2SEC(lpos); i++)\r\n\t\tlofs += D->sections[i].ofs;\r\n\t    } else {\r\n\t      lofs -= ofs;  /* Bkwd label: unfix offset. */\r\n\t    }\r\n\t    lofs -= b[pos+1];  /* Short branch ok? */\r\n\t    if (lofs >= -128-shrink && lofs <= 127) ofs -= shrink;  /* Yes. */\r\n\t    else { noshrink: shrink = 0; }  /* No, cannot shrink op. */\r\n\t  }\r\n\t  b[pos+1] = shrink;\r\n\t  pos += 2;\r\n\t  break;\r\n\t}\r\n\tcase DASM_SPACE: case DASM_IMM_LG: case DASM_VREG: p++;\r\n\tcase DASM_DISP: case DASM_IMM_S: case DASM_IMM_B: case DASM_IMM_W:\r\n\tcase DASM_IMM_D: case DASM_IMM_WB: case DASM_IMM_DB:\r\n\tcase DASM_SETLABEL: case DASM_REL_A: case DASM_IMM_PC: pos++; break;\r\n\tcase DASM_LABEL_LG: p++;\r\n\tcase DASM_LABEL_PC: b[pos++] += ofs; break; /* Fix label offset. */\r\n\tcase DASM_ALIGN: ofs -= (b[pos++]+ofs)&*p++; break; /* Adjust ofs. */\r\n\tcase DASM_EXTERN: p += 2; break;\r\n\tcase DASM_ESC: p++; break;\r\n\tcase DASM_MARK: break;\r\n\tcase DASM_SECTION: case DASM_STOP: goto stop;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n    ofs += sec->ofs;  /* Next section starts right after current section. */\r\n  }\r\n\r\n  D->codesize = ofs;  /* Total size of all code sections */\r\n  *szp = ofs;\r\n  return DASM_S_OK;\r\n}\r\n\r\n#define dasmb(x)\t*cp++ = (unsigned char)(x)\r\n#ifndef DASM_ALIGNED_WRITES\r\n#define dasmw(x) \\\r\n  do { *((unsigned short *)cp) = (unsigned short)(x); cp+=2; } while (0)\r\n#define dasmd(x) \\\r\n  do { *((unsigned int *)cp) = (unsigned int)(x); cp+=4; } while (0)\r\n#else\r\n#define dasmw(x)\tdo { dasmb(x); dasmb((x)>>8); } while (0)\r\n#define dasmd(x)\tdo { dasmw(x); dasmw((x)>>16); } while (0)\r\n#endif\r\n\r\n/* Pass 3: Encode sections. */\r\nint dasm_encode(Dst_DECL, void *buffer)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  unsigned char *base = (unsigned char *)buffer;\r\n  unsigned char *cp = base;\r\n  int secnum;\r\n\r\n  /* Encode all code sections. No support for data sections (yet). */\r\n  for (secnum = 0; secnum < D->maxsection; secnum++) {\r\n    dasm_Section *sec = D->sections + secnum;\r\n    int *b = sec->buf;\r\n    int *endb = sec->rbuf + sec->pos;\r\n\r\n    while (b != endb) {\r\n      dasm_ActList p = D->actionlist + *b++;\r\n      unsigned char *mark = NULL;\r\n      while (1) {\r\n\tint action = *p++;\r\n\tint n = (action >= DASM_DISP && action <= DASM_ALIGN) ? *b++ : 0;\r\n\tswitch (action) {\r\n\tcase DASM_DISP: if (!mark) mark = cp; {\r\n\t  unsigned char *mm = mark;\r\n\t  if (*p != DASM_IMM_DB && *p != DASM_IMM_WB) mark = NULL;\r\n\t  if (n == 0) { int mrm = mm[-1]&7; if (mrm == 4) mrm = mm[0]&7;\r\n\t    if (mrm != 5) { mm[-1] -= 0x80; break; } }\r\n\t  if (((n+128) & -256) != 0) goto wd; else mm[-1] -= 0x40;\r\n\t}\r\n\tcase DASM_IMM_S: case DASM_IMM_B: wb: dasmb(n); break;\r\n\tcase DASM_IMM_DB: if (((n+128)&-256) == 0) {\r\n\t    db: if (!mark) mark = cp; mark[-2] += 2; mark = NULL; goto wb;\r\n\t  } else mark = NULL;\r\n\tcase DASM_IMM_D: wd: dasmd(n); break;\r\n\tcase DASM_IMM_WB: if (((n+128)&-256) == 0) goto db; else mark = NULL;\r\n\tcase DASM_IMM_W: dasmw(n); break;\r\n\tcase DASM_VREG: { int t = *p++; if (t >= 2) n<<=3; cp[-1] |= n; break; }\r\n\tcase DASM_REL_LG: p++; if (n >= 0) goto rel_pc;\r\n\t  b++; n = (int)(ptrdiff_t)D->globals[-n];\r\n\tcase DASM_REL_A: rel_a: n -= (int)(ptrdiff_t)(cp+4); goto wd; /* !x64 */\r\n\tcase DASM_REL_PC: rel_pc: {\r\n\t  int shrink = *b++;\r\n\t  int *pb = DASM_POS2PTR(D, n); if (*pb < 0) { n = pb[1]; goto rel_a; }\r\n\t  n = *pb - ((int)(cp-base) + 4-shrink);\r\n\t  if (shrink == 0) goto wd;\r\n\t  if (shrink == 4) { cp--; cp[-1] = *cp-0x10; } else cp[-1] = 0xeb;\r\n\t  goto wb;\r\n\t}\r\n\tcase DASM_IMM_LG:\r\n\t  p++; if (n < 0) { n = (int)(ptrdiff_t)D->globals[-n]; goto wd; }\r\n\tcase DASM_IMM_PC: {\r\n\t  int *pb = DASM_POS2PTR(D, n);\r\n\t  n = *pb < 0 ? pb[1] : (*pb + (int)(ptrdiff_t)base);\r\n\t  goto wd;\r\n\t}\r\n\tcase DASM_LABEL_LG: {\r\n\t  int idx = *p++;\r\n\t  if (idx >= 10)\r\n\t    D->globals[idx] = (void *)(base + (*p == DASM_SETLABEL ? *b : n));\r\n\t  break;\r\n\t}\r\n\tcase DASM_LABEL_PC: case DASM_SETLABEL: break;\r\n\tcase DASM_SPACE: { int fill = *p++; while (n--) *cp++ = fill; break; }\r\n\tcase DASM_ALIGN:\r\n\t  n = *p++;\r\n\t  while (((cp-base) & n)) *cp++ = 0x90; /* nop */\r\n\t  break;\r\n\tcase DASM_EXTERN: n = DASM_EXTERN(Dst, cp, p[1], *p); p += 2; goto wd;\r\n\tcase DASM_MARK: mark = cp; break;\r\n\tcase DASM_ESC: action = *p++;\r\n\tdefault: *cp++ = action; break;\r\n\tcase DASM_SECTION: case DASM_STOP: goto stop;\r\n\t}\r\n      }\r\n      stop: (void)0;\r\n    }\r\n  }\r\n\r\n  if (base + D->codesize != cp)  /* Check for phase errors. */\r\n    return DASM_S_PHASE;\r\n  return DASM_S_OK;\r\n}\r\n\r\n/* Get PC label offset. */\r\nint dasm_getpclabel(Dst_DECL, unsigned int pc)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (pc*sizeof(int) < D->pcsize) {\r\n    int pos = D->pclabels[pc];\r\n    if (pos < 0) return *DASM_POS2PTR(D, -pos);\r\n    if (pos > 0) return -1;  /* Undefined. */\r\n  }\r\n  return -2;  /* Unused or out of range. */\r\n}\r\n\r\n#ifdef DASM_CHECKS\r\n/* Optional sanity checker to call between isolated encoding steps. */\r\nint dasm_checkstep(Dst_DECL, int secmatch)\r\n{\r\n  dasm_State *D = Dst_REF;\r\n  if (D->status == DASM_S_OK) {\r\n    int i;\r\n    for (i = 1; i <= 9; i++) {\r\n      if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_L|i; break; }\r\n      D->lglabels[i] = 0;\r\n    }\r\n  }\r\n  if (D->status == DASM_S_OK && secmatch >= 0 &&\r\n      D->section != &D->sections[secmatch])\r\n    D->status = DASM_S_MATCH_SEC|(int)(D->section-D->sections);\r\n  return D->status;\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dasm_x86.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM x86/x64 module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See dynasm.lua for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\nlocal x64 = x64\r\n\r\n-- Module information:\r\nlocal _info = {\r\n  arch =\tx64 and \"x64\" or \"x86\",\r\n  description =\t\"DynASM x86/x64 module\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  license =\t\"MIT\",\r\n}\r\n\r\n-- Exported glue functions for the arch-specific module.\r\nlocal _M = { _info = _info }\r\n\r\n-- Cache library functions.\r\nlocal type, tonumber, pairs, ipairs = type, tonumber, pairs, ipairs\r\nlocal assert, unpack, setmetatable = assert, unpack or table.unpack, setmetatable\r\nlocal _s = string\r\nlocal sub, format, byte, char = _s.sub, _s.format, _s.byte, _s.char\r\nlocal find, match, gmatch, gsub = _s.find, _s.match, _s.gmatch, _s.gsub\r\nlocal concat, sort = table.concat, table.sort\r\nlocal bit = bit or require(\"bit\")\r\nlocal band, shl, shr = bit.band, bit.lshift, bit.rshift\r\n\r\n-- Inherited tables and callbacks.\r\nlocal g_opt, g_arch\r\nlocal wline, werror, wfatal, wwarn\r\n\r\n-- Action name list.\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal action_names = {\r\n  -- int arg, 1 buffer pos:\r\n  \"DISP\",  \"IMM_S\", \"IMM_B\", \"IMM_W\", \"IMM_D\",  \"IMM_WB\", \"IMM_DB\",\r\n  -- action arg (1 byte), int arg, 1 buffer pos (reg/num):\r\n  \"VREG\", \"SPACE\", -- !x64: VREG support NYI.\r\n  -- ptrdiff_t arg, 1 buffer pos (address): !x64\r\n  \"SETLABEL\", \"REL_A\",\r\n  -- action arg (1 byte) or int arg, 2 buffer pos (link, offset):\r\n  \"REL_LG\", \"REL_PC\",\r\n  -- action arg (1 byte) or int arg, 1 buffer pos (link):\r\n  \"IMM_LG\", \"IMM_PC\",\r\n  -- action arg (1 byte) or int arg, 1 buffer pos (offset):\r\n  \"LABEL_LG\", \"LABEL_PC\",\r\n  -- action arg (1 byte), 1 buffer pos (offset):\r\n  \"ALIGN\",\r\n  -- action args (2 bytes), no buffer pos.\r\n  \"EXTERN\",\r\n  -- action arg (1 byte), no buffer pos.\r\n  \"ESC\",\r\n  -- no action arg, no buffer pos.\r\n  \"MARK\",\r\n  -- action arg (1 byte), no buffer pos, terminal action:\r\n  \"SECTION\",\r\n  -- no args, no buffer pos, terminal action:\r\n  \"STOP\"\r\n}\r\n\r\n-- Maximum number of section buffer positions for dasm_put().\r\n-- CHECK: Keep this in sync with the C code!\r\nlocal maxsecpos = 25 -- Keep this low, to avoid excessively long C lines.\r\n\r\n-- Action name -> action number (dynamically generated below).\r\nlocal map_action = {}\r\n-- First action number. Everything below does not need to be escaped.\r\nlocal actfirst = 256-#action_names\r\n\r\n-- Action list buffer and string (only used to remove dupes).\r\nlocal actlist = {}\r\nlocal actstr = \"\"\r\n\r\n-- Argument list for next dasm_put(). Start with offset 0 into action list.\r\nlocal actargs = { 0 }\r\n\r\n-- Current number of section buffer positions for dasm_put().\r\nlocal secpos = 1\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Compute action numbers for action names.\r\nfor n,name in ipairs(action_names) do\r\n  local num = actfirst + n - 1\r\n  map_action[name] = num\r\nend\r\n\r\n-- Dump action names and numbers.\r\nlocal function dumpactions(out)\r\n  out:write(\"DynASM encoding engine action codes:\\n\")\r\n  for n,name in ipairs(action_names) do\r\n    local num = map_action[name]\r\n    out:write(format(\"  %-10s %02X  %d\\n\", name, num, num))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write action list buffer as a huge static C array.\r\nlocal function writeactions(out, name)\r\n  local nn = #actlist\r\n  local last = actlist[nn] or 255\r\n  actlist[nn] = nil -- Remove last byte.\r\n  if nn == 0 then nn = 1 end\r\n  out:write(\"static const unsigned char \", name, \"[\", nn, \"] = {\\n\")\r\n  local s = \"  \"\r\n  for n,b in ipairs(actlist) do\r\n    s = s..b..\",\"\r\n    if #s >= 75 then\r\n      assert(out:write(s, \"\\n\"))\r\n      s = \"  \"\r\n    end\r\n  end\r\n  out:write(s, last, \"\\n};\\n\\n\") -- Add last byte back.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add byte to action list.\r\nlocal function wputxb(n)\r\n  assert(n >= 0 and n <= 255 and n % 1 == 0, \"byte out of range\")\r\n  actlist[#actlist+1] = n\r\nend\r\n\r\n-- Add action to list with optional arg. Advance buffer pos, too.\r\nlocal function waction(action, a, num)\r\n  wputxb(assert(map_action[action], \"bad action name `\"..action..\"'\"))\r\n  if a then actargs[#actargs+1] = a end\r\n  if a or num then secpos = secpos + (num or 1) end\r\nend\r\n\r\n-- Add call to embedded DynASM C code.\r\nlocal function wcall(func, args)\r\n  wline(format(\"dasm_%s(Dst, %s);\", func, concat(args, \", \")), true)\r\nend\r\n\r\n-- Delete duplicate action list chunks. A tad slow, but so what.\r\nlocal function dedupechunk(offset)\r\n  local al, as = actlist, actstr\r\n  local chunk = char(unpack(al, offset+1, #al))\r\n  local orig = find(as, chunk, 1, true)\r\n  if orig then\r\n    actargs[1] = orig-1 -- Replace with original offset.\r\n    for i=offset+1,#al do al[i] = nil end -- Kill dupe.\r\n  else\r\n    actstr = as..chunk\r\n  end\r\nend\r\n\r\n-- Flush action list (intervening C code or buffer pos overflow).\r\nlocal function wflush(term)\r\n  local offset = actargs[1]\r\n  if #actlist == offset then return end -- Nothing to flush.\r\n  if not term then waction(\"STOP\") end -- Terminate action list.\r\n  dedupechunk(offset)\r\n  wcall(\"put\", actargs) -- Add call to dasm_put().\r\n  actargs = { #actlist } -- Actionlist offset is 1st arg to next dasm_put().\r\n  secpos = 1 -- The actionlist offset occupies a buffer position, too.\r\nend\r\n\r\n-- Put escaped byte.\r\nlocal function wputb(n)\r\n  if n >= actfirst then waction(\"ESC\") end -- Need to escape byte.\r\n  wputxb(n)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Global label name -> global label number. With auto assignment on 1st use.\r\nlocal next_global = 10\r\nlocal map_global = setmetatable({}, { __index = function(t, name)\r\n  if not match(name, \"^[%a_][%w_@]*$\") then werror(\"bad global label\") end\r\n  local n = next_global\r\n  if n > 246 then werror(\"too many global labels\") end\r\n  next_global = n + 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump global labels.\r\nlocal function dumpglobals(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"Global labels:\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write global label enum.\r\nlocal function writeglobals(out, prefix)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"enum {\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(\"  \", prefix, gsub(t[i], \"@.*\", \"\"), \",\\n\")\r\n  end\r\n  out:write(\"  \", prefix, \"_MAX\\n};\\n\")\r\nend\r\n\r\n-- Write global label names.\r\nlocal function writeglobalnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_global) do t[n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=10,next_global-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Extern label name -> extern label number. With auto assignment on 1st use.\r\nlocal next_extern = -1\r\nlocal map_extern = setmetatable({}, { __index = function(t, name)\r\n  -- No restrictions on the name for now.\r\n  local n = next_extern\r\n  if n < -256 then werror(\"too many extern labels\") end\r\n  next_extern = n - 1\r\n  t[name] = n\r\n  return n\r\nend})\r\n\r\n-- Dump extern labels.\r\nlocal function dumpexterns(out, lvl)\r\n  local t = {}\r\n  for name, n in pairs(map_extern) do t[-n] = name end\r\n  out:write(\"Extern labels:\\n\")\r\n  for i=1,-next_extern-1 do\r\n    out:write(format(\"  %s\\n\", t[i]))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Write extern label names.\r\nlocal function writeexternnames(out, name)\r\n  local t = {}\r\n  for name, n in pairs(map_extern) do t[-n] = name end\r\n  out:write(\"static const char *const \", name, \"[] = {\\n\")\r\n  for i=1,-next_extern-1 do\r\n    out:write(\"  \\\"\", t[i], \"\\\",\\n\")\r\n  end\r\n  out:write(\"  (const char *)0\\n};\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arch-specific maps.\r\nlocal map_archdef = {}\t\t-- Ext. register name -> int. name.\r\nlocal map_reg_rev = {}\t\t-- Int. register name -> ext. name.\r\nlocal map_reg_num = {}\t\t-- Int. register name -> register number.\r\nlocal map_reg_opsize = {}\t-- Int. register name -> operand size.\r\nlocal map_reg_valid_base = {}\t-- Int. register name -> valid base register?\r\nlocal map_reg_valid_index = {}\t-- Int. register name -> valid index register?\r\nlocal map_reg_needrex = {}\t-- Int. register name -> need rex vs. no rex.\r\nlocal reg_list = {}\t\t-- Canonical list of int. register names.\r\n\r\nlocal map_type = {}\t\t-- Type name -> { ctype, reg }\r\nlocal ctypenum = 0\t\t-- Type number (for _PTx macros).\r\n\r\nlocal addrsize = x64 and \"q\" or \"d\"\t-- Size for address operands.\r\n\r\n-- Helper functions to fill register maps.\r\nlocal function mkrmap(sz, cl, names)\r\n  local cname = format(\"@%s\", sz)\r\n  reg_list[#reg_list+1] = cname\r\n  map_archdef[cl] = cname\r\n  map_reg_rev[cname] = cl\r\n  map_reg_num[cname] = -1\r\n  map_reg_opsize[cname] = sz\r\n  if sz == addrsize or sz == \"d\" then\r\n    map_reg_valid_base[cname] = true\r\n    map_reg_valid_index[cname] = true\r\n  end\r\n  if names then\r\n    for n,name in ipairs(names) do\r\n      local iname = format(\"@%s%x\", sz, n-1)\r\n      reg_list[#reg_list+1] = iname\r\n      map_archdef[name] = iname\r\n      map_reg_rev[iname] = name\r\n      map_reg_num[iname] = n-1\r\n      map_reg_opsize[iname] = sz\r\n      if sz == \"b\" and n > 4 then map_reg_needrex[iname] = false end\r\n      if sz == addrsize or sz == \"d\" then\r\n\tmap_reg_valid_base[iname] = true\r\n\tmap_reg_valid_index[iname] = true\r\n      end\r\n    end\r\n  end\r\n  for i=0,(x64 and sz ~= \"f\") and 15 or 7 do\r\n    local needrex = sz == \"b\" and i > 3\r\n    local iname = format(\"@%s%x%s\", sz, i, needrex and \"R\" or \"\")\r\n    if needrex then map_reg_needrex[iname] = true end\r\n    local name\r\n    if sz == \"o\" then name = format(\"xmm%d\", i)\r\n    elseif sz == \"f\" then name = format(\"st%d\", i)\r\n    else name = format(\"r%d%s\", i, sz == addrsize and \"\" or sz) end\r\n    map_archdef[name] = iname\r\n    if not map_reg_rev[iname] then\r\n      reg_list[#reg_list+1] = iname\r\n      map_reg_rev[iname] = name\r\n      map_reg_num[iname] = i\r\n      map_reg_opsize[iname] = sz\r\n      if sz == addrsize or sz == \"d\" then\r\n\tmap_reg_valid_base[iname] = true\r\n\tmap_reg_valid_index[iname] = true\r\n      end\r\n    end\r\n  end\r\n  reg_list[#reg_list+1] = \"\"\r\nend\r\n\r\n-- Integer registers (qword, dword, word and byte sized).\r\nif x64 then\r\n  mkrmap(\"q\", \"Rq\", {\"rax\", \"rcx\", \"rdx\", \"rbx\", \"rsp\", \"rbp\", \"rsi\", \"rdi\"})\r\nend\r\nmkrmap(\"d\", \"Rd\", {\"eax\", \"ecx\", \"edx\", \"ebx\", \"esp\", \"ebp\", \"esi\", \"edi\"})\r\nmkrmap(\"w\", \"Rw\", {\"ax\", \"cx\", \"dx\", \"bx\", \"sp\", \"bp\", \"si\", \"di\"})\r\nmkrmap(\"b\", \"Rb\", {\"al\", \"cl\", \"dl\", \"bl\", \"ah\", \"ch\", \"dh\", \"bh\"})\r\nmap_reg_valid_index[map_archdef.esp] = false\r\nif x64 then map_reg_valid_index[map_archdef.rsp] = false end\r\nmap_archdef[\"Ra\"] = \"@\"..addrsize\r\n\r\n-- FP registers (internally tword sized, but use \"f\" as operand size).\r\nmkrmap(\"f\", \"Rf\")\r\n\r\n-- SSE registers (oword sized, but qword and dword accessible).\r\nmkrmap(\"o\", \"xmm\")\r\n\r\n-- Operand size prefixes to codes.\r\nlocal map_opsize = {\r\n  byte = \"b\", word = \"w\", dword = \"d\", qword = \"q\", oword = \"o\", tword = \"t\",\r\n  aword = addrsize,\r\n}\r\n\r\n-- Operand size code to number.\r\nlocal map_opsizenum = {\r\n  b = 1, w = 2, d = 4, q = 8, o = 16, t = 10,\r\n}\r\n\r\n-- Operand size code to name.\r\nlocal map_opsizename = {\r\n  b = \"byte\", w = \"word\", d = \"dword\", q = \"qword\", o = \"oword\", t = \"tword\",\r\n  f = \"fpword\",\r\n}\r\n\r\n-- Valid index register scale factors.\r\nlocal map_xsc = {\r\n  [\"1\"] = 0, [\"2\"] = 1, [\"4\"] = 2, [\"8\"] = 3,\r\n}\r\n\r\n-- Condition codes.\r\nlocal map_cc = {\r\n  o = 0, no = 1, b = 2, nb = 3, e = 4, ne = 5, be = 6, nbe = 7,\r\n  s = 8, ns = 9, p = 10, np = 11, l = 12, nl = 13, le = 14, nle = 15,\r\n  c = 2, nae = 2, nc = 3, ae = 3, z = 4, nz = 5, na = 6, a = 7,\r\n  pe = 10, po = 11, nge = 12, ge = 13, ng = 14, g = 15,\r\n}\r\n\r\n\r\n-- Reverse defines for registers.\r\nfunction _M.revdef(s)\r\n  return gsub(s, \"@%w+\", map_reg_rev)\r\nend\r\n\r\n-- Dump register names and numbers\r\nlocal function dumpregs(out)\r\n  out:write(\"Register names, sizes and internal numbers:\\n\")\r\n  for _,reg in ipairs(reg_list) do\r\n    if reg == \"\" then\r\n      out:write(\"\\n\")\r\n    else\r\n      local name = map_reg_rev[reg]\r\n      local num = map_reg_num[reg]\r\n      local opsize = map_opsizename[map_reg_opsize[reg]]\r\n      out:write(format(\"  %-5s %-8s %s\\n\", name, opsize,\r\n\t\t       num < 0 and \"(variable)\" or num))\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Put action for label arg (IMM_LG, IMM_PC, REL_LG, REL_PC).\r\nlocal function wputlabel(aprefix, imm, num)\r\n  if type(imm) == \"number\" then\r\n    if imm < 0 then\r\n      waction(\"EXTERN\")\r\n      wputxb(aprefix == \"IMM_\" and 0 or 1)\r\n      imm = -imm-1\r\n    else\r\n      waction(aprefix..\"LG\", nil, num);\r\n    end\r\n    wputxb(imm)\r\n  else\r\n    waction(aprefix..\"PC\", imm, num)\r\n  end\r\nend\r\n\r\n-- Put signed byte or arg.\r\nlocal function wputsbarg(n)\r\n  if type(n) == \"number\" then\r\n    if n < -128 or n > 127 then\r\n      werror(\"signed immediate byte out of range\")\r\n    end\r\n    if n < 0 then n = n + 256 end\r\n    wputb(n)\r\n  else waction(\"IMM_S\", n) end\r\nend\r\n\r\n-- Put unsigned byte or arg.\r\nlocal function wputbarg(n)\r\n  if type(n) == \"number\" then\r\n    if n < 0 or n > 255 then\r\n      werror(\"unsigned immediate byte out of range\")\r\n    end\r\n    wputb(n)\r\n  else waction(\"IMM_B\", n) end\r\nend\r\n\r\n-- Put unsigned word or arg.\r\nlocal function wputwarg(n)\r\n  if type(n) == \"number\" then\r\n    if shr(n, 16) ~= 0 then\r\n      werror(\"unsigned immediate word out of range\")\r\n    end\r\n    wputb(band(n, 255)); wputb(shr(n, 8));\r\n  else waction(\"IMM_W\", n) end\r\nend\r\n\r\n-- Put signed or unsigned dword or arg.\r\nlocal function wputdarg(n)\r\n  local tn = type(n)\r\n  if tn == \"number\" then\r\n    wputb(band(n, 255))\r\n    wputb(band(shr(n, 8), 255))\r\n    wputb(band(shr(n, 16), 255))\r\n    wputb(shr(n, 24))\r\n  elseif tn == \"table\" then\r\n    wputlabel(\"IMM_\", n[1], 1)\r\n  else\r\n    waction(\"IMM_D\", n)\r\n  end\r\nend\r\n\r\n-- Put operand-size dependent number or arg (defaults to dword).\r\nlocal function wputszarg(sz, n)\r\n  if not sz or sz == \"d\" or sz == \"q\" then wputdarg(n)\r\n  elseif sz == \"w\" then wputwarg(n)\r\n  elseif sz == \"b\" then wputbarg(n)\r\n  elseif sz == \"s\" then wputsbarg(n)\r\n  else werror(\"bad operand size\") end\r\nend\r\n\r\n-- Put multi-byte opcode with operand-size dependent modifications.\r\nlocal function wputop(sz, op, rex)\r\n  local r\r\n  if rex ~= 0 and not x64 then werror(\"bad operand size\") end\r\n  if sz == \"w\" then wputb(102) end\r\n  -- Needs >32 bit numbers, but only for crc32 eax, word [ebx]\r\n  if op >= 4294967296 then r = op%4294967296 wputb((op-r)/4294967296) op = r end\r\n  if op >= 16777216 then wputb(shr(op, 24)); op = band(op, 0xffffff) end\r\n  if op >= 65536 then\r\n    if rex ~= 0 then\r\n      local opc3 = band(op, 0xffff00)\r\n      if opc3 == 0x0f3a00 or opc3 == 0x0f3800 then\r\n\twputb(64 + band(rex, 15)); rex = 0\r\n      end\r\n    end\r\n    wputb(shr(op, 16)); op = band(op, 0xffff)\r\n  end\r\n  if op >= 256 then\r\n    local b = shr(op, 8)\r\n    if b == 15 and rex ~= 0 then wputb(64 + band(rex, 15)); rex = 0 end\r\n    wputb(b)\r\n    op = band(op, 255)\r\n  end\r\n  if rex ~= 0 then wputb(64 + band(rex, 15)) end\r\n  if sz == \"b\" then op = op - 1 end\r\n  wputb(op)\r\nend\r\n\r\n-- Put ModRM or SIB formatted byte.\r\nlocal function wputmodrm(m, s, rm, vs, vrm)\r\n  assert(m < 4 and s < 16 and rm < 16, \"bad modrm operands\")\r\n  wputb(shl(m, 6) + shl(band(s, 7), 3) + band(rm, 7))\r\nend\r\n\r\n-- Put ModRM/SIB plus optional displacement.\r\nlocal function wputmrmsib(t, imark, s, vsreg)\r\n  local vreg, vxreg\r\n  local reg, xreg = t.reg, t.xreg\r\n  if reg and reg < 0 then reg = 0; vreg = t.vreg end\r\n  if xreg and xreg < 0 then xreg = 0; vxreg = t.vxreg end\r\n  if s < 0 then s = 0 end\r\n\r\n  -- Register mode.\r\n  if sub(t.mode, 1, 1) == \"r\" then\r\n    wputmodrm(3, s, reg)\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(0) end\r\n    return\r\n  end\r\n\r\n  local disp = t.disp\r\n  local tdisp = type(disp)\r\n  -- No base register?\r\n  if not reg then\r\n    local riprel = false\r\n    if xreg then\r\n      -- Indexed mode with index register only.\r\n      -- [xreg*xsc+disp] -> (0, s, esp) (xsc, xreg, ebp)\r\n      wputmodrm(0, s, 4)\r\n      if imark == \"I\" then waction(\"MARK\") end\r\n      if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n      wputmodrm(t.xsc, xreg, 5)\r\n      if vxreg then waction(\"VREG\", vxreg); wputxb(3) end\r\n    else\r\n      -- Pure 32 bit displacement.\r\n      if x64 and tdisp ~= \"table\" then\r\n\twputmodrm(0, s, 4) -- [disp] -> (0, s, esp) (0, esp, ebp)\r\n\tif imark == \"I\" then waction(\"MARK\") end\r\n\twputmodrm(0, 4, 5)\r\n      else\r\n\triprel = x64\r\n\twputmodrm(0, s, 5) -- [disp|rip-label] -> (0, s, ebp)\r\n\tif imark == \"I\" then waction(\"MARK\") end\r\n      end\r\n      if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    end\r\n    if riprel then -- Emit rip-relative displacement.\r\n      if match(\"UWSiI\", imark) then\r\n\twerror(\"NYI: rip-relative displacement followed by immediate\")\r\n      end\r\n      -- The previous byte in the action buffer cannot be 0xe9 or 0x80-0x8f.\r\n      wputlabel(\"REL_\", disp[1], 2)\r\n    else\r\n      wputdarg(disp)\r\n    end\r\n    return\r\n  end\r\n\r\n  local m\r\n  if tdisp == \"number\" then -- Check displacement size at assembly time.\r\n    if disp == 0 and band(reg, 7) ~= 5 then -- [ebp] -> [ebp+0] (in SIB, too)\r\n      if not vreg then m = 0 end -- Force DISP to allow [Rd(5)] -> [ebp+0]\r\n    elseif disp >= -128 and disp <= 127 then m = 1\r\n    else m = 2 end\r\n  elseif tdisp == \"table\" then\r\n    m = 2\r\n  end\r\n\r\n  -- Index register present or esp as base register: need SIB encoding.\r\n  if xreg or band(reg, 7) == 4 then\r\n    wputmodrm(m or 2, s, 4) -- ModRM.\r\n    if m == nil or imark == \"I\" then waction(\"MARK\") end\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    wputmodrm(t.xsc or 0, xreg or 4, reg) -- SIB.\r\n    if vxreg then waction(\"VREG\", vxreg); wputxb(3) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(1) end\r\n  else\r\n    wputmodrm(m or 2, s, reg) -- ModRM.\r\n    if (imark == \"I\" and (m == 1 or m == 2)) or\r\n       (m == nil and (vsreg or vreg)) then waction(\"MARK\") end\r\n    if vsreg then waction(\"VREG\", vsreg); wputxb(2) end\r\n    if vreg then waction(\"VREG\", vreg); wputxb(1) end\r\n  end\r\n\r\n  -- Put displacement.\r\n  if m == 1 then wputsbarg(disp)\r\n  elseif m == 2 then wputdarg(disp)\r\n  elseif m == nil then waction(\"DISP\", disp) end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Return human-readable operand mode string.\r\nlocal function opmodestr(op, args)\r\n  local m = {}\r\n  for i=1,#args do\r\n    local a = args[i]\r\n    m[#m+1] = sub(a.mode, 1, 1)..(a.opsize or \"?\")\r\n  end\r\n  return op..\" \"..concat(m, \",\")\r\nend\r\n\r\n-- Convert number to valid integer or nil.\r\nlocal function toint(expr)\r\n  local n = tonumber(expr)\r\n  if n then\r\n    if n % 1 ~= 0 or n < -2147483648 or n > 4294967295 then\r\n      werror(\"bad integer number `\"..expr..\"'\")\r\n    end\r\n    return n\r\n  end\r\nend\r\n\r\n-- Parse immediate expression.\r\nlocal function immexpr(expr)\r\n  -- &expr (pointer)\r\n  if sub(expr, 1, 1) == \"&\" then\r\n    return \"iPJ\", format(\"(ptrdiff_t)(%s)\", sub(expr,2))\r\n  end\r\n\r\n  local prefix = sub(expr, 1, 2)\r\n  -- =>expr (pc label reference)\r\n  if prefix == \"=>\" then\r\n    return \"iJ\", sub(expr, 3)\r\n  end\r\n  -- ->name (global label reference)\r\n  if prefix == \"->\" then\r\n    return \"iJ\", map_global[sub(expr, 3)]\r\n  end\r\n\r\n  -- [<>][1-9] (local label reference)\r\n  local dir, lnum = match(expr, \"^([<>])([1-9])$\")\r\n  if dir then -- Fwd: 247-255, Bkwd: 1-9.\r\n    return \"iJ\", lnum + (dir == \">\" and 246 or 0)\r\n  end\r\n\r\n  local extname = match(expr, \"^extern%s+(%S+)$\")\r\n  if extname then\r\n    return \"iJ\", map_extern[extname]\r\n  end\r\n\r\n  -- expr (interpreted as immediate)\r\n  return \"iI\", expr\r\nend\r\n\r\n-- Parse displacement expression: +-num, +-expr, +-opsize*num\r\nlocal function dispexpr(expr)\r\n  local disp = expr == \"\" and 0 or toint(expr)\r\n  if disp then return disp end\r\n  local c, dispt = match(expr, \"^([+-])%s*(.+)$\")\r\n  if c == \"+\" then\r\n    expr = dispt\r\n  elseif not c then\r\n    werror(\"bad displacement expression `\"..expr..\"'\")\r\n  end\r\n  local opsize, tailops = match(dispt, \"^(%w+)%s*%*%s*(.+)$\")\r\n  local ops, imm = map_opsize[opsize], toint(tailops)\r\n  if ops and imm then\r\n    if c == \"-\" then imm = -imm end\r\n    return imm*map_opsizenum[ops]\r\n  end\r\n  local mode, iexpr = immexpr(dispt)\r\n  if mode == \"iJ\" then\r\n    if c == \"-\" then werror(\"cannot invert label reference\") end\r\n    return { iexpr }\r\n  end\r\n  return expr -- Need to return original signed expression.\r\nend\r\n\r\n-- Parse register or type expression.\r\nlocal function rtexpr(expr)\r\n  if not expr then return end\r\n  local tname, ovreg = match(expr, \"^([%w_]+):(@[%w_]+)$\")\r\n  local tp = map_type[tname or expr]\r\n  if tp then\r\n    local reg = ovreg or tp.reg\r\n    local rnum = map_reg_num[reg]\r\n    if not rnum then\r\n      werror(\"type `\"..(tname or expr)..\"' needs a register override\")\r\n    end\r\n    if not map_reg_valid_base[reg] then\r\n      werror(\"bad base register override `\"..(map_reg_rev[reg] or reg)..\"'\")\r\n    end\r\n    return reg, rnum, tp\r\n  end\r\n  return expr, map_reg_num[expr]\r\nend\r\n\r\n-- Parse operand and return { mode, opsize, reg, xreg, xsc, disp, imm }.\r\nlocal function parseoperand(param)\r\n  local t = {}\r\n\r\n  local expr = param\r\n  local opsize, tailops = match(param, \"^(%w+)%s*(.+)$\")\r\n  if opsize then\r\n    t.opsize = map_opsize[opsize]\r\n    if t.opsize then expr = tailops end\r\n  end\r\n\r\n  local br = match(expr, \"^%[%s*(.-)%s*%]$\")\r\n  repeat\r\n    if br then\r\n      t.mode = \"xm\"\r\n\r\n      -- [disp]\r\n      t.disp = toint(br)\r\n      if t.disp then\r\n\tt.mode = x64 and \"xm\" or \"xmO\"\r\n\tbreak\r\n      end\r\n\r\n      -- [reg...]\r\n      local tp\r\n      local reg, tailr = match(br, \"^([@%w_:]+)%s*(.*)$\")\r\n      reg, t.reg, tp = rtexpr(reg)\r\n      if not t.reg then\r\n\t-- [expr]\r\n\tt.mode = x64 and \"xm\" or \"xmO\"\r\n\tt.disp = dispexpr(\"+\"..br)\r\n\tbreak\r\n      end\r\n\r\n      if t.reg == -1 then\r\n\tt.vreg, tailr = match(tailr, \"^(%b())(.*)$\")\r\n\tif not t.vreg then werror(\"bad variable register expression\") end\r\n      end\r\n\r\n      -- [xreg*xsc] or [xreg*xsc+-disp] or [xreg*xsc+-expr]\r\n      local xsc, tailsc = match(tailr, \"^%*%s*([1248])%s*(.*)$\")\r\n      if xsc then\r\n\tif not map_reg_valid_index[reg] then\r\n\t  werror(\"bad index register `\"..map_reg_rev[reg]..\"'\")\r\n\tend\r\n\tt.xsc = map_xsc[xsc]\r\n\tt.xreg = t.reg\r\n\tt.vxreg = t.vreg\r\n\tt.reg = nil\r\n\tt.vreg = nil\r\n\tt.disp = dispexpr(tailsc)\r\n\tbreak\r\n      end\r\n      if not map_reg_valid_base[reg] then\r\n\twerror(\"bad base register `\"..map_reg_rev[reg]..\"'\")\r\n      end\r\n\r\n      -- [reg] or [reg+-disp]\r\n      t.disp = toint(tailr) or (tailr == \"\" and 0)\r\n      if t.disp then break end\r\n\r\n      -- [reg+xreg...]\r\n      local xreg, tailx = match(tailr, \"^+%s*([@%w_:]+)%s*(.*)$\")\r\n      xreg, t.xreg, tp = rtexpr(xreg)\r\n      if not t.xreg then\r\n\t-- [reg+-expr]\r\n\tt.disp = dispexpr(tailr)\r\n\tbreak\r\n      end\r\n      if not map_reg_valid_index[xreg] then\r\n\twerror(\"bad index register `\"..map_reg_rev[xreg]..\"'\")\r\n      end\r\n\r\n      if t.xreg == -1 then\r\n\tt.vxreg, tailx = match(tailx, \"^(%b())(.*)$\")\r\n\tif not t.vxreg then werror(\"bad variable register expression\") end\r\n      end\r\n\r\n      -- [reg+xreg*xsc...]\r\n      local xsc, tailsc = match(tailx, \"^%*%s*([1248])%s*(.*)$\")\r\n      if xsc then\r\n\tt.xsc = map_xsc[xsc]\r\n\ttailx = tailsc\r\n      end\r\n\r\n      -- [...] or [...+-disp] or [...+-expr]\r\n      t.disp = dispexpr(tailx)\r\n    else\r\n      -- imm or opsize*imm\r\n      local imm = toint(expr)\r\n      if not imm and sub(expr, 1, 1) == \"*\" and t.opsize then\r\n\timm = toint(sub(expr, 2))\r\n\tif imm then\r\n\t  imm = imm * map_opsizenum[t.opsize]\r\n\t  t.opsize = nil\r\n\tend\r\n      end\r\n      if imm then\r\n\tif t.opsize then werror(\"bad operand size override\") end\r\n\tlocal m = \"i\"\r\n\tif imm == 1 then m = m..\"1\" end\r\n\tif imm >= 4294967168 and imm <= 4294967295 then imm = imm-4294967296 end\r\n\tif imm >= -128 and imm <= 127 then m = m..\"S\" end\r\n\tt.imm = imm\r\n\tt.mode = m\r\n\tbreak\r\n      end\r\n\r\n      local tp\r\n      local reg, tailr = match(expr, \"^([@%w_:]+)%s*(.*)$\")\r\n      reg, t.reg, tp = rtexpr(reg)\r\n      if t.reg then\r\n\tif t.reg == -1 then\r\n\t  t.vreg, tailr = match(tailr, \"^(%b())(.*)$\")\r\n\t  if not t.vreg then werror(\"bad variable register expression\") end\r\n\tend\r\n\t-- reg\r\n\tif tailr == \"\" then\r\n\t  if t.opsize then werror(\"bad operand size override\") end\r\n\t  t.opsize = map_reg_opsize[reg]\r\n\t  if t.opsize == \"f\" then\r\n\t    t.mode = t.reg == 0 and \"fF\" or \"f\"\r\n\t  else\r\n\t    if reg == \"@w4\" or (x64 and reg == \"@d4\") then\r\n\t      wwarn(\"bad idea, try again with `\"..(x64 and \"rsp'\" or \"esp'\"))\r\n\t    end\r\n\t    t.mode = t.reg == 0 and \"rmR\" or (reg == \"@b1\" and \"rmC\" or \"rm\")\r\n\t  end\r\n\t  t.needrex = map_reg_needrex[reg]\r\n\t  break\r\n\tend\r\n\r\n\t-- type[idx], type[idx].field, type->field -> [reg+offset_expr]\r\n\tif not tp then werror(\"bad operand `\"..param..\"'\") end\r\n\tt.mode = \"xm\"\r\n\tt.disp = format(tp.ctypefmt, tailr)\r\n      else\r\n\tt.mode, t.imm = immexpr(expr)\r\n\tif sub(t.mode, -1) == \"J\" then\r\n\t  if t.opsize and t.opsize ~= addrsize then\r\n\t    werror(\"bad operand size override\")\r\n\t  end\r\n\t  t.opsize = addrsize\r\n\tend\r\n      end\r\n    end\r\n  until true\r\n  return t\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n-- x86 Template String Description\r\n-- ===============================\r\n--\r\n-- Each template string is a list of [match:]pattern pairs,\r\n-- separated by \"|\". The first match wins. No match means a\r\n-- bad or unsupported combination of operand modes or sizes.\r\n--\r\n-- The match part and the \":\" is omitted if the operation has\r\n-- no operands. Otherwise the first N characters are matched\r\n-- against the mode strings of each of the N operands.\r\n--\r\n-- The mode string for each operand type is (see parseoperand()):\r\n--   Integer register: \"rm\", +\"R\" for eax, ax, al, +\"C\" for cl\r\n--   FP register:      \"f\",  +\"F\" for st0\r\n--   Index operand:    \"xm\", +\"O\" for [disp] (pure offset)\r\n--   Immediate:        \"i\",  +\"S\" for signed 8 bit, +\"1\" for 1,\r\n--                     +\"I\" for arg, +\"P\" for pointer\r\n--   Any:              +\"J\" for valid jump targets\r\n--\r\n-- So a match character \"m\" (mixed) matches both an integer register\r\n-- and an index operand (to be encoded with the ModRM/SIB scheme).\r\n-- But \"r\" matches only a register and \"x\" only an index operand\r\n-- (e.g. for FP memory access operations).\r\n--\r\n-- The operand size match string starts right after the mode match\r\n-- characters and ends before the \":\". \"dwb\" or \"qdwb\" is assumed, if empty.\r\n-- The effective data size of the operation is matched against this list.\r\n--\r\n-- If only the regular \"b\", \"w\", \"d\", \"q\", \"t\" operand sizes are\r\n-- present, then all operands must be the same size. Unspecified sizes\r\n-- are ignored, but at least one operand must have a size or the pattern\r\n-- won't match (use the \"byte\", \"word\", \"dword\", \"qword\", \"tword\"\r\n-- operand size overrides. E.g.: mov dword [eax], 1).\r\n--\r\n-- If the list has a \"1\" or \"2\" prefix, the operand size is taken\r\n-- from the respective operand and any other operand sizes are ignored.\r\n-- If the list contains only \".\", all operand sizes are ignored.\r\n-- If the list has a \"/\" prefix, the concatenated (mixed) operand sizes\r\n-- are compared to the match.\r\n--\r\n-- E.g. \"rrdw\" matches for either two dword registers or two word\r\n-- registers. \"Fx2dq\" matches an st0 operand plus an index operand\r\n-- pointing to a dword (float) or qword (double).\r\n--\r\n-- Every character after the \":\" is part of the pattern string:\r\n--   Hex chars are accumulated to form the opcode (left to right).\r\n--   \"n\"       disables the standard opcode mods\r\n--             (otherwise: -1 for \"b\", o16 prefix for \"w\", rex.w for \"q\")\r\n--   \"X\"       Force REX.W.\r\n--   \"r\"/\"R\"   adds the reg. number from the 1st/2nd operand to the opcode.\r\n--   \"m\"/\"M\"   generates ModRM/SIB from the 1st/2nd operand.\r\n--             The spare 3 bits are either filled with the last hex digit or\r\n--             the result from a previous \"r\"/\"R\". The opcode is restored.\r\n--\r\n-- All of the following characters force a flush of the opcode:\r\n--   \"o\"/\"O\"   stores a pure 32 bit disp (offset) from the 1st/2nd operand.\r\n--   \"S\"       stores a signed 8 bit immediate from the last operand.\r\n--   \"U\"       stores an unsigned 8 bit immediate from the last operand.\r\n--   \"W\"       stores an unsigned 16 bit immediate from the last operand.\r\n--   \"i\"       stores an operand sized immediate from the last operand.\r\n--   \"I\"       dito, but generates an action code to optionally modify\r\n--             the opcode (+2) for a signed 8 bit immediate.\r\n--   \"J\"       generates one of the REL action codes from the last operand.\r\n--\r\n------------------------------------------------------------------------------\r\n\r\n-- Template strings for x86 instructions. Ordered by first opcode byte.\r\n-- Unimplemented opcodes (deliberate omissions) are marked with *.\r\nlocal map_op = {\r\n  -- 00-05: add...\r\n  -- 06: *push es\r\n  -- 07: *pop es\r\n  -- 08-0D: or...\r\n  -- 0E: *push cs\r\n  -- 0F: two byte opcode prefix\r\n  -- 10-15: adc...\r\n  -- 16: *push ss\r\n  -- 17: *pop ss\r\n  -- 18-1D: sbb...\r\n  -- 1E: *push ds\r\n  -- 1F: *pop ds\r\n  -- 20-25: and...\r\n  es_0 =\t\"26\",\r\n  -- 27: *daa\r\n  -- 28-2D: sub...\r\n  cs_0 =\t\"2E\",\r\n  -- 2F: *das\r\n  -- 30-35: xor...\r\n  ss_0 =\t\"36\",\r\n  -- 37: *aaa\r\n  -- 38-3D: cmp...\r\n  ds_0 =\t\"3E\",\r\n  -- 3F: *aas\r\n  inc_1 =\tx64 and \"m:FF0m\" or \"rdw:40r|m:FF0m\",\r\n  dec_1 =\tx64 and \"m:FF1m\" or \"rdw:48r|m:FF1m\",\r\n  push_1 =\t(x64 and \"rq:n50r|rw:50r|mq:nFF6m|mw:FF6m\" or\r\n\t\t\t \"rdw:50r|mdw:FF6m\")..\"|S.:6AS|ib:n6Ai|i.:68i\",\r\n  pop_1 =\tx64 and \"rq:n58r|rw:58r|mq:n8F0m|mw:8F0m\" or \"rdw:58r|mdw:8F0m\",\r\n  -- 60: *pusha, *pushad, *pushaw\r\n  -- 61: *popa, *popad, *popaw\r\n  -- 62: *bound rdw,x\r\n  -- 63: x86: *arpl mw,rw\r\n  movsxd_2 =\tx64 and \"rm/qd:63rM\",\r\n  fs_0 =\t\"64\",\r\n  gs_0 =\t\"65\",\r\n  o16_0 =\t\"66\",\r\n  a16_0 =\tnot x64 and \"67\" or nil,\r\n  a32_0 =\tx64 and \"67\",\r\n  -- 68: push idw\r\n  -- 69: imul rdw,mdw,idw\r\n  -- 6A: push ib\r\n  -- 6B: imul rdw,mdw,S\r\n  -- 6C: *insb\r\n  -- 6D: *insd, *insw\r\n  -- 6E: *outsb\r\n  -- 6F: *outsd, *outsw\r\n  -- 70-7F: jcc lb\r\n  -- 80: add... mb,i\r\n  -- 81: add... mdw,i\r\n  -- 82: *undefined\r\n  -- 83: add... mdw,S\r\n  test_2 =\t\"mr:85Rm|rm:85rM|Ri:A9ri|mi:F70mi\",\r\n  -- 86: xchg rb,mb\r\n  -- 87: xchg rdw,mdw\r\n  -- 88: mov mb,r\r\n  -- 89: mov mdw,r\r\n  -- 8A: mov r,mb\r\n  -- 8B: mov r,mdw\r\n  -- 8C: *mov mdw,seg\r\n  lea_2 =\t\"rx1dq:8DrM\",\r\n  -- 8E: *mov seg,mdw\r\n  -- 8F: pop mdw\r\n  nop_0 =\t\"90\",\r\n  xchg_2 =\t\"Rrqdw:90R|rRqdw:90r|rm:87rM|mr:87Rm\",\r\n  cbw_0 =\t\"6698\",\r\n  cwde_0 =\t\"98\",\r\n  cdqe_0 =\t\"4898\",\r\n  cwd_0 =\t\"6699\",\r\n  cdq_0 =\t\"99\",\r\n  cqo_0 =\t\"4899\",\r\n  -- 9A: *call iw:idw\r\n  wait_0 =\t\"9B\",\r\n  fwait_0 =\t\"9B\",\r\n  pushf_0 =\t\"9C\",\r\n  pushfd_0 =\tnot x64 and \"9C\",\r\n  pushfq_0 =\tx64 and \"9C\",\r\n  popf_0 =\t\"9D\",\r\n  popfd_0 =\tnot x64 and \"9D\",\r\n  popfq_0 =\tx64 and \"9D\",\r\n  sahf_0 =\t\"9E\",\r\n  lahf_0 =\t\"9F\",\r\n  mov_2 =\t\"OR:A3o|RO:A1O|mr:89Rm|rm:8BrM|rib:nB0ri|ridw:B8ri|mi:C70mi\",\r\n  movsb_0 =\t\"A4\",\r\n  movsw_0 =\t\"66A5\",\r\n  movsd_0 =\t\"A5\",\r\n  cmpsb_0 =\t\"A6\",\r\n  cmpsw_0 =\t\"66A7\",\r\n  cmpsd_0 =\t\"A7\",\r\n  -- A8: test Rb,i\r\n  -- A9: test Rdw,i\r\n  stosb_0 =\t\"AA\",\r\n  stosw_0 =\t\"66AB\",\r\n  stosd_0 =\t\"AB\",\r\n  lodsb_0 =\t\"AC\",\r\n  lodsw_0 =\t\"66AD\",\r\n  lodsd_0 =\t\"AD\",\r\n  scasb_0 =\t\"AE\",\r\n  scasw_0 =\t\"66AF\",\r\n  scasd_0 =\t\"AF\",\r\n  -- B0-B7: mov rb,i\r\n  -- B8-BF: mov rdw,i\r\n  -- C0: rol... mb,i\r\n  -- C1: rol... mdw,i\r\n  ret_1 =\t\"i.:nC2W\",\r\n  ret_0 =\t\"C3\",\r\n  -- C4: *les rdw,mq\r\n  -- C5: *lds rdw,mq\r\n  -- C6: mov mb,i\r\n  -- C7: mov mdw,i\r\n  -- C8: *enter iw,ib\r\n  leave_0 =\t\"C9\",\r\n  -- CA: *retf iw\r\n  -- CB: *retf\r\n  int3_0 =\t\"CC\",\r\n  int_1 =\t\"i.:nCDU\",\r\n  into_0 =\t\"CE\",\r\n  -- CF: *iret\r\n  -- D0: rol... mb,1\r\n  -- D1: rol... mdw,1\r\n  -- D2: rol... mb,cl\r\n  -- D3: rol... mb,cl\r\n  -- D4: *aam ib\r\n  -- D5: *aad ib\r\n  -- D6: *salc\r\n  -- D7: *xlat\r\n  -- D8-DF: floating point ops\r\n  -- E0: *loopne\r\n  -- E1: *loope\r\n  -- E2: *loop\r\n  -- E3: *jcxz, *jecxz\r\n  -- E4: *in Rb,ib\r\n  -- E5: *in Rdw,ib\r\n  -- E6: *out ib,Rb\r\n  -- E7: *out ib,Rdw\r\n  call_1 =\tx64 and \"mq:nFF2m|J.:E8nJ\" or \"md:FF2m|J.:E8J\",\r\n  jmp_1 =\tx64 and \"mq:nFF4m|J.:E9nJ\" or \"md:FF4m|J.:E9J\", -- short: EB\r\n  -- EA: *jmp iw:idw\r\n  -- EB: jmp ib\r\n  -- EC: *in Rb,dx\r\n  -- ED: *in Rdw,dx\r\n  -- EE: *out dx,Rb\r\n  -- EF: *out dx,Rdw\r\n  lock_0 =\t\"F0\",\r\n  int1_0 =\t\"F1\",\r\n  repne_0 =\t\"F2\",\r\n  repnz_0 =\t\"F2\",\r\n  rep_0 =\t\"F3\",\r\n  repe_0 =\t\"F3\",\r\n  repz_0 =\t\"F3\",\r\n  -- F4: *hlt\r\n  cmc_0 =\t\"F5\",\r\n  -- F6: test... mb,i; div... mb\r\n  -- F7: test... mdw,i; div... mdw\r\n  clc_0 =\t\"F8\",\r\n  stc_0 =\t\"F9\",\r\n  -- FA: *cli\r\n  cld_0 =\t\"FC\",\r\n  std_0 =\t\"FD\",\r\n  -- FE: inc... mb\r\n  -- FF: inc... mdw\r\n\r\n  -- misc ops\r\n  not_1 =\t\"m:F72m\",\r\n  neg_1 =\t\"m:F73m\",\r\n  mul_1 =\t\"m:F74m\",\r\n  imul_1 =\t\"m:F75m\",\r\n  div_1 =\t\"m:F76m\",\r\n  idiv_1 =\t\"m:F77m\",\r\n\r\n  imul_2 =\t\"rmqdw:0FAFrM|rIqdw:69rmI|rSqdw:6BrmS|riqdw:69rmi\",\r\n  imul_3 =\t\"rmIqdw:69rMI|rmSqdw:6BrMS|rmiqdw:69rMi\",\r\n\r\n  movzx_2 =\t\"rm/db:0FB6rM|rm/qb:|rm/wb:0FB6rM|rm/dw:0FB7rM|rm/qw:\",\r\n  movsx_2 =\t\"rm/db:0FBErM|rm/qb:|rm/wb:0FBErM|rm/dw:0FBFrM|rm/qw:\",\r\n\r\n  bswap_1 =\t\"rqd:0FC8r\",\r\n  bsf_2 =\t\"rmqdw:0FBCrM\",\r\n  bsr_2 =\t\"rmqdw:0FBDrM\",\r\n  bt_2 =\t\"mrqdw:0FA3Rm|miqdw:0FBA4mU\",\r\n  btc_2 =\t\"mrqdw:0FBBRm|miqdw:0FBA7mU\",\r\n  btr_2 =\t\"mrqdw:0FB3Rm|miqdw:0FBA6mU\",\r\n  bts_2 =\t\"mrqdw:0FABRm|miqdw:0FBA5mU\",\r\n\r\n  shld_3 =\t\"mriqdw:0FA4RmU|mrCqdw:0FA5Rm\",\r\n  shrd_3 =\t\"mriqdw:0FACRmU|mrCqdw:0FADRm\",\r\n\r\n  rdtsc_0 =\t\"0F31\", -- P1+\r\n  cpuid_0 =\t\"0FA2\", -- P1+\r\n\r\n  -- floating point ops\r\n  fst_1 =\t\"ff:DDD0r|xd:D92m|xq:nDD2m\",\r\n  fstp_1 =\t\"ff:DDD8r|xd:D93m|xq:nDD3m|xt:DB7m\",\r\n  fld_1 =\t\"ff:D9C0r|xd:D90m|xq:nDD0m|xt:DB5m\",\r\n\r\n  fpop_0 =\t\"DDD8\", -- Alias for fstp st0.\r\n\r\n  fist_1 =\t\"xw:nDF2m|xd:DB2m\",\r\n  fistp_1 =\t\"xw:nDF3m|xd:DB3m|xq:nDF7m\",\r\n  fild_1 =\t\"xw:nDF0m|xd:DB0m|xq:nDF5m\",\r\n\r\n  fxch_0 =\t\"D9C9\",\r\n  fxch_1 =\t\"ff:D9C8r\",\r\n  fxch_2 =\t\"fFf:D9C8r|Fff:D9C8R\",\r\n\r\n  fucom_1 =\t\"ff:DDE0r\",\r\n  fucom_2 =\t\"Fff:DDE0R\",\r\n  fucomp_1 =\t\"ff:DDE8r\",\r\n  fucomp_2 =\t\"Fff:DDE8R\",\r\n  fucomi_1 =\t\"ff:DBE8r\", -- P6+\r\n  fucomi_2 =\t\"Fff:DBE8R\", -- P6+\r\n  fucomip_1 =\t\"ff:DFE8r\", -- P6+\r\n  fucomip_2 =\t\"Fff:DFE8R\", -- P6+\r\n  fcomi_1 =\t\"ff:DBF0r\", -- P6+\r\n  fcomi_2 =\t\"Fff:DBF0R\", -- P6+\r\n  fcomip_1 =\t\"ff:DFF0r\", -- P6+\r\n  fcomip_2 =\t\"Fff:DFF0R\", -- P6+\r\n  fucompp_0 =\t\"DAE9\",\r\n  fcompp_0 =\t\"DED9\",\r\n\r\n  fldenv_1 =\t\"x.:D94m\",\r\n  fnstenv_1 =\t\"x.:D96m\",\r\n  fstenv_1 =\t\"x.:9BD96m\",\r\n  fldcw_1 =\t\"xw:nD95m\",\r\n  fstcw_1 =\t\"xw:n9BD97m\",\r\n  fnstcw_1 =\t\"xw:nD97m\",\r\n  fstsw_1 =\t\"Rw:n9BDFE0|xw:n9BDD7m\",\r\n  fnstsw_1 =\t\"Rw:nDFE0|xw:nDD7m\",\r\n  fclex_0 =\t\"9BDBE2\",\r\n  fnclex_0 =\t\"DBE2\",\r\n\r\n  fnop_0 =\t\"D9D0\",\r\n  -- D9D1-D9DF: unassigned\r\n\r\n  fchs_0 =\t\"D9E0\",\r\n  fabs_0 =\t\"D9E1\",\r\n  -- D9E2: unassigned\r\n  -- D9E3: unassigned\r\n  ftst_0 =\t\"D9E4\",\r\n  fxam_0 =\t\"D9E5\",\r\n  -- D9E6: unassigned\r\n  -- D9E7: unassigned\r\n  fld1_0 =\t\"D9E8\",\r\n  fldl2t_0 =\t\"D9E9\",\r\n  fldl2e_0 =\t\"D9EA\",\r\n  fldpi_0 =\t\"D9EB\",\r\n  fldlg2_0 =\t\"D9EC\",\r\n  fldln2_0 =\t\"D9ED\",\r\n  fldz_0 =\t\"D9EE\",\r\n  -- D9EF: unassigned\r\n\r\n  f2xm1_0 =\t\"D9F0\",\r\n  fyl2x_0 =\t\"D9F1\",\r\n  fptan_0 =\t\"D9F2\",\r\n  fpatan_0 =\t\"D9F3\",\r\n  fxtract_0 =\t\"D9F4\",\r\n  fprem1_0 =\t\"D9F5\",\r\n  fdecstp_0 =\t\"D9F6\",\r\n  fincstp_0 =\t\"D9F7\",\r\n  fprem_0 =\t\"D9F8\",\r\n  fyl2xp1_0 =\t\"D9F9\",\r\n  fsqrt_0 =\t\"D9FA\",\r\n  fsincos_0 =\t\"D9FB\",\r\n  frndint_0 =\t\"D9FC\",\r\n  fscale_0 =\t\"D9FD\",\r\n  fsin_0 =\t\"D9FE\",\r\n  fcos_0 =\t\"D9FF\",\r\n\r\n  -- SSE, SSE2\r\n  andnpd_2 =\t\"rmo:660F55rM\",\r\n  andnps_2 =\t\"rmo:0F55rM\",\r\n  andpd_2 =\t\"rmo:660F54rM\",\r\n  andps_2 =\t\"rmo:0F54rM\",\r\n  clflush_1 =\t\"x.:0FAE7m\",\r\n  cmppd_3 =\t\"rmio:660FC2rMU\",\r\n  cmpps_3 =\t\"rmio:0FC2rMU\",\r\n  cmpsd_3 =\t\"rrio:F20FC2rMU|rxi/oq:\",\r\n  cmpss_3 =\t\"rrio:F30FC2rMU|rxi/od:\",\r\n  comisd_2 =\t\"rro:660F2FrM|rx/oq:\",\r\n  comiss_2 =\t\"rro:0F2FrM|rx/od:\",\r\n  cvtdq2pd_2 =\t\"rro:F30FE6rM|rx/oq:\",\r\n  cvtdq2ps_2 =\t\"rmo:0F5BrM\",\r\n  cvtpd2dq_2 =\t\"rmo:F20FE6rM\",\r\n  cvtpd2ps_2 =\t\"rmo:660F5ArM\",\r\n  cvtpi2pd_2 =\t\"rx/oq:660F2ArM\",\r\n  cvtpi2ps_2 =\t\"rx/oq:0F2ArM\",\r\n  cvtps2dq_2 =\t\"rmo:660F5BrM\",\r\n  cvtps2pd_2 =\t\"rro:0F5ArM|rx/oq:\",\r\n  cvtsd2si_2 =\t\"rr/do:F20F2DrM|rr/qo:|rx/dq:|rxq:\",\r\n  cvtsd2ss_2 =\t\"rro:F20F5ArM|rx/oq:\",\r\n  cvtsi2sd_2 =\t\"rm/od:F20F2ArM|rm/oq:F20F2ArXM\",\r\n  cvtsi2ss_2 =\t\"rm/od:F30F2ArM|rm/oq:F30F2ArXM\",\r\n  cvtss2sd_2 =\t\"rro:F30F5ArM|rx/od:\",\r\n  cvtss2si_2 =\t\"rr/do:F20F2CrM|rr/qo:|rxd:|rx/qd:\",\r\n  cvttpd2dq_2 =\t\"rmo:660FE6rM\",\r\n  cvttps2dq_2 =\t\"rmo:F30F5BrM\",\r\n  cvttsd2si_2 =\t\"rr/do:F20F2CrM|rr/qo:|rx/dq:|rxq:\",\r\n  cvttss2si_2 =\t\"rr/do:F30F2CrM|rr/qo:|rxd:|rx/qd:\",\r\n  fxsave_1 =\t\"x.:0FAE0m\",\r\n  fxrstor_1 =\t\"x.:0FAE1m\",\r\n  ldmxcsr_1 =\t\"xd:0FAE2m\",\r\n  lfence_0 =\t\"0FAEE8\",\r\n  maskmovdqu_2 = \"rro:660FF7rM\",\r\n  mfence_0 =\t\"0FAEF0\",\r\n  movapd_2 =\t\"rmo:660F28rM|mro:660F29Rm\",\r\n  movaps_2 =\t\"rmo:0F28rM|mro:0F29Rm\",\r\n  movd_2 =\t\"rm/od:660F6ErM|rm/oq:660F6ErXM|mr/do:660F7ERm|mr/qo:\",\r\n  movdqa_2 =\t\"rmo:660F6FrM|mro:660F7FRm\",\r\n  movdqu_2 =\t\"rmo:F30F6FrM|mro:F30F7FRm\",\r\n  movhlps_2 =\t\"rro:0F12rM\",\r\n  movhpd_2 =\t\"rx/oq:660F16rM|xr/qo:n660F17Rm\",\r\n  movhps_2 =\t\"rx/oq:0F16rM|xr/qo:n0F17Rm\",\r\n  movlhps_2 =\t\"rro:0F16rM\",\r\n  movlpd_2 =\t\"rx/oq:660F12rM|xr/qo:n660F13Rm\",\r\n  movlps_2 =\t\"rx/oq:0F12rM|xr/qo:n0F13Rm\",\r\n  movmskpd_2 =\t\"rr/do:660F50rM\",\r\n  movmskps_2 =\t\"rr/do:0F50rM\",\r\n  movntdq_2 =\t\"xro:660FE7Rm\",\r\n  movnti_2 =\t\"xrqd:0FC3Rm\",\r\n  movntpd_2 =\t\"xro:660F2BRm\",\r\n  movntps_2 =\t\"xro:0F2BRm\",\r\n  movq_2 =\t\"rro:F30F7ErM|rx/oq:|xr/qo:n660FD6Rm\",\r\n  movsd_2 =\t\"rro:F20F10rM|rx/oq:|xr/qo:nF20F11Rm\",\r\n  movss_2 =\t\"rro:F30F10rM|rx/od:|xr/do:F30F11Rm\",\r\n  movupd_2 =\t\"rmo:660F10rM|mro:660F11Rm\",\r\n  movups_2 =\t\"rmo:0F10rM|mro:0F11Rm\",\r\n  orpd_2 =\t\"rmo:660F56rM\",\r\n  orps_2 =\t\"rmo:0F56rM\",\r\n  packssdw_2 =\t\"rmo:660F6BrM\",\r\n  packsswb_2 =\t\"rmo:660F63rM\",\r\n  packuswb_2 =\t\"rmo:660F67rM\",\r\n  paddb_2 =\t\"rmo:660FFCrM\",\r\n  paddd_2 =\t\"rmo:660FFErM\",\r\n  paddq_2 =\t\"rmo:660FD4rM\",\r\n  paddsb_2 =\t\"rmo:660FECrM\",\r\n  paddsw_2 =\t\"rmo:660FEDrM\",\r\n  paddusb_2 =\t\"rmo:660FDCrM\",\r\n  paddusw_2 =\t\"rmo:660FDDrM\",\r\n  paddw_2 =\t\"rmo:660FFDrM\",\r\n  pand_2 =\t\"rmo:660FDBrM\",\r\n  pandn_2 =\t\"rmo:660FDFrM\",\r\n  pause_0 =\t\"F390\",\r\n  pavgb_2 =\t\"rmo:660FE0rM\",\r\n  pavgw_2 =\t\"rmo:660FE3rM\",\r\n  pcmpeqb_2 =\t\"rmo:660F74rM\",\r\n  pcmpeqd_2 =\t\"rmo:660F76rM\",\r\n  pcmpeqw_2 =\t\"rmo:660F75rM\",\r\n  pcmpgtb_2 =\t\"rmo:660F64rM\",\r\n  pcmpgtd_2 =\t\"rmo:660F66rM\",\r\n  pcmpgtw_2 =\t\"rmo:660F65rM\",\r\n  pextrw_3 =\t\"rri/do:660FC5rMU|xri/wo:660F3A15nrMU\", -- Mem op: SSE4.1 only.\r\n  pinsrw_3 =\t\"rri/od:660FC4rMU|rxi/ow:\",\r\n  pmaddwd_2 =\t\"rmo:660FF5rM\",\r\n  pmaxsw_2 =\t\"rmo:660FEErM\",\r\n  pmaxub_2 =\t\"rmo:660FDErM\",\r\n  pminsw_2 =\t\"rmo:660FEArM\",\r\n  pminub_2 =\t\"rmo:660FDArM\",\r\n  pmovmskb_2 =\t\"rr/do:660FD7rM\",\r\n  pmulhuw_2 =\t\"rmo:660FE4rM\",\r\n  pmulhw_2 =\t\"rmo:660FE5rM\",\r\n  pmullw_2 =\t\"rmo:660FD5rM\",\r\n  pmuludq_2 =\t\"rmo:660FF4rM\",\r\n  por_2 =\t\"rmo:660FEBrM\",\r\n  prefetchnta_1 = \"xb:n0F180m\",\r\n  prefetcht0_1 = \"xb:n0F181m\",\r\n  prefetcht1_1 = \"xb:n0F182m\",\r\n  prefetcht2_1 = \"xb:n0F183m\",\r\n  psadbw_2 =\t\"rmo:660FF6rM\",\r\n  pshufd_3 =\t\"rmio:660F70rMU\",\r\n  pshufhw_3 =\t\"rmio:F30F70rMU\",\r\n  pshuflw_3 =\t\"rmio:F20F70rMU\",\r\n  pslld_2 =\t\"rmo:660FF2rM|rio:660F726mU\",\r\n  pslldq_2 =\t\"rio:660F737mU\",\r\n  psllq_2 =\t\"rmo:660FF3rM|rio:660F736mU\",\r\n  psllw_2 =\t\"rmo:660FF1rM|rio:660F716mU\",\r\n  psrad_2 =\t\"rmo:660FE2rM|rio:660F724mU\",\r\n  psraw_2 =\t\"rmo:660FE1rM|rio:660F714mU\",\r\n  psrld_2 =\t\"rmo:660FD2rM|rio:660F722mU\",\r\n  psrldq_2 =\t\"rio:660F733mU\",\r\n  psrlq_2 =\t\"rmo:660FD3rM|rio:660F732mU\",\r\n  psrlw_2 =\t\"rmo:660FD1rM|rio:660F712mU\",\r\n  psubb_2 =\t\"rmo:660FF8rM\",\r\n  psubd_2 =\t\"rmo:660FFArM\",\r\n  psubq_2 =\t\"rmo:660FFBrM\",\r\n  psubsb_2 =\t\"rmo:660FE8rM\",\r\n  psubsw_2 =\t\"rmo:660FE9rM\",\r\n  psubusb_2 =\t\"rmo:660FD8rM\",\r\n  psubusw_2 =\t\"rmo:660FD9rM\",\r\n  psubw_2 =\t\"rmo:660FF9rM\",\r\n  punpckhbw_2 =\t\"rmo:660F68rM\",\r\n  punpckhdq_2 =\t\"rmo:660F6ArM\",\r\n  punpckhqdq_2 = \"rmo:660F6DrM\",\r\n  punpckhwd_2 =\t\"rmo:660F69rM\",\r\n  punpcklbw_2 =\t\"rmo:660F60rM\",\r\n  punpckldq_2 =\t\"rmo:660F62rM\",\r\n  punpcklqdq_2 = \"rmo:660F6CrM\",\r\n  punpcklwd_2 =\t\"rmo:660F61rM\",\r\n  pxor_2 =\t\"rmo:660FEFrM\",\r\n  rcpps_2 =\t\"rmo:0F53rM\",\r\n  rcpss_2 =\t\"rro:F30F53rM|rx/od:\",\r\n  rsqrtps_2 =\t\"rmo:0F52rM\",\r\n  rsqrtss_2 =\t\"rmo:F30F52rM\",\r\n  sfence_0 =\t\"0FAEF8\",\r\n  shufpd_3 =\t\"rmio:660FC6rMU\",\r\n  shufps_3 =\t\"rmio:0FC6rMU\",\r\n  stmxcsr_1 =   \"xd:0FAE3m\",\r\n  ucomisd_2 =\t\"rro:660F2ErM|rx/oq:\",\r\n  ucomiss_2 =\t\"rro:0F2ErM|rx/od:\",\r\n  unpckhpd_2 =\t\"rmo:660F15rM\",\r\n  unpckhps_2 =\t\"rmo:0F15rM\",\r\n  unpcklpd_2 =\t\"rmo:660F14rM\",\r\n  unpcklps_2 =\t\"rmo:0F14rM\",\r\n  xorpd_2 =\t\"rmo:660F57rM\",\r\n  xorps_2 =\t\"rmo:0F57rM\",\r\n\r\n  -- SSE3 ops\r\n  fisttp_1 =\t\"xw:nDF1m|xd:DB1m|xq:nDD1m\",\r\n  addsubpd_2 =\t\"rmo:660FD0rM\",\r\n  addsubps_2 =\t\"rmo:F20FD0rM\",\r\n  haddpd_2 =\t\"rmo:660F7CrM\",\r\n  haddps_2 =\t\"rmo:F20F7CrM\",\r\n  hsubpd_2 =\t\"rmo:660F7DrM\",\r\n  hsubps_2 =\t\"rmo:F20F7DrM\",\r\n  lddqu_2 =\t\"rxo:F20FF0rM\",\r\n  movddup_2 =\t\"rmo:F20F12rM\",\r\n  movshdup_2 =\t\"rmo:F30F16rM\",\r\n  movsldup_2 =\t\"rmo:F30F12rM\",\r\n\r\n  -- SSSE3 ops\r\n  pabsb_2 =\t\"rmo:660F381CrM\",\r\n  pabsd_2 =\t\"rmo:660F381ErM\",\r\n  pabsw_2 =\t\"rmo:660F381DrM\",\r\n  palignr_3 =\t\"rmio:660F3A0FrMU\",\r\n  phaddd_2 =\t\"rmo:660F3802rM\",\r\n  phaddsw_2 =\t\"rmo:660F3803rM\",\r\n  phaddw_2 =\t\"rmo:660F3801rM\",\r\n  phsubd_2 =\t\"rmo:660F3806rM\",\r\n  phsubsw_2 =\t\"rmo:660F3807rM\",\r\n  phsubw_2 =\t\"rmo:660F3805rM\",\r\n  pmaddubsw_2 =\t\"rmo:660F3804rM\",\r\n  pmulhrsw_2 =\t\"rmo:660F380BrM\",\r\n  pshufb_2 =\t\"rmo:660F3800rM\",\r\n  psignb_2 =\t\"rmo:660F3808rM\",\r\n  psignd_2 =\t\"rmo:660F380ArM\",\r\n  psignw_2 =\t\"rmo:660F3809rM\",\r\n\r\n  -- SSE4.1 ops\r\n  blendpd_3 =\t\"rmio:660F3A0DrMU\",\r\n  blendps_3 =\t\"rmio:660F3A0CrMU\",\r\n  blendvpd_3 =\t\"rmRo:660F3815rM\",\r\n  blendvps_3 =\t\"rmRo:660F3814rM\",\r\n  dppd_3 =\t\"rmio:660F3A41rMU\",\r\n  dpps_3 =\t\"rmio:660F3A40rMU\",\r\n  extractps_3 =\t\"mri/do:660F3A17RmU|rri/qo:660F3A17RXmU\",\r\n  insertps_3 =\t\"rrio:660F3A41rMU|rxi/od:\",\r\n  movntdqa_2 =\t\"rmo:660F382ArM\",\r\n  mpsadbw_3 =\t\"rmio:660F3A42rMU\",\r\n  packusdw_2 =\t\"rmo:660F382BrM\",\r\n  pblendvb_3 =\t\"rmRo:660F3810rM\",\r\n  pblendw_3 =\t\"rmio:660F3A0ErMU\",\r\n  pcmpeqq_2 =\t\"rmo:660F3829rM\",\r\n  pextrb_3 =\t\"rri/do:660F3A14nRmU|rri/qo:|xri/bo:\",\r\n  pextrd_3 =\t\"mri/do:660F3A16RmU\",\r\n  pextrq_3 =\t\"mri/qo:660F3A16RmU\",\r\n  -- pextrw is SSE2, mem operand is SSE4.1 only\r\n  phminposuw_2 = \"rmo:660F3841rM\",\r\n  pinsrb_3 =\t\"rri/od:660F3A20nrMU|rxi/ob:\",\r\n  pinsrd_3 =\t\"rmi/od:660F3A22rMU\",\r\n  pinsrq_3 =\t\"rmi/oq:660F3A22rXMU\",\r\n  pmaxsb_2 =\t\"rmo:660F383CrM\",\r\n  pmaxsd_2 =\t\"rmo:660F383DrM\",\r\n  pmaxud_2 =\t\"rmo:660F383FrM\",\r\n  pmaxuw_2 =\t\"rmo:660F383ErM\",\r\n  pminsb_2 =\t\"rmo:660F3838rM\",\r\n  pminsd_2 =\t\"rmo:660F3839rM\",\r\n  pminud_2 =\t\"rmo:660F383BrM\",\r\n  pminuw_2 =\t\"rmo:660F383ArM\",\r\n  pmovsxbd_2 =\t\"rro:660F3821rM|rx/od:\",\r\n  pmovsxbq_2 =\t\"rro:660F3822rM|rx/ow:\",\r\n  pmovsxbw_2 =\t\"rro:660F3820rM|rx/oq:\",\r\n  pmovsxdq_2 =\t\"rro:660F3825rM|rx/oq:\",\r\n  pmovsxwd_2 =\t\"rro:660F3823rM|rx/oq:\",\r\n  pmovsxwq_2 =\t\"rro:660F3824rM|rx/od:\",\r\n  pmovzxbd_2 =\t\"rro:660F3831rM|rx/od:\",\r\n  pmovzxbq_2 =\t\"rro:660F3832rM|rx/ow:\",\r\n  pmovzxbw_2 =\t\"rro:660F3830rM|rx/oq:\",\r\n  pmovzxdq_2 =\t\"rro:660F3835rM|rx/oq:\",\r\n  pmovzxwd_2 =\t\"rro:660F3833rM|rx/oq:\",\r\n  pmovzxwq_2 =\t\"rro:660F3834rM|rx/od:\",\r\n  pmuldq_2 =\t\"rmo:660F3828rM\",\r\n  pmulld_2 =\t\"rmo:660F3840rM\",\r\n  ptest_2 =\t\"rmo:660F3817rM\",\r\n  roundpd_3 =\t\"rmio:660F3A09rMU\",\r\n  roundps_3 =\t\"rmio:660F3A08rMU\",\r\n  roundsd_3 =\t\"rrio:660F3A0BrMU|rxi/oq:\",\r\n  roundss_3 =\t\"rrio:660F3A0ArMU|rxi/od:\",\r\n\r\n  -- SSE4.2 ops\r\n  crc32_2 =\t\"rmqd:F20F38F1rM|rm/dw:66F20F38F1rM|rm/db:F20F38F0rM|rm/qb:\",\r\n  pcmpestri_3 =\t\"rmio:660F3A61rMU\",\r\n  pcmpestrm_3 =\t\"rmio:660F3A60rMU\",\r\n  pcmpgtq_2 =\t\"rmo:660F3837rM\",\r\n  pcmpistri_3 =\t\"rmio:660F3A63rMU\",\r\n  pcmpistrm_3 =\t\"rmio:660F3A62rMU\",\r\n  popcnt_2 =\t\"rmqdw:F30FB8rM\",\r\n\r\n  -- SSE4a\r\n  extrq_2 =\t\"rro:660F79rM\",\r\n  extrq_3 =\t\"riio:660F780mUU\",\r\n  insertq_2 =\t\"rro:F20F79rM\",\r\n  insertq_4 =\t\"rriio:F20F78rMUU\",\r\n  lzcnt_2 =\t\"rmqdw:F30FBDrM\",\r\n  movntsd_2 =\t\"xr/qo:nF20F2BRm\",\r\n  movntss_2 =\t\"xr/do:F30F2BRm\",\r\n  -- popcnt is also in SSE4.2\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Arithmetic ops.\r\nfor name,n in pairs{ add = 0, [\"or\"] = 1, adc = 2, sbb = 3,\r\n\t\t     [\"and\"] = 4, sub = 5, xor = 6, cmp = 7 } do\r\n  local n8 = shl(n, 3)\r\n  map_op[name..\"_2\"] = format(\r\n    \"mr:%02XRm|rm:%02XrM|mI1qdw:81%XmI|mS1qdw:83%XmS|Ri1qdwb:%02Xri|mi1qdwb:81%Xmi\",\r\n    1+n8, 3+n8, n, n, 5+n8, n)\r\nend\r\n\r\n-- Shift ops.\r\nfor name,n in pairs{ rol = 0, ror = 1, rcl = 2, rcr = 3,\r\n\t\t     shl = 4, shr = 5,          sar = 7, sal = 4 } do\r\n  map_op[name..\"_2\"] = format(\"m1:D1%Xm|mC1qdwb:D3%Xm|mi:C1%XmU\", n, n, n)\r\nend\r\n\r\n-- Conditional ops.\r\nfor cc,n in pairs(map_cc) do\r\n  map_op[\"j\"..cc..\"_1\"] = format(\"J.:n0F8%XJ\", n) -- short: 7%X\r\n  map_op[\"set\"..cc..\"_1\"] = format(\"mb:n0F9%X2m\", n)\r\n  map_op[\"cmov\"..cc..\"_2\"] = format(\"rmqdw:0F4%XrM\", n) -- P6+\r\nend\r\n\r\n-- FP arithmetic ops.\r\nfor name,n in pairs{ add = 0, mul = 1, com = 2, comp = 3,\r\n\t\t     sub = 4, subr = 5, div = 6, divr = 7 } do\r\n  local nc = 0xc0 + shl(n, 3)\r\n  local nr = nc + (n < 4 and 0 or (n % 2 == 0 and 8 or -8))\r\n  local fn = \"f\"..name\r\n  map_op[fn..\"_1\"] = format(\"ff:D8%02Xr|xd:D8%Xm|xq:nDC%Xm\", nc, n, n)\r\n  if n == 2 or n == 3 then\r\n    map_op[fn..\"_2\"] = format(\"Fff:D8%02XR|Fx2d:D8%XM|Fx2q:nDC%XM\", nc, n, n)\r\n  else\r\n    map_op[fn..\"_2\"] = format(\"Fff:D8%02XR|fFf:DC%02Xr|Fx2d:D8%XM|Fx2q:nDC%XM\", nc, nr, n, n)\r\n    map_op[fn..\"p_1\"] = format(\"ff:DE%02Xr\", nr)\r\n    map_op[fn..\"p_2\"] = format(\"fFf:DE%02Xr\", nr)\r\n  end\r\n  map_op[\"fi\"..name..\"_1\"] = format(\"xd:DA%Xm|xw:nDE%Xm\", n, n)\r\nend\r\n\r\n-- FP conditional moves.\r\nfor cc,n in pairs{ b=0, e=1, be=2, u=3, nb=4, ne=5, nbe=6, nu=7 } do\r\n  local nc = 0xdac0 + shl(band(n, 3), 3) + shl(band(n, 4), 6)\r\n  map_op[\"fcmov\"..cc..\"_1\"] = format(\"ff:%04Xr\", nc) -- P6+\r\n  map_op[\"fcmov\"..cc..\"_2\"] = format(\"Fff:%04XR\", nc) -- P6+\r\nend\r\n\r\n-- SSE FP arithmetic ops.\r\nfor name,n in pairs{ sqrt = 1, add = 8, mul = 9,\r\n\t\t     sub = 12, min = 13, div = 14, max = 15 } do\r\n  map_op[name..\"ps_2\"] = format(\"rmo:0F5%XrM\", n)\r\n  map_op[name..\"ss_2\"] = format(\"rro:F30F5%XrM|rx/od:\", n)\r\n  map_op[name..\"pd_2\"] = format(\"rmo:660F5%XrM\", n)\r\n  map_op[name..\"sd_2\"] = format(\"rro:F20F5%XrM|rx/oq:\", n)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Process pattern string.\r\nlocal function dopattern(pat, args, sz, op, needrex)\r\n  local digit, addin\r\n  local opcode = 0\r\n  local szov = sz\r\n  local narg = 1\r\n  local rex = 0\r\n\r\n  -- Limit number of section buffer positions used by a single dasm_put().\r\n  -- A single opcode needs a maximum of 5 positions.\r\n  if secpos+5 > maxsecpos then wflush() end\r\n\r\n  -- Process each character.\r\n  for c in gmatch(pat..\"|\", \".\") do\r\n    if match(c, \"%x\") then\t-- Hex digit.\r\n      digit = byte(c) - 48\r\n      if digit > 48 then digit = digit - 39\r\n      elseif digit > 16 then digit = digit - 7 end\r\n      opcode = opcode*16 + digit\r\n      addin = nil\r\n    elseif c == \"n\" then\t-- Disable operand size mods for opcode.\r\n      szov = nil\r\n    elseif c == \"X\" then\t-- Force REX.W.\r\n      rex = 8\r\n    elseif c == \"r\" then\t-- Merge 1st operand regno. into opcode.\r\n      addin = args[1]; opcode = opcode + (addin.reg % 8)\r\n      if narg < 2 then narg = 2 end\r\n    elseif c == \"R\" then\t-- Merge 2nd operand regno. into opcode.\r\n      addin = args[2]; opcode = opcode + (addin.reg % 8)\r\n      narg = 3\r\n    elseif c == \"m\" or c == \"M\" then\t-- Encode ModRM/SIB.\r\n      local s\r\n      if addin then\r\n\ts = addin.reg\r\n\topcode = opcode - band(s, 7)\t-- Undo regno opcode merge.\r\n      else\r\n\ts = band(opcode, 15)\t-- Undo last digit.\r\n\topcode = shr(opcode, 4)\r\n      end\r\n      local nn = c == \"m\" and 1 or 2\r\n      local t = args[nn]\r\n      if narg <= nn then narg = nn + 1 end\r\n      if szov == \"q\" and rex == 0 then rex = rex + 8 end\r\n      if t.reg and t.reg > 7 then rex = rex + 1 end\r\n      if t.xreg and t.xreg > 7 then rex = rex + 2 end\r\n      if s > 7 then rex = rex + 4 end\r\n      if needrex then rex = rex + 16 end\r\n      wputop(szov, opcode, rex); opcode = nil\r\n      local imark = sub(pat, -1) -- Force a mark (ugly).\r\n      -- Put ModRM/SIB with regno/last digit as spare.\r\n      wputmrmsib(t, imark, s, addin and addin.vreg)\r\n      addin = nil\r\n    else\r\n      if opcode then -- Flush opcode.\r\n\tif szov == \"q\" and rex == 0 then rex = rex + 8 end\r\n\tif needrex then rex = rex + 16 end\r\n\tif addin and addin.reg == -1 then\r\n\t  wputop(szov, opcode - 7, rex)\r\n\t  waction(\"VREG\", addin.vreg); wputxb(0)\r\n\telse\r\n\t  if addin and addin.reg > 7 then rex = rex + 1 end\r\n\t  wputop(szov, opcode, rex)\r\n\tend\r\n\topcode = nil\r\n      end\r\n      if c == \"|\" then break end\r\n      if c == \"o\" then -- Offset (pure 32 bit displacement).\r\n\twputdarg(args[1].disp); if narg < 2 then narg = 2 end\r\n      elseif c == \"O\" then\r\n\twputdarg(args[2].disp); narg = 3\r\n      else\r\n\t-- Anything else is an immediate operand.\r\n\tlocal a = args[narg]\r\n\tnarg = narg + 1\r\n\tlocal mode, imm = a.mode, a.imm\r\n\tif mode == \"iJ\" and not match(\"iIJ\", c) then\r\n\t  werror(\"bad operand size for label\")\r\n\tend\r\n\tif c == \"S\" then\r\n\t  wputsbarg(imm)\r\n\telseif c == \"U\" then\r\n\t  wputbarg(imm)\r\n\telseif c == \"W\" then\r\n\t  wputwarg(imm)\r\n\telseif c == \"i\" or c == \"I\" then\r\n\t  if mode == \"iJ\" then\r\n\t    wputlabel(\"IMM_\", imm, 1)\r\n\t  elseif mode == \"iI\" and c == \"I\" then\r\n\t    waction(sz == \"w\" and \"IMM_WB\" or \"IMM_DB\", imm)\r\n\t  else\r\n\t    wputszarg(sz, imm)\r\n\t  end\r\n\telseif c == \"J\" then\r\n\t  if mode == \"iPJ\" then\r\n\t    waction(\"REL_A\", imm) -- !x64 (secpos)\r\n\t  else\r\n\t    wputlabel(\"REL_\", imm, 2)\r\n\t  end\r\n\telse\r\n\t  werror(\"bad char `\"..c..\"' in pattern `\"..pat..\"' for `\"..op..\"'\")\r\n\tend\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Mapping of operand modes to short names. Suppress output with '#'.\r\nlocal map_modename = {\r\n  r = \"reg\", R = \"eax\", C = \"cl\", x = \"mem\", m = \"mrm\", i = \"imm\",\r\n  f = \"stx\", F = \"st0\", J = \"lbl\", [\"1\"] = \"1\",\r\n  I = \"#\", S = \"#\", O = \"#\",\r\n}\r\n\r\n-- Return a table/string showing all possible operand modes.\r\nlocal function templatehelp(template, nparams)\r\n  if nparams == 0 then return \"\" end\r\n  local t = {}\r\n  for tm in gmatch(template, \"[^%|]+\") do\r\n    local s = map_modename[sub(tm, 1, 1)]\r\n    s = s..gsub(sub(tm, 2, nparams), \".\", function(c)\r\n      return \", \"..map_modename[c]\r\n    end)\r\n    if not match(s, \"#\") then t[#t+1] = s end\r\n  end\r\n  return t\r\nend\r\n\r\n-- Match operand modes against mode match part of template.\r\nlocal function matchtm(tm, args)\r\n  for i=1,#args do\r\n    if not match(args[i].mode, sub(tm, i, i)) then return end\r\n  end\r\n  return true\r\nend\r\n\r\n-- Handle opcodes defined with template strings.\r\nmap_op[\".template__\"] = function(params, template, nparams)\r\n  if not params then return templatehelp(template, nparams) end\r\n  local args = {}\r\n\r\n  -- Zero-operand opcodes have no match part.\r\n  if #params == 0 then\r\n    dopattern(template, args, \"d\", params.op, nil)\r\n    return\r\n  end\r\n\r\n  -- Determine common operand size (coerce undefined size) or flag as mixed.\r\n  local sz, szmix, needrex\r\n  for i,p in ipairs(params) do\r\n    args[i] = parseoperand(p)\r\n    local nsz = args[i].opsize\r\n    if nsz then\r\n      if sz and sz ~= nsz then szmix = true else sz = nsz end\r\n    end\r\n    local nrex = args[i].needrex\r\n    if nrex ~= nil then\r\n      if needrex == nil then\r\n\tneedrex = nrex\r\n      elseif needrex ~= nrex then\r\n\twerror(\"bad mix of byte-addressable registers\")\r\n      end\r\n    end\r\n  end\r\n\r\n  -- Try all match:pattern pairs (separated by '|').\r\n  local gotmatch, lastpat\r\n  for tm in gmatch(template, \"[^%|]+\") do\r\n    -- Split off size match (starts after mode match) and pattern string.\r\n    local szm, pat = match(tm, \"^(.-):(.*)$\", #args+1)\r\n    if pat == \"\" then pat = lastpat else lastpat = pat end\r\n    if matchtm(tm, args) then\r\n      local prefix = sub(szm, 1, 1)\r\n      if prefix == \"/\" then -- Match both operand sizes.\r\n\tif args[1].opsize == sub(szm, 2, 2) and\r\n\t   args[2].opsize == sub(szm, 3, 3) then\r\n\t  dopattern(pat, args, sz, params.op, needrex) -- Process pattern.\r\n\t  return\r\n\tend\r\n      else -- Match common operand size.\r\n\tlocal szp = sz\r\n\tif szm == \"\" then szm = x64 and \"qdwb\" or \"dwb\" end -- Default sizes.\r\n\tif prefix == \"1\" then szp = args[1].opsize; szmix = nil\r\n\telseif prefix == \"2\" then szp = args[2].opsize; szmix = nil end\r\n\tif not szmix and (prefix == \".\" or match(szm, szp or \"#\")) then\r\n\t  dopattern(pat, args, szp, params.op, needrex) -- Process pattern.\r\n\t  return\r\n\tend\r\n      end\r\n      gotmatch = true\r\n    end\r\n  end\r\n\r\n  local msg = \"bad operand mode\"\r\n  if gotmatch then\r\n    if szmix then\r\n      msg = \"mixed operand size\"\r\n    else\r\n      msg = sz and \"bad operand size\" or \"missing operand size\"\r\n    end\r\n  end\r\n\r\n  werror(msg..\" in `\"..opmodestr(params.op, args)..\"'\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- x64-specific opcode for 64 bit immediates and displacements.\r\nif x64 then\r\n  function map_op.mov64_2(params)\r\n    if not params then return { \"reg, imm\", \"reg, [disp]\", \"[disp], reg\" } end\r\n    if secpos+2 > maxsecpos then wflush() end\r\n    local opcode, op64, sz, rex, vreg\r\n    local op64 = match(params[1], \"^%[%s*(.-)%s*%]$\")\r\n    if op64 then\r\n      local a = parseoperand(params[2])\r\n      if a.mode ~= \"rmR\" then werror(\"bad operand mode\") end\r\n      sz = a.opsize\r\n      rex = sz == \"q\" and 8 or 0\r\n      opcode = 0xa3\r\n    else\r\n      op64 = match(params[2], \"^%[%s*(.-)%s*%]$\")\r\n      local a = parseoperand(params[1])\r\n      if op64 then\r\n\tif a.mode ~= \"rmR\" then werror(\"bad operand mode\") end\r\n\tsz = a.opsize\r\n\trex = sz == \"q\" and 8 or 0\r\n\topcode = 0xa1\r\n      else\r\n\tif sub(a.mode, 1, 1) ~= \"r\" or a.opsize ~= \"q\" then\r\n\t  werror(\"bad operand mode\")\r\n\tend\r\n\top64 = params[2]\r\n\tif a.reg == -1 then\r\n\t  vreg = a.vreg\r\n\t  opcode = 0xb8\r\n\telse\r\n\t  opcode = 0xb8 + band(a.reg, 7)\r\n\tend\r\n\trex = a.reg > 7 and 9 or 8\r\n      end\r\n    end\r\n    wputop(sz, opcode, rex)\r\n    if vreg then waction(\"VREG\", vreg); wputxb(0) end\r\n    waction(\"IMM_D\", format(\"(unsigned int)(%s)\", op64))\r\n    waction(\"IMM_D\", format(\"(unsigned int)((%s)>>32)\", op64))\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcodes for data storage.\r\nlocal function op_data(params)\r\n  if not params then return \"imm...\" end\r\n  local sz = sub(params.op, 2, 2)\r\n  if sz == \"a\" then sz = addrsize end\r\n  for _,p in ipairs(params) do\r\n    local a = parseoperand(p)\r\n    if sub(a.mode, 1, 1) ~= \"i\" or (a.opsize and a.opsize ~= sz) then\r\n      werror(\"bad mode or size in `\"..p..\"'\")\r\n    end\r\n    if a.mode == \"iJ\" then\r\n      wputlabel(\"IMM_\", a.imm, 1)\r\n    else\r\n      wputszarg(sz, a.imm)\r\n    end\r\n    if secpos+2 > maxsecpos then wflush() end\r\n  end\r\nend\r\n\r\nmap_op[\".byte_*\"] = op_data\r\nmap_op[\".sbyte_*\"] = op_data\r\nmap_op[\".word_*\"] = op_data\r\nmap_op[\".dword_*\"] = op_data\r\nmap_op[\".aword_*\"] = op_data\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode to mark the position where the action list is to be emitted.\r\nmap_op[\".actionlist_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeactions(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global enum is to be emitted.\r\nmap_op[\".globals_1\"] = function(params)\r\n  if not params then return \"prefix\" end\r\n  local prefix = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobals(out, prefix) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the global names are to be emitted.\r\nmap_op[\".globalnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeglobalnames(out, name) end)\r\nend\r\n\r\n-- Pseudo-opcode to mark the position where the extern names are to be emitted.\r\nmap_op[\".externnames_1\"] = function(params)\r\n  if not params then return \"cvar\" end\r\n  local name = params[1] -- No syntax check. You get to keep the pieces.\r\n  wline(function(out) writeexternnames(out, name) end)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Label pseudo-opcode (converted from trailing colon form).\r\nmap_op[\".label_2\"] = function(params)\r\n  if not params then return \"[1-9] | ->global | =>pcexpr  [, addr]\" end\r\n  if secpos+2 > maxsecpos then wflush() end\r\n  local a = parseoperand(params[1])\r\n  local mode, imm = a.mode, a.imm\r\n  if type(imm) == \"number\" and (mode == \"iJ\" or (imm >= 1 and imm <= 9)) then\r\n    -- Local label (1: ... 9:) or global label (->global:).\r\n    waction(\"LABEL_LG\", nil, 1)\r\n    wputxb(imm)\r\n  elseif mode == \"iJ\" then\r\n    -- PC label (=>pcexpr:).\r\n    waction(\"LABEL_PC\", imm)\r\n  else\r\n    werror(\"bad label definition\")\r\n  end\r\n  -- SETLABEL must immediately follow LABEL_LG/LABEL_PC.\r\n  local addr = params[2]\r\n  if addr then\r\n    local a = parseoperand(addr)\r\n    if a.mode == \"iPJ\" then\r\n      waction(\"SETLABEL\", a.imm)\r\n    else\r\n      werror(\"bad label assignment\")\r\n    end\r\n  end\r\nend\r\nmap_op[\".label_1\"] = map_op[\".label_2\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Alignment pseudo-opcode.\r\nmap_op[\".align_1\"] = function(params)\r\n  if not params then return \"numpow2\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  local align = tonumber(params[1]) or map_opsizenum[map_opsize[params[1]]]\r\n  if align then\r\n    local x = align\r\n    -- Must be a power of 2 in the range (2 ... 256).\r\n    for i=1,8 do\r\n      x = x / 2\r\n      if x == 1 then\r\n\twaction(\"ALIGN\", nil, 1)\r\n\twputxb(align-1) -- Action byte is 2**n-1.\r\n\treturn\r\n      end\r\n    end\r\n  end\r\n  werror(\"bad alignment\")\r\nend\r\n\r\n-- Spacing pseudo-opcode.\r\nmap_op[\".space_2\"] = function(params)\r\n  if not params then return \"num [, filler]\" end\r\n  if secpos+1 > maxsecpos then wflush() end\r\n  waction(\"SPACE\", params[1])\r\n  local fill = params[2]\r\n  if fill then\r\n    fill = tonumber(fill)\r\n    if not fill or fill < 0 or fill > 255 then werror(\"bad filler\") end\r\n  end\r\n  wputxb(fill or 0)\r\nend\r\nmap_op[\".space_1\"] = map_op[\".space_2\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pseudo-opcode for (primitive) type definitions (map to C types).\r\nmap_op[\".type_3\"] = function(params, nparams)\r\n  if not params then\r\n    return nparams == 2 and \"name, ctype\" or \"name, ctype, reg\"\r\n  end\r\n  local name, ctype, reg = params[1], params[2], params[3]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    werror(\"bad type name `\"..name..\"'\")\r\n  end\r\n  local tp = map_type[name]\r\n  if tp then\r\n    werror(\"duplicate type `\"..name..\"'\")\r\n  end\r\n  if reg and not map_reg_valid_base[reg] then\r\n    werror(\"bad base register `\"..(map_reg_rev[reg] or reg)..\"'\")\r\n  end\r\n  -- Add #type to defines. A bit unclean to put it in map_archdef.\r\n  map_archdef[\"#\"..name] = \"sizeof(\"..ctype..\")\"\r\n  -- Add new type and emit shortcut define.\r\n  local num = ctypenum + 1\r\n  map_type[name] = {\r\n    ctype = ctype,\r\n    ctypefmt = format(\"Dt%X(%%s)\", num),\r\n    reg = reg,\r\n  }\r\n  wline(format(\"#define Dt%X(_V) (int)(ptrdiff_t)&(((%s *)0)_V)\", num, ctype))\r\n  ctypenum = num\r\nend\r\nmap_op[\".type_2\"] = map_op[\".type_3\"]\r\n\r\n-- Dump type definitions.\r\nlocal function dumptypes(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_type) do t[#t+1] = name end\r\n  sort(t)\r\n  out:write(\"Type definitions:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local tp = map_type[name]\r\n    local reg = tp.reg and map_reg_rev[tp.reg] or \"\"\r\n    out:write(format(\"  %-20s %-20s %s\\n\", name, tp.ctype, reg))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Set the current section.\r\nfunction _M.section(num)\r\n  waction(\"SECTION\")\r\n  wputxb(num)\r\n  wflush(true) -- SECTION is a terminal action.\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump architecture description.\r\nfunction _M.dumparch(out)\r\n  out:write(format(\"DynASM %s version %s, released %s\\n\\n\",\r\n    _info.arch, _info.version, _info.release))\r\n  dumpregs(out)\r\n  dumpactions(out)\r\nend\r\n\r\n-- Dump all user defined elements.\r\nfunction _M.dumpdef(out, lvl)\r\n  dumptypes(out, lvl)\r\n  dumpglobals(out, lvl)\r\n  dumpexterns(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Pass callbacks from/to the DynASM core.\r\nfunction _M.passcb(wl, we, wf, ww)\r\n  wline, werror, wfatal, wwarn = wl, we, wf, ww\r\n  return wflush\r\nend\r\n\r\n-- Setup the arch-specific module.\r\nfunction _M.setup(arch, opt)\r\n  g_arch, g_opt = arch, opt\r\nend\r\n\r\n-- Merge the core maps and the arch-specific maps.\r\nfunction _M.mergemaps(map_coreop, map_def)\r\n  setmetatable(map_op, { __index = map_coreop })\r\n  setmetatable(map_def, { __index = map_archdef })\r\n  return map_op, map_def\r\nend\r\n\r\nreturn _M\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/dynasm/dynasm.lua",
    "content": "------------------------------------------------------------------------------\r\n-- DynASM. A dynamic assembler for code generation engines.\r\n-- Originally designed and implemented for LuaJIT.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- See below for full copyright notice.\r\n------------------------------------------------------------------------------\r\n\r\n-- Application information.\r\nlocal _info = {\r\n  name =\t\"DynASM\",\r\n  description =\t\"A dynamic assembler for code generation engines\",\r\n  version =\t\"1.3.0\",\r\n  vernum =\t 10300,\r\n  release =\t\"2011-05-05\",\r\n  author =\t\"Mike Pall\",\r\n  url =\t\t\"http://luajit.org/dynasm.html\",\r\n  license =\t\"MIT\",\r\n  copyright =\t[[\r\nCopyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining\r\na copy of this software and associated documentation files (the\r\n\"Software\"), to deal in the Software without restriction, including\r\nwithout limitation the rights to use, copy, modify, merge, publish,\r\ndistribute, sublicense, and/or sell copies of the Software, and to\r\npermit persons to whom the Software is furnished to do so, subject to\r\nthe following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be\r\nincluded in all copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n[ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n]],\r\n}\r\n\r\n-- Cache library functions.\r\nlocal type, pairs, ipairs = type, pairs, ipairs\r\nlocal pcall, error, assert = pcall, error, assert\r\nlocal _s = string\r\nlocal sub, match, gmatch, gsub = _s.sub, _s.match, _s.gmatch, _s.gsub\r\nlocal format, rep, upper = _s.format, _s.rep, _s.upper\r\nlocal _t = table\r\nlocal insert, remove, concat, sort = _t.insert, _t.remove, _t.concat, _t.sort\r\nlocal exit = os.exit\r\nlocal io = io\r\nlocal stdin, stdout, stderr = io.stdin, io.stdout, io.stderr\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Program options.\r\nlocal g_opt = {}\r\n\r\n-- Global state for current file.\r\nlocal g_fname, g_curline, g_indent, g_lineno, g_synclineno, g_arch\r\nlocal g_errcount = 0\r\n\r\n-- Write buffer for output file.\r\nlocal g_wbuffer, g_capbuffer\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Write an output line (or callback function) to the buffer.\r\nlocal function wline(line, needindent)\r\n  local buf = g_capbuffer or g_wbuffer\r\n  buf[#buf+1] = needindent and g_indent..line or line\r\n  g_synclineno = g_synclineno + 1\r\nend\r\n\r\n-- Write assembler line as a comment, if requestd.\r\nlocal function wcomment(aline)\r\n  if g_opt.comment then\r\n    wline(g_opt.comment..aline..g_opt.endcomment, true)\r\n  end\r\nend\r\n\r\n-- Resync CPP line numbers.\r\nlocal function wsync()\r\n  if g_synclineno ~= g_lineno and g_opt.cpp then\r\n    wline(\"#line \"..g_lineno..' \"'..g_fname..'\"')\r\n    g_synclineno = g_lineno\r\n  end\r\nend\r\n\r\n-- Dummy action flush function. Replaced with arch-specific function later.\r\nlocal function wflush(term)\r\nend\r\n\r\n-- Dump all buffered output lines.\r\nlocal function wdumplines(out, buf)\r\n  for _,line in ipairs(buf) do\r\n    if type(line) == \"string\" then\r\n      assert(out:write(line, \"\\n\"))\r\n    else\r\n      -- Special callback to dynamically insert lines after end of processing.\r\n      line(out)\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Emit an error. Processing continues with next statement.\r\nlocal function werror(msg)\r\n  error(format(\"%s:%s: error: %s:\\n%s\", g_fname, g_lineno, msg, g_curline), 0)\r\nend\r\n\r\n-- Emit a fatal error. Processing stops.\r\nlocal function wfatal(msg)\r\n  g_errcount = \"fatal\"\r\n  werror(msg)\r\nend\r\n\r\n-- Print a warning. Processing continues.\r\nlocal function wwarn(msg)\r\n  stderr:write(format(\"%s:%s: warning: %s:\\n%s\\n\",\r\n    g_fname, g_lineno, msg, g_curline))\r\nend\r\n\r\n-- Print caught error message. But suppress excessive errors.\r\nlocal function wprinterr(...)\r\n  if type(g_errcount) == \"number\" then\r\n    -- Regular error.\r\n    g_errcount = g_errcount + 1\r\n    if g_errcount < 21 then -- Seems to be a reasonable limit.\r\n      stderr:write(...)\r\n    elseif g_errcount == 21 then\r\n      stderr:write(g_fname,\r\n\t\":*: warning: too many errors (suppressed further messages).\\n\")\r\n    end\r\n  else\r\n    -- Fatal error.\r\n    stderr:write(...)\r\n    return true -- Stop processing.\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Map holding all option handlers.\r\nlocal opt_map = {}\r\nlocal opt_current\r\n\r\n-- Print error and exit with error status.\r\nlocal function opterror(...)\r\n  stderr:write(\"dynasm.lua: ERROR: \", ...)\r\n  stderr:write(\"\\n\")\r\n  exit(1)\r\nend\r\n\r\n-- Get option parameter.\r\nlocal function optparam(args)\r\n  local argn = args.argn\r\n  local p = args[argn]\r\n  if not p then\r\n    opterror(\"missing parameter for option `\", opt_current, \"'.\")\r\n  end\r\n  args.argn = argn + 1\r\n  return p\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Core pseudo-opcodes.\r\nlocal map_coreop = {}\r\n-- Dummy opcode map. Replaced by arch-specific map.\r\nlocal map_op = {}\r\n\r\n-- Forward declarations.\r\nlocal dostmt\r\nlocal readfile\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Map for defines (initially empty, chains to arch-specific map).\r\nlocal map_def = {}\r\n\r\n-- Pseudo-opcode to define a substitution.\r\nmap_coreop[\".define_2\"] = function(params, nparams)\r\n  if not params then return nparams == 1 and \"name\" or \"name, subst\" end\r\n  local name, def = params[1], params[2] or \"1\"\r\n  if not match(name, \"^[%a_][%w_]*$\") then werror(\"bad or duplicate define\") end\r\n  map_def[name] = def\r\nend\r\nmap_coreop[\".define_1\"] = map_coreop[\".define_2\"]\r\n\r\n-- Define a substitution on the command line.\r\nfunction opt_map.D(args)\r\n  local namesubst = optparam(args)\r\n  local name, subst = match(namesubst, \"^([%a_][%w_]*)=(.*)$\")\r\n  if name then\r\n    map_def[name] = subst\r\n  elseif match(namesubst, \"^[%a_][%w_]*$\") then\r\n    map_def[namesubst] = \"1\"\r\n  else\r\n    opterror(\"bad define\")\r\n  end\r\nend\r\n\r\n-- Undefine a substitution on the command line.\r\nfunction opt_map.U(args)\r\n  local name = optparam(args)\r\n  if match(name, \"^[%a_][%w_]*$\") then\r\n    map_def[name] = nil\r\n  else\r\n    opterror(\"bad define\")\r\n  end\r\nend\r\n\r\n-- Helper for definesubst.\r\nlocal gotsubst\r\n\r\nlocal function definesubst_one(word)\r\n  local subst = map_def[word]\r\n  if subst then gotsubst = word; return subst else return word end\r\nend\r\n\r\n-- Iteratively substitute defines.\r\nlocal function definesubst(stmt)\r\n  -- Limit number of iterations.\r\n  for i=1,100 do\r\n    gotsubst = false\r\n    stmt = gsub(stmt, \"#?[%w_]+\", definesubst_one)\r\n    if not gotsubst then break end\r\n  end\r\n  if gotsubst then wfatal(\"recursive define involving `\"..gotsubst..\"'\") end\r\n  return stmt\r\nend\r\n\r\n-- Dump all defines.\r\nlocal function dumpdefines(out, lvl)\r\n  local t = {}\r\n  for name in pairs(map_def) do\r\n    t[#t+1] = name\r\n  end\r\n  sort(t)\r\n  out:write(\"Defines:\\n\")\r\n  for _,name in ipairs(t) do\r\n    local subst = map_def[name]\r\n    if g_arch then subst = g_arch.revdef(subst) end\r\n    out:write(format(\"  %-20s %s\\n\", name, subst))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for conditional assembly.\r\nlocal condlevel = 0\r\nlocal condstack = {}\r\n\r\n-- Evaluate condition with a Lua expression. Substitutions already performed.\r\nlocal function cond_eval(cond)\r\n  local func, err\r\n  if setfenv then\r\n    func, err = loadstring(\"return \"..cond, \"=expr\")\r\n  else\r\n    -- No globals. All unknown identifiers evaluate to nil.\r\n    func, err = load(\"return \"..cond, \"=expr\", \"t\", {})\r\n  end\r\n  if func then\r\n    if setfenv then\r\n      setfenv(func, {}) -- No globals. All unknown identifiers evaluate to nil.\r\n    end\r\n    local ok, res = pcall(func)\r\n    if ok then\r\n      if res == 0 then return false end -- Oh well.\r\n      return not not res\r\n    end\r\n    err = res\r\n  end\r\n  wfatal(\"bad condition: \"..err)\r\nend\r\n\r\n-- Skip statements until next conditional pseudo-opcode at the same level.\r\nlocal function stmtskip()\r\n  local dostmt_save = dostmt\r\n  local lvl = 0\r\n  dostmt = function(stmt)\r\n    local op = match(stmt, \"^%s*(%S+)\")\r\n    if op == \".if\" then\r\n      lvl = lvl + 1\r\n    elseif lvl ~= 0 then\r\n      if op == \".endif\" then lvl = lvl - 1 end\r\n    elseif op == \".elif\" or op == \".else\" or op == \".endif\" then\r\n      dostmt = dostmt_save\r\n      dostmt(stmt)\r\n    end\r\n  end\r\nend\r\n\r\n-- Pseudo-opcodes for conditional assembly.\r\nmap_coreop[\".if_1\"] = function(params)\r\n  if not params then return \"condition\" end\r\n  local lvl = condlevel + 1\r\n  local res = cond_eval(params[1])\r\n  condlevel = lvl\r\n  condstack[lvl] = res\r\n  if not res then stmtskip() end\r\nend\r\n\r\nmap_coreop[\".elif_1\"] = function(params)\r\n  if not params then return \"condition\" end\r\n  if condlevel == 0 then wfatal(\".elif without .if\") end\r\n  local lvl = condlevel\r\n  local res = condstack[lvl]\r\n  if res then\r\n    if res == \"else\" then wfatal(\".elif after .else\") end\r\n  else\r\n    res = cond_eval(params[1])\r\n    if res then\r\n      condstack[lvl] = res\r\n      return\r\n    end\r\n  end\r\n  stmtskip()\r\nend\r\n\r\nmap_coreop[\".else_0\"] = function(params)\r\n  if condlevel == 0 then wfatal(\".else without .if\") end\r\n  local lvl = condlevel\r\n  local res = condstack[lvl]\r\n  condstack[lvl] = \"else\"\r\n  if res then\r\n    if res == \"else\" then wfatal(\".else after .else\") end\r\n    stmtskip()\r\n  end\r\nend\r\n\r\nmap_coreop[\".endif_0\"] = function(params)\r\n  local lvl = condlevel\r\n  if lvl == 0 then wfatal(\".endif without .if\") end\r\n  condlevel = lvl - 1\r\nend\r\n\r\n-- Check for unfinished conditionals.\r\nlocal function checkconds()\r\n  if g_errcount ~= \"fatal\" and condlevel ~= 0 then\r\n    wprinterr(g_fname, \":*: error: unbalanced conditional\\n\")\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Search for a file in the given path and open it for reading.\r\nlocal function pathopen(path, name)\r\n  local dirsep = package and match(package.path, \"\\\\\") and \"\\\\\" or \"/\"\r\n  for _,p in ipairs(path) do\r\n    local fullname = p == \"\" and name or p..dirsep..name\r\n    local fin = io.open(fullname, \"r\")\r\n    if fin then\r\n      g_fname = fullname\r\n      return fin\r\n    end\r\n  end\r\nend\r\n\r\n-- Include a file.\r\nmap_coreop[\".include_1\"] = function(params)\r\n  if not params then return \"filename\" end\r\n  local name = params[1]\r\n  -- Save state. Ugly, I know. but upvalues are fast.\r\n  local gf, gl, gcl, gi = g_fname, g_lineno, g_curline, g_indent\r\n  -- Read the included file.\r\n  local fatal = readfile(pathopen(g_opt.include, name) or\r\n\t\t\t wfatal(\"include file `\"..name..\"' not found\"))\r\n  -- Restore state.\r\n  g_synclineno = -1\r\n  g_fname, g_lineno, g_curline, g_indent = gf, gl, gcl, gi\r\n  if fatal then wfatal(\"in include file\") end\r\nend\r\n\r\n-- Make .include and conditionals initially available, too.\r\nmap_op[\".include_1\"] = map_coreop[\".include_1\"]\r\nmap_op[\".if_1\"] = map_coreop[\".if_1\"]\r\nmap_op[\".elif_1\"] = map_coreop[\".elif_1\"]\r\nmap_op[\".else_0\"] = map_coreop[\".else_0\"]\r\nmap_op[\".endif_0\"] = map_coreop[\".endif_0\"]\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for macros.\r\nlocal mac_capture, mac_lineno, mac_name\r\nlocal mac_active = {}\r\nlocal mac_list = {}\r\n\r\n-- Pseudo-opcode to define a macro.\r\nmap_coreop[\".macro_*\"] = function(mparams)\r\n  if not mparams then return \"name [, params...]\" end\r\n  -- Split off and validate macro name.\r\n  local name = remove(mparams, 1)\r\n  if not name then werror(\"missing macro name\") end\r\n  if not (match(name, \"^[%a_][%w_%.]*$\") or match(name, \"^%.[%w_%.]*$\")) then\r\n    wfatal(\"bad macro name `\"..name..\"'\")\r\n  end\r\n  -- Validate macro parameter names.\r\n  local mdup = {}\r\n  for _,mp in ipairs(mparams) do\r\n    if not match(mp, \"^[%a_][%w_]*$\") then\r\n      wfatal(\"bad macro parameter name `\"..mp..\"'\")\r\n    end\r\n    if mdup[mp] then wfatal(\"duplicate macro parameter name `\"..mp..\"'\") end\r\n    mdup[mp] = true\r\n  end\r\n  -- Check for duplicate or recursive macro definitions.\r\n  local opname = name..\"_\"..#mparams\r\n  if map_op[opname] or map_op[name..\"_*\"] then\r\n    wfatal(\"duplicate macro `\"..name..\"' (\"..#mparams..\" parameters)\")\r\n  end\r\n  if mac_capture then wfatal(\"recursive macro definition\") end\r\n\r\n  -- Enable statement capture.\r\n  local lines = {}\r\n  mac_lineno = g_lineno\r\n  mac_name = name\r\n  mac_capture = function(stmt) -- Statement capture function.\r\n    -- Stop macro definition with .endmacro pseudo-opcode.\r\n    if not match(stmt, \"^%s*.endmacro%s*$\") then\r\n      lines[#lines+1] = stmt\r\n      return\r\n    end\r\n    mac_capture = nil\r\n    mac_lineno = nil\r\n    mac_name = nil\r\n    mac_list[#mac_list+1] = opname\r\n    -- Add macro-op definition.\r\n    map_op[opname] = function(params)\r\n      if not params then return mparams, lines end\r\n      -- Protect against recursive macro invocation.\r\n      if mac_active[opname] then wfatal(\"recursive macro invocation\") end\r\n      mac_active[opname] = true\r\n      -- Setup substitution map.\r\n      local subst = {}\r\n      for i,mp in ipairs(mparams) do subst[mp] = params[i] end\r\n      local mcom\r\n      if g_opt.maccomment and g_opt.comment then\r\n\tmcom = \" MACRO \"..name..\" (\"..#mparams..\")\"\r\n\twcomment(\"{\"..mcom)\r\n      end\r\n      -- Loop through all captured statements\r\n      for _,stmt in ipairs(lines) do\r\n\t-- Substitute macro parameters.\r\n\tlocal st = gsub(stmt, \"[%w_]+\", subst)\r\n\tst = definesubst(st)\r\n\tst = gsub(st, \"%s*%.%.%s*\", \"\") -- Token paste a..b.\r\n\tif mcom and sub(st, 1, 1) ~= \"|\" then wcomment(st) end\r\n\t-- Emit statement. Use a protected call for better diagnostics.\r\n\tlocal ok, err = pcall(dostmt, st)\r\n\tif not ok then\r\n\t  -- Add the captured statement to the error.\r\n\t  wprinterr(err, \"\\n\", g_indent, \"|  \", stmt,\r\n\t\t    \"\\t[MACRO \", name, \" (\", #mparams, \")]\\n\")\r\n\tend\r\n      end\r\n      if mcom then wcomment(\"}\"..mcom) end\r\n      mac_active[opname] = nil\r\n    end\r\n  end\r\nend\r\n\r\n-- An .endmacro pseudo-opcode outside of a macro definition is an error.\r\nmap_coreop[\".endmacro_0\"] = function(params)\r\n  wfatal(\".endmacro without .macro\")\r\nend\r\n\r\n-- Dump all macros and their contents (with -PP only).\r\nlocal function dumpmacros(out, lvl)\r\n  sort(mac_list)\r\n  out:write(\"Macros:\\n\")\r\n  for _,opname in ipairs(mac_list) do\r\n    local name = sub(opname, 1, -3)\r\n    local params, lines = map_op[opname]()\r\n    out:write(format(\"  %-20s %s\\n\", name, concat(params, \", \")))\r\n    if lvl > 1 then\r\n      for _,line in ipairs(lines) do\r\n\tout:write(\"  |\", line, \"\\n\")\r\n      end\r\n      out:write(\"\\n\")\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Check for unfinished macro definitions.\r\nlocal function checkmacros()\r\n  if mac_capture then\r\n    wprinterr(g_fname, \":\", mac_lineno,\r\n\t      \": error: unfinished .macro `\", mac_name ,\"'\\n\")\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Support variables for captures.\r\nlocal cap_lineno, cap_name\r\nlocal cap_buffers = {}\r\nlocal cap_used = {}\r\n\r\n-- Start a capture.\r\nmap_coreop[\".capture_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wflush()\r\n  local name = params[1]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    wfatal(\"bad capture name `\"..name..\"'\")\r\n  end\r\n  if cap_name then\r\n    wfatal(\"already capturing to `\"..cap_name..\"' since line \"..cap_lineno)\r\n  end\r\n  cap_name = name\r\n  cap_lineno = g_lineno\r\n  -- Create or continue a capture buffer and start the output line capture.\r\n  local buf = cap_buffers[name]\r\n  if not buf then buf = {}; cap_buffers[name] = buf end\r\n  g_capbuffer = buf\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Stop a capture.\r\nmap_coreop[\".endcapture_0\"] = function(params)\r\n  wflush()\r\n  if not cap_name then wfatal(\".endcapture without a valid .capture\") end\r\n  cap_name = nil\r\n  cap_lineno = nil\r\n  g_capbuffer = nil\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Dump a capture buffer.\r\nmap_coreop[\".dumpcapture_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wflush()\r\n  local name = params[1]\r\n  if not match(name, \"^[%a_][%w_]*$\") then\r\n    wfatal(\"bad capture name `\"..name..\"'\")\r\n  end\r\n  cap_used[name] = true\r\n  wline(function(out)\r\n    local buf = cap_buffers[name]\r\n    if buf then wdumplines(out, buf) end\r\n  end)\r\n  g_synclineno = 0\r\nend\r\n\r\n-- Dump all captures and their buffers (with -PP only).\r\nlocal function dumpcaptures(out, lvl)\r\n  out:write(\"Captures:\\n\")\r\n  for name,buf in pairs(cap_buffers) do\r\n    out:write(format(\"  %-20s %4s)\\n\", name, \"(\"..#buf))\r\n    if lvl > 1 then\r\n      local bar = rep(\"=\", 76)\r\n      out:write(\"  \", bar, \"\\n\")\r\n      for _,line in ipairs(buf) do\r\n\tout:write(\"  \", line, \"\\n\")\r\n      end\r\n      out:write(\"  \", bar, \"\\n\\n\")\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n-- Check for unfinished or unused captures.\r\nlocal function checkcaptures()\r\n  if cap_name then\r\n    wprinterr(g_fname, \":\", cap_lineno,\r\n\t      \": error: unfinished .capture `\", cap_name,\"'\\n\")\r\n    return\r\n  end\r\n  for name in pairs(cap_buffers) do\r\n    if not cap_used[name] then\r\n      wprinterr(g_fname, \":*: error: missing .dumpcapture \", name ,\"\\n\")\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Sections names.\r\nlocal map_sections = {}\r\n\r\n-- Pseudo-opcode to define code sections.\r\n-- TODO: Data sections, BSS sections. Needs extra C code and API.\r\nmap_coreop[\".section_*\"] = function(params)\r\n  if not params then return \"name...\" end\r\n  if #map_sections > 0 then werror(\"duplicate section definition\") end\r\n  wflush()\r\n  for sn,name in ipairs(params) do\r\n    local opname = \".\"..name..\"_0\"\r\n    if not match(name, \"^[%a][%w_]*$\") or\r\n       map_op[opname] or map_op[\".\"..name..\"_*\"] then\r\n      werror(\"bad section name `\"..name..\"'\")\r\n    end\r\n    map_sections[#map_sections+1] = name\r\n    wline(format(\"#define DASM_SECTION_%s\\t%d\", upper(name), sn-1))\r\n    map_op[opname] = function(params) g_arch.section(sn-1) end\r\n  end\r\n  wline(format(\"#define DASM_MAXSECTION\\t\\t%d\", #map_sections))\r\nend\r\n\r\n-- Dump all sections.\r\nlocal function dumpsections(out, lvl)\r\n  out:write(\"Sections:\\n\")\r\n  for _,name in ipairs(map_sections) do\r\n    out:write(format(\"  %s\\n\", name))\r\n  end\r\n  out:write(\"\\n\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Replacement for customized Lua, which lacks the package library.\r\nlocal prefix = \"\"\r\nif not require then\r\n  function require(name)\r\n    local fp = assert(io.open(prefix..name..\".lua\"))\r\n    local s = fp:read(\"*a\")\r\n    assert(fp:close())\r\n    return assert(loadstring(s, \"@\"..name..\".lua\"))()\r\n  end\r\nend\r\n\r\n-- Load architecture-specific module.\r\nlocal function loadarch(arch)\r\n  if not match(arch, \"^[%w_]+$\") then return \"bad arch name\" end\r\n  local ok, m_arch = pcall(require, \"dasm_\"..arch)\r\n  if not ok then return \"cannot load module: \"..m_arch end\r\n  g_arch = m_arch\r\n  wflush = m_arch.passcb(wline, werror, wfatal, wwarn)\r\n  m_arch.setup(arch, g_opt)\r\n  map_op, map_def = m_arch.mergemaps(map_coreop, map_def)\r\nend\r\n\r\n-- Dump architecture description.\r\nfunction opt_map.dumparch(args)\r\n  local name = optparam(args)\r\n  if not g_arch then\r\n    local err = loadarch(name)\r\n    if err then opterror(err) end\r\n  end\r\n\r\n  local t = {}\r\n  for name in pairs(map_coreop) do t[#t+1] = name end\r\n  for name in pairs(map_op) do t[#t+1] = name end\r\n  sort(t)\r\n\r\n  local out = stdout\r\n  local _arch = g_arch._info\r\n  out:write(format(\"%s version %s, released %s, %s\\n\",\r\n    _info.name, _info.version, _info.release, _info.url))\r\n  g_arch.dumparch(out)\r\n\r\n  local pseudo = true\r\n  out:write(\"Pseudo-Opcodes:\\n\")\r\n  for _,sname in ipairs(t) do\r\n    local name, nparam = match(sname, \"^(.+)_([0-9%*])$\")\r\n    if name then\r\n      if pseudo and sub(name, 1, 1) ~= \".\" then\r\n\tout:write(\"\\nOpcodes:\\n\")\r\n\tpseudo = false\r\n      end\r\n      local f = map_op[sname]\r\n      local s\r\n      if nparam ~= \"*\" then nparam = nparam + 0 end\r\n      if nparam == 0 then\r\n\ts = \"\"\r\n      elseif type(f) == \"string\" then\r\n\ts = map_op[\".template__\"](nil, f, nparam)\r\n      else\r\n\ts = f(nil, nparam)\r\n      end\r\n      if type(s) == \"table\" then\r\n\tfor _,s2 in ipairs(s) do\r\n\t  out:write(format(\"  %-12s %s\\n\", name, s2))\r\n\tend\r\n      else\r\n\tout:write(format(\"  %-12s %s\\n\", name, s))\r\n      end\r\n    end\r\n  end\r\n  out:write(\"\\n\")\r\n  exit(0)\r\nend\r\n\r\n-- Pseudo-opcode to set the architecture.\r\n-- Only initially available (map_op is replaced when called).\r\nmap_op[\".arch_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  local err = loadarch(params[1])\r\n  if err then wfatal(err) end\r\n  wline(format(\"#if DASM_VERSION != %d\", _info.vernum))\r\n  wline('#error \"Version mismatch between DynASM and included encoding engine\"')\r\n  wline(\"#endif\")\r\nend\r\n\r\n-- Dummy .arch pseudo-opcode to improve the error report.\r\nmap_coreop[\".arch_1\"] = function(params)\r\n  if not params then return \"name\" end\r\n  wfatal(\"duplicate .arch statement\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dummy pseudo-opcode. Don't confuse '.nop' with 'nop'.\r\nmap_coreop[\".nop_*\"] = function(params)\r\n  if not params then return \"[ignored...]\" end\r\nend\r\n\r\n-- Pseudo-opcodes to raise errors.\r\nmap_coreop[\".error_1\"] = function(params)\r\n  if not params then return \"message\" end\r\n  werror(params[1])\r\nend\r\n\r\nmap_coreop[\".fatal_1\"] = function(params)\r\n  if not params then return \"message\" end\r\n  wfatal(params[1])\r\nend\r\n\r\n-- Dump all user defined elements.\r\nlocal function dumpdef(out)\r\n  local lvl = g_opt.dumpdef\r\n  if lvl == 0 then return end\r\n  dumpsections(out, lvl)\r\n  dumpdefines(out, lvl)\r\n  if g_arch then g_arch.dumpdef(out, lvl) end\r\n  dumpmacros(out, lvl)\r\n  dumpcaptures(out, lvl)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Helper for splitstmt.\r\nlocal splitlvl\r\n\r\nlocal function splitstmt_one(c)\r\n  if c == \"(\" then\r\n    splitlvl = \")\"..splitlvl\r\n  elseif c == \"[\" then\r\n    splitlvl = \"]\"..splitlvl\r\n  elseif c == \"{\" then\r\n    splitlvl = \"}\"..splitlvl\r\n  elseif c == \")\" or c == \"]\" or c == \"}\" then\r\n    if sub(splitlvl, 1, 1) ~= c then werror(\"unbalanced (), [] or {}\") end\r\n    splitlvl = sub(splitlvl, 2)\r\n  elseif splitlvl == \"\" then\r\n    return \" \\0 \"\r\n  end\r\n  return c\r\nend\r\n\r\n-- Split statement into (pseudo-)opcode and params.\r\nlocal function splitstmt(stmt)\r\n  -- Convert label with trailing-colon into .label statement.\r\n  local label = match(stmt, \"^%s*(.+):%s*$\")\r\n  if label then return \".label\", {label} end\r\n\r\n  -- Split at commas and equal signs, but obey parentheses and brackets.\r\n  splitlvl = \"\"\r\n  stmt = gsub(stmt, \"[,%(%)%[%]{}]\", splitstmt_one)\r\n  if splitlvl ~= \"\" then werror(\"unbalanced () or []\") end\r\n\r\n  -- Split off opcode.\r\n  local op, other = match(stmt, \"^%s*([^%s%z]+)%s*(.*)$\")\r\n  if not op then werror(\"bad statement syntax\") end\r\n\r\n  -- Split parameters.\r\n  local params = {}\r\n  for p in gmatch(other, \"%s*(%Z+)%z?\") do\r\n    params[#params+1] = gsub(p, \"%s+$\", \"\")\r\n  end\r\n  if #params > 16 then werror(\"too many parameters\") end\r\n\r\n  params.op = op\r\n  return op, params\r\nend\r\n\r\n-- Process a single statement.\r\ndostmt = function(stmt)\r\n  -- Ignore empty statements.\r\n  if match(stmt, \"^%s*$\") then return end\r\n\r\n  -- Capture macro defs before substitution.\r\n  if mac_capture then return mac_capture(stmt) end\r\n  stmt = definesubst(stmt)\r\n\r\n  -- Emit C code without parsing the line.\r\n  if sub(stmt, 1, 1) == \"|\" then\r\n    local tail = sub(stmt, 2)\r\n    wflush()\r\n    if sub(tail, 1, 2) == \"//\" then wcomment(tail) else wline(tail, true) end\r\n    return\r\n  end\r\n\r\n  -- Split into (pseudo-)opcode and params.\r\n  local op, params = splitstmt(stmt)\r\n\r\n  -- Get opcode handler (matching # of parameters or generic handler).\r\n  local f = map_op[op..\"_\"..#params] or map_op[op..\"_*\"]\r\n  if not f then\r\n    if not g_arch then wfatal(\"first statement must be .arch\") end\r\n    -- Improve error report.\r\n    for i=0,9 do\r\n      if map_op[op..\"_\"..i] then\r\n\twerror(\"wrong number of parameters for `\"..op..\"'\")\r\n      end\r\n    end\r\n    werror(\"unknown statement `\"..op..\"'\")\r\n  end\r\n\r\n  -- Call opcode handler or special handler for template strings.\r\n  if type(f) == \"string\" then\r\n    map_op[\".template__\"](params, f)\r\n  else\r\n    f(params)\r\n  end\r\nend\r\n\r\n-- Process a single line.\r\nlocal function doline(line)\r\n  if g_opt.flushline then wflush() end\r\n\r\n  -- Assembler line?\r\n  local indent, aline = match(line, \"^(%s*)%|(.*)$\")\r\n  if not aline then\r\n    -- No, plain C code line, need to flush first.\r\n    wflush()\r\n    wsync()\r\n    wline(line, false)\r\n    return\r\n  end\r\n\r\n  g_indent = indent -- Remember current line indentation.\r\n\r\n  -- Emit C code (even from macros). Avoids echo and line parsing.\r\n  if sub(aline, 1, 1) == \"|\" then\r\n    if not mac_capture then\r\n      wsync()\r\n    elseif g_opt.comment then\r\n      wsync()\r\n      wcomment(aline)\r\n    end\r\n    dostmt(aline)\r\n    return\r\n  end\r\n\r\n  -- Echo assembler line as a comment.\r\n  if g_opt.comment then\r\n    wsync()\r\n    wcomment(aline)\r\n  end\r\n\r\n  -- Strip assembler comments.\r\n  aline = gsub(aline, \"//.*$\", \"\")\r\n\r\n  -- Split line into statements at semicolons.\r\n  if match(aline, \";\") then\r\n    for stmt in gmatch(aline, \"[^;]+\") do dostmt(stmt) end\r\n  else\r\n    dostmt(aline)\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Write DynASM header.\r\nlocal function dasmhead(out)\r\n  out:write(format([[\r\n/*\r\n** This file has been pre-processed with DynASM.\r\n** %s\r\n** DynASM version %s, DynASM %s version %s\r\n** DO NOT EDIT! The original file is in \"%s\".\r\n*/\r\n\r\n]], _info.url,\r\n    _info.version, g_arch._info.arch, g_arch._info.version,\r\n    g_fname))\r\nend\r\n\r\n-- Read input file.\r\nreadfile = function(fin)\r\n  g_indent = \"\"\r\n  g_lineno = 0\r\n  g_synclineno = -1\r\n\r\n  -- Process all lines.\r\n  for line in fin:lines() do\r\n    g_lineno = g_lineno + 1\r\n    g_curline = line\r\n    local ok, err = pcall(doline, line)\r\n    if not ok and wprinterr(err, \"\\n\") then return true end\r\n  end\r\n  wflush()\r\n\r\n  -- Close input file.\r\n  assert(fin == stdin or fin:close())\r\nend\r\n\r\n-- Write output file.\r\nlocal function writefile(outfile)\r\n  local fout\r\n\r\n  -- Open output file.\r\n  if outfile == nil or outfile == \"-\" then\r\n    fout = stdout\r\n  else\r\n    fout = assert(io.open(outfile, \"w\"))\r\n  end\r\n\r\n  -- Write all buffered lines\r\n  wdumplines(fout, g_wbuffer)\r\n\r\n  -- Close output file.\r\n  assert(fout == stdout or fout:close())\r\n\r\n  -- Optionally dump definitions.\r\n  dumpdef(fout == stdout and stderr or stdout)\r\nend\r\n\r\n-- Translate an input file to an output file.\r\nlocal function translate(infile, outfile)\r\n  g_wbuffer = {}\r\n  g_indent = \"\"\r\n  g_lineno = 0\r\n  g_synclineno = -1\r\n\r\n  -- Put header.\r\n  wline(dasmhead)\r\n\r\n  -- Read input file.\r\n  local fin\r\n  if infile == \"-\" then\r\n    g_fname = \"(stdin)\"\r\n    fin = stdin\r\n  else\r\n    g_fname = infile\r\n    fin = assert(io.open(infile, \"r\"))\r\n  end\r\n  readfile(fin)\r\n\r\n  -- Check for errors.\r\n  if not g_arch then\r\n    wprinterr(g_fname, \":*: error: missing .arch directive\\n\")\r\n  end\r\n  checkconds()\r\n  checkmacros()\r\n  checkcaptures()\r\n\r\n  if g_errcount ~= 0 then\r\n    stderr:write(g_fname, \":*: info: \", g_errcount, \" error\",\r\n      (type(g_errcount) == \"number\" and g_errcount > 1) and \"s\" or \"\",\r\n      \" in input file -- no output file generated.\\n\")\r\n    dumpdef(stderr)\r\n    exit(1)\r\n  end\r\n\r\n  -- Write output file.\r\n  writefile(outfile)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Print help text.\r\nfunction opt_map.help()\r\n  stdout:write(\"DynASM -- \", _info.description, \".\\n\")\r\n  stdout:write(\"DynASM \", _info.version, \" \", _info.release, \"  \", _info.url, \"\\n\")\r\n  stdout:write[[\r\n\r\nUsage: dynasm [OPTION]... INFILE.dasc|-\r\n\r\n  -h, --help           Display this help text.\r\n  -V, --version        Display version and copyright information.\r\n\r\n  -o, --outfile FILE   Output file name (default is stdout).\r\n  -I, --include DIR    Add directory to the include search path.\r\n\r\n  -c, --ccomment       Use /* */ comments for assembler lines.\r\n  -C, --cppcomment     Use // comments for assembler lines (default).\r\n  -N, --nocomment      Suppress assembler lines in output.\r\n  -M, --maccomment     Show macro expansions as comments (default off).\r\n\r\n  -L, --nolineno       Suppress CPP line number information in output.\r\n  -F, --flushline      Flush action list for every line.\r\n\r\n  -D NAME[=SUBST]      Define a substitution.\r\n  -U NAME              Undefine a substitution.\r\n\r\n  -P, --dumpdef        Dump defines, macros, etc. Repeat for more output.\r\n  -A, --dumparch ARCH  Load architecture ARCH and dump description.\r\n]]\r\n  exit(0)\r\nend\r\n\r\n-- Print version information.\r\nfunction opt_map.version()\r\n  stdout:write(format(\"%s version %s, released %s\\n%s\\n\\n%s\",\r\n    _info.name, _info.version, _info.release, _info.url, _info.copyright))\r\n  exit(0)\r\nend\r\n\r\n-- Misc. options.\r\nfunction opt_map.outfile(args) g_opt.outfile = optparam(args) end\r\nfunction opt_map.include(args) insert(g_opt.include, 1, optparam(args)) end\r\nfunction opt_map.ccomment() g_opt.comment = \"/*|\"; g_opt.endcomment = \" */\" end\r\nfunction opt_map.cppcomment() g_opt.comment = \"//|\"; g_opt.endcomment = \"\" end\r\nfunction opt_map.nocomment() g_opt.comment = false end\r\nfunction opt_map.maccomment() g_opt.maccomment = true end\r\nfunction opt_map.nolineno() g_opt.cpp = false end\r\nfunction opt_map.flushline() g_opt.flushline = true end\r\nfunction opt_map.dumpdef() g_opt.dumpdef = g_opt.dumpdef + 1 end\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Short aliases for long options.\r\nlocal opt_alias = {\r\n  h = \"help\", [\"?\"] = \"help\", V = \"version\",\r\n  o = \"outfile\", I = \"include\",\r\n  c = \"ccomment\", C = \"cppcomment\", N = \"nocomment\", M = \"maccomment\",\r\n  L = \"nolineno\", F = \"flushline\",\r\n  P = \"dumpdef\", A = \"dumparch\",\r\n}\r\n\r\n-- Parse single option.\r\nlocal function parseopt(opt, args)\r\n  opt_current = #opt == 1 and \"-\"..opt or \"--\"..opt\r\n  local f = opt_map[opt] or opt_map[opt_alias[opt]]\r\n  if not f then\r\n    opterror(\"unrecognized option `\", opt_current, \"'. Try `--help'.\\n\")\r\n  end\r\n  f(args)\r\nend\r\n\r\n-- Parse arguments.\r\nlocal function parseargs(args)\r\n  -- Default options.\r\n  g_opt.comment = \"//|\"\r\n  g_opt.endcomment = \"\"\r\n  g_opt.cpp = true\r\n  g_opt.dumpdef = 0\r\n  g_opt.include = { \"\" }\r\n\r\n  -- Process all option arguments.\r\n  args.argn = 1\r\n  repeat\r\n    local a = args[args.argn]\r\n    if not a then break end\r\n    local lopt, opt = match(a, \"^%-(%-?)(.+)\")\r\n    if not opt then break end\r\n    args.argn = args.argn + 1\r\n    if lopt == \"\" then\r\n      -- Loop through short options.\r\n      for o in gmatch(opt, \".\") do parseopt(o, args) end\r\n    else\r\n      -- Long option.\r\n      parseopt(opt, args)\r\n    end\r\n  until false\r\n\r\n  -- Check for proper number of arguments.\r\n  local nargs = #args - args.argn + 1\r\n  if nargs ~= 1 then\r\n    if nargs == 0 then\r\n      if g_opt.dumpdef > 0 then return dumpdef(stdout) end\r\n    end\r\n    opt_map.help()\r\n  end\r\n\r\n  -- Translate a single input file to a single output file\r\n  -- TODO: Handle multiple files?\r\n  translate(args[args.argn], g_opt.outfile)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Add the directory dynasm.lua resides in to the Lua module search path.\r\nlocal arg = arg\r\nif arg and arg[0] then\r\n  prefix = match(arg[0], \"^(.*[/\\\\])\")\r\n  if package and prefix then package.path = prefix..\"?.lua;\"..package.path end\r\nend\r\n\r\n-- Start DynASM.\r\nparseargs{...}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/etc/luajit.1",
    "content": ".TH luajit 1 \"\" \"\" \"LuaJIT documentation\"\r\n.SH NAME\r\nluajit \\- Just-In-Time Compiler for the Lua Language\r\n\\fB\r\n.SH SYNOPSIS\r\n.B luajit\r\n[\\fIoptions\\fR]... [\\fIscript\\fR [\\fIargs\\fR]...]\r\n.SH \"WEB SITE\"\r\n.IR http://luajit.org\r\n.SH DESCRIPTION\r\n.PP\r\nThis is the command-line program to run Lua programs with \\fBLuaJIT\\fR.\r\n.PP\r\n\\fBLuaJIT\\fR is a just-in-time (JIT) compiler for the Lua language.\r\nThe virtual machine (VM) is based on a fast interpreter combined with\r\na trace compiler. It can significantly improve the performance of Lua programs.\r\n.PP\r\n\\fBLuaJIT\\fR is API\\- and ABI-compatible with the VM of the standard\r\nLua\\ 5.1 interpreter. When embedding the VM into an application,\r\nthe built library can be used as a drop-in replacement.\r\n.SH OPTIONS\r\n.TP\r\n.BI \"\\-e \" chunk\r\nRun the given chunk of Lua code.\r\n.TP\r\n.BI \"\\-l \" library\r\nLoad the named library, just like \\fBrequire(\"\\fR\\fIlibrary\\fR\\fB\")\\fR.\r\n.TP\r\n.BI \"\\-b \" ...\r\nSave or list bytecode. Run without arguments to get help on options.\r\n.TP\r\n.BI \"\\-j \" command\r\nPerform LuaJIT control command (optional space after \\fB\\-j\\fR).\r\n.TP\r\n.BI \"\\-O\" [opt]\r\nControl LuaJIT optimizations.\r\n.TP\r\n.B \"\\-i\"\r\nRun in interactive mode.\r\n.TP\r\n.B \"\\-v\"\r\nShow \\fBLuaJIT\\fR version.\r\n.TP\r\n.B \"\\-E\"\r\nIgnore environment variables.\r\n.TP\r\n.B \"\\-\\-\"\r\nStop processing options.\r\n.TP\r\n.B \"\\-\"\r\nRead script from stdin instead.\r\n.PP\r\nAfter all options are processed, the given \\fIscript\\fR is run.\r\nThe arguments are passed in the global \\fIarg\\fR table.\r\n.PP\r\nInteractive mode is only entered, if no \\fIscript\\fR and no \\fB\\-e\\fR\r\noption is given. Interactive mode can be left with EOF (\\fICtrl\\-Z\\fB).\r\n.SH EXAMPLES\r\n.TP\r\nluajit hello.lua world\r\n\r\nPrints \"Hello world\", assuming \\fIhello.lua\\fR contains:\r\n.br\r\n  print(\"Hello\", arg[1])\r\n.TP\r\nluajit \\-e \"local x=0; for i=1,1e9 do x=x+i end; print(x)\"\r\n\r\nCalculates the sum of the numbers from 1 to 1000000000.\r\n.br\r\nAnd finishes in a reasonable amount of time, too.\r\n.TP\r\nluajit \\-jv \\-e \"for i=1,10 do for j=1,10 do for k=1,100 do end end end\"\r\n\r\nRuns some nested loops and shows the resulting traces.\r\n.SH COPYRIGHT\r\n.PP\r\n\\fBLuaJIT\\fR is Copyright \\(co 2005-2015 Mike Pall.\r\n.br\r\n\\fBLuaJIT\\fR is open source software, released under the MIT license.\r\n.SH SEE ALSO\r\n.PP\r\nMore details in the provided HTML docs or at:\r\n.IR http://luajit.org\r\n.br\r\nMore about the Lua language can be found at:\r\n.IR http://lua.org/docs.html\r\n.PP\r\nlua(1)\r\n"
  },
  {
    "path": "build/luajit-2.1.0/etc/luajit.pc",
    "content": "# Package information for LuaJIT to be used by pkg-config.\r\nmajver=2\r\nminver=1\r\nrelver=0\r\nversion=${majver}.${minver}.${relver}-beta1\r\nabiver=5.1\r\n\r\nprefix=/usr/local\r\nmultilib=lib\r\nexec_prefix=${prefix}\r\nlibdir=${exec_prefix}/${multilib}\r\nlibname=luajit-${abiver}\r\nincludedir=${prefix}/include/luajit-${majver}.${minver}\r\n\r\nINSTALL_LMOD=${prefix}/share/lua/${abiver}\r\nINSTALL_CMOD=${prefix}/${multilib}/lua/${abiver}\r\n\r\nName: LuaJIT\r\nDescription: Just-in-time compiler for Lua\r\nURL: http://luajit.org\r\nVersion: ${version}\r\nRequires:\r\nLibs: -L${libdir} -l${libname}\r\nLibs.private: -Wl,-E -lm -ldl\r\nCflags: -I${includedir}\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/Makefile",
    "content": "##############################################################################\r\n# LuaJIT Makefile. Requires GNU Make.\r\n#\r\n# Please read doc/install.html before changing any variables!\r\n#\r\n# Suitable for POSIX platforms (Linux, *BSD, OSX etc.).\r\n# Also works with MinGW and Cygwin on Windows.\r\n# Please check msvcbuild.bat for building with MSVC on Windows.\r\n#\r\n# Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n##############################################################################\r\n\r\nMAJVER=  2\r\nMINVER=  1\r\nRELVER=  0\r\nABIVER=  5.1\r\nNODOTABIVER= 51\r\n\r\n##############################################################################\r\n#############################  COMPILER OPTIONS  #############################\r\n##############################################################################\r\n# These options mainly affect the speed of the JIT compiler itself, not the\r\n# speed of the JIT-compiled code. Turn any of the optional settings on by\r\n# removing the '#' in front of them. Make sure you force a full recompile\r\n# with \"make clean\", followed by \"make\" if you change any options.\r\n#\r\n# LuaJIT builds as a native 32 or 64 bit binary by default.\r\nCC= gcc\r\n#\r\n# Use this if you want to force a 32 bit build on a 64 bit multilib OS.\r\n#CC= gcc -m32\r\n#\r\n# Since the assembler part does NOT maintain a frame pointer, it's pointless\r\n# to slow down the C part by not omitting it. Debugging, tracebacks and\r\n# unwinding are not affected -- the assembler part has frame unwind\r\n# information and GCC emits it where needed (x64) or with -g (see CCDEBUG).\r\nCCOPT= -O2 -fomit-frame-pointer\r\n# Use this if you want to generate a smaller binary (but it's slower):\r\n#CCOPT= -Os -fomit-frame-pointer\r\n# Note: it's no longer recommended to use -O3 with GCC 4.x.\r\n# The I-Cache bloat usually outweighs the benefits from aggressive inlining.\r\n#\r\n# Target-specific compiler options:\r\n#\r\n# x86/x64 only: For GCC 4.2 or higher and if you don't intend to distribute\r\n# the binaries to a different machine you could also use: -march=native\r\n#\r\nCCOPT_x86= -march=i686 -msse -msse2 -mfpmath=sse\r\nCCOPT_x64=\r\nCCOPT_arm=\r\nCCOPT_arm64=\r\nCCOPT_ppc=\r\nCCOPT_mips=\r\n#\r\nCCDEBUG=\r\n# Uncomment the next line to generate debug information:\r\n#CCDEBUG= -g\r\n#\r\nCCWARN= -Wall\r\n# Uncomment the next line to enable more warnings:\r\n#CCWARN+= -Wextra -Wdeclaration-after-statement -Wredundant-decls -Wshadow -Wpointer-arith\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n################################  BUILD MODE  ################################\r\n##############################################################################\r\n# The default build mode is mixed mode on POSIX. On Windows this is the same\r\n# as dynamic mode.\r\n#\r\n# Mixed mode creates a static + dynamic library and a statically linked luajit.\r\nBUILDMODE= mixed\r\n#\r\n# Static mode creates a static library and a statically linked luajit.\r\n#BUILDMODE= static\r\n#\r\n# Dynamic mode creates a dynamic library and a dynamically linked luajit.\r\n# Note: this executable will only run when the library is installed!\r\n#BUILDMODE= dynamic\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n#################################  FEATURES  #################################\r\n##############################################################################\r\n# Enable/disable these features as needed, but make sure you force a full\r\n# recompile with \"make clean\", followed by \"make\".\r\nXCFLAGS=\r\n#\r\n# Permanently disable the FFI extension to reduce the size of the LuaJIT\r\n# executable. But please consider that the FFI library is compiled-in,\r\n# but NOT loaded by default. It only allocates any memory, if you actually\r\n# make use of it.\r\n#XCFLAGS+= -DLUAJIT_DISABLE_FFI\r\n#\r\n# Features from Lua 5.2 that are unlikely to break existing code are\r\n# enabled by default. Some other features that *might* break some existing\r\n# code (e.g. __pairs or os.execute() return values) can be enabled here.\r\n# Note: this does not provide full compatibility with Lua 5.2 at this time.\r\n#XCFLAGS+= -DLUAJIT_ENABLE_LUA52COMPAT\r\n#\r\n# Disable the JIT compiler, i.e. turn LuaJIT into a pure interpreter.\r\n#XCFLAGS+= -DLUAJIT_DISABLE_JIT\r\n#\r\n# Some architectures (e.g. PPC) can use either single-number (1) or\r\n# dual-number (2) mode. Uncomment one of these lines to override the\r\n# default mode. Please see LJ_ARCH_NUMMODE in lj_arch.h for details.\r\n#XCFLAGS+= -DLUAJIT_NUMMODE=1\r\n#XCFLAGS+= -DLUAJIT_NUMMODE=2\r\n#\r\n##############################################################################\r\n\r\n##############################################################################\r\n############################  DEBUGGING SUPPORT  #############################\r\n##############################################################################\r\n# Enable these options as needed, but make sure you force a full recompile\r\n# with \"make clean\", followed by \"make\".\r\n# Note that most of these are NOT suitable for benchmarking or release mode!\r\n#\r\n# Use the system provided memory allocator (realloc) instead of the\r\n# bundled memory allocator. This is slower, but sometimes helpful for\r\n# debugging. This option cannot be enabled on x64, since realloc usually\r\n# doesn't return addresses in the right address range.\r\n# OTOH this option is mandatory for Valgrind's memcheck tool on x64 and\r\n# the only way to get useful results from it for all other architectures.\r\n#XCFLAGS+= -DLUAJIT_USE_SYSMALLOC\r\n#\r\n# This define is required to run LuaJIT under Valgrind. The Valgrind\r\n# header files must be installed. You should enable debug information, too.\r\n# Use --suppressions=lj.supp to avoid some false positives.\r\n#XCFLAGS+= -DLUAJIT_USE_VALGRIND\r\n#\r\n# This is the client for the GDB JIT API. GDB 7.0 or higher is required\r\n# to make use of it. See lj_gdbjit.c for details. Enabling this causes\r\n# a non-negligible overhead, even when not running under GDB.\r\n#XCFLAGS+= -DLUAJIT_USE_GDBJIT\r\n#\r\n# Turn on assertions for the Lua/C API to debug problems with lua_* calls.\r\n# This is rather slow -- use only while developing C libraries/embeddings.\r\n#XCFLAGS+= -DLUA_USE_APICHECK\r\n#\r\n# Turn on assertions for the whole LuaJIT VM. This significantly slows down\r\n# everything. Use only if you suspect a problem with LuaJIT itself.\r\n#XCFLAGS+= -DLUA_USE_ASSERT\r\n#\r\n##############################################################################\r\n# You probably don't need to change anything below this line!\r\n##############################################################################\r\n\r\n##############################################################################\r\n# Flags and options for host and target.\r\n##############################################################################\r\n\r\n# You can override the following variables at the make command line:\r\n#   CC       HOST_CC       STATIC_CC       DYNAMIC_CC\r\n#   CFLAGS   HOST_CFLAGS   TARGET_CFLAGS\r\n#   LDFLAGS  HOST_LDFLAGS  TARGET_LDFLAGS  TARGET_SHLDFLAGS\r\n#   LIBS     HOST_LIBS     TARGET_LIBS\r\n#   CROSS    HOST_SYS      TARGET_SYS      TARGET_FLAGS\r\n#\r\n# Cross-compilation examples:\r\n#   make HOST_CC=\"gcc -m32\" CROSS=i586-mingw32msvc- TARGET_SYS=Windows\r\n#   make HOST_CC=\"gcc -m32\" CROSS=powerpc-linux-gnu-\r\n\r\nASOPTIONS= $(CCOPT) $(CCWARN) $(XCFLAGS) $(CFLAGS)\r\nCCOPTIONS= $(CCDEBUG) $(ASOPTIONS)\r\nLDOPTIONS= $(CCDEBUG) $(LDFLAGS)\r\n\r\nHOST_CC= $(CC)\r\nHOST_RM= rm -f\r\n# If left blank, minilua is built and used. You can supply an installed\r\n# copy of (plain) Lua 5.1 or 5.2, plus Lua BitOp. E.g. with: HOST_LUA=lua\r\nHOST_LUA=\r\n\r\nHOST_XCFLAGS= -I.\r\nHOST_XLDFLAGS=\r\nHOST_XLIBS=\r\nHOST_ACFLAGS= $(CCOPTIONS) $(HOST_XCFLAGS) $(TARGET_ARCH) $(HOST_CFLAGS)\r\nHOST_ALDFLAGS= $(LDOPTIONS) $(HOST_XLDFLAGS) $(HOST_LDFLAGS)\r\nHOST_ALIBS= $(HOST_XLIBS) $(LIBS) $(HOST_LIBS)\r\n\r\nSTATIC_CC = $(CROSS)$(CC)\r\nDYNAMIC_CC = $(CROSS)$(CC) -fPIC\r\nTARGET_CC= $(STATIC_CC)\r\nTARGET_STCC= $(STATIC_CC)\r\nTARGET_DYNCC= $(DYNAMIC_CC)\r\nTARGET_LD= $(CROSS)$(CC)\r\nTARGET_AR= $(CROSS)ar rcus\r\nTARGET_STRIP= $(CROSS)strip\r\n\r\nTARGET_LIBPATH= $(or $(PREFIX),/usr/local)/$(or $(MULTILIB),lib)\r\nTARGET_SONAME= libluajit-$(ABIVER).so.$(MAJVER)\r\nTARGET_DYLIBNAME= libluajit-$(ABIVER).$(MAJVER).dylib\r\nTARGET_DYLIBPATH= $(TARGET_LIBPATH)/$(TARGET_DYLIBNAME)\r\nTARGET_DLLNAME= lua$(NODOTABIVER).dll\r\nTARGET_XSHLDFLAGS= -shared -fPIC -Wl,-soname,$(TARGET_SONAME)\r\nTARGET_DYNXLDOPTS=\r\n\r\nTARGET_LFSFLAGS= -D_FILE_OFFSET_BITS=64 -D_LARGEFILE_SOURCE\r\nTARGET_XCFLAGS= $(TARGET_LFSFLAGS) -U_FORTIFY_SOURCE\r\nTARGET_XLDFLAGS=\r\nTARGET_XLIBS= -lm\r\nTARGET_TCFLAGS= $(CCOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS) $(TARGET_CFLAGS)\r\nTARGET_ACFLAGS= $(CCOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS) $(TARGET_CFLAGS)\r\nTARGET_ASFLAGS= $(ASOPTIONS) $(TARGET_XCFLAGS) $(TARGET_FLAGS) $(TARGET_CFLAGS)\r\nTARGET_ALDFLAGS= $(LDOPTIONS) $(TARGET_XLDFLAGS) $(TARGET_FLAGS) $(TARGET_LDFLAGS)\r\nTARGET_ASHLDFLAGS= $(LDOPTIONS) $(TARGET_XSHLDFLAGS) $(TARGET_FLAGS) $(TARGET_SHLDFLAGS)\r\nTARGET_ALIBS= $(TARGET_XLIBS) $(LIBS) $(TARGET_LIBS)\r\n\r\nTARGET_TESTARCH=$(shell $(TARGET_CC) $(TARGET_TCFLAGS) -E lj_arch.h -dM)\r\nifneq (,$(findstring LJ_TARGET_X64 ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= x64\r\nelse\r\nifneq (,$(findstring LJ_TARGET_X86 ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= x86\r\nelse\r\nifneq (,$(findstring LJ_TARGET_ARM ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= arm\r\nelse\r\nifneq (,$(findstring LJ_TARGET_ARM64 ,$(TARGET_TESTARCH)))\r\n  TARGET_LJARCH= arm64\r\nelse\r\nifneq (,$(findstring LJ_TARGET_PPC ,$(TARGET_TESTARCH)))\r\n  ifneq (,$(findstring LJ_LE 1,$(TARGET_TESTARCH)))\r\n    TARGET_ARCH= -DLJ_ARCH_ENDIAN=LUAJIT_LE\r\n  else\r\n    TARGET_ARCH= -DLJ_ARCH_ENDIAN=LUAJIT_BE\r\n  endif\r\n  TARGET_LJARCH= ppc\r\nelse\r\nifneq (,$(findstring LJ_TARGET_MIPS ,$(TARGET_TESTARCH)))\r\n  ifneq (,$(findstring MIPSEL ,$(TARGET_TESTARCH)))\r\n    TARGET_ARCH= -D__MIPSEL__=1\r\n  endif\r\n  TARGET_LJARCH= mips\r\nelse\r\n  $(error Unsupported target architecture)\r\nendif\r\nendif\r\nendif\r\nendif\r\nendif\r\nendif\r\n\r\nifneq (,$(findstring LJ_TARGET_PS3 1,$(TARGET_TESTARCH)))\r\n  TARGET_SYS= PS3\r\n  TARGET_ARCH+= -D__CELLOS_LV2__\r\n  TARGET_XCFLAGS+= -DLUAJIT_USE_SYSMALLOC\r\n  TARGET_XLIBS+= -lpthread\r\nendif\r\n\r\nTARGET_XCFLAGS+= $(CCOPT_$(TARGET_LJARCH))\r\nTARGET_ARCH+= $(patsubst %,-DLUAJIT_TARGET=LUAJIT_ARCH_%,$(TARGET_LJARCH))\r\n\r\nifneq (,$(PREFIX))\r\nifneq (/usr/local,$(PREFIX))\r\n  TARGET_XCFLAGS+= -DLUA_ROOT=\\\"$(PREFIX)\\\"\r\n  ifneq (/usr,$(PREFIX))\r\n    TARGET_DYNXLDOPTS= -Wl,-rpath,$(TARGET_LIBPATH)\r\n  endif\r\nendif\r\nendif\r\nifneq (,$(MULTILIB))\r\n  TARGET_XCFLAGS+= -DLUA_MULTILIB=\\\"$(MULTILIB)\\\"\r\nendif\r\nifneq (,$(LMULTILIB))\r\n  TARGET_XCFLAGS+= -DLUA_LMULTILIB=\\\"$(LMULTILIB)\\\"\r\nendif\r\n\r\n##############################################################################\r\n# System detection.\r\n##############################################################################\r\n\r\nifeq (Windows,$(findstring Windows,$(OS))$(MSYSTEM)$(TERM))\r\n  HOST_SYS= Windows\r\n  HOST_RM= del\r\nelse\r\n  HOST_SYS:= $(shell uname -s)\r\n  ifneq (,$(findstring MINGW,$(HOST_SYS)))\r\n    HOST_SYS= Windows\r\n    HOST_MSYS= mingw\r\n  endif\r\n  ifneq (,$(findstring CYGWIN,$(HOST_SYS)))\r\n    HOST_SYS= Windows\r\n    HOST_MSYS= cygwin\r\n  endif\r\nendif\r\n\r\nTARGET_SYS?= $(HOST_SYS)\r\nifeq (Windows,$(TARGET_SYS))\r\n  TARGET_STRIP+= --strip-unneeded\r\n  TARGET_XSHLDFLAGS= -shared\r\n  TARGET_DYNXLDOPTS=\r\nelse\r\nifeq (,$(shell $(TARGET_CC) -o /dev/null -c -x c /dev/null -fno-stack-protector 2>/dev/null || echo 1))\r\n  TARGET_XCFLAGS+= -fno-stack-protector\r\nendif\r\nifeq (Darwin,$(TARGET_SYS))\r\n  ifeq (,$(MACOSX_DEPLOYMENT_TARGET))\r\n    export MACOSX_DEPLOYMENT_TARGET=10.4\r\n  endif\r\n  TARGET_STRIP+= -x\r\n  TARGET_AR+= 2>/dev/null\r\n  TARGET_XSHLDFLAGS= -dynamiclib -single_module -undefined dynamic_lookup -fPIC\r\n  TARGET_DYNXLDOPTS=\r\n  TARGET_XSHLDFLAGS+= -install_name $(TARGET_DYLIBPATH) -compatibility_version $(MAJVER).$(MINVER) -current_version $(MAJVER).$(MINVER).$(RELVER)\r\n  ifeq (x64,$(TARGET_LJARCH))\r\n    TARGET_XLDFLAGS+= -pagezero_size 10000 -image_base 100000000\r\n    TARGET_XSHLDFLAGS+= -image_base 7fff04c4a000\r\n  endif\r\nelse\r\nifeq (iOS,$(TARGET_SYS))\r\n  TARGET_STRIP+= -x\r\n  TARGET_AR+= 2>/dev/null\r\n  TARGET_XSHLDFLAGS= -dynamiclib -single_module -undefined dynamic_lookup -fPIC\r\n  TARGET_DYNXLDOPTS=\r\n  TARGET_XSHLDFLAGS+= -install_name $(TARGET_DYLIBPATH) -compatibility_version $(MAJVER).$(MINVER) -current_version $(MAJVER).$(MINVER).$(RELVER)\r\n  ifeq (arm64,$(TARGET_LJARCH))\r\n    TARGET_XCFLAGS+= -fno-omit-frame-pointer\r\n  endif\r\nelse\r\n  ifneq (SunOS,$(TARGET_SYS))\r\n    ifneq (PS3,$(TARGET_SYS))\r\n      TARGET_XLDFLAGS+= -Wl,-E\r\n    endif\r\n  endif\r\n  ifeq (Linux,$(TARGET_SYS))\r\n    TARGET_XLIBS+= -ldl\r\n  endif\r\n  ifeq (GNU/kFreeBSD,$(TARGET_SYS))\r\n    TARGET_XLIBS+= -ldl\r\n  endif\r\nendif\r\nendif\r\nendif\r\n\r\nifneq ($(HOST_SYS),$(TARGET_SYS))\r\n  ifeq (Windows,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -malign-double -DLUAJIT_OS=LUAJIT_OS_WINDOWS\r\n  else\r\n  ifeq (Linux,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_LINUX\r\n  else\r\n  ifeq (Darwin,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX\r\n  else\r\n  ifeq (iOS,$(TARGET_SYS))\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OSX\r\n  else\r\n    HOST_XCFLAGS+= -DLUAJIT_OS=LUAJIT_OS_OTHER\r\n  endif\r\n  endif\r\n  endif\r\n  endif\r\nendif\r\n\r\nifneq (,$(CCDEBUG))\r\n  TARGET_STRIP= @:\r\nendif\r\n\r\n##############################################################################\r\n# Files and pathnames.\r\n##############################################################################\r\n\r\nMINILUA_O= host/minilua.o\r\nMINILUA_LIBS= -lm\r\nMINILUA_T= host/minilua\r\nMINILUA_X= $(MINILUA_T)\r\n\r\nifeq (,$(HOST_LUA))\r\n  HOST_LUA= $(MINILUA_X)\r\n  DASM_DEP= $(MINILUA_T)\r\nendif\r\n\r\nDASM_DIR= ../dynasm\r\nDASM= $(HOST_LUA) $(DASM_DIR)/dynasm.lua\r\nDASM_XFLAGS=\r\nDASM_AFLAGS=\r\nDASM_ARCH= $(TARGET_LJARCH)\r\n\r\nifneq (,$(findstring LJ_ARCH_BITS 64,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D P64\r\nendif\r\nifneq (,$(findstring LJ_HASJIT 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D JIT\r\nendif\r\nifneq (,$(findstring LJ_HASFFI 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D FFI\r\nendif\r\nifneq (,$(findstring LJ_DUALNUM 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D DUALNUM\r\nendif\r\nifneq (,$(findstring LJ_ARCH_HASFPU 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D FPU\r\n  TARGET_ARCH+= -DLJ_ARCH_HASFPU=1\r\nelse\r\n  TARGET_ARCH+= -DLJ_ARCH_HASFPU=0\r\nendif\r\nifeq (,$(findstring LJ_ABI_SOFTFP 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D HFABI\r\n  TARGET_ARCH+= -DLJ_ABI_SOFTFP=0\r\nelse\r\n  TARGET_ARCH+= -DLJ_ABI_SOFTFP=1\r\nendif\r\nifneq (,$(findstring LJ_NO_UNWIND 1,$(TARGET_TESTARCH)))\r\n  DASM_AFLAGS+= -D NO_UNWIND\r\n  TARGET_ARCH+= -DLUAJIT_NO_UNWIND\r\nendif\r\nDASM_AFLAGS+= -D VER=$(subst LJ_ARCH_VERSION_,,$(filter LJ_ARCH_VERSION_%,$(subst LJ_ARCH_VERSION ,LJ_ARCH_VERSION_,$(TARGET_TESTARCH))))\r\nifeq (Windows,$(TARGET_SYS))\r\n  DASM_AFLAGS+= -D WIN\r\nendif\r\nifeq (x64,$(TARGET_LJARCH))\r\n  ifeq (,$(findstring LJ_FR2 1,$(TARGET_TESTARCH)))\r\n    DASM_ARCH= x86\r\n  endif\r\nelse\r\nifeq (arm,$(TARGET_LJARCH))\r\n  ifeq (iOS,$(TARGET_SYS))\r\n    DASM_AFLAGS+= -D IOS\r\n  endif\r\nelse\r\nifeq (ppc,$(TARGET_LJARCH))\r\n  ifneq (,$(findstring LJ_ARCH_SQRT 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D SQRT\r\n  endif\r\n  ifneq (,$(findstring LJ_ARCH_ROUND 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D ROUND\r\n  endif\r\n  ifneq (,$(findstring LJ_ARCH_PPC32ON64 1,$(TARGET_TESTARCH)))\r\n    DASM_AFLAGS+= -D GPR64\r\n  endif\r\n  ifeq (PS3,$(TARGET_SYS))\r\n    DASM_AFLAGS+= -D PPE -D TOC\r\n  endif\r\n  ifneq (,$(findstring LJ_ARCH_PPC64 ,$(TARGET_TESTARCH)))\r\n    DASM_ARCH= ppc64\r\n  endif\r\nendif\r\nendif\r\nendif\r\n\r\nDASM_FLAGS= $(DASM_XFLAGS) $(DASM_AFLAGS)\r\nDASM_DASC= vm_$(DASM_ARCH).dasc\r\n\r\nBUILDVM_O= host/buildvm.o host/buildvm_asm.o host/buildvm_peobj.o \\\r\n\t   host/buildvm_lib.o host/buildvm_fold.o\r\nBUILDVM_T= host/buildvm\r\nBUILDVM_X= $(BUILDVM_T)\r\n\r\nHOST_O= $(MINILUA_O) $(BUILDVM_O)\r\nHOST_T= $(MINILUA_T) $(BUILDVM_T)\r\n\r\nLJVM_S= lj_vm.S\r\nLJVM_O= lj_vm.o\r\nLJVM_BOUT= $(LJVM_S)\r\nLJVM_MODE= elfasm\r\n\r\nLJLIB_O= lib_base.o lib_math.o lib_bit.o lib_string.o lib_table.o \\\r\n\t lib_io.o lib_os.o lib_package.o lib_debug.o lib_jit.o lib_ffi.o\r\nLJLIB_C= $(LJLIB_O:.o=.c)\r\n\r\nLJCORE_O= lj_gc.o lj_err.o lj_char.o lj_bc.o lj_obj.o lj_buf.o \\\r\n\t  lj_str.o lj_tab.o lj_func.o lj_udata.o lj_meta.o lj_debug.o \\\r\n\t  lj_state.o lj_dispatch.o lj_vmevent.o lj_vmmath.o lj_strscan.o \\\r\n\t  lj_strfmt.o lj_api.o lj_profile.o \\\r\n\t  lj_lex.o lj_parse.o lj_bcread.o lj_bcwrite.o lj_load.o \\\r\n\t  lj_ir.o lj_opt_mem.o lj_opt_fold.o lj_opt_narrow.o \\\r\n\t  lj_opt_dce.o lj_opt_loop.o lj_opt_split.o lj_opt_sink.o \\\r\n\t  lj_mcode.o lj_snap.o lj_record.o lj_crecord.o lj_ffrecord.o \\\r\n\t  lj_asm.o lj_trace.o lj_gdbjit.o \\\r\n\t  lj_ctype.o lj_cdata.o lj_cconv.o lj_ccall.o lj_ccallback.o \\\r\n\t  lj_carith.o lj_clib.o lj_cparse.o \\\r\n\t  lj_lib.o lj_alloc.o lib_aux.o \\\r\n\t  $(LJLIB_O) lib_init.o slua.o\r\n\r\nLJVMCORE_O= $(LJVM_O) $(LJCORE_O)\r\nLJVMCORE_DYNO= $(LJVMCORE_O:.o=_dyn.o)\r\n\r\nLIB_VMDEF= jit/vmdef.lua\r\nLIB_VMDEFP= $(LIB_VMDEF)\r\n\r\nLUAJIT_O= luajit.o\r\nLUAJIT_A= libluajit.a\r\nLUAJIT_SO= libluajit.so\r\nLUAJIT_T= luajit\r\n\r\nALL_T= $(LUAJIT_T) $(LUAJIT_A) $(LUAJIT_SO) $(HOST_T)\r\nALL_HDRGEN= lj_bcdef.h lj_ffdef.h lj_libdef.h lj_recdef.h lj_folddef.h \\\r\n\t    host/buildvm_arch.h\r\nALL_GEN= $(LJVM_S) $(ALL_HDRGEN) $(LIB_VMDEFP)\r\nWIN_RM= *.obj *.lib *.exp *.dll *.exe *.manifest *.pdb *.ilk\r\nALL_RM= $(ALL_T) $(ALL_GEN) *.o host/*.o $(WIN_RM)\r\n\r\n##############################################################################\r\n# Build mode handling.\r\n##############################################################################\r\n\r\n# Mixed mode defaults.\r\nTARGET_O= $(LUAJIT_A)\r\nTARGET_T= $(LUAJIT_T) $(LUAJIT_SO)\r\nTARGET_DEP= $(LIB_VMDEF) $(LUAJIT_SO)\r\n\r\nifeq (Windows,$(TARGET_SYS))\r\n  TARGET_DYNCC= $(STATIC_CC)\r\n  LJVM_MODE= peobj\r\n  LJVM_BOUT= $(LJVM_O)\r\n  LUAJIT_T= luajit.exe\r\n  ifeq (cygwin,$(HOST_MSYS))\r\n    LUAJIT_SO= cyg$(TARGET_DLLNAME)\r\n  else\r\n    LUAJIT_SO= $(TARGET_DLLNAME)\r\n  endif\r\n  # Mixed mode is not supported on Windows. And static mode doesn't work well.\r\n  # C modules cannot be loaded, because they bind to lua51.dll.\r\n  ifneq (static,$(BUILDMODE))\r\n    BUILDMODE= dynamic\r\n    TARGET_XCFLAGS+= -DLUA_BUILD_AS_DLL\r\n  endif\r\nendif\r\nifeq (Darwin,$(TARGET_SYS))\r\n  LJVM_MODE= machasm\r\nendif\r\nifeq (iOS,$(TARGET_SYS))\r\n  LJVM_MODE= machasm\r\nendif\r\nifeq (SunOS,$(TARGET_SYS))\r\n  BUILDMODE= static\r\nendif\r\nifeq (PS3,$(TARGET_SYS))\r\n  BUILDMODE= static\r\nendif\r\n\r\nifeq (Windows,$(HOST_SYS))\r\n  MINILUA_T= host/minilua.exe\r\n  BUILDVM_T= host/buildvm.exe\r\n  ifeq (,$(HOST_MSYS))\r\n    MINILUA_X= host\\minilua\r\n    BUILDVM_X= host\\buildvm\r\n    ALL_RM:= $(subst /,\\,$(ALL_RM))\r\n  endif\r\nendif\r\n\r\nifeq (static,$(BUILDMODE))\r\n  TARGET_DYNCC= @:\r\n  TARGET_T= $(LUAJIT_T)\r\n  TARGET_DEP= $(LIB_VMDEF)\r\nelse\r\nifeq (dynamic,$(BUILDMODE))\r\n  ifneq (Windows,$(TARGET_SYS))\r\n    TARGET_CC= $(DYNAMIC_CC)\r\n  endif\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\n  TARGET_O= $(LUAJIT_SO)\r\n  TARGET_XLDFLAGS+= $(TARGET_DYNXLDOPTS)\r\nelse\r\nifeq (Darwin,$(TARGET_SYS))\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\nendif\r\nifeq (iOS,$(TARGET_SYS))\r\n  TARGET_DYNCC= @:\r\n  LJVMCORE_DYNO= $(LJVMCORE_O)\r\nendif\r\nendif\r\nendif\r\n\r\nQ= @\r\nE= @echo\r\n#Q=\r\n#E= @:\r\n\r\n##############################################################################\r\n# Make targets.\r\n##############################################################################\r\n\r\ndefault all:\t$(TARGET_T)\r\n\r\namalg:\r\n\t@grep \"^[+|]\" ljamalg.c\r\n\t$(MAKE) all \"LJCORE_O=ljamalg.o\"\r\n\r\nclean:\r\n\t$(HOST_RM) $(ALL_RM)\r\n\r\nlibbc:\r\n\t./$(LUAJIT_T) host/genlibbc.lua -o host/buildvm_libbc.h $(LJLIB_C)\r\n\t$(MAKE) all\r\n\r\ndepend:\r\n\t@for file in $(ALL_HDRGEN); do \\\r\n\t  test -f $$file || touch $$file; \\\r\n\t  done\r\n\t@$(HOST_CC) $(HOST_ACFLAGS) -MM *.c host/*.c | \\\r\n\t  sed -e \"s| [^ ]*/dasm_\\S*\\.h||g\" \\\r\n\t      -e \"s|^\\([^l ]\\)|host/\\1|\" \\\r\n\t      -e \"s| lj_target_\\S*\\.h| lj_target_*.h|g\" \\\r\n\t      -e \"s| lj_emit_\\S*\\.h| lj_emit_*.h|g\" \\\r\n\t      -e \"s| lj_asm_\\S*\\.h| lj_asm_*.h|g\" >Makefile.dep\r\n\t@for file in $(ALL_HDRGEN); do \\\r\n\t  test -s $$file || $(HOST_RM) $$file; \\\r\n\t  done\r\n\r\n.PHONY: default all amalg clean libbc depend\r\n\r\n##############################################################################\r\n# Rules for generated files.\r\n##############################################################################\r\n\r\n$(MINILUA_T): $(MINILUA_O)\r\n\t$(E) \"HOSTLINK  $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ALDFLAGS) -o $@ $(MINILUA_O) $(MINILUA_LIBS) $(HOST_ALIBS)\r\n\r\nhost/buildvm_arch.h: $(DASM_DASC) $(DASM_DEP)\r\n\t$(E) \"DYNASM    $@\"\r\n\t$(Q)$(DASM) $(DASM_FLAGS) -o $@ $(DASM_DASC)\r\n\r\nhost/buildvm.o: $(DASM_DIR)/dasm_*.h\r\n\r\n$(BUILDVM_T): $(BUILDVM_O)\r\n\t$(E) \"HOSTLINK  $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ALDFLAGS) -o $@ $(BUILDVM_O) $(HOST_ALIBS)\r\n\r\n$(LJVM_BOUT): $(BUILDVM_T)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m $(LJVM_MODE) -o $@\r\n\r\nlj_bcdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m bcdef -o $@ $(LJLIB_C)\r\n\r\nlj_ffdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m ffdef -o $@ $(LJLIB_C)\r\n\r\nlj_libdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m libdef -o $@ $(LJLIB_C)\r\n\r\nlj_recdef.h: $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m recdef -o $@ $(LJLIB_C)\r\n\r\n$(LIB_VMDEF): $(BUILDVM_T) $(LJLIB_C)\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m vmdef -o $(LIB_VMDEFP) $(LJLIB_C)\r\n\r\nlj_folddef.h: $(BUILDVM_T) lj_opt_fold.c\r\n\t$(E) \"BUILDVM   $@\"\r\n\t$(Q)$(BUILDVM_X) -m folddef -o $@ lj_opt_fold.c\r\n\r\n##############################################################################\r\n# Object file rules.\r\n##############################################################################\r\n\r\n%.o: %.c\r\n\t$(E) \"CC        $@\"\r\n\t$(Q)$(TARGET_DYNCC) $(TARGET_ACFLAGS) -c -o $(@:.o=_dyn.o) $<\r\n\t$(Q)$(TARGET_CC) $(TARGET_ACFLAGS) -c -o $@ $<\r\n\r\n%.o: %.S\r\n\t$(E) \"ASM       $@\"\r\n\t$(Q)$(TARGET_DYNCC) $(TARGET_ASFLAGS) -c -o $(@:.o=_dyn.o) $<\r\n\t$(Q)$(TARGET_CC) $(TARGET_ASFLAGS) -c -o $@ $<\r\n\r\n$(LUAJIT_O):\r\n\t$(E) \"CC        $@\"\r\n\t$(Q)$(TARGET_STCC) $(TARGET_ACFLAGS) -c -o $@ $<\r\n\r\n$(HOST_O): %.o: %.c\r\n\t$(E) \"HOSTCC    $@\"\r\n\t$(Q)$(HOST_CC) $(HOST_ACFLAGS) -c -o $@ $<\r\n\r\ninclude Makefile.dep\r\n\r\n##############################################################################\r\n# Target file rules.\r\n##############################################################################\r\n\r\n$(LUAJIT_A): $(LJVMCORE_O)\r\n\t$(E) \"AR        $@\"\r\n\t$(Q)$(TARGET_AR) $@ $(LJVMCORE_O)\r\n\r\n# The dependency on _O, but linking with _DYNO is intentional.\r\n$(LUAJIT_SO): $(LJVMCORE_O)\r\n\t$(E) \"DYNLINK   $@\"\r\n\t$(Q)$(TARGET_LD) $(TARGET_ASHLDFLAGS) -o $@ $(LJVMCORE_DYNO) $(TARGET_ALIBS)\r\n\t$(Q)$(TARGET_STRIP) $@\r\n\r\n$(LUAJIT_T): $(TARGET_O) $(LUAJIT_O) $(TARGET_DEP)\r\n\t$(E) \"LINK      $@\"\r\n\t$(Q)$(TARGET_LD) $(TARGET_ALDFLAGS) -o $@ $(LUAJIT_O) $(TARGET_O) $(TARGET_ALIBS)\r\n\t$(Q)$(TARGET_STRIP) $@\r\n\t$(E) \"OK        Successfully built LuaJIT\"\r\n\r\n##############################################################################\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/Makefile.dep",
    "content": "lib_aux.o: lib_aux.c lua.h luaconf.h lauxlib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_state.h lj_trace.h lj_jit.h lj_ir.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_lib.h lj_alloc.h\r\nlib_base.o: lib_base.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h \\\r\n lj_tab.h lj_meta.h lj_state.h lj_ctype.h lj_cconv.h lj_bc.h lj_ff.h \\\r\n lj_ffdef.h lj_dispatch.h lj_jit.h lj_ir.h lj_char.h lj_strscan.h \\\r\n lj_strfmt.h lj_lib.h lj_libdef.h\r\nlib_bit.o: lib_bit.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_buf.h lj_gc.h lj_str.h lj_strscan.h \\\r\n lj_strfmt.h lj_ctype.h lj_cdata.h lj_cconv.h lj_carith.h lj_ff.h \\\r\n lj_ffdef.h lj_lib.h lj_libdef.h\r\nlib_debug.o: lib_debug.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_lib.h \\\r\n lj_libdef.h\r\nlib_ffi.o: lib_ffi.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_meta.h \\\r\n lj_ctype.h lj_cparse.h lj_cdata.h lj_cconv.h lj_carith.h lj_ccall.h \\\r\n lj_ccallback.h lj_clib.h lj_strfmt.h lj_ff.h lj_ffdef.h lj_lib.h \\\r\n lj_libdef.h\r\nlib_init.o: lib_init.c lua.h luaconf.h lauxlib.h lualib.h lj_arch.h\r\nlib_io.o: lib_io.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_state.h \\\r\n lj_strfmt.h lj_ff.h lj_ffdef.h lj_lib.h lj_libdef.h\r\nlib_jit.o: lib_jit.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h \\\r\n lj_state.h lj_bc.h lj_ctype.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h \\\r\n lj_target.h lj_target_*.h lj_trace.h lj_dispatch.h lj_traceerr.h \\\r\n lj_vm.h lj_vmevent.h lj_lib.h luajit.h lj_libdef.h\r\nlib_math.o: lib_math.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_lib.h lj_vm.h lj_libdef.h\r\nlib_os.o: lib_os.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_lib.h \\\r\n lj_libdef.h\r\nlib_package.o: lib_package.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_err.h lj_errmsg.h lj_lib.h\r\nlib_string.o: lib_string.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h \\\r\n lj_tab.h lj_meta.h lj_state.h lj_ff.h lj_ffdef.h lj_bcdump.h lj_lex.h \\\r\n lj_char.h lj_strfmt.h lj_lib.h lj_libdef.h\r\nlib_table.o: lib_table.c lua.h luaconf.h lauxlib.h lualib.h lj_obj.h \\\r\n lj_def.h lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h \\\r\n lj_tab.h lj_ff.h lj_ffdef.h lj_lib.h lj_libdef.h\r\nlj_alloc.o: lj_alloc.c lj_def.h lua.h luaconf.h lj_arch.h lj_alloc.h\r\nlj_api.o: lj_api.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_tab.h lj_func.h lj_udata.h \\\r\n lj_meta.h lj_state.h lj_bc.h lj_frame.h lj_trace.h lj_jit.h lj_ir.h \\\r\n lj_dispatch.h lj_traceerr.h lj_vm.h lj_strscan.h lj_strfmt.h\r\nlj_asm.o: lj_asm.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_str.h lj_tab.h lj_frame.h lj_bc.h lj_ctype.h lj_ir.h lj_jit.h \\\r\n lj_ircall.h lj_iropt.h lj_mcode.h lj_trace.h lj_dispatch.h lj_traceerr.h \\\r\n lj_snap.h lj_asm.h lj_vm.h lj_target.h lj_target_*.h lj_emit_*.h \\\r\n lj_asm_*.h\r\nlj_bc.o: lj_bc.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_bc.h \\\r\n lj_bcdef.h\r\nlj_bcread.o: lj_bcread.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_bc.h \\\r\n lj_ctype.h lj_cdata.h lualib.h lj_lex.h lj_bcdump.h lj_state.h \\\r\n lj_strfmt.h\r\nlj_bcwrite.o: lj_bcwrite.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_buf.h lj_str.h lj_bc.h lj_ctype.h lj_dispatch.h lj_jit.h \\\r\n lj_ir.h lj_strfmt.h lj_bcdump.h lj_lex.h lj_err.h lj_errmsg.h lj_vm.h\r\nlj_buf.o: lj_buf.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_strfmt.h\r\nlj_carith.o: lj_carith.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_meta.h lj_ir.h lj_ctype.h \\\r\n lj_cconv.h lj_cdata.h lj_carith.h lj_strscan.h\r\nlj_ccall.o: lj_ccall.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_ctype.h lj_cconv.h lj_cdata.h \\\r\n lj_ccall.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_bc.h \\\r\n lj_traceerr.h\r\nlj_ccallback.o: lj_ccallback.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_state.h lj_frame.h \\\r\n lj_bc.h lj_ctype.h lj_cconv.h lj_ccall.h lj_ccallback.h lj_target.h \\\r\n lj_target_*.h lj_mcode.h lj_jit.h lj_ir.h lj_trace.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h\r\nlj_cconv.o: lj_cconv.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h lj_ctype.h lj_gc.h lj_cdata.h lj_cconv.h \\\r\n lj_ccallback.h\r\nlj_cdata.o: lj_cdata.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_tab.h lj_ctype.h lj_cconv.h lj_cdata.h\r\nlj_char.o: lj_char.c lj_char.h lj_def.h lua.h luaconf.h\r\nlj_clib.o: lj_clib.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h lj_str.h lj_udata.h lj_ctype.h lj_cconv.h \\\r\n lj_cdata.h lj_clib.h lj_strfmt.h\r\nlj_cparse.o: lj_cparse.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_ctype.h lj_cparse.h \\\r\n lj_frame.h lj_bc.h lj_vm.h lj_char.h lj_strscan.h lj_strfmt.h\r\nlj_crecord.o: lj_crecord.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h lj_frame.h lj_bc.h lj_ctype.h lj_gc.h \\\r\n lj_cdata.h lj_cparse.h lj_cconv.h lj_carith.h lj_clib.h lj_ccall.h \\\r\n lj_ff.h lj_ffdef.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_record.h lj_ffrecord.h lj_snap.h \\\r\n lj_crecord.h lj_strfmt.h\r\nlj_ctype.o: lj_ctype.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_strfmt.h lj_ctype.h \\\r\n lj_ccallback.h\r\nlj_debug.o: lj_debug.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_debug.h lj_buf.h lj_gc.h lj_str.h lj_tab.h \\\r\n lj_state.h lj_frame.h lj_bc.h lj_strfmt.h lj_jit.h lj_ir.h\r\nlj_dispatch.o: lj_dispatch.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_gc.h lj_str.h lj_func.h lj_tab.h \\\r\n lj_meta.h lj_debug.h lj_state.h lj_frame.h lj_bc.h lj_ff.h lj_ffdef.h \\\r\n lj_strfmt.h lj_jit.h lj_ir.h lj_ccallback.h lj_ctype.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_profile.h lj_vm.h luajit.h\r\nlj_err.o: lj_err.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_err.h \\\r\n lj_errmsg.h lj_debug.h lj_str.h lj_func.h lj_state.h lj_frame.h lj_bc.h \\\r\n lj_ff.h lj_ffdef.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h lj_strfmt.h\r\nlj_ffrecord.o: lj_ffrecord.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_frame.h lj_bc.h lj_ff.h \\\r\n lj_ffdef.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_record.h lj_ffrecord.h lj_crecord.h \\\r\n lj_vm.h lj_strscan.h lj_strfmt.h lj_recdef.h\r\nlj_func.o: lj_func.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_func.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_bc.h \\\r\n lj_traceerr.h lj_vm.h\r\nlj_gc.o: lj_gc.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_func.h lj_udata.h \\\r\n lj_meta.h lj_state.h lj_frame.h lj_bc.h lj_ctype.h lj_cdata.h lj_trace.h \\\r\n lj_jit.h lj_ir.h lj_dispatch.h lj_traceerr.h lj_vm.h\r\nlj_gdbjit.o: lj_gdbjit.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_frame.h lj_bc.h lj_buf.h \\\r\n lj_str.h lj_strfmt.h lj_jit.h lj_ir.h lj_dispatch.h\r\nlj_ir.o: lj_ir.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_buf.h lj_str.h lj_tab.h lj_ir.h lj_jit.h lj_ircall.h lj_iropt.h \\\r\n lj_trace.h lj_dispatch.h lj_bc.h lj_traceerr.h lj_ctype.h lj_cdata.h \\\r\n lj_carith.h lj_vm.h lj_strscan.h lj_strfmt.h lj_lib.h\r\nlj_lex.o: lj_lex.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_ctype.h lj_cdata.h \\\r\n lualib.h lj_state.h lj_lex.h lj_parse.h lj_char.h lj_strscan.h \\\r\n lj_strfmt.h\r\nlj_lib.o: lj_lib.c lauxlib.h lua.h luaconf.h lj_obj.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_func.h lj_bc.h \\\r\n lj_dispatch.h lj_jit.h lj_ir.h lj_vm.h lj_strscan.h lj_strfmt.h lj_lex.h \\\r\n lj_bcdump.h lj_lib.h\r\nlj_load.o: lj_load.c lua.h luaconf.h lauxlib.h lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_func.h \\\r\n lj_frame.h lj_bc.h lj_vm.h lj_lex.h lj_bcdump.h lj_parse.h\r\nlj_mcode.o: lj_mcode.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_jit.h lj_ir.h lj_mcode.h lj_trace.h \\\r\n lj_dispatch.h lj_bc.h lj_traceerr.h lj_vm.h\r\nlj_meta.o: lj_meta.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_meta.h lj_frame.h \\\r\n lj_bc.h lj_vm.h lj_strscan.h lj_strfmt.h lj_lib.h\r\nlj_obj.o: lj_obj.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h\r\nlj_opt_dce.o: lj_opt_dce.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_jit.h lj_iropt.h\r\nlj_opt_fold.o: lj_opt_fold.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_buf.h lj_gc.h lj_str.h lj_tab.h lj_ir.h lj_jit.h lj_ircall.h \\\r\n lj_iropt.h lj_trace.h lj_dispatch.h lj_bc.h lj_traceerr.h lj_ctype.h \\\r\n lj_carith.h lj_vm.h lj_strscan.h lj_strfmt.h lj_folddef.h\r\nlj_opt_loop.o: lj_opt_loop.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_buf.h lj_gc.h lj_str.h lj_ir.h lj_jit.h \\\r\n lj_iropt.h lj_trace.h lj_dispatch.h lj_bc.h lj_traceerr.h lj_snap.h \\\r\n lj_vm.h\r\nlj_opt_mem.o: lj_opt_mem.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_tab.h lj_ir.h lj_jit.h lj_iropt.h lj_ircall.h\r\nlj_opt_narrow.o: lj_opt_narrow.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_bc.h lj_ir.h lj_jit.h lj_iropt.h lj_trace.h lj_dispatch.h \\\r\n lj_traceerr.h lj_vm.h lj_strscan.h\r\nlj_opt_sink.o: lj_opt_sink.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_jit.h lj_iropt.h lj_target.h lj_target_*.h\r\nlj_opt_split.o: lj_opt_split.c lj_obj.h lua.h luaconf.h lj_def.h \\\r\n lj_arch.h lj_err.h lj_errmsg.h lj_buf.h lj_gc.h lj_str.h lj_ir.h \\\r\n lj_jit.h lj_ircall.h lj_iropt.h lj_vm.h\r\nlj_parse.o: lj_parse.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_buf.h lj_str.h lj_tab.h \\\r\n lj_func.h lj_state.h lj_bc.h lj_ctype.h lj_strfmt.h lj_lex.h lj_parse.h \\\r\n lj_vm.h lj_vmevent.h\r\nlj_profile.o: lj_profile.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_buf.h lj_gc.h lj_str.h lj_frame.h lj_bc.h lj_debug.h lj_dispatch.h \\\r\n lj_jit.h lj_ir.h lj_trace.h lj_traceerr.h lj_profile.h luajit.h\r\nlj_record.o: lj_record.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_tab.h lj_meta.h lj_frame.h lj_bc.h \\\r\n lj_ctype.h lj_gc.h lj_ff.h lj_ffdef.h lj_debug.h lj_ir.h lj_jit.h \\\r\n lj_ircall.h lj_iropt.h lj_trace.h lj_dispatch.h lj_traceerr.h \\\r\n lj_record.h lj_ffrecord.h lj_snap.h lj_vm.h\r\nlj_snap.o: lj_snap.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_tab.h lj_state.h lj_frame.h lj_bc.h lj_ir.h lj_jit.h lj_iropt.h \\\r\n lj_trace.h lj_dispatch.h lj_traceerr.h lj_snap.h lj_target.h \\\r\n lj_target_*.h lj_ctype.h lj_cdata.h\r\nlj_state.o: lj_state.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h lj_func.h \\\r\n lj_meta.h lj_state.h lj_frame.h lj_bc.h lj_ctype.h lj_trace.h lj_jit.h \\\r\n lj_ir.h lj_dispatch.h lj_traceerr.h lj_vm.h lj_lex.h lj_alloc.h luajit.h\r\nlj_str.o: lj_str.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_str.h lj_char.h\r\nlj_strfmt.o: lj_strfmt.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_buf.h lj_gc.h lj_str.h lj_state.h lj_char.h lj_strfmt.h\r\nlj_strscan.o: lj_strscan.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_char.h lj_strscan.h\r\nlj_tab.o: lj_tab.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h lj_gc.h \\\r\n lj_err.h lj_errmsg.h lj_tab.h\r\nlj_trace.o: lj_trace.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_err.h lj_errmsg.h lj_debug.h lj_str.h lj_frame.h lj_bc.h \\\r\n lj_state.h lj_ir.h lj_jit.h lj_iropt.h lj_mcode.h lj_trace.h \\\r\n lj_dispatch.h lj_traceerr.h lj_snap.h lj_gdbjit.h lj_record.h lj_asm.h \\\r\n lj_vm.h lj_vmevent.h lj_target.h lj_target_*.h\r\nlj_udata.o: lj_udata.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_gc.h lj_udata.h\r\nlj_vmevent.o: lj_vmevent.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_str.h lj_tab.h lj_state.h lj_dispatch.h lj_bc.h lj_jit.h lj_ir.h \\\r\n lj_vm.h lj_vmevent.h\r\nlj_vmmath.o: lj_vmmath.c lj_obj.h lua.h luaconf.h lj_def.h lj_arch.h \\\r\n lj_ir.h lj_vm.h\r\nljamalg.o: ljamalg.c lua.h luaconf.h lauxlib.h lj_gc.c lj_obj.h lj_def.h \\\r\n lj_arch.h lj_gc.h lj_err.h lj_errmsg.h lj_buf.h lj_str.h lj_tab.h \\\r\n lj_func.h lj_udata.h lj_meta.h lj_state.h lj_frame.h lj_bc.h lj_ctype.h \\\r\n lj_cdata.h lj_trace.h lj_jit.h lj_ir.h lj_dispatch.h lj_traceerr.h \\\r\n lj_vm.h lj_err.c lj_debug.h lj_ff.h lj_ffdef.h lj_strfmt.h lj_char.c \\\r\n lj_char.h lj_bc.c lj_bcdef.h lj_obj.c lj_buf.c lj_str.c lj_tab.c \\\r\n lj_func.c lj_udata.c lj_meta.c lj_strscan.h lj_lib.h lj_debug.c \\\r\n lj_state.c lj_lex.h lj_alloc.h luajit.h lj_dispatch.c lj_ccallback.h \\\r\n lj_profile.h lj_vmevent.c lj_vmevent.h lj_vmmath.c lj_strscan.c \\\r\n lj_strfmt.c lj_api.c lj_profile.c lj_lex.c lualib.h lj_parse.h \\\r\n lj_parse.c lj_bcread.c lj_bcdump.h lj_bcwrite.c lj_load.c lj_ctype.c \\\r\n lj_cdata.c lj_cconv.h lj_cconv.c lj_ccall.c lj_ccall.h lj_ccallback.c \\\r\n lj_target.h lj_target_*.h lj_mcode.h lj_carith.c lj_carith.h lj_clib.c \\\r\n lj_clib.h lj_cparse.c lj_cparse.h lj_lib.c lj_ir.c lj_ircall.h \\\r\n lj_iropt.h lj_opt_mem.c lj_opt_fold.c lj_folddef.h lj_opt_narrow.c \\\r\n lj_opt_dce.c lj_opt_loop.c lj_snap.h lj_opt_split.c lj_opt_sink.c \\\r\n lj_mcode.c lj_snap.c lj_record.c lj_record.h lj_ffrecord.h lj_crecord.c \\\r\n lj_crecord.h lj_ffrecord.c lj_recdef.h lj_asm.c lj_asm.h lj_emit_*.h \\\r\n lj_asm_*.h lj_trace.c lj_gdbjit.h lj_gdbjit.c lj_alloc.c lib_aux.c \\\r\n lib_base.c lj_libdef.h lib_math.c lib_string.c lib_table.c lib_io.c \\\r\n lib_os.c lib_package.c lib_debug.c lib_bit.c lib_jit.c lib_ffi.c \\\r\n lib_init.c\r\nluajit.o: luajit.c lua.h luaconf.h lauxlib.h lualib.h luajit.h lj_arch.h\r\nhost/buildvm.o: host/buildvm.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_gc.h lj_obj.h lj_bc.h lj_ir.h \\\r\n lj_ircall.h lj_ir.h lj_jit.h lj_frame.h lj_bc.h lj_dispatch.h lj_ctype.h \\\r\n lj_gc.h lj_ccall.h lj_ctype.h luajit.h \\\r\n host/buildvm_arch.h lj_traceerr.h\r\nhost/buildvm_asm.o: host/buildvm_asm.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_bc.h lj_def.h lj_arch.h\r\nhost/buildvm_fold.o: host/buildvm_fold.c host/buildvm.h lj_def.h lua.h \\\r\n luaconf.h lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_ir.h lj_obj.h\r\nhost/buildvm_lib.o: host/buildvm_lib.c host/buildvm.h lj_def.h lua.h luaconf.h \\\r\n lj_arch.h lj_obj.h lj_def.h lj_arch.h lj_bc.h lj_lib.h lj_obj.h \\\r\n host/buildvm_libbc.h\r\nhost/buildvm_peobj.o: host/buildvm_peobj.c host/buildvm.h lj_def.h lua.h \\\r\n luaconf.h lj_arch.h lj_bc.h lj_def.h lj_arch.h\r\nhost/minilua.o: host/minilua.c\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/README",
    "content": "The files in this directory are only used during the build process of LuaJIT.\r\nFor cross-compilation, they must be executed on the host, not on the target.\r\n\r\nThese files should NOT be installed!\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm.c",
    "content": "/*\r\n** LuaJIT VM builder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** This is a tool to build the hand-tuned assembler code required for\r\n** LuaJIT's bytecode interpreter. It supports a variety of output formats\r\n** to feed different toolchains (see usage() below).\r\n**\r\n** This tool is not particularly optimized because it's only used while\r\n** _building_ LuaJIT. There's no point in distributing or installing it.\r\n** Only the object code generated by this tool is linked into LuaJIT.\r\n**\r\n** Caveat: some memory is not free'd, error handling is lazy.\r\n** It's a one-shot tool -- any effort fixing this would be wasted.\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_dispatch.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_ccall.h\"\r\n#endif\r\n#include \"luajit.h\"\r\n\r\n#if defined(_WIN32)\r\n#include <fcntl.h>\r\n#include <io.h>\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* DynASM glue definitions. */\r\n#define Dst\t\tctx\r\n#define Dst_DECL\tBuildCtx *ctx\r\n#define Dst_REF\t\t(ctx->D)\r\n#define DASM_CHECKS\t1\r\n\r\n#include \"../dynasm/dasm_proto.h\"\r\n\r\n/* Glue macros for DynASM. */\r\nstatic int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type);\r\n\r\n#define DASM_EXTERN(ctx, addr, idx, type) \\\r\n  collect_reloc(ctx, addr, idx, type)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Avoid trouble if cross-compiling for an x86 target. Speed doesn't matter. */\r\n#define DASM_ALIGNED_WRITES\t1\r\n\r\n/* Embed architecture-specific DynASM encoder. */\r\n#if LJ_TARGET_X86ORX64\r\n#include \"../dynasm/dasm_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"../dynasm/dasm_arm.h\"\r\n#elif LJ_TARGET_ARM64\r\n#include \"../dynasm/dasm_arm64.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"../dynasm/dasm_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"../dynasm/dasm_mips.h\"\r\n#else\r\n#error \"No support for this architecture (yet)\"\r\n#endif\r\n\r\n/* Embed generated architecture-specific backend. */\r\n#include \"buildvm_arch.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nvoid owrite(BuildCtx *ctx, const void *ptr, size_t sz)\r\n{\r\n  if (fwrite(ptr, 1, sz, ctx->fp) != sz) {\r\n    fprintf(stderr, \"Error: cannot write to output file: %s\\n\",\r\n\t    strerror(errno));\r\n    exit(1);\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Emit code as raw bytes. Only used for DynASM debugging. */\r\nstatic void emit_raw(BuildCtx *ctx)\r\n{\r\n  owrite(ctx, ctx->code, ctx->codesz);\r\n}\r\n\r\n/* -- Build machine code -------------------------------------------------- */\r\n\r\nstatic const char *sym_decorate(BuildCtx *ctx,\r\n\t\t\t\tconst char *prefix, const char *suffix)\r\n{\r\n  char name[256];\r\n  char *p;\r\n#if LJ_64\r\n  const char *symprefix = ctx->mode == BUILD_machasm ? \"_\" : \"\";\r\n#elif LJ_TARGET_XBOX360\r\n  const char *symprefix = \"\";\r\n#else\r\n  const char *symprefix = ctx->mode != BUILD_elfasm ? \"_\" : \"\";\r\n#endif\r\n  sprintf(name, \"%s%s%s\", symprefix, prefix, suffix);\r\n  p = strchr(name, '@');\r\n  if (p) {\r\n#if LJ_TARGET_X86ORX64\r\n    if (!LJ_64 && (ctx->mode == BUILD_coffasm || ctx->mode == BUILD_peobj))\r\n      name[0] = '@';\r\n    else\r\n      *p = '\\0';\r\n#elif LJ_TARGET_PPC && !LJ_TARGET_CONSOLE\r\n    /* Keep @plt etc. */\r\n#else\r\n    *p = '\\0';\r\n#endif\r\n  }\r\n  p = (char *)malloc(strlen(name)+1);  /* MSVC doesn't like strdup. */\r\n  strcpy(p, name);\r\n  return p;\r\n}\r\n\r\n#define NRELOCSYM\t(sizeof(extnames)/sizeof(extnames[0])-1)\r\n\r\nstatic int relocmap[NRELOCSYM];\r\n\r\n/* Collect external relocations. */\r\nstatic int collect_reloc(BuildCtx *ctx, uint8_t *addr, int idx, int type)\r\n{\r\n  if (ctx->nreloc >= BUILD_MAX_RELOC) {\r\n    fprintf(stderr, \"Error: too many relocations, increase BUILD_MAX_RELOC.\\n\");\r\n    exit(1);\r\n  }\r\n  if (relocmap[idx] < 0) {\r\n    relocmap[idx] = ctx->nrelocsym;\r\n    ctx->relocsym[ctx->nrelocsym] = sym_decorate(ctx, \"\", extnames[idx]);\r\n    ctx->nrelocsym++;\r\n  }\r\n  ctx->reloc[ctx->nreloc].ofs = (int32_t)(addr - ctx->code);\r\n  ctx->reloc[ctx->nreloc].sym = relocmap[idx];\r\n  ctx->reloc[ctx->nreloc].type = type;\r\n  ctx->nreloc++;\r\n#if LJ_TARGET_XBOX360\r\n  return (int)(ctx->code - addr) + 4;  /* Encode symbol offset of .text. */\r\n#else\r\n  return 0;  /* Encode symbol offset of 0. */\r\n#endif\r\n}\r\n\r\n/* Naive insertion sort. Performance doesn't matter here. */\r\nstatic void sym_insert(BuildCtx *ctx, int32_t ofs,\r\n\t\t       const char *prefix, const char *suffix)\r\n{\r\n  ptrdiff_t i = ctx->nsym++;\r\n  while (i > 0) {\r\n    if (ctx->sym[i-1].ofs <= ofs)\r\n      break;\r\n    ctx->sym[i] = ctx->sym[i-1];\r\n    i--;\r\n  }\r\n  ctx->sym[i].ofs = ofs;\r\n  ctx->sym[i].name = sym_decorate(ctx, prefix, suffix);\r\n}\r\n\r\n/* Build the machine code. */\r\nstatic int build_code(BuildCtx *ctx)\r\n{\r\n  int status;\r\n  int i;\r\n\r\n  /* Initialize DynASM structures. */\r\n  ctx->nglob = GLOB__MAX;\r\n  ctx->glob = (void **)malloc(ctx->nglob*sizeof(void *));\r\n  memset(ctx->glob, 0, ctx->nglob*sizeof(void *));\r\n  ctx->nreloc = 0;\r\n\r\n  ctx->globnames = globnames;\r\n  ctx->extnames = extnames;\r\n  ctx->relocsym = (const char **)malloc(NRELOCSYM*sizeof(const char *));\r\n  ctx->nrelocsym = 0;\r\n  for (i = 0; i < (int)NRELOCSYM; i++) relocmap[i] = -1;\r\n\r\n  ctx->dasm_ident = DASM_IDENT;\r\n  ctx->dasm_arch = DASM_ARCH;\r\n\r\n  dasm_init(Dst, DASM_MAXSECTION);\r\n  dasm_setupglobal(Dst, ctx->glob, ctx->nglob);\r\n  dasm_setup(Dst, build_actionlist);\r\n\r\n  /* Call arch-specific backend to emit the code. */\r\n  ctx->npc = build_backend(ctx);\r\n\r\n  /* Finalize the code. */\r\n  (void)dasm_checkstep(Dst, -1);\r\n  if ((status = dasm_link(Dst, &ctx->codesz))) return status;\r\n  ctx->code = (uint8_t *)malloc(ctx->codesz);\r\n  if ((status = dasm_encode(Dst, (void *)ctx->code))) return status;\r\n\r\n  /* Allocate symbol table and bytecode offsets. */\r\n  ctx->beginsym = sym_decorate(ctx, \"\", LABEL_PREFIX \"vm_asm_begin\");\r\n  ctx->sym = (BuildSym *)malloc((ctx->npc+ctx->nglob+1)*sizeof(BuildSym));\r\n  ctx->nsym = 0;\r\n  ctx->bc_ofs = (int32_t *)malloc(ctx->npc*sizeof(int32_t));\r\n\r\n  /* Collect the opcodes (PC labels). */\r\n  for (i = 0; i < ctx->npc; i++) {\r\n    int32_t ofs = dasm_getpclabel(Dst, i);\r\n    if (ofs < 0) return 0x22000000|i;\r\n    ctx->bc_ofs[i] = ofs;\r\n    if ((LJ_HASJIT ||\r\n\t !(i == BC_JFORI || i == BC_JFORL || i == BC_JITERL || i == BC_JLOOP ||\r\n\t   i == BC_IFORL || i == BC_IITERL || i == BC_ILOOP)) &&\r\n\t(LJ_HASFFI || i != BC_KCDATA))\r\n      sym_insert(ctx, ofs, LABEL_PREFIX_BC, bc_names[i]);\r\n  }\r\n\r\n  /* Collect the globals (named labels). */\r\n  for (i = 0; i < ctx->nglob; i++) {\r\n    const char *gl = globnames[i];\r\n    int len = (int)strlen(gl);\r\n    if (!ctx->glob[i]) {\r\n      fprintf(stderr, \"Error: undefined global %s\\n\", gl);\r\n      exit(2);\r\n    }\r\n    /* Skip the _Z symbols. */\r\n    if (!(len >= 2 && gl[len-2] == '_' && gl[len-1] == 'Z'))\r\n      sym_insert(ctx, (int32_t)((uint8_t *)(ctx->glob[i]) - ctx->code),\r\n\t\t LABEL_PREFIX, globnames[i]);\r\n  }\r\n\r\n  /* Close the address range. */\r\n  sym_insert(ctx, (int32_t)ctx->codesz, \"\", \"\");\r\n  ctx->nsym--;\r\n\r\n  dasm_free(Dst);\r\n\r\n  return 0;\r\n}\r\n\r\n/* -- Generate VM enums --------------------------------------------------- */\r\n\r\nconst char *const bc_names[] = {\r\n#define BCNAME(name, ma, mb, mc, mt)       #name,\r\nBCDEF(BCNAME)\r\n#undef BCNAME\r\n  NULL\r\n};\r\n\r\nconst char *const ir_names[] = {\r\n#define IRNAME(name, m, m1, m2)\t#name,\r\nIRDEF(IRNAME)\r\n#undef IRNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irt_names[] = {\r\n#define IRTNAME(name, size)\t#name,\r\nIRTDEF(IRTNAME)\r\n#undef IRTNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irfpm_names[] = {\r\n#define FPMNAME(name)\t\t#name,\r\nIRFPMDEF(FPMNAME)\r\n#undef FPMNAME\r\n  NULL\r\n};\r\n\r\nconst char *const irfield_names[] = {\r\n#define FLNAME(name, ofs)\t#name,\r\nIRFLDEF(FLNAME)\r\n#undef FLNAME\r\n  NULL\r\n};\r\n\r\nconst char *const ircall_names[] = {\r\n#define IRCALLNAME(cond, name, nargs, kind, type, flags)\t#name,\r\nIRCALLDEF(IRCALLNAME)\r\n#undef IRCALLNAME\r\n  NULL\r\n};\r\n\r\nstatic const char *const trace_errors[] = {\r\n#define TREDEF(name, msg)\tmsg,\r\n#include \"lj_traceerr.h\"\r\n  NULL\r\n};\r\n\r\nstatic const char *lower(char *buf, const char *s)\r\n{\r\n  char *p = buf;\r\n  while (*s) {\r\n    *p++ = (*s >= 'A' && *s <= 'Z') ? *s+0x20 : *s;\r\n    s++;\r\n  }\r\n  *p = '\\0';\r\n  return buf;\r\n}\r\n\r\n/* Emit C source code for bytecode-related definitions. */\r\nstatic void emit_bcdef(BuildCtx *ctx)\r\n{\r\n  int i;\r\n  fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  fprintf(ctx->fp, \"LJ_DATADEF const uint16_t lj_bc_ofs[] = {\\n\");\r\n  for (i = 0; i < ctx->npc; i++) {\r\n    if (i != 0)\r\n      fprintf(ctx->fp, \",\\n\");\r\n    fprintf(ctx->fp, \"%d\", ctx->bc_ofs[i]);\r\n  }\r\n}\r\n\r\n/* Emit VM definitions as Lua code for debug modules. */\r\nstatic void emit_vmdef(BuildCtx *ctx)\r\n{\r\n  char buf[80];\r\n  int i;\r\n  fprintf(ctx->fp, \"-- This is a generated file. DO NOT EDIT!\\n\\n\");\r\n  fprintf(ctx->fp, \"return {\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"bcnames = \\\"\");\r\n  for (i = 0; bc_names[i]; i++) fprintf(ctx->fp, \"%-6s\", bc_names[i]);\r\n  fprintf(ctx->fp, \"\\\",\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irnames = \\\"\");\r\n  for (i = 0; ir_names[i]; i++) fprintf(ctx->fp, \"%-6s\", ir_names[i]);\r\n  fprintf(ctx->fp, \"\\\",\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irfpm = { [0]=\");\r\n  for (i = 0; irfpm_names[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\", \", lower(buf, irfpm_names[i]));\r\n  fprintf(ctx->fp, \"},\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"irfield = { [0]=\");\r\n  for (i = 0; irfield_names[i]; i++) {\r\n    char *p;\r\n    lower(buf, irfield_names[i]);\r\n    p = strchr(buf, '_');\r\n    if (p) *p = '.';\r\n    fprintf(ctx->fp, \"\\\"%s\\\", \", buf);\r\n  }\r\n  fprintf(ctx->fp, \"},\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"ircall = {\\n[0]=\");\r\n  for (i = 0; ircall_names[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", ircall_names[i]);\r\n  fprintf(ctx->fp, \"},\\n\\n\");\r\n\r\n  fprintf(ctx->fp, \"traceerr = {\\n[0]=\");\r\n  for (i = 0; trace_errors[i]; i++)\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", trace_errors[i]);\r\n  fprintf(ctx->fp, \"},\\n\\n\");\r\n}\r\n\r\n/* -- Argument parsing ---------------------------------------------------- */\r\n\r\n/* Build mode names. */\r\nstatic const char *const modenames[] = {\r\n#define BUILDNAME(name)\t\t#name,\r\nBUILDDEF(BUILDNAME)\r\n#undef BUILDNAME\r\n  NULL\r\n};\r\n\r\n/* Print usage information and exit. */\r\nstatic void usage(void)\r\n{\r\n  int i;\r\n  fprintf(stderr, LUAJIT_VERSION \" VM builder.\\n\");\r\n  fprintf(stderr, LUAJIT_COPYRIGHT \", \" LUAJIT_URL \"\\n\");\r\n  fprintf(stderr, \"Target architecture: \" LJ_ARCH_NAME \"\\n\\n\");\r\n  fprintf(stderr, \"Usage: buildvm -m mode [-o outfile] [infiles...]\\n\\n\");\r\n  fprintf(stderr, \"Available modes:\\n\");\r\n  for (i = 0; i < BUILD__MAX; i++)\r\n    fprintf(stderr, \"  %s\\n\", modenames[i]);\r\n  exit(1);\r\n}\r\n\r\n/* Parse the output mode name. */\r\nstatic BuildMode parsemode(const char *mode)\r\n{\r\n  int i;\r\n  for (i = 0; modenames[i]; i++)\r\n    if (!strcmp(mode, modenames[i]))\r\n      return (BuildMode)i;\r\n  usage();\r\n  return (BuildMode)-1;\r\n}\r\n\r\n/* Parse arguments. */\r\nstatic void parseargs(BuildCtx *ctx, char **argv)\r\n{\r\n  const char *a;\r\n  int i;\r\n  ctx->mode = (BuildMode)-1;\r\n  ctx->outname = \"-\";\r\n  for (i = 1; (a = argv[i]) != NULL; i++) {\r\n    if (a[0] != '-')\r\n      break;\r\n    switch (a[1]) {\r\n    case '-':\r\n      if (a[2]) goto err;\r\n      i++;\r\n      goto ok;\r\n    case '\\0':\r\n      goto ok;\r\n    case 'm':\r\n      i++;\r\n      if (a[2] || argv[i] == NULL) goto err;\r\n      ctx->mode = parsemode(argv[i]);\r\n      break;\r\n    case 'o':\r\n      i++;\r\n      if (a[2] || argv[i] == NULL) goto err;\r\n      ctx->outname = argv[i];\r\n      break;\r\n    default: err:\r\n      usage();\r\n      break;\r\n    }\r\n  }\r\nok:\r\n  ctx->args = argv+i;\r\n  if (ctx->mode == (BuildMode)-1) goto err;\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n  BuildCtx ctx_;\r\n  BuildCtx *ctx = &ctx_;\r\n  int status, binmode;\r\n\r\n  if (sizeof(void *) != 4*LJ_32+8*LJ_64) {\r\n    fprintf(stderr,\"Error: pointer size mismatch in cross-build.\\n\");\r\n    fprintf(stderr,\"Try: make HOST_CC=\\\"gcc -m32\\\" CROSS=...\\n\\n\");\r\n    return 1;\r\n  }\r\n\r\n  UNUSED(argc);\r\n  parseargs(ctx, argv);\r\n\r\n  if ((status = build_code(ctx))) {\r\n    fprintf(stderr,\"Error: DASM error %08x\\n\", status);\r\n    return 1;\r\n  }\r\n\r\n  switch (ctx->mode) {\r\n  case BUILD_peobj:\r\n  case BUILD_raw:\r\n    binmode = 1;\r\n    break;\r\n  default:\r\n    binmode = 0;\r\n    break;\r\n  }\r\n\r\n  if (ctx->outname[0] == '-' && ctx->outname[1] == '\\0') {\r\n    ctx->fp = stdout;\r\n#if defined(_WIN32)\r\n    if (binmode)\r\n      _setmode(_fileno(stdout), _O_BINARY);  /* Yuck. */\r\n#endif\r\n  } else if (!(ctx->fp = fopen(ctx->outname, binmode ? \"wb\" : \"w\"))) {\r\n    fprintf(stderr, \"Error: cannot open output file '%s': %s\\n\",\r\n\t    ctx->outname, strerror(errno));\r\n    exit(1);\r\n  }\r\n\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n  case BUILD_coffasm:\r\n  case BUILD_machasm:\r\n    emit_asm(ctx);\r\n    emit_asm_debug(ctx);\r\n    break;\r\n  case BUILD_peobj:\r\n    emit_peobj(ctx);\r\n    break;\r\n  case BUILD_raw:\r\n    emit_raw(ctx);\r\n    break;\r\n  case BUILD_bcdef:\r\n    emit_bcdef(ctx);\r\n    emit_lib(ctx);\r\n    break;\r\n  case BUILD_vmdef:\r\n    emit_vmdef(ctx);\r\n    emit_lib(ctx);\r\n    fprintf(ctx->fp, \"}\\n\\n\");\r\n    break;\r\n  case BUILD_ffdef:\r\n  case BUILD_libdef:\r\n  case BUILD_recdef:\r\n    emit_lib(ctx);\r\n    break;\r\n  case BUILD_folddef:\r\n    emit_fold(ctx);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n\r\n  fflush(ctx->fp);\r\n  if (ferror(ctx->fp)) {\r\n    fprintf(stderr, \"Error: cannot write to output file: %s\\n\",\r\n\t    strerror(errno));\r\n    exit(1);\r\n  }\r\n  fclose(ctx->fp);\r\n\r\n  return 0;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm.h",
    "content": "/*\r\n** LuaJIT VM builder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _BUILDVM_H\r\n#define _BUILDVM_H\r\n\r\n#include <sys/types.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <errno.h>\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* Hardcoded limits. Increase as needed. */\r\n#define BUILD_MAX_RELOC\t\t200\t/* Max. number of relocations. */\r\n#define BUILD_MAX_FOLD\t\t4096\t/* Max. number of fold rules. */\r\n\r\n/* Prefix for scanned library definitions. */\r\n#define LIBDEF_PREFIX\t\t\"LJLIB_\"\r\n\r\n/* Prefix for scanned fold definitions. */\r\n#define FOLDDEF_PREFIX\t\t\"LJFOLD\"\r\n\r\n/* Prefixes for generated labels. */\r\n#define LABEL_PREFIX\t\t\"lj_\"\r\n#define LABEL_PREFIX_BC\t\tLABEL_PREFIX \"BC_\"\r\n#define LABEL_PREFIX_FF\t\tLABEL_PREFIX \"ff_\"\r\n#define LABEL_PREFIX_CF\t\tLABEL_PREFIX \"cf_\"\r\n#define LABEL_PREFIX_FFH\tLABEL_PREFIX \"ffh_\"\r\n#define LABEL_PREFIX_LIBCF\tLABEL_PREFIX \"lib_cf_\"\r\n#define LABEL_PREFIX_LIBINIT\tLABEL_PREFIX \"lib_init_\"\r\n\r\n/* Forward declaration. */\r\nstruct dasm_State;\r\n\r\n/* Build modes. */\r\n#define BUILDDEF(_) \\\r\n  _(elfasm) _(coffasm) _(machasm) _(peobj) _(raw) \\\r\n  _(bcdef) _(ffdef) _(libdef) _(recdef) _(vmdef) \\\r\n  _(folddef)\r\n\r\ntypedef enum {\r\n#define BUILDENUM(name)\t\tBUILD_##name,\r\nBUILDDEF(BUILDENUM)\r\n#undef BUILDENUM\r\n  BUILD__MAX\r\n} BuildMode;\r\n\r\n/* Code relocation. */\r\ntypedef struct BuildReloc {\r\n  int32_t ofs;\r\n  int sym;\r\n  int type;\r\n} BuildReloc;\r\n\r\ntypedef struct BuildSym {\r\n  const char *name;\r\n  int32_t ofs;\r\n} BuildSym;\r\n\r\n/* Build context structure. */\r\ntypedef struct BuildCtx {\r\n  /* DynASM state pointer. Should be first member. */\r\n  struct dasm_State *D;\r\n  /* Parsed command line. */\r\n  BuildMode mode;\r\n  FILE *fp;\r\n  const char *outname;\r\n  char **args;\r\n  /* Code and symbols generated by DynASM. */\r\n  uint8_t *code;\r\n  size_t codesz;\r\n  int npc, nglob, nsym, nreloc, nrelocsym;\r\n  void **glob;\r\n  BuildSym *sym;\r\n  const char **relocsym;\r\n  int32_t *bc_ofs;\r\n  const char *beginsym;\r\n  /* Strings generated by DynASM. */\r\n  const char *const *globnames;\r\n  const char *const *extnames;\r\n  const char *dasm_ident;\r\n  const char *dasm_arch;\r\n  /* Relocations. */\r\n  BuildReloc reloc[BUILD_MAX_RELOC];\r\n} BuildCtx;\r\n\r\nextern void owrite(BuildCtx *ctx, const void *ptr, size_t sz);\r\nextern void emit_asm(BuildCtx *ctx);\r\nextern void emit_peobj(BuildCtx *ctx);\r\nextern void emit_lib(BuildCtx *ctx);\r\nextern void emit_fold(BuildCtx *ctx);\r\n\r\nextern const char *const bc_names[];\r\nextern const char *const ir_names[];\r\nextern const char *const irt_names[];\r\nextern const char *const irfpm_names[];\r\nextern const char *const irfield_names[];\r\nextern const char *const ircall_names[];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm_asm.c",
    "content": "/*\r\n** LuaJIT VM builder: Assembler source code emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n/* Emit bytes piecewise as assembler text. */\r\nstatic void emit_asm_bytes(BuildCtx *ctx, uint8_t *p, int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < n; i++) {\r\n    if ((i & 15) == 0)\r\n      fprintf(ctx->fp, \"\\t.byte %d\", p[i]);\r\n    else\r\n      fprintf(ctx->fp, \",%d\", p[i]);\r\n    if ((i & 15) == 15) putc('\\n', ctx->fp);\r\n  }\r\n  if ((n & 15) != 0) putc('\\n', ctx->fp);\r\n}\r\n\r\n/* Emit relocation */\r\nstatic void emit_asm_reloc(BuildCtx *ctx, int type, const char *sym)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    if (type)\r\n      fprintf(ctx->fp, \"\\t.long %s-.-4\\n\", sym);\r\n    else\r\n      fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.def %s; .scl 3; .type 32; .endef\\n\", sym);\r\n    if (type)\r\n      fprintf(ctx->fp, \"\\t.long %s-.-4\\n\", sym);\r\n    else\r\n      fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  default:  /* BUILD_machasm for relative relocations handled below. */\r\n    fprintf(ctx->fp, \"\\t.long %s\\n\", sym);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic const char *const jccnames[] = {\r\n  \"jo\", \"jno\", \"jb\", \"jnb\", \"jz\", \"jnz\", \"jbe\", \"ja\",\r\n  \"js\", \"jns\", \"jpe\", \"jpo\", \"jl\", \"jge\", \"jle\", \"jg\"\r\n};\r\n\r\n/* Emit x86/x64 text relocations. */\r\nstatic void emit_asm_reloc_text(BuildCtx *ctx, uint8_t *cp, int n,\r\n\t\t\t\tconst char *sym)\r\n{\r\n  const char *opname = NULL;\r\n  if (--n < 0) goto err;\r\n  if (cp[n] == 0xe8) {\r\n    opname = \"call\";\r\n  } else if (cp[n] == 0xe9) {\r\n    opname = \"jmp\";\r\n  } else if (cp[n] >= 0x80 && cp[n] <= 0x8f && n > 0 && cp[n-1] == 0x0f) {\r\n    opname = jccnames[cp[n]-0x80];\r\n    n--;\r\n  } else {\r\nerr:\r\n    fprintf(stderr, \"Error: unsupported opcode for %s symbol relocation.\\n\",\r\n\t    sym);\r\n    exit(1);\r\n  }\r\n  emit_asm_bytes(ctx, cp, n);\r\n  if (strncmp(sym+(*sym == '_'), LABEL_PREFIX, sizeof(LABEL_PREFIX)-1)) {\r\n    /* Various fixups for external symbols outside of our binary. */\r\n    if (ctx->mode == BUILD_elfasm) {\r\n      if (LJ_32)\r\n\tfprintf(ctx->fp, \"#if __PIC__\\n\\t%s lj_wrap_%s\\n#else\\n\", opname, sym);\r\n      fprintf(ctx->fp, \"\\t%s %s@PLT\\n\", opname, sym);\r\n      if (LJ_32)\r\n\tfprintf(ctx->fp, \"#endif\\n\");\r\n      return;\r\n    } else if (LJ_32 && ctx->mode == BUILD_machasm) {\r\n      fprintf(ctx->fp, \"\\t%s L%s$stub\\n\", opname, sym);\r\n      return;\r\n    }\r\n  }\r\n  fprintf(ctx->fp, \"\\t%s %s\\n\", opname, sym);\r\n}\r\n#else\r\n/* Emit words piecewise as assembler text. */\r\nstatic void emit_asm_words(BuildCtx *ctx, uint8_t *p, int n)\r\n{\r\n  int i;\r\n  for (i = 0; i < n; i += 4) {\r\n    if ((i & 15) == 0)\r\n      fprintf(ctx->fp, \"\\t.long 0x%08x\", *(uint32_t *)(p+i));\r\n    else\r\n      fprintf(ctx->fp, \",0x%08x\", *(uint32_t *)(p+i));\r\n    if ((i & 15) == 12) putc('\\n', ctx->fp);\r\n  }\r\n  if ((n & 15) != 0) putc('\\n', ctx->fp);\r\n}\r\n\r\n/* Emit relocation as part of an instruction. */\r\nstatic void emit_asm_wordreloc(BuildCtx *ctx, uint8_t *p, int n,\r\n\t\t\t       const char *sym)\r\n{\r\n  uint32_t ins;\r\n  emit_asm_words(ctx, p, n-4);\r\n  ins = *(uint32_t *)(p+n-4);\r\n#if LJ_TARGET_ARM\r\n  if ((ins & 0xff000000u) == 0xfa000000u) {\r\n    fprintf(ctx->fp, \"\\tblx %s\\n\", sym);\r\n  } else if ((ins & 0x0e000000u) == 0x0a000000u) {\r\n    fprintf(ctx->fp, \"\\t%s%.2s %s\\n\", (ins & 0x01000000u) ? \"bl\" : \"b\",\r\n\t    &\"eqnecsccmiplvsvchilsgeltgtle\"[2*(ins >> 28)], sym);\r\n  } else {\r\n    fprintf(stderr,\r\n\t    \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t    ins, sym);\r\n    exit(1);\r\n  }\r\n#elif LJ_TARGET_ARM64\r\n  if ((ins >> 26) == 0x25u) {\r\n    fprintf(ctx->fp, \"\\tbl %s\\n\", sym);\r\n  } else {\r\n    fprintf(stderr,\r\n\t    \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t    ins, sym);\r\n    exit(1);\r\n  }\r\n#elif LJ_TARGET_PPC\r\n#if LJ_TARGET_PS3\r\n#define TOCPREFIX \".\"\r\n#else\r\n#define TOCPREFIX \"\"\r\n#endif\r\n  if ((ins >> 26) == 16) {\r\n    fprintf(ctx->fp, \"\\t%s %d, %d, \" TOCPREFIX \"%s\\n\",\r\n\t    (ins & 1) ? \"bcl\" : \"bc\", (ins >> 21) & 31, (ins >> 16) & 31, sym);\r\n  } else if ((ins >> 26) == 18) {\r\n#if LJ_ARCH_PPC64\r\n    const char *suffix = strchr(sym, '@');\r\n    if (suffix && suffix[1] == 'h') {\r\n      fprintf(ctx->fp, \"\\taddis 11, 2, %s\\n\", sym);\r\n    } else if (suffix && suffix[1] == 'l') {\r\n      fprintf(ctx->fp, \"\\tld 12, %s\\n\", sym);\r\n    } else\r\n#endif\r\n    fprintf(ctx->fp, \"\\t%s \" TOCPREFIX \"%s\\n\", (ins & 1) ? \"bl\" : \"b\", sym);\r\n  } else {\r\n    fprintf(stderr,\r\n\t    \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t    ins, sym);\r\n    exit(1);\r\n  }\r\n#elif LJ_TARGET_MIPS\r\n  fprintf(stderr,\r\n\t  \"Error: unsupported opcode %08x for %s symbol relocation.\\n\",\r\n\t  ins, sym);\r\n  exit(1);\r\n#else\r\n#error \"missing relocation support for this architecture\"\r\n#endif\r\n}\r\n#endif\r\n\r\n#if LJ_TARGET_ARM\r\n#define ELFASM_PX\t\"%%\"\r\n#else\r\n#define ELFASM_PX\t\"@\"\r\n#endif\r\n\r\n/* Emit an assembler label. */\r\nstatic void emit_asm_label(BuildCtx *ctx, const char *name, int size, int isfunc)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n#if LJ_TARGET_PS3\r\n    if (!strncmp(name, \"lj_vm_\", 6) &&\r\n\tstrcmp(name, ctx->beginsym) &&\r\n\t!strstr(name, \"hook\")) {\r\n      fprintf(ctx->fp,\r\n\t\"\\n\\t.globl %s\\n\"\r\n\t\"\\t.section \\\".opd\\\",\\\"aw\\\"\\n\"\r\n\t\"%s:\\n\"\r\n\t\"\\t.long .%s,.TOC.@tocbase32\\n\"\r\n\t\"\\t.size %s,8\\n\"\r\n\t\"\\t.previous\\n\"\r\n\t\"\\t.globl .%s\\n\"\r\n\t\"\\t.hidden .%s\\n\"\r\n\t\"\\t.type .%s, \" ELFASM_PX \"function\\n\"\r\n\t\"\\t.size .%s, %d\\n\"\r\n\t\".%s:\\n\",\r\n\tname, name, name, name, name, name, name, name, size, name);\r\n      break;\r\n    }\r\n#endif\r\n    fprintf(ctx->fp,\r\n      \"\\n\\t.globl %s\\n\"\r\n      \"\\t.hidden %s\\n\"\r\n      \"\\t.type %s, \" ELFASM_PX \"%s\\n\"\r\n      \"\\t.size %s, %d\\n\"\r\n      \"%s:\\n\",\r\n      name, name, name, isfunc ? \"function\" : \"object\", name, size, name);\r\n    break;\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\n\\t.globl %s\\n\", name);\r\n    if (isfunc)\r\n      fprintf(ctx->fp, \"\\t.def %s; .scl 3; .type 32; .endef\\n\", name);\r\n    fprintf(ctx->fp, \"%s:\\n\", name);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp,\r\n      \"\\n\\t.private_extern %s\\n\"\r\n      \"%s:\\n\", name, name);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n/* Emit alignment. */\r\nstatic void emit_asm_align(BuildCtx *ctx, int bits)\r\n{\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.p2align %d\\n\", bits);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp, \"\\t.align %d\\n\", bits);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Emit assembler source code. */\r\nvoid emit_asm(BuildCtx *ctx)\r\n{\r\n  int i, rel;\r\n\r\n  fprintf(ctx->fp, \"\\t.file \\\"buildvm_%s.dasc\\\"\\n\", ctx->dasm_arch);\r\n#if LJ_ARCH_PPC64\r\n  fprintf(ctx->fp, \"\\t.abiversion 2\\n\");\r\n#endif\r\n  fprintf(ctx->fp, \"\\t.text\\n\");\r\n  emit_asm_align(ctx, 4);\r\n\r\n#if LJ_TARGET_PS3\r\n  emit_asm_label(ctx, ctx->beginsym, ctx->codesz, 0);\r\n#else\r\n  emit_asm_label(ctx, ctx->beginsym, 0, 0);\r\n#endif\r\n  if (ctx->mode != BUILD_machasm)\r\n    fprintf(ctx->fp, \".Lbegin:\\n\");\r\n\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND\r\n  /* This should really be moved into buildvm_arm.dasc. */\r\n  fprintf(ctx->fp,\r\n\t  \".fnstart\\n\"\r\n\t  \".save {r4, r5, r6, r7, r8, r9, r10, r11, lr}\\n\"\r\n\t  \".pad #28\\n\");\r\n#endif\r\n#if LJ_TARGET_MIPS\r\n  fprintf(ctx->fp, \".set nomips16\\n.abicalls\\n.set noreorder\\n.set nomacro\\n\");\r\n#endif\r\n\r\n  for (i = rel = 0; i < ctx->nsym; i++) {\r\n    int32_t ofs = ctx->sym[i].ofs;\r\n    int32_t next = ctx->sym[i+1].ofs;\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND && LJ_HASFFI\r\n    if (!strcmp(ctx->sym[i].name, \"lj_vm_ffi_call\"))\r\n      fprintf(ctx->fp,\r\n\t      \".globl lj_err_unwind_arm\\n\"\r\n\t      \".personality lj_err_unwind_arm\\n\"\r\n\t      \".fnend\\n\"\r\n\t      \".fnstart\\n\"\r\n\t      \".save {r4, r5, r11, lr}\\n\"\r\n\t      \".setfp r11, sp\\n\");\r\n#endif\r\n    emit_asm_label(ctx, ctx->sym[i].name, next - ofs, 1);\r\n    while (rel < ctx->nreloc && ctx->reloc[rel].ofs <= next) {\r\n      BuildReloc *r = &ctx->reloc[rel];\r\n      int n = r->ofs - ofs;\r\n#if LJ_TARGET_X86ORX64\r\n      if (r->type != 0 &&\r\n\t  (ctx->mode == BUILD_elfasm || ctx->mode == BUILD_machasm)) {\r\n\temit_asm_reloc_text(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);\r\n      } else {\r\n\temit_asm_bytes(ctx, ctx->code+ofs, n);\r\n\temit_asm_reloc(ctx, r->type, ctx->relocsym[r->sym]);\r\n      }\r\n      ofs += n+4;\r\n#else\r\n      emit_asm_wordreloc(ctx, ctx->code+ofs, n, ctx->relocsym[r->sym]);\r\n      ofs += n;\r\n#endif\r\n      rel++;\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    emit_asm_bytes(ctx, ctx->code+ofs, next-ofs);\r\n#else\r\n    emit_asm_words(ctx, ctx->code+ofs, next-ofs);\r\n#endif\r\n  }\r\n\r\n#if LJ_TARGET_ARM && defined(__GNUC__) && !LJ_NO_UNWIND\r\n  fprintf(ctx->fp,\r\n#if !LJ_HASFFI\r\n\t  \".globl lj_err_unwind_arm\\n\"\r\n\t  \".personality lj_err_unwind_arm\\n\"\r\n#endif\r\n\t  \".fnend\\n\");\r\n#endif\r\n\r\n  fprintf(ctx->fp, \"\\n\");\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n#if !(LJ_TARGET_PS3 || LJ_TARGET_PSVITA)\r\n    fprintf(ctx->fp, \"\\t.section .note.GNU-stack,\\\"\\\",\" ELFASM_PX \"progbits\\n\");\r\n#endif\r\n#if LJ_TARGET_PPC && !LJ_TARGET_PS3\r\n    /* Hard-float ABI. */\r\n    fprintf(ctx->fp, \"\\t.gnu_attribute 4, 1\\n\");\r\n#endif\r\n    /* fallthrough */\r\n  case BUILD_coffasm:\r\n    fprintf(ctx->fp, \"\\t.ident \\\"%s\\\"\\n\", ctx->dasm_ident);\r\n    break;\r\n  case BUILD_machasm:\r\n    fprintf(ctx->fp,\r\n      \"\\t.cstring\\n\"\r\n      \"\\t.ascii \\\"%s\\\\0\\\"\\n\", ctx->dasm_ident);\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n  fprintf(ctx->fp, \"\\n\");\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm_fold.c",
    "content": "/*\r\n** LuaJIT VM builder: IR folding hash table generator.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n\r\n/* Context for the folding hash table generator. */\r\nstatic int lineno;\r\nstatic int funcidx;\r\nstatic uint32_t foldkeys[BUILD_MAX_FOLD];\r\nstatic uint32_t nkeys;\r\n\r\n/* Try to fill the hash table with keys using the hash parameters. */\r\nstatic int tryhash(uint32_t *htab, uint32_t sz, uint32_t r, int dorol)\r\n{\r\n  uint32_t i;\r\n  if (dorol && ((r & 31) == 0 || (r>>5) == 0))\r\n    return 0;  /* Avoid zero rotates. */\r\n  memset(htab, 0xff, (sz+1)*sizeof(uint32_t));\r\n  for (i = 0; i < nkeys; i++) {\r\n    uint32_t key = foldkeys[i];\r\n    uint32_t k = key & 0xffffff;\r\n    uint32_t h = (dorol ? lj_rol(lj_rol(k, r>>5) - k, r&31) :\r\n\t\t\t  (((k << (r>>5)) - k) << (r&31))) % sz;\r\n    if (htab[h] != 0xffffffff) {  /* Collision on primary slot. */\r\n      if (htab[h+1] != 0xffffffff) {  /* Collision on secondary slot. */\r\n\t/* Try to move the colliding key, if possible. */\r\n\tif (h < sz-1 && htab[h+2] == 0xffffffff) {\r\n\t  uint32_t k2 = htab[h+1] & 0xffffff;\r\n\t  uint32_t h2 = (dorol ? lj_rol(lj_rol(k2, r>>5) - k2, r&31) :\r\n\t\t\t\t (((k2 << (r>>5)) - k2) << (r&31))) % sz;\r\n\t  if (h2 != h+1) return 0;  /* Cannot resolve collision. */\r\n\t  htab[h+2] = htab[h+1];  /* Move colliding key to secondary slot. */\r\n\t} else {\r\n\t  return 0;  /* Collision. */\r\n\t}\r\n      }\r\n      htab[h+1] = key;\r\n    } else {\r\n      htab[h] = key;\r\n    }\r\n  }\r\n  return 1;  /* Success, all keys could be stored. */\r\n}\r\n\r\n/* Print the generated hash table. */\r\nstatic void printhash(BuildCtx *ctx, uint32_t *htab, uint32_t sz)\r\n{\r\n  uint32_t i;\r\n  fprintf(ctx->fp, \"static const uint32_t fold_hash[%d] = {\\n0x%08x\",\r\n\t  sz+1, htab[0]);\r\n  for (i = 1; i < sz+1; i++)\r\n    fprintf(ctx->fp, \",\\n0x%08x\", htab[i]);\r\n  fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n}\r\n\r\n/* Exhaustive search for the shortest semi-perfect hash table. */\r\nstatic void makehash(BuildCtx *ctx)\r\n{\r\n  uint32_t htab[BUILD_MAX_FOLD*2+1];\r\n  uint32_t sz, r;\r\n  /* Search for the smallest hash table with an odd size. */\r\n  for (sz = (nkeys|1); sz < BUILD_MAX_FOLD*2; sz += 2) {\r\n    /* First try all shift hash combinations. */\r\n    for (r = 0; r < 32*32; r++) {\r\n      if (tryhash(htab, sz, r, 0)) {\r\n\tprinthash(ctx, htab, sz);\r\n\tfprintf(ctx->fp,\r\n\t\t\"#define fold_hashkey(k)\\t(((((k)<<%u)-(k))<<%u)%%%u)\\n\\n\",\r\n\t\tr>>5, r&31, sz);\r\n\treturn;\r\n      }\r\n    }\r\n    /* Then try all rotate hash combinations. */\r\n    for (r = 0; r < 32*32; r++) {\r\n      if (tryhash(htab, sz, r, 1)) {\r\n\tprinthash(ctx, htab, sz);\r\n\tfprintf(ctx->fp,\r\n\t  \"#define fold_hashkey(k)\\t(lj_rol(lj_rol((k),%u)-(k),%u)%%%u)\\n\\n\",\r\n\t\tr>>5, r&31, sz);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  fprintf(stderr, \"Error: search for perfect hash failed\\n\");\r\n  exit(1);\r\n}\r\n\r\n/* Parse one token of a fold rule. */\r\nstatic uint32_t nexttoken(char **pp, int allowlit, int allowany)\r\n{\r\n  char *p = *pp;\r\n  if (p) {\r\n    uint32_t i;\r\n    char *q = strchr(p, ' ');\r\n    if (q) *q++ = '\\0';\r\n    *pp = q;\r\n    if (allowlit && !strncmp(p, \"IRFPM_\", 6)) {\r\n      for (i = 0; irfpm_names[i]; i++)\r\n\tif (!strcmp(irfpm_names[i], p+6))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRFL_\", 5)) {\r\n      for (i = 0; irfield_names[i]; i++)\r\n\tif (!strcmp(irfield_names[i], p+5))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRCALL_\", 7)) {\r\n      for (i = 0; ircall_names[i]; i++)\r\n\tif (!strcmp(ircall_names[i], p+7))\r\n\t  return i;\r\n    } else if (allowlit && !strncmp(p, \"IRCONV_\", 7)) {\r\n      for (i = 0; irt_names[i]; i++) {\r\n\tconst char *r = strchr(p+7, '_');\r\n\tif (r && !strncmp(irt_names[i], p+7, r-(p+7))) {\r\n\t  uint32_t j;\r\n\t  for (j = 0; irt_names[j]; j++)\r\n\t    if (!strcmp(irt_names[j], r+1))\r\n\t      return (i << 5) + j;\r\n\t}\r\n      }\r\n    } else if (allowlit && *p >= '0' && *p <= '9') {\r\n      for (i = 0; *p >= '0' && *p <= '9'; p++)\r\n\ti = i*10 + (*p - '0');\r\n      if (*p == '\\0')\r\n\treturn i;\r\n    } else if (allowany && !strcmp(\"any\", p)) {\r\n      return allowany;\r\n    } else {\r\n      for (i = 0; ir_names[i]; i++)\r\n\tif (!strcmp(ir_names[i], p))\r\n\t  return i;\r\n    }\r\n    fprintf(stderr, \"Error: bad fold definition token \\\"%s\\\" at line %d\\n\", p, lineno);\r\n    exit(1);\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Parse a fold rule. */\r\nstatic void foldrule(char *p)\r\n{\r\n  uint32_t op = nexttoken(&p, 0, 0);\r\n  uint32_t left = nexttoken(&p, 0, 0x7f);\r\n  uint32_t right = nexttoken(&p, 1, 0x3ff);\r\n  uint32_t key = (funcidx << 24) | (op << 17) | (left << 10) | right;\r\n  uint32_t i;\r\n  if (nkeys >= BUILD_MAX_FOLD) {\r\n    fprintf(stderr, \"Error: too many fold rules, increase BUILD_MAX_FOLD.\\n\");\r\n    exit(1);\r\n  }\r\n  /* Simple insertion sort to detect duplicates. */\r\n  for (i = nkeys; i > 0; i--) {\r\n    if ((foldkeys[i-1]&0xffffff) < (key & 0xffffff))\r\n      break;\r\n    if ((foldkeys[i-1]&0xffffff) == (key & 0xffffff)) {\r\n      fprintf(stderr, \"Error: duplicate fold definition at line %d\\n\", lineno);\r\n      exit(1);\r\n    }\r\n    foldkeys[i] = foldkeys[i-1];\r\n  }\r\n  foldkeys[i] = key;\r\n  nkeys++;\r\n}\r\n\r\n/* Emit C source code for IR folding hash table. */\r\nvoid emit_fold(BuildCtx *ctx)\r\n{\r\n  char buf[256];  /* We don't care about analyzing lines longer than that. */\r\n  const char *fname = ctx->args[0];\r\n  FILE *fp;\r\n\r\n  if (fname == NULL) {\r\n    fprintf(stderr, \"Error: missing input filename\\n\");\r\n    exit(1);\r\n  }\r\n\r\n  if (fname[0] == '-' && fname[1] == '\\0') {\r\n    fp = stdin;\r\n  } else {\r\n    fp = fopen(fname, \"r\");\r\n    if (!fp) {\r\n      fprintf(stderr, \"Error: cannot open input file '%s': %s\\n\",\r\n\t      fname, strerror(errno));\r\n      exit(1);\r\n    }\r\n  }\r\n\r\n  fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  fprintf(ctx->fp, \"static const FoldFunc fold_func[] = {\\n\");\r\n\r\n  lineno = 0;\r\n  funcidx = 0;\r\n  nkeys = 0;\r\n  while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n    lineno++;\r\n    /* The prefix must be at the start of a line, otherwise it's ignored. */\r\n    if (!strncmp(buf, FOLDDEF_PREFIX, sizeof(FOLDDEF_PREFIX)-1)) {\r\n      char *p = buf+sizeof(FOLDDEF_PREFIX)-1;\r\n      char *q = strchr(p, ')');\r\n      if (p[0] == '(' && q) {\r\n\tp++;\r\n\t*q = '\\0';\r\n\tfoldrule(p);\r\n      } else if ((p[0] == 'F' || p[0] == 'X') && p[1] == '(' && q) {\r\n\tp += 2;\r\n\t*q = '\\0';\r\n\tif (funcidx)\r\n\t  fprintf(ctx->fp, \",\\n\");\r\n\tif (p[-2] == 'X')\r\n\t  fprintf(ctx->fp, \"  %s\", p);\r\n\telse\r\n\t  fprintf(ctx->fp, \"  fold_%s\", p);\r\n\tfuncidx++;\r\n      } else {\r\n\tbuf[strlen(buf)-1] = '\\0';\r\n\tfprintf(stderr, \"Error: unknown fold definition tag %s%s at line %d\\n\",\r\n\t\tFOLDDEF_PREFIX, p, lineno);\r\n\texit(1);\r\n      }\r\n    }\r\n  }\r\n  fclose(fp);\r\n  fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n\r\n  makehash(ctx);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm_lib.c",
    "content": "/*\r\n** LuaJIT VM builder: library definition compiler.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_lib.h\"\r\n#include \"buildvm_libbc.h\"\r\n\r\n/* Context for library definitions. */\r\nstatic uint8_t obuf[8192];\r\nstatic uint8_t *optr;\r\nstatic char modname[80];\r\nstatic size_t modnamelen;\r\nstatic char funcname[80];\r\nstatic int modstate, regfunc;\r\nstatic int ffid, recffid, ffasmfunc;\r\n\r\nenum {\r\n  REGFUNC_OK,\r\n  REGFUNC_NOREG,\r\n  REGFUNC_NOREGUV\r\n};\r\n\r\nstatic void libdef_name(const char *p, int kind)\r\n{\r\n  size_t n = strlen(p);\r\n  if (kind != LIBINIT_STRING) {\r\n    if (n > modnamelen && p[modnamelen] == '_' &&\r\n\t!strncmp(p, modname, modnamelen)) {\r\n      p += modnamelen+1;\r\n      n -= modnamelen+1;\r\n    }\r\n  }\r\n  if (n > LIBINIT_MAXSTR) {\r\n    fprintf(stderr, \"Error: string too long: '%s'\\n\",  p);\r\n    exit(1);\r\n  }\r\n  if (optr+1+n+2 > obuf+sizeof(obuf)) {  /* +2 for caller. */\r\n    fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n    exit(1);\r\n  }\r\n  *optr++ = (uint8_t)(n | kind);\r\n  memcpy(optr, p, n);\r\n  optr += n;\r\n}\r\n\r\nstatic void libdef_endmodule(BuildCtx *ctx)\r\n{\r\n  if (modstate != 0) {\r\n    char line[80];\r\n    const uint8_t *p;\r\n    int n;\r\n    if (modstate == 1)\r\n      fprintf(ctx->fp, \"  (lua_CFunction)0\");\r\n    fprintf(ctx->fp, \"\\n};\\n\");\r\n    fprintf(ctx->fp, \"static const uint8_t %s%s[] = {\\n\",\r\n\t    LABEL_PREFIX_LIBINIT, modname);\r\n    line[0] = '\\0';\r\n    for (n = 0, p = obuf; p < optr; p++) {\r\n      n += sprintf(line+n, \"%d,\", *p);\r\n      if (n >= 75) {\r\n\tfprintf(ctx->fp, \"%s\\n\", line);\r\n\tn = 0;\r\n\tline[0] = '\\0';\r\n      }\r\n    }\r\n    fprintf(ctx->fp, \"%s%d\\n};\\n#endif\\n\\n\", line, LIBINIT_END);\r\n  }\r\n}\r\n\r\nstatic void libdef_module(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    libdef_endmodule(ctx);\r\n    optr = obuf;\r\n    *optr++ = (uint8_t)ffid;\r\n    *optr++ = (uint8_t)ffasmfunc;\r\n    *optr++ = 0;  /* Hash table size. */\r\n    modstate = 1;\r\n    fprintf(ctx->fp, \"#ifdef %sMODULE_%s\\n\", LIBDEF_PREFIX, p);\r\n    fprintf(ctx->fp, \"#undef %sMODULE_%s\\n\", LIBDEF_PREFIX, p);\r\n    fprintf(ctx->fp, \"static const lua_CFunction %s%s[] = {\\n\",\r\n\t    LABEL_PREFIX_LIBCF, p);\r\n  }\r\n  modnamelen = strlen(p);\r\n  if (modnamelen > sizeof(modname)-1) {\r\n    fprintf(stderr, \"Error: module name too long: '%s'\\n\", p);\r\n    exit(1);\r\n  }\r\n  strcpy(modname, p);\r\n}\r\n\r\nstatic int find_ffofs(BuildCtx *ctx, const char *name)\r\n{\r\n  int i;\r\n  for (i = 0; i < ctx->nglob; i++) {\r\n    const char *gl = ctx->globnames[i];\r\n    if (gl[0] == 'f' && gl[1] == 'f' && gl[2] == '_' && !strcmp(gl+3, name)) {\r\n      return (int)((uint8_t *)ctx->glob[i] - ctx->code);\r\n    }\r\n  }\r\n  fprintf(stderr, \"Error: undefined fast function %s%s\\n\",\r\n\t  LABEL_PREFIX_FF, name);\r\n  exit(1);\r\n}\r\n\r\nstatic void libdef_func(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  if (arg != LIBINIT_CF)\r\n    ffasmfunc++;\r\n  if (ctx->mode == BUILD_libdef) {\r\n    if (modstate == 0) {\r\n      fprintf(stderr, \"Error: no module for function definition %s\\n\", p);\r\n      exit(1);\r\n    }\r\n    if (regfunc == REGFUNC_NOREG) {\r\n      if (optr+1 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_FFID;\r\n    } else {\r\n      if (arg != LIBINIT_ASM_) {\r\n\tif (modstate != 1) fprintf(ctx->fp, \",\\n\");\r\n\tmodstate = 2;\r\n\tfprintf(ctx->fp, \"  %s%s\", arg ? LABEL_PREFIX_FFH : LABEL_PREFIX_CF, p);\r\n      }\r\n      if (regfunc != REGFUNC_NOREGUV) obuf[2]++;  /* Bump hash table size. */\r\n      libdef_name(regfunc == REGFUNC_NOREGUV ? \"\" : p, arg);\r\n    }\r\n  } else if (ctx->mode == BUILD_ffdef) {\r\n    fprintf(ctx->fp, \"FFDEF(%s)\\n\", p);\r\n  } else if (ctx->mode == BUILD_recdef) {\r\n    if (strlen(p) > sizeof(funcname)-1) {\r\n      fprintf(stderr, \"Error: function name too long: '%s'\\n\", p);\r\n      exit(1);\r\n    }\r\n    strcpy(funcname, p);\r\n  } else if (ctx->mode == BUILD_vmdef) {\r\n    int i;\r\n    for (i = 1; p[i] && modname[i-1]; i++)\r\n      if (p[i] == '_') p[i] = '.';\r\n    fprintf(ctx->fp, \"\\\"%s\\\",\\n\", p);\r\n  } else if (ctx->mode == BUILD_bcdef) {\r\n    if (arg != LIBINIT_CF)\r\n      fprintf(ctx->fp, \",\\n%d\", find_ffofs(ctx, p));\r\n  }\r\n  ffid++;\r\n  regfunc = REGFUNC_OK;\r\n}\r\n\r\nstatic uint8_t *libdef_uleb128(uint8_t *p, uint32_t *vv)\r\n{\r\n  uint32_t v = *p++;\r\n  if (v >= 0x80) {\r\n    int sh = 0; v &= 0x7f;\r\n    do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80);\r\n  }\r\n  *vv = v;\r\n  return p;\r\n}\r\n\r\nstatic void libdef_fixupbc(uint8_t *p)\r\n{\r\n  uint32_t i, sizebc;\r\n  p += 4;\r\n  p = libdef_uleb128(p, &sizebc);\r\n  p = libdef_uleb128(p, &sizebc);\r\n  p = libdef_uleb128(p, &sizebc);\r\n  for (i = 0; i < sizebc; i++, p += 4) {\r\n    uint8_t op = p[libbc_endian ? 3 : 0];\r\n    uint8_t ra = p[libbc_endian ? 2 : 1];\r\n    uint8_t rc = p[libbc_endian ? 1 : 2];\r\n    uint8_t rb = p[libbc_endian ? 0 : 3];\r\n    if (!LJ_DUALNUM && op == BC_ISTYPE && rc == ~LJ_TNUMX+1) {\r\n      op = BC_ISNUM; rc++;\r\n    }\r\n    p[LJ_ENDIAN_SELECT(0, 3)] = op;\r\n    p[LJ_ENDIAN_SELECT(1, 2)] = ra;\r\n    p[LJ_ENDIAN_SELECT(2, 1)] = rc;\r\n    p[LJ_ENDIAN_SELECT(3, 0)] = rb;\r\n  }\r\n}\r\n\r\nstatic void libdef_lua(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    int i;\r\n    for (i = 0; libbc_map[i].name != NULL; i++) {\r\n      if (!strcmp(libbc_map[i].name, p)) {\r\n\tint ofs = libbc_map[i].ofs;\r\n\tint len = libbc_map[i+1].ofs - ofs;\r\n\tobuf[2]++;  /* Bump hash table size. */\r\n\t*optr++ = LIBINIT_LUA;\r\n\tlibdef_name(p, 0);\r\n\tmemcpy(optr, libbc_code + ofs, len);\r\n\tlibdef_fixupbc(optr);\r\n\toptr += len;\r\n\treturn;\r\n      }\r\n    }\r\n    fprintf(stderr, \"Error: missing libbc definition for %s\\n\", p);\r\n    exit(1);\r\n  }\r\n}\r\n\r\nstatic uint32_t find_rec(char *name)\r\n{\r\n  char *p = (char *)obuf;\r\n  uint32_t n;\r\n  for (n = 2; *p; n++) {\r\n    if (strcmp(p, name) == 0)\r\n      return n;\r\n    p += strlen(p)+1;\r\n  }\r\n  if (p+strlen(name)+1 >= (char *)obuf+sizeof(obuf)) {\r\n    fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n    exit(1);\r\n  }\r\n  strcpy(p, name);\r\n  return n;\r\n}\r\n\r\nstatic void libdef_rec(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_recdef) {\r\n    char *q;\r\n    uint32_t n;\r\n    for (; recffid+1 < ffid; recffid++)\r\n      fprintf(ctx->fp, \",\\n0\");\r\n    recffid = ffid;\r\n    if (*p == '.') p = funcname;\r\n    q = strchr(p, ' ');\r\n    if (q) *q++ = '\\0';\r\n    n = find_rec(p);\r\n    if (q)\r\n      fprintf(ctx->fp, \",\\n0x%02x00+(%s)\", n, q);\r\n    else\r\n      fprintf(ctx->fp, \",\\n0x%02x00\", n);\r\n  }\r\n}\r\n\r\nstatic void memcpy_endian(void *dst, void *src, size_t n)\r\n{\r\n  union { uint8_t b; uint32_t u; } host_endian;\r\n  host_endian.u = 1;\r\n  if (host_endian.b == LJ_ENDIAN_SELECT(1, 0)) {\r\n    memcpy(dst, src, n);\r\n  } else {\r\n    size_t i;\r\n    for (i = 0; i < n; i++)\r\n      ((uint8_t *)dst)[i] = ((uint8_t *)src)[n-i-1];\r\n  }\r\n}\r\n\r\nstatic void libdef_push(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    int len = (int)strlen(p);\r\n    if (*p == '\"') {\r\n      if (len > 1 && p[len-1] == '\"') {\r\n\tp[len-1] = '\\0';\r\n\tlibdef_name(p+1, LIBINIT_STRING);\r\n\treturn;\r\n      }\r\n    } else if (*p >= '0' && *p <= '9') {\r\n      char *ep;\r\n      double d = strtod(p, &ep);\r\n      if (*ep == '\\0') {\r\n\tif (optr+1+sizeof(double) > obuf+sizeof(obuf)) {\r\n\t  fprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\t  exit(1);\r\n\t}\r\n\t*optr++ = LIBINIT_NUMBER;\r\n\tmemcpy_endian(optr, &d, sizeof(double));\r\n\toptr += sizeof(double);\r\n\treturn;\r\n      }\r\n    } else if (!strcmp(p, \"lastcl\")) {\r\n      if (optr+1 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_LASTCL;\r\n      return;\r\n    } else if (len > 4 && !strncmp(p, \"top-\", 4)) {\r\n      if (optr+2 > obuf+sizeof(obuf)) {\r\n\tfprintf(stderr, \"Error: output buffer overflow\\n\");\r\n\texit(1);\r\n      }\r\n      *optr++ = LIBINIT_COPY;\r\n      *optr++ = (uint8_t)atoi(p+4);\r\n      return;\r\n    }\r\n    fprintf(stderr, \"Error: bad value for %sPUSH(%s)\\n\", LIBDEF_PREFIX, p);\r\n    exit(1);\r\n  }\r\n}\r\n\r\nstatic void libdef_set(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(arg);\r\n  if (ctx->mode == BUILD_libdef) {\r\n    if (p[0] == '!' && p[1] == '\\0') p[0] = '\\0';  /* Set env. */\r\n    libdef_name(p, LIBINIT_STRING);\r\n    *optr++ = LIBINIT_SET;\r\n    obuf[2]++;  /* Bump hash table size. */\r\n  }\r\n}\r\n\r\nstatic void libdef_regfunc(BuildCtx *ctx, char *p, int arg)\r\n{\r\n  UNUSED(ctx); UNUSED(p);\r\n  regfunc = arg;\r\n}\r\n\r\ntypedef void (*LibDefFunc)(BuildCtx *ctx, char *p, int arg);\r\n\r\ntypedef struct LibDefHandler {\r\n  const char *suffix;\r\n  const char *stop;\r\n  const LibDefFunc func;\r\n  const int arg;\r\n} LibDefHandler;\r\n\r\nstatic const LibDefHandler libdef_handlers[] = {\r\n  { \"MODULE_\",\t\" \\t\\r\\n\",\tlibdef_module,\t\t0 },\r\n  { \"CF(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_CF },\r\n  { \"ASM(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_ASM },\r\n  { \"ASM_(\",\t\")\",\t\tlibdef_func,\t\tLIBINIT_ASM_ },\r\n  { \"LUA(\",\t\")\",\t\tlibdef_lua,\t\t0 },\r\n  { \"REC(\",\t\")\",\t\tlibdef_rec,\t\t0 },\r\n  { \"PUSH(\",\t\")\",\t\tlibdef_push,\t\t0 },\r\n  { \"SET(\",\t\")\",\t\tlibdef_set,\t\t0 },\r\n  { \"NOREGUV\",\tNULL,\t\tlibdef_regfunc,\t\tREGFUNC_NOREGUV },\r\n  { \"NOREG\",\tNULL,\t\tlibdef_regfunc,\t\tREGFUNC_NOREG },\r\n  { NULL,\tNULL,\t\t(LibDefFunc)0,\t\t0 }\r\n};\r\n\r\n/* Emit C source code for library function definitions. */\r\nvoid emit_lib(BuildCtx *ctx)\r\n{\r\n  const char *fname;\r\n\r\n  if (ctx->mode == BUILD_ffdef || ctx->mode == BUILD_libdef ||\r\n      ctx->mode == BUILD_recdef)\r\n    fprintf(ctx->fp, \"/* This is a generated file. DO NOT EDIT! */\\n\\n\");\r\n  else if (ctx->mode == BUILD_vmdef)\r\n    fprintf(ctx->fp, \"ffnames = {\\n[0]=\\\"Lua\\\",\\n\\\"C\\\",\\n\");\r\n  if (ctx->mode == BUILD_recdef)\r\n    fprintf(ctx->fp, \"static const uint16_t recff_idmap[] = {\\n0,\\n0x0100\");\r\n  recffid = ffid = FF_C+1;\r\n  ffasmfunc = 0;\r\n\r\n  while ((fname = *ctx->args++)) {\r\n    char buf[256];  /* We don't care about analyzing lines longer than that. */\r\n    FILE *fp;\r\n    if (fname[0] == '-' && fname[1] == '\\0') {\r\n      fp = stdin;\r\n    } else {\r\n      fp = fopen(fname, \"r\");\r\n      if (!fp) {\r\n\tfprintf(stderr, \"Error: cannot open input file '%s': %s\\n\",\r\n\t\tfname, strerror(errno));\r\n\texit(1);\r\n      }\r\n    }\r\n    modstate = 0;\r\n    regfunc = REGFUNC_OK;\r\n    while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n      char *p;\r\n      /* Simplistic pre-processor. Only handles top-level #if/#endif. */\r\n      if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {\r\n\tint ok = 1;\r\n\tif (!strcmp(buf, \"#if LJ_52\\n\"))\r\n\t  ok = LJ_52;\r\n\telse if (!strcmp(buf, \"#if LJ_HASJIT\\n\"))\r\n\t  ok = LJ_HASJIT;\r\n\telse if (!strcmp(buf, \"#if LJ_HASFFI\\n\"))\r\n\t  ok = LJ_HASFFI;\r\n\tif (!ok) {\r\n\t  int lvl = 1;\r\n\t  while (fgets(buf, sizeof(buf), fp) != NULL) {\r\n\t    if (buf[0] == '#' && buf[1] == 'e' && buf[2] == 'n') {\r\n\t      if (--lvl == 0) break;\r\n\t    } else if (buf[0] == '#' && buf[1] == 'i' && buf[2] == 'f') {\r\n\t      lvl++;\r\n\t    }\r\n\t  }\r\n\t  continue;\r\n\t}\r\n      }\r\n      for (p = buf; (p = strstr(p, LIBDEF_PREFIX)) != NULL; ) {\r\n\tconst LibDefHandler *ldh;\r\n\tp += sizeof(LIBDEF_PREFIX)-1;\r\n\tfor (ldh = libdef_handlers; ldh->suffix != NULL; ldh++) {\r\n\t  size_t n, len = strlen(ldh->suffix);\r\n\t  if (!strncmp(p, ldh->suffix, len)) {\r\n\t    p += len;\r\n\t    n = ldh->stop ? strcspn(p, ldh->stop) : 0;\r\n\t    if (!p[n]) break;\r\n\t    p[n] = '\\0';\r\n\t    ldh->func(ctx, p, ldh->arg);\r\n\t    p += n+1;\r\n\t    break;\r\n\t  }\r\n\t}\r\n\tif (ldh->suffix == NULL) {\r\n\t  buf[strlen(buf)-1] = '\\0';\r\n\t  fprintf(stderr, \"Error: unknown library definition tag %s%s\\n\",\r\n\t\t  LIBDEF_PREFIX, p);\r\n\t  exit(1);\r\n\t}\r\n      }\r\n    }\r\n    fclose(fp);\r\n    if (ctx->mode == BUILD_libdef) {\r\n      libdef_endmodule(ctx);\r\n    }\r\n  }\r\n\r\n  if (ctx->mode == BUILD_ffdef) {\r\n    fprintf(ctx->fp, \"\\n#undef FFDEF\\n\\n\");\r\n    fprintf(ctx->fp,\r\n      \"#ifndef FF_NUM_ASMFUNC\\n#define FF_NUM_ASMFUNC %d\\n#endif\\n\\n\",\r\n      ffasmfunc);\r\n  } else if (ctx->mode == BUILD_vmdef) {\r\n    fprintf(ctx->fp, \"},\\n\\n\");\r\n  } else if (ctx->mode == BUILD_bcdef) {\r\n    int i;\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n    fprintf(ctx->fp, \"LJ_DATADEF const uint16_t lj_bc_mode[] = {\\n\");\r\n    fprintf(ctx->fp, \"BCDEF(BCMODE)\\n\");\r\n    for (i = ffasmfunc-1; i > 0; i--)\r\n      fprintf(ctx->fp, \"BCMODE_FF,\\n\");\r\n    fprintf(ctx->fp, \"BCMODE_FF\\n};\\n\\n\");\r\n  } else if (ctx->mode == BUILD_recdef) {\r\n    char *p = (char *)obuf;\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n    fprintf(ctx->fp, \"static const RecordFunc recff_func[] = {\\n\"\r\n\t    \"recff_nyi,\\n\"\r\n\t    \"recff_c\");\r\n    while (*p) {\r\n      fprintf(ctx->fp, \",\\nrecff_%s\", p);\r\n      p += strlen(p)+1;\r\n    }\r\n    fprintf(ctx->fp, \"\\n};\\n\\n\");\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm_libbc.h",
    "content": "/* This is a generated file. DO NOT EDIT! */\r\n\r\nstatic const int libbc_endian = 0;\r\n\r\nstatic const uint8_t libbc_code[] = {\r\n#if LJ_FR2\r\n0,1,2,0,0,1,2,24,1,0,0,76,1,2,0,241,135,158,166,3,220,203,178,130,4,0,1,2,0,\r\n0,1,2,24,1,0,0,76,1,2,0,243,244,148,165,20,198,190,199,252,3,0,1,2,0,0,0,3,\r\n16,0,5,0,21,1,0,0,76,1,2,0,0,2,10,0,0,0,15,16,0,12,0,16,1,9,0,41,2,1,0,21,3,\r\n0,0,41,4,1,0,77,2,8,128,18,6,1,0,18,8,5,0,59,9,5,0,66,6,3,2,10,6,0,0,88,7,1,\r\n128,76,6,2,0,79,2,248,127,75,0,1,0,0,2,11,0,0,0,16,16,0,12,0,16,1,9,0,43,2,\r\n0,0,18,3,0,0,41,4,0,0,88,5,7,128,18,7,1,0,18,9,5,0,18,10,6,0,66,7,3,2,10,7,\r\n0,0,88,8,1,128,76,7,2,0,70,5,3,3,82,5,247,127,75,0,1,0,0,1,2,0,0,0,3,16,0,12,\r\n0,21,1,0,0,76,1,2,0,0,2,10,0,0,2,30,16,0,12,0,21,2,0,0,11,1,0,0,88,3,7,128,\r\n8,2,0,0,88,3,23,128,59,3,2,0,43,4,0,0,64,4,2,0,76,3,2,0,88,3,18,128,16,1,14,\r\n0,41,3,1,0,3,3,1,0,88,3,14,128,3,1,2,0,88,3,12,128,59,3,1,0,22,4,1,1,18,5,2,\r\n0,41,6,1,0,77,4,4,128,23,8,1,7,59,9,7,0,64,9,8,0,79,4,252,127,43,4,0,0,64,4,\r\n2,0,76,3,2,0,75,0,1,0,0,2,0\r\n#else\r\n0,1,2,0,0,1,2,24,1,0,0,76,1,2,0,241,135,158,166,3,220,203,178,130,4,0,1,2,0,\r\n0,1,2,24,1,0,0,76,1,2,0,243,244,148,165,20,198,190,199,252,3,0,1,2,0,0,0,3,\r\n16,0,5,0,21,1,0,0,76,1,2,0,0,2,9,0,0,0,15,16,0,12,0,16,1,9,0,41,2,1,0,21,3,\r\n0,0,41,4,1,0,77,2,8,128,18,6,1,0,18,7,5,0,59,8,5,0,66,6,3,2,10,6,0,0,88,7,1,\r\n128,76,6,2,0,79,2,248,127,75,0,1,0,0,2,10,0,0,0,16,16,0,12,0,16,1,9,0,43,2,\r\n0,0,18,3,0,0,41,4,0,0,88,5,7,128,18,7,1,0,18,8,5,0,18,9,6,0,66,7,3,2,10,7,0,\r\n0,88,8,1,128,76,7,2,0,70,5,3,3,82,5,247,127,75,0,1,0,0,1,2,0,0,0,3,16,0,12,\r\n0,21,1,0,0,76,1,2,0,0,2,10,0,0,2,30,16,0,12,0,21,2,0,0,11,1,0,0,88,3,7,128,\r\n8,2,0,0,88,3,23,128,59,3,2,0,43,4,0,0,64,4,2,0,76,3,2,0,88,3,18,128,16,1,14,\r\n0,41,3,1,0,3,3,1,0,88,3,14,128,3,1,2,0,88,3,12,128,59,3,1,0,22,4,1,1,18,5,2,\r\n0,41,6,1,0,77,4,4,128,23,8,1,7,59,9,7,0,64,9,8,0,79,4,252,127,43,4,0,0,64,4,\r\n2,0,76,3,2,0,75,0,1,0,0,2,0\r\n#endif\r\n};\r\n\r\nstatic const struct { const char *name; int ofs; } libbc_map[] = {\r\n{\"math_deg\",0},\r\n{\"math_rad\",25},\r\n{\"string_len\",50},\r\n{\"table_foreachi\",69},\r\n{\"table_foreach\",136},\r\n{\"table_getn\",207},\r\n{\"table_remove\",226},\r\n{NULL,355}\r\n};\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/buildvm_peobj.c",
    "content": "/*\r\n** LuaJIT VM builder: PE object emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Only used for building on Windows, since we cannot assume the presence\r\n** of a suitable assembler. The host and target byte order must match.\r\n*/\r\n\r\n#include \"buildvm.h\"\r\n#include \"lj_bc.h\"\r\n\r\n#if LJ_TARGET_X86ORX64 || LJ_TARGET_PPC\r\n\r\n/* Context for PE object emitter. */\r\nstatic char *strtab;\r\nstatic size_t strtabofs;\r\n\r\n/* -- PE object definitions ----------------------------------------------- */\r\n\r\n/* PE header. */\r\ntypedef struct PEheader {\r\n  uint16_t arch;\r\n  uint16_t nsects;\r\n  uint32_t time;\r\n  uint32_t symtabofs;\r\n  uint32_t nsyms;\r\n  uint16_t opthdrsz;\r\n  uint16_t flags;\r\n} PEheader;\r\n\r\n/* PE section. */\r\ntypedef struct PEsection {\r\n  char name[8];\r\n  uint32_t vsize;\r\n  uint32_t vaddr;\r\n  uint32_t size;\r\n  uint32_t ofs;\r\n  uint32_t relocofs;\r\n  uint32_t lineofs;\r\n  uint16_t nreloc;\r\n  uint16_t nline;\r\n  uint32_t flags;\r\n} PEsection;\r\n\r\n/* PE relocation. */\r\ntypedef struct PEreloc {\r\n  uint32_t vaddr;\r\n  uint32_t symidx;\r\n  uint16_t type;\r\n} PEreloc;\r\n\r\n/* Cannot use sizeof, because it pads up to the max. alignment. */\r\n#define PEOBJ_RELOC_SIZE\t(4+4+2)\r\n\r\n/* PE symbol table entry. */\r\ntypedef struct PEsym {\r\n  union {\r\n    char name[8];\r\n    uint32_t nameref[2];\r\n  } n;\r\n  uint32_t value;\r\n  int16_t sect;\r\n  uint16_t type;\r\n  uint8_t scl;\r\n  uint8_t naux;\r\n} PEsym;\r\n\r\n/* PE symbol table auxiliary entry for a section. */\r\ntypedef struct PEsymaux {\r\n  uint32_t size;\r\n  uint16_t nreloc;\r\n  uint16_t nline;\r\n  uint32_t cksum;\r\n  uint16_t assoc;\r\n  uint8_t comdatsel;\r\n  uint8_t unused[3];\r\n} PEsymaux;\r\n\r\n/* Cannot use sizeof, because it pads up to the max. alignment. */\r\n#define PEOBJ_SYM_SIZE\t(8+4+2+2+1+1)\r\n\r\n/* PE object CPU specific defines. */\r\n#if LJ_TARGET_X86\r\n#define PEOBJ_ARCH_TARGET\t0x014c\r\n#define PEOBJ_RELOC_REL32\t0x14  /* MS: REL32, GNU: DISP32. */\r\n#define PEOBJ_RELOC_DIR32\t0x06\r\n#define PEOBJ_RELOC_OFS\t\t0\r\n#define PEOBJ_TEXT_FLAGS\t0x60500020  /* 60=r+x, 50=align16, 20=code. */\r\n#elif LJ_TARGET_X64\r\n#define PEOBJ_ARCH_TARGET\t0x8664\r\n#define PEOBJ_RELOC_REL32\t0x04  /* MS: REL32, GNU: DISP32. */\r\n#define PEOBJ_RELOC_DIR32\t0x02\r\n#define PEOBJ_RELOC_ADDR32NB\t0x03\r\n#define PEOBJ_RELOC_OFS\t\t0\r\n#define PEOBJ_TEXT_FLAGS\t0x60500020  /* 60=r+x, 50=align16, 20=code. */\r\n#elif LJ_TARGET_PPC\r\n#define PEOBJ_ARCH_TARGET\t0x01f2\r\n#define PEOBJ_RELOC_REL32\t0x06\r\n#define PEOBJ_RELOC_DIR32\t0x02\r\n#define PEOBJ_RELOC_OFS\t\t(-4)\r\n#define PEOBJ_TEXT_FLAGS\t0x60400020  /* 60=r+x, 40=align8, 20=code. */\r\n#endif\r\n\r\n/* Section numbers (0-based). */\r\nenum {\r\n  PEOBJ_SECT_ABS = -2,\r\n  PEOBJ_SECT_UNDEF = -1,\r\n  PEOBJ_SECT_TEXT,\r\n#if LJ_TARGET_X64\r\n  PEOBJ_SECT_PDATA,\r\n  PEOBJ_SECT_XDATA,\r\n#endif\r\n  PEOBJ_SECT_RDATA_Z,\r\n  PEOBJ_NSECTIONS\r\n};\r\n\r\n/* Symbol types. */\r\n#define PEOBJ_TYPE_NULL\t\t0\r\n#define PEOBJ_TYPE_FUNC\t\t0x20\r\n\r\n/* Symbol storage class. */\r\n#define PEOBJ_SCL_EXTERN\t2\r\n#define PEOBJ_SCL_STATIC\t3\r\n\r\n/* -- PE object emitter --------------------------------------------------- */\r\n\r\n/* Emit PE object symbol. */\r\nstatic void emit_peobj_sym(BuildCtx *ctx, const char *name, uint32_t value,\r\n\t\t\t   int sect, int type, int scl)\r\n{\r\n  PEsym sym;\r\n  size_t len = strlen(name);\r\n  if (!strtab) {  /* Pass 1: only calculate string table length. */\r\n    if (len > 8) strtabofs += len+1;\r\n    return;\r\n  }\r\n  if (len <= 8) {\r\n    memcpy(sym.n.name, name, len);\r\n    memset(sym.n.name+len, 0, 8-len);\r\n  } else {\r\n    sym.n.nameref[0] = 0;\r\n    sym.n.nameref[1] = (uint32_t)strtabofs;\r\n    memcpy(strtab + strtabofs, name, len);\r\n    strtab[strtabofs+len] = 0;\r\n    strtabofs += len+1;\r\n  }\r\n  sym.value = value;\r\n  sym.sect = (int16_t)(sect+1);  /* 1-based section number. */\r\n  sym.type = (uint16_t)type;\r\n  sym.scl = (uint8_t)scl;\r\n  sym.naux = 0;\r\n  owrite(ctx, &sym, PEOBJ_SYM_SIZE);\r\n}\r\n\r\n/* Emit PE object section symbol. */\r\nstatic void emit_peobj_sym_sect(BuildCtx *ctx, PEsection *pesect, int sect)\r\n{\r\n  PEsym sym;\r\n  PEsymaux aux;\r\n  if (!strtab) return;  /* Pass 1: no output. */\r\n  memcpy(sym.n.name, pesect[sect].name, 8);\r\n  sym.value = 0;\r\n  sym.sect = (int16_t)(sect+1);  /* 1-based section number. */\r\n  sym.type = PEOBJ_TYPE_NULL;\r\n  sym.scl = PEOBJ_SCL_STATIC;\r\n  sym.naux = 1;\r\n  owrite(ctx, &sym, PEOBJ_SYM_SIZE);\r\n  memset(&aux, 0, sizeof(PEsymaux));\r\n  aux.size = pesect[sect].size;\r\n  aux.nreloc = pesect[sect].nreloc;\r\n  owrite(ctx, &aux, PEOBJ_SYM_SIZE);\r\n}\r\n\r\n/* Emit Windows PE object file. */\r\nvoid emit_peobj(BuildCtx *ctx)\r\n{\r\n  PEheader pehdr;\r\n  PEsection pesect[PEOBJ_NSECTIONS];\r\n  uint32_t sofs;\r\n  int i, nrsym;\r\n  union { uint8_t b; uint32_t u; } host_endian;\r\n\r\n  sofs = sizeof(PEheader) + PEOBJ_NSECTIONS*sizeof(PEsection);\r\n\r\n  /* Fill in PE sections. */\r\n  memset(&pesect, 0, PEOBJ_NSECTIONS*sizeof(PEsection));\r\n  memcpy(pesect[PEOBJ_SECT_TEXT].name, \".text\", sizeof(\".text\")-1);\r\n  pesect[PEOBJ_SECT_TEXT].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_TEXT].size = (uint32_t)ctx->codesz);\r\n  pesect[PEOBJ_SECT_TEXT].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_TEXT].nreloc = (uint16_t)ctx->nreloc) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 60 = read+execute, 50 = align16, 20 = code. */\r\n  pesect[PEOBJ_SECT_TEXT].flags = PEOBJ_TEXT_FLAGS;\r\n\r\n#if LJ_TARGET_X64\r\n  memcpy(pesect[PEOBJ_SECT_PDATA].name, \".pdata\", sizeof(\".pdata\")-1);\r\n  pesect[PEOBJ_SECT_PDATA].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_PDATA].size = 6*4);\r\n  pesect[PEOBJ_SECT_PDATA].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_PDATA].nreloc = 6) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_PDATA].flags = 0x40300040;\r\n\r\n  memcpy(pesect[PEOBJ_SECT_XDATA].name, \".xdata\", sizeof(\".xdata\")-1);\r\n  pesect[PEOBJ_SECT_XDATA].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_XDATA].size = 8*2+4+6*2);  /* See below. */\r\n  pesect[PEOBJ_SECT_XDATA].relocofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_XDATA].nreloc = 1) * PEOBJ_RELOC_SIZE;\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_XDATA].flags = 0x40300040;\r\n#endif\r\n\r\n  memcpy(pesect[PEOBJ_SECT_RDATA_Z].name, \".rdata$Z\", sizeof(\".rdata$Z\")-1);\r\n  pesect[PEOBJ_SECT_RDATA_Z].ofs = sofs;\r\n  sofs += (pesect[PEOBJ_SECT_RDATA_Z].size = (uint32_t)strlen(ctx->dasm_ident)+1);\r\n  /* Flags: 40 = read, 30 = align4, 40 = initialized data. */\r\n  pesect[PEOBJ_SECT_RDATA_Z].flags = 0x40300040;\r\n\r\n  /* Fill in PE header. */\r\n  pehdr.arch = PEOBJ_ARCH_TARGET;\r\n  pehdr.nsects = PEOBJ_NSECTIONS;\r\n  pehdr.time = 0;  /* Timestamp is optional. */\r\n  pehdr.symtabofs = sofs;\r\n  pehdr.opthdrsz = 0;\r\n  pehdr.flags = 0;\r\n\r\n  /* Compute the size of the symbol table:\r\n  ** @feat.00 + nsections*2\r\n  ** + asm_start + nsym\r\n  ** + nrsym\r\n  */\r\n  nrsym = ctx->nrelocsym;\r\n  pehdr.nsyms = 1+PEOBJ_NSECTIONS*2 + 1+ctx->nsym + nrsym;\r\n#if LJ_TARGET_X64\r\n  pehdr.nsyms += 1;  /* Symbol for lj_err_unwind_win64. */\r\n#endif\r\n\r\n  /* Write PE object header and all sections. */\r\n  owrite(ctx, &pehdr, sizeof(PEheader));\r\n  owrite(ctx, &pesect, sizeof(PEsection)*PEOBJ_NSECTIONS);\r\n\r\n  /* Write .text section. */\r\n  host_endian.u = 1;\r\n  if (host_endian.b != LJ_ENDIAN_SELECT(1, 0)) {\r\n#if LJ_TARGET_PPC\r\n    uint32_t *p = (uint32_t *)ctx->code;\r\n    int n = (int)(ctx->codesz >> 2);\r\n    for (i = 0; i < n; i++, p++)\r\n      *p = lj_bswap(*p);  /* Byteswap .text section. */\r\n#else\r\n    fprintf(stderr, \"Error: different byte order for host and target\\n\");\r\n    exit(1);\r\n#endif\r\n  }\r\n  owrite(ctx, ctx->code, ctx->codesz);\r\n  for (i = 0; i < ctx->nreloc; i++) {\r\n    PEreloc reloc;\r\n    reloc.vaddr = (uint32_t)ctx->reloc[i].ofs + PEOBJ_RELOC_OFS;\r\n    reloc.symidx = 1+2+ctx->reloc[i].sym;  /* Reloc syms are after .text sym. */\r\n    reloc.type = ctx->reloc[i].type ? PEOBJ_RELOC_REL32 : PEOBJ_RELOC_DIR32;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n\r\n#if LJ_TARGET_X64\r\n  { /* Write .pdata section. */\r\n    uint32_t fcofs = (uint32_t)ctx->sym[ctx->nsym-1].ofs;\r\n    uint32_t pdata[3];  /* Start of .text, end of .text and .xdata. */\r\n    PEreloc reloc;\r\n    pdata[0] = 0; pdata[1] = fcofs; pdata[2] = 0;\r\n    owrite(ctx, &pdata, sizeof(pdata));\r\n    pdata[0] = fcofs; pdata[1] = (uint32_t)ctx->codesz; pdata[2] = 20;\r\n    owrite(ctx, &pdata, sizeof(pdata));\r\n    reloc.vaddr = 0; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 4; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 8; reloc.symidx = 1+2+nrsym+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 12; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 16; reloc.symidx = 1+2+nrsym+2+2+1;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n    reloc.vaddr = 20; reloc.symidx = 1+2+nrsym+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n  { /* Write .xdata section. */\r\n    uint16_t xdata[8+2+6];\r\n    PEreloc reloc;\r\n    xdata[0] = 0x01|0x08|0x10;  /* Ver. 1, uhandler/ehandler, prolog size 0. */\r\n    xdata[1] = 0x0005;  /* Number of unwind codes, no frame pointer. */\r\n    xdata[2] = 0x4200;  /* Stack offset 4*8+8 = aword*5. */\r\n    xdata[3] = 0x3000;  /* Push rbx. */\r\n    xdata[4] = 0x6000;  /* Push rsi. */\r\n    xdata[5] = 0x7000;  /* Push rdi. */\r\n    xdata[6] = 0x5000;  /* Push rbp. */\r\n    xdata[7] = 0;  /* Alignment. */\r\n    xdata[8] = xdata[9] = 0;  /* Relocated address of exception handler. */\r\n    xdata[10] = 0x01;  /* Ver. 1, no handler, prolog size 0. */\r\n    xdata[11] = 0x1504;  /* Number of unwind codes, fp = rbp, fpofs = 16. */\r\n    xdata[12] = 0x0300;  /* set_fpreg. */\r\n    xdata[13] = 0x0200;  /* stack offset 0*8+8 = aword*1. */\r\n    xdata[14] = 0x3000;  /* Push rbx. */\r\n    xdata[15] = 0x5000;  /* Push rbp. */\r\n    owrite(ctx, &xdata, sizeof(xdata));\r\n    reloc.vaddr = 2*8; reloc.symidx = 1+2+nrsym+2+2;\r\n    reloc.type = PEOBJ_RELOC_ADDR32NB;\r\n    owrite(ctx, &reloc, PEOBJ_RELOC_SIZE);\r\n  }\r\n#endif\r\n\r\n  /* Write .rdata$Z section. */\r\n  owrite(ctx, ctx->dasm_ident, strlen(ctx->dasm_ident)+1);\r\n\r\n  /* Write symbol table. */\r\n  strtab = NULL;  /* 1st pass: collect string sizes. */\r\n  for (;;) {\r\n    strtabofs = 4;\r\n    /* Mark as SafeSEH compliant. */\r\n    emit_peobj_sym(ctx, \"@feat.00\", 1,\r\n\t\t   PEOBJ_SECT_ABS, PEOBJ_TYPE_NULL, PEOBJ_SCL_STATIC);\r\n\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_TEXT);\r\n    for (i = 0; i < nrsym; i++)\r\n      emit_peobj_sym(ctx, ctx->relocsym[i], 0,\r\n\t\t     PEOBJ_SECT_UNDEF, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n\r\n#if LJ_TARGET_X64\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_PDATA);\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_XDATA);\r\n    emit_peobj_sym(ctx, \"lj_err_unwind_win64\", 0,\r\n\t\t   PEOBJ_SECT_UNDEF, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n#endif\r\n\r\n    emit_peobj_sym(ctx, ctx->beginsym, 0,\r\n\t\t   PEOBJ_SECT_TEXT, PEOBJ_TYPE_NULL, PEOBJ_SCL_EXTERN);\r\n    for (i = 0; i < ctx->nsym; i++)\r\n      emit_peobj_sym(ctx, ctx->sym[i].name, (uint32_t)ctx->sym[i].ofs,\r\n\t\t     PEOBJ_SECT_TEXT, PEOBJ_TYPE_FUNC, PEOBJ_SCL_EXTERN);\r\n\r\n    emit_peobj_sym_sect(ctx, pesect, PEOBJ_SECT_RDATA_Z);\r\n\r\n    if (strtab)\r\n      break;\r\n    /* 2nd pass: alloc strtab, write syms and copy strings. */\r\n    strtab = (char *)malloc(strtabofs);\r\n    *(uint32_t *)strtab = (uint32_t)strtabofs;\r\n  }\r\n\r\n  /* Write string table. */\r\n  owrite(ctx, strtab, strtabofs);\r\n}\r\n\r\n#else\r\n\r\nvoid emit_peobj(BuildCtx *ctx)\r\n{\r\n  UNUSED(ctx);\r\n  fprintf(stderr, \"Error: no PE object support for this target\\n\");\r\n  exit(1);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/genlibbc.lua",
    "content": "----------------------------------------------------------------------------\r\n-- Lua script to dump the bytecode of the library functions written in Lua.\r\n-- The resulting 'buildvm_libbc.h' is used for the build process of LuaJIT.\r\n----------------------------------------------------------------------------\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n\r\nlocal ffi = require(\"ffi\")\r\nlocal bit = require(\"bit\")\r\nlocal vmdef = require(\"jit.vmdef\")\r\nlocal bcnames = vmdef.bcnames\r\n\r\nlocal format = string.format\r\n\r\nlocal isbe = (string.byte(string.dump(function() end), 5) % 2 == 1)\r\n\r\nlocal function usage(arg)\r\n  io.stderr:write(\"Usage: \", arg and arg[0] or \"genlibbc\",\r\n\t\t  \" [-o buildvm_libbc.h] lib_*.c\\n\")\r\n  os.exit(1)\r\nend\r\n\r\nlocal function parse_arg(arg)\r\n  local outfile = \"-\"\r\n  if not (arg and arg[1]) then\r\n    usage(arg)\r\n  end\r\n  if arg[1] == \"-o\" then\r\n    outfile = arg[2]\r\n    if not outfile then usage(arg) end\r\n    table.remove(arg, 1)\r\n    table.remove(arg, 1)\r\n  end\r\n  return outfile\r\nend\r\n\r\nlocal function read_files(names)\r\n  local src = \"\"\r\n  for _,name in ipairs(names) do\r\n    local fp = assert(io.open(name))\r\n    src = src .. fp:read(\"*a\")\r\n    fp:close()\r\n  end\r\n  return src\r\nend\r\n\r\nlocal function transform_lua(code)\r\n  local fixup = {}\r\n  local n = -30000\r\n  code = string.gsub(code, \"CHECK_(%w*)%((.-)%)\", function(tp, var)\r\n    n = n + 1\r\n    fixup[n] = { \"CHECK\", tp }\r\n    return format(\"%s=%d\", var, n)\r\n  end)\r\n  code = string.gsub(code, \"PAIRS%((.-)%)\", function(var)\r\n    fixup.PAIRS = true\r\n    return format(\"nil, %s, 0\", var)\r\n  end)\r\n  return \"return \"..code, fixup\r\nend\r\n\r\nlocal function read_uleb128(p)\r\n  local v = p[0]; p = p + 1\r\n  if v >= 128 then\r\n    local sh = 7; v = v - 128\r\n    repeat\r\n      local r = p[0]\r\n      v = v + bit.lshift(bit.band(r, 127), sh)\r\n      sh = sh + 7\r\n      p = p + 1\r\n    until r < 128\r\n  end\r\n  return p, v\r\nend\r\n\r\n-- ORDER LJ_T\r\nlocal name2itype = {\r\n  str = 5, func = 9, tab = 12, int = 14, num = 15\r\n}\r\n\r\nlocal BC = {}\r\nfor i=0,#bcnames/6-1 do\r\n  BC[string.gsub(string.sub(bcnames, i*6+1, i*6+6), \" \", \"\")] = i\r\nend\r\nlocal xop, xra = isbe and 3 or 0, isbe and 2 or 1\r\nlocal xrc, xrb = isbe and 1 or 2, isbe and 0 or 3\r\n\r\nlocal function fixup_dump(dump, fixup)\r\n  local buf = ffi.new(\"uint8_t[?]\", #dump+1, dump)\r\n  local p = buf+5\r\n  local n, sizebc\r\n  p, n = read_uleb128(p)\r\n  local start = p\r\n  p = p + 4\r\n  p = read_uleb128(p)\r\n  p = read_uleb128(p)\r\n  p, sizebc = read_uleb128(p)\r\n  local rawtab = {}\r\n  for i=0,sizebc-1 do\r\n    local op = p[xop]\r\n    if op == BC.KSHORT then\r\n      local rd = p[xrc] + 256*p[xrb]\r\n      rd = bit.arshift(bit.lshift(rd, 16), 16)\r\n      local f = fixup[rd]\r\n      if f then\r\n\tif f[1] == \"CHECK\" then\r\n\t  local tp = f[2]\r\n\t  if tp == \"tab\" then rawtab[p[xra]] = true end\r\n\t  p[xop] = tp == \"num\" and BC.ISNUM or BC.ISTYPE\r\n\t  p[xrb] = 0\r\n\t  p[xrc] = name2itype[tp]\r\n\telse\r\n\t  error(\"unhandled fixup type: \"..f[1])\r\n\tend\r\n      end\r\n    elseif op == BC.TGETV then\r\n      if rawtab[p[xrb]] then\r\n\tp[xop] = BC.TGETR\r\n      end\r\n    elseif op == BC.TSETV then\r\n      if rawtab[p[xrb]] then\r\n\tp[xop] = BC.TSETR\r\n      end\r\n    elseif op == BC.ITERC then\r\n      if fixup.PAIRS then\r\n\tp[xop] = BC.ITERN\r\n      end\r\n    end\r\n    p = p + 4\r\n  end\r\n  return ffi.string(start, n)\r\nend\r\n\r\nlocal function find_defs(src)\r\n  local defs = {}\r\n  for name, code in string.gmatch(src, \"LJLIB_LUA%(([^)]*)%)%s*/%*(.-)%*/\") do\r\n    local env = {}\r\n    local tcode, fixup = transform_lua(code)\r\n    local func = assert(load(tcode, \"\", nil, env))()\r\n    defs[name] = fixup_dump(string.dump(func, true), fixup)\r\n    defs[#defs+1] = name\r\n  end\r\n  return defs\r\nend\r\n\r\nlocal function gen_header(defs)\r\n  local t = {}\r\n  local function w(x) t[#t+1] = x end\r\n  w(\"/* This is a generated file. DO NOT EDIT! */\\n\\n\")\r\n  w(\"static const int libbc_endian = \") w(isbe and 1 or 0) w(\";\\n\\n\")\r\n  local s = \"\"\r\n  for _,name in ipairs(defs) do\r\n    s = s .. defs[name]\r\n  end\r\n  w(\"static const uint8_t libbc_code[] = {\\n\")\r\n  local n = 0\r\n  for i=1,#s do\r\n    local x = string.byte(s, i)\r\n    w(x); w(\",\")\r\n    n = n + (x < 10 and 2 or (x < 100 and 3 or 4))\r\n    if n >= 75 then n = 0; w(\"\\n\") end\r\n  end\r\n  w(\"0\\n};\\n\\n\")\r\n  w(\"static const struct { const char *name; int ofs; } libbc_map[] = {\\n\")\r\n  local m = 0\r\n  for _,name in ipairs(defs) do\r\n    w('{\"'); w(name); w('\",'); w(m) w('},\\n')\r\n    m = m + #defs[name]\r\n  end\r\n  w(\"{NULL,\"); w(m); w(\"}\\n};\\n\\n\")\r\n  return table.concat(t)\r\nend\r\n\r\nlocal function write_file(name, data)\r\n  if name == \"-\" then\r\n    assert(io.write(data))\r\n    assert(io.flush())\r\n  else\r\n    local fp = io.open(name)\r\n    if fp then\r\n      local old = fp:read(\"*a\")\r\n      fp:close()\r\n      if data == old then return end\r\n    end\r\n    fp = assert(io.open(name, \"w\"))\r\n    assert(fp:write(data))\r\n    assert(fp:close())\r\n  end\r\nend\r\n\r\nlocal outfile = parse_arg(arg)\r\nlocal src = read_files(arg)\r\nlocal defs = find_defs(src)\r\nlocal hdr = gen_header(defs)\r\nwrite_file(outfile, hdr)\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/genminilua.lua",
    "content": "----------------------------------------------------------------------------\r\n-- Lua script to generate a customized, minified version of Lua.\r\n-- The resulting 'minilua' is used for the build process of LuaJIT.\r\n----------------------------------------------------------------------------\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n\r\nlocal sub, match, gsub = string.sub, string.match, string.gsub\r\n\r\nlocal LUA_VERSION = \"5.1.5\"\r\nlocal LUA_SOURCE\r\n\r\nlocal function usage()\r\n  io.stderr:write(\"Usage: \", arg and arg[0] or \"genminilua\",\r\n\t\t  \" lua-\", LUA_VERSION, \"-source-dir\\n\")\r\n  os.exit(1)\r\nend\r\n\r\nlocal function find_sources()\r\n  LUA_SOURCE = arg and arg[1]\r\n  if not LUA_SOURCE then usage() end\r\n  if sub(LUA_SOURCE, -1) ~= \"/\" then LUA_SOURCE = LUA_SOURCE..\"/\" end\r\n  local fp = io.open(LUA_SOURCE .. \"lua.h\")\r\n  if not fp then\r\n    LUA_SOURCE = LUA_SOURCE..\"src/\"\r\n    fp = io.open(LUA_SOURCE .. \"lua.h\")\r\n    if not fp then usage() end\r\n  end\r\n  local all = fp:read(\"*a\")\r\n  fp:close()\r\n  if not match(all, 'LUA_RELEASE%s*\"Lua '..LUA_VERSION..'\"') then\r\n    io.stderr:write(\"Error: version mismatch\\n\")\r\n    usage()\r\n  end\r\nend\r\n\r\nlocal LUA_FILES = {\r\n\"lmem.c\", \"lobject.c\", \"ltm.c\", \"lfunc.c\", \"ldo.c\", \"lstring.c\", \"ltable.c\",\r\n\"lgc.c\", \"lstate.c\", \"ldebug.c\", \"lzio.c\", \"lopcodes.c\",\r\n\"llex.c\", \"lcode.c\", \"lparser.c\", \"lvm.c\", \"lapi.c\", \"lauxlib.c\",\r\n\"lbaselib.c\", \"ltablib.c\", \"liolib.c\", \"loslib.c\", \"lstrlib.c\", \"linit.c\",\r\n}\r\n\r\nlocal REMOVE_LIB = {}\r\ngsub([[\r\ncollectgarbage dofile gcinfo getfenv getmetatable load print rawequal rawset\r\nselect tostring xpcall\r\nforeach foreachi getn maxn setn\r\npopen tmpfile seek setvbuf __tostring\r\nclock date difftime execute getenv rename setlocale time tmpname\r\ndump gfind len reverse\r\nLUA_LOADLIBNAME LUA_MATHLIBNAME LUA_DBLIBNAME\r\n]], \"%S+\", function(name)\r\n  REMOVE_LIB[name] = true\r\nend)\r\n\r\nlocal REMOVE_EXTINC = { [\"<assert.h>\"] = true, [\"<locale.h>\"] = true, }\r\n\r\nlocal CUSTOM_MAIN = [[\r\ntypedef unsigned int UB;\r\nstatic UB barg(lua_State *L,int idx){\r\nunion{lua_Number n;U64 b;}bn;\r\nbn.n=lua_tonumber(L,idx)+6755399441055744.0;\r\nif (bn.n==0.0&&!lua_isnumber(L,idx))luaL_typerror(L,idx,\"number\");\r\nreturn(UB)bn.b;\r\n}\r\n#define BRET(b) lua_pushnumber(L,(lua_Number)(int)(b));return 1;\r\nstatic int tobit(lua_State *L){\r\nBRET(barg(L,1))}\r\nstatic int bnot(lua_State *L){\r\nBRET(~barg(L,1))}\r\nstatic int band(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b&=barg(L,i);BRET(b)}\r\nstatic int bor(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b|=barg(L,i);BRET(b)}\r\nstatic int bxor(lua_State *L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b^=barg(L,i);BRET(b)}\r\nstatic int lshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b<<n)}\r\nstatic int rshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b>>n)}\r\nstatic int arshift(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((int)b>>n)}\r\nstatic int rol(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b<<n)|(b>>(32-n)))}\r\nstatic int ror(lua_State *L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b>>n)|(b<<(32-n)))}\r\nstatic int bswap(lua_State *L){\r\nUB b=barg(L,1);b=(b>>24)|((b>>8)&0xff00)|((b&0xff00)<<8)|(b<<24);BRET(b)}\r\nstatic int tohex(lua_State *L){\r\nUB b=barg(L,1);\r\nint n=lua_isnone(L,2)?8:(int)barg(L,2);\r\nconst char *hexdigits=\"0123456789abcdef\";\r\nchar buf[8];\r\nint i;\r\nif(n<0){n=-n;hexdigits=\"0123456789ABCDEF\";}\r\nif(n>8)n=8;\r\nfor(i=(int)n;--i>=0;){buf[i]=hexdigits[b&15];b>>=4;}\r\nlua_pushlstring(L,buf,(size_t)n);\r\nreturn 1;\r\n}\r\nstatic const struct luaL_Reg bitlib[] = {\r\n{\"tobit\",tobit},\r\n{\"bnot\",bnot},\r\n{\"band\",band},\r\n{\"bor\",bor},\r\n{\"bxor\",bxor},\r\n{\"lshift\",lshift},\r\n{\"rshift\",rshift},\r\n{\"arshift\",arshift},\r\n{\"rol\",rol},\r\n{\"ror\",ror},\r\n{\"bswap\",bswap},\r\n{\"tohex\",tohex},\r\n{NULL,NULL}\r\n};\r\nint main(int argc, char **argv){\r\n  lua_State *L = luaL_newstate();\r\n  int i;\r\n  luaL_openlibs(L);\r\n  luaL_register(L, \"bit\", bitlib);\r\n  if (argc < 2) return sizeof(void *);\r\n  lua_createtable(L, 0, 1);\r\n  lua_pushstring(L, argv[1]);\r\n  lua_rawseti(L, -2, 0);\r\n  lua_setglobal(L, \"arg\");\r\n  if (luaL_loadfile(L, argv[1]))\r\n    goto err;\r\n  for (i = 2; i < argc; i++)\r\n    lua_pushstring(L, argv[i]);\r\n  if (lua_pcall(L, argc - 2, 0, 0)) {\r\n  err:\r\n    fprintf(stderr, \"Error: %s\\n\", lua_tostring(L, -1));\r\n    return 1;\r\n  }\r\n  lua_close(L);\r\n  return 0;\r\n}\r\n]]\r\n\r\nlocal function read_sources()\r\n  local t = {}\r\n  for i, name in ipairs(LUA_FILES) do\r\n    local fp = assert(io.open(LUA_SOURCE..name, \"r\"))\r\n    t[i] = fp:read(\"*a\")\r\n    assert(fp:close())\r\n  end\r\n  t[#t+1] = CUSTOM_MAIN\r\n  return table.concat(t)\r\nend\r\n\r\nlocal includes = {}\r\n\r\nlocal function merge_includes(src)\r\n  return gsub(src, '#include%s*\"([^\"]*)\"%s*\\n', function(name)\r\n    if includes[name] then return \"\" end\r\n    includes[name] = true\r\n    local fp = assert(io.open(LUA_SOURCE..name, \"r\"))\r\n    local src = fp:read(\"*a\")\r\n    assert(fp:close())\r\n    src = gsub(src, \"#ifndef%s+%w+_h\\n#define%s+%w+_h\\n\", \"\")\r\n    src = gsub(src, \"#endif%s*$\", \"\")\r\n    return merge_includes(src)\r\n  end)\r\nend\r\n\r\nlocal function get_license(src)\r\n  return match(src, \"/%*+\\n%* Copyright %(.-%*/\\n\")\r\nend\r\n\r\nlocal function fold_lines(src)\r\n  return gsub(src, \"\\\\\\n\", \" \")\r\nend\r\n\r\nlocal strings = {}\r\n\r\nlocal function save_str(str)\r\n  local n = #strings+1\r\n  strings[n] = str\r\n  return \"\\1\"..n..\"\\2\"\r\nend\r\n\r\nlocal function save_strings(src)\r\n  src = gsub(src, '\"[^\"\\n]*\"', save_str)\r\n  return gsub(src, \"'[^'\\n]*'\", save_str)\r\nend\r\n\r\nlocal function restore_strings(src)\r\n  return gsub(src, \"\\1(%d+)\\2\", function(numstr)\r\n    return strings[tonumber(numstr)]\r\n  end)\r\nend\r\n\r\nlocal function def_istrue(def)\r\n  return def == \"INT_MAX > 2147483640L\" or\r\n\t def == \"LUAI_BITSINT >= 32\" or\r\n\t def == \"SIZE_Bx < LUAI_BITSINT-1\" or\r\n\t def == \"cast\" or\r\n\t def == \"defined(LUA_CORE)\" or\r\n\t def == \"MINSTRTABSIZE\" or\r\n\t def == \"LUA_MINBUFFER\" or\r\n\t def == \"HARDSTACKTESTS\" or\r\n\t def == \"UNUSED\"\r\nend\r\n\r\nlocal head, defs = {[[\r\n#ifdef _MSC_VER\r\ntypedef unsigned __int64 U64;\r\n#else\r\ntypedef unsigned long long U64;\r\n#endif\r\nint _CRT_glob = 0;\r\n]]}, {}\r\n\r\nlocal function preprocess(src)\r\n  local t = { match(src, \"^(.-)#\") }\r\n  local lvl, on, oldon = 0, true, {}\r\n  for pp, def, txt in string.gmatch(src, \"#(%w+) *([^\\n]*)\\n([^#]*)\") do\r\n    if pp == \"if\" or pp == \"ifdef\" or pp == \"ifndef\" then\r\n      lvl = lvl + 1\r\n      oldon[lvl] = on\r\n      on = def_istrue(def)\r\n    elseif pp == \"else\" then\r\n      if oldon[lvl] then\r\n\tif on == false then on = true else on = false end\r\n      end\r\n    elseif pp == \"elif\" then\r\n      if oldon[lvl] then\r\n\ton = def_istrue(def)\r\n      end\r\n    elseif pp == \"endif\" then\r\n      on = oldon[lvl]\r\n      lvl = lvl - 1\r\n    elseif on then\r\n      if pp == \"include\" then\r\n\tif not head[def] and not REMOVE_EXTINC[def] then\r\n\t  head[def] = true\r\n\t  head[#head+1] = \"#include \"..def..\"\\n\"\r\n\tend\r\n      elseif pp == \"define\" then\r\n\tlocal k, sp, v = match(def, \"([%w_]+)(%s*)(.*)\")\r\n\tif k and not (sp == \"\" and sub(v, 1, 1) == \"(\") then\r\n\t  defs[k] = gsub(v, \"%a[%w_]*\", function(tok)\r\n\t    return defs[tok] or tok\r\n\t  end)\r\n\telse\r\n\t  t[#t+1] = \"#define \"..def..\"\\n\"\r\n\tend\r\n      elseif pp ~= \"undef\" then\r\n\terror(\"unexpected directive: \"..pp..\" \"..def)\r\n      end\r\n    end\r\n    if on then t[#t+1] = txt end\r\n  end\r\n  return gsub(table.concat(t), \"%a[%w_]*\", function(tok)\r\n    return defs[tok] or tok\r\n  end)\r\nend\r\n\r\nlocal function merge_header(src, license)\r\n  local hdr = string.format([[\r\n/* This is a heavily customized and minimized copy of Lua %s. */\r\n/* It's only used to build LuaJIT. It does NOT have all standard functions! */\r\n]], LUA_VERSION)\r\n  return hdr..license..table.concat(head)..src\r\nend\r\n\r\nlocal function strip_unused1(src)\r\n  return gsub(src, '(  {\"?([%w_]+)\"?,%s+%a[%w_]*},\\n)', function(line, func)\r\n    return REMOVE_LIB[func] and \"\" or line\r\n  end)\r\nend\r\n\r\nlocal function strip_unused2(src)\r\n  return gsub(src, \"Symbolic Execution.-}=\", \"\")\r\nend\r\n\r\nlocal function strip_unused3(src)\r\n  src = gsub(src, \"extern\", \"static\")\r\n  src = gsub(src, \"\\nstatic([^\\n]-)%(([^)]*)%)%(\", \"\\nstatic%1 %2(\")\r\n  src = gsub(src, \"#define lua_assert[^\\n]*\\n\", \"\")\r\n  src = gsub(src, \"lua_assert%b();?\", \"\")\r\n  src = gsub(src, \"default:\\n}\", \"default:;\\n}\")\r\n  src = gsub(src, \"lua_lock%b();\", \"\")\r\n  src = gsub(src, \"lua_unlock%b();\", \"\")\r\n  src = gsub(src, \"luai_threadyield%b();\", \"\")\r\n  src = gsub(src, \"luai_userstateopen%b();\", \"{}\")\r\n  src = gsub(src, \"luai_userstate%w+%b();\", \"\")\r\n  src = gsub(src, \"%(%(c==.*luaY_parser%)\", \"luaY_parser\")\r\n  src = gsub(src, \"trydecpoint%(ls,seminfo%)\",\r\n\t\t  \"luaX_lexerror(ls,\\\"malformed number\\\",TK_NUMBER)\")\r\n  src = gsub(src, \"int c=luaZ_lookahead%b();\", \"\")\r\n  src = gsub(src, \"luaL_register%(L,[^,]*,co_funcs%);\\nreturn 2;\",\r\n\t\t  \"return 1;\")\r\n  src = gsub(src, \"getfuncname%b():\", \"NULL:\")\r\n  src = gsub(src, \"getobjname%b():\", \"NULL:\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*%)\\n[^\\n]*\\n\", \"\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*%)%b{}\\n\", \"\")\r\n  src = gsub(src, \"if%([^\\n]*hookmask[^\\n]*&&\\n[^\\n]*%b{}\\n\", \"\")\r\n  src = gsub(src, \"(twoto%b()%()\", \"%1(size_t)\")\r\n  src = gsub(src, \"i<sizenode\", \"i<(int)sizenode\")\r\n  return gsub(src, \"\\n\\n+\", \"\\n\")\r\nend\r\n\r\nlocal function strip_comments(src)\r\n  return gsub(src, \"/%*.-%*/\", \" \")\r\nend\r\n\r\nlocal function strip_whitespace(src)\r\n  src = gsub(src, \"^%s+\", \"\")\r\n  src = gsub(src, \"%s*\\n%s*\", \"\\n\")\r\n  src = gsub(src, \"[ \\t]+\", \" \")\r\n  src = gsub(src, \"(%W) \", \"%1\")\r\n  return gsub(src, \" (%W)\", \"%1\")\r\nend\r\n\r\nlocal function rename_tokens1(src)\r\n  src = gsub(src, \"getline\", \"getline_\")\r\n  src = gsub(src, \"struct ([%w_]+)\", \"ZX%1\")\r\n  return gsub(src, \"union ([%w_]+)\", \"ZY%1\")\r\nend\r\n\r\nlocal function rename_tokens2(src)\r\n  src = gsub(src, \"ZX([%w_]+)\", \"struct %1\")\r\n  return gsub(src, \"ZY([%w_]+)\", \"union %1\")\r\nend\r\n\r\nlocal function func_gather(src)\r\n  local nodes, list = {}, {}\r\n  local pos, len = 1, #src\r\n  while pos < len do\r\n    local d, w = match(src, \"^(#define ([%w_]+)[^\\n]*\\n)\", pos)\r\n    if d then\r\n      local n = #list+1\r\n      list[n] = d\r\n      nodes[w] = n\r\n    else\r\n      local s\r\n      d, w, s = match(src, \"^(([%w_]+)[^\\n]*([{;])\\n)\", pos)\r\n      if not d then\r\n\td, w, s = match(src, \"^(([%w_]+)[^(]*%b()([{;])\\n)\", pos)\r\n\tif not d then d = match(src, \"^[^\\n]*\\n\", pos) end\r\n      end\r\n      if s == \"{\" then\r\n\td = d..sub(match(src, \"^%b{}[^;\\n]*;?\\n\", pos+#d-2), 3)\r\n\tif sub(d, -2) == \"{\\n\" then\r\n\t  d = d..sub(match(src, \"^%b{}[^;\\n]*;?\\n\", pos+#d-2), 3)\r\n\tend\r\n      end\r\n      local k, v = nil, d\r\n      if w == \"typedef\" then\r\n\tif match(d, \"^typedef enum\") then\r\n\t  head[#head+1] = d\r\n\telse\r\n\t  k = match(d, \"([%w_]+);\\n$\")\r\n\t  if not k then k = match(d, \"^.-%(.-([%w_]+)%)%(\") end\r\n\tend\r\n      elseif w == \"enum\" then\r\n\thead[#head+1] = v\r\n      elseif w ~= nil then\r\n\tk = match(d, \"^[^\\n]-([%w_]+)[(%[=]\")\r\n\tif k then\r\n\t  if w ~= \"static\" and k ~= \"main\" then v = \"static \"..d end\r\n\telse\r\n\t  k = w\r\n\tend\r\n      end\r\n      if w and k then\r\n\tlocal o = nodes[k]\r\n\tif o then nodes[\"*\"..k] = o end\r\n\tlocal n = #list+1\r\n\tlist[n] = v\r\n\tnodes[k] = n\r\n      end\r\n    end\r\n    pos = pos + #d\r\n  end\r\n  return nodes, list\r\nend\r\n\r\nlocal function func_visit(nodes, list, used, n)\r\n  local i = nodes[n]\r\n  for m in string.gmatch(list[i], \"[%w_]+\") do\r\n    if nodes[m] then\r\n      local j = used[m]\r\n      if not j then\r\n\tused[m] = i\r\n\tfunc_visit(nodes, list, used, m)\r\n      elseif i < j then\r\n\tused[m] = i\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\nlocal function func_collect(src)\r\n  local nodes, list = func_gather(src)\r\n  local used = {}\r\n  func_visit(nodes, list, used, \"main\")\r\n  for n,i in pairs(nodes) do\r\n    local j = used[n]\r\n    if j and j < i then used[\"*\"..n] = j end\r\n  end\r\n  for n,i in pairs(nodes) do\r\n    if not used[n] then list[i] = \"\" end\r\n  end\r\n  return table.concat(list)\r\nend\r\n\r\nfind_sources()\r\nlocal src = read_sources()\r\nsrc = merge_includes(src)\r\nlocal license = get_license(src)\r\nsrc = fold_lines(src)\r\nsrc = strip_unused1(src)\r\nsrc = save_strings(src)\r\nsrc = strip_unused2(src)\r\nsrc = strip_comments(src)\r\nsrc = preprocess(src)\r\nsrc = strip_whitespace(src)\r\nsrc = strip_unused3(src)\r\nsrc = rename_tokens1(src)\r\nsrc = func_collect(src)\r\nsrc = rename_tokens2(src)\r\nsrc = restore_strings(src)\r\nsrc = merge_header(src, license)\r\nio.write(src)\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/host/minilua.c",
    "content": "/* This is a heavily customized and minimized copy of Lua 5.1.5. */\r\n/* It's only used to build LuaJIT. It does NOT have all standard functions! */\r\n/******************************************************************************\r\n* Copyright (C) 1994-2012 Lua.org, PUC-Rio.  All rights reserved.\r\n*\r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including\r\n* without limitation the rights to use, copy, modify, merge, publish,\r\n* distribute, sublicense, and/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject to\r\n* the following conditions:\r\n*\r\n* The above copyright notice and this permission notice shall be\r\n* included in all copies or substantial portions of the Software.\r\n*\r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n******************************************************************************/\r\n#ifdef _MSC_VER\r\ntypedef unsigned __int64 U64;\r\n#else\r\ntypedef unsigned long long U64;\r\n#endif\r\nint _CRT_glob = 0;\r\n#include <stddef.h>\r\n#include <stdarg.h>\r\n#include <limits.h>\r\n#include <math.h>\r\n#include <ctype.h>\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <setjmp.h>\r\n#include <errno.h>\r\n#include <time.h>\r\ntypedef enum{\r\nTM_INDEX,\r\nTM_NEWINDEX,\r\nTM_GC,\r\nTM_MODE,\r\nTM_EQ,\r\nTM_ADD,\r\nTM_SUB,\r\nTM_MUL,\r\nTM_DIV,\r\nTM_MOD,\r\nTM_POW,\r\nTM_UNM,\r\nTM_LEN,\r\nTM_LT,\r\nTM_LE,\r\nTM_CONCAT,\r\nTM_CALL,\r\nTM_N\r\n}TMS;\r\nenum OpMode{iABC,iABx,iAsBx};\r\ntypedef enum{\r\nOP_MOVE,\r\nOP_LOADK,\r\nOP_LOADBOOL,\r\nOP_LOADNIL,\r\nOP_GETUPVAL,\r\nOP_GETGLOBAL,\r\nOP_GETTABLE,\r\nOP_SETGLOBAL,\r\nOP_SETUPVAL,\r\nOP_SETTABLE,\r\nOP_NEWTABLE,\r\nOP_SELF,\r\nOP_ADD,\r\nOP_SUB,\r\nOP_MUL,\r\nOP_DIV,\r\nOP_MOD,\r\nOP_POW,\r\nOP_UNM,\r\nOP_NOT,\r\nOP_LEN,\r\nOP_CONCAT,\r\nOP_JMP,\r\nOP_EQ,\r\nOP_LT,\r\nOP_LE,\r\nOP_TEST,\r\nOP_TESTSET,\r\nOP_CALL,\r\nOP_TAILCALL,\r\nOP_RETURN,\r\nOP_FORLOOP,\r\nOP_FORPREP,\r\nOP_TFORLOOP,\r\nOP_SETLIST,\r\nOP_CLOSE,\r\nOP_CLOSURE,\r\nOP_VARARG\r\n}OpCode;\r\nenum OpArgMask{\r\nOpArgN,\r\nOpArgU,\r\nOpArgR,\r\nOpArgK\r\n};\r\ntypedef enum{\r\nVVOID,\r\nVNIL,\r\nVTRUE,\r\nVFALSE,\r\nVK,\r\nVKNUM,\r\nVLOCAL,\r\nVUPVAL,\r\nVGLOBAL,\r\nVINDEXED,\r\nVJMP,\r\nVRELOCABLE,\r\nVNONRELOC,\r\nVCALL,\r\nVVARARG\r\n}expkind;\r\nenum RESERVED{\r\nTK_AND=257,TK_BREAK,\r\nTK_DO,TK_ELSE,TK_ELSEIF,TK_END,TK_FALSE,TK_FOR,TK_FUNCTION,\r\nTK_IF,TK_IN,TK_LOCAL,TK_NIL,TK_NOT,TK_OR,TK_REPEAT,\r\nTK_RETURN,TK_THEN,TK_TRUE,TK_UNTIL,TK_WHILE,\r\nTK_CONCAT,TK_DOTS,TK_EQ,TK_GE,TK_LE,TK_NE,TK_NUMBER,\r\nTK_NAME,TK_STRING,TK_EOS\r\n};\r\ntypedef enum BinOpr{\r\nOPR_ADD,OPR_SUB,OPR_MUL,OPR_DIV,OPR_MOD,OPR_POW,\r\nOPR_CONCAT,\r\nOPR_NE,OPR_EQ,\r\nOPR_LT,OPR_LE,OPR_GT,OPR_GE,\r\nOPR_AND,OPR_OR,\r\nOPR_NOBINOPR\r\n}BinOpr;\r\ntypedef enum UnOpr{OPR_MINUS,OPR_NOT,OPR_LEN,OPR_NOUNOPR}UnOpr;\r\n#define LUA_QL(x)\"'\"x\"'\"\r\n#define luai_apicheck(L,o){(void)L;}\r\n#define lua_number2str(s,n)sprintf((s),\"%.14g\",(n))\r\n#define lua_str2number(s,p)strtod((s),(p))\r\n#define luai_numadd(a,b)((a)+(b))\r\n#define luai_numsub(a,b)((a)-(b))\r\n#define luai_nummul(a,b)((a)*(b))\r\n#define luai_numdiv(a,b)((a)/(b))\r\n#define luai_nummod(a,b)((a)-floor((a)/(b))*(b))\r\n#define luai_numpow(a,b)(pow(a,b))\r\n#define luai_numunm(a)(-(a))\r\n#define luai_numeq(a,b)((a)==(b))\r\n#define luai_numlt(a,b)((a)<(b))\r\n#define luai_numle(a,b)((a)<=(b))\r\n#define luai_numisnan(a)(!luai_numeq((a),(a)))\r\n#define lua_number2int(i,d)((i)=(int)(d))\r\n#define lua_number2integer(i,d)((i)=(lua_Integer)(d))\r\n#define LUAI_THROW(L,c)longjmp((c)->b,1)\r\n#define LUAI_TRY(L,c,a)if(setjmp((c)->b)==0){a}\r\n#define lua_pclose(L,file)((void)((void)L,file),0)\r\n#define lua_upvalueindex(i)((-10002)-(i))\r\ntypedef struct lua_State lua_State;\r\ntypedef int(*lua_CFunction)(lua_State*L);\r\ntypedef const char*(*lua_Reader)(lua_State*L,void*ud,size_t*sz);\r\ntypedef void*(*lua_Alloc)(void*ud,void*ptr,size_t osize,size_t nsize);\r\ntypedef double lua_Number;\r\ntypedef ptrdiff_t lua_Integer;\r\nstatic void lua_settop(lua_State*L,int idx);\r\nstatic int lua_type(lua_State*L,int idx);\r\nstatic const char* lua_tolstring(lua_State*L,int idx,size_t*len);\r\nstatic size_t lua_objlen(lua_State*L,int idx);\r\nstatic void lua_pushlstring(lua_State*L,const char*s,size_t l);\r\nstatic void lua_pushcclosure(lua_State*L,lua_CFunction fn,int n);\r\nstatic void lua_createtable(lua_State*L,int narr,int nrec);\r\nstatic void lua_setfield(lua_State*L,int idx,const char*k);\r\n#define lua_pop(L,n)lua_settop(L,-(n)-1)\r\n#define lua_newtable(L)lua_createtable(L,0,0)\r\n#define lua_pushcfunction(L,f)lua_pushcclosure(L,(f),0)\r\n#define lua_strlen(L,i)lua_objlen(L,(i))\r\n#define lua_isfunction(L,n)(lua_type(L,(n))==6)\r\n#define lua_istable(L,n)(lua_type(L,(n))==5)\r\n#define lua_isnil(L,n)(lua_type(L,(n))==0)\r\n#define lua_isboolean(L,n)(lua_type(L,(n))==1)\r\n#define lua_isnone(L,n)(lua_type(L,(n))==(-1))\r\n#define lua_isnoneornil(L,n)(lua_type(L,(n))<=0)\r\n#define lua_pushliteral(L,s)lua_pushlstring(L,\"\"s,(sizeof(s)/sizeof(char))-1)\r\n#define lua_setglobal(L,s)lua_setfield(L,(-10002),(s))\r\n#define lua_tostring(L,i)lua_tolstring(L,(i),NULL)\r\ntypedef struct lua_Debug lua_Debug;\r\ntypedef void(*lua_Hook)(lua_State*L,lua_Debug*ar);\r\nstruct lua_Debug{\r\nint event;\r\nconst char*name;\r\nconst char*namewhat;\r\nconst char*what;\r\nconst char*source;\r\nint currentline;\r\nint nups;\r\nint linedefined;\r\nint lastlinedefined;\r\nchar short_src[60];\r\nint i_ci;\r\n};\r\ntypedef unsigned int lu_int32;\r\ntypedef size_t lu_mem;\r\ntypedef ptrdiff_t l_mem;\r\ntypedef unsigned char lu_byte;\r\n#define IntPoint(p)((unsigned int)(lu_mem)(p))\r\ntypedef union{double u;void*s;long l;}L_Umaxalign;\r\ntypedef double l_uacNumber;\r\n#define check_exp(c,e)(e)\r\n#define UNUSED(x)((void)(x))\r\n#define cast(t,exp)((t)(exp))\r\n#define cast_byte(i)cast(lu_byte,(i))\r\n#define cast_num(i)cast(lua_Number,(i))\r\n#define cast_int(i)cast(int,(i))\r\ntypedef lu_int32 Instruction;\r\n#define condhardstacktests(x)((void)0)\r\ntypedef union GCObject GCObject;\r\ntypedef struct GCheader{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\n}GCheader;\r\ntypedef union{\r\nGCObject*gc;\r\nvoid*p;\r\nlua_Number n;\r\nint b;\r\n}Value;\r\ntypedef struct lua_TValue{\r\nValue value;int tt;\r\n}TValue;\r\n#define ttisnil(o)(ttype(o)==0)\r\n#define ttisnumber(o)(ttype(o)==3)\r\n#define ttisstring(o)(ttype(o)==4)\r\n#define ttistable(o)(ttype(o)==5)\r\n#define ttisfunction(o)(ttype(o)==6)\r\n#define ttisboolean(o)(ttype(o)==1)\r\n#define ttisuserdata(o)(ttype(o)==7)\r\n#define ttisthread(o)(ttype(o)==8)\r\n#define ttislightuserdata(o)(ttype(o)==2)\r\n#define ttype(o)((o)->tt)\r\n#define gcvalue(o)check_exp(iscollectable(o),(o)->value.gc)\r\n#define pvalue(o)check_exp(ttislightuserdata(o),(o)->value.p)\r\n#define nvalue(o)check_exp(ttisnumber(o),(o)->value.n)\r\n#define rawtsvalue(o)check_exp(ttisstring(o),&(o)->value.gc->ts)\r\n#define tsvalue(o)(&rawtsvalue(o)->tsv)\r\n#define rawuvalue(o)check_exp(ttisuserdata(o),&(o)->value.gc->u)\r\n#define uvalue(o)(&rawuvalue(o)->uv)\r\n#define clvalue(o)check_exp(ttisfunction(o),&(o)->value.gc->cl)\r\n#define hvalue(o)check_exp(ttistable(o),&(o)->value.gc->h)\r\n#define bvalue(o)check_exp(ttisboolean(o),(o)->value.b)\r\n#define thvalue(o)check_exp(ttisthread(o),&(o)->value.gc->th)\r\n#define l_isfalse(o)(ttisnil(o)||(ttisboolean(o)&&bvalue(o)==0))\r\n#define checkconsistency(obj)\r\n#define checkliveness(g,obj)\r\n#define setnilvalue(obj)((obj)->tt=0)\r\n#define setnvalue(obj,x){TValue*i_o=(obj);i_o->value.n=(x);i_o->tt=3;}\r\n#define setbvalue(obj,x){TValue*i_o=(obj);i_o->value.b=(x);i_o->tt=1;}\r\n#define setsvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=4;checkliveness(G(L),i_o);}\r\n#define setuvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=7;checkliveness(G(L),i_o);}\r\n#define setthvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=8;checkliveness(G(L),i_o);}\r\n#define setclvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=6;checkliveness(G(L),i_o);}\r\n#define sethvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=5;checkliveness(G(L),i_o);}\r\n#define setptvalue(L,obj,x){TValue*i_o=(obj);i_o->value.gc=cast(GCObject*,(x));i_o->tt=(8+1);checkliveness(G(L),i_o);}\r\n#define setobj(L,obj1,obj2){const TValue*o2=(obj2);TValue*o1=(obj1);o1->value=o2->value;o1->tt=o2->tt;checkliveness(G(L),o1);}\r\n#define setttype(obj,tt)(ttype(obj)=(tt))\r\n#define iscollectable(o)(ttype(o)>=4)\r\ntypedef TValue*StkId;\r\ntypedef union TString{\r\nL_Umaxalign dummy;\r\nstruct{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte reserved;\r\nunsigned int hash;\r\nsize_t len;\r\n}tsv;\r\n}TString;\r\n#define getstr(ts)cast(const char*,(ts)+1)\r\n#define svalue(o)getstr(rawtsvalue(o))\r\ntypedef union Udata{\r\nL_Umaxalign dummy;\r\nstruct{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nstruct Table*metatable;\r\nstruct Table*env;\r\nsize_t len;\r\n}uv;\r\n}Udata;\r\ntypedef struct Proto{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nTValue*k;\r\nInstruction*code;\r\nstruct Proto**p;\r\nint*lineinfo;\r\nstruct LocVar*locvars;\r\nTString**upvalues;\r\nTString*source;\r\nint sizeupvalues;\r\nint sizek;\r\nint sizecode;\r\nint sizelineinfo;\r\nint sizep;\r\nint sizelocvars;\r\nint linedefined;\r\nint lastlinedefined;\r\nGCObject*gclist;\r\nlu_byte nups;\r\nlu_byte numparams;\r\nlu_byte is_vararg;\r\nlu_byte maxstacksize;\r\n}Proto;\r\ntypedef struct LocVar{\r\nTString*varname;\r\nint startpc;\r\nint endpc;\r\n}LocVar;\r\ntypedef struct UpVal{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nTValue*v;\r\nunion{\r\nTValue value;\r\nstruct{\r\nstruct UpVal*prev;\r\nstruct UpVal*next;\r\n}l;\r\n}u;\r\n}UpVal;\r\ntypedef struct CClosure{\r\nGCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;\r\nlua_CFunction f;\r\nTValue upvalue[1];\r\n}CClosure;\r\ntypedef struct LClosure{\r\nGCObject*next;lu_byte tt;lu_byte marked;lu_byte isC;lu_byte nupvalues;GCObject*gclist;struct Table*env;\r\nstruct Proto*p;\r\nUpVal*upvals[1];\r\n}LClosure;\r\ntypedef union Closure{\r\nCClosure c;\r\nLClosure l;\r\n}Closure;\r\n#define iscfunction(o)(ttype(o)==6&&clvalue(o)->c.isC)\r\ntypedef union TKey{\r\nstruct{\r\nValue value;int tt;\r\nstruct Node*next;\r\n}nk;\r\nTValue tvk;\r\n}TKey;\r\ntypedef struct Node{\r\nTValue i_val;\r\nTKey i_key;\r\n}Node;\r\ntypedef struct Table{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte flags;\r\nlu_byte lsizenode;\r\nstruct Table*metatable;\r\nTValue*array;\r\nNode*node;\r\nNode*lastfree;\r\nGCObject*gclist;\r\nint sizearray;\r\n}Table;\r\n#define lmod(s,size)(check_exp((size&(size-1))==0,(cast(int,(s)&((size)-1)))))\r\n#define twoto(x)((size_t)1<<(x))\r\n#define sizenode(t)(twoto((t)->lsizenode))\r\nstatic const TValue luaO_nilobject_;\r\n#define ceillog2(x)(luaO_log2((x)-1)+1)\r\nstatic int luaO_log2(unsigned int x);\r\n#define gfasttm(g,et,e)((et)==NULL?NULL:((et)->flags&(1u<<(e)))?NULL:luaT_gettm(et,e,(g)->tmname[e]))\r\n#define fasttm(l,et,e)gfasttm(G(l),et,e)\r\nstatic const TValue*luaT_gettm(Table*events,TMS event,TString*ename);\r\n#define luaM_reallocv(L,b,on,n,e)((cast(size_t,(n)+1)<=((size_t)(~(size_t)0)-2)/(e))?luaM_realloc_(L,(b),(on)*(e),(n)*(e)):luaM_toobig(L))\r\n#define luaM_freemem(L,b,s)luaM_realloc_(L,(b),(s),0)\r\n#define luaM_free(L,b)luaM_realloc_(L,(b),sizeof(*(b)),0)\r\n#define luaM_freearray(L,b,n,t)luaM_reallocv(L,(b),n,0,sizeof(t))\r\n#define luaM_malloc(L,t)luaM_realloc_(L,NULL,0,(t))\r\n#define luaM_new(L,t)cast(t*,luaM_malloc(L,sizeof(t)))\r\n#define luaM_newvector(L,n,t)cast(t*,luaM_reallocv(L,NULL,0,n,sizeof(t)))\r\n#define luaM_growvector(L,v,nelems,size,t,limit,e)if((nelems)+1>(size))((v)=cast(t*,luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))\r\n#define luaM_reallocvector(L,v,oldn,n,t)((v)=cast(t*,luaM_reallocv(L,v,oldn,n,sizeof(t))))\r\nstatic void*luaM_realloc_(lua_State*L,void*block,size_t oldsize,\r\nsize_t size);\r\nstatic void*luaM_toobig(lua_State*L);\r\nstatic void*luaM_growaux_(lua_State*L,void*block,int*size,\r\nsize_t size_elem,int limit,\r\nconst char*errormsg);\r\ntypedef struct Zio ZIO;\r\n#define char2int(c)cast(int,cast(unsigned char,(c)))\r\n#define zgetc(z)(((z)->n--)>0?char2int(*(z)->p++):luaZ_fill(z))\r\ntypedef struct Mbuffer{\r\nchar*buffer;\r\nsize_t n;\r\nsize_t buffsize;\r\n}Mbuffer;\r\n#define luaZ_initbuffer(L,buff)((buff)->buffer=NULL,(buff)->buffsize=0)\r\n#define luaZ_buffer(buff)((buff)->buffer)\r\n#define luaZ_sizebuffer(buff)((buff)->buffsize)\r\n#define luaZ_bufflen(buff)((buff)->n)\r\n#define luaZ_resetbuffer(buff)((buff)->n=0)\r\n#define luaZ_resizebuffer(L,buff,size)(luaM_reallocvector(L,(buff)->buffer,(buff)->buffsize,size,char),(buff)->buffsize=size)\r\n#define luaZ_freebuffer(L,buff)luaZ_resizebuffer(L,buff,0)\r\nstruct Zio{\r\nsize_t n;\r\nconst char*p;\r\nlua_Reader reader;\r\nvoid*data;\r\nlua_State*L;\r\n};\r\nstatic int luaZ_fill(ZIO*z);\r\nstruct lua_longjmp;\r\n#define gt(L)(&L->l_gt)\r\n#define registry(L)(&G(L)->l_registry)\r\ntypedef struct stringtable{\r\nGCObject**hash;\r\nlu_int32 nuse;\r\nint size;\r\n}stringtable;\r\ntypedef struct CallInfo{\r\nStkId base;\r\nStkId func;\r\nStkId top;\r\nconst Instruction*savedpc;\r\nint nresults;\r\nint tailcalls;\r\n}CallInfo;\r\n#define curr_func(L)(clvalue(L->ci->func))\r\n#define ci_func(ci)(clvalue((ci)->func))\r\n#define f_isLua(ci)(!ci_func(ci)->c.isC)\r\n#define isLua(ci)(ttisfunction((ci)->func)&&f_isLua(ci))\r\ntypedef struct global_State{\r\nstringtable strt;\r\nlua_Alloc frealloc;\r\nvoid*ud;\r\nlu_byte currentwhite;\r\nlu_byte gcstate;\r\nint sweepstrgc;\r\nGCObject*rootgc;\r\nGCObject**sweepgc;\r\nGCObject*gray;\r\nGCObject*grayagain;\r\nGCObject*weak;\r\nGCObject*tmudata;\r\nMbuffer buff;\r\nlu_mem GCthreshold;\r\nlu_mem totalbytes;\r\nlu_mem estimate;\r\nlu_mem gcdept;\r\nint gcpause;\r\nint gcstepmul;\r\nlua_CFunction panic;\r\nTValue l_registry;\r\nstruct lua_State*mainthread;\r\nUpVal uvhead;\r\nstruct Table*mt[(8+1)];\r\nTString*tmname[TM_N];\r\n}global_State;\r\nstruct lua_State{\r\nGCObject*next;lu_byte tt;lu_byte marked;\r\nlu_byte status;\r\nStkId top;\r\nStkId base;\r\nglobal_State*l_G;\r\nCallInfo*ci;\r\nconst Instruction*savedpc;\r\nStkId stack_last;\r\nStkId stack;\r\nCallInfo*end_ci;\r\nCallInfo*base_ci;\r\nint stacksize;\r\nint size_ci;\r\nunsigned short nCcalls;\r\nunsigned short baseCcalls;\r\nlu_byte hookmask;\r\nlu_byte allowhook;\r\nint basehookcount;\r\nint hookcount;\r\nlua_Hook hook;\r\nTValue l_gt;\r\nTValue env;\r\nGCObject*openupval;\r\nGCObject*gclist;\r\nstruct lua_longjmp*errorJmp;\r\nptrdiff_t errfunc;\r\n};\r\n#define G(L)(L->l_G)\r\nunion GCObject{\r\nGCheader gch;\r\nunion TString ts;\r\nunion Udata u;\r\nunion Closure cl;\r\nstruct Table h;\r\nstruct Proto p;\r\nstruct UpVal uv;\r\nstruct lua_State th;\r\n};\r\n#define rawgco2ts(o)check_exp((o)->gch.tt==4,&((o)->ts))\r\n#define gco2ts(o)(&rawgco2ts(o)->tsv)\r\n#define rawgco2u(o)check_exp((o)->gch.tt==7,&((o)->u))\r\n#define gco2u(o)(&rawgco2u(o)->uv)\r\n#define gco2cl(o)check_exp((o)->gch.tt==6,&((o)->cl))\r\n#define gco2h(o)check_exp((o)->gch.tt==5,&((o)->h))\r\n#define gco2p(o)check_exp((o)->gch.tt==(8+1),&((o)->p))\r\n#define gco2uv(o)check_exp((o)->gch.tt==(8+2),&((o)->uv))\r\n#define ngcotouv(o)check_exp((o)==NULL||(o)->gch.tt==(8+2),&((o)->uv))\r\n#define gco2th(o)check_exp((o)->gch.tt==8,&((o)->th))\r\n#define obj2gco(v)(cast(GCObject*,(v)))\r\nstatic void luaE_freethread(lua_State*L,lua_State*L1);\r\n#define pcRel(pc,p)(cast(int,(pc)-(p)->code)-1)\r\n#define getline_(f,pc)(((f)->lineinfo)?(f)->lineinfo[pc]:0)\r\n#define resethookcount(L)(L->hookcount=L->basehookcount)\r\nstatic void luaG_typeerror(lua_State*L,const TValue*o,\r\nconst char*opname);\r\nstatic void luaG_runerror(lua_State*L,const char*fmt,...);\r\n#define luaD_checkstack(L,n)if((char*)L->stack_last-(char*)L->top<=(n)*(int)sizeof(TValue))luaD_growstack(L,n);else condhardstacktests(luaD_reallocstack(L,L->stacksize-5-1));\r\n#define incr_top(L){luaD_checkstack(L,1);L->top++;}\r\n#define savestack(L,p)((char*)(p)-(char*)L->stack)\r\n#define restorestack(L,n)((TValue*)((char*)L->stack+(n)))\r\n#define saveci(L,p)((char*)(p)-(char*)L->base_ci)\r\n#define restoreci(L,n)((CallInfo*)((char*)L->base_ci+(n)))\r\ntypedef void(*Pfunc)(lua_State*L,void*ud);\r\nstatic int luaD_poscall(lua_State*L,StkId firstResult);\r\nstatic void luaD_reallocCI(lua_State*L,int newsize);\r\nstatic void luaD_reallocstack(lua_State*L,int newsize);\r\nstatic void luaD_growstack(lua_State*L,int n);\r\nstatic void luaD_throw(lua_State*L,int errcode);\r\nstatic void*luaM_growaux_(lua_State*L,void*block,int*size,size_t size_elems,\r\nint limit,const char*errormsg){\r\nvoid*newblock;\r\nint newsize;\r\nif(*size>=limit/2){\r\nif(*size>=limit)\r\nluaG_runerror(L,errormsg);\r\nnewsize=limit;\r\n}\r\nelse{\r\nnewsize=(*size)*2;\r\nif(newsize<4)\r\nnewsize=4;\r\n}\r\nnewblock=luaM_reallocv(L,block,*size,newsize,size_elems);\r\n*size=newsize;\r\nreturn newblock;\r\n}\r\nstatic void*luaM_toobig(lua_State*L){\r\nluaG_runerror(L,\"memory allocation error: block too big\");\r\nreturn NULL;\r\n}\r\nstatic void*luaM_realloc_(lua_State*L,void*block,size_t osize,size_t nsize){\r\nglobal_State*g=G(L);\r\nblock=(*g->frealloc)(g->ud,block,osize,nsize);\r\nif(block==NULL&&nsize>0)\r\nluaD_throw(L,4);\r\ng->totalbytes=(g->totalbytes-osize)+nsize;\r\nreturn block;\r\n}\r\n#define resetbits(x,m)((x)&=cast(lu_byte,~(m)))\r\n#define setbits(x,m)((x)|=(m))\r\n#define testbits(x,m)((x)&(m))\r\n#define bitmask(b)(1<<(b))\r\n#define bit2mask(b1,b2)(bitmask(b1)|bitmask(b2))\r\n#define l_setbit(x,b)setbits(x,bitmask(b))\r\n#define resetbit(x,b)resetbits(x,bitmask(b))\r\n#define testbit(x,b)testbits(x,bitmask(b))\r\n#define set2bits(x,b1,b2)setbits(x,(bit2mask(b1,b2)))\r\n#define reset2bits(x,b1,b2)resetbits(x,(bit2mask(b1,b2)))\r\n#define test2bits(x,b1,b2)testbits(x,(bit2mask(b1,b2)))\r\n#define iswhite(x)test2bits((x)->gch.marked,0,1)\r\n#define isblack(x)testbit((x)->gch.marked,2)\r\n#define isgray(x)(!isblack(x)&&!iswhite(x))\r\n#define otherwhite(g)(g->currentwhite^bit2mask(0,1))\r\n#define isdead(g,v)((v)->gch.marked&otherwhite(g)&bit2mask(0,1))\r\n#define changewhite(x)((x)->gch.marked^=bit2mask(0,1))\r\n#define gray2black(x)l_setbit((x)->gch.marked,2)\r\n#define valiswhite(x)(iscollectable(x)&&iswhite(gcvalue(x)))\r\n#define luaC_white(g)cast(lu_byte,(g)->currentwhite&bit2mask(0,1))\r\n#define luaC_checkGC(L){condhardstacktests(luaD_reallocstack(L,L->stacksize-5-1));if(G(L)->totalbytes>=G(L)->GCthreshold)luaC_step(L);}\r\n#define luaC_barrier(L,p,v){if(valiswhite(v)&&isblack(obj2gco(p)))luaC_barrierf(L,obj2gco(p),gcvalue(v));}\r\n#define luaC_barriert(L,t,v){if(valiswhite(v)&&isblack(obj2gco(t)))luaC_barrierback(L,t);}\r\n#define luaC_objbarrier(L,p,o){if(iswhite(obj2gco(o))&&isblack(obj2gco(p)))luaC_barrierf(L,obj2gco(p),obj2gco(o));}\r\n#define luaC_objbarriert(L,t,o){if(iswhite(obj2gco(o))&&isblack(obj2gco(t)))luaC_barrierback(L,t);}\r\nstatic void luaC_step(lua_State*L);\r\nstatic void luaC_link(lua_State*L,GCObject*o,lu_byte tt);\r\nstatic void luaC_linkupval(lua_State*L,UpVal*uv);\r\nstatic void luaC_barrierf(lua_State*L,GCObject*o,GCObject*v);\r\nstatic void luaC_barrierback(lua_State*L,Table*t);\r\n#define sizestring(s)(sizeof(union TString)+((s)->len+1)*sizeof(char))\r\n#define sizeudata(u)(sizeof(union Udata)+(u)->len)\r\n#define luaS_new(L,s)(luaS_newlstr(L,s,strlen(s)))\r\n#define luaS_newliteral(L,s)(luaS_newlstr(L,\"\"s,(sizeof(s)/sizeof(char))-1))\r\n#define luaS_fix(s)l_setbit((s)->tsv.marked,5)\r\nstatic TString*luaS_newlstr(lua_State*L,const char*str,size_t l);\r\n#define tostring(L,o)((ttype(o)==4)||(luaV_tostring(L,o)))\r\n#define tonumber(o,n)(ttype(o)==3||(((o)=luaV_tonumber(o,n))!=NULL))\r\n#define equalobj(L,o1,o2)(ttype(o1)==ttype(o2)&&luaV_equalval(L,o1,o2))\r\nstatic int luaV_equalval(lua_State*L,const TValue*t1,const TValue*t2);\r\nstatic const TValue*luaV_tonumber(const TValue*obj,TValue*n);\r\nstatic int luaV_tostring(lua_State*L,StkId obj);\r\nstatic void luaV_execute(lua_State*L,int nexeccalls);\r\nstatic void luaV_concat(lua_State*L,int total,int last);\r\nstatic const TValue luaO_nilobject_={{NULL},0};\r\nstatic int luaO_int2fb(unsigned int x){\r\nint e=0;\r\nwhile(x>=16){\r\nx=(x+1)>>1;\r\ne++;\r\n}\r\nif(x<8)return x;\r\nelse return((e+1)<<3)|(cast_int(x)-8);\r\n}\r\nstatic int luaO_fb2int(int x){\r\nint e=(x>>3)&31;\r\nif(e==0)return x;\r\nelse return((x&7)+8)<<(e-1);\r\n}\r\nstatic int luaO_log2(unsigned int x){\r\nstatic const lu_byte log_2[256]={\r\n0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,\r\n6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,\r\n7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,\r\n8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8\r\n};\r\nint l=-1;\r\nwhile(x>=256){l+=8;x>>=8;}\r\nreturn l+log_2[x];\r\n}\r\nstatic int luaO_rawequalObj(const TValue*t1,const TValue*t2){\r\nif(ttype(t1)!=ttype(t2))return 0;\r\nelse switch(ttype(t1)){\r\ncase 0:\r\nreturn 1;\r\ncase 3:\r\nreturn luai_numeq(nvalue(t1),nvalue(t2));\r\ncase 1:\r\nreturn bvalue(t1)==bvalue(t2);\r\ncase 2:\r\nreturn pvalue(t1)==pvalue(t2);\r\ndefault:\r\nreturn gcvalue(t1)==gcvalue(t2);\r\n}\r\n}\r\nstatic int luaO_str2d(const char*s,lua_Number*result){\r\nchar*endptr;\r\n*result=lua_str2number(s,&endptr);\r\nif(endptr==s)return 0;\r\nif(*endptr=='x'||*endptr=='X')\r\n*result=cast_num(strtoul(s,&endptr,16));\r\nif(*endptr=='\\0')return 1;\r\nwhile(isspace(cast(unsigned char,*endptr)))endptr++;\r\nif(*endptr!='\\0')return 0;\r\nreturn 1;\r\n}\r\nstatic void pushstr(lua_State*L,const char*str){\r\nsetsvalue(L,L->top,luaS_new(L,str));\r\nincr_top(L);\r\n}\r\nstatic const char*luaO_pushvfstring(lua_State*L,const char*fmt,va_list argp){\r\nint n=1;\r\npushstr(L,\"\");\r\nfor(;;){\r\nconst char*e=strchr(fmt,'%');\r\nif(e==NULL)break;\r\nsetsvalue(L,L->top,luaS_newlstr(L,fmt,e-fmt));\r\nincr_top(L);\r\nswitch(*(e+1)){\r\ncase's':{\r\nconst char*s=va_arg(argp,char*);\r\nif(s==NULL)s=\"(null)\";\r\npushstr(L,s);\r\nbreak;\r\n}\r\ncase'c':{\r\nchar buff[2];\r\nbuff[0]=cast(char,va_arg(argp,int));\r\nbuff[1]='\\0';\r\npushstr(L,buff);\r\nbreak;\r\n}\r\ncase'd':{\r\nsetnvalue(L->top,cast_num(va_arg(argp,int)));\r\nincr_top(L);\r\nbreak;\r\n}\r\ncase'f':{\r\nsetnvalue(L->top,cast_num(va_arg(argp,l_uacNumber)));\r\nincr_top(L);\r\nbreak;\r\n}\r\ncase'p':{\r\nchar buff[4*sizeof(void*)+8];\r\nsprintf(buff,\"%p\",va_arg(argp,void*));\r\npushstr(L,buff);\r\nbreak;\r\n}\r\ncase'%':{\r\npushstr(L,\"%\");\r\nbreak;\r\n}\r\ndefault:{\r\nchar buff[3];\r\nbuff[0]='%';\r\nbuff[1]=*(e+1);\r\nbuff[2]='\\0';\r\npushstr(L,buff);\r\nbreak;\r\n}\r\n}\r\nn+=2;\r\nfmt=e+2;\r\n}\r\npushstr(L,fmt);\r\nluaV_concat(L,n+1,cast_int(L->top-L->base)-1);\r\nL->top-=n;\r\nreturn svalue(L->top-1);\r\n}\r\nstatic const char*luaO_pushfstring(lua_State*L,const char*fmt,...){\r\nconst char*msg;\r\nva_list argp;\r\nva_start(argp,fmt);\r\nmsg=luaO_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nreturn msg;\r\n}\r\nstatic void luaO_chunkid(char*out,const char*source,size_t bufflen){\r\nif(*source=='='){\r\nstrncpy(out,source+1,bufflen);\r\nout[bufflen-1]='\\0';\r\n}\r\nelse{\r\nif(*source=='@'){\r\nsize_t l;\r\nsource++;\r\nbufflen-=sizeof(\" '...' \");\r\nl=strlen(source);\r\nstrcpy(out,\"\");\r\nif(l>bufflen){\r\nsource+=(l-bufflen);\r\nstrcat(out,\"...\");\r\n}\r\nstrcat(out,source);\r\n}\r\nelse{\r\nsize_t len=strcspn(source,\"\\n\\r\");\r\nbufflen-=sizeof(\" [string \\\"...\\\"] \");\r\nif(len>bufflen)len=bufflen;\r\nstrcpy(out,\"[string \\\"\");\r\nif(source[len]!='\\0'){\r\nstrncat(out,source,len);\r\nstrcat(out,\"...\");\r\n}\r\nelse\r\nstrcat(out,source);\r\nstrcat(out,\"\\\"]\");\r\n}\r\n}\r\n}\r\n#define gnode(t,i)(&(t)->node[i])\r\n#define gkey(n)(&(n)->i_key.nk)\r\n#define gval(n)(&(n)->i_val)\r\n#define gnext(n)((n)->i_key.nk.next)\r\n#define key2tval(n)(&(n)->i_key.tvk)\r\nstatic TValue*luaH_setnum(lua_State*L,Table*t,int key);\r\nstatic const TValue*luaH_getstr(Table*t,TString*key);\r\nstatic TValue*luaH_set(lua_State*L,Table*t,const TValue*key);\r\nstatic const char*const luaT_typenames[]={\r\n\"nil\",\"boolean\",\"userdata\",\"number\",\r\n\"string\",\"table\",\"function\",\"userdata\",\"thread\",\r\n\"proto\",\"upval\"\r\n};\r\nstatic void luaT_init(lua_State*L){\r\nstatic const char*const luaT_eventname[]={\r\n\"__index\",\"__newindex\",\r\n\"__gc\",\"__mode\",\"__eq\",\r\n\"__add\",\"__sub\",\"__mul\",\"__div\",\"__mod\",\r\n\"__pow\",\"__unm\",\"__len\",\"__lt\",\"__le\",\r\n\"__concat\",\"__call\"\r\n};\r\nint i;\r\nfor(i=0;i<TM_N;i++){\r\nG(L)->tmname[i]=luaS_new(L,luaT_eventname[i]);\r\nluaS_fix(G(L)->tmname[i]);\r\n}\r\n}\r\nstatic const TValue*luaT_gettm(Table*events,TMS event,TString*ename){\r\nconst TValue*tm=luaH_getstr(events,ename);\r\nif(ttisnil(tm)){\r\nevents->flags|=cast_byte(1u<<event);\r\nreturn NULL;\r\n}\r\nelse return tm;\r\n}\r\nstatic const TValue*luaT_gettmbyobj(lua_State*L,const TValue*o,TMS event){\r\nTable*mt;\r\nswitch(ttype(o)){\r\ncase 5:\r\nmt=hvalue(o)->metatable;\r\nbreak;\r\ncase 7:\r\nmt=uvalue(o)->metatable;\r\nbreak;\r\ndefault:\r\nmt=G(L)->mt[ttype(o)];\r\n}\r\nreturn(mt?luaH_getstr(mt,G(L)->tmname[event]):(&luaO_nilobject_));\r\n}\r\n#define sizeCclosure(n)(cast(int,sizeof(CClosure))+cast(int,sizeof(TValue)*((n)-1)))\r\n#define sizeLclosure(n)(cast(int,sizeof(LClosure))+cast(int,sizeof(TValue*)*((n)-1)))\r\nstatic Closure*luaF_newCclosure(lua_State*L,int nelems,Table*e){\r\nClosure*c=cast(Closure*,luaM_malloc(L,sizeCclosure(nelems)));\r\nluaC_link(L,obj2gco(c),6);\r\nc->c.isC=1;\r\nc->c.env=e;\r\nc->c.nupvalues=cast_byte(nelems);\r\nreturn c;\r\n}\r\nstatic Closure*luaF_newLclosure(lua_State*L,int nelems,Table*e){\r\nClosure*c=cast(Closure*,luaM_malloc(L,sizeLclosure(nelems)));\r\nluaC_link(L,obj2gco(c),6);\r\nc->l.isC=0;\r\nc->l.env=e;\r\nc->l.nupvalues=cast_byte(nelems);\r\nwhile(nelems--)c->l.upvals[nelems]=NULL;\r\nreturn c;\r\n}\r\nstatic UpVal*luaF_newupval(lua_State*L){\r\nUpVal*uv=luaM_new(L,UpVal);\r\nluaC_link(L,obj2gco(uv),(8+2));\r\nuv->v=&uv->u.value;\r\nsetnilvalue(uv->v);\r\nreturn uv;\r\n}\r\nstatic UpVal*luaF_findupval(lua_State*L,StkId level){\r\nglobal_State*g=G(L);\r\nGCObject**pp=&L->openupval;\r\nUpVal*p;\r\nUpVal*uv;\r\nwhile(*pp!=NULL&&(p=ngcotouv(*pp))->v>=level){\r\nif(p->v==level){\r\nif(isdead(g,obj2gco(p)))\r\nchangewhite(obj2gco(p));\r\nreturn p;\r\n}\r\npp=&p->next;\r\n}\r\nuv=luaM_new(L,UpVal);\r\nuv->tt=(8+2);\r\nuv->marked=luaC_white(g);\r\nuv->v=level;\r\nuv->next=*pp;\r\n*pp=obj2gco(uv);\r\nuv->u.l.prev=&g->uvhead;\r\nuv->u.l.next=g->uvhead.u.l.next;\r\nuv->u.l.next->u.l.prev=uv;\r\ng->uvhead.u.l.next=uv;\r\nreturn uv;\r\n}\r\nstatic void unlinkupval(UpVal*uv){\r\nuv->u.l.next->u.l.prev=uv->u.l.prev;\r\nuv->u.l.prev->u.l.next=uv->u.l.next;\r\n}\r\nstatic void luaF_freeupval(lua_State*L,UpVal*uv){\r\nif(uv->v!=&uv->u.value)\r\nunlinkupval(uv);\r\nluaM_free(L,uv);\r\n}\r\nstatic void luaF_close(lua_State*L,StkId level){\r\nUpVal*uv;\r\nglobal_State*g=G(L);\r\nwhile(L->openupval!=NULL&&(uv=ngcotouv(L->openupval))->v>=level){\r\nGCObject*o=obj2gco(uv);\r\nL->openupval=uv->next;\r\nif(isdead(g,o))\r\nluaF_freeupval(L,uv);\r\nelse{\r\nunlinkupval(uv);\r\nsetobj(L,&uv->u.value,uv->v);\r\nuv->v=&uv->u.value;\r\nluaC_linkupval(L,uv);\r\n}\r\n}\r\n}\r\nstatic Proto*luaF_newproto(lua_State*L){\r\nProto*f=luaM_new(L,Proto);\r\nluaC_link(L,obj2gco(f),(8+1));\r\nf->k=NULL;\r\nf->sizek=0;\r\nf->p=NULL;\r\nf->sizep=0;\r\nf->code=NULL;\r\nf->sizecode=0;\r\nf->sizelineinfo=0;\r\nf->sizeupvalues=0;\r\nf->nups=0;\r\nf->upvalues=NULL;\r\nf->numparams=0;\r\nf->is_vararg=0;\r\nf->maxstacksize=0;\r\nf->lineinfo=NULL;\r\nf->sizelocvars=0;\r\nf->locvars=NULL;\r\nf->linedefined=0;\r\nf->lastlinedefined=0;\r\nf->source=NULL;\r\nreturn f;\r\n}\r\nstatic void luaF_freeproto(lua_State*L,Proto*f){\r\nluaM_freearray(L,f->code,f->sizecode,Instruction);\r\nluaM_freearray(L,f->p,f->sizep,Proto*);\r\nluaM_freearray(L,f->k,f->sizek,TValue);\r\nluaM_freearray(L,f->lineinfo,f->sizelineinfo,int);\r\nluaM_freearray(L,f->locvars,f->sizelocvars,struct LocVar);\r\nluaM_freearray(L,f->upvalues,f->sizeupvalues,TString*);\r\nluaM_free(L,f);\r\n}\r\nstatic void luaF_freeclosure(lua_State*L,Closure*c){\r\nint size=(c->c.isC)?sizeCclosure(c->c.nupvalues):\r\nsizeLclosure(c->l.nupvalues);\r\nluaM_freemem(L,c,size);\r\n}\r\n#define MASK1(n,p)((~((~(Instruction)0)<<n))<<p)\r\n#define MASK0(n,p)(~MASK1(n,p))\r\n#define GET_OPCODE(i)(cast(OpCode,((i)>>0)&MASK1(6,0)))\r\n#define SET_OPCODE(i,o)((i)=(((i)&MASK0(6,0))|((cast(Instruction,o)<<0)&MASK1(6,0))))\r\n#define GETARG_A(i)(cast(int,((i)>>(0+6))&MASK1(8,0)))\r\n#define SETARG_A(i,u)((i)=(((i)&MASK0(8,(0+6)))|((cast(Instruction,u)<<(0+6))&MASK1(8,(0+6)))))\r\n#define GETARG_B(i)(cast(int,((i)>>(((0+6)+8)+9))&MASK1(9,0)))\r\n#define SETARG_B(i,b)((i)=(((i)&MASK0(9,(((0+6)+8)+9)))|((cast(Instruction,b)<<(((0+6)+8)+9))&MASK1(9,(((0+6)+8)+9)))))\r\n#define GETARG_C(i)(cast(int,((i)>>((0+6)+8))&MASK1(9,0)))\r\n#define SETARG_C(i,b)((i)=(((i)&MASK0(9,((0+6)+8)))|((cast(Instruction,b)<<((0+6)+8))&MASK1(9,((0+6)+8)))))\r\n#define GETARG_Bx(i)(cast(int,((i)>>((0+6)+8))&MASK1((9+9),0)))\r\n#define SETARG_Bx(i,b)((i)=(((i)&MASK0((9+9),((0+6)+8)))|((cast(Instruction,b)<<((0+6)+8))&MASK1((9+9),((0+6)+8)))))\r\n#define GETARG_sBx(i)(GETARG_Bx(i)-(((1<<(9+9))-1)>>1))\r\n#define SETARG_sBx(i,b)SETARG_Bx((i),cast(unsigned int,(b)+(((1<<(9+9))-1)>>1)))\r\n#define CREATE_ABC(o,a,b,c)((cast(Instruction,o)<<0)|(cast(Instruction,a)<<(0+6))|(cast(Instruction,b)<<(((0+6)+8)+9))|(cast(Instruction,c)<<((0+6)+8)))\r\n#define CREATE_ABx(o,a,bc)((cast(Instruction,o)<<0)|(cast(Instruction,a)<<(0+6))|(cast(Instruction,bc)<<((0+6)+8)))\r\n#define ISK(x)((x)&(1<<(9-1)))\r\n#define INDEXK(r)((int)(r)&~(1<<(9-1)))\r\n#define RKASK(x)((x)|(1<<(9-1)))\r\nstatic const lu_byte luaP_opmodes[(cast(int,OP_VARARG)+1)];\r\n#define getBMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>4)&3))\r\n#define getCMode(m)(cast(enum OpArgMask,(luaP_opmodes[m]>>2)&3))\r\n#define testTMode(m)(luaP_opmodes[m]&(1<<7))\r\ntypedef struct expdesc{\r\nexpkind k;\r\nunion{\r\nstruct{int info,aux;}s;\r\nlua_Number nval;\r\n}u;\r\nint t;\r\nint f;\r\n}expdesc;\r\ntypedef struct upvaldesc{\r\nlu_byte k;\r\nlu_byte info;\r\n}upvaldesc;\r\nstruct BlockCnt;\r\ntypedef struct FuncState{\r\nProto*f;\r\nTable*h;\r\nstruct FuncState*prev;\r\nstruct LexState*ls;\r\nstruct lua_State*L;\r\nstruct BlockCnt*bl;\r\nint pc;\r\nint lasttarget;\r\nint jpc;\r\nint freereg;\r\nint nk;\r\nint np;\r\nshort nlocvars;\r\nlu_byte nactvar;\r\nupvaldesc upvalues[60];\r\nunsigned short actvar[200];\r\n}FuncState;\r\nstatic Proto*luaY_parser(lua_State*L,ZIO*z,Mbuffer*buff,\r\nconst char*name);\r\nstruct lua_longjmp{\r\nstruct lua_longjmp*previous;\r\njmp_buf b;\r\nvolatile int status;\r\n};\r\nstatic void luaD_seterrorobj(lua_State*L,int errcode,StkId oldtop){\r\nswitch(errcode){\r\ncase 4:{\r\nsetsvalue(L,oldtop,luaS_newliteral(L,\"not enough memory\"));\r\nbreak;\r\n}\r\ncase 5:{\r\nsetsvalue(L,oldtop,luaS_newliteral(L,\"error in error handling\"));\r\nbreak;\r\n}\r\ncase 3:\r\ncase 2:{\r\nsetobj(L,oldtop,L->top-1);\r\nbreak;\r\n}\r\n}\r\nL->top=oldtop+1;\r\n}\r\nstatic void restore_stack_limit(lua_State*L){\r\nif(L->size_ci>20000){\r\nint inuse=cast_int(L->ci-L->base_ci);\r\nif(inuse+1<20000)\r\nluaD_reallocCI(L,20000);\r\n}\r\n}\r\nstatic void resetstack(lua_State*L,int status){\r\nL->ci=L->base_ci;\r\nL->base=L->ci->base;\r\nluaF_close(L,L->base);\r\nluaD_seterrorobj(L,status,L->base);\r\nL->nCcalls=L->baseCcalls;\r\nL->allowhook=1;\r\nrestore_stack_limit(L);\r\nL->errfunc=0;\r\nL->errorJmp=NULL;\r\n}\r\nstatic void luaD_throw(lua_State*L,int errcode){\r\nif(L->errorJmp){\r\nL->errorJmp->status=errcode;\r\nLUAI_THROW(L,L->errorJmp);\r\n}\r\nelse{\r\nL->status=cast_byte(errcode);\r\nif(G(L)->panic){\r\nresetstack(L,errcode);\r\nG(L)->panic(L);\r\n}\r\nexit(EXIT_FAILURE);\r\n}\r\n}\r\nstatic int luaD_rawrunprotected(lua_State*L,Pfunc f,void*ud){\r\nstruct lua_longjmp lj;\r\nlj.status=0;\r\nlj.previous=L->errorJmp;\r\nL->errorJmp=&lj;\r\nLUAI_TRY(L,&lj,\r\n(*f)(L,ud);\r\n);\r\nL->errorJmp=lj.previous;\r\nreturn lj.status;\r\n}\r\nstatic void correctstack(lua_State*L,TValue*oldstack){\r\nCallInfo*ci;\r\nGCObject*up;\r\nL->top=(L->top-oldstack)+L->stack;\r\nfor(up=L->openupval;up!=NULL;up=up->gch.next)\r\ngco2uv(up)->v=(gco2uv(up)->v-oldstack)+L->stack;\r\nfor(ci=L->base_ci;ci<=L->ci;ci++){\r\nci->top=(ci->top-oldstack)+L->stack;\r\nci->base=(ci->base-oldstack)+L->stack;\r\nci->func=(ci->func-oldstack)+L->stack;\r\n}\r\nL->base=(L->base-oldstack)+L->stack;\r\n}\r\nstatic void luaD_reallocstack(lua_State*L,int newsize){\r\nTValue*oldstack=L->stack;\r\nint realsize=newsize+1+5;\r\nluaM_reallocvector(L,L->stack,L->stacksize,realsize,TValue);\r\nL->stacksize=realsize;\r\nL->stack_last=L->stack+newsize;\r\ncorrectstack(L,oldstack);\r\n}\r\nstatic void luaD_reallocCI(lua_State*L,int newsize){\r\nCallInfo*oldci=L->base_ci;\r\nluaM_reallocvector(L,L->base_ci,L->size_ci,newsize,CallInfo);\r\nL->size_ci=newsize;\r\nL->ci=(L->ci-oldci)+L->base_ci;\r\nL->end_ci=L->base_ci+L->size_ci-1;\r\n}\r\nstatic void luaD_growstack(lua_State*L,int n){\r\nif(n<=L->stacksize)\r\nluaD_reallocstack(L,2*L->stacksize);\r\nelse\r\nluaD_reallocstack(L,L->stacksize+n);\r\n}\r\nstatic CallInfo*growCI(lua_State*L){\r\nif(L->size_ci>20000)\r\nluaD_throw(L,5);\r\nelse{\r\nluaD_reallocCI(L,2*L->size_ci);\r\nif(L->size_ci>20000)\r\nluaG_runerror(L,\"stack overflow\");\r\n}\r\nreturn++L->ci;\r\n}\r\nstatic StkId adjust_varargs(lua_State*L,Proto*p,int actual){\r\nint i;\r\nint nfixargs=p->numparams;\r\nTable*htab=NULL;\r\nStkId base,fixed;\r\nfor(;actual<nfixargs;++actual)\r\nsetnilvalue(L->top++);\r\nfixed=L->top-actual;\r\nbase=L->top;\r\nfor(i=0;i<nfixargs;i++){\r\nsetobj(L,L->top++,fixed+i);\r\nsetnilvalue(fixed+i);\r\n}\r\nif(htab){\r\nsethvalue(L,L->top++,htab);\r\n}\r\nreturn base;\r\n}\r\nstatic StkId tryfuncTM(lua_State*L,StkId func){\r\nconst TValue*tm=luaT_gettmbyobj(L,func,TM_CALL);\r\nStkId p;\r\nptrdiff_t funcr=savestack(L,func);\r\nif(!ttisfunction(tm))\r\nluaG_typeerror(L,func,\"call\");\r\nfor(p=L->top;p>func;p--)setobj(L,p,p-1);\r\nincr_top(L);\r\nfunc=restorestack(L,funcr);\r\nsetobj(L,func,tm);\r\nreturn func;\r\n}\r\n#define inc_ci(L)((L->ci==L->end_ci)?growCI(L):(condhardstacktests(luaD_reallocCI(L,L->size_ci)),++L->ci))\r\nstatic int luaD_precall(lua_State*L,StkId func,int nresults){\r\nLClosure*cl;\r\nptrdiff_t funcr;\r\nif(!ttisfunction(func))\r\nfunc=tryfuncTM(L,func);\r\nfuncr=savestack(L,func);\r\ncl=&clvalue(func)->l;\r\nL->ci->savedpc=L->savedpc;\r\nif(!cl->isC){\r\nCallInfo*ci;\r\nStkId st,base;\r\nProto*p=cl->p;\r\nluaD_checkstack(L,p->maxstacksize);\r\nfunc=restorestack(L,funcr);\r\nif(!p->is_vararg){\r\nbase=func+1;\r\nif(L->top>base+p->numparams)\r\nL->top=base+p->numparams;\r\n}\r\nelse{\r\nint nargs=cast_int(L->top-func)-1;\r\nbase=adjust_varargs(L,p,nargs);\r\nfunc=restorestack(L,funcr);\r\n}\r\nci=inc_ci(L);\r\nci->func=func;\r\nL->base=ci->base=base;\r\nci->top=L->base+p->maxstacksize;\r\nL->savedpc=p->code;\r\nci->tailcalls=0;\r\nci->nresults=nresults;\r\nfor(st=L->top;st<ci->top;st++)\r\nsetnilvalue(st);\r\nL->top=ci->top;\r\nreturn 0;\r\n}\r\nelse{\r\nCallInfo*ci;\r\nint n;\r\nluaD_checkstack(L,20);\r\nci=inc_ci(L);\r\nci->func=restorestack(L,funcr);\r\nL->base=ci->base=ci->func+1;\r\nci->top=L->top+20;\r\nci->nresults=nresults;\r\nn=(*curr_func(L)->c.f)(L);\r\nif(n<0)\r\nreturn 2;\r\nelse{\r\nluaD_poscall(L,L->top-n);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nstatic int luaD_poscall(lua_State*L,StkId firstResult){\r\nStkId res;\r\nint wanted,i;\r\nCallInfo*ci;\r\nci=L->ci--;\r\nres=ci->func;\r\nwanted=ci->nresults;\r\nL->base=(ci-1)->base;\r\nL->savedpc=(ci-1)->savedpc;\r\nfor(i=wanted;i!=0&&firstResult<L->top;i--)\r\nsetobj(L,res++,firstResult++);\r\nwhile(i-->0)\r\nsetnilvalue(res++);\r\nL->top=res;\r\nreturn(wanted-(-1));\r\n}\r\nstatic void luaD_call(lua_State*L,StkId func,int nResults){\r\nif(++L->nCcalls>=200){\r\nif(L->nCcalls==200)\r\nluaG_runerror(L,\"C stack overflow\");\r\nelse if(L->nCcalls>=(200+(200>>3)))\r\nluaD_throw(L,5);\r\n}\r\nif(luaD_precall(L,func,nResults)==0)\r\nluaV_execute(L,1);\r\nL->nCcalls--;\r\nluaC_checkGC(L);\r\n}\r\nstatic int luaD_pcall(lua_State*L,Pfunc func,void*u,\r\nptrdiff_t old_top,ptrdiff_t ef){\r\nint status;\r\nunsigned short oldnCcalls=L->nCcalls;\r\nptrdiff_t old_ci=saveci(L,L->ci);\r\nlu_byte old_allowhooks=L->allowhook;\r\nptrdiff_t old_errfunc=L->errfunc;\r\nL->errfunc=ef;\r\nstatus=luaD_rawrunprotected(L,func,u);\r\nif(status!=0){\r\nStkId oldtop=restorestack(L,old_top);\r\nluaF_close(L,oldtop);\r\nluaD_seterrorobj(L,status,oldtop);\r\nL->nCcalls=oldnCcalls;\r\nL->ci=restoreci(L,old_ci);\r\nL->base=L->ci->base;\r\nL->savedpc=L->ci->savedpc;\r\nL->allowhook=old_allowhooks;\r\nrestore_stack_limit(L);\r\n}\r\nL->errfunc=old_errfunc;\r\nreturn status;\r\n}\r\nstruct SParser{\r\nZIO*z;\r\nMbuffer buff;\r\nconst char*name;\r\n};\r\nstatic void f_parser(lua_State*L,void*ud){\r\nint i;\r\nProto*tf;\r\nClosure*cl;\r\nstruct SParser*p=cast(struct SParser*,ud);\r\nluaC_checkGC(L);\r\ntf=luaY_parser(L,p->z,\r\n&p->buff,p->name);\r\ncl=luaF_newLclosure(L,tf->nups,hvalue(gt(L)));\r\ncl->l.p=tf;\r\nfor(i=0;i<tf->nups;i++)\r\ncl->l.upvals[i]=luaF_newupval(L);\r\nsetclvalue(L,L->top,cl);\r\nincr_top(L);\r\n}\r\nstatic int luaD_protectedparser(lua_State*L,ZIO*z,const char*name){\r\nstruct SParser p;\r\nint status;\r\np.z=z;p.name=name;\r\nluaZ_initbuffer(L,&p.buff);\r\nstatus=luaD_pcall(L,f_parser,&p,savestack(L,L->top),L->errfunc);\r\nluaZ_freebuffer(L,&p.buff);\r\nreturn status;\r\n}\r\nstatic void luaS_resize(lua_State*L,int newsize){\r\nGCObject**newhash;\r\nstringtable*tb;\r\nint i;\r\nif(G(L)->gcstate==2)\r\nreturn;\r\nnewhash=luaM_newvector(L,newsize,GCObject*);\r\ntb=&G(L)->strt;\r\nfor(i=0;i<newsize;i++)newhash[i]=NULL;\r\nfor(i=0;i<tb->size;i++){\r\nGCObject*p=tb->hash[i];\r\nwhile(p){\r\nGCObject*next=p->gch.next;\r\nunsigned int h=gco2ts(p)->hash;\r\nint h1=lmod(h,newsize);\r\np->gch.next=newhash[h1];\r\nnewhash[h1]=p;\r\np=next;\r\n}\r\n}\r\nluaM_freearray(L,tb->hash,tb->size,TString*);\r\ntb->size=newsize;\r\ntb->hash=newhash;\r\n}\r\nstatic TString*newlstr(lua_State*L,const char*str,size_t l,\r\nunsigned int h){\r\nTString*ts;\r\nstringtable*tb;\r\nif(l+1>(((size_t)(~(size_t)0)-2)-sizeof(TString))/sizeof(char))\r\nluaM_toobig(L);\r\nts=cast(TString*,luaM_malloc(L,(l+1)*sizeof(char)+sizeof(TString)));\r\nts->tsv.len=l;\r\nts->tsv.hash=h;\r\nts->tsv.marked=luaC_white(G(L));\r\nts->tsv.tt=4;\r\nts->tsv.reserved=0;\r\nmemcpy(ts+1,str,l*sizeof(char));\r\n((char*)(ts+1))[l]='\\0';\r\ntb=&G(L)->strt;\r\nh=lmod(h,tb->size);\r\nts->tsv.next=tb->hash[h];\r\ntb->hash[h]=obj2gco(ts);\r\ntb->nuse++;\r\nif(tb->nuse>cast(lu_int32,tb->size)&&tb->size<=(INT_MAX-2)/2)\r\nluaS_resize(L,tb->size*2);\r\nreturn ts;\r\n}\r\nstatic TString*luaS_newlstr(lua_State*L,const char*str,size_t l){\r\nGCObject*o;\r\nunsigned int h=cast(unsigned int,l);\r\nsize_t step=(l>>5)+1;\r\nsize_t l1;\r\nfor(l1=l;l1>=step;l1-=step)\r\nh=h^((h<<5)+(h>>2)+cast(unsigned char,str[l1-1]));\r\nfor(o=G(L)->strt.hash[lmod(h,G(L)->strt.size)];\r\no!=NULL;\r\no=o->gch.next){\r\nTString*ts=rawgco2ts(o);\r\nif(ts->tsv.len==l&&(memcmp(str,getstr(ts),l)==0)){\r\nif(isdead(G(L),o))changewhite(o);\r\nreturn ts;\r\n}\r\n}\r\nreturn newlstr(L,str,l,h);\r\n}\r\nstatic Udata*luaS_newudata(lua_State*L,size_t s,Table*e){\r\nUdata*u;\r\nif(s>((size_t)(~(size_t)0)-2)-sizeof(Udata))\r\nluaM_toobig(L);\r\nu=cast(Udata*,luaM_malloc(L,s+sizeof(Udata)));\r\nu->uv.marked=luaC_white(G(L));\r\nu->uv.tt=7;\r\nu->uv.len=s;\r\nu->uv.metatable=NULL;\r\nu->uv.env=e;\r\nu->uv.next=G(L)->mainthread->next;\r\nG(L)->mainthread->next=obj2gco(u);\r\nreturn u;\r\n}\r\n#define hashpow2(t,n)(gnode(t,lmod((n),sizenode(t))))\r\n#define hashstr(t,str)hashpow2(t,(str)->tsv.hash)\r\n#define hashboolean(t,p)hashpow2(t,p)\r\n#define hashmod(t,n)(gnode(t,((n)%((sizenode(t)-1)|1))))\r\n#define hashpointer(t,p)hashmod(t,IntPoint(p))\r\nstatic const Node dummynode_={\r\n{{NULL},0},\r\n{{{NULL},0,NULL}}\r\n};\r\nstatic Node*hashnum(const Table*t,lua_Number n){\r\nunsigned int a[cast_int(sizeof(lua_Number)/sizeof(int))];\r\nint i;\r\nif(luai_numeq(n,0))\r\nreturn gnode(t,0);\r\nmemcpy(a,&n,sizeof(a));\r\nfor(i=1;i<cast_int(sizeof(lua_Number)/sizeof(int));i++)a[0]+=a[i];\r\nreturn hashmod(t,a[0]);\r\n}\r\nstatic Node*mainposition(const Table*t,const TValue*key){\r\nswitch(ttype(key)){\r\ncase 3:\r\nreturn hashnum(t,nvalue(key));\r\ncase 4:\r\nreturn hashstr(t,rawtsvalue(key));\r\ncase 1:\r\nreturn hashboolean(t,bvalue(key));\r\ncase 2:\r\nreturn hashpointer(t,pvalue(key));\r\ndefault:\r\nreturn hashpointer(t,gcvalue(key));\r\n}\r\n}\r\nstatic int arrayindex(const TValue*key){\r\nif(ttisnumber(key)){\r\nlua_Number n=nvalue(key);\r\nint k;\r\nlua_number2int(k,n);\r\nif(luai_numeq(cast_num(k),n))\r\nreturn k;\r\n}\r\nreturn-1;\r\n}\r\nstatic int findindex(lua_State*L,Table*t,StkId key){\r\nint i;\r\nif(ttisnil(key))return-1;\r\ni=arrayindex(key);\r\nif(0<i&&i<=t->sizearray)\r\nreturn i-1;\r\nelse{\r\nNode*n=mainposition(t,key);\r\ndo{\r\nif(luaO_rawequalObj(key2tval(n),key)||\r\n(ttype(gkey(n))==(8+3)&&iscollectable(key)&&\r\ngcvalue(gkey(n))==gcvalue(key))){\r\ni=cast_int(n-gnode(t,0));\r\nreturn i+t->sizearray;\r\n}\r\nelse n=gnext(n);\r\n}while(n);\r\nluaG_runerror(L,\"invalid key to \"LUA_QL(\"next\"));\r\nreturn 0;\r\n}\r\n}\r\nstatic int luaH_next(lua_State*L,Table*t,StkId key){\r\nint i=findindex(L,t,key);\r\nfor(i++;i<t->sizearray;i++){\r\nif(!ttisnil(&t->array[i])){\r\nsetnvalue(key,cast_num(i+1));\r\nsetobj(L,key+1,&t->array[i]);\r\nreturn 1;\r\n}\r\n}\r\nfor(i-=t->sizearray;i<(int)sizenode(t);i++){\r\nif(!ttisnil(gval(gnode(t,i)))){\r\nsetobj(L,key,key2tval(gnode(t,i)));\r\nsetobj(L,key+1,gval(gnode(t,i)));\r\nreturn 1;\r\n}\r\n}\r\nreturn 0;\r\n}\r\nstatic int computesizes(int nums[],int*narray){\r\nint i;\r\nint twotoi;\r\nint a=0;\r\nint na=0;\r\nint n=0;\r\nfor(i=0,twotoi=1;twotoi/2<*narray;i++,twotoi*=2){\r\nif(nums[i]>0){\r\na+=nums[i];\r\nif(a>twotoi/2){\r\nn=twotoi;\r\nna=a;\r\n}\r\n}\r\nif(a==*narray)break;\r\n}\r\n*narray=n;\r\nreturn na;\r\n}\r\nstatic int countint(const TValue*key,int*nums){\r\nint k=arrayindex(key);\r\nif(0<k&&k<=(1<<(32-2))){\r\nnums[ceillog2(k)]++;\r\nreturn 1;\r\n}\r\nelse\r\nreturn 0;\r\n}\r\nstatic int numusearray(const Table*t,int*nums){\r\nint lg;\r\nint ttlg;\r\nint ause=0;\r\nint i=1;\r\nfor(lg=0,ttlg=1;lg<=(32-2);lg++,ttlg*=2){\r\nint lc=0;\r\nint lim=ttlg;\r\nif(lim>t->sizearray){\r\nlim=t->sizearray;\r\nif(i>lim)\r\nbreak;\r\n}\r\nfor(;i<=lim;i++){\r\nif(!ttisnil(&t->array[i-1]))\r\nlc++;\r\n}\r\nnums[lg]+=lc;\r\nause+=lc;\r\n}\r\nreturn ause;\r\n}\r\nstatic int numusehash(const Table*t,int*nums,int*pnasize){\r\nint totaluse=0;\r\nint ause=0;\r\nint i=sizenode(t);\r\nwhile(i--){\r\nNode*n=&t->node[i];\r\nif(!ttisnil(gval(n))){\r\nause+=countint(key2tval(n),nums);\r\ntotaluse++;\r\n}\r\n}\r\n*pnasize+=ause;\r\nreturn totaluse;\r\n}\r\nstatic void setarrayvector(lua_State*L,Table*t,int size){\r\nint i;\r\nluaM_reallocvector(L,t->array,t->sizearray,size,TValue);\r\nfor(i=t->sizearray;i<size;i++)\r\nsetnilvalue(&t->array[i]);\r\nt->sizearray=size;\r\n}\r\nstatic void setnodevector(lua_State*L,Table*t,int size){\r\nint lsize;\r\nif(size==0){\r\nt->node=cast(Node*,(&dummynode_));\r\nlsize=0;\r\n}\r\nelse{\r\nint i;\r\nlsize=ceillog2(size);\r\nif(lsize>(32-2))\r\nluaG_runerror(L,\"table overflow\");\r\nsize=twoto(lsize);\r\nt->node=luaM_newvector(L,size,Node);\r\nfor(i=0;i<size;i++){\r\nNode*n=gnode(t,i);\r\ngnext(n)=NULL;\r\nsetnilvalue(gkey(n));\r\nsetnilvalue(gval(n));\r\n}\r\n}\r\nt->lsizenode=cast_byte(lsize);\r\nt->lastfree=gnode(t,size);\r\n}\r\nstatic void resize(lua_State*L,Table*t,int nasize,int nhsize){\r\nint i;\r\nint oldasize=t->sizearray;\r\nint oldhsize=t->lsizenode;\r\nNode*nold=t->node;\r\nif(nasize>oldasize)\r\nsetarrayvector(L,t,nasize);\r\nsetnodevector(L,t,nhsize);\r\nif(nasize<oldasize){\r\nt->sizearray=nasize;\r\nfor(i=nasize;i<oldasize;i++){\r\nif(!ttisnil(&t->array[i]))\r\nsetobj(L,luaH_setnum(L,t,i+1),&t->array[i]);\r\n}\r\nluaM_reallocvector(L,t->array,oldasize,nasize,TValue);\r\n}\r\nfor(i=twoto(oldhsize)-1;i>=0;i--){\r\nNode*old=nold+i;\r\nif(!ttisnil(gval(old)))\r\nsetobj(L,luaH_set(L,t,key2tval(old)),gval(old));\r\n}\r\nif(nold!=(&dummynode_))\r\nluaM_freearray(L,nold,twoto(oldhsize),Node);\r\n}\r\nstatic void luaH_resizearray(lua_State*L,Table*t,int nasize){\r\nint nsize=(t->node==(&dummynode_))?0:sizenode(t);\r\nresize(L,t,nasize,nsize);\r\n}\r\nstatic void rehash(lua_State*L,Table*t,const TValue*ek){\r\nint nasize,na;\r\nint nums[(32-2)+1];\r\nint i;\r\nint totaluse;\r\nfor(i=0;i<=(32-2);i++)nums[i]=0;\r\nnasize=numusearray(t,nums);\r\ntotaluse=nasize;\r\ntotaluse+=numusehash(t,nums,&nasize);\r\nnasize+=countint(ek,nums);\r\ntotaluse++;\r\nna=computesizes(nums,&nasize);\r\nresize(L,t,nasize,totaluse-na);\r\n}\r\nstatic Table*luaH_new(lua_State*L,int narray,int nhash){\r\nTable*t=luaM_new(L,Table);\r\nluaC_link(L,obj2gco(t),5);\r\nt->metatable=NULL;\r\nt->flags=cast_byte(~0);\r\nt->array=NULL;\r\nt->sizearray=0;\r\nt->lsizenode=0;\r\nt->node=cast(Node*,(&dummynode_));\r\nsetarrayvector(L,t,narray);\r\nsetnodevector(L,t,nhash);\r\nreturn t;\r\n}\r\nstatic void luaH_free(lua_State*L,Table*t){\r\nif(t->node!=(&dummynode_))\r\nluaM_freearray(L,t->node,sizenode(t),Node);\r\nluaM_freearray(L,t->array,t->sizearray,TValue);\r\nluaM_free(L,t);\r\n}\r\nstatic Node*getfreepos(Table*t){\r\nwhile(t->lastfree-->t->node){\r\nif(ttisnil(gkey(t->lastfree)))\r\nreturn t->lastfree;\r\n}\r\nreturn NULL;\r\n}\r\nstatic TValue*newkey(lua_State*L,Table*t,const TValue*key){\r\nNode*mp=mainposition(t,key);\r\nif(!ttisnil(gval(mp))||mp==(&dummynode_)){\r\nNode*othern;\r\nNode*n=getfreepos(t);\r\nif(n==NULL){\r\nrehash(L,t,key);\r\nreturn luaH_set(L,t,key);\r\n}\r\nothern=mainposition(t,key2tval(mp));\r\nif(othern!=mp){\r\nwhile(gnext(othern)!=mp)othern=gnext(othern);\r\ngnext(othern)=n;\r\n*n=*mp;\r\ngnext(mp)=NULL;\r\nsetnilvalue(gval(mp));\r\n}\r\nelse{\r\ngnext(n)=gnext(mp);\r\ngnext(mp)=n;\r\nmp=n;\r\n}\r\n}\r\ngkey(mp)->value=key->value;gkey(mp)->tt=key->tt;\r\nluaC_barriert(L,t,key);\r\nreturn gval(mp);\r\n}\r\nstatic const TValue*luaH_getnum(Table*t,int key){\r\nif(cast(unsigned int,key-1)<cast(unsigned int,t->sizearray))\r\nreturn&t->array[key-1];\r\nelse{\r\nlua_Number nk=cast_num(key);\r\nNode*n=hashnum(t,nk);\r\ndo{\r\nif(ttisnumber(gkey(n))&&luai_numeq(nvalue(gkey(n)),nk))\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\n}\r\nstatic const TValue*luaH_getstr(Table*t,TString*key){\r\nNode*n=hashstr(t,key);\r\ndo{\r\nif(ttisstring(gkey(n))&&rawtsvalue(gkey(n))==key)\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\nstatic const TValue*luaH_get(Table*t,const TValue*key){\r\nswitch(ttype(key)){\r\ncase 0:return(&luaO_nilobject_);\r\ncase 4:return luaH_getstr(t,rawtsvalue(key));\r\ncase 3:{\r\nint k;\r\nlua_Number n=nvalue(key);\r\nlua_number2int(k,n);\r\nif(luai_numeq(cast_num(k),nvalue(key)))\r\nreturn luaH_getnum(t,k);\r\n}\r\ndefault:{\r\nNode*n=mainposition(t,key);\r\ndo{\r\nif(luaO_rawequalObj(key2tval(n),key))\r\nreturn gval(n);\r\nelse n=gnext(n);\r\n}while(n);\r\nreturn(&luaO_nilobject_);\r\n}\r\n}\r\n}\r\nstatic TValue*luaH_set(lua_State*L,Table*t,const TValue*key){\r\nconst TValue*p=luaH_get(t,key);\r\nt->flags=0;\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nif(ttisnil(key))luaG_runerror(L,\"table index is nil\");\r\nelse if(ttisnumber(key)&&luai_numisnan(nvalue(key)))\r\nluaG_runerror(L,\"table index is NaN\");\r\nreturn newkey(L,t,key);\r\n}\r\n}\r\nstatic TValue*luaH_setnum(lua_State*L,Table*t,int key){\r\nconst TValue*p=luaH_getnum(t,key);\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nTValue k;\r\nsetnvalue(&k,cast_num(key));\r\nreturn newkey(L,t,&k);\r\n}\r\n}\r\nstatic TValue*luaH_setstr(lua_State*L,Table*t,TString*key){\r\nconst TValue*p=luaH_getstr(t,key);\r\nif(p!=(&luaO_nilobject_))\r\nreturn cast(TValue*,p);\r\nelse{\r\nTValue k;\r\nsetsvalue(L,&k,key);\r\nreturn newkey(L,t,&k);\r\n}\r\n}\r\nstatic int unbound_search(Table*t,unsigned int j){\r\nunsigned int i=j;\r\nj++;\r\nwhile(!ttisnil(luaH_getnum(t,j))){\r\ni=j;\r\nj*=2;\r\nif(j>cast(unsigned int,(INT_MAX-2))){\r\ni=1;\r\nwhile(!ttisnil(luaH_getnum(t,i)))i++;\r\nreturn i-1;\r\n}\r\n}\r\nwhile(j-i>1){\r\nunsigned int m=(i+j)/2;\r\nif(ttisnil(luaH_getnum(t,m)))j=m;\r\nelse i=m;\r\n}\r\nreturn i;\r\n}\r\nstatic int luaH_getn(Table*t){\r\nunsigned int j=t->sizearray;\r\nif(j>0&&ttisnil(&t->array[j-1])){\r\nunsigned int i=0;\r\nwhile(j-i>1){\r\nunsigned int m=(i+j)/2;\r\nif(ttisnil(&t->array[m-1]))j=m;\r\nelse i=m;\r\n}\r\nreturn i;\r\n}\r\nelse if(t->node==(&dummynode_))\r\nreturn j;\r\nelse return unbound_search(t,j);\r\n}\r\n#define makewhite(g,x)((x)->gch.marked=cast_byte(((x)->gch.marked&cast_byte(~(bitmask(2)|bit2mask(0,1))))|luaC_white(g)))\r\n#define white2gray(x)reset2bits((x)->gch.marked,0,1)\r\n#define black2gray(x)resetbit((x)->gch.marked,2)\r\n#define stringmark(s)reset2bits((s)->tsv.marked,0,1)\r\n#define isfinalized(u)testbit((u)->marked,3)\r\n#define markfinalized(u)l_setbit((u)->marked,3)\r\n#define markvalue(g,o){checkconsistency(o);if(iscollectable(o)&&iswhite(gcvalue(o)))reallymarkobject(g,gcvalue(o));}\r\n#define markobject(g,t){if(iswhite(obj2gco(t)))reallymarkobject(g,obj2gco(t));}\r\n#define setthreshold(g)(g->GCthreshold=(g->estimate/100)*g->gcpause)\r\nstatic void removeentry(Node*n){\r\nif(iscollectable(gkey(n)))\r\nsetttype(gkey(n),(8+3));\r\n}\r\nstatic void reallymarkobject(global_State*g,GCObject*o){\r\nwhite2gray(o);\r\nswitch(o->gch.tt){\r\ncase 4:{\r\nreturn;\r\n}\r\ncase 7:{\r\nTable*mt=gco2u(o)->metatable;\r\ngray2black(o);\r\nif(mt)markobject(g,mt);\r\nmarkobject(g,gco2u(o)->env);\r\nreturn;\r\n}\r\ncase(8+2):{\r\nUpVal*uv=gco2uv(o);\r\nmarkvalue(g,uv->v);\r\nif(uv->v==&uv->u.value)\r\ngray2black(o);\r\nreturn;\r\n}\r\ncase 6:{\r\ngco2cl(o)->c.gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase 5:{\r\ngco2h(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase 8:{\r\ngco2th(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ncase(8+1):{\r\ngco2p(o)->gclist=g->gray;\r\ng->gray=o;\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\nstatic void marktmu(global_State*g){\r\nGCObject*u=g->tmudata;\r\nif(u){\r\ndo{\r\nu=u->gch.next;\r\nmakewhite(g,u);\r\nreallymarkobject(g,u);\r\n}while(u!=g->tmudata);\r\n}\r\n}\r\nstatic size_t luaC_separateudata(lua_State*L,int all){\r\nglobal_State*g=G(L);\r\nsize_t deadmem=0;\r\nGCObject**p=&g->mainthread->next;\r\nGCObject*curr;\r\nwhile((curr=*p)!=NULL){\r\nif(!(iswhite(curr)||all)||isfinalized(gco2u(curr)))\r\np=&curr->gch.next;\r\nelse if(fasttm(L,gco2u(curr)->metatable,TM_GC)==NULL){\r\nmarkfinalized(gco2u(curr));\r\np=&curr->gch.next;\r\n}\r\nelse{\r\ndeadmem+=sizeudata(gco2u(curr));\r\nmarkfinalized(gco2u(curr));\r\n*p=curr->gch.next;\r\nif(g->tmudata==NULL)\r\ng->tmudata=curr->gch.next=curr;\r\nelse{\r\ncurr->gch.next=g->tmudata->gch.next;\r\ng->tmudata->gch.next=curr;\r\ng->tmudata=curr;\r\n}\r\n}\r\n}\r\nreturn deadmem;\r\n}\r\nstatic int traversetable(global_State*g,Table*h){\r\nint i;\r\nint weakkey=0;\r\nint weakvalue=0;\r\nconst TValue*mode;\r\nif(h->metatable)\r\nmarkobject(g,h->metatable);\r\nmode=gfasttm(g,h->metatable,TM_MODE);\r\nif(mode&&ttisstring(mode)){\r\nweakkey=(strchr(svalue(mode),'k')!=NULL);\r\nweakvalue=(strchr(svalue(mode),'v')!=NULL);\r\nif(weakkey||weakvalue){\r\nh->marked&=~(bitmask(3)|bitmask(4));\r\nh->marked|=cast_byte((weakkey<<3)|\r\n(weakvalue<<4));\r\nh->gclist=g->weak;\r\ng->weak=obj2gco(h);\r\n}\r\n}\r\nif(weakkey&&weakvalue)return 1;\r\nif(!weakvalue){\r\ni=h->sizearray;\r\nwhile(i--)\r\nmarkvalue(g,&h->array[i]);\r\n}\r\ni=sizenode(h);\r\nwhile(i--){\r\nNode*n=gnode(h,i);\r\nif(ttisnil(gval(n)))\r\nremoveentry(n);\r\nelse{\r\nif(!weakkey)markvalue(g,gkey(n));\r\nif(!weakvalue)markvalue(g,gval(n));\r\n}\r\n}\r\nreturn weakkey||weakvalue;\r\n}\r\nstatic void traverseproto(global_State*g,Proto*f){\r\nint i;\r\nif(f->source)stringmark(f->source);\r\nfor(i=0;i<f->sizek;i++)\r\nmarkvalue(g,&f->k[i]);\r\nfor(i=0;i<f->sizeupvalues;i++){\r\nif(f->upvalues[i])\r\nstringmark(f->upvalues[i]);\r\n}\r\nfor(i=0;i<f->sizep;i++){\r\nif(f->p[i])\r\nmarkobject(g,f->p[i]);\r\n}\r\nfor(i=0;i<f->sizelocvars;i++){\r\nif(f->locvars[i].varname)\r\nstringmark(f->locvars[i].varname);\r\n}\r\n}\r\nstatic void traverseclosure(global_State*g,Closure*cl){\r\nmarkobject(g,cl->c.env);\r\nif(cl->c.isC){\r\nint i;\r\nfor(i=0;i<cl->c.nupvalues;i++)\r\nmarkvalue(g,&cl->c.upvalue[i]);\r\n}\r\nelse{\r\nint i;\r\nmarkobject(g,cl->l.p);\r\nfor(i=0;i<cl->l.nupvalues;i++)\r\nmarkobject(g,cl->l.upvals[i]);\r\n}\r\n}\r\nstatic void checkstacksizes(lua_State*L,StkId max){\r\nint ci_used=cast_int(L->ci-L->base_ci);\r\nint s_used=cast_int(max-L->stack);\r\nif(L->size_ci>20000)\r\nreturn;\r\nif(4*ci_used<L->size_ci&&2*8<L->size_ci)\r\nluaD_reallocCI(L,L->size_ci/2);\r\ncondhardstacktests(luaD_reallocCI(L,ci_used+1));\r\nif(4*s_used<L->stacksize&&\r\n2*((2*20)+5)<L->stacksize)\r\nluaD_reallocstack(L,L->stacksize/2);\r\ncondhardstacktests(luaD_reallocstack(L,s_used));\r\n}\r\nstatic void traversestack(global_State*g,lua_State*l){\r\nStkId o,lim;\r\nCallInfo*ci;\r\nmarkvalue(g,gt(l));\r\nlim=l->top;\r\nfor(ci=l->base_ci;ci<=l->ci;ci++){\r\nif(lim<ci->top)lim=ci->top;\r\n}\r\nfor(o=l->stack;o<l->top;o++)\r\nmarkvalue(g,o);\r\nfor(;o<=lim;o++)\r\nsetnilvalue(o);\r\ncheckstacksizes(l,lim);\r\n}\r\nstatic l_mem propagatemark(global_State*g){\r\nGCObject*o=g->gray;\r\ngray2black(o);\r\nswitch(o->gch.tt){\r\ncase 5:{\r\nTable*h=gco2h(o);\r\ng->gray=h->gclist;\r\nif(traversetable(g,h))\r\nblack2gray(o);\r\nreturn sizeof(Table)+sizeof(TValue)*h->sizearray+\r\nsizeof(Node)*sizenode(h);\r\n}\r\ncase 6:{\r\nClosure*cl=gco2cl(o);\r\ng->gray=cl->c.gclist;\r\ntraverseclosure(g,cl);\r\nreturn(cl->c.isC)?sizeCclosure(cl->c.nupvalues):\r\nsizeLclosure(cl->l.nupvalues);\r\n}\r\ncase 8:{\r\nlua_State*th=gco2th(o);\r\ng->gray=th->gclist;\r\nth->gclist=g->grayagain;\r\ng->grayagain=o;\r\nblack2gray(o);\r\ntraversestack(g,th);\r\nreturn sizeof(lua_State)+sizeof(TValue)*th->stacksize+\r\nsizeof(CallInfo)*th->size_ci;\r\n}\r\ncase(8+1):{\r\nProto*p=gco2p(o);\r\ng->gray=p->gclist;\r\ntraverseproto(g,p);\r\nreturn sizeof(Proto)+sizeof(Instruction)*p->sizecode+\r\nsizeof(Proto*)*p->sizep+\r\nsizeof(TValue)*p->sizek+\r\nsizeof(int)*p->sizelineinfo+\r\nsizeof(LocVar)*p->sizelocvars+\r\nsizeof(TString*)*p->sizeupvalues;\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic size_t propagateall(global_State*g){\r\nsize_t m=0;\r\nwhile(g->gray)m+=propagatemark(g);\r\nreturn m;\r\n}\r\nstatic int iscleared(const TValue*o,int iskey){\r\nif(!iscollectable(o))return 0;\r\nif(ttisstring(o)){\r\nstringmark(rawtsvalue(o));\r\nreturn 0;\r\n}\r\nreturn iswhite(gcvalue(o))||\r\n(ttisuserdata(o)&&(!iskey&&isfinalized(uvalue(o))));\r\n}\r\nstatic void cleartable(GCObject*l){\r\nwhile(l){\r\nTable*h=gco2h(l);\r\nint i=h->sizearray;\r\nif(testbit(h->marked,4)){\r\nwhile(i--){\r\nTValue*o=&h->array[i];\r\nif(iscleared(o,0))\r\nsetnilvalue(o);\r\n}\r\n}\r\ni=sizenode(h);\r\nwhile(i--){\r\nNode*n=gnode(h,i);\r\nif(!ttisnil(gval(n))&&\r\n(iscleared(key2tval(n),1)||iscleared(gval(n),0))){\r\nsetnilvalue(gval(n));\r\nremoveentry(n);\r\n}\r\n}\r\nl=h->gclist;\r\n}\r\n}\r\nstatic void freeobj(lua_State*L,GCObject*o){\r\nswitch(o->gch.tt){\r\ncase(8+1):luaF_freeproto(L,gco2p(o));break;\r\ncase 6:luaF_freeclosure(L,gco2cl(o));break;\r\ncase(8+2):luaF_freeupval(L,gco2uv(o));break;\r\ncase 5:luaH_free(L,gco2h(o));break;\r\ncase 8:{\r\nluaE_freethread(L,gco2th(o));\r\nbreak;\r\n}\r\ncase 4:{\r\nG(L)->strt.nuse--;\r\nluaM_freemem(L,o,sizestring(gco2ts(o)));\r\nbreak;\r\n}\r\ncase 7:{\r\nluaM_freemem(L,o,sizeudata(gco2u(o)));\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\n#define sweepwholelist(L,p)sweeplist(L,p,((lu_mem)(~(lu_mem)0)-2))\r\nstatic GCObject**sweeplist(lua_State*L,GCObject**p,lu_mem count){\r\nGCObject*curr;\r\nglobal_State*g=G(L);\r\nint deadmask=otherwhite(g);\r\nwhile((curr=*p)!=NULL&&count-->0){\r\nif(curr->gch.tt==8)\r\nsweepwholelist(L,&gco2th(curr)->openupval);\r\nif((curr->gch.marked^bit2mask(0,1))&deadmask){\r\nmakewhite(g,curr);\r\np=&curr->gch.next;\r\n}\r\nelse{\r\n*p=curr->gch.next;\r\nif(curr==g->rootgc)\r\ng->rootgc=curr->gch.next;\r\nfreeobj(L,curr);\r\n}\r\n}\r\nreturn p;\r\n}\r\nstatic void checkSizes(lua_State*L){\r\nglobal_State*g=G(L);\r\nif(g->strt.nuse<cast(lu_int32,g->strt.size/4)&&\r\ng->strt.size>32*2)\r\nluaS_resize(L,g->strt.size/2);\r\nif(luaZ_sizebuffer(&g->buff)>32*2){\r\nsize_t newsize=luaZ_sizebuffer(&g->buff)/2;\r\nluaZ_resizebuffer(L,&g->buff,newsize);\r\n}\r\n}\r\nstatic void GCTM(lua_State*L){\r\nglobal_State*g=G(L);\r\nGCObject*o=g->tmudata->gch.next;\r\nUdata*udata=rawgco2u(o);\r\nconst TValue*tm;\r\nif(o==g->tmudata)\r\ng->tmudata=NULL;\r\nelse\r\ng->tmudata->gch.next=udata->uv.next;\r\nudata->uv.next=g->mainthread->next;\r\ng->mainthread->next=o;\r\nmakewhite(g,o);\r\ntm=fasttm(L,udata->uv.metatable,TM_GC);\r\nif(tm!=NULL){\r\nlu_byte oldah=L->allowhook;\r\nlu_mem oldt=g->GCthreshold;\r\nL->allowhook=0;\r\ng->GCthreshold=2*g->totalbytes;\r\nsetobj(L,L->top,tm);\r\nsetuvalue(L,L->top+1,udata);\r\nL->top+=2;\r\nluaD_call(L,L->top-2,0);\r\nL->allowhook=oldah;\r\ng->GCthreshold=oldt;\r\n}\r\n}\r\nstatic void luaC_callGCTM(lua_State*L){\r\nwhile(G(L)->tmudata)\r\nGCTM(L);\r\n}\r\nstatic void luaC_freeall(lua_State*L){\r\nglobal_State*g=G(L);\r\nint i;\r\ng->currentwhite=bit2mask(0,1)|bitmask(6);\r\nsweepwholelist(L,&g->rootgc);\r\nfor(i=0;i<g->strt.size;i++)\r\nsweepwholelist(L,&g->strt.hash[i]);\r\n}\r\nstatic void markmt(global_State*g){\r\nint i;\r\nfor(i=0;i<(8+1);i++)\r\nif(g->mt[i])markobject(g,g->mt[i]);\r\n}\r\nstatic void markroot(lua_State*L){\r\nglobal_State*g=G(L);\r\ng->gray=NULL;\r\ng->grayagain=NULL;\r\ng->weak=NULL;\r\nmarkobject(g,g->mainthread);\r\nmarkvalue(g,gt(g->mainthread));\r\nmarkvalue(g,registry(L));\r\nmarkmt(g);\r\ng->gcstate=1;\r\n}\r\nstatic void remarkupvals(global_State*g){\r\nUpVal*uv;\r\nfor(uv=g->uvhead.u.l.next;uv!=&g->uvhead;uv=uv->u.l.next){\r\nif(isgray(obj2gco(uv)))\r\nmarkvalue(g,uv->v);\r\n}\r\n}\r\nstatic void atomic(lua_State*L){\r\nglobal_State*g=G(L);\r\nsize_t udsize;\r\nremarkupvals(g);\r\npropagateall(g);\r\ng->gray=g->weak;\r\ng->weak=NULL;\r\nmarkobject(g,L);\r\nmarkmt(g);\r\npropagateall(g);\r\ng->gray=g->grayagain;\r\ng->grayagain=NULL;\r\npropagateall(g);\r\nudsize=luaC_separateudata(L,0);\r\nmarktmu(g);\r\nudsize+=propagateall(g);\r\ncleartable(g->weak);\r\ng->currentwhite=cast_byte(otherwhite(g));\r\ng->sweepstrgc=0;\r\ng->sweepgc=&g->rootgc;\r\ng->gcstate=2;\r\ng->estimate=g->totalbytes-udsize;\r\n}\r\nstatic l_mem singlestep(lua_State*L){\r\nglobal_State*g=G(L);\r\nswitch(g->gcstate){\r\ncase 0:{\r\nmarkroot(L);\r\nreturn 0;\r\n}\r\ncase 1:{\r\nif(g->gray)\r\nreturn propagatemark(g);\r\nelse{\r\natomic(L);\r\nreturn 0;\r\n}\r\n}\r\ncase 2:{\r\nlu_mem old=g->totalbytes;\r\nsweepwholelist(L,&g->strt.hash[g->sweepstrgc++]);\r\nif(g->sweepstrgc>=g->strt.size)\r\ng->gcstate=3;\r\ng->estimate-=old-g->totalbytes;\r\nreturn 10;\r\n}\r\ncase 3:{\r\nlu_mem old=g->totalbytes;\r\ng->sweepgc=sweeplist(L,g->sweepgc,40);\r\nif(*g->sweepgc==NULL){\r\ncheckSizes(L);\r\ng->gcstate=4;\r\n}\r\ng->estimate-=old-g->totalbytes;\r\nreturn 40*10;\r\n}\r\ncase 4:{\r\nif(g->tmudata){\r\nGCTM(L);\r\nif(g->estimate>100)\r\ng->estimate-=100;\r\nreturn 100;\r\n}\r\nelse{\r\ng->gcstate=0;\r\ng->gcdept=0;\r\nreturn 0;\r\n}\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic void luaC_step(lua_State*L){\r\nglobal_State*g=G(L);\r\nl_mem lim=(1024u/100)*g->gcstepmul;\r\nif(lim==0)\r\nlim=(((lu_mem)(~(lu_mem)0)-2)-1)/2;\r\ng->gcdept+=g->totalbytes-g->GCthreshold;\r\ndo{\r\nlim-=singlestep(L);\r\nif(g->gcstate==0)\r\nbreak;\r\n}while(lim>0);\r\nif(g->gcstate!=0){\r\nif(g->gcdept<1024u)\r\ng->GCthreshold=g->totalbytes+1024u;\r\nelse{\r\ng->gcdept-=1024u;\r\ng->GCthreshold=g->totalbytes;\r\n}\r\n}\r\nelse{\r\nsetthreshold(g);\r\n}\r\n}\r\nstatic void luaC_barrierf(lua_State*L,GCObject*o,GCObject*v){\r\nglobal_State*g=G(L);\r\nif(g->gcstate==1)\r\nreallymarkobject(g,v);\r\nelse\r\nmakewhite(g,o);\r\n}\r\nstatic void luaC_barrierback(lua_State*L,Table*t){\r\nglobal_State*g=G(L);\r\nGCObject*o=obj2gco(t);\r\nblack2gray(o);\r\nt->gclist=g->grayagain;\r\ng->grayagain=o;\r\n}\r\nstatic void luaC_link(lua_State*L,GCObject*o,lu_byte tt){\r\nglobal_State*g=G(L);\r\no->gch.next=g->rootgc;\r\ng->rootgc=o;\r\no->gch.marked=luaC_white(g);\r\no->gch.tt=tt;\r\n}\r\nstatic void luaC_linkupval(lua_State*L,UpVal*uv){\r\nglobal_State*g=G(L);\r\nGCObject*o=obj2gco(uv);\r\no->gch.next=g->rootgc;\r\ng->rootgc=o;\r\nif(isgray(o)){\r\nif(g->gcstate==1){\r\ngray2black(o);\r\nluaC_barrier(L,uv,uv->v);\r\n}\r\nelse{\r\nmakewhite(g,o);\r\n}\r\n}\r\n}\r\ntypedef union{\r\nlua_Number r;\r\nTString*ts;\r\n}SemInfo;\r\ntypedef struct Token{\r\nint token;\r\nSemInfo seminfo;\r\n}Token;\r\ntypedef struct LexState{\r\nint current;\r\nint linenumber;\r\nint lastline;\r\nToken t;\r\nToken lookahead;\r\nstruct FuncState*fs;\r\nstruct lua_State*L;\r\nZIO*z;\r\nMbuffer*buff;\r\nTString*source;\r\nchar decpoint;\r\n}LexState;\r\nstatic void luaX_init(lua_State*L);\r\nstatic void luaX_lexerror(LexState*ls,const char*msg,int token);\r\n#define state_size(x)(sizeof(x)+0)\r\n#define fromstate(l)(cast(lu_byte*,(l))-0)\r\n#define tostate(l)(cast(lua_State*,cast(lu_byte*,l)+0))\r\ntypedef struct LG{\r\nlua_State l;\r\nglobal_State g;\r\n}LG;\r\nstatic void stack_init(lua_State*L1,lua_State*L){\r\nL1->base_ci=luaM_newvector(L,8,CallInfo);\r\nL1->ci=L1->base_ci;\r\nL1->size_ci=8;\r\nL1->end_ci=L1->base_ci+L1->size_ci-1;\r\nL1->stack=luaM_newvector(L,(2*20)+5,TValue);\r\nL1->stacksize=(2*20)+5;\r\nL1->top=L1->stack;\r\nL1->stack_last=L1->stack+(L1->stacksize-5)-1;\r\nL1->ci->func=L1->top;\r\nsetnilvalue(L1->top++);\r\nL1->base=L1->ci->base=L1->top;\r\nL1->ci->top=L1->top+20;\r\n}\r\nstatic void freestack(lua_State*L,lua_State*L1){\r\nluaM_freearray(L,L1->base_ci,L1->size_ci,CallInfo);\r\nluaM_freearray(L,L1->stack,L1->stacksize,TValue);\r\n}\r\nstatic void f_luaopen(lua_State*L,void*ud){\r\nglobal_State*g=G(L);\r\nUNUSED(ud);\r\nstack_init(L,L);\r\nsethvalue(L,gt(L),luaH_new(L,0,2));\r\nsethvalue(L,registry(L),luaH_new(L,0,2));\r\nluaS_resize(L,32);\r\nluaT_init(L);\r\nluaX_init(L);\r\nluaS_fix(luaS_newliteral(L,\"not enough memory\"));\r\ng->GCthreshold=4*g->totalbytes;\r\n}\r\nstatic void preinit_state(lua_State*L,global_State*g){\r\nG(L)=g;\r\nL->stack=NULL;\r\nL->stacksize=0;\r\nL->errorJmp=NULL;\r\nL->hook=NULL;\r\nL->hookmask=0;\r\nL->basehookcount=0;\r\nL->allowhook=1;\r\nresethookcount(L);\r\nL->openupval=NULL;\r\nL->size_ci=0;\r\nL->nCcalls=L->baseCcalls=0;\r\nL->status=0;\r\nL->base_ci=L->ci=NULL;\r\nL->savedpc=NULL;\r\nL->errfunc=0;\r\nsetnilvalue(gt(L));\r\n}\r\nstatic void close_state(lua_State*L){\r\nglobal_State*g=G(L);\r\nluaF_close(L,L->stack);\r\nluaC_freeall(L);\r\nluaM_freearray(L,G(L)->strt.hash,G(L)->strt.size,TString*);\r\nluaZ_freebuffer(L,&g->buff);\r\nfreestack(L,L);\r\n(*g->frealloc)(g->ud,fromstate(L),state_size(LG),0);\r\n}\r\nstatic void luaE_freethread(lua_State*L,lua_State*L1){\r\nluaF_close(L1,L1->stack);\r\nfreestack(L,L1);\r\nluaM_freemem(L,fromstate(L1),state_size(lua_State));\r\n}\r\nstatic lua_State*lua_newstate(lua_Alloc f,void*ud){\r\nint i;\r\nlua_State*L;\r\nglobal_State*g;\r\nvoid*l=(*f)(ud,NULL,0,state_size(LG));\r\nif(l==NULL)return NULL;\r\nL=tostate(l);\r\ng=&((LG*)L)->g;\r\nL->next=NULL;\r\nL->tt=8;\r\ng->currentwhite=bit2mask(0,5);\r\nL->marked=luaC_white(g);\r\nset2bits(L->marked,5,6);\r\npreinit_state(L,g);\r\ng->frealloc=f;\r\ng->ud=ud;\r\ng->mainthread=L;\r\ng->uvhead.u.l.prev=&g->uvhead;\r\ng->uvhead.u.l.next=&g->uvhead;\r\ng->GCthreshold=0;\r\ng->strt.size=0;\r\ng->strt.nuse=0;\r\ng->strt.hash=NULL;\r\nsetnilvalue(registry(L));\r\nluaZ_initbuffer(L,&g->buff);\r\ng->panic=NULL;\r\ng->gcstate=0;\r\ng->rootgc=obj2gco(L);\r\ng->sweepstrgc=0;\r\ng->sweepgc=&g->rootgc;\r\ng->gray=NULL;\r\ng->grayagain=NULL;\r\ng->weak=NULL;\r\ng->tmudata=NULL;\r\ng->totalbytes=sizeof(LG);\r\ng->gcpause=200;\r\ng->gcstepmul=200;\r\ng->gcdept=0;\r\nfor(i=0;i<(8+1);i++)g->mt[i]=NULL;\r\nif(luaD_rawrunprotected(L,f_luaopen,NULL)!=0){\r\nclose_state(L);\r\nL=NULL;\r\n}\r\nelse\r\n{}\r\nreturn L;\r\n}\r\nstatic void callallgcTM(lua_State*L,void*ud){\r\nUNUSED(ud);\r\nluaC_callGCTM(L);\r\n}\r\nstatic void lua_close(lua_State*L){\r\nL=G(L)->mainthread;\r\nluaF_close(L,L->stack);\r\nluaC_separateudata(L,1);\r\nL->errfunc=0;\r\ndo{\r\nL->ci=L->base_ci;\r\nL->base=L->top=L->ci->base;\r\nL->nCcalls=L->baseCcalls=0;\r\n}while(luaD_rawrunprotected(L,callallgcTM,NULL)!=0);\r\nclose_state(L);\r\n}\r\n#define getcode(fs,e)((fs)->f->code[(e)->u.s.info])\r\n#define luaK_codeAsBx(fs,o,A,sBx)luaK_codeABx(fs,o,A,(sBx)+(((1<<(9+9))-1)>>1))\r\n#define luaK_setmultret(fs,e)luaK_setreturns(fs,e,(-1))\r\nstatic int luaK_codeABx(FuncState*fs,OpCode o,int A,unsigned int Bx);\r\nstatic int luaK_codeABC(FuncState*fs,OpCode o,int A,int B,int C);\r\nstatic void luaK_setreturns(FuncState*fs,expdesc*e,int nresults);\r\nstatic void luaK_patchtohere(FuncState*fs,int list);\r\nstatic void luaK_concat(FuncState*fs,int*l1,int l2);\r\nstatic int currentpc(lua_State*L,CallInfo*ci){\r\nif(!isLua(ci))return-1;\r\nif(ci==L->ci)\r\nci->savedpc=L->savedpc;\r\nreturn pcRel(ci->savedpc,ci_func(ci)->l.p);\r\n}\r\nstatic int currentline(lua_State*L,CallInfo*ci){\r\nint pc=currentpc(L,ci);\r\nif(pc<0)\r\nreturn-1;\r\nelse\r\nreturn getline_(ci_func(ci)->l.p,pc);\r\n}\r\nstatic int lua_getstack(lua_State*L,int level,lua_Debug*ar){\r\nint status;\r\nCallInfo*ci;\r\nfor(ci=L->ci;level>0&&ci>L->base_ci;ci--){\r\nlevel--;\r\nif(f_isLua(ci))\r\nlevel-=ci->tailcalls;\r\n}\r\nif(level==0&&ci>L->base_ci){\r\nstatus=1;\r\nar->i_ci=cast_int(ci-L->base_ci);\r\n}\r\nelse if(level<0){\r\nstatus=1;\r\nar->i_ci=0;\r\n}\r\nelse status=0;\r\nreturn status;\r\n}\r\nstatic Proto*getluaproto(CallInfo*ci){\r\nreturn(isLua(ci)?ci_func(ci)->l.p:NULL);\r\n}\r\nstatic void funcinfo(lua_Debug*ar,Closure*cl){\r\nif(cl->c.isC){\r\nar->source=\"=[C]\";\r\nar->linedefined=-1;\r\nar->lastlinedefined=-1;\r\nar->what=\"C\";\r\n}\r\nelse{\r\nar->source=getstr(cl->l.p->source);\r\nar->linedefined=cl->l.p->linedefined;\r\nar->lastlinedefined=cl->l.p->lastlinedefined;\r\nar->what=(ar->linedefined==0)?\"main\":\"Lua\";\r\n}\r\nluaO_chunkid(ar->short_src,ar->source,60);\r\n}\r\nstatic void info_tailcall(lua_Debug*ar){\r\nar->name=ar->namewhat=\"\";\r\nar->what=\"tail\";\r\nar->lastlinedefined=ar->linedefined=ar->currentline=-1;\r\nar->source=\"=(tail call)\";\r\nluaO_chunkid(ar->short_src,ar->source,60);\r\nar->nups=0;\r\n}\r\nstatic void collectvalidlines(lua_State*L,Closure*f){\r\nif(f==NULL||f->c.isC){\r\nsetnilvalue(L->top);\r\n}\r\nelse{\r\nTable*t=luaH_new(L,0,0);\r\nint*lineinfo=f->l.p->lineinfo;\r\nint i;\r\nfor(i=0;i<f->l.p->sizelineinfo;i++)\r\nsetbvalue(luaH_setnum(L,t,lineinfo[i]),1);\r\nsethvalue(L,L->top,t);\r\n}\r\nincr_top(L);\r\n}\r\nstatic int auxgetinfo(lua_State*L,const char*what,lua_Debug*ar,\r\nClosure*f,CallInfo*ci){\r\nint status=1;\r\nif(f==NULL){\r\ninfo_tailcall(ar);\r\nreturn status;\r\n}\r\nfor(;*what;what++){\r\nswitch(*what){\r\ncase'S':{\r\nfuncinfo(ar,f);\r\nbreak;\r\n}\r\ncase'l':{\r\nar->currentline=(ci)?currentline(L,ci):-1;\r\nbreak;\r\n}\r\ncase'u':{\r\nar->nups=f->c.nupvalues;\r\nbreak;\r\n}\r\ncase'n':{\r\nar->namewhat=(ci)?NULL:NULL;\r\nif(ar->namewhat==NULL){\r\nar->namewhat=\"\";\r\nar->name=NULL;\r\n}\r\nbreak;\r\n}\r\ncase'L':\r\ncase'f':\r\nbreak;\r\ndefault:status=0;\r\n}\r\n}\r\nreturn status;\r\n}\r\nstatic int lua_getinfo(lua_State*L,const char*what,lua_Debug*ar){\r\nint status;\r\nClosure*f=NULL;\r\nCallInfo*ci=NULL;\r\nif(*what=='>'){\r\nStkId func=L->top-1;\r\nluai_apicheck(L,ttisfunction(func));\r\nwhat++;\r\nf=clvalue(func);\r\nL->top--;\r\n}\r\nelse if(ar->i_ci!=0){\r\nci=L->base_ci+ar->i_ci;\r\nf=clvalue(ci->func);\r\n}\r\nstatus=auxgetinfo(L,what,ar,f,ci);\r\nif(strchr(what,'f')){\r\nif(f==NULL)setnilvalue(L->top);\r\nelse setclvalue(L,L->top,f);\r\nincr_top(L);\r\n}\r\nif(strchr(what,'L'))\r\ncollectvalidlines(L,f);\r\nreturn status;\r\n}\r\nstatic int isinstack(CallInfo*ci,const TValue*o){\r\nStkId p;\r\nfor(p=ci->base;p<ci->top;p++)\r\nif(o==p)return 1;\r\nreturn 0;\r\n}\r\nstatic void luaG_typeerror(lua_State*L,const TValue*o,const char*op){\r\nconst char*name=NULL;\r\nconst char*t=luaT_typenames[ttype(o)];\r\nconst char*kind=(isinstack(L->ci,o))?\r\nNULL:\r\nNULL;\r\nif(kind)\r\nluaG_runerror(L,\"attempt to %s %s \"LUA_QL(\"%s\")\" (a %s value)\",\r\nop,kind,name,t);\r\nelse\r\nluaG_runerror(L,\"attempt to %s a %s value\",op,t);\r\n}\r\nstatic void luaG_concaterror(lua_State*L,StkId p1,StkId p2){\r\nif(ttisstring(p1)||ttisnumber(p1))p1=p2;\r\nluaG_typeerror(L,p1,\"concatenate\");\r\n}\r\nstatic void luaG_aritherror(lua_State*L,const TValue*p1,const TValue*p2){\r\nTValue temp;\r\nif(luaV_tonumber(p1,&temp)==NULL)\r\np2=p1;\r\nluaG_typeerror(L,p2,\"perform arithmetic on\");\r\n}\r\nstatic int luaG_ordererror(lua_State*L,const TValue*p1,const TValue*p2){\r\nconst char*t1=luaT_typenames[ttype(p1)];\r\nconst char*t2=luaT_typenames[ttype(p2)];\r\nif(t1[2]==t2[2])\r\nluaG_runerror(L,\"attempt to compare two %s values\",t1);\r\nelse\r\nluaG_runerror(L,\"attempt to compare %s with %s\",t1,t2);\r\nreturn 0;\r\n}\r\nstatic void addinfo(lua_State*L,const char*msg){\r\nCallInfo*ci=L->ci;\r\nif(isLua(ci)){\r\nchar buff[60];\r\nint line=currentline(L,ci);\r\nluaO_chunkid(buff,getstr(getluaproto(ci)->source),60);\r\nluaO_pushfstring(L,\"%s:%d: %s\",buff,line,msg);\r\n}\r\n}\r\nstatic void luaG_errormsg(lua_State*L){\r\nif(L->errfunc!=0){\r\nStkId errfunc=restorestack(L,L->errfunc);\r\nif(!ttisfunction(errfunc))luaD_throw(L,5);\r\nsetobj(L,L->top,L->top-1);\r\nsetobj(L,L->top-1,errfunc);\r\nincr_top(L);\r\nluaD_call(L,L->top-2,1);\r\n}\r\nluaD_throw(L,2);\r\n}\r\nstatic void luaG_runerror(lua_State*L,const char*fmt,...){\r\nva_list argp;\r\nva_start(argp,fmt);\r\naddinfo(L,luaO_pushvfstring(L,fmt,argp));\r\nva_end(argp);\r\nluaG_errormsg(L);\r\n}\r\nstatic int luaZ_fill(ZIO*z){\r\nsize_t size;\r\nlua_State*L=z->L;\r\nconst char*buff;\r\nbuff=z->reader(L,z->data,&size);\r\nif(buff==NULL||size==0)return(-1);\r\nz->n=size-1;\r\nz->p=buff;\r\nreturn char2int(*(z->p++));\r\n}\r\nstatic void luaZ_init(lua_State*L,ZIO*z,lua_Reader reader,void*data){\r\nz->L=L;\r\nz->reader=reader;\r\nz->data=data;\r\nz->n=0;\r\nz->p=NULL;\r\n}\r\nstatic char*luaZ_openspace(lua_State*L,Mbuffer*buff,size_t n){\r\nif(n>buff->buffsize){\r\nif(n<32)n=32;\r\nluaZ_resizebuffer(L,buff,n);\r\n}\r\nreturn buff->buffer;\r\n}\r\n#define opmode(t,a,b,c,m)(((t)<<7)|((a)<<6)|((b)<<4)|((c)<<2)|(m))\r\nstatic const lu_byte luaP_opmodes[(cast(int,OP_VARARG)+1)]={\r\nopmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgK,OpArgN,iABx)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgU,OpArgN,iABC)\r\n,opmode(0,1,OpArgK,OpArgN,iABx)\r\n,opmode(0,1,OpArgR,OpArgK,iABC)\r\n,opmode(0,0,OpArgK,OpArgN,iABx)\r\n,opmode(0,0,OpArgU,OpArgN,iABC)\r\n,opmode(0,0,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgR,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgK,OpArgK,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgR,iABC)\r\n,opmode(0,0,OpArgR,OpArgN,iAsBx)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,0,OpArgK,OpArgK,iABC)\r\n,opmode(1,1,OpArgR,OpArgU,iABC)\r\n,opmode(1,1,OpArgR,OpArgU,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,1,OpArgU,OpArgU,iABC)\r\n,opmode(0,0,OpArgU,OpArgN,iABC)\r\n,opmode(0,1,OpArgR,OpArgN,iAsBx)\r\n,opmode(0,1,OpArgR,OpArgN,iAsBx)\r\n,opmode(1,0,OpArgN,OpArgU,iABC)\r\n,opmode(0,0,OpArgU,OpArgU,iABC)\r\n,opmode(0,0,OpArgN,OpArgN,iABC)\r\n,opmode(0,1,OpArgU,OpArgN,iABx)\r\n,opmode(0,1,OpArgU,OpArgN,iABC)\r\n};\r\n#define next(ls)(ls->current=zgetc(ls->z))\r\n#define currIsNewline(ls)(ls->current=='\\n'||ls->current=='\\r')\r\nstatic const char*const luaX_tokens[]={\r\n\"and\",\"break\",\"do\",\"else\",\"elseif\",\r\n\"end\",\"false\",\"for\",\"function\",\"if\",\r\n\"in\",\"local\",\"nil\",\"not\",\"or\",\"repeat\",\r\n\"return\",\"then\",\"true\",\"until\",\"while\",\r\n\"..\",\"...\",\"==\",\">=\",\"<=\",\"~=\",\r\n\"<number>\",\"<name>\",\"<string>\",\"<eof>\",\r\nNULL\r\n};\r\n#define save_and_next(ls)(save(ls,ls->current),next(ls))\r\nstatic void save(LexState*ls,int c){\r\nMbuffer*b=ls->buff;\r\nif(b->n+1>b->buffsize){\r\nsize_t newsize;\r\nif(b->buffsize>=((size_t)(~(size_t)0)-2)/2)\r\nluaX_lexerror(ls,\"lexical element too long\",0);\r\nnewsize=b->buffsize*2;\r\nluaZ_resizebuffer(ls->L,b,newsize);\r\n}\r\nb->buffer[b->n++]=cast(char,c);\r\n}\r\nstatic void luaX_init(lua_State*L){\r\nint i;\r\nfor(i=0;i<(cast(int,TK_WHILE-257+1));i++){\r\nTString*ts=luaS_new(L,luaX_tokens[i]);\r\nluaS_fix(ts);\r\nts->tsv.reserved=cast_byte(i+1);\r\n}\r\n}\r\nstatic const char*luaX_token2str(LexState*ls,int token){\r\nif(token<257){\r\nreturn(iscntrl(token))?luaO_pushfstring(ls->L,\"char(%d)\",token):\r\nluaO_pushfstring(ls->L,\"%c\",token);\r\n}\r\nelse\r\nreturn luaX_tokens[token-257];\r\n}\r\nstatic const char*txtToken(LexState*ls,int token){\r\nswitch(token){\r\ncase TK_NAME:\r\ncase TK_STRING:\r\ncase TK_NUMBER:\r\nsave(ls,'\\0');\r\nreturn luaZ_buffer(ls->buff);\r\ndefault:\r\nreturn luaX_token2str(ls,token);\r\n}\r\n}\r\nstatic void luaX_lexerror(LexState*ls,const char*msg,int token){\r\nchar buff[80];\r\nluaO_chunkid(buff,getstr(ls->source),80);\r\nmsg=luaO_pushfstring(ls->L,\"%s:%d: %s\",buff,ls->linenumber,msg);\r\nif(token)\r\nluaO_pushfstring(ls->L,\"%s near \"LUA_QL(\"%s\"),msg,txtToken(ls,token));\r\nluaD_throw(ls->L,3);\r\n}\r\nstatic void luaX_syntaxerror(LexState*ls,const char*msg){\r\nluaX_lexerror(ls,msg,ls->t.token);\r\n}\r\nstatic TString*luaX_newstring(LexState*ls,const char*str,size_t l){\r\nlua_State*L=ls->L;\r\nTString*ts=luaS_newlstr(L,str,l);\r\nTValue*o=luaH_setstr(L,ls->fs->h,ts);\r\nif(ttisnil(o)){\r\nsetbvalue(o,1);\r\nluaC_checkGC(L);\r\n}\r\nreturn ts;\r\n}\r\nstatic void inclinenumber(LexState*ls){\r\nint old=ls->current;\r\nnext(ls);\r\nif(currIsNewline(ls)&&ls->current!=old)\r\nnext(ls);\r\nif(++ls->linenumber>=(INT_MAX-2))\r\nluaX_syntaxerror(ls,\"chunk has too many lines\");\r\n}\r\nstatic void luaX_setinput(lua_State*L,LexState*ls,ZIO*z,TString*source){\r\nls->decpoint='.';\r\nls->L=L;\r\nls->lookahead.token=TK_EOS;\r\nls->z=z;\r\nls->fs=NULL;\r\nls->linenumber=1;\r\nls->lastline=1;\r\nls->source=source;\r\nluaZ_resizebuffer(ls->L,ls->buff,32);\r\nnext(ls);\r\n}\r\nstatic int check_next(LexState*ls,const char*set){\r\nif(!strchr(set,ls->current))\r\nreturn 0;\r\nsave_and_next(ls);\r\nreturn 1;\r\n}\r\nstatic void buffreplace(LexState*ls,char from,char to){\r\nsize_t n=luaZ_bufflen(ls->buff);\r\nchar*p=luaZ_buffer(ls->buff);\r\nwhile(n--)\r\nif(p[n]==from)p[n]=to;\r\n}\r\nstatic void read_numeral(LexState*ls,SemInfo*seminfo){\r\ndo{\r\nsave_and_next(ls);\r\n}while(isdigit(ls->current)||ls->current=='.');\r\nif(check_next(ls,\"Ee\"))\r\ncheck_next(ls,\"+-\");\r\nwhile(isalnum(ls->current)||ls->current=='_')\r\nsave_and_next(ls);\r\nsave(ls,'\\0');\r\nbuffreplace(ls,'.',ls->decpoint);\r\nif(!luaO_str2d(luaZ_buffer(ls->buff),&seminfo->r))\r\nluaX_lexerror(ls,\"malformed number\",TK_NUMBER);\r\n}\r\nstatic int skip_sep(LexState*ls){\r\nint count=0;\r\nint s=ls->current;\r\nsave_and_next(ls);\r\nwhile(ls->current=='='){\r\nsave_and_next(ls);\r\ncount++;\r\n}\r\nreturn(ls->current==s)?count:(-count)-1;\r\n}\r\nstatic void read_long_string(LexState*ls,SemInfo*seminfo,int sep){\r\nint cont=0;\r\n(void)(cont);\r\nsave_and_next(ls);\r\nif(currIsNewline(ls))\r\ninclinenumber(ls);\r\nfor(;;){\r\nswitch(ls->current){\r\ncase(-1):\r\nluaX_lexerror(ls,(seminfo)?\"unfinished long string\":\r\n\"unfinished long comment\",TK_EOS);\r\nbreak;\r\ncase']':{\r\nif(skip_sep(ls)==sep){\r\nsave_and_next(ls);\r\ngoto endloop;\r\n}\r\nbreak;\r\n}\r\ncase'\\n':\r\ncase'\\r':{\r\nsave(ls,'\\n');\r\ninclinenumber(ls);\r\nif(!seminfo)luaZ_resetbuffer(ls->buff);\r\nbreak;\r\n}\r\ndefault:{\r\nif(seminfo)save_and_next(ls);\r\nelse next(ls);\r\n}\r\n}\r\n}endloop:\r\nif(seminfo)\r\nseminfo->ts=luaX_newstring(ls,luaZ_buffer(ls->buff)+(2+sep),\r\nluaZ_bufflen(ls->buff)-2*(2+sep));\r\n}\r\nstatic void read_string(LexState*ls,int del,SemInfo*seminfo){\r\nsave_and_next(ls);\r\nwhile(ls->current!=del){\r\nswitch(ls->current){\r\ncase(-1):\r\nluaX_lexerror(ls,\"unfinished string\",TK_EOS);\r\ncontinue;\r\ncase'\\n':\r\ncase'\\r':\r\nluaX_lexerror(ls,\"unfinished string\",TK_STRING);\r\ncontinue;\r\ncase'\\\\':{\r\nint c;\r\nnext(ls);\r\nswitch(ls->current){\r\ncase'a':c='\\a';break;\r\ncase'b':c='\\b';break;\r\ncase'f':c='\\f';break;\r\ncase'n':c='\\n';break;\r\ncase'r':c='\\r';break;\r\ncase't':c='\\t';break;\r\ncase'v':c='\\v';break;\r\ncase'\\n':\r\ncase'\\r':save(ls,'\\n');inclinenumber(ls);continue;\r\ncase(-1):continue;\r\ndefault:{\r\nif(!isdigit(ls->current))\r\nsave_and_next(ls);\r\nelse{\r\nint i=0;\r\nc=0;\r\ndo{\r\nc=10*c+(ls->current-'0');\r\nnext(ls);\r\n}while(++i<3&&isdigit(ls->current));\r\nif(c>UCHAR_MAX)\r\nluaX_lexerror(ls,\"escape sequence too large\",TK_STRING);\r\nsave(ls,c);\r\n}\r\ncontinue;\r\n}\r\n}\r\nsave(ls,c);\r\nnext(ls);\r\ncontinue;\r\n}\r\ndefault:\r\nsave_and_next(ls);\r\n}\r\n}\r\nsave_and_next(ls);\r\nseminfo->ts=luaX_newstring(ls,luaZ_buffer(ls->buff)+1,\r\nluaZ_bufflen(ls->buff)-2);\r\n}\r\nstatic int llex(LexState*ls,SemInfo*seminfo){\r\nluaZ_resetbuffer(ls->buff);\r\nfor(;;){\r\nswitch(ls->current){\r\ncase'\\n':\r\ncase'\\r':{\r\ninclinenumber(ls);\r\ncontinue;\r\n}\r\ncase'-':{\r\nnext(ls);\r\nif(ls->current!='-')return'-';\r\nnext(ls);\r\nif(ls->current=='['){\r\nint sep=skip_sep(ls);\r\nluaZ_resetbuffer(ls->buff);\r\nif(sep>=0){\r\nread_long_string(ls,NULL,sep);\r\nluaZ_resetbuffer(ls->buff);\r\ncontinue;\r\n}\r\n}\r\nwhile(!currIsNewline(ls)&&ls->current!=(-1))\r\nnext(ls);\r\ncontinue;\r\n}\r\ncase'[':{\r\nint sep=skip_sep(ls);\r\nif(sep>=0){\r\nread_long_string(ls,seminfo,sep);\r\nreturn TK_STRING;\r\n}\r\nelse if(sep==-1)return'[';\r\nelse luaX_lexerror(ls,\"invalid long string delimiter\",TK_STRING);\r\n}\r\ncase'=':{\r\nnext(ls);\r\nif(ls->current!='=')return'=';\r\nelse{next(ls);return TK_EQ;}\r\n}\r\ncase'<':{\r\nnext(ls);\r\nif(ls->current!='=')return'<';\r\nelse{next(ls);return TK_LE;}\r\n}\r\ncase'>':{\r\nnext(ls);\r\nif(ls->current!='=')return'>';\r\nelse{next(ls);return TK_GE;}\r\n}\r\ncase'~':{\r\nnext(ls);\r\nif(ls->current!='=')return'~';\r\nelse{next(ls);return TK_NE;}\r\n}\r\ncase'\"':\r\ncase'\\'':{\r\nread_string(ls,ls->current,seminfo);\r\nreturn TK_STRING;\r\n}\r\ncase'.':{\r\nsave_and_next(ls);\r\nif(check_next(ls,\".\")){\r\nif(check_next(ls,\".\"))\r\nreturn TK_DOTS;\r\nelse return TK_CONCAT;\r\n}\r\nelse if(!isdigit(ls->current))return'.';\r\nelse{\r\nread_numeral(ls,seminfo);\r\nreturn TK_NUMBER;\r\n}\r\n}\r\ncase(-1):{\r\nreturn TK_EOS;\r\n}\r\ndefault:{\r\nif(isspace(ls->current)){\r\nnext(ls);\r\ncontinue;\r\n}\r\nelse if(isdigit(ls->current)){\r\nread_numeral(ls,seminfo);\r\nreturn TK_NUMBER;\r\n}\r\nelse if(isalpha(ls->current)||ls->current=='_'){\r\nTString*ts;\r\ndo{\r\nsave_and_next(ls);\r\n}while(isalnum(ls->current)||ls->current=='_');\r\nts=luaX_newstring(ls,luaZ_buffer(ls->buff),\r\nluaZ_bufflen(ls->buff));\r\nif(ts->tsv.reserved>0)\r\nreturn ts->tsv.reserved-1+257;\r\nelse{\r\nseminfo->ts=ts;\r\nreturn TK_NAME;\r\n}\r\n}\r\nelse{\r\nint c=ls->current;\r\nnext(ls);\r\nreturn c;\r\n}\r\n}\r\n}\r\n}\r\n}\r\nstatic void luaX_next(LexState*ls){\r\nls->lastline=ls->linenumber;\r\nif(ls->lookahead.token!=TK_EOS){\r\nls->t=ls->lookahead;\r\nls->lookahead.token=TK_EOS;\r\n}\r\nelse\r\nls->t.token=llex(ls,&ls->t.seminfo);\r\n}\r\nstatic void luaX_lookahead(LexState*ls){\r\nls->lookahead.token=llex(ls,&ls->lookahead.seminfo);\r\n}\r\n#define hasjumps(e)((e)->t!=(e)->f)\r\nstatic int isnumeral(expdesc*e){\r\nreturn(e->k==VKNUM&&e->t==(-1)&&e->f==(-1));\r\n}\r\nstatic void luaK_nil(FuncState*fs,int from,int n){\r\nInstruction*previous;\r\nif(fs->pc>fs->lasttarget){\r\nif(fs->pc==0){\r\nif(from>=fs->nactvar)\r\nreturn;\r\n}\r\nelse{\r\nprevious=&fs->f->code[fs->pc-1];\r\nif(GET_OPCODE(*previous)==OP_LOADNIL){\r\nint pfrom=GETARG_A(*previous);\r\nint pto=GETARG_B(*previous);\r\nif(pfrom<=from&&from<=pto+1){\r\nif(from+n-1>pto)\r\nSETARG_B(*previous,from+n-1);\r\nreturn;\r\n}\r\n}\r\n}\r\n}\r\nluaK_codeABC(fs,OP_LOADNIL,from,from+n-1,0);\r\n}\r\nstatic int luaK_jump(FuncState*fs){\r\nint jpc=fs->jpc;\r\nint j;\r\nfs->jpc=(-1);\r\nj=luaK_codeAsBx(fs,OP_JMP,0,(-1));\r\nluaK_concat(fs,&j,jpc);\r\nreturn j;\r\n}\r\nstatic void luaK_ret(FuncState*fs,int first,int nret){\r\nluaK_codeABC(fs,OP_RETURN,first,nret+1,0);\r\n}\r\nstatic int condjump(FuncState*fs,OpCode op,int A,int B,int C){\r\nluaK_codeABC(fs,op,A,B,C);\r\nreturn luaK_jump(fs);\r\n}\r\nstatic void fixjump(FuncState*fs,int pc,int dest){\r\nInstruction*jmp=&fs->f->code[pc];\r\nint offset=dest-(pc+1);\r\nif(abs(offset)>(((1<<(9+9))-1)>>1))\r\nluaX_syntaxerror(fs->ls,\"control structure too long\");\r\nSETARG_sBx(*jmp,offset);\r\n}\r\nstatic int luaK_getlabel(FuncState*fs){\r\nfs->lasttarget=fs->pc;\r\nreturn fs->pc;\r\n}\r\nstatic int getjump(FuncState*fs,int pc){\r\nint offset=GETARG_sBx(fs->f->code[pc]);\r\nif(offset==(-1))\r\nreturn(-1);\r\nelse\r\nreturn(pc+1)+offset;\r\n}\r\nstatic Instruction*getjumpcontrol(FuncState*fs,int pc){\r\nInstruction*pi=&fs->f->code[pc];\r\nif(pc>=1&&testTMode(GET_OPCODE(*(pi-1))))\r\nreturn pi-1;\r\nelse\r\nreturn pi;\r\n}\r\nstatic int need_value(FuncState*fs,int list){\r\nfor(;list!=(-1);list=getjump(fs,list)){\r\nInstruction i=*getjumpcontrol(fs,list);\r\nif(GET_OPCODE(i)!=OP_TESTSET)return 1;\r\n}\r\nreturn 0;\r\n}\r\nstatic int patchtestreg(FuncState*fs,int node,int reg){\r\nInstruction*i=getjumpcontrol(fs,node);\r\nif(GET_OPCODE(*i)!=OP_TESTSET)\r\nreturn 0;\r\nif(reg!=((1<<8)-1)&&reg!=GETARG_B(*i))\r\nSETARG_A(*i,reg);\r\nelse\r\n*i=CREATE_ABC(OP_TEST,GETARG_B(*i),0,GETARG_C(*i));\r\nreturn 1;\r\n}\r\nstatic void removevalues(FuncState*fs,int list){\r\nfor(;list!=(-1);list=getjump(fs,list))\r\npatchtestreg(fs,list,((1<<8)-1));\r\n}\r\nstatic void patchlistaux(FuncState*fs,int list,int vtarget,int reg,\r\nint dtarget){\r\nwhile(list!=(-1)){\r\nint next=getjump(fs,list);\r\nif(patchtestreg(fs,list,reg))\r\nfixjump(fs,list,vtarget);\r\nelse\r\nfixjump(fs,list,dtarget);\r\nlist=next;\r\n}\r\n}\r\nstatic void dischargejpc(FuncState*fs){\r\npatchlistaux(fs,fs->jpc,fs->pc,((1<<8)-1),fs->pc);\r\nfs->jpc=(-1);\r\n}\r\nstatic void luaK_patchlist(FuncState*fs,int list,int target){\r\nif(target==fs->pc)\r\nluaK_patchtohere(fs,list);\r\nelse{\r\npatchlistaux(fs,list,target,((1<<8)-1),target);\r\n}\r\n}\r\nstatic void luaK_patchtohere(FuncState*fs,int list){\r\nluaK_getlabel(fs);\r\nluaK_concat(fs,&fs->jpc,list);\r\n}\r\nstatic void luaK_concat(FuncState*fs,int*l1,int l2){\r\nif(l2==(-1))return;\r\nelse if(*l1==(-1))\r\n*l1=l2;\r\nelse{\r\nint list=*l1;\r\nint next;\r\nwhile((next=getjump(fs,list))!=(-1))\r\nlist=next;\r\nfixjump(fs,list,l2);\r\n}\r\n}\r\nstatic void luaK_checkstack(FuncState*fs,int n){\r\nint newstack=fs->freereg+n;\r\nif(newstack>fs->f->maxstacksize){\r\nif(newstack>=250)\r\nluaX_syntaxerror(fs->ls,\"function or expression too complex\");\r\nfs->f->maxstacksize=cast_byte(newstack);\r\n}\r\n}\r\nstatic void luaK_reserveregs(FuncState*fs,int n){\r\nluaK_checkstack(fs,n);\r\nfs->freereg+=n;\r\n}\r\nstatic void freereg(FuncState*fs,int reg){\r\nif(!ISK(reg)&&reg>=fs->nactvar){\r\nfs->freereg--;\r\n}\r\n}\r\nstatic void freeexp(FuncState*fs,expdesc*e){\r\nif(e->k==VNONRELOC)\r\nfreereg(fs,e->u.s.info);\r\n}\r\nstatic int addk(FuncState*fs,TValue*k,TValue*v){\r\nlua_State*L=fs->L;\r\nTValue*idx=luaH_set(L,fs->h,k);\r\nProto*f=fs->f;\r\nint oldsize=f->sizek;\r\nif(ttisnumber(idx)){\r\nreturn cast_int(nvalue(idx));\r\n}\r\nelse{\r\nsetnvalue(idx,cast_num(fs->nk));\r\nluaM_growvector(L,f->k,fs->nk,f->sizek,TValue,\r\n((1<<(9+9))-1),\"constant table overflow\");\r\nwhile(oldsize<f->sizek)setnilvalue(&f->k[oldsize++]);\r\nsetobj(L,&f->k[fs->nk],v);\r\nluaC_barrier(L,f,v);\r\nreturn fs->nk++;\r\n}\r\n}\r\nstatic int luaK_stringK(FuncState*fs,TString*s){\r\nTValue o;\r\nsetsvalue(fs->L,&o,s);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int luaK_numberK(FuncState*fs,lua_Number r){\r\nTValue o;\r\nsetnvalue(&o,r);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int boolK(FuncState*fs,int b){\r\nTValue o;\r\nsetbvalue(&o,b);\r\nreturn addk(fs,&o,&o);\r\n}\r\nstatic int nilK(FuncState*fs){\r\nTValue k,v;\r\nsetnilvalue(&v);\r\nsethvalue(fs->L,&k,fs->h);\r\nreturn addk(fs,&k,&v);\r\n}\r\nstatic void luaK_setreturns(FuncState*fs,expdesc*e,int nresults){\r\nif(e->k==VCALL){\r\nSETARG_C(getcode(fs,e),nresults+1);\r\n}\r\nelse if(e->k==VVARARG){\r\nSETARG_B(getcode(fs,e),nresults+1);\r\nSETARG_A(getcode(fs,e),fs->freereg);\r\nluaK_reserveregs(fs,1);\r\n}\r\n}\r\nstatic void luaK_setoneret(FuncState*fs,expdesc*e){\r\nif(e->k==VCALL){\r\ne->k=VNONRELOC;\r\ne->u.s.info=GETARG_A(getcode(fs,e));\r\n}\r\nelse if(e->k==VVARARG){\r\nSETARG_B(getcode(fs,e),2);\r\ne->k=VRELOCABLE;\r\n}\r\n}\r\nstatic void luaK_dischargevars(FuncState*fs,expdesc*e){\r\nswitch(e->k){\r\ncase VLOCAL:{\r\ne->k=VNONRELOC;\r\nbreak;\r\n}\r\ncase VUPVAL:{\r\ne->u.s.info=luaK_codeABC(fs,OP_GETUPVAL,0,e->u.s.info,0);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VGLOBAL:{\r\ne->u.s.info=luaK_codeABx(fs,OP_GETGLOBAL,0,e->u.s.info);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VINDEXED:{\r\nfreereg(fs,e->u.s.aux);\r\nfreereg(fs,e->u.s.info);\r\ne->u.s.info=luaK_codeABC(fs,OP_GETTABLE,0,e->u.s.info,e->u.s.aux);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ncase VVARARG:\r\ncase VCALL:{\r\nluaK_setoneret(fs,e);\r\nbreak;\r\n}\r\ndefault:break;\r\n}\r\n}\r\nstatic int code_label(FuncState*fs,int A,int b,int jump){\r\nluaK_getlabel(fs);\r\nreturn luaK_codeABC(fs,OP_LOADBOOL,A,b,jump);\r\n}\r\nstatic void discharge2reg(FuncState*fs,expdesc*e,int reg){\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:{\r\nluaK_nil(fs,reg,1);\r\nbreak;\r\n}\r\ncase VFALSE:case VTRUE:{\r\nluaK_codeABC(fs,OP_LOADBOOL,reg,e->k==VTRUE,0);\r\nbreak;\r\n}\r\ncase VK:{\r\nluaK_codeABx(fs,OP_LOADK,reg,e->u.s.info);\r\nbreak;\r\n}\r\ncase VKNUM:{\r\nluaK_codeABx(fs,OP_LOADK,reg,luaK_numberK(fs,e->u.nval));\r\nbreak;\r\n}\r\ncase VRELOCABLE:{\r\nInstruction*pc=&getcode(fs,e);\r\nSETARG_A(*pc,reg);\r\nbreak;\r\n}\r\ncase VNONRELOC:{\r\nif(reg!=e->u.s.info)\r\nluaK_codeABC(fs,OP_MOVE,reg,e->u.s.info,0);\r\nbreak;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\ne->u.s.info=reg;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void discharge2anyreg(FuncState*fs,expdesc*e){\r\nif(e->k!=VNONRELOC){\r\nluaK_reserveregs(fs,1);\r\ndischarge2reg(fs,e,fs->freereg-1);\r\n}\r\n}\r\nstatic void exp2reg(FuncState*fs,expdesc*e,int reg){\r\ndischarge2reg(fs,e,reg);\r\nif(e->k==VJMP)\r\nluaK_concat(fs,&e->t,e->u.s.info);\r\nif(hasjumps(e)){\r\nint final;\r\nint p_f=(-1);\r\nint p_t=(-1);\r\nif(need_value(fs,e->t)||need_value(fs,e->f)){\r\nint fj=(e->k==VJMP)?(-1):luaK_jump(fs);\r\np_f=code_label(fs,reg,0,1);\r\np_t=code_label(fs,reg,1,0);\r\nluaK_patchtohere(fs,fj);\r\n}\r\nfinal=luaK_getlabel(fs);\r\npatchlistaux(fs,e->f,final,reg,p_f);\r\npatchlistaux(fs,e->t,final,reg,p_t);\r\n}\r\ne->f=e->t=(-1);\r\ne->u.s.info=reg;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void luaK_exp2nextreg(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nfreeexp(fs,e);\r\nluaK_reserveregs(fs,1);\r\nexp2reg(fs,e,fs->freereg-1);\r\n}\r\nstatic int luaK_exp2anyreg(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nif(e->k==VNONRELOC){\r\nif(!hasjumps(e))return e->u.s.info;\r\nif(e->u.s.info>=fs->nactvar){\r\nexp2reg(fs,e,e->u.s.info);\r\nreturn e->u.s.info;\r\n}\r\n}\r\nluaK_exp2nextreg(fs,e);\r\nreturn e->u.s.info;\r\n}\r\nstatic void luaK_exp2val(FuncState*fs,expdesc*e){\r\nif(hasjumps(e))\r\nluaK_exp2anyreg(fs,e);\r\nelse\r\nluaK_dischargevars(fs,e);\r\n}\r\nstatic int luaK_exp2RK(FuncState*fs,expdesc*e){\r\nluaK_exp2val(fs,e);\r\nswitch(e->k){\r\ncase VKNUM:\r\ncase VTRUE:\r\ncase VFALSE:\r\ncase VNIL:{\r\nif(fs->nk<=((1<<(9-1))-1)){\r\ne->u.s.info=(e->k==VNIL)?nilK(fs):\r\n(e->k==VKNUM)?luaK_numberK(fs,e->u.nval):\r\nboolK(fs,(e->k==VTRUE));\r\ne->k=VK;\r\nreturn RKASK(e->u.s.info);\r\n}\r\nelse break;\r\n}\r\ncase VK:{\r\nif(e->u.s.info<=((1<<(9-1))-1))\r\nreturn RKASK(e->u.s.info);\r\nelse break;\r\n}\r\ndefault:break;\r\n}\r\nreturn luaK_exp2anyreg(fs,e);\r\n}\r\nstatic void luaK_storevar(FuncState*fs,expdesc*var,expdesc*ex){\r\nswitch(var->k){\r\ncase VLOCAL:{\r\nfreeexp(fs,ex);\r\nexp2reg(fs,ex,var->u.s.info);\r\nreturn;\r\n}\r\ncase VUPVAL:{\r\nint e=luaK_exp2anyreg(fs,ex);\r\nluaK_codeABC(fs,OP_SETUPVAL,e,var->u.s.info,0);\r\nbreak;\r\n}\r\ncase VGLOBAL:{\r\nint e=luaK_exp2anyreg(fs,ex);\r\nluaK_codeABx(fs,OP_SETGLOBAL,e,var->u.s.info);\r\nbreak;\r\n}\r\ncase VINDEXED:{\r\nint e=luaK_exp2RK(fs,ex);\r\nluaK_codeABC(fs,OP_SETTABLE,var->u.s.info,var->u.s.aux,e);\r\nbreak;\r\n}\r\ndefault:{\r\nbreak;\r\n}\r\n}\r\nfreeexp(fs,ex);\r\n}\r\nstatic void luaK_self(FuncState*fs,expdesc*e,expdesc*key){\r\nint func;\r\nluaK_exp2anyreg(fs,e);\r\nfreeexp(fs,e);\r\nfunc=fs->freereg;\r\nluaK_reserveregs(fs,2);\r\nluaK_codeABC(fs,OP_SELF,func,e->u.s.info,luaK_exp2RK(fs,key));\r\nfreeexp(fs,key);\r\ne->u.s.info=func;\r\ne->k=VNONRELOC;\r\n}\r\nstatic void invertjump(FuncState*fs,expdesc*e){\r\nInstruction*pc=getjumpcontrol(fs,e->u.s.info);\r\nSETARG_A(*pc,!(GETARG_A(*pc)));\r\n}\r\nstatic int jumponcond(FuncState*fs,expdesc*e,int cond){\r\nif(e->k==VRELOCABLE){\r\nInstruction ie=getcode(fs,e);\r\nif(GET_OPCODE(ie)==OP_NOT){\r\nfs->pc--;\r\nreturn condjump(fs,OP_TEST,GETARG_B(ie),0,!cond);\r\n}\r\n}\r\ndischarge2anyreg(fs,e);\r\nfreeexp(fs,e);\r\nreturn condjump(fs,OP_TESTSET,((1<<8)-1),e->u.s.info,cond);\r\n}\r\nstatic void luaK_goiftrue(FuncState*fs,expdesc*e){\r\nint pc;\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VK:case VKNUM:case VTRUE:{\r\npc=(-1);\r\nbreak;\r\n}\r\ncase VJMP:{\r\ninvertjump(fs,e);\r\npc=e->u.s.info;\r\nbreak;\r\n}\r\ndefault:{\r\npc=jumponcond(fs,e,0);\r\nbreak;\r\n}\r\n}\r\nluaK_concat(fs,&e->f,pc);\r\nluaK_patchtohere(fs,e->t);\r\ne->t=(-1);\r\n}\r\nstatic void luaK_goiffalse(FuncState*fs,expdesc*e){\r\nint pc;\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:case VFALSE:{\r\npc=(-1);\r\nbreak;\r\n}\r\ncase VJMP:{\r\npc=e->u.s.info;\r\nbreak;\r\n}\r\ndefault:{\r\npc=jumponcond(fs,e,1);\r\nbreak;\r\n}\r\n}\r\nluaK_concat(fs,&e->t,pc);\r\nluaK_patchtohere(fs,e->f);\r\ne->f=(-1);\r\n}\r\nstatic void codenot(FuncState*fs,expdesc*e){\r\nluaK_dischargevars(fs,e);\r\nswitch(e->k){\r\ncase VNIL:case VFALSE:{\r\ne->k=VTRUE;\r\nbreak;\r\n}\r\ncase VK:case VKNUM:case VTRUE:{\r\ne->k=VFALSE;\r\nbreak;\r\n}\r\ncase VJMP:{\r\ninvertjump(fs,e);\r\nbreak;\r\n}\r\ncase VRELOCABLE:\r\ncase VNONRELOC:{\r\ndischarge2anyreg(fs,e);\r\nfreeexp(fs,e);\r\ne->u.s.info=luaK_codeABC(fs,OP_NOT,0,e->u.s.info,0);\r\ne->k=VRELOCABLE;\r\nbreak;\r\n}\r\ndefault:{\r\nbreak;\r\n}\r\n}\r\n{int temp=e->f;e->f=e->t;e->t=temp;}\r\nremovevalues(fs,e->f);\r\nremovevalues(fs,e->t);\r\n}\r\nstatic void luaK_indexed(FuncState*fs,expdesc*t,expdesc*k){\r\nt->u.s.aux=luaK_exp2RK(fs,k);\r\nt->k=VINDEXED;\r\n}\r\nstatic int constfolding(OpCode op,expdesc*e1,expdesc*e2){\r\nlua_Number v1,v2,r;\r\nif(!isnumeral(e1)||!isnumeral(e2))return 0;\r\nv1=e1->u.nval;\r\nv2=e2->u.nval;\r\nswitch(op){\r\ncase OP_ADD:r=luai_numadd(v1,v2);break;\r\ncase OP_SUB:r=luai_numsub(v1,v2);break;\r\ncase OP_MUL:r=luai_nummul(v1,v2);break;\r\ncase OP_DIV:\r\nif(v2==0)return 0;\r\nr=luai_numdiv(v1,v2);break;\r\ncase OP_MOD:\r\nif(v2==0)return 0;\r\nr=luai_nummod(v1,v2);break;\r\ncase OP_POW:r=luai_numpow(v1,v2);break;\r\ncase OP_UNM:r=luai_numunm(v1);break;\r\ncase OP_LEN:return 0;\r\ndefault:r=0;break;\r\n}\r\nif(luai_numisnan(r))return 0;\r\ne1->u.nval=r;\r\nreturn 1;\r\n}\r\nstatic void codearith(FuncState*fs,OpCode op,expdesc*e1,expdesc*e2){\r\nif(constfolding(op,e1,e2))\r\nreturn;\r\nelse{\r\nint o2=(op!=OP_UNM&&op!=OP_LEN)?luaK_exp2RK(fs,e2):0;\r\nint o1=luaK_exp2RK(fs,e1);\r\nif(o1>o2){\r\nfreeexp(fs,e1);\r\nfreeexp(fs,e2);\r\n}\r\nelse{\r\nfreeexp(fs,e2);\r\nfreeexp(fs,e1);\r\n}\r\ne1->u.s.info=luaK_codeABC(fs,op,0,o1,o2);\r\ne1->k=VRELOCABLE;\r\n}\r\n}\r\nstatic void codecomp(FuncState*fs,OpCode op,int cond,expdesc*e1,\r\nexpdesc*e2){\r\nint o1=luaK_exp2RK(fs,e1);\r\nint o2=luaK_exp2RK(fs,e2);\r\nfreeexp(fs,e2);\r\nfreeexp(fs,e1);\r\nif(cond==0&&op!=OP_EQ){\r\nint temp;\r\ntemp=o1;o1=o2;o2=temp;\r\ncond=1;\r\n}\r\ne1->u.s.info=condjump(fs,op,cond,o1,o2);\r\ne1->k=VJMP;\r\n}\r\nstatic void luaK_prefix(FuncState*fs,UnOpr op,expdesc*e){\r\nexpdesc e2;\r\ne2.t=e2.f=(-1);e2.k=VKNUM;e2.u.nval=0;\r\nswitch(op){\r\ncase OPR_MINUS:{\r\nif(!isnumeral(e))\r\nluaK_exp2anyreg(fs,e);\r\ncodearith(fs,OP_UNM,e,&e2);\r\nbreak;\r\n}\r\ncase OPR_NOT:codenot(fs,e);break;\r\ncase OPR_LEN:{\r\nluaK_exp2anyreg(fs,e);\r\ncodearith(fs,OP_LEN,e,&e2);\r\nbreak;\r\n}\r\ndefault:;\r\n}\r\n}\r\nstatic void luaK_infix(FuncState*fs,BinOpr op,expdesc*v){\r\nswitch(op){\r\ncase OPR_AND:{\r\nluaK_goiftrue(fs,v);\r\nbreak;\r\n}\r\ncase OPR_OR:{\r\nluaK_goiffalse(fs,v);\r\nbreak;\r\n}\r\ncase OPR_CONCAT:{\r\nluaK_exp2nextreg(fs,v);\r\nbreak;\r\n}\r\ncase OPR_ADD:case OPR_SUB:case OPR_MUL:case OPR_DIV:\r\ncase OPR_MOD:case OPR_POW:{\r\nif(!isnumeral(v))luaK_exp2RK(fs,v);\r\nbreak;\r\n}\r\ndefault:{\r\nluaK_exp2RK(fs,v);\r\nbreak;\r\n}\r\n}\r\n}\r\nstatic void luaK_posfix(FuncState*fs,BinOpr op,expdesc*e1,expdesc*e2){\r\nswitch(op){\r\ncase OPR_AND:{\r\nluaK_dischargevars(fs,e2);\r\nluaK_concat(fs,&e2->f,e1->f);\r\n*e1=*e2;\r\nbreak;\r\n}\r\ncase OPR_OR:{\r\nluaK_dischargevars(fs,e2);\r\nluaK_concat(fs,&e2->t,e1->t);\r\n*e1=*e2;\r\nbreak;\r\n}\r\ncase OPR_CONCAT:{\r\nluaK_exp2val(fs,e2);\r\nif(e2->k==VRELOCABLE&&GET_OPCODE(getcode(fs,e2))==OP_CONCAT){\r\nfreeexp(fs,e1);\r\nSETARG_B(getcode(fs,e2),e1->u.s.info);\r\ne1->k=VRELOCABLE;e1->u.s.info=e2->u.s.info;\r\n}\r\nelse{\r\nluaK_exp2nextreg(fs,e2);\r\ncodearith(fs,OP_CONCAT,e1,e2);\r\n}\r\nbreak;\r\n}\r\ncase OPR_ADD:codearith(fs,OP_ADD,e1,e2);break;\r\ncase OPR_SUB:codearith(fs,OP_SUB,e1,e2);break;\r\ncase OPR_MUL:codearith(fs,OP_MUL,e1,e2);break;\r\ncase OPR_DIV:codearith(fs,OP_DIV,e1,e2);break;\r\ncase OPR_MOD:codearith(fs,OP_MOD,e1,e2);break;\r\ncase OPR_POW:codearith(fs,OP_POW,e1,e2);break;\r\ncase OPR_EQ:codecomp(fs,OP_EQ,1,e1,e2);break;\r\ncase OPR_NE:codecomp(fs,OP_EQ,0,e1,e2);break;\r\ncase OPR_LT:codecomp(fs,OP_LT,1,e1,e2);break;\r\ncase OPR_LE:codecomp(fs,OP_LE,1,e1,e2);break;\r\ncase OPR_GT:codecomp(fs,OP_LT,0,e1,e2);break;\r\ncase OPR_GE:codecomp(fs,OP_LE,0,e1,e2);break;\r\ndefault:;\r\n}\r\n}\r\nstatic void luaK_fixline(FuncState*fs,int line){\r\nfs->f->lineinfo[fs->pc-1]=line;\r\n}\r\nstatic int luaK_code(FuncState*fs,Instruction i,int line){\r\nProto*f=fs->f;\r\ndischargejpc(fs);\r\nluaM_growvector(fs->L,f->code,fs->pc,f->sizecode,Instruction,\r\n(INT_MAX-2),\"code size overflow\");\r\nf->code[fs->pc]=i;\r\nluaM_growvector(fs->L,f->lineinfo,fs->pc,f->sizelineinfo,int,\r\n(INT_MAX-2),\"code size overflow\");\r\nf->lineinfo[fs->pc]=line;\r\nreturn fs->pc++;\r\n}\r\nstatic int luaK_codeABC(FuncState*fs,OpCode o,int a,int b,int c){\r\nreturn luaK_code(fs,CREATE_ABC(o,a,b,c),fs->ls->lastline);\r\n}\r\nstatic int luaK_codeABx(FuncState*fs,OpCode o,int a,unsigned int bc){\r\nreturn luaK_code(fs,CREATE_ABx(o,a,bc),fs->ls->lastline);\r\n}\r\nstatic void luaK_setlist(FuncState*fs,int base,int nelems,int tostore){\r\nint c=(nelems-1)/50+1;\r\nint b=(tostore==(-1))?0:tostore;\r\nif(c<=((1<<9)-1))\r\nluaK_codeABC(fs,OP_SETLIST,base,b,c);\r\nelse{\r\nluaK_codeABC(fs,OP_SETLIST,base,b,0);\r\nluaK_code(fs,cast(Instruction,c),fs->ls->lastline);\r\n}\r\nfs->freereg=base+1;\r\n}\r\n#define hasmultret(k)((k)==VCALL||(k)==VVARARG)\r\n#define getlocvar(fs,i)((fs)->f->locvars[(fs)->actvar[i]])\r\n#define luaY_checklimit(fs,v,l,m)if((v)>(l))errorlimit(fs,l,m)\r\ntypedef struct BlockCnt{\r\nstruct BlockCnt*previous;\r\nint breaklist;\r\nlu_byte nactvar;\r\nlu_byte upval;\r\nlu_byte isbreakable;\r\n}BlockCnt;\r\nstatic void chunk(LexState*ls);\r\nstatic void expr(LexState*ls,expdesc*v);\r\nstatic void anchor_token(LexState*ls){\r\nif(ls->t.token==TK_NAME||ls->t.token==TK_STRING){\r\nTString*ts=ls->t.seminfo.ts;\r\nluaX_newstring(ls,getstr(ts),ts->tsv.len);\r\n}\r\n}\r\nstatic void error_expected(LexState*ls,int token){\r\nluaX_syntaxerror(ls,\r\nluaO_pushfstring(ls->L,LUA_QL(\"%s\")\" expected\",luaX_token2str(ls,token)));\r\n}\r\nstatic void errorlimit(FuncState*fs,int limit,const char*what){\r\nconst char*msg=(fs->f->linedefined==0)?\r\nluaO_pushfstring(fs->L,\"main function has more than %d %s\",limit,what):\r\nluaO_pushfstring(fs->L,\"function at line %d has more than %d %s\",\r\nfs->f->linedefined,limit,what);\r\nluaX_lexerror(fs->ls,msg,0);\r\n}\r\nstatic int testnext(LexState*ls,int c){\r\nif(ls->t.token==c){\r\nluaX_next(ls);\r\nreturn 1;\r\n}\r\nelse return 0;\r\n}\r\nstatic void check(LexState*ls,int c){\r\nif(ls->t.token!=c)\r\nerror_expected(ls,c);\r\n}\r\nstatic void checknext(LexState*ls,int c){\r\ncheck(ls,c);\r\nluaX_next(ls);\r\n}\r\n#define check_condition(ls,c,msg){if(!(c))luaX_syntaxerror(ls,msg);}\r\nstatic void check_match(LexState*ls,int what,int who,int where){\r\nif(!testnext(ls,what)){\r\nif(where==ls->linenumber)\r\nerror_expected(ls,what);\r\nelse{\r\nluaX_syntaxerror(ls,luaO_pushfstring(ls->L,\r\nLUA_QL(\"%s\")\" expected (to close \"LUA_QL(\"%s\")\" at line %d)\",\r\nluaX_token2str(ls,what),luaX_token2str(ls,who),where));\r\n}\r\n}\r\n}\r\nstatic TString*str_checkname(LexState*ls){\r\nTString*ts;\r\ncheck(ls,TK_NAME);\r\nts=ls->t.seminfo.ts;\r\nluaX_next(ls);\r\nreturn ts;\r\n}\r\nstatic void init_exp(expdesc*e,expkind k,int i){\r\ne->f=e->t=(-1);\r\ne->k=k;\r\ne->u.s.info=i;\r\n}\r\nstatic void codestring(LexState*ls,expdesc*e,TString*s){\r\ninit_exp(e,VK,luaK_stringK(ls->fs,s));\r\n}\r\nstatic void checkname(LexState*ls,expdesc*e){\r\ncodestring(ls,e,str_checkname(ls));\r\n}\r\nstatic int registerlocalvar(LexState*ls,TString*varname){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint oldsize=f->sizelocvars;\r\nluaM_growvector(ls->L,f->locvars,fs->nlocvars,f->sizelocvars,\r\nLocVar,SHRT_MAX,\"too many local variables\");\r\nwhile(oldsize<f->sizelocvars)f->locvars[oldsize++].varname=NULL;\r\nf->locvars[fs->nlocvars].varname=varname;\r\nluaC_objbarrier(ls->L,f,varname);\r\nreturn fs->nlocvars++;\r\n}\r\n#define new_localvarliteral(ls,v,n)new_localvar(ls,luaX_newstring(ls,\"\"v,(sizeof(v)/sizeof(char))-1),n)\r\nstatic void new_localvar(LexState*ls,TString*name,int n){\r\nFuncState*fs=ls->fs;\r\nluaY_checklimit(fs,fs->nactvar+n+1,200,\"local variables\");\r\nfs->actvar[fs->nactvar+n]=cast(unsigned short,registerlocalvar(ls,name));\r\n}\r\nstatic void adjustlocalvars(LexState*ls,int nvars){\r\nFuncState*fs=ls->fs;\r\nfs->nactvar=cast_byte(fs->nactvar+nvars);\r\nfor(;nvars;nvars--){\r\ngetlocvar(fs,fs->nactvar-nvars).startpc=fs->pc;\r\n}\r\n}\r\nstatic void removevars(LexState*ls,int tolevel){\r\nFuncState*fs=ls->fs;\r\nwhile(fs->nactvar>tolevel)\r\ngetlocvar(fs,--fs->nactvar).endpc=fs->pc;\r\n}\r\nstatic int indexupvalue(FuncState*fs,TString*name,expdesc*v){\r\nint i;\r\nProto*f=fs->f;\r\nint oldsize=f->sizeupvalues;\r\nfor(i=0;i<f->nups;i++){\r\nif(fs->upvalues[i].k==v->k&&fs->upvalues[i].info==v->u.s.info){\r\nreturn i;\r\n}\r\n}\r\nluaY_checklimit(fs,f->nups+1,60,\"upvalues\");\r\nluaM_growvector(fs->L,f->upvalues,f->nups,f->sizeupvalues,\r\nTString*,(INT_MAX-2),\"\");\r\nwhile(oldsize<f->sizeupvalues)f->upvalues[oldsize++]=NULL;\r\nf->upvalues[f->nups]=name;\r\nluaC_objbarrier(fs->L,f,name);\r\nfs->upvalues[f->nups].k=cast_byte(v->k);\r\nfs->upvalues[f->nups].info=cast_byte(v->u.s.info);\r\nreturn f->nups++;\r\n}\r\nstatic int searchvar(FuncState*fs,TString*n){\r\nint i;\r\nfor(i=fs->nactvar-1;i>=0;i--){\r\nif(n==getlocvar(fs,i).varname)\r\nreturn i;\r\n}\r\nreturn-1;\r\n}\r\nstatic void markupval(FuncState*fs,int level){\r\nBlockCnt*bl=fs->bl;\r\nwhile(bl&&bl->nactvar>level)bl=bl->previous;\r\nif(bl)bl->upval=1;\r\n}\r\nstatic int singlevaraux(FuncState*fs,TString*n,expdesc*var,int base){\r\nif(fs==NULL){\r\ninit_exp(var,VGLOBAL,((1<<8)-1));\r\nreturn VGLOBAL;\r\n}\r\nelse{\r\nint v=searchvar(fs,n);\r\nif(v>=0){\r\ninit_exp(var,VLOCAL,v);\r\nif(!base)\r\nmarkupval(fs,v);\r\nreturn VLOCAL;\r\n}\r\nelse{\r\nif(singlevaraux(fs->prev,n,var,0)==VGLOBAL)\r\nreturn VGLOBAL;\r\nvar->u.s.info=indexupvalue(fs,n,var);\r\nvar->k=VUPVAL;\r\nreturn VUPVAL;\r\n}\r\n}\r\n}\r\nstatic void singlevar(LexState*ls,expdesc*var){\r\nTString*varname=str_checkname(ls);\r\nFuncState*fs=ls->fs;\r\nif(singlevaraux(fs,varname,var,1)==VGLOBAL)\r\nvar->u.s.info=luaK_stringK(fs,varname);\r\n}\r\nstatic void adjust_assign(LexState*ls,int nvars,int nexps,expdesc*e){\r\nFuncState*fs=ls->fs;\r\nint extra=nvars-nexps;\r\nif(hasmultret(e->k)){\r\nextra++;\r\nif(extra<0)extra=0;\r\nluaK_setreturns(fs,e,extra);\r\nif(extra>1)luaK_reserveregs(fs,extra-1);\r\n}\r\nelse{\r\nif(e->k!=VVOID)luaK_exp2nextreg(fs,e);\r\nif(extra>0){\r\nint reg=fs->freereg;\r\nluaK_reserveregs(fs,extra);\r\nluaK_nil(fs,reg,extra);\r\n}\r\n}\r\n}\r\nstatic void enterlevel(LexState*ls){\r\nif(++ls->L->nCcalls>200)\r\nluaX_lexerror(ls,\"chunk has too many syntax levels\",0);\r\n}\r\n#define leavelevel(ls)((ls)->L->nCcalls--)\r\nstatic void enterblock(FuncState*fs,BlockCnt*bl,lu_byte isbreakable){\r\nbl->breaklist=(-1);\r\nbl->isbreakable=isbreakable;\r\nbl->nactvar=fs->nactvar;\r\nbl->upval=0;\r\nbl->previous=fs->bl;\r\nfs->bl=bl;\r\n}\r\nstatic void leaveblock(FuncState*fs){\r\nBlockCnt*bl=fs->bl;\r\nfs->bl=bl->previous;\r\nremovevars(fs->ls,bl->nactvar);\r\nif(bl->upval)\r\nluaK_codeABC(fs,OP_CLOSE,bl->nactvar,0,0);\r\nfs->freereg=fs->nactvar;\r\nluaK_patchtohere(fs,bl->breaklist);\r\n}\r\nstatic void pushclosure(LexState*ls,FuncState*func,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint oldsize=f->sizep;\r\nint i;\r\nluaM_growvector(ls->L,f->p,fs->np,f->sizep,Proto*,\r\n((1<<(9+9))-1),\"constant table overflow\");\r\nwhile(oldsize<f->sizep)f->p[oldsize++]=NULL;\r\nf->p[fs->np++]=func->f;\r\nluaC_objbarrier(ls->L,f,func->f);\r\ninit_exp(v,VRELOCABLE,luaK_codeABx(fs,OP_CLOSURE,0,fs->np-1));\r\nfor(i=0;i<func->f->nups;i++){\r\nOpCode o=(func->upvalues[i].k==VLOCAL)?OP_MOVE:OP_GETUPVAL;\r\nluaK_codeABC(fs,o,0,func->upvalues[i].info,0);\r\n}\r\n}\r\nstatic void open_func(LexState*ls,FuncState*fs){\r\nlua_State*L=ls->L;\r\nProto*f=luaF_newproto(L);\r\nfs->f=f;\r\nfs->prev=ls->fs;\r\nfs->ls=ls;\r\nfs->L=L;\r\nls->fs=fs;\r\nfs->pc=0;\r\nfs->lasttarget=-1;\r\nfs->jpc=(-1);\r\nfs->freereg=0;\r\nfs->nk=0;\r\nfs->np=0;\r\nfs->nlocvars=0;\r\nfs->nactvar=0;\r\nfs->bl=NULL;\r\nf->source=ls->source;\r\nf->maxstacksize=2;\r\nfs->h=luaH_new(L,0,0);\r\nsethvalue(L,L->top,fs->h);\r\nincr_top(L);\r\nsetptvalue(L,L->top,f);\r\nincr_top(L);\r\n}\r\nstatic void close_func(LexState*ls){\r\nlua_State*L=ls->L;\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nremovevars(ls,0);\r\nluaK_ret(fs,0,0);\r\nluaM_reallocvector(L,f->code,f->sizecode,fs->pc,Instruction);\r\nf->sizecode=fs->pc;\r\nluaM_reallocvector(L,f->lineinfo,f->sizelineinfo,fs->pc,int);\r\nf->sizelineinfo=fs->pc;\r\nluaM_reallocvector(L,f->k,f->sizek,fs->nk,TValue);\r\nf->sizek=fs->nk;\r\nluaM_reallocvector(L,f->p,f->sizep,fs->np,Proto*);\r\nf->sizep=fs->np;\r\nluaM_reallocvector(L,f->locvars,f->sizelocvars,fs->nlocvars,LocVar);\r\nf->sizelocvars=fs->nlocvars;\r\nluaM_reallocvector(L,f->upvalues,f->sizeupvalues,f->nups,TString*);\r\nf->sizeupvalues=f->nups;\r\nls->fs=fs->prev;\r\nif(fs)anchor_token(ls);\r\nL->top-=2;\r\n}\r\nstatic Proto*luaY_parser(lua_State*L,ZIO*z,Mbuffer*buff,const char*name){\r\nstruct LexState lexstate;\r\nstruct FuncState funcstate;\r\nlexstate.buff=buff;\r\nluaX_setinput(L,&lexstate,z,luaS_new(L,name));\r\nopen_func(&lexstate,&funcstate);\r\nfuncstate.f->is_vararg=2;\r\nluaX_next(&lexstate);\r\nchunk(&lexstate);\r\ncheck(&lexstate,TK_EOS);\r\nclose_func(&lexstate);\r\nreturn funcstate.f;\r\n}\r\nstatic void field(LexState*ls,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nexpdesc key;\r\nluaK_exp2anyreg(fs,v);\r\nluaX_next(ls);\r\ncheckname(ls,&key);\r\nluaK_indexed(fs,v,&key);\r\n}\r\nstatic void yindex(LexState*ls,expdesc*v){\r\nluaX_next(ls);\r\nexpr(ls,v);\r\nluaK_exp2val(ls->fs,v);\r\nchecknext(ls,']');\r\n}\r\nstruct ConsControl{\r\nexpdesc v;\r\nexpdesc*t;\r\nint nh;\r\nint na;\r\nint tostore;\r\n};\r\nstatic void recfield(LexState*ls,struct ConsControl*cc){\r\nFuncState*fs=ls->fs;\r\nint reg=ls->fs->freereg;\r\nexpdesc key,val;\r\nint rkkey;\r\nif(ls->t.token==TK_NAME){\r\nluaY_checklimit(fs,cc->nh,(INT_MAX-2),\"items in a constructor\");\r\ncheckname(ls,&key);\r\n}\r\nelse\r\nyindex(ls,&key);\r\ncc->nh++;\r\nchecknext(ls,'=');\r\nrkkey=luaK_exp2RK(fs,&key);\r\nexpr(ls,&val);\r\nluaK_codeABC(fs,OP_SETTABLE,cc->t->u.s.info,rkkey,luaK_exp2RK(fs,&val));\r\nfs->freereg=reg;\r\n}\r\nstatic void closelistfield(FuncState*fs,struct ConsControl*cc){\r\nif(cc->v.k==VVOID)return;\r\nluaK_exp2nextreg(fs,&cc->v);\r\ncc->v.k=VVOID;\r\nif(cc->tostore==50){\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,cc->tostore);\r\ncc->tostore=0;\r\n}\r\n}\r\nstatic void lastlistfield(FuncState*fs,struct ConsControl*cc){\r\nif(cc->tostore==0)return;\r\nif(hasmultret(cc->v.k)){\r\nluaK_setmultret(fs,&cc->v);\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,(-1));\r\ncc->na--;\r\n}\r\nelse{\r\nif(cc->v.k!=VVOID)\r\nluaK_exp2nextreg(fs,&cc->v);\r\nluaK_setlist(fs,cc->t->u.s.info,cc->na,cc->tostore);\r\n}\r\n}\r\nstatic void listfield(LexState*ls,struct ConsControl*cc){\r\nexpr(ls,&cc->v);\r\nluaY_checklimit(ls->fs,cc->na,(INT_MAX-2),\"items in a constructor\");\r\ncc->na++;\r\ncc->tostore++;\r\n}\r\nstatic void constructor(LexState*ls,expdesc*t){\r\nFuncState*fs=ls->fs;\r\nint line=ls->linenumber;\r\nint pc=luaK_codeABC(fs,OP_NEWTABLE,0,0,0);\r\nstruct ConsControl cc;\r\ncc.na=cc.nh=cc.tostore=0;\r\ncc.t=t;\r\ninit_exp(t,VRELOCABLE,pc);\r\ninit_exp(&cc.v,VVOID,0);\r\nluaK_exp2nextreg(ls->fs,t);\r\nchecknext(ls,'{');\r\ndo{\r\nif(ls->t.token=='}')break;\r\ncloselistfield(fs,&cc);\r\nswitch(ls->t.token){\r\ncase TK_NAME:{\r\nluaX_lookahead(ls);\r\nif(ls->lookahead.token!='=')\r\nlistfield(ls,&cc);\r\nelse\r\nrecfield(ls,&cc);\r\nbreak;\r\n}\r\ncase'[':{\r\nrecfield(ls,&cc);\r\nbreak;\r\n}\r\ndefault:{\r\nlistfield(ls,&cc);\r\nbreak;\r\n}\r\n}\r\n}while(testnext(ls,',')||testnext(ls,';'));\r\ncheck_match(ls,'}','{',line);\r\nlastlistfield(fs,&cc);\r\nSETARG_B(fs->f->code[pc],luaO_int2fb(cc.na));\r\nSETARG_C(fs->f->code[pc],luaO_int2fb(cc.nh));\r\n}\r\nstatic void parlist(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nProto*f=fs->f;\r\nint nparams=0;\r\nf->is_vararg=0;\r\nif(ls->t.token!=')'){\r\ndo{\r\nswitch(ls->t.token){\r\ncase TK_NAME:{\r\nnew_localvar(ls,str_checkname(ls),nparams++);\r\nbreak;\r\n}\r\ncase TK_DOTS:{\r\nluaX_next(ls);\r\nf->is_vararg|=2;\r\nbreak;\r\n}\r\ndefault:luaX_syntaxerror(ls,\"<name> or \"LUA_QL(\"...\")\" expected\");\r\n}\r\n}while(!f->is_vararg&&testnext(ls,','));\r\n}\r\nadjustlocalvars(ls,nparams);\r\nf->numparams=cast_byte(fs->nactvar-(f->is_vararg&1));\r\nluaK_reserveregs(fs,fs->nactvar);\r\n}\r\nstatic void body(LexState*ls,expdesc*e,int needself,int line){\r\nFuncState new_fs;\r\nopen_func(ls,&new_fs);\r\nnew_fs.f->linedefined=line;\r\nchecknext(ls,'(');\r\nif(needself){\r\nnew_localvarliteral(ls,\"self\",0);\r\nadjustlocalvars(ls,1);\r\n}\r\nparlist(ls);\r\nchecknext(ls,')');\r\nchunk(ls);\r\nnew_fs.f->lastlinedefined=ls->linenumber;\r\ncheck_match(ls,TK_END,TK_FUNCTION,line);\r\nclose_func(ls);\r\npushclosure(ls,&new_fs,e);\r\n}\r\nstatic int explist1(LexState*ls,expdesc*v){\r\nint n=1;\r\nexpr(ls,v);\r\nwhile(testnext(ls,',')){\r\nluaK_exp2nextreg(ls->fs,v);\r\nexpr(ls,v);\r\nn++;\r\n}\r\nreturn n;\r\n}\r\nstatic void funcargs(LexState*ls,expdesc*f){\r\nFuncState*fs=ls->fs;\r\nexpdesc args;\r\nint base,nparams;\r\nint line=ls->linenumber;\r\nswitch(ls->t.token){\r\ncase'(':{\r\nif(line!=ls->lastline)\r\nluaX_syntaxerror(ls,\"ambiguous syntax (function call x new statement)\");\r\nluaX_next(ls);\r\nif(ls->t.token==')')\r\nargs.k=VVOID;\r\nelse{\r\nexplist1(ls,&args);\r\nluaK_setmultret(fs,&args);\r\n}\r\ncheck_match(ls,')','(',line);\r\nbreak;\r\n}\r\ncase'{':{\r\nconstructor(ls,&args);\r\nbreak;\r\n}\r\ncase TK_STRING:{\r\ncodestring(ls,&args,ls->t.seminfo.ts);\r\nluaX_next(ls);\r\nbreak;\r\n}\r\ndefault:{\r\nluaX_syntaxerror(ls,\"function arguments expected\");\r\nreturn;\r\n}\r\n}\r\nbase=f->u.s.info;\r\nif(hasmultret(args.k))\r\nnparams=(-1);\r\nelse{\r\nif(args.k!=VVOID)\r\nluaK_exp2nextreg(fs,&args);\r\nnparams=fs->freereg-(base+1);\r\n}\r\ninit_exp(f,VCALL,luaK_codeABC(fs,OP_CALL,base,nparams+1,2));\r\nluaK_fixline(fs,line);\r\nfs->freereg=base+1;\r\n}\r\nstatic void prefixexp(LexState*ls,expdesc*v){\r\nswitch(ls->t.token){\r\ncase'(':{\r\nint line=ls->linenumber;\r\nluaX_next(ls);\r\nexpr(ls,v);\r\ncheck_match(ls,')','(',line);\r\nluaK_dischargevars(ls->fs,v);\r\nreturn;\r\n}\r\ncase TK_NAME:{\r\nsinglevar(ls,v);\r\nreturn;\r\n}\r\ndefault:{\r\nluaX_syntaxerror(ls,\"unexpected symbol\");\r\nreturn;\r\n}\r\n}\r\n}\r\nstatic void primaryexp(LexState*ls,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nprefixexp(ls,v);\r\nfor(;;){\r\nswitch(ls->t.token){\r\ncase'.':{\r\nfield(ls,v);\r\nbreak;\r\n}\r\ncase'[':{\r\nexpdesc key;\r\nluaK_exp2anyreg(fs,v);\r\nyindex(ls,&key);\r\nluaK_indexed(fs,v,&key);\r\nbreak;\r\n}\r\ncase':':{\r\nexpdesc key;\r\nluaX_next(ls);\r\ncheckname(ls,&key);\r\nluaK_self(fs,v,&key);\r\nfuncargs(ls,v);\r\nbreak;\r\n}\r\ncase'(':case TK_STRING:case'{':{\r\nluaK_exp2nextreg(fs,v);\r\nfuncargs(ls,v);\r\nbreak;\r\n}\r\ndefault:return;\r\n}\r\n}\r\n}\r\nstatic void simpleexp(LexState*ls,expdesc*v){\r\nswitch(ls->t.token){\r\ncase TK_NUMBER:{\r\ninit_exp(v,VKNUM,0);\r\nv->u.nval=ls->t.seminfo.r;\r\nbreak;\r\n}\r\ncase TK_STRING:{\r\ncodestring(ls,v,ls->t.seminfo.ts);\r\nbreak;\r\n}\r\ncase TK_NIL:{\r\ninit_exp(v,VNIL,0);\r\nbreak;\r\n}\r\ncase TK_TRUE:{\r\ninit_exp(v,VTRUE,0);\r\nbreak;\r\n}\r\ncase TK_FALSE:{\r\ninit_exp(v,VFALSE,0);\r\nbreak;\r\n}\r\ncase TK_DOTS:{\r\nFuncState*fs=ls->fs;\r\ncheck_condition(ls,fs->f->is_vararg,\r\n\"cannot use \"LUA_QL(\"...\")\" outside a vararg function\");\r\nfs->f->is_vararg&=~4;\r\ninit_exp(v,VVARARG,luaK_codeABC(fs,OP_VARARG,0,1,0));\r\nbreak;\r\n}\r\ncase'{':{\r\nconstructor(ls,v);\r\nreturn;\r\n}\r\ncase TK_FUNCTION:{\r\nluaX_next(ls);\r\nbody(ls,v,0,ls->linenumber);\r\nreturn;\r\n}\r\ndefault:{\r\nprimaryexp(ls,v);\r\nreturn;\r\n}\r\n}\r\nluaX_next(ls);\r\n}\r\nstatic UnOpr getunopr(int op){\r\nswitch(op){\r\ncase TK_NOT:return OPR_NOT;\r\ncase'-':return OPR_MINUS;\r\ncase'#':return OPR_LEN;\r\ndefault:return OPR_NOUNOPR;\r\n}\r\n}\r\nstatic BinOpr getbinopr(int op){\r\nswitch(op){\r\ncase'+':return OPR_ADD;\r\ncase'-':return OPR_SUB;\r\ncase'*':return OPR_MUL;\r\ncase'/':return OPR_DIV;\r\ncase'%':return OPR_MOD;\r\ncase'^':return OPR_POW;\r\ncase TK_CONCAT:return OPR_CONCAT;\r\ncase TK_NE:return OPR_NE;\r\ncase TK_EQ:return OPR_EQ;\r\ncase'<':return OPR_LT;\r\ncase TK_LE:return OPR_LE;\r\ncase'>':return OPR_GT;\r\ncase TK_GE:return OPR_GE;\r\ncase TK_AND:return OPR_AND;\r\ncase TK_OR:return OPR_OR;\r\ndefault:return OPR_NOBINOPR;\r\n}\r\n}\r\nstatic const struct{\r\nlu_byte left;\r\nlu_byte right;\r\n}priority[]={\r\n{6,6},{6,6},{7,7},{7,7},{7,7},\r\n{10,9},{5,4},\r\n{3,3},{3,3},\r\n{3,3},{3,3},{3,3},{3,3},\r\n{2,2},{1,1}\r\n};\r\nstatic BinOpr subexpr(LexState*ls,expdesc*v,unsigned int limit){\r\nBinOpr op;\r\nUnOpr uop;\r\nenterlevel(ls);\r\nuop=getunopr(ls->t.token);\r\nif(uop!=OPR_NOUNOPR){\r\nluaX_next(ls);\r\nsubexpr(ls,v,8);\r\nluaK_prefix(ls->fs,uop,v);\r\n}\r\nelse simpleexp(ls,v);\r\nop=getbinopr(ls->t.token);\r\nwhile(op!=OPR_NOBINOPR&&priority[op].left>limit){\r\nexpdesc v2;\r\nBinOpr nextop;\r\nluaX_next(ls);\r\nluaK_infix(ls->fs,op,v);\r\nnextop=subexpr(ls,&v2,priority[op].right);\r\nluaK_posfix(ls->fs,op,v,&v2);\r\nop=nextop;\r\n}\r\nleavelevel(ls);\r\nreturn op;\r\n}\r\nstatic void expr(LexState*ls,expdesc*v){\r\nsubexpr(ls,v,0);\r\n}\r\nstatic int block_follow(int token){\r\nswitch(token){\r\ncase TK_ELSE:case TK_ELSEIF:case TK_END:\r\ncase TK_UNTIL:case TK_EOS:\r\nreturn 1;\r\ndefault:return 0;\r\n}\r\n}\r\nstatic void block(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nBlockCnt bl;\r\nenterblock(fs,&bl,0);\r\nchunk(ls);\r\nleaveblock(fs);\r\n}\r\nstruct LHS_assign{\r\nstruct LHS_assign*prev;\r\nexpdesc v;\r\n};\r\nstatic void check_conflict(LexState*ls,struct LHS_assign*lh,expdesc*v){\r\nFuncState*fs=ls->fs;\r\nint extra=fs->freereg;\r\nint conflict=0;\r\nfor(;lh;lh=lh->prev){\r\nif(lh->v.k==VINDEXED){\r\nif(lh->v.u.s.info==v->u.s.info){\r\nconflict=1;\r\nlh->v.u.s.info=extra;\r\n}\r\nif(lh->v.u.s.aux==v->u.s.info){\r\nconflict=1;\r\nlh->v.u.s.aux=extra;\r\n}\r\n}\r\n}\r\nif(conflict){\r\nluaK_codeABC(fs,OP_MOVE,fs->freereg,v->u.s.info,0);\r\nluaK_reserveregs(fs,1);\r\n}\r\n}\r\nstatic void assignment(LexState*ls,struct LHS_assign*lh,int nvars){\r\nexpdesc e;\r\ncheck_condition(ls,VLOCAL<=lh->v.k&&lh->v.k<=VINDEXED,\r\n\"syntax error\");\r\nif(testnext(ls,',')){\r\nstruct LHS_assign nv;\r\nnv.prev=lh;\r\nprimaryexp(ls,&nv.v);\r\nif(nv.v.k==VLOCAL)\r\ncheck_conflict(ls,lh,&nv.v);\r\nluaY_checklimit(ls->fs,nvars,200-ls->L->nCcalls,\r\n\"variables in assignment\");\r\nassignment(ls,&nv,nvars+1);\r\n}\r\nelse{\r\nint nexps;\r\nchecknext(ls,'=');\r\nnexps=explist1(ls,&e);\r\nif(nexps!=nvars){\r\nadjust_assign(ls,nvars,nexps,&e);\r\nif(nexps>nvars)\r\nls->fs->freereg-=nexps-nvars;\r\n}\r\nelse{\r\nluaK_setoneret(ls->fs,&e);\r\nluaK_storevar(ls->fs,&lh->v,&e);\r\nreturn;\r\n}\r\n}\r\ninit_exp(&e,VNONRELOC,ls->fs->freereg-1);\r\nluaK_storevar(ls->fs,&lh->v,&e);\r\n}\r\nstatic int cond(LexState*ls){\r\nexpdesc v;\r\nexpr(ls,&v);\r\nif(v.k==VNIL)v.k=VFALSE;\r\nluaK_goiftrue(ls->fs,&v);\r\nreturn v.f;\r\n}\r\nstatic void breakstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nBlockCnt*bl=fs->bl;\r\nint upval=0;\r\nwhile(bl&&!bl->isbreakable){\r\nupval|=bl->upval;\r\nbl=bl->previous;\r\n}\r\nif(!bl)\r\nluaX_syntaxerror(ls,\"no loop to break\");\r\nif(upval)\r\nluaK_codeABC(fs,OP_CLOSE,bl->nactvar,0,0);\r\nluaK_concat(fs,&bl->breaklist,luaK_jump(fs));\r\n}\r\nstatic void whilestat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nint whileinit;\r\nint condexit;\r\nBlockCnt bl;\r\nluaX_next(ls);\r\nwhileinit=luaK_getlabel(fs);\r\ncondexit=cond(ls);\r\nenterblock(fs,&bl,1);\r\nchecknext(ls,TK_DO);\r\nblock(ls);\r\nluaK_patchlist(fs,luaK_jump(fs),whileinit);\r\ncheck_match(ls,TK_END,TK_WHILE,line);\r\nleaveblock(fs);\r\nluaK_patchtohere(fs,condexit);\r\n}\r\nstatic void repeatstat(LexState*ls,int line){\r\nint condexit;\r\nFuncState*fs=ls->fs;\r\nint repeat_init=luaK_getlabel(fs);\r\nBlockCnt bl1,bl2;\r\nenterblock(fs,&bl1,1);\r\nenterblock(fs,&bl2,0);\r\nluaX_next(ls);\r\nchunk(ls);\r\ncheck_match(ls,TK_UNTIL,TK_REPEAT,line);\r\ncondexit=cond(ls);\r\nif(!bl2.upval){\r\nleaveblock(fs);\r\nluaK_patchlist(ls->fs,condexit,repeat_init);\r\n}\r\nelse{\r\nbreakstat(ls);\r\nluaK_patchtohere(ls->fs,condexit);\r\nleaveblock(fs);\r\nluaK_patchlist(ls->fs,luaK_jump(fs),repeat_init);\r\n}\r\nleaveblock(fs);\r\n}\r\nstatic int exp1(LexState*ls){\r\nexpdesc e;\r\nint k;\r\nexpr(ls,&e);\r\nk=e.k;\r\nluaK_exp2nextreg(ls->fs,&e);\r\nreturn k;\r\n}\r\nstatic void forbody(LexState*ls,int base,int line,int nvars,int isnum){\r\nBlockCnt bl;\r\nFuncState*fs=ls->fs;\r\nint prep,endfor;\r\nadjustlocalvars(ls,3);\r\nchecknext(ls,TK_DO);\r\nprep=isnum?luaK_codeAsBx(fs,OP_FORPREP,base,(-1)):luaK_jump(fs);\r\nenterblock(fs,&bl,0);\r\nadjustlocalvars(ls,nvars);\r\nluaK_reserveregs(fs,nvars);\r\nblock(ls);\r\nleaveblock(fs);\r\nluaK_patchtohere(fs,prep);\r\nendfor=(isnum)?luaK_codeAsBx(fs,OP_FORLOOP,base,(-1)):\r\nluaK_codeABC(fs,OP_TFORLOOP,base,0,nvars);\r\nluaK_fixline(fs,line);\r\nluaK_patchlist(fs,(isnum?endfor:luaK_jump(fs)),prep+1);\r\n}\r\nstatic void fornum(LexState*ls,TString*varname,int line){\r\nFuncState*fs=ls->fs;\r\nint base=fs->freereg;\r\nnew_localvarliteral(ls,\"(for index)\",0);\r\nnew_localvarliteral(ls,\"(for limit)\",1);\r\nnew_localvarliteral(ls,\"(for step)\",2);\r\nnew_localvar(ls,varname,3);\r\nchecknext(ls,'=');\r\nexp1(ls);\r\nchecknext(ls,',');\r\nexp1(ls);\r\nif(testnext(ls,','))\r\nexp1(ls);\r\nelse{\r\nluaK_codeABx(fs,OP_LOADK,fs->freereg,luaK_numberK(fs,1));\r\nluaK_reserveregs(fs,1);\r\n}\r\nforbody(ls,base,line,1,1);\r\n}\r\nstatic void forlist(LexState*ls,TString*indexname){\r\nFuncState*fs=ls->fs;\r\nexpdesc e;\r\nint nvars=0;\r\nint line;\r\nint base=fs->freereg;\r\nnew_localvarliteral(ls,\"(for generator)\",nvars++);\r\nnew_localvarliteral(ls,\"(for state)\",nvars++);\r\nnew_localvarliteral(ls,\"(for control)\",nvars++);\r\nnew_localvar(ls,indexname,nvars++);\r\nwhile(testnext(ls,','))\r\nnew_localvar(ls,str_checkname(ls),nvars++);\r\nchecknext(ls,TK_IN);\r\nline=ls->linenumber;\r\nadjust_assign(ls,3,explist1(ls,&e),&e);\r\nluaK_checkstack(fs,3);\r\nforbody(ls,base,line,nvars-3,0);\r\n}\r\nstatic void forstat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nTString*varname;\r\nBlockCnt bl;\r\nenterblock(fs,&bl,1);\r\nluaX_next(ls);\r\nvarname=str_checkname(ls);\r\nswitch(ls->t.token){\r\ncase'=':fornum(ls,varname,line);break;\r\ncase',':case TK_IN:forlist(ls,varname);break;\r\ndefault:luaX_syntaxerror(ls,LUA_QL(\"=\")\" or \"LUA_QL(\"in\")\" expected\");\r\n}\r\ncheck_match(ls,TK_END,TK_FOR,line);\r\nleaveblock(fs);\r\n}\r\nstatic int test_then_block(LexState*ls){\r\nint condexit;\r\nluaX_next(ls);\r\ncondexit=cond(ls);\r\nchecknext(ls,TK_THEN);\r\nblock(ls);\r\nreturn condexit;\r\n}\r\nstatic void ifstat(LexState*ls,int line){\r\nFuncState*fs=ls->fs;\r\nint flist;\r\nint escapelist=(-1);\r\nflist=test_then_block(ls);\r\nwhile(ls->t.token==TK_ELSEIF){\r\nluaK_concat(fs,&escapelist,luaK_jump(fs));\r\nluaK_patchtohere(fs,flist);\r\nflist=test_then_block(ls);\r\n}\r\nif(ls->t.token==TK_ELSE){\r\nluaK_concat(fs,&escapelist,luaK_jump(fs));\r\nluaK_patchtohere(fs,flist);\r\nluaX_next(ls);\r\nblock(ls);\r\n}\r\nelse\r\nluaK_concat(fs,&escapelist,flist);\r\nluaK_patchtohere(fs,escapelist);\r\ncheck_match(ls,TK_END,TK_IF,line);\r\n}\r\nstatic void localfunc(LexState*ls){\r\nexpdesc v,b;\r\nFuncState*fs=ls->fs;\r\nnew_localvar(ls,str_checkname(ls),0);\r\ninit_exp(&v,VLOCAL,fs->freereg);\r\nluaK_reserveregs(fs,1);\r\nadjustlocalvars(ls,1);\r\nbody(ls,&b,0,ls->linenumber);\r\nluaK_storevar(fs,&v,&b);\r\ngetlocvar(fs,fs->nactvar-1).startpc=fs->pc;\r\n}\r\nstatic void localstat(LexState*ls){\r\nint nvars=0;\r\nint nexps;\r\nexpdesc e;\r\ndo{\r\nnew_localvar(ls,str_checkname(ls),nvars++);\r\n}while(testnext(ls,','));\r\nif(testnext(ls,'='))\r\nnexps=explist1(ls,&e);\r\nelse{\r\ne.k=VVOID;\r\nnexps=0;\r\n}\r\nadjust_assign(ls,nvars,nexps,&e);\r\nadjustlocalvars(ls,nvars);\r\n}\r\nstatic int funcname(LexState*ls,expdesc*v){\r\nint needself=0;\r\nsinglevar(ls,v);\r\nwhile(ls->t.token=='.')\r\nfield(ls,v);\r\nif(ls->t.token==':'){\r\nneedself=1;\r\nfield(ls,v);\r\n}\r\nreturn needself;\r\n}\r\nstatic void funcstat(LexState*ls,int line){\r\nint needself;\r\nexpdesc v,b;\r\nluaX_next(ls);\r\nneedself=funcname(ls,&v);\r\nbody(ls,&b,needself,line);\r\nluaK_storevar(ls->fs,&v,&b);\r\nluaK_fixline(ls->fs,line);\r\n}\r\nstatic void exprstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nstruct LHS_assign v;\r\nprimaryexp(ls,&v.v);\r\nif(v.v.k==VCALL)\r\nSETARG_C(getcode(fs,&v.v),1);\r\nelse{\r\nv.prev=NULL;\r\nassignment(ls,&v,1);\r\n}\r\n}\r\nstatic void retstat(LexState*ls){\r\nFuncState*fs=ls->fs;\r\nexpdesc e;\r\nint first,nret;\r\nluaX_next(ls);\r\nif(block_follow(ls->t.token)||ls->t.token==';')\r\nfirst=nret=0;\r\nelse{\r\nnret=explist1(ls,&e);\r\nif(hasmultret(e.k)){\r\nluaK_setmultret(fs,&e);\r\nif(e.k==VCALL&&nret==1){\r\nSET_OPCODE(getcode(fs,&e),OP_TAILCALL);\r\n}\r\nfirst=fs->nactvar;\r\nnret=(-1);\r\n}\r\nelse{\r\nif(nret==1)\r\nfirst=luaK_exp2anyreg(fs,&e);\r\nelse{\r\nluaK_exp2nextreg(fs,&e);\r\nfirst=fs->nactvar;\r\n}\r\n}\r\n}\r\nluaK_ret(fs,first,nret);\r\n}\r\nstatic int statement(LexState*ls){\r\nint line=ls->linenumber;\r\nswitch(ls->t.token){\r\ncase TK_IF:{\r\nifstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_WHILE:{\r\nwhilestat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_DO:{\r\nluaX_next(ls);\r\nblock(ls);\r\ncheck_match(ls,TK_END,TK_DO,line);\r\nreturn 0;\r\n}\r\ncase TK_FOR:{\r\nforstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_REPEAT:{\r\nrepeatstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_FUNCTION:{\r\nfuncstat(ls,line);\r\nreturn 0;\r\n}\r\ncase TK_LOCAL:{\r\nluaX_next(ls);\r\nif(testnext(ls,TK_FUNCTION))\r\nlocalfunc(ls);\r\nelse\r\nlocalstat(ls);\r\nreturn 0;\r\n}\r\ncase TK_RETURN:{\r\nretstat(ls);\r\nreturn 1;\r\n}\r\ncase TK_BREAK:{\r\nluaX_next(ls);\r\nbreakstat(ls);\r\nreturn 1;\r\n}\r\ndefault:{\r\nexprstat(ls);\r\nreturn 0;\r\n}\r\n}\r\n}\r\nstatic void chunk(LexState*ls){\r\nint islast=0;\r\nenterlevel(ls);\r\nwhile(!islast&&!block_follow(ls->t.token)){\r\nislast=statement(ls);\r\ntestnext(ls,';');\r\nls->fs->freereg=ls->fs->nactvar;\r\n}\r\nleavelevel(ls);\r\n}\r\nstatic const TValue*luaV_tonumber(const TValue*obj,TValue*n){\r\nlua_Number num;\r\nif(ttisnumber(obj))return obj;\r\nif(ttisstring(obj)&&luaO_str2d(svalue(obj),&num)){\r\nsetnvalue(n,num);\r\nreturn n;\r\n}\r\nelse\r\nreturn NULL;\r\n}\r\nstatic int luaV_tostring(lua_State*L,StkId obj){\r\nif(!ttisnumber(obj))\r\nreturn 0;\r\nelse{\r\nchar s[32];\r\nlua_Number n=nvalue(obj);\r\nlua_number2str(s,n);\r\nsetsvalue(L,obj,luaS_new(L,s));\r\nreturn 1;\r\n}\r\n}\r\nstatic void callTMres(lua_State*L,StkId res,const TValue*f,\r\nconst TValue*p1,const TValue*p2){\r\nptrdiff_t result=savestack(L,res);\r\nsetobj(L,L->top,f);\r\nsetobj(L,L->top+1,p1);\r\nsetobj(L,L->top+2,p2);\r\nluaD_checkstack(L,3);\r\nL->top+=3;\r\nluaD_call(L,L->top-3,1);\r\nres=restorestack(L,result);\r\nL->top--;\r\nsetobj(L,res,L->top);\r\n}\r\nstatic void callTM(lua_State*L,const TValue*f,const TValue*p1,\r\nconst TValue*p2,const TValue*p3){\r\nsetobj(L,L->top,f);\r\nsetobj(L,L->top+1,p1);\r\nsetobj(L,L->top+2,p2);\r\nsetobj(L,L->top+3,p3);\r\nluaD_checkstack(L,4);\r\nL->top+=4;\r\nluaD_call(L,L->top-4,0);\r\n}\r\nstatic void luaV_gettable(lua_State*L,const TValue*t,TValue*key,StkId val){\r\nint loop;\r\nfor(loop=0;loop<100;loop++){\r\nconst TValue*tm;\r\nif(ttistable(t)){\r\nTable*h=hvalue(t);\r\nconst TValue*res=luaH_get(h,key);\r\nif(!ttisnil(res)||\r\n(tm=fasttm(L,h->metatable,TM_INDEX))==NULL){\r\nsetobj(L,val,res);\r\nreturn;\r\n}\r\n}\r\nelse if(ttisnil(tm=luaT_gettmbyobj(L,t,TM_INDEX)))\r\nluaG_typeerror(L,t,\"index\");\r\nif(ttisfunction(tm)){\r\ncallTMres(L,val,tm,t,key);\r\nreturn;\r\n}\r\nt=tm;\r\n}\r\nluaG_runerror(L,\"loop in gettable\");\r\n}\r\nstatic void luaV_settable(lua_State*L,const TValue*t,TValue*key,StkId val){\r\nint loop;\r\nTValue temp;\r\nfor(loop=0;loop<100;loop++){\r\nconst TValue*tm;\r\nif(ttistable(t)){\r\nTable*h=hvalue(t);\r\nTValue*oldval=luaH_set(L,h,key);\r\nif(!ttisnil(oldval)||\r\n(tm=fasttm(L,h->metatable,TM_NEWINDEX))==NULL){\r\nsetobj(L,oldval,val);\r\nh->flags=0;\r\nluaC_barriert(L,h,val);\r\nreturn;\r\n}\r\n}\r\nelse if(ttisnil(tm=luaT_gettmbyobj(L,t,TM_NEWINDEX)))\r\nluaG_typeerror(L,t,\"index\");\r\nif(ttisfunction(tm)){\r\ncallTM(L,tm,t,key,val);\r\nreturn;\r\n}\r\nsetobj(L,&temp,tm);\r\nt=&temp;\r\n}\r\nluaG_runerror(L,\"loop in settable\");\r\n}\r\nstatic int call_binTM(lua_State*L,const TValue*p1,const TValue*p2,\r\nStkId res,TMS event){\r\nconst TValue*tm=luaT_gettmbyobj(L,p1,event);\r\nif(ttisnil(tm))\r\ntm=luaT_gettmbyobj(L,p2,event);\r\nif(ttisnil(tm))return 0;\r\ncallTMres(L,res,tm,p1,p2);\r\nreturn 1;\r\n}\r\nstatic const TValue*get_compTM(lua_State*L,Table*mt1,Table*mt2,\r\nTMS event){\r\nconst TValue*tm1=fasttm(L,mt1,event);\r\nconst TValue*tm2;\r\nif(tm1==NULL)return NULL;\r\nif(mt1==mt2)return tm1;\r\ntm2=fasttm(L,mt2,event);\r\nif(tm2==NULL)return NULL;\r\nif(luaO_rawequalObj(tm1,tm2))\r\nreturn tm1;\r\nreturn NULL;\r\n}\r\nstatic int call_orderTM(lua_State*L,const TValue*p1,const TValue*p2,\r\nTMS event){\r\nconst TValue*tm1=luaT_gettmbyobj(L,p1,event);\r\nconst TValue*tm2;\r\nif(ttisnil(tm1))return-1;\r\ntm2=luaT_gettmbyobj(L,p2,event);\r\nif(!luaO_rawequalObj(tm1,tm2))\r\nreturn-1;\r\ncallTMres(L,L->top,tm1,p1,p2);\r\nreturn!l_isfalse(L->top);\r\n}\r\nstatic int l_strcmp(const TString*ls,const TString*rs){\r\nconst char*l=getstr(ls);\r\nsize_t ll=ls->tsv.len;\r\nconst char*r=getstr(rs);\r\nsize_t lr=rs->tsv.len;\r\nfor(;;){\r\nint temp=strcoll(l,r);\r\nif(temp!=0)return temp;\r\nelse{\r\nsize_t len=strlen(l);\r\nif(len==lr)\r\nreturn(len==ll)?0:1;\r\nelse if(len==ll)\r\nreturn-1;\r\nlen++;\r\nl+=len;ll-=len;r+=len;lr-=len;\r\n}\r\n}\r\n}\r\nstatic int luaV_lessthan(lua_State*L,const TValue*l,const TValue*r){\r\nint res;\r\nif(ttype(l)!=ttype(r))\r\nreturn luaG_ordererror(L,l,r);\r\nelse if(ttisnumber(l))\r\nreturn luai_numlt(nvalue(l),nvalue(r));\r\nelse if(ttisstring(l))\r\nreturn l_strcmp(rawtsvalue(l),rawtsvalue(r))<0;\r\nelse if((res=call_orderTM(L,l,r,TM_LT))!=-1)\r\nreturn res;\r\nreturn luaG_ordererror(L,l,r);\r\n}\r\nstatic int lessequal(lua_State*L,const TValue*l,const TValue*r){\r\nint res;\r\nif(ttype(l)!=ttype(r))\r\nreturn luaG_ordererror(L,l,r);\r\nelse if(ttisnumber(l))\r\nreturn luai_numle(nvalue(l),nvalue(r));\r\nelse if(ttisstring(l))\r\nreturn l_strcmp(rawtsvalue(l),rawtsvalue(r))<=0;\r\nelse if((res=call_orderTM(L,l,r,TM_LE))!=-1)\r\nreturn res;\r\nelse if((res=call_orderTM(L,r,l,TM_LT))!=-1)\r\nreturn!res;\r\nreturn luaG_ordererror(L,l,r);\r\n}\r\nstatic int luaV_equalval(lua_State*L,const TValue*t1,const TValue*t2){\r\nconst TValue*tm;\r\nswitch(ttype(t1)){\r\ncase 0:return 1;\r\ncase 3:return luai_numeq(nvalue(t1),nvalue(t2));\r\ncase 1:return bvalue(t1)==bvalue(t2);\r\ncase 2:return pvalue(t1)==pvalue(t2);\r\ncase 7:{\r\nif(uvalue(t1)==uvalue(t2))return 1;\r\ntm=get_compTM(L,uvalue(t1)->metatable,uvalue(t2)->metatable,\r\nTM_EQ);\r\nbreak;\r\n}\r\ncase 5:{\r\nif(hvalue(t1)==hvalue(t2))return 1;\r\ntm=get_compTM(L,hvalue(t1)->metatable,hvalue(t2)->metatable,TM_EQ);\r\nbreak;\r\n}\r\ndefault:return gcvalue(t1)==gcvalue(t2);\r\n}\r\nif(tm==NULL)return 0;\r\ncallTMres(L,L->top,tm,t1,t2);\r\nreturn!l_isfalse(L->top);\r\n}\r\nstatic void luaV_concat(lua_State*L,int total,int last){\r\ndo{\r\nStkId top=L->base+last+1;\r\nint n=2;\r\nif(!(ttisstring(top-2)||ttisnumber(top-2))||!tostring(L,top-1)){\r\nif(!call_binTM(L,top-2,top-1,top-2,TM_CONCAT))\r\nluaG_concaterror(L,top-2,top-1);\r\n}else if(tsvalue(top-1)->len==0)\r\n(void)tostring(L,top-2);\r\nelse{\r\nsize_t tl=tsvalue(top-1)->len;\r\nchar*buffer;\r\nint i;\r\nfor(n=1;n<total&&tostring(L,top-n-1);n++){\r\nsize_t l=tsvalue(top-n-1)->len;\r\nif(l>=((size_t)(~(size_t)0)-2)-tl)luaG_runerror(L,\"string length overflow\");\r\ntl+=l;\r\n}\r\nbuffer=luaZ_openspace(L,&G(L)->buff,tl);\r\ntl=0;\r\nfor(i=n;i>0;i--){\r\nsize_t l=tsvalue(top-i)->len;\r\nmemcpy(buffer+tl,svalue(top-i),l);\r\ntl+=l;\r\n}\r\nsetsvalue(L,top-n,luaS_newlstr(L,buffer,tl));\r\n}\r\ntotal-=n-1;\r\nlast-=n-1;\r\n}while(total>1);\r\n}\r\nstatic void Arith(lua_State*L,StkId ra,const TValue*rb,\r\nconst TValue*rc,TMS op){\r\nTValue tempb,tempc;\r\nconst TValue*b,*c;\r\nif((b=luaV_tonumber(rb,&tempb))!=NULL&&\r\n(c=luaV_tonumber(rc,&tempc))!=NULL){\r\nlua_Number nb=nvalue(b),nc=nvalue(c);\r\nswitch(op){\r\ncase TM_ADD:setnvalue(ra,luai_numadd(nb,nc));break;\r\ncase TM_SUB:setnvalue(ra,luai_numsub(nb,nc));break;\r\ncase TM_MUL:setnvalue(ra,luai_nummul(nb,nc));break;\r\ncase TM_DIV:setnvalue(ra,luai_numdiv(nb,nc));break;\r\ncase TM_MOD:setnvalue(ra,luai_nummod(nb,nc));break;\r\ncase TM_POW:setnvalue(ra,luai_numpow(nb,nc));break;\r\ncase TM_UNM:setnvalue(ra,luai_numunm(nb));break;\r\ndefault:break;\r\n}\r\n}\r\nelse if(!call_binTM(L,rb,rc,ra,op))\r\nluaG_aritherror(L,rb,rc);\r\n}\r\n#define runtime_check(L,c){if(!(c))break;}\r\n#define RA(i)(base+GETARG_A(i))\r\n#define RB(i)check_exp(getBMode(GET_OPCODE(i))==OpArgR,base+GETARG_B(i))\r\n#define RKB(i)check_exp(getBMode(GET_OPCODE(i))==OpArgK,ISK(GETARG_B(i))?k+INDEXK(GETARG_B(i)):base+GETARG_B(i))\r\n#define RKC(i)check_exp(getCMode(GET_OPCODE(i))==OpArgK,ISK(GETARG_C(i))?k+INDEXK(GETARG_C(i)):base+GETARG_C(i))\r\n#define KBx(i)check_exp(getBMode(GET_OPCODE(i))==OpArgK,k+GETARG_Bx(i))\r\n#define dojump(L,pc,i){(pc)+=(i);}\r\n#define Protect(x){L->savedpc=pc;{x;};base=L->base;}\r\n#define arith_op(op,tm){TValue*rb=RKB(i);TValue*rc=RKC(i);if(ttisnumber(rb)&&ttisnumber(rc)){lua_Number nb=nvalue(rb),nc=nvalue(rc);setnvalue(ra,op(nb,nc));}else Protect(Arith(L,ra,rb,rc,tm));}\r\nstatic void luaV_execute(lua_State*L,int nexeccalls){\r\nLClosure*cl;\r\nStkId base;\r\nTValue*k;\r\nconst Instruction*pc;\r\nreentry:\r\npc=L->savedpc;\r\ncl=&clvalue(L->ci->func)->l;\r\nbase=L->base;\r\nk=cl->p->k;\r\nfor(;;){\r\nconst Instruction i=*pc++;\r\nStkId ra;\r\nra=RA(i);\r\nswitch(GET_OPCODE(i)){\r\ncase OP_MOVE:{\r\nsetobj(L,ra,RB(i));\r\ncontinue;\r\n}\r\ncase OP_LOADK:{\r\nsetobj(L,ra,KBx(i));\r\ncontinue;\r\n}\r\ncase OP_LOADBOOL:{\r\nsetbvalue(ra,GETARG_B(i));\r\nif(GETARG_C(i))pc++;\r\ncontinue;\r\n}\r\ncase OP_LOADNIL:{\r\nTValue*rb=RB(i);\r\ndo{\r\nsetnilvalue(rb--);\r\n}while(rb>=ra);\r\ncontinue;\r\n}\r\ncase OP_GETUPVAL:{\r\nint b=GETARG_B(i);\r\nsetobj(L,ra,cl->upvals[b]->v);\r\ncontinue;\r\n}\r\ncase OP_GETGLOBAL:{\r\nTValue g;\r\nTValue*rb=KBx(i);\r\nsethvalue(L,&g,cl->env);\r\nProtect(luaV_gettable(L,&g,rb,ra));\r\ncontinue;\r\n}\r\ncase OP_GETTABLE:{\r\nProtect(luaV_gettable(L,RB(i),RKC(i),ra));\r\ncontinue;\r\n}\r\ncase OP_SETGLOBAL:{\r\nTValue g;\r\nsethvalue(L,&g,cl->env);\r\nProtect(luaV_settable(L,&g,KBx(i),ra));\r\ncontinue;\r\n}\r\ncase OP_SETUPVAL:{\r\nUpVal*uv=cl->upvals[GETARG_B(i)];\r\nsetobj(L,uv->v,ra);\r\nluaC_barrier(L,uv,ra);\r\ncontinue;\r\n}\r\ncase OP_SETTABLE:{\r\nProtect(luaV_settable(L,ra,RKB(i),RKC(i)));\r\ncontinue;\r\n}\r\ncase OP_NEWTABLE:{\r\nint b=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nsethvalue(L,ra,luaH_new(L,luaO_fb2int(b),luaO_fb2int(c)));\r\nProtect(luaC_checkGC(L));\r\ncontinue;\r\n}\r\ncase OP_SELF:{\r\nStkId rb=RB(i);\r\nsetobj(L,ra+1,rb);\r\nProtect(luaV_gettable(L,rb,RKC(i),ra));\r\ncontinue;\r\n}\r\ncase OP_ADD:{\r\narith_op(luai_numadd,TM_ADD);\r\ncontinue;\r\n}\r\ncase OP_SUB:{\r\narith_op(luai_numsub,TM_SUB);\r\ncontinue;\r\n}\r\ncase OP_MUL:{\r\narith_op(luai_nummul,TM_MUL);\r\ncontinue;\r\n}\r\ncase OP_DIV:{\r\narith_op(luai_numdiv,TM_DIV);\r\ncontinue;\r\n}\r\ncase OP_MOD:{\r\narith_op(luai_nummod,TM_MOD);\r\ncontinue;\r\n}\r\ncase OP_POW:{\r\narith_op(luai_numpow,TM_POW);\r\ncontinue;\r\n}\r\ncase OP_UNM:{\r\nTValue*rb=RB(i);\r\nif(ttisnumber(rb)){\r\nlua_Number nb=nvalue(rb);\r\nsetnvalue(ra,luai_numunm(nb));\r\n}\r\nelse{\r\nProtect(Arith(L,ra,rb,rb,TM_UNM));\r\n}\r\ncontinue;\r\n}\r\ncase OP_NOT:{\r\nint res=l_isfalse(RB(i));\r\nsetbvalue(ra,res);\r\ncontinue;\r\n}\r\ncase OP_LEN:{\r\nconst TValue*rb=RB(i);\r\nswitch(ttype(rb)){\r\ncase 5:{\r\nsetnvalue(ra,cast_num(luaH_getn(hvalue(rb))));\r\nbreak;\r\n}\r\ncase 4:{\r\nsetnvalue(ra,cast_num(tsvalue(rb)->len));\r\nbreak;\r\n}\r\ndefault:{\r\nProtect(\r\nif(!call_binTM(L,rb,(&luaO_nilobject_),ra,TM_LEN))\r\nluaG_typeerror(L,rb,\"get length of\");\r\n)\r\n}\r\n}\r\ncontinue;\r\n}\r\ncase OP_CONCAT:{\r\nint b=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nProtect(luaV_concat(L,c-b+1,c);luaC_checkGC(L));\r\nsetobj(L,RA(i),base+b);\r\ncontinue;\r\n}\r\ncase OP_JMP:{\r\ndojump(L,pc,GETARG_sBx(i));\r\ncontinue;\r\n}\r\ncase OP_EQ:{\r\nTValue*rb=RKB(i);\r\nTValue*rc=RKC(i);\r\nProtect(\r\nif(equalobj(L,rb,rc)==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_LT:{\r\nProtect(\r\nif(luaV_lessthan(L,RKB(i),RKC(i))==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_LE:{\r\nProtect(\r\nif(lessequal(L,RKB(i),RKC(i))==GETARG_A(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n)\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_TEST:{\r\nif(l_isfalse(ra)!=GETARG_C(i))\r\ndojump(L,pc,GETARG_sBx(*pc));\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_TESTSET:{\r\nTValue*rb=RB(i);\r\nif(l_isfalse(rb)!=GETARG_C(i)){\r\nsetobj(L,ra,rb);\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n}\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_CALL:{\r\nint b=GETARG_B(i);\r\nint nresults=GETARG_C(i)-1;\r\nif(b!=0)L->top=ra+b;\r\nL->savedpc=pc;\r\nswitch(luaD_precall(L,ra,nresults)){\r\ncase 0:{\r\nnexeccalls++;\r\ngoto reentry;\r\n}\r\ncase 1:{\r\nif(nresults>=0)L->top=L->ci->top;\r\nbase=L->base;\r\ncontinue;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\n}\r\ncase OP_TAILCALL:{\r\nint b=GETARG_B(i);\r\nif(b!=0)L->top=ra+b;\r\nL->savedpc=pc;\r\nswitch(luaD_precall(L,ra,(-1))){\r\ncase 0:{\r\nCallInfo*ci=L->ci-1;\r\nint aux;\r\nStkId func=ci->func;\r\nStkId pfunc=(ci+1)->func;\r\nif(L->openupval)luaF_close(L,ci->base);\r\nL->base=ci->base=ci->func+((ci+1)->base-pfunc);\r\nfor(aux=0;pfunc+aux<L->top;aux++)\r\nsetobj(L,func+aux,pfunc+aux);\r\nci->top=L->top=func+aux;\r\nci->savedpc=L->savedpc;\r\nci->tailcalls++;\r\nL->ci--;\r\ngoto reentry;\r\n}\r\ncase 1:{\r\nbase=L->base;\r\ncontinue;\r\n}\r\ndefault:{\r\nreturn;\r\n}\r\n}\r\n}\r\ncase OP_RETURN:{\r\nint b=GETARG_B(i);\r\nif(b!=0)L->top=ra+b-1;\r\nif(L->openupval)luaF_close(L,base);\r\nL->savedpc=pc;\r\nb=luaD_poscall(L,ra);\r\nif(--nexeccalls==0)\r\nreturn;\r\nelse{\r\nif(b)L->top=L->ci->top;\r\ngoto reentry;\r\n}\r\n}\r\ncase OP_FORLOOP:{\r\nlua_Number step=nvalue(ra+2);\r\nlua_Number idx=luai_numadd(nvalue(ra),step);\r\nlua_Number limit=nvalue(ra+1);\r\nif(luai_numlt(0,step)?luai_numle(idx,limit)\r\n:luai_numle(limit,idx)){\r\ndojump(L,pc,GETARG_sBx(i));\r\nsetnvalue(ra,idx);\r\nsetnvalue(ra+3,idx);\r\n}\r\ncontinue;\r\n}\r\ncase OP_FORPREP:{\r\nconst TValue*init=ra;\r\nconst TValue*plimit=ra+1;\r\nconst TValue*pstep=ra+2;\r\nL->savedpc=pc;\r\nif(!tonumber(init,ra))\r\nluaG_runerror(L,LUA_QL(\"for\")\" initial value must be a number\");\r\nelse if(!tonumber(plimit,ra+1))\r\nluaG_runerror(L,LUA_QL(\"for\")\" limit must be a number\");\r\nelse if(!tonumber(pstep,ra+2))\r\nluaG_runerror(L,LUA_QL(\"for\")\" step must be a number\");\r\nsetnvalue(ra,luai_numsub(nvalue(ra),nvalue(pstep)));\r\ndojump(L,pc,GETARG_sBx(i));\r\ncontinue;\r\n}\r\ncase OP_TFORLOOP:{\r\nStkId cb=ra+3;\r\nsetobj(L,cb+2,ra+2);\r\nsetobj(L,cb+1,ra+1);\r\nsetobj(L,cb,ra);\r\nL->top=cb+3;\r\nProtect(luaD_call(L,cb,GETARG_C(i)));\r\nL->top=L->ci->top;\r\ncb=RA(i)+3;\r\nif(!ttisnil(cb)){\r\nsetobj(L,cb-1,cb);\r\ndojump(L,pc,GETARG_sBx(*pc));\r\n}\r\npc++;\r\ncontinue;\r\n}\r\ncase OP_SETLIST:{\r\nint n=GETARG_B(i);\r\nint c=GETARG_C(i);\r\nint last;\r\nTable*h;\r\nif(n==0){\r\nn=cast_int(L->top-ra)-1;\r\nL->top=L->ci->top;\r\n}\r\nif(c==0)c=cast_int(*pc++);\r\nruntime_check(L,ttistable(ra));\r\nh=hvalue(ra);\r\nlast=((c-1)*50)+n;\r\nif(last>h->sizearray)\r\nluaH_resizearray(L,h,last);\r\nfor(;n>0;n--){\r\nTValue*val=ra+n;\r\nsetobj(L,luaH_setnum(L,h,last--),val);\r\nluaC_barriert(L,h,val);\r\n}\r\ncontinue;\r\n}\r\ncase OP_CLOSE:{\r\nluaF_close(L,ra);\r\ncontinue;\r\n}\r\ncase OP_CLOSURE:{\r\nProto*p;\r\nClosure*ncl;\r\nint nup,j;\r\np=cl->p->p[GETARG_Bx(i)];\r\nnup=p->nups;\r\nncl=luaF_newLclosure(L,nup,cl->env);\r\nncl->l.p=p;\r\nfor(j=0;j<nup;j++,pc++){\r\nif(GET_OPCODE(*pc)==OP_GETUPVAL)\r\nncl->l.upvals[j]=cl->upvals[GETARG_B(*pc)];\r\nelse{\r\nncl->l.upvals[j]=luaF_findupval(L,base+GETARG_B(*pc));\r\n}\r\n}\r\nsetclvalue(L,ra,ncl);\r\nProtect(luaC_checkGC(L));\r\ncontinue;\r\n}\r\ncase OP_VARARG:{\r\nint b=GETARG_B(i)-1;\r\nint j;\r\nCallInfo*ci=L->ci;\r\nint n=cast_int(ci->base-ci->func)-cl->p->numparams-1;\r\nif(b==(-1)){\r\nProtect(luaD_checkstack(L,n));\r\nra=RA(i);\r\nb=n;\r\nL->top=ra+n;\r\n}\r\nfor(j=0;j<b;j++){\r\nif(j<n){\r\nsetobj(L,ra+j,ci->base-n+j);\r\n}\r\nelse{\r\nsetnilvalue(ra+j);\r\n}\r\n}\r\ncontinue;\r\n}\r\n}\r\n}\r\n}\r\n#define api_checknelems(L,n)luai_apicheck(L,(n)<=(L->top-L->base))\r\n#define api_checkvalidindex(L,i)luai_apicheck(L,(i)!=(&luaO_nilobject_))\r\n#define api_incr_top(L){luai_apicheck(L,L->top<L->ci->top);L->top++;}\r\nstatic TValue*index2adr(lua_State*L,int idx){\r\nif(idx>0){\r\nTValue*o=L->base+(idx-1);\r\nluai_apicheck(L,idx<=L->ci->top-L->base);\r\nif(o>=L->top)return cast(TValue*,(&luaO_nilobject_));\r\nelse return o;\r\n}\r\nelse if(idx>(-10000)){\r\nluai_apicheck(L,idx!=0&&-idx<=L->top-L->base);\r\nreturn L->top+idx;\r\n}\r\nelse switch(idx){\r\ncase(-10000):return registry(L);\r\ncase(-10001):{\r\nClosure*func=curr_func(L);\r\nsethvalue(L,&L->env,func->c.env);\r\nreturn&L->env;\r\n}\r\ncase(-10002):return gt(L);\r\ndefault:{\r\nClosure*func=curr_func(L);\r\nidx=(-10002)-idx;\r\nreturn(idx<=func->c.nupvalues)\r\n?&func->c.upvalue[idx-1]\r\n:cast(TValue*,(&luaO_nilobject_));\r\n}\r\n}\r\n}\r\nstatic Table*getcurrenv(lua_State*L){\r\nif(L->ci==L->base_ci)\r\nreturn hvalue(gt(L));\r\nelse{\r\nClosure*func=curr_func(L);\r\nreturn func->c.env;\r\n}\r\n}\r\nstatic int lua_checkstack(lua_State*L,int size){\r\nint res=1;\r\nif(size>8000||(L->top-L->base+size)>8000)\r\nres=0;\r\nelse if(size>0){\r\nluaD_checkstack(L,size);\r\nif(L->ci->top<L->top+size)\r\nL->ci->top=L->top+size;\r\n}\r\nreturn res;\r\n}\r\nstatic lua_CFunction lua_atpanic(lua_State*L,lua_CFunction panicf){\r\nlua_CFunction old;\r\nold=G(L)->panic;\r\nG(L)->panic=panicf;\r\nreturn old;\r\n}\r\nstatic int lua_gettop(lua_State*L){\r\nreturn cast_int(L->top-L->base);\r\n}\r\nstatic void lua_settop(lua_State*L,int idx){\r\nif(idx>=0){\r\nluai_apicheck(L,idx<=L->stack_last-L->base);\r\nwhile(L->top<L->base+idx)\r\nsetnilvalue(L->top++);\r\nL->top=L->base+idx;\r\n}\r\nelse{\r\nluai_apicheck(L,-(idx+1)<=(L->top-L->base));\r\nL->top+=idx+1;\r\n}\r\n}\r\nstatic void lua_remove(lua_State*L,int idx){\r\nStkId p;\r\np=index2adr(L,idx);\r\napi_checkvalidindex(L,p);\r\nwhile(++p<L->top)setobj(L,p-1,p);\r\nL->top--;\r\n}\r\nstatic void lua_insert(lua_State*L,int idx){\r\nStkId p;\r\nStkId q;\r\np=index2adr(L,idx);\r\napi_checkvalidindex(L,p);\r\nfor(q=L->top;q>p;q--)setobj(L,q,q-1);\r\nsetobj(L,p,L->top);\r\n}\r\nstatic void lua_replace(lua_State*L,int idx){\r\nStkId o;\r\nif(idx==(-10001)&&L->ci==L->base_ci)\r\nluaG_runerror(L,\"no calling environment\");\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nif(idx==(-10001)){\r\nClosure*func=curr_func(L);\r\nluai_apicheck(L,ttistable(L->top-1));\r\nfunc->c.env=hvalue(L->top-1);\r\nluaC_barrier(L,func,L->top-1);\r\n}\r\nelse{\r\nsetobj(L,o,L->top-1);\r\nif(idx<(-10002))\r\nluaC_barrier(L,curr_func(L),L->top-1);\r\n}\r\nL->top--;\r\n}\r\nstatic void lua_pushvalue(lua_State*L,int idx){\r\nsetobj(L,L->top,index2adr(L,idx));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_type(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn(o==(&luaO_nilobject_))?(-1):ttype(o);\r\n}\r\nstatic const char*lua_typename(lua_State*L,int t){\r\nUNUSED(L);\r\nreturn(t==(-1))?\"no value\":luaT_typenames[t];\r\n}\r\nstatic int lua_iscfunction(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn iscfunction(o);\r\n}\r\nstatic int lua_isnumber(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nreturn tonumber(o,&n);\r\n}\r\nstatic int lua_isstring(lua_State*L,int idx){\r\nint t=lua_type(L,idx);\r\nreturn(t==4||t==3);\r\n}\r\nstatic int lua_rawequal(lua_State*L,int index1,int index2){\r\nStkId o1=index2adr(L,index1);\r\nStkId o2=index2adr(L,index2);\r\nreturn(o1==(&luaO_nilobject_)||o2==(&luaO_nilobject_))?0\r\n:luaO_rawequalObj(o1,o2);\r\n}\r\nstatic int lua_lessthan(lua_State*L,int index1,int index2){\r\nStkId o1,o2;\r\nint i;\r\no1=index2adr(L,index1);\r\no2=index2adr(L,index2);\r\ni=(o1==(&luaO_nilobject_)||o2==(&luaO_nilobject_))?0\r\n:luaV_lessthan(L,o1,o2);\r\nreturn i;\r\n}\r\nstatic lua_Number lua_tonumber(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nif(tonumber(o,&n))\r\nreturn nvalue(o);\r\nelse\r\nreturn 0;\r\n}\r\nstatic lua_Integer lua_tointeger(lua_State*L,int idx){\r\nTValue n;\r\nconst TValue*o=index2adr(L,idx);\r\nif(tonumber(o,&n)){\r\nlua_Integer res;\r\nlua_Number num=nvalue(o);\r\nlua_number2integer(res,num);\r\nreturn res;\r\n}\r\nelse\r\nreturn 0;\r\n}\r\nstatic int lua_toboolean(lua_State*L,int idx){\r\nconst TValue*o=index2adr(L,idx);\r\nreturn!l_isfalse(o);\r\n}\r\nstatic const char*lua_tolstring(lua_State*L,int idx,size_t*len){\r\nStkId o=index2adr(L,idx);\r\nif(!ttisstring(o)){\r\nif(!luaV_tostring(L,o)){\r\nif(len!=NULL)*len=0;\r\nreturn NULL;\r\n}\r\nluaC_checkGC(L);\r\no=index2adr(L,idx);\r\n}\r\nif(len!=NULL)*len=tsvalue(o)->len;\r\nreturn svalue(o);\r\n}\r\nstatic size_t lua_objlen(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nswitch(ttype(o)){\r\ncase 4:return tsvalue(o)->len;\r\ncase 7:return uvalue(o)->len;\r\ncase 5:return luaH_getn(hvalue(o));\r\ncase 3:{\r\nsize_t l;\r\nl=(luaV_tostring(L,o)?tsvalue(o)->len:0);\r\nreturn l;\r\n}\r\ndefault:return 0;\r\n}\r\n}\r\nstatic lua_CFunction lua_tocfunction(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nreturn(!iscfunction(o))?NULL:clvalue(o)->c.f;\r\n}\r\nstatic void*lua_touserdata(lua_State*L,int idx){\r\nStkId o=index2adr(L,idx);\r\nswitch(ttype(o)){\r\ncase 7:return(rawuvalue(o)+1);\r\ncase 2:return pvalue(o);\r\ndefault:return NULL;\r\n}\r\n}\r\nstatic void lua_pushnil(lua_State*L){\r\nsetnilvalue(L->top);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushnumber(lua_State*L,lua_Number n){\r\nsetnvalue(L->top,n);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushinteger(lua_State*L,lua_Integer n){\r\nsetnvalue(L->top,cast_num(n));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushlstring(lua_State*L,const char*s,size_t len){\r\nluaC_checkGC(L);\r\nsetsvalue(L,L->top,luaS_newlstr(L,s,len));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushstring(lua_State*L,const char*s){\r\nif(s==NULL)\r\nlua_pushnil(L);\r\nelse\r\nlua_pushlstring(L,s,strlen(s));\r\n}\r\nstatic const char*lua_pushvfstring(lua_State*L,const char*fmt,\r\nva_list argp){\r\nconst char*ret;\r\nluaC_checkGC(L);\r\nret=luaO_pushvfstring(L,fmt,argp);\r\nreturn ret;\r\n}\r\nstatic const char*lua_pushfstring(lua_State*L,const char*fmt,...){\r\nconst char*ret;\r\nva_list argp;\r\nluaC_checkGC(L);\r\nva_start(argp,fmt);\r\nret=luaO_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nreturn ret;\r\n}\r\nstatic void lua_pushcclosure(lua_State*L,lua_CFunction fn,int n){\r\nClosure*cl;\r\nluaC_checkGC(L);\r\napi_checknelems(L,n);\r\ncl=luaF_newCclosure(L,n,getcurrenv(L));\r\ncl->c.f=fn;\r\nL->top-=n;\r\nwhile(n--)\r\nsetobj(L,&cl->c.upvalue[n],L->top+n);\r\nsetclvalue(L,L->top,cl);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_pushboolean(lua_State*L,int b){\r\nsetbvalue(L->top,(b!=0));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_pushthread(lua_State*L){\r\nsetthvalue(L,L->top,L);\r\napi_incr_top(L);\r\nreturn(G(L)->mainthread==L);\r\n}\r\nstatic void lua_gettable(lua_State*L,int idx){\r\nStkId t;\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nluaV_gettable(L,t,L->top-1,L->top-1);\r\n}\r\nstatic void lua_getfield(lua_State*L,int idx,const char*k){\r\nStkId t;\r\nTValue key;\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nsetsvalue(L,&key,luaS_new(L,k));\r\nluaV_gettable(L,t,&key,L->top);\r\napi_incr_top(L);\r\n}\r\nstatic void lua_rawget(lua_State*L,int idx){\r\nStkId t;\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nsetobj(L,L->top-1,luaH_get(hvalue(t),L->top-1));\r\n}\r\nstatic void lua_rawgeti(lua_State*L,int idx,int n){\r\nStkId o;\r\no=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(o));\r\nsetobj(L,L->top,luaH_getnum(hvalue(o),n));\r\napi_incr_top(L);\r\n}\r\nstatic void lua_createtable(lua_State*L,int narray,int nrec){\r\nluaC_checkGC(L);\r\nsethvalue(L,L->top,luaH_new(L,narray,nrec));\r\napi_incr_top(L);\r\n}\r\nstatic int lua_getmetatable(lua_State*L,int objindex){\r\nconst TValue*obj;\r\nTable*mt=NULL;\r\nint res;\r\nobj=index2adr(L,objindex);\r\nswitch(ttype(obj)){\r\ncase 5:\r\nmt=hvalue(obj)->metatable;\r\nbreak;\r\ncase 7:\r\nmt=uvalue(obj)->metatable;\r\nbreak;\r\ndefault:\r\nmt=G(L)->mt[ttype(obj)];\r\nbreak;\r\n}\r\nif(mt==NULL)\r\nres=0;\r\nelse{\r\nsethvalue(L,L->top,mt);\r\napi_incr_top(L);\r\nres=1;\r\n}\r\nreturn res;\r\n}\r\nstatic void lua_getfenv(lua_State*L,int idx){\r\nStkId o;\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nswitch(ttype(o)){\r\ncase 6:\r\nsethvalue(L,L->top,clvalue(o)->c.env);\r\nbreak;\r\ncase 7:\r\nsethvalue(L,L->top,uvalue(o)->env);\r\nbreak;\r\ncase 8:\r\nsetobj(L,L->top,gt(thvalue(o)));\r\nbreak;\r\ndefault:\r\nsetnilvalue(L->top);\r\nbreak;\r\n}\r\napi_incr_top(L);\r\n}\r\nstatic void lua_settable(lua_State*L,int idx){\r\nStkId t;\r\napi_checknelems(L,2);\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nluaV_settable(L,t,L->top-2,L->top-1);\r\nL->top-=2;\r\n}\r\nstatic void lua_setfield(lua_State*L,int idx,const char*k){\r\nStkId t;\r\nTValue key;\r\napi_checknelems(L,1);\r\nt=index2adr(L,idx);\r\napi_checkvalidindex(L,t);\r\nsetsvalue(L,&key,luaS_new(L,k));\r\nluaV_settable(L,t,&key,L->top-1);\r\nL->top--;\r\n}\r\nstatic void lua_rawset(lua_State*L,int idx){\r\nStkId t;\r\napi_checknelems(L,2);\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nsetobj(L,luaH_set(L,hvalue(t),L->top-2),L->top-1);\r\nluaC_barriert(L,hvalue(t),L->top-1);\r\nL->top-=2;\r\n}\r\nstatic void lua_rawseti(lua_State*L,int idx,int n){\r\nStkId o;\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(o));\r\nsetobj(L,luaH_setnum(L,hvalue(o),n),L->top-1);\r\nluaC_barriert(L,hvalue(o),L->top-1);\r\nL->top--;\r\n}\r\nstatic int lua_setmetatable(lua_State*L,int objindex){\r\nTValue*obj;\r\nTable*mt;\r\napi_checknelems(L,1);\r\nobj=index2adr(L,objindex);\r\napi_checkvalidindex(L,obj);\r\nif(ttisnil(L->top-1))\r\nmt=NULL;\r\nelse{\r\nluai_apicheck(L,ttistable(L->top-1));\r\nmt=hvalue(L->top-1);\r\n}\r\nswitch(ttype(obj)){\r\ncase 5:{\r\nhvalue(obj)->metatable=mt;\r\nif(mt)\r\nluaC_objbarriert(L,hvalue(obj),mt);\r\nbreak;\r\n}\r\ncase 7:{\r\nuvalue(obj)->metatable=mt;\r\nif(mt)\r\nluaC_objbarrier(L,rawuvalue(obj),mt);\r\nbreak;\r\n}\r\ndefault:{\r\nG(L)->mt[ttype(obj)]=mt;\r\nbreak;\r\n}\r\n}\r\nL->top--;\r\nreturn 1;\r\n}\r\nstatic int lua_setfenv(lua_State*L,int idx){\r\nStkId o;\r\nint res=1;\r\napi_checknelems(L,1);\r\no=index2adr(L,idx);\r\napi_checkvalidindex(L,o);\r\nluai_apicheck(L,ttistable(L->top-1));\r\nswitch(ttype(o)){\r\ncase 6:\r\nclvalue(o)->c.env=hvalue(L->top-1);\r\nbreak;\r\ncase 7:\r\nuvalue(o)->env=hvalue(L->top-1);\r\nbreak;\r\ncase 8:\r\nsethvalue(L,gt(thvalue(o)),hvalue(L->top-1));\r\nbreak;\r\ndefault:\r\nres=0;\r\nbreak;\r\n}\r\nif(res)luaC_objbarrier(L,gcvalue(o),hvalue(L->top-1));\r\nL->top--;\r\nreturn res;\r\n}\r\n#define adjustresults(L,nres){if(nres==(-1)&&L->top>=L->ci->top)L->ci->top=L->top;}\r\n#define checkresults(L,na,nr)luai_apicheck(L,(nr)==(-1)||(L->ci->top-L->top>=(nr)-(na)))\r\nstatic void lua_call(lua_State*L,int nargs,int nresults){\r\nStkId func;\r\napi_checknelems(L,nargs+1);\r\ncheckresults(L,nargs,nresults);\r\nfunc=L->top-(nargs+1);\r\nluaD_call(L,func,nresults);\r\nadjustresults(L,nresults);\r\n}\r\nstruct CallS{\r\nStkId func;\r\nint nresults;\r\n};\r\nstatic void f_call(lua_State*L,void*ud){\r\nstruct CallS*c=cast(struct CallS*,ud);\r\nluaD_call(L,c->func,c->nresults);\r\n}\r\nstatic int lua_pcall(lua_State*L,int nargs,int nresults,int errfunc){\r\nstruct CallS c;\r\nint status;\r\nptrdiff_t func;\r\napi_checknelems(L,nargs+1);\r\ncheckresults(L,nargs,nresults);\r\nif(errfunc==0)\r\nfunc=0;\r\nelse{\r\nStkId o=index2adr(L,errfunc);\r\napi_checkvalidindex(L,o);\r\nfunc=savestack(L,o);\r\n}\r\nc.func=L->top-(nargs+1);\r\nc.nresults=nresults;\r\nstatus=luaD_pcall(L,f_call,&c,savestack(L,c.func),func);\r\nadjustresults(L,nresults);\r\nreturn status;\r\n}\r\nstatic int lua_load(lua_State*L,lua_Reader reader,void*data,\r\nconst char*chunkname){\r\nZIO z;\r\nint status;\r\nif(!chunkname)chunkname=\"?\";\r\nluaZ_init(L,&z,reader,data);\r\nstatus=luaD_protectedparser(L,&z,chunkname);\r\nreturn status;\r\n}\r\nstatic int lua_error(lua_State*L){\r\napi_checknelems(L,1);\r\nluaG_errormsg(L);\r\nreturn 0;\r\n}\r\nstatic int lua_next(lua_State*L,int idx){\r\nStkId t;\r\nint more;\r\nt=index2adr(L,idx);\r\nluai_apicheck(L,ttistable(t));\r\nmore=luaH_next(L,hvalue(t),L->top-1);\r\nif(more){\r\napi_incr_top(L);\r\n}\r\nelse\r\nL->top-=1;\r\nreturn more;\r\n}\r\nstatic void lua_concat(lua_State*L,int n){\r\napi_checknelems(L,n);\r\nif(n>=2){\r\nluaC_checkGC(L);\r\nluaV_concat(L,n,cast_int(L->top-L->base)-1);\r\nL->top-=(n-1);\r\n}\r\nelse if(n==0){\r\nsetsvalue(L,L->top,luaS_newlstr(L,\"\",0));\r\napi_incr_top(L);\r\n}\r\n}\r\nstatic void*lua_newuserdata(lua_State*L,size_t size){\r\nUdata*u;\r\nluaC_checkGC(L);\r\nu=luaS_newudata(L,size,getcurrenv(L));\r\nsetuvalue(L,L->top,u);\r\napi_incr_top(L);\r\nreturn u+1;\r\n}\r\n#define luaL_getn(L,i)((int)lua_objlen(L,i))\r\n#define luaL_setn(L,i,j)((void)0)\r\ntypedef struct luaL_Reg{\r\nconst char*name;\r\nlua_CFunction func;\r\n}luaL_Reg;\r\nstatic void luaI_openlib(lua_State*L,const char*libname,\r\nconst luaL_Reg*l,int nup);\r\nstatic int luaL_argerror(lua_State*L,int numarg,const char*extramsg);\r\nstatic const char* luaL_checklstring(lua_State*L,int numArg,\r\nsize_t*l);\r\nstatic const char* luaL_optlstring(lua_State*L,int numArg,\r\nconst char*def,size_t*l);\r\nstatic lua_Integer luaL_checkinteger(lua_State*L,int numArg);\r\nstatic lua_Integer luaL_optinteger(lua_State*L,int nArg,\r\nlua_Integer def);\r\nstatic int luaL_error(lua_State*L,const char*fmt,...);\r\nstatic const char* luaL_findtable(lua_State*L,int idx,\r\nconst char*fname,int szhint);\r\n#define luaL_argcheck(L,cond,numarg,extramsg)((void)((cond)||luaL_argerror(L,(numarg),(extramsg))))\r\n#define luaL_checkstring(L,n)(luaL_checklstring(L,(n),NULL))\r\n#define luaL_optstring(L,n,d)(luaL_optlstring(L,(n),(d),NULL))\r\n#define luaL_checkint(L,n)((int)luaL_checkinteger(L,(n)))\r\n#define luaL_optint(L,n,d)((int)luaL_optinteger(L,(n),(d)))\r\n#define luaL_typename(L,i)lua_typename(L,lua_type(L,(i)))\r\n#define luaL_getmetatable(L,n)(lua_getfield(L,(-10000),(n)))\r\n#define luaL_opt(L,f,n,d)(lua_isnoneornil(L,(n))?(d):f(L,(n)))\r\ntypedef struct luaL_Buffer{\r\nchar*p;\r\nint lvl;\r\nlua_State*L;\r\nchar buffer[BUFSIZ];\r\n}luaL_Buffer;\r\n#define luaL_addchar(B,c)((void)((B)->p<((B)->buffer+BUFSIZ)||luaL_prepbuffer(B)),(*(B)->p++=(char)(c)))\r\n#define luaL_addsize(B,n)((B)->p+=(n))\r\nstatic char* luaL_prepbuffer(luaL_Buffer*B);\r\nstatic int luaL_argerror(lua_State*L,int narg,const char*extramsg){\r\nlua_Debug ar;\r\nif(!lua_getstack(L,0,&ar))\r\nreturn luaL_error(L,\"bad argument #%d (%s)\",narg,extramsg);\r\nlua_getinfo(L,\"n\",&ar);\r\nif(strcmp(ar.namewhat,\"method\")==0){\r\nnarg--;\r\nif(narg==0)\r\nreturn luaL_error(L,\"calling \"LUA_QL(\"%s\")\" on bad self (%s)\",\r\nar.name,extramsg);\r\n}\r\nif(ar.name==NULL)\r\nar.name=\"?\";\r\nreturn luaL_error(L,\"bad argument #%d to \"LUA_QL(\"%s\")\" (%s)\",\r\nnarg,ar.name,extramsg);\r\n}\r\nstatic int luaL_typerror(lua_State*L,int narg,const char*tname){\r\nconst char*msg=lua_pushfstring(L,\"%s expected, got %s\",\r\ntname,luaL_typename(L,narg));\r\nreturn luaL_argerror(L,narg,msg);\r\n}\r\nstatic void tag_error(lua_State*L,int narg,int tag){\r\nluaL_typerror(L,narg,lua_typename(L,tag));\r\n}\r\nstatic void luaL_where(lua_State*L,int level){\r\nlua_Debug ar;\r\nif(lua_getstack(L,level,&ar)){\r\nlua_getinfo(L,\"Sl\",&ar);\r\nif(ar.currentline>0){\r\nlua_pushfstring(L,\"%s:%d: \",ar.short_src,ar.currentline);\r\nreturn;\r\n}\r\n}\r\nlua_pushliteral(L,\"\");\r\n}\r\nstatic int luaL_error(lua_State*L,const char*fmt,...){\r\nva_list argp;\r\nva_start(argp,fmt);\r\nluaL_where(L,1);\r\nlua_pushvfstring(L,fmt,argp);\r\nva_end(argp);\r\nlua_concat(L,2);\r\nreturn lua_error(L);\r\n}\r\nstatic int luaL_newmetatable(lua_State*L,const char*tname){\r\nlua_getfield(L,(-10000),tname);\r\nif(!lua_isnil(L,-1))\r\nreturn 0;\r\nlua_pop(L,1);\r\nlua_newtable(L);\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,(-10000),tname);\r\nreturn 1;\r\n}\r\nstatic void*luaL_checkudata(lua_State*L,int ud,const char*tname){\r\nvoid*p=lua_touserdata(L,ud);\r\nif(p!=NULL){\r\nif(lua_getmetatable(L,ud)){\r\nlua_getfield(L,(-10000),tname);\r\nif(lua_rawequal(L,-1,-2)){\r\nlua_pop(L,2);\r\nreturn p;\r\n}\r\n}\r\n}\r\nluaL_typerror(L,ud,tname);\r\nreturn NULL;\r\n}\r\nstatic void luaL_checkstack(lua_State*L,int space,const char*mes){\r\nif(!lua_checkstack(L,space))\r\nluaL_error(L,\"stack overflow (%s)\",mes);\r\n}\r\nstatic void luaL_checktype(lua_State*L,int narg,int t){\r\nif(lua_type(L,narg)!=t)\r\ntag_error(L,narg,t);\r\n}\r\nstatic void luaL_checkany(lua_State*L,int narg){\r\nif(lua_type(L,narg)==(-1))\r\nluaL_argerror(L,narg,\"value expected\");\r\n}\r\nstatic const char*luaL_checklstring(lua_State*L,int narg,size_t*len){\r\nconst char*s=lua_tolstring(L,narg,len);\r\nif(!s)tag_error(L,narg,4);\r\nreturn s;\r\n}\r\nstatic const char*luaL_optlstring(lua_State*L,int narg,\r\nconst char*def,size_t*len){\r\nif(lua_isnoneornil(L,narg)){\r\nif(len)\r\n*len=(def?strlen(def):0);\r\nreturn def;\r\n}\r\nelse return luaL_checklstring(L,narg,len);\r\n}\r\nstatic lua_Number luaL_checknumber(lua_State*L,int narg){\r\nlua_Number d=lua_tonumber(L,narg);\r\nif(d==0&&!lua_isnumber(L,narg))\r\ntag_error(L,narg,3);\r\nreturn d;\r\n}\r\nstatic lua_Integer luaL_checkinteger(lua_State*L,int narg){\r\nlua_Integer d=lua_tointeger(L,narg);\r\nif(d==0&&!lua_isnumber(L,narg))\r\ntag_error(L,narg,3);\r\nreturn d;\r\n}\r\nstatic lua_Integer luaL_optinteger(lua_State*L,int narg,\r\nlua_Integer def){\r\nreturn luaL_opt(L,luaL_checkinteger,narg,def);\r\n}\r\nstatic int luaL_getmetafield(lua_State*L,int obj,const char*event){\r\nif(!lua_getmetatable(L,obj))\r\nreturn 0;\r\nlua_pushstring(L,event);\r\nlua_rawget(L,-2);\r\nif(lua_isnil(L,-1)){\r\nlua_pop(L,2);\r\nreturn 0;\r\n}\r\nelse{\r\nlua_remove(L,-2);\r\nreturn 1;\r\n}\r\n}\r\nstatic void luaL_register(lua_State*L,const char*libname,\r\nconst luaL_Reg*l){\r\nluaI_openlib(L,libname,l,0);\r\n}\r\nstatic int libsize(const luaL_Reg*l){\r\nint size=0;\r\nfor(;l->name;l++)size++;\r\nreturn size;\r\n}\r\nstatic void luaI_openlib(lua_State*L,const char*libname,\r\nconst luaL_Reg*l,int nup){\r\nif(libname){\r\nint size=libsize(l);\r\nluaL_findtable(L,(-10000),\"_LOADED\",1);\r\nlua_getfield(L,-1,libname);\r\nif(!lua_istable(L,-1)){\r\nlua_pop(L,1);\r\nif(luaL_findtable(L,(-10002),libname,size)!=NULL)\r\nluaL_error(L,\"name conflict for module \"LUA_QL(\"%s\"),libname);\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,-3,libname);\r\n}\r\nlua_remove(L,-2);\r\nlua_insert(L,-(nup+1));\r\n}\r\nfor(;l->name;l++){\r\nint i;\r\nfor(i=0;i<nup;i++)\r\nlua_pushvalue(L,-nup);\r\nlua_pushcclosure(L,l->func,nup);\r\nlua_setfield(L,-(nup+2),l->name);\r\n}\r\nlua_pop(L,nup);\r\n}\r\nstatic const char*luaL_findtable(lua_State*L,int idx,\r\nconst char*fname,int szhint){\r\nconst char*e;\r\nlua_pushvalue(L,idx);\r\ndo{\r\ne=strchr(fname,'.');\r\nif(e==NULL)e=fname+strlen(fname);\r\nlua_pushlstring(L,fname,e-fname);\r\nlua_rawget(L,-2);\r\nif(lua_isnil(L,-1)){\r\nlua_pop(L,1);\r\nlua_createtable(L,0,(*e=='.'?1:szhint));\r\nlua_pushlstring(L,fname,e-fname);\r\nlua_pushvalue(L,-2);\r\nlua_settable(L,-4);\r\n}\r\nelse if(!lua_istable(L,-1)){\r\nlua_pop(L,2);\r\nreturn fname;\r\n}\r\nlua_remove(L,-2);\r\nfname=e+1;\r\n}while(*e=='.');\r\nreturn NULL;\r\n}\r\n#define bufflen(B)((B)->p-(B)->buffer)\r\n#define bufffree(B)((size_t)(BUFSIZ-bufflen(B)))\r\nstatic int emptybuffer(luaL_Buffer*B){\r\nsize_t l=bufflen(B);\r\nif(l==0)return 0;\r\nelse{\r\nlua_pushlstring(B->L,B->buffer,l);\r\nB->p=B->buffer;\r\nB->lvl++;\r\nreturn 1;\r\n}\r\n}\r\nstatic void adjuststack(luaL_Buffer*B){\r\nif(B->lvl>1){\r\nlua_State*L=B->L;\r\nint toget=1;\r\nsize_t toplen=lua_strlen(L,-1);\r\ndo{\r\nsize_t l=lua_strlen(L,-(toget+1));\r\nif(B->lvl-toget+1>=(20/2)||toplen>l){\r\ntoplen+=l;\r\ntoget++;\r\n}\r\nelse break;\r\n}while(toget<B->lvl);\r\nlua_concat(L,toget);\r\nB->lvl=B->lvl-toget+1;\r\n}\r\n}\r\nstatic char*luaL_prepbuffer(luaL_Buffer*B){\r\nif(emptybuffer(B))\r\nadjuststack(B);\r\nreturn B->buffer;\r\n}\r\nstatic void luaL_addlstring(luaL_Buffer*B,const char*s,size_t l){\r\nwhile(l--)\r\nluaL_addchar(B,*s++);\r\n}\r\nstatic void luaL_pushresult(luaL_Buffer*B){\r\nemptybuffer(B);\r\nlua_concat(B->L,B->lvl);\r\nB->lvl=1;\r\n}\r\nstatic void luaL_addvalue(luaL_Buffer*B){\r\nlua_State*L=B->L;\r\nsize_t vl;\r\nconst char*s=lua_tolstring(L,-1,&vl);\r\nif(vl<=bufffree(B)){\r\nmemcpy(B->p,s,vl);\r\nB->p+=vl;\r\nlua_pop(L,1);\r\n}\r\nelse{\r\nif(emptybuffer(B))\r\nlua_insert(L,-2);\r\nB->lvl++;\r\nadjuststack(B);\r\n}\r\n}\r\nstatic void luaL_buffinit(lua_State*L,luaL_Buffer*B){\r\nB->L=L;\r\nB->p=B->buffer;\r\nB->lvl=0;\r\n}\r\ntypedef struct LoadF{\r\nint extraline;\r\nFILE*f;\r\nchar buff[BUFSIZ];\r\n}LoadF;\r\nstatic const char*getF(lua_State*L,void*ud,size_t*size){\r\nLoadF*lf=(LoadF*)ud;\r\n(void)L;\r\nif(lf->extraline){\r\nlf->extraline=0;\r\n*size=1;\r\nreturn\"\\n\";\r\n}\r\nif(feof(lf->f))return NULL;\r\n*size=fread(lf->buff,1,sizeof(lf->buff),lf->f);\r\nreturn(*size>0)?lf->buff:NULL;\r\n}\r\nstatic int errfile(lua_State*L,const char*what,int fnameindex){\r\nconst char*serr=strerror(errno);\r\nconst char*filename=lua_tostring(L,fnameindex)+1;\r\nlua_pushfstring(L,\"cannot %s %s: %s\",what,filename,serr);\r\nlua_remove(L,fnameindex);\r\nreturn(5+1);\r\n}\r\nstatic int luaL_loadfile(lua_State*L,const char*filename){\r\nLoadF lf;\r\nint status,readstatus;\r\nint c;\r\nint fnameindex=lua_gettop(L)+1;\r\nlf.extraline=0;\r\nif(filename==NULL){\r\nlua_pushliteral(L,\"=stdin\");\r\nlf.f=stdin;\r\n}\r\nelse{\r\nlua_pushfstring(L,\"@%s\",filename);\r\nlf.f=fopen(filename,\"r\");\r\nif(lf.f==NULL)return errfile(L,\"open\",fnameindex);\r\n}\r\nc=getc(lf.f);\r\nif(c=='#'){\r\nlf.extraline=1;\r\nwhile((c=getc(lf.f))!=EOF&&c!='\\n');\r\nif(c=='\\n')c=getc(lf.f);\r\n}\r\nif(c==\"\\033Lua\"[0]&&filename){\r\nlf.f=freopen(filename,\"rb\",lf.f);\r\nif(lf.f==NULL)return errfile(L,\"reopen\",fnameindex);\r\nwhile((c=getc(lf.f))!=EOF&&c!=\"\\033Lua\"[0]);\r\nlf.extraline=0;\r\n}\r\nungetc(c,lf.f);\r\nstatus=lua_load(L,getF,&lf,lua_tostring(L,-1));\r\nreadstatus=ferror(lf.f);\r\nif(filename)fclose(lf.f);\r\nif(readstatus){\r\nlua_settop(L,fnameindex);\r\nreturn errfile(L,\"read\",fnameindex);\r\n}\r\nlua_remove(L,fnameindex);\r\nreturn status;\r\n}\r\ntypedef struct LoadS{\r\nconst char*s;\r\nsize_t size;\r\n}LoadS;\r\nstatic const char*getS(lua_State*L,void*ud,size_t*size){\r\nLoadS*ls=(LoadS*)ud;\r\n(void)L;\r\nif(ls->size==0)return NULL;\r\n*size=ls->size;\r\nls->size=0;\r\nreturn ls->s;\r\n}\r\nstatic int luaL_loadbuffer(lua_State*L,const char*buff,size_t size,\r\nconst char*name){\r\nLoadS ls;\r\nls.s=buff;\r\nls.size=size;\r\nreturn lua_load(L,getS,&ls,name);\r\n}\r\nstatic void*l_alloc(void*ud,void*ptr,size_t osize,size_t nsize){\r\n(void)ud;\r\n(void)osize;\r\nif(nsize==0){\r\nfree(ptr);\r\nreturn NULL;\r\n}\r\nelse\r\nreturn realloc(ptr,nsize);\r\n}\r\nstatic int panic(lua_State*L){\r\n(void)L;\r\nfprintf(stderr,\"PANIC: unprotected error in call to Lua API (%s)\\n\",\r\nlua_tostring(L,-1));\r\nreturn 0;\r\n}\r\nstatic lua_State*luaL_newstate(void){\r\nlua_State*L=lua_newstate(l_alloc,NULL);\r\nif(L)lua_atpanic(L,&panic);\r\nreturn L;\r\n}\r\nstatic int luaB_tonumber(lua_State*L){\r\nint base=luaL_optint(L,2,10);\r\nif(base==10){\r\nluaL_checkany(L,1);\r\nif(lua_isnumber(L,1)){\r\nlua_pushnumber(L,lua_tonumber(L,1));\r\nreturn 1;\r\n}\r\n}\r\nelse{\r\nconst char*s1=luaL_checkstring(L,1);\r\nchar*s2;\r\nunsigned long n;\r\nluaL_argcheck(L,2<=base&&base<=36,2,\"base out of range\");\r\nn=strtoul(s1,&s2,base);\r\nif(s1!=s2){\r\nwhile(isspace((unsigned char)(*s2)))s2++;\r\nif(*s2=='\\0'){\r\nlua_pushnumber(L,(lua_Number)n);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\nstatic int luaB_error(lua_State*L){\r\nint level=luaL_optint(L,2,1);\r\nlua_settop(L,1);\r\nif(lua_isstring(L,1)&&level>0){\r\nluaL_where(L,level);\r\nlua_pushvalue(L,1);\r\nlua_concat(L,2);\r\n}\r\nreturn lua_error(L);\r\n}\r\nstatic int luaB_setmetatable(lua_State*L){\r\nint t=lua_type(L,2);\r\nluaL_checktype(L,1,5);\r\nluaL_argcheck(L,t==0||t==5,2,\r\n\"nil or table expected\");\r\nif(luaL_getmetafield(L,1,\"__metatable\"))\r\nluaL_error(L,\"cannot change a protected metatable\");\r\nlua_settop(L,2);\r\nlua_setmetatable(L,1);\r\nreturn 1;\r\n}\r\nstatic void getfunc(lua_State*L,int opt){\r\nif(lua_isfunction(L,1))lua_pushvalue(L,1);\r\nelse{\r\nlua_Debug ar;\r\nint level=opt?luaL_optint(L,1,1):luaL_checkint(L,1);\r\nluaL_argcheck(L,level>=0,1,\"level must be non-negative\");\r\nif(lua_getstack(L,level,&ar)==0)\r\nluaL_argerror(L,1,\"invalid level\");\r\nlua_getinfo(L,\"f\",&ar);\r\nif(lua_isnil(L,-1))\r\nluaL_error(L,\"no function environment for tail call at level %d\",\r\nlevel);\r\n}\r\n}\r\nstatic int luaB_setfenv(lua_State*L){\r\nluaL_checktype(L,2,5);\r\ngetfunc(L,0);\r\nlua_pushvalue(L,2);\r\nif(lua_isnumber(L,1)&&lua_tonumber(L,1)==0){\r\nlua_pushthread(L);\r\nlua_insert(L,-2);\r\nlua_setfenv(L,-2);\r\nreturn 0;\r\n}\r\nelse if(lua_iscfunction(L,-2)||lua_setfenv(L,-2)==0)\r\nluaL_error(L,\r\nLUA_QL(\"setfenv\")\" cannot change environment of given object\");\r\nreturn 1;\r\n}\r\nstatic int luaB_rawget(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nluaL_checkany(L,2);\r\nlua_settop(L,2);\r\nlua_rawget(L,1);\r\nreturn 1;\r\n}\r\nstatic int luaB_type(lua_State*L){\r\nluaL_checkany(L,1);\r\nlua_pushstring(L,luaL_typename(L,1));\r\nreturn 1;\r\n}\r\nstatic int luaB_next(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_settop(L,2);\r\nif(lua_next(L,1))\r\nreturn 2;\r\nelse{\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\n}\r\nstatic int luaB_pairs(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\nlua_pushvalue(L,1);\r\nlua_pushnil(L);\r\nreturn 3;\r\n}\r\nstatic int ipairsaux(lua_State*L){\r\nint i=luaL_checkint(L,2);\r\nluaL_checktype(L,1,5);\r\ni++;\r\nlua_pushinteger(L,i);\r\nlua_rawgeti(L,1,i);\r\nreturn(lua_isnil(L,-1))?0:2;\r\n}\r\nstatic int luaB_ipairs(lua_State*L){\r\nluaL_checktype(L,1,5);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\nlua_pushvalue(L,1);\r\nlua_pushinteger(L,0);\r\nreturn 3;\r\n}\r\nstatic int load_aux(lua_State*L,int status){\r\nif(status==0)\r\nreturn 1;\r\nelse{\r\nlua_pushnil(L);\r\nlua_insert(L,-2);\r\nreturn 2;\r\n}\r\n}\r\nstatic int luaB_loadstring(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nconst char*chunkname=luaL_optstring(L,2,s);\r\nreturn load_aux(L,luaL_loadbuffer(L,s,l,chunkname));\r\n}\r\nstatic int luaB_loadfile(lua_State*L){\r\nconst char*fname=luaL_optstring(L,1,NULL);\r\nreturn load_aux(L,luaL_loadfile(L,fname));\r\n}\r\nstatic int luaB_assert(lua_State*L){\r\nluaL_checkany(L,1);\r\nif(!lua_toboolean(L,1))\r\nreturn luaL_error(L,\"%s\",luaL_optstring(L,2,\"assertion failed!\"));\r\nreturn lua_gettop(L);\r\n}\r\nstatic int luaB_unpack(lua_State*L){\r\nint i,e,n;\r\nluaL_checktype(L,1,5);\r\ni=luaL_optint(L,2,1);\r\ne=luaL_opt(L,luaL_checkint,3,luaL_getn(L,1));\r\nif(i>e)return 0;\r\nn=e-i+1;\r\nif(n<=0||!lua_checkstack(L,n))\r\nreturn luaL_error(L,\"too many results to unpack\");\r\nlua_rawgeti(L,1,i);\r\nwhile(i++<e)\r\nlua_rawgeti(L,1,i);\r\nreturn n;\r\n}\r\nstatic int luaB_pcall(lua_State*L){\r\nint status;\r\nluaL_checkany(L,1);\r\nstatus=lua_pcall(L,lua_gettop(L)-1,(-1),0);\r\nlua_pushboolean(L,(status==0));\r\nlua_insert(L,1);\r\nreturn lua_gettop(L);\r\n}\r\nstatic int luaB_newproxy(lua_State*L){\r\nlua_settop(L,1);\r\nlua_newuserdata(L,0);\r\nif(lua_toboolean(L,1)==0)\r\nreturn 1;\r\nelse if(lua_isboolean(L,1)){\r\nlua_newtable(L);\r\nlua_pushvalue(L,-1);\r\nlua_pushboolean(L,1);\r\nlua_rawset(L,lua_upvalueindex(1));\r\n}\r\nelse{\r\nint validproxy=0;\r\nif(lua_getmetatable(L,1)){\r\nlua_rawget(L,lua_upvalueindex(1));\r\nvalidproxy=lua_toboolean(L,-1);\r\nlua_pop(L,1);\r\n}\r\nluaL_argcheck(L,validproxy,1,\"boolean or proxy expected\");\r\nlua_getmetatable(L,1);\r\n}\r\nlua_setmetatable(L,2);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg base_funcs[]={\r\n{\"assert\",luaB_assert},\r\n{\"error\",luaB_error},\r\n{\"loadfile\",luaB_loadfile},\r\n{\"loadstring\",luaB_loadstring},\r\n{\"next\",luaB_next},\r\n{\"pcall\",luaB_pcall},\r\n{\"rawget\",luaB_rawget},\r\n{\"setfenv\",luaB_setfenv},\r\n{\"setmetatable\",luaB_setmetatable},\r\n{\"tonumber\",luaB_tonumber},\r\n{\"type\",luaB_type},\r\n{\"unpack\",luaB_unpack},\r\n{NULL,NULL}\r\n};\r\nstatic void auxopen(lua_State*L,const char*name,\r\nlua_CFunction f,lua_CFunction u){\r\nlua_pushcfunction(L,u);\r\nlua_pushcclosure(L,f,1);\r\nlua_setfield(L,-2,name);\r\n}\r\nstatic void base_open(lua_State*L){\r\nlua_pushvalue(L,(-10002));\r\nlua_setglobal(L,\"_G\");\r\nluaL_register(L,\"_G\",base_funcs);\r\nlua_pushliteral(L,\"Lua 5.1\");\r\nlua_setglobal(L,\"_VERSION\");\r\nauxopen(L,\"ipairs\",luaB_ipairs,ipairsaux);\r\nauxopen(L,\"pairs\",luaB_pairs,luaB_next);\r\nlua_createtable(L,0,1);\r\nlua_pushvalue(L,-1);\r\nlua_setmetatable(L,-2);\r\nlua_pushliteral(L,\"kv\");\r\nlua_setfield(L,-2,\"__mode\");\r\nlua_pushcclosure(L,luaB_newproxy,1);\r\nlua_setglobal(L,\"newproxy\");\r\n}\r\nstatic int luaopen_base(lua_State*L){\r\nbase_open(L);\r\nreturn 1;\r\n}\r\n#define aux_getn(L,n)(luaL_checktype(L,n,5),luaL_getn(L,n))\r\nstatic int tinsert(lua_State*L){\r\nint e=aux_getn(L,1)+1;\r\nint pos;\r\nswitch(lua_gettop(L)){\r\ncase 2:{\r\npos=e;\r\nbreak;\r\n}\r\ncase 3:{\r\nint i;\r\npos=luaL_checkint(L,2);\r\nif(pos>e)e=pos;\r\nfor(i=e;i>pos;i--){\r\nlua_rawgeti(L,1,i-1);\r\nlua_rawseti(L,1,i);\r\n}\r\nbreak;\r\n}\r\ndefault:{\r\nreturn luaL_error(L,\"wrong number of arguments to \"LUA_QL(\"insert\"));\r\n}\r\n}\r\nluaL_setn(L,1,e);\r\nlua_rawseti(L,1,pos);\r\nreturn 0;\r\n}\r\nstatic int tremove(lua_State*L){\r\nint e=aux_getn(L,1);\r\nint pos=luaL_optint(L,2,e);\r\nif(!(1<=pos&&pos<=e))\r\nreturn 0;\r\nluaL_setn(L,1,e-1);\r\nlua_rawgeti(L,1,pos);\r\nfor(;pos<e;pos++){\r\nlua_rawgeti(L,1,pos+1);\r\nlua_rawseti(L,1,pos);\r\n}\r\nlua_pushnil(L);\r\nlua_rawseti(L,1,e);\r\nreturn 1;\r\n}\r\nstatic void addfield(lua_State*L,luaL_Buffer*b,int i){\r\nlua_rawgeti(L,1,i);\r\nif(!lua_isstring(L,-1))\r\nluaL_error(L,\"invalid value (%s) at index %d in table for \"\r\nLUA_QL(\"concat\"),luaL_typename(L,-1),i);\r\nluaL_addvalue(b);\r\n}\r\nstatic int tconcat(lua_State*L){\r\nluaL_Buffer b;\r\nsize_t lsep;\r\nint i,last;\r\nconst char*sep=luaL_optlstring(L,2,\"\",&lsep);\r\nluaL_checktype(L,1,5);\r\ni=luaL_optint(L,3,1);\r\nlast=luaL_opt(L,luaL_checkint,4,luaL_getn(L,1));\r\nluaL_buffinit(L,&b);\r\nfor(;i<last;i++){\r\naddfield(L,&b,i);\r\nluaL_addlstring(&b,sep,lsep);\r\n}\r\nif(i==last)\r\naddfield(L,&b,i);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic void set2(lua_State*L,int i,int j){\r\nlua_rawseti(L,1,i);\r\nlua_rawseti(L,1,j);\r\n}\r\nstatic int sort_comp(lua_State*L,int a,int b){\r\nif(!lua_isnil(L,2)){\r\nint res;\r\nlua_pushvalue(L,2);\r\nlua_pushvalue(L,a-1);\r\nlua_pushvalue(L,b-2);\r\nlua_call(L,2,1);\r\nres=lua_toboolean(L,-1);\r\nlua_pop(L,1);\r\nreturn res;\r\n}\r\nelse\r\nreturn lua_lessthan(L,a,b);\r\n}\r\nstatic void auxsort(lua_State*L,int l,int u){\r\nwhile(l<u){\r\nint i,j;\r\nlua_rawgeti(L,1,l);\r\nlua_rawgeti(L,1,u);\r\nif(sort_comp(L,-1,-2))\r\nset2(L,l,u);\r\nelse\r\nlua_pop(L,2);\r\nif(u-l==1)break;\r\ni=(l+u)/2;\r\nlua_rawgeti(L,1,i);\r\nlua_rawgeti(L,1,l);\r\nif(sort_comp(L,-2,-1))\r\nset2(L,i,l);\r\nelse{\r\nlua_pop(L,1);\r\nlua_rawgeti(L,1,u);\r\nif(sort_comp(L,-1,-2))\r\nset2(L,i,u);\r\nelse\r\nlua_pop(L,2);\r\n}\r\nif(u-l==2)break;\r\nlua_rawgeti(L,1,i);\r\nlua_pushvalue(L,-1);\r\nlua_rawgeti(L,1,u-1);\r\nset2(L,i,u-1);\r\ni=l;j=u-1;\r\nfor(;;){\r\nwhile(lua_rawgeti(L,1,++i),sort_comp(L,-1,-2)){\r\nif(i>u)luaL_error(L,\"invalid order function for sorting\");\r\nlua_pop(L,1);\r\n}\r\nwhile(lua_rawgeti(L,1,--j),sort_comp(L,-3,-1)){\r\nif(j<l)luaL_error(L,\"invalid order function for sorting\");\r\nlua_pop(L,1);\r\n}\r\nif(j<i){\r\nlua_pop(L,3);\r\nbreak;\r\n}\r\nset2(L,i,j);\r\n}\r\nlua_rawgeti(L,1,u-1);\r\nlua_rawgeti(L,1,i);\r\nset2(L,u-1,i);\r\nif(i-l<u-i){\r\nj=l;i=i-1;l=i+2;\r\n}\r\nelse{\r\nj=i+1;i=u;u=j-2;\r\n}\r\nauxsort(L,j,i);\r\n}\r\n}\r\nstatic int sort(lua_State*L){\r\nint n=aux_getn(L,1);\r\nluaL_checkstack(L,40,\"\");\r\nif(!lua_isnoneornil(L,2))\r\nluaL_checktype(L,2,6);\r\nlua_settop(L,2);\r\nauxsort(L,1,n);\r\nreturn 0;\r\n}\r\nstatic const luaL_Reg tab_funcs[]={\r\n{\"concat\",tconcat},\r\n{\"insert\",tinsert},\r\n{\"remove\",tremove},\r\n{\"sort\",sort},\r\n{NULL,NULL}\r\n};\r\nstatic int luaopen_table(lua_State*L){\r\nluaL_register(L,\"table\",tab_funcs);\r\nreturn 1;\r\n}\r\nstatic const char*const fnames[]={\"input\",\"output\"};\r\nstatic int pushresult(lua_State*L,int i,const char*filename){\r\nint en=errno;\r\nif(i){\r\nlua_pushboolean(L,1);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nif(filename)\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(en));\r\nelse\r\nlua_pushfstring(L,\"%s\",strerror(en));\r\nlua_pushinteger(L,en);\r\nreturn 3;\r\n}\r\n}\r\nstatic void fileerror(lua_State*L,int arg,const char*filename){\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(errno));\r\nluaL_argerror(L,arg,lua_tostring(L,-1));\r\n}\r\n#define tofilep(L)((FILE**)luaL_checkudata(L,1,\"FILE*\"))\r\nstatic int io_type(lua_State*L){\r\nvoid*ud;\r\nluaL_checkany(L,1);\r\nud=lua_touserdata(L,1);\r\nlua_getfield(L,(-10000),\"FILE*\");\r\nif(ud==NULL||!lua_getmetatable(L,1)||!lua_rawequal(L,-2,-1))\r\nlua_pushnil(L);\r\nelse if(*((FILE**)ud)==NULL)\r\nlua_pushliteral(L,\"closed file\");\r\nelse\r\nlua_pushliteral(L,\"file\");\r\nreturn 1;\r\n}\r\nstatic FILE*tofile(lua_State*L){\r\nFILE**f=tofilep(L);\r\nif(*f==NULL)\r\nluaL_error(L,\"attempt to use a closed file\");\r\nreturn*f;\r\n}\r\nstatic FILE**newfile(lua_State*L){\r\nFILE**pf=(FILE**)lua_newuserdata(L,sizeof(FILE*));\r\n*pf=NULL;\r\nluaL_getmetatable(L,\"FILE*\");\r\nlua_setmetatable(L,-2);\r\nreturn pf;\r\n}\r\nstatic int io_noclose(lua_State*L){\r\nlua_pushnil(L);\r\nlua_pushliteral(L,\"cannot close standard file\");\r\nreturn 2;\r\n}\r\nstatic int io_pclose(lua_State*L){\r\nFILE**p=tofilep(L);\r\nint ok=lua_pclose(L,*p);\r\n*p=NULL;\r\nreturn pushresult(L,ok,NULL);\r\n}\r\nstatic int io_fclose(lua_State*L){\r\nFILE**p=tofilep(L);\r\nint ok=(fclose(*p)==0);\r\n*p=NULL;\r\nreturn pushresult(L,ok,NULL);\r\n}\r\nstatic int aux_close(lua_State*L){\r\nlua_getfenv(L,1);\r\nlua_getfield(L,-1,\"__close\");\r\nreturn(lua_tocfunction(L,-1))(L);\r\n}\r\nstatic int io_close(lua_State*L){\r\nif(lua_isnone(L,1))\r\nlua_rawgeti(L,(-10001),2);\r\ntofile(L);\r\nreturn aux_close(L);\r\n}\r\nstatic int io_gc(lua_State*L){\r\nFILE*f=*tofilep(L);\r\nif(f!=NULL)\r\naux_close(L);\r\nreturn 0;\r\n}\r\nstatic int io_open(lua_State*L){\r\nconst char*filename=luaL_checkstring(L,1);\r\nconst char*mode=luaL_optstring(L,2,\"r\");\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,mode);\r\nreturn(*pf==NULL)?pushresult(L,0,filename):1;\r\n}\r\nstatic FILE*getiofile(lua_State*L,int findex){\r\nFILE*f;\r\nlua_rawgeti(L,(-10001),findex);\r\nf=*(FILE**)lua_touserdata(L,-1);\r\nif(f==NULL)\r\nluaL_error(L,\"standard %s file is closed\",fnames[findex-1]);\r\nreturn f;\r\n}\r\nstatic int g_iofile(lua_State*L,int f,const char*mode){\r\nif(!lua_isnoneornil(L,1)){\r\nconst char*filename=lua_tostring(L,1);\r\nif(filename){\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,mode);\r\nif(*pf==NULL)\r\nfileerror(L,1,filename);\r\n}\r\nelse{\r\ntofile(L);\r\nlua_pushvalue(L,1);\r\n}\r\nlua_rawseti(L,(-10001),f);\r\n}\r\nlua_rawgeti(L,(-10001),f);\r\nreturn 1;\r\n}\r\nstatic int io_input(lua_State*L){\r\nreturn g_iofile(L,1,\"r\");\r\n}\r\nstatic int io_output(lua_State*L){\r\nreturn g_iofile(L,2,\"w\");\r\n}\r\nstatic int io_readline(lua_State*L);\r\nstatic void aux_lines(lua_State*L,int idx,int toclose){\r\nlua_pushvalue(L,idx);\r\nlua_pushboolean(L,toclose);\r\nlua_pushcclosure(L,io_readline,2);\r\n}\r\nstatic int f_lines(lua_State*L){\r\ntofile(L);\r\naux_lines(L,1,0);\r\nreturn 1;\r\n}\r\nstatic int io_lines(lua_State*L){\r\nif(lua_isnoneornil(L,1)){\r\nlua_rawgeti(L,(-10001),1);\r\nreturn f_lines(L);\r\n}\r\nelse{\r\nconst char*filename=luaL_checkstring(L,1);\r\nFILE**pf=newfile(L);\r\n*pf=fopen(filename,\"r\");\r\nif(*pf==NULL)\r\nfileerror(L,1,filename);\r\naux_lines(L,lua_gettop(L),1);\r\nreturn 1;\r\n}\r\n}\r\nstatic int read_number(lua_State*L,FILE*f){\r\nlua_Number d;\r\nif(fscanf(f,\"%lf\",&d)==1){\r\nlua_pushnumber(L,d);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nreturn 0;\r\n}\r\n}\r\nstatic int test_eof(lua_State*L,FILE*f){\r\nint c=getc(f);\r\nungetc(c,f);\r\nlua_pushlstring(L,NULL,0);\r\nreturn(c!=EOF);\r\n}\r\nstatic int read_line(lua_State*L,FILE*f){\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nfor(;;){\r\nsize_t l;\r\nchar*p=luaL_prepbuffer(&b);\r\nif(fgets(p,BUFSIZ,f)==NULL){\r\nluaL_pushresult(&b);\r\nreturn(lua_objlen(L,-1)>0);\r\n}\r\nl=strlen(p);\r\nif(l==0||p[l-1]!='\\n')\r\nluaL_addsize(&b,l);\r\nelse{\r\nluaL_addsize(&b,l-1);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\n}\r\n}\r\nstatic int read_chars(lua_State*L,FILE*f,size_t n){\r\nsize_t rlen;\r\nsize_t nr;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nrlen=BUFSIZ;\r\ndo{\r\nchar*p=luaL_prepbuffer(&b);\r\nif(rlen>n)rlen=n;\r\nnr=fread(p,sizeof(char),rlen,f);\r\nluaL_addsize(&b,nr);\r\nn-=nr;\r\n}while(n>0&&nr==rlen);\r\nluaL_pushresult(&b);\r\nreturn(n==0||lua_objlen(L,-1)>0);\r\n}\r\nstatic int g_read(lua_State*L,FILE*f,int first){\r\nint nargs=lua_gettop(L)-1;\r\nint success;\r\nint n;\r\nclearerr(f);\r\nif(nargs==0){\r\nsuccess=read_line(L,f);\r\nn=first+1;\r\n}\r\nelse{\r\nluaL_checkstack(L,nargs+20,\"too many arguments\");\r\nsuccess=1;\r\nfor(n=first;nargs--&&success;n++){\r\nif(lua_type(L,n)==3){\r\nsize_t l=(size_t)lua_tointeger(L,n);\r\nsuccess=(l==0)?test_eof(L,f):read_chars(L,f,l);\r\n}\r\nelse{\r\nconst char*p=lua_tostring(L,n);\r\nluaL_argcheck(L,p&&p[0]=='*',n,\"invalid option\");\r\nswitch(p[1]){\r\ncase'n':\r\nsuccess=read_number(L,f);\r\nbreak;\r\ncase'l':\r\nsuccess=read_line(L,f);\r\nbreak;\r\ncase'a':\r\nread_chars(L,f,~((size_t)0));\r\nsuccess=1;\r\nbreak;\r\ndefault:\r\nreturn luaL_argerror(L,n,\"invalid format\");\r\n}\r\n}\r\n}\r\n}\r\nif(ferror(f))\r\nreturn pushresult(L,0,NULL);\r\nif(!success){\r\nlua_pop(L,1);\r\nlua_pushnil(L);\r\n}\r\nreturn n-first;\r\n}\r\nstatic int io_read(lua_State*L){\r\nreturn g_read(L,getiofile(L,1),1);\r\n}\r\nstatic int f_read(lua_State*L){\r\nreturn g_read(L,tofile(L),2);\r\n}\r\nstatic int io_readline(lua_State*L){\r\nFILE*f=*(FILE**)lua_touserdata(L,lua_upvalueindex(1));\r\nint sucess;\r\nif(f==NULL)\r\nluaL_error(L,\"file is already closed\");\r\nsucess=read_line(L,f);\r\nif(ferror(f))\r\nreturn luaL_error(L,\"%s\",strerror(errno));\r\nif(sucess)return 1;\r\nelse{\r\nif(lua_toboolean(L,lua_upvalueindex(2))){\r\nlua_settop(L,0);\r\nlua_pushvalue(L,lua_upvalueindex(1));\r\naux_close(L);\r\n}\r\nreturn 0;\r\n}\r\n}\r\nstatic int g_write(lua_State*L,FILE*f,int arg){\r\nint nargs=lua_gettop(L)-1;\r\nint status=1;\r\nfor(;nargs--;arg++){\r\nif(lua_type(L,arg)==3){\r\nstatus=status&&\r\nfprintf(f,\"%.14g\",lua_tonumber(L,arg))>0;\r\n}\r\nelse{\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nstatus=status&&(fwrite(s,sizeof(char),l,f)==l);\r\n}\r\n}\r\nreturn pushresult(L,status,NULL);\r\n}\r\nstatic int io_write(lua_State*L){\r\nreturn g_write(L,getiofile(L,2),1);\r\n}\r\nstatic int f_write(lua_State*L){\r\nreturn g_write(L,tofile(L),2);\r\n}\r\nstatic int io_flush(lua_State*L){\r\nreturn pushresult(L,fflush(getiofile(L,2))==0,NULL);\r\n}\r\nstatic int f_flush(lua_State*L){\r\nreturn pushresult(L,fflush(tofile(L))==0,NULL);\r\n}\r\nstatic const luaL_Reg iolib[]={\r\n{\"close\",io_close},\r\n{\"flush\",io_flush},\r\n{\"input\",io_input},\r\n{\"lines\",io_lines},\r\n{\"open\",io_open},\r\n{\"output\",io_output},\r\n{\"read\",io_read},\r\n{\"type\",io_type},\r\n{\"write\",io_write},\r\n{NULL,NULL}\r\n};\r\nstatic const luaL_Reg flib[]={\r\n{\"close\",io_close},\r\n{\"flush\",f_flush},\r\n{\"lines\",f_lines},\r\n{\"read\",f_read},\r\n{\"write\",f_write},\r\n{\"__gc\",io_gc},\r\n{NULL,NULL}\r\n};\r\nstatic void createmeta(lua_State*L){\r\nluaL_newmetatable(L,\"FILE*\");\r\nlua_pushvalue(L,-1);\r\nlua_setfield(L,-2,\"__index\");\r\nluaL_register(L,NULL,flib);\r\n}\r\nstatic void createstdfile(lua_State*L,FILE*f,int k,const char*fname){\r\n*newfile(L)=f;\r\nif(k>0){\r\nlua_pushvalue(L,-1);\r\nlua_rawseti(L,(-10001),k);\r\n}\r\nlua_pushvalue(L,-2);\r\nlua_setfenv(L,-2);\r\nlua_setfield(L,-3,fname);\r\n}\r\nstatic void newfenv(lua_State*L,lua_CFunction cls){\r\nlua_createtable(L,0,1);\r\nlua_pushcfunction(L,cls);\r\nlua_setfield(L,-2,\"__close\");\r\n}\r\nstatic int luaopen_io(lua_State*L){\r\ncreatemeta(L);\r\nnewfenv(L,io_fclose);\r\nlua_replace(L,(-10001));\r\nluaL_register(L,\"io\",iolib);\r\nnewfenv(L,io_noclose);\r\ncreatestdfile(L,stdin,1,\"stdin\");\r\ncreatestdfile(L,stdout,2,\"stdout\");\r\ncreatestdfile(L,stderr,0,\"stderr\");\r\nlua_pop(L,1);\r\nlua_getfield(L,-1,\"popen\");\r\nnewfenv(L,io_pclose);\r\nlua_setfenv(L,-2);\r\nlua_pop(L,1);\r\nreturn 1;\r\n}\r\nstatic int os_pushresult(lua_State*L,int i,const char*filename){\r\nint en=errno;\r\nif(i){\r\nlua_pushboolean(L,1);\r\nreturn 1;\r\n}\r\nelse{\r\nlua_pushnil(L);\r\nlua_pushfstring(L,\"%s: %s\",filename,strerror(en));\r\nlua_pushinteger(L,en);\r\nreturn 3;\r\n}\r\n}\r\nstatic int os_remove(lua_State*L){\r\nconst char*filename=luaL_checkstring(L,1);\r\nreturn os_pushresult(L,remove(filename)==0,filename);\r\n}\r\nstatic int os_exit(lua_State*L){\r\nexit(luaL_optint(L,1,EXIT_SUCCESS));\r\n}\r\nstatic const luaL_Reg syslib[]={\r\n{\"exit\",os_exit},\r\n{\"remove\",os_remove},\r\n{NULL,NULL}\r\n};\r\nstatic int luaopen_os(lua_State*L){\r\nluaL_register(L,\"os\",syslib);\r\nreturn 1;\r\n}\r\n#define uchar(c)((unsigned char)(c))\r\nstatic ptrdiff_t posrelat(ptrdiff_t pos,size_t len){\r\nif(pos<0)pos+=(ptrdiff_t)len+1;\r\nreturn(pos>=0)?pos:0;\r\n}\r\nstatic int str_sub(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nptrdiff_t start=posrelat(luaL_checkinteger(L,2),l);\r\nptrdiff_t end=posrelat(luaL_optinteger(L,3,-1),l);\r\nif(start<1)start=1;\r\nif(end>(ptrdiff_t)l)end=(ptrdiff_t)l;\r\nif(start<=end)\r\nlua_pushlstring(L,s+start-1,end-start+1);\r\nelse lua_pushliteral(L,\"\");\r\nreturn 1;\r\n}\r\nstatic int str_lower(lua_State*L){\r\nsize_t l;\r\nsize_t i;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nluaL_buffinit(L,&b);\r\nfor(i=0;i<l;i++)\r\nluaL_addchar(&b,tolower(uchar(s[i])));\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_upper(lua_State*L){\r\nsize_t l;\r\nsize_t i;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nluaL_buffinit(L,&b);\r\nfor(i=0;i<l;i++)\r\nluaL_addchar(&b,toupper(uchar(s[i])));\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_rep(lua_State*L){\r\nsize_t l;\r\nluaL_Buffer b;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nint n=luaL_checkint(L,2);\r\nluaL_buffinit(L,&b);\r\nwhile(n-->0)\r\nluaL_addlstring(&b,s,l);\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic int str_byte(lua_State*L){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,1,&l);\r\nptrdiff_t posi=posrelat(luaL_optinteger(L,2,1),l);\r\nptrdiff_t pose=posrelat(luaL_optinteger(L,3,posi),l);\r\nint n,i;\r\nif(posi<=0)posi=1;\r\nif((size_t)pose>l)pose=l;\r\nif(posi>pose)return 0;\r\nn=(int)(pose-posi+1);\r\nif(posi+n<=pose)\r\nluaL_error(L,\"string slice too long\");\r\nluaL_checkstack(L,n,\"string slice too long\");\r\nfor(i=0;i<n;i++)\r\nlua_pushinteger(L,uchar(s[posi+i-1]));\r\nreturn n;\r\n}\r\nstatic int str_char(lua_State*L){\r\nint n=lua_gettop(L);\r\nint i;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nfor(i=1;i<=n;i++){\r\nint c=luaL_checkint(L,i);\r\nluaL_argcheck(L,uchar(c)==c,i,\"invalid value\");\r\nluaL_addchar(&b,uchar(c));\r\n}\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\ntypedef struct MatchState{\r\nconst char*src_init;\r\nconst char*src_end;\r\nlua_State*L;\r\nint level;\r\nstruct{\r\nconst char*init;\r\nptrdiff_t len;\r\n}capture[32];\r\n}MatchState;\r\nstatic int check_capture(MatchState*ms,int l){\r\nl-='1';\r\nif(l<0||l>=ms->level||ms->capture[l].len==(-1))\r\nreturn luaL_error(ms->L,\"invalid capture index\");\r\nreturn l;\r\n}\r\nstatic int capture_to_close(MatchState*ms){\r\nint level=ms->level;\r\nfor(level--;level>=0;level--)\r\nif(ms->capture[level].len==(-1))return level;\r\nreturn luaL_error(ms->L,\"invalid pattern capture\");\r\n}\r\nstatic const char*classend(MatchState*ms,const char*p){\r\nswitch(*p++){\r\ncase'%':{\r\nif(*p=='\\0')\r\nluaL_error(ms->L,\"malformed pattern (ends with \"LUA_QL(\"%%\")\")\");\r\nreturn p+1;\r\n}\r\ncase'[':{\r\nif(*p=='^')p++;\r\ndo{\r\nif(*p=='\\0')\r\nluaL_error(ms->L,\"malformed pattern (missing \"LUA_QL(\"]\")\")\");\r\nif(*(p++)=='%'&&*p!='\\0')\r\np++;\r\n}while(*p!=']');\r\nreturn p+1;\r\n}\r\ndefault:{\r\nreturn p;\r\n}\r\n}\r\n}\r\nstatic int match_class(int c,int cl){\r\nint res;\r\nswitch(tolower(cl)){\r\ncase'a':res=isalpha(c);break;\r\ncase'c':res=iscntrl(c);break;\r\ncase'd':res=isdigit(c);break;\r\ncase'l':res=islower(c);break;\r\ncase'p':res=ispunct(c);break;\r\ncase's':res=isspace(c);break;\r\ncase'u':res=isupper(c);break;\r\ncase'w':res=isalnum(c);break;\r\ncase'x':res=isxdigit(c);break;\r\ncase'z':res=(c==0);break;\r\ndefault:return(cl==c);\r\n}\r\nreturn(islower(cl)?res:!res);\r\n}\r\nstatic int matchbracketclass(int c,const char*p,const char*ec){\r\nint sig=1;\r\nif(*(p+1)=='^'){\r\nsig=0;\r\np++;\r\n}\r\nwhile(++p<ec){\r\nif(*p=='%'){\r\np++;\r\nif(match_class(c,uchar(*p)))\r\nreturn sig;\r\n}\r\nelse if((*(p+1)=='-')&&(p+2<ec)){\r\np+=2;\r\nif(uchar(*(p-2))<=c&&c<=uchar(*p))\r\nreturn sig;\r\n}\r\nelse if(uchar(*p)==c)return sig;\r\n}\r\nreturn!sig;\r\n}\r\nstatic int singlematch(int c,const char*p,const char*ep){\r\nswitch(*p){\r\ncase'.':return 1;\r\ncase'%':return match_class(c,uchar(*(p+1)));\r\ncase'[':return matchbracketclass(c,p,ep-1);\r\ndefault:return(uchar(*p)==c);\r\n}\r\n}\r\nstatic const char*match(MatchState*ms,const char*s,const char*p);\r\nstatic const char*matchbalance(MatchState*ms,const char*s,\r\nconst char*p){\r\nif(*p==0||*(p+1)==0)\r\nluaL_error(ms->L,\"unbalanced pattern\");\r\nif(*s!=*p)return NULL;\r\nelse{\r\nint b=*p;\r\nint e=*(p+1);\r\nint cont=1;\r\nwhile(++s<ms->src_end){\r\nif(*s==e){\r\nif(--cont==0)return s+1;\r\n}\r\nelse if(*s==b)cont++;\r\n}\r\n}\r\nreturn NULL;\r\n}\r\nstatic const char*max_expand(MatchState*ms,const char*s,\r\nconst char*p,const char*ep){\r\nptrdiff_t i=0;\r\nwhile((s+i)<ms->src_end&&singlematch(uchar(*(s+i)),p,ep))\r\ni++;\r\nwhile(i>=0){\r\nconst char*res=match(ms,(s+i),ep+1);\r\nif(res)return res;\r\ni--;\r\n}\r\nreturn NULL;\r\n}\r\nstatic const char*min_expand(MatchState*ms,const char*s,\r\nconst char*p,const char*ep){\r\nfor(;;){\r\nconst char*res=match(ms,s,ep+1);\r\nif(res!=NULL)\r\nreturn res;\r\nelse if(s<ms->src_end&&singlematch(uchar(*s),p,ep))\r\ns++;\r\nelse return NULL;\r\n}\r\n}\r\nstatic const char*start_capture(MatchState*ms,const char*s,\r\nconst char*p,int what){\r\nconst char*res;\r\nint level=ms->level;\r\nif(level>=32)luaL_error(ms->L,\"too many captures\");\r\nms->capture[level].init=s;\r\nms->capture[level].len=what;\r\nms->level=level+1;\r\nif((res=match(ms,s,p))==NULL)\r\nms->level--;\r\nreturn res;\r\n}\r\nstatic const char*end_capture(MatchState*ms,const char*s,\r\nconst char*p){\r\nint l=capture_to_close(ms);\r\nconst char*res;\r\nms->capture[l].len=s-ms->capture[l].init;\r\nif((res=match(ms,s,p))==NULL)\r\nms->capture[l].len=(-1);\r\nreturn res;\r\n}\r\nstatic const char*match_capture(MatchState*ms,const char*s,int l){\r\nsize_t len;\r\nl=check_capture(ms,l);\r\nlen=ms->capture[l].len;\r\nif((size_t)(ms->src_end-s)>=len&&\r\nmemcmp(ms->capture[l].init,s,len)==0)\r\nreturn s+len;\r\nelse return NULL;\r\n}\r\nstatic const char*match(MatchState*ms,const char*s,const char*p){\r\ninit:\r\nswitch(*p){\r\ncase'(':{\r\nif(*(p+1)==')')\r\nreturn start_capture(ms,s,p+2,(-2));\r\nelse\r\nreturn start_capture(ms,s,p+1,(-1));\r\n}\r\ncase')':{\r\nreturn end_capture(ms,s,p+1);\r\n}\r\ncase'%':{\r\nswitch(*(p+1)){\r\ncase'b':{\r\ns=matchbalance(ms,s,p+2);\r\nif(s==NULL)return NULL;\r\np+=4;goto init;\r\n}\r\ncase'f':{\r\nconst char*ep;char previous;\r\np+=2;\r\nif(*p!='[')\r\nluaL_error(ms->L,\"missing \"LUA_QL(\"[\")\" after \"\r\nLUA_QL(\"%%f\")\" in pattern\");\r\nep=classend(ms,p);\r\nprevious=(s==ms->src_init)?'\\0':*(s-1);\r\nif(matchbracketclass(uchar(previous),p,ep-1)||\r\n!matchbracketclass(uchar(*s),p,ep-1))return NULL;\r\np=ep;goto init;\r\n}\r\ndefault:{\r\nif(isdigit(uchar(*(p+1)))){\r\ns=match_capture(ms,s,uchar(*(p+1)));\r\nif(s==NULL)return NULL;\r\np+=2;goto init;\r\n}\r\ngoto dflt;\r\n}\r\n}\r\n}\r\ncase'\\0':{\r\nreturn s;\r\n}\r\ncase'$':{\r\nif(*(p+1)=='\\0')\r\nreturn(s==ms->src_end)?s:NULL;\r\nelse goto dflt;\r\n}\r\ndefault:dflt:{\r\nconst char*ep=classend(ms,p);\r\nint m=s<ms->src_end&&singlematch(uchar(*s),p,ep);\r\nswitch(*ep){\r\ncase'?':{\r\nconst char*res;\r\nif(m&&((res=match(ms,s+1,ep+1))!=NULL))\r\nreturn res;\r\np=ep+1;goto init;\r\n}\r\ncase'*':{\r\nreturn max_expand(ms,s,p,ep);\r\n}\r\ncase'+':{\r\nreturn(m?max_expand(ms,s+1,p,ep):NULL);\r\n}\r\ncase'-':{\r\nreturn min_expand(ms,s,p,ep);\r\n}\r\ndefault:{\r\nif(!m)return NULL;\r\ns++;p=ep;goto init;\r\n}\r\n}\r\n}\r\n}\r\n}\r\nstatic const char*lmemfind(const char*s1,size_t l1,\r\nconst char*s2,size_t l2){\r\nif(l2==0)return s1;\r\nelse if(l2>l1)return NULL;\r\nelse{\r\nconst char*init;\r\nl2--;\r\nl1=l1-l2;\r\nwhile(l1>0&&(init=(const char*)memchr(s1,*s2,l1))!=NULL){\r\ninit++;\r\nif(memcmp(init,s2+1,l2)==0)\r\nreturn init-1;\r\nelse{\r\nl1-=init-s1;\r\ns1=init;\r\n}\r\n}\r\nreturn NULL;\r\n}\r\n}\r\nstatic void push_onecapture(MatchState*ms,int i,const char*s,\r\nconst char*e){\r\nif(i>=ms->level){\r\nif(i==0)\r\nlua_pushlstring(ms->L,s,e-s);\r\nelse\r\nluaL_error(ms->L,\"invalid capture index\");\r\n}\r\nelse{\r\nptrdiff_t l=ms->capture[i].len;\r\nif(l==(-1))luaL_error(ms->L,\"unfinished capture\");\r\nif(l==(-2))\r\nlua_pushinteger(ms->L,ms->capture[i].init-ms->src_init+1);\r\nelse\r\nlua_pushlstring(ms->L,ms->capture[i].init,l);\r\n}\r\n}\r\nstatic int push_captures(MatchState*ms,const char*s,const char*e){\r\nint i;\r\nint nlevels=(ms->level==0&&s)?1:ms->level;\r\nluaL_checkstack(ms->L,nlevels,\"too many captures\");\r\nfor(i=0;i<nlevels;i++)\r\npush_onecapture(ms,i,s,e);\r\nreturn nlevels;\r\n}\r\nstatic int str_find_aux(lua_State*L,int find){\r\nsize_t l1,l2;\r\nconst char*s=luaL_checklstring(L,1,&l1);\r\nconst char*p=luaL_checklstring(L,2,&l2);\r\nptrdiff_t init=posrelat(luaL_optinteger(L,3,1),l1)-1;\r\nif(init<0)init=0;\r\nelse if((size_t)(init)>l1)init=(ptrdiff_t)l1;\r\nif(find&&(lua_toboolean(L,4)||\r\nstrpbrk(p,\"^$*+?.([%-\")==NULL)){\r\nconst char*s2=lmemfind(s+init,l1-init,p,l2);\r\nif(s2){\r\nlua_pushinteger(L,s2-s+1);\r\nlua_pushinteger(L,s2-s+l2);\r\nreturn 2;\r\n}\r\n}\r\nelse{\r\nMatchState ms;\r\nint anchor=(*p=='^')?(p++,1):0;\r\nconst char*s1=s+init;\r\nms.L=L;\r\nms.src_init=s;\r\nms.src_end=s+l1;\r\ndo{\r\nconst char*res;\r\nms.level=0;\r\nif((res=match(&ms,s1,p))!=NULL){\r\nif(find){\r\nlua_pushinteger(L,s1-s+1);\r\nlua_pushinteger(L,res-s);\r\nreturn push_captures(&ms,NULL,0)+2;\r\n}\r\nelse\r\nreturn push_captures(&ms,s1,res);\r\n}\r\n}while(s1++<ms.src_end&&!anchor);\r\n}\r\nlua_pushnil(L);\r\nreturn 1;\r\n}\r\nstatic int str_find(lua_State*L){\r\nreturn str_find_aux(L,1);\r\n}\r\nstatic int str_match(lua_State*L){\r\nreturn str_find_aux(L,0);\r\n}\r\nstatic int gmatch_aux(lua_State*L){\r\nMatchState ms;\r\nsize_t ls;\r\nconst char*s=lua_tolstring(L,lua_upvalueindex(1),&ls);\r\nconst char*p=lua_tostring(L,lua_upvalueindex(2));\r\nconst char*src;\r\nms.L=L;\r\nms.src_init=s;\r\nms.src_end=s+ls;\r\nfor(src=s+(size_t)lua_tointeger(L,lua_upvalueindex(3));\r\nsrc<=ms.src_end;\r\nsrc++){\r\nconst char*e;\r\nms.level=0;\r\nif((e=match(&ms,src,p))!=NULL){\r\nlua_Integer newstart=e-s;\r\nif(e==src)newstart++;\r\nlua_pushinteger(L,newstart);\r\nlua_replace(L,lua_upvalueindex(3));\r\nreturn push_captures(&ms,src,e);\r\n}\r\n}\r\nreturn 0;\r\n}\r\nstatic int gmatch(lua_State*L){\r\nluaL_checkstring(L,1);\r\nluaL_checkstring(L,2);\r\nlua_settop(L,2);\r\nlua_pushinteger(L,0);\r\nlua_pushcclosure(L,gmatch_aux,3);\r\nreturn 1;\r\n}\r\nstatic void add_s(MatchState*ms,luaL_Buffer*b,const char*s,\r\nconst char*e){\r\nsize_t l,i;\r\nconst char*news=lua_tolstring(ms->L,3,&l);\r\nfor(i=0;i<l;i++){\r\nif(news[i]!='%')\r\nluaL_addchar(b,news[i]);\r\nelse{\r\ni++;\r\nif(!isdigit(uchar(news[i])))\r\nluaL_addchar(b,news[i]);\r\nelse if(news[i]=='0')\r\nluaL_addlstring(b,s,e-s);\r\nelse{\r\npush_onecapture(ms,news[i]-'1',s,e);\r\nluaL_addvalue(b);\r\n}\r\n}\r\n}\r\n}\r\nstatic void add_value(MatchState*ms,luaL_Buffer*b,const char*s,\r\nconst char*e){\r\nlua_State*L=ms->L;\r\nswitch(lua_type(L,3)){\r\ncase 3:\r\ncase 4:{\r\nadd_s(ms,b,s,e);\r\nreturn;\r\n}\r\ncase 6:{\r\nint n;\r\nlua_pushvalue(L,3);\r\nn=push_captures(ms,s,e);\r\nlua_call(L,n,1);\r\nbreak;\r\n}\r\ncase 5:{\r\npush_onecapture(ms,0,s,e);\r\nlua_gettable(L,3);\r\nbreak;\r\n}\r\n}\r\nif(!lua_toboolean(L,-1)){\r\nlua_pop(L,1);\r\nlua_pushlstring(L,s,e-s);\r\n}\r\nelse if(!lua_isstring(L,-1))\r\nluaL_error(L,\"invalid replacement value (a %s)\",luaL_typename(L,-1));\r\nluaL_addvalue(b);\r\n}\r\nstatic int str_gsub(lua_State*L){\r\nsize_t srcl;\r\nconst char*src=luaL_checklstring(L,1,&srcl);\r\nconst char*p=luaL_checkstring(L,2);\r\nint tr=lua_type(L,3);\r\nint max_s=luaL_optint(L,4,srcl+1);\r\nint anchor=(*p=='^')?(p++,1):0;\r\nint n=0;\r\nMatchState ms;\r\nluaL_Buffer b;\r\nluaL_argcheck(L,tr==3||tr==4||\r\ntr==6||tr==5,3,\r\n\"string/function/table expected\");\r\nluaL_buffinit(L,&b);\r\nms.L=L;\r\nms.src_init=src;\r\nms.src_end=src+srcl;\r\nwhile(n<max_s){\r\nconst char*e;\r\nms.level=0;\r\ne=match(&ms,src,p);\r\nif(e){\r\nn++;\r\nadd_value(&ms,&b,src,e);\r\n}\r\nif(e&&e>src)\r\nsrc=e;\r\nelse if(src<ms.src_end)\r\nluaL_addchar(&b,*src++);\r\nelse break;\r\nif(anchor)break;\r\n}\r\nluaL_addlstring(&b,src,ms.src_end-src);\r\nluaL_pushresult(&b);\r\nlua_pushinteger(L,n);\r\nreturn 2;\r\n}\r\nstatic void addquoted(lua_State*L,luaL_Buffer*b,int arg){\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nluaL_addchar(b,'\"');\r\nwhile(l--){\r\nswitch(*s){\r\ncase'\"':case'\\\\':case'\\n':{\r\nluaL_addchar(b,'\\\\');\r\nluaL_addchar(b,*s);\r\nbreak;\r\n}\r\ncase'\\r':{\r\nluaL_addlstring(b,\"\\\\r\",2);\r\nbreak;\r\n}\r\ncase'\\0':{\r\nluaL_addlstring(b,\"\\\\000\",4);\r\nbreak;\r\n}\r\ndefault:{\r\nluaL_addchar(b,*s);\r\nbreak;\r\n}\r\n}\r\ns++;\r\n}\r\nluaL_addchar(b,'\"');\r\n}\r\nstatic const char*scanformat(lua_State*L,const char*strfrmt,char*form){\r\nconst char*p=strfrmt;\r\nwhile(*p!='\\0'&&strchr(\"-+ #0\",*p)!=NULL)p++;\r\nif((size_t)(p-strfrmt)>=sizeof(\"-+ #0\"))\r\nluaL_error(L,\"invalid format (repeated flags)\");\r\nif(isdigit(uchar(*p)))p++;\r\nif(isdigit(uchar(*p)))p++;\r\nif(*p=='.'){\r\np++;\r\nif(isdigit(uchar(*p)))p++;\r\nif(isdigit(uchar(*p)))p++;\r\n}\r\nif(isdigit(uchar(*p)))\r\nluaL_error(L,\"invalid format (width or precision too long)\");\r\n*(form++)='%';\r\nstrncpy(form,strfrmt,p-strfrmt+1);\r\nform+=p-strfrmt+1;\r\n*form='\\0';\r\nreturn p;\r\n}\r\nstatic void addintlen(char*form){\r\nsize_t l=strlen(form);\r\nchar spec=form[l-1];\r\nstrcpy(form+l-1,\"l\");\r\nform[l+sizeof(\"l\")-2]=spec;\r\nform[l+sizeof(\"l\")-1]='\\0';\r\n}\r\nstatic int str_format(lua_State*L){\r\nint top=lua_gettop(L);\r\nint arg=1;\r\nsize_t sfl;\r\nconst char*strfrmt=luaL_checklstring(L,arg,&sfl);\r\nconst char*strfrmt_end=strfrmt+sfl;\r\nluaL_Buffer b;\r\nluaL_buffinit(L,&b);\r\nwhile(strfrmt<strfrmt_end){\r\nif(*strfrmt!='%')\r\nluaL_addchar(&b,*strfrmt++);\r\nelse if(*++strfrmt=='%')\r\nluaL_addchar(&b,*strfrmt++);\r\nelse{\r\nchar form[(sizeof(\"-+ #0\")+sizeof(\"l\")+10)];\r\nchar buff[512];\r\nif(++arg>top)\r\nluaL_argerror(L,arg,\"no value\");\r\nstrfrmt=scanformat(L,strfrmt,form);\r\nswitch(*strfrmt++){\r\ncase'c':{\r\nsprintf(buff,form,(int)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'd':case'i':{\r\naddintlen(form);\r\nsprintf(buff,form,(long)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'o':case'u':case'x':case'X':{\r\naddintlen(form);\r\nsprintf(buff,form,(unsigned long)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'e':case'E':case'f':\r\ncase'g':case'G':{\r\nsprintf(buff,form,(double)luaL_checknumber(L,arg));\r\nbreak;\r\n}\r\ncase'q':{\r\naddquoted(L,&b,arg);\r\ncontinue;\r\n}\r\ncase's':{\r\nsize_t l;\r\nconst char*s=luaL_checklstring(L,arg,&l);\r\nif(!strchr(form,'.')&&l>=100){\r\nlua_pushvalue(L,arg);\r\nluaL_addvalue(&b);\r\ncontinue;\r\n}\r\nelse{\r\nsprintf(buff,form,s);\r\nbreak;\r\n}\r\n}\r\ndefault:{\r\nreturn luaL_error(L,\"invalid option \"LUA_QL(\"%%%c\")\" to \"\r\nLUA_QL(\"format\"),*(strfrmt-1));\r\n}\r\n}\r\nluaL_addlstring(&b,buff,strlen(buff));\r\n}\r\n}\r\nluaL_pushresult(&b);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg strlib[]={\r\n{\"byte\",str_byte},\r\n{\"char\",str_char},\r\n{\"find\",str_find},\r\n{\"format\",str_format},\r\n{\"gmatch\",gmatch},\r\n{\"gsub\",str_gsub},\r\n{\"lower\",str_lower},\r\n{\"match\",str_match},\r\n{\"rep\",str_rep},\r\n{\"sub\",str_sub},\r\n{\"upper\",str_upper},\r\n{NULL,NULL}\r\n};\r\nstatic void createmetatable(lua_State*L){\r\nlua_createtable(L,0,1);\r\nlua_pushliteral(L,\"\");\r\nlua_pushvalue(L,-2);\r\nlua_setmetatable(L,-2);\r\nlua_pop(L,1);\r\nlua_pushvalue(L,-2);\r\nlua_setfield(L,-2,\"__index\");\r\nlua_pop(L,1);\r\n}\r\nstatic int luaopen_string(lua_State*L){\r\nluaL_register(L,\"string\",strlib);\r\ncreatemetatable(L);\r\nreturn 1;\r\n}\r\nstatic const luaL_Reg lualibs[]={\r\n{\"\",luaopen_base},\r\n{\"table\",luaopen_table},\r\n{\"io\",luaopen_io},\r\n{\"os\",luaopen_os},\r\n{\"string\",luaopen_string},\r\n{NULL,NULL}\r\n};\r\nstatic void luaL_openlibs(lua_State*L){\r\nconst luaL_Reg*lib=lualibs;\r\nfor(;lib->func;lib++){\r\nlua_pushcfunction(L,lib->func);\r\nlua_pushstring(L,lib->name);\r\nlua_call(L,1,0);\r\n}\r\n}\r\ntypedef unsigned int UB;\r\nstatic UB barg(lua_State*L,int idx){\r\nunion{lua_Number n;U64 b;}bn;\r\nbn.n=lua_tonumber(L,idx)+6755399441055744.0;\r\nif(bn.n==0.0&&!lua_isnumber(L,idx))luaL_typerror(L,idx,\"number\");\r\nreturn(UB)bn.b;\r\n}\r\n#define BRET(b)lua_pushnumber(L,(lua_Number)(int)(b));return 1;\r\nstatic int tobit(lua_State*L){\r\nBRET(barg(L,1))}\r\nstatic int bnot(lua_State*L){\r\nBRET(~barg(L,1))}\r\nstatic int band(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b&=barg(L,i);BRET(b)}\r\nstatic int bor(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b|=barg(L,i);BRET(b)}\r\nstatic int bxor(lua_State*L){\r\nint i;UB b=barg(L,1);for(i=lua_gettop(L);i>1;i--)b^=barg(L,i);BRET(b)}\r\nstatic int lshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b<<n)}\r\nstatic int rshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET(b>>n)}\r\nstatic int arshift(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((int)b>>n)}\r\nstatic int rol(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b<<n)|(b>>(32-n)))}\r\nstatic int ror(lua_State*L){\r\nUB b=barg(L,1),n=barg(L,2)&31;BRET((b>>n)|(b<<(32-n)))}\r\nstatic int bswap(lua_State*L){\r\nUB b=barg(L,1);b=(b>>24)|((b>>8)&0xff00)|((b&0xff00)<<8)|(b<<24);BRET(b)}\r\nstatic int tohex(lua_State*L){\r\nUB b=barg(L,1);\r\nint n=lua_isnone(L,2)?8:(int)barg(L,2);\r\nconst char*hexdigits=\"0123456789abcdef\";\r\nchar buf[8];\r\nint i;\r\nif(n<0){n=-n;hexdigits=\"0123456789ABCDEF\";}\r\nif(n>8)n=8;\r\nfor(i=(int)n;--i>=0;){buf[i]=hexdigits[b&15];b>>=4;}\r\nlua_pushlstring(L,buf,(size_t)n);\r\nreturn 1;\r\n}\r\nstatic const struct luaL_Reg bitlib[]={\r\n{\"tobit\",tobit},\r\n{\"bnot\",bnot},\r\n{\"band\",band},\r\n{\"bor\",bor},\r\n{\"bxor\",bxor},\r\n{\"lshift\",lshift},\r\n{\"rshift\",rshift},\r\n{\"arshift\",arshift},\r\n{\"rol\",rol},\r\n{\"ror\",ror},\r\n{\"bswap\",bswap},\r\n{\"tohex\",tohex},\r\n{NULL,NULL}\r\n};\r\nint main(int argc,char**argv){\r\nlua_State*L=luaL_newstate();\r\nint i;\r\nluaL_openlibs(L);\r\nluaL_register(L,\"bit\",bitlib);\r\nif(argc<2)return sizeof(void*);\r\nlua_createtable(L,0,1);\r\nlua_pushstring(L,argv[1]);\r\nlua_rawseti(L,-2,0);\r\nlua_setglobal(L,\"arg\");\r\nif(luaL_loadfile(L,argv[1]))\r\ngoto err;\r\nfor(i=2;i<argc;i++)\r\nlua_pushstring(L,argv[i]);\r\nif(lua_pcall(L,argc-2,0,0)){\r\nerr:\r\nfprintf(stderr,\"Error: %s\\n\",lua_tostring(L,-1));\r\nreturn 1;\r\n}\r\nlua_close(L);\r\nreturn 0;\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/bc.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT bytecode listing module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module lists the bytecode of a Lua function. If it's loaded by -jbc\r\n-- it hooks into the parser and lists all functions of a chunk as they\r\n-- are parsed.\r\n--\r\n-- Example usage:\r\n--\r\n--   luajit -jbc -e 'local x=0; for i=1,1e6 do x=x+i end; print(x)'\r\n--   luajit -jbc=- foo.lua\r\n--   luajit -jbc=foo.list foo.lua\r\n--\r\n-- Default output is to stderr. To redirect the output to a file, pass a\r\n-- filename as an argument (use '-' for stdout) or set the environment\r\n-- variable LUAJIT_LISTFILE. The file is overwritten every time the module\r\n-- is started.\r\n--\r\n-- This module can also be used programmatically:\r\n--\r\n--   local bc = require(\"jit.bc\")\r\n--\r\n--   local function foo() print(\"hello\") end\r\n--\r\n--   bc.dump(foo)           --> -- BYTECODE -- [...]\r\n--   print(bc.line(foo, 2)) --> 0002    KSTR     1   1      ; \"hello\"\r\n--\r\n--   local out = {\r\n--     -- Do something with each line:\r\n--     write = function(t, ...) io.write(...) end,\r\n--     close = function(t) end,\r\n--     flush = function(t) end,\r\n--   }\r\n--   bc.dump(foo, out)\r\n--\r\n------------------------------------------------------------------------------\r\n\r\n-- Cache some library functions and objects.\r\nlocal jit = require(\"jit\")\r\nassert(jit.version_num == 20100, \"LuaJIT core/library version mismatch\")\r\nlocal jutil = require(\"jit.util\")\r\nlocal vmdef = require(\"jit.vmdef\")\r\nlocal bit = require(\"bit\")\r\nlocal sub, gsub, format = string.sub, string.gsub, string.format\r\nlocal byte, band, shr = string.byte, bit.band, bit.rshift\r\nlocal funcinfo, funcbc, funck = jutil.funcinfo, jutil.funcbc, jutil.funck\r\nlocal funcuvname = jutil.funcuvname\r\nlocal bcnames = vmdef.bcnames\r\nlocal stdout, stderr = io.stdout, io.stderr\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function ctlsub(c)\r\n  if c == \"\\n\" then return \"\\\\n\"\r\n  elseif c == \"\\r\" then return \"\\\\r\"\r\n  elseif c == \"\\t\" then return \"\\\\t\"\r\n  else return format(\"\\\\%03d\", byte(c))\r\n  end\r\nend\r\n\r\n-- Return one bytecode line.\r\nlocal function bcline(func, pc, prefix)\r\n  local ins, m = funcbc(func, pc)\r\n  if not ins then return end\r\n  local ma, mb, mc = band(m, 7), band(m, 15*8), band(m, 15*128)\r\n  local a = band(shr(ins, 8), 0xff)\r\n  local oidx = 6*band(ins, 0xff)\r\n  local op = sub(bcnames, oidx+1, oidx+6)\r\n  local s = format(\"%04d %s %-6s %3s \",\r\n    pc, prefix or \"  \", op, ma == 0 and \"\" or a)\r\n  local d = shr(ins, 16)\r\n  if mc == 13*128 then -- BCMjump\r\n    return format(\"%s=> %04d\\n\", s, pc+d-0x7fff)\r\n  end\r\n  if mb ~= 0 then\r\n    d = band(d, 0xff)\r\n  elseif mc == 0 then\r\n    return s..\"\\n\"\r\n  end\r\n  local kc\r\n  if mc == 10*128 then -- BCMstr\r\n    kc = funck(func, -d-1)\r\n    kc = format(#kc > 40 and '\"%.40s\"~' or '\"%s\"', gsub(kc, \"%c\", ctlsub))\r\n  elseif mc == 9*128 then -- BCMnum\r\n    kc = funck(func, d)\r\n    if op == \"TSETM \" then kc = kc - 2^52 end\r\n  elseif mc == 12*128 then -- BCMfunc\r\n    local fi = funcinfo(funck(func, -d-1))\r\n    if fi.ffid then\r\n      kc = vmdef.ffnames[fi.ffid]\r\n    else\r\n      kc = fi.loc\r\n    end\r\n  elseif mc == 5*128 then -- BCMuv\r\n    kc = funcuvname(func, d)\r\n  end\r\n  if ma == 5 then -- BCMuv\r\n    local ka = funcuvname(func, a)\r\n    if kc then kc = ka..\" ; \"..kc else kc = ka end\r\n  end\r\n  if mb ~= 0 then\r\n    local b = shr(ins, 24)\r\n    if kc then return format(\"%s%3d %3d  ; %s\\n\", s, b, d, kc) end\r\n    return format(\"%s%3d %3d\\n\", s, b, d)\r\n  end\r\n  if kc then return format(\"%s%3d      ; %s\\n\", s, d, kc) end\r\n  if mc == 7*128 and d > 32767 then d = d - 65536 end -- BCMlits\r\n  return format(\"%s%3d\\n\", s, d)\r\nend\r\n\r\n-- Collect branch targets of a function.\r\nlocal function bctargets(func)\r\n  local target = {}\r\n  for pc=1,1000000000 do\r\n    local ins, m = funcbc(func, pc)\r\n    if not ins then break end\r\n    if band(m, 15*128) == 13*128 then target[pc+shr(ins, 16)-0x7fff] = true end\r\n  end\r\n  return target\r\nend\r\n\r\n-- Dump bytecode instructions of a function.\r\nlocal function bcdump(func, out, all)\r\n  if not out then out = stdout end\r\n  local fi = funcinfo(func)\r\n  if all and fi.children then\r\n    for n=-1,-1000000000,-1 do\r\n      local k = funck(func, n)\r\n      if not k then break end\r\n      if type(k) == \"proto\" then bcdump(k, out, true) end\r\n    end\r\n  end\r\n  out:write(format(\"-- BYTECODE -- %s-%d\\n\", fi.loc, fi.lastlinedefined))\r\n  local target = bctargets(func)\r\n  for pc=1,1000000000 do\r\n    local s = bcline(func, pc, target[pc] and \"=>\")\r\n    if not s then break end\r\n    out:write(s)\r\n  end\r\n  out:write(\"\\n\")\r\n  out:flush()\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Active flag and output file handle.\r\nlocal active, out\r\n\r\n-- List handler.\r\nlocal function h_list(func)\r\n  return bcdump(func, out)\r\nend\r\n\r\n-- Detach list handler.\r\nlocal function bclistoff()\r\n  if active then\r\n    active = false\r\n    jit.attach(h_list)\r\n    if out and out ~= stdout and out ~= stderr then out:close() end\r\n    out = nil\r\n  end\r\nend\r\n\r\n-- Open the output file and attach list handler.\r\nlocal function bcliston(outfile)\r\n  if active then bclistoff() end\r\n  if not outfile then outfile = os.getenv(\"LUAJIT_LISTFILE\") end\r\n  if outfile then\r\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\r\n  else\r\n    out = stderr\r\n  end\r\n  jit.attach(h_list, \"bc\")\r\n  active = true\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  line = bcline,\r\n  dump = bcdump,\r\n  targets = bctargets,\r\n  on = bcliston,\r\n  off = bclistoff,\r\n  start = bcliston -- For -j command line option.\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/bcsave.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT module to save/list bytecode.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module saves or lists the bytecode for an input file.\r\n-- It's run by the -b command line option.\r\n--\r\n------------------------------------------------------------------------------\r\n\r\nlocal jit = require(\"jit\")\r\nassert(jit.version_num == 20100, \"LuaJIT core/library version mismatch\")\r\nlocal bit = require(\"bit\")\r\n\r\n-- Symbol name prefix for LuaJIT bytecode.\r\nlocal LJBC_PREFIX = \"luaJIT_BC_\"\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function usage()\r\n  io.stderr:write[[\r\nSave LuaJIT bytecode: luajit -b[options] input output\r\n  -l        Only list bytecode.\r\n  -s        Strip debug info (default).\r\n  -g        Keep debug info.\r\n  -n name   Set module name (default: auto-detect from input name).\r\n  -t type   Set output file type (default: auto-detect from output name).\r\n  -a arch   Override architecture for object files (default: native).\r\n  -o os     Override OS for object files (default: native).\r\n  -e chunk  Use chunk string as input.\r\n  --        Stop handling options.\r\n  -         Use stdin as input and/or stdout as output.\r\n\r\nFile types: c h obj o raw (default)\r\n]]\r\n  os.exit(1)\r\nend\r\n\r\nlocal function check(ok, ...)\r\n  if ok then return ok, ... end\r\n  io.stderr:write(\"luajit: \", ...)\r\n  io.stderr:write(\"\\n\")\r\n  os.exit(1)\r\nend\r\n\r\nlocal function readfile(input)\r\n  if type(input) == \"function\" then return input end\r\n  if input == \"-\" then input = nil end\r\n  return check(loadfile(input))\r\nend\r\n\r\nlocal function savefile(name, mode)\r\n  if name == \"-\" then return io.stdout end\r\n  return check(io.open(name, mode))\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_type = {\r\n  raw = \"raw\", c = \"c\", h = \"h\", o = \"obj\", obj = \"obj\",\r\n}\r\n\r\nlocal map_arch = {\r\n  x86 = true, x64 = true, arm = true, arm64 = true, ppc = true,\r\n  mips = true, mipsel = true,\r\n}\r\n\r\nlocal map_os = {\r\n  linux = true, windows = true, osx = true, freebsd = true, netbsd = true,\r\n  openbsd = true, dragonfly = true, solaris = true,\r\n}\r\n\r\nlocal function checkarg(str, map, err)\r\n  str = string.lower(str)\r\n  local s = check(map[str], \"unknown \", err)\r\n  return s == true and str or s\r\nend\r\n\r\nlocal function detecttype(str)\r\n  local ext = string.match(string.lower(str), \"%.(%a+)$\")\r\n  return map_type[ext] or \"raw\"\r\nend\r\n\r\nlocal function checkmodname(str)\r\n  check(string.match(str, \"^[%w_.%-]+$\"), \"bad module name\")\r\n  return string.gsub(str, \"[%.%-]\", \"_\")\r\nend\r\n\r\nlocal function detectmodname(str)\r\n  if type(str) == \"string\" then\r\n    local tail = string.match(str, \"[^/\\\\]+$\")\r\n    if tail then str = tail end\r\n    local head = string.match(str, \"^(.*)%.[^.]*$\")\r\n    if head then str = head end\r\n    str = string.match(str, \"^[%w_.%-]+\")\r\n  else\r\n    str = nil\r\n  end\r\n  check(str, \"cannot derive module name, use -n name\")\r\n  return string.gsub(str, \"[%.%-]\", \"_\")\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function bcsave_tail(fp, output, s)\r\n  local ok, err = fp:write(s)\r\n  if ok and output ~= \"-\" then ok, err = fp:close() end\r\n  check(ok, \"cannot write \", output, \": \", err)\r\nend\r\n\r\nlocal function bcsave_raw(output, s)\r\n  local fp = savefile(output, \"wb\")\r\n  bcsave_tail(fp, output, s)\r\nend\r\n\r\nlocal function bcsave_c(ctx, output, s)\r\n  local fp = savefile(output, \"w\")\r\n  if ctx.type == \"c\" then\r\n    fp:write(string.format([[\r\n#ifdef _cplusplus\r\nextern \"C\"\r\n#endif\r\n#ifdef _WIN32\r\n__declspec(dllexport)\r\n#endif\r\nconst char %s%s[] = {\r\n]], LJBC_PREFIX, ctx.modname))\r\n  else\r\n    fp:write(string.format([[\r\n#define %s%s_SIZE %d\r\nstatic const char %s%s[] = {\r\n]], LJBC_PREFIX, ctx.modname, #s, LJBC_PREFIX, ctx.modname))\r\n  end\r\n  local t, n, m = {}, 0, 0\r\n  for i=1,#s do\r\n    local b = tostring(string.byte(s, i))\r\n    m = m + #b + 1\r\n    if m > 78 then\r\n      fp:write(table.concat(t, \",\", 1, n), \",\\n\")\r\n      n, m = 0, #b + 1\r\n    end\r\n    n = n + 1\r\n    t[n] = b\r\n  end\r\n  bcsave_tail(fp, output, table.concat(t, \",\", 1, n)..\"\\n};\\n\")\r\nend\r\n\r\nlocal function bcsave_elfobj(ctx, output, s, ffi)\r\n  ffi.cdef[[\r\ntypedef struct {\r\n  uint8_t emagic[4], eclass, eendian, eversion, eosabi, eabiversion, epad[7];\r\n  uint16_t type, machine;\r\n  uint32_t version;\r\n  uint32_t entry, phofs, shofs;\r\n  uint32_t flags;\r\n  uint16_t ehsize, phentsize, phnum, shentsize, shnum, shstridx;\r\n} ELF32header;\r\ntypedef struct {\r\n  uint8_t emagic[4], eclass, eendian, eversion, eosabi, eabiversion, epad[7];\r\n  uint16_t type, machine;\r\n  uint32_t version;\r\n  uint64_t entry, phofs, shofs;\r\n  uint32_t flags;\r\n  uint16_t ehsize, phentsize, phnum, shentsize, shnum, shstridx;\r\n} ELF64header;\r\ntypedef struct {\r\n  uint32_t name, type, flags, addr, ofs, size, link, info, align, entsize;\r\n} ELF32sectheader;\r\ntypedef struct {\r\n  uint32_t name, type;\r\n  uint64_t flags, addr, ofs, size;\r\n  uint32_t link, info;\r\n  uint64_t align, entsize;\r\n} ELF64sectheader;\r\ntypedef struct {\r\n  uint32_t name, value, size;\r\n  uint8_t info, other;\r\n  uint16_t sectidx;\r\n} ELF32symbol;\r\ntypedef struct {\r\n  uint32_t name;\r\n  uint8_t info, other;\r\n  uint16_t sectidx;\r\n  uint64_t value, size;\r\n} ELF64symbol;\r\ntypedef struct {\r\n  ELF32header hdr;\r\n  ELF32sectheader sect[6];\r\n  ELF32symbol sym[2];\r\n  uint8_t space[4096];\r\n} ELF32obj;\r\ntypedef struct {\r\n  ELF64header hdr;\r\n  ELF64sectheader sect[6];\r\n  ELF64symbol sym[2];\r\n  uint8_t space[4096];\r\n} ELF64obj;\r\n]]\r\n  local symname = LJBC_PREFIX..ctx.modname\r\n  local is64, isbe = false, false\r\n  if ctx.arch == \"x64\" then\r\n    is64 = true\r\n  elseif ctx.arch == \"ppc\" or ctx.arch == \"mips\" then\r\n    isbe = true\r\n  end\r\n\r\n  -- Handle different host/target endianess.\r\n  local function f32(x) return x end\r\n  local f16, fofs = f32, f32\r\n  if ffi.abi(\"be\") ~= isbe then\r\n    f32 = bit.bswap\r\n    function f16(x) return bit.rshift(bit.bswap(x), 16) end\r\n    if is64 then\r\n      local two32 = ffi.cast(\"int64_t\", 2^32)\r\n      function fofs(x) return bit.bswap(x)*two32 end\r\n    else\r\n      fofs = f32\r\n    end\r\n  end\r\n\r\n  -- Create ELF object and fill in header.\r\n  local o = ffi.new(is64 and \"ELF64obj\" or \"ELF32obj\")\r\n  local hdr = o.hdr\r\n  if ctx.os == \"bsd\" or ctx.os == \"other\" then -- Determine native hdr.eosabi.\r\n    local bf = assert(io.open(\"/bin/ls\", \"rb\"))\r\n    local bs = bf:read(9)\r\n    bf:close()\r\n    ffi.copy(o, bs, 9)\r\n    check(hdr.emagic[0] == 127, \"no support for writing native object files\")\r\n  else\r\n    hdr.emagic = \"\\127ELF\"\r\n    hdr.eosabi = ({ freebsd=9, netbsd=2, openbsd=12, solaris=6 })[ctx.os] or 0\r\n  end\r\n  hdr.eclass = is64 and 2 or 1\r\n  hdr.eendian = isbe and 2 or 1\r\n  hdr.eversion = 1\r\n  hdr.type = f16(1)\r\n  hdr.machine = f16(({ x86=3, x64=62, arm=40, arm64=183, ppc=20, mips=8, mipsel=8 })[ctx.arch])\r\n  if ctx.arch == \"mips\" or ctx.arch == \"mipsel\" then\r\n    hdr.flags = 0x50001006\r\n  end\r\n  hdr.version = f32(1)\r\n  hdr.shofs = fofs(ffi.offsetof(o, \"sect\"))\r\n  hdr.ehsize = f16(ffi.sizeof(hdr))\r\n  hdr.shentsize = f16(ffi.sizeof(o.sect[0]))\r\n  hdr.shnum = f16(6)\r\n  hdr.shstridx = f16(2)\r\n\r\n  -- Fill in sections and symbols.\r\n  local sofs, ofs = ffi.offsetof(o, \"space\"), 1\r\n  for i,name in ipairs{\r\n      \".symtab\", \".shstrtab\", \".strtab\", \".rodata\", \".note.GNU-stack\",\r\n    } do\r\n    local sect = o.sect[i]\r\n    sect.align = fofs(1)\r\n    sect.name = f32(ofs)\r\n    ffi.copy(o.space+ofs, name)\r\n    ofs = ofs + #name+1\r\n  end\r\n  o.sect[1].type = f32(2) -- .symtab\r\n  o.sect[1].link = f32(3)\r\n  o.sect[1].info = f32(1)\r\n  o.sect[1].align = fofs(8)\r\n  o.sect[1].ofs = fofs(ffi.offsetof(o, \"sym\"))\r\n  o.sect[1].entsize = fofs(ffi.sizeof(o.sym[0]))\r\n  o.sect[1].size = fofs(ffi.sizeof(o.sym))\r\n  o.sym[1].name = f32(1)\r\n  o.sym[1].sectidx = f16(4)\r\n  o.sym[1].size = fofs(#s)\r\n  o.sym[1].info = 17\r\n  o.sect[2].type = f32(3) -- .shstrtab\r\n  o.sect[2].ofs = fofs(sofs)\r\n  o.sect[2].size = fofs(ofs)\r\n  o.sect[3].type = f32(3) -- .strtab\r\n  o.sect[3].ofs = fofs(sofs + ofs)\r\n  o.sect[3].size = fofs(#symname+1)\r\n  ffi.copy(o.space+ofs+1, symname)\r\n  ofs = ofs + #symname + 2\r\n  o.sect[4].type = f32(1) -- .rodata\r\n  o.sect[4].flags = fofs(2)\r\n  o.sect[4].ofs = fofs(sofs + ofs)\r\n  o.sect[4].size = fofs(#s)\r\n  o.sect[5].type = f32(1) -- .note.GNU-stack\r\n  o.sect[5].ofs = fofs(sofs + ofs + #s)\r\n\r\n  -- Write ELF object file.\r\n  local fp = savefile(output, \"wb\")\r\n  fp:write(ffi.string(o, ffi.sizeof(o)-4096+ofs))\r\n  bcsave_tail(fp, output, s)\r\nend\r\n\r\nlocal function bcsave_peobj(ctx, output, s, ffi)\r\n  ffi.cdef[[\r\ntypedef struct {\r\n  uint16_t arch, nsects;\r\n  uint32_t time, symtabofs, nsyms;\r\n  uint16_t opthdrsz, flags;\r\n} PEheader;\r\ntypedef struct {\r\n  char name[8];\r\n  uint32_t vsize, vaddr, size, ofs, relocofs, lineofs;\r\n  uint16_t nreloc, nline;\r\n  uint32_t flags;\r\n} PEsection;\r\ntypedef struct __attribute((packed)) {\r\n  union {\r\n    char name[8];\r\n    uint32_t nameref[2];\r\n  };\r\n  uint32_t value;\r\n  int16_t sect;\r\n  uint16_t type;\r\n  uint8_t scl, naux;\r\n} PEsym;\r\ntypedef struct __attribute((packed)) {\r\n  uint32_t size;\r\n  uint16_t nreloc, nline;\r\n  uint32_t cksum;\r\n  uint16_t assoc;\r\n  uint8_t comdatsel, unused[3];\r\n} PEsymaux;\r\ntypedef struct {\r\n  PEheader hdr;\r\n  PEsection sect[2];\r\n  // Must be an even number of symbol structs.\r\n  PEsym sym0;\r\n  PEsymaux sym0aux;\r\n  PEsym sym1;\r\n  PEsymaux sym1aux;\r\n  PEsym sym2;\r\n  PEsym sym3;\r\n  uint32_t strtabsize;\r\n  uint8_t space[4096];\r\n} PEobj;\r\n]]\r\n  local symname = LJBC_PREFIX..ctx.modname\r\n  local is64 = false\r\n  if ctx.arch == \"x86\" then\r\n    symname = \"_\"..symname\r\n  elseif ctx.arch == \"x64\" then\r\n    is64 = true\r\n  end\r\n  local symexport = \"   /EXPORT:\"..symname..\",DATA \"\r\n\r\n  -- The file format is always little-endian. Swap if the host is big-endian.\r\n  local function f32(x) return x end\r\n  local f16 = f32\r\n  if ffi.abi(\"be\") then\r\n    f32 = bit.bswap\r\n    function f16(x) return bit.rshift(bit.bswap(x), 16) end\r\n  end\r\n\r\n  -- Create PE object and fill in header.\r\n  local o = ffi.new(\"PEobj\")\r\n  local hdr = o.hdr\r\n  hdr.arch = f16(({ x86=0x14c, x64=0x8664, arm=0x1c0, ppc=0x1f2, mips=0x366, mipsel=0x366 })[ctx.arch])\r\n  hdr.nsects = f16(2)\r\n  hdr.symtabofs = f32(ffi.offsetof(o, \"sym0\"))\r\n  hdr.nsyms = f32(6)\r\n\r\n  -- Fill in sections and symbols.\r\n  o.sect[0].name = \".drectve\"\r\n  o.sect[0].size = f32(#symexport)\r\n  o.sect[0].flags = f32(0x00100a00)\r\n  o.sym0.sect = f16(1)\r\n  o.sym0.scl = 3\r\n  o.sym0.name = \".drectve\"\r\n  o.sym0.naux = 1\r\n  o.sym0aux.size = f32(#symexport)\r\n  o.sect[1].name = \".rdata\"\r\n  o.sect[1].size = f32(#s)\r\n  o.sect[1].flags = f32(0x40300040)\r\n  o.sym1.sect = f16(2)\r\n  o.sym1.scl = 3\r\n  o.sym1.name = \".rdata\"\r\n  o.sym1.naux = 1\r\n  o.sym1aux.size = f32(#s)\r\n  o.sym2.sect = f16(2)\r\n  o.sym2.scl = 2\r\n  o.sym2.nameref[1] = f32(4)\r\n  o.sym3.sect = f16(-1)\r\n  o.sym3.scl = 2\r\n  o.sym3.value = f32(1)\r\n  o.sym3.name = \"@feat.00\" -- Mark as SafeSEH compliant.\r\n  ffi.copy(o.space, symname)\r\n  local ofs = #symname + 1\r\n  o.strtabsize = f32(ofs + 4)\r\n  o.sect[0].ofs = f32(ffi.offsetof(o, \"space\") + ofs)\r\n  ffi.copy(o.space + ofs, symexport)\r\n  ofs = ofs + #symexport\r\n  o.sect[1].ofs = f32(ffi.offsetof(o, \"space\") + ofs)\r\n\r\n  -- Write PE object file.\r\n  local fp = savefile(output, \"wb\")\r\n  fp:write(ffi.string(o, ffi.sizeof(o)-4096+ofs))\r\n  bcsave_tail(fp, output, s)\r\nend\r\n\r\nlocal function bcsave_machobj(ctx, output, s, ffi)\r\n  ffi.cdef[[\r\ntypedef struct\r\n{\r\n  uint32_t magic, cputype, cpusubtype, filetype, ncmds, sizeofcmds, flags;\r\n} mach_header;\r\ntypedef struct\r\n{\r\n  mach_header; uint32_t reserved;\r\n} mach_header_64;\r\ntypedef struct {\r\n  uint32_t cmd, cmdsize;\r\n  char segname[16];\r\n  uint32_t vmaddr, vmsize, fileoff, filesize;\r\n  uint32_t maxprot, initprot, nsects, flags;\r\n} mach_segment_command;\r\ntypedef struct {\r\n  uint32_t cmd, cmdsize;\r\n  char segname[16];\r\n  uint64_t vmaddr, vmsize, fileoff, filesize;\r\n  uint32_t maxprot, initprot, nsects, flags;\r\n} mach_segment_command_64;\r\ntypedef struct {\r\n  char sectname[16], segname[16];\r\n  uint32_t addr, size;\r\n  uint32_t offset, align, reloff, nreloc, flags;\r\n  uint32_t reserved1, reserved2;\r\n} mach_section;\r\ntypedef struct {\r\n  char sectname[16], segname[16];\r\n  uint64_t addr, size;\r\n  uint32_t offset, align, reloff, nreloc, flags;\r\n  uint32_t reserved1, reserved2, reserved3;\r\n} mach_section_64;\r\ntypedef struct {\r\n  uint32_t cmd, cmdsize, symoff, nsyms, stroff, strsize;\r\n} mach_symtab_command;\r\ntypedef struct {\r\n  int32_t strx;\r\n  uint8_t type, sect;\r\n  int16_t desc;\r\n  uint32_t value;\r\n} mach_nlist;\r\ntypedef struct {\r\n  uint32_t strx;\r\n  uint8_t type, sect;\r\n  uint16_t desc;\r\n  uint64_t value;\r\n} mach_nlist_64;\r\ntypedef struct\r\n{\r\n  uint32_t magic, nfat_arch;\r\n} mach_fat_header;\r\ntypedef struct\r\n{\r\n  uint32_t cputype, cpusubtype, offset, size, align;\r\n} mach_fat_arch;\r\ntypedef struct {\r\n  struct {\r\n    mach_header hdr;\r\n    mach_segment_command seg;\r\n    mach_section sec;\r\n    mach_symtab_command sym;\r\n  } arch[1];\r\n  mach_nlist sym_entry;\r\n  uint8_t space[4096];\r\n} mach_obj;\r\ntypedef struct {\r\n  struct {\r\n    mach_header_64 hdr;\r\n    mach_segment_command_64 seg;\r\n    mach_section_64 sec;\r\n    mach_symtab_command sym;\r\n  } arch[1];\r\n  mach_nlist_64 sym_entry;\r\n  uint8_t space[4096];\r\n} mach_obj_64;\r\ntypedef struct {\r\n  mach_fat_header fat;\r\n  mach_fat_arch fat_arch[2];\r\n  struct {\r\n    mach_header hdr;\r\n    mach_segment_command seg;\r\n    mach_section sec;\r\n    mach_symtab_command sym;\r\n  } arch[2];\r\n  mach_nlist sym_entry;\r\n  uint8_t space[4096];\r\n} mach_fat_obj;\r\n]]\r\n  local symname = '_'..LJBC_PREFIX..ctx.modname\r\n  local isfat, is64, align, mobj = false, false, 4, \"mach_obj\"\r\n  if ctx.arch == \"x64\" then\r\n    is64, align, mobj = true, 8, \"mach_obj_64\"\r\n  elseif ctx.arch == \"arm\" then\r\n    isfat, mobj = true, \"mach_fat_obj\"\r\n  elseif ctx.arch == \"arm64\" then\r\n    is64, align, isfat, mobj = true, 8, true, \"mach_fat_obj\"\r\n  else\r\n    check(ctx.arch == \"x86\", \"unsupported architecture for OSX\")\r\n  end\r\n  local function aligned(v, a) return bit.band(v+a-1, -a) end\r\n  local be32 = bit.bswap -- Mach-O FAT is BE, supported archs are LE.\r\n\r\n  -- Create Mach-O object and fill in header.\r\n  local o = ffi.new(mobj)\r\n  local mach_size = aligned(ffi.offsetof(o, \"space\")+#symname+2, align)\r\n  local cputype = ({ x86={7}, x64={0x01000007}, arm={7,12}, arm64={0x01000007,0x0100000c} })[ctx.arch]\r\n  local cpusubtype = ({ x86={3}, x64={3}, arm={3,9}, arm64={3,0} })[ctx.arch]\r\n  if isfat then\r\n    o.fat.magic = be32(0xcafebabe)\r\n    o.fat.nfat_arch = be32(#cpusubtype)\r\n  end\r\n\r\n  -- Fill in sections and symbols.\r\n  for i=0,#cpusubtype-1 do\r\n    local ofs = 0\r\n    if isfat then\r\n      local a = o.fat_arch[i]\r\n      a.cputype = be32(cputype[i+1])\r\n      a.cpusubtype = be32(cpusubtype[i+1])\r\n      -- Subsequent slices overlap each other to share data.\r\n      ofs = ffi.offsetof(o, \"arch\") + i*ffi.sizeof(o.arch[0])\r\n      a.offset = be32(ofs)\r\n      a.size = be32(mach_size-ofs+#s)\r\n    end\r\n    local a = o.arch[i]\r\n    a.hdr.magic = is64 and 0xfeedfacf or 0xfeedface\r\n    a.hdr.cputype = cputype[i+1]\r\n    a.hdr.cpusubtype = cpusubtype[i+1]\r\n    a.hdr.filetype = 1\r\n    a.hdr.ncmds = 2\r\n    a.hdr.sizeofcmds = ffi.sizeof(a.seg)+ffi.sizeof(a.sec)+ffi.sizeof(a.sym)\r\n    a.seg.cmd = is64 and 0x19 or 0x1\r\n    a.seg.cmdsize = ffi.sizeof(a.seg)+ffi.sizeof(a.sec)\r\n    a.seg.vmsize = #s\r\n    a.seg.fileoff = mach_size-ofs\r\n    a.seg.filesize = #s\r\n    a.seg.maxprot = 1\r\n    a.seg.initprot = 1\r\n    a.seg.nsects = 1\r\n    ffi.copy(a.sec.sectname, \"__data\")\r\n    ffi.copy(a.sec.segname, \"__DATA\")\r\n    a.sec.size = #s\r\n    a.sec.offset = mach_size-ofs\r\n    a.sym.cmd = 2\r\n    a.sym.cmdsize = ffi.sizeof(a.sym)\r\n    a.sym.symoff = ffi.offsetof(o, \"sym_entry\")-ofs\r\n    a.sym.nsyms = 1\r\n    a.sym.stroff = ffi.offsetof(o, \"sym_entry\")+ffi.sizeof(o.sym_entry)-ofs\r\n    a.sym.strsize = aligned(#symname+2, align)\r\n  end\r\n  o.sym_entry.type = 0xf\r\n  o.sym_entry.sect = 1\r\n  o.sym_entry.strx = 1\r\n  ffi.copy(o.space+1, symname)\r\n\r\n  -- Write Macho-O object file.\r\n  local fp = savefile(output, \"wb\")\r\n  fp:write(ffi.string(o, mach_size))\r\n  bcsave_tail(fp, output, s)\r\nend\r\n\r\nlocal function bcsave_obj(ctx, output, s)\r\n  local ok, ffi = pcall(require, \"ffi\")\r\n  check(ok, \"FFI library required to write this file type\")\r\n  if ctx.os == \"windows\" then\r\n    return bcsave_peobj(ctx, output, s, ffi)\r\n  elseif ctx.os == \"osx\" then\r\n    return bcsave_machobj(ctx, output, s, ffi)\r\n  else\r\n    return bcsave_elfobj(ctx, output, s, ffi)\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function bclist(input, output)\r\n  local f = readfile(input)\r\n  require(\"jit.bc\").dump(f, savefile(output, \"w\"), true)\r\nend\r\n\r\nlocal function bcsave(ctx, input, output)\r\n  local f = readfile(input)\r\n  local s = string.dump(f, ctx.strip)\r\n  local t = ctx.type\r\n  if not t then\r\n    t = detecttype(output)\r\n    ctx.type = t\r\n  end\r\n  if t == \"raw\" then\r\n    bcsave_raw(output, s)\r\n  else\r\n    if not ctx.modname then ctx.modname = detectmodname(input) end\r\n    if t == \"obj\" then\r\n      bcsave_obj(ctx, output, s)\r\n    else\r\n      bcsave_c(ctx, output, s)\r\n    end\r\n  end\r\nend\r\n\r\nlocal function docmd(...)\r\n  local arg = {...}\r\n  local n = 1\r\n  local list = false\r\n  local ctx = {\r\n    strip = true, arch = jit.arch, os = string.lower(jit.os),\r\n    type = false, modname = false,\r\n  }\r\n  while n <= #arg do\r\n    local a = arg[n]\r\n    if type(a) == \"string\" and string.sub(a, 1, 1) == \"-\" and a ~= \"-\" then\r\n      table.remove(arg, n)\r\n      if a == \"--\" then break end\r\n      for m=2,#a do\r\n\tlocal opt = string.sub(a, m, m)\r\n\tif opt == \"l\" then\r\n\t  list = true\r\n\telseif opt == \"s\" then\r\n\t  ctx.strip = true\r\n\telseif opt == \"g\" then\r\n\t  ctx.strip = false\r\n\telse\r\n\t  if arg[n] == nil or m ~= #a then usage() end\r\n\t  if opt == \"e\" then\r\n\t    if n ~= 1 then usage() end\r\n\t    arg[1] = check(loadstring(arg[1]))\r\n\t  elseif opt == \"n\" then\r\n\t    ctx.modname = checkmodname(table.remove(arg, n))\r\n\t  elseif opt == \"t\" then\r\n\t    ctx.type = checkarg(table.remove(arg, n), map_type, \"file type\")\r\n\t  elseif opt == \"a\" then\r\n\t    ctx.arch = checkarg(table.remove(arg, n), map_arch, \"architecture\")\r\n\t  elseif opt == \"o\" then\r\n\t    ctx.os = checkarg(table.remove(arg, n), map_os, \"OS name\")\r\n\t  else\r\n\t    usage()\r\n\t  end\r\n\tend\r\n      end\r\n    else\r\n      n = n + 1\r\n    end\r\n  end\r\n  if list then\r\n    if #arg == 0 or #arg > 2 then usage() end\r\n    bclist(arg[1], arg[2] or \"-\")\r\n  else\r\n    if #arg ~= 2 then usage() end\r\n    bcsave(ctx, arg[1], arg[2])\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Public module functions.\r\nreturn {\r\n  start = docmd -- Process -b command line option.\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_arm.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT ARM disassembler module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This is a helper module used by the LuaJIT machine code dumper module.\r\n--\r\n-- It disassembles most user-mode ARMv7 instructions\r\n-- NYI: Advanced SIMD and VFP instructions.\r\n------------------------------------------------------------------------------\r\n\r\nlocal type = type\r\nlocal sub, byte, format = string.sub, string.byte, string.format\r\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\r\nlocal concat = table.concat\r\nlocal bit = require(\"bit\")\r\nlocal band, bor, ror, tohex = bit.band, bit.bor, bit.ror, bit.tohex\r\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\r\n\r\n------------------------------------------------------------------------------\r\n-- Opcode maps\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_loadc = {\r\n  shift = 8, mask = 15,\r\n  [10] = {\r\n    shift = 20, mask = 1,\r\n    [0] = {\r\n      shift = 23, mask = 3,\r\n      [0] = \"vmovFmDN\", \"vstmFNdr\",\r\n      _ = {\r\n\tshift = 21, mask = 1,\r\n\t[0] = \"vstrFdl\",\r\n\t{ shift = 16, mask = 15, [13] = \"vpushFdr\", _ = \"vstmdbFNdr\", }\r\n      },\r\n    },\r\n    {\r\n      shift = 23, mask = 3,\r\n      [0] = \"vmovFDNm\",\r\n      { shift = 16, mask = 15, [13] = \"vpopFdr\", _ = \"vldmFNdr\", },\r\n      _ = {\r\n\tshift = 21, mask = 1,\r\n\t[0] = \"vldrFdl\", \"vldmdbFNdr\",\r\n      },\r\n    },\r\n  },\r\n  [11] = {\r\n    shift = 20, mask = 1,\r\n    [0] = {\r\n      shift = 23, mask = 3,\r\n      [0] = \"vmovGmDN\", \"vstmGNdr\",\r\n      _ = {\r\n\tshift = 21, mask = 1,\r\n\t[0] = \"vstrGdl\",\r\n\t{ shift = 16, mask = 15, [13] = \"vpushGdr\", _ = \"vstmdbGNdr\", }\r\n      },\r\n    },\r\n    {\r\n      shift = 23, mask = 3,\r\n      [0] = \"vmovGDNm\",\r\n      { shift = 16, mask = 15, [13] = \"vpopGdr\", _ = \"vldmGNdr\", },\r\n      _ = {\r\n\tshift = 21, mask = 1,\r\n\t[0] = \"vldrGdl\", \"vldmdbGNdr\",\r\n      },\r\n    },\r\n  },\r\n  _ = {\r\n    shift = 0, mask = 0 -- NYI ldc, mcrr, mrrc.\r\n  },\r\n}\r\n\r\nlocal map_vfps = {\r\n  shift = 6, mask = 0x2c001,\r\n  [0] = \"vmlaF.dnm\", \"vmlsF.dnm\",\r\n  [0x04000] = \"vnmlsF.dnm\", [0x04001] = \"vnmlaF.dnm\",\r\n  [0x08000] = \"vmulF.dnm\", [0x08001] = \"vnmulF.dnm\",\r\n  [0x0c000] = \"vaddF.dnm\", [0x0c001] = \"vsubF.dnm\",\r\n  [0x20000] = \"vdivF.dnm\",\r\n  [0x24000] = \"vfnmsF.dnm\", [0x24001] = \"vfnmaF.dnm\",\r\n  [0x28000] = \"vfmaF.dnm\", [0x28001] = \"vfmsF.dnm\",\r\n  [0x2c000] = \"vmovF.dY\",\r\n  [0x2c001] = {\r\n    shift = 7, mask = 0x1e01,\r\n    [0] = \"vmovF.dm\", \"vabsF.dm\",\r\n    [0x0200] = \"vnegF.dm\", [0x0201] = \"vsqrtF.dm\",\r\n    [0x0800] = \"vcmpF.dm\", [0x0801] = \"vcmpeF.dm\",\r\n    [0x0a00] = \"vcmpzF.d\", [0x0a01] = \"vcmpzeF.d\",\r\n    [0x0e01] = \"vcvtG.dF.m\",\r\n    [0x1000] = \"vcvt.f32.u32Fdm\", [0x1001] = \"vcvt.f32.s32Fdm\",\r\n    [0x1800] = \"vcvtr.u32F.dm\", [0x1801] = \"vcvt.u32F.dm\",\r\n    [0x1a00] = \"vcvtr.s32F.dm\", [0x1a01] = \"vcvt.s32F.dm\",\r\n  },\r\n}\r\n\r\nlocal map_vfpd = {\r\n  shift = 6, mask = 0x2c001,\r\n  [0] = \"vmlaG.dnm\", \"vmlsG.dnm\",\r\n  [0x04000] = \"vnmlsG.dnm\", [0x04001] = \"vnmlaG.dnm\",\r\n  [0x08000] = \"vmulG.dnm\", [0x08001] = \"vnmulG.dnm\",\r\n  [0x0c000] = \"vaddG.dnm\", [0x0c001] = \"vsubG.dnm\",\r\n  [0x20000] = \"vdivG.dnm\",\r\n  [0x24000] = \"vfnmsG.dnm\", [0x24001] = \"vfnmaG.dnm\",\r\n  [0x28000] = \"vfmaG.dnm\", [0x28001] = \"vfmsG.dnm\",\r\n  [0x2c000] = \"vmovG.dY\",\r\n  [0x2c001] = {\r\n    shift = 7, mask = 0x1e01,\r\n    [0] = \"vmovG.dm\", \"vabsG.dm\",\r\n    [0x0200] = \"vnegG.dm\", [0x0201] = \"vsqrtG.dm\",\r\n    [0x0800] = \"vcmpG.dm\", [0x0801] = \"vcmpeG.dm\",\r\n    [0x0a00] = \"vcmpzG.d\", [0x0a01] = \"vcmpzeG.d\",\r\n    [0x0e01] = \"vcvtF.dG.m\",\r\n    [0x1000] = \"vcvt.f64.u32GdFm\", [0x1001] = \"vcvt.f64.s32GdFm\",\r\n    [0x1800] = \"vcvtr.u32FdG.m\", [0x1801] = \"vcvt.u32FdG.m\",\r\n    [0x1a00] = \"vcvtr.s32FdG.m\", [0x1a01] = \"vcvt.s32FdG.m\",\r\n  },\r\n}\r\n\r\nlocal map_datac = {\r\n  shift = 24, mask = 1,\r\n  [0] = {\r\n    shift = 4, mask = 1,\r\n    [0] = {\r\n      shift = 8, mask = 15,\r\n      [10] = map_vfps,\r\n      [11] = map_vfpd,\r\n      -- NYI cdp, mcr, mrc.\r\n    },\r\n    {\r\n      shift = 8, mask = 15,\r\n      [10] = {\r\n\tshift = 20, mask = 15,\r\n\t[0] = \"vmovFnD\", \"vmovFDn\",\r\n\t[14] = \"vmsrD\",\r\n\t[15] = { shift = 12, mask = 15, [15] = \"vmrs\", _ = \"vmrsD\", },\r\n      },\r\n    },\r\n  },\r\n  \"svcT\",\r\n}\r\n\r\nlocal map_loadcu = {\r\n  shift = 0, mask = 0, -- NYI unconditional CP load/store.\r\n}\r\n\r\nlocal map_datacu = {\r\n  shift = 0, mask = 0, -- NYI unconditional CP data.\r\n}\r\n\r\nlocal map_simddata = {\r\n  shift = 0, mask = 0, -- NYI SIMD data.\r\n}\r\n\r\nlocal map_simdload = {\r\n  shift = 0, mask = 0, -- NYI SIMD load/store, preload.\r\n}\r\n\r\nlocal map_preload = {\r\n  shift = 0, mask = 0, -- NYI preload.\r\n}\r\n\r\nlocal map_media = {\r\n  shift = 20, mask = 31,\r\n  [0] = false,\r\n  { --01\r\n    shift = 5, mask = 7,\r\n    [0] = \"sadd16DNM\", \"sasxDNM\", \"ssaxDNM\", \"ssub16DNM\",\r\n    \"sadd8DNM\", false, false, \"ssub8DNM\",\r\n  },\r\n  { --02\r\n    shift = 5, mask = 7,\r\n    [0] = \"qadd16DNM\", \"qasxDNM\", \"qsaxDNM\", \"qsub16DNM\",\r\n    \"qadd8DNM\", false, false, \"qsub8DNM\",\r\n  },\r\n  { --03\r\n    shift = 5, mask = 7,\r\n    [0] = \"shadd16DNM\", \"shasxDNM\", \"shsaxDNM\", \"shsub16DNM\",\r\n    \"shadd8DNM\", false, false, \"shsub8DNM\",\r\n  },\r\n  false,\r\n  { --05\r\n    shift = 5, mask = 7,\r\n    [0] = \"uadd16DNM\", \"uasxDNM\", \"usaxDNM\", \"usub16DNM\",\r\n    \"uadd8DNM\", false, false, \"usub8DNM\",\r\n  },\r\n  { --06\r\n    shift = 5, mask = 7,\r\n    [0] = \"uqadd16DNM\", \"uqasxDNM\", \"uqsaxDNM\", \"uqsub16DNM\",\r\n    \"uqadd8DNM\", false, false, \"uqsub8DNM\",\r\n  },\r\n  { --07\r\n    shift = 5, mask = 7,\r\n    [0] = \"uhadd16DNM\", \"uhasxDNM\", \"uhsaxDNM\", \"uhsub16DNM\",\r\n    \"uhadd8DNM\", false, false, \"uhsub8DNM\",\r\n  },\r\n  { --08\r\n    shift = 5, mask = 7,\r\n    [0] = \"pkhbtDNMU\", false, \"pkhtbDNMU\",\r\n    { shift = 16, mask = 15, [15] = \"sxtb16DMU\", _ = \"sxtab16DNMU\", },\r\n    \"pkhbtDNMU\", \"selDNM\", \"pkhtbDNMU\",\r\n  },\r\n  false,\r\n  { --0a\r\n    shift = 5, mask = 7,\r\n    [0] = \"ssatDxMu\", \"ssat16DxM\", \"ssatDxMu\",\r\n    { shift = 16, mask = 15, [15] = \"sxtbDMU\", _ = \"sxtabDNMU\", },\r\n    \"ssatDxMu\", false, \"ssatDxMu\",\r\n  },\r\n  { --0b\r\n    shift = 5, mask = 7,\r\n    [0] = \"ssatDxMu\", \"revDM\", \"ssatDxMu\",\r\n    { shift = 16, mask = 15, [15] = \"sxthDMU\", _ = \"sxtahDNMU\", },\r\n    \"ssatDxMu\", \"rev16DM\", \"ssatDxMu\",\r\n  },\r\n  { --0c\r\n    shift = 5, mask = 7,\r\n    [3] = { shift = 16, mask = 15, [15] = \"uxtb16DMU\", _ = \"uxtab16DNMU\", },\r\n  },\r\n  false,\r\n  { --0e\r\n    shift = 5, mask = 7,\r\n    [0] = \"usatDwMu\", \"usat16DwM\", \"usatDwMu\",\r\n    { shift = 16, mask = 15, [15] = \"uxtbDMU\", _ = \"uxtabDNMU\", },\r\n    \"usatDwMu\", false, \"usatDwMu\",\r\n  },\r\n  { --0f\r\n    shift = 5, mask = 7,\r\n    [0] = \"usatDwMu\", \"rbitDM\", \"usatDwMu\",\r\n    { shift = 16, mask = 15, [15] = \"uxthDMU\", _ = \"uxtahDNMU\", },\r\n    \"usatDwMu\", \"revshDM\", \"usatDwMu\",\r\n  },\r\n  { --10\r\n    shift = 12, mask = 15,\r\n    [15] = {\r\n      shift = 5, mask = 7,\r\n      \"smuadNMS\", \"smuadxNMS\", \"smusdNMS\", \"smusdxNMS\",\r\n    },\r\n    _ = {\r\n      shift = 5, mask = 7,\r\n      [0] = \"smladNMSD\", \"smladxNMSD\", \"smlsdNMSD\", \"smlsdxNMSD\",\r\n    },\r\n  },\r\n  false, false, false,\r\n  { --14\r\n    shift = 5, mask = 7,\r\n    [0] = \"smlaldDNMS\", \"smlaldxDNMS\", \"smlsldDNMS\", \"smlsldxDNMS\",\r\n  },\r\n  { --15\r\n    shift = 5, mask = 7,\r\n    [0] = { shift = 12, mask = 15, [15] = \"smmulNMS\", _ = \"smmlaNMSD\", },\r\n    { shift = 12, mask = 15, [15] = \"smmulrNMS\", _ = \"smmlarNMSD\", },\r\n    false, false, false, false,\r\n    \"smmlsNMSD\", \"smmlsrNMSD\",\r\n  },\r\n  false, false,\r\n  { --18\r\n    shift = 5, mask = 7,\r\n    [0] = { shift = 12, mask = 15, [15] = \"usad8NMS\", _ = \"usada8NMSD\", },\r\n  },\r\n  false,\r\n  { --1a\r\n    shift = 5, mask = 3, [2] = \"sbfxDMvw\",\r\n  },\r\n  { --1b\r\n    shift = 5, mask = 3, [2] = \"sbfxDMvw\",\r\n  },\r\n  { --1c\r\n    shift = 5, mask = 3,\r\n    [0] = { shift = 0, mask = 15, [15] = \"bfcDvX\", _ = \"bfiDMvX\", },\r\n  },\r\n  { --1d\r\n    shift = 5, mask = 3,\r\n    [0] = { shift = 0, mask = 15, [15] = \"bfcDvX\", _ = \"bfiDMvX\", },\r\n  },\r\n  { --1e\r\n    shift = 5, mask = 3, [2] = \"ubfxDMvw\",\r\n  },\r\n  { --1f\r\n    shift = 5, mask = 3, [2] = \"ubfxDMvw\",\r\n  },\r\n}\r\n\r\nlocal map_load = {\r\n  shift = 21, mask = 9,\r\n  {\r\n    shift = 20, mask = 5,\r\n    [0] = \"strtDL\", \"ldrtDL\", [4] = \"strbtDL\", [5] = \"ldrbtDL\",\r\n  },\r\n  _ = {\r\n    shift = 20, mask = 5,\r\n    [0] = \"strDL\", \"ldrDL\", [4] = \"strbDL\", [5] = \"ldrbDL\",\r\n  }\r\n}\r\n\r\nlocal map_load1 = {\r\n  shift = 4, mask = 1,\r\n  [0] = map_load, map_media,\r\n}\r\n\r\nlocal map_loadm = {\r\n  shift = 20, mask = 1,\r\n  [0] = {\r\n    shift = 23, mask = 3,\r\n    [0] = \"stmdaNR\", \"stmNR\",\r\n    { shift = 16, mask = 63, [45] = \"pushR\", _ = \"stmdbNR\", }, \"stmibNR\",\r\n  },\r\n  {\r\n    shift = 23, mask = 3,\r\n    [0] = \"ldmdaNR\", { shift = 16, mask = 63, [61] = \"popR\", _ = \"ldmNR\", },\r\n    \"ldmdbNR\", \"ldmibNR\",\r\n  },\r\n}\r\n\r\nlocal map_data = {\r\n  shift = 21, mask = 15,\r\n  [0] = \"andDNPs\", \"eorDNPs\", \"subDNPs\", \"rsbDNPs\",\r\n  \"addDNPs\", \"adcDNPs\", \"sbcDNPs\", \"rscDNPs\",\r\n  \"tstNP\", \"teqNP\", \"cmpNP\", \"cmnNP\",\r\n  \"orrDNPs\", \"movDPs\", \"bicDNPs\", \"mvnDPs\",\r\n}\r\n\r\nlocal map_mul = {\r\n  shift = 21, mask = 7,\r\n  [0] = \"mulNMSs\", \"mlaNMSDs\", \"umaalDNMS\", \"mlsDNMS\",\r\n  \"umullDNMSs\", \"umlalDNMSs\", \"smullDNMSs\", \"smlalDNMSs\",\r\n}\r\n\r\nlocal map_sync = {\r\n  shift = 20, mask = 15, -- NYI: brackets around N. R(D+1) for ldrexd/strexd.\r\n  [0] = \"swpDMN\", false, false, false,\r\n  \"swpbDMN\", false, false, false,\r\n  \"strexDMN\", \"ldrexDN\", \"strexdDN\", \"ldrexdDN\",\r\n  \"strexbDMN\", \"ldrexbDN\", \"strexhDN\", \"ldrexhDN\",\r\n}\r\n\r\nlocal map_mulh = {\r\n  shift = 21, mask = 3,\r\n  [0] = { shift = 5, mask = 3,\r\n    [0] = \"smlabbNMSD\", \"smlatbNMSD\", \"smlabtNMSD\", \"smlattNMSD\", },\r\n  { shift = 5, mask = 3,\r\n    [0] = \"smlawbNMSD\", \"smulwbNMS\", \"smlawtNMSD\", \"smulwtNMS\", },\r\n  { shift = 5, mask = 3,\r\n    [0] = \"smlalbbDNMS\", \"smlaltbDNMS\", \"smlalbtDNMS\", \"smlalttDNMS\", },\r\n  { shift = 5, mask = 3,\r\n    [0] = \"smulbbNMS\", \"smultbNMS\", \"smulbtNMS\", \"smulttNMS\", },\r\n}\r\n\r\nlocal map_misc = {\r\n  shift = 4, mask = 7,\r\n  -- NYI: decode PSR bits of msr.\r\n  [0] = { shift = 21, mask = 1, [0] = \"mrsD\", \"msrM\", },\r\n  { shift = 21, mask = 3, \"bxM\", false, \"clzDM\", },\r\n  { shift = 21, mask = 3, \"bxjM\", },\r\n  { shift = 21, mask = 3, \"blxM\", },\r\n  false,\r\n  { shift = 21, mask = 3, [0] = \"qaddDMN\", \"qsubDMN\", \"qdaddDMN\", \"qdsubDMN\", },\r\n  false,\r\n  { shift = 21, mask = 3, \"bkptK\", },\r\n}\r\n\r\nlocal map_datar = {\r\n  shift = 4, mask = 9,\r\n  [9] = {\r\n    shift = 5, mask = 3,\r\n    [0] = { shift = 24, mask = 1, [0] = map_mul, map_sync, },\r\n    { shift = 20, mask = 1, [0] = \"strhDL\", \"ldrhDL\", },\r\n    { shift = 20, mask = 1, [0] = \"ldrdDL\", \"ldrsbDL\", },\r\n    { shift = 20, mask = 1, [0] = \"strdDL\", \"ldrshDL\", },\r\n  },\r\n  _ = {\r\n    shift = 20, mask = 25,\r\n    [16] = { shift = 7, mask = 1, [0] = map_misc, map_mulh, },\r\n    _ = {\r\n      shift = 0, mask = 0xffffffff,\r\n      [bor(0xe1a00000)] = \"nop\",\r\n      _ = map_data,\r\n    }\r\n  },\r\n}\r\n\r\nlocal map_datai = {\r\n  shift = 20, mask = 31, -- NYI: decode PSR bits of msr. Decode imm12.\r\n  [16] = \"movwDW\", [20] = \"movtDW\",\r\n  [18] = { shift = 0, mask = 0xf00ff, [0] = \"nopv6\", _ = \"msrNW\", },\r\n  [22] = \"msrNW\",\r\n  _ = map_data,\r\n}\r\n\r\nlocal map_branch = {\r\n  shift = 24, mask = 1,\r\n  [0] = \"bB\", \"blB\"\r\n}\r\n\r\nlocal map_condins = {\r\n  [0] = map_datar, map_datai, map_load, map_load1,\r\n  map_loadm, map_branch, map_loadc, map_datac\r\n}\r\n\r\n-- NYI: setend.\r\nlocal map_uncondins = {\r\n  [0] = false, map_simddata, map_simdload, map_preload,\r\n  false, \"blxB\", map_loadcu, map_datacu,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_gpr = {\r\n  [0] = \"r0\", \"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\r\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"sp\", \"lr\", \"pc\",\r\n}\r\n\r\nlocal map_cond = {\r\n  [0] = \"eq\", \"ne\", \"hs\", \"lo\", \"mi\", \"pl\", \"vs\", \"vc\",\r\n  \"hi\", \"ls\", \"ge\", \"lt\", \"gt\", \"le\", \"al\",\r\n}\r\n\r\nlocal map_shift = { [0] = \"lsl\", \"lsr\", \"asr\", \"ror\", }\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Output a nicely formatted line with an opcode and operands.\r\nlocal function putop(ctx, text, operands)\r\n  local pos = ctx.pos\r\n  local extra = \"\"\r\n  if ctx.rel then\r\n    local sym = ctx.symtab[ctx.rel]\r\n    if sym then\r\n      extra = \"\\t->\"..sym\r\n    elseif band(ctx.op, 0x0e000000) ~= 0x0a000000 then\r\n      extra = \"\\t; 0x\"..tohex(ctx.rel)\r\n    end\r\n  end\r\n  if ctx.hexdump > 0 then\r\n    ctx.out(format(\"%08x  %s  %-5s %s%s\\n\",\r\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\r\n  else\r\n    ctx.out(format(\"%08x  %-5s %s%s\\n\",\r\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\r\n  end\r\n  ctx.pos = pos + 4\r\nend\r\n\r\n-- Fallback for unknown opcodes.\r\nlocal function unknown(ctx)\r\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\r\nend\r\n\r\n-- Format operand 2 of load/store opcodes.\r\nlocal function fmtload(ctx, op, pos)\r\n  local base = map_gpr[band(rshift(op, 16), 15)]\r\n  local x, ofs\r\n  local ext = (band(op, 0x04000000) == 0)\r\n  if not ext and band(op, 0x02000000) == 0 then\r\n    ofs = band(op, 4095)\r\n    if band(op, 0x00800000) == 0 then ofs = -ofs end\r\n    if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\r\n    ofs = \"#\"..ofs\r\n  elseif ext and band(op, 0x00400000) ~= 0 then\r\n    ofs = band(op, 15) + band(rshift(op, 4), 0xf0)\r\n    if band(op, 0x00800000) == 0 then ofs = -ofs end\r\n    if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\r\n    ofs = \"#\"..ofs\r\n  else\r\n    ofs = map_gpr[band(op, 15)]\r\n    if ext or band(op, 0xfe0) == 0 then\r\n    elseif band(op, 0xfe0) == 0x60 then\r\n      ofs = format(\"%s, rrx\", ofs)\r\n    else\r\n      local sh = band(rshift(op, 7), 31)\r\n      if sh == 0 then sh = 32 end\r\n      ofs = format(\"%s, %s #%d\", ofs, map_shift[band(rshift(op, 5), 3)], sh)\r\n    end\r\n    if band(op, 0x00800000) == 0 then ofs = \"-\"..ofs end\r\n  end\r\n  if ofs == \"#0\" then\r\n    x = format(\"[%s]\", base)\r\n  elseif band(op, 0x01000000) == 0 then\r\n    x = format(\"[%s], %s\", base, ofs)\r\n  else\r\n    x = format(\"[%s, %s]\", base, ofs)\r\n  end\r\n  if band(op, 0x01200000) == 0x01200000 then x = x..\"!\" end\r\n  return x\r\nend\r\n\r\n-- Format operand 2 of vector load/store opcodes.\r\nlocal function fmtvload(ctx, op, pos)\r\n  local base = map_gpr[band(rshift(op, 16), 15)]\r\n  local ofs = band(op, 255)*4\r\n  if band(op, 0x00800000) == 0 then ofs = -ofs end\r\n  if base == \"pc\" then ctx.rel = ctx.addr + pos + 8 + ofs end\r\n  if ofs == 0 then\r\n    return format(\"[%s]\", base)\r\n  else\r\n    return format(\"[%s, #%d]\", base, ofs)\r\n  end\r\nend\r\n\r\nlocal function fmtvr(op, vr, sh0, sh1)\r\n  if vr == \"s\" then\r\n    return format(\"s%d\", 2*band(rshift(op, sh0), 15)+band(rshift(op, sh1), 1))\r\n  else\r\n    return format(\"d%d\", band(rshift(op, sh0), 15)+band(rshift(op, sh1-4), 16))\r\n  end\r\nend\r\n\r\n-- Disassemble a single instruction.\r\nlocal function disass_ins(ctx)\r\n  local pos = ctx.pos\r\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\r\n  local op = bor(lshift(b3, 24), lshift(b2, 16), lshift(b1, 8), b0)\r\n  local operands = {}\r\n  local suffix = \"\"\r\n  local last, name, pat\r\n  local vr\r\n  ctx.op = op\r\n  ctx.rel = nil\r\n\r\n  local cond = rshift(op, 28)\r\n  local opat\r\n  if cond == 15 then\r\n    opat = map_uncondins[band(rshift(op, 25), 7)]\r\n  else\r\n    if cond ~= 14 then suffix = map_cond[cond] end\r\n    opat = map_condins[band(rshift(op, 25), 7)]\r\n  end\r\n  while type(opat) ~= \"string\" do\r\n    if not opat then return unknown(ctx) end\r\n    opat = opat[band(rshift(op, opat.shift), opat.mask)] or opat._\r\n  end\r\n  name, pat = match(opat, \"^([a-z0-9]*)(.*)\")\r\n  if sub(pat, 1, 1) == \".\" then\r\n    local s2, p2 = match(pat, \"^([a-z0-9.]*)(.*)\")\r\n    suffix = suffix..s2\r\n    pat = p2\r\n  end\r\n\r\n  for p in gmatch(pat, \".\") do\r\n    local x = nil\r\n    if p == \"D\" then\r\n      x = map_gpr[band(rshift(op, 12), 15)]\r\n    elseif p == \"N\" then\r\n      x = map_gpr[band(rshift(op, 16), 15)]\r\n    elseif p == \"S\" then\r\n      x = map_gpr[band(rshift(op, 8), 15)]\r\n    elseif p == \"M\" then\r\n      x = map_gpr[band(op, 15)]\r\n    elseif p == \"d\" then\r\n      x = fmtvr(op, vr, 12, 22)\r\n    elseif p == \"n\" then\r\n      x = fmtvr(op, vr, 16, 7)\r\n    elseif p == \"m\" then\r\n      x = fmtvr(op, vr, 0, 5)\r\n    elseif p == \"P\" then\r\n      if band(op, 0x02000000) ~= 0 then\r\n\tx = ror(band(op, 255), 2*band(rshift(op, 8), 15))\r\n      else\r\n\tx = map_gpr[band(op, 15)]\r\n\tif band(op, 0xff0) ~= 0 then\r\n\t  operands[#operands+1] = x\r\n\t  local s = map_shift[band(rshift(op, 5), 3)]\r\n\t  local r = nil\r\n\t  if band(op, 0xf90) == 0 then\r\n\t    if s == \"ror\" then s = \"rrx\" else r = \"#32\" end\r\n\t  elseif band(op, 0x10) == 0 then\r\n\t    r = \"#\"..band(rshift(op, 7), 31)\r\n\t  else\r\n\t    r = map_gpr[band(rshift(op, 8), 15)]\r\n\t  end\r\n\t  if name == \"mov\" then name = s; x = r\r\n\t  elseif r then x = format(\"%s %s\", s, r)\r\n\t  else x = s end\r\n\tend\r\n      end\r\n    elseif p == \"L\" then\r\n      x = fmtload(ctx, op, pos)\r\n    elseif p == \"l\" then\r\n      x = fmtvload(ctx, op, pos)\r\n    elseif p == \"B\" then\r\n      local addr = ctx.addr + pos + 8 + arshift(lshift(op, 8), 6)\r\n      if cond == 15 then addr = addr + band(rshift(op, 23), 2) end\r\n      ctx.rel = addr\r\n      x = \"0x\"..tohex(addr)\r\n    elseif p == \"F\" then\r\n      vr = \"s\"\r\n    elseif p == \"G\" then\r\n      vr = \"d\"\r\n    elseif p == \".\" then\r\n      suffix = suffix..(vr == \"s\" and \".f32\" or \".f64\")\r\n    elseif p == \"R\" then\r\n      if band(op, 0x00200000) ~= 0 and #operands == 1 then\r\n\toperands[1] = operands[1]..\"!\"\r\n      end\r\n      local t = {}\r\n      for i=0,15 do\r\n\tif band(rshift(op, i), 1) == 1 then t[#t+1] = map_gpr[i] end\r\n      end\r\n      x = \"{\"..concat(t, \", \")..\"}\"\r\n    elseif p == \"r\" then\r\n      if band(op, 0x00200000) ~= 0 and #operands == 2 then\r\n\toperands[1] = operands[1]..\"!\"\r\n      end\r\n      local s = tonumber(sub(last, 2))\r\n      local n = band(op, 255)\r\n      if vr == \"d\" then n = rshift(n, 1) end\r\n      operands[#operands] = format(\"{%s-%s%d}\", last, vr, s+n-1)\r\n    elseif p == \"W\" then\r\n      x = band(op, 0x0fff) + band(rshift(op, 4), 0xf000)\r\n    elseif p == \"T\" then\r\n      x = \"#0x\"..tohex(band(op, 0x00ffffff), 6)\r\n    elseif p == \"U\" then\r\n      x = band(rshift(op, 7), 31)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"u\" then\r\n      x = band(rshift(op, 7), 31)\r\n      if band(op, 0x40) == 0 then\r\n\tif x == 0 then x = nil else x = \"lsl #\"..x end\r\n      else\r\n\tif x == 0 then x = \"asr #32\" else x = \"asr #\"..x end\r\n      end\r\n    elseif p == \"v\" then\r\n      x = band(rshift(op, 7), 31)\r\n    elseif p == \"w\" then\r\n      x = band(rshift(op, 16), 31)\r\n    elseif p == \"x\" then\r\n      x = band(rshift(op, 16), 31) + 1\r\n    elseif p == \"X\" then\r\n      x = band(rshift(op, 16), 31) - last + 1\r\n    elseif p == \"Y\" then\r\n      x = band(rshift(op, 12), 0xf0) + band(op, 0x0f)\r\n    elseif p == \"K\" then\r\n      x = \"#0x\"..tohex(band(rshift(op, 4), 0x0000fff0) + band(op, 15), 4)\r\n    elseif p == \"s\" then\r\n      if band(op, 0x00100000) ~= 0 then suffix = \"s\"..suffix end\r\n    else\r\n      assert(false)\r\n    end\r\n    if x then\r\n      last = x\r\n      if type(x) == \"number\" then x = \"#\"..x end\r\n      operands[#operands+1] = x\r\n    end\r\n  end\r\n\r\n  return putop(ctx, name..suffix, operands)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Disassemble a block of code.\r\nlocal function disass_block(ctx, ofs, len)\r\n  if not ofs then ofs = 0 end\r\n  local stop = len and ofs+len or #ctx.code\r\n  ctx.pos = ofs\r\n  ctx.rel = nil\r\n  while ctx.pos < stop do disass_ins(ctx) end\r\nend\r\n\r\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\r\nlocal function create(code, addr, out)\r\n  local ctx = {}\r\n  ctx.code = code\r\n  ctx.addr = addr or 0\r\n  ctx.out = out or io.write\r\n  ctx.symtab = {}\r\n  ctx.disass = disass_block\r\n  ctx.hexdump = 8\r\n  return ctx\r\nend\r\n\r\n-- Simple API: disassemble code (a string) at address and output via out.\r\nlocal function disass(code, addr, out)\r\n  create(code, addr, out):disass()\r\nend\r\n\r\n-- Return register name for RID.\r\nlocal function regname(r)\r\n  if r < 16 then return map_gpr[r] end\r\n  return \"d\"..(r-16)\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  create = create,\r\n  disass = disass,\r\n  regname = regname\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_mips.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT MIPS disassembler module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT/X license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This is a helper module used by the LuaJIT machine code dumper module.\r\n--\r\n-- It disassembles all standard MIPS32R1/R2 instructions.\r\n-- Default mode is big-endian, but see: dis_mipsel.lua\r\n------------------------------------------------------------------------------\r\n\r\nlocal type = type\r\nlocal sub, byte, format = string.sub, string.byte, string.format\r\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\r\nlocal concat = table.concat\r\nlocal bit = require(\"bit\")\r\nlocal band, bor, tohex = bit.band, bit.bor, bit.tohex\r\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\r\n\r\n------------------------------------------------------------------------------\r\n-- Primary and extended opcode maps\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_movci = { shift = 16, mask = 1, [0] = \"movfDSC\", \"movtDSC\", }\r\nlocal map_srl = { shift = 21, mask = 1, [0] = \"srlDTA\", \"rotrDTA\", }\r\nlocal map_srlv = { shift = 6, mask = 1, [0] = \"srlvDTS\", \"rotrvDTS\", }\r\n\r\nlocal map_special = {\r\n  shift = 0, mask = 63,\r\n  [0] = { shift = 0, mask = -1, [0] = \"nop\", _ = \"sllDTA\" },\r\n  map_movci,\tmap_srl,\t\"sraDTA\",\r\n  \"sllvDTS\",\tfalse,\t\tmap_srlv,\t\"sravDTS\",\r\n  \"jrS\",\t\"jalrD1S\",\t\"movzDST\",\t\"movnDST\",\r\n  \"syscallY\",\t\"breakY\",\tfalse,\t\t\"sync\",\r\n  \"mfhiD\",\t\"mthiS\",\t\"mfloD\",\t\"mtloS\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"multST\",\t\"multuST\",\t\"divST\",\t\"divuST\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"addDST\",\t\"addu|moveDST0\", \"subDST\",\t\"subu|neguDS0T\",\r\n  \"andDST\",\t\"orDST\",\t\"xorDST\",\t\"nor|notDST0\",\r\n  false,\tfalse,\t\t\"sltDST\",\t\"sltuDST\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"tgeSTZ\",\t\"tgeuSTZ\",\t\"tltSTZ\",\t\"tltuSTZ\",\r\n  \"teqSTZ\",\tfalse,\t\t\"tneSTZ\",\r\n}\r\n\r\nlocal map_special2 = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"maddST\", \"madduST\",\t\"mulDST\",\tfalse,\r\n  \"msubST\",\t\"msubuST\",\r\n  [32] = \"clzDS\", [33] = \"cloDS\",\r\n  [63] = \"sdbbpY\",\r\n}\r\n\r\nlocal map_bshfl = {\r\n  shift = 6, mask = 31,\r\n  [2] = \"wsbhDT\",\r\n  [16] = \"sebDT\",\r\n  [24] = \"sehDT\",\r\n}\r\n\r\nlocal map_special3 = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"extTSAK\", [4] = \"insTSAL\",\r\n  [32] = map_bshfl,\r\n  [59] = \"rdhwrTD\",\r\n}\r\n\r\nlocal map_regimm = {\r\n  shift = 16, mask = 31,\r\n  [0] = \"bltzSB\",\t\"bgezSB\",\t\"bltzlSB\",\t\"bgezlSB\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"tgeiSI\",\t\"tgeiuSI\",\t\"tltiSI\",\t\"tltiuSI\",\r\n  \"teqiSI\",\tfalse,\t\t\"tneiSI\",\tfalse,\r\n  \"bltzalSB\",\t\"bgezalSB\",\t\"bltzallSB\",\t\"bgezallSB\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\t\"synciSO\",\r\n}\r\n\r\nlocal map_cop0 = {\r\n  shift = 25, mask = 1,\r\n  [0] = {\r\n    shift = 21, mask = 15,\r\n    [0] = \"mfc0TDW\", [4] = \"mtc0TDW\",\r\n    [10] = \"rdpgprDT\",\r\n    [11] = { shift = 5, mask = 1, [0] = \"diT0\", \"eiT0\", },\r\n    [14] = \"wrpgprDT\",\r\n  }, {\r\n    shift = 0, mask = 63,\r\n    [1] = \"tlbr\", [2] = \"tlbwi\", [6] = \"tlbwr\", [8] = \"tlbp\",\r\n    [24] = \"eret\", [31] = \"deret\",\r\n    [32] = \"wait\",\r\n  },\r\n}\r\n\r\nlocal map_cop1s = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"add.sFGH\",\t\"sub.sFGH\",\t\"mul.sFGH\",\t\"div.sFGH\",\r\n  \"sqrt.sFG\",\t\t\"abs.sFG\",\t\"mov.sFG\",\t\"neg.sFG\",\r\n  \"round.l.sFG\",\t\"trunc.l.sFG\",\t\"ceil.l.sFG\",\t\"floor.l.sFG\",\r\n  \"round.w.sFG\",\t\"trunc.w.sFG\",\t\"ceil.w.sFG\",\t\"floor.w.sFG\",\r\n  false,\r\n  { shift = 16, mask = 1, [0] = \"movf.sFGC\", \"movt.sFGC\" },\r\n  \"movz.sFGT\",\t\"movn.sFGT\",\r\n  false,\t\"recip.sFG\",\t\"rsqrt.sFG\",\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\t\"cvt.d.sFG\",\tfalse,\t\tfalse,\r\n  \"cvt.w.sFG\",\t\"cvt.l.sFG\",\t\"cvt.ps.sFGH\",\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"c.f.sVGH\",\t\"c.un.sVGH\",\t\"c.eq.sVGH\",\t\"c.ueq.sVGH\",\r\n  \"c.olt.sVGH\",\t\"c.ult.sVGH\",\t\"c.ole.sVGH\",\t\"c.ule.sVGH\",\r\n  \"c.sf.sVGH\",\t\"c.ngle.sVGH\",\t\"c.seq.sVGH\",\t\"c.ngl.sVGH\",\r\n  \"c.lt.sVGH\",\t\"c.nge.sVGH\",\t\"c.le.sVGH\",\t\"c.ngt.sVGH\",\r\n}\r\n\r\nlocal map_cop1d = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"add.dFGH\",\t\"sub.dFGH\",\t\"mul.dFGH\",\t\"div.dFGH\",\r\n  \"sqrt.dFG\",\t\t\"abs.dFG\",\t\"mov.dFG\",\t\"neg.dFG\",\r\n  \"round.l.dFG\",\t\"trunc.l.dFG\",\t\"ceil.l.dFG\",\t\"floor.l.dFG\",\r\n  \"round.w.dFG\",\t\"trunc.w.dFG\",\t\"ceil.w.dFG\",\t\"floor.w.dFG\",\r\n  false,\r\n  { shift = 16, mask = 1, [0] = \"movf.dFGC\", \"movt.dFGC\" },\r\n  \"movz.dFGT\",\t\"movn.dFGT\",\r\n  false,\t\"recip.dFG\",\t\"rsqrt.dFG\",\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"cvt.s.dFG\",\tfalse,\t\tfalse,\t\tfalse,\r\n  \"cvt.w.dFG\",\t\"cvt.l.dFG\",\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"c.f.dVGH\",\t\"c.un.dVGH\",\t\"c.eq.dVGH\",\t\"c.ueq.dVGH\",\r\n  \"c.olt.dVGH\",\t\"c.ult.dVGH\",\t\"c.ole.dVGH\",\t\"c.ule.dVGH\",\r\n  \"c.df.dVGH\",\t\"c.ngle.dVGH\",\t\"c.deq.dVGH\",\t\"c.ngl.dVGH\",\r\n  \"c.lt.dVGH\",\t\"c.nge.dVGH\",\t\"c.le.dVGH\",\t\"c.ngt.dVGH\",\r\n}\r\n\r\nlocal map_cop1ps = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"add.psFGH\",\t\"sub.psFGH\",\t\"mul.psFGH\",\tfalse,\r\n  false,\t\t\"abs.psFG\",\t\"mov.psFG\",\t\"neg.psFG\",\r\n  false,\t\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\t\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\r\n  { shift = 16, mask = 1, [0] = \"movf.psFGC\", \"movt.psFGC\" },\r\n  \"movz.psFGT\",\t\"movn.psFGT\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"cvt.s.puFG\",\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  \"cvt.s.plFG\",\tfalse,\t\tfalse,\t\tfalse,\r\n  \"pll.psFGH\",\t\"plu.psFGH\",\t\"pul.psFGH\",\t\"puu.psFGH\",\r\n  \"c.f.psVGH\",\t\"c.un.psVGH\",\t\"c.eq.psVGH\",\t\"c.ueq.psVGH\",\r\n  \"c.olt.psVGH\", \"c.ult.psVGH\",\t\"c.ole.psVGH\",\t\"c.ule.psVGH\",\r\n  \"c.psf.psVGH\", \"c.ngle.psVGH\", \"c.pseq.psVGH\", \"c.ngl.psVGH\",\r\n  \"c.lt.psVGH\",\t\"c.nge.psVGH\",\t\"c.le.psVGH\",\t\"c.ngt.psVGH\",\r\n}\r\n\r\nlocal map_cop1w = {\r\n  shift = 0, mask = 63,\r\n  [32] = \"cvt.s.wFG\", [33] = \"cvt.d.wFG\",\r\n}\r\n\r\nlocal map_cop1l = {\r\n  shift = 0, mask = 63,\r\n  [32] = \"cvt.s.lFG\", [33] = \"cvt.d.lFG\",\r\n}\r\n\r\nlocal map_cop1bc = {\r\n  shift = 16, mask = 3,\r\n  [0] = \"bc1fCB\", \"bc1tCB\",\t\"bc1flCB\",\t\"bc1tlCB\",\r\n}\r\n\r\nlocal map_cop1 = {\r\n  shift = 21, mask = 31,\r\n  [0] = \"mfc1TG\", false,\t\"cfc1TG\",\t\"mfhc1TG\",\r\n  \"mtc1TG\",\tfalse,\t\t\"ctc1TG\",\t\"mthc1TG\",\r\n  map_cop1bc,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  map_cop1s,\tmap_cop1d,\tfalse,\t\tfalse,\r\n  map_cop1w,\tmap_cop1l,\tmap_cop1ps,\r\n}\r\n\r\nlocal map_cop1x = {\r\n  shift = 0, mask = 63,\r\n  [0] = \"lwxc1FSX\",\t\"ldxc1FSX\",\tfalse,\t\tfalse,\r\n  false,\t\"luxc1FSX\",\tfalse,\t\tfalse,\r\n  \"swxc1FSX\",\t\"sdxc1FSX\",\tfalse,\t\tfalse,\r\n  false,\t\"suxc1FSX\",\tfalse,\t\t\"prefxMSX\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\t\"alnv.psFGHS\",\tfalse,\r\n  \"madd.sFRGH\",\t\"madd.dFRGH\",\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\t\"madd.psFRGH\",\tfalse,\r\n  \"msub.sFRGH\",\t\"msub.dFRGH\",\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\t\"msub.psFRGH\",\tfalse,\r\n  \"nmadd.sFRGH\", \"nmadd.dFRGH\",\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\t\"nmadd.psFRGH\",\tfalse,\r\n  \"nmsub.sFRGH\", \"nmsub.dFRGH\",\tfalse,\t\tfalse,\r\n  false,\tfalse,\t\t\"nmsub.psFRGH\",\tfalse,\r\n}\r\n\r\nlocal map_pri = {\r\n  [0] = map_special,\tmap_regimm,\t\"jJ\",\t\"jalJ\",\r\n  \"beq|beqz|bST00B\",\t\"bne|bnezST0B\",\t\t\"blezSB\",\t\"bgtzSB\",\r\n  \"addiTSI\",\t\"addiu|liTS0I\",\t\"sltiTSI\",\t\"sltiuTSI\",\r\n  \"andiTSU\",\t\"ori|liTS0U\",\t\"xoriTSU\",\t\"luiTU\",\r\n  map_cop0,\tmap_cop1,\tfalse,\t\tmap_cop1x,\r\n  \"beql|beqzlST0B\",\t\"bnel|bnezlST0B\",\t\"blezlSB\",\t\"bgtzlSB\",\r\n  false,\tfalse,\t\tfalse,\t\tfalse,\r\n  map_special2,\tfalse,\t\tfalse,\t\tmap_special3,\r\n  \"lbTSO\",\t\"lhTSO\",\t\"lwlTSO\",\t\"lwTSO\",\r\n  \"lbuTSO\",\t\"lhuTSO\",\t\"lwrTSO\",\tfalse,\r\n  \"sbTSO\",\t\"shTSO\",\t\"swlTSO\",\t\"swTSO\",\r\n  false,\tfalse,\t\t\"swrTSO\",\t\"cacheNSO\",\r\n  \"llTSO\",\t\"lwc1HSO\",\t\"lwc2TSO\",\t\"prefNSO\",\r\n  false,\t\"ldc1HSO\",\t\"ldc2TSO\",\tfalse,\r\n  \"scTSO\",\t\"swc1HSO\",\t\"swc2TSO\",\tfalse,\r\n  false,\t\"sdc1HSO\",\t\"sdc2TSO\",\tfalse,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_gpr = {\r\n  [0] = \"r0\", \"r1\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\r\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\",\r\n  \"r16\", \"r17\", \"r18\", \"r19\", \"r20\", \"r21\", \"r22\", \"r23\",\r\n  \"r24\", \"r25\", \"r26\", \"r27\", \"r28\", \"sp\", \"r30\", \"ra\",\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Output a nicely formatted line with an opcode and operands.\r\nlocal function putop(ctx, text, operands)\r\n  local pos = ctx.pos\r\n  local extra = \"\"\r\n  if ctx.rel then\r\n    local sym = ctx.symtab[ctx.rel]\r\n    if sym then extra = \"\\t->\"..sym end\r\n  end\r\n  if ctx.hexdump > 0 then\r\n    ctx.out(format(\"%08x  %s  %-7s %s%s\\n\",\r\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\r\n  else\r\n    ctx.out(format(\"%08x  %-7s %s%s\\n\",\r\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\r\n  end\r\n  ctx.pos = pos + 4\r\nend\r\n\r\n-- Fallback for unknown opcodes.\r\nlocal function unknown(ctx)\r\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\r\nend\r\n\r\nlocal function get_be(ctx)\r\n  local pos = ctx.pos\r\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\r\n  return bor(lshift(b0, 24), lshift(b1, 16), lshift(b2, 8), b3)\r\nend\r\n\r\nlocal function get_le(ctx)\r\n  local pos = ctx.pos\r\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\r\n  return bor(lshift(b3, 24), lshift(b2, 16), lshift(b1, 8), b0)\r\nend\r\n\r\n-- Disassemble a single instruction.\r\nlocal function disass_ins(ctx)\r\n  local op = ctx:get()\r\n  local operands = {}\r\n  local last = nil\r\n  ctx.op = op\r\n  ctx.rel = nil\r\n\r\n  local opat = map_pri[rshift(op, 26)]\r\n  while type(opat) ~= \"string\" do\r\n    if not opat then return unknown(ctx) end\r\n    opat = opat[band(rshift(op, opat.shift), opat.mask)] or opat._\r\n  end\r\n  local name, pat = match(opat, \"^([a-z0-9_.]*)(.*)\")\r\n  local altname, pat2 = match(pat, \"|([a-z0-9_.|]*)(.*)\")\r\n  if altname then pat = pat2 end\r\n\r\n  for p in gmatch(pat, \".\") do\r\n    local x = nil\r\n    if p == \"S\" then\r\n      x = map_gpr[band(rshift(op, 21), 31)]\r\n    elseif p == \"T\" then\r\n      x = map_gpr[band(rshift(op, 16), 31)]\r\n    elseif p == \"D\" then\r\n      x = map_gpr[band(rshift(op, 11), 31)]\r\n    elseif p == \"F\" then\r\n      x = \"f\"..band(rshift(op, 6), 31)\r\n    elseif p == \"G\" then\r\n      x = \"f\"..band(rshift(op, 11), 31)\r\n    elseif p == \"H\" then\r\n      x = \"f\"..band(rshift(op, 16), 31)\r\n    elseif p == \"R\" then\r\n      x = \"f\"..band(rshift(op, 21), 31)\r\n    elseif p == \"A\" then\r\n      x = band(rshift(op, 6), 31)\r\n    elseif p == \"M\" then\r\n      x = band(rshift(op, 11), 31)\r\n    elseif p == \"N\" then\r\n      x = band(rshift(op, 16), 31)\r\n    elseif p == \"C\" then\r\n      x = band(rshift(op, 18), 7)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"K\" then\r\n      x = band(rshift(op, 11), 31) + 1\r\n    elseif p == \"L\" then\r\n      x = band(rshift(op, 11), 31) - last + 1\r\n    elseif p == \"I\" then\r\n      x = arshift(lshift(op, 16), 16)\r\n    elseif p == \"U\" then\r\n      x = band(op, 0xffff)\r\n    elseif p == \"O\" then\r\n      local disp = arshift(lshift(op, 16), 16)\r\n      operands[#operands] = format(\"%d(%s)\", disp, last)\r\n    elseif p == \"X\" then\r\n      local index = map_gpr[band(rshift(op, 16), 31)]\r\n      operands[#operands] = format(\"%s(%s)\", index, last)\r\n    elseif p == \"B\" then\r\n      x = ctx.addr + ctx.pos + arshift(lshift(op, 16), 16)*4 + 4\r\n      ctx.rel = x\r\n      x = \"0x\"..tohex(x)\r\n    elseif p == \"J\" then\r\n      x = band(ctx.addr + ctx.pos, 0xf0000000) + band(op, 0x03ffffff)*4\r\n      ctx.rel = x\r\n      x = \"0x\"..tohex(x)\r\n    elseif p == \"V\" then\r\n      x = band(rshift(op, 8), 7)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"W\" then\r\n      x = band(op, 7)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"Y\" then\r\n      x = band(rshift(op, 6), 0x000fffff)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"Z\" then\r\n      x = band(rshift(op, 6), 1023)\r\n      if x == 0 then x = nil end\r\n    elseif p == \"0\" then\r\n      if last == \"r0\" or last == 0 then\r\n\tlocal n = #operands\r\n\toperands[n] = nil\r\n\tlast = operands[n-1]\r\n\tif altname then\r\n\t  local a1, a2 = match(altname, \"([^|]*)|(.*)\")\r\n\t  if a1 then name, altname = a1, a2\r\n\t  else name = altname end\r\n\tend\r\n      end\r\n    elseif p == \"1\" then\r\n      if last == \"ra\" then\r\n\toperands[#operands] = nil\r\n      end\r\n    else\r\n      assert(false)\r\n    end\r\n    if x then operands[#operands+1] = x; last = x end\r\n  end\r\n\r\n  return putop(ctx, name, operands)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Disassemble a block of code.\r\nlocal function disass_block(ctx, ofs, len)\r\n  if not ofs then ofs = 0 end\r\n  local stop = len and ofs+len or #ctx.code\r\n  stop = stop - stop % 4\r\n  ctx.pos = ofs - ofs % 4\r\n  ctx.rel = nil\r\n  while ctx.pos < stop do disass_ins(ctx) end\r\nend\r\n\r\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\r\nlocal function create(code, addr, out)\r\n  local ctx = {}\r\n  ctx.code = code\r\n  ctx.addr = addr or 0\r\n  ctx.out = out or io.write\r\n  ctx.symtab = {}\r\n  ctx.disass = disass_block\r\n  ctx.hexdump = 8\r\n  ctx.get = get_be\r\n  return ctx\r\nend\r\n\r\nlocal function create_el(code, addr, out)\r\n  local ctx = create(code, addr, out)\r\n  ctx.get = get_le\r\n  return ctx\r\nend\r\n\r\n-- Simple API: disassemble code (a string) at address and output via out.\r\nlocal function disass(code, addr, out)\r\n  create(code, addr, out):disass()\r\nend\r\n\r\nlocal function disass_el(code, addr, out)\r\n  create_el(code, addr, out):disass()\r\nend\r\n\r\n-- Return register name for RID.\r\nlocal function regname(r)\r\n  if r < 32 then return map_gpr[r] end\r\n  return \"f\"..(r-32)\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  create = create,\r\n  create_el = create_el,\r\n  disass = disass,\r\n  disass_el = disass_el,\r\n  regname = regname\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_mipsel.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT MIPSEL disassembler wrapper module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This module just exports the little-endian functions from the\r\n-- MIPS disassembler module. All the interesting stuff is there.\r\n------------------------------------------------------------------------------\r\n\r\nlocal dis_mips = require((string.match(..., \".*%.\") or \"\")..\"dis_mips\")\r\nreturn {\r\n  create = dis_mips.create_el,\r\n  disass = dis_mips.disass_el,\r\n  regname = dis_mips.regname\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_ppc.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT PPC disassembler module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT/X license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This is a helper module used by the LuaJIT machine code dumper module.\r\n--\r\n-- It disassembles all common, non-privileged 32/64 bit PowerPC instructions\r\n-- plus the e500 SPE instructions and some Cell/Xenon extensions.\r\n--\r\n-- NYI: VMX, VMX128\r\n------------------------------------------------------------------------------\r\n\r\nlocal type = type\r\nlocal sub, byte, format = string.sub, string.byte, string.format\r\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\r\nlocal concat = table.concat\r\nlocal bit = require(\"bit\")\r\nlocal band, bor, tohex = bit.band, bit.bor, bit.tohex\r\nlocal lshift, rshift, arshift = bit.lshift, bit.rshift, bit.arshift\r\n\r\n------------------------------------------------------------------------------\r\n-- Primary and extended opcode maps\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_crops = {\r\n  shift = 1, mask = 1023,\r\n  [0] = \"mcrfXX\",\r\n  [33] = \"crnor|crnotCCC=\", [129] = \"crandcCCC\",\r\n  [193] = \"crxor|crclrCCC%\", [225] = \"crnandCCC\",\r\n  [257] = \"crandCCC\", [289] = \"creqv|crsetCCC%\",\r\n  [417] = \"crorcCCC\", [449] = \"cror|crmoveCCC=\",\r\n  [16] = \"b_lrKB\", [528] = \"b_ctrKB\",\r\n  [150] = \"isync\",\r\n}\r\n\r\nlocal map_rlwinm = setmetatable({\r\n  shift = 0, mask = -1,\r\n},\r\n{ __index = function(t, x)\r\n    local rot = band(rshift(x, 11), 31)\r\n    local mb = band(rshift(x, 6), 31)\r\n    local me = band(rshift(x, 1), 31)\r\n    if mb == 0 and me == 31-rot then\r\n      return \"slwiRR~A.\"\r\n    elseif me == 31 and mb == 32-rot then\r\n      return \"srwiRR~-A.\"\r\n    else\r\n      return \"rlwinmRR~AAA.\"\r\n    end\r\n  end\r\n})\r\n\r\nlocal map_rld = {\r\n  shift = 2, mask = 7,\r\n  [0] = \"rldiclRR~HM.\", \"rldicrRR~HM.\", \"rldicRR~HM.\", \"rldimiRR~HM.\",\r\n  {\r\n    shift = 1, mask = 1,\r\n    [0] = \"rldclRR~RM.\", \"rldcrRR~RM.\",\r\n  },\r\n}\r\n\r\nlocal map_ext = setmetatable({\r\n  shift = 1, mask = 1023,\r\n\r\n  [0] = \"cmp_YLRR\", [32] = \"cmpl_YLRR\",\r\n  [4] = \"twARR\", [68] = \"tdARR\",\r\n\r\n  [8] = \"subfcRRR.\", [40] = \"subfRRR.\",\r\n  [104] = \"negRR.\", [136] = \"subfeRRR.\",\r\n  [200] = \"subfzeRR.\", [232] = \"subfmeRR.\",\r\n  [520] = \"subfcoRRR.\", [552] = \"subfoRRR.\",\r\n  [616] = \"negoRR.\", [648] = \"subfeoRRR.\",\r\n  [712] = \"subfzeoRR.\", [744] = \"subfmeoRR.\",\r\n\r\n  [9] = \"mulhduRRR.\", [73] = \"mulhdRRR.\", [233] = \"mulldRRR.\",\r\n  [457] = \"divduRRR.\", [489] = \"divdRRR.\",\r\n  [745] = \"mulldoRRR.\",\r\n  [969] = \"divduoRRR.\", [1001] = \"divdoRRR.\",\r\n\r\n  [10] = \"addcRRR.\", [138] = \"addeRRR.\",\r\n  [202] = \"addzeRR.\", [234] = \"addmeRR.\", [266] = \"addRRR.\",\r\n  [522] = \"addcoRRR.\", [650] = \"addeoRRR.\",\r\n  [714] = \"addzeoRR.\", [746] = \"addmeoRR.\", [778] = \"addoRRR.\",\r\n\r\n  [11] = \"mulhwuRRR.\", [75] = \"mulhwRRR.\", [235] = \"mullwRRR.\",\r\n  [459] = \"divwuRRR.\", [491] = \"divwRRR.\",\r\n  [747] = \"mullwoRRR.\",\r\n  [971] = \"divwouRRR.\", [1003] = \"divwoRRR.\",\r\n\r\n  [15] = \"iselltRRR\", [47] = \"iselgtRRR\", [79] = \"iseleqRRR\",\r\n\r\n  [144] = { shift = 20, mask = 1, [0] = \"mtcrfRZ~\", \"mtocrfRZ~\", },\r\n  [19] = { shift = 20, mask = 1, [0] = \"mfcrR\", \"mfocrfRZ\", },\r\n  [371] = { shift = 11, mask = 1023, [392] = \"mftbR\", [424] = \"mftbuR\", },\r\n  [339] = {\r\n    shift = 11, mask = 1023,\r\n    [32] = \"mferR\", [256] = \"mflrR\", [288] = \"mfctrR\", [16] = \"mfspefscrR\",\r\n  },\r\n  [467] = {\r\n    shift = 11, mask = 1023,\r\n    [32] = \"mtxerR\", [256] = \"mtlrR\", [288] = \"mtctrR\", [16] = \"mtspefscrR\",\r\n  },\r\n\r\n  [20] = \"lwarxRR0R\", [84] = \"ldarxRR0R\",\r\n\r\n  [21] = \"ldxRR0R\", [53] = \"lduxRRR\",\r\n  [149] = \"stdxRR0R\", [181] = \"stduxRRR\",\r\n  [341] = \"lwaxRR0R\", [373] = \"lwauxRRR\",\r\n\r\n  [23] = \"lwzxRR0R\", [55] = \"lwzuxRRR\",\r\n  [87] = \"lbzxRR0R\", [119] = \"lbzuxRRR\",\r\n  [151] = \"stwxRR0R\", [183] = \"stwuxRRR\",\r\n  [215] = \"stbxRR0R\", [247] = \"stbuxRRR\",\r\n  [279] = \"lhzxRR0R\", [311] = \"lhzuxRRR\",\r\n  [343] = \"lhaxRR0R\", [375] = \"lhauxRRR\",\r\n  [407] = \"sthxRR0R\", [439] = \"sthuxRRR\",\r\n\r\n  [54] = \"dcbst-R0R\", [86] = \"dcbf-R0R\",\r\n  [150] = \"stwcxRR0R.\", [214] = \"stdcxRR0R.\",\r\n  [246] = \"dcbtst-R0R\", [278] = \"dcbt-R0R\",\r\n  [310] = \"eciwxRR0R\", [438] = \"ecowxRR0R\",\r\n  [470] = \"dcbi-RR\",\r\n\r\n  [598] = {\r\n    shift = 21, mask = 3,\r\n    [0] = \"sync\", \"lwsync\", \"ptesync\",\r\n  },\r\n  [758] = \"dcba-RR\",\r\n  [854] = \"eieio\", [982] = \"icbi-R0R\", [1014] = \"dcbz-R0R\",\r\n\r\n  [26] = \"cntlzwRR~\", [58] = \"cntlzdRR~\",\r\n  [122] = \"popcntbRR~\",\r\n  [154] = \"prtywRR~\", [186] = \"prtydRR~\",\r\n\r\n  [28] = \"andRR~R.\", [60] = \"andcRR~R.\", [124] = \"nor|notRR~R=.\",\r\n  [284] = \"eqvRR~R.\", [316] = \"xorRR~R.\",\r\n  [412] = \"orcRR~R.\", [444] = \"or|mrRR~R=.\", [476] = \"nandRR~R.\",\r\n  [508] = \"cmpbRR~R\",\r\n\r\n  [512] = \"mcrxrX\",\r\n\r\n  [532] = \"ldbrxRR0R\", [660] = \"stdbrxRR0R\",\r\n\r\n  [533] = \"lswxRR0R\", [597] = \"lswiRR0A\",\r\n  [661] = \"stswxRR0R\", [725] = \"stswiRR0A\",\r\n\r\n  [534] = \"lwbrxRR0R\", [662] = \"stwbrxRR0R\",\r\n  [790] = \"lhbrxRR0R\", [918] = \"sthbrxRR0R\",\r\n\r\n  [535] = \"lfsxFR0R\", [567] = \"lfsuxFRR\",\r\n  [599] = \"lfdxFR0R\", [631] = \"lfduxFRR\",\r\n  [663] = \"stfsxFR0R\", [695] = \"stfsuxFRR\",\r\n  [727] = \"stfdxFR0R\", [759] = \"stfduxFR0R\",\r\n  [855] = \"lfiwaxFR0R\",\r\n  [983] = \"stfiwxFR0R\",\r\n\r\n  [24] = \"slwRR~R.\",\r\n\r\n  [27] = \"sldRR~R.\", [536] = \"srwRR~R.\",\r\n  [792] = \"srawRR~R.\", [824] = \"srawiRR~A.\",\r\n\r\n  [794] = \"sradRR~R.\", [826] = \"sradiRR~H.\", [827] = \"sradiRR~H.\",\r\n  [922] = \"extshRR~.\", [954] = \"extsbRR~.\", [986] = \"extswRR~.\",\r\n\r\n  [539] = \"srdRR~R.\",\r\n},\r\n{ __index = function(t, x)\r\n    if band(x, 31) == 15 then return \"iselRRRC\" end\r\n  end\r\n})\r\n\r\nlocal map_ld = {\r\n  shift = 0, mask = 3,\r\n  [0] = \"ldRRE\", \"lduRRE\", \"lwaRRE\",\r\n}\r\n\r\nlocal map_std = {\r\n  shift = 0, mask = 3,\r\n  [0] = \"stdRRE\", \"stduRRE\",\r\n}\r\n\r\nlocal map_fps = {\r\n  shift = 5, mask = 1,\r\n  {\r\n    shift = 1, mask = 15,\r\n    [0] = false, false, \"fdivsFFF.\", false,\r\n    \"fsubsFFF.\", \"faddsFFF.\", \"fsqrtsF-F.\", false,\r\n    \"fresF-F.\", \"fmulsFF-F.\", \"frsqrtesF-F.\", false,\r\n    \"fmsubsFFFF~.\", \"fmaddsFFFF~.\", \"fnmsubsFFFF~.\", \"fnmaddsFFFF~.\",\r\n  }\r\n}\r\n\r\nlocal map_fpd = {\r\n  shift = 5, mask = 1,\r\n  [0] = {\r\n    shift = 1, mask = 1023,\r\n    [0] = \"fcmpuXFF\", [32] = \"fcmpoXFF\", [64] = \"mcrfsXX\",\r\n    [38] = \"mtfsb1A.\", [70] = \"mtfsb0A.\", [134] = \"mtfsfiA>>-A>\",\r\n    [8] = \"fcpsgnFFF.\", [40] = \"fnegF-F.\", [72] = \"fmrF-F.\",\r\n    [136] = \"fnabsF-F.\", [264] = \"fabsF-F.\",\r\n    [12] = \"frspF-F.\",\r\n    [14] = \"fctiwF-F.\", [15] = \"fctiwzF-F.\",\r\n    [583] = \"mffsF.\", [711] = \"mtfsfZF.\",\r\n    [392] = \"frinF-F.\", [424] = \"frizF-F.\",\r\n    [456] = \"fripF-F.\", [488] = \"frimF-F.\",\r\n    [814] = \"fctidF-F.\", [815] = \"fctidzF-F.\", [846] = \"fcfidF-F.\",\r\n  },\r\n  {\r\n    shift = 1, mask = 15,\r\n    [0] = false, false, \"fdivFFF.\", false,\r\n    \"fsubFFF.\", \"faddFFF.\", \"fsqrtF-F.\", \"fselFFFF~.\",\r\n    \"freF-F.\", \"fmulFF-F.\", \"frsqrteF-F.\", false,\r\n    \"fmsubFFFF~.\", \"fmaddFFFF~.\", \"fnmsubFFFF~.\", \"fnmaddFFFF~.\",\r\n  }\r\n}\r\n\r\nlocal map_spe = {\r\n  shift = 0, mask = 2047,\r\n\r\n  [512] = \"evaddwRRR\", [514] = \"evaddiwRAR~\",\r\n  [516] = \"evsubwRRR~\", [518] = \"evsubiwRAR~\",\r\n  [520] = \"evabsRR\", [521] = \"evnegRR\",\r\n  [522] = \"evextsbRR\", [523] = \"evextshRR\", [524] = \"evrndwRR\",\r\n  [525] = \"evcntlzwRR\", [526] = \"evcntlswRR\",\r\n\r\n  [527] = \"brincRRR\",\r\n\r\n  [529] = \"evandRRR\", [530] = \"evandcRRR\", [534] = \"evxorRRR\",\r\n  [535] = \"evor|evmrRRR=\", [536] = \"evnor|evnotRRR=\",\r\n  [537] = \"eveqvRRR\", [539] = \"evorcRRR\", [542] = \"evnandRRR\",\r\n\r\n  [544] = \"evsrwuRRR\", [545] = \"evsrwsRRR\",\r\n  [546] = \"evsrwiuRRA\", [547] = \"evsrwisRRA\",\r\n  [548] = \"evslwRRR\", [550] = \"evslwiRRA\",\r\n  [552] = \"evrlwRRR\", [553] = \"evsplatiRS\",\r\n  [554] = \"evrlwiRRA\", [555] = \"evsplatfiRS\",\r\n  [556] = \"evmergehiRRR\", [557] = \"evmergeloRRR\",\r\n  [558] = \"evmergehiloRRR\", [559] = \"evmergelohiRRR\",\r\n\r\n  [560] = \"evcmpgtuYRR\", [561] = \"evcmpgtsYRR\",\r\n  [562] = \"evcmpltuYRR\", [563] = \"evcmpltsYRR\",\r\n  [564] = \"evcmpeqYRR\",\r\n\r\n  [632] = \"evselRRR\", [633] = \"evselRRRW\",\r\n  [634] = \"evselRRRW\", [635] = \"evselRRRW\",\r\n  [636] = \"evselRRRW\", [637] = \"evselRRRW\",\r\n  [638] = \"evselRRRW\", [639] = \"evselRRRW\",\r\n\r\n  [640] = \"evfsaddRRR\", [641] = \"evfssubRRR\",\r\n  [644] = \"evfsabsRR\", [645] = \"evfsnabsRR\", [646] = \"evfsnegRR\",\r\n  [648] = \"evfsmulRRR\", [649] = \"evfsdivRRR\",\r\n  [652] = \"evfscmpgtYRR\", [653] = \"evfscmpltYRR\", [654] = \"evfscmpeqYRR\",\r\n  [656] = \"evfscfuiR-R\", [657] = \"evfscfsiR-R\",\r\n  [658] = \"evfscfufR-R\", [659] = \"evfscfsfR-R\",\r\n  [660] = \"evfsctuiR-R\", [661] = \"evfsctsiR-R\",\r\n  [662] = \"evfsctufR-R\", [663] = \"evfsctsfR-R\",\r\n  [664] = \"evfsctuizR-R\", [666] = \"evfsctsizR-R\",\r\n  [668] = \"evfststgtYRR\", [669] = \"evfststltYRR\", [670] = \"evfststeqYRR\",\r\n\r\n  [704] = \"efsaddRRR\", [705] = \"efssubRRR\",\r\n  [708] = \"efsabsRR\", [709] = \"efsnabsRR\", [710] = \"efsnegRR\",\r\n  [712] = \"efsmulRRR\", [713] = \"efsdivRRR\",\r\n  [716] = \"efscmpgtYRR\", [717] = \"efscmpltYRR\", [718] = \"efscmpeqYRR\",\r\n  [719] = \"efscfdR-R\",\r\n  [720] = \"efscfuiR-R\", [721] = \"efscfsiR-R\",\r\n  [722] = \"efscfufR-R\", [723] = \"efscfsfR-R\",\r\n  [724] = \"efsctuiR-R\", [725] = \"efsctsiR-R\",\r\n  [726] = \"efsctufR-R\", [727] = \"efsctsfR-R\",\r\n  [728] = \"efsctuizR-R\", [730] = \"efsctsizR-R\",\r\n  [732] = \"efststgtYRR\", [733] = \"efststltYRR\", [734] = \"efststeqYRR\",\r\n\r\n  [736] = \"efdaddRRR\", [737] = \"efdsubRRR\",\r\n  [738] = \"efdcfuidR-R\", [739] = \"efdcfsidR-R\",\r\n  [740] = \"efdabsRR\", [741] = \"efdnabsRR\", [742] = \"efdnegRR\",\r\n  [744] = \"efdmulRRR\", [745] = \"efddivRRR\",\r\n  [746] = \"efdctuidzR-R\", [747] = \"efdctsidzR-R\",\r\n  [748] = \"efdcmpgtYRR\", [749] = \"efdcmpltYRR\", [750] = \"efdcmpeqYRR\",\r\n  [751] = \"efdcfsR-R\",\r\n  [752] = \"efdcfuiR-R\", [753] = \"efdcfsiR-R\",\r\n  [754] = \"efdcfufR-R\", [755] = \"efdcfsfR-R\",\r\n  [756] = \"efdctuiR-R\", [757] = \"efdctsiR-R\",\r\n  [758] = \"efdctufR-R\", [759] = \"efdctsfR-R\",\r\n  [760] = \"efdctuizR-R\", [762] = \"efdctsizR-R\",\r\n  [764] = \"efdtstgtYRR\", [765] = \"efdtstltYRR\", [766] = \"efdtsteqYRR\",\r\n\r\n  [768] = \"evlddxRR0R\", [769] = \"evlddRR8\",\r\n  [770] = \"evldwxRR0R\", [771] = \"evldwRR8\",\r\n  [772] = \"evldhxRR0R\", [773] = \"evldhRR8\",\r\n  [776] = \"evlhhesplatxRR0R\", [777] = \"evlhhesplatRR2\",\r\n  [780] = \"evlhhousplatxRR0R\", [781] = \"evlhhousplatRR2\",\r\n  [782] = \"evlhhossplatxRR0R\", [783] = \"evlhhossplatRR2\",\r\n  [784] = \"evlwhexRR0R\", [785] = \"evlwheRR4\",\r\n  [788] = \"evlwhouxRR0R\", [789] = \"evlwhouRR4\",\r\n  [790] = \"evlwhosxRR0R\", [791] = \"evlwhosRR4\",\r\n  [792] = \"evlwwsplatxRR0R\", [793] = \"evlwwsplatRR4\",\r\n  [796] = \"evlwhsplatxRR0R\", [797] = \"evlwhsplatRR4\",\r\n\r\n  [800] = \"evstddxRR0R\", [801] = \"evstddRR8\",\r\n  [802] = \"evstdwxRR0R\", [803] = \"evstdwRR8\",\r\n  [804] = \"evstdhxRR0R\", [805] = \"evstdhRR8\",\r\n  [816] = \"evstwhexRR0R\", [817] = \"evstwheRR4\",\r\n  [820] = \"evstwhoxRR0R\", [821] = \"evstwhoRR4\",\r\n  [824] = \"evstwwexRR0R\", [825] = \"evstwweRR4\",\r\n  [828] = \"evstwwoxRR0R\", [829] = \"evstwwoRR4\",\r\n\r\n  [1027] = \"evmhessfRRR\", [1031] = \"evmhossfRRR\", [1032] = \"evmheumiRRR\",\r\n  [1033] = \"evmhesmiRRR\", [1035] = \"evmhesmfRRR\", [1036] = \"evmhoumiRRR\",\r\n  [1037] = \"evmhosmiRRR\", [1039] = \"evmhosmfRRR\", [1059] = \"evmhessfaRRR\",\r\n  [1063] = \"evmhossfaRRR\", [1064] = \"evmheumiaRRR\", [1065] = \"evmhesmiaRRR\",\r\n  [1067] = \"evmhesmfaRRR\", [1068] = \"evmhoumiaRRR\", [1069] = \"evmhosmiaRRR\",\r\n  [1071] = \"evmhosmfaRRR\", [1095] = \"evmwhssfRRR\", [1096] = \"evmwlumiRRR\",\r\n  [1100] = \"evmwhumiRRR\", [1101] = \"evmwhsmiRRR\", [1103] = \"evmwhsmfRRR\",\r\n  [1107] = \"evmwssfRRR\", [1112] = \"evmwumiRRR\", [1113] = \"evmwsmiRRR\",\r\n  [1115] = \"evmwsmfRRR\", [1127] = \"evmwhssfaRRR\", [1128] = \"evmwlumiaRRR\",\r\n  [1132] = \"evmwhumiaRRR\", [1133] = \"evmwhsmiaRRR\", [1135] = \"evmwhsmfaRRR\",\r\n  [1139] = \"evmwssfaRRR\", [1144] = \"evmwumiaRRR\", [1145] = \"evmwsmiaRRR\",\r\n  [1147] = \"evmwsmfaRRR\",\r\n\r\n  [1216] = \"evaddusiaawRR\", [1217] = \"evaddssiaawRR\",\r\n  [1218] = \"evsubfusiaawRR\", [1219] = \"evsubfssiaawRR\",\r\n  [1220] = \"evmraRR\",\r\n  [1222] = \"evdivwsRRR\", [1223] = \"evdivwuRRR\",\r\n  [1224] = \"evaddumiaawRR\", [1225] = \"evaddsmiaawRR\",\r\n  [1226] = \"evsubfumiaawRR\", [1227] = \"evsubfsmiaawRR\",\r\n\r\n  [1280] = \"evmheusiaawRRR\", [1281] = \"evmhessiaawRRR\",\r\n  [1283] = \"evmhessfaawRRR\", [1284] = \"evmhousiaawRRR\",\r\n  [1285] = \"evmhossiaawRRR\", [1287] = \"evmhossfaawRRR\",\r\n  [1288] = \"evmheumiaawRRR\", [1289] = \"evmhesmiaawRRR\",\r\n  [1291] = \"evmhesmfaawRRR\", [1292] = \"evmhoumiaawRRR\",\r\n  [1293] = \"evmhosmiaawRRR\", [1295] = \"evmhosmfaawRRR\",\r\n  [1320] = \"evmhegumiaaRRR\", [1321] = \"evmhegsmiaaRRR\",\r\n  [1323] = \"evmhegsmfaaRRR\", [1324] = \"evmhogumiaaRRR\",\r\n  [1325] = \"evmhogsmiaaRRR\", [1327] = \"evmhogsmfaaRRR\",\r\n  [1344] = \"evmwlusiaawRRR\", [1345] = \"evmwlssiaawRRR\",\r\n  [1352] = \"evmwlumiaawRRR\", [1353] = \"evmwlsmiaawRRR\",\r\n  [1363] = \"evmwssfaaRRR\", [1368] = \"evmwumiaaRRR\",\r\n  [1369] = \"evmwsmiaaRRR\", [1371] = \"evmwsmfaaRRR\",\r\n  [1408] = \"evmheusianwRRR\", [1409] = \"evmhessianwRRR\",\r\n  [1411] = \"evmhessfanwRRR\", [1412] = \"evmhousianwRRR\",\r\n  [1413] = \"evmhossianwRRR\", [1415] = \"evmhossfanwRRR\",\r\n  [1416] = \"evmheumianwRRR\", [1417] = \"evmhesmianwRRR\",\r\n  [1419] = \"evmhesmfanwRRR\", [1420] = \"evmhoumianwRRR\",\r\n  [1421] = \"evmhosmianwRRR\", [1423] = \"evmhosmfanwRRR\",\r\n  [1448] = \"evmhegumianRRR\", [1449] = \"evmhegsmianRRR\",\r\n  [1451] = \"evmhegsmfanRRR\", [1452] = \"evmhogumianRRR\",\r\n  [1453] = \"evmhogsmianRRR\", [1455] = \"evmhogsmfanRRR\",\r\n  [1472] = \"evmwlusianwRRR\", [1473] = \"evmwlssianwRRR\",\r\n  [1480] = \"evmwlumianwRRR\", [1481] = \"evmwlsmianwRRR\",\r\n  [1491] = \"evmwssfanRRR\", [1496] = \"evmwumianRRR\",\r\n  [1497] = \"evmwsmianRRR\", [1499] = \"evmwsmfanRRR\",\r\n}\r\n\r\nlocal map_pri = {\r\n  [0] = false,\tfalse,\t\t\"tdiARI\",\t\"twiARI\",\r\n  map_spe,\tfalse,\t\tfalse,\t\t\"mulliRRI\",\r\n  \"subficRRI\",\tfalse,\t\t\"cmpl_iYLRU\",\t\"cmp_iYLRI\",\r\n  \"addicRRI\",\t\"addic.RRI\",\t\"addi|liRR0I\",\t\"addis|lisRR0I\",\r\n  \"b_KBJ\",\t\"sc\",\t\t \"bKJ\",\t\tmap_crops,\r\n  \"rlwimiRR~AAA.\", map_rlwinm,\tfalse,\t\t\"rlwnmRR~RAA.\",\r\n  \"oriNRR~U\",\t\"orisRR~U\",\t\"xoriRR~U\",\t\"xorisRR~U\",\r\n  \"andi.RR~U\",\t\"andis.RR~U\",\tmap_rld,\tmap_ext,\r\n  \"lwzRRD\",\t\"lwzuRRD\",\t\"lbzRRD\",\t\"lbzuRRD\",\r\n  \"stwRRD\",\t\"stwuRRD\",\t\"stbRRD\",\t\"stbuRRD\",\r\n  \"lhzRRD\",\t\"lhzuRRD\",\t\"lhaRRD\",\t\"lhauRRD\",\r\n  \"sthRRD\",\t\"sthuRRD\",\t\"lmwRRD\",\t\"stmwRRD\",\r\n  \"lfsFRD\",\t\"lfsuFRD\",\t\"lfdFRD\",\t\"lfduFRD\",\r\n  \"stfsFRD\",\t\"stfsuFRD\",\t\"stfdFRD\",\t\"stfduFRD\",\r\n  false,\tfalse,\t\tmap_ld,\t\tmap_fps,\r\n  false,\tfalse,\t\tmap_std,\tmap_fpd,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal map_gpr = {\r\n  [0] = \"r0\", \"sp\", \"r2\", \"r3\", \"r4\", \"r5\", \"r6\", \"r7\",\r\n  \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\",\r\n  \"r16\", \"r17\", \"r18\", \"r19\", \"r20\", \"r21\", \"r22\", \"r23\",\r\n  \"r24\", \"r25\", \"r26\", \"r27\", \"r28\", \"r29\", \"r30\", \"r31\",\r\n}\r\n\r\nlocal map_cond = { [0] = \"lt\", \"gt\", \"eq\", \"so\", \"ge\", \"le\", \"ne\", \"ns\", }\r\n\r\n-- Format a condition bit.\r\nlocal function condfmt(cond)\r\n  if cond <= 3 then\r\n    return map_cond[band(cond, 3)]\r\n  else\r\n    return format(\"4*cr%d+%s\", rshift(cond, 2), map_cond[band(cond, 3)])\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Output a nicely formatted line with an opcode and operands.\r\nlocal function putop(ctx, text, operands)\r\n  local pos = ctx.pos\r\n  local extra = \"\"\r\n  if ctx.rel then\r\n    local sym = ctx.symtab[ctx.rel]\r\n    if sym then extra = \"\\t->\"..sym end\r\n  end\r\n  if ctx.hexdump > 0 then\r\n    ctx.out(format(\"%08x  %s  %-7s %s%s\\n\",\r\n\t    ctx.addr+pos, tohex(ctx.op), text, concat(operands, \", \"), extra))\r\n  else\r\n    ctx.out(format(\"%08x  %-7s %s%s\\n\",\r\n\t    ctx.addr+pos, text, concat(operands, \", \"), extra))\r\n  end\r\n  ctx.pos = pos + 4\r\nend\r\n\r\n-- Fallback for unknown opcodes.\r\nlocal function unknown(ctx)\r\n  return putop(ctx, \".long\", { \"0x\"..tohex(ctx.op) })\r\nend\r\n\r\n-- Disassemble a single instruction.\r\nlocal function disass_ins(ctx)\r\n  local pos = ctx.pos\r\n  local b0, b1, b2, b3 = byte(ctx.code, pos+1, pos+4)\r\n  local op = bor(lshift(b0, 24), lshift(b1, 16), lshift(b2, 8), b3)\r\n  local operands = {}\r\n  local last = nil\r\n  local rs = 21\r\n  ctx.op = op\r\n  ctx.rel = nil\r\n\r\n  local opat = map_pri[rshift(b0, 2)]\r\n  while type(opat) ~= \"string\" do\r\n    if not opat then return unknown(ctx) end\r\n    opat = opat[band(rshift(op, opat.shift), opat.mask)]\r\n  end\r\n  local name, pat = match(opat, \"^([a-z0-9_.]*)(.*)\")\r\n  local altname, pat2 = match(pat, \"|([a-z0-9_.]*)(.*)\")\r\n  if altname then pat = pat2 end\r\n\r\n  for p in gmatch(pat, \".\") do\r\n    local x = nil\r\n    if p == \"R\" then\r\n      x = map_gpr[band(rshift(op, rs), 31)]\r\n      rs = rs - 5\r\n    elseif p == \"F\" then\r\n      x = \"f\"..band(rshift(op, rs), 31)\r\n      rs = rs - 5\r\n    elseif p == \"A\" then\r\n      x = band(rshift(op, rs), 31)\r\n      rs = rs - 5\r\n    elseif p == \"S\" then\r\n      x = arshift(lshift(op, 27-rs), 27)\r\n      rs = rs - 5\r\n    elseif p == \"I\" then\r\n      x = arshift(lshift(op, 16), 16)\r\n    elseif p == \"U\" then\r\n      x = band(op, 0xffff)\r\n    elseif p == \"D\" or p == \"E\" then\r\n      local disp = arshift(lshift(op, 16), 16)\r\n      if p == \"E\" then disp = band(disp, -4) end\r\n      if last == \"r0\" then last = \"0\" end\r\n      operands[#operands] = format(\"%d(%s)\", disp, last)\r\n    elseif p >= \"2\" and p <= \"8\" then\r\n      local disp = band(rshift(op, rs), 31) * p\r\n      if last == \"r0\" then last = \"0\" end\r\n      operands[#operands] = format(\"%d(%s)\", disp, last)\r\n    elseif p == \"H\" then\r\n      x = band(rshift(op, rs), 31) + lshift(band(op, 2), 4)\r\n      rs = rs - 5\r\n    elseif p == \"M\" then\r\n      x = band(rshift(op, rs), 31) + band(op, 0x20)\r\n    elseif p == \"C\" then\r\n      x = condfmt(band(rshift(op, rs), 31))\r\n      rs = rs - 5\r\n    elseif p == \"B\" then\r\n      local bo = rshift(op, 21)\r\n      local cond = band(rshift(op, 16), 31)\r\n      local cn = \"\"\r\n      rs = rs - 10\r\n      if band(bo, 4) == 0 then\r\n\tcn = band(bo, 2) == 0 and \"dnz\" or \"dz\"\r\n\tif band(bo, 0x10) == 0 then\r\n\t  cn = cn..(band(bo, 8) == 0 and \"f\" or \"t\")\r\n\tend\r\n\tif band(bo, 0x10) == 0 then x = condfmt(cond) end\r\n\tname = name..(band(bo, 1) == band(rshift(op, 15), 1) and \"-\" or \"+\")\r\n      elseif band(bo, 0x10) == 0 then\r\n\tcn = map_cond[band(cond, 3) + (band(bo, 8) == 0 and 4 or 0)]\r\n\tif cond > 3 then x = \"cr\"..rshift(cond, 2) end\r\n\tname = name..(band(bo, 1) == band(rshift(op, 15), 1) and \"-\" or \"+\")\r\n      end\r\n      name = gsub(name, \"_\", cn)\r\n    elseif p == \"J\" then\r\n      x = arshift(lshift(op, 27-rs), 29-rs)*4\r\n      if band(op, 2) == 0 then x = ctx.addr + pos + x end\r\n      ctx.rel = x\r\n      x = \"0x\"..tohex(x)\r\n    elseif p == \"K\" then\r\n      if band(op, 1) ~= 0 then name = name..\"l\" end\r\n      if band(op, 2) ~= 0 then name = name..\"a\" end\r\n    elseif p == \"X\" or p == \"Y\" then\r\n      x = band(rshift(op, rs+2), 7)\r\n      if x == 0 and p == \"Y\" then x = nil else x = \"cr\"..x end\r\n      rs = rs - 5\r\n    elseif p == \"W\" then\r\n      x = \"cr\"..band(op, 7)\r\n    elseif p == \"Z\" then\r\n      x = band(rshift(op, rs-4), 255)\r\n      rs = rs - 10\r\n    elseif p == \">\" then\r\n      operands[#operands] = rshift(operands[#operands], 1)\r\n    elseif p == \"0\" then\r\n      if last == \"r0\" then\r\n\toperands[#operands] = nil\r\n\tif altname then name = altname end\r\n      end\r\n    elseif p == \"L\" then\r\n      name = gsub(name, \"_\", band(op, 0x00200000) ~= 0 and \"d\" or \"w\")\r\n    elseif p == \".\" then\r\n      if band(op, 1) == 1 then name = name..\".\" end\r\n    elseif p == \"N\" then\r\n      if op == 0x60000000 then name = \"nop\"; break end\r\n    elseif p == \"~\" then\r\n      local n = #operands\r\n      operands[n-1],  operands[n] = operands[n], operands[n-1]\r\n    elseif p == \"=\" then\r\n      local n = #operands\r\n      if last == operands[n-1] then\r\n\toperands[n] = nil\r\n\tname = altname\r\n      end\r\n    elseif p == \"%\" then\r\n      local n = #operands\r\n      if last == operands[n-1] and last == operands[n-2] then\r\n\toperands[n] = nil\r\n\toperands[n-1] = nil\r\n\tname = altname\r\n      end\r\n    elseif p == \"-\" then\r\n      rs = rs - 5\r\n    else\r\n      assert(false)\r\n    end\r\n    if x then operands[#operands+1] = x; last = x end\r\n  end\r\n\r\n  return putop(ctx, name, operands)\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Disassemble a block of code.\r\nlocal function disass_block(ctx, ofs, len)\r\n  if not ofs then ofs = 0 end\r\n  local stop = len and ofs+len or #ctx.code\r\n  stop = stop - stop % 4\r\n  ctx.pos = ofs - ofs % 4\r\n  ctx.rel = nil\r\n  while ctx.pos < stop do disass_ins(ctx) end\r\nend\r\n\r\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\r\nlocal function create(code, addr, out)\r\n  local ctx = {}\r\n  ctx.code = code\r\n  ctx.addr = addr or 0\r\n  ctx.out = out or io.write\r\n  ctx.symtab = {}\r\n  ctx.disass = disass_block\r\n  ctx.hexdump = 8\r\n  return ctx\r\nend\r\n\r\n-- Simple API: disassemble code (a string) at address and output via out.\r\nlocal function disass(code, addr, out)\r\n  create(code, addr, out):disass()\r\nend\r\n\r\n-- Return register name for RID.\r\nlocal function regname(r)\r\n  if r < 32 then return map_gpr[r] end\r\n  return \"f\"..(r-32)\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  create = create,\r\n  disass = disass,\r\n  regname = regname\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_x64.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT x64 disassembler wrapper module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This module just exports the 64 bit functions from the combined\r\n-- x86/x64 disassembler module. All the interesting stuff is there.\r\n------------------------------------------------------------------------------\r\n\r\nlocal dis_x86 = require((string.match(..., \".*%.\") or \"\")..\"dis_x86\")\r\nreturn {\r\n  create = dis_x86.create64,\r\n  disass = dis_x86.disass64,\r\n  regname = dis_x86.regname64\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dis_x86.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT x86/x64 disassembler module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n-- This is a helper module used by the LuaJIT machine code dumper module.\r\n--\r\n-- Sending small code snippets to an external disassembler and mixing the\r\n-- output with our own stuff was too fragile. So I had to bite the bullet\r\n-- and write yet another x86 disassembler. Oh well ...\r\n--\r\n-- The output format is very similar to what ndisasm generates. But it has\r\n-- been developed independently by looking at the opcode tables from the\r\n-- Intel and AMD manuals. The supported instruction set is quite extensive\r\n-- and reflects what a current generation Intel or AMD CPU implements in\r\n-- 32 bit and 64 bit mode. Yes, this includes MMX, SSE, SSE2, SSE3, SSSE3,\r\n-- SSE4.1, SSE4.2, SSE4a and even privileged and hypervisor (VMX/SVM)\r\n-- instructions.\r\n--\r\n-- Notes:\r\n-- * The (useless) a16 prefix, 3DNow and pre-586 opcodes are unsupported.\r\n-- * No attempt at optimization has been made -- it's fast enough for my needs.\r\n-- * The public API may change when more architectures are added.\r\n------------------------------------------------------------------------------\r\n\r\nlocal type = type\r\nlocal sub, byte, format = string.sub, string.byte, string.format\r\nlocal match, gmatch, gsub = string.match, string.gmatch, string.gsub\r\nlocal lower, rep = string.lower, string.rep\r\nlocal bit = require(\"bit\")\r\nlocal tohex = bit.tohex\r\n\r\n-- Map for 1st opcode byte in 32 bit mode. Ugly? Well ... read on.\r\nlocal map_opc1_32 = {\r\n--0x\r\n[0]=\"addBmr\",\"addVmr\",\"addBrm\",\"addVrm\",\"addBai\",\"addVai\",\"push es\",\"pop es\",\r\n\"orBmr\",\"orVmr\",\"orBrm\",\"orVrm\",\"orBai\",\"orVai\",\"push cs\",\"opc2*\",\r\n--1x\r\n\"adcBmr\",\"adcVmr\",\"adcBrm\",\"adcVrm\",\"adcBai\",\"adcVai\",\"push ss\",\"pop ss\",\r\n\"sbbBmr\",\"sbbVmr\",\"sbbBrm\",\"sbbVrm\",\"sbbBai\",\"sbbVai\",\"push ds\",\"pop ds\",\r\n--2x\r\n\"andBmr\",\"andVmr\",\"andBrm\",\"andVrm\",\"andBai\",\"andVai\",\"es:seg\",\"daa\",\r\n\"subBmr\",\"subVmr\",\"subBrm\",\"subVrm\",\"subBai\",\"subVai\",\"cs:seg\",\"das\",\r\n--3x\r\n\"xorBmr\",\"xorVmr\",\"xorBrm\",\"xorVrm\",\"xorBai\",\"xorVai\",\"ss:seg\",\"aaa\",\r\n\"cmpBmr\",\"cmpVmr\",\"cmpBrm\",\"cmpVrm\",\"cmpBai\",\"cmpVai\",\"ds:seg\",\"aas\",\r\n--4x\r\n\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\"incVR\",\r\n\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\"decVR\",\r\n--5x\r\n\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\"pushUR\",\r\n\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\"popUR\",\r\n--6x\r\n\"sz*pushaw,pusha\",\"sz*popaw,popa\",\"boundVrm\",\"arplWmr\",\r\n\"fs:seg\",\"gs:seg\",\"o16:\",\"a16\",\r\n\"pushUi\",\"imulVrmi\",\"pushBs\",\"imulVrms\",\r\n\"insb\",\"insVS\",\"outsb\",\"outsVS\",\r\n--7x\r\n\"joBj\",\"jnoBj\",\"jbBj\",\"jnbBj\",\"jzBj\",\"jnzBj\",\"jbeBj\",\"jaBj\",\r\n\"jsBj\",\"jnsBj\",\"jpeBj\",\"jpoBj\",\"jlBj\",\"jgeBj\",\"jleBj\",\"jgBj\",\r\n--8x\r\n\"arith!Bmi\",\"arith!Vmi\",\"arith!Bmi\",\"arith!Vms\",\r\n\"testBmr\",\"testVmr\",\"xchgBrm\",\"xchgVrm\",\r\n\"movBmr\",\"movVmr\",\"movBrm\",\"movVrm\",\r\n\"movVmg\",\"leaVrm\",\"movWgm\",\"popUm\",\r\n--9x\r\n\"nop*xchgVaR|pause|xchgWaR|repne nop\",\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\r\n\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\"xchgVaR\",\r\n\"sz*cbw,cwde,cdqe\",\"sz*cwd,cdq,cqo\",\"call farViw\",\"wait\",\r\n\"sz*pushfw,pushf\",\"sz*popfw,popf\",\"sahf\",\"lahf\",\r\n--Ax\r\n\"movBao\",\"movVao\",\"movBoa\",\"movVoa\",\r\n\"movsb\",\"movsVS\",\"cmpsb\",\"cmpsVS\",\r\n\"testBai\",\"testVai\",\"stosb\",\"stosVS\",\r\n\"lodsb\",\"lodsVS\",\"scasb\",\"scasVS\",\r\n--Bx\r\n\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\"movBRi\",\r\n\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\"movVRI\",\r\n--Cx\r\n\"shift!Bmu\",\"shift!Vmu\",\"retBw\",\"ret\",\"$lesVrm\",\"$ldsVrm\",\"movBmi\",\"movVmi\",\r\n\"enterBwu\",\"leave\",\"retfBw\",\"retf\",\"int3\",\"intBu\",\"into\",\"iretVS\",\r\n--Dx\r\n\"shift!Bm1\",\"shift!Vm1\",\"shift!Bmc\",\"shift!Vmc\",\"aamBu\",\"aadBu\",\"salc\",\"xlatb\",\r\n\"fp*0\",\"fp*1\",\"fp*2\",\"fp*3\",\"fp*4\",\"fp*5\",\"fp*6\",\"fp*7\",\r\n--Ex\r\n\"loopneBj\",\"loopeBj\",\"loopBj\",\"sz*jcxzBj,jecxzBj,jrcxzBj\",\r\n\"inBau\",\"inVau\",\"outBua\",\"outVua\",\r\n\"callVj\",\"jmpVj\",\"jmp farViw\",\"jmpBj\",\"inBad\",\"inVad\",\"outBda\",\"outVda\",\r\n--Fx\r\n\"lock:\",\"int1\",\"repne:rep\",\"rep:\",\"hlt\",\"cmc\",\"testb!Bm\",\"testv!Vm\",\r\n\"clc\",\"stc\",\"cli\",\"sti\",\"cld\",\"std\",\"incb!Bm\",\"incd!Vm\",\r\n}\r\nassert(#map_opc1_32 == 255)\r\n\r\n-- Map for 1st opcode byte in 64 bit mode (overrides only).\r\nlocal map_opc1_64 = setmetatable({\r\n  [0x06]=false, [0x07]=false, [0x0e]=false,\r\n  [0x16]=false, [0x17]=false, [0x1e]=false, [0x1f]=false,\r\n  [0x27]=false, [0x2f]=false, [0x37]=false, [0x3f]=false,\r\n  [0x60]=false, [0x61]=false, [0x62]=false, [0x63]=\"movsxdVrDmt\", [0x67]=\"a32:\",\r\n  [0x40]=\"rex*\",   [0x41]=\"rex*b\",   [0x42]=\"rex*x\",   [0x43]=\"rex*xb\",\r\n  [0x44]=\"rex*r\",  [0x45]=\"rex*rb\",  [0x46]=\"rex*rx\",  [0x47]=\"rex*rxb\",\r\n  [0x48]=\"rex*w\",  [0x49]=\"rex*wb\",  [0x4a]=\"rex*wx\",  [0x4b]=\"rex*wxb\",\r\n  [0x4c]=\"rex*wr\", [0x4d]=\"rex*wrb\", [0x4e]=\"rex*wrx\", [0x4f]=\"rex*wrxb\",\r\n  [0x82]=false, [0x9a]=false, [0xc4]=false, [0xc5]=false, [0xce]=false,\r\n  [0xd4]=false, [0xd5]=false, [0xd6]=false, [0xea]=false,\r\n}, { __index = map_opc1_32 })\r\n\r\n-- Map for 2nd opcode byte (0F xx). True CISC hell. Hey, I told you.\r\n-- Prefix dependent MMX/SSE opcodes: (none)|rep|o16|repne, -|F3|66|F2\r\nlocal map_opc2 = {\r\n--0x\r\n[0]=\"sldt!Dmp\",\"sgdt!Ump\",\"larVrm\",\"lslVrm\",nil,\"syscall\",\"clts\",\"sysret\",\r\n\"invd\",\"wbinvd\",nil,\"ud1\",nil,\"$prefetch!Bm\",\"femms\",\"3dnowMrmu\",\r\n--1x\r\n\"movupsXrm|movssXrm|movupdXrm|movsdXrm\",\r\n\"movupsXmr|movssXmr|movupdXmr|movsdXmr\",\r\n\"movhlpsXrm$movlpsXrm|movsldupXrm|movlpdXrm|movddupXrm\",\r\n\"movlpsXmr||movlpdXmr\",\r\n\"unpcklpsXrm||unpcklpdXrm\",\r\n\"unpckhpsXrm||unpckhpdXrm\",\r\n\"movlhpsXrm$movhpsXrm|movshdupXrm|movhpdXrm\",\r\n\"movhpsXmr||movhpdXmr\",\r\n\"$prefetcht!Bm\",\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\r\n\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\"hintnopVm\",\r\n--2x\r\n\"movUmx$\",\"movUmy$\",\"movUxm$\",\"movUym$\",\"movUmz$\",nil,\"movUzm$\",nil,\r\n\"movapsXrm||movapdXrm\",\r\n\"movapsXmr||movapdXmr\",\r\n\"cvtpi2psXrMm|cvtsi2ssXrVmt|cvtpi2pdXrMm|cvtsi2sdXrVmt\",\r\n\"movntpsXmr|movntssXmr|movntpdXmr|movntsdXmr\",\r\n\"cvttps2piMrXm|cvttss2siVrXm|cvttpd2piMrXm|cvttsd2siVrXm\",\r\n\"cvtps2piMrXm|cvtss2siVrXm|cvtpd2piMrXm|cvtsd2siVrXm\",\r\n\"ucomissXrm||ucomisdXrm\",\r\n\"comissXrm||comisdXrm\",\r\n--3x\r\n\"wrmsr\",\"rdtsc\",\"rdmsr\",\"rdpmc\",\"sysenter\",\"sysexit\",nil,\"getsec\",\r\n\"opc3*38\",nil,\"opc3*3a\",nil,nil,nil,nil,nil,\r\n--4x\r\n\"cmovoVrm\",\"cmovnoVrm\",\"cmovbVrm\",\"cmovnbVrm\",\r\n\"cmovzVrm\",\"cmovnzVrm\",\"cmovbeVrm\",\"cmovaVrm\",\r\n\"cmovsVrm\",\"cmovnsVrm\",\"cmovpeVrm\",\"cmovpoVrm\",\r\n\"cmovlVrm\",\"cmovgeVrm\",\"cmovleVrm\",\"cmovgVrm\",\r\n--5x\r\n\"movmskpsVrXm$||movmskpdVrXm$\",\"sqrtpsXrm|sqrtssXrm|sqrtpdXrm|sqrtsdXrm\",\r\n\"rsqrtpsXrm|rsqrtssXrm\",\"rcppsXrm|rcpssXrm\",\r\n\"andpsXrm||andpdXrm\",\"andnpsXrm||andnpdXrm\",\r\n\"orpsXrm||orpdXrm\",\"xorpsXrm||xorpdXrm\",\r\n\"addpsXrm|addssXrm|addpdXrm|addsdXrm\",\"mulpsXrm|mulssXrm|mulpdXrm|mulsdXrm\",\r\n\"cvtps2pdXrm|cvtss2sdXrm|cvtpd2psXrm|cvtsd2ssXrm\",\r\n\"cvtdq2psXrm|cvttps2dqXrm|cvtps2dqXrm\",\r\n\"subpsXrm|subssXrm|subpdXrm|subsdXrm\",\"minpsXrm|minssXrm|minpdXrm|minsdXrm\",\r\n\"divpsXrm|divssXrm|divpdXrm|divsdXrm\",\"maxpsXrm|maxssXrm|maxpdXrm|maxsdXrm\",\r\n--6x\r\n\"punpcklbwPrm\",\"punpcklwdPrm\",\"punpckldqPrm\",\"packsswbPrm\",\r\n\"pcmpgtbPrm\",\"pcmpgtwPrm\",\"pcmpgtdPrm\",\"packuswbPrm\",\r\n\"punpckhbwPrm\",\"punpckhwdPrm\",\"punpckhdqPrm\",\"packssdwPrm\",\r\n\"||punpcklqdqXrm\",\"||punpckhqdqXrm\",\r\n\"movPrVSm\",\"movqMrm|movdquXrm|movdqaXrm\",\r\n--7x\r\n\"pshufwMrmu|pshufhwXrmu|pshufdXrmu|pshuflwXrmu\",\"pshiftw!Pmu\",\r\n\"pshiftd!Pmu\",\"pshiftq!Mmu||pshiftdq!Xmu\",\r\n\"pcmpeqbPrm\",\"pcmpeqwPrm\",\"pcmpeqdPrm\",\"emms|\",\r\n\"vmreadUmr||extrqXmuu$|insertqXrmuu$\",\"vmwriteUrm||extrqXrm$|insertqXrm$\",\r\nnil,nil,\r\n\"||haddpdXrm|haddpsXrm\",\"||hsubpdXrm|hsubpsXrm\",\r\n\"movVSmMr|movqXrm|movVSmXr\",\"movqMmr|movdquXmr|movdqaXmr\",\r\n--8x\r\n\"joVj\",\"jnoVj\",\"jbVj\",\"jnbVj\",\"jzVj\",\"jnzVj\",\"jbeVj\",\"jaVj\",\r\n\"jsVj\",\"jnsVj\",\"jpeVj\",\"jpoVj\",\"jlVj\",\"jgeVj\",\"jleVj\",\"jgVj\",\r\n--9x\r\n\"setoBm\",\"setnoBm\",\"setbBm\",\"setnbBm\",\"setzBm\",\"setnzBm\",\"setbeBm\",\"setaBm\",\r\n\"setsBm\",\"setnsBm\",\"setpeBm\",\"setpoBm\",\"setlBm\",\"setgeBm\",\"setleBm\",\"setgBm\",\r\n--Ax\r\n\"push fs\",\"pop fs\",\"cpuid\",\"btVmr\",\"shldVmru\",\"shldVmrc\",nil,nil,\r\n\"push gs\",\"pop gs\",\"rsm\",\"btsVmr\",\"shrdVmru\",\"shrdVmrc\",\"fxsave!Dmp\",\"imulVrm\",\r\n--Bx\r\n\"cmpxchgBmr\",\"cmpxchgVmr\",\"$lssVrm\",\"btrVmr\",\r\n\"$lfsVrm\",\"$lgsVrm\",\"movzxVrBmt\",\"movzxVrWmt\",\r\n\"|popcntVrm\",\"ud2Dp\",\"bt!Vmu\",\"btcVmr\",\r\n\"bsfVrm\",\"bsrVrm|lzcntVrm|bsrWrm\",\"movsxVrBmt\",\"movsxVrWmt\",\r\n--Cx\r\n\"xaddBmr\",\"xaddVmr\",\r\n\"cmppsXrmu|cmpssXrmu|cmppdXrmu|cmpsdXrmu\",\"$movntiVmr|\",\r\n\"pinsrwPrWmu\",\"pextrwDrPmu\",\r\n\"shufpsXrmu||shufpdXrmu\",\"$cmpxchg!Qmp\",\r\n\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\"bswapVR\",\r\n--Dx\r\n\"||addsubpdXrm|addsubpsXrm\",\"psrlwPrm\",\"psrldPrm\",\"psrlqPrm\",\r\n\"paddqPrm\",\"pmullwPrm\",\r\n\"|movq2dqXrMm|movqXmr|movdq2qMrXm$\",\"pmovmskbVrMm||pmovmskbVrXm\",\r\n\"psubusbPrm\",\"psubuswPrm\",\"pminubPrm\",\"pandPrm\",\r\n\"paddusbPrm\",\"padduswPrm\",\"pmaxubPrm\",\"pandnPrm\",\r\n--Ex\r\n\"pavgbPrm\",\"psrawPrm\",\"psradPrm\",\"pavgwPrm\",\r\n\"pmulhuwPrm\",\"pmulhwPrm\",\r\n\"|cvtdq2pdXrm|cvttpd2dqXrm|cvtpd2dqXrm\",\"$movntqMmr||$movntdqXmr\",\r\n\"psubsbPrm\",\"psubswPrm\",\"pminswPrm\",\"porPrm\",\r\n\"paddsbPrm\",\"paddswPrm\",\"pmaxswPrm\",\"pxorPrm\",\r\n--Fx\r\n\"|||lddquXrm\",\"psllwPrm\",\"pslldPrm\",\"psllqPrm\",\r\n\"pmuludqPrm\",\"pmaddwdPrm\",\"psadbwPrm\",\"maskmovqMrm||maskmovdquXrm$\",\r\n\"psubbPrm\",\"psubwPrm\",\"psubdPrm\",\"psubqPrm\",\r\n\"paddbPrm\",\"paddwPrm\",\"padddPrm\",\"ud\",\r\n}\r\nassert(map_opc2[255] == \"ud\")\r\n\r\n-- Map for three-byte opcodes. Can't wait for their next invention.\r\nlocal map_opc3 = {\r\n[\"38\"] = { -- [66] 0f 38 xx\r\n--0x\r\n[0]=\"pshufbPrm\",\"phaddwPrm\",\"phadddPrm\",\"phaddswPrm\",\r\n\"pmaddubswPrm\",\"phsubwPrm\",\"phsubdPrm\",\"phsubswPrm\",\r\n\"psignbPrm\",\"psignwPrm\",\"psigndPrm\",\"pmulhrswPrm\",\r\nnil,nil,nil,nil,\r\n--1x\r\n\"||pblendvbXrma\",nil,nil,nil,\r\n\"||blendvpsXrma\",\"||blendvpdXrma\",nil,\"||ptestXrm\",\r\nnil,nil,nil,nil,\r\n\"pabsbPrm\",\"pabswPrm\",\"pabsdPrm\",nil,\r\n--2x\r\n\"||pmovsxbwXrm\",\"||pmovsxbdXrm\",\"||pmovsxbqXrm\",\"||pmovsxwdXrm\",\r\n\"||pmovsxwqXrm\",\"||pmovsxdqXrm\",nil,nil,\r\n\"||pmuldqXrm\",\"||pcmpeqqXrm\",\"||$movntdqaXrm\",\"||packusdwXrm\",\r\nnil,nil,nil,nil,\r\n--3x\r\n\"||pmovzxbwXrm\",\"||pmovzxbdXrm\",\"||pmovzxbqXrm\",\"||pmovzxwdXrm\",\r\n\"||pmovzxwqXrm\",\"||pmovzxdqXrm\",nil,\"||pcmpgtqXrm\",\r\n\"||pminsbXrm\",\"||pminsdXrm\",\"||pminuwXrm\",\"||pminudXrm\",\r\n\"||pmaxsbXrm\",\"||pmaxsdXrm\",\"||pmaxuwXrm\",\"||pmaxudXrm\",\r\n--4x\r\n\"||pmulddXrm\",\"||phminposuwXrm\",\r\n--Fx\r\n[0xf0] = \"|||crc32TrBmt\",[0xf1] = \"|||crc32TrVmt\",\r\n},\r\n\r\n[\"3a\"] = { -- [66] 0f 3a xx\r\n--0x\r\n[0x00]=nil,nil,nil,nil,nil,nil,nil,nil,\r\n\"||roundpsXrmu\",\"||roundpdXrmu\",\"||roundssXrmu\",\"||roundsdXrmu\",\r\n\"||blendpsXrmu\",\"||blendpdXrmu\",\"||pblendwXrmu\",\"palignrPrmu\",\r\n--1x\r\nnil,nil,nil,nil,\r\n\"||pextrbVmXru\",\"||pextrwVmXru\",\"||pextrVmSXru\",\"||extractpsVmXru\",\r\nnil,nil,nil,nil,nil,nil,nil,nil,\r\n--2x\r\n\"||pinsrbXrVmu\",\"||insertpsXrmu\",\"||pinsrXrVmuS\",nil,\r\n--4x\r\n[0x40] = \"||dppsXrmu\",\r\n[0x41] = \"||dppdXrmu\",\r\n[0x42] = \"||mpsadbwXrmu\",\r\n--6x\r\n[0x60] = \"||pcmpestrmXrmu\",[0x61] = \"||pcmpestriXrmu\",\r\n[0x62] = \"||pcmpistrmXrmu\",[0x63] = \"||pcmpistriXrmu\",\r\n},\r\n}\r\n\r\n-- Map for VMX/SVM opcodes 0F 01 C0-FF (sgdt group with register operands).\r\nlocal map_opcvm = {\r\n[0xc1]=\"vmcall\",[0xc2]=\"vmlaunch\",[0xc3]=\"vmresume\",[0xc4]=\"vmxoff\",\r\n[0xc8]=\"monitor\",[0xc9]=\"mwait\",\r\n[0xd8]=\"vmrun\",[0xd9]=\"vmmcall\",[0xda]=\"vmload\",[0xdb]=\"vmsave\",\r\n[0xdc]=\"stgi\",[0xdd]=\"clgi\",[0xde]=\"skinit\",[0xdf]=\"invlpga\",\r\n[0xf8]=\"swapgs\",[0xf9]=\"rdtscp\",\r\n}\r\n\r\n-- Map for FP opcodes. And you thought stack machines are simple?\r\nlocal map_opcfp = {\r\n-- D8-DF 00-BF: opcodes with a memory operand.\r\n-- D8\r\n[0]=\"faddFm\",\"fmulFm\",\"fcomFm\",\"fcompFm\",\"fsubFm\",\"fsubrFm\",\"fdivFm\",\"fdivrFm\",\r\n\"fldFm\",nil,\"fstFm\",\"fstpFm\",\"fldenvVm\",\"fldcwWm\",\"fnstenvVm\",\"fnstcwWm\",\r\n-- DA\r\n\"fiaddDm\",\"fimulDm\",\"ficomDm\",\"ficompDm\",\r\n\"fisubDm\",\"fisubrDm\",\"fidivDm\",\"fidivrDm\",\r\n-- DB\r\n\"fildDm\",\"fisttpDm\",\"fistDm\",\"fistpDm\",nil,\"fld twordFmp\",nil,\"fstp twordFmp\",\r\n-- DC\r\n\"faddGm\",\"fmulGm\",\"fcomGm\",\"fcompGm\",\"fsubGm\",\"fsubrGm\",\"fdivGm\",\"fdivrGm\",\r\n-- DD\r\n\"fldGm\",\"fisttpQm\",\"fstGm\",\"fstpGm\",\"frstorDmp\",nil,\"fnsaveDmp\",\"fnstswWm\",\r\n-- DE\r\n\"fiaddWm\",\"fimulWm\",\"ficomWm\",\"ficompWm\",\r\n\"fisubWm\",\"fisubrWm\",\"fidivWm\",\"fidivrWm\",\r\n-- DF\r\n\"fildWm\",\"fisttpWm\",\"fistWm\",\"fistpWm\",\r\n\"fbld twordFmp\",\"fildQm\",\"fbstp twordFmp\",\"fistpQm\",\r\n-- xx C0-FF: opcodes with a pseudo-register operand.\r\n-- D8\r\n\"faddFf\",\"fmulFf\",\"fcomFf\",\"fcompFf\",\"fsubFf\",\"fsubrFf\",\"fdivFf\",\"fdivrFf\",\r\n-- D9\r\n\"fldFf\",\"fxchFf\",{\"fnop\"},nil,\r\n{\"fchs\",\"fabs\",nil,nil,\"ftst\",\"fxam\"},\r\n{\"fld1\",\"fldl2t\",\"fldl2e\",\"fldpi\",\"fldlg2\",\"fldln2\",\"fldz\"},\r\n{\"f2xm1\",\"fyl2x\",\"fptan\",\"fpatan\",\"fxtract\",\"fprem1\",\"fdecstp\",\"fincstp\"},\r\n{\"fprem\",\"fyl2xp1\",\"fsqrt\",\"fsincos\",\"frndint\",\"fscale\",\"fsin\",\"fcos\"},\r\n-- DA\r\n\"fcmovbFf\",\"fcmoveFf\",\"fcmovbeFf\",\"fcmovuFf\",nil,{nil,\"fucompp\"},nil,nil,\r\n-- DB\r\n\"fcmovnbFf\",\"fcmovneFf\",\"fcmovnbeFf\",\"fcmovnuFf\",\r\n{nil,nil,\"fnclex\",\"fninit\"},\"fucomiFf\",\"fcomiFf\",nil,\r\n-- DC\r\n\"fadd toFf\",\"fmul toFf\",nil,nil,\r\n\"fsub toFf\",\"fsubr toFf\",\"fdivr toFf\",\"fdiv toFf\",\r\n-- DD\r\n\"ffreeFf\",nil,\"fstFf\",\"fstpFf\",\"fucomFf\",\"fucompFf\",nil,nil,\r\n-- DE\r\n\"faddpFf\",\"fmulpFf\",nil,{nil,\"fcompp\"},\r\n\"fsubrpFf\",\"fsubpFf\",\"fdivrpFf\",\"fdivpFf\",\r\n-- DF\r\nnil,nil,nil,nil,{\"fnstsw ax\"},\"fucomipFf\",\"fcomipFf\",nil,\r\n}\r\nassert(map_opcfp[126] == \"fcomipFf\")\r\n\r\n-- Map for opcode groups. The subkey is sp from the ModRM byte.\r\nlocal map_opcgroup = {\r\n  arith = { \"add\", \"or\", \"adc\", \"sbb\", \"and\", \"sub\", \"xor\", \"cmp\" },\r\n  shift = { \"rol\", \"ror\", \"rcl\", \"rcr\", \"shl\", \"shr\", \"sal\", \"sar\" },\r\n  testb = { \"testBmi\", \"testBmi\", \"not\", \"neg\", \"mul\", \"imul\", \"div\", \"idiv\" },\r\n  testv = { \"testVmi\", \"testVmi\", \"not\", \"neg\", \"mul\", \"imul\", \"div\", \"idiv\" },\r\n  incb = { \"inc\", \"dec\" },\r\n  incd = { \"inc\", \"dec\", \"callUmp\", \"$call farDmp\",\r\n\t   \"jmpUmp\", \"$jmp farDmp\", \"pushUm\" },\r\n  sldt = { \"sldt\", \"str\", \"lldt\", \"ltr\", \"verr\", \"verw\" },\r\n  sgdt = { \"vm*$sgdt\", \"vm*$sidt\", \"$lgdt\", \"vm*$lidt\",\r\n\t   \"smsw\", nil, \"lmsw\", \"vm*$invlpg\" },\r\n  bt = { nil, nil, nil, nil, \"bt\", \"bts\", \"btr\", \"btc\" },\r\n  cmpxchg = { nil, \"sz*,cmpxchg8bQmp,cmpxchg16bXmp\", nil, nil,\r\n\t      nil, nil, \"vmptrld|vmxon|vmclear\", \"vmptrst\" },\r\n  pshiftw = { nil, nil, \"psrlw\", nil, \"psraw\", nil, \"psllw\" },\r\n  pshiftd = { nil, nil, \"psrld\", nil, \"psrad\", nil, \"pslld\" },\r\n  pshiftq = { nil, nil, \"psrlq\", nil, nil, nil, \"psllq\" },\r\n  pshiftdq = { nil, nil, \"psrlq\", \"psrldq\", nil, nil, \"psllq\", \"pslldq\" },\r\n  fxsave = { \"$fxsave\", \"$fxrstor\", \"$ldmxcsr\", \"$stmxcsr\",\r\n\t     nil, \"lfenceDp$\", \"mfenceDp$\", \"sfenceDp$clflush\" },\r\n  prefetch = { \"prefetch\", \"prefetchw\" },\r\n  prefetcht = { \"prefetchnta\", \"prefetcht0\", \"prefetcht1\", \"prefetcht2\" },\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Maps for register names.\r\nlocal map_regs = {\r\n  B = { \"al\", \"cl\", \"dl\", \"bl\", \"ah\", \"ch\", \"dh\", \"bh\",\r\n\t\"r8b\", \"r9b\", \"r10b\", \"r11b\", \"r12b\", \"r13b\", \"r14b\", \"r15b\" },\r\n  B64 = { \"al\", \"cl\", \"dl\", \"bl\", \"spl\", \"bpl\", \"sil\", \"dil\",\r\n\t  \"r8b\", \"r9b\", \"r10b\", \"r11b\", \"r12b\", \"r13b\", \"r14b\", \"r15b\" },\r\n  W = { \"ax\", \"cx\", \"dx\", \"bx\", \"sp\", \"bp\", \"si\", \"di\",\r\n\t\"r8w\", \"r9w\", \"r10w\", \"r11w\", \"r12w\", \"r13w\", \"r14w\", \"r15w\" },\r\n  D = { \"eax\", \"ecx\", \"edx\", \"ebx\", \"esp\", \"ebp\", \"esi\", \"edi\",\r\n\t\"r8d\", \"r9d\", \"r10d\", \"r11d\", \"r12d\", \"r13d\", \"r14d\", \"r15d\" },\r\n  Q = { \"rax\", \"rcx\", \"rdx\", \"rbx\", \"rsp\", \"rbp\", \"rsi\", \"rdi\",\r\n\t\"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\" },\r\n  M = { \"mm0\", \"mm1\", \"mm2\", \"mm3\", \"mm4\", \"mm5\", \"mm6\", \"mm7\",\r\n\t\"mm0\", \"mm1\", \"mm2\", \"mm3\", \"mm4\", \"mm5\", \"mm6\", \"mm7\" }, -- No x64 ext!\r\n  X = { \"xmm0\", \"xmm1\", \"xmm2\", \"xmm3\", \"xmm4\", \"xmm5\", \"xmm6\", \"xmm7\",\r\n\t\"xmm8\", \"xmm9\", \"xmm10\", \"xmm11\", \"xmm12\", \"xmm13\", \"xmm14\", \"xmm15\" },\r\n}\r\nlocal map_segregs = { \"es\", \"cs\", \"ss\", \"ds\", \"fs\", \"gs\", \"segr6\", \"segr7\" }\r\n\r\n-- Maps for size names.\r\nlocal map_sz2n = {\r\n  B = 1, W = 2, D = 4, Q = 8, M = 8, X = 16,\r\n}\r\nlocal map_sz2prefix = {\r\n  B = \"byte\", W = \"word\", D = \"dword\",\r\n  Q = \"qword\",\r\n  M = \"qword\", X = \"xword\",\r\n  F = \"dword\", G = \"qword\", -- No need for sizes/register names for these two.\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Output a nicely formatted line with an opcode and operands.\r\nlocal function putop(ctx, text, operands)\r\n  local code, pos, hex = ctx.code, ctx.pos, \"\"\r\n  local hmax = ctx.hexdump\r\n  if hmax > 0 then\r\n    for i=ctx.start,pos-1 do\r\n      hex = hex..format(\"%02X\", byte(code, i, i))\r\n    end\r\n    if #hex > hmax then hex = sub(hex, 1, hmax)..\". \"\r\n    else hex = hex..rep(\" \", hmax-#hex+2) end\r\n  end\r\n  if operands then text = text..\" \"..operands end\r\n  if ctx.o16 then text = \"o16 \"..text; ctx.o16 = false end\r\n  if ctx.a32 then text = \"a32 \"..text; ctx.a32 = false end\r\n  if ctx.rep then text = ctx.rep..\" \"..text; ctx.rep = false end\r\n  if ctx.rex then\r\n    local t = (ctx.rexw and \"w\" or \"\")..(ctx.rexr and \"r\" or \"\")..\r\n\t      (ctx.rexx and \"x\" or \"\")..(ctx.rexb and \"b\" or \"\")\r\n    if t ~= \"\" then text = \"rex.\"..t..\" \"..text end\r\n    ctx.rexw = false; ctx.rexr = false; ctx.rexx = false; ctx.rexb = false\r\n    ctx.rex = false\r\n  end\r\n  if ctx.seg then\r\n    local text2, n = gsub(text, \"%[\", \"[\"..ctx.seg..\":\")\r\n    if n == 0 then text = ctx.seg..\" \"..text else text = text2 end\r\n    ctx.seg = false\r\n  end\r\n  if ctx.lock then text = \"lock \"..text; ctx.lock = false end\r\n  local imm = ctx.imm\r\n  if imm then\r\n    local sym = ctx.symtab[imm]\r\n    if sym then text = text..\"\\t->\"..sym end\r\n  end\r\n  ctx.out(format(\"%08x  %s%s\\n\", ctx.addr+ctx.start, hex, text))\r\n  ctx.mrm = false\r\n  ctx.start = pos\r\n  ctx.imm = nil\r\nend\r\n\r\n-- Clear all prefix flags.\r\nlocal function clearprefixes(ctx)\r\n  ctx.o16 = false; ctx.seg = false; ctx.lock = false; ctx.rep = false\r\n  ctx.rexw = false; ctx.rexr = false; ctx.rexx = false; ctx.rexb = false\r\n  ctx.rex = false; ctx.a32 = false\r\nend\r\n\r\n-- Fallback for incomplete opcodes at the end.\r\nlocal function incomplete(ctx)\r\n  ctx.pos = ctx.stop+1\r\n  clearprefixes(ctx)\r\n  return putop(ctx, \"(incomplete)\")\r\nend\r\n\r\n-- Fallback for unknown opcodes.\r\nlocal function unknown(ctx)\r\n  clearprefixes(ctx)\r\n  return putop(ctx, \"(unknown)\")\r\nend\r\n\r\n-- Return an immediate of the specified size.\r\nlocal function getimm(ctx, pos, n)\r\n  if pos+n-1 > ctx.stop then return incomplete(ctx) end\r\n  local code = ctx.code\r\n  if n == 1 then\r\n    local b1 = byte(code, pos, pos)\r\n    return b1\r\n  elseif n == 2 then\r\n    local b1, b2 = byte(code, pos, pos+1)\r\n    return b1+b2*256\r\n  else\r\n    local b1, b2, b3, b4 = byte(code, pos, pos+3)\r\n    local imm = b1+b2*256+b3*65536+b4*16777216\r\n    ctx.imm = imm\r\n    return imm\r\n  end\r\nend\r\n\r\n-- Process pattern string and generate the operands.\r\nlocal function putpat(ctx, name, pat)\r\n  local operands, regs, sz, mode, sp, rm, sc, rx, sdisp\r\n  local code, pos, stop = ctx.code, ctx.pos, ctx.stop\r\n\r\n  -- Chars used: 1DFGIMPQRSTUVWXacdfgijmoprstuwxyz\r\n  for p in gmatch(pat, \".\") do\r\n    local x = nil\r\n    if p == \"V\" or p == \"U\" then\r\n      if ctx.rexw then sz = \"Q\"; ctx.rexw = false\r\n      elseif ctx.o16 then sz = \"W\"; ctx.o16 = false\r\n      elseif p == \"U\" and ctx.x64 then sz = \"Q\"\r\n      else sz = \"D\" end\r\n      regs = map_regs[sz]\r\n    elseif p == \"T\" then\r\n      if ctx.rexw then sz = \"Q\"; ctx.rexw = false else sz = \"D\" end\r\n      regs = map_regs[sz]\r\n    elseif p == \"B\" then\r\n      sz = \"B\"\r\n      regs = ctx.rex and map_regs.B64 or map_regs.B\r\n    elseif match(p, \"[WDQMXFG]\") then\r\n      sz = p\r\n      regs = map_regs[sz]\r\n    elseif p == \"P\" then\r\n      sz = ctx.o16 and \"X\" or \"M\"; ctx.o16 = false\r\n      regs = map_regs[sz]\r\n    elseif p == \"S\" then\r\n      name = name..lower(sz)\r\n    elseif p == \"s\" then\r\n      local imm = getimm(ctx, pos, 1); if not imm then return end\r\n      x = imm <= 127 and format(\"+0x%02x\", imm)\r\n\t\t     or format(\"-0x%02x\", 256-imm)\r\n      pos = pos+1\r\n    elseif p == \"u\" then\r\n      local imm = getimm(ctx, pos, 1); if not imm then return end\r\n      x = format(\"0x%02x\", imm)\r\n      pos = pos+1\r\n    elseif p == \"w\" then\r\n      local imm = getimm(ctx, pos, 2); if not imm then return end\r\n      x = format(\"0x%x\", imm)\r\n      pos = pos+2\r\n    elseif p == \"o\" then -- [offset]\r\n      if ctx.x64 then\r\n\tlocal imm1 = getimm(ctx, pos, 4); if not imm1 then return end\r\n\tlocal imm2 = getimm(ctx, pos+4, 4); if not imm2 then return end\r\n\tx = format(\"[0x%08x%08x]\", imm2, imm1)\r\n\tpos = pos+8\r\n      else\r\n\tlocal imm = getimm(ctx, pos, 4); if not imm then return end\r\n\tx = format(\"[0x%08x]\", imm)\r\n\tpos = pos+4\r\n      end\r\n    elseif p == \"i\" or p == \"I\" then\r\n      local n = map_sz2n[sz]\r\n      if n == 8 and ctx.x64 and p == \"I\" then\r\n\tlocal imm1 = getimm(ctx, pos, 4); if not imm1 then return end\r\n\tlocal imm2 = getimm(ctx, pos+4, 4); if not imm2 then return end\r\n\tx = format(\"0x%08x%08x\", imm2, imm1)\r\n      else\r\n\tif n == 8 then n = 4 end\r\n\tlocal imm = getimm(ctx, pos, n); if not imm then return end\r\n\tif sz == \"Q\" and (imm < 0 or imm > 0x7fffffff) then\r\n\t  imm = (0xffffffff+1)-imm\r\n\t  x = format(imm > 65535 and \"-0x%08x\" or \"-0x%x\", imm)\r\n\telse\r\n\t  x = format(imm > 65535 and \"0x%08x\" or \"0x%x\", imm)\r\n\tend\r\n      end\r\n      pos = pos+n\r\n    elseif p == \"j\" then\r\n      local n = map_sz2n[sz]\r\n      if n == 8 then n = 4 end\r\n      local imm = getimm(ctx, pos, n); if not imm then return end\r\n      if sz == \"B\" and imm > 127 then imm = imm-256\r\n      elseif imm > 2147483647 then imm = imm-4294967296 end\r\n      pos = pos+n\r\n      imm = imm + pos + ctx.addr\r\n      if imm > 4294967295 and not ctx.x64 then imm = imm-4294967296 end\r\n      ctx.imm = imm\r\n      if sz == \"W\" then\r\n\tx = format(\"word 0x%04x\", imm%65536)\r\n      elseif ctx.x64 then\r\n\tlocal lo = imm % 0x1000000\r\n\tx = format(\"0x%02x%06x\", (imm-lo) / 0x1000000, lo)\r\n      else\r\n\tx = \"0x\"..tohex(imm)\r\n      end\r\n    elseif p == \"R\" then\r\n      local r = byte(code, pos-1, pos-1)%8\r\n      if ctx.rexb then r = r + 8; ctx.rexb = false end\r\n      x = regs[r+1]\r\n    elseif p == \"a\" then x = regs[1]\r\n    elseif p == \"c\" then x = \"cl\"\r\n    elseif p == \"d\" then x = \"dx\"\r\n    elseif p == \"1\" then x = \"1\"\r\n    else\r\n      if not mode then\r\n\tmode = ctx.mrm\r\n\tif not mode then\r\n\t  if pos > stop then return incomplete(ctx) end\r\n\t  mode = byte(code, pos, pos)\r\n\t  pos = pos+1\r\n\tend\r\n\trm = mode%8; mode = (mode-rm)/8\r\n\tsp = mode%8; mode = (mode-sp)/8\r\n\tsdisp = \"\"\r\n\tif mode < 3 then\r\n\t  if rm == 4 then\r\n\t    if pos > stop then return incomplete(ctx) end\r\n\t    sc = byte(code, pos, pos)\r\n\t    pos = pos+1\r\n\t    rm = sc%8; sc = (sc-rm)/8\r\n\t    rx = sc%8; sc = (sc-rx)/8\r\n\t    if ctx.rexx then rx = rx + 8; ctx.rexx = false end\r\n\t    if rx == 4 then rx = nil end\r\n\t  end\r\n\t  if mode > 0 or rm == 5 then\r\n\t    local dsz = mode\r\n\t    if dsz ~= 1 then dsz = 4 end\r\n\t    local disp = getimm(ctx, pos, dsz); if not disp then return end\r\n\t    if mode == 0 then rm = nil end\r\n\t    if rm or rx or (not sc and ctx.x64 and not ctx.a32) then\r\n\t      if dsz == 1 and disp > 127 then\r\n\t\tsdisp = format(\"-0x%x\", 256-disp)\r\n\t      elseif disp >= 0 and disp <= 0x7fffffff then\r\n\t\tsdisp = format(\"+0x%x\", disp)\r\n\t      else\r\n\t\tsdisp = format(\"-0x%x\", (0xffffffff+1)-disp)\r\n\t      end\r\n\t    else\r\n\t      sdisp = format(ctx.x64 and not ctx.a32 and\r\n\t\tnot (disp >= 0 and disp <= 0x7fffffff)\r\n\t\tand \"0xffffffff%08x\" or \"0x%08x\", disp)\r\n\t    end\r\n\t    pos = pos+dsz\r\n\t  end\r\n\tend\r\n\tif rm and ctx.rexb then rm = rm + 8; ctx.rexb = false end\r\n\tif ctx.rexr then sp = sp + 8; ctx.rexr = false end\r\n      end\r\n      if p == \"m\" then\r\n\tif mode == 3 then x = regs[rm+1]\r\n\telse\r\n\t  local aregs = ctx.a32 and map_regs.D or ctx.aregs\r\n\t  local srm, srx = \"\", \"\"\r\n\t  if rm then srm = aregs[rm+1]\r\n\t  elseif not sc and ctx.x64 and not ctx.a32 then srm = \"rip\" end\r\n\t  ctx.a32 = false\r\n\t  if rx then\r\n\t    if rm then srm = srm..\"+\" end\r\n\t    srx = aregs[rx+1]\r\n\t    if sc > 0 then srx = srx..\"*\"..(2^sc) end\r\n\t  end\r\n\t  x = format(\"[%s%s%s]\", srm, srx, sdisp)\r\n\tend\r\n\tif mode < 3 and\r\n\t   (not match(pat, \"[aRrgp]\") or match(pat, \"t\")) then -- Yuck.\r\n\t  x = map_sz2prefix[sz]..\" \"..x\r\n\tend\r\n      elseif p == \"r\" then x = regs[sp+1]\r\n      elseif p == \"g\" then x = map_segregs[sp+1]\r\n      elseif p == \"p\" then -- Suppress prefix.\r\n      elseif p == \"f\" then x = \"st\"..rm\r\n      elseif p == \"x\" then\r\n\tif sp == 0 and ctx.lock and not ctx.x64 then\r\n\t  x = \"CR8\"; ctx.lock = false\r\n\telse\r\n\t  x = \"CR\"..sp\r\n\tend\r\n      elseif p == \"y\" then x = \"DR\"..sp\r\n      elseif p == \"z\" then x = \"TR\"..sp\r\n      elseif p == \"t\" then\r\n      else\r\n\terror(\"bad pattern `\"..pat..\"'\")\r\n      end\r\n    end\r\n    if x then operands = operands and operands..\", \"..x or x end\r\n  end\r\n  ctx.pos = pos\r\n  return putop(ctx, name, operands)\r\nend\r\n\r\n-- Forward declaration.\r\nlocal map_act\r\n\r\n-- Fetch and cache MRM byte.\r\nlocal function getmrm(ctx)\r\n  local mrm = ctx.mrm\r\n  if not mrm then\r\n    local pos = ctx.pos\r\n    if pos > ctx.stop then return nil end\r\n    mrm = byte(ctx.code, pos, pos)\r\n    ctx.pos = pos+1\r\n    ctx.mrm = mrm\r\n  end\r\n  return mrm\r\nend\r\n\r\n-- Dispatch to handler depending on pattern.\r\nlocal function dispatch(ctx, opat, patgrp)\r\n  if not opat then return unknown(ctx) end\r\n  if match(opat, \"%|\") then -- MMX/SSE variants depending on prefix.\r\n    local p\r\n    if ctx.rep then\r\n      p = ctx.rep==\"rep\" and \"%|([^%|]*)\" or \"%|[^%|]*%|[^%|]*%|([^%|]*)\"\r\n      ctx.rep = false\r\n    elseif ctx.o16 then p = \"%|[^%|]*%|([^%|]*)\"; ctx.o16 = false\r\n    else p = \"^[^%|]*\" end\r\n    opat = match(opat, p)\r\n    if not opat then return unknown(ctx) end\r\n--    ctx.rep = false; ctx.o16 = false\r\n    --XXX fails for 66 f2 0f 38 f1 06  crc32 eax,WORD PTR [esi]\r\n    --XXX remove in branches?\r\n  end\r\n  if match(opat, \"%$\") then -- reg$mem variants.\r\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\r\n    opat = match(opat, mrm >= 192 and \"^[^%$]*\" or \"%$(.*)\")\r\n    if opat == \"\" then return unknown(ctx) end\r\n  end\r\n  if opat == \"\" then return unknown(ctx) end\r\n  local name, pat = match(opat, \"^([a-z0-9 ]*)(.*)\")\r\n  if pat == \"\" and patgrp then pat = patgrp end\r\n  return map_act[sub(pat, 1, 1)](ctx, name, pat)\r\nend\r\n\r\n-- Get a pattern from an opcode map and dispatch to handler.\r\nlocal function dispatchmap(ctx, opcmap)\r\n  local pos = ctx.pos\r\n  local opat = opcmap[byte(ctx.code, pos, pos)]\r\n  pos = pos + 1\r\n  ctx.pos = pos\r\n  return dispatch(ctx, opat)\r\nend\r\n\r\n-- Map for action codes. The key is the first char after the name.\r\nmap_act = {\r\n  -- Simple opcodes without operands.\r\n  [\"\"] = function(ctx, name, pat)\r\n    return putop(ctx, name)\r\n  end,\r\n\r\n  -- Operand size chars fall right through.\r\n  B = putpat, W = putpat, D = putpat, Q = putpat,\r\n  V = putpat, U = putpat, T = putpat,\r\n  M = putpat, X = putpat, P = putpat,\r\n  F = putpat, G = putpat,\r\n\r\n  -- Collect prefixes.\r\n  [\":\"] = function(ctx, name, pat)\r\n    ctx[pat == \":\" and name or sub(pat, 2)] = name\r\n    if ctx.pos - ctx.start > 5 then return unknown(ctx) end -- Limit #prefixes.\r\n  end,\r\n\r\n  -- Chain to special handler specified by name.\r\n  [\"*\"] = function(ctx, name, pat)\r\n    return map_act[name](ctx, name, sub(pat, 2))\r\n  end,\r\n\r\n  -- Use named subtable for opcode group.\r\n  [\"!\"] = function(ctx, name, pat)\r\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\r\n    return dispatch(ctx, map_opcgroup[name][((mrm-(mrm%8))/8)%8+1], sub(pat, 2))\r\n  end,\r\n\r\n  -- o16,o32[,o64] variants.\r\n  sz = function(ctx, name, pat)\r\n    if ctx.o16 then ctx.o16 = false\r\n    else\r\n      pat = match(pat, \",(.*)\")\r\n      if ctx.rexw then\r\n\tlocal p = match(pat, \",(.*)\")\r\n\tif p then pat = p; ctx.rexw = false end\r\n      end\r\n    end\r\n    pat = match(pat, \"^[^,]*\")\r\n    return dispatch(ctx, pat)\r\n  end,\r\n\r\n  -- Two-byte opcode dispatch.\r\n  opc2 = function(ctx, name, pat)\r\n    return dispatchmap(ctx, map_opc2)\r\n  end,\r\n\r\n  -- Three-byte opcode dispatch.\r\n  opc3 = function(ctx, name, pat)\r\n    return dispatchmap(ctx, map_opc3[pat])\r\n  end,\r\n\r\n  -- VMX/SVM dispatch.\r\n  vm = function(ctx, name, pat)\r\n    return dispatch(ctx, map_opcvm[ctx.mrm])\r\n  end,\r\n\r\n  -- Floating point opcode dispatch.\r\n  fp = function(ctx, name, pat)\r\n    local mrm = getmrm(ctx); if not mrm then return incomplete(ctx) end\r\n    local rm = mrm%8\r\n    local idx = pat*8 + ((mrm-rm)/8)%8\r\n    if mrm >= 192 then idx = idx + 64 end\r\n    local opat = map_opcfp[idx]\r\n    if type(opat) == \"table\" then opat = opat[rm+1] end\r\n    return dispatch(ctx, opat)\r\n  end,\r\n\r\n  -- REX prefix.\r\n  rex = function(ctx, name, pat)\r\n    if ctx.rex then return unknown(ctx) end -- Only 1 REX prefix allowed.\r\n    for p in gmatch(pat, \".\") do ctx[\"rex\"..p] = true end\r\n    ctx.rex = true\r\n  end,\r\n\r\n  -- Special case for nop with REX prefix.\r\n  nop = function(ctx, name, pat)\r\n    return dispatch(ctx, ctx.rex and pat or \"nop\")\r\n  end,\r\n}\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Disassemble a block of code.\r\nlocal function disass_block(ctx, ofs, len)\r\n  if not ofs then ofs = 0 end\r\n  local stop = len and ofs+len or #ctx.code\r\n  ofs = ofs + 1\r\n  ctx.start = ofs\r\n  ctx.pos = ofs\r\n  ctx.stop = stop\r\n  ctx.imm = nil\r\n  ctx.mrm = false\r\n  clearprefixes(ctx)\r\n  while ctx.pos <= stop do dispatchmap(ctx, ctx.map1) end\r\n  if ctx.pos ~= ctx.start then incomplete(ctx) end\r\nend\r\n\r\n-- Extended API: create a disassembler context. Then call ctx:disass(ofs, len).\r\nlocal function create(code, addr, out)\r\n  local ctx = {}\r\n  ctx.code = code\r\n  ctx.addr = (addr or 0) - 1\r\n  ctx.out = out or io.write\r\n  ctx.symtab = {}\r\n  ctx.disass = disass_block\r\n  ctx.hexdump = 16\r\n  ctx.x64 = false\r\n  ctx.map1 = map_opc1_32\r\n  ctx.aregs = map_regs.D\r\n  return ctx\r\nend\r\n\r\nlocal function create64(code, addr, out)\r\n  local ctx = create(code, addr, out)\r\n  ctx.x64 = true\r\n  ctx.map1 = map_opc1_64\r\n  ctx.aregs = map_regs.Q\r\n  return ctx\r\nend\r\n\r\n-- Simple API: disassemble code (a string) at address and output via out.\r\nlocal function disass(code, addr, out)\r\n  create(code, addr, out):disass()\r\nend\r\n\r\nlocal function disass64(code, addr, out)\r\n  create64(code, addr, out):disass()\r\nend\r\n\r\n-- Return register name for RID.\r\nlocal function regname(r)\r\n  if r < 8 then return map_regs.D[r+1] end\r\n  return map_regs.X[r-7]\r\nend\r\n\r\nlocal function regname64(r)\r\n  if r < 16 then return map_regs.Q[r+1] end\r\n  return map_regs.X[r-15]\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  create = create,\r\n  create64 = create64,\r\n  disass = disass,\r\n  disass64 = disass64,\r\n  regname = regname,\r\n  regname64 = regname64\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/dump.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT compiler dump module.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module can be used to debug the JIT compiler itself. It dumps the\r\n-- code representations and structures used in various compiler stages.\r\n--\r\n-- Example usage:\r\n--\r\n--   luajit -jdump -e \"local x=0; for i=1,1e6 do x=x+i end; print(x)\"\r\n--   luajit -jdump=im -e \"for i=1,1000 do for j=1,1000 do end end\" | less -R\r\n--   luajit -jdump=is myapp.lua | less -R\r\n--   luajit -jdump=-b myapp.lua\r\n--   luajit -jdump=+aH,myapp.html myapp.lua\r\n--   luajit -jdump=ixT,myapp.dump myapp.lua\r\n--\r\n-- The first argument specifies the dump mode. The second argument gives\r\n-- the output file name. Default output is to stdout, unless the environment\r\n-- variable LUAJIT_DUMPFILE is set. The file is overwritten every time the\r\n-- module is started.\r\n--\r\n-- Different features can be turned on or off with the dump mode. If the\r\n-- mode starts with a '+', the following features are added to the default\r\n-- set of features; a '-' removes them. Otherwise the features are replaced.\r\n--\r\n-- The following dump features are available (* marks the default):\r\n--\r\n--  * t  Print a line for each started, ended or aborted trace (see also -jv).\r\n--  * b  Dump the traced bytecode.\r\n--  * i  Dump the IR (intermediate representation).\r\n--    r  Augment the IR with register/stack slots.\r\n--    s  Dump the snapshot map.\r\n--  * m  Dump the generated machine code.\r\n--    x  Print each taken trace exit.\r\n--    X  Print each taken trace exit and the contents of all registers.\r\n--    a  Print the IR of aborted traces, too.\r\n--\r\n-- The output format can be set with the following characters:\r\n--\r\n--    T  Plain text output.\r\n--    A  ANSI-colored text output\r\n--    H  Colorized HTML + CSS output.\r\n--\r\n-- The default output format is plain text. It's set to ANSI-colored text\r\n-- if the COLORTERM variable is set. Note: this is independent of any output\r\n-- redirection, which is actually considered a feature.\r\n--\r\n-- You probably want to use less -R to enjoy viewing ANSI-colored text from\r\n-- a pipe or a file. Add this to your ~/.bashrc: export LESS=\"-R\"\r\n--\r\n------------------------------------------------------------------------------\r\n\r\n-- Cache some library functions and objects.\r\nlocal jit = require(\"jit\")\r\nassert(jit.version_num == 20100, \"LuaJIT core/library version mismatch\")\r\nlocal jutil = require(\"jit.util\")\r\nlocal vmdef = require(\"jit.vmdef\")\r\nlocal funcinfo, funcbc = jutil.funcinfo, jutil.funcbc\r\nlocal traceinfo, traceir, tracek = jutil.traceinfo, jutil.traceir, jutil.tracek\r\nlocal tracemc, tracesnap = jutil.tracemc, jutil.tracesnap\r\nlocal traceexitstub, ircalladdr = jutil.traceexitstub, jutil.ircalladdr\r\nlocal bit = require(\"bit\")\r\nlocal band, shl, shr, tohex = bit.band, bit.lshift, bit.rshift, bit.tohex\r\nlocal sub, gsub, format = string.sub, string.gsub, string.format\r\nlocal byte, char, rep = string.byte, string.char, string.rep\r\nlocal type, tostring = type, tostring\r\nlocal stdout, stderr = io.stdout, io.stderr\r\n\r\n-- Load other modules on-demand.\r\nlocal bcline, disass\r\n\r\n-- Active flag, output file handle and dump mode.\r\nlocal active, out, dumpmode\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal symtabmt = { __index = false }\r\nlocal symtab = {}\r\nlocal nexitsym = 0\r\n\r\n-- Fill nested symbol table with per-trace exit stub addresses.\r\nlocal function fillsymtab_tr(tr, nexit)\r\n  local t = {}\r\n  symtabmt.__index = t\r\n  if jit.arch == \"mips\" or jit.arch == \"mipsel\" then\r\n    t[traceexitstub(tr, 0)] = \"exit\"\r\n    return\r\n  end\r\n  for i=0,nexit-1 do\r\n    local addr = traceexitstub(tr, i)\r\n    if addr < 0 then addr = addr + 2^32 end\r\n    t[addr] = tostring(i)\r\n  end\r\n  local addr = traceexitstub(tr, nexit)\r\n  if addr then t[addr] = \"stack_check\" end\r\nend\r\n\r\n-- Fill symbol table with trace exit stub addresses.\r\nlocal function fillsymtab(tr, nexit)\r\n  local t = symtab\r\n  if nexitsym == 0 then\r\n    local ircall = vmdef.ircall\r\n    for i=0,#ircall do\r\n      local addr = ircalladdr(i)\r\n      if addr ~= 0 then\r\n\tif addr < 0 then addr = addr + 2^32 end\r\n\tt[addr] = ircall[i]\r\n      end\r\n    end\r\n  end\r\n  if nexitsym == 1000000 then -- Per-trace exit stubs.\r\n    fillsymtab_tr(tr, nexit)\r\n  elseif nexit > nexitsym then -- Shared exit stubs.\r\n    for i=nexitsym,nexit-1 do\r\n      local addr = traceexitstub(i)\r\n      if addr == nil then -- Fall back to per-trace exit stubs.\r\n\tfillsymtab_tr(tr, nexit)\r\n\tsetmetatable(symtab, symtabmt)\r\n\tnexit = 1000000\r\n\tbreak\r\n      end\r\n      if addr < 0 then addr = addr + 2^32 end\r\n      t[addr] = tostring(i)\r\n    end\r\n    nexitsym = nexit\r\n  end\r\n  return t\r\nend\r\n\r\nlocal function dumpwrite(s)\r\n  out:write(s)\r\nend\r\n\r\n-- Disassemble machine code.\r\nlocal function dump_mcode(tr)\r\n  local info = traceinfo(tr)\r\n  if not info then return end\r\n  local mcode, addr, loop = tracemc(tr)\r\n  if not mcode then return end\r\n  if not disass then disass = require(\"jit.dis_\"..jit.arch) end\r\n  if addr < 0 then addr = addr + 2^32 end\r\n  out:write(\"---- TRACE \", tr, \" mcode \", #mcode, \"\\n\")\r\n  local ctx = disass.create(mcode, addr, dumpwrite)\r\n  ctx.hexdump = 0\r\n  ctx.symtab = fillsymtab(tr, info.nexit)\r\n  if loop ~= 0 then\r\n    symtab[addr+loop] = \"LOOP\"\r\n    ctx:disass(0, loop)\r\n    out:write(\"->LOOP:\\n\")\r\n    ctx:disass(loop, #mcode-loop)\r\n    symtab[addr+loop] = nil\r\n  else\r\n    ctx:disass(0, #mcode)\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal irtype_text = {\r\n  [0] = \"nil\",\r\n  \"fal\",\r\n  \"tru\",\r\n  \"lud\",\r\n  \"str\",\r\n  \"p32\",\r\n  \"thr\",\r\n  \"pro\",\r\n  \"fun\",\r\n  \"p64\",\r\n  \"cdt\",\r\n  \"tab\",\r\n  \"udt\",\r\n  \"flt\",\r\n  \"num\",\r\n  \"i8 \",\r\n  \"u8 \",\r\n  \"i16\",\r\n  \"u16\",\r\n  \"int\",\r\n  \"u32\",\r\n  \"i64\",\r\n  \"u64\",\r\n  \"sfp\",\r\n}\r\n\r\nlocal colortype_ansi = {\r\n  [0] = \"%s\",\r\n  \"%s\",\r\n  \"%s\",\r\n  \"\\027[36m%s\\027[m\",\r\n  \"\\027[32m%s\\027[m\",\r\n  \"%s\",\r\n  \"\\027[1m%s\\027[m\",\r\n  \"%s\",\r\n  \"\\027[1m%s\\027[m\",\r\n  \"%s\",\r\n  \"\\027[33m%s\\027[m\",\r\n  \"\\027[31m%s\\027[m\",\r\n  \"\\027[36m%s\\027[m\",\r\n  \"\\027[34m%s\\027[m\",\r\n  \"\\027[34m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n  \"\\027[35m%s\\027[m\",\r\n}\r\n\r\nlocal function colorize_text(s, t)\r\n  return s\r\nend\r\n\r\nlocal function colorize_ansi(s, t)\r\n  return format(colortype_ansi[t], s)\r\nend\r\n\r\nlocal irtype_ansi = setmetatable({},\r\n  { __index = function(tab, t)\r\n      local s = colorize_ansi(irtype_text[t], t); tab[t] = s; return s; end })\r\n\r\nlocal html_escape = { [\"<\"] = \"&lt;\", [\">\"] = \"&gt;\", [\"&\"] = \"&amp;\", }\r\n\r\nlocal function colorize_html(s, t)\r\n  s = gsub(s, \"[<>&]\", html_escape)\r\n  return format('<span class=\"irt_%s\">%s</span>', irtype_text[t], s)\r\nend\r\n\r\nlocal irtype_html = setmetatable({},\r\n  { __index = function(tab, t)\r\n      local s = colorize_html(irtype_text[t], t); tab[t] = s; return s; end })\r\n\r\nlocal header_html = [[\r\n<style type=\"text/css\">\r\nbackground { background: #ffffff; color: #000000; }\r\npre.ljdump {\r\nfont-size: 10pt;\r\nbackground: #f0f4ff;\r\ncolor: #000000;\r\nborder: 1px solid #bfcfff;\r\npadding: 0.5em;\r\nmargin-left: 2em;\r\nmargin-right: 2em;\r\n}\r\nspan.irt_str { color: #00a000; }\r\nspan.irt_thr, span.irt_fun { color: #404040; font-weight: bold; }\r\nspan.irt_tab { color: #c00000; }\r\nspan.irt_udt, span.irt_lud { color: #00c0c0; }\r\nspan.irt_num { color: #4040c0; }\r\nspan.irt_int, span.irt_i8, span.irt_u8, span.irt_i16, span.irt_u16 { color: #b040b0; }\r\n</style>\r\n]]\r\n\r\nlocal colorize, irtype\r\n\r\n-- Lookup tables to convert some literals into names.\r\nlocal litname = {\r\n  [\"SLOAD \"] = setmetatable({}, { __index = function(t, mode)\r\n    local s = \"\"\r\n    if band(mode, 1) ~= 0 then s = s..\"P\" end\r\n    if band(mode, 2) ~= 0 then s = s..\"F\" end\r\n    if band(mode, 4) ~= 0 then s = s..\"T\" end\r\n    if band(mode, 8) ~= 0 then s = s..\"C\" end\r\n    if band(mode, 16) ~= 0 then s = s..\"R\" end\r\n    if band(mode, 32) ~= 0 then s = s..\"I\" end\r\n    t[mode] = s\r\n    return s\r\n  end}),\r\n  [\"XLOAD \"] = { [0] = \"\", \"R\", \"V\", \"RV\", \"U\", \"RU\", \"VU\", \"RVU\", },\r\n  [\"CONV  \"] = setmetatable({}, { __index = function(t, mode)\r\n    local s = irtype[band(mode, 31)]\r\n    s = irtype[band(shr(mode, 5), 31)]..\".\"..s\r\n    if band(mode, 0x800) ~= 0 then s = s..\" sext\" end\r\n    local c = shr(mode, 14)\r\n    if c == 2 then s = s..\" index\" elseif c == 3 then s = s..\" check\" end\r\n    t[mode] = s\r\n    return s\r\n  end}),\r\n  [\"FLOAD \"] = vmdef.irfield,\r\n  [\"FREF  \"] = vmdef.irfield,\r\n  [\"FPMATH\"] = vmdef.irfpm,\r\n  [\"BUFHDR\"] = { [0] = \"RESET\", \"APPEND\" },\r\n  [\"TOSTR \"] = { [0] = \"INT\", \"NUM\", \"CHAR\" },\r\n}\r\n\r\nlocal function ctlsub(c)\r\n  if c == \"\\n\" then return \"\\\\n\"\r\n  elseif c == \"\\r\" then return \"\\\\r\"\r\n  elseif c == \"\\t\" then return \"\\\\t\"\r\n  else return format(\"\\\\%03d\", byte(c))\r\n  end\r\nend\r\n\r\nlocal function fmtfunc(func, pc)\r\n  local fi = funcinfo(func, pc)\r\n  if fi.loc then\r\n    return fi.loc\r\n  elseif fi.ffid then\r\n    return vmdef.ffnames[fi.ffid]\r\n  elseif fi.addr then\r\n    return format(\"C:%x\", fi.addr)\r\n  else\r\n    return \"(?)\"\r\n  end\r\nend\r\n\r\nlocal function formatk(tr, idx)\r\n  local k, t, slot = tracek(tr, idx)\r\n  local tn = type(k)\r\n  local s\r\n  if tn == \"number\" then\r\n    if k == 2^52+2^51 then\r\n      s = \"bias\"\r\n    else\r\n      s = format(\"%+.14g\", k)\r\n    end\r\n  elseif tn == \"string\" then\r\n    s = format(#k > 20 and '\"%.20s\"~' or '\"%s\"', gsub(k, \"%c\", ctlsub))\r\n  elseif tn == \"function\" then\r\n    s = fmtfunc(k)\r\n  elseif tn == \"table\" then\r\n    s = format(\"{%p}\", k)\r\n  elseif tn == \"userdata\" then\r\n    if t == 12 then\r\n      s = format(\"userdata:%p\", k)\r\n    else\r\n      s = format(\"[%p]\", k)\r\n      if s == \"[0x00000000]\" then s = \"NULL\" end\r\n    end\r\n  elseif t == 21 then -- int64_t\r\n    s = sub(tostring(k), 1, -3)\r\n    if sub(s, 1, 1) ~= \"-\" then s = \"+\"..s end\r\n  else\r\n    s = tostring(k) -- For primitives.\r\n  end\r\n  s = colorize(format(\"%-4s\", s), t)\r\n  if slot then\r\n    s = format(\"%s @%d\", s, slot)\r\n  end\r\n  return s\r\nend\r\n\r\nlocal function printsnap(tr, snap)\r\n  local n = 2\r\n  for s=0,snap[1]-1 do\r\n    local sn = snap[n]\r\n    if shr(sn, 24) == s then\r\n      n = n + 1\r\n      local ref = band(sn, 0xffff) - 0x8000 -- REF_BIAS\r\n      if ref < 0 then\r\n\tout:write(formatk(tr, ref))\r\n      elseif band(sn, 0x80000) ~= 0 then -- SNAP_SOFTFPNUM\r\n\tout:write(colorize(format(\"%04d/%04d\", ref, ref+1), 14))\r\n      else\r\n\tlocal m, ot, op1, op2 = traceir(tr, ref)\r\n\tout:write(colorize(format(\"%04d\", ref), band(ot, 31)))\r\n      end\r\n      out:write(band(sn, 0x10000) == 0 and \" \" or \"|\") -- SNAP_FRAME\r\n    else\r\n      out:write(\"---- \")\r\n    end\r\n  end\r\n  out:write(\"]\\n\")\r\nend\r\n\r\n-- Dump snapshots (not interleaved with IR).\r\nlocal function dump_snap(tr)\r\n  out:write(\"---- TRACE \", tr, \" snapshots\\n\")\r\n  for i=0,1000000000 do\r\n    local snap = tracesnap(tr, i)\r\n    if not snap then break end\r\n    out:write(format(\"#%-3d %04d [ \", i, snap[0]))\r\n    printsnap(tr, snap)\r\n  end\r\nend\r\n\r\n-- Return a register name or stack slot for a rid/sp location.\r\nlocal function ridsp_name(ridsp, ins)\r\n  if not disass then disass = require(\"jit.dis_\"..jit.arch) end\r\n  local rid, slot = band(ridsp, 0xff), shr(ridsp, 8)\r\n  if rid == 253 or rid == 254 then\r\n    return (slot == 0 or slot == 255) and \" {sink\" or format(\" {%04d\", ins-slot)\r\n  end\r\n  if ridsp > 255 then return format(\"[%x]\", slot*4) end\r\n  if rid < 128 then return disass.regname(rid) end\r\n  return \"\"\r\nend\r\n\r\n-- Dump CALL* function ref and return optional ctype.\r\nlocal function dumpcallfunc(tr, ins)\r\n  local ctype\r\n  if ins > 0 then\r\n    local m, ot, op1, op2 = traceir(tr, ins)\r\n    if band(ot, 31) == 0 then -- nil type means CARG(func, ctype).\r\n      ins = op1\r\n      ctype = formatk(tr, op2)\r\n    end\r\n  end\r\n  if ins < 0 then\r\n    out:write(format(\"[0x%x](\", tonumber((tracek(tr, ins)))))\r\n  else\r\n    out:write(format(\"%04d (\", ins))\r\n  end\r\n  return ctype\r\nend\r\n\r\n-- Recursively gather CALL* args and dump them.\r\nlocal function dumpcallargs(tr, ins)\r\n  if ins < 0 then\r\n    out:write(formatk(tr, ins))\r\n  else\r\n    local m, ot, op1, op2 = traceir(tr, ins)\r\n    local oidx = 6*shr(ot, 8)\r\n    local op = sub(vmdef.irnames, oidx+1, oidx+6)\r\n    if op == \"CARG  \" then\r\n      dumpcallargs(tr, op1)\r\n      if op2 < 0 then\r\n\tout:write(\" \", formatk(tr, op2))\r\n      else\r\n\tout:write(\" \", format(\"%04d\", op2))\r\n      end\r\n    else\r\n      out:write(format(\"%04d\", ins))\r\n    end\r\n  end\r\nend\r\n\r\n-- Dump IR and interleaved snapshots.\r\nlocal function dump_ir(tr, dumpsnap, dumpreg)\r\n  local info = traceinfo(tr)\r\n  if not info then return end\r\n  local nins = info.nins\r\n  out:write(\"---- TRACE \", tr, \" IR\\n\")\r\n  local irnames = vmdef.irnames\r\n  local snapref = 65536\r\n  local snap, snapno\r\n  if dumpsnap then\r\n    snap = tracesnap(tr, 0)\r\n    snapref = snap[0]\r\n    snapno = 0\r\n  end\r\n  for ins=1,nins do\r\n    if ins >= snapref then\r\n      if dumpreg then\r\n\tout:write(format(\"....              SNAP   #%-3d [ \", snapno))\r\n      else\r\n\tout:write(format(\"....        SNAP   #%-3d [ \", snapno))\r\n      end\r\n      printsnap(tr, snap)\r\n      snapno = snapno + 1\r\n      snap = tracesnap(tr, snapno)\r\n      snapref = snap and snap[0] or 65536\r\n    end\r\n    local m, ot, op1, op2, ridsp = traceir(tr, ins)\r\n    local oidx, t = 6*shr(ot, 8), band(ot, 31)\r\n    local op = sub(irnames, oidx+1, oidx+6)\r\n    if op == \"LOOP  \" then\r\n      if dumpreg then\r\n\tout:write(format(\"%04d ------------ LOOP ------------\\n\", ins))\r\n      else\r\n\tout:write(format(\"%04d ------ LOOP ------------\\n\", ins))\r\n      end\r\n    elseif op ~= \"NOP   \" and op ~= \"CARG  \" and\r\n\t   (dumpreg or op ~= \"RENAME\") then\r\n      local rid = band(ridsp, 255)\r\n      if dumpreg then\r\n\tout:write(format(\"%04d %-6s\", ins, ridsp_name(ridsp, ins)))\r\n      else\r\n\tout:write(format(\"%04d \", ins))\r\n      end\r\n      out:write(format(\"%s%s %s %s \",\r\n\t\t       (rid == 254 or rid == 253) and \"}\" or\r\n\t\t       (band(ot, 128) == 0 and \" \" or \">\"),\r\n\t\t       band(ot, 64) == 0 and \" \" or \"+\",\r\n\t\t       irtype[t], op))\r\n      local m1, m2 = band(m, 3), band(m, 3*4)\r\n      if sub(op, 1, 4) == \"CALL\" then\r\n\tlocal ctype\r\n\tif m2 == 1*4 then -- op2 == IRMlit\r\n\t  out:write(format(\"%-10s  (\", vmdef.ircall[op2]))\r\n\telse\r\n\t  ctype = dumpcallfunc(tr, op2)\r\n\tend\r\n\tif op1 ~= -1 then dumpcallargs(tr, op1) end\r\n\tout:write(\")\")\r\n\tif ctype then out:write(\" ctype \", ctype) end\r\n      elseif op == \"CNEW  \" and op2 == -1 then\r\n\tout:write(formatk(tr, op1))\r\n      elseif m1 ~= 3 then -- op1 != IRMnone\r\n\tif op1 < 0 then\r\n\t  out:write(formatk(tr, op1))\r\n\telse\r\n\t  out:write(format(m1 == 0 and \"%04d\" or \"#%-3d\", op1))\r\n\tend\r\n\tif m2 ~= 3*4 then -- op2 != IRMnone\r\n\t  if m2 == 1*4 then -- op2 == IRMlit\r\n\t    local litn = litname[op]\r\n\t    if litn and litn[op2] then\r\n\t      out:write(\"  \", litn[op2])\r\n\t    elseif op == \"UREFO \" or op == \"UREFC \" then\r\n\t      out:write(format(\"  #%-3d\", shr(op2, 8)))\r\n\t    else\r\n\t      out:write(format(\"  #%-3d\", op2))\r\n\t    end\r\n\t  elseif op2 < 0 then\r\n\t    out:write(\"  \", formatk(tr, op2))\r\n\t  else\r\n\t    out:write(format(\"  %04d\", op2))\r\n\t  end\r\n\tend\r\n      end\r\n      out:write(\"\\n\")\r\n    end\r\n  end\r\n  if snap then\r\n    if dumpreg then\r\n      out:write(format(\"....              SNAP   #%-3d [ \", snapno))\r\n    else\r\n      out:write(format(\"....        SNAP   #%-3d [ \", snapno))\r\n    end\r\n    printsnap(tr, snap)\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal recprefix = \"\"\r\nlocal recdepth = 0\r\n\r\n-- Format trace error message.\r\nlocal function fmterr(err, info)\r\n  if type(err) == \"number\" then\r\n    if type(info) == \"function\" then info = fmtfunc(info) end\r\n    err = format(vmdef.traceerr[err], info)\r\n  end\r\n  return err\r\nend\r\n\r\n-- Dump trace states.\r\nlocal function dump_trace(what, tr, func, pc, otr, oex)\r\n  if what == \"stop\" or (what == \"abort\" and dumpmode.a) then\r\n    if dumpmode.i then dump_ir(tr, dumpmode.s, dumpmode.r and what == \"stop\")\r\n    elseif dumpmode.s then dump_snap(tr) end\r\n    if dumpmode.m then dump_mcode(tr) end\r\n  end\r\n  if what == \"start\" then\r\n    if dumpmode.H then out:write('<pre class=\"ljdump\">\\n') end\r\n    out:write(\"---- TRACE \", tr, \" \", what)\r\n    if otr then out:write(\" \", otr, \"/\", oex) end\r\n    out:write(\" \", fmtfunc(func, pc), \"\\n\")\r\n  elseif what == \"stop\" or what == \"abort\" then\r\n    out:write(\"---- TRACE \", tr, \" \", what)\r\n    if what == \"abort\" then\r\n      out:write(\" \", fmtfunc(func, pc), \" -- \", fmterr(otr, oex), \"\\n\")\r\n    else\r\n      local info = traceinfo(tr)\r\n      local link, ltype = info.link, info.linktype\r\n      if link == tr or link == 0 then\r\n\tout:write(\" -> \", ltype, \"\\n\")\r\n      elseif ltype == \"root\" then\r\n\tout:write(\" -> \", link, \"\\n\")\r\n      else\r\n\tout:write(\" -> \", link, \" \", ltype, \"\\n\")\r\n      end\r\n    end\r\n    if dumpmode.H then out:write(\"</pre>\\n\\n\") else out:write(\"\\n\") end\r\n  else\r\n    out:write(\"---- TRACE \", what, \"\\n\\n\")\r\n  end\r\n  out:flush()\r\nend\r\n\r\n-- Dump recorded bytecode.\r\nlocal function dump_record(tr, func, pc, depth, callee)\r\n  if depth ~= recdepth then\r\n    recdepth = depth\r\n    recprefix = rep(\" .\", depth)\r\n  end\r\n  local line\r\n  if pc >= 0 then\r\n    line = bcline(func, pc, recprefix)\r\n    if dumpmode.H then line = gsub(line, \"[<>&]\", html_escape) end\r\n  else\r\n    line = \"0000 \"..recprefix..\" FUNCC      \\n\"\r\n    callee = func\r\n  end\r\n  if pc <= 0 then\r\n    out:write(sub(line, 1, -2), \"         ; \", fmtfunc(func), \"\\n\")\r\n  else\r\n    out:write(line)\r\n  end\r\n  if pc >= 0 and band(funcbc(func, pc), 0xff) < 16 then -- ORDER BC\r\n    out:write(bcline(func, pc+1, recprefix)) -- Write JMP for cond.\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Dump taken trace exits.\r\nlocal function dump_texit(tr, ex, ngpr, nfpr, ...)\r\n  out:write(\"---- TRACE \", tr, \" exit \", ex, \"\\n\")\r\n  if dumpmode.X then\r\n    local regs = {...}\r\n    if jit.arch == \"x64\" then\r\n      for i=1,ngpr do\r\n\tout:write(format(\" %016x\", regs[i]))\r\n\tif i % 4 == 0 then out:write(\"\\n\") end\r\n      end\r\n    else\r\n      for i=1,ngpr do\r\n\tout:write(\" \", tohex(regs[i]))\r\n\tif i % 8 == 0 then out:write(\"\\n\") end\r\n      end\r\n    end\r\n    if jit.arch == \"mips\" or jit.arch == \"mipsel\" then\r\n      for i=1,nfpr,2 do\r\n\tout:write(format(\" %+17.14g\", regs[ngpr+i]))\r\n\tif i % 8 == 7 then out:write(\"\\n\") end\r\n      end\r\n    else\r\n      for i=1,nfpr do\r\n\tout:write(format(\" %+17.14g\", regs[ngpr+i]))\r\n\tif i % 4 == 0 then out:write(\"\\n\") end\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Detach dump handlers.\r\nlocal function dumpoff()\r\n  if active then\r\n    active = false\r\n    jit.attach(dump_texit)\r\n    jit.attach(dump_record)\r\n    jit.attach(dump_trace)\r\n    if out and out ~= stdout and out ~= stderr then out:close() end\r\n    out = nil\r\n  end\r\nend\r\n\r\n-- Open the output file and attach dump handlers.\r\nlocal function dumpon(opt, outfile)\r\n  if active then dumpoff() end\r\n\r\n  local colormode = os.getenv(\"COLORTERM\") and \"A\" or \"T\"\r\n  if opt then\r\n    opt = gsub(opt, \"[TAH]\", function(mode) colormode = mode; return \"\"; end)\r\n  end\r\n\r\n  local m = { t=true, b=true, i=true, m=true, }\r\n  if opt and opt ~= \"\" then\r\n    local o = sub(opt, 1, 1)\r\n    if o ~= \"+\" and o ~= \"-\" then m = {} end\r\n    for i=1,#opt do m[sub(opt, i, i)] = (o ~= \"-\") end\r\n  end\r\n  dumpmode = m\r\n\r\n  if m.t or m.b or m.i or m.s or m.m then\r\n    jit.attach(dump_trace, \"trace\")\r\n  end\r\n  if m.b then\r\n    jit.attach(dump_record, \"record\")\r\n    if not bcline then bcline = require(\"jit.bc\").line end\r\n  end\r\n  if m.x or m.X then\r\n    jit.attach(dump_texit, \"texit\")\r\n  end\r\n\r\n  if not outfile then outfile = os.getenv(\"LUAJIT_DUMPFILE\") end\r\n  if outfile then\r\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\r\n  else\r\n    out = stdout\r\n  end\r\n\r\n  m[colormode] = true\r\n  if colormode == \"A\" then\r\n    colorize = colorize_ansi\r\n    irtype = irtype_ansi\r\n  elseif colormode == \"H\" then\r\n    colorize = colorize_html\r\n    irtype = irtype_html\r\n    out:write(header_html)\r\n  else\r\n    colorize = colorize_text\r\n    irtype = irtype_text\r\n  end\r\n\r\n  active = true\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  on = dumpon,\r\n  off = dumpoff,\r\n  start = dumpon -- For -j command line option.\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/p.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT profiler.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module is a simple command line interface to the built-in\r\n-- low-overhead profiler of LuaJIT.\r\n--\r\n-- The lower-level API of the profiler is accessible via the \"jit.profile\"\r\n-- module or the luaJIT_profile_* C API.\r\n--\r\n-- Example usage:\r\n--\r\n--   luajit -jp myapp.lua\r\n--   luajit -jp=s myapp.lua\r\n--   luajit -jp=-s myapp.lua\r\n--   luajit -jp=vl myapp.lua\r\n--   luajit -jp=G,profile.txt myapp.lua\r\n--\r\n-- The following dump features are available:\r\n--\r\n--   f  Stack dump: function name, otherwise module:line. Default mode.\r\n--   F  Stack dump: ditto, but always prepend module.\r\n--   l  Stack dump: module:line.\r\n--   <number> stack dump depth (callee < caller). Default: 1.\r\n--   -<number> Inverse stack dump depth (caller > callee).\r\n--   s  Split stack dump after first stack level. Implies abs(depth) >= 2.\r\n--   p  Show full path for module names.\r\n--   v  Show VM states. Can be combined with stack dumps, e.g. vf or fv.\r\n--   z  Show zones. Can be combined with stack dumps, e.g. zf or fz.\r\n--   r  Show raw sample counts. Default: show percentages.\r\n--   a  Annotate excerpts from source code files.\r\n--   A  Annotate complete source code files.\r\n--   G  Produce raw output suitable for graphical tools (e.g. flame graphs).\r\n--   m<number> Minimum sample percentage to be shown. Default: 3.\r\n--   i<number> Sampling interval in milliseconds. Default: 10.\r\n--\r\n----------------------------------------------------------------------------\r\n\r\n-- Cache some library functions and objects.\r\nlocal jit = require(\"jit\")\r\nassert(jit.version_num == 20100, \"LuaJIT core/library version mismatch\")\r\nlocal profile = require(\"jit.profile\")\r\nlocal vmdef = require(\"jit.vmdef\")\r\nlocal math = math\r\nlocal pairs, ipairs, tonumber, floor = pairs, ipairs, tonumber, math.floor\r\nlocal sort, format = table.sort, string.format\r\nlocal stdout = io.stdout\r\nlocal zone -- Load jit.zone module on demand.\r\n\r\n-- Output file handle.\r\nlocal out\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal prof_ud\r\nlocal prof_states, prof_split, prof_min, prof_raw, prof_fmt, prof_depth\r\nlocal prof_ann, prof_count1, prof_count2, prof_samples\r\n\r\nlocal map_vmmode = {\r\n  N = \"Compiled\",\r\n  I = \"Interpreted\",\r\n  C = \"C code\",\r\n  G = \"Garbage Collector\",\r\n  J = \"JIT Compiler\",\r\n}\r\n\r\n-- Profiler callback.\r\nlocal function prof_cb(th, samples, vmmode)\r\n  prof_samples = prof_samples + samples\r\n  local key_stack, key_stack2, key_state\r\n  -- Collect keys for sample.\r\n  if prof_states then\r\n    if prof_states == \"v\" then\r\n      key_state = map_vmmode[vmmode] or vmmode\r\n    else\r\n      key_state = zone:get() or \"(none)\"\r\n    end\r\n  end\r\n  if prof_fmt then\r\n    key_stack = profile.dumpstack(th, prof_fmt, prof_depth)\r\n    key_stack = key_stack:gsub(\"%[builtin#(%d+)%]\", function(x)\r\n      return vmdef.ffnames[tonumber(x)]\r\n    end)\r\n    if prof_split == 2 then\r\n      local k1, k2 = key_stack:match(\"(.-) [<>] (.*)\")\r\n      if k2 then key_stack, key_stack2 = k1, k2 end\r\n    elseif prof_split == 3 then\r\n      key_stack2 = profile.dumpstack(th, \"l\", 1)\r\n    end\r\n  end\r\n  -- Order keys.\r\n  local k1, k2\r\n  if prof_split == 1 then\r\n    if key_state then\r\n      k1 = key_state\r\n      if key_stack then k2 = key_stack end\r\n    end\r\n  elseif key_stack then\r\n    k1 = key_stack\r\n    if key_stack2 then k2 = key_stack2 elseif key_state then k2 = key_state end\r\n  end\r\n  -- Coalesce samples in one or two levels.\r\n  if k1 then\r\n    local t1 = prof_count1\r\n    t1[k1] = (t1[k1] or 0) + samples\r\n    if k2 then\r\n      local t2 = prof_count2\r\n      local t3 = t2[k1]\r\n      if not t3 then t3 = {}; t2[k1] = t3 end\r\n      t3[k2] = (t3[k2] or 0) + samples\r\n    end\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Show top N list.\r\nlocal function prof_top(count1, count2, samples, indent)\r\n  local t, n = {}, 0\r\n  for k, v in pairs(count1) do\r\n    n = n + 1\r\n    t[n] = k\r\n  end\r\n  sort(t, function(a, b) return count1[a] > count1[b] end)\r\n  for i=1,n do\r\n    local k = t[i]\r\n    local v = count1[k]\r\n    local pct = floor(v*100/samples + 0.5)\r\n    if pct < prof_min then break end\r\n    if not prof_raw then\r\n      out:write(format(\"%s%2d%%  %s\\n\", indent, pct, k))\r\n    elseif prof_raw == \"r\" then\r\n      out:write(format(\"%s%5d  %s\\n\", indent, v, k))\r\n    else\r\n      out:write(format(\"%s %d\\n\", k, v))\r\n    end\r\n    if count2 then\r\n      local r = count2[k]\r\n      if r then\r\n\tprof_top(r, nil, v, (prof_split == 3 or prof_split == 1) and \"  -- \" or\r\n\t\t\t    (prof_depth < 0 and \"  -> \" or \"  <- \"))\r\n      end\r\n    end\r\n  end\r\nend\r\n\r\n-- Annotate source code\r\nlocal function prof_annotate(count1, samples)\r\n  local files = {}\r\n  local ms = 0\r\n  for k, v in pairs(count1) do\r\n    local pct = floor(v*100/samples + 0.5)\r\n    ms = math.max(ms, v)\r\n    if pct >= prof_min then\r\n      local file, line = k:match(\"^(.*):(%d+)$\")\r\n      local fl = files[file]\r\n      if not fl then fl = {}; files[file] = fl; files[#files+1] = file end\r\n      line = tonumber(line)\r\n      fl[line] = prof_raw and v or pct\r\n    end\r\n  end\r\n  sort(files)\r\n  local fmtv, fmtn = \" %3d%% | %s\\n\", \"      | %s\\n\"\r\n  if prof_raw then\r\n    local n = math.max(5, math.ceil(math.log10(ms)))\r\n    fmtv = \"%\"..n..\"d | %s\\n\"\r\n    fmtn = (\" \"):rep(n)..\" | %s\\n\"\r\n  end\r\n  local ann = prof_ann\r\n  for _, file in ipairs(files) do\r\n    local f0 = file:byte()\r\n    if f0 == 40 or f0 == 91 then\r\n      out:write(format(\"\\n====== %s ======\\n[Cannot annotate non-file]\\n\", file))\r\n      break\r\n    end\r\n    local fp, err = io.open(file)\r\n    if not fp then\r\n      out:write(format(\"====== ERROR: %s: %s\\n\", file, err))\r\n      break\r\n    end\r\n    out:write(format(\"\\n====== %s ======\\n\", file))\r\n    local fl = files[file]\r\n    local n, show = 1, false\r\n    if ann ~= 0 then\r\n      for i=1,ann do\r\n\tif fl[i] then show = true; out:write(\"@@ 1 @@\\n\"); break end\r\n      end\r\n    end\r\n    for line in fp:lines() do\r\n      if line:byte() == 27 then\r\n\tout:write(\"[Cannot annotate bytecode file]\\n\")\r\n\tbreak\r\n      end\r\n      local v = fl[n]\r\n      if ann ~= 0 then\r\n\tlocal v2 = fl[n+ann]\r\n\tif show then\r\n\t  if v2 then show = n+ann elseif v then show = n\r\n\t  elseif show+ann < n then show = false end\r\n\telseif v2 then\r\n\t  show = n+ann\r\n\t  out:write(format(\"@@ %d @@\\n\", n))\r\n\tend\r\n\tif not show then goto next end\r\n      end\r\n      if v then\r\n\tout:write(format(fmtv, v, line))\r\n      else\r\n\tout:write(format(fmtn, line))\r\n      end\r\n    ::next::\r\n      n = n + 1\r\n    end\r\n    fp:close()\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Finish profiling and dump result.\r\nlocal function prof_finish()\r\n  if prof_ud then\r\n    profile.stop()\r\n    local samples = prof_samples\r\n    if samples == 0 then\r\n      if prof_raw ~= true then out:write(\"[No samples collected]\\n\") end\r\n      return\r\n    end\r\n    if prof_ann then\r\n      prof_annotate(prof_count1, samples)\r\n    else\r\n      prof_top(prof_count1, prof_count2, samples, \"\")\r\n    end\r\n    prof_count1 = nil\r\n    prof_count2 = nil\r\n    prof_ud = nil\r\n  end\r\nend\r\n\r\n-- Start profiling.\r\nlocal function prof_start(mode)\r\n  local interval = \"\"\r\n  mode = mode:gsub(\"i%d*\", function(s) interval = s; return \"\" end)\r\n  prof_min = 3\r\n  mode = mode:gsub(\"m(%d+)\", function(s) prof_min = tonumber(s); return \"\" end)\r\n  prof_depth = 1\r\n  mode = mode:gsub(\"%-?%d+\", function(s) prof_depth = tonumber(s); return \"\" end)\r\n  local m = {}\r\n  for c in mode:gmatch(\".\") do m[c] = c end\r\n  prof_states = m.z or m.v\r\n  if prof_states == \"z\" then zone = require(\"jit.zone\") end\r\n  local scope = m.l or m.f or m.F or (prof_states and \"\" or \"f\")\r\n  local flags = (m.p or \"\")\r\n  prof_raw = m.r\r\n  if m.s then\r\n    prof_split = 2\r\n    if prof_depth == -1 or m[\"-\"] then prof_depth = -2\r\n    elseif prof_depth == 1 then prof_depth = 2 end\r\n  elseif mode:find(\"[fF].*l\") then\r\n    scope = \"l\"\r\n    prof_split = 3\r\n  else\r\n    prof_split = (scope == \"\" or mode:find(\"[zv].*[lfF]\")) and 1 or 0\r\n  end\r\n  prof_ann = m.A and 0 or (m.a and 3)\r\n  if prof_ann then\r\n    scope = \"l\"\r\n    prof_fmt = \"pl\"\r\n    prof_split = 0\r\n    prof_depth = 1\r\n  elseif m.G and scope ~= \"\" then\r\n    prof_fmt = flags..scope..\"Z;\"\r\n    prof_depth = -100\r\n    prof_raw = true\r\n    prof_min = 0\r\n  elseif scope == \"\" then\r\n    prof_fmt = false\r\n  else\r\n    local sc = prof_split == 3 and m.f or m.F or scope\r\n    prof_fmt = flags..sc..(prof_depth >= 0 and \"Z < \" or \"Z > \")\r\n  end\r\n  prof_count1 = {}\r\n  prof_count2 = {}\r\n  prof_samples = 0\r\n  profile.start(scope:lower()..interval, prof_cb)\r\n  prof_ud = newproxy(true)\r\n  getmetatable(prof_ud).__gc = prof_finish\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal function start(mode, outfile)\r\n  if not outfile then outfile = os.getenv(\"LUAJIT_PROFILEFILE\") end\r\n  if outfile then\r\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\r\n  else\r\n    out = stdout\r\n  end\r\n  prof_start(mode or \"f\")\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  start = start, -- For -j command line option.\r\n  stop = prof_finish\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/v.lua",
    "content": "----------------------------------------------------------------------------\r\n-- Verbose mode of the LuaJIT compiler.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module shows verbose information about the progress of the\r\n-- JIT compiler. It prints one line for each generated trace. This module\r\n-- is useful to see which code has been compiled or where the compiler\r\n-- punts and falls back to the interpreter.\r\n--\r\n-- Example usage:\r\n--\r\n--   luajit -jv -e \"for i=1,1000 do for j=1,1000 do end end\"\r\n--   luajit -jv=myapp.out myapp.lua\r\n--\r\n-- Default output is to stderr. To redirect the output to a file, pass a\r\n-- filename as an argument (use '-' for stdout) or set the environment\r\n-- variable LUAJIT_VERBOSEFILE. The file is overwritten every time the\r\n-- module is started.\r\n--\r\n-- The output from the first example should look like this:\r\n--\r\n-- [TRACE   1 (command line):1 loop]\r\n-- [TRACE   2 (1/3) (command line):1 -> 1]\r\n--\r\n-- The first number in each line is the internal trace number. Next are\r\n-- the file name ('(command line)') and the line number (':1') where the\r\n-- trace has started. Side traces also show the parent trace number and\r\n-- the exit number where they are attached to in parentheses ('(1/3)').\r\n-- An arrow at the end shows where the trace links to ('-> 1'), unless\r\n-- it loops to itself.\r\n--\r\n-- In this case the inner loop gets hot and is traced first, generating\r\n-- a root trace. Then the last exit from the 1st trace gets hot, too,\r\n-- and triggers generation of the 2nd trace. The side trace follows the\r\n-- path along the outer loop and *around* the inner loop, back to its\r\n-- start, and then links to the 1st trace. Yes, this may seem unusual,\r\n-- if you know how traditional compilers work. Trace compilers are full\r\n-- of surprises like this -- have fun! :-)\r\n--\r\n-- Aborted traces are shown like this:\r\n--\r\n-- [TRACE --- foo.lua:44 -- leaving loop in root trace at foo:lua:50]\r\n--\r\n-- Don't worry -- trace aborts are quite common, even in programs which\r\n-- can be fully compiled. The compiler may retry several times until it\r\n-- finds a suitable trace.\r\n--\r\n-- Of course this doesn't work with features that are not-yet-implemented\r\n-- (NYI error messages). The VM simply falls back to the interpreter. This\r\n-- may not matter at all if the particular trace is not very high up in\r\n-- the CPU usage profile. Oh, and the interpreter is quite fast, too.\r\n--\r\n-- Also check out the -jdump module, which prints all the gory details.\r\n--\r\n------------------------------------------------------------------------------\r\n\r\n-- Cache some library functions and objects.\r\nlocal jit = require(\"jit\")\r\nassert(jit.version_num == 20100, \"LuaJIT core/library version mismatch\")\r\nlocal jutil = require(\"jit.util\")\r\nlocal vmdef = require(\"jit.vmdef\")\r\nlocal funcinfo, traceinfo = jutil.funcinfo, jutil.traceinfo\r\nlocal type, format = type, string.format\r\nlocal stdout, stderr = io.stdout, io.stderr\r\n\r\n-- Active flag and output file handle.\r\nlocal active, out\r\n\r\n------------------------------------------------------------------------------\r\n\r\nlocal startloc, startex\r\n\r\nlocal function fmtfunc(func, pc)\r\n  local fi = funcinfo(func, pc)\r\n  if fi.loc then\r\n    return fi.loc\r\n  elseif fi.ffid then\r\n    return vmdef.ffnames[fi.ffid]\r\n  elseif fi.addr then\r\n    return format(\"C:%x\", fi.addr)\r\n  else\r\n    return \"(?)\"\r\n  end\r\nend\r\n\r\n-- Format trace error message.\r\nlocal function fmterr(err, info)\r\n  if type(err) == \"number\" then\r\n    if type(info) == \"function\" then info = fmtfunc(info) end\r\n    err = format(vmdef.traceerr[err], info)\r\n  end\r\n  return err\r\nend\r\n\r\n-- Dump trace states.\r\nlocal function dump_trace(what, tr, func, pc, otr, oex)\r\n  if what == \"start\" then\r\n    startloc = fmtfunc(func, pc)\r\n    startex = otr and \"(\"..otr..\"/\"..oex..\") \" or \"\"\r\n  else\r\n    if what == \"abort\" then\r\n      local loc = fmtfunc(func, pc)\r\n      if loc ~= startloc then\r\n\tout:write(format(\"[TRACE --- %s%s -- %s at %s]\\n\",\r\n\t  startex, startloc, fmterr(otr, oex), loc))\r\n      else\r\n\tout:write(format(\"[TRACE --- %s%s -- %s]\\n\",\r\n\t  startex, startloc, fmterr(otr, oex)))\r\n      end\r\n    elseif what == \"stop\" then\r\n      local info = traceinfo(tr)\r\n      local link, ltype = info.link, info.linktype\r\n      if ltype == \"interpreter\" then\r\n\tout:write(format(\"[TRACE %3s %s%s -- fallback to interpreter]\\n\",\r\n\t  tr, startex, startloc))\r\n      elseif ltype == \"stitch\" then\r\n\tout:write(format(\"[TRACE %3s %s%s %s %s]\\n\",\r\n\t  tr, startex, startloc, ltype, fmtfunc(func, pc)))\r\n      elseif link == tr or link == 0 then\r\n\tout:write(format(\"[TRACE %3s %s%s %s]\\n\",\r\n\t  tr, startex, startloc, ltype))\r\n      elseif ltype == \"root\" then\r\n\tout:write(format(\"[TRACE %3s %s%s -> %d]\\n\",\r\n\t  tr, startex, startloc, link))\r\n      else\r\n\tout:write(format(\"[TRACE %3s %s%s -> %d %s]\\n\",\r\n\t  tr, startex, startloc, link, ltype))\r\n      end\r\n    else\r\n      out:write(format(\"[TRACE %s]\\n\", what))\r\n    end\r\n    out:flush()\r\n  end\r\nend\r\n\r\n------------------------------------------------------------------------------\r\n\r\n-- Detach dump handlers.\r\nlocal function dumpoff()\r\n  if active then\r\n    active = false\r\n    jit.attach(dump_trace)\r\n    if out and out ~= stdout and out ~= stderr then out:close() end\r\n    out = nil\r\n  end\r\nend\r\n\r\n-- Open the output file and attach dump handlers.\r\nlocal function dumpon(outfile)\r\n  if active then dumpoff() end\r\n  if not outfile then outfile = os.getenv(\"LUAJIT_VERBOSEFILE\") end\r\n  if outfile then\r\n    out = outfile == \"-\" and stdout or assert(io.open(outfile, \"w\"))\r\n  else\r\n    out = stderr\r\n  end\r\n  jit.attach(dump_trace, \"trace\")\r\n  active = true\r\nend\r\n\r\n-- Public module functions.\r\nreturn {\r\n  on = dumpon,\r\n  off = dumpoff,\r\n  start = dumpon -- For -j command line option.\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/jit/zone.lua",
    "content": "----------------------------------------------------------------------------\r\n-- LuaJIT profiler zones.\r\n--\r\n-- Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n-- Released under the MIT license. See Copyright Notice in luajit.h\r\n----------------------------------------------------------------------------\r\n--\r\n-- This module implements a simple hierarchical zone model.\r\n--\r\n-- Example usage:\r\n--\r\n--   local zone = require(\"jit.zone\")\r\n--   zone(\"AI\")\r\n--   ...\r\n--     zone(\"A*\")\r\n--     ...\r\n--     print(zone:get()) --> \"A*\"\r\n--     ...\r\n--     zone()\r\n--   ...\r\n--   print(zone:get()) --> \"AI\"\r\n--   ...\r\n--   zone()\r\n--\r\n----------------------------------------------------------------------------\r\n\r\nlocal remove = table.remove\r\n\r\nreturn setmetatable({\r\n  flush = function(t)\r\n    for i=#t,1,-1 do t[i] = nil end\r\n  end,\r\n  get = function(t)\r\n    return t[#t]\r\n  end\r\n}, {\r\n  __call = function(t, zone)\r\n    if zone then\r\n      t[#t+1] = zone\r\n    else\r\n      return (assert(remove(t), \"empty zone stack\"))\r\n    end\r\n  end\r\n})\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lauxlib.h",
    "content": "/*\r\n** $Id: lauxlib.h,v 1.88.1.1 2007/12/27 13:02:25 roberto Exp $\r\n** Auxiliary functions for building Lua libraries\r\n** See Copyright Notice in lua.h\r\n*/\r\n\r\n\r\n#ifndef lauxlib_h\r\n#define lauxlib_h\r\n\r\n\r\n#include <stddef.h>\r\n#include <stdio.h>\r\n\r\n#include \"lua.h\"\r\n\r\n\r\n#define luaL_getn(L,i)          ((int)lua_objlen(L, i))\r\n#define luaL_setn(L,i,j)        ((void)0)  /* no op! */\r\n\r\n/* extra error code for `luaL_load' */\r\n#define LUA_ERRFILE     (LUA_ERRERR+1)\r\n\r\ntypedef struct luaL_Reg {\r\n  const char *name;\r\n  lua_CFunction func;\r\n} luaL_Reg;\r\n\r\nLUALIB_API void (luaL_openlib) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l, int nup);\r\nLUALIB_API void (luaL_register) (lua_State *L, const char *libname,\r\n                                const luaL_Reg *l);\r\nLUALIB_API int (luaL_getmetafield) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_callmeta) (lua_State *L, int obj, const char *e);\r\nLUALIB_API int (luaL_typerror) (lua_State *L, int narg, const char *tname);\r\nLUALIB_API int (luaL_argerror) (lua_State *L, int numarg, const char *extramsg);\r\nLUALIB_API const char *(luaL_checklstring) (lua_State *L, int numArg,\r\n                                                          size_t *l);\r\nLUALIB_API const char *(luaL_optlstring) (lua_State *L, int numArg,\r\n                                          const char *def, size_t *l);\r\nLUALIB_API lua_Number (luaL_checknumber) (lua_State *L, int numArg);\r\nLUALIB_API lua_Number (luaL_optnumber) (lua_State *L, int nArg, lua_Number def);\r\n\r\nLUALIB_API lua_Integer (luaL_checkinteger) (lua_State *L, int numArg);\r\nLUALIB_API lua_Integer (luaL_optinteger) (lua_State *L, int nArg,\r\n                                          lua_Integer def);\r\n\r\nLUALIB_API void (luaL_checkstack) (lua_State *L, int sz, const char *msg);\r\nLUALIB_API void (luaL_checktype) (lua_State *L, int narg, int t);\r\nLUALIB_API void (luaL_checkany) (lua_State *L, int narg);\r\n\r\nLUALIB_API int   (luaL_newmetatable) (lua_State *L, const char *tname);\r\nLUALIB_API void *(luaL_checkudata) (lua_State *L, int ud, const char *tname);\r\n\r\nLUALIB_API void (luaL_where) (lua_State *L, int lvl);\r\nLUALIB_API int (luaL_error) (lua_State *L, const char *fmt, ...);\r\n\r\nLUALIB_API int (luaL_checkoption) (lua_State *L, int narg, const char *def,\r\n                                   const char *const lst[]);\r\n\r\nLUALIB_API int (luaL_ref) (lua_State *L, int t);\r\nLUALIB_API void (luaL_unref) (lua_State *L, int t, int ref);\r\n\r\nLUALIB_API int (luaL_loadfile) (lua_State *L, const char *filename);\r\nLUALIB_API int (luaL_loadbuffer) (lua_State *L, const char *buff, size_t sz,\r\n                                  const char *name);\r\nLUALIB_API int (luaL_loadstring) (lua_State *L, const char *s);\r\n\r\nLUALIB_API lua_State *(luaL_newstate) (void);\r\n\r\n\r\nLUALIB_API const char *(luaL_gsub) (lua_State *L, const char *s, const char *p,\r\n                                                  const char *r);\r\n\r\nLUALIB_API const char *(luaL_findtable) (lua_State *L, int idx,\r\n                                         const char *fname, int szhint);\r\n\r\n/* From Lua 5.2. */\r\nLUALIB_API int luaL_fileresult(lua_State *L, int stat, const char *fname);\r\nLUALIB_API int luaL_execresult(lua_State *L, int stat);\r\nLUALIB_API int (luaL_loadfilex) (lua_State *L, const char *filename,\r\n\t\t\t\t const char *mode);\r\nLUALIB_API int (luaL_loadbufferx) (lua_State *L, const char *buff, size_t sz,\r\n\t\t\t\t   const char *name, const char *mode);\r\nLUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, const char *msg,\r\n\t\t\t\tint level);\r\n\r\n\r\n/*\r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define luaL_argcheck(L, cond,numarg,extramsg)\t\\\r\n\t\t((void)((cond) || luaL_argerror(L, (numarg), (extramsg))))\r\n#define luaL_checkstring(L,n)\t(luaL_checklstring(L, (n), NULL))\r\n#define luaL_optstring(L,n,d)\t(luaL_optlstring(L, (n), (d), NULL))\r\n#define luaL_checkint(L,n)\t((int)luaL_checkinteger(L, (n)))\r\n#define luaL_optint(L,n,d)\t((int)luaL_optinteger(L, (n), (d)))\r\n#define luaL_checklong(L,n)\t((long)luaL_checkinteger(L, (n)))\r\n#define luaL_optlong(L,n,d)\t((long)luaL_optinteger(L, (n), (d)))\r\n\r\n#define luaL_typename(L,i)\tlua_typename(L, lua_type(L,(i)))\r\n\r\n#define luaL_dofile(L, fn) \\\r\n\t(luaL_loadfile(L, fn) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_dostring(L, s) \\\r\n\t(luaL_loadstring(L, s) || lua_pcall(L, 0, LUA_MULTRET, 0))\r\n\r\n#define luaL_getmetatable(L,n)\t(lua_getfield(L, LUA_REGISTRYINDEX, (n)))\r\n\r\n#define luaL_opt(L,f,n,d)\t(lua_isnoneornil(L,(n)) ? (d) : f(L,(n)))\r\n\r\n/*\r\n** {======================================================\r\n** Generic Buffer manipulation\r\n** =======================================================\r\n*/\r\n\r\n\r\n\r\ntypedef struct luaL_Buffer {\r\n  char *p;\t\t\t/* current position in buffer */\r\n  int lvl;  /* number of strings in the stack (level) */\r\n  lua_State *L;\r\n  char buffer[LUAL_BUFFERSIZE];\r\n} luaL_Buffer;\r\n\r\n#define luaL_addchar(B,c) \\\r\n  ((void)((B)->p < ((B)->buffer+LUAL_BUFFERSIZE) || luaL_prepbuffer(B)), \\\r\n   (*(B)->p++ = (char)(c)))\r\n\r\n/* compatibility only */\r\n#define luaL_putchar(B,c)\tluaL_addchar(B,c)\r\n\r\n#define luaL_addsize(B,n)\t((B)->p += (n))\r\n\r\nLUALIB_API void (luaL_buffinit) (lua_State *L, luaL_Buffer *B);\r\nLUALIB_API char *(luaL_prepbuffer) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_addlstring) (luaL_Buffer *B, const char *s, size_t l);\r\nLUALIB_API void (luaL_addstring) (luaL_Buffer *B, const char *s);\r\nLUALIB_API void (luaL_addvalue) (luaL_Buffer *B);\r\nLUALIB_API void (luaL_pushresult) (luaL_Buffer *B);\r\n\r\n\r\n/* }====================================================== */\r\n\r\n\r\n/* compatibility with ref system */\r\n\r\n/* pre-defined references */\r\n#define LUA_NOREF       (-2)\r\n#define LUA_REFNIL      (-1)\r\n\r\n#define lua_ref(L,lock) ((lock) ? luaL_ref(L, LUA_REGISTRYINDEX) : \\\r\n      (lua_pushstring(L, \"unlocked references are obsolete\"), lua_error(L), 0))\r\n\r\n#define lua_unref(L,ref)        luaL_unref(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n#define lua_getref(L,ref)       lua_rawgeti(L, LUA_REGISTRYINDEX, (ref))\r\n\r\n\r\n#define luaL_reg\tluaL_Reg\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_aux.c",
    "content": "/*\r\n** Auxiliary library for the Lua/C API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major parts taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdarg.h>\r\n#include <stdio.h>\r\n\r\n#define lib_aux_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <sys/wait.h>\r\n#endif\r\n\r\n/* -- I/O error handling -------------------------------------------------- */\r\n\r\nLUALIB_API int luaL_fileresult(lua_State *L, int stat, const char *fname)\r\n{\r\n  if (stat) {\r\n    setboolV(L->top++, 1);\r\n    return 1;\r\n  } else {\r\n    int en = errno;  /* Lua API calls may change this value. */\r\n    setnilV(L->top++);\r\n    if (fname)\r\n      lua_pushfstring(L, \"%s: %s\", fname, strerror(en));\r\n    else\r\n      lua_pushfstring(L, \"%s\", strerror(en));\r\n    setintV(L->top++, en);\r\n    lj_trace_abort(G(L));\r\n    return 3;\r\n  }\r\n}\r\n\r\nLUALIB_API int luaL_execresult(lua_State *L, int stat)\r\n{\r\n  if (stat != -1) {\r\n#if LJ_TARGET_POSIX\r\n    if (WIFSIGNALED(stat)) {\r\n      stat = WTERMSIG(stat);\r\n      setnilV(L->top++);\r\n      lua_pushliteral(L, \"signal\");\r\n    } else {\r\n      if (WIFEXITED(stat))\r\n\tstat = WEXITSTATUS(stat);\r\n      if (stat == 0)\r\n\tsetboolV(L->top++, 1);\r\n      else\r\n\tsetnilV(L->top++);\r\n      lua_pushliteral(L, \"exit\");\r\n    }\r\n#else\r\n    if (stat == 0)\r\n      setboolV(L->top++, 1);\r\n    else\r\n      setnilV(L->top++);\r\n    lua_pushliteral(L, \"exit\");\r\n#endif\r\n    setintV(L->top++, stat);\r\n    return 3;\r\n  }\r\n  return luaL_fileresult(L, 0, NULL);\r\n}\r\n\r\n/* -- Module registration ------------------------------------------------- */\r\n\r\nLUALIB_API const char *luaL_findtable(lua_State *L, int idx,\r\n\t\t\t\t      const char *fname, int szhint)\r\n{\r\n  const char *e;\r\n  lua_pushvalue(L, idx);\r\n  do {\r\n    e = strchr(fname, '.');\r\n    if (e == NULL) e = fname + strlen(fname);\r\n    lua_pushlstring(L, fname, (size_t)(e - fname));\r\n    lua_rawget(L, -2);\r\n    if (lua_isnil(L, -1)) {  /* no such field? */\r\n      lua_pop(L, 1);  /* remove this nil */\r\n      lua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */\r\n      lua_pushlstring(L, fname, (size_t)(e - fname));\r\n      lua_pushvalue(L, -2);\r\n      lua_settable(L, -4);  /* set new table into field */\r\n    } else if (!lua_istable(L, -1)) {  /* field has a non-table value? */\r\n      lua_pop(L, 2);  /* remove table and value */\r\n      return fname;  /* return problematic part of the name */\r\n    }\r\n    lua_remove(L, -2);  /* remove previous table */\r\n    fname = e + 1;\r\n  } while (*e == '.');\r\n  return NULL;\r\n}\r\n\r\nstatic int libsize(const luaL_Reg *l)\r\n{\r\n  int size = 0;\r\n  for (; l->name; l++) size++;\r\n  return size;\r\n}\r\n\r\nLUALIB_API void luaL_openlib(lua_State *L, const char *libname,\r\n\t\t\t     const luaL_Reg *l, int nup)\r\n{\r\n  lj_lib_checkfpu(L);\r\n  if (libname) {\r\n    int size = libsize(l);\r\n    /* check whether lib already exists */\r\n    luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n    lua_getfield(L, -1, libname);  /* get _LOADED[libname] */\r\n    if (!lua_istable(L, -1)) {  /* not found? */\r\n      lua_pop(L, 1);  /* remove previous result */\r\n      /* try global variable (and create one if it does not exist) */\r\n      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, size) != NULL)\r\n\tlj_err_callerv(L, LJ_ERR_BADMODN, libname);\r\n      lua_pushvalue(L, -1);\r\n      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */\r\n    }\r\n    lua_remove(L, -2);  /* remove _LOADED table */\r\n    lua_insert(L, -(nup+1));  /* move library table to below upvalues */\r\n  }\r\n  for (; l->name; l++) {\r\n    int i;\r\n    for (i = 0; i < nup; i++)  /* copy upvalues to the top */\r\n      lua_pushvalue(L, -nup);\r\n    lua_pushcclosure(L, l->func, nup);\r\n    lua_setfield(L, -(nup+2), l->name);\r\n  }\r\n  lua_pop(L, nup);  /* remove upvalues */\r\n}\r\n\r\nLUALIB_API void luaL_register(lua_State *L, const char *libname,\r\n\t\t\t      const luaL_Reg *l)\r\n{\r\n  luaL_openlib(L, libname, l, 0);\r\n}\r\n\r\nLUALIB_API const char *luaL_gsub(lua_State *L, const char *s,\r\n\t\t\t\t const char *p, const char *r)\r\n{\r\n  const char *wild;\r\n  size_t l = strlen(p);\r\n  luaL_Buffer b;\r\n  luaL_buffinit(L, &b);\r\n  while ((wild = strstr(s, p)) != NULL) {\r\n    luaL_addlstring(&b, s, (size_t)(wild - s));  /* push prefix */\r\n    luaL_addstring(&b, r);  /* push replacement in place of pattern */\r\n    s = wild + l;  /* continue after `p' */\r\n  }\r\n  luaL_addstring(&b, s);  /* push last suffix */\r\n  luaL_pushresult(&b);\r\n  return lua_tostring(L, -1);\r\n}\r\n\r\n/* -- Buffer handling ----------------------------------------------------- */\r\n\r\n#define bufflen(B)\t((size_t)((B)->p - (B)->buffer))\r\n#define bufffree(B)\t((size_t)(LUAL_BUFFERSIZE - bufflen(B)))\r\n\r\nstatic int emptybuffer(luaL_Buffer *B)\r\n{\r\n  size_t l = bufflen(B);\r\n  if (l == 0)\r\n    return 0;  /* put nothing on stack */\r\n  lua_pushlstring(B->L, B->buffer, l);\r\n  B->p = B->buffer;\r\n  B->lvl++;\r\n  return 1;\r\n}\r\n\r\nstatic void adjuststack(luaL_Buffer *B)\r\n{\r\n  if (B->lvl > 1) {\r\n    lua_State *L = B->L;\r\n    int toget = 1;  /* number of levels to concat */\r\n    size_t toplen = lua_strlen(L, -1);\r\n    do {\r\n      size_t l = lua_strlen(L, -(toget+1));\r\n      if (!(B->lvl - toget + 1 >= LUA_MINSTACK/2 || toplen > l))\r\n\tbreak;\r\n      toplen += l;\r\n      toget++;\r\n    } while (toget < B->lvl);\r\n    lua_concat(L, toget);\r\n    B->lvl = B->lvl - toget + 1;\r\n  }\r\n}\r\n\r\nLUALIB_API char *luaL_prepbuffer(luaL_Buffer *B)\r\n{\r\n  if (emptybuffer(B))\r\n    adjuststack(B);\r\n  return B->buffer;\r\n}\r\n\r\nLUALIB_API void luaL_addlstring(luaL_Buffer *B, const char *s, size_t l)\r\n{\r\n  while (l--)\r\n    luaL_addchar(B, *s++);\r\n}\r\n\r\nLUALIB_API void luaL_addstring(luaL_Buffer *B, const char *s)\r\n{\r\n  luaL_addlstring(B, s, strlen(s));\r\n}\r\n\r\nLUALIB_API void luaL_pushresult(luaL_Buffer *B)\r\n{\r\n  emptybuffer(B);\r\n  lua_concat(B->L, B->lvl);\r\n  B->lvl = 1;\r\n}\r\n\r\nLUALIB_API void luaL_addvalue(luaL_Buffer *B)\r\n{\r\n  lua_State *L = B->L;\r\n  size_t vl;\r\n  const char *s = lua_tolstring(L, -1, &vl);\r\n  if (vl <= bufffree(B)) {  /* fit into buffer? */\r\n    memcpy(B->p, s, vl);  /* put it there */\r\n    B->p += vl;\r\n    lua_pop(L, 1);  /* remove from stack */\r\n  } else {\r\n    if (emptybuffer(B))\r\n      lua_insert(L, -2);  /* put buffer before new value */\r\n    B->lvl++;  /* add new value into B stack */\r\n    adjuststack(B);\r\n  }\r\n}\r\n\r\nLUALIB_API void luaL_buffinit(lua_State *L, luaL_Buffer *B)\r\n{\r\n  B->L = L;\r\n  B->p = B->buffer;\r\n  B->lvl = 0;\r\n}\r\n\r\n/* -- Reference management ------------------------------------------------ */\r\n\r\n#define FREELIST_REF\t0\r\n\r\n/* Convert a stack index to an absolute index. */\r\n#define abs_index(L, i) \\\r\n  ((i) > 0 || (i) <= LUA_REGISTRYINDEX ? (i) : lua_gettop(L) + (i) + 1)\r\n\r\nLUALIB_API int luaL_ref(lua_State *L, int t)\r\n{\r\n  int ref;\r\n  t = abs_index(L, t);\r\n  if (lua_isnil(L, -1)) {\r\n    lua_pop(L, 1);  /* remove from stack */\r\n    return LUA_REFNIL;  /* `nil' has a unique fixed reference */\r\n  }\r\n  lua_rawgeti(L, t, FREELIST_REF);  /* get first free element */\r\n  ref = (int)lua_tointeger(L, -1);  /* ref = t[FREELIST_REF] */\r\n  lua_pop(L, 1);  /* remove it from stack */\r\n  if (ref != 0) {  /* any free element? */\r\n    lua_rawgeti(L, t, ref);  /* remove it from list */\r\n    lua_rawseti(L, t, FREELIST_REF);  /* (t[FREELIST_REF] = t[ref]) */\r\n  } else {  /* no free elements */\r\n    ref = (int)lua_objlen(L, t);\r\n    ref++;  /* create new reference */\r\n  }\r\n  lua_rawseti(L, t, ref);\r\n  return ref;\r\n}\r\n\r\nLUALIB_API void luaL_unref(lua_State *L, int t, int ref)\r\n{\r\n  if (ref >= 0) {\r\n    t = abs_index(L, t);\r\n    lua_rawgeti(L, t, FREELIST_REF);\r\n    lua_rawseti(L, t, ref);  /* t[ref] = t[FREELIST_REF] */\r\n    lua_pushinteger(L, ref);\r\n    lua_rawseti(L, t, FREELIST_REF);  /* t[FREELIST_REF] = ref */\r\n  }\r\n}\r\n\r\n/* -- Default allocator and panic function -------------------------------- */\r\n\r\nstatic int panic(lua_State *L)\r\n{\r\n  const char *s = lua_tostring(L, -1);\r\n  fputs(\"PANIC: unprotected error in call to Lua API (\", stderr);\r\n  fputs(s ? s : \"?\", stderr);\r\n  fputc(')', stderr); fputc('\\n', stderr);\r\n  fflush(stderr);\r\n  return 0;\r\n}\r\n\r\n#ifdef LUAJIT_USE_SYSMALLOC\r\n\r\n#if LJ_64 && !defined(LUAJIT_USE_VALGRIND)\r\n#error \"Must use builtin allocator for 64 bit target\"\r\n#endif\r\n\r\nstatic void *mem_alloc(void *ud, void *ptr, size_t osize, size_t nsize)\r\n{\r\n  (void)ud;\r\n  (void)osize;\r\n  if (nsize == 0) {\r\n    free(ptr);\r\n    return NULL;\r\n  } else {\r\n    return realloc(ptr, nsize);\r\n  }\r\n}\r\n\r\nLUALIB_API lua_State *luaL_newstate(void)\r\n{\r\n  lua_State *L = lua_newstate(mem_alloc, NULL);\r\n  if (L) G(L)->panic = panic;\r\n  return L;\r\n}\r\n\r\n#else\r\n\r\n#include \"lj_alloc.h\"\r\n\r\nLUALIB_API lua_State *luaL_newstate(void)\r\n{\r\n  lua_State *L;\r\n  void *ud = lj_alloc_create();\r\n  if (ud == NULL) return NULL;\r\n#if LJ_64\r\n  L = lj_state_newstate(lj_alloc_f, ud);\r\n#else\r\n  L = lua_newstate(lj_alloc_f, ud);\r\n#endif\r\n  if (L) G(L)->panic = panic;\r\n  return L;\r\n}\r\n\r\n#if LJ_64\r\nLUA_API lua_State *lua_newstate(lua_Alloc f, void *ud)\r\n{\r\n  UNUSED(f); UNUSED(ud);\r\n  fputs(\"Must use luaL_newstate() for 64 bit target\\n\", stderr);\r\n  return NULL;\r\n}\r\n#endif\r\n\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_base.c",
    "content": "/*\r\n** Base and coroutine library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2011 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lib_base_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#endif\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- Base library: checks ------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_base\r\n\r\nLJLIB_ASM(assert)\t\tLJLIB_REC(.)\r\n{\r\n  GCstr *s;\r\n  lj_lib_checkany(L, 1);\r\n  s = lj_lib_optstr(L, 2);\r\n  if (s)\r\n    lj_err_callermsg(L, strdata(s));\r\n  else\r\n    lj_err_caller(L, LJ_ERR_ASSERT);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\n/* ORDER LJ_T */\r\nLJLIB_PUSH(\"nil\")\r\nLJLIB_PUSH(\"boolean\")\r\nLJLIB_PUSH(top-1)  /* boolean */\r\nLJLIB_PUSH(\"userdata\")\r\nLJLIB_PUSH(\"string\")\r\nLJLIB_PUSH(\"upval\")\r\nLJLIB_PUSH(\"thread\")\r\nLJLIB_PUSH(\"proto\")\r\nLJLIB_PUSH(\"function\")\r\nLJLIB_PUSH(\"trace\")\r\nLJLIB_PUSH(\"cdata\")\r\nLJLIB_PUSH(\"table\")\r\nLJLIB_PUSH(top-9)  /* userdata */\r\nLJLIB_PUSH(\"number\")\r\nLJLIB_ASM_(type)\t\tLJLIB_REC(.)\r\n/* Recycle the lj_lib_checkany(L, 1) from assert. */\r\n\r\n/* -- Base library: iterators --------------------------------------------- */\r\n\r\n/* This solves a circular dependency problem -- change FF_next_N as needed. */\r\nLJ_STATIC_ASSERT((int)FF_next == FF_next_N);\r\n\r\nLJLIB_ASM(next)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\n#if LJ_52 || LJ_HASFFI\r\nstatic int ffh_pairs(lua_State *L, MMS mm)\r\n{\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  cTValue *mo = lj_meta_lookup(L, o, mm);\r\n  if ((LJ_52 || tviscdata(o)) && !tvisnil(mo)) {\r\n    L->top = o+1;  /* Only keep one argument. */\r\n    copyTV(L, L->base-1-LJ_FR2, mo);  /* Replace callable. */\r\n    return FFH_TAILCALL;\r\n  } else {\r\n    if (!tvistab(o)) lj_err_argt(L, 1, LUA_TTABLE);\r\n    if (LJ_FR2) { copyTV(L, o-1, o); o--; }\r\n    setfuncV(L, o-1, funcV(lj_lib_upvalue(L, 1)));\r\n    if (mm == MM_pairs) setnilV(o+1); else setintV(o+1, 0);\r\n    return FFH_RES(3);\r\n  }\r\n}\r\n#else\r\n#define ffh_pairs(L, mm)\t(lj_lib_checktab(L, 1), FFH_UNREACHABLE)\r\n#endif\r\n\r\nLJLIB_PUSH(lastcl)\r\nLJLIB_ASM(pairs)\t\tLJLIB_REC(xpairs 0)\r\n{\r\n  return ffh_pairs(L, MM_pairs);\r\n}\r\n\r\nLJLIB_NOREGUV LJLIB_ASM(ipairs_aux)\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkint(L, 2);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nLJLIB_PUSH(lastcl)\r\nLJLIB_ASM(ipairs)\t\tLJLIB_REC(xpairs 1)\r\n{\r\n  return ffh_pairs(L, MM_ipairs);\r\n}\r\n\r\n/* -- Base library: getters and setters ----------------------------------- */\r\n\r\nLJLIB_ASM_(getmetatable)\tLJLIB_REC(.)\r\n/* Recycle the lj_lib_checkany(L, 1) from assert. */\r\n\r\nLJLIB_ASM(setmetatable)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCtab *mt = lj_lib_checktabornil(L, 2);\r\n  if (!tvisnil(lj_meta_lookup(L, L->base, MM_metatable)))\r\n    lj_err_caller(L, LJ_ERR_PROTMT);\r\n  setgcref(t->metatable, obj2gco(mt));\r\n  if (mt) { lj_gc_objbarriert(L, t, mt); }\r\n  settabV(L, L->base-1-LJ_FR2, t);\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_CF(getfenv)\t\tLJLIB_REC(.)\r\n{\r\n  GCfunc *fn;\r\n  cTValue *o = L->base;\r\n  if (!(o < L->top && tvisfunc(o))) {\r\n    int level = lj_lib_optint(L, 1, 1);\r\n    o = lj_debug_frame(L, level, &level);\r\n    if (o == NULL)\r\n      lj_err_arg(L, 1, LJ_ERR_INVLVL);\r\n    if (LJ_FR2) o--;\r\n  }\r\n  fn = &gcval(o)->fn;\r\n  settabV(L, L->top++, isluafunc(fn) ? tabref(fn->l.env) : tabref(L->env));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(setfenv)\r\n{\r\n  GCfunc *fn;\r\n  GCtab *t = lj_lib_checktab(L, 2);\r\n  cTValue *o = L->base;\r\n  if (!(o < L->top && tvisfunc(o))) {\r\n    int level = lj_lib_checkint(L, 1);\r\n    if (level == 0) {\r\n      /* NOBARRIER: A thread (i.e. L) is never black. */\r\n      setgcref(L->env, obj2gco(t));\r\n      return 0;\r\n    }\r\n    o = lj_debug_frame(L, level, &level);\r\n    if (o == NULL)\r\n      lj_err_arg(L, 1, LJ_ERR_INVLVL);\r\n    if (LJ_FR2) o--;\r\n  }\r\n  fn = &gcval(o)->fn;\r\n  if (!isluafunc(fn))\r\n    lj_err_caller(L, LJ_ERR_SETFENV);\r\n  setgcref(fn->l.env, obj2gco(t));\r\n  lj_gc_objbarrier(L, obj2gco(fn), t);\r\n  setfuncV(L, L->top++, fn);\r\n  return 1;\r\n}\r\n\r\nLJLIB_ASM(rawget)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkany(L, 2);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nLJLIB_CF(rawset)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checktab(L, 1);\r\n  lj_lib_checkany(L, 2);\r\n  L->top = 1+lj_lib_checkany(L, 3);\r\n  lua_rawset(L, 1);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(rawequal)\t\tLJLIB_REC(.)\r\n{\r\n  cTValue *o1 = lj_lib_checkany(L, 1);\r\n  cTValue *o2 = lj_lib_checkany(L, 2);\r\n  setboolV(L->top-1, lj_obj_equal(o1, o2));\r\n  return 1;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_CF(rawlen)\t\tLJLIB_REC(.)\r\n{\r\n  cTValue *o = L->base;\r\n  int32_t len;\r\n  if (L->top > o && tvisstr(o))\r\n    len = (int32_t)strV(o)->len;\r\n  else\r\n    len = (int32_t)lj_tab_len(lj_lib_checktab(L, 1));\r\n  setintV(L->top-1, len);\r\n  return 1;\r\n}\r\n#endif\r\n\r\nLJLIB_CF(unpack)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n, i = lj_lib_optint(L, 2, 1);\r\n  int32_t e = (L->base+3-1 < L->top && !tvisnil(L->base+3-1)) ?\r\n\t      lj_lib_checkint(L, 3) : (int32_t)lj_tab_len(t);\r\n  if (i > e) return 0;\r\n  n = e - i + 1;\r\n  if (n <= 0 || !lua_checkstack(L, n))\r\n    lj_err_caller(L, LJ_ERR_UNPACK);\r\n  do {\r\n    cTValue *tv = lj_tab_getint(t, i);\r\n    if (tv) {\r\n      copyTV(L, L->top++, tv);\r\n    } else {\r\n      setnilV(L->top++);\r\n    }\r\n  } while (i++ < e);\r\n  return n;\r\n}\r\n\r\nLJLIB_CF(select)\t\tLJLIB_REC(.)\r\n{\r\n  int32_t n = (int32_t)(L->top - L->base);\r\n  if (n >= 1 && tvisstr(L->base) && *strVdata(L->base) == '#') {\r\n    setintV(L->top-1, n-1);\r\n    return 1;\r\n  } else {\r\n    int32_t i = lj_lib_checkint(L, 1);\r\n    if (i < 0) i = n + i; else if (i > n) i = n;\r\n    if (i < 1)\r\n      lj_err_arg(L, 1, LJ_ERR_IDXRNG);\r\n    return n - i;\r\n  }\r\n}\r\n\r\n/* -- Base library: conversions ------------------------------------------- */\r\n\r\nLJLIB_ASM(tonumber)\t\tLJLIB_REC(.)\r\n{\r\n  int32_t base = lj_lib_optint(L, 2, 10);\r\n  if (base == 10) {\r\n    TValue *o = lj_lib_checkany(L, 1);\r\n    if (lj_strscan_numberobj(o)) {\r\n      copyTV(L, L->base-1-LJ_FR2, o);\r\n      return FFH_RES(1);\r\n    }\r\n#if LJ_HASFFI\r\n    if (tviscdata(o)) {\r\n      CTState *cts = ctype_cts(L);\r\n      CType *ct = lj_ctype_rawref(cts, cdataV(o)->ctypeid);\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      if (ctype_isnum(ct->info) || ctype_iscomplex(ct->info)) {\r\n\tif (LJ_DUALNUM && ctype_isinteger_or_bool(ct->info) &&\r\n\t    ct->size <= 4 && !(ct->size == 4 && (ct->info & CTF_UNSIGNED))) {\r\n\t  int32_t i;\r\n\t  lj_cconv_ct_tv(cts, ctype_get(cts, CTID_INT32), (uint8_t *)&i, o, 0);\r\n\t  setintV(L->base-1-LJ_FR2, i);\r\n\t  return FFH_RES(1);\r\n\t}\r\n\tlj_cconv_ct_tv(cts, ctype_get(cts, CTID_DOUBLE),\r\n\t\t       (uint8_t *)&(L->base-1-LJ_FR2)->n, o, 0);\r\n\treturn FFH_RES(1);\r\n      }\r\n    }\r\n#endif\r\n  } else {\r\n    const char *p = strdata(lj_lib_checkstr(L, 1));\r\n    char *ep;\r\n    unsigned long ul;\r\n    if (base < 2 || base > 36)\r\n      lj_err_arg(L, 2, LJ_ERR_BASERNG);\r\n    ul = strtoul(p, &ep, base);\r\n    if (p != ep) {\r\n      while (lj_char_isspace((unsigned char)(*ep))) ep++;\r\n      if (*ep == '\\0') {\r\n\tif (LJ_DUALNUM && LJ_LIKELY(ul < 0x80000000u))\r\n\t  setintV(L->base-1-LJ_FR2, (int32_t)ul);\r\n\telse\r\n\t  setnumV(L->base-1-LJ_FR2, (lua_Number)ul);\r\n\treturn FFH_RES(1);\r\n      }\r\n    }\r\n  }\r\n  setnilV(L->base-1-LJ_FR2);\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_ASM(tostring)\t\tLJLIB_REC(.)\r\n{\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  cTValue *mo;\r\n  L->top = o+1;  /* Only keep one argument. */\r\n  if (!tvisnil(mo = lj_meta_lookup(L, o, MM_tostring))) {\r\n    copyTV(L, L->base-1-LJ_FR2, mo);  /* Replace callable. */\r\n    return FFH_TAILCALL;\r\n  }\r\n  lj_gc_check(L);\r\n  setstrV(L, L->base-1-LJ_FR2, lj_strfmt_obj(L, L->base));\r\n  return FFH_RES(1);\r\n}\r\n\r\n/* -- Base library: throw and catch errors -------------------------------- */\r\n\r\nLJLIB_CF(error)\r\n{\r\n  int32_t level = lj_lib_optint(L, 2, 1);\r\n  lua_settop(L, 1);\r\n  if (lua_isstring(L, 1) && level > 0) {\r\n    luaL_where(L, level);\r\n    lua_pushvalue(L, 1);\r\n    lua_concat(L, 2);\r\n  }\r\n  return lua_error(L);\r\n}\r\n\r\nLJLIB_ASM(pcall)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  lj_lib_checkfunc(L, 2);  /* For xpcall only. */\r\n  return FFH_UNREACHABLE;\r\n}\r\nLJLIB_ASM_(xpcall)\t\tLJLIB_REC(.)\r\n\r\n/* -- Base library: load Lua code ----------------------------------------- */\r\n\r\nstatic int load_aux(lua_State *L, int status, int envarg)\r\n{\r\n  if (status == 0) {\r\n    if (tvistab(L->base+envarg-1)) {\r\n      GCfunc *fn = funcV(L->top-1);\r\n      GCtab *t = tabV(L->base+envarg-1);\r\n      setgcref(fn->c.env, obj2gco(t));\r\n      lj_gc_objbarrier(L, fn, t);\r\n    }\r\n    return 1;\r\n  } else {\r\n    setnilV(L->top-2);\r\n    return 2;\r\n  }\r\n}\r\n\r\nLJLIB_CF(loadfile)\r\n{\r\n  GCstr *fname = lj_lib_optstr(L, 1);\r\n  GCstr *mode = lj_lib_optstr(L, 2);\r\n  int status;\r\n  lua_settop(L, 3);  /* Ensure env arg exists. */\r\n  status = luaL_loadfilex(L, fname ? strdata(fname) : NULL,\r\n\t\t\t  mode ? strdata(mode) : NULL);\r\n  return load_aux(L, status, 3);\r\n}\r\n\r\nstatic const char *reader_func(lua_State *L, void *ud, size_t *size)\r\n{\r\n  UNUSED(ud);\r\n  luaL_checkstack(L, 2, \"too many nested functions\");\r\n  copyTV(L, L->top++, L->base);\r\n  lua_call(L, 0, 1);  /* Call user-supplied function. */\r\n  L->top--;\r\n  if (tvisnil(L->top)) {\r\n    *size = 0;\r\n    return NULL;\r\n  } else if (tvisstr(L->top) || tvisnumber(L->top)) {\r\n    copyTV(L, L->base+4, L->top);  /* Anchor string in reserved stack slot. */\r\n    return lua_tolstring(L, 5, size);\r\n  } else {\r\n    lj_err_caller(L, LJ_ERR_RDRSTR);\r\n    return NULL;\r\n  }\r\n}\r\n\r\nLJLIB_CF(load)\r\n{\r\n  GCstr *name = lj_lib_optstr(L, 2);\r\n  GCstr *mode = lj_lib_optstr(L, 3);\r\n  int status;\r\n  if (L->base < L->top && (tvisstr(L->base) || tvisnumber(L->base))) {\r\n    GCstr *s = lj_lib_checkstr(L, 1);\r\n    lua_settop(L, 4);  /* Ensure env arg exists. */\r\n    status = luaL_loadbufferx(L, strdata(s), s->len, strdata(name ? name : s),\r\n\t\t\t      mode ? strdata(mode) : NULL);\r\n  } else {\r\n    lj_lib_checkfunc(L, 1);\r\n    lua_settop(L, 5);  /* Reserve a slot for the string from the reader. */\r\n    status = lua_loadx(L, reader_func, NULL, name ? strdata(name) : \"=(load)\",\r\n\t\t       mode ? strdata(mode) : NULL);\r\n  }\r\n  return load_aux(L, status, 4);\r\n}\r\n\r\nLJLIB_CF(loadstring)\r\n{\r\n  return lj_cf_load(L);\r\n}\r\n\r\nLJLIB_CF(dofile)\r\n{\r\n  GCstr *fname = lj_lib_optstr(L, 1);\r\n  setnilV(L->top);\r\n  L->top = L->base+1;\r\n  if (luaL_loadfile(L, fname ? strdata(fname) : NULL) != 0)\r\n    lua_error(L);\r\n  lua_call(L, 0, LUA_MULTRET);\r\n  return (int)(L->top - L->base) - 1;\r\n}\r\n\r\n/* -- Base library: GC control -------------------------------------------- */\r\n\r\nLJLIB_CF(gcinfo)\r\n{\r\n  setintV(L->top++, (int32_t)(G(L)->gc.total >> 10));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(collectgarbage)\r\n{\r\n  int opt = lj_lib_checkopt(L, 1, LUA_GCCOLLECT,  /* ORDER LUA_GC* */\r\n    \"\\4stop\\7restart\\7collect\\5count\\1\\377\\4step\\10setpause\\12setstepmul\");\r\n  int32_t data = lj_lib_optint(L, 2, 0);\r\n  if (opt == LUA_GCCOUNT) {\r\n    setnumV(L->top, (lua_Number)G(L)->gc.total/1024.0);\r\n  } else {\r\n    int res = lua_gc(L, opt, data);\r\n    if (opt == LUA_GCSTEP)\r\n      setboolV(L->top, res);\r\n    else\r\n      setintV(L->top, res);\r\n  }\r\n  L->top++;\r\n  return 1;\r\n}\r\n\r\n/* -- Base library: miscellaneous functions ------------------------------- */\r\n\r\nLJLIB_PUSH(top-2)  /* Upvalue holds weak table. */\r\nLJLIB_CF(newproxy)\r\n{\r\n  lua_settop(L, 1);\r\n  lua_newuserdata(L, 0);\r\n  if (lua_toboolean(L, 1) == 0) {  /* newproxy(): without metatable. */\r\n    return 1;\r\n  } else if (lua_isboolean(L, 1)) {  /* newproxy(true): with metatable. */\r\n    lua_newtable(L);\r\n    lua_pushvalue(L, -1);\r\n    lua_pushboolean(L, 1);\r\n    lua_rawset(L, lua_upvalueindex(1));  /* Remember mt in weak table. */\r\n  } else {  /* newproxy(proxy): inherit metatable. */\r\n    int validproxy = 0;\r\n    if (lua_getmetatable(L, 1)) {\r\n      lua_rawget(L, lua_upvalueindex(1));\r\n      validproxy = lua_toboolean(L, -1);\r\n      lua_pop(L, 1);\r\n    }\r\n    if (!validproxy)\r\n      lj_err_arg(L, 1, LJ_ERR_NOPROXY);\r\n    lua_getmetatable(L, 1);\r\n  }\r\n  lua_setmetatable(L, 2);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(\"tostring\")\r\nLJLIB_CF(print)\r\n{\r\n  ptrdiff_t i, nargs = L->top - L->base;\r\n  cTValue *tv = lj_tab_getstr(tabref(L->env), strV(lj_lib_upvalue(L, 1)));\r\n  int shortcut;\r\n  if (tv && !tvisnil(tv)) {\r\n    copyTV(L, L->top++, tv);\r\n  } else {\r\n    setstrV(L, L->top++, strV(lj_lib_upvalue(L, 1)));\r\n    lua_gettable(L, LUA_GLOBALSINDEX);\r\n    tv = L->top-1;\r\n  }\r\n  shortcut = (tvisfunc(tv) && funcV(tv)->c.ffid == FF_tostring);\r\n  for (i = 0; i < nargs; i++) {\r\n    cTValue *o = &L->base[i];\r\n    char buf[STRFMT_MAXBUF_NUM];\r\n    const char *str;\r\n    size_t size;\r\n    MSize len;\r\n    if (shortcut && (str = lj_strfmt_wstrnum(buf, o, &len)) != NULL) {\r\n      size = len;\r\n    } else {\r\n      copyTV(L, L->top+1, o);\r\n      copyTV(L, L->top, L->top-1);\r\n      L->top += 2;\r\n      lua_call(L, 1, 1);\r\n      str = lua_tolstring(L, -1, &size);\r\n      if (!str)\r\n\tlj_err_caller(L, LJ_ERR_PRTOSTR);\r\n      L->top--;\r\n    }\r\n    if (i)\r\n      putchar('\\t');\r\n    fwrite(str, 1, size, stdout);\r\n  }\r\n  putchar('\\n');\r\n  return 0;\r\n}\r\n\r\nLJLIB_PUSH(top-3)\r\nLJLIB_SET(_VERSION)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- Coroutine library --------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_coroutine\r\n\r\nLJLIB_CF(coroutine_status)\r\n{\r\n  const char *s;\r\n  lua_State *co;\r\n  if (!(L->top > L->base && tvisthread(L->base)))\r\n    lj_err_arg(L, 1, LJ_ERR_NOCORO);\r\n  co = threadV(L->base);\r\n  if (co == L) s = \"running\";\r\n  else if (co->status == LUA_YIELD) s = \"suspended\";\r\n  else if (co->status != 0) s = \"dead\";\r\n  else if (co->base > tvref(co->stack)+1+LJ_FR2) s = \"normal\";\r\n  else if (co->top == co->base) s = \"dead\";\r\n  else s = \"suspended\";\r\n  lua_pushstring(L, s);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(coroutine_running)\r\n{\r\n#if LJ_52\r\n  int ismain = lua_pushthread(L);\r\n  setboolV(L->top++, ismain);\r\n  return 2;\r\n#else\r\n  if (lua_pushthread(L))\r\n    setnilV(L->top++);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(coroutine_create)\r\n{\r\n  lua_State *L1;\r\n  if (!(L->base < L->top && tvisfunc(L->base)))\r\n    lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  L1 = lua_newthread(L);\r\n  setfuncV(L, L1->top++, funcV(L->base));\r\n  return 1;\r\n}\r\n\r\nLJLIB_ASM(coroutine_yield)\r\n{\r\n  lj_err_caller(L, LJ_ERR_CYIELD);\r\n  return FFH_UNREACHABLE;\r\n}\r\n\r\nstatic int ffh_resume(lua_State *L, lua_State *co, int wrap)\r\n{\r\n  if (co->cframe != NULL || co->status > LUA_YIELD ||\r\n      (co->status == 0 && co->top == co->base)) {\r\n    ErrMsg em = co->cframe ? LJ_ERR_CORUN : LJ_ERR_CODEAD;\r\n    if (wrap) lj_err_caller(L, em);\r\n    setboolV(L->base-1-LJ_FR2, 0);\r\n    setstrV(L, L->base-LJ_FR2, lj_err_str(L, em));\r\n    return FFH_RES(2);\r\n  }\r\n  lj_state_growstack(co, (MSize)(L->top - L->base));\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(coroutine_resume)\r\n{\r\n  if (!(L->top > L->base && tvisthread(L->base)))\r\n    lj_err_arg(L, 1, LJ_ERR_NOCORO);\r\n  return ffh_resume(L, threadV(L->base), 0);\r\n}\r\n\r\nLJLIB_NOREG LJLIB_ASM(coroutine_wrap_aux)\r\n{\r\n  return ffh_resume(L, threadV(lj_lib_upvalue(L, 1)), 1);\r\n}\r\n\r\n/* Inline declarations. */\r\nLJ_ASMF void lj_ff_coroutine_wrap_aux(void);\r\n#if !(LJ_TARGET_MIPS && defined(ljamalg_c))\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L,\r\n\t\t\t\t\t\t\t  lua_State *co);\r\n#endif\r\n\r\n/* Error handler, called from assembler VM. */\r\nvoid LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L, lua_State *co)\r\n{\r\n  co->top--; copyTV(L, L->top, co->top); L->top++;\r\n  if (tvisstr(L->top-1))\r\n    lj_err_callermsg(L, strVdata(L->top-1));\r\n  else\r\n    lj_err_run(L);\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void setpc_wrap_aux(lua_State *L, GCfunc *fn);\r\n\r\nLJLIB_CF(coroutine_wrap)\r\n{\r\n  GCfunc *fn;\r\n  lj_cf_coroutine_create(L);\r\n  fn = lj_lib_pushcc(L, lj_ffh_coroutine_wrap_aux, FF_coroutine_wrap_aux, 1);\r\n  setpc_wrap_aux(L, fn);\r\n  return 1;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* Fix the PC of wrap_aux. Really ugly workaround. */\r\nstatic void setpc_wrap_aux(lua_State *L, GCfunc *fn)\r\n{\r\n  setmref(fn->c.pc, &L2GG(L)->bcff[lj_lib_init_coroutine[1]+2]);\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void newproxy_weaktable(lua_State *L)\r\n{\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  GCtab *t = lj_tab_new(L, 0, 1);\r\n  settabV(L, L->top++, t);\r\n  setgcref(t->metatable, obj2gco(t));\r\n  setstrV(L, lj_tab_setstr(L, t, lj_str_newlit(L, \"__mode\")),\r\n\t    lj_str_newlit(L, \"kv\"));\r\n  t->nomm = (uint8_t)(~(1u<<MM_mode));\r\n}\r\n\r\nLUALIB_API int luaopen_base(lua_State *L)\r\n{\r\n  /* NOBARRIER: Table and value are the same. */\r\n  GCtab *env = tabref(L->env);\r\n  settabV(L, lj_tab_setstr(L, env, lj_str_newlit(L, \"_G\")), env);\r\n  lua_pushliteral(L, LUA_VERSION);  /* top-3. */\r\n  newproxy_weaktable(L);  /* top-2. */\r\n  LJ_LIB_REG(L, \"_G\", base);\r\n  LJ_LIB_REG(L, LUA_COLIBNAME, coroutine);\r\n  return 2;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_bit.c",
    "content": "/*\r\n** Bit manipulation library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_bit_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_carith.h\"\r\n#endif\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_bit\r\n\r\n#if LJ_HASFFI\r\nstatic int bit_result64(lua_State *L, CTypeID id, uint64_t x)\r\n{\r\n  GCcdata *cd = lj_cdata_new_(L, id, 8);\r\n  *(uint64_t *)cdataptr(cd) = x;\r\n  setcdataV(L, L->base-1-LJ_FR2, cd);\r\n  return FFH_RES(1);\r\n}\r\n#else\r\nstatic int32_t bit_checkbit(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else {\r\n    int32_t i = lj_num2bit(numV(o));\r\n    if (LJ_DUALNUM) setintV(o, i);\r\n    return i;\r\n  }\r\n}\r\n#endif\r\n\r\nLJLIB_ASM(bit_tobit)\t\tLJLIB_REC(bit_tobit)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0;\r\n  setintV(L->base-1-LJ_FR2, (int32_t)lj_carith_check64(L, 1, &id));\r\n  return FFH_RES(1);\r\n#else\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n#endif\r\n}\r\n\r\nLJLIB_ASM(bit_bnot)\t\tLJLIB_REC(bit_unary IR_BNOT)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0;\r\n  uint64_t x = lj_carith_check64(L, 1, &id);\r\n  return id ? bit_result64(L, id, ~x) : FFH_RETRY;\r\n#else\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n#endif\r\n}\r\n\r\nLJLIB_ASM(bit_bswap)\t\tLJLIB_REC(bit_unary IR_BSWAP)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0;\r\n  uint64_t x = lj_carith_check64(L, 1, &id);\r\n  return id ? bit_result64(L, id, lj_bswap64(x)) : FFH_RETRY;\r\n#else\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n#endif\r\n}\r\n\r\nLJLIB_ASM(bit_lshift)\t\tLJLIB_REC(bit_shift IR_BSHL)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0, id2 = 0;\r\n  uint64_t x = lj_carith_check64(L, 1, &id);\r\n  int32_t sh = (int32_t)lj_carith_check64(L, 2, &id2);\r\n  if (id) {\r\n    x = lj_carith_shift64(x, sh, curr_func(L)->c.ffid - (int)FF_bit_lshift);\r\n    return bit_result64(L, id, x);\r\n  }\r\n  if (id2) setintV(L->base+1, sh);\r\n  return FFH_RETRY;\r\n#else\r\n  lj_lib_checknumber(L, 1);\r\n  bit_checkbit(L, 2);\r\n  return FFH_RETRY;\r\n#endif\r\n}\r\nLJLIB_ASM_(bit_rshift)\t\tLJLIB_REC(bit_shift IR_BSHR)\r\nLJLIB_ASM_(bit_arshift)\t\tLJLIB_REC(bit_shift IR_BSAR)\r\nLJLIB_ASM_(bit_rol)\t\tLJLIB_REC(bit_shift IR_BROL)\r\nLJLIB_ASM_(bit_ror)\t\tLJLIB_REC(bit_shift IR_BROR)\r\n\r\nLJLIB_ASM(bit_band)\t\tLJLIB_REC(bit_nary IR_BAND)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0;\r\n  TValue *o = L->base, *top = L->top;\r\n  int i = 0;\r\n  do { lj_carith_check64(L, ++i, &id); } while (++o < top);\r\n  if (id) {\r\n    CTState *cts = ctype_cts(L);\r\n    CType *ct = ctype_get(cts, id);\r\n    int op = curr_func(L)->c.ffid - (int)FF_bit_bor;\r\n    uint64_t x, y = op >= 0 ? 0 : ~(uint64_t)0;\r\n    o = L->base;\r\n    do {\r\n      lj_cconv_ct_tv(cts, ct, (uint8_t *)&x, o, 0);\r\n      if (op < 0) y &= x; else if (op == 0) y |= x; else y ^= x;\r\n    } while (++o < top);\r\n    return bit_result64(L, id, y);\r\n  }\r\n  return FFH_RETRY;\r\n#else\r\n  int i = 0;\r\n  do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top);\r\n  return FFH_RETRY;\r\n#endif\r\n}\r\nLJLIB_ASM_(bit_bor)\t\tLJLIB_REC(bit_nary IR_BOR)\r\nLJLIB_ASM_(bit_bxor)\t\tLJLIB_REC(bit_nary IR_BXOR)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(bit_tohex)\t\tLJLIB_REC(.)\r\n{\r\n#if LJ_HASFFI\r\n  CTypeID id = 0, id2 = 0;\r\n  uint64_t b = lj_carith_check64(L, 1, &id);\r\n  int32_t n = L->base+1>=L->top ? (id ? 16 : 8) :\r\n\t\t\t\t  (int32_t)lj_carith_check64(L, 2, &id2);\r\n#else\r\n  uint32_t b = (uint32_t)bit_checkbit(L, 1);\r\n  int32_t n = L->base+1>=L->top ? 8 : bit_checkbit(L, 2);\r\n#endif\r\n  SBuf *sb = lj_buf_tmp_(L);\r\n  SFormat sf = (STRFMT_UINT|STRFMT_T_HEX);\r\n  if (n < 0) { n = -n; sf |= STRFMT_F_UPPER; }\r\n  sf |= ((SFormat)((n+1)&255) << STRFMT_SH_PREC);\r\n#if LJ_HASFFI\r\n  if (n < 16) b &= ((uint64_t)1 << 4*n)-1;\r\n#else\r\n  if (n < 8) b &= (1u << 4*n)-1;\r\n#endif\r\n  sb = lj_strfmt_putfxint(sb, sf, b);\r\n  setstrV(L, L->top-1, lj_buf_str(L, sb));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_bit(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_BITLIBNAME, bit);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_debug.c",
    "content": "/*\r\n** Debug library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_debug_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_debug\r\n\r\nLJLIB_CF(debug_getregistry)\r\n{\r\n  copyTV(L, L->top++, registry(L));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_getmetatable)\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    setnilV(L->top-1);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setmetatable)\r\n{\r\n  lj_lib_checktabornil(L, 2);\r\n  L->top = L->base+2;\r\n  lua_setmetatable(L, 1);\r\n#if !LJ_52\r\n  setboolV(L->top-1, 1);\r\n#endif\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_getfenv)\r\n{\r\n  lj_lib_checkany(L, 1);\r\n  lua_getfenv(L, 1);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setfenv)\r\n{\r\n  lj_lib_checktab(L, 2);\r\n  L->top = L->base+2;\r\n  if (!lua_setfenv(L, 1))\r\n    lj_err_caller(L, LJ_ERR_SETFENV);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void settabss(lua_State *L, const char *i, const char *v)\r\n{\r\n  lua_pushstring(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic void settabsi(lua_State *L, const char *i, int v)\r\n{\r\n  lua_pushinteger(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic void settabsb(lua_State *L, const char *i, int v)\r\n{\r\n  lua_pushboolean(L, v);\r\n  lua_setfield(L, -2, i);\r\n}\r\n\r\nstatic lua_State *getthread(lua_State *L, int *arg)\r\n{\r\n  if (L->base < L->top && tvisthread(L->base)) {\r\n    *arg = 1;\r\n    return threadV(L->base);\r\n  } else {\r\n    *arg = 0;\r\n    return L;\r\n  }\r\n}\r\n\r\nstatic void treatstackoption(lua_State *L, lua_State *L1, const char *fname)\r\n{\r\n  if (L == L1) {\r\n    lua_pushvalue(L, -2);\r\n    lua_remove(L, -3);\r\n  }\r\n  else\r\n    lua_xmove(L1, L, 1);\r\n  lua_setfield(L, -2, fname);\r\n}\r\n\r\nLJLIB_CF(debug_getinfo)\r\n{\r\n  lj_Debug ar;\r\n  int arg, opt_f = 0, opt_L = 0;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  const char *options = luaL_optstring(L, arg+2, \"flnSu\");\r\n  if (lua_isnumber(L, arg+1)) {\r\n    if (!lua_getstack(L1, (int)lua_tointeger(L, arg+1), (lua_Debug *)&ar)) {\r\n      setnilV(L->top-1);\r\n      return 1;\r\n    }\r\n  } else if (L->base+arg < L->top && tvisfunc(L->base+arg)) {\r\n    options = lua_pushfstring(L, \">%s\", options);\r\n    setfuncV(L1, L1->top++, funcV(L->base+arg));\r\n  } else {\r\n    lj_err_arg(L, arg+1, LJ_ERR_NOFUNCL);\r\n  }\r\n  if (!lj_debug_getinfo(L1, options, &ar, 1))\r\n    lj_err_arg(L, arg+2, LJ_ERR_INVOPT);\r\n  lua_createtable(L, 0, 16);  /* Create result table. */\r\n  for (; *options; options++) {\r\n    switch (*options) {\r\n    case 'S':\r\n      settabss(L, \"source\", ar.source);\r\n      settabss(L, \"short_src\", ar.short_src);\r\n      settabsi(L, \"linedefined\", ar.linedefined);\r\n      settabsi(L, \"lastlinedefined\", ar.lastlinedefined);\r\n      settabss(L, \"what\", ar.what);\r\n      break;\r\n    case 'l':\r\n      settabsi(L, \"currentline\", ar.currentline);\r\n      break;\r\n    case 'u':\r\n      settabsi(L, \"nups\", ar.nups);\r\n      settabsi(L, \"nparams\", ar.nparams);\r\n      settabsb(L, \"isvararg\", ar.isvararg);\r\n      break;\r\n    case 'n':\r\n      settabss(L, \"name\", ar.name);\r\n      settabss(L, \"namewhat\", ar.namewhat);\r\n      break;\r\n    case 'f': opt_f = 1; break;\r\n    case 'L': opt_L = 1; break;\r\n    default: break;\r\n    }\r\n  }\r\n  if (opt_L) treatstackoption(L, L1, \"activelines\");\r\n  if (opt_f) treatstackoption(L, L1, \"func\");\r\n  return 1;  /* Return result table. */\r\n}\r\n\r\nLJLIB_CF(debug_getlocal)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  const char *name;\r\n  int slot = lj_lib_checkint(L, arg+2);\r\n  if (tvisfunc(L->base+arg)) {\r\n    L->top = L->base+arg+1;\r\n    lua_pushstring(L, lua_getlocal(L, NULL, slot));\r\n    return 1;\r\n  }\r\n  if (!lua_getstack(L1, lj_lib_checkint(L, arg+1), &ar))\r\n    lj_err_arg(L, arg+1, LJ_ERR_LVLRNG);\r\n  name = lua_getlocal(L1, &ar, slot);\r\n  if (name) {\r\n    lua_xmove(L1, L, 1);\r\n    lua_pushstring(L, name);\r\n    lua_pushvalue(L, -2);\r\n    return 2;\r\n  } else {\r\n    setnilV(L->top-1);\r\n    return 1;\r\n  }\r\n}\r\n\r\nLJLIB_CF(debug_setlocal)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  lua_Debug ar;\r\n  TValue *tv;\r\n  if (!lua_getstack(L1, lj_lib_checkint(L, arg+1), &ar))\r\n    lj_err_arg(L, arg+1, LJ_ERR_LVLRNG);\r\n  tv = lj_lib_checkany(L, arg+3);\r\n  copyTV(L1, L1->top++, tv);\r\n  lua_pushstring(L, lua_setlocal(L1, &ar, lj_lib_checkint(L, arg+2)));\r\n  return 1;\r\n}\r\n\r\nstatic int debug_getupvalue(lua_State *L, int get)\r\n{\r\n  int32_t n = lj_lib_checkint(L, 2);\r\n  const char *name;\r\n  lj_lib_checkfunc(L, 1);\r\n  name = get ? lua_getupvalue(L, 1, n) : lua_setupvalue(L, 1, n);\r\n  if (name) {\r\n    lua_pushstring(L, name);\r\n    if (!get) return 1;\r\n    copyTV(L, L->top, L->top-2);\r\n    L->top++;\r\n    return 2;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(debug_getupvalue)\r\n{\r\n  return debug_getupvalue(L, 1);\r\n}\r\n\r\nLJLIB_CF(debug_setupvalue)\r\n{\r\n  lj_lib_checkany(L, 3);\r\n  return debug_getupvalue(L, 0);\r\n}\r\n\r\nLJLIB_CF(debug_upvalueid)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  int32_t n = lj_lib_checkint(L, 2) - 1;\r\n  if ((uint32_t)n >= fn->l.nupvalues)\r\n    lj_err_arg(L, 2, LJ_ERR_IDXRNG);\r\n  setlightudV(L->top-1, isluafunc(fn) ? (void *)gcref(fn->l.uvptr[n]) :\r\n\t\t\t\t\t(void *)&fn->c.upvalue[n]);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_upvaluejoin)\r\n{\r\n  GCfunc *fn[2];\r\n  GCRef *p[2];\r\n  int i;\r\n  for (i = 0; i < 2; i++) {\r\n    int32_t n;\r\n    fn[i] = lj_lib_checkfunc(L, 2*i+1);\r\n    if (!isluafunc(fn[i]))\r\n      lj_err_arg(L, 2*i+1, LJ_ERR_NOLFUNC);\r\n    n = lj_lib_checkint(L, 2*i+2) - 1;\r\n    if ((uint32_t)n >= fn[i]->l.nupvalues)\r\n      lj_err_arg(L, 2*i+2, LJ_ERR_IDXRNG);\r\n    p[i] = &fn[i]->l.uvptr[n];\r\n  }\r\n  setgcrefr(*p[0], *p[1]);\r\n  lj_gc_objbarrier(L, fn[0], gcref(*p[1]));\r\n  return 0;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_CF(debug_getuservalue)\r\n{\r\n  TValue *o = L->base;\r\n  if (o < L->top && tvisudata(o))\r\n    settabV(L, o, tabref(udataV(o)->env));\r\n  else\r\n    setnilV(o);\r\n  L->top = o+1;\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(debug_setuservalue)\r\n{\r\n  TValue *o = L->base;\r\n  if (!(o < L->top && tvisudata(o)))\r\n    lj_err_argt(L, 1, LUA_TUSERDATA);\r\n  if (!(o+1 < L->top && tvistab(o+1)))\r\n    lj_err_argt(L, 2, LUA_TTABLE);\r\n  L->top = o+2;\r\n  lua_setfenv(L, 1);\r\n  return 1;\r\n}\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic const char KEY_HOOK = 'h';\r\n\r\nstatic void hookf(lua_State *L, lua_Debug *ar)\r\n{\r\n  static const char *const hooknames[] =\r\n    {\"call\", \"return\", \"line\", \"count\", \"tail return\"};\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_rawget(L, LUA_REGISTRYINDEX);\r\n  if (lua_isfunction(L, -1)) {\r\n    lua_pushstring(L, hooknames[(int)ar->event]);\r\n    if (ar->currentline >= 0)\r\n      lua_pushinteger(L, ar->currentline);\r\n    else lua_pushnil(L);\r\n    lua_call(L, 2, 0);\r\n  }\r\n}\r\n\r\nstatic int makemask(const char *smask, int count)\r\n{\r\n  int mask = 0;\r\n  if (strchr(smask, 'c')) mask |= LUA_MASKCALL;\r\n  if (strchr(smask, 'r')) mask |= LUA_MASKRET;\r\n  if (strchr(smask, 'l')) mask |= LUA_MASKLINE;\r\n  if (count > 0) mask |= LUA_MASKCOUNT;\r\n  return mask;\r\n}\r\n\r\nstatic char *unmakemask(int mask, char *smask)\r\n{\r\n  int i = 0;\r\n  if (mask & LUA_MASKCALL) smask[i++] = 'c';\r\n  if (mask & LUA_MASKRET) smask[i++] = 'r';\r\n  if (mask & LUA_MASKLINE) smask[i++] = 'l';\r\n  smask[i] = '\\0';\r\n  return smask;\r\n}\r\n\r\nLJLIB_CF(debug_sethook)\r\n{\r\n  int arg, mask, count;\r\n  lua_Hook func;\r\n  (void)getthread(L, &arg);\r\n  if (lua_isnoneornil(L, arg+1)) {\r\n    lua_settop(L, arg+1);\r\n    func = NULL; mask = 0; count = 0;  /* turn off hooks */\r\n  } else {\r\n    const char *smask = luaL_checkstring(L, arg+2);\r\n    luaL_checktype(L, arg+1, LUA_TFUNCTION);\r\n    count = luaL_optint(L, arg+3, 0);\r\n    func = hookf; mask = makemask(smask, count);\r\n  }\r\n  lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n  lua_pushvalue(L, arg+1);\r\n  lua_rawset(L, LUA_REGISTRYINDEX);\r\n  lua_sethook(L, func, mask, count);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(debug_gethook)\r\n{\r\n  char buff[5];\r\n  int mask = lua_gethookmask(L);\r\n  lua_Hook hook = lua_gethook(L);\r\n  if (hook != NULL && hook != hookf) {  /* external hook? */\r\n    lua_pushliteral(L, \"external hook\");\r\n  } else {\r\n    lua_pushlightuserdata(L, (void *)&KEY_HOOK);\r\n    lua_rawget(L, LUA_REGISTRYINDEX);   /* get hook */\r\n  }\r\n  lua_pushstring(L, unmakemask(mask, buff));\r\n  lua_pushinteger(L, lua_gethookcount(L));\r\n  return 3;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(debug_debug)\r\n{\r\n  for (;;) {\r\n    char buffer[250];\r\n    fputs(\"lua_debug> \", stderr);\r\n    if (fgets(buffer, sizeof(buffer), stdin) == 0 ||\r\n\tstrcmp(buffer, \"cont\\n\") == 0)\r\n      return 0;\r\n    if (luaL_loadbuffer(L, buffer, strlen(buffer), \"=(debug command)\") ||\r\n\tlua_pcall(L, 0, 0, 0)) {\r\n      fputs(lua_tostring(L, -1), stderr);\r\n      fputs(\"\\n\", stderr);\r\n    }\r\n    lua_settop(L, 0);  /* remove eventual returns */\r\n  }\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LEVELS1\t12\t/* size of the first part of the stack */\r\n#define LEVELS2\t10\t/* size of the second part of the stack */\r\n\r\nLJLIB_CF(debug_traceback)\r\n{\r\n  int arg;\r\n  lua_State *L1 = getthread(L, &arg);\r\n  const char *msg = lua_tostring(L, arg+1);\r\n  if (msg == NULL && L->top > L->base+arg)\r\n    L->top = L->base+arg+1;\r\n  else\r\n    luaL_traceback(L, L1, msg, lj_lib_optint(L, arg+2, (L == L1)));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_debug(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_DBLIBNAME, debug);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_ffi.c",
    "content": "/*\r\n** FFI library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_ffi_c\r\n#define LUA_LIB\r\n\r\n#include <errno.h>\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_carith.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ccallback.h\"\r\n#include \"lj_clib.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- C type checks ------------------------------------------------------- */\r\n\r\n/* Check first argument for a C type and returns its ID. */\r\nstatic CTypeID ffi_checkctype(lua_State *L, CTState *cts, TValue *param)\r\n{\r\n  TValue *o = L->base;\r\n  if (!(o < L->top)) {\r\n  err_argtype:\r\n    lj_err_argtype(L, 1, \"C type\");\r\n  }\r\n  if (tvisstr(o)) {  /* Parse an abstract C type declaration. */\r\n    GCstr *s = strV(o);\r\n    CPState cp;\r\n    int errcode;\r\n    cp.L = L;\r\n    cp.cts = cts;\r\n    cp.srcname = strdata(s);\r\n    cp.p = strdata(s);\r\n    cp.param = param;\r\n    cp.mode = CPARSE_MODE_ABSTRACT|CPARSE_MODE_NOIMPLICIT;\r\n    errcode = lj_cparse(&cp);\r\n    if (errcode) lj_err_throw(L, errcode);  /* Propagate errors. */\r\n    return cp.val.id;\r\n  } else {\r\n    GCcdata *cd;\r\n    if (!tviscdata(o)) goto err_argtype;\r\n    if (param && param < L->top) lj_err_arg(L, 1, LJ_ERR_FFI_NUMPARAM);\r\n    cd = cdataV(o);\r\n    return cd->ctypeid == CTID_CTYPEID ? *(CTypeID *)cdataptr(cd) : cd->ctypeid;\r\n  }\r\n}\r\n\r\n/* Check argument for C data and return it. */\r\nstatic GCcdata *ffi_checkcdata(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tviscdata(o)))\r\n    lj_err_argt(L, narg, LUA_TCDATA);\r\n  return cdataV(o);\r\n}\r\n\r\n/* Convert argument to C pointer. */\r\nstatic void *ffi_checkptr(lua_State *L, int narg, CTypeID id)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = L->base + narg-1;\r\n  void *p;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  lj_cconv_ct_tv(cts, ctype_get(cts, id), (uint8_t *)&p, o, CCF_ARG(narg));\r\n  return p;\r\n}\r\n\r\n/* Convert argument to int32_t. */\r\nstatic int32_t ffi_checkint(lua_State *L, int narg)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = L->base + narg-1;\r\n  int32_t i;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  lj_cconv_ct_tv(cts, ctype_get(cts, CTID_INT32), (uint8_t *)&i, o,\r\n\t\t CCF_ARG(narg));\r\n  return i;\r\n}\r\n\r\n/* -- C type metamethods -------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_meta\r\n\r\n/* Handle ctype __index/__newindex metamethods. */\r\nstatic int ffi_index_meta(lua_State *L, CTState *cts, CType *ct, MMS mm)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  cTValue *tv = lj_ctype_meta(cts, id, mm);\r\n  TValue *base = L->base;\r\n  if (!tv) {\r\n    const char *s;\r\n  err_index:\r\n    s = strdata(lj_ctype_repr(L, id, NULL));\r\n    if (tvisstr(L->base+1)) {\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADMEMBER, s, strVdata(L->base+1));\r\n    } else {\r\n      const char *key = tviscdata(L->base+1) ?\r\n\tstrdata(lj_ctype_repr(L, cdataV(L->base+1)->ctypeid, NULL)) :\r\n\tlj_typename(L->base+1);\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADIDXW, s, key);\r\n    }\r\n  }\r\n  if (!tvisfunc(tv)) {\r\n    if (mm == MM_index) {\r\n      cTValue *o = lj_meta_tget(L, tv, base+1);\r\n      if (o) {\r\n\tif (tvisnil(o)) goto err_index;\r\n\tcopyTV(L, L->top-1, o);\r\n\treturn 1;\r\n      }\r\n    } else {\r\n      TValue *o = lj_meta_tset(L, tv, base+1);\r\n      if (o) {\r\n\tcopyTV(L, o, base+2);\r\n\treturn 0;\r\n      }\r\n    }\r\n    copyTV(L, base, L->top);\r\n    tv = L->top-1-LJ_FR2;\r\n  }\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___index)\tLJLIB_REC(cdata_index 0)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTInfo qual = 0;\r\n  CType *ct;\r\n  uint8_t *p;\r\n  TValue *o = L->base;\r\n  if (!(o+1 < L->top && tviscdata(o)))  /* Also checks for presence of key. */\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  ct = lj_cdata_index(cts, cdataV(o), o+1, &p, &qual);\r\n  if ((qual & 1))\r\n    return ffi_index_meta(L, cts, ct, MM_index);\r\n  if (lj_cdata_get(cts, ct, L->top-1, p))\r\n    lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_meta___newindex)\tLJLIB_REC(cdata_index 1)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTInfo qual = 0;\r\n  CType *ct;\r\n  uint8_t *p;\r\n  TValue *o = L->base;\r\n  if (!(o+2 < L->top && tviscdata(o)))  /* Also checks for key and value. */\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  ct = lj_cdata_index(cts, cdataV(o), o+1, &p, &qual);\r\n  if ((qual & 1)) {\r\n    if ((qual & CTF_CONST))\r\n      lj_err_caller(L, LJ_ERR_FFI_WRCONST);\r\n    return ffi_index_meta(L, cts, ct, MM_newindex);\r\n  }\r\n  lj_cdata_set(cts, ct, p, o+2, qual);\r\n  return 0;\r\n}\r\n\r\n/* Common handler for cdata arithmetic. */\r\nstatic int ffi_arith(lua_State *L)\r\n{\r\n  MMS mm = (MMS)(curr_func(L)->c.ffid - (int)FF_ffi_meta___eq + (int)MM_eq);\r\n  return lj_carith_op(L, mm);\r\n}\r\n\r\n/* The following functions must be in contiguous ORDER MM. */\r\nLJLIB_CF(ffi_meta___eq)\t\tLJLIB_REC(cdata_arith MM_eq)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___len)\tLJLIB_REC(cdata_arith MM_len)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___lt)\t\tLJLIB_REC(cdata_arith MM_lt)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___le)\t\tLJLIB_REC(cdata_arith MM_le)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___concat)\tLJLIB_REC(cdata_arith MM_concat)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic int lj_cf_ffi_new(lua_State *L);\r\n\r\nLJLIB_CF(ffi_meta___call)\tLJLIB_REC(cdata_call)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  CTypeID id = cd->ctypeid;\r\n  CType *ct;\r\n  cTValue *tv;\r\n  MMS mm = MM_call;\r\n  if (cd->ctypeid == CTID_CTYPEID) {\r\n    id = *(CTypeID *)cdataptr(cd);\r\n    mm = MM_new;\r\n  } else {\r\n    int ret = lj_ccall_func(L, cd);\r\n    if (ret >= 0)\r\n      return ret;\r\n  }\r\n  /* Handle ctype __call/__new metamethod. */\r\n  ct = ctype_raw(cts, id);\r\n  if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n  tv = lj_ctype_meta(cts, id, mm);\r\n  if (tv)\r\n    return lj_meta_tailcall(L, tv);\r\n  else if (mm == MM_call)\r\n    lj_err_callerv(L, LJ_ERR_FFI_BADCALL, strdata(lj_ctype_repr(L, id, NULL)));\r\n  return lj_cf_ffi_new(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___add)\tLJLIB_REC(cdata_arith MM_add)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___sub)\tLJLIB_REC(cdata_arith MM_sub)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___mul)\tLJLIB_REC(cdata_arith MM_mul)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___div)\tLJLIB_REC(cdata_arith MM_div)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___mod)\tLJLIB_REC(cdata_arith MM_mod)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___pow)\tLJLIB_REC(cdata_arith MM_pow)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___unm)\tLJLIB_REC(cdata_arith MM_unm)\r\n{\r\n  return ffi_arith(L);\r\n}\r\n/* End of contiguous ORDER MM. */\r\n\r\nLJLIB_CF(ffi_meta___tostring)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  const char *msg = \"cdata<%s>: %p\";\r\n  CTypeID id = cd->ctypeid;\r\n  void *p = cdataptr(cd);\r\n  if (id == CTID_CTYPEID) {\r\n    msg = \"ctype<%s>\";\r\n    id = *(CTypeID *)p;\r\n  } else {\r\n    CTState *cts = ctype_cts(L);\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isref(ct->info)) {\r\n      p = *(void **)p;\r\n      ct = ctype_rawchild(cts, ct);\r\n    }\r\n    if (ctype_iscomplex(ct->info)) {\r\n      setstrV(L, L->top-1, lj_ctype_repr_complex(L, cdataptr(cd), ct->size));\r\n      goto checkgc;\r\n    } else if (ct->size == 8 && ctype_isinteger(ct->info)) {\r\n      setstrV(L, L->top-1, lj_ctype_repr_int64(L, *(uint64_t *)cdataptr(cd),\r\n\t\t\t\t\t       (ct->info & CTF_UNSIGNED)));\r\n      goto checkgc;\r\n    } else if (ctype_isfunc(ct->info)) {\r\n      p = *(void **)p;\r\n    } else if (ctype_isenum(ct->info)) {\r\n      msg = \"cdata<%s>: %d\";\r\n      p = (void *)(uintptr_t)*(uint32_t **)p;\r\n    } else {\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = cdata_getptr(p, ct->size);\r\n\tct = ctype_rawchild(cts, ct);\r\n      }\r\n      if (ctype_isstruct(ct->info) || ctype_isvector(ct->info)) {\r\n\t/* Handle ctype __tostring metamethod. */\r\n\tcTValue *tv = lj_ctype_meta(cts, ctype_typeid(cts, ct), MM_tostring);\r\n\tif (tv)\r\n\t  return lj_meta_tailcall(L, tv);\r\n      }\r\n    }\r\n  }\r\n  lj_strfmt_pushf(L, msg, strdata(lj_ctype_repr(L, id, NULL)), p);\r\ncheckgc:\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nstatic int ffi_pairs(lua_State *L, MMS mm)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkcdata(L, 1)->ctypeid;\r\n  CType *ct = ctype_raw(cts, id);\r\n  cTValue *tv;\r\n  if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n  tv = lj_ctype_meta(cts, id, mm);\r\n  if (!tv)\r\n    lj_err_callerv(L, LJ_ERR_FFI_BADMM, strdata(lj_ctype_repr(L, id, NULL)),\r\n\t\t   strdata(mmname_str(G(L), mm)));\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___pairs)\r\n{\r\n  return ffi_pairs(L, MM_pairs);\r\n}\r\n\r\nLJLIB_CF(ffi_meta___ipairs)\r\n{\r\n  return ffi_pairs(L, MM_ipairs);\r\n}\r\n\r\nLJLIB_PUSH(\"ffi\") LJLIB_SET(__metatable)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- C library metamethods ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_clib\r\n\r\n/* Index C library by a name. */\r\nstatic TValue *ffi_clib_index(lua_State *L)\r\n{\r\n  TValue *o = L->base;\r\n  CLibrary *cl;\r\n  if (!(o < L->top && tvisudata(o) && udataV(o)->udtype == UDTYPE_FFI_CLIB))\r\n    lj_err_argt(L, 1, LUA_TUSERDATA);\r\n  cl = (CLibrary *)uddata(udataV(o));\r\n  if (!(o+1 < L->top && tvisstr(o+1)))\r\n    lj_err_argt(L, 2, LUA_TSTRING);\r\n  return lj_clib_index(L, cl, strV(o+1));\r\n}\r\n\r\nLJLIB_CF(ffi_clib___index)\tLJLIB_REC(clib_index 1)\r\n{\r\n  TValue *tv = ffi_clib_index(L);\r\n  if (tviscdata(tv)) {\r\n    CTState *cts = ctype_cts(L);\r\n    GCcdata *cd = cdataV(tv);\r\n    CType *s = ctype_get(cts, cd->ctypeid);\r\n    if (ctype_isextern(s->info)) {\r\n      CTypeID sid = ctype_cid(s->info);\r\n      void *sp = *(void **)cdataptr(cd);\r\n      CType *ct = ctype_raw(cts, sid);\r\n      if (lj_cconv_tv_ct(cts, ct, sid, L->top-1, sp))\r\n\tlj_gc_check(L);\r\n      return 1;\r\n    }\r\n  }\r\n  copyTV(L, L->top-1, tv);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_clib___newindex)\tLJLIB_REC(clib_index 0)\r\n{\r\n  TValue *tv = ffi_clib_index(L);\r\n  TValue *o = L->base+2;\r\n  if (o < L->top && tviscdata(tv)) {\r\n    CTState *cts = ctype_cts(L);\r\n    GCcdata *cd = cdataV(tv);\r\n    CType *d = ctype_get(cts, cd->ctypeid);\r\n    if (ctype_isextern(d->info)) {\r\n      CTInfo qual = 0;\r\n      for (;;) {  /* Skip attributes and collect qualifiers. */\r\n\td = ctype_child(cts, d);\r\n\tif (!ctype_isattrib(d->info)) break;\r\n\tif (ctype_attrib(d->info) == CTA_QUAL) qual |= d->size;\r\n      }\r\n      if (!((d->info|qual) & CTF_CONST)) {\r\n\tlj_cconv_ct_tv(cts, d, *(void **)cdataptr(cd), o, 0);\r\n\treturn 0;\r\n      }\r\n    }\r\n  }\r\n  lj_err_caller(L, LJ_ERR_FFI_WRCONST);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLJLIB_CF(ffi_clib___gc)\r\n{\r\n  TValue *o = L->base;\r\n  if (o < L->top && tvisudata(o) && udataV(o)->udtype == UDTYPE_FFI_CLIB)\r\n    lj_clib_unload((CLibrary *)uddata(udataV(o)));\r\n  return 0;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- Callback function metamethods --------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi_callback\r\n\r\nstatic int ffi_callback_set(lua_State *L, GCfunc *fn)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  CTState *cts = ctype_cts(L);\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  if (ctype_isptr(ct->info) && (LJ_32 || ct->size == 8)) {\r\n    MSize slot = lj_ccallback_ptr2slot(cts, *(void **)cdataptr(cd));\r\n    if (slot < cts->cb.sizeid && cts->cb.cbid[slot] != 0) {\r\n      GCtab *t = cts->miscmap;\r\n      TValue *tv = lj_tab_setint(L, t, (int32_t)slot);\r\n      if (fn) {\r\n\tsetfuncV(L, tv, fn);\r\n\tlj_gc_anybarriert(L, t);\r\n      } else {\r\n\tsetnilV(tv);\r\n\tcts->cb.cbid[slot] = 0;\r\n\tcts->cb.topid = slot < cts->cb.topid ? slot : cts->cb.topid;\r\n      }\r\n      return 0;\r\n    }\r\n  }\r\n  lj_err_caller(L, LJ_ERR_FFI_BADCBACK);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_callback_free)\r\n{\r\n  return ffi_callback_set(L, NULL);\r\n}\r\n\r\nLJLIB_CF(ffi_callback_set)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 2);\r\n  return ffi_callback_set(L, fn);\r\n}\r\n\r\nLJLIB_PUSH(top-1) LJLIB_SET(__index)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- FFI library functions ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_ffi\r\n\r\nLJLIB_CF(ffi_cdef)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  CPState cp;\r\n  int errcode;\r\n  cp.L = L;\r\n  cp.cts = ctype_cts(L);\r\n  cp.srcname = strdata(s);\r\n  cp.p = strdata(s);\r\n  cp.param = L->base+1;\r\n  cp.mode = CPARSE_MODE_MULTI|CPARSE_MODE_DIRECT;\r\n  errcode = lj_cparse(&cp);\r\n  if (errcode) lj_err_throw(L, errcode);  /* Propagate errors. */\r\n  lj_gc_check(L);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_new)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CType *ct = ctype_raw(cts, id);\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  TValue *o = L->base+1;\r\n  GCcdata *cd;\r\n  if ((info & CTF_VLA)) {\r\n    o++;\r\n    sz = lj_ctype_vlsize(cts, ct, (CTSize)ffi_checkint(L, 2));\r\n  }\r\n  if (sz == CTSIZE_INVALID)\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVSIZE);\r\n  if (!(info & CTF_VLA) && ctype_align(info) <= CT_MEMALIGN)\r\n    cd = lj_cdata_new(cts, id, sz);\r\n  else\r\n    cd = lj_cdata_newv(L, id, sz, ctype_align(info));\r\n  setcdataV(L, o-1, cd);  /* Anchor the uninitialized cdata. */\r\n  lj_cconv_ct_init(cts, ct, sz, cdataptr(cd),\r\n\t\t   o, (MSize)(L->top - o));  /* Initialize cdata. */\r\n  if (ctype_isstruct(ct->info)) {\r\n    /* Handle ctype __gc metamethod. Use the fast lookup here. */\r\n    cTValue *tv = lj_tab_getinth(cts->miscmap, -(int32_t)id);\r\n    if (tv && tvistab(tv) && (tv = lj_meta_fast(L, tabV(tv), MM_gc))) {\r\n      GCtab *t = cts->finalizer;\r\n      if (gcref(t->metatable)) {\r\n\t/* Add to finalizer table, if still enabled. */\r\n\tcopyTV(L, lj_tab_set(L, t, o-1), tv);\r\n\tlj_gc_anybarriert(L, t);\r\n\tcd->marked |= LJ_GC_CDATA_FIN;\r\n      }\r\n    }\r\n  }\r\n  L->top = o;  /* Only return the cdata itself. */\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_cast)\tLJLIB_REC(ffi_new)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CType *d = ctype_raw(cts, id);\r\n  TValue *o = lj_lib_checkany(L, 2);\r\n  L->top = o+1;  /* Make sure this is the last item on the stack. */\r\n  if (!(ctype_isnum(d->info) || ctype_isptr(d->info) || ctype_isenum(d->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  if (!(tviscdata(o) && cdataV(o)->ctypeid == id)) {\r\n    GCcdata *cd = lj_cdata_new(cts, id, d->size);\r\n    lj_cconv_ct_tv(cts, d, cdataptr(cd), o, CCF_CAST);\r\n    setcdataV(L, o, cd);\r\n    lj_gc_check(L);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_typeof)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, L->base+1);\r\n  GCcdata *cd = lj_cdata_new(cts, CTID_CTYPEID, 4);\r\n  *(CTypeID *)cdataptr(cd) = id;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* Internal and unsupported API. */\r\nLJLIB_CF(ffi_typeinfo)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = (CTypeID)ffi_checkint(L, 1);\r\n  if (id > 0 && id < cts->top) {\r\n    CType *ct = ctype_get(cts, id);\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 4);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    setintV(lj_tab_setstr(L, t, lj_str_newlit(L, \"info\")), (int32_t)ct->info);\r\n    if (ct->size != CTSIZE_INVALID)\r\n      setintV(lj_tab_setstr(L, t, lj_str_newlit(L, \"size\")), (int32_t)ct->size);\r\n    if (ct->sib)\r\n      setintV(lj_tab_setstr(L, t, lj_str_newlit(L, \"sib\")), (int32_t)ct->sib);\r\n    if (gcref(ct->name)) {\r\n      GCstr *s = gco2str(gcref(ct->name));\r\n      setstrV(L, lj_tab_setstr(L, t, lj_str_newlit(L, \"name\")), s);\r\n    }\r\n    lj_gc_check(L);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_istype)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id1 = ffi_checkctype(L, cts, NULL);\r\n  TValue *o = lj_lib_checkany(L, 2);\r\n  int b = 0;\r\n  if (tviscdata(o)) {\r\n    GCcdata *cd = cdataV(o);\r\n    CTypeID id2 = cd->ctypeid == CTID_CTYPEID ? *(CTypeID *)cdataptr(cd) :\r\n\t\t\t\t\t\tcd->ctypeid;\r\n    CType *ct1 = lj_ctype_rawref(cts, id1);\r\n    CType *ct2 = lj_ctype_rawref(cts, id2);\r\n    if (ct1 == ct2) {\r\n      b = 1;\r\n    } else if (ctype_type(ct1->info) == ctype_type(ct2->info) &&\r\n\t       ct1->size == ct2->size) {\r\n      if (ctype_ispointer(ct1->info))\r\n\tb = lj_cconv_compatptr(cts, ct1, ct2, CCF_IGNQUAL);\r\n      else if (ctype_isnum(ct1->info) || ctype_isvoid(ct1->info))\r\n\tb = (((ct1->info ^ ct2->info) & ~(CTF_QUAL|CTF_LONG)) == 0);\r\n    } else if (ctype_isstruct(ct1->info) && ctype_isptr(ct2->info) &&\r\n\t       ct1 == ctype_rawchild(cts, ct2)) {\r\n      b = 1;\r\n    }\r\n  }\r\n  setboolV(L->top-1, b);\r\n  setboolV(&G(L)->tmptv2, b);  /* Remember for trace recorder. */\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_sizeof)\tLJLIB_REC(ffi_xof FF_ffi_sizeof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CTSize sz;\r\n  if (LJ_UNLIKELY(tviscdata(L->base) && cdataisv(cdataV(L->base)))) {\r\n    sz = cdatavlen(cdataV(L->base));\r\n  } else {\r\n    CType *ct = lj_ctype_rawref(cts, id);\r\n    if (ctype_isvltype(ct->info))\r\n      sz = lj_ctype_vlsize(cts, ct, (CTSize)ffi_checkint(L, 2));\r\n    else\r\n      sz = ctype_hassize(ct->info) ? ct->size : CTSIZE_INVALID;\r\n    if (LJ_UNLIKELY(sz == CTSIZE_INVALID)) {\r\n      setnilV(L->top-1);\r\n      return 1;\r\n    }\r\n  }\r\n  setintV(L->top-1, (int32_t)sz);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_alignof)\tLJLIB_REC(ffi_xof FF_ffi_alignof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  CTSize sz = 0;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  setintV(L->top-1, 1 << ctype_align(info));\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_offsetof)\tLJLIB_REC(ffi_xof FF_ffi_offsetof)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  GCstr *name = lj_lib_checkstr(L, 2);\r\n  CType *ct = lj_ctype_rawref(cts, id);\r\n  CTSize ofs;\r\n  if (ctype_isstruct(ct->info) && ct->size != CTSIZE_INVALID) {\r\n    CType *fct = lj_ctype_getfield(cts, ct, name, &ofs);\r\n    if (fct) {\r\n      setintV(L->top-1, ofs);\r\n      if (ctype_isfield(fct->info)) {\r\n\treturn 1;\r\n      } else if (ctype_isbitfield(fct->info)) {\r\n\tsetintV(L->top++, ctype_bitpos(fct->info));\r\n\tsetintV(L->top++, ctype_bitbsz(fct->info));\r\n\treturn 3;\r\n      }\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_errno)\tLJLIB_REC(.)\r\n{\r\n  int err = errno;\r\n  if (L->top > L->base)\r\n    errno = ffi_checkint(L, 1);\r\n  setintV(L->top++, err);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_string)\tLJLIB_REC(.)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  TValue *o = lj_lib_checkany(L, 1);\r\n  const char *p;\r\n  size_t len;\r\n  if (o+1 < L->top && !tvisnil(o+1)) {\r\n    len = (size_t)ffi_checkint(L, 2);\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_P_CVOID), (uint8_t *)&p, o,\r\n\t\t   CCF_ARG(1));\r\n  } else {\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_P_CCHAR), (uint8_t *)&p, o,\r\n\t\t   CCF_ARG(1));\r\n    len = strlen(p);\r\n  }\r\n  L->top = o+1;  /* Make sure this is the last item on the stack. */\r\n  setstrV(L, o, lj_str_new(L, p, len));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(ffi_copy)\tLJLIB_REC(.)\r\n{\r\n  void *dp = ffi_checkptr(L, 1, CTID_P_VOID);\r\n  void *sp = ffi_checkptr(L, 2, CTID_P_CVOID);\r\n  TValue *o = L->base+1;\r\n  CTSize len;\r\n  if (tvisstr(o) && o+1 >= L->top)\r\n    len = strV(o)->len+1;  /* Copy Lua string including trailing '\\0'. */\r\n  else\r\n    len = (CTSize)ffi_checkint(L, 3);\r\n  memcpy(dp, sp, len);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(ffi_fill)\tLJLIB_REC(.)\r\n{\r\n  void *dp = ffi_checkptr(L, 1, CTID_P_VOID);\r\n  CTSize len = (CTSize)ffi_checkint(L, 2);\r\n  int32_t fill = 0;\r\n  if (L->base+2 < L->top && !tvisnil(L->base+2)) fill = ffi_checkint(L, 3);\r\n  memset(dp, fill, len);\r\n  return 0;\r\n}\r\n\r\n#define H_(le, be)\tLJ_ENDIAN_SELECT(0x##le, 0x##be)\r\n\r\n/* Test ABI string. */\r\nLJLIB_CF(ffi_abi)\tLJLIB_REC(.)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int b = 0;\r\n  switch (s->hash) {\r\n#if LJ_64\r\n  case H_(849858eb,ad35fd06): b = 1; break;  /* 64bit */\r\n#else\r\n  case H_(662d3c79,d0e22477): b = 1; break;  /* 32bit */\r\n#endif\r\n#if LJ_ARCH_HASFPU\r\n  case H_(e33ee463,e33ee463): b = 1; break;  /* fpu */\r\n#endif\r\n#if LJ_ABI_SOFTFP\r\n  case H_(61211a23,c2e8c81c): b = 1; break;  /* softfp */\r\n#else\r\n  case H_(539417a8,8ce0812f): b = 1; break;  /* hardfp */\r\n#endif\r\n#if LJ_ABI_EABI\r\n  case H_(2182df8f,f2ed1152): b = 1; break;  /* eabi */\r\n#endif\r\n#if LJ_ABI_WIN\r\n  case H_(4ab624a8,4ab624a8): b = 1; break;  /* win */\r\n#endif\r\n  case H_(3af93066,1f001464): b = 1; break;  /* le/be */\r\n#if LJ_GC64\r\n  case H_(9e89d2c9,13c83c92): b = 1; break;  /* gc64 */\r\n#endif\r\n  default:\r\n    break;\r\n  }\r\n  setboolV(L->top-1, b);\r\n  setboolV(&G(L)->tmptv2, b);  /* Remember for trace recorder. */\r\n  return 1;\r\n}\r\n\r\n#undef H_\r\n\r\nLJLIB_PUSH(top-8) LJLIB_SET(!)  /* Store reference to miscmap table. */\r\n\r\nLJLIB_CF(ffi_metatype)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CTypeID id = ffi_checkctype(L, cts, NULL);\r\n  GCtab *mt = lj_lib_checktab(L, 2);\r\n  GCtab *t = cts->miscmap;\r\n  CType *ct = ctype_get(cts, id);  /* Only allow raw types. */\r\n  TValue *tv;\r\n  GCcdata *cd;\r\n  if (!(ctype_isstruct(ct->info) || ctype_iscomplex(ct->info) ||\r\n\tctype_isvector(ct->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  tv = lj_tab_setinth(L, t, -(int32_t)id);\r\n  if (!tvisnil(tv))\r\n    lj_err_caller(L, LJ_ERR_PROTMT);\r\n  settabV(L, tv, mt);\r\n  lj_gc_anybarriert(L, t);\r\n  cd = lj_cdata_new(cts, CTID_CTYPEID, 4);\r\n  *(CTypeID *)cdataptr(cd) = id;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-7) LJLIB_SET(!)  /* Store reference to finalizer table. */\r\n\r\nLJLIB_CF(ffi_gc)\tLJLIB_REC(.)\r\n{\r\n  GCcdata *cd = ffi_checkcdata(L, 1);\r\n  TValue *fin = lj_lib_checkany(L, 2);\r\n  CTState *cts = ctype_cts(L);\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  if (!(ctype_isptr(ct->info) || ctype_isstruct(ct->info) ||\r\n\tctype_isrefarray(ct->info)))\r\n    lj_err_arg(L, 1, LJ_ERR_FFI_INVTYPE);\r\n  lj_cdata_setfin(L, cd, gcval(fin), itype(fin));\r\n  L->top = L->base+1;  /* Pass through the cdata object. */\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-5) LJLIB_SET(!)  /* Store clib metatable in func environment. */\r\n\r\nLJLIB_CF(ffi_load)\r\n{\r\n  GCstr *name = lj_lib_checkstr(L, 1);\r\n  int global = (L->base+1 < L->top && tvistruecond(L->base+1));\r\n  lj_clib_load(L, tabref(curr_func(L)->c.env), name, global);\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-4) LJLIB_SET(C)\r\nLJLIB_PUSH(top-3) LJLIB_SET(os)\r\nLJLIB_PUSH(top-2) LJLIB_SET(arch)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Create special weak-keyed finalizer table. */\r\nstatic GCtab *ffi_finalizer(lua_State *L)\r\n{\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  GCtab *t = lj_tab_new(L, 0, 1);\r\n  settabV(L, L->top++, t);\r\n  setgcref(t->metatable, obj2gco(t));\r\n  setstrV(L, lj_tab_setstr(L, t, lj_str_newlit(L, \"__mode\")),\r\n\t  lj_str_newlit(L, \"K\"));\r\n  t->nomm = (uint8_t)(~(1u<<MM_mode));\r\n  return t;\r\n}\r\n\r\n/* Register FFI module as loaded. */\r\nstatic void ffi_register_module(lua_State *L)\r\n{\r\n  cTValue *tmp = lj_tab_getstr(tabV(registry(L)), lj_str_newlit(L, \"_LOADED\"));\r\n  if (tmp && tvistab(tmp)) {\r\n    GCtab *t = tabV(tmp);\r\n    copyTV(L, lj_tab_setstr(L, t, lj_str_newlit(L, LUA_FFILIBNAME)), L->top-1);\r\n    lj_gc_anybarriert(L, t);\r\n  }\r\n}\r\n\r\nLUALIB_API int luaopen_ffi(lua_State *L)\r\n{\r\n  CTState *cts = lj_ctype_init(L);\r\n  settabV(L, L->top++, (cts->miscmap = lj_tab_new(L, 0, 1)));\r\n  cts->finalizer = ffi_finalizer(L);\r\n  LJ_LIB_REG(L, NULL, ffi_meta);\r\n  /* NOBARRIER: basemt is a GC root. */\r\n  setgcref(basemt_it(G(L), LJ_TCDATA), obj2gco(tabV(L->top-1)));\r\n  LJ_LIB_REG(L, NULL, ffi_clib);\r\n  LJ_LIB_REG(L, NULL, ffi_callback);\r\n  /* NOBARRIER: the key is new and lj_tab_newkey() handles the barrier. */\r\n  settabV(L, lj_tab_setstr(L, cts->miscmap, &cts->g->strempty), tabV(L->top-1));\r\n  L->top--;\r\n  lj_clib_default(L, tabV(L->top-1));  /* Create ffi.C default namespace. */\r\n  lua_pushliteral(L, LJ_OS_NAME);\r\n  lua_pushliteral(L, LJ_ARCH_NAME);\r\n  LJ_LIB_REG(L, NULL, ffi);  /* Note: no global \"ffi\" created! */\r\n  ffi_register_module(L);\r\n  return 1;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_init.c",
    "content": "/*\r\n** Library initialization.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major parts taken verbatim from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_init_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_arch.h\"\r\n\r\nstatic const luaL_Reg lj_lib_load[] = {\r\n  { \"\",\t\t\tluaopen_base },\r\n  { LUA_LOADLIBNAME,\tluaopen_package },\r\n  { LUA_TABLIBNAME,\tluaopen_table },\r\n  { LUA_IOLIBNAME,\tluaopen_io },\r\n  { LUA_OSLIBNAME,\tluaopen_os },\r\n  { LUA_STRLIBNAME,\tluaopen_string },\r\n  { LUA_MATHLIBNAME,\tluaopen_math },\r\n  { LUA_DBLIBNAME,\tluaopen_debug },\r\n  { LUA_BITLIBNAME,\tluaopen_bit },\r\n  { LUA_JITLIBNAME,\tluaopen_jit },\r\n  { NULL,\t\tNULL }\r\n};\r\n\r\nstatic const luaL_Reg lj_lib_preload[] = {\r\n#if LJ_HASFFI\r\n  { LUA_FFILIBNAME,\tluaopen_ffi },\r\n#endif\r\n  { NULL,\t\tNULL }\r\n};\r\n\r\nLUALIB_API void luaL_openlibs(lua_State *L)\r\n{\r\n  const luaL_Reg *lib;\r\n  for (lib = lj_lib_load; lib->func; lib++) {\r\n    lua_pushcfunction(L, lib->func);\r\n    lua_pushstring(L, lib->name);\r\n    lua_call(L, 1, 0);\r\n  }\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\",\r\n\t\t sizeof(lj_lib_preload)/sizeof(lj_lib_preload[0])-1);\r\n  for (lib = lj_lib_preload; lib->func; lib++) {\r\n    lua_pushcfunction(L, lib->func);\r\n    lua_setfield(L, -2, lib->name);\r\n  }\r\n  lua_pop(L, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_io.c",
    "content": "/*\r\n** I/O library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2011 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n\r\n#define lib_io_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* Userdata payload for I/O file. */\r\ntypedef struct IOFileUD {\r\n  FILE *fp;\t\t/* File handle. */\r\n  uint32_t type;\t/* File type. */\r\n} IOFileUD;\r\n\r\n#define IOFILE_TYPE_FILE\t0\t/* Regular file. */\r\n#define IOFILE_TYPE_PIPE\t1\t/* Pipe. */\r\n#define IOFILE_TYPE_STDF\t2\t/* Standard file handle. */\r\n#define IOFILE_TYPE_MASK\t3\r\n\r\n#define IOFILE_FLAG_CLOSE\t4\t/* Close after io.lines() iterator. */\r\n\r\n#define IOSTDF_UD(L, id)\t(&gcref(G(L)->gcroot[(id)])->ud)\r\n#define IOSTDF_IOF(L, id)\t((IOFileUD *)uddata(IOSTDF_UD(L, (id))))\r\n\r\n/* -- Open/close helpers -------------------------------------------------- */\r\n\r\nstatic IOFileUD *io_tofilep(lua_State *L)\r\n{\r\n  if (!(L->base < L->top && tvisudata(L->base) &&\r\n\tudataV(L->base)->udtype == UDTYPE_IO_FILE))\r\n    lj_err_argtype(L, 1, \"FILE*\");\r\n  return (IOFileUD *)uddata(udataV(L->base));\r\n}\r\n\r\nstatic IOFileUD *io_tofile(lua_State *L)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOCLFL);\r\n  return iof;\r\n}\r\n\r\nstatic FILE *io_stdfile(lua_State *L, ptrdiff_t id)\r\n{\r\n  IOFileUD *iof = IOSTDF_IOF(L, id);\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOSTDCL);\r\n  return iof->fp;\r\n}\r\n\r\nstatic IOFileUD *io_file_new(lua_State *L)\r\n{\r\n  IOFileUD *iof = (IOFileUD *)lua_newuserdata(L, sizeof(IOFileUD));\r\n  GCudata *ud = udataV(L->top-1);\r\n  ud->udtype = UDTYPE_IO_FILE;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcrefr(ud->metatable, curr_func(L)->c.env);\r\n  iof->fp = NULL;\r\n  iof->type = IOFILE_TYPE_FILE;\r\n  return iof;\r\n}\r\n\r\nstatic IOFileUD *io_file_open(lua_State *L, const char *mode)\r\n{\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->fp = fopen(fname, mode);\r\n  if (iof->fp == NULL)\r\n    luaL_argerror(L, 1, lj_strfmt_pushf(L, \"%s: %s\", fname, strerror(errno)));\r\n  return iof;\r\n}\r\n\r\nstatic int io_file_close(lua_State *L, IOFileUD *iof)\r\n{\r\n  int ok;\r\n  if ((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_FILE) {\r\n    ok = (fclose(iof->fp) == 0);\r\n  } else if ((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_PIPE) {\r\n    int stat = -1;\r\n#if LJ_TARGET_POSIX\r\n    stat = pclose(iof->fp);\r\n#elif LJ_TARGET_WINDOWS && !LJ_TARGET_XBOXONE\r\n    stat = _pclose(iof->fp);\r\n#else\r\n    lua_assert(0);\r\n    return 0;\r\n#endif\r\n#if LJ_52\r\n    iof->fp = NULL;\r\n    return luaL_execresult(L, stat);\r\n#else\r\n    ok = (stat != -1);\r\n#endif\r\n  } else {\r\n    lua_assert((iof->type & IOFILE_TYPE_MASK) == IOFILE_TYPE_STDF);\r\n    setnilV(L->top++);\r\n    lua_pushliteral(L, \"cannot close standard file\");\r\n    return 2;\r\n  }\r\n  iof->fp = NULL;\r\n  return luaL_fileresult(L, ok, NULL);\r\n}\r\n\r\n/* -- Read/write helpers -------------------------------------------------- */\r\n\r\nstatic int io_file_readnum(lua_State *L, FILE *fp)\r\n{\r\n  lua_Number d;\r\n  if (fscanf(fp, LUA_NUMBER_SCAN, &d) == 1) {\r\n    if (LJ_DUALNUM) {\r\n      int32_t i = lj_num2int(d);\r\n      if (d == (lua_Number)i && !tvismzero((cTValue *)&d)) {\r\n\tsetintV(L->top++, i);\r\n\treturn 1;\r\n      }\r\n    }\r\n    setnumV(L->top++, d);\r\n    return 1;\r\n  } else {\r\n    setnilV(L->top++);\r\n    return 0;\r\n  }\r\n}\r\n\r\nstatic int io_file_readline(lua_State *L, FILE *fp, MSize chop)\r\n{\r\n  MSize m = LUAL_BUFFERSIZE, n = 0, ok = 0;\r\n  char *buf;\r\n  for (;;) {\r\n    buf = lj_buf_tmp(L, m);\r\n    if (fgets(buf+n, m-n, fp) == NULL) break;\r\n    n += (MSize)strlen(buf+n);\r\n    ok |= n;\r\n    if (n && buf[n-1] == '\\n') { n -= chop; break; }\r\n    if (n >= m - 64) m += m;\r\n  }\r\n  setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n  lj_gc_check(L);\r\n  return (int)ok;\r\n}\r\n\r\nstatic void io_file_readall(lua_State *L, FILE *fp)\r\n{\r\n  MSize m, n;\r\n  for (m = LUAL_BUFFERSIZE, n = 0; ; m += m) {\r\n    char *buf = lj_buf_tmp(L, m);\r\n    n += (MSize)fread(buf+n, 1, m-n, fp);\r\n    if (n != m) {\r\n      setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n      lj_gc_check(L);\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\nstatic int io_file_readlen(lua_State *L, FILE *fp, MSize m)\r\n{\r\n  if (m) {\r\n    char *buf = lj_buf_tmp(L, m);\r\n    MSize n = (MSize)fread(buf, 1, m, fp);\r\n    setstrV(L, L->top++, lj_str_new(L, buf, (size_t)n));\r\n    lj_gc_check(L);\r\n    return (n > 0 || m == 0);\r\n  } else {\r\n    int c = getc(fp);\r\n    ungetc(c, fp);\r\n    setstrV(L, L->top++, &G(L)->strempty);\r\n    return (c != EOF);\r\n  }\r\n}\r\n\r\nstatic int io_file_read(lua_State *L, FILE *fp, int start)\r\n{\r\n  int ok, n, nargs = (int)(L->top - L->base) - start;\r\n  clearerr(fp);\r\n  if (nargs == 0) {\r\n    ok = io_file_readline(L, fp, 1);\r\n    n = start+1;  /* Return 1 result. */\r\n  } else {\r\n    /* The results plus the buffers go on top of the args. */\r\n    luaL_checkstack(L, nargs+LUA_MINSTACK, \"too many arguments\");\r\n    ok = 1;\r\n    for (n = start; nargs-- && ok; n++) {\r\n      if (tvisstr(L->base+n)) {\r\n\tconst char *p = strVdata(L->base+n);\r\n\tif (p[0] != '*')\r\n\t  lj_err_arg(L, n+1, LJ_ERR_INVOPT);\r\n\tif (p[1] == 'n')\r\n\t  ok = io_file_readnum(L, fp);\r\n\telse if ((p[1] & ~0x20) == 'L')\r\n\t  ok = io_file_readline(L, fp, (p[1] == 'l'));\r\n\telse if (p[1] == 'a')\r\n\t  io_file_readall(L, fp);\r\n\telse\r\n\t  lj_err_arg(L, n+1, LJ_ERR_INVFMT);\r\n      } else if (tvisnumber(L->base+n)) {\r\n\tok = io_file_readlen(L, fp, (MSize)lj_lib_checkint(L, n+1));\r\n      } else {\r\n\tlj_err_arg(L, n+1, LJ_ERR_INVOPT);\r\n      }\r\n    }\r\n  }\r\n  if (ferror(fp))\r\n    return luaL_fileresult(L, 0, NULL);\r\n  if (!ok)\r\n    setnilV(L->top-1);  /* Replace last result with nil. */\r\n  return n - start;\r\n}\r\n\r\nstatic int io_file_write(lua_State *L, FILE *fp, int start)\r\n{\r\n  cTValue *tv;\r\n  int status = 1;\r\n  for (tv = L->base+start; tv < L->top; tv++) {\r\n    char buf[STRFMT_MAXBUF_NUM];\r\n    MSize len;\r\n    const char *p = lj_strfmt_wstrnum(buf, tv, &len);\r\n    if (!p)\r\n      lj_err_argt(L, (int)(tv - L->base) + 1, LUA_TSTRING);\r\n    status = status && (fwrite(p, 1, len, fp) == len);\r\n  }\r\n  if (LJ_52 && status) {\r\n    L->top = L->base+1;\r\n    if (start == 0)\r\n      setudataV(L, L->base, IOSTDF_UD(L, GCROOT_IO_OUTPUT));\r\n    return 1;\r\n  }\r\n  return luaL_fileresult(L, status, NULL);\r\n}\r\n\r\nstatic int io_file_iter(lua_State *L)\r\n{\r\n  GCfunc *fn = curr_func(L);\r\n  IOFileUD *iof = uddata(udataV(&fn->c.upvalue[0]));\r\n  int n = fn->c.nupvalues - 1;\r\n  if (iof->fp == NULL)\r\n    lj_err_caller(L, LJ_ERR_IOCLFL);\r\n  L->top = L->base;\r\n  if (n) {  /* Copy upvalues with options to stack. */\r\n    if (n > LUAI_MAXCSTACK)\r\n      lj_err_caller(L, LJ_ERR_STKOV);\r\n    lj_state_checkstack(L, (MSize)n);\r\n    memcpy(L->top, &fn->c.upvalue[1], n*sizeof(TValue));\r\n    L->top += n;\r\n  }\r\n  n = io_file_read(L, iof->fp, 0);\r\n  if (ferror(iof->fp))\r\n    lj_err_callermsg(L, strVdata(L->top-2));\r\n  if (tvisnil(L->base) && (iof->type & IOFILE_FLAG_CLOSE)) {\r\n    io_file_close(L, iof);  /* Return values are ignored. */\r\n    return 0;\r\n  }\r\n  return n;\r\n}\r\n\r\nstatic int io_file_lines(lua_State *L)\r\n{\r\n  int n = (int)(L->top - L->base);\r\n  if (n > LJ_MAX_UPVAL)\r\n    lj_err_caller(L, LJ_ERR_UNPACK);\r\n  lua_pushcclosure(L, io_file_iter, n);\r\n  return 1;\r\n}\r\n\r\n/* -- I/O file methods ---------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_io_method\r\n\r\nLJLIB_CF(io_method_close)\r\n{\r\n  IOFileUD *iof = L->base < L->top ? io_tofile(L) :\r\n\t\t  IOSTDF_IOF(L, GCROOT_IO_OUTPUT);\r\n  return io_file_close(L, iof);\r\n}\r\n\r\nLJLIB_CF(io_method_read)\r\n{\r\n  return io_file_read(L, io_tofile(L)->fp, 1);\r\n}\r\n\r\nLJLIB_CF(io_method_write)\t\tLJLIB_REC(io_write 0)\r\n{\r\n  return io_file_write(L, io_tofile(L)->fp, 1);\r\n}\r\n\r\nLJLIB_CF(io_method_flush)\t\tLJLIB_REC(io_flush 0)\r\n{\r\n  return luaL_fileresult(L, fflush(io_tofile(L)->fp) == 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_method_seek)\r\n{\r\n  FILE *fp = io_tofile(L)->fp;\r\n  int opt = lj_lib_checkopt(L, 2, 1, \"\\3set\\3cur\\3end\");\r\n  int64_t ofs = 0;\r\n  cTValue *o;\r\n  int res;\r\n  if (opt == 0) opt = SEEK_SET;\r\n  else if (opt == 1) opt = SEEK_CUR;\r\n  else if (opt == 2) opt = SEEK_END;\r\n  o = L->base+2;\r\n  if (o < L->top) {\r\n    if (tvisint(o))\r\n      ofs = (int64_t)intV(o);\r\n    else if (tvisnum(o))\r\n      ofs = (int64_t)numV(o);\r\n    else if (!tvisnil(o))\r\n      lj_err_argt(L, 3, LUA_TNUMBER);\r\n  }\r\n#if LJ_TARGET_POSIX\r\n  res = fseeko(fp, ofs, opt);\r\n#elif _MSC_VER >= 1400\r\n  res = _fseeki64(fp, ofs, opt);\r\n#elif defined(__MINGW32__)\r\n  res = fseeko64(fp, ofs, opt);\r\n#else\r\n  res = fseek(fp, (long)ofs, opt);\r\n#endif\r\n  if (res)\r\n    return luaL_fileresult(L, 0, NULL);\r\n#if LJ_TARGET_POSIX\r\n  ofs = ftello(fp);\r\n#elif _MSC_VER >= 1400\r\n  ofs = _ftelli64(fp);\r\n#elif defined(__MINGW32__)\r\n  ofs = ftello64(fp);\r\n#else\r\n  ofs = (int64_t)ftell(fp);\r\n#endif\r\n  setint64V(L->top-1, ofs);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_method_setvbuf)\r\n{\r\n  FILE *fp = io_tofile(L)->fp;\r\n  int opt = lj_lib_checkopt(L, 2, -1, \"\\4full\\4line\\2no\");\r\n  size_t sz = (size_t)lj_lib_optint(L, 3, LUAL_BUFFERSIZE);\r\n  if (opt == 0) opt = _IOFBF;\r\n  else if (opt == 1) opt = _IOLBF;\r\n  else if (opt == 2) opt = _IONBF;\r\n  return luaL_fileresult(L, setvbuf(fp, NULL, opt, sz) == 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_method_lines)\r\n{\r\n  io_tofile(L);\r\n  return io_file_lines(L);\r\n}\r\n\r\nLJLIB_CF(io_method___gc)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp != NULL && (iof->type & IOFILE_TYPE_MASK) != IOFILE_TYPE_STDF)\r\n    io_file_close(L, iof);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(io_method___tostring)\r\n{\r\n  IOFileUD *iof = io_tofilep(L);\r\n  if (iof->fp != NULL)\r\n    lua_pushfstring(L, \"file (%p)\", iof->fp);\r\n  else\r\n    lua_pushliteral(L, \"file (closed)\");\r\n  return 1;\r\n}\r\n\r\nLJLIB_PUSH(top-1) LJLIB_SET(__index)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- I/O library functions ----------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_io\r\n\r\nLJLIB_PUSH(top-2) LJLIB_SET(!)  /* Set environment. */\r\n\r\nLJLIB_CF(io_open)\r\n{\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  const char *mode = s ? strdata(s) : \"r\";\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->fp = fopen(fname, mode);\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, fname);\r\n}\r\n\r\nLJLIB_CF(io_popen)\r\n{\r\n#if LJ_TARGET_POSIX || (LJ_TARGET_WINDOWS && !LJ_TARGET_XBOXONE)\r\n  const char *fname = strdata(lj_lib_checkstr(L, 1));\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  const char *mode = s ? strdata(s) : \"r\";\r\n  IOFileUD *iof = io_file_new(L);\r\n  iof->type = IOFILE_TYPE_PIPE;\r\n#if LJ_TARGET_POSIX\r\n  fflush(NULL);\r\n  iof->fp = popen(fname, mode);\r\n#else\r\n  iof->fp = _popen(fname, mode);\r\n#endif\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, fname);\r\n#else\r\n  return luaL_error(L, LUA_QL(\"popen\") \" not supported\");\r\n#endif\r\n}\r\n\r\nLJLIB_CF(io_tmpfile)\r\n{\r\n  IOFileUD *iof = io_file_new(L);\r\n#if LJ_TARGET_PS3 || LJ_TARGET_PS4 || LJ_TARGET_PSVITA\r\n  iof->fp = NULL; errno = ENOSYS;\r\n#else\r\n  iof->fp = tmpfile();\r\n#endif\r\n  return iof->fp != NULL ? 1 : luaL_fileresult(L, 0, NULL);\r\n}\r\n\r\nLJLIB_CF(io_close)\r\n{\r\n  return lj_cf_io_method_close(L);\r\n}\r\n\r\nLJLIB_CF(io_read)\r\n{\r\n  return io_file_read(L, io_stdfile(L, GCROOT_IO_INPUT), 0);\r\n}\r\n\r\nLJLIB_CF(io_write)\t\tLJLIB_REC(io_write GCROOT_IO_OUTPUT)\r\n{\r\n  return io_file_write(L, io_stdfile(L, GCROOT_IO_OUTPUT), 0);\r\n}\r\n\r\nLJLIB_CF(io_flush)\t\tLJLIB_REC(io_flush GCROOT_IO_OUTPUT)\r\n{\r\n  return luaL_fileresult(L, fflush(io_stdfile(L, GCROOT_IO_OUTPUT)) == 0, NULL);\r\n}\r\n\r\nstatic int io_std_getset(lua_State *L, ptrdiff_t id, const char *mode)\r\n{\r\n  if (L->base < L->top && !tvisnil(L->base)) {\r\n    if (tvisudata(L->base)) {\r\n      io_tofile(L);\r\n      L->top = L->base+1;\r\n    } else {\r\n      io_file_open(L, mode);\r\n    }\r\n    /* NOBARRIER: The standard I/O handles are GC roots. */\r\n    setgcref(G(L)->gcroot[id], gcV(L->top-1));\r\n  } else {\r\n    setudataV(L, L->top++, IOSTDF_UD(L, id));\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(io_input)\r\n{\r\n  return io_std_getset(L, GCROOT_IO_INPUT, \"r\");\r\n}\r\n\r\nLJLIB_CF(io_output)\r\n{\r\n  return io_std_getset(L, GCROOT_IO_OUTPUT, \"w\");\r\n}\r\n\r\nLJLIB_CF(io_lines)\r\n{\r\n  if (L->base == L->top) setnilV(L->top++);\r\n  if (!tvisnil(L->base)) {  /* io.lines(fname) */\r\n    IOFileUD *iof = io_file_open(L, \"r\");\r\n    iof->type = IOFILE_TYPE_FILE|IOFILE_FLAG_CLOSE;\r\n    L->top--;\r\n    setudataV(L, L->base, udataV(L->top));\r\n  } else {  /* io.lines() iterates over stdin. */\r\n    setudataV(L, L->base, IOSTDF_UD(L, GCROOT_IO_INPUT));\r\n  }\r\n  return io_file_lines(L);\r\n}\r\n\r\nLJLIB_CF(io_type)\r\n{\r\n  cTValue *o = lj_lib_checkany(L, 1);\r\n  if (!(tvisudata(o) && udataV(o)->udtype == UDTYPE_IO_FILE))\r\n    setnilV(L->top++);\r\n  else if (((IOFileUD *)uddata(udataV(o)))->fp != NULL)\r\n    lua_pushliteral(L, \"file\");\r\n  else\r\n    lua_pushliteral(L, \"closed file\");\r\n  return 1;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic GCobj *io_std_new(lua_State *L, FILE *fp, const char *name)\r\n{\r\n  IOFileUD *iof = (IOFileUD *)lua_newuserdata(L, sizeof(IOFileUD));\r\n  GCudata *ud = udataV(L->top-1);\r\n  ud->udtype = UDTYPE_IO_FILE;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcref(ud->metatable, gcV(L->top-3));\r\n  iof->fp = fp;\r\n  iof->type = IOFILE_TYPE_STDF;\r\n  lua_setfield(L, -2, name);\r\n  return obj2gco(ud);\r\n}\r\n\r\nLUALIB_API int luaopen_io(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, NULL, io_method);\r\n  copyTV(L, L->top, L->top-1); L->top++;\r\n  lua_setfield(L, LUA_REGISTRYINDEX, LUA_FILEHANDLE);\r\n  LJ_LIB_REG(L, LUA_IOLIBNAME, io);\r\n  setgcref(G(L)->gcroot[GCROOT_IO_INPUT], io_std_new(L, stdin, \"stdin\"));\r\n  setgcref(G(L)->gcroot[GCROOT_IO_OUTPUT], io_std_new(L, stdout, \"stdout\"));\r\n  io_std_new(L, stderr, \"stderr\");\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_jit.c",
    "content": "/*\r\n** JIT library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lib_jit_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#if LJ_HASJIT\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_target.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#include \"luajit.h\"\r\n\r\n/* -- jit.* functions ----------------------------------------------------- */\r\n\r\n#define LJLIB_MODULE_jit\r\n\r\nstatic int setjitmode(lua_State *L, int mode)\r\n{\r\n  int idx = 0;\r\n  if (L->base == L->top || tvisnil(L->base)) {  /* jit.on/off/flush([nil]) */\r\n    mode |= LUAJIT_MODE_ENGINE;\r\n  } else {\r\n    /* jit.on/off/flush(func|proto, nil|true|false) */\r\n    if (tvisfunc(L->base) || tvisproto(L->base))\r\n      idx = 1;\r\n    else if (!tvistrue(L->base))  /* jit.on/off/flush(true, nil|true|false) */\r\n      goto err;\r\n    if (L->base+1 < L->top && tvisbool(L->base+1))\r\n      mode |= boolV(L->base+1) ? LUAJIT_MODE_ALLFUNC : LUAJIT_MODE_ALLSUBFUNC;\r\n    else\r\n      mode |= LUAJIT_MODE_FUNC;\r\n  }\r\n  if (luaJIT_setmode(L, idx, mode) != 1) {\r\n    if ((mode & LUAJIT_MODE_MASK) == LUAJIT_MODE_ENGINE)\r\n      lj_err_caller(L, LJ_ERR_NOJIT);\r\n  err:\r\n    lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(jit_on)\r\n{\r\n  return setjitmode(L, LUAJIT_MODE_ON);\r\n}\r\n\r\nLJLIB_CF(jit_off)\r\n{\r\n  return setjitmode(L, LUAJIT_MODE_OFF);\r\n}\r\n\r\nLJLIB_CF(jit_flush)\r\n{\r\n#if LJ_HASJIT\r\n  if (L->base < L->top && tvisnumber(L->base)) {\r\n    int traceno = lj_lib_checkint(L, 1);\r\n    luaJIT_setmode(L, traceno, LUAJIT_MODE_FLUSH|LUAJIT_MODE_TRACE);\r\n    return 0;\r\n  }\r\n#endif\r\n  return setjitmode(L, LUAJIT_MODE_FLUSH);\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Push a string for every flag bit that is set. */\r\nstatic void flagbits_to_strings(lua_State *L, uint32_t flags, uint32_t base,\r\n\t\t\t\tconst char *str)\r\n{\r\n  for (; *str; base <<= 1, str += 1+*str)\r\n    if (flags & base)\r\n      setstrV(L, L->top++, lj_str_new(L, str+1, *(uint8_t *)str));\r\n}\r\n#endif\r\n\r\nLJLIB_CF(jit_status)\r\n{\r\n#if LJ_HASJIT\r\n  jit_State *J = L2J(L);\r\n  L->top = L->base;\r\n  setboolV(L->top++, (J->flags & JIT_F_ON) ? 1 : 0);\r\n  flagbits_to_strings(L, J->flags, JIT_F_CPU_FIRST, JIT_F_CPUSTRING);\r\n  flagbits_to_strings(L, J->flags, JIT_F_OPT_FIRST, JIT_F_OPTSTRING);\r\n  return (int)(L->top - L->base);\r\n#else\r\n  setboolV(L->top++, 0);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(jit_attach)\r\n{\r\n#ifdef LUAJIT_DISABLE_VMEVENT\r\n  luaL_error(L, \"vmevent API disabled\");\r\n#else\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  GCstr *s = lj_lib_optstr(L, 2);\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, LJ_VMEVENTS_REGKEY, LJ_VMEVENTS_HSIZE);\r\n  if (s) {  /* Attach to given event. */\r\n    const uint8_t *p = (const uint8_t *)strdata(s);\r\n    uint32_t h = s->len;\r\n    while (*p) h = h ^ (lj_rol(h, 6) + *p++);\r\n    lua_pushvalue(L, 1);\r\n    lua_rawseti(L, -2, VMEVENT_HASHIDX(h));\r\n    G(L)->vmevmask = VMEVENT_NOCACHE;  /* Invalidate cache. */\r\n  } else {  /* Detach if no event given. */\r\n    setnilV(L->top++);\r\n    while (lua_next(L, -2)) {\r\n      L->top--;\r\n      if (tvisfunc(L->top) && funcV(L->top) == fn) {\r\n\tsetnilV(lj_tab_set(L, tabV(L->top-2), L->top-1));\r\n      }\r\n    }\r\n  }\r\n#endif\r\n  return 0;\r\n}\r\n\r\nLJLIB_PUSH(top-5) LJLIB_SET(os)\r\nLJLIB_PUSH(top-4) LJLIB_SET(arch)\r\nLJLIB_PUSH(top-3) LJLIB_SET(version_num)\r\nLJLIB_PUSH(top-2) LJLIB_SET(version)\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n/* -- jit.util.* functions ------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_jit_util\r\n\r\n/* -- Reflection API for Lua functions ------------------------------------ */\r\n\r\n/* Return prototype of first argument (Lua function or prototype object) */\r\nstatic GCproto *check_Lproto(lua_State *L, int nolua)\r\n{\r\n  TValue *o = L->base;\r\n  if (L->top > o) {\r\n    if (tvisproto(o)) {\r\n      return protoV(o);\r\n    } else if (tvisfunc(o)) {\r\n      if (isluafunc(funcV(o)))\r\n\treturn funcproto(funcV(o));\r\n      else if (nolua)\r\n\treturn NULL;\r\n    }\r\n  }\r\n  lj_err_argt(L, 1, LUA_TFUNCTION);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nstatic void setintfield(lua_State *L, GCtab *t, const char *name, int32_t val)\r\n{\r\n  setintV(lj_tab_setstr(L, t, lj_str_newz(L, name)), val);\r\n}\r\n\r\n/* local info = jit.util.funcinfo(func [,pc]) */\r\nLJLIB_CF(jit_util_funcinfo)\r\n{\r\n  GCproto *pt = check_Lproto(L, 1);\r\n  if (pt) {\r\n    BCPos pc = (BCPos)lj_lib_optint(L, 2, 0);\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 16);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    setintfield(L, t, \"linedefined\", pt->firstline);\r\n    setintfield(L, t, \"lastlinedefined\", pt->firstline + pt->numline);\r\n    setintfield(L, t, \"stackslots\", pt->framesize);\r\n    setintfield(L, t, \"params\", pt->numparams);\r\n    setintfield(L, t, \"bytecodes\", (int32_t)pt->sizebc);\r\n    setintfield(L, t, \"gcconsts\", (int32_t)pt->sizekgc);\r\n    setintfield(L, t, \"nconsts\", (int32_t)pt->sizekn);\r\n    setintfield(L, t, \"upvalues\", (int32_t)pt->sizeuv);\r\n    if (pc < pt->sizebc)\r\n      setintfield(L, t, \"currentline\", lj_debug_line(pt, pc));\r\n    lua_pushboolean(L, (pt->flags & PROTO_VARARG));\r\n    lua_setfield(L, -2, \"isvararg\");\r\n    lua_pushboolean(L, (pt->flags & PROTO_CHILD));\r\n    lua_setfield(L, -2, \"children\");\r\n    setstrV(L, L->top++, proto_chunkname(pt));\r\n    lua_setfield(L, -2, \"source\");\r\n    lj_debug_pushloc(L, pt, pc);\r\n    lua_setfield(L, -2, \"loc\");\r\n  } else {\r\n    GCfunc *fn = funcV(L->base);\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 4);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    if (!iscfunc(fn))\r\n      setintfield(L, t, \"ffid\", fn->c.ffid);\r\n    setintptrV(lj_tab_setstr(L, t, lj_str_newlit(L, \"addr\")),\r\n\t       (intptr_t)(void *)fn->c.f);\r\n    setintfield(L, t, \"upvalues\", fn->c.nupvalues);\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* local ins, m = jit.util.funcbc(func, pc) */\r\nLJLIB_CF(jit_util_funcbc)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  BCPos pc = (BCPos)lj_lib_checkint(L, 2);\r\n  if (pc < pt->sizebc) {\r\n    BCIns ins = proto_bc(pt)[pc];\r\n    BCOp op = bc_op(ins);\r\n    lua_assert(op < BC__MAX);\r\n    setintV(L->top, ins);\r\n    setintV(L->top+1, lj_bc_mode[op]);\r\n    L->top += 2;\r\n    return 2;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local k = jit.util.funck(func, idx) */\r\nLJLIB_CF(jit_util_funck)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  ptrdiff_t idx = (ptrdiff_t)lj_lib_checkint(L, 2);\r\n  if (idx >= 0) {\r\n    if (idx < (ptrdiff_t)pt->sizekn) {\r\n      copyTV(L, L->top-1, proto_knumtv(pt, idx));\r\n      return 1;\r\n    }\r\n  } else {\r\n    if (~idx < (ptrdiff_t)pt->sizekgc) {\r\n      GCobj *gc = proto_kgc(pt, idx);\r\n      setgcV(L, L->top-1, gc, ~gc->gch.gct);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local name = jit.util.funcuvname(func, idx) */\r\nLJLIB_CF(jit_util_funcuvname)\r\n{\r\n  GCproto *pt = check_Lproto(L, 0);\r\n  uint32_t idx = (uint32_t)lj_lib_checkint(L, 2);\r\n  if (idx < pt->sizeuv) {\r\n    setstrV(L, L->top-1, lj_str_newz(L, lj_debug_uvname(pt, idx)));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Reflection API for traces ------------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n\r\n/* Check trace argument. Must not throw for non-existent trace numbers. */\r\nstatic GCtrace *jit_checktrace(lua_State *L)\r\n{\r\n  TraceNo tr = (TraceNo)lj_lib_checkint(L, 1);\r\n  jit_State *J = L2J(L);\r\n  if (tr > 0 && tr < J->sizetrace)\r\n    return traceref(J, tr);\r\n  return NULL;\r\n}\r\n\r\n/* Names of link types. ORDER LJ_TRLINK */\r\nstatic const char *const jit_trlinkname[] = {\r\n  \"none\", \"root\", \"loop\", \"tail-recursion\", \"up-recursion\", \"down-recursion\",\r\n  \"interpreter\", \"return\", \"stitch\"\r\n};\r\n\r\n/* local info = jit.util.traceinfo(tr) */\r\nLJLIB_CF(jit_util_traceinfo)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  if (T) {\r\n    GCtab *t;\r\n    lua_createtable(L, 0, 8);  /* Increment hash size if fields are added. */\r\n    t = tabV(L->top-1);\r\n    setintfield(L, t, \"nins\", (int32_t)T->nins - REF_BIAS - 1);\r\n    setintfield(L, t, \"nk\", REF_BIAS - (int32_t)T->nk);\r\n    setintfield(L, t, \"link\", T->link);\r\n    setintfield(L, t, \"nexit\", T->nsnap);\r\n    setstrV(L, L->top++, lj_str_newz(L, jit_trlinkname[T->linktype]));\r\n    lua_setfield(L, -2, \"linktype\");\r\n    /* There are many more fields. Add them only when needed. */\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local m, ot, op1, op2, prev = jit.util.traceir(tr, idx) */\r\nLJLIB_CF(jit_util_traceir)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  IRRef ref = (IRRef)lj_lib_checkint(L, 2) + REF_BIAS;\r\n  if (T && ref >= REF_BIAS && ref < T->nins) {\r\n    IRIns *ir = &T->ir[ref];\r\n    int32_t m = lj_ir_mode[ir->o];\r\n    setintV(L->top-2, m);\r\n    setintV(L->top-1, ir->ot);\r\n    setintV(L->top++, (int32_t)ir->op1 - (irm_op1(m)==IRMref ? REF_BIAS : 0));\r\n    setintV(L->top++, (int32_t)ir->op2 - (irm_op2(m)==IRMref ? REF_BIAS : 0));\r\n    setintV(L->top++, ir->prev);\r\n    return 5;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local k, t [, slot] = jit.util.tracek(tr, idx) */\r\nLJLIB_CF(jit_util_tracek)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  IRRef ref = (IRRef)lj_lib_checkint(L, 2) + REF_BIAS;\r\n  if (T && ref >= T->nk && ref < REF_BIAS) {\r\n    IRIns *ir = &T->ir[ref];\r\n    int32_t slot = -1;\r\n    if (ir->o == IR_KSLOT) {\r\n      slot = ir->op2;\r\n      ir = &T->ir[ir->op1];\r\n    }\r\n#if LJ_HASFFI\r\n    if (ir->o == IR_KINT64 && !ctype_ctsG(G(L))) {\r\n      ptrdiff_t oldtop = savestack(L, L->top);\r\n      luaopen_ffi(L);  /* Load FFI library on-demand. */\r\n      L->top = restorestack(L, oldtop);\r\n    }\r\n#endif\r\n    lj_ir_kvalue(L, L->top-2, ir);\r\n    setintV(L->top-1, (int32_t)irt_type(ir->t));\r\n    if (slot == -1)\r\n      return 2;\r\n    setintV(L->top++, slot);\r\n    return 3;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local snap = jit.util.tracesnap(tr, sn) */\r\nLJLIB_CF(jit_util_tracesnap)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  SnapNo sn = (SnapNo)lj_lib_checkint(L, 2);\r\n  if (T && sn < T->nsnap) {\r\n    SnapShot *snap = &T->snap[sn];\r\n    SnapEntry *map = &T->snapmap[snap->mapofs];\r\n    MSize n, nent = snap->nent;\r\n    GCtab *t;\r\n    lua_createtable(L, nent+2, 0);\r\n    t = tabV(L->top-1);\r\n    setintV(lj_tab_setint(L, t, 0), (int32_t)snap->ref - REF_BIAS);\r\n    setintV(lj_tab_setint(L, t, 1), (int32_t)snap->nslots);\r\n    for (n = 0; n < nent; n++)\r\n      setintV(lj_tab_setint(L, t, (int32_t)(n+2)), (int32_t)map[n]);\r\n    setintV(lj_tab_setint(L, t, (int32_t)(nent+2)), (int32_t)SNAP(255, 0, 0));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local mcode, addr, loop = jit.util.tracemc(tr) */\r\nLJLIB_CF(jit_util_tracemc)\r\n{\r\n  GCtrace *T = jit_checktrace(L);\r\n  if (T && T->mcode != NULL) {\r\n    setstrV(L, L->top-1, lj_str_new(L, (const char *)T->mcode, T->szmcode));\r\n    setintptrV(L->top++, (intptr_t)(void *)T->mcode);\r\n    setintV(L->top++, T->mcloop);\r\n    return 3;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* local addr = jit.util.traceexitstub([tr,] exitno) */\r\nLJLIB_CF(jit_util_traceexitstub)\r\n{\r\n#ifdef EXITSTUBS_PER_GROUP\r\n  ExitNo exitno = (ExitNo)lj_lib_checkint(L, 1);\r\n  jit_State *J = L2J(L);\r\n  if (exitno < EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR) {\r\n    setintptrV(L->top-1, (intptr_t)(void *)exitstub_addr(J, exitno));\r\n    return 1;\r\n  }\r\n#else\r\n  if (L->top > L->base+1) {  /* Don't throw for one-argument variant. */\r\n    GCtrace *T = jit_checktrace(L);\r\n    ExitNo exitno = (ExitNo)lj_lib_checkint(L, 2);\r\n    ExitNo maxexit = T->root ? T->nsnap+1 : T->nsnap;\r\n    if (T && T->mcode != NULL && exitno < maxexit) {\r\n      setintptrV(L->top-1, (intptr_t)(void *)exitstub_trace_addr(T, exitno));\r\n      return 1;\r\n    }\r\n  }\r\n#endif\r\n  return 0;\r\n}\r\n\r\n/* local addr = jit.util.ircalladdr(idx) */\r\nLJLIB_CF(jit_util_ircalladdr)\r\n{\r\n  uint32_t idx = (uint32_t)lj_lib_checkint(L, 1);\r\n  if (idx < IRCALL__MAX) {\r\n    setintptrV(L->top-1, (intptr_t)(void *)lj_ir_callinfo[idx].func);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n#endif\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nstatic int luaopen_jit_util(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, NULL, jit_util);\r\n  return 1;\r\n}\r\n\r\n/* -- jit.opt module ------------------------------------------------------ */\r\n\r\n#if LJ_HASJIT\r\n\r\n#define LJLIB_MODULE_jit_opt\r\n\r\n/* Parse optimization level. */\r\nstatic int jitopt_level(jit_State *J, const char *str)\r\n{\r\n  if (str[0] >= '0' && str[0] <= '9' && str[1] == '\\0') {\r\n    uint32_t flags;\r\n    if (str[0] == '0') flags = JIT_F_OPT_0;\r\n    else if (str[0] == '1') flags = JIT_F_OPT_1;\r\n    else if (str[0] == '2') flags = JIT_F_OPT_2;\r\n    else flags = JIT_F_OPT_3;\r\n    J->flags = (J->flags & ~JIT_F_OPT_MASK) | flags;\r\n    return 1;  /* Ok. */\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* Parse optimization flag. */\r\nstatic int jitopt_flag(jit_State *J, const char *str)\r\n{\r\n  const char *lst = JIT_F_OPTSTRING;\r\n  uint32_t opt;\r\n  int set = 1;\r\n  if (str[0] == '+') {\r\n    str++;\r\n  } else if (str[0] == '-') {\r\n    str++;\r\n    set = 0;\r\n  } else if (str[0] == 'n' && str[1] == 'o') {\r\n    str += str[2] == '-' ? 3 : 2;\r\n    set = 0;\r\n  }\r\n  for (opt = JIT_F_OPT_FIRST; ; opt <<= 1) {\r\n    size_t len = *(const uint8_t *)lst;\r\n    if (len == 0)\r\n      break;\r\n    if (strncmp(str, lst+1, len) == 0 && str[len] == '\\0') {\r\n      if (set) J->flags |= opt; else J->flags &= ~opt;\r\n      return 1;  /* Ok. */\r\n    }\r\n    lst += 1+len;\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* Parse optimization parameter. */\r\nstatic int jitopt_param(jit_State *J, const char *str)\r\n{\r\n  const char *lst = JIT_P_STRING;\r\n  int i;\r\n  for (i = 0; i < JIT_P__MAX; i++) {\r\n    size_t len = *(const uint8_t *)lst;\r\n    lua_assert(len != 0);\r\n    if (strncmp(str, lst+1, len) == 0 && str[len] == '=') {\r\n      int32_t n = 0;\r\n      const char *p = &str[len+1];\r\n      while (*p >= '0' && *p <= '9')\r\n\tn = n*10 + (*p++ - '0');\r\n      if (*p) return 0;  /* Malformed number. */\r\n      J->param[i] = n;\r\n      if (i == JIT_P_hotloop)\r\n\tlj_dispatch_init_hotcount(J2G(J));\r\n      return 1;  /* Ok. */\r\n    }\r\n    lst += 1+len;\r\n  }\r\n  return 0;  /* No match. */\r\n}\r\n\r\n/* jit.opt.start(flags...) */\r\nLJLIB_CF(jit_opt_start)\r\n{\r\n  jit_State *J = L2J(L);\r\n  int nargs = (int)(L->top - L->base);\r\n  if (nargs == 0) {\r\n    J->flags = (J->flags & ~JIT_F_OPT_MASK) | JIT_F_OPT_DEFAULT;\r\n  } else {\r\n    int i;\r\n    for (i = 1; i <= nargs; i++) {\r\n      const char *str = strdata(lj_lib_checkstr(L, i));\r\n      if (!jitopt_level(J, str) &&\r\n\t  !jitopt_flag(J, str) &&\r\n\t  !jitopt_param(J, str))\r\n\tlj_err_callerv(L, LJ_ERR_JITOPT, str);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\n#endif\r\n\r\n/* -- jit.profile module -------------------------------------------------- */\r\n\r\n#if LJ_HASPROFILE\r\n\r\n#define LJLIB_MODULE_jit_profile\r\n\r\n/* Not loaded by default, use: local profile = require(\"jit.profile\") */\r\n\r\nstatic const char KEY_PROFILE_THREAD = 't';\r\nstatic const char KEY_PROFILE_FUNC = 'f';\r\n\r\nstatic void jit_profile_callback(lua_State *L2, lua_State *L, int samples,\r\n\t\t\t\t int vmstate)\r\n{\r\n  TValue key;\r\n  cTValue *tv;\r\n  setlightudV(&key, (void *)&KEY_PROFILE_FUNC);\r\n  tv = lj_tab_get(L, tabV(registry(L)), &key);\r\n  if (tvisfunc(tv)) {\r\n    char vmst = (char)vmstate;\r\n    int status;\r\n    setfuncV(L2, L2->top++, funcV(tv));\r\n    setthreadV(L2, L2->top++, L);\r\n    setintV(L2->top++, samples);\r\n    setstrV(L2, L2->top++, lj_str_new(L2, &vmst, 1));\r\n    status = lua_pcall(L2, 3, 0, 0);  /* callback(thread, samples, vmstate) */\r\n    if (status) {\r\n      if (G(L2)->panic) G(L2)->panic(L2);\r\n      exit(EXIT_FAILURE);\r\n    }\r\n    lj_trace_abort(G(L2));\r\n  }\r\n}\r\n\r\n/* profile.start(mode, cb) */\r\nLJLIB_CF(jit_profile_start)\r\n{\r\n  GCtab *registry = tabV(registry(L));\r\n  GCstr *mode = lj_lib_optstr(L, 1);\r\n  GCfunc *func = lj_lib_checkfunc(L, 2);\r\n  lua_State *L2 = lua_newthread(L);  /* Thread that runs profiler callback. */\r\n  TValue key;\r\n  /* Anchor thread and function in registry. */\r\n  setlightudV(&key, (void *)&KEY_PROFILE_THREAD);\r\n  setthreadV(L, lj_tab_set(L, registry, &key), L2);\r\n  setlightudV(&key, (void *)&KEY_PROFILE_FUNC);\r\n  setfuncV(L, lj_tab_set(L, registry, &key), func);\r\n  lj_gc_anybarriert(L, registry);\r\n  luaJIT_profile_start(L, mode ? strdata(mode) : \"\",\r\n\t\t       (luaJIT_profile_callback)jit_profile_callback, L2);\r\n  return 0;\r\n}\r\n\r\n/* profile.stop() */\r\nLJLIB_CF(jit_profile_stop)\r\n{\r\n  GCtab *registry;\r\n  TValue key;\r\n  luaJIT_profile_stop(L);\r\n  registry = tabV(registry(L));\r\n  setlightudV(&key, (void *)&KEY_PROFILE_THREAD);\r\n  setnilV(lj_tab_set(L, registry, &key));\r\n  setlightudV(&key, (void *)&KEY_PROFILE_FUNC);\r\n  setnilV(lj_tab_set(L, registry, &key));\r\n  lj_gc_anybarriert(L, registry);\r\n  return 0;\r\n}\r\n\r\n/* dump = profile.dumpstack([thread,] fmt, depth) */\r\nLJLIB_CF(jit_profile_dumpstack)\r\n{\r\n  lua_State *L2 = L;\r\n  int arg = 0;\r\n  size_t len;\r\n  int depth;\r\n  GCstr *fmt;\r\n  const char *p;\r\n  if (L->top > L->base && tvisthread(L->base)) {\r\n    L2 = threadV(L->base);\r\n    arg = 1;\r\n  }\r\n  fmt = lj_lib_checkstr(L, arg+1);\r\n  depth = lj_lib_checkint(L, arg+2);\r\n  p = luaJIT_profile_dumpstack(L2, strdata(fmt), depth, &len);\r\n  lua_pushlstring(L, p, len);\r\n  return 1;\r\n}\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nstatic int luaopen_jit_profile(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, NULL, jit_profile);\r\n  return 1;\r\n}\r\n\r\n#endif\r\n\r\n/* -- JIT compiler initialization ----------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n/* Default values for JIT parameters. */\r\nstatic const int32_t jit_param_default[JIT_P__MAX+1] = {\r\n#define JIT_PARAMINIT(len, name, value)\t(value),\r\nJIT_PARAMDEF(JIT_PARAMINIT)\r\n#undef JIT_PARAMINIT\r\n  0\r\n};\r\n#endif\r\n\r\n#if LJ_TARGET_ARM && LJ_TARGET_LINUX\r\n#include <sys/utsname.h>\r\n#endif\r\n\r\n/* Arch-dependent CPU detection. */\r\nstatic uint32_t jit_cpudetect(lua_State *L)\r\n{\r\n  uint32_t flags = 0;\r\n#if LJ_TARGET_X86ORX64\r\n  uint32_t vendor[4];\r\n  uint32_t features[4];\r\n  if (lj_vm_cpuid(0, vendor) && lj_vm_cpuid(1, features)) {\r\n#if !LJ_HASJIT\r\n#define JIT_F_SSE2\t2\r\n#endif\r\n    flags |= ((features[3] >> 26)&1) * JIT_F_SSE2;\r\n#if LJ_HASJIT\r\n    flags |= ((features[2] >> 0)&1) * JIT_F_SSE3;\r\n    flags |= ((features[2] >> 19)&1) * JIT_F_SSE4_1;\r\n    if (vendor[2] == 0x6c65746e) {  /* Intel. */\r\n      if ((features[0] & 0x0fff0ff0) == 0x000106c0)  /* Atom. */\r\n\tflags |= JIT_F_LEA_AGU;\r\n    } else if (vendor[2] == 0x444d4163) {  /* AMD. */\r\n      uint32_t fam = (features[0] & 0x0ff00f00);\r\n      if (fam >= 0x00000f00)  /* K8, K10. */\r\n\tflags |= JIT_F_PREFER_IMUL;\r\n    }\r\n#endif\r\n  }\r\n  /* Check for required instruction set support on x86 (unnecessary on x64). */\r\n#if LJ_TARGET_X86\r\n  if (!(flags & JIT_F_SSE2))\r\n    luaL_error(L, \"CPU with SSE2 required\");\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if LJ_HASJIT\r\n  int ver = LJ_ARCH_VERSION;  /* Compile-time ARM CPU detection. */\r\n#if LJ_TARGET_LINUX\r\n  if (ver < 70) {  /* Runtime ARM CPU detection. */\r\n    struct utsname ut;\r\n    uname(&ut);\r\n    if (strncmp(ut.machine, \"armv\", 4) == 0) {\r\n      if (ut.machine[4] >= '7')\r\n\tver = 70;\r\n      else if (ut.machine[4] == '6')\r\n\tver = 60;\r\n    }\r\n  }\r\n#endif\r\n  flags |= ver >= 70 ? JIT_F_ARMV7 :\r\n\t   ver >= 61 ? JIT_F_ARMV6T2_ :\r\n\t   ver >= 60 ? JIT_F_ARMV6_ : 0;\r\n  flags |= LJ_ARCH_HASFPU == 0 ? 0 : ver >= 70 ? JIT_F_VFPV3 : JIT_F_VFPV2;\r\n#endif\r\n#elif LJ_TARGET_ARM64\r\n  /* No optional CPU features to detect (for now). */\r\n#elif LJ_TARGET_PPC\r\n#if LJ_HASJIT\r\n#if LJ_ARCH_SQRT\r\n  flags |= JIT_F_SQRT;\r\n#endif\r\n#if LJ_ARCH_ROUND\r\n  flags |= JIT_F_ROUND;\r\n#endif\r\n#endif\r\n#elif LJ_TARGET_MIPS\r\n#if LJ_HASJIT\r\n  /* Compile-time MIPS CPU detection. */\r\n#if LJ_ARCH_VERSION >= 20\r\n  flags |= JIT_F_MIPS32R2;\r\n#endif\r\n  /* Runtime MIPS CPU detection. */\r\n#if defined(__GNUC__)\r\n  if (!(flags & JIT_F_MIPS32R2)) {\r\n    int x;\r\n    /* On MIPS32R1 rotr is treated as srl. rotr r2,r2,1 -> srl r2,r2,1. */\r\n    __asm__(\"li $2, 1\\n\\t.long 0x00221042\\n\\tmove %0, $2\" : \"=r\"(x) : : \"$2\");\r\n    if (x) flags |= JIT_F_MIPS32R2;  /* Either 0x80000000 (R2) or 0 (R1). */\r\n  }\r\n#endif\r\n#endif\r\n#else\r\n#error \"Missing CPU detection for this architecture\"\r\n#endif\r\n  UNUSED(L);\r\n  return flags;\r\n}\r\n\r\n/* Initialize JIT compiler. */\r\nstatic void jit_init(lua_State *L)\r\n{\r\n  uint32_t flags = jit_cpudetect(L);\r\n#if LJ_HASJIT\r\n  jit_State *J = L2J(L);\r\n  J->flags = flags | JIT_F_ON | JIT_F_OPT_DEFAULT;\r\n  memcpy(J->param, jit_param_default, sizeof(J->param));\r\n  lj_dispatch_update(G(L));\r\n#else\r\n  UNUSED(flags);\r\n#endif\r\n}\r\n\r\nLUALIB_API int luaopen_jit(lua_State *L)\r\n{\r\n  jit_init(L);\r\n  lua_pushliteral(L, LJ_OS_NAME);\r\n  lua_pushliteral(L, LJ_ARCH_NAME);\r\n  lua_pushinteger(L, LUAJIT_VERSION_NUM);\r\n  lua_pushliteral(L, LUAJIT_VERSION);\r\n  LJ_LIB_REG(L, LUA_JITLIBNAME, jit);\r\n#if LJ_HASPROFILE\r\n  lj_lib_prereg(L, LUA_JITLIBNAME \".profile\", luaopen_jit_profile,\r\n\t\ttabref(L->env));\r\n#endif\r\n#ifndef LUAJIT_DISABLE_JITUTIL\r\n  lj_lib_prereg(L, LUA_JITLIBNAME \".util\", luaopen_jit_util, tabref(L->env));\r\n#endif\r\n#if LJ_HASJIT\r\n  LJ_LIB_REG(L, \"jit.opt\", jit_opt);\r\n#endif\r\n  L->top -= 2;\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_math.c",
    "content": "/*\r\n** Math library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <math.h>\r\n\r\n#define lib_math_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lib.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_math\r\n\r\nLJLIB_ASM(math_abs)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknumber(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_floor)\t\tLJLIB_REC(math_round IRFPM_FLOOR)\r\nLJLIB_ASM_(math_ceil)\t\tLJLIB_REC(math_round IRFPM_CEIL)\r\n\r\nLJLIB_ASM(math_sqrt)\t\tLJLIB_REC(math_unary IRFPM_SQRT)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_log10)\t\tLJLIB_REC(math_unary IRFPM_LOG10)\r\nLJLIB_ASM_(math_exp)\t\tLJLIB_REC(math_unary IRFPM_EXP)\r\nLJLIB_ASM_(math_sin)\t\tLJLIB_REC(math_unary IRFPM_SIN)\r\nLJLIB_ASM_(math_cos)\t\tLJLIB_REC(math_unary IRFPM_COS)\r\nLJLIB_ASM_(math_tan)\t\tLJLIB_REC(math_unary IRFPM_TAN)\r\nLJLIB_ASM_(math_asin)\t\tLJLIB_REC(math_atrig FF_math_asin)\r\nLJLIB_ASM_(math_acos)\t\tLJLIB_REC(math_atrig FF_math_acos)\r\nLJLIB_ASM_(math_atan)\t\tLJLIB_REC(math_atrig FF_math_atan)\r\nLJLIB_ASM_(math_sinh)\t\tLJLIB_REC(math_htrig IRCALL_sinh)\r\nLJLIB_ASM_(math_cosh)\t\tLJLIB_REC(math_htrig IRCALL_cosh)\r\nLJLIB_ASM_(math_tanh)\t\tLJLIB_REC(math_htrig IRCALL_tanh)\r\nLJLIB_ASM_(math_frexp)\r\nLJLIB_ASM_(math_modf)\t\tLJLIB_REC(.)\r\n\r\nLJLIB_ASM(math_log)\t\tLJLIB_REC(math_log)\r\n{\r\n  double x = lj_lib_checknum(L, 1);\r\n  if (L->base+1 < L->top) {\r\n    double y = lj_lib_checknum(L, 2);\r\n#ifdef LUAJIT_NO_LOG2\r\n    x = log(x); y = 1.0 / log(y);\r\n#else\r\n    x = lj_vm_log2(x); y = 1.0 / lj_vm_log2(y);\r\n#endif\r\n    setnumV(L->base-1-LJ_FR2, x*y);  /* Do NOT join the expression to x / y. */\r\n    return FFH_RES(1);\r\n  }\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_LUA(math_deg) /* function(x) return x * 57.29577951308232 end */\r\nLJLIB_LUA(math_rad) /* function(x) return x * 0.017453292519943295 end */\r\n\r\nLJLIB_ASM(math_atan2)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n  lj_lib_checknum(L, 2);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_pow)\t\tLJLIB_REC(.)\r\nLJLIB_ASM_(math_fmod)\r\n\r\nLJLIB_ASM(math_ldexp)\t\tLJLIB_REC(.)\r\n{\r\n  lj_lib_checknum(L, 1);\r\n#if LJ_DUALNUM && !LJ_TARGET_X86ORX64\r\n  lj_lib_checkint(L, 2);\r\n#else\r\n  lj_lib_checknum(L, 2);\r\n#endif\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_ASM(math_min)\t\tLJLIB_REC(math_minmax IR_MIN)\r\n{\r\n  int i = 0;\r\n  do { lj_lib_checknumber(L, ++i); } while (L->base+i < L->top);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(math_max)\t\tLJLIB_REC(math_minmax IR_MAX)\r\n\r\nLJLIB_PUSH(3.14159265358979323846) LJLIB_SET(pi)\r\nLJLIB_PUSH(1e310) LJLIB_SET(huge)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* This implements a Tausworthe PRNG with period 2^223. Based on:\r\n**   Tables of maximally-equidistributed combined LFSR generators,\r\n**   Pierre L'Ecuyer, 1991, table 3, 1st entry.\r\n** Full-period ME-CF generator with L=64, J=4, k=223, N1=49.\r\n*/\r\n\r\n/* PRNG state. */\r\nstruct RandomState {\r\n  uint64_t gen[4];\t/* State of the 4 LFSR generators. */\r\n  int valid;\t\t/* State is valid. */\r\n};\r\n\r\n/* Union needed for bit-pattern conversion between uint64_t and double. */\r\ntypedef union { uint64_t u64; double d; } U64double;\r\n\r\n/* Update generator i and compute a running xor of all states. */\r\n#define TW223_GEN(i, k, q, s) \\\r\n  z = rs->gen[i]; \\\r\n  z = (((z<<q)^z) >> (k-s)) ^ ((z&((uint64_t)(int64_t)-1 << (64-k)))<<s); \\\r\n  r ^= z; rs->gen[i] = z;\r\n\r\n/* PRNG step function. Returns a double in the range 1.0 <= d < 2.0. */\r\nLJ_NOINLINE uint64_t LJ_FASTCALL lj_math_random_step(RandomState *rs)\r\n{\r\n  uint64_t z, r = 0;\r\n  TW223_GEN(0, 63, 31, 18)\r\n  TW223_GEN(1, 58, 19, 28)\r\n  TW223_GEN(2, 55, 24,  7)\r\n  TW223_GEN(3, 47, 21,  8)\r\n  return (r & U64x(000fffff,ffffffff)) | U64x(3ff00000,00000000);\r\n}\r\n\r\n/* PRNG initialization function. */\r\nstatic void random_init(RandomState *rs, double d)\r\n{\r\n  uint32_t r = 0x11090601;  /* 64-k[i] as four 8 bit constants. */\r\n  int i;\r\n  for (i = 0; i < 4; i++) {\r\n    U64double u;\r\n    uint32_t m = 1u << (r&255);\r\n    r >>= 8;\r\n    u.d = d = d * 3.14159265358979323846 + 2.7182818284590452354;\r\n    if (u.u64 < m) u.u64 += m;  /* Ensure k[i] MSB of gen[i] are non-zero. */\r\n    rs->gen[i] = u.u64;\r\n  }\r\n  rs->valid = 1;\r\n  for (i = 0; i < 10; i++)\r\n    lj_math_random_step(rs);\r\n}\r\n\r\n/* PRNG extract function. */\r\nLJLIB_PUSH(top-2)  /* Upvalue holds userdata with RandomState. */\r\nLJLIB_CF(math_random)\t\tLJLIB_REC(.)\r\n{\r\n  int n = (int)(L->top - L->base);\r\n  RandomState *rs = (RandomState *)(uddata(udataV(lj_lib_upvalue(L, 1))));\r\n  U64double u;\r\n  double d;\r\n  if (LJ_UNLIKELY(!rs->valid)) random_init(rs, 0.0);\r\n  u.u64 = lj_math_random_step(rs);\r\n  d = u.d - 1.0;\r\n  if (n > 0) {\r\n#if LJ_DUALNUM\r\n    int isint = 1;\r\n    double r1;\r\n    lj_lib_checknumber(L, 1);\r\n    if (tvisint(L->base)) {\r\n      r1 = (lua_Number)intV(L->base);\r\n    } else {\r\n      isint = 0;\r\n      r1 = numV(L->base);\r\n    }\r\n#else\r\n    double r1 = lj_lib_checknum(L, 1);\r\n#endif\r\n    if (n == 1) {\r\n      d = lj_vm_floor(d*r1) + 1.0;  /* d is an int in range [1, r1] */\r\n    } else {\r\n#if LJ_DUALNUM\r\n      double r2;\r\n      lj_lib_checknumber(L, 2);\r\n      if (tvisint(L->base+1)) {\r\n\tr2 = (lua_Number)intV(L->base+1);\r\n      } else {\r\n\tisint = 0;\r\n\tr2 = numV(L->base+1);\r\n      }\r\n#else\r\n      double r2 = lj_lib_checknum(L, 2);\r\n#endif\r\n      d = lj_vm_floor(d*(r2-r1+1.0)) + r1;  /* d is an int in range [r1, r2] */\r\n    }\r\n#if LJ_DUALNUM\r\n    if (isint) {\r\n      setintV(L->top-1, lj_num2int(d));\r\n      return 1;\r\n    }\r\n#endif\r\n  }  /* else: d is a double in range [0, 1] */\r\n  setnumV(L->top++, d);\r\n  return 1;\r\n}\r\n\r\n/* PRNG seed function. */\r\nLJLIB_PUSH(top-2)  /* Upvalue holds userdata with RandomState. */\r\nLJLIB_CF(math_randomseed)\r\n{\r\n  RandomState *rs = (RandomState *)(uddata(udataV(lj_lib_upvalue(L, 1))));\r\n  random_init(rs, lj_lib_checknum(L, 1));\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_math(lua_State *L)\r\n{\r\n  RandomState *rs;\r\n  rs = (RandomState *)lua_newuserdata(L, sizeof(RandomState));\r\n  rs->valid = 0;  /* Use lazy initialization to save some time on startup. */\r\n  LJ_LIB_REG(L, LUA_MATHLIBNAME, math);\r\n#if defined(LUA_COMPAT_MOD) && !LJ_52\r\n  lua_getfield(L, -1, \"fmod\");\r\n  lua_setfield(L, -2, \"mod\");\r\n#endif\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_os.c",
    "content": "/*\r\n** OS library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <time.h>\r\n\r\n#define lib_os_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_lib.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <unistd.h>\r\n#else\r\n#include <stdio.h>\r\n#endif\r\n\r\n#if !LJ_TARGET_PSVITA\r\n#include <locale.h>\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_os\r\n\r\nLJLIB_CF(os_execute)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n#if LJ_52\r\n  errno = ENOSYS;\r\n  return luaL_fileresult(L, 0, NULL);\r\n#else\r\n  lua_pushinteger(L, -1);\r\n  return 1;\r\n#endif\r\n#else\r\n  const char *cmd = luaL_optstring(L, 1, NULL);\r\n  int stat = system(cmd);\r\n#if LJ_52\r\n  if (cmd)\r\n    return luaL_execresult(L, stat);\r\n  setboolV(L->top++, 1);\r\n#else\r\n  setintV(L->top++, stat);\r\n#endif\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(os_remove)\r\n{\r\n  const char *filename = luaL_checkstring(L, 1);\r\n  return luaL_fileresult(L, remove(filename) == 0, filename);\r\n}\r\n\r\nLJLIB_CF(os_rename)\r\n{\r\n  const char *fromname = luaL_checkstring(L, 1);\r\n  const char *toname = luaL_checkstring(L, 2);\r\n  return luaL_fileresult(L, rename(fromname, toname) == 0, fromname);\r\n}\r\n\r\nLJLIB_CF(os_tmpname)\r\n{\r\n#if LJ_TARGET_PS3 || LJ_TARGET_PS4 || LJ_TARGET_PSVITA\r\n  lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n  return 0;\r\n#else\r\n#if LJ_TARGET_POSIX\r\n  char buf[15+1];\r\n  int fp;\r\n  strcpy(buf, \"/tmp/lua_XXXXXX\");\r\n  fp = mkstemp(buf);\r\n  if (fp != -1)\r\n    close(fp);\r\n  else\r\n    lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n#else\r\n  char buf[L_tmpnam];\r\n  if (tmpnam(buf) == NULL)\r\n    lj_err_caller(L, LJ_ERR_OSUNIQF);\r\n#endif\r\n  lua_pushstring(L, buf);\r\n  return 1;\r\n#endif\r\n}\r\n\r\nLJLIB_CF(os_getenv)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  lua_pushnil(L);\r\n#else\r\n  lua_pushstring(L, getenv(luaL_checkstring(L, 1)));  /* if NULL push nil */\r\n#endif\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_exit)\r\n{\r\n  int status;\r\n  if (L->base < L->top && tvisbool(L->base))\r\n    status = boolV(L->base) ? EXIT_SUCCESS : EXIT_FAILURE;\r\n  else\r\n    status = lj_lib_optint(L, 1, EXIT_SUCCESS);\r\n  if (L->base+1 < L->top && tvistruecond(L->base+1))\r\n    lua_close(L);\r\n  exit(status);\r\n  return 0;  /* Unreachable. */\r\n}\r\n\r\nLJLIB_CF(os_clock)\r\n{\r\n  setnumV(L->top++, ((lua_Number)clock())*(1.0/(lua_Number)CLOCKS_PER_SEC));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void setfield(lua_State *L, const char *key, int value)\r\n{\r\n  lua_pushinteger(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic void setboolfield(lua_State *L, const char *key, int value)\r\n{\r\n  if (value < 0)  /* undefined? */\r\n    return;  /* does not set field */\r\n  lua_pushboolean(L, value);\r\n  lua_setfield(L, -2, key);\r\n}\r\n\r\nstatic int getboolfield(lua_State *L, const char *key)\r\n{\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  res = lua_isnil(L, -1) ? -1 : lua_toboolean(L, -1);\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\nstatic int getfield(lua_State *L, const char *key, int d)\r\n{\r\n  int res;\r\n  lua_getfield(L, -1, key);\r\n  if (lua_isnumber(L, -1)) {\r\n    res = (int)lua_tointeger(L, -1);\r\n  } else {\r\n    if (d < 0)\r\n      lj_err_callerv(L, LJ_ERR_OSDATEF, key);\r\n    res = d;\r\n  }\r\n  lua_pop(L, 1);\r\n  return res;\r\n}\r\n\r\nLJLIB_CF(os_date)\r\n{\r\n  const char *s = luaL_optstring(L, 1, \"%c\");\r\n  time_t t = luaL_opt(L, (time_t)luaL_checknumber, 2, time(NULL));\r\n  struct tm *stm;\r\n#if LJ_TARGET_POSIX\r\n  struct tm rtm;\r\n#endif\r\n  if (*s == '!') {  /* UTC? */\r\n    s++;  /* Skip '!' */\r\n#if LJ_TARGET_POSIX\r\n    stm = gmtime_r(&t, &rtm);\r\n#else\r\n    stm = gmtime(&t);\r\n#endif\r\n  } else {\r\n#if LJ_TARGET_POSIX\r\n    stm = localtime_r(&t, &rtm);\r\n#else\r\n    stm = localtime(&t);\r\n#endif\r\n  }\r\n  if (stm == NULL) {  /* Invalid date? */\r\n    setnilV(L->top++);\r\n  } else if (strcmp(s, \"*t\") == 0) {\r\n    lua_createtable(L, 0, 9);  /* 9 = number of fields */\r\n    setfield(L, \"sec\", stm->tm_sec);\r\n    setfield(L, \"min\", stm->tm_min);\r\n    setfield(L, \"hour\", stm->tm_hour);\r\n    setfield(L, \"day\", stm->tm_mday);\r\n    setfield(L, \"month\", stm->tm_mon+1);\r\n    setfield(L, \"year\", stm->tm_year+1900);\r\n    setfield(L, \"wday\", stm->tm_wday+1);\r\n    setfield(L, \"yday\", stm->tm_yday+1);\r\n    setboolfield(L, \"isdst\", stm->tm_isdst);\r\n  } else if (*s) {\r\n    SBuf *sb = &G(L)->tmpbuf;\r\n    MSize sz = 0;\r\n    const char *q;\r\n    for (q = s; *q; q++)\r\n      sz += (*q == '%') ? 30 : 1;  /* Overflow doesn't matter. */\r\n    setsbufL(sb, L);\r\n    for (;;) {\r\n      char *buf = lj_buf_need(sb, sz);\r\n      size_t len = strftime(buf, sbufsz(sb), s, stm);\r\n      if (len) {\r\n\tsetstrV(L, L->top++, lj_str_new(L, buf, len));\r\n\tlj_gc_check(L);\r\n\tbreak;\r\n      }\r\n      sz += (sz|1);\r\n    }\r\n  } else {\r\n    setstrV(L, L->top++, &G(L)->strempty);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_time)\r\n{\r\n  time_t t;\r\n  if (lua_isnoneornil(L, 1)) {  /* called without args? */\r\n    t = time(NULL);  /* get current time */\r\n  } else {\r\n    struct tm ts;\r\n    luaL_checktype(L, 1, LUA_TTABLE);\r\n    lua_settop(L, 1);  /* make sure table is at the top */\r\n    ts.tm_sec = getfield(L, \"sec\", 0);\r\n    ts.tm_min = getfield(L, \"min\", 0);\r\n    ts.tm_hour = getfield(L, \"hour\", 12);\r\n    ts.tm_mday = getfield(L, \"day\", -1);\r\n    ts.tm_mon = getfield(L, \"month\", -1) - 1;\r\n    ts.tm_year = getfield(L, \"year\", -1) - 1900;\r\n    ts.tm_isdst = getboolfield(L, \"isdst\");\r\n    t = mktime(&ts);\r\n  }\r\n  if (t == (time_t)(-1))\r\n    lua_pushnil(L);\r\n  else\r\n    lua_pushnumber(L, (lua_Number)t);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(os_difftime)\r\n{\r\n  lua_pushnumber(L, difftime((time_t)(luaL_checknumber(L, 1)),\r\n\t\t\t     (time_t)(luaL_optnumber(L, 2, (lua_Number)0))));\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nLJLIB_CF(os_setlocale)\r\n{\r\n#if LJ_TARGET_PSVITA\r\n  lua_pushliteral(L, \"C\");\r\n#else\r\n  GCstr *s = lj_lib_optstr(L, 1);\r\n  const char *str = s ? strdata(s) : NULL;\r\n  int opt = lj_lib_checkopt(L, 2, 6,\r\n    \"\\5ctype\\7numeric\\4time\\7collate\\10monetary\\1\\377\\3all\");\r\n  if (opt == 0) opt = LC_CTYPE;\r\n  else if (opt == 1) opt = LC_NUMERIC;\r\n  else if (opt == 2) opt = LC_TIME;\r\n  else if (opt == 3) opt = LC_COLLATE;\r\n  else if (opt == 4) opt = LC_MONETARY;\r\n  else if (opt == 6) opt = LC_ALL;\r\n  lua_pushstring(L, setlocale(opt, str));\r\n#endif\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_os(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_OSLIBNAME, os);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_package.c",
    "content": "/*\r\n** Package library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2012 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_package_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Error codes for ll_loadfunc. */\r\n#define PACKAGE_ERR_LIB\t\t1\r\n#define PACKAGE_ERR_FUNC\t2\r\n#define PACKAGE_ERR_LOAD\t3\r\n\r\n/* Redefined in platform specific part. */\r\n#define PACKAGE_LIB_FAIL\t\"open\"\r\n#define setprogdir(L)\t\t((void)0)\r\n\r\n/* Symbol name prefixes. */\r\n#define SYMPREFIX_CF\t\t\"luaopen_%s\"\r\n#define SYMPREFIX_BC\t\t\"luaJIT_BC_%s\"\r\n\r\n#if LJ_TARGET_DLOPEN\r\n\r\n#include <dlfcn.h>\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  dlclose(lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  void *lib = dlopen(path, RTLD_NOW | (gl ? RTLD_GLOBAL : RTLD_LOCAL));\r\n  if (lib == NULL) lua_pushstring(L, dlerror());\r\n  return lib;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  lua_CFunction f = (lua_CFunction)dlsym(lib, sym);\r\n  if (f == NULL) lua_pushstring(L, dlerror());\r\n  return f;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n#if defined(RTLD_DEFAULT)\r\n  if (lib == NULL) lib = RTLD_DEFAULT;\r\n#elif LJ_TARGET_OSX || LJ_TARGET_BSD\r\n  if (lib == NULL) lib = (void *)(intptr_t)-2;\r\n#endif\r\n  return (const char *)dlsym(lib, sym);\r\n}\r\n\r\n#elif LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#ifndef GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\r\n#define GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS  4\r\n#define GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT  2\r\nBOOL WINAPI GetModuleHandleExA(DWORD, LPCSTR, HMODULE*);\r\n#endif\r\n\r\n#undef setprogdir\r\n\r\nstatic void setprogdir(lua_State *L)\r\n{\r\n  char buff[MAX_PATH + 1];\r\n  char *lb;\r\n  DWORD nsize = sizeof(buff);\r\n  DWORD n = GetModuleFileNameA(NULL, buff, nsize);\r\n  if (n == 0 || n == nsize || (lb = strrchr(buff, '\\\\')) == NULL) {\r\n    luaL_error(L, \"unable to get ModuleFileName\");\r\n  } else {\r\n    *lb = '\\0';\r\n    luaL_gsub(L, lua_tostring(L, -1), LUA_EXECDIR, buff);\r\n    lua_remove(L, -2);  /* remove original string */\r\n  }\r\n}\r\n\r\nstatic void pusherror(lua_State *L)\r\n{\r\n  DWORD error = GetLastError();\r\n#if LJ_TARGET_XBOXONE\r\n  wchar_t wbuffer[128];\r\n  char buffer[128*2];\r\n  if (FormatMessageW(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,\r\n      NULL, error, 0, wbuffer, sizeof(wbuffer)/sizeof(wchar_t), NULL) &&\r\n      WideCharToMultiByte(CP_ACP, 0, wbuffer, 128, buffer, 128*2, NULL, NULL))\r\n#else\r\n  char buffer[128];\r\n  if (FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_FROM_SYSTEM,\r\n      NULL, error, 0, buffer, sizeof(buffer), NULL))\r\n#endif\r\n    lua_pushstring(L, buffer);\r\n  else\r\n    lua_pushfstring(L, \"system error %d\\n\", error);\r\n}\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  FreeLibrary((HINSTANCE)lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  HINSTANCE lib = LoadLibraryExA(path, NULL, 0);\r\n  if (lib == NULL) pusherror(L);\r\n  UNUSED(gl);\r\n  return lib;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  lua_CFunction f = (lua_CFunction)GetProcAddress((HINSTANCE)lib, sym);\r\n  if (f == NULL) pusherror(L);\r\n  return f;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n  if (lib) {\r\n    return (const char *)GetProcAddress((HINSTANCE)lib, sym);\r\n  } else {\r\n    HINSTANCE h = GetModuleHandleA(NULL);\r\n    const char *p = (const char *)GetProcAddress(h, sym);\r\n    if (p == NULL && GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t\t\t(const char *)ll_bcsym, &h))\r\n      p = (const char *)GetProcAddress(h, sym);\r\n    return p;\r\n  }\r\n}\r\n\r\n#else\r\n\r\n#undef PACKAGE_LIB_FAIL\r\n#define PACKAGE_LIB_FAIL\t\"absent\"\r\n\r\n#define DLMSG\t\"dynamic libraries not enabled; no support for target OS\"\r\n\r\nstatic void ll_unloadlib(void *lib)\r\n{\r\n  UNUSED(lib);\r\n}\r\n\r\nstatic void *ll_load(lua_State *L, const char *path, int gl)\r\n{\r\n  UNUSED(path); UNUSED(gl);\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\nstatic lua_CFunction ll_sym(lua_State *L, void *lib, const char *sym)\r\n{\r\n  UNUSED(lib); UNUSED(sym);\r\n  lua_pushliteral(L, DLMSG);\r\n  return NULL;\r\n}\r\n\r\nstatic const char *ll_bcsym(void *lib, const char *sym)\r\n{\r\n  UNUSED(lib); UNUSED(sym);\r\n  return NULL;\r\n}\r\n\r\n#endif\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void **ll_register(lua_State *L, const char *path)\r\n{\r\n  void **plib;\r\n  lua_pushfstring(L, \"LOADLIB: %s\", path);\r\n  lua_gettable(L, LUA_REGISTRYINDEX);  /* check library in registry? */\r\n  if (!lua_isnil(L, -1)) {  /* is there an entry? */\r\n    plib = (void **)lua_touserdata(L, -1);\r\n  } else {  /* no entry yet; create one */\r\n    lua_pop(L, 1);\r\n    plib = (void **)lua_newuserdata(L, sizeof(void *));\r\n    *plib = NULL;\r\n    luaL_getmetatable(L, \"_LOADLIB\");\r\n    lua_setmetatable(L, -2);\r\n    lua_pushfstring(L, \"LOADLIB: %s\", path);\r\n    lua_pushvalue(L, -2);\r\n    lua_settable(L, LUA_REGISTRYINDEX);\r\n  }\r\n  return plib;\r\n}\r\n\r\nstatic const char *mksymname(lua_State *L, const char *modname,\r\n\t\t\t     const char *prefix)\r\n{\r\n  const char *funcname;\r\n  const char *mark = strchr(modname, *LUA_IGMARK);\r\n  if (mark) modname = mark + 1;\r\n  funcname = luaL_gsub(L, modname, \".\", \"_\");\r\n  funcname = lua_pushfstring(L, prefix, funcname);\r\n  lua_remove(L, -2);  /* remove 'gsub' result */\r\n  return funcname;\r\n}\r\n\r\nstatic int ll_loadfunc(lua_State *L, const char *path, const char *name, int r)\r\n{\r\n  void **reg = ll_register(L, path);\r\n  if (*reg == NULL) *reg = ll_load(L, path, (*name == '*'));\r\n  if (*reg == NULL) {\r\n    return PACKAGE_ERR_LIB;  /* Unable to load library. */\r\n  } else if (*name == '*') {  /* Only load library into global namespace. */\r\n    lua_pushboolean(L, 1);\r\n    return 0;\r\n  } else {\r\n    const char *sym = r ? name : mksymname(L, name, SYMPREFIX_CF);\r\n    lua_CFunction f = ll_sym(L, *reg, sym);\r\n    if (f) {\r\n      lua_pushcfunction(L, f);\r\n      return 0;\r\n    }\r\n    if (!r) {\r\n      const char *bcdata = ll_bcsym(*reg, mksymname(L, name, SYMPREFIX_BC));\r\n      lua_pop(L, 1);\r\n      if (bcdata) {\r\n\tif (luaL_loadbuffer(L, bcdata, LJ_MAX_BUF, name) != 0)\r\n\t  return PACKAGE_ERR_LOAD;\r\n\treturn 0;\r\n      }\r\n    }\r\n    return PACKAGE_ERR_FUNC;  /* Unable to find function. */\r\n  }\r\n}\r\n\r\nstatic int lj_cf_package_loadlib(lua_State *L)\r\n{\r\n  const char *path = luaL_checkstring(L, 1);\r\n  const char *init = luaL_checkstring(L, 2);\r\n  int st = ll_loadfunc(L, path, init, 1);\r\n  if (st == 0) {  /* no errors? */\r\n    return 1;  /* return the loaded function */\r\n  } else {  /* error; error message is on stack top */\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);\r\n    lua_pushstring(L, (st == PACKAGE_ERR_LIB) ?  PACKAGE_LIB_FAIL : \"init\");\r\n    return 3;  /* return nil, error message, and where */\r\n  }\r\n}\r\n\r\nstatic int lj_cf_package_unloadlib(lua_State *L)\r\n{\r\n  void **lib = (void **)luaL_checkudata(L, 1, \"_LOADLIB\");\r\n  if (*lib) ll_unloadlib(*lib);\r\n  *lib = NULL;  /* mark library as closed */\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic int readable(const char *filename)\r\n{\r\n  FILE *f = fopen(filename, \"r\");  /* try to open file */\r\n  if (f == NULL) return 0;  /* open failed */\r\n  fclose(f);\r\n  return 1;\r\n}\r\n\r\nstatic const char *pushnexttemplate(lua_State *L, const char *path)\r\n{\r\n  const char *l;\r\n  while (*path == *LUA_PATHSEP) path++;  /* skip separators */\r\n  if (*path == '\\0') return NULL;  /* no more templates */\r\n  l = strchr(path, *LUA_PATHSEP);  /* find next separator */\r\n  if (l == NULL) l = path + strlen(path);\r\n  lua_pushlstring(L, path, (size_t)(l - path));  /* template */\r\n  return l;\r\n}\r\n\r\nstatic const char *searchpath (lua_State *L, const char *name,\r\n\t\t\t       const char *path, const char *sep,\r\n\t\t\t       const char *dirsep)\r\n{\r\n  luaL_Buffer msg;  /* to build error message */\r\n  luaL_buffinit(L, &msg);\r\n  if (*sep != '\\0')  /* non-empty separator? */\r\n    name = luaL_gsub(L, name, sep, dirsep);  /* replace it by 'dirsep' */\r\n  while ((path = pushnexttemplate(L, path)) != NULL) {\r\n    const char *filename = luaL_gsub(L, lua_tostring(L, -1),\r\n\t\t\t\t     LUA_PATH_MARK, name);\r\n    lua_remove(L, -2);  /* remove path template */\r\n    if (readable(filename))  /* does file exist and is readable? */\r\n      return filename;  /* return that file name */\r\n    lua_pushfstring(L, \"\\n\\tno file \" LUA_QS, filename);\r\n    lua_remove(L, -2);  /* remove file name */\r\n    luaL_addvalue(&msg);  /* concatenate error msg. entry */\r\n  }\r\n  luaL_pushresult(&msg);  /* create error message */\r\n  return NULL;  /* not found */\r\n}\r\n\r\nstatic int lj_cf_package_searchpath(lua_State *L)\r\n{\r\n  const char *f = searchpath(L, luaL_checkstring(L, 1),\r\n\t\t\t\tluaL_checkstring(L, 2),\r\n\t\t\t\tluaL_optstring(L, 3, \".\"),\r\n\t\t\t\tluaL_optstring(L, 4, LUA_DIRSEP));\r\n  if (f != NULL) {\r\n    return 1;\r\n  } else {  /* error message is on top of the stack */\r\n    lua_pushnil(L);\r\n    lua_insert(L, -2);\r\n    return 2;  /* return nil + error message */\r\n  }\r\n}\r\n\r\nstatic const char *findfile(lua_State *L, const char *name,\r\n\t\t\t    const char *pname)\r\n{\r\n  const char *path;\r\n  lua_getfield(L, LUA_ENVIRONINDEX, pname);\r\n  path = lua_tostring(L, -1);\r\n  if (path == NULL)\r\n    luaL_error(L, LUA_QL(\"package.%s\") \" must be a string\", pname);\r\n  return searchpath(L, name, path, \".\", LUA_DIRSEP);\r\n}\r\n\r\nstatic void loaderror(lua_State *L, const char *filename)\r\n{\r\n  luaL_error(L, \"error loading module \" LUA_QS \" from file \" LUA_QS \":\\n\\t%s\",\r\n\t     lua_tostring(L, 1), filename, lua_tostring(L, -1));\r\n}\r\n\r\nstatic int lj_cf_package_loader_lua(lua_State *L)\r\n{\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  filename = findfile(L, name, \"path\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  if (luaL_loadfile(L, filename) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\nstatic int lj_cf_package_loader_c(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *filename = findfile(L, name, \"cpath\");\r\n  if (filename == NULL) return 1;  /* library not found in this path */\r\n  if (ll_loadfunc(L, filename, name, 0) != 0)\r\n    loaderror(L, filename);\r\n  return 1;  /* library loaded successfully */\r\n}\r\n\r\nstatic int lj_cf_package_loader_croot(lua_State *L)\r\n{\r\n  const char *filename;\r\n  const char *name = luaL_checkstring(L, 1);\r\n  const char *p = strchr(name, '.');\r\n  int st;\r\n  if (p == NULL) return 0;  /* is root */\r\n  lua_pushlstring(L, name, (size_t)(p - name));\r\n  filename = findfile(L, lua_tostring(L, -1), \"cpath\");\r\n  if (filename == NULL) return 1;  /* root not found */\r\n  if ((st = ll_loadfunc(L, filename, name, 0)) != 0) {\r\n    if (st != PACKAGE_ERR_FUNC) loaderror(L, filename);  /* real error */\r\n    lua_pushfstring(L, \"\\n\\tno module \" LUA_QS \" in file \" LUA_QS,\r\n\t\t    name, filename);\r\n    return 1;  /* function not found */\r\n  }\r\n  return 1;\r\n}\r\n\r\nstatic int lj_cf_package_loader_preload(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"preload\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.preload\") \" must be a table\");\r\n  lua_getfield(L, -1, name);\r\n  if (lua_isnil(L, -1)) {  /* Not found? */\r\n    const char *bcname = mksymname(L, name, SYMPREFIX_BC);\r\n    const char *bcdata = ll_bcsym(NULL, bcname);\r\n    if (bcdata == NULL || luaL_loadbuffer(L, bcdata, LJ_MAX_BUF, name) != 0)\r\n      lua_pushfstring(L, \"\\n\\tno field package.preload['%s']\", name);\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic const int sentinel_ = 0;\r\n#define sentinel\t((void *)&sentinel_)\r\n\r\nstatic int lj_cf_package_require(lua_State *L)\r\n{\r\n  const char *name = luaL_checkstring(L, 1);\r\n  int i;\r\n  lua_settop(L, 1);  /* _LOADED table will be at index 2 */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, 2, name);\r\n  if (lua_toboolean(L, -1)) {  /* is it there? */\r\n    if (lua_touserdata(L, -1) == sentinel)  /* check loops */\r\n      luaL_error(L, \"loop or previous error loading module \" LUA_QS, name);\r\n    return 1;  /* package is already loaded */\r\n  }\r\n  /* else must load it; iterate over available loaders */\r\n  lua_getfield(L, LUA_ENVIRONINDEX, \"loaders\");\r\n  if (!lua_istable(L, -1))\r\n    luaL_error(L, LUA_QL(\"package.loaders\") \" must be a table\");\r\n  lua_pushliteral(L, \"\");  /* error message accumulator */\r\n  for (i = 1; ; i++) {\r\n    lua_rawgeti(L, -2, i);  /* get a loader */\r\n    if (lua_isnil(L, -1))\r\n      luaL_error(L, \"module \" LUA_QS \" not found:%s\",\r\n\t\t name, lua_tostring(L, -2));\r\n    lua_pushstring(L, name);\r\n    lua_call(L, 1, 1);  /* call it */\r\n    if (lua_isfunction(L, -1))  /* did it find module? */\r\n      break;  /* module loaded successfully */\r\n    else if (lua_isstring(L, -1))  /* loader returned error message? */\r\n      lua_concat(L, 2);  /* accumulate it */\r\n    else\r\n      lua_pop(L, 1);\r\n  }\r\n  lua_pushlightuserdata(L, sentinel);\r\n  lua_setfield(L, 2, name);  /* _LOADED[name] = sentinel */\r\n  lua_pushstring(L, name);  /* pass name as argument to module */\r\n  lua_call(L, 1, 1);  /* run loaded module */\r\n  if (!lua_isnil(L, -1))  /* non-nil return? */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = returned value */\r\n  lua_getfield(L, 2, name);\r\n  if (lua_touserdata(L, -1) == sentinel) {   /* module did not set a value? */\r\n    lua_pushboolean(L, 1);  /* use true as result */\r\n    lua_pushvalue(L, -1);  /* extra copy to be returned */\r\n    lua_setfield(L, 2, name);  /* _LOADED[name] = true */\r\n  }\r\n  lj_lib_checkfpu(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void setfenv(lua_State *L)\r\n{\r\n  lua_Debug ar;\r\n  if (lua_getstack(L, 1, &ar) == 0 ||\r\n      lua_getinfo(L, \"f\", &ar) == 0 ||  /* get calling function */\r\n      lua_iscfunction(L, -1))\r\n    luaL_error(L, LUA_QL(\"module\") \" not called from a Lua function\");\r\n  lua_pushvalue(L, -2);\r\n  lua_setfenv(L, -2);\r\n  lua_pop(L, 1);\r\n}\r\n\r\nstatic void dooptions(lua_State *L, int n)\r\n{\r\n  int i;\r\n  for (i = 2; i <= n; i++) {\r\n    lua_pushvalue(L, i);  /* get option (a function) */\r\n    lua_pushvalue(L, -2);  /* module */\r\n    lua_call(L, 1, 0);\r\n  }\r\n}\r\n\r\nstatic void modinit(lua_State *L, const char *modname)\r\n{\r\n  const char *dot;\r\n  lua_pushvalue(L, -1);\r\n  lua_setfield(L, -2, \"_M\");  /* module._M = module */\r\n  lua_pushstring(L, modname);\r\n  lua_setfield(L, -2, \"_NAME\");\r\n  dot = strrchr(modname, '.');  /* look for last dot in module name */\r\n  if (dot == NULL) dot = modname; else dot++;\r\n  /* set _PACKAGE as package name (full module name minus last part) */\r\n  lua_pushlstring(L, modname, (size_t)(dot - modname));\r\n  lua_setfield(L, -2, \"_PACKAGE\");\r\n}\r\n\r\nstatic int lj_cf_package_module(lua_State *L)\r\n{\r\n  const char *modname = luaL_checkstring(L, 1);\r\n  int loaded = lua_gettop(L) + 1;  /* index of _LOADED table */\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, loaded, modname);  /* get _LOADED[modname] */\r\n  if (!lua_istable(L, -1)) {  /* not found? */\r\n    lua_pop(L, 1);  /* remove previous result */\r\n    /* try global variable (and create one if it does not exist) */\r\n    if (luaL_findtable(L, LUA_GLOBALSINDEX, modname, 1) != NULL)\r\n      lj_err_callerv(L, LJ_ERR_BADMODN, modname);\r\n    lua_pushvalue(L, -1);\r\n    lua_setfield(L, loaded, modname);  /* _LOADED[modname] = new table */\r\n  }\r\n  /* check whether table already has a _NAME field */\r\n  lua_getfield(L, -1, \"_NAME\");\r\n  if (!lua_isnil(L, -1)) {  /* is table an initialized module? */\r\n    lua_pop(L, 1);\r\n  } else {  /* no; initialize it */\r\n    lua_pop(L, 1);\r\n    modinit(L, modname);\r\n  }\r\n  lua_pushvalue(L, -1);\r\n  setfenv(L);\r\n  dooptions(L, loaded - 1);\r\n  return 0;\r\n}\r\n\r\nstatic int lj_cf_package_seeall(lua_State *L)\r\n{\r\n  luaL_checktype(L, 1, LUA_TTABLE);\r\n  if (!lua_getmetatable(L, 1)) {\r\n    lua_createtable(L, 0, 1); /* create new metatable */\r\n    lua_pushvalue(L, -1);\r\n    lua_setmetatable(L, 1);\r\n  }\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  lua_setfield(L, -2, \"__index\");  /* mt.__index = _G */\r\n  return 0;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define AUXMARK\t\t\"\\1\"\r\n\r\nstatic void setpath(lua_State *L, const char *fieldname, const char *envname,\r\n\t\t    const char *def, int noenv)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  const char *path = NULL;\r\n  UNUSED(envname);\r\n#else\r\n  const char *path = getenv(envname);\r\n#endif\r\n  if (path == NULL || noenv) {\r\n    lua_pushstring(L, def);\r\n  } else {\r\n    path = luaL_gsub(L, path, LUA_PATHSEP LUA_PATHSEP,\r\n\t\t\t      LUA_PATHSEP AUXMARK LUA_PATHSEP);\r\n    luaL_gsub(L, path, AUXMARK, def);\r\n    lua_remove(L, -2);\r\n  }\r\n  setprogdir(L);\r\n  lua_setfield(L, -2, fieldname);\r\n}\r\n\r\nstatic const luaL_Reg package_lib[] = {\r\n  { \"loadlib\",\tlj_cf_package_loadlib },\r\n  { \"searchpath\",  lj_cf_package_searchpath },\r\n  { \"seeall\",\tlj_cf_package_seeall },\r\n  { NULL, NULL }\r\n};\r\n\r\nstatic const luaL_Reg package_global[] = {\r\n  { \"module\",\tlj_cf_package_module },\r\n  { \"require\",\tlj_cf_package_require },\r\n  { NULL, NULL }\r\n};\r\n\r\nstatic const lua_CFunction package_loaders[] =\r\n{\r\n  lj_cf_package_loader_preload,\r\n  lj_cf_package_loader_lua,\r\n  lj_cf_package_loader_c,\r\n  lj_cf_package_loader_croot,\r\n  NULL\r\n};\r\n\r\nLUALIB_API int luaopen_package(lua_State *L)\r\n{\r\n  int i;\r\n  int noenv;\r\n  luaL_newmetatable(L, \"_LOADLIB\");\r\n  lj_lib_pushcf(L, lj_cf_package_unloadlib, 1);\r\n  lua_setfield(L, -2, \"__gc\");\r\n  luaL_register(L, LUA_LOADLIBNAME, package_lib);\r\n  lua_pushvalue(L, -1);\r\n  lua_replace(L, LUA_ENVIRONINDEX);\r\n  lua_createtable(L, sizeof(package_loaders)/sizeof(package_loaders[0])-1, 0);\r\n  for (i = 0; package_loaders[i] != NULL; i++) {\r\n    lj_lib_pushcf(L, package_loaders[i], 1);\r\n    lua_rawseti(L, -2, i+1);\r\n  }\r\n  lua_setfield(L, -2, \"loaders\");\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"LUA_NOENV\");\r\n  noenv = lua_toboolean(L, -1);\r\n  lua_pop(L, 1);\r\n  setpath(L, \"path\", LUA_PATH, LUA_PATH_DEFAULT, noenv);\r\n  setpath(L, \"cpath\", LUA_CPATH, LUA_CPATH_DEFAULT, noenv);\r\n  lua_pushliteral(L, LUA_PATH_CONFIG);\r\n  lua_setfield(L, -2, \"config\");\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n  lua_setfield(L, -2, \"loaded\");\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\", 4);\r\n  lua_setfield(L, -2, \"preload\");\r\n  lua_pushvalue(L, LUA_GLOBALSINDEX);\r\n  luaL_register(L, NULL, package_global);\r\n  lua_pop(L, 1);\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_string.c",
    "content": "/*\r\n** String library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_string_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_string\r\n\r\nLJLIB_LUA(string_len) /*\r\n  function(s)\r\n    CHECK_str(s)\r\n    return #s\r\n  end\r\n*/\r\n\r\nLJLIB_ASM(string_byte)\t\tLJLIB_REC(string_range 0)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int32_t len = (int32_t)s->len;\r\n  int32_t start = lj_lib_optint(L, 2, 1);\r\n  int32_t stop = lj_lib_optint(L, 3, start);\r\n  int32_t n, i;\r\n  const unsigned char *p;\r\n  if (stop < 0) stop += len+1;\r\n  if (start < 0) start += len+1;\r\n  if (start <= 0) start = 1;\r\n  if (stop > len) stop = len;\r\n  if (start > stop) return FFH_RES(0);  /* Empty interval: return no results. */\r\n  start--;\r\n  n = stop - start;\r\n  if ((uint32_t)n > LUAI_MAXCSTACK)\r\n    lj_err_caller(L, LJ_ERR_STRSLC);\r\n  lj_state_checkstack(L, (MSize)n);\r\n  p = (const unsigned char *)strdata(s) + start;\r\n  for (i = 0; i < n; i++)\r\n    setintV(L->base + i-1-LJ_FR2, p[i]);\r\n  return FFH_RES(n);\r\n}\r\n\r\nLJLIB_ASM(string_char)\t\tLJLIB_REC(.)\r\n{\r\n  int i, nargs = (int)(L->top - L->base);\r\n  char *buf = lj_buf_tmp(L, (MSize)nargs);\r\n  for (i = 1; i <= nargs; i++) {\r\n    int32_t k = lj_lib_checkint(L, i);\r\n    if (!checku8(k))\r\n      lj_err_arg(L, i, LJ_ERR_BADVAL);\r\n    buf[i-1] = (char)k;\r\n  }\r\n  setstrV(L, L->base-1-LJ_FR2, lj_str_new(L, buf, (size_t)nargs));\r\n  return FFH_RES(1);\r\n}\r\n\r\nLJLIB_ASM(string_sub)\t\tLJLIB_REC(string_range 1)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  lj_lib_checkint(L, 2);\r\n  setintV(L->base+2, lj_lib_optint(L, 3, -1));\r\n  return FFH_RETRY;\r\n}\r\n\r\nLJLIB_CF(string_rep)\t\tLJLIB_REC(.)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  int32_t rep = lj_lib_checkint(L, 2);\r\n  GCstr *sep = lj_lib_optstr(L, 3);\r\n  SBuf *sb = lj_buf_tmp_(L);\r\n  if (sep && rep > 1) {\r\n    GCstr *s2 = lj_buf_cat2str(L, sep, s);\r\n    lj_buf_reset(sb);\r\n    lj_buf_putstr(sb, s);\r\n    s = s2;\r\n    rep--;\r\n  }\r\n  sb = lj_buf_putstr_rep(sb, s, rep);\r\n  setstrV(L, L->top-1, lj_buf_str(L, sb));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\nLJLIB_ASM(string_reverse)  LJLIB_REC(string_op IRCALL_lj_buf_putstr_reverse)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  return FFH_RETRY;\r\n}\r\nLJLIB_ASM_(string_lower)  LJLIB_REC(string_op IRCALL_lj_buf_putstr_lower)\r\nLJLIB_ASM_(string_upper)  LJLIB_REC(string_op IRCALL_lj_buf_putstr_upper)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic int writer_buf(lua_State *L, const void *p, size_t size, void *sb)\r\n{\r\n  lj_buf_putmem((SBuf *)sb, p, (MSize)size);\r\n  UNUSED(L);\r\n  return 0;\r\n}\r\n\r\nLJLIB_CF(string_dump)\r\n{\r\n  GCfunc *fn = lj_lib_checkfunc(L, 1);\r\n  int strip = L->base+1 < L->top && tvistruecond(L->base+1);\r\n  SBuf *sb = lj_buf_tmp_(L);  /* Assumes lj_bcwrite() doesn't use tmpbuf. */\r\n  L->top = L->base+1;\r\n  if (!isluafunc(fn) || lj_bcwrite(L, funcproto(fn), writer_buf, sb, strip))\r\n    lj_err_caller(L, LJ_ERR_STRDUMP);\r\n  setstrV(L, L->top-1, lj_buf_str(L, sb));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* macro to `unsign' a character */\r\n#define uchar(c)        ((unsigned char)(c))\r\n\r\n#define CAP_UNFINISHED\t(-1)\r\n#define CAP_POSITION\t(-2)\r\n\r\ntypedef struct MatchState {\r\n  const char *src_init;  /* init of source string */\r\n  const char *src_end;  /* end (`\\0') of source string */\r\n  lua_State *L;\r\n  int level;  /* total number of captures (finished or unfinished) */\r\n  int depth;\r\n  struct {\r\n    const char *init;\r\n    ptrdiff_t len;\r\n  } capture[LUA_MAXCAPTURES];\r\n} MatchState;\r\n\r\n#define L_ESC\t\t'%'\r\n\r\nstatic int check_capture(MatchState *ms, int l)\r\n{\r\n  l -= '1';\r\n  if (l < 0 || l >= ms->level || ms->capture[l].len == CAP_UNFINISHED)\r\n    lj_err_caller(ms->L, LJ_ERR_STRCAPI);\r\n  return l;\r\n}\r\n\r\nstatic int capture_to_close(MatchState *ms)\r\n{\r\n  int level = ms->level;\r\n  for (level--; level>=0; level--)\r\n    if (ms->capture[level].len == CAP_UNFINISHED) return level;\r\n  lj_err_caller(ms->L, LJ_ERR_STRPATC);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nstatic const char *classend(MatchState *ms, const char *p)\r\n{\r\n  switch (*p++) {\r\n  case L_ESC:\r\n    if (*p == '\\0')\r\n      lj_err_caller(ms->L, LJ_ERR_STRPATE);\r\n    return p+1;\r\n  case '[':\r\n    if (*p == '^') p++;\r\n    do {  /* look for a `]' */\r\n      if (*p == '\\0')\r\n\tlj_err_caller(ms->L, LJ_ERR_STRPATM);\r\n      if (*(p++) == L_ESC && *p != '\\0')\r\n\tp++;  /* skip escapes (e.g. `%]') */\r\n    } while (*p != ']');\r\n    return p+1;\r\n  default:\r\n    return p;\r\n  }\r\n}\r\n\r\nstatic const unsigned char match_class_map[32] = {\r\n  0,LJ_CHAR_ALPHA,0,LJ_CHAR_CNTRL,LJ_CHAR_DIGIT,0,0,LJ_CHAR_GRAPH,0,0,0,0,\r\n  LJ_CHAR_LOWER,0,0,0,LJ_CHAR_PUNCT,0,0,LJ_CHAR_SPACE,0,\r\n  LJ_CHAR_UPPER,0,LJ_CHAR_ALNUM,LJ_CHAR_XDIGIT,0,0,0,0,0,0,0\r\n};\r\n\r\nstatic int match_class(int c, int cl)\r\n{\r\n  if ((cl & 0xc0) == 0x40) {\r\n    int t = match_class_map[(cl&0x1f)];\r\n    if (t) {\r\n      t = lj_char_isa(c, t);\r\n      return (cl & 0x20) ? t : !t;\r\n    }\r\n    if (cl == 'z') return c == 0;\r\n    if (cl == 'Z') return c != 0;\r\n  }\r\n  return (cl == c);\r\n}\r\n\r\nstatic int matchbracketclass(int c, const char *p, const char *ec)\r\n{\r\n  int sig = 1;\r\n  if (*(p+1) == '^') {\r\n    sig = 0;\r\n    p++;  /* skip the `^' */\r\n  }\r\n  while (++p < ec) {\r\n    if (*p == L_ESC) {\r\n      p++;\r\n      if (match_class(c, uchar(*p)))\r\n\treturn sig;\r\n    }\r\n    else if ((*(p+1) == '-') && (p+2 < ec)) {\r\n      p+=2;\r\n      if (uchar(*(p-2)) <= c && c <= uchar(*p))\r\n\treturn sig;\r\n    }\r\n    else if (uchar(*p) == c) return sig;\r\n  }\r\n  return !sig;\r\n}\r\n\r\nstatic int singlematch(int c, const char *p, const char *ep)\r\n{\r\n  switch (*p) {\r\n  case '.': return 1;  /* matches any char */\r\n  case L_ESC: return match_class(c, uchar(*(p+1)));\r\n  case '[': return matchbracketclass(c, p, ep-1);\r\n  default:  return (uchar(*p) == c);\r\n  }\r\n}\r\n\r\nstatic const char *match(MatchState *ms, const char *s, const char *p);\r\n\r\nstatic const char *matchbalance(MatchState *ms, const char *s, const char *p)\r\n{\r\n  if (*p == 0 || *(p+1) == 0)\r\n    lj_err_caller(ms->L, LJ_ERR_STRPATU);\r\n  if (*s != *p) {\r\n    return NULL;\r\n  } else {\r\n    int b = *p;\r\n    int e = *(p+1);\r\n    int cont = 1;\r\n    while (++s < ms->src_end) {\r\n      if (*s == e) {\r\n\tif (--cont == 0) return s+1;\r\n      } else if (*s == b) {\r\n\tcont++;\r\n      }\r\n    }\r\n  }\r\n  return NULL;  /* string ends out of balance */\r\n}\r\n\r\nstatic const char *max_expand(MatchState *ms, const char *s,\r\n\t\t\t      const char *p, const char *ep)\r\n{\r\n  ptrdiff_t i = 0;  /* counts maximum expand for item */\r\n  while ((s+i)<ms->src_end && singlematch(uchar(*(s+i)), p, ep))\r\n    i++;\r\n  /* keeps trying to match with the maximum repetitions */\r\n  while (i>=0) {\r\n    const char *res = match(ms, (s+i), ep+1);\r\n    if (res) return res;\r\n    i--;  /* else didn't match; reduce 1 repetition to try again */\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic const char *min_expand(MatchState *ms, const char *s,\r\n\t\t\t      const char *p, const char *ep)\r\n{\r\n  for (;;) {\r\n    const char *res = match(ms, s, ep+1);\r\n    if (res != NULL)\r\n      return res;\r\n    else if (s<ms->src_end && singlematch(uchar(*s), p, ep))\r\n      s++;  /* try with one more repetition */\r\n    else\r\n      return NULL;\r\n  }\r\n}\r\n\r\nstatic const char *start_capture(MatchState *ms, const char *s,\r\n\t\t\t\t const char *p, int what)\r\n{\r\n  const char *res;\r\n  int level = ms->level;\r\n  if (level >= LUA_MAXCAPTURES) lj_err_caller(ms->L, LJ_ERR_STRCAPN);\r\n  ms->capture[level].init = s;\r\n  ms->capture[level].len = what;\r\n  ms->level = level+1;\r\n  if ((res=match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->level--;  /* undo capture */\r\n  return res;\r\n}\r\n\r\nstatic const char *end_capture(MatchState *ms, const char *s,\r\n\t\t\t       const char *p)\r\n{\r\n  int l = capture_to_close(ms);\r\n  const char *res;\r\n  ms->capture[l].len = s - ms->capture[l].init;  /* close capture */\r\n  if ((res = match(ms, s, p)) == NULL)  /* match failed? */\r\n    ms->capture[l].len = CAP_UNFINISHED;  /* undo capture */\r\n  return res;\r\n}\r\n\r\nstatic const char *match_capture(MatchState *ms, const char *s, int l)\r\n{\r\n  size_t len;\r\n  l = check_capture(ms, l);\r\n  len = (size_t)ms->capture[l].len;\r\n  if ((size_t)(ms->src_end-s) >= len &&\r\n      memcmp(ms->capture[l].init, s, len) == 0)\r\n    return s+len;\r\n  else\r\n    return NULL;\r\n}\r\n\r\nstatic const char *match(MatchState *ms, const char *s, const char *p)\r\n{\r\n  if (++ms->depth > LJ_MAX_XLEVEL)\r\n    lj_err_caller(ms->L, LJ_ERR_STRPATX);\r\n  init: /* using goto's to optimize tail recursion */\r\n  switch (*p) {\r\n  case '(':  /* start capture */\r\n    if (*(p+1) == ')')  /* position capture? */\r\n      s = start_capture(ms, s, p+2, CAP_POSITION);\r\n    else\r\n      s = start_capture(ms, s, p+1, CAP_UNFINISHED);\r\n    break;\r\n  case ')':  /* end capture */\r\n    s = end_capture(ms, s, p+1);\r\n    break;\r\n  case L_ESC:\r\n    switch (*(p+1)) {\r\n    case 'b':  /* balanced string? */\r\n      s = matchbalance(ms, s, p+2);\r\n      if (s == NULL) break;\r\n      p+=4;\r\n      goto init;  /* else s = match(ms, s, p+4); */\r\n    case 'f': {  /* frontier? */\r\n      const char *ep; char previous;\r\n      p += 2;\r\n      if (*p != '[')\r\n\tlj_err_caller(ms->L, LJ_ERR_STRPATB);\r\n      ep = classend(ms, p);  /* points to what is next */\r\n      previous = (s == ms->src_init) ? '\\0' : *(s-1);\r\n      if (matchbracketclass(uchar(previous), p, ep-1) ||\r\n\t !matchbracketclass(uchar(*s), p, ep-1)) { s = NULL; break; }\r\n      p=ep;\r\n      goto init;  /* else s = match(ms, s, ep); */\r\n      }\r\n    default:\r\n      if (lj_char_isdigit(uchar(*(p+1)))) {  /* capture results (%0-%9)? */\r\n\ts = match_capture(ms, s, uchar(*(p+1)));\r\n\tif (s == NULL) break;\r\n\tp+=2;\r\n\tgoto init;  /* else s = match(ms, s, p+2) */\r\n      }\r\n      goto dflt;  /* case default */\r\n    }\r\n    break;\r\n  case '\\0':  /* end of pattern */\r\n    break;  /* match succeeded */\r\n  case '$':\r\n    /* is the `$' the last char in pattern? */\r\n    if (*(p+1) != '\\0') goto dflt;\r\n    if (s != ms->src_end) s = NULL;  /* check end of string */\r\n    break;\r\n  default: dflt: {  /* it is a pattern item */\r\n    const char *ep = classend(ms, p);  /* points to what is next */\r\n    int m = s<ms->src_end && singlematch(uchar(*s), p, ep);\r\n    switch (*ep) {\r\n    case '?': {  /* optional */\r\n      const char *res;\r\n      if (m && ((res=match(ms, s+1, ep+1)) != NULL)) {\r\n\ts = res;\r\n\tbreak;\r\n      }\r\n      p=ep+1;\r\n      goto init;  /* else s = match(ms, s, ep+1); */\r\n      }\r\n    case '*':  /* 0 or more repetitions */\r\n      s = max_expand(ms, s, p, ep);\r\n      break;\r\n    case '+':  /* 1 or more repetitions */\r\n      s = (m ? max_expand(ms, s+1, p, ep) : NULL);\r\n      break;\r\n    case '-':  /* 0 or more repetitions (minimum) */\r\n      s = min_expand(ms, s, p, ep);\r\n      break;\r\n    default:\r\n      if (m) { s++; p=ep; goto init; }  /* else s = match(ms, s+1, ep); */\r\n      s = NULL;\r\n      break;\r\n    }\r\n    break;\r\n    }\r\n  }\r\n  ms->depth--;\r\n  return s;\r\n}\r\n\r\nstatic void push_onecapture(MatchState *ms, int i, const char *s, const char *e)\r\n{\r\n  if (i >= ms->level) {\r\n    if (i == 0)  /* ms->level == 0, too */\r\n      lua_pushlstring(ms->L, s, (size_t)(e - s));  /* add whole match */\r\n    else\r\n      lj_err_caller(ms->L, LJ_ERR_STRCAPI);\r\n  } else {\r\n    ptrdiff_t l = ms->capture[i].len;\r\n    if (l == CAP_UNFINISHED) lj_err_caller(ms->L, LJ_ERR_STRCAPU);\r\n    if (l == CAP_POSITION)\r\n      lua_pushinteger(ms->L, ms->capture[i].init - ms->src_init + 1);\r\n    else\r\n      lua_pushlstring(ms->L, ms->capture[i].init, (size_t)l);\r\n  }\r\n}\r\n\r\nstatic int push_captures(MatchState *ms, const char *s, const char *e)\r\n{\r\n  int i;\r\n  int nlevels = (ms->level == 0 && s) ? 1 : ms->level;\r\n  luaL_checkstack(ms->L, nlevels, \"too many captures\");\r\n  for (i = 0; i < nlevels; i++)\r\n    push_onecapture(ms, i, s, e);\r\n  return nlevels;  /* number of strings pushed */\r\n}\r\n\r\nstatic int str_find_aux(lua_State *L, int find)\r\n{\r\n  GCstr *s = lj_lib_checkstr(L, 1);\r\n  GCstr *p = lj_lib_checkstr(L, 2);\r\n  int32_t start = lj_lib_optint(L, 3, 1);\r\n  MSize st;\r\n  if (start < 0) start += (int32_t)s->len; else start--;\r\n  if (start < 0) start = 0;\r\n  st = (MSize)start;\r\n  if (st > s->len) {\r\n#if LJ_52\r\n    setnilV(L->top-1);\r\n    return 1;\r\n#else\r\n    st = s->len;\r\n#endif\r\n  }\r\n  if (find && ((L->base+3 < L->top && tvistruecond(L->base+3)) ||\r\n\t       !lj_str_haspattern(p))) {  /* Search for fixed string. */\r\n    const char *q = lj_str_find(strdata(s)+st, strdata(p), s->len-st, p->len);\r\n    if (q) {\r\n      setintV(L->top-2, (int32_t)(q-strdata(s)) + 1);\r\n      setintV(L->top-1, (int32_t)(q-strdata(s)) + (int32_t)p->len);\r\n      return 2;\r\n    }\r\n  } else {  /* Search for pattern. */\r\n    MatchState ms;\r\n    const char *pstr = strdata(p);\r\n    const char *sstr = strdata(s) + st;\r\n    int anchor = 0;\r\n    if (*pstr == '^') { pstr++; anchor = 1; }\r\n    ms.L = L;\r\n    ms.src_init = strdata(s);\r\n    ms.src_end = strdata(s) + s->len;\r\n    do {  /* Loop through string and try to match the pattern. */\r\n      const char *q;\r\n      ms.level = ms.depth = 0;\r\n      q = match(&ms, sstr, pstr);\r\n      if (q) {\r\n\tif (find) {\r\n\t  setintV(L->top++, (int32_t)(sstr-(strdata(s)-1)));\r\n\t  setintV(L->top++, (int32_t)(q-strdata(s)));\r\n\t  return push_captures(&ms, NULL, NULL) + 2;\r\n\t} else {\r\n\t  return push_captures(&ms, sstr, q);\r\n\t}\r\n      }\r\n    } while (sstr++ < ms.src_end && !anchor);\r\n  }\r\n  setnilV(L->top-1);  /* Not found. */\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(string_find)\t\tLJLIB_REC(.)\r\n{\r\n  return str_find_aux(L, 1);\r\n}\r\n\r\nLJLIB_CF(string_match)\r\n{\r\n  return str_find_aux(L, 0);\r\n}\r\n\r\nLJLIB_NOREG LJLIB_CF(string_gmatch_aux)\r\n{\r\n  const char *p = strVdata(lj_lib_upvalue(L, 2));\r\n  GCstr *str = strV(lj_lib_upvalue(L, 1));\r\n  const char *s = strdata(str);\r\n  TValue *tvpos = lj_lib_upvalue(L, 3);\r\n  const char *src = s + tvpos->u32.lo;\r\n  MatchState ms;\r\n  ms.L = L;\r\n  ms.src_init = s;\r\n  ms.src_end = s + str->len;\r\n  for (; src <= ms.src_end; src++) {\r\n    const char *e;\r\n    ms.level = ms.depth = 0;\r\n    if ((e = match(&ms, src, p)) != NULL) {\r\n      int32_t pos = (int32_t)(e - s);\r\n      if (e == src) pos++;  /* Ensure progress for empty match. */\r\n      tvpos->u32.lo = (uint32_t)pos;\r\n      return push_captures(&ms, src, e);\r\n    }\r\n  }\r\n  return 0;  /* not found */\r\n}\r\n\r\nLJLIB_CF(string_gmatch)\r\n{\r\n  lj_lib_checkstr(L, 1);\r\n  lj_lib_checkstr(L, 2);\r\n  L->top = L->base+3;\r\n  (L->top-1)->u64 = 0;\r\n  lj_lib_pushcc(L, lj_cf_string_gmatch_aux, FF_string_gmatch_aux, 3);\r\n  return 1;\r\n}\r\n\r\nstatic void add_s(MatchState *ms, luaL_Buffer *b, const char *s, const char *e)\r\n{\r\n  size_t l, i;\r\n  const char *news = lua_tolstring(ms->L, 3, &l);\r\n  for (i = 0; i < l; i++) {\r\n    if (news[i] != L_ESC) {\r\n      luaL_addchar(b, news[i]);\r\n    } else {\r\n      i++;  /* skip ESC */\r\n      if (!lj_char_isdigit(uchar(news[i]))) {\r\n\tluaL_addchar(b, news[i]);\r\n      } else if (news[i] == '0') {\r\n\tluaL_addlstring(b, s, (size_t)(e - s));\r\n      } else {\r\n\tpush_onecapture(ms, news[i] - '1', s, e);\r\n\tluaL_addvalue(b);  /* add capture to accumulated result */\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void add_value(MatchState *ms, luaL_Buffer *b,\r\n\t\t      const char *s, const char *e)\r\n{\r\n  lua_State *L = ms->L;\r\n  switch (lua_type(L, 3)) {\r\n    case LUA_TNUMBER:\r\n    case LUA_TSTRING: {\r\n      add_s(ms, b, s, e);\r\n      return;\r\n    }\r\n    case LUA_TFUNCTION: {\r\n      int n;\r\n      lua_pushvalue(L, 3);\r\n      n = push_captures(ms, s, e);\r\n      lua_call(L, n, 1);\r\n      break;\r\n    }\r\n    case LUA_TTABLE: {\r\n      push_onecapture(ms, 0, s, e);\r\n      lua_gettable(L, 3);\r\n      break;\r\n    }\r\n  }\r\n  if (!lua_toboolean(L, -1)) {  /* nil or false? */\r\n    lua_pop(L, 1);\r\n    lua_pushlstring(L, s, (size_t)(e - s));  /* keep original text */\r\n  } else if (!lua_isstring(L, -1)) {\r\n    lj_err_callerv(L, LJ_ERR_STRGSRV, luaL_typename(L, -1));\r\n  }\r\n  luaL_addvalue(b);  /* add result to accumulator */\r\n}\r\n\r\nLJLIB_CF(string_gsub)\r\n{\r\n  size_t srcl;\r\n  const char *src = luaL_checklstring(L, 1, &srcl);\r\n  const char *p = luaL_checkstring(L, 2);\r\n  int  tr = lua_type(L, 3);\r\n  int max_s = luaL_optint(L, 4, (int)(srcl+1));\r\n  int anchor = (*p == '^') ? (p++, 1) : 0;\r\n  int n = 0;\r\n  MatchState ms;\r\n  luaL_Buffer b;\r\n  if (!(tr == LUA_TNUMBER || tr == LUA_TSTRING ||\r\n\ttr == LUA_TFUNCTION || tr == LUA_TTABLE))\r\n    lj_err_arg(L, 3, LJ_ERR_NOSFT);\r\n  luaL_buffinit(L, &b);\r\n  ms.L = L;\r\n  ms.src_init = src;\r\n  ms.src_end = src+srcl;\r\n  while (n < max_s) {\r\n    const char *e;\r\n    ms.level = ms.depth = 0;\r\n    e = match(&ms, src, p);\r\n    if (e) {\r\n      n++;\r\n      add_value(&ms, &b, src, e);\r\n    }\r\n    if (e && e>src) /* non empty match? */\r\n      src = e;  /* skip it */\r\n    else if (src < ms.src_end)\r\n      luaL_addchar(&b, *src++);\r\n    else\r\n      break;\r\n    if (anchor)\r\n      break;\r\n  }\r\n  luaL_addlstring(&b, src, (size_t)(ms.src_end-src));\r\n  luaL_pushresult(&b);\r\n  lua_pushinteger(L, n);  /* number of substitutions */\r\n  return 2;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Emulate tostring() inline. */\r\nstatic GCstr *string_fmt_tostring(lua_State *L, int arg, int retry)\r\n{\r\n  TValue *o = L->base+arg-1;\r\n  cTValue *mo;\r\n  lua_assert(o < L->top);  /* Caller already checks for existence. */\r\n  if (LJ_LIKELY(tvisstr(o)))\r\n    return strV(o);\r\n  if (retry != 2 && !tvisnil(mo = lj_meta_lookup(L, o, MM_tostring))) {\r\n    copyTV(L, L->top++, mo);\r\n    copyTV(L, L->top++, o);\r\n    lua_call(L, 1, 1);\r\n    copyTV(L, L->base+arg-1, --L->top);\r\n    return NULL;  /* Buffer may be overwritten, retry. */\r\n  }\r\n  return lj_strfmt_obj(L, o);\r\n}\r\n\r\nLJLIB_CF(string_format)\t\tLJLIB_REC(.)\r\n{\r\n  int arg, top = (int)(L->top - L->base);\r\n  GCstr *fmt;\r\n  SBuf *sb;\r\n  FormatState fs;\r\n  SFormat sf;\r\n  int retry = 0;\r\nagain:\r\n  arg = 1;\r\n  sb = lj_buf_tmp_(L);\r\n  fmt = lj_lib_checkstr(L, arg);\r\n  lj_strfmt_init(&fs, strdata(fmt), fmt->len);\r\n  while ((sf = lj_strfmt_parse(&fs)) != STRFMT_EOF) {\r\n    if (sf == STRFMT_LIT) {\r\n      lj_buf_putmem(sb, fs.str, fs.len);\r\n    } else if (sf == STRFMT_ERR) {\r\n      lj_err_callerv(L, LJ_ERR_STRFMT, strdata(lj_str_new(L, fs.str, fs.len)));\r\n    } else {\r\n      if (++arg > top)\r\n\tluaL_argerror(L, arg, lj_obj_typename[0]);\r\n      switch (STRFMT_TYPE(sf)) {\r\n      case STRFMT_INT:\r\n\tif (tvisint(L->base+arg-1)) {\r\n\t  int32_t k = intV(L->base+arg-1);\r\n\t  if (sf == STRFMT_INT)\r\n\t    lj_strfmt_putint(sb, k);  /* Shortcut for plain %d. */\r\n\t  else\r\n\t    lj_strfmt_putfxint(sb, sf, k);\r\n\t} else {\r\n\t  lj_strfmt_putfnum_int(sb, sf, lj_lib_checknum(L, arg));\r\n\t}\r\n\tbreak;\r\n      case STRFMT_UINT:\r\n\tif (tvisint(L->base+arg-1))\r\n\t  lj_strfmt_putfxint(sb, sf, intV(L->base+arg-1));\r\n\telse\r\n\t  lj_strfmt_putfnum_uint(sb, sf, lj_lib_checknum(L, arg));\r\n\tbreak;\r\n      case STRFMT_NUM:\r\n\tlj_strfmt_putfnum(sb, sf, lj_lib_checknum(L, arg));\r\n\tbreak;\r\n      case STRFMT_STR: {\r\n\tGCstr *str = string_fmt_tostring(L, arg, retry);\r\n\tif (str == NULL)\r\n\t  retry = 1;\r\n\telse if ((sf & STRFMT_T_QUOTED))\r\n\t  lj_strfmt_putquoted(sb, str);  /* No formatting. */\r\n\telse\r\n\t  lj_strfmt_putfstr(sb, sf, str);\r\n\tbreak;\r\n\t}\r\n      case STRFMT_CHAR:\r\n\tlj_strfmt_putfchar(sb, sf, lj_lib_checkint(L, arg));\r\n\tbreak;\r\n      case STRFMT_PTR:  /* No formatting. */\r\n\tlj_strfmt_putptr(sb, lj_obj_ptr(L->base+arg-1));\r\n\tbreak;\r\n      default:\r\n\tlua_assert(0);\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\n  if (retry++ == 1) goto again;\r\n  setstrV(L, L->top-1, lj_buf_str(L, sb));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_string(lua_State *L)\r\n{\r\n  GCtab *mt;\r\n  global_State *g;\r\n  LJ_LIB_REG(L, LUA_STRLIBNAME, string);\r\n#if defined(LUA_COMPAT_GFIND) && !LJ_52\r\n  lua_getfield(L, -1, \"gmatch\");\r\n  lua_setfield(L, -2, \"gfind\");\r\n#endif\r\n  mt = lj_tab_new(L, 0, 1);\r\n  /* NOBARRIER: basemt is a GC root. */\r\n  g = G(L);\r\n  setgcref(basemt_it(g, LJ_TSTR), obj2gco(mt));\r\n  settabV(L, lj_tab_setstr(L, mt, mmname_str(g, MM_index)), tabV(L->top-1));\r\n  mt->nomm = (uint8_t)(~(1u<<MM_index));\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lib_table.c",
    "content": "/*\r\n** Table library.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lib_table_c\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#define LJLIB_MODULE_table\r\n\r\nLJLIB_LUA(table_foreachi) /*\r\n  function(t, f)\r\n    CHECK_tab(t)\r\n    CHECK_func(f)\r\n    for i=1,#t do\r\n      local r = f(i, t[i])\r\n      if r ~= nil then return r end\r\n    end\r\n  end\r\n*/\r\n\r\nLJLIB_LUA(table_foreach) /*\r\n  function(t, f)\r\n    CHECK_tab(t)\r\n    CHECK_func(f)\r\n    for k, v in PAIRS(t) do\r\n      local r = f(k, v)\r\n      if r ~= nil then return r end\r\n    end\r\n  end\r\n*/\r\n\r\nLJLIB_LUA(table_getn) /*\r\n  function(t)\r\n    CHECK_tab(t)\r\n    return #t\r\n  end\r\n*/\r\n\r\nLJLIB_CF(table_maxn)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  TValue *array = tvref(t->array);\r\n  Node *node;\r\n  lua_Number m = 0;\r\n  ptrdiff_t i;\r\n  for (i = (ptrdiff_t)t->asize - 1; i >= 0; i--)\r\n    if (!tvisnil(&array[i])) {\r\n      m = (lua_Number)(int32_t)i;\r\n      break;\r\n    }\r\n  node = noderef(t->node);\r\n  for (i = (ptrdiff_t)t->hmask; i >= 0; i--)\r\n    if (!tvisnil(&node[i].val) && tvisnumber(&node[i].key)) {\r\n      lua_Number n = numberVnum(&node[i].key);\r\n      if (n > m) m = n;\r\n    }\r\n  setnumV(L->top-1, m);\r\n  return 1;\r\n}\r\n\r\nLJLIB_CF(table_insert)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n, i = (int32_t)lj_tab_len(t) + 1;\r\n  int nargs = (int)((char *)L->top - (char *)L->base);\r\n  if (nargs != 2*sizeof(TValue)) {\r\n    if (nargs != 3*sizeof(TValue))\r\n      lj_err_caller(L, LJ_ERR_TABINS);\r\n    /* NOBARRIER: This just moves existing elements around. */\r\n    for (n = lj_lib_checkint(L, 2); i > n; i--) {\r\n      /* The set may invalidate the get pointer, so need to do it first! */\r\n      TValue *dst = lj_tab_setint(L, t, i);\r\n      cTValue *src = lj_tab_getint(t, i-1);\r\n      if (src) {\r\n\tcopyTV(L, dst, src);\r\n      } else {\r\n\tsetnilV(dst);\r\n      }\r\n    }\r\n    i = n;\r\n  }\r\n  {\r\n    TValue *dst = lj_tab_setint(L, t, i);\r\n    copyTV(L, dst, L->top-1);  /* Set new value. */\r\n    lj_gc_barriert(L, t, dst);\r\n  }\r\n  return 0;\r\n}\r\n\r\nLJLIB_LUA(table_remove) /*\r\n  function(t, pos)\r\n    CHECK_tab(t)\r\n    local len = #t\r\n    if pos == nil then\r\n      if len ~= 0 then\r\n\tlocal old = t[len]\r\n\tt[len] = nil\r\n\treturn old\r\n      end\r\n    else\r\n      CHECK_int(pos)\r\n      if pos >= 1 and pos <= len then\r\n\tlocal old = t[pos]\r\n\tfor i=pos+1,len do\r\n\t  t[i-1] = t[i]\r\n\tend\r\n\tt[len] = nil\r\n\treturn old\r\n      end\r\n    end\r\n  end\r\n*/\r\n\r\nLJLIB_CF(table_concat)\t\tLJLIB_REC(.)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  GCstr *sep = lj_lib_optstr(L, 2);\r\n  int32_t i = lj_lib_optint(L, 3, 1);\r\n  int32_t e = (L->base+3 < L->top && !tvisnil(L->base+3)) ?\r\n\t      lj_lib_checkint(L, 4) : (int32_t)lj_tab_len(t);\r\n  SBuf *sb = lj_buf_tmp_(L);\r\n  SBuf *sbx = lj_buf_puttab(sb, t, sep, i, e);\r\n  if (LJ_UNLIKELY(!sbx)) {  /* Error: bad element type. */\r\n    int32_t idx = (int32_t)(intptr_t)sbufP(sb);\r\n    cTValue *o = lj_tab_getint(t, idx);\r\n    lj_err_callerv(L, LJ_ERR_TABCAT,\r\n\t\t   lj_obj_itypename[o ? itypemap(o) : ~LJ_TNIL], idx);\r\n  }\r\n  setstrV(L, L->top-1, lj_buf_str(L, sbx));\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\nstatic void set2(lua_State *L, int i, int j)\r\n{\r\n  lua_rawseti(L, 1, i);\r\n  lua_rawseti(L, 1, j);\r\n}\r\n\r\nstatic int sort_comp(lua_State *L, int a, int b)\r\n{\r\n  if (!lua_isnil(L, 2)) {  /* function? */\r\n    int res;\r\n    lua_pushvalue(L, 2);\r\n    lua_pushvalue(L, a-1);  /* -1 to compensate function */\r\n    lua_pushvalue(L, b-2);  /* -2 to compensate function and `a' */\r\n    lua_call(L, 2, 1);\r\n    res = lua_toboolean(L, -1);\r\n    lua_pop(L, 1);\r\n    return res;\r\n  } else {  /* a < b? */\r\n    return lua_lessthan(L, a, b);\r\n  }\r\n}\r\n\r\nstatic void auxsort(lua_State *L, int l, int u)\r\n{\r\n  while (l < u) {  /* for tail recursion */\r\n    int i, j;\r\n    /* sort elements a[l], a[(l+u)/2] and a[u] */\r\n    lua_rawgeti(L, 1, l);\r\n    lua_rawgeti(L, 1, u);\r\n    if (sort_comp(L, -1, -2))  /* a[u] < a[l]? */\r\n      set2(L, l, u);  /* swap a[l] - a[u] */\r\n    else\r\n      lua_pop(L, 2);\r\n    if (u-l == 1) break;  /* only 2 elements */\r\n    i = (l+u)/2;\r\n    lua_rawgeti(L, 1, i);\r\n    lua_rawgeti(L, 1, l);\r\n    if (sort_comp(L, -2, -1)) {  /* a[i]<a[l]? */\r\n      set2(L, i, l);\r\n    } else {\r\n      lua_pop(L, 1);  /* remove a[l] */\r\n      lua_rawgeti(L, 1, u);\r\n      if (sort_comp(L, -1, -2))  /* a[u]<a[i]? */\r\n\tset2(L, i, u);\r\n      else\r\n\tlua_pop(L, 2);\r\n    }\r\n    if (u-l == 2) break;  /* only 3 elements */\r\n    lua_rawgeti(L, 1, i);  /* Pivot */\r\n    lua_pushvalue(L, -1);\r\n    lua_rawgeti(L, 1, u-1);\r\n    set2(L, i, u-1);\r\n    /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */\r\n    i = l; j = u-1;\r\n    for (;;) {  /* invariant: a[l..i] <= P <= a[j..u] */\r\n      /* repeat ++i until a[i] >= P */\r\n      while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {\r\n\tif (i>=u) lj_err_caller(L, LJ_ERR_TABSORT);\r\n\tlua_pop(L, 1);  /* remove a[i] */\r\n      }\r\n      /* repeat --j until a[j] <= P */\r\n      while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {\r\n\tif (j<=l) lj_err_caller(L, LJ_ERR_TABSORT);\r\n\tlua_pop(L, 1);  /* remove a[j] */\r\n      }\r\n      if (j<i) {\r\n\tlua_pop(L, 3);  /* pop pivot, a[i], a[j] */\r\n\tbreak;\r\n      }\r\n      set2(L, i, j);\r\n    }\r\n    lua_rawgeti(L, 1, u-1);\r\n    lua_rawgeti(L, 1, i);\r\n    set2(L, u-1, i);  /* swap pivot (a[u-1]) with a[i] */\r\n    /* a[l..i-1] <= a[i] == P <= a[i+1..u] */\r\n    /* adjust so that smaller half is in [j..i] and larger one in [l..u] */\r\n    if (i-l < u-i) {\r\n      j=l; i=i-1; l=i+2;\r\n    } else {\r\n      j=i+1; i=u; u=j-2;\r\n    }\r\n    auxsort(L, j, i);  /* call recursively the smaller one */\r\n  }  /* repeat the routine for the larger one */\r\n}\r\n\r\nLJLIB_CF(table_sort)\r\n{\r\n  GCtab *t = lj_lib_checktab(L, 1);\r\n  int32_t n = (int32_t)lj_tab_len(t);\r\n  lua_settop(L, 2);\r\n  if (!tvisnil(L->base+1))\r\n    lj_lib_checkfunc(L, 2);\r\n  auxsort(L, 1, n);\r\n  return 0;\r\n}\r\n\r\n#if LJ_52\r\nLJLIB_PUSH(\"n\")\r\nLJLIB_CF(table_pack)\r\n{\r\n  TValue *array, *base = L->base;\r\n  MSize i, n = (uint32_t)(L->top - base);\r\n  GCtab *t = lj_tab_new(L, n ? n+1 : 0, 1);\r\n  /* NOBARRIER: The table is new (marked white). */\r\n  setintV(lj_tab_setstr(L, t, strV(lj_lib_upvalue(L, 1))), (int32_t)n);\r\n  for (array = tvref(t->array) + 1, i = 0; i < n; i++)\r\n    copyTV(L, &array[i], &base[i]);\r\n  settabV(L, base, t);\r\n  L->top = base+1;\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n#endif\r\n\r\nLJLIB_NOREG LJLIB_CF(table_new)\t\tLJLIB_REC(.)\r\n{\r\n  int32_t a = lj_lib_checkint(L, 1);\r\n  int32_t h = lj_lib_checkint(L, 2);\r\n  lua_createtable(L, a, h);\r\n  return 1;\r\n}\r\n\r\nLJLIB_NOREG LJLIB_CF(table_clear)\tLJLIB_REC(.)\r\n{\r\n  lj_tab_clear(lj_lib_checktab(L, 1));\r\n  return 0;\r\n}\r\n\r\nstatic int luaopen_table_new(lua_State *L)\r\n{\r\n  return lj_lib_postreg(L, lj_cf_table_new, FF_table_new, \"new\");\r\n}\r\n\r\nstatic int luaopen_table_clear(lua_State *L)\r\n{\r\n  return lj_lib_postreg(L, lj_cf_table_clear, FF_table_clear, \"clear\");\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#include \"lj_libdef.h\"\r\n\r\nLUALIB_API int luaopen_table(lua_State *L)\r\n{\r\n  LJ_LIB_REG(L, LUA_TABLIBNAME, table);\r\n#if LJ_52\r\n  lua_getglobal(L, \"unpack\");\r\n  lua_setfield(L, -2, \"unpack\");\r\n#endif\r\n  lj_lib_prereg(L, LUA_TABLIBNAME \".new\", luaopen_table_new, tabV(L->top-1));\r\n  lj_lib_prereg(L, LUA_TABLIBNAME \".clear\", luaopen_table_clear, tabV(L->top-1));\r\n  return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj.supp",
    "content": "# Valgrind suppression file for LuaJIT 2.0.\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr4\r\n   fun:lj_str_cmp\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr1\r\n   fun:lj_str_cmp\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr4\r\n   fun:lj_str_new\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Addr1\r\n   fun:lj_str_new\r\n}\r\n{\r\n   Optimized string compare\r\n   Memcheck:Cond\r\n   fun:lj_str_new\r\n}\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_alloc.c",
    "content": "/*\r\n** Bundled memory allocator.\r\n**\r\n** Beware: this is a HEAVILY CUSTOMIZED version of dlmalloc.\r\n** The original bears the following remark:\r\n**\r\n**   This is a version (aka dlmalloc) of malloc/free/realloc written by\r\n**   Doug Lea and released to the public domain, as explained at\r\n**   http://creativecommons.org/licenses/publicdomain.\r\n**\r\n**   * Version pre-2.8.4 Wed Mar 29 19:46:29 2006    (dl at gee)\r\n**\r\n** No additional copyright is claimed over the customizations.\r\n** Please do NOT bother the original author about this version here!\r\n**\r\n** If you want to use dlmalloc in another project, you should get\r\n** the original from: ftp://gee.cs.oswego.edu/pub/misc/\r\n** For thread-safe derivatives, take a look at:\r\n** - ptmalloc: http://www.malloc.de/\r\n** - nedmalloc: http://www.nedprod.com/programs/portable/nedmalloc/\r\n*/\r\n\r\n#define lj_alloc_c\r\n#define LUA_CORE\r\n\r\n/* To get the mremap prototype. Must be defined before any system includes. */\r\n#if defined(__linux__) && !defined(_GNU_SOURCE)\r\n#define _GNU_SOURCE\r\n#endif\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n#include \"lj_alloc.h\"\r\n\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\n\r\n#define MAX_SIZE_T\t\t(~(size_t)0)\r\n#define MALLOC_ALIGNMENT\t((size_t)8U)\r\n\r\n#define DEFAULT_GRANULARITY\t((size_t)128U * (size_t)1024U)\r\n#define DEFAULT_TRIM_THRESHOLD\t((size_t)2U * (size_t)1024U * (size_t)1024U)\r\n#define DEFAULT_MMAP_THRESHOLD\t((size_t)128U * (size_t)1024U)\r\n#define MAX_RELEASE_CHECK_RATE\t255\r\n\r\n/* ------------------- size_t and alignment properties -------------------- */\r\n\r\n/* The byte and bit size of a size_t */\r\n#define SIZE_T_SIZE\t\t(sizeof(size_t))\r\n#define SIZE_T_BITSIZE\t\t(sizeof(size_t) << 3)\r\n\r\n/* Some constants coerced to size_t */\r\n/* Annoying but necessary to avoid errors on some platforms */\r\n#define SIZE_T_ZERO\t\t((size_t)0)\r\n#define SIZE_T_ONE\t\t((size_t)1)\r\n#define SIZE_T_TWO\t\t((size_t)2)\r\n#define TWO_SIZE_T_SIZES\t(SIZE_T_SIZE<<1)\r\n#define FOUR_SIZE_T_SIZES\t(SIZE_T_SIZE<<2)\r\n#define SIX_SIZE_T_SIZES\t(FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES)\r\n\r\n/* The bit mask value corresponding to MALLOC_ALIGNMENT */\r\n#define CHUNK_ALIGN_MASK\t(MALLOC_ALIGNMENT - SIZE_T_ONE)\r\n\r\n/* the number of bytes to offset an address to align it */\r\n#define align_offset(A)\\\r\n ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\\\r\n  ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK))\r\n\r\n/* -------------------------- MMAP support ------------------------------- */\r\n\r\n#define MFAIL\t\t\t((void *)(MAX_SIZE_T))\r\n#define CMFAIL\t\t\t((char *)(MFAIL)) /* defined for convenience */\r\n\r\n#define IS_DIRECT_BIT\t\t(SIZE_T_ONE)\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#if LJ_64 && !LJ_GC64\r\n\r\n/* Undocumented, but hey, that's what we all love so much about Windows. */\r\ntypedef long (*PNTAVM)(HANDLE handle, void **addr, ULONG zbits,\r\n\t\t       size_t *size, ULONG alloctype, ULONG prot);\r\nstatic PNTAVM ntavm;\r\n\r\n/* Number of top bits of the lower 32 bits of an address that must be zero.\r\n** Apparently 0 gives us full 64 bit addresses and 1 gives us the lower 2GB.\r\n*/\r\n#define NTAVM_ZEROBITS\t\t1\r\n\r\nstatic void INIT_MMAP(void)\r\n{\r\n  ntavm = (PNTAVM)GetProcAddress(GetModuleHandleA(\"ntdll.dll\"),\r\n\t\t\t\t \"NtAllocateVirtualMemory\");\r\n}\r\n\r\n/* Win64 32 bit MMAP via NtAllocateVirtualMemory. */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = NULL;\r\n  long st = ntavm(INVALID_HANDLE_VALUE, &ptr, NTAVM_ZEROBITS, &size,\r\n\t\t  MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return st == 0 ? ptr : MFAIL;\r\n}\r\n\r\n/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */\r\nstatic LJ_AINLINE void *DIRECT_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = NULL;\r\n  long st = ntavm(INVALID_HANDLE_VALUE, &ptr, NTAVM_ZEROBITS, &size,\r\n\t\t  MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return st == 0 ? ptr : MFAIL;\r\n}\r\n\r\n#else\r\n\r\n#define INIT_MMAP()\t\t((void)0)\r\n\r\n/* Win32 MMAP via VirtualAlloc */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return ptr ? ptr : MFAIL;\r\n}\r\n\r\n/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */\r\nstatic LJ_AINLINE void *DIRECT_MMAP(size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  void *ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN,\r\n\t\t\t   PAGE_READWRITE);\r\n  SetLastError(olderr);\r\n  return ptr ? ptr : MFAIL;\r\n}\r\n\r\n#endif\r\n\r\n/* This function supports releasing coalesed segments */\r\nstatic LJ_AINLINE int CALL_MUNMAP(void *ptr, size_t size)\r\n{\r\n  DWORD olderr = GetLastError();\r\n  MEMORY_BASIC_INFORMATION minfo;\r\n  char *cptr = (char *)ptr;\r\n  while (size) {\r\n    if (VirtualQuery(cptr, &minfo, sizeof(minfo)) == 0)\r\n      return -1;\r\n    if (minfo.BaseAddress != cptr || minfo.AllocationBase != cptr ||\r\n\tminfo.State != MEM_COMMIT || minfo.RegionSize > size)\r\n      return -1;\r\n    if (VirtualFree(cptr, 0, MEM_RELEASE) == 0)\r\n      return -1;\r\n    cptr += minfo.RegionSize;\r\n    size -= minfo.RegionSize;\r\n  }\r\n  SetLastError(olderr);\r\n  return 0;\r\n}\r\n\r\n#else\r\n\r\n#include <errno.h>\r\n#include <sys/mman.h>\r\n\r\n#define MMAP_PROT\t\t(PROT_READ|PROT_WRITE)\r\n#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON)\r\n#define MAP_ANONYMOUS\t\tMAP_ANON\r\n#endif\r\n#define MMAP_FLAGS\t\t(MAP_PRIVATE|MAP_ANONYMOUS)\r\n\r\n#if LJ_64 && !LJ_GC64\r\n/* 64 bit mode with 32 bit pointers needs special support for allocating\r\n** memory in the lower 2GB.\r\n*/\r\n\r\n#if defined(MAP_32BIT)\r\n\r\n#if defined(__sun__)\r\n#define MMAP_REGION_START\t((uintptr_t)0x1000)\r\n#else\r\n/* Actually this only gives us max. 1GB in current Linux kernels. */\r\n#define MMAP_REGION_START\t((uintptr_t)0)\r\n#endif\r\n\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  void *ptr = mmap((void *)MMAP_REGION_START, size, MMAP_PROT, MAP_32BIT|MMAP_FLAGS, -1, 0);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#elif LJ_TARGET_OSX || LJ_TARGET_PS4 || defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) || defined(__sun__)\r\n\r\n/* OSX and FreeBSD mmap() use a naive first-fit linear search.\r\n** That's perfect for us. Except that -pagezero_size must be set for OSX,\r\n** otherwise the lower 4GB are blocked. And the 32GB RLIMIT_DATA needs\r\n** to be reduced to 250MB on FreeBSD.\r\n*/\r\n#if LJ_TARGET_OSX || defined(__DragonFly__)\r\n#define MMAP_REGION_START\t((uintptr_t)0x10000)\r\n#elif LJ_TARGET_PS4\r\n#define MMAP_REGION_START\t((uintptr_t)0x4000)\r\n#else\r\n#define MMAP_REGION_START\t((uintptr_t)0x10000000)\r\n#endif\r\n#define MMAP_REGION_END\t\t((uintptr_t)0x80000000)\r\n\r\n#if (defined(__FreeBSD__) || defined(__FreeBSD_kernel__)) && !LJ_TARGET_PS4\r\n#include <sys/resource.h>\r\n#endif\r\n\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  /* Hint for next allocation. Doesn't need to be thread-safe. */\r\n  static uintptr_t alloc_hint = MMAP_REGION_START;\r\n  int retry = 0;\r\n#if (defined(__FreeBSD__) || defined(__FreeBSD_kernel__)) && !LJ_TARGET_PS4\r\n  static int rlimit_modified = 0;\r\n  if (LJ_UNLIKELY(rlimit_modified == 0)) {\r\n    struct rlimit rlim;\r\n    rlim.rlim_cur = rlim.rlim_max = MMAP_REGION_START;\r\n    setrlimit(RLIMIT_DATA, &rlim);  /* Ignore result. May fail below. */\r\n    rlimit_modified = 1;\r\n  }\r\n#endif\r\n  for (;;) {\r\n    void *p = mmap((void *)alloc_hint, size, MMAP_PROT, MMAP_FLAGS, -1, 0);\r\n    if ((uintptr_t)p >= MMAP_REGION_START &&\r\n\t(uintptr_t)p + size < MMAP_REGION_END) {\r\n      alloc_hint = (uintptr_t)p + size;\r\n      errno = olderr;\r\n      return p;\r\n    }\r\n    if (p != CMFAIL) munmap(p, size);\r\n#if defined(__sun__) || defined(__DragonFly__)\r\n    alloc_hint += 0x1000000;  /* Need near-exhaustive linear scan. */\r\n    if (alloc_hint + size < MMAP_REGION_END) continue;\r\n#endif\r\n    if (retry) break;\r\n    retry = 1;\r\n    alloc_hint = MMAP_REGION_START;\r\n  }\r\n  errno = olderr;\r\n  return CMFAIL;\r\n}\r\n\r\n#else\r\n\r\n#error \"NYI: need an equivalent of MAP_32BIT for this 64 bit OS\"\r\n\r\n#endif\r\n\r\n#else\r\n\r\n/* 32 bit mode and GC64 mode is easy. */\r\nstatic LJ_AINLINE void *CALL_MMAP(size_t size)\r\n{\r\n  int olderr = errno;\r\n  void *ptr = mmap(NULL, size, MMAP_PROT, MMAP_FLAGS, -1, 0);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#endif\r\n\r\n#define INIT_MMAP()\t\t((void)0)\r\n#define DIRECT_MMAP(s)\t\tCALL_MMAP(s)\r\n\r\nstatic LJ_AINLINE int CALL_MUNMAP(void *ptr, size_t size)\r\n{\r\n  int olderr = errno;\r\n  int ret = munmap(ptr, size);\r\n  errno = olderr;\r\n  return ret;\r\n}\r\n\r\n#if LJ_TARGET_LINUX\r\n/* Need to define _GNU_SOURCE to get the mremap prototype. */\r\nstatic LJ_AINLINE void *CALL_MREMAP_(void *ptr, size_t osz, size_t nsz,\r\n\t\t\t\t     int flags)\r\n{\r\n  int olderr = errno;\r\n  ptr = mremap(ptr, osz, nsz, flags);\r\n  errno = olderr;\r\n  return ptr;\r\n}\r\n\r\n#define CALL_MREMAP(addr, osz, nsz, mv) CALL_MREMAP_((addr), (osz), (nsz), (mv))\r\n#define CALL_MREMAP_NOMOVE\t0\r\n#define CALL_MREMAP_MAYMOVE\t1\r\n#if LJ_64 && !LJ_GC64\r\n#define CALL_MREMAP_MV\t\tCALL_MREMAP_NOMOVE\r\n#else\r\n#define CALL_MREMAP_MV\t\tCALL_MREMAP_MAYMOVE\r\n#endif\r\n#endif\r\n\r\n#endif\r\n\r\n#ifndef CALL_MREMAP\r\n#define CALL_MREMAP(addr, osz, nsz, mv) ((void)osz, MFAIL)\r\n#endif\r\n\r\n/* -----------------------  Chunk representations ------------------------ */\r\n\r\nstruct malloc_chunk {\r\n  size_t               prev_foot;  /* Size of previous chunk (if free).  */\r\n  size_t               head;       /* Size and inuse bits. */\r\n  struct malloc_chunk *fd;         /* double links -- used only if free. */\r\n  struct malloc_chunk *bk;\r\n};\r\n\r\ntypedef struct malloc_chunk  mchunk;\r\ntypedef struct malloc_chunk *mchunkptr;\r\ntypedef struct malloc_chunk *sbinptr;  /* The type of bins of chunks */\r\ntypedef size_t bindex_t;               /* Described below */\r\ntypedef unsigned int binmap_t;         /* Described below */\r\ntypedef unsigned int flag_t;           /* The type of various bit flag sets */\r\n\r\n/* ------------------- Chunks sizes and alignments ----------------------- */\r\n\r\n#define MCHUNK_SIZE\t\t(sizeof(mchunk))\r\n\r\n#define CHUNK_OVERHEAD\t\t(SIZE_T_SIZE)\r\n\r\n/* Direct chunks need a second word of overhead ... */\r\n#define DIRECT_CHUNK_OVERHEAD\t(TWO_SIZE_T_SIZES)\r\n/* ... and additional padding for fake next-chunk at foot */\r\n#define DIRECT_FOOT_PAD\t\t(FOUR_SIZE_T_SIZES)\r\n\r\n/* The smallest size we can malloc is an aligned minimal chunk */\r\n#define MIN_CHUNK_SIZE\\\r\n  ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)\r\n\r\n/* conversion from malloc headers to user pointers, and back */\r\n#define chunk2mem(p)\t\t((void *)((char *)(p) + TWO_SIZE_T_SIZES))\r\n#define mem2chunk(mem)\t\t((mchunkptr)((char *)(mem) - TWO_SIZE_T_SIZES))\r\n/* chunk associated with aligned address A */\r\n#define align_as_chunk(A)\t(mchunkptr)((A) + align_offset(chunk2mem(A)))\r\n\r\n/* Bounds on request (not chunk) sizes. */\r\n#define MAX_REQUEST\t\t((~MIN_CHUNK_SIZE+1) << 2)\r\n#define MIN_REQUEST\t\t(MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE)\r\n\r\n/* pad request bytes into a usable size */\r\n#define pad_request(req) \\\r\n   (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK)\r\n\r\n/* pad request, checking for minimum (but not maximum) */\r\n#define request2size(req) \\\r\n  (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req))\r\n\r\n/* ------------------ Operations on head and foot fields ----------------- */\r\n\r\n#define PINUSE_BIT\t\t(SIZE_T_ONE)\r\n#define CINUSE_BIT\t\t(SIZE_T_TWO)\r\n#define INUSE_BITS\t\t(PINUSE_BIT|CINUSE_BIT)\r\n\r\n/* Head value for fenceposts */\r\n#define FENCEPOST_HEAD\t\t(INUSE_BITS|SIZE_T_SIZE)\r\n\r\n/* extraction of fields from head words */\r\n#define cinuse(p)\t\t((p)->head & CINUSE_BIT)\r\n#define pinuse(p)\t\t((p)->head & PINUSE_BIT)\r\n#define chunksize(p)\t\t((p)->head & ~(INUSE_BITS))\r\n\r\n#define clear_pinuse(p)\t\t((p)->head &= ~PINUSE_BIT)\r\n#define clear_cinuse(p)\t\t((p)->head &= ~CINUSE_BIT)\r\n\r\n/* Treat space at ptr +/- offset as a chunk */\r\n#define chunk_plus_offset(p, s)\t\t((mchunkptr)(((char *)(p)) + (s)))\r\n#define chunk_minus_offset(p, s)\t((mchunkptr)(((char *)(p)) - (s)))\r\n\r\n/* Ptr to next or previous physical malloc_chunk. */\r\n#define next_chunk(p)\t((mchunkptr)(((char *)(p)) + ((p)->head & ~INUSE_BITS)))\r\n#define prev_chunk(p)\t((mchunkptr)(((char *)(p)) - ((p)->prev_foot) ))\r\n\r\n/* extract next chunk's pinuse bit */\r\n#define next_pinuse(p)\t((next_chunk(p)->head) & PINUSE_BIT)\r\n\r\n/* Get/set size at footer */\r\n#define get_foot(p, s)\t(((mchunkptr)((char *)(p) + (s)))->prev_foot)\r\n#define set_foot(p, s)\t(((mchunkptr)((char *)(p) + (s)))->prev_foot = (s))\r\n\r\n/* Set size, pinuse bit, and foot */\r\n#define set_size_and_pinuse_of_free_chunk(p, s)\\\r\n  ((p)->head = (s|PINUSE_BIT), set_foot(p, s))\r\n\r\n/* Set size, pinuse bit, foot, and clear next pinuse */\r\n#define set_free_with_pinuse(p, s, n)\\\r\n  (clear_pinuse(n), set_size_and_pinuse_of_free_chunk(p, s))\r\n\r\n#define is_direct(p)\\\r\n  (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_DIRECT_BIT))\r\n\r\n/* Get the internal overhead associated with chunk p */\r\n#define overhead_for(p)\\\r\n (is_direct(p)? DIRECT_CHUNK_OVERHEAD : CHUNK_OVERHEAD)\r\n\r\n/* ---------------------- Overlaid data structures ----------------------- */\r\n\r\nstruct malloc_tree_chunk {\r\n  /* The first four fields must be compatible with malloc_chunk */\r\n  size_t                    prev_foot;\r\n  size_t                    head;\r\n  struct malloc_tree_chunk *fd;\r\n  struct malloc_tree_chunk *bk;\r\n\r\n  struct malloc_tree_chunk *child[2];\r\n  struct malloc_tree_chunk *parent;\r\n  bindex_t                  index;\r\n};\r\n\r\ntypedef struct malloc_tree_chunk  tchunk;\r\ntypedef struct malloc_tree_chunk *tchunkptr;\r\ntypedef struct malloc_tree_chunk *tbinptr; /* The type of bins of trees */\r\n\r\n/* A little helper macro for trees */\r\n#define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])\r\n\r\n/* ----------------------------- Segments -------------------------------- */\r\n\r\nstruct malloc_segment {\r\n  char        *base;             /* base address */\r\n  size_t       size;             /* allocated size */\r\n  struct malloc_segment *next;   /* ptr to next segment */\r\n};\r\n\r\ntypedef struct malloc_segment  msegment;\r\ntypedef struct malloc_segment *msegmentptr;\r\n\r\n/* ---------------------------- malloc_state ----------------------------- */\r\n\r\n/* Bin types, widths and sizes */\r\n#define NSMALLBINS\t\t(32U)\r\n#define NTREEBINS\t\t(32U)\r\n#define SMALLBIN_SHIFT\t\t(3U)\r\n#define SMALLBIN_WIDTH\t\t(SIZE_T_ONE << SMALLBIN_SHIFT)\r\n#define TREEBIN_SHIFT\t\t(8U)\r\n#define MIN_LARGE_SIZE\t\t(SIZE_T_ONE << TREEBIN_SHIFT)\r\n#define MAX_SMALL_SIZE\t\t(MIN_LARGE_SIZE - SIZE_T_ONE)\r\n#define MAX_SMALL_REQUEST  (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD)\r\n\r\nstruct malloc_state {\r\n  binmap_t   smallmap;\r\n  binmap_t   treemap;\r\n  size_t     dvsize;\r\n  size_t     topsize;\r\n  mchunkptr  dv;\r\n  mchunkptr  top;\r\n  size_t     trim_check;\r\n  size_t     release_checks;\r\n  mchunkptr  smallbins[(NSMALLBINS+1)*2];\r\n  tbinptr    treebins[NTREEBINS];\r\n  msegment   seg;\r\n};\r\n\r\ntypedef struct malloc_state *mstate;\r\n\r\n#define is_initialized(M)\t((M)->top != 0)\r\n\r\n/* -------------------------- system alloc setup ------------------------- */\r\n\r\n/* page-align a size */\r\n#define page_align(S)\\\r\n (((S) + (LJ_PAGESIZE - SIZE_T_ONE)) & ~(LJ_PAGESIZE - SIZE_T_ONE))\r\n\r\n/* granularity-align a size */\r\n#define granularity_align(S)\\\r\n  (((S) + (DEFAULT_GRANULARITY - SIZE_T_ONE))\\\r\n   & ~(DEFAULT_GRANULARITY - SIZE_T_ONE))\r\n\r\n#if LJ_TARGET_WINDOWS\r\n#define mmap_align(S)\tgranularity_align(S)\r\n#else\r\n#define mmap_align(S)\tpage_align(S)\r\n#endif\r\n\r\n/*  True if segment S holds address A */\r\n#define segment_holds(S, A)\\\r\n  ((char *)(A) >= S->base && (char *)(A) < S->base + S->size)\r\n\r\n/* Return segment holding given address */\r\nstatic msegmentptr segment_holding(mstate m, char *addr)\r\n{\r\n  msegmentptr sp = &m->seg;\r\n  for (;;) {\r\n    if (addr >= sp->base && addr < sp->base + sp->size)\r\n      return sp;\r\n    if ((sp = sp->next) == 0)\r\n      return 0;\r\n  }\r\n}\r\n\r\n/* Return true if segment contains a segment link */\r\nstatic int has_segment_link(mstate m, msegmentptr ss)\r\n{\r\n  msegmentptr sp = &m->seg;\r\n  for (;;) {\r\n    if ((char *)sp >= ss->base && (char *)sp < ss->base + ss->size)\r\n      return 1;\r\n    if ((sp = sp->next) == 0)\r\n      return 0;\r\n  }\r\n}\r\n\r\n/*\r\n  TOP_FOOT_SIZE is padding at the end of a segment, including space\r\n  that may be needed to place segment records and fenceposts when new\r\n  noncontiguous segments are added.\r\n*/\r\n#define TOP_FOOT_SIZE\\\r\n  (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE)\r\n\r\n/* ---------------------------- Indexing Bins ---------------------------- */\r\n\r\n#define is_small(s)\t\t(((s) >> SMALLBIN_SHIFT) < NSMALLBINS)\r\n#define small_index(s)\t\t((s)  >> SMALLBIN_SHIFT)\r\n#define small_index2size(i)\t((i)  << SMALLBIN_SHIFT)\r\n#define MIN_SMALL_INDEX\t\t(small_index(MIN_CHUNK_SIZE))\r\n\r\n/* addressing by index. See above about smallbin repositioning */\r\n#define smallbin_at(M, i)\t((sbinptr)((char *)&((M)->smallbins[(i)<<1])))\r\n#define treebin_at(M,i)\t\t(&((M)->treebins[i]))\r\n\r\n/* assign tree index for size S to variable I */\r\n#define compute_tree_index(S, I)\\\r\n{\\\r\n  unsigned int X = (unsigned int)(S >> TREEBIN_SHIFT);\\\r\n  if (X == 0) {\\\r\n    I = 0;\\\r\n  } else if (X > 0xFFFF) {\\\r\n    I = NTREEBINS-1;\\\r\n  } else {\\\r\n    unsigned int K = lj_fls(X);\\\r\n    I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\\\r\n  }\\\r\n}\r\n\r\n/* Bit representing maximum resolved size in a treebin at i */\r\n#define bit_for_tree_index(i) \\\r\n   (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2)\r\n\r\n/* Shift placing maximum resolved bit in a treebin at i as sign bit */\r\n#define leftshift_for_tree_index(i) \\\r\n   ((i == NTREEBINS-1)? 0 : \\\r\n    ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2)))\r\n\r\n/* The size of the smallest chunk held in bin with index i */\r\n#define minsize_for_tree_index(i) \\\r\n   ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) |  \\\r\n   (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1)))\r\n\r\n/* ------------------------ Operations on bin maps ----------------------- */\r\n\r\n/* bit corresponding to given index */\r\n#define idx2bit(i)\t\t((binmap_t)(1) << (i))\r\n\r\n/* Mark/Clear bits with given index */\r\n#define mark_smallmap(M,i)\t((M)->smallmap |=  idx2bit(i))\r\n#define clear_smallmap(M,i)\t((M)->smallmap &= ~idx2bit(i))\r\n#define smallmap_is_marked(M,i)\t((M)->smallmap &   idx2bit(i))\r\n\r\n#define mark_treemap(M,i)\t((M)->treemap  |=  idx2bit(i))\r\n#define clear_treemap(M,i)\t((M)->treemap  &= ~idx2bit(i))\r\n#define treemap_is_marked(M,i)\t((M)->treemap  &   idx2bit(i))\r\n\r\n/* mask with all bits to left of least bit of x on */\r\n#define left_bits(x)\t\t((x<<1) | (~(x<<1)+1))\r\n\r\n/* Set cinuse bit and pinuse bit of next chunk */\r\n#define set_inuse(M,p,s)\\\r\n  ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\\\r\n  ((mchunkptr)(((char *)(p)) + (s)))->head |= PINUSE_BIT)\r\n\r\n/* Set cinuse and pinuse of this chunk and pinuse of next chunk */\r\n#define set_inuse_and_pinuse(M,p,s)\\\r\n  ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\\\r\n  ((mchunkptr)(((char *)(p)) + (s)))->head |= PINUSE_BIT)\r\n\r\n/* Set size, cinuse and pinuse bit of this chunk */\r\n#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\\\r\n  ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))\r\n\r\n/* ----------------------- Operations on smallbins ----------------------- */\r\n\r\n/* Link a free chunk into a smallbin  */\r\n#define insert_small_chunk(M, P, S) {\\\r\n  bindex_t I = small_index(S);\\\r\n  mchunkptr B = smallbin_at(M, I);\\\r\n  mchunkptr F = B;\\\r\n  if (!smallmap_is_marked(M, I))\\\r\n    mark_smallmap(M, I);\\\r\n  else\\\r\n    F = B->fd;\\\r\n  B->fd = P;\\\r\n  F->bk = P;\\\r\n  P->fd = F;\\\r\n  P->bk = B;\\\r\n}\r\n\r\n/* Unlink a chunk from a smallbin  */\r\n#define unlink_small_chunk(M, P, S) {\\\r\n  mchunkptr F = P->fd;\\\r\n  mchunkptr B = P->bk;\\\r\n  bindex_t I = small_index(S);\\\r\n  if (F == B) {\\\r\n    clear_smallmap(M, I);\\\r\n  } else {\\\r\n    F->bk = B;\\\r\n    B->fd = F;\\\r\n  }\\\r\n}\r\n\r\n/* Unlink the first chunk from a smallbin */\r\n#define unlink_first_small_chunk(M, B, P, I) {\\\r\n  mchunkptr F = P->fd;\\\r\n  if (B == F) {\\\r\n    clear_smallmap(M, I);\\\r\n  } else {\\\r\n    B->fd = F;\\\r\n    F->bk = B;\\\r\n  }\\\r\n}\r\n\r\n/* Replace dv node, binning the old one */\r\n/* Used only when dvsize known to be small */\r\n#define replace_dv(M, P, S) {\\\r\n  size_t DVS = M->dvsize;\\\r\n  if (DVS != 0) {\\\r\n    mchunkptr DV = M->dv;\\\r\n    insert_small_chunk(M, DV, DVS);\\\r\n  }\\\r\n  M->dvsize = S;\\\r\n  M->dv = P;\\\r\n}\r\n\r\n/* ------------------------- Operations on trees ------------------------- */\r\n\r\n/* Insert chunk into tree */\r\n#define insert_large_chunk(M, X, S) {\\\r\n  tbinptr *H;\\\r\n  bindex_t I;\\\r\n  compute_tree_index(S, I);\\\r\n  H = treebin_at(M, I);\\\r\n  X->index = I;\\\r\n  X->child[0] = X->child[1] = 0;\\\r\n  if (!treemap_is_marked(M, I)) {\\\r\n    mark_treemap(M, I);\\\r\n    *H = X;\\\r\n    X->parent = (tchunkptr)H;\\\r\n    X->fd = X->bk = X;\\\r\n  } else {\\\r\n    tchunkptr T = *H;\\\r\n    size_t K = S << leftshift_for_tree_index(I);\\\r\n    for (;;) {\\\r\n      if (chunksize(T) != S) {\\\r\n\ttchunkptr *C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\\\r\n\tK <<= 1;\\\r\n\tif (*C != 0) {\\\r\n\t  T = *C;\\\r\n\t} else {\\\r\n\t  *C = X;\\\r\n\t  X->parent = T;\\\r\n\t  X->fd = X->bk = X;\\\r\n\t  break;\\\r\n\t}\\\r\n      } else {\\\r\n\ttchunkptr F = T->fd;\\\r\n\tT->fd = F->bk = X;\\\r\n\tX->fd = F;\\\r\n\tX->bk = T;\\\r\n\tX->parent = 0;\\\r\n\tbreak;\\\r\n      }\\\r\n    }\\\r\n  }\\\r\n}\r\n\r\n#define unlink_large_chunk(M, X) {\\\r\n  tchunkptr XP = X->parent;\\\r\n  tchunkptr R;\\\r\n  if (X->bk != X) {\\\r\n    tchunkptr F = X->fd;\\\r\n    R = X->bk;\\\r\n    F->bk = R;\\\r\n    R->fd = F;\\\r\n  } else {\\\r\n    tchunkptr *RP;\\\r\n    if (((R = *(RP = &(X->child[1]))) != 0) ||\\\r\n\t((R = *(RP = &(X->child[0]))) != 0)) {\\\r\n      tchunkptr *CP;\\\r\n      while ((*(CP = &(R->child[1])) != 0) ||\\\r\n\t     (*(CP = &(R->child[0])) != 0)) {\\\r\n\tR = *(RP = CP);\\\r\n      }\\\r\n      *RP = 0;\\\r\n    }\\\r\n  }\\\r\n  if (XP != 0) {\\\r\n    tbinptr *H = treebin_at(M, X->index);\\\r\n    if (X == *H) {\\\r\n      if ((*H = R) == 0) \\\r\n\tclear_treemap(M, X->index);\\\r\n    } else {\\\r\n      if (XP->child[0] == X) \\\r\n\tXP->child[0] = R;\\\r\n      else \\\r\n\tXP->child[1] = R;\\\r\n    }\\\r\n    if (R != 0) {\\\r\n      tchunkptr C0, C1;\\\r\n      R->parent = XP;\\\r\n      if ((C0 = X->child[0]) != 0) {\\\r\n\tR->child[0] = C0;\\\r\n\tC0->parent = R;\\\r\n      }\\\r\n      if ((C1 = X->child[1]) != 0) {\\\r\n\tR->child[1] = C1;\\\r\n\tC1->parent = R;\\\r\n      }\\\r\n    }\\\r\n  }\\\r\n}\r\n\r\n/* Relays to large vs small bin operations */\r\n\r\n#define insert_chunk(M, P, S)\\\r\n  if (is_small(S)) { insert_small_chunk(M, P, S)\\\r\n  } else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }\r\n\r\n#define unlink_chunk(M, P, S)\\\r\n  if (is_small(S)) { unlink_small_chunk(M, P, S)\\\r\n  } else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }\r\n\r\n/* -----------------------  Direct-mmapping chunks ----------------------- */\r\n\r\nstatic void *direct_alloc(size_t nb)\r\n{\r\n  size_t mmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n  if (LJ_LIKELY(mmsize > nb)) {     /* Check for wrap around 0 */\r\n    char *mm = (char *)(DIRECT_MMAP(mmsize));\r\n    if (mm != CMFAIL) {\r\n      size_t offset = align_offset(chunk2mem(mm));\r\n      size_t psize = mmsize - offset - DIRECT_FOOT_PAD;\r\n      mchunkptr p = (mchunkptr)(mm + offset);\r\n      p->prev_foot = offset | IS_DIRECT_BIT;\r\n      p->head = psize|CINUSE_BIT;\r\n      chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;\r\n      chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;\r\n      return chunk2mem(p);\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic mchunkptr direct_resize(mchunkptr oldp, size_t nb)\r\n{\r\n  size_t oldsize = chunksize(oldp);\r\n  if (is_small(nb)) /* Can't shrink direct regions below small size */\r\n    return NULL;\r\n  /* Keep old chunk if big enough but not too big */\r\n  if (oldsize >= nb + SIZE_T_SIZE &&\r\n      (oldsize - nb) <= (DEFAULT_GRANULARITY >> 1)) {\r\n    return oldp;\r\n  } else {\r\n    size_t offset = oldp->prev_foot & ~IS_DIRECT_BIT;\r\n    size_t oldmmsize = oldsize + offset + DIRECT_FOOT_PAD;\r\n    size_t newmmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n    char *cp = (char *)CALL_MREMAP((char *)oldp - offset,\r\n\t\t\t\t   oldmmsize, newmmsize, CALL_MREMAP_MV);\r\n    if (cp != CMFAIL) {\r\n      mchunkptr newp = (mchunkptr)(cp + offset);\r\n      size_t psize = newmmsize - offset - DIRECT_FOOT_PAD;\r\n      newp->head = psize|CINUSE_BIT;\r\n      chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;\r\n      chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;\r\n      return newp;\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* -------------------------- mspace management -------------------------- */\r\n\r\n/* Initialize top chunk and its size */\r\nstatic void init_top(mstate m, mchunkptr p, size_t psize)\r\n{\r\n  /* Ensure alignment */\r\n  size_t offset = align_offset(chunk2mem(p));\r\n  p = (mchunkptr)((char *)p + offset);\r\n  psize -= offset;\r\n\r\n  m->top = p;\r\n  m->topsize = psize;\r\n  p->head = psize | PINUSE_BIT;\r\n  /* set size of fake trailing chunk holding overhead space only once */\r\n  chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;\r\n  m->trim_check = DEFAULT_TRIM_THRESHOLD; /* reset on each update */\r\n}\r\n\r\n/* Initialize bins for a new mstate that is otherwise zeroed out */\r\nstatic void init_bins(mstate m)\r\n{\r\n  /* Establish circular links for smallbins */\r\n  bindex_t i;\r\n  for (i = 0; i < NSMALLBINS; i++) {\r\n    sbinptr bin = smallbin_at(m,i);\r\n    bin->fd = bin->bk = bin;\r\n  }\r\n}\r\n\r\n/* Allocate chunk and prepend remainder with chunk in successor base. */\r\nstatic void *prepend_alloc(mstate m, char *newbase, char *oldbase, size_t nb)\r\n{\r\n  mchunkptr p = align_as_chunk(newbase);\r\n  mchunkptr oldfirst = align_as_chunk(oldbase);\r\n  size_t psize = (size_t)((char *)oldfirst - (char *)p);\r\n  mchunkptr q = chunk_plus_offset(p, nb);\r\n  size_t qsize = psize - nb;\r\n  set_size_and_pinuse_of_inuse_chunk(m, p, nb);\r\n\r\n  /* consolidate remainder with first chunk of old base */\r\n  if (oldfirst == m->top) {\r\n    size_t tsize = m->topsize += qsize;\r\n    m->top = q;\r\n    q->head = tsize | PINUSE_BIT;\r\n  } else if (oldfirst == m->dv) {\r\n    size_t dsize = m->dvsize += qsize;\r\n    m->dv = q;\r\n    set_size_and_pinuse_of_free_chunk(q, dsize);\r\n  } else {\r\n    if (!cinuse(oldfirst)) {\r\n      size_t nsize = chunksize(oldfirst);\r\n      unlink_chunk(m, oldfirst, nsize);\r\n      oldfirst = chunk_plus_offset(oldfirst, nsize);\r\n      qsize += nsize;\r\n    }\r\n    set_free_with_pinuse(q, qsize, oldfirst);\r\n    insert_chunk(m, q, qsize);\r\n  }\r\n\r\n  return chunk2mem(p);\r\n}\r\n\r\n/* Add a segment to hold a new noncontiguous region */\r\nstatic void add_segment(mstate m, char *tbase, size_t tsize)\r\n{\r\n  /* Determine locations and sizes of segment, fenceposts, old top */\r\n  char *old_top = (char *)m->top;\r\n  msegmentptr oldsp = segment_holding(m, old_top);\r\n  char *old_end = oldsp->base + oldsp->size;\r\n  size_t ssize = pad_request(sizeof(struct malloc_segment));\r\n  char *rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK);\r\n  size_t offset = align_offset(chunk2mem(rawsp));\r\n  char *asp = rawsp + offset;\r\n  char *csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp;\r\n  mchunkptr sp = (mchunkptr)csp;\r\n  msegmentptr ss = (msegmentptr)(chunk2mem(sp));\r\n  mchunkptr tnext = chunk_plus_offset(sp, ssize);\r\n  mchunkptr p = tnext;\r\n\r\n  /* reset top to new space */\r\n  init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE);\r\n\r\n  /* Set up segment record */\r\n  set_size_and_pinuse_of_inuse_chunk(m, sp, ssize);\r\n  *ss = m->seg; /* Push current record */\r\n  m->seg.base = tbase;\r\n  m->seg.size = tsize;\r\n  m->seg.next = ss;\r\n\r\n  /* Insert trailing fenceposts */\r\n  for (;;) {\r\n    mchunkptr nextp = chunk_plus_offset(p, SIZE_T_SIZE);\r\n    p->head = FENCEPOST_HEAD;\r\n    if ((char *)(&(nextp->head)) < old_end)\r\n      p = nextp;\r\n    else\r\n      break;\r\n  }\r\n\r\n  /* Insert the rest of old top into a bin as an ordinary free chunk */\r\n  if (csp != old_top) {\r\n    mchunkptr q = (mchunkptr)old_top;\r\n    size_t psize = (size_t)(csp - old_top);\r\n    mchunkptr tn = chunk_plus_offset(q, psize);\r\n    set_free_with_pinuse(q, psize, tn);\r\n    insert_chunk(m, q, psize);\r\n  }\r\n}\r\n\r\n/* -------------------------- System allocation -------------------------- */\r\n\r\nstatic void *alloc_sys(mstate m, size_t nb)\r\n{\r\n  char *tbase = CMFAIL;\r\n  size_t tsize = 0;\r\n\r\n  /* Directly map large chunks */\r\n  if (LJ_UNLIKELY(nb >= DEFAULT_MMAP_THRESHOLD)) {\r\n    void *mem = direct_alloc(nb);\r\n    if (mem != 0)\r\n      return mem;\r\n  }\r\n\r\n  {\r\n    size_t req = nb + TOP_FOOT_SIZE + SIZE_T_ONE;\r\n    size_t rsize = granularity_align(req);\r\n    if (LJ_LIKELY(rsize > nb)) { /* Fail if wraps around zero */\r\n      char *mp = (char *)(CALL_MMAP(rsize));\r\n      if (mp != CMFAIL) {\r\n\ttbase = mp;\r\n\ttsize = rsize;\r\n      }\r\n    }\r\n  }\r\n\r\n  if (tbase != CMFAIL) {\r\n    msegmentptr sp = &m->seg;\r\n    /* Try to merge with an existing segment */\r\n    while (sp != 0 && tbase != sp->base + sp->size)\r\n      sp = sp->next;\r\n    if (sp != 0 && segment_holds(sp, m->top)) { /* append */\r\n      sp->size += tsize;\r\n      init_top(m, m->top, m->topsize + tsize);\r\n    } else {\r\n      sp = &m->seg;\r\n      while (sp != 0 && sp->base != tbase + tsize)\r\n\tsp = sp->next;\r\n      if (sp != 0) {\r\n\tchar *oldbase = sp->base;\r\n\tsp->base = tbase;\r\n\tsp->size += tsize;\r\n\treturn prepend_alloc(m, tbase, oldbase, nb);\r\n      } else {\r\n\tadd_segment(m, tbase, tsize);\r\n      }\r\n    }\r\n\r\n    if (nb < m->topsize) { /* Allocate from new or extended top space */\r\n      size_t rsize = m->topsize -= nb;\r\n      mchunkptr p = m->top;\r\n      mchunkptr r = m->top = chunk_plus_offset(p, nb);\r\n      r->head = rsize | PINUSE_BIT;\r\n      set_size_and_pinuse_of_inuse_chunk(m, p, nb);\r\n      return chunk2mem(p);\r\n    }\r\n  }\r\n\r\n  return NULL;\r\n}\r\n\r\n/* -----------------------  system deallocation -------------------------- */\r\n\r\n/* Unmap and unlink any mmapped segments that don't contain used chunks */\r\nstatic size_t release_unused_segments(mstate m)\r\n{\r\n  size_t released = 0;\r\n  size_t nsegs = 0;\r\n  msegmentptr pred = &m->seg;\r\n  msegmentptr sp = pred->next;\r\n  while (sp != 0) {\r\n    char *base = sp->base;\r\n    size_t size = sp->size;\r\n    msegmentptr next = sp->next;\r\n    nsegs++;\r\n    {\r\n      mchunkptr p = align_as_chunk(base);\r\n      size_t psize = chunksize(p);\r\n      /* Can unmap if first chunk holds entire segment and not pinned */\r\n      if (!cinuse(p) && (char *)p + psize >= base + size - TOP_FOOT_SIZE) {\r\n\ttchunkptr tp = (tchunkptr)p;\r\n\tif (p == m->dv) {\r\n\t  m->dv = 0;\r\n\t  m->dvsize = 0;\r\n\t} else {\r\n\t  unlink_large_chunk(m, tp);\r\n\t}\r\n\tif (CALL_MUNMAP(base, size) == 0) {\r\n\t  released += size;\r\n\t  /* unlink obsoleted record */\r\n\t  sp = pred;\r\n\t  sp->next = next;\r\n\t} else { /* back out if cannot unmap */\r\n\t  insert_large_chunk(m, tp, psize);\r\n\t}\r\n      }\r\n    }\r\n    pred = sp;\r\n    sp = next;\r\n  }\r\n  /* Reset check counter */\r\n  m->release_checks = nsegs > MAX_RELEASE_CHECK_RATE ?\r\n\t\t      nsegs : MAX_RELEASE_CHECK_RATE;\r\n  return released;\r\n}\r\n\r\nstatic int alloc_trim(mstate m, size_t pad)\r\n{\r\n  size_t released = 0;\r\n  if (pad < MAX_REQUEST && is_initialized(m)) {\r\n    pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */\r\n\r\n    if (m->topsize > pad) {\r\n      /* Shrink top space in granularity-size units, keeping at least one */\r\n      size_t unit = DEFAULT_GRANULARITY;\r\n      size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit -\r\n\t\t      SIZE_T_ONE) * unit;\r\n      msegmentptr sp = segment_holding(m, (char *)m->top);\r\n\r\n      if (sp->size >= extra &&\r\n\t  !has_segment_link(m, sp)) { /* can't shrink if pinned */\r\n\tsize_t newsize = sp->size - extra;\r\n\t/* Prefer mremap, fall back to munmap */\r\n\tif ((CALL_MREMAP(sp->base, sp->size, newsize, CALL_MREMAP_NOMOVE) != MFAIL) ||\r\n\t    (CALL_MUNMAP(sp->base + newsize, extra) == 0)) {\r\n\t  released = extra;\r\n\t}\r\n      }\r\n\r\n      if (released != 0) {\r\n\tsp->size -= released;\r\n\tinit_top(m, m->top, m->topsize - released);\r\n      }\r\n    }\r\n\r\n    /* Unmap any unused mmapped segments */\r\n    released += release_unused_segments(m);\r\n\r\n    /* On failure, disable autotrim to avoid repeated failed future calls */\r\n    if (released == 0 && m->topsize > m->trim_check)\r\n      m->trim_check = MAX_SIZE_T;\r\n  }\r\n\r\n  return (released != 0)? 1 : 0;\r\n}\r\n\r\n/* ---------------------------- malloc support --------------------------- */\r\n\r\n/* allocate a large request from the best fitting chunk in a treebin */\r\nstatic void *tmalloc_large(mstate m, size_t nb)\r\n{\r\n  tchunkptr v = 0;\r\n  size_t rsize = ~nb+1; /* Unsigned negation */\r\n  tchunkptr t;\r\n  bindex_t idx;\r\n  compute_tree_index(nb, idx);\r\n\r\n  if ((t = *treebin_at(m, idx)) != 0) {\r\n    /* Traverse tree for this bin looking for node with size == nb */\r\n    size_t sizebits = nb << leftshift_for_tree_index(idx);\r\n    tchunkptr rst = 0;  /* The deepest untaken right subtree */\r\n    for (;;) {\r\n      tchunkptr rt;\r\n      size_t trem = chunksize(t) - nb;\r\n      if (trem < rsize) {\r\n\tv = t;\r\n\tif ((rsize = trem) == 0)\r\n\t  break;\r\n      }\r\n      rt = t->child[1];\r\n      t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];\r\n      if (rt != 0 && rt != t)\r\n\trst = rt;\r\n      if (t == 0) {\r\n\tt = rst; /* set t to least subtree holding sizes > nb */\r\n\tbreak;\r\n      }\r\n      sizebits <<= 1;\r\n    }\r\n  }\r\n\r\n  if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */\r\n    binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;\r\n    if (leftbits != 0)\r\n      t = *treebin_at(m, lj_ffs(leftbits));\r\n  }\r\n\r\n  while (t != 0) { /* find smallest of tree or subtree */\r\n    size_t trem = chunksize(t) - nb;\r\n    if (trem < rsize) {\r\n      rsize = trem;\r\n      v = t;\r\n    }\r\n    t = leftmost_child(t);\r\n  }\r\n\r\n  /*  If dv is a better fit, return NULL so malloc will use it */\r\n  if (v != 0 && rsize < (size_t)(m->dvsize - nb)) {\r\n    mchunkptr r = chunk_plus_offset(v, nb);\r\n    unlink_large_chunk(m, v);\r\n    if (rsize < MIN_CHUNK_SIZE) {\r\n      set_inuse_and_pinuse(m, v, (rsize + nb));\r\n    } else {\r\n      set_size_and_pinuse_of_inuse_chunk(m, v, nb);\r\n      set_size_and_pinuse_of_free_chunk(r, rsize);\r\n      insert_chunk(m, r, rsize);\r\n    }\r\n    return chunk2mem(v);\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* allocate a small request from the best fitting chunk in a treebin */\r\nstatic void *tmalloc_small(mstate m, size_t nb)\r\n{\r\n  tchunkptr t, v;\r\n  mchunkptr r;\r\n  size_t rsize;\r\n  bindex_t i = lj_ffs(m->treemap);\r\n\r\n  v = t = *treebin_at(m, i);\r\n  rsize = chunksize(t) - nb;\r\n\r\n  while ((t = leftmost_child(t)) != 0) {\r\n    size_t trem = chunksize(t) - nb;\r\n    if (trem < rsize) {\r\n      rsize = trem;\r\n      v = t;\r\n    }\r\n  }\r\n\r\n  r = chunk_plus_offset(v, nb);\r\n  unlink_large_chunk(m, v);\r\n  if (rsize < MIN_CHUNK_SIZE) {\r\n    set_inuse_and_pinuse(m, v, (rsize + nb));\r\n  } else {\r\n    set_size_and_pinuse_of_inuse_chunk(m, v, nb);\r\n    set_size_and_pinuse_of_free_chunk(r, rsize);\r\n    replace_dv(m, r, rsize);\r\n  }\r\n  return chunk2mem(v);\r\n}\r\n\r\n/* ----------------------------------------------------------------------- */\r\n\r\nvoid *lj_alloc_create(void)\r\n{\r\n  size_t tsize = DEFAULT_GRANULARITY;\r\n  char *tbase;\r\n  INIT_MMAP();\r\n  tbase = (char *)(CALL_MMAP(tsize));\r\n  if (tbase != CMFAIL) {\r\n    size_t msize = pad_request(sizeof(struct malloc_state));\r\n    mchunkptr mn;\r\n    mchunkptr msp = align_as_chunk(tbase);\r\n    mstate m = (mstate)(chunk2mem(msp));\r\n    memset(m, 0, msize);\r\n    msp->head = (msize|PINUSE_BIT|CINUSE_BIT);\r\n    m->seg.base = tbase;\r\n    m->seg.size = tsize;\r\n    m->release_checks = MAX_RELEASE_CHECK_RATE;\r\n    init_bins(m);\r\n    mn = next_chunk(mem2chunk(m));\r\n    init_top(m, mn, (size_t)((tbase + tsize) - (char *)mn) - TOP_FOOT_SIZE);\r\n    return m;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nvoid lj_alloc_destroy(void *msp)\r\n{\r\n  mstate ms = (mstate)msp;\r\n  msegmentptr sp = &ms->seg;\r\n  while (sp != 0) {\r\n    char *base = sp->base;\r\n    size_t size = sp->size;\r\n    sp = sp->next;\r\n    CALL_MUNMAP(base, size);\r\n  }\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_malloc(void *msp, size_t nsize)\r\n{\r\n  mstate ms = (mstate)msp;\r\n  void *mem;\r\n  size_t nb;\r\n  if (nsize <= MAX_SMALL_REQUEST) {\r\n    bindex_t idx;\r\n    binmap_t smallbits;\r\n    nb = (nsize < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(nsize);\r\n    idx = small_index(nb);\r\n    smallbits = ms->smallmap >> idx;\r\n\r\n    if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */\r\n      mchunkptr b, p;\r\n      idx += ~smallbits & 1;       /* Uses next bin if idx empty */\r\n      b = smallbin_at(ms, idx);\r\n      p = b->fd;\r\n      unlink_first_small_chunk(ms, b, p, idx);\r\n      set_inuse_and_pinuse(ms, p, small_index2size(idx));\r\n      mem = chunk2mem(p);\r\n      return mem;\r\n    } else if (nb > ms->dvsize) {\r\n      if (smallbits != 0) { /* Use chunk in next nonempty smallbin */\r\n\tmchunkptr b, p, r;\r\n\tsize_t rsize;\r\n\tbinmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));\r\n\tbindex_t i = lj_ffs(leftbits);\r\n\tb = smallbin_at(ms, i);\r\n\tp = b->fd;\r\n\tunlink_first_small_chunk(ms, b, p, i);\r\n\trsize = small_index2size(i) - nb;\r\n\t/* Fit here cannot be remainderless if 4byte sizes */\r\n\tif (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) {\r\n\t  set_inuse_and_pinuse(ms, p, small_index2size(i));\r\n\t} else {\r\n\t  set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n\t  r = chunk_plus_offset(p, nb);\r\n\t  set_size_and_pinuse_of_free_chunk(r, rsize);\r\n\t  replace_dv(ms, r, rsize);\r\n\t}\r\n\tmem = chunk2mem(p);\r\n\treturn mem;\r\n      } else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) {\r\n\treturn mem;\r\n      }\r\n    }\r\n  } else if (nsize >= MAX_REQUEST) {\r\n    nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */\r\n  } else {\r\n    nb = pad_request(nsize);\r\n    if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) {\r\n      return mem;\r\n    }\r\n  }\r\n\r\n  if (nb <= ms->dvsize) {\r\n    size_t rsize = ms->dvsize - nb;\r\n    mchunkptr p = ms->dv;\r\n    if (rsize >= MIN_CHUNK_SIZE) { /* split dv */\r\n      mchunkptr r = ms->dv = chunk_plus_offset(p, nb);\r\n      ms->dvsize = rsize;\r\n      set_size_and_pinuse_of_free_chunk(r, rsize);\r\n      set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n    } else { /* exhaust dv */\r\n      size_t dvs = ms->dvsize;\r\n      ms->dvsize = 0;\r\n      ms->dv = 0;\r\n      set_inuse_and_pinuse(ms, p, dvs);\r\n    }\r\n    mem = chunk2mem(p);\r\n    return mem;\r\n  } else if (nb < ms->topsize) { /* Split top */\r\n    size_t rsize = ms->topsize -= nb;\r\n    mchunkptr p = ms->top;\r\n    mchunkptr r = ms->top = chunk_plus_offset(p, nb);\r\n    r->head = rsize | PINUSE_BIT;\r\n    set_size_and_pinuse_of_inuse_chunk(ms, p, nb);\r\n    mem = chunk2mem(p);\r\n    return mem;\r\n  }\r\n  return alloc_sys(ms, nb);\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_free(void *msp, void *ptr)\r\n{\r\n  if (ptr != 0) {\r\n    mchunkptr p = mem2chunk(ptr);\r\n    mstate fm = (mstate)msp;\r\n    size_t psize = chunksize(p);\r\n    mchunkptr next = chunk_plus_offset(p, psize);\r\n    if (!pinuse(p)) {\r\n      size_t prevsize = p->prev_foot;\r\n      if ((prevsize & IS_DIRECT_BIT) != 0) {\r\n\tprevsize &= ~IS_DIRECT_BIT;\r\n\tpsize += prevsize + DIRECT_FOOT_PAD;\r\n\tCALL_MUNMAP((char *)p - prevsize, psize);\r\n\treturn NULL;\r\n      } else {\r\n\tmchunkptr prev = chunk_minus_offset(p, prevsize);\r\n\tpsize += prevsize;\r\n\tp = prev;\r\n\t/* consolidate backward */\r\n\tif (p != fm->dv) {\r\n\t  unlink_chunk(fm, p, prevsize);\r\n\t} else if ((next->head & INUSE_BITS) == INUSE_BITS) {\r\n\t  fm->dvsize = psize;\r\n\t  set_free_with_pinuse(p, psize, next);\r\n\t  return NULL;\r\n\t}\r\n      }\r\n    }\r\n    if (!cinuse(next)) {  /* consolidate forward */\r\n      if (next == fm->top) {\r\n\tsize_t tsize = fm->topsize += psize;\r\n\tfm->top = p;\r\n\tp->head = tsize | PINUSE_BIT;\r\n\tif (p == fm->dv) {\r\n\t  fm->dv = 0;\r\n\t  fm->dvsize = 0;\r\n\t}\r\n\tif (tsize > fm->trim_check)\r\n\t  alloc_trim(fm, 0);\r\n\treturn NULL;\r\n      } else if (next == fm->dv) {\r\n\tsize_t dsize = fm->dvsize += psize;\r\n\tfm->dv = p;\r\n\tset_size_and_pinuse_of_free_chunk(p, dsize);\r\n\treturn NULL;\r\n      } else {\r\n\tsize_t nsize = chunksize(next);\r\n\tpsize += nsize;\r\n\tunlink_chunk(fm, next, nsize);\r\n\tset_size_and_pinuse_of_free_chunk(p, psize);\r\n\tif (p == fm->dv) {\r\n\t  fm->dvsize = psize;\r\n\t  return NULL;\r\n\t}\r\n      }\r\n    } else {\r\n      set_free_with_pinuse(p, psize, next);\r\n    }\r\n\r\n    if (is_small(psize)) {\r\n      insert_small_chunk(fm, p, psize);\r\n    } else {\r\n      tchunkptr tp = (tchunkptr)p;\r\n      insert_large_chunk(fm, tp, psize);\r\n      if (--fm->release_checks == 0)\r\n\trelease_unused_segments(fm);\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\nstatic LJ_NOINLINE void *lj_alloc_realloc(void *msp, void *ptr, size_t nsize)\r\n{\r\n  if (nsize >= MAX_REQUEST) {\r\n    return NULL;\r\n  } else {\r\n    mstate m = (mstate)msp;\r\n    mchunkptr oldp = mem2chunk(ptr);\r\n    size_t oldsize = chunksize(oldp);\r\n    mchunkptr next = chunk_plus_offset(oldp, oldsize);\r\n    mchunkptr newp = 0;\r\n    size_t nb = request2size(nsize);\r\n\r\n    /* Try to either shrink or extend into top. Else malloc-copy-free */\r\n    if (is_direct(oldp)) {\r\n      newp = direct_resize(oldp, nb);  /* this may return NULL. */\r\n    } else if (oldsize >= nb) { /* already big enough */\r\n      size_t rsize = oldsize - nb;\r\n      newp = oldp;\r\n      if (rsize >= MIN_CHUNK_SIZE) {\r\n\tmchunkptr rem = chunk_plus_offset(newp, nb);\r\n\tset_inuse(m, newp, nb);\r\n\tset_inuse(m, rem, rsize);\r\n\tlj_alloc_free(m, chunk2mem(rem));\r\n      }\r\n    } else if (next == m->top && oldsize + m->topsize > nb) {\r\n      /* Expand into top */\r\n      size_t newsize = oldsize + m->topsize;\r\n      size_t newtopsize = newsize - nb;\r\n      mchunkptr newtop = chunk_plus_offset(oldp, nb);\r\n      set_inuse(m, oldp, nb);\r\n      newtop->head = newtopsize |PINUSE_BIT;\r\n      m->top = newtop;\r\n      m->topsize = newtopsize;\r\n      newp = oldp;\r\n    }\r\n\r\n    if (newp != 0) {\r\n      return chunk2mem(newp);\r\n    } else {\r\n      void *newmem = lj_alloc_malloc(m, nsize);\r\n      if (newmem != 0) {\r\n\tsize_t oc = oldsize - overhead_for(oldp);\r\n\tmemcpy(newmem, ptr, oc < nsize ? oc : nsize);\r\n\tlj_alloc_free(m, ptr);\r\n      }\r\n      return newmem;\r\n    }\r\n  }\r\n}\r\n\r\nvoid *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize)\r\n{\r\n  (void)osize;\r\n  if (nsize == 0) {\r\n    return lj_alloc_free(msp, ptr);\r\n  } else if (ptr == NULL) {\r\n    return lj_alloc_malloc(msp, nsize);\r\n  } else {\r\n    return lj_alloc_realloc(msp, ptr, nsize);\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_alloc.h",
    "content": "/*\r\n** Bundled memory allocator.\r\n** Donated to the public domain.\r\n*/\r\n\r\n#ifndef _LJ_ALLOC_H\r\n#define _LJ_ALLOC_H\r\n\r\n#include \"lj_def.h\"\r\n\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\nLJ_FUNC void *lj_alloc_create(void);\r\nLJ_FUNC void lj_alloc_destroy(void *msp);\r\nLJ_FUNC void *lj_alloc_f(void *msp, void *ptr, size_t osize, size_t nsize);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_api.c",
    "content": "/*\r\n** Public Lua/C API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_api_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* -- Common helper functions --------------------------------------------- */\r\n\r\n#define api_checknelems(L, n)\t\tapi_check(L, (n) <= (L->top - L->base))\r\n#define api_checkvalidindex(L, i)\tapi_check(L, (i) != niltv(L))\r\n\r\nstatic TValue *index2adr(lua_State *L, int idx)\r\n{\r\n  if (idx > 0) {\r\n    TValue *o = L->base + (idx - 1);\r\n    return o < L->top ? o : niltv(L);\r\n  } else if (idx > LUA_REGISTRYINDEX) {\r\n    api_check(L, idx != 0 && -idx <= L->top - L->base);\r\n    return L->top + idx;\r\n  } else if (idx == LUA_GLOBALSINDEX) {\r\n    TValue *o = &G(L)->tmptv;\r\n    settabV(L, o, tabref(L->env));\r\n    return o;\r\n  } else if (idx == LUA_REGISTRYINDEX) {\r\n    return registry(L);\r\n  } else {\r\n    GCfunc *fn = curr_func(L);\r\n    api_check(L, fn->c.gct == ~LJ_TFUNC && !isluafunc(fn));\r\n    if (idx == LUA_ENVIRONINDEX) {\r\n      TValue *o = &G(L)->tmptv;\r\n      settabV(L, o, tabref(fn->c.env));\r\n      return o;\r\n    } else {\r\n      idx = LUA_GLOBALSINDEX - idx;\r\n      return idx <= fn->c.nupvalues ? &fn->c.upvalue[idx-1] : niltv(L);\r\n    }\r\n  }\r\n}\r\n\r\nstatic TValue *stkindex2adr(lua_State *L, int idx)\r\n{\r\n  if (idx > 0) {\r\n    TValue *o = L->base + (idx - 1);\r\n    return o < L->top ? o : niltv(L);\r\n  } else {\r\n    api_check(L, idx != 0 && -idx <= L->top - L->base);\r\n    return L->top + idx;\r\n  }\r\n}\r\n\r\nstatic GCtab *getcurrenv(lua_State *L)\r\n{\r\n  GCfunc *fn = curr_func(L);\r\n  return fn->c.gct == ~LJ_TFUNC ? tabref(fn->c.env) : tabref(L->env);\r\n}\r\n\r\n/* -- Miscellaneous API functions ----------------------------------------- */\r\n\r\nLUA_API int lua_status(lua_State *L)\r\n{\r\n  return L->status;\r\n}\r\n\r\nLUA_API int lua_checkstack(lua_State *L, int size)\r\n{\r\n  if (size > LUAI_MAXCSTACK || (L->top - L->base + size) > LUAI_MAXCSTACK) {\r\n    return 0;  /* Stack overflow. */\r\n  } else if (size > 0) {\r\n    lj_state_checkstack(L, (MSize)size);\r\n  }\r\n  return 1;\r\n}\r\n\r\nLUALIB_API void luaL_checkstack(lua_State *L, int size, const char *msg)\r\n{\r\n  if (!lua_checkstack(L, size))\r\n    lj_err_callerv(L, LJ_ERR_STKOVM, msg);\r\n}\r\n\r\nLUA_API void lua_xmove(lua_State *from, lua_State *to, int n)\r\n{\r\n  TValue *f, *t;\r\n  if (from == to) return;\r\n  api_checknelems(from, n);\r\n  api_check(from, G(from) == G(to));\r\n  lj_state_checkstack(to, (MSize)n);\r\n  f = from->top;\r\n  t = to->top = to->top + n;\r\n  while (--n >= 0) copyTV(to, --t, --f);\r\n  from->top = f;\r\n}\r\n\r\n/* -- Stack manipulation -------------------------------------------------- */\r\n\r\nLUA_API int lua_gettop(lua_State *L)\r\n{\r\n  return (int)(L->top - L->base);\r\n}\r\n\r\nLUA_API void lua_settop(lua_State *L, int idx)\r\n{\r\n  if (idx >= 0) {\r\n    api_check(L, idx <= tvref(L->maxstack) - L->base);\r\n    if (L->base + idx > L->top) {\r\n      if (L->base + idx >= tvref(L->maxstack))\r\n\tlj_state_growstack(L, (MSize)idx - (MSize)(L->top - L->base));\r\n      do { setnilV(L->top++); } while (L->top < L->base + idx);\r\n    } else {\r\n      L->top = L->base + idx;\r\n    }\r\n  } else {\r\n    api_check(L, -(idx+1) <= (L->top - L->base));\r\n    L->top += idx+1;  /* Shrinks top (idx < 0). */\r\n  }\r\n}\r\n\r\nLUA_API void lua_remove(lua_State *L, int idx)\r\n{\r\n  TValue *p = stkindex2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  while (++p < L->top) copyTV(L, p-1, p);\r\n  L->top--;\r\n}\r\n\r\nLUA_API void lua_insert(lua_State *L, int idx)\r\n{\r\n  TValue *q, *p = stkindex2adr(L, idx);\r\n  api_checkvalidindex(L, p);\r\n  for (q = L->top; q > p; q--) copyTV(L, q, q-1);\r\n  copyTV(L, p, L->top);\r\n}\r\n\r\nLUA_API void lua_replace(lua_State *L, int idx)\r\n{\r\n  api_checknelems(L, 1);\r\n  if (idx == LUA_GLOBALSINDEX) {\r\n    api_check(L, tvistab(L->top-1));\r\n    /* NOBARRIER: A thread (i.e. L) is never black. */\r\n    setgcref(L->env, obj2gco(tabV(L->top-1)));\r\n  } else if (idx == LUA_ENVIRONINDEX) {\r\n    GCfunc *fn = curr_func(L);\r\n    if (fn->c.gct != ~LJ_TFUNC)\r\n      lj_err_msg(L, LJ_ERR_NOENV);\r\n    api_check(L, tvistab(L->top-1));\r\n    setgcref(fn->c.env, obj2gco(tabV(L->top-1)));\r\n    lj_gc_barrier(L, fn, L->top-1);\r\n  } else {\r\n    TValue *o = index2adr(L, idx);\r\n    api_checkvalidindex(L, o);\r\n    copyTV(L, o, L->top-1);\r\n    if (idx < LUA_GLOBALSINDEX)  /* Need a barrier for upvalues. */\r\n      lj_gc_barrier(L, curr_func(L), L->top-1);\r\n  }\r\n  L->top--;\r\n}\r\n\r\nLUA_API void lua_pushvalue(lua_State *L, int idx)\r\n{\r\n  copyTV(L, L->top, index2adr(L, idx));\r\n  incr_top(L);\r\n}\r\n\r\n/* -- Stack getters ------------------------------------------------------- */\r\n\r\nLUA_API int lua_type(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisnumber(o)) {\r\n    return LUA_TNUMBER;\r\n#if LJ_64 && !LJ_GC64\r\n  } else if (tvislightud(o)) {\r\n    return LUA_TLIGHTUSERDATA;\r\n#endif\r\n  } else if (o == niltv(L)) {\r\n    return LUA_TNONE;\r\n  } else {  /* Magic internal/external tag conversion. ORDER LJ_T */\r\n    uint32_t t = ~itype(o);\r\n#if LJ_64\r\n    int tt = (int)((U64x(75a06,98042110) >> 4*t) & 15u);\r\n#else\r\n    int tt = (int)(((t < 8 ? 0x98042110u : 0x75a06u) >> 4*(t&7)) & 15u);\r\n#endif\r\n    lua_assert(tt != LUA_TNIL || tvisnil(o));\r\n    return tt;\r\n  }\r\n}\r\n\r\nLUALIB_API void luaL_checktype(lua_State *L, int idx, int tt)\r\n{\r\n  if (lua_type(L, idx) != tt)\r\n    lj_err_argt(L, idx, tt);\r\n}\r\n\r\nLUALIB_API void luaL_checkany(lua_State *L, int idx)\r\n{\r\n  if (index2adr(L, idx) == niltv(L))\r\n    lj_err_arg(L, idx, LJ_ERR_NOVAL);\r\n}\r\n\r\nLUA_API const char *lua_typename(lua_State *L, int t)\r\n{\r\n  UNUSED(L);\r\n  return lj_obj_typename[t+1];\r\n}\r\n\r\nLUA_API int lua_iscfunction(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return tvisfunc(o) && !isluafunc(funcV(o));\r\n}\r\n\r\nLUA_API int lua_isnumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  return (tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), &tmp)));\r\n}\r\n\r\nLUA_API int lua_isstring(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (tvisstr(o) || tvisnumber(o));\r\n}\r\n\r\nLUA_API int lua_isuserdata(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (tvisudata(o) || tvislightud(o));\r\n}\r\n\r\nLUA_API int lua_rawequal(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  return (o1 == niltv(L) || o2 == niltv(L)) ? 0 : lj_obj_equal(o1, o2);\r\n}\r\n\r\nLUA_API int lua_equal(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  if (tvisint(o1) && tvisint(o2)) {\r\n    return intV(o1) == intV(o2);\r\n  } else if (tvisnumber(o1) && tvisnumber(o2)) {\r\n    return numberVnum(o1) == numberVnum(o2);\r\n  } else if (itype(o1) != itype(o2)) {\r\n    return 0;\r\n  } else if (tvispri(o1)) {\r\n    return o1 != niltv(L) && o2 != niltv(L);\r\n#if LJ_64 && !LJ_GC64\r\n  } else if (tvislightud(o1)) {\r\n    return o1->u64 == o2->u64;\r\n#endif\r\n  } else if (gcrefeq(o1->gcr, o2->gcr)) {\r\n    return 1;\r\n  } else if (!tvistabud(o1)) {\r\n    return 0;\r\n  } else {\r\n    TValue *base = lj_meta_equal(L, gcV(o1), gcV(o2), 0);\r\n    if ((uintptr_t)base <= 1) {\r\n      return (int)(uintptr_t)base;\r\n    } else {\r\n      L->top = base+2;\r\n      lj_vm_call(L, base, 1+1);\r\n      L->top -= 2+LJ_FR2;\r\n      return tvistruecond(L->top+1+LJ_FR2);\r\n    }\r\n  }\r\n}\r\n\r\nLUA_API int lua_lessthan(lua_State *L, int idx1, int idx2)\r\n{\r\n  cTValue *o1 = index2adr(L, idx1);\r\n  cTValue *o2 = index2adr(L, idx2);\r\n  if (o1 == niltv(L) || o2 == niltv(L)) {\r\n    return 0;\r\n  } else if (tvisint(o1) && tvisint(o2)) {\r\n    return intV(o1) < intV(o2);\r\n  } else if (tvisnumber(o1) && tvisnumber(o2)) {\r\n    return numberVnum(o1) < numberVnum(o2);\r\n  } else {\r\n    TValue *base = lj_meta_comp(L, o1, o2, 0);\r\n    if ((uintptr_t)base <= 1) {\r\n      return (int)(uintptr_t)base;\r\n    } else {\r\n      L->top = base+2;\r\n      lj_vm_call(L, base, 1+1);\r\n      L->top -= 2+LJ_FR2;\r\n      return tvistruecond(L->top+1+LJ_FR2);\r\n    }\r\n  }\r\n}\r\n\r\nLUA_API lua_Number lua_tonumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (tvisstr(o) && lj_strscan_num(strV(o), &tmp))\r\n    return numV(&tmp);\r\n  else\r\n    return 0;\r\n}\r\n\r\nLUALIB_API lua_Number luaL_checknumber(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (!(tvisstr(o) && lj_strscan_num(strV(o), &tmp)))\r\n    lj_err_argt(L, idx, LUA_TNUMBER);\r\n  return numV(&tmp);\r\n}\r\n\r\nLUALIB_API lua_Number luaL_optnumber(lua_State *L, int idx, lua_Number def)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  if (LJ_LIKELY(tvisnumber(o)))\r\n    return numberVnum(o);\r\n  else if (tvisnil(o))\r\n    return def;\r\n  else if (!(tvisstr(o) && lj_strscan_num(strV(o), &tmp)))\r\n    lj_err_argt(L, idx, LUA_TNUMBER);\r\n  return numV(&tmp);\r\n}\r\n\r\nLUA_API lua_Integer lua_tointeger(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      return 0;\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUALIB_API lua_Integer luaL_checkinteger(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      lj_err_argt(L, idx, LUA_TNUMBER);\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUALIB_API lua_Integer luaL_optinteger(lua_State *L, int idx, lua_Integer def)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  TValue tmp;\r\n  lua_Number n;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    n = numV(o);\r\n  } else if (tvisnil(o)) {\r\n    return def;\r\n  } else {\r\n    if (!(tvisstr(o) && lj_strscan_number(strV(o), &tmp)))\r\n      lj_err_argt(L, idx, LUA_TNUMBER);\r\n    if (tvisint(&tmp))\r\n      return (lua_Integer)intV(&tmp);\r\n    n = numV(&tmp);\r\n  }\r\n#if LJ_64\r\n  return (lua_Integer)n;\r\n#else\r\n  return lj_num2int(n);\r\n#endif\r\n}\r\n\r\nLUA_API int lua_toboolean(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return tvistruecond(o);\r\n}\r\n\r\nLUA_API const char *lua_tolstring(lua_State *L, int idx, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_strfmt_number(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    if (len != NULL) *len = 0;\r\n    return NULL;\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API const char *luaL_checklstring(lua_State *L, int idx, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_strfmt_number(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API const char *luaL_optlstring(lua_State *L, int idx,\r\n\t\t\t\t       const char *def, size_t *len)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  GCstr *s;\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    s = strV(o);\r\n  } else if (tvisnil(o)) {\r\n    if (len != NULL) *len = def ? strlen(def) : 0;\r\n    return def;\r\n  } else if (tvisnumber(o)) {\r\n    lj_gc_check(L);\r\n    o = index2adr(L, idx);  /* GC may move the stack. */\r\n    s = lj_strfmt_number(L, o);\r\n    setstrV(L, o, s);\r\n  } else {\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  }\r\n  if (len != NULL) *len = s->len;\r\n  return strdata(s);\r\n}\r\n\r\nLUALIB_API int luaL_checkoption(lua_State *L, int idx, const char *def,\r\n\t\t\t\tconst char *const lst[])\r\n{\r\n  ptrdiff_t i;\r\n  const char *s = lua_tolstring(L, idx, NULL);\r\n  if (s == NULL && (s = def) == NULL)\r\n    lj_err_argt(L, idx, LUA_TSTRING);\r\n  for (i = 0; lst[i]; i++)\r\n    if (strcmp(lst[i], s) == 0)\r\n      return (int)i;\r\n  lj_err_argv(L, idx, LJ_ERR_INVOPTM, s);\r\n}\r\n\r\nLUA_API size_t lua_objlen(lua_State *L, int idx)\r\n{\r\n  TValue *o = index2adr(L, idx);\r\n  if (tvisstr(o)) {\r\n    return strV(o)->len;\r\n  } else if (tvistab(o)) {\r\n    return (size_t)lj_tab_len(tabV(o));\r\n  } else if (tvisudata(o)) {\r\n    return udataV(o)->len;\r\n  } else if (tvisnumber(o)) {\r\n    GCstr *s = lj_strfmt_number(L, o);\r\n    setstrV(L, o, s);\r\n    return s->len;\r\n  } else {\r\n    return 0;\r\n  }\r\n}\r\n\r\nLUA_API lua_CFunction lua_tocfunction(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisfunc(o)) {\r\n    BCOp op = bc_op(*mref(funcV(o)->c.pc, BCIns));\r\n    if (op == BC_FUNCC || op == BC_FUNCCW)\r\n      return funcV(o)->c.f;\r\n  }\r\n  return NULL;\r\n}\r\n\r\nLUA_API void *lua_touserdata(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisudata(o))\r\n    return uddata(udataV(o));\r\n  else if (tvislightud(o))\r\n    return lightudV(o);\r\n  else\r\n    return NULL;\r\n}\r\n\r\nLUA_API lua_State *lua_tothread(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  return (!tvisthread(o)) ? NULL : threadV(o);\r\n}\r\n\r\nLUA_API const void *lua_topointer(lua_State *L, int idx)\r\n{\r\n  return lj_obj_ptr(index2adr(L, idx));\r\n}\r\n\r\n/* -- Stack setters (object creation) ------------------------------------- */\r\n\r\nLUA_API void lua_pushnil(lua_State *L)\r\n{\r\n  setnilV(L->top);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushnumber(lua_State *L, lua_Number n)\r\n{\r\n  setnumV(L->top, n);\r\n  if (LJ_UNLIKELY(tvisnan(L->top)))\r\n    setnanV(L->top);  /* Canonicalize injected NaNs. */\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushinteger(lua_State *L, lua_Integer n)\r\n{\r\n  setintptrV(L->top, n);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushlstring(lua_State *L, const char *str, size_t len)\r\n{\r\n  GCstr *s;\r\n  lj_gc_check(L);\r\n  s = lj_str_new(L, str, len);\r\n  setstrV(L, L->top, s);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushstring(lua_State *L, const char *str)\r\n{\r\n  if (str == NULL) {\r\n    setnilV(L->top);\r\n  } else {\r\n    GCstr *s;\r\n    lj_gc_check(L);\r\n    s = lj_str_newz(L, str);\r\n    setstrV(L, L->top, s);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API const char *lua_pushvfstring(lua_State *L, const char *fmt,\r\n\t\t\t\t     va_list argp)\r\n{\r\n  lj_gc_check(L);\r\n  return lj_strfmt_pushvf(L, fmt, argp);\r\n}\r\n\r\nLUA_API const char *lua_pushfstring(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *ret;\r\n  va_list argp;\r\n  lj_gc_check(L);\r\n  va_start(argp, fmt);\r\n  ret = lj_strfmt_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  return ret;\r\n}\r\n\r\nLUA_API void lua_pushcclosure(lua_State *L, lua_CFunction f, int n)\r\n{\r\n  GCfunc *fn;\r\n  lj_gc_check(L);\r\n  api_checknelems(L, n);\r\n  fn = lj_func_newC(L, (MSize)n, getcurrenv(L));\r\n  fn->c.f = f;\r\n  L->top -= n;\r\n  while (n--)\r\n    copyTV(L, &fn->c.upvalue[n], L->top+n);\r\n  setfuncV(L, L->top, fn);\r\n  lua_assert(iswhite(obj2gco(fn)));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushboolean(lua_State *L, int b)\r\n{\r\n  setboolV(L->top, (b != 0));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_pushlightuserdata(lua_State *L, void *p)\r\n{\r\n  setlightudV(L->top, checklightudptr(L, p));\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_createtable(lua_State *L, int narray, int nrec)\r\n{\r\n  lj_gc_check(L);\r\n  settabV(L, L->top, lj_tab_new_ah(L, narray, nrec));\r\n  incr_top(L);\r\n}\r\n\r\nLUALIB_API int luaL_newmetatable(lua_State *L, const char *tname)\r\n{\r\n  GCtab *regt = tabV(registry(L));\r\n  TValue *tv = lj_tab_setstr(L, regt, lj_str_newz(L, tname));\r\n  if (tvisnil(tv)) {\r\n    GCtab *mt = lj_tab_new(L, 0, 1);\r\n    settabV(L, tv, mt);\r\n    settabV(L, L->top++, mt);\r\n    lj_gc_anybarriert(L, regt);\r\n    return 1;\r\n  } else {\r\n    copyTV(L, L->top++, tv);\r\n    return 0;\r\n  }\r\n}\r\n\r\nLUA_API int lua_pushthread(lua_State *L)\r\n{\r\n  setthreadV(L, L->top, L);\r\n  incr_top(L);\r\n  return (mainthread(G(L)) == L);\r\n}\r\n\r\nLUA_API lua_State *lua_newthread(lua_State *L)\r\n{\r\n  lua_State *L1;\r\n  lj_gc_check(L);\r\n  L1 = lj_state_new(L);\r\n  setthreadV(L, L->top, L1);\r\n  incr_top(L);\r\n  return L1;\r\n}\r\n\r\nLUA_API void *lua_newuserdata(lua_State *L, size_t size)\r\n{\r\n  GCudata *ud;\r\n  lj_gc_check(L);\r\n  if (size > LJ_MAX_UDATA)\r\n    lj_err_msg(L, LJ_ERR_UDATAOV);\r\n  ud = lj_udata_new(L, (MSize)size, getcurrenv(L));\r\n  setudataV(L, L->top, ud);\r\n  incr_top(L);\r\n  return uddata(ud);\r\n}\r\n\r\nLUA_API void lua_concat(lua_State *L, int n)\r\n{\r\n  api_checknelems(L, n);\r\n  if (n >= 2) {\r\n    n--;\r\n    do {\r\n      TValue *top = lj_meta_cat(L, L->top-1, -n);\r\n      if (top == NULL) {\r\n\tL->top -= n;\r\n\tbreak;\r\n      }\r\n      n -= (int)(L->top - top);\r\n      L->top = top+2;\r\n      lj_vm_call(L, top, 1+1);\r\n      L->top -= 1+LJ_FR2;\r\n      copyTV(L, L->top-1, L->top+LJ_FR2);\r\n    } while (--n > 0);\r\n  } else if (n == 0) {  /* Push empty string. */\r\n    setstrV(L, L->top, &G(L)->strempty);\r\n    incr_top(L);\r\n  }\r\n  /* else n == 1: nothing to do. */\r\n}\r\n\r\n/* -- Object getters ------------------------------------------------------ */\r\n\r\nLUA_API void lua_gettable(lua_State *L, int idx)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  api_checkvalidindex(L, t);\r\n  v = lj_meta_tget(L, t, L->top-1);\r\n  if (v == NULL) {\r\n    L->top += 2;\r\n    lj_vm_call(L, L->top-2, 1+1);\r\n    L->top -= 2+LJ_FR2;\r\n    v = L->top+1+LJ_FR2;\r\n  }\r\n  copyTV(L, L->top-1, v);\r\n}\r\n\r\nLUA_API void lua_getfield(lua_State *L, int idx, const char *k)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  TValue key;\r\n  api_checkvalidindex(L, t);\r\n  setstrV(L, &key, lj_str_newz(L, k));\r\n  v = lj_meta_tget(L, t, &key);\r\n  if (v == NULL) {\r\n    L->top += 2;\r\n    lj_vm_call(L, L->top-2, 1+1);\r\n    L->top -= 2+LJ_FR2;\r\n    v = L->top+1+LJ_FR2;\r\n  }\r\n  copyTV(L, L->top, v);\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API void lua_rawget(lua_State *L, int idx)\r\n{\r\n  cTValue *t = index2adr(L, idx);\r\n  api_check(L, tvistab(t));\r\n  copyTV(L, L->top-1, lj_tab_get(L, tabV(t), L->top-1));\r\n}\r\n\r\nLUA_API void lua_rawgeti(lua_State *L, int idx, int n)\r\n{\r\n  cTValue *v, *t = index2adr(L, idx);\r\n  api_check(L, tvistab(t));\r\n  v = lj_tab_getint(tabV(t), n);\r\n  if (v) {\r\n    copyTV(L, L->top, v);\r\n  } else {\r\n    setnilV(L->top);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API int lua_getmetatable(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  GCtab *mt = NULL;\r\n  if (tvistab(o))\r\n    mt = tabref(tabV(o)->metatable);\r\n  else if (tvisudata(o))\r\n    mt = tabref(udataV(o)->metatable);\r\n  else\r\n    mt = tabref(basemt_obj(G(L), o));\r\n  if (mt == NULL)\r\n    return 0;\r\n  settabV(L, L->top, mt);\r\n  incr_top(L);\r\n  return 1;\r\n}\r\n\r\nLUALIB_API int luaL_getmetafield(lua_State *L, int idx, const char *field)\r\n{\r\n  if (lua_getmetatable(L, idx)) {\r\n    cTValue *tv = lj_tab_getstr(tabV(L->top-1), lj_str_newz(L, field));\r\n    if (tv && !tvisnil(tv)) {\r\n      copyTV(L, L->top-1, tv);\r\n      return 1;\r\n    }\r\n    L->top--;\r\n  }\r\n  return 0;\r\n}\r\n\r\nLUA_API void lua_getfenv(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  api_checkvalidindex(L, o);\r\n  if (tvisfunc(o)) {\r\n    settabV(L, L->top, tabref(funcV(o)->c.env));\r\n  } else if (tvisudata(o)) {\r\n    settabV(L, L->top, tabref(udataV(o)->env));\r\n  } else if (tvisthread(o)) {\r\n    settabV(L, L->top, tabref(threadV(o)->env));\r\n  } else {\r\n    setnilV(L->top);\r\n  }\r\n  incr_top(L);\r\n}\r\n\r\nLUA_API int lua_next(lua_State *L, int idx)\r\n{\r\n  cTValue *t = index2adr(L, idx);\r\n  int more;\r\n  api_check(L, tvistab(t));\r\n  more = lj_tab_next(L, tabV(t), L->top-1);\r\n  if (more) {\r\n    incr_top(L);  /* Return new key and value slot. */\r\n  } else {  /* End of traversal. */\r\n    L->top--;  /* Remove key slot. */\r\n  }\r\n  return more;\r\n}\r\n\r\nLUA_API const char *lua_getupvalue(lua_State *L, int idx, int n)\r\n{\r\n  TValue *val;\r\n  const char *name = lj_debug_uvnamev(index2adr(L, idx), (uint32_t)(n-1), &val);\r\n  if (name) {\r\n    copyTV(L, L->top, val);\r\n    incr_top(L);\r\n  }\r\n  return name;\r\n}\r\n\r\nLUA_API void *lua_upvalueid(lua_State *L, int idx, int n)\r\n{\r\n  GCfunc *fn = funcV(index2adr(L, idx));\r\n  n--;\r\n  api_check(L, (uint32_t)n < fn->l.nupvalues);\r\n  return isluafunc(fn) ? (void *)gcref(fn->l.uvptr[n]) :\r\n\t\t\t (void *)&fn->c.upvalue[n];\r\n}\r\n\r\nLUA_API void lua_upvaluejoin(lua_State *L, int idx1, int n1, int idx2, int n2)\r\n{\r\n  GCfunc *fn1 = funcV(index2adr(L, idx1));\r\n  GCfunc *fn2 = funcV(index2adr(L, idx2));\r\n  n1--; n2--;\r\n  api_check(L, isluafunc(fn1) && (uint32_t)n1 < fn1->l.nupvalues);\r\n  api_check(L, isluafunc(fn2) && (uint32_t)n2 < fn2->l.nupvalues);\r\n  setgcrefr(fn1->l.uvptr[n1], fn2->l.uvptr[n2]);\r\n  lj_gc_objbarrier(L, fn1, gcref(fn1->l.uvptr[n1]));\r\n}\r\n\r\nLUALIB_API void *luaL_checkudata(lua_State *L, int idx, const char *tname)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  if (tvisudata(o)) {\r\n    GCudata *ud = udataV(o);\r\n    cTValue *tv = lj_tab_getstr(tabV(registry(L)), lj_str_newz(L, tname));\r\n    if (tv && tvistab(tv) && tabV(tv) == tabref(ud->metatable))\r\n      return uddata(ud);\r\n  }\r\n  lj_err_argtype(L, idx, tname);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\n/* -- Object setters ------------------------------------------------------ */\r\n\r\nLUA_API void lua_settable(lua_State *L, int idx)\r\n{\r\n  TValue *o;\r\n  cTValue *t = index2adr(L, idx);\r\n  api_checknelems(L, 2);\r\n  api_checkvalidindex(L, t);\r\n  o = lj_meta_tset(L, t, L->top-2);\r\n  if (o) {\r\n    /* NOBARRIER: lj_meta_tset ensures the table is not black. */\r\n    L->top -= 2;\r\n    copyTV(L, o, L->top+1);\r\n  } else {\r\n    TValue *base = L->top;\r\n    copyTV(L, base+2, base-3-2*LJ_FR2);\r\n    L->top = base+3;\r\n    lj_vm_call(L, base, 0+1);\r\n    L->top -= 3+LJ_FR2;\r\n  }\r\n}\r\n\r\nLUA_API void lua_setfield(lua_State *L, int idx, const char *k)\r\n{\r\n  TValue *o;\r\n  TValue key;\r\n  cTValue *t = index2adr(L, idx);\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, t);\r\n  setstrV(L, &key, lj_str_newz(L, k));\r\n  o = lj_meta_tset(L, t, &key);\r\n  if (o) {\r\n    /* NOBARRIER: lj_meta_tset ensures the table is not black. */\r\n    copyTV(L, o, --L->top);\r\n  } else {\r\n    TValue *base = L->top;\r\n    copyTV(L, base+2, base-3-2*LJ_FR2);\r\n    L->top = base+3;\r\n    lj_vm_call(L, base, 0+1);\r\n    L->top -= 2+LJ_FR2;\r\n  }\r\n}\r\n\r\nLUA_API void lua_rawset(lua_State *L, int idx)\r\n{\r\n  GCtab *t = tabV(index2adr(L, idx));\r\n  TValue *dst, *key;\r\n  api_checknelems(L, 2);\r\n  key = L->top-2;\r\n  dst = lj_tab_set(L, t, key);\r\n  copyTV(L, dst, key+1);\r\n  lj_gc_anybarriert(L, t);\r\n  L->top = key;\r\n}\r\n\r\nLUA_API void lua_rawseti(lua_State *L, int idx, int n)\r\n{\r\n  GCtab *t = tabV(index2adr(L, idx));\r\n  TValue *dst, *src;\r\n  api_checknelems(L, 1);\r\n  dst = lj_tab_setint(L, t, n);\r\n  src = L->top-1;\r\n  copyTV(L, dst, src);\r\n  lj_gc_barriert(L, t, dst);\r\n  L->top = src;\r\n}\r\n\r\nLUA_API int lua_setmetatable(lua_State *L, int idx)\r\n{\r\n  global_State *g;\r\n  GCtab *mt;\r\n  cTValue *o = index2adr(L, idx);\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, o);\r\n  if (tvisnil(L->top-1)) {\r\n    mt = NULL;\r\n  } else {\r\n    api_check(L, tvistab(L->top-1));\r\n    mt = tabV(L->top-1);\r\n  }\r\n  g = G(L);\r\n  if (tvistab(o)) {\r\n    setgcref(tabV(o)->metatable, obj2gco(mt));\r\n    if (mt)\r\n      lj_gc_objbarriert(L, tabV(o), mt);\r\n  } else if (tvisudata(o)) {\r\n    setgcref(udataV(o)->metatable, obj2gco(mt));\r\n    if (mt)\r\n      lj_gc_objbarrier(L, udataV(o), mt);\r\n  } else {\r\n    /* Flush cache, since traces specialize to basemt. But not during __gc. */\r\n    if (lj_trace_flushall(L))\r\n      lj_err_caller(L, LJ_ERR_NOGCMM);\r\n    if (tvisbool(o)) {\r\n      /* NOBARRIER: basemt is a GC root. */\r\n      setgcref(basemt_it(g, LJ_TTRUE), obj2gco(mt));\r\n      setgcref(basemt_it(g, LJ_TFALSE), obj2gco(mt));\r\n    } else {\r\n      /* NOBARRIER: basemt is a GC root. */\r\n      setgcref(basemt_obj(g, o), obj2gco(mt));\r\n    }\r\n  }\r\n  L->top--;\r\n  return 1;\r\n}\r\n\r\nLUA_API int lua_setfenv(lua_State *L, int idx)\r\n{\r\n  cTValue *o = index2adr(L, idx);\r\n  GCtab *t;\r\n  api_checknelems(L, 1);\r\n  api_checkvalidindex(L, o);\r\n  api_check(L, tvistab(L->top-1));\r\n  t = tabV(L->top-1);\r\n  if (tvisfunc(o)) {\r\n    setgcref(funcV(o)->c.env, obj2gco(t));\r\n  } else if (tvisudata(o)) {\r\n    setgcref(udataV(o)->env, obj2gco(t));\r\n  } else if (tvisthread(o)) {\r\n    setgcref(threadV(o)->env, obj2gco(t));\r\n  } else {\r\n    L->top--;\r\n    return 0;\r\n  }\r\n  lj_gc_objbarrier(L, gcV(o), t);\r\n  L->top--;\r\n  return 1;\r\n}\r\n\r\nLUA_API const char *lua_setupvalue(lua_State *L, int idx, int n)\r\n{\r\n  cTValue *f = index2adr(L, idx);\r\n  TValue *val;\r\n  const char *name;\r\n  api_checknelems(L, 1);\r\n  name = lj_debug_uvnamev(f, (uint32_t)(n-1), &val);\r\n  if (name) {\r\n    L->top--;\r\n    copyTV(L, val, L->top);\r\n    lj_gc_barrier(L, funcV(f), L->top);\r\n  }\r\n  return name;\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n#if LJ_FR2\r\nstatic TValue *api_call_base(lua_State *L, int nargs)\r\n{\r\n  TValue *o = L->top, *base = o - nargs;\r\n  L->top = o+1;\r\n  for (; o > base; o--) copyTV(L, o, o-1);\r\n  setnilV(o);\r\n  return o+1;\r\n}\r\n#else\r\n#define api_call_base(L, nargs)\t(L->top - (nargs))\r\n#endif\r\n\r\nLUA_API void lua_call(lua_State *L, int nargs, int nresults)\r\n{\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  api_checknelems(L, nargs+1);\r\n  lj_vm_call(L, api_call_base(L, nargs), nresults+1);\r\n}\r\n\r\nLUA_API int lua_pcall(lua_State *L, int nargs, int nresults, int errfunc)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldh = hook_save(g);\r\n  ptrdiff_t ef;\r\n  int status;\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  api_checknelems(L, nargs+1);\r\n  if (errfunc == 0) {\r\n    ef = 0;\r\n  } else {\r\n    cTValue *o = stkindex2adr(L, errfunc);\r\n    api_checkvalidindex(L, o);\r\n    ef = savestack(L, o);\r\n  }\r\n  status = lj_vm_pcall(L, api_call_base(L, nargs), nresults+1, ef);\r\n  if (status) hook_restore(g, oldh);\r\n  return status;\r\n}\r\n\r\nstatic TValue *cpcall(lua_State *L, lua_CFunction func, void *ud)\r\n{\r\n  GCfunc *fn = lj_func_newC(L, 0, getcurrenv(L));\r\n  TValue *top = L->top;\r\n  fn->c.f = func;\r\n  setfuncV(L, top++, fn);\r\n  if (LJ_FR2) setnilV(top++);\r\n  setlightudV(top++, checklightudptr(L, ud));\r\n  cframe_nres(L->cframe) = 1+0;  /* Zero results. */\r\n  L->top = top;\r\n  return top-1;  /* Now call the newly allocated C function. */\r\n}\r\n\r\nLUA_API int lua_cpcall(lua_State *L, lua_CFunction func, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldh = hook_save(g);\r\n  int status;\r\n  api_check(L, L->status == 0 || L->status == LUA_ERRERR);\r\n  status = lj_vm_cpcall(L, func, ud, cpcall);\r\n  if (status) hook_restore(g, oldh);\r\n  return status;\r\n}\r\n\r\nLUALIB_API int luaL_callmeta(lua_State *L, int idx, const char *field)\r\n{\r\n  if (luaL_getmetafield(L, idx, field)) {\r\n    TValue *top = L->top--;\r\n    if (LJ_FR2) setnilV(top++);\r\n    copyTV(L, top++, index2adr(L, idx));\r\n    L->top = top;\r\n    lj_vm_call(L, top-1, 1+1);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Coroutine yield and resume ------------------------------------------ */\r\n\r\nLUA_API int lua_yield(lua_State *L, int nresults)\r\n{\r\n  void *cf = L->cframe;\r\n  global_State *g = G(L);\r\n  if (cframe_canyield(cf)) {\r\n    cf = cframe_raw(cf);\r\n    if (!hook_active(g)) {  /* Regular yield: move results down if needed. */\r\n      cTValue *f = L->top - nresults;\r\n      if (f > L->base) {\r\n\tTValue *t = L->base;\r\n\twhile (--nresults >= 0) copyTV(L, t++, f++);\r\n\tL->top = t;\r\n      }\r\n      L->cframe = NULL;\r\n      L->status = LUA_YIELD;\r\n      return -1;\r\n    } else {  /* Yield from hook: add a pseudo-frame. */\r\n      TValue *top = L->top;\r\n      hook_leave(g);\r\n      (top++)->u64 = cframe_multres(cf);\r\n      setcont(top, lj_cont_hook);\r\n      if (LJ_FR2) top++;\r\n      setframe_pc(top, cframe_pc(cf)-1);\r\n      if (LJ_FR2) top++;\r\n      setframe_gc(top, obj2gco(L), LJ_TTHREAD);\r\n      setframe_ftsz(top, ((char *)(top+1)-(char *)L->base)+FRAME_CONT);\r\n      L->top = L->base = top+1;\r\n#if LJ_TARGET_X64\r\n      lj_err_throw(L, LUA_YIELD);\r\n#else\r\n      L->cframe = NULL;\r\n      L->status = LUA_YIELD;\r\n      lj_vm_unwind_c(cf, LUA_YIELD);\r\n#endif\r\n    }\r\n  }\r\n  lj_err_msg(L, LJ_ERR_CYIELD);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUA_API int lua_resume(lua_State *L, int nargs)\r\n{\r\n  if (L->cframe == NULL && L->status <= LUA_YIELD)\r\n    return lj_vm_resume(L,\r\n      L->status == 0 ? api_call_base(L, nargs) : L->top - nargs,\r\n      0, 0);\r\n  L->top = L->base;\r\n  setstrV(L, L->top, lj_err_str(L, LJ_ERR_COSUSP));\r\n  incr_top(L);\r\n  return LUA_ERRRUN;\r\n}\r\n\r\n/* -- GC and memory management -------------------------------------------- */\r\n\r\nLUA_API int lua_gc(lua_State *L, int what, int data)\r\n{\r\n  global_State *g = G(L);\r\n  int res = 0;\r\n  switch (what) {\r\n  case LUA_GCSTOP:\r\n    g->gc.threshold = LJ_MAX_MEM;\r\n    break;\r\n  case LUA_GCRESTART:\r\n    g->gc.threshold = data == -1 ? (g->gc.total/100)*g->gc.pause : g->gc.total;\r\n    break;\r\n  case LUA_GCCOLLECT:\r\n    lj_gc_fullgc(L);\r\n    break;\r\n  case LUA_GCCOUNT:\r\n    res = (int)(g->gc.total >> 10);\r\n    break;\r\n  case LUA_GCCOUNTB:\r\n    res = (int)(g->gc.total & 0x3ff);\r\n    break;\r\n  case LUA_GCSTEP: {\r\n    GCSize a = (GCSize)data << 10;\r\n    g->gc.threshold = (a <= g->gc.total) ? (g->gc.total - a) : 0;\r\n    while (g->gc.total >= g->gc.threshold)\r\n      if (lj_gc_step(L) > 0) {\r\n\tres = 1;\r\n\tbreak;\r\n      }\r\n    break;\r\n  }\r\n  case LUA_GCSETPAUSE:\r\n    res = (int)(g->gc.pause);\r\n    g->gc.pause = (MSize)data;\r\n    break;\r\n  case LUA_GCSETSTEPMUL:\r\n    res = (int)(g->gc.stepmul);\r\n    g->gc.stepmul = (MSize)data;\r\n    break;\r\n  default:\r\n    res = -1;  /* Invalid option. */\r\n  }\r\n  return res;\r\n}\r\n\r\nLUA_API lua_Alloc lua_getallocf(lua_State *L, void **ud)\r\n{\r\n  global_State *g = G(L);\r\n  if (ud) *ud = g->allocd;\r\n  return g->allocf;\r\n}\r\n\r\nLUA_API void lua_setallocf(lua_State *L, lua_Alloc f, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  g->allocd = ud;\r\n  g->allocf = f;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_arch.h",
    "content": "/*\r\n** Target architecture selection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ARCH_H\r\n#define _LJ_ARCH_H\r\n\r\n#include \"lua.h\"\r\n\r\n/* Target endianess. */\r\n#define LUAJIT_LE\t0\r\n#define LUAJIT_BE\t1\r\n\r\n/* Target architectures. */\r\n#define LUAJIT_ARCH_X86\t\t1\r\n#define LUAJIT_ARCH_x86\t\t1\r\n#define LUAJIT_ARCH_X64\t\t2\r\n#define LUAJIT_ARCH_x64\t\t2\r\n#define LUAJIT_ARCH_ARM\t\t3\r\n#define LUAJIT_ARCH_arm\t\t3\r\n#define LUAJIT_ARCH_ARM64\t4\r\n#define LUAJIT_ARCH_arm64\t4\r\n#define LUAJIT_ARCH_PPC\t\t5\r\n#define LUAJIT_ARCH_ppc\t\t5\r\n#define LUAJIT_ARCH_MIPS\t6\r\n#define LUAJIT_ARCH_mips\t6\r\n\r\n/* Target OS. */\r\n#define LUAJIT_OS_OTHER\t\t0\r\n#define LUAJIT_OS_WINDOWS\t1\r\n#define LUAJIT_OS_LINUX\t\t2\r\n#define LUAJIT_OS_OSX\t\t3\r\n#define LUAJIT_OS_BSD\t\t4\r\n#define LUAJIT_OS_POSIX\t\t5\r\n\r\n/* Select native target if no target defined. */\r\n#ifndef LUAJIT_TARGET\r\n\r\n#if defined(__i386) || defined(__i386__) || defined(_M_IX86)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_X86\r\n#elif defined(__x86_64__) || defined(__x86_64) || defined(_M_X64) || defined(_M_AMD64)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_X64\r\n#elif defined(__arm__) || defined(__arm) || defined(__ARM__) || defined(__ARM)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_ARM\r\n#elif defined(__aarch64__)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_ARM64\r\n#elif defined(__ppc__) || defined(__ppc) || defined(__PPC__) || defined(__PPC) || defined(__powerpc__) || defined(__powerpc) || defined(__POWERPC__) || defined(__POWERPC) || defined(_M_PPC)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_PPC\r\n#elif defined(__mips__) || defined(__mips) || defined(__MIPS__) || defined(__MIPS)\r\n#define LUAJIT_TARGET\tLUAJIT_ARCH_MIPS\r\n#else\r\n#error \"No support for this architecture (yet)\"\r\n#endif\r\n\r\n#endif\r\n\r\n/* Select native OS if no target OS defined. */\r\n#ifndef LUAJIT_OS\r\n\r\n#if defined(_WIN32) && !defined(_XBOX_VER)\r\n#define LUAJIT_OS\tLUAJIT_OS_WINDOWS\r\n#elif defined(__linux__)\r\n#define LUAJIT_OS\tLUAJIT_OS_LINUX\r\n#elif defined(__MACH__) && defined(__APPLE__)\r\n#define LUAJIT_OS\tLUAJIT_OS_OSX\r\n#elif (defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || \\\r\n       defined(__NetBSD__) || defined(__OpenBSD__) || \\\r\n       defined(__DragonFly__)) && !defined(__ORBIS__)\r\n#define LUAJIT_OS\tLUAJIT_OS_BSD\r\n#elif (defined(__sun__) && defined(__svr4__)) || defined(__CYGWIN__)\r\n#define LUAJIT_OS\tLUAJIT_OS_POSIX\r\n#else\r\n#define LUAJIT_OS\tLUAJIT_OS_OTHER\r\n#endif\r\n\r\n#endif\r\n\r\n/* Set target OS properties. */\r\n#if LUAJIT_OS == LUAJIT_OS_WINDOWS\r\n#define LJ_OS_NAME\t\"Windows\"\r\n#elif LUAJIT_OS == LUAJIT_OS_LINUX\r\n#define LJ_OS_NAME\t\"Linux\"\r\n#elif LUAJIT_OS == LUAJIT_OS_OSX\r\n#define LJ_OS_NAME\t\"OSX\"\r\n#elif LUAJIT_OS == LUAJIT_OS_BSD\r\n#define LJ_OS_NAME\t\"BSD\"\r\n#elif LUAJIT_OS == LUAJIT_OS_POSIX\r\n#define LJ_OS_NAME\t\"POSIX\"\r\n#else\r\n#define LJ_OS_NAME\t\"Other\"\r\n#endif\r\n\r\n#define LJ_TARGET_WINDOWS\t(LUAJIT_OS == LUAJIT_OS_WINDOWS)\r\n#define LJ_TARGET_LINUX\t\t(LUAJIT_OS == LUAJIT_OS_LINUX)\r\n#define LJ_TARGET_OSX\t\t(LUAJIT_OS == LUAJIT_OS_OSX)\r\n#define LJ_TARGET_IOS\t\t(LJ_TARGET_OSX && (LUAJIT_TARGET == LUAJIT_ARCH_ARM || LUAJIT_TARGET == LUAJIT_ARCH_ARM64))\r\n#define LJ_TARGET_POSIX\t\t(LUAJIT_OS > LUAJIT_OS_WINDOWS)\r\n#define LJ_TARGET_DLOPEN\tLJ_TARGET_POSIX\r\n\r\n#ifdef __CELLOS_LV2__\r\n#define LJ_TARGET_PS3\t\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#ifdef __ORBIS__\r\n#define LJ_TARGET_PS4\t\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#undef NULL\r\n#define NULL ((void*)0)\r\n#endif\r\n\r\n#ifdef __psp2__\r\n#define LJ_TARGET_PSVITA\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#if _XBOX_VER >= 200\r\n#define LJ_TARGET_XBOX360\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#endif\r\n\r\n#ifdef _DURANGO\r\n#define LJ_TARGET_XBOXONE\t1\r\n#define LJ_TARGET_CONSOLE\t1\r\n#define LJ_TARGET_GC64\t\t1\r\n#endif\r\n\r\n#define LJ_NUMMODE_SINGLE\t0\t/* Single-number mode only. */\r\n#define LJ_NUMMODE_SINGLE_DUAL\t1\t/* Default to single-number mode. */\r\n#define LJ_NUMMODE_DUAL\t\t2\t/* Dual-number mode only. */\r\n#define LJ_NUMMODE_DUAL_SINGLE\t3\t/* Default to dual-number mode. */\r\n\r\n/* Set target architecture properties. */\r\n#if LUAJIT_TARGET == LUAJIT_ARCH_X86\r\n\r\n#define LJ_ARCH_NAME\t\t\"x86\"\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#if LJ_TARGET_WINDOWS || __CYGWIN__\r\n#define LJ_ABI_WIN\t\t1\r\n#else\r\n#define LJ_ABI_WIN\t\t0\r\n#endif\r\n#define LJ_TARGET_X86\t\t1\r\n#define LJ_TARGET_X86ORX64\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNALIGNED\t1\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE_DUAL\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_X64\r\n\r\n#define LJ_ARCH_NAME\t\t\"x64\"\r\n#define LJ_ARCH_BITS\t\t64\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#define LJ_ABI_WIN\t\tLJ_TARGET_WINDOWS\r\n#define LJ_TARGET_X64\t\t1\r\n#define LJ_TARGET_X86ORX64\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_JUMPRANGE\t31\t/* +-2^31 = +-2GB */\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNALIGNED\t1\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE_DUAL\r\n#ifdef LUAJIT_ENABLE_GC64\r\n#define LJ_TARGET_GC64\t\t1\r\n#endif\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_ARM\r\n\r\n#define LJ_ARCH_NAME\t\t\"arm\"\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#if !defined(LJ_ARCH_HASFPU) && __SOFTFP__\r\n#define LJ_ARCH_HASFPU\t\t0\r\n#endif\r\n#if !defined(LJ_ABI_SOFTFP) && !__ARM_PCS_VFP\r\n#define LJ_ABI_SOFTFP\t\t1\r\n#endif\r\n#define LJ_ABI_EABI\t\t1\r\n#define LJ_TARGET_ARM\t\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_JUMPRANGE\t25\t/* +-2^25 = +-32MB */\r\n#define LJ_TARGET_MASKSHIFT\t0\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t2\t/* Want only IR_BROR. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_DUAL\r\n\r\n#if __ARM_ARCH____ARM_ARCH_8__ || __ARM_ARCH_8A__\r\n#define LJ_ARCH_VERSION\t\t80\r\n#elif __ARM_ARCH_7__ || __ARM_ARCH_7A__ || __ARM_ARCH_7R__ || __ARM_ARCH_7S__ || __ARM_ARCH_7VE__\r\n#define LJ_ARCH_VERSION\t\t70\r\n#elif __ARM_ARCH_6T2__\r\n#define LJ_ARCH_VERSION\t\t61\r\n#elif __ARM_ARCH_6__ || __ARM_ARCH_6J__ || __ARM_ARCH_6K__ || __ARM_ARCH_6Z__ || __ARM_ARCH_6ZK__\r\n#define LJ_ARCH_VERSION\t\t60\r\n#else\r\n#define LJ_ARCH_VERSION\t\t50\r\n#endif\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_ARM64\r\n\r\n#define LJ_ARCH_NAME\t\t\"arm64\"\r\n#define LJ_ARCH_BITS\t\t64\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#define LJ_TARGET_ARM64\t\t1\r\n#define LJ_TARGET_EHRETREG\t0\r\n#define LJ_TARGET_JUMPRANGE\t27\t/* +-2^27 = +-128MB */\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t2\t/* Want only IR_BROR. */\r\n#define LJ_TARGET_GC64\t\t1\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_DUAL\r\n#define LJ_ARCH_NOJIT\t\t1\t/* NYI */\r\n\r\n#define LJ_ARCH_VERSION\t\t80\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_PPC\r\n\r\n#ifndef LJ_ARCH_ENDIAN\r\n#if __BYTE_ORDER__ != __ORDER_BIG_ENDIAN__\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#else\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_BE\r\n#endif\r\n#endif\r\n\r\n#if _LP64\r\n#define LJ_ARCH_BITS\t\t64\r\n#if LJ_ARCH_ENDIAN == LUAJIT_LE\r\n#define LJ_ARCH_NAME\t\t\"ppc64le\"\r\n#else\r\n#define LJ_ARCH_NAME\t\t\"ppc64\"\r\n#endif\r\n#else\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_ARCH_NAME\t\t\"ppc\"\r\n#endif\r\n\r\n#define LJ_TARGET_PPC\t\t1\r\n#define LJ_TARGET_EHRETREG\t3\r\n#define LJ_TARGET_JUMPRANGE\t25\t/* +-2^25 = +-32MB */\r\n#define LJ_TARGET_MASKSHIFT\t0\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t1\t/* Want only IR_BROL. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_DUAL_SINGLE\r\n\r\n#if LJ_TARGET_CONSOLE\r\n#define LJ_ARCH_PPC32ON64\t1\r\n#define LJ_ARCH_NOFFI\t\t1\r\n#elif LJ_ARCH_BITS == 64\r\n#define LJ_ARCH_PPC64\t\t1\r\n#define LJ_TARGET_GC64\t\t1\r\n#define LJ_ARCH_NOJIT\t\t1\t/* NYI */\r\n#endif\r\n\r\n#if _ARCH_PWR7\r\n#define LJ_ARCH_VERSION\t\t70\r\n#elif _ARCH_PWR6\r\n#define LJ_ARCH_VERSION\t\t60\r\n#elif _ARCH_PWR5X\r\n#define LJ_ARCH_VERSION\t\t51\r\n#elif _ARCH_PWR5\r\n#define LJ_ARCH_VERSION\t\t50\r\n#elif _ARCH_PWR4\r\n#define LJ_ARCH_VERSION\t\t40\r\n#else\r\n#define LJ_ARCH_VERSION\t\t0\r\n#endif\r\n#if _ARCH_PPCSQ\r\n#define LJ_ARCH_SQRT\t\t1\r\n#endif\r\n#if _ARCH_PWR5X\r\n#define LJ_ARCH_ROUND\t\t1\r\n#endif\r\n#if __PPU__\r\n#define LJ_ARCH_CELL\t\t1\r\n#endif\r\n#if LJ_TARGET_XBOX360\r\n#define LJ_ARCH_XENON\t\t1\r\n#endif\r\n\r\n#elif LUAJIT_TARGET == LUAJIT_ARCH_MIPS\r\n\r\n#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL)\r\n#define LJ_ARCH_NAME\t\t\"mipsel\"\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_LE\r\n#else\r\n#define LJ_ARCH_NAME\t\t\"mips\"\r\n#define LJ_ARCH_ENDIAN\t\tLUAJIT_BE\r\n#endif\r\n#define LJ_ARCH_BITS\t\t32\r\n#define LJ_TARGET_MIPS\t\t1\r\n#define LJ_TARGET_EHRETREG\t4\r\n#define LJ_TARGET_JUMPRANGE\t27\t/* 2*2^27 = 256MB-aligned region */\r\n#define LJ_TARGET_MASKSHIFT\t1\r\n#define LJ_TARGET_MASKROT\t1\r\n#define LJ_TARGET_UNIFYROT\t2\t/* Want only IR_BROR. */\r\n#define LJ_ARCH_NUMMODE\t\tLJ_NUMMODE_SINGLE\r\n\r\n#if _MIPS_ARCH_MIPS32R2\r\n#define LJ_ARCH_VERSION\t\t20\r\n#else\r\n#define LJ_ARCH_VERSION\t\t10\r\n#endif\r\n\r\n#else\r\n#error \"No target architecture defined\"\r\n#endif\r\n\r\n#ifndef LJ_PAGESIZE\r\n#define LJ_PAGESIZE\t\t4096\r\n#endif\r\n\r\n/* Check for minimum required compiler versions. */\r\n#if defined(__GNUC__)\r\n#if LJ_TARGET_X86\r\n#if (__GNUC__ < 3) || ((__GNUC__ == 3) && __GNUC_MINOR__ < 4)\r\n#error \"Need at least GCC 3.4 or newer\"\r\n#endif\r\n#elif LJ_TARGET_X64\r\n#if __GNUC__ < 4\r\n#error \"Need at least GCC 4.0 or newer\"\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if (__GNUC__ < 4) || ((__GNUC__ == 4) && __GNUC_MINOR__ < 2)\r\n#error \"Need at least GCC 4.2 or newer\"\r\n#endif\r\n#elif LJ_TARGET_ARM64\r\n#if __clang__\r\n#if (__clang_major__ < 3) || ((__clang_major__ == 3) && __clang_minor__ < 5)\r\n#error \"Need at least Clang 3.5 or newer\"\r\n#endif\r\n#else\r\n#if (__GNUC__ < 4) || ((__GNUC__ == 4) && __GNUC_MINOR__ < 8)\r\n#error \"Need at least GCC 4.8 or newer\"\r\n#endif\r\n#endif\r\n#elif !LJ_TARGET_PS3\r\n#if (__GNUC__ < 4) || ((__GNUC__ == 4) && __GNUC_MINOR__ < 3)\r\n#error \"Need at least GCC 4.3 or newer\"\r\n#endif\r\n#endif\r\n#endif\r\n\r\n/* Check target-specific constraints. */\r\n#ifndef _BUILDVM_H\r\n#if LJ_TARGET_X64\r\n#if __USING_SJLJ_EXCEPTIONS__\r\n#error \"Need a C compiler with native exception handling on x64\"\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#if defined(__ARMEB__)\r\n#error \"No support for big-endian ARM\"\r\n#endif\r\n#if __ARM_ARCH_6M__ || __ARM_ARCH_7M__ || __ARM_ARCH_7EM__\r\n#error \"No support for Cortex-M CPUs\"\r\n#endif\r\n#if !(__ARM_EABI__ || LJ_TARGET_IOS)\r\n#error \"Only ARM EABI or iOS 3.0+ ABI is supported\"\r\n#endif\r\n#elif LJ_TARGET_ARM64\r\n#if defined(__AARCH64EB__)\r\n#error \"No support for big-endian ARM64\"\r\n#endif\r\n#if defined(_ILP32)\r\n#error \"No support for ILP32 model on ARM64\"\r\n#endif\r\n#elif LJ_TARGET_PPC\r\n#if defined(_SOFT_FLOAT) || defined(_SOFT_DOUBLE)\r\n#error \"No support for PowerPC CPUs without double-precision FPU\"\r\n#endif\r\n#if !LJ_ARCH_PPC64 && LJ_ARCH_ENDIAN == LUAJIT_LE\r\n#error \"No support for little-endian PPC32\"\r\n#endif\r\n#if LJ_ARCH_PPC64\r\n#error \"No support for PowerPC 64 bit mode (yet)\"\r\n#endif\r\n#ifdef __NO_FPRS__\r\n#error \"No support for PPC/e500 anymore (use LuaJIT 2.0)\"\r\n#endif\r\n#elif LJ_TARGET_MIPS\r\n#if defined(__mips_soft_float)\r\n#error \"No support for MIPS CPUs without FPU\"\r\n#endif\r\n#if defined(_LP64)\r\n#error \"No support for MIPS64\"\r\n#endif\r\n#endif\r\n#endif\r\n\r\n/* Enable or disable the dual-number mode for the VM. */\r\n#if (LJ_ARCH_NUMMODE == LJ_NUMMODE_SINGLE && LUAJIT_NUMMODE == 2) || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL && LUAJIT_NUMMODE == 1)\r\n#error \"No support for this number mode on this architecture\"\r\n#endif\r\n#if LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_DUAL_SINGLE && LUAJIT_NUMMODE != 1) || \\\r\n    (LJ_ARCH_NUMMODE == LJ_NUMMODE_SINGLE_DUAL && LUAJIT_NUMMODE == 2)\r\n#define LJ_DUALNUM\t\t1\r\n#else\r\n#define LJ_DUALNUM\t\t0\r\n#endif\r\n\r\n#if LJ_TARGET_IOS || LJ_TARGET_CONSOLE\r\n/* Runtime code generation is restricted on iOS. Complain to Apple, not me. */\r\n/* Ditto for the consoles. Complain to Sony or MS, not me. */\r\n#ifndef LUAJIT_ENABLE_JIT\r\n#define LJ_OS_NOJIT\t\t1\r\n#endif\r\n#endif\r\n\r\n/* 64 bit GC references. */\r\n#if LJ_TARGET_GC64\r\n#define LJ_GC64\t\t\t1\r\n#else\r\n#define LJ_GC64\t\t\t0\r\n#endif\r\n\r\n/* 2-slot frame info. */\r\n#if LJ_GC64\r\n#define LJ_FR2\t\t\t1\r\n#else\r\n#define LJ_FR2\t\t\t0\r\n#endif\r\n\r\n/* Disable or enable the JIT compiler. */\r\n#if defined(LUAJIT_DISABLE_JIT) || defined(LJ_ARCH_NOJIT) || defined(LJ_OS_NOJIT) || LJ_FR2 || LJ_GC64\r\n#define LJ_HASJIT\t\t0\r\n#else\r\n#define LJ_HASJIT\t\t1\r\n#endif\r\n\r\n/* Disable or enable the FFI extension. */\r\n#if defined(LUAJIT_DISABLE_FFI) || defined(LJ_ARCH_NOFFI)\r\n#define LJ_HASFFI\t\t0\r\n#else\r\n#define LJ_HASFFI\t\t1\r\n#endif\r\n\r\n#if defined(LUAJIT_DISABLE_PROFILE)\r\n#define LJ_HASPROFILE\t\t0\r\n#elif LJ_TARGET_POSIX\r\n#define LJ_HASPROFILE\t\t1\r\n#define LJ_PROFILE_SIGPROF\t1\r\n#elif LJ_TARGET_PS3\r\n#define LJ_HASPROFILE\t\t1\r\n#define LJ_PROFILE_PTHREAD\t1\r\n#elif LJ_TARGET_WINDOWS || LJ_TARGET_XBOX360\r\n#define LJ_HASPROFILE\t\t1\r\n#define LJ_PROFILE_WTHREAD\t1\r\n#else\r\n#define LJ_HASPROFILE\t\t0\r\n#endif\r\n\r\n#ifndef LJ_ARCH_HASFPU\r\n#define LJ_ARCH_HASFPU\t\t1\r\n#endif\r\n#ifndef LJ_ABI_SOFTFP\r\n#define LJ_ABI_SOFTFP\t\t0\r\n#endif\r\n#define LJ_SOFTFP\t\t(!LJ_ARCH_HASFPU)\r\n\r\n#if LJ_ARCH_ENDIAN == LUAJIT_BE\r\n#define LJ_LE\t\t\t0\r\n#define LJ_BE\t\t\t1\r\n#define LJ_ENDIAN_SELECT(le, be)\tbe\r\n#define LJ_ENDIAN_LOHI(lo, hi)\t\thi lo\r\n#else\r\n#define LJ_LE\t\t\t1\r\n#define LJ_BE\t\t\t0\r\n#define LJ_ENDIAN_SELECT(le, be)\tle\r\n#define LJ_ENDIAN_LOHI(lo, hi)\t\tlo hi\r\n#endif\r\n\r\n#if LJ_ARCH_BITS == 32\r\n#define LJ_32\t\t\t1\r\n#define LJ_64\t\t\t0\r\n#else\r\n#define LJ_32\t\t\t0\r\n#define LJ_64\t\t\t1\r\n#endif\r\n\r\n#ifndef LJ_TARGET_UNALIGNED\r\n#define LJ_TARGET_UNALIGNED\t0\r\n#endif\r\n\r\n/* Various workarounds for embedded operating systems or weak C runtimes. */\r\n#if (defined(__ANDROID__) && !defined(LJ_TARGET_X86ORX64)) || defined(__symbian__) || LJ_TARGET_XBOX360 || LJ_TARGET_WINDOWS\r\n#define LUAJIT_NO_LOG2\r\n#endif\r\n#if defined(__symbian__) || LJ_TARGET_WINDOWS\r\n#define LUAJIT_NO_EXP2\r\n#endif\r\n\r\n#if defined(LUAJIT_NO_UNWIND) || defined(__symbian__) || LJ_TARGET_IOS || LJ_TARGET_PS3 || LJ_TARGET_PS4\r\n#define LJ_NO_UNWIND\t\t1\r\n#endif\r\n\r\n/* Compatibility with Lua 5.1 vs. 5.2. */\r\n#ifdef LUAJIT_ENABLE_LUA52COMPAT\r\n#define LJ_52\t\t\t1\r\n#else\r\n#define LJ_52\t\t\t0\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm.c",
    "content": "/*\r\n** IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_asm_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_asm.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_target.h\"\r\n\r\n#ifdef LUA_USE_ASSERT\r\n#include <stdio.h>\r\n#endif\r\n\r\n/* -- Assembler state and common macros ----------------------------------- */\r\n\r\n/* Assembler state. */\r\ntypedef struct ASMState {\r\n  RegCost cost[RID_MAX];  /* Reference and blended allocation cost for regs. */\r\n\r\n  MCode *mcp;\t\t/* Current MCode pointer (grows down). */\r\n  MCode *mclim;\t\t/* Lower limit for MCode memory + red zone. */\r\n#ifdef LUA_USE_ASSERT\r\n  MCode *mcp_prev;\t/* Red zone overflow check. */\r\n#endif\r\n\r\n  IRIns *ir;\t\t/* Copy of pointer to IR instructions/constants. */\r\n  jit_State *J;\t\t/* JIT compiler state. */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n  x86ModRM mrm;\t\t/* Fused x86 address operand. */\r\n#endif\r\n\r\n  RegSet freeset;\t/* Set of free registers. */\r\n  RegSet modset;\t/* Set of registers modified inside the loop. */\r\n  RegSet weakset;\t/* Set of weakly referenced registers. */\r\n  RegSet phiset;\t/* Set of PHI registers. */\r\n\r\n  uint32_t flags;\t/* Copy of JIT compiler flags. */\r\n  int loopinv;\t\t/* Loop branch inversion (0:no, 1:yes, 2:yes+CC_P). */\r\n\r\n  int32_t evenspill;\t/* Next even spill slot. */\r\n  int32_t oddspill;\t/* Next odd spill slot (or 0). */\r\n\r\n  IRRef curins;\t\t/* Reference of current instruction. */\r\n  IRRef stopins;\t/* Stop assembly before hitting this instruction. */\r\n  IRRef orignins;\t/* Original T->nins. */\r\n\r\n  IRRef snapref;\t/* Current snapshot is active after this reference. */\r\n  IRRef snaprename;\t/* Rename highwater mark for snapshot check. */\r\n  SnapNo snapno;\t/* Current snapshot number. */\r\n  SnapNo loopsnapno;\t/* Loop snapshot number. */\r\n\r\n  IRRef fuseref;\t/* Fusion limit (loopref, 0 or FUSE_DISABLED). */\r\n  IRRef sectref;\t/* Section base reference (loopref or 0). */\r\n  IRRef loopref;\t/* Reference of LOOP instruction (or 0). */\r\n\r\n  BCReg topslot;\t/* Number of slots for stack check (unless 0). */\r\n  int32_t gcsteps;\t/* Accumulated number of GC steps (per section). */\r\n\r\n  GCtrace *T;\t\t/* Trace to assemble. */\r\n  GCtrace *parent;\t/* Parent trace (or NULL). */\r\n\r\n  MCode *mcbot;\t\t/* Bottom of reserved MCode. */\r\n  MCode *mctop;\t\t/* Top of generated MCode. */\r\n  MCode *mcloop;\t/* Pointer to loop MCode (or NULL). */\r\n  MCode *invmcp;\t/* Points to invertible loop branch (or NULL). */\r\n  MCode *flagmcp;\t/* Pending opportunity to merge flag setting ins. */\r\n  MCode *realign;\t/* Realign loop if not NULL. */\r\n\r\n#ifdef RID_NUM_KREF\r\n  int32_t krefk[RID_NUM_KREF];\r\n#endif\r\n  IRRef1 phireg[RID_MAX];  /* PHI register references. */\r\n  uint16_t parentmap[LJ_MAX_JSLOTS];  /* Parent instruction to RegSP map. */\r\n} ASMState;\r\n\r\n#define IR(ref)\t\t\t(&as->ir[(ref)])\r\n\r\n#define ASMREF_TMP1\t\tREF_TRUE\t/* Temp. register. */\r\n#define ASMREF_TMP2\t\tREF_FALSE\t/* Temp. register. */\r\n#define ASMREF_L\t\tREF_NIL\t\t/* Stores register for L. */\r\n\r\n/* Check for variant to invariant references. */\r\n#define iscrossref(as, ref)\t((ref) < as->sectref)\r\n\r\n/* Inhibit memory op fusion from variant to invariant references. */\r\n#define FUSE_DISABLED\t\t(~(IRRef)0)\r\n#define mayfuse(as, ref)\t((ref) > as->fuseref)\r\n#define neverfuse(as)\t\t(as->fuseref == FUSE_DISABLED)\r\n#define canfuse(as, ir)\t\t(!neverfuse(as) && !irt_isphi((ir)->t))\r\n#define opisfusableload(o) \\\r\n  ((o) == IR_ALOAD || (o) == IR_HLOAD || (o) == IR_ULOAD || \\\r\n   (o) == IR_FLOAD || (o) == IR_XLOAD || (o) == IR_SLOAD || (o) == IR_VLOAD)\r\n\r\n/* Sparse limit checks using a red zone before the actual limit. */\r\n#define MCLIM_REDZONE\t64\r\n\r\nstatic LJ_NORET LJ_NOINLINE void asm_mclimit(ASMState *as)\r\n{\r\n  lj_mcode_limiterr(as->J, (size_t)(as->mctop - as->mcp + 4*MCLIM_REDZONE));\r\n}\r\n\r\nstatic LJ_AINLINE void checkmclim(ASMState *as)\r\n{\r\n#ifdef LUA_USE_ASSERT\r\n  if (as->mcp + MCLIM_REDZONE < as->mcp_prev) {\r\n    IRIns *ir = IR(as->curins+1);\r\n    fprintf(stderr, \"RED ZONE OVERFLOW: %p IR %04d  %02d %04d %04d\\n\", as->mcp,\r\n\t    as->curins+1-REF_BIAS, ir->o, ir->op1-REF_BIAS, ir->op2-REF_BIAS);\r\n    lua_assert(0);\r\n  }\r\n#endif\r\n  if (LJ_UNLIKELY(as->mcp < as->mclim)) asm_mclimit(as);\r\n#ifdef LUA_USE_ASSERT\r\n  as->mcp_prev = as->mcp;\r\n#endif\r\n}\r\n\r\n#ifdef RID_NUM_KREF\r\n#define ra_iskref(ref)\t\t((ref) < RID_NUM_KREF)\r\n#define ra_krefreg(ref)\t\t((Reg)(RID_MIN_KREF + (Reg)(ref)))\r\n#define ra_krefk(as, ref)\t(as->krefk[(ref)])\r\n\r\nstatic LJ_AINLINE void ra_setkref(ASMState *as, Reg r, int32_t k)\r\n{\r\n  IRRef ref = (IRRef)(r - RID_MIN_KREF);\r\n  as->krefk[ref] = k;\r\n  as->cost[r] = REGCOST(ref, ref);\r\n}\r\n\r\n#else\r\n#define ra_iskref(ref)\t\t0\r\n#define ra_krefreg(ref)\t\tRID_MIN_GPR\r\n#define ra_krefk(as, ref)\t0\r\n#endif\r\n\r\n/* Arch-specific field offsets. */\r\nstatic const uint8_t field_ofs[IRFL__MAX+1] = {\r\n#define FLOFS(name, ofs)\t(uint8_t)(ofs),\r\nIRFLDEF(FLOFS)\r\n#undef FLOFS\r\n  0\r\n};\r\n\r\n/* -- Target-specific instruction emitter --------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_emit_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_emit_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_emit_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_emit_mips.h\"\r\n#else\r\n#error \"Missing instruction emitter for target CPU\"\r\n#endif\r\n\r\n/* Generic load/store of register from/to stack slot. */\r\n#define emit_spload(as, ir, r, ofs) \\\r\n  emit_loadofs(as, ir, (r), RID_SP, (ofs))\r\n#define emit_spstore(as, ir, r, ofs) \\\r\n  emit_storeofs(as, ir, (r), RID_SP, (ofs))\r\n\r\n/* -- Register allocator debugging ---------------------------------------- */\r\n\r\n/* #define LUAJIT_DEBUG_RA */\r\n\r\n#ifdef LUAJIT_DEBUG_RA\r\n\r\n#include <stdio.h>\r\n#include <stdarg.h>\r\n\r\n#define RIDNAME(name)\t#name,\r\nstatic const char *const ra_regname[] = {\r\n  GPRDEF(RIDNAME)\r\n  FPRDEF(RIDNAME)\r\n  VRIDDEF(RIDNAME)\r\n  NULL\r\n};\r\n#undef RIDNAME\r\n\r\nstatic char ra_dbg_buf[65536];\r\nstatic char *ra_dbg_p;\r\nstatic char *ra_dbg_merge;\r\nstatic MCode *ra_dbg_mcp;\r\n\r\nstatic void ra_dstart(void)\r\n{\r\n  ra_dbg_p = ra_dbg_buf;\r\n  ra_dbg_merge = NULL;\r\n  ra_dbg_mcp = NULL;\r\n}\r\n\r\nstatic void ra_dflush(void)\r\n{\r\n  fwrite(ra_dbg_buf, 1, (size_t)(ra_dbg_p-ra_dbg_buf), stdout);\r\n  ra_dstart();\r\n}\r\n\r\nstatic void ra_dprintf(ASMState *as, const char *fmt, ...)\r\n{\r\n  char *p;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  p = ra_dbg_mcp == as->mcp ? ra_dbg_merge : ra_dbg_p;\r\n  ra_dbg_mcp = NULL;\r\n  p += sprintf(p, \"%08x  \\e[36m%04d \", (uintptr_t)as->mcp, as->curins-REF_BIAS);\r\n  for (;;) {\r\n    const char *e = strchr(fmt, '$');\r\n    if (e == NULL) break;\r\n    memcpy(p, fmt, (size_t)(e-fmt));\r\n    p += e-fmt;\r\n    if (e[1] == 'r') {\r\n      Reg r = va_arg(argp, Reg) & RID_MASK;\r\n      if (r <= RID_MAX) {\r\n\tconst char *q;\r\n\tfor (q = ra_regname[r]; *q; q++)\r\n\t  *p++ = *q >= 'A' && *q <= 'Z' ? *q + 0x20 : *q;\r\n      } else {\r\n\t*p++ = '?';\r\n\tlua_assert(0);\r\n      }\r\n    } else if (e[1] == 'f' || e[1] == 'i') {\r\n      IRRef ref;\r\n      if (e[1] == 'f')\r\n\tref = va_arg(argp, IRRef);\r\n      else\r\n\tref = va_arg(argp, IRIns *) - as->ir;\r\n      if (ref >= REF_BIAS)\r\n\tp += sprintf(p, \"%04d\", ref - REF_BIAS);\r\n      else\r\n\tp += sprintf(p, \"K%03d\", REF_BIAS - ref);\r\n    } else if (e[1] == 's') {\r\n      uint32_t slot = va_arg(argp, uint32_t);\r\n      p += sprintf(p, \"[sp+0x%x]\", sps_scale(slot));\r\n    } else if (e[1] == 'x') {\r\n      p += sprintf(p, \"%08x\", va_arg(argp, int32_t));\r\n    } else {\r\n      lua_assert(0);\r\n    }\r\n    fmt = e+2;\r\n  }\r\n  va_end(argp);\r\n  while (*fmt)\r\n    *p++ = *fmt++;\r\n  *p++ = '\\e'; *p++ = '['; *p++ = 'm'; *p++ = '\\n';\r\n  if (p > ra_dbg_buf+sizeof(ra_dbg_buf)-256) {\r\n    fwrite(ra_dbg_buf, 1, (size_t)(p-ra_dbg_buf), stdout);\r\n    p = ra_dbg_buf;\r\n  }\r\n  ra_dbg_p = p;\r\n}\r\n\r\n#define RA_DBG_START()\tra_dstart()\r\n#define RA_DBG_FLUSH()\tra_dflush()\r\n#define RA_DBG_REF() \\\r\n  do { char *_p = ra_dbg_p; ra_dprintf(as, \"\"); \\\r\n       ra_dbg_merge = _p; ra_dbg_mcp = as->mcp; } while (0)\r\n#define RA_DBGX(x)\tra_dprintf x\r\n\r\n#else\r\n#define RA_DBG_START()\t((void)0)\r\n#define RA_DBG_FLUSH()\t((void)0)\r\n#define RA_DBG_REF()\t((void)0)\r\n#define RA_DBGX(x)\t((void)0)\r\n#endif\r\n\r\n/* -- Register allocator -------------------------------------------------- */\r\n\r\n#define ra_free(as, r)\t\trset_set(as->freeset, (r))\r\n#define ra_modified(as, r)\trset_set(as->modset, (r))\r\n#define ra_weak(as, r)\t\trset_set(as->weakset, (r))\r\n#define ra_noweak(as, r)\trset_clear(as->weakset, (r))\r\n\r\n#define ra_used(ir)\t\t(ra_hasreg((ir)->r) || ra_hasspill((ir)->s))\r\n\r\n/* Setup register allocator. */\r\nstatic void ra_setup(ASMState *as)\r\n{\r\n  Reg r;\r\n  /* Initially all regs (except the stack pointer) are free for use. */\r\n  as->freeset = RSET_INIT;\r\n  as->modset = RSET_EMPTY;\r\n  as->weakset = RSET_EMPTY;\r\n  as->phiset = RSET_EMPTY;\r\n  memset(as->phireg, 0, sizeof(as->phireg));\r\n  for (r = RID_MIN_GPR; r < RID_MAX; r++)\r\n    as->cost[r] = REGCOST(~0u, 0u);\r\n}\r\n\r\n/* Rematerialize constants. */\r\nstatic Reg ra_rematk(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir;\r\n  Reg r;\r\n  if (ra_iskref(ref)) {\r\n    r = ra_krefreg(ref);\r\n    lua_assert(!rset_test(as->freeset, r));\r\n    ra_free(as, r);\r\n    ra_modified(as, r);\r\n    emit_loadi(as, r, ra_krefk(as, ref));\r\n    return r;\r\n  }\r\n  ir = IR(ref);\r\n  r = ir->r;\r\n  lua_assert(ra_hasreg(r) && !ra_hasspill(ir->s));\r\n  ra_free(as, r);\r\n  ra_modified(as, r);\r\n  ir->r = RID_INIT;  /* Do not keep any hint. */\r\n  RA_DBGX((as, \"remat     $i $r\", ir, r));\r\n#if !LJ_SOFTFP\r\n  if (ir->o == IR_KNUM) {\r\n    emit_loadn(as, r, ir_knum(ir));\r\n  } else\r\n#endif\r\n  if (emit_canremat(REF_BASE) && ir->o == IR_BASE) {\r\n    ra_sethint(ir->r, RID_BASE);  /* Restore BASE register hint. */\r\n    emit_getgl(as, r, jit_base);\r\n  } else if (emit_canremat(ASMREF_L) && ir->o == IR_KPRI) {\r\n    lua_assert(irt_isnil(ir->t));  /* REF_NIL stores ASMREF_L register. */\r\n    emit_getgl(as, r, cur_L);\r\n#if LJ_64\r\n  } else if (ir->o == IR_KINT64) {\r\n    emit_loadu64(as, r, ir_kint64(ir)->u64);\r\n#endif\r\n  } else {\r\n    lua_assert(ir->o == IR_KINT || ir->o == IR_KGC ||\r\n\t       ir->o == IR_KPTR || ir->o == IR_KKPTR || ir->o == IR_KNULL);\r\n    emit_loadi(as, r, ir->i);\r\n  }\r\n  return r;\r\n}\r\n\r\n/* Force a spill. Allocate a new spill slot if needed. */\r\nstatic int32_t ra_spill(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t slot = ir->s;\r\n  lua_assert(ir >= as->ir + REF_TRUE);\r\n  if (!ra_hasspill(slot)) {\r\n    if (irt_is64(ir->t)) {\r\n      slot = as->evenspill;\r\n      as->evenspill += 2;\r\n    } else if (as->oddspill) {\r\n      slot = as->oddspill;\r\n      as->oddspill = 0;\r\n    } else {\r\n      slot = as->evenspill;\r\n      as->oddspill = slot+1;\r\n      as->evenspill += 2;\r\n    }\r\n    if (as->evenspill > 256)\r\n      lj_trace_err(as->J, LJ_TRERR_SPILLOV);\r\n    ir->s = (uint8_t)slot;\r\n  }\r\n  return sps_scale(slot);\r\n}\r\n\r\n/* Release the temporarily allocated register in ASMREF_TMP1/ASMREF_TMP2. */\r\nstatic Reg ra_releasetmp(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg r = ir->r;\r\n  lua_assert(ra_hasreg(r) && !ra_hasspill(ir->s));\r\n  ra_free(as, r);\r\n  ra_modified(as, r);\r\n  ir->r = RID_INIT;\r\n  return r;\r\n}\r\n\r\n/* Restore a register (marked as free). Rematerialize or force a spill. */\r\nstatic Reg ra_restore(ASMState *as, IRRef ref)\r\n{\r\n  if (emit_canremat(ref)) {\r\n    return ra_rematk(as, ref);\r\n  } else {\r\n    IRIns *ir = IR(ref);\r\n    int32_t ofs = ra_spill(as, ir);  /* Force a spill slot. */\r\n    Reg r = ir->r;\r\n    lua_assert(ra_hasreg(r));\r\n    ra_sethint(ir->r, r);  /* Keep hint. */\r\n    ra_free(as, r);\r\n    if (!rset_test(as->weakset, r)) {  /* Only restore non-weak references. */\r\n      ra_modified(as, r);\r\n      RA_DBGX((as, \"restore   $i $r\", ir, r));\r\n      emit_spload(as, ir, r, ofs);\r\n    }\r\n    return r;\r\n  }\r\n}\r\n\r\n/* Save a register to a spill slot. */\r\nstatic void ra_save(ASMState *as, IRIns *ir, Reg r)\r\n{\r\n  RA_DBGX((as, \"save      $i $r\", ir, r));\r\n  emit_spstore(as, ir, r, sps_scale(ir->s));\r\n}\r\n\r\n#define MINCOST(name) \\\r\n  if (rset_test(RSET_ALL, RID_##name) && \\\r\n      LJ_LIKELY(allow&RID2RSET(RID_##name)) && as->cost[RID_##name] < cost) \\\r\n    cost = as->cost[RID_##name];\r\n\r\n/* Evict the register with the lowest cost, forcing a restore. */\r\nstatic Reg ra_evict(ASMState *as, RegSet allow)\r\n{\r\n  IRRef ref;\r\n  RegCost cost = ~(RegCost)0;\r\n  lua_assert(allow != RSET_EMPTY);\r\n  if (RID_NUM_FPR == 0 || allow < RID2RSET(RID_MAX_GPR)) {\r\n    GPRDEF(MINCOST)\r\n  } else {\r\n    FPRDEF(MINCOST)\r\n  }\r\n  ref = regcost_ref(cost);\r\n  lua_assert(ra_iskref(ref) || (ref >= as->T->nk && ref < as->T->nins));\r\n  /* Preferably pick any weak ref instead of a non-weak, non-const ref. */\r\n  if (!irref_isk(ref) && (as->weakset & allow)) {\r\n    IRIns *ir = IR(ref);\r\n    if (!rset_test(as->weakset, ir->r))\r\n      ref = regcost_ref(as->cost[rset_pickbot((as->weakset & allow))]);\r\n  }\r\n  return ra_restore(as, ref);\r\n}\r\n\r\n/* Pick any register (marked as free). Evict on-demand. */\r\nstatic Reg ra_pick(ASMState *as, RegSet allow)\r\n{\r\n  RegSet pick = as->freeset & allow;\r\n  if (!pick)\r\n    return ra_evict(as, allow);\r\n  else\r\n    return rset_picktop(pick);\r\n}\r\n\r\n/* Get a scratch register (marked as free). */\r\nstatic Reg ra_scratch(ASMState *as, RegSet allow)\r\n{\r\n  Reg r = ra_pick(as, allow);\r\n  ra_modified(as, r);\r\n  RA_DBGX((as, \"scratch        $r\", r));\r\n  return r;\r\n}\r\n\r\n/* Evict all registers from a set (if not free). */\r\nstatic void ra_evictset(ASMState *as, RegSet drop)\r\n{\r\n  RegSet work;\r\n  as->modset |= drop;\r\n#if !LJ_SOFTFP\r\n  work = (drop & ~as->freeset) & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n#endif\r\n  work = (drop & ~as->freeset);\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n}\r\n\r\n/* Evict (rematerialize) all registers allocated to constants. */\r\nstatic void ra_evictk(ASMState *as)\r\n{\r\n  RegSet work;\r\n#if !LJ_SOFTFP\r\n  work = ~as->freeset & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    if (emit_canremat(ref) && irref_isk(ref)) {\r\n      ra_rematk(as, ref);\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n#endif\r\n  work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    if (emit_canremat(ref) && irref_isk(ref)) {\r\n      ra_rematk(as, ref);\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n#ifdef RID_NUM_KREF\r\n/* Allocate a register for a constant. */\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow)\r\n{\r\n  /* First try to find a register which already holds the same constant. */\r\n  RegSet pick, work = ~as->freeset & RSET_GPR;\r\n  Reg r;\r\n  while (work) {\r\n    IRRef ref;\r\n    r = rset_pickbot(work);\r\n    ref = regcost_ref(as->cost[r]);\r\n    if (ref < ASMREF_L &&\r\n\tk == (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i))\r\n      return r;\r\n    rset_clear(work, r);\r\n  }\r\n  pick = as->freeset & allow;\r\n  if (pick) {\r\n    /* Constants should preferably get unmodified registers. */\r\n    if ((pick & ~as->modset))\r\n      pick &= ~as->modset;\r\n    r = rset_pickbot(pick);  /* Reduce conflicts with inverse allocation. */\r\n  } else {\r\n    r = ra_evict(as, allow);\r\n  }\r\n  RA_DBGX((as, \"allock    $x $r\", k, r));\r\n  ra_setkref(as, r, k);\r\n  rset_clear(as->freeset, r);\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a specific register for a constant. */\r\nstatic void ra_allockreg(ASMState *as, int32_t k, Reg r)\r\n{\r\n  Reg kr = ra_allock(as, k, RID2RSET(r));\r\n  if (kr != r) {\r\n    IRIns irdummy;\r\n    irdummy.t.irt = IRT_INT;\r\n    ra_scratch(as, RID2RSET(r));\r\n    emit_movrr(as, &irdummy, r, kr);\r\n  }\r\n}\r\n#else\r\n#define ra_allockreg(as, k, r)\t\temit_loadi(as, (r), (k))\r\n#endif\r\n\r\n/* Allocate a register for ref from the allowed set of registers.\r\n** Note: this function assumes the ref does NOT have a register yet!\r\n** Picks an optimal register, sets the cost and marks the register as non-free.\r\n*/\r\nstatic Reg ra_allocref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  RegSet pick = as->freeset & allow;\r\n  Reg r;\r\n  lua_assert(ra_noreg(ir->r));\r\n  if (pick) {\r\n    /* First check register hint from propagation or PHI. */\r\n    if (ra_hashint(ir->r)) {\r\n      r = ra_gethint(ir->r);\r\n      if (rset_test(pick, r))  /* Use hint register if possible. */\r\n\tgoto found;\r\n      /* Rematerialization is cheaper than missing a hint. */\r\n      if (rset_test(allow, r) && emit_canremat(regcost_ref(as->cost[r]))) {\r\n\tra_rematk(as, regcost_ref(as->cost[r]));\r\n\tgoto found;\r\n      }\r\n      RA_DBGX((as, \"hintmiss  $f $r\", ref, r));\r\n    }\r\n    /* Invariants should preferably get unmodified registers. */\r\n    if (ref < as->loopref && !irt_isphi(ir->t)) {\r\n      if ((pick & ~as->modset))\r\n\tpick &= ~as->modset;\r\n      r = rset_pickbot(pick);  /* Reduce conflicts with inverse allocation. */\r\n    } else {\r\n      /* We've got plenty of regs, so get callee-save regs if possible. */\r\n      if (RID_NUM_GPR > 8 && (pick & ~RSET_SCRATCH))\r\n\tpick &= ~RSET_SCRATCH;\r\n      r = rset_picktop(pick);\r\n    }\r\n  } else {\r\n    r = ra_evict(as, allow);\r\n  }\r\nfound:\r\n  RA_DBGX((as, \"alloc     $f $r\", ref, r));\r\n  ir->r = (uint8_t)r;\r\n  rset_clear(as->freeset, r);\r\n  ra_noweak(as, r);\r\n  as->cost[r] = REGCOST_REF_T(ref, irt_t(ir->t));\r\n  return r;\r\n}\r\n\r\n/* Allocate a register on-demand. */\r\nstatic Reg ra_alloc1(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  /* Note: allow is ignored if the register is already allocated. */\r\n  if (ra_noreg(r)) r = ra_allocref(as, ref, allow);\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Rename register allocation and emit move. */\r\nstatic void ra_rename(ASMState *as, Reg down, Reg up)\r\n{\r\n  IRRef ren, ref = regcost_ref(as->cost[up] = as->cost[down]);\r\n  IRIns *ir = IR(ref);\r\n  ir->r = (uint8_t)up;\r\n  as->cost[down] = 0;\r\n  lua_assert((down < RID_MAX_GPR) == (up < RID_MAX_GPR));\r\n  lua_assert(!rset_test(as->freeset, down) && rset_test(as->freeset, up));\r\n  ra_free(as, down);  /* 'down' is free ... */\r\n  ra_modified(as, down);\r\n  rset_clear(as->freeset, up);  /* ... and 'up' is now allocated. */\r\n  ra_noweak(as, up);\r\n  RA_DBGX((as, \"rename    $f $r $r\", regcost_ref(as->cost[up]), down, up));\r\n  emit_movrr(as, ir, down, up);  /* Backwards codegen needs inverse move. */\r\n  if (!ra_hasspill(IR(ref)->s)) {  /* Add the rename to the IR. */\r\n    lj_ir_set(as->J, IRT(IR_RENAME, IRT_NIL), ref, as->snapno);\r\n    ren = tref_ref(lj_ir_emit(as->J));\r\n    as->ir = as->T->ir;  /* The IR may have been reallocated. */\r\n    IR(ren)->r = (uint8_t)down;\r\n    IR(ren)->s = SPS_NONE;\r\n  }\r\n}\r\n\r\n/* Pick a destination register (marked as free).\r\n** Caveat: allow is ignored if there's already a destination register.\r\n** Use ra_destreg() to get a specific register.\r\n*/\r\nstatic Reg ra_dest(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  Reg dest = ir->r;\r\n  if (ra_hasreg(dest)) {\r\n    ra_free(as, dest);\r\n    ra_modified(as, dest);\r\n  } else {\r\n    if (ra_hashint(dest) && rset_test((as->freeset&allow), ra_gethint(dest))) {\r\n      dest = ra_gethint(dest);\r\n      ra_modified(as, dest);\r\n      RA_DBGX((as, \"dest           $r\", dest));\r\n    } else {\r\n      dest = ra_scratch(as, allow);\r\n    }\r\n    ir->r = dest;\r\n  }\r\n  if (LJ_UNLIKELY(ra_hasspill(ir->s))) ra_save(as, ir, dest);\r\n  return dest;\r\n}\r\n\r\n/* Force a specific destination register (marked as free). */\r\nstatic void ra_destreg(ASMState *as, IRIns *ir, Reg r)\r\n{\r\n  Reg dest = ra_dest(as, ir, RID2RSET(r));\r\n  if (dest != r) {\r\n    lua_assert(rset_test(as->freeset, r));\r\n    ra_modified(as, r);\r\n    emit_movrr(as, ir, dest, r);\r\n  }\r\n}\r\n\r\n#if LJ_TARGET_X86ORX64\r\n/* Propagate dest register to left reference. Emit moves as needed.\r\n** This is a required fixup step for all 2-operand machine instructions.\r\n*/\r\nstatic void ra_left(ASMState *as, Reg dest, IRRef lref)\r\n{\r\n  IRIns *ir = IR(lref);\r\n  Reg left = ir->r;\r\n  if (ra_noreg(left)) {\r\n    if (irref_isk(lref)) {\r\n      if (ir->o == IR_KNUM) {\r\n\tcTValue *tv = ir_knum(ir);\r\n\t/* FP remat needs a load except for +0. Still better than eviction. */\r\n\tif (tvispzero(tv) || !(as->freeset & RSET_FPR)) {\r\n\t  emit_loadn(as, dest, tv);\r\n\t  return;\r\n\t}\r\n#if LJ_64\r\n      } else if (ir->o == IR_KINT64) {\r\n\temit_loadu64(as, dest, ir_kint64(ir)->u64);\r\n\treturn;\r\n#endif\r\n      } else if (ir->o != IR_KPRI) {\r\n\tlua_assert(ir->o == IR_KINT || ir->o == IR_KGC ||\r\n\t\t   ir->o == IR_KPTR || ir->o == IR_KKPTR || ir->o == IR_KNULL);\r\n\temit_loadi(as, dest, ir->i);\r\n\treturn;\r\n      }\r\n    }\r\n    if (!ra_hashint(left) && !iscrossref(as, lref))\r\n      ra_sethint(ir->r, dest);  /* Propagate register hint. */\r\n    left = ra_allocref(as, lref, dest < RID_MAX_GPR ? RSET_GPR : RSET_FPR);\r\n  }\r\n  ra_noweak(as, left);\r\n  /* Move needed for true 3-operand instruction: y=a+b ==> y=a; y+=b. */\r\n  if (dest != left) {\r\n    /* Use register renaming if dest is the PHI reg. */\r\n    if (irt_isphi(ir->t) && as->phireg[dest] == lref) {\r\n      ra_modified(as, left);\r\n      ra_rename(as, left, dest);\r\n    } else {\r\n      emit_movrr(as, ir, dest, left);\r\n    }\r\n  }\r\n}\r\n#else\r\n/* Similar to ra_left, except we override any hints. */\r\nstatic void ra_leftov(ASMState *as, Reg dest, IRRef lref)\r\n{\r\n  IRIns *ir = IR(lref);\r\n  Reg left = ir->r;\r\n  if (ra_noreg(left)) {\r\n    ra_sethint(ir->r, dest);  /* Propagate register hint. */\r\n    left = ra_allocref(as, lref,\r\n\t\t       (LJ_SOFTFP || dest < RID_MAX_GPR) ? RSET_GPR : RSET_FPR);\r\n  }\r\n  ra_noweak(as, left);\r\n  if (dest != left) {\r\n    /* Use register renaming if dest is the PHI reg. */\r\n    if (irt_isphi(ir->t) && as->phireg[dest] == lref) {\r\n      ra_modified(as, left);\r\n      ra_rename(as, left, dest);\r\n    } else {\r\n      emit_movrr(as, ir, dest, left);\r\n    }\r\n  }\r\n}\r\n#endif\r\n\r\n#if !LJ_64\r\n/* Force a RID_RETLO/RID_RETHI destination register pair (marked as free). */\r\nstatic void ra_destpair(ASMState *as, IRIns *ir)\r\n{\r\n  Reg destlo = ir->r, desthi = (ir+1)->r;\r\n  /* First spill unrelated refs blocking the destination registers. */\r\n  if (!rset_test(as->freeset, RID_RETLO) &&\r\n      destlo != RID_RETLO && desthi != RID_RETLO)\r\n    ra_restore(as, regcost_ref(as->cost[RID_RETLO]));\r\n  if (!rset_test(as->freeset, RID_RETHI) &&\r\n      destlo != RID_RETHI && desthi != RID_RETHI)\r\n    ra_restore(as, regcost_ref(as->cost[RID_RETHI]));\r\n  /* Next free the destination registers (if any). */\r\n  if (ra_hasreg(destlo)) {\r\n    ra_free(as, destlo);\r\n    ra_modified(as, destlo);\r\n  } else {\r\n    destlo = RID_RETLO;\r\n  }\r\n  if (ra_hasreg(desthi)) {\r\n    ra_free(as, desthi);\r\n    ra_modified(as, desthi);\r\n  } else {\r\n    desthi = RID_RETHI;\r\n  }\r\n  /* Check for conflicts and shuffle the registers as needed. */\r\n  if (destlo == RID_RETHI) {\r\n    if (desthi == RID_RETLO) {\r\n#if LJ_TARGET_X86\r\n      *--as->mcp = XI_XCHGa + RID_RETHI;\r\n#else\r\n      emit_movrr(as, ir, RID_RETHI, RID_TMP);\r\n      emit_movrr(as, ir, RID_RETLO, RID_RETHI);\r\n      emit_movrr(as, ir, RID_TMP, RID_RETLO);\r\n#endif\r\n    } else {\r\n      emit_movrr(as, ir, RID_RETHI, RID_RETLO);\r\n      if (desthi != RID_RETHI) emit_movrr(as, ir, desthi, RID_RETHI);\r\n    }\r\n  } else if (desthi == RID_RETLO) {\r\n    emit_movrr(as, ir, RID_RETLO, RID_RETHI);\r\n    if (destlo != RID_RETLO) emit_movrr(as, ir, destlo, RID_RETLO);\r\n  } else {\r\n    if (desthi != RID_RETHI) emit_movrr(as, ir, desthi, RID_RETHI);\r\n    if (destlo != RID_RETLO) emit_movrr(as, ir, destlo, RID_RETLO);\r\n  }\r\n  /* Restore spill slots (if any). */\r\n  if (ra_hasspill((ir+1)->s)) ra_save(as, ir+1, RID_RETHI);\r\n  if (ra_hasspill(ir->s)) ra_save(as, ir, RID_RETLO);\r\n}\r\n#endif\r\n\r\n/* -- Snapshot handling --------- ----------------------------------------- */\r\n\r\n/* Can we rematerialize a KNUM instead of forcing a spill? */\r\nstatic int asm_snap_canremat(ASMState *as)\r\n{\r\n  Reg r;\r\n  for (r = RID_MIN_FPR; r < RID_MAX_FPR; r++)\r\n    if (irref_isk(regcost_ref(as->cost[r])))\r\n      return 1;\r\n  return 0;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. */\r\nstatic int asm_sunk_store(ASMState *as, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->s == 255) {\r\n    if (irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\tirs->o == IR_FSTORE || irs->o == IR_XSTORE) {\r\n      IRIns *irk = IR(irs->op1);\r\n      if (irk->o == IR_AREF || irk->o == IR_HREFK)\r\n\tirk = IR(irk->op1);\r\n      return (IR(irk->op1) == ira);\r\n    }\r\n    return 0;\r\n  } else {\r\n    return (ira + irs->s == irs);  /* Quick check. */\r\n  }\r\n}\r\n\r\n/* Allocate register or spill slot for a ref that escapes to a snapshot. */\r\nstatic void asm_snap_alloc1(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (!irref_isk(ref) && (!(ra_used(ir) || ir->r == RID_SUNK))) {\r\n    if (ir->r == RID_SINK) {\r\n      ir->r = RID_SUNK;\r\n#if LJ_HASFFI\r\n      if (ir->o == IR_CNEWI) {  /* Allocate CNEWI value. */\r\n\tasm_snap_alloc1(as, ir->op2);\r\n\tif (LJ_32 && (ir+1)->o == IR_HIOP)\r\n\t  asm_snap_alloc1(as, (ir+1)->op2);\r\n      } else\r\n#endif\r\n      {  /* Allocate stored values for TNEW, TDUP and CNEW. */\r\n\tIRIns *irs;\r\n\tlua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP || ir->o == IR_CNEW);\r\n\tfor (irs = IR(as->snapref-1); irs > ir; irs--)\r\n\t  if (irs->r == RID_SINK && asm_sunk_store(as, ir, irs)) {\r\n\t    lua_assert(irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\t\t       irs->o == IR_FSTORE || irs->o == IR_XSTORE);\r\n\t    asm_snap_alloc1(as, irs->op2);\r\n\t    if (LJ_32 && (irs+1)->o == IR_HIOP)\r\n\t      asm_snap_alloc1(as, (irs+1)->op2);\r\n\t  }\r\n      }\r\n    } else {\r\n      RegSet allow;\r\n      if (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT) {\r\n\tIRIns *irc;\r\n\tfor (irc = IR(as->curins); irc > ir; irc--)\r\n\t  if ((irc->op1 == ref || irc->op2 == ref) &&\r\n\t      !(irc->r == RID_SINK || irc->r == RID_SUNK))\r\n\t    goto nosink;  /* Don't sink conversion if result is used. */\r\n\tasm_snap_alloc1(as, ir->op1);\r\n\treturn;\r\n      }\r\n    nosink:\r\n      allow = (!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR;\r\n      if ((as->freeset & allow) ||\r\n\t       (allow == RSET_FPR && asm_snap_canremat(as))) {\r\n\t/* Get a weak register if we have a free one or can rematerialize. */\r\n\tReg r = ra_allocref(as, ref, allow);  /* Allocate a register. */\r\n\tif (!irt_isphi(ir->t))\r\n\t  ra_weak(as, r);  /* But mark it as weakly referenced. */\r\n\tcheckmclim(as);\r\n\tRA_DBGX((as, \"snapreg   $f $r\", ref, ir->r));\r\n      } else {\r\n\tra_spill(as, ir);  /* Otherwise force a spill slot. */\r\n\tRA_DBGX((as, \"snapspill $f $s\", ref, ir->s));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Allocate refs escaping to a snapshot. */\r\nstatic void asm_snap_alloc(ASMState *as)\r\n{\r\n  SnapShot *snap = &as->T->snap[as->snapno];\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRRef ref = snap_ref(sn);\r\n    if (!irref_isk(ref)) {\r\n      asm_snap_alloc1(as, ref);\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM)) {\r\n\tlua_assert(irt_type(IR(ref+1)->t) == IRT_SOFTFP);\r\n\tasm_snap_alloc1(as, ref+1);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* All guards for a snapshot use the same exitno. This is currently the\r\n** same as the snapshot number. Since the exact origin of the exit cannot\r\n** be determined, all guards for the same snapshot must exit with the same\r\n** RegSP mapping.\r\n** A renamed ref which has been used in a prior guard for the same snapshot\r\n** would cause an inconsistency. The easy way out is to force a spill slot.\r\n*/\r\nstatic int asm_snap_checkrename(ASMState *as, IRRef ren)\r\n{\r\n  SnapShot *snap = &as->T->snap[as->snapno];\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRRef ref = snap_ref(sn);\r\n    if (ref == ren || (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && ++ref == ren)) {\r\n      IRIns *ir = IR(ref);\r\n      ra_spill(as, ir);  /* Register renamed, so force a spill slot. */\r\n      RA_DBGX((as, \"snaprensp $f $s\", ref, ir->s));\r\n      return 1;  /* Found. */\r\n    }\r\n  }\r\n  return 0;  /* Not found. */\r\n}\r\n\r\n/* Prepare snapshot for next guard instruction. */\r\nstatic void asm_snap_prep(ASMState *as)\r\n{\r\n  if (as->curins < as->snapref) {\r\n    do {\r\n      if (as->snapno == 0) return;  /* Called by sunk stores before snap #0. */\r\n      as->snapno--;\r\n      as->snapref = as->T->snap[as->snapno].ref;\r\n    } while (as->curins < as->snapref);\r\n    asm_snap_alloc(as);\r\n    as->snaprename = as->T->nins;\r\n  } else {\r\n    /* Process any renames above the highwater mark. */\r\n    for (; as->snaprename < as->T->nins; as->snaprename++) {\r\n      IRIns *ir = IR(as->snaprename);\r\n      if (asm_snap_checkrename(as, ir->op1))\r\n\tir->op2 = REF_BIAS-1;  /* Kill rename. */\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Miscellaneous helpers ----------------------------------------------- */\r\n\r\n/* Calculate stack adjustment. */\r\nstatic int32_t asm_stack_adjust(ASMState *as)\r\n{\r\n  if (as->evenspill <= SPS_FIXED)\r\n    return 0;\r\n  return sps_scale(sps_align(as->evenspill));\r\n}\r\n\r\n/* Must match with hash*() in lj_tab.c. */\r\nstatic uint32_t ir_khash(IRIns *ir)\r\n{\r\n  uint32_t lo, hi;\r\n  if (irt_isstr(ir->t)) {\r\n    return ir_kstr(ir)->hash;\r\n  } else if (irt_isnum(ir->t)) {\r\n    lo = ir_knum(ir)->u32.lo;\r\n    hi = ir_knum(ir)->u32.hi << 1;\r\n  } else if (irt_ispri(ir->t)) {\r\n    lua_assert(!irt_isnil(ir->t));\r\n    return irt_type(ir->t)-IRT_FALSE;\r\n  } else {\r\n    lua_assert(irt_isgcv(ir->t));\r\n    lo = u32ptr(ir_kgc(ir));\r\n    hi = lo + HASH_BIAS;\r\n  }\r\n  return hashrot(lo, hi);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args);\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci);\r\n\r\nstatic void asm_snew(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_str_new];\r\n  IRRef args[3];\r\n  args[0] = ASMREF_L;  /* lua_State *L    */\r\n  args[1] = ir->op1;   /* const char *str */\r\n  args[2] = ir->op2;   /* size_t len      */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCstr * */\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_tnew(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_new1];\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;     /* lua_State *L    */\r\n  args[1] = ASMREF_TMP1;  /* uint32_t ahsize */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCtab * */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, ir->op1 | (ir->op2 << 24), ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n\r\nstatic void asm_tdup(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_dup];\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;  /* lua_State *L    */\r\n  args[1] = ir->op1;   /* const GCtab *kt */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCtab * */\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_gc_check(ASMState *as);\r\n\r\n/* Explicit GC step. */\r\nstatic void asm_gcstep(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *ira;\r\n  for (ira = IR(as->stopins+1); ira < ir; ira++)\r\n    if ((ira->o == IR_TNEW || ira->o == IR_TDUP ||\r\n\t (LJ_HASFFI && (ira->o == IR_CNEW || ira->o == IR_CNEWI))) &&\r\n\tra_used(ira))\r\n      as->gcsteps++;\r\n  if (as->gcsteps)\r\n    asm_gc_check(as);\r\n  as->gcsteps = 0x80000000;  /* Prevent implicit GC check further up. */\r\n}\r\n\r\n/* -- Buffer operations --------------------------------------------------- */\r\n\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref);\r\n\r\nstatic void asm_bufhdr(ASMState *as, IRIns *ir)\r\n{\r\n  Reg sb = ra_dest(as, ir, RSET_GPR);\r\n  if ((ir->op2 & IRBUFHDR_APPEND)) {\r\n    /* Rematerialize const buffer pointer instead of likely spill. */\r\n    IRIns *irp = IR(ir->op1);\r\n    if (!(ra_hasreg(irp->r) || irp == ir-1 ||\r\n\t  (irp == ir-2 && !ra_used(ir-1)))) {\r\n      while (!(irp->o == IR_BUFHDR && !(irp->op2 & IRBUFHDR_APPEND)))\r\n\tirp = IR(irp->op1);\r\n      if (irref_isk(irp->op1)) {\r\n\tra_weak(as, ra_allocref(as, ir->op1, RSET_GPR));\r\n\tir = irp;\r\n      }\r\n    }\r\n  } else {\r\n    Reg tmp = ra_scratch(as, rset_exclude(RSET_GPR, sb));\r\n    /* Passing ir isn't strictly correct, but it's an IRT_P32, too. */\r\n    emit_storeofs(as, ir, tmp, sb, offsetof(SBuf, p));\r\n    emit_loadofs(as, ir, tmp, sb, offsetof(SBuf, b));\r\n  }\r\n#if LJ_TARGET_X86ORX64\r\n  ra_left(as, sb, ir->op1);\r\n#else\r\n  ra_leftov(as, sb, ir->op1);\r\n#endif\r\n}\r\n\r\nstatic void asm_bufput(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_buf_putstr];\r\n  IRRef args[3];\r\n  IRIns *irs;\r\n  int kchar = -1;\r\n  args[0] = ir->op1;  /* SBuf * */\r\n  args[1] = ir->op2;  /* GCstr * */\r\n  irs = IR(ir->op2);\r\n  lua_assert(irt_isstr(irs->t));\r\n  if (irs->o == IR_KGC) {\r\n    GCstr *s = ir_kstr(irs);\r\n    if (s->len == 1) {  /* Optimize put of single-char string constant. */\r\n      kchar = strdata(s)[0];\r\n      args[1] = ASMREF_TMP1;  /* int, truncated to char */\r\n      ci = &lj_ir_callinfo[IRCALL_lj_buf_putchar];\r\n    }\r\n  } else if (mayfuse(as, ir->op2) && ra_noreg(irs->r)) {\r\n    if (irs->o == IR_TOSTR) {  /* Fuse number to string conversions. */\r\n      if (irs->op2 == IRTOSTR_NUM) {\r\n\targs[1] = ASMREF_TMP1;  /* TValue * */\r\n\tci = &lj_ir_callinfo[IRCALL_lj_strfmt_putnum];\r\n      } else {\r\n\tlua_assert(irt_isinteger(IR(irs->op1)->t));\r\n\targs[1] = irs->op1;  /* int */\r\n\tif (irs->op2 == IRTOSTR_INT)\r\n\t  ci = &lj_ir_callinfo[IRCALL_lj_strfmt_putint];\r\n\telse\r\n\t  ci = &lj_ir_callinfo[IRCALL_lj_buf_putchar];\r\n      }\r\n    } else if (irs->o == IR_SNEW) {  /* Fuse string allocation. */\r\n      args[1] = irs->op1;  /* const void * */\r\n      args[2] = irs->op2;  /* MSize */\r\n      ci = &lj_ir_callinfo[IRCALL_lj_buf_putmem];\r\n    }\r\n  }\r\n  asm_setupresult(as, ir, ci);  /* SBuf * */\r\n  asm_gencall(as, ci, args);\r\n  if (args[1] == ASMREF_TMP1) {\r\n    Reg tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n    if (kchar == -1)\r\n      asm_tvptr(as, tmp, irs->op1);\r\n    else\r\n      ra_allockreg(as, kchar, tmp);\r\n  }\r\n}\r\n\r\nstatic void asm_bufstr(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_buf_tostr];\r\n  IRRef args[1];\r\n  args[0] = ir->op1;  /* SBuf *sb */\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCstr * */\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tostr(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci;\r\n  IRRef args[2];\r\n  args[0] = ASMREF_L;\r\n  as->gcsteps++;\r\n  if (ir->op2 == IRTOSTR_NUM) {\r\n    args[1] = ASMREF_TMP1;  /* cTValue * */\r\n    ci = &lj_ir_callinfo[IRCALL_lj_strfmt_num];\r\n  } else {\r\n    args[1] = ir->op1;  /* int32_t k */\r\n    if (ir->op2 == IRTOSTR_INT)\r\n      ci = &lj_ir_callinfo[IRCALL_lj_strfmt_int];\r\n    else\r\n      ci = &lj_ir_callinfo[IRCALL_lj_strfmt_char];\r\n  }\r\n  asm_setupresult(as, ir, ci);  /* GCstr * */\r\n  asm_gencall(as, ci, args);\r\n  if (ir->op2 == IRTOSTR_NUM)\r\n    asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op1);\r\n}\r\n\r\n#if LJ_32 && LJ_HASFFI && !LJ_SOFTFP && !LJ_TARGET_X86\r\nstatic void asm_conv64(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  IRCallID id;\r\n  IRRef args[2];\r\n  lua_assert((ir-1)->o == IR_CONV && ir->o == IR_HIOP);\r\n  args[LJ_BE] = (ir-1)->op1;\r\n  args[LJ_LE] = ir->op1;\r\n  if (st == IRT_NUM || st == IRT_FLOAT) {\r\n    id = IRCALL_fp64_d2l + ((st == IRT_FLOAT) ? 2 : 0) + (dt - IRT_I64);\r\n    ir--;\r\n  } else {\r\n    id = IRCALL_fp64_l2d + ((dt == IRT_FLOAT) ? 2 : 0) + (st - IRT_I64);\r\n  }\r\n  {\r\n#if LJ_TARGET_ARM && !LJ_ABI_SOFTFP\r\n    CCallInfo cim = lj_ir_callinfo[id], *ci = &cim;\r\n    cim.flags |= CCI_VARARG;  /* These calls don't use the hard-float ABI! */\r\n#else\r\n    const CCallInfo *ci = &lj_ir_callinfo[id];\r\n#endif\r\n    asm_setupresult(as, ir, ci);\r\n    asm_gencall(as, ci, args);\r\n  }\r\n}\r\n#endif\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\nstatic void asm_newref(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_tab_newkey];\r\n  IRRef args[3];\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ir->op1;      /* GCtab *t     */\r\n  args[2] = ASMREF_TMP1;  /* cTValue *key */\r\n  asm_setupresult(as, ir, ci);  /* TValue * */\r\n  asm_gencall(as, ci, args);\r\n  asm_tvptr(as, ra_releasetmp(as, ASMREF_TMP1), ir->op2);\r\n}\r\n\r\nstatic void asm_lref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg r = ra_dest(as, ir, RSET_GPR);\r\n#if LJ_TARGET_X86ORX64\r\n  ra_left(as, r, ASMREF_L);\r\n#else\r\n  ra_leftov(as, r, ASMREF_L);\r\n#endif\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Collect arguments from CALL* and CARG instructions. */\r\nstatic void asm_collectargs(ASMState *as, IRIns *ir,\r\n\t\t\t    const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n = CCI_XNARGS(ci);\r\n  lua_assert(n <= CCI_NARGS_MAX*2);  /* Account for split args. */\r\n  if ((ci->flags & CCI_L)) { *args++ = ASMREF_L; n--; }\r\n  while (n-- > 1) {\r\n    ir = IR(ir->op1);\r\n    lua_assert(ir->o == IR_CARG);\r\n    args[n] = ir->op2 == REF_NIL ? 0 : ir->op2;\r\n  }\r\n  args[0] = ir->op1 == REF_NIL ? 0 : ir->op1;\r\n  lua_assert(IR(ir->op1)->o != IR_CARG);\r\n}\r\n\r\n/* Reconstruct CCallInfo flags for CALLX*. */\r\nstatic uint32_t asm_callx_flags(ASMState *as, IRIns *ir)\r\n{\r\n  uint32_t nargs = 0;\r\n  if (ir->op1 != REF_NIL) {  /* Count number of arguments first. */\r\n    IRIns *ira = IR(ir->op1);\r\n    nargs++;\r\n    while (ira->o == IR_CARG) { nargs++; ira = IR(ira->op1); }\r\n  }\r\n#if LJ_HASFFI\r\n  if (IR(ir->op2)->o == IR_CARG) {  /* Copy calling convention info. */\r\n    CTypeID id = (CTypeID)IR(IR(ir->op2)->op2)->i;\r\n    CType *ct = ctype_get(ctype_ctsG(J2G(as->J)), id);\r\n    nargs |= ((ct->info & CTF_VARARG) ? CCI_VARARG : 0);\r\n#if LJ_TARGET_X86\r\n    nargs |= (ctype_cconv(ct->info) << CCI_CC_SHIFT);\r\n#endif\r\n  }\r\n#endif\r\n  return (nargs | (ir->t.irt << CCI_OTSHIFT));\r\n}\r\n\r\nstatic void asm_callid(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  IRRef args[2];\r\n  args[0] = ir->op1;\r\n  args[1] = ir->op2;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic void asm_call(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX];\r\n  const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n  asm_collectargs(as, ir, ci, args);\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_fppow(ASMState *as, IRIns *ir, IRRef lref, IRRef rref)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_pow];\r\n  IRRef args[2];\r\n  args[0] = lref;\r\n  args[1] = rref;\r\n  asm_setupresult(as, ir, ci);\r\n  asm_gencall(as, ci, args);\r\n}\r\n\r\nstatic int asm_fpjoin_pow(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irp = IR(ir->op1);\r\n  if (irp == ir-1 && irp->o == IR_MUL && !ra_used(irp)) {\r\n    IRIns *irpp = IR(irp->op1);\r\n    if (irpp == ir-2 && irpp->o == IR_FPMATH &&\r\n\tirpp->op2 == IRFPM_LOG2 && !ra_used(irpp)) {\r\n      asm_fppow(as, ir, irpp->op1, irp->op2);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* -- PHI and loop handling ----------------------------------------------- */\r\n\r\n/* Break a PHI cycle by renaming to a free register (evict if needed). */\r\nstatic void asm_phi_break(ASMState *as, RegSet blocked, RegSet blockedby,\r\n\t\t\t  RegSet allow)\r\n{\r\n  RegSet candidates = blocked & allow;\r\n  if (candidates) {  /* If this register file has candidates. */\r\n    /* Note: the set for ra_pick cannot be empty, since each register file\r\n    ** has some registers never allocated to PHIs.\r\n    */\r\n    Reg down, up = ra_pick(as, ~blocked & allow);  /* Get a free register. */\r\n    if (candidates & ~blockedby)  /* Optimize shifts, else it's a cycle. */\r\n      candidates = candidates & ~blockedby;\r\n    down = rset_picktop(candidates);  /* Pick candidate PHI register. */\r\n    ra_rename(as, down, up);  /* And rename it to the free register. */\r\n  }\r\n}\r\n\r\n/* PHI register shuffling.\r\n**\r\n** The allocator tries hard to preserve PHI register assignments across\r\n** the loop body. Most of the time this loop does nothing, since there\r\n** are no register mismatches.\r\n**\r\n** If a register mismatch is detected and ...\r\n** - the register is currently free: rename it.\r\n** - the register is blocked by an invariant: restore/remat and rename it.\r\n** - Otherwise the register is used by another PHI, so mark it as blocked.\r\n**\r\n** The renames are order-sensitive, so just retry the loop if a register\r\n** is marked as blocked, but has been freed in the meantime. A cycle is\r\n** detected if all of the blocked registers are allocated. To break the\r\n** cycle rename one of them to a free register and retry.\r\n**\r\n** Note that PHI spill slots are kept in sync and don't need to be shuffled.\r\n*/\r\nstatic void asm_phi_shuffle(ASMState *as)\r\n{\r\n  RegSet work;\r\n\r\n  /* Find and resolve PHI register mismatches. */\r\n  for (;;) {\r\n    RegSet blocked = RSET_EMPTY;\r\n    RegSet blockedby = RSET_EMPTY;\r\n    RegSet phiset = as->phiset;\r\n    while (phiset) {  /* Check all left PHI operand registers. */\r\n      Reg r = rset_pickbot(phiset);\r\n      IRIns *irl = IR(as->phireg[r]);\r\n      Reg left = irl->r;\r\n      if (r != left) {  /* Mismatch? */\r\n\tif (!rset_test(as->freeset, r)) {  /* PHI register blocked? */\r\n\t  IRRef ref = regcost_ref(as->cost[r]);\r\n\t  /* Blocked by other PHI (w/reg)? */\r\n\t  if (!ra_iskref(ref) && irt_ismarked(IR(ref)->t)) {\r\n\t    rset_set(blocked, r);\r\n\t    if (ra_hasreg(left))\r\n\t      rset_set(blockedby, left);\r\n\t    left = RID_NONE;\r\n\t  } else {  /* Otherwise grab register from invariant. */\r\n\t    ra_restore(as, ref);\r\n\t    checkmclim(as);\r\n\t  }\r\n\t}\r\n\tif (ra_hasreg(left)) {\r\n\t  ra_rename(as, left, r);\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n      rset_clear(phiset, r);\r\n    }\r\n    if (!blocked) break;  /* Finished. */\r\n    if (!(as->freeset & blocked)) {  /* Break cycles if none are free. */\r\n      asm_phi_break(as, blocked, blockedby, RSET_GPR);\r\n      if (!LJ_SOFTFP) asm_phi_break(as, blocked, blockedby, RSET_FPR);\r\n      checkmclim(as);\r\n    }  /* Else retry some more renames. */\r\n  }\r\n\r\n  /* Restore/remat invariants whose registers are modified inside the loop. */\r\n#if !LJ_SOFTFP\r\n  work = as->modset & ~(as->freeset | as->phiset) & RSET_FPR;\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n#endif\r\n  work = as->modset & ~(as->freeset | as->phiset);\r\n  while (work) {\r\n    Reg r = rset_pickbot(work);\r\n    ra_restore(as, regcost_ref(as->cost[r]));\r\n    rset_clear(work, r);\r\n    checkmclim(as);\r\n  }\r\n\r\n  /* Allocate and save all unsaved PHI regs and clear marks. */\r\n  work = as->phiset;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef lref = as->phireg[r];\r\n    IRIns *ir = IR(lref);\r\n    if (ra_hasspill(ir->s)) {  /* Left PHI gained a spill slot? */\r\n      irt_clearmark(ir->t);  /* Handled here, so clear marker now. */\r\n      ra_alloc1(as, lref, RID2RSET(r));\r\n      ra_save(as, ir, r);  /* Save to spill slot inside the loop. */\r\n      checkmclim(as);\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n/* Copy unsynced left/right PHI spill slots. Rarely needed. */\r\nstatic void asm_phi_copyspill(ASMState *as)\r\n{\r\n  int need = 0;\r\n  IRIns *ir;\r\n  for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--)\r\n    if (ra_hasspill(ir->s) && ra_hasspill(IR(ir->op1)->s))\r\n      need |= irt_isfp(ir->t) ? 2 : 1;  /* Unsynced spill slot? */\r\n  if ((need & 1)) {  /* Copy integer spill slots. */\r\n#if !LJ_TARGET_X86ORX64\r\n    Reg r = RID_TMP;\r\n#else\r\n    Reg r = RID_RET;\r\n    if ((as->freeset & RSET_GPR))\r\n      r = rset_pickbot((as->freeset & RSET_GPR));\r\n    else\r\n      emit_spload(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n#endif\r\n    for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--) {\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRIns *irl = IR(ir->op1);\r\n\tif (ra_hasspill(irl->s) && !irt_isfp(ir->t)) {\r\n\t  emit_spstore(as, irl, r, sps_scale(irl->s));\r\n\t  emit_spload(as, ir, r, sps_scale(ir->s));\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spstore(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n#endif\r\n  }\r\n#if !LJ_SOFTFP\r\n  if ((need & 2)) {  /* Copy FP spill slots. */\r\n#if LJ_TARGET_X86\r\n    Reg r = RID_XMM0;\r\n#else\r\n    Reg r = RID_FPRET;\r\n#endif\r\n    if ((as->freeset & RSET_FPR))\r\n      r = rset_pickbot((as->freeset & RSET_FPR));\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spload(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n    for (ir = IR(as->orignins-1); ir->o == IR_PHI; ir--) {\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRIns *irl = IR(ir->op1);\r\n\tif (ra_hasspill(irl->s) && irt_isfp(ir->t)) {\r\n\t  emit_spstore(as, irl, r, sps_scale(irl->s));\r\n\t  emit_spload(as, ir, r, sps_scale(ir->s));\r\n\t  checkmclim(as);\r\n\t}\r\n      }\r\n    }\r\n    if (!rset_test(as->freeset, r))\r\n      emit_spstore(as, IR(regcost_ref(as->cost[r])), r, SPOFS_TMP);\r\n  }\r\n#endif\r\n}\r\n\r\n/* Emit renames for left PHIs which are only spilled outside the loop. */\r\nstatic void asm_phi_fixup(ASMState *as)\r\n{\r\n  RegSet work = as->phiset;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef lref = as->phireg[r];\r\n    IRIns *ir = IR(lref);\r\n    if (irt_ismarked(ir->t)) {\r\n      irt_clearmark(ir->t);\r\n      /* Left PHI gained a spill slot before the loop? */\r\n      if (ra_hasspill(ir->s)) {\r\n\tIRRef ren;\r\n\tlj_ir_set(as->J, IRT(IR_RENAME, IRT_NIL), lref, as->loopsnapno);\r\n\tren = tref_ref(lj_ir_emit(as->J));\r\n\tas->ir = as->T->ir;  /* The IR may have been reallocated. */\r\n\tIR(ren)->r = (uint8_t)r;\r\n\tIR(ren)->s = SPS_NONE;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n}\r\n\r\n/* Setup right PHI reference. */\r\nstatic void asm_phi(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = ((!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR) &\r\n\t\t ~as->phiset;\r\n  RegSet afree = (as->freeset & allow);\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  if (ir->r == RID_SINK)  /* Sink PHI. */\r\n    return;\r\n  /* Spill slot shuffling is not implemented yet (but rarely needed). */\r\n  if (ra_hasspill(irl->s) || ra_hasspill(irr->s))\r\n    lj_trace_err(as->J, LJ_TRERR_NYIPHI);\r\n  /* Leave at least one register free for non-PHIs (and PHI cycle breaking). */\r\n  if ((afree & (afree-1))) {  /* Two or more free registers? */\r\n    Reg r;\r\n    if (ra_noreg(irr->r)) {  /* Get a register for the right PHI. */\r\n      r = ra_allocref(as, ir->op2, allow);\r\n    } else {  /* Duplicate right PHI, need a copy (rare). */\r\n      r = ra_scratch(as, allow);\r\n      emit_movrr(as, irr, r, irr->r);\r\n    }\r\n    ir->r = (uint8_t)r;\r\n    rset_set(as->phiset, r);\r\n    as->phireg[r] = (IRRef1)ir->op1;\r\n    irt_setmark(irl->t);  /* Marks left PHIs _with_ register. */\r\n    if (ra_noreg(irl->r))\r\n      ra_sethint(irl->r, r); /* Set register hint for left PHI. */\r\n  } else {  /* Otherwise allocate a spill slot. */\r\n    /* This is overly restrictive, but it triggers only on synthetic code. */\r\n    if (ra_hasreg(irl->r) || ra_hasreg(irr->r))\r\n      lj_trace_err(as->J, LJ_TRERR_NYIPHI);\r\n    ra_spill(as, ir);\r\n    irr->s = ir->s;  /* Set right PHI spill slot. Sync left slot later. */\r\n  }\r\n}\r\n\r\nstatic void asm_loop_fixup(ASMState *as);\r\n\r\n/* Middle part of a loop. */\r\nstatic void asm_loop(ASMState *as)\r\n{\r\n  MCode *mcspill;\r\n  /* LOOP is a guard, so the snapno is up to date. */\r\n  as->loopsnapno = as->snapno;\r\n  if (as->gcsteps)\r\n    asm_gc_check(as);\r\n  /* LOOP marks the transition from the variant to the invariant part. */\r\n  as->flagmcp = as->invmcp = NULL;\r\n  as->sectref = 0;\r\n  if (!neverfuse(as)) as->fuseref = 0;\r\n  asm_phi_shuffle(as);\r\n  mcspill = as->mcp;\r\n  asm_phi_copyspill(as);\r\n  asm_loop_fixup(as);\r\n  as->mcloop = as->mcp;\r\n  RA_DBGX((as, \"===== LOOP =====\"));\r\n  if (!as->realign) RA_DBG_FLUSH();\r\n  if (as->mcp != mcspill)\r\n    emit_jmp(as, mcspill);\r\n}\r\n\r\n/* -- Target-specific assembler ------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_asm_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_asm_arm.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_asm_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_asm_mips.h\"\r\n#else\r\n#error \"Missing assembler for target CPU\"\r\n#endif\r\n\r\n/* -- Instruction dispatch ------------------------------------------------ */\r\n\r\n/* Assemble a single instruction. */\r\nstatic void asm_ir(ASMState *as, IRIns *ir)\r\n{\r\n  switch ((IROp)ir->o) {\r\n  /* Miscellaneous ops. */\r\n  case IR_LOOP: asm_loop(as); break;\r\n  case IR_NOP: case IR_XBAR: lua_assert(!ra_used(ir)); break;\r\n  case IR_USE:\r\n    ra_alloc1(as, ir->op1, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR); break;\r\n  case IR_PHI: asm_phi(as, ir); break;\r\n  case IR_HIOP: asm_hiop(as, ir); break;\r\n  case IR_GCSTEP: asm_gcstep(as, ir); break;\r\n  case IR_PROF: asm_prof(as, ir); break;\r\n\r\n  /* Guarded assertions. */\r\n  case IR_LT: case IR_GE: case IR_LE: case IR_GT:\r\n  case IR_ULT: case IR_UGE: case IR_ULE: case IR_UGT:\r\n  case IR_ABC:\r\n    asm_comp(as, ir);\r\n    break;\r\n  case IR_EQ: case IR_NE:\r\n    if ((ir-1)->o == IR_HREF && ir->op1 == as->curins-1) {\r\n      as->curins--;\r\n      asm_href(as, ir-1, (IROp)ir->o);\r\n    } else {\r\n      asm_equal(as, ir);\r\n    }\r\n    break;\r\n\r\n  case IR_RETF: asm_retf(as, ir); break;\r\n\r\n  /* Bit ops. */\r\n  case IR_BNOT: asm_bnot(as, ir); break;\r\n  case IR_BSWAP: asm_bswap(as, ir); break;\r\n  case IR_BAND: asm_band(as, ir); break;\r\n  case IR_BOR: asm_bor(as, ir); break;\r\n  case IR_BXOR: asm_bxor(as, ir); break;\r\n  case IR_BSHL: asm_bshl(as, ir); break;\r\n  case IR_BSHR: asm_bshr(as, ir); break;\r\n  case IR_BSAR: asm_bsar(as, ir); break;\r\n  case IR_BROL: asm_brol(as, ir); break;\r\n  case IR_BROR: asm_bror(as, ir); break;\r\n\r\n  /* Arithmetic ops. */\r\n  case IR_ADD: asm_add(as, ir); break;\r\n  case IR_SUB: asm_sub(as, ir); break;\r\n  case IR_MUL: asm_mul(as, ir); break;\r\n  case IR_DIV: asm_div(as, ir); break;\r\n  case IR_MOD: asm_mod(as, ir); break;\r\n  case IR_POW: asm_pow(as, ir); break;\r\n  case IR_NEG: asm_neg(as, ir); break;\r\n  case IR_ABS: asm_abs(as, ir); break;\r\n  case IR_ATAN2: asm_atan2(as, ir); break;\r\n  case IR_LDEXP: asm_ldexp(as, ir); break;\r\n  case IR_MIN: asm_min(as, ir); break;\r\n  case IR_MAX: asm_max(as, ir); break;\r\n  case IR_FPMATH: asm_fpmath(as, ir); break;\r\n\r\n  /* Overflow-checking arithmetic ops. */\r\n  case IR_ADDOV: asm_addov(as, ir); break;\r\n  case IR_SUBOV: asm_subov(as, ir); break;\r\n  case IR_MULOV: asm_mulov(as, ir); break;\r\n\r\n  /* Memory references. */\r\n  case IR_AREF: asm_aref(as, ir); break;\r\n  case IR_HREF: asm_href(as, ir, 0); break;\r\n  case IR_HREFK: asm_hrefk(as, ir); break;\r\n  case IR_NEWREF: asm_newref(as, ir); break;\r\n  case IR_UREFO: case IR_UREFC: asm_uref(as, ir); break;\r\n  case IR_FREF: asm_fref(as, ir); break;\r\n  case IR_STRREF: asm_strref(as, ir); break;\r\n  case IR_LREF: asm_lref(as, ir); break;\r\n\r\n  /* Loads and stores. */\r\n  case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n    asm_ahuvload(as, ir);\r\n    break;\r\n  case IR_FLOAD: asm_fload(as, ir); break;\r\n  case IR_XLOAD: asm_xload(as, ir); break;\r\n  case IR_SLOAD: asm_sload(as, ir); break;\r\n\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: asm_ahustore(as, ir); break;\r\n  case IR_FSTORE: asm_fstore(as, ir); break;\r\n  case IR_XSTORE: asm_xstore(as, ir); break;\r\n\r\n  /* Allocations. */\r\n  case IR_SNEW: case IR_XSNEW: asm_snew(as, ir); break;\r\n  case IR_TNEW: asm_tnew(as, ir); break;\r\n  case IR_TDUP: asm_tdup(as, ir); break;\r\n  case IR_CNEW: case IR_CNEWI: asm_cnew(as, ir); break;\r\n\r\n  /* Buffer operations. */\r\n  case IR_BUFHDR: asm_bufhdr(as, ir); break;\r\n  case IR_BUFPUT: asm_bufput(as, ir); break;\r\n  case IR_BUFSTR: asm_bufstr(as, ir); break;\r\n\r\n  /* Write barriers. */\r\n  case IR_TBAR: asm_tbar(as, ir); break;\r\n  case IR_OBAR: asm_obar(as, ir); break;\r\n\r\n  /* Type conversions. */\r\n  case IR_TOBIT: asm_tobit(as, ir); break;\r\n  case IR_CONV: asm_conv(as, ir); break;\r\n  case IR_TOSTR: asm_tostr(as, ir); break;\r\n  case IR_STRTO: asm_strto(as, ir); break;\r\n\r\n  /* Calls. */\r\n  case IR_CALLA:\r\n    as->gcsteps++;\r\n    /* fallthrough */\r\n  case IR_CALLN: case IR_CALLL: case IR_CALLS: asm_call(as, ir); break;\r\n  case IR_CALLXS: asm_callx(as, ir); break;\r\n  case IR_CARG: break;\r\n\r\n  default:\r\n    setintV(&as->J->errinfo, ir->o);\r\n    lj_trace_err_info(as->J, LJ_TRERR_NYIIR);\r\n    break;\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Head of a root trace. */\r\nstatic void asm_head_root(ASMState *as)\r\n{\r\n  int32_t spadj;\r\n  asm_head_root_base(as);\r\n  emit_setvmstate(as, (int32_t)as->T->traceno);\r\n  spadj = asm_stack_adjust(as);\r\n  as->T->spadjust = (uint16_t)spadj;\r\n  emit_spsub(as, spadj);\r\n  /* Root traces assume a checked stack for the starting proto. */\r\n  as->T->topslot = gcref(as->T->startpt)->pt.framesize;\r\n}\r\n\r\n/* Head of a side trace.\r\n**\r\n** The current simplistic algorithm requires that all slots inherited\r\n** from the parent are live in a register between pass 2 and pass 3. This\r\n** avoids the complexity of stack slot shuffling. But of course this may\r\n** overflow the register set in some cases and cause the dreaded error:\r\n** \"NYI: register coalescing too complex\". A refined algorithm is needed.\r\n*/\r\nstatic void asm_head_side(ASMState *as)\r\n{\r\n  IRRef1 sloadins[RID_MAX];\r\n  RegSet allow = RSET_ALL;  /* Inverse of all coalesced registers. */\r\n  RegSet live = RSET_EMPTY;  /* Live parent registers. */\r\n  IRIns *irp = &as->parent->ir[REF_BASE];  /* Parent base. */\r\n  int32_t spadj, spdelta;\r\n  int pass2 = 0;\r\n  int pass3 = 0;\r\n  IRRef i;\r\n\r\n  if (as->snapno && as->topslot > as->parent->topslot) {\r\n    /* Force snap #0 alloc to prevent register overwrite in stack check. */\r\n    as->snapno = 0;\r\n    asm_snap_alloc(as);\r\n  }\r\n  allow = asm_head_side_base(as, irp, allow);\r\n\r\n  /* Scan all parent SLOADs and collect register dependencies. */\r\n  for (i = as->stopins; i > REF_BASE; i--) {\r\n    IRIns *ir = IR(i);\r\n    RegSP rs;\r\n    lua_assert((ir->o == IR_SLOAD && (ir->op2 & IRSLOAD_PARENT)) ||\r\n\t       (LJ_SOFTFP && ir->o == IR_HIOP) || ir->o == IR_PVAL);\r\n    rs = as->parentmap[i - REF_FIRST];\r\n    if (ra_hasreg(ir->r)) {\r\n      rset_clear(allow, ir->r);\r\n      if (ra_hasspill(ir->s)) {\r\n\tra_save(as, ir, ir->r);\r\n\tcheckmclim(as);\r\n      }\r\n    } else if (ra_hasspill(ir->s)) {\r\n      irt_setmark(ir->t);\r\n      pass2 = 1;\r\n    }\r\n    if (ir->r == rs) {  /* Coalesce matching registers right now. */\r\n      ra_free(as, ir->r);\r\n    } else if (ra_hasspill(regsp_spill(rs))) {\r\n      if (ra_hasreg(ir->r))\r\n\tpass3 = 1;\r\n    } else if (ra_used(ir)) {\r\n      sloadins[rs] = (IRRef1)i;\r\n      rset_set(live, rs);  /* Block live parent register. */\r\n    }\r\n  }\r\n\r\n  /* Calculate stack frame adjustment. */\r\n  spadj = asm_stack_adjust(as);\r\n  spdelta = spadj - (int32_t)as->parent->spadjust;\r\n  if (spdelta < 0) {  /* Don't shrink the stack frame. */\r\n    spadj = (int32_t)as->parent->spadjust;\r\n    spdelta = 0;\r\n  }\r\n  as->T->spadjust = (uint16_t)spadj;\r\n\r\n  /* Reload spilled target registers. */\r\n  if (pass2) {\r\n    for (i = as->stopins; i > REF_BASE; i--) {\r\n      IRIns *ir = IR(i);\r\n      if (irt_ismarked(ir->t)) {\r\n\tRegSet mask;\r\n\tReg r;\r\n\tRegSP rs;\r\n\tirt_clearmark(ir->t);\r\n\trs = as->parentmap[i - REF_FIRST];\r\n\tif (!ra_hasspill(regsp_spill(rs)))\r\n\t  ra_sethint(ir->r, rs);  /* Hint may be gone, set it again. */\r\n\telse if (sps_scale(regsp_spill(rs))+spdelta == sps_scale(ir->s))\r\n\t  continue;  /* Same spill slot, do nothing. */\r\n\tmask = ((!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR) & allow;\r\n\tif (mask == RSET_EMPTY)\r\n\t  lj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n\tr = ra_allocref(as, i, mask);\r\n\tra_save(as, ir, r);\r\n\trset_clear(allow, r);\r\n\tif (r == rs) {  /* Coalesce matching registers right now. */\r\n\t  ra_free(as, r);\r\n\t  rset_clear(live, r);\r\n\t} else if (ra_hasspill(regsp_spill(rs))) {\r\n\t  pass3 = 1;\r\n\t}\r\n\tcheckmclim(as);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Store trace number and adjust stack frame relative to the parent. */\r\n  emit_setvmstate(as, (int32_t)as->T->traceno);\r\n  emit_spsub(as, spdelta);\r\n\r\n#if !LJ_TARGET_X86ORX64\r\n  /* Restore BASE register from parent spill slot. */\r\n  if (ra_hasspill(irp->s))\r\n    emit_spload(as, IR(REF_BASE), IR(REF_BASE)->r, sps_scale(irp->s));\r\n#endif\r\n\r\n  /* Restore target registers from parent spill slots. */\r\n  if (pass3) {\r\n    RegSet work = ~as->freeset & RSET_ALL;\r\n    while (work) {\r\n      Reg r = rset_pickbot(work);\r\n      IRRef ref = regcost_ref(as->cost[r]);\r\n      RegSP rs = as->parentmap[ref - REF_FIRST];\r\n      rset_clear(work, r);\r\n      if (ra_hasspill(regsp_spill(rs))) {\r\n\tint32_t ofs = sps_scale(regsp_spill(rs));\r\n\tra_free(as, r);\r\n\temit_spload(as, IR(ref), r, ofs);\r\n\tcheckmclim(as);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Shuffle registers to match up target regs with parent regs. */\r\n  for (;;) {\r\n    RegSet work;\r\n\r\n    /* Repeatedly coalesce free live registers by moving to their target. */\r\n    while ((work = as->freeset & live) != RSET_EMPTY) {\r\n      Reg rp = rset_pickbot(work);\r\n      IRIns *ir = IR(sloadins[rp]);\r\n      rset_clear(live, rp);\r\n      rset_clear(allow, rp);\r\n      ra_free(as, ir->r);\r\n      emit_movrr(as, ir, ir->r, rp);\r\n      checkmclim(as);\r\n    }\r\n\r\n    /* We're done if no live registers remain. */\r\n    if (live == RSET_EMPTY)\r\n      break;\r\n\r\n    /* Break cycles by renaming one target to a temp. register. */\r\n    if (live & RSET_GPR) {\r\n      RegSet tmpset = as->freeset & ~live & allow & RSET_GPR;\r\n      if (tmpset == RSET_EMPTY)\r\n\tlj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n      ra_rename(as, rset_pickbot(live & RSET_GPR), rset_pickbot(tmpset));\r\n    }\r\n    if (!LJ_SOFTFP && (live & RSET_FPR)) {\r\n      RegSet tmpset = as->freeset & ~live & allow & RSET_FPR;\r\n      if (tmpset == RSET_EMPTY)\r\n\tlj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n      ra_rename(as, rset_pickbot(live & RSET_FPR), rset_pickbot(tmpset));\r\n    }\r\n    checkmclim(as);\r\n    /* Continue with coalescing to fix up the broken cycle(s). */\r\n  }\r\n\r\n  /* Inherit top stack slot already checked by parent trace. */\r\n  as->T->topslot = as->parent->topslot;\r\n  if (as->topslot > as->T->topslot) {  /* Need to check for higher slot? */\r\n#ifdef EXITSTATE_CHECKEXIT\r\n    /* Highest exit + 1 indicates stack check. */\r\n    ExitNo exitno = as->T->nsnap;\r\n#else\r\n    /* Reuse the parent exit in the context of the parent trace. */\r\n    ExitNo exitno = as->J->exitno;\r\n#endif\r\n    as->T->topslot = (uint8_t)as->topslot;  /* Remember for child traces. */\r\n    asm_stack_check(as, as->topslot, irp, allow & RSET_GPR, exitno);\r\n  }\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Get base slot for a snapshot. */\r\nstatic BCReg asm_baseslot(ASMState *as, SnapShot *snap, int *gotframe)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  MSize n;\r\n  for (n = snap->nent; n > 0; n--) {\r\n    SnapEntry sn = map[n-1];\r\n    if ((sn & SNAP_FRAME)) {\r\n      *gotframe = 1;\r\n      return snap_slot(sn);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Link to another trace. */\r\nstatic void asm_tail_link(ASMState *as)\r\n{\r\n  SnapNo snapno = as->T->nsnap-1;  /* Last snapshot. */\r\n  SnapShot *snap = &as->T->snap[snapno];\r\n  int gotframe = 0;\r\n  BCReg baseslot = asm_baseslot(as, snap, &gotframe);\r\n\r\n  as->topslot = snap->topslot;\r\n  checkmclim(as);\r\n  ra_allocref(as, REF_BASE, RID2RSET(RID_BASE));\r\n\r\n  if (as->T->link == 0) {\r\n    /* Setup fixed registers for exit to interpreter. */\r\n    const BCIns *pc = snap_pc(as->T->snapmap[snap->mapofs + snap->nent]);\r\n    int32_t mres;\r\n    if (bc_op(*pc) == BC_JLOOP) {  /* NYI: find a better way to do this. */\r\n      BCIns *retpc = &traceref(as->J, bc_d(*pc))->startins;\r\n      if (bc_isret(bc_op(*retpc)))\r\n\tpc = retpc;\r\n    }\r\n    ra_allockreg(as, i32ptr(J2GG(as->J)->dispatch), RID_DISPATCH);\r\n    ra_allockreg(as, i32ptr(pc), RID_LPC);\r\n    mres = (int32_t)(snap->nslots - baseslot);\r\n    switch (bc_op(*pc)) {\r\n    case BC_CALLM: case BC_CALLMT:\r\n      mres -= (int32_t)(1 + LJ_FR2 + bc_a(*pc) + bc_c(*pc)); break;\r\n    case BC_RETM: mres -= (int32_t)(bc_a(*pc) + bc_d(*pc)); break;\r\n    case BC_TSETM: mres -= (int32_t)bc_a(*pc); break;\r\n    default: if (bc_op(*pc) < BC_FUNCF) mres = 0; break;\r\n    }\r\n    ra_allockreg(as, mres, RID_RET);  /* Return MULTRES or 0. */\r\n  } else if (baseslot) {\r\n    /* Save modified BASE for linking to trace with higher start frame. */\r\n    emit_setgl(as, RID_BASE, jit_base);\r\n  }\r\n  emit_addptr(as, RID_BASE, 8*(int32_t)baseslot);\r\n\r\n  /* Sync the interpreter state with the on-trace state. */\r\n  asm_stack_restore(as, snap);\r\n\r\n  /* Root traces that add frames need to check the stack at the end. */\r\n  if (!as->parent && gotframe)\r\n    asm_stack_check(as, as->topslot, NULL, as->freeset & RSET_GPR, snapno);\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Clear reg/sp for all instructions and add register hints. */\r\nstatic void asm_setup_regsp(ASMState *as)\r\n{\r\n  GCtrace *T = as->T;\r\n  int sink = T->sinktags;\r\n  IRRef nins = T->nins;\r\n  IRIns *ir, *lastir;\r\n  int inloop;\r\n#if LJ_TARGET_ARM\r\n  uint32_t rload = 0xa6402a64;\r\n#endif\r\n\r\n  ra_setup(as);\r\n\r\n  /* Clear reg/sp for constants. */\r\n  for (ir = IR(T->nk), lastir = IR(REF_BASE); ir < lastir; ir++)\r\n    ir->prev = REGSP_INIT;\r\n\r\n  /* REF_BASE is used for implicit references to the BASE register. */\r\n  lastir->prev = REGSP_HINT(RID_BASE);\r\n\r\n  ir = IR(nins-1);\r\n  if (ir->o == IR_RENAME) {\r\n    do { ir--; nins--; } while (ir->o == IR_RENAME);\r\n    T->nins = nins;  /* Remove any renames left over from ASM restart. */\r\n  }\r\n  as->snaprename = nins;\r\n  as->snapref = nins;\r\n  as->snapno = T->nsnap;\r\n\r\n  as->stopins = REF_BASE;\r\n  as->orignins = nins;\r\n  as->curins = nins;\r\n\r\n  /* Setup register hints for parent link instructions. */\r\n  ir = IR(REF_FIRST);\r\n  if (as->parent) {\r\n    uint16_t *p;\r\n    lastir = lj_snap_regspmap(as->parent, as->J->exitno, ir);\r\n    if (lastir - ir > LJ_MAX_JSLOTS)\r\n      lj_trace_err(as->J, LJ_TRERR_NYICOAL);\r\n    as->stopins = (IRRef)((lastir-1) - as->ir);\r\n    for (p = as->parentmap; ir < lastir; ir++) {\r\n      RegSP rs = ir->prev;\r\n      *p++ = (uint16_t)rs;  /* Copy original parent RegSP to parentmap. */\r\n      if (!ra_hasspill(regsp_spill(rs)))\r\n\tir->prev = (uint16_t)REGSP_HINT(regsp_reg(rs));\r\n      else\r\n\tir->prev = REGSP_INIT;\r\n    }\r\n  }\r\n\r\n  inloop = 0;\r\n  as->evenspill = SPS_FIRST;\r\n  for (lastir = IR(nins); ir < lastir; ir++) {\r\n    if (sink) {\r\n      if (ir->r == RID_SINK)\r\n\tcontinue;\r\n      if (ir->r == RID_SUNK) {  /* Revert after ASM restart. */\r\n\tir->r = RID_SINK;\r\n\tcontinue;\r\n      }\r\n    }\r\n    switch (ir->o) {\r\n    case IR_LOOP:\r\n      inloop = 1;\r\n      break;\r\n#if LJ_TARGET_ARM\r\n    case IR_SLOAD:\r\n      if (!((ir->op2 & IRSLOAD_TYPECHECK) || (ir+1)->o == IR_HIOP))\r\n\tbreak;\r\n      /* fallthrough */\r\n    case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n      if (!LJ_SOFTFP && irt_isnum(ir->t)) break;\r\n      ir->prev = (uint16_t)REGSP_HINT((rload & 15));\r\n      rload = lj_ror(rload, 4);\r\n      continue;\r\n#endif\r\n    case IR_CALLXS: {\r\n      CCallInfo ci;\r\n      ci.flags = asm_callx_flags(as, ir);\r\n      ir->prev = asm_setup_call_slots(as, ir, &ci);\r\n      if (inloop)\r\n\tas->modset |= RSET_SCRATCH;\r\n      continue;\r\n      }\r\n    case IR_CALLN: case IR_CALLA: case IR_CALLL: case IR_CALLS: {\r\n      const CCallInfo *ci = &lj_ir_callinfo[ir->op2];\r\n      ir->prev = asm_setup_call_slots(as, ir, ci);\r\n      if (inloop)\r\n\tas->modset |= (ci->flags & CCI_NOFPRCLOBBER) ?\r\n\t\t      (RSET_SCRATCH & ~RSET_FPR) : RSET_SCRATCH;\r\n      continue;\r\n      }\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n    case IR_HIOP:\r\n      switch ((ir-1)->o) {\r\n#if LJ_SOFTFP && LJ_TARGET_ARM\r\n      case IR_SLOAD: case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n\tif (ra_hashint((ir-1)->r)) {\r\n\t  ir->prev = (ir-1)->prev + 1;\r\n\t  continue;\r\n\t}\r\n\tbreak;\r\n#endif\r\n#if !LJ_SOFTFP && LJ_NEED_FP64\r\n      case IR_CONV:\r\n\tif (irt_isfp((ir-1)->t)) {\r\n\t  ir->prev = REGSP_HINT(RID_FPRET);\r\n\t  continue;\r\n\t}\r\n\t/* fallthrough */\r\n#endif\r\n      case IR_CALLN: case IR_CALLXS:\r\n#if LJ_SOFTFP\r\n      case IR_MIN: case IR_MAX:\r\n#endif\r\n\t(ir-1)->prev = REGSP_HINT(RID_RETLO);\r\n\tir->prev = REGSP_HINT(RID_RETHI);\r\n\tcontinue;\r\n      default:\r\n\tbreak;\r\n      }\r\n      break;\r\n#endif\r\n#if LJ_SOFTFP\r\n    case IR_MIN: case IR_MAX:\r\n      if ((ir+1)->o != IR_HIOP) break;\r\n      /* fallthrough */\r\n#endif\r\n    /* C calls evict all scratch regs and return results in RID_RET. */\r\n    case IR_SNEW: case IR_XSNEW: case IR_NEWREF: case IR_BUFPUT:\r\n      if (REGARG_NUMGPR < 3 && as->evenspill < 3)\r\n\tas->evenspill = 3;  /* lj_str_new and lj_tab_newkey need 3 args. */\r\n#if LJ_TARGET_X86 && LJ_HASFFI\r\n      if (0) {\r\n    case IR_CNEW:\r\n\tif (ir->op2 != REF_NIL && as->evenspill < 4)\r\n\t  as->evenspill = 4;  /* lj_cdata_newv needs 4 args. */\r\n      }\r\n#else\r\n    case IR_CNEW:\r\n#endif\r\n    case IR_TNEW: case IR_TDUP: case IR_CNEWI: case IR_TOSTR:\r\n    case IR_BUFSTR:\r\n      ir->prev = REGSP_HINT(RID_RET);\r\n      if (inloop)\r\n\tas->modset = RSET_SCRATCH;\r\n      continue;\r\n    case IR_STRTO: case IR_OBAR:\r\n      if (inloop)\r\n\tas->modset = RSET_SCRATCH;\r\n      break;\r\n#if !LJ_SOFTFP\r\n    case IR_ATAN2:\r\n#if LJ_TARGET_X86\r\n      if (as->evenspill < 4)  /* Leave room to call atan2(). */\r\n\tas->evenspill = 4;\r\n#endif\r\n#if !LJ_TARGET_X86ORX64\r\n    case IR_LDEXP:\r\n#endif\r\n#endif\r\n    case IR_POW:\r\n      if (!LJ_SOFTFP && irt_isnum(ir->t)) {\r\n\tif (inloop)\r\n\t  as->modset |= RSET_SCRATCH;\r\n#if LJ_TARGET_X86\r\n\tbreak;\r\n#else\r\n\tir->prev = REGSP_HINT(RID_FPRET);\r\n\tcontinue;\r\n#endif\r\n      }\r\n      /* fallthrough for integer POW */\r\n    case IR_DIV: case IR_MOD:\r\n      if (!irt_isnum(ir->t)) {\r\n\tir->prev = REGSP_HINT(RID_RET);\r\n\tif (inloop)\r\n\t  as->modset |= (RSET_SCRATCH & RSET_GPR);\r\n\tcontinue;\r\n      }\r\n      break;\r\n    case IR_FPMATH:\r\n#if LJ_TARGET_X86ORX64\r\n      if (ir->op2 <= IRFPM_TRUNC) {\r\n\tif (!(as->flags & JIT_F_SSE4_1)) {\r\n\t  ir->prev = REGSP_HINT(RID_XMM0);\r\n\t  if (inloop)\r\n\t    as->modset |= RSET_RANGE(RID_XMM0, RID_XMM3+1)|RID2RSET(RID_EAX);\r\n\t  continue;\r\n\t}\r\n\tbreak;\r\n      } else if (ir->op2 == IRFPM_EXP2 && !LJ_64) {\r\n\tif (as->evenspill < 4)  /* Leave room to call pow(). */\r\n\t  as->evenspill = 4;\r\n      }\r\n#endif\r\n      if (inloop)\r\n\tas->modset |= RSET_SCRATCH;\r\n#if LJ_TARGET_X86\r\n      break;\r\n#else\r\n      ir->prev = REGSP_HINT(RID_FPRET);\r\n      continue;\r\n#endif\r\n#if LJ_TARGET_X86ORX64\r\n    /* Non-constant shift counts need to be in RID_ECX on x86/x64. */\r\n    case IR_BSHL: case IR_BSHR: case IR_BSAR: case IR_BROL: case IR_BROR:\r\n      if (!irref_isk(ir->op2) && !ra_hashint(IR(ir->op2)->r)) {\r\n\tIR(ir->op2)->r = REGSP_HINT(RID_ECX);\r\n\tif (inloop)\r\n\t  rset_set(as->modset, RID_ECX);\r\n      }\r\n      break;\r\n#endif\r\n    /* Do not propagate hints across type conversions or loads. */\r\n    case IR_TOBIT:\r\n    case IR_XLOAD:\r\n#if !LJ_TARGET_ARM\r\n    case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n#endif\r\n      break;\r\n    case IR_CONV:\r\n      if (irt_isfp(ir->t) || (ir->op2 & IRCONV_SRCMASK) == IRT_NUM ||\r\n\t  (ir->op2 & IRCONV_SRCMASK) == IRT_FLOAT)\r\n\tbreak;\r\n      /* fallthrough */\r\n    default:\r\n      /* Propagate hints across likely 'op reg, imm' or 'op reg'. */\r\n      if (irref_isk(ir->op2) && !irref_isk(ir->op1) &&\r\n\t  ra_hashint(regsp_reg(IR(ir->op1)->prev))) {\r\n\tir->prev = IR(ir->op1)->prev;\r\n\tcontinue;\r\n      }\r\n      break;\r\n    }\r\n    ir->prev = REGSP_INIT;\r\n  }\r\n  if ((as->evenspill & 1))\r\n    as->oddspill = as->evenspill++;\r\n  else\r\n    as->oddspill = 0;\r\n}\r\n\r\n/* -- Assembler core ------------------------------------------------------ */\r\n\r\n/* Assemble a trace. */\r\nvoid lj_asm_trace(jit_State *J, GCtrace *T)\r\n{\r\n  ASMState as_;\r\n  ASMState *as = &as_;\r\n  MCode *origtop;\r\n\r\n  /* Ensure an initialized instruction beyond the last one for HIOP checks. */\r\n  J->cur.nins = lj_ir_nextins(J);\r\n  J->cur.ir[J->cur.nins].o = IR_NOP;\r\n\r\n  /* Setup initial state. Copy some fields to reduce indirections. */\r\n  as->J = J;\r\n  as->T = T;\r\n  as->ir = T->ir;\r\n  as->flags = J->flags;\r\n  as->loopref = J->loopref;\r\n  as->realign = NULL;\r\n  as->loopinv = 0;\r\n  as->parent = J->parent ? traceref(J, J->parent) : NULL;\r\n\r\n  /* Reserve MCode memory. */\r\n  as->mctop = origtop = lj_mcode_reserve(J, &as->mcbot);\r\n  as->mcp = as->mctop;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  asm_setup_target(as);\r\n\r\n  do {\r\n    as->mcp = as->mctop;\r\n#ifdef LUA_USE_ASSERT\r\n    as->mcp_prev = as->mcp;\r\n#endif\r\n    as->curins = T->nins;\r\n    RA_DBG_START();\r\n    RA_DBGX((as, \"===== STOP =====\"));\r\n\r\n    /* General trace setup. Emit tail of trace. */\r\n    asm_tail_prep(as);\r\n    as->mcloop = NULL;\r\n    as->flagmcp = NULL;\r\n    as->topslot = 0;\r\n    as->gcsteps = 0;\r\n    as->sectref = as->loopref;\r\n    as->fuseref = (as->flags & JIT_F_OPT_FUSE) ? as->loopref : FUSE_DISABLED;\r\n    asm_setup_regsp(as);\r\n    if (!as->loopref)\r\n      asm_tail_link(as);\r\n\r\n    /* Assemble a trace in linear backwards order. */\r\n    for (as->curins--; as->curins > as->stopins; as->curins--) {\r\n      IRIns *ir = IR(as->curins);\r\n      lua_assert(!(LJ_32 && irt_isint64(ir->t)));  /* Handled by SPLIT. */\r\n      if (!ra_used(ir) && !ir_sideeff(ir) && (as->flags & JIT_F_OPT_DCE))\r\n\tcontinue;  /* Dead-code elimination can be soooo easy. */\r\n      if (irt_isguard(ir->t))\r\n\tasm_snap_prep(as);\r\n      RA_DBG_REF();\r\n      checkmclim(as);\r\n      asm_ir(as, ir);\r\n    }\r\n  } while (as->realign);  /* Retry in case the MCode needs to be realigned. */\r\n\r\n  /* Emit head of trace. */\r\n  RA_DBG_REF();\r\n  checkmclim(as);\r\n  if (as->gcsteps > 0) {\r\n    as->curins = as->T->snap[0].ref;\r\n    asm_snap_prep(as);  /* The GC check is a guard. */\r\n    asm_gc_check(as);\r\n  }\r\n  ra_evictk(as);\r\n  if (as->parent)\r\n    asm_head_side(as);\r\n  else\r\n    asm_head_root(as);\r\n  asm_phi_fixup(as);\r\n\r\n  RA_DBGX((as, \"===== START ====\"));\r\n  RA_DBG_FLUSH();\r\n  if (as->freeset != RSET_ALL)\r\n    lj_trace_err(as->J, LJ_TRERR_BADRA);  /* Ouch! Should never happen. */\r\n\r\n  /* Set trace entry point before fixing up tail to allow link to self. */\r\n  T->mcode = as->mcp;\r\n  T->mcloop = as->mcloop ? (MSize)((char *)as->mcloop - (char *)as->mcp) : 0;\r\n  if (!as->loopref)\r\n    asm_tail_fixup(as, T->link);  /* Note: this may change as->mctop! */\r\n  T->szmcode = (MSize)((char *)as->mctop - (char *)as->mcp);\r\n  lj_mcode_sync(T->mcode, origtop);\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm.h",
    "content": "/*\r\n** IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ASM_H\r\n#define _LJ_ASM_H\r\n\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_asm_trace(jit_State *J, GCtrace *T);\r\nLJ_FUNC void lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno,\r\n\t\t\t      MCode *target);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm_arm.h",
    "content": "/*\r\n** ARM IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a scratch register pair. */\r\nstatic Reg ra_scratchpair(ASMState *as, RegSet allow)\r\n{\r\n  RegSet pick1 = as->freeset & allow;\r\n  RegSet pick2 = pick1 & (pick1 >> 1) & RSET_GPREVEN;\r\n  Reg r;\r\n  if (pick2) {\r\n    r = rset_picktop(pick2);\r\n  } else {\r\n    RegSet pick = pick1 & (allow >> 1) & RSET_GPREVEN;\r\n    if (pick) {\r\n      r = rset_picktop(pick);\r\n      ra_restore(as, regcost_ref(as->cost[r+1]));\r\n    } else {\r\n      pick = pick1 & (allow << 1) & RSET_GPRODD;\r\n      if (pick) {\r\n\tr = ra_restore(as, regcost_ref(as->cost[rset_picktop(pick)-1]));\r\n      } else {\r\n\tr = ra_evict(as, allow & (allow >> 1) & RSET_GPREVEN);\r\n\tra_restore(as, regcost_ref(as->cost[r+1]));\r\n      }\r\n    }\r\n  }\r\n  lua_assert(rset_test(RSET_GPREVEN, r));\r\n  ra_modified(as, r);\r\n  ra_modified(as, r+1);\r\n  RA_DBGX((as, \"scratchpair    $r $r\", r, r+1));\r\n  return r;\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_allocref(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_allocref(as, ir->op2, allow);\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_allocref(as, ir->op1, allow);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n#endif\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Generate an exit stub group at the bottom of the reserved MCode memory. */\r\nstatic MCode *asm_exitstub_gen(ASMState *as, ExitNo group)\r\n{\r\n  MCode *mxp = as->mcbot;\r\n  int i;\r\n  if (mxp + 4*4+4*EXITSTUBS_PER_GROUP >= as->mctop)\r\n    asm_mclimit(as);\r\n  /* str lr, [sp]; bl ->vm_exit_handler; .long DISPATCH_address, group. */\r\n  *mxp++ = ARMI_STR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_LR)|ARMF_N(RID_SP);\r\n  *mxp = ARMI_BL|((((MCode *)(void *)lj_vm_exit_handler-mxp)-2)&0x00ffffffu);\r\n  mxp++;\r\n  *mxp++ = (MCode)i32ptr(J2GG(as->J)->dispatch);  /* DISPATCH address */\r\n  *mxp++ = group*EXITSTUBS_PER_GROUP;\r\n  for (i = 0; i < EXITSTUBS_PER_GROUP; i++)\r\n    *mxp++ = ARMI_B|((-6-i)&0x00ffffffu);\r\n  lj_mcode_sync(as->mcbot, mxp);\r\n  lj_mcode_commitbot(as->J, mxp);\r\n  as->mcbot = mxp;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  return mxp - EXITSTUBS_PER_GROUP;\r\n}\r\n\r\n/* Setup all needed exit stubs. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  if (nexits >= EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR)\r\n    lj_trace_err(as->J, LJ_TRERR_SNAPOV);\r\n  for (i = 0; i < (nexits+EXITSTUBS_PER_GROUP-1)/EXITSTUBS_PER_GROUP; i++)\r\n    if (as->J->exitstubgroup[i] == NULL)\r\n      as->J->exitstubgroup[i] = asm_exitstub_gen(as, i);\r\n}\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guardcc(ASMState *as, ARMCC cc)\r\n{\r\n  MCode *target = exitstub_addr(as->J, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *p = ARMI_BL | ((target-p-2) & 0x00ffffffu);\r\n    emit_branch(as, ARMF_CC(ARMI_B, cc^1), p+1);\r\n    return;\r\n  }\r\n  emit_branch(as, ARMF_CC(ARMI_BL, cc), target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow,\r\n\t\t\t  int lim)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (ofs > -lim && ofs < lim) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (ofs < lim) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\t*ofsp = (ofs & 255);  /* Mask out less bits to allow LDRD. */\r\n\treturn ra_allock(as, (ofs & ~255), allow);\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse m operand into arithmetic/logic instructions. */\r\nstatic uint32_t asm_fuseopm(ASMState *as, ARMIns ai, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_hasreg(ir->r)) {\r\n    ra_noweak(as, ir->r);\r\n    return ARMF_M(ir->r);\r\n  } else if (irref_isk(ref)) {\r\n    uint32_t k = emit_isk12(ai, ir->i);\r\n    if (k)\r\n      return k;\r\n  } else if (mayfuse(as, ref)) {\r\n    if (ir->o >= IR_BSHL && ir->o <= IR_BROR) {\r\n      Reg m = ra_alloc1(as, ir->op1, allow);\r\n      ARMShift sh = ir->o == IR_BSHL ? ARMSH_LSL :\r\n\t\t    ir->o == IR_BSHR ? ARMSH_LSR :\r\n\t\t    ir->o == IR_BSAR ? ARMSH_ASR : ARMSH_ROR;\r\n      if (irref_isk(ir->op2)) {\r\n\treturn m | ARMF_SH(sh, (IR(ir->op2)->i & 31));\r\n      } else {\r\n\tReg s = ra_alloc1(as, ir->op2, rset_exclude(allow, m));\r\n\treturn m | ARMF_RSH(sh, s);\r\n      }\r\n    } else if (ir->o == IR_ADD && ir->op1 == ir->op2) {\r\n      Reg m = ra_alloc1(as, ir->op1, allow);\r\n      return m | ARMF_SH(ARMSH_LSL, 1);\r\n    }\r\n  }\r\n  return ra_allocref(as, ref, allow);\r\n}\r\n\r\n/* Fuse shifts into loads/stores. Only bother with BSHL 2 => lsl #2. */\r\nstatic IRRef asm_fuselsl2(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r) && mayfuse(as, ref) && ir->o == IR_BSHL &&\r\n      irref_isk(ir->op2) && IR(ir->op2)->i == 2)\r\n    return ir->op1;\r\n  return 0;  /* No fusion. */\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, ARMIns ai, Reg rd, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    int32_t lim = (!LJ_SOFTFP && (ai & 0x08000000)) ? 1024 :\r\n\t\t   (ai & 0x04000000) ? 4096 : 256;\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) &&\r\n\t  (ofs2 = ofs + IR(ir->op2)->i) > -lim && ofs2 < lim &&\r\n\t  (!(!LJ_SOFTFP && (ai & 0x08000000)) || !(ofs2 & 3))) {\r\n\tofs = ofs2;\r\n\tref = ir->op1;\r\n      } else if (ofs == 0 && !(!LJ_SOFTFP && (ai & 0x08000000))) {\r\n\tIRRef lref = ir->op1, rref = ir->op2;\r\n\tReg rn, rm;\r\n\tif ((ai & 0x04000000)) {\r\n\t  IRRef sref = asm_fuselsl2(as, rref);\r\n\t  if (sref) {\r\n\t    rref = sref;\r\n\t    ai |= ARMF_SH(ARMSH_LSL, 2);\r\n\t  } else if ((sref = asm_fuselsl2(as, lref)) != 0) {\r\n\t    lref = rref;\r\n\t    rref = sref;\r\n\t    ai |= ARMF_SH(ARMSH_LSL, 2);\r\n\t  }\r\n\t}\r\n\trn = ra_alloc1(as, lref, allow);\r\n\trm = ra_alloc1(as, rref, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000)) ai |= ARMI_LS_R;\r\n\temit_dnm(as, ai|ARMI_LS_P|ARMI_LS_U, rd, rn, rm);\r\n\treturn;\r\n      }\r\n    } else if (ir->o == IR_STRREF && !(!LJ_SOFTFP && (ai & 0x08000000))) {\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs += IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs += IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      } else {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg rn = ra_alloc1(as, ir->op1, allow);\r\n\tuint32_t m = asm_fuseopm(as, 0, ir->op2, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000))\r\n\t  emit_lso(as, ai, rd, rd, ofs);\r\n\telse\r\n\t  emit_lsox(as, ai, rd, rd, ofs);\r\n\temit_dn(as, ARMI_ADD^m, rd, rn);\r\n\treturn;\r\n      }\r\n      if (ofs <= -lim || ofs >= lim) {\r\n\tReg rn = ra_alloc1(as, ref, allow);\r\n\tReg rm = ra_allock(as, ofs, rset_exclude(allow, rn));\r\n\tif ((ai & 0x04000000)) ai |= ARMI_LS_R;\r\n\temit_dnm(as, ai|ARMI_LS_P|ARMI_LS_U, rd, rn, rm);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n#if !LJ_SOFTFP\r\n  if ((ai & 0x08000000))\r\n    emit_vlso(as, ai, rd, base, ofs);\r\n  else\r\n#endif\r\n  if ((ai & 0x04000000))\r\n    emit_lso(as, ai, rd, base, ofs);\r\n  else\r\n    emit_lsox(as, ai, rd, base, ofs);\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Fuse to multiply-add/sub instruction. */\r\nstatic int asm_fusemadd(ASMState *as, IRIns *ir, ARMIns ai, ARMIns air)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  IRIns *irm;\r\n  if (lref != rref &&\r\n      ((mayfuse(as, lref) && (irm = IR(lref), irm->o == IR_MUL) &&\r\n\tra_noreg(irm->r)) ||\r\n       (mayfuse(as, rref) && (irm = IR(rref), irm->o == IR_MUL) &&\r\n\t(rref = lref, ai = air, ra_noreg(irm->r))))) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg add = ra_hintalloc(as, rref, dest, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, irm,\r\n\t\t\trset_exclude(rset_exclude(RSET_FPR, dest), add));\r\n    right = (left >> 8); left &= 255;\r\n    emit_dnm(as, ai, (dest & 15), (left & 15), (right & 15));\r\n    if (dest != add) emit_dm(as, ARMI_VMOV_D, (dest & 15), (add & 15));\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_XNARGS(ci);\r\n  int32_t ofs = 0;\r\n#if LJ_SOFTFP\r\n  Reg gpr = REGARG_FIRSTGPR;\r\n#else\r\n  Reg gpr, fpr = REGARG_FIRSTFPR, fprodd = 0;\r\n#endif\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n#if !LJ_SOFTFP\r\n  for (gpr = REGARG_FIRSTGPR; gpr <= REGARG_LASTGPR; gpr++)\r\n    as->cost[gpr] = REGCOST(~0u, ASMREF_L);\r\n  gpr = REGARG_FIRSTGPR;\r\n#endif\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    IRIns *ir = IR(ref);\r\n#if !LJ_SOFTFP\r\n    if (ref && irt_isfp(ir->t)) {\r\n      RegSet of = as->freeset;\r\n      Reg src;\r\n      if (!LJ_ABI_SOFTFP && !(ci->flags & CCI_VARARG)) {\r\n\tif (irt_isnum(ir->t)) {\r\n\t  if (fpr <= REGARG_LASTFPR) {\r\n\t    ra_leftov(as, fpr, ref);\r\n\t    fpr++;\r\n\t    continue;\r\n\t  }\r\n\t} else if (fprodd) {  /* Ick. */\r\n\t  src = ra_alloc1(as, ref, RSET_FPR);\r\n\t  emit_dm(as, ARMI_VMOV_S, (fprodd & 15), (src & 15) | 0x00400000);\r\n\t  fprodd = 0;\r\n\t  continue;\r\n\t} else if (fpr <= REGARG_LASTFPR) {\r\n\t  ra_leftov(as, fpr, ref);\r\n\t  fprodd = fpr++;\r\n\t  continue;\r\n\t}\r\n\t/* Workaround to protect argument GPRs from being used for remat. */\r\n\tas->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n\tsrc = ra_alloc1(as, ref, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n\tas->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n\tfprodd = 0;\r\n\tgoto stackfp;\r\n      }\r\n      /* Workaround to protect argument GPRs from being used for remat. */\r\n      as->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n      src = ra_alloc1(as, ref, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n      as->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n      if (irt_isnum(ir->t)) gpr = (gpr+1) & ~1u;\r\n      if (gpr <= REGARG_LASTGPR) {\r\n\tlua_assert(rset_test(as->freeset, gpr));  /* Must have been evicted. */\r\n\tif (irt_isnum(ir->t)) {\r\n\t  lua_assert(rset_test(as->freeset, gpr+1));  /* Ditto. */\r\n\t  emit_dnm(as, ARMI_VMOV_RR_D, gpr, gpr+1, (src & 15));\r\n\t  gpr += 2;\r\n\t} else {\r\n\t  emit_dn(as, ARMI_VMOV_R_S, gpr, (src & 15));\r\n\t  gpr++;\r\n\t}\r\n      } else {\r\n      stackfp:\r\n\tif (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\temit_spstore(as, ir, src, ofs);\r\n\tofs += irt_isnum(ir->t) ? 8 : 4;\r\n      }\r\n    } else\r\n#endif\r\n    {\r\n      if (gpr <= REGARG_LASTGPR) {\r\n\tlua_assert(rset_test(as->freeset, gpr));  /* Must have been evicted. */\r\n\tif (ref) ra_leftov(as, gpr, ref);\r\n\tgpr++;\r\n      } else {\r\n\tif (ref) {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_GPR);\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t}\r\n\tofs += 4;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (!LJ_SOFTFP && irt_isfp(ir->t)) {\r\n      if (LJ_ABI_SOFTFP || (ci->flags & (CCI_CASTU64|CCI_VARARG))) {\r\n\tReg dest = (ra_dest(as, ir, RSET_FPR) & 15);\r\n\tif (irt_isnum(ir->t))\r\n\t  emit_dnm(as, ARMI_VMOV_D_RR, RID_RETLO, RID_RETHI, dest);\r\n\telse\r\n\t  emit_dn(as, ARMI_VMOV_S_R, RID_RET, dest);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n  UNUSED(ci);\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(irf->i);\r\n  } else {  /* Need a non-argument register for indirect calls. */\r\n    Reg freg = ra_alloc1(as, func, RSET_RANGE(RID_R4, RID_R12+1));\r\n    emit_m(as, ARMI_BLXr, freg);\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+LJ_FR2+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  /* Need to force a spill on REF_BASE now to update the stack slot. */\r\n  emit_lso(as, ARMI_STR, base, RID_SP, ra_spill(as, IR(REF_BASE)));\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_nm(as, ARMI_CMP, RID_TMP,\r\n\t  ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_lso(as, ARMI_LDR, RID_TMP, base, -4);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ARMI_VCMP_D, (tmp & 15), (left & 15));\r\n  emit_dm(as, ARMI_VCVT_F64_S32, (tmp & 15), (tmp & 15));\r\n  emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n  emit_dm(as, ARMI_VCVT_S32_F64, (tmp & 15), (left & 15));\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n  emit_dnm(as, ARMI_VADD_D, (tmp & 15), (left & 15), (right & 15));\r\n}\r\n#else\r\n#define asm_tobit(as, ir)\tlua_assert(0)\r\n#endif\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if !LJ_SOFTFP\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n#endif\r\n  IRRef lref = ir->op1;\r\n  /* 64 bit integer conversions are handled by SPLIT. */\r\n  lua_assert(!irt_isint64(ir->t) && !(st == IRT_I64 || st == IRT_U64));\r\n#if LJ_SOFTFP\r\n  /* FP conversions are handled by SPLIT. */\r\n  lua_assert(!irt_isfp(ir->t) && !(st == IRT_NUM || st == IRT_FLOAT));\r\n  /* Can't check for same types: SPLIT uses CONV int.int + BXOR for sfp NEG. */\r\n#else\r\n  lua_assert(irt_type(ir->t) != st);\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      emit_dm(as, st == IRT_NUM ? ARMI_VCVT_F32_F64 : ARMI_VCVT_F64_F32,\r\n\t      (dest & 15), (ra_alloc1(as, lref, RSET_FPR) & 15));\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      ARMIns ai = irt_isfloat(ir->t) ?\r\n\t(st == IRT_INT ? ARMI_VCVT_F32_S32 : ARMI_VCVT_F32_U32) :\r\n\t(st == IRT_INT ? ARMI_VCVT_F64_S32 : ARMI_VCVT_F64_U32);\r\n      emit_dm(as, ai, (dest & 15), (dest & 15));\r\n      emit_dn(as, ARMI_VMOV_S_R, left, (dest & 15));\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      ARMIns ai;\r\n      emit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n      ai = irt_isint(ir->t) ?\r\n\t(st == IRT_NUM ? ARMI_VCVT_S32_F64 : ARMI_VCVT_S32_F32) :\r\n\t(st == IRT_NUM ? ARMI_VCVT_U32_F64 : ARMI_VCVT_U32_F32);\r\n      emit_dm(as, ai, (tmp & 15), (left & 15));\r\n    }\r\n  } else\r\n#endif\r\n  {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((as->flags & JIT_F_ARMV6)) {\r\n\tARMIns ai = st == IRT_I8 ? ARMI_SXTB :\r\n\t\t    st == IRT_U8 ? ARMI_UXTB :\r\n\t\t    st == IRT_I16 ? ARMI_SXTH : ARMI_UXTH;\r\n\temit_dm(as, ai, dest, left);\r\n      } else if (st == IRT_U8) {\r\n\temit_dn(as, ARMI_AND|ARMI_K12|255, dest, left);\r\n      } else {\r\n\tuint32_t shift = st == IRT_I8 ? 24 : 16;\r\n\tARMShift sh = st == IRT_U16 ? ARMSH_LSR : ARMSH_ASR;\r\n\temit_dm(as, ARMI_MOV|ARMF_SH(sh, shift), dest, RID_TMP);\r\n\temit_dm(as, ARMI_MOV|ARMF_SH(ARMSH_LSL, shift), RID_TMP, left);\r\n      }\r\n    } else {  /* Handle 32/32 bit no-op (cast). */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  Reg rlo = 0, rhi = 0, tmp;\r\n  int destused = ra_used(ir);\r\n  int32_t ofs = 0;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n#if LJ_SOFTFP\r\n  if (destused) {\r\n    if (ra_hasspill(ir->s) && ra_hasspill((ir+1)->s) &&\r\n\t(ir->s & 1) == 0 && ir->s + 1 == (ir+1)->s) {\r\n      int i;\r\n      for (i = 0; i < 2; i++) {\r\n\tReg r = (ir+i)->r;\r\n\tif (ra_hasreg(r)) {\r\n\t  ra_free(as, r);\r\n\t  ra_modified(as, r);\r\n\t  emit_spload(as, ir+i, r, sps_scale((ir+i)->s));\r\n\t}\r\n      }\r\n      ofs = sps_scale(ir->s);\r\n      destused = 0;\r\n    } else {\r\n      rhi = ra_dest(as, ir+1, RSET_GPR);\r\n      rlo = ra_dest(as, ir, rset_exclude(RSET_GPR, rhi));\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_EQ);\r\n  if (destused) {\r\n    emit_lso(as, ARMI_LDR, rhi, RID_SP, 4);\r\n    emit_lso(as, ARMI_LDR, rlo, RID_SP, 0);\r\n  }\r\n#else\r\n  UNUSED(rhi);\r\n  if (destused) {\r\n    if (ra_hasspill(ir->s)) {\r\n      ofs = sps_scale(ir->s);\r\n      destused = 0;\r\n      if (ra_hasreg(ir->r)) {\r\n\tra_free(as, ir->r);\r\n\tra_modified(as, ir->r);\r\n\temit_spload(as, ir, ir->r, ofs);\r\n      }\r\n    } else {\r\n      rlo = ra_dest(as, ir, RSET_FPR);\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_EQ);\r\n  if (destused)\r\n    emit_vlso(as, ARMI_VLDR_D, rlo, RID_SP, 0);\r\n#endif\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, RID_RET);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n  if (ofs == 0)\r\n    emit_dm(as, ARMI_MOV, tmp, RID_SP);\r\n  else\r\n    emit_opk(as, ARMI_ADD, tmp, RID_SP, ofs, RSET_GPR);\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref)) {\r\n      /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    } else {\r\n#if LJ_SOFTFP\r\n      lua_assert(0);\r\n#else\r\n      /* Otherwise force a spill and use the spill slot. */\r\n      emit_opk(as, ARMI_ADD, dest, RID_SP, ra_spill(as, ir), RSET_GPR);\r\n#endif\r\n    }\r\n  } else {\r\n    /* Otherwise use [sp] and [sp+4] to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_dm(as, ARMI_MOV, dest, RID_SP);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_lso(as, ARMI_STR, src, RID_SP, 0);\r\n    }\r\n    if (LJ_SOFTFP && (ir+1)->o == IR_HIOP)\r\n      type = ra_alloc1(as, ref+1, allow);\r\n    else\r\n      type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_lso(as, ARMI_STR, type, RID_SP, 4);\r\n  }\r\n}\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    uint32_t k = emit_isk12(ARMI_ADD, ofs + 8*IR(ir->op2)->i);\r\n    if (k) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_dn(as, ARMI_ADD^k, dest, base);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 3), dest, base, idx);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = 0, keyhi = 0, keynumhi = RID_NONE, tmp = RID_TMP;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  int32_t k = 0, khi = emit_isk12(ARMI_CMP, irt_toitype(kt));\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop;\r\n  rset_clear(allow, tab);\r\n  if (!irref_isk(refkey) || irt_isstr(kt)) {\r\n#if LJ_SOFTFP\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n    if (irkey[1].o == IR_HIOP) {\r\n      if (ra_hasreg((irkey+1)->r)) {\r\n\tkeynumhi = (irkey+1)->r;\r\n\tkeyhi = RID_TMP;\r\n\tra_noweak(as, keynumhi);\r\n      } else {\r\n\tkeyhi = keynumhi = ra_allocref(as, refkey+1, allow);\r\n      }\r\n      rset_clear(allow, keynumhi);\r\n      khi = 0;\r\n    }\r\n#else\r\n    if (irt_isnum(kt)) {\r\n      key = ra_scratch(as, allow);\r\n      rset_clear(allow, key);\r\n      keyhi = keynumhi = ra_scratch(as, allow);\r\n      rset_clear(allow, keyhi);\r\n      khi = 0;\r\n    } else {\r\n      key = ra_alloc1(as, refkey, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n#endif\r\n  } else if (irt_isnum(kt)) {\r\n    int32_t val = (int32_t)ir_knum(irkey)->u32.lo;\r\n    k = emit_isk12(ARMI_CMP, val);\r\n    if (!k) {\r\n      key = ra_allock(as, val, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n    val = (int32_t)ir_knum(irkey)->u32.hi;\r\n    khi = emit_isk12(ARMI_CMP, val);\r\n    if (!khi) {\r\n      keyhi = ra_allock(as, val, allow);\r\n      rset_clear(allow, keyhi);\r\n    }\r\n  } else if (!irt_ispri(kt)) {\r\n    k = emit_isk12(ARMI_CMP, irkey->i);\r\n    if (!k) {\r\n      key = ra_alloc1(as, refkey, allow);\r\n      rset_clear(allow, key);\r\n    }\r\n  }\r\n  if (!irt_ispri(kt))\r\n    tmp = ra_scratchpair(as, allow);\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  as->invmcp = NULL;\r\n  if (merge == IR_NE)\r\n    asm_guardcc(as, CC_AL);\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = --as->mcp;\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, dest);\r\n  emit_lso(as, ARMI_LDR, dest, dest, (int32_t)offsetof(Node, next));\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ)\r\n    asm_guardcc(as, CC_EQ);\r\n  else\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  if (!irt_ispri(kt)) {\r\n    emit_nm(as, ARMF_CC(ARMI_CMP, CC_EQ)^k, tmp, key);\r\n    emit_nm(as, ARMI_CMP^khi, tmp+1, keyhi);\r\n    emit_lsox(as, ARMI_LDRD, tmp, dest, (int32_t)offsetof(Node, key));\r\n  } else {\r\n    emit_n(as, ARMI_CMP^khi, tmp);\r\n    emit_lso(as, ARMI_LDR, tmp, dest, (int32_t)offsetof(Node, key.it));\r\n  }\r\n  *l_loop = ARMF_CC(ARMI_B, CC_NE) | ((as->mcp-l_loop-2) & 0x00ffffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 3), dest, dest, tmp);\r\n    emit_dnm(as, ARMI_ADD|ARMF_SH(ARMSH_LSL, 1), tmp, tmp, tmp);\r\n    if (irt_isstr(kt)) {  /* Fetch of str->hash is cheaper than ra_allock. */\r\n      emit_dnm(as, ARMI_AND, tmp, tmp+1, RID_TMP);\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_lso(as, ARMI_LDR, tmp+1, key, (int32_t)offsetof(GCstr, hash));\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n    } else if (irref_isk(refkey)) {\r\n      emit_opk(as, ARMI_AND, tmp, RID_TMP, (int32_t)khash,\r\n\t       rset_exclude(rset_exclude(RSET_GPR, tab), dest));\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      if (ra_hasreg(keynumhi)) {  /* Canonicalize +-0.0 to 0.0. */\r\n\tif (keyhi == RID_TMP)\r\n\t  emit_dm(as, ARMF_CC(ARMI_MOV, CC_NE), keyhi, keynumhi);\r\n\temit_d(as, ARMF_CC(ARMI_MOV, CC_EQ)|ARMI_K12|0, keyhi);\r\n      }\r\n      emit_dnm(as, ARMI_AND, tmp, tmp, RID_TMP);\r\n      emit_dnm(as, ARMI_SUB|ARMF_SH(ARMSH_ROR, 32-HASH_ROT3), tmp, tmp, tmp+1);\r\n      emit_lso(as, ARMI_LDR, dest, tab, (int32_t)offsetof(GCtab, node));\r\n      emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_ROR, 32-((HASH_ROT2+HASH_ROT1)&31)),\r\n\t       tmp, tmp+1, tmp);\r\n      emit_lso(as, ARMI_LDR, RID_TMP, tab, (int32_t)offsetof(GCtab, hmask));\r\n      emit_dnm(as, ARMI_SUB|ARMF_SH(ARMSH_ROR, 32-HASH_ROT1), tmp+1, tmp+1, tmp);\r\n      if (ra_hasreg(keynumhi)) {\r\n\temit_dnm(as, ARMI_EOR, tmp+1, tmp, key);\r\n\temit_dnm(as, ARMI_ORR|ARMI_S, RID_TMP, tmp, key);  /* Test for +-0.0. */\r\n\temit_dnm(as, ARMI_ADD, tmp, keynumhi, keynumhi);\r\n#if !LJ_SOFTFP\r\n\temit_dnm(as, ARMI_VMOV_RR_D, key, keynumhi,\r\n\t\t (ra_alloc1(as, refkey, RSET_FPR) & 15));\r\n#endif\r\n      } else {\r\n\temit_dnm(as, ARMI_EOR, tmp+1, tmp, key);\r\n\temit_opk(as, ARMI_ADD, tmp, key, (int32_t)HASH_BIAS,\r\n\t\t rset_exclude(rset_exclude(RSET_GPR, tab), key));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir) || ofs > 4095) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 4095) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_opk(as, ARMI_ADD, dest, node, ofs, allow);\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n  if (!irt_ispri(irkey->t)) {\r\n    RegSet even = (as->freeset & allow);\r\n    even = even & (even >> 1) & RSET_GPREVEN;\r\n    if (even) {\r\n      key = ra_scratch(as, even);\r\n      if (rset_test(as->freeset, key+1)) {\r\n\ttype = key+1;\r\n\tra_modified(as, type);\r\n      }\r\n    } else {\r\n      key = ra_scratch(as, allow);\r\n    }\r\n    rset_clear(allow, key);\r\n  }\r\n  rset_clear(allow, type);\r\n  if (irt_isnum(irkey->t)) {\r\n    emit_opk(as, ARMF_CC(ARMI_CMP, CC_EQ), 0, type,\r\n\t     (int32_t)ir_knum(irkey)->u32.hi, allow);\r\n    emit_opk(as, ARMI_CMP, 0, key,\r\n\t     (int32_t)ir_knum(irkey)->u32.lo, allow);\r\n  } else {\r\n    if (ra_hasreg(key))\r\n      emit_opk(as, ARMF_CC(ARMI_CMP, CC_EQ), 0, key, irkey->i, allow);\r\n    emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype(irkey->t), type);\r\n  }\r\n  emit_lso(as, ARMI_LDR, type, idx, kofs+4);\r\n  if (ra_hasreg(key)) emit_lso(as, ARMI_LDR, key, idx, kofs);\r\n  if (ofs > 4095)\r\n    emit_opk(as, ARMI_ADD, dest, node, ofs, RSET_GPR);\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, ARMI_LDR, dest, v);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_n(as, ARMI_CMP|ARMI_K12|1, RID_TMP);\r\n      emit_opk(as, ARMI_ADD, dest, uv,\r\n\t       (int32_t)offsetof(GCupval, tv), RSET_GPR);\r\n      emit_lso(as, ARMI_LDRB, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_lso(as, ARMI_LDR, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_lso(as, ARMI_LDR, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    uint32_t k, m = ARMI_K12|sizeof(GCstr);\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       (k = emit_isk12(ARMI_ADD,\r\n\t\t\t       (int32_t)sizeof(GCstr) + IR(irr->op2)->i))) {\r\n      m = k;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_dn(as, ARMI_ADD^m, dest, dest);\r\n    emit_dnm(as, ARMI_ADD, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  emit_opk(as, ARMI_ADD, dest, r,\r\n\t   sizeof(GCstr) + IR(refk)->i, rset_exclude(RSET_GPR, r));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic ARMIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return ARMI_LDRSB;\r\n  case IRT_U8: return ARMI_LDRB;\r\n  case IRT_I16: return ARMI_LDRSH;\r\n  case IRT_U16: return ARMI_LDRH;\r\n  case IRT_NUM: lua_assert(!LJ_SOFTFP); return ARMI_VLDR_D;\r\n  case IRT_FLOAT: if (!LJ_SOFTFP) return ARMI_VLDR_S;\r\n  default: return ARMI_LDR;\r\n  }\r\n}\r\n\r\nstatic ARMIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return ARMI_STRB;\r\n  case IRT_I16: case IRT_U16: return ARMI_STRH;\r\n  case IRT_NUM: lua_assert(!LJ_SOFTFP); return ARMI_VSTR_D;\r\n  case IRT_FLOAT: if (!LJ_SOFTFP) return ARMI_VSTR_S;\r\n  default: return ARMI_STR;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  ARMIns ai = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_dn(as, ARMI_ADD|ARMI_K12|ofs, dest, idx);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  if ((ai & 0x04000000))\r\n    emit_lso(as, ai, dest, idx, ofs);\r\n  else\r\n    emit_lsox(as, ai, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    ARMIns ai = asm_fxstoreins(ir);\r\n    if ((ai & 0x04000000))\r\n      emit_lso(as, ai, src, idx, ofs);\r\n    else\r\n      emit_lsox(as, ai, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir,\r\n\t\t     (!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore_(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2,\r\n\t\t\t(!LJ_SOFTFP && irt_isfp(ir->t)) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\n#define asm_xstore(as, ir)\tasm_xstore_(as, ir, 0)\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n  IRType t = hiop ? IRT_NUM : irt_type(ir->t);\r\n  Reg dest = RID_NONE, type = RID_NONE, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = 0;\r\n  if (hiop && ra_used(ir+1)) {\r\n    type = ra_dest(as, ir+1, allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  if (ra_used(ir)) {\r\n    lua_assert((LJ_SOFTFP ? 0 : irt_isnum(ir->t)) ||\r\n\t       irt_isint(ir->t) || irt_isaddr(ir->t));\r\n    dest = ra_dest(as, ir, (!LJ_SOFTFP && t == IRT_NUM) ? RSET_FPR : allow);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow,\r\n\t\t       (!LJ_SOFTFP && t == IRT_NUM) ? 1024 : 4096);\r\n  if (!hiop || type == RID_NONE) {\r\n    rset_clear(allow, idx);\r\n    if (ofs < 256 && ra_hasreg(dest) && (dest & 1) == 0 &&\r\n\trset_test((as->freeset & allow), dest+1)) {\r\n      type = dest+1;\r\n      ra_modified(as, type);\r\n    } else {\r\n      type = RID_TMP;\r\n    }\r\n  }\r\n  asm_guardcc(as, t == IRT_NUM ? CC_HS : CC_NE);\r\n  emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype_(t), type);\r\n  if (ra_hasreg(dest)) {\r\n#if !LJ_SOFTFP\r\n    if (t == IRT_NUM)\r\n      emit_vlso(as, ARMI_VLDR_D, dest, idx, ofs);\r\n    else\r\n#endif\r\n      emit_lso(as, ARMI_LDR, dest, idx, ofs);\r\n  }\r\n  emit_lso(as, ARMI_LDR, type, idx, ofs+4);\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    RegSet allow = RSET_GPR;\r\n    Reg idx, src = RID_NONE, type = RID_NONE;\r\n    int32_t ofs = 0;\r\n#if !LJ_SOFTFP\r\n    if (irt_isnum(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n      idx = asm_fuseahuref(as, ir->op1, &ofs, allow, 1024);\r\n      emit_vlso(as, ARMI_VSTR_D, src, idx, ofs);\r\n    } else\r\n#endif\r\n    {\r\n      int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n      if (!irt_ispri(ir->t)) {\r\n\tsrc = ra_alloc1(as, ir->op2, allow);\r\n\trset_clear(allow, src);\r\n      }\r\n      if (hiop)\r\n\ttype = ra_alloc1(as, (ir+1)->op2, allow);\r\n      else\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      idx = asm_fuseahuref(as, ir->op1, &ofs, rset_exclude(allow, type), 4096);\r\n      if (ra_hasreg(src)) emit_lso(as, ARMI_STR, src, idx, ofs);\r\n      emit_lso(as, ARMI_STR, type, idx, ofs+4);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  int hiop = (LJ_SOFTFP && (ir+1)->o == IR_HIOP);\r\n  IRType t = hiop ? IRT_NUM : irt_type(ir->t);\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(ir->t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n#if LJ_SOFTFP\r\n  lua_assert(!(ir->op2 & IRSLOAD_CONVERT));  /* Handled by LJ_SOFTFP SPLIT. */\r\n  if (hiop && ra_used(ir+1)) {\r\n    type = ra_dest(as, ir+1, allow);\r\n    rset_clear(allow, type);\r\n  }\r\n#else\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(ir->t) && t == IRT_INT) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else\r\n#endif\r\n  if (ra_used(ir)) {\r\n    Reg tmp = RID_NONE;\r\n    if ((ir->op2 & IRSLOAD_CONVERT))\r\n      tmp = ra_scratch(as, t == IRT_INT ? RSET_FPR : RSET_GPR);\r\n    lua_assert((LJ_SOFTFP ? 0 : irt_isnum(ir->t)) ||\r\n\t       irt_isint(ir->t) || irt_isaddr(ir->t));\r\n    dest = ra_dest(as, ir, (!LJ_SOFTFP && t == IRT_NUM) ? RSET_FPR : allow);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (t == IRT_INT) {\r\n\temit_dn(as, ARMI_VMOV_R_S, dest, (tmp & 15));\r\n\temit_dm(as, ARMI_VCVT_S32_F64, (tmp & 15), (tmp & 15));\r\n\tt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\temit_dm(as, ARMI_VCVT_F64_S32, (dest & 15), (dest & 15));\r\n\temit_dn(as, ARMI_VMOV_S_R, tmp, (dest & 15));\r\n\tt = IRT_INT;  /* Check for original type. */\r\n      }\r\n      dest = tmp;\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\ndotypecheck:\r\n  rset_clear(allow, base);\r\n  if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n    if (ra_noreg(type)) {\r\n      if (ofs < 256 && ra_hasreg(dest) && (dest & 1) == 0 &&\r\n\t  rset_test((as->freeset & allow), dest+1)) {\r\n\ttype = dest+1;\r\n\tra_modified(as, type);\r\n      } else {\r\n\ttype = RID_TMP;\r\n      }\r\n    }\r\n    asm_guardcc(as, t == IRT_NUM ? CC_HS : CC_NE);\r\n    emit_n(as, ARMI_CMN|ARMI_K12|-irt_toitype_(t), type);\r\n  }\r\n  if (ra_hasreg(dest)) {\r\n#if !LJ_SOFTFP\r\n    if (t == IRT_NUM) {\r\n      if (ofs < 1024) {\r\n\temit_vlso(as, ARMI_VLDR_D, dest, base, ofs);\r\n      } else {\r\n\tif (ra_hasreg(type)) emit_lso(as, ARMI_LDR, type, base, ofs+4);\r\n\temit_vlso(as, ARMI_VLDR_D, dest, RID_TMP, 0);\r\n\temit_opk(as, ARMI_ADD, RID_TMP, base, ofs, allow);\r\n\treturn;\r\n      }\r\n    } else\r\n#endif\r\n      emit_lso(as, ARMI_LDR, dest, base, ofs);\r\n  }\r\n  if (ra_hasreg(type)) emit_lso(as, ARMI_LDR, type, base, ofs+4);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID id = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[4];\r\n  RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID || (ir->o == IR_CNEW && ir->op2 != REF_NIL));\r\n\r\n  as->gcsteps++;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4; ir++;\r\n      lua_assert(ir->o == IR_HIOP);\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_lso(as, ARMI_STR, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir--;\r\n    }\r\n  } else if (ir->op2 != REF_NIL) {  /* Create VLA/VLS/aligned cdata. */\r\n    ci = &lj_ir_callinfo[IRCALL_lj_cdata_newv];\r\n    args[0] = ASMREF_L;     /* lua_State *L */\r\n    args[1] = ir->op1;      /* CTypeID id   */\r\n    args[2] = ir->op2;      /* CTSize sz    */\r\n    args[3] = ASMREF_TMP1;  /* CTSize align */\r\n    asm_gencall(as, ci, args);\r\n    emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)ctype_align(info));\r\n    return;\r\n  }\r\n\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  {\r\n    uint32_t k = emit_isk12(ARMI_MOV, id);\r\n    Reg r = k ? RID_R1 : ra_allock(as, id, allow);\r\n    emit_lso(as, ARMI_STRB, RID_TMP, RID_RET, offsetof(GCcdata, gct));\r\n    emit_lsox(as, ARMI_STRH, r, RID_RET, offsetof(GCcdata, ctypeid));\r\n    emit_d(as, ARMI_MOV|ARMI_K12|~LJ_TCDATA, RID_TMP);\r\n    if (k) emit_d(as, ARMI_MOV^k, RID_R1);\r\n  }\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg link = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg gr = ra_allock(as, i32ptr(J2G(as->J)),\r\n\t\t     rset_exclude(rset_exclude(RSET_GPR, tab), link));\r\n  Reg mark = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_lso(as, ARMI_STR, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_lso(as, ARMI_STRB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_lso(as, ARMI_STR, tab, gr,\r\n\t   (int32_t)offsetof(global_State, gc.grayagain));\r\n  emit_dn(as, ARMI_BIC|ARMI_K12|LJ_GC_BLACK, mark, mark);\r\n  emit_lso(as, ARMI_LDR, link, gr,\r\n\t   (int32_t)offsetof(global_State, gc.grayagain));\r\n  emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  emit_n(as, ARMI_TST|ARMI_K12|LJ_GC_BLACK, mark);\r\n  emit_lso(as, ARMI_LDRB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  if ((l_end[-1] >> 28) == CC_AL)\r\n    l_end[-1] = ARMF_CC(l_end[-1], CC_NE);\r\n  else\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_EQ), l_end);\r\n  ra_allockreg(as, i32ptr(J2G(as->J)), ra_releasetmp(as, ASMREF_TMP1));\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_n(as, ARMF_CC(ARMI_TST, CC_NE)|ARMI_K12|LJ_GC_BLACK, tmp);\r\n  emit_n(as, ARMI_TST|ARMI_K12|LJ_GC_WHITES, RID_TMP);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_lso(as, ARMI_LDRB, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_lso(as, ARMI_LDRB, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\n#if !LJ_SOFTFP\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dnm(as, ai, (dest & 15), (left & 15), (right & 15));\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_dm(as, ai, (dest & 15), (left & 15));\r\n}\r\n\r\nstatic void asm_callround(ASMState *as, IRIns *ir, int id)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RID2RSET(RID_R0)|RID2RSET(RID_R1)|RID2RSET(RID_R2)|\r\n\t\tRID2RSET(RID_R3)|RID2RSET(RID_R12);\r\n  RegSet of;\r\n  Reg dest, src;\r\n  ra_evictset(as, drop);\r\n  dest = ra_dest(as, ir, RSET_FPR);\r\n  emit_dnm(as, ARMI_VMOV_D_RR, RID_RETLO, RID_RETHI, (dest & 15));\r\n  emit_call(as, id == IRFPM_FLOOR ? (void *)lj_vm_floor_sf :\r\n\t\tid == IRFPM_CEIL ? (void *)lj_vm_ceil_sf :\r\n\t\t\t\t   (void *)lj_vm_trunc_sf);\r\n  /* Workaround to protect argument GPRs from being used for remat. */\r\n  of = as->freeset;\r\n  as->freeset &= ~RSET_RANGE(RID_R0, RID_R1+1);\r\n  as->cost[RID_R0] = as->cost[RID_R1] = REGCOST(~0u, ASMREF_L);\r\n  src = ra_alloc1(as, ir->op1, RSET_FPR);  /* May alloc GPR to remat FPR. */\r\n  as->freeset |= (of & RSET_RANGE(RID_R0, RID_R1+1));\r\n  emit_dnm(as, ARMI_VMOV_RR_D, RID_R0, RID_R1, (src & 15));\r\n}\r\n\r\nstatic void asm_fpmath(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n    return;\r\n  if (ir->op2 <= IRFPM_TRUNC)\r\n    asm_callround(as, ir, ir->op2);\r\n  else if (ir->op2 == IRFPM_SQRT)\r\n    asm_fpunary(as, ir, ARMI_VSQRT_D);\r\n  else\r\n    asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n}\r\n#else\r\n#define asm_fpmath(as, ir)\tlua_assert(0)\r\n#endif\r\n\r\nstatic int asm_swapops(ASMState *as, IRRef lref, IRRef rref)\r\n{\r\n  IRIns *ir;\r\n  if (irref_isk(rref))\r\n    return 0;  /* Don't swap constants to the left. */\r\n  if (irref_isk(lref))\r\n    return 1;  /* But swap constants to the right. */\r\n  ir = IR(rref);\r\n  if ((ir->o >= IR_BSHL && ir->o <= IR_BROR) ||\r\n      (ir->o == IR_ADD && ir->op1 == ir->op2))\r\n    return 0;  /* Don't swap fusable operands to the left. */\r\n  ir = IR(lref);\r\n  if ((ir->o >= IR_BSHL && ir->o <= IR_BROR) ||\r\n      (ir->o == IR_ADD && ir->op1 == ir->op2))\r\n    return 1;  /* But swap fusable operands to the right. */\r\n  return 0;  /* Otherwise don't swap. */\r\n}\r\n\r\nstatic void asm_intop(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  Reg left, dest = ra_dest(as, ir, RSET_GPR);\r\n  uint32_t m;\r\n  if (asm_swapops(as, lref, rref)) {\r\n    IRRef tmp = lref; lref = rref; rref = tmp;\r\n    if ((ai & ~ARMI_S) == ARMI_SUB || (ai & ~ARMI_S) == ARMI_SBC)\r\n      ai ^= (ARMI_SUB^ARMI_RSB);\r\n  }\r\n  left = ra_hintalloc(as, lref, dest, RSET_GPR);\r\n  m = asm_fuseopm(as, ai, rref, rset_exclude(RSET_GPR, left));\r\n  if (irt_isguard(ir->t)) {  /* For IR_ADDOV etc. */\r\n    asm_guardcc(as, CC_VS);\r\n    ai |= ARMI_S;\r\n  }\r\n  emit_dn(as, ai^m, dest, left);\r\n}\r\n\r\nstatic void asm_intop_s(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  if (as->flagmcp == as->mcp) {  /* Drop cmp r, #0. */\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    ai |= ARMI_S;\r\n  }\r\n  asm_intop(as, ir, ai);\r\n}\r\n\r\nstatic void asm_intneg(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  emit_dn(as, ai|ARMI_K12|0, dest, left);\r\n}\r\n\r\n/* NYI: use add/shift for MUL(OV) with constants. FOLD only does 2^k. */\r\nstatic void asm_intmul(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, dest));\r\n  Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  Reg tmp = RID_NONE;\r\n  /* ARMv5 restriction: dest != left and dest_hi != left. */\r\n  if (dest == left && left != right) { left = right; right = dest; }\r\n  if (irt_isguard(ir->t)) {  /* IR_MULOV */\r\n    if (!(as->flags & JIT_F_ARMV6) && dest == left)\r\n      tmp = left = ra_scratch(as, rset_exclude(RSET_GPR, left));\r\n    asm_guardcc(as, CC_NE);\r\n    emit_nm(as, ARMI_TEQ|ARMF_SH(ARMSH_ASR, 31), RID_TMP, dest);\r\n    emit_dnm(as, ARMI_SMULL|ARMF_S(right), dest, RID_TMP, left);\r\n  } else {\r\n    if (!(as->flags & JIT_F_ARMV6) && dest == left) tmp = left = RID_TMP;\r\n    emit_nm(as, ARMI_MUL|ARMF_S(right), dest, left);\r\n  }\r\n  /* Only need this for the dest == left == right case. */\r\n  if (ra_hasreg(tmp)) emit_dm(as, ARMI_MOV, tmp, right);\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, ARMI_VMLA_D, ARMI_VMLA_D))\r\n      asm_fparith(as, ir, ARMI_VADD_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intop_s(as, ir, ARMI_ADD);\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, ARMI_VNMLS_D, ARMI_VMLS_D))\r\n      asm_fparith(as, ir, ARMI_VSUB_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intop_s(as, ir, ARMI_SUB);\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, ARMI_VMUL_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intmul(as, ir);\r\n}\r\n\r\n#define asm_addov(as, ir)\tasm_add(as, ir)\r\n#define asm_subov(as, ir)\tasm_sub(as, ir)\r\n#define asm_mulov(as, ir)\tasm_mul(as, ir)\r\n\r\n#if LJ_SOFTFP\r\n#define asm_div(as, ir)\t\tlua_assert(0)\r\n#define asm_pow(as, ir)\t\tlua_assert(0)\r\n#define asm_abs(as, ir)\t\tlua_assert(0)\r\n#define asm_atan2(as, ir)\tlua_assert(0)\r\n#define asm_ldexp(as, ir)\tlua_assert(0)\r\n#else\r\n#define asm_div(as, ir)\t\tasm_fparith(as, ir, ARMI_VDIV_D)\r\n#define asm_pow(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_powi)\r\n#define asm_abs(as, ir)\t\tasm_fpunary(as, ir, ARMI_VABS_D)\r\n#define asm_atan2(as, ir)\tasm_callid(as, ir, IRCALL_atan2)\r\n#define asm_ldexp(as, ir)\tasm_callid(as, ir, IRCALL_ldexp)\r\n#endif\r\n\r\n#define asm_mod(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_modi)\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, ARMI_VNEG_D);\r\n    return;\r\n  }\r\n#endif\r\n  asm_intneg(as, ir, ARMI_RSB);\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, ARMIns ai)\r\n{\r\n  if (as->flagmcp == as->mcp) {  /* Try to drop cmp r, #0. */\r\n    uint32_t cc = (as->mcp[1] >> 28);\r\n    as->flagmcp = NULL;\r\n    if (cc <= CC_NE) {\r\n      as->mcp++;\r\n      ai |= ARMI_S;\r\n    } else if (cc == CC_GE) {\r\n      *++as->mcp ^= ((CC_GE^CC_PL) << 28);\r\n      ai |= ARMI_S;\r\n    } else if (cc == CC_LT) {\r\n      *++as->mcp ^= ((CC_LT^CC_MI) << 28);\r\n      ai |= ARMI_S;\r\n    }  /* else: other conds don't work with bit ops. */\r\n  }\r\n  if (ir->op2 == 0) {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    uint32_t m = asm_fuseopm(as, ai, ir->op1, RSET_GPR);\r\n    emit_d(as, ai^m, dest);\r\n  } else {\r\n    /* NYI: Turn BAND !k12 into uxtb, uxth or bfc or shl+shr. */\r\n    asm_intop(as, ir, ai);\r\n  }\r\n}\r\n\r\n#define asm_bnot(as, ir)\tasm_bitop(as, ir, ARMI_MVN)\r\n\r\nstatic void asm_bswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if ((as->flags & JIT_F_ARMV6)) {\r\n    emit_dm(as, ARMI_REV, dest, left);\r\n  } else {\r\n    Reg tmp2 = dest;\r\n    if (tmp2 == left)\r\n      tmp2 = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, dest), left));\r\n    emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_LSR, 8), dest, tmp2, RID_TMP);\r\n    emit_dm(as, ARMI_MOV|ARMF_SH(ARMSH_ROR, 8), tmp2, left);\r\n    emit_dn(as, ARMI_BIC|ARMI_K12|256*8|255, RID_TMP, RID_TMP);\r\n    emit_dnm(as, ARMI_EOR|ARMF_SH(ARMSH_ROR, 16), RID_TMP, left, left);\r\n  }\r\n}\r\n\r\n#define asm_band(as, ir)\tasm_bitop(as, ir, ARMI_AND)\r\n#define asm_bor(as, ir)\t\tasm_bitop(as, ir, ARMI_ORR)\r\n#define asm_bxor(as, ir)\tasm_bitop(as, ir, ARMI_EOR)\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, ARMShift sh)\r\n{\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    /* NYI: Turn SHL+SHR or BAND+SHR into uxtb, uxth or ubfx. */\r\n    /* NYI: Turn SHL+ASR into sxtb, sxth or sbfx. */\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    int32_t shift = (IR(ir->op2)->i & 31);\r\n    emit_dm(as, ARMI_MOV|ARMF_SH(sh, shift), dest, left);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_dm(as, ARMI_MOV|ARMF_RSH(sh, right), dest, left);\r\n  }\r\n}\r\n\r\n#define asm_bshl(as, ir)\tasm_bitshift(as, ir, ARMSH_LSL)\r\n#define asm_bshr(as, ir)\tasm_bitshift(as, ir, ARMSH_LSR)\r\n#define asm_bsar(as, ir)\tasm_bitshift(as, ir, ARMSH_ASR)\r\n#define asm_bror(as, ir)\tasm_bitshift(as, ir, ARMSH_ROR)\r\n#define asm_brol(as, ir)\tlua_assert(0)\r\n\r\nstatic void asm_intmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  uint32_t kcmp = 0, kmov = 0;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  Reg right = 0;\r\n  if (irref_isk(ir->op2)) {\r\n    kcmp = emit_isk12(ARMI_CMP, IR(ir->op2)->i);\r\n    if (kcmp) kmov = emit_isk12(ARMI_MOV, IR(ir->op2)->i);\r\n  }\r\n  if (!kmov) {\r\n    kcmp = 0;\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  }\r\n  if (kmov || dest != right) {\r\n    emit_dm(as, ARMF_CC(ARMI_MOV, cc)^kmov, dest, right);\r\n    cc ^= 1;  /* Must use opposite conditions for paired moves. */\r\n  } else {\r\n    cc ^= (CC_LT^CC_GT);  /* Otherwise may swap CC_LT <-> CC_GT. */\r\n  }\r\n  if (dest != left) emit_dm(as, ARMF_CC(ARMI_MOV, cc), dest, left);\r\n  emit_nm(as, ARMI_CMP^kcmp, left, right);\r\n}\r\n\r\n#if LJ_SOFTFP\r\nstatic void asm_sfpmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_softfp_cmp];\r\n  RegSet drop = RSET_SCRATCH;\r\n  Reg r;\r\n  IRRef args[4];\r\n  args[0] = ir->op1; args[1] = (ir+1)->op1;\r\n  args[2] = ir->op2; args[3] = (ir+1)->op2;\r\n  /* __aeabi_cdcmple preserves r0-r3. */\r\n  if (ra_hasreg(ir->r)) rset_clear(drop, ir->r);\r\n  if (ra_hasreg((ir+1)->r)) rset_clear(drop, (ir+1)->r);\r\n  if (!rset_test(as->freeset, RID_R2) &&\r\n      regcost_ref(as->cost[RID_R2]) == args[2]) rset_clear(drop, RID_R2);\r\n  if (!rset_test(as->freeset, RID_R3) &&\r\n      regcost_ref(as->cost[RID_R3]) == args[3]) rset_clear(drop, RID_R3);\r\n  ra_evictset(as, drop);\r\n  ra_destpair(as, ir);\r\n  emit_dm(as, ARMF_CC(ARMI_MOV, cc), RID_RETHI, RID_R3);\r\n  emit_dm(as, ARMF_CC(ARMI_MOV, cc), RID_RETLO, RID_R2);\r\n  emit_call(as, (void *)ci->func);\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    ra_leftov(as, r, args[r-RID_R0]);\r\n}\r\n#else\r\nstatic void asm_fpmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  Reg dest = (ra_dest(as, ir, RSET_FPR) & 15);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = ((left >> 8) & 15); left &= 15;\r\n  if (dest != left) emit_dm(as, ARMF_CC(ARMI_VMOV_D, cc^1), dest, left);\r\n  if (dest != right) emit_dm(as, ARMF_CC(ARMI_VMOV_D, cc), dest, right);\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ARMI_VCMP_D, left, right);\r\n}\r\n#endif\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int cc, int fcc)\r\n{\r\n#if LJ_SOFTFP\r\n  UNUSED(fcc);\r\n#else\r\n  if (irt_isnum(ir->t))\r\n    asm_fpmin_max(as, ir, fcc);\r\n  else\r\n#endif\r\n    asm_intmin_max(as, ir, cc);\r\n}\r\n\r\n#define asm_min(as, ir)\t\tasm_min_max(as, ir, CC_GT, CC_HI)\r\n#define asm_max(as, ir)\t\tasm_min_max(as, ir, CC_LT, CC_LO)\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\nstatic const uint8_t asm_compmap[IR_ABC+1] = {\r\n  /* op  FP swp  int cc   FP cc */\r\n  /* LT       */ CC_GE + (CC_HS << 4),\r\n  /* GE    x  */ CC_LT + (CC_HI << 4),\r\n  /* LE       */ CC_GT + (CC_HI << 4),\r\n  /* GT    x  */ CC_LE + (CC_HS << 4),\r\n  /* ULT   x  */ CC_HS + (CC_LS << 4),\r\n  /* UGE      */ CC_LO + (CC_LO << 4),\r\n  /* ULE   x  */ CC_HI + (CC_LO << 4),\r\n  /* UGT      */ CC_LS + (CC_LS << 4),\r\n  /* EQ       */ CC_NE + (CC_NE << 4),\r\n  /* NE       */ CC_EQ + (CC_EQ << 4),\r\n  /* ABC      */ CC_LS + (CC_LS << 4)  /* Same as UGT. */\r\n};\r\n\r\n#if LJ_SOFTFP\r\n/* FP comparisons. */\r\nstatic void asm_sfpcomp(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_softfp_cmp];\r\n  RegSet drop = RSET_SCRATCH;\r\n  Reg r;\r\n  IRRef args[4];\r\n  int swp = (((ir->o ^ (ir->o >> 2)) & ~(ir->o >> 3) & 1) << 1);\r\n  args[swp^0] = ir->op1; args[swp^1] = (ir+1)->op1;\r\n  args[swp^2] = ir->op2; args[swp^3] = (ir+1)->op2;\r\n  /* __aeabi_cdcmple preserves r0-r3. This helps to reduce spills. */\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    if (!rset_test(as->freeset, r) &&\r\n\tregcost_ref(as->cost[r]) == args[r-RID_R0]) rset_clear(drop, r);\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, (asm_compmap[ir->o] >> 4));\r\n  emit_call(as, (void *)ci->func);\r\n  for (r = RID_R0; r <= RID_R3; r++)\r\n    ra_leftov(as, r, args[r-RID_R0]);\r\n}\r\n#else\r\n/* FP comparisons. */\r\nstatic void asm_fpcomp(ASMState *as, IRIns *ir)\r\n{\r\n  Reg left, right;\r\n  ARMIns ai;\r\n  int swp = ((ir->o ^ (ir->o >> 2)) & ~(ir->o >> 3) & 1);\r\n  if (!swp && irref_isk(ir->op2) && ir_knum(IR(ir->op2))->u64 == 0) {\r\n    left = (ra_alloc1(as, ir->op1, RSET_FPR) & 15);\r\n    right = 0;\r\n    ai = ARMI_VCMPZ_D;\r\n  } else {\r\n    left = ra_alloc2(as, ir, RSET_FPR);\r\n    if (swp) {\r\n      right = (left & 15); left = ((left >> 8) & 15);\r\n    } else {\r\n      right = ((left >> 8) & 15); left &= 15;\r\n    }\r\n    ai = ARMI_VCMP_D;\r\n  }\r\n  asm_guardcc(as, (asm_compmap[ir->o] >> 4));\r\n  emit_d(as, ARMI_VMRS, 0);\r\n  emit_dm(as, ai, left, right);\r\n}\r\n#endif\r\n\r\n/* Integer comparisons. */\r\nstatic void asm_intcomp(ASMState *as, IRIns *ir)\r\n{\r\n  ARMCC cc = (asm_compmap[ir->o] & 15);\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  Reg left;\r\n  uint32_t m;\r\n  int cmpprev0 = 0;\r\n  lua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n  if (asm_swapops(as, lref, rref)) {\r\n    Reg tmp = lref; lref = rref; rref = tmp;\r\n    if (cc >= CC_GE) cc ^= 7;  /* LT <-> GT, LE <-> GE */\r\n    else if (cc > CC_NE) cc ^= 11;  /* LO <-> HI, LS <-> HS */\r\n  }\r\n  if (irref_isk(rref) && IR(rref)->i == 0) {\r\n    IRIns *irl = IR(lref);\r\n    cmpprev0 = (irl+1 == ir);\r\n    /* Combine comp(BAND(left, right), 0) into tst left, right. */\r\n    if (cmpprev0 && irl->o == IR_BAND && !ra_used(irl)) {\r\n      IRRef blref = irl->op1, brref = irl->op2;\r\n      uint32_t m2 = 0;\r\n      Reg bleft;\r\n      if (asm_swapops(as, blref, brref)) {\r\n\tReg tmp = blref; blref = brref; brref = tmp;\r\n      }\r\n      if (irref_isk(brref)) {\r\n\tm2 = emit_isk12(ARMI_AND, IR(brref)->i);\r\n\tif ((m2 & (ARMI_AND^ARMI_BIC)))\r\n\t  goto notst;  /* Not beneficial if we miss a constant operand. */\r\n      }\r\n      if (cc == CC_GE) cc = CC_PL;\r\n      else if (cc == CC_LT) cc = CC_MI;\r\n      else if (cc > CC_NE) goto notst;  /* Other conds don't work with tst. */\r\n      bleft = ra_alloc1(as, blref, RSET_GPR);\r\n      if (!m2) m2 = asm_fuseopm(as, 0, brref, rset_exclude(RSET_GPR, bleft));\r\n      asm_guardcc(as, cc);\r\n      emit_n(as, ARMI_TST^m2, bleft);\r\n      return;\r\n    }\r\n  }\r\nnotst:\r\n  left = ra_alloc1(as, lref, RSET_GPR);\r\n  m = asm_fuseopm(as, ARMI_CMP, rref, rset_exclude(RSET_GPR, left));\r\n  asm_guardcc(as, cc);\r\n  emit_n(as, ARMI_CMP^m, left);\r\n  /* Signed comparison with zero and referencing previous ins? */\r\n  if (cmpprev0 && (cc <= CC_NE || cc >= CC_GE))\r\n    as->flagmcp = as->mcp;  /* Allow elimination of the compare. */\r\n}\r\n\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n#if !LJ_SOFTFP\r\n  if (irt_isnum(ir->t))\r\n    asm_fpcomp(as, ir);\r\n  else\r\n#endif\r\n    asm_intcomp(as, ir);\r\n}\r\n\r\n#define asm_equal(as, ir)\tasm_comp(as, ir)\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_int64comp(ASMState *as, IRIns *ir)\r\n{\r\n  int signedcomp = (ir->o <= IR_GT);\r\n  ARMCC cclo, cchi;\r\n  Reg leftlo, lefthi;\r\n  uint32_t mlo, mhi;\r\n  RegSet allow = RSET_GPR, oldfree;\r\n\r\n  /* Always use unsigned comparison for loword. */\r\n  cclo = asm_compmap[ir->o + (signedcomp ? 4 : 0)] & 15;\r\n  leftlo = ra_alloc1(as, ir->op1, allow);\r\n  oldfree = as->freeset;\r\n  mlo = asm_fuseopm(as, ARMI_CMP, ir->op2, rset_clear(allow, leftlo));\r\n  allow &= ~(oldfree & ~as->freeset);  /* Update for allocs of asm_fuseopm. */\r\n\r\n  /* Use signed or unsigned comparison for hiword. */\r\n  cchi = asm_compmap[ir->o] & 15;\r\n  lefthi = ra_alloc1(as, (ir+1)->op1, allow);\r\n  mhi = asm_fuseopm(as, ARMI_CMP, (ir+1)->op2, rset_clear(allow, lefthi));\r\n\r\n  /* All register allocations must be performed _before_ this point. */\r\n  if (signedcomp) {\r\n    MCLabel l_around = emit_label(as);\r\n    asm_guardcc(as, cclo);\r\n    emit_n(as, ARMI_CMP^mlo, leftlo);\r\n    emit_branch(as, ARMF_CC(ARMI_B, CC_NE), l_around);\r\n    if (cchi == CC_GE || cchi == CC_LE) cchi ^= 6;  /* GE -> GT, LE -> LT */\r\n    asm_guardcc(as, cchi);\r\n  } else {\r\n    asm_guardcc(as, cclo);\r\n    emit_n(as, ARMF_CC(ARMI_CMP, CC_EQ)^mlo, leftlo);\r\n  }\r\n  emit_n(as, ARMI_CMP^mhi, lefthi);\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI || LJ_SOFTFP\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o <= IR_NE) {  /* 64 bit integer or FP comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n#if LJ_SOFTFP\r\n    if (!irt_isint(ir->t)) {\r\n      asm_sfpcomp(as, ir-1);\r\n      return;\r\n    }\r\n#endif\r\n#if LJ_HASFFI\r\n    asm_int64comp(as, ir-1);\r\n#endif\r\n    return;\r\n#if LJ_SOFTFP\r\n  } else if ((ir-1)->o == IR_MIN || (ir-1)->o == IR_MAX) {\r\n    as->curins--;  /* Always skip the loword min/max. */\r\n    if (uselo || usehi)\r\n      asm_sfpmin_max(as, ir-1, (ir-1)->o == IR_MIN ? CC_HI : CC_LO);\r\n    return;\r\n#elif LJ_HASFFI\r\n  } else if ((ir-1)->o == IR_CONV) {\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n#endif\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    if ((ir-1)->r != RID_SINK)\r\n      asm_xstore_(as, ir, 4);\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n#if LJ_HASFFI\r\n  case IR_ADD:\r\n    as->curins--;\r\n    asm_intop(as, ir, ARMI_ADC);\r\n    asm_intop(as, ir-1, ARMI_ADD|ARMI_S);\r\n    break;\r\n  case IR_SUB:\r\n    as->curins--;\r\n    asm_intop(as, ir, ARMI_SBC);\r\n    asm_intop(as, ir-1, ARMI_SUB|ARMI_S);\r\n    break;\r\n  case IR_NEG:\r\n    as->curins--;\r\n    asm_intneg(as, ir, ARMI_RSC);\r\n    asm_intneg(as, ir-1, ARMI_RSB|ARMI_S);\r\n    break;\r\n#endif\r\n#if LJ_SOFTFP\r\n  case IR_SLOAD: case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n  case IR_STRTO:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RSET_GPR);  /* Mark lo op as used. */\r\n    break;\r\n#endif\r\n  case IR_CALLN:\r\n  case IR_CALLS:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n#if LJ_SOFTFP\r\n  case IR_ASTORE: case IR_HSTORE: case IR_USTORE: case IR_TOSTR:\r\n#endif\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);\r\n#endif\r\n}\r\n\r\n/* -- Profiling ----------------------------------------------------------- */\r\n\r\nstatic void asm_prof(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(ir);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_n(as, ARMI_TST|ARMI_K12|HOOK_PROFILE, RID_TMP);\r\n  emit_lsptr(as, ARMI_LDRB, RID_TMP, (void *)&J2G(as->J)->hookmask);\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  Reg pbase;\r\n  uint32_t k;\r\n  if (irp) {\r\n    if (!ra_hasspill(irp->s)) {\r\n      pbase = irp->r;\r\n      lua_assert(ra_hasreg(pbase));\r\n    } else if (allow) {\r\n      pbase = rset_pickbot(allow);\r\n    } else {\r\n      pbase = RID_RET;\r\n      emit_lso(as, ARMI_LDR, RID_RET, RID_SP, 0);  /* Restore temp. register. */\r\n    }\r\n  } else {\r\n    pbase = RID_BASE;\r\n  }\r\n  emit_branch(as, ARMF_CC(ARMI_BL, CC_LS), exitstub_addr(as->J, exitno));\r\n  k = emit_isk12(0, (int32_t)(8*topslot));\r\n  lua_assert(k);\r\n  emit_n(as, ARMI_CMP^k, RID_TMP);\r\n  emit_dnm(as, ARMI_SUB, RID_TMP, RID_TMP, pbase);\r\n  emit_lso(as, ARMI_LDR, RID_TMP, RID_TMP,\r\n\t   (int32_t)offsetof(lua_State, maxstack));\r\n  if (irp) {  /* Must not spill arbitrary registers in head of side trace. */\r\n    int32_t i = i32ptr(&J2G(as->J)->cur_L);\r\n    if (ra_hasspill(irp->s))\r\n      emit_lso(as, ARMI_LDR, pbase, RID_SP, sps_scale(irp->s));\r\n    emit_lso(as, ARMI_LDR, RID_TMP, RID_TMP, (i & 4095));\r\n    if (ra_hasspill(irp->s) && !allow)\r\n      emit_lso(as, ARMI_STR, RID_RET, RID_SP, 0);  /* Save temp. register. */\r\n    emit_loadi(as, RID_TMP, (i & ~4095));\r\n  } else {\r\n    emit_getgl(as, RID_TMP, cur_L);\r\n  }\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n#if LJ_SOFTFP\r\n      RegSet odd = rset_exclude(RSET_GPRODD, RID_BASE);\r\n      Reg tmp;\r\n      lua_assert(irref_isk(ref));  /* LJ_SOFTFP: must be a number constant. */\r\n      tmp = ra_allock(as, (int32_t)ir_knum(ir)->u32.lo,\r\n\t\t      rset_exclude(RSET_GPREVEN, RID_BASE));\r\n      emit_lso(as, ARMI_STR, tmp, RID_BASE, ofs);\r\n      if (rset_test(as->freeset, tmp+1)) odd = RID2RSET(tmp+1);\r\n      tmp = ra_allock(as, (int32_t)ir_knum(ir)->u32.hi, odd);\r\n      emit_lso(as, ARMI_STR, tmp, RID_BASE, ofs+4);\r\n#else\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_vlso(as, ARMI_VSTR_D, src, RID_BASE, ofs);\r\n#endif\r\n    } else {\r\n      RegSet odd = rset_exclude(RSET_GPRODD, RID_BASE);\r\n      Reg type;\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, rset_exclude(RSET_GPREVEN, RID_BASE));\r\n\temit_lso(as, ARMI_STR, src, RID_BASE, ofs);\r\n\tif (rset_test(as->freeset, src+1)) odd = RID2RSET(src+1);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), odd);\r\n#if LJ_SOFTFP\r\n      } else if ((sn & SNAP_SOFTFPNUM)) {\r\n\ttype = ra_alloc1(as, ref+1, rset_exclude(RSET_GPRODD, RID_BASE));\r\n#endif\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), odd);\r\n      }\r\n      emit_lso(as, ARMI_STR, type, RID_BASE, ofs+4);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp1, tmp2;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_n(as, ARMI_CMP|ARMI_K12|0, RID_RET);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  tmp1 = ra_releasetmp(as, ASMREF_TMP1);\r\n  tmp2 = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp2, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_branch(as, ARMF_CC(ARMI_B, CC_LS), l_end);\r\n  emit_nm(as, ARMI_CMP, RID_TMP, tmp2);\r\n  emit_lso(as, ARMI_LDR, tmp2, tmp1,\r\n\t   (int32_t)offsetof(global_State, gc.threshold));\r\n  emit_lso(as, ARMI_LDR, RID_TMP, tmp1,\r\n\t   (int32_t)offsetof(global_State, gc.total));\r\n  ra_allockreg(as, i32ptr(J2G(as->J)), tmp1);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guardcc already inverted the bcc and patched the final bl. */\r\n    p[-2] |= ((uint32_t)(target-p) & 0x00ffffffu);\r\n  } else {\r\n    p[-1] = ARMI_B | ((uint32_t)((target-p)-1) & 0x00ffffffu);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Reload L register from g->cur_L. */\r\nstatic void asm_head_lreg(ASMState *as)\r\n{\r\n  IRIns *ir = IR(ASMREF_L);\r\n  if (ra_used(ir)) {\r\n    Reg r = ra_dest(as, ir, RSET_GPR);\r\n    emit_getgl(as, r, cur_L);\r\n    ra_evictk(as);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir;\r\n  asm_head_lreg(as);\r\n  ir = IR(REF_BASE);\r\n  if (ra_hasreg(ir->r) && (rset_test(as->modset, ir->r) || irt_ismarked(ir->t)))\r\n    ra_spill(as, ir);\r\n  ra_destreg(as, ir, RID_BASE);\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir;\r\n  asm_head_lreg(as);\r\n  ir = IR(REF_BASE);\r\n  if (ra_hasreg(ir->r) && (rset_test(as->modset, ir->r) || irt_ismarked(ir->t)))\r\n    ra_spill(as, ir);\r\n  if (ra_hasspill(irp->s)) {\r\n    rset_clear(allow, ra_dest(as, ir, allow));\r\n  } else {\r\n    Reg r = irp->r;\r\n    lua_assert(ra_hasreg(r));\r\n    rset_clear(allow, r);\r\n    if (r != ir->r && !rset_test(as->freeset, r))\r\n      ra_restore(as, regcost_ref(as->cost[r]));\r\n    ra_destreg(as, ir, r);\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    as->mctop = --p;\r\n  } else {\r\n    /* Patch stack adjustment. */\r\n    uint32_t k = emit_isk12(ARMI_ADD, spadj);\r\n    lua_assert(k);\r\n    p[-2] = (ARMI_ADD^k) | ARMF_D(RID_SP) | ARMF_N(RID_SP);\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  p[-1] = ARMI_B|(((target-p)-1)&0x00ffffffu);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop - 1;  /* Leave room for exit branch. */\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    as->mcp = p-1;  /* Leave room for stack pointer adjustment. */\r\n    as->invmcp = NULL;\r\n  }\r\n  *p = 0;  /* Prevent load/store merging. */\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = CCI_XNARGS(ci);\r\n  int nslots = 0, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR, fprodd = 0;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++) {\r\n    if (!LJ_SOFTFP && args[i] && irt_isfp(IR(args[i])->t)) {\r\n      if (!LJ_ABI_SOFTFP && !(ci->flags & CCI_VARARG)) {\r\n\tif (irt_isnum(IR(args[i])->t)) {\r\n\t  if (nfpr > 0) nfpr--;\r\n\t  else fprodd = 0, nslots = (nslots + 3) & ~1;\r\n\t} else {\r\n\t  if (fprodd) fprodd--;\r\n\t  else if (nfpr > 0) fprodd = 1, nfpr--;\r\n\t  else nslots++;\r\n\t}\r\n      } else if (irt_isnum(IR(args[i])->t)) {\r\n\tngpr &= ~1;\r\n\tif (ngpr > 0) ngpr -= 2; else nslots += 2;\r\n      } else {\r\n\tif (ngpr > 0) ngpr--; else nslots++;\r\n      }\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  /* May need extra exit for asm_stack_check on side traces. */\r\n  asm_exitstub_setup(as, as->T->nsnap + (as->parent ? 1 : 0));\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *cstart = NULL, *cend = p;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MCode *px = exitstub_addr(J, exitno) - 2;\r\n  for (; p < pe; p++) {\r\n    /* Look for bl_cc exitstub, replace with b_cc target. */\r\n    uint32_t ins = *p;\r\n    if ((ins & 0x0f000000u) == 0x0b000000u && ins < 0xf0000000u &&\r\n\t((ins ^ (px-p)) & 0x00ffffffu) == 0) {\r\n      *p = (ins & 0xfe000000u) | (((target-p)-2) & 0x00ffffffu);\r\n      cend = p+1;\r\n      if (!cstart) cstart = p;\r\n    }\r\n  }\r\n  lua_assert(cstart != NULL);\r\n  lj_mcode_sync(cstart, cend);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm_mips.h",
    "content": "/*\r\n** MIPS IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate a register or RID_ZERO. */\r\nstatic Reg ra_alloc1z(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!(allow & RSET_FPR) && irref_isk(ref) && IR(ref)->i == 0)\r\n      return RID_ZERO;\r\n    r = ra_allocref(as, ref, allow);\r\n  } else {\r\n    ra_noweak(as, r);\r\n  }\r\n  return r;\r\n}\r\n\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_alloc1z(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_alloc1z(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_alloc1z(as, ir->op2, allow);\r\n    left = ra_alloc1z(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_alloc1z(as, ir->op1, allow);\r\n    right = ra_alloc1z(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Need some spare long-range jump slots, for out-of-range branches. */\r\n#define MIPS_SPAREJUMP\t\t4\r\n\r\n/* Setup spare long-range jump slots per mcarea. */\r\nstatic void asm_sparejump_setup(ASMState *as)\r\n{\r\n  MCode *mxp = as->mcbot;\r\n  /* Assumes sizeof(MCLink) == 8. */\r\n  if (((uintptr_t)mxp & (LJ_PAGESIZE-1)) == 8) {\r\n    lua_assert(MIPSI_NOP == 0);\r\n    memset(mxp+2, 0, MIPS_SPAREJUMP*8);\r\n    mxp += MIPS_SPAREJUMP*2;\r\n    lua_assert(mxp < as->mctop);\r\n    lj_mcode_sync(as->mcbot, mxp);\r\n    lj_mcode_commitbot(as->J, mxp);\r\n    as->mcbot = mxp;\r\n    as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  }\r\n}\r\n\r\n/* Setup exit stub after the end of each trace. */\r\nstatic void asm_exitstub_setup(ASMState *as)\r\n{\r\n  MCode *mxp = as->mctop;\r\n  /* sw TMP, 0(sp); j ->vm_exit_handler; li TMP, traceno */\r\n  *--mxp = MIPSI_LI|MIPSF_T(RID_TMP)|as->T->traceno;\r\n  *--mxp = MIPSI_J|((((uintptr_t)(void *)lj_vm_exit_handler)>>2)&0x03ffffffu);\r\n  lua_assert(((uintptr_t)mxp ^ (uintptr_t)(void *)lj_vm_exit_handler)>>28 == 0);\r\n  *--mxp = MIPSI_SW|MIPSF_T(RID_TMP)|MIPSF_S(RID_SP)|0;\r\n  as->mctop = mxp;\r\n}\r\n\r\n/* Keep this in-sync with exitstub_trace_addr(). */\r\n#define asm_exitstub_addr(as)\t((as)->mctop)\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guard(ASMState *as, MIPSIns mi, Reg rs, Reg rt)\r\n{\r\n  MCode *target = asm_exitstub_addr(as);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->invmcp = NULL;\r\n    as->loopinv = 1;\r\n    as->mcp = p+1;\r\n    mi = mi ^ ((mi>>28) == 1 ? 0x04000000u : 0x00010000u);  /* Invert cond. */\r\n    target = p;  /* Patch target later in asm_loop_fixup. */\r\n  }\r\n  emit_ti(as, MIPSI_LI, RID_TMP, as->snapno);\r\n  emit_branch(as, mi, rs, rt, target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (checki16(ofs)) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (checki16(ofs)) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\tint32_t jgl = (intptr_t)J2G(as->J);\r\n\tif ((uint32_t)(ofs-jgl) < 65536) {\r\n\t  *ofsp = ofs-jgl-32768;\r\n\t  return RID_JGL;\r\n\t} else {\r\n\t  *ofsp = (int16_t)ofs;\r\n\t  return ra_allock(as, ofs-(int16_t)ofs, allow);\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, MIPSIns mi, Reg rt, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) && (ofs2 = ofs + IR(ir->op2)->i, checki16(ofs2))) {\r\n\tref = ir->op1;\r\n\tofs = ofs2;\r\n      }\r\n    } else if (ir->o == IR_STRREF) {\r\n      int32_t ofs2 = 65536;\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs2 = ofs + IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs2 = ofs + IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      }\r\n      if (!checki16(ofs2)) {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\temit_hsi(as, mi, rt, RID_TMP, ofs);\r\n\temit_dst(as, MIPSI_ADDU, RID_TMP, left, right);\r\n\treturn;\r\n      }\r\n      ofs = ofs2;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n  emit_hsi(as, mi, rt, base, ofs);\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_XNARGS(ci);\r\n  int32_t ofs = 16;\r\n  Reg gpr, fpr = REGARG_FIRSTFPR;\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n  for (gpr = REGARG_FIRSTGPR; gpr <= REGARG_LASTGPR; gpr++)\r\n    as->cost[gpr] = REGCOST(~0u, ASMREF_L);\r\n  gpr = REGARG_FIRSTGPR;\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    if (ref) {\r\n      IRIns *ir = IR(ref);\r\n      if (irt_isfp(ir->t) && fpr <= REGARG_LASTFPR &&\r\n\t  !(ci->flags & CCI_VARARG)) {\r\n\tlua_assert(rset_test(as->freeset, fpr));  /* Already evicted. */\r\n\tra_leftov(as, fpr, ref);\r\n\tfpr += 2;\r\n\tgpr += irt_isnum(ir->t) ? 2 : 1;\r\n      } else {\r\n\tfpr = REGARG_LASTFPR+1;\r\n\tif (irt_isnum(ir->t)) gpr = (gpr+1) & ~1;\r\n\tif (gpr <= REGARG_LASTGPR) {\r\n\t  lua_assert(rset_test(as->freeset, gpr));  /* Already evicted. */\r\n\t  if (irt_isfp(ir->t)) {\r\n\t    RegSet of = as->freeset;\r\n\t    Reg r;\r\n\t    /* Workaround to protect argument GPRs from being used for remat. */\r\n\t    as->freeset &= ~RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1);\r\n\t    r = ra_alloc1(as, ref, RSET_FPR);\r\n\t    as->freeset |= (of & RSET_RANGE(REGARG_FIRSTGPR, REGARG_LASTGPR+1));\r\n\t    if (irt_isnum(ir->t)) {\r\n\t      emit_tg(as, MIPSI_MFC1, gpr+(LJ_BE?0:1), r+1);\r\n\t      emit_tg(as, MIPSI_MFC1, gpr+(LJ_BE?1:0), r);\r\n\t      lua_assert(rset_test(as->freeset, gpr+1));  /* Already evicted. */\r\n\t      gpr += 2;\r\n\t    } else if (irt_isfloat(ir->t)) {\r\n\t      emit_tg(as, MIPSI_MFC1, gpr, r);\r\n\t      gpr++;\r\n\t    }\r\n\t  } else {\r\n\t    ra_leftov(as, gpr, ref);\r\n\t    gpr++;\r\n\t  }\r\n\t} else {\r\n\t  Reg r = ra_alloc1z(as, ref, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n\t  if (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += irt_isnum(ir->t) ? 8 : 4;\r\n\t}\r\n      }\r\n    } else {\r\n      fpr = REGARG_LASTFPR+1;\r\n      if (gpr <= REGARG_LASTGPR)\r\n\tgpr++;\r\n      else\r\n\tofs += 4;\r\n    }\r\n    checkmclim(as);\r\n  }\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (irt_isfp(ir->t)) {\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\tint32_t ofs = sps_scale(ir->s);\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_tg(as, MIPSI_MTC1, RID_RETHI, dest+1);\r\n\t  emit_tg(as, MIPSI_MTC1, RID_RETLO, dest);\r\n\t}\r\n\tif (ofs) {\r\n\t  emit_tsi(as, MIPSI_SW, RID_RETLO, RID_SP, ofs+(LJ_BE?4:0));\r\n\t  emit_tsi(as, MIPSI_SW, RID_RETHI, RID_SP, ofs+(LJ_BE?0:4));\r\n\t}\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(irf->i);\r\n  } else {  /* Need specific register for indirect calls. */\r\n    Reg r = ra_alloc1(as, func, RID2RSET(RID_CFUNCADDR));\r\n    MCode *p = as->mcp;\r\n    if (r == RID_CFUNCADDR)\r\n      *--p = MIPSI_NOP;\r\n    else\r\n      *--p = MIPSI_MOVE | MIPSF_D(RID_CFUNCADDR) | MIPSF_S(r);\r\n    *--p = MIPSI_JALR | MIPSF_S(r);\r\n    as->mcp = p;\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\nstatic void asm_callround(ASMState *as, IRIns *ir, IRCallID id)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RID2RSET(RID_R1)|RID2RSET(RID_R12)|RID2RSET(RID_FPRET)|\r\n\t\tRID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(REGARG_FIRSTFPR);\r\n  if (ra_hasreg(ir->r)) rset_clear(drop, ir->r);\r\n  ra_evictset(as, drop);\r\n  ra_destreg(as, ir, RID_FPRET);\r\n  emit_call(as, (void *)lj_ir_callinfo[id].func);\r\n  ra_leftov(as, REGARG_FIRSTFPR, ir->op1);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+LJ_FR2+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guard(as, MIPSI_BNE, RID_TMP,\r\n\t    ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_tsi(as, MIPSI_LW, RID_TMP, base, -8);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guard(as, MIPSI_BC1F, 0, 0);\r\n  emit_fgh(as, MIPSI_C_EQ_D, 0, tmp, left);\r\n  emit_fg(as, MIPSI_CVT_D_W, tmp, tmp);\r\n  emit_tg(as, MIPSI_MFC1, dest, tmp);\r\n  emit_fg(as, MIPSI_CVT_W_D, tmp, left);\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  emit_tg(as, MIPSI_MFC1, dest, tmp);\r\n  emit_fgh(as, MIPSI_ADD_D, tmp, left, right);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(irt_isint64(ir->t) ||\r\n\t       (st == IRT_I64 || st == IRT_U64))); /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      emit_fg(as, st == IRT_NUM ? MIPSI_CVT_S_D : MIPSI_CVT_D_S,\r\n\t      dest, ra_alloc1(as, lref, RSET_FPR));\r\n    } else if (st == IRT_U32) {  /* U32 to FP conversion. */\r\n      /* y = (x ^ 0x8000000) + 2147483648.0 */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      emit_fgh(as, irt_isfloat(ir->t) ? MIPSI_ADD_S : MIPSI_ADD_D,\r\n\t       dest, dest, tmp);\r\n      emit_fg(as, irt_isfloat(ir->t) ? MIPSI_CVT_S_W : MIPSI_CVT_D_W,\r\n\t      dest, dest);\r\n      if (irt_isfloat(ir->t))\r\n\temit_lsptr(as, MIPSI_LWC1, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(4f000000,4f000000)),\r\n\t\t   RSET_GPR);\r\n      else\r\n\temit_lsptr(as, MIPSI_LDC1, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(41e00000,00000000)),\r\n\t\t   RSET_GPR);\r\n      emit_tg(as, MIPSI_MTC1, RID_TMP, dest);\r\n      emit_dst(as, MIPSI_XOR, RID_TMP, RID_TMP, left);\r\n      emit_ti(as, MIPSI_LUI, RID_TMP, 0x8000);\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_fg(as, irt_isfloat(ir->t) ? MIPSI_CVT_S_W : MIPSI_CVT_D_W,\r\n\t      dest, dest);\r\n      emit_tg(as, MIPSI_MTC1, left, dest);\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      if (irt_isu32(ir->t)) {\r\n\t/* y = (int)floor(x - 2147483648.0) ^ 0x80000000 */\r\n\temit_dst(as, MIPSI_XOR, dest, dest, RID_TMP);\r\n\temit_ti(as, MIPSI_LUI, RID_TMP, 0x8000);\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, st == IRT_FLOAT ? MIPSI_FLOOR_W_S : MIPSI_FLOOR_W_D,\r\n\t\ttmp, tmp);\r\n\temit_fgh(as, st == IRT_FLOAT ? MIPSI_SUB_S : MIPSI_SUB_D,\r\n\t\t tmp, left, tmp);\r\n\tif (st == IRT_FLOAT)\r\n\t  emit_lsptr(as, MIPSI_LWC1, (tmp & 31),\r\n\t\t     (void *)lj_ir_k64_find(as->J, U64x(4f000000,4f000000)),\r\n\t\t     RSET_GPR);\r\n\telse\r\n\t  emit_lsptr(as, MIPSI_LDC1, (tmp & 31),\r\n\t\t     (void *)lj_ir_k64_find(as->J, U64x(41e00000,00000000)),\r\n\t\t     RSET_GPR);\r\n      } else {\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, st == IRT_FLOAT ? MIPSI_TRUNC_W_S : MIPSI_TRUNC_W_D,\r\n\t\ttmp, left);\r\n      }\r\n    }\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((ir->op2 & IRCONV_SEXT)) {\r\n\tif ((as->flags & JIT_F_MIPS32R2)) {\r\n\t  emit_dst(as, st == IRT_I8 ? MIPSI_SEB : MIPSI_SEH, dest, 0, left);\r\n\t} else {\r\n\t  uint32_t shift = st == IRT_I8 ? 24 : 16;\r\n\t  emit_dta(as, MIPSI_SRA, dest, dest, shift);\r\n\t  emit_dta(as, MIPSI_SLL, dest, left, shift);\r\n\t}\r\n      } else {\r\n\temit_tsi(as, MIPSI_ANDI, dest, left,\r\n\t\t (int32_t)(st == IRT_U8 ? 0xff : 0xffff));\r\n      }\r\n    } else {  /* 32/64 bit integer conversions. */\r\n      /* Only need to handle 32/32 bit no-op (cast) on 32 bit archs. */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  RegSet drop = RSET_SCRATCH;\r\n  if (ra_hasreg(ir->r)) rset_set(drop, ir->r);  /* Spill dest reg (if any). */\r\n  ra_evictset(as, drop);\r\n  asm_guard(as, MIPSI_BEQ, RID_RET, RID_ZERO);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1),\r\n\t   RID_SP, sps_scale(ir->s));\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref))  /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    else  /* Otherwise force a spill and use the spill slot. */\r\n      emit_tsi(as, MIPSI_ADDIU, dest, RID_SP, ra_spill(as, ir));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_tsi(as, MIPSI_ADDIU, dest, RID_JGL, offsetof(global_State, tmptv)-32768);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_setgl(as, src, tmptv.gcr);\r\n    }\r\n    type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_setgl(as, type, tmptv.it);\r\n  }\r\n}\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    ofs += 8*IR(ir->op2)->i;\r\n    if (checki16(ofs)) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, base, ofs);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_dst(as, MIPSI_ADDU, dest, RID_TMP, base);\r\n  emit_dta(as, MIPSI_SLL, RID_TMP, idx, 3);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, type = RID_NONE, tmpnum = RID_NONE, tmp1 = RID_TMP, tmp2;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  rset_clear(allow, tab);\r\n  if (irt_isnum(kt)) {\r\n    key = ra_alloc1(as, refkey, RSET_FPR);\r\n    tmpnum = ra_scratch(as, rset_exclude(RSET_FPR, key));\r\n  } else if (!irt_ispri(kt)) {\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n    type = ra_allock(as, irt_toitype(irkey->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  tmp2 = ra_scratch(as, allow);\r\n  rset_clear(allow, tmp2);\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  as->invmcp = NULL;\r\n  if (merge == IR_NE)\r\n    asm_guard(as, MIPSI_B, RID_ZERO, RID_ZERO);\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n  /* Follow hash chain until the end. */\r\n  emit_move(as, dest, tmp2);\r\n  l_loop = --as->mcp;\r\n  emit_tsi(as, MIPSI_LW, tmp2, dest, (int32_t)offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ) {  /* Must match asm_guard(). */\r\n    emit_ti(as, MIPSI_LI, RID_TMP, as->snapno);\r\n    l_end = asm_exitstub_addr(as);\r\n  }\r\n  if (irt_isnum(kt)) {\r\n    emit_branch(as, MIPSI_BC1T, 0, 0, l_end);\r\n    emit_fgh(as, MIPSI_C_EQ_D, 0, tmpnum, key);\r\n    *--as->mcp = MIPSI_NOP;  /* Avoid NaN comparison overhead. */\r\n    emit_branch(as, MIPSI_BEQ, tmp2, RID_ZERO, l_next);\r\n    emit_tsi(as, MIPSI_SLTIU, tmp2, tmp2, (int32_t)LJ_TISNUM);\r\n    emit_hsi(as, MIPSI_LDC1, tmpnum, dest, (int32_t)offsetof(Node, key.n));\r\n  } else {\r\n    if (irt_ispri(kt)) {\r\n      emit_branch(as, MIPSI_BEQ, tmp2, type, l_end);\r\n    } else {\r\n      emit_branch(as, MIPSI_BEQ, tmp1, key, l_end);\r\n      emit_tsi(as, MIPSI_LW, tmp1, dest, (int32_t)offsetof(Node, key.gcr));\r\n      emit_branch(as, MIPSI_BNE, tmp2, type, l_next);\r\n    }\r\n  }\r\n  emit_tsi(as, MIPSI_LW, tmp2, dest, (int32_t)offsetof(Node, key.it));\r\n  *l_loop = MIPSI_BNE | MIPSF_S(tmp2) | ((as->mcp-l_loop-1) & 0xffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_tsi(as, MIPSI_LW, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    Reg tmphash = tmp1;\r\n    if (irref_isk(refkey))\r\n      tmphash = ra_allock(as, khash, allow);\r\n    emit_dst(as, MIPSI_ADDU, dest, dest, tmp1);\r\n    lua_assert(sizeof(Node) == 24);\r\n    emit_dst(as, MIPSI_SUBU, tmp1, tmp2, tmp1);\r\n    emit_dta(as, MIPSI_SLL, tmp1, tmp1, 3);\r\n    emit_dta(as, MIPSI_SLL, tmp2, tmp1, 5);\r\n    emit_dst(as, MIPSI_AND, tmp1, tmp2, tmphash);\r\n    emit_tsi(as, MIPSI_LW, dest, tab, (int32_t)offsetof(GCtab, node));\r\n    emit_tsi(as, MIPSI_LW, tmp2, tab, (int32_t)offsetof(GCtab, hmask));\r\n    if (irref_isk(refkey)) {\r\n      /* Nothing to do. */\r\n    } else if (irt_isstr(kt)) {\r\n      emit_tsi(as, MIPSI_LW, tmp1, key, (int32_t)offsetof(GCstr, hash));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      emit_dst(as, MIPSI_SUBU, tmp1, tmp1, tmp2);\r\n      emit_rotr(as, tmp2, tmp2, dest, (-HASH_ROT3)&31);\r\n      emit_dst(as, MIPSI_XOR, tmp1, tmp1, tmp2);\r\n      emit_rotr(as, tmp1, tmp1, dest, (-HASH_ROT2-HASH_ROT1)&31);\r\n      emit_dst(as, MIPSI_SUBU, tmp2, tmp2, dest);\r\n      if (irt_isnum(kt)) {\r\n\temit_dst(as, MIPSI_XOR, tmp2, tmp2, tmp1);\r\n\tif ((as->flags & JIT_F_MIPS32R2)) {\r\n\t  emit_dta(as, MIPSI_ROTR, dest, tmp1, (-HASH_ROT1)&31);\r\n\t} else {\r\n\t  emit_dst(as, MIPSI_OR, dest, dest, tmp1);\r\n\t  emit_dta(as, MIPSI_SLL, tmp1, tmp1, HASH_ROT1);\r\n\t  emit_dta(as, MIPSI_SRL, dest, tmp1, (-HASH_ROT1)&31);\r\n\t}\r\n\temit_dst(as, MIPSI_ADDU, tmp1, tmp1, tmp1);\r\n\temit_tg(as, MIPSI_MFC1, tmp2, key);\r\n\temit_tg(as, MIPSI_MFC1, tmp1, key+1);\r\n      } else {\r\n\temit_dst(as, MIPSI_XOR, tmp2, key, tmp1);\r\n\temit_rotr(as, dest, tmp1, tmp2, (-HASH_ROT1)&31);\r\n\temit_dst(as, MIPSI_ADDU, tmp1, key, ra_allock(as, HASH_BIAS, allow));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir)||ofs > 32736) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  int32_t lo, hi;\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 32736) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_tsi(as, MIPSI_ADDIU, dest, node, ofs);\r\n  }\r\n  if (!irt_ispri(irkey->t)) {\r\n    key = ra_scratch(as, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  if (irt_isnum(irkey->t)) {\r\n    lo = (int32_t)ir_knum(irkey)->u32.lo;\r\n    hi = (int32_t)ir_knum(irkey)->u32.hi;\r\n  } else {\r\n    lo = irkey->i;\r\n    hi = irt_toitype(irkey->t);\r\n    if (!ra_hasreg(key))\r\n      goto nolo;\r\n  }\r\n  asm_guard(as, MIPSI_BNE, key, lo ? ra_allock(as, lo, allow) : RID_ZERO);\r\nnolo:\r\n  asm_guard(as, MIPSI_BNE, type, hi ? ra_allock(as, hi, allow) : RID_ZERO);\r\n  if (ra_hasreg(key)) emit_tsi(as, MIPSI_LW, key, idx, kofs+(LJ_BE?4:0));\r\n  emit_tsi(as, MIPSI_LW, type, idx, kofs+(LJ_BE?0:4));\r\n  if (ofs > 32736)\r\n    emit_tsi(as, MIPSI_ADDU, dest, node, ra_allock(as, ofs, allow));\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, MIPSI_LW, dest, v, RSET_GPR);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guard(as, MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, uv, (int32_t)offsetof(GCupval, tv));\r\n      emit_tsi(as, MIPSI_LBU, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_tsi(as, MIPSI_LW, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_tsi(as, MIPSI_LW, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  int32_t ofs = (int32_t)sizeof(GCstr);\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       checki16(ofs + IR(irr->op2)->i)) {\r\n      ofs += IR(irr->op2)->i;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_tsi(as, MIPSI_ADDIU, dest, dest, ofs);\r\n    emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  ofs += IR(refk)->i;\r\n  if (checki16(ofs))\r\n    emit_tsi(as, MIPSI_ADDIU, dest, r, ofs);\r\n  else\r\n    emit_dst(as, MIPSI_ADDU, dest, r,\r\n\t     ra_allock(as, ofs, rset_exclude(RSET_GPR, r)));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic MIPSIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return MIPSI_LB;\r\n  case IRT_U8: return MIPSI_LBU;\r\n  case IRT_I16: return MIPSI_LH;\r\n  case IRT_U16: return MIPSI_LHU;\r\n  case IRT_NUM: return MIPSI_LDC1;\r\n  case IRT_FLOAT: return MIPSI_LWC1;\r\n  default: return MIPSI_LW;\r\n  }\r\n}\r\n\r\nstatic MIPSIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return MIPSI_SB;\r\n  case IRT_I16: case IRT_U16: return MIPSI_SH;\r\n  case IRT_NUM: return MIPSI_SDC1;\r\n  case IRT_FLOAT: return MIPSI_SWC1;\r\n  default: return MIPSI_SW;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  MIPSIns mi = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_tsi(as, MIPSI_ADDIU, dest, idx, ofs);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  lua_assert(!irt_isfp(ir->t));\r\n  emit_tsi(as, mi, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1z(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    MIPSIns mi = asm_fxstoreins(ir);\r\n    lua_assert(!irt_isfp(ir->t));\r\n    emit_tsi(as, mi, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore_(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1z(as, ir->op2, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\n#define asm_xstore(as, ir)\tasm_xstore_(as, ir, 0)\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_TMP, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = 0;\r\n  if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  rset_clear(allow, idx);\r\n  if (irt_isnum(t)) {\r\n    asm_guard(as, MIPSI_BEQ, type, RID_ZERO);\r\n    emit_tsi(as, MIPSI_SLTIU, type, type, (int32_t)LJ_TISNUM);\r\n    if (ra_hasreg(dest))\r\n      emit_hsi(as, MIPSI_LDC1, dest, idx, ofs);\r\n  } else {\r\n    asm_guard(as, MIPSI_BNE, type, ra_allock(as, irt_toitype(t), allow));\r\n    if (ra_hasreg(dest)) emit_tsi(as, MIPSI_LW, dest, idx, ofs+(LJ_BE?4:0));\r\n  }\r\n  emit_tsi(as, MIPSI_LW, type, idx, ofs+(LJ_BE?0:4));\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg idx, src = RID_NONE, type = RID_NONE;\r\n  int32_t ofs = 0;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n  } else {\r\n    if (!irt_ispri(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n    }\r\n    type = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(ir->t)) {\r\n    emit_hsi(as, MIPSI_SDC1, src, idx, ofs);\r\n  } else {\r\n    if (ra_hasreg(src))\r\n      emit_tsi(as, MIPSI_SW, src, idx, ofs+(LJ_BE?4:0));\r\n    emit_tsi(as, MIPSI_SW, type, idx, ofs+(LJ_BE?0:4));\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(!irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    rset_clear(allow, base);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (irt_isint(t)) {\r\n\tReg tmp = ra_scratch(as, RSET_FPR);\r\n\temit_tg(as, MIPSI_MFC1, dest, tmp);\r\n\temit_fg(as, MIPSI_TRUNC_W_D, tmp, tmp);\r\n\tdest = tmp;\r\n\tt.irt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\tReg tmp = ra_scratch(as, RSET_GPR);\r\n\temit_fg(as, MIPSI_CVT_D_W, dest, dest);\r\n\temit_tg(as, MIPSI_MTC1, tmp, dest);\r\n\tdest = tmp;\r\n\tt.irt = IRT_INT;  /* Check for original type. */\r\n      }\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\n  rset_clear(allow, base);\r\ndotypecheck:\r\n  if (irt_isnum(t)) {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      asm_guard(as, MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_tsi(as, MIPSI_SLTIU, RID_TMP, RID_TMP, (int32_t)LJ_TISNUM);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_hsi(as, MIPSI_LDC1, dest, base, ofs);\r\n  } else {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      Reg ktype = ra_allock(as, irt_toitype(t), allow);\r\n      asm_guard(as, MIPSI_BNE, RID_TMP, ktype);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_tsi(as, MIPSI_LW, dest, base, ofs ^ (LJ_BE?4:0));\r\n  }\r\n  if (ra_hasreg(type)) emit_tsi(as, MIPSI_LW, type, base, ofs ^ (LJ_BE?0:4));\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID id = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[4];\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID || (ir->o == IR_CNEW && ir->op2 != REF_NIL));\r\n\r\n  as->gcsteps++;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4;\r\n      lua_assert((ir+1)->o == IR_HIOP);\r\n      if (LJ_LE) ir++;\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1z(as, ir->op2, allow);\r\n      emit_tsi(as, MIPSI_SW, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; if (LJ_BE) ir++; else ir--;\r\n    }\r\n  } else if (ir->op2 != REF_NIL) {  /* Create VLA/VLS/aligned cdata. */\r\n    ci = &lj_ir_callinfo[IRCALL_lj_cdata_newv];\r\n    args[0] = ASMREF_L;     /* lua_State *L */\r\n    args[1] = ir->op1;      /* CTypeID id   */\r\n    args[2] = ir->op2;      /* CTSize sz    */\r\n    args[3] = ASMREF_TMP1;  /* CTSize align */\r\n    asm_gencall(as, ci, args);\r\n    emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)ctype_align(info));\r\n    return;\r\n  }\r\n\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  emit_tsi(as, MIPSI_SB, RID_RET+1, RID_RET, offsetof(GCcdata, gct));\r\n  emit_tsi(as, MIPSI_SH, RID_TMP, RID_RET, offsetof(GCcdata, ctypeid));\r\n  emit_ti(as, MIPSI_LI, RID_RET+1, ~LJ_TCDATA);\r\n  emit_ti(as, MIPSI_LI, RID_TMP, id); /* Lower 16 bit used. Sign-ext ok. */\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg mark = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg link = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_tsi(as, MIPSI_SW, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_tsi(as, MIPSI_SB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  emit_getgl(as, link, gc.grayagain);\r\n  emit_dst(as, MIPSI_XOR, mark, mark, RID_TMP);  /* Clear black bit. */\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, RID_TMP, mark, LJ_GC_BLACK);\r\n  emit_tsi(as, MIPSI_LBU, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, tmp, tmp, LJ_GC_BLACK);\r\n  emit_branch(as, MIPSI_BEQ, RID_TMP, RID_ZERO, l_end);\r\n  emit_tsi(as, MIPSI_ANDI, RID_TMP, RID_TMP, LJ_GC_WHITES);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_tsi(as, MIPSI_LBU, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_tsi(as, MIPSI_LBU, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, MIPSIns mi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_fgh(as, mi, dest, left, right);\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, MIPSIns mi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_fg(as, mi, dest, left);\r\n}\r\n\r\nstatic void asm_fpmath(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n    return;\r\n  if (ir->op2 <= IRFPM_TRUNC)\r\n    asm_callround(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n  else if (ir->op2 == IRFPM_SQRT)\r\n    asm_fpunary(as, ir, MIPSI_SQRT_D);\r\n  else\r\n    asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_ADD_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\temit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_SUB_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, MIPSI_MUL_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, MIPSI_MUL, dest, left, right);\r\n  }\r\n}\r\n\r\n#define asm_div(as, ir)\t\tasm_fparith(as, ir, MIPSI_DIV_D)\r\n#define asm_mod(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_modi)\r\n#define asm_pow(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_powi)\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, MIPSI_NEG_D);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n  }\r\n}\r\n\r\n#define asm_abs(as, ir)\t\tasm_fpunary(as, ir, MIPSI_ABS_D)\r\n#define asm_atan2(as, ir)\tasm_callid(as, ir, IRCALL_atan2)\r\n#define asm_ldexp(as, ir)\tasm_callid(as, ir, IRCALL_ldexp)\r\n\r\nstatic void asm_arithov(ASMState *as, IRIns *ir)\r\n{\r\n  Reg right, left, tmp, dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int k = IR(ir->op2)->i;\r\n    if (ir->o == IR_SUBOV) k = -k;\r\n    if (checki16(k)) {  /* (dest < left) == (k >= 0 ? 1 : 0) */\r\n      left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      asm_guard(as, k >= 0 ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_dst(as, MIPSI_SLT, RID_TMP, dest, dest == left ? RID_TMP : left);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      if (dest == left) emit_move(as, RID_TMP, left);\r\n      return;\r\n    }\r\n  }\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  tmp = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_GPR, left),\r\n\t\t\t\t\t\t right), dest));\r\n  asm_guard(as, MIPSI_BLTZ, RID_TMP, 0);\r\n  emit_dst(as, MIPSI_AND, RID_TMP, RID_TMP, tmp);\r\n  if (ir->o == IR_ADDOV) {  /* ((dest^left) & (dest^right)) < 0 */\r\n    emit_dst(as, MIPSI_XOR, RID_TMP, dest, dest == right ? RID_TMP : right);\r\n  } else {  /* ((dest^left) & (dest^~right)) < 0 */\r\n    emit_dst(as, MIPSI_XOR, RID_TMP, RID_TMP, dest);\r\n    emit_dst(as, MIPSI_NOR, RID_TMP, dest == right ? RID_TMP : right, RID_ZERO);\r\n  }\r\n  emit_dst(as, MIPSI_XOR, tmp, dest, dest == left ? RID_TMP : left);\r\n  emit_dst(as, ir->o == IR_ADDOV ? MIPSI_ADDU : MIPSI_SUBU, dest, left, right);\r\n  if (dest == left || dest == right)\r\n    emit_move(as, RID_TMP, dest == left ? left : right);\r\n}\r\n\r\n#define asm_addov(as, ir)\tasm_arithov(as, ir)\r\n#define asm_subov(as, ir)\tasm_arithov(as, ir)\r\n\r\nstatic void asm_mulov(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg tmp, right, left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  tmp = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_GPR, left),\r\n\t\t\t\t\t\t right), dest));\r\n  asm_guard(as, MIPSI_BNE, RID_TMP, tmp);\r\n  emit_dta(as, MIPSI_SRA, RID_TMP, dest, 31);\r\n  emit_dst(as, MIPSI_MFHI, tmp, 0, 0);\r\n  emit_dst(as, MIPSI_MFLO, dest, 0, 0);\r\n  emit_dst(as, MIPSI_MULT, 0, left, right);\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_add64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0) {\r\n      emit_dst(as, MIPSI_ADDU, dest, left, RID_TMP);\r\n      goto loarith;\r\n    } else if (checki16(k)) {\r\n      emit_dst(as, MIPSI_ADDU, dest, dest, RID_TMP);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      goto loarith;\r\n    }\r\n  }\r\n  emit_dst(as, MIPSI_ADDU, dest, dest, RID_TMP);\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_dst(as, MIPSI_ADDU, dest, left, right);\r\nloarith:\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0) {\r\n      if (dest != left)\r\n\temit_move(as, dest, left);\r\n      return;\r\n    } else if (checki16(k)) {\r\n      if (dest == left) {\r\n\tReg tmp = ra_scratch(as, rset_exclude(RSET_GPR, left));\r\n\temit_move(as, dest, tmp);\r\n\tdest = tmp;\r\n      }\r\n      emit_dst(as, MIPSI_SLTU, RID_TMP, dest, left);\r\n      emit_tsi(as, MIPSI_ADDIU, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  if (dest == left && dest == right) {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n    emit_move(as, dest, tmp);\r\n    dest = tmp;\r\n  }\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, dest, dest == left ? right : left);\r\n  emit_dst(as, MIPSI_ADDU, dest, left, right);\r\n}\r\n\r\nstatic void asm_sub64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dst(as, MIPSI_SUBU, dest, dest, RID_TMP);\r\n  emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (dest == left) {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n    emit_move(as, dest, tmp);\r\n    dest = tmp;\r\n  }\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, left, dest);\r\n  emit_dst(as, MIPSI_SUBU, dest, left, right);\r\n}\r\n\r\nstatic void asm_neg64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_dst(as, MIPSI_SUBU, dest, dest, RID_TMP);\r\n  emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, RID_ZERO, dest);\r\n  emit_dst(as, MIPSI_SUBU, dest, RID_ZERO, left);\r\n}\r\n#endif\r\n\r\nstatic void asm_bnot(ASMState *as, IRIns *ir)\r\n{\r\n  Reg left, right, dest = ra_dest(as, ir, RSET_GPR);\r\n  IRIns *irl = IR(ir->op1);\r\n  if (mayfuse(as, ir->op1) && irl->o == IR_BOR) {\r\n    left = ra_alloc2(as, irl, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n  } else {\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    right = RID_ZERO;\r\n  }\r\n  emit_dst(as, MIPSI_NOR, dest, left, right);\r\n}\r\n\r\nstatic void asm_bswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    emit_dta(as, MIPSI_ROTR, dest, RID_TMP, 16);\r\n    emit_dst(as, MIPSI_WSBH, RID_TMP, 0, left);\r\n  } else {\r\n    Reg tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), dest));\r\n    emit_dst(as, MIPSI_OR, dest, dest, tmp);\r\n    emit_dst(as, MIPSI_OR, dest, dest, RID_TMP);\r\n    emit_tsi(as, MIPSI_ANDI, dest, dest, 0xff00);\r\n    emit_dta(as, MIPSI_SLL, RID_TMP, RID_TMP, 8);\r\n    emit_dta(as, MIPSI_SRL, dest, left, 8);\r\n    emit_tsi(as, MIPSI_ANDI, RID_TMP, left, 0xff00);\r\n    emit_dst(as, MIPSI_OR, tmp, tmp, RID_TMP);\r\n    emit_dta(as, MIPSI_SRL, tmp, left, 24);\r\n    emit_dta(as, MIPSI_SLL, RID_TMP, left, 24);\r\n  }\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, MIPSIns mi, MIPSIns mik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (checku16(k)) {\r\n      emit_tsi(as, mik, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_dst(as, mi, dest, left, right);\r\n}\r\n\r\n#define asm_band(as, ir)\tasm_bitop(as, ir, MIPSI_AND, MIPSI_ANDI)\r\n#define asm_bor(as, ir)\t\tasm_bitop(as, ir, MIPSI_OR, MIPSI_ORI)\r\n#define asm_bxor(as, ir)\tasm_bitop(as, ir, MIPSI_XOR, MIPSI_XORI)\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, MIPSIns mi, MIPSIns mik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    uint32_t shift = (uint32_t)(IR(ir->op2)->i & 31);\r\n    emit_dta(as, mik, dest, ra_hintalloc(as, ir->op1, dest, RSET_GPR), shift);\r\n  } else {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    emit_dst(as, mi, dest, right, left);  /* Shift amount is in rs. */\r\n  }\r\n}\r\n\r\n#define asm_bshl(as, ir)\tasm_bitshift(as, ir, MIPSI_SLLV, MIPSI_SLL)\r\n#define asm_bshr(as, ir)\tasm_bitshift(as, ir, MIPSI_SRLV, MIPSI_SRL)\r\n#define asm_bsar(as, ir)\tasm_bitshift(as, ir, MIPSI_SRAV, MIPSI_SRA)\r\n#define asm_brol(as, ir)\tlua_assert(0)\r\n\r\nstatic void asm_bror(ASMState *as, IRIns *ir)\r\n{\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    asm_bitshift(as, ir, MIPSI_ROTRV, MIPSI_ROTR);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n      uint32_t shift = (uint32_t)(IR(ir->op2)->i & 31);\r\n      Reg left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n      emit_rotr(as, dest, left, RID_TMP, shift);\r\n    } else {\r\n      Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n      right = (left >> 8); left &= 255;\r\n      emit_dst(as, MIPSI_OR, dest, dest, RID_TMP);\r\n      emit_dst(as, MIPSI_SRLV, dest, right, left);\r\n      emit_dst(as, MIPSI_SLLV, RID_TMP, RID_TMP, left);\r\n      emit_dst(as, MIPSI_SUBU, RID_TMP, ra_allock(as, 32, RSET_GPR), right);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int ismax)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (dest == left) {\r\n      emit_fg(as, MIPSI_MOVT_D, dest, right);\r\n    } else {\r\n      emit_fg(as, MIPSI_MOVF_D, dest, left);\r\n      if (dest != right) emit_fg(as, MIPSI_MOV_D, dest, right);\r\n    }\r\n    emit_fgh(as, MIPSI_C_OLT_D, 0, ismax ? left : right, ismax ? right : left);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (dest == left) {\r\n      emit_dst(as, MIPSI_MOVN, dest, right, RID_TMP);\r\n    } else {\r\n      emit_dst(as, MIPSI_MOVZ, dest, left, RID_TMP);\r\n      if (dest != right) emit_move(as, dest, right);\r\n    }\r\n    emit_dst(as, MIPSI_SLT, RID_TMP,\r\n\t     ismax ? left : right, ismax ? right : left);\r\n  }\r\n}\r\n\r\n#define asm_min(as, ir)\t\tasm_min_max(as, ir, 0)\r\n#define asm_max(as, ir)\t\tasm_min_max(as, ir, 1)\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n  /* ORDER IR: LT GE LE GT  ULT UGE ULE UGT. */\r\n  IROp op = ir->o;\r\n  if (irt_isnum(ir->t)) {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    asm_guard(as, (op&1) ? MIPSI_BC1T : MIPSI_BC1F, 0, 0);\r\n    emit_fgh(as, MIPSI_C_OLT_D + ((op&3) ^ ((op>>2)&1)), 0, left, right);\r\n  } else {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (op == IR_ABC) op = IR_UGT;\r\n    if ((op&4) == 0 && irref_isk(ir->op2) && IR(ir->op2)->i == 0) {\r\n      MIPSIns mi = (op&2) ? ((op&1) ? MIPSI_BLEZ : MIPSI_BGTZ) :\r\n\t\t\t    ((op&1) ? MIPSI_BLTZ : MIPSI_BGEZ);\r\n      asm_guard(as, mi, left, 0);\r\n    } else {\r\n      if (irref_isk(ir->op2)) {\r\n\tint32_t k = IR(ir->op2)->i;\r\n\tif ((op&2)) k++;\r\n\tif (checki16(k)) {\r\n\t  asm_guard(as, (op&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n\t  emit_tsi(as, (op&4) ? MIPSI_SLTIU : MIPSI_SLTI,\r\n\t\t   RID_TMP, left, k);\r\n\t  return;\r\n\t}\r\n      }\r\n      right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n      asm_guard(as, ((op^(op>>1))&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n      emit_dst(as, (op&4) ? MIPSI_SLTU : MIPSI_SLT,\r\n\t       RID_TMP, (op&2) ? right : left, (op&2) ? left : right);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_equal(ASMState *as, IRIns *ir)\r\n{\r\n  Reg right, left = ra_alloc2(as, ir, irt_isnum(ir->t) ? RSET_FPR : RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (irt_isnum(ir->t)) {\r\n    asm_guard(as, (ir->o & 1) ? MIPSI_BC1T : MIPSI_BC1F, 0, 0);\r\n    emit_fgh(as, MIPSI_C_EQ_D, 0, left, right);\r\n  } else {\r\n    asm_guard(as, (ir->o & 1) ? MIPSI_BEQ : MIPSI_BNE, left, right);\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_comp64(ASMState *as, IRIns *ir)\r\n{\r\n  /* ORDER IR: LT GE LE GT  ULT UGE ULE UGT. */\r\n  IROp op = (ir-1)->o;\r\n  MCLabel l_end;\r\n  Reg rightlo, leftlo, righthi, lefthi = ra_alloc2(as, ir, RSET_GPR);\r\n  righthi = (lefthi >> 8); lefthi &= 255;\r\n  leftlo = ra_alloc2(as, ir-1,\r\n\t\t     rset_exclude(rset_exclude(RSET_GPR, lefthi), righthi));\r\n  rightlo = (leftlo >> 8); leftlo &= 255;\r\n  asm_guard(as, ((op^(op>>1))&1) ? MIPSI_BNE : MIPSI_BEQ, RID_TMP, RID_ZERO);\r\n  l_end = emit_label(as);\r\n  if (lefthi != righthi)\r\n    emit_dst(as, (op&4) ? MIPSI_SLTU : MIPSI_SLT, RID_TMP,\r\n\t     (op&2) ? righthi : lefthi, (op&2) ? lefthi : righthi);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP,\r\n\t   (op&2) ? rightlo : leftlo, (op&2) ? leftlo : rightlo);\r\n  if (lefthi != righthi)\r\n    emit_branch(as, MIPSI_BEQ, lefthi, righthi, l_end);\r\n}\r\n\r\nstatic void asm_comp64eq(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tmp, right, left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  asm_guard(as, ((ir-1)->o & 1) ? MIPSI_BEQ : MIPSI_BNE, RID_TMP, RID_ZERO);\r\n  tmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR, left), right));\r\n  emit_dst(as, MIPSI_OR, RID_TMP, RID_TMP, tmp);\r\n  emit_dst(as, MIPSI_XOR, tmp, left, right);\r\n  left = ra_alloc2(as, ir-1, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  emit_dst(as, MIPSI_XOR, RID_TMP, left, right);\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o < IR_EQ) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64eq(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    as->curins--;  /* Handle both stores here. */\r\n    if ((ir-1)->r != RID_SINK) {\r\n      asm_xstore_(as, ir, LJ_LE ? 4 : 0);\r\n      asm_xstore_(as, ir-1, LJ_LE ? 0 : 4);\r\n    }\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD: as->curins--; asm_add64(as, ir); break;\r\n  case IR_SUB: as->curins--; asm_sub64(as, ir); break;\r\n  case IR_NEG: as->curins--; asm_neg64(as, ir); break;\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Profiling ----------------------------------------------------------- */\r\n\r\nstatic void asm_prof(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(ir);\r\n  asm_guard(as, MIPSI_BNE, RID_TMP, RID_ZERO);\r\n  emit_tsi(as, MIPSI_ANDI, RID_TMP, RID_TMP, HOOK_PROFILE);\r\n  emit_lsglptr(as, MIPSI_LBU, RID_TMP,\r\n\t       (int32_t)offsetof(global_State, hookmask));\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore RID_RET*. */\r\n  Reg tmp, pbase = irp ? (ra_hasreg(irp->r) ? irp->r : RID_TMP) : RID_BASE;\r\n  ExitNo oldsnap = as->snapno;\r\n  rset_clear(allow, pbase);\r\n  tmp = allow ? rset_pickbot(allow) :\r\n\t\t(pbase == RID_RETHI ? RID_RETLO : RID_RETHI);\r\n  as->snapno = exitno;\r\n  asm_guard(as, MIPSI_BNE, RID_TMP, RID_ZERO);\r\n  as->snapno = oldsnap;\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_tsi(as, MIPSI_LW, tmp, RID_SP, 0);\r\n  else\r\n    ra_modified(as, tmp);\r\n  emit_tsi(as, MIPSI_SLTIU, RID_TMP, RID_TMP, (int32_t)(8*topslot));\r\n  emit_dst(as, MIPSI_SUBU, RID_TMP, tmp, pbase);\r\n  emit_tsi(as, MIPSI_LW, tmp, tmp, offsetof(lua_State, maxstack));\r\n  if (pbase == RID_TMP)\r\n    emit_getgl(as, RID_TMP, jit_base);\r\n  emit_getgl(as, tmp, cur_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_tsi(as, MIPSI_SW, tmp, RID_SP, 0);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_hsi(as, MIPSI_SDC1, src, RID_BASE, ofs);\r\n    } else {\r\n      Reg type;\r\n      RegSet allow = rset_exclude(RSET_GPR, RID_BASE);\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, allow);\r\n\trset_clear(allow, src);\r\n\temit_tsi(as, MIPSI_SW, src, RID_BASE, ofs+(LJ_BE?4:0));\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), allow);\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      }\r\n      emit_tsi(as, MIPSI_SW, type, RID_BASE, ofs+(LJ_BE?0:4));\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  /* Assumes asm_snap_prep() already done. */\r\n  asm_guard(as, MIPSI_BNE, RID_RET, RID_ZERO);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  emit_tsi(as, MIPSI_ADDIU, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_branch(as, MIPSI_BNE, RID_TMP, RID_ZERO, l_end);\r\n  emit_dst(as, MIPSI_SLTU, RID_TMP, RID_TMP, tmp);\r\n  emit_getgl(as, tmp, gc.threshold);\r\n  emit_getgl(as, RID_TMP, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  p[-1] = MIPSI_NOP;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guard already inverted the cond branch. Only patch the target. */\r\n    p[-3] |= ((target-p+2) & 0x0000ffffu);\r\n  } else {\r\n    p[-2] = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (as->loopinv) as->mctop--;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_move(as, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (as->loopinv) as->mctop--;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_move(as, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *target = lnk ? traceref(as->J,lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  int32_t spadj = as->T->spadjust;\r\n  MCode *p = as->mctop-1;\r\n  *p = spadj ? (MIPSI_ADDIU|MIPSF_T(RID_SP)|MIPSF_S(RID_SP)|spadj) : MIPSI_NOP;\r\n  p[-1] = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  as->mcp = as->mctop-2;  /* Leave room for branch plus nop or stack adj. */\r\n  as->invmcp = as->loopref ? as->mcp : NULL;\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = CCI_XNARGS(ci);\r\n  int nslots = 4, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++) {\r\n    if (args[i] && irt_isfp(IR(args[i])->t) &&\r\n\tnfpr > 0 && !(ci->flags & CCI_VARARG)) {\r\n      nfpr--;\r\n      ngpr -= irt_isnum(IR(args[i])->t) ? 2 : 1;\r\n    } else if (args[i] && irt_isnum(IR(args[i])->t)) {\r\n      nfpr = 0;\r\n      ngpr = ngpr & ~1;\r\n      if (ngpr > 0) ngpr -= 2; else nslots = (nslots+3) & ~1;\r\n    } else {\r\n      nfpr = 0;\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_sparejump_setup(as);\r\n  asm_exitstub_setup(as);\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *px = exitstub_trace_addr(T, exitno);\r\n  MCode *cstart = NULL, *cstop = NULL;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MCode exitload = MIPSI_LI | MIPSF_T(RID_TMP) | exitno;\r\n  MCode tjump = MIPSI_J|(((uintptr_t)target>>2)&0x03ffffffu);\r\n  for (p++; p < pe; p++) {\r\n    if (*p == exitload) {  /* Look for load of exit number. */\r\n      if (((p[-1] ^ (px-p)) & 0xffffu) == 0) {  /* Look for exitstub branch. */\r\n\tptrdiff_t delta = target - p;\r\n\tif (((delta + 0x8000) >> 16) == 0) {  /* Patch in-range branch. */\r\n\tpatchbranch:\r\n\t  p[-1] = (p[-1] & 0xffff0000u) | (delta & 0xffffu);\r\n\t  *p = MIPSI_NOP;  /* Replace the load of the exit number. */\r\n\t  cstop = p;\r\n\t  if (!cstart) cstart = p-1;\r\n\t} else {  /* Branch out of range. Use spare jump slot in mcarea. */\r\n\t  int i;\r\n\t  for (i = 2; i < 2+MIPS_SPAREJUMP*2; i += 2) {\r\n\t    if (mcarea[i] == tjump) {\r\n\t      delta = mcarea+i - p;\r\n\t      goto patchbranch;\r\n\t    } else if (mcarea[i] == MIPSI_NOP) {\r\n\t      mcarea[i] = tjump;\r\n\t      cstart = mcarea+i;\r\n\t      delta = mcarea+i - p;\r\n\t      goto patchbranch;\r\n\t    }\r\n\t  }\r\n\t  /* Ignore jump slot overflow. Child trace is simply not attached. */\r\n\t}\r\n      } else if (p+1 == pe) {\r\n\t/* Patch NOP after code for inverted loop branch. Use of J is ok. */\r\n\tlua_assert(p[1] == MIPSI_NOP);\r\n\tp[1] = tjump;\r\n\t*p = MIPSI_NOP;  /* Replace the load of the exit number. */\r\n\tcstop = p+2;\r\n\tif (!cstart) cstart = p+1;\r\n      }\r\n    }\r\n  }\r\n  if (cstart) lj_mcode_sync(cstart, cstop);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm_ppc.h",
    "content": "/*\r\n** PPC IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Register allocator extensions --------------------------------------- */\r\n\r\n/* Allocate a register with a hint. */\r\nstatic Reg ra_hintalloc(ASMState *as, IRRef ref, Reg hint, RegSet allow)\r\n{\r\n  Reg r = IR(ref)->r;\r\n  if (ra_noreg(r)) {\r\n    if (!ra_hashint(r) && !iscrossref(as, ref))\r\n      ra_sethint(IR(ref)->r, hint);  /* Propagate register hint. */\r\n    r = ra_allocref(as, ref, allow);\r\n  }\r\n  ra_noweak(as, r);\r\n  return r;\r\n}\r\n\r\n/* Allocate two source registers for three-operand instructions. */\r\nstatic Reg ra_alloc2(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n  Reg left = irl->r, right = irr->r;\r\n  if (ra_hasreg(left)) {\r\n    ra_noweak(as, left);\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, ir->op2, rset_exclude(allow, left));\r\n    else\r\n      ra_noweak(as, right);\r\n  } else if (ra_hasreg(right)) {\r\n    ra_noweak(as, right);\r\n    left = ra_allocref(as, ir->op1, rset_exclude(allow, right));\r\n  } else if (ra_hashint(right)) {\r\n    right = ra_allocref(as, ir->op2, allow);\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(allow, right));\r\n  } else {\r\n    left = ra_allocref(as, ir->op1, allow);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(allow, left));\r\n  }\r\n  return left | (right << 8);\r\n}\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Setup exit stubs after the end of each trace. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  MCode *mxp = as->mctop;\r\n  if (mxp - (nexits + 3 + MCLIM_REDZONE) < as->mclim)\r\n    asm_mclimit(as);\r\n  /* 1: mflr r0; bl ->vm_exit_handler; li r0, traceno; bl <1; bl <1; ... */\r\n  for (i = nexits-1; (int32_t)i >= 0; i--)\r\n    *--mxp = PPCI_BL|(((-3-i)&0x00ffffffu)<<2);\r\n  *--mxp = PPCI_LI|PPCF_T(RID_TMP)|as->T->traceno;  /* Read by exit handler. */\r\n  mxp--;\r\n  *mxp = PPCI_BL|((((MCode *)(void *)lj_vm_exit_handler-mxp)&0x00ffffffu)<<2);\r\n  *--mxp = PPCI_MFLR|PPCF_T(RID_TMP);\r\n  as->mctop = mxp;\r\n}\r\n\r\nstatic MCode *asm_exitstub_addr(ASMState *as, ExitNo exitno)\r\n{\r\n  /* Keep this in-sync with exitstub_trace_addr(). */\r\n  return as->mctop + exitno + 3;\r\n}\r\n\r\n/* Emit conditional branch to exit for guard. */\r\nstatic void asm_guardcc(ASMState *as, PPCCC cc)\r\n{\r\n  MCode *target = asm_exitstub_addr(as, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *p = PPCI_B | (((target-p) & 0x00ffffffu) << 2);\r\n    emit_condbranch(as, PPCI_BC, cc^4, p);\r\n    return;\r\n  }\r\n  emit_condbranch(as, PPCI_BC, cc, target);\r\n}\r\n\r\n/* -- Operand fusion ------------------------------------------------------ */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if there's no conflicting instruction between curins and ref. */\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref)\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse the array base of colocated arrays. */\r\nstatic int32_t asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_TNEW && ir->op1 <= LJ_MAX_COLOSIZE &&\r\n      !neverfuse(as) && noconflict(as, ref, IR_NEWREF))\r\n    return (int32_t)sizeof(GCtab);\r\n  return 0;\r\n}\r\n\r\n/* Indicates load/store indexed is ok. */\r\n#define AHUREF_LSX\t((int32_t)0x80000000)\r\n\r\n/* Fuse array/hash/upvalue reference into register+offset operand. */\r\nstatic Reg asm_fuseahuref(ASMState *as, IRRef ref, int32_t *ofsp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    if (ir->o == IR_AREF) {\r\n      if (mayfuse(as, ref)) {\r\n\tif (irref_isk(ir->op2)) {\r\n\t  IRRef tab = IR(ir->op1)->op1;\r\n\t  int32_t ofs = asm_fuseabase(as, tab);\r\n\t  IRRef refa = ofs ? tab : ir->op1;\r\n\t  ofs += 8*IR(ir->op2)->i;\r\n\t  if (checki16(ofs)) {\r\n\t    *ofsp = ofs;\r\n\t    return ra_alloc1(as, refa, allow);\r\n\t  }\r\n\t}\r\n\tif (*ofsp == AHUREF_LSX) {\r\n\t  Reg base = ra_alloc1(as, ir->op1, allow);\r\n\t  Reg idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n\t  return base | (idx << 8);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_HREFK) {\r\n      if (mayfuse(as, ref)) {\r\n\tint32_t ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tif (checki16(ofs)) {\r\n\t  *ofsp = ofs;\r\n\t  return ra_alloc1(as, ir->op1, allow);\r\n\t}\r\n      }\r\n    } else if (ir->o == IR_UREFC) {\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tint32_t ofs = i32ptr(&gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.tv);\r\n\tint32_t jgl = (intptr_t)J2G(as->J);\r\n\tif ((uint32_t)(ofs-jgl) < 65536) {\r\n\t  *ofsp = ofs-jgl-32768;\r\n\t  return RID_JGL;\r\n\t} else {\r\n\t  *ofsp = (int16_t)ofs;\r\n\t  return ra_allock(as, ofs-(int16_t)ofs, allow);\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  *ofsp = 0;\r\n  return ra_alloc1(as, ref, allow);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into load/store operand. */\r\nstatic void asm_fusexref(ASMState *as, PPCIns pi, Reg rt, IRRef ref,\r\n\t\t\t RegSet allow, int32_t ofs)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  Reg base;\r\n  if (ra_noreg(ir->r) && canfuse(as, ir)) {\r\n    if (ir->o == IR_ADD) {\r\n      int32_t ofs2;\r\n      if (irref_isk(ir->op2) && (ofs2 = ofs + IR(ir->op2)->i, checki16(ofs2))) {\r\n\tofs = ofs2;\r\n\tref = ir->op1;\r\n      } else if (ofs == 0) {\r\n\tReg right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\temit_fab(as, PPCI_LWZX | ((pi >> 20) & 0x780), rt, left, right);\r\n\treturn;\r\n      }\r\n    } else if (ir->o == IR_STRREF) {\r\n      lua_assert(ofs == 0);\r\n      ofs = (int32_t)sizeof(GCstr);\r\n      if (irref_isk(ir->op2)) {\r\n\tofs += IR(ir->op2)->i;\r\n\tref = ir->op1;\r\n      } else if (irref_isk(ir->op1)) {\r\n\tofs += IR(ir->op1)->i;\r\n\tref = ir->op2;\r\n      } else {\r\n\t/* NYI: Fuse ADD with constant. */\r\n\tReg tmp, right, left = ra_alloc2(as, ir, allow);\r\n\tright = (left >> 8); left &= 255;\r\n\ttmp = ra_scratch(as, rset_exclude(rset_exclude(allow, left), right));\r\n\temit_fai(as, pi, rt, tmp, ofs);\r\n\temit_tab(as, PPCI_ADD, tmp, left, right);\r\n\treturn;\r\n      }\r\n      if (!checki16(ofs)) {\r\n\tReg left = ra_alloc1(as, ref, allow);\r\n\tReg right = ra_allock(as, ofs, rset_exclude(allow, left));\r\n\temit_fab(as, PPCI_LWZX | ((pi >> 20) & 0x780), rt, left, right);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ref, allow);\r\n  emit_fai(as, pi, rt, base, ofs);\r\n}\r\n\r\n/* Fuse XLOAD/XSTORE reference into indexed-only load/store operand. */\r\nstatic void asm_fusexrefx(ASMState *as, PPCIns pi, Reg rt, IRRef ref,\r\n\t\t\t  RegSet allow)\r\n{\r\n  IRIns *ira = IR(ref);\r\n  Reg right, left;\r\n  if (canfuse(as, ira) && ira->o == IR_ADD && ra_noreg(ira->r)) {\r\n    left = ra_alloc2(as, ira, allow);\r\n    right = (left >> 8); left &= 255;\r\n  } else {\r\n    right = ra_alloc1(as, ref, allow);\r\n    left = RID_R0;\r\n  }\r\n  emit_tab(as, pi, rt, left, right);\r\n}\r\n\r\n/* Fuse to multiply-add/sub instruction. */\r\nstatic int asm_fusemadd(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pir)\r\n{\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  IRIns *irm;\r\n  if (lref != rref &&\r\n      ((mayfuse(as, lref) && (irm = IR(lref), irm->o == IR_MUL) &&\r\n\tra_noreg(irm->r)) ||\r\n       (mayfuse(as, rref) && (irm = IR(rref), irm->o == IR_MUL) &&\r\n\t(rref = lref, pi = pir, ra_noreg(irm->r))))) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg add = ra_alloc1(as, rref, RSET_FPR);\r\n    Reg right, left = ra_alloc2(as, irm, rset_exclude(RSET_FPR, add));\r\n    right = (left >> 8); left &= 255;\r\n    emit_facb(as, pi, dest, left, right, add);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_XNARGS(ci);\r\n  int32_t ofs = 8;\r\n  Reg gpr = REGARG_FIRSTGPR, fpr = REGARG_FIRSTFPR;\r\n  if ((void *)ci->func)\r\n    emit_call(as, (void *)ci->func);\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    if (ref) {\r\n      IRIns *ir = IR(ref);\r\n      if (irt_isfp(ir->t)) {\r\n\tif (fpr <= REGARG_LASTFPR) {\r\n\t  lua_assert(rset_test(as->freeset, fpr));  /* Already evicted. */\r\n\t  ra_leftov(as, fpr, ref);\r\n\t  fpr++;\r\n\t} else {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_FPR);\r\n\t  if (irt_isnum(ir->t)) ofs = (ofs + 4) & ~4;\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += irt_isnum(ir->t) ? 8 : 4;\r\n\t}\r\n      } else {\r\n\tif (gpr <= REGARG_LASTGPR) {\r\n\t  lua_assert(rset_test(as->freeset, gpr));  /* Already evicted. */\r\n\t  ra_leftov(as, gpr, ref);\r\n\t  gpr++;\r\n\t} else {\r\n\t  Reg r = ra_alloc1(as, ref, RSET_GPR);\r\n\t  emit_spstore(as, ir, r, ofs);\r\n\t  ofs += 4;\r\n\t}\r\n      }\r\n    } else {\r\n      if (gpr <= REGARG_LASTGPR)\r\n\tgpr++;\r\n      else\r\n\tofs += 4;\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  if ((ci->flags & CCI_VARARG))  /* Vararg calls need to know about FPR use. */\r\n    emit_tab(as, fpr == REGARG_FIRSTFPR ? PPCI_CRXOR : PPCI_CREQV, 6, 6, 6);\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = ((ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    lua_assert(!irt_ispri(ir->t));\r\n    if (irt_isfp(ir->t)) {\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\t/* Use spill slot or temp slots. */\r\n\tint32_t ofs = ir->s ? sps_scale(ir->s) : SPOFS_TMP;\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_fai(as, PPCI_LFD, dest, RID_SP, ofs);\r\n\t}\r\n\temit_tai(as, PPCI_STW, RID_RETHI, RID_SP, ofs);\r\n\temit_tai(as, PPCI_STW, RID_RETLO, RID_SP, ofs+4);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n#if LJ_32\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n#endif\r\n    } else {\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  if (irref_isk(func)) {  /* Call to constant address. */\r\n    ci.func = (ASMFunction)(void *)(intptr_t)(irf->i);\r\n  } else {  /* Need a non-argument register for indirect calls. */\r\n    RegSet allow = RSET_GPR & ~RSET_RANGE(RID_R0, REGARG_LASTGPR+1);\r\n    Reg freg = ra_alloc1(as, func, allow);\r\n    *--as->mcp = PPCI_BCTRL;\r\n    *--as->mcp = PPCI_MTCTR | PPCF_T(freg);\r\n    ci.func = (ASMFunction)(void *)0;\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+LJ_FR2+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_ab(as, PPCI_CMPW, RID_TMP,\r\n\t  ra_allock(as, i32ptr(pc), rset_exclude(RSET_GPR, base)));\r\n  emit_tai(as, PPCI_LWZ, RID_TMP, base, -8);\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, left));\r\n  Reg fbias = ra_scratch(as, rset_clear(allow, tmp));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg hibias = ra_allock(as, 0x43300000, rset_exclude(RSET_GPR, dest));\r\n  asm_guardcc(as, CC_NE);\r\n  emit_fab(as, PPCI_FCMPU, 0, tmp, left);\r\n  emit_fab(as, PPCI_FSUB, tmp, tmp, fbias);\r\n  emit_fai(as, PPCI_LFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_tai(as, PPCI_STW, RID_TMP, RID_SP, SPOFS_TMPLO);\r\n  emit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n  emit_asi(as, PPCI_XORIS, RID_TMP, dest, 0x8000);\r\n  emit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n  emit_lsptr(as, PPCI_LFS, (fbias & 31),\r\n\t     (void *)lj_ir_k64_find(as->J, U64x(59800004,59800000)),\r\n\t     RSET_GPR);\r\n  emit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, allow);\r\n  Reg right = ra_alloc1(as, ir->op2, rset_clear(allow, left));\r\n  Reg tmp = ra_scratch(as, rset_clear(allow, right));\r\n  emit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n  emit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n  emit_fab(as, PPCI_FADD, tmp, left, right);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(irt_isint64(ir->t) ||\r\n\t       (st == IRT_I64 || st == IRT_U64))); /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      if (st == IRT_NUM)  /* double -> float conversion. */\r\n\temit_fb(as, PPCI_FRSP, dest, ra_alloc1(as, lref, RSET_FPR));\r\n      else  /* float -> double conversion is a no-op on PPC. */\r\n\tra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    } else {  /* Integer to FP conversion. */\r\n      /* IRT_INT: Flip hibit, bias with 2^52, subtract 2^52+2^31. */\r\n      /* IRT_U32: Bias with 2^52, subtract 2^52. */\r\n      RegSet allow = RSET_GPR;\r\n      Reg left = ra_alloc1(as, lref, allow);\r\n      Reg hibias = ra_allock(as, 0x43300000, rset_clear(allow, left));\r\n      Reg fbias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      const float *kbias;\r\n      if (irt_isfloat(ir->t)) emit_fb(as, PPCI_FRSP, dest, dest);\r\n      emit_fab(as, PPCI_FSUB, dest, dest, fbias);\r\n      emit_fai(as, PPCI_LFD, dest, RID_SP, SPOFS_TMP);\r\n      kbias = (const float *)lj_ir_k64_find(as->J, U64x(59800004,59800000));\r\n      if (st == IRT_U32) kbias++;\r\n      emit_lsptr(as, PPCI_LFS, (fbias & 31), (void *)kbias,\r\n\t\t rset_clear(allow, hibias));\r\n      emit_tai(as, PPCI_STW, st == IRT_U32 ? left : RID_TMP,\r\n\t       RID_SP, SPOFS_TMPLO);\r\n      emit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n      if (st != IRT_U32) emit_asi(as, PPCI_XORIS, RID_TMP, left, 0x8000);\r\n    }\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      Reg left = ra_alloc1(as, lref, RSET_FPR);\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n      if (irt_isu32(ir->t)) {\r\n\t/* Convert both x and x-2^31 to int and merge results. */\r\n\tReg tmpi = ra_scratch(as, rset_exclude(RSET_GPR, dest));\r\n\temit_asb(as, PPCI_OR, dest, dest, tmpi);  /* Select with mask idiom. */\r\n\temit_asb(as, PPCI_AND, tmpi, tmpi, RID_TMP);\r\n\temit_asb(as, PPCI_ANDC, dest, dest, RID_TMP);\r\n\temit_tai(as, PPCI_LWZ, tmpi, RID_SP, SPOFS_TMPLO);  /* tmp = (int)(x) */\r\n\temit_tai(as, PPCI_ADDIS, dest, dest, 0x8000);  /* dest += 2^31 */\r\n\temit_asb(as, PPCI_SRAWI, RID_TMP, dest, 31);  /* mask = -(dest < 0) */\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_tai(as, PPCI_LWZ, dest,\r\n\t\t RID_SP, SPOFS_TMPLO);  /* dest = (int)(x-2^31) */\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, tmp);\r\n\temit_fab(as, PPCI_FSUB, tmp, left, tmp);\r\n\temit_lsptr(as, PPCI_LFS, (tmp & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(4f000000,00000000)),\r\n\t\t   RSET_GPR);\r\n      } else {\r\n\temit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n\temit_fai(as, PPCI_STFD, tmp, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, tmp, left);\r\n      }\r\n    }\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n      Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n      if ((ir->op2 & IRCONV_SEXT))\r\n\temit_as(as, st == IRT_I8 ? PPCI_EXTSB : PPCI_EXTSH, dest, left);\r\n      else\r\n\temit_rot(as, PPCI_RLWINM, dest, left, 0, st == IRT_U8 ? 24 : 16, 31);\r\n    } else {  /* 32/64 bit integer conversions. */\r\n      /* Only need to handle 32/32 bit no-op (cast) on 32 bit archs. */\r\n      ra_leftov(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  int32_t ofs;\r\n  RegSet drop = RSET_SCRATCH;\r\n  if (ra_hasreg(ir->r)) rset_set(drop, ir->r);  /* Spill dest reg (if any). */\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, CC_EQ);\r\n  emit_ai(as, PPCI_CMPWI, RID_RET, 0);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  ofs = ir->s ? sps_scale(ir->s) : SPOFS_TMP;\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_SP, ofs);\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    if (irref_isk(ref))  /* Use the number constant itself as a TValue. */\r\n      ra_allockreg(as, i32ptr(ir_knum(ir)), dest);\r\n    else  /* Otherwise force a spill and use the spill slot. */\r\n      emit_tai(as, PPCI_ADDI, dest, RID_SP, ra_spill(as, ir));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    RegSet allow = rset_exclude(RSET_GPR, dest);\r\n    Reg type;\r\n    emit_tai(as, PPCI_ADDI, dest, RID_JGL, (int32_t)offsetof(global_State, tmptv)-32768);\r\n    if (!irt_ispri(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, allow);\r\n      emit_setgl(as, src, tmptv.gcr);\r\n    }\r\n    type = ra_allock(as, irt_toitype(ir->t), allow);\r\n    emit_setgl(as, type, tmptv.it);\r\n  }\r\n}\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx, base;\r\n  if (irref_isk(ir->op2)) {\r\n    IRRef tab = IR(ir->op1)->op1;\r\n    int32_t ofs = asm_fuseabase(as, tab);\r\n    IRRef refa = ofs ? tab : ir->op1;\r\n    ofs += 8*IR(ir->op2)->i;\r\n    if (checki16(ofs)) {\r\n      base = ra_alloc1(as, refa, RSET_GPR);\r\n      emit_tai(as, PPCI_ADDI, dest, base, ofs);\r\n      return;\r\n    }\r\n  }\r\n  base = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  idx = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, base));\r\n  emit_tab(as, PPCI_ADD, dest, RID_TMP, base);\r\n  emit_slwi(as, RID_TMP, idx, 3);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, tmp1 = RID_TMP, tmp2;\r\n  Reg tisnum = RID_NONE, tmpnum = RID_NONE;\r\n  IRRef refkey = ir->op2;\r\n  IRIns *irkey = IR(refkey);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  rset_clear(allow, tab);\r\n  if (irt_isnum(kt)) {\r\n    key = ra_alloc1(as, refkey, RSET_FPR);\r\n    tmpnum = ra_scratch(as, rset_exclude(RSET_FPR, key));\r\n    tisnum = ra_allock(as, (int32_t)LJ_TISNUM, allow);\r\n    rset_clear(allow, tisnum);\r\n  } else if (!irt_ispri(kt)) {\r\n    key = ra_alloc1(as, refkey, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  tmp2 = ra_scratch(as, allow);\r\n  rset_clear(allow, tmp2);\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  as->invmcp = NULL;\r\n  if (merge == IR_NE)\r\n    asm_guardcc(as, CC_EQ);\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = --as->mcp;\r\n  emit_ai(as, PPCI_CMPWI, dest, 0);\r\n  emit_tai(as, PPCI_LWZ, dest, dest, (int32_t)offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ)\r\n    asm_guardcc(as, CC_EQ);\r\n  else\r\n    emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  if (irt_isnum(kt)) {\r\n    emit_fab(as, PPCI_FCMPU, 0, tmpnum, key);\r\n    emit_condbranch(as, PPCI_BC, CC_GE, l_next);\r\n    emit_ab(as, PPCI_CMPLW, tmp1, tisnum);\r\n    emit_fai(as, PPCI_LFD, tmpnum, dest, (int32_t)offsetof(Node, key.n));\r\n  } else {\r\n    if (!irt_ispri(kt)) {\r\n      emit_ab(as, PPCI_CMPW, tmp2, key);\r\n      emit_condbranch(as, PPCI_BC, CC_NE, l_next);\r\n    }\r\n    emit_ai(as, PPCI_CMPWI, tmp1, irt_toitype(irkey->t));\r\n    if (!irt_ispri(kt))\r\n      emit_tai(as, PPCI_LWZ, tmp2, dest, (int32_t)offsetof(Node, key.gcr));\r\n  }\r\n  emit_tai(as, PPCI_LWZ, tmp1, dest, (int32_t)offsetof(Node, key.it));\r\n  *l_loop = PPCI_BC | PPCF_Y | PPCF_CC(CC_NE) |\r\n\t    (((char *)as->mcp-(char *)l_loop) & 0xffffu);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = irref_isk(refkey) ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_tai(as, PPCI_LWZ, dest, tab, (int32_t)offsetof(GCtab, node));\r\n  } else {\r\n    Reg tmphash = tmp1;\r\n    if (irref_isk(refkey))\r\n      tmphash = ra_allock(as, khash, allow);\r\n    emit_tab(as, PPCI_ADD, dest, dest, tmp1);\r\n    emit_tai(as, PPCI_MULLI, tmp1, tmp1, sizeof(Node));\r\n    emit_asb(as, PPCI_AND, tmp1, tmp2, tmphash);\r\n    emit_tai(as, PPCI_LWZ, dest, tab, (int32_t)offsetof(GCtab, node));\r\n    emit_tai(as, PPCI_LWZ, tmp2, tab, (int32_t)offsetof(GCtab, hmask));\r\n    if (irref_isk(refkey)) {\r\n      /* Nothing to do. */\r\n    } else if (irt_isstr(kt)) {\r\n      emit_tai(as, PPCI_LWZ, tmp1, key, (int32_t)offsetof(GCstr, hash));\r\n    } else {  /* Must match with hash*() in lj_tab.c. */\r\n      emit_tab(as, PPCI_SUBF, tmp1, tmp2, tmp1);\r\n      emit_rotlwi(as, tmp2, tmp2, HASH_ROT3);\r\n      emit_asb(as, PPCI_XOR, tmp1, tmp1, tmp2);\r\n      emit_rotlwi(as, tmp1, tmp1, (HASH_ROT2+HASH_ROT1)&31);\r\n      emit_tab(as, PPCI_SUBF, tmp2, dest, tmp2);\r\n      if (irt_isnum(kt)) {\r\n\tint32_t ofs = ra_spill(as, irkey);\r\n\temit_asb(as, PPCI_XOR, tmp2, tmp2, tmp1);\r\n\temit_rotlwi(as, dest, tmp1, HASH_ROT1);\r\n\temit_tab(as, PPCI_ADD, tmp1, tmp1, tmp1);\r\n\temit_tai(as, PPCI_LWZ, tmp2, RID_SP, ofs+4);\r\n\temit_tai(as, PPCI_LWZ, tmp1, RID_SP, ofs);\r\n      } else {\r\n\temit_asb(as, PPCI_XOR, tmp2, key, tmp1);\r\n\temit_rotlwi(as, dest, tmp1, HASH_ROT1);\r\n\temit_tai(as, PPCI_ADDI, tmp1, tmp2, HASH_BIAS);\r\n\temit_tai(as, PPCI_ADDIS, tmp2, key, (HASH_BIAS + 32768)>>16);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  int32_t kofs = ofs + (int32_t)offsetof(Node, key);\r\n  Reg dest = (ra_used(ir)||ofs > 32736) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg key = RID_NONE, type = RID_TMP, idx = node;\r\n  RegSet allow = rset_exclude(RSET_GPR, node);\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ofs > 32736) {\r\n    idx = dest;\r\n    rset_clear(allow, dest);\r\n    kofs = (int32_t)offsetof(Node, key);\r\n  } else if (ra_hasreg(dest)) {\r\n    emit_tai(as, PPCI_ADDI, dest, node, ofs);\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n  if (!irt_ispri(irkey->t)) {\r\n    key = ra_scratch(as, allow);\r\n    rset_clear(allow, key);\r\n  }\r\n  rset_clear(allow, type);\r\n  if (irt_isnum(irkey->t)) {\r\n    emit_cmpi(as, key, (int32_t)ir_knum(irkey)->u32.lo);\r\n    asm_guardcc(as, CC_NE);\r\n    emit_cmpi(as, type, (int32_t)ir_knum(irkey)->u32.hi);\r\n  } else {\r\n    if (ra_hasreg(key)) {\r\n      emit_cmpi(as, key, irkey->i);  /* May use RID_TMP, i.e. type. */\r\n      asm_guardcc(as, CC_NE);\r\n    }\r\n    emit_ai(as, PPCI_CMPWI, type, irt_toitype(irkey->t));\r\n  }\r\n  if (ra_hasreg(key)) emit_tai(as, PPCI_LWZ, key, idx, kofs+4);\r\n  emit_tai(as, PPCI_LWZ, type, idx, kofs);\r\n  if (ofs > 32736) {\r\n    emit_tai(as, PPCI_ADDIS, dest, dest, (ofs + 32768) >> 16);\r\n    emit_tai(as, PPCI_ADDI, dest, node, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_lsptr(as, PPCI_LWZ, dest, v, RSET_GPR);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_ai(as, PPCI_CMPWI, RID_TMP, 1);\r\n      emit_tai(as, PPCI_ADDI, dest, uv, (int32_t)offsetof(GCupval, tv));\r\n      emit_tai(as, PPCI_LBZ, RID_TMP, uv, (int32_t)offsetof(GCupval, closed));\r\n    } else {\r\n      emit_tai(as, PPCI_LWZ, dest, uv, (int32_t)offsetof(GCupval, v));\r\n    }\r\n    emit_tai(as, PPCI_LWZ, uv, func,\r\n\t     (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(as); UNUSED(ir);\r\n  lua_assert(!ra_used(ir));\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef ref = ir->op2, refk = ir->op1;\r\n  int32_t ofs = (int32_t)sizeof(GCstr);\r\n  Reg r;\r\n  if (irref_isk(ref)) {\r\n    IRRef tmp = refk; refk = ref; ref = tmp;\r\n  } else if (!irref_isk(refk)) {\r\n    Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    IRIns *irr = IR(ir->op2);\r\n    if (ra_hasreg(irr->r)) {\r\n      ra_noweak(as, irr->r);\r\n      right = irr->r;\r\n    } else if (mayfuse(as, irr->op2) &&\r\n\t       irr->o == IR_ADD && irref_isk(irr->op2) &&\r\n\t       checki16(ofs + IR(irr->op2)->i)) {\r\n      ofs += IR(irr->op2)->i;\r\n      right = ra_alloc1(as, irr->op1, rset_exclude(RSET_GPR, left));\r\n    } else {\r\n      right = ra_allocref(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    }\r\n    emit_tai(as, PPCI_ADDI, dest, dest, ofs);\r\n    emit_tab(as, PPCI_ADD, dest, left, right);\r\n    return;\r\n  }\r\n  r = ra_alloc1(as, ref, RSET_GPR);\r\n  ofs += IR(refk)->i;\r\n  if (checki16(ofs))\r\n    emit_tai(as, PPCI_ADDI, dest, r, ofs);\r\n  else\r\n    emit_tab(as, PPCI_ADD, dest, r,\r\n\t     ra_allock(as, ofs, rset_exclude(RSET_GPR, r)));\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic PPCIns asm_fxloadins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: return PPCI_LBZ;  /* Needs sign-extension. */\r\n  case IRT_U8: return PPCI_LBZ;\r\n  case IRT_I16: return PPCI_LHA;\r\n  case IRT_U16: return PPCI_LHZ;\r\n  case IRT_NUM: return PPCI_LFD;\r\n  case IRT_FLOAT: return PPCI_LFS;\r\n  default: return PPCI_LWZ;\r\n  }\r\n}\r\n\r\nstatic PPCIns asm_fxstoreins(IRIns *ir)\r\n{\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: case IRT_U8: return PPCI_STB;\r\n  case IRT_I16: case IRT_U16: return PPCI_STH;\r\n  case IRT_NUM: return PPCI_STFD;\r\n  case IRT_FLOAT: return PPCI_STFS;\r\n  default: return PPCI_STW;\r\n  }\r\n}\r\n\r\nstatic void asm_fload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg idx = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  PPCIns pi = asm_fxloadins(ir);\r\n  int32_t ofs;\r\n  if (ir->op2 == IRFL_TAB_ARRAY) {\r\n    ofs = asm_fuseabase(as, ir->op1);\r\n    if (ofs) {  /* Turn the t->array load into an add for colocated arrays. */\r\n      emit_tai(as, PPCI_ADDI, dest, idx, ofs);\r\n      return;\r\n    }\r\n  }\r\n  ofs = field_ofs[ir->op2];\r\n  lua_assert(!irt_isi8(ir->t));\r\n  emit_tai(as, pi, dest, idx, ofs);\r\n}\r\n\r\nstatic void asm_fstore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r != RID_SINK) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    IRIns *irf = IR(ir->op1);\r\n    Reg idx = ra_alloc1(as, irf->op1, rset_exclude(RSET_GPR, src));\r\n    int32_t ofs = field_ofs[irf->op2];\r\n    PPCIns pi = asm_fxstoreins(ir);\r\n    emit_tai(as, pi, src, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_xload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  lua_assert(!(ir->op2 & IRXLOAD_UNALIGNED));\r\n  if (irt_isi8(ir->t))\r\n    emit_as(as, PPCI_EXTSB, dest, dest);\r\n  asm_fusexref(as, asm_fxloadins(ir), dest, ir->op1, RSET_GPR, 0);\r\n}\r\n\r\nstatic void asm_xstore_(ASMState *as, IRIns *ir, int32_t ofs)\r\n{\r\n  IRIns *irb;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (ofs == 0 && mayfuse(as, ir->op2) && (irb = IR(ir->op2))->o == IR_BSWAP &&\r\n      ra_noreg(irb->r) && (irt_isint(ir->t) || irt_isu32(ir->t))) {\r\n    /* Fuse BSWAP with XSTORE to stwbrx. */\r\n    Reg src = ra_alloc1(as, irb->op1, RSET_GPR);\r\n    asm_fusexrefx(as, PPCI_STWBRX, src, ir->op1, rset_exclude(RSET_GPR, src));\r\n  } else {\r\n    Reg src = ra_alloc1(as, ir->op2, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n    asm_fusexref(as, asm_fxstoreins(ir), src, ir->op1,\r\n\t\t rset_exclude(RSET_GPR, src), ofs);\r\n  }\r\n}\r\n\r\n#define asm_xstore(as, ir)\tasm_xstore_(as, ir, 0)\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_TMP, tmp = RID_TMP, idx;\r\n  RegSet allow = RSET_GPR;\r\n  int32_t ofs = AHUREF_LSX;\r\n  if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    if (!irt_isnum(t)) ofs = 0;\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(t)) {\r\n    Reg tisnum = ra_allock(as, (int32_t)LJ_TISNUM, rset_exclude(allow, idx));\r\n    asm_guardcc(as, CC_GE);\r\n    emit_ab(as, PPCI_CMPLW, type, tisnum);\r\n    if (ra_hasreg(dest)) {\r\n      if (ofs == AHUREF_LSX) {\r\n\ttmp = ra_scratch(as, rset_exclude(rset_exclude(RSET_GPR,\r\n\t\t\t\t\t\t       (idx&255)), (idx>>8)));\r\n\temit_fab(as, PPCI_LFDX, dest, (idx&255), tmp);\r\n      } else {\r\n\temit_fai(as, PPCI_LFD, dest, idx, ofs);\r\n      }\r\n    }\r\n  } else {\r\n    asm_guardcc(as, CC_NE);\r\n    emit_ai(as, PPCI_CMPWI, type, irt_toitype(t));\r\n    if (ra_hasreg(dest)) emit_tai(as, PPCI_LWZ, dest, idx, ofs+4);\r\n  }\r\n  if (ofs == AHUREF_LSX) {\r\n    emit_tab(as, PPCI_LWZX, type, (idx&255), tmp);\r\n    emit_slwi(as, tmp, (idx>>8), 3);\r\n  } else {\r\n    emit_tai(as, PPCI_LWZ, type, idx, ofs);\r\n  }\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg idx, src = RID_NONE, type = RID_NONE;\r\n  int32_t ofs = AHUREF_LSX;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n  } else {\r\n    if (!irt_ispri(ir->t)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n      ofs = 0;\r\n    }\r\n    type = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n    rset_clear(allow, type);\r\n  }\r\n  idx = asm_fuseahuref(as, ir->op1, &ofs, allow);\r\n  if (irt_isnum(ir->t)) {\r\n    if (ofs == AHUREF_LSX) {\r\n      emit_fab(as, PPCI_STFDX, src, (idx&255), RID_TMP);\r\n      emit_slwi(as, RID_TMP, (idx>>8), 3);\r\n    } else {\r\n      emit_fai(as, PPCI_STFD, src, idx, ofs);\r\n    }\r\n  } else {\r\n    if (ra_hasreg(src))\r\n      emit_tai(as, PPCI_STW, src, idx, ofs+4);\r\n    if (ofs == AHUREF_LSX) {\r\n      emit_tab(as, PPCI_STWX, type, (idx&255), RID_TMP);\r\n      emit_slwi(as, RID_TMP, (idx>>8), 3);\r\n    } else {\r\n      emit_tai(as, PPCI_STW, type, idx, ofs);\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 0 : 4);\r\n  IRType1 t = ir->t;\r\n  Reg dest = RID_NONE, type = RID_NONE, base;\r\n  RegSet allow = RSET_GPR;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(LJ_DUALNUM ||\r\n\t     !irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    dest = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, dest);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n  } else if (ra_used(ir)) {\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    dest = ra_dest(as, ir, irt_isnum(t) ? RSET_FPR : RSET_GPR);\r\n    rset_clear(allow, dest);\r\n    base = ra_alloc1(as, REF_BASE, allow);\r\n    rset_clear(allow, base);\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      if (irt_isint(t)) {\r\n\temit_tai(as, PPCI_LWZ, dest, RID_SP, SPOFS_TMPLO);\r\n\tdest = ra_scratch(as, RSET_FPR);\r\n\temit_fai(as, PPCI_STFD, dest, RID_SP, SPOFS_TMP);\r\n\temit_fb(as, PPCI_FCTIWZ, dest, dest);\r\n\tt.irt = IRT_NUM;  /* Check for original type. */\r\n      } else {\r\n\tReg tmp = ra_scratch(as, allow);\r\n\tReg hibias = ra_allock(as, 0x43300000, rset_clear(allow, tmp));\r\n\tReg fbias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n\temit_fab(as, PPCI_FSUB, dest, dest, fbias);\r\n\temit_fai(as, PPCI_LFD, dest, RID_SP, SPOFS_TMP);\r\n\temit_lsptr(as, PPCI_LFS, (fbias & 31),\r\n\t\t   (void *)lj_ir_k64_find(as->J, U64x(59800004,59800000)),\r\n\t\t   rset_clear(allow, hibias));\r\n\temit_tai(as, PPCI_STW, tmp, RID_SP, SPOFS_TMPLO);\r\n\temit_tai(as, PPCI_STW, hibias, RID_SP, SPOFS_TMPHI);\r\n\temit_asi(as, PPCI_XORIS, tmp, tmp, 0x8000);\r\n\tdest = tmp;\r\n\tt.irt = IRT_INT;  /* Check for original type. */\r\n      }\r\n    }\r\n    goto dotypecheck;\r\n  }\r\n  base = ra_alloc1(as, REF_BASE, allow);\r\n  rset_clear(allow, base);\r\ndotypecheck:\r\n  if (irt_isnum(t)) {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      Reg tisnum = ra_allock(as, (int32_t)LJ_TISNUM, allow);\r\n      asm_guardcc(as, CC_GE);\r\n      emit_ab(as, PPCI_CMPLW, RID_TMP, tisnum);\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_fai(as, PPCI_LFD, dest, base, ofs-4);\r\n  } else {\r\n    if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n      asm_guardcc(as, CC_NE);\r\n      emit_ai(as, PPCI_CMPWI, RID_TMP, irt_toitype(t));\r\n      type = RID_TMP;\r\n    }\r\n    if (ra_hasreg(dest)) emit_tai(as, PPCI_LWZ, dest, base, ofs);\r\n  }\r\n  if (ra_hasreg(type)) emit_tai(as, PPCI_LWZ, type, base, ofs-4);\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID id = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[4];\r\n  RegSet drop = RSET_SCRATCH;\r\n  lua_assert(sz != CTSIZE_INVALID || (ir->o == IR_CNEW && ir->op2 != REF_NIL));\r\n\r\n  as->gcsteps++;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  if (ra_used(ir))\r\n    ra_destreg(as, ir, RID_RET);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n    int32_t ofs = sizeof(GCcdata);\r\n    lua_assert(sz == 4 || sz == 8);\r\n    if (sz == 8) {\r\n      ofs += 4;\r\n      lua_assert((ir+1)->o == IR_HIOP);\r\n    }\r\n    for (;;) {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_tai(as, PPCI_STW, r, RID_RET, ofs);\r\n      rset_clear(allow, r);\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir++;\r\n    }\r\n  } else if (ir->op2 != REF_NIL) {  /* Create VLA/VLS/aligned cdata. */\r\n    ci = &lj_ir_callinfo[IRCALL_lj_cdata_newv];\r\n    args[0] = ASMREF_L;     /* lua_State *L */\r\n    args[1] = ir->op1;      /* CTypeID id   */\r\n    args[2] = ir->op2;      /* CTSize sz    */\r\n    args[3] = ASMREF_TMP1;  /* CTSize align */\r\n    asm_gencall(as, ci, args);\r\n    emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)ctype_align(info));\r\n    return;\r\n  }\r\n\r\n  /* Initialize gct and ctypeid. lj_mem_newgco() already sets marked. */\r\n  emit_tai(as, PPCI_STB, RID_RET+1, RID_RET, offsetof(GCcdata, gct));\r\n  emit_tai(as, PPCI_STH, RID_TMP, RID_RET, offsetof(GCcdata, ctypeid));\r\n  emit_ti(as, PPCI_LI, RID_RET+1, ~LJ_TCDATA);\r\n  emit_ti(as, PPCI_LI, RID_TMP, id);  /* Lower 16 bit used. Sign-ext ok. */\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  asm_gencall(as, ci, args);\r\n  ra_allockreg(as, (int32_t)(sz+sizeof(GCcdata)),\r\n\t       ra_releasetmp(as, ASMREF_TMP1));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg mark = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  Reg link = RID_TMP;\r\n  MCLabel l_end = emit_label(as);\r\n  emit_tai(as, PPCI_STW, link, tab, (int32_t)offsetof(GCtab, gclist));\r\n  emit_tai(as, PPCI_STB, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  lua_assert(LJ_GC_BLACK == 0x04);\r\n  emit_rot(as, PPCI_RLWINM, mark, mark, 0, 30, 28);  /* Clear black bit. */\r\n  emit_getgl(as, link, gc.grayagain);\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, RID_TMP, mark, LJ_GC_BLACK);\r\n  emit_tai(as, PPCI_LBZ, mark, tab, (int32_t)offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj, val, tmp;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  obj = IR(ir->op1)->r;\r\n  tmp = ra_scratch(as, rset_exclude(RSET_GPR, obj));\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, tmp, tmp, LJ_GC_BLACK);\r\n  emit_condbranch(as, PPCI_BC, CC_EQ, l_end);\r\n  emit_asi(as, PPCI_ANDIDOT, RID_TMP, RID_TMP, LJ_GC_WHITES);\r\n  val = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, obj));\r\n  emit_tai(as, PPCI_LBZ, tmp, obj,\r\n\t   (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n  emit_tai(as, PPCI_LBZ, RID_TMP, val, (int32_t)offsetof(GChead, marked));\r\n}\r\n\r\n/* -- Arithmetic and logic operations ------------------------------------- */\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (pi == PPCI_FMUL)\r\n    emit_fac(as, pi, dest, left, right);\r\n  else\r\n    emit_fab(as, pi, dest, left, right);\r\n}\r\n\r\nstatic void asm_fpunary(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_FPR);\r\n  Reg left = ra_hintalloc(as, ir->op1, dest, RSET_FPR);\r\n  emit_fb(as, pi, dest, left);\r\n}\r\n\r\nstatic void asm_fpmath(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->op2 == IRFPM_EXP2 && asm_fpjoin_pow(as, ir))\r\n    return;\r\n  if (ir->op2 == IRFPM_SQRT && (as->flags & JIT_F_SQRT))\r\n    asm_fpunary(as, ir, PPCI_FSQRT);\r\n  else\r\n    asm_callid(as, ir, IRCALL_lj_vm_floor + ir->op2);\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, PPCI_FMADD, PPCI_FMADD))\r\n      asm_fparith(as, ir, PPCI_FADD);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    PPCIns pi;\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\tpi = PPCI_ADDI;\r\n\t/* May fail due to spills/restores above, but simplifies the logic. */\r\n\tif (as->flagmcp == as->mcp) {\r\n\t  as->flagmcp = NULL;\r\n\t  as->mcp++;\r\n\t  pi = PPCI_ADDICDOT;\r\n\t}\r\n\temit_tai(as, pi, dest, left, k);\r\n\treturn;\r\n      } else if ((k & 0xffff) == 0) {\r\n\temit_tai(as, PPCI_ADDIS, dest, left, (k >> 16));\r\n\treturn;\r\n      } else if (!as->sectref) {\r\n\temit_tai(as, PPCI_ADDIS, dest, dest, (k + 32768) >> 16);\r\n\temit_tai(as, PPCI_ADDI, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    pi = PPCI_ADD;\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, left, right);\r\n  }\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    if (!asm_fusemadd(as, ir, PPCI_FMSUB, PPCI_FNMSUB))\r\n      asm_fparith(as, ir, PPCI_FSUB);\r\n  } else {\r\n    PPCIns pi = PPCI_SUBF;\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg left, right;\r\n    if (irref_isk(ir->op1)) {\r\n      int32_t k = IR(ir->op1)->i;\r\n      if (checki16(k)) {\r\n\tright = ra_alloc1(as, ir->op2, RSET_GPR);\r\n\temit_tai(as, PPCI_SUBFIC, dest, right, k);\r\n\treturn;\r\n      }\r\n    }\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, right, left);  /* Subtract right _from_ left. */\r\n  }\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fparith(as, ir, PPCI_FMUL);\r\n  } else {\r\n    PPCIns pi = PPCI_MULLW;\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    if (irref_isk(ir->op2)) {\r\n      int32_t k = IR(ir->op2)->i;\r\n      if (checki16(k)) {\r\n\temit_tai(as, PPCI_MULLI, dest, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n    /* May fail due to spills/restores above, but simplifies the logic. */\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_tab(as, pi, dest, left, right);\r\n  }\r\n}\r\n\r\n#define asm_div(as, ir)\t\tasm_fparith(as, ir, PPCI_FDIV)\r\n#define asm_mod(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_modi)\r\n#define asm_pow(as, ir)\t\tasm_callid(as, ir, IRCALL_lj_vm_powi)\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    asm_fpunary(as, ir, PPCI_FNEG);\r\n  } else {\r\n    Reg dest, left;\r\n    PPCIns pi = PPCI_NEG;\r\n    if (as->flagmcp == as->mcp) {\r\n      as->flagmcp = NULL;\r\n      as->mcp++;\r\n      pi |= PPCF_DOT;\r\n    }\r\n    dest = ra_dest(as, ir, RSET_GPR);\r\n    left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n    emit_tab(as, pi, dest, left, 0);\r\n  }\r\n}\r\n\r\n#define asm_abs(as, ir)\t\tasm_fpunary(as, ir, PPCI_FABS)\r\n#define asm_atan2(as, ir)\tasm_callid(as, ir, IRCALL_atan2)\r\n#define asm_ldexp(as, ir)\tasm_callid(as, ir, IRCALL_ldexp)\r\n\r\nstatic void asm_arithov(ASMState *as, IRIns *ir, PPCIns pi)\r\n{\r\n  Reg dest, left, right;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n  }\r\n  asm_guardcc(as, CC_SO);\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc2(as, ir, RSET_GPR);\r\n  right = (left >> 8); left &= 255;\r\n  if (pi == PPCI_SUBFO) { Reg tmp = left; left = right; right = tmp; }\r\n  emit_tab(as, pi|PPCF_DOT, dest, left, right);\r\n}\r\n\r\n#define asm_addov(as, ir)\tasm_arithov(as, ir, PPCI_ADDO)\r\n#define asm_subov(as, ir)\tasm_arithov(as, ir, PPCI_SUBFO)\r\n#define asm_mulov(as, ir)\tasm_arithov(as, ir, PPCI_MULLWO)\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_add64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  PPCIns pi = PPCI_ADDE;\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k == 0)\r\n      pi = PPCI_ADDZE;\r\n    else if (k == -1)\r\n      pi = PPCI_ADDME;\r\n    else\r\n      goto needright;\r\n    right = 0;\r\n  } else {\r\n  needright:\r\n    right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  }\r\n  emit_tab(as, pi, dest, left, right);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (checki16(k)) {\r\n      emit_tai(as, PPCI_ADDIC, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_tab(as, PPCI_ADDC, dest, left, right);\r\n}\r\n\r\nstatic void asm_sub64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left, right = ra_alloc1(as, ir->op2, RSET_GPR);\r\n  PPCIns pi = PPCI_SUBFE;\r\n  if (irref_isk(ir->op1)) {\r\n    int32_t k = IR(ir->op1)->i;\r\n    if (k == 0)\r\n      pi = PPCI_SUBFZE;\r\n    else if (k == -1)\r\n      pi = PPCI_SUBFME;\r\n    else\r\n      goto needleft;\r\n    left = 0;\r\n  } else {\r\n  needleft:\r\n    left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, right));\r\n  }\r\n  emit_tab(as, pi, dest, right, left);  /* Subtract right _from_ left. */\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  right = ra_alloc1(as, ir->op2, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    int32_t k = IR(ir->op1)->i;\r\n    if (checki16(k)) {\r\n      emit_tai(as, PPCI_SUBFIC, dest, right, k);\r\n      return;\r\n    }\r\n  }\r\n  left = ra_alloc1(as, ir->op1, rset_exclude(RSET_GPR, right));\r\n  emit_tab(as, PPCI_SUBFC, dest, right, left);\r\n}\r\n\r\nstatic void asm_neg64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_tab(as, PPCI_SUBFZE, dest, left, 0);\r\n  ir--;\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  emit_tai(as, PPCI_SUBFIC, dest, left, 0);\r\n}\r\n#endif\r\n\r\nstatic void asm_bnot(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest, left, right;\r\n  PPCIns pi = PPCI_NOR;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    pi |= PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  if (mayfuse(as, ir->op1)) {\r\n    IRIns *irl = IR(ir->op1);\r\n    if (irl->o == IR_BAND)\r\n      pi ^= (PPCI_NOR ^ PPCI_NAND);\r\n    else if (irl->o == IR_BXOR)\r\n      pi ^= (PPCI_NOR ^ PPCI_EQV);\r\n    else if (irl->o != IR_BOR)\r\n      goto nofuse;\r\n    left = ra_hintalloc(as, irl->op1, dest, RSET_GPR);\r\n    right = ra_alloc1(as, irl->op2, rset_exclude(RSET_GPR, left));\r\n  } else {\r\nnofuse:\r\n    left = right = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  }\r\n  emit_asb(as, pi, dest, left, right);\r\n}\r\n\r\nstatic void asm_bswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  IRIns *irx;\r\n  if (mayfuse(as, ir->op1) && (irx = IR(ir->op1))->o == IR_XLOAD &&\r\n      ra_noreg(irx->r) && (irt_isint(irx->t) || irt_isu32(irx->t))) {\r\n    /* Fuse BSWAP with XLOAD to lwbrx. */\r\n    asm_fusexrefx(as, PPCI_LWBRX, dest, irx->op1, RSET_GPR);\r\n  } else {\r\n    Reg left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    Reg tmp = dest;\r\n    if (tmp == left) {\r\n      tmp = RID_TMP;\r\n      emit_mr(as, dest, RID_TMP);\r\n    }\r\n    emit_rot(as, PPCI_RLWIMI, tmp, left, 24, 16, 23);\r\n    emit_rot(as, PPCI_RLWIMI, tmp, left, 24, 0, 7);\r\n    emit_rotlwi(as, tmp, left, 8);\r\n  }\r\n}\r\n\r\n/* Fuse BAND with contiguous bitmask and a shift to rlwinm. */\r\nstatic void asm_fuseandsh(ASMState *as, PPCIns pi, int32_t mask, IRRef ref)\r\n{\r\n  IRIns *ir;\r\n  Reg left;\r\n  if (mayfuse(as, ref) && (ir = IR(ref), ra_noreg(ir->r)) &&\r\n      irref_isk(ir->op2) && ir->o >= IR_BSHL && ir->o <= IR_BROR) {\r\n    int32_t sh = (IR(ir->op2)->i & 31);\r\n    switch (ir->o) {\r\n    case IR_BSHL:\r\n      if ((mask & ((1u<<sh)-1))) goto nofuse;\r\n      break;\r\n    case IR_BSHR:\r\n      if ((mask & ~((~0u)>>sh))) goto nofuse;\r\n      sh = ((32-sh)&31);\r\n      break;\r\n    case IR_BROL:\r\n      break;\r\n    default:\r\n      goto nofuse;\r\n    }\r\n    left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    *--as->mcp = pi | PPCF_T(left) | PPCF_B(sh);\r\n    return;\r\n  }\r\nnofuse:\r\n  left = ra_alloc1(as, ref, RSET_GPR);\r\n  *--as->mcp = pi | PPCF_T(left);\r\n}\r\n\r\nstatic void asm_band(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest, left, right;\r\n  IRRef lref = ir->op1;\r\n  PPCIns dot = 0;\r\n  IRRef op2;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    dot = PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    if (k) {\r\n      /* First check for a contiguous bitmask as used by rlwinm. */\r\n      uint32_t s1 = lj_ffs((uint32_t)k);\r\n      uint32_t k1 = ((uint32_t)k >> s1);\r\n      if ((k1 & (k1+1)) == 0) {\r\n\tasm_fuseandsh(as, PPCI_RLWINM|dot | PPCF_A(dest) |\r\n\t\t\t  PPCF_MB(31-lj_fls((uint32_t)k)) | PPCF_ME(31-s1),\r\n\t\t\t  k, lref);\r\n\treturn;\r\n      }\r\n      if (~(uint32_t)k) {\r\n\tuint32_t s2 = lj_ffs(~(uint32_t)k);\r\n\tuint32_t k2 = (~(uint32_t)k >> s2);\r\n\tif ((k2 & (k2+1)) == 0) {\r\n\t  asm_fuseandsh(as, PPCI_RLWINM|dot | PPCF_A(dest) |\r\n\t\t\t    PPCF_MB(32-s2) | PPCF_ME(30-lj_fls(~(uint32_t)k)),\r\n\t\t\t    k, lref);\r\n\t  return;\r\n\t}\r\n      }\r\n    }\r\n    if (checku16(k)) {\r\n      left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_asi(as, PPCI_ANDIDOT, dest, left, k);\r\n      return;\r\n    } else if ((k & 0xffff) == 0) {\r\n      left = ra_alloc1(as, lref, RSET_GPR);\r\n      emit_asi(as, PPCI_ANDISDOT, dest, left, (k >> 16));\r\n      return;\r\n    }\r\n  }\r\n  op2 = ir->op2;\r\n  if (mayfuse(as, op2) && IR(op2)->o == IR_BNOT && ra_noreg(IR(op2)->r)) {\r\n    dot ^= (PPCI_AND ^ PPCI_ANDC);\r\n    op2 = IR(op2)->op1;\r\n  }\r\n  left = ra_hintalloc(as, lref, dest, RSET_GPR);\r\n  right = ra_alloc1(as, op2, rset_exclude(RSET_GPR, left));\r\n  emit_asb(as, PPCI_AND ^ dot, dest, left, right);\r\n}\r\n\r\nstatic void asm_bitop(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pik)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg right, left = ra_hintalloc(as, ir->op1, dest, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {\r\n    int32_t k = IR(ir->op2)->i;\r\n    Reg tmp = left;\r\n    if ((checku16(k) || (k & 0xffff) == 0) || (tmp = dest, !as->sectref)) {\r\n      if (!checku16(k)) {\r\n\temit_asi(as, pik ^ (PPCI_ORI ^ PPCI_ORIS), dest, tmp, (k >> 16));\r\n\tif ((k & 0xffff) == 0) return;\r\n      }\r\n      emit_asi(as, pik, dest, left, k);\r\n      return;\r\n    }\r\n  }\r\n  /* May fail due to spills/restores above, but simplifies the logic. */\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    pi |= PPCF_DOT;\r\n  }\r\n  right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n  emit_asb(as, pi, dest, left, right);\r\n}\r\n\r\n#define asm_bor(as, ir)\t\tasm_bitop(as, ir, PPCI_OR, PPCI_ORI)\r\n#define asm_bxor(as, ir)\tasm_bitop(as, ir, PPCI_XOR, PPCI_XORI)\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, PPCIns pi, PPCIns pik)\r\n{\r\n  Reg dest, left;\r\n  Reg dot = 0;\r\n  if (as->flagmcp == as->mcp) {\r\n    as->flagmcp = NULL;\r\n    as->mcp++;\r\n    dot = PPCF_DOT;\r\n  }\r\n  dest = ra_dest(as, ir, RSET_GPR);\r\n  left = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  if (irref_isk(ir->op2)) {  /* Constant shifts. */\r\n    int32_t shift = (IR(ir->op2)->i & 31);\r\n    if (pik == 0)  /* SLWI */\r\n      emit_rot(as, PPCI_RLWINM|dot, dest, left, shift, 0, 31-shift);\r\n    else if (pik == 1)  /* SRWI */\r\n      emit_rot(as, PPCI_RLWINM|dot, dest, left, (32-shift)&31, shift, 31);\r\n    else\r\n      emit_asb(as, pik|dot, dest, left, shift);\r\n  } else {\r\n    Reg right = ra_alloc1(as, ir->op2, rset_exclude(RSET_GPR, left));\r\n    emit_asb(as, pi|dot, dest, left, right);\r\n  }\r\n}\r\n\r\n#define asm_bshl(as, ir)\tasm_bitshift(as, ir, PPCI_SLW, 0)\r\n#define asm_bshr(as, ir)\tasm_bitshift(as, ir, PPCI_SRW, 1)\r\n#define asm_bsar(as, ir)\tasm_bitshift(as, ir, PPCI_SRAW, PPCI_SRAWI)\r\n#define asm_brol(as, ir) \\\r\n  asm_bitshift(as, ir, PPCI_RLWNM|PPCF_MB(0)|PPCF_ME(31), \\\r\n\t\t       PPCI_RLWINM|PPCF_MB(0)|PPCF_ME(31))\r\n#define asm_bror(as, ir)\tlua_assert(0)\r\n\r\nstatic void asm_min_max(ASMState *as, IRIns *ir, int ismax)\r\n{\r\n  if (irt_isnum(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg tmp = dest;\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (tmp == left || tmp == right)\r\n      tmp = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_FPR,\r\n\t\t\t\t\tdest), left), right));\r\n    emit_facb(as, PPCI_FSEL, dest, tmp,\r\n\t      ismax ? left : right, ismax ? right : left);\r\n    emit_fab(as, PPCI_FSUB, tmp, left, right);\r\n  } else {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    Reg tmp1 = RID_TMP, tmp2 = dest;\r\n    Reg right, left = ra_alloc2(as, ir, RSET_GPR);\r\n    right = (left >> 8); left &= 255;\r\n    if (tmp2 == left || tmp2 == right)\r\n      tmp2 = ra_scratch(as, rset_exclude(rset_exclude(rset_exclude(RSET_GPR,\r\n\t\t\t\t\t dest), left), right));\r\n    emit_tab(as, PPCI_ADD, dest, tmp2, right);\r\n    emit_asb(as, ismax ? PPCI_ANDC : PPCI_AND, tmp2, tmp2, tmp1);\r\n    emit_tab(as, PPCI_SUBFE, tmp1, tmp1, tmp1);\r\n    emit_tab(as, PPCI_SUBFC, tmp2, tmp2, tmp1);\r\n    emit_asi(as, PPCI_XORIS, tmp2, right, 0x8000);\r\n    emit_asi(as, PPCI_XORIS, tmp1, left, 0x8000);\r\n  }\r\n}\r\n\r\n#define asm_min(as, ir)\t\tasm_min_max(as, ir, 0)\r\n#define asm_max(as, ir)\t\tasm_min_max(as, ir, 1)\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n#define CC_UNSIGNED\t0x08\t/* Unsigned integer comparison. */\r\n#define CC_TWO\t\t0x80\t/* Check two flags for FP comparison. */\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\nstatic const uint8_t asm_compmap[IR_ABC+1] = {\r\n  /* op     int cc                 FP cc */\r\n  /* LT  */ CC_GE               + (CC_GE<<4),\r\n  /* GE  */ CC_LT               + (CC_LE<<4) + CC_TWO,\r\n  /* LE  */ CC_GT               + (CC_GE<<4) + CC_TWO,\r\n  /* GT  */ CC_LE               + (CC_LE<<4),\r\n  /* ULT */ CC_GE + CC_UNSIGNED + (CC_GT<<4) + CC_TWO,\r\n  /* UGE */ CC_LT + CC_UNSIGNED + (CC_LT<<4),\r\n  /* ULE */ CC_GT + CC_UNSIGNED + (CC_GT<<4),\r\n  /* UGT */ CC_LE + CC_UNSIGNED + (CC_LT<<4) + CC_TWO,\r\n  /* EQ  */ CC_NE               + (CC_NE<<4),\r\n  /* NE  */ CC_EQ               + (CC_EQ<<4),\r\n  /* ABC */ CC_LE + CC_UNSIGNED + (CC_LT<<4) + CC_TWO  /* Same as UGT. */\r\n};\r\n\r\nstatic void asm_intcomp_(ASMState *as, IRRef lref, IRRef rref, Reg cr, PPCCC cc)\r\n{\r\n  Reg right, left = ra_alloc1(as, lref, RSET_GPR);\r\n  if (irref_isk(rref)) {\r\n    int32_t k = IR(rref)->i;\r\n    if ((cc & CC_UNSIGNED) == 0) {  /* Signed comparison with constant. */\r\n      if (checki16(k)) {\r\n\temit_tai(as, PPCI_CMPWI, cr, left, k);\r\n\t/* Signed comparison with zero and referencing previous ins? */\r\n\tif (k == 0 && lref == as->curins-1)\r\n\t  as->flagmcp = as->mcp;  /* Allow elimination of the compare. */\r\n\treturn;\r\n      } else if ((cc & 3) == (CC_EQ & 3)) {  /* Use CMPLWI for EQ or NE. */\r\n\tif (checku16(k)) {\r\n\t  emit_tai(as, PPCI_CMPLWI, cr, left, k);\r\n\t  return;\r\n\t} else if (!as->sectref && ra_noreg(IR(rref)->r)) {\r\n\t  emit_tai(as, PPCI_CMPLWI, cr, RID_TMP, k);\r\n\t  emit_asi(as, PPCI_XORIS, RID_TMP, left, (k >> 16));\r\n\t  return;\r\n\t}\r\n      }\r\n    } else {  /* Unsigned comparison with constant. */\r\n      if (checku16(k)) {\r\n\temit_tai(as, PPCI_CMPLWI, cr, left, k);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  right = ra_alloc1(as, rref, rset_exclude(RSET_GPR, left));\r\n  emit_tab(as, (cc & CC_UNSIGNED) ? PPCI_CMPLW : PPCI_CMPW, cr, left, right);\r\n}\r\n\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n  PPCCC cc = asm_compmap[ir->o];\r\n  if (irt_isnum(ir->t)) {\r\n    Reg right, left = ra_alloc2(as, ir, RSET_FPR);\r\n    right = (left >> 8); left &= 255;\r\n    asm_guardcc(as, (cc >> 4));\r\n    if ((cc & CC_TWO))\r\n      emit_tab(as, PPCI_CROR, ((cc>>4)&3), ((cc>>4)&3), (CC_EQ&3));\r\n    emit_fab(as, PPCI_FCMPU, 0, left, right);\r\n  } else {\r\n    IRRef lref = ir->op1, rref = ir->op2;\r\n    if (irref_isk(lref) && !irref_isk(rref)) {\r\n      /* Swap constants to the right (only for ABC). */\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n      if ((cc & 2) == 0) cc ^= 1;  /* LT <-> GT, LE <-> GE */\r\n    }\r\n    asm_guardcc(as, cc);\r\n    asm_intcomp_(as, lref, rref, 0, cc);\r\n  }\r\n}\r\n\r\n#define asm_equal(as, ir)\tasm_comp(as, ir)\r\n\r\n#if LJ_HASFFI\r\n/* 64 bit integer comparisons. */\r\nstatic void asm_comp64(ASMState *as, IRIns *ir)\r\n{\r\n  PPCCC cc = asm_compmap[(ir-1)->o];\r\n  if ((cc&3) == (CC_EQ&3)) {\r\n    asm_guardcc(as, cc);\r\n    emit_tab(as, (cc&4) ? PPCI_CRAND : PPCI_CROR,\r\n\t     (CC_EQ&3), (CC_EQ&3), 4+(CC_EQ&3));\r\n  } else {\r\n    asm_guardcc(as, CC_EQ);\r\n    emit_tab(as, PPCI_CROR, (CC_EQ&3), (CC_EQ&3), ((cc^~(cc>>2))&1));\r\n    emit_tab(as, (cc&4) ? PPCI_CRAND : PPCI_CRANDC,\r\n\t     (CC_EQ&3), (CC_EQ&3), 4+(cc&3));\r\n  }\r\n  /* Loword comparison sets cr1 and is unsigned, except for equality. */\r\n  asm_intcomp_(as, (ir-1)->op1, (ir-1)->op2, 4,\r\n\t       cc | ((cc&3) == (CC_EQ&3) ? 0 : CC_UNSIGNED));\r\n  /* Hiword comparison sets cr0. */\r\n  asm_intcomp_(as, ir->op1, ir->op2, 0, cc);\r\n  as->flagmcp = NULL;  /* Doesn't work here. */\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    as->curins--;  /* Always skip the loword comparison. */\r\n    asm_comp64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    as->curins--;  /* Handle both stores here. */\r\n    if ((ir-1)->r != RID_SINK) {\r\n      asm_xstore_(as, ir, 0);\r\n      asm_xstore_(as, ir-1, 4);\r\n    }\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD: as->curins--; asm_add64(as, ir); break;\r\n  case IR_SUB: as->curins--; asm_sub64(as, ir); break;\r\n  case IR_NEG: as->curins--; asm_neg64(as, ir); break;\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by lo op itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Profiling ----------------------------------------------------------- */\r\n\r\nstatic void asm_prof(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(ir);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_asi(as, PPCI_ANDIDOT, RID_TMP, RID_TMP, HOOK_PROFILE);\r\n  emit_lsglptr(as, PPCI_LBZ, RID_TMP,\r\n\t       (int32_t)offsetof(global_State, hookmask));\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore RID_RET*. */\r\n  Reg tmp, pbase = irp ? (ra_hasreg(irp->r) ? irp->r : RID_TMP) : RID_BASE;\r\n  rset_clear(allow, pbase);\r\n  tmp = allow ? rset_pickbot(allow) :\r\n\t\t(pbase == RID_RETHI ? RID_RETLO : RID_RETHI);\r\n  emit_condbranch(as, PPCI_BC, CC_LT, asm_exitstub_addr(as, exitno));\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_tai(as, PPCI_LWZ, tmp, RID_SP, SPOFS_TMPW);\r\n  else\r\n    ra_modified(as, tmp);\r\n  emit_ai(as, PPCI_CMPLWI, RID_TMP, (int32_t)(8*topslot));\r\n  emit_tab(as, PPCI_SUBF, RID_TMP, pbase, tmp);\r\n  emit_tai(as, PPCI_LWZ, tmp, tmp, offsetof(lua_State, maxstack));\r\n  if (pbase == RID_TMP)\r\n    emit_getgl(as, RID_TMP, jit_base);\r\n  emit_getgl(as, tmp, cur_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_tai(as, PPCI_STW, tmp, RID_SP, SPOFS_TMPW);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_fai(as, PPCI_STFD, src, RID_BASE, ofs);\r\n    } else {\r\n      Reg type;\r\n      RegSet allow = rset_exclude(RSET_GPR, RID_BASE);\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) || irt_isinteger(ir->t));\r\n      if (!irt_ispri(ir->t)) {\r\n\tReg src = ra_alloc1(as, ref, allow);\r\n\trset_clear(allow, src);\r\n\temit_tai(as, PPCI_STW, src, RID_BASE, ofs+4);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s == 0) continue;  /* Do not overwrite link to previous frame. */\r\n\ttype = ra_allock(as, (int32_t)(*flinks--), allow);\r\n      } else {\r\n\ttype = ra_allock(as, (int32_t)irt_toitype(ir->t), allow);\r\n      }\r\n      emit_tai(as, PPCI_STW, type, RID_BASE, ofs);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_ai(as, PPCI_CMPWI, RID_RET, 0);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  emit_tai(as, PPCI_ADDI, ra_releasetmp(as, ASMREF_TMP1), RID_JGL, -32768);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP2);\r\n  emit_loadi(as, tmp, as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_condbranch(as, PPCI_BC|PPCF_Y, CC_LT, l_end);\r\n  emit_ab(as, PPCI_CMPLW, RID_TMP, tmp);\r\n  emit_getgl(as, tmp, gc.threshold);\r\n  emit_getgl(as, RID_TMP, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->loopinv) {  /* Inverted loop branch? */\r\n    /* asm_guardcc already inverted the cond branch and patched the final b. */\r\n    p[-2] = (p[-2] & (0xffff0000u & ~PPCF_Y)) | (((target-p+2) & 0x3fffu) << 2);\r\n  } else {\r\n    p[-1] = PPCI_B|(((target-p+1)&0x00ffffffu)<<2);\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_mr(as, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_mr(as, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    *--p = PPCI_NOP;\r\n    *--p = PPCI_NOP;\r\n    as->mctop = p;\r\n  } else {\r\n    /* Patch stack adjustment. */\r\n    lua_assert(checki16(CFRAME_SIZE+spadj));\r\n    p[-3] = PPCI_ADDI | PPCF_T(RID_TMP) | PPCF_A(RID_SP) | (CFRAME_SIZE+spadj);\r\n    p[-2] = PPCI_STWU | PPCF_T(RID_TMP) | PPCF_A(RID_SP) | spadj;\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  p[-1] = PPCI_B|(((target-p+1)&0x00ffffffu)<<2);\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop - 1;  /* Leave room for exit branch. */\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    as->mcp = p-2;  /* Leave room for stack pointer adjustment. */\r\n    as->invmcp = NULL;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  uint32_t i, nargs = CCI_XNARGS(ci);\r\n  int nslots = 2, ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n  asm_collectargs(as, ir, ci, args);\r\n  for (i = 0; i < nargs; i++)\r\n    if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n      if (nfpr > 0) nfpr--; else nslots = (nslots+3) & ~1;\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n}\r\n\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_exitstub_setup(as, as->T->nsnap + (as->parent ? 1 : 0));\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *pe = (MCode *)((char *)p + T->szmcode);\r\n  MCode *px = exitstub_trace_addr(T, exitno);\r\n  MCode *cstart = NULL;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  int clearso = 0;\r\n  for (; p < pe; p++) {\r\n    /* Look for exitstub branch, try to replace with branch to target. */\r\n    uint32_t ins = *p;\r\n    if ((ins & 0xfc000000u) == 0x40000000u &&\r\n\t((ins ^ ((char *)px-(char *)p)) & 0xffffu) == 0) {\r\n      ptrdiff_t delta = (char *)target - (char *)p;\r\n      if (((ins >> 16) & 3) == (CC_SO&3)) {\r\n\tclearso = sizeof(MCode);\r\n\tdelta -= sizeof(MCode);\r\n      }\r\n      /* Many, but not all short-range branches can be patched directly. */\r\n      if (((delta + 0x8000) >> 16) == 0) {\r\n\t*p = (ins & 0xffdf0000u) | ((uint32_t)delta & 0xffffu) |\r\n\t     ((delta & 0x8000) * (PPCF_Y/0x8000));\r\n\tif (!cstart) cstart = p;\r\n      }\r\n    } else if ((ins & 0xfc000000u) == PPCI_B &&\r\n\t       ((ins ^ ((char *)px-(char *)p)) & 0x03ffffffu) == 0) {\r\n      ptrdiff_t delta = (char *)target - (char *)p;\r\n      lua_assert(((delta + 0x02000000) >> 26) == 0);\r\n      *p = PPCI_B | ((uint32_t)delta & 0x03ffffffu);\r\n      if (!cstart) cstart = p;\r\n    }\r\n  }\r\n  {  /* Always patch long-range branch in exit stub itself. */\r\n    ptrdiff_t delta = (char *)target - (char *)px - clearso;\r\n    lua_assert(((delta + 0x02000000) >> 26) == 0);\r\n    *px = PPCI_B | ((uint32_t)delta & 0x03ffffffu);\r\n  }\r\n  if (!cstart) cstart = px;\r\n  lj_mcode_sync(cstart, px+1);\r\n  if (clearso) {  /* Extend the current trace. Ugly workaround. */\r\n    MCode *pp = J->cur.mcode;\r\n    J->cur.szmcode += sizeof(MCode);\r\n    *--pp = PPCI_MCRXR;  /* Clear SO flag. */\r\n    J->cur.mcode = pp;\r\n    lj_mcode_sync(pp, pp+1);\r\n  }\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_asm_x86.h",
    "content": "/*\r\n** x86/x64 IR assembler (SSA IR -> machine code).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Guard handling ------------------------------------------------------ */\r\n\r\n/* Generate an exit stub group at the bottom of the reserved MCode memory. */\r\nstatic MCode *asm_exitstub_gen(ASMState *as, ExitNo group)\r\n{\r\n  ExitNo i, groupofs = (group*EXITSTUBS_PER_GROUP) & 0xff;\r\n  MCode *mxp = as->mcbot;\r\n  MCode *mxpstart = mxp;\r\n  if (mxp + (2+2)*EXITSTUBS_PER_GROUP+8+5 >= as->mctop)\r\n    asm_mclimit(as);\r\n  /* Push low byte of exitno for each exit stub. */\r\n  *mxp++ = XI_PUSHi8; *mxp++ = (MCode)groupofs;\r\n  for (i = 1; i < EXITSTUBS_PER_GROUP; i++) {\r\n    *mxp++ = XI_JMPs; *mxp++ = (MCode)((2+2)*(EXITSTUBS_PER_GROUP - i) - 2);\r\n    *mxp++ = XI_PUSHi8; *mxp++ = (MCode)(groupofs + i);\r\n  }\r\n  /* Push the high byte of the exitno for each exit stub group. */\r\n  *mxp++ = XI_PUSHi8; *mxp++ = (MCode)((group*EXITSTUBS_PER_GROUP)>>8);\r\n  /* Store DISPATCH at original stack slot 0. Account for the two push ops. */\r\n  *mxp++ = XI_MOVmi;\r\n  *mxp++ = MODRM(XM_OFS8, 0, RID_ESP);\r\n  *mxp++ = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n  *mxp++ = 2*sizeof(void *);\r\n  *(int32_t *)mxp = ptr2addr(J2GG(as->J)->dispatch); mxp += 4;\r\n  /* Jump to exit handler which fills in the ExitState. */\r\n  *mxp++ = XI_JMP; mxp += 4;\r\n  *((int32_t *)(mxp-4)) = jmprel(mxp, (MCode *)(void *)lj_vm_exit_handler);\r\n  /* Commit the code for this group (even if assembly fails later on). */\r\n  lj_mcode_commitbot(as->J, mxp);\r\n  as->mcbot = mxp;\r\n  as->mclim = as->mcbot + MCLIM_REDZONE;\r\n  return mxpstart;\r\n}\r\n\r\n/* Setup all needed exit stubs. */\r\nstatic void asm_exitstub_setup(ASMState *as, ExitNo nexits)\r\n{\r\n  ExitNo i;\r\n  if (nexits >= EXITSTUBS_PER_GROUP*LJ_MAX_EXITSTUBGR)\r\n    lj_trace_err(as->J, LJ_TRERR_SNAPOV);\r\n  for (i = 0; i < (nexits+EXITSTUBS_PER_GROUP-1)/EXITSTUBS_PER_GROUP; i++)\r\n    if (as->J->exitstubgroup[i] == NULL)\r\n      as->J->exitstubgroup[i] = asm_exitstub_gen(as, i);\r\n}\r\n\r\n/* Emit conditional branch to exit for guard.\r\n** It's important to emit this *after* all registers have been allocated,\r\n** because rematerializations may invalidate the flags.\r\n*/\r\nstatic void asm_guardcc(ASMState *as, int cc)\r\n{\r\n  MCode *target = exitstub_addr(as->J, as->snapno);\r\n  MCode *p = as->mcp;\r\n  if (LJ_UNLIKELY(p == as->invmcp)) {\r\n    as->loopinv = 1;\r\n    *(int32_t *)(p+1) = jmprel(p+5, target);\r\n    target = p;\r\n    cc ^= 1;\r\n    if (as->realign) {\r\n      emit_sjcc(as, cc, target);\r\n      return;\r\n    }\r\n  }\r\n  emit_jcc(as, cc, target);\r\n}\r\n\r\n/* -- Memory operand fusion ----------------------------------------------- */\r\n\r\n/* Limit linear search to this distance. Avoids O(n^2) behavior. */\r\n#define CONFLICT_SEARCH_LIM\t31\r\n\r\n/* Check if a reference is a signed 32 bit constant. */\r\nstatic int asm_isk32(ASMState *as, IRRef ref, int32_t *k)\r\n{\r\n  if (irref_isk(ref)) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->o != IR_KINT64) {\r\n      *k = ir->i;\r\n      return 1;\r\n    } else if (checki32((int64_t)ir_kint64(ir)->u64)) {\r\n      *k = (int32_t)ir_kint64(ir)->u64;\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check if there's no conflicting instruction between curins and ref.\r\n** Also avoid fusing loads if there are multiple references.\r\n*/\r\nstatic int noconflict(ASMState *as, IRRef ref, IROp conflict, int noload)\r\n{\r\n  IRIns *ir = as->ir;\r\n  IRRef i = as->curins;\r\n  if (i > ref + CONFLICT_SEARCH_LIM)\r\n    return 0;  /* Give up, ref is too far away. */\r\n  while (--i > ref) {\r\n    if (ir[i].o == conflict)\r\n      return 0;  /* Conflict found. */\r\n    else if (!noload && (ir[i].op1 == ref || ir[i].op2 == ref))\r\n      return 0;\r\n  }\r\n  return 1;  /* Ok, no conflict. */\r\n}\r\n\r\n/* Fuse array base into memory operand. */\r\nstatic IRRef asm_fuseabase(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *irb = IR(ref);\r\n  as->mrm.ofs = 0;\r\n  if (irb->o == IR_FLOAD) {\r\n    IRIns *ira = IR(irb->op1);\r\n    lua_assert(irb->op2 == IRFL_TAB_ARRAY);\r\n    /* We can avoid the FLOAD of t->array for colocated arrays. */\r\n    if (ira->o == IR_TNEW && ira->op1 <= LJ_MAX_COLOSIZE &&\r\n\t!neverfuse(as) && noconflict(as, irb->op1, IR_NEWREF, 1)) {\r\n      as->mrm.ofs = (int32_t)sizeof(GCtab);  /* Ofs to colocated array. */\r\n      return irb->op1;  /* Table obj. */\r\n    }\r\n  } else if (irb->o == IR_ADD && irref_isk(irb->op2)) {\r\n    /* Fuse base offset (vararg load). */\r\n    as->mrm.ofs = IR(irb->op2)->i;\r\n    return irb->op1;\r\n  }\r\n  return ref;  /* Otherwise use the given array base. */\r\n}\r\n\r\n/* Fuse array reference into memory operand. */\r\nstatic void asm_fusearef(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irx;\r\n  lua_assert(ir->o == IR_AREF);\r\n  as->mrm.base = (uint8_t)ra_alloc1(as, asm_fuseabase(as, ir->op1), allow);\r\n  irx = IR(ir->op2);\r\n  if (irref_isk(ir->op2)) {\r\n    as->mrm.ofs += 8*irx->i;\r\n    as->mrm.idx = RID_NONE;\r\n  } else {\r\n    rset_clear(allow, as->mrm.base);\r\n    as->mrm.scale = XM_SCALE8;\r\n    /* Fuse a constant ADD (e.g. t[i+1]) into the offset.\r\n    ** Doesn't help much without ABCelim, but reduces register pressure.\r\n    */\r\n    if (!LJ_64 &&  /* Has bad effects with negative index on x64. */\r\n\tmayfuse(as, ir->op2) && ra_noreg(irx->r) &&\r\n\tirx->o == IR_ADD && irref_isk(irx->op2)) {\r\n      as->mrm.ofs += 8*IR(irx->op2)->i;\r\n      as->mrm.idx = (uint8_t)ra_alloc1(as, irx->op1, allow);\r\n    } else {\r\n      as->mrm.idx = (uint8_t)ra_alloc1(as, ir->op2, allow);\r\n    }\r\n  }\r\n}\r\n\r\n/* Fuse array/hash/upvalue reference into memory operand.\r\n** Caveat: this may allocate GPRs for the base/idx registers. Be sure to\r\n** pass the final allow mask, excluding any GPRs used for other inputs.\r\n** In particular: 2-operand GPR instructions need to call ra_dest() first!\r\n*/\r\nstatic void asm_fuseahuref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_noreg(ir->r)) {\r\n    switch ((IROp)ir->o) {\r\n    case IR_AREF:\r\n      if (mayfuse(as, ref)) {\r\n\tasm_fusearef(as, ir, allow);\r\n\treturn;\r\n      }\r\n      break;\r\n    case IR_HREFK:\r\n      if (mayfuse(as, ref)) {\r\n\tas->mrm.base = (uint8_t)ra_alloc1(as, ir->op1, allow);\r\n\tas->mrm.ofs = (int32_t)(IR(ir->op2)->op2 * sizeof(Node));\r\n\tas->mrm.idx = RID_NONE;\r\n\treturn;\r\n      }\r\n      break;\r\n    case IR_UREFC:\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn = ir_kfunc(IR(ir->op1));\r\n\tGCupval *uv = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv;\r\n\tas->mrm.ofs = ptr2addr(&uv->tv);\r\n\tas->mrm.base = as->mrm.idx = RID_NONE;\r\n\treturn;\r\n      }\r\n      break;\r\n    default:\r\n      lua_assert(ir->o == IR_HREF || ir->o == IR_NEWREF || ir->o == IR_UREFO ||\r\n\t\t ir->o == IR_KKPTR);\r\n      break;\r\n    }\r\n  }\r\n  as->mrm.base = (uint8_t)ra_alloc1(as, ref, allow);\r\n  as->mrm.ofs = 0;\r\n  as->mrm.idx = RID_NONE;\r\n}\r\n\r\n/* Fuse FLOAD/FREF reference into memory operand. */\r\nstatic void asm_fusefref(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  lua_assert(ir->o == IR_FLOAD || ir->o == IR_FREF);\r\n  as->mrm.ofs = field_ofs[ir->op2];\r\n  as->mrm.idx = RID_NONE;\r\n  if (irref_isk(ir->op1)) {\r\n    as->mrm.ofs += IR(ir->op1)->i;\r\n    as->mrm.base = RID_NONE;\r\n  } else {\r\n    as->mrm.base = (uint8_t)ra_alloc1(as, ir->op1, allow);\r\n  }\r\n}\r\n\r\n/* Fuse string reference into memory operand. */\r\nstatic void asm_fusestrref(ASMState *as, IRIns *ir, RegSet allow)\r\n{\r\n  IRIns *irr;\r\n  lua_assert(ir->o == IR_STRREF);\r\n  as->mrm.base = as->mrm.idx = RID_NONE;\r\n  as->mrm.scale = XM_SCALE1;\r\n  as->mrm.ofs = sizeof(GCstr);\r\n  if (irref_isk(ir->op1)) {\r\n    as->mrm.ofs += IR(ir->op1)->i;\r\n  } else {\r\n    Reg r = ra_alloc1(as, ir->op1, allow);\r\n    rset_clear(allow, r);\r\n    as->mrm.base = (uint8_t)r;\r\n  }\r\n  irr = IR(ir->op2);\r\n  if (irref_isk(ir->op2)) {\r\n    as->mrm.ofs += irr->i;\r\n  } else {\r\n    Reg r;\r\n    /* Fuse a constant add into the offset, e.g. string.sub(s, i+10). */\r\n    if (!LJ_64 &&  /* Has bad effects with negative index on x64. */\r\n\tmayfuse(as, ir->op2) && irr->o == IR_ADD && irref_isk(irr->op2)) {\r\n      as->mrm.ofs += IR(irr->op2)->i;\r\n      r = ra_alloc1(as, irr->op1, allow);\r\n    } else {\r\n      r = ra_alloc1(as, ir->op2, allow);\r\n    }\r\n    if (as->mrm.base == RID_NONE)\r\n      as->mrm.base = (uint8_t)r;\r\n    else\r\n      as->mrm.idx = (uint8_t)r;\r\n  }\r\n}\r\n\r\nstatic void asm_fusexref(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  as->mrm.idx = RID_NONE;\r\n  if (ir->o == IR_KPTR || ir->o == IR_KKPTR) {\r\n    as->mrm.ofs = ir->i;\r\n    as->mrm.base = RID_NONE;\r\n  } else if (ir->o == IR_STRREF) {\r\n    asm_fusestrref(as, ir, allow);\r\n  } else {\r\n    as->mrm.ofs = 0;\r\n    if (canfuse(as, ir) && ir->o == IR_ADD && ra_noreg(ir->r)) {\r\n      /* Gather (base+idx*sz)+ofs as emitted by cdata ptr/array indexing. */\r\n      IRIns *irx;\r\n      IRRef idx;\r\n      Reg r;\r\n      if (asm_isk32(as, ir->op2, &as->mrm.ofs)) {  /* Recognize x+ofs. */\r\n\tref = ir->op1;\r\n\tir = IR(ref);\r\n\tif (!(ir->o == IR_ADD && canfuse(as, ir) && ra_noreg(ir->r)))\r\n\t  goto noadd;\r\n      }\r\n      as->mrm.scale = XM_SCALE1;\r\n      idx = ir->op1;\r\n      ref = ir->op2;\r\n      irx = IR(idx);\r\n      if (!(irx->o == IR_BSHL || irx->o == IR_ADD)) {  /* Try other operand. */\r\n\tidx = ir->op2;\r\n\tref = ir->op1;\r\n\tirx = IR(idx);\r\n      }\r\n      if (canfuse(as, irx) && ra_noreg(irx->r)) {\r\n\tif (irx->o == IR_BSHL && irref_isk(irx->op2) && IR(irx->op2)->i <= 3) {\r\n\t  /* Recognize idx<<b with b = 0-3, corresponding to sz = (1),2,4,8. */\r\n\t  idx = irx->op1;\r\n\t  as->mrm.scale = (uint8_t)(IR(irx->op2)->i << 6);\r\n\t} else if (irx->o == IR_ADD && irx->op1 == irx->op2) {\r\n\t  /* FOLD does idx*2 ==> idx<<1 ==> idx+idx. */\r\n\t  idx = irx->op1;\r\n\t  as->mrm.scale = XM_SCALE2;\r\n\t}\r\n      }\r\n      r = ra_alloc1(as, idx, allow);\r\n      rset_clear(allow, r);\r\n      as->mrm.idx = (uint8_t)r;\r\n    }\r\n  noadd:\r\n    as->mrm.base = (uint8_t)ra_alloc1(as, ref, allow);\r\n  }\r\n}\r\n\r\n/* Fuse load into memory operand. */\r\nstatic Reg asm_fuseload(ASMState *as, IRRef ref, RegSet allow)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ra_hasreg(ir->r)) {\r\n    if (allow != RSET_EMPTY) {  /* Fast path. */\r\n      ra_noweak(as, ir->r);\r\n      return ir->r;\r\n    }\r\n  fusespill:\r\n    /* Force a spill if only memory operands are allowed (asm_x87load). */\r\n    as->mrm.base = RID_ESP;\r\n    as->mrm.ofs = ra_spill(as, ir);\r\n    as->mrm.idx = RID_NONE;\r\n    return RID_MRM;\r\n  }\r\n  if (ir->o == IR_KNUM) {\r\n    RegSet avail = as->freeset & ~as->modset & RSET_FPR;\r\n    lua_assert(allow != RSET_EMPTY);\r\n    if (!(avail & (avail-1))) {  /* Fuse if less than two regs available. */\r\n      as->mrm.ofs = ptr2addr(ir_knum(ir));\r\n      as->mrm.base = as->mrm.idx = RID_NONE;\r\n      return RID_MRM;\r\n    }\r\n  } else if (ir->o == IR_KINT64) {\r\n    RegSet avail = as->freeset & ~as->modset & RSET_GPR;\r\n    lua_assert(allow != RSET_EMPTY);\r\n    if (!(avail & (avail-1))) {  /* Fuse if less than two regs available. */\r\n      as->mrm.ofs = ptr2addr(ir_kint64(ir));\r\n      as->mrm.base = as->mrm.idx = RID_NONE;\r\n      return RID_MRM;\r\n    }\r\n  } else if (mayfuse(as, ref)) {\r\n    RegSet xallow = (allow & RSET_GPR) ? allow : RSET_GPR;\r\n    if (ir->o == IR_SLOAD) {\r\n      if (!(ir->op2 & (IRSLOAD_PARENT|IRSLOAD_CONVERT)) &&\r\n\t  noconflict(as, ref, IR_RETF, 0)) {\r\n\tas->mrm.base = (uint8_t)ra_alloc1(as, REF_BASE, xallow);\r\n\tas->mrm.ofs = 8*((int32_t)ir->op1-1) + ((ir->op2&IRSLOAD_FRAME)?4:0);\r\n\tas->mrm.idx = RID_NONE;\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_FLOAD) {\r\n      /* Generic fusion is only ok for 32 bit operand (but see asm_comp). */\r\n      if ((irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t)) &&\r\n\t  noconflict(as, ref, IR_FSTORE, 0)) {\r\n\tasm_fusefref(as, ir, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_ALOAD || ir->o == IR_HLOAD || ir->o == IR_ULOAD) {\r\n      if (noconflict(as, ref, ir->o + IRDELTA_L2S, 0)) {\r\n\tasm_fuseahuref(as, ir->op1, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_XLOAD) {\r\n      /* Generic fusion is not ok for 8/16 bit operands (but see asm_comp).\r\n      ** Fusing unaligned memory operands is ok on x86 (except for SIMD types).\r\n      */\r\n      if ((!irt_typerange(ir->t, IRT_I8, IRT_U16)) &&\r\n\t  noconflict(as, ref, IR_XSTORE, 0)) {\r\n\tasm_fusexref(as, ir->op1, xallow);\r\n\treturn RID_MRM;\r\n      }\r\n    } else if (ir->o == IR_VLOAD) {\r\n      asm_fuseahuref(as, ir->op1, xallow);\r\n      return RID_MRM;\r\n    }\r\n  }\r\n  if (!(as->freeset & allow) && !irref_isk(ref) &&\r\n      (allow == RSET_EMPTY || ra_hasspill(ir->s) || iscrossref(as, ref)))\r\n    goto fusespill;\r\n  return ra_allocref(as, ref, allow);\r\n}\r\n\r\n#if LJ_64\r\n/* Don't fuse a 32 bit load into a 64 bit operation. */\r\nstatic Reg asm_fuseloadm(ASMState *as, IRRef ref, RegSet allow, int is64)\r\n{\r\n  if (is64 && !irt_is64(IR(ref)->t))\r\n    return ra_alloc1(as, ref, allow);\r\n  return asm_fuseload(as, ref, allow);\r\n}\r\n#else\r\n#define asm_fuseloadm(as, ref, allow, is64)  asm_fuseload(as, (ref), (allow))\r\n#endif\r\n\r\n/* -- Calls --------------------------------------------------------------- */\r\n\r\n/* Count the required number of stack slots for a call. */\r\nstatic int asm_count_call_slots(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t i, nargs = CCI_XNARGS(ci);\r\n  int nslots = 0;\r\n#if LJ_64\r\n  if (LJ_ABI_WIN) {\r\n    nslots = (int)(nargs*2);  /* Only matters for more than four args. */\r\n  } else {\r\n    int ngpr = REGARG_NUMGPR, nfpr = REGARG_NUMFPR;\r\n    for (i = 0; i < nargs; i++)\r\n      if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n\tif (nfpr > 0) nfpr--; else nslots += 2;\r\n      } else {\r\n\tif (ngpr > 0) ngpr--; else nslots += 2;\r\n      }\r\n  }\r\n#else\r\n  int ngpr = 0;\r\n  if ((ci->flags & CCI_CC_MASK) == CCI_CC_FASTCALL)\r\n    ngpr = 2;\r\n  else if ((ci->flags & CCI_CC_MASK) == CCI_CC_THISCALL)\r\n    ngpr = 1;\r\n  for (i = 0; i < nargs; i++)\r\n    if (args[i] && irt_isfp(IR(args[i])->t)) {\r\n      nslots += irt_isnum(IR(args[i])->t) ? 2 : 1;\r\n    } else {\r\n      if (ngpr > 0) ngpr--; else nslots++;\r\n    }\r\n#endif\r\n  return nslots;\r\n}\r\n\r\n/* Generate a call to a C function. */\r\nstatic void asm_gencall(ASMState *as, const CCallInfo *ci, IRRef *args)\r\n{\r\n  uint32_t n, nargs = CCI_XNARGS(ci);\r\n  int32_t ofs = STACKARG_OFS;\r\n#if LJ_64\r\n  uint32_t gprs = REGARG_GPRS;\r\n  Reg fpr = REGARG_FIRSTFPR;\r\n#if !LJ_ABI_WIN\r\n  MCode *patchnfpr = NULL;\r\n#endif\r\n#else\r\n  uint32_t gprs = 0;\r\n  if ((ci->flags & CCI_CC_MASK) != CCI_CC_CDECL) {\r\n    if ((ci->flags & CCI_CC_MASK) == CCI_CC_THISCALL)\r\n      gprs = (REGARG_GPRS & 31);\r\n    else if ((ci->flags & CCI_CC_MASK) == CCI_CC_FASTCALL)\r\n      gprs = REGARG_GPRS;\r\n  }\r\n#endif\r\n  if ((void *)ci->func)\r\n    emit_call(as, ci->func);\r\n#if LJ_64\r\n  if ((ci->flags & CCI_VARARG)) {  /* Special handling for vararg calls. */\r\n#if LJ_ABI_WIN\r\n    for (n = 0; n < 4 && n < nargs; n++) {\r\n      IRIns *ir = IR(args[n]);\r\n      if (irt_isfp(ir->t))  /* Duplicate FPRs in GPRs. */\r\n\temit_rr(as, XO_MOVDto, (irt_isnum(ir->t) ? REX_64 : 0) | (fpr+n),\r\n\t\t((gprs >> (n*5)) & 31));  /* Either MOVD or MOVQ. */\r\n    }\r\n#else\r\n    patchnfpr = --as->mcp;  /* Indicate number of used FPRs in register al. */\r\n    *--as->mcp = XI_MOVrib | RID_EAX;\r\n#endif\r\n  }\r\n#endif\r\n  for (n = 0; n < nargs; n++) {  /* Setup args. */\r\n    IRRef ref = args[n];\r\n    IRIns *ir = IR(ref);\r\n    Reg r;\r\n#if LJ_64 && LJ_ABI_WIN\r\n    /* Windows/x64 argument registers are strictly positional. */\r\n    r = irt_isfp(ir->t) ? (fpr <= REGARG_LASTFPR ? fpr : 0) : (gprs & 31);\r\n    fpr++; gprs >>= 5;\r\n#elif LJ_64\r\n    /* POSIX/x64 argument registers are used in order of appearance. */\r\n    if (irt_isfp(ir->t)) {\r\n      r = fpr <= REGARG_LASTFPR ? fpr++ : 0;\r\n    } else {\r\n      r = gprs & 31; gprs >>= 5;\r\n    }\r\n#else\r\n    if (ref && irt_isfp(ir->t)) {\r\n      r = 0;\r\n    } else {\r\n      r = gprs & 31; gprs >>= 5;\r\n      if (!ref) continue;\r\n    }\r\n#endif\r\n    if (r) {  /* Argument is in a register. */\r\n      if (r < RID_MAX_GPR && ref < ASMREF_TMP1) {\r\n#if LJ_64\r\n\tif (ir->o == IR_KINT64)\r\n\t  emit_loadu64(as, r, ir_kint64(ir)->u64);\r\n\telse\r\n#endif\r\n\t  emit_loadi(as, r, ir->i);\r\n      } else {\r\n\tlua_assert(rset_test(as->freeset, r));  /* Must have been evicted. */\r\n\tif (ra_hasreg(ir->r)) {\r\n\t  ra_noweak(as, ir->r);\r\n\t  emit_movrr(as, ir, r, ir->r);\r\n\t} else {\r\n\t  ra_allocref(as, ref, RID2RSET(r));\r\n\t}\r\n      }\r\n    } else if (irt_isfp(ir->t)) {  /* FP argument is on stack. */\r\n      lua_assert(!(irt_isfloat(ir->t) && irref_isk(ref)));  /* No float k. */\r\n      if (LJ_32 && (ofs & 4) && irref_isk(ref)) {\r\n\t/* Split stores for unaligned FP consts. */\r\n\temit_movmroi(as, RID_ESP, ofs, (int32_t)ir_knum(ir)->u32.lo);\r\n\temit_movmroi(as, RID_ESP, ofs+4, (int32_t)ir_knum(ir)->u32.hi);\r\n      } else {\r\n\tr = ra_alloc1(as, ref, RSET_FPR);\r\n\temit_rmro(as, irt_isnum(ir->t) ? XO_MOVSDto : XO_MOVSSto,\r\n\t\t  r, RID_ESP, ofs);\r\n      }\r\n      ofs += (LJ_32 && irt_isfloat(ir->t)) ? 4 : 8;\r\n    } else {  /* Non-FP argument is on stack. */\r\n      if (LJ_32 && ref < ASMREF_TMP1) {\r\n\temit_movmroi(as, RID_ESP, ofs, ir->i);\r\n      } else {\r\n\tr = ra_alloc1(as, ref, RSET_GPR);\r\n\temit_movtomro(as, REX_64 + r, RID_ESP, ofs);\r\n      }\r\n      ofs += sizeof(intptr_t);\r\n    }\r\n    checkmclim(as);\r\n  }\r\n#if LJ_64 && !LJ_ABI_WIN\r\n  if (patchnfpr) *patchnfpr = fpr - REGARG_FIRSTFPR;\r\n#endif\r\n}\r\n\r\n/* Setup result reg/sp for call. Evict scratch regs. */\r\nstatic void asm_setupresult(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  RegSet drop = RSET_SCRATCH;\r\n  int hiop = (LJ_32 && (ir+1)->o == IR_HIOP);\r\n  if ((ci->flags & CCI_NOFPRCLOBBER))\r\n    drop &= ~RSET_FPR;\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  if (hiop && ra_hasreg((ir+1)->r))\r\n    rset_clear(drop, (ir+1)->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);  /* Evictions must be performed first. */\r\n  if (ra_used(ir)) {\r\n    if (irt_isfp(ir->t)) {\r\n      int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n#if LJ_64\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\tReg dest = ir->r;\r\n\tif (ra_hasreg(dest)) {\r\n\t  ra_free(as, dest);\r\n\t  ra_modified(as, dest);\r\n\t  emit_rr(as, XO_MOVD, dest|REX_64, RID_RET);  /* Really MOVQ. */\r\n\t}\r\n\tif (ofs) emit_movtomro(as, RID_RET|REX_64, RID_ESP, ofs);\r\n      } else {\r\n\tra_destreg(as, ir, RID_FPRET);\r\n      }\r\n#else\r\n      /* Number result is in x87 st0 for x86 calling convention. */\r\n      Reg dest = ir->r;\r\n      if (ra_hasreg(dest)) {\r\n\tra_free(as, dest);\r\n\tra_modified(as, dest);\r\n\temit_rmro(as, irt_isnum(ir->t) ? XO_MOVSD : XO_MOVSS,\r\n\t\t  dest, RID_ESP, ofs);\r\n      }\r\n      if ((ci->flags & CCI_CASTU64)) {\r\n\temit_movtomro(as, RID_RETLO, RID_ESP, ofs);\r\n\temit_movtomro(as, RID_RETHI, RID_ESP, ofs+4);\r\n      } else {\r\n\temit_rmro(as, irt_isnum(ir->t) ? XO_FSTPq : XO_FSTPd,\r\n\t\t  irt_isnum(ir->t) ? XOg_FSTPq : XOg_FSTPd, RID_ESP, ofs);\r\n      }\r\n#endif\r\n#if LJ_32\r\n    } else if (hiop) {\r\n      ra_destpair(as, ir);\r\n#endif\r\n    } else {\r\n      lua_assert(!irt_ispri(ir->t));\r\n      ra_destreg(as, ir, RID_RET);\r\n    }\r\n  } else if (LJ_32 && irt_isfp(ir->t) && !(ci->flags & CCI_CASTU64)) {\r\n    emit_x87op(as, XI_FPOP);  /* Pop unused result from x87 st0. */\r\n  }\r\n}\r\n\r\n/* Return a constant function pointer or NULL for indirect calls. */\r\nstatic void *asm_callx_func(ASMState *as, IRIns *irf, IRRef func)\r\n{\r\n#if LJ_32\r\n  UNUSED(as);\r\n  if (irref_isk(func))\r\n    return (void *)irf->i;\r\n#else\r\n  if (irref_isk(func)) {\r\n    MCode *p;\r\n    if (irf->o == IR_KINT64)\r\n      p = (MCode *)(void *)ir_k64(irf)->u64;\r\n    else\r\n      p = (MCode *)(void *)(uintptr_t)(uint32_t)irf->i;\r\n    if (p - as->mcp == (int32_t)(p - as->mcp))\r\n      return p;  /* Call target is still in +-2GB range. */\r\n    /* Avoid the indirect case of emit_call(). Try to hoist func addr. */\r\n  }\r\n#endif\r\n  return NULL;\r\n}\r\n\r\nstatic void asm_callx(ASMState *as, IRIns *ir)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  CCallInfo ci;\r\n  IRRef func;\r\n  IRIns *irf;\r\n  int32_t spadj = 0;\r\n  ci.flags = asm_callx_flags(as, ir);\r\n  asm_collectargs(as, ir, &ci, args);\r\n  asm_setupresult(as, ir, &ci);\r\n#if LJ_32\r\n  /* Have to readjust stack after non-cdecl calls due to callee cleanup. */\r\n  if ((ci.flags & CCI_CC_MASK) != CCI_CC_CDECL)\r\n    spadj = 4 * asm_count_call_slots(as, &ci, args);\r\n#endif\r\n  func = ir->op2; irf = IR(func);\r\n  if (irf->o == IR_CARG) { func = irf->op1; irf = IR(func); }\r\n  ci.func = (ASMFunction)asm_callx_func(as, irf, func);\r\n  if (!(void *)ci.func) {\r\n    /* Use a (hoistable) non-scratch register for indirect calls. */\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n    Reg r = ra_alloc1(as, func, allow);\r\n    if (LJ_32) emit_spsub(as, spadj);  /* Above code may cause restores! */\r\n    emit_rr(as, XO_GROUP5, XOg_CALL, r);\r\n  } else if (LJ_32) {\r\n    emit_spsub(as, spadj);\r\n  }\r\n  asm_gencall(as, &ci, args);\r\n}\r\n\r\n/* -- Returns ------------------------------------------------------------- */\r\n\r\n/* Return to lower frame. Guard that it goes to the right spot. */\r\nstatic void asm_retf(ASMState *as, IRIns *ir)\r\n{\r\n  Reg base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  void *pc = ir_kptr(IR(ir->op2));\r\n  int32_t delta = 1+LJ_FR2+bc_a(*((const BCIns *)pc - 1));\r\n  as->topslot -= (BCReg)delta;\r\n  if ((int32_t)as->topslot < 0) as->topslot = 0;\r\n  irt_setmark(IR(REF_BASE)->t);  /* Children must not coalesce with BASE reg. */\r\n  emit_setgl(as, base, jit_base);\r\n  emit_addptr(as, base, -8*delta);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_gmroi(as, XG_ARITHi(XOg_CMP), base, -4, ptr2addr(pc));\r\n}\r\n\r\n/* -- Type conversions ---------------------------------------------------- */\r\n\r\nstatic void asm_tointg(ASMState *as, IRIns *ir, Reg left)\r\n{\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_FPR, left));\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_guardcc(as, CC_P);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_rr(as, XO_UCOMISD, left, tmp);\r\n  emit_rr(as, XO_CVTSI2SD, tmp, dest);\r\n  emit_rr(as, XO_XORPS, tmp, tmp);  /* Avoid partial register stall. */\r\n  emit_rr(as, XO_CVTTSD2SI, dest, left);\r\n  /* Can't fuse since left is needed twice. */\r\n}\r\n\r\nstatic void asm_tobit(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  Reg tmp = ra_noreg(IR(ir->op1)->r) ?\r\n\t      ra_alloc1(as, ir->op1, RSET_FPR) :\r\n\t      ra_scratch(as, RSET_FPR);\r\n  Reg right = asm_fuseload(as, ir->op2, rset_exclude(RSET_FPR, tmp));\r\n  emit_rr(as, XO_MOVDto, tmp, dest);\r\n  emit_mrm(as, XO_ADDSD, tmp, right);\r\n  ra_left(as, tmp, ir->op1);\r\n}\r\n\r\nstatic void asm_conv(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n  int st64 = (st == IRT_I64 || st == IRT_U64 || (LJ_64 && st == IRT_P64));\r\n  int stfp = (st == IRT_NUM || st == IRT_FLOAT);\r\n  IRRef lref = ir->op1;\r\n  lua_assert(irt_type(ir->t) != st);\r\n  lua_assert(!(LJ_32 && (irt_isint64(ir->t) || st64)));  /* Handled by SPLIT. */\r\n  if (irt_isfp(ir->t)) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    if (stfp) {  /* FP to FP conversion. */\r\n      Reg left = asm_fuseload(as, lref, RSET_FPR);\r\n      emit_mrm(as, st == IRT_NUM ? XO_CVTSD2SS : XO_CVTSS2SD, dest, left);\r\n      if (left == dest) return;  /* Avoid the XO_XORPS. */\r\n    } else if (LJ_32 && st == IRT_U32) {  /* U32 to FP conversion on x86. */\r\n      /* number = (2^52+2^51 .. u32) - (2^52+2^51) */\r\n      cTValue *k = lj_ir_k64_find(as->J, U64x(43380000,00000000));\r\n      Reg bias = ra_scratch(as, rset_exclude(RSET_FPR, dest));\r\n      if (irt_isfloat(ir->t))\r\n\temit_rr(as, XO_CVTSD2SS, dest, dest);\r\n      emit_rr(as, XO_SUBSD, dest, bias);  /* Subtract 2^52+2^51 bias. */\r\n      emit_rr(as, XO_XORPS, dest, bias);  /* Merge bias and integer. */\r\n      emit_loadn(as, bias, k);\r\n      emit_mrm(as, XO_MOVD, dest, asm_fuseload(as, lref, RSET_GPR));\r\n      return;\r\n    } else {  /* Integer to FP conversion. */\r\n      Reg left = (LJ_64 && (st == IRT_U32 || st == IRT_U64)) ?\r\n\t\t ra_alloc1(as, lref, RSET_GPR) :\r\n\t\t asm_fuseloadm(as, lref, RSET_GPR, st64);\r\n      if (LJ_64 && st == IRT_U64) {\r\n\tMCLabel l_end = emit_label(as);\r\n\tconst void *k = lj_ir_k64_find(as->J, U64x(43f00000,00000000));\r\n\temit_rma(as, XO_ADDSD, dest, k);  /* Add 2^64 to compensate. */\r\n\temit_sjcc(as, CC_NS, l_end);\r\n\temit_rr(as, XO_TEST, left|REX_64, left);  /* Check if u64 >= 2^63. */\r\n      }\r\n      emit_mrm(as, irt_isnum(ir->t) ? XO_CVTSI2SD : XO_CVTSI2SS,\r\n\t       dest|((LJ_64 && (st64 || st == IRT_U32)) ? REX_64 : 0), left);\r\n    }\r\n    emit_rr(as, XO_XORPS, dest, dest);  /* Avoid partial register stall. */\r\n  } else if (stfp) {  /* FP to integer conversion. */\r\n    if (irt_isguard(ir->t)) {\r\n      /* Checked conversions are only supported from number to int. */\r\n      lua_assert(irt_isint(ir->t) && st == IRT_NUM);\r\n      asm_tointg(as, ir, ra_alloc1(as, lref, RSET_FPR));\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      x86Op op = st == IRT_NUM ? XO_CVTTSD2SI : XO_CVTTSS2SI;\r\n      if (LJ_64 ? irt_isu64(ir->t) : irt_isu32(ir->t)) {\r\n\t/* LJ_64: For inputs >= 2^63 add -2^64, convert again. */\r\n\t/* LJ_32: For inputs >= 2^31 add -2^31, convert again and add 2^31. */\r\n\tReg tmp = ra_noreg(IR(lref)->r) ? ra_alloc1(as, lref, RSET_FPR) :\r\n\t\t\t\t\t  ra_scratch(as, RSET_FPR);\r\n\tMCLabel l_end = emit_label(as);\r\n\tif (LJ_32)\r\n\t  emit_gri(as, XG_ARITHi(XOg_ADD), dest, (int32_t)0x80000000);\r\n\temit_rr(as, op, dest|REX_64, tmp);\r\n\tif (st == IRT_NUM)\r\n\t  emit_rma(as, XO_ADDSD, tmp, lj_ir_k64_find(as->J,\r\n\t\t   LJ_64 ? U64x(c3f00000,00000000) : U64x(c1e00000,00000000)));\r\n\telse\r\n\t  emit_rma(as, XO_ADDSS, tmp, lj_ir_k64_find(as->J,\r\n\t\t   LJ_64 ? U64x(00000000,df800000) : U64x(00000000,cf000000)));\r\n\temit_sjcc(as, CC_NS, l_end);\r\n\temit_rr(as, XO_TEST, dest|REX_64, dest);  /* Check if dest negative. */\r\n\temit_rr(as, op, dest|REX_64, tmp);\r\n\tra_left(as, tmp, lref);\r\n      } else {\r\n\tReg left = asm_fuseload(as, lref, RSET_FPR);\r\n\tif (LJ_64 && irt_isu32(ir->t))\r\n\t  emit_rr(as, XO_MOV, dest, dest);  /* Zero hiword. */\r\n\temit_mrm(as, op,\r\n\t\t dest|((LJ_64 &&\r\n\t\t\t(irt_is64(ir->t) || irt_isu32(ir->t))) ? REX_64 : 0),\r\n\t\t left);\r\n      }\r\n    }\r\n  } else if (st >= IRT_I8 && st <= IRT_U16) {  /* Extend to 32 bit integer. */\r\n    Reg left, dest = ra_dest(as, ir, RSET_GPR);\r\n    RegSet allow = RSET_GPR;\r\n    x86Op op;\r\n    lua_assert(irt_isint(ir->t) || irt_isu32(ir->t));\r\n    if (st == IRT_I8) {\r\n      op = XO_MOVSXb; allow = RSET_GPR8; dest |= FORCE_REX;\r\n    } else if (st == IRT_U8) {\r\n      op = XO_MOVZXb; allow = RSET_GPR8; dest |= FORCE_REX;\r\n    } else if (st == IRT_I16) {\r\n      op = XO_MOVSXw;\r\n    } else {\r\n      op = XO_MOVZXw;\r\n    }\r\n    left = asm_fuseload(as, lref, allow);\r\n    /* Add extra MOV if source is already in wrong register. */\r\n    if (!LJ_64 && left != RID_MRM && !rset_test(allow, left)) {\r\n      Reg tmp = ra_scratch(as, allow);\r\n      emit_rr(as, op, dest, tmp);\r\n      emit_rr(as, XO_MOV, tmp, left);\r\n    } else {\r\n      emit_mrm(as, op, dest, left);\r\n    }\r\n  } else {  /* 32/64 bit integer conversions. */\r\n    if (LJ_32) {  /* Only need to handle 32/32 bit no-op (cast) on x86. */\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      ra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n    } else if (irt_is64(ir->t)) {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      if (st64 || !(ir->op2 & IRCONV_SEXT)) {\r\n\t/* 64/64 bit no-op (cast) or 32 to 64 bit zero extension. */\r\n\tra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n      } else {  /* 32 to 64 bit sign extension. */\r\n\tReg left = asm_fuseload(as, lref, RSET_GPR);\r\n\temit_mrm(as, XO_MOVSXd, dest|REX_64, left);\r\n      }\r\n    } else {\r\n      Reg dest = ra_dest(as, ir, RSET_GPR);\r\n      if (st64) {\r\n\tReg left = asm_fuseload(as, lref, RSET_GPR);\r\n\t/* This is either a 32 bit reg/reg mov which zeroes the hiword\r\n\t** or a load of the loword from a 64 bit address.\r\n\t*/\r\n\temit_mrm(as, XO_MOV, dest, left);\r\n      } else {  /* 32/32 bit no-op (cast). */\r\n\tra_left(as, dest, lref);  /* Do nothing, but may need to move regs. */\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* No SSE conversions to/from 64 bit on x86, so resort to ugly x87 code. */\r\n\r\n/* 64 bit integer to FP conversion in 32 bit mode. */\r\nstatic void asm_conv_fp_int64(ASMState *as, IRIns *ir)\r\n{\r\n  Reg hi = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg lo = ra_alloc1(as, (ir-1)->op1, rset_exclude(RSET_GPR, hi));\r\n  int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n  Reg dest = ir->r;\r\n  if (ra_hasreg(dest)) {\r\n    ra_free(as, dest);\r\n    ra_modified(as, dest);\r\n    emit_rmro(as, irt_isnum(ir->t) ? XO_MOVSD : XO_MOVSS, dest, RID_ESP, ofs);\r\n  }\r\n  emit_rmro(as, irt_isnum(ir->t) ? XO_FSTPq : XO_FSTPd,\r\n\t    irt_isnum(ir->t) ? XOg_FSTPq : XOg_FSTPd, RID_ESP, ofs);\r\n  if (((ir-1)->op2 & IRCONV_SRCMASK) == IRT_U64) {\r\n    /* For inputs in [2^63,2^64-1] add 2^64 to compensate. */\r\n    MCLabel l_end = emit_label(as);\r\n    emit_rma(as, XO_FADDq, XOg_FADDq,\r\n\t     lj_ir_k64_find(as->J, U64x(43f00000,00000000)));\r\n    emit_sjcc(as, CC_NS, l_end);\r\n    emit_rr(as, XO_TEST, hi, hi);  /* Check if u64 >= 2^63. */\r\n  } else {\r\n    lua_assert(((ir-1)->op2 & IRCONV_SRCMASK) == IRT_I64);\r\n  }\r\n  emit_rmro(as, XO_FILDq, XOg_FILDq, RID_ESP, 0);\r\n  /* NYI: Avoid narrow-to-wide store-to-load forwarding stall. */\r\n  emit_rmro(as, XO_MOVto, hi, RID_ESP, 4);\r\n  emit_rmro(as, XO_MOVto, lo, RID_ESP, 0);\r\n}\r\n\r\n/* FP to 64 bit integer conversion in 32 bit mode. */\r\nstatic void asm_conv_int64_fp(ASMState *as, IRIns *ir)\r\n{\r\n  IRType st = (IRType)((ir-1)->op2 & IRCONV_SRCMASK);\r\n  IRType dt = (((ir-1)->op2 & IRCONV_DSTMASK) >> IRCONV_DSH);\r\n  Reg lo, hi;\r\n  lua_assert(st == IRT_NUM || st == IRT_FLOAT);\r\n  lua_assert(dt == IRT_I64 || dt == IRT_U64);\r\n  hi = ra_dest(as, ir, RSET_GPR);\r\n  lo = ra_dest(as, ir-1, rset_exclude(RSET_GPR, hi));\r\n  if (ra_used(ir-1)) emit_rmro(as, XO_MOV, lo, RID_ESP, 0);\r\n  /* NYI: Avoid wide-to-narrow store-to-load forwarding stall. */\r\n  if (!(as->flags & JIT_F_SSE3)) {  /* Set FPU rounding mode to default. */\r\n    emit_rmro(as, XO_FLDCW, XOg_FLDCW, RID_ESP, 4);\r\n    emit_rmro(as, XO_MOVto, lo, RID_ESP, 4);\r\n    emit_gri(as, XG_ARITHi(XOg_AND), lo, 0xf3ff);\r\n  }\r\n  if (dt == IRT_U64) {\r\n    /* For inputs in [2^63,2^64-1] add -2^64 and convert again. */\r\n    MCLabel l_pop, l_end = emit_label(as);\r\n    emit_x87op(as, XI_FPOP);\r\n    l_pop = emit_label(as);\r\n    emit_sjmp(as, l_end);\r\n    emit_rmro(as, XO_MOV, hi, RID_ESP, 4);\r\n    if ((as->flags & JIT_F_SSE3))\r\n      emit_rmro(as, XO_FISTTPq, XOg_FISTTPq, RID_ESP, 0);\r\n    else\r\n      emit_rmro(as, XO_FISTPq, XOg_FISTPq, RID_ESP, 0);\r\n    emit_rma(as, XO_FADDq, XOg_FADDq,\r\n\t     lj_ir_k64_find(as->J, U64x(c3f00000,00000000)));\r\n    emit_sjcc(as, CC_NS, l_pop);\r\n    emit_rr(as, XO_TEST, hi, hi);  /* Check if out-of-range (2^63). */\r\n  }\r\n  emit_rmro(as, XO_MOV, hi, RID_ESP, 4);\r\n  if ((as->flags & JIT_F_SSE3)) {  /* Truncation is easy with SSE3. */\r\n    emit_rmro(as, XO_FISTTPq, XOg_FISTTPq, RID_ESP, 0);\r\n  } else {  /* Otherwise set FPU rounding mode to truncate before the store. */\r\n    emit_rmro(as, XO_FISTPq, XOg_FISTPq, RID_ESP, 0);\r\n    emit_rmro(as, XO_FLDCW, XOg_FLDCW, RID_ESP, 0);\r\n    emit_rmro(as, XO_MOVtow, lo, RID_ESP, 0);\r\n    emit_rmro(as, XO_ARITHw(XOg_OR), lo, RID_ESP, 0);\r\n    emit_loadi(as, lo, 0xc00);\r\n    emit_rmro(as, XO_FNSTCW, XOg_FNSTCW, RID_ESP, 0);\r\n  }\r\n  if (dt == IRT_U64)\r\n    emit_x87op(as, XI_FDUP);\r\n  emit_mrm(as, st == IRT_NUM ? XO_FLDq : XO_FLDd,\r\n\t   st == IRT_NUM ? XOg_FLDq: XOg_FLDd,\r\n\t   asm_fuseload(as, ir->op1, RSET_EMPTY));\r\n}\r\n\r\nstatic void asm_conv64(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isfp(ir->t))\r\n    asm_conv_fp_int64(as, ir);\r\n  else\r\n    asm_conv_int64_fp(as, ir);\r\n}\r\n#endif\r\n\r\nstatic void asm_strto(ASMState *as, IRIns *ir)\r\n{\r\n  /* Force a spill slot for the destination register (if any). */\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_strscan_num];\r\n  IRRef args[2];\r\n  RegSet drop = RSET_SCRATCH;\r\n  if ((drop & RSET_FPR) != RSET_FPR && ra_hasreg(ir->r))\r\n    rset_set(drop, ir->r);  /* WIN64 doesn't spill all FPRs. */\r\n  ra_evictset(as, drop);\r\n  asm_guardcc(as, CC_E);\r\n  emit_rr(as, XO_TEST, RID_RET, RID_RET);  /* Test return status. */\r\n  args[0] = ir->op1;      /* GCstr *str */\r\n  args[1] = ASMREF_TMP1;  /* TValue *n  */\r\n  asm_gencall(as, ci, args);\r\n  /* Store the result to the spill slot or temp slots. */\r\n  emit_rmro(as, XO_LEA, ra_releasetmp(as, ASMREF_TMP1)|REX_64,\r\n\t    RID_ESP, sps_scale(ir->s));\r\n}\r\n\r\n/* -- Memory references --------------------------------------------------- */\r\n\r\n/* Get pointer to TValue. */\r\nstatic void asm_tvptr(ASMState *as, Reg dest, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isnum(ir->t)) {\r\n    /* For numbers use the constant itself or a spill slot as a TValue. */\r\n    if (irref_isk(ref))\r\n      emit_loada(as, dest, ir_knum(ir));\r\n    else\r\n      emit_rmro(as, XO_LEA, dest|REX_64, RID_ESP, ra_spill(as, ir));\r\n  } else {\r\n    /* Otherwise use g->tmptv to hold the TValue. */\r\n    if (!irref_isk(ref)) {\r\n      Reg src = ra_alloc1(as, ref, rset_exclude(RSET_GPR, dest));\r\n      emit_movtomro(as, REX_64IR(ir, src), dest, 0);\r\n    } else if (!irt_ispri(ir->t)) {\r\n      emit_movmroi(as, dest, 0, ir->i);\r\n    }\r\n    if (!(LJ_64 && irt_islightud(ir->t)))\r\n      emit_movmroi(as, dest, 4, irt_toitype(ir->t));\r\n    emit_loada(as, dest, &J2G(as->J)->tmptv);\r\n  }\r\n}\r\n\r\nstatic void asm_aref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusearef(as, ir, RSET_GPR);\r\n  if (!(as->mrm.idx == RID_NONE && as->mrm.ofs == 0))\r\n    emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n  else if (as->mrm.base != dest)\r\n    emit_rr(as, XO_MOV, dest, as->mrm.base);\r\n}\r\n\r\n/* Inlined hash lookup. Specialized for key type and for const keys.\r\n** The equivalent C code is:\r\n**   Node *n = hashkey(t, key);\r\n**   do {\r\n**     if (lj_obj_equal(&n->key, key)) return &n->val;\r\n**   } while ((n = nextnode(n)));\r\n**   return niltv(L);\r\n*/\r\nstatic void asm_href(ASMState *as, IRIns *ir, IROp merge)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  int destused = ra_used(ir);\r\n  Reg dest = ra_dest(as, ir, allow);\r\n  Reg tab = ra_alloc1(as, ir->op1, rset_clear(allow, dest));\r\n  Reg key = RID_NONE, tmp = RID_NONE;\r\n  IRIns *irkey = IR(ir->op2);\r\n  int isk = irref_isk(ir->op2);\r\n  IRType1 kt = irkey->t;\r\n  uint32_t khash;\r\n  MCLabel l_end, l_loop, l_next;\r\n\r\n  if (!isk) {\r\n    rset_clear(allow, tab);\r\n    key = ra_alloc1(as, ir->op2, irt_isnum(kt) ? RSET_FPR : allow);\r\n    if (!irt_isstr(kt))\r\n      tmp = ra_scratch(as, rset_exclude(allow, key));\r\n  }\r\n\r\n  /* Key not found in chain: jump to exit (if merged) or load niltv. */\r\n  l_end = emit_label(as);\r\n  if (merge == IR_NE)\r\n    asm_guardcc(as, CC_E);  /* XI_JMP is not found by lj_asm_patchexit. */\r\n  else if (destused)\r\n    emit_loada(as, dest, niltvg(J2G(as->J)));\r\n\r\n  /* Follow hash chain until the end. */\r\n  l_loop = emit_sjcc_label(as, CC_NZ);\r\n  emit_rr(as, XO_TEST, dest, dest);\r\n  emit_rmro(as, XO_MOV, dest, dest, offsetof(Node, next));\r\n  l_next = emit_label(as);\r\n\r\n  /* Type and value comparison. */\r\n  if (merge == IR_EQ)\r\n    asm_guardcc(as, CC_E);\r\n  else\r\n    emit_sjcc(as, CC_E, l_end);\r\n  if (irt_isnum(kt)) {\r\n    if (isk) {\r\n      /* Assumes -0.0 is already canonicalized to +0.0. */\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.u32.lo),\r\n\t\t (int32_t)ir_knum(irkey)->u32.lo);\r\n      emit_sjcc(as, CC_NE, l_next);\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.u32.hi),\r\n\t\t (int32_t)ir_knum(irkey)->u32.hi);\r\n    } else {\r\n      emit_sjcc(as, CC_P, l_next);\r\n      emit_rmro(as, XO_UCOMISD, key, dest, offsetof(Node, key.n));\r\n      emit_sjcc(as, CC_AE, l_next);\r\n      /* The type check avoids NaN penalties and complaints from Valgrind. */\r\n#if LJ_64\r\n      emit_u32(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi, XOg_CMP, dest, offsetof(Node, key.it));\r\n#else\r\n      emit_i8(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi8, XOg_CMP, dest, offsetof(Node, key.it));\r\n#endif\r\n    }\r\n#if LJ_64\r\n  } else if (irt_islightud(kt)) {\r\n    emit_rmro(as, XO_CMP, key|REX_64, dest, offsetof(Node, key.u64));\r\n#endif\r\n  } else {\r\n    if (!irt_ispri(kt)) {\r\n      lua_assert(irt_isaddr(kt));\r\n      if (isk)\r\n\temit_gmroi(as, XG_ARITHi(XOg_CMP), dest, offsetof(Node, key.gcr),\r\n\t\t   ptr2addr(ir_kgc(irkey)));\r\n      else\r\n\temit_rmro(as, XO_CMP, key, dest, offsetof(Node, key.gcr));\r\n      emit_sjcc(as, CC_NE, l_next);\r\n    }\r\n    lua_assert(!irt_isnil(kt));\r\n    emit_i8(as, irt_toitype(kt));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, dest, offsetof(Node, key.it));\r\n  }\r\n  emit_sfixup(as, l_loop);\r\n  checkmclim(as);\r\n\r\n  /* Load main position relative to tab->node into dest. */\r\n  khash = isk ? ir_khash(irkey) : 1;\r\n  if (khash == 0) {\r\n    emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, node));\r\n  } else {\r\n    emit_rmro(as, XO_ARITH(XOg_ADD), dest, tab, offsetof(GCtab, node));\r\n    if ((as->flags & JIT_F_PREFER_IMUL)) {\r\n      emit_i8(as, sizeof(Node));\r\n      emit_rr(as, XO_IMULi8, dest, dest);\r\n    } else {\r\n      emit_shifti(as, XOg_SHL, dest, 3);\r\n      emit_rmrxo(as, XO_LEA, dest, dest, dest, XM_SCALE2, 0);\r\n    }\r\n    if (isk) {\r\n      emit_gri(as, XG_ARITHi(XOg_AND), dest, (int32_t)khash);\r\n      emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, hmask));\r\n    } else if (irt_isstr(kt)) {\r\n      emit_rmro(as, XO_ARITH(XOg_AND), dest, key, offsetof(GCstr, hash));\r\n      emit_rmro(as, XO_MOV, dest, tab, offsetof(GCtab, hmask));\r\n    } else {  /* Must match with hashrot() in lj_tab.c. */\r\n      emit_rmro(as, XO_ARITH(XOg_AND), dest, tab, offsetof(GCtab, hmask));\r\n      emit_rr(as, XO_ARITH(XOg_SUB), dest, tmp);\r\n      emit_shifti(as, XOg_ROL, tmp, HASH_ROT3);\r\n      emit_rr(as, XO_ARITH(XOg_XOR), dest, tmp);\r\n      emit_shifti(as, XOg_ROL, dest, HASH_ROT2);\r\n      emit_rr(as, XO_ARITH(XOg_SUB), tmp, dest);\r\n      emit_shifti(as, XOg_ROL, dest, HASH_ROT1);\r\n      emit_rr(as, XO_ARITH(XOg_XOR), tmp, dest);\r\n      if (irt_isnum(kt)) {\r\n\temit_rr(as, XO_ARITH(XOg_ADD), dest, dest);\r\n#if LJ_64\r\n\temit_shifti(as, XOg_SHR|REX_64, dest, 32);\r\n\temit_rr(as, XO_MOV, tmp, dest);\r\n\temit_rr(as, XO_MOVDto, key|REX_64, dest);\r\n#else\r\n\temit_rmro(as, XO_MOV, dest, RID_ESP, ra_spill(as, irkey)+4);\r\n\temit_rr(as, XO_MOVDto, key, tmp);\r\n#endif\r\n      } else {\r\n\temit_rr(as, XO_MOV, tmp, key);\r\n\temit_rmro(as, XO_LEA, dest, key, HASH_BIAS);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\nstatic void asm_hrefk(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *kslot = IR(ir->op2);\r\n  IRIns *irkey = IR(kslot->op1);\r\n  int32_t ofs = (int32_t)(kslot->op2 * sizeof(Node));\r\n  Reg dest = ra_used(ir) ? ra_dest(as, ir, RSET_GPR) : RID_NONE;\r\n  Reg node = ra_alloc1(as, ir->op1, RSET_GPR);\r\n#if !LJ_64\r\n  MCLabel l_exit;\r\n#endif\r\n  lua_assert(ofs % sizeof(Node) == 0);\r\n  if (ra_hasreg(dest)) {\r\n    if (ofs != 0) {\r\n      if (dest == node && !(as->flags & JIT_F_LEA_AGU))\r\n\temit_gri(as, XG_ARITHi(XOg_ADD), dest, ofs);\r\n      else\r\n\temit_rmro(as, XO_LEA, dest, node, ofs);\r\n    } else if (dest != node) {\r\n      emit_rr(as, XO_MOV, dest, node);\r\n    }\r\n  }\r\n  asm_guardcc(as, CC_NE);\r\n#if LJ_64\r\n  if (!irt_ispri(irkey->t)) {\r\n    Reg key = ra_scratch(as, rset_exclude(RSET_GPR, node));\r\n    emit_rmro(as, XO_CMP, key|REX_64, node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u64));\r\n    lua_assert(irt_isnum(irkey->t) || irt_isgcv(irkey->t));\r\n    /* Assumes -0.0 is already canonicalized to +0.0. */\r\n    emit_loadu64(as, key, irt_isnum(irkey->t) ? ir_knum(irkey)->u64 :\r\n\t\t\t  ((uint64_t)irt_toitype(irkey->t) << 32) |\r\n\t\t\t  (uint64_t)(uint32_t)ptr2addr(ir_kgc(irkey)));\r\n  } else {\r\n    lua_assert(!irt_isnil(irkey->t));\r\n    emit_i8(as, irt_toitype(irkey->t));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, node,\r\n\t      ofs + (int32_t)offsetof(Node, key.it));\r\n  }\r\n#else\r\n  l_exit = emit_label(as);\r\n  if (irt_isnum(irkey->t)) {\r\n    /* Assumes -0.0 is already canonicalized to +0.0. */\r\n    emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u32.lo),\r\n\t       (int32_t)ir_knum(irkey)->u32.lo);\r\n    emit_sjcc(as, CC_NE, l_exit);\r\n    emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t       ofs + (int32_t)offsetof(Node, key.u32.hi),\r\n\t       (int32_t)ir_knum(irkey)->u32.hi);\r\n  } else {\r\n    if (!irt_ispri(irkey->t)) {\r\n      lua_assert(irt_isgcv(irkey->t));\r\n      emit_gmroi(as, XG_ARITHi(XOg_CMP), node,\r\n\t\t ofs + (int32_t)offsetof(Node, key.gcr),\r\n\t\t ptr2addr(ir_kgc(irkey)));\r\n      emit_sjcc(as, CC_NE, l_exit);\r\n    }\r\n    lua_assert(!irt_isnil(irkey->t));\r\n    emit_i8(as, irt_toitype(irkey->t));\r\n    emit_rmro(as, XO_ARITHi8, XOg_CMP, node,\r\n\t      ofs + (int32_t)offsetof(Node, key.it));\r\n  }\r\n#endif\r\n}\r\n\r\nstatic void asm_uref(ASMState *as, IRIns *ir)\r\n{\r\n  /* NYI: Check that UREFO is still open and not aliasing a slot. */\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  if (irref_isk(ir->op1)) {\r\n    GCfunc *fn = ir_kfunc(IR(ir->op1));\r\n    MRef *v = &gcref(fn->l.uvptr[(ir->op2 >> 8)])->uv.v;\r\n    emit_rma(as, XO_MOV, dest, v);\r\n  } else {\r\n    Reg uv = ra_scratch(as, RSET_GPR);\r\n    Reg func = ra_alloc1(as, ir->op1, RSET_GPR);\r\n    if (ir->o == IR_UREFC) {\r\n      emit_rmro(as, XO_LEA, dest, uv, offsetof(GCupval, tv));\r\n      asm_guardcc(as, CC_NE);\r\n      emit_i8(as, 1);\r\n      emit_rmro(as, XO_ARITHib, XOg_CMP, uv, offsetof(GCupval, closed));\r\n    } else {\r\n      emit_rmro(as, XO_MOV, dest, uv, offsetof(GCupval, v));\r\n    }\r\n    emit_rmro(as, XO_MOV, uv, func,\r\n\t      (int32_t)offsetof(GCfuncL, uvptr) + 4*(int32_t)(ir->op2 >> 8));\r\n  }\r\n}\r\n\r\nstatic void asm_fref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusefref(as, ir, RSET_GPR);\r\n  emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n}\r\n\r\nstatic void asm_strref(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  asm_fusestrref(as, ir, RSET_GPR);\r\n  if (as->mrm.base == RID_NONE)\r\n    emit_loadi(as, dest, as->mrm.ofs);\r\n  else if (as->mrm.base == dest && as->mrm.idx == RID_NONE)\r\n    emit_gri(as, XG_ARITHi(XOg_ADD), dest, as->mrm.ofs);\r\n  else\r\n    emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n}\r\n\r\n/* -- Loads and stores ---------------------------------------------------- */\r\n\r\nstatic void asm_fxload(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, irt_isfp(ir->t) ? RSET_FPR : RSET_GPR);\r\n  x86Op xo;\r\n  if (ir->o == IR_FLOAD)\r\n    asm_fusefref(as, ir, RSET_GPR);\r\n  else\r\n    asm_fusexref(as, ir->op1, RSET_GPR);\r\n  /* ir->op2 is ignored -- unaligned loads are ok on x86. */\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_I8: xo = XO_MOVSXb; break;\r\n  case IRT_U8: xo = XO_MOVZXb; break;\r\n  case IRT_I16: xo = XO_MOVSXw; break;\r\n  case IRT_U16: xo = XO_MOVZXw; break;\r\n  case IRT_NUM: xo = XO_MOVSD; break;\r\n  case IRT_FLOAT: xo = XO_MOVSS; break;\r\n  default:\r\n    if (LJ_64 && irt_is64(ir->t))\r\n      dest |= REX_64;\r\n    else\r\n      lua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n    xo = XO_MOV;\r\n    break;\r\n  }\r\n  emit_mrm(as, xo, dest, RID_MRM);\r\n}\r\n\r\n#define asm_fload(as, ir)\tasm_fxload(as, ir)\r\n#define asm_xload(as, ir)\tasm_fxload(as, ir)\r\n\r\nstatic void asm_fxstore(ASMState *as, IRIns *ir)\r\n{\r\n  RegSet allow = RSET_GPR;\r\n  Reg src = RID_NONE, osrc = RID_NONE;\r\n  int32_t k = 0;\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  /* The IRT_I16/IRT_U16 stores should never be simplified for constant\r\n  ** values since mov word [mem], imm16 has a length-changing prefix.\r\n  */\r\n  if (irt_isi16(ir->t) || irt_isu16(ir->t) || irt_isfp(ir->t) ||\r\n      !asm_isk32(as, ir->op2, &k)) {\r\n    RegSet allow8 = irt_isfp(ir->t) ? RSET_FPR :\r\n\t\t    (irt_isi8(ir->t) || irt_isu8(ir->t)) ? RSET_GPR8 : RSET_GPR;\r\n    src = osrc = ra_alloc1(as, ir->op2, allow8);\r\n    if (!LJ_64 && !rset_test(allow8, src)) {  /* Already in wrong register. */\r\n      rset_clear(allow, osrc);\r\n      src = ra_scratch(as, allow8);\r\n    }\r\n    rset_clear(allow, src);\r\n  }\r\n  if (ir->o == IR_FSTORE) {\r\n    asm_fusefref(as, IR(ir->op1), allow);\r\n  } else {\r\n    asm_fusexref(as, ir->op1, allow);\r\n    if (LJ_32 && ir->o == IR_HIOP) as->mrm.ofs += 4;\r\n  }\r\n  if (ra_hasreg(src)) {\r\n    x86Op xo;\r\n    switch (irt_type(ir->t)) {\r\n    case IRT_I8: case IRT_U8: xo = XO_MOVtob; src |= FORCE_REX; break;\r\n    case IRT_I16: case IRT_U16: xo = XO_MOVtow; break;\r\n    case IRT_NUM: xo = XO_MOVSDto; break;\r\n    case IRT_FLOAT: xo = XO_MOVSSto; break;\r\n#if LJ_64\r\n    case IRT_LIGHTUD: lua_assert(0);  /* NYI: mask 64 bit lightuserdata. */\r\n#endif\r\n    default:\r\n      if (LJ_64 && irt_is64(ir->t))\r\n\tsrc |= REX_64;\r\n      else\r\n\tlua_assert(irt_isint(ir->t) || irt_isu32(ir->t) || irt_isaddr(ir->t));\r\n      xo = XO_MOVto;\r\n      break;\r\n    }\r\n    emit_mrm(as, xo, src, RID_MRM);\r\n    if (!LJ_64 && src != osrc) {\r\n      ra_noweak(as, osrc);\r\n      emit_rr(as, XO_MOV, src, osrc);\r\n    }\r\n  } else {\r\n    if (irt_isi8(ir->t) || irt_isu8(ir->t)) {\r\n      emit_i8(as, k);\r\n      emit_mrm(as, XO_MOVmib, 0, RID_MRM);\r\n    } else {\r\n      lua_assert(irt_is64(ir->t) || irt_isint(ir->t) || irt_isu32(ir->t) ||\r\n\t\t irt_isaddr(ir->t));\r\n      emit_i32(as, k);\r\n      emit_mrm(as, XO_MOVmi, REX_64IR(ir, 0), RID_MRM);\r\n    }\r\n  }\r\n}\r\n\r\n#define asm_fstore(as, ir)\tasm_fxstore(as, ir)\r\n#define asm_xstore(as, ir)\tasm_fxstore(as, ir)\r\n\r\n#if LJ_64\r\nstatic Reg asm_load_lightud64(ASMState *as, IRIns *ir, int typecheck)\r\n{\r\n  if (ra_used(ir) || typecheck) {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    if (typecheck) {\r\n      Reg tmp = ra_scratch(as, rset_exclude(RSET_GPR, dest));\r\n      asm_guardcc(as, CC_NE);\r\n      emit_i8(as, -2);\r\n      emit_rr(as, XO_ARITHi8, XOg_CMP, tmp);\r\n      emit_shifti(as, XOg_SAR|REX_64, tmp, 47);\r\n      emit_rr(as, XO_MOV, tmp|REX_64, dest);\r\n    }\r\n    return dest;\r\n  } else {\r\n    return RID_NONE;\r\n  }\r\n}\r\n#endif\r\n\r\nstatic void asm_ahuvload(ASMState *as, IRIns *ir)\r\n{\r\n  lua_assert(irt_isnum(ir->t) || irt_ispri(ir->t) || irt_isaddr(ir->t) ||\r\n\t     (LJ_DUALNUM && irt_isint(ir->t)));\r\n#if LJ_64\r\n  if (irt_islightud(ir->t)) {\r\n    Reg dest = asm_load_lightud64(as, ir, 1);\r\n    if (ra_hasreg(dest)) {\r\n      asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n      emit_mrm(as, XO_MOV, dest|REX_64, RID_MRM);\r\n    }\r\n    return;\r\n  } else\r\n#endif\r\n  if (ra_used(ir)) {\r\n    RegSet allow = irt_isnum(ir->t) ? RSET_FPR : RSET_GPR;\r\n    Reg dest = ra_dest(as, ir, allow);\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n    emit_mrm(as, dest < RID_MAX_GPR ? XO_MOV : XO_MOVSD, dest, RID_MRM);\r\n  } else {\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n  }\r\n  /* Always do the type check, even if the load result is unused. */\r\n  as->mrm.ofs += 4;\r\n  asm_guardcc(as, irt_isnum(ir->t) ? CC_AE : CC_NE);\r\n  if (LJ_64 && irt_type(ir->t) >= IRT_NUM) {\r\n    lua_assert(irt_isinteger(ir->t) || irt_isnum(ir->t));\r\n    emit_u32(as, LJ_TISNUM);\r\n    emit_mrm(as, XO_ARITHi, XOg_CMP, RID_MRM);\r\n  } else {\r\n    emit_i8(as, irt_toitype(ir->t));\r\n    emit_mrm(as, XO_ARITHi8, XOg_CMP, RID_MRM);\r\n  }\r\n}\r\n\r\nstatic void asm_ahustore(ASMState *as, IRIns *ir)\r\n{\r\n  if (ir->r == RID_SINK)\r\n    return;\r\n  if (irt_isnum(ir->t)) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_FPR);\r\n    asm_fuseahuref(as, ir->op1, RSET_GPR);\r\n    emit_mrm(as, XO_MOVSDto, src, RID_MRM);\r\n#if LJ_64\r\n  } else if (irt_islightud(ir->t)) {\r\n    Reg src = ra_alloc1(as, ir->op2, RSET_GPR);\r\n    asm_fuseahuref(as, ir->op1, rset_exclude(RSET_GPR, src));\r\n    emit_mrm(as, XO_MOVto, src|REX_64, RID_MRM);\r\n#endif\r\n  } else {\r\n    IRIns *irr = IR(ir->op2);\r\n    RegSet allow = RSET_GPR;\r\n    Reg src = RID_NONE;\r\n    if (!irref_isk(ir->op2)) {\r\n      src = ra_alloc1(as, ir->op2, allow);\r\n      rset_clear(allow, src);\r\n    }\r\n    asm_fuseahuref(as, ir->op1, allow);\r\n    if (ra_hasreg(src)) {\r\n      emit_mrm(as, XO_MOVto, src, RID_MRM);\r\n    } else if (!irt_ispri(irr->t)) {\r\n      lua_assert(irt_isaddr(ir->t) || (LJ_DUALNUM && irt_isinteger(ir->t)));\r\n      emit_i32(as, irr->i);\r\n      emit_mrm(as, XO_MOVmi, 0, RID_MRM);\r\n    }\r\n    as->mrm.ofs += 4;\r\n    emit_i32(as, (int32_t)irt_toitype(ir->t));\r\n    emit_mrm(as, XO_MOVmi, 0, RID_MRM);\r\n  }\r\n}\r\n\r\nstatic void asm_sload(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = 8*((int32_t)ir->op1-1) + ((ir->op2 & IRSLOAD_FRAME) ? 4 : 0);\r\n  IRType1 t = ir->t;\r\n  Reg base;\r\n  lua_assert(!(ir->op2 & IRSLOAD_PARENT));  /* Handled by asm_head_side(). */\r\n  lua_assert(irt_isguard(t) || !(ir->op2 & IRSLOAD_TYPECHECK));\r\n  lua_assert(LJ_DUALNUM ||\r\n\t     !irt_isint(t) || (ir->op2 & (IRSLOAD_CONVERT|IRSLOAD_FRAME)));\r\n  if ((ir->op2 & IRSLOAD_CONVERT) && irt_isguard(t) && irt_isint(t)) {\r\n    Reg left = ra_scratch(as, RSET_FPR);\r\n    asm_tointg(as, ir, left);  /* Frees dest reg. Do this before base alloc. */\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n    emit_rmro(as, XO_MOVSD, left, base, ofs);\r\n    t.irt = IRT_NUM;  /* Continue with a regular number type check. */\r\n#if LJ_64\r\n  } else if (irt_islightud(t)) {\r\n    Reg dest = asm_load_lightud64(as, ir, (ir->op2 & IRSLOAD_TYPECHECK));\r\n    if (ra_hasreg(dest)) {\r\n      base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n      emit_rmro(as, XO_MOV, dest|REX_64, base, ofs);\r\n    }\r\n    return;\r\n#endif\r\n  } else if (ra_used(ir)) {\r\n    RegSet allow = irt_isnum(t) ? RSET_FPR : RSET_GPR;\r\n    Reg dest = ra_dest(as, ir, allow);\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n    lua_assert(irt_isnum(t) || irt_isint(t) || irt_isaddr(t));\r\n    if ((ir->op2 & IRSLOAD_CONVERT)) {\r\n      t.irt = irt_isint(t) ? IRT_NUM : IRT_INT;  /* Check for original type. */\r\n      emit_rmro(as, irt_isint(t) ? XO_CVTSI2SD : XO_CVTTSD2SI, dest, base, ofs);\r\n    } else {\r\n      emit_rmro(as, irt_isnum(t) ? XO_MOVSD : XO_MOV, dest, base, ofs);\r\n    }\r\n  } else {\r\n    if (!(ir->op2 & IRSLOAD_TYPECHECK))\r\n      return;  /* No type check: avoid base alloc. */\r\n    base = ra_alloc1(as, REF_BASE, RSET_GPR);\r\n  }\r\n  if ((ir->op2 & IRSLOAD_TYPECHECK)) {\r\n    /* Need type check, even if the load result is unused. */\r\n    asm_guardcc(as, irt_isnum(t) ? CC_AE : CC_NE);\r\n    if (LJ_64 && irt_type(t) >= IRT_NUM) {\r\n      lua_assert(irt_isinteger(t) || irt_isnum(t));\r\n      emit_u32(as, LJ_TISNUM);\r\n      emit_rmro(as, XO_ARITHi, XOg_CMP, base, ofs+4);\r\n    } else {\r\n      emit_i8(as, irt_toitype(t));\r\n      emit_rmro(as, XO_ARITHi8, XOg_CMP, base, ofs+4);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Allocations --------------------------------------------------------- */\r\n\r\n#if LJ_HASFFI\r\nstatic void asm_cnew(ASMState *as, IRIns *ir)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(as->J));\r\n  CTypeID id = (CTypeID)IR(ir->op1)->i;\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_mem_newgco];\r\n  IRRef args[4];\r\n  lua_assert(sz != CTSIZE_INVALID || (ir->o == IR_CNEW && ir->op2 != REF_NIL));\r\n\r\n  as->gcsteps++;\r\n  asm_setupresult(as, ir, ci);  /* GCcdata * */\r\n\r\n  /* Initialize immutable cdata object. */\r\n  if (ir->o == IR_CNEWI) {\r\n    RegSet allow = (RSET_GPR & ~RSET_SCRATCH);\r\n#if LJ_64\r\n    Reg r64 = sz == 8 ? REX_64 : 0;\r\n    if (irref_isk(ir->op2)) {\r\n      IRIns *irk = IR(ir->op2);\r\n      uint64_t k = irk->o == IR_KINT64 ? ir_k64(irk)->u64 :\r\n\t\t\t\t\t (uint64_t)(uint32_t)irk->i;\r\n      if (sz == 4 || checki32((int64_t)k)) {\r\n\temit_i32(as, (int32_t)k);\r\n\temit_rmro(as, XO_MOVmi, r64, RID_RET, sizeof(GCcdata));\r\n      } else {\r\n\temit_movtomro(as, RID_ECX + r64, RID_RET, sizeof(GCcdata));\r\n\temit_loadu64(as, RID_ECX, k);\r\n      }\r\n    } else {\r\n      Reg r = ra_alloc1(as, ir->op2, allow);\r\n      emit_movtomro(as, r + r64, RID_RET, sizeof(GCcdata));\r\n    }\r\n#else\r\n    int32_t ofs = sizeof(GCcdata);\r\n    if (sz == 8) {\r\n      ofs += 4; ir++;\r\n      lua_assert(ir->o == IR_HIOP);\r\n    }\r\n    do {\r\n      if (irref_isk(ir->op2)) {\r\n\temit_movmroi(as, RID_RET, ofs, IR(ir->op2)->i);\r\n      } else {\r\n\tReg r = ra_alloc1(as, ir->op2, allow);\r\n\temit_movtomro(as, r, RID_RET, ofs);\r\n\trset_clear(allow, r);\r\n      }\r\n      if (ofs == sizeof(GCcdata)) break;\r\n      ofs -= 4; ir--;\r\n    } while (1);\r\n#endif\r\n    lua_assert(sz == 4 || sz == 8);\r\n  } else if (ir->op2 != REF_NIL) {  /* Create VLA/VLS/aligned cdata. */\r\n    ci = &lj_ir_callinfo[IRCALL_lj_cdata_newv];\r\n    args[0] = ASMREF_L;     /* lua_State *L */\r\n    args[1] = ir->op1;      /* CTypeID id   */\r\n    args[2] = ir->op2;      /* CTSize sz    */\r\n    args[3] = ASMREF_TMP1;  /* CTSize align */\r\n    asm_gencall(as, ci, args);\r\n    emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)ctype_align(info));\r\n    return;\r\n  }\r\n\r\n  /* Combine initialization of marked, gct and ctypeid. */\r\n  emit_movtomro(as, RID_ECX, RID_RET, offsetof(GCcdata, marked));\r\n  emit_gri(as, XG_ARITHi(XOg_OR), RID_ECX,\r\n\t   (int32_t)((~LJ_TCDATA<<8)+(id<<16)));\r\n  emit_gri(as, XG_ARITHi(XOg_AND), RID_ECX, LJ_GC_WHITES);\r\n  emit_opgl(as, XO_MOVZXb, RID_ECX, gc.currentwhite);\r\n\r\n  args[0] = ASMREF_L;     /* lua_State *L */\r\n  args[1] = ASMREF_TMP1;  /* MSize size   */\r\n  asm_gencall(as, ci, args);\r\n  emit_loadi(as, ra_releasetmp(as, ASMREF_TMP1), (int32_t)(sz+sizeof(GCcdata)));\r\n}\r\n#else\r\n#define asm_cnew(as, ir)\t((void)0)\r\n#endif\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\nstatic void asm_tbar(ASMState *as, IRIns *ir)\r\n{\r\n  Reg tab = ra_alloc1(as, ir->op1, RSET_GPR);\r\n  Reg tmp = ra_scratch(as, rset_exclude(RSET_GPR, tab));\r\n  MCLabel l_end = emit_label(as);\r\n  emit_movtomro(as, tmp, tab, offsetof(GCtab, gclist));\r\n  emit_setgl(as, tab, gc.grayagain);\r\n  emit_getgl(as, tmp, gc.grayagain);\r\n  emit_i8(as, ~LJ_GC_BLACK);\r\n  emit_rmro(as, XO_ARITHib, XOg_AND, tab, offsetof(GCtab, marked));\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_BLACK);\r\n  emit_rmro(as, XO_GROUP3b, XOg_TEST, tab, offsetof(GCtab, marked));\r\n}\r\n\r\nstatic void asm_obar(ASMState *as, IRIns *ir)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_barrieruv];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg obj;\r\n  /* No need for other object barriers (yet). */\r\n  lua_assert(IR(ir->op1)->o == IR_UREFC);\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ir->op1;      /* TValue *tv      */\r\n  asm_gencall(as, ci, args);\r\n  emit_loada(as, ra_releasetmp(as, ASMREF_TMP1), J2G(as->J));\r\n  obj = IR(ir->op1)->r;\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_WHITES);\r\n  if (irref_isk(ir->op2)) {\r\n    GCobj *vp = ir_kgc(IR(ir->op2));\r\n    emit_rma(as, XO_GROUP3b, XOg_TEST, &vp->gch.marked);\r\n  } else {\r\n    Reg val = ra_alloc1(as, ir->op2, rset_exclude(RSET_SCRATCH&RSET_GPR, obj));\r\n    emit_rmro(as, XO_GROUP3b, XOg_TEST, val, (int32_t)offsetof(GChead, marked));\r\n  }\r\n  emit_sjcc(as, CC_Z, l_end);\r\n  emit_i8(as, LJ_GC_BLACK);\r\n  emit_rmro(as, XO_GROUP3b, XOg_TEST, obj,\r\n\t    (int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv));\r\n}\r\n\r\n/* -- FP/int arithmetic and logic operations ------------------------------ */\r\n\r\n/* Load reference onto x87 stack. Force a spill to memory if needed. */\r\nstatic void asm_x87load(ASMState *as, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_KNUM) {\r\n    cTValue *tv = ir_knum(ir);\r\n    if (tvispzero(tv))  /* Use fldz only for +0. */\r\n      emit_x87op(as, XI_FLDZ);\r\n    else if (tvispone(tv))\r\n      emit_x87op(as, XI_FLD1);\r\n    else\r\n      emit_rma(as, XO_FLDq, XOg_FLDq, tv);\r\n  } else if (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT && !ra_used(ir) &&\r\n\t     !irref_isk(ir->op1) && mayfuse(as, ir->op1)) {\r\n    IRIns *iri = IR(ir->op1);\r\n    emit_rmro(as, XO_FILDd, XOg_FILDd, RID_ESP, ra_spill(as, iri));\r\n  } else {\r\n    emit_mrm(as, XO_FLDq, XOg_FLDq, asm_fuseload(as, ref, RSET_EMPTY));\r\n  }\r\n}\r\n\r\nstatic void asm_fpmath(ASMState *as, IRIns *ir)\r\n{\r\n  IRFPMathOp fpm = (IRFPMathOp)ir->op2;\r\n  if (fpm == IRFPM_SQRT) {\r\n    Reg dest = ra_dest(as, ir, RSET_FPR);\r\n    Reg left = asm_fuseload(as, ir->op1, RSET_FPR);\r\n    emit_mrm(as, XO_SQRTSD, dest, left);\r\n  } else if (fpm <= IRFPM_TRUNC) {\r\n    if (as->flags & JIT_F_SSE4_1) {  /* SSE4.1 has a rounding instruction. */\r\n      Reg dest = ra_dest(as, ir, RSET_FPR);\r\n      Reg left = asm_fuseload(as, ir->op1, RSET_FPR);\r\n      /* ROUNDSD has a 4-byte opcode which doesn't fit in x86Op.\r\n      ** Let's pretend it's a 3-byte opcode, and compensate afterwards.\r\n      ** This is atrocious, but the alternatives are much worse.\r\n      */\r\n      /* Round down/up/trunc == 1001/1010/1011. */\r\n      emit_i8(as, 0x09 + fpm);\r\n      emit_mrm(as, XO_ROUNDSD, dest, left);\r\n      if (LJ_64 && as->mcp[1] != (MCode)(XO_ROUNDSD >> 16)) {\r\n\tas->mcp[0] = as->mcp[1]; as->mcp[1] = 0x0f;  /* Swap 0F and REX. */\r\n      }\r\n      *--as->mcp = 0x66;  /* 1st byte of ROUNDSD opcode. */\r\n    } else {  /* Call helper functions for SSE2 variant. */\r\n      /* The modified regs must match with the *.dasc implementation. */\r\n      RegSet drop = RSET_RANGE(RID_XMM0, RID_XMM3+1)|RID2RSET(RID_EAX);\r\n      if (ra_hasreg(ir->r))\r\n\trset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n      ra_evictset(as, drop);\r\n      ra_destreg(as, ir, RID_XMM0);\r\n      emit_call(as, fpm == IRFPM_FLOOR ? lj_vm_floor_sse :\r\n\t\t    fpm == IRFPM_CEIL ? lj_vm_ceil_sse : lj_vm_trunc_sse);\r\n      ra_left(as, RID_XMM0, ir->op1);\r\n    }\r\n  } else if (fpm == IRFPM_EXP2 && asm_fpjoin_pow(as, ir)) {\r\n    /* Rejoined to pow(). */\r\n  } else {\r\n    asm_callid(as, ir, IRCALL_lj_vm_floor + fpm);\r\n  }\r\n}\r\n\r\n#define asm_atan2(as, ir)\tasm_callid(as, ir, IRCALL_atan2)\r\n\r\nstatic void asm_ldexp(ASMState *as, IRIns *ir)\r\n{\r\n  int32_t ofs = sps_scale(ir->s);  /* Use spill slot or temp slots. */\r\n  Reg dest = ir->r;\r\n  if (ra_hasreg(dest)) {\r\n    ra_free(as, dest);\r\n    ra_modified(as, dest);\r\n    emit_rmro(as, XO_MOVSD, dest, RID_ESP, ofs);\r\n  }\r\n  emit_rmro(as, XO_FSTPq, XOg_FSTPq, RID_ESP, ofs);\r\n  emit_x87op(as, XI_FPOP1);\r\n  emit_x87op(as, XI_FSCALE);\r\n  asm_x87load(as, ir->op1);\r\n  asm_x87load(as, ir->op2);\r\n}\r\n\r\nstatic void asm_fppowi(ASMState *as, IRIns *ir)\r\n{\r\n  /* The modified regs must match with the *.dasc implementation. */\r\n  RegSet drop = RSET_RANGE(RID_XMM0, RID_XMM1+1)|RID2RSET(RID_EAX);\r\n  if (ra_hasreg(ir->r))\r\n    rset_clear(drop, ir->r);  /* Dest reg handled below. */\r\n  ra_evictset(as, drop);\r\n  ra_destreg(as, ir, RID_XMM0);\r\n  emit_call(as, lj_vm_powi_sse);\r\n  ra_left(as, RID_XMM0, ir->op1);\r\n  ra_left(as, RID_EAX, ir->op2);\r\n}\r\n\r\nstatic void asm_pow(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_64 && LJ_HASFFI\r\n  if (!irt_isnum(ir->t))\r\n    asm_callid(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_powi64 :\r\n\t\t\t\t\t  IRCALL_lj_carith_powu64);\r\n  else\r\n#endif\r\n    asm_fppowi(as, ir);\r\n}\r\n\r\nstatic int asm_swapops(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  lua_assert(ra_noreg(irr->r));\r\n  if (!irm_iscomm(lj_ir_mode[ir->o]))\r\n    return 0;  /* Can't swap non-commutative operations. */\r\n  if (irref_isk(ir->op2))\r\n    return 0;  /* Don't swap constants to the left. */\r\n  if (ra_hasreg(irl->r))\r\n    return 1;  /* Swap if left already has a register. */\r\n  if (ra_samehint(ir->r, irr->r))\r\n    return 1;  /* Swap if dest and right have matching hints. */\r\n  if (as->curins > as->loopref) {  /* In variant part? */\r\n    if (ir->op2 < as->loopref && !irt_isphi(irr->t))\r\n      return 0;  /* Keep invariants on the right. */\r\n    if (ir->op1 < as->loopref && !irt_isphi(irl->t))\r\n      return 1;  /* Swap invariants to the right. */\r\n  }\r\n  if (opisfusableload(irl->o))\r\n    return 1;  /* Swap fusable loads to the right. */\r\n  return 0;  /* Otherwise don't swap. */\r\n}\r\n\r\nstatic void asm_fparith(ASMState *as, IRIns *ir, x86Op xo)\r\n{\r\n  IRRef lref = ir->op1;\r\n  IRRef rref = ir->op2;\r\n  RegSet allow = RSET_FPR;\r\n  Reg dest;\r\n  Reg right = IR(rref)->r;\r\n  if (ra_hasreg(right)) {\r\n    rset_clear(allow, right);\r\n    ra_noweak(as, right);\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  if (lref == rref) {\r\n    right = dest;\r\n  } else if (ra_noreg(right)) {\r\n    if (asm_swapops(as, ir)) {\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n    }\r\n    right = asm_fuseload(as, rref, rset_clear(allow, dest));\r\n  }\r\n  emit_mrm(as, xo, dest, right);\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\nstatic void asm_intarith(ASMState *as, IRIns *ir, x86Arith xa)\r\n{\r\n  IRRef lref = ir->op1;\r\n  IRRef rref = ir->op2;\r\n  RegSet allow = RSET_GPR;\r\n  Reg dest, right;\r\n  int32_t k = 0;\r\n  if (as->flagmcp == as->mcp) {  /* Drop test r,r instruction. */\r\n    MCode *p = as->mcp + ((LJ_64 && *as->mcp < XI_TESTb) ? 3 : 2);\r\n    if ((p[1] & 15) < 14) {\r\n      if ((p[1] & 15) >= 12) p[1] -= 4;  /* L <->S, NL <-> NS */\r\n      as->flagmcp = NULL;\r\n      as->mcp = p;\r\n    }  /* else: cannot transform LE/NLE to cc without use of OF. */\r\n  }\r\n  right = IR(rref)->r;\r\n  if (ra_hasreg(right)) {\r\n    rset_clear(allow, right);\r\n    ra_noweak(as, right);\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  if (lref == rref) {\r\n    right = dest;\r\n  } else if (ra_noreg(right) && !asm_isk32(as, rref, &k)) {\r\n    if (asm_swapops(as, ir)) {\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n    }\r\n    right = asm_fuseloadm(as, rref, rset_clear(allow, dest), irt_is64(ir->t));\r\n  }\r\n  if (irt_isguard(ir->t))  /* For IR_ADDOV etc. */\r\n    asm_guardcc(as, CC_O);\r\n  if (xa != XOg_X_IMUL) {\r\n    if (ra_hasreg(right))\r\n      emit_mrm(as, XO_ARITH(xa), REX_64IR(ir, dest), right);\r\n    else\r\n      emit_gri(as, XG_ARITHi(xa), REX_64IR(ir, dest), k);\r\n  } else if (ra_hasreg(right)) {  /* IMUL r, mrm. */\r\n    emit_mrm(as, XO_IMUL, REX_64IR(ir, dest), right);\r\n  } else {  /* IMUL r, r, k. */\r\n    /* NYI: use lea/shl/add/sub (FOLD only does 2^k) depending on CPU. */\r\n    Reg left = asm_fuseloadm(as, lref, RSET_GPR, irt_is64(ir->t));\r\n    x86Op xo;\r\n    if (checki8(k)) { emit_i8(as, k); xo = XO_IMULi8;\r\n    } else { emit_i32(as, k); xo = XO_IMULi; }\r\n    emit_mrm(as, xo, REX_64IR(ir, dest), left);\r\n    return;\r\n  }\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\n/* LEA is really a 4-operand ADD with an independent destination register,\r\n** up to two source registers and an immediate. One register can be scaled\r\n** by 1, 2, 4 or 8. This can be used to avoid moves or to fuse several\r\n** instructions.\r\n**\r\n** Currently only a few common cases are supported:\r\n** - 3-operand ADD:    y = a+b; y = a+k   with a and b already allocated\r\n** - Left ADD fusion:  y = (a+b)+k; y = (a+k)+b\r\n** - Right ADD fusion: y = a+(b+k)\r\n** The ommited variants have already been reduced by FOLD.\r\n**\r\n** There are more fusion opportunities, like gathering shifts or joining\r\n** common references. But these are probably not worth the trouble, since\r\n** array indexing is not decomposed and already makes use of all fields\r\n** of the ModRM operand.\r\n*/\r\nstatic int asm_lea(ASMState *as, IRIns *ir)\r\n{\r\n  IRIns *irl = IR(ir->op1);\r\n  IRIns *irr = IR(ir->op2);\r\n  RegSet allow = RSET_GPR;\r\n  Reg dest;\r\n  as->mrm.base = as->mrm.idx = RID_NONE;\r\n  as->mrm.scale = XM_SCALE1;\r\n  as->mrm.ofs = 0;\r\n  if (ra_hasreg(irl->r)) {\r\n    rset_clear(allow, irl->r);\r\n    ra_noweak(as, irl->r);\r\n    as->mrm.base = irl->r;\r\n    if (irref_isk(ir->op2) || ra_hasreg(irr->r)) {\r\n      /* The PHI renaming logic does a better job in some cases. */\r\n      if (ra_hasreg(ir->r) &&\r\n\t  ((irt_isphi(irl->t) && as->phireg[ir->r] == ir->op1) ||\r\n\t   (irt_isphi(irr->t) && as->phireg[ir->r] == ir->op2)))\r\n\treturn 0;\r\n      if (irref_isk(ir->op2)) {\r\n\tas->mrm.ofs = irr->i;\r\n      } else {\r\n\trset_clear(allow, irr->r);\r\n\tra_noweak(as, irr->r);\r\n\tas->mrm.idx = irr->r;\r\n      }\r\n    } else if (irr->o == IR_ADD && mayfuse(as, ir->op2) &&\r\n\t       irref_isk(irr->op2)) {\r\n      Reg idx = ra_alloc1(as, irr->op1, allow);\r\n      rset_clear(allow, idx);\r\n      as->mrm.idx = (uint8_t)idx;\r\n      as->mrm.ofs = IR(irr->op2)->i;\r\n    } else {\r\n      return 0;\r\n    }\r\n  } else if (ir->op1 != ir->op2 && irl->o == IR_ADD && mayfuse(as, ir->op1) &&\r\n\t     (irref_isk(ir->op2) || irref_isk(irl->op2))) {\r\n    Reg idx, base = ra_alloc1(as, irl->op1, allow);\r\n    rset_clear(allow, base);\r\n    as->mrm.base = (uint8_t)base;\r\n    if (irref_isk(ir->op2)) {\r\n      as->mrm.ofs = irr->i;\r\n      idx = ra_alloc1(as, irl->op2, allow);\r\n    } else {\r\n      as->mrm.ofs = IR(irl->op2)->i;\r\n      idx = ra_alloc1(as, ir->op2, allow);\r\n    }\r\n    rset_clear(allow, idx);\r\n    as->mrm.idx = (uint8_t)idx;\r\n  } else {\r\n    return 0;\r\n  }\r\n  dest = ra_dest(as, ir, allow);\r\n  emit_mrm(as, XO_LEA, dest, RID_MRM);\r\n  return 1;  /* Success. */\r\n}\r\n\r\nstatic void asm_add(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_ADDSD);\r\n  else if ((as->flags & JIT_F_LEA_AGU) || as->flagmcp == as->mcp ||\r\n\t   irt_is64(ir->t) || !asm_lea(as, ir))\r\n    asm_intarith(as, ir, XOg_ADD);\r\n}\r\n\r\nstatic void asm_sub(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_SUBSD);\r\n  else  /* Note: no need for LEA trick here. i-k is encoded as i+(-k). */\r\n    asm_intarith(as, ir, XOg_SUB);\r\n}\r\n\r\nstatic void asm_mul(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_MULSD);\r\n  else\r\n    asm_intarith(as, ir, XOg_X_IMUL);\r\n}\r\n\r\nstatic void asm_div(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_64 && LJ_HASFFI\r\n  if (!irt_isnum(ir->t))\r\n    asm_callid(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_divi64 :\r\n\t\t\t\t\t  IRCALL_lj_carith_divu64);\r\n  else\r\n#endif\r\n    asm_fparith(as, ir, XO_DIVSD);\r\n}\r\n\r\nstatic void asm_mod(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_64 && LJ_HASFFI\r\n  if (!irt_isint(ir->t))\r\n    asm_callid(as, ir, irt_isi64(ir->t) ? IRCALL_lj_carith_modi64 :\r\n\t\t\t\t\t  IRCALL_lj_carith_modu64);\r\n  else\r\n#endif\r\n    asm_callid(as, ir, IRCALL_lj_vm_modi);\r\n}\r\n\r\nstatic void asm_neg_not(ASMState *as, IRIns *ir, x86Group3 xg)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  emit_rr(as, XO_GROUP3, REX_64IR(ir, xg), dest);\r\n  ra_left(as, dest, ir->op1);\r\n}\r\n\r\nstatic void asm_neg(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_XORPS);\r\n  else\r\n    asm_neg_not(as, ir, XOg_NEG);\r\n}\r\n\r\n#define asm_abs(as, ir)\t\tasm_fparith(as, ir, XO_ANDPS)\r\n\r\nstatic void asm_intmin_max(ASMState *as, IRIns *ir, int cc)\r\n{\r\n  Reg right, dest = ra_dest(as, ir, RSET_GPR);\r\n  IRRef lref = ir->op1, rref = ir->op2;\r\n  if (irref_isk(rref)) { lref = rref; rref = ir->op1; }\r\n  right = ra_alloc1(as, rref, rset_exclude(RSET_GPR, dest));\r\n  emit_rr(as, XO_CMOV + (cc<<24), REX_64IR(ir, dest), right);\r\n  emit_rr(as, XO_CMP, REX_64IR(ir, dest), right);\r\n  ra_left(as, dest, lref);\r\n}\r\n\r\nstatic void asm_min(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_MINSD);\r\n  else\r\n    asm_intmin_max(as, ir, CC_G);\r\n}\r\n\r\nstatic void asm_max(ASMState *as, IRIns *ir)\r\n{\r\n  if (irt_isnum(ir->t))\r\n    asm_fparith(as, ir, XO_MAXSD);\r\n  else\r\n    asm_intmin_max(as, ir, CC_L);\r\n}\r\n\r\n/* Note: don't use LEA for overflow-checking arithmetic! */\r\n#define asm_addov(as, ir)\tasm_intarith(as, ir, XOg_ADD)\r\n#define asm_subov(as, ir)\tasm_intarith(as, ir, XOg_SUB)\r\n#define asm_mulov(as, ir)\tasm_intarith(as, ir, XOg_X_IMUL)\r\n\r\n#define asm_bnot(as, ir)\tasm_neg_not(as, ir, XOg_NOT)\r\n\r\nstatic void asm_bswap(ASMState *as, IRIns *ir)\r\n{\r\n  Reg dest = ra_dest(as, ir, RSET_GPR);\r\n  as->mcp = emit_op(XO_BSWAP + ((dest&7) << 24),\r\n\t\t    REX_64IR(ir, 0), dest, 0, as->mcp, 1);\r\n  ra_left(as, dest, ir->op1);\r\n}\r\n\r\n#define asm_band(as, ir)\tasm_intarith(as, ir, XOg_AND)\r\n#define asm_bor(as, ir)\t\tasm_intarith(as, ir, XOg_OR)\r\n#define asm_bxor(as, ir)\tasm_intarith(as, ir, XOg_XOR)\r\n\r\nstatic void asm_bitshift(ASMState *as, IRIns *ir, x86Shift xs)\r\n{\r\n  IRRef rref = ir->op2;\r\n  IRIns *irr = IR(rref);\r\n  Reg dest;\r\n  if (irref_isk(rref)) {  /* Constant shifts. */\r\n    int shift;\r\n    dest = ra_dest(as, ir, RSET_GPR);\r\n    shift = irr->i & (irt_is64(ir->t) ? 63 : 31);\r\n    switch (shift) {\r\n    case 0: break;\r\n    case 1: emit_rr(as, XO_SHIFT1, REX_64IR(ir, xs), dest); break;\r\n    default: emit_shifti(as, REX_64IR(ir, xs), dest, shift); break;\r\n    }\r\n  } else {  /* Variable shifts implicitly use register cl (i.e. ecx). */\r\n    Reg right;\r\n    dest = ra_dest(as, ir, rset_exclude(RSET_GPR, RID_ECX));\r\n    if (dest == RID_ECX) {\r\n      dest = ra_scratch(as, rset_exclude(RSET_GPR, RID_ECX));\r\n      emit_rr(as, XO_MOV, RID_ECX, dest);\r\n    }\r\n    right = irr->r;\r\n    if (ra_noreg(right))\r\n      right = ra_allocref(as, rref, RID2RSET(RID_ECX));\r\n    else if (right != RID_ECX)\r\n      ra_scratch(as, RID2RSET(RID_ECX));\r\n    emit_rr(as, XO_SHIFTcl, REX_64IR(ir, xs), dest);\r\n    ra_noweak(as, right);\r\n    if (right != RID_ECX)\r\n      emit_rr(as, XO_MOV, RID_ECX, right);\r\n  }\r\n  ra_left(as, dest, ir->op1);\r\n  /*\r\n  ** Note: avoid using the flags resulting from a shift or rotate!\r\n  ** All of them cause a partial flag stall, except for r,1 shifts\r\n  ** (but not rotates). And a shift count of 0 leaves the flags unmodified.\r\n  */\r\n}\r\n\r\n#define asm_bshl(as, ir)\tasm_bitshift(as, ir, XOg_SHL)\r\n#define asm_bshr(as, ir)\tasm_bitshift(as, ir, XOg_SHR)\r\n#define asm_bsar(as, ir)\tasm_bitshift(as, ir, XOg_SAR)\r\n#define asm_brol(as, ir)\tasm_bitshift(as, ir, XOg_ROL)\r\n#define asm_bror(as, ir)\tasm_bitshift(as, ir, XOg_ROR)\r\n\r\n/* -- Comparisons --------------------------------------------------------- */\r\n\r\n/* Virtual flags for unordered FP comparisons. */\r\n#define VCC_U\t0x1000\t\t/* Unordered. */\r\n#define VCC_P\t0x2000\t\t/* Needs extra CC_P branch. */\r\n#define VCC_S\t0x4000\t\t/* Swap avoids CC_P branch. */\r\n#define VCC_PS\t(VCC_P|VCC_S)\r\n\r\n/* Map of comparisons to flags. ORDER IR. */\r\n#define COMPFLAGS(ci, cin, cu, cf)\t((ci)+((cu)<<4)+((cin)<<8)+(cf))\r\nstatic const uint16_t asm_compmap[IR_ABC+1] = {\r\n  /*                 signed non-eq unsigned flags */\r\n  /* LT  */ COMPFLAGS(CC_GE, CC_G,  CC_AE, VCC_PS),\r\n  /* GE  */ COMPFLAGS(CC_L,  CC_L,  CC_B,  0),\r\n  /* LE  */ COMPFLAGS(CC_G,  CC_G,  CC_A,  VCC_PS),\r\n  /* GT  */ COMPFLAGS(CC_LE, CC_L,  CC_BE, 0),\r\n  /* ULT */ COMPFLAGS(CC_AE, CC_A,  CC_AE, VCC_U),\r\n  /* UGE */ COMPFLAGS(CC_B,  CC_B,  CC_B,  VCC_U|VCC_PS),\r\n  /* ULE */ COMPFLAGS(CC_A,  CC_A,  CC_A,  VCC_U),\r\n  /* UGT */ COMPFLAGS(CC_BE, CC_B,  CC_BE, VCC_U|VCC_PS),\r\n  /* EQ  */ COMPFLAGS(CC_NE, CC_NE, CC_NE, VCC_P),\r\n  /* NE  */ COMPFLAGS(CC_E,  CC_E,  CC_E,  VCC_U|VCC_P),\r\n  /* ABC */ COMPFLAGS(CC_BE, CC_B,  CC_BE, VCC_U|VCC_PS)  /* Same as UGT. */\r\n};\r\n\r\n/* FP and integer comparisons. */\r\nstatic void asm_comp(ASMState *as, IRIns *ir)\r\n{\r\n  uint32_t cc = asm_compmap[ir->o];\r\n  if (irt_isnum(ir->t)) {\r\n    IRRef lref = ir->op1;\r\n    IRRef rref = ir->op2;\r\n    Reg left, right;\r\n    MCLabel l_around;\r\n    /*\r\n    ** An extra CC_P branch is required to preserve ordered/unordered\r\n    ** semantics for FP comparisons. This can be avoided by swapping\r\n    ** the operands and inverting the condition (except for EQ and UNE).\r\n    ** So always try to swap if possible.\r\n    **\r\n    ** Another option would be to swap operands to achieve better memory\r\n    ** operand fusion. But it's unlikely that this outweighs the cost\r\n    ** of the extra branches.\r\n    */\r\n    if (cc & VCC_S) {  /* Swap? */\r\n      IRRef tmp = lref; lref = rref; rref = tmp;\r\n      cc ^= (VCC_PS|(5<<4));  /* A <-> B, AE <-> BE, PS <-> none */\r\n    }\r\n    left = ra_alloc1(as, lref, RSET_FPR);\r\n    right = asm_fuseload(as, rref, rset_exclude(RSET_FPR, left));\r\n    l_around = emit_label(as);\r\n    asm_guardcc(as, cc >> 4);\r\n    if (cc & VCC_P) {  /* Extra CC_P branch required? */\r\n      if (!(cc & VCC_U)) {\r\n\tasm_guardcc(as, CC_P);  /* Branch to exit for ordered comparisons. */\r\n      } else if (l_around != as->invmcp) {\r\n\temit_sjcc(as, CC_P, l_around);  /* Branch around for unordered. */\r\n      } else {\r\n\t/* Patched to mcloop by asm_loop_fixup. */\r\n\tas->loopinv = 2;\r\n\tif (as->realign)\r\n\t  emit_sjcc(as, CC_P, as->mcp);\r\n\telse\r\n\t  emit_jcc(as, CC_P, as->mcp);\r\n      }\r\n    }\r\n    emit_mrm(as, XO_UCOMISD, left, right);\r\n  } else {\r\n    IRRef lref = ir->op1, rref = ir->op2;\r\n    IROp leftop = (IROp)(IR(lref)->o);\r\n    Reg r64 = REX_64IR(ir, 0);\r\n    int32_t imm = 0;\r\n    lua_assert(irt_is64(ir->t) || irt_isint(ir->t) ||\r\n\t       irt_isu32(ir->t) || irt_isaddr(ir->t) || irt_isu8(ir->t));\r\n    /* Swap constants (only for ABC) and fusable loads to the right. */\r\n    if (irref_isk(lref) || (!irref_isk(rref) && opisfusableload(leftop))) {\r\n      if ((cc & 0xc) == 0xc) cc ^= 0x53;  /* L <-> G, LE <-> GE */\r\n      else if ((cc & 0xa) == 0x2) cc ^= 0x55;  /* A <-> B, AE <-> BE */\r\n      lref = ir->op2; rref = ir->op1;\r\n    }\r\n    if (asm_isk32(as, rref, &imm)) {\r\n      IRIns *irl = IR(lref);\r\n      /* Check wether we can use test ins. Not for unsigned, since CF=0. */\r\n      int usetest = (imm == 0 && (cc & 0xa) != 0x2);\r\n      if (usetest && irl->o == IR_BAND && irl+1 == ir && !ra_used(irl)) {\r\n\t/* Combine comp(BAND(ref, r/imm), 0) into test mrm, r/imm. */\r\n\tReg right, left = RID_NONE;\r\n\tRegSet allow = RSET_GPR;\r\n\tif (!asm_isk32(as, irl->op2, &imm)) {\r\n\t  left = ra_alloc1(as, irl->op2, allow);\r\n\t  rset_clear(allow, left);\r\n\t} else {  /* Try to Fuse IRT_I8/IRT_U8 loads, too. See below. */\r\n\t  IRIns *irll = IR(irl->op1);\r\n\t  if (opisfusableload((IROp)irll->o) &&\r\n\t      (irt_isi8(irll->t) || irt_isu8(irll->t))) {\r\n\t    IRType1 origt = irll->t;  /* Temporarily flip types. */\r\n\t    irll->t.irt = (irll->t.irt & ~IRT_TYPE) | IRT_INT;\r\n\t    as->curins--;  /* Skip to BAND to avoid failing in noconflict(). */\r\n\t    right = asm_fuseload(as, irl->op1, RSET_GPR);\r\n\t    as->curins++;\r\n\t    irll->t = origt;\r\n\t    if (right != RID_MRM) goto test_nofuse;\r\n\t    /* Fusion succeeded, emit test byte mrm, imm8. */\r\n\t    asm_guardcc(as, cc);\r\n\t    emit_i8(as, (imm & 0xff));\r\n\t    emit_mrm(as, XO_GROUP3b, XOg_TEST, RID_MRM);\r\n\t    return;\r\n\t  }\r\n\t}\r\n\tas->curins--;  /* Skip to BAND to avoid failing in noconflict(). */\r\n\tright = asm_fuseloadm(as, irl->op1, allow, r64);\r\n\tas->curins++;  /* Undo the above. */\r\n      test_nofuse:\r\n\tasm_guardcc(as, cc);\r\n\tif (ra_noreg(left)) {\r\n\t  emit_i32(as, imm);\r\n\t  emit_mrm(as, XO_GROUP3, r64 + XOg_TEST, right);\r\n\t} else {\r\n\t  emit_mrm(as, XO_TEST, r64 + left, right);\r\n\t}\r\n      } else {\r\n\tReg left;\r\n\tif (opisfusableload((IROp)irl->o) &&\r\n\t    ((irt_isu8(irl->t) && checku8(imm)) ||\r\n\t     ((irt_isi8(irl->t) || irt_isi16(irl->t)) && checki8(imm)) ||\r\n\t     (irt_isu16(irl->t) && checku16(imm) && checki8((int16_t)imm)))) {\r\n\t  /* Only the IRT_INT case is fused by asm_fuseload.\r\n\t  ** The IRT_I8/IRT_U8 loads and some IRT_I16/IRT_U16 loads\r\n\t  ** are handled here.\r\n\t  ** Note that cmp word [mem], imm16 should not be generated,\r\n\t  ** since it has a length-changing prefix. Compares of a word\r\n\t  ** against a sign-extended imm8 are ok, however.\r\n\t  */\r\n\t  IRType1 origt = irl->t;  /* Temporarily flip types. */\r\n\t  irl->t.irt = (irl->t.irt & ~IRT_TYPE) | IRT_INT;\r\n\t  left = asm_fuseload(as, lref, RSET_GPR);\r\n\t  irl->t = origt;\r\n\t  if (left == RID_MRM) {  /* Fusion succeeded? */\r\n\t    if (irt_isu8(irl->t) || irt_isu16(irl->t))\r\n\t      cc >>= 4;  /* Need unsigned compare. */\r\n\t    asm_guardcc(as, cc);\r\n\t    emit_i8(as, imm);\r\n\t    emit_mrm(as, (irt_isi8(origt) || irt_isu8(origt)) ?\r\n\t\t\t XO_ARITHib : XO_ARITHiw8, r64 + XOg_CMP, RID_MRM);\r\n\t    return;\r\n\t  }  /* Otherwise handle register case as usual. */\r\n\t} else {\r\n\t  left = asm_fuseloadm(as, lref,\r\n\t\t\t       irt_isu8(ir->t) ? RSET_GPR8 : RSET_GPR, r64);\r\n\t}\r\n\tasm_guardcc(as, cc);\r\n\tif (usetest && left != RID_MRM) {\r\n\t  /* Use test r,r instead of cmp r,0. */\r\n\t  x86Op xo = XO_TEST;\r\n\t  if (irt_isu8(ir->t)) {\r\n\t    lua_assert(ir->o == IR_EQ || ir->o == IR_NE);\r\n\t    xo = XO_TESTb;\r\n\t    if (!rset_test(RSET_RANGE(RID_EAX, RID_EBX+1), left)) {\r\n\t      if (LJ_64) {\r\n\t\tleft |= FORCE_REX;\r\n\t      } else {\r\n\t\temit_i32(as, 0xff);\r\n\t\temit_mrm(as, XO_GROUP3, XOg_TEST, left);\r\n\t\treturn;\r\n\t      }\r\n\t    }\r\n\t  }\r\n\t  emit_rr(as, xo, r64 + left, left);\r\n\t  if (irl+1 == ir)  /* Referencing previous ins? */\r\n\t    as->flagmcp = as->mcp;  /* Set flag to drop test r,r if possible. */\r\n\t} else {\r\n\t  emit_gmrmi(as, XG_ARITHi(XOg_CMP), r64 + left, imm);\r\n\t}\r\n      }\r\n    } else {\r\n      Reg left = ra_alloc1(as, lref, RSET_GPR);\r\n      Reg right = asm_fuseloadm(as, rref, rset_exclude(RSET_GPR, left), r64);\r\n      asm_guardcc(as, cc);\r\n      emit_mrm(as, XO_CMP, r64 + left, right);\r\n    }\r\n  }\r\n}\r\n\r\n#define asm_equal(as, ir)\tasm_comp(as, ir)\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* 64 bit integer comparisons in 32 bit mode. */\r\nstatic void asm_comp_int64(ASMState *as, IRIns *ir)\r\n{\r\n  uint32_t cc = asm_compmap[(ir-1)->o];\r\n  RegSet allow = RSET_GPR;\r\n  Reg lefthi = RID_NONE, leftlo = RID_NONE;\r\n  Reg righthi = RID_NONE, rightlo = RID_NONE;\r\n  MCLabel l_around;\r\n  x86ModRM mrm;\r\n\r\n  as->curins--;  /* Skip loword ins. Avoids failing in noconflict(), too. */\r\n\r\n  /* Allocate/fuse hiword operands. */\r\n  if (irref_isk(ir->op2)) {\r\n    lefthi = asm_fuseload(as, ir->op1, allow);\r\n  } else {\r\n    lefthi = ra_alloc1(as, ir->op1, allow);\r\n    rset_clear(allow, lefthi);\r\n    righthi = asm_fuseload(as, ir->op2, allow);\r\n    if (righthi == RID_MRM) {\r\n      if (as->mrm.base != RID_NONE) rset_clear(allow, as->mrm.base);\r\n      if (as->mrm.idx != RID_NONE) rset_clear(allow, as->mrm.idx);\r\n    } else {\r\n      rset_clear(allow, righthi);\r\n    }\r\n  }\r\n  mrm = as->mrm;  /* Save state for hiword instruction. */\r\n\r\n  /* Allocate/fuse loword operands. */\r\n  if (irref_isk((ir-1)->op2)) {\r\n    leftlo = asm_fuseload(as, (ir-1)->op1, allow);\r\n  } else {\r\n    leftlo = ra_alloc1(as, (ir-1)->op1, allow);\r\n    rset_clear(allow, leftlo);\r\n    rightlo = asm_fuseload(as, (ir-1)->op2, allow);\r\n  }\r\n\r\n  /* All register allocations must be performed _before_ this point. */\r\n  l_around = emit_label(as);\r\n  as->invmcp = as->flagmcp = NULL;  /* Cannot use these optimizations. */\r\n\r\n  /* Loword comparison and branch. */\r\n  asm_guardcc(as, cc >> 4);  /* Always use unsigned compare for loword. */\r\n  if (ra_noreg(rightlo)) {\r\n    int32_t imm = IR((ir-1)->op2)->i;\r\n    if (imm == 0 && ((cc >> 4) & 0xa) != 0x2 && leftlo != RID_MRM)\r\n      emit_rr(as, XO_TEST, leftlo, leftlo);\r\n    else\r\n      emit_gmrmi(as, XG_ARITHi(XOg_CMP), leftlo, imm);\r\n  } else {\r\n    emit_mrm(as, XO_CMP, leftlo, rightlo);\r\n  }\r\n\r\n  /* Hiword comparison and branches. */\r\n  if ((cc & 15) != CC_NE)\r\n    emit_sjcc(as, CC_NE, l_around);  /* Hiword unequal: skip loword compare. */\r\n  if ((cc & 15) != CC_E)\r\n    asm_guardcc(as, cc >> 8);  /* Hiword compare without equality check. */\r\n  as->mrm = mrm;  /* Restore state. */\r\n  if (ra_noreg(righthi)) {\r\n    int32_t imm = IR(ir->op2)->i;\r\n    if (imm == 0 && (cc & 0xa) != 0x2 && lefthi != RID_MRM)\r\n      emit_rr(as, XO_TEST, lefthi, lefthi);\r\n    else\r\n      emit_gmrmi(as, XG_ARITHi(XOg_CMP), lefthi, imm);\r\n  } else {\r\n    emit_mrm(as, XO_CMP, lefthi, righthi);\r\n  }\r\n}\r\n#endif\r\n\r\n/* -- Support for 64 bit ops in 32 bit mode ------------------------------- */\r\n\r\n/* Hiword op of a split 64 bit op. Previous op must be the loword op. */\r\nstatic void asm_hiop(ASMState *as, IRIns *ir)\r\n{\r\n#if LJ_32 && LJ_HASFFI\r\n  /* HIOP is marked as a store because it needs its own DCE logic. */\r\n  int uselo = ra_used(ir-1), usehi = ra_used(ir);  /* Loword/hiword used? */\r\n  if (LJ_UNLIKELY(!(as->flags & JIT_F_OPT_DCE))) uselo = usehi = 1;\r\n  if ((ir-1)->o == IR_CONV) {  /* Conversions to/from 64 bit. */\r\n    as->curins--;  /* Always skip the CONV. */\r\n    if (usehi || uselo)\r\n      asm_conv64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o <= IR_NE) {  /* 64 bit integer comparisons. ORDER IR. */\r\n    asm_comp_int64(as, ir);\r\n    return;\r\n  } else if ((ir-1)->o == IR_XSTORE) {\r\n    if ((ir-1)->r != RID_SINK)\r\n      asm_fxstore(as, ir);\r\n    return;\r\n  }\r\n  if (!usehi) return;  /* Skip unused hiword op for all remaining ops. */\r\n  switch ((ir-1)->o) {\r\n  case IR_ADD:\r\n    as->flagmcp = NULL;\r\n    as->curins--;\r\n    asm_intarith(as, ir, XOg_ADC);\r\n    asm_intarith(as, ir-1, XOg_ADD);\r\n    break;\r\n  case IR_SUB:\r\n    as->flagmcp = NULL;\r\n    as->curins--;\r\n    asm_intarith(as, ir, XOg_SBB);\r\n    asm_intarith(as, ir-1, XOg_SUB);\r\n    break;\r\n  case IR_NEG: {\r\n    Reg dest = ra_dest(as, ir, RSET_GPR);\r\n    emit_rr(as, XO_GROUP3, XOg_NEG, dest);\r\n    emit_i8(as, 0);\r\n    emit_rr(as, XO_ARITHi8, XOg_ADC, dest);\r\n    ra_left(as, dest, ir->op1);\r\n    as->curins--;\r\n    asm_neg_not(as, ir-1, XOg_NEG);\r\n    break;\r\n    }\r\n  case IR_CALLN:\r\n  case IR_CALLXS:\r\n    if (!uselo)\r\n      ra_allocref(as, ir->op1, RID2RSET(RID_RETLO));  /* Mark lo op as used. */\r\n    break;\r\n  case IR_CNEWI:\r\n    /* Nothing to do here. Handled by CNEWI itself. */\r\n    break;\r\n  default: lua_assert(0); break;\r\n  }\r\n#else\r\n  UNUSED(as); UNUSED(ir); lua_assert(0);  /* Unused on x64 or without FFI. */\r\n#endif\r\n}\r\n\r\n/* -- Profiling ----------------------------------------------------------- */\r\n\r\nstatic void asm_prof(ASMState *as, IRIns *ir)\r\n{\r\n  UNUSED(ir);\r\n  asm_guardcc(as, CC_NE);\r\n  emit_i8(as, HOOK_PROFILE);\r\n  emit_rma(as, XO_GROUP3b, XOg_TEST, &J2G(as->J)->hookmask);\r\n}\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Check Lua stack size for overflow. Use exit handler as fallback. */\r\nstatic void asm_stack_check(ASMState *as, BCReg topslot,\r\n\t\t\t    IRIns *irp, RegSet allow, ExitNo exitno)\r\n{\r\n  /* Try to get an unused temp. register, otherwise spill/restore eax. */\r\n  Reg pbase = irp ? irp->r : RID_BASE;\r\n  Reg r = allow ? rset_pickbot(allow) : RID_EAX;\r\n  emit_jcc(as, CC_B, exitstub_addr(as->J, exitno));\r\n  if (allow == RSET_EMPTY)  /* Restore temp. register. */\r\n    emit_rmro(as, XO_MOV, r|REX_64, RID_ESP, 0);\r\n  else\r\n    ra_modified(as, r);\r\n  emit_gri(as, XG_ARITHi(XOg_CMP), r, (int32_t)(8*topslot));\r\n  if (ra_hasreg(pbase) && pbase != r)\r\n    emit_rr(as, XO_ARITH(XOg_SUB), r, pbase);\r\n  else\r\n    emit_rmro(as, XO_ARITH(XOg_SUB), r, RID_NONE,\r\n\t      ptr2addr(&J2G(as->J)->jit_base));\r\n  emit_rmro(as, XO_MOV, r, r, offsetof(lua_State, maxstack));\r\n  emit_getgl(as, r, cur_L);\r\n  if (allow == RSET_EMPTY)  /* Spill temp. register. */\r\n    emit_rmro(as, XO_MOVto, r|REX_64, RID_ESP, 0);\r\n}\r\n\r\n/* Restore Lua stack from on-trace state. */\r\nstatic void asm_stack_restore(ASMState *as, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &as->T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &as->T->snapmap[snap_nextofs(as->T, snap)-1];\r\n  MSize n, nent = snap->nent;\r\n  /* Store the value of all modified slots to the Lua stack. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    int32_t ofs = 8*((int32_t)s-1);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = IR(ref);\r\n    if ((sn & SNAP_NORESTORE))\r\n      continue;\r\n    if (irt_isnum(ir->t)) {\r\n      Reg src = ra_alloc1(as, ref, RSET_FPR);\r\n      emit_rmro(as, XO_MOVSDto, src, RID_BASE, ofs);\r\n    } else {\r\n      lua_assert(irt_ispri(ir->t) || irt_isaddr(ir->t) ||\r\n\t\t (LJ_DUALNUM && irt_isinteger(ir->t)));\r\n      if (!irref_isk(ref)) {\r\n\tReg src = ra_alloc1(as, ref, rset_exclude(RSET_GPR, RID_BASE));\r\n\temit_movtomro(as, REX_64IR(ir, src), RID_BASE, ofs);\r\n      } else if (!irt_ispri(ir->t)) {\r\n\temit_movmroi(as, RID_BASE, ofs, ir->i);\r\n      }\r\n      if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tif (s != 0)  /* Do not overwrite link to previous frame. */\r\n\t  emit_movmroi(as, RID_BASE, ofs+4, (int32_t)(*flinks--));\r\n      } else {\r\n\tif (!(LJ_64 && irt_islightud(ir->t)))\r\n\t  emit_movmroi(as, RID_BASE, ofs+4, irt_toitype(ir->t));\r\n      }\r\n    }\r\n    checkmclim(as);\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n}\r\n\r\n/* -- GC handling --------------------------------------------------------- */\r\n\r\n/* Check GC threshold and do one or more GC steps. */\r\nstatic void asm_gc_check(ASMState *as)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[IRCALL_lj_gc_step_jit];\r\n  IRRef args[2];\r\n  MCLabel l_end;\r\n  Reg tmp;\r\n  ra_evictset(as, RSET_SCRATCH);\r\n  l_end = emit_label(as);\r\n  /* Exit trace if in GCSatomic or GCSfinalize. Avoids syncing GC objects. */\r\n  asm_guardcc(as, CC_NE);  /* Assumes asm_snap_prep() already done. */\r\n  emit_rr(as, XO_TEST, RID_RET, RID_RET);\r\n  args[0] = ASMREF_TMP1;  /* global_State *g */\r\n  args[1] = ASMREF_TMP2;  /* MSize steps     */\r\n  asm_gencall(as, ci, args);\r\n  tmp = ra_releasetmp(as, ASMREF_TMP1);\r\n  emit_loada(as, tmp, J2G(as->J));\r\n  emit_loadi(as, ra_releasetmp(as, ASMREF_TMP2), as->gcsteps);\r\n  /* Jump around GC step if GC total < GC threshold. */\r\n  emit_sjcc(as, CC_B, l_end);\r\n  emit_opgl(as, XO_ARITH(XOg_CMP), tmp, gc.threshold);\r\n  emit_getgl(as, tmp, gc.total);\r\n  as->gcsteps = 0;\r\n  checkmclim(as);\r\n}\r\n\r\n/* -- Loop handling ------------------------------------------------------- */\r\n\r\n/* Fixup the loop branch. */\r\nstatic void asm_loop_fixup(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  MCode *target = as->mcp;\r\n  if (as->realign) {  /* Realigned loops use short jumps. */\r\n    as->realign = NULL;  /* Stop another retry. */\r\n    lua_assert(((intptr_t)target & 15) == 0);\r\n    if (as->loopinv) {  /* Inverted loop branch? */\r\n      p -= 5;\r\n      p[0] = XI_JMP;\r\n      lua_assert(target - p >= -128);\r\n      p[-1] = (MCode)(target - p);  /* Patch sjcc. */\r\n      if (as->loopinv == 2)\r\n\tp[-3] = (MCode)(target - p + 2);  /* Patch opt. short jp. */\r\n    } else {\r\n      lua_assert(target - p >= -128);\r\n      p[-1] = (MCode)(int8_t)(target - p);  /* Patch short jmp. */\r\n      p[-2] = XI_JMPs;\r\n    }\r\n  } else {\r\n    MCode *newloop;\r\n    p[-5] = XI_JMP;\r\n    if (as->loopinv) {  /* Inverted loop branch? */\r\n      /* asm_guardcc already inverted the jcc and patched the jmp. */\r\n      p -= 5;\r\n      newloop = target+4;\r\n      *(int32_t *)(p-4) = (int32_t)(target - p);  /* Patch jcc. */\r\n      if (as->loopinv == 2) {\r\n\t*(int32_t *)(p-10) = (int32_t)(target - p + 6);  /* Patch opt. jp. */\r\n\tnewloop = target+8;\r\n      }\r\n    } else {  /* Otherwise just patch jmp. */\r\n      *(int32_t *)(p-4) = (int32_t)(target - p);\r\n      newloop = target+3;\r\n    }\r\n    /* Realign small loops and shorten the loop branch. */\r\n    if (newloop >= p - 128) {\r\n      as->realign = newloop;  /* Force a retry and remember alignment. */\r\n      as->curins = as->stopins;  /* Abort asm_trace now. */\r\n      as->T->nins = as->orignins;  /* Remove any added renames. */\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Head of trace ------------------------------------------------------- */\r\n\r\n/* Coalesce BASE register for a root trace. */\r\nstatic void asm_head_root_base(ASMState *as)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (r != RID_BASE)\r\n      emit_rr(as, XO_MOV, r, RID_BASE);\r\n  }\r\n}\r\n\r\n/* Coalesce or reload BASE register for a side trace. */\r\nstatic RegSet asm_head_side_base(ASMState *as, IRIns *irp, RegSet allow)\r\n{\r\n  IRIns *ir = IR(REF_BASE);\r\n  Reg r = ir->r;\r\n  if (ra_hasreg(r)) {\r\n    ra_free(as, r);\r\n    if (rset_test(as->modset, r) || irt_ismarked(ir->t))\r\n      ir->r = RID_INIT;  /* No inheritance for modified BASE register. */\r\n    if (irp->r == r) {\r\n      rset_clear(allow, r);  /* Mark same BASE register as coalesced. */\r\n    } else if (ra_hasreg(irp->r) && rset_test(as->freeset, irp->r)) {\r\n      rset_clear(allow, irp->r);\r\n      emit_rr(as, XO_MOV, r, irp->r);  /* Move from coalesced parent reg. */\r\n    } else {\r\n      emit_getgl(as, r, jit_base);  /* Otherwise reload BASE. */\r\n    }\r\n  }\r\n  return allow;\r\n}\r\n\r\n/* -- Tail of trace ------------------------------------------------------- */\r\n\r\n/* Fixup the tail code. */\r\nstatic void asm_tail_fixup(ASMState *as, TraceNo lnk)\r\n{\r\n  /* Note: don't use as->mcp swap + emit_*: emit_op overwrites more bytes. */\r\n  MCode *p = as->mctop;\r\n  MCode *target, *q;\r\n  int32_t spadj = as->T->spadjust;\r\n  if (spadj == 0) {\r\n    p -= ((as->flags & JIT_F_LEA_AGU) ? 7 : 6) + (LJ_64 ? 1 : 0);\r\n  } else {\r\n    MCode *p1;\r\n    /* Patch stack adjustment. */\r\n    if (checki8(spadj)) {\r\n      p -= 3;\r\n      p1 = p-6;\r\n      *p1 = (MCode)spadj;\r\n    } else {\r\n      p1 = p-9;\r\n      *(int32_t *)p1 = spadj;\r\n    }\r\n    if ((as->flags & JIT_F_LEA_AGU)) {\r\n#if LJ_64\r\n      p1[-4] = 0x48;\r\n#endif\r\n      p1[-3] = (MCode)XI_LEA;\r\n      p1[-2] = MODRM(checki8(spadj) ? XM_OFS8 : XM_OFS32, RID_ESP, RID_ESP);\r\n      p1[-1] = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n    } else {\r\n#if LJ_64\r\n      p1[-3] = 0x48;\r\n#endif\r\n      p1[-2] = (MCode)(checki8(spadj) ? XI_ARITHi8 : XI_ARITHi);\r\n      p1[-1] = MODRM(XM_REG, XOg_ADD, RID_ESP);\r\n    }\r\n  }\r\n  /* Patch exit branch. */\r\n  target = lnk ? traceref(as->J, lnk)->mcode : (MCode *)lj_vm_exit_interp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_JMP;\r\n  /* Drop unused mcode tail. Fill with NOPs to make the prefetcher happy. */\r\n  for (q = as->mctop-1; q >= p; q--)\r\n    *q = XI_NOP;\r\n  as->mctop = p;\r\n}\r\n\r\n/* Prepare tail of code. */\r\nstatic void asm_tail_prep(ASMState *as)\r\n{\r\n  MCode *p = as->mctop;\r\n  /* Realign and leave room for backwards loop branch or exit branch. */\r\n  if (as->realign) {\r\n    int i = ((int)(intptr_t)as->realign) & 15;\r\n    /* Fill unused mcode tail with NOPs to make the prefetcher happy. */\r\n    while (i-- > 0)\r\n      *--p = XI_NOP;\r\n    as->mctop = p;\r\n    p -= (as->loopinv ? 5 : 2);  /* Space for short/near jmp. */\r\n  } else {\r\n    p -= 5;  /* Space for exit branch (near jmp). */\r\n  }\r\n  if (as->loopref) {\r\n    as->invmcp = as->mcp = p;\r\n  } else {\r\n    /* Leave room for ESP adjustment: add esp, imm or lea esp, [esp+imm] */\r\n    as->mcp = p - (((as->flags & JIT_F_LEA_AGU) ? 7 : 6)  + (LJ_64 ? 1 : 0));\r\n    as->invmcp = NULL;\r\n  }\r\n}\r\n\r\n/* -- Trace setup --------------------------------------------------------- */\r\n\r\n/* Ensure there are enough stack slots for call arguments. */\r\nstatic Reg asm_setup_call_slots(ASMState *as, IRIns *ir, const CCallInfo *ci)\r\n{\r\n  IRRef args[CCI_NARGS_MAX*2];\r\n  int nslots;\r\n  asm_collectargs(as, ir, ci, args);\r\n  nslots = asm_count_call_slots(as, ci, args);\r\n  if (nslots > as->evenspill)  /* Leave room for args in stack slots. */\r\n    as->evenspill = nslots;\r\n#if LJ_64\r\n  return irt_isfp(ir->t) ? REGSP_HINT(RID_FPRET) : REGSP_HINT(RID_RET);\r\n#else\r\n  return irt_isfp(ir->t) ? REGSP_INIT : REGSP_HINT(RID_RET);\r\n#endif\r\n}\r\n\r\n/* Target-specific setup. */\r\nstatic void asm_setup_target(ASMState *as)\r\n{\r\n  asm_exitstub_setup(as, as->T->nsnap);\r\n}\r\n\r\n/* -- Trace patching ------------------------------------------------------ */\r\n\r\n/* Patch exit jumps of existing machine code to a new target. */\r\nvoid lj_asm_patchexit(jit_State *J, GCtrace *T, ExitNo exitno, MCode *target)\r\n{\r\n  MCode *p = T->mcode;\r\n  MCode *mcarea = lj_mcode_patch(J, p, 0);\r\n  MSize len = T->szmcode;\r\n  MCode *px = exitstub_addr(J, exitno) - 6;\r\n  MCode *pe = p+len-6;\r\n  uint32_t stateaddr = u32ptr(&J2G(J)->vmstate);\r\n  if (len > 5 && p[len-5] == XI_JMP && p+len-6 + *(int32_t *)(p+len-4) == px)\r\n    *(int32_t *)(p+len-4) = jmprel(p+len, target);\r\n  /* Do not patch parent exit for a stack check. Skip beyond vmstate update. */\r\n  for (; p < pe; p++)\r\n    if (*(uint32_t *)(p+(LJ_64 ? 3 : 2)) == stateaddr && p[0] == XI_MOVmi) {\r\n      p += LJ_64 ? 11 : 10;\r\n      break;\r\n    }\r\n  lua_assert(p < pe);\r\n  for (; p < pe; p++) {\r\n    if ((*(uint16_t *)p & 0xf0ff) == 0x800f && p + *(int32_t *)(p+2) == px) {\r\n      *(int32_t *)(p+2) = jmprel(p+6, target);\r\n      p += 5;\r\n    }\r\n  }\r\n  lj_mcode_sync(T->mcode, T->mcode + T->szmcode);\r\n  lj_mcode_patch(J, mcarea, 1);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_bc.c",
    "content": "/*\r\n** Bytecode instruction modes.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bc_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* Bytecode offsets and bytecode instruction modes. */\r\n#include \"lj_bcdef.h\"\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_bc.h",
    "content": "/*\r\n** Bytecode instruction format.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_BC_H\r\n#define _LJ_BC_H\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* Bytecode instruction format, 32 bit wide, fields of 8 or 16 bit:\r\n**\r\n** +----+----+----+----+\r\n** | B  | C  | A  | OP | Format ABC\r\n** +----+----+----+----+\r\n** |    D    | A  | OP | Format AD\r\n** +--------------------\r\n** MSB               LSB\r\n**\r\n** In-memory instructions are always stored in host byte order.\r\n*/\r\n\r\n/* Operand ranges and related constants. */\r\n#define BCMAX_A\t\t0xff\r\n#define BCMAX_B\t\t0xff\r\n#define BCMAX_C\t\t0xff\r\n#define BCMAX_D\t\t0xffff\r\n#define BCBIAS_J\t0x8000\r\n#define NO_REG\t\tBCMAX_A\r\n#define NO_JMP\t\t(~(BCPos)0)\r\n\r\n/* Macros to get instruction fields. */\r\n#define bc_op(i)\t((BCOp)((i)&0xff))\r\n#define bc_a(i)\t\t((BCReg)(((i)>>8)&0xff))\r\n#define bc_b(i)\t\t((BCReg)((i)>>24))\r\n#define bc_c(i)\t\t((BCReg)(((i)>>16)&0xff))\r\n#define bc_d(i)\t\t((BCReg)((i)>>16))\r\n#define bc_j(i)\t\t((ptrdiff_t)bc_d(i)-BCBIAS_J)\r\n\r\n/* Macros to set instruction fields. */\r\n#define setbc_byte(p, x, ofs) \\\r\n  ((uint8_t *)(p))[LJ_ENDIAN_SELECT(ofs, 3-ofs)] = (uint8_t)(x)\r\n#define setbc_op(p, x)\tsetbc_byte(p, (x), 0)\r\n#define setbc_a(p, x)\tsetbc_byte(p, (x), 1)\r\n#define setbc_b(p, x)\tsetbc_byte(p, (x), 3)\r\n#define setbc_c(p, x)\tsetbc_byte(p, (x), 2)\r\n#define setbc_d(p, x) \\\r\n  ((uint16_t *)(p))[LJ_ENDIAN_SELECT(1, 0)] = (uint16_t)(x)\r\n#define setbc_j(p, x)\tsetbc_d(p, (BCPos)((int32_t)(x)+BCBIAS_J))\r\n\r\n/* Macros to compose instructions. */\r\n#define BCINS_ABC(o, a, b, c) \\\r\n  (((BCIns)(o))|((BCIns)(a)<<8)|((BCIns)(b)<<24)|((BCIns)(c)<<16))\r\n#define BCINS_AD(o, a, d) \\\r\n  (((BCIns)(o))|((BCIns)(a)<<8)|((BCIns)(d)<<16))\r\n#define BCINS_AJ(o, a, j)\tBCINS_AD(o, a, (BCPos)((int32_t)(j)+BCBIAS_J))\r\n\r\n/* Bytecode instruction definition. Order matters, see below.\r\n**\r\n** (name, filler, Amode, Bmode, Cmode or Dmode, metamethod)\r\n**\r\n** The opcode name suffixes specify the type for RB/RC or RD:\r\n** V = variable slot\r\n** S = string const\r\n** N = number const\r\n** P = primitive type (~itype)\r\n** B = unsigned byte literal\r\n** M = multiple args/results\r\n*/\r\n#define BCDEF(_) \\\r\n  /* Comparison ops. ORDER OPR. */ \\\r\n  _(ISLT,\tvar,\t___,\tvar,\tlt) \\\r\n  _(ISGE,\tvar,\t___,\tvar,\tlt) \\\r\n  _(ISLE,\tvar,\t___,\tvar,\tle) \\\r\n  _(ISGT,\tvar,\t___,\tvar,\tle) \\\r\n  \\\r\n  _(ISEQV,\tvar,\t___,\tvar,\teq) \\\r\n  _(ISNEV,\tvar,\t___,\tvar,\teq) \\\r\n  _(ISEQS,\tvar,\t___,\tstr,\teq) \\\r\n  _(ISNES,\tvar,\t___,\tstr,\teq) \\\r\n  _(ISEQN,\tvar,\t___,\tnum,\teq) \\\r\n  _(ISNEN,\tvar,\t___,\tnum,\teq) \\\r\n  _(ISEQP,\tvar,\t___,\tpri,\teq) \\\r\n  _(ISNEP,\tvar,\t___,\tpri,\teq) \\\r\n  \\\r\n  /* Unary test and copy ops. */ \\\r\n  _(ISTC,\tdst,\t___,\tvar,\t___) \\\r\n  _(ISFC,\tdst,\t___,\tvar,\t___) \\\r\n  _(IST,\t___,\t___,\tvar,\t___) \\\r\n  _(ISF,\t___,\t___,\tvar,\t___) \\\r\n  _(ISTYPE,\tvar,\t___,\tlit,\t___) \\\r\n  _(ISNUM,\tvar,\t___,\tlit,\t___) \\\r\n  \\\r\n  /* Unary ops. */ \\\r\n  _(MOV,\tdst,\t___,\tvar,\t___) \\\r\n  _(NOT,\tdst,\t___,\tvar,\t___) \\\r\n  _(UNM,\tdst,\t___,\tvar,\tunm) \\\r\n  _(LEN,\tdst,\t___,\tvar,\tlen) \\\r\n  \\\r\n  /* Binary ops. ORDER OPR. VV last, POW must be next. */ \\\r\n  _(ADDVN,\tdst,\tvar,\tnum,\tadd) \\\r\n  _(SUBVN,\tdst,\tvar,\tnum,\tsub) \\\r\n  _(MULVN,\tdst,\tvar,\tnum,\tmul) \\\r\n  _(DIVVN,\tdst,\tvar,\tnum,\tdiv) \\\r\n  _(MODVN,\tdst,\tvar,\tnum,\tmod) \\\r\n  \\\r\n  _(ADDNV,\tdst,\tvar,\tnum,\tadd) \\\r\n  _(SUBNV,\tdst,\tvar,\tnum,\tsub) \\\r\n  _(MULNV,\tdst,\tvar,\tnum,\tmul) \\\r\n  _(DIVNV,\tdst,\tvar,\tnum,\tdiv) \\\r\n  _(MODNV,\tdst,\tvar,\tnum,\tmod) \\\r\n  \\\r\n  _(ADDVV,\tdst,\tvar,\tvar,\tadd) \\\r\n  _(SUBVV,\tdst,\tvar,\tvar,\tsub) \\\r\n  _(MULVV,\tdst,\tvar,\tvar,\tmul) \\\r\n  _(DIVVV,\tdst,\tvar,\tvar,\tdiv) \\\r\n  _(MODVV,\tdst,\tvar,\tvar,\tmod) \\\r\n  \\\r\n  _(POW,\tdst,\tvar,\tvar,\tpow) \\\r\n  _(CAT,\tdst,\trbase,\trbase,\tconcat) \\\r\n  \\\r\n  /* Constant ops. */ \\\r\n  _(KSTR,\tdst,\t___,\tstr,\t___) \\\r\n  _(KCDATA,\tdst,\t___,\tcdata,\t___) \\\r\n  _(KSHORT,\tdst,\t___,\tlits,\t___) \\\r\n  _(KNUM,\tdst,\t___,\tnum,\t___) \\\r\n  _(KPRI,\tdst,\t___,\tpri,\t___) \\\r\n  _(KNIL,\tbase,\t___,\tbase,\t___) \\\r\n  \\\r\n  /* Upvalue and function ops. */ \\\r\n  _(UGET,\tdst,\t___,\tuv,\t___) \\\r\n  _(USETV,\tuv,\t___,\tvar,\t___) \\\r\n  _(USETS,\tuv,\t___,\tstr,\t___) \\\r\n  _(USETN,\tuv,\t___,\tnum,\t___) \\\r\n  _(USETP,\tuv,\t___,\tpri,\t___) \\\r\n  _(UCLO,\trbase,\t___,\tjump,\t___) \\\r\n  _(FNEW,\tdst,\t___,\tfunc,\tgc) \\\r\n  \\\r\n  /* Table ops. */ \\\r\n  _(TNEW,\tdst,\t___,\tlit,\tgc) \\\r\n  _(TDUP,\tdst,\t___,\ttab,\tgc) \\\r\n  _(GGET,\tdst,\t___,\tstr,\tindex) \\\r\n  _(GSET,\tvar,\t___,\tstr,\tnewindex) \\\r\n  _(TGETV,\tdst,\tvar,\tvar,\tindex) \\\r\n  _(TGETS,\tdst,\tvar,\tstr,\tindex) \\\r\n  _(TGETB,\tdst,\tvar,\tlit,\tindex) \\\r\n  _(TGETR,\tdst,\tvar,\tvar,\tindex) \\\r\n  _(TSETV,\tvar,\tvar,\tvar,\tnewindex) \\\r\n  _(TSETS,\tvar,\tvar,\tstr,\tnewindex) \\\r\n  _(TSETB,\tvar,\tvar,\tlit,\tnewindex) \\\r\n  _(TSETM,\tbase,\t___,\tnum,\tnewindex) \\\r\n  _(TSETR,\tvar,\tvar,\tvar,\tnewindex) \\\r\n  \\\r\n  /* Calls and vararg handling. T = tail call. */ \\\r\n  _(CALLM,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(CALL,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(CALLMT,\tbase,\t___,\tlit,\tcall) \\\r\n  _(CALLT,\tbase,\t___,\tlit,\tcall) \\\r\n  _(ITERC,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(ITERN,\tbase,\tlit,\tlit,\tcall) \\\r\n  _(VARG,\tbase,\tlit,\tlit,\t___) \\\r\n  _(ISNEXT,\tbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  /* Returns. */ \\\r\n  _(RETM,\tbase,\t___,\tlit,\t___) \\\r\n  _(RET,\trbase,\t___,\tlit,\t___) \\\r\n  _(RET0,\trbase,\t___,\tlit,\t___) \\\r\n  _(RET1,\trbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  /* Loops and branches. I/J = interp/JIT, I/C/L = init/call/loop. */ \\\r\n  _(FORI,\tbase,\t___,\tjump,\t___) \\\r\n  _(JFORI,\tbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  _(FORL,\tbase,\t___,\tjump,\t___) \\\r\n  _(IFORL,\tbase,\t___,\tjump,\t___) \\\r\n  _(JFORL,\tbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(ITERL,\tbase,\t___,\tjump,\t___) \\\r\n  _(IITERL,\tbase,\t___,\tjump,\t___) \\\r\n  _(JITERL,\tbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(LOOP,\trbase,\t___,\tjump,\t___) \\\r\n  _(ILOOP,\trbase,\t___,\tjump,\t___) \\\r\n  _(JLOOP,\trbase,\t___,\tlit,\t___) \\\r\n  \\\r\n  _(JMP,\trbase,\t___,\tjump,\t___) \\\r\n  \\\r\n  /* Function headers. I/J = interp/JIT, F/V/C = fixarg/vararg/C func. */ \\\r\n  _(FUNCF,\trbase,\t___,\t___,\t___) \\\r\n  _(IFUNCF,\trbase,\t___,\t___,\t___) \\\r\n  _(JFUNCF,\trbase,\t___,\tlit,\t___) \\\r\n  _(FUNCV,\trbase,\t___,\t___,\t___) \\\r\n  _(IFUNCV,\trbase,\t___,\t___,\t___) \\\r\n  _(JFUNCV,\trbase,\t___,\tlit,\t___) \\\r\n  _(FUNCC,\trbase,\t___,\t___,\t___) \\\r\n  _(FUNCCW,\trbase,\t___,\t___,\t___)\r\n\r\n/* Bytecode opcode numbers. */\r\ntypedef enum {\r\n#define BCENUM(name, ma, mb, mc, mt)\tBC_##name,\r\nBCDEF(BCENUM)\r\n#undef BCENUM\r\n  BC__MAX\r\n} BCOp;\r\n\r\nLJ_STATIC_ASSERT((int)BC_ISEQV+1 == (int)BC_ISNEV);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQV^1) == (int)BC_ISNEV);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQS^1) == (int)BC_ISNES);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQN^1) == (int)BC_ISNEN);\r\nLJ_STATIC_ASSERT(((int)BC_ISEQP^1) == (int)BC_ISNEP);\r\nLJ_STATIC_ASSERT(((int)BC_ISLT^1) == (int)BC_ISGE);\r\nLJ_STATIC_ASSERT(((int)BC_ISLE^1) == (int)BC_ISGT);\r\nLJ_STATIC_ASSERT(((int)BC_ISLT^3) == (int)BC_ISGT);\r\nLJ_STATIC_ASSERT((int)BC_IST-(int)BC_ISTC == (int)BC_ISF-(int)BC_ISFC);\r\nLJ_STATIC_ASSERT((int)BC_CALLT-(int)BC_CALL == (int)BC_CALLMT-(int)BC_CALLM);\r\nLJ_STATIC_ASSERT((int)BC_CALLMT + 1 == (int)BC_CALLT);\r\nLJ_STATIC_ASSERT((int)BC_RETM + 1 == (int)BC_RET);\r\nLJ_STATIC_ASSERT((int)BC_FORL + 1 == (int)BC_IFORL);\r\nLJ_STATIC_ASSERT((int)BC_FORL + 2 == (int)BC_JFORL);\r\nLJ_STATIC_ASSERT((int)BC_ITERL + 1 == (int)BC_IITERL);\r\nLJ_STATIC_ASSERT((int)BC_ITERL + 2 == (int)BC_JITERL);\r\nLJ_STATIC_ASSERT((int)BC_LOOP + 1 == (int)BC_ILOOP);\r\nLJ_STATIC_ASSERT((int)BC_LOOP + 2 == (int)BC_JLOOP);\r\nLJ_STATIC_ASSERT((int)BC_FUNCF + 1 == (int)BC_IFUNCF);\r\nLJ_STATIC_ASSERT((int)BC_FUNCF + 2 == (int)BC_JFUNCF);\r\nLJ_STATIC_ASSERT((int)BC_FUNCV + 1 == (int)BC_IFUNCV);\r\nLJ_STATIC_ASSERT((int)BC_FUNCV + 2 == (int)BC_JFUNCV);\r\n\r\n/* This solves a circular dependency problem, change as needed. */\r\n#define FF_next_N\t4\r\n\r\n/* Stack slots used by FORI/FORL, relative to operand A. */\r\nenum {\r\n  FORL_IDX, FORL_STOP, FORL_STEP, FORL_EXT\r\n};\r\n\r\n/* Bytecode operand modes. ORDER BCMode */\r\ntypedef enum {\r\n  BCMnone, BCMdst, BCMbase, BCMvar, BCMrbase, BCMuv,  /* Mode A must be <= 7 */\r\n  BCMlit, BCMlits, BCMpri, BCMnum, BCMstr, BCMtab, BCMfunc, BCMjump, BCMcdata,\r\n  BCM_max\r\n} BCMode;\r\n#define BCM___\t\tBCMnone\r\n\r\n#define bcmode_a(op)\t((BCMode)(lj_bc_mode[op] & 7))\r\n#define bcmode_b(op)\t((BCMode)((lj_bc_mode[op]>>3) & 15))\r\n#define bcmode_c(op)\t((BCMode)((lj_bc_mode[op]>>7) & 15))\r\n#define bcmode_d(op)\tbcmode_c(op)\r\n#define bcmode_hasd(op)\t((lj_bc_mode[op] & (15<<3)) == (BCMnone<<3))\r\n#define bcmode_mm(op)\t((MMS)(lj_bc_mode[op]>>11))\r\n\r\n#define BCMODE(name, ma, mb, mc, mm) \\\r\n  (BCM##ma|(BCM##mb<<3)|(BCM##mc<<7)|(MM_##mm<<11)),\r\n#define BCMODE_FF\t0\r\n\r\nstatic LJ_AINLINE int bc_isret(BCOp op)\r\n{\r\n  return (op == BC_RETM || op == BC_RET || op == BC_RET0 || op == BC_RET1);\r\n}\r\n\r\nLJ_DATA const uint16_t lj_bc_mode[];\r\nLJ_DATA const uint16_t lj_bc_ofs[];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_bcdump.h",
    "content": "/*\r\n** Bytecode dump definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_BCDUMP_H\r\n#define _LJ_BCDUMP_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lex.h\"\r\n\r\n/* -- Bytecode dump format ------------------------------------------------ */\r\n\r\n/*\r\n** dump   = header proto+ 0U\r\n** header = ESC 'L' 'J' versionB flagsU [namelenU nameB*]\r\n** proto  = lengthU pdata\r\n** pdata  = phead bcinsW* uvdataH* kgc* knum* [debugB*]\r\n** phead  = flagsB numparamsB framesizeB numuvB numkgcU numknU numbcU\r\n**          [debuglenU [firstlineU numlineU]]\r\n** kgc    = kgctypeU { ktab | (loU hiU) | (rloU rhiU iloU ihiU) | strB* }\r\n** knum   = intU0 | (loU1 hiU)\r\n** ktab   = narrayU nhashU karray* khash*\r\n** karray = ktabk\r\n** khash  = ktabk ktabk\r\n** ktabk  = ktabtypeU { intU | (loU hiU) | strB* }\r\n**\r\n** B = 8 bit, H = 16 bit, W = 32 bit, U = ULEB128 of W, U0/U1 = ULEB128 of W+1\r\n*/\r\n\r\n/* Bytecode dump header. */\r\n#define BCDUMP_HEAD1\t\t0x1b\r\n#define BCDUMP_HEAD2\t\t0x4c\r\n#define BCDUMP_HEAD3\t\t0x4a\r\n\r\n/* If you perform *any* kind of private modifications to the bytecode itself\r\n** or to the dump format, you *must* set BCDUMP_VERSION to 0x80 or higher.\r\n*/\r\n#define BCDUMP_VERSION\t\t2\r\n\r\n/* Compatibility flags. */\r\n#define BCDUMP_F_BE\t\t0x01\r\n#define BCDUMP_F_STRIP\t\t0x02\r\n#define BCDUMP_F_FFI\t\t0x04\r\n#define BCDUMP_F_FR2\t\t0x08\r\n\r\n#define BCDUMP_F_KNOWN\t\t(BCDUMP_F_FR2*2-1)\r\n\r\n/* Type codes for the GC constants of a prototype. Plus length for strings. */\r\nenum {\r\n  BCDUMP_KGC_CHILD, BCDUMP_KGC_TAB, BCDUMP_KGC_I64, BCDUMP_KGC_U64,\r\n  BCDUMP_KGC_COMPLEX, BCDUMP_KGC_STR\r\n};\r\n\r\n/* Type codes for the keys/values of a constant table. */\r\nenum {\r\n  BCDUMP_KTAB_NIL, BCDUMP_KTAB_FALSE, BCDUMP_KTAB_TRUE,\r\n  BCDUMP_KTAB_INT, BCDUMP_KTAB_NUM, BCDUMP_KTAB_STR\r\n};\r\n\r\n/* -- Bytecode reader/writer ---------------------------------------------- */\r\n\r\nLJ_FUNC int lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer,\r\n\t\t       void *data, int strip);\r\nLJ_FUNC GCproto *lj_bcread_proto(LexState *ls);\r\nLJ_FUNC GCproto *lj_bcread(LexState *ls);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_bcread.c",
    "content": "/*\r\n** Bytecode reader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bcread_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lualib.h\"\r\n#endif\r\n#include \"lj_lex.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* Reuse some lexer fields for our own purposes. */\r\n#define bcread_flags(ls)\tls->level\r\n#define bcread_swap(ls) \\\r\n  ((bcread_flags(ls) & BCDUMP_F_BE) != LJ_BE*BCDUMP_F_BE)\r\n#define bcread_oldtop(L, ls)\trestorestack(L, ls->lastline)\r\n#define bcread_savetop(L, ls, top) \\\r\n  ls->lastline = (BCLine)savestack(L, (top))\r\n\r\n/* -- Input buffer handling ----------------------------------------------- */\r\n\r\n/* Throw reader error. */\r\nstatic LJ_NOINLINE void bcread_error(LexState *ls, ErrMsg em)\r\n{\r\n  lua_State *L = ls->L;\r\n  const char *name = ls->chunkarg;\r\n  if (*name == BCDUMP_HEAD1) name = \"(binary)\";\r\n  else if (*name == '@' || *name == '=') name++;\r\n  lj_strfmt_pushf(L, \"%s: %s\", name, err2msg(em));\r\n  lj_err_throw(L, LUA_ERRSYNTAX);\r\n}\r\n\r\n/* Refill buffer. */\r\nstatic LJ_NOINLINE void bcread_fill(LexState *ls, MSize len, int need)\r\n{\r\n  lua_assert(len != 0);\r\n  if (len > LJ_MAX_BUF || ls->c < 0)\r\n    bcread_error(ls, LJ_ERR_BCBAD);\r\n  do {\r\n    const char *buf;\r\n    size_t sz;\r\n    char *p = sbufB(&ls->sb);\r\n    MSize n = (MSize)(ls->pe - ls->p);\r\n    if (n) {  /* Copy remainder to buffer. */\r\n      if (sbuflen(&ls->sb)) {  /* Move down in buffer. */\r\n\tlua_assert(ls->pe == sbufP(&ls->sb));\r\n\tif (ls->p != p) memmove(p, ls->p, n);\r\n      } else {  /* Copy from buffer provided by reader. */\r\n\tp = lj_buf_need(&ls->sb, len);\r\n\tmemcpy(p, ls->p, n);\r\n      }\r\n      ls->p = p;\r\n      ls->pe = p + n;\r\n    }\r\n    setsbufP(&ls->sb, p + n);\r\n    buf = ls->rfunc(ls->L, ls->rdata, &sz);  /* Get more data from reader. */\r\n    if (buf == NULL || sz == 0) {  /* EOF? */\r\n      if (need) bcread_error(ls, LJ_ERR_BCBAD);\r\n      ls->c = -1;  /* Only bad if we get called again. */\r\n      break;\r\n    }\r\n    if (n) {  /* Append to buffer. */\r\n      n += (MSize)sz;\r\n      p = lj_buf_need(&ls->sb, n < len ? len : n);\r\n      memcpy(sbufP(&ls->sb), buf, sz);\r\n      setsbufP(&ls->sb, p + n);\r\n      ls->p = p;\r\n      ls->pe = p + n;\r\n    } else {  /* Return buffer provided by reader. */\r\n      ls->p = buf;\r\n      ls->pe = buf + sz;\r\n    }\r\n  } while (ls->p + len > ls->pe);\r\n}\r\n\r\n/* Need a certain number of bytes. */\r\nstatic LJ_AINLINE void bcread_need(LexState *ls, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ls->p + len > ls->pe))\r\n    bcread_fill(ls, len, 1);\r\n}\r\n\r\n/* Want to read up to a certain number of bytes, but may need less. */\r\nstatic LJ_AINLINE void bcread_want(LexState *ls, MSize len)\r\n{\r\n  if (LJ_UNLIKELY(ls->p + len > ls->pe))\r\n    bcread_fill(ls, len, 0);\r\n}\r\n\r\n/* Return memory block from buffer. */\r\nstatic LJ_AINLINE uint8_t *bcread_mem(LexState *ls, MSize len)\r\n{\r\n  uint8_t *p = (uint8_t *)ls->p;\r\n  ls->p += len;\r\n  lua_assert(ls->p <= ls->pe);\r\n  return p;\r\n}\r\n\r\n/* Copy memory block from buffer. */\r\nstatic void bcread_block(LexState *ls, void *q, MSize len)\r\n{\r\n  memcpy(q, bcread_mem(ls, len), len);\r\n}\r\n\r\n/* Read byte from buffer. */\r\nstatic LJ_AINLINE uint32_t bcread_byte(LexState *ls)\r\n{\r\n  lua_assert(ls->p < ls->pe);\r\n  return (uint32_t)(uint8_t)*ls->p++;\r\n}\r\n\r\n/* Read ULEB128 value from buffer. */\r\nstatic LJ_AINLINE uint32_t bcread_uleb128(LexState *ls)\r\n{\r\n  uint32_t v = lj_buf_ruleb128(&ls->p);\r\n  lua_assert(ls->p <= ls->pe);\r\n  return v;\r\n}\r\n\r\n/* Read top 32 bits of 33 bit ULEB128 value from buffer. */\r\nstatic uint32_t bcread_uleb128_33(LexState *ls)\r\n{\r\n  const uint8_t *p = (const uint8_t *)ls->p;\r\n  uint32_t v = (*p++ >> 1);\r\n  if (LJ_UNLIKELY(v >= 0x40)) {\r\n    int sh = -1;\r\n    v &= 0x3f;\r\n    do {\r\n     v |= ((*p & 0x7f) << (sh += 7));\r\n   } while (*p++ >= 0x80);\r\n  }\r\n  ls->p = (char *)p;\r\n  lua_assert(ls->p <= ls->pe);\r\n  return v;\r\n}\r\n\r\n/* -- Bytecode reader ----------------------------------------------------- */\r\n\r\n/* Read debug info of a prototype. */\r\nstatic void bcread_dbg(LexState *ls, GCproto *pt, MSize sizedbg)\r\n{\r\n  void *lineinfo = (void *)proto_lineinfo(pt);\r\n  bcread_block(ls, lineinfo, sizedbg);\r\n  /* Swap lineinfo if the endianess differs. */\r\n  if (bcread_swap(ls) && pt->numline >= 256) {\r\n    MSize i, n = pt->sizebc-1;\r\n    if (pt->numline < 65536) {\r\n      uint16_t *p = (uint16_t *)lineinfo;\r\n      for (i = 0; i < n; i++) p[i] = (uint16_t)((p[i] >> 8)|(p[i] << 8));\r\n    } else {\r\n      uint32_t *p = (uint32_t *)lineinfo;\r\n      for (i = 0; i < n; i++) p[i] = lj_bswap(p[i]);\r\n    }\r\n  }\r\n}\r\n\r\n/* Find pointer to varinfo. */\r\nstatic const void *bcread_varinfo(GCproto *pt)\r\n{\r\n  const uint8_t *p = proto_uvinfo(pt);\r\n  MSize n = pt->sizeuv;\r\n  if (n) while (*p++ || --n) ;\r\n  return p;\r\n}\r\n\r\n/* Read a single constant key/value of a template table. */\r\nstatic void bcread_ktabk(LexState *ls, TValue *o)\r\n{\r\n  MSize tp = bcread_uleb128(ls);\r\n  if (tp >= BCDUMP_KTAB_STR) {\r\n    MSize len = tp - BCDUMP_KTAB_STR;\r\n    const char *p = (const char *)bcread_mem(ls, len);\r\n    setstrV(ls->L, o, lj_str_new(ls->L, p, len));\r\n  } else if (tp == BCDUMP_KTAB_INT) {\r\n    setintV(o, (int32_t)bcread_uleb128(ls));\r\n  } else if (tp == BCDUMP_KTAB_NUM) {\r\n    o->u32.lo = bcread_uleb128(ls);\r\n    o->u32.hi = bcread_uleb128(ls);\r\n  } else {\r\n    lua_assert(tp <= BCDUMP_KTAB_TRUE);\r\n    setpriV(o, ~tp);\r\n  }\r\n}\r\n\r\n/* Read a template table. */\r\nstatic GCtab *bcread_ktab(LexState *ls)\r\n{\r\n  MSize narray = bcread_uleb128(ls);\r\n  MSize nhash = bcread_uleb128(ls);\r\n  GCtab *t = lj_tab_new(ls->L, narray, hsize2hbits(nhash));\r\n  if (narray) {  /* Read array entries. */\r\n    MSize i;\r\n    TValue *o = tvref(t->array);\r\n    for (i = 0; i < narray; i++, o++)\r\n      bcread_ktabk(ls, o);\r\n  }\r\n  if (nhash) {  /* Read hash entries. */\r\n    MSize i;\r\n    for (i = 0; i < nhash; i++) {\r\n      TValue key;\r\n      bcread_ktabk(ls, &key);\r\n      lua_assert(!tvisnil(&key));\r\n      bcread_ktabk(ls, lj_tab_set(ls->L, t, &key));\r\n    }\r\n  }\r\n  return t;\r\n}\r\n\r\n/* Read GC constants of a prototype. */\r\nstatic void bcread_kgc(LexState *ls, GCproto *pt, MSize sizekgc)\r\n{\r\n  MSize i;\r\n  GCRef *kr = mref(pt->k, GCRef) - (ptrdiff_t)sizekgc;\r\n  for (i = 0; i < sizekgc; i++, kr++) {\r\n    MSize tp = bcread_uleb128(ls);\r\n    if (tp >= BCDUMP_KGC_STR) {\r\n      MSize len = tp - BCDUMP_KGC_STR;\r\n      const char *p = (const char *)bcread_mem(ls, len);\r\n      setgcref(*kr, obj2gco(lj_str_new(ls->L, p, len)));\r\n    } else if (tp == BCDUMP_KGC_TAB) {\r\n      setgcref(*kr, obj2gco(bcread_ktab(ls)));\r\n#if LJ_HASFFI\r\n    } else if (tp != BCDUMP_KGC_CHILD) {\r\n      CTypeID id = tp == BCDUMP_KGC_COMPLEX ? CTID_COMPLEX_DOUBLE :\r\n\t\t   tp == BCDUMP_KGC_I64 ? CTID_INT64 : CTID_UINT64;\r\n      CTSize sz = tp == BCDUMP_KGC_COMPLEX ? 16 : 8;\r\n      GCcdata *cd = lj_cdata_new_(ls->L, id, sz);\r\n      TValue *p = (TValue *)cdataptr(cd);\r\n      setgcref(*kr, obj2gco(cd));\r\n      p[0].u32.lo = bcread_uleb128(ls);\r\n      p[0].u32.hi = bcread_uleb128(ls);\r\n      if (tp == BCDUMP_KGC_COMPLEX) {\r\n\tp[1].u32.lo = bcread_uleb128(ls);\r\n\tp[1].u32.hi = bcread_uleb128(ls);\r\n      }\r\n#endif\r\n    } else {\r\n      lua_State *L = ls->L;\r\n      lua_assert(tp == BCDUMP_KGC_CHILD);\r\n      if (L->top <= bcread_oldtop(L, ls))  /* Stack underflow? */\r\n\tbcread_error(ls, LJ_ERR_BCBAD);\r\n      L->top--;\r\n      setgcref(*kr, obj2gco(protoV(L->top)));\r\n    }\r\n  }\r\n}\r\n\r\n/* Read number constants of a prototype. */\r\nstatic void bcread_knum(LexState *ls, GCproto *pt, MSize sizekn)\r\n{\r\n  MSize i;\r\n  TValue *o = mref(pt->k, TValue);\r\n  for (i = 0; i < sizekn; i++, o++) {\r\n    int isnum = (ls->p[0] & 1);\r\n    uint32_t lo = bcread_uleb128_33(ls);\r\n    if (isnum) {\r\n      o->u32.lo = lo;\r\n      o->u32.hi = bcread_uleb128(ls);\r\n    } else {\r\n      setintV(o, lo);\r\n    }\r\n  }\r\n}\r\n\r\n/* Read bytecode instructions. */\r\nstatic void bcread_bytecode(LexState *ls, GCproto *pt, MSize sizebc)\r\n{\r\n  BCIns *bc = proto_bc(pt);\r\n  bc[0] = BCINS_AD((pt->flags & PROTO_VARARG) ? BC_FUNCV : BC_FUNCF,\r\n\t\t   pt->framesize, 0);\r\n  bcread_block(ls, bc+1, (sizebc-1)*(MSize)sizeof(BCIns));\r\n  /* Swap bytecode instructions if the endianess differs. */\r\n  if (bcread_swap(ls)) {\r\n    MSize i;\r\n    for (i = 1; i < sizebc; i++) bc[i] = lj_bswap(bc[i]);\r\n  }\r\n}\r\n\r\n/* Read upvalue refs. */\r\nstatic void bcread_uv(LexState *ls, GCproto *pt, MSize sizeuv)\r\n{\r\n  if (sizeuv) {\r\n    uint16_t *uv = proto_uv(pt);\r\n    bcread_block(ls, uv, sizeuv*2);\r\n    /* Swap upvalue refs if the endianess differs. */\r\n    if (bcread_swap(ls)) {\r\n      MSize i;\r\n      for (i = 0; i < sizeuv; i++)\r\n\tuv[i] = (uint16_t)((uv[i] >> 8)|(uv[i] << 8));\r\n    }\r\n  }\r\n}\r\n\r\n/* Read a prototype. */\r\nGCproto *lj_bcread_proto(LexState *ls)\r\n{\r\n  GCproto *pt;\r\n  MSize framesize, numparams, flags, sizeuv, sizekgc, sizekn, sizebc, sizept;\r\n  MSize ofsk, ofsuv, ofsdbg;\r\n  MSize sizedbg = 0;\r\n  BCLine firstline = 0, numline = 0;\r\n\r\n  /* Read prototype header. */\r\n  flags = bcread_byte(ls);\r\n  numparams = bcread_byte(ls);\r\n  framesize = bcread_byte(ls);\r\n  sizeuv = bcread_byte(ls);\r\n  sizekgc = bcread_uleb128(ls);\r\n  sizekn = bcread_uleb128(ls);\r\n  sizebc = bcread_uleb128(ls) + 1;\r\n  if (!(bcread_flags(ls) & BCDUMP_F_STRIP)) {\r\n    sizedbg = bcread_uleb128(ls);\r\n    if (sizedbg) {\r\n      firstline = bcread_uleb128(ls);\r\n      numline = bcread_uleb128(ls);\r\n    }\r\n  }\r\n\r\n  /* Calculate total size of prototype including all colocated arrays. */\r\n  sizept = (MSize)sizeof(GCproto) +\r\n\t   sizebc*(MSize)sizeof(BCIns) +\r\n\t   sizekgc*(MSize)sizeof(GCRef);\r\n  sizept = (sizept + (MSize)sizeof(TValue)-1) & ~((MSize)sizeof(TValue)-1);\r\n  ofsk = sizept; sizept += sizekn*(MSize)sizeof(TValue);\r\n  ofsuv = sizept; sizept += ((sizeuv+1)&~1)*2;\r\n  ofsdbg = sizept; sizept += sizedbg;\r\n\r\n  /* Allocate prototype object and initialize its fields. */\r\n  pt = (GCproto *)lj_mem_newgco(ls->L, (MSize)sizept);\r\n  pt->gct = ~LJ_TPROTO;\r\n  pt->numparams = (uint8_t)numparams;\r\n  pt->framesize = (uint8_t)framesize;\r\n  pt->sizebc = sizebc;\r\n  setmref(pt->k, (char *)pt + ofsk);\r\n  setmref(pt->uv, (char *)pt + ofsuv);\r\n  pt->sizekgc = 0;  /* Set to zero until fully initialized. */\r\n  pt->sizekn = sizekn;\r\n  pt->sizept = sizept;\r\n  pt->sizeuv = (uint8_t)sizeuv;\r\n  pt->flags = (uint8_t)flags;\r\n  pt->trace = 0;\r\n  setgcref(pt->chunkname, obj2gco(ls->chunkname));\r\n\r\n  /* Close potentially uninitialized gap between bc and kgc. */\r\n  *(uint32_t *)((char *)pt + ofsk - sizeof(GCRef)*(sizekgc+1)) = 0;\r\n\r\n  /* Read bytecode instructions and upvalue refs. */\r\n  bcread_bytecode(ls, pt, sizebc);\r\n  bcread_uv(ls, pt, sizeuv);\r\n\r\n  /* Read constants. */\r\n  bcread_kgc(ls, pt, sizekgc);\r\n  pt->sizekgc = sizekgc;\r\n  bcread_knum(ls, pt, sizekn);\r\n\r\n  /* Read and initialize debug info. */\r\n  pt->firstline = firstline;\r\n  pt->numline = numline;\r\n  if (sizedbg) {\r\n    MSize sizeli = (sizebc-1) << (numline < 256 ? 0 : numline < 65536 ? 1 : 2);\r\n    setmref(pt->lineinfo, (char *)pt + ofsdbg);\r\n    setmref(pt->uvinfo, (char *)pt + ofsdbg + sizeli);\r\n    bcread_dbg(ls, pt, sizedbg);\r\n    setmref(pt->varinfo, bcread_varinfo(pt));\r\n  } else {\r\n    setmref(pt->lineinfo, NULL);\r\n    setmref(pt->uvinfo, NULL);\r\n    setmref(pt->varinfo, NULL);\r\n  }\r\n  return pt;\r\n}\r\n\r\n/* Read and check header of bytecode dump. */\r\nstatic int bcread_header(LexState *ls)\r\n{\r\n  uint32_t flags;\r\n  bcread_want(ls, 3+5+5);\r\n  if (bcread_byte(ls) != BCDUMP_HEAD2 ||\r\n      bcread_byte(ls) != BCDUMP_HEAD3 ||\r\n      bcread_byte(ls) != BCDUMP_VERSION) return 0;\r\n  bcread_flags(ls) = flags = bcread_uleb128(ls);\r\n  if ((flags & ~(BCDUMP_F_KNOWN)) != 0) return 0;\r\n  if ((flags & BCDUMP_F_FR2) != LJ_FR2*BCDUMP_F_FR2) return 0;\r\n  if ((flags & BCDUMP_F_FFI)) {\r\n#if LJ_HASFFI\r\n    lua_State *L = ls->L;\r\n    if (!ctype_ctsG(G(L))) {\r\n      ptrdiff_t oldtop = savestack(L, L->top);\r\n      luaopen_ffi(L);  /* Load FFI library on-demand. */\r\n      L->top = restorestack(L, oldtop);\r\n    }\r\n#else\r\n    return 0;\r\n#endif\r\n  }\r\n  if ((flags & BCDUMP_F_STRIP)) {\r\n    ls->chunkname = lj_str_newz(ls->L, ls->chunkarg);\r\n  } else {\r\n    MSize len = bcread_uleb128(ls);\r\n    bcread_need(ls, len);\r\n    ls->chunkname = lj_str_new(ls->L, (const char *)bcread_mem(ls, len), len);\r\n  }\r\n  return 1;  /* Ok. */\r\n}\r\n\r\n/* Read a bytecode dump. */\r\nGCproto *lj_bcread(LexState *ls)\r\n{\r\n  lua_State *L = ls->L;\r\n  lua_assert(ls->c == BCDUMP_HEAD1);\r\n  bcread_savetop(L, ls, L->top);\r\n  lj_buf_reset(&ls->sb);\r\n  /* Check for a valid bytecode dump header. */\r\n  if (!bcread_header(ls))\r\n    bcread_error(ls, LJ_ERR_BCFMT);\r\n  for (;;) {  /* Process all prototypes in the bytecode dump. */\r\n    GCproto *pt;\r\n    MSize len;\r\n    const char *startp;\r\n    /* Read length. */\r\n    if (ls->p < ls->pe && ls->p[0] == 0) {  /* Shortcut EOF. */\r\n      ls->p++;\r\n      break;\r\n    }\r\n    bcread_want(ls, 5);\r\n    len = bcread_uleb128(ls);\r\n    if (!len) break;  /* EOF */\r\n    bcread_need(ls, len);\r\n    startp = ls->p;\r\n    pt = lj_bcread_proto(ls);\r\n    if (ls->p != startp + len)\r\n      bcread_error(ls, LJ_ERR_BCBAD);\r\n    setprotoV(L, L->top, pt);\r\n    incr_top(L);\r\n  }\r\n  if ((int32_t)(2*(uint32_t)(ls->pe - ls->p)) > 0 ||\r\n      L->top-1 != bcread_oldtop(L, ls))\r\n    bcread_error(ls, LJ_ERR_BCBAD);\r\n  /* Pop off last prototype. */\r\n  L->top--;\r\n  return protoV(L->top);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_bcwrite.c",
    "content": "/*\r\n** Bytecode writer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_bcwrite_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#if LJ_HASJIT\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_jit.h\"\r\n#endif\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Context for bytecode writer. */\r\ntypedef struct BCWriteCtx {\r\n  SBuf sb;\t\t\t/* Output buffer. */\r\n  GCproto *pt;\t\t\t/* Root prototype. */\r\n  lua_Writer wfunc;\t\t/* Writer callback. */\r\n  void *wdata;\t\t\t/* Writer callback data. */\r\n  int strip;\t\t\t/* Strip debug info. */\r\n  int status;\t\t\t/* Status from writer callback. */\r\n} BCWriteCtx;\r\n\r\n/* -- Bytecode writer ----------------------------------------------------- */\r\n\r\n/* Write a single constant key/value of a template table. */\r\nstatic void bcwrite_ktabk(BCWriteCtx *ctx, cTValue *o, int narrow)\r\n{\r\n  char *p = lj_buf_more(&ctx->sb, 1+10);\r\n  if (tvisstr(o)) {\r\n    const GCstr *str = strV(o);\r\n    MSize len = str->len;\r\n    p = lj_buf_more(&ctx->sb, 5+len);\r\n    p = lj_strfmt_wuleb128(p, BCDUMP_KTAB_STR+len);\r\n    p = lj_buf_wmem(p, strdata(str), len);\r\n  } else if (tvisint(o)) {\r\n    *p++ = BCDUMP_KTAB_INT;\r\n    p = lj_strfmt_wuleb128(p, intV(o));\r\n  } else if (tvisnum(o)) {\r\n    if (!LJ_DUALNUM && narrow) {  /* Narrow number constants to integers. */\r\n      lua_Number num = numV(o);\r\n      int32_t k = lj_num2int(num);\r\n      if (num == (lua_Number)k) {  /* -0 is never a constant. */\r\n\t*p++ = BCDUMP_KTAB_INT;\r\n\tp = lj_strfmt_wuleb128(p, k);\r\n\tsetsbufP(&ctx->sb, p);\r\n\treturn;\r\n      }\r\n    }\r\n    *p++ = BCDUMP_KTAB_NUM;\r\n    p = lj_strfmt_wuleb128(p, o->u32.lo);\r\n    p = lj_strfmt_wuleb128(p, o->u32.hi);\r\n  } else {\r\n    lua_assert(tvispri(o));\r\n    *p++ = BCDUMP_KTAB_NIL+~itype(o);\r\n  }\r\n  setsbufP(&ctx->sb, p);\r\n}\r\n\r\n/* Write a template table. */\r\nstatic void bcwrite_ktab(BCWriteCtx *ctx, char *p, const GCtab *t)\r\n{\r\n  MSize narray = 0, nhash = 0;\r\n  if (t->asize > 0) {  /* Determine max. length of array part. */\r\n    ptrdiff_t i;\r\n    TValue *array = tvref(t->array);\r\n    for (i = (ptrdiff_t)t->asize-1; i >= 0; i--)\r\n      if (!tvisnil(&array[i]))\r\n\tbreak;\r\n    narray = (MSize)(i+1);\r\n  }\r\n  if (t->hmask > 0) {  /* Count number of used hash slots. */\r\n    MSize i, hmask = t->hmask;\r\n    Node *node = noderef(t->node);\r\n    for (i = 0; i <= hmask; i++)\r\n      nhash += !tvisnil(&node[i].val);\r\n  }\r\n  /* Write number of array slots and hash slots. */\r\n  p = lj_strfmt_wuleb128(p, narray);\r\n  p = lj_strfmt_wuleb128(p, nhash);\r\n  setsbufP(&ctx->sb, p);\r\n  if (narray) {  /* Write array entries (may contain nil). */\r\n    MSize i;\r\n    TValue *o = tvref(t->array);\r\n    for (i = 0; i < narray; i++, o++)\r\n      bcwrite_ktabk(ctx, o, 1);\r\n  }\r\n  if (nhash) {  /* Write hash entries. */\r\n    MSize i = nhash;\r\n    Node *node = noderef(t->node) + t->hmask;\r\n    for (;; node--)\r\n      if (!tvisnil(&node->val)) {\r\n\tbcwrite_ktabk(ctx, &node->key, 0);\r\n\tbcwrite_ktabk(ctx, &node->val, 1);\r\n\tif (--i == 0) break;\r\n      }\r\n  }\r\n}\r\n\r\n/* Write GC constants of a prototype. */\r\nstatic void bcwrite_kgc(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize i, sizekgc = pt->sizekgc;\r\n  GCRef *kr = mref(pt->k, GCRef) - (ptrdiff_t)sizekgc;\r\n  for (i = 0; i < sizekgc; i++, kr++) {\r\n    GCobj *o = gcref(*kr);\r\n    MSize tp, need = 1;\r\n    char *p;\r\n    /* Determine constant type and needed size. */\r\n    if (o->gch.gct == ~LJ_TSTR) {\r\n      tp = BCDUMP_KGC_STR + gco2str(o)->len;\r\n      need = 5+gco2str(o)->len;\r\n    } else if (o->gch.gct == ~LJ_TPROTO) {\r\n      lua_assert((pt->flags & PROTO_CHILD));\r\n      tp = BCDUMP_KGC_CHILD;\r\n#if LJ_HASFFI\r\n    } else if (o->gch.gct == ~LJ_TCDATA) {\r\n      CTypeID id = gco2cd(o)->ctypeid;\r\n      need = 1+4*5;\r\n      if (id == CTID_INT64) {\r\n\ttp = BCDUMP_KGC_I64;\r\n      } else if (id == CTID_UINT64) {\r\n\ttp = BCDUMP_KGC_U64;\r\n      } else {\r\n\tlua_assert(id == CTID_COMPLEX_DOUBLE);\r\n\ttp = BCDUMP_KGC_COMPLEX;\r\n      }\r\n#endif\r\n    } else {\r\n      lua_assert(o->gch.gct == ~LJ_TTAB);\r\n      tp = BCDUMP_KGC_TAB;\r\n      need = 1+2*5;\r\n    }\r\n    /* Write constant type. */\r\n    p = lj_buf_more(&ctx->sb, need);\r\n    p = lj_strfmt_wuleb128(p, tp);\r\n    /* Write constant data (if any). */\r\n    if (tp >= BCDUMP_KGC_STR) {\r\n      p = lj_buf_wmem(p, strdata(gco2str(o)), gco2str(o)->len);\r\n    } else if (tp == BCDUMP_KGC_TAB) {\r\n      bcwrite_ktab(ctx, p, gco2tab(o));\r\n      continue;\r\n#if LJ_HASFFI\r\n    } else if (tp != BCDUMP_KGC_CHILD) {\r\n      cTValue *q = (TValue *)cdataptr(gco2cd(o));\r\n      p = lj_strfmt_wuleb128(p, q[0].u32.lo);\r\n      p = lj_strfmt_wuleb128(p, q[0].u32.hi);\r\n      if (tp == BCDUMP_KGC_COMPLEX) {\r\n\tp = lj_strfmt_wuleb128(p, q[1].u32.lo);\r\n\tp = lj_strfmt_wuleb128(p, q[1].u32.hi);\r\n      }\r\n#endif\r\n    }\r\n    setsbufP(&ctx->sb, p);\r\n  }\r\n}\r\n\r\n/* Write number constants of a prototype. */\r\nstatic void bcwrite_knum(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize i, sizekn = pt->sizekn;\r\n  cTValue *o = mref(pt->k, TValue);\r\n  char *p = lj_buf_more(&ctx->sb, 10*sizekn);\r\n  for (i = 0; i < sizekn; i++, o++) {\r\n    int32_t k;\r\n    if (tvisint(o)) {\r\n      k = intV(o);\r\n      goto save_int;\r\n    } else {\r\n      /* Write a 33 bit ULEB128 for the int (lsb=0) or loword (lsb=1). */\r\n      if (!LJ_DUALNUM) {  /* Narrow number constants to integers. */\r\n\tlua_Number num = numV(o);\r\n\tk = lj_num2int(num);\r\n\tif (num == (lua_Number)k) {  /* -0 is never a constant. */\r\n\tsave_int:\r\n\t  p = lj_strfmt_wuleb128(p, 2*(uint32_t)k | ((uint32_t)k&0x80000000u));\r\n\t  if (k < 0)\r\n\t    p[-1] = (p[-1] & 7) | ((k>>27) & 0x18);\r\n\t  continue;\r\n\t}\r\n      }\r\n      p = lj_strfmt_wuleb128(p, 1+(2*o->u32.lo | (o->u32.lo & 0x80000000u)));\r\n      if (o->u32.lo >= 0x80000000u)\r\n\tp[-1] = (p[-1] & 7) | ((o->u32.lo>>27) & 0x18);\r\n      p = lj_strfmt_wuleb128(p, o->u32.hi);\r\n    }\r\n  }\r\n  setsbufP(&ctx->sb, p);\r\n}\r\n\r\n/* Write bytecode instructions. */\r\nstatic char *bcwrite_bytecode(BCWriteCtx *ctx, char *p, GCproto *pt)\r\n{\r\n  MSize nbc = pt->sizebc-1;  /* Omit the [JI]FUNC* header. */\r\n#if LJ_HASJIT\r\n  uint8_t *q = (uint8_t *)p;\r\n#endif\r\n  p = lj_buf_wmem(p, proto_bc(pt)+1, nbc*(MSize)sizeof(BCIns));\r\n  UNUSED(ctx);\r\n#if LJ_HASJIT\r\n  /* Unpatch modified bytecode containing ILOOP/JLOOP etc. */\r\n  if ((pt->flags & PROTO_ILOOP) || pt->trace) {\r\n    jit_State *J = L2J(sbufL(&ctx->sb));\r\n    MSize i;\r\n    for (i = 0; i < nbc; i++, q += sizeof(BCIns)) {\r\n      BCOp op = (BCOp)q[LJ_ENDIAN_SELECT(0, 3)];\r\n      if (op == BC_IFORL || op == BC_IITERL || op == BC_ILOOP ||\r\n\t  op == BC_JFORI) {\r\n\tq[LJ_ENDIAN_SELECT(0, 3)] = (uint8_t)(op-BC_IFORL+BC_FORL);\r\n      } else if (op == BC_JFORL || op == BC_JITERL || op == BC_JLOOP) {\r\n\tBCReg rd = q[LJ_ENDIAN_SELECT(2, 1)] + (q[LJ_ENDIAN_SELECT(3, 0)] << 8);\r\n\tBCIns ins = traceref(J, rd)->startins;\r\n\tq[LJ_ENDIAN_SELECT(0, 3)] = (uint8_t)(op-BC_JFORL+BC_FORL);\r\n\tq[LJ_ENDIAN_SELECT(2, 1)] = bc_c(ins);\r\n\tq[LJ_ENDIAN_SELECT(3, 0)] = bc_b(ins);\r\n      }\r\n    }\r\n  }\r\n#endif\r\n  return p;\r\n}\r\n\r\n/* Write prototype. */\r\nstatic void bcwrite_proto(BCWriteCtx *ctx, GCproto *pt)\r\n{\r\n  MSize sizedbg = 0;\r\n  char *p;\r\n\r\n  /* Recursively write children of prototype. */\r\n  if ((pt->flags & PROTO_CHILD)) {\r\n    ptrdiff_t i, n = pt->sizekgc;\r\n    GCRef *kr = mref(pt->k, GCRef) - 1;\r\n    for (i = 0; i < n; i++, kr--) {\r\n      GCobj *o = gcref(*kr);\r\n      if (o->gch.gct == ~LJ_TPROTO)\r\n\tbcwrite_proto(ctx, gco2pt(o));\r\n    }\r\n  }\r\n\r\n  /* Start writing the prototype info to a buffer. */\r\n  p = lj_buf_need(&ctx->sb,\r\n\t\t  5+4+6*5+(pt->sizebc-1)*(MSize)sizeof(BCIns)+pt->sizeuv*2);\r\n  p += 5;  /* Leave room for final size. */\r\n\r\n  /* Write prototype header. */\r\n  *p++ = (pt->flags & (PROTO_CHILD|PROTO_VARARG|PROTO_FFI));\r\n  *p++ = pt->numparams;\r\n  *p++ = pt->framesize;\r\n  *p++ = pt->sizeuv;\r\n  p = lj_strfmt_wuleb128(p, pt->sizekgc);\r\n  p = lj_strfmt_wuleb128(p, pt->sizekn);\r\n  p = lj_strfmt_wuleb128(p, pt->sizebc-1);\r\n  if (!ctx->strip) {\r\n    if (proto_lineinfo(pt))\r\n      sizedbg = pt->sizept - (MSize)((char *)proto_lineinfo(pt) - (char *)pt);\r\n    p = lj_strfmt_wuleb128(p, sizedbg);\r\n    if (sizedbg) {\r\n      p = lj_strfmt_wuleb128(p, pt->firstline);\r\n      p = lj_strfmt_wuleb128(p, pt->numline);\r\n    }\r\n  }\r\n\r\n  /* Write bytecode instructions and upvalue refs. */\r\n  p = bcwrite_bytecode(ctx, p, pt);\r\n  p = lj_buf_wmem(p, proto_uv(pt), pt->sizeuv*2);\r\n  setsbufP(&ctx->sb, p);\r\n\r\n  /* Write constants. */\r\n  bcwrite_kgc(ctx, pt);\r\n  bcwrite_knum(ctx, pt);\r\n\r\n  /* Write debug info, if not stripped. */\r\n  if (sizedbg) {\r\n    p = lj_buf_more(&ctx->sb, sizedbg);\r\n    p = lj_buf_wmem(p, proto_lineinfo(pt), sizedbg);\r\n    setsbufP(&ctx->sb, p);\r\n  }\r\n\r\n  /* Pass buffer to writer function. */\r\n  if (ctx->status == 0) {\r\n    MSize n = sbuflen(&ctx->sb) - 5;\r\n    MSize nn = (lj_fls(n)+8)*9 >> 6;\r\n    char *q = sbufB(&ctx->sb) + (5 - nn);\r\n    p = lj_strfmt_wuleb128(q, n);  /* Fill in final size. */\r\n    lua_assert(p == sbufB(&ctx->sb) + 5);\r\n    ctx->status = ctx->wfunc(sbufL(&ctx->sb), q, nn+n, ctx->wdata);\r\n  }\r\n}\r\n\r\n/* Write header of bytecode dump. */\r\nstatic void bcwrite_header(BCWriteCtx *ctx)\r\n{\r\n  GCstr *chunkname = proto_chunkname(ctx->pt);\r\n  const char *name = strdata(chunkname);\r\n  MSize len = chunkname->len;\r\n  char *p = lj_buf_need(&ctx->sb, 5+5+len);\r\n  *p++ = BCDUMP_HEAD1;\r\n  *p++ = BCDUMP_HEAD2;\r\n  *p++ = BCDUMP_HEAD3;\r\n  *p++ = BCDUMP_VERSION;\r\n  *p++ = (ctx->strip ? BCDUMP_F_STRIP : 0) +\r\n\t LJ_BE*BCDUMP_F_BE +\r\n\t ((ctx->pt->flags & PROTO_FFI) ? BCDUMP_F_FFI : 0) +\r\n\t LJ_FR2*BCDUMP_F_FR2;\r\n  if (!ctx->strip) {\r\n    p = lj_strfmt_wuleb128(p, len);\r\n    p = lj_buf_wmem(p, name, len);\r\n  }\r\n  ctx->status = ctx->wfunc(sbufL(&ctx->sb), sbufB(&ctx->sb),\r\n\t\t\t   (MSize)(p - sbufB(&ctx->sb)), ctx->wdata);\r\n}\r\n\r\n/* Write footer of bytecode dump. */\r\nstatic void bcwrite_footer(BCWriteCtx *ctx)\r\n{\r\n  if (ctx->status == 0) {\r\n    uint8_t zero = 0;\r\n    ctx->status = ctx->wfunc(sbufL(&ctx->sb), &zero, 1, ctx->wdata);\r\n  }\r\n}\r\n\r\n/* Protected callback for bytecode writer. */\r\nstatic TValue *cpwriter(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  BCWriteCtx *ctx = (BCWriteCtx *)ud;\r\n  UNUSED(L); UNUSED(dummy);\r\n  lj_buf_need(&ctx->sb, 1024);  /* Avoids resize for most prototypes. */\r\n  bcwrite_header(ctx);\r\n  bcwrite_proto(ctx, ctx->pt);\r\n  bcwrite_footer(ctx);\r\n  return NULL;\r\n}\r\n\r\n/* Write bytecode for a prototype. */\r\nint lj_bcwrite(lua_State *L, GCproto *pt, lua_Writer writer, void *data,\r\n\t      int strip)\r\n{\r\n  BCWriteCtx ctx;\r\n  int status;\r\n  ctx.pt = pt;\r\n  ctx.wfunc = writer;\r\n  ctx.wdata = data;\r\n  ctx.strip = strip;\r\n  ctx.status = 0;\r\n  lj_buf_init(L, &ctx.sb);\r\n  status = lj_vm_cpcall(L, NULL, &ctx, cpwriter);\r\n  if (status == 0) status = ctx.status;\r\n  lj_buf_free(G(sbufL(&ctx.sb)), &ctx.sb);\r\n  return status;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_buf.c",
    "content": "/*\r\n** Buffer handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_buf_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* -- Buffer management --------------------------------------------------- */\r\n\r\nstatic void buf_grow(SBuf *sb, MSize sz)\r\n{\r\n  MSize osz = sbufsz(sb), len = sbuflen(sb), nsz = osz;\r\n  char *b;\r\n  if (nsz < LJ_MIN_SBUF) nsz = LJ_MIN_SBUF;\r\n  while (nsz < sz) nsz += nsz;\r\n  b = (char *)lj_mem_realloc(sbufL(sb), sbufB(sb), osz, nsz);\r\n  setmref(sb->b, b);\r\n  setmref(sb->p, b + len);\r\n  setmref(sb->e, b + nsz);\r\n}\r\n\r\nLJ_NOINLINE char *LJ_FASTCALL lj_buf_need2(SBuf *sb, MSize sz)\r\n{\r\n  lua_assert(sz > sbufsz(sb));\r\n  if (LJ_UNLIKELY(sz > LJ_MAX_BUF))\r\n    lj_err_mem(sbufL(sb));\r\n  buf_grow(sb, sz);\r\n  return sbufB(sb);\r\n}\r\n\r\nLJ_NOINLINE char *LJ_FASTCALL lj_buf_more2(SBuf *sb, MSize sz)\r\n{\r\n  MSize len = sbuflen(sb);\r\n  lua_assert(sz > sbufleft(sb));\r\n  if (LJ_UNLIKELY(sz > LJ_MAX_BUF || len + sz > LJ_MAX_BUF))\r\n    lj_err_mem(sbufL(sb));\r\n  buf_grow(sb, len + sz);\r\n  return sbufP(sb);\r\n}\r\n\r\nvoid LJ_FASTCALL lj_buf_shrink(lua_State *L, SBuf *sb)\r\n{\r\n  char *b = sbufB(sb);\r\n  MSize osz = (MSize)(sbufE(sb) - b);\r\n  if (osz > 2*LJ_MIN_SBUF) {\r\n    MSize n = (MSize)(sbufP(sb) - b);\r\n    b = lj_mem_realloc(L, b, osz, (osz >> 1));\r\n    setmref(sb->b, b);\r\n    setmref(sb->p, b + n);\r\n    setmref(sb->e, b + (osz >> 1));\r\n  }\r\n}\r\n\r\nchar * LJ_FASTCALL lj_buf_tmp(lua_State *L, MSize sz)\r\n{\r\n  SBuf *sb = &G(L)->tmpbuf;\r\n  setsbufL(sb, L);\r\n  return lj_buf_need(sb, sz);\r\n}\r\n\r\n/* -- Low-level buffer put operations ------------------------------------- */\r\n\r\nSBuf *lj_buf_putmem(SBuf *sb, const void *q, MSize len)\r\n{\r\n  char *p = lj_buf_more(sb, len);\r\n  p = lj_buf_wmem(p, q, len);\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\n#if LJ_HASJIT\r\nSBuf * LJ_FASTCALL lj_buf_putchar(SBuf *sb, int c)\r\n{\r\n  char *p = lj_buf_more(sb, 1);\r\n  *p++ = (char)c;\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n#endif\r\n\r\nSBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s)\r\n{\r\n  MSize len = s->len;\r\n  char *p = lj_buf_more(sb, len);\r\n  p = lj_buf_wmem(p, strdata(s), len);\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\n/* -- High-level buffer put operations ------------------------------------ */\r\n\r\nSBuf * LJ_FASTCALL lj_buf_putstr_reverse(SBuf *sb, GCstr *s)\r\n{\r\n  MSize len = s->len;\r\n  char *p = lj_buf_more(sb, len), *e = p+len;\r\n  const char *q = strdata(s)+len-1;\r\n  while (p < e)\r\n    *p++ = *q--;\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\nSBuf * LJ_FASTCALL lj_buf_putstr_lower(SBuf *sb, GCstr *s)\r\n{\r\n  MSize len = s->len;\r\n  char *p = lj_buf_more(sb, len), *e = p+len;\r\n  const char *q = strdata(s);\r\n  for (; p < e; p++, q++) {\r\n    uint32_t c = *(unsigned char *)q;\r\n#if LJ_TARGET_PPC\r\n    *p = c + ((c >= 'A' && c <= 'Z') << 5);\r\n#else\r\n    if (c >= 'A' && c <= 'Z') c += 0x20;\r\n    *p = c;\r\n#endif\r\n  }\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\nSBuf * LJ_FASTCALL lj_buf_putstr_upper(SBuf *sb, GCstr *s)\r\n{\r\n  MSize len = s->len;\r\n  char *p = lj_buf_more(sb, len), *e = p+len;\r\n  const char *q = strdata(s);\r\n  for (; p < e; p++, q++) {\r\n    uint32_t c = *(unsigned char *)q;\r\n#if LJ_TARGET_PPC\r\n    *p = c - ((c >= 'a' && c <= 'z') << 5);\r\n#else\r\n    if (c >= 'a' && c <= 'z') c -= 0x20;\r\n    *p = c;\r\n#endif\r\n  }\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\nSBuf *lj_buf_putstr_rep(SBuf *sb, GCstr *s, int32_t rep)\r\n{\r\n  MSize len = s->len;\r\n  if (rep > 0 && len) {\r\n    uint64_t tlen = (uint64_t)rep * len;\r\n    char *p;\r\n    if (LJ_UNLIKELY(tlen > LJ_MAX_STR))\r\n      lj_err_mem(sbufL(sb));\r\n    p = lj_buf_more(sb, (MSize)tlen);\r\n    if (len == 1) {  /* Optimize a common case. */\r\n      uint32_t c = strdata(s)[0];\r\n      do { *p++ = c; } while (--rep > 0);\r\n    } else {\r\n      const char *e = strdata(s) + len;\r\n      do {\r\n\tconst char *q = strdata(s);\r\n\tdo { *p++ = *q++; } while (q < e);\r\n      } while (--rep > 0);\r\n    }\r\n    setsbufP(sb, p);\r\n  }\r\n  return sb;\r\n}\r\n\r\nSBuf *lj_buf_puttab(SBuf *sb, GCtab *t, GCstr *sep, int32_t i, int32_t e)\r\n{\r\n  MSize seplen = sep ? sep->len : 0;\r\n  if (i <= e) {\r\n    for (;;) {\r\n      cTValue *o = lj_tab_getint(t, i);\r\n      char *p;\r\n      if (!o) {\r\n      badtype:  /* Error: bad element type. */\r\n\tsetsbufP(sb, (void *)(intptr_t)i);  /* Store failing index. */\r\n\treturn NULL;\r\n      } else if (tvisstr(o)) {\r\n\tMSize len = strV(o)->len;\r\n\tp = lj_buf_wmem(lj_buf_more(sb, len + seplen), strVdata(o), len);\r\n      } else if (tvisint(o)) {\r\n\tp = lj_strfmt_wint(lj_buf_more(sb, STRFMT_MAXBUF_INT+seplen), intV(o));\r\n      } else if (tvisnum(o)) {\r\n\tp = lj_strfmt_wnum(lj_buf_more(sb, STRFMT_MAXBUF_NUM+seplen), o);\r\n      } else {\r\n\tgoto badtype;\r\n      }\r\n      if (i++ == e) {\r\n\tsetsbufP(sb, p);\r\n\tbreak;\r\n      }\r\n      if (seplen) p = lj_buf_wmem(p, strdata(sep), seplen);\r\n      setsbufP(sb, p);\r\n    }\r\n  }\r\n  return sb;\r\n}\r\n\r\n/* -- Miscellaneous buffer operations ------------------------------------- */\r\n\r\nGCstr * LJ_FASTCALL lj_buf_tostr(SBuf *sb)\r\n{\r\n  return lj_str_new(sbufL(sb), sbufB(sb), sbuflen(sb));\r\n}\r\n\r\n/* Concatenate two strings. */\r\nGCstr *lj_buf_cat2str(lua_State *L, GCstr *s1, GCstr *s2)\r\n{\r\n  MSize len1 = s1->len, len2 = s2->len;\r\n  char *buf = lj_buf_tmp(L, len1 + len2);\r\n  memcpy(buf, strdata(s1), len1);\r\n  memcpy(buf+len1, strdata(s2), len2);\r\n  return lj_str_new(L, buf, len1 + len2);\r\n}\r\n\r\n/* Read ULEB128 from buffer. */\r\nuint32_t LJ_FASTCALL lj_buf_ruleb128(const char **pp)\r\n{\r\n  const uint8_t *p = (const uint8_t *)*pp;\r\n  uint32_t v = *p++;\r\n  if (LJ_UNLIKELY(v >= 0x80)) {\r\n    int sh = 0;\r\n    v &= 0x7f;\r\n    do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80);\r\n  }\r\n  *pp = (const char *)p;\r\n  return v;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_buf.h",
    "content": "/*\r\n** Buffer handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_BUF_H\r\n#define _LJ_BUF_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_str.h\"\r\n\r\n/* Resizable string buffers. Struct definition in lj_obj.h. */\r\n#define sbufB(sb)\t(mref((sb)->b, char))\r\n#define sbufP(sb)\t(mref((sb)->p, char))\r\n#define sbufE(sb)\t(mref((sb)->e, char))\r\n#define sbufL(sb)\t(mref((sb)->L, lua_State))\r\n#define sbufsz(sb)\t((MSize)(sbufE((sb)) - sbufB((sb))))\r\n#define sbuflen(sb)\t((MSize)(sbufP((sb)) - sbufB((sb))))\r\n#define sbufleft(sb)\t((MSize)(sbufE((sb)) - sbufP((sb))))\r\n#define setsbufP(sb, q)\t(setmref((sb)->p, (q)))\r\n#define setsbufL(sb, l)\t(setmref((sb)->L, (l)))\r\n\r\n/* Buffer management */\r\nLJ_FUNC char *LJ_FASTCALL lj_buf_need2(SBuf *sb, MSize sz);\r\nLJ_FUNC char *LJ_FASTCALL lj_buf_more2(SBuf *sb, MSize sz);\r\nLJ_FUNC void LJ_FASTCALL lj_buf_shrink(lua_State *L, SBuf *sb);\r\nLJ_FUNC char * LJ_FASTCALL lj_buf_tmp(lua_State *L, MSize sz);\r\n\r\nstatic LJ_AINLINE void lj_buf_init(lua_State *L, SBuf *sb)\r\n{\r\n  setsbufL(sb, L);\r\n  setmref(sb->p, NULL); setmref(sb->e, NULL); setmref(sb->b, NULL);\r\n}\r\n\r\nstatic LJ_AINLINE void lj_buf_reset(SBuf *sb)\r\n{\r\n  setmrefr(sb->p, sb->b);\r\n}\r\n\r\nstatic LJ_AINLINE SBuf *lj_buf_tmp_(lua_State *L)\r\n{\r\n  SBuf *sb = &G(L)->tmpbuf;\r\n  setsbufL(sb, L);\r\n  lj_buf_reset(sb);\r\n  return sb;\r\n}\r\n\r\nstatic LJ_AINLINE void lj_buf_free(global_State *g, SBuf *sb)\r\n{\r\n  lj_mem_free(g, sbufB(sb), sbufsz(sb));\r\n}\r\n\r\nstatic LJ_AINLINE char *lj_buf_need(SBuf *sb, MSize sz)\r\n{\r\n  if (LJ_UNLIKELY(sz > sbufsz(sb)))\r\n    return lj_buf_need2(sb, sz);\r\n  return sbufB(sb);\r\n}\r\n\r\nstatic LJ_AINLINE char *lj_buf_more(SBuf *sb, MSize sz)\r\n{\r\n  if (LJ_UNLIKELY(sz > sbufleft(sb)))\r\n    return lj_buf_more2(sb, sz);\r\n  return sbufP(sb);\r\n}\r\n\r\n/* Low-level buffer put operations */\r\nLJ_FUNC SBuf *lj_buf_putmem(SBuf *sb, const void *q, MSize len);\r\n#if LJ_HASJIT\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_buf_putchar(SBuf *sb, int c);\r\n#endif\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s);\r\n\r\nstatic LJ_AINLINE char *lj_buf_wmem(char *p, const void *q, MSize len)\r\n{\r\n  return (char *)memcpy(p, q, len) + len;\r\n}\r\n\r\nstatic LJ_AINLINE void lj_buf_putb(SBuf *sb, int c)\r\n{\r\n  char *p = lj_buf_more(sb, 1);\r\n  *p++ = (char)c;\r\n  setsbufP(sb, p);\r\n}\r\n\r\n/* High-level buffer put operations */\r\nLJ_FUNCA SBuf * LJ_FASTCALL lj_buf_putstr_reverse(SBuf *sb, GCstr *s);\r\nLJ_FUNCA SBuf * LJ_FASTCALL lj_buf_putstr_lower(SBuf *sb, GCstr *s);\r\nLJ_FUNCA SBuf * LJ_FASTCALL lj_buf_putstr_upper(SBuf *sb, GCstr *s);\r\nLJ_FUNC SBuf *lj_buf_putstr_rep(SBuf *sb, GCstr *s, int32_t rep);\r\nLJ_FUNC SBuf *lj_buf_puttab(SBuf *sb, GCtab *t, GCstr *sep,\r\n\t\t\t    int32_t i, int32_t e);\r\n\r\n/* Miscellaneous buffer operations */\r\nLJ_FUNCA GCstr * LJ_FASTCALL lj_buf_tostr(SBuf *sb);\r\nLJ_FUNC GCstr *lj_buf_cat2str(lua_State *L, GCstr *s1, GCstr *s2);\r\nLJ_FUNC uint32_t LJ_FASTCALL lj_buf_ruleb128(const char **pp);\r\n\r\nstatic LJ_AINLINE GCstr *lj_buf_str(lua_State *L, SBuf *sb)\r\n{\r\n  return lj_str_new(L, sbufB(sb), sbuflen(sb));\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_carith.c",
    "content": "/*\r\n** C data arithmetic.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_carith.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* -- C data arithmetic --------------------------------------------------- */\r\n\r\n/* Binary operands of an operator converted to ctypes. */\r\ntypedef struct CDArith {\r\n  uint8_t *p[2];\r\n  CType *ct[2];\r\n} CDArith;\r\n\r\n/* Check arguments for arithmetic metamethods. */\r\nstatic int carith_checkarg(lua_State *L, CTState *cts, CDArith *ca)\r\n{\r\n  TValue *o = L->base;\r\n  int ok = 1;\r\n  MSize i;\r\n  if (o+1 >= L->top)\r\n    lj_err_argt(L, 1, LUA_TCDATA);\r\n  for (i = 0; i < 2; i++, o++) {\r\n    if (tviscdata(o)) {\r\n      GCcdata *cd = cdataV(o);\r\n      CTypeID id = (CTypeID)cd->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      uint8_t *p = (uint8_t *)cdataptr(cd);\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = (uint8_t *)cdata_getptr(p, ct->size);\r\n\tif (ctype_isref(ct->info)) ct = ctype_rawchild(cts, ct);\r\n      } else if (ctype_isfunc(ct->info)) {\r\n\tp = (uint8_t *)*(void **)p;\r\n\tct = ctype_get(cts,\r\n\t  lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR));\r\n      }\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      ca->ct[i] = ct;\r\n      ca->p[i] = p;\r\n    } else if (tvisint(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_INT32);\r\n      ca->p[i] = (uint8_t *)&o->i;\r\n    } else if (tvisnum(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_DOUBLE);\r\n      ca->p[i] = (uint8_t *)&o->n;\r\n    } else if (tvisnil(o)) {\r\n      ca->ct[i] = ctype_get(cts, CTID_P_VOID);\r\n      ca->p[i] = (uint8_t *)0;\r\n    } else if (tvisstr(o)) {\r\n      TValue *o2 = i == 0 ? o+1 : o-1;\r\n      CType *ct = ctype_raw(cts, cdataV(o2)->ctypeid);\r\n      ca->ct[i] = NULL;\r\n      ca->p[i] = (uint8_t *)strVdata(o);\r\n      ok = 0;\r\n      if (ctype_isenum(ct->info)) {\r\n\tCTSize ofs;\r\n\tCType *cct = lj_ctype_getfield(cts, ct, strV(o), &ofs);\r\n\tif (cct && ctype_isconstval(cct->info)) {\r\n\t  ca->ct[i] = ctype_child(cts, cct);\r\n\t  ca->p[i] = (uint8_t *)&cct->size;  /* Assumes ct does not grow. */\r\n\t  ok = 1;\r\n\t} else {\r\n\t  ca->ct[1-i] = ct;  /* Use enum to improve error message. */\r\n\t  ca->p[1-i] = NULL;\r\n\t  break;\r\n\t}\r\n      }\r\n    } else {\r\n      ca->ct[i] = NULL;\r\n      ca->p[i] = (void *)(intptr_t)1;  /* To make it unequal. */\r\n      ok = 0;\r\n    }\r\n  }\r\n  return ok;\r\n}\r\n\r\n/* Pointer arithmetic. */\r\nstatic int carith_ptr(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  CType *ctp = ca->ct[0];\r\n  uint8_t *pp = ca->p[0];\r\n  ptrdiff_t idx;\r\n  CTSize sz;\r\n  CTypeID id;\r\n  GCcdata *cd;\r\n  if (ctype_isptr(ctp->info) || ctype_isrefarray(ctp->info)) {\r\n    if ((mm == MM_sub || mm == MM_eq || mm == MM_lt || mm == MM_le) &&\r\n\t(ctype_isptr(ca->ct[1]->info) || ctype_isrefarray(ca->ct[1]->info))) {\r\n      uint8_t *pp2 = ca->p[1];\r\n      if (mm == MM_eq) {  /* Pointer equality. Incompatible pointers are ok. */\r\n\tsetboolV(L->top-1, (pp == pp2));\r\n\treturn 1;\r\n      }\r\n      if (!lj_cconv_compatptr(cts, ctp, ca->ct[1], CCF_IGNQUAL))\r\n\treturn 0;\r\n      if (mm == MM_sub) {  /* Pointer difference. */\r\n\tintptr_t diff;\r\n\tsz = lj_ctype_size(cts, ctype_cid(ctp->info));  /* Element size. */\r\n\tif (sz == 0 || sz == CTSIZE_INVALID)\r\n\t  return 0;\r\n\tdiff = ((intptr_t)pp - (intptr_t)pp2) / (int32_t)sz;\r\n\t/* All valid pointer differences on x64 are in (-2^47, +2^47),\r\n\t** which fits into a double without loss of precision.\r\n\t*/\r\n\tsetintptrV(L->top-1, (int32_t)diff);\r\n\treturn 1;\r\n      } else if (mm == MM_lt) {  /* Pointer comparison (unsigned). */\r\n\tsetboolV(L->top-1, ((uintptr_t)pp < (uintptr_t)pp2));\r\n\treturn 1;\r\n      } else {\r\n\tlua_assert(mm == MM_le);\r\n\tsetboolV(L->top-1, ((uintptr_t)pp <= (uintptr_t)pp2));\r\n\treturn 1;\r\n      }\r\n    }\r\n    if (!((mm == MM_add || mm == MM_sub) && ctype_isnum(ca->ct[1]->info)))\r\n      return 0;\r\n    lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ca->ct[1],\r\n\t\t   (uint8_t *)&idx, ca->p[1], 0);\r\n    if (mm == MM_sub) idx = -idx;\r\n  } else if (mm == MM_add && ctype_isnum(ctp->info) &&\r\n      (ctype_isptr(ca->ct[1]->info) || ctype_isrefarray(ca->ct[1]->info))) {\r\n    /* Swap pointer and index. */\r\n    ctp = ca->ct[1]; pp = ca->p[1];\r\n    lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ca->ct[0],\r\n\t\t   (uint8_t *)&idx, ca->p[0], 0);\r\n  } else {\r\n    return 0;\r\n  }\r\n  sz = lj_ctype_size(cts, ctype_cid(ctp->info));  /* Element size. */\r\n  if (sz == CTSIZE_INVALID)\r\n    return 0;\r\n  pp += idx*(int32_t)sz;  /* Compute pointer + index. */\r\n  id = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ctp->info)),\r\n\t\t       CTSIZE_PTR);\r\n  cd = lj_cdata_new(cts, id, CTSIZE_PTR);\r\n  *(uint8_t **)cdataptr(cd) = pp;\r\n  setcdataV(L, L->top-1, cd);\r\n  lj_gc_check(L);\r\n  return 1;\r\n}\r\n\r\n/* 64 bit integer arithmetic. */\r\nstatic int carith_int64(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  if (ctype_isnum(ca->ct[0]->info) && ca->ct[0]->size <= 8 &&\r\n      ctype_isnum(ca->ct[1]->info) && ca->ct[1]->size <= 8) {\r\n    CTypeID id = (((ca->ct[0]->info & CTF_UNSIGNED) && ca->ct[0]->size == 8) ||\r\n\t\t  ((ca->ct[1]->info & CTF_UNSIGNED) && ca->ct[1]->size == 8)) ?\r\n\t\t CTID_UINT64 : CTID_INT64;\r\n    CType *ct = ctype_get(cts, id);\r\n    GCcdata *cd;\r\n    uint64_t u0, u1, *up;\r\n    lj_cconv_ct_ct(cts, ct, ca->ct[0], (uint8_t *)&u0, ca->p[0], 0);\r\n    if (mm != MM_unm)\r\n      lj_cconv_ct_ct(cts, ct, ca->ct[1], (uint8_t *)&u1, ca->p[1], 0);\r\n    switch (mm) {\r\n    case MM_eq:\r\n      setboolV(L->top-1, (u0 == u1));\r\n      return 1;\r\n    case MM_lt:\r\n      setboolV(L->top-1,\r\n\t       id == CTID_INT64 ? ((int64_t)u0 < (int64_t)u1) : (u0 < u1));\r\n      return 1;\r\n    case MM_le:\r\n      setboolV(L->top-1,\r\n\t       id == CTID_INT64 ? ((int64_t)u0 <= (int64_t)u1) : (u0 <= u1));\r\n      return 1;\r\n    default: break;\r\n    }\r\n    cd = lj_cdata_new(cts, id, 8);\r\n    up = (uint64_t *)cdataptr(cd);\r\n    setcdataV(L, L->top-1, cd);\r\n    switch (mm) {\r\n    case MM_add: *up = u0 + u1; break;\r\n    case MM_sub: *up = u0 - u1; break;\r\n    case MM_mul: *up = u0 * u1; break;\r\n    case MM_div:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_divi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_divu64(u0, u1);\r\n      break;\r\n    case MM_mod:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_modi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_modu64(u0, u1);\r\n      break;\r\n    case MM_pow:\r\n      if (id == CTID_INT64)\r\n\t*up = (uint64_t)lj_carith_powi64((int64_t)u0, (int64_t)u1);\r\n      else\r\n\t*up = lj_carith_powu64(u0, u1);\r\n      break;\r\n    case MM_unm: *up = (uint64_t)-(int64_t)u0; break;\r\n    default: lua_assert(0); break;\r\n    }\r\n    lj_gc_check(L);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Handle ctype arithmetic metamethods. */\r\nstatic int lj_carith_meta(lua_State *L, CTState *cts, CDArith *ca, MMS mm)\r\n{\r\n  cTValue *tv = NULL;\r\n  if (tviscdata(L->base)) {\r\n    CTypeID id = cdataV(L->base)->ctypeid;\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n    tv = lj_ctype_meta(cts, id, mm);\r\n  }\r\n  if (!tv && L->base+1 < L->top && tviscdata(L->base+1)) {\r\n    CTypeID id = cdataV(L->base+1)->ctypeid;\r\n    CType *ct = ctype_raw(cts, id);\r\n    if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n    tv = lj_ctype_meta(cts, id, mm);\r\n  }\r\n  if (!tv) {\r\n    const char *repr[2];\r\n    int i, isenum = -1, isstr = -1;\r\n    if (mm == MM_eq) {  /* Equality checks never raise an error. */\r\n      int eq = ca->p[0] == ca->p[1];\r\n      setboolV(L->top-1, eq);\r\n      setboolV(&G(L)->tmptv2, eq);  /* Remember for trace recorder. */\r\n      return 1;\r\n    }\r\n    for (i = 0; i < 2; i++) {\r\n      if (ca->ct[i] && tviscdata(L->base+i)) {\r\n\tif (ctype_isenum(ca->ct[i]->info)) isenum = i;\r\n\trepr[i] = strdata(lj_ctype_repr(L, ctype_typeid(cts, ca->ct[i]), NULL));\r\n      } else {\r\n\tif (tvisstr(&L->base[i])) isstr = i;\r\n\trepr[i] = lj_typename(&L->base[i]);\r\n      }\r\n    }\r\n    if ((isenum ^ isstr) == 1)\r\n      lj_err_callerv(L, LJ_ERR_FFI_BADCONV, repr[isstr], repr[isenum]);\r\n    lj_err_callerv(L, mm == MM_len ? LJ_ERR_FFI_BADLEN :\r\n\t\t      mm == MM_concat ? LJ_ERR_FFI_BADCONCAT :\r\n\t\t      mm < MM_add ? LJ_ERR_FFI_BADCOMP : LJ_ERR_FFI_BADARITH,\r\n\t\t   repr[0], repr[1]);\r\n  }\r\n  return lj_meta_tailcall(L, tv);\r\n}\r\n\r\n/* Arithmetic operators for cdata. */\r\nint lj_carith_op(lua_State *L, MMS mm)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CDArith ca;\r\n  if (carith_checkarg(L, cts, &ca)) {\r\n    if (carith_int64(L, cts, &ca, mm) || carith_ptr(L, cts, &ca, mm)) {\r\n      copyTV(L, &G(L)->tmptv2, L->top-1);  /* Remember for trace recorder. */\r\n      return 1;\r\n    }\r\n  }\r\n  return lj_carith_meta(L, cts, &ca, mm);\r\n}\r\n\r\n/* -- 64 bit bit operations helpers --------------------------------------- */\r\n\r\n#if LJ_64\r\n#define B64DEF(name) \\\r\n  static LJ_AINLINE uint64_t lj_carith_##name(uint64_t x, int32_t sh)\r\n#else\r\n/* Not inlined on 32 bit archs, since some of these are quite lengthy. */\r\n#define B64DEF(name) \\\r\n  uint64_t LJ_NOINLINE lj_carith_##name(uint64_t x, int32_t sh)\r\n#endif\r\n\r\nB64DEF(shl64) { return x << (sh&63); }\r\nB64DEF(shr64) { return x >> (sh&63); }\r\nB64DEF(sar64) { return (uint64_t)((int64_t)x >> (sh&63)); }\r\nB64DEF(rol64) { return lj_rol(x, (sh&63)); }\r\nB64DEF(ror64) { return lj_ror(x, (sh&63)); }\r\n\r\n#undef B64DEF\r\n\r\nuint64_t lj_carith_shift64(uint64_t x, int32_t sh, int op)\r\n{\r\n  switch (op) {\r\n  case IR_BSHL-IR_BSHL: x = lj_carith_shl64(x, sh); break;\r\n  case IR_BSHR-IR_BSHL: x = lj_carith_shr64(x, sh); break;\r\n  case IR_BSAR-IR_BSHL: x = lj_carith_sar64(x, sh); break;\r\n  case IR_BROL-IR_BSHL: x = lj_carith_rol64(x, sh); break;\r\n  case IR_BROR-IR_BSHL: x = lj_carith_ror64(x, sh); break;\r\n  default: lua_assert(0); break;\r\n  }\r\n  return x;\r\n}\r\n\r\n/* Equivalent to lj_lib_checkbit(), but handles cdata. */\r\nuint64_t lj_carith_check64(lua_State *L, int narg, CTypeID *id)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o >= L->top) {\r\n  err:\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  } else if (LJ_LIKELY(tvisnumber(o))) {\r\n    /* Handled below. */\r\n  } else if (tviscdata(o)) {\r\n    CTState *cts = ctype_cts(L);\r\n    uint8_t *sp = (uint8_t *)cdataptr(cdataV(o));\r\n    CTypeID sid = cdataV(o)->ctypeid;\r\n    CType *s = ctype_get(cts, sid);\r\n    uint64_t x;\r\n    if (ctype_isref(s->info)) {\r\n      sp = *(void **)sp;\r\n      sid = ctype_cid(s->info);\r\n    }\r\n    s = ctype_raw(cts, sid);\r\n    if (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n    if ((s->info & (CTMASK_NUM|CTF_BOOL|CTF_FP|CTF_UNSIGNED)) ==\r\n\tCTINFO(CT_NUM, CTF_UNSIGNED) && s->size == 8)\r\n      *id = CTID_UINT64;  /* Use uint64_t, since it has the highest rank. */\r\n    else if (!*id)\r\n      *id = CTID_INT64;  /* Use int64_t, unless already set. */\r\n    lj_cconv_ct_ct(cts, ctype_get(cts, *id), s,\r\n\t\t   (uint8_t *)&x, sp, CCF_ARG(narg));\r\n    return x;\r\n  } else if (!(tvisstr(o) && lj_strscan_number(strV(o), o))) {\r\n    goto err;\r\n  }\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return (uint32_t)intV(o);\r\n  } else {\r\n    int32_t i = lj_num2bit(numV(o));\r\n    if (LJ_DUALNUM) setintV(o, i);\r\n    return (uint32_t)i;\r\n  }\r\n}\r\n\r\n\r\n/* -- 64 bit integer arithmetic helpers ----------------------------------- */\r\n\r\n#if LJ_32 && LJ_HASJIT\r\n/* Signed/unsigned 64 bit multiplication. */\r\nint64_t lj_carith_mul64(int64_t a, int64_t b)\r\n{\r\n  return a * b;\r\n}\r\n#endif\r\n\r\n/* Unsigned 64 bit division. */\r\nuint64_t lj_carith_divu64(uint64_t a, uint64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  return a / b;\r\n}\r\n\r\n/* Signed 64 bit division. */\r\nint64_t lj_carith_divi64(int64_t a, int64_t b)\r\n{\r\n  if (b == 0 || (a == (int64_t)U64x(80000000,00000000) && b == -1))\r\n    return U64x(80000000,00000000);\r\n  return a / b;\r\n}\r\n\r\n/* Unsigned 64 bit modulo. */\r\nuint64_t lj_carith_modu64(uint64_t a, uint64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  return a % b;\r\n}\r\n\r\n/* Signed 64 bit modulo. */\r\nint64_t lj_carith_modi64(int64_t a, int64_t b)\r\n{\r\n  if (b == 0) return U64x(80000000,00000000);\r\n  if (a == (int64_t)U64x(80000000,00000000) && b == -1) return 0;\r\n  return a % b;\r\n}\r\n\r\n/* Unsigned 64 bit x^k. */\r\nuint64_t lj_carith_powu64(uint64_t x, uint64_t k)\r\n{\r\n  uint64_t y;\r\n  if (k == 0)\r\n    return 1;\r\n  for (; (k & 1) == 0; k >>= 1) x *= x;\r\n  y = x;\r\n  if ((k >>= 1) != 0) {\r\n    for (;;) {\r\n      x *= x;\r\n      if (k == 1) break;\r\n      if (k & 1) y *= x;\r\n      k >>= 1;\r\n    }\r\n    y *= x;\r\n  }\r\n  return y;\r\n}\r\n\r\n/* Signed 64 bit x^k. */\r\nint64_t lj_carith_powi64(int64_t x, int64_t k)\r\n{\r\n  if (k == 0)\r\n    return 1;\r\n  if (k < 0) {\r\n    if (x == 0)\r\n      return U64x(7fffffff,ffffffff);\r\n    else if (x == 1)\r\n      return 1;\r\n    else if (x == -1)\r\n      return (k & 1) ? -1 : 1;\r\n    else\r\n      return 0;\r\n  }\r\n  return (int64_t)lj_carith_powu64((uint64_t)x, (uint64_t)k);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_carith.h",
    "content": "/*\r\n** C data arithmetic.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CARITH_H\r\n#define _LJ_CARITH_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\nLJ_FUNC int lj_carith_op(lua_State *L, MMS mm);\r\n\r\n#if LJ_32\r\nLJ_FUNC uint64_t lj_carith_shl64(uint64_t x, int32_t sh);\r\nLJ_FUNC uint64_t lj_carith_shr64(uint64_t x, int32_t sh);\r\nLJ_FUNC uint64_t lj_carith_sar64(uint64_t x, int32_t sh);\r\nLJ_FUNC uint64_t lj_carith_rol64(uint64_t x, int32_t sh);\r\nLJ_FUNC uint64_t lj_carith_ror64(uint64_t x, int32_t sh);\r\n#endif\r\nLJ_FUNC uint64_t lj_carith_shift64(uint64_t x, int32_t sh, int op);\r\nLJ_FUNC uint64_t lj_carith_check64(lua_State *L, int narg, CTypeID *id);\r\n\r\n#if LJ_32 && LJ_HASJIT\r\nLJ_FUNC int64_t lj_carith_mul64(int64_t x, int64_t k);\r\n#endif\r\nLJ_FUNC uint64_t lj_carith_divu64(uint64_t a, uint64_t b);\r\nLJ_FUNC int64_t lj_carith_divi64(int64_t a, int64_t b);\r\nLJ_FUNC uint64_t lj_carith_modu64(uint64_t a, uint64_t b);\r\nLJ_FUNC int64_t lj_carith_modi64(int64_t a, int64_t b);\r\nLJ_FUNC uint64_t lj_carith_powu64(uint64_t x, uint64_t k);\r\nLJ_FUNC int64_t lj_carith_powi64(int64_t x, int64_t k);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ccall.c",
    "content": "/*\r\n** FFI C call handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_trace.h\"\r\n\r\n/* Target-specific handling of register arguments. */\r\n#if LJ_TARGET_X86\r\n/* -- x86 calling conventions --------------------------------------------- */\r\n\r\n#if LJ_ABI_WIN\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs bigger than 8 by reference (on stack only). */ \\\r\n  cc->retref = (sz > 8); \\\r\n  if (cc->retref) cc->stack[nsp++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET\r\n\r\n#else\r\n\r\n#if LJ_TARGET_OSX\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size 1, 2, 4 or 8 in registers. */ \\\r\n  cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \\\r\n  if (cc->retref) { \\\r\n    if (ngpr < maxgpr) \\\r\n      cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n    else \\\r\n      cc->stack[nsp++] = (GPRArg)dp; \\\r\n  } else {  /* Struct with single FP field ends up in FPR. */ \\\r\n    cc->resx87 = ccall_classify_struct(cts, ctr); \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  if (cc->resx87) sp = (uint8_t *)&cc->fpr[0]; \\\r\n  memcpy(dp, sp, ctr->size);\r\n\r\n#else\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference (in reg or on stack). */ \\\r\n  if (ngpr < maxgpr) \\\r\n    cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n  else \\\r\n    cc->stack[nsp++] = (GPRArg)dp;\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Return complex float in GPRs and complex double by reference. */ \\\r\n  cc->retref = (sz > 8); \\\r\n  if (cc->retref) { \\\r\n    if (ngpr < maxgpr) \\\r\n      cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n    else \\\r\n      cc->stack[nsp++] = (GPRArg)dp; \\\r\n  }\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!cc->retref) \\\r\n    *(int64_t *)dp = *(int64_t *)sp;  /* Copy complex float from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  ngpr = maxgpr;  /* Pass all structs by value on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 1;  /* Pass complex by value on stack. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (!isfp) {  /* Only non-FP values may be passed in registers. */ \\\r\n    if (n > 1) {  /* Anything > 32 bit is passed on the stack. */ \\\r\n      if (!LJ_ABI_WIN) ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } else if (ngpr + 1 <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64 && LJ_ABI_WIN\r\n/* -- Windows/x64 calling conventions ------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size 1, 2, 4 or 8 in a GPR. */ \\\r\n  cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!cc->retref) \\\r\n    *(int64_t *)dp = *(int64_t *)sp;  /* Copy complex float from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass structs of size 1, 2, 4 or 8 in a GPR by value. */ \\\r\n  if (!(sz == 1 || sz == 2 || sz == 4 || sz == 8)) { \\\r\n    rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n    sz = CTSIZE_PTR;  /* Pass all other structs by reference. */ \\\r\n  }\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex float in a GPR and complex double by reference. */ \\\r\n  if (sz != 2*sizeof(float)) { \\\r\n    rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n    sz = CTSIZE_PTR; \\\r\n  }\r\n\r\n/* Windows/x64 argument registers are strictly positional (use ngpr). */\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (ngpr < maxgpr) { dp = &cc->fpr[ngpr++]; nfpr = ngpr; goto done; } \\\r\n  } else { \\\r\n    if (ngpr < maxgpr) { dp = &cc->gpr[ngpr++]; goto done; } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64\r\n/* -- POSIX/x64 calling conventions --------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  if (ccall_classify_struct(cts, ctr, rcl, 0)) { \\\r\n    cc->retref = 1;  /* Return struct by reference. */ \\\r\n    cc->gpr[ngpr++] = (GPRArg)dp; \\\r\n  } else { \\\r\n    cc->retref = 0;  /* Return small structs in registers. */ \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  ccall_classify_struct(cts, ctr, rcl, 0); \\\r\n  ccall_struct_ret(cc, rcl, dp, ctr->size);\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in one or two FPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (ctr->size == 2*sizeof(float)) {  /* Copy complex float from FPR. */ \\\r\n    *(int64_t *)dp = cc->fpr[0].l[0]; \\\r\n  } else {  /* Copy non-contiguous complex double from FPRs. */ \\\r\n    ((int64_t *)dp)[0] = cc->fpr[0].l[0]; \\\r\n    ((int64_t *)dp)[1] = cc->fpr[1].l[0]; \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  int rcl[2]; rcl[0] = rcl[1] = 0; \\\r\n  if (!ccall_classify_struct(cts, d, rcl, 0)) { \\\r\n    cc->nsp = nsp; cc->ngpr = ngpr; cc->nfpr = nfpr; \\\r\n    if (ccall_struct_arg(cc, cts, d, rcl, o, narg)) goto err_nyi; \\\r\n    nsp = cc->nsp; ngpr = cc->ngpr; nfpr = cc->nfpr; \\\r\n    continue; \\\r\n  }  /* Pass all other structs by value on stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 2;  /* Pass complex in FPRs or on stack. Needs postprocessing. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) {  /* Try to pass argument in FPRs. */ \\\r\n    int n2 = ctype_isvector(d->info) ? 1 : n; \\\r\n    if (nfpr + n2 <= CCALL_NARG_FPR) { \\\r\n      dp = &cc->fpr[nfpr]; \\\r\n      nfpr += n2; \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    /* Note that reordering is explicitly allowed in the x64 ABI. */ \\\r\n    if (n <= 2 && ngpr + n <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_ARM\r\n/* -- ARM calling conventions --------------------------------------------- */\r\n\r\n#if LJ_ABI_SOFTFP\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  /* Return structs of size <= 4 in a GPR. */ \\\r\n  cc->retref = !(sz <= 4); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  cc->retref = 1;  /* Return all complex values by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  UNUSED(dp); /* Nothing to do. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG_FP1\r\n#define CCALL_HANDLE_REGARG_FP2\r\n\r\n#else\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = !ccall_classify_struct(cts, ctr, ct); \\\r\n  if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  if (ccall_classify_struct(cts, ctr, ct) > 1) sp = (uint8_t *)&cc->fpr[0]; \\\r\n  memcpy(dp, sp, ctr->size);\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  if (!(ct->info & CTF_VARARG)) cc->retref = 0;  /* Return complex in FPRs. */\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (!(ct->info & CTF_VARARG)) memcpy(dp, &cc->fpr[0], ctr->size);\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  isfp = (ccall_classify_struct(cts, d, ct) > 1);\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  isfp = 1;  /* Pass complex by value in FPRs or on stack. */\r\n\r\n#define CCALL_HANDLE_REGARG_FP1 \\\r\n  if (isfp && !(ct->info & CTF_VARARG)) { \\\r\n    if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \\\r\n      if (nfpr + (n >> 1) <= CCALL_NARG_FPR) { \\\r\n\tdp = &cc->fpr[nfpr]; \\\r\n\tnfpr += (n >> 1); \\\r\n\tgoto done; \\\r\n      } \\\r\n    } else { \\\r\n      if (sz > 1 && fprodd != nfpr) fprodd = 0; \\\r\n      if (fprodd) { \\\r\n\tif (2*nfpr+n <= 2*CCALL_NARG_FPR+1) { \\\r\n\t  dp = (void *)&cc->fpr[fprodd-1].f[1]; \\\r\n\t  nfpr += (n >> 1); \\\r\n\t  if ((n & 1)) fprodd = 0; else fprodd = nfpr-1; \\\r\n\t  goto done; \\\r\n\t} \\\r\n      } else { \\\r\n\tif (2*nfpr+n <= 2*CCALL_NARG_FPR) { \\\r\n\t  dp = (void *)&cc->fpr[nfpr]; \\\r\n\t  nfpr += (n >> 1); \\\r\n\t  if ((n & 1)) fprodd = ++nfpr; else fprodd = 0; \\\r\n\t  goto done; \\\r\n\t} \\\r\n      } \\\r\n    } \\\r\n    fprodd = 0;  /* No reordering after the first FP value is on stack. */ \\\r\n  } else {\r\n\r\n#define CCALL_HANDLE_REGARG_FP2\t}\r\n\r\n#endif\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  CCALL_HANDLE_REGARG_FP1 \\\r\n  if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \\\r\n    if (ngpr < maxgpr) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n  } \\\r\n  if (ngpr < maxgpr) { \\\r\n    dp = &cc->gpr[ngpr]; \\\r\n    if (ngpr + n > maxgpr) { \\\r\n      nsp += ngpr + n - maxgpr;  /* Assumes contiguous gpr/stack fields. */ \\\r\n      if (nsp > CCALL_MAXSTACK) goto err_nyi;  /* Too many arguments. */ \\\r\n      ngpr = maxgpr; \\\r\n    } else { \\\r\n      ngpr += n; \\\r\n    } \\\r\n    goto done; \\\r\n  } CCALL_HANDLE_REGARG_FP2\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if ((ct->info & CTF_VARARG)) sp = (uint8_t *)&cc->gpr[0];\r\n\r\n#elif LJ_TARGET_ARM64\r\n/* -- ARM64 calling conventions ------------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = !ccall_classify_struct(cts, ctr); \\\r\n  if (cc->retref) cc->retp = dp;\r\n\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  unsigned int cl = ccall_classify_struct(cts, ctr); \\\r\n  if ((cl & 4)) { /* Combine float HFA from separate registers. */ \\\r\n    CTSize i = (cl >> 8) - 1; \\\r\n    do { ((uint32_t *)dp)[i] = cc->fpr[i].u32; } while (i--); \\\r\n  } else { \\\r\n    if (cl > 1) sp = (uint8_t *)&cc->fpr[0]; \\\r\n    memcpy(dp, sp, ctr->size); \\\r\n  }\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in one or two FPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (ctr->size == 2*sizeof(float)) {  /* Copy complex float from FPRs. */ \\\r\n    ((float *)dp)[0] = cc->fpr[0].f; \\\r\n    ((float *)dp)[1] = cc->fpr[1].f; \\\r\n  } else {  /* Copy complex double from FPRs. */ \\\r\n    ((double *)dp)[0] = cc->fpr[0].d; \\\r\n    ((double *)dp)[1] = cc->fpr[1].d; \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  unsigned int cl = ccall_classify_struct(cts, d); \\\r\n  if (cl == 0) {  /* Pass struct by reference. */ \\\r\n    rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n    sz = CTSIZE_PTR; \\\r\n  } else if (cl > 1) {  /* Pass struct in FPRs or on stack. */ \\\r\n    isfp = (cl & 4) ? 2 : 1; \\\r\n  }  /* else: Pass struct in GPRs or on stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in separate (!) FPRs or on stack. */ \\\r\n  isfp = ctr->size == 2*sizeof(float) ? 2 : 1;\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (LJ_TARGET_IOS && isva) { \\\r\n    /* IOS: All variadic arguments are on the stack. */ \\\r\n  } else if (isfp) {  /* Try to pass argument in FPRs. */ \\\r\n    int n2 = ctype_isvector(d->info) ? 1 : n*isfp; \\\r\n    if (nfpr + n2 <= CCALL_NARG_FPR) { \\\r\n      dp = &cc->fpr[nfpr]; \\\r\n      nfpr += n2; \\\r\n      goto done; \\\r\n    } else { \\\r\n      nfpr = CCALL_NARG_FPR;  /* Prevent reordering. */ \\\r\n      if (LJ_TARGET_IOS && d->size < 8) goto err_nyi; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    if (!LJ_TARGET_IOS && (d->info & CTF_ALIGN) > CTALIGN_PTR) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } else { \\\r\n      ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n      if (LJ_TARGET_IOS && d->size < 8) goto err_nyi; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_PPC\r\n/* -- PPC calling conventions --------------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in 2 or 4 GPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  memcpy(dp, sp, ctr->size);  /* Copy complex from GPRs. */\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  rp = cdataptr(lj_cdata_new(cts, did, sz)); \\\r\n  sz = CTSIZE_PTR;  /* Pass all structs by reference. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp) {  /* Try to pass argument in FPRs. */ \\\r\n    if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n      dp = &cc->fpr[nfpr]; \\\r\n      nfpr += 1; \\\r\n      d = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */ \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    if (n > 1) { \\\r\n      lua_assert(n == 2 || n == 4);  /* int64_t or complex (float). */ \\\r\n      if (ctype_isinteger(d->info)) \\\r\n\tngpr = (ngpr + 1u) & ~1u;  /* Align int64_t to regpair. */ \\\r\n      else if (ngpr + n > maxgpr) \\\r\n\tngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    ctr = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */\r\n\r\n#elif LJ_TARGET_MIPS\r\n/* -- MIPS calling conventions -------------------------------------------- */\r\n\r\n#define CCALL_HANDLE_STRUCTRET \\\r\n  cc->retref = 1;  /* Return all structs by reference. */ \\\r\n  cc->gpr[ngpr++] = (GPRArg)dp;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET \\\r\n  /* Complex values are returned in 1 or 2 FPRs. */ \\\r\n  cc->retref = 0;\r\n\r\n#define CCALL_HANDLE_COMPLEXRET2 \\\r\n  if (ctr->size == 2*sizeof(float)) {  /* Copy complex float from FPRs. */ \\\r\n    ((float *)dp)[0] = cc->fpr[0].f; \\\r\n    ((float *)dp)[1] = cc->fpr[1].f; \\\r\n  } else {  /* Copy complex double from FPRs. */ \\\r\n    ((double *)dp)[0] = cc->fpr[0].d; \\\r\n    ((double *)dp)[1] = cc->fpr[1].d; \\\r\n  }\r\n\r\n#define CCALL_HANDLE_STRUCTARG \\\r\n  /* Pass all structs by value in registers and/or on the stack. */\r\n\r\n#define CCALL_HANDLE_COMPLEXARG \\\r\n  /* Pass complex by value in 2 or 4 GPRs. */\r\n\r\n#define CCALL_HANDLE_REGARG \\\r\n  if (isfp && nfpr < CCALL_NARG_FPR && !(ct->info & CTF_VARARG)) { \\\r\n    /* Try to pass argument in FPRs. */ \\\r\n    dp = n == 1 ? (void *)&cc->fpr[nfpr].f : (void *)&cc->fpr[nfpr].d; \\\r\n    nfpr++; ngpr += n; \\\r\n    goto done; \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    nfpr = CCALL_NARG_FPR; \\\r\n    if ((d->info & CTF_ALIGN) > CTALIGN_PTR) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr < maxgpr) { \\\r\n      dp = &cc->gpr[ngpr]; \\\r\n      if (ngpr + n > maxgpr) { \\\r\n\tnsp += ngpr + n - maxgpr;  /* Assumes contiguous gpr/stack fields. */ \\\r\n\tif (nsp > CCALL_MAXSTACK) goto err_nyi;  /* Too many arguments. */ \\\r\n\tngpr = maxgpr; \\\r\n      } else { \\\r\n\tngpr += n; \\\r\n      } \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CCALL_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    sp = (uint8_t *)&cc->fpr[0].f;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CCALL_HANDLE_STRUCTRET2\r\n#define CCALL_HANDLE_STRUCTRET2 \\\r\n  memcpy(dp, sp, ctr->size);  /* Copy struct return value from GPRs. */\r\n#endif\r\n\r\n/* -- x86 OSX ABI struct classification ----------------------------------- */\r\n\r\n#if LJ_TARGET_X86 && LJ_TARGET_OSX\r\n\r\n/* Check for struct with single FP field. */\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct)\r\n{\r\n  CTSize sz = ct->size;\r\n  if (!(sz == sizeof(float) || sz == sizeof(double))) return 0;\r\n  if ((ct->info & CTF_UNION)) return 0;\r\n  while (ct->sib) {\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      CType *sct = ctype_rawchild(cts, ct);\r\n      if (ctype_isfp(sct->info)) {\r\n\tif (sct->size == sz)\r\n\t  return (sz >> 2);  /* Return 1 for float or 2 for double. */\r\n      } else if (ctype_isstruct(sct->info)) {\r\n\tif (sct->size)\r\n\t  return ccall_classify_struct(cts, sct);\r\n      } else {\r\n\tbreak;\r\n      }\r\n    } else if (ctype_isbitfield(ct->info)) {\r\n      break;\r\n    } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      CType *sct = ctype_rawchild(cts, ct);\r\n      if (sct->size)\r\n\treturn ccall_classify_struct(cts, sct);\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n#endif\r\n\r\n/* -- x64 struct classification ------------------------------------------- */\r\n\r\n#if LJ_TARGET_X64 && !LJ_ABI_WIN\r\n\r\n/* Register classes for x64 struct classification. */\r\n#define CCALL_RCL_INT\t1\r\n#define CCALL_RCL_SSE\t2\r\n#define CCALL_RCL_MEM\t4\r\n/* NYI: classify vectors. */\r\n\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs);\r\n\r\n/* Classify a C type. */\r\nstatic void ccall_classify_ct(CTState *cts, CType *ct, int *rcl, CTSize ofs)\r\n{\r\n  if (ctype_isarray(ct->info)) {\r\n    CType *cct = ctype_rawchild(cts, ct);\r\n    CTSize eofs, esz = cct->size, asz = ct->size;\r\n    for (eofs = 0; eofs < asz; eofs += esz)\r\n      ccall_classify_ct(cts, cct, rcl, ofs+eofs);\r\n  } else if (ctype_isstruct(ct->info)) {\r\n    ccall_classify_struct(cts, ct, rcl, ofs);\r\n  } else {\r\n    int cl = ctype_isfp(ct->info) ? CCALL_RCL_SSE : CCALL_RCL_INT;\r\n    lua_assert(ctype_hassize(ct->info));\r\n    if ((ofs & (ct->size-1))) cl = CCALL_RCL_MEM;  /* Unaligned. */\r\n    rcl[(ofs >= 8)] |= cl;\r\n  }\r\n}\r\n\r\n/* Recursively classify a struct based on its fields. */\r\nstatic int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs)\r\n{\r\n  if (ct->size > 16) return CCALL_RCL_MEM;  /* Too big, gets memory class. */\r\n  while (ct->sib) {\r\n    CTSize fofs;\r\n    ct = ctype_get(cts, ct->sib);\r\n    fofs = ofs+ct->size;\r\n    if (ctype_isfield(ct->info))\r\n      ccall_classify_ct(cts, ctype_rawchild(cts, ct), rcl, fofs);\r\n    else if (ctype_isbitfield(ct->info))\r\n      rcl[(fofs >= 8)] |= CCALL_RCL_INT;  /* NYI: unaligned bitfields? */\r\n    else if (ctype_isxattrib(ct->info, CTA_SUBTYPE))\r\n      ccall_classify_struct(cts, ctype_rawchild(cts, ct), rcl, fofs);\r\n  }\r\n  return ((rcl[0]|rcl[1]) & CCALL_RCL_MEM);  /* Memory class? */\r\n}\r\n\r\n/* Try to split up a small struct into registers. */\r\nstatic int ccall_struct_reg(CCallState *cc, GPRArg *dp, int *rcl)\r\n{\r\n  MSize ngpr = cc->ngpr, nfpr = cc->nfpr;\r\n  uint32_t i;\r\n  for (i = 0; i < 2; i++) {\r\n    lua_assert(!(rcl[i] & CCALL_RCL_MEM));\r\n    if ((rcl[i] & CCALL_RCL_INT)) {  /* Integer class takes precedence. */\r\n      if (ngpr >= CCALL_NARG_GPR) return 1;  /* Register overflow. */\r\n      cc->gpr[ngpr++] = dp[i];\r\n    } else if ((rcl[i] & CCALL_RCL_SSE)) {\r\n      if (nfpr >= CCALL_NARG_FPR) return 1;  /* Register overflow. */\r\n      cc->fpr[nfpr++].l[0] = dp[i];\r\n    }\r\n  }\r\n  cc->ngpr = ngpr; cc->nfpr = nfpr;\r\n  return 0;  /* Ok. */\r\n}\r\n\r\n/* Pass a small struct argument. */\r\nstatic int ccall_struct_arg(CCallState *cc, CTState *cts, CType *d, int *rcl,\r\n\t\t\t    TValue *o, int narg)\r\n{\r\n  GPRArg dp[2];\r\n  dp[0] = dp[1] = 0;\r\n  /* Convert to temp. struct. */\r\n  lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));\r\n  if (ccall_struct_reg(cc, dp, rcl)) {  /* Register overflow? Pass on stack. */\r\n    MSize nsp = cc->nsp, n = rcl[1] ? 2 : 1;\r\n    if (nsp + n > CCALL_MAXSTACK) return 1;  /* Too many arguments. */\r\n    cc->nsp = nsp + n;\r\n    memcpy(&cc->stack[nsp], dp, n*CTSIZE_PTR);\r\n  }\r\n  return 0;  /* Ok. */\r\n}\r\n\r\n/* Combine returned small struct. */\r\nstatic void ccall_struct_ret(CCallState *cc, int *rcl, uint8_t *dp, CTSize sz)\r\n{\r\n  GPRArg sp[2];\r\n  MSize ngpr = 0, nfpr = 0;\r\n  uint32_t i;\r\n  for (i = 0; i < 2; i++) {\r\n    if ((rcl[i] & CCALL_RCL_INT)) {  /* Integer class takes precedence. */\r\n      sp[i] = cc->gpr[ngpr++];\r\n    } else if ((rcl[i] & CCALL_RCL_SSE)) {\r\n      sp[i] = cc->fpr[nfpr++].l[0];\r\n    }\r\n  }\r\n  memcpy(dp, sp, sz);\r\n}\r\n#endif\r\n\r\n/* -- ARM hard-float ABI struct classification ---------------------------- */\r\n\r\n#if LJ_TARGET_ARM && !LJ_ABI_SOFTFP\r\n\r\n/* Classify a struct based on its fields. */\r\nstatic unsigned int ccall_classify_struct(CTState *cts, CType *ct, CType *ctf)\r\n{\r\n  CTSize sz = ct->size;\r\n  unsigned int r = 0, n = 0, isu = (ct->info & CTF_UNION);\r\n  if ((ctf->info & CTF_VARARG)) goto noth;\r\n  while (ct->sib) {\r\n    CType *sct;\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n      if (ctype_isfp(sct->info)) {\r\n\tr |= sct->size;\r\n\tif (!isu) n++; else if (n == 0) n = 1;\r\n      } else if (ctype_iscomplex(sct->info)) {\r\n\tr |= (sct->size >> 1);\r\n\tif (!isu) n += 2; else if (n < 2) n = 2;\r\n      } else if (ctype_isstruct(sct->info)) {\r\n\tgoto substruct;\r\n      } else {\r\n\tgoto noth;\r\n      }\r\n    } else if (ctype_isbitfield(ct->info)) {\r\n      goto noth;\r\n    } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n    substruct:\r\n      if (sct->size > 0) {\r\n\tunsigned int s = ccall_classify_struct(cts, sct, ctf);\r\n\tif (s <= 1) goto noth;\r\n\tr |= (s & 255);\r\n\tif (!isu) n += (s >> 8); else if (n < (s >>8)) n = (s >> 8);\r\n      }\r\n    }\r\n  }\r\n  if ((r == 4 || r == 8) && n <= 4)\r\n    return r + (n << 8);\r\nnoth:  /* Not a homogeneous float/double aggregate. */\r\n  return (sz <= 4);  /* Return structs of size <= 4 in a GPR. */\r\n}\r\n\r\n#endif\r\n\r\n/* -- ARM64 ABI struct classification ------------------------------------- */\r\n\r\n#if LJ_TARGET_ARM64\r\n\r\n/* Classify a struct based on its fields. */\r\nstatic unsigned int ccall_classify_struct(CTState *cts, CType *ct)\r\n{\r\n  CTSize sz = ct->size;\r\n  unsigned int r = 0, n = 0, isu = (ct->info & CTF_UNION);\r\n  while (ct->sib) {\r\n    CType *sct;\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n      if (ctype_isfp(sct->info)) {\r\n\tr |= sct->size;\r\n\tif (!isu) n++; else if (n == 0) n = 1;\r\n      } else if (ctype_iscomplex(sct->info)) {\r\n\tr |= (sct->size >> 1);\r\n\tif (!isu) n += 2; else if (n < 2) n = 2;\r\n      } else if (ctype_isstruct(sct->info)) {\r\n\tgoto substruct;\r\n      } else {\r\n\tgoto noth;\r\n      }\r\n    } else if (ctype_isbitfield(ct->info)) {\r\n      goto noth;\r\n    } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      sct = ctype_rawchild(cts, ct);\r\n    substruct:\r\n      if (sct->size > 0) {\r\n\tunsigned int s = ccall_classify_struct(cts, sct);\r\n\tif (s <= 1) goto noth;\r\n\tr |= (s & 255);\r\n\tif (!isu) n += (s >> 8); else if (n < (s >>8)) n = (s >> 8);\r\n      }\r\n    }\r\n  }\r\n  if ((r == 4 || r == 8) && n <= 4)\r\n    return r + (n << 8);\r\nnoth:  /* Not a homogeneous float/double aggregate. */\r\n  return (sz <= 16);  /* Return structs of size <= 16 in GPRs. */\r\n}\r\n\r\n#endif\r\n\r\n/* -- Common C call handling ---------------------------------------------- */\r\n\r\n/* Infer the destination CTypeID for a vararg argument. */\r\nCTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o)\r\n{\r\n  if (tvisnumber(o)) {\r\n    return CTID_DOUBLE;\r\n  } else if (tviscdata(o)) {\r\n    CTypeID id = cdataV(o)->ctypeid;\r\n    CType *s = ctype_get(cts, id);\r\n    if (ctype_isrefarray(s->info)) {\r\n      return lj_ctype_intern(cts,\r\n\t       CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(s->info)), CTSIZE_PTR);\r\n    } else if (ctype_isstruct(s->info) || ctype_isfunc(s->info)) {\r\n      /* NYI: how to pass a struct by value in a vararg argument? */\r\n      return lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR);\r\n    } else if (ctype_isfp(s->info) && s->size == sizeof(float)) {\r\n      return CTID_DOUBLE;\r\n    } else {\r\n      return id;\r\n    }\r\n  } else if (tvisstr(o)) {\r\n    return CTID_P_CCHAR;\r\n  } else if (tvisbool(o)) {\r\n    return CTID_BOOL;\r\n  } else {\r\n    return CTID_P_VOID;\r\n  }\r\n}\r\n\r\n/* Setup arguments for C call. */\r\nstatic int ccall_set_args(lua_State *L, CTState *cts, CType *ct,\r\n\t\t\t  CCallState *cc)\r\n{\r\n  int gcsteps = 0;\r\n  TValue *o, *top = L->top;\r\n  CTypeID fid;\r\n  CType *ctr;\r\n  MSize maxgpr, ngpr = 0, nsp = 0, narg;\r\n#if CCALL_NARG_FPR\r\n  MSize nfpr = 0;\r\n#if LJ_TARGET_ARM\r\n  MSize fprodd = 0;\r\n#endif\r\n#endif\r\n\r\n  /* Clear unused regs to get some determinism in case of misdeclaration. */\r\n  memset(cc->gpr, 0, sizeof(cc->gpr));\r\n#if CCALL_NUM_FPR\r\n  memset(cc->fpr, 0, sizeof(cc->fpr));\r\n#endif\r\n\r\n#if LJ_TARGET_X86\r\n  /* x86 has several different calling conventions. */\r\n  cc->resx87 = 0;\r\n  switch (ctype_cconv(ct->info)) {\r\n  case CTCC_FASTCALL: maxgpr = 2; break;\r\n  case CTCC_THISCALL: maxgpr = 1; break;\r\n  default: maxgpr = 0; break;\r\n  }\r\n#else\r\n  maxgpr = CCALL_NARG_GPR;\r\n#endif\r\n\r\n  /* Perform required setup for some result types. */\r\n  ctr = ctype_rawchild(cts, ct);\r\n  if (ctype_isvector(ctr->info)) {\r\n    if (!(CCALL_VECTOR_REG && (ctr->size == 8 || ctr->size == 16)))\r\n      goto err_nyi;\r\n  } else if (ctype_iscomplex(ctr->info) || ctype_isstruct(ctr->info)) {\r\n    /* Preallocate cdata object and anchor it after arguments. */\r\n    CTSize sz = ctr->size;\r\n    GCcdata *cd = lj_cdata_new(cts, ctype_cid(ct->info), sz);\r\n    void *dp = cdataptr(cd);\r\n    setcdataV(L, L->top++, cd);\r\n    if (ctype_isstruct(ctr->info)) {\r\n      CCALL_HANDLE_STRUCTRET\r\n    } else {\r\n      CCALL_HANDLE_COMPLEXRET\r\n    }\r\n#if LJ_TARGET_X86\r\n  } else if (ctype_isfp(ctr->info)) {\r\n    cc->resx87 = ctr->size == sizeof(float) ? 1 : 2;\r\n#endif\r\n  }\r\n\r\n  /* Skip initial attributes. */\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) break;\r\n    fid = ctf->sib;\r\n  }\r\n\r\n  /* Walk through all passed arguments. */\r\n  for (o = L->base+1, narg = 1; o < top; o++, narg++) {\r\n    CTypeID did;\r\n    CType *d;\r\n    CTSize sz;\r\n    MSize n, isfp = 0, isva = 0;\r\n    void *dp, *rp = NULL;\r\n\r\n    if (fid) {  /* Get argument type from field. */\r\n      CType *ctf = ctype_get(cts, fid);\r\n      fid = ctf->sib;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      did = ctype_cid(ctf->info);\r\n    } else {\r\n      if (!(ct->info & CTF_VARARG))\r\n\tlj_err_caller(L, LJ_ERR_FFI_NUMARG);  /* Too many arguments. */\r\n      did = lj_ccall_ctid_vararg(cts, o);  /* Infer vararg type. */\r\n      isva = 1;\r\n    }\r\n    d = ctype_raw(cts, did);\r\n    sz = d->size;\r\n\r\n    /* Find out how (by value/ref) and where (GPR/FPR) to pass an argument. */\r\n    if (ctype_isnum(d->info)) {\r\n      if (sz > 8) goto err_nyi;\r\n      if ((d->info & CTF_FP))\r\n\tisfp = 1;\r\n    } else if (ctype_isvector(d->info)) {\r\n      if (CCALL_VECTOR_REG && (sz == 8 || sz == 16))\r\n\tisfp = 1;\r\n      else\r\n\tgoto err_nyi;\r\n    } else if (ctype_isstruct(d->info)) {\r\n      CCALL_HANDLE_STRUCTARG\r\n    } else if (ctype_iscomplex(d->info)) {\r\n      CCALL_HANDLE_COMPLEXARG\r\n    } else {\r\n      sz = CTSIZE_PTR;\r\n    }\r\n    sz = (sz + CTSIZE_PTR-1) & ~(CTSIZE_PTR-1);\r\n    n = sz / CTSIZE_PTR;  /* Number of GPRs or stack slots needed. */\r\n\r\n    CCALL_HANDLE_REGARG  /* Handle register arguments. */\r\n\r\n    /* Otherwise pass argument on stack. */\r\n    if (CCALL_ALIGN_STACKARG && !rp && (d->info & CTF_ALIGN) > CTALIGN_PTR) {\r\n      MSize align = (1u << ctype_align(d->info-CTALIGN_PTR)) -1;\r\n      nsp = (nsp + align) & ~align;  /* Align argument on stack. */\r\n    }\r\n    if (nsp + n > CCALL_MAXSTACK) {  /* Too many arguments. */\r\n    err_nyi:\r\n      lj_err_caller(L, LJ_ERR_FFI_NYICALL);\r\n    }\r\n    dp = &cc->stack[nsp];\r\n    nsp += n;\r\n    isva = 0;\r\n\r\n  done:\r\n    if (rp) {  /* Pass by reference. */\r\n      gcsteps++;\r\n      *(void **)dp = rp;\r\n      dp = rp;\r\n    }\r\n    lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));\r\n    /* Extend passed integers to 32 bits at least. */\r\n    if (ctype_isinteger_or_bool(d->info) && d->size < 4) {\r\n      if (d->info & CTF_UNSIGNED)\r\n\t*(uint32_t *)dp = d->size == 1 ? (uint32_t)*(uint8_t *)dp :\r\n\t\t\t\t\t (uint32_t)*(uint16_t *)dp;\r\n      else\r\n\t*(int32_t *)dp = d->size == 1 ? (int32_t)*(int8_t *)dp :\r\n\t\t\t\t\t(int32_t)*(int16_t *)dp;\r\n    }\r\n#if LJ_TARGET_X64 && LJ_ABI_WIN\r\n    if (isva) {  /* Windows/x64 mirrors varargs in both register sets. */\r\n      if (nfpr == ngpr)\r\n\tcc->gpr[ngpr-1] = cc->fpr[ngpr-1].l[0];\r\n      else\r\n\tcc->fpr[ngpr-1].l[0] = cc->gpr[ngpr-1];\r\n    }\r\n#else\r\n    UNUSED(isva);\r\n#endif\r\n#if LJ_TARGET_X64 && !LJ_ABI_WIN\r\n    if (isfp == 2 && n == 2 && (uint8_t *)dp == (uint8_t *)&cc->fpr[nfpr-2]) {\r\n      cc->fpr[nfpr-1].d[0] = cc->fpr[nfpr-2].d[1];  /* Split complex double. */\r\n      cc->fpr[nfpr-2].d[1] = 0;\r\n    }\r\n#elif LJ_TARGET_ARM64\r\n    if (isfp == 2 && (uint8_t *)dp < (uint8_t *)cc->stack) {\r\n      /* Split float HFA or complex float into separate registers. */\r\n      CTSize i = (sz >> 2) - 1;\r\n      do { ((uint64_t *)dp)[i] = ((uint32_t *)dp)[i]; } while (i--);\r\n    }\r\n#else\r\n    UNUSED(isfp);\r\n#endif\r\n  }\r\n  if (fid) lj_err_caller(L, LJ_ERR_FFI_NUMARG);  /* Too few arguments. */\r\n\r\n#if LJ_TARGET_X64 || LJ_TARGET_PPC\r\n  cc->nfpr = nfpr;  /* Required for vararg functions. */\r\n#endif\r\n  cc->nsp = nsp;\r\n  cc->spadj = (CCALL_SPS_FREE + CCALL_SPS_EXTRA)*CTSIZE_PTR;\r\n  if (nsp > CCALL_SPS_FREE)\r\n    cc->spadj += (((nsp-CCALL_SPS_FREE)*CTSIZE_PTR + 15u) & ~15u);\r\n  return gcsteps;\r\n}\r\n\r\n/* Get results from C call. */\r\nstatic int ccall_get_results(lua_State *L, CTState *cts, CType *ct,\r\n\t\t\t     CCallState *cc, int *ret)\r\n{\r\n  CType *ctr = ctype_rawchild(cts, ct);\r\n  uint8_t *sp = (uint8_t *)&cc->gpr[0];\r\n  if (ctype_isvoid(ctr->info)) {\r\n    *ret = 0;  /* Zero results. */\r\n    return 0;  /* No additional GC step. */\r\n  }\r\n  *ret = 1;  /* One result. */\r\n  if (ctype_isstruct(ctr->info)) {\r\n    /* Return cdata object which is already on top of stack. */\r\n    if (!cc->retref) {\r\n      void *dp = cdataptr(cdataV(L->top-1));  /* Use preallocated object. */\r\n      CCALL_HANDLE_STRUCTRET2\r\n    }\r\n    return 1;  /* One GC step. */\r\n  }\r\n  if (ctype_iscomplex(ctr->info)) {\r\n    /* Return cdata object which is already on top of stack. */\r\n    void *dp = cdataptr(cdataV(L->top-1));  /* Use preallocated object. */\r\n    CCALL_HANDLE_COMPLEXRET2\r\n    return 1;  /* One GC step. */\r\n  }\r\n  if (LJ_BE && ctype_isinteger_or_bool(ctr->info) && ctr->size < CTSIZE_PTR)\r\n    sp += (CTSIZE_PTR - ctr->size);\r\n#if CCALL_NUM_FPR\r\n  if (ctype_isfp(ctr->info) || ctype_isvector(ctr->info))\r\n    sp = (uint8_t *)&cc->fpr[0];\r\n#endif\r\n#ifdef CCALL_HANDLE_RET\r\n  CCALL_HANDLE_RET\r\n#endif\r\n  /* No reference types end up here, so there's no need for the CTypeID. */\r\n  lua_assert(!(ctype_isrefarray(ctr->info) || ctype_isstruct(ctr->info)));\r\n  return lj_cconv_tv_ct(cts, ctr, 0, L->top-1, sp);\r\n}\r\n\r\n/* Call C function. */\r\nint lj_ccall_func(lua_State *L, GCcdata *cd)\r\n{\r\n  CTState *cts = ctype_cts(L);\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  CTSize sz = CTSIZE_PTR;\r\n  if (ctype_isptr(ct->info)) {\r\n    sz = ct->size;\r\n    ct = ctype_rawchild(cts, ct);\r\n  }\r\n  if (ctype_isfunc(ct->info)) {\r\n    CCallState cc;\r\n    int gcsteps, ret;\r\n    cc.func = (void (*)(void))cdata_getptr(cdataptr(cd), sz);\r\n    gcsteps = ccall_set_args(L, cts, ct, &cc);\r\n    ct = (CType *)((intptr_t)ct-(intptr_t)cts->tab);\r\n    cts->cb.slot = ~0u;\r\n    lj_vm_ffi_call(&cc);\r\n    if (cts->cb.slot != ~0u) {  /* Blacklist function that called a callback. */\r\n      TValue tv;\r\n      setlightudV(&tv, (void *)cc.func);\r\n      setboolV(lj_tab_set(L, cts->miscmap, &tv), 1);\r\n    }\r\n    ct = (CType *)((intptr_t)ct+(intptr_t)cts->tab);  /* May be reallocated. */\r\n    gcsteps += ccall_get_results(L, cts, ct, &cc, &ret);\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n    /* Automatically detect __stdcall and fix up C function declaration. */\r\n    if (cc.spadj && ctype_cconv(ct->info) == CTCC_CDECL) {\r\n      CTF_INSERT(ct->info, CCONV, CTCC_STDCALL);\r\n      lj_trace_abort(G(L));\r\n    }\r\n#endif\r\n    while (gcsteps-- > 0)\r\n      lj_gc_check(L);\r\n    return ret;\r\n  }\r\n  return -1;  /* Not a function. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ccall.h",
    "content": "/*\r\n** FFI C call handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCALL_H\r\n#define _LJ_CCALL_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* -- C calling conventions ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n\r\n#if LJ_TARGET_X86\r\n#define CCALL_NARG_GPR\t\t2\t/* For fastcall arguments. */\r\n#define CCALL_NARG_FPR\t\t0\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t1\t/* For FP results on x87 stack. */\r\n#define CCALL_ALIGN_STACKARG\t0\t/* Don't align argument on stack. */\r\n#elif LJ_ABI_WIN\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NARG_FPR\t\t4\r\n#define CCALL_NRET_GPR\t\t1\r\n#define CCALL_NRET_FPR\t\t1\r\n#define CCALL_SPS_EXTRA\t\t4\r\n#else\r\n#define CCALL_NARG_GPR\t\t6\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t2\r\n#define CCALL_VECTOR_REG\t1\t/* Pass vectors in registers. */\r\n#endif\r\n\r\n#define CCALL_SPS_FREE\t\t1\r\n#define CCALL_ALIGN_CALLSTATE\t16\r\n\r\ntypedef LJ_ALIGN(16) union FPRArg {\r\n  double d[2];\r\n  float f[4];\r\n  uint8_t b[16];\r\n  uint16_t s[8];\r\n  int i[4];\r\n  int64_t l[2];\r\n} FPRArg;\r\n\r\ntypedef intptr_t GPRArg;\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NRET_GPR\t\t2\t/* For softfp double. */\r\n#if LJ_ABI_SOFTFP\r\n#define CCALL_NARG_FPR\t\t0\r\n#define CCALL_NRET_FPR\t\t0\r\n#else\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_FPR\t\t4\r\n#endif\r\n#define CCALL_SPS_FREE\t\t0\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef union FPRArg {\r\n  double d;\r\n  float f[2];\r\n} FPRArg;\r\n\r\n#elif LJ_TARGET_ARM64\r\n\r\n#define CCALL_NARG_GPR\t\t8\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_FPR\t\t4\r\n#define CCALL_SPS_FREE\t\t0\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef union FPRArg {\r\n  double d;\r\n  float f;\r\n  uint32_t u32;\r\n} FPRArg;\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CCALL_NARG_GPR\t\t8\r\n#define CCALL_NARG_FPR\t\t8\r\n#define CCALL_NRET_GPR\t\t4\t/* For complex double. */\r\n#define CCALL_NRET_FPR\t\t1\r\n#define CCALL_SPS_EXTRA\t\t4\r\n#define CCALL_SPS_FREE\t\t0\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef double FPRArg;\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CCALL_NARG_GPR\t\t4\r\n#define CCALL_NARG_FPR\t\t2\r\n#define CCALL_NRET_GPR\t\t2\r\n#define CCALL_NRET_FPR\t\t2\r\n#define CCALL_SPS_EXTRA\t\t7\r\n#define CCALL_SPS_FREE\t\t1\r\n\r\ntypedef intptr_t GPRArg;\r\ntypedef union FPRArg {\r\n  double d;\r\n  struct { LJ_ENDIAN_LOHI(float f; , float g;) };\r\n} FPRArg;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CCALL_SPS_EXTRA\r\n#define CCALL_SPS_EXTRA\t\t0\r\n#endif\r\n#ifndef CCALL_VECTOR_REG\r\n#define CCALL_VECTOR_REG\t0\r\n#endif\r\n#ifndef CCALL_ALIGN_STACKARG\r\n#define CCALL_ALIGN_STACKARG\t1\r\n#endif\r\n#ifndef CCALL_ALIGN_CALLSTATE\r\n#define CCALL_ALIGN_CALLSTATE\t8\r\n#endif\r\n\r\n#define CCALL_NUM_GPR \\\r\n  (CCALL_NARG_GPR > CCALL_NRET_GPR ? CCALL_NARG_GPR : CCALL_NRET_GPR)\r\n#define CCALL_NUM_FPR \\\r\n  (CCALL_NARG_FPR > CCALL_NRET_FPR ? CCALL_NARG_FPR : CCALL_NRET_FPR)\r\n\r\n/* Check against constants in lj_ctype.h. */\r\nLJ_STATIC_ASSERT(CCALL_NUM_GPR <= CCALL_MAX_GPR);\r\nLJ_STATIC_ASSERT(CCALL_NUM_FPR <= CCALL_MAX_FPR);\r\n\r\n#define CCALL_MAXSTACK\t\t32\r\n\r\n/* -- C call state -------------------------------------------------------- */\r\n\r\ntypedef LJ_ALIGN(CCALL_ALIGN_CALLSTATE) struct CCallState {\r\n  void (*func)(void);\t\t/* Pointer to called function. */\r\n  uint32_t spadj;\t\t/* Stack pointer adjustment. */\r\n  uint8_t nsp;\t\t\t/* Number of stack slots. */\r\n  uint8_t retref;\t\t/* Return value by reference. */\r\n#if LJ_TARGET_X64\r\n  uint8_t ngpr;\t\t\t/* Number of arguments in GPRs. */\r\n  uint8_t nfpr;\t\t\t/* Number of arguments in FPRs. */\r\n#elif LJ_TARGET_X86\r\n  uint8_t resx87;\t\t/* Result on x87 stack: 1:float, 2:double. */\r\n#elif LJ_TARGET_ARM64\r\n  void *retp;\t\t\t/* Aggregate return pointer in x8. */\r\n#elif LJ_TARGET_PPC\r\n  uint8_t nfpr;\t\t\t/* Number of arguments in FPRs. */\r\n#endif\r\n#if LJ_32\r\n  int32_t align1;\r\n#endif\r\n#if CCALL_NUM_FPR\r\n  FPRArg fpr[CCALL_NUM_FPR];\t/* Arguments/results in FPRs. */\r\n#endif\r\n  GPRArg gpr[CCALL_NUM_GPR];\t/* Arguments/results in GPRs. */\r\n  GPRArg stack[CCALL_MAXSTACK];\t/* Stack slots. */\r\n} CCallState;\r\n\r\n/* -- C call handling ----------------------------------------------------- */\r\n\r\n/* Really belongs to lj_vm.h. */\r\nLJ_ASMF void LJ_FASTCALL lj_vm_ffi_call(CCallState *cc);\r\n\r\nLJ_FUNC CTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o);\r\nLJ_FUNC int lj_ccall_func(lua_State *L, GCcdata *cd);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ccallback.c",
    "content": "/*\r\n** FFI C callback handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ccallback.h\"\r\n#include \"lj_target.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Target-specific handling of callback slots -------------------------- */\r\n\r\n#define CALLBACK_MCODE_SIZE\t(LJ_PAGESIZE * LJ_NUM_CBPAGE)\r\n\r\n#if LJ_OS_NOJIT\r\n\r\n/* Callbacks disabled. */\r\n#define CALLBACK_SLOT2OFS(slot)\t(0*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t(0*(ofs))\r\n#define CALLBACK_MAX_SLOT\t0\r\n\r\n#elif LJ_TARGET_X86ORX64\r\n\r\n#define CALLBACK_MCODE_HEAD\t(LJ_64 ? 8 : 0)\r\n#define CALLBACK_MCODE_GROUP\t(-2+1+2+(LJ_GC64 ? 10 : 5)+(LJ_64 ? 6 : 5))\r\n\r\n#define CALLBACK_SLOT2OFS(slot) \\\r\n  (CALLBACK_MCODE_HEAD + CALLBACK_MCODE_GROUP*((slot)/32) + 4*(slot))\r\n\r\nstatic MSize CALLBACK_OFS2SLOT(MSize ofs)\r\n{\r\n  MSize group;\r\n  ofs -= CALLBACK_MCODE_HEAD;\r\n  group = ofs / (32*4 + CALLBACK_MCODE_GROUP);\r\n  return (ofs % (32*4 + CALLBACK_MCODE_GROUP))/4 + group*32;\r\n}\r\n\r\n#define CALLBACK_MAX_SLOT \\\r\n  (((CALLBACK_MCODE_SIZE-CALLBACK_MCODE_HEAD)/(CALLBACK_MCODE_GROUP+4*32))*32)\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t32\r\n\r\n#elif LJ_TARGET_ARM64\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t32\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t24\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CALLBACK_MCODE_HEAD\t\t24\r\n\r\n#else\r\n\r\n/* Missing support for this architecture. */\r\n#define CALLBACK_SLOT2OFS(slot)\t(0*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t(0*(ofs))\r\n#define CALLBACK_MAX_SLOT\t0\r\n\r\n#endif\r\n\r\n#ifndef CALLBACK_SLOT2OFS\r\n#define CALLBACK_SLOT2OFS(slot)\t\t(CALLBACK_MCODE_HEAD + 8*(slot))\r\n#define CALLBACK_OFS2SLOT(ofs)\t\t(((ofs)-CALLBACK_MCODE_HEAD)/8)\r\n#define CALLBACK_MAX_SLOT\t\t(CALLBACK_OFS2SLOT(CALLBACK_MCODE_SIZE))\r\n#endif\r\n\r\n/* Convert callback slot number to callback function pointer. */\r\nstatic void *callback_slot2ptr(CTState *cts, MSize slot)\r\n{\r\n  return (uint8_t *)cts->cb.mcode + CALLBACK_SLOT2OFS(slot);\r\n}\r\n\r\n/* Convert callback function pointer to slot number. */\r\nMSize lj_ccallback_ptr2slot(CTState *cts, void *p)\r\n{\r\n  uintptr_t ofs = (uintptr_t)((uint8_t *)p -(uint8_t *)cts->cb.mcode);\r\n  if (ofs < CALLBACK_MCODE_SIZE) {\r\n    MSize slot = CALLBACK_OFS2SLOT((MSize)ofs);\r\n    if (CALLBACK_SLOT2OFS(slot) == (MSize)ofs)\r\n      return slot;\r\n  }\r\n  return ~0u;  /* Not a known callback function pointer. */\r\n}\r\n\r\n/* Initialize machine code for callback function pointers. */\r\n#if LJ_OS_NOJIT\r\n/* Disabled callback support. */\r\n#define callback_mcode_init(g, p)\tUNUSED(p)\r\n#elif LJ_TARGET_X86ORX64\r\nstatic void callback_mcode_init(global_State *g, uint8_t *page)\r\n{\r\n  uint8_t *p = page;\r\n  uint8_t *target = (uint8_t *)(void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n#if LJ_64\r\n  *(void **)p = target; p += 8;\r\n#endif\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    /* mov al, slot; jmp group */\r\n    *p++ = XI_MOVrib | RID_EAX; *p++ = (uint8_t)slot;\r\n    if ((slot & 31) == 31 || slot == CALLBACK_MAX_SLOT-1) {\r\n      /* push ebp/rbp; mov ah, slot>>8; mov ebp, &g. */\r\n      *p++ = XI_PUSH + RID_EBP;\r\n      *p++ = XI_MOVrib | (RID_EAX+4); *p++ = (uint8_t)(slot >> 8);\r\n#if LJ_GC64\r\n      *p++ = 0x48; *p++ = XI_MOVri | RID_EBP;\r\n      *(uint64_t *)p = (uint64_t)(g); p += 8;\r\n#else\r\n      *p++ = XI_MOVri | RID_EBP;\r\n      *(int32_t *)p = i32ptr(g); p += 4;\r\n#endif\r\n#if LJ_64\r\n      /* jmp [rip-pageofs] where lj_vm_ffi_callback is stored. */\r\n      *p++ = XI_GROUP5; *p++ = XM_OFS0 + (XOg_JMP<<3) + RID_EBP;\r\n      *(int32_t *)p = (int32_t)(page-(p+4)); p += 4;\r\n#else\r\n      /* jmp lj_vm_ffi_callback. */\r\n      *p++ = XI_JMP; *(int32_t *)p = target-(p+4); p += 4;\r\n#endif\r\n    } else {\r\n      *p++ = XI_JMPs; *p++ = (uint8_t)((2+2)*(31-(slot&31)) - 2);\r\n    }\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_ARM\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  /* This must match with the saveregs macro in buildvm_arm.dasc. */\r\n  *p++ = ARMI_SUB|ARMF_D(RID_R12)|ARMF_N(RID_R12)|ARMF_M(RID_PC);\r\n  *p++ = ARMI_PUSH|ARMF_N(RID_SP)|RSET_RANGE(RID_R4,RID_R11+1)|RID2RSET(RID_LR);\r\n  *p++ = ARMI_SUB|ARMI_K12|ARMF_D(RID_R12)|ARMF_N(RID_R12)|CALLBACK_MCODE_HEAD;\r\n  *p++ = ARMI_STR|ARMI_LS_P|ARMI_LS_W|ARMF_D(RID_R12)|ARMF_N(RID_SP)|(CFRAME_SIZE-4*9);\r\n  *p++ = ARMI_LDR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_R12)|ARMF_N(RID_PC);\r\n  *p++ = ARMI_LDR|ARMI_LS_P|ARMI_LS_U|ARMF_D(RID_PC)|ARMF_N(RID_PC);\r\n  *p++ = u32ptr(g);\r\n  *p++ = u32ptr(target);\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p++ = ARMI_MOV|ARMF_D(RID_R12)|ARMF_M(RID_PC);\r\n    *p = ARMI_B | ((page-p-2) & 0x00ffffffu);\r\n    p++;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_ARM64\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  *p++ = A64I_LDRLx | A64F_D(RID_X11) | A64F_S19(4);\r\n  *p++ = A64I_LDRLx | A64F_D(RID_X10) | A64F_S19(5);\r\n  *p++ = A64I_BR | A64F_N(RID_X11);\r\n  *p++ = A64I_NOP;\r\n  ((void **)p)[0] = target;\r\n  ((void **)p)[1] = g;\r\n  p += 4;\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p++ = A64I_MOVZw | A64F_D(RID_X9) | A64F_U16(slot);\r\n    *p = A64I_B | A64F_S26((page-p) & 0x03ffffffu);\r\n    p++;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_PPC\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  *p++ = PPCI_LIS | PPCF_T(RID_TMP) | (u32ptr(target) >> 16);\r\n  *p++ = PPCI_LIS | PPCF_T(RID_R12) | (u32ptr(g) >> 16);\r\n  *p++ = PPCI_ORI | PPCF_A(RID_TMP)|PPCF_T(RID_TMP) | (u32ptr(target) & 0xffff);\r\n  *p++ = PPCI_ORI | PPCF_A(RID_R12)|PPCF_T(RID_R12) | (u32ptr(g) & 0xffff);\r\n  *p++ = PPCI_MTCTR | PPCF_T(RID_TMP);\r\n  *p++ = PPCI_BCTR;\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p++ = PPCI_LI | PPCF_T(RID_R11) | slot;\r\n    *p = PPCI_B | (((page-p) & 0x00ffffffu) << 2);\r\n    p++;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#elif LJ_TARGET_MIPS\r\nstatic void callback_mcode_init(global_State *g, uint32_t *page)\r\n{\r\n  uint32_t *p = page;\r\n  void *target = (void *)lj_vm_ffi_callback;\r\n  MSize slot;\r\n  *p++ = MIPSI_SW | MIPSF_T(RID_R1)|MIPSF_S(RID_SP) | 0;\r\n  *p++ = MIPSI_LUI | MIPSF_T(RID_R3) | (u32ptr(target) >> 16);\r\n  *p++ = MIPSI_LUI | MIPSF_T(RID_R2) | (u32ptr(g) >> 16);\r\n  *p++ = MIPSI_ORI | MIPSF_T(RID_R3)|MIPSF_S(RID_R3) |(u32ptr(target)&0xffff);\r\n  *p++ = MIPSI_JR | MIPSF_S(RID_R3);\r\n  *p++ = MIPSI_ORI | MIPSF_T(RID_R2)|MIPSF_S(RID_R2) | (u32ptr(g)&0xffff);\r\n  for (slot = 0; slot < CALLBACK_MAX_SLOT; slot++) {\r\n    *p = MIPSI_B | ((page-p-1) & 0x0000ffffu);\r\n    p++;\r\n    *p++ = MIPSI_LI | MIPSF_T(RID_R1) | slot;\r\n  }\r\n  lua_assert(p - page <= CALLBACK_MCODE_SIZE);\r\n}\r\n#else\r\n/* Missing support for this architecture. */\r\n#define callback_mcode_init(g, p)\tUNUSED(p)\r\n#endif\r\n\r\n/* -- Machine code management --------------------------------------------- */\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#elif LJ_TARGET_POSIX\r\n\r\n#include <sys/mman.h>\r\n#ifndef MAP_ANONYMOUS\r\n#define MAP_ANONYMOUS   MAP_ANON\r\n#endif\r\n\r\n#endif\r\n\r\n/* Allocate and initialize area for callback function pointers. */\r\nstatic void callback_mcode_new(CTState *cts)\r\n{\r\n  size_t sz = (size_t)CALLBACK_MCODE_SIZE;\r\n  void *p;\r\n  if (CALLBACK_MAX_SLOT == 0)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#if LJ_TARGET_WINDOWS\r\n  p = VirtualAlloc(NULL, sz, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE);\r\n  if (!p)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#elif LJ_TARGET_POSIX\r\n  p = mmap(NULL, sz, (PROT_READ|PROT_WRITE), MAP_PRIVATE|MAP_ANONYMOUS,\r\n\t   -1, 0);\r\n  if (p == MAP_FAILED)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n#else\r\n  /* Fallback allocator. Fails if memory is not executable by default. */\r\n  p = lj_mem_new(cts->L, sz);\r\n#endif\r\n  cts->cb.mcode = p;\r\n  callback_mcode_init(cts->g, p);\r\n  lj_mcode_sync(p, (char *)p + sz);\r\n#if LJ_TARGET_WINDOWS\r\n  {\r\n    DWORD oprot;\r\n    VirtualProtect(p, sz, PAGE_EXECUTE_READ, &oprot);\r\n  }\r\n#elif LJ_TARGET_POSIX\r\n  mprotect(p, sz, (PROT_READ|PROT_EXEC));\r\n#endif\r\n}\r\n\r\n/* Free area for callback function pointers. */\r\nvoid lj_ccallback_mcode_free(CTState *cts)\r\n{\r\n  size_t sz = (size_t)CALLBACK_MCODE_SIZE;\r\n  void *p = cts->cb.mcode;\r\n  if (p == NULL) return;\r\n#if LJ_TARGET_WINDOWS\r\n  VirtualFree(p, 0, MEM_RELEASE);\r\n  UNUSED(sz);\r\n#elif LJ_TARGET_POSIX\r\n  munmap(p, sz);\r\n#else\r\n  lj_mem_free(cts->g, p, sz);\r\n#endif\r\n}\r\n\r\n/* -- C callback entry ---------------------------------------------------- */\r\n\r\n/* Target-specific handling of register arguments. Similar to lj_ccall.c. */\r\n#if LJ_TARGET_X86\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (!isfp) {  /* Only non-FP values may be passed in registers. */ \\\r\n    if (n > 1) {  /* Anything > 32 bit is passed on the stack. */ \\\r\n      if (!LJ_ABI_WIN) ngpr = maxgpr;  /* Prevent reordering. */ \\\r\n    } else if (ngpr + 1 <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64 && LJ_ABI_WIN\r\n\r\n/* Windows/x64 argument registers are strictly positional (use ngpr). */\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (ngpr < maxgpr) { sp = &cts->cb.fpr[ngpr++]; UNUSED(nfpr); goto done; } \\\r\n  } else { \\\r\n    if (ngpr < maxgpr) { sp = &cts->cb.gpr[ngpr++]; goto done; } \\\r\n  }\r\n\r\n#elif LJ_TARGET_X64\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (nfpr + n <= CCALL_NARG_FPR) { \\\r\n      sp = &cts->cb.fpr[nfpr]; \\\r\n      nfpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  } else { \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_ARM\r\n\r\n#if LJ_ABI_SOFTFP\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP1\tUNUSED(isfp);\r\n#define CALLBACK_HANDLE_REGARG_FP2\r\n\r\n#else\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP1 \\\r\n  if (isfp) { \\\r\n    if (n == 1) { \\\r\n      if (fprodd) { \\\r\n\tsp = &cts->cb.fpr[fprodd-1]; \\\r\n\tfprodd = 0; \\\r\n\tgoto done; \\\r\n      } else if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n\tsp = &cts->cb.fpr[nfpr++]; \\\r\n\tfprodd = nfpr; \\\r\n\tgoto done; \\\r\n      } \\\r\n    } else { \\\r\n      if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n\tsp = &cts->cb.fpr[nfpr++]; \\\r\n\tgoto done; \\\r\n      } \\\r\n    } \\\r\n    fprodd = 0;  /* No reordering after the first FP value is on stack. */ \\\r\n  } else {\r\n\r\n#define CALLBACK_HANDLE_REGARG_FP2\t}\r\n\r\n#endif\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  CALLBACK_HANDLE_REGARG_FP1 \\\r\n  if (n > 1) ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n  if (ngpr + n <= maxgpr) { \\\r\n    sp = &cts->cb.gpr[ngpr]; \\\r\n    ngpr += n; \\\r\n    goto done; \\\r\n  } CALLBACK_HANDLE_REGARG_FP2\r\n\r\n#elif LJ_TARGET_ARM64\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (nfpr + n <= CCALL_NARG_FPR) { \\\r\n      sp = &cts->cb.fpr[nfpr]; \\\r\n      nfpr += n; \\\r\n      goto done; \\\r\n    } else { \\\r\n      nfpr = CCALL_NARG_FPR;  /* Prevent reordering. */ \\\r\n    } \\\r\n  } else { \\\r\n    if (!LJ_TARGET_IOS && n > 1) \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } else { \\\r\n      ngpr = CCALL_NARG_GPR;  /* Prevent reordering. */ \\\r\n    } \\\r\n  }\r\n\r\n#elif LJ_TARGET_PPC\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp) { \\\r\n    if (nfpr + 1 <= CCALL_NARG_FPR) { \\\r\n      sp = &cts->cb.fpr[nfpr++]; \\\r\n      cta = ctype_get(cts, CTID_DOUBLE);  /* FPRs always hold doubles. */ \\\r\n      goto done; \\\r\n    } \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    if (n > 1) { \\\r\n      lua_assert(ctype_isinteger(cta->info) && n == 2);  /* int64_t. */ \\\r\n      ngpr = (ngpr + 1u) & ~1u;  /* Align int64_t to regpair. */ \\\r\n    } \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CALLBACK_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    *(double *)dp = *(float *)dp;  /* FPRs always hold doubles. */\r\n\r\n#elif LJ_TARGET_MIPS\r\n\r\n#define CALLBACK_HANDLE_REGARG \\\r\n  if (isfp && nfpr < CCALL_NARG_FPR) {  /* Try to pass argument in FPRs. */ \\\r\n    sp = (void *)((uint8_t *)&cts->cb.fpr[nfpr] + ((LJ_BE && n==1) ? 4 : 0)); \\\r\n    nfpr++; ngpr += n; \\\r\n    goto done; \\\r\n  } else {  /* Try to pass argument in GPRs. */ \\\r\n    nfpr = CCALL_NARG_FPR; \\\r\n    if (n > 1) ngpr = (ngpr + 1u) & ~1u;  /* Align to regpair. */ \\\r\n    if (ngpr + n <= maxgpr) { \\\r\n      sp = &cts->cb.gpr[ngpr]; \\\r\n      ngpr += n; \\\r\n      goto done; \\\r\n    } \\\r\n  }\r\n\r\n#define CALLBACK_HANDLE_RET \\\r\n  if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \\\r\n    ((float *)dp)[1] = *(float *)dp;\r\n\r\n#else\r\n#error \"Missing calling convention definitions for this architecture\"\r\n#endif\r\n\r\n/* Convert and push callback arguments to Lua stack. */\r\nstatic void callback_conv_args(CTState *cts, lua_State *L)\r\n{\r\n  TValue *o = L->top;\r\n  intptr_t *stack = cts->cb.stack;\r\n  MSize slot = cts->cb.slot;\r\n  CTypeID id = 0, rid, fid;\r\n  int gcsteps = 0;\r\n  CType *ct;\r\n  GCfunc *fn;\r\n  int fntp;\r\n  MSize ngpr = 0, nsp = 0, maxgpr = CCALL_NARG_GPR;\r\n#if CCALL_NARG_FPR\r\n  MSize nfpr = 0;\r\n#if LJ_TARGET_ARM\r\n  MSize fprodd = 0;\r\n#endif\r\n#endif\r\n\r\n  if (slot < cts->cb.sizeid && (id = cts->cb.cbid[slot]) != 0) {\r\n    ct = ctype_get(cts, id);\r\n    rid = ctype_cid(ct->info);  /* Return type. x86: +(spadj<<16). */\r\n    fn = funcV(lj_tab_getint(cts->miscmap, (int32_t)slot));\r\n    fntp = LJ_TFUNC;\r\n  } else {  /* Must set up frame first, before throwing the error. */\r\n    ct = NULL;\r\n    rid = 0;\r\n    fn = (GCfunc *)L;\r\n    fntp = LJ_TTHREAD;\r\n  }\r\n  /* Continuation returns from callback. */\r\n  if (LJ_FR2) {\r\n    (o++)->u64 = LJ_CONT_FFI_CALLBACK;\r\n    (o++)->u64 = rid;\r\n    o++;\r\n  } else {\r\n    o->u32.lo = LJ_CONT_FFI_CALLBACK;\r\n    o->u32.hi = rid;\r\n    o++;\r\n  }\r\n  setframe_gc(o, obj2gco(fn), fntp);\r\n  setframe_ftsz(o, ((char *)(o+1) - (char *)L->base) + FRAME_CONT);\r\n  L->top = L->base = ++o;\r\n  if (!ct)\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_BADCBACK);\r\n  if (isluafunc(fn))\r\n    setcframe_pc(L->cframe, proto_bc(funcproto(fn))+1);\r\n  lj_state_checkstack(L, LUA_MINSTACK);  /* May throw. */\r\n  o = L->base;  /* Might have been reallocated. */\r\n\r\n#if LJ_TARGET_X86\r\n  /* x86 has several different calling conventions. */\r\n  switch (ctype_cconv(ct->info)) {\r\n  case CTCC_FASTCALL: maxgpr = 2; break;\r\n  case CTCC_THISCALL: maxgpr = 1; break;\r\n  default: maxgpr = 0; break;\r\n  }\r\n#endif\r\n\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) {\r\n      CType *cta;\r\n      void *sp;\r\n      CTSize sz;\r\n      int isfp;\r\n      MSize n;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      cta = ctype_rawchild(cts, ctf);\r\n      isfp = ctype_isfp(cta->info);\r\n      sz = (cta->size + CTSIZE_PTR-1) & ~(CTSIZE_PTR-1);\r\n      n = sz / CTSIZE_PTR;  /* Number of GPRs or stack slots needed. */\r\n\r\n      CALLBACK_HANDLE_REGARG  /* Handle register arguments. */\r\n\r\n      /* Otherwise pass argument on stack. */\r\n      if (CCALL_ALIGN_STACKARG && LJ_32 && sz == 8)\r\n\tnsp = (nsp + 1) & ~1u;  /* Align 64 bit argument on stack. */\r\n      sp = &stack[nsp];\r\n      nsp += n;\r\n\r\n    done:\r\n      if (LJ_BE && cta->size < CTSIZE_PTR)\r\n\tsp = (void *)((uint8_t *)sp + CTSIZE_PTR-cta->size);\r\n      gcsteps += lj_cconv_tv_ct(cts, cta, 0, o++, sp);\r\n    }\r\n    fid = ctf->sib;\r\n  }\r\n  L->top = o;\r\n#if LJ_TARGET_X86\r\n  /* Store stack adjustment for returns from non-cdecl callbacks. */\r\n  if (ctype_cconv(ct->info) != CTCC_CDECL) {\r\n#if LJ_FR2\r\n    (L->base-3)->u64 |= (nsp << (16+2));\r\n#else\r\n    (L->base-2)->u32.hi |= (nsp << (16+2));\r\n#endif\r\n  }\r\n#endif\r\n  while (gcsteps-- > 0)\r\n    lj_gc_check(L);\r\n}\r\n\r\n/* Convert Lua object to callback result. */\r\nstatic void callback_conv_result(CTState *cts, lua_State *L, TValue *o)\r\n{\r\n#if LJ_FR2\r\n  CType *ctr = ctype_raw(cts, (uint16_t)(L->base-3)->u64);\r\n#else\r\n  CType *ctr = ctype_raw(cts, (uint16_t)(L->base-2)->u32.hi);\r\n#endif\r\n#if LJ_TARGET_X86\r\n  cts->cb.gpr[2] = 0;\r\n#endif\r\n  if (!ctype_isvoid(ctr->info)) {\r\n    uint8_t *dp = (uint8_t *)&cts->cb.gpr[0];\r\n#if CCALL_NUM_FPR\r\n    if (ctype_isfp(ctr->info))\r\n      dp = (uint8_t *)&cts->cb.fpr[0];\r\n#endif\r\n    lj_cconv_ct_tv(cts, ctr, dp, o, 0);\r\n#ifdef CALLBACK_HANDLE_RET\r\n    CALLBACK_HANDLE_RET\r\n#endif\r\n    /* Extend returned integers to (at least) 32 bits. */\r\n    if (ctype_isinteger_or_bool(ctr->info) && ctr->size < 4) {\r\n      if (ctr->info & CTF_UNSIGNED)\r\n\t*(uint32_t *)dp = ctr->size == 1 ? (uint32_t)*(uint8_t *)dp :\r\n\t\t\t\t\t   (uint32_t)*(uint16_t *)dp;\r\n      else\r\n\t*(int32_t *)dp = ctr->size == 1 ? (int32_t)*(int8_t *)dp :\r\n\t\t\t\t\t  (int32_t)*(int16_t *)dp;\r\n    }\r\n#if LJ_TARGET_X86\r\n    if (ctype_isfp(ctr->info))\r\n      cts->cb.gpr[2] = ctr->size == sizeof(float) ? 1 : 2;\r\n#endif\r\n  }\r\n}\r\n\r\n/* Enter callback. */\r\nlua_State * LJ_FASTCALL lj_ccallback_enter(CTState *cts, void *cf)\r\n{\r\n  lua_State *L = cts->L;\r\n  global_State *g = cts->g;\r\n  lua_assert(L != NULL);\r\n  if (tvref(g->jit_base)) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_FFI_BADCBACK));\r\n    if (g->panic) g->panic(L);\r\n    exit(EXIT_FAILURE);\r\n  }\r\n  lj_trace_abort(g);  /* Never record across callback. */\r\n  /* Setup C frame. */\r\n  cframe_prev(cf) = L->cframe;\r\n  setcframe_L(cf, L);\r\n  cframe_errfunc(cf) = -1;\r\n  cframe_nres(cf) = 0;\r\n  L->cframe = cf;\r\n  callback_conv_args(cts, L);\r\n  return L;  /* Now call the function on this stack. */\r\n}\r\n\r\n/* Leave callback. */\r\nvoid LJ_FASTCALL lj_ccallback_leave(CTState *cts, TValue *o)\r\n{\r\n  lua_State *L = cts->L;\r\n  GCfunc *fn;\r\n  TValue *obase = L->base;\r\n  L->base = L->top;  /* Keep continuation frame for throwing errors. */\r\n  if (o >= L->base) {\r\n    /* PC of RET* is lost. Point to last line for result conv. errors. */\r\n    fn = curr_func(L);\r\n    if (isluafunc(fn)) {\r\n      GCproto *pt = funcproto(fn);\r\n      setcframe_pc(L->cframe, proto_bc(pt)+pt->sizebc+1);\r\n    }\r\n  }\r\n  callback_conv_result(cts, L, o);\r\n  /* Finally drop C frame and continuation frame. */\r\n  L->top -= 2+2*LJ_FR2;\r\n  L->base = obase;\r\n  L->cframe = cframe_prev(L->cframe);\r\n  cts->cb.slot = 0;  /* Blacklist C function that called the callback. */\r\n}\r\n\r\n/* -- C callback management ----------------------------------------------- */\r\n\r\n/* Get an unused slot in the callback slot table. */\r\nstatic MSize callback_slot_new(CTState *cts, CType *ct)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  CTypeID1 *cbid = cts->cb.cbid;\r\n  MSize top;\r\n  for (top = cts->cb.topid; top < cts->cb.sizeid; top++)\r\n    if (LJ_LIKELY(cbid[top] == 0))\r\n      goto found;\r\n#if CALLBACK_MAX_SLOT\r\n  if (top >= CALLBACK_MAX_SLOT)\r\n#endif\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_CBACKOV);\r\n  if (!cts->cb.mcode)\r\n    callback_mcode_new(cts);\r\n  lj_mem_growvec(cts->L, cbid, cts->cb.sizeid, CALLBACK_MAX_SLOT, CTypeID1);\r\n  cts->cb.cbid = cbid;\r\n  memset(cbid+top, 0, (cts->cb.sizeid-top)*sizeof(CTypeID1));\r\nfound:\r\n  cbid[top] = id;\r\n  cts->cb.topid = top+1;\r\n  return top;\r\n}\r\n\r\n/* Check for function pointer and supported argument/result types. */\r\nstatic CType *callback_checkfunc(CTState *cts, CType *ct)\r\n{\r\n  int narg = 0;\r\n  if (!ctype_isptr(ct->info) || (LJ_64 && ct->size != CTSIZE_PTR))\r\n    return NULL;\r\n  ct = ctype_rawchild(cts, ct);\r\n  if (ctype_isfunc(ct->info)) {\r\n    CType *ctr = ctype_rawchild(cts, ct);\r\n    CTypeID fid = ct->sib;\r\n    if (!(ctype_isvoid(ctr->info) || ctype_isenum(ctr->info) ||\r\n\t  ctype_isptr(ctr->info) || (ctype_isnum(ctr->info) && ctr->size <= 8)))\r\n      return NULL;\r\n    if ((ct->info & CTF_VARARG))\r\n      return NULL;\r\n    while (fid) {\r\n      CType *ctf = ctype_get(cts, fid);\r\n      if (!ctype_isattrib(ctf->info)) {\r\n\tCType *cta;\r\n\tlua_assert(ctype_isfield(ctf->info));\r\n\tcta = ctype_rawchild(cts, ctf);\r\n\tif (!(ctype_isenum(cta->info) || ctype_isptr(cta->info) ||\r\n\t      (ctype_isnum(cta->info) && cta->size <= 8)) ||\r\n\t    ++narg >= LUA_MINSTACK-3)\r\n\t  return NULL;\r\n      }\r\n      fid = ctf->sib;\r\n    }\r\n    return ct;\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Create a new callback and return the callback function pointer. */\r\nvoid *lj_ccallback_new(CTState *cts, CType *ct, GCfunc *fn)\r\n{\r\n  ct = callback_checkfunc(cts, ct);\r\n  if (ct) {\r\n    MSize slot = callback_slot_new(cts, ct);\r\n    GCtab *t = cts->miscmap;\r\n    setfuncV(cts->L, lj_tab_setint(cts->L, t, (int32_t)slot), fn);\r\n    lj_gc_anybarriert(cts->L, t);\r\n    return callback_slot2ptr(cts, slot);\r\n  }\r\n  return NULL;  /* Bad conversion. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ccallback.h",
    "content": "/*\r\n** FFI C callback handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCALLBACK_H\r\n#define _LJ_CCALLBACK_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Really belongs to lj_vm.h. */\r\nLJ_ASMF void lj_vm_ffi_callback(void);\r\n\r\nLJ_FUNC MSize lj_ccallback_ptr2slot(CTState *cts, void *p);\r\nLJ_FUNCA lua_State * LJ_FASTCALL lj_ccallback_enter(CTState *cts, void *cf);\r\nLJ_FUNCA void LJ_FASTCALL lj_ccallback_leave(CTState *cts, TValue *o);\r\nLJ_FUNC void *lj_ccallback_new(CTState *cts, CType *ct, GCfunc *fn);\r\nLJ_FUNC void lj_ccallback_mcode_free(CTState *cts);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cconv.c",
    "content": "/*\r\n** C type conversions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_ccallback.h\"\r\n\r\n/* -- Conversion errors --------------------------------------------------- */\r\n\r\n/* Bad conversion. */\r\nLJ_NORET static void cconv_err_conv(CTState *cts, CType *d, CType *s,\r\n\t\t\t\t    CTInfo flags)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  const char *src;\r\n  if ((flags & CCF_FROMTV))\r\n    src = lj_obj_typename[1+(ctype_isnum(s->info) ? LUA_TNUMBER :\r\n\t\t\t     ctype_isarray(s->info) ? LUA_TSTRING : LUA_TNIL)];\r\n  else\r\n    src = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, s), NULL));\r\n  if (CCF_GETARG(flags))\r\n    lj_err_argv(cts->L, CCF_GETARG(flags), LJ_ERR_FFI_BADCONV, src, dst);\r\n  else\r\n    lj_err_callerv(cts->L, LJ_ERR_FFI_BADCONV, src, dst);\r\n}\r\n\r\n/* Bad conversion from TValue. */\r\nLJ_NORET static void cconv_err_convtv(CTState *cts, CType *d, TValue *o,\r\n\t\t\t\t      CTInfo flags)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  const char *src = lj_typename(o);\r\n  if (CCF_GETARG(flags))\r\n    lj_err_argv(cts->L, CCF_GETARG(flags), LJ_ERR_FFI_BADCONV, src, dst);\r\n  else\r\n    lj_err_callerv(cts->L, LJ_ERR_FFI_BADCONV, src, dst);\r\n}\r\n\r\n/* Initializer overflow. */\r\nLJ_NORET static void cconv_err_initov(CTState *cts, CType *d)\r\n{\r\n  const char *dst = strdata(lj_ctype_repr(cts->L, ctype_typeid(cts, d), NULL));\r\n  lj_err_callerv(cts->L, LJ_ERR_FFI_INITOV, dst);\r\n}\r\n\r\n/* -- C type compatibility checks ----------------------------------------- */\r\n\r\n/* Get raw type and qualifiers for a child type. Resolves enums, too. */\r\nstatic CType *cconv_childqual(CTState *cts, CType *ct, CTInfo *qual)\r\n{\r\n  ct = ctype_child(cts, ct);\r\n  for (;;) {\r\n    if (ctype_isattrib(ct->info)) {\r\n      if (ctype_attrib(ct->info) == CTA_QUAL) *qual |= ct->size;\r\n    } else if (!ctype_isenum(ct->info)) {\r\n      break;\r\n    }\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n  *qual |= (ct->info & CTF_QUAL);\r\n  return ct;\r\n}\r\n\r\n/* Check for compatible types when converting to a pointer.\r\n** Note: these checks are more relaxed than what C99 mandates.\r\n*/\r\nint lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags)\r\n{\r\n  if (!((flags & CCF_CAST) || d == s)) {\r\n    CTInfo dqual = 0, squal = 0;\r\n    d = cconv_childqual(cts, d, &dqual);\r\n    if (!ctype_isstruct(s->info))\r\n      s = cconv_childqual(cts, s, &squal);\r\n    if ((flags & CCF_SAME)) {\r\n      if (dqual != squal)\r\n\treturn 0;  /* Different qualifiers. */\r\n    } else if (!(flags & CCF_IGNQUAL)) {\r\n      if ((dqual & squal) != squal)\r\n\treturn 0;  /* Discarded qualifiers. */\r\n      if (ctype_isvoid(d->info) || ctype_isvoid(s->info))\r\n\treturn 1;  /* Converting to/from void * is always ok. */\r\n    }\r\n    if (ctype_type(d->info) != ctype_type(s->info) ||\r\n\td->size != s->size)\r\n      return 0;  /* Different type or different size. */\r\n    if (ctype_isnum(d->info)) {\r\n      if (((d->info ^ s->info) & (CTF_BOOL|CTF_FP)))\r\n\treturn 0;  /* Different numeric types. */\r\n    } else if (ctype_ispointer(d->info)) {\r\n      /* Check child types for compatibility. */\r\n      return lj_cconv_compatptr(cts, d, s, flags|CCF_SAME);\r\n    } else if (ctype_isstruct(d->info)) {\r\n      if (d != s)\r\n\treturn 0;  /* Must be exact same type for struct/union. */\r\n    } else if (ctype_isfunc(d->info)) {\r\n      /* NYI: structural equality of functions. */\r\n    }\r\n  }\r\n  return 1;  /* Types are compatible. */\r\n}\r\n\r\n/* -- C type to C type conversion ----------------------------------------- */\r\n\r\n/* Convert C type to C type. Caveat: expects to get the raw CType!\r\n**\r\n** Note: This is only used by the interpreter and not optimized at all.\r\n** The JIT compiler will do a much better job specializing for each case.\r\n*/\r\nvoid lj_cconv_ct_ct(CTState *cts, CType *d, CType *s,\r\n\t\t    uint8_t *dp, uint8_t *sp, CTInfo flags)\r\n{\r\n  CTSize dsize = d->size, ssize = s->size;\r\n  CTInfo dinfo = d->info, sinfo = s->info;\r\n  void *tmpptr;\r\n\r\n  lua_assert(!ctype_isenum(dinfo) && !ctype_isenum(sinfo));\r\n  lua_assert(!ctype_isattrib(dinfo) && !ctype_isattrib(sinfo));\r\n\r\n  if (ctype_type(dinfo) > CT_MAYCONVERT || ctype_type(sinfo) > CT_MAYCONVERT)\r\n    goto err_conv;\r\n\r\n  /* Some basic sanity checks. */\r\n  lua_assert(!ctype_isnum(dinfo) || dsize > 0);\r\n  lua_assert(!ctype_isnum(sinfo) || ssize > 0);\r\n  lua_assert(!ctype_isbool(dinfo) || dsize == 1 || dsize == 4);\r\n  lua_assert(!ctype_isbool(sinfo) || ssize == 1 || ssize == 4);\r\n  lua_assert(!ctype_isinteger(dinfo) || (1u<<lj_fls(dsize)) == dsize);\r\n  lua_assert(!ctype_isinteger(sinfo) || (1u<<lj_fls(ssize)) == ssize);\r\n\r\n  switch (cconv_idx2(dinfo, sinfo)) {\r\n  /* Destination is a bool. */\r\n  case CCX(B, B):\r\n    /* Source operand is already normalized. */\r\n    if (dsize == 1) *dp = *sp; else *(int *)dp = *sp;\r\n    break;\r\n  case CCX(B, I): {\r\n    MSize i;\r\n    uint8_t b = 0;\r\n    for (i = 0; i < ssize; i++) b |= sp[i];\r\n    b = (b != 0);\r\n    if (dsize == 1) *dp = b; else *(int *)dp = b;\r\n    break;\r\n    }\r\n  case CCX(B, F): {\r\n    uint8_t b;\r\n    if (ssize == sizeof(double)) b = (*(double *)sp != 0);\r\n    else if (ssize == sizeof(float)) b = (*(float *)sp != 0);\r\n    else goto err_conv;  /* NYI: long double. */\r\n    if (dsize == 1) *dp = b; else *(int *)dp = b;\r\n    break;\r\n    }\r\n\r\n  /* Destination is an integer. */\r\n  case CCX(I, B):\r\n  case CCX(I, I):\r\n  conv_I_I:\r\n    if (dsize > ssize) {  /* Zero-extend or sign-extend LSB. */\r\n#if LJ_LE\r\n      uint8_t fill = (!(sinfo & CTF_UNSIGNED) && (sp[ssize-1]&0x80)) ? 0xff : 0;\r\n      memcpy(dp, sp, ssize);\r\n      memset(dp + ssize, fill, dsize-ssize);\r\n#else\r\n      uint8_t fill = (!(sinfo & CTF_UNSIGNED) && (sp[0]&0x80)) ? 0xff : 0;\r\n      memset(dp, fill, dsize-ssize);\r\n      memcpy(dp + (dsize-ssize), sp, ssize);\r\n#endif\r\n    } else {  /* Copy LSB. */\r\n#if LJ_LE\r\n      memcpy(dp, sp, dsize);\r\n#else\r\n      memcpy(dp, sp + (ssize-dsize), dsize);\r\n#endif\r\n    }\r\n    break;\r\n  case CCX(I, F): {\r\n    double n;  /* Always convert via double. */\r\n  conv_I_F:\r\n    /* Convert source to double. */\r\n    if (ssize == sizeof(double)) n = *(double *)sp;\r\n    else if (ssize == sizeof(float)) n = (double)*(float *)sp;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    /* Then convert double to integer. */\r\n    /* The conversion must exactly match the semantics of JIT-compiled code! */\r\n    if (dsize < 4 || (dsize == 4 && !(dinfo & CTF_UNSIGNED))) {\r\n      int32_t i = (int32_t)n;\r\n      if (dsize == 4) *(int32_t *)dp = i;\r\n      else if (dsize == 2) *(int16_t *)dp = (int16_t)i;\r\n      else *(int8_t *)dp = (int8_t)i;\r\n    } else if (dsize == 4) {\r\n      *(uint32_t *)dp = (uint32_t)n;\r\n    } else if (dsize == 8) {\r\n      if (!(dinfo & CTF_UNSIGNED))\r\n\t*(int64_t *)dp = (int64_t)n;\r\n      else\r\n\t*(uint64_t *)dp = lj_num2u64(n);\r\n    } else {\r\n      goto err_conv;  /* NYI: conversion to >64 bit integers. */\r\n    }\r\n    break;\r\n    }\r\n  case CCX(I, C):\r\n    s = ctype_child(cts, s);\r\n    sinfo = s->info;\r\n    ssize = s->size;\r\n    goto conv_I_F;  /* Just convert re. */\r\n  case CCX(I, P):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    goto conv_I_I;\r\n  case CCX(I, A):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    ssize = CTSIZE_PTR;\r\n    tmpptr = sp;\r\n    sp = (uint8_t *)&tmpptr;\r\n    goto conv_I_I;\r\n\r\n  /* Destination is a floating-point number. */\r\n  case CCX(F, B):\r\n  case CCX(F, I): {\r\n    double n;  /* Always convert via double. */\r\n  conv_F_I:\r\n    /* First convert source to double. */\r\n    /* The conversion must exactly match the semantics of JIT-compiled code! */\r\n    if (ssize < 4 || (ssize == 4 && !(sinfo & CTF_UNSIGNED))) {\r\n      int32_t i;\r\n      if (ssize == 4) {\r\n\ti = *(int32_t *)sp;\r\n      } else if (!(sinfo & CTF_UNSIGNED)) {\r\n\tif (ssize == 2) i = *(int16_t *)sp;\r\n\telse i = *(int8_t *)sp;\r\n      } else {\r\n\tif (ssize == 2) i = *(uint16_t *)sp;\r\n\telse i = *(uint8_t *)sp;\r\n      }\r\n      n = (double)i;\r\n    } else if (ssize == 4) {\r\n      n = (double)*(uint32_t *)sp;\r\n    } else if (ssize == 8) {\r\n      if (!(sinfo & CTF_UNSIGNED)) n = (double)*(int64_t *)sp;\r\n      else n = (double)*(uint64_t *)sp;\r\n    } else {\r\n      goto err_conv;  /* NYI: conversion from >64 bit integers. */\r\n    }\r\n    /* Convert double to destination. */\r\n    if (dsize == sizeof(double)) *(double *)dp = n;\r\n    else if (dsize == sizeof(float)) *(float *)dp = (float)n;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    break;\r\n    }\r\n  case CCX(F, F): {\r\n    double n;  /* Always convert via double. */\r\n  conv_F_F:\r\n    if (ssize == dsize) goto copyval;\r\n    /* Convert source to double. */\r\n    if (ssize == sizeof(double)) n = *(double *)sp;\r\n    else if (ssize == sizeof(float)) n = (double)*(float *)sp;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    /* Convert double to destination. */\r\n    if (dsize == sizeof(double)) *(double *)dp = n;\r\n    else if (dsize == sizeof(float)) *(float *)dp = (float)n;\r\n    else goto err_conv;  /* NYI: long double. */\r\n    break;\r\n    }\r\n  case CCX(F, C):\r\n    s = ctype_child(cts, s);\r\n    sinfo = s->info;\r\n    ssize = s->size;\r\n    goto conv_F_F;  /* Ignore im, and convert from re. */\r\n\r\n  /* Destination is a complex number. */\r\n  case CCX(C, I):\r\n    d = ctype_child(cts, d);\r\n    dinfo = d->info;\r\n    dsize = d->size;\r\n    memset(dp + dsize, 0, dsize);  /* Clear im. */\r\n    goto conv_F_I;  /* Convert to re. */\r\n  case CCX(C, F):\r\n    d = ctype_child(cts, d);\r\n    dinfo = d->info;\r\n    dsize = d->size;\r\n    memset(dp + dsize, 0, dsize);  /* Clear im. */\r\n    goto conv_F_F;  /* Convert to re. */\r\n\r\n  case CCX(C, C):\r\n    if (dsize != ssize) {  /* Different types: convert re/im separately. */\r\n      CType *dc = ctype_child(cts, d);\r\n      CType *sc = ctype_child(cts, s);\r\n      lj_cconv_ct_ct(cts, dc, sc, dp, sp, flags);\r\n      lj_cconv_ct_ct(cts, dc, sc, dp + dc->size, sp + sc->size, flags);\r\n      return;\r\n    }\r\n    goto copyval;  /* Otherwise this is easy. */\r\n\r\n  /* Destination is a vector. */\r\n  case CCX(V, I):\r\n  case CCX(V, F):\r\n  case CCX(V, C): {\r\n    CType *dc = ctype_child(cts, d);\r\n    CTSize esize;\r\n    /* First convert the scalar to the first element. */\r\n    lj_cconv_ct_ct(cts, dc, s, dp, sp, flags);\r\n    /* Then replicate it to the other elements (splat). */\r\n    for (sp = dp, esize = dc->size; dsize > esize; dsize -= esize) {\r\n      dp += esize;\r\n      memcpy(dp, sp, esize);\r\n    }\r\n    break;\r\n    }\r\n\r\n  case CCX(V, V):\r\n    /* Copy same-sized vectors, even for different lengths/element-types. */\r\n    if (dsize != ssize) goto err_conv;\r\n    goto copyval;\r\n\r\n  /* Destination is a pointer. */\r\n  case CCX(P, I):\r\n    if (!(flags & CCF_CAST)) goto err_conv;\r\n    dinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    goto conv_I_I;\r\n\r\n  case CCX(P, F):\r\n    if (!(flags & CCF_CAST) || !(flags & CCF_FROMTV)) goto err_conv;\r\n    /* The signed conversion is cheaper. x64 really has 47 bit pointers. */\r\n    dinfo = CTINFO(CT_NUM, (LJ_64 && dsize == 8) ? 0 : CTF_UNSIGNED);\r\n    goto conv_I_F;\r\n\r\n  case CCX(P, P):\r\n    if (!lj_cconv_compatptr(cts, d, s, flags)) goto err_conv;\r\n    cdata_setptr(dp, dsize, cdata_getptr(sp, ssize));\r\n    break;\r\n\r\n  case CCX(P, A):\r\n  case CCX(P, S):\r\n    if (!lj_cconv_compatptr(cts, d, s, flags)) goto err_conv;\r\n    cdata_setptr(dp, dsize, sp);\r\n    break;\r\n\r\n  /* Destination is an array. */\r\n  case CCX(A, A):\r\n    if ((flags & CCF_CAST) || (d->info & CTF_VLA) || dsize != ssize ||\r\n\td->size == CTSIZE_INVALID || !lj_cconv_compatptr(cts, d, s, flags))\r\n      goto err_conv;\r\n    goto copyval;\r\n\r\n  /* Destination is a struct/union. */\r\n  case CCX(S, S):\r\n    if ((flags & CCF_CAST) || (d->info & CTF_VLA) || d != s)\r\n      goto err_conv;  /* Must be exact same type. */\r\ncopyval:  /* Copy value. */\r\n    lua_assert(dsize == ssize);\r\n    memcpy(dp, sp, dsize);\r\n    break;\r\n\r\n  default:\r\n  err_conv:\r\n    cconv_err_conv(cts, d, s, flags);\r\n  }\r\n}\r\n\r\n/* -- C type to TValue conversion ----------------------------------------- */\r\n\r\n/* Convert C type to TValue. Caveat: expects to get the raw CType! */\r\nint lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid,\r\n\t\t   TValue *o, uint8_t *sp)\r\n{\r\n  CTInfo sinfo = s->info;\r\n  if (ctype_isnum(sinfo)) {\r\n    if (!ctype_isbool(sinfo)) {\r\n      if (ctype_isinteger(sinfo) && s->size > 4) goto copyval;\r\n      if (LJ_DUALNUM && ctype_isinteger(sinfo)) {\r\n\tint32_t i;\r\n\tlj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT32), s,\r\n\t\t       (uint8_t *)&i, sp, 0);\r\n\tif ((sinfo & CTF_UNSIGNED) && i < 0)\r\n\t  setnumV(o, (lua_Number)(uint32_t)i);\r\n\telse\r\n\t  setintV(o, i);\r\n      } else {\r\n\tlj_cconv_ct_ct(cts, ctype_get(cts, CTID_DOUBLE), s,\r\n\t\t       (uint8_t *)&o->n, sp, 0);\r\n\t/* Numbers are NOT canonicalized here! Beware of uninitialized data. */\r\n\tlua_assert(tvisnum(o));\r\n      }\r\n    } else {\r\n      uint32_t b = s->size == 1 ? (*sp != 0) : (*(int *)sp != 0);\r\n      setboolV(o, b);\r\n      setboolV(&cts->g->tmptv2, b);  /* Remember for trace recorder. */\r\n    }\r\n    return 0;\r\n  } else if (ctype_isrefarray(sinfo) || ctype_isstruct(sinfo)) {\r\n    /* Create reference. */\r\n    setcdataV(cts->L, o, lj_cdata_newref(cts, sp, sid));\r\n    return 1;  /* Need GC step. */\r\n  } else {\r\n    GCcdata *cd;\r\n    CTSize sz;\r\n  copyval:  /* Copy value. */\r\n    sz = s->size;\r\n    lua_assert(sz != CTSIZE_INVALID);\r\n    /* Attributes are stripped, qualifiers are kept (but mostly ignored). */\r\n    cd = lj_cdata_new(cts, ctype_typeid(cts, s), sz);\r\n    setcdataV(cts->L, o, cd);\r\n    memcpy(cdataptr(cd), sp, sz);\r\n    return 1;  /* Need GC step. */\r\n  }\r\n}\r\n\r\n/* Convert bitfield to TValue. */\r\nint lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp)\r\n{\r\n  CTInfo info = s->info;\r\n  CTSize pos, bsz;\r\n  uint32_t val;\r\n  lua_assert(ctype_isbitfield(info));\r\n  /* NYI: packed bitfields may cause misaligned reads. */\r\n  switch (ctype_bitcsz(info)) {\r\n  case 4: val = *(uint32_t *)sp; break;\r\n  case 2: val = *(uint16_t *)sp; break;\r\n  case 1: val = *(uint8_t *)sp; break;\r\n  default: lua_assert(0); val = 0; break;\r\n  }\r\n  /* Check if a packed bitfield crosses a container boundary. */\r\n  pos = ctype_bitpos(info);\r\n  bsz = ctype_bitbsz(info);\r\n  lua_assert(pos < 8*ctype_bitcsz(info));\r\n  lua_assert(bsz > 0 && bsz <= 8*ctype_bitcsz(info));\r\n  if (pos + bsz > 8*ctype_bitcsz(info))\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_NYIPACKBIT);\r\n  if (!(info & CTF_BOOL)) {\r\n    CTSize shift = 32 - bsz;\r\n    if (!(info & CTF_UNSIGNED)) {\r\n      setintV(o, (int32_t)(val << (shift-pos)) >> shift);\r\n    } else {\r\n      val = (val << (shift-pos)) >> shift;\r\n      if (!LJ_DUALNUM || (int32_t)val < 0)\r\n\tsetnumV(o, (lua_Number)(uint32_t)val);\r\n      else\r\n\tsetintV(o, (int32_t)val);\r\n    }\r\n  } else {\r\n    lua_assert(bsz == 1);\r\n    setboolV(o, (val >> pos) & 1);\r\n  }\r\n  return 0;  /* No GC step needed. */\r\n}\r\n\r\n/* -- TValue to C type conversion ----------------------------------------- */\r\n\r\n/* Convert table to array. */\r\nstatic void cconv_array_tab(CTState *cts, CType *d,\r\n\t\t\t    uint8_t *dp, GCtab *t, CTInfo flags)\r\n{\r\n  int32_t i;\r\n  CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n  CTSize size = d->size, esize = dc->size, ofs = 0;\r\n  for (i = 0; ; i++) {\r\n    TValue *tv = (TValue *)lj_tab_getint(t, i);\r\n    if (!tv || tvisnil(tv)) {\r\n      if (i == 0) continue;  /* Try again for 1-based tables. */\r\n      break;  /* Stop at first nil. */\r\n    }\r\n    if (ofs >= size)\r\n      cconv_err_initov(cts, d);\r\n    lj_cconv_ct_tv(cts, dc, dp + ofs, tv, flags);\r\n    ofs += esize;\r\n  }\r\n  if (size != CTSIZE_INVALID) {  /* Only fill up arrays with known size. */\r\n    if (ofs == esize) {  /* Replicate a single element. */\r\n      for (; ofs < size; ofs += esize) memcpy(dp + ofs, dp, esize);\r\n    } else {  /* Otherwise fill the remainder with zero. */\r\n      memset(dp + ofs, 0, size - ofs);\r\n    }\r\n  }\r\n}\r\n\r\n/* Convert table to sub-struct/union. */\r\nstatic void cconv_substruct_tab(CTState *cts, CType *d, uint8_t *dp,\r\n\t\t\t\tGCtab *t, int32_t *ip, CTInfo flags)\r\n{\r\n  CTypeID id = d->sib;\r\n  while (id) {\r\n    CType *df = ctype_get(cts, id);\r\n    id = df->sib;\r\n    if (ctype_isfield(df->info) || ctype_isbitfield(df->info)) {\r\n      TValue *tv;\r\n      int32_t i = *ip, iz = i;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      if (i >= 0) {\r\n      retry:\r\n\ttv = (TValue *)lj_tab_getint(t, i);\r\n\tif (!tv || tvisnil(tv)) {\r\n\t  if (i == 0) { i = 1; goto retry; }  /* 1-based tables. */\r\n\t  if (iz == 0) { *ip = i = -1; goto tryname; }  /* Init named fields. */\r\n\t  break;  /* Stop at first nil. */\r\n\t}\r\n\t*ip = i + 1;\r\n      } else {\r\n      tryname:\r\n\ttv = (TValue *)lj_tab_getstr(t, gco2str(gcref(df->name)));\r\n\tif (!tv || tvisnil(tv)) continue;\r\n      }\r\n      if (ctype_isfield(df->info))\r\n\tlj_cconv_ct_tv(cts, ctype_rawchild(cts, df), dp+df->size, tv, flags);\r\n      else\r\n\tlj_cconv_bf_tv(cts, df, dp+df->size, tv);\r\n      if ((d->info & CTF_UNION)) break;\r\n    } else if (ctype_isxattrib(df->info, CTA_SUBTYPE)) {\r\n      cconv_substruct_tab(cts, ctype_rawchild(cts, df),\r\n\t\t\t  dp+df->size, t, ip, flags);\r\n    }  /* Ignore all other entries in the chain. */\r\n  }\r\n}\r\n\r\n/* Convert table to struct/union. */\r\nstatic void cconv_struct_tab(CTState *cts, CType *d,\r\n\t\t\t     uint8_t *dp, GCtab *t, CTInfo flags)\r\n{\r\n  int32_t i = 0;\r\n  memset(dp, 0, d->size);  /* Much simpler to clear the struct first. */\r\n  cconv_substruct_tab(cts, d, dp, t, &i, flags);\r\n}\r\n\r\n/* Convert TValue to C type. Caveat: expects to get the raw CType! */\r\nvoid lj_cconv_ct_tv(CTState *cts, CType *d,\r\n\t\t    uint8_t *dp, TValue *o, CTInfo flags)\r\n{\r\n  CTypeID sid = CTID_P_VOID;\r\n  CType *s;\r\n  void *tmpptr;\r\n  uint8_t tmpbool, *sp = (uint8_t *)&tmpptr;\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    sp = (uint8_t *)&o->i;\r\n    sid = CTID_INT32;\r\n    flags |= CCF_FROMTV;\r\n  } else if (LJ_LIKELY(tvisnum(o))) {\r\n    sp = (uint8_t *)&o->n;\r\n    sid = CTID_DOUBLE;\r\n    flags |= CCF_FROMTV;\r\n  } else if (tviscdata(o)) {\r\n    sp = cdataptr(cdataV(o));\r\n    sid = cdataV(o)->ctypeid;\r\n    s = ctype_get(cts, sid);\r\n    if (ctype_isref(s->info)) {  /* Resolve reference for value. */\r\n      lua_assert(s->size == CTSIZE_PTR);\r\n      sp = *(void **)sp;\r\n      sid = ctype_cid(s->info);\r\n    }\r\n    s = ctype_raw(cts, sid);\r\n    if (ctype_isfunc(s->info)) {\r\n      sid = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|sid), CTSIZE_PTR);\r\n    } else {\r\n      if (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n      goto doconv;\r\n    }\r\n  } else if (tvisstr(o)) {\r\n    GCstr *str = strV(o);\r\n    if (ctype_isenum(d->info)) {  /* Match string against enum constant. */\r\n      CTSize ofs;\r\n      CType *cct = lj_ctype_getfield(cts, d, str, &ofs);\r\n      if (!cct || !ctype_isconstval(cct->info))\r\n\tgoto err_conv;\r\n      lua_assert(d->size == 4);\r\n      sp = (uint8_t *)&cct->size;\r\n      sid = ctype_cid(cct->info);\r\n    } else if (ctype_isrefarray(d->info)) {  /* Copy string to array. */\r\n      CType *dc = ctype_rawchild(cts, d);\r\n      CTSize sz = str->len+1;\r\n      if (!ctype_isinteger(dc->info) || dc->size != 1)\r\n\tgoto err_conv;\r\n      if (d->size != 0 && d->size < sz)\r\n\tsz = d->size;\r\n      memcpy(dp, strdata(str), sz);\r\n      return;\r\n    } else {  /* Otherwise pass it as a const char[]. */\r\n      sp = (uint8_t *)strdata(str);\r\n      sid = CTID_A_CCHAR;\r\n      flags |= CCF_FROMTV;\r\n    }\r\n  } else if (tvistab(o)) {\r\n    if (ctype_isarray(d->info)) {\r\n      cconv_array_tab(cts, d, dp, tabV(o), flags);\r\n      return;\r\n    } else if (ctype_isstruct(d->info)) {\r\n      cconv_struct_tab(cts, d, dp, tabV(o), flags);\r\n      return;\r\n    } else {\r\n      goto err_conv;\r\n    }\r\n  } else if (tvisbool(o)) {\r\n    tmpbool = boolV(o);\r\n    sp = &tmpbool;\r\n    sid = CTID_BOOL;\r\n  } else if (tvisnil(o)) {\r\n    tmpptr = (void *)0;\r\n    flags |= CCF_FROMTV;\r\n  } else if (tvisudata(o)) {\r\n    GCudata *ud = udataV(o);\r\n    tmpptr = uddata(ud);\r\n    if (ud->udtype == UDTYPE_IO_FILE)\r\n      tmpptr = *(void **)tmpptr;\r\n  } else if (tvislightud(o)) {\r\n    tmpptr = lightudV(o);\r\n  } else if (tvisfunc(o)) {\r\n    void *p = lj_ccallback_new(cts, d, funcV(o));\r\n    if (p) {\r\n      *(void **)dp = p;\r\n      return;\r\n    }\r\n    goto err_conv;\r\n  } else {\r\n  err_conv:\r\n    cconv_err_convtv(cts, d, o, flags);\r\n  }\r\n  s = ctype_get(cts, sid);\r\ndoconv:\r\n  if (ctype_isenum(d->info)) d = ctype_child(cts, d);\r\n  lj_cconv_ct_ct(cts, d, s, dp, sp, flags);\r\n}\r\n\r\n/* Convert TValue to bitfield. */\r\nvoid lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o)\r\n{\r\n  CTInfo info = d->info;\r\n  CTSize pos, bsz;\r\n  uint32_t val, mask;\r\n  lua_assert(ctype_isbitfield(info));\r\n  if ((info & CTF_BOOL)) {\r\n    uint8_t tmpbool;\r\n    lua_assert(ctype_bitbsz(info) == 1);\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, CTID_BOOL), &tmpbool, o, 0);\r\n    val = tmpbool;\r\n  } else {\r\n    CTypeID did = (info & CTF_UNSIGNED) ? CTID_UINT32 : CTID_INT32;\r\n    lj_cconv_ct_tv(cts, ctype_get(cts, did), (uint8_t *)&val, o, 0);\r\n  }\r\n  pos = ctype_bitpos(info);\r\n  bsz = ctype_bitbsz(info);\r\n  lua_assert(pos < 8*ctype_bitcsz(info));\r\n  lua_assert(bsz > 0 && bsz <= 8*ctype_bitcsz(info));\r\n  /* Check if a packed bitfield crosses a container boundary. */\r\n  if (pos + bsz > 8*ctype_bitcsz(info))\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_NYIPACKBIT);\r\n  mask = ((1u << bsz) - 1u) << pos;\r\n  val = (val << pos) & mask;\r\n  /* NYI: packed bitfields may cause misaligned reads/writes. */\r\n  switch (ctype_bitcsz(info)) {\r\n  case 4: *(uint32_t *)dp = (*(uint32_t *)dp & ~mask) | (uint32_t)val; break;\r\n  case 2: *(uint16_t *)dp = (*(uint16_t *)dp & ~mask) | (uint16_t)val; break;\r\n  case 1: *(uint8_t *)dp = (*(uint8_t *)dp & ~mask) | (uint8_t)val; break;\r\n  default: lua_assert(0); break;\r\n  }\r\n}\r\n\r\n/* -- Initialize C type with TValues -------------------------------------- */\r\n\r\n/* Initialize an array with TValues. */\r\nstatic void cconv_array_init(CTState *cts, CType *d, CTSize sz, uint8_t *dp,\r\n\t\t\t     TValue *o, MSize len)\r\n{\r\n  CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n  CTSize ofs, esize = dc->size;\r\n  MSize i;\r\n  if (len*esize > sz)\r\n    cconv_err_initov(cts, d);\r\n  for (i = 0, ofs = 0; i < len; i++, ofs += esize)\r\n    lj_cconv_ct_tv(cts, dc, dp + ofs, o + i, 0);\r\n  if (ofs == esize) {  /* Replicate a single element. */\r\n    for (; ofs < sz; ofs += esize) memcpy(dp + ofs, dp, esize);\r\n  } else {  /* Otherwise fill the remainder with zero. */\r\n    memset(dp + ofs, 0, sz - ofs);\r\n  }\r\n}\r\n\r\n/* Initialize a sub-struct/union with TValues. */\r\nstatic void cconv_substruct_init(CTState *cts, CType *d, uint8_t *dp,\r\n\t\t\t\t TValue *o, MSize len, MSize *ip)\r\n{\r\n  CTypeID id = d->sib;\r\n  while (id) {\r\n    CType *df = ctype_get(cts, id);\r\n    id = df->sib;\r\n    if (ctype_isfield(df->info) || ctype_isbitfield(df->info)) {\r\n      MSize i = *ip;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      if (i >= len) break;\r\n      *ip = i + 1;\r\n      if (ctype_isfield(df->info))\r\n\tlj_cconv_ct_tv(cts, ctype_rawchild(cts, df), dp+df->size, o + i, 0);\r\n      else\r\n\tlj_cconv_bf_tv(cts, df, dp+df->size, o + i);\r\n      if ((d->info & CTF_UNION)) break;\r\n    } else if (ctype_isxattrib(df->info, CTA_SUBTYPE)) {\r\n      cconv_substruct_init(cts, ctype_rawchild(cts, df),\r\n\t\t\t   dp+df->size, o, len, ip);\r\n      if ((d->info & CTF_UNION)) break;\r\n    }  /* Ignore all other entries in the chain. */\r\n  }\r\n}\r\n\r\n/* Initialize a struct/union with TValues. */\r\nstatic void cconv_struct_init(CTState *cts, CType *d, CTSize sz, uint8_t *dp,\r\n\t\t\t      TValue *o, MSize len)\r\n{\r\n  MSize i = 0;\r\n  memset(dp, 0, sz);  /* Much simpler to clear the struct first. */\r\n  cconv_substruct_init(cts, d, dp, o, len, &i);\r\n  if (i < len)\r\n    cconv_err_initov(cts, d);\r\n}\r\n\r\n/* Check whether to use a multi-value initializer.\r\n** This is true if an aggregate is to be initialized with a value.\r\n** Valarrays are treated as values here so ct_tv handles (V|C, I|F).\r\n*/\r\nint lj_cconv_multi_init(CTState *cts, CType *d, TValue *o)\r\n{\r\n  if (!(ctype_isrefarray(d->info) || ctype_isstruct(d->info)))\r\n    return 0;  /* Destination is not an aggregate. */\r\n  if (tvistab(o) || (tvisstr(o) && !ctype_isstruct(d->info)))\r\n    return 0;  /* Initializer is not a value. */\r\n  if (tviscdata(o) && lj_ctype_rawref(cts, cdataV(o)->ctypeid) == d)\r\n    return 0;  /* Source and destination are identical aggregates. */\r\n  return 1;  /* Otherwise the initializer is a value. */\r\n}\r\n\r\n/* Initialize C type with TValues. Caveat: expects to get the raw CType! */\r\nvoid lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz,\r\n\t\t      uint8_t *dp, TValue *o, MSize len)\r\n{\r\n  if (len == 0)\r\n    memset(dp, 0, sz);\r\n  else if (len == 1 && !lj_cconv_multi_init(cts, d, o))\r\n    lj_cconv_ct_tv(cts, d, dp, o, 0);\r\n  else if (ctype_isarray(d->info))  /* Also handles valarray init with len>1. */\r\n    cconv_array_init(cts, d, sz, dp, o, len);\r\n  else if (ctype_isstruct(d->info))\r\n    cconv_struct_init(cts, d, sz, dp, o, len);\r\n  else\r\n    cconv_err_initov(cts, d);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cconv.h",
    "content": "/*\r\n** C type conversions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CCONV_H\r\n#define _LJ_CCONV_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Compressed C type index. ORDER CCX. */\r\nenum {\r\n  CCX_B,\t/* Bool. */\r\n  CCX_I,\t/* Integer. */\r\n  CCX_F,\t/* Floating-point number. */\r\n  CCX_C,\t/* Complex. */\r\n  CCX_V,\t/* Vector. */\r\n  CCX_P,\t/* Pointer. */\r\n  CCX_A,\t/* Refarray. */\r\n  CCX_S\t\t/* Struct/union. */\r\n};\r\n\r\n/* Convert C type info to compressed C type index. ORDER CT. ORDER CCX. */\r\nstatic LJ_AINLINE uint32_t cconv_idx(CTInfo info)\r\n{\r\n  uint32_t idx = ((info >> 26) & 15u);  /* Dispatch bits. */\r\n  lua_assert(ctype_type(info) <= CT_MAYCONVERT);\r\n#if LJ_64\r\n  idx = ((uint32_t)(U64x(f436fff5,fff7f021) >> 4*idx) & 15u);\r\n#else\r\n  idx = (((idx < 8 ? 0xfff7f021u : 0xf436fff5) >> 4*(idx & 7u)) & 15u);\r\n#endif\r\n  lua_assert(idx < 8);\r\n  return idx;\r\n}\r\n\r\n#define cconv_idx2(dinfo, sinfo) \\\r\n  ((cconv_idx((dinfo)) << 3) + cconv_idx((sinfo)))\r\n\r\n#define CCX(dst, src)\t\t((CCX_##dst << 3) + CCX_##src)\r\n\r\n/* Conversion flags. */\r\n#define CCF_CAST\t0x00000001u\r\n#define CCF_FROMTV\t0x00000002u\r\n#define CCF_SAME\t0x00000004u\r\n#define CCF_IGNQUAL\t0x00000008u\r\n\r\n#define CCF_ARG_SHIFT\t8\r\n#define CCF_ARG(n)\t((n) << CCF_ARG_SHIFT)\r\n#define CCF_GETARG(f)\t((f) >> CCF_ARG_SHIFT)\r\n\r\nLJ_FUNC int lj_cconv_compatptr(CTState *cts, CType *d, CType *s, CTInfo flags);\r\nLJ_FUNC void lj_cconv_ct_ct(CTState *cts, CType *d, CType *s,\r\n\t\t\t    uint8_t *dp, uint8_t *sp, CTInfo flags);\r\nLJ_FUNC int lj_cconv_tv_ct(CTState *cts, CType *s, CTypeID sid,\r\n\t\t\t   TValue *o, uint8_t *sp);\r\nLJ_FUNC int lj_cconv_tv_bf(CTState *cts, CType *s, TValue *o, uint8_t *sp);\r\nLJ_FUNC void lj_cconv_ct_tv(CTState *cts, CType *d,\r\n\t\t\t    uint8_t *dp, TValue *o, CTInfo flags);\r\nLJ_FUNC void lj_cconv_bf_tv(CTState *cts, CType *d, uint8_t *dp, TValue *o);\r\nLJ_FUNC int lj_cconv_multi_init(CTState *cts, CType *d, TValue *o);\r\nLJ_FUNC void lj_cconv_ct_init(CTState *cts, CType *d, CTSize sz,\r\n\t\t\t      uint8_t *dp, TValue *o, MSize len);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cdata.c",
    "content": "/*\r\n** C data management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n\r\n/* -- C data allocation --------------------------------------------------- */\r\n\r\n/* Allocate a new C data object holding a reference to another object. */\r\nGCcdata *lj_cdata_newref(CTState *cts, const void *p, CTypeID id)\r\n{\r\n  CTypeID refid = lj_ctype_intern(cts, CTINFO_REF(id), CTSIZE_PTR);\r\n  GCcdata *cd = lj_cdata_new(cts, refid, CTSIZE_PTR);\r\n  *(const void **)cdataptr(cd) = p;\r\n  return cd;\r\n}\r\n\r\n/* Allocate variable-sized or specially aligned C data object. */\r\nGCcdata *lj_cdata_newv(lua_State *L, CTypeID id, CTSize sz, CTSize align)\r\n{\r\n  global_State *g;\r\n  MSize extra = sizeof(GCcdataVar) + sizeof(GCcdata) +\r\n\t\t(align > CT_MEMALIGN ? (1u<<align) - (1u<<CT_MEMALIGN) : 0);\r\n  char *p = lj_mem_newt(L, extra + sz, char);\r\n  uintptr_t adata = (uintptr_t)p + sizeof(GCcdataVar) + sizeof(GCcdata);\r\n  uintptr_t almask = (1u << align) - 1u;\r\n  GCcdata *cd = (GCcdata *)(((adata + almask) & ~almask) - sizeof(GCcdata));\r\n  lua_assert((char *)cd - p < 65536);\r\n  cdatav(cd)->offset = (uint16_t)((char *)cd - p);\r\n  cdatav(cd)->extra = extra;\r\n  cdatav(cd)->len = sz;\r\n  g = G(L);\r\n  setgcrefr(cd->nextgc, g->gc.root);\r\n  setgcref(g->gc.root, obj2gco(cd));\r\n  newwhite(g, obj2gco(cd));\r\n  cd->marked |= 0x80;\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = id;\r\n  return cd;\r\n}\r\n\r\n/* Free a C data object. */\r\nvoid LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd)\r\n{\r\n  if (LJ_UNLIKELY(cd->marked & LJ_GC_CDATA_FIN)) {\r\n    GCobj *root;\r\n    makewhite(g, obj2gco(cd));\r\n    markfinalized(obj2gco(cd));\r\n    if ((root = gcref(g->gc.mmudata)) != NULL) {\r\n      setgcrefr(cd->nextgc, root->gch.nextgc);\r\n      setgcref(root->gch.nextgc, obj2gco(cd));\r\n      setgcref(g->gc.mmudata, obj2gco(cd));\r\n    } else {\r\n      setgcref(cd->nextgc, obj2gco(cd));\r\n      setgcref(g->gc.mmudata, obj2gco(cd));\r\n    }\r\n  } else if (LJ_LIKELY(!cdataisv(cd))) {\r\n    CType *ct = ctype_raw(ctype_ctsG(g), cd->ctypeid);\r\n    CTSize sz = ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR;\r\n    lua_assert(ctype_hassize(ct->info) || ctype_isfunc(ct->info) ||\r\n\t       ctype_isextern(ct->info));\r\n    lj_mem_free(g, cd, sizeof(GCcdata) + sz);\r\n  } else {\r\n    lj_mem_free(g, memcdatav(cd), sizecdatav(cd));\r\n  }\r\n}\r\n\r\nvoid lj_cdata_setfin(lua_State *L, GCcdata *cd, GCobj *obj, uint32_t it)\r\n{\r\n  GCtab *t = ctype_ctsG(G(L))->finalizer;\r\n  if (gcref(t->metatable)) {\r\n    /* Add cdata to finalizer table, if still enabled. */\r\n    TValue *tv, tmp;\r\n    setcdataV(L, &tmp, cd);\r\n    lj_gc_anybarriert(L, t);\r\n    tv = lj_tab_set(L, t, &tmp);\r\n    setgcV(L, tv, obj, it);\r\n    if (!tvisnil(tv))\r\n      cd->marked |= LJ_GC_CDATA_FIN;\r\n    else\r\n      cd->marked &= ~LJ_GC_CDATA_FIN;\r\n  }\r\n}\r\n\r\n/* -- C data indexing ----------------------------------------------------- */\r\n\r\n/* Index C data by a TValue. Return CType and pointer. */\r\nCType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key, uint8_t **pp,\r\n\t\t      CTInfo *qual)\r\n{\r\n  uint8_t *p = (uint8_t *)cdataptr(cd);\r\n  CType *ct = ctype_get(cts, cd->ctypeid);\r\n  ptrdiff_t idx;\r\n\r\n  /* Resolve reference for cdata object. */\r\n  if (ctype_isref(ct->info)) {\r\n    lua_assert(ct->size == CTSIZE_PTR);\r\n    p = *(uint8_t **)p;\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n\r\ncollect_attrib:\r\n  /* Skip attributes and collect qualifiers. */\r\n  while (ctype_isattrib(ct->info)) {\r\n    if (ctype_attrib(ct->info) == CTA_QUAL) *qual |= ct->size;\r\n    ct = ctype_child(cts, ct);\r\n  }\r\n  lua_assert(!ctype_isref(ct->info));  /* Interning rejects refs to refs. */\r\n\r\n  if (tvisint(key)) {\r\n    idx = (ptrdiff_t)intV(key);\r\n    goto integer_key;\r\n  } else if (tvisnum(key)) {  /* Numeric key. */\r\n#ifdef _MSC_VER\r\n    /* Workaround for MSVC bug. */\r\n    volatile\r\n#endif\r\n    lua_Number n = numV(key);\r\n    idx = LJ_64 ? (ptrdiff_t)n : (ptrdiff_t)lj_num2int(n);\r\n  integer_key:\r\n    if (ctype_ispointer(ct->info)) {\r\n      CTSize sz = lj_ctype_size(cts, ctype_cid(ct->info));  /* Element size. */\r\n      if (sz == CTSIZE_INVALID)\r\n\tlj_err_caller(cts->L, LJ_ERR_FFI_INVSIZE);\r\n      if (ctype_isptr(ct->info)) {\r\n\tp = (uint8_t *)cdata_getptr(p, ct->size);\r\n      } else if ((ct->info & (CTF_VECTOR|CTF_COMPLEX))) {\r\n\tif ((ct->info & CTF_COMPLEX)) idx &= 1;\r\n\t*qual |= CTF_CONST;  /* Valarray elements are constant. */\r\n      }\r\n      *pp = p + idx*(int32_t)sz;\r\n      return ct;\r\n    }\r\n  } else if (tviscdata(key)) {  /* Integer cdata key. */\r\n    GCcdata *cdk = cdataV(key);\r\n    CType *ctk = ctype_raw(cts, cdk->ctypeid);\r\n    if (ctype_isenum(ctk->info)) ctk = ctype_child(cts, ctk);\r\n    if (ctype_isinteger(ctk->info)) {\r\n      lj_cconv_ct_ct(cts, ctype_get(cts, CTID_INT_PSZ), ctk,\r\n\t\t     (uint8_t *)&idx, cdataptr(cdk), 0);\r\n      goto integer_key;\r\n    }\r\n  } else if (tvisstr(key)) {  /* String key. */\r\n    GCstr *name = strV(key);\r\n    if (ctype_isstruct(ct->info)) {\r\n      CTSize ofs;\r\n      CType *fct = lj_ctype_getfieldq(cts, ct, name, &ofs, qual);\r\n      if (fct) {\r\n\t*pp = p + ofs;\r\n\treturn fct;\r\n      }\r\n    } else if (ctype_iscomplex(ct->info)) {\r\n      if (name->len == 2) {\r\n\t*qual |= CTF_CONST;  /* Complex fields are constant. */\r\n\tif (strdata(name)[0] == 'r' && strdata(name)[1] == 'e') {\r\n\t  *pp = p;\r\n\t  return ct;\r\n\t} else if (strdata(name)[0] == 'i' && strdata(name)[1] == 'm') {\r\n\t  *pp = p + (ct->size >> 1);\r\n\t  return ct;\r\n\t}\r\n      }\r\n    } else if (cd->ctypeid == CTID_CTYPEID) {\r\n      /* Allow indexing a (pointer to) struct constructor to get constants. */\r\n      CType *sct = ctype_raw(cts, *(CTypeID *)p);\r\n      if (ctype_isptr(sct->info))\r\n\tsct = ctype_rawchild(cts, sct);\r\n      if (ctype_isstruct(sct->info)) {\r\n\tCTSize ofs;\r\n\tCType *fct = lj_ctype_getfield(cts, sct, name, &ofs);\r\n\tif (fct && ctype_isconstval(fct->info))\r\n\t  return fct;\r\n      }\r\n      ct = sct;  /* Allow resolving metamethods for constructors, too. */\r\n    }\r\n  }\r\n  if (ctype_isptr(ct->info)) {  /* Automatically perform '->'. */\r\n    if (ctype_isstruct(ctype_rawchild(cts, ct)->info)) {\r\n      p = (uint8_t *)cdata_getptr(p, ct->size);\r\n      ct = ctype_child(cts, ct);\r\n      goto collect_attrib;\r\n    }\r\n  }\r\n  *qual |= 1;  /* Lookup failed. */\r\n  return ct;  /* But return the resolved raw type. */\r\n}\r\n\r\n/* -- C data getters ------------------------------------------------------ */\r\n\r\n/* Get constant value and convert to TValue. */\r\nstatic void cdata_getconst(CTState *cts, TValue *o, CType *ct)\r\n{\r\n  CType *ctt = ctype_child(cts, ct);\r\n  lua_assert(ctype_isinteger(ctt->info) && ctt->size <= 4);\r\n  /* Constants are already zero-extended/sign-extended to 32 bits. */\r\n  if ((ctt->info & CTF_UNSIGNED) && (int32_t)ct->size < 0)\r\n    setnumV(o, (lua_Number)(uint32_t)ct->size);\r\n  else\r\n    setintV(o, (int32_t)ct->size);\r\n}\r\n\r\n/* Get C data value and convert to TValue. */\r\nint lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp)\r\n{\r\n  CTypeID sid;\r\n\r\n  if (ctype_isconstval(s->info)) {\r\n    cdata_getconst(cts, o, s);\r\n    return 0;  /* No GC step needed. */\r\n  } else if (ctype_isbitfield(s->info)) {\r\n    return lj_cconv_tv_bf(cts, s, o, sp);\r\n  }\r\n\r\n  /* Get child type of pointer/array/field. */\r\n  lua_assert(ctype_ispointer(s->info) || ctype_isfield(s->info));\r\n  sid = ctype_cid(s->info);\r\n  s = ctype_get(cts, sid);\r\n\r\n  /* Resolve reference for field. */\r\n  if (ctype_isref(s->info)) {\r\n    lua_assert(s->size == CTSIZE_PTR);\r\n    sp = *(uint8_t **)sp;\r\n    sid = ctype_cid(s->info);\r\n    s = ctype_get(cts, sid);\r\n  }\r\n\r\n  /* Skip attributes. */\r\n  while (ctype_isattrib(s->info))\r\n    s = ctype_child(cts, s);\r\n\r\n  return lj_cconv_tv_ct(cts, s, sid, o, sp);\r\n}\r\n\r\n/* -- C data setters ------------------------------------------------------ */\r\n\r\n/* Convert TValue and set C data value. */\r\nvoid lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o, CTInfo qual)\r\n{\r\n  if (ctype_isconstval(d->info)) {\r\n    goto err_const;\r\n  } else if (ctype_isbitfield(d->info)) {\r\n    if (((d->info|qual) & CTF_CONST)) goto err_const;\r\n    lj_cconv_bf_tv(cts, d, dp, o);\r\n    return;\r\n  }\r\n\r\n  /* Get child type of pointer/array/field. */\r\n  lua_assert(ctype_ispointer(d->info) || ctype_isfield(d->info));\r\n  d = ctype_child(cts, d);\r\n\r\n  /* Resolve reference for field. */\r\n  if (ctype_isref(d->info)) {\r\n    lua_assert(d->size == CTSIZE_PTR);\r\n    dp = *(uint8_t **)dp;\r\n    d = ctype_child(cts, d);\r\n  }\r\n\r\n  /* Skip attributes and collect qualifiers. */\r\n  for (;;) {\r\n    if (ctype_isattrib(d->info)) {\r\n      if (ctype_attrib(d->info) == CTA_QUAL) qual |= d->size;\r\n    } else {\r\n      break;\r\n    }\r\n    d = ctype_child(cts, d);\r\n  }\r\n\r\n  lua_assert(ctype_hassize(d->info) && !ctype_isvoid(d->info));\r\n\r\n  if (((d->info|qual) & CTF_CONST)) {\r\n  err_const:\r\n    lj_err_caller(cts->L, LJ_ERR_FFI_WRCONST);\r\n  }\r\n\r\n  lj_cconv_ct_tv(cts, d, dp, o, 0);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cdata.h",
    "content": "/*\r\n** C data management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CDATA_H\r\n#define _LJ_CDATA_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Get C data pointer. */\r\nstatic LJ_AINLINE void *cdata_getptr(void *p, CTSize sz)\r\n{\r\n  if (LJ_64 && sz == 4) {  /* Support 32 bit pointers on 64 bit targets. */\r\n    return ((void *)(uintptr_t)*(uint32_t *)p);\r\n  } else {\r\n    lua_assert(sz == CTSIZE_PTR);\r\n    return *(void **)p;\r\n  }\r\n}\r\n\r\n/* Set C data pointer. */\r\nstatic LJ_AINLINE void cdata_setptr(void *p, CTSize sz, const void *v)\r\n{\r\n  if (LJ_64 && sz == 4) {  /* Support 32 bit pointers on 64 bit targets. */\r\n    *(uint32_t *)p = (uint32_t)(uintptr_t)v;\r\n  } else {\r\n    lua_assert(sz == CTSIZE_PTR);\r\n    *(void **)p = (void *)v;\r\n  }\r\n}\r\n\r\n/* Allocate fixed-size C data object. */\r\nstatic LJ_AINLINE GCcdata *lj_cdata_new(CTState *cts, CTypeID id, CTSize sz)\r\n{\r\n  GCcdata *cd;\r\n#ifdef LUA_USE_ASSERT\r\n  CType *ct = ctype_raw(cts, id);\r\n  lua_assert((ctype_hassize(ct->info) ? ct->size : CTSIZE_PTR) == sz);\r\n#endif\r\n  cd = (GCcdata *)lj_mem_newgco(cts->L, sizeof(GCcdata) + sz);\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = ctype_check(cts, id);\r\n  return cd;\r\n}\r\n\r\n/* Variant which works without a valid CTState. */\r\nstatic LJ_AINLINE GCcdata *lj_cdata_new_(lua_State *L, CTypeID id, CTSize sz)\r\n{\r\n  GCcdata *cd = (GCcdata *)lj_mem_newgco(L, sizeof(GCcdata) + sz);\r\n  cd->gct = ~LJ_TCDATA;\r\n  cd->ctypeid = id;\r\n  return cd;\r\n}\r\n\r\nLJ_FUNC GCcdata *lj_cdata_newref(CTState *cts, const void *pp, CTypeID id);\r\nLJ_FUNC GCcdata *lj_cdata_newv(lua_State *L, CTypeID id, CTSize sz,\r\n\t\t\t       CTSize align);\r\n\r\nLJ_FUNC void LJ_FASTCALL lj_cdata_free(global_State *g, GCcdata *cd);\r\nLJ_FUNC void lj_cdata_setfin(lua_State *L, GCcdata *cd, GCobj *obj,\r\n\t\t\t     uint32_t it);\r\n\r\nLJ_FUNC CType *lj_cdata_index(CTState *cts, GCcdata *cd, cTValue *key,\r\n\t\t\t      uint8_t **pp, CTInfo *qual);\r\nLJ_FUNC int lj_cdata_get(CTState *cts, CType *s, TValue *o, uint8_t *sp);\r\nLJ_FUNC void lj_cdata_set(CTState *cts, CType *d, uint8_t *dp, TValue *o,\r\n\t\t\t  CTInfo qual);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_char.c",
    "content": "/*\r\n** Character types.\r\n** Donated to the public domain.\r\n**\r\n** This is intended to replace the problematic libc single-byte NLS functions.\r\n** These just don't make sense anymore with UTF-8 locales becoming the norm\r\n** on POSIX systems. It never worked too well on Windows systems since hardly\r\n** anyone bothered to call setlocale().\r\n**\r\n** This table is hardcoded for ASCII. Identifiers include the characters\r\n** 128-255, too. This allows for the use of all non-ASCII chars as identifiers\r\n** in the lexer. This is a broad definition, but works well in practice\r\n** for both UTF-8 locales and most single-byte locales (such as ISO-8859-*).\r\n**\r\n** If you really need proper character types for UTF-8 strings, please use\r\n** an add-on library such as slnunicode: http://luaforge.net/projects/sln/\r\n*/\r\n\r\n#define lj_char_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_char.h\"\r\n\r\nLJ_DATADEF const uint8_t lj_char_bits[257] = {\r\n    0,\r\n    1,  1,  1,  1,  1,  1,  1,  1,  1,  3,  3,  3,  3,  3,  1,  1,\r\n    1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,\r\n    2,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,  4,\r\n  152,152,152,152,152,152,152,152,152,152,  4,  4,  4,  4,  4,  4,\r\n    4,176,176,176,176,176,176,160,160,160,160,160,160,160,160,160,\r\n  160,160,160,160,160,160,160,160,160,160,160,  4,  4,  4,  4,132,\r\n    4,208,208,208,208,208,208,192,192,192,192,192,192,192,192,192,\r\n  192,192,192,192,192,192,192,192,192,192,192,  4,  4,  4,  4,  1,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,\r\n  128,128,128,128,128,128,128,128,128,128,128,128,128,128,128,128\r\n};\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_char.h",
    "content": "/*\r\n** Character types.\r\n** Donated to the public domain.\r\n*/\r\n\r\n#ifndef _LJ_CHAR_H\r\n#define _LJ_CHAR_H\r\n\r\n#include \"lj_def.h\"\r\n\r\n#define LJ_CHAR_CNTRL\t0x01\r\n#define LJ_CHAR_SPACE\t0x02\r\n#define LJ_CHAR_PUNCT\t0x04\r\n#define LJ_CHAR_DIGIT\t0x08\r\n#define LJ_CHAR_XDIGIT\t0x10\r\n#define LJ_CHAR_UPPER\t0x20\r\n#define LJ_CHAR_LOWER\t0x40\r\n#define LJ_CHAR_IDENT\t0x80\r\n#define LJ_CHAR_ALPHA\t(LJ_CHAR_LOWER|LJ_CHAR_UPPER)\r\n#define LJ_CHAR_ALNUM\t(LJ_CHAR_ALPHA|LJ_CHAR_DIGIT)\r\n#define LJ_CHAR_GRAPH\t(LJ_CHAR_ALNUM|LJ_CHAR_PUNCT)\r\n\r\n/* Only pass -1 or 0..255 to these macros. Never pass a signed char! */\r\n#define lj_char_isa(c, t)\t((lj_char_bits+1)[(c)] & t)\r\n#define lj_char_iscntrl(c)\tlj_char_isa((c), LJ_CHAR_CNTRL)\r\n#define lj_char_isspace(c)\tlj_char_isa((c), LJ_CHAR_SPACE)\r\n#define lj_char_ispunct(c)\tlj_char_isa((c), LJ_CHAR_PUNCT)\r\n#define lj_char_isdigit(c)\tlj_char_isa((c), LJ_CHAR_DIGIT)\r\n#define lj_char_isxdigit(c)\tlj_char_isa((c), LJ_CHAR_XDIGIT)\r\n#define lj_char_isupper(c)\tlj_char_isa((c), LJ_CHAR_UPPER)\r\n#define lj_char_islower(c)\tlj_char_isa((c), LJ_CHAR_LOWER)\r\n#define lj_char_isident(c)\tlj_char_isa((c), LJ_CHAR_IDENT)\r\n#define lj_char_isalpha(c)\tlj_char_isa((c), LJ_CHAR_ALPHA)\r\n#define lj_char_isalnum(c)\tlj_char_isa((c), LJ_CHAR_ALNUM)\r\n#define lj_char_isgraph(c)\tlj_char_isa((c), LJ_CHAR_GRAPH)\r\n\r\n#define lj_char_toupper(c)\t((c) - (lj_char_islower(c) >> 1))\r\n#define lj_char_tolower(c)\t((c) + lj_char_isupper(c))\r\n\r\nLJ_DATA const uint8_t lj_char_bits[257];\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_clib.c",
    "content": "/*\r\n** FFI C library loader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_clib.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* -- OS-specific functions ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_DLOPEN\r\n\r\n#include <dlfcn.h>\r\n#include <stdio.h>\r\n\r\n#if defined(RTLD_DEFAULT)\r\n#define CLIB_DEFHANDLE\tRTLD_DEFAULT\r\n#elif LJ_TARGET_OSX || LJ_TARGET_BSD\r\n#define CLIB_DEFHANDLE\t((void *)(intptr_t)-2)\r\n#else\r\n#define CLIB_DEFHANDLE\tNULL\r\n#endif\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error_(lua_State *L)\r\n{\r\n  lj_err_callermsg(L, dlerror());\r\n}\r\n\r\n#define clib_error(L, fmt, name)\tclib_error_(L)\r\n\r\n#if defined(__CYGWIN__)\r\n#define CLIB_SOPREFIX\t\"cyg\"\r\n#else\r\n#define CLIB_SOPREFIX\t\"lib\"\r\n#endif\r\n\r\n#if LJ_TARGET_OSX\r\n#define CLIB_SOEXT\t\"%s.dylib\"\r\n#elif defined(__CYGWIN__)\r\n#define CLIB_SOEXT\t\"%s.dll\"\r\n#else\r\n#define CLIB_SOEXT\t\"%s.so\"\r\n#endif\r\n\r\nstatic const char *clib_extname(lua_State *L, const char *name)\r\n{\r\n  if (!strchr(name, '/')\r\n#ifdef __CYGWIN__\r\n      && !strchr(name, '\\\\')\r\n#endif\r\n     ) {\r\n    if (!strchr(name, '.')) {\r\n      name = lj_strfmt_pushf(L, CLIB_SOEXT, name);\r\n      L->top--;\r\n#ifdef __CYGWIN__\r\n    } else {\r\n      return name;\r\n#endif\r\n    }\r\n    if (!(name[0] == CLIB_SOPREFIX[0] && name[1] == CLIB_SOPREFIX[1] &&\r\n\t  name[2] == CLIB_SOPREFIX[2])) {\r\n      name = lj_strfmt_pushf(L, CLIB_SOPREFIX \"%s\", name);\r\n      L->top--;\r\n    }\r\n  }\r\n  return name;\r\n}\r\n\r\n/* Check for a recognized ld script line. */\r\nstatic const char *clib_check_lds(lua_State *L, const char *buf)\r\n{\r\n  char *p, *e;\r\n  if ((!strncmp(buf, \"GROUP\", 5) || !strncmp(buf, \"INPUT\", 5)) &&\r\n      (p = strchr(buf, '('))) {\r\n    while (*++p == ' ') ;\r\n    for (e = p; *e && *e != ' ' && *e != ')'; e++) ;\r\n    return strdata(lj_str_new(L, p, e-p));\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Quick and dirty solution to resolve shared library name from ld script. */\r\nstatic const char *clib_resolve_lds(lua_State *L, const char *name)\r\n{\r\n  FILE *fp = fopen(name, \"r\");\r\n  const char *p = NULL;\r\n  if (fp) {\r\n    char buf[256];\r\n    if (fgets(buf, sizeof(buf), fp)) {\r\n      if (!strncmp(buf, \"/* GNU ld script\", 16)) {  /* ld script magic? */\r\n\twhile (fgets(buf, sizeof(buf), fp)) {  /* Check all lines. */\r\n\t  p = clib_check_lds(L, buf);\r\n\t  if (p) break;\r\n\t}\r\n      } else {  /* Otherwise check only the first line. */\r\n\tp = clib_check_lds(L, buf);\r\n      }\r\n    }\r\n    fclose(fp);\r\n  }\r\n  return p;\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  void *h = dlopen(clib_extname(L, name),\r\n\t\t   RTLD_LAZY | (global?RTLD_GLOBAL:RTLD_LOCAL));\r\n  if (!h) {\r\n    const char *e, *err = dlerror();\r\n    if (*err == '/' && (e = strchr(err, ':')) &&\r\n\t(name = clib_resolve_lds(L, strdata(lj_str_new(L, err, e-err))))) {\r\n      h = dlopen(name, RTLD_LAZY | (global?RTLD_GLOBAL:RTLD_LOCAL));\r\n      if (h) return h;\r\n      err = dlerror();\r\n    }\r\n    lj_err_callermsg(L, err);\r\n  }\r\n  return h;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  if (cl->handle && cl->handle != CLIB_DEFHANDLE)\r\n    dlclose(cl->handle);\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  void *p = dlsym(cl->handle, name);\r\n  return p;\r\n}\r\n\r\n#elif LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#ifndef GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\r\n#define GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS\t4\r\n#define GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT\t2\r\nBOOL WINAPI GetModuleHandleExA(DWORD, LPCSTR, HMODULE*);\r\n#endif\r\n\r\n#define CLIB_DEFHANDLE\t((void *)-1)\r\n\r\n/* Default libraries. */\r\nenum {\r\n  CLIB_HANDLE_EXE,\r\n  CLIB_HANDLE_DLL,\r\n  CLIB_HANDLE_CRT,\r\n  CLIB_HANDLE_KERNEL32,\r\n  CLIB_HANDLE_USER32,\r\n  CLIB_HANDLE_GDI32,\r\n  CLIB_HANDLE_MAX\r\n};\r\n\r\nstatic void *clib_def_handle[CLIB_HANDLE_MAX];\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error(lua_State *L, const char *fmt,\r\n\t\t\t\t\t    const char *name)\r\n{\r\n  DWORD err = GetLastError();\r\n#if LJ_TARGET_XBOXONE\r\n  wchar_t wbuf[128];\r\n  char buf[128*2];\r\n  if (!FormatMessageW(FORMAT_MESSAGE_IGNORE_INSERTS|FORMAT_MESSAGE_FROM_SYSTEM,\r\n\t\t      NULL, err, 0, wbuf, sizeof(wbuf)/sizeof(wchar_t), NULL) ||\r\n      !WideCharToMultiByte(CP_ACP, 0, wbuf, 128, buf, 128*2, NULL, NULL))\r\n#else\r\n  char buf[128];\r\n  if (!FormatMessageA(FORMAT_MESSAGE_IGNORE_INSERTS|FORMAT_MESSAGE_FROM_SYSTEM,\r\n\t\t      NULL, err, 0, buf, sizeof(buf), NULL))\r\n#endif\r\n    buf[0] = '\\0';\r\n  lj_err_callermsg(L, lj_strfmt_pushf(L, fmt, name, buf));\r\n}\r\n\r\nstatic int clib_needext(const char *s)\r\n{\r\n  while (*s) {\r\n    if (*s == '/' || *s == '\\\\' || *s == '.') return 0;\r\n    s++;\r\n  }\r\n  return 1;\r\n}\r\n\r\nstatic const char *clib_extname(lua_State *L, const char *name)\r\n{\r\n  if (clib_needext(name)) {\r\n    name = lj_strfmt_pushf(L, \"%s.dll\", name);\r\n    L->top--;\r\n  }\r\n  return name;\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  DWORD oldwerr = GetLastError();\r\n  void *h = (void *)LoadLibraryExA(clib_extname(L, name), NULL, 0);\r\n  if (!h) clib_error(L, \"cannot load module \" LUA_QS \": %s\", name);\r\n  SetLastError(oldwerr);\r\n  UNUSED(global);\r\n  return h;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  if (cl->handle == CLIB_DEFHANDLE) {\r\n    MSize i;\r\n    for (i = CLIB_HANDLE_KERNEL32; i < CLIB_HANDLE_MAX; i++) {\r\n      void *h = clib_def_handle[i];\r\n      if (h) {\r\n\tclib_def_handle[i] = NULL;\r\n\tFreeLibrary((HINSTANCE)h);\r\n      }\r\n    }\r\n  } else if (cl->handle) {\r\n    FreeLibrary((HINSTANCE)cl->handle);\r\n  }\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  void *p = NULL;\r\n  if (cl->handle == CLIB_DEFHANDLE) {  /* Search default libraries. */\r\n    MSize i;\r\n    for (i = 0; i < CLIB_HANDLE_MAX; i++) {\r\n      HINSTANCE h = (HINSTANCE)clib_def_handle[i];\r\n      if (!(void *)h) {  /* Resolve default library handles (once). */\r\n\tswitch (i) {\r\n\tcase CLIB_HANDLE_EXE: GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT, NULL, &h); break;\r\n\tcase CLIB_HANDLE_DLL:\r\n\t  GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t     (const char *)clib_def_handle, &h);\r\n\t  break;\r\n\tcase CLIB_HANDLE_CRT:\r\n\t  GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS|GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\r\n\t\t\t     (const char *)&_fmode, &h);\r\n\t  break;\r\n\tcase CLIB_HANDLE_KERNEL32: h = LoadLibraryExA(\"kernel32.dll\", NULL, 0); break;\r\n\tcase CLIB_HANDLE_USER32: h = LoadLibraryExA(\"user32.dll\", NULL, 0); break;\r\n\tcase CLIB_HANDLE_GDI32: h = LoadLibraryExA(\"gdi32.dll\", NULL, 0); break;\r\n\t}\r\n\tif (!h) continue;\r\n\tclib_def_handle[i] = (void *)h;\r\n      }\r\n      p = (void *)GetProcAddress(h, name);\r\n      if (p) break;\r\n    }\r\n  } else {\r\n    p = (void *)GetProcAddress((HINSTANCE)cl->handle, name);\r\n  }\r\n  return p;\r\n}\r\n\r\n#else\r\n\r\n#define CLIB_DEFHANDLE\tNULL\r\n\r\nLJ_NORET LJ_NOINLINE static void clib_error(lua_State *L, const char *fmt,\r\n\t\t\t\t\t    const char *name)\r\n{\r\n  lj_err_callermsg(L, lj_strfmt_pushf(L, fmt, name, \"no support for this OS\"));\r\n}\r\n\r\nstatic void *clib_loadlib(lua_State *L, const char *name, int global)\r\n{\r\n  lj_err_callermsg(L, \"no support for loading dynamic libraries for this OS\");\r\n  UNUSED(name); UNUSED(global);\r\n  return NULL;\r\n}\r\n\r\nstatic void clib_unloadlib(CLibrary *cl)\r\n{\r\n  UNUSED(cl);\r\n}\r\n\r\nstatic void *clib_getsym(CLibrary *cl, const char *name)\r\n{\r\n  UNUSED(cl); UNUSED(name);\r\n  return NULL;\r\n}\r\n\r\n#endif\r\n\r\n/* -- C library indexing -------------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n/* Compute argument size for fastcall/stdcall functions. */\r\nstatic CTSize clib_func_argsize(CTState *cts, CType *ct)\r\n{\r\n  CTSize n = 0;\r\n  while (ct->sib) {\r\n    CType *d;\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (ctype_isfield(ct->info)) {\r\n      d = ctype_rawchild(cts, ct);\r\n      n += ((d->size + 3) & ~3);\r\n    }\r\n  }\r\n  return n;\r\n}\r\n#endif\r\n\r\n/* Get redirected or mangled external symbol. */\r\nstatic const char *clib_extsym(CTState *cts, CType *ct, GCstr *name)\r\n{\r\n  if (ct->sib) {\r\n    CType *ctf = ctype_get(cts, ct->sib);\r\n    if (ctype_isxattrib(ctf->info, CTA_REDIR))\r\n      return strdata(gco2str(gcref(ctf->name)));\r\n  }\r\n  return strdata(name);\r\n}\r\n\r\n/* Index a C library by name. */\r\nTValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name)\r\n{\r\n  TValue *tv = lj_tab_setstr(L, cl->cache, name);\r\n  if (LJ_UNLIKELY(tvisnil(tv))) {\r\n    CTState *cts = ctype_cts(L);\r\n    CType *ct;\r\n    CTypeID id = lj_ctype_getname(cts, &ct, name, CLNS_INDEX);\r\n    if (!id)\r\n      lj_err_callerv(L, LJ_ERR_FFI_NODECL, strdata(name));\r\n    if (ctype_isconstval(ct->info)) {\r\n      CType *ctt = ctype_child(cts, ct);\r\n      lua_assert(ctype_isinteger(ctt->info) && ctt->size <= 4);\r\n      if ((ctt->info & CTF_UNSIGNED) && (int32_t)ct->size < 0)\r\n\tsetnumV(tv, (lua_Number)(uint32_t)ct->size);\r\n      else\r\n\tsetintV(tv, (int32_t)ct->size);\r\n    } else {\r\n      const char *sym = clib_extsym(cts, ct, name);\r\n#if LJ_TARGET_WINDOWS\r\n      DWORD oldwerr = GetLastError();\r\n#endif\r\n      void *p = clib_getsym(cl, sym);\r\n      GCcdata *cd;\r\n      lua_assert(ctype_isfunc(ct->info) || ctype_isextern(ct->info));\r\n#if LJ_TARGET_X86 && LJ_ABI_WIN\r\n      /* Retry with decorated name for fastcall/stdcall functions. */\r\n      if (!p && ctype_isfunc(ct->info)) {\r\n\tCTInfo cconv = ctype_cconv(ct->info);\r\n\tif (cconv == CTCC_FASTCALL || cconv == CTCC_STDCALL) {\r\n\t  CTSize sz = clib_func_argsize(cts, ct);\r\n\t  const char *symd = lj_strfmt_pushf(L,\r\n\t\t\t       cconv == CTCC_FASTCALL ? \"@%s@%d\" : \"_%s@%d\",\r\n\t\t\t       sym, sz);\r\n\t  L->top--;\r\n\t  p = clib_getsym(cl, symd);\r\n\t}\r\n      }\r\n#endif\r\n      if (!p)\r\n\tclib_error(L, \"cannot resolve symbol \" LUA_QS \": %s\", sym);\r\n#if LJ_TARGET_WINDOWS\r\n      SetLastError(oldwerr);\r\n#endif\r\n      cd = lj_cdata_new(cts, id, CTSIZE_PTR);\r\n      *(void **)cdataptr(cd) = p;\r\n      setcdataV(L, tv, cd);\r\n    }\r\n  }\r\n  return tv;\r\n}\r\n\r\n/* -- C library management ------------------------------------------------ */\r\n\r\n/* Create a new CLibrary object and push it on the stack. */\r\nstatic CLibrary *clib_new(lua_State *L, GCtab *mt)\r\n{\r\n  GCtab *t = lj_tab_new(L, 0, 0);\r\n  GCudata *ud = lj_udata_new(L, sizeof(CLibrary), t);\r\n  CLibrary *cl = (CLibrary *)uddata(ud);\r\n  cl->cache = t;\r\n  ud->udtype = UDTYPE_FFI_CLIB;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcref(ud->metatable, obj2gco(mt));\r\n  setudataV(L, L->top++, ud);\r\n  return cl;\r\n}\r\n\r\n/* Load a C library. */\r\nvoid lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global)\r\n{\r\n  void *handle = clib_loadlib(L, strdata(name), global);\r\n  CLibrary *cl = clib_new(L, mt);\r\n  cl->handle = handle;\r\n}\r\n\r\n/* Unload a C library. */\r\nvoid lj_clib_unload(CLibrary *cl)\r\n{\r\n  clib_unloadlib(cl);\r\n  cl->handle = NULL;\r\n}\r\n\r\n/* Create the default C library object. */\r\nvoid lj_clib_default(lua_State *L, GCtab *mt)\r\n{\r\n  CLibrary *cl = clib_new(L, mt);\r\n  cl->handle = CLIB_DEFHANDLE;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_clib.h",
    "content": "/*\r\n** FFI C library loader.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CLIB_H\r\n#define _LJ_CLIB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* Namespace for C library indexing. */\r\n#define CLNS_INDEX\t((1u<<CT_FUNC)|(1u<<CT_EXTERN)|(1u<<CT_CONSTVAL))\r\n\r\n/* C library namespace. */\r\ntypedef struct CLibrary {\r\n  void *handle;\t\t/* Opaque handle for dynamic library loader. */\r\n  GCtab *cache;\t\t/* Cache for resolved symbols. Anchored in ud->env. */\r\n} CLibrary;\r\n\r\nLJ_FUNC TValue *lj_clib_index(lua_State *L, CLibrary *cl, GCstr *name);\r\nLJ_FUNC void lj_clib_load(lua_State *L, GCtab *mt, GCstr *name, int global);\r\nLJ_FUNC void lj_clib_unload(CLibrary *cl);\r\nLJ_FUNC void lj_clib_default(lua_State *L, GCtab *mt);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cparse.c",
    "content": "/*\r\n** C declaration parser.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/*\r\n** Important note: this is NOT a validating C parser! This is a minimal\r\n** C declaration parser, solely for use by the LuaJIT FFI.\r\n**\r\n** It ought to return correct results for properly formed C declarations,\r\n** but it may accept some invalid declarations, too (and return nonsense).\r\n** Also, it shows rather generic error messages to avoid unnecessary bloat.\r\n** If in doubt, please check the input against your favorite C compiler.\r\n*/\r\n\r\n/* -- C lexer ------------------------------------------------------------- */\r\n\r\n/* C lexer token names. */\r\nstatic const char *const ctoknames[] = {\r\n#define CTOKSTR(name, str)\tstr,\r\nCTOKDEF(CTOKSTR)\r\n#undef CTOKSTR\r\n  NULL\r\n};\r\n\r\n/* Forward declaration. */\r\nLJ_NORET static void cp_err(CPState *cp, ErrMsg em);\r\n\r\nstatic const char *cp_tok2str(CPState *cp, CPToken tok)\r\n{\r\n  lua_assert(tok < CTOK_FIRSTDECL);\r\n  if (tok > CTOK_OFS)\r\n    return ctoknames[tok-CTOK_OFS-1];\r\n  else if (!lj_char_iscntrl(tok))\r\n    return lj_strfmt_pushf(cp->L, \"%c\", tok);\r\n  else\r\n    return lj_strfmt_pushf(cp->L, \"char(%d)\", tok);\r\n}\r\n\r\n/* End-of-line? */\r\nstatic LJ_AINLINE int cp_iseol(CPChar c)\r\n{\r\n  return (c == '\\n' || c == '\\r');\r\n}\r\n\r\n/* Peek next raw character. */\r\nstatic LJ_AINLINE CPChar cp_rawpeek(CPState *cp)\r\n{\r\n  return (CPChar)(uint8_t)(*cp->p);\r\n}\r\n\r\nstatic LJ_NOINLINE CPChar cp_get_bs(CPState *cp);\r\n\r\n/* Get next character. */\r\nstatic LJ_AINLINE CPChar cp_get(CPState *cp)\r\n{\r\n  cp->c = (CPChar)(uint8_t)(*cp->p++);\r\n  if (LJ_LIKELY(cp->c != '\\\\')) return cp->c;\r\n  return cp_get_bs(cp);\r\n}\r\n\r\n/* Transparently skip backslash-escaped line breaks. */\r\nstatic LJ_NOINLINE CPChar cp_get_bs(CPState *cp)\r\n{\r\n  CPChar c2, c = cp_rawpeek(cp);\r\n  if (!cp_iseol(c)) return cp->c;\r\n  cp->p++;\r\n  c2 = cp_rawpeek(cp);\r\n  if (cp_iseol(c2) && c2 != c) cp->p++;\r\n  cp->linenumber++;\r\n  return cp_get(cp);\r\n}\r\n\r\n/* Save character in buffer. */\r\nstatic LJ_AINLINE void cp_save(CPState *cp, CPChar c)\r\n{\r\n  lj_buf_putb(&cp->sb, c);\r\n}\r\n\r\n/* Skip line break. Handles \"\\n\", \"\\r\", \"\\r\\n\" or \"\\n\\r\". */\r\nstatic void cp_newline(CPState *cp)\r\n{\r\n  CPChar c = cp_rawpeek(cp);\r\n  if (cp_iseol(c) && c != cp->c) cp->p++;\r\n  cp->linenumber++;\r\n}\r\n\r\nLJ_NORET static void cp_errmsg(CPState *cp, CPToken tok, ErrMsg em, ...)\r\n{\r\n  const char *msg, *tokstr;\r\n  lua_State *L;\r\n  va_list argp;\r\n  if (tok == 0) {\r\n    tokstr = NULL;\r\n  } else if (tok == CTOK_IDENT || tok == CTOK_INTEGER || tok == CTOK_STRING ||\r\n\t     tok >= CTOK_FIRSTDECL) {\r\n    if (sbufP(&cp->sb) == sbufB(&cp->sb)) cp_save(cp, '$');\r\n    cp_save(cp, '\\0');\r\n    tokstr = sbufB(&cp->sb);\r\n  } else {\r\n    tokstr = cp_tok2str(cp, tok);\r\n  }\r\n  L = cp->L;\r\n  va_start(argp, em);\r\n  msg = lj_strfmt_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  if (tokstr)\r\n    msg = lj_strfmt_pushf(L, err2msg(LJ_ERR_XNEAR), msg, tokstr);\r\n  if (cp->linenumber > 1)\r\n    msg = lj_strfmt_pushf(L, \"%s at line %d\", msg, cp->linenumber);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err_token(CPState *cp, CPToken tok)\r\n{\r\n  cp_errmsg(cp, cp->tok, LJ_ERR_XTOKEN, cp_tok2str(cp, tok));\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err_badidx(CPState *cp, CType *ct)\r\n{\r\n  GCstr *s = lj_ctype_repr(cp->cts->L, ctype_typeid(cp->cts, ct), NULL);\r\n  cp_errmsg(cp, 0, LJ_ERR_FFI_BADIDX, strdata(s));\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void cp_err(CPState *cp, ErrMsg em)\r\n{\r\n  cp_errmsg(cp, 0, em);\r\n}\r\n\r\n/* -- Main lexical scanner ------------------------------------------------ */\r\n\r\n/* Parse number literal. Only handles int32_t/uint32_t right now. */\r\nstatic CPToken cp_number(CPState *cp)\r\n{\r\n  StrScanFmt fmt;\r\n  TValue o;\r\n  do { cp_save(cp, cp->c); } while (lj_char_isident(cp_get(cp)));\r\n  cp_save(cp, '\\0');\r\n  fmt = lj_strscan_scan((const uint8_t *)sbufB(&cp->sb), &o, STRSCAN_OPT_C);\r\n  if (fmt == STRSCAN_INT) cp->val.id = CTID_INT32;\r\n  else if (fmt == STRSCAN_U32) cp->val.id = CTID_UINT32;\r\n  else if (!(cp->mode & CPARSE_MODE_SKIP))\r\n    cp_errmsg(cp, CTOK_INTEGER, LJ_ERR_XNUMBER);\r\n  cp->val.u32 = (uint32_t)o.i;\r\n  return CTOK_INTEGER;\r\n}\r\n\r\n/* Parse identifier or keyword. */\r\nstatic CPToken cp_ident(CPState *cp)\r\n{\r\n  do { cp_save(cp, cp->c); } while (lj_char_isident(cp_get(cp)));\r\n  cp->str = lj_buf_str(cp->L, &cp->sb);\r\n  cp->val.id = lj_ctype_getname(cp->cts, &cp->ct, cp->str, cp->tmask);\r\n  if (ctype_type(cp->ct->info) == CT_KW)\r\n    return ctype_cid(cp->ct->info);\r\n  return CTOK_IDENT;\r\n}\r\n\r\n/* Parse parameter. */\r\nstatic CPToken cp_param(CPState *cp)\r\n{\r\n  CPChar c = cp_get(cp);\r\n  TValue *o = cp->param;\r\n  if (lj_char_isident(c) || c == '$')  /* Reserve $xyz for future extensions. */\r\n    cp_errmsg(cp, c, LJ_ERR_XSYNTAX);\r\n  if (!o || o >= cp->L->top)\r\n    cp_err(cp, LJ_ERR_FFI_NUMPARAM);\r\n  cp->param = o+1;\r\n  if (tvisstr(o)) {\r\n    cp->str = strV(o);\r\n    cp->val.id = 0;\r\n    cp->ct = &cp->cts->tab[0];\r\n    return CTOK_IDENT;\r\n  } else if (tvisnumber(o)) {\r\n    cp->val.i32 = numberVint(o);\r\n    cp->val.id = CTID_INT32;\r\n    return CTOK_INTEGER;\r\n  } else {\r\n    GCcdata *cd;\r\n    if (!tviscdata(o))\r\n      lj_err_argtype(cp->L, (int)(o-cp->L->base)+1, \"type parameter\");\r\n    cd = cdataV(o);\r\n    if (cd->ctypeid == CTID_CTYPEID)\r\n      cp->val.id = *(CTypeID *)cdataptr(cd);\r\n    else\r\n      cp->val.id = cd->ctypeid;\r\n    return '$';\r\n  }\r\n}\r\n\r\n/* Parse string or character constant. */\r\nstatic CPToken cp_string(CPState *cp)\r\n{\r\n  CPChar delim = cp->c;\r\n  cp_get(cp);\r\n  while (cp->c != delim) {\r\n    CPChar c = cp->c;\r\n    if (c == '\\0') cp_errmsg(cp, CTOK_EOF, LJ_ERR_XSTR);\r\n    if (c == '\\\\') {\r\n      c = cp_get(cp);\r\n      switch (c) {\r\n      case '\\0': cp_errmsg(cp, CTOK_EOF, LJ_ERR_XSTR); break;\r\n      case 'a': c = '\\a'; break;\r\n      case 'b': c = '\\b'; break;\r\n      case 'f': c = '\\f'; break;\r\n      case 'n': c = '\\n'; break;\r\n      case 'r': c = '\\r'; break;\r\n      case 't': c = '\\t'; break;\r\n      case 'v': c = '\\v'; break;\r\n      case 'e': c = 27; break;\r\n      case 'x':\r\n\tc = 0;\r\n\twhile (lj_char_isxdigit(cp_get(cp)))\r\n\t  c = (c<<4) + (lj_char_isdigit(cp->c) ? cp->c-'0' : (cp->c&15)+9);\r\n\tcp_save(cp, (c & 0xff));\r\n\tcontinue;\r\n      default:\r\n\tif (lj_char_isdigit(c)) {\r\n\t  c -= '0';\r\n\t  if (lj_char_isdigit(cp_get(cp))) {\r\n\t    c = c*8 + (cp->c - '0');\r\n\t    if (lj_char_isdigit(cp_get(cp))) {\r\n\t      c = c*8 + (cp->c - '0');\r\n\t      cp_get(cp);\r\n\t    }\r\n\t  }\r\n\t  cp_save(cp, (c & 0xff));\r\n\t  continue;\r\n\t}\r\n\tbreak;\r\n      }\r\n    }\r\n    cp_save(cp, c);\r\n    cp_get(cp);\r\n  }\r\n  cp_get(cp);\r\n  if (delim == '\"') {\r\n    cp->str = lj_buf_str(cp->L, &cp->sb);\r\n    return CTOK_STRING;\r\n  } else {\r\n    if (sbuflen(&cp->sb) != 1) cp_err_token(cp, '\\'');\r\n    cp->val.i32 = (int32_t)(char)*sbufB(&cp->sb);\r\n    cp->val.id = CTID_INT32;\r\n    return CTOK_INTEGER;\r\n  }\r\n}\r\n\r\n/* Skip C comment. */\r\nstatic void cp_comment_c(CPState *cp)\r\n{\r\n  do {\r\n    if (cp_get(cp) == '*') {\r\n      do {\r\n\tif (cp_get(cp) == '/') { cp_get(cp); return; }\r\n      } while (cp->c == '*');\r\n    }\r\n    if (cp_iseol(cp->c)) cp_newline(cp);\r\n  } while (cp->c != '\\0');\r\n}\r\n\r\n/* Skip C++ comment. */\r\nstatic void cp_comment_cpp(CPState *cp)\r\n{\r\n  while (!cp_iseol(cp_get(cp)) && cp->c != '\\0')\r\n    ;\r\n}\r\n\r\n/* Lexical scanner for C. Only a minimal subset is implemented. */\r\nstatic CPToken cp_next_(CPState *cp)\r\n{\r\n  lj_buf_reset(&cp->sb);\r\n  for (;;) {\r\n    if (lj_char_isident(cp->c))\r\n      return lj_char_isdigit(cp->c) ? cp_number(cp) : cp_ident(cp);\r\n    switch (cp->c) {\r\n    case '\\n': case '\\r': cp_newline(cp);  /* fallthrough. */\r\n    case ' ': case '\\t': case '\\v': case '\\f': cp_get(cp); break;\r\n    case '\"': case '\\'': return cp_string(cp);\r\n    case '/':\r\n      if (cp_get(cp) == '*') cp_comment_c(cp);\r\n      else if (cp->c == '/') cp_comment_cpp(cp);\r\n      else return '/';\r\n      break;\r\n    case '|':\r\n      if (cp_get(cp) != '|') return '|'; cp_get(cp); return CTOK_OROR;\r\n    case '&':\r\n      if (cp_get(cp) != '&') return '&'; cp_get(cp); return CTOK_ANDAND;\r\n    case '=':\r\n      if (cp_get(cp) != '=') return '='; cp_get(cp); return CTOK_EQ;\r\n    case '!':\r\n      if (cp_get(cp) != '=') return '!'; cp_get(cp); return CTOK_NE;\r\n    case '<':\r\n      if (cp_get(cp) == '=') { cp_get(cp); return CTOK_LE; }\r\n      else if (cp->c == '<') { cp_get(cp); return CTOK_SHL; }\r\n      return '<';\r\n    case '>':\r\n      if (cp_get(cp) == '=') { cp_get(cp); return CTOK_GE; }\r\n      else if (cp->c == '>') { cp_get(cp); return CTOK_SHR; }\r\n      return '>';\r\n    case '-':\r\n      if (cp_get(cp) != '>') return '-'; cp_get(cp); return CTOK_DEREF;\r\n    case '$':\r\n      return cp_param(cp);\r\n    case '\\0': return CTOK_EOF;\r\n    default: { CPToken c = cp->c; cp_get(cp); return c; }\r\n    }\r\n  }\r\n}\r\n\r\nstatic LJ_NOINLINE CPToken cp_next(CPState *cp)\r\n{\r\n  return (cp->tok = cp_next_(cp));\r\n}\r\n\r\n/* -- C parser ------------------------------------------------------------ */\r\n\r\n/* Namespaces for resolving identifiers. */\r\n#define CPNS_DEFAULT \\\r\n  ((1u<<CT_KW)|(1u<<CT_TYPEDEF)|(1u<<CT_FUNC)|(1u<<CT_EXTERN)|(1u<<CT_CONSTVAL))\r\n#define CPNS_STRUCT\t((1u<<CT_KW)|(1u<<CT_STRUCT)|(1u<<CT_ENUM))\r\n\r\ntypedef CTypeID CPDeclIdx;\t/* Index into declaration stack. */\r\ntypedef uint32_t CPscl;\t\t/* Storage class flags. */\r\n\r\n/* Type declaration context. */\r\ntypedef struct CPDecl {\r\n  CPDeclIdx top;\t/* Top of declaration stack. */\r\n  CPDeclIdx pos;\t/* Insertion position in declaration chain. */\r\n  CPDeclIdx specpos;\t/* Saved position for declaration specifier. */\r\n  uint32_t mode;\t/* Declarator mode. */\r\n  CPState *cp;\t\t/* C parser state. */\r\n  GCstr *name;\t\t/* Name of declared identifier (if direct). */\r\n  GCstr *redir;\t\t/* Redirected symbol name. */\r\n  CTypeID nameid;\t/* Existing typedef for declared identifier. */\r\n  CTInfo attr;\t\t/* Attributes. */\r\n  CTInfo fattr;\t\t/* Function attributes. */\r\n  CTInfo specattr;\t/* Saved attributes. */\r\n  CTInfo specfattr;\t/* Saved function attributes. */\r\n  CTSize bits;\t\t/* Field size in bits (if any). */\r\n  CType stack[CPARSE_MAX_DECLSTACK];  /* Type declaration stack. */\r\n} CPDecl;\r\n\r\n/* Forward declarations. */\r\nstatic CPscl cp_decl_spec(CPState *cp, CPDecl *decl, CPscl scl);\r\nstatic void cp_declarator(CPState *cp, CPDecl *decl);\r\nstatic CTypeID cp_decl_abstract(CPState *cp);\r\n\r\n/* Initialize C parser state. Caller must set up: L, p, srcname, mode. */\r\nstatic void cp_init(CPState *cp)\r\n{\r\n  cp->linenumber = 1;\r\n  cp->depth = 0;\r\n  cp->curpack = 0;\r\n  cp->packstack[0] = 255;\r\n  lj_buf_init(cp->L, &cp->sb);\r\n  lua_assert(cp->p != NULL);\r\n  cp_get(cp);  /* Read-ahead first char. */\r\n  cp->tok = 0;\r\n  cp->tmask = CPNS_DEFAULT;\r\n  cp_next(cp);  /* Read-ahead first token. */\r\n}\r\n\r\n/* Cleanup C parser state. */\r\nstatic void cp_cleanup(CPState *cp)\r\n{\r\n  global_State *g = G(cp->L);\r\n  lj_buf_free(g, &cp->sb);\r\n}\r\n\r\n/* Check and consume optional token. */\r\nstatic int cp_opt(CPState *cp, CPToken tok)\r\n{\r\n  if (cp->tok == tok) { cp_next(cp); return 1; }\r\n  return 0;\r\n}\r\n\r\n/* Check and consume token. */\r\nstatic void cp_check(CPState *cp, CPToken tok)\r\n{\r\n  if (cp->tok != tok) cp_err_token(cp, tok);\r\n  cp_next(cp);\r\n}\r\n\r\n/* Check if the next token may start a type declaration. */\r\nstatic int cp_istypedecl(CPState *cp)\r\n{\r\n  if (cp->tok >= CTOK_FIRSTDECL && cp->tok <= CTOK_LASTDECL) return 1;\r\n  if (cp->tok == CTOK_IDENT && ctype_istypedef(cp->ct->info)) return 1;\r\n  if (cp->tok == '$') return 1;\r\n  return 0;\r\n}\r\n\r\n/* -- Constant expression evaluator --------------------------------------- */\r\n\r\n/* Forward declarations. */\r\nstatic void cp_expr_unary(CPState *cp, CPValue *k);\r\nstatic void cp_expr_sub(CPState *cp, CPValue *k, int pri);\r\n\r\n/* Please note that type handling is very weak here. Most ops simply\r\n** assume integer operands. Accessors are only needed to compute types and\r\n** return synthetic values. The only purpose of the expression evaluator\r\n** is to compute the values of constant expressions one would typically\r\n** find in C header files. And again: this is NOT a validating C parser!\r\n*/\r\n\r\n/* Parse comma separated expression and return last result. */\r\nstatic void cp_expr_comma(CPState *cp, CPValue *k)\r\n{\r\n  do { cp_expr_sub(cp, k, 0); } while (cp_opt(cp, ','));\r\n}\r\n\r\n/* Parse sizeof/alignof operator. */\r\nstatic void cp_expr_sizeof(CPState *cp, CPValue *k, int wantsz)\r\n{\r\n  CTSize sz;\r\n  CTInfo info;\r\n  if (cp_opt(cp, '(')) {\r\n    if (cp_istypedecl(cp))\r\n      k->id = cp_decl_abstract(cp);\r\n    else\r\n      cp_expr_comma(cp, k);\r\n    cp_check(cp, ')');\r\n  } else {\r\n    cp_expr_unary(cp, k);\r\n  }\r\n  info = lj_ctype_info(cp->cts, k->id, &sz);\r\n  if (wantsz) {\r\n    if (sz != CTSIZE_INVALID)\r\n      k->u32 = sz;\r\n    else if (k->id != CTID_A_CCHAR)  /* Special case for sizeof(\"string\"). */\r\n      cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n  } else {\r\n    k->u32 = 1u << ctype_align(info);\r\n  }\r\n  k->id = CTID_UINT32;  /* Really size_t. */\r\n}\r\n\r\n/* Parse prefix operators. */\r\nstatic void cp_expr_prefix(CPState *cp, CPValue *k)\r\n{\r\n  if (cp->tok == CTOK_INTEGER) {\r\n    *k = cp->val; cp_next(cp);\r\n  } else if (cp_opt(cp, '+')) {\r\n    cp_expr_unary(cp, k);  /* Nothing to do (well, integer promotion). */\r\n  } else if (cp_opt(cp, '-')) {\r\n    cp_expr_unary(cp, k); k->i32 = -k->i32;\r\n  } else if (cp_opt(cp, '~')) {\r\n    cp_expr_unary(cp, k); k->i32 = ~k->i32;\r\n  } else if (cp_opt(cp, '!')) {\r\n    cp_expr_unary(cp, k); k->i32 = !k->i32; k->id = CTID_INT32;\r\n  } else if (cp_opt(cp, '(')) {\r\n    if (cp_istypedecl(cp)) {  /* Cast operator. */\r\n      CTypeID id = cp_decl_abstract(cp);\r\n      cp_check(cp, ')');\r\n      cp_expr_unary(cp, k);\r\n      k->id = id;  /* No conversion performed. */\r\n    } else {  /* Sub-expression. */\r\n      cp_expr_comma(cp, k);\r\n      cp_check(cp, ')');\r\n    }\r\n  } else if (cp_opt(cp, '*')) {  /* Indirection. */\r\n    CType *ct;\r\n    cp_expr_unary(cp, k);\r\n    ct = lj_ctype_rawref(cp->cts, k->id);\r\n    if (!ctype_ispointer(ct->info))\r\n      cp_err_badidx(cp, ct);\r\n    k->u32 = 0; k->id = ctype_cid(ct->info);\r\n  } else if (cp_opt(cp, '&')) {  /* Address operator. */\r\n    cp_expr_unary(cp, k);\r\n    k->id = lj_ctype_intern(cp->cts, CTINFO(CT_PTR, CTALIGN_PTR+k->id),\r\n\t\t\t    CTSIZE_PTR);\r\n  } else if (cp_opt(cp, CTOK_SIZEOF)) {\r\n    cp_expr_sizeof(cp, k, 1);\r\n  } else if (cp_opt(cp, CTOK_ALIGNOF)) {\r\n    cp_expr_sizeof(cp, k, 0);\r\n  } else if (cp->tok == CTOK_IDENT) {\r\n    if (ctype_type(cp->ct->info) == CT_CONSTVAL) {\r\n      k->u32 = cp->ct->size; k->id = ctype_cid(cp->ct->info);\r\n    } else if (ctype_type(cp->ct->info) == CT_EXTERN) {\r\n      k->u32 = cp->val.id; k->id = ctype_cid(cp->ct->info);\r\n    } else if (ctype_type(cp->ct->info) == CT_FUNC) {\r\n      k->u32 = cp->val.id; k->id = cp->val.id;\r\n    } else {\r\n      goto err_expr;\r\n    }\r\n    cp_next(cp);\r\n  } else if (cp->tok == CTOK_STRING) {\r\n    CTSize sz = cp->str->len;\r\n    while (cp_next(cp) == CTOK_STRING)\r\n      sz += cp->str->len;\r\n    k->u32 = sz + 1;\r\n    k->id = CTID_A_CCHAR;\r\n  } else {\r\n  err_expr:\r\n    cp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n  }\r\n}\r\n\r\n/* Parse postfix operators. */\r\nstatic void cp_expr_postfix(CPState *cp, CPValue *k)\r\n{\r\n  for (;;) {\r\n    CType *ct;\r\n    if (cp_opt(cp, '[')) {  /* Array/pointer index. */\r\n      CPValue k2;\r\n      cp_expr_comma(cp, &k2);\r\n      ct = lj_ctype_rawref(cp->cts, k->id);\r\n      if (!ctype_ispointer(ct->info)) {\r\n\tct = lj_ctype_rawref(cp->cts, k2.id);\r\n\tif (!ctype_ispointer(ct->info))\r\n\t  cp_err_badidx(cp, ct);\r\n      }\r\n      cp_check(cp, ']');\r\n      k->u32 = 0;\r\n    } else if (cp->tok == '.' || cp->tok == CTOK_DEREF) {  /* Struct deref. */\r\n      CTSize ofs;\r\n      CType *fct;\r\n      ct = lj_ctype_rawref(cp->cts, k->id);\r\n      if (cp->tok == CTOK_DEREF) {\r\n\tif (!ctype_ispointer(ct->info))\r\n\t  cp_err_badidx(cp, ct);\r\n\tct = lj_ctype_rawref(cp->cts, ctype_cid(ct->info));\r\n      }\r\n      cp_next(cp);\r\n      if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n      if (!ctype_isstruct(ct->info) || ct->size == CTSIZE_INVALID ||\r\n\t  !(fct = lj_ctype_getfield(cp->cts, ct, cp->str, &ofs)) ||\r\n\t  ctype_isbitfield(fct->info)) {\r\n\tGCstr *s = lj_ctype_repr(cp->cts->L, ctype_typeid(cp->cts, ct), NULL);\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_BADMEMBER, strdata(s), strdata(cp->str));\r\n      }\r\n      ct = fct;\r\n      k->u32 = ctype_isconstval(ct->info) ? ct->size : 0;\r\n      cp_next(cp);\r\n    } else {\r\n      return;\r\n    }\r\n    k->id = ctype_cid(ct->info);\r\n  }\r\n}\r\n\r\n/* Parse infix operators. */\r\nstatic void cp_expr_infix(CPState *cp, CPValue *k, int pri)\r\n{\r\n  CPValue k2;\r\n  k2.u32 = 0; k2.id = 0;  /* Silence the compiler. */\r\n  for (;;) {\r\n    switch (pri) {\r\n    case 0:\r\n      if (cp_opt(cp, '?')) {\r\n\tCPValue k3;\r\n\tcp_expr_comma(cp, &k2);  /* Right-associative. */\r\n\tcp_check(cp, ':');\r\n\tcp_expr_sub(cp, &k3, 0);\r\n\tk->u32 = k->u32 ? k2.u32 : k3.u32;\r\n\tk->id = k2.id > k3.id ? k2.id : k3.id;\r\n\tcontinue;\r\n      }\r\n    case 1:\r\n      if (cp_opt(cp, CTOK_OROR)) {\r\n\tcp_expr_sub(cp, &k2, 2); k->i32 = k->u32 || k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 2:\r\n      if (cp_opt(cp, CTOK_ANDAND)) {\r\n\tcp_expr_sub(cp, &k2, 3); k->i32 = k->u32 && k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 3:\r\n      if (cp_opt(cp, '|')) {\r\n\tcp_expr_sub(cp, &k2, 4); k->u32 = k->u32 | k2.u32; goto arith_result;\r\n      }\r\n    case 4:\r\n      if (cp_opt(cp, '^')) {\r\n\tcp_expr_sub(cp, &k2, 5); k->u32 = k->u32 ^ k2.u32; goto arith_result;\r\n      }\r\n    case 5:\r\n      if (cp_opt(cp, '&')) {\r\n\tcp_expr_sub(cp, &k2, 6); k->u32 = k->u32 & k2.u32; goto arith_result;\r\n      }\r\n    case 6:\r\n      if (cp_opt(cp, CTOK_EQ)) {\r\n\tcp_expr_sub(cp, &k2, 7); k->i32 = k->u32 == k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_NE)) {\r\n\tcp_expr_sub(cp, &k2, 7); k->i32 = k->u32 != k2.u32; k->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 7:\r\n      if (cp_opt(cp, '<')) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 < k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 < k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '>')) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 > k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 > k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_LE)) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 <= k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 <= k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_GE)) {\r\n\tcp_expr_sub(cp, &k2, 8);\r\n\tif (k->id == CTID_INT32 && k2.id == CTID_INT32)\r\n\t  k->i32 = k->i32 >= k2.i32;\r\n\telse\r\n\t  k->i32 = k->u32 >= k2.u32;\r\n\tk->id = CTID_INT32;\r\n\tcontinue;\r\n      }\r\n    case 8:\r\n      if (cp_opt(cp, CTOK_SHL)) {\r\n\tcp_expr_sub(cp, &k2, 9); k->u32 = k->u32 << k2.u32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, CTOK_SHR)) {\r\n\tcp_expr_sub(cp, &k2, 9);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 >> k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 >> k2.u32;\r\n\tcontinue;\r\n      }\r\n    case 9:\r\n      if (cp_opt(cp, '+')) {\r\n\tcp_expr_sub(cp, &k2, 10); k->u32 = k->u32 + k2.u32;\r\n      arith_result:\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '-')) {\r\n\tcp_expr_sub(cp, &k2, 10); k->u32 = k->u32 - k2.u32; goto arith_result;\r\n      }\r\n    case 10:\r\n      if (cp_opt(cp, '*')) {\r\n\tcp_expr_unary(cp, &k2); k->u32 = k->u32 * k2.u32; goto arith_result;\r\n      } else if (cp_opt(cp, '/')) {\r\n\tcp_expr_unary(cp, &k2);\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tif (k2.u32 == 0 ||\r\n\t    (k->id == CTID_INT32 && k->u32 == 0x80000000u && k2.i32 == -1))\r\n\t  cp_err(cp, LJ_ERR_BADVAL);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 / k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 / k2.u32;\r\n\tcontinue;\r\n      } else if (cp_opt(cp, '%')) {\r\n\tcp_expr_unary(cp, &k2);\r\n\tif (k2.id > k->id) k->id = k2.id;  /* Trivial promotion to unsigned. */\r\n\tif (k2.u32 == 0 ||\r\n\t    (k->id == CTID_INT32 && k->u32 == 0x80000000u && k2.i32 == -1))\r\n\t  cp_err(cp, LJ_ERR_BADVAL);\r\n\tif (k->id == CTID_INT32)\r\n\t  k->i32 = k->i32 % k2.i32;\r\n\telse\r\n\t  k->u32 = k->u32 % k2.u32;\r\n\tcontinue;\r\n      }\r\n    default:\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\n/* Parse and evaluate unary expression. */\r\nstatic void cp_expr_unary(CPState *cp, CPValue *k)\r\n{\r\n  if (++cp->depth > CPARSE_MAX_DECLDEPTH) cp_err(cp, LJ_ERR_XLEVELS);\r\n  cp_expr_prefix(cp, k);\r\n  cp_expr_postfix(cp, k);\r\n  cp->depth--;\r\n}\r\n\r\n/* Parse and evaluate sub-expression. */\r\nstatic void cp_expr_sub(CPState *cp, CPValue *k, int pri)\r\n{\r\n  cp_expr_unary(cp, k);\r\n  cp_expr_infix(cp, k, pri);\r\n}\r\n\r\n/* Parse constant integer expression. */\r\nstatic void cp_expr_kint(CPState *cp, CPValue *k)\r\n{\r\n  CType *ct;\r\n  cp_expr_sub(cp, k, 0);\r\n  ct = ctype_raw(cp->cts, k->id);\r\n  if (!ctype_isinteger(ct->info)) cp_err(cp, LJ_ERR_BADVAL);\r\n}\r\n\r\n/* Parse (non-negative) size expression. */\r\nstatic CTSize cp_expr_ksize(CPState *cp)\r\n{\r\n  CPValue k;\r\n  cp_expr_kint(cp, &k);\r\n  if (k.u32 >= 0x80000000u) cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n  return k.u32;\r\n}\r\n\r\n/* -- Type declaration stack management ----------------------------------- */\r\n\r\n/* Add declaration element behind the insertion position. */\r\nstatic CPDeclIdx cp_add(CPDecl *decl, CTInfo info, CTSize size)\r\n{\r\n  CPDeclIdx top = decl->top;\r\n  if (top >= CPARSE_MAX_DECLSTACK) cp_err(decl->cp, LJ_ERR_XLEVELS);\r\n  decl->stack[top].info = info;\r\n  decl->stack[top].size = size;\r\n  decl->stack[top].sib = 0;\r\n  setgcrefnull(decl->stack[top].name);\r\n  decl->stack[top].next = decl->stack[decl->pos].next;\r\n  decl->stack[decl->pos].next = (CTypeID1)top;\r\n  decl->top = top+1;\r\n  return top;\r\n}\r\n\r\n/* Push declaration element before the insertion position. */\r\nstatic CPDeclIdx cp_push(CPDecl *decl, CTInfo info, CTSize size)\r\n{\r\n  return (decl->pos = cp_add(decl, info, size));\r\n}\r\n\r\n/* Push or merge attributes. */\r\nstatic void cp_push_attributes(CPDecl *decl)\r\n{\r\n  CType *ct = &decl->stack[decl->pos];\r\n  if (ctype_isfunc(ct->info)) {  /* Ok to modify in-place. */\r\n#if LJ_TARGET_X86\r\n    if ((decl->fattr & CTFP_CCONV))\r\n      ct->info = (ct->info & (CTMASK_NUM|CTF_VARARG|CTMASK_CID)) +\r\n\t\t (decl->fattr & ~CTMASK_CID);\r\n#endif\r\n  } else {\r\n    if ((decl->attr & CTFP_ALIGNED) && !(decl->mode & CPARSE_MODE_FIELD))\r\n      cp_push(decl, CTINFO(CT_ATTRIB, CTATTRIB(CTA_ALIGN)),\r\n\t      ctype_align(decl->attr));\r\n  }\r\n}\r\n\r\n/* Push unrolled type to declaration stack and merge qualifiers. */\r\nstatic void cp_push_type(CPDecl *decl, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(decl->cp->cts, id);\r\n  CTInfo info = ct->info;\r\n  CTSize size = ct->size;\r\n  switch (ctype_type(info)) {\r\n  case CT_STRUCT: case CT_ENUM:\r\n    cp_push(decl, CTINFO(CT_TYPEDEF, id), 0);  /* Don't copy unique types. */\r\n    if ((decl->attr & CTF_QUAL)) {  /* Push unmerged qualifiers. */\r\n      cp_push(decl, CTINFO(CT_ATTRIB, CTATTRIB(CTA_QUAL)),\r\n\t      (decl->attr & CTF_QUAL));\r\n      decl->attr &= ~CTF_QUAL;\r\n    }\r\n    break;\r\n  case CT_ATTRIB:\r\n    if (ctype_isxattrib(info, CTA_QUAL))\r\n      decl->attr &= ~size;  /* Remove redundant qualifiers. */\r\n    cp_push_type(decl, ctype_cid(info));  /* Unroll. */\r\n    cp_push(decl, info & ~CTMASK_CID, size);  /* Copy type. */\r\n    break;\r\n  case CT_ARRAY:\r\n    if ((ct->info & (CTF_VECTOR|CTF_COMPLEX))) {\r\n      info |= (decl->attr & CTF_QUAL);\r\n      decl->attr &= ~CTF_QUAL;\r\n    }\r\n    cp_push_type(decl, ctype_cid(info));  /* Unroll. */\r\n    cp_push(decl, info & ~CTMASK_CID, size);  /* Copy type. */\r\n    decl->stack[decl->pos].sib = 1;  /* Mark as already checked and sized. */\r\n    /* Note: this is not copied to the ct->sib in the C type table. */\r\n    break;\r\n  case CT_FUNC:\r\n    /* Copy type, link parameters (shared). */\r\n    decl->stack[cp_push(decl, info, size)].sib = ct->sib;\r\n    break;\r\n  default:\r\n    /* Copy type, merge common qualifiers. */\r\n    cp_push(decl, info|(decl->attr & CTF_QUAL), size);\r\n    decl->attr &= ~CTF_QUAL;\r\n    break;\r\n  }\r\n}\r\n\r\n/* Consume the declaration element chain and intern the C type. */\r\nstatic CTypeID cp_decl_intern(CPState *cp, CPDecl *decl)\r\n{\r\n  CTypeID id = 0;\r\n  CPDeclIdx idx = 0;\r\n  CTSize csize = CTSIZE_INVALID;\r\n  CTSize cinfo = 0;\r\n  do {\r\n    CType *ct = &decl->stack[idx];\r\n    CTInfo info = ct->info;\r\n    CTInfo size = ct->size;\r\n    /* The cid is already part of info for copies of pointers/functions. */\r\n    idx = ct->next;\r\n    if (ctype_istypedef(info)) {\r\n      lua_assert(id == 0);\r\n      id = ctype_cid(info);\r\n      /* Always refetch info/size, since struct/enum may have been completed. */\r\n      cinfo = ctype_get(cp->cts, id)->info;\r\n      csize = ctype_get(cp->cts, id)->size;\r\n      lua_assert(ctype_isstruct(cinfo) || ctype_isenum(cinfo));\r\n    } else if (ctype_isfunc(info)) {  /* Intern function. */\r\n      CType *fct;\r\n      CTypeID fid;\r\n      CTypeID sib;\r\n      if (id) {\r\n\tCType *refct = ctype_raw(cp->cts, id);\r\n\t/* Reject function or refarray return types. */\r\n\tif (ctype_isfunc(refct->info) || ctype_isrefarray(refct->info))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n      }\r\n      /* No intervening attributes allowed, skip forward. */\r\n      while (idx) {\r\n\tCType *ctn = &decl->stack[idx];\r\n\tif (!ctype_isattrib(ctn->info)) break;\r\n\tidx = ctn->next;  /* Skip attribute. */\r\n      }\r\n      sib = ct->sib;  /* Next line may reallocate the C type table. */\r\n      fid = lj_ctype_new(cp->cts, &fct);\r\n      csize = CTSIZE_INVALID;\r\n      fct->info = cinfo = info + id;\r\n      fct->size = size;\r\n      fct->sib = sib;\r\n      id = fid;\r\n    } else if (ctype_isattrib(info)) {\r\n      if (ctype_isxattrib(info, CTA_QUAL))\r\n\tcinfo |= size;\r\n      else if (ctype_isxattrib(info, CTA_ALIGN))\r\n\tCTF_INSERT(cinfo, ALIGN, size);\r\n      id = lj_ctype_intern(cp->cts, info+id, size);\r\n      /* Inherit csize/cinfo from original type. */\r\n    } else {\r\n      if (ctype_isnum(info)) {  /* Handle mode/vector-size attributes. */\r\n\tlua_assert(id == 0);\r\n\tif (!(info & CTF_BOOL)) {\r\n\t  CTSize msize = ctype_msizeP(decl->attr);\r\n\t  CTSize vsize = ctype_vsizeP(decl->attr);\r\n\t  if (msize && (!(info & CTF_FP) || (msize == 4 || msize == 8))) {\r\n\t    CTSize malign = lj_fls(msize);\r\n\t    if (malign > 4) malign = 4;  /* Limit alignment. */\r\n\t    CTF_INSERT(info, ALIGN, malign);\r\n\t    size = msize;  /* Override size via mode. */\r\n\t  }\r\n\t  if (vsize) {  /* Vector size set? */\r\n\t    CTSize esize = lj_fls(size);\r\n\t    if (vsize >= esize) {\r\n\t      /* Intern the element type first. */\r\n\t      id = lj_ctype_intern(cp->cts, info, size);\r\n\t      /* Then create a vector (array) with vsize alignment. */\r\n\t      size = (1u << vsize);\r\n\t      if (vsize > 4) vsize = 4;  /* Limit alignment. */\r\n\t      if (ctype_align(info) > vsize) vsize = ctype_align(info);\r\n\t      info = CTINFO(CT_ARRAY, (info & CTF_QUAL) + CTF_VECTOR +\r\n\t\t\t\t      CTALIGN(vsize));\r\n\t    }\r\n\t  }\r\n\t}\r\n      } else if (ctype_isptr(info)) {\r\n\t/* Reject pointer/ref to ref. */\r\n\tif (id && ctype_isref(ctype_raw(cp->cts, id)->info))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n\tif (ctype_isref(info)) {\r\n\t  info &= ~CTF_VOLATILE;  /* Refs are always const, never volatile. */\r\n\t  /* No intervening attributes allowed, skip forward. */\r\n\t  while (idx) {\r\n\t    CType *ctn = &decl->stack[idx];\r\n\t    if (!ctype_isattrib(ctn->info)) break;\r\n\t    idx = ctn->next;  /* Skip attribute. */\r\n\t  }\r\n\t}\r\n      } else if (ctype_isarray(info)) {  /* Check for valid array size etc. */\r\n\tif (ct->sib == 0) {  /* Only check/size arrays not copied by unroll. */\r\n\t  if (ctype_isref(cinfo))  /* Reject arrays of refs. */\r\n\t    cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n\t  /* Reject VLS or unknown-sized types. */\r\n\t  if (ctype_isvltype(cinfo) || csize == CTSIZE_INVALID)\r\n\t    cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\t  /* a[] and a[?] keep their invalid size. */\r\n\t  if (size != CTSIZE_INVALID) {\r\n\t    uint64_t xsz = (uint64_t)size * csize;\r\n\t    if (xsz >= 0x80000000u) cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\t    size = (CTSize)xsz;\r\n\t  }\r\n\t}\r\n\tif ((cinfo & CTF_ALIGN) > (info & CTF_ALIGN))  /* Find max. align. */\r\n\t  info = (info & ~CTF_ALIGN) | (cinfo & CTF_ALIGN);\r\n\tinfo |= (cinfo & CTF_QUAL);  /* Inherit qual. */\r\n      } else {\r\n\tlua_assert(ctype_isvoid(info));\r\n      }\r\n      csize = size;\r\n      cinfo = info+id;\r\n      id = lj_ctype_intern(cp->cts, info+id, size);\r\n    }\r\n  } while (idx);\r\n  return id;\r\n}\r\n\r\n/* -- C declaration parser ------------------------------------------------ */\r\n\r\n#define H_(le, be)\tLJ_ENDIAN_SELECT(0x##le, 0x##be)\r\n\r\n/* Reset declaration state to declaration specifier. */\r\nstatic void cp_decl_reset(CPDecl *decl)\r\n{\r\n  decl->pos = decl->specpos;\r\n  decl->top = decl->specpos+1;\r\n  decl->stack[decl->specpos].next = 0;\r\n  decl->attr = decl->specattr;\r\n  decl->fattr = decl->specfattr;\r\n  decl->name = NULL;\r\n  decl->redir = NULL;\r\n}\r\n\r\n/* Parse constant initializer. */\r\n/* NYI: FP constants and strings as initializers. */\r\nstatic CTypeID cp_decl_constinit(CPState *cp, CType **ctp, CTypeID ctypeid)\r\n{\r\n  CType *ctt = ctype_get(cp->cts, ctypeid);\r\n  CTInfo info;\r\n  CTSize size;\r\n  CPValue k;\r\n  CTypeID constid;\r\n  while (ctype_isattrib(ctt->info)) {  /* Skip attributes. */\r\n    ctypeid = ctype_cid(ctt->info);  /* Update ID, too. */\r\n    ctt = ctype_get(cp->cts, ctypeid);\r\n  }\r\n  info = ctt->info;\r\n  size = ctt->size;\r\n  if (!ctype_isinteger(info) || !(info & CTF_CONST) || size > 4)\r\n    cp_err(cp, LJ_ERR_FFI_INVTYPE);\r\n  cp_check(cp, '=');\r\n  cp_expr_sub(cp, &k, 0);\r\n  constid = lj_ctype_new(cp->cts, ctp);\r\n  (*ctp)->info = CTINFO(CT_CONSTVAL, CTF_CONST|ctypeid);\r\n  k.u32 <<= 8*(4-size);\r\n  if ((info & CTF_UNSIGNED))\r\n    k.u32 >>= 8*(4-size);\r\n  else\r\n    k.u32 = (uint32_t)((int32_t)k.u32 >> 8*(4-size));\r\n  (*ctp)->size = k.u32;\r\n  return constid;\r\n}\r\n\r\n/* Parse size in parentheses as part of attribute. */\r\nstatic CTSize cp_decl_sizeattr(CPState *cp)\r\n{\r\n  CTSize sz;\r\n  uint32_t oldtmask = cp->tmask;\r\n  cp->tmask = CPNS_DEFAULT;  /* Required for expression evaluator. */\r\n  cp_check(cp, '(');\r\n  sz = cp_expr_ksize(cp);\r\n  cp->tmask = oldtmask;\r\n  cp_check(cp, ')');\r\n  return sz;\r\n}\r\n\r\n/* Parse alignment attribute. */\r\nstatic void cp_decl_align(CPState *cp, CPDecl *decl)\r\n{\r\n  CTSize al = 4;  /* Unspecified alignment is 16 bytes. */\r\n  if (cp->tok == '(') {\r\n    al = cp_decl_sizeattr(cp);\r\n    al = al ? lj_fls(al) : 0;\r\n  }\r\n  CTF_INSERT(decl->attr, ALIGN, al);\r\n  decl->attr |= CTFP_ALIGNED;\r\n}\r\n\r\n/* Parse GCC asm(\"name\") redirect. */\r\nstatic void cp_decl_asm(CPState *cp, CPDecl *decl)\r\n{\r\n  UNUSED(decl);\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  if (cp->tok == CTOK_STRING) {\r\n    GCstr *str = cp->str;\r\n    while (cp_next(cp) == CTOK_STRING) {\r\n      lj_strfmt_pushf(cp->L, \"%s%s\", strdata(str), strdata(cp->str));\r\n      cp->L->top--;\r\n      str = strV(cp->L->top);\r\n    }\r\n    decl->redir = str;\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse GCC __attribute__((mode(...))). */\r\nstatic void cp_decl_mode(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_check(cp, '(');\r\n  if (cp->tok == CTOK_IDENT) {\r\n    const char *s = strdata(cp->str);\r\n    CTSize sz = 0, vlen = 0;\r\n    if (s[0] == '_' && s[1] == '_') s += 2;\r\n    if (*s == 'V') {\r\n      s++;\r\n      vlen = *s++ - '0';\r\n      if (*s >= '0' && *s <= '9')\r\n\tvlen = vlen*10 + (*s++ - '0');\r\n    }\r\n    switch (*s++) {\r\n    case 'Q': sz = 1; break;\r\n    case 'H': sz = 2; break;\r\n    case 'S': sz = 4; break;\r\n    case 'D': sz = 8; break;\r\n    case 'T': sz = 16; break;\r\n    case 'O': sz = 32; break;\r\n    default: goto bad_size;\r\n    }\r\n    if (*s == 'I' || *s == 'F') {\r\n      CTF_INSERT(decl->attr, MSIZEP, sz);\r\n      if (vlen) CTF_INSERT(decl->attr, VSIZEP, lj_fls(vlen*sz));\r\n    }\r\n  bad_size:\r\n    cp_next(cp);\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse GCC __attribute__((...)). */\r\nstatic void cp_decl_gccattribute(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  cp_check(cp, '(');\r\n  while (cp->tok != ')') {\r\n    if (cp->tok == CTOK_IDENT) {\r\n      GCstr *attrstr = cp->str;\r\n      cp_next(cp);\r\n      switch (attrstr->hash) {\r\n      case H_(64a9208e,8ce14319): case H_(8e6331b2,95a282af):  /* aligned */\r\n\tcp_decl_align(cp, decl);\r\n\tbreak;\r\n      case H_(42eb47de,f0ede26c): case H_(29f48a09,cf383e0c):  /* packed */\r\n\tdecl->attr |= CTFP_PACKED;\r\n\tbreak;\r\n      case H_(0a84eef6,8dfab04c): case H_(995cf92c,d5696591):  /* mode */\r\n\tcp_decl_mode(cp, decl);\r\n\tbreak;\r\n      case H_(0ab31997,2d5213fa): case H_(bf875611,200e9990):  /* vector_size */\r\n\t{\r\n\t  CTSize vsize = cp_decl_sizeattr(cp);\r\n\t  if (vsize) CTF_INSERT(decl->attr, VSIZEP, lj_fls(vsize));\r\n\t}\r\n\tbreak;\r\n#if LJ_TARGET_X86\r\n      case H_(5ad22db8,c689b848): case H_(439150fa,65ea78cb):  /* regparm */\r\n\tCTF_INSERT(decl->fattr, REGPARM, cp_decl_sizeattr(cp));\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(18fc0b98,7ff4c074): case H_(4e62abed,0a747424):  /* cdecl */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_CDECL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(72b2e41b,494c5a44): case H_(f2356d59,f25fc9bd):  /* thiscall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_THISCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(0d0ffc42,ab746f88): case H_(21c54ba1,7f0ca7e3):  /* fastcall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_FASTCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(ef76b040,9412e06a): case H_(de56697b,c750e6e1):  /* stdcall */\r\n\tCTF_INSERT(decl->fattr, CCONV, CTCC_STDCALL);\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n      case H_(ea78b622,f234bd8e): case H_(252ffb06,8d50f34b):  /* sseregparm */\r\n\tdecl->fattr |= CTF_SSEREGPARM;\r\n\tdecl->fattr |= CTFP_CCONV;\r\n\tbreak;\r\n#endif\r\n      default:  /* Skip all other attributes. */\r\n\tgoto skip_attr;\r\n      }\r\n    } else if (cp->tok >= CTOK_FIRSTDECL) {  /* For __attribute((const)) etc. */\r\n      cp_next(cp);\r\n    skip_attr:\r\n      if (cp_opt(cp, '(')) {\r\n\twhile (cp->tok != ')' && cp->tok != CTOK_EOF) cp_next(cp);\r\n\tcp_check(cp, ')');\r\n      }\r\n    } else {\r\n      break;\r\n    }\r\n    if (!cp_opt(cp, ',')) break;\r\n  }\r\n  cp_check(cp, ')');\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse MSVC __declspec(...). */\r\nstatic void cp_decl_msvcattribute(CPState *cp, CPDecl *decl)\r\n{\r\n  cp_next(cp);\r\n  cp_check(cp, '(');\r\n  while (cp->tok == CTOK_IDENT) {\r\n    GCstr *attrstr = cp->str;\r\n    cp_next(cp);\r\n    switch (attrstr->hash) {\r\n    case H_(bc2395fa,98f267f8):  /* align */\r\n      cp_decl_align(cp, decl);\r\n      break;\r\n    default:  /* Ignore all other attributes. */\r\n      if (cp_opt(cp, '(')) {\r\n\twhile (cp->tok != ')' && cp->tok != CTOK_EOF) cp_next(cp);\r\n\tcp_check(cp, ')');\r\n      }\r\n      break;\r\n    }\r\n  }\r\n  cp_check(cp, ')');\r\n}\r\n\r\n/* Parse declaration attributes (and common qualifiers). */\r\nstatic void cp_decl_attributes(CPState *cp, CPDecl *decl)\r\n{\r\n  for (;;) {\r\n    switch (cp->tok) {\r\n    case CTOK_CONST: decl->attr |= CTF_CONST; break;\r\n    case CTOK_VOLATILE: decl->attr |= CTF_VOLATILE; break;\r\n    case CTOK_RESTRICT: break;  /* Ignore. */\r\n    case CTOK_EXTENSION: break;  /* Ignore. */\r\n    case CTOK_ATTRIBUTE: cp_decl_gccattribute(cp, decl); continue;\r\n    case CTOK_ASM: cp_decl_asm(cp, decl); continue;\r\n    case CTOK_DECLSPEC: cp_decl_msvcattribute(cp, decl); continue;\r\n    case CTOK_CCDECL:\r\n#if LJ_TARGET_X86\r\n      CTF_INSERT(decl->fattr, CCONV, cp->ct->size);\r\n      decl->fattr |= CTFP_CCONV;\r\n#endif\r\n      break;\r\n    case CTOK_PTRSZ:\r\n#if LJ_64\r\n      CTF_INSERT(decl->attr, MSIZEP, cp->ct->size);\r\n#endif\r\n      break;\r\n    default: return;\r\n    }\r\n    cp_next(cp);\r\n  }\r\n}\r\n\r\n/* Parse struct/union/enum name. */\r\nstatic CTypeID cp_struct_name(CPState *cp, CPDecl *sdecl, CTInfo info)\r\n{\r\n  CTypeID sid;\r\n  CType *ct;\r\n  cp->tmask = CPNS_STRUCT;\r\n  cp_next(cp);\r\n  cp_decl_attributes(cp, sdecl);\r\n  cp->tmask = CPNS_DEFAULT;\r\n  if (cp->tok != '{') {\r\n    if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n    if (cp->val.id) {  /* Name of existing struct/union/enum. */\r\n      sid = cp->val.id;\r\n      ct = cp->ct;\r\n      if ((ct->info ^ info) & (CTMASK_NUM|CTF_UNION))  /* Wrong type. */\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(gco2str(gcref(ct->name))));\r\n    } else {  /* Create named, incomplete struct/union/enum. */\r\n      if ((cp->mode & CPARSE_MODE_NOIMPLICIT))\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_BADTAG, strdata(cp->str));\r\n      sid = lj_ctype_new(cp->cts, &ct);\r\n      ct->info = info;\r\n      ct->size = CTSIZE_INVALID;\r\n      ctype_setname(ct, cp->str);\r\n      lj_ctype_addname(cp->cts, ct, sid);\r\n    }\r\n    cp_next(cp);\r\n  } else {  /* Create anonymous, incomplete struct/union/enum. */\r\n    sid = lj_ctype_new(cp->cts, &ct);\r\n    ct->info = info;\r\n    ct->size = CTSIZE_INVALID;\r\n  }\r\n  if (cp->tok == '{') {\r\n    if (ct->size != CTSIZE_INVALID || ct->sib)\r\n      cp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(gco2str(gcref(ct->name))));\r\n    ct->sib = 1;  /* Indicate the type is currently being defined. */\r\n  }\r\n  return sid;\r\n}\r\n\r\n/* Determine field alignment. */\r\nstatic CTSize cp_field_align(CPState *cp, CType *ct, CTInfo info)\r\n{\r\n  CTSize align = ctype_align(info);\r\n  UNUSED(cp); UNUSED(ct);\r\n#if (LJ_TARGET_X86 && !LJ_ABI_WIN) || (LJ_TARGET_ARM && __APPLE__)\r\n  /* The SYSV i386 and iOS ABIs limit alignment of non-vector fields to 2^2. */\r\n  if (align > 2 && !(info & CTFP_ALIGNED)) {\r\n    if (ctype_isarray(info) && !(info & CTF_VECTOR)) {\r\n      do {\r\n\tct = ctype_rawchild(cp->cts, ct);\r\n\tinfo = ct->info;\r\n      } while (ctype_isarray(info) && !(info & CTF_VECTOR));\r\n    }\r\n    if (ctype_isnum(info) || ctype_isenum(info))\r\n      align = 2;\r\n  }\r\n#endif\r\n  return align;\r\n}\r\n\r\n/* Layout struct/union fields. */\r\nstatic void cp_struct_layout(CPState *cp, CTypeID sid, CTInfo sattr)\r\n{\r\n  CTSize bofs = 0, bmaxofs = 0;  /* Bit offset and max. bit offset. */\r\n  CTSize maxalign = ctype_align(sattr);\r\n  CType *sct = ctype_get(cp->cts, sid);\r\n  CTInfo sinfo = sct->info;\r\n  CTypeID fieldid = sct->sib;\r\n  while (fieldid) {\r\n    CType *ct = ctype_get(cp->cts, fieldid);\r\n    CTInfo attr = ct->size;  /* Field declaration attributes (temp.). */\r\n\r\n    if (ctype_isfield(ct->info) ||\r\n\t(ctype_isxattrib(ct->info, CTA_SUBTYPE) && attr)) {\r\n      CTSize align, amask;  /* Alignment (pow2) and alignment mask (bits). */\r\n      CTSize sz;\r\n      CTInfo info = lj_ctype_info(cp->cts, ctype_cid(ct->info), &sz);\r\n      CTSize bsz, csz = 8*sz;  /* Field size and container size (in bits). */\r\n      sinfo |= (info & (CTF_QUAL|CTF_VLA));  /* Merge pseudo-qualifiers. */\r\n\r\n      /* Check for size overflow and determine alignment. */\r\n      if (sz >= 0x20000000u || bofs + csz < bofs || (info & CTF_VLA)) {\r\n\tif (!(sz == CTSIZE_INVALID && ctype_isarray(info) &&\r\n\t      !(sinfo & CTF_UNION)))\r\n\t  cp_err(cp, LJ_ERR_FFI_INVSIZE);\r\n\tcsz = sz = 0;  /* Treat a[] and a[?] as zero-sized. */\r\n      }\r\n      align = cp_field_align(cp, ct, info);\r\n      if (((attr|sattr) & CTFP_PACKED) ||\r\n\t  ((attr & CTFP_ALIGNED) && ctype_align(attr) > align))\r\n\talign = ctype_align(attr);\r\n      if (cp->packstack[cp->curpack] < align)\r\n\talign = cp->packstack[cp->curpack];\r\n      if (align > maxalign) maxalign = align;\r\n      amask = (8u << align) - 1;\r\n\r\n      bsz = ctype_bitcsz(ct->info);  /* Bitfield size (temp.). */\r\n      if (bsz == CTBSZ_FIELD || !ctype_isfield(ct->info)) {\r\n\tbsz = csz;  /* Regular fields or subtypes always fill the container. */\r\n\tbofs = (bofs + amask) & ~amask;  /* Start new aligned field. */\r\n\tct->size = (bofs >> 3);  /* Store field offset. */\r\n      } else {  /* Bitfield. */\r\n\tif (bsz == 0 || (attr & CTFP_ALIGNED) ||\r\n\t    (!((attr|sattr) & CTFP_PACKED) && (bofs & amask) + bsz > csz))\r\n\t  bofs = (bofs + amask) & ~amask;  /* Start new aligned field. */\r\n\r\n\t/* Prefer regular field over bitfield. */\r\n\tif (bsz == csz && (bofs & amask) == 0) {\r\n\t  ct->info = CTINFO(CT_FIELD, ctype_cid(ct->info));\r\n\t  ct->size = (bofs >> 3);  /* Store field offset. */\r\n\t} else {\r\n\t  ct->info = CTINFO(CT_BITFIELD,\r\n\t    (info & (CTF_QUAL|CTF_UNSIGNED|CTF_BOOL)) +\r\n\t    (csz << (CTSHIFT_BITCSZ-3)) + (bsz << CTSHIFT_BITBSZ));\r\n#if LJ_BE\r\n\t  ct->info += ((csz - (bofs & (csz-1)) - bsz) << CTSHIFT_BITPOS);\r\n#else\r\n\t  ct->info += ((bofs & (csz-1)) << CTSHIFT_BITPOS);\r\n#endif\r\n\t  ct->size = ((bofs & ~(csz-1)) >> 3);  /* Store container offset. */\r\n\t}\r\n      }\r\n\r\n      /* Determine next offset or max. offset. */\r\n      if ((sinfo & CTF_UNION)) {\r\n\tif (bsz > bmaxofs) bmaxofs = bsz;\r\n      } else {\r\n\tbofs += bsz;\r\n      }\r\n    }  /* All other fields in the chain are already set up. */\r\n\r\n    fieldid = ct->sib;\r\n  }\r\n\r\n  /* Complete struct/union. */\r\n  sct->info = sinfo + CTALIGN(maxalign);\r\n  bofs = (sinfo & CTF_UNION) ? bmaxofs : bofs;\r\n  maxalign = (8u << maxalign) - 1;\r\n  sct->size = (((bofs + maxalign) & ~maxalign) >> 3);\r\n}\r\n\r\n/* Parse struct/union declaration. */\r\nstatic CTypeID cp_decl_struct(CPState *cp, CPDecl *sdecl, CTInfo sinfo)\r\n{\r\n  CTypeID sid = cp_struct_name(cp, sdecl, sinfo);\r\n  if (cp_opt(cp, '{')) {  /* Struct/union definition. */\r\n    CTypeID lastid = sid;\r\n    int lastdecl = 0;\r\n    while (cp->tok != '}') {\r\n      CPDecl decl;\r\n      CPscl scl = cp_decl_spec(cp, &decl, CDF_STATIC);\r\n      decl.mode = scl ? CPARSE_MODE_DIRECT :\r\n\tCPARSE_MODE_DIRECT|CPARSE_MODE_ABSTRACT|CPARSE_MODE_FIELD;\r\n\r\n      for (;;) {\r\n\tCTypeID ctypeid;\r\n\r\n\tif (lastdecl) cp_err_token(cp, '}');\r\n\r\n\t/* Parse field declarator. */\r\n\tdecl.bits = CTSIZE_INVALID;\r\n\tcp_declarator(cp, &decl);\r\n\tctypeid = cp_decl_intern(cp, &decl);\r\n\r\n\tif ((scl & CDF_STATIC)) {  /* Static constant in struct namespace. */\r\n\t  CType *ct;\r\n\t  CTypeID fieldid = cp_decl_constinit(cp, &ct, ctypeid);\r\n\t  ctype_get(cp->cts, lastid)->sib = fieldid;\r\n\t  lastid = fieldid;\r\n\t  ctype_setname(ct, decl.name);\r\n\t} else {\r\n\t  CTSize bsz = CTBSZ_FIELD;  /* Temp. for layout phase. */\r\n\t  CType *ct;\r\n\t  CTypeID fieldid = lj_ctype_new(cp->cts, &ct);  /* Do this first. */\r\n\t  CType *tct = ctype_raw(cp->cts, ctypeid);\r\n\r\n\t  if (decl.bits == CTSIZE_INVALID) {  /* Regular field. */\r\n\t    if (ctype_isarray(tct->info) && tct->size == CTSIZE_INVALID)\r\n\t      lastdecl = 1;  /* a[] or a[?] must be the last declared field. */\r\n\r\n\t    /* Accept transparent struct/union/enum. */\r\n\t    if (!decl.name) {\r\n\t      if (!((ctype_isstruct(tct->info) && !(tct->info & CTF_VLA)) ||\r\n\t\t    ctype_isenum(tct->info)))\r\n\t\tcp_err_token(cp, CTOK_IDENT);\r\n\t      ct->info = CTINFO(CT_ATTRIB, CTATTRIB(CTA_SUBTYPE) + ctypeid);\r\n\t      ct->size = ctype_isstruct(tct->info) ?\r\n\t\t\t (decl.attr|0x80000000u) : 0;  /* For layout phase. */\r\n\t      goto add_field;\r\n\t    }\r\n\t  } else {  /* Bitfield. */\r\n\t    bsz = decl.bits;\r\n\t    if (!ctype_isinteger_or_bool(tct->info) ||\r\n\t\t(bsz == 0 && decl.name) || 8*tct->size > CTBSZ_MAX ||\r\n\t\tbsz > ((tct->info & CTF_BOOL) ? 1 : 8*tct->size))\r\n\t      cp_errmsg(cp, ':', LJ_ERR_BADVAL);\r\n\t  }\r\n\r\n\t  /* Create temporary field for layout phase. */\r\n\t  ct->info = CTINFO(CT_FIELD, ctypeid + (bsz << CTSHIFT_BITCSZ));\r\n\t  ct->size = decl.attr;\r\n\t  if (decl.name) ctype_setname(ct, decl.name);\r\n\r\n\tadd_field:\r\n\t  ctype_get(cp->cts, lastid)->sib = fieldid;\r\n\t  lastid = fieldid;\r\n\t}\r\n\tif (!cp_opt(cp, ',')) break;\r\n\tcp_decl_reset(&decl);\r\n      }\r\n      cp_check(cp, ';');\r\n    }\r\n    cp_check(cp, '}');\r\n    ctype_get(cp->cts, lastid)->sib = 0;  /* Drop sib = 1 for empty structs. */\r\n    cp_decl_attributes(cp, sdecl);  /* Layout phase needs postfix attributes. */\r\n    cp_struct_layout(cp, sid, sdecl->attr);\r\n  }\r\n  return sid;\r\n}\r\n\r\n/* Parse enum declaration. */\r\nstatic CTypeID cp_decl_enum(CPState *cp, CPDecl *sdecl)\r\n{\r\n  CTypeID eid = cp_struct_name(cp, sdecl, CTINFO(CT_ENUM, CTID_VOID));\r\n  CTInfo einfo = CTINFO(CT_ENUM, CTALIGN(2) + CTID_UINT32);\r\n  CTSize esize = 4;  /* Only 32 bit enums are supported. */\r\n  if (cp_opt(cp, '{')) {  /* Enum definition. */\r\n    CPValue k;\r\n    CTypeID lastid = eid;\r\n    k.u32 = 0;\r\n    k.id = CTID_INT32;\r\n    do {\r\n      GCstr *name = cp->str;\r\n      if (cp->tok != CTOK_IDENT) cp_err_token(cp, CTOK_IDENT);\r\n      if (cp->val.id) cp_errmsg(cp, 0, LJ_ERR_FFI_REDEF, strdata(name));\r\n      cp_next(cp);\r\n      if (cp_opt(cp, '=')) {\r\n\tcp_expr_kint(cp, &k);\r\n\tif (k.id == CTID_UINT32) {\r\n\t  /* C99 says that enum constants are always (signed) integers.\r\n\t  ** But since unsigned constants like 0x80000000 are quite common,\r\n\t  ** those are left as uint32_t.\r\n\t  */\r\n\t  if (k.i32 >= 0) k.id = CTID_INT32;\r\n\t} else {\r\n\t  /* OTOH it's common practice and even mandated by some ABIs\r\n\t  ** that the enum type itself is unsigned, unless there are any\r\n\t  ** negative constants.\r\n\t  */\r\n\t  k.id = CTID_INT32;\r\n\t  if (k.i32 < 0) einfo = CTINFO(CT_ENUM, CTALIGN(2) + CTID_INT32);\r\n\t}\r\n      }\r\n      /* Add named enum constant. */\r\n      {\r\n\tCType *ct;\r\n\tCTypeID constid = lj_ctype_new(cp->cts, &ct);\r\n\tctype_get(cp->cts, lastid)->sib = constid;\r\n\tlastid = constid;\r\n\tctype_setname(ct, name);\r\n\tct->info = CTINFO(CT_CONSTVAL, CTF_CONST|k.id);\r\n\tct->size = k.u32++;\r\n\tif (k.u32 == 0x80000000u) k.id = CTID_UINT32;\r\n\tlj_ctype_addname(cp->cts, ct, constid);\r\n      }\r\n      if (!cp_opt(cp, ',')) break;\r\n    } while (cp->tok != '}');  /* Trailing ',' is ok. */\r\n    cp_check(cp, '}');\r\n    /* Complete enum. */\r\n    ctype_get(cp->cts, eid)->info = einfo;\r\n    ctype_get(cp->cts, eid)->size = esize;\r\n  }\r\n  return eid;\r\n}\r\n\r\n/* Parse declaration specifiers. */\r\nstatic CPscl cp_decl_spec(CPState *cp, CPDecl *decl, CPscl scl)\r\n{\r\n  uint32_t cds = 0, sz = 0;\r\n  CTypeID tdef = 0;\r\n\r\n  decl->cp = cp;\r\n  decl->mode = cp->mode;\r\n  decl->name = NULL;\r\n  decl->redir = NULL;\r\n  decl->attr = 0;\r\n  decl->fattr = 0;\r\n  decl->pos = decl->top = 0;\r\n  decl->stack[0].next = 0;\r\n\r\n  for (;;) {  /* Parse basic types. */\r\n    cp_decl_attributes(cp, decl);\r\n    if (cp->tok >= CTOK_FIRSTDECL && cp->tok <= CTOK_LASTDECLFLAG) {\r\n      uint32_t cbit;\r\n      if (cp->ct->size) {\r\n\tif (sz) goto end_decl;\r\n\tsz = cp->ct->size;\r\n      }\r\n      cbit = (1u << (cp->tok - CTOK_FIRSTDECL));\r\n      cds = cds | cbit | ((cbit & cds & CDF_LONG) << 1);\r\n      if (cp->tok >= CTOK_FIRSTSCL) {\r\n\tif (!(scl & cbit)) cp_errmsg(cp, cp->tok, LJ_ERR_FFI_BADSCL);\r\n      } else if (tdef) {\r\n\tgoto end_decl;\r\n      }\r\n      cp_next(cp);\r\n      continue;\r\n    }\r\n    if (sz || tdef ||\r\n\t(cds & (CDF_SHORT|CDF_LONG|CDF_SIGNED|CDF_UNSIGNED|CDF_COMPLEX)))\r\n      break;\r\n    switch (cp->tok) {\r\n    case CTOK_STRUCT:\r\n      tdef = cp_decl_struct(cp, decl, CTINFO(CT_STRUCT, 0));\r\n      continue;\r\n    case CTOK_UNION:\r\n      tdef = cp_decl_struct(cp, decl, CTINFO(CT_STRUCT, CTF_UNION));\r\n      continue;\r\n    case CTOK_ENUM:\r\n      tdef = cp_decl_enum(cp, decl);\r\n      continue;\r\n    case CTOK_IDENT:\r\n      if (ctype_istypedef(cp->ct->info)) {\r\n\ttdef = ctype_cid(cp->ct->info);  /* Get typedef. */\r\n\tcp_next(cp);\r\n\tcontinue;\r\n      }\r\n      break;\r\n    case '$':\r\n      tdef = cp->val.id;\r\n      cp_next(cp);\r\n      continue;\r\n    default:\r\n      break;\r\n    }\r\n    break;\r\n  }\r\nend_decl:\r\n\r\n  if ((cds & CDF_COMPLEX))  /* Use predefined complex types. */\r\n    tdef = sz == 4 ? CTID_COMPLEX_FLOAT : CTID_COMPLEX_DOUBLE;\r\n\r\n  if (tdef) {\r\n    cp_push_type(decl, tdef);\r\n  } else if ((cds & CDF_VOID)) {\r\n    cp_push(decl, CTINFO(CT_VOID, (decl->attr & CTF_QUAL)), CTSIZE_INVALID);\r\n    decl->attr &= ~CTF_QUAL;\r\n  } else {\r\n    /* Determine type info and size. */\r\n    CTInfo info = CTINFO(CT_NUM, (cds & CDF_UNSIGNED) ? CTF_UNSIGNED : 0);\r\n    if ((cds & CDF_BOOL)) {\r\n      if ((cds & ~(CDF_SCL|CDF_BOOL|CDF_INT|CDF_SIGNED|CDF_UNSIGNED)))\r\n\tcp_errmsg(cp, 0, LJ_ERR_FFI_INVTYPE);\r\n      info |= CTF_BOOL;\r\n      if (!(cds & CDF_SIGNED)) info |= CTF_UNSIGNED;\r\n      if (!sz) {\r\n\tsz = 1;\r\n      }\r\n    } else if ((cds & CDF_FP)) {\r\n      info = CTINFO(CT_NUM, CTF_FP);\r\n      if ((cds & CDF_LONG)) sz = sizeof(long double);\r\n    } else if ((cds & CDF_CHAR)) {\r\n      if ((cds & (CDF_CHAR|CDF_SIGNED|CDF_UNSIGNED)) == CDF_CHAR)\r\n\tinfo |= CTF_UCHAR;  /* Handle platforms where char is unsigned. */\r\n    } else if ((cds & CDF_SHORT)) {\r\n      sz = sizeof(short);\r\n    } else if ((cds & CDF_LONGLONG)) {\r\n      sz = 8;\r\n    } else if ((cds & CDF_LONG)) {\r\n      info |= CTF_LONG;\r\n      sz = sizeof(long);\r\n    } else if (!sz) {\r\n      if (!(cds & (CDF_SIGNED|CDF_UNSIGNED)))\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_FFI_DECLSPEC);\r\n      sz = sizeof(int);\r\n    }\r\n    lua_assert(sz != 0);\r\n    info += CTALIGN(lj_fls(sz));  /* Use natural alignment. */\r\n    info += (decl->attr & CTF_QUAL);  /* Merge qualifiers. */\r\n    cp_push(decl, info, sz);\r\n    decl->attr &= ~CTF_QUAL;\r\n  }\r\n  decl->specpos = decl->pos;\r\n  decl->specattr = decl->attr;\r\n  decl->specfattr = decl->fattr;\r\n  return (cds & CDF_SCL);  /* Return storage class. */\r\n}\r\n\r\n/* Parse array declaration. */\r\nstatic void cp_decl_array(CPState *cp, CPDecl *decl)\r\n{\r\n  CTInfo info = CTINFO(CT_ARRAY, 0);\r\n  CTSize nelem = CTSIZE_INVALID;  /* Default size for a[] or a[?]. */\r\n  cp_decl_attributes(cp, decl);\r\n  if (cp_opt(cp, '?'))\r\n    info |= CTF_VLA;  /* Create variable-length array a[?]. */\r\n  else if (cp->tok != ']')\r\n    nelem = cp_expr_ksize(cp);\r\n  cp_check(cp, ']');\r\n  cp_add(decl, info, nelem);\r\n}\r\n\r\n/* Parse function declaration. */\r\nstatic void cp_decl_func(CPState *cp, CPDecl *fdecl)\r\n{\r\n  CTSize nargs = 0;\r\n  CTInfo info = CTINFO(CT_FUNC, 0);\r\n  CTypeID lastid = 0, anchor = 0;\r\n  if (cp->tok != ')') {\r\n    do {\r\n      CPDecl decl;\r\n      CTypeID ctypeid, fieldid;\r\n      CType *ct;\r\n      if (cp_opt(cp, '.')) {  /* Vararg function. */\r\n\tcp_check(cp, '.');  /* Workaround for the minimalistic lexer. */\r\n\tcp_check(cp, '.');\r\n\tinfo |= CTF_VARARG;\r\n\tbreak;\r\n      }\r\n      cp_decl_spec(cp, &decl, CDF_REGISTER);\r\n      decl.mode = CPARSE_MODE_DIRECT|CPARSE_MODE_ABSTRACT;\r\n      cp_declarator(cp, &decl);\r\n      ctypeid = cp_decl_intern(cp, &decl);\r\n      ct = ctype_raw(cp->cts, ctypeid);\r\n      if (ctype_isvoid(ct->info))\r\n\tbreak;\r\n      else if (ctype_isrefarray(ct->info))\r\n\tctypeid = lj_ctype_intern(cp->cts,\r\n\t  CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ct->info)), CTSIZE_PTR);\r\n      else if (ctype_isfunc(ct->info))\r\n\tctypeid = lj_ctype_intern(cp->cts,\r\n\t  CTINFO(CT_PTR, CTALIGN_PTR|ctypeid), CTSIZE_PTR);\r\n      /* Add new parameter. */\r\n      fieldid = lj_ctype_new(cp->cts, &ct);\r\n      if (anchor)\r\n\tctype_get(cp->cts, lastid)->sib = fieldid;\r\n      else\r\n\tanchor = fieldid;\r\n      lastid = fieldid;\r\n      if (decl.name) ctype_setname(ct, decl.name);\r\n      ct->info = CTINFO(CT_FIELD, ctypeid);\r\n      ct->size = nargs++;\r\n    } while (cp_opt(cp, ','));\r\n  }\r\n  cp_check(cp, ')');\r\n  if (cp_opt(cp, '{')) {  /* Skip function definition. */\r\n    int level = 1;\r\n    cp->mode |= CPARSE_MODE_SKIP;\r\n    for (;;) {\r\n      if (cp->tok == '{') level++;\r\n      else if (cp->tok == '}' && --level == 0) break;\r\n      else if (cp->tok == CTOK_EOF) cp_err_token(cp, '}');\r\n      cp_next(cp);\r\n    }\r\n    cp->mode &= ~CPARSE_MODE_SKIP;\r\n    cp->tok = ';';  /* Ok for cp_decl_multi(), error in cp_decl_single(). */\r\n  }\r\n  info |= (fdecl->fattr & ~CTMASK_CID);\r\n  fdecl->fattr = 0;\r\n  fdecl->stack[cp_add(fdecl, info, nargs)].sib = anchor;\r\n}\r\n\r\n/* Parse declarator. */\r\nstatic void cp_declarator(CPState *cp, CPDecl *decl)\r\n{\r\n  if (++cp->depth > CPARSE_MAX_DECLDEPTH) cp_err(cp, LJ_ERR_XLEVELS);\r\n\r\n  for (;;) {  /* Head of declarator. */\r\n    if (cp_opt(cp, '*')) {  /* Pointer. */\r\n      CTSize sz;\r\n      CTInfo info;\r\n      cp_decl_attributes(cp, decl);\r\n      sz = CTSIZE_PTR;\r\n      info = CTINFO(CT_PTR, CTALIGN_PTR);\r\n#if LJ_64\r\n      if (ctype_msizeP(decl->attr) == 4) {\r\n\tsz = 4;\r\n\tinfo = CTINFO(CT_PTR, CTALIGN(2));\r\n      }\r\n#endif\r\n      info += (decl->attr & (CTF_QUAL|CTF_REF));\r\n      decl->attr &= ~(CTF_QUAL|(CTMASK_MSIZEP<<CTSHIFT_MSIZEP));\r\n      cp_push(decl, info, sz);\r\n    } else if (cp_opt(cp, '&') || cp_opt(cp, CTOK_ANDAND)) {  /* Reference. */\r\n      decl->attr &= ~(CTF_QUAL|(CTMASK_MSIZEP<<CTSHIFT_MSIZEP));\r\n      cp_push(decl, CTINFO_REF(0), CTSIZE_PTR);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n\r\n  if (cp_opt(cp, '(')) {  /* Inner declarator. */\r\n    CPDeclIdx pos;\r\n    cp_decl_attributes(cp, decl);\r\n    /* Resolve ambiguity between inner declarator and 1st function parameter. */\r\n    if ((decl->mode & CPARSE_MODE_ABSTRACT) &&\r\n\t(cp->tok == ')' || cp_istypedecl(cp))) goto func_decl;\r\n    pos = decl->pos;\r\n    cp_declarator(cp, decl);\r\n    cp_check(cp, ')');\r\n    decl->pos = pos;\r\n  } else if (cp->tok == CTOK_IDENT) {  /* Direct declarator. */\r\n    if (!(decl->mode & CPARSE_MODE_DIRECT)) cp_err_token(cp, CTOK_EOF);\r\n    decl->name = cp->str;\r\n    decl->nameid = cp->val.id;\r\n    cp_next(cp);\r\n  } else {  /* Abstract declarator. */\r\n    if (!(decl->mode & CPARSE_MODE_ABSTRACT)) cp_err_token(cp, CTOK_IDENT);\r\n  }\r\n\r\n  for (;;) {  /* Tail of declarator. */\r\n    if (cp_opt(cp, '[')) {  /* Array. */\r\n      cp_decl_array(cp, decl);\r\n    } else if (cp_opt(cp, '(')) {  /* Function. */\r\n    func_decl:\r\n      cp_decl_func(cp, decl);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n\r\n  if ((decl->mode & CPARSE_MODE_FIELD) && cp_opt(cp, ':'))  /* Field width. */\r\n    decl->bits = cp_expr_ksize(cp);\r\n\r\n  /* Process postfix attributes. */\r\n  cp_decl_attributes(cp, decl);\r\n  cp_push_attributes(decl);\r\n\r\n  cp->depth--;\r\n}\r\n\r\n/* Parse an abstract type declaration and return it's C type ID. */\r\nstatic CTypeID cp_decl_abstract(CPState *cp)\r\n{\r\n  CPDecl decl;\r\n  cp_decl_spec(cp, &decl, 0);\r\n  decl.mode = CPARSE_MODE_ABSTRACT;\r\n  cp_declarator(cp, &decl);\r\n  return cp_decl_intern(cp, &decl);\r\n}\r\n\r\n/* Handle pragmas. */\r\nstatic void cp_pragma(CPState *cp, BCLine pragmaline)\r\n{\r\n  cp_next(cp);\r\n  if (cp->tok == CTOK_IDENT &&\r\n      cp->str->hash == H_(e79b999f,42ca3e85))  {  /* pack */\r\n    cp_next(cp);\r\n    cp_check(cp, '(');\r\n    if (cp->tok == CTOK_IDENT) {\r\n      if (cp->str->hash == H_(738e923c,a1b65954)) {  /* push */\r\n\tif (cp->curpack < CPARSE_MAX_PACKSTACK) {\r\n\t  cp->packstack[cp->curpack+1] = cp->packstack[cp->curpack];\r\n\t  cp->curpack++;\r\n\t}\r\n      } else if (cp->str->hash == H_(6c71cf27,6c71cf27)) {  /* pop */\r\n\tif (cp->curpack > 0) cp->curpack--;\r\n      } else {\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n      }\r\n      cp_next(cp);\r\n      if (!cp_opt(cp, ',')) goto end_pack;\r\n    }\r\n    if (cp->tok == CTOK_INTEGER) {\r\n      cp->packstack[cp->curpack] = cp->val.u32 ? lj_fls(cp->val.u32) : 0;\r\n      cp_next(cp);\r\n    } else {\r\n      cp->packstack[cp->curpack] = 255;\r\n    }\r\n  end_pack:\r\n    cp_check(cp, ')');\r\n  } else {  /* Ignore all other pragmas. */\r\n    while (cp->tok != CTOK_EOF && cp->linenumber == pragmaline)\r\n      cp_next(cp);\r\n  }\r\n}\r\n\r\n/* Parse multiple C declarations of types or extern identifiers. */\r\nstatic void cp_decl_multi(CPState *cp)\r\n{\r\n  int first = 1;\r\n  while (cp->tok != CTOK_EOF) {\r\n    CPDecl decl;\r\n    CPscl scl;\r\n    if (cp_opt(cp, ';')) {  /* Skip empty statements. */\r\n      first = 0;\r\n      continue;\r\n    }\r\n    if (cp->tok == '#') {  /* Workaround, since we have no preprocessor, yet. */\r\n      BCLine pragmaline = cp->linenumber;\r\n      if (!(cp_next(cp) == CTOK_IDENT &&\r\n\t    cp->str->hash == H_(f5e6b4f8,1d509107)))  /* pragma */\r\n\tcp_errmsg(cp, cp->tok, LJ_ERR_XSYMBOL);\r\n      cp_pragma(cp, pragmaline);\r\n      continue;\r\n    }\r\n    scl = cp_decl_spec(cp, &decl, CDF_TYPEDEF|CDF_EXTERN|CDF_STATIC);\r\n    if ((cp->tok == ';' || cp->tok == CTOK_EOF) &&\r\n\tctype_istypedef(decl.stack[0].info)) {\r\n      CTInfo info = ctype_rawchild(cp->cts, &decl.stack[0])->info;\r\n      if (ctype_isstruct(info) || ctype_isenum(info))\r\n\tgoto decl_end;  /* Accept empty declaration of struct/union/enum. */\r\n    }\r\n    for (;;) {\r\n      CTypeID ctypeid;\r\n      cp_declarator(cp, &decl);\r\n      ctypeid = cp_decl_intern(cp, &decl);\r\n      if (decl.name && !decl.nameid) {  /* NYI: redeclarations are ignored. */\r\n\tCType *ct;\r\n\tCTypeID id;\r\n\tif ((scl & CDF_TYPEDEF)) {  /* Create new typedef. */\r\n\t  id = lj_ctype_new(cp->cts, &ct);\r\n\t  ct->info = CTINFO(CT_TYPEDEF, ctypeid);\r\n\t  goto noredir;\r\n\t} else if (ctype_isfunc(ctype_get(cp->cts, ctypeid)->info)) {\r\n\t  /* Treat both static and extern function declarations as extern. */\r\n\t  ct = ctype_get(cp->cts, ctypeid);\r\n\t  /* We always get new anonymous functions (typedefs are copied). */\r\n\t  lua_assert(gcref(ct->name) == NULL);\r\n\t  id = ctypeid;  /* Just name it. */\r\n\t} else if ((scl & CDF_STATIC)) {  /* Accept static constants. */\r\n\t  id = cp_decl_constinit(cp, &ct, ctypeid);\r\n\t  goto noredir;\r\n\t} else {  /* External references have extern or no storage class. */\r\n\t  id = lj_ctype_new(cp->cts, &ct);\r\n\t  ct->info = CTINFO(CT_EXTERN, ctypeid);\r\n\t}\r\n\tif (decl.redir) {  /* Add attribute for redirected symbol name. */\r\n\t  CType *cta;\r\n\t  CTypeID aid = lj_ctype_new(cp->cts, &cta);\r\n\t  ct = ctype_get(cp->cts, id);  /* Table may have been reallocated. */\r\n\t  cta->info = CTINFO(CT_ATTRIB, CTATTRIB(CTA_REDIR));\r\n\t  cta->sib = ct->sib;\r\n\t  ct->sib = aid;\r\n\t  ctype_setname(cta, decl.redir);\r\n\t}\r\n      noredir:\r\n\tctype_setname(ct, decl.name);\r\n\tlj_ctype_addname(cp->cts, ct, id);\r\n      }\r\n      if (!cp_opt(cp, ',')) break;\r\n      cp_decl_reset(&decl);\r\n    }\r\n  decl_end:\r\n    if (cp->tok == CTOK_EOF && first) break;  /* May omit ';' for 1 decl. */\r\n    first = 0;\r\n    cp_check(cp, ';');\r\n  }\r\n}\r\n\r\n/* Parse a single C type declaration. */\r\nstatic void cp_decl_single(CPState *cp)\r\n{\r\n  CPDecl decl;\r\n  cp_decl_spec(cp, &decl, 0);\r\n  cp_declarator(cp, &decl);\r\n  cp->val.id = cp_decl_intern(cp, &decl);\r\n  if (cp->tok != CTOK_EOF) cp_err_token(cp, CTOK_EOF);\r\n}\r\n\r\n#undef H_\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Protected callback for C parser. */\r\nstatic TValue *cpcparser(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  CPState *cp = (CPState *)ud;\r\n  UNUSED(dummy);\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  cp_init(cp);\r\n  if ((cp->mode & CPARSE_MODE_MULTI))\r\n    cp_decl_multi(cp);\r\n  else\r\n    cp_decl_single(cp);\r\n  if (cp->param && cp->param != cp->L->top)\r\n    cp_err(cp, LJ_ERR_FFI_NUMPARAM);\r\n  lua_assert(cp->depth == 0);\r\n  return NULL;\r\n}\r\n\r\n/* C parser. */\r\nint lj_cparse(CPState *cp)\r\n{\r\n  LJ_CTYPE_SAVE(cp->cts);\r\n  int errcode = lj_vm_cpcall(cp->L, NULL, cp, cpcparser);\r\n  if (errcode)\r\n    LJ_CTYPE_RESTORE(cp->cts);\r\n  cp_cleanup(cp);\r\n  return errcode;\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_cparse.h",
    "content": "/*\r\n** C declaration parser.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CPARSE_H\r\n#define _LJ_CPARSE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ctype.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* C parser limits. */\r\n#define CPARSE_MAX_BUF\t\t32768\t/* Max. token buffer size. */\r\n#define CPARSE_MAX_DECLSTACK\t100\t/* Max. declaration stack depth. */\r\n#define CPARSE_MAX_DECLDEPTH\t20\t/* Max. recursive declaration depth. */\r\n#define CPARSE_MAX_PACKSTACK\t7\t/* Max. pack pragma stack depth. */\r\n\r\n/* Flags for C parser mode. */\r\n#define CPARSE_MODE_MULTI\t1\t/* Process multiple declarations. */\r\n#define CPARSE_MODE_ABSTRACT\t2\t/* Accept abstract declarators. */\r\n#define CPARSE_MODE_DIRECT\t4\t/* Accept direct declarators. */\r\n#define CPARSE_MODE_FIELD\t8\t/* Accept field width in bits, too. */\r\n#define CPARSE_MODE_NOIMPLICIT\t16\t/* Reject implicit declarations. */\r\n#define CPARSE_MODE_SKIP\t32\t/* Skip definitions, ignore errors. */\r\n\r\ntypedef int CPChar;\t/* C parser character. Unsigned ext. from char. */\r\ntypedef int CPToken;\t/* C parser token. */\r\n\r\n/* C parser internal value representation. */\r\ntypedef struct CPValue {\r\n  union {\r\n    int32_t i32;\t/* Value for CTID_INT32. */\r\n    uint32_t u32;\t/* Value for CTID_UINT32. */\r\n  };\r\n  CTypeID id;\t\t/* C Type ID of the value. */\r\n} CPValue;\r\n\r\n/* C parser state. */\r\ntypedef struct CPState {\r\n  CPChar c;\t\t/* Current character. */\r\n  CPToken tok;\t\t/* Current token. */\r\n  CPValue val;\t\t/* Token value. */\r\n  GCstr *str;\t\t/* Interned string of identifier/keyword. */\r\n  CType *ct;\t\t/* C type table entry. */\r\n  const char *p;\t/* Current position in input buffer. */\r\n  SBuf sb;\t\t/* String buffer for tokens. */\r\n  lua_State *L;\t\t/* Lua state. */\r\n  CTState *cts;\t\t/* C type state. */\r\n  TValue *param;\t/* C type parameters. */\r\n  const char *srcname;\t/* Current source name. */\r\n  BCLine linenumber;\t/* Input line counter. */\r\n  int depth;\t\t/* Recursive declaration depth. */\r\n  uint32_t tmask;\t/* Type mask for next identifier. */\r\n  uint32_t mode;\t/* C parser mode. */\r\n  uint8_t packstack[CPARSE_MAX_PACKSTACK];  /* Stack for pack pragmas. */\r\n  uint8_t curpack;\t/* Current position in pack pragma stack. */\r\n} CPState;\r\n\r\nLJ_FUNC int lj_cparse(CPState *cp);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_crecord.c",
    "content": "/*\r\n** Trace recorder for C data operations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ffrecord_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT && LJ_HASFFI\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_cparse.h\"\r\n#include \"lj_cconv.h\"\r\n#include \"lj_carith.h\"\r\n#include \"lj_clib.h\"\r\n#include \"lj_ccall.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_crecord.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n#define emitconv(a, dt, st, flags) \\\r\n  emitir(IRT(IR_CONV, (dt)), (a), (st)|((dt) << 5)|(flags))\r\n\r\n/* -- C type checks ------------------------------------------------------- */\r\n\r\nstatic GCcdata *argv2cdata(jit_State *J, TRef tr, cTValue *o)\r\n{\r\n  GCcdata *cd;\r\n  TRef trtypeid;\r\n  if (!tref_iscdata(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  cd = cdataV(o);\r\n  /* Specialize to the CTypeID. */\r\n  trtypeid = emitir(IRT(IR_FLOAD, IRT_U16), tr, IRFL_CDATA_CTYPEID);\r\n  emitir(IRTG(IR_EQ, IRT_INT), trtypeid, lj_ir_kint(J, (int32_t)cd->ctypeid));\r\n  return cd;\r\n}\r\n\r\n/* Specialize to the CTypeID held by a cdata constructor. */\r\nstatic CTypeID crec_constructor(jit_State *J, GCcdata *cd, TRef tr)\r\n{\r\n  CTypeID id;\r\n  lua_assert(tref_iscdata(tr) && cd->ctypeid == CTID_CTYPEID);\r\n  id = *(CTypeID *)cdataptr(cd);\r\n  tr = emitir(IRT(IR_FLOAD, IRT_INT), tr, IRFL_CDATA_INT);\r\n  emitir(IRTG(IR_EQ, IRT_INT), tr, lj_ir_kint(J, (int32_t)id));\r\n  return id;\r\n}\r\n\r\nstatic CTypeID argv2ctype(jit_State *J, TRef tr, cTValue *o)\r\n{\r\n  if (tref_isstr(tr)) {\r\n    GCstr *s = strV(o);\r\n    CPState cp;\r\n    CTypeID oldtop;\r\n    /* Specialize to the string containing the C type declaration. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, s));\r\n    cp.L = J->L;\r\n    cp.cts = ctype_ctsG(J2G(J));\r\n    oldtop = cp.cts->top;\r\n    cp.srcname = strdata(s);\r\n    cp.p = strdata(s);\r\n    cp.param = NULL;\r\n    cp.mode = CPARSE_MODE_ABSTRACT|CPARSE_MODE_NOIMPLICIT;\r\n    if (lj_cparse(&cp) || cp.cts->top > oldtop)  /* Avoid new struct defs. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    return cp.val.id;\r\n  } else {\r\n    GCcdata *cd = argv2cdata(J, tr, o);\r\n    return cd->ctypeid == CTID_CTYPEID ? crec_constructor(J, cd, tr) :\r\n\t\t\t\t\tcd->ctypeid;\r\n  }\r\n}\r\n\r\n/* Convert CType to IRType (if possible). */\r\nstatic IRType crec_ct2irt(CTState *cts, CType *ct)\r\n{\r\n  if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n  if (LJ_LIKELY(ctype_isnum(ct->info))) {\r\n    if ((ct->info & CTF_FP)) {\r\n      if (ct->size == sizeof(double))\r\n\treturn IRT_NUM;\r\n      else if (ct->size == sizeof(float))\r\n\treturn IRT_FLOAT;\r\n    } else {\r\n      uint32_t b = lj_fls(ct->size);\r\n      if (b <= 3)\r\n\treturn IRT_I8 + 2*b + ((ct->info & CTF_UNSIGNED) ? 1 : 0);\r\n    }\r\n  } else if (ctype_isptr(ct->info)) {\r\n    return (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n  } else if (ctype_iscomplex(ct->info)) {\r\n    if (ct->size == 2*sizeof(double))\r\n      return IRT_NUM;\r\n    else if (ct->size == 2*sizeof(float))\r\n      return IRT_FLOAT;\r\n  }\r\n  return IRT_CDATA;\r\n}\r\n\r\n/* -- Optimized memory fill and copy -------------------------------------- */\r\n\r\n/* Maximum length and unroll of inlined copy/fill. */\r\n#define CREC_COPY_MAXUNROLL\t\t16\r\n#define CREC_COPY_MAXLEN\t\t128\r\n\r\n#define CREC_FILL_MAXUNROLL\t\t16\r\n\r\n/* Number of windowed registers used for optimized memory copy. */\r\n#if LJ_TARGET_X86\r\n#define CREC_COPY_REGWIN\t\t2\r\n#elif LJ_TARGET_PPC || LJ_TARGET_MIPS\r\n#define CREC_COPY_REGWIN\t\t8\r\n#else\r\n#define CREC_COPY_REGWIN\t\t4\r\n#endif\r\n\r\n/* List of memory offsets for copy/fill. */\r\ntypedef struct CRecMemList {\r\n  CTSize ofs;\t\t/* Offset in bytes. */\r\n  IRType tp;\t\t/* Type of load/store. */\r\n  TRef trofs;\t\t/* TRef of interned offset. */\r\n  TRef trval;\t\t/* TRef of load value. */\r\n} CRecMemList;\r\n\r\n/* Generate copy list for element-wise struct copy. */\r\nstatic MSize crec_copy_struct(CRecMemList *ml, CTState *cts, CType *ct)\r\n{\r\n  CTypeID fid = ct->sib;\r\n  MSize mlp = 0;\r\n  while (fid) {\r\n    CType *df = ctype_get(cts, fid);\r\n    fid = df->sib;\r\n    if (ctype_isfield(df->info)) {\r\n      CType *cct;\r\n      IRType tp;\r\n      if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n      cct = ctype_rawchild(cts, df);  /* Field type. */\r\n      tp = crec_ct2irt(cts, cct);\r\n      if (tp == IRT_CDATA) return 0;  /* NYI: aggregates. */\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = df->size;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      if (ctype_iscomplex(cct->info)) {\r\n\tif (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n\tml[mlp].ofs = df->size + (cct->size >> 1);\r\n\tml[mlp].tp = tp;\r\n\tmlp++;\r\n      }\r\n    } else if (!ctype_isconstval(df->info)) {\r\n      /* NYI: bitfields and sub-structures. */\r\n      return 0;\r\n    }\r\n  }\r\n  return mlp;\r\n}\r\n\r\n/* Generate unrolled copy list, from highest to lowest step size/alignment. */\r\nstatic MSize crec_copy_unroll(CRecMemList *ml, CTSize len, CTSize step,\r\n\t\t\t      IRType tp)\r\n{\r\n  CTSize ofs = 0;\r\n  MSize mlp = 0;\r\n  if (tp == IRT_CDATA) tp = IRT_U8 + 2*lj_fls(step);\r\n  do {\r\n    while (ofs + step <= len) {\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = ofs;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      ofs += step;\r\n    }\r\n    step >>= 1;\r\n    tp -= 2;\r\n  } while (ofs < len);\r\n  return mlp;\r\n}\r\n\r\n/*\r\n** Emit copy list with windowed loads/stores.\r\n** LJ_TARGET_UNALIGNED: may emit unaligned loads/stores (not marked as such).\r\n*/\r\nstatic void crec_copy_emit(jit_State *J, CRecMemList *ml, MSize mlp,\r\n\t\t\t   TRef trdst, TRef trsrc)\r\n{\r\n  MSize i, j, rwin = 0;\r\n  for (i = 0, j = 0; i < mlp; ) {\r\n    TRef trofs = lj_ir_kintp(J, ml[i].ofs);\r\n    TRef trsptr = emitir(IRT(IR_ADD, IRT_PTR), trsrc, trofs);\r\n    ml[i].trval = emitir(IRT(IR_XLOAD, ml[i].tp), trsptr, 0);\r\n    ml[i].trofs = trofs;\r\n    i++;\r\n    rwin += (LJ_SOFTFP && ml[i].tp == IRT_NUM) ? 2 : 1;\r\n    if (rwin >= CREC_COPY_REGWIN || i >= mlp) {  /* Flush buffered stores. */\r\n      rwin = 0;\r\n      for ( ; j < i; j++) {\r\n\tTRef trdptr = emitir(IRT(IR_ADD, IRT_PTR), trdst, ml[j].trofs);\r\n\temitir(IRT(IR_XSTORE, ml[j].tp), trdptr, ml[j].trval);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Optimized memory copy. */\r\nstatic void crec_copy(jit_State *J, TRef trdst, TRef trsrc, TRef trlen,\r\n\t\t      CType *ct)\r\n{\r\n  if (tref_isk(trlen)) {  /* Length must be constant. */\r\n    CRecMemList ml[CREC_COPY_MAXUNROLL];\r\n    MSize mlp = 0;\r\n    CTSize step = 1, len = (CTSize)IR(tref_ref(trlen))->i;\r\n    IRType tp = IRT_CDATA;\r\n    int needxbar = 0;\r\n    if (len == 0) return;  /* Shortcut. */\r\n    if (len > CREC_COPY_MAXLEN) goto fallback;\r\n    if (ct) {\r\n      CTState *cts = ctype_ctsG(J2G(J));\r\n      lua_assert(ctype_isarray(ct->info) || ctype_isstruct(ct->info));\r\n      if (ctype_isarray(ct->info)) {\r\n\tCType *cct = ctype_rawchild(cts, ct);\r\n\ttp = crec_ct2irt(cts, cct);\r\n\tif (tp == IRT_CDATA) goto rawcopy;\r\n\tstep = lj_ir_type_size[tp];\r\n\tlua_assert((len & (step-1)) == 0);\r\n      } else if ((ct->info & CTF_UNION)) {\r\n\tstep = (1u << ctype_align(ct->info));\r\n\tgoto rawcopy;\r\n      } else {\r\n\tmlp = crec_copy_struct(ml, cts, ct);\r\n\tgoto emitcopy;\r\n      }\r\n    } else {\r\n    rawcopy:\r\n      needxbar = 1;\r\n      if (LJ_TARGET_UNALIGNED || step >= CTSIZE_PTR)\r\n\tstep = CTSIZE_PTR;\r\n    }\r\n    mlp = crec_copy_unroll(ml, len, step, tp);\r\n  emitcopy:\r\n    if (mlp) {\r\n      crec_copy_emit(J, ml, mlp, trdst, trsrc);\r\n      if (needxbar)\r\n\temitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n      return;\r\n    }\r\n  }\r\nfallback:\r\n  /* Call memcpy. Always needs a barrier to disable alias analysis. */\r\n  lj_ir_call(J, IRCALL_memcpy, trdst, trsrc, trlen);\r\n  emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* Generate unrolled fill list, from highest to lowest step size/alignment. */\r\nstatic MSize crec_fill_unroll(CRecMemList *ml, CTSize len, CTSize step)\r\n{\r\n  CTSize ofs = 0;\r\n  MSize mlp = 0;\r\n  IRType tp = IRT_U8 + 2*lj_fls(step);\r\n  do {\r\n    while (ofs + step <= len) {\r\n      if (mlp >= CREC_COPY_MAXUNROLL) return 0;\r\n      ml[mlp].ofs = ofs;\r\n      ml[mlp].tp = tp;\r\n      mlp++;\r\n      ofs += step;\r\n    }\r\n    step >>= 1;\r\n    tp -= 2;\r\n  } while (ofs < len);\r\n  return mlp;\r\n}\r\n\r\n/*\r\n** Emit stores for fill list.\r\n** LJ_TARGET_UNALIGNED: may emit unaligned stores (not marked as such).\r\n*/\r\nstatic void crec_fill_emit(jit_State *J, CRecMemList *ml, MSize mlp,\r\n\t\t\t   TRef trdst, TRef trfill)\r\n{\r\n  MSize i;\r\n  for (i = 0; i < mlp; i++) {\r\n    TRef trofs = lj_ir_kintp(J, ml[i].ofs);\r\n    TRef trdptr = emitir(IRT(IR_ADD, IRT_PTR), trdst, trofs);\r\n    emitir(IRT(IR_XSTORE, ml[i].tp), trdptr, trfill);\r\n  }\r\n}\r\n\r\n/* Optimized memory fill. */\r\nstatic void crec_fill(jit_State *J, TRef trdst, TRef trlen, TRef trfill,\r\n\t\t      CTSize step)\r\n{\r\n  if (tref_isk(trlen)) {  /* Length must be constant. */\r\n    CRecMemList ml[CREC_FILL_MAXUNROLL];\r\n    MSize mlp;\r\n    CTSize len = (CTSize)IR(tref_ref(trlen))->i;\r\n    if (len == 0) return;  /* Shortcut. */\r\n    if (LJ_TARGET_UNALIGNED || step >= CTSIZE_PTR)\r\n      step = CTSIZE_PTR;\r\n    if (step * CREC_FILL_MAXUNROLL < len) goto fallback;\r\n    mlp = crec_fill_unroll(ml, len, step);\r\n    if (!mlp) goto fallback;\r\n    if (tref_isk(trfill) || ml[0].tp != IRT_U8)\r\n      trfill = emitconv(trfill, IRT_INT, IRT_U8, 0);\r\n    if (ml[0].tp != IRT_U8) {  /* Scatter U8 to U16/U32/U64. */\r\n      if (CTSIZE_PTR == 8 && ml[0].tp == IRT_U64) {\r\n\tif (tref_isk(trfill))  /* Pointless on x64 with zero-extended regs. */\r\n\t  trfill = emitconv(trfill, IRT_U64, IRT_U32, 0);\r\n\ttrfill = emitir(IRT(IR_MUL, IRT_U64), trfill,\r\n\t\t\tlj_ir_kint64(J, U64x(01010101,01010101)));\r\n      } else {\r\n\ttrfill = emitir(IRTI(IR_MUL), trfill,\r\n\t\t   lj_ir_kint(J, ml[0].tp == IRT_U16 ? 0x0101 : 0x01010101));\r\n      }\r\n    }\r\n    crec_fill_emit(J, ml, mlp, trdst, trfill);\r\n  } else {\r\nfallback:\r\n    /* Call memset. Always needs a barrier to disable alias analysis. */\r\n    lj_ir_call(J, IRCALL_memset, trdst, trfill, trlen);  /* Note: arg order! */\r\n  }\r\n  emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* -- Convert C type to C type -------------------------------------------- */\r\n\r\n/*\r\n** This code mirrors the code in lj_cconv.c. It performs the same steps\r\n** for the trace recorder that lj_cconv.c does for the interpreter.\r\n**\r\n** One major difference is that we can get away with much fewer checks\r\n** here. E.g. checks for casts, constness or correct types can often be\r\n** omitted, even if they might fail. The interpreter subsequently throws\r\n** an error, which aborts the trace.\r\n**\r\n** All operations are specialized to their C types, so the on-trace\r\n** outcome must be the same as the outcome in the interpreter. If the\r\n** interpreter doesn't throw an error, then the trace is correct, too.\r\n** Care must be taken not to generate invalid (temporary) IR or to\r\n** trigger asserts.\r\n*/\r\n\r\n/* Determine whether a passed number or cdata number is non-zero. */\r\nstatic int crec_isnonzero(CType *s, void *p)\r\n{\r\n  if (p == (void *)0)\r\n    return 0;\r\n  if (p == (void *)1)\r\n    return 1;\r\n  if ((s->info & CTF_FP)) {\r\n    if (s->size == sizeof(float))\r\n      return (*(float *)p != 0);\r\n    else\r\n      return (*(double *)p != 0);\r\n  } else {\r\n    if (s->size == 1)\r\n      return (*(uint8_t *)p != 0);\r\n    else if (s->size == 2)\r\n      return (*(uint16_t *)p != 0);\r\n    else if (s->size == 4)\r\n      return (*(uint32_t *)p != 0);\r\n    else\r\n      return (*(uint64_t *)p != 0);\r\n  }\r\n}\r\n\r\nstatic TRef crec_ct_ct(jit_State *J, CType *d, CType *s, TRef dp, TRef sp,\r\n\t\t       void *svisnz)\r\n{\r\n  IRType dt = crec_ct2irt(ctype_ctsG(J2G(J)), d);\r\n  IRType st = crec_ct2irt(ctype_ctsG(J2G(J)), s);\r\n  CTSize dsize = d->size, ssize = s->size;\r\n  CTInfo dinfo = d->info, sinfo = s->info;\r\n\r\n  if (ctype_type(dinfo) > CT_MAYCONVERT || ctype_type(sinfo) > CT_MAYCONVERT)\r\n    goto err_conv;\r\n\r\n  /*\r\n  ** Note: Unlike lj_cconv_ct_ct(), sp holds the _value_ of pointers and\r\n  ** numbers up to 8 bytes. Otherwise sp holds a pointer.\r\n  */\r\n\r\n  switch (cconv_idx2(dinfo, sinfo)) {\r\n  /* Destination is a bool. */\r\n  case CCX(B, B):\r\n    goto xstore;  /* Source operand is already normalized. */\r\n  case CCX(B, I):\r\n  case CCX(B, F):\r\n    if (st != IRT_CDATA) {\r\n      /* Specialize to the result of a comparison against 0. */\r\n      TRef zero = (st == IRT_NUM  || st == IRT_FLOAT) ? lj_ir_knum(J, 0) :\r\n\t\t  (st == IRT_I64 || st == IRT_U64) ? lj_ir_kint64(J, 0) :\r\n\t\t  lj_ir_kint(J, 0);\r\n      int isnz = crec_isnonzero(s, svisnz);\r\n      emitir(IRTG(isnz ? IR_NE : IR_EQ, st), sp, zero);\r\n      sp = lj_ir_kint(J, isnz);\r\n      goto xstore;\r\n    }\r\n    goto err_nyi;\r\n\r\n  /* Destination is an integer. */\r\n  case CCX(I, B):\r\n  case CCX(I, I):\r\n  conv_I_I:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    /* Extend 32 to 64 bit integer. */\r\n    if (dsize == 8 && ssize < 8 && !(LJ_64 && (sinfo & CTF_UNSIGNED)))\r\n      sp = emitconv(sp, dt, ssize < 4 ? IRT_INT : st,\r\n\t\t    (sinfo & CTF_UNSIGNED) ? 0 : IRCONV_SEXT);\r\n    else if (dsize < 8 && ssize == 8)  /* Truncate from 64 bit integer. */\r\n      sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, st, 0);\r\n    else if (st == IRT_INT)\r\n      sp = lj_opt_narrow_toint(J, sp);\r\n  xstore:\r\n    if (dt == IRT_I64 || dt == IRT_U64) lj_needsplit(J);\r\n    if (dp == 0) return sp;\r\n    emitir(IRT(IR_XSTORE, dt), dp, sp);\r\n    break;\r\n  case CCX(I, C):\r\n    sp = emitir(IRT(IR_XLOAD, st), sp, 0);  /* Load re. */\r\n    /* fallthrough */\r\n  case CCX(I, F):\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, st, IRCONV_ANY);\r\n    goto xstore;\r\n  case CCX(I, P):\r\n  case CCX(I, A):\r\n    sinfo = CTINFO(CT_NUM, CTF_UNSIGNED);\r\n    ssize = CTSIZE_PTR;\r\n    st = IRT_UINTP;\r\n    if (((dsize ^ ssize) & 8) == 0) {  /* Must insert no-op type conversion. */\r\n      sp = emitconv(sp, dsize < 4 ? IRT_INT : dt, IRT_PTR, 0);\r\n      goto xstore;\r\n    }\r\n    goto conv_I_I;\r\n\r\n  /* Destination is a floating-point number. */\r\n  case CCX(F, B):\r\n  case CCX(F, I):\r\n  conv_F_I:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    sp = emitconv(sp, dt, ssize < 4 ? IRT_INT : st, 0);\r\n    goto xstore;\r\n  case CCX(F, C):\r\n    sp = emitir(IRT(IR_XLOAD, st), sp, 0);  /* Load re. */\r\n    /* fallthrough */\r\n  case CCX(F, F):\r\n  conv_F_F:\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    if (dt != st) sp = emitconv(sp, dt, st, 0);\r\n    goto xstore;\r\n\r\n  /* Destination is a complex number. */\r\n  case CCX(C, I):\r\n  case CCX(C, F):\r\n    {  /* Clear im. */\r\n      TRef ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, (dsize >> 1)));\r\n      emitir(IRT(IR_XSTORE, dt), ptr, lj_ir_knum(J, 0));\r\n    }\r\n    /* Convert to re. */\r\n    if ((sinfo & CTF_FP)) goto conv_F_F; else goto conv_F_I;\r\n\r\n  case CCX(C, C):\r\n    if (dt == IRT_CDATA || st == IRT_CDATA) goto err_nyi;\r\n    {\r\n      TRef re, im, ptr;\r\n      re = emitir(IRT(IR_XLOAD, st), sp, 0);\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, (ssize >> 1)));\r\n      im = emitir(IRT(IR_XLOAD, st), ptr, 0);\r\n      if (dt != st) {\r\n\tre = emitconv(re, dt, st, 0);\r\n\tim = emitconv(im, dt, st, 0);\r\n      }\r\n      emitir(IRT(IR_XSTORE, dt), dp, re);\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, (dsize >> 1)));\r\n      emitir(IRT(IR_XSTORE, dt), ptr, im);\r\n    }\r\n    break;\r\n\r\n  /* Destination is a vector. */\r\n  case CCX(V, I):\r\n  case CCX(V, F):\r\n  case CCX(V, C):\r\n  case CCX(V, V):\r\n    goto err_nyi;\r\n\r\n  /* Destination is a pointer. */\r\n  case CCX(P, P):\r\n  case CCX(P, A):\r\n  case CCX(P, S):\r\n    /* There are only 32 bit pointers/addresses on 32 bit machines.\r\n    ** Also ok on x64, since all 32 bit ops clear the upper part of the reg.\r\n    */\r\n    goto xstore;\r\n  case CCX(P, I):\r\n    if (st == IRT_CDATA) goto err_nyi;\r\n    if (!LJ_64 && ssize == 8)  /* Truncate from 64 bit integer. */\r\n      sp = emitconv(sp, IRT_U32, st, 0);\r\n    goto xstore;\r\n  case CCX(P, F):\r\n    if (st == IRT_CDATA) goto err_nyi;\r\n    /* The signed conversion is cheaper. x64 really has 47 bit pointers. */\r\n    sp = emitconv(sp, (LJ_64 && dsize == 8) ? IRT_I64 : IRT_U32,\r\n\t\t  st, IRCONV_ANY);\r\n    goto xstore;\r\n\r\n  /* Destination is an array. */\r\n  case CCX(A, A):\r\n  /* Destination is a struct/union. */\r\n  case CCX(S, S):\r\n    if (dp == 0) goto err_conv;\r\n    crec_copy(J, dp, sp, lj_ir_kint(J, dsize), d);\r\n    break;\r\n\r\n  default:\r\n  err_conv:\r\n  err_nyi:\r\n    lj_trace_err(J, LJ_TRERR_NYICONV);\r\n    break;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* -- Convert C type to TValue (load) ------------------------------------- */\r\n\r\nstatic TRef crec_tv_ct(jit_State *J, CType *s, CTypeID sid, TRef sp)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  IRType t = crec_ct2irt(cts, s);\r\n  CTInfo sinfo = s->info;\r\n  if (ctype_isnum(sinfo)) {\r\n    TRef tr;\r\n    if (t == IRT_CDATA)\r\n      goto err_nyi;  /* NYI: copyval of >64 bit integers. */\r\n    tr = emitir(IRT(IR_XLOAD, t), sp, 0);\r\n    if (t == IRT_FLOAT || t == IRT_U32) {  /* Keep uint32_t/float as numbers. */\r\n      return emitconv(tr, IRT_NUM, t, 0);\r\n    } else if (t == IRT_I64 || t == IRT_U64) {  /* Box 64 bit integer. */\r\n      sp = tr;\r\n      lj_needsplit(J);\r\n    } else if ((sinfo & CTF_BOOL)) {\r\n      /* Assume not equal to zero. Fixup and emit pending guard later. */\r\n      lj_ir_set(J, IRTGI(IR_NE), tr, lj_ir_kint(J, 0));\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      return tr;\r\n    }\r\n  } else if (ctype_isptr(sinfo) || ctype_isenum(sinfo)) {\r\n    sp = emitir(IRT(IR_XLOAD, t), sp, 0);  /* Box pointers and enums. */\r\n  } else if (ctype_isrefarray(sinfo) || ctype_isstruct(sinfo)) {\r\n    cts->L = J->L;\r\n    sid = lj_ctype_intern(cts, CTINFO_REF(sid), CTSIZE_PTR);  /* Create ref. */\r\n  } else if (ctype_iscomplex(sinfo)) {  /* Unbox/box complex. */\r\n    ptrdiff_t esz = (ptrdiff_t)(s->size >> 1);\r\n    TRef ptr, tr1, tr2, dp;\r\n    dp = emitir(IRTG(IR_CNEW, IRT_CDATA), lj_ir_kint(J, sid), TREF_NIL);\r\n    tr1 = emitir(IRT(IR_XLOAD, t), sp, 0);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, esz));\r\n    tr2 = emitir(IRT(IR_XLOAD, t), ptr, 0);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, sizeof(GCcdata)));\r\n    emitir(IRT(IR_XSTORE, t), ptr, tr1);\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), dp, lj_ir_kintp(J, sizeof(GCcdata)+esz));\r\n    emitir(IRT(IR_XSTORE, t), ptr, tr2);\r\n    return dp;\r\n  } else {\r\n    /* NYI: copyval of vectors. */\r\n  err_nyi:\r\n    lj_trace_err(J, LJ_TRERR_NYICONV);\r\n  }\r\n  /* Box pointer, ref, enum or 64 bit integer. */\r\n  return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, sid), sp);\r\n}\r\n\r\n/* -- Convert TValue to C type (store) ------------------------------------ */\r\n\r\nstatic TRef crec_ct_tv(jit_State *J, CType *d, TRef dp, TRef sp, cTValue *sval)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID sid = CTID_P_VOID;\r\n  void *svisnz = 0;\r\n  CType *s;\r\n  if (LJ_LIKELY(tref_isinteger(sp))) {\r\n    sid = CTID_INT32;\r\n    svisnz = (void *)(intptr_t)(tvisint(sval)?(intV(sval)!=0):!tviszero(sval));\r\n  } else if (tref_isnum(sp)) {\r\n    sid = CTID_DOUBLE;\r\n    svisnz = (void *)(intptr_t)(tvisint(sval)?(intV(sval)!=0):!tviszero(sval));\r\n  } else if (tref_isbool(sp)) {\r\n    sp = lj_ir_kint(J, tref_istrue(sp) ? 1 : 0);\r\n    sid = CTID_BOOL;\r\n  } else if (tref_isnil(sp)) {\r\n    sp = lj_ir_kptr(J, NULL);\r\n  } else if (tref_isudata(sp)) {\r\n    GCudata *ud = udataV(sval);\r\n    if (ud->udtype == UDTYPE_IO_FILE) {\r\n      TRef tr = emitir(IRT(IR_FLOAD, IRT_U8), sp, IRFL_UDATA_UDTYPE);\r\n      emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, UDTYPE_IO_FILE));\r\n      sp = emitir(IRT(IR_FLOAD, IRT_PTR), sp, IRFL_UDATA_FILE);\r\n    } else {\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCudata)));\r\n    }\r\n  } else if (tref_isstr(sp)) {\r\n    if (ctype_isenum(d->info)) {  /* Match string against enum constant. */\r\n      GCstr *str = strV(sval);\r\n      CTSize ofs;\r\n      CType *cct = lj_ctype_getfield(cts, d, str, &ofs);\r\n      /* Specialize to the name of the enum constant. */\r\n      emitir(IRTG(IR_EQ, IRT_STR), sp, lj_ir_kstr(J, str));\r\n      if (cct && ctype_isconstval(cct->info)) {\r\n\tlua_assert(ctype_child(cts, cct)->size == 4);\r\n\tsvisnz = (void *)(intptr_t)(ofs != 0);\r\n\tsp = lj_ir_kint(J, (int32_t)ofs);\r\n\tsid = ctype_cid(cct->info);\r\n      }  /* else: interpreter will throw. */\r\n    } else if (ctype_isrefarray(d->info)) {  /* Copy string to array. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);  /* NYI */\r\n    } else {  /* Otherwise pass the string data as a const char[]. */\r\n      /* Don't use STRREF. It folds with SNEW, which loses the trailing NUL. */\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCstr)));\r\n      sid = CTID_A_CCHAR;\r\n    }\r\n  } else if (tref_islightud(sp)) {\r\n#if LJ_64\r\n    sp = emitir(IRT(IR_BAND, IRT_P64), sp,\r\n\t\tlj_ir_kint64(J, U64x(00007fff,ffffffff)));\r\n#endif\r\n  } else {  /* NYI: tref_istab(sp). */\r\n    IRType t;\r\n    sid = argv2cdata(J, sp, sval)->ctypeid;\r\n    s = ctype_raw(cts, sid);\r\n    svisnz = cdataptr(cdataV(sval));\r\n    if (ctype_isfunc(s->info)) {\r\n      sid = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|sid), CTSIZE_PTR);\r\n      s = ctype_get(cts, sid);\r\n      t = IRT_PTR;\r\n    } else {\r\n      t = crec_ct2irt(cts, s);\r\n    }\r\n    if (ctype_isptr(s->info)) {\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_PTR);\r\n      if (ctype_isref(s->info)) {\r\n\tsvisnz = *(void **)svisnz;\r\n\ts = ctype_rawchild(cts, s);\r\n\tif (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n\tt = crec_ct2irt(cts, s);\r\n      } else {\r\n\tgoto doconv;\r\n      }\r\n    } else if (t == IRT_I64 || t == IRT_U64) {\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_INT64);\r\n      lj_needsplit(J);\r\n      goto doconv;\r\n    } else if (t == IRT_INT || t == IRT_U32) {\r\n      if (ctype_isenum(s->info)) s = ctype_child(cts, s);\r\n      sp = emitir(IRT(IR_FLOAD, t), sp, IRFL_CDATA_INT);\r\n      goto doconv;\r\n    } else {\r\n      sp = emitir(IRT(IR_ADD, IRT_PTR), sp, lj_ir_kintp(J, sizeof(GCcdata)));\r\n    }\r\n    if (ctype_isnum(s->info) && t != IRT_CDATA)\r\n      sp = emitir(IRT(IR_XLOAD, t), sp, 0);  /* Load number value. */\r\n    goto doconv;\r\n  }\r\n  s = ctype_get(cts, sid);\r\ndoconv:\r\n  if (ctype_isenum(d->info)) d = ctype_child(cts, d);\r\n  return crec_ct_ct(J, d, s, dp, sp, svisnz);\r\n}\r\n\r\n/* -- C data metamethods -------------------------------------------------- */\r\n\r\n/* This would be rather difficult in FOLD, so do it here:\r\n** (base+k)+(idx*sz)+ofs ==> (base+idx*sz)+(ofs+k)\r\n** (base+(idx+k)*sz)+ofs ==> (base+idx*sz)+(ofs+k*sz)\r\n*/\r\nstatic TRef crec_reassoc_ofs(jit_State *J, TRef tr, ptrdiff_t *ofsp, MSize sz)\r\n{\r\n  IRIns *ir = IR(tref_ref(tr));\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && irref_isk(ir->op2) &&\r\n      (ir->o == IR_ADD || ir->o == IR_ADDOV || ir->o == IR_SUBOV)) {\r\n    IRIns *irk = IR(ir->op2);\r\n    ptrdiff_t k;\r\n    if (LJ_64 && irk->o == IR_KINT64)\r\n      k = (ptrdiff_t)ir_kint64(irk)->u64 * sz;\r\n    else\r\n      k = (ptrdiff_t)irk->i * sz;\r\n    if (ir->o == IR_SUBOV) *ofsp -= k; else *ofsp += k;\r\n    tr = ir->op1;  /* Not a TRef, but the caller doesn't care. */\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Record ctype __index/__newindex metamethods. */\r\nstatic void crec_index_meta(jit_State *J, CTState *cts, CType *ct,\r\n\t\t\t    RecordFFData *rd)\r\n{\r\n  CTypeID id = ctype_typeid(cts, ct);\r\n  cTValue *tv = lj_ctype_meta(cts, id, rd->data ? MM_newindex : MM_index);\r\n  if (!tv)\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  if (tvisfunc(tv)) {\r\n    J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n    rd->nres = -1;  /* Pending tailcall. */\r\n  } else if (rd->data == 0 && tvistab(tv) && tref_isstr(J->base[1])) {\r\n    /* Specialize to result of __index lookup. */\r\n    cTValue *o = lj_tab_get(J->L, tabV(tv), &rd->argv[1]);\r\n    J->base[0] = lj_record_constify(J, o);\r\n    if (!J->base[0])\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    /* Always specialize to the key. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, strV(&rd->argv[1])));\r\n  } else {\r\n    /* NYI: resolving of non-function metamethods. */\r\n    /* NYI: non-string keys for __index table. */\r\n    /* NYI: stores to __newindex table. */\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_index(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef idx, ptr = J->base[0];\r\n  ptrdiff_t ofs = sizeof(GCcdata);\r\n  GCcdata *cd = argv2cdata(J, ptr, &rd->argv[0]);\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  CTypeID sid = 0;\r\n\r\n  /* Resolve pointer or reference for cdata object. */\r\n  if (ctype_isptr(ct->info)) {\r\n    IRType t = (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n    if (ctype_isref(ct->info)) ct = ctype_rawchild(cts, ct);\r\n    ptr = emitir(IRT(IR_FLOAD, t), ptr, IRFL_CDATA_PTR);\r\n    ofs = 0;\r\n    ptr = crec_reassoc_ofs(J, ptr, &ofs, 1);\r\n  }\r\n\r\nagain:\r\n  idx = J->base[1];\r\n  if (tref_isnumber(idx)) {\r\n    idx = lj_opt_narrow_cindex(J, idx);\r\n    if (ctype_ispointer(ct->info)) {\r\n      CTSize sz;\r\n  integer_key:\r\n      if ((ct->info & CTF_COMPLEX))\r\n\tidx = emitir(IRT(IR_BAND, IRT_INTP), idx, lj_ir_kintp(J, 1));\r\n      sz = lj_ctype_size(cts, (sid = ctype_cid(ct->info)));\r\n      idx = crec_reassoc_ofs(J, idx, &ofs, sz);\r\n#if LJ_TARGET_ARM || LJ_TARGET_PPC\r\n      /* Hoist base add to allow fusion of index/shift into operands. */\r\n      if (LJ_LIKELY(J->flags & JIT_F_OPT_LOOP) && ofs\r\n#if LJ_TARGET_ARM\r\n\t  && (sz == 1 || sz == 4)\r\n#endif\r\n\t  ) {\r\n\tptr = emitir(IRT(IR_ADD, IRT_PTR), ptr, lj_ir_kintp(J, ofs));\r\n\tofs = 0;\r\n      }\r\n#endif\r\n      idx = emitir(IRT(IR_MUL, IRT_INTP), idx, lj_ir_kintp(J, sz));\r\n      ptr = emitir(IRT(IR_ADD, IRT_PTR), idx, ptr);\r\n    }\r\n  } else if (tref_iscdata(idx)) {\r\n    GCcdata *cdk = cdataV(&rd->argv[1]);\r\n    CType *ctk = ctype_raw(cts, cdk->ctypeid);\r\n    IRType t = crec_ct2irt(cts, ctk);\r\n    if (ctype_ispointer(ct->info) && t >= IRT_I8 && t <= IRT_U64) {\r\n      if (ctk->size == 8) {\r\n\tidx = emitir(IRT(IR_FLOAD, t), idx, IRFL_CDATA_INT64);\r\n      } else if (ctk->size == 4) {\r\n\tidx = emitir(IRT(IR_FLOAD, t), idx, IRFL_CDATA_INT);\r\n      } else {\r\n\tidx = emitir(IRT(IR_ADD, IRT_PTR), idx,\r\n\t\t     lj_ir_kintp(J, sizeof(GCcdata)));\r\n\tidx = emitir(IRT(IR_XLOAD, t), idx, 0);\r\n      }\r\n      if (LJ_64 && ctk->size < sizeof(intptr_t) && !(ctk->info & CTF_UNSIGNED))\r\n\tidx = emitconv(idx, IRT_INTP, IRT_INT, IRCONV_SEXT);\r\n      if (!LJ_64 && ctk->size > sizeof(intptr_t)) {\r\n\tidx = emitconv(idx, IRT_INTP, t, 0);\r\n\tlj_needsplit(J);\r\n      }\r\n      goto integer_key;\r\n    }\r\n  } else if (tref_isstr(idx)) {\r\n    GCstr *name = strV(&rd->argv[1]);\r\n    if (cd && cd->ctypeid == CTID_CTYPEID)\r\n      ct = ctype_raw(cts, crec_constructor(J, cd, ptr));\r\n    if (ctype_isstruct(ct->info)) {\r\n      CTSize fofs;\r\n      CType *fct;\r\n      fct = lj_ctype_getfield(cts, ct, name, &fofs);\r\n      if (fct) {\r\n\t/* Always specialize to the field name. */\r\n\temitir(IRTG(IR_EQ, IRT_STR), idx, lj_ir_kstr(J, name));\r\n\tif (ctype_isconstval(fct->info)) {\r\n\t  if (fct->size >= 0x80000000u &&\r\n\t      (ctype_child(cts, fct)->info & CTF_UNSIGNED)) {\r\n\t    J->base[0] = lj_ir_knum(J, (lua_Number)(uint32_t)fct->size);\r\n\t    return;\r\n\t  }\r\n\t  J->base[0] = lj_ir_kint(J, (int32_t)fct->size);\r\n\t  return;  /* Interpreter will throw for newindex. */\r\n\t} else if (ctype_isbitfield(fct->info)) {\r\n\t  lj_trace_err(J, LJ_TRERR_NYICONV);\r\n\t} else {\r\n\t  lua_assert(ctype_isfield(fct->info));\r\n\t  sid = ctype_cid(fct->info);\r\n\t}\r\n\tofs += (ptrdiff_t)fofs;\r\n      }\r\n    } else if (ctype_iscomplex(ct->info)) {\r\n      if (name->len == 2 &&\r\n\t  ((strdata(name)[0] == 'r' && strdata(name)[1] == 'e') ||\r\n\t   (strdata(name)[0] == 'i' && strdata(name)[1] == 'm'))) {\r\n\t/* Always specialize to the field name. */\r\n\temitir(IRTG(IR_EQ, IRT_STR), idx, lj_ir_kstr(J, name));\r\n\tif (strdata(name)[0] == 'i') ofs += (ct->size >> 1);\r\n\tsid = ctype_cid(ct->info);\r\n      }\r\n    }\r\n  }\r\n  if (!sid) {\r\n    if (ctype_isptr(ct->info)) {  /* Automatically perform '->'. */\r\n      CType *cct = ctype_rawchild(cts, ct);\r\n      if (ctype_isstruct(cct->info)) {\r\n\tct = cct;\r\n\tcd = NULL;\r\n\tif (tref_isstr(idx)) goto again;\r\n      }\r\n    }\r\n    crec_index_meta(J, cts, ct, rd);\r\n    return;\r\n  }\r\n\r\n  if (ofs)\r\n    ptr = emitir(IRT(IR_ADD, IRT_PTR), ptr, lj_ir_kintp(J, ofs));\r\n\r\n  /* Resolve reference for field. */\r\n  ct = ctype_get(cts, sid);\r\n  if (ctype_isref(ct->info)) {\r\n    ptr = emitir(IRT(IR_XLOAD, IRT_PTR), ptr, 0);\r\n    sid = ctype_cid(ct->info);\r\n    ct = ctype_get(cts, sid);\r\n  }\r\n\r\n  while (ctype_isattrib(ct->info))\r\n    ct = ctype_child(cts, ct);  /* Skip attributes. */\r\n\r\n  if (rd->data == 0) {  /* __index metamethod. */\r\n    J->base[0] = crec_tv_ct(J, ct, sid, ptr);\r\n  } else {  /* __newindex metamethod. */\r\n    rd->nres = 0;\r\n    J->needsnap = 1;\r\n    crec_ct_tv(J, ct, ptr, J->base[2], &rd->argv[2]);\r\n  }\r\n}\r\n\r\n/* Record setting a finalizer. */\r\nstatic void crec_finalizer(jit_State *J, TRef trcd, TRef trfin, cTValue *fin)\r\n{\r\n  if (tvisgcv(fin)) {\r\n    if (!trfin) trfin = lj_ir_kptr(J, gcval(fin));\r\n  } else if (tvisnil(fin)) {\r\n    trfin = lj_ir_kptr(J, NULL);\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  lj_ir_call(J, IRCALL_lj_cdata_setfin, trcd,\r\n\t     trfin, lj_ir_kint(J, (int32_t)itype(fin)));\r\n  J->needsnap = 1;\r\n}\r\n\r\n/* Record cdata allocation. */\r\nstatic void crec_alloc(jit_State *J, RecordFFData *rd, CTypeID id)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTSize sz;\r\n  CTInfo info = lj_ctype_info(cts, id, &sz);\r\n  CType *d = ctype_raw(cts, id);\r\n  TRef trcd, trid = lj_ir_kint(J, id);\r\n  cTValue *fin;\r\n  /* Use special instruction to box pointer or 32/64 bit integer. */\r\n  if (ctype_isptr(info) || (ctype_isinteger(info) && (sz == 4 || sz == 8))) {\r\n    TRef sp = J->base[1] ? crec_ct_tv(J, d, 0, J->base[1], &rd->argv[1]) :\r\n\t      ctype_isptr(info) ? lj_ir_kptr(J, NULL) :\r\n\t      sz == 4 ? lj_ir_kint(J, 0) :\r\n\t      (lj_needsplit(J), lj_ir_kint64(J, 0));\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA), trid, sp);\r\n    return;\r\n  } else {\r\n    TRef trsz = TREF_NIL;\r\n    if ((info & CTF_VLA)) {  /* Calculate VLA/VLS size at runtime. */\r\n      CTSize sz0, sz1;\r\n      if (!J->base[1] || J->base[2])\r\n\tlj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: init VLA/VLS. */\r\n      trsz = crec_ct_tv(J, ctype_get(cts, CTID_INT32), 0,\r\n\t\t\tJ->base[1], &rd->argv[1]);\r\n      sz0 = lj_ctype_vlsize(cts, d, 0);\r\n      sz1 = lj_ctype_vlsize(cts, d, 1);\r\n      trsz = emitir(IRTGI(IR_MULOV), trsz, lj_ir_kint(J, (int32_t)(sz1-sz0)));\r\n      trsz = emitir(IRTGI(IR_ADDOV), trsz, lj_ir_kint(J, (int32_t)sz0));\r\n      J->base[1] = 0;  /* Simplify logic below. */\r\n    } else if (ctype_align(info) > CT_MEMALIGN) {\r\n      trsz = lj_ir_kint(J, sz);\r\n    }\r\n    trcd = emitir(IRTG(IR_CNEW, IRT_CDATA), trid, trsz);\r\n    if (sz > 128 || (info & CTF_VLA)) {\r\n      TRef dp;\r\n      CTSize align;\r\n    special:  /* Only handle bulk zero-fill for large/VLA/VLS types. */\r\n      if (J->base[1])\r\n\tlj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: init large/VLA/VLS types. */\r\n      dp = emitir(IRT(IR_ADD, IRT_PTR), trcd, lj_ir_kintp(J, sizeof(GCcdata)));\r\n      if (trsz == TREF_NIL) trsz = lj_ir_kint(J, sz);\r\n      align = ctype_align(info);\r\n      if (align < CT_MEMALIGN) align = CT_MEMALIGN;\r\n      crec_fill(J, dp, trsz, lj_ir_kint(J, 0), (1u << align));\r\n    } else if (J->base[1] && !J->base[2] &&\r\n\t!lj_cconv_multi_init(cts, d, &rd->argv[1])) {\r\n      goto single_init;\r\n    } else if (ctype_isarray(d->info)) {\r\n      CType *dc = ctype_rawchild(cts, d);  /* Array element type. */\r\n      CTSize ofs, esize = dc->size;\r\n      TRef sp = 0;\r\n      TValue tv;\r\n      TValue *sval = &tv;\r\n      MSize i;\r\n      tv.u64 = 0;\r\n      if (!(ctype_isnum(dc->info) || ctype_isptr(dc->info)) ||\r\n\t  esize * CREC_FILL_MAXUNROLL < sz)\r\n\tgoto special;\r\n      for (i = 1, ofs = 0; ofs < sz; ofs += esize) {\r\n\tTRef dp = emitir(IRT(IR_ADD, IRT_PTR), trcd,\r\n\t\t\t lj_ir_kintp(J, ofs + sizeof(GCcdata)));\r\n\tif (J->base[i]) {\r\n\t  sp = J->base[i];\r\n\t  sval = &rd->argv[i];\r\n\t  i++;\r\n\t} else if (i != 2) {\r\n\t  sp = ctype_isnum(dc->info) ? lj_ir_kint(J, 0) : TREF_NIL;\r\n\t}\r\n\tcrec_ct_tv(J, dc, dp, sp, sval);\r\n      }\r\n    } else if (ctype_isstruct(d->info)) {\r\n      CTypeID fid = d->sib;\r\n      MSize i = 1;\r\n      while (fid) {\r\n\tCType *df = ctype_get(cts, fid);\r\n\tfid = df->sib;\r\n\tif (ctype_isfield(df->info)) {\r\n\t  CType *dc;\r\n\t  TRef sp, dp;\r\n\t  TValue tv;\r\n\t  TValue *sval = &tv;\r\n\t  setintV(&tv, 0);\r\n\t  if (!gcref(df->name)) continue;  /* Ignore unnamed fields. */\r\n\t  dc = ctype_rawchild(cts, df);  /* Field type. */\r\n\t  if (!(ctype_isnum(dc->info) || ctype_isptr(dc->info) ||\r\n\t\tctype_isenum(dc->info)))\r\n\t    lj_trace_err(J, LJ_TRERR_NYICONV);  /* NYI: init aggregates. */\r\n\t  if (J->base[i]) {\r\n\t    sp = J->base[i];\r\n\t    sval = &rd->argv[i];\r\n\t    i++;\r\n\t  } else {\r\n\t    sp = ctype_isptr(dc->info) ? TREF_NIL : lj_ir_kint(J, 0);\r\n\t  }\r\n\t  dp = emitir(IRT(IR_ADD, IRT_PTR), trcd,\r\n\t\t      lj_ir_kintp(J, df->size + sizeof(GCcdata)));\r\n\t  crec_ct_tv(J, dc, dp, sp, sval);\r\n\t} else if (!ctype_isconstval(df->info)) {\r\n\t  /* NYI: init bitfields and sub-structures. */\r\n\t  lj_trace_err(J, LJ_TRERR_NYICONV);\r\n\t}\r\n      }\r\n    } else {\r\n      TRef dp;\r\n    single_init:\r\n      dp = emitir(IRT(IR_ADD, IRT_PTR), trcd, lj_ir_kintp(J, sizeof(GCcdata)));\r\n      if (J->base[1]) {\r\n\tcrec_ct_tv(J, d, dp, J->base[1], &rd->argv[1]);\r\n      } else {\r\n\tTValue tv;\r\n\ttv.u64 = 0;\r\n\tcrec_ct_tv(J, d, dp, lj_ir_kint(J, 0), &tv);\r\n      }\r\n    }\r\n  }\r\n  J->base[0] = trcd;\r\n  /* Handle __gc metamethod. */\r\n  fin = lj_ctype_meta(cts, id, MM_gc);\r\n  if (fin)\r\n    crec_finalizer(J, trcd, 0, fin);\r\n}\r\n\r\n/* Record argument conversions. */\r\nstatic TRef crec_call_args(jit_State *J, RecordFFData *rd,\r\n\t\t\t   CTState *cts, CType *ct)\r\n{\r\n  TRef args[CCI_NARGS_MAX];\r\n  CTypeID fid;\r\n  MSize i, n;\r\n  TRef tr, *base;\r\n  cTValue *o;\r\n#if LJ_TARGET_X86\r\n#if LJ_ABI_WIN\r\n  TRef *arg0 = NULL, *arg1 = NULL;\r\n#endif\r\n  int ngpr = 0;\r\n  if (ctype_cconv(ct->info) == CTCC_THISCALL)\r\n    ngpr = 1;\r\n  else if (ctype_cconv(ct->info) == CTCC_FASTCALL)\r\n    ngpr = 2;\r\n#endif\r\n\r\n  /* Skip initial attributes. */\r\n  fid = ct->sib;\r\n  while (fid) {\r\n    CType *ctf = ctype_get(cts, fid);\r\n    if (!ctype_isattrib(ctf->info)) break;\r\n    fid = ctf->sib;\r\n  }\r\n  args[0] = TREF_NIL;\r\n  for (n = 0, base = J->base+1, o = rd->argv+1; *base; n++, base++, o++) {\r\n    CTypeID did;\r\n    CType *d;\r\n\r\n    if (n >= CCI_NARGS_MAX)\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n\r\n    if (fid) {  /* Get argument type from field. */\r\n      CType *ctf = ctype_get(cts, fid);\r\n      fid = ctf->sib;\r\n      lua_assert(ctype_isfield(ctf->info));\r\n      did = ctype_cid(ctf->info);\r\n    } else {\r\n      if (!(ct->info & CTF_VARARG))\r\n\tlj_trace_err(J, LJ_TRERR_NYICALL);  /* Too many arguments. */\r\n      did = lj_ccall_ctid_vararg(cts, o);  /* Infer vararg type. */\r\n    }\r\n    d = ctype_raw(cts, did);\r\n    if (!(ctype_isnum(d->info) || ctype_isptr(d->info) ||\r\n\t  ctype_isenum(d->info)))\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n    tr = crec_ct_tv(J, d, 0, *base, o);\r\n    if (ctype_isinteger_or_bool(d->info)) {\r\n      if (d->size < 4) {\r\n\tif ((d->info & CTF_UNSIGNED))\r\n\t  tr = emitconv(tr, IRT_INT, d->size==1 ? IRT_U8 : IRT_U16, 0);\r\n\telse\r\n\t  tr = emitconv(tr, IRT_INT, d->size==1 ? IRT_I8 : IRT_I16,IRCONV_SEXT);\r\n      }\r\n    } else if (LJ_SOFTFP && ctype_isfp(d->info) && d->size > 4) {\r\n      lj_needsplit(J);\r\n    }\r\n#if LJ_TARGET_X86\r\n    /* 64 bit args must not end up in registers for fastcall/thiscall. */\r\n#if LJ_ABI_WIN\r\n    if (!ctype_isfp(d->info)) {\r\n      /* Sigh, the Windows/x86 ABI allows reordering across 64 bit args. */\r\n      if (tref_typerange(tr, IRT_I64, IRT_U64)) {\r\n\tif (ngpr) {\r\n\t  arg0 = &args[n]; args[n++] = TREF_NIL; ngpr--;\r\n\t  if (ngpr) {\r\n\t    arg1 = &args[n]; args[n++] = TREF_NIL; ngpr--;\r\n\t  }\r\n\t}\r\n      } else {\r\n\tif (arg0) { *arg0 = tr; arg0 = NULL; n--; continue; }\r\n\tif (arg1) { *arg1 = tr; arg1 = NULL; n--; continue; }\r\n\tif (ngpr) ngpr--;\r\n      }\r\n    }\r\n#else\r\n    if (!ctype_isfp(d->info) && ngpr) {\r\n      if (tref_typerange(tr, IRT_I64, IRT_U64)) {\r\n\t/* No reordering for other x86 ABIs. Simply add alignment args. */\r\n\tdo { args[n++] = TREF_NIL; } while (--ngpr);\r\n      } else {\r\n\tngpr--;\r\n      }\r\n    }\r\n#endif\r\n#endif\r\n    args[n] = tr;\r\n  }\r\n  tr = args[0];\r\n  for (i = 1; i < n; i++)\r\n    tr = emitir(IRT(IR_CARG, IRT_NIL), tr, args[i]);\r\n  return tr;\r\n}\r\n\r\n/* Create a snapshot for the caller, simulating a 'false' return value. */\r\nstatic void crec_snap_caller(jit_State *J)\r\n{\r\n  lua_State *L = J->L;\r\n  TValue *base = L->base, *top = L->top;\r\n  const BCIns *pc = J->pc;\r\n  TRef ftr = J->base[-1];\r\n  ptrdiff_t delta;\r\n  if (!frame_islua(base-1) || J->framedepth <= 0)\r\n    lj_trace_err(J, LJ_TRERR_NYICALL);\r\n  J->pc = frame_pc(base-1); delta = 1+LJ_FR2+bc_a(J->pc[-1]);\r\n  L->top = base; L->base = base - delta;\r\n  J->base[-1] = TREF_FALSE;\r\n  J->base -= delta; J->baseslot -= (BCReg)delta;\r\n  J->maxslot = (BCReg)delta; J->framedepth--;\r\n  lj_snap_add(J);\r\n  L->base = base; L->top = top;\r\n  J->framedepth++; J->maxslot = 1;\r\n  J->base += delta; J->baseslot += (BCReg)delta;\r\n  J->base[-1] = ftr; J->pc = pc;\r\n}\r\n\r\n/* Record function call. */\r\nstatic int crec_call(jit_State *J, RecordFFData *rd, GCcdata *cd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ct = ctype_raw(cts, cd->ctypeid);\r\n  IRType tp = IRT_PTR;\r\n  if (ctype_isptr(ct->info)) {\r\n    tp = (LJ_64 && ct->size == 8) ? IRT_P64 : IRT_P32;\r\n    ct = ctype_rawchild(cts, ct);\r\n  }\r\n  if (ctype_isfunc(ct->info)) {\r\n    TRef func = emitir(IRT(IR_FLOAD, tp), J->base[0], IRFL_CDATA_PTR);\r\n    CType *ctr = ctype_rawchild(cts, ct);\r\n    IRType t = crec_ct2irt(cts, ctr);\r\n    TRef tr;\r\n    TValue tv;\r\n    /* Check for blacklisted C functions that might call a callback. */\r\n    setlightudV(&tv,\r\n\t\tcdata_getptr(cdataptr(cd), (LJ_64 && tp == IRT_P64) ? 8 : 4));\r\n    if (tvistrue(lj_tab_get(J->L, cts->miscmap, &tv)))\r\n      lj_trace_err(J, LJ_TRERR_BLACKL);\r\n    if (ctype_isvoid(ctr->info)) {\r\n      t = IRT_NIL;\r\n      rd->nres = 0;\r\n    } else if (!(ctype_isnum(ctr->info) || ctype_isptr(ctr->info) ||\r\n\t\t ctype_isenum(ctr->info)) || t == IRT_CDATA) {\r\n      lj_trace_err(J, LJ_TRERR_NYICALL);\r\n    }\r\n    if ((ct->info & CTF_VARARG)\r\n#if LJ_TARGET_X86\r\n\t|| ctype_cconv(ct->info) != CTCC_CDECL\r\n#endif\r\n\t)\r\n      func = emitir(IRT(IR_CARG, IRT_NIL), func,\r\n\t\t    lj_ir_kint(J, ctype_typeid(cts, ct)));\r\n    tr = emitir(IRT(IR_CALLXS, t), crec_call_args(J, rd, cts, ct), func);\r\n    if (ctype_isbool(ctr->info)) {\r\n      if (frame_islua(J->L->base-1) && bc_b(frame_pc(J->L->base-1)[-1]) == 1) {\r\n\t/* Don't check result if ignored. */\r\n\ttr = TREF_NIL;\r\n      } else {\r\n\tcrec_snap_caller(J);\r\n#if LJ_TARGET_X86ORX64\r\n\t/* Note: only the x86/x64 backend supports U8 and only for EQ(tr, 0). */\r\n\tlj_ir_set(J, IRTG(IR_NE, IRT_U8), tr, lj_ir_kint(J, 0));\r\n#else\r\n\tlj_ir_set(J, IRTGI(IR_NE), tr, lj_ir_kint(J, 0));\r\n#endif\r\n\tJ->postproc = LJ_POST_FIXGUARDSNAP;\r\n\ttr = TREF_TRUE;\r\n      }\r\n    } else if (t == IRT_PTR || (LJ_64 && t == IRT_P32) ||\r\n\t       t == IRT_I64 || t == IRT_U64 || ctype_isenum(ctr->info)) {\r\n      TRef trid = lj_ir_kint(J, ctype_cid(ct->info));\r\n      tr = emitir(IRTG(IR_CNEWI, IRT_CDATA), trid, tr);\r\n      if (t == IRT_I64 || t == IRT_U64) lj_needsplit(J);\r\n    } else if (t == IRT_FLOAT || t == IRT_U32) {\r\n      tr = emitconv(tr, IRT_NUM, t, 0);\r\n    } else if (t == IRT_I8 || t == IRT_I16) {\r\n      tr = emitconv(tr, IRT_INT, t, IRCONV_SEXT);\r\n    } else if (t == IRT_U8 || t == IRT_U16) {\r\n      tr = emitconv(tr, IRT_INT, t, 0);\r\n    }\r\n    J->base[0] = tr;\r\n    J->needsnap = 1;\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_call(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  GCcdata *cd = argv2cdata(J, J->base[0], &rd->argv[0]);\r\n  CTypeID id = cd->ctypeid;\r\n  CType *ct;\r\n  cTValue *tv;\r\n  MMS mm = MM_call;\r\n  if (id == CTID_CTYPEID) {\r\n    id = crec_constructor(J, cd, J->base[0]);\r\n    mm = MM_new;\r\n  } else if (crec_call(J, rd, cd)) {\r\n    return;\r\n  }\r\n  /* Record ctype __call/__new metamethod. */\r\n  ct = ctype_raw(cts, id);\r\n  tv = lj_ctype_meta(cts, ctype_isptr(ct->info) ? ctype_cid(ct->info) : id, mm);\r\n  if (tv) {\r\n    if (tvisfunc(tv)) {\r\n      J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n      rd->nres = -1;  /* Pending tailcall. */\r\n      return;\r\n    }\r\n  } else if (mm == MM_new) {\r\n    crec_alloc(J, rd, id);\r\n    return;\r\n  }\r\n  /* No metamethod or NYI: non-function metamethods. */\r\n  lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n}\r\n\r\nstatic TRef crec_arith_int64(jit_State *J, TRef *sp, CType **s, MMS mm)\r\n{\r\n  if (ctype_isnum(s[0]->info) && ctype_isnum(s[1]->info)) {\r\n    IRType dt;\r\n    CTypeID id;\r\n    TRef tr;\r\n    MSize i;\r\n    IROp op;\r\n    lj_needsplit(J);\r\n    if (((s[0]->info & CTF_UNSIGNED) && s[0]->size == 8) ||\r\n\t((s[1]->info & CTF_UNSIGNED) && s[1]->size == 8)) {\r\n      dt = IRT_U64; id = CTID_UINT64;\r\n    } else {\r\n      dt = IRT_I64; id = CTID_INT64;\r\n      if (mm < MM_add &&\r\n\t  !((s[0]->info | s[1]->info) & CTF_FP) &&\r\n\t  s[0]->size == 4 && s[1]->size == 4) {  /* Try to narrow comparison. */\r\n\tif (!((s[0]->info ^ s[1]->info) & CTF_UNSIGNED) ||\r\n\t    (tref_isk(sp[1]) && IR(tref_ref(sp[1]))->i >= 0)) {\r\n\t  dt = (s[0]->info & CTF_UNSIGNED) ? IRT_U32 : IRT_INT;\r\n\t  goto comp;\r\n\t} else if (tref_isk(sp[0]) && IR(tref_ref(sp[0]))->i >= 0) {\r\n\t  dt = (s[1]->info & CTF_UNSIGNED) ? IRT_U32 : IRT_INT;\r\n\t  goto comp;\r\n\t}\r\n      }\r\n    }\r\n    for (i = 0; i < 2; i++) {\r\n      IRType st = tref_type(sp[i]);\r\n      if (st == IRT_NUM || st == IRT_FLOAT)\r\n\tsp[i] = emitconv(sp[i], dt, st, IRCONV_ANY);\r\n      else if (!(st == IRT_I64 || st == IRT_U64))\r\n\tsp[i] = emitconv(sp[i], dt, IRT_INT,\r\n\t\t\t (s[i]->info & CTF_UNSIGNED) ? 0 : IRCONV_SEXT);\r\n    }\r\n    if (mm < MM_add) {\r\n    comp:\r\n      /* Assume true comparison. Fixup and emit pending guard later. */\r\n      if (mm == MM_eq) {\r\n\top = IR_EQ;\r\n      } else {\r\n\top = mm == MM_lt ? IR_LT : IR_LE;\r\n\tif (dt == IRT_U32 || dt == IRT_U64)\r\n\t  op += (IR_ULT-IR_LT);\r\n      }\r\n      lj_ir_set(J, IRTG(op, dt), sp[0], sp[1]);\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      tr = emitir(IRT(mm+(int)IR_ADD-(int)MM_add, dt), sp[0], sp[1]);\r\n    }\r\n    return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic TRef crec_arith_ptr(jit_State *J, TRef *sp, CType **s, MMS mm)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *ctp = s[0];\r\n  if (ctype_isptr(ctp->info) || ctype_isrefarray(ctp->info)) {\r\n    if ((mm == MM_sub || mm == MM_eq || mm == MM_lt || mm == MM_le) &&\r\n\t(ctype_isptr(s[1]->info) || ctype_isrefarray(s[1]->info))) {\r\n      if (mm == MM_sub) {  /* Pointer difference. */\r\n\tTRef tr;\r\n\tCTSize sz = lj_ctype_size(cts, ctype_cid(ctp->info));\r\n\tif (sz == 0 || (sz & (sz-1)) != 0)\r\n\t  return 0;  /* NYI: integer division. */\r\n\ttr = emitir(IRT(IR_SUB, IRT_INTP), sp[0], sp[1]);\r\n\ttr = emitir(IRT(IR_BSAR, IRT_INTP), tr, lj_ir_kint(J, lj_fls(sz)));\r\n#if LJ_64\r\n\ttr = emitconv(tr, IRT_NUM, IRT_INTP, 0);\r\n#endif\r\n\treturn tr;\r\n      } else {  /* Pointer comparison (unsigned). */\r\n\t/* Assume true comparison. Fixup and emit pending guard later. */\r\n\tIROp op = mm == MM_eq ? IR_EQ : mm == MM_lt ? IR_ULT : IR_ULE;\r\n\tlj_ir_set(J, IRTG(op, IRT_PTR), sp[0], sp[1]);\r\n\tJ->postproc = LJ_POST_FIXGUARD;\r\n\treturn TREF_TRUE;\r\n      }\r\n    }\r\n    if (!((mm == MM_add || mm == MM_sub) && ctype_isnum(s[1]->info)))\r\n      return 0;\r\n  } else if (mm == MM_add && ctype_isnum(ctp->info) &&\r\n\t     (ctype_isptr(s[1]->info) || ctype_isrefarray(s[1]->info))) {\r\n    TRef tr = sp[0]; sp[0] = sp[1]; sp[1] = tr;  /* Swap pointer and index. */\r\n    ctp = s[1];\r\n  } else {\r\n    return 0;\r\n  }\r\n  {\r\n    TRef tr = sp[1];\r\n    IRType t = tref_type(tr);\r\n    CTSize sz = lj_ctype_size(cts, ctype_cid(ctp->info));\r\n    CTypeID id;\r\n#if LJ_64\r\n    if (t == IRT_NUM || t == IRT_FLOAT)\r\n      tr = emitconv(tr, IRT_INTP, t, IRCONV_ANY);\r\n    else if (!(t == IRT_I64 || t == IRT_U64))\r\n      tr = emitconv(tr, IRT_INTP, IRT_INT,\r\n\t\t    ((t - IRT_I8) & 1) ? 0 : IRCONV_SEXT);\r\n#else\r\n    if (!tref_typerange(sp[1], IRT_I8, IRT_U32)) {\r\n      tr = emitconv(tr, IRT_INTP, t,\r\n\t\t    (t == IRT_NUM || t == IRT_FLOAT) ? IRCONV_ANY : 0);\r\n    }\r\n#endif\r\n    tr = emitir(IRT(IR_MUL, IRT_INTP), tr, lj_ir_kintp(J, sz));\r\n    tr = emitir(IRT(mm+(int)IR_ADD-(int)MM_add, IRT_PTR), sp[0], tr);\r\n    id = lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(ctp->info)),\r\n\t\t\t CTSIZE_PTR);\r\n    return emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n  }\r\n}\r\n\r\n/* Record ctype arithmetic metamethods. */\r\nstatic TRef crec_arith_meta(jit_State *J, TRef *sp, CType **s, CTState *cts,\r\n\t\t\t    RecordFFData *rd)\r\n{\r\n  cTValue *tv = NULL;\r\n  if (J->base[0]) {\r\n    if (tviscdata(&rd->argv[0])) {\r\n      CTypeID id = argv2cdata(J, J->base[0], &rd->argv[0])->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n      tv = lj_ctype_meta(cts, id, (MMS)rd->data);\r\n    }\r\n    if (!tv && J->base[1] && tviscdata(&rd->argv[1])) {\r\n      CTypeID id = argv2cdata(J, J->base[1], &rd->argv[1])->ctypeid;\r\n      CType *ct = ctype_raw(cts, id);\r\n      if (ctype_isptr(ct->info)) id = ctype_cid(ct->info);\r\n      tv = lj_ctype_meta(cts, id, (MMS)rd->data);\r\n    }\r\n  }\r\n  if (tv) {\r\n    if (tvisfunc(tv)) {\r\n      J->base[-1] = lj_ir_kfunc(J, funcV(tv)) | TREF_FRAME;\r\n      rd->nres = -1;  /* Pending tailcall. */\r\n      return 0;\r\n    }  /* NYI: non-function metamethods. */\r\n  } else if ((MMS)rd->data == MM_eq) {  /* Fallback cdata pointer comparison. */\r\n    if (sp[0] && sp[1] && ctype_isnum(s[0]->info) == ctype_isnum(s[1]->info)) {\r\n      /* Assume true comparison. Fixup and emit pending guard later. */\r\n      lj_ir_set(J, IRTG(IR_EQ, IRT_PTR), sp[0], sp[1]);\r\n      J->postproc = LJ_POST_FIXGUARD;\r\n      return TREF_TRUE;\r\n    } else {\r\n      return TREF_FALSE;\r\n    }\r\n  }\r\n  lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  return 0;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_cdata_arith(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef sp[2];\r\n  CType *s[2];\r\n  MSize i;\r\n  for (i = 0; i < 2; i++) {\r\n    TRef tr = J->base[i];\r\n    CType *ct = ctype_get(cts, CTID_DOUBLE);\r\n    if (!tr) {\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    } else if (tref_iscdata(tr)) {\r\n      CTypeID id = argv2cdata(J, tr, &rd->argv[i])->ctypeid;\r\n      IRType t;\r\n      ct = ctype_raw(cts, id);\r\n      t = crec_ct2irt(cts, ct);\r\n      if (ctype_isptr(ct->info)) {  /* Resolve pointer or reference. */\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_PTR);\r\n\tif (ctype_isref(ct->info)) {\r\n\t  ct = ctype_rawchild(cts, ct);\r\n\t  t = crec_ct2irt(cts, ct);\r\n\t}\r\n      } else if (t == IRT_I64 || t == IRT_U64) {\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_INT64);\r\n\tlj_needsplit(J);\r\n\tgoto ok;\r\n      } else if (t == IRT_INT || t == IRT_U32) {\r\n\ttr = emitir(IRT(IR_FLOAD, t), tr, IRFL_CDATA_INT);\r\n\tif (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n\tgoto ok;\r\n      } else if (ctype_isfunc(ct->info)) {\r\n\ttr = emitir(IRT(IR_FLOAD, IRT_PTR), tr, IRFL_CDATA_PTR);\r\n\tct = ctype_get(cts,\r\n\t  lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR));\r\n\tgoto ok;\r\n      } else {\r\n\ttr = emitir(IRT(IR_ADD, IRT_PTR), tr, lj_ir_kintp(J, sizeof(GCcdata)));\r\n      }\r\n      if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n      if (ctype_isnum(ct->info)) {\r\n\tif (t == IRT_CDATA) {\r\n\t  tr = 0;\r\n\t} else {\r\n\t  if (t == IRT_I64 || t == IRT_U64) lj_needsplit(J);\r\n\t  tr = emitir(IRT(IR_XLOAD, t), tr, 0);\r\n\t}\r\n      }\r\n    } else if (tref_isnil(tr)) {\r\n      tr = lj_ir_kptr(J, NULL);\r\n      ct = ctype_get(cts, CTID_P_VOID);\r\n    } else if (tref_isinteger(tr)) {\r\n      ct = ctype_get(cts, CTID_INT32);\r\n    } else if (tref_isstr(tr)) {\r\n      TRef tr2 = J->base[1-i];\r\n      CTypeID id = argv2cdata(J, tr2, &rd->argv[1-i])->ctypeid;\r\n      ct = ctype_raw(cts, id);\r\n      if (ctype_isenum(ct->info)) {  /* Match string against enum constant. */\r\n\tGCstr *str = strV(&rd->argv[i]);\r\n\tCTSize ofs;\r\n\tCType *cct = lj_ctype_getfield(cts, ct, str, &ofs);\r\n\tif (cct && ctype_isconstval(cct->info)) {\r\n\t  /* Specialize to the name of the enum constant. */\r\n\t  emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, str));\r\n\t  ct = ctype_child(cts, cct);\r\n\t  tr = lj_ir_kint(J, (int32_t)ofs);\r\n\t} else {  /* Interpreter will throw or return false. */\r\n\t  ct = ctype_get(cts, CTID_P_VOID);\r\n\t}\r\n      } else if (ctype_isptr(ct->info)) {\r\n\ttr = emitir(IRT(IR_ADD, IRT_PTR), tr, lj_ir_kintp(J, sizeof(GCstr)));\r\n      } else {\r\n\tct = ctype_get(cts, CTID_P_VOID);\r\n      }\r\n    } else if (!tref_isnum(tr)) {\r\n      tr = 0;\r\n      ct = ctype_get(cts, CTID_P_VOID);\r\n    }\r\n  ok:\r\n    s[i] = ct;\r\n    sp[i] = tr;\r\n  }\r\n  {\r\n    TRef tr;\r\n    if (!(tr = crec_arith_int64(J, sp, s, (MMS)rd->data)) &&\r\n\t!(tr = crec_arith_ptr(J, sp, s, (MMS)rd->data)) &&\r\n\t!(tr = crec_arith_meta(J, sp, s, cts, rd)))\r\n      return;\r\n    J->base[0] = tr;\r\n    /* Fixup cdata comparisons, too. Avoids some cdata escapes. */\r\n    if (J->postproc == LJ_POST_FIXGUARD && frame_iscont(J->L->base-1) &&\r\n\t!irt_isguard(J->guardemit)) {\r\n      const BCIns *pc = frame_contpc(J->L->base-1) - 1;\r\n      if (bc_op(*pc) <= BC_ISNEP) {\r\n\tJ2G(J)->tmptv.u64 = (uint64_t)(uintptr_t)pc;\r\n\tJ->postproc = LJ_POST_FIXCOMP;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* -- C library namespace metamethods ------------------------------------- */\r\n\r\nvoid LJ_FASTCALL recff_clib_index(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  if (tref_isudata(J->base[0]) && tref_isstr(J->base[1]) &&\r\n      udataV(&rd->argv[0])->udtype == UDTYPE_FFI_CLIB) {\r\n    CLibrary *cl = (CLibrary *)uddata(udataV(&rd->argv[0]));\r\n    GCstr *name = strV(&rd->argv[1]);\r\n    CType *ct;\r\n    CTypeID id = lj_ctype_getname(cts, &ct, name, CLNS_INDEX);\r\n    cTValue *tv = lj_tab_getstr(cl->cache, name);\r\n    rd->nres = rd->data;\r\n    if (id && tv && !tvisnil(tv)) {\r\n      /* Specialize to the symbol name and make the result a constant. */\r\n      emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, name));\r\n      if (ctype_isconstval(ct->info)) {\r\n\tif (ct->size >= 0x80000000u &&\r\n\t    (ctype_child(cts, ct)->info & CTF_UNSIGNED))\r\n\t  J->base[0] = lj_ir_knum(J, (lua_Number)(uint32_t)ct->size);\r\n\telse\r\n\t  J->base[0] = lj_ir_kint(J, (int32_t)ct->size);\r\n      } else if (ctype_isextern(ct->info)) {\r\n\tCTypeID sid = ctype_cid(ct->info);\r\n\tvoid *sp = *(void **)cdataptr(cdataV(tv));\r\n\tTRef ptr;\r\n\tct = ctype_raw(cts, sid);\r\n\tif (LJ_64 && !checkptr32(sp))\r\n\t  ptr = lj_ir_kintp(J, (uintptr_t)sp);\r\n\telse\r\n\t  ptr = lj_ir_kptr(J, sp);\r\n\tif (rd->data) {\r\n\t  J->base[0] = crec_tv_ct(J, ct, sid, ptr);\r\n\t} else {\r\n\t  J->needsnap = 1;\r\n\t  crec_ct_tv(J, ct, ptr, J->base[2], &rd->argv[2]);\r\n\t}\r\n      } else {\r\n\tJ->base[0] = lj_ir_kgc(J, obj2gco(cdataV(tv)), IRT_CDATA);\r\n      }\r\n    } else {\r\n      lj_trace_err(J, LJ_TRERR_NOCACHE);\r\n    }\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\n/* -- FFI library functions ----------------------------------------------- */\r\n\r\nstatic TRef crec_toint(jit_State *J, CTState *cts, TRef sp, TValue *sval)\r\n{\r\n  return crec_ct_tv(J, ctype_get(cts, CTID_INT32), 0, sp, sval);\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_new(jit_State *J, RecordFFData *rd)\r\n{\r\n  crec_alloc(J, rd, argv2ctype(J, J->base[0], &rd->argv[0]));\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_errno(jit_State *J, RecordFFData *rd)\r\n{\r\n  UNUSED(rd);\r\n  if (J->base[0])\r\n    lj_trace_err(J, LJ_TRERR_NYICALL);\r\n  J->base[0] = lj_ir_call(J, IRCALL_lj_vm_errno);\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_string(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    TRef trlen = J->base[1];\r\n    if (!tref_isnil(trlen)) {\r\n      trlen = crec_toint(J, cts, trlen, &rd->argv[1]);\r\n      tr = crec_ct_tv(J, ctype_get(cts, CTID_P_CVOID), 0, tr, &rd->argv[0]);\r\n    } else {\r\n      tr = crec_ct_tv(J, ctype_get(cts, CTID_P_CCHAR), 0, tr, &rd->argv[0]);\r\n      trlen = lj_ir_call(J, IRCALL_strlen, tr);\r\n    }\r\n    J->base[0] = emitir(IRT(IR_XSNEW, IRT_STR), tr, trlen);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_copy(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef trdst = J->base[0], trsrc = J->base[1], trlen = J->base[2];\r\n  if (trdst && trsrc && (trlen || tref_isstr(trsrc))) {\r\n    trdst = crec_ct_tv(J, ctype_get(cts, CTID_P_VOID), 0, trdst, &rd->argv[0]);\r\n    trsrc = crec_ct_tv(J, ctype_get(cts, CTID_P_CVOID), 0, trsrc, &rd->argv[1]);\r\n    if (trlen) {\r\n      trlen = crec_toint(J, cts, trlen, &rd->argv[2]);\r\n    } else {\r\n      trlen = emitir(IRTI(IR_FLOAD), J->base[1], IRFL_STR_LEN);\r\n      trlen = emitir(IRTI(IR_ADD), trlen, lj_ir_kint(J, 1));\r\n    }\r\n    rd->nres = 0;\r\n    crec_copy(J, trdst, trsrc, trlen, NULL);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_fill(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef trdst = J->base[0], trlen = J->base[1], trfill = J->base[2];\r\n  if (trdst && trlen) {\r\n    CTSize step = 1;\r\n    if (tviscdata(&rd->argv[0])) {  /* Get alignment of original destination. */\r\n      CTSize sz;\r\n      CType *ct = ctype_raw(cts, cdataV(&rd->argv[0])->ctypeid);\r\n      if (ctype_isptr(ct->info))\r\n\tct = ctype_rawchild(cts, ct);\r\n      step = (1u<<ctype_align(lj_ctype_info(cts, ctype_typeid(cts, ct), &sz)));\r\n    }\r\n    trdst = crec_ct_tv(J, ctype_get(cts, CTID_P_VOID), 0, trdst, &rd->argv[0]);\r\n    trlen = crec_toint(J, cts, trlen, &rd->argv[1]);\r\n    if (trfill)\r\n      trfill = crec_toint(J, cts, trfill, &rd->argv[2]);\r\n    else\r\n      trfill = lj_ir_kint(J, 0);\r\n    rd->nres = 0;\r\n    crec_fill(J, trdst, trlen, trfill, step);\r\n  }  /* else: interpreter will throw. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_typeof(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (tref_iscdata(J->base[0])) {\r\n    TRef trid = lj_ir_kint(J, argv2ctype(J, J->base[0], &rd->argv[0]));\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA),\r\n\t\t\tlj_ir_kint(J, CTID_CTYPEID), trid);\r\n  } else {\r\n    setfuncV(J->L, &J->errinfo, J->fn);\r\n    lj_trace_err_info(J, LJ_TRERR_NYIFFU);\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_istype(jit_State *J, RecordFFData *rd)\r\n{\r\n  argv2ctype(J, J->base[0], &rd->argv[0]);\r\n  if (tref_iscdata(J->base[1])) {\r\n    argv2ctype(J, J->base[1], &rd->argv[1]);\r\n    J->postproc = LJ_POST_FIXBOOL;\r\n    J->base[0] = TREF_TRUE;\r\n  } else {\r\n    J->base[0] = TREF_FALSE;\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_abi(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (tref_isstr(J->base[0])) {\r\n    /* Specialize to the ABI string to make the boolean result a constant. */\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[0], lj_ir_kstr(J, strV(&rd->argv[0])));\r\n    J->postproc = LJ_POST_FIXBOOL;\r\n    J->base[0] = TREF_TRUE;\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n}\r\n\r\n/* Record ffi.sizeof(), ffi.alignof(), ffi.offsetof(). */\r\nvoid LJ_FASTCALL recff_ffi_xof(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTypeID id = argv2ctype(J, J->base[0], &rd->argv[0]);\r\n  if (rd->data == FF_ffi_sizeof) {\r\n    CType *ct = lj_ctype_rawref(ctype_ctsG(J2G(J)), id);\r\n    if (ctype_isvltype(ct->info))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  } else if (rd->data == FF_ffi_offsetof) {  /* Specialize to the field name. */\r\n    if (!tref_isstr(J->base[1]))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    emitir(IRTG(IR_EQ, IRT_STR), J->base[1], lj_ir_kstr(J, strV(&rd->argv[1])));\r\n    rd->nres = 3;  /* Just in case. */\r\n  }\r\n  J->postproc = LJ_POST_FIXCONST;\r\n  J->base[0] = J->base[1] = J->base[2] = TREF_NIL;\r\n}\r\n\r\nvoid LJ_FASTCALL recff_ffi_gc(jit_State *J, RecordFFData *rd)\r\n{\r\n  argv2cdata(J, J->base[0], &rd->argv[0]);\r\n  if (!J->base[1])\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  crec_finalizer(J, J->base[0], J->base[1], &rd->argv[1]);\r\n}\r\n\r\n/* -- 64 bit bit.* library functions -------------------------------------- */\r\n\r\n/* Determine bit operation type from argument type. */\r\nstatic CTypeID crec_bit64_type(CTState *cts, cTValue *tv)\r\n{\r\n  if (tviscdata(tv)) {\r\n    CType *ct = lj_ctype_rawref(cts, cdataV(tv)->ctypeid);\r\n    if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n    if ((ct->info & (CTMASK_NUM|CTF_BOOL|CTF_FP|CTF_UNSIGNED)) ==\r\n\tCTINFO(CT_NUM, CTF_UNSIGNED) && ct->size == 8)\r\n      return CTID_UINT64;  /* Use uint64_t, since it has the highest rank. */\r\n    return CTID_INT64;  /* Otherwise use int64_t. */\r\n  }\r\n  return 0;  /* Use regular 32 bit ops. */\r\n}\r\n\r\nvoid LJ_FASTCALL recff_bit64_tobit(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  TRef tr = crec_ct_tv(J, ctype_get(cts, CTID_INT64), 0,\r\n\t\t       J->base[0], &rd->argv[0]);\r\n  if (!tref_isinteger(tr))\r\n    tr = emitconv(tr, IRT_INT, tref_type(tr), 0);\r\n  J->base[0] = tr;\r\n}\r\n\r\nint LJ_FASTCALL recff_bit64_unary(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID id = crec_bit64_type(cts, &rd->argv[0]);\r\n  if (id) {\r\n    TRef tr = crec_ct_tv(J, ctype_get(cts, id), 0, J->base[0], &rd->argv[0]);\r\n    tr = emitir(IRT(rd->data, id-CTID_INT64+IRT_I64), tr, 0);\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nint LJ_FASTCALL recff_bit64_nary(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID id = 0;\r\n  MSize i;\r\n  for (i = 0; J->base[i] != 0; i++) {\r\n    CTypeID aid = crec_bit64_type(cts, &rd->argv[i]);\r\n    if (id < aid) id = aid;  /* Determine highest type rank of all arguments. */\r\n  }\r\n  if (id) {\r\n    CType *ct = ctype_get(cts, id);\r\n    uint32_t ot = IRT(rd->data, id-CTID_INT64+IRT_I64);\r\n    TRef tr = crec_ct_tv(J, ct, 0, J->base[0], &rd->argv[0]);\r\n    for (i = 1; J->base[i] != 0; i++) {\r\n      TRef tr2 = crec_ct_tv(J, ct, 0, J->base[i], &rd->argv[i]);\r\n      tr = emitir(ot, tr, tr2);\r\n    }\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nint LJ_FASTCALL recff_bit64_shift(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID id;\r\n  TRef tsh = 0;\r\n  if (J->base[0] && tref_iscdata(J->base[1])) {\r\n    tsh = crec_ct_tv(J, ctype_get(cts, CTID_INT64), 0,\r\n\t\t     J->base[1], &rd->argv[1]);\r\n    if (!tref_isinteger(tsh))\r\n      tsh = emitconv(tsh, IRT_INT, tref_type(tsh), 0);\r\n    J->base[1] = tsh;\r\n  }\r\n  id = crec_bit64_type(cts, &rd->argv[0]);\r\n  if (id) {\r\n    TRef tr = crec_ct_tv(J, ctype_get(cts, id), 0, J->base[0], &rd->argv[0]);\r\n    uint32_t op = rd->data;\r\n    if (!tsh) tsh = lj_opt_narrow_tobit(J, J->base[1]);\r\n    if (!(op < IR_BROL ? LJ_TARGET_MASKSHIFT : LJ_TARGET_MASKROT) &&\r\n\t!tref_isk(tsh))\r\n      tsh = emitir(IRTI(IR_BAND), tsh, lj_ir_kint(J, 63));\r\n#ifdef LJ_TARGET_UNIFYROT\r\n      if (op == (LJ_TARGET_UNIFYROT == 1 ? IR_BROR : IR_BROL)) {\r\n\top = LJ_TARGET_UNIFYROT == 1 ? IR_BROL : IR_BROR;\r\n\ttsh = emitir(IRTI(IR_NEG), tsh, tsh);\r\n      }\r\n#endif\r\n    tr = emitir(IRT(op, id-CTID_INT64+IRT_I64), tr, tsh);\r\n    J->base[0] = emitir(IRTG(IR_CNEWI, IRT_CDATA), lj_ir_kint(J, id), tr);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nTRef recff_bit64_tohex(jit_State *J, RecordFFData *rd, TRef hdr)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CTypeID id = crec_bit64_type(cts, &rd->argv[0]);\r\n  TRef tr, trsf = J->base[1];\r\n  SFormat sf = (STRFMT_UINT|STRFMT_T_HEX);\r\n  int32_t n;\r\n  if (trsf) {\r\n    CTypeID id2 = 0;\r\n    n = (int32_t)lj_carith_check64(J->L, 2, &id2);\r\n    if (id2)\r\n      trsf = crec_ct_tv(J, ctype_get(cts, CTID_INT32), 0, trsf, &rd->argv[1]);\r\n    else\r\n      trsf = lj_opt_narrow_tobit(J, trsf);\r\n    emitir(IRTGI(IR_EQ), trsf, lj_ir_kint(J, n));  /* Specialize to n. */\r\n  } else {\r\n    n = id ? 16 : 8;\r\n  }\r\n  if (n < 0) { n = -n; sf |= STRFMT_F_UPPER; }\r\n  sf |= ((SFormat)((n+1)&255) << STRFMT_SH_PREC);\r\n  if (id) {\r\n    tr = crec_ct_tv(J, ctype_get(cts, id), 0, J->base[0], &rd->argv[0]);\r\n    if (n < 16)\r\n      tr = emitir(IRT(IR_BAND, IRT_U64), tr,\r\n\t\t  lj_ir_kint64(J, ((uint64_t)1 << 4*n)-1));\r\n  } else {\r\n    tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n    if (n < 8)\r\n      tr = emitir(IRTI(IR_BAND), tr, lj_ir_kint(J, (int32_t)((1u << 4*n)-1)));\r\n    tr = emitconv(tr, IRT_U64, IRT_INT, 0);  /* No sign-extension. */\r\n    lj_needsplit(J);\r\n  }\r\n  return lj_ir_call(J, IRCALL_lj_strfmt_putfxint, hdr, lj_ir_kint(J, sf), tr);\r\n}\r\n\r\n/* -- Miscellaneous library functions ------------------------------------- */\r\n\r\nvoid LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd)\r\n{\r\n  CTState *cts = ctype_ctsG(J2G(J));\r\n  CType *d, *ct = lj_ctype_rawref(cts, cdataV(&rd->argv[0])->ctypeid);\r\n  if (ctype_isenum(ct->info)) ct = ctype_child(cts, ct);\r\n  if (ctype_isnum(ct->info) || ctype_iscomplex(ct->info)) {\r\n    if (ctype_isinteger_or_bool(ct->info) && ct->size <= 4 &&\r\n\t!(ct->size == 4 && (ct->info & CTF_UNSIGNED)))\r\n      d = ctype_get(cts, CTID_INT32);\r\n    else\r\n      d = ctype_get(cts, CTID_DOUBLE);\r\n    J->base[0] = crec_ct_tv(J, d, 0, J->base[0], &rd->argv[0]);\r\n  } else {\r\n    J->base[0] = TREF_NIL;\r\n  }\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n#undef emitconv\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_crecord.h",
    "content": "/*\r\n** Trace recorder for C data operations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CRECORD_H\r\n#define _LJ_CRECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ffrecord.h\"\r\n\r\n#if LJ_HASJIT && LJ_HASFFI\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_index(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_call(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_cdata_arith(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_clib_index(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_new(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_errno(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_string(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_copy(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_fill(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_typeof(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_istype(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_abi(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_xof(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC void LJ_FASTCALL recff_ffi_gc(jit_State *J, RecordFFData *rd);\r\n\r\nLJ_FUNC void LJ_FASTCALL recff_bit64_tobit(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC int LJ_FASTCALL recff_bit64_unary(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC int LJ_FASTCALL recff_bit64_nary(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC int LJ_FASTCALL recff_bit64_shift(jit_State *J, RecordFFData *rd);\r\nLJ_FUNC TRef recff_bit64_tohex(jit_State *J, RecordFFData *rd, TRef hdr);\r\n\r\nLJ_FUNC void LJ_FASTCALL lj_crecord_tonumber(jit_State *J, RecordFFData *rd);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ctype.c",
    "content": "/*\r\n** C type management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_ccallback.h\"\r\n\r\n/* -- C type definitions -------------------------------------------------- */\r\n\r\n/* Predefined typedefs. */\r\n#define CTTDDEF(_) \\\r\n  /* Vararg handling. */ \\\r\n  _(\"va_list\",\t\t\tP_VOID) \\\r\n  _(\"__builtin_va_list\",\tP_VOID) \\\r\n  _(\"__gnuc_va_list\",\t\tP_VOID) \\\r\n  /* From stddef.h. */ \\\r\n  _(\"ptrdiff_t\",\t\tINT_PSZ) \\\r\n  _(\"size_t\",\t\t\tUINT_PSZ) \\\r\n  _(\"wchar_t\",\t\t\tWCHAR) \\\r\n  /* Subset of stdint.h. */ \\\r\n  _(\"int8_t\",\t\t\tINT8) \\\r\n  _(\"int16_t\",\t\t\tINT16) \\\r\n  _(\"int32_t\",\t\t\tINT32) \\\r\n  _(\"int64_t\",\t\t\tINT64) \\\r\n  _(\"uint8_t\",\t\t\tUINT8) \\\r\n  _(\"uint16_t\",\t\t\tUINT16) \\\r\n  _(\"uint32_t\",\t\t\tUINT32) \\\r\n  _(\"uint64_t\",\t\t\tUINT64) \\\r\n  _(\"intptr_t\",\t\t\tINT_PSZ) \\\r\n  _(\"uintptr_t\",\t\tUINT_PSZ) \\\r\n  /* End of typedef list. */\r\n\r\n/* Keywords (only the ones we actually care for). */\r\n#define CTKWDEF(_) \\\r\n  /* Type specifiers. */ \\\r\n  _(\"void\",\t\t-1,\tCTOK_VOID) \\\r\n  _(\"_Bool\",\t\t0,\tCTOK_BOOL) \\\r\n  _(\"bool\",\t\t1,\tCTOK_BOOL) \\\r\n  _(\"char\",\t\t1,\tCTOK_CHAR) \\\r\n  _(\"int\",\t\t4,\tCTOK_INT) \\\r\n  _(\"__int8\",\t\t1,\tCTOK_INT) \\\r\n  _(\"__int16\",\t\t2,\tCTOK_INT) \\\r\n  _(\"__int32\",\t\t4,\tCTOK_INT) \\\r\n  _(\"__int64\",\t\t8,\tCTOK_INT) \\\r\n  _(\"float\",\t\t4,\tCTOK_FP) \\\r\n  _(\"double\",\t\t8,\tCTOK_FP) \\\r\n  _(\"long\",\t\t0,\tCTOK_LONG) \\\r\n  _(\"short\",\t\t0,\tCTOK_SHORT) \\\r\n  _(\"_Complex\",\t\t0,\tCTOK_COMPLEX) \\\r\n  _(\"complex\",\t\t0,\tCTOK_COMPLEX) \\\r\n  _(\"__complex\",\t0,\tCTOK_COMPLEX) \\\r\n  _(\"__complex__\",\t0,\tCTOK_COMPLEX) \\\r\n  _(\"signed\",\t\t0,\tCTOK_SIGNED) \\\r\n  _(\"__signed\",\t\t0,\tCTOK_SIGNED) \\\r\n  _(\"__signed__\",\t0,\tCTOK_SIGNED) \\\r\n  _(\"unsigned\",\t\t0,\tCTOK_UNSIGNED) \\\r\n  /* Type qualifiers. */ \\\r\n  _(\"const\",\t\t0,\tCTOK_CONST) \\\r\n  _(\"__const\",\t\t0,\tCTOK_CONST) \\\r\n  _(\"__const__\",\t0,\tCTOK_CONST) \\\r\n  _(\"volatile\",\t\t0,\tCTOK_VOLATILE) \\\r\n  _(\"__volatile\",\t0,\tCTOK_VOLATILE) \\\r\n  _(\"__volatile__\",\t0,\tCTOK_VOLATILE) \\\r\n  _(\"restrict\",\t\t0,\tCTOK_RESTRICT) \\\r\n  _(\"__restrict\",\t0,\tCTOK_RESTRICT) \\\r\n  _(\"__restrict__\",\t0,\tCTOK_RESTRICT) \\\r\n  _(\"inline\",\t\t0,\tCTOK_INLINE) \\\r\n  _(\"__inline\",\t\t0,\tCTOK_INLINE) \\\r\n  _(\"__inline__\",\t0,\tCTOK_INLINE) \\\r\n  /* Storage class specifiers. */ \\\r\n  _(\"typedef\",\t\t0,\tCTOK_TYPEDEF) \\\r\n  _(\"extern\",\t\t0,\tCTOK_EXTERN) \\\r\n  _(\"static\",\t\t0,\tCTOK_STATIC) \\\r\n  _(\"auto\",\t\t0,\tCTOK_AUTO) \\\r\n  _(\"register\",\t\t0,\tCTOK_REGISTER) \\\r\n  /* GCC Attributes. */ \\\r\n  _(\"__extension__\",\t0,\tCTOK_EXTENSION) \\\r\n  _(\"__attribute\",\t0,\tCTOK_ATTRIBUTE) \\\r\n  _(\"__attribute__\",\t0,\tCTOK_ATTRIBUTE) \\\r\n  _(\"asm\",\t\t0,\tCTOK_ASM) \\\r\n  _(\"__asm\",\t\t0,\tCTOK_ASM) \\\r\n  _(\"__asm__\",\t\t0,\tCTOK_ASM) \\\r\n  /* MSVC Attributes. */ \\\r\n  _(\"__declspec\",\t0,\tCTOK_DECLSPEC) \\\r\n  _(\"__cdecl\",\t\tCTCC_CDECL,\tCTOK_CCDECL) \\\r\n  _(\"__thiscall\",\tCTCC_THISCALL,\tCTOK_CCDECL) \\\r\n  _(\"__fastcall\",\tCTCC_FASTCALL,\tCTOK_CCDECL) \\\r\n  _(\"__stdcall\",\tCTCC_STDCALL,\tCTOK_CCDECL) \\\r\n  _(\"__ptr32\",\t\t4,\tCTOK_PTRSZ) \\\r\n  _(\"__ptr64\",\t\t8,\tCTOK_PTRSZ) \\\r\n  /* Other type specifiers. */ \\\r\n  _(\"struct\",\t\t0,\tCTOK_STRUCT) \\\r\n  _(\"union\",\t\t0,\tCTOK_UNION) \\\r\n  _(\"enum\",\t\t0,\tCTOK_ENUM) \\\r\n  /* Operators. */ \\\r\n  _(\"sizeof\",\t\t0,\tCTOK_SIZEOF) \\\r\n  _(\"__alignof\",\t0,\tCTOK_ALIGNOF) \\\r\n  _(\"__alignof__\",\t0,\tCTOK_ALIGNOF) \\\r\n  /* End of keyword list. */\r\n\r\n/* Type info for predefined types. Size merged in. */\r\nstatic CTInfo lj_ctype_typeinfo[] = {\r\n#define CTTYINFODEF(id, sz, ct, info)\tCTINFO((ct),(((sz)&0x3fu)<<10)+(info)),\r\n#define CTTDINFODEF(name, id)\t\tCTINFO(CT_TYPEDEF, CTID_##id),\r\n#define CTKWINFODEF(name, sz, kw)\tCTINFO(CT_KW,(((sz)&0x3fu)<<10)+(kw)),\r\nCTTYDEF(CTTYINFODEF)\r\nCTTDDEF(CTTDINFODEF)\r\nCTKWDEF(CTKWINFODEF)\r\n#undef CTTYINFODEF\r\n#undef CTTDINFODEF\r\n#undef CTKWINFODEF\r\n  0\r\n};\r\n\r\n/* Predefined type names collected in a single string. */\r\nstatic const char * const lj_ctype_typenames =\r\n#define CTTDNAMEDEF(name, id)\t\tname \"\\0\"\r\n#define CTKWNAMEDEF(name, sz, cds)\tname \"\\0\"\r\nCTTDDEF(CTTDNAMEDEF)\r\nCTKWDEF(CTKWNAMEDEF)\r\n#undef CTTDNAMEDEF\r\n#undef CTKWNAMEDEF\r\n;\r\n\r\n#define CTTYPEINFO_NUM\t\t(sizeof(lj_ctype_typeinfo)/sizeof(CTInfo)-1)\r\n#ifdef LUAJIT_CTYPE_CHECK_ANCHOR\r\n#define CTTYPETAB_MIN\t\tCTTYPEINFO_NUM\r\n#else\r\n#define CTTYPETAB_MIN\t\t128\r\n#endif\r\n\r\n/* -- C type interning ---------------------------------------------------- */\r\n\r\n#define ct_hashtype(info, size)\t(hashrot(info, size) & CTHASH_MASK)\r\n#define ct_hashname(name) \\\r\n  (hashrot(u32ptr(name), u32ptr(name) + HASH_BIAS) & CTHASH_MASK)\r\n\r\n/* Create new type element. */\r\nCTypeID lj_ctype_new(CTState *cts, CType **ctp)\r\n{\r\n  CTypeID id = cts->top;\r\n  CType *ct;\r\n  lua_assert(cts->L);\r\n  if (LJ_UNLIKELY(id >= cts->sizetab)) {\r\n    if (id >= CTID_MAX) lj_err_msg(cts->L, LJ_ERR_TABOV);\r\n#ifdef LUAJIT_CTYPE_CHECK_ANCHOR\r\n    ct = lj_mem_newvec(cts->L, id+1, CType);\r\n    memcpy(ct, cts->tab, id*sizeof(CType));\r\n    memset(cts->tab, 0, id*sizeof(CType));\r\n    lj_mem_freevec(cts->g, cts->tab, cts->sizetab, CType);\r\n    cts->tab = ct;\r\n    cts->sizetab = id+1;\r\n#else\r\n    lj_mem_growvec(cts->L, cts->tab, cts->sizetab, CTID_MAX, CType);\r\n#endif\r\n  }\r\n  cts->top = id+1;\r\n  *ctp = ct = &cts->tab[id];\r\n  ct->info = 0;\r\n  ct->size = 0;\r\n  ct->sib = 0;\r\n  ct->next = 0;\r\n  setgcrefnull(ct->name);\r\n  return id;\r\n}\r\n\r\n/* Intern a type element. */\r\nCTypeID lj_ctype_intern(CTState *cts, CTInfo info, CTSize size)\r\n{\r\n  uint32_t h = ct_hashtype(info, size);\r\n  CTypeID id = cts->hash[h];\r\n  lua_assert(cts->L);\r\n  while (id) {\r\n    CType *ct = ctype_get(cts, id);\r\n    if (ct->info == info && ct->size == size)\r\n      return id;\r\n    id = ct->next;\r\n  }\r\n  id = cts->top;\r\n  if (LJ_UNLIKELY(id >= cts->sizetab)) {\r\n    if (id >= CTID_MAX) lj_err_msg(cts->L, LJ_ERR_TABOV);\r\n    lj_mem_growvec(cts->L, cts->tab, cts->sizetab, CTID_MAX, CType);\r\n  }\r\n  cts->top = id+1;\r\n  cts->tab[id].info = info;\r\n  cts->tab[id].size = size;\r\n  cts->tab[id].sib = 0;\r\n  cts->tab[id].next = cts->hash[h];\r\n  setgcrefnull(cts->tab[id].name);\r\n  cts->hash[h] = (CTypeID1)id;\r\n  return id;\r\n}\r\n\r\n/* Add type element to hash table. */\r\nstatic void ctype_addtype(CTState *cts, CType *ct, CTypeID id)\r\n{\r\n  uint32_t h = ct_hashtype(ct->info, ct->size);\r\n  ct->next = cts->hash[h];\r\n  cts->hash[h] = (CTypeID1)id;\r\n}\r\n\r\n/* Add named element to hash table. */\r\nvoid lj_ctype_addname(CTState *cts, CType *ct, CTypeID id)\r\n{\r\n  uint32_t h = ct_hashname(gcref(ct->name));\r\n  ct->next = cts->hash[h];\r\n  cts->hash[h] = (CTypeID1)id;\r\n}\r\n\r\n/* Get a C type by name, matching the type mask. */\r\nCTypeID lj_ctype_getname(CTState *cts, CType **ctp, GCstr *name, uint32_t tmask)\r\n{\r\n  CTypeID id = cts->hash[ct_hashname(name)];\r\n  while (id) {\r\n    CType *ct = ctype_get(cts, id);\r\n    if (gcref(ct->name) == obj2gco(name) &&\r\n\t((tmask >> ctype_type(ct->info)) & 1)) {\r\n      *ctp = ct;\r\n      return id;\r\n    }\r\n    id = ct->next;\r\n  }\r\n  *ctp = &cts->tab[0];  /* Simplify caller logic. ctype_get() would assert. */\r\n  return 0;\r\n}\r\n\r\n/* Get a struct/union/enum/function field by name. */\r\nCType *lj_ctype_getfieldq(CTState *cts, CType *ct, GCstr *name, CTSize *ofs,\r\n\t\t\t  CTInfo *qual)\r\n{\r\n  while (ct->sib) {\r\n    ct = ctype_get(cts, ct->sib);\r\n    if (gcref(ct->name) == obj2gco(name)) {\r\n      *ofs = ct->size;\r\n      return ct;\r\n    }\r\n    if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {\r\n      CType *fct, *cct = ctype_child(cts, ct);\r\n      CTInfo q = 0;\r\n      while (ctype_isattrib(cct->info)) {\r\n\tif (ctype_attrib(cct->info) == CTA_QUAL) q |= cct->size;\r\n\tcct = ctype_child(cts, cct);\r\n      }\r\n      fct = lj_ctype_getfieldq(cts, cct, name, ofs, qual);\r\n      if (fct) {\r\n\tif (qual) *qual |= q;\r\n\t*ofs += ct->size;\r\n\treturn fct;\r\n      }\r\n    }\r\n  }\r\n  return NULL;  /* Not found. */\r\n}\r\n\r\n/* -- C type information -------------------------------------------------- */\r\n\r\n/* Follow references and get raw type for a C type ID. */\r\nCType *lj_ctype_rawref(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  while (ctype_isattrib(ct->info) || ctype_isref(ct->info))\r\n    ct = ctype_child(cts, ct);\r\n  return ct;\r\n}\r\n\r\n/* Get size for a C type ID. Does NOT support VLA/VLS. */\r\nCTSize lj_ctype_size(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_raw(cts, id);\r\n  return ctype_hassize(ct->info) ? ct->size : CTSIZE_INVALID;\r\n}\r\n\r\n/* Get size for a variable-length C type. Does NOT support other C types. */\r\nCTSize lj_ctype_vlsize(CTState *cts, CType *ct, CTSize nelem)\r\n{\r\n  uint64_t xsz = 0;\r\n  if (ctype_isstruct(ct->info)) {\r\n    CTypeID arrid = 0, fid = ct->sib;\r\n    xsz = ct->size;  /* Add the struct size. */\r\n    while (fid) {\r\n      CType *ctf = ctype_get(cts, fid);\r\n      if (ctype_type(ctf->info) == CT_FIELD)\r\n\tarrid = ctype_cid(ctf->info);  /* Remember last field of VLS. */\r\n      fid = ctf->sib;\r\n    }\r\n    ct = ctype_raw(cts, arrid);\r\n  }\r\n  lua_assert(ctype_isvlarray(ct->info));  /* Must be a VLA. */\r\n  ct = ctype_rawchild(cts, ct);  /* Get array element. */\r\n  lua_assert(ctype_hassize(ct->info));\r\n  /* Calculate actual size of VLA and check for overflow. */\r\n  xsz += (uint64_t)ct->size * nelem;\r\n  return xsz < 0x80000000u ? (CTSize)xsz : CTSIZE_INVALID;\r\n}\r\n\r\n/* Get type, qualifiers, size and alignment for a C type ID. */\r\nCTInfo lj_ctype_info(CTState *cts, CTypeID id, CTSize *szp)\r\n{\r\n  CTInfo qual = 0;\r\n  CType *ct = ctype_get(cts, id);\r\n  for (;;) {\r\n    CTInfo info = ct->info;\r\n    if (ctype_isenum(info)) {\r\n      /* Follow child. Need to look at its attributes, too. */\r\n    } else if (ctype_isattrib(info)) {\r\n      if (ctype_isxattrib(info, CTA_QUAL))\r\n\tqual |= ct->size;\r\n      else if (ctype_isxattrib(info, CTA_ALIGN) && !(qual & CTFP_ALIGNED))\r\n\tqual |= CTFP_ALIGNED + CTALIGN(ct->size);\r\n    } else {\r\n      if (!(qual & CTFP_ALIGNED)) qual |= (info & CTF_ALIGN);\r\n      qual |= (info & ~(CTF_ALIGN|CTMASK_CID));\r\n      lua_assert(ctype_hassize(info) || ctype_isfunc(info));\r\n      *szp = ctype_isfunc(info) ? CTSIZE_INVALID : ct->size;\r\n      break;\r\n    }\r\n    ct = ctype_get(cts, ctype_cid(info));\r\n  }\r\n  return qual;\r\n}\r\n\r\n/* Get ctype metamethod. */\r\ncTValue *lj_ctype_meta(CTState *cts, CTypeID id, MMS mm)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  cTValue *tv;\r\n  while (ctype_isattrib(ct->info) || ctype_isref(ct->info)) {\r\n    id = ctype_cid(ct->info);\r\n    ct = ctype_get(cts, id);\r\n  }\r\n  if (ctype_isptr(ct->info) &&\r\n      ctype_isfunc(ctype_get(cts, ctype_cid(ct->info))->info))\r\n    tv = lj_tab_getstr(cts->miscmap, &cts->g->strempty);\r\n  else\r\n    tv = lj_tab_getinth(cts->miscmap, -(int32_t)id);\r\n  if (tv && tvistab(tv) &&\r\n      (tv = lj_tab_getstr(tabV(tv), mmname_str(cts->g, mm))) && !tvisnil(tv))\r\n    return tv;\r\n  return NULL;\r\n}\r\n\r\n/* -- C type representation ----------------------------------------------- */\r\n\r\n/* Fixed max. length of a C type representation. */\r\n#define CTREPR_MAX\t\t512\r\n\r\ntypedef struct CTRepr {\r\n  char *pb, *pe;\r\n  CTState *cts;\r\n  lua_State *L;\r\n  int needsp;\r\n  int ok;\r\n  char buf[CTREPR_MAX];\r\n} CTRepr;\r\n\r\n/* Prepend string. */\r\nstatic void ctype_prepstr(CTRepr *ctr, const char *str, MSize len)\r\n{\r\n  char *p = ctr->pb;\r\n  if (ctr->buf + len+1 > p) { ctr->ok = 0; return; }\r\n  if (ctr->needsp) *--p = ' ';\r\n  ctr->needsp = 1;\r\n  p -= len;\r\n  while (len-- > 0) p[len] = str[len];\r\n  ctr->pb = p;\r\n}\r\n\r\n#define ctype_preplit(ctr, str)\tctype_prepstr((ctr), \"\" str, sizeof(str)-1)\r\n\r\n/* Prepend char. */\r\nstatic void ctype_prepc(CTRepr *ctr, int c)\r\n{\r\n  if (ctr->buf >= ctr->pb) { ctr->ok = 0; return; }\r\n  *--ctr->pb = c;\r\n}\r\n\r\n/* Prepend number. */\r\nstatic void ctype_prepnum(CTRepr *ctr, uint32_t n)\r\n{\r\n  char *p = ctr->pb;\r\n  if (ctr->buf + 10+1 > p) { ctr->ok = 0; return; }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  ctr->pb = p;\r\n  ctr->needsp = 0;\r\n}\r\n\r\n/* Append char. */\r\nstatic void ctype_appc(CTRepr *ctr, int c)\r\n{\r\n  if (ctr->pe >= ctr->buf + CTREPR_MAX) { ctr->ok = 0; return; }\r\n  *ctr->pe++ = c;\r\n}\r\n\r\n/* Append number. */\r\nstatic void ctype_appnum(CTRepr *ctr, uint32_t n)\r\n{\r\n  char buf[10];\r\n  char *p = buf+sizeof(buf);\r\n  char *q = ctr->pe;\r\n  if (q > ctr->buf + CTREPR_MAX - 10) { ctr->ok = 0; return; }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  do { *q++ = *p++; } while (p < buf+sizeof(buf));\r\n  ctr->pe = q;\r\n}\r\n\r\n/* Prepend qualifiers. */\r\nstatic void ctype_prepqual(CTRepr *ctr, CTInfo info)\r\n{\r\n  if ((info & CTF_VOLATILE)) ctype_preplit(ctr, \"volatile\");\r\n  if ((info & CTF_CONST)) ctype_preplit(ctr, \"const\");\r\n}\r\n\r\n/* Prepend named type. */\r\nstatic void ctype_preptype(CTRepr *ctr, CType *ct, CTInfo qual, const char *t)\r\n{\r\n  if (gcref(ct->name)) {\r\n    GCstr *str = gco2str(gcref(ct->name));\r\n    ctype_prepstr(ctr, strdata(str), str->len);\r\n  } else {\r\n    if (ctr->needsp) ctype_prepc(ctr, ' ');\r\n    ctype_prepnum(ctr, ctype_typeid(ctr->cts, ct));\r\n    ctr->needsp = 1;\r\n  }\r\n  ctype_prepstr(ctr, t, (MSize)strlen(t));\r\n  ctype_prepqual(ctr, qual);\r\n}\r\n\r\nstatic void ctype_repr(CTRepr *ctr, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(ctr->cts, id);\r\n  CTInfo qual = 0;\r\n  int ptrto = 0;\r\n  for (;;) {\r\n    CTInfo info = ct->info;\r\n    CTSize size = ct->size;\r\n    switch (ctype_type(info)) {\r\n    case CT_NUM:\r\n      if ((info & CTF_BOOL)) {\r\n\tctype_preplit(ctr, \"bool\");\r\n      } else if ((info & CTF_FP)) {\r\n\tif (size == sizeof(double)) ctype_preplit(ctr, \"double\");\r\n\telse if (size == sizeof(float)) ctype_preplit(ctr, \"float\");\r\n\telse ctype_preplit(ctr, \"long double\");\r\n      } else if (size == 1) {\r\n\tif (!((info ^ CTF_UCHAR) & CTF_UNSIGNED)) ctype_preplit(ctr, \"char\");\r\n\telse if (CTF_UCHAR) ctype_preplit(ctr, \"signed char\");\r\n\telse ctype_preplit(ctr, \"unsigned char\");\r\n      } else if (size < 8) {\r\n\tif (size == 4) ctype_preplit(ctr, \"int\");\r\n\telse ctype_preplit(ctr, \"short\");\r\n\tif ((info & CTF_UNSIGNED)) ctype_preplit(ctr, \"unsigned\");\r\n      } else {\r\n\tctype_preplit(ctr, \"_t\");\r\n\tctype_prepnum(ctr, size*8);\r\n\tctype_preplit(ctr, \"int\");\r\n\tif ((info & CTF_UNSIGNED)) ctype_prepc(ctr, 'u');\r\n      }\r\n      ctype_prepqual(ctr, (qual|info));\r\n      return;\r\n    case CT_VOID:\r\n      ctype_preplit(ctr, \"void\");\r\n      ctype_prepqual(ctr, (qual|info));\r\n      return;\r\n    case CT_STRUCT:\r\n      ctype_preptype(ctr, ct, qual, (info & CTF_UNION) ? \"union\" : \"struct\");\r\n      return;\r\n    case CT_ENUM:\r\n      if (id == CTID_CTYPEID) {\r\n\tctype_preplit(ctr, \"ctype\");\r\n\treturn;\r\n      }\r\n      ctype_preptype(ctr, ct, qual, \"enum\");\r\n      return;\r\n    case CT_ATTRIB:\r\n      if (ctype_attrib(info) == CTA_QUAL) qual |= size;\r\n      break;\r\n    case CT_PTR:\r\n      if ((info & CTF_REF)) {\r\n\tctype_prepc(ctr, '&');\r\n      } else {\r\n\tctype_prepqual(ctr, (qual|info));\r\n\tif (LJ_64 && size == 4) ctype_preplit(ctr, \"__ptr32\");\r\n\tctype_prepc(ctr, '*');\r\n      }\r\n      qual = 0;\r\n      ptrto = 1;\r\n      ctr->needsp = 1;\r\n      break;\r\n    case CT_ARRAY:\r\n      if (ctype_isrefarray(info)) {\r\n\tctr->needsp = 1;\r\n\tif (ptrto) { ptrto = 0; ctype_prepc(ctr, '('); ctype_appc(ctr, ')'); }\r\n\tctype_appc(ctr, '[');\r\n\tif (size != CTSIZE_INVALID) {\r\n\t  CTSize csize = ctype_child(ctr->cts, ct)->size;\r\n\t  ctype_appnum(ctr, csize ? size/csize : 0);\r\n\t} else if ((info & CTF_VLA)) {\r\n\t  ctype_appc(ctr, '?');\r\n\t}\r\n\tctype_appc(ctr, ']');\r\n      } else if ((info & CTF_COMPLEX)) {\r\n\tif (size == 2*sizeof(float)) ctype_preplit(ctr, \"float\");\r\n\tctype_preplit(ctr, \"complex\");\r\n\treturn;\r\n      } else {\r\n\tctype_preplit(ctr, \")))\");\r\n\tctype_prepnum(ctr, size);\r\n\tctype_preplit(ctr, \"__attribute__((vector_size(\");\r\n      }\r\n      break;\r\n    case CT_FUNC:\r\n      ctr->needsp = 1;\r\n      if (ptrto) { ptrto = 0; ctype_prepc(ctr, '('); ctype_appc(ctr, ')'); }\r\n      ctype_appc(ctr, '(');\r\n      ctype_appc(ctr, ')');\r\n      break;\r\n    default:\r\n      lua_assert(0);\r\n      break;\r\n    }\r\n    ct = ctype_get(ctr->cts, ctype_cid(info));\r\n  }\r\n}\r\n\r\n/* Return a printable representation of a C type. */\r\nGCstr *lj_ctype_repr(lua_State *L, CTypeID id, GCstr *name)\r\n{\r\n  global_State *g = G(L);\r\n  CTRepr ctr;\r\n  ctr.pb = ctr.pe = &ctr.buf[CTREPR_MAX/2];\r\n  ctr.cts = ctype_ctsG(g);\r\n  ctr.L = L;\r\n  ctr.ok = 1;\r\n  ctr.needsp = 0;\r\n  if (name) ctype_prepstr(&ctr, strdata(name), name->len);\r\n  ctype_repr(&ctr, id);\r\n  if (LJ_UNLIKELY(!ctr.ok)) return lj_str_newlit(L, \"?\");\r\n  return lj_str_new(L, ctr.pb, ctr.pe - ctr.pb);\r\n}\r\n\r\n/* Convert int64_t/uint64_t to string with 'LL' or 'ULL' suffix. */\r\nGCstr *lj_ctype_repr_int64(lua_State *L, uint64_t n, int isunsigned)\r\n{\r\n  char buf[1+20+3];\r\n  char *p = buf+sizeof(buf);\r\n  int sign = 0;\r\n  *--p = 'L'; *--p = 'L';\r\n  if (isunsigned) {\r\n    *--p = 'U';\r\n  } else if ((int64_t)n < 0) {\r\n    n = (uint64_t)-(int64_t)n;\r\n    sign = 1;\r\n  }\r\n  do { *--p = (char)('0' + n % 10); } while (n /= 10);\r\n  if (sign) *--p = '-';\r\n  return lj_str_new(L, p, (size_t)(buf+sizeof(buf)-p));\r\n}\r\n\r\n/* Convert complex to string with 'i' or 'I' suffix. */\r\nGCstr *lj_ctype_repr_complex(lua_State *L, void *sp, CTSize size)\r\n{\r\n  char buf[2*STRFMT_MAXBUF_NUM+2+1], *p = buf;\r\n  TValue re, im;\r\n  if (size == 2*sizeof(double)) {\r\n    re.n = *(double *)sp; im.n = ((double *)sp)[1];\r\n  } else {\r\n    re.n = (double)*(float *)sp; im.n = (double)((float *)sp)[1];\r\n  }\r\n  p = lj_strfmt_wnum(p, &re);\r\n  if (!(im.u32.hi & 0x80000000u) || im.n != im.n) *p++ = '+';\r\n  p = lj_strfmt_wnum(p, &im);\r\n  *p = *(p-1) >= 'a' ? 'I' : 'i';\r\n  p++;\r\n  return lj_str_new(L, buf, p-buf);\r\n}\r\n\r\n/* -- C type state -------------------------------------------------------- */\r\n\r\n/* Initialize C type table and state. */\r\nCTState *lj_ctype_init(lua_State *L)\r\n{\r\n  CTState *cts = lj_mem_newt(L, sizeof(CTState), CTState);\r\n  CType *ct = lj_mem_newvec(L, CTTYPETAB_MIN, CType);\r\n  const char *name = lj_ctype_typenames;\r\n  CTypeID id;\r\n  memset(cts, 0, sizeof(CTState));\r\n  cts->tab = ct;\r\n  cts->sizetab = CTTYPETAB_MIN;\r\n  cts->top = CTTYPEINFO_NUM;\r\n  cts->L = NULL;\r\n  cts->g = G(L);\r\n  for (id = 0; id < CTTYPEINFO_NUM; id++, ct++) {\r\n    CTInfo info = lj_ctype_typeinfo[id];\r\n    ct->size = (CTSize)((int32_t)(info << 16) >> 26);\r\n    ct->info = info & 0xffff03ffu;\r\n    ct->sib = 0;\r\n    if (ctype_type(info) == CT_KW || ctype_istypedef(info)) {\r\n      size_t len = strlen(name);\r\n      GCstr *str = lj_str_new(L, name, len);\r\n      ctype_setname(ct, str);\r\n      name += len+1;\r\n      lj_ctype_addname(cts, ct, id);\r\n    } else {\r\n      setgcrefnull(ct->name);\r\n      ct->next = 0;\r\n      if (!ctype_isenum(info)) ctype_addtype(cts, ct, id);\r\n    }\r\n  }\r\n  setmref(G(L)->ctype_state, cts);\r\n  return cts;\r\n}\r\n\r\n/* Free C type table and state. */\r\nvoid lj_ctype_freestate(global_State *g)\r\n{\r\n  CTState *cts = ctype_ctsG(g);\r\n  if (cts) {\r\n    lj_ccallback_mcode_free(cts);\r\n    lj_mem_freevec(g, cts->tab, cts->sizetab, CType);\r\n    lj_mem_freevec(g, cts->cb.cbid, cts->cb.sizeid, CTypeID1);\r\n    lj_mem_freet(g, cts);\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ctype.h",
    "content": "/*\r\n** C type management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_CTYPE_H\r\n#define _LJ_CTYPE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n\r\n#if LJ_HASFFI\r\n\r\n/* -- C type definitions -------------------------------------------------- */\r\n\r\n/* C type numbers. Highest 4 bits of C type info. ORDER CT. */\r\nenum {\r\n  /* Externally visible types. */\r\n  CT_NUM,\t\t/* Integer or floating-point numbers. */\r\n  CT_STRUCT,\t\t/* Struct or union. */\r\n  CT_PTR,\t\t/* Pointer or reference. */\r\n  CT_ARRAY,\t\t/* Array or complex type. */\r\n  CT_MAYCONVERT = CT_ARRAY,\r\n  CT_VOID,\t\t/* Void type. */\r\n  CT_ENUM,\t\t/* Enumeration. */\r\n  CT_HASSIZE = CT_ENUM,  /* Last type where ct->size holds the actual size. */\r\n  CT_FUNC,\t\t/* Function. */\r\n  CT_TYPEDEF,\t\t/* Typedef. */\r\n  CT_ATTRIB,\t\t/* Miscellaneous attributes. */\r\n  /* Internal element types. */\r\n  CT_FIELD,\t\t/* Struct/union field or function parameter. */\r\n  CT_BITFIELD,\t\t/* Struct/union bitfield. */\r\n  CT_CONSTVAL,\t\t/* Constant value. */\r\n  CT_EXTERN,\t\t/* External reference. */\r\n  CT_KW\t\t\t/* Keyword. */\r\n};\r\n\r\nLJ_STATIC_ASSERT(((int)CT_PTR & (int)CT_ARRAY) == CT_PTR);\r\nLJ_STATIC_ASSERT(((int)CT_STRUCT & (int)CT_ARRAY) == CT_STRUCT);\r\n\r\n/*\r\n**  ---------- info ------------\r\n** |type      flags...  A   cid | size   |  sib  | next  | name  |\r\n** +----------------------------+--------+-------+-------+-------+--\r\n** |NUM       BFvcUL..  A       | size   |       | type  |       |\r\n** |STRUCT    ..vcU..V  A       | size   | field | name? | name? |\r\n** |PTR       ..vcR...  A   cid | size   |       | type  |       |\r\n** |ARRAY     VCvc...V  A   cid | size   |       | type  |       |\r\n** |VOID      ..vc....  A       | size   |       | type  |       |\r\n** |ENUM                A   cid | size   | const | name? | name? |\r\n** |FUNC      ....VS.. cc   cid | nargs  | field | name? | name? |\r\n** |TYPEDEF                 cid |        |       | name  | name  |\r\n** |ATTRIB        attrnum   cid | attr   | sib?  | type? |       |\r\n** |FIELD                   cid | offset | field |       | name? |\r\n** |BITFIELD  B.vcU csz bsz pos | offset | field |       | name? |\r\n** |CONSTVAL     c          cid | value  | const | name  | name  |\r\n** |EXTERN                  cid |        | sib?  | name  | name  |\r\n** |KW                      tok | size   |       | name  | name  |\r\n** +----------------------------+--------+-------+-------+-------+--\r\n**        ^^  ^^--- bits used for C type conversion dispatch\r\n*/\r\n\r\n/* C type info flags.     TFFArrrr  */\r\n#define CTF_BOOL\t0x08000000u\t/* Boolean: NUM, BITFIELD. */\r\n#define CTF_FP\t\t0x04000000u\t/* Floating-point: NUM. */\r\n#define CTF_CONST\t0x02000000u\t/* Const qualifier. */\r\n#define CTF_VOLATILE\t0x01000000u\t/* Volatile qualifier. */\r\n#define CTF_UNSIGNED\t0x00800000u\t/* Unsigned: NUM, BITFIELD. */\r\n#define CTF_LONG\t0x00400000u\t/* Long: NUM. */\r\n#define CTF_VLA\t\t0x00100000u\t/* Variable-length: ARRAY, STRUCT. */\r\n#define CTF_REF\t\t0x00800000u\t/* Reference: PTR. */\r\n#define CTF_VECTOR\t0x08000000u\t/* Vector: ARRAY. */\r\n#define CTF_COMPLEX\t0x04000000u\t/* Complex: ARRAY. */\r\n#define CTF_UNION\t0x00800000u\t/* Union: STRUCT. */\r\n#define CTF_VARARG\t0x00800000u\t/* Vararg: FUNC. */\r\n#define CTF_SSEREGPARM\t0x00400000u\t/* SSE register parameters: FUNC. */\r\n\r\n#define CTF_QUAL\t(CTF_CONST|CTF_VOLATILE)\r\n#define CTF_ALIGN\t(CTMASK_ALIGN<<CTSHIFT_ALIGN)\r\n#define CTF_UCHAR\t((char)-1 > 0 ? CTF_UNSIGNED : 0)\r\n\r\n/* Flags used in parser.  .F.Ammvf   cp->attr  */\r\n#define CTFP_ALIGNED\t0x00000001u\t/* cp->attr + ALIGN */\r\n#define CTFP_PACKED\t0x00000002u\t/* cp->attr */\r\n/*                        ...C...f   cp->fattr */\r\n#define CTFP_CCONV\t0x00000001u\t/* cp->fattr + CCONV/[SSE]REGPARM */\r\n\r\n/* C type info bitfields. */\r\n#define CTMASK_CID\t0x0000ffffu\t/* Max. 65536 type IDs. */\r\n#define CTMASK_NUM\t0xf0000000u\t/* Max. 16 type numbers. */\r\n#define CTSHIFT_NUM\t28\r\n#define CTMASK_ALIGN\t15\t\t/* Max. alignment is 2^15. */\r\n#define CTSHIFT_ALIGN\t16\r\n#define CTMASK_ATTRIB\t255\t\t/* Max. 256 attributes. */\r\n#define CTSHIFT_ATTRIB\t16\r\n#define CTMASK_CCONV\t3\t\t/* Max. 4 calling conventions. */\r\n#define CTSHIFT_CCONV\t16\r\n#define CTMASK_REGPARM\t3\t\t/* Max. 0-3 regparms. */\r\n#define CTSHIFT_REGPARM\t18\r\n/* Bitfields only used in parser. */\r\n#define CTMASK_VSIZEP\t15\t\t/* Max. vector size is 2^15. */\r\n#define CTSHIFT_VSIZEP\t4\r\n#define CTMASK_MSIZEP\t255\t\t/* Max. type size (via mode) is 128. */\r\n#define CTSHIFT_MSIZEP\t8\r\n\r\n/* Info bits for BITFIELD. Max. size of bitfield is 64 bits. */\r\n#define CTBSZ_MAX\t32\t\t/* Max. size of bitfield is 32 bit. */\r\n#define CTBSZ_FIELD\t127\t\t/* Temp. marker for regular field. */\r\n#define CTMASK_BITPOS\t127\r\n#define CTMASK_BITBSZ\t127\r\n#define CTMASK_BITCSZ\t127\r\n#define CTSHIFT_BITPOS\t0\r\n#define CTSHIFT_BITBSZ\t8\r\n#define CTSHIFT_BITCSZ\t16\r\n\r\n#define CTF_INSERT(info, field, val) \\\r\n  info = (info & ~(CTMASK_##field<<CTSHIFT_##field)) | \\\r\n\t  (((CTSize)(val) & CTMASK_##field) << CTSHIFT_##field)\r\n\r\n/* Calling conventions. ORDER CC */\r\nenum { CTCC_CDECL, CTCC_THISCALL, CTCC_FASTCALL, CTCC_STDCALL };\r\n\r\n/* Attribute numbers. */\r\nenum {\r\n  CTA_NONE,\t\t/* Ignored attribute. Must be zero. */\r\n  CTA_QUAL,\t\t/* Unmerged qualifiers. */\r\n  CTA_ALIGN,\t\t/* Alignment override. */\r\n  CTA_SUBTYPE,\t\t/* Transparent sub-type. */\r\n  CTA_REDIR,\t\t/* Redirected symbol name. */\r\n  CTA_BAD,\t\t/* To catch bad IDs. */\r\n  CTA__MAX\r\n};\r\n\r\n/* Special sizes. */\r\n#define CTSIZE_INVALID\t0xffffffffu\r\n\r\ntypedef uint32_t CTInfo;\t/* Type info. */\r\ntypedef uint32_t CTSize;\t/* Type size. */\r\ntypedef uint32_t CTypeID;\t/* Type ID. */\r\ntypedef uint16_t CTypeID1;\t/* Minimum-sized type ID. */\r\n\r\n/* C type table element. */\r\ntypedef struct CType {\r\n  CTInfo info;\t\t/* Type info. */\r\n  CTSize size;\t\t/* Type size or other info. */\r\n  CTypeID1 sib;\t\t/* Sibling element. */\r\n  CTypeID1 next;\t/* Next element in hash chain. */\r\n  GCRef name;\t\t/* Element name (GCstr). */\r\n} CType;\r\n\r\n#define CTHASH_SIZE\t128\t/* Number of hash anchors. */\r\n#define CTHASH_MASK\t(CTHASH_SIZE-1)\r\n\r\n/* Simplify target-specific configuration. Checked in lj_ccall.h. */\r\n#define CCALL_MAX_GPR\t\t8\r\n#define CCALL_MAX_FPR\t\t8\r\n\r\ntypedef LJ_ALIGN(8) union FPRCBArg { double d; float f[2]; } FPRCBArg;\r\n\r\n/* C callback state. Defined here, to avoid dragging in lj_ccall.h. */\r\n\r\ntypedef LJ_ALIGN(8) struct CCallback {\r\n  FPRCBArg fpr[CCALL_MAX_FPR];\t/* Arguments/results in FPRs. */\r\n  intptr_t gpr[CCALL_MAX_GPR];\t/* Arguments/results in GPRs. */\r\n  intptr_t *stack;\t\t/* Pointer to arguments on stack. */\r\n  void *mcode;\t\t\t/* Machine code for callback func. pointers. */\r\n  CTypeID1 *cbid;\t\t/* Callback type table. */\r\n  MSize sizeid;\t\t\t/* Size of callback type table. */\r\n  MSize topid;\t\t\t/* Highest unused callback type table slot. */\r\n  MSize slot;\t\t\t/* Current callback slot. */\r\n} CCallback;\r\n\r\n/* C type state. */\r\ntypedef struct CTState {\r\n  CType *tab;\t\t/* C type table. */\r\n  CTypeID top;\t\t/* Current top of C type table. */\r\n  MSize sizetab;\t/* Size of C type table. */\r\n  lua_State *L;\t\t/* Lua state (needed for errors and allocations). */\r\n  global_State *g;\t/* Global state. */\r\n  GCtab *finalizer;\t/* Map of cdata to finalizer. */\r\n  GCtab *miscmap;\t/* Map of -CTypeID to metatable and cb slot to func. */\r\n  CCallback cb;\t\t/* Temporary callback state. */\r\n  CTypeID1 hash[CTHASH_SIZE];  /* Hash anchors for C type table. */\r\n} CTState;\r\n\r\n#define CTINFO(ct, flags)\t(((CTInfo)(ct) << CTSHIFT_NUM) + (flags))\r\n#define CTALIGN(al)\t\t((CTSize)(al) << CTSHIFT_ALIGN)\r\n#define CTATTRIB(at)\t\t((CTInfo)(at) << CTSHIFT_ATTRIB)\r\n\r\n#define ctype_type(info)\t((info) >> CTSHIFT_NUM)\r\n#define ctype_cid(info)\t\t((CTypeID)((info) & CTMASK_CID))\r\n#define ctype_align(info)\t(((info) >> CTSHIFT_ALIGN) & CTMASK_ALIGN)\r\n#define ctype_attrib(info)\t(((info) >> CTSHIFT_ATTRIB) & CTMASK_ATTRIB)\r\n#define ctype_bitpos(info)\t(((info) >> CTSHIFT_BITPOS) & CTMASK_BITPOS)\r\n#define ctype_bitbsz(info)\t(((info) >> CTSHIFT_BITBSZ) & CTMASK_BITBSZ)\r\n#define ctype_bitcsz(info)\t(((info) >> CTSHIFT_BITCSZ) & CTMASK_BITCSZ)\r\n#define ctype_vsizeP(info)\t(((info) >> CTSHIFT_VSIZEP) & CTMASK_VSIZEP)\r\n#define ctype_msizeP(info)\t(((info) >> CTSHIFT_MSIZEP) & CTMASK_MSIZEP)\r\n#define ctype_cconv(info)\t(((info) >> CTSHIFT_CCONV) & CTMASK_CCONV)\r\n\r\n/* Simple type checks. */\r\n#define ctype_isnum(info)\t(ctype_type((info)) == CT_NUM)\r\n#define ctype_isvoid(info)\t(ctype_type((info)) == CT_VOID)\r\n#define ctype_isptr(info)\t(ctype_type((info)) == CT_PTR)\r\n#define ctype_isarray(info)\t(ctype_type((info)) == CT_ARRAY)\r\n#define ctype_isstruct(info)\t(ctype_type((info)) == CT_STRUCT)\r\n#define ctype_isfunc(info)\t(ctype_type((info)) == CT_FUNC)\r\n#define ctype_isenum(info)\t(ctype_type((info)) == CT_ENUM)\r\n#define ctype_istypedef(info)\t(ctype_type((info)) == CT_TYPEDEF)\r\n#define ctype_isattrib(info)\t(ctype_type((info)) == CT_ATTRIB)\r\n#define ctype_isfield(info)\t(ctype_type((info)) == CT_FIELD)\r\n#define ctype_isbitfield(info)\t(ctype_type((info)) == CT_BITFIELD)\r\n#define ctype_isconstval(info)\t(ctype_type((info)) == CT_CONSTVAL)\r\n#define ctype_isextern(info)\t(ctype_type((info)) == CT_EXTERN)\r\n#define ctype_hassize(info)\t(ctype_type((info)) <= CT_HASSIZE)\r\n\r\n/* Combined type and flag checks. */\r\n#define ctype_isinteger(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_BOOL|CTF_FP)) == CTINFO(CT_NUM, 0))\r\n#define ctype_isinteger_or_bool(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_FP)) == CTINFO(CT_NUM, 0))\r\n#define ctype_isbool(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_BOOL)) == CTINFO(CT_NUM, CTF_BOOL))\r\n#define ctype_isfp(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_FP)) == CTINFO(CT_NUM, CTF_FP))\r\n\r\n#define ctype_ispointer(info) \\\r\n  ((ctype_type(info) >> 1) == (CT_PTR >> 1))  /* Pointer or array. */\r\n#define ctype_isref(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_REF)) == CTINFO(CT_PTR, CTF_REF))\r\n\r\n#define ctype_isrefarray(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VECTOR|CTF_COMPLEX)) == CTINFO(CT_ARRAY, 0))\r\n#define ctype_isvector(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VECTOR)) == CTINFO(CT_ARRAY, CTF_VECTOR))\r\n#define ctype_iscomplex(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_COMPLEX)) == CTINFO(CT_ARRAY, CTF_COMPLEX))\r\n\r\n#define ctype_isvltype(info) \\\r\n  (((info) & ((CTMASK_NUM|CTF_VLA) - (2u<<CTSHIFT_NUM))) == \\\r\n   CTINFO(CT_STRUCT, CTF_VLA))  /* VL array or VL struct. */\r\n#define ctype_isvlarray(info) \\\r\n  (((info) & (CTMASK_NUM|CTF_VLA)) == CTINFO(CT_ARRAY, CTF_VLA))\r\n\r\n#define ctype_isxattrib(info, at) \\\r\n  (((info) & (CTMASK_NUM|CTATTRIB(CTMASK_ATTRIB))) == \\\r\n   CTINFO(CT_ATTRIB, CTATTRIB(at)))\r\n\r\n/* Target-dependent sizes and alignments. */\r\n#if LJ_64\r\n#define CTSIZE_PTR\t8\r\n#define CTALIGN_PTR\tCTALIGN(3)\r\n#else\r\n#define CTSIZE_PTR\t4\r\n#define CTALIGN_PTR\tCTALIGN(2)\r\n#endif\r\n\r\n#define CTINFO_REF(ref) \\\r\n  CTINFO(CT_PTR, (CTF_CONST|CTF_REF|CTALIGN_PTR) + (ref))\r\n\r\n#define CT_MEMALIGN\t3\t/* Alignment guaranteed by memory allocator. */\r\n\r\n/* -- Predefined types ---------------------------------------------------- */\r\n\r\n/* Target-dependent types. */\r\n#if LJ_TARGET_PPC\r\n#define CTTYDEFP(_) \\\r\n  _(LINT32,\t\t4,\tCT_NUM, CTF_LONG|CTALIGN(2))\r\n#else\r\n#define CTTYDEFP(_)\r\n#endif\r\n\r\n/* Common types. */\r\n#define CTTYDEF(_) \\\r\n  _(NONE,\t\t0,\tCT_ATTRIB, CTATTRIB(CTA_BAD)) \\\r\n  _(VOID,\t\t-1,\tCT_VOID, CTALIGN(0)) \\\r\n  _(CVOID,\t\t-1,\tCT_VOID, CTF_CONST|CTALIGN(0)) \\\r\n  _(BOOL,\t\t1,\tCT_NUM, CTF_BOOL|CTF_UNSIGNED|CTALIGN(0)) \\\r\n  _(CCHAR,\t\t1,\tCT_NUM, CTF_CONST|CTF_UCHAR|CTALIGN(0)) \\\r\n  _(INT8,\t\t1,\tCT_NUM, CTALIGN(0)) \\\r\n  _(UINT8,\t\t1,\tCT_NUM, CTF_UNSIGNED|CTALIGN(0)) \\\r\n  _(INT16,\t\t2,\tCT_NUM, CTALIGN(1)) \\\r\n  _(UINT16,\t\t2,\tCT_NUM, CTF_UNSIGNED|CTALIGN(1)) \\\r\n  _(INT32,\t\t4,\tCT_NUM, CTALIGN(2)) \\\r\n  _(UINT32,\t\t4,\tCT_NUM, CTF_UNSIGNED|CTALIGN(2)) \\\r\n  _(INT64,\t\t8,\tCT_NUM, CTF_LONG|CTALIGN(3)) \\\r\n  _(UINT64,\t\t8,\tCT_NUM, CTF_UNSIGNED|CTF_LONG|CTALIGN(3)) \\\r\n  _(FLOAT,\t\t4,\tCT_NUM, CTF_FP|CTALIGN(2)) \\\r\n  _(DOUBLE,\t\t8,\tCT_NUM, CTF_FP|CTALIGN(3)) \\\r\n  _(COMPLEX_FLOAT,\t8,\tCT_ARRAY, CTF_COMPLEX|CTALIGN(2)|CTID_FLOAT) \\\r\n  _(COMPLEX_DOUBLE,\t16,\tCT_ARRAY, CTF_COMPLEX|CTALIGN(3)|CTID_DOUBLE) \\\r\n  _(P_VOID,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_VOID) \\\r\n  _(P_CVOID,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_CVOID) \\\r\n  _(P_CCHAR,\tCTSIZE_PTR,\tCT_PTR, CTALIGN_PTR|CTID_CCHAR) \\\r\n  _(A_CCHAR,\t\t-1,\tCT_ARRAY, CTF_CONST|CTALIGN(0)|CTID_CCHAR) \\\r\n  _(CTYPEID,\t\t4,\tCT_ENUM, CTALIGN(2)|CTID_INT32) \\\r\n  CTTYDEFP(_) \\\r\n  /* End of type list. */\r\n\r\n/* Public predefined type IDs. */\r\nenum {\r\n#define CTTYIDDEF(id, sz, ct, info)\tCTID_##id,\r\nCTTYDEF(CTTYIDDEF)\r\n#undef CTTYIDDEF\r\n  /* Predefined typedefs and keywords follow. */\r\n  CTID_MAX = 65536\r\n};\r\n\r\n/* Target-dependent type IDs. */\r\n#if LJ_64\r\n#define CTID_INT_PSZ\tCTID_INT64\r\n#define CTID_UINT_PSZ\tCTID_UINT64\r\n#else\r\n#define CTID_INT_PSZ\tCTID_INT32\r\n#define CTID_UINT_PSZ\tCTID_UINT32\r\n#endif\r\n\r\n#if LJ_ABI_WIN\r\n#define CTID_WCHAR\tCTID_UINT16\r\n#elif LJ_TARGET_PPC\r\n#define CTID_WCHAR\tCTID_LINT32\r\n#else\r\n#define CTID_WCHAR\tCTID_INT32\r\n#endif\r\n\r\n/* -- C tokens and keywords ----------------------------------------------- */\r\n\r\n/* C lexer keywords. */\r\n#define CTOKDEF(_) \\\r\n  _(IDENT, \"<identifier>\") _(STRING, \"<string>\") \\\r\n  _(INTEGER, \"<integer>\") _(EOF, \"<eof>\") \\\r\n  _(OROR, \"||\") _(ANDAND, \"&&\") _(EQ, \"==\") _(NE, \"!=\") \\\r\n  _(LE, \"<=\") _(GE, \">=\") _(SHL, \"<<\") _(SHR, \">>\") _(DEREF, \"->\")\r\n\r\n/* Simple declaration specifiers. */\r\n#define CDSDEF(_) \\\r\n  _(VOID) _(BOOL) _(CHAR) _(INT) _(FP) \\\r\n  _(LONG) _(LONGLONG) _(SHORT) _(COMPLEX) _(SIGNED) _(UNSIGNED) \\\r\n  _(CONST) _(VOLATILE) _(RESTRICT) _(INLINE) \\\r\n  _(TYPEDEF) _(EXTERN) _(STATIC) _(AUTO) _(REGISTER)\r\n\r\n/* C keywords. */\r\n#define CKWDEF(_) \\\r\n  CDSDEF(_) _(EXTENSION) _(ASM) _(ATTRIBUTE) \\\r\n  _(DECLSPEC) _(CCDECL) _(PTRSZ) \\\r\n  _(STRUCT) _(UNION) _(ENUM) \\\r\n  _(SIZEOF) _(ALIGNOF)\r\n\r\n/* C token numbers. */\r\nenum {\r\n  CTOK_OFS = 255,\r\n#define CTOKNUM(name, sym)\tCTOK_##name,\r\n#define CKWNUM(name)\t\tCTOK_##name,\r\nCTOKDEF(CTOKNUM)\r\nCKWDEF(CKWNUM)\r\n#undef CTOKNUM\r\n#undef CKWNUM\r\n  CTOK_FIRSTDECL = CTOK_VOID,\r\n  CTOK_FIRSTSCL = CTOK_TYPEDEF,\r\n  CTOK_LASTDECLFLAG = CTOK_REGISTER,\r\n  CTOK_LASTDECL = CTOK_ENUM\r\n};\r\n\r\n/* Declaration specifier flags. */\r\nenum {\r\n#define CDSFLAG(name)\tCDF_##name = (1u << (CTOK_##name - CTOK_FIRSTDECL)),\r\nCDSDEF(CDSFLAG)\r\n#undef CDSFLAG\r\n  CDF__END\r\n};\r\n\r\n#define CDF_SCL  (CDF_TYPEDEF|CDF_EXTERN|CDF_STATIC|CDF_AUTO|CDF_REGISTER)\r\n\r\n/* -- C type management --------------------------------------------------- */\r\n\r\n#define ctype_ctsG(g)\t\t(mref((g)->ctype_state, CTState))\r\n\r\n/* Get C type state. */\r\nstatic LJ_AINLINE CTState *ctype_cts(lua_State *L)\r\n{\r\n  CTState *cts = ctype_ctsG(G(L));\r\n  cts->L = L;  /* Save L for errors and allocations. */\r\n  return cts;\r\n}\r\n\r\n/* Save and restore state of C type table. */\r\n#define LJ_CTYPE_SAVE(cts)\tCTState savects_ = *(cts)\r\n#define LJ_CTYPE_RESTORE(cts) \\\r\n  ((cts)->top = savects_.top, \\\r\n   memcpy((cts)->hash, savects_.hash, sizeof(savects_.hash)))\r\n\r\n/* Check C type ID for validity when assertions are enabled. */\r\nstatic LJ_AINLINE CTypeID ctype_check(CTState *cts, CTypeID id)\r\n{\r\n  lua_assert(id > 0 && id < cts->top); UNUSED(cts);\r\n  return id;\r\n}\r\n\r\n/* Get C type for C type ID. */\r\nstatic LJ_AINLINE CType *ctype_get(CTState *cts, CTypeID id)\r\n{\r\n  return &cts->tab[ctype_check(cts, id)];\r\n}\r\n\r\n/* Get C type ID for a C type. */\r\n#define ctype_typeid(cts, ct)\t((CTypeID)((ct) - (cts)->tab))\r\n\r\n/* Get child C type. */\r\nstatic LJ_AINLINE CType *ctype_child(CTState *cts, CType *ct)\r\n{\r\n  lua_assert(!(ctype_isvoid(ct->info) || ctype_isstruct(ct->info) ||\r\n\t     ctype_isbitfield(ct->info)));  /* These don't have children. */\r\n  return ctype_get(cts, ctype_cid(ct->info));\r\n}\r\n\r\n/* Get raw type for a C type ID. */\r\nstatic LJ_AINLINE CType *ctype_raw(CTState *cts, CTypeID id)\r\n{\r\n  CType *ct = ctype_get(cts, id);\r\n  while (ctype_isattrib(ct->info)) ct = ctype_child(cts, ct);\r\n  return ct;\r\n}\r\n\r\n/* Get raw type of the child of a C type. */\r\nstatic LJ_AINLINE CType *ctype_rawchild(CTState *cts, CType *ct)\r\n{\r\n  do { ct = ctype_child(cts, ct); } while (ctype_isattrib(ct->info));\r\n  return ct;\r\n}\r\n\r\n/* Set the name of a C type table element. */\r\nstatic LJ_AINLINE void ctype_setname(CType *ct, GCstr *s)\r\n{\r\n  /* NOBARRIER: mark string as fixed -- the C type table is never collected. */\r\n  fixstring(s);\r\n  setgcref(ct->name, obj2gco(s));\r\n}\r\n\r\nLJ_FUNC CTypeID lj_ctype_new(CTState *cts, CType **ctp);\r\nLJ_FUNC CTypeID lj_ctype_intern(CTState *cts, CTInfo info, CTSize size);\r\nLJ_FUNC void lj_ctype_addname(CTState *cts, CType *ct, CTypeID id);\r\nLJ_FUNC CTypeID lj_ctype_getname(CTState *cts, CType **ctp, GCstr *name,\r\n\t\t\t\t uint32_t tmask);\r\nLJ_FUNC CType *lj_ctype_getfieldq(CTState *cts, CType *ct, GCstr *name,\r\n\t\t\t\t  CTSize *ofs, CTInfo *qual);\r\n#define lj_ctype_getfield(cts, ct, name, ofs) \\\r\n  lj_ctype_getfieldq((cts), (ct), (name), (ofs), NULL)\r\nLJ_FUNC CType *lj_ctype_rawref(CTState *cts, CTypeID id);\r\nLJ_FUNC CTSize lj_ctype_size(CTState *cts, CTypeID id);\r\nLJ_FUNC CTSize lj_ctype_vlsize(CTState *cts, CType *ct, CTSize nelem);\r\nLJ_FUNC CTInfo lj_ctype_info(CTState *cts, CTypeID id, CTSize *szp);\r\nLJ_FUNC cTValue *lj_ctype_meta(CTState *cts, CTypeID id, MMS mm);\r\nLJ_FUNC GCstr *lj_ctype_repr(lua_State *L, CTypeID id, GCstr *name);\r\nLJ_FUNC GCstr *lj_ctype_repr_int64(lua_State *L, uint64_t n, int isunsigned);\r\nLJ_FUNC GCstr *lj_ctype_repr_complex(lua_State *L, void *sp, CTSize size);\r\nLJ_FUNC CTState *lj_ctype_init(lua_State *L);\r\nLJ_FUNC void lj_ctype_freestate(global_State *g);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_debug.c",
    "content": "/*\r\n** Debugging and introspection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_debug_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_strfmt.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n\r\n/* -- Frames -------------------------------------------------------------- */\r\n\r\n/* Get frame corresponding to a level. */\r\ncTValue *lj_debug_frame(lua_State *L, int level, int *size)\r\n{\r\n  cTValue *frame, *nextframe, *bot = tvref(L->stack)+LJ_FR2;\r\n  /* Traverse frames backwards. */\r\n  for (nextframe = frame = L->base-1; frame > bot; ) {\r\n    if (frame_gc(frame) == obj2gco(L))\r\n      level++;  /* Skip dummy frames. See lj_err_optype_call(). */\r\n    if (level-- == 0) {\r\n      *size = (int)(nextframe - frame);\r\n      return frame;  /* Level found. */\r\n    }\r\n    nextframe = frame;\r\n    if (frame_islua(frame)) {\r\n      frame = frame_prevl(frame);\r\n    } else {\r\n      if (frame_isvarg(frame))\r\n\tlevel++;  /* Skip vararg pseudo-frame. */\r\n      frame = frame_prevd(frame);\r\n    }\r\n  }\r\n  *size = level;\r\n  return NULL;  /* Level not found. */\r\n}\r\n\r\n/* Invalid bytecode position. */\r\n#define NO_BCPOS\t(~(BCPos)0)\r\n\r\n/* Return bytecode position for function/frame or NO_BCPOS. */\r\nstatic BCPos debug_framepc(lua_State *L, GCfunc *fn, cTValue *nextframe)\r\n{\r\n  const BCIns *ins;\r\n  GCproto *pt;\r\n  BCPos pos;\r\n  lua_assert(fn->c.gct == ~LJ_TFUNC || fn->c.gct == ~LJ_TTHREAD);\r\n  if (!isluafunc(fn)) {  /* Cannot derive a PC for non-Lua functions. */\r\n    return NO_BCPOS;\r\n  } else if (nextframe == NULL) {  /* Lua function on top. */\r\n    void *cf = cframe_raw(L->cframe);\r\n    if (cf == NULL || (char *)cframe_pc(cf) == (char *)cframe_L(cf))\r\n      return NO_BCPOS;\r\n    ins = cframe_pc(cf);  /* Only happens during error/hook handling. */\r\n  } else {\r\n    if (frame_islua(nextframe)) {\r\n      ins = frame_pc(nextframe);\r\n    } else if (frame_iscont(nextframe)) {\r\n      ins = frame_contpc(nextframe);\r\n    } else {\r\n      /* Lua function below errfunc/gc/hook: find cframe to get the PC. */\r\n      void *cf = cframe_raw(L->cframe);\r\n      TValue *f = L->base-1;\r\n      for (;;) {\r\n\tif (cf == NULL)\r\n\t  return NO_BCPOS;\r\n\twhile (cframe_nres(cf) < 0) {\r\n\t  if (f >= restorestack(L, -cframe_nres(cf)))\r\n\t    break;\r\n\t  cf = cframe_raw(cframe_prev(cf));\r\n\t  if (cf == NULL)\r\n\t    return NO_BCPOS;\r\n\t}\r\n\tif (f < nextframe)\r\n\t  break;\r\n\tif (frame_islua(f)) {\r\n\t  f = frame_prevl(f);\r\n\t} else {\r\n\t  if (frame_isc(f) || (frame_iscont(f) && frame_iscont_fficb(f)))\r\n\t    cf = cframe_raw(cframe_prev(cf));\r\n\t  f = frame_prevd(f);\r\n\t}\r\n      }\r\n      ins = cframe_pc(cf);\r\n    }\r\n  }\r\n  pt = funcproto(fn);\r\n  pos = proto_bcpos(pt, ins) - 1;\r\n#if LJ_HASJIT\r\n  if (pos > pt->sizebc) {  /* Undo the effects of lj_trace_exit for JLOOP. */\r\n    GCtrace *T = (GCtrace *)((char *)(ins-1) - offsetof(GCtrace, startins));\r\n    lua_assert(bc_isret(bc_op(ins[-1])));\r\n    pos = proto_bcpos(pt, mref(T->startpc, const BCIns));\r\n  }\r\n#endif\r\n  return pos;\r\n}\r\n\r\n/* -- Line numbers -------------------------------------------------------- */\r\n\r\n/* Get line number for a bytecode position. */\r\nBCLine LJ_FASTCALL lj_debug_line(GCproto *pt, BCPos pc)\r\n{\r\n  const void *lineinfo = proto_lineinfo(pt);\r\n  if (pc <= pt->sizebc && lineinfo) {\r\n    BCLine first = pt->firstline;\r\n    if (pc == pt->sizebc) return first + pt->numline;\r\n    if (pc-- == 0) return first;\r\n    if (pt->numline < 256)\r\n      return first + (BCLine)((const uint8_t *)lineinfo)[pc];\r\n    else if (pt->numline < 65536)\r\n      return first + (BCLine)((const uint16_t *)lineinfo)[pc];\r\n    else\r\n      return first + (BCLine)((const uint32_t *)lineinfo)[pc];\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Get line number for function/frame. */\r\nstatic BCLine debug_frameline(lua_State *L, GCfunc *fn, cTValue *nextframe)\r\n{\r\n  BCPos pc = debug_framepc(L, fn, nextframe);\r\n  if (pc != NO_BCPOS) {\r\n    GCproto *pt = funcproto(fn);\r\n    lua_assert(pc <= pt->sizebc);\r\n    return lj_debug_line(pt, pc);\r\n  }\r\n  return -1;\r\n}\r\n\r\n/* -- Variable names ------------------------------------------------------ */\r\n\r\n/* Get name of a local variable from slot number and PC. */\r\nstatic const char *debug_varname(const GCproto *pt, BCPos pc, BCReg slot)\r\n{\r\n  const char *p = (const char *)proto_varinfo(pt);\r\n  if (p) {\r\n    BCPos lastpc = 0;\r\n    for (;;) {\r\n      const char *name = p;\r\n      uint32_t vn = *(const uint8_t *)p;\r\n      BCPos startpc, endpc;\r\n      if (vn < VARNAME__MAX) {\r\n\tif (vn == VARNAME_END) break;  /* End of varinfo. */\r\n      } else {\r\n\tdo { p++; } while (*(const uint8_t *)p);  /* Skip over variable name. */\r\n      }\r\n      p++;\r\n      lastpc = startpc = lastpc + lj_buf_ruleb128(&p);\r\n      if (startpc > pc) break;\r\n      endpc = startpc + lj_buf_ruleb128(&p);\r\n      if (pc < endpc && slot-- == 0) {\r\n\tif (vn < VARNAME__MAX) {\r\n#define VARNAMESTR(name, str)\tstr \"\\0\"\r\n\t  name = VARNAMEDEF(VARNAMESTR);\r\n#undef VARNAMESTR\r\n\t  if (--vn) while (*name++ || --vn) ;\r\n\t}\r\n\treturn name;\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Get name of local variable from 1-based slot number and function/frame. */\r\nstatic TValue *debug_localname(lua_State *L, const lua_Debug *ar,\r\n\t\t\t       const char **name, BCReg slot1)\r\n{\r\n  uint32_t offset = (uint32_t)ar->i_ci & 0xffff;\r\n  uint32_t size = (uint32_t)ar->i_ci >> 16;\r\n  TValue *frame = tvref(L->stack) + offset;\r\n  TValue *nextframe = size ? frame + size : NULL;\r\n  GCfunc *fn = frame_func(frame);\r\n  BCPos pc = debug_framepc(L, fn, nextframe);\r\n  if (!nextframe) nextframe = L->top+LJ_FR2;\r\n  if ((int)slot1 < 0) {  /* Negative slot number is for varargs. */\r\n    if (pc != NO_BCPOS) {\r\n      GCproto *pt = funcproto(fn);\r\n      if ((pt->flags & PROTO_VARARG)) {\r\n\tslot1 = pt->numparams + (BCReg)(-(int)slot1);\r\n\tif (frame_isvarg(frame)) {  /* Vararg frame has been set up? (pc!=0) */\r\n\t  nextframe = frame;\r\n\t  frame = frame_prevd(frame);\r\n\t}\r\n\tif (frame + slot1+LJ_FR2 < nextframe) {\r\n\t  *name = \"(*vararg)\";\r\n\t  return frame+slot1;\r\n\t}\r\n      }\r\n    }\r\n    return NULL;\r\n  }\r\n  if (pc != NO_BCPOS &&\r\n      (*name = debug_varname(funcproto(fn), pc, slot1-1)) != NULL)\r\n    ;\r\n  else if (slot1 > 0 && frame + slot1+LJ_FR2 < nextframe)\r\n    *name = \"(*temporary)\";\r\n  return frame+slot1;\r\n}\r\n\r\n/* Get name of upvalue. */\r\nconst char *lj_debug_uvname(GCproto *pt, uint32_t idx)\r\n{\r\n  const uint8_t *p = proto_uvinfo(pt);\r\n  lua_assert(idx < pt->sizeuv);\r\n  if (!p) return \"\";\r\n  if (idx) while (*p++ || --idx) ;\r\n  return (const char *)p;\r\n}\r\n\r\n/* Get name and value of upvalue. */\r\nconst char *lj_debug_uvnamev(cTValue *o, uint32_t idx, TValue **tvp)\r\n{\r\n  if (tvisfunc(o)) {\r\n    GCfunc *fn = funcV(o);\r\n    if (isluafunc(fn)) {\r\n      GCproto *pt = funcproto(fn);\r\n      if (idx < pt->sizeuv) {\r\n\t*tvp = uvval(&gcref(fn->l.uvptr[idx])->uv);\r\n\treturn lj_debug_uvname(pt, idx);\r\n      }\r\n    } else {\r\n      if (idx < fn->c.nupvalues) {\r\n\t*tvp = &fn->c.upvalue[idx];\r\n\treturn \"\";\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Deduce name of an object from slot number and PC. */\r\nconst char *lj_debug_slotname(GCproto *pt, const BCIns *ip, BCReg slot,\r\n\t\t\t      const char **name)\r\n{\r\n  const char *lname;\r\nrestart:\r\n  lname = debug_varname(pt, proto_bcpos(pt, ip), slot);\r\n  if (lname != NULL) { *name = lname; return \"local\"; }\r\n  while (--ip > proto_bc(pt)) {\r\n    BCIns ins = *ip;\r\n    BCOp op = bc_op(ins);\r\n    BCReg ra = bc_a(ins);\r\n    if (bcmode_a(op) == BCMbase) {\r\n      if (slot >= ra && (op != BC_KNIL || slot <= bc_d(ins)))\r\n\treturn NULL;\r\n    } else if (bcmode_a(op) == BCMdst && ra == slot) {\r\n      switch (bc_op(ins)) {\r\n      case BC_MOV:\r\n\tif (ra == slot) { slot = bc_d(ins); goto restart; }\r\n\tbreak;\r\n      case BC_GGET:\r\n\t*name = strdata(gco2str(proto_kgc(pt, ~(ptrdiff_t)bc_d(ins))));\r\n\treturn \"global\";\r\n      case BC_TGETS:\r\n\t*name = strdata(gco2str(proto_kgc(pt, ~(ptrdiff_t)bc_c(ins))));\r\n\tif (ip > proto_bc(pt)) {\r\n\t  BCIns insp = ip[-1];\r\n\t  if (bc_op(insp) == BC_MOV && bc_a(insp) == ra+1+LJ_FR2 &&\r\n\t      bc_d(insp) == bc_b(ins))\r\n\t    return \"method\";\r\n\t}\r\n\treturn \"field\";\r\n      case BC_UGET:\r\n\t*name = lj_debug_uvname(pt, bc_d(ins));\r\n\treturn \"upvalue\";\r\n      default:\r\n\treturn NULL;\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Deduce function name from caller of a frame. */\r\nconst char *lj_debug_funcname(lua_State *L, cTValue *frame, const char **name)\r\n{\r\n  cTValue *pframe;\r\n  GCfunc *fn;\r\n  BCPos pc;\r\n  if (frame <= tvref(L->stack)+LJ_FR2)\r\n    return NULL;\r\n  if (frame_isvarg(frame))\r\n    frame = frame_prevd(frame);\r\n  pframe = frame_prev(frame);\r\n  fn = frame_func(pframe);\r\n  pc = debug_framepc(L, fn, frame);\r\n  if (pc != NO_BCPOS) {\r\n    GCproto *pt = funcproto(fn);\r\n    const BCIns *ip = &proto_bc(pt)[check_exp(pc < pt->sizebc, pc)];\r\n    MMS mm = bcmode_mm(bc_op(*ip));\r\n    if (mm == MM_call) {\r\n      BCReg slot = bc_a(*ip);\r\n      if (bc_op(*ip) == BC_ITERC) slot -= 3;\r\n      return lj_debug_slotname(pt, ip, slot, name);\r\n    } else if (mm != MM__MAX) {\r\n      *name = strdata(mmname_str(G(L), mm));\r\n      return \"metamethod\";\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* -- Source code locations ----------------------------------------------- */\r\n\r\n/* Generate shortened source name. */\r\nvoid lj_debug_shortname(char *out, GCstr *str, BCLine line)\r\n{\r\n  const char *src = strdata(str);\r\n  if (*src == '=') {\r\n    strncpy(out, src+1, LUA_IDSIZE);  /* Remove first char. */\r\n    out[LUA_IDSIZE-1] = '\\0';  /* Ensures null termination. */\r\n  } else if (*src == '@') {  /* Output \"source\", or \"...source\". */\r\n    size_t len = str->len-1;\r\n    src++;  /* Skip the `@' */\r\n    if (len >= LUA_IDSIZE) {\r\n      src += len-(LUA_IDSIZE-4);  /* Get last part of file name. */\r\n      *out++ = '.'; *out++ = '.'; *out++ = '.';\r\n    }\r\n    strcpy(out, src);\r\n  } else {  /* Output [string \"string\"] or [builtin:name]. */\r\n    size_t len;  /* Length, up to first control char. */\r\n    for (len = 0; len < LUA_IDSIZE-12; len++)\r\n      if (((const unsigned char *)src)[len] < ' ') break;\r\n    strcpy(out, line == ~(BCLine)0 ? \"[builtin:\" : \"[string \\\"\"); out += 9;\r\n    if (src[len] != '\\0') {  /* Must truncate? */\r\n      if (len > LUA_IDSIZE-15) len = LUA_IDSIZE-15;\r\n      strncpy(out, src, len); out += len;\r\n      strcpy(out, \"...\"); out += 3;\r\n    } else {\r\n      strcpy(out, src); out += len;\r\n    }\r\n    strcpy(out, line == ~(BCLine)0 ? \"]\" : \"\\\"]\");\r\n  }\r\n}\r\n\r\n/* Add current location of a frame to error message. */\r\nvoid lj_debug_addloc(lua_State *L, const char *msg,\r\n\t\t     cTValue *frame, cTValue *nextframe)\r\n{\r\n  if (frame) {\r\n    GCfunc *fn = frame_func(frame);\r\n    if (isluafunc(fn)) {\r\n      BCLine line = debug_frameline(L, fn, nextframe);\r\n      if (line >= 0) {\r\n\tGCproto *pt = funcproto(fn);\r\n\tchar buf[LUA_IDSIZE];\r\n\tlj_debug_shortname(buf, proto_chunkname(pt), pt->firstline);\r\n\tlj_strfmt_pushf(L, \"%s:%d: %s\", buf, line, msg);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  lj_strfmt_pushf(L, \"%s\", msg);\r\n}\r\n\r\n/* Push location string for a bytecode position to Lua stack. */\r\nvoid lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc)\r\n{\r\n  GCstr *name = proto_chunkname(pt);\r\n  const char *s = strdata(name);\r\n  MSize i, len = name->len;\r\n  BCLine line = lj_debug_line(pt, pc);\r\n  if (pt->firstline == ~(BCLine)0) {\r\n    lj_strfmt_pushf(L, \"builtin:%s\", s);\r\n  } else if (*s == '@') {\r\n    s++; len--;\r\n    for (i = len; i > 0; i--)\r\n      if (s[i] == '/' || s[i] == '\\\\') {\r\n\ts += i+1;\r\n\tbreak;\r\n      }\r\n    lj_strfmt_pushf(L, \"%s:%d\", s, line);\r\n  } else if (len > 40) {\r\n    lj_strfmt_pushf(L, \"%p:%d\", pt, line);\r\n  } else if (*s == '=') {\r\n    lj_strfmt_pushf(L, \"%s:%d\", s+1, line);\r\n  } else {\r\n    lj_strfmt_pushf(L, \"\\\"%s\\\":%d\", s, line);\r\n  }\r\n}\r\n\r\n/* -- Public debug API ---------------------------------------------------- */\r\n\r\n/* lua_getupvalue() and lua_setupvalue() are in lj_api.c. */\r\n\r\nLUA_API const char *lua_getlocal(lua_State *L, const lua_Debug *ar, int n)\r\n{\r\n  const char *name = NULL;\r\n  if (ar) {\r\n    TValue *o = debug_localname(L, ar, &name, (BCReg)n);\r\n    if (name) {\r\n      copyTV(L, L->top, o);\r\n      incr_top(L);\r\n    }\r\n  } else if (tvisfunc(L->top-1) && isluafunc(funcV(L->top-1))) {\r\n    name = debug_varname(funcproto(funcV(L->top-1)), 0, (BCReg)n-1);\r\n  }\r\n  return name;\r\n}\r\n\r\nLUA_API const char *lua_setlocal(lua_State *L, const lua_Debug *ar, int n)\r\n{\r\n  const char *name = NULL;\r\n  TValue *o = debug_localname(L, ar, &name, (BCReg)n);\r\n  if (name)\r\n    copyTV(L, o, L->top-1);\r\n  L->top--;\r\n  return name;\r\n}\r\n\r\nint lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar, int ext)\r\n{\r\n  int opt_f = 0, opt_L = 0;\r\n  TValue *frame = NULL;\r\n  TValue *nextframe = NULL;\r\n  GCfunc *fn;\r\n  if (*what == '>') {\r\n    TValue *func = L->top - 1;\r\n    api_check(L, tvisfunc(func));\r\n    fn = funcV(func);\r\n    L->top--;\r\n    what++;\r\n  } else {\r\n    uint32_t offset = (uint32_t)ar->i_ci & 0xffff;\r\n    uint32_t size = (uint32_t)ar->i_ci >> 16;\r\n    lua_assert(offset != 0);\r\n    frame = tvref(L->stack) + offset;\r\n    if (size) nextframe = frame + size;\r\n    lua_assert(frame <= tvref(L->maxstack) &&\r\n\t       (!nextframe || nextframe <= tvref(L->maxstack)));\r\n    fn = frame_func(frame);\r\n    lua_assert(fn->c.gct == ~LJ_TFUNC);\r\n  }\r\n  for (; *what; what++) {\r\n    if (*what == 'S') {\r\n      if (isluafunc(fn)) {\r\n\tGCproto *pt = funcproto(fn);\r\n\tBCLine firstline = pt->firstline;\r\n\tGCstr *name = proto_chunkname(pt);\r\n\tar->source = strdata(name);\r\n\tlj_debug_shortname(ar->short_src, name, pt->firstline);\r\n\tar->linedefined = (int)firstline;\r\n\tar->lastlinedefined = (int)(firstline + pt->numline);\r\n\tar->what = (firstline || !pt->numline) ? \"Lua\" : \"main\";\r\n      } else {\r\n\tar->source = \"=[C]\";\r\n\tar->short_src[0] = '[';\r\n\tar->short_src[1] = 'C';\r\n\tar->short_src[2] = ']';\r\n\tar->short_src[3] = '\\0';\r\n\tar->linedefined = -1;\r\n\tar->lastlinedefined = -1;\r\n\tar->what = \"C\";\r\n      }\r\n    } else if (*what == 'l') {\r\n      ar->currentline = frame ? debug_frameline(L, fn, nextframe) : -1;\r\n    } else if (*what == 'u') {\r\n      ar->nups = fn->c.nupvalues;\r\n      if (ext) {\r\n\tif (isluafunc(fn)) {\r\n\t  GCproto *pt = funcproto(fn);\r\n\t  ar->nparams = pt->numparams;\r\n\t  ar->isvararg = !!(pt->flags & PROTO_VARARG);\r\n\t} else {\r\n\t  ar->nparams = 0;\r\n\t  ar->isvararg = 1;\r\n\t}\r\n      }\r\n    } else if (*what == 'n') {\r\n      ar->namewhat = frame ? lj_debug_funcname(L, frame, &ar->name) : NULL;\r\n      if (ar->namewhat == NULL) {\r\n\tar->namewhat = \"\";\r\n\tar->name = NULL;\r\n      }\r\n    } else if (*what == 'f') {\r\n      opt_f = 1;\r\n    } else if (*what == 'L') {\r\n      opt_L = 1;\r\n    } else {\r\n      return 0;  /* Bad option. */\r\n    }\r\n  }\r\n  if (opt_f) {\r\n    setfuncV(L, L->top, fn);\r\n    incr_top(L);\r\n  }\r\n  if (opt_L) {\r\n    if (isluafunc(fn)) {\r\n      GCtab *t = lj_tab_new(L, 0, 0);\r\n      GCproto *pt = funcproto(fn);\r\n      const void *lineinfo = proto_lineinfo(pt);\r\n      if (lineinfo) {\r\n\tBCLine first = pt->firstline;\r\n\tint sz = pt->numline < 256 ? 1 : pt->numline < 65536 ? 2 : 4;\r\n\tMSize i, szl = pt->sizebc-1;\r\n\tfor (i = 0; i < szl; i++) {\r\n\t  BCLine line = first +\r\n\t    (sz == 1 ? (BCLine)((const uint8_t *)lineinfo)[i] :\r\n\t     sz == 2 ? (BCLine)((const uint16_t *)lineinfo)[i] :\r\n\t     (BCLine)((const uint32_t *)lineinfo)[i]);\r\n\t  setboolV(lj_tab_setint(L, t, line), 1);\r\n\t}\r\n      }\r\n      settabV(L, L->top, t);\r\n    } else {\r\n      setnilV(L->top);\r\n    }\r\n    incr_top(L);\r\n  }\r\n  return 1;  /* Ok. */\r\n}\r\n\r\nLUA_API int lua_getinfo(lua_State *L, const char *what, lua_Debug *ar)\r\n{\r\n  return lj_debug_getinfo(L, what, (lj_Debug *)ar, 0);\r\n}\r\n\r\nLUA_API int lua_getstack(lua_State *L, int level, lua_Debug *ar)\r\n{\r\n  int size;\r\n  cTValue *frame = lj_debug_frame(L, level, &size);\r\n  if (frame) {\r\n    ar->i_ci = (size << 16) + (int)(frame - tvref(L->stack));\r\n    return 1;\r\n  } else {\r\n    ar->i_ci = level - size;\r\n    return 0;\r\n  }\r\n}\r\n\r\n#if LJ_HASPROFILE\r\n/* Put the chunkname into a buffer. */\r\nstatic int debug_putchunkname(SBuf *sb, GCproto *pt, int pathstrip)\r\n{\r\n  GCstr *name = proto_chunkname(pt);\r\n  const char *p = strdata(name);\r\n  if (pt->firstline == ~(BCLine)0) {\r\n    lj_buf_putmem(sb, \"[builtin:\", 9);\r\n    lj_buf_putstr(sb, name);\r\n    lj_buf_putb(sb, ']');\r\n    return 0;\r\n  }\r\n  if (*p == '=' || *p == '@') {\r\n    MSize len = name->len-1;\r\n    p++;\r\n    if (pathstrip) {\r\n      int i;\r\n      for (i = len-1; i >= 0; i--)\r\n\tif (p[i] == '/' || p[i] == '\\\\') {\r\n\t  len -= i+1;\r\n\t  p = p+i+1;\r\n\t  break;\r\n\t}\r\n    }\r\n    lj_buf_putmem(sb, p, len);\r\n  } else {\r\n    lj_buf_putmem(sb, \"[string]\", 8);\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* Put a compact stack dump into a buffer. */\r\nvoid lj_debug_dumpstack(lua_State *L, SBuf *sb, const char *fmt, int depth)\r\n{\r\n  int level = 0, dir = 1, pathstrip = 1;\r\n  MSize lastlen = 0;\r\n  if (depth < 0) { level = ~depth; depth = dir = -1; }  /* Reverse frames. */\r\n  while (level != depth) {  /* Loop through all frame. */\r\n    int size;\r\n    cTValue *frame = lj_debug_frame(L, level, &size);\r\n    if (frame) {\r\n      cTValue *nextframe = size ? frame+size : NULL;\r\n      GCfunc *fn = frame_func(frame);\r\n      const uint8_t *p = (const uint8_t *)fmt;\r\n      int c;\r\n      while ((c = *p++)) {\r\n\tswitch (c) {\r\n\tcase 'p':  /* Preserve full path. */\r\n\t  pathstrip = 0;\r\n\t  break;\r\n\tcase 'F': case 'f': {  /* Dump function name. */\r\n\t  const char *name;\r\n\t  const char *what = lj_debug_funcname(L, frame, &name);\r\n\t  if (what) {\r\n\t    if (c == 'F' && isluafunc(fn)) {  /* Dump module:name for 'F'. */\r\n\t      GCproto *pt = funcproto(fn);\r\n\t      if (pt->firstline != ~(BCLine)0) {  /* Not a bytecode builtin. */\r\n\t\tdebug_putchunkname(sb, pt, pathstrip);\r\n\t\tlj_buf_putb(sb, ':');\r\n\t      }\r\n\t    }\r\n\t    lj_buf_putmem(sb, name, (MSize)strlen(name));\r\n\t    break;\r\n\t  }  /* else: can't derive a name, dump module:line. */\r\n\t  }\r\n\t  /* fallthrough */\r\n\tcase 'l':  /* Dump module:line. */\r\n\t  if (isluafunc(fn)) {\r\n\t    GCproto *pt = funcproto(fn);\r\n\t    if (debug_putchunkname(sb, pt, pathstrip)) {\r\n\t      /* Regular Lua function. */\r\n\t      BCLine line = c == 'l' ? debug_frameline(L, fn, nextframe) :\r\n\t\t\t\t       pt->firstline;\r\n\t      lj_buf_putb(sb, ':');\r\n\t      lj_strfmt_putint(sb, line >= 0 ? line : pt->firstline);\r\n\t    }\r\n\t  } else if (isffunc(fn)) {  /* Dump numbered builtins. */\r\n\t    lj_buf_putmem(sb, \"[builtin#\", 9);\r\n\t    lj_strfmt_putint(sb, fn->c.ffid);\r\n\t    lj_buf_putb(sb, ']');\r\n\t  } else {  /* Dump C function address. */\r\n\t    lj_buf_putb(sb, '@');\r\n\t    lj_strfmt_putptr(sb, fn->c.f);\r\n\t  }\r\n\t  break;\r\n\tcase 'Z':  /* Zap trailing separator. */\r\n\t  lastlen = sbuflen(sb);\r\n\t  break;\r\n\tdefault:\r\n\t  lj_buf_putb(sb, c);\r\n\t  break;\r\n\t}\r\n      }\r\n    } else if (dir == 1) {\r\n      break;\r\n    } else {\r\n      level -= size;  /* Reverse frame order: quickly skip missing level. */\r\n    }\r\n    level += dir;\r\n  }\r\n  if (lastlen)\r\n    setsbufP(sb, sbufB(sb) + lastlen);  /* Zap trailing separator. */\r\n}\r\n#endif\r\n\r\n/* Number of frames for the leading and trailing part of a traceback. */\r\n#define TRACEBACK_LEVELS1\t12\r\n#define TRACEBACK_LEVELS2\t10\r\n\r\nLUALIB_API void luaL_traceback (lua_State *L, lua_State *L1, const char *msg,\r\n\t\t\t\tint level)\r\n{\r\n  int top = (int)(L->top - L->base);\r\n  int lim = TRACEBACK_LEVELS1;\r\n  lua_Debug ar;\r\n  if (msg) lua_pushfstring(L, \"%s\\n\", msg);\r\n  lua_pushliteral(L, \"stack traceback:\");\r\n  while (lua_getstack(L1, level++, &ar)) {\r\n    GCfunc *fn;\r\n    if (level > lim) {\r\n      if (!lua_getstack(L1, level + TRACEBACK_LEVELS2, &ar)) {\r\n\tlevel--;\r\n      } else {\r\n\tlua_pushliteral(L, \"\\n\\t...\");\r\n\tlua_getstack(L1, -10, &ar);\r\n\tlevel = ar.i_ci - TRACEBACK_LEVELS2;\r\n      }\r\n      lim = 2147483647;\r\n      continue;\r\n    }\r\n    lua_getinfo(L1, \"Snlf\", &ar);\r\n    fn = funcV(L1->top-1); L1->top--;\r\n    if (isffunc(fn) && !*ar.namewhat)\r\n      lua_pushfstring(L, \"\\n\\t[builtin#%d]:\", fn->c.ffid);\r\n    else\r\n      lua_pushfstring(L, \"\\n\\t%s:\", ar.short_src);\r\n    if (ar.currentline > 0)\r\n      lua_pushfstring(L, \"%d:\", ar.currentline);\r\n    if (*ar.namewhat) {\r\n      lua_pushfstring(L, \" in function \" LUA_QS, ar.name);\r\n    } else {\r\n      if (*ar.what == 'm') {\r\n\tlua_pushliteral(L, \" in main chunk\");\r\n      } else if (*ar.what == 'C') {\r\n\tlua_pushfstring(L, \" at %p\", fn->c.f);\r\n      } else {\r\n\tlua_pushfstring(L, \" in function <%s:%d>\",\r\n\t\t\tar.short_src, ar.linedefined);\r\n      }\r\n    }\r\n    if ((int)(L->top - L->base) - top >= 15)\r\n      lua_concat(L, (int)(L->top - L->base) - top);\r\n  }\r\n  lua_concat(L, (int)(L->top - L->base) - top);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_debug.h",
    "content": "/*\r\n** Debugging and introspection.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DEBUG_H\r\n#define _LJ_DEBUG_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\ntypedef struct lj_Debug {\r\n  /* Common fields. Must be in the same order as in lua.h. */\r\n  int event;\r\n  const char *name;\r\n  const char *namewhat;\r\n  const char *what;\r\n  const char *source;\r\n  int currentline;\r\n  int nups;\r\n  int linedefined;\r\n  int lastlinedefined;\r\n  char short_src[LUA_IDSIZE];\r\n  int i_ci;\r\n  /* Extended fields. Only valid if lj_debug_getinfo() is called with ext = 1.*/\r\n  int nparams;\r\n  int isvararg;\r\n} lj_Debug;\r\n\r\nLJ_FUNC cTValue *lj_debug_frame(lua_State *L, int level, int *size);\r\nLJ_FUNC BCLine LJ_FASTCALL lj_debug_line(GCproto *pt, BCPos pc);\r\nLJ_FUNC const char *lj_debug_uvname(GCproto *pt, uint32_t idx);\r\nLJ_FUNC const char *lj_debug_uvnamev(cTValue *o, uint32_t idx, TValue **tvp);\r\nLJ_FUNC const char *lj_debug_slotname(GCproto *pt, const BCIns *pc,\r\n\t\t\t\t      BCReg slot, const char **name);\r\nLJ_FUNC const char *lj_debug_funcname(lua_State *L, cTValue *frame,\r\n\t\t\t\t      const char **name);\r\nLJ_FUNC void lj_debug_shortname(char *out, GCstr *str, BCLine line);\r\nLJ_FUNC void lj_debug_addloc(lua_State *L, const char *msg,\r\n\t\t\t     cTValue *frame, cTValue *nextframe);\r\nLJ_FUNC void lj_debug_pushloc(lua_State *L, GCproto *pt, BCPos pc);\r\nLJ_FUNC int lj_debug_getinfo(lua_State *L, const char *what, lj_Debug *ar,\r\n\t\t\t     int ext);\r\n#if LJ_HASPROFILE\r\nLJ_FUNC void lj_debug_dumpstack(lua_State *L, SBuf *sb, const char *fmt,\r\n\t\t\t\tint depth);\r\n#endif\r\n\r\n/* Fixed internal variable names. */\r\n#define VARNAMEDEF(_) \\\r\n  _(FOR_IDX, \"(for index)\") \\\r\n  _(FOR_STOP, \"(for limit)\") \\\r\n  _(FOR_STEP, \"(for step)\") \\\r\n  _(FOR_GEN, \"(for generator)\") \\\r\n  _(FOR_STATE, \"(for state)\") \\\r\n  _(FOR_CTL, \"(for control)\")\r\n\r\nenum {\r\n  VARNAME_END,\r\n#define VARNAMEENUM(name, str)\tVARNAME_##name,\r\n  VARNAMEDEF(VARNAMEENUM)\r\n#undef VARNAMEENUM\r\n  VARNAME__MAX\r\n};\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_def.h",
    "content": "/*\r\n** LuaJIT common internal definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DEF_H\r\n#define _LJ_DEF_H\r\n\r\n#include \"lua.h\"\r\n\r\n#if defined(_MSC_VER)\r\n/* MSVC is stuck in the last century and doesn't have C99's stdint.h. */\r\ntypedef __int8 int8_t;\r\ntypedef __int16 int16_t;\r\ntypedef __int32 int32_t;\r\ntypedef __int64 int64_t;\r\ntypedef unsigned __int8 uint8_t;\r\ntypedef unsigned __int16 uint16_t;\r\ntypedef unsigned __int32 uint32_t;\r\ntypedef unsigned __int64 uint64_t;\r\n#ifdef _WIN64\r\ntypedef __int64 intptr_t;\r\ntypedef unsigned __int64 uintptr_t;\r\n#else\r\ntypedef __int32 intptr_t;\r\ntypedef unsigned __int32 uintptr_t;\r\n#endif\r\n#elif defined(__symbian__)\r\n/* Cough. */\r\ntypedef signed char int8_t;\r\ntypedef short int int16_t;\r\ntypedef int int32_t;\r\ntypedef long long int64_t;\r\ntypedef unsigned char uint8_t;\r\ntypedef unsigned short int uint16_t;\r\ntypedef unsigned int uint32_t;\r\ntypedef unsigned long long uint64_t;\r\ntypedef int intptr_t;\r\ntypedef unsigned int uintptr_t;\r\n#else\r\n#include <stdint.h>\r\n#endif\r\n\r\n/* Needed everywhere. */\r\n#include <string.h>\r\n#include <stdlib.h>\r\n\r\n/* Various VM limits. */\r\n#define LJ_MAX_MEM32\t0x7fffff00\t/* Max. 32 bit memory allocation. */\r\n#define LJ_MAX_MEM64\t((uint64_t)1<<47)  /* Max. 64 bit memory allocation. */\r\n/* Max. total memory allocation. */\r\n#define LJ_MAX_MEM\t(LJ_GC64 ? LJ_MAX_MEM64 : LJ_MAX_MEM32)\r\n#define LJ_MAX_ALLOC\tLJ_MAX_MEM\t/* Max. individual allocation length. */\r\n#define LJ_MAX_STR\tLJ_MAX_MEM32\t/* Max. string length. */\r\n#define LJ_MAX_BUF\tLJ_MAX_MEM32\t/* Max. buffer length. */\r\n#define LJ_MAX_UDATA\tLJ_MAX_MEM32\t/* Max. userdata length. */\r\n\r\n#define LJ_MAX_STRTAB\t(1<<26)\t\t/* Max. string table size. */\r\n#define LJ_MAX_HBITS\t26\t\t/* Max. hash bits. */\r\n#define LJ_MAX_ABITS\t28\t\t/* Max. bits of array key. */\r\n#define LJ_MAX_ASIZE\t((1<<(LJ_MAX_ABITS-1))+1)  /* Max. array part size. */\r\n#define LJ_MAX_COLOSIZE\t16\t\t/* Max. elems for colocated array. */\r\n\r\n#define LJ_MAX_LINE\tLJ_MAX_MEM32\t/* Max. source code line number. */\r\n#define LJ_MAX_XLEVEL\t200\t\t/* Max. syntactic nesting level. */\r\n#define LJ_MAX_BCINS\t(1<<26)\t\t/* Max. # of bytecode instructions. */\r\n#define LJ_MAX_SLOTS\t250\t\t/* Max. # of slots in a Lua func. */\r\n#define LJ_MAX_LOCVAR\t200\t\t/* Max. # of local variables. */\r\n#define LJ_MAX_UPVAL\t60\t\t/* Max. # of upvalues. */\r\n\r\n#define LJ_MAX_IDXCHAIN\t100\t\t/* __index/__newindex chain limit. */\r\n#define LJ_STACK_EXTRA\t(5+2*LJ_FR2)\t/* Extra stack space (metamethods). */\r\n\r\n#define LJ_NUM_CBPAGE\t1\t\t/* Number of FFI callback pages. */\r\n\r\n/* Minimum table/buffer sizes. */\r\n#define LJ_MIN_GLOBAL\t6\t\t/* Min. global table size (hbits). */\r\n#define LJ_MIN_REGISTRY\t2\t\t/* Min. registry size (hbits). */\r\n#define LJ_MIN_STRTAB\t256\t\t/* Min. string table size (pow2). */\r\n#define LJ_MIN_SBUF\t32\t\t/* Min. string buffer length. */\r\n#define LJ_MIN_VECSZ\t8\t\t/* Min. size for growable vectors. */\r\n#define LJ_MIN_IRSZ\t32\t\t/* Min. size for growable IR. */\r\n#define LJ_MIN_K64SZ\t16\t\t/* Min. size for chained K64Array. */\r\n\r\n/* JIT compiler limits. */\r\n#define LJ_MAX_JSLOTS\t250\t\t/* Max. # of stack slots for a trace. */\r\n#define LJ_MAX_PHI\t64\t\t/* Max. # of PHIs for a loop. */\r\n#define LJ_MAX_EXITSTUBGR\t16\t/* Max. # of exit stub groups. */\r\n\r\n/* Various macros. */\r\n#ifndef UNUSED\r\n#define UNUSED(x)\t((void)(x))\t/* to avoid warnings */\r\n#endif\r\n\r\n#define U64x(hi, lo)\t(((uint64_t)0x##hi << 32) + (uint64_t)0x##lo)\r\n#define i32ptr(p)\t((int32_t)(intptr_t)(void *)(p))\r\n#define u32ptr(p)\t((uint32_t)(intptr_t)(void *)(p))\r\n\r\n#define checki8(x)\t((x) == (int32_t)(int8_t)(x))\r\n#define checku8(x)\t((x) == (int32_t)(uint8_t)(x))\r\n#define checki16(x)\t((x) == (int32_t)(int16_t)(x))\r\n#define checku16(x)\t((x) == (int32_t)(uint16_t)(x))\r\n#define checki32(x)\t((x) == (int32_t)(x))\r\n#define checku32(x)\t((x) == (uint32_t)(x))\r\n#define checkptr32(x)\t((uintptr_t)(x) == (uint32_t)(uintptr_t)(x))\r\n#define checkptr47(x)\t(((uint64_t)(x) >> 47) == 0)\r\n#if LJ_GC64\r\n#define checkptrGC(x)\t(checkptr47((x)))\r\n#elif LJ_64\r\n#define checkptrGC(x)\t(checkptr32((x)))\r\n#else\r\n#define checkptrGC(x)\t1\r\n#endif\r\n\r\n/* Every half-decent C compiler transforms this into a rotate instruction. */\r\n#define lj_rol(x, n)\t(((x)<<(n)) | ((x)>>(-(int)(n)&(8*sizeof(x)-1))))\r\n#define lj_ror(x, n)\t(((x)<<(-(int)(n)&(8*sizeof(x)-1))) | ((x)>>(n)))\r\n\r\n/* A really naive Bloom filter. But sufficient for our needs. */\r\ntypedef uintptr_t BloomFilter;\r\n#define BLOOM_MASK\t(8*sizeof(BloomFilter) - 1)\r\n#define bloombit(x)\t((uintptr_t)1 << ((x) & BLOOM_MASK))\r\n#define bloomset(b, x)\t((b) |= bloombit((x)))\r\n#define bloomtest(b, x)\t((b) & bloombit((x)))\r\n\r\n#if defined(__GNUC__) || defined(__psp2__)\r\n\r\n#define LJ_NORET\t__attribute__((noreturn))\r\n#define LJ_ALIGN(n)\t__attribute__((aligned(n)))\r\n#define LJ_INLINE\tinline\r\n#define LJ_AINLINE\tinline __attribute__((always_inline))\r\n#define LJ_NOINLINE\t__attribute__((noinline))\r\n\r\n#if defined(__ELF__) || defined(__MACH__) || defined(__psp2__)\r\n#if !((defined(__sun__) && defined(__svr4__)) || defined(__CELLOS_LV2__))\r\n#define LJ_NOAPI\textern __attribute__((visibility(\"hidden\")))\r\n#endif\r\n#endif\r\n\r\n/* Note: it's only beneficial to use fastcall on x86 and then only for up to\r\n** two non-FP args. The amalgamated compile covers all LJ_FUNC cases. Only\r\n** indirect calls and related tail-called C functions are marked as fastcall.\r\n*/\r\n#if defined(__i386__)\r\n#define LJ_FASTCALL\t__attribute__((fastcall))\r\n#endif\r\n\r\n#define LJ_LIKELY(x)\t__builtin_expect(!!(x), 1)\r\n#define LJ_UNLIKELY(x)\t__builtin_expect(!!(x), 0)\r\n\r\n#define lj_ffs(x)\t((uint32_t)__builtin_ctz(x))\r\n/* Don't ask ... */\r\n#if defined(__INTEL_COMPILER) && (defined(__i386__) || defined(__x86_64__))\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  uint32_t r; __asm__(\"bsrl %1, %0\" : \"=r\" (r) : \"rm\" (x) : \"cc\"); return r;\r\n}\r\n#else\r\n#define lj_fls(x)\t((uint32_t)(__builtin_clz(x)^31))\r\n#endif\r\n\r\n#if defined(__arm__)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n#if defined(__psp2__)\r\n  return __builtin_rev(x);\r\n#else\r\n  uint32_t r;\r\n#if __ARM_ARCH_6__ || __ARM_ARCH_6J__ || __ARM_ARCH_6T2__ || __ARM_ARCH_6Z__ ||\\\r\n    __ARM_ARCH_6ZK__ || __ARM_ARCH_7__ || __ARM_ARCH_7A__ || __ARM_ARCH_7R__\r\n  __asm__(\"rev %0, %1\" : \"=r\" (r) : \"r\" (x));\r\n  return r;\r\n#else\r\n#ifdef __thumb__\r\n  r = x ^ lj_ror(x, 16);\r\n#else\r\n  __asm__(\"eor %0, %1, %1, ror #16\" : \"=r\" (r) : \"r\" (x));\r\n#endif\r\n  return ((r & 0xff00ffffu) >> 8) ^ lj_ror(x, 8);\r\n#endif\r\n#endif\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return ((uint64_t)lj_bswap((uint32_t)x)<<32) | lj_bswap((uint32_t)(x>>32));\r\n}\r\n#elif (__GNUC__ > 4) || (__GNUC__ == 4 && __GNUC_MINOR__ >= 3)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  return (uint32_t)__builtin_bswap32((int32_t)x);\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return (uint64_t)__builtin_bswap64((int64_t)x);\r\n}\r\n#elif defined(__i386__) || defined(__x86_64__)\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  uint32_t r; __asm__(\"bswap %0\" : \"=r\" (r) : \"0\" (x)); return r;\r\n}\r\n\r\n#if defined(__i386__)\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return ((uint64_t)lj_bswap((uint32_t)x)<<32) | lj_bswap((uint32_t)(x>>32));\r\n}\r\n#else\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  uint64_t r; __asm__(\"bswap %0\" : \"=r\" (r) : \"0\" (x)); return r;\r\n}\r\n#endif\r\n#else\r\nstatic LJ_AINLINE uint32_t lj_bswap(uint32_t x)\r\n{\r\n  return (x << 24) | ((x & 0xff00) << 8) | ((x >> 8) & 0xff00) | (x >> 24);\r\n}\r\n\r\nstatic LJ_AINLINE uint64_t lj_bswap64(uint64_t x)\r\n{\r\n  return (uint64_t)lj_bswap((uint32_t)(x >> 32)) |\r\n\t ((uint64_t)lj_bswap((uint32_t)x) << 32);\r\n}\r\n#endif\r\n\r\ntypedef union __attribute__((packed)) Unaligned16 {\r\n  uint16_t u;\r\n  uint8_t b[2];\r\n} Unaligned16;\r\n\r\ntypedef union __attribute__((packed)) Unaligned32 {\r\n  uint32_t u;\r\n  uint8_t b[4];\r\n} Unaligned32;\r\n\r\n/* Unaligned load of uint16_t. */\r\nstatic LJ_AINLINE uint16_t lj_getu16(const void *p)\r\n{\r\n  return ((const Unaligned16 *)p)->u;\r\n}\r\n\r\n/* Unaligned load of uint32_t. */\r\nstatic LJ_AINLINE uint32_t lj_getu32(const void *p)\r\n{\r\n  return ((const Unaligned32 *)p)->u;\r\n}\r\n\r\n#elif defined(_MSC_VER)\r\n\r\n#define LJ_NORET\t__declspec(noreturn)\r\n#define LJ_ALIGN(n)\t__declspec(align(n))\r\n#define LJ_INLINE\t__inline\r\n#define LJ_AINLINE\t__forceinline\r\n#define LJ_NOINLINE\t__declspec(noinline)\r\n#if defined(_M_IX86)\r\n#define LJ_FASTCALL\t__fastcall\r\n#endif\r\n\r\n#ifdef _M_PPC\r\nunsigned int _CountLeadingZeros(long);\r\n#pragma intrinsic(_CountLeadingZeros)\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  return _CountLeadingZeros(x) ^ 31;\r\n}\r\n#else\r\nunsigned char _BitScanForward(uint32_t *, unsigned long);\r\nunsigned char _BitScanReverse(uint32_t *, unsigned long);\r\n#pragma intrinsic(_BitScanForward)\r\n#pragma intrinsic(_BitScanReverse)\r\n\r\nstatic LJ_AINLINE uint32_t lj_ffs(uint32_t x)\r\n{\r\n  uint32_t r; _BitScanForward(&r, x); return r;\r\n}\r\n\r\nstatic LJ_AINLINE uint32_t lj_fls(uint32_t x)\r\n{\r\n  uint32_t r; _BitScanReverse(&r, x); return r;\r\n}\r\n#endif\r\n\r\nunsigned long _byteswap_ulong(unsigned long);\r\nuint64_t _byteswap_uint64(uint64_t);\r\n#define lj_bswap(x)\t(_byteswap_ulong((x)))\r\n#define lj_bswap64(x)\t(_byteswap_uint64((x)))\r\n\r\n#if defined(_M_PPC) && defined(LUAJIT_NO_UNALIGNED)\r\n/*\r\n** Replacement for unaligned loads on Xbox 360. Disabled by default since it's\r\n** usually more costly than the occasional stall when crossing a cache-line.\r\n*/\r\nstatic LJ_AINLINE uint16_t lj_getu16(const void *v)\r\n{\r\n  const uint8_t *p = (const uint8_t *)v;\r\n  return (uint16_t)((p[0]<<8) | p[1]);\r\n}\r\nstatic LJ_AINLINE uint32_t lj_getu32(const void *v)\r\n{\r\n  const uint8_t *p = (const uint8_t *)v;\r\n  return (uint32_t)((p[0]<<24) | (p[1]<<16) | (p[2]<<8) | p[3]);\r\n}\r\n#else\r\n/* Unaligned loads are generally ok on x86/x64. */\r\n#define lj_getu16(p)\t(*(uint16_t *)(p))\r\n#define lj_getu32(p)\t(*(uint32_t *)(p))\r\n#endif\r\n\r\n#else\r\n#error \"missing defines for your compiler\"\r\n#endif\r\n\r\n/* Optional defines. */\r\n#ifndef LJ_FASTCALL\r\n#define LJ_FASTCALL\r\n#endif\r\n#ifndef LJ_NORET\r\n#define LJ_NORET\r\n#endif\r\n#ifndef LJ_NOAPI\r\n#define LJ_NOAPI\textern\r\n#endif\r\n#ifndef LJ_LIKELY\r\n#define LJ_LIKELY(x)\t(x)\r\n#define LJ_UNLIKELY(x)\t(x)\r\n#endif\r\n\r\n/* Attributes for internal functions. */\r\n#define LJ_DATA\t\tLJ_NOAPI\r\n#define LJ_DATADEF\r\n#define LJ_ASMF\t\tLJ_NOAPI\r\n#define LJ_FUNCA\tLJ_NOAPI\r\n#if defined(ljamalg_c)\r\n#define LJ_FUNC\t\tstatic\r\n#else\r\n#define LJ_FUNC\t\tLJ_NOAPI\r\n#endif\r\n#define LJ_FUNC_NORET\tLJ_FUNC LJ_NORET\r\n#define LJ_FUNCA_NORET\tLJ_FUNCA LJ_NORET\r\n#define LJ_ASMF_NORET\tLJ_ASMF LJ_NORET\r\n\r\n/* Runtime assertions. */\r\n#ifdef lua_assert\r\n#define check_exp(c, e)\t\t(lua_assert(c), (e))\r\n#define api_check(l, e)\t\tlua_assert(e)\r\n#else\r\n#define lua_assert(c)\t\t((void)0)\r\n#define check_exp(c, e)\t\t(e)\r\n#define api_check\t\tluai_apicheck\r\n#endif\r\n\r\n/* Static assertions. */\r\n#define LJ_ASSERT_NAME2(name, line)\tname ## line\r\n#define LJ_ASSERT_NAME(line)\t\tLJ_ASSERT_NAME2(lj_assert_, line)\r\n#ifdef __COUNTER__\r\n#define LJ_STATIC_ASSERT(cond) \\\r\n  extern void LJ_ASSERT_NAME(__COUNTER__)(int STATIC_ASSERTION_FAILED[(cond)?1:-1])\r\n#else\r\n#define LJ_STATIC_ASSERT(cond) \\\r\n  extern void LJ_ASSERT_NAME(__LINE__)(int STATIC_ASSERTION_FAILED[(cond)?1:-1])\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_dispatch.c",
    "content": "/*\r\n** Instruction dispatch handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_dispatch_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_strfmt.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n#if LJ_HASFFI\r\n#include \"lj_ccallback.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#if LJ_HASPROFILE\r\n#include \"lj_profile.h\"\r\n#endif\r\n#include \"lj_vm.h\"\r\n#include \"luajit.h\"\r\n\r\n/* Bump GG_NUM_ASMFF in lj_dispatch.h as needed. Ugly. */\r\nLJ_STATIC_ASSERT(GG_NUM_ASMFF == FF_NUM_ASMFUNC);\r\n\r\n/* -- Dispatch table management ------------------------------------------- */\r\n\r\n#if LJ_TARGET_MIPS\r\n#include <math.h>\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_ffh_coroutine_wrap_err(lua_State *L,\r\n\t\t\t\t\t\t\t  lua_State *co);\r\n#if !LJ_HASJIT\r\n#define lj_dispatch_stitch\tlj_dispatch_ins\r\n#endif\r\n#if !LJ_HASPROFILE\r\n#define lj_dispatch_profile\tlj_dispatch_ins\r\n#endif\r\n\r\n#define GOTFUNC(name)\t(ASMFunction)name,\r\nstatic const ASMFunction dispatch_got[] = {\r\n  GOTDEF(GOTFUNC)\r\n};\r\n#undef GOTFUNC\r\n#endif\r\n\r\n/* Initialize instruction dispatch table and hot counters. */\r\nvoid lj_dispatch_init(GG_State *GG)\r\n{\r\n  uint32_t i;\r\n  ASMFunction *disp = GG->dispatch;\r\n  for (i = 0; i < GG_LEN_SDISP; i++)\r\n    disp[GG_LEN_DDISP+i] = disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n  for (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n    disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n  /* The JIT engine is off by default. luaopen_jit() turns it on. */\r\n  disp[BC_FORL] = disp[BC_IFORL];\r\n  disp[BC_ITERL] = disp[BC_IITERL];\r\n  disp[BC_LOOP] = disp[BC_ILOOP];\r\n  disp[BC_FUNCF] = disp[BC_IFUNCF];\r\n  disp[BC_FUNCV] = disp[BC_IFUNCV];\r\n  GG->g.bc_cfunc_ext = GG->g.bc_cfunc_int = BCINS_AD(BC_FUNCC, LUA_MINSTACK, 0);\r\n  for (i = 0; i < GG_NUM_ASMFF; i++)\r\n    GG->bcff[i] = BCINS_AD(BC__MAX+i, 0, 0);\r\n#if LJ_TARGET_MIPS\r\n  memcpy(GG->got, dispatch_got, LJ_GOT__MAX*4);\r\n#endif\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Initialize hotcount table. */\r\nvoid lj_dispatch_init_hotcount(global_State *g)\r\n{\r\n  int32_t hotloop = G2J(g)->param[JIT_P_hotloop];\r\n  HotCount start = (HotCount)(hotloop*HOTCOUNT_LOOP - 1);\r\n  HotCount *hotcount = G2GG(g)->hotcount;\r\n  uint32_t i;\r\n  for (i = 0; i < HOTCOUNT_SIZE; i++)\r\n    hotcount[i] = start;\r\n}\r\n#endif\r\n\r\n/* Internal dispatch mode bits. */\r\n#define DISPMODE_CALL\t0x01\t/* Override call dispatch. */\r\n#define DISPMODE_RET\t0x02\t/* Override return dispatch. */\r\n#define DISPMODE_INS\t0x04\t/* Override instruction dispatch. */\r\n#define DISPMODE_JIT\t0x10\t/* JIT compiler on. */\r\n#define DISPMODE_REC\t0x20\t/* Recording active. */\r\n#define DISPMODE_PROF\t0x40\t/* Profiling active. */\r\n\r\n/* Update dispatch table depending on various flags. */\r\nvoid lj_dispatch_update(global_State *g)\r\n{\r\n  uint8_t oldmode = g->dispatchmode;\r\n  uint8_t mode = 0;\r\n#if LJ_HASJIT\r\n  mode |= (G2J(g)->flags & JIT_F_ON) ? DISPMODE_JIT : 0;\r\n  mode |= G2J(g)->state != LJ_TRACE_IDLE ?\r\n\t    (DISPMODE_REC|DISPMODE_INS|DISPMODE_CALL) : 0;\r\n#endif\r\n#if LJ_HASPROFILE\r\n  mode |= (g->hookmask & HOOK_PROFILE) ? (DISPMODE_PROF|DISPMODE_INS) : 0;\r\n#endif\r\n  mode |= (g->hookmask & (LUA_MASKLINE|LUA_MASKCOUNT)) ? DISPMODE_INS : 0;\r\n  mode |= (g->hookmask & LUA_MASKCALL) ? DISPMODE_CALL : 0;\r\n  mode |= (g->hookmask & LUA_MASKRET) ? DISPMODE_RET : 0;\r\n  if (oldmode != mode) {  /* Mode changed? */\r\n    ASMFunction *disp = G2GG(g)->dispatch;\r\n    ASMFunction f_forl, f_iterl, f_loop, f_funcf, f_funcv;\r\n    g->dispatchmode = mode;\r\n\r\n    /* Hotcount if JIT is on, but not while recording. */\r\n    if ((mode & (DISPMODE_JIT|DISPMODE_REC)) == DISPMODE_JIT) {\r\n      f_forl = makeasmfunc(lj_bc_ofs[BC_FORL]);\r\n      f_iterl = makeasmfunc(lj_bc_ofs[BC_ITERL]);\r\n      f_loop = makeasmfunc(lj_bc_ofs[BC_LOOP]);\r\n      f_funcf = makeasmfunc(lj_bc_ofs[BC_FUNCF]);\r\n      f_funcv = makeasmfunc(lj_bc_ofs[BC_FUNCV]);\r\n    } else {  /* Otherwise use the non-hotcounting instructions. */\r\n      f_forl = disp[GG_LEN_DDISP+BC_IFORL];\r\n      f_iterl = disp[GG_LEN_DDISP+BC_IITERL];\r\n      f_loop = disp[GG_LEN_DDISP+BC_ILOOP];\r\n      f_funcf = makeasmfunc(lj_bc_ofs[BC_IFUNCF]);\r\n      f_funcv = makeasmfunc(lj_bc_ofs[BC_IFUNCV]);\r\n    }\r\n    /* Init static counting instruction dispatch first (may be copied below). */\r\n    disp[GG_LEN_DDISP+BC_FORL] = f_forl;\r\n    disp[GG_LEN_DDISP+BC_ITERL] = f_iterl;\r\n    disp[GG_LEN_DDISP+BC_LOOP] = f_loop;\r\n\r\n    /* Set dynamic instruction dispatch. */\r\n    if ((oldmode ^ mode) & (DISPMODE_PROF|DISPMODE_REC|DISPMODE_INS)) {\r\n      /* Need to update the whole table. */\r\n      if (!(mode & DISPMODE_INS)) {  /* No ins dispatch? */\r\n\t/* Copy static dispatch table to dynamic dispatch table. */\r\n\tmemcpy(&disp[0], &disp[GG_LEN_DDISP], GG_LEN_SDISP*sizeof(ASMFunction));\r\n\t/* Overwrite with dynamic return dispatch. */\r\n\tif ((mode & DISPMODE_RET)) {\r\n\t  disp[BC_RETM] = lj_vm_rethook;\r\n\t  disp[BC_RET] = lj_vm_rethook;\r\n\t  disp[BC_RET0] = lj_vm_rethook;\r\n\t  disp[BC_RET1] = lj_vm_rethook;\r\n\t}\r\n      } else {\r\n\t/* The recording dispatch also checks for hooks. */\r\n\tASMFunction f = (mode & DISPMODE_PROF) ? lj_vm_profhook :\r\n\t\t\t(mode & DISPMODE_REC) ? lj_vm_record : lj_vm_inshook;\r\n\tuint32_t i;\r\n\tfor (i = 0; i < GG_LEN_SDISP; i++)\r\n\t  disp[i] = f;\r\n      }\r\n    } else if (!(mode & DISPMODE_INS)) {\r\n      /* Otherwise set dynamic counting ins. */\r\n      disp[BC_FORL] = f_forl;\r\n      disp[BC_ITERL] = f_iterl;\r\n      disp[BC_LOOP] = f_loop;\r\n      /* Set dynamic return dispatch. */\r\n      if ((mode & DISPMODE_RET)) {\r\n\tdisp[BC_RETM] = lj_vm_rethook;\r\n\tdisp[BC_RET] = lj_vm_rethook;\r\n\tdisp[BC_RET0] = lj_vm_rethook;\r\n\tdisp[BC_RET1] = lj_vm_rethook;\r\n      } else {\r\n\tdisp[BC_RETM] = disp[GG_LEN_DDISP+BC_RETM];\r\n\tdisp[BC_RET] = disp[GG_LEN_DDISP+BC_RET];\r\n\tdisp[BC_RET0] = disp[GG_LEN_DDISP+BC_RET0];\r\n\tdisp[BC_RET1] = disp[GG_LEN_DDISP+BC_RET1];\r\n      }\r\n    }\r\n\r\n    /* Set dynamic call dispatch. */\r\n    if ((oldmode ^ mode) & DISPMODE_CALL) {  /* Update the whole table? */\r\n      uint32_t i;\r\n      if ((mode & DISPMODE_CALL) == 0) {  /* No call hooks? */\r\n\tfor (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n\t  disp[i] = makeasmfunc(lj_bc_ofs[i]);\r\n      } else {\r\n\tfor (i = GG_LEN_SDISP; i < GG_LEN_DDISP; i++)\r\n\t  disp[i] = lj_vm_callhook;\r\n      }\r\n    }\r\n    if (!(mode & DISPMODE_CALL)) {  /* Overwrite dynamic counting ins. */\r\n      disp[BC_FUNCF] = f_funcf;\r\n      disp[BC_FUNCV] = f_funcv;\r\n    }\r\n\r\n#if LJ_HASJIT\r\n    /* Reset hotcounts for JIT off to on transition. */\r\n    if ((mode & DISPMODE_JIT) && !(oldmode & DISPMODE_JIT))\r\n      lj_dispatch_init_hotcount(g);\r\n#endif\r\n  }\r\n}\r\n\r\n/* -- JIT mode setting ---------------------------------------------------- */\r\n\r\n#if LJ_HASJIT\r\n/* Set JIT mode for a single prototype. */\r\nstatic void setptmode(global_State *g, GCproto *pt, int mode)\r\n{\r\n  if ((mode & LUAJIT_MODE_ON)) {  /* (Re-)enable JIT compilation. */\r\n    pt->flags &= ~PROTO_NOJIT;\r\n    lj_trace_reenableproto(pt);  /* Unpatch all ILOOP etc. bytecodes. */\r\n  } else {  /* Flush and/or disable JIT compilation. */\r\n    if (!(mode & LUAJIT_MODE_FLUSH))\r\n      pt->flags |= PROTO_NOJIT;\r\n    lj_trace_flushproto(g, pt);  /* Flush all traces of prototype. */\r\n  }\r\n}\r\n\r\n/* Recursively set the JIT mode for all children of a prototype. */\r\nstatic void setptmode_all(global_State *g, GCproto *pt, int mode)\r\n{\r\n  ptrdiff_t i;\r\n  if (!(pt->flags & PROTO_CHILD)) return;\r\n  for (i = -(ptrdiff_t)pt->sizekgc; i < 0; i++) {\r\n    GCobj *o = proto_kgc(pt, i);\r\n    if (o->gch.gct == ~LJ_TPROTO) {\r\n      setptmode(g, gco2pt(o), mode);\r\n      setptmode_all(g, gco2pt(o), mode);\r\n    }\r\n  }\r\n}\r\n#endif\r\n\r\n/* Public API function: control the JIT engine. */\r\nint luaJIT_setmode(lua_State *L, int idx, int mode)\r\n{\r\n  global_State *g = G(L);\r\n  int mm = mode & LUAJIT_MODE_MASK;\r\n  lj_trace_abort(g);  /* Abort recording on any state change. */\r\n  /* Avoid pulling the rug from under our own feet. */\r\n  if ((g->hookmask & HOOK_GC))\r\n    lj_err_caller(L, LJ_ERR_NOGCMM);\r\n  switch (mm) {\r\n#if LJ_HASJIT\r\n  case LUAJIT_MODE_ENGINE:\r\n    if ((mode & LUAJIT_MODE_FLUSH)) {\r\n      lj_trace_flushall(L);\r\n    } else {\r\n      if (!(mode & LUAJIT_MODE_ON))\r\n\tG2J(g)->flags &= ~(uint32_t)JIT_F_ON;\r\n#if LJ_TARGET_X86ORX64\r\n      else if ((G2J(g)->flags & JIT_F_SSE2))\r\n\tG2J(g)->flags |= (uint32_t)JIT_F_ON;\r\n      else\r\n\treturn 0;  /* Don't turn on JIT compiler without SSE2 support. */\r\n#else\r\n      else\r\n\tG2J(g)->flags |= (uint32_t)JIT_F_ON;\r\n#endif\r\n      lj_dispatch_update(g);\r\n    }\r\n    break;\r\n  case LUAJIT_MODE_FUNC:\r\n  case LUAJIT_MODE_ALLFUNC:\r\n  case LUAJIT_MODE_ALLSUBFUNC: {\r\n    cTValue *tv = idx == 0 ? frame_prev(L->base-1) :\r\n\t\t  idx > 0 ? L->base + (idx-1) : L->top + idx;\r\n    GCproto *pt;\r\n    if ((idx == 0 || tvisfunc(tv)) && isluafunc(&gcval(tv)->fn))\r\n      pt = funcproto(&gcval(tv)->fn);  /* Cannot use funcV() for frame slot. */\r\n    else if (tvisproto(tv))\r\n      pt = protoV(tv);\r\n    else\r\n      return 0;  /* Failed. */\r\n    if (mm != LUAJIT_MODE_ALLSUBFUNC)\r\n      setptmode(g, pt, mode);\r\n    if (mm != LUAJIT_MODE_FUNC)\r\n      setptmode_all(g, pt, mode);\r\n    break;\r\n    }\r\n  case LUAJIT_MODE_TRACE:\r\n    if (!(mode & LUAJIT_MODE_FLUSH))\r\n      return 0;  /* Failed. */\r\n    lj_trace_flush(G2J(g), idx);\r\n    break;\r\n#else\r\n  case LUAJIT_MODE_ENGINE:\r\n  case LUAJIT_MODE_FUNC:\r\n  case LUAJIT_MODE_ALLFUNC:\r\n  case LUAJIT_MODE_ALLSUBFUNC:\r\n    UNUSED(idx);\r\n    if ((mode & LUAJIT_MODE_ON))\r\n      return 0;  /* Failed. */\r\n    break;\r\n#endif\r\n  case LUAJIT_MODE_WRAPCFUNC:\r\n    if ((mode & LUAJIT_MODE_ON)) {\r\n      if (idx != 0) {\r\n\tcTValue *tv = idx > 0 ? L->base + (idx-1) : L->top + idx;\r\n\tif (tvislightud(tv))\r\n\t  g->wrapf = (lua_CFunction)lightudV(tv);\r\n\telse\r\n\t  return 0;  /* Failed. */\r\n      } else {\r\n\treturn 0;  /* Failed. */\r\n      }\r\n      g->bc_cfunc_ext = BCINS_AD(BC_FUNCCW, 0, 0);\r\n    } else {\r\n      g->bc_cfunc_ext = BCINS_AD(BC_FUNCC, 0, 0);\r\n    }\r\n    break;\r\n  default:\r\n    return 0;  /* Failed. */\r\n  }\r\n  return 1;  /* OK. */\r\n}\r\n\r\n/* Enforce (dynamic) linker error for version mismatches. See luajit.c. */\r\nLUA_API void LUAJIT_VERSION_SYM(void)\r\n{\r\n}\r\n\r\n/* -- Hooks --------------------------------------------------------------- */\r\n\r\n/* This function can be called asynchronously (e.g. during a signal). */\r\nLUA_API int lua_sethook(lua_State *L, lua_Hook func, int mask, int count)\r\n{\r\n  global_State *g = G(L);\r\n  mask &= HOOK_EVENTMASK;\r\n  if (func == NULL || mask == 0) { mask = 0; func = NULL; }  /* Consistency. */\r\n  g->hookf = func;\r\n  g->hookcount = g->hookcstart = (int32_t)count;\r\n  g->hookmask = (uint8_t)((g->hookmask & ~HOOK_EVENTMASK) | mask);\r\n  lj_trace_abort(g);  /* Abort recording on any hook change. */\r\n  lj_dispatch_update(g);\r\n  return 1;\r\n}\r\n\r\nLUA_API lua_Hook lua_gethook(lua_State *L)\r\n{\r\n  return G(L)->hookf;\r\n}\r\n\r\nLUA_API int lua_gethookmask(lua_State *L)\r\n{\r\n  return G(L)->hookmask & HOOK_EVENTMASK;\r\n}\r\n\r\nLUA_API int lua_gethookcount(lua_State *L)\r\n{\r\n  return (int)G(L)->hookcstart;\r\n}\r\n\r\n/* Call a hook. */\r\nstatic void callhook(lua_State *L, int event, BCLine line)\r\n{\r\n  global_State *g = G(L);\r\n  lua_Hook hookf = g->hookf;\r\n  if (hookf && !hook_active(g)) {\r\n    lua_Debug ar;\r\n    lj_trace_abort(g);  /* Abort recording on any hook call. */\r\n    ar.event = event;\r\n    ar.currentline = line;\r\n    /* Top frame, nextframe = NULL. */\r\n    ar.i_ci = (int)((L->base-1) - tvref(L->stack));\r\n    lj_state_checkstack(L, 1+LUA_MINSTACK);\r\n#if LJ_HASPROFILE && !LJ_PROFILE_SIGPROF\r\n    lj_profile_hook_enter(g);\r\n#else\r\n    hook_enter(g);\r\n#endif\r\n    hookf(L, &ar);\r\n    lua_assert(hook_active(g));\r\n    setgcref(g->cur_L, obj2gco(L));\r\n#if LJ_HASPROFILE && !LJ_PROFILE_SIGPROF\r\n    lj_profile_hook_leave(g);\r\n#else\r\n    hook_leave(g);\r\n#endif\r\n  }\r\n}\r\n\r\n/* -- Dispatch callbacks -------------------------------------------------- */\r\n\r\n/* Calculate number of used stack slots in the current frame. */\r\nstatic BCReg cur_topslot(GCproto *pt, const BCIns *pc, uint32_t nres)\r\n{\r\n  BCIns ins = pc[-1];\r\n  if (bc_op(ins) == BC_UCLO)\r\n    ins = pc[bc_j(ins)];\r\n  switch (bc_op(ins)) {\r\n  case BC_CALLM: case BC_CALLMT: return bc_a(ins) + bc_c(ins) + nres-1+1+LJ_FR2;\r\n  case BC_RETM: return bc_a(ins) + bc_d(ins) + nres-1;\r\n  case BC_TSETM: return bc_a(ins) + nres-1;\r\n  default: return pt->framesize;\r\n  }\r\n}\r\n\r\n/* Instruction dispatch. Used by instr/line/return hooks or when recording. */\r\nvoid LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  GCfunc *fn = curr_func(L);\r\n  GCproto *pt = funcproto(fn);\r\n  void *cf = cframe_raw(L->cframe);\r\n  const BCIns *oldpc = cframe_pc(cf);\r\n  global_State *g = G(L);\r\n  BCReg slots;\r\n  setcframe_pc(cf, pc);\r\n  slots = cur_topslot(pt, pc, cframe_multres_n(cf));\r\n  L->top = L->base + slots;  /* Fix top. */\r\n#if LJ_HASJIT\r\n  {\r\n    jit_State *J = G2J(g);\r\n    if (J->state != LJ_TRACE_IDLE) {\r\n#ifdef LUA_USE_ASSERT\r\n      ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n      J->L = L;\r\n      lj_trace_ins(J, pc-1);  /* The interpreter bytecode PC is offset by 1. */\r\n      lua_assert(L->top - L->base == delta);\r\n    }\r\n  }\r\n#endif\r\n  if ((g->hookmask & LUA_MASKCOUNT) && g->hookcount == 0) {\r\n    g->hookcount = g->hookcstart;\r\n    callhook(L, LUA_HOOKCOUNT, -1);\r\n    L->top = L->base + slots;  /* Fix top again. */\r\n  }\r\n  if ((g->hookmask & LUA_MASKLINE)) {\r\n    BCPos npc = proto_bcpos(pt, pc) - 1;\r\n    BCPos opc = proto_bcpos(pt, oldpc) - 1;\r\n    BCLine line = lj_debug_line(pt, npc);\r\n    if (pc <= oldpc || opc >= pt->sizebc || line != lj_debug_line(pt, opc)) {\r\n      callhook(L, LUA_HOOKLINE, line);\r\n      L->top = L->base + slots;  /* Fix top again. */\r\n    }\r\n  }\r\n  if ((g->hookmask & LUA_MASKRET) && bc_isret(bc_op(pc[-1])))\r\n    callhook(L, LUA_HOOKRET, -1);\r\n  ERRNO_RESTORE\r\n}\r\n\r\n/* Initialize call. Ensure stack space and return # of missing parameters. */\r\nstatic int call_init(lua_State *L, GCfunc *fn)\r\n{\r\n  if (isluafunc(fn)) {\r\n    GCproto *pt = funcproto(fn);\r\n    int numparams = pt->numparams;\r\n    int gotparams = (int)(L->top - L->base);\r\n    int need = pt->framesize;\r\n    if ((pt->flags & PROTO_VARARG)) need += 1+gotparams;\r\n    lj_state_checkstack(L, (MSize)need);\r\n    numparams -= gotparams;\r\n    return numparams >= 0 ? numparams : 0;\r\n  } else {\r\n    lj_state_checkstack(L, LUA_MINSTACK);\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Call dispatch. Used by call hooks, hot calls or when recording. */\r\nASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  GCfunc *fn = curr_func(L);\r\n  BCOp op;\r\n  global_State *g = G(L);\r\n#if LJ_HASJIT\r\n  jit_State *J = G2J(g);\r\n#endif\r\n  int missing = call_init(L, fn);\r\n#if LJ_HASJIT\r\n  J->L = L;\r\n  if ((uintptr_t)pc & 1) {  /* Marker for hot call. */\r\n#ifdef LUA_USE_ASSERT\r\n    ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n    pc = (const BCIns *)((uintptr_t)pc & ~(uintptr_t)1);\r\n    lj_trace_hot(J, pc);\r\n    lua_assert(L->top - L->base == delta);\r\n    goto out;\r\n  } else if (J->state != LJ_TRACE_IDLE &&\r\n\t     !(g->hookmask & (HOOK_GC|HOOK_VMEVENT))) {\r\n#ifdef LUA_USE_ASSERT\r\n    ptrdiff_t delta = L->top - L->base;\r\n#endif\r\n    /* Record the FUNC* bytecodes, too. */\r\n    lj_trace_ins(J, pc-1);  /* The interpreter bytecode PC is offset by 1. */\r\n    lua_assert(L->top - L->base == delta);\r\n  }\r\n#endif\r\n  if ((g->hookmask & LUA_MASKCALL)) {\r\n    int i;\r\n    for (i = 0; i < missing; i++)  /* Add missing parameters. */\r\n      setnilV(L->top++);\r\n    callhook(L, LUA_HOOKCALL, -1);\r\n    /* Preserve modifications of missing parameters by lua_setlocal(). */\r\n    while (missing-- > 0 && tvisnil(L->top - 1))\r\n      L->top--;\r\n  }\r\n#if LJ_HASJIT\r\nout:\r\n#endif\r\n  op = bc_op(pc[-1]);  /* Get FUNC* op. */\r\n#if LJ_HASJIT\r\n  /* Use the non-hotcounting variants if JIT is off or while recording. */\r\n  if ((!(J->flags & JIT_F_ON) || J->state != LJ_TRACE_IDLE) &&\r\n      (op == BC_FUNCF || op == BC_FUNCV))\r\n    op = (BCOp)((int)op+(int)BC_IFUNCF-(int)BC_FUNCF);\r\n#endif\r\n  ERRNO_RESTORE\r\n  return makeasmfunc(lj_bc_ofs[op]);  /* Return static dispatch target. */\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Stitch a new trace. */\r\nvoid LJ_FASTCALL lj_dispatch_stitch(jit_State *J, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  lua_State *L = J->L;\r\n  void *cf = cframe_raw(L->cframe);\r\n  const BCIns *oldpc = cframe_pc(cf);\r\n  setcframe_pc(cf, pc);\r\n  /* Before dispatch, have to bias PC by 1. */\r\n  L->top = L->base + cur_topslot(curr_proto(L), pc+1, cframe_multres_n(cf));\r\n  lj_trace_stitch(J, pc-1);  /* Point to the CALL instruction. */\r\n  setcframe_pc(cf, oldpc);\r\n  ERRNO_RESTORE\r\n}\r\n#endif\r\n\r\n#if LJ_HASPROFILE\r\n/* Profile dispatch. */\r\nvoid LJ_FASTCALL lj_dispatch_profile(lua_State *L, const BCIns *pc)\r\n{\r\n  ERRNO_SAVE\r\n  GCfunc *fn = curr_func(L);\r\n  GCproto *pt = funcproto(fn);\r\n  void *cf = cframe_raw(L->cframe);\r\n  const BCIns *oldpc = cframe_pc(cf);\r\n  global_State *g;\r\n  setcframe_pc(cf, pc);\r\n  L->top = L->base + cur_topslot(pt, pc, cframe_multres_n(cf));\r\n  lj_profile_interpreter(L);\r\n  setcframe_pc(cf, oldpc);\r\n  g = G(L);\r\n  setgcref(g->cur_L, obj2gco(L));\r\n  setvmstate(g, INTERP);\r\n  ERRNO_RESTORE\r\n}\r\n#endif\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_dispatch.h",
    "content": "/*\r\n** Instruction dispatch handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_DISPATCH_H\r\n#define _LJ_DISPATCH_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#endif\r\n\r\n#if LJ_TARGET_MIPS\r\n/* Need our own global offset table for the dreaded MIPS calling conventions. */\r\n#if LJ_HASJIT\r\n#define JITGOTDEF(_)\t_(lj_trace_exit) _(lj_trace_hot)\r\n#else\r\n#define JITGOTDEF(_)\r\n#endif\r\n#if LJ_HASFFI\r\n#define FFIGOTDEF(_) \\\r\n  _(lj_meta_equal_cd) _(lj_ccallback_enter) _(lj_ccallback_leave)\r\n#else\r\n#define FFIGOTDEF(_)\r\n#endif\r\n#define GOTDEF(_) \\\r\n  _(floor) _(ceil) _(trunc) _(log) _(log10) _(exp) _(sin) _(cos) _(tan) \\\r\n  _(asin) _(acos) _(atan) _(sinh) _(cosh) _(tanh) _(frexp) _(modf) _(atan2) \\\r\n  _(pow) _(fmod) _(ldexp) \\\r\n  _(lj_dispatch_call) _(lj_dispatch_ins) _(lj_dispatch_stitch) \\\r\n  _(lj_dispatch_profile) _(lj_err_throw) \\\r\n  _(lj_ffh_coroutine_wrap_err) _(lj_func_closeuv) _(lj_func_newL_gc) \\\r\n  _(lj_gc_barrieruv) _(lj_gc_step) _(lj_gc_step_fixtop) _(lj_meta_arith) \\\r\n  _(lj_meta_call) _(lj_meta_cat) _(lj_meta_comp) _(lj_meta_equal) \\\r\n  _(lj_meta_for) _(lj_meta_istype) _(lj_meta_len) _(lj_meta_tget) \\\r\n  _(lj_meta_tset) _(lj_state_growstack) _(lj_strfmt_num) \\\r\n  _(lj_str_new) _(lj_tab_dup) _(lj_tab_get) _(lj_tab_getinth) _(lj_tab_len) \\\r\n  _(lj_tab_new) _(lj_tab_newkey) _(lj_tab_next) _(lj_tab_reasize) \\\r\n  _(lj_tab_setinth) _(lj_buf_putstr_reverse) _(lj_buf_putstr_lower) \\\r\n  _(lj_buf_putstr_upper) _(lj_buf_tostr) JITGOTDEF(_) FFIGOTDEF(_)\r\n\r\nenum {\r\n#define GOTENUM(name) LJ_GOT_##name,\r\nGOTDEF(GOTENUM)\r\n#undef GOTENUM\r\n  LJ_GOT__MAX\r\n};\r\n#endif\r\n\r\n/* Type of hot counter. Must match the code in the assembler VM. */\r\n/* 16 bits are sufficient. Only 0.0015% overhead with maximum slot penalty. */\r\ntypedef uint16_t HotCount;\r\n\r\n/* Number of hot counter hash table entries (must be a power of two). */\r\n#define HOTCOUNT_SIZE\t\t64\r\n#define HOTCOUNT_PCMASK\t\t((HOTCOUNT_SIZE-1)*sizeof(HotCount))\r\n\r\n/* Hotcount decrements. */\r\n#define HOTCOUNT_LOOP\t\t2\r\n#define HOTCOUNT_CALL\t\t1\r\n\r\n/* This solves a circular dependency problem -- bump as needed. Sigh. */\r\n#define GG_NUM_ASMFF\t57\r\n\r\n#define GG_LEN_DDISP\t(BC__MAX + GG_NUM_ASMFF)\r\n#define GG_LEN_SDISP\tBC_FUNCF\r\n#define GG_LEN_DISP\t(GG_LEN_DDISP + GG_LEN_SDISP)\r\n\r\n/* Global state, main thread and extra fields are allocated together. */\r\ntypedef struct GG_State {\r\n  lua_State L;\t\t\t\t/* Main thread. */\r\n  global_State g;\t\t\t/* Global state. */\r\n#if LJ_TARGET_MIPS\r\n  ASMFunction got[LJ_GOT__MAX];\t\t/* Global offset table. */\r\n#endif\r\n#if LJ_HASJIT\r\n  jit_State J;\t\t\t\t/* JIT state. */\r\n  HotCount hotcount[HOTCOUNT_SIZE];\t/* Hot counters. */\r\n#endif\r\n  ASMFunction dispatch[GG_LEN_DISP];\t/* Instruction dispatch tables. */\r\n  BCIns bcff[GG_NUM_ASMFF];\t\t/* Bytecode for ASM fast functions. */\r\n} GG_State;\r\n\r\n#define GG_OFS(field)\t((int)offsetof(GG_State, field))\r\n#define G2GG(gl)\t((GG_State *)((char *)(gl) - GG_OFS(g)))\r\n#define J2GG(j)\t\t((GG_State *)((char *)(j) - GG_OFS(J)))\r\n#define L2GG(L)\t\t(G2GG(G(L)))\r\n#define J2G(J)\t\t(&J2GG(J)->g)\r\n#define G2J(gl)\t\t(&G2GG(gl)->J)\r\n#define L2J(L)\t\t(&L2GG(L)->J)\r\n#define GG_G2DISP\t(GG_OFS(dispatch) - GG_OFS(g))\r\n#define GG_DISP2G\t(GG_OFS(g) - GG_OFS(dispatch))\r\n#define GG_DISP2J\t(GG_OFS(J) - GG_OFS(dispatch))\r\n#define GG_DISP2HOT\t(GG_OFS(hotcount) - GG_OFS(dispatch))\r\n#define GG_DISP2STATIC\t(GG_LEN_DDISP*(int)sizeof(ASMFunction))\r\n\r\n#define hotcount_get(gg, pc) \\\r\n  (gg)->hotcount[(u32ptr(pc)>>2) & (HOTCOUNT_SIZE-1)]\r\n#define hotcount_set(gg, pc, val) \\\r\n  (hotcount_get((gg), (pc)) = (HotCount)(val))\r\n\r\n/* Dispatch table management. */\r\nLJ_FUNC void lj_dispatch_init(GG_State *GG);\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_dispatch_init_hotcount(global_State *g);\r\n#endif\r\nLJ_FUNC void lj_dispatch_update(global_State *g);\r\n\r\n/* Instruction dispatch callback for hooks or when recording. */\r\nLJ_FUNCA void LJ_FASTCALL lj_dispatch_ins(lua_State *L, const BCIns *pc);\r\nLJ_FUNCA ASMFunction LJ_FASTCALL lj_dispatch_call(lua_State *L, const BCIns*pc);\r\n#if LJ_HASJIT\r\nLJ_FUNCA void LJ_FASTCALL lj_dispatch_stitch(jit_State *J, const BCIns *pc);\r\n#endif\r\n#if LJ_HASPROFILE\r\nLJ_FUNCA void LJ_FASTCALL lj_dispatch_profile(lua_State *L, const BCIns *pc);\r\n#endif\r\n\r\n#if LJ_HASFFI && !defined(_BUILDVM_H)\r\n/* Save/restore errno and GetLastError() around hooks, exits and recording. */\r\n#include <errno.h>\r\n#if LJ_TARGET_WINDOWS\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n#define ERRNO_SAVE\tint olderr = errno; DWORD oldwerr = GetLastError();\r\n#define ERRNO_RESTORE\terrno = olderr; SetLastError(oldwerr);\r\n#else\r\n#define ERRNO_SAVE\tint olderr = errno;\r\n#define ERRNO_RESTORE\terrno = olderr;\r\n#endif\r\n#else\r\n#define ERRNO_SAVE\r\n#define ERRNO_RESTORE\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_emit_arm.h",
    "content": "/*\r\n** ARM instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Constant encoding --------------------------------------------------- */\r\n\r\nstatic uint8_t emit_invai[16] = {\r\n  /* AND */ (ARMI_AND^ARMI_BIC) >> 21,\r\n  /* EOR */ 0,\r\n  /* SUB */ (ARMI_SUB^ARMI_ADD) >> 21,\r\n  /* RSB */ 0,\r\n  /* ADD */ (ARMI_ADD^ARMI_SUB) >> 21,\r\n  /* ADC */ (ARMI_ADC^ARMI_SBC) >> 21,\r\n  /* SBC */ (ARMI_SBC^ARMI_ADC) >> 21,\r\n  /* RSC */ 0,\r\n  /* TST */ 0,\r\n  /* TEQ */ 0,\r\n  /* CMP */ (ARMI_CMP^ARMI_CMN) >> 21,\r\n  /* CMN */ (ARMI_CMN^ARMI_CMP) >> 21,\r\n  /* ORR */ 0,\r\n  /* MOV */ (ARMI_MOV^ARMI_MVN) >> 21,\r\n  /* BIC */ (ARMI_BIC^ARMI_AND) >> 21,\r\n  /* MVN */ (ARMI_MVN^ARMI_MOV) >> 21\r\n};\r\n\r\n/* Encode constant in K12 format for data processing instructions. */\r\nstatic uint32_t emit_isk12(ARMIns ai, int32_t n)\r\n{\r\n  uint32_t invai, i, m = (uint32_t)n;\r\n  /* K12: unsigned 8 bit value, rotated in steps of two bits. */\r\n  for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))\r\n    if (m <= 255) return ARMI_K12|m|i;\r\n  /* Otherwise try negation/complement with the inverse instruction. */\r\n  invai = emit_invai[((ai >> 21) & 15)];\r\n  if (!invai) return 0;  /* Failed. No inverse instruction. */\r\n  m = ~(uint32_t)n;\r\n  if (invai == ((ARMI_SUB^ARMI_ADD) >> 21) ||\r\n      invai == (ARMI_CMP^ARMI_CMN) >> 21) m++;\r\n  for (i = 0; i < 4096; i += 256, m = lj_rol(m, 2))\r\n    if (m <= 255) return ARMI_K12|(invai<<21)|m|i;\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_dnm(ASMState *as, ARMIns ai, Reg rd, Reg rn, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_N(rn) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_dm(ASMState *as, ARMIns ai, Reg rd, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_dn(ASMState *as, ARMIns ai, Reg rd, Reg rn)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd) | ARMF_N(rn);\r\n}\r\n\r\nstatic void emit_nm(ASMState *as, ARMIns ai, Reg rn, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_N(rn) | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_d(ASMState *as, ARMIns ai, Reg rd)\r\n{\r\n  *--as->mcp = ai | ARMF_D(rd);\r\n}\r\n\r\nstatic void emit_n(ASMState *as, ARMIns ai, Reg rn)\r\n{\r\n  *--as->mcp = ai | ARMF_N(rn);\r\n}\r\n\r\nstatic void emit_m(ASMState *as, ARMIns ai, Reg rm)\r\n{\r\n  *--as->mcp = ai | ARMF_M(rm);\r\n}\r\n\r\nstatic void emit_lsox(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -255 && ofs <= 255);\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMI_LSX_I | ARMF_D(rd) | ARMF_N(rn) |\r\n\t       ((ofs & 0xf0) << 4) | (ofs & 0x0f);\r\n}\r\n\r\nstatic void emit_lso(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -4095 && ofs <= 4095);\r\n  /* Combine LDR/STR pairs to LDRD/STRD. */\r\n  if (*as->mcp == (ai|ARMI_LS_P|ARMI_LS_U|ARMF_D(rd^1)|ARMF_N(rn)|(ofs^4)) &&\r\n      (ai & ~(ARMI_LDR^ARMI_STR)) == ARMI_STR && rd != rn &&\r\n      (uint32_t)ofs <= 252 && !(ofs & 3) && !((rd ^ (ofs >>2)) & 1) &&\r\n      as->mcp != as->mcloop) {\r\n    as->mcp++;\r\n    emit_lsox(as, ai == ARMI_LDR ? ARMI_LDRD : ARMI_STRD, rd&~1, rn, ofs&~4);\r\n    return;\r\n  }\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMF_D(rd) | ARMF_N(rn) | ofs;\r\n}\r\n\r\n#if !LJ_SOFTFP\r\nstatic void emit_vlso(ASMState *as, ARMIns ai, Reg rd, Reg rn, int32_t ofs)\r\n{\r\n  lua_assert(ofs >= -1020 && ofs <= 1020 && (ofs&3) == 0);\r\n  if (ofs < 0) ofs = -ofs; else ai |= ARMI_LS_U;\r\n  *--as->mcp = ai | ARMI_LS_P | ARMF_D(rd & 15) | ARMF_N(rn) | (ofs >> 2);\r\n}\r\n#endif\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer spills of BASE/L. */\r\n#define emit_canremat(ref)\t((ref) < ASMREF_L)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg d, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != d);\r\n    if (emit_canremat(ref)) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      uint32_t k = emit_isk12(ARMI_ADD, delta);\r\n      if (k) {\r\n\tif (k == ARMI_K12)\r\n\t  emit_dm(as, ARMI_MOV, d, r);\r\n\telse\r\n\t  emit_dn(as, ARMI_ADD^k, d, r);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Try to find a two step delta relative to another constant. */\r\nstatic int emit_kdelta2(ASMState *as, Reg d, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != d);\r\n    if (emit_canremat(ref)) {\r\n      int32_t other = ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i;\r\n      if (other) {\r\n\tint32_t delta = i - other;\r\n\tuint32_t sh, inv = 0, k2, k;\r\n\tif (delta < 0) { delta = -delta; inv = ARMI_ADD^ARMI_SUB; }\r\n\tsh = lj_ffs(delta) & ~1;\r\n\tk2 = emit_isk12(0, delta & (255 << sh));\r\n\tk = emit_isk12(0, delta & ~(255 << sh));\r\n\tif (k) {\r\n\t  emit_dn(as, ARMI_ADD^k2^inv, d, d);\r\n\t  emit_dn(as, ARMI_ADD^k^inv, d, r);\r\n\t  return 1;\r\n\t}\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  uint32_t k = emit_isk12(ARMI_MOV, i);\r\n  lua_assert(rset_test(as->freeset, r) || r == RID_TMP);\r\n  if (k) {\r\n    /* Standard K12 constant. */\r\n    emit_d(as, ARMI_MOV^k, r);\r\n  } else if ((as->flags & JIT_F_ARMV6T2) && (uint32_t)i < 0x00010000u) {\r\n    /* 16 bit loword constant for ARMv6T2. */\r\n    emit_d(as, ARMI_MOVW|(i & 0x0fff)|((i & 0xf000)<<4), r);\r\n  } else if (emit_kdelta1(as, r, i)) {\r\n    /* One step delta relative to another constant. */\r\n  } else if ((as->flags & JIT_F_ARMV6T2)) {\r\n    /* 32 bit hiword/loword constant for ARMv6T2. */\r\n    emit_d(as, ARMI_MOVT|((i>>16) & 0x0fff)|(((i>>16) & 0xf000)<<4), r);\r\n    emit_d(as, ARMI_MOVW|(i & 0x0fff)|((i & 0xf000)<<4), r);\r\n  } else if (emit_kdelta2(as, r, i)) {\r\n    /* Two step delta relative to another constant. */\r\n  } else {\r\n    /* Otherwise construct the constant with up to 4 instructions. */\r\n    /* NYI: use mvn+bic, use pc-relative loads. */\r\n    for (;;) {\r\n      uint32_t sh = lj_ffs(i) & ~1;\r\n      int32_t m = i & (255 << sh);\r\n      i &= ~(255 << sh);\r\n      if (i == 0) {\r\n\temit_d(as, ARMI_MOV ^ emit_isk12(0, m), r);\r\n\tbreak;\r\n      }\r\n      emit_dn(as, ARMI_ORR ^ emit_isk12(0, m), r, r);\r\n    }\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, ARMIns ai, Reg r, void *p)\r\n{\r\n  int32_t i = i32ptr(p);\r\n  emit_lso(as, ai, r, ra_allock(as, (i & ~4095), rset_exclude(RSET_GPR, r)),\r\n\t   (i & 4095));\r\n}\r\n\r\n#if !LJ_SOFTFP\r\n/* Load a number constant into an FPR. */\r\nstatic void emit_loadn(ASMState *as, Reg r, cTValue *tv)\r\n{\r\n  int32_t i;\r\n  if ((as->flags & JIT_F_VFPV3) && !tv->u32.lo) {\r\n    uint32_t hi = tv->u32.hi;\r\n    uint32_t b = ((hi >> 22) & 0x1ff);\r\n    if (!(hi & 0xffff) && (b == 0x100 || b == 0x0ff)) {\r\n      *--as->mcp = ARMI_VMOVI_D | ARMF_D(r & 15) |\r\n\t\t   ((tv->u32.hi >> 12) & 0x00080000) |\r\n\t\t   ((tv->u32.hi >> 4) & 0x00070000) |\r\n\t\t   ((tv->u32.hi >> 16) & 0x0000000f);\r\n      return;\r\n    }\r\n  }\r\n  i = i32ptr(tv);\r\n  emit_vlso(as, ARMI_VLDR_D, r,\r\n\t    ra_allock(as, (i & ~1020), RSET_GPR), (i & 1020));\r\n}\r\n#endif\r\n\r\n/* Get/set global_State fields. */\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsptr(as, ARMI_LDR, (r), (void *)&J2G(as->J)->field)\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsptr(as, ARMI_STR, (r), (void *)&J2G(as->J)->field)\r\n\r\n/* Trace number is determined from pc of exit instruction. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_branch(ASMState *as, ARMIns ai, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = (target - p) - 1;\r\n  lua_assert(((delta + 0x00800000) >> 24) == 0);\r\n  *--p = ai | ((uint32_t)delta & 0x00ffffffu);\r\n  as->mcp = p;\r\n}\r\n\r\n#define emit_jmp(as, target) emit_branch(as, ARMI_B, (target))\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = ((char *)target - (char *)p) - 8;\r\n  if ((((delta>>2) + 0x00800000) >> 24) == 0) {\r\n    if ((delta & 1))\r\n      *p = ARMI_BLX | ((uint32_t)(delta>>2) & 0x00ffffffu) | ((delta&2) << 27);\r\n    else\r\n      *p = ARMI_BL | ((uint32_t)(delta>>2) & 0x00ffffffu);\r\n  } else {  /* Target out of range: need indirect call. But don't use R0-R3. */\r\n    Reg r = ra_allock(as, i32ptr(target), RSET_RANGE(RID_R4, RID_R12+1));\r\n    *p = ARMI_BLXr | ARMF_M(r);\r\n  }\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (dst >= RID_MAX_GPR) {\r\n    emit_dm(as, irt_isnum(ir->t) ? ARMI_VMOV_D : ARMI_VMOV_S,\r\n\t    (dst & 15), (src & 15));\r\n    return;\r\n  }\r\n#endif\r\n  if (as->mcp != as->mcloop) {  /* Swap early registers for loads/stores. */\r\n    MCode ins = *as->mcp, swp = (src^dst);\r\n    if ((ins & 0x0c000000) == 0x04000000 && (ins & 0x02000010) != 0x02000010) {\r\n      if (!((ins ^ (dst << 16)) & 0x000f0000))\r\n\t*as->mcp = ins ^ (swp << 16);  /* Swap N in load/store. */\r\n      if (!(ins & 0x00100000) && !((ins ^ (dst << 12)) & 0x0000f000))\r\n\t*as->mcp = ins ^ (swp << 12);  /* Swap D in store. */\r\n    }\r\n  }\r\n  emit_dm(as, ARMI_MOV, dst, src);\r\n}\r\n\r\n/* Generic load of register with base and (small) offset address. */\r\nstatic void emit_loadofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (r >= RID_MAX_GPR)\r\n    emit_vlso(as, irt_isnum(ir->t) ? ARMI_VLDR_D : ARMI_VLDR_S, r, base, ofs);\r\n  else\r\n#endif\r\n    emit_lso(as, ARMI_LDR, r, base, ofs);\r\n}\r\n\r\n/* Generic store of register with base and (small) offset address. */\r\nstatic void emit_storeofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n#if LJ_SOFTFP\r\n  lua_assert(!irt_isnum(ir->t)); UNUSED(ir);\r\n#else\r\n  if (r >= RID_MAX_GPR)\r\n    emit_vlso(as, irt_isnum(ir->t) ? ARMI_VSTR_D : ARMI_VSTR_S, r, base, ofs);\r\n  else\r\n#endif\r\n    emit_lso(as, ARMI_STR, r, base, ofs);\r\n}\r\n\r\n/* Emit an arithmetic/logic operation with a constant operand. */\r\nstatic void emit_opk(ASMState *as, ARMIns ai, Reg dest, Reg src,\r\n\t\t     int32_t i, RegSet allow)\r\n{\r\n  uint32_t k = emit_isk12(ai, i);\r\n  if (k)\r\n    emit_dn(as, ai^k, dest, src);\r\n  else\r\n    emit_dnm(as, ai, dest, src, ra_allock(as, i, allow));\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs)\r\n    emit_opk(as, ARMI_ADD, r, r, ofs, rset_exclude(RSET_GPR, r));\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_SP, -(ofs))\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_emit_mips.h",
    "content": "/*\r\n** MIPS instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_dst(ASMState *as, MIPSIns mi, Reg rd, Reg rs, Reg rt)\r\n{\r\n  *--as->mcp = mi | MIPSF_D(rd) | MIPSF_S(rs) | MIPSF_T(rt);\r\n}\r\n\r\nstatic void emit_dta(ASMState *as, MIPSIns mi, Reg rd, Reg rt, uint32_t a)\r\n{\r\n  *--as->mcp = mi | MIPSF_D(rd) | MIPSF_T(rt) | MIPSF_A(a);\r\n}\r\n\r\n#define emit_ds(as, mi, rd, rs)\t\temit_dst(as, (mi), (rd), (rs), 0)\r\n#define emit_tg(as, mi, rt, rg)\t\temit_dst(as, (mi), (rg)&31, 0, (rt))\r\n\r\nstatic void emit_tsi(ASMState *as, MIPSIns mi, Reg rt, Reg rs, int32_t i)\r\n{\r\n  *--as->mcp = mi | MIPSF_T(rt) | MIPSF_S(rs) | (i & 0xffff);\r\n}\r\n\r\n#define emit_ti(as, mi, rt, i)\t\temit_tsi(as, (mi), (rt), 0, (i))\r\n#define emit_hsi(as, mi, rh, rs, i)\temit_tsi(as, (mi), (rh) & 31, (rs), (i))\r\n\r\nstatic void emit_fgh(ASMState *as, MIPSIns mi, Reg rf, Reg rg, Reg rh)\r\n{\r\n  *--as->mcp = mi | MIPSF_F(rf&31) | MIPSF_G(rg&31) | MIPSF_H(rh&31);\r\n}\r\n\r\n#define emit_fg(as, mi, rf, rg)\t\temit_fgh(as, (mi), (rf), (rg), 0)\r\n\r\nstatic void emit_rotr(ASMState *as, Reg dest, Reg src, Reg tmp, uint32_t shift)\r\n{\r\n  if ((as->flags & JIT_F_MIPS32R2)) {\r\n    emit_dta(as, MIPSI_ROTR, dest, src, shift);\r\n  } else {\r\n    emit_dst(as, MIPSI_OR, dest, dest, tmp);\r\n    emit_dta(as, MIPSI_SLL, dest, src, (-shift)&31);\r\n    emit_dta(as, MIPSI_SRL, tmp, src, shift);\r\n  }\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg t, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != t);\r\n    if (ref < ASMREF_L) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      if (checki16(delta)) {\r\n\temit_tsi(as, MIPSI_ADDIU, t, r, delta);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  if (checki16(i)) {\r\n    emit_ti(as, MIPSI_LI, r, i);\r\n  } else {\r\n    if ((i & 0xffff)) {\r\n      int32_t jgl = i32ptr(J2G(as->J));\r\n      if ((uint32_t)(i-jgl) < 65536) {\r\n\temit_tsi(as, MIPSI_ADDIU, r, RID_JGL, i-jgl-32768);\r\n\treturn;\r\n      } else if (emit_kdelta1(as, r, i)) {\r\n\treturn;\r\n      } else if ((i >> 16) == 0) {\r\n\temit_tsi(as, MIPSI_ORI, r, RID_ZERO, i);\r\n\treturn;\r\n      }\r\n      emit_tsi(as, MIPSI_ORI, r, r, i);\r\n    }\r\n    emit_ti(as, MIPSI_LUI, r, (i >> 16));\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\nstatic void ra_allockreg(ASMState *as, int32_t k, Reg r);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, MIPSIns mi, Reg r, void *p, RegSet allow)\r\n{\r\n  int32_t jgl = i32ptr(J2G(as->J));\r\n  int32_t i = i32ptr(p);\r\n  Reg base;\r\n  if ((uint32_t)(i-jgl) < 65536) {\r\n    i = i-jgl-32768;\r\n    base = RID_JGL;\r\n  } else {\r\n    base = ra_allock(as, i-(int16_t)i, allow);\r\n  }\r\n  emit_tsi(as, mi, r, base, i);\r\n}\r\n\r\n#define emit_loadn(as, r, tv) \\\r\n  emit_lsptr(as, MIPSI_LDC1, ((r) & 31), (void *)(tv), RSET_GPR)\r\n\r\n/* Get/set global_State fields. */\r\nstatic void emit_lsglptr(ASMState *as, MIPSIns mi, Reg r, int32_t ofs)\r\n{\r\n  emit_tsi(as, mi, r, RID_JGL, ofs-32768);\r\n}\r\n\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsglptr(as, MIPSI_LW, (r), (int32_t)offsetof(global_State, field))\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsglptr(as, MIPSI_SW, (r), (int32_t)offsetof(global_State, field))\r\n\r\n/* Trace number is determined from per-trace exit stubs. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_branch(ASMState *as, MIPSIns mi, Reg rs, Reg rt, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(((delta + 0x8000) >> 16) == 0);\r\n  *--p = mi | MIPSF_S(rs) | MIPSF_T(rt) | ((uint32_t)delta & 0xffffu);\r\n  as->mcp = p;\r\n}\r\n\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  *--as->mcp = MIPSI_NOP;\r\n  emit_branch(as, MIPSI_B, RID_ZERO, RID_ZERO, (target));\r\n}\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *--p = MIPSI_NOP;\r\n  if ((((uintptr_t)target ^ (uintptr_t)p) >> 28) == 0)\r\n    *--p = MIPSI_JAL | (((uintptr_t)target >>2) & 0x03ffffffu);\r\n  else  /* Target out of range: need indirect call. */\r\n    *--p = MIPSI_JALR | MIPSF_S(RID_CFUNCADDR);\r\n  as->mcp = p;\r\n  ra_allockreg(as, i32ptr(target), RID_CFUNCADDR);\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n#define emit_move(as, dst, src) \\\r\n  emit_ds(as, MIPSI_MOVE, (dst), (src))\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  if (dst < RID_MAX_GPR)\r\n    emit_move(as, dst, src);\r\n  else\r\n    emit_fg(as, irt_isnum(ir->t) ? MIPSI_MOV_D : MIPSI_MOV_S, dst, src);\r\n}\r\n\r\n/* Generic load of register with base and (small) offset address. */\r\nstatic void emit_loadofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tsi(as, MIPSI_LW, r, base, ofs);\r\n  else\r\n    emit_tsi(as, irt_isnum(ir->t) ? MIPSI_LDC1 : MIPSI_LWC1,\r\n\t     (r & 31), base, ofs);\r\n}\r\n\r\n/* Generic store of register with base and (small) offset address. */\r\nstatic void emit_storeofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tsi(as, MIPSI_SW, r, base, ofs);\r\n  else\r\n    emit_tsi(as, irt_isnum(ir->t) ? MIPSI_SDC1 : MIPSI_SWC1,\r\n\t     (r&31), base, ofs);\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    lua_assert(checki16(ofs));\r\n    emit_tsi(as, MIPSI_ADDIU, r, r, ofs);\r\n  }\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_SP, -(ofs))\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_emit_ppc.h",
    "content": "/*\r\n** PPC instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\nstatic void emit_tab(ASMState *as, PPCIns pi, Reg rt, Reg ra, Reg rb)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rt) | PPCF_A(ra) | PPCF_B(rb);\r\n}\r\n\r\n#define emit_asb(as, pi, ra, rs, rb)\temit_tab(as, (pi), (rs), (ra), (rb))\r\n#define emit_as(as, pi, ra, rs)\t\temit_tab(as, (pi), (rs), (ra), 0)\r\n#define emit_ab(as, pi, ra, rb)\t\temit_tab(as, (pi), 0, (ra), (rb))\r\n\r\nstatic void emit_tai(ASMState *as, PPCIns pi, Reg rt, Reg ra, int32_t i)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rt) | PPCF_A(ra) | (i & 0xffff);\r\n}\r\n\r\n#define emit_ti(as, pi, rt, i)\t\temit_tai(as, (pi), (rt), 0, (i))\r\n#define emit_ai(as, pi, ra, i)\t\temit_tai(as, (pi), 0, (ra), (i))\r\n#define emit_asi(as, pi, ra, rs, i)\temit_tai(as, (pi), (rs), (ra), (i))\r\n\r\n#define emit_fab(as, pi, rf, ra, rb) \\\r\n  emit_tab(as, (pi), (rf)&31, (ra)&31, (rb)&31)\r\n#define emit_fb(as, pi, rf, rb)\t\temit_tab(as, (pi), (rf)&31, 0, (rb)&31)\r\n#define emit_fac(as, pi, rf, ra, rc) \\\r\n  emit_tab(as, (pi) | PPCF_C((rc) & 31), (rf)&31, (ra)&31, 0)\r\n#define emit_facb(as, pi, rf, ra, rc, rb) \\\r\n  emit_tab(as, (pi) | PPCF_C((rc) & 31), (rf)&31, (ra)&31, (rb)&31)\r\n#define emit_fai(as, pi, rf, ra, i)\temit_tai(as, (pi), (rf)&31, (ra), (i))\r\n\r\nstatic void emit_rot(ASMState *as, PPCIns pi, Reg ra, Reg rs,\r\n\t\t     int32_t n, int32_t b, int32_t e)\r\n{\r\n  *--as->mcp = pi | PPCF_T(rs) | PPCF_A(ra) | PPCF_B(n) |\r\n\t       PPCF_MB(b) | PPCF_ME(e);\r\n}\r\n\r\nstatic void emit_slwi(ASMState *as, Reg ra, Reg rs, int32_t n)\r\n{\r\n  lua_assert(n >= 0 && n < 32);\r\n  emit_rot(as, PPCI_RLWINM, ra, rs, n, 0, 31-n);\r\n}\r\n\r\nstatic void emit_rotlwi(ASMState *as, Reg ra, Reg rs, int32_t n)\r\n{\r\n  lua_assert(n >= 0 && n < 32);\r\n  emit_rot(as, PPCI_RLWINM, ra, rs, n, 0, 31);\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n/* Try to find a one step delta relative to another constant. */\r\nstatic int emit_kdelta1(ASMState *as, Reg t, int32_t i)\r\n{\r\n  RegSet work = ~as->freeset & RSET_GPR;\r\n  while (work) {\r\n    Reg r = rset_picktop(work);\r\n    IRRef ref = regcost_ref(as->cost[r]);\r\n    lua_assert(r != t);\r\n    if (ref < ASMREF_L) {\r\n      int32_t delta = i - (ra_iskref(ref) ? ra_krefk(as, ref) : IR(ref)->i);\r\n      if (checki16(delta)) {\r\n\temit_tai(as, PPCI_ADDI, t, r, delta);\r\n\treturn 1;\r\n      }\r\n    }\r\n    rset_clear(work, r);\r\n  }\r\n  return 0;  /* Failed. */\r\n}\r\n\r\n/* Load a 32 bit constant into a GPR. */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  if (checki16(i)) {\r\n    emit_ti(as, PPCI_LI, r, i);\r\n  } else {\r\n    if ((i & 0xffff)) {\r\n      int32_t jgl = i32ptr(J2G(as->J));\r\n      if ((uint32_t)(i-jgl) < 65536) {\r\n\temit_tai(as, PPCI_ADDI, r, RID_JGL, i-jgl-32768);\r\n\treturn;\r\n      } else if (emit_kdelta1(as, r, i)) {\r\n\treturn;\r\n      }\r\n      emit_asi(as, PPCI_ORI, r, r, i);\r\n    }\r\n    emit_ti(as, PPCI_LIS, r, (i >> 16));\r\n  }\r\n}\r\n\r\n#define emit_loada(as, r, addr)\t\temit_loadi(as, (r), i32ptr((addr)))\r\n\r\nstatic Reg ra_allock(ASMState *as, int32_t k, RegSet allow);\r\n\r\n/* Get/set from constant pointer. */\r\nstatic void emit_lsptr(ASMState *as, PPCIns pi, Reg r, void *p, RegSet allow)\r\n{\r\n  int32_t jgl = i32ptr(J2G(as->J));\r\n  int32_t i = i32ptr(p);\r\n  Reg base;\r\n  if ((uint32_t)(i-jgl) < 65536) {\r\n    i = i-jgl-32768;\r\n    base = RID_JGL;\r\n  } else {\r\n    base = ra_allock(as, i-(int16_t)i, allow);\r\n  }\r\n  emit_tai(as, pi, r, base, i);\r\n}\r\n\r\n#define emit_loadn(as, r, tv) \\\r\n  emit_lsptr(as, PPCI_LFD, ((r) & 31), (void *)(tv), RSET_GPR)\r\n\r\n/* Get/set global_State fields. */\r\nstatic void emit_lsglptr(ASMState *as, PPCIns pi, Reg r, int32_t ofs)\r\n{\r\n  emit_tai(as, pi, r, RID_JGL, ofs-32768);\r\n}\r\n\r\n#define emit_getgl(as, r, field) \\\r\n  emit_lsglptr(as, PPCI_LWZ, (r), (int32_t)offsetof(global_State, field))\r\n#define emit_setgl(as, r, field) \\\r\n  emit_lsglptr(as, PPCI_STW, (r), (int32_t)offsetof(global_State, field))\r\n\r\n/* Trace number is determined from per-trace exit stubs. */\r\n#define emit_setvmstate(as, i)\t\tUNUSED(i)\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for internal jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\nstatic void emit_condbranch(ASMState *as, PPCIns pi, PPCCC cc, MCode *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  lua_assert(((delta + 0x8000) >> 16) == 0);\r\n  pi ^= (delta & 0x8000) * (PPCF_Y/0x8000);\r\n  *p = pi | PPCF_CC(cc) | ((uint32_t)delta & 0xffffu);\r\n}\r\n\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  *p = PPCI_B | (delta & 0x03fffffcu);\r\n}\r\n\r\nstatic void emit_call(ASMState *as, void *target)\r\n{\r\n  MCode *p = --as->mcp;\r\n  ptrdiff_t delta = (char *)target - (char *)p;\r\n  if ((((delta>>2) + 0x00800000) >> 24) == 0) {\r\n    *p = PPCI_BL | (delta & 0x03fffffcu);\r\n  } else {  /* Target out of range: need indirect call. Don't use arg reg. */\r\n    RegSet allow = RSET_GPR & ~RSET_RANGE(RID_R0, REGARG_LASTGPR+1);\r\n    Reg r = ra_allock(as, i32ptr(target), allow);\r\n    *p = PPCI_BCTRL;\r\n    p[-1] = PPCI_MTCTR | PPCF_T(r);\r\n    as->mcp = p-1;\r\n  }\r\n}\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n#define emit_mr(as, dst, src) \\\r\n  emit_asb(as, PPCI_MR, (dst), (src), (src))\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  UNUSED(ir);\r\n  if (dst < RID_MAX_GPR)\r\n    emit_mr(as, dst, src);\r\n  else\r\n    emit_fb(as, PPCI_FMR, dst, src);\r\n}\r\n\r\n/* Generic load of register with base and (small) offset address. */\r\nstatic void emit_loadofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tai(as, PPCI_LWZ, r, base, ofs);\r\n  else\r\n    emit_fai(as, irt_isnum(ir->t) ? PPCI_LFD : PPCI_LFS, r, base, ofs);\r\n}\r\n\r\n/* Generic store of register with base and (small) offset address. */\r\nstatic void emit_storeofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_tai(as, PPCI_STW, r, base, ofs);\r\n  else\r\n    emit_fai(as, irt_isnum(ir->t) ? PPCI_STFD : PPCI_STFS, r, base, ofs);\r\n}\r\n\r\n/* Emit a compare (for equality) with a constant operand. */\r\nstatic void emit_cmpi(ASMState *as, Reg r, int32_t k)\r\n{\r\n  if (checki16(k)) {\r\n    emit_ai(as, PPCI_CMPWI, r, k);\r\n  } else if (checku16(k)) {\r\n    emit_ai(as, PPCI_CMPLWI, r, k);\r\n  } else {\r\n    emit_ai(as, PPCI_CMPLWI, RID_TMP, k);\r\n    emit_asi(as, PPCI_XORIS, RID_TMP, r, (k >> 16));\r\n  }\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    emit_tai(as, PPCI_ADDI, r, r, ofs);\r\n    if (!checki16(ofs))\r\n      emit_tai(as, PPCI_ADDIS, r, r, (ofs + 32768) >> 16);\r\n  }\r\n}\r\n\r\nstatic void emit_spsub(ASMState *as, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    emit_tai(as, PPCI_STWU, RID_TMP, RID_SP, -ofs);\r\n    emit_tai(as, PPCI_ADDI, RID_TMP, RID_SP,\r\n\t     CFRAME_SIZE + (as->parent ? as->parent->spadjust : 0));\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_emit_x86.h",
    "content": "/*\r\n** x86/x64 instruction emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* -- Emit basic instructions --------------------------------------------- */\r\n\r\n#define MODRM(mode, r1, r2)\t((MCode)((mode)+(((r1)&7)<<3)+((r2)&7)))\r\n\r\n#if LJ_64\r\n#define REXRB(p, rr, rb) \\\r\n    { MCode rex = 0x40 + (((rr)>>1)&4) + (((rb)>>3)&1); \\\r\n      if (rex != 0x40) *--(p) = rex; }\r\n#define FORCE_REX\t\t0x200\r\n#define REX_64\t\t\t(FORCE_REX|0x080000)\r\n#else\r\n#define REXRB(p, rr, rb)\t((void)0)\r\n#define FORCE_REX\t\t0\r\n#define REX_64\t\t\t0\r\n#endif\r\n\r\n#define emit_i8(as, i)\t\t(*--as->mcp = (MCode)(i))\r\n#define emit_i32(as, i)\t\t(*(int32_t *)(as->mcp-4) = (i), as->mcp -= 4)\r\n#define emit_u32(as, u)\t\t(*(uint32_t *)(as->mcp-4) = (u), as->mcp -= 4)\r\n\r\n#define emit_x87op(as, xo) \\\r\n  (*(uint16_t *)(as->mcp-2) = (uint16_t)(xo), as->mcp -= 2)\r\n\r\n/* op */\r\nstatic LJ_AINLINE MCode *emit_op(x86Op xo, Reg rr, Reg rb, Reg rx,\r\n\t\t\t\t MCode *p, int delta)\r\n{\r\n  int n = (int8_t)xo;\r\n#if defined(__GNUC__)\r\n  if (__builtin_constant_p(xo) && n == -2)\r\n    p[delta-2] = (MCode)(xo >> 24);\r\n  else if (__builtin_constant_p(xo) && n == -3)\r\n    *(uint16_t *)(p+delta-3) = (uint16_t)(xo >> 16);\r\n  else\r\n#endif\r\n    *(uint32_t *)(p+delta-5) = (uint32_t)xo;\r\n  p += n + delta;\r\n#if LJ_64\r\n  {\r\n    uint32_t rex = 0x40 + ((rr>>1)&(4+(FORCE_REX>>1)))+((rx>>2)&2)+((rb>>3)&1);\r\n    if (rex != 0x40) {\r\n      rex |= (rr >> 16);\r\n      if (n == -4) { *p = (MCode)rex; rex = (MCode)(xo >> 8); }\r\n      else if ((xo & 0xffffff) == 0x6600fd) { *p = (MCode)rex; rex = 0x66; }\r\n      *--p = (MCode)rex;\r\n    }\r\n  }\r\n#else\r\n  UNUSED(rr); UNUSED(rb); UNUSED(rx);\r\n#endif\r\n  return p;\r\n}\r\n\r\n/* op + modrm */\r\n#define emit_opm(xo, mode, rr, rb, p, delta) \\\r\n  (p[(delta)-1] = MODRM((mode), (rr), (rb)), \\\r\n   emit_op((xo), (rr), (rb), 0, (p), (delta)))\r\n\r\n/* op + modrm + sib */\r\n#define emit_opmx(xo, mode, scale, rr, rb, rx, p) \\\r\n  (p[-1] = MODRM((scale), (rx), (rb)), \\\r\n   p[-2] = MODRM((mode), (rr), RID_ESP), \\\r\n   emit_op((xo), (rr), (rb), (rx), (p), -1))\r\n\r\n/* op r1, r2 */\r\nstatic void emit_rr(ASMState *as, x86Op xo, Reg r1, Reg r2)\r\n{\r\n  MCode *p = as->mcp;\r\n  as->mcp = emit_opm(xo, XM_REG, r1, r2, p, 0);\r\n}\r\n\r\n#if LJ_64 && defined(LUA_USE_ASSERT)\r\n/* [addr] is sign-extended in x64 and must be in lower 2G (not 4G). */\r\nstatic int32_t ptr2addr(const void *p)\r\n{\r\n  lua_assert((uintptr_t)p < (uintptr_t)0x80000000);\r\n  return i32ptr(p);\r\n}\r\n#else\r\n#define ptr2addr(p)\t(i32ptr((p)))\r\n#endif\r\n\r\n/* op r, [addr] */\r\nstatic void emit_rma(ASMState *as, x86Op xo, Reg rr, const void *addr)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = ptr2addr(addr);\r\n#if LJ_64\r\n  p[-5] = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n  as->mcp = emit_opm(xo, XM_OFS0, rr, RID_ESP, p, -5);\r\n#else\r\n  as->mcp = emit_opm(xo, XM_OFS0, rr, RID_EBP, p, -4);\r\n#endif\r\n}\r\n\r\n/* op r, [base+ofs] */\r\nstatic void emit_rmro(ASMState *as, x86Op xo, Reg rr, Reg rb, int32_t ofs)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode;\r\n  if (ra_hasreg(rb)) {\r\n    if (ofs == 0 && (rb&7) != RID_EBP) {\r\n      mode = XM_OFS0;\r\n    } else if (checki8(ofs)) {\r\n      *--p = (MCode)ofs;\r\n      mode = XM_OFS8;\r\n    } else {\r\n      p -= 4;\r\n      *(int32_t *)p = ofs;\r\n      mode = XM_OFS32;\r\n    }\r\n    if ((rb&7) == RID_ESP)\r\n      *--p = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n  } else {\r\n    *(int32_t *)(p-4) = ofs;\r\n#if LJ_64\r\n    p[-5] = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n    p -= 5;\r\n    rb = RID_ESP;\r\n#else\r\n    p -= 4;\r\n    rb = RID_EBP;\r\n#endif\r\n    mode = XM_OFS0;\r\n  }\r\n  as->mcp = emit_opm(xo, mode, rr, rb, p, 0);\r\n}\r\n\r\n/* op r, [base+idx*scale+ofs] */\r\nstatic void emit_rmrxo(ASMState *as, x86Op xo, Reg rr, Reg rb, Reg rx,\r\n\t\t       x86Mode scale, int32_t ofs)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode;\r\n  if (ofs == 0 && (rb&7) != RID_EBP) {\r\n    mode = XM_OFS0;\r\n  } else if (checki8(ofs)) {\r\n    mode = XM_OFS8;\r\n    *--p = (MCode)ofs;\r\n  } else {\r\n    mode = XM_OFS32;\r\n    p -= 4;\r\n    *(int32_t *)p = ofs;\r\n  }\r\n  as->mcp = emit_opmx(xo, mode, scale, rr, rb, rx, p);\r\n}\r\n\r\n/* op r, i */\r\nstatic void emit_gri(ASMState *as, x86Group xg, Reg rb, int32_t i)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    *--p = (MCode)i;\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    p -= 4;\r\n    *(int32_t *)p = i;\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  as->mcp = emit_opm(xo, XM_REG, (Reg)(xg & 7) | (rb & REX_64), rb, p, 0);\r\n}\r\n\r\n/* op [base+ofs], i */\r\nstatic void emit_gmroi(ASMState *as, x86Group xg, Reg rb, int32_t ofs,\r\n\t\t       int32_t i)\r\n{\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    emit_i8(as, i);\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    emit_i32(as, i);\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  emit_rmro(as, xo, (Reg)(xg & 7), rb, ofs);\r\n}\r\n\r\n#define emit_shifti(as, xg, r, i) \\\r\n  (emit_i8(as, (i)), emit_rr(as, XO_SHIFTi, (Reg)(xg), (r)))\r\n\r\n/* op r, rm/mrm */\r\nstatic void emit_mrm(ASMState *as, x86Op xo, Reg rr, Reg rb)\r\n{\r\n  MCode *p = as->mcp;\r\n  x86Mode mode = XM_REG;\r\n  if (rb == RID_MRM) {\r\n    rb = as->mrm.base;\r\n    if (rb == RID_NONE) {\r\n      rb = RID_EBP;\r\n      mode = XM_OFS0;\r\n      p -= 4;\r\n      *(int32_t *)p = as->mrm.ofs;\r\n      if (as->mrm.idx != RID_NONE)\r\n\tgoto mrmidx;\r\n#if LJ_64\r\n      *--p = MODRM(XM_SCALE1, RID_ESP, RID_EBP);\r\n      rb = RID_ESP;\r\n#endif\r\n    } else {\r\n      if (as->mrm.ofs == 0 && (rb&7) != RID_EBP) {\r\n\tmode = XM_OFS0;\r\n      } else if (checki8(as->mrm.ofs)) {\r\n\t*--p = (MCode)as->mrm.ofs;\r\n\tmode = XM_OFS8;\r\n      } else {\r\n\tp -= 4;\r\n\t*(int32_t *)p = as->mrm.ofs;\r\n\tmode = XM_OFS32;\r\n      }\r\n      if (as->mrm.idx != RID_NONE) {\r\n      mrmidx:\r\n\tas->mcp = emit_opmx(xo, mode, as->mrm.scale, rr, rb, as->mrm.idx, p);\r\n\treturn;\r\n      }\r\n      if ((rb&7) == RID_ESP)\r\n\t*--p = MODRM(XM_SCALE1, RID_ESP, RID_ESP);\r\n    }\r\n  }\r\n  as->mcp = emit_opm(xo, mode, rr, rb, p, 0);\r\n}\r\n\r\n/* op rm/mrm, i */\r\nstatic void emit_gmrmi(ASMState *as, x86Group xg, Reg rb, int32_t i)\r\n{\r\n  x86Op xo;\r\n  if (checki8(i)) {\r\n    emit_i8(as, i);\r\n    xo = XG_TOXOi8(xg);\r\n  } else {\r\n    emit_i32(as, i);\r\n    xo = XG_TOXOi(xg);\r\n  }\r\n  emit_mrm(as, xo, (Reg)(xg & 7) | (rb & REX_64), (rb & ~REX_64));\r\n}\r\n\r\n/* -- Emit loads/stores --------------------------------------------------- */\r\n\r\n/* mov [base+ofs], i */\r\nstatic void emit_movmroi(ASMState *as, Reg base, int32_t ofs, int32_t i)\r\n{\r\n  emit_i32(as, i);\r\n  emit_rmro(as, XO_MOVmi, 0, base, ofs);\r\n}\r\n\r\n/* mov [base+ofs], r */\r\n#define emit_movtomro(as, r, base, ofs) \\\r\n  emit_rmro(as, XO_MOVto, (r), (base), (ofs))\r\n\r\n/* Get/set global_State fields. */\r\n#define emit_opgl(as, xo, r, field) \\\r\n  emit_rma(as, (xo), (r), (void *)&J2G(as->J)->field)\r\n#define emit_getgl(as, r, field)\temit_opgl(as, XO_MOV, (r), field)\r\n#define emit_setgl(as, r, field)\temit_opgl(as, XO_MOVto, (r), field)\r\n\r\n#define emit_setvmstate(as, i) \\\r\n  (emit_i32(as, i), emit_opgl(as, XO_MOVmi, 0, vmstate))\r\n\r\n/* mov r, i / xor r, r */\r\nstatic void emit_loadi(ASMState *as, Reg r, int32_t i)\r\n{\r\n  /* XOR r,r is shorter, but modifies the flags. This is bad for HIOP. */\r\n  if (i == 0 && !(LJ_32 && (IR(as->curins)->o == IR_HIOP ||\r\n\t\t\t    (as->curins+1 < as->T->nins &&\r\n\t\t\t     IR(as->curins+1)->o == IR_HIOP)))) {\r\n    emit_rr(as, XO_ARITH(XOg_XOR), r, r);\r\n  } else {\r\n    MCode *p = as->mcp;\r\n    *(int32_t *)(p-4) = i;\r\n    p[-5] = (MCode)(XI_MOVri+(r&7));\r\n    p -= 5;\r\n    REXRB(p, 0, r);\r\n    as->mcp = p;\r\n  }\r\n}\r\n\r\n/* mov r, addr */\r\n#define emit_loada(as, r, addr) \\\r\n  emit_loadi(as, (r), ptr2addr((addr)))\r\n\r\n#if LJ_64\r\n/* mov r, imm64 or shorter 32 bit extended load. */\r\nstatic void emit_loadu64(ASMState *as, Reg r, uint64_t u64)\r\n{\r\n  if (checku32(u64)) {  /* 32 bit load clears upper 32 bits. */\r\n    emit_loadi(as, r, (int32_t)u64);\r\n  } else if (checki32((int64_t)u64)) {  /* Sign-extended 32 bit load. */\r\n    MCode *p = as->mcp;\r\n    *(int32_t *)(p-4) = (int32_t)u64;\r\n    as->mcp = emit_opm(XO_MOVmi, XM_REG, REX_64, r, p, -4);\r\n  } else {  /* Full-size 64 bit load. */\r\n    MCode *p = as->mcp;\r\n    *(uint64_t *)(p-8) = u64;\r\n    p[-9] = (MCode)(XI_MOVri+(r&7));\r\n    p[-10] = 0x48 + ((r>>3)&1);\r\n    p -= 10;\r\n    as->mcp = p;\r\n  }\r\n}\r\n#endif\r\n\r\n/* movsd r, [&tv->n] / xorps r, r */\r\nstatic void emit_loadn(ASMState *as, Reg r, cTValue *tv)\r\n{\r\n  if (tvispzero(tv))  /* Use xor only for +0. */\r\n    emit_rr(as, XO_XORPS, r, r);\r\n  else\r\n    emit_rma(as, XO_MOVSD, r, &tv->n);\r\n}\r\n\r\n/* -- Emit control-flow instructions -------------------------------------- */\r\n\r\n/* Label for short jumps. */\r\ntypedef MCode *MCLabel;\r\n\r\n#if LJ_32 && LJ_HASFFI\r\n/* jmp short target */\r\nstatic void emit_sjmp(ASMState *as, MCLabel target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int8_t)delta);\r\n  p[-1] = (MCode)(int8_t)delta;\r\n  p[-2] = XI_JMPs;\r\n  as->mcp = p - 2;\r\n}\r\n#endif\r\n\r\n/* jcc short target */\r\nstatic void emit_sjcc(ASMState *as, int cc, MCLabel target)\r\n{\r\n  MCode *p = as->mcp;\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int8_t)delta);\r\n  p[-1] = (MCode)(int8_t)delta;\r\n  p[-2] = (MCode)(XI_JCCs+(cc&15));\r\n  as->mcp = p - 2;\r\n}\r\n\r\n/* jcc short (pending target) */\r\nstatic MCLabel emit_sjcc_label(ASMState *as, int cc)\r\n{\r\n  MCode *p = as->mcp;\r\n  p[-1] = 0;\r\n  p[-2] = (MCode)(XI_JCCs+(cc&15));\r\n  as->mcp = p - 2;\r\n  return p;\r\n}\r\n\r\n/* Fixup jcc short target. */\r\nstatic void emit_sfixup(ASMState *as, MCLabel source)\r\n{\r\n  source[-1] = (MCode)(as->mcp-source);\r\n}\r\n\r\n/* Return label pointing to current PC. */\r\n#define emit_label(as)\t\t((as)->mcp)\r\n\r\n/* Compute relative 32 bit offset for jump and call instructions. */\r\nstatic LJ_AINLINE int32_t jmprel(MCode *p, MCode *target)\r\n{\r\n  ptrdiff_t delta = target - p;\r\n  lua_assert(delta == (int32_t)delta);\r\n  return (int32_t)delta;\r\n}\r\n\r\n/* jcc target */\r\nstatic void emit_jcc(ASMState *as, int cc, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = (MCode)(XI_JCCn+(cc&15));\r\n  p[-6] = 0x0f;\r\n  as->mcp = p - 6;\r\n}\r\n\r\n/* jmp target */\r\nstatic void emit_jmp(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_JMP;\r\n  as->mcp = p - 5;\r\n}\r\n\r\n/* call target */\r\nstatic void emit_call_(ASMState *as, MCode *target)\r\n{\r\n  MCode *p = as->mcp;\r\n#if LJ_64\r\n  if (target-p != (int32_t)(target-p)) {\r\n    /* Assumes RID_RET is never an argument to calls and always clobbered. */\r\n    emit_rr(as, XO_GROUP5, XOg_CALL, RID_RET);\r\n    emit_loadu64(as, RID_RET, (uint64_t)target);\r\n    return;\r\n  }\r\n#endif\r\n  *(int32_t *)(p-4) = jmprel(p, target);\r\n  p[-5] = XI_CALL;\r\n  as->mcp = p - 5;\r\n}\r\n\r\n#define emit_call(as, f)\temit_call_(as, (MCode *)(void *)(f))\r\n\r\n/* -- Emit generic operations --------------------------------------------- */\r\n\r\n/* Use 64 bit operations to handle 64 bit IR types. */\r\n#if LJ_64\r\n#define REX_64IR(ir, r)\t\t((r) + (irt_is64((ir)->t) ? REX_64 : 0))\r\n#else\r\n#define REX_64IR(ir, r)\t\t(r)\r\n#endif\r\n\r\n/* Generic move between two regs. */\r\nstatic void emit_movrr(ASMState *as, IRIns *ir, Reg dst, Reg src)\r\n{\r\n  UNUSED(ir);\r\n  if (dst < RID_MAX_GPR)\r\n    emit_rr(as, XO_MOV, REX_64IR(ir, dst), src);\r\n  else\r\n    emit_rr(as, XO_MOVAPS, dst, src);\r\n}\r\n\r\n/* Generic load of register with base and (small) offset address. */\r\nstatic void emit_loadofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_rmro(as, XO_MOV, REX_64IR(ir, r), base, ofs);\r\n  else\r\n    emit_rmro(as, irt_isnum(ir->t) ? XO_MOVSD : XO_MOVSS, r, base, ofs);\r\n}\r\n\r\n/* Generic store of register with base and (small) offset address. */\r\nstatic void emit_storeofs(ASMState *as, IRIns *ir, Reg r, Reg base, int32_t ofs)\r\n{\r\n  if (r < RID_MAX_GPR)\r\n    emit_rmro(as, XO_MOVto, REX_64IR(ir, r), base, ofs);\r\n  else\r\n    emit_rmro(as, irt_isnum(ir->t) ? XO_MOVSDto : XO_MOVSSto, r, base, ofs);\r\n}\r\n\r\n/* Add offset to pointer. */\r\nstatic void emit_addptr(ASMState *as, Reg r, int32_t ofs)\r\n{\r\n  if (ofs) {\r\n    if ((as->flags & JIT_F_LEA_AGU))\r\n      emit_rmro(as, XO_LEA, r, r, ofs);\r\n    else\r\n      emit_gri(as, XG_ARITHi(XOg_ADD), r, ofs);\r\n  }\r\n}\r\n\r\n#define emit_spsub(as, ofs)\temit_addptr(as, RID_ESP|REX_64, -(ofs))\r\n\r\n/* Prefer rematerialization of BASE/L from global_State over spills. */\r\n#define emit_canremat(ref)\t((ref) <= REF_BASE)\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_err.c",
    "content": "/*\r\n** Error handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_err_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/*\r\n** LuaJIT can either use internal or external frame unwinding:\r\n**\r\n** - Internal frame unwinding (INT) is free-standing and doesn't require\r\n**   any OS or library support.\r\n**\r\n** - External frame unwinding (EXT) uses the system-provided unwind handler.\r\n**\r\n** Pros and Cons:\r\n**\r\n** - EXT requires unwind tables for *all* functions on the C stack between\r\n**   the pcall/catch and the error/throw. This is the default on x64,\r\n**   but needs to be manually enabled on x86/PPC for non-C++ code.\r\n**\r\n** - INT is faster when actually throwing errors (but this happens rarely).\r\n**   Setting up error handlers is zero-cost in any case.\r\n**\r\n** - EXT provides full interoperability with C++ exceptions. You can throw\r\n**   Lua errors or C++ exceptions through a mix of Lua frames and C++ frames.\r\n**   C++ destructors are called as needed. C++ exceptions caught by pcall\r\n**   are converted to the string \"C++ exception\". Lua errors can be caught\r\n**   with catch (...) in C++.\r\n**\r\n** - INT has only limited support for automatically catching C++ exceptions\r\n**   on POSIX systems using DWARF2 stack unwinding. Other systems may use\r\n**   the wrapper function feature. Lua errors thrown through C++ frames\r\n**   cannot be caught by C++ code and C++ destructors are not run.\r\n**\r\n** EXT is the default on x64 systems, INT is the default on all other systems.\r\n**\r\n** EXT can be manually enabled on POSIX systems using GCC and DWARF2 stack\r\n** unwinding with -DLUAJIT_UNWIND_EXTERNAL. *All* C code must be compiled\r\n** with -funwind-tables (or -fexceptions). This includes LuaJIT itself (set\r\n** TARGET_CFLAGS), all of your C/Lua binding code, all loadable C modules\r\n** and all C libraries that have callbacks which may be used to call back\r\n** into Lua. C++ code must *not* be compiled with -fno-exceptions.\r\n**\r\n** EXT cannot be enabled on WIN32 since system exceptions use code-driven SEH.\r\n** EXT is mandatory on WIN64 since the calling convention has an abundance\r\n** of callee-saved registers (rbx, rbp, rsi, rdi, r12-r15, xmm6-xmm15).\r\n** The POSIX/x64 interpreter only saves r12/r13 for INT (e.g. PS4).\r\n*/\r\n\r\n#if defined(__GNUC__) && (LJ_TARGET_X64 || defined(LUAJIT_UNWIND_EXTERNAL)) && !LJ_NO_UNWIND\r\n#define LJ_UNWIND_EXT\t1\r\n#elif LJ_TARGET_X64 && LJ_TARGET_WINDOWS\r\n#define LJ_UNWIND_EXT\t1\r\n#endif\r\n\r\n/* -- Error messages ------------------------------------------------------ */\r\n\r\n/* Error message strings. */\r\nLJ_DATADEF const char *lj_err_allmsg =\r\n#define ERRDEF(name, msg)\tmsg \"\\0\"\r\n#include \"lj_errmsg.h\"\r\n;\r\n\r\n/* -- Internal frame unwinding -------------------------------------------- */\r\n\r\n/* Unwind Lua stack and move error message to new top. */\r\nLJ_NOINLINE static void unwindstack(lua_State *L, TValue *top)\r\n{\r\n  lj_func_closeuv(L, top);\r\n  if (top < L->top-1) {\r\n    copyTV(L, top, L->top-1);\r\n    L->top = top+1;\r\n  }\r\n  lj_state_relimitstack(L);\r\n}\r\n\r\n/* Unwind until stop frame. Optionally cleanup frames. */\r\nstatic void *err_unwind(lua_State *L, void *stopcf, int errcode)\r\n{\r\n  TValue *frame = L->base-1;\r\n  void *cf = L->cframe;\r\n  while (cf) {\r\n    int32_t nres = cframe_nres(cframe_raw(cf));\r\n    if (nres < 0) {  /* C frame without Lua frame? */\r\n      TValue *top = restorestack(L, -nres);\r\n      if (frame < top) {  /* Frame reached? */\r\n\tif (errcode) {\r\n\t  L->base = frame+1;\r\n\t  L->cframe = cframe_prev(cf);\r\n\t  unwindstack(L, top);\r\n\t}\r\n\treturn cf;\r\n      }\r\n    }\r\n    if (frame <= tvref(L->stack)+LJ_FR2)\r\n      break;\r\n    switch (frame_typep(frame)) {\r\n    case FRAME_LUA:  /* Lua frame. */\r\n    case FRAME_LUAP:\r\n      frame = frame_prevl(frame);\r\n      break;\r\n    case FRAME_C:  /* C frame. */\r\n    unwind_c:\r\n#if LJ_UNWIND_EXT\r\n      if (errcode) {\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tL->cframe = cframe_prev(cf);\r\n\tunwindstack(L, frame - LJ_FR2);\r\n      } else if (cf != stopcf) {\r\n\tcf = cframe_prev(cf);\r\n\tframe = frame_prevd(frame);\r\n\tbreak;\r\n      }\r\n      return NULL;  /* Continue unwinding. */\r\n#else\r\n      UNUSED(stopcf);\r\n      cf = cframe_prev(cf);\r\n      frame = frame_prevd(frame);\r\n      break;\r\n#endif\r\n    case FRAME_CP:  /* Protected C frame. */\r\n      if (cframe_canyield(cf)) {  /* Resume? */\r\n\tif (errcode) {\r\n\t  hook_leave(G(L));  /* Assumes nobody uses coroutines inside hooks. */\r\n\t  L->cframe = NULL;\r\n\t  L->status = (uint8_t)errcode;\r\n\t}\r\n\treturn cf;\r\n      }\r\n      if (errcode) {\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tL->cframe = cframe_prev(cf);\r\n\tunwindstack(L, frame - LJ_FR2);\r\n      }\r\n      return cf;\r\n    case FRAME_CONT:  /* Continuation frame. */\r\n      if (frame_iscont_fficb(frame))\r\n\tgoto unwind_c;\r\n    case FRAME_VARG:  /* Vararg frame. */\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_PCALL:  /* FF pcall() frame. */\r\n    case FRAME_PCALLH:  /* FF pcall() frame inside hook. */\r\n      if (errcode) {\r\n\tif (errcode == LUA_YIELD) {\r\n\t  frame = frame_prevd(frame);\r\n\t  break;\r\n\t}\r\n\tif (frame_typep(frame) == FRAME_PCALL)\r\n\t  hook_leave(G(L));\r\n\tL->base = frame_prevd(frame) + 1;\r\n\tL->cframe = cf;\r\n\tunwindstack(L, L->base);\r\n      }\r\n      return (void *)((intptr_t)cf | CFRAME_UNWIND_FF);\r\n    }\r\n  }\r\n  /* No C frame. */\r\n  if (errcode) {\r\n    L->base = tvref(L->stack)+1+LJ_FR2;\r\n    L->cframe = NULL;\r\n    unwindstack(L, L->base);\r\n    if (G(L)->panic)\r\n      G(L)->panic(L);\r\n    exit(EXIT_FAILURE);\r\n  }\r\n  return L;  /* Anything non-NULL will do. */\r\n}\r\n\r\n/* -- External frame unwinding -------------------------------------------- */\r\n\r\n#if defined(__GNUC__) && !LJ_NO_UNWIND && !LJ_TARGET_WINDOWS\r\n\r\n/*\r\n** We have to use our own definitions instead of the mandatory (!) unwind.h,\r\n** since various OS, distros and compilers mess up the header installation.\r\n*/\r\n\r\ntypedef struct _Unwind_Exception\r\n{\r\n  uint64_t exclass;\r\n  void (*excleanup)(int, struct _Unwind_Exception *);\r\n  uintptr_t p1, p2;\r\n} __attribute__((__aligned__)) _Unwind_Exception;\r\n\r\ntypedef struct _Unwind_Context _Unwind_Context;\r\n\r\n#define _URC_OK\t\t\t0\r\n#define _URC_FATAL_PHASE1_ERROR\t3\r\n#define _URC_HANDLER_FOUND\t6\r\n#define _URC_INSTALL_CONTEXT\t7\r\n#define _URC_CONTINUE_UNWIND\t8\r\n#define _URC_FAILURE\t\t9\r\n\r\n#if !LJ_TARGET_ARM\r\n\r\nextern uintptr_t _Unwind_GetCFA(_Unwind_Context *);\r\nextern void _Unwind_SetGR(_Unwind_Context *, int, uintptr_t);\r\nextern void _Unwind_SetIP(_Unwind_Context *, uintptr_t);\r\nextern void _Unwind_DeleteException(_Unwind_Exception *);\r\nextern int _Unwind_RaiseException(_Unwind_Exception *);\r\n\r\n#define _UA_SEARCH_PHASE\t1\r\n#define _UA_CLEANUP_PHASE\t2\r\n#define _UA_HANDLER_FRAME\t4\r\n#define _UA_FORCE_UNWIND\t8\r\n\r\n#define LJ_UEXCLASS\t\t0x4c55414a49543200ULL\t/* LUAJIT2\\0 */\r\n#define LJ_UEXCLASS_MAKE(c)\t(LJ_UEXCLASS | (uint64_t)(c))\r\n#define LJ_UEXCLASS_CHECK(cl)\t(((cl) ^ LJ_UEXCLASS) <= 0xff)\r\n#define LJ_UEXCLASS_ERRCODE(cl)\t((int)((cl) & 0xff))\r\n\r\n/* DWARF2 personality handler referenced from interpreter .eh_frame. */\r\nLJ_FUNCA int lj_err_unwind_dwarf(int version, int actions,\r\n  uint64_t uexclass, _Unwind_Exception *uex, _Unwind_Context *ctx)\r\n{\r\n  void *cf;\r\n  lua_State *L;\r\n  if (version != 1)\r\n    return _URC_FATAL_PHASE1_ERROR;\r\n  UNUSED(uexclass);\r\n  cf = (void *)_Unwind_GetCFA(ctx);\r\n  L = cframe_L(cf);\r\n  if ((actions & _UA_SEARCH_PHASE)) {\r\n#if LJ_UNWIND_EXT\r\n    if (err_unwind(L, cf, 0) == NULL)\r\n      return _URC_CONTINUE_UNWIND;\r\n#endif\r\n    if (!LJ_UEXCLASS_CHECK(uexclass)) {\r\n      setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n    }\r\n    return _URC_HANDLER_FOUND;\r\n  }\r\n  if ((actions & _UA_CLEANUP_PHASE)) {\r\n    int errcode;\r\n    if (LJ_UEXCLASS_CHECK(uexclass)) {\r\n      errcode = LJ_UEXCLASS_ERRCODE(uexclass);\r\n    } else {\r\n      if ((actions & _UA_HANDLER_FRAME))\r\n\t_Unwind_DeleteException(uex);\r\n      errcode = LUA_ERRRUN;\r\n    }\r\n#if LJ_UNWIND_EXT\r\n    cf = err_unwind(L, cf, errcode);\r\n    if ((actions & _UA_FORCE_UNWIND)) {\r\n      return _URC_CONTINUE_UNWIND;\r\n    } else if (cf) {\r\n      _Unwind_SetGR(ctx, LJ_TARGET_EHRETREG, errcode);\r\n      _Unwind_SetIP(ctx, (uintptr_t)(cframe_unwind_ff(cf) ?\r\n\t\t\t\t     lj_vm_unwind_ff_eh :\r\n\t\t\t\t     lj_vm_unwind_c_eh));\r\n      return _URC_INSTALL_CONTEXT;\r\n    }\r\n#if LJ_TARGET_X86ORX64\r\n    else if ((actions & _UA_HANDLER_FRAME)) {\r\n      /* Workaround for ancient libgcc bug. Still present in RHEL 5.5. :-/\r\n      ** Real fix: http://gcc.gnu.org/viewcvs/trunk/gcc/unwind-dw2.c?r1=121165&r2=124837&pathrev=153877&diff_format=h\r\n      */\r\n      _Unwind_SetGR(ctx, LJ_TARGET_EHRETREG, errcode);\r\n      _Unwind_SetIP(ctx, (uintptr_t)lj_vm_unwind_rethrow);\r\n      return _URC_INSTALL_CONTEXT;\r\n    }\r\n#endif\r\n#else\r\n    /* This is not the proper way to escape from the unwinder. We get away with\r\n    ** it on non-x64 because the interpreter restores all callee-saved regs.\r\n    */\r\n    lj_err_throw(L, errcode);\r\n#endif\r\n  }\r\n  return _URC_CONTINUE_UNWIND;\r\n}\r\n\r\n#if LJ_UNWIND_EXT\r\n#if LJ_TARGET_OSX || defined(__OpenBSD__)\r\n/* Sorry, no thread safety for OSX. Complain to Apple, not me. */\r\nstatic _Unwind_Exception static_uex;\r\n#else\r\nstatic __thread _Unwind_Exception static_uex;\r\n#endif\r\n\r\n/* Raise DWARF2 exception. */\r\nstatic void err_raise_ext(int errcode)\r\n{\r\n  static_uex.exclass = LJ_UEXCLASS_MAKE(errcode);\r\n  static_uex.excleanup = NULL;\r\n  _Unwind_RaiseException(&static_uex);\r\n}\r\n#endif\r\n\r\n#else\r\n\r\nextern void _Unwind_DeleteException(void *);\r\nextern int __gnu_unwind_frame (void *, _Unwind_Context *);\r\nextern int _Unwind_VRS_Set(_Unwind_Context *, int, uint32_t, int, void *);\r\nextern int _Unwind_VRS_Get(_Unwind_Context *, int, uint32_t, int, void *);\r\n\r\nstatic inline uint32_t _Unwind_GetGR(_Unwind_Context *ctx, int r)\r\n{\r\n  uint32_t v;\r\n  _Unwind_VRS_Get(ctx, 0, r, 0, &v);\r\n  return v;\r\n}\r\n\r\nstatic inline void _Unwind_SetGR(_Unwind_Context *ctx, int r, uint32_t v)\r\n{\r\n  _Unwind_VRS_Set(ctx, 0, r, 0, &v);\r\n}\r\n\r\n#define _US_VIRTUAL_UNWIND_FRAME\t0\r\n#define _US_UNWIND_FRAME_STARTING\t1\r\n#define _US_ACTION_MASK\t\t\t3\r\n#define _US_FORCE_UNWIND\t\t8\r\n\r\n/* ARM unwinder personality handler referenced from interpreter .ARM.extab. */\r\nLJ_FUNCA int lj_err_unwind_arm(int state, void *ucb, _Unwind_Context *ctx)\r\n{\r\n  void *cf = (void *)_Unwind_GetGR(ctx, 13);\r\n  lua_State *L = cframe_L(cf);\r\n  if ((state & _US_ACTION_MASK) == _US_VIRTUAL_UNWIND_FRAME) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n    return _URC_HANDLER_FOUND;\r\n  }\r\n  if ((state&(_US_ACTION_MASK|_US_FORCE_UNWIND)) == _US_UNWIND_FRAME_STARTING) {\r\n    _Unwind_DeleteException(ucb);\r\n    _Unwind_SetGR(ctx, 15, (uint32_t)(void *)lj_err_throw);\r\n    _Unwind_SetGR(ctx, 0, (uint32_t)L);\r\n    _Unwind_SetGR(ctx, 1, (uint32_t)LUA_ERRRUN);\r\n    return _URC_INSTALL_CONTEXT;\r\n  }\r\n  if (__gnu_unwind_frame(ucb, ctx) != _URC_OK)\r\n    return _URC_FAILURE;\r\n  return _URC_CONTINUE_UNWIND;\r\n}\r\n\r\n#endif\r\n\r\n#elif LJ_TARGET_X64 && LJ_TARGET_WINDOWS\r\n\r\n/*\r\n** Someone in Redmond owes me several days of my life. A lot of this is\r\n** undocumented or just plain wrong on MSDN. Some of it can be gathered\r\n** from 3rd party docs or must be found by trial-and-error. They really\r\n** don't want you to write your own language-specific exception handler\r\n** or to interact gracefully with MSVC. :-(\r\n**\r\n** Apparently MSVC doesn't call C++ destructors for foreign exceptions\r\n** unless you compile your C++ code with /EHa. Unfortunately this means\r\n** catch (...) also catches things like access violations. The use of\r\n** _set_se_translator doesn't really help, because it requires /EHa, too.\r\n*/\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n/* Taken from: http://www.nynaeve.net/?p=99 */\r\ntypedef struct UndocumentedDispatcherContext {\r\n  ULONG64 ControlPc;\r\n  ULONG64 ImageBase;\r\n  PRUNTIME_FUNCTION FunctionEntry;\r\n  ULONG64 EstablisherFrame;\r\n  ULONG64 TargetIp;\r\n  PCONTEXT ContextRecord;\r\n  void (*LanguageHandler)(void);\r\n  PVOID HandlerData;\r\n  PUNWIND_HISTORY_TABLE HistoryTable;\r\n  ULONG ScopeIndex;\r\n  ULONG Fill0;\r\n} UndocumentedDispatcherContext;\r\n\r\n/* Another wild guess. */\r\nextern void __DestructExceptionObject(EXCEPTION_RECORD *rec, int nothrow);\r\n\r\n#ifdef MINGW_SDK_INIT\r\n/* Workaround for broken MinGW64 declaration. */\r\nVOID RtlUnwindEx_FIXED(PVOID,PVOID,PVOID,PVOID,PVOID,PVOID) asm(\"RtlUnwindEx\");\r\n#define RtlUnwindEx RtlUnwindEx_FIXED\r\n#endif\r\n\r\n#define LJ_MSVC_EXCODE\t\t((DWORD)0xe06d7363)\r\n#define LJ_GCC_EXCODE\t\t((DWORD)0x20474343)\r\n\r\n#define LJ_EXCODE\t\t((DWORD)0xe24c4a00)\r\n#define LJ_EXCODE_MAKE(c)\t(LJ_EXCODE | (DWORD)(c))\r\n#define LJ_EXCODE_CHECK(cl)\t(((cl) ^ LJ_EXCODE) <= 0xff)\r\n#define LJ_EXCODE_ERRCODE(cl)\t((int)((cl) & 0xff))\r\n\r\n/* Win64 exception handler for interpreter frame. */\r\nLJ_FUNCA EXCEPTION_DISPOSITION lj_err_unwind_win64(EXCEPTION_RECORD *rec,\r\n  void *cf, CONTEXT *ctx, UndocumentedDispatcherContext *dispatch)\r\n{\r\n  lua_State *L = cframe_L(cf);\r\n  int errcode = LJ_EXCODE_CHECK(rec->ExceptionCode) ?\r\n\t\tLJ_EXCODE_ERRCODE(rec->ExceptionCode) : LUA_ERRRUN;\r\n  if ((rec->ExceptionFlags & 6)) {  /* EH_UNWINDING|EH_EXIT_UNWIND */\r\n    /* Unwind internal frames. */\r\n    err_unwind(L, cf, errcode);\r\n  } else {\r\n    void *cf2 = err_unwind(L, cf, 0);\r\n    if (cf2) {  /* We catch it, so start unwinding the upper frames. */\r\n      if (rec->ExceptionCode == LJ_MSVC_EXCODE ||\r\n\t  rec->ExceptionCode == LJ_GCC_EXCODE) {\r\n\t__DestructExceptionObject(rec, 1);\r\n\tsetstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRCPP));\r\n      } else if (!LJ_EXCODE_CHECK(rec->ExceptionCode)) {\r\n\t/* Don't catch access violations etc. */\r\n\treturn ExceptionContinueSearch;\r\n      }\r\n      /* Unwind the stack and call all handlers for all lower C frames\r\n      ** (including ourselves) again with EH_UNWINDING set. Then set\r\n      ** rsp = cf, rax = errcode and jump to the specified target.\r\n      */\r\n      RtlUnwindEx(cf, (void *)((cframe_unwind_ff(cf2) && errcode != LUA_YIELD) ?\r\n\t\t\t       lj_vm_unwind_ff_eh :\r\n\t\t\t       lj_vm_unwind_c_eh),\r\n\t\t  rec, (void *)(uintptr_t)errcode, ctx, dispatch->HistoryTable);\r\n      /* RtlUnwindEx should never return. */\r\n    }\r\n  }\r\n  return ExceptionContinueSearch;\r\n}\r\n\r\n/* Raise Windows exception. */\r\nstatic void err_raise_ext(int errcode)\r\n{\r\n  RaiseException(LJ_EXCODE_MAKE(errcode), 1 /* EH_NONCONTINUABLE */, 0, NULL);\r\n}\r\n\r\n#endif\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\n/* Throw error. Find catch frame, unwind stack and continue. */\r\nLJ_NOINLINE void LJ_FASTCALL lj_err_throw(lua_State *L, int errcode)\r\n{\r\n  global_State *g = G(L);\r\n  lj_trace_abort(g);\r\n  setmref(g->jit_base, NULL);\r\n  L->status = 0;\r\n#if LJ_UNWIND_EXT\r\n  err_raise_ext(errcode);\r\n  /*\r\n  ** A return from this function signals a corrupt C stack that cannot be\r\n  ** unwound. We have no choice but to call the panic function and exit.\r\n  **\r\n  ** Usually this is caused by a C function without unwind information.\r\n  ** This should never happen on x64, but may happen if you've manually\r\n  ** enabled LUAJIT_UNWIND_EXTERNAL and forgot to recompile *every*\r\n  ** non-C++ file with -funwind-tables.\r\n  */\r\n  if (G(L)->panic)\r\n    G(L)->panic(L);\r\n#else\r\n  {\r\n    void *cf = err_unwind(L, NULL, errcode);\r\n    if (cframe_unwind_ff(cf))\r\n      lj_vm_unwind_ff(cframe_raw(cf));\r\n    else\r\n      lj_vm_unwind_c(cframe_raw(cf), errcode);\r\n  }\r\n#endif\r\n  exit(EXIT_FAILURE);\r\n}\r\n\r\n/* Return string object for error message. */\r\nLJ_NOINLINE GCstr *lj_err_str(lua_State *L, ErrMsg em)\r\n{\r\n  return lj_str_newz(L, err2msg(em));\r\n}\r\n\r\n/* Out-of-memory error. */\r\nLJ_NOINLINE void lj_err_mem(lua_State *L)\r\n{\r\n  if (L->status == LUA_ERRERR+1)  /* Don't touch the stack during lua_open. */\r\n    lj_vm_unwind_c(L->cframe, LUA_ERRMEM);\r\n  setstrV(L, L->top++, lj_err_str(L, LJ_ERR_ERRMEM));\r\n  lj_err_throw(L, LUA_ERRMEM);\r\n}\r\n\r\n/* Find error function for runtime errors. Requires an extra stack traversal. */\r\nstatic ptrdiff_t finderrfunc(lua_State *L)\r\n{\r\n  cTValue *frame = L->base-1, *bot = tvref(L->stack)+LJ_FR2;\r\n  void *cf = L->cframe;\r\n  while (frame > bot && cf) {\r\n    while (cframe_nres(cframe_raw(cf)) < 0) {  /* cframe without frame? */\r\n      if (frame >= restorestack(L, -cframe_nres(cf)))\r\n\tbreak;\r\n      if (cframe_errfunc(cf) >= 0)  /* Error handler not inherited (-1)? */\r\n\treturn cframe_errfunc(cf);\r\n      cf = cframe_prev(cf);  /* Else unwind cframe and continue searching. */\r\n      if (cf == NULL)\r\n\treturn 0;\r\n    }\r\n    switch (frame_typep(frame)) {\r\n    case FRAME_LUA:\r\n    case FRAME_LUAP:\r\n      frame = frame_prevl(frame);\r\n      break;\r\n    case FRAME_C:\r\n      cf = cframe_prev(cf);\r\n      /* fallthrough */\r\n    case FRAME_VARG:\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_CONT:\r\n      if (frame_iscont_fficb(frame))\r\n\tcf = cframe_prev(cf);\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_CP:\r\n      if (cframe_canyield(cf)) return 0;\r\n      if (cframe_errfunc(cf) >= 0)\r\n\treturn cframe_errfunc(cf);\r\n      frame = frame_prevd(frame);\r\n      break;\r\n    case FRAME_PCALL:\r\n    case FRAME_PCALLH:\r\n      if (frame_func(frame_prevd(frame))->c.ffid == FF_xpcall)\r\n\treturn savestack(L, frame_prevd(frame)+1);  /* xpcall's errorfunc. */\r\n      return 0;\r\n    default:\r\n      lua_assert(0);\r\n      return 0;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Runtime error. */\r\nLJ_NOINLINE void lj_err_run(lua_State *L)\r\n{\r\n  ptrdiff_t ef = finderrfunc(L);\r\n  if (ef) {\r\n    TValue *errfunc = restorestack(L, ef);\r\n    TValue *top = L->top;\r\n    lj_trace_abort(G(L));\r\n    if (!tvisfunc(errfunc) || L->status == LUA_ERRERR) {\r\n      setstrV(L, top-1, lj_err_str(L, LJ_ERR_ERRERR));\r\n      lj_err_throw(L, LUA_ERRERR);\r\n    }\r\n    L->status = LUA_ERRERR;\r\n    copyTV(L, top+LJ_FR2, top-1);\r\n    copyTV(L, top-1, errfunc);\r\n    if (LJ_FR2) setnilV(top++);\r\n    L->top = top+1;\r\n    lj_vm_call(L, top, 1+1);  /* Stack: |errfunc|msg| -> |msg| */\r\n  }\r\n  lj_err_throw(L, LUA_ERRRUN);\r\n}\r\n\r\n/* Formatted runtime error message. */\r\nLJ_NORET LJ_NOINLINE static void err_msgv(lua_State *L, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  if (curr_funcisL(L)) L->top = curr_topL(L);\r\n  msg = lj_strfmt_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  lj_debug_addloc(L, msg, L->base-1, NULL);\r\n  lj_err_run(L);\r\n}\r\n\r\n/* Non-vararg variant for better calling conventions. */\r\nLJ_NOINLINE void lj_err_msg(lua_State *L, ErrMsg em)\r\n{\r\n  err_msgv(L, em);\r\n}\r\n\r\n/* Lexer error. */\r\nLJ_NOINLINE void lj_err_lex(lua_State *L, GCstr *src, const char *tok,\r\n\t\t\t    BCLine line, ErrMsg em, va_list argp)\r\n{\r\n  char buff[LUA_IDSIZE];\r\n  const char *msg;\r\n  lj_debug_shortname(buff, src, line);\r\n  msg = lj_strfmt_pushvf(L, err2msg(em), argp);\r\n  msg = lj_strfmt_pushf(L, \"%s:%d: %s\", buff, line, msg);\r\n  if (tok)\r\n    lj_strfmt_pushf(L, err2msg(LJ_ERR_XNEAR), msg, tok);\r\n  lj_err_throw(L, LUA_ERRSYNTAX);\r\n}\r\n\r\n/* Typecheck error for operands. */\r\nLJ_NOINLINE void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm)\r\n{\r\n  const char *tname = lj_typename(o);\r\n  const char *opname = err2msg(opm);\r\n  if (curr_funcisL(L)) {\r\n    GCproto *pt = curr_proto(L);\r\n    const BCIns *pc = cframe_Lpc(L) - 1;\r\n    const char *oname = NULL;\r\n    const char *kind = lj_debug_slotname(pt, pc, (BCReg)(o-L->base), &oname);\r\n    if (kind)\r\n      err_msgv(L, LJ_ERR_BADOPRT, opname, kind, oname, tname);\r\n  }\r\n  err_msgv(L, LJ_ERR_BADOPRV, opname, tname);\r\n}\r\n\r\n/* Typecheck error for ordered comparisons. */\r\nLJ_NOINLINE void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2)\r\n{\r\n  const char *t1 = lj_typename(o1);\r\n  const char *t2 = lj_typename(o2);\r\n  err_msgv(L, t1 == t2 ? LJ_ERR_BADCMPV : LJ_ERR_BADCMPT, t1, t2);\r\n  /* This assumes the two \"boolean\" entries are commoned by the C compiler. */\r\n}\r\n\r\n/* Typecheck error for __call. */\r\nLJ_NOINLINE void lj_err_optype_call(lua_State *L, TValue *o)\r\n{\r\n  /* Gross hack if lua_[p]call or pcall/xpcall fail for a non-callable object:\r\n  ** L->base still points to the caller. So add a dummy frame with L instead\r\n  ** of a function. See lua_getstack().\r\n  */\r\n  const BCIns *pc = cframe_Lpc(L);\r\n  if (((ptrdiff_t)pc & FRAME_TYPE) != FRAME_LUA) {\r\n    const char *tname = lj_typename(o);\r\n    if (LJ_FR2) o++;\r\n    setframe_pc(o, pc);\r\n    setframe_gc(o, obj2gco(L), LJ_TTHREAD);\r\n    L->top = L->base = o+1;\r\n    err_msgv(L, LJ_ERR_BADCALL, tname);\r\n  }\r\n  lj_err_optype(L, o, LJ_ERR_OPCALL);\r\n}\r\n\r\n/* Error in context of caller. */\r\nLJ_NOINLINE void lj_err_callermsg(lua_State *L, const char *msg)\r\n{\r\n  TValue *frame = L->base-1;\r\n  TValue *pframe = NULL;\r\n  if (frame_islua(frame)) {\r\n    pframe = frame_prevl(frame);\r\n  } else if (frame_iscont(frame)) {\r\n    if (frame_iscont_fficb(frame)) {\r\n      pframe = frame;\r\n      frame = NULL;\r\n    } else {\r\n      pframe = frame_prevd(frame);\r\n#if LJ_HASFFI\r\n      /* Remove frame for FFI metamethods. */\r\n      if (frame_func(frame)->c.ffid >= FF_ffi_meta___index &&\r\n\t  frame_func(frame)->c.ffid <= FF_ffi_meta___tostring) {\r\n\tL->base = pframe+1;\r\n\tL->top = frame;\r\n\tsetcframe_pc(cframe_raw(L->cframe), frame_contpc(frame));\r\n      }\r\n#endif\r\n    }\r\n  }\r\n  lj_debug_addloc(L, msg, pframe, frame);\r\n  lj_err_run(L);\r\n}\r\n\r\n/* Formatted error in context of caller. */\r\nLJ_NOINLINE void lj_err_callerv(lua_State *L, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  msg = lj_strfmt_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\n/* Error in context of caller. */\r\nLJ_NOINLINE void lj_err_caller(lua_State *L, ErrMsg em)\r\n{\r\n  lj_err_callermsg(L, err2msg(em));\r\n}\r\n\r\n/* Argument error message. */\r\nLJ_NORET LJ_NOINLINE static void err_argmsg(lua_State *L, int narg,\r\n\t\t\t\t\t    const char *msg)\r\n{\r\n  const char *fname = \"?\";\r\n  const char *ftype = lj_debug_funcname(L, L->base - 1, &fname);\r\n  if (narg < 0 && narg > LUA_REGISTRYINDEX)\r\n    narg = (int)(L->top - L->base) + narg + 1;\r\n  if (ftype && ftype[3] == 'h' && --narg == 0)  /* Check for \"method\". */\r\n    msg = lj_strfmt_pushf(L, err2msg(LJ_ERR_BADSELF), fname, msg);\r\n  else\r\n    msg = lj_strfmt_pushf(L, err2msg(LJ_ERR_BADARG), narg, fname, msg);\r\n  lj_err_callermsg(L, msg);\r\n}\r\n\r\n/* Formatted argument error. */\r\nLJ_NOINLINE void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, em);\r\n  msg = lj_strfmt_pushvf(L, err2msg(em), argp);\r\n  va_end(argp);\r\n  err_argmsg(L, narg, msg);\r\n}\r\n\r\n/* Argument error. */\r\nLJ_NOINLINE void lj_err_arg(lua_State *L, int narg, ErrMsg em)\r\n{\r\n  err_argmsg(L, narg, err2msg(em));\r\n}\r\n\r\n/* Typecheck error for arguments. */\r\nLJ_NOINLINE void lj_err_argtype(lua_State *L, int narg, const char *xname)\r\n{\r\n  const char *tname, *msg;\r\n  if (narg <= LUA_REGISTRYINDEX) {\r\n    if (narg >= LUA_GLOBALSINDEX) {\r\n      tname = lj_obj_itypename[~LJ_TTAB];\r\n    } else {\r\n      GCfunc *fn = curr_func(L);\r\n      int idx = LUA_GLOBALSINDEX - narg;\r\n      if (idx <= fn->c.nupvalues)\r\n\ttname = lj_typename(&fn->c.upvalue[idx-1]);\r\n      else\r\n\ttname = lj_obj_typename[0];\r\n    }\r\n  } else {\r\n    TValue *o = narg < 0 ? L->top + narg : L->base + narg-1;\r\n    tname = o < L->top ? lj_typename(o) : lj_obj_typename[0];\r\n  }\r\n  msg = lj_strfmt_pushf(L, err2msg(LJ_ERR_BADTYPE), xname, tname);\r\n  err_argmsg(L, narg, msg);\r\n}\r\n\r\n/* Typecheck error for arguments. */\r\nLJ_NOINLINE void lj_err_argt(lua_State *L, int narg, int tt)\r\n{\r\n  lj_err_argtype(L, narg, lj_obj_typename[tt+1]);\r\n}\r\n\r\n/* -- Public error handling API ------------------------------------------- */\r\n\r\nLUA_API lua_CFunction lua_atpanic(lua_State *L, lua_CFunction panicf)\r\n{\r\n  lua_CFunction old = G(L)->panic;\r\n  G(L)->panic = panicf;\r\n  return old;\r\n}\r\n\r\n/* Forwarders for the public API (C calling convention and no LJ_NORET). */\r\nLUA_API int lua_error(lua_State *L)\r\n{\r\n  lj_err_run(L);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API int luaL_argerror(lua_State *L, int narg, const char *msg)\r\n{\r\n  err_argmsg(L, narg, msg);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API int luaL_typerror(lua_State *L, int narg, const char *xname)\r\n{\r\n  lj_err_argtype(L, narg, xname);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\nLUALIB_API void luaL_where(lua_State *L, int level)\r\n{\r\n  int size;\r\n  cTValue *frame = lj_debug_frame(L, level, &size);\r\n  lj_debug_addloc(L, \"\", frame, size ? frame+size : NULL);\r\n}\r\n\r\nLUALIB_API int luaL_error(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  msg = lj_strfmt_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  lj_err_callermsg(L, msg);\r\n  return 0;  /* unreachable */\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_err.h",
    "content": "/*\r\n** Error handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_ERR_H\r\n#define _LJ_ERR_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\ntypedef enum {\r\n#define ERRDEF(name, msg) \\\r\n  LJ_ERR_##name, LJ_ERR_##name##_ = LJ_ERR_##name + sizeof(msg)-1,\r\n#include \"lj_errmsg.h\"\r\n  LJ_ERR__MAX\r\n} ErrMsg;\r\n\r\nLJ_DATA const char *lj_err_allmsg;\r\n#define err2msg(em)\t(lj_err_allmsg+(int)(em))\r\n\r\nLJ_FUNC GCstr *lj_err_str(lua_State *L, ErrMsg em);\r\nLJ_FUNCA_NORET void LJ_FASTCALL lj_err_throw(lua_State *L, int errcode);\r\nLJ_FUNC_NORET void lj_err_mem(lua_State *L);\r\nLJ_FUNC_NORET void lj_err_run(lua_State *L);\r\nLJ_FUNC_NORET void lj_err_msg(lua_State *L, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_lex(lua_State *L, GCstr *src, const char *tok,\r\n\t\t\t      BCLine line, ErrMsg em, va_list argp);\r\nLJ_FUNC_NORET void lj_err_optype(lua_State *L, cTValue *o, ErrMsg opm);\r\nLJ_FUNC_NORET void lj_err_comp(lua_State *L, cTValue *o1, cTValue *o2);\r\nLJ_FUNC_NORET void lj_err_optype_call(lua_State *L, TValue *o);\r\nLJ_FUNC_NORET void lj_err_callermsg(lua_State *L, const char *msg);\r\nLJ_FUNC_NORET void lj_err_callerv(lua_State *L, ErrMsg em, ...);\r\nLJ_FUNC_NORET void lj_err_caller(lua_State *L, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_arg(lua_State *L, int narg, ErrMsg em);\r\nLJ_FUNC_NORET void lj_err_argv(lua_State *L, int narg, ErrMsg em, ...);\r\nLJ_FUNC_NORET void lj_err_argtype(lua_State *L, int narg, const char *xname);\r\nLJ_FUNC_NORET void lj_err_argt(lua_State *L, int narg, int tt);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_errmsg.h",
    "content": "/*\r\n** VM error messages.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* This file may be included multiple times with different ERRDEF macros. */\r\n\r\n/* Basic error handling. */\r\nERRDEF(ERRMEM,\t\"not enough memory\")\r\nERRDEF(ERRERR,\t\"error in error handling\")\r\nERRDEF(ERRCPP,\t\"C++ exception\")\r\n\r\n/* Allocations. */\r\nERRDEF(STROV,\t\"string length overflow\")\r\nERRDEF(UDATAOV,\t\"userdata length overflow\")\r\nERRDEF(STKOV,\t\"stack overflow\")\r\nERRDEF(STKOVM,\t\"stack overflow (%s)\")\r\nERRDEF(TABOV,\t\"table overflow\")\r\n\r\n/* Table indexing. */\r\nERRDEF(NANIDX,\t\"table index is NaN\")\r\nERRDEF(NILIDX,\t\"table index is nil\")\r\nERRDEF(NEXTIDX,\t\"invalid key to \" LUA_QL(\"next\"))\r\n\r\n/* Metamethod resolving. */\r\nERRDEF(BADCALL,\t\"attempt to call a %s value\")\r\nERRDEF(BADOPRT,\t\"attempt to %s %s \" LUA_QS \" (a %s value)\")\r\nERRDEF(BADOPRV,\t\"attempt to %s a %s value\")\r\nERRDEF(BADCMPT,\t\"attempt to compare %s with %s\")\r\nERRDEF(BADCMPV,\t\"attempt to compare two %s values\")\r\nERRDEF(GETLOOP,\t\"loop in gettable\")\r\nERRDEF(SETLOOP,\t\"loop in settable\")\r\nERRDEF(OPCALL,\t\"call\")\r\nERRDEF(OPINDEX,\t\"index\")\r\nERRDEF(OPARITH,\t\"perform arithmetic on\")\r\nERRDEF(OPCAT,\t\"concatenate\")\r\nERRDEF(OPLEN,\t\"get length of\")\r\n\r\n/* Type checks. */\r\nERRDEF(BADSELF,\t\"calling \" LUA_QS \" on bad self (%s)\")\r\nERRDEF(BADARG,\t\"bad argument #%d to \" LUA_QS \" (%s)\")\r\nERRDEF(BADTYPE,\t\"%s expected, got %s\")\r\nERRDEF(BADVAL,\t\"invalid value\")\r\nERRDEF(NOVAL,\t\"value expected\")\r\nERRDEF(NOCORO,\t\"coroutine expected\")\r\nERRDEF(NOTABN,\t\"nil or table expected\")\r\nERRDEF(NOLFUNC,\t\"Lua function expected\")\r\nERRDEF(NOFUNCL,\t\"function or level expected\")\r\nERRDEF(NOSFT,\t\"string/function/table expected\")\r\nERRDEF(NOPROXY,\t\"boolean or proxy expected\")\r\nERRDEF(FORINIT,\tLUA_QL(\"for\") \" initial value must be a number\")\r\nERRDEF(FORLIM,\tLUA_QL(\"for\") \" limit must be a number\")\r\nERRDEF(FORSTEP,\tLUA_QL(\"for\") \" step must be a number\")\r\n\r\n/* C API checks. */\r\nERRDEF(NOENV,\t\"no calling environment\")\r\nERRDEF(CYIELD,\t\"attempt to yield across C-call boundary\")\r\nERRDEF(BADLU,\t\"bad light userdata pointer\")\r\nERRDEF(NOGCMM,\t\"bad action while in __gc metamethod\")\r\n#if LJ_TARGET_WINDOWS\r\nERRDEF(BADFPU,\t\"bad FPU precision (use D3DCREATE_FPU_PRESERVE with DirectX)\")\r\n#endif\r\n\r\n/* Standard library function errors. */\r\nERRDEF(ASSERT,\t\"assertion failed!\")\r\nERRDEF(PROTMT,\t\"cannot change a protected metatable\")\r\nERRDEF(UNPACK,\t\"too many results to unpack\")\r\nERRDEF(RDRSTR,\t\"reader function must return a string\")\r\nERRDEF(PRTOSTR,\tLUA_QL(\"tostring\") \" must return a string to \" LUA_QL(\"print\"))\r\nERRDEF(IDXRNG,\t\"index out of range\")\r\nERRDEF(BASERNG,\t\"base out of range\")\r\nERRDEF(LVLRNG,\t\"level out of range\")\r\nERRDEF(INVLVL,\t\"invalid level\")\r\nERRDEF(INVOPT,\t\"invalid option\")\r\nERRDEF(INVOPTM,\t\"invalid option \" LUA_QS)\r\nERRDEF(INVFMT,\t\"invalid format\")\r\nERRDEF(SETFENV,\tLUA_QL(\"setfenv\") \" cannot change environment of given object\")\r\nERRDEF(CORUN,\t\"cannot resume running coroutine\")\r\nERRDEF(CODEAD,\t\"cannot resume dead coroutine\")\r\nERRDEF(COSUSP,\t\"cannot resume non-suspended coroutine\")\r\nERRDEF(TABINS,\t\"wrong number of arguments to \" LUA_QL(\"insert\"))\r\nERRDEF(TABCAT,\t\"invalid value (%s) at index %d in table for \" LUA_QL(\"concat\"))\r\nERRDEF(TABSORT,\t\"invalid order function for sorting\")\r\nERRDEF(IOCLFL,\t\"attempt to use a closed file\")\r\nERRDEF(IOSTDCL,\t\"standard file is closed\")\r\nERRDEF(OSUNIQF,\t\"unable to generate a unique filename\")\r\nERRDEF(OSDATEF,\t\"field \" LUA_QS \" missing in date table\")\r\nERRDEF(STRDUMP,\t\"unable to dump given function\")\r\nERRDEF(STRSLC,\t\"string slice too long\")\r\nERRDEF(STRPATB,\t\"missing \" LUA_QL(\"[\") \" after \" LUA_QL(\"%f\") \" in pattern\")\r\nERRDEF(STRPATC,\t\"invalid pattern capture\")\r\nERRDEF(STRPATE,\t\"malformed pattern (ends with \" LUA_QL(\"%\") \")\")\r\nERRDEF(STRPATM,\t\"malformed pattern (missing \" LUA_QL(\"]\") \")\")\r\nERRDEF(STRPATU,\t\"unbalanced pattern\")\r\nERRDEF(STRPATX,\t\"pattern too complex\")\r\nERRDEF(STRCAPI,\t\"invalid capture index\")\r\nERRDEF(STRCAPN,\t\"too many captures\")\r\nERRDEF(STRCAPU,\t\"unfinished capture\")\r\nERRDEF(STRFMT,\t\"invalid option \" LUA_QS \" to \" LUA_QL(\"format\"))\r\nERRDEF(STRGSRV,\t\"invalid replacement value (a %s)\")\r\nERRDEF(BADMODN,\t\"name conflict for module \" LUA_QS)\r\n#if LJ_HASJIT\r\nERRDEF(JITPROT,\t\"runtime code generation failed, restricted kernel?\")\r\n#if LJ_TARGET_X86ORX64\r\nERRDEF(NOJIT,\t\"JIT compiler disabled, CPU does not support SSE2\")\r\n#else\r\nERRDEF(NOJIT,\t\"JIT compiler disabled\")\r\n#endif\r\n#elif defined(LJ_ARCH_NOJIT)\r\nERRDEF(NOJIT,\t\"no JIT compiler for this architecture (yet)\")\r\n#else\r\nERRDEF(NOJIT,\t\"JIT compiler permanently disabled by build option\")\r\n#endif\r\nERRDEF(JITOPT,\t\"unknown or malformed optimization flag \" LUA_QS)\r\n\r\n/* Lexer/parser errors. */\r\nERRDEF(XMODE,\t\"attempt to load chunk with wrong mode\")\r\nERRDEF(XNEAR,\t\"%s near \" LUA_QS)\r\nERRDEF(XLINES,\t\"chunk has too many lines\")\r\nERRDEF(XLEVELS,\t\"chunk has too many syntax levels\")\r\nERRDEF(XNUMBER,\t\"malformed number\")\r\nERRDEF(XLSTR,\t\"unfinished long string\")\r\nERRDEF(XLCOM,\t\"unfinished long comment\")\r\nERRDEF(XSTR,\t\"unfinished string\")\r\nERRDEF(XESC,\t\"invalid escape sequence\")\r\nERRDEF(XLDELIM,\t\"invalid long string delimiter\")\r\nERRDEF(XTOKEN,\tLUA_QS \" expected\")\r\nERRDEF(XJUMP,\t\"control structure too long\")\r\nERRDEF(XSLOTS,\t\"function or expression too complex\")\r\nERRDEF(XLIMC,\t\"chunk has more than %d local variables\")\r\nERRDEF(XLIMM,\t\"main function has more than %d %s\")\r\nERRDEF(XLIMF,\t\"function at line %d has more than %d %s\")\r\nERRDEF(XMATCH,\tLUA_QS \" expected (to close \" LUA_QS \" at line %d)\")\r\nERRDEF(XFIXUP,\t\"function too long for return fixup\")\r\nERRDEF(XPARAM,\t\"<name> or \" LUA_QL(\"...\") \" expected\")\r\n#if !LJ_52\r\nERRDEF(XAMBIG,\t\"ambiguous syntax (function call x new statement)\")\r\n#endif\r\nERRDEF(XFUNARG,\t\"function arguments expected\")\r\nERRDEF(XSYMBOL,\t\"unexpected symbol\")\r\nERRDEF(XDOTS,\t\"cannot use \" LUA_QL(\"...\") \" outside a vararg function\")\r\nERRDEF(XSYNTAX,\t\"syntax error\")\r\nERRDEF(XFOR,\tLUA_QL(\"=\") \" or \" LUA_QL(\"in\") \" expected\")\r\nERRDEF(XBREAK,\t\"no loop to break\")\r\nERRDEF(XLUNDEF,\t\"undefined label \" LUA_QS)\r\nERRDEF(XLDUP,\t\"duplicate label \" LUA_QS)\r\nERRDEF(XGSCOPE,\t\"<goto %s> jumps into the scope of local \" LUA_QS)\r\n\r\n/* Bytecode reader errors. */\r\nERRDEF(BCFMT,\t\"cannot load incompatible bytecode\")\r\nERRDEF(BCBAD,\t\"cannot load malformed bytecode\")\r\n\r\n#if LJ_HASFFI\r\n/* FFI errors. */\r\nERRDEF(FFI_INVTYPE,\t\"invalid C type\")\r\nERRDEF(FFI_INVSIZE,\t\"size of C type is unknown or too large\")\r\nERRDEF(FFI_BADSCL,\t\"bad storage class\")\r\nERRDEF(FFI_DECLSPEC,\t\"declaration specifier expected\")\r\nERRDEF(FFI_BADTAG,\t\"undeclared or implicit tag \" LUA_QS)\r\nERRDEF(FFI_REDEF,\t\"attempt to redefine \" LUA_QS)\r\nERRDEF(FFI_NUMPARAM,\t\"wrong number of type parameters\")\r\nERRDEF(FFI_INITOV,\t\"too many initializers for \" LUA_QS)\r\nERRDEF(FFI_BADCONV,\t\"cannot convert \" LUA_QS \" to \" LUA_QS)\r\nERRDEF(FFI_BADLEN,\t\"attempt to get length of \" LUA_QS)\r\nERRDEF(FFI_BADCONCAT,\t\"attempt to concatenate \" LUA_QS \" and \" LUA_QS)\r\nERRDEF(FFI_BADARITH,\t\"attempt to perform arithmetic on \" LUA_QS \" and \" LUA_QS)\r\nERRDEF(FFI_BADCOMP,\t\"attempt to compare \" LUA_QS \" with \" LUA_QS)\r\nERRDEF(FFI_BADCALL,\tLUA_QS \" is not callable\")\r\nERRDEF(FFI_NUMARG,\t\"wrong number of arguments for function call\")\r\nERRDEF(FFI_BADMEMBER,\tLUA_QS \" has no member named \" LUA_QS)\r\nERRDEF(FFI_BADIDX,\tLUA_QS \" cannot be indexed\")\r\nERRDEF(FFI_BADIDXW,\tLUA_QS \" cannot be indexed with \" LUA_QS)\r\nERRDEF(FFI_BADMM,\tLUA_QS \" has no \" LUA_QS \" metamethod\")\r\nERRDEF(FFI_WRCONST,\t\"attempt to write to constant location\")\r\nERRDEF(FFI_NODECL,\t\"missing declaration for symbol \" LUA_QS)\r\nERRDEF(FFI_BADCBACK,\t\"bad callback\")\r\n#if LJ_OS_NOJIT\r\nERRDEF(FFI_CBACKOV,\t\"no support for callbacks on this OS\")\r\n#else\r\nERRDEF(FFI_CBACKOV,\t\"too many callbacks\")\r\n#endif\r\nERRDEF(FFI_NYIPACKBIT,\t\"NYI: packed bit fields\")\r\nERRDEF(FFI_NYICALL,\t\"NYI: cannot call this C function (yet)\")\r\n#endif\r\n\r\n#undef ERRDEF\r\n\r\n/* Detecting unused error messages:\r\n   awk -F, '/^ERRDEF/ { gsub(/ERRDEF./, \"\"); printf \"grep -q LJ_ERR_%s *.[ch] || echo %s\\n\", $1, $1}' lj_errmsg.h | sh\r\n*/\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ff.h",
    "content": "/*\r\n** Fast function IDs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FF_H\r\n#define _LJ_FF_H\r\n\r\n/* Fast function ID. */\r\ntypedef enum {\r\n  FF_LUA_ = FF_LUA,\t/* Lua function (must be 0). */\r\n  FF_C_ = FF_C,\t\t/* Regular C function (must be 1). */\r\n#define FFDEF(name)\tFF_##name,\r\n#include \"lj_ffdef.h\"\r\n  FF__MAX\r\n} FastFunc;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ffrecord.c",
    "content": "/*\r\n** Fast function call recorder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ffrecord_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_crecord.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* -- Fast function recording handlers ------------------------------------ */\r\n\r\n/* Conventions for fast function call handlers:\r\n**\r\n** The argument slots start at J->base[0]. All of them are guaranteed to be\r\n** valid and type-specialized references. J->base[J->maxslot] is set to 0\r\n** as a sentinel. The runtime argument values start at rd->argv[0].\r\n**\r\n** In general fast functions should check for presence of all of their\r\n** arguments and for the correct argument types. Some simplifications\r\n** are allowed if the interpreter throws instead. But even if recording\r\n** is aborted, the generated IR must be consistent (no zero-refs).\r\n**\r\n** The number of results in rd->nres is set to 1. Handlers that return\r\n** a different number of results need to override it. A negative value\r\n** prevents return processing (e.g. for pending calls).\r\n**\r\n** Results need to be stored starting at J->base[0]. Return processing\r\n** moves them to the right slots later.\r\n**\r\n** The per-ffid auxiliary data is the value of the 2nd part of the\r\n** LJLIB_REC() annotation. This allows handling similar functionality\r\n** in a common handler.\r\n*/\r\n\r\n/* Type of handler to record a fast function. */\r\ntypedef void (LJ_FASTCALL *RecordFunc)(jit_State *J, RecordFFData *rd);\r\n\r\n/* Get runtime value of int argument. */\r\nstatic int32_t argv2int(jit_State *J, TValue *o)\r\n{\r\n  if (!lj_strscan_numberobj(o))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  return tvisint(o) ? intV(o) : lj_num2int(numV(o));\r\n}\r\n\r\n/* Get runtime value of string argument. */\r\nstatic GCstr *argv2str(jit_State *J, TValue *o)\r\n{\r\n  if (LJ_LIKELY(tvisstr(o))) {\r\n    return strV(o);\r\n  } else {\r\n    GCstr *s;\r\n    if (!tvisnumber(o))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    s = lj_strfmt_number(J->L, o);\r\n    setstrV(J->L, o, s);\r\n    return s;\r\n  }\r\n}\r\n\r\n/* Return number of results wanted by caller. */\r\nstatic ptrdiff_t results_wanted(jit_State *J)\r\n{\r\n  TValue *frame = J->L->base-1;\r\n  if (frame_islua(frame))\r\n    return (ptrdiff_t)bc_b(frame_pc(frame)[-1]) - 1;\r\n  else\r\n    return -1;\r\n}\r\n\r\n#ifdef LUAJIT_TRACE_STITCHING\r\n/* This feature is disabled for now due to a design mistake. Sorry.\r\n**\r\n** It causes unpredictable behavior and crashes when a full trace flush\r\n** happens with a stitching continuation still in the stack somewhere.\r\n*/\r\n\r\n/* Trace stitching: add continuation below frame to start a new trace. */\r\nstatic void recff_stitch(jit_State *J)\r\n{\r\n  ASMFunction cont = lj_cont_stitch;\r\n  TraceNo traceno = J->cur.traceno;\r\n  lua_State *L = J->L;\r\n  TValue *base = L->base;\r\n  const BCIns *pc = frame_pc(base-1);\r\n  TValue *pframe = frame_prevl(base-1);\r\n  TRef trcont;\r\n\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: handle frame shift. */\r\n  /* Move func + args up in Lua stack and insert continuation. */\r\n  memmove(&base[1], &base[-1], sizeof(TValue)*(J->maxslot+1));\r\n  setframe_ftsz(base+1, ((char *)(base+1) - (char *)pframe) + FRAME_CONT);\r\n  setcont(base, cont);\r\n  setframe_pc(base, pc);\r\n  if (LJ_DUALNUM) setintV(base-1, traceno); else base[-1].u64 = traceno;\r\n  L->base += 2;\r\n  L->top += 2;\r\n\r\n  /* Ditto for the IR. */\r\n  memmove(&J->base[1], &J->base[-1], sizeof(TRef)*(J->maxslot+1));\r\n#if LJ_64\r\n  trcont = lj_ir_kptr(J, (void *)((int64_t)cont-(int64_t)lj_vm_asm_begin));\r\n#else\r\n  trcont = lj_ir_kptr(J, (void *)cont);\r\n#endif\r\n  J->base[0] = trcont | TREF_CONT;\r\n  J->base[-1] = LJ_DUALNUM ? lj_ir_kint(J,traceno) : lj_ir_knum_u64(J,traceno);\r\n  J->base += 2;\r\n  J->baseslot += 2;\r\n  J->framedepth++;\r\n\r\n  lj_record_stop(J, LJ_TRLINK_STITCH, 0);\r\n\r\n  /* Undo Lua stack changes. */\r\n  memmove(&base[-1], &base[1], sizeof(TValue)*(J->maxslot+1));\r\n  setframe_pc(base-1, pc);\r\n  L->base -= 2;\r\n  L->top -= 2;\r\n}\r\n\r\n/* Fallback handler for fast functions that are not recorded (yet). */\r\nstatic void LJ_FASTCALL recff_nyi(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (J->cur.nins < (IRRef)J->param[JIT_P_minstitch] + REF_BASE) {\r\n    lj_trace_err_info(J, LJ_TRERR_TRACEUV);\r\n  } else {\r\n    /* Can only stitch from Lua call. */\r\n    if (J->framedepth && frame_islua(J->L->base-1)) {\r\n      BCOp op = bc_op(*frame_pc(J->L->base-1));\r\n      /* Stitched trace cannot start with *M op with variable # of args. */\r\n      if (!(op == BC_CALLM || op == BC_CALLMT ||\r\n\t    op == BC_RETM || op == BC_TSETM)) {\r\n\tswitch (J->fn->c.ffid) {\r\n\tcase FF_error:\r\n\tcase FF_debug_sethook:\r\n\tcase FF_jit_flush:\r\n\t  break;  /* Don't stitch across special builtins. */\r\n\tdefault:\r\n\t  recff_stitch(J);  /* Use trace stitching. */\r\n\t  rd->nres = -1;\r\n\t  return;\r\n\t}\r\n      }\r\n    }\r\n    /* Otherwise stop trace and return to interpreter. */\r\n    lj_record_stop(J, LJ_TRLINK_RETURN, 0);\r\n    rd->nres = -1;\r\n  }\r\n}\r\n\r\n/* Fallback handler for unsupported variants of fast functions. */\r\n#define recff_nyiu\trecff_nyi\r\n\r\n/* Must stop the trace for classic C functions with arbitrary side-effects. */\r\n#define recff_c\t\trecff_nyi\r\n#else\r\n/* Fallback handler for fast functions that are not recorded (yet). */\r\nstatic void LJ_FASTCALL recff_nyi(jit_State *J, RecordFFData *rd)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYIFF);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Throw error for unsupported variant of fast function. */\r\nLJ_NORET static void recff_nyiu(jit_State *J, RecordFFData *rd)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYIFFU);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Must abort the trace for classic C functions with arbitrary side-effects. */\r\nstatic void LJ_FASTCALL recff_c(jit_State *J, RecordFFData *rd)\r\n{\r\n  setfuncV(J->L, &J->errinfo, J->fn);\r\n  lj_trace_err_info(J, LJ_TRERR_NYICF);\r\n  UNUSED(rd);\r\n}\r\n#endif\r\n\r\n/* Emit BUFHDR for the global temporary buffer. */\r\nstatic TRef recff_bufhdr(jit_State *J)\r\n{\r\n  return emitir(IRT(IR_BUFHDR, IRT_P32),\r\n\t\tlj_ir_kptr(J, &J2G(J)->tmpbuf), IRBUFHDR_RESET);\r\n}\r\n\r\n/* -- Base library fast functions ----------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_assert(jit_State *J, RecordFFData *rd)\r\n{\r\n  /* Arguments already specialized. The interpreter throws for nil/false. */\r\n  rd->nres = J->maxslot;  /* Pass through all arguments. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_type(jit_State *J, RecordFFData *rd)\r\n{\r\n  /* Arguments already specialized. Result is a constant string. Neat, huh? */\r\n  uint32_t t;\r\n  if (tvisnumber(&rd->argv[0]))\r\n    t = ~LJ_TNUMX;\r\n  else if (LJ_64 && !LJ_GC64 && tvislightud(&rd->argv[0]))\r\n    t = ~LJ_TLIGHTUD;\r\n  else\r\n    t = ~itype(&rd->argv[0]);\r\n  J->base[0] = lj_ir_kstr(J, strV(&J->fn->c.upvalue[t]));\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_getmetatable(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    RecordIndex ix;\r\n    ix.tab = tr;\r\n    copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n    if (lj_record_mm_lookup(J, &ix, MM_metatable))\r\n      J->base[0] = ix.mobj;\r\n    else\r\n      J->base[0] = ix.mt;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_setmetatable(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  TRef mt = J->base[1];\r\n  if (tref_istab(tr) && (tref_istab(mt) || (mt && tref_isnil(mt)))) {\r\n    TRef fref, mtref;\r\n    RecordIndex ix;\r\n    ix.tab = tr;\r\n    copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n    lj_record_mm_lookup(J, &ix, MM_metatable); /* Guard for no __metatable. */\r\n    fref = emitir(IRT(IR_FREF, IRT_P32), tr, IRFL_TAB_META);\r\n    mtref = tref_isnil(mt) ? lj_ir_knull(J, IRT_TAB) : mt;\r\n    emitir(IRT(IR_FSTORE, IRT_TAB), fref, mtref);\r\n    if (!tref_isnil(mt))\r\n      emitir(IRT(IR_TBAR, IRT_TAB), tr, 0);\r\n    J->base[0] = tr;\r\n    J->needsnap = 1;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawget(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0]; ix.key = J->base[1];\r\n  if (tref_istab(ix.tab) && ix.key) {\r\n    ix.val = 0; ix.idxchain = 0;\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    copyTV(J->L, &ix.keyv, &rd->argv[1]);\r\n    J->base[0] = lj_record_idx(J, &ix);\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawset(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0]; ix.key = J->base[1]; ix.val = J->base[2];\r\n  if (tref_istab(ix.tab) && ix.key && ix.val) {\r\n    ix.idxchain = 0;\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    copyTV(J->L, &ix.keyv, &rd->argv[1]);\r\n    copyTV(J->L, &ix.valv, &rd->argv[2]);\r\n    lj_record_idx(J, &ix);\r\n    /* Pass through table at J->base[0] as result. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_rawequal(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tra = J->base[0];\r\n  TRef trb = J->base[1];\r\n  if (tra && trb) {\r\n    int diff = lj_record_objcmp(J, tra, trb, &rd->argv[0], &rd->argv[1]);\r\n    J->base[0] = diff ? TREF_FALSE : TREF_TRUE;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\n#if LJ_52\r\nstatic void LJ_FASTCALL recff_rawlen(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isstr(tr))\r\n    J->base[0] = emitir(IRTI(IR_FLOAD), tr, IRFL_STR_LEN);\r\n  else if (tref_istab(tr))\r\n    J->base[0] = lj_ir_call(J, IRCALL_lj_tab_len, tr);\r\n  /* else: Interpreter will throw. */\r\n  UNUSED(rd);\r\n}\r\n#endif\r\n\r\n/* Determine mode of select() call. */\r\nint32_t lj_ffrecord_select_mode(jit_State *J, TRef tr, TValue *tv)\r\n{\r\n  if (tref_isstr(tr) && *strVdata(tv) == '#') {  /* select('#', ...) */\r\n    if (strV(tv)->len == 1) {\r\n      emitir(IRTG(IR_EQ, IRT_STR), tr, lj_ir_kstr(J, strV(tv)));\r\n    } else {\r\n      TRef trptr = emitir(IRT(IR_STRREF, IRT_P32), tr, lj_ir_kint(J, 0));\r\n      TRef trchar = emitir(IRT(IR_XLOAD, IRT_U8), trptr, IRXLOAD_READONLY);\r\n      emitir(IRTG(IR_EQ, IRT_INT), trchar, lj_ir_kint(J, '#'));\r\n    }\r\n    return 0;\r\n  } else {  /* select(n, ...) */\r\n    int32_t start = argv2int(J, tv);\r\n    if (start == 0) lj_trace_err(J, LJ_TRERR_BADTYPE);  /* A bit misleading. */\r\n    return start;\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_select(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tr) {\r\n    ptrdiff_t start = lj_ffrecord_select_mode(J, tr, &rd->argv[0]);\r\n    if (start == 0) {  /* select('#', ...) */\r\n      J->base[0] = lj_ir_kint(J, J->maxslot - 1);\r\n    } else if (tref_isk(tr)) {  /* select(k, ...) */\r\n      ptrdiff_t n = (ptrdiff_t)J->maxslot;\r\n      if (start < 0) start += n;\r\n      else if (start > n) start = n;\r\n      rd->nres = n - start;\r\n      if (start >= 1) {\r\n\tptrdiff_t i;\r\n\tfor (i = 0; i < n - start; i++)\r\n\t  J->base[i] = J->base[start+i];\r\n      }  /* else: Interpreter will throw. */\r\n    } else {\r\n      recff_nyiu(J, rd);\r\n      return;\r\n    }\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_tonumber(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  TRef base = J->base[1];\r\n  if (tr && !tref_isnil(base)) {\r\n    base = lj_opt_narrow_toint(J, base);\r\n    if (!tref_isk(base) || IR(tref_ref(base))->i != 10) {\r\n      recff_nyiu(J, rd);\r\n      return;\r\n    }\r\n  }\r\n  if (tref_isnumber_str(tr)) {\r\n    if (tref_isstr(tr)) {\r\n      TValue tmp;\r\n      if (!lj_strscan_num(strV(&rd->argv[0]), &tmp)) {\r\n\trecff_nyiu(J, rd);  /* Would need an inverted STRTO for this case. */\r\n\treturn;\r\n      }\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    }\r\n#if LJ_HASFFI\r\n  } else if (tref_iscdata(tr)) {\r\n    lj_crecord_tonumber(J, rd);\r\n    return;\r\n#endif\r\n  } else {\r\n    tr = TREF_NIL;\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic TValue *recff_metacall_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  lj_record_tailcall(J, 0, 1);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\nstatic int recff_metacall(jit_State *J, RecordFFData *rd, MMS mm)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  copyTV(J->L, &ix.tabv, &rd->argv[0]);\r\n  if (lj_record_mm_lookup(J, &ix, mm)) {  /* Has metamethod? */\r\n    int errcode;\r\n    TValue argv0;\r\n    /* Temporarily insert metamethod below object. */\r\n    J->base[1] = J->base[0];\r\n    J->base[0] = ix.mobj;\r\n    copyTV(J->L, &argv0, &rd->argv[0]);\r\n    copyTV(J->L, &rd->argv[1], &rd->argv[0]);\r\n    copyTV(J->L, &rd->argv[0], &ix.mobjv);\r\n    /* Need to protect lj_record_tailcall because it may throw. */\r\n    errcode = lj_vm_cpcall(J->L, NULL, J, recff_metacall_cp);\r\n    /* Always undo Lua stack changes to avoid confusing the interpreter. */\r\n    copyTV(J->L, &rd->argv[0], &argv0);\r\n    if (errcode)\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    rd->nres = -1;  /* Pending call. */\r\n    return 1;  /* Tailcalled to metamethod. */\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_tostring(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isstr(tr)) {\r\n    /* Ignore __tostring in the string base metatable. */\r\n    /* Pass on result in J->base[0]. */\r\n  } else if (tr && !recff_metacall(J, rd, MM_tostring)) {\r\n    if (tref_isnumber(tr)) {\r\n      J->base[0] = emitir(IRT(IR_TOSTR, IRT_STR), tr,\r\n\t\t\t  tref_isnum(tr) ? IRTOSTR_NUM : IRTOSTR_INT);\r\n    } else if (tref_ispri(tr)) {\r\n      J->base[0] = lj_ir_kstr(J, lj_strfmt_obj(J->L, &rd->argv[0]));\r\n    } else {\r\n      recff_nyiu(J, rd);\r\n      return;\r\n    }\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_ipairs_aux(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  if (tref_istab(ix.tab)) {\r\n    if (!tvisnumber(&rd->argv[1]))  /* No support for string coercion. */\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    setintV(&ix.keyv, numberVint(&rd->argv[1])+1);\r\n    settabV(J->L, &ix.tabv, tabV(&rd->argv[0]));\r\n    ix.val = 0; ix.idxchain = 0;\r\n    ix.key = lj_opt_narrow_toint(J, J->base[1]);\r\n    J->base[0] = ix.key = emitir(IRTI(IR_ADD), ix.key, lj_ir_kint(J, 1));\r\n    J->base[1] = lj_record_idx(J, &ix);\r\n    rd->nres = tref_isnil(J->base[1]) ? 0 : 2;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_xpairs(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (!(LJ_52 && recff_metacall(J, rd, MM_ipairs))) {\r\n    TRef tab = J->base[0];\r\n    if (tref_istab(tab)) {\r\n      J->base[0] = lj_ir_kfunc(J, funcV(&J->fn->c.upvalue[0]));\r\n      J->base[1] = tab;\r\n      J->base[2] = rd->data ? lj_ir_kint(J, 0) : TREF_NIL;\r\n      rd->nres = 3;\r\n    }  /* else: Interpreter will throw. */\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_pcall(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (J->maxslot >= 1) {\r\n    lj_record_call(J, 0, J->maxslot - 1);\r\n    rd->nres = -1;  /* Pending call. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic TValue *recff_xpcall_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  lj_record_call(J, 1, J->maxslot - 2);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_xpcall(jit_State *J, RecordFFData *rd)\r\n{\r\n  if (J->maxslot >= 2) {\r\n    TValue argv0, argv1;\r\n    TRef tmp;\r\n    int errcode;\r\n    lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n    /* Swap function and traceback. */\r\n    tmp = J->base[0]; J->base[0] = J->base[1]; J->base[1] = tmp;\r\n    copyTV(J->L, &argv0, &rd->argv[0]);\r\n    copyTV(J->L, &argv1, &rd->argv[1]);\r\n    copyTV(J->L, &rd->argv[0], &argv1);\r\n    copyTV(J->L, &rd->argv[1], &argv0);\r\n    /* Need to protect lj_record_call because it may throw. */\r\n    errcode = lj_vm_cpcall(J->L, NULL, J, recff_xpcall_cp);\r\n    /* Always undo Lua stack swap to avoid confusing the interpreter. */\r\n    copyTV(J->L, &rd->argv[0], &argv0);\r\n    copyTV(J->L, &rd->argv[1], &argv1);\r\n    if (errcode)\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    rd->nres = -1;  /* Pending call. */\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_getfenv(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  /* Only support getfenv(0) for now. */\r\n  if (tref_isint(tr) && tref_isk(tr) && IR(tref_ref(tr))->i == 0) {\r\n    TRef trl = emitir(IRT(IR_LREF, IRT_THREAD), 0, 0);\r\n    J->base[0] = emitir(IRT(IR_FLOAD, IRT_TAB), trl, IRFL_THREAD_ENV);\r\n    return;\r\n  }\r\n  recff_nyiu(J, rd);\r\n}\r\n\r\n/* -- Math library fast functions ----------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_math_abs(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  J->base[0] = emitir(IRTN(IR_ABS), tr, lj_ir_knum_abs(J));\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record rounding functions math.floor and math.ceil. */\r\nstatic void LJ_FASTCALL recff_math_round(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (!tref_isinteger(tr)) {  /* Pass through integers unmodified. */\r\n    tr = emitir(IRTN(IR_FPMATH), lj_ir_tonum(J, tr), rd->data);\r\n    /* Result is integral (or NaN/Inf), but may not fit an int32_t. */\r\n    if (LJ_DUALNUM) {  /* Try to narrow using a guarded conversion to int. */\r\n      lua_Number n = lj_vm_foldfpm(numberVnum(&rd->argv[0]), rd->data);\r\n      if (n == (lua_Number)lj_num2int(n))\r\n\ttr = emitir(IRTGI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_CHECK);\r\n    }\r\n    J->base[0] = tr;\r\n  }\r\n}\r\n\r\n/* Record unary math.* functions, mapped to IR_FPMATH opcode. */\r\nstatic void LJ_FASTCALL recff_math_unary(jit_State *J, RecordFFData *rd)\r\n{\r\n  J->base[0] = emitir(IRTN(IR_FPMATH), lj_ir_tonum(J, J->base[0]), rd->data);\r\n}\r\n\r\n/* Record math.log. */\r\nstatic void LJ_FASTCALL recff_math_log(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  if (J->base[1]) {\r\n#ifdef LUAJIT_NO_LOG2\r\n    uint32_t fpm = IRFPM_LOG;\r\n#else\r\n    uint32_t fpm = IRFPM_LOG2;\r\n#endif\r\n    TRef trb = lj_ir_tonum(J, J->base[1]);\r\n    tr = emitir(IRTN(IR_FPMATH), tr, fpm);\r\n    trb = emitir(IRTN(IR_FPMATH), trb, fpm);\r\n    trb = emitir(IRTN(IR_DIV), lj_ir_knum_one(J), trb);\r\n    tr = emitir(IRTN(IR_MUL), tr, trb);\r\n  } else {\r\n    tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_LOG);\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.atan2. */\r\nstatic void LJ_FASTCALL recff_math_atan2(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n  J->base[0] = emitir(IRTN(IR_ATAN2), tr, tr2);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.ldexp. */\r\nstatic void LJ_FASTCALL recff_math_ldexp(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n#if LJ_TARGET_X86ORX64\r\n  TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n#else\r\n  TRef tr2 = lj_opt_narrow_toint(J, J->base[1]);\r\n#endif\r\n  J->base[0] = emitir(IRTN(IR_LDEXP), tr, tr2);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record math.asin, math.acos, math.atan. */\r\nstatic void LJ_FASTCALL recff_math_atrig(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef y = lj_ir_tonum(J, J->base[0]);\r\n  TRef x = lj_ir_knum_one(J);\r\n  uint32_t ffid = rd->data;\r\n  if (ffid != FF_math_atan) {\r\n    TRef tmp = emitir(IRTN(IR_MUL), y, y);\r\n    tmp = emitir(IRTN(IR_SUB), x, tmp);\r\n    tmp = emitir(IRTN(IR_FPMATH), tmp, IRFPM_SQRT);\r\n    if (ffid == FF_math_asin) { x = tmp; } else { x = y; y = tmp; }\r\n  }\r\n  J->base[0] = emitir(IRTN(IR_ATAN2), y, x);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_htrig(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  J->base[0] = emitir(IRTN(IR_CALLN), tr, rd->data);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_modf(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_isinteger(tr)) {\r\n    J->base[0] = tr;\r\n    J->base[1] = lj_ir_kint(J, 0);\r\n  } else {\r\n    TRef trt;\r\n    tr = lj_ir_tonum(J, tr);\r\n    trt = emitir(IRTN(IR_FPMATH), tr, IRFPM_TRUNC);\r\n    J->base[0] = trt;\r\n    J->base[1] = emitir(IRTN(IR_SUB), tr, trt);\r\n  }\r\n  rd->nres = 2;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_pow(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonum(J, J->base[0]);\r\n  if (!tref_isnumber_str(J->base[1]))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  J->base[0] = lj_opt_narrow_pow(J, tr, J->base[1], &rd->argv[1]);\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_minmax(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = lj_ir_tonumber(J, J->base[0]);\r\n  uint32_t op = rd->data;\r\n  BCReg i;\r\n  for (i = 1; J->base[i] != 0; i++) {\r\n    TRef tr2 = lj_ir_tonumber(J, J->base[i]);\r\n    IRType t = IRT_INT;\r\n    if (!(tref_isinteger(tr) && tref_isinteger(tr2))) {\r\n      if (tref_isinteger(tr)) tr = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n      if (tref_isinteger(tr2)) tr2 = emitir(IRTN(IR_CONV), tr2, IRCONV_NUM_INT);\r\n      t = IRT_NUM;\r\n    }\r\n    tr = emitir(IRT(op, t), tr, tr2);\r\n  }\r\n  J->base[0] = tr;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_math_random(jit_State *J, RecordFFData *rd)\r\n{\r\n  GCudata *ud = udataV(&J->fn->c.upvalue[0]);\r\n  TRef tr, one;\r\n  lj_ir_kgc(J, obj2gco(ud), IRT_UDATA);  /* Prevent collection. */\r\n  tr = lj_ir_call(J, IRCALL_lj_math_random_step, lj_ir_kptr(J, uddata(ud)));\r\n  one = lj_ir_knum_one(J);\r\n  tr = emitir(IRTN(IR_SUB), tr, one);\r\n  if (J->base[0]) {\r\n    TRef tr1 = lj_ir_tonum(J, J->base[0]);\r\n    if (J->base[1]) {  /* d = floor(d*(r2-r1+1.0)) + r1 */\r\n      TRef tr2 = lj_ir_tonum(J, J->base[1]);\r\n      tr2 = emitir(IRTN(IR_SUB), tr2, tr1);\r\n      tr2 = emitir(IRTN(IR_ADD), tr2, one);\r\n      tr = emitir(IRTN(IR_MUL), tr, tr2);\r\n      tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_FLOOR);\r\n      tr = emitir(IRTN(IR_ADD), tr, tr1);\r\n    } else {  /* d = floor(d*r1) + 1.0 */\r\n      tr = emitir(IRTN(IR_MUL), tr, tr1);\r\n      tr = emitir(IRTN(IR_FPMATH), tr, IRFPM_FLOOR);\r\n      tr = emitir(IRTN(IR_ADD), tr, one);\r\n    }\r\n  }\r\n  J->base[0] = tr;\r\n  UNUSED(rd);\r\n}\r\n\r\n/* -- Bit library fast functions ------------------------------------------ */\r\n\r\n/* Record bit.tobit. */\r\nstatic void LJ_FASTCALL recff_bit_tobit(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n#if LJ_HASFFI\r\n  if (tref_iscdata(tr)) { recff_bit64_tobit(J, rd); return; }\r\n#endif\r\n  J->base[0] = lj_opt_narrow_tobit(J, tr);\r\n  UNUSED(rd);\r\n}\r\n\r\n/* Record unary bit.bnot, bit.bswap. */\r\nstatic void LJ_FASTCALL recff_bit_unary(jit_State *J, RecordFFData *rd)\r\n{\r\n#if LJ_HASFFI\r\n  if (recff_bit64_unary(J, rd))\r\n    return;\r\n#endif\r\n  J->base[0] = emitir(IRTI(rd->data), lj_opt_narrow_tobit(J, J->base[0]), 0);\r\n}\r\n\r\n/* Record N-ary bit.band, bit.bor, bit.bxor. */\r\nstatic void LJ_FASTCALL recff_bit_nary(jit_State *J, RecordFFData *rd)\r\n{\r\n#if LJ_HASFFI\r\n  if (recff_bit64_nary(J, rd))\r\n    return;\r\n#endif\r\n  {\r\n    TRef tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n    uint32_t ot = IRTI(rd->data);\r\n    BCReg i;\r\n    for (i = 1; J->base[i] != 0; i++)\r\n      tr = emitir(ot, tr, lj_opt_narrow_tobit(J, J->base[i]));\r\n    J->base[0] = tr;\r\n  }\r\n}\r\n\r\n/* Record bit shifts. */\r\nstatic void LJ_FASTCALL recff_bit_shift(jit_State *J, RecordFFData *rd)\r\n{\r\n#if LJ_HASFFI\r\n  if (recff_bit64_shift(J, rd))\r\n    return;\r\n#endif\r\n  {\r\n    TRef tr = lj_opt_narrow_tobit(J, J->base[0]);\r\n    TRef tsh = lj_opt_narrow_tobit(J, J->base[1]);\r\n    IROp op = (IROp)rd->data;\r\n    if (!(op < IR_BROL ? LJ_TARGET_MASKSHIFT : LJ_TARGET_MASKROT) &&\r\n\t!tref_isk(tsh))\r\n      tsh = emitir(IRTI(IR_BAND), tsh, lj_ir_kint(J, 31));\r\n#ifdef LJ_TARGET_UNIFYROT\r\n    if (op == (LJ_TARGET_UNIFYROT == 1 ? IR_BROR : IR_BROL)) {\r\n      op = LJ_TARGET_UNIFYROT == 1 ? IR_BROL : IR_BROR;\r\n      tsh = emitir(IRTI(IR_NEG), tsh, tsh);\r\n    }\r\n#endif\r\n    J->base[0] = emitir(IRTI(op), tr, tsh);\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_bit_tohex(jit_State *J, RecordFFData *rd)\r\n{\r\n#if LJ_HASFFI\r\n  TRef hdr = recff_bufhdr(J);\r\n  TRef tr = recff_bit64_tohex(J, rd, hdr);\r\n  J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n#else\r\n  recff_nyiu(J, rd);  /* Don't bother working around this NYI. */\r\n#endif\r\n}\r\n\r\n/* -- String library fast functions --------------------------------------- */\r\n\r\n/* Specialize to relative starting position for string. */\r\nstatic TRef recff_string_start(jit_State *J, GCstr *s, int32_t *st, TRef tr,\r\n\t\t\t       TRef trlen, TRef tr0)\r\n{\r\n  int32_t start = *st;\r\n  if (start < 0) {\r\n    emitir(IRTGI(IR_LT), tr, tr0);\r\n    tr = emitir(IRTI(IR_ADD), trlen, tr);\r\n    start = start + (int32_t)s->len;\r\n    emitir(start < 0 ? IRTGI(IR_LT) : IRTGI(IR_GE), tr, tr0);\r\n    if (start < 0) {\r\n      tr = tr0;\r\n      start = 0;\r\n    }\r\n  } else if (start == 0) {\r\n    emitir(IRTGI(IR_EQ), tr, tr0);\r\n    tr = tr0;\r\n  } else {\r\n    tr = emitir(IRTI(IR_ADD), tr, lj_ir_kint(J, -1));\r\n    emitir(IRTGI(IR_GE), tr, tr0);\r\n    start--;\r\n  }\r\n  *st = start;\r\n  return tr;\r\n}\r\n\r\n/* Handle string.byte (rd->data = 0) and string.sub (rd->data = 1). */\r\nstatic void LJ_FASTCALL recff_string_range(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef trstr = lj_ir_tostr(J, J->base[0]);\r\n  TRef trlen = emitir(IRTI(IR_FLOAD), trstr, IRFL_STR_LEN);\r\n  TRef tr0 = lj_ir_kint(J, 0);\r\n  TRef trstart, trend;\r\n  GCstr *str = argv2str(J, &rd->argv[0]);\r\n  int32_t start, end;\r\n  if (rd->data) {  /* string.sub(str, start [,end]) */\r\n    start = argv2int(J, &rd->argv[1]);\r\n    trstart = lj_opt_narrow_toint(J, J->base[1]);\r\n    trend = J->base[2];\r\n    if (tref_isnil(trend)) {\r\n      trend = lj_ir_kint(J, -1);\r\n      end = -1;\r\n    } else {\r\n      trend = lj_opt_narrow_toint(J, trend);\r\n      end = argv2int(J, &rd->argv[2]);\r\n    }\r\n  } else {  /* string.byte(str, [,start [,end]]) */\r\n    if (tref_isnil(J->base[1])) {\r\n      start = 1;\r\n      trstart = lj_ir_kint(J, 1);\r\n    } else {\r\n      start = argv2int(J, &rd->argv[1]);\r\n      trstart = lj_opt_narrow_toint(J, J->base[1]);\r\n    }\r\n    if (J->base[1] && !tref_isnil(J->base[2])) {\r\n      trend = lj_opt_narrow_toint(J, J->base[2]);\r\n      end = argv2int(J, &rd->argv[2]);\r\n    } else {\r\n      trend = trstart;\r\n      end = start;\r\n    }\r\n  }\r\n  if (end < 0) {\r\n    emitir(IRTGI(IR_LT), trend, tr0);\r\n    trend = emitir(IRTI(IR_ADD), emitir(IRTI(IR_ADD), trlen, trend),\r\n\t\t   lj_ir_kint(J, 1));\r\n    end = end+(int32_t)str->len+1;\r\n  } else if ((MSize)end <= str->len) {\r\n    emitir(IRTGI(IR_ULE), trend, trlen);\r\n  } else {\r\n    emitir(IRTGI(IR_UGT), trend, trlen);\r\n    end = (int32_t)str->len;\r\n    trend = trlen;\r\n  }\r\n  trstart = recff_string_start(J, str, &start, trstart, trlen, tr0);\r\n  if (rd->data) {  /* Return string.sub result. */\r\n    if (end - start >= 0) {\r\n      /* Also handle empty range here, to avoid extra traces. */\r\n      TRef trptr, trslen = emitir(IRTI(IR_SUB), trend, trstart);\r\n      emitir(IRTGI(IR_GE), trslen, tr0);\r\n      trptr = emitir(IRT(IR_STRREF, IRT_P32), trstr, trstart);\r\n      J->base[0] = emitir(IRT(IR_SNEW, IRT_STR), trptr, trslen);\r\n    } else {  /* Range underflow: return empty string. */\r\n      emitir(IRTGI(IR_LT), trend, trstart);\r\n      J->base[0] = lj_ir_kstr(J, &J2G(J)->strempty);\r\n    }\r\n  } else {  /* Return string.byte result(s). */\r\n    ptrdiff_t i, len = end - start;\r\n    if (len > 0) {\r\n      TRef trslen = emitir(IRTI(IR_SUB), trend, trstart);\r\n      emitir(IRTGI(IR_EQ), trslen, lj_ir_kint(J, (int32_t)len));\r\n      if (J->baseslot + len > LJ_MAX_JSLOTS)\r\n\tlj_trace_err_info(J, LJ_TRERR_STACKOV);\r\n      rd->nres = len;\r\n      for (i = 0; i < len; i++) {\r\n\tTRef tmp = emitir(IRTI(IR_ADD), trstart, lj_ir_kint(J, (int32_t)i));\r\n\ttmp = emitir(IRT(IR_STRREF, IRT_P32), trstr, tmp);\r\n\tJ->base[i] = emitir(IRT(IR_XLOAD, IRT_U8), tmp, IRXLOAD_READONLY);\r\n      }\r\n    } else {  /* Empty range or range underflow: return no results. */\r\n      emitir(IRTGI(IR_LE), trend, trstart);\r\n      rd->nres = 0;\r\n    }\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_string_char(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef k255 = lj_ir_kint(J, 255);\r\n  BCReg i;\r\n  for (i = 0; J->base[i] != 0; i++) {  /* Convert char values to strings. */\r\n    TRef tr = lj_opt_narrow_toint(J, J->base[i]);\r\n    emitir(IRTGI(IR_ULE), tr, k255);\r\n    J->base[i] = emitir(IRT(IR_TOSTR, IRT_STR), tr, IRTOSTR_CHAR);\r\n  }\r\n  if (i > 1) {  /* Concatenate the strings, if there's more than one. */\r\n    TRef hdr = recff_bufhdr(J), tr = hdr;\r\n    for (i = 0; J->base[i] != 0; i++)\r\n      tr = emitir(IRT(IR_BUFPUT, IRT_P32), tr, J->base[i]);\r\n    J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n  }\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_string_rep(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef str = lj_ir_tostr(J, J->base[0]);\r\n  TRef rep = lj_opt_narrow_toint(J, J->base[1]);\r\n  TRef hdr, tr, str2 = 0;\r\n  if (!tref_isnil(J->base[2])) {\r\n    TRef sep = lj_ir_tostr(J, J->base[2]);\r\n    int32_t vrep = argv2int(J, &rd->argv[1]);\r\n    emitir(IRTGI(vrep > 1 ? IR_GT : IR_LE), rep, lj_ir_kint(J, 1));\r\n    if (vrep > 1) {\r\n      TRef hdr2 = recff_bufhdr(J);\r\n      TRef tr2 = emitir(IRT(IR_BUFPUT, IRT_P32), hdr2, sep);\r\n      tr2 = emitir(IRT(IR_BUFPUT, IRT_P32), tr2, str);\r\n      str2 = emitir(IRT(IR_BUFSTR, IRT_STR), tr2, hdr2);\r\n    }\r\n  }\r\n  tr = hdr = recff_bufhdr(J);\r\n  if (str2) {\r\n    tr = emitir(IRT(IR_BUFPUT, IRT_P32), tr, str);\r\n    str = str2;\r\n    rep = emitir(IRTI(IR_ADD), rep, lj_ir_kint(J, -1));\r\n  }\r\n  tr = lj_ir_call(J, IRCALL_lj_buf_putstr_rep, tr, str, rep);\r\n  J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_string_op(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef str = lj_ir_tostr(J, J->base[0]);\r\n  TRef hdr = recff_bufhdr(J);\r\n  TRef tr = lj_ir_call(J, rd->data, hdr, str);\r\n  J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_string_find(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef trstr = lj_ir_tostr(J, J->base[0]);\r\n  TRef trpat = lj_ir_tostr(J, J->base[1]);\r\n  TRef trlen = emitir(IRTI(IR_FLOAD), trstr, IRFL_STR_LEN);\r\n  TRef tr0 = lj_ir_kint(J, 0);\r\n  TRef trstart;\r\n  GCstr *str = argv2str(J, &rd->argv[0]);\r\n  GCstr *pat = argv2str(J, &rd->argv[1]);\r\n  int32_t start;\r\n  J->needsnap = 1;\r\n  if (tref_isnil(J->base[2])) {\r\n    trstart = lj_ir_kint(J, 1);\r\n    start = 1;\r\n  } else {\r\n    trstart = lj_opt_narrow_toint(J, J->base[2]);\r\n    start = argv2int(J, &rd->argv[2]);\r\n  }\r\n  trstart = recff_string_start(J, str, &start, trstart, trlen, tr0);\r\n  if ((MSize)start <= str->len) {\r\n    emitir(IRTGI(IR_ULE), trstart, trlen);\r\n  } else {\r\n    emitir(IRTGI(IR_UGT), trstart, trlen);\r\n#if LJ_52\r\n    J->base[0] = TREF_NIL;\r\n    return;\r\n#else\r\n    trstart = trlen;\r\n    start = str->len;\r\n#endif\r\n  }\r\n  /* Fixed arg or no pattern matching chars? (Specialized to pattern string.) */\r\n  if ((J->base[2] && tref_istruecond(J->base[3])) ||\r\n      (emitir(IRTG(IR_EQ, IRT_STR), trpat, lj_ir_kstr(J, pat)),\r\n       !lj_str_haspattern(pat))) {  /* Search for fixed string. */\r\n    TRef trsptr = emitir(IRT(IR_STRREF, IRT_P32), trstr, trstart);\r\n    TRef trpptr = emitir(IRT(IR_STRREF, IRT_P32), trpat, tr0);\r\n    TRef trslen = emitir(IRTI(IR_SUB), trlen, trstart);\r\n    TRef trplen = emitir(IRTI(IR_FLOAD), trpat, IRFL_STR_LEN);\r\n    TRef tr = lj_ir_call(J, IRCALL_lj_str_find, trsptr, trpptr, trslen, trplen);\r\n    TRef trp0 = lj_ir_kkptr(J, NULL);\r\n    if (lj_str_find(strdata(str)+(MSize)start, strdata(pat),\r\n\t\t    str->len-(MSize)start, pat->len)) {\r\n      TRef pos;\r\n      emitir(IRTG(IR_NE, IRT_P32), tr, trp0);\r\n      pos = emitir(IRTI(IR_SUB), tr, emitir(IRT(IR_STRREF, IRT_P32), trstr, tr0));\r\n      J->base[0] = emitir(IRTI(IR_ADD), pos, lj_ir_kint(J, 1));\r\n      J->base[1] = emitir(IRTI(IR_ADD), pos, trplen);\r\n      rd->nres = 2;\r\n    } else {\r\n      emitir(IRTG(IR_EQ, IRT_P32), tr, trp0);\r\n      J->base[0] = TREF_NIL;\r\n    }\r\n  } else {  /* Search for pattern. */\r\n    recff_nyiu(J, rd);\r\n    return;\r\n  }\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_string_format(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef trfmt = lj_ir_tostr(J, J->base[0]);\r\n  GCstr *fmt = argv2str(J, &rd->argv[0]);\r\n  int arg = 1;\r\n  TRef hdr, tr;\r\n  FormatState fs;\r\n  SFormat sf;\r\n  /* Specialize to the format string. */\r\n  emitir(IRTG(IR_EQ, IRT_STR), trfmt, lj_ir_kstr(J, fmt));\r\n  tr = hdr = recff_bufhdr(J);\r\n  lj_strfmt_init(&fs, strdata(fmt), fmt->len);\r\n  while ((sf = lj_strfmt_parse(&fs)) != STRFMT_EOF) {  /* Parse format. */\r\n    TRef tra = sf == STRFMT_LIT ? 0 : J->base[arg++];\r\n    TRef trsf = lj_ir_kint(J, (int32_t)sf);\r\n    IRCallID id;\r\n    switch (STRFMT_TYPE(sf)) {\r\n    case STRFMT_LIT:\r\n      tr = emitir(IRT(IR_BUFPUT, IRT_P32), tr,\r\n\t\t  lj_ir_kstr(J, lj_str_new(J->L, fs.str, fs.len)));\r\n      break;\r\n    case STRFMT_INT:\r\n      id = IRCALL_lj_strfmt_putfnum_int;\r\n    handle_int:\r\n      if (!tref_isinteger(tra))\r\n\tgoto handle_num;\r\n      if (sf == STRFMT_INT) { /* Shortcut for plain %d. */\r\n\ttr = emitir(IRT(IR_BUFPUT, IRT_P32), tr,\r\n\t\t    emitir(IRT(IR_TOSTR, IRT_STR), tra, IRTOSTR_INT));\r\n      } else {\r\n#if LJ_HASFFI\r\n\ttra = emitir(IRT(IR_CONV, IRT_U64), tra,\r\n\t\t     (IRT_INT|(IRT_U64<<5)|IRCONV_SEXT));\r\n\ttr = lj_ir_call(J, IRCALL_lj_strfmt_putfxint, tr, trsf, tra);\r\n\tlj_needsplit(J);\r\n#else\r\n\trecff_nyiu(J, rd);  /* Don't bother working around this NYI. */\r\n\treturn;\r\n#endif\r\n      }\r\n      break;\r\n    case STRFMT_UINT:\r\n      id = IRCALL_lj_strfmt_putfnum_uint;\r\n      goto handle_int;\r\n    case STRFMT_NUM:\r\n      id = IRCALL_lj_strfmt_putfnum;\r\n    handle_num:\r\n      tra = lj_ir_tonum(J, tra);\r\n      tr = lj_ir_call(J, id, tr, trsf, tra);\r\n      if (LJ_SOFTFP) lj_needsplit(J);\r\n      break;\r\n    case STRFMT_STR:\r\n      if (!tref_isstr(tra)) {\r\n\trecff_nyiu(J, rd);  /* NYI: __tostring and non-string types for %s. */\r\n\treturn;\r\n      }\r\n      if (sf == STRFMT_STR)  /* Shortcut for plain %s. */\r\n\ttr = emitir(IRT(IR_BUFPUT, IRT_P32), tr, tra);\r\n      else if ((sf & STRFMT_T_QUOTED))\r\n\ttr = lj_ir_call(J, IRCALL_lj_strfmt_putquoted, tr, tra);\r\n      else\r\n\ttr = lj_ir_call(J, IRCALL_lj_strfmt_putfstr, tr, trsf, tra);\r\n      break;\r\n    case STRFMT_CHAR:\r\n      tra = lj_opt_narrow_toint(J, tra);\r\n      if (sf == STRFMT_CHAR)  /* Shortcut for plain %c. */\r\n\ttr = emitir(IRT(IR_BUFPUT, IRT_P32), tr,\r\n\t\t    emitir(IRT(IR_TOSTR, IRT_STR), tra, IRTOSTR_CHAR));\r\n      else\r\n\ttr = lj_ir_call(J, IRCALL_lj_strfmt_putfchar, tr, trsf, tra);\r\n      break;\r\n    case STRFMT_PTR:  /* NYI */\r\n    case STRFMT_ERR:\r\n    default:\r\n      recff_nyiu(J, rd);\r\n      return;\r\n    }\r\n  }\r\n  J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n}\r\n\r\n/* -- Table library fast functions ---------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_table_insert(jit_State *J, RecordFFData *rd)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = J->base[0];\r\n  ix.val = J->base[1];\r\n  rd->nres = 0;\r\n  if (tref_istab(ix.tab) && ix.val) {\r\n    if (!J->base[2]) {  /* Simple push: t[#t+1] = v */\r\n      TRef trlen = lj_ir_call(J, IRCALL_lj_tab_len, ix.tab);\r\n      GCtab *t = tabV(&rd->argv[0]);\r\n      ix.key = emitir(IRTI(IR_ADD), trlen, lj_ir_kint(J, 1));\r\n      settabV(J->L, &ix.tabv, t);\r\n      setintV(&ix.keyv, lj_tab_len(t) + 1);\r\n      ix.idxchain = 0;\r\n      lj_record_idx(J, &ix);  /* Set new value. */\r\n    } else {  /* Complex case: insert in the middle. */\r\n      recff_nyiu(J, rd);\r\n      return;\r\n    }\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_table_concat(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tab = J->base[0];\r\n  if (tref_istab(tab)) {\r\n    TRef sep = !tref_isnil(J->base[1]) ?\r\n\t       lj_ir_tostr(J, J->base[1]) : lj_ir_knull(J, IRT_STR);\r\n    TRef tri = (J->base[1] && !tref_isnil(J->base[2])) ?\r\n\t       lj_opt_narrow_toint(J, J->base[2]) : lj_ir_kint(J, 1);\r\n    TRef tre = (J->base[1] && J->base[2] && !tref_isnil(J->base[3])) ?\r\n\t       lj_opt_narrow_toint(J, J->base[3]) :\r\n\t       lj_ir_call(J, IRCALL_lj_tab_len, tab);\r\n    TRef hdr = recff_bufhdr(J);\r\n    TRef tr = lj_ir_call(J, IRCALL_lj_buf_puttab, hdr, tab, sep, tri, tre);\r\n    emitir(IRTG(IR_NE, IRT_PTR), tr, lj_ir_kptr(J, NULL));\r\n    J->base[0] = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n  }  /* else: Interpreter will throw. */\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_table_new(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tra = lj_opt_narrow_toint(J, J->base[0]);\r\n  TRef trh = lj_opt_narrow_toint(J, J->base[1]);\r\n  J->base[0] = lj_ir_call(J, IRCALL_lj_tab_new_ah, tra, trh);\r\n  UNUSED(rd);\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_table_clear(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef tr = J->base[0];\r\n  if (tref_istab(tr)) {\r\n    rd->nres = 0;\r\n    lj_ir_call(J, IRCALL_lj_tab_clear, tr);\r\n    J->needsnap = 1;\r\n  }  /* else: Interpreter will throw. */\r\n}\r\n\r\n/* -- I/O library fast functions ------------------------------------------ */\r\n\r\n/* Get FILE* for I/O function. Any I/O error aborts recording, so there's\r\n** no need to encode the alternate cases for any of the guards.\r\n*/\r\nstatic TRef recff_io_fp(jit_State *J, TRef *udp, int32_t id)\r\n{\r\n  TRef tr, ud, fp;\r\n  if (id) {  /* io.func() */\r\n    tr = lj_ir_kptr(J, &J2G(J)->gcroot[id]);\r\n    ud = emitir(IRT(IR_XLOAD, IRT_UDATA), tr, 0);\r\n  } else {  /* fp:method() */\r\n    ud = J->base[0];\r\n    if (!tref_isudata(ud))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    tr = emitir(IRT(IR_FLOAD, IRT_U8), ud, IRFL_UDATA_UDTYPE);\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, UDTYPE_IO_FILE));\r\n  }\r\n  *udp = ud;\r\n  fp = emitir(IRT(IR_FLOAD, IRT_PTR), ud, IRFL_UDATA_FILE);\r\n  emitir(IRTG(IR_NE, IRT_PTR), fp, lj_ir_knull(J, IRT_PTR));\r\n  return fp;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_io_write(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef ud, fp = recff_io_fp(J, &ud, rd->data);\r\n  TRef zero = lj_ir_kint(J, 0);\r\n  TRef one = lj_ir_kint(J, 1);\r\n  ptrdiff_t i = rd->data == 0 ? 1 : 0;\r\n  for (; J->base[i]; i++) {\r\n    TRef str = lj_ir_tostr(J, J->base[i]);\r\n    TRef buf = emitir(IRT(IR_STRREF, IRT_P32), str, zero);\r\n    TRef len = emitir(IRTI(IR_FLOAD), str, IRFL_STR_LEN);\r\n    if (tref_isk(len) && IR(tref_ref(len))->i == 1) {\r\n      IRIns *irs = IR(tref_ref(str));\r\n      TRef tr = (irs->o == IR_TOSTR && irs->op2 == IRTOSTR_CHAR) ?\r\n\t\tirs->op1 :\r\n\t\temitir(IRT(IR_XLOAD, IRT_U8), buf, IRXLOAD_READONLY);\r\n      tr = lj_ir_call(J, IRCALL_fputc, tr, fp);\r\n      if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n\temitir(IRTGI(IR_NE), tr, lj_ir_kint(J, -1));\r\n    } else {\r\n      TRef tr = lj_ir_call(J, IRCALL_fwrite, buf, one, len, fp);\r\n      if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n\temitir(IRTGI(IR_EQ), tr, len);\r\n    }\r\n  }\r\n  J->base[0] = LJ_52 ? ud : TREF_TRUE;\r\n}\r\n\r\nstatic void LJ_FASTCALL recff_io_flush(jit_State *J, RecordFFData *rd)\r\n{\r\n  TRef ud, fp = recff_io_fp(J, &ud, rd->data);\r\n  TRef tr = lj_ir_call(J, IRCALL_fflush, fp);\r\n  if (results_wanted(J) != 0)  /* Check result only if not ignored. */\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, 0));\r\n  J->base[0] = TREF_TRUE;\r\n}\r\n\r\n/* -- Debug library fast functions ---------------------------------------- */\r\n\r\nstatic void LJ_FASTCALL recff_debug_getmetatable(jit_State *J, RecordFFData *rd)\r\n{\r\n  GCtab *mt;\r\n  TRef mtref;\r\n  TRef tr = J->base[0];\r\n  if (tref_istab(tr)) {\r\n    mt = tabref(tabV(&rd->argv[0])->metatable);\r\n    mtref = emitir(IRT(IR_FLOAD, IRT_TAB), tr, IRFL_TAB_META);\r\n  } else if (tref_isudata(tr)) {\r\n    mt = tabref(udataV(&rd->argv[0])->metatable);\r\n    mtref = emitir(IRT(IR_FLOAD, IRT_TAB), tr, IRFL_UDATA_META);\r\n  } else {\r\n    mt = tabref(basemt_obj(J2G(J), &rd->argv[0]));\r\n    J->base[0] = mt ? lj_ir_ktab(J, mt) : TREF_NIL;\r\n    return;\r\n  }\r\n  emitir(IRTG(mt ? IR_NE : IR_EQ, IRT_TAB), mtref, lj_ir_knull(J, IRT_TAB));\r\n  J->base[0] = mt ? mtref : TREF_NIL;\r\n}\r\n\r\n/* -- Record calls to fast functions -------------------------------------- */\r\n\r\n#include \"lj_recdef.h\"\r\n\r\nstatic uint32_t recdef_lookup(GCfunc *fn)\r\n{\r\n  if (fn->c.ffid < sizeof(recff_idmap)/sizeof(recff_idmap[0]))\r\n    return recff_idmap[fn->c.ffid];\r\n  else\r\n    return 0;\r\n}\r\n\r\n/* Record entry to a fast function or C function. */\r\nvoid lj_ffrecord_func(jit_State *J)\r\n{\r\n  RecordFFData rd;\r\n  uint32_t m = recdef_lookup(J->fn);\r\n  rd.data = m & 0xff;\r\n  rd.nres = 1;  /* Default is one result. */\r\n  rd.argv = J->L->base;\r\n  J->base[J->maxslot] = 0;  /* Mark end of arguments. */\r\n  (recff_func[m >> 8])(J, &rd);  /* Call recff_* handler. */\r\n  if (rd.nres >= 0) {\r\n    if (J->postproc == LJ_POST_NONE) J->postproc = LJ_POST_FFRETRY;\r\n    lj_record_ret(J, 0, rd.nres);\r\n  }\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ffrecord.h",
    "content": "/*\r\n** Fast function call recorder.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FFRECORD_H\r\n#define _LJ_FFRECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* Data used by handlers to record a fast function. */\r\ntypedef struct RecordFFData {\r\n  TValue *argv;\t\t/* Runtime argument values. */\r\n  ptrdiff_t nres;\t/* Number of returned results (defaults to 1). */\r\n  uint32_t data;\t/* Per-ffid auxiliary data (opcode, literal etc.). */\r\n} RecordFFData;\r\n\r\nLJ_FUNC int32_t lj_ffrecord_select_mode(jit_State *J, TRef tr, TValue *tv);\r\nLJ_FUNC void lj_ffrecord_func(jit_State *J);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_frame.h",
    "content": "/*\r\n** Stack frames.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FRAME_H\r\n#define _LJ_FRAME_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_bc.h\"\r\n\r\n/* -- Lua stack frame ----------------------------------------------------- */\r\n\r\n/* Frame type markers in LSB of PC (4-byte aligned) or delta (8-byte aligned:\r\n**\r\n**    PC  00  Lua frame\r\n** delta 001  C frame\r\n** delta 010  Continuation frame\r\n** delta 011  Lua vararg frame\r\n** delta 101  cpcall() frame\r\n** delta 110  ff pcall() frame\r\n** delta 111  ff pcall() frame with active hook\r\n*/\r\nenum {\r\n  FRAME_LUA, FRAME_C, FRAME_CONT, FRAME_VARG,\r\n  FRAME_LUAP, FRAME_CP, FRAME_PCALL, FRAME_PCALLH\r\n};\r\n#define FRAME_TYPE\t\t3\r\n#define FRAME_P\t\t\t4\r\n#define FRAME_TYPEP\t\t(FRAME_TYPE|FRAME_P)\r\n\r\n/* Macros to access and modify Lua frames. */\r\n#if LJ_FR2\r\n/* Two-slot frame info, required for 64 bit PC/GCRef:\r\n**\r\n**                   base-2  base-1      |  base  base+1 ...\r\n**                  [func   PC/delta/ft] | [slots ...]\r\n**                  ^-- frame            | ^-- base   ^-- top\r\n**\r\n** Continuation frames:\r\n**\r\n**   base-4  base-3  base-2  base-1      |  base  base+1 ...\r\n**  [cont      PC ] [func   PC/delta/ft] | [slots ...]\r\n**                  ^-- frame            | ^-- base   ^-- top\r\n*/\r\n#define frame_gc(f)\t\t(gcval((f)-1))\r\n#define frame_ftsz(f)\t\t((ptrdiff_t)(f)->ftsz)\r\n#define frame_pc(f)\t\t((const BCIns *)frame_ftsz(f))\r\n#define setframe_gc(f, p, tp)\t(setgcVraw((f)-1, (p), (tp)))\r\n#define setframe_ftsz(f, sz)\t((f)->ftsz = (sz))\r\n#define setframe_pc(f, pc)\t((f)->ftsz = (int64_t)(intptr_t)(pc))\r\n#else\r\n/* One-slot frame info, sufficient for 32 bit PC/GCRef:\r\n**\r\n**              base-1              |  base  base+1 ...\r\n**              lo     hi           |\r\n**             [func | PC/delta/ft] | [slots ...]\r\n**             ^-- frame            | ^-- base   ^-- top\r\n**\r\n** Continuation frames:\r\n**\r\n**  base-2      base-1              |  base  base+1 ...\r\n**  lo     hi   lo     hi           |\r\n** [cont | PC] [func | PC/delta/ft] | [slots ...]\r\n**             ^-- frame            | ^-- base   ^-- top\r\n*/\r\n#define frame_gc(f)\t\t(gcref((f)->fr.func))\r\n#define frame_ftsz(f)\t\t((ptrdiff_t)(f)->fr.tp.ftsz)\r\n#define frame_pc(f)\t\t(mref((f)->fr.tp.pcr, const BCIns))\r\n#define setframe_gc(f, p, tp)\t(setgcref((f)->fr.func, (p)), UNUSED(tp))\r\n#define setframe_ftsz(f, sz)\t((f)->fr.tp.ftsz = (int32_t)(sz))\r\n#define setframe_pc(f, pc)\t(setmref((f)->fr.tp.pcr, (pc)))\r\n#endif\r\n\r\n#define frame_type(f)\t\t(frame_ftsz(f) & FRAME_TYPE)\r\n#define frame_typep(f)\t\t(frame_ftsz(f) & FRAME_TYPEP)\r\n#define frame_islua(f)\t\t(frame_type(f) == FRAME_LUA)\r\n#define frame_isc(f)\t\t(frame_type(f) == FRAME_C)\r\n#define frame_iscont(f)\t\t(frame_typep(f) == FRAME_CONT)\r\n#define frame_isvarg(f)\t\t(frame_typep(f) == FRAME_VARG)\r\n#define frame_ispcall(f)\t((frame_ftsz(f) & 6) == FRAME_PCALL)\r\n\r\n#define frame_func(f)\t\t(&frame_gc(f)->fn)\r\n#define frame_delta(f)\t\t(frame_ftsz(f) >> 3)\r\n#define frame_sized(f)\t\t(frame_ftsz(f) & ~FRAME_TYPEP)\r\n\r\nenum { LJ_CONT_TAILCALL, LJ_CONT_FFI_CALLBACK };  /* Special continuations. */\r\n\r\n#if LJ_FR2\r\n#define frame_contpc(f)\t\t(frame_pc((f)-2))\r\n#define frame_contv(f)\t\t(((f)-3)->u64)\r\n#else\r\n#define frame_contpc(f)\t\t(frame_pc((f)-1))\r\n#define frame_contv(f)\t\t(((f)-1)->u32.lo)\r\n#endif\r\n#if LJ_FR2\r\n#define frame_contf(f)\t\t((ASMFunction)(uintptr_t)((f)-3)->u64)\r\n#elif LJ_64\r\n#define frame_contf(f) \\\r\n  ((ASMFunction)(void *)((intptr_t)lj_vm_asm_begin + \\\r\n\t\t\t (intptr_t)(int32_t)((f)-1)->u32.lo))\r\n#else\r\n#define frame_contf(f)\t\t((ASMFunction)gcrefp(((f)-1)->gcr, void))\r\n#endif\r\n#define frame_iscont_fficb(f) \\\r\n  (LJ_HASFFI && frame_contv(f) == LJ_CONT_FFI_CALLBACK)\r\n\r\n#define frame_prevl(f)\t\t((f) - (1+LJ_FR2+bc_a(frame_pc(f)[-1])))\r\n#define frame_prevd(f)\t\t((TValue *)((char *)(f) - frame_sized(f)))\r\n#define frame_prev(f)\t\t(frame_islua(f)?frame_prevl(f):frame_prevd(f))\r\n/* Note: this macro does not skip over FRAME_VARG. */\r\n\r\n/* -- C stack frame ------------------------------------------------------- */\r\n\r\n/* Macros to access and modify the C stack frame chain. */\r\n\r\n/* These definitions must match with the arch-specific *.dasc files. */\r\n#if LJ_TARGET_X86\r\n#define CFRAME_OFS_ERRF\t\t(15*4)\r\n#define CFRAME_OFS_NRES\t\t(14*4)\r\n#define CFRAME_OFS_PREV\t\t(13*4)\r\n#define CFRAME_OFS_L\t\t(12*4)\r\n#define CFRAME_OFS_PC\t\t(6*4)\r\n#define CFRAME_OFS_MULTRES\t(5*4)\r\n#define CFRAME_SIZE\t\t(12*4)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#elif LJ_TARGET_X64\r\n#if LJ_ABI_WIN\r\n#define CFRAME_OFS_PREV\t\t(13*8)\r\n#if LJ_GC64\r\n#define CFRAME_OFS_PC\t\t(12*8)\r\n#define CFRAME_OFS_L\t\t(11*8)\r\n#define CFRAME_OFS_ERRF\t\t(21*4)\r\n#define CFRAME_OFS_NRES\t\t(20*4)\r\n#define CFRAME_OFS_MULTRES\t(8*4)\r\n#else\r\n#define CFRAME_OFS_PC\t\t(25*4)\r\n#define CFRAME_OFS_L\t\t(24*4)\r\n#define CFRAME_OFS_ERRF\t\t(23*4)\r\n#define CFRAME_OFS_NRES\t\t(22*4)\r\n#define CFRAME_OFS_MULTRES\t(21*4)\r\n#endif\r\n#define CFRAME_SIZE\t\t(10*8)\r\n#define CFRAME_SIZE_JIT\t\t(CFRAME_SIZE + 9*16 + 4*8)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#else\r\n#define CFRAME_OFS_PREV\t\t(4*8)\r\n#if LJ_GC64\r\n#define CFRAME_OFS_PC\t\t(3*8)\r\n#define CFRAME_OFS_L\t\t(2*8)\r\n#define CFRAME_OFS_ERRF\t\t(3*4)\r\n#define CFRAME_OFS_NRES\t\t(2*4)\r\n#define CFRAME_OFS_MULTRES\t(0*4)\r\n#else\r\n#define CFRAME_OFS_PC\t\t(7*4)\r\n#define CFRAME_OFS_L\t\t(6*4)\r\n#define CFRAME_OFS_ERRF\t\t(5*4)\r\n#define CFRAME_OFS_NRES\t\t(4*4)\r\n#define CFRAME_OFS_MULTRES\t(1*4)\r\n#endif\r\n#if LJ_NO_UNWIND\r\n#define CFRAME_SIZE\t\t(12*8)\r\n#else\r\n#define CFRAME_SIZE\t\t(10*8)\r\n#endif\r\n#define CFRAME_SIZE_JIT\t\t(CFRAME_SIZE + 16)\r\n#define CFRAME_SHIFT_MULTRES\t0\r\n#endif\r\n#elif LJ_TARGET_ARM\r\n#define CFRAME_OFS_ERRF\t\t24\r\n#define CFRAME_OFS_NRES\t\t20\r\n#define CFRAME_OFS_PREV\t\t16\r\n#define CFRAME_OFS_L\t\t12\r\n#define CFRAME_OFS_PC\t\t8\r\n#define CFRAME_OFS_MULTRES\t4\r\n#if LJ_ARCH_HASFPU\r\n#define CFRAME_SIZE\t\t128\r\n#else\r\n#define CFRAME_SIZE\t\t64\r\n#endif\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_TARGET_ARM64\r\n#define CFRAME_OFS_ERRF\t\t196\r\n#define CFRAME_OFS_NRES\t\t200\r\n#define CFRAME_OFS_PREV\t\t160\r\n#define CFRAME_OFS_L\t\t176\r\n#define CFRAME_OFS_PC\t\t168\r\n#define CFRAME_OFS_MULTRES\t192\r\n#define CFRAME_SIZE\t\t208\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_TARGET_PPC\r\n#if LJ_TARGET_XBOX360\r\n#define CFRAME_OFS_ERRF\t\t424\r\n#define CFRAME_OFS_NRES\t\t420\r\n#define CFRAME_OFS_PREV\t\t400\r\n#define CFRAME_OFS_L\t\t416\r\n#define CFRAME_OFS_PC\t\t412\r\n#define CFRAME_OFS_MULTRES\t408\r\n#define CFRAME_SIZE\t\t384\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#elif LJ_ARCH_PPC32ON64\r\n#define CFRAME_OFS_ERRF\t\t472\r\n#define CFRAME_OFS_NRES\t\t468\r\n#define CFRAME_OFS_PREV\t\t448\r\n#define CFRAME_OFS_L\t\t464\r\n#define CFRAME_OFS_PC\t\t460\r\n#define CFRAME_OFS_MULTRES\t456\r\n#define CFRAME_SIZE\t\t400\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#else\r\n#define CFRAME_OFS_ERRF\t\t48\r\n#define CFRAME_OFS_NRES\t\t44\r\n#define CFRAME_OFS_PREV\t\t40\r\n#define CFRAME_OFS_L\t\t36\r\n#define CFRAME_OFS_PC\t\t32\r\n#define CFRAME_OFS_MULTRES\t28\r\n#define CFRAME_SIZE\t\t272\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#endif\r\n#elif LJ_TARGET_MIPS\r\n#define CFRAME_OFS_ERRF\t\t124\r\n#define CFRAME_OFS_NRES\t\t120\r\n#define CFRAME_OFS_PREV\t\t116\r\n#define CFRAME_OFS_L\t\t112\r\n#define CFRAME_OFS_PC\t\t20\r\n#define CFRAME_OFS_MULTRES\t16\r\n#define CFRAME_SIZE\t\t112\r\n#define CFRAME_SHIFT_MULTRES\t3\r\n#else\r\n#error \"Missing CFRAME_* definitions for this architecture\"\r\n#endif\r\n\r\n#ifndef CFRAME_SIZE_JIT\r\n#define CFRAME_SIZE_JIT\t\tCFRAME_SIZE\r\n#endif\r\n\r\n#define CFRAME_RESUME\t\t1\r\n#define CFRAME_UNWIND_FF\t2  /* Only used in unwinder. */\r\n#define CFRAME_RAWMASK\t\t(~(intptr_t)(CFRAME_RESUME|CFRAME_UNWIND_FF))\r\n\r\n#define cframe_errfunc(cf)\t(*(int32_t *)(((char *)(cf))+CFRAME_OFS_ERRF))\r\n#define cframe_nres(cf)\t\t(*(int32_t *)(((char *)(cf))+CFRAME_OFS_NRES))\r\n#define cframe_prev(cf)\t\t(*(void **)(((char *)(cf))+CFRAME_OFS_PREV))\r\n#define cframe_multres(cf)  (*(uint32_t *)(((char *)(cf))+CFRAME_OFS_MULTRES))\r\n#define cframe_multres_n(cf)\t(cframe_multres((cf)) >> CFRAME_SHIFT_MULTRES)\r\n#define cframe_L(cf) \\\r\n  (&gcref(*(GCRef *)(((char *)(cf))+CFRAME_OFS_L))->th)\r\n#define cframe_pc(cf) \\\r\n  (mref(*(MRef *)(((char *)(cf))+CFRAME_OFS_PC), const BCIns))\r\n#define setcframe_L(cf, L) \\\r\n  (setmref(*(MRef *)(((char *)(cf))+CFRAME_OFS_L), (L)))\r\n#define setcframe_pc(cf, pc) \\\r\n  (setmref(*(MRef *)(((char *)(cf))+CFRAME_OFS_PC), (pc)))\r\n#define cframe_canyield(cf)\t((intptr_t)(cf) & CFRAME_RESUME)\r\n#define cframe_unwind_ff(cf)\t((intptr_t)(cf) & CFRAME_UNWIND_FF)\r\n#define cframe_raw(cf)\t\t((void *)((intptr_t)(cf) & CFRAME_RAWMASK))\r\n#define cframe_Lpc(L)\t\tcframe_pc(cframe_raw(L->cframe))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_func.c",
    "content": "/*\r\n** Function handling (prototypes, functions and upvalues).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_func_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Prototypes ---------------------------------------------------------- */\r\n\r\nvoid LJ_FASTCALL lj_func_freeproto(global_State *g, GCproto *pt)\r\n{\r\n  lj_mem_free(g, pt, pt->sizept);\r\n}\r\n\r\n/* -- Upvalues ------------------------------------------------------------ */\r\n\r\nstatic void unlinkuv(GCupval *uv)\r\n{\r\n  lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n  setgcrefr(uvnext(uv)->prev, uv->prev);\r\n  setgcrefr(uvprev(uv)->next, uv->next);\r\n}\r\n\r\n/* Find existing open upvalue for a stack slot or create a new one. */\r\nstatic GCupval *func_finduv(lua_State *L, TValue *slot)\r\n{\r\n  global_State *g = G(L);\r\n  GCRef *pp = &L->openupval;\r\n  GCupval *p;\r\n  GCupval *uv;\r\n  /* Search the sorted list of open upvalues. */\r\n  while (gcref(*pp) != NULL && uvval((p = gco2uv(gcref(*pp)))) >= slot) {\r\n    lua_assert(!p->closed && uvval(p) != &p->tv);\r\n    if (uvval(p) == slot) {  /* Found open upvalue pointing to same slot? */\r\n      if (isdead(g, obj2gco(p)))  /* Resurrect it, if it's dead. */\r\n\tflipwhite(obj2gco(p));\r\n      return p;\r\n    }\r\n    pp = &p->nextgc;\r\n  }\r\n  /* No matching upvalue found. Create a new one. */\r\n  uv = lj_mem_newt(L, sizeof(GCupval), GCupval);\r\n  newwhite(g, uv);\r\n  uv->gct = ~LJ_TUPVAL;\r\n  uv->closed = 0;  /* Still open. */\r\n  setmref(uv->v, slot);  /* Pointing to the stack slot. */\r\n  /* NOBARRIER: The GCupval is new (marked white) and open. */\r\n  setgcrefr(uv->nextgc, *pp);  /* Insert into sorted list of open upvalues. */\r\n  setgcref(*pp, obj2gco(uv));\r\n  setgcref(uv->prev, obj2gco(&g->uvhead));  /* Insert into GC list, too. */\r\n  setgcrefr(uv->next, g->uvhead.next);\r\n  setgcref(uvnext(uv)->prev, obj2gco(uv));\r\n  setgcref(g->uvhead.next, obj2gco(uv));\r\n  lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n  return uv;\r\n}\r\n\r\n/* Create an empty and closed upvalue. */\r\nstatic GCupval *func_emptyuv(lua_State *L)\r\n{\r\n  GCupval *uv = (GCupval *)lj_mem_newgco(L, sizeof(GCupval));\r\n  uv->gct = ~LJ_TUPVAL;\r\n  uv->closed = 1;\r\n  setnilV(&uv->tv);\r\n  setmref(uv->v, &uv->tv);\r\n  return uv;\r\n}\r\n\r\n/* Close all open upvalues pointing to some stack level or above. */\r\nvoid LJ_FASTCALL lj_func_closeuv(lua_State *L, TValue *level)\r\n{\r\n  GCupval *uv;\r\n  global_State *g = G(L);\r\n  while (gcref(L->openupval) != NULL &&\r\n\t uvval((uv = gco2uv(gcref(L->openupval)))) >= level) {\r\n    GCobj *o = obj2gco(uv);\r\n    lua_assert(!isblack(o) && !uv->closed && uvval(uv) != &uv->tv);\r\n    setgcrefr(L->openupval, uv->nextgc);  /* No longer in open list. */\r\n    if (isdead(g, o)) {\r\n      lj_func_freeuv(g, uv);\r\n    } else {\r\n      unlinkuv(uv);\r\n      lj_gc_closeuv(g, uv);\r\n    }\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL lj_func_freeuv(global_State *g, GCupval *uv)\r\n{\r\n  if (!uv->closed)\r\n    unlinkuv(uv);\r\n  lj_mem_freet(g, uv);\r\n}\r\n\r\n/* -- Functions (closures) ------------------------------------------------ */\r\n\r\nGCfunc *lj_func_newC(lua_State *L, MSize nelems, GCtab *env)\r\n{\r\n  GCfunc *fn = (GCfunc *)lj_mem_newgco(L, sizeCfunc(nelems));\r\n  fn->c.gct = ~LJ_TFUNC;\r\n  fn->c.ffid = FF_C;\r\n  fn->c.nupvalues = (uint8_t)nelems;\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  setmref(fn->c.pc, &G(L)->bc_cfunc_ext);\r\n  setgcref(fn->c.env, obj2gco(env));\r\n  return fn;\r\n}\r\n\r\nstatic GCfunc *func_newL(lua_State *L, GCproto *pt, GCtab *env)\r\n{\r\n  uint32_t count;\r\n  GCfunc *fn = (GCfunc *)lj_mem_newgco(L, sizeLfunc((MSize)pt->sizeuv));\r\n  fn->l.gct = ~LJ_TFUNC;\r\n  fn->l.ffid = FF_LUA;\r\n  fn->l.nupvalues = 0;  /* Set to zero until upvalues are initialized. */\r\n  /* NOBARRIER: Really a setgcref. But the GCfunc is new (marked white). */\r\n  setmref(fn->l.pc, proto_bc(pt));\r\n  setgcref(fn->l.env, obj2gco(env));\r\n  /* Saturating 3 bit counter (0..7) for created closures. */\r\n  count = (uint32_t)pt->flags + PROTO_CLCOUNT;\r\n  pt->flags = (uint8_t)(count - ((count >> PROTO_CLC_BITS) & PROTO_CLCOUNT));\r\n  return fn;\r\n}\r\n\r\n/* Create a new Lua function with empty upvalues. */\r\nGCfunc *lj_func_newL_empty(lua_State *L, GCproto *pt, GCtab *env)\r\n{\r\n  GCfunc *fn = func_newL(L, pt, env);\r\n  MSize i, nuv = pt->sizeuv;\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  for (i = 0; i < nuv; i++) {\r\n    GCupval *uv = func_emptyuv(L);\r\n    uv->dhash = (uint32_t)(uintptr_t)pt ^ ((uint32_t)proto_uv(pt)[i] << 24);\r\n    setgcref(fn->l.uvptr[i], obj2gco(uv));\r\n  }\r\n  fn->l.nupvalues = (uint8_t)nuv;\r\n  return fn;\r\n}\r\n\r\n/* Do a GC check and create a new Lua function with inherited upvalues. */\r\nGCfunc *lj_func_newL_gc(lua_State *L, GCproto *pt, GCfuncL *parent)\r\n{\r\n  GCfunc *fn;\r\n  GCRef *puv;\r\n  MSize i, nuv;\r\n  TValue *base;\r\n  lj_gc_check_fixtop(L);\r\n  fn = func_newL(L, pt, tabref(parent->env));\r\n  /* NOBARRIER: The GCfunc is new (marked white). */\r\n  puv = parent->uvptr;\r\n  nuv = pt->sizeuv;\r\n  base = L->base;\r\n  for (i = 0; i < nuv; i++) {\r\n    uint32_t v = proto_uv(pt)[i];\r\n    GCupval *uv;\r\n    if ((v & PROTO_UV_LOCAL)) {\r\n      uv = func_finduv(L, base + (v & 0xff));\r\n      uv->immutable = ((v / PROTO_UV_IMMUTABLE) & 1);\r\n      uv->dhash = (uint32_t)(uintptr_t)mref(parent->pc, char) ^ (v << 24);\r\n    } else {\r\n      uv = &gcref(puv[v])->uv;\r\n    }\r\n    setgcref(fn->l.uvptr[i], obj2gco(uv));\r\n  }\r\n  fn->l.nupvalues = (uint8_t)nuv;\r\n  return fn;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_func_free(global_State *g, GCfunc *fn)\r\n{\r\n  MSize size = isluafunc(fn) ? sizeLfunc((MSize)fn->l.nupvalues) :\r\n\t\t\t       sizeCfunc((MSize)fn->c.nupvalues);\r\n  lj_mem_free(g, fn, size);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_func.h",
    "content": "/*\r\n** Function handling (prototypes, functions and upvalues).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_FUNC_H\r\n#define _LJ_FUNC_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Prototypes. */\r\nLJ_FUNC void LJ_FASTCALL lj_func_freeproto(global_State *g, GCproto *pt);\r\n\r\n/* Upvalues. */\r\nLJ_FUNCA void LJ_FASTCALL lj_func_closeuv(lua_State *L, TValue *level);\r\nLJ_FUNC void LJ_FASTCALL lj_func_freeuv(global_State *g, GCupval *uv);\r\n\r\n/* Functions (closures). */\r\nLJ_FUNC GCfunc *lj_func_newC(lua_State *L, MSize nelems, GCtab *env);\r\nLJ_FUNC GCfunc *lj_func_newL_empty(lua_State *L, GCproto *pt, GCtab *env);\r\nLJ_FUNCA GCfunc *lj_func_newL_gc(lua_State *L, GCproto *pt, GCfuncL *parent);\r\nLJ_FUNC void LJ_FASTCALL lj_func_free(global_State *g, GCfunc *c);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_gc.c",
    "content": "/*\r\n** Garbage collector.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_gc_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_udata.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n\r\n#define GCSTEPSIZE\t1024u\r\n#define GCSWEEPMAX\t40\r\n#define GCSWEEPCOST\t10\r\n#define GCFINALIZECOST\t100\r\n\r\n/* Macros to set GCobj colors and flags. */\r\n#define white2gray(x)\t\t((x)->gch.marked &= (uint8_t)~LJ_GC_WHITES)\r\n#define gray2black(x)\t\t((x)->gch.marked |= LJ_GC_BLACK)\r\n#define isfinalized(u)\t\t((u)->marked & LJ_GC_FINALIZED)\r\n\r\n/* -- Mark phase ---------------------------------------------------------- */\r\n\r\n/* Mark a TValue (if needed). */\r\n#define gc_marktv(g, tv) \\\r\n  { lua_assert(!tvisgcv(tv) || (~itype(tv) == gcval(tv)->gch.gct)); \\\r\n    if (tviswhite(tv)) gc_mark(g, gcV(tv)); }\r\n\r\n/* Mark a GCobj (if needed). */\r\n#define gc_markobj(g, o) \\\r\n  { if (iswhite(obj2gco(o))) gc_mark(g, obj2gco(o)); }\r\n\r\n/* Mark a string object. */\r\n#define gc_mark_str(s)\t\t((s)->marked &= (uint8_t)~LJ_GC_WHITES)\r\n\r\n/* Mark a white GCobj. */\r\nstatic void gc_mark(global_State *g, GCobj *o)\r\n{\r\n  int gct = o->gch.gct;\r\n  lua_assert(iswhite(o) && !isdead(g, o));\r\n  white2gray(o);\r\n  if (LJ_UNLIKELY(gct == ~LJ_TUDATA)) {\r\n    GCtab *mt = tabref(gco2ud(o)->metatable);\r\n    gray2black(o);  /* Userdata are never gray. */\r\n    if (mt) gc_markobj(g, mt);\r\n    gc_markobj(g, tabref(gco2ud(o)->env));\r\n  } else if (LJ_UNLIKELY(gct == ~LJ_TUPVAL)) {\r\n    GCupval *uv = gco2uv(o);\r\n    gc_marktv(g, uvval(uv));\r\n    if (uv->closed)\r\n      gray2black(o);  /* Closed upvalues are never gray. */\r\n  } else if (gct != ~LJ_TSTR && gct != ~LJ_TCDATA) {\r\n    lua_assert(gct == ~LJ_TFUNC || gct == ~LJ_TTAB ||\r\n\t       gct == ~LJ_TTHREAD || gct == ~LJ_TPROTO);\r\n    setgcrefr(o->gch.gclist, g->gc.gray);\r\n    setgcref(g->gc.gray, o);\r\n  }\r\n}\r\n\r\n/* Mark GC roots. */\r\nstatic void gc_mark_gcroot(global_State *g)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < GCROOT_MAX; i++)\r\n    if (gcref(g->gcroot[i]) != NULL)\r\n      gc_markobj(g, gcref(g->gcroot[i]));\r\n}\r\n\r\n/* Start a GC cycle and mark the root set. */\r\nstatic void gc_mark_start(global_State *g)\r\n{\r\n  setgcrefnull(g->gc.gray);\r\n  setgcrefnull(g->gc.grayagain);\r\n  setgcrefnull(g->gc.weak);\r\n  gc_markobj(g, mainthread(g));\r\n  gc_markobj(g, tabref(mainthread(g)->env));\r\n  gc_marktv(g, &g->registrytv);\r\n  gc_mark_gcroot(g);\r\n  g->gc.state = GCSpropagate;\r\n}\r\n\r\n/* Mark open upvalues. */\r\nstatic void gc_mark_uv(global_State *g)\r\n{\r\n  GCupval *uv;\r\n  for (uv = uvnext(&g->uvhead); uv != &g->uvhead; uv = uvnext(uv)) {\r\n    lua_assert(uvprev(uvnext(uv)) == uv && uvnext(uvprev(uv)) == uv);\r\n    if (isgray(obj2gco(uv)))\r\n      gc_marktv(g, uvval(uv));\r\n  }\r\n}\r\n\r\n/* Mark userdata in mmudata list. */\r\nstatic void gc_mark_mmudata(global_State *g)\r\n{\r\n  GCobj *root = gcref(g->gc.mmudata);\r\n  GCobj *u = root;\r\n  if (u) {\r\n    do {\r\n      u = gcnext(u);\r\n      makewhite(g, u);  /* Could be from previous GC. */\r\n      gc_mark(g, u);\r\n    } while (u != root);\r\n  }\r\n}\r\n\r\n/* Separate userdata objects to be finalized to mmudata list. */\r\nsize_t lj_gc_separateudata(global_State *g, int all)\r\n{\r\n  size_t m = 0;\r\n  GCRef *p = &mainthread(g)->nextgc;\r\n  GCobj *o;\r\n  while ((o = gcref(*p)) != NULL) {\r\n    if (!(iswhite(o) || all) || isfinalized(gco2ud(o))) {\r\n      p = &o->gch.nextgc;  /* Nothing to do. */\r\n    } else if (!lj_meta_fastg(g, tabref(gco2ud(o)->metatable), MM_gc)) {\r\n      markfinalized(o);  /* Done, as there's no __gc metamethod. */\r\n      p = &o->gch.nextgc;\r\n    } else {  /* Otherwise move userdata to be finalized to mmudata list. */\r\n      m += sizeudata(gco2ud(o));\r\n      markfinalized(o);\r\n      *p = o->gch.nextgc;\r\n      if (gcref(g->gc.mmudata)) {  /* Link to end of mmudata list. */\r\n\tGCobj *root = gcref(g->gc.mmudata);\r\n\tsetgcrefr(o->gch.nextgc, root->gch.nextgc);\r\n\tsetgcref(root->gch.nextgc, o);\r\n\tsetgcref(g->gc.mmudata, o);\r\n      } else {  /* Create circular list. */\r\n\tsetgcref(o->gch.nextgc, o);\r\n\tsetgcref(g->gc.mmudata, o);\r\n      }\r\n    }\r\n  }\r\n  return m;\r\n}\r\n\r\n/* -- Propagation phase --------------------------------------------------- */\r\n\r\n/* Traverse a table. */\r\nstatic int gc_traverse_tab(global_State *g, GCtab *t)\r\n{\r\n  int weak = 0;\r\n  cTValue *mode;\r\n  GCtab *mt = tabref(t->metatable);\r\n  if (mt)\r\n    gc_markobj(g, mt);\r\n  mode = lj_meta_fastg(g, mt, MM_mode);\r\n  if (mode && tvisstr(mode)) {  /* Valid __mode field? */\r\n    const char *modestr = strVdata(mode);\r\n    int c;\r\n    while ((c = *modestr++)) {\r\n      if (c == 'k') weak |= LJ_GC_WEAKKEY;\r\n      else if (c == 'v') weak |= LJ_GC_WEAKVAL;\r\n      else if (c == 'K') weak = (int)(~0u & ~LJ_GC_WEAKVAL);\r\n    }\r\n    if (weak > 0) {  /* Weak tables are cleared in the atomic phase. */\r\n      t->marked = (uint8_t)((t->marked & ~LJ_GC_WEAK) | weak);\r\n      setgcrefr(t->gclist, g->gc.weak);\r\n      setgcref(g->gc.weak, obj2gco(t));\r\n    }\r\n  }\r\n  if (weak == LJ_GC_WEAK)  /* Nothing to mark if both keys/values are weak. */\r\n    return 1;\r\n  if (!(weak & LJ_GC_WEAKVAL)) {  /* Mark array part. */\r\n    MSize i, asize = t->asize;\r\n    for (i = 0; i < asize; i++)\r\n      gc_marktv(g, arrayslot(t, i));\r\n  }\r\n  if (t->hmask > 0) {  /* Mark hash part. */\r\n    Node *node = noderef(t->node);\r\n    MSize i, hmask = t->hmask;\r\n    for (i = 0; i <= hmask; i++) {\r\n      Node *n = &node[i];\r\n      if (!tvisnil(&n->val)) {  /* Mark non-empty slot. */\r\n\tlua_assert(!tvisnil(&n->key));\r\n\tif (!(weak & LJ_GC_WEAKKEY)) gc_marktv(g, &n->key);\r\n\tif (!(weak & LJ_GC_WEAKVAL)) gc_marktv(g, &n->val);\r\n      }\r\n    }\r\n  }\r\n  return weak;\r\n}\r\n\r\n/* Traverse a function. */\r\nstatic void gc_traverse_func(global_State *g, GCfunc *fn)\r\n{\r\n  gc_markobj(g, tabref(fn->c.env));\r\n  if (isluafunc(fn)) {\r\n    uint32_t i;\r\n    lua_assert(fn->l.nupvalues <= funcproto(fn)->sizeuv);\r\n    gc_markobj(g, funcproto(fn));\r\n    for (i = 0; i < fn->l.nupvalues; i++)  /* Mark Lua function upvalues. */\r\n      gc_markobj(g, &gcref(fn->l.uvptr[i])->uv);\r\n  } else {\r\n    uint32_t i;\r\n    for (i = 0; i < fn->c.nupvalues; i++)  /* Mark C function upvalues. */\r\n      gc_marktv(g, &fn->c.upvalue[i]);\r\n  }\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Mark a trace. */\r\nstatic void gc_marktrace(global_State *g, TraceNo traceno)\r\n{\r\n  GCobj *o = obj2gco(traceref(G2J(g), traceno));\r\n  lua_assert(traceno != G2J(g)->cur.traceno);\r\n  if (iswhite(o)) {\r\n    white2gray(o);\r\n    setgcrefr(o->gch.gclist, g->gc.gray);\r\n    setgcref(g->gc.gray, o);\r\n  }\r\n}\r\n\r\n/* Traverse a trace. */\r\nstatic void gc_traverse_trace(global_State *g, GCtrace *T)\r\n{\r\n  IRRef ref;\r\n  if (T->traceno == 0) return;\r\n  for (ref = T->nk; ref < REF_TRUE; ref++) {\r\n    IRIns *ir = &T->ir[ref];\r\n    if (ir->o == IR_KGC)\r\n      gc_markobj(g, ir_kgc(ir));\r\n  }\r\n  if (T->link) gc_marktrace(g, T->link);\r\n  if (T->nextroot) gc_marktrace(g, T->nextroot);\r\n  if (T->nextside) gc_marktrace(g, T->nextside);\r\n  gc_markobj(g, gcref(T->startpt));\r\n}\r\n\r\n/* The current trace is a GC root while not anchored in the prototype (yet). */\r\n#define gc_traverse_curtrace(g)\tgc_traverse_trace(g, &G2J(g)->cur)\r\n#else\r\n#define gc_traverse_curtrace(g)\tUNUSED(g)\r\n#endif\r\n\r\n/* Traverse a prototype. */\r\nstatic void gc_traverse_proto(global_State *g, GCproto *pt)\r\n{\r\n  ptrdiff_t i;\r\n  gc_mark_str(proto_chunkname(pt));\r\n  for (i = -(ptrdiff_t)pt->sizekgc; i < 0; i++)  /* Mark collectable consts. */\r\n    gc_markobj(g, proto_kgc(pt, i));\r\n#if LJ_HASJIT\r\n  if (pt->trace) gc_marktrace(g, pt->trace);\r\n#endif\r\n}\r\n\r\n/* Traverse the frame structure of a stack. */\r\nstatic MSize gc_traverse_frames(global_State *g, lua_State *th)\r\n{\r\n  TValue *frame, *top = th->top-1, *bot = tvref(th->stack);\r\n  /* Note: extra vararg frame not skipped, marks function twice (harmless). */\r\n  for (frame = th->base-1; frame > bot+LJ_FR2; frame = frame_prev(frame)) {\r\n    GCfunc *fn = frame_func(frame);\r\n    TValue *ftop = frame;\r\n    if (isluafunc(fn)) ftop += funcproto(fn)->framesize;\r\n    if (ftop > top) top = ftop;\r\n    if (!LJ_FR2) gc_markobj(g, fn);  /* Need to mark hidden function (or L). */\r\n  }\r\n  top++;  /* Correct bias of -1 (frame == base-1). */\r\n  if (top > tvref(th->maxstack)) top = tvref(th->maxstack);\r\n  return (MSize)(top - bot);  /* Return minimum needed stack size. */\r\n}\r\n\r\n/* Traverse a thread object. */\r\nstatic void gc_traverse_thread(global_State *g, lua_State *th)\r\n{\r\n  TValue *o, *top = th->top;\r\n  for (o = tvref(th->stack)+1+LJ_FR2; o < top; o++)\r\n    gc_marktv(g, o);\r\n  if (g->gc.state == GCSatomic) {\r\n    top = tvref(th->stack) + th->stacksize;\r\n    for (; o < top; o++)  /* Clear unmarked slots. */\r\n      setnilV(o);\r\n  }\r\n  gc_markobj(g, tabref(th->env));\r\n  lj_state_shrinkstack(th, gc_traverse_frames(g, th));\r\n}\r\n\r\n/* Propagate one gray object. Traverse it and turn it black. */\r\nstatic size_t propagatemark(global_State *g)\r\n{\r\n  GCobj *o = gcref(g->gc.gray);\r\n  int gct = o->gch.gct;\r\n  lua_assert(isgray(o));\r\n  gray2black(o);\r\n  setgcrefr(g->gc.gray, o->gch.gclist);  /* Remove from gray list. */\r\n  if (LJ_LIKELY(gct == ~LJ_TTAB)) {\r\n    GCtab *t = gco2tab(o);\r\n    if (gc_traverse_tab(g, t) > 0)\r\n      black2gray(o);  /* Keep weak tables gray. */\r\n    return sizeof(GCtab) + sizeof(TValue) * t->asize +\r\n\t\t\t   sizeof(Node) * (t->hmask + 1);\r\n  } else if (LJ_LIKELY(gct == ~LJ_TFUNC)) {\r\n    GCfunc *fn = gco2func(o);\r\n    gc_traverse_func(g, fn);\r\n    return isluafunc(fn) ? sizeLfunc((MSize)fn->l.nupvalues) :\r\n\t\t\t   sizeCfunc((MSize)fn->c.nupvalues);\r\n  } else if (LJ_LIKELY(gct == ~LJ_TPROTO)) {\r\n    GCproto *pt = gco2pt(o);\r\n    gc_traverse_proto(g, pt);\r\n    return pt->sizept;\r\n  } else if (LJ_LIKELY(gct == ~LJ_TTHREAD)) {\r\n    lua_State *th = gco2th(o);\r\n    setgcrefr(th->gclist, g->gc.grayagain);\r\n    setgcref(g->gc.grayagain, o);\r\n    black2gray(o);  /* Threads are never black. */\r\n    gc_traverse_thread(g, th);\r\n    return sizeof(lua_State) + sizeof(TValue) * th->stacksize;\r\n  } else {\r\n#if LJ_HASJIT\r\n    GCtrace *T = gco2trace(o);\r\n    gc_traverse_trace(g, T);\r\n    return ((sizeof(GCtrace)+7)&~7) + (T->nins-T->nk)*sizeof(IRIns) +\r\n\t   T->nsnap*sizeof(SnapShot) + T->nsnapmap*sizeof(SnapEntry);\r\n#else\r\n    lua_assert(0);\r\n    return 0;\r\n#endif\r\n  }\r\n}\r\n\r\n/* Propagate all gray objects. */\r\nstatic size_t gc_propagate_gray(global_State *g)\r\n{\r\n  size_t m = 0;\r\n  while (gcref(g->gc.gray) != NULL)\r\n    m += propagatemark(g);\r\n  return m;\r\n}\r\n\r\n/* -- Sweep phase --------------------------------------------------------- */\r\n\r\n/* Type of GC free functions. */\r\ntypedef void (LJ_FASTCALL *GCFreeFunc)(global_State *g, GCobj *o);\r\n\r\n/* GC free functions for LJ_TSTR .. LJ_TUDATA. ORDER LJ_T */\r\nstatic const GCFreeFunc gc_freefunc[] = {\r\n  (GCFreeFunc)lj_str_free,\r\n  (GCFreeFunc)lj_func_freeuv,\r\n  (GCFreeFunc)lj_state_free,\r\n  (GCFreeFunc)lj_func_freeproto,\r\n  (GCFreeFunc)lj_func_free,\r\n#if LJ_HASJIT\r\n  (GCFreeFunc)lj_trace_free,\r\n#else\r\n  (GCFreeFunc)0,\r\n#endif\r\n#if LJ_HASFFI\r\n  (GCFreeFunc)lj_cdata_free,\r\n#else\r\n  (GCFreeFunc)0,\r\n#endif\r\n  (GCFreeFunc)lj_tab_free,\r\n  (GCFreeFunc)lj_udata_free\r\n};\r\n\r\n/* Full sweep of a GC list. */\r\n#define gc_fullsweep(g, p)\tgc_sweep(g, (p), ~(uint32_t)0)\r\n\r\n/* Partial sweep of a GC list. */\r\nstatic GCRef *gc_sweep(global_State *g, GCRef *p, uint32_t lim)\r\n{\r\n  /* Mask with other white and LJ_GC_FIXED. Or LJ_GC_SFIXED on shutdown. */\r\n  int ow = otherwhite(g);\r\n  GCobj *o;\r\n  while ((o = gcref(*p)) != NULL && lim-- > 0) {\r\n    if (o->gch.gct == ~LJ_TTHREAD)  /* Need to sweep open upvalues, too. */\r\n      gc_fullsweep(g, &gco2th(o)->openupval);\r\n    if (((o->gch.marked ^ LJ_GC_WHITES) & ow)) {  /* Black or current white? */\r\n      lua_assert(!isdead(g, o) || (o->gch.marked & LJ_GC_FIXED));\r\n      makewhite(g, o);  /* Value is alive, change to the current white. */\r\n      p = &o->gch.nextgc;\r\n    } else {  /* Otherwise value is dead, free it. */\r\n      lua_assert(isdead(g, o) || ow == LJ_GC_SFIXED);\r\n      setgcrefr(*p, o->gch.nextgc);\r\n      if (o == gcref(g->gc.root))\r\n\tsetgcrefr(g->gc.root, o->gch.nextgc);  /* Adjust list anchor. */\r\n      gc_freefunc[o->gch.gct - ~LJ_TSTR](g, o);\r\n    }\r\n  }\r\n  return p;\r\n}\r\n\r\n/* Check whether we can clear a key or a value slot from a table. */\r\nstatic int gc_mayclear(cTValue *o, int val)\r\n{\r\n  if (tvisgcv(o)) {  /* Only collectable objects can be weak references. */\r\n    if (tvisstr(o)) {  /* But strings cannot be used as weak references. */\r\n      gc_mark_str(strV(o));  /* And need to be marked. */\r\n      return 0;\r\n    }\r\n    if (iswhite(gcV(o)))\r\n      return 1;  /* Object is about to be collected. */\r\n    if (tvisudata(o) && val && isfinalized(udataV(o)))\r\n      return 1;  /* Finalized userdata is dropped only from values. */\r\n  }\r\n  return 0;  /* Cannot clear. */\r\n}\r\n\r\n/* Clear collected entries from weak tables. */\r\nstatic void gc_clearweak(GCobj *o)\r\n{\r\n  while (o) {\r\n    GCtab *t = gco2tab(o);\r\n    lua_assert((t->marked & LJ_GC_WEAK));\r\n    if ((t->marked & LJ_GC_WEAKVAL)) {\r\n      MSize i, asize = t->asize;\r\n      for (i = 0; i < asize; i++) {\r\n\t/* Clear array slot when value is about to be collected. */\r\n\tTValue *tv = arrayslot(t, i);\r\n\tif (gc_mayclear(tv, 1))\r\n\t  setnilV(tv);\r\n      }\r\n    }\r\n    if (t->hmask > 0) {\r\n      Node *node = noderef(t->node);\r\n      MSize i, hmask = t->hmask;\r\n      for (i = 0; i <= hmask; i++) {\r\n\tNode *n = &node[i];\r\n\t/* Clear hash slot when key or value is about to be collected. */\r\n\tif (!tvisnil(&n->val) && (gc_mayclear(&n->key, 0) ||\r\n\t\t\t\t  gc_mayclear(&n->val, 1)))\r\n\t  setnilV(&n->val);\r\n      }\r\n    }\r\n    o = gcref(t->gclist);\r\n  }\r\n}\r\n\r\n/* Call a userdata or cdata finalizer. */\r\nstatic void gc_call_finalizer(global_State *g, lua_State *L,\r\n\t\t\t      cTValue *mo, GCobj *o)\r\n{\r\n  /* Save and restore lots of state around the __gc callback. */\r\n  uint8_t oldh = hook_save(g);\r\n  GCSize oldt = g->gc.threshold;\r\n  int errcode;\r\n  TValue *top;\r\n  lj_trace_abort(g);\r\n  hook_entergc(g);  /* Disable hooks and new traces during __gc. */\r\n  g->gc.threshold = LJ_MAX_MEM;  /* Prevent GC steps. */\r\n  top = L->top;\r\n  copyTV(L, top++, mo);\r\n  if (LJ_FR2) setnilV(top++);\r\n  setgcV(L, top, o, ~o->gch.gct);\r\n  L->top = top+1;\r\n  errcode = lj_vm_pcall(L, top, 1+0, -1);  /* Stack: |mo|o| -> | */\r\n  hook_restore(g, oldh);\r\n  g->gc.threshold = oldt;  /* Restore GC threshold. */\r\n  if (errcode)\r\n    lj_err_throw(L, errcode);  /* Propagate errors. */\r\n}\r\n\r\n/* Finalize one userdata or cdata object from the mmudata list. */\r\nstatic void gc_finalize(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  GCobj *o = gcnext(gcref(g->gc.mmudata));\r\n  cTValue *mo;\r\n  lua_assert(tvref(g->jit_base) == NULL);  /* Must not be called on trace. */\r\n  /* Unchain from list of userdata to be finalized. */\r\n  if (o == gcref(g->gc.mmudata))\r\n    setgcrefnull(g->gc.mmudata);\r\n  else\r\n    setgcrefr(gcref(g->gc.mmudata)->gch.nextgc, o->gch.nextgc);\r\n#if LJ_HASFFI\r\n  if (o->gch.gct == ~LJ_TCDATA) {\r\n    TValue tmp, *tv;\r\n    /* Add cdata back to the GC list and make it white. */\r\n    setgcrefr(o->gch.nextgc, g->gc.root);\r\n    setgcref(g->gc.root, o);\r\n    makewhite(g, o);\r\n    o->gch.marked &= (uint8_t)~LJ_GC_CDATA_FIN;\r\n    /* Resolve finalizer. */\r\n    setcdataV(L, &tmp, gco2cd(o));\r\n    tv = lj_tab_set(L, ctype_ctsG(g)->finalizer, &tmp);\r\n    if (!tvisnil(tv)) {\r\n      g->gc.nocdatafin = 0;\r\n      copyTV(L, &tmp, tv);\r\n      setnilV(tv);  /* Clear entry in finalizer table. */\r\n      gc_call_finalizer(g, L, &tmp, o);\r\n    }\r\n    return;\r\n  }\r\n#endif\r\n  /* Add userdata back to the main userdata list and make it white. */\r\n  setgcrefr(o->gch.nextgc, mainthread(g)->nextgc);\r\n  setgcref(mainthread(g)->nextgc, o);\r\n  makewhite(g, o);\r\n  /* Resolve the __gc metamethod. */\r\n  mo = lj_meta_fastg(g, tabref(gco2ud(o)->metatable), MM_gc);\r\n  if (mo)\r\n    gc_call_finalizer(g, L, mo, o);\r\n}\r\n\r\n/* Finalize all userdata objects from mmudata list. */\r\nvoid lj_gc_finalize_udata(lua_State *L)\r\n{\r\n  while (gcref(G(L)->gc.mmudata) != NULL)\r\n    gc_finalize(L);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Finalize all cdata objects from finalizer table. */\r\nvoid lj_gc_finalize_cdata(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  CTState *cts = ctype_ctsG(g);\r\n  if (cts) {\r\n    GCtab *t = cts->finalizer;\r\n    Node *node = noderef(t->node);\r\n    ptrdiff_t i;\r\n    setgcrefnull(t->metatable);  /* Mark finalizer table as disabled. */\r\n    for (i = (ptrdiff_t)t->hmask; i >= 0; i--)\r\n      if (!tvisnil(&node[i].val) && tviscdata(&node[i].key)) {\r\n\tGCobj *o = gcV(&node[i].key);\r\n\tTValue tmp;\r\n\tmakewhite(g, o);\r\n\to->gch.marked &= (uint8_t)~LJ_GC_CDATA_FIN;\r\n\tcopyTV(L, &tmp, &node[i].val);\r\n\tsetnilV(&node[i].val);\r\n\tgc_call_finalizer(g, L, &tmp, o);\r\n      }\r\n  }\r\n}\r\n#endif\r\n\r\n/* Free all remaining GC objects. */\r\nvoid lj_gc_freeall(global_State *g)\r\n{\r\n  MSize i, strmask;\r\n  /* Free everything, except super-fixed objects (the main thread). */\r\n  g->gc.currentwhite = LJ_GC_WHITES | LJ_GC_SFIXED;\r\n  gc_fullsweep(g, &g->gc.root);\r\n  strmask = g->strmask;\r\n  for (i = 0; i <= strmask; i++)  /* Free all string hash chains. */\r\n    gc_fullsweep(g, &g->strhash[i]);\r\n}\r\n\r\n/* -- Collector ----------------------------------------------------------- */\r\n\r\n/* Atomic part of the GC cycle, transitioning from mark to sweep phase. */\r\nstatic void atomic(global_State *g, lua_State *L)\r\n{\r\n  size_t udsize;\r\n\r\n  gc_mark_uv(g);  /* Need to remark open upvalues (the thread may be dead). */\r\n  gc_propagate_gray(g);  /* Propagate any left-overs. */\r\n\r\n  setgcrefr(g->gc.gray, g->gc.weak);  /* Empty the list of weak tables. */\r\n  setgcrefnull(g->gc.weak);\r\n  lua_assert(!iswhite(obj2gco(mainthread(g))));\r\n  gc_markobj(g, L);  /* Mark running thread. */\r\n  gc_traverse_curtrace(g);  /* Traverse current trace. */\r\n  gc_mark_gcroot(g);  /* Mark GC roots (again). */\r\n  gc_propagate_gray(g);  /* Propagate all of the above. */\r\n\r\n  setgcrefr(g->gc.gray, g->gc.grayagain);  /* Empty the 2nd chance list. */\r\n  setgcrefnull(g->gc.grayagain);\r\n  gc_propagate_gray(g);  /* Propagate it. */\r\n\r\n  udsize = lj_gc_separateudata(g, 0);  /* Separate userdata to be finalized. */\r\n  gc_mark_mmudata(g);  /* Mark them. */\r\n  udsize += gc_propagate_gray(g);  /* And propagate the marks. */\r\n\r\n  /* All marking done, clear weak tables. */\r\n  gc_clearweak(gcref(g->gc.weak));\r\n\r\n  lj_buf_shrink(L, &g->tmpbuf);  /* Shrink temp buffer. */\r\n\r\n  /* Prepare for sweep phase. */\r\n  g->gc.currentwhite = (uint8_t)otherwhite(g);  /* Flip current white. */\r\n  g->strempty.marked = g->gc.currentwhite;\r\n  setmref(g->gc.sweep, &g->gc.root);\r\n  g->gc.estimate = g->gc.total - (GCSize)udsize;  /* Initial estimate. */\r\n}\r\n\r\n/* GC state machine. Returns a cost estimate for each step performed. */\r\nstatic size_t gc_onestep(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  switch (g->gc.state) {\r\n  case GCSpause:\r\n    gc_mark_start(g);  /* Start a new GC cycle by marking all GC roots. */\r\n    return 0;\r\n  case GCSpropagate:\r\n    if (gcref(g->gc.gray) != NULL)\r\n      return propagatemark(g);  /* Propagate one gray object. */\r\n    g->gc.state = GCSatomic;  /* End of mark phase. */\r\n    return 0;\r\n  case GCSatomic:\r\n    if (tvref(g->jit_base))  /* Don't run atomic phase on trace. */\r\n      return LJ_MAX_MEM;\r\n    atomic(g, L);\r\n    g->gc.state = GCSsweepstring;  /* Start of sweep phase. */\r\n    g->gc.sweepstr = 0;\r\n    return 0;\r\n  case GCSsweepstring: {\r\n    GCSize old = g->gc.total;\r\n    gc_fullsweep(g, &g->strhash[g->gc.sweepstr++]);  /* Sweep one chain. */\r\n    if (g->gc.sweepstr > g->strmask)\r\n      g->gc.state = GCSsweep;  /* All string hash chains sweeped. */\r\n    lua_assert(old >= g->gc.total);\r\n    g->gc.estimate -= old - g->gc.total;\r\n    return GCSWEEPCOST;\r\n    }\r\n  case GCSsweep: {\r\n    GCSize old = g->gc.total;\r\n    setmref(g->gc.sweep, gc_sweep(g, mref(g->gc.sweep, GCRef), GCSWEEPMAX));\r\n    lua_assert(old >= g->gc.total);\r\n    g->gc.estimate -= old - g->gc.total;\r\n    if (gcref(*mref(g->gc.sweep, GCRef)) == NULL) {\r\n      if (g->strnum <= (g->strmask >> 2) && g->strmask > LJ_MIN_STRTAB*2-1)\r\n\tlj_str_resize(L, g->strmask >> 1);  /* Shrink string table. */\r\n      if (gcref(g->gc.mmudata)) {  /* Need any finalizations? */\r\n\tg->gc.state = GCSfinalize;\r\n#if LJ_HASFFI\r\n\tg->gc.nocdatafin = 1;\r\n#endif\r\n      } else {  /* Otherwise skip this phase to help the JIT. */\r\n\tg->gc.state = GCSpause;  /* End of GC cycle. */\r\n\tg->gc.debt = 0;\r\n      }\r\n    }\r\n    return GCSWEEPMAX*GCSWEEPCOST;\r\n    }\r\n  case GCSfinalize:\r\n    if (gcref(g->gc.mmudata) != NULL) {\r\n      if (tvref(g->jit_base))  /* Don't call finalizers on trace. */\r\n\treturn LJ_MAX_MEM;\r\n      gc_finalize(L);  /* Finalize one userdata object. */\r\n      if (g->gc.estimate > GCFINALIZECOST)\r\n\tg->gc.estimate -= GCFINALIZECOST;\r\n      return GCFINALIZECOST;\r\n    }\r\n#if LJ_HASFFI\r\n    if (!g->gc.nocdatafin) lj_tab_rehash(L, ctype_ctsG(g)->finalizer);\r\n#endif\r\n    g->gc.state = GCSpause;  /* End of GC cycle. */\r\n    g->gc.debt = 0;\r\n    return 0;\r\n  default:\r\n    lua_assert(0);\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Perform a limited amount of incremental GC steps. */\r\nint LJ_FASTCALL lj_gc_step(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  GCSize lim;\r\n  int32_t ostate = g->vmstate;\r\n  setvmstate(g, GC);\r\n  lim = (GCSTEPSIZE/100) * g->gc.stepmul;\r\n  if (lim == 0)\r\n    lim = LJ_MAX_MEM;\r\n  if (g->gc.total > g->gc.threshold)\r\n    g->gc.debt += g->gc.total - g->gc.threshold;\r\n  do {\r\n    lim -= (GCSize)gc_onestep(L);\r\n    if (g->gc.state == GCSpause) {\r\n      g->gc.threshold = (g->gc.estimate/100) * g->gc.pause;\r\n      g->vmstate = ostate;\r\n      return 1;  /* Finished a GC cycle. */\r\n    }\r\n  } while (sizeof(lim) == 8 ? ((int64_t)lim > 0) : ((int32_t)lim > 0));\r\n  if (g->gc.debt < GCSTEPSIZE) {\r\n    g->gc.threshold = g->gc.total + GCSTEPSIZE;\r\n    g->vmstate = ostate;\r\n    return -1;\r\n  } else {\r\n    g->gc.debt -= GCSTEPSIZE;\r\n    g->gc.threshold = g->gc.total;\r\n    g->vmstate = ostate;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Ditto, but fix the stack top first. */\r\nvoid LJ_FASTCALL lj_gc_step_fixtop(lua_State *L)\r\n{\r\n  if (curr_funcisL(L)) L->top = curr_topL(L);\r\n  lj_gc_step(L);\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Perform multiple GC steps. Called from JIT-compiled code. */\r\nint LJ_FASTCALL lj_gc_step_jit(global_State *g, MSize steps)\r\n{\r\n  lua_State *L = gco2th(gcref(g->cur_L));\r\n  L->base = tvref(G(L)->jit_base);\r\n  L->top = curr_topL(L);\r\n  while (steps-- > 0 && lj_gc_step(L) == 0)\r\n    ;\r\n  /* Return 1 to force a trace exit. */\r\n  return (G(L)->gc.state == GCSatomic || G(L)->gc.state == GCSfinalize);\r\n}\r\n#endif\r\n\r\n/* Perform a full GC cycle. */\r\nvoid lj_gc_fullgc(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  int32_t ostate = g->vmstate;\r\n  setvmstate(g, GC);\r\n  if (g->gc.state <= GCSatomic) {  /* Caught somewhere in the middle. */\r\n    setmref(g->gc.sweep, &g->gc.root);  /* Sweep everything (preserving it). */\r\n    setgcrefnull(g->gc.gray);  /* Reset lists from partial propagation. */\r\n    setgcrefnull(g->gc.grayagain);\r\n    setgcrefnull(g->gc.weak);\r\n    g->gc.state = GCSsweepstring;  /* Fast forward to the sweep phase. */\r\n    g->gc.sweepstr = 0;\r\n  }\r\n  while (g->gc.state == GCSsweepstring || g->gc.state == GCSsweep)\r\n    gc_onestep(L);  /* Finish sweep. */\r\n  lua_assert(g->gc.state == GCSfinalize || g->gc.state == GCSpause);\r\n  /* Now perform a full GC. */\r\n  g->gc.state = GCSpause;\r\n  do { gc_onestep(L); } while (g->gc.state != GCSpause);\r\n  g->gc.threshold = (g->gc.estimate/100) * g->gc.pause;\r\n  g->vmstate = ostate;\r\n}\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\n/* Move the GC propagation frontier forward. */\r\nvoid lj_gc_barrierf(global_State *g, GCobj *o, GCobj *v)\r\n{\r\n  lua_assert(isblack(o) && iswhite(v) && !isdead(g, v) && !isdead(g, o));\r\n  lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n  lua_assert(o->gch.gct != ~LJ_TTAB);\r\n  /* Preserve invariant during propagation. Otherwise it doesn't matter. */\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_mark(g, v);  /* Move frontier forward. */\r\n  else\r\n    makewhite(g, o);  /* Make it white to avoid the following barrier. */\r\n}\r\n\r\n/* Specialized barrier for closed upvalue. Pass &uv->tv. */\r\nvoid LJ_FASTCALL lj_gc_barrieruv(global_State *g, TValue *tv)\r\n{\r\n#define TV2MARKED(x) \\\r\n  (*((uint8_t *)(x) - offsetof(GCupval, tv) + offsetof(GCupval, marked)))\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_mark(g, gcV(tv));\r\n  else\r\n    TV2MARKED(tv) = (TV2MARKED(tv) & (uint8_t)~LJ_GC_COLORS) | curwhite(g);\r\n#undef TV2MARKED\r\n}\r\n\r\n/* Close upvalue. Also needs a write barrier. */\r\nvoid lj_gc_closeuv(global_State *g, GCupval *uv)\r\n{\r\n  GCobj *o = obj2gco(uv);\r\n  /* Copy stack slot to upvalue itself and point to the copy. */\r\n  copyTV(mainthread(g), &uv->tv, uvval(uv));\r\n  setmref(uv->v, &uv->tv);\r\n  uv->closed = 1;\r\n  setgcrefr(o->gch.nextgc, g->gc.root);\r\n  setgcref(g->gc.root, o);\r\n  if (isgray(o)) {  /* A closed upvalue is never gray, so fix this. */\r\n    if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic) {\r\n      gray2black(o);  /* Make it black and preserve invariant. */\r\n      if (tviswhite(&uv->tv))\r\n\tlj_gc_barrierf(g, o, gcV(&uv->tv));\r\n    } else {\r\n      makewhite(g, o);  /* Make it white, i.e. sweep the upvalue. */\r\n      lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Mark a trace if it's saved during the propagation phase. */\r\nvoid lj_gc_barriertrace(global_State *g, uint32_t traceno)\r\n{\r\n  if (g->gc.state == GCSpropagate || g->gc.state == GCSatomic)\r\n    gc_marktrace(g, traceno);\r\n}\r\n#endif\r\n\r\n/* -- Allocator ----------------------------------------------------------- */\r\n\r\n/* Call pluggable memory allocator to allocate or resize a fragment. */\r\nvoid *lj_mem_realloc(lua_State *L, void *p, GCSize osz, GCSize nsz)\r\n{\r\n  global_State *g = G(L);\r\n  lua_assert((osz == 0) == (p == NULL));\r\n  p = g->allocf(g->allocd, p, osz, nsz);\r\n  if (p == NULL && nsz > 0)\r\n    lj_err_mem(L);\r\n  lua_assert((nsz == 0) == (p == NULL));\r\n  lua_assert(checkptrGC(p));\r\n  g->gc.total = (g->gc.total - osz) + nsz;\r\n  return p;\r\n}\r\n\r\n/* Allocate new GC object and link it to the root set. */\r\nvoid * LJ_FASTCALL lj_mem_newgco(lua_State *L, GCSize size)\r\n{\r\n  global_State *g = G(L);\r\n  GCobj *o = (GCobj *)g->allocf(g->allocd, NULL, 0, size);\r\n  if (o == NULL)\r\n    lj_err_mem(L);\r\n  lua_assert(checkptrGC(o));\r\n  g->gc.total += size;\r\n  setgcrefr(o->gch.nextgc, g->gc.root);\r\n  setgcref(g->gc.root, o);\r\n  newwhite(g, o);\r\n  return o;\r\n}\r\n\r\n/* Resize growable vector. */\r\nvoid *lj_mem_grow(lua_State *L, void *p, MSize *szp, MSize lim, MSize esz)\r\n{\r\n  MSize sz = (*szp) << 1;\r\n  if (sz < LJ_MIN_VECSZ)\r\n    sz = LJ_MIN_VECSZ;\r\n  if (sz > lim)\r\n    sz = lim;\r\n  p = lj_mem_realloc(L, p, (*szp)*esz, sz*esz);\r\n  *szp = sz;\r\n  return p;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_gc.h",
    "content": "/*\r\n** Garbage collector.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_GC_H\r\n#define _LJ_GC_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Garbage collector states. Order matters. */\r\nenum {\r\n  GCSpause, GCSpropagate, GCSatomic, GCSsweepstring, GCSsweep, GCSfinalize\r\n};\r\n\r\n/* Bitmasks for marked field of GCobj. */\r\n#define LJ_GC_WHITE0\t0x01\r\n#define LJ_GC_WHITE1\t0x02\r\n#define LJ_GC_BLACK\t0x04\r\n#define LJ_GC_FINALIZED\t0x08\r\n#define LJ_GC_WEAKKEY\t0x08\r\n#define LJ_GC_WEAKVAL\t0x10\r\n#define LJ_GC_CDATA_FIN\t0x10\r\n#define LJ_GC_FIXED\t0x20\r\n#define LJ_GC_SFIXED\t0x40\r\n\r\n#define LJ_GC_WHITES\t(LJ_GC_WHITE0 | LJ_GC_WHITE1)\r\n#define LJ_GC_COLORS\t(LJ_GC_WHITES | LJ_GC_BLACK)\r\n#define LJ_GC_WEAK\t(LJ_GC_WEAKKEY | LJ_GC_WEAKVAL)\r\n\r\n/* Macros to test and set GCobj colors. */\r\n#define iswhite(x)\t((x)->gch.marked & LJ_GC_WHITES)\r\n#define isblack(x)\t((x)->gch.marked & LJ_GC_BLACK)\r\n#define isgray(x)\t(!((x)->gch.marked & (LJ_GC_BLACK|LJ_GC_WHITES)))\r\n#define tviswhite(x)\t(tvisgcv(x) && iswhite(gcV(x)))\r\n#define otherwhite(g)\t(g->gc.currentwhite ^ LJ_GC_WHITES)\r\n#define isdead(g, v)\t((v)->gch.marked & otherwhite(g) & LJ_GC_WHITES)\r\n\r\n#define curwhite(g)\t((g)->gc.currentwhite & LJ_GC_WHITES)\r\n#define newwhite(g, x)\t(obj2gco(x)->gch.marked = (uint8_t)curwhite(g))\r\n#define makewhite(g, x) \\\r\n  ((x)->gch.marked = ((x)->gch.marked & (uint8_t)~LJ_GC_COLORS) | curwhite(g))\r\n#define flipwhite(x)\t((x)->gch.marked ^= LJ_GC_WHITES)\r\n#define black2gray(x)\t((x)->gch.marked &= (uint8_t)~LJ_GC_BLACK)\r\n#define fixstring(s)\t((s)->marked |= LJ_GC_FIXED)\r\n#define markfinalized(x)\t((x)->gch.marked |= LJ_GC_FINALIZED)\r\n\r\n/* Collector. */\r\nLJ_FUNC size_t lj_gc_separateudata(global_State *g, int all);\r\nLJ_FUNC void lj_gc_finalize_udata(lua_State *L);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_gc_finalize_cdata(lua_State *L);\r\n#else\r\n#define lj_gc_finalize_cdata(L)\t\tUNUSED(L)\r\n#endif\r\nLJ_FUNC void lj_gc_freeall(global_State *g);\r\nLJ_FUNCA int LJ_FASTCALL lj_gc_step(lua_State *L);\r\nLJ_FUNCA void LJ_FASTCALL lj_gc_step_fixtop(lua_State *L);\r\n#if LJ_HASJIT\r\nLJ_FUNC int LJ_FASTCALL lj_gc_step_jit(global_State *g, MSize steps);\r\n#endif\r\nLJ_FUNC void lj_gc_fullgc(lua_State *L);\r\n\r\n/* GC check: drive collector forward if the GC threshold has been reached. */\r\n#define lj_gc_check(L) \\\r\n  { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \\\r\n      lj_gc_step(L); }\r\n#define lj_gc_check_fixtop(L) \\\r\n  { if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) \\\r\n      lj_gc_step_fixtop(L); }\r\n\r\n/* Write barriers. */\r\nLJ_FUNC void lj_gc_barrierf(global_State *g, GCobj *o, GCobj *v);\r\nLJ_FUNCA void LJ_FASTCALL lj_gc_barrieruv(global_State *g, TValue *tv);\r\nLJ_FUNC void lj_gc_closeuv(global_State *g, GCupval *uv);\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_gc_barriertrace(global_State *g, uint32_t traceno);\r\n#endif\r\n\r\n/* Move the GC propagation frontier back for tables (make it gray again). */\r\nstatic LJ_AINLINE void lj_gc_barrierback(global_State *g, GCtab *t)\r\n{\r\n  GCobj *o = obj2gco(t);\r\n  lua_assert(isblack(o) && !isdead(g, o));\r\n  lua_assert(g->gc.state != GCSfinalize && g->gc.state != GCSpause);\r\n  black2gray(o);\r\n  setgcrefr(t->gclist, g->gc.grayagain);\r\n  setgcref(g->gc.grayagain, o);\r\n}\r\n\r\n/* Barrier for stores to table objects. TValue and GCobj variant. */\r\n#define lj_gc_anybarriert(L, t)  \\\r\n  { if (LJ_UNLIKELY(isblack(obj2gco(t)))) lj_gc_barrierback(G(L), (t)); }\r\n#define lj_gc_barriert(L, t, tv) \\\r\n  { if (tviswhite(tv) && isblack(obj2gco(t))) \\\r\n      lj_gc_barrierback(G(L), (t)); }\r\n#define lj_gc_objbarriert(L, t, o)  \\\r\n  { if (iswhite(obj2gco(o)) && isblack(obj2gco(t))) \\\r\n      lj_gc_barrierback(G(L), (t)); }\r\n\r\n/* Barrier for stores to any other object. TValue and GCobj variant. */\r\n#define lj_gc_barrier(L, p, tv) \\\r\n  { if (tviswhite(tv) && isblack(obj2gco(p))) \\\r\n      lj_gc_barrierf(G(L), obj2gco(p), gcV(tv)); }\r\n#define lj_gc_objbarrier(L, p, o) \\\r\n  { if (iswhite(obj2gco(o)) && isblack(obj2gco(p))) \\\r\n      lj_gc_barrierf(G(L), obj2gco(p), obj2gco(o)); }\r\n\r\n/* Allocator. */\r\nLJ_FUNC void *lj_mem_realloc(lua_State *L, void *p, GCSize osz, GCSize nsz);\r\nLJ_FUNC void * LJ_FASTCALL lj_mem_newgco(lua_State *L, GCSize size);\r\nLJ_FUNC void *lj_mem_grow(lua_State *L, void *p,\r\n\t\t\t  MSize *szp, MSize lim, MSize esz);\r\n\r\n#define lj_mem_new(L, s)\tlj_mem_realloc(L, NULL, 0, (s))\r\n\r\nstatic LJ_AINLINE void lj_mem_free(global_State *g, void *p, size_t osize)\r\n{\r\n  g->gc.total -= (GCSize)osize;\r\n  g->allocf(g->allocd, p, osize, 0);\r\n}\r\n\r\n#define lj_mem_newvec(L, n, t)\t((t *)lj_mem_new(L, (GCSize)((n)*sizeof(t))))\r\n#define lj_mem_reallocvec(L, p, on, n, t) \\\r\n  ((p) = (t *)lj_mem_realloc(L, p, (on)*sizeof(t), (GCSize)((n)*sizeof(t))))\r\n#define lj_mem_growvec(L, p, n, m, t) \\\r\n  ((p) = (t *)lj_mem_grow(L, (p), &(n), (m), (MSize)sizeof(t)))\r\n#define lj_mem_freevec(g, p, n, t)\tlj_mem_free(g, (p), (n)*sizeof(t))\r\n\r\n#define lj_mem_newobj(L, t)\t((t *)lj_mem_newgco(L, sizeof(t)))\r\n#define lj_mem_newt(L, s, t)\t((t *)lj_mem_new(L, (s)))\r\n#define lj_mem_freet(g, p)\tlj_mem_free(g, (p), sizeof(*(p)))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_gdbjit.c",
    "content": "/*\r\n** Client for the GDB JIT API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_gdbjit_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_dispatch.h\"\r\n\r\n/* This is not compiled in by default.\r\n** Enable with -DLUAJIT_USE_GDBJIT in the Makefile and recompile everything.\r\n*/\r\n#ifdef LUAJIT_USE_GDBJIT\r\n\r\n/* The GDB JIT API allows JIT compilers to pass debug information about\r\n** JIT-compiled code back to GDB. You need at least GDB 7.0 or higher\r\n** to see it in action.\r\n**\r\n** This is a passive API, so it works even when not running under GDB\r\n** or when attaching to an already running process. Alas, this implies\r\n** enabling it always has a non-negligible overhead -- do not use in\r\n** release mode!\r\n**\r\n** The LuaJIT GDB JIT client is rather minimal at the moment. It gives\r\n** each trace a symbol name and adds a source location and frame unwind\r\n** information. Obviously LuaJIT itself and any embedding C application\r\n** should be compiled with debug symbols, too (see the Makefile).\r\n**\r\n** Traces are named TRACE_1, TRACE_2, ... these correspond to the trace\r\n** numbers from -jv or -jdump. Use \"break TRACE_1\" or \"tbreak TRACE_1\" etc.\r\n** to set breakpoints on specific traces (even ahead of their creation).\r\n**\r\n** The source location for each trace allows listing the corresponding\r\n** source lines with the GDB command \"list\" (but only if the Lua source\r\n** has been loaded from a file). Currently this is always set to the\r\n** location where the trace has been started.\r\n**\r\n** Frame unwind information can be inspected with the GDB command\r\n** \"info frame\". This also allows proper backtraces across JIT-compiled\r\n** code with the GDB command \"bt\".\r\n**\r\n** You probably want to add the following settings to a .gdbinit file\r\n** (or add them to ~/.gdbinit):\r\n**   set disassembly-flavor intel\r\n**   set breakpoint pending on\r\n**\r\n** Here's a sample GDB session:\r\n** ------------------------------------------------------------------------\r\n\r\n$ cat >x.lua\r\nfor outer=1,100 do\r\n  for inner=1,100 do end\r\nend\r\n^D\r\n\r\n$ luajit -jv x.lua\r\n[TRACE   1 x.lua:2]\r\n[TRACE   2 (1/3) x.lua:1 -> 1]\r\n\r\n$ gdb --quiet --args luajit x.lua\r\n(gdb) tbreak TRACE_1\r\nFunction \"TRACE_1\" not defined.\r\nTemporary breakpoint 1 (TRACE_1) pending.\r\n(gdb) run\r\nStarting program: luajit x.lua\r\n\r\nTemporary breakpoint 1, TRACE_1 () at x.lua:2\r\n2\t  for inner=1,100 do end\r\n(gdb) list\r\n1\tfor outer=1,100 do\r\n2\t  for inner=1,100 do end\r\n3\tend\r\n(gdb) bt\r\n#0  TRACE_1 () at x.lua:2\r\n#1  0x08053690 in lua_pcall [...]\r\n[...]\r\n#7  0x0806ff90 in main [...]\r\n(gdb) disass TRACE_1\r\nDump of assembler code for function TRACE_1:\r\n0xf7fd9fba <TRACE_1+0>:\tmov    DWORD PTR ds:0xf7e0e2a0,0x1\r\n0xf7fd9fc4 <TRACE_1+10>:\tmovsd  xmm7,QWORD PTR [edx+0x20]\r\n[...]\r\n0xf7fd9ff8 <TRACE_1+62>:\tjmp    0xf7fd2014\r\nEnd of assembler dump.\r\n(gdb) tbreak TRACE_2\r\nFunction \"TRACE_2\" not defined.\r\nTemporary breakpoint 2 (TRACE_2) pending.\r\n(gdb) cont\r\nContinuing.\r\n\r\nTemporary breakpoint 2, TRACE_2 () at x.lua:1\r\n1\tfor outer=1,100 do\r\n(gdb) info frame\r\nStack level 0, frame at 0xffffd7c0:\r\n eip = 0xf7fd9f60 in TRACE_2 (x.lua:1); saved eip 0x8053690\r\n called by frame at 0xffffd7e0\r\n source language unknown.\r\n Arglist at 0xffffd78c, args:\r\n Locals at 0xffffd78c, Previous frame's sp is 0xffffd7c0\r\n Saved registers:\r\n  ebx at 0xffffd7ac, ebp at 0xffffd7b8, esi at 0xffffd7b0, edi at 0xffffd7b4,\r\n  eip at 0xffffd7bc\r\n(gdb)\r\n\r\n** ------------------------------------------------------------------------\r\n*/\r\n\r\n/* -- GDB JIT API --------------------------------------------------------- */\r\n\r\n/* GDB JIT actions. */\r\nenum {\r\n  GDBJIT_NOACTION = 0,\r\n  GDBJIT_REGISTER,\r\n  GDBJIT_UNREGISTER\r\n};\r\n\r\n/* GDB JIT entry. */\r\ntypedef struct GDBJITentry {\r\n  struct GDBJITentry *next_entry;\r\n  struct GDBJITentry *prev_entry;\r\n  const char *symfile_addr;\r\n  uint64_t symfile_size;\r\n} GDBJITentry;\r\n\r\n/* GDB JIT descriptor. */\r\ntypedef struct GDBJITdesc {\r\n  uint32_t version;\r\n  uint32_t action_flag;\r\n  GDBJITentry *relevant_entry;\r\n  GDBJITentry *first_entry;\r\n} GDBJITdesc;\r\n\r\nGDBJITdesc __jit_debug_descriptor = {\r\n  1, GDBJIT_NOACTION, NULL, NULL\r\n};\r\n\r\n/* GDB sets a breakpoint at this function. */\r\nvoid LJ_NOINLINE __jit_debug_register_code()\r\n{\r\n  __asm__ __volatile__(\"\");\r\n};\r\n\r\n/* -- In-memory ELF object definitions ------------------------------------ */\r\n\r\n/* ELF definitions. */\r\ntypedef struct ELFheader {\r\n  uint8_t emagic[4];\r\n  uint8_t eclass;\r\n  uint8_t eendian;\r\n  uint8_t eversion;\r\n  uint8_t eosabi;\r\n  uint8_t eabiversion;\r\n  uint8_t epad[7];\r\n  uint16_t type;\r\n  uint16_t machine;\r\n  uint32_t version;\r\n  uintptr_t entry;\r\n  uintptr_t phofs;\r\n  uintptr_t shofs;\r\n  uint32_t flags;\r\n  uint16_t ehsize;\r\n  uint16_t phentsize;\r\n  uint16_t phnum;\r\n  uint16_t shentsize;\r\n  uint16_t shnum;\r\n  uint16_t shstridx;\r\n} ELFheader;\r\n\r\ntypedef struct ELFsectheader {\r\n  uint32_t name;\r\n  uint32_t type;\r\n  uintptr_t flags;\r\n  uintptr_t addr;\r\n  uintptr_t ofs;\r\n  uintptr_t size;\r\n  uint32_t link;\r\n  uint32_t info;\r\n  uintptr_t align;\r\n  uintptr_t entsize;\r\n} ELFsectheader;\r\n\r\n#define ELFSECT_IDX_ABS\t\t0xfff1\r\n\r\nenum {\r\n  ELFSECT_TYPE_PROGBITS = 1,\r\n  ELFSECT_TYPE_SYMTAB = 2,\r\n  ELFSECT_TYPE_STRTAB = 3,\r\n  ELFSECT_TYPE_NOBITS = 8\r\n};\r\n\r\n#define ELFSECT_FLAGS_WRITE\t1\r\n#define ELFSECT_FLAGS_ALLOC\t2\r\n#define ELFSECT_FLAGS_EXEC\t4\r\n\r\ntypedef struct ELFsymbol {\r\n#if LJ_64\r\n  uint32_t name;\r\n  uint8_t info;\r\n  uint8_t other;\r\n  uint16_t sectidx;\r\n  uintptr_t value;\r\n  uint64_t size;\r\n#else\r\n  uint32_t name;\r\n  uintptr_t value;\r\n  uint32_t size;\r\n  uint8_t info;\r\n  uint8_t other;\r\n  uint16_t sectidx;\r\n#endif\r\n} ELFsymbol;\r\n\r\nenum {\r\n  ELFSYM_TYPE_FUNC = 2,\r\n  ELFSYM_TYPE_FILE = 4,\r\n  ELFSYM_BIND_LOCAL = 0 << 4,\r\n  ELFSYM_BIND_GLOBAL = 1 << 4,\r\n};\r\n\r\n/* DWARF definitions. */\r\n#define DW_CIE_VERSION\t1\r\n\r\nenum {\r\n  DW_CFA_nop = 0x0,\r\n  DW_CFA_offset_extended = 0x5,\r\n  DW_CFA_def_cfa = 0xc,\r\n  DW_CFA_def_cfa_offset = 0xe,\r\n  DW_CFA_offset_extended_sf = 0x11,\r\n  DW_CFA_advance_loc = 0x40,\r\n  DW_CFA_offset = 0x80\r\n};\r\n\r\nenum {\r\n  DW_EH_PE_udata4 = 3,\r\n  DW_EH_PE_textrel = 0x20\r\n};\r\n\r\nenum {\r\n  DW_TAG_compile_unit = 0x11\r\n};\r\n\r\nenum {\r\n  DW_children_no = 0,\r\n  DW_children_yes = 1\r\n};\r\n\r\nenum {\r\n  DW_AT_name = 0x03,\r\n  DW_AT_stmt_list = 0x10,\r\n  DW_AT_low_pc = 0x11,\r\n  DW_AT_high_pc = 0x12\r\n};\r\n\r\nenum {\r\n  DW_FORM_addr = 0x01,\r\n  DW_FORM_data4 = 0x06,\r\n  DW_FORM_string = 0x08\r\n};\r\n\r\nenum {\r\n  DW_LNS_extended_op = 0,\r\n  DW_LNS_copy = 1,\r\n  DW_LNS_advance_pc = 2,\r\n  DW_LNS_advance_line = 3\r\n};\r\n\r\nenum {\r\n  DW_LNE_end_sequence = 1,\r\n  DW_LNE_set_address = 2\r\n};\r\n\r\nenum {\r\n#if LJ_TARGET_X86\r\n  DW_REG_AX, DW_REG_CX, DW_REG_DX, DW_REG_BX,\r\n  DW_REG_SP, DW_REG_BP, DW_REG_SI, DW_REG_DI,\r\n  DW_REG_RA,\r\n#elif LJ_TARGET_X64\r\n  /* Yes, the order is strange, but correct. */\r\n  DW_REG_AX, DW_REG_DX, DW_REG_CX, DW_REG_BX,\r\n  DW_REG_SI, DW_REG_DI, DW_REG_BP, DW_REG_SP,\r\n  DW_REG_8, DW_REG_9, DW_REG_10, DW_REG_11,\r\n  DW_REG_12, DW_REG_13, DW_REG_14, DW_REG_15,\r\n  DW_REG_RA,\r\n#elif LJ_TARGET_ARM\r\n  DW_REG_SP = 13,\r\n  DW_REG_RA = 14,\r\n#elif LJ_TARGET_PPC\r\n  DW_REG_SP = 1,\r\n  DW_REG_RA = 65,\r\n  DW_REG_CR = 70,\r\n#elif LJ_TARGET_MIPS\r\n  DW_REG_SP = 29,\r\n  DW_REG_RA = 31,\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n};\r\n\r\n/* Minimal list of sections for the in-memory ELF object. */\r\nenum {\r\n  GDBJIT_SECT_NULL,\r\n  GDBJIT_SECT_text,\r\n  GDBJIT_SECT_eh_frame,\r\n  GDBJIT_SECT_shstrtab,\r\n  GDBJIT_SECT_strtab,\r\n  GDBJIT_SECT_symtab,\r\n  GDBJIT_SECT_debug_info,\r\n  GDBJIT_SECT_debug_abbrev,\r\n  GDBJIT_SECT_debug_line,\r\n  GDBJIT_SECT__MAX\r\n};\r\n\r\nenum {\r\n  GDBJIT_SYM_UNDEF,\r\n  GDBJIT_SYM_FILE,\r\n  GDBJIT_SYM_FUNC,\r\n  GDBJIT_SYM__MAX\r\n};\r\n\r\n/* In-memory ELF object. */\r\ntypedef struct GDBJITobj {\r\n  ELFheader hdr;\t\t\t/* ELF header. */\r\n  ELFsectheader sect[GDBJIT_SECT__MAX];\t/* ELF sections. */\r\n  ELFsymbol sym[GDBJIT_SYM__MAX];\t/* ELF symbol table. */\r\n  uint8_t space[4096];\t\t\t/* Space for various section data. */\r\n} GDBJITobj;\r\n\r\n/* Combined structure for GDB JIT entry and ELF object. */\r\ntypedef struct GDBJITentryobj {\r\n  GDBJITentry entry;\r\n  size_t sz;\r\n  GDBJITobj obj;\r\n} GDBJITentryobj;\r\n\r\n/* Template for in-memory ELF header. */\r\nstatic const ELFheader elfhdr_template = {\r\n  .emagic = { 0x7f, 'E', 'L', 'F' },\r\n  .eclass = LJ_64 ? 2 : 1,\r\n  .eendian = LJ_ENDIAN_SELECT(1, 2),\r\n  .eversion = 1,\r\n#if LJ_TARGET_LINUX\r\n  .eosabi = 0,  /* Nope, it's not 3. */\r\n#elif defined(__FreeBSD__)\r\n  .eosabi = 9,\r\n#elif defined(__NetBSD__)\r\n  .eosabi = 2,\r\n#elif defined(__OpenBSD__)\r\n  .eosabi = 12,\r\n#elif defined(__DragonFly__)\r\n  .eosabi = 0,\r\n#elif (defined(__sun__) && defined(__svr4__))\r\n  .eosabi = 6,\r\n#else\r\n  .eosabi = 0,\r\n#endif\r\n  .eabiversion = 0,\r\n  .epad = { 0, 0, 0, 0, 0, 0, 0 },\r\n  .type = 1,\r\n#if LJ_TARGET_X86\r\n  .machine = 3,\r\n#elif LJ_TARGET_X64\r\n  .machine = 62,\r\n#elif LJ_TARGET_ARM\r\n  .machine = 40,\r\n#elif LJ_TARGET_PPC\r\n  .machine = 20,\r\n#elif LJ_TARGET_MIPS\r\n  .machine = 8,\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n  .version = 1,\r\n  .entry = 0,\r\n  .phofs = 0,\r\n  .shofs = offsetof(GDBJITobj, sect),\r\n  .flags = 0,\r\n  .ehsize = sizeof(ELFheader),\r\n  .phentsize = 0,\r\n  .phnum = 0,\r\n  .shentsize = sizeof(ELFsectheader),\r\n  .shnum = GDBJIT_SECT__MAX,\r\n  .shstridx = GDBJIT_SECT_shstrtab\r\n};\r\n\r\n/* -- In-memory ELF object generation ------------------------------------- */\r\n\r\n/* Context for generating the ELF object for the GDB JIT API. */\r\ntypedef struct GDBJITctx {\r\n  uint8_t *p;\t\t/* Pointer to next address in obj.space. */\r\n  uint8_t *startp;\t/* Pointer to start address in obj.space. */\r\n  GCtrace *T;\t\t/* Generate symbols for this trace. */\r\n  uintptr_t mcaddr;\t/* Machine code address. */\r\n  MSize szmcode;\t/* Size of machine code. */\r\n  MSize spadjp;\t\t/* Stack adjustment for parent trace or interpreter. */\r\n  MSize spadj;\t\t/* Stack adjustment for trace itself. */\r\n  BCLine lineno;\t/* Starting line number. */\r\n  const char *filename;\t/* Starting file name. */\r\n  size_t objsize;\t/* Final size of ELF object. */\r\n  GDBJITobj obj;\t/* In-memory ELF object. */\r\n} GDBJITctx;\r\n\r\n/* Add a zero-terminated string. */\r\nstatic uint32_t gdbjit_strz(GDBJITctx *ctx, const char *str)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  uint32_t ofs = (uint32_t)(p - ctx->startp);\r\n  do {\r\n    *p++ = (uint8_t)*str;\r\n  } while (*str++);\r\n  ctx->p = p;\r\n  return ofs;\r\n}\r\n\r\n/* Append a decimal number. */\r\nstatic void gdbjit_catnum(GDBJITctx *ctx, uint32_t n)\r\n{\r\n  if (n >= 10) { uint32_t m = n / 10; n = n % 10; gdbjit_catnum(ctx, m); }\r\n  *ctx->p++ = '0' + n;\r\n}\r\n\r\n/* Add a SLEB128 value. */\r\nstatic void gdbjit_sleb128(GDBJITctx *ctx, int32_t v)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  for (; (uint32_t)(v+0x40) >= 0x80; v >>= 7)\r\n    *p++ = (uint8_t)((v & 0x7f) | 0x80);\r\n  *p++ = (uint8_t)(v & 0x7f);\r\n  ctx->p = p;\r\n}\r\n\r\n/* Shortcuts to generate DWARF structures. */\r\n#define DB(x)\t\t(*p++ = (x))\r\n#define DI8(x)\t\t(*(int8_t *)p = (x), p++)\r\n#define DU16(x)\t\t(*(uint16_t *)p = (x), p += 2)\r\n#define DU32(x)\t\t(*(uint32_t *)p = (x), p += 4)\r\n#define DADDR(x)\t(*(uintptr_t *)p = (x), p += sizeof(uintptr_t))\r\n#define DUV(x)\t\t(p = (uint8_t *)lj_strfmt_wuleb128((char *)p, (x)))\r\n#define DSV(x)\t\t(ctx->p = p, gdbjit_sleb128(ctx, (x)), p = ctx->p)\r\n#define DSTR(str)\t(ctx->p = p, gdbjit_strz(ctx, (str)), p = ctx->p)\r\n#define DALIGNNOP(s)\twhile ((uintptr_t)p & ((s)-1)) *p++ = DW_CFA_nop\r\n#define DSECT(name, stmt) \\\r\n  { uint32_t *szp_##name = (uint32_t *)p; p += 4; stmt \\\r\n    *szp_##name = (uint32_t)((p-(uint8_t *)szp_##name)-4); } \\\r\n\r\n/* Initialize ELF section headers. */\r\nstatic void LJ_FASTCALL gdbjit_secthdr(GDBJITctx *ctx)\r\n{\r\n  ELFsectheader *sect;\r\n\r\n  *ctx->p++ = '\\0';  /* Empty string at start of string table. */\r\n\r\n#define SECTDEF(id, tp, al) \\\r\n  sect = &ctx->obj.sect[GDBJIT_SECT_##id]; \\\r\n  sect->name = gdbjit_strz(ctx, \".\" #id); \\\r\n  sect->type = ELFSECT_TYPE_##tp; \\\r\n  sect->align = (al)\r\n\r\n  SECTDEF(text, NOBITS, 16);\r\n  sect->flags = ELFSECT_FLAGS_ALLOC|ELFSECT_FLAGS_EXEC;\r\n  sect->addr = ctx->mcaddr;\r\n  sect->ofs = 0;\r\n  sect->size = ctx->szmcode;\r\n\r\n  SECTDEF(eh_frame, PROGBITS, sizeof(uintptr_t));\r\n  sect->flags = ELFSECT_FLAGS_ALLOC;\r\n\r\n  SECTDEF(shstrtab, STRTAB, 1);\r\n  SECTDEF(strtab, STRTAB, 1);\r\n\r\n  SECTDEF(symtab, SYMTAB, sizeof(uintptr_t));\r\n  sect->ofs = offsetof(GDBJITobj, sym);\r\n  sect->size = sizeof(ctx->obj.sym);\r\n  sect->link = GDBJIT_SECT_strtab;\r\n  sect->entsize = sizeof(ELFsymbol);\r\n  sect->info = GDBJIT_SYM_FUNC;\r\n\r\n  SECTDEF(debug_info, PROGBITS, 1);\r\n  SECTDEF(debug_abbrev, PROGBITS, 1);\r\n  SECTDEF(debug_line, PROGBITS, 1);\r\n\r\n#undef SECTDEF\r\n}\r\n\r\n/* Initialize symbol table. */\r\nstatic void LJ_FASTCALL gdbjit_symtab(GDBJITctx *ctx)\r\n{\r\n  ELFsymbol *sym;\r\n\r\n  *ctx->p++ = '\\0';  /* Empty string at start of string table. */\r\n\r\n  sym = &ctx->obj.sym[GDBJIT_SYM_FILE];\r\n  sym->name = gdbjit_strz(ctx, \"JIT mcode\");\r\n  sym->sectidx = ELFSECT_IDX_ABS;\r\n  sym->info = ELFSYM_TYPE_FILE|ELFSYM_BIND_LOCAL;\r\n\r\n  sym = &ctx->obj.sym[GDBJIT_SYM_FUNC];\r\n  sym->name = gdbjit_strz(ctx, \"TRACE_\"); ctx->p--;\r\n  gdbjit_catnum(ctx, ctx->T->traceno); *ctx->p++ = '\\0';\r\n  sym->sectidx = GDBJIT_SECT_text;\r\n  sym->value = 0;\r\n  sym->size = ctx->szmcode;\r\n  sym->info = ELFSYM_TYPE_FUNC|ELFSYM_BIND_GLOBAL;\r\n}\r\n\r\n/* Initialize .eh_frame section. */\r\nstatic void LJ_FASTCALL gdbjit_ehframe(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n  uint8_t *framep = p;\r\n\r\n  /* Emit DWARF EH CIE. */\r\n  DSECT(CIE,\r\n    DU32(0);\t\t\t/* Offset to CIE itself. */\r\n    DB(DW_CIE_VERSION);\r\n    DSTR(\"zR\");\t\t\t/* Augmentation. */\r\n    DUV(1);\t\t\t/* Code alignment factor. */\r\n    DSV(-(int32_t)sizeof(uintptr_t));  /* Data alignment factor. */\r\n    DB(DW_REG_RA);\t\t/* Return address register. */\r\n    DB(1); DB(DW_EH_PE_textrel|DW_EH_PE_udata4);  /* Augmentation data. */\r\n    DB(DW_CFA_def_cfa); DUV(DW_REG_SP); DUV(sizeof(uintptr_t));\r\n#if LJ_TARGET_PPC\r\n    DB(DW_CFA_offset_extended_sf); DB(DW_REG_RA); DSV(-1);\r\n#else\r\n    DB(DW_CFA_offset|DW_REG_RA); DUV(1);\r\n#endif\r\n    DALIGNNOP(sizeof(uintptr_t));\r\n  )\r\n\r\n  /* Emit DWARF EH FDE. */\r\n  DSECT(FDE,\r\n    DU32((uint32_t)(p-framep));\t/* Offset to CIE. */\r\n    DU32(0);\t\t\t/* Machine code offset relative to .text. */\r\n    DU32(ctx->szmcode);\t\t/* Machine code length. */\r\n    DB(0);\t\t\t/* Augmentation data. */\r\n    /* Registers saved in CFRAME. */\r\n#if LJ_TARGET_X86\r\n    DB(DW_CFA_offset|DW_REG_BP); DUV(2);\r\n    DB(DW_CFA_offset|DW_REG_DI); DUV(3);\r\n    DB(DW_CFA_offset|DW_REG_SI); DUV(4);\r\n    DB(DW_CFA_offset|DW_REG_BX); DUV(5);\r\n#elif LJ_TARGET_X64\r\n    DB(DW_CFA_offset|DW_REG_BP); DUV(2);\r\n    DB(DW_CFA_offset|DW_REG_BX); DUV(3);\r\n    DB(DW_CFA_offset|DW_REG_15); DUV(4);\r\n    DB(DW_CFA_offset|DW_REG_14); DUV(5);\r\n    /* Extra registers saved for JIT-compiled code. */\r\n    DB(DW_CFA_offset|DW_REG_13); DUV(LJ_GC64 ? 10 : 9);\r\n    DB(DW_CFA_offset|DW_REG_12); DUV(LJ_GC64 ? 11 : 10);\r\n#elif LJ_TARGET_ARM\r\n    {\r\n      int i;\r\n      for (i = 11; i >= 4; i--) { DB(DW_CFA_offset|i); DUV(2+(11-i)); }\r\n    }\r\n#elif LJ_TARGET_PPC\r\n    {\r\n      int i;\r\n      DB(DW_CFA_offset_extended); DB(DW_REG_CR); DUV(55);\r\n      for (i = 14; i <= 31; i++) {\r\n\tDB(DW_CFA_offset|i); DUV(37+(31-i));\r\n\tDB(DW_CFA_offset|32|i); DUV(2+2*(31-i));\r\n      }\r\n    }\r\n#elif LJ_TARGET_MIPS\r\n    {\r\n      int i;\r\n      DB(DW_CFA_offset|30); DUV(2);\r\n      for (i = 23; i >= 16; i--) { DB(DW_CFA_offset|i); DUV(26-i); }\r\n      for (i = 30; i >= 20; i -= 2) { DB(DW_CFA_offset|32|i); DUV(42-i); }\r\n    }\r\n#else\r\n#error \"Unsupported target architecture\"\r\n#endif\r\n    if (ctx->spadjp != ctx->spadj) {  /* Parent/interpreter stack frame size. */\r\n      DB(DW_CFA_def_cfa_offset); DUV(ctx->spadjp);\r\n      DB(DW_CFA_advance_loc|1);  /* Only an approximation. */\r\n    }\r\n    DB(DW_CFA_def_cfa_offset); DUV(ctx->spadj);  /* Trace stack frame size. */\r\n    DALIGNNOP(sizeof(uintptr_t));\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n/* Initialize .debug_info section. */\r\nstatic void LJ_FASTCALL gdbjit_debuginfo(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  DSECT(info,\r\n    DU16(2);\t\t\t/* DWARF version. */\r\n    DU32(0);\t\t\t/* Abbrev offset. */\r\n    DB(sizeof(uintptr_t));\t/* Pointer size. */\r\n\r\n    DUV(1);\t\t\t/* Abbrev #1: DW_TAG_compile_unit. */\r\n    DSTR(ctx->filename);\t/* DW_AT_name. */\r\n    DADDR(ctx->mcaddr);\t\t/* DW_AT_low_pc. */\r\n    DADDR(ctx->mcaddr + ctx->szmcode);  /* DW_AT_high_pc. */\r\n    DU32(0);\t\t\t/* DW_AT_stmt_list. */\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n/* Initialize .debug_abbrev section. */\r\nstatic void LJ_FASTCALL gdbjit_debugabbrev(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  /* Abbrev #1: DW_TAG_compile_unit. */\r\n  DUV(1); DUV(DW_TAG_compile_unit);\r\n  DB(DW_children_no);\r\n  DUV(DW_AT_name);\tDUV(DW_FORM_string);\r\n  DUV(DW_AT_low_pc);\tDUV(DW_FORM_addr);\r\n  DUV(DW_AT_high_pc);\tDUV(DW_FORM_addr);\r\n  DUV(DW_AT_stmt_list);\tDUV(DW_FORM_data4);\r\n  DB(0); DB(0);\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n#define DLNE(op, s)\t(DB(DW_LNS_extended_op), DUV(1+(s)), DB((op)))\r\n\r\n/* Initialize .debug_line section. */\r\nstatic void LJ_FASTCALL gdbjit_debugline(GDBJITctx *ctx)\r\n{\r\n  uint8_t *p = ctx->p;\r\n\r\n  DSECT(line,\r\n    DU16(2);\t\t\t/* DWARF version. */\r\n    DSECT(header,\r\n      DB(1);\t\t\t/* Minimum instruction length. */\r\n      DB(1);\t\t\t/* is_stmt. */\r\n      DI8(0);\t\t\t/* Line base for special opcodes. */\r\n      DB(2);\t\t\t/* Line range for special opcodes. */\r\n      DB(3+1);\t\t\t/* Opcode base at DW_LNS_advance_line+1. */\r\n      DB(0); DB(1); DB(1);\t/* Standard opcode lengths. */\r\n      /* Directory table. */\r\n      DB(0);\r\n      /* File name table. */\r\n      DSTR(ctx->filename); DUV(0); DUV(0); DUV(0);\r\n      DB(0);\r\n    )\r\n\r\n    DLNE(DW_LNE_set_address, sizeof(uintptr_t)); DADDR(ctx->mcaddr);\r\n    if (ctx->lineno) {\r\n      DB(DW_LNS_advance_line); DSV(ctx->lineno-1);\r\n    }\r\n    DB(DW_LNS_copy);\r\n    DB(DW_LNS_advance_pc); DUV(ctx->szmcode);\r\n    DLNE(DW_LNE_end_sequence, 0);\r\n  )\r\n\r\n  ctx->p = p;\r\n}\r\n\r\n#undef DLNE\r\n\r\n/* Undef shortcuts. */\r\n#undef DB\r\n#undef DI8\r\n#undef DU16\r\n#undef DU32\r\n#undef DADDR\r\n#undef DUV\r\n#undef DSV\r\n#undef DSTR\r\n#undef DALIGNNOP\r\n#undef DSECT\r\n\r\n/* Type of a section initializer callback. */\r\ntypedef void (LJ_FASTCALL *GDBJITinitf)(GDBJITctx *ctx);\r\n\r\n/* Call section initializer and set the section offset and size. */\r\nstatic void gdbjit_initsect(GDBJITctx *ctx, int sect, GDBJITinitf initf)\r\n{\r\n  ctx->startp = ctx->p;\r\n  ctx->obj.sect[sect].ofs = (uintptr_t)((char *)ctx->p - (char *)&ctx->obj);\r\n  initf(ctx);\r\n  ctx->obj.sect[sect].size = (uintptr_t)(ctx->p - ctx->startp);\r\n}\r\n\r\n#define SECTALIGN(p, a) \\\r\n  ((p) = (uint8_t *)(((uintptr_t)(p) + ((a)-1)) & ~(uintptr_t)((a)-1)))\r\n\r\n/* Build in-memory ELF object. */\r\nstatic void gdbjit_buildobj(GDBJITctx *ctx)\r\n{\r\n  GDBJITobj *obj = &ctx->obj;\r\n  /* Fill in ELF header and clear structures. */\r\n  memcpy(&obj->hdr, &elfhdr_template, sizeof(ELFheader));\r\n  memset(&obj->sect, 0, sizeof(ELFsectheader)*GDBJIT_SECT__MAX);\r\n  memset(&obj->sym, 0, sizeof(ELFsymbol)*GDBJIT_SYM__MAX);\r\n  /* Initialize sections. */\r\n  ctx->p = obj->space;\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_shstrtab, gdbjit_secthdr);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_strtab, gdbjit_symtab);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_info, gdbjit_debuginfo);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_abbrev, gdbjit_debugabbrev);\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_debug_line, gdbjit_debugline);\r\n  SECTALIGN(ctx->p, sizeof(uintptr_t));\r\n  gdbjit_initsect(ctx, GDBJIT_SECT_eh_frame, gdbjit_ehframe);\r\n  ctx->objsize = (size_t)((char *)ctx->p - (char *)obj);\r\n  lua_assert(ctx->objsize < sizeof(GDBJITobj));\r\n}\r\n\r\n#undef SECTALIGN\r\n\r\n/* -- Interface to GDB JIT API -------------------------------------------- */\r\n\r\n/* Add new entry to GDB JIT symbol chain. */\r\nstatic void gdbjit_newentry(lua_State *L, GDBJITctx *ctx)\r\n{\r\n  /* Allocate memory for GDB JIT entry and ELF object. */\r\n  MSize sz = (MSize)(sizeof(GDBJITentryobj) - sizeof(GDBJITobj) + ctx->objsize);\r\n  GDBJITentryobj *eo = lj_mem_newt(L, sz, GDBJITentryobj);\r\n  memcpy(&eo->obj, &ctx->obj, ctx->objsize);  /* Copy ELF object. */\r\n  eo->sz = sz;\r\n  ctx->T->gdbjit_entry = (void *)eo;\r\n  /* Link new entry to chain and register it. */\r\n  eo->entry.prev_entry = NULL;\r\n  eo->entry.next_entry = __jit_debug_descriptor.first_entry;\r\n  if (eo->entry.next_entry)\r\n    eo->entry.next_entry->prev_entry = &eo->entry;\r\n  eo->entry.symfile_addr = (const char *)&eo->obj;\r\n  eo->entry.symfile_size = ctx->objsize;\r\n  __jit_debug_descriptor.first_entry = &eo->entry;\r\n  __jit_debug_descriptor.relevant_entry = &eo->entry;\r\n  __jit_debug_descriptor.action_flag = GDBJIT_REGISTER;\r\n  __jit_debug_register_code();\r\n}\r\n\r\n/* Add debug info for newly compiled trace and notify GDB. */\r\nvoid lj_gdbjit_addtrace(jit_State *J, GCtrace *T)\r\n{\r\n  GDBJITctx ctx;\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  TraceNo parent = T->ir[REF_BASE].op1;\r\n  const BCIns *startpc = mref(T->startpc, const BCIns);\r\n  ctx.T = T;\r\n  ctx.mcaddr = (uintptr_t)T->mcode;\r\n  ctx.szmcode = T->szmcode;\r\n  ctx.spadjp = CFRAME_SIZE_JIT +\r\n\t       (MSize)(parent ? traceref(J, parent)->spadjust : 0);\r\n  ctx.spadj = CFRAME_SIZE_JIT + T->spadjust;\r\n  lua_assert(startpc >= proto_bc(pt) && startpc < proto_bc(pt) + pt->sizebc);\r\n  ctx.lineno = lj_debug_line(pt, proto_bcpos(pt, startpc));\r\n  ctx.filename = proto_chunknamestr(pt);\r\n  if (*ctx.filename == '@' || *ctx.filename == '=')\r\n    ctx.filename++;\r\n  else\r\n    ctx.filename = \"(string)\";\r\n  gdbjit_buildobj(&ctx);\r\n  gdbjit_newentry(J->L, &ctx);\r\n}\r\n\r\n/* Delete debug info for trace and notify GDB. */\r\nvoid lj_gdbjit_deltrace(jit_State *J, GCtrace *T)\r\n{\r\n  GDBJITentryobj *eo = (GDBJITentryobj *)T->gdbjit_entry;\r\n  if (eo) {\r\n    if (eo->entry.prev_entry)\r\n      eo->entry.prev_entry->next_entry = eo->entry.next_entry;\r\n    else\r\n      __jit_debug_descriptor.first_entry = eo->entry.next_entry;\r\n    if (eo->entry.next_entry)\r\n      eo->entry.next_entry->prev_entry = eo->entry.prev_entry;\r\n    __jit_debug_descriptor.relevant_entry = &eo->entry;\r\n    __jit_debug_descriptor.action_flag = GDBJIT_UNREGISTER;\r\n    __jit_debug_register_code();\r\n    lj_mem_free(J2G(J), eo, eo->sz);\r\n  }\r\n}\r\n\r\n#endif\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_gdbjit.h",
    "content": "/*\r\n** Client for the GDB JIT API.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_GDBJIT_H\r\n#define _LJ_GDBJIT_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT && defined(LUAJIT_USE_GDBJIT)\r\n\r\nLJ_FUNC void lj_gdbjit_addtrace(jit_State *J, GCtrace *T);\r\nLJ_FUNC void lj_gdbjit_deltrace(jit_State *J, GCtrace *T);\r\n\r\n#else\r\n#define lj_gdbjit_addtrace(J, T)\tUNUSED(T)\r\n#define lj_gdbjit_deltrace(J, T)\tUNUSED(T)\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ir.c",
    "content": "/*\r\n** SSA IR (Intermediate Representation) emitter.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_ir_c\r\n#define LUA_CORE\r\n\r\n/* For pointers to libc/libm functions. */\r\n#include <stdio.h>\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lj_carith.h\"\r\n#endif\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t\t(&J->fold.ins)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)        (lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* -- IR tables ----------------------------------------------------------- */\r\n\r\n/* IR instruction modes. */\r\nLJ_DATADEF const uint8_t lj_ir_mode[IR__MAX+1] = {\r\nIRDEF(IRMODE)\r\n  0\r\n};\r\n\r\n/* IR type sizes. */\r\nLJ_DATADEF const uint8_t lj_ir_type_size[IRT__MAX+1] = {\r\n#define IRTSIZE(name, size)\tsize,\r\nIRTDEF(IRTSIZE)\r\n#undef IRTSIZE\r\n  0\r\n};\r\n\r\n/* C call info for CALL* instructions. */\r\nLJ_DATADEF const CCallInfo lj_ir_callinfo[] = {\r\n#define IRCALLCI(cond, name, nargs, kind, type, flags) \\\r\n  { (ASMFunction)IRCALLCOND_##cond(name), \\\r\n    (nargs)|(CCI_CALL_##kind)|(IRT_##type<<CCI_OTSHIFT)|(flags) },\r\nIRCALLDEF(IRCALLCI)\r\n#undef IRCALLCI\r\n  { NULL, 0 }\r\n};\r\n\r\n/* -- IR emitter ---------------------------------------------------------- */\r\n\r\n/* Grow IR buffer at the top. */\r\nvoid LJ_FASTCALL lj_ir_growtop(jit_State *J)\r\n{\r\n  IRIns *baseir = J->irbuf + J->irbotlim;\r\n  MSize szins = J->irtoplim - J->irbotlim;\r\n  if (szins) {\r\n    baseir = (IRIns *)lj_mem_realloc(J->L, baseir, szins*sizeof(IRIns),\r\n\t\t\t\t     2*szins*sizeof(IRIns));\r\n    J->irtoplim = J->irbotlim + 2*szins;\r\n  } else {\r\n    baseir = (IRIns *)lj_mem_realloc(J->L, NULL, 0, LJ_MIN_IRSZ*sizeof(IRIns));\r\n    J->irbotlim = REF_BASE - LJ_MIN_IRSZ/4;\r\n    J->irtoplim = J->irbotlim + LJ_MIN_IRSZ;\r\n  }\r\n  J->cur.ir = J->irbuf = baseir - J->irbotlim;\r\n}\r\n\r\n/* Grow IR buffer at the bottom or shift it up. */\r\nstatic void lj_ir_growbot(jit_State *J)\r\n{\r\n  IRIns *baseir = J->irbuf + J->irbotlim;\r\n  MSize szins = J->irtoplim - J->irbotlim;\r\n  lua_assert(szins != 0);\r\n  lua_assert(J->cur.nk == J->irbotlim);\r\n  if (J->cur.nins + (szins >> 1) < J->irtoplim) {\r\n    /* More than half of the buffer is free on top: shift up by a quarter. */\r\n    MSize ofs = szins >> 2;\r\n    memmove(baseir + ofs, baseir, (J->cur.nins - J->irbotlim)*sizeof(IRIns));\r\n    J->irbotlim -= ofs;\r\n    J->irtoplim -= ofs;\r\n    J->cur.ir = J->irbuf = baseir - J->irbotlim;\r\n  } else {\r\n    /* Double the buffer size, but split the growth amongst top/bottom. */\r\n    IRIns *newbase = lj_mem_newt(J->L, 2*szins*sizeof(IRIns), IRIns);\r\n    MSize ofs = szins >= 256 ? 128 : (szins >> 1);  /* Limit bottom growth. */\r\n    memcpy(newbase + ofs, baseir, (J->cur.nins - J->irbotlim)*sizeof(IRIns));\r\n    lj_mem_free(G(J->L), baseir, szins*sizeof(IRIns));\r\n    J->irbotlim -= ofs;\r\n    J->irtoplim = J->irbotlim + 2*szins;\r\n    J->cur.ir = J->irbuf = newbase - J->irbotlim;\r\n  }\r\n}\r\n\r\n/* Emit IR without any optimizations. */\r\nTRef LJ_FASTCALL lj_ir_emit(jit_State *J)\r\n{\r\n  IRRef ref = lj_ir_nextins(J);\r\n  IRIns *ir = IR(ref);\r\n  IROp op = fins->o;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\n  ir->o = op;\r\n  ir->op1 = fins->op1;\r\n  ir->op2 = fins->op2;\r\n  J->guardemit.irt |= fins->t.irt;\r\n  return TREF(ref, irt_t((ir->t = fins->t)));\r\n}\r\n\r\n/* Emit call to a C function. */\r\nTRef lj_ir_call(jit_State *J, IRCallID id, ...)\r\n{\r\n  const CCallInfo *ci = &lj_ir_callinfo[id];\r\n  uint32_t n = CCI_NARGS(ci);\r\n  TRef tr = TREF_NIL;\r\n  va_list argp;\r\n  va_start(argp, id);\r\n  if ((ci->flags & CCI_L)) n--;\r\n  if (n > 0)\r\n    tr = va_arg(argp, IRRef);\r\n  while (n-- > 1)\r\n    tr = emitir(IRT(IR_CARG, IRT_NIL), tr, va_arg(argp, IRRef));\r\n  va_end(argp);\r\n  if (CCI_OP(ci) == IR_CALLS)\r\n    J->needsnap = 1;  /* Need snapshot after call with side effect. */\r\n  return emitir(CCI_OPTYPE(ci), tr, id);\r\n}\r\n\r\n/* -- Interning of constants ---------------------------------------------- */\r\n\r\n/*\r\n** IR instructions for constants are kept between J->cur.nk >= ref < REF_BIAS.\r\n** They are chained like all other instructions, but grow downwards.\r\n** The are interned (like strings in the VM) to facilitate reference\r\n** comparisons. The same constant must get the same reference.\r\n*/\r\n\r\n/* Get ref of next IR constant and optionally grow IR.\r\n** Note: this may invalidate all IRIns *!\r\n*/\r\nstatic LJ_AINLINE IRRef ir_nextk(jit_State *J)\r\n{\r\n  IRRef ref = J->cur.nk;\r\n  if (LJ_UNLIKELY(ref <= J->irbotlim)) lj_ir_growbot(J);\r\n  J->cur.nk = --ref;\r\n  return ref;\r\n}\r\n\r\n/* Intern int32_t constant. */\r\nTRef LJ_FASTCALL lj_ir_kint(jit_State *J, int32_t k)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  for (ref = J->chain[IR_KINT]; ref; ref = cir[ref].prev)\r\n    if (cir[ref].i == k)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->i = k;\r\n  ir->t.irt = IRT_INT;\r\n  ir->o = IR_KINT;\r\n  ir->prev = J->chain[IR_KINT];\r\n  J->chain[IR_KINT] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_INT);\r\n}\r\n\r\n/* The MRef inside the KNUM/KINT64 IR instructions holds the address of the\r\n** 64 bit constant. The constants themselves are stored in a chained array\r\n** and shared across traces.\r\n**\r\n** Rationale for choosing this data structure:\r\n** - The address of the constants is embedded in the generated machine code\r\n**   and must never move. A resizable array or hash table wouldn't work.\r\n** - Most apps need very few non-32 bit integer constants (less than a dozen).\r\n** - Linear search is hard to beat in terms of speed and low complexity.\r\n*/\r\ntypedef struct K64Array {\r\n  MRef next;\t\t\t/* Pointer to next list. */\r\n  MSize numk;\t\t\t/* Number of used elements in this array. */\r\n  TValue k[LJ_MIN_K64SZ];\t/* Array of constants. */\r\n} K64Array;\r\n\r\n/* Free all chained arrays. */\r\nvoid lj_ir_k64_freeall(jit_State *J)\r\n{\r\n  K64Array *k;\r\n  for (k = mref(J->k64, K64Array); k; ) {\r\n    K64Array *next = mref(k->next, K64Array);\r\n    lj_mem_free(J2G(J), k, sizeof(K64Array));\r\n    k = next;\r\n  }\r\n}\r\n\r\n/* Find 64 bit constant in chained array or add it. */\r\ncTValue *lj_ir_k64_find(jit_State *J, uint64_t u64)\r\n{\r\n  K64Array *k, *kp = NULL;\r\n  TValue *ntv;\r\n  MSize idx;\r\n  /* Search for the constant in the whole chain of arrays. */\r\n  for (k = mref(J->k64, K64Array); k; k = mref(k->next, K64Array)) {\r\n    kp = k;  /* Remember previous element in list. */\r\n    for (idx = 0; idx < k->numk; idx++) {  /* Search one array. */\r\n      TValue *tv = &k->k[idx];\r\n      if (tv->u64 == u64)  /* Needed for +-0/NaN/absmask. */\r\n\treturn tv;\r\n    }\r\n  }\r\n  /* Constant was not found, need to add it. */\r\n  if (!(kp && kp->numk < LJ_MIN_K64SZ)) {  /* Allocate a new array. */\r\n    K64Array *kn = lj_mem_newt(J->L, sizeof(K64Array), K64Array);\r\n    setmref(kn->next, NULL);\r\n    kn->numk = 0;\r\n    if (kp)\r\n      setmref(kp->next, kn);  /* Chain to the end of the list. */\r\n    else\r\n      setmref(J->k64, kn);  /* Link first array. */\r\n    kp = kn;\r\n  }\r\n  ntv = &kp->k[kp->numk++];  /* Add to current array. */\r\n  ntv->u64 = u64;\r\n  return ntv;\r\n}\r\n\r\n/* Intern 64 bit constant, given by its address. */\r\nTRef lj_ir_k64(jit_State *J, IROp op, cTValue *tv)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  IRType t = op == IR_KNUM ? IRT_NUM : IRT_I64;\r\n  for (ref = J->chain[op]; ref; ref = cir[ref].prev)\r\n    if (ir_k64(&cir[ref]) == tv)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  lua_assert(checkptrGC(tv));\r\n  setmref(ir->ptr, tv);\r\n  ir->t.irt = t;\r\n  ir->o = op;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern FP constant, given by its 64 bit pattern. */\r\nTRef lj_ir_knum_u64(jit_State *J, uint64_t u64)\r\n{\r\n  return lj_ir_k64(J, IR_KNUM, lj_ir_k64_find(J, u64));\r\n}\r\n\r\n/* Intern 64 bit integer constant. */\r\nTRef lj_ir_kint64(jit_State *J, uint64_t u64)\r\n{\r\n  return lj_ir_k64(J, IR_KINT64, lj_ir_k64_find(J, u64));\r\n}\r\n\r\n/* Check whether a number is int and return it. -0 is NOT considered an int. */\r\nstatic int numistrueint(lua_Number n, int32_t *kp)\r\n{\r\n  int32_t k = lj_num2int(n);\r\n  if (n == (lua_Number)k) {\r\n    if (kp) *kp = k;\r\n    if (k == 0) {  /* Special check for -0. */\r\n      TValue tv;\r\n      setnumV(&tv, n);\r\n      if (tv.u32.hi != 0)\r\n\treturn 0;\r\n    }\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Intern number as int32_t constant if possible, otherwise as FP constant. */\r\nTRef lj_ir_knumint(jit_State *J, lua_Number n)\r\n{\r\n  int32_t k;\r\n  if (numistrueint(n, &k))\r\n    return lj_ir_kint(J, k);\r\n  else\r\n    return lj_ir_knum(J, n);\r\n}\r\n\r\n/* Intern GC object \"constant\". */\r\nTRef lj_ir_kgc(jit_State *J, GCobj *o, IRType t)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  lua_assert(!LJ_GC64);  /* TODO_GC64: major changes required. */\r\n  lua_assert(!isdead(J2G(J), o));\r\n  for (ref = J->chain[IR_KGC]; ref; ref = cir[ref].prev)\r\n    if (ir_kgc(&cir[ref]) == o)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  /* NOBARRIER: Current trace is a GC root. */\r\n  setgcref(ir->gcr, o);\r\n  ir->t.irt = (uint8_t)t;\r\n  ir->o = IR_KGC;\r\n  ir->prev = J->chain[IR_KGC];\r\n  J->chain[IR_KGC] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern 32 bit pointer constant. */\r\nTRef lj_ir_kptr_(jit_State *J, IROp op, void *ptr)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  lua_assert((void *)(intptr_t)i32ptr(ptr) == ptr);\r\n  for (ref = J->chain[op]; ref; ref = cir[ref].prev)\r\n    if (mref(cir[ref].ptr, void) == ptr)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  setmref(ir->ptr, ptr);\r\n  ir->t.irt = IRT_P32;\r\n  ir->o = op;\r\n  ir->prev = J->chain[op];\r\n  J->chain[op] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_P32);\r\n}\r\n\r\n/* Intern typed NULL constant. */\r\nTRef lj_ir_knull(jit_State *J, IRType t)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef ref;\r\n  for (ref = J->chain[IR_KNULL]; ref; ref = cir[ref].prev)\r\n    if (irt_t(cir[ref].t) == t)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->i = 0;\r\n  ir->t.irt = (uint8_t)t;\r\n  ir->o = IR_KNULL;\r\n  ir->prev = J->chain[IR_KNULL];\r\n  J->chain[IR_KNULL] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, t);\r\n}\r\n\r\n/* Intern key slot. */\r\nTRef lj_ir_kslot(jit_State *J, TRef key, IRRef slot)\r\n{\r\n  IRIns *ir, *cir = J->cur.ir;\r\n  IRRef2 op12 = IRREF2((IRRef1)key, (IRRef1)slot);\r\n  IRRef ref;\r\n  /* Const part is not touched by CSE/DCE, so 0-65535 is ok for IRMlit here. */\r\n  lua_assert(tref_isk(key) && slot == (IRRef)(IRRef1)slot);\r\n  for (ref = J->chain[IR_KSLOT]; ref; ref = cir[ref].prev)\r\n    if (cir[ref].op12 == op12)\r\n      goto found;\r\n  ref = ir_nextk(J);\r\n  ir = IR(ref);\r\n  ir->op12 = op12;\r\n  ir->t.irt = IRT_P32;\r\n  ir->o = IR_KSLOT;\r\n  ir->prev = J->chain[IR_KSLOT];\r\n  J->chain[IR_KSLOT] = (IRRef1)ref;\r\nfound:\r\n  return TREF(ref, IRT_P32);\r\n}\r\n\r\n/* -- Access to IR constants ---------------------------------------------- */\r\n\r\n/* Copy value of IR constant. */\r\nvoid lj_ir_kvalue(lua_State *L, TValue *tv, const IRIns *ir)\r\n{\r\n  UNUSED(L);\r\n  lua_assert(ir->o != IR_KSLOT);  /* Common mistake. */\r\n  switch (ir->o) {\r\n  case IR_KPRI: setpriV(tv, irt_toitype(ir->t)); break;\r\n  case IR_KINT: setintV(tv, ir->i); break;\r\n  case IR_KGC: setgcV(L, tv, ir_kgc(ir), irt_toitype(ir->t)); break;\r\n  case IR_KPTR: case IR_KKPTR: case IR_KNULL:\r\n    setlightudV(tv, mref(ir->ptr, void));\r\n    break;\r\n  case IR_KNUM: setnumV(tv, ir_knum(ir)->n); break;\r\n#if LJ_HASFFI\r\n  case IR_KINT64: {\r\n    GCcdata *cd = lj_cdata_new_(L, CTID_INT64, 8);\r\n    *(uint64_t *)cdataptr(cd) = ir_kint64(ir)->u64;\r\n    setcdataV(L, tv, cd);\r\n    break;\r\n    }\r\n#endif\r\n  default: lua_assert(0); break;\r\n  }\r\n}\r\n\r\n/* -- Convert IR operand types -------------------------------------------- */\r\n\r\n/* Convert from string to number. */\r\nTRef LJ_FASTCALL lj_ir_tonumber(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isnumber(tr)) {\r\n    if (tref_isstr(tr))\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    else\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Convert from integer or string to number. */\r\nTRef LJ_FASTCALL lj_ir_tonum(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isnum(tr)) {\r\n    if (tref_isinteger(tr))\r\n      tr = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n    else if (tref_isstr(tr))\r\n      tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n    else\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Convert from integer or number to string. */\r\nTRef LJ_FASTCALL lj_ir_tostr(jit_State *J, TRef tr)\r\n{\r\n  if (!tref_isstr(tr)) {\r\n    if (!tref_isnumber(tr))\r\n      lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n    tr = emitir(IRT(IR_TOSTR, IRT_STR), tr,\r\n\t\ttref_isnum(tr) ? IRTOSTR_NUM : IRTOSTR_INT);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* -- Miscellaneous IR ops ------------------------------------------------ */\r\n\r\n/* Evaluate numeric comparison. */\r\nint lj_ir_numcmp(lua_Number a, lua_Number b, IROp op)\r\n{\r\n  switch (op) {\r\n  case IR_EQ: return (a == b);\r\n  case IR_NE: return (a != b);\r\n  case IR_LT: return (a < b);\r\n  case IR_GE: return (a >= b);\r\n  case IR_LE: return (a <= b);\r\n  case IR_GT: return (a > b);\r\n  case IR_ULT: return !(a >= b);\r\n  case IR_UGE: return !(a < b);\r\n  case IR_ULE: return !(a > b);\r\n  case IR_UGT: return !(a <= b);\r\n  default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n/* Evaluate string comparison. */\r\nint lj_ir_strcmp(GCstr *a, GCstr *b, IROp op)\r\n{\r\n  int res = lj_str_cmp(a, b);\r\n  switch (op) {\r\n  case IR_LT: return (res < 0);\r\n  case IR_GE: return (res >= 0);\r\n  case IR_LE: return (res <= 0);\r\n  case IR_GT: return (res > 0);\r\n  default: lua_assert(0); return 0;\r\n  }\r\n}\r\n\r\n/* Rollback IR to previous state. */\r\nvoid lj_ir_rollback(jit_State *J, IRRef ref)\r\n{\r\n  IRRef nins = J->cur.nins;\r\n  while (nins > ref) {\r\n    IRIns *ir;\r\n    nins--;\r\n    ir = IR(nins);\r\n    J->chain[ir->o] = ir->prev;\r\n  }\r\n  J->cur.nins = nins;\r\n}\r\n\r\n#undef IR\r\n#undef fins\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ir.h",
    "content": "/*\r\n** SSA IR (Intermediate Representation) format.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IR_H\r\n#define _LJ_IR_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* -- IR instructions ----------------------------------------------------- */\r\n\r\n/* IR instruction definition. Order matters, see below. ORDER IR */\r\n#define IRDEF(_) \\\r\n  /* Guarded assertions. */ \\\r\n  /* Must be properly aligned to flip opposites (^1) and (un)ordered (^4). */ \\\r\n  _(LT,\t\tN , ref, ref) \\\r\n  _(GE,\t\tN , ref, ref) \\\r\n  _(LE,\t\tN , ref, ref) \\\r\n  _(GT,\t\tN , ref, ref) \\\r\n  \\\r\n  _(ULT,\tN , ref, ref) \\\r\n  _(UGE,\tN , ref, ref) \\\r\n  _(ULE,\tN , ref, ref) \\\r\n  _(UGT,\tN , ref, ref) \\\r\n  \\\r\n  _(EQ,\t\tC , ref, ref) \\\r\n  _(NE,\t\tC , ref, ref) \\\r\n  \\\r\n  _(ABC,\tN , ref, ref) \\\r\n  _(RETF,\tS , ref, ref) \\\r\n  \\\r\n  /* Miscellaneous ops. */ \\\r\n  _(NOP,\tN , ___, ___) \\\r\n  _(BASE,\tN , lit, lit) \\\r\n  _(PVAL,\tN , lit, ___) \\\r\n  _(GCSTEP,\tS , ___, ___) \\\r\n  _(HIOP,\tS , ref, ref) \\\r\n  _(LOOP,\tS , ___, ___) \\\r\n  _(USE,\tS , ref, ___) \\\r\n  _(PHI,\tS , ref, ref) \\\r\n  _(RENAME,\tS , ref, lit) \\\r\n  _(PROF,\tS , ___, ___) \\\r\n  \\\r\n  /* Constants. */ \\\r\n  _(KPRI,\tN , ___, ___) \\\r\n  _(KINT,\tN , cst, ___) \\\r\n  _(KGC,\tN , cst, ___) \\\r\n  _(KPTR,\tN , cst, ___) \\\r\n  _(KKPTR,\tN , cst, ___) \\\r\n  _(KNULL,\tN , cst, ___) \\\r\n  _(KNUM,\tN , cst, ___) \\\r\n  _(KINT64,\tN , cst, ___) \\\r\n  _(KSLOT,\tN , ref, lit) \\\r\n  \\\r\n  /* Bit ops. */ \\\r\n  _(BNOT,\tN , ref, ___) \\\r\n  _(BSWAP,\tN , ref, ___) \\\r\n  _(BAND,\tC , ref, ref) \\\r\n  _(BOR,\tC , ref, ref) \\\r\n  _(BXOR,\tC , ref, ref) \\\r\n  _(BSHL,\tN , ref, ref) \\\r\n  _(BSHR,\tN , ref, ref) \\\r\n  _(BSAR,\tN , ref, ref) \\\r\n  _(BROL,\tN , ref, ref) \\\r\n  _(BROR,\tN , ref, ref) \\\r\n  \\\r\n  /* Arithmetic ops. ORDER ARITH */ \\\r\n  _(ADD,\tC , ref, ref) \\\r\n  _(SUB,\tN , ref, ref) \\\r\n  _(MUL,\tC , ref, ref) \\\r\n  _(DIV,\tN , ref, ref) \\\r\n  _(MOD,\tN , ref, ref) \\\r\n  _(POW,\tN , ref, ref) \\\r\n  _(NEG,\tN , ref, ref) \\\r\n  \\\r\n  _(ABS,\tN , ref, ref) \\\r\n  _(ATAN2,\tN , ref, ref) \\\r\n  _(LDEXP,\tN , ref, ref) \\\r\n  _(MIN,\tC , ref, ref) \\\r\n  _(MAX,\tC , ref, ref) \\\r\n  _(FPMATH,\tN , ref, lit) \\\r\n  \\\r\n  /* Overflow-checking arithmetic ops. */ \\\r\n  _(ADDOV,\tCW, ref, ref) \\\r\n  _(SUBOV,\tNW, ref, ref) \\\r\n  _(MULOV,\tCW, ref, ref) \\\r\n  \\\r\n  /* Memory ops. A = array, H = hash, U = upvalue, F = field, S = stack. */ \\\r\n  \\\r\n  /* Memory references. */ \\\r\n  _(AREF,\tR , ref, ref) \\\r\n  _(HREFK,\tR , ref, ref) \\\r\n  _(HREF,\tL , ref, ref) \\\r\n  _(NEWREF,\tS , ref, ref) \\\r\n  _(UREFO,\tLW, ref, lit) \\\r\n  _(UREFC,\tLW, ref, lit) \\\r\n  _(FREF,\tR , ref, lit) \\\r\n  _(STRREF,\tN , ref, ref) \\\r\n  _(LREF,\tL , ___, ___) \\\r\n  \\\r\n  /* Loads and Stores. These must be in the same order. */ \\\r\n  _(ALOAD,\tL , ref, ___) \\\r\n  _(HLOAD,\tL , ref, ___) \\\r\n  _(ULOAD,\tL , ref, ___) \\\r\n  _(FLOAD,\tL , ref, lit) \\\r\n  _(XLOAD,\tL , ref, lit) \\\r\n  _(SLOAD,\tL , lit, lit) \\\r\n  _(VLOAD,\tL , ref, ___) \\\r\n  \\\r\n  _(ASTORE,\tS , ref, ref) \\\r\n  _(HSTORE,\tS , ref, ref) \\\r\n  _(USTORE,\tS , ref, ref) \\\r\n  _(FSTORE,\tS , ref, ref) \\\r\n  _(XSTORE,\tS , ref, ref) \\\r\n  \\\r\n  /* Allocations. */ \\\r\n  _(SNEW,\tN , ref, ref)  /* CSE is ok, not marked as A. */ \\\r\n  _(XSNEW,\tA , ref, ref) \\\r\n  _(TNEW,\tAW, lit, lit) \\\r\n  _(TDUP,\tAW, ref, ___) \\\r\n  _(CNEW,\tAW, ref, ref) \\\r\n  _(CNEWI,\tNW, ref, ref)  /* CSE is ok, not marked as A. */ \\\r\n  \\\r\n  /* Buffer operations. */ \\\r\n  _(BUFHDR,\tL , ref, lit) \\\r\n  _(BUFPUT,\tL , ref, ref) \\\r\n  _(BUFSTR,\tA , ref, ref) \\\r\n  \\\r\n  /* Barriers. */ \\\r\n  _(TBAR,\tS , ref, ___) \\\r\n  _(OBAR,\tS , ref, ref) \\\r\n  _(XBAR,\tS , ___, ___) \\\r\n  \\\r\n  /* Type conversions. */ \\\r\n  _(CONV,\tNW, ref, lit) \\\r\n  _(TOBIT,\tN , ref, ref) \\\r\n  _(TOSTR,\tN , ref, lit) \\\r\n  _(STRTO,\tN , ref, ___) \\\r\n  \\\r\n  /* Calls. */ \\\r\n  _(CALLN,\tN , ref, lit) \\\r\n  _(CALLA,\tA , ref, lit) \\\r\n  _(CALLL,\tL , ref, lit) \\\r\n  _(CALLS,\tS , ref, lit) \\\r\n  _(CALLXS,\tS , ref, ref) \\\r\n  _(CARG,\tN , ref, ref) \\\r\n  \\\r\n  /* End of list. */\r\n\r\n/* IR opcodes (max. 256). */\r\ntypedef enum {\r\n#define IRENUM(name, m, m1, m2)\tIR_##name,\r\nIRDEF(IRENUM)\r\n#undef IRENUM\r\n  IR__MAX\r\n} IROp;\r\n\r\n/* Stored opcode. */\r\ntypedef uint8_t IROp1;\r\n\r\nLJ_STATIC_ASSERT(((int)IR_EQ^1) == (int)IR_NE);\r\nLJ_STATIC_ASSERT(((int)IR_LT^1) == (int)IR_GE);\r\nLJ_STATIC_ASSERT(((int)IR_LE^1) == (int)IR_GT);\r\nLJ_STATIC_ASSERT(((int)IR_LT^3) == (int)IR_GT);\r\nLJ_STATIC_ASSERT(((int)IR_LT^4) == (int)IR_ULT);\r\n\r\n/* Delta between xLOAD and xSTORE. */\r\n#define IRDELTA_L2S\t\t((int)IR_ASTORE - (int)IR_ALOAD)\r\n\r\nLJ_STATIC_ASSERT((int)IR_HLOAD + IRDELTA_L2S == (int)IR_HSTORE);\r\nLJ_STATIC_ASSERT((int)IR_ULOAD + IRDELTA_L2S == (int)IR_USTORE);\r\nLJ_STATIC_ASSERT((int)IR_FLOAD + IRDELTA_L2S == (int)IR_FSTORE);\r\nLJ_STATIC_ASSERT((int)IR_XLOAD + IRDELTA_L2S == (int)IR_XSTORE);\r\n\r\n/* -- Named IR literals --------------------------------------------------- */\r\n\r\n/* FPMATH sub-functions. ORDER FPM. */\r\n#define IRFPMDEF(_) \\\r\n  _(FLOOR) _(CEIL) _(TRUNC)  /* Must be first and in this order. */ \\\r\n  _(SQRT) _(EXP) _(EXP2) _(LOG) _(LOG2) _(LOG10) \\\r\n  _(SIN) _(COS) _(TAN) \\\r\n  _(OTHER)\r\n\r\ntypedef enum {\r\n#define FPMENUM(name)\t\tIRFPM_##name,\r\nIRFPMDEF(FPMENUM)\r\n#undef FPMENUM\r\n  IRFPM__MAX\r\n} IRFPMathOp;\r\n\r\n/* FLOAD fields. */\r\n#define IRFLDEF(_) \\\r\n  _(STR_LEN,\toffsetof(GCstr, len)) \\\r\n  _(FUNC_ENV,\toffsetof(GCfunc, l.env)) \\\r\n  _(FUNC_PC,\toffsetof(GCfunc, l.pc)) \\\r\n  _(FUNC_FFID,\toffsetof(GCfunc, l.ffid)) \\\r\n  _(THREAD_ENV,\toffsetof(lua_State, env)) \\\r\n  _(TAB_META,\toffsetof(GCtab, metatable)) \\\r\n  _(TAB_ARRAY,\toffsetof(GCtab, array)) \\\r\n  _(TAB_NODE,\toffsetof(GCtab, node)) \\\r\n  _(TAB_ASIZE,\toffsetof(GCtab, asize)) \\\r\n  _(TAB_HMASK,\toffsetof(GCtab, hmask)) \\\r\n  _(TAB_NOMM,\toffsetof(GCtab, nomm)) \\\r\n  _(UDATA_META,\toffsetof(GCudata, metatable)) \\\r\n  _(UDATA_UDTYPE, offsetof(GCudata, udtype)) \\\r\n  _(UDATA_FILE,\tsizeof(GCudata)) \\\r\n  _(CDATA_CTYPEID, offsetof(GCcdata, ctypeid)) \\\r\n  _(CDATA_PTR,\tsizeof(GCcdata)) \\\r\n  _(CDATA_INT, sizeof(GCcdata)) \\\r\n  _(CDATA_INT64, sizeof(GCcdata)) \\\r\n  _(CDATA_INT64_4, sizeof(GCcdata) + 4)\r\n\r\ntypedef enum {\r\n#define FLENUM(name, ofs)\tIRFL_##name,\r\nIRFLDEF(FLENUM)\r\n#undef FLENUM\r\n  IRFL__MAX\r\n} IRFieldID;\r\n\r\n/* SLOAD mode bits, stored in op2. */\r\n#define IRSLOAD_PARENT\t\t0x01\t/* Coalesce with parent trace. */\r\n#define IRSLOAD_FRAME\t\t0x02\t/* Load hiword of frame. */\r\n#define IRSLOAD_TYPECHECK\t0x04\t/* Needs type check. */\r\n#define IRSLOAD_CONVERT\t\t0x08\t/* Number to integer conversion. */\r\n#define IRSLOAD_READONLY\t0x10\t/* Read-only, omit slot store. */\r\n#define IRSLOAD_INHERIT\t\t0x20\t/* Inherited by exits/side traces. */\r\n\r\n/* XLOAD mode, stored in op2. */\r\n#define IRXLOAD_READONLY\t1\t/* Load from read-only data. */\r\n#define IRXLOAD_VOLATILE\t2\t/* Load from volatile data. */\r\n#define IRXLOAD_UNALIGNED\t4\t/* Unaligned load. */\r\n\r\n/* BUFHDR mode, stored in op2. */\r\n#define IRBUFHDR_RESET\t\t0\t/* Reset buffer. */\r\n#define IRBUFHDR_APPEND\t\t1\t/* Append to buffer. */\r\n\r\n/* CONV mode, stored in op2. */\r\n#define IRCONV_SRCMASK\t\t0x001f\t/* Source IRType. */\r\n#define IRCONV_DSTMASK\t\t0x03e0\t/* Dest. IRType (also in ir->t). */\r\n#define IRCONV_DSH\t\t5\r\n#define IRCONV_NUM_INT\t\t((IRT_NUM<<IRCONV_DSH)|IRT_INT)\r\n#define IRCONV_INT_NUM\t\t((IRT_INT<<IRCONV_DSH)|IRT_NUM)\r\n#define IRCONV_SEXT\t\t0x0800\t/* Sign-extend integer to integer. */\r\n#define IRCONV_MODEMASK\t\t0x0fff\r\n#define IRCONV_CONVMASK\t\t0xf000\r\n#define IRCONV_CSH\t\t12\r\n/* Number to integer conversion mode. Ordered by strength of the checks. */\r\n#define IRCONV_TOBIT  (0<<IRCONV_CSH)\t/* None. Cache only: TOBIT conv. */\r\n#define IRCONV_ANY    (1<<IRCONV_CSH)\t/* Any FP number is ok. */\r\n#define IRCONV_INDEX  (2<<IRCONV_CSH)\t/* Check + special backprop rules. */\r\n#define IRCONV_CHECK  (3<<IRCONV_CSH)\t/* Number checked for integerness. */\r\n\r\n/* TOSTR mode, stored in op2. */\r\n#define IRTOSTR_INT\t\t0\t/* Convert integer to string. */\r\n#define IRTOSTR_NUM\t\t1\t/* Convert number to string. */\r\n#define IRTOSTR_CHAR\t\t2\t/* Convert char value to string. */\r\n\r\n/* -- IR operands --------------------------------------------------------- */\r\n\r\n/* IR operand mode (2 bit). */\r\ntypedef enum {\r\n  IRMref,\t\t/* IR reference. */\r\n  IRMlit,\t\t/* 16 bit unsigned literal. */\r\n  IRMcst,\t\t/* Constant literal: i, gcr or ptr. */\r\n  IRMnone\t\t/* Unused operand. */\r\n} IRMode;\r\n#define IRM___\t\tIRMnone\r\n\r\n/* Mode bits: Commutative, {Normal/Ref, Alloc, Load, Store}, Non-weak guard. */\r\n#define IRM_C\t\t\t0x10\r\n\r\n#define IRM_N\t\t\t0x00\r\n#define IRM_R\t\t\tIRM_N\r\n#define IRM_A\t\t\t0x20\r\n#define IRM_L\t\t\t0x40\r\n#define IRM_S\t\t\t0x60\r\n\r\n#define IRM_W\t\t\t0x80\r\n\r\n#define IRM_NW\t\t\t(IRM_N|IRM_W)\r\n#define IRM_CW\t\t\t(IRM_C|IRM_W)\r\n#define IRM_AW\t\t\t(IRM_A|IRM_W)\r\n#define IRM_LW\t\t\t(IRM_L|IRM_W)\r\n\r\n#define irm_op1(m)\t\t((IRMode)((m)&3))\r\n#define irm_op2(m)\t\t((IRMode)(((m)>>2)&3))\r\n#define irm_iscomm(m)\t\t((m) & IRM_C)\r\n#define irm_kind(m)\t\t((m) & IRM_S)\r\n\r\n#define IRMODE(name, m, m1, m2)\t(((IRM##m1)|((IRM##m2)<<2)|(IRM_##m))^IRM_W),\r\n\r\nLJ_DATA const uint8_t lj_ir_mode[IR__MAX+1];\r\n\r\n/* -- IR instruction types ------------------------------------------------ */\r\n\r\n/* Map of itypes to non-negative numbers. ORDER LJ_T.\r\n** LJ_TUPVAL/LJ_TTRACE never appear in a TValue. Use these itypes for\r\n** IRT_P32 and IRT_P64, which never escape the IR.\r\n** The various integers are only used in the IR and can only escape to\r\n** a TValue after implicit or explicit conversion. Their types must be\r\n** contiguous and next to IRT_NUM (see the typerange macros below).\r\n*/\r\n#define IRTDEF(_) \\\r\n  _(NIL, 4) _(FALSE, 4) _(TRUE, 4) _(LIGHTUD, LJ_64 ? 8 : 4) _(STR, 4) \\\r\n  _(P32, 4) _(THREAD, 4) _(PROTO, 4) _(FUNC, 4) _(P64, 8) _(CDATA, 4) \\\r\n  _(TAB, 4) _(UDATA, 4) \\\r\n  _(FLOAT, 4) _(NUM, 8) _(I8, 1) _(U8, 1) _(I16, 2) _(U16, 2) \\\r\n  _(INT, 4) _(U32, 4) _(I64, 8) _(U64, 8) \\\r\n  _(SOFTFP, 4)  /* There is room for 9 more types. */\r\n\r\n/* IR result type and flags (8 bit). */\r\ntypedef enum {\r\n#define IRTENUM(name, size)\tIRT_##name,\r\nIRTDEF(IRTENUM)\r\n#undef IRTENUM\r\n  IRT__MAX,\r\n\r\n  /* Native pointer type and the corresponding integer type. */\r\n  IRT_PTR = LJ_64 ? IRT_P64 : IRT_P32,\r\n  IRT_INTP = LJ_64 ? IRT_I64 : IRT_INT,\r\n  IRT_UINTP = LJ_64 ? IRT_U64 : IRT_U32,\r\n  /* TODO_GC64: major changes required for all uses of IRT_P32. */\r\n\r\n  /* Additional flags. */\r\n  IRT_MARK = 0x20,\t/* Marker for misc. purposes. */\r\n  IRT_ISPHI = 0x40,\t/* Instruction is left or right PHI operand. */\r\n  IRT_GUARD = 0x80,\t/* Instruction is a guard. */\r\n\r\n  /* Masks. */\r\n  IRT_TYPE = 0x1f,\r\n  IRT_T = 0xff\r\n} IRType;\r\n\r\n#define irtype_ispri(irt)\t((uint32_t)(irt) <= IRT_TRUE)\r\n\r\n/* Stored IRType. */\r\ntypedef struct IRType1 { uint8_t irt; } IRType1;\r\n\r\n#define IRT(o, t)\t\t((uint32_t)(((o)<<8) | (t)))\r\n#define IRTI(o)\t\t\t(IRT((o), IRT_INT))\r\n#define IRTN(o)\t\t\t(IRT((o), IRT_NUM))\r\n#define IRTG(o, t)\t\t(IRT((o), IRT_GUARD|(t)))\r\n#define IRTGI(o)\t\t(IRT((o), IRT_GUARD|IRT_INT))\r\n\r\n#define irt_t(t)\t\t((IRType)(t).irt)\r\n#define irt_type(t)\t\t((IRType)((t).irt & IRT_TYPE))\r\n#define irt_sametype(t1, t2)\t((((t1).irt ^ (t2).irt) & IRT_TYPE) == 0)\r\n#define irt_typerange(t, first, last) \\\r\n  ((uint32_t)((t).irt & IRT_TYPE) - (uint32_t)(first) <= (uint32_t)(last-first))\r\n\r\n#define irt_isnil(t)\t\t(irt_type(t) == IRT_NIL)\r\n#define irt_ispri(t)\t\t((uint32_t)irt_type(t) <= IRT_TRUE)\r\n#define irt_islightud(t)\t(irt_type(t) == IRT_LIGHTUD)\r\n#define irt_isstr(t)\t\t(irt_type(t) == IRT_STR)\r\n#define irt_istab(t)\t\t(irt_type(t) == IRT_TAB)\r\n#define irt_iscdata(t)\t\t(irt_type(t) == IRT_CDATA)\r\n#define irt_isfloat(t)\t\t(irt_type(t) == IRT_FLOAT)\r\n#define irt_isnum(t)\t\t(irt_type(t) == IRT_NUM)\r\n#define irt_isint(t)\t\t(irt_type(t) == IRT_INT)\r\n#define irt_isi8(t)\t\t(irt_type(t) == IRT_I8)\r\n#define irt_isu8(t)\t\t(irt_type(t) == IRT_U8)\r\n#define irt_isi16(t)\t\t(irt_type(t) == IRT_I16)\r\n#define irt_isu16(t)\t\t(irt_type(t) == IRT_U16)\r\n#define irt_isu32(t)\t\t(irt_type(t) == IRT_U32)\r\n#define irt_isi64(t)\t\t(irt_type(t) == IRT_I64)\r\n#define irt_isu64(t)\t\t(irt_type(t) == IRT_U64)\r\n\r\n#define irt_isfp(t)\t\t(irt_isnum(t) || irt_isfloat(t))\r\n#define irt_isinteger(t)\t(irt_typerange((t), IRT_I8, IRT_INT))\r\n#define irt_isgcv(t)\t\t(irt_typerange((t), IRT_STR, IRT_UDATA))\r\n#define irt_isaddr(t)\t\t(irt_typerange((t), IRT_LIGHTUD, IRT_UDATA))\r\n#define irt_isint64(t)\t\t(irt_typerange((t), IRT_I64, IRT_U64))\r\n\r\n#if LJ_GC64\r\n#define IRT_IS64 \\\r\n  ((1u<<IRT_NUM)|(1u<<IRT_I64)|(1u<<IRT_U64)|(1u<<IRT_P64)|\\\r\n   (1u<<IRT_LIGHTUD)|(1u<<IRT_STR)|(1u<<IRT_THREAD)|(1u<<IRT_PROTO)|\\\r\n   (1u<<IRT_FUNC)|(1u<<IRT_CDATA)|(1u<<IRT_TAB)|(1u<<IRT_UDATA))\r\n#elif LJ_64\r\n#define IRT_IS64 \\\r\n  ((1u<<IRT_NUM)|(1u<<IRT_I64)|(1u<<IRT_U64)|(1u<<IRT_P64)|(1u<<IRT_LIGHTUD))\r\n#else\r\n#define IRT_IS64 \\\r\n  ((1u<<IRT_NUM)|(1u<<IRT_I64)|(1u<<IRT_U64))\r\n#endif\r\n\r\n#define irt_is64(t)\t\t((IRT_IS64 >> irt_type(t)) & 1)\r\n#define irt_is64orfp(t)\t\t(((IRT_IS64|(1u<<IRT_FLOAT))>>irt_type(t)) & 1)\r\n\r\n#define irt_size(t)\t\t(lj_ir_type_size[irt_t((t))])\r\n\r\nLJ_DATA const uint8_t lj_ir_type_size[];\r\n\r\nstatic LJ_AINLINE IRType itype2irt(const TValue *tv)\r\n{\r\n  if (tvisint(tv))\r\n    return IRT_INT;\r\n  else if (tvisnum(tv))\r\n    return IRT_NUM;\r\n#if LJ_64 && !LJ_GC64\r\n  else if (tvislightud(tv))\r\n    return IRT_LIGHTUD;\r\n#endif\r\n  else\r\n    return (IRType)~itype(tv);\r\n}\r\n\r\nstatic LJ_AINLINE uint32_t irt_toitype_(IRType t)\r\n{\r\n  lua_assert(!LJ_64 || t != IRT_LIGHTUD);\r\n  if (LJ_DUALNUM && t > IRT_NUM) {\r\n    return LJ_TISNUM;\r\n  } else {\r\n    lua_assert(t <= IRT_NUM);\r\n    return ~(uint32_t)t;\r\n  }\r\n}\r\n\r\n#define irt_toitype(t)\t\tirt_toitype_(irt_type((t)))\r\n\r\n#define irt_isguard(t)\t\t((t).irt & IRT_GUARD)\r\n#define irt_ismarked(t)\t\t((t).irt & IRT_MARK)\r\n#define irt_setmark(t)\t\t((t).irt |= IRT_MARK)\r\n#define irt_clearmark(t)\t((t).irt &= ~IRT_MARK)\r\n#define irt_isphi(t)\t\t((t).irt & IRT_ISPHI)\r\n#define irt_setphi(t)\t\t((t).irt |= IRT_ISPHI)\r\n#define irt_clearphi(t)\t\t((t).irt &= ~IRT_ISPHI)\r\n\r\n/* Stored combined IR opcode and type. */\r\ntypedef uint16_t IROpT;\r\n\r\n/* -- IR references ------------------------------------------------------- */\r\n\r\n/* IR references. */\r\ntypedef uint16_t IRRef1;\t/* One stored reference. */\r\ntypedef uint32_t IRRef2;\t/* Two stored references. */\r\ntypedef uint32_t IRRef;\t\t/* Used to pass around references. */\r\n\r\n/* Fixed references. */\r\nenum {\r\n  REF_BIAS =\t0x8000,\r\n  REF_TRUE =\tREF_BIAS-3,\r\n  REF_FALSE =\tREF_BIAS-2,\r\n  REF_NIL =\tREF_BIAS-1,\t/* \\--- Constants grow downwards. */\r\n  REF_BASE =\tREF_BIAS,\t/* /--- IR grows upwards. */\r\n  REF_FIRST =\tREF_BIAS+1,\r\n  REF_DROP =\t0xffff\r\n};\r\n\r\n/* Note: IRMlit operands must be < REF_BIAS, too!\r\n** This allows for fast and uniform manipulation of all operands\r\n** without looking up the operand mode in lj_ir_mode:\r\n** - CSE calculates the maximum reference of two operands.\r\n**   This must work with mixed reference/literal operands, too.\r\n** - DCE marking only checks for operand >= REF_BIAS.\r\n** - LOOP needs to substitute reference operands.\r\n**   Constant references and literals must not be modified.\r\n*/\r\n\r\n#define IRREF2(lo, hi)\t\t((IRRef2)(lo) | ((IRRef2)(hi) << 16))\r\n\r\n#define irref_isk(ref)\t\t((ref) < REF_BIAS)\r\n\r\n/* Tagged IR references (32 bit).\r\n**\r\n** +-------+-------+---------------+\r\n** |  irt  | flags |      ref      |\r\n** +-------+-------+---------------+\r\n**\r\n** The tag holds a copy of the IRType and speeds up IR type checks.\r\n*/\r\ntypedef uint32_t TRef;\r\n\r\n#define TREF_REFMASK\t\t0x0000ffff\r\n#define TREF_FRAME\t\t0x00010000\r\n#define TREF_CONT\t\t0x00020000\r\n\r\n#define TREF(ref, t)\t\t((TRef)((ref) + ((t)<<24)))\r\n\r\n#define tref_ref(tr)\t\t((IRRef1)(tr))\r\n#define tref_t(tr)\t\t((IRType)((tr)>>24))\r\n#define tref_type(tr)\t\t((IRType)(((tr)>>24) & IRT_TYPE))\r\n#define tref_typerange(tr, first, last) \\\r\n  ((((tr)>>24) & IRT_TYPE) - (TRef)(first) <= (TRef)(last-first))\r\n\r\n#define tref_istype(tr, t)\t(((tr) & (IRT_TYPE<<24)) == ((t)<<24))\r\n#define tref_isnil(tr)\t\t(tref_istype((tr), IRT_NIL))\r\n#define tref_isfalse(tr)\t(tref_istype((tr), IRT_FALSE))\r\n#define tref_istrue(tr)\t\t(tref_istype((tr), IRT_TRUE))\r\n#define tref_islightud(tr)\t(tref_istype((tr), IRT_LIGHTUD))\r\n#define tref_isstr(tr)\t\t(tref_istype((tr), IRT_STR))\r\n#define tref_isfunc(tr)\t\t(tref_istype((tr), IRT_FUNC))\r\n#define tref_iscdata(tr)\t(tref_istype((tr), IRT_CDATA))\r\n#define tref_istab(tr)\t\t(tref_istype((tr), IRT_TAB))\r\n#define tref_isudata(tr)\t(tref_istype((tr), IRT_UDATA))\r\n#define tref_isnum(tr)\t\t(tref_istype((tr), IRT_NUM))\r\n#define tref_isint(tr)\t\t(tref_istype((tr), IRT_INT))\r\n\r\n#define tref_isbool(tr)\t\t(tref_typerange((tr), IRT_FALSE, IRT_TRUE))\r\n#define tref_ispri(tr)\t\t(tref_typerange((tr), IRT_NIL, IRT_TRUE))\r\n#define tref_istruecond(tr)\t(!tref_typerange((tr), IRT_NIL, IRT_FALSE))\r\n#define tref_isinteger(tr)\t(tref_typerange((tr), IRT_I8, IRT_INT))\r\n#define tref_isnumber(tr)\t(tref_typerange((tr), IRT_NUM, IRT_INT))\r\n#define tref_isnumber_str(tr)\t(tref_isnumber((tr)) || tref_isstr((tr)))\r\n#define tref_isgcv(tr)\t\t(tref_typerange((tr), IRT_STR, IRT_UDATA))\r\n\r\n#define tref_isk(tr)\t\t(irref_isk(tref_ref((tr))))\r\n#define tref_isk2(tr1, tr2)\t(irref_isk(tref_ref((tr1) | (tr2))))\r\n\r\n#define TREF_PRI(t)\t\t(TREF(REF_NIL-(t), (t)))\r\n#define TREF_NIL\t\t(TREF_PRI(IRT_NIL))\r\n#define TREF_FALSE\t\t(TREF_PRI(IRT_FALSE))\r\n#define TREF_TRUE\t\t(TREF_PRI(IRT_TRUE))\r\n\r\n/* -- IR format ----------------------------------------------------------- */\r\n\r\n/* IR instruction format (64 bit).\r\n**\r\n**    16      16     8   8   8   8\r\n** +-------+-------+---+---+---+---+\r\n** |  op1  |  op2  | t | o | r | s |\r\n** +-------+-------+---+---+---+---+\r\n** |  op12/i/gco   |   ot  | prev  | (alternative fields in union)\r\n** +---------------+-------+-------+\r\n**        32           16      16\r\n**\r\n** prev is only valid prior to register allocation and then reused for r + s.\r\n*/\r\n\r\ntypedef union IRIns {\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      IRRef1 op1;\t/* IR operand 1. */\r\n    , IRRef1 op2;\t/* IR operand 2. */\r\n    )\r\n    IROpT ot;\t\t/* IR opcode and type (overlaps t and o). */\r\n    IRRef1 prev;\t/* Previous ins in same chain (overlaps r and s). */\r\n  };\r\n  struct {\r\n    IRRef2 op12;\t/* IR operand 1 and 2 (overlaps op1 and op2). */\r\n    LJ_ENDIAN_LOHI(\r\n      IRType1 t;\t/* IR type. */\r\n    , IROp1 o;\t\t/* IR opcode. */\r\n    )\r\n    LJ_ENDIAN_LOHI(\r\n      uint8_t r;\t/* Register allocation (overlaps prev). */\r\n    , uint8_t s;\t/* Spill slot allocation (overlaps prev). */\r\n    )\r\n  };\r\n  int32_t i;\t\t/* 32 bit signed integer literal (overlaps op12). */\r\n  GCRef gcr;\t\t/* GCobj constant (overlaps op12). */\r\n  MRef ptr;\t\t/* Pointer constant (overlaps op12). */\r\n} IRIns;\r\n\r\n/* TODO_GC64: major changes required. */\r\n#define ir_kgc(ir)\tcheck_exp((ir)->o == IR_KGC, gcref((ir)->gcr))\r\n#define ir_kstr(ir)\t(gco2str(ir_kgc((ir))))\r\n#define ir_ktab(ir)\t(gco2tab(ir_kgc((ir))))\r\n#define ir_kfunc(ir)\t(gco2func(ir_kgc((ir))))\r\n#define ir_kcdata(ir)\t(gco2cd(ir_kgc((ir))))\r\n#define ir_knum(ir)\tcheck_exp((ir)->o == IR_KNUM, mref((ir)->ptr, cTValue))\r\n#define ir_kint64(ir)\tcheck_exp((ir)->o == IR_KINT64, mref((ir)->ptr,cTValue))\r\n#define ir_k64(ir) \\\r\n  check_exp((ir)->o == IR_KNUM || (ir)->o == IR_KINT64, mref((ir)->ptr,cTValue))\r\n#define ir_kptr(ir) \\\r\n  check_exp((ir)->o == IR_KPTR || (ir)->o == IR_KKPTR, mref((ir)->ptr, void))\r\n\r\n/* A store or any other op with a non-weak guard has a side-effect. */\r\nstatic LJ_AINLINE int ir_sideeff(IRIns *ir)\r\n{\r\n  return (((ir->t.irt | ~IRT_GUARD) & lj_ir_mode[ir->o]) >= IRM_S);\r\n}\r\n\r\nLJ_STATIC_ASSERT((int)IRT_GUARD == (int)IRM_W);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_ircall.h",
    "content": "/*\r\n** IR CALL* instruction definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IRCALL_H\r\n#define _LJ_IRCALL_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n\r\n/* C call info for CALL* instructions. */\r\ntypedef struct CCallInfo {\r\n  ASMFunction func;\t\t/* Function pointer. */\r\n  uint32_t flags;\t\t/* Number of arguments and flags. */\r\n} CCallInfo;\r\n\r\n#define CCI_NARGS(ci)\t\t((ci)->flags & 0xff)\t/* # of args. */\r\n#define CCI_NARGS_MAX\t\t32\t\t\t/* Max. # of args. */\r\n\r\n#define CCI_OTSHIFT\t\t16\r\n#define CCI_OPTYPE(ci)\t\t((ci)->flags >> CCI_OTSHIFT)  /* Get op/type. */\r\n#define CCI_OPSHIFT\t\t24\r\n#define CCI_OP(ci)\t\t((ci)->flags >> CCI_OPSHIFT)  /* Get op. */\r\n\r\n#define CCI_CALL_N\t\t(IR_CALLN << CCI_OPSHIFT)\r\n#define CCI_CALL_A\t\t(IR_CALLA << CCI_OPSHIFT)\r\n#define CCI_CALL_L\t\t(IR_CALLL << CCI_OPSHIFT)\r\n#define CCI_CALL_S\t\t(IR_CALLS << CCI_OPSHIFT)\r\n#define CCI_CALL_FN\t\t(CCI_CALL_N|CCI_CC_FASTCALL)\r\n#define CCI_CALL_FL\t\t(CCI_CALL_L|CCI_CC_FASTCALL)\r\n#define CCI_CALL_FS\t\t(CCI_CALL_S|CCI_CC_FASTCALL)\r\n\r\n/* C call info flags. */\r\n#define CCI_L\t\t\t0x0100\t/* Implicit L arg. */\r\n#define CCI_CASTU64\t\t0x0200\t/* Cast u64 result to number. */\r\n#define CCI_NOFPRCLOBBER\t0x0400\t/* Does not clobber any FPRs. */\r\n#define CCI_VARARG\t\t0x0800\t/* Vararg function. */\r\n\r\n#define CCI_CC_MASK\t\t0x3000\t/* Calling convention mask. */\r\n#define CCI_CC_SHIFT\t\t12\r\n/* ORDER CC */\r\n#define CCI_CC_CDECL\t\t0x0000\t/* Default cdecl calling convention. */\r\n#define CCI_CC_THISCALL\t\t0x1000\t/* Thiscall calling convention. */\r\n#define CCI_CC_FASTCALL\t\t0x2000\t/* Fastcall calling convention. */\r\n#define CCI_CC_STDCALL\t\t0x3000\t/* Stdcall calling convention. */\r\n\r\n/* Extra args for SOFTFP, SPLIT 64 bit. */\r\n#define CCI_XARGS_SHIFT\t\t14\r\n#define CCI_XARGS(ci)\t\t(((ci)->flags >> CCI_XARGS_SHIFT) & 3)\r\n#define CCI_XA\t\t\t(1u << CCI_XARGS_SHIFT)\r\n\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n#define CCI_XNARGS(ci)\t\t(CCI_NARGS((ci)) + CCI_XARGS((ci)))\r\n#else\r\n#define CCI_XNARGS(ci)\t\tCCI_NARGS((ci))\r\n#endif\r\n\r\n/* Helpers for conditional function definitions. */\r\n#define IRCALLCOND_ANY(x)\t\tx\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#define IRCALLCOND_FPMATH(x)\t\tNULL\r\n#else\r\n#define IRCALLCOND_FPMATH(x)\t\tx\r\n#endif\r\n\r\n#if LJ_SOFTFP\r\n#define IRCALLCOND_SOFTFP(x)\t\tx\r\n#if LJ_HASFFI\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tx\r\n#else\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tNULL\r\n#endif\r\n#else\r\n#define IRCALLCOND_SOFTFP(x)\t\tNULL\r\n#define IRCALLCOND_SOFTFP_FFI(x)\tNULL\r\n#endif\r\n\r\n#define LJ_NEED_FP64\t(LJ_TARGET_ARM || LJ_TARGET_PPC || LJ_TARGET_MIPS)\r\n\r\n#if LJ_HASFFI && (LJ_SOFTFP || LJ_NEED_FP64)\r\n#define IRCALLCOND_FP64_FFI(x)\t\tx\r\n#else\r\n#define IRCALLCOND_FP64_FFI(x)\t\tNULL\r\n#endif\r\n\r\n#if LJ_HASFFI\r\n#define IRCALLCOND_FFI(x)\t\tx\r\n#if LJ_32\r\n#define IRCALLCOND_FFI32(x)\t\tx\r\n#else\r\n#define IRCALLCOND_FFI32(x)\t\tNULL\r\n#endif\r\n#else\r\n#define IRCALLCOND_FFI(x)\t\tNULL\r\n#define IRCALLCOND_FFI32(x)\t\tNULL\r\n#endif\r\n\r\n#if LJ_TARGET_X86\r\n#define CCI_RANDFPR\t0\t/* Clang on OSX/x86 is overzealous. */\r\n#else\r\n#define CCI_RANDFPR\tCCI_NOFPRCLOBBER\r\n#endif\r\n\r\n#if LJ_SOFTFP\r\n#define XA_FP\t\tCCI_XA\r\n#define XA2_FP\t\t(CCI_XA+CCI_XA)\r\n#else\r\n#define XA_FP\t\t0\r\n#define XA2_FP\t\t0\r\n#endif\r\n\r\n#if LJ_32\r\n#define XA_64\t\tCCI_XA\r\n#define XA2_64\t\t(CCI_XA+CCI_XA)\r\n#else\r\n#define XA_64\t\t0\r\n#define XA2_64\t\t0\r\n#endif\r\n\r\n/* Function definitions for CALL* instructions. */\r\n#define IRCALLDEF(_) \\\r\n  _(ANY,\tlj_str_cmp,\t\t2,  FN, INT, CCI_NOFPRCLOBBER) \\\r\n  _(ANY,\tlj_str_find,\t\t4,   N, P32, 0) \\\r\n  _(ANY,\tlj_str_new,\t\t3,   S, STR, CCI_L) \\\r\n  _(ANY,\tlj_strscan_num,\t\t2,  FN, INT, 0) \\\r\n  _(ANY,\tlj_strfmt_int,\t\t2,  FN, STR, CCI_L) \\\r\n  _(ANY,\tlj_strfmt_num,\t\t2,  FN, STR, CCI_L) \\\r\n  _(ANY,\tlj_strfmt_char,\t\t2,  FN, STR, CCI_L) \\\r\n  _(ANY,\tlj_strfmt_putint,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_strfmt_putnum,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_strfmt_putquoted,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_strfmt_putfxint,\t3,   L, P32, XA_64) \\\r\n  _(ANY,\tlj_strfmt_putfnum_int,\t3,   L, P32, XA_FP) \\\r\n  _(ANY,\tlj_strfmt_putfnum_uint,\t3,   L, P32, XA_FP) \\\r\n  _(ANY,\tlj_strfmt_putfnum,\t3,   L, P32, XA_FP) \\\r\n  _(ANY,\tlj_strfmt_putfstr,\t3,   L, P32, 0) \\\r\n  _(ANY,\tlj_strfmt_putfchar,\t3,   L, P32, 0) \\\r\n  _(ANY,\tlj_buf_putmem,\t\t3,   S, P32, 0) \\\r\n  _(ANY,\tlj_buf_putstr,\t\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_buf_putchar,\t\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_buf_putstr_reverse,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_buf_putstr_lower,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_buf_putstr_upper,\t2,  FL, P32, 0) \\\r\n  _(ANY,\tlj_buf_putstr_rep,\t3,   L, P32, 0) \\\r\n  _(ANY,\tlj_buf_puttab,\t\t5,   L, P32, 0) \\\r\n  _(ANY,\tlj_buf_tostr,\t\t1,  FL, STR, 0) \\\r\n  _(ANY,\tlj_tab_new_ah,\t\t3,   A, TAB, CCI_L) \\\r\n  _(ANY,\tlj_tab_new1,\t\t2,  FS, TAB, CCI_L) \\\r\n  _(ANY,\tlj_tab_dup,\t\t2,  FS, TAB, CCI_L) \\\r\n  _(ANY,\tlj_tab_clear,\t\t1,  FS, NIL, 0) \\\r\n  _(ANY,\tlj_tab_newkey,\t\t3,   S, P32, CCI_L) \\\r\n  _(ANY,\tlj_tab_len,\t\t1,  FL, INT, 0) \\\r\n  _(ANY,\tlj_gc_step_jit,\t\t2,  FS, NIL, CCI_L) \\\r\n  _(ANY,\tlj_gc_barrieruv,\t2,  FS, NIL, 0) \\\r\n  _(ANY,\tlj_mem_newgco,\t\t2,  FS, P32, CCI_L) \\\r\n  _(ANY,\tlj_math_random_step, 1, FS, NUM, CCI_CASTU64|CCI_RANDFPR)\\\r\n  _(ANY,\tlj_vm_modi,\t\t2,  FN, INT, 0) \\\r\n  _(ANY,\tsinh,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tcosh,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\ttanh,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tfputc,\t\t\t2,   S, INT, 0) \\\r\n  _(ANY,\tfwrite,\t\t\t4,   S, INT, 0) \\\r\n  _(ANY,\tfflush,\t\t\t1,   S, INT, 0) \\\r\n  /* ORDER FPM */ \\\r\n  _(FPMATH,\tlj_vm_floor,\t\t1,   N, NUM, XA_FP) \\\r\n  _(FPMATH,\tlj_vm_ceil,\t\t1,   N, NUM, XA_FP) \\\r\n  _(FPMATH,\tlj_vm_trunc,\t\t1,   N, NUM, XA_FP) \\\r\n  _(FPMATH,\tsqrt,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\texp,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tlj_vm_exp2,\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tlog,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tlj_vm_log2,\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tlog10,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tsin,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tcos,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\ttan,\t\t\t1,   N, NUM, XA_FP) \\\r\n  _(ANY,\tlj_vm_powi,\t\t2,   N, NUM, XA_FP) \\\r\n  _(ANY,\tpow,\t\t\t2,   N, NUM, XA2_FP) \\\r\n  _(ANY,\tatan2,\t\t\t2,   N, NUM, XA2_FP) \\\r\n  _(ANY,\tldexp,\t\t\t2,   N, NUM, XA_FP) \\\r\n  _(SOFTFP,\tlj_vm_tobit,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP,\tsoftfp_add,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_sub,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_mul,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_div,\t\t4,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_cmp,\t\t4,   N, NIL, 0) \\\r\n  _(SOFTFP,\tsoftfp_i2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP,\tsoftfp_d2i,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_ui2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2d,\t\t1,   N, NUM, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_d2ui,\t\t2,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_d2f,\t\t2,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_i2f,\t\t1,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_ui2f,\t\t1,   N, FLOAT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2i,\t\t1,   N, INT, 0) \\\r\n  _(SOFTFP_FFI,\tsoftfp_f2ui,\t\t1,   N, INT, 0) \\\r\n  _(FP64_FFI,\tfp64_l2d,\t\t1,   N, NUM, XA_64) \\\r\n  _(FP64_FFI,\tfp64_ul2d,\t\t1,   N, NUM, XA_64) \\\r\n  _(FP64_FFI,\tfp64_l2f,\t\t1,   N, FLOAT, XA_64) \\\r\n  _(FP64_FFI,\tfp64_ul2f,\t\t1,   N, FLOAT, XA_64) \\\r\n  _(FP64_FFI,\tfp64_d2l,\t\t1,   N, I64, XA_FP) \\\r\n  _(FP64_FFI,\tfp64_d2ul,\t\t1,   N, U64, XA_FP) \\\r\n  _(FP64_FFI,\tfp64_f2l,\t\t1,   N, I64, 0) \\\r\n  _(FP64_FFI,\tfp64_f2ul,\t\t1,   N, U64, 0) \\\r\n  _(FFI,\tlj_carith_divi64,\t2,   N, I64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_divu64,\t2,   N, U64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_modi64,\t2,   N, I64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_modu64,\t2,   N, U64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_powi64,\t2,   N, I64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_carith_powu64,\t2,   N, U64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI,\tlj_cdata_newv,\t\t4,   S, CDATA, CCI_L) \\\r\n  _(FFI,\tlj_cdata_setfin,\t4,   S, NIL, CCI_L) \\\r\n  _(FFI,\tstrlen,\t\t\t1,   L, INTP, 0) \\\r\n  _(FFI,\tmemcpy,\t\t\t3,   S, PTR, 0) \\\r\n  _(FFI,\tmemset,\t\t\t3,   S, PTR, 0) \\\r\n  _(FFI,\tlj_vm_errno,\t\t0,   S, INT, CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_mul64,\t2,   N, I64, XA2_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_shl64,\t2,   N, U64, XA_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_shr64,\t2,   N, U64, XA_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_sar64,\t2,   N, U64, XA_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_rol64,\t2,   N, U64, XA_64|CCI_NOFPRCLOBBER) \\\r\n  _(FFI32,\tlj_carith_ror64,\t2,   N, U64, XA_64|CCI_NOFPRCLOBBER) \\\r\n  \\\r\n  /* End of list. */\r\n\r\ntypedef enum {\r\n#define IRCALLENUM(cond, name, nargs, kind, type, flags)\tIRCALL_##name,\r\nIRCALLDEF(IRCALLENUM)\r\n#undef IRCALLENUM\r\n  IRCALL__MAX\r\n} IRCallID;\r\n\r\nLJ_FUNC TRef lj_ir_call(jit_State *J, IRCallID id, ...);\r\n\r\nLJ_DATA const CCallInfo lj_ir_callinfo[IRCALL__MAX+1];\r\n\r\n/* Soft-float declarations. */\r\n#if LJ_SOFTFP\r\n#if LJ_TARGET_ARM\r\n#define softfp_add __aeabi_dadd\r\n#define softfp_sub __aeabi_dsub\r\n#define softfp_mul __aeabi_dmul\r\n#define softfp_div __aeabi_ddiv\r\n#define softfp_cmp __aeabi_cdcmple\r\n#define softfp_i2d __aeabi_i2d\r\n#define softfp_d2i __aeabi_d2iz\r\n#define softfp_ui2d __aeabi_ui2d\r\n#define softfp_f2d __aeabi_f2d\r\n#define softfp_d2ui __aeabi_d2uiz\r\n#define softfp_d2f __aeabi_d2f\r\n#define softfp_i2f __aeabi_i2f\r\n#define softfp_ui2f __aeabi_ui2f\r\n#define softfp_f2i __aeabi_f2iz\r\n#define softfp_f2ui __aeabi_f2uiz\r\n#define fp64_l2d __aeabi_l2d\r\n#define fp64_ul2d __aeabi_ul2d\r\n#define fp64_l2f __aeabi_l2f\r\n#define fp64_ul2f __aeabi_ul2f\r\n#if LJ_TARGET_IOS\r\n#define fp64_d2l __fixdfdi\r\n#define fp64_d2ul __fixunsdfdi\r\n#define fp64_f2l __fixsfdi\r\n#define fp64_f2ul __fixunssfdi\r\n#else\r\n#define fp64_d2l __aeabi_d2lz\r\n#define fp64_d2ul __aeabi_d2ulz\r\n#define fp64_f2l __aeabi_f2lz\r\n#define fp64_f2ul __aeabi_f2ulz\r\n#endif\r\n#else\r\n#error \"Missing soft-float definitions for target architecture\"\r\n#endif\r\nextern double softfp_add(double a, double b);\r\nextern double softfp_sub(double a, double b);\r\nextern double softfp_mul(double a, double b);\r\nextern double softfp_div(double a, double b);\r\nextern void softfp_cmp(double a, double b);\r\nextern double softfp_i2d(int32_t a);\r\nextern int32_t softfp_d2i(double a);\r\n#if LJ_HASFFI\r\nextern double softfp_ui2d(uint32_t a);\r\nextern double softfp_f2d(float a);\r\nextern uint32_t softfp_d2ui(double a);\r\nextern float softfp_d2f(double a);\r\nextern float softfp_i2f(int32_t a);\r\nextern float softfp_ui2f(uint32_t a);\r\nextern int32_t softfp_f2i(float a);\r\nextern uint32_t softfp_f2ui(float a);\r\n#endif\r\n#endif\r\n\r\n#if LJ_HASFFI && LJ_NEED_FP64 && !(LJ_TARGET_ARM && LJ_SOFTFP)\r\n#ifdef __GNUC__\r\n#define fp64_l2d __floatdidf\r\n#define fp64_ul2d __floatundidf\r\n#define fp64_l2f __floatdisf\r\n#define fp64_ul2f __floatundisf\r\n#define fp64_d2l __fixdfdi\r\n#define fp64_d2ul __fixunsdfdi\r\n#define fp64_f2l __fixsfdi\r\n#define fp64_f2ul __fixunssfdi\r\n#else\r\n#error \"Missing fp64 helper definitions for this compiler\"\r\n#endif\r\n#endif\r\n\r\n#if LJ_HASFFI && (LJ_SOFTFP || LJ_NEED_FP64)\r\nextern double fp64_l2d(int64_t a);\r\nextern double fp64_ul2d(uint64_t a);\r\nextern float fp64_l2f(int64_t a);\r\nextern float fp64_ul2f(uint64_t a);\r\nextern int64_t fp64_d2l(double a);\r\nextern uint64_t fp64_d2ul(double a);\r\nextern int64_t fp64_f2l(float a);\r\nextern uint64_t fp64_f2ul(float a);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_iropt.h",
    "content": "/*\r\n** Common header for IR emitter and optimizations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_IROPT_H\r\n#define _LJ_IROPT_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* IR emitter. */\r\nLJ_FUNC void LJ_FASTCALL lj_ir_growtop(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_emit(jit_State *J);\r\n\r\n/* Save current IR in J->fold.ins, but do not emit it (yet). */\r\nstatic LJ_AINLINE void lj_ir_set_(jit_State *J, uint16_t ot, IRRef1 a, IRRef1 b)\r\n{\r\n  J->fold.ins.ot = ot; J->fold.ins.op1 = a; J->fold.ins.op2 = b;\r\n}\r\n\r\n#define lj_ir_set(J, ot, a, b) \\\r\n  lj_ir_set_(J, (uint16_t)(ot), (IRRef1)(a), (IRRef1)(b))\r\n\r\n/* Get ref of next IR instruction and optionally grow IR.\r\n** Note: this may invalidate all IRIns*!\r\n*/\r\nstatic LJ_AINLINE IRRef lj_ir_nextins(jit_State *J)\r\n{\r\n  IRRef ref = J->cur.nins;\r\n  if (LJ_UNLIKELY(ref >= J->irtoplim)) lj_ir_growtop(J);\r\n  J->cur.nins = ref + 1;\r\n  return ref;\r\n}\r\n\r\n/* Interning of constants. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_kint(jit_State *J, int32_t k);\r\nLJ_FUNC void lj_ir_k64_freeall(jit_State *J);\r\nLJ_FUNC TRef lj_ir_k64(jit_State *J, IROp op, cTValue *tv);\r\nLJ_FUNC cTValue *lj_ir_k64_find(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_knum_u64(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_knumint(jit_State *J, lua_Number n);\r\nLJ_FUNC TRef lj_ir_kint64(jit_State *J, uint64_t u64);\r\nLJ_FUNC TRef lj_ir_kgc(jit_State *J, GCobj *o, IRType t);\r\nLJ_FUNC TRef lj_ir_kptr_(jit_State *J, IROp op, void *ptr);\r\nLJ_FUNC TRef lj_ir_knull(jit_State *J, IRType t);\r\nLJ_FUNC TRef lj_ir_kslot(jit_State *J, TRef key, IRRef slot);\r\n\r\n#if LJ_64\r\n#define lj_ir_kintp(J, k)\tlj_ir_kint64(J, (uint64_t)(k))\r\n#else\r\n#define lj_ir_kintp(J, k)\tlj_ir_kint(J, (int32_t)(k))\r\n#endif\r\n\r\nstatic LJ_AINLINE TRef lj_ir_knum(jit_State *J, lua_Number n)\r\n{\r\n  TValue tv;\r\n  tv.n = n;\r\n  return lj_ir_knum_u64(J, tv.u64);\r\n}\r\n\r\n#define lj_ir_kstr(J, str)\tlj_ir_kgc(J, obj2gco((str)), IRT_STR)\r\n#define lj_ir_ktab(J, tab)\tlj_ir_kgc(J, obj2gco((tab)), IRT_TAB)\r\n#define lj_ir_kfunc(J, func)\tlj_ir_kgc(J, obj2gco((func)), IRT_FUNC)\r\n#define lj_ir_kptr(J, ptr)\tlj_ir_kptr_(J, IR_KPTR, (ptr))\r\n#define lj_ir_kkptr(J, ptr)\tlj_ir_kptr_(J, IR_KKPTR, (ptr))\r\n\r\n/* Special FP constants. */\r\n#define lj_ir_knum_zero(J)\tlj_ir_knum_u64(J, U64x(00000000,00000000))\r\n#define lj_ir_knum_one(J)\tlj_ir_knum_u64(J, U64x(3ff00000,00000000))\r\n#define lj_ir_knum_tobit(J)\tlj_ir_knum_u64(J, U64x(43380000,00000000))\r\n\r\n/* Special 128 bit SIMD constants. */\r\n#define lj_ir_knum_abs(J)\tlj_ir_k64(J, IR_KNUM, LJ_KSIMD(J, LJ_KSIMD_ABS))\r\n#define lj_ir_knum_neg(J)\tlj_ir_k64(J, IR_KNUM, LJ_KSIMD(J, LJ_KSIMD_NEG))\r\n\r\n/* Access to constants. */\r\nLJ_FUNC void lj_ir_kvalue(lua_State *L, TValue *tv, const IRIns *ir);\r\n\r\n/* Convert IR operand types. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tonumber(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tonum(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_ir_tostr(jit_State *J, TRef tr);\r\n\r\n/* Miscellaneous IR ops. */\r\nLJ_FUNC int lj_ir_numcmp(lua_Number a, lua_Number b, IROp op);\r\nLJ_FUNC int lj_ir_strcmp(GCstr *a, GCstr *b, IROp op);\r\nLJ_FUNC void lj_ir_rollback(jit_State *J, IRRef ref);\r\n\r\n/* Emit IR instructions with on-the-fly optimizations. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fold(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_cse(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_cselim(jit_State *J, IRRef lim);\r\n\r\n/* Special return values for the fold functions. */\r\nenum {\r\n  NEXTFOLD,\t\t/* Couldn't fold, pass on. */\r\n  RETRYFOLD,\t\t/* Retry fold with modified fins. */\r\n  KINTFOLD,\t\t/* Return ref for int constant in fins->i. */\r\n  FAILFOLD,\t\t/* Guard would always fail. */\r\n  DROPFOLD,\t\t/* Guard eliminated. */\r\n  MAX_FOLD\r\n};\r\n\r\n#define INTFOLD(k)\t((J->fold.ins.i = (k)), (TRef)KINTFOLD)\r\n#define INT64FOLD(k)\t(lj_ir_kint64(J, (k)))\r\n#define CONDFOLD(cond)\t((TRef)FAILFOLD + (TRef)(cond))\r\n#define LEFTFOLD\t(J->fold.ins.op1)\r\n#define RIGHTFOLD\t(J->fold.ins.op2)\r\n#define CSEFOLD\t\t(lj_opt_cse(J))\r\n#define EMITFOLD\t(lj_ir_emit(J))\r\n\r\n/* Load/store forwarding. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_aload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_hload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_uload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_fload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_xload(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_tab_len(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_fwd_hrefk(jit_State *J);\r\nLJ_FUNC int LJ_FASTCALL lj_opt_fwd_href_nokey(jit_State *J);\r\nLJ_FUNC int LJ_FASTCALL lj_opt_fwd_tptr(jit_State *J, IRRef lim);\r\nLJ_FUNC int lj_opt_fwd_wasnonnil(jit_State *J, IROpT loadop, IRRef xref);\r\n\r\n/* Dead-store elimination. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_ahstore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_ustore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_fstore(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_dse_xstore(jit_State *J);\r\n\r\n/* Narrowing. */\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_convert(jit_State *J);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_index(jit_State *J, TRef key);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_toint(jit_State *J, TRef tr);\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_tobit(jit_State *J, TRef tr);\r\n#if LJ_HASFFI\r\nLJ_FUNC TRef LJ_FASTCALL lj_opt_narrow_cindex(jit_State *J, TRef key);\r\n#endif\r\nLJ_FUNC TRef lj_opt_narrow_arith(jit_State *J, TRef rb, TRef rc,\r\n\t\t\t\t TValue *vb, TValue *vc, IROp op);\r\nLJ_FUNC TRef lj_opt_narrow_unm(jit_State *J, TRef rc, TValue *vc);\r\nLJ_FUNC TRef lj_opt_narrow_mod(jit_State *J, TRef rb, TRef rc, TValue *vc);\r\nLJ_FUNC TRef lj_opt_narrow_pow(jit_State *J, TRef rb, TRef rc, TValue *vc);\r\nLJ_FUNC IRType lj_opt_narrow_forl(jit_State *J, cTValue *forbase);\r\n\r\n/* Optimization passes. */\r\nLJ_FUNC void lj_opt_dce(jit_State *J);\r\nLJ_FUNC int lj_opt_loop(jit_State *J);\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\nLJ_FUNC void lj_opt_split(jit_State *J);\r\n#else\r\n#define lj_opt_split(J)\t\tUNUSED(J)\r\n#endif\r\nLJ_FUNC void lj_opt_sink(jit_State *J);\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_jit.h",
    "content": "/*\r\n** Common definitions for the JIT compiler.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_JIT_H\r\n#define _LJ_JIT_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n\r\n/* JIT engine flags. */\r\n#define JIT_F_ON\t\t0x00000001\r\n\r\n/* CPU-specific JIT engine flags. */\r\n#if LJ_TARGET_X86ORX64\r\n#define JIT_F_SSE2\t\t0x00000010\r\n#define JIT_F_SSE3\t\t0x00000020\r\n#define JIT_F_SSE4_1\t\t0x00000040\r\n#define JIT_F_PREFER_IMUL\t0x00000080\r\n#define JIT_F_LEA_AGU\t\t0x00000100\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_SSE2\r\n#define JIT_F_CPUSTRING\t\t\"\\4SSE2\\4SSE3\\6SSE4.1\\3AMD\\4ATOM\"\r\n#elif LJ_TARGET_ARM\r\n#define JIT_F_ARMV6_\t\t0x00000010\r\n#define JIT_F_ARMV6T2_\t\t0x00000020\r\n#define JIT_F_ARMV7\t\t0x00000040\r\n#define JIT_F_VFPV2\t\t0x00000080\r\n#define JIT_F_VFPV3\t\t0x00000100\r\n\r\n#define JIT_F_ARMV6\t\t(JIT_F_ARMV6_|JIT_F_ARMV6T2_|JIT_F_ARMV7)\r\n#define JIT_F_ARMV6T2\t\t(JIT_F_ARMV6T2_|JIT_F_ARMV7)\r\n#define JIT_F_VFP\t\t(JIT_F_VFPV2|JIT_F_VFPV3)\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_ARMV6_\r\n#define JIT_F_CPUSTRING\t\t\"\\5ARMv6\\7ARMv6T2\\5ARMv7\\5VFPv2\\5VFPv3\"\r\n#elif LJ_TARGET_PPC\r\n#define JIT_F_SQRT\t\t0x00000010\r\n#define JIT_F_ROUND\t\t0x00000020\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_SQRT\r\n#define JIT_F_CPUSTRING\t\t\"\\4SQRT\\5ROUND\"\r\n#elif LJ_TARGET_MIPS\r\n#define JIT_F_MIPS32R2\t\t0x00000010\r\n\r\n/* Names for the CPU-specific flags. Must match the order above. */\r\n#define JIT_F_CPU_FIRST\t\tJIT_F_MIPS32R2\r\n#define JIT_F_CPUSTRING\t\t\"\\010MIPS32R2\"\r\n#else\r\n#define JIT_F_CPU_FIRST\t\t0\r\n#define JIT_F_CPUSTRING\t\t\"\"\r\n#endif\r\n\r\n/* Optimization flags. */\r\n#define JIT_F_OPT_MASK\t\t0x0fff0000\r\n\r\n#define JIT_F_OPT_FOLD\t\t0x00010000\r\n#define JIT_F_OPT_CSE\t\t0x00020000\r\n#define JIT_F_OPT_DCE\t\t0x00040000\r\n#define JIT_F_OPT_FWD\t\t0x00080000\r\n#define JIT_F_OPT_DSE\t\t0x00100000\r\n#define JIT_F_OPT_NARROW\t0x00200000\r\n#define JIT_F_OPT_LOOP\t\t0x00400000\r\n#define JIT_F_OPT_ABC\t\t0x00800000\r\n#define JIT_F_OPT_SINK\t\t0x01000000\r\n#define JIT_F_OPT_FUSE\t\t0x02000000\r\n\r\n/* Optimizations names for -O. Must match the order above. */\r\n#define JIT_F_OPT_FIRST\t\tJIT_F_OPT_FOLD\r\n#define JIT_F_OPTSTRING\t\\\r\n  \"\\4fold\\3cse\\3dce\\3fwd\\3dse\\6narrow\\4loop\\3abc\\4sink\\4fuse\"\r\n\r\n/* Optimization levels set a fixed combination of flags. */\r\n#define JIT_F_OPT_0\t0\r\n#define JIT_F_OPT_1\t(JIT_F_OPT_FOLD|JIT_F_OPT_CSE|JIT_F_OPT_DCE)\r\n#define JIT_F_OPT_2\t(JIT_F_OPT_1|JIT_F_OPT_NARROW|JIT_F_OPT_LOOP)\r\n#define JIT_F_OPT_3\t(JIT_F_OPT_2|\\\r\n  JIT_F_OPT_FWD|JIT_F_OPT_DSE|JIT_F_OPT_ABC|JIT_F_OPT_SINK|JIT_F_OPT_FUSE)\r\n#define JIT_F_OPT_DEFAULT\tJIT_F_OPT_3\r\n\r\n#if LJ_TARGET_WINDOWS || LJ_64\r\n/* See: http://blogs.msdn.com/oldnewthing/archive/2003/10/08/55239.aspx */\r\n#define JIT_P_sizemcode_DEFAULT\t\t64\r\n#else\r\n/* Could go as low as 4K, but the mmap() overhead would be rather high. */\r\n#define JIT_P_sizemcode_DEFAULT\t\t32\r\n#endif\r\n\r\n/* Optimization parameters and their defaults. Length is a char in octal! */\r\n#define JIT_PARAMDEF(_) \\\r\n  _(\\010, maxtrace,\t1000)\t/* Max. # of traces in cache. */ \\\r\n  _(\\011, maxrecord,\t4000)\t/* Max. # of recorded IR instructions. */ \\\r\n  _(\\012, maxirconst,\t500)\t/* Max. # of IR constants of a trace. */ \\\r\n  _(\\007, maxside,\t100)\t/* Max. # of side traces of a root trace. */ \\\r\n  _(\\007, maxsnap,\t500)\t/* Max. # of snapshots for a trace. */ \\\r\n  _(\\011, minstitch,\t0)\t/* Min. # of IR ins for a stitched trace. */ \\\r\n  \\\r\n  _(\\007, hotloop,\t56)\t/* # of iter. to detect a hot loop/call. */ \\\r\n  _(\\007, hotexit,\t10)\t/* # of taken exits to start a side trace. */ \\\r\n  _(\\007, tryside,\t4)\t/* # of attempts to compile a side trace. */ \\\r\n  \\\r\n  _(\\012, instunroll,\t4)\t/* Max. unroll for instable loops. */ \\\r\n  _(\\012, loopunroll,\t15)\t/* Max. unroll for loop ops in side traces. */ \\\r\n  _(\\012, callunroll,\t3)\t/* Max. unroll for recursive calls. */ \\\r\n  _(\\011, recunroll,\t2)\t/* Min. unroll for true recursion. */ \\\r\n  \\\r\n  /* Size of each machine code area (in KBytes). */ \\\r\n  _(\\011, sizemcode,\tJIT_P_sizemcode_DEFAULT) \\\r\n  /* Max. total size of all machine code areas (in KBytes). */ \\\r\n  _(\\010, maxmcode,\t512) \\\r\n  /* End of list. */\r\n\r\nenum {\r\n#define JIT_PARAMENUM(len, name, value)\tJIT_P_##name,\r\nJIT_PARAMDEF(JIT_PARAMENUM)\r\n#undef JIT_PARAMENUM\r\n  JIT_P__MAX\r\n};\r\n\r\n#define JIT_PARAMSTR(len, name, value)\t#len #name\r\n#define JIT_P_STRING\tJIT_PARAMDEF(JIT_PARAMSTR)\r\n\r\n/* Trace compiler state. */\r\ntypedef enum {\r\n  LJ_TRACE_IDLE,\t/* Trace compiler idle. */\r\n  LJ_TRACE_ACTIVE = 0x10,\r\n  LJ_TRACE_RECORD,\t/* Bytecode recording active. */\r\n  LJ_TRACE_START,\t/* New trace started. */\r\n  LJ_TRACE_END,\t\t/* End of trace. */\r\n  LJ_TRACE_ASM,\t\t/* Assemble trace. */\r\n  LJ_TRACE_ERR\t\t/* Trace aborted with error. */\r\n} TraceState;\r\n\r\n/* Post-processing action. */\r\ntypedef enum {\r\n  LJ_POST_NONE,\t\t/* No action. */\r\n  LJ_POST_FIXCOMP,\t/* Fixup comparison and emit pending guard. */\r\n  LJ_POST_FIXGUARD,\t/* Fixup and emit pending guard. */\r\n  LJ_POST_FIXGUARDSNAP,\t/* Fixup and emit pending guard and snapshot. */\r\n  LJ_POST_FIXBOOL,\t/* Fixup boolean result. */\r\n  LJ_POST_FIXCONST,\t/* Fixup constant results. */\r\n  LJ_POST_FFRETRY\t/* Suppress recording of retried fast functions. */\r\n} PostProc;\r\n\r\n/* Machine code type. */\r\n#if LJ_TARGET_X86ORX64\r\ntypedef uint8_t MCode;\r\n#else\r\ntypedef uint32_t MCode;\r\n#endif\r\n\r\n/* Stack snapshot header. */\r\ntypedef struct SnapShot {\r\n  uint16_t mapofs;\t/* Offset into snapshot map. */\r\n  IRRef1 ref;\t\t/* First IR ref for this snapshot. */\r\n  uint8_t nslots;\t/* Number of valid slots. */\r\n  uint8_t topslot;\t/* Maximum frame extent. */\r\n  uint8_t nent;\t\t/* Number of compressed entries. */\r\n  uint8_t count;\t/* Count of taken exits for this snapshot. */\r\n} SnapShot;\r\n\r\n#define SNAPCOUNT_DONE\t255\t/* Already compiled and linked a side trace. */\r\n\r\n/* Compressed snapshot entry. */\r\ntypedef uint32_t SnapEntry;\r\n\r\n#define SNAP_FRAME\t\t0x010000\t/* Frame slot. */\r\n#define SNAP_CONT\t\t0x020000\t/* Continuation slot. */\r\n#define SNAP_NORESTORE\t\t0x040000\t/* No need to restore slot. */\r\n#define SNAP_SOFTFPNUM\t\t0x080000\t/* Soft-float number. */\r\nLJ_STATIC_ASSERT(SNAP_FRAME == TREF_FRAME);\r\nLJ_STATIC_ASSERT(SNAP_CONT == TREF_CONT);\r\n\r\n#define SNAP(slot, flags, ref)\t(((SnapEntry)(slot) << 24) + (flags) + (ref))\r\n#define SNAP_TR(slot, tr) \\\r\n  (((SnapEntry)(slot) << 24) + ((tr) & (TREF_CONT|TREF_FRAME|TREF_REFMASK)))\r\n#define SNAP_MKPC(pc)\t\t((SnapEntry)u32ptr(pc))\r\n#define SNAP_MKFTSZ(ftsz)\t((SnapEntry)(ftsz))\r\n#define snap_ref(sn)\t\t((sn) & 0xffff)\r\n#define snap_slot(sn)\t\t((BCReg)((sn) >> 24))\r\n#define snap_isframe(sn)\t((sn) & SNAP_FRAME)\r\n#define snap_pc(sn)\t\t((const BCIns *)(uintptr_t)(sn))\r\n#define snap_setref(sn, ref)\t(((sn) & (0xffff0000&~SNAP_NORESTORE)) | (ref))\r\n\r\n/* Snapshot and exit numbers. */\r\ntypedef uint32_t SnapNo;\r\ntypedef uint32_t ExitNo;\r\n\r\n/* Trace number. */\r\ntypedef uint32_t TraceNo;\t/* Used to pass around trace numbers. */\r\ntypedef uint16_t TraceNo1;\t/* Stored trace number. */\r\n\r\n/* Type of link. ORDER LJ_TRLINK */\r\ntypedef enum {\r\n  LJ_TRLINK_NONE,\t\t/* Incomplete trace. No link, yet. */\r\n  LJ_TRLINK_ROOT,\t\t/* Link to other root trace. */\r\n  LJ_TRLINK_LOOP,\t\t/* Loop to same trace. */\r\n  LJ_TRLINK_TAILREC,\t\t/* Tail-recursion. */\r\n  LJ_TRLINK_UPREC,\t\t/* Up-recursion. */\r\n  LJ_TRLINK_DOWNREC,\t\t/* Down-recursion. */\r\n  LJ_TRLINK_INTERP,\t\t/* Fallback to interpreter. */\r\n  LJ_TRLINK_RETURN,\t\t/* Return to interpreter. */\r\n  LJ_TRLINK_STITCH\t\t/* Trace stitching. */\r\n} TraceLink;\r\n\r\n/* Trace object. */\r\ntypedef struct GCtrace {\r\n  GCHeader;\r\n  uint8_t topslot;\t/* Top stack slot already checked to be allocated. */\r\n  uint8_t linktype;\t/* Type of link. */\r\n  IRRef nins;\t\t/* Next IR instruction. Biased with REF_BIAS. */\r\n#if LJ_GC64\r\n  uint32_t unused_gc64;\r\n#endif\r\n  GCRef gclist;\r\n  IRIns *ir;\t\t/* IR instructions/constants. Biased with REF_BIAS. */\r\n  IRRef nk;\t\t/* Lowest IR constant. Biased with REF_BIAS. */\r\n  uint16_t nsnap;\t/* Number of snapshots. */\r\n  uint16_t nsnapmap;\t/* Number of snapshot map elements. */\r\n  SnapShot *snap;\t/* Snapshot array. */\r\n  SnapEntry *snapmap;\t/* Snapshot map. */\r\n  GCRef startpt;\t/* Starting prototype. */\r\n  MRef startpc;\t\t/* Bytecode PC of starting instruction. */\r\n  BCIns startins;\t/* Original bytecode of starting instruction. */\r\n  MSize szmcode;\t/* Size of machine code. */\r\n  MCode *mcode;\t\t/* Start of machine code. */\r\n  MSize mcloop;\t\t/* Offset of loop start in machine code. */\r\n  uint16_t nchild;\t/* Number of child traces (root trace only). */\r\n  uint16_t spadjust;\t/* Stack pointer adjustment (offset in bytes). */\r\n  TraceNo1 traceno;\t/* Trace number. */\r\n  TraceNo1 link;\t/* Linked trace (or self for loops). */\r\n  TraceNo1 root;\t/* Root trace of side trace (or 0 for root traces). */\r\n  TraceNo1 nextroot;\t/* Next root trace for same prototype. */\r\n  TraceNo1 nextside;\t/* Next side trace of same root trace. */\r\n  uint8_t sinktags;\t/* Trace has SINK tags. */\r\n  uint8_t unused1;\r\n#ifdef LUAJIT_USE_GDBJIT\r\n  void *gdbjit_entry;\t/* GDB JIT entry. */\r\n#endif\r\n} GCtrace;\r\n\r\n#define gco2trace(o)\tcheck_exp((o)->gch.gct == ~LJ_TTRACE, (GCtrace *)(o))\r\n#define traceref(J, n) \\\r\n  check_exp((n)>0 && (MSize)(n)<J->sizetrace, (GCtrace *)gcref(J->trace[(n)]))\r\n\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCtrace, gclist));\r\n\r\nstatic LJ_AINLINE MSize snap_nextofs(GCtrace *T, SnapShot *snap)\r\n{\r\n  if (snap+1 == &T->snap[T->nsnap])\r\n    return T->nsnapmap;\r\n  else\r\n    return (snap+1)->mapofs;\r\n}\r\n\r\n/* Round-robin penalty cache for bytecodes leading to aborted traces. */\r\ntypedef struct HotPenalty {\r\n  MRef pc;\t\t/* Starting bytecode PC. */\r\n  uint16_t val;\t\t/* Penalty value, i.e. hotcount start. */\r\n  uint16_t reason;\t/* Abort reason (really TraceErr). */\r\n} HotPenalty;\r\n\r\n#define PENALTY_SLOTS\t64\t/* Penalty cache slot. Must be a power of 2. */\r\n#define PENALTY_MIN\t(36*2)\t/* Minimum penalty value. */\r\n#define PENALTY_MAX\t60000\t/* Maximum penalty value. */\r\n#define PENALTY_RNDBITS\t4\t/* # of random bits to add to penalty value. */\r\n\r\n/* Round-robin backpropagation cache for narrowing conversions. */\r\ntypedef struct BPropEntry {\r\n  IRRef1 key;\t\t/* Key: original reference. */\r\n  IRRef1 val;\t\t/* Value: reference after conversion. */\r\n  IRRef mode;\t\t/* Mode for this entry (currently IRCONV_*). */\r\n} BPropEntry;\r\n\r\n/* Number of slots for the backpropagation cache. Must be a power of 2. */\r\n#define BPROP_SLOTS\t16\r\n\r\n/* Scalar evolution analysis cache. */\r\ntypedef struct ScEvEntry {\r\n  MRef pc;\t\t/* Bytecode PC of FORI. */\r\n  IRRef1 idx;\t\t/* Index reference. */\r\n  IRRef1 start;\t\t/* Constant start reference. */\r\n  IRRef1 stop;\t\t/* Constant stop reference. */\r\n  IRRef1 step;\t\t/* Constant step reference. */\r\n  IRType1 t;\t\t/* Scalar type. */\r\n  uint8_t dir;\t\t/* Direction. 1: +, 0: -. */\r\n} ScEvEntry;\r\n\r\n/* Reverse bytecode map (IRRef -> PC). Only for selected instructions. */\r\ntypedef struct RBCHashEntry {\r\n  MRef pc;\t\t/* Bytecode PC. */\r\n  GCRef pt;\t\t/* Prototype. */\r\n  IRRef ref;\t\t/* IR reference. */\r\n} RBCHashEntry;\r\n\r\n/* Number of slots in the reverse bytecode hash table. Must be a power of 2. */\r\n#define RBCHASH_SLOTS\t8\r\n\r\n/* 128 bit SIMD constants. */\r\nenum {\r\n  LJ_KSIMD_ABS,\r\n  LJ_KSIMD_NEG,\r\n  LJ_KSIMD__MAX\r\n};\r\n\r\n/* Get 16 byte aligned pointer to SIMD constant. */\r\n#define LJ_KSIMD(J, n) \\\r\n  ((TValue *)(((intptr_t)&J->ksimd[2*(n)] + 15) & ~(intptr_t)15))\r\n\r\n/* Set/reset flag to activate the SPLIT pass for the current trace. */\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n#define lj_needsplit(J)\t\t(J->needsplit = 1)\r\n#define lj_resetsplit(J)\t(J->needsplit = 0)\r\n#else\r\n#define lj_needsplit(J)\t\tUNUSED(J)\r\n#define lj_resetsplit(J)\tUNUSED(J)\r\n#endif\r\n\r\n/* Fold state is used to fold instructions on-the-fly. */\r\ntypedef struct FoldState {\r\n  IRIns ins;\t\t/* Currently emitted instruction. */\r\n  IRIns left;\t\t/* Instruction referenced by left operand. */\r\n  IRIns right;\t\t/* Instruction referenced by right operand. */\r\n} FoldState;\r\n\r\n/* JIT compiler state. */\r\ntypedef struct jit_State {\r\n  GCtrace cur;\t\t/* Current trace. */\r\n\r\n  lua_State *L;\t\t/* Current Lua state. */\r\n  const BCIns *pc;\t/* Current PC. */\r\n  GCfunc *fn;\t\t/* Current function. */\r\n  GCproto *pt;\t\t/* Current prototype. */\r\n  TRef *base;\t\t/* Current frame base, points into J->slots. */\r\n\r\n  uint32_t flags;\t/* JIT engine flags. */\r\n  BCReg maxslot;\t/* Relative to baseslot. */\r\n  BCReg baseslot;\t/* Current frame base, offset into J->slots. */\r\n\r\n  uint8_t mergesnap;\t/* Allowed to merge with next snapshot. */\r\n  uint8_t needsnap;\t/* Need snapshot before recording next bytecode. */\r\n  IRType1 guardemit;\t/* Accumulated IRT_GUARD for emitted instructions. */\r\n  uint8_t bcskip;\t/* Number of bytecode instructions to skip. */\r\n\r\n  FoldState fold;\t/* Fold state. */\r\n\r\n  const BCIns *bc_min;\t/* Start of allowed bytecode range for root trace. */\r\n  MSize bc_extent;\t/* Extent of the range. */\r\n\r\n  TraceState state;\t/* Trace compiler state. */\r\n\r\n  int32_t instunroll;\t/* Unroll counter for instable loops. */\r\n  int32_t loopunroll;\t/* Unroll counter for loop ops in side traces. */\r\n  int32_t tailcalled;\t/* Number of successive tailcalls. */\r\n  int32_t framedepth;\t/* Current frame depth. */\r\n  int32_t retdepth;\t/* Return frame depth (count of RETF). */\r\n\r\n  MRef k64;\t\t/* Pointer to chained array of 64 bit constants. */\r\n  TValue ksimd[LJ_KSIMD__MAX*2+1];  /* 16 byte aligned SIMD constants. */\r\n\r\n  IRIns *irbuf;\t\t/* Temp. IR instruction buffer. Biased with REF_BIAS. */\r\n  IRRef irtoplim;\t/* Upper limit of instuction buffer (biased). */\r\n  IRRef irbotlim;\t/* Lower limit of instuction buffer (biased). */\r\n  IRRef loopref;\t/* Last loop reference or ref of final LOOP (or 0). */\r\n\r\n  MSize sizesnap;\t/* Size of temp. snapshot buffer. */\r\n  SnapShot *snapbuf;\t/* Temp. snapshot buffer. */\r\n  SnapEntry *snapmapbuf;  /* Temp. snapshot map buffer. */\r\n  MSize sizesnapmap;\t/* Size of temp. snapshot map buffer. */\r\n\r\n  PostProc postproc;\t/* Required post-processing after execution. */\r\n#if LJ_SOFTFP || (LJ_32 && LJ_HASFFI)\r\n  uint8_t needsplit;\t/* Need SPLIT pass. */\r\n#endif\r\n  uint8_t retryrec;\t/* Retry recording. */\r\n\r\n  GCRef *trace;\t\t/* Array of traces. */\r\n  TraceNo freetrace;\t/* Start of scan for next free trace. */\r\n  MSize sizetrace;\t/* Size of trace array. */\r\n\r\n  IRRef1 chain[IR__MAX];  /* IR instruction skip-list chain anchors. */\r\n  TRef slot[LJ_MAX_JSLOTS+LJ_STACK_EXTRA];  /* Stack slot map. */\r\n\r\n  int32_t param[JIT_P__MAX];  /* JIT engine parameters. */\r\n\r\n  MCode *exitstubgroup[LJ_MAX_EXITSTUBGR];  /* Exit stub group addresses. */\r\n\r\n  HotPenalty penalty[PENALTY_SLOTS];  /* Penalty slots. */\r\n  uint32_t penaltyslot;\t/* Round-robin index into penalty slots. */\r\n  uint32_t prngstate;\t/* PRNG state. */\r\n\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n  RBCHashEntry rbchash[RBCHASH_SLOTS];  /* Reverse bytecode map. */\r\n#endif\r\n\r\n  BPropEntry bpropcache[BPROP_SLOTS];  /* Backpropagation cache slots. */\r\n  uint32_t bpropslot;\t/* Round-robin index into bpropcache slots. */\r\n\r\n  ScEvEntry scev;\t/* Scalar evolution analysis cache slots. */\r\n\r\n  const BCIns *startpc;\t/* Bytecode PC of starting instruction. */\r\n  TraceNo parent;\t/* Parent of current side trace (0 for root traces). */\r\n  ExitNo exitno;\t/* Exit number in parent of current side trace. */\r\n\r\n  BCIns *patchpc;\t/* PC for pending re-patch. */\r\n  BCIns patchins;\t/* Instruction for pending re-patch. */\r\n\r\n  int mcprot;\t\t/* Protection of current mcode area. */\r\n  MCode *mcarea;\t/* Base of current mcode area. */\r\n  MCode *mctop;\t\t/* Top of current mcode area. */\r\n  MCode *mcbot;\t\t/* Bottom of current mcode area. */\r\n  size_t szmcarea;\t/* Size of current mcode area. */\r\n  size_t szallmcarea;\t/* Total size of all allocated mcode areas. */\r\n\r\n  TValue errinfo;\t/* Additional info element for trace errors. */\r\n\r\n#if LJ_HASPROFILE\r\n  GCproto *prev_pt;\t/* Previous prototype. */\r\n  BCLine prev_line;\t/* Previous line. */\r\n  int prof_mode;\t/* Profiling mode: 0, 'f', 'l'. */\r\n#endif\r\n}\r\n#if LJ_TARGET_ARM\r\nLJ_ALIGN(16)\t\t/* For DISPATCH-relative addresses in assembler part. */\r\n#endif\r\njit_State;\r\n\r\n/* Trivial PRNG e.g. used for penalty randomization. */\r\nstatic LJ_AINLINE uint32_t LJ_PRNG_BITS(jit_State *J, int bits)\r\n{\r\n  /* Yes, this LCG is very weak, but that doesn't matter for our use case. */\r\n  J->prngstate = J->prngstate * 1103515245 + 12345;\r\n  return J->prngstate >> (32-bits);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_lex.c",
    "content": "/*\r\n** Lexical analyzer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_lex_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_tab.h\"\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#include \"lualib.h\"\r\n#endif\r\n#include \"lj_state.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_parse.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* Lua lexer token names. */\r\nstatic const char *const tokennames[] = {\r\n#define TKSTR1(name)\t\t#name,\r\n#define TKSTR2(name, sym)\t#sym,\r\nTKDEF(TKSTR1, TKSTR2)\r\n#undef TKSTR1\r\n#undef TKSTR2\r\n  NULL\r\n};\r\n\r\n/* -- Buffer handling ----------------------------------------------------- */\r\n\r\n#define LEX_EOF\t\t\t(-1)\r\n#define lex_iseol(ls)\t\t(ls->c == '\\n' || ls->c == '\\r')\r\n\r\n/* Get more input from reader. */\r\nstatic LJ_NOINLINE LexChar lex_more(LexState *ls)\r\n{\r\n  size_t sz;\r\n  const char *p = ls->rfunc(ls->L, ls->rdata, &sz);\r\n  if (p == NULL || sz == 0) return LEX_EOF;\r\n  ls->pe = p + sz;\r\n  ls->p = p + 1;\r\n  return (LexChar)(uint8_t)p[0];\r\n}\r\n\r\n/* Get next character. */\r\nstatic LJ_AINLINE LexChar lex_next(LexState *ls)\r\n{\r\n  return (ls->c = ls->p < ls->pe ? (LexChar)(uint8_t)*ls->p++ : lex_more(ls));\r\n}\r\n\r\n/* Save character. */\r\nstatic LJ_AINLINE void lex_save(LexState *ls, LexChar c)\r\n{\r\n  lj_buf_putb(&ls->sb, c);\r\n}\r\n\r\n/* Save previous character and get next character. */\r\nstatic LJ_AINLINE LexChar lex_savenext(LexState *ls)\r\n{\r\n  lex_save(ls, ls->c);\r\n  return lex_next(ls);\r\n}\r\n\r\n/* Skip line break. Handles \"\\n\", \"\\r\", \"\\r\\n\" or \"\\n\\r\". */\r\nstatic void lex_newline(LexState *ls)\r\n{\r\n  LexChar old = ls->c;\r\n  lua_assert(lex_iseol(ls));\r\n  lex_next(ls);  /* Skip \"\\n\" or \"\\r\". */\r\n  if (lex_iseol(ls) && ls->c != old) lex_next(ls);  /* Skip \"\\n\\r\" or \"\\r\\n\". */\r\n  if (++ls->linenumber >= LJ_MAX_LINE)\r\n    lj_lex_error(ls, ls->tok, LJ_ERR_XLINES);\r\n}\r\n\r\n/* -- Scanner for terminals ----------------------------------------------- */\r\n\r\n/* Parse a number literal. */\r\nstatic void lex_number(LexState *ls, TValue *tv)\r\n{\r\n  StrScanFmt fmt;\r\n  LexChar c, xp = 'e';\r\n  lua_assert(lj_char_isdigit(ls->c));\r\n  if ((c = ls->c) == '0' && (lex_savenext(ls) | 0x20) == 'x')\r\n    xp = 'p';\r\n  while (lj_char_isident(ls->c) || ls->c == '.' ||\r\n\t ((ls->c == '-' || ls->c == '+') && (c | 0x20) == xp)) {\r\n    c = ls->c;\r\n    lex_savenext(ls);\r\n  }\r\n  lex_save(ls, '\\0');\r\n  fmt = lj_strscan_scan((const uint8_t *)sbufB(&ls->sb), tv,\r\n\t  (LJ_DUALNUM ? STRSCAN_OPT_TOINT : STRSCAN_OPT_TONUM) |\r\n\t  (LJ_HASFFI ? (STRSCAN_OPT_LL|STRSCAN_OPT_IMAG) : 0));\r\n  if (LJ_DUALNUM && fmt == STRSCAN_INT) {\r\n    setitype(tv, LJ_TISNUM);\r\n  } else if (fmt == STRSCAN_NUM) {\r\n    /* Already in correct format. */\r\n#if LJ_HASFFI\r\n  } else if (fmt != STRSCAN_ERROR) {\r\n    lua_State *L = ls->L;\r\n    GCcdata *cd;\r\n    lua_assert(fmt == STRSCAN_I64 || fmt == STRSCAN_U64 || fmt == STRSCAN_IMAG);\r\n    if (!ctype_ctsG(G(L))) {\r\n      ptrdiff_t oldtop = savestack(L, L->top);\r\n      luaopen_ffi(L);  /* Load FFI library on-demand. */\r\n      L->top = restorestack(L, oldtop);\r\n    }\r\n    if (fmt == STRSCAN_IMAG) {\r\n      cd = lj_cdata_new_(L, CTID_COMPLEX_DOUBLE, 2*sizeof(double));\r\n      ((double *)cdataptr(cd))[0] = 0;\r\n      ((double *)cdataptr(cd))[1] = numV(tv);\r\n    } else {\r\n      cd = lj_cdata_new_(L, fmt==STRSCAN_I64 ? CTID_INT64 : CTID_UINT64, 8);\r\n      *(uint64_t *)cdataptr(cd) = tv->u64;\r\n    }\r\n    lj_parse_keepcdata(ls, tv, cd);\r\n#endif\r\n  } else {\r\n    lua_assert(fmt == STRSCAN_ERROR);\r\n    lj_lex_error(ls, TK_number, LJ_ERR_XNUMBER);\r\n  }\r\n}\r\n\r\n/* Skip equal signs for \"[=...=[\" and \"]=...=]\" and return their count. */\r\nstatic int lex_skipeq(LexState *ls)\r\n{\r\n  int count = 0;\r\n  LexChar s = ls->c;\r\n  lua_assert(s == '[' || s == ']');\r\n  while (lex_savenext(ls) == '=')\r\n    count++;\r\n  return (ls->c == s) ? count : (-count) - 1;\r\n}\r\n\r\n/* Parse a long string or long comment (tv set to NULL). */\r\nstatic void lex_longstring(LexState *ls, TValue *tv, int sep)\r\n{\r\n  lex_savenext(ls);  /* Skip second '['. */\r\n  if (lex_iseol(ls))  /* Skip initial newline. */\r\n    lex_newline(ls);\r\n  for (;;) {\r\n    switch (ls->c) {\r\n    case LEX_EOF:\r\n      lj_lex_error(ls, TK_eof, tv ? LJ_ERR_XLSTR : LJ_ERR_XLCOM);\r\n      break;\r\n    case ']':\r\n      if (lex_skipeq(ls) == sep) {\r\n\tlex_savenext(ls);  /* Skip second ']'. */\r\n\tgoto endloop;\r\n      }\r\n      break;\r\n    case '\\n':\r\n    case '\\r':\r\n      lex_save(ls, '\\n');\r\n      lex_newline(ls);\r\n      if (!tv) lj_buf_reset(&ls->sb);  /* Don't waste space for comments. */\r\n      break;\r\n    default:\r\n      lex_savenext(ls);\r\n      break;\r\n    }\r\n  } endloop:\r\n  if (tv) {\r\n    GCstr *str = lj_parse_keepstr(ls, sbufB(&ls->sb) + (2 + (MSize)sep),\r\n\t\t\t\t      sbuflen(&ls->sb) - 2*(2 + (MSize)sep));\r\n    setstrV(ls->L, tv, str);\r\n  }\r\n}\r\n\r\n/* Parse a string. */\r\nstatic void lex_string(LexState *ls, TValue *tv)\r\n{\r\n  LexChar delim = ls->c;  /* Delimiter is '\\'' or '\"'. */\r\n  lex_savenext(ls);\r\n  while (ls->c != delim) {\r\n    switch (ls->c) {\r\n    case LEX_EOF:\r\n      lj_lex_error(ls, TK_eof, LJ_ERR_XSTR);\r\n      continue;\r\n    case '\\n':\r\n    case '\\r':\r\n      lj_lex_error(ls, TK_string, LJ_ERR_XSTR);\r\n      continue;\r\n    case '\\\\': {\r\n      LexChar c = lex_next(ls);  /* Skip the '\\\\'. */\r\n      switch (c) {\r\n      case 'a': c = '\\a'; break;\r\n      case 'b': c = '\\b'; break;\r\n      case 'f': c = '\\f'; break;\r\n      case 'n': c = '\\n'; break;\r\n      case 'r': c = '\\r'; break;\r\n      case 't': c = '\\t'; break;\r\n      case 'v': c = '\\v'; break;\r\n      case 'x':  /* Hexadecimal escape '\\xXX'. */\r\n\tc = (lex_next(ls) & 15u) << 4;\r\n\tif (!lj_char_isdigit(ls->c)) {\r\n\t  if (!lj_char_isxdigit(ls->c)) goto err_xesc;\r\n\t  c += 9 << 4;\r\n\t}\r\n\tc += (lex_next(ls) & 15u);\r\n\tif (!lj_char_isdigit(ls->c)) {\r\n\t  if (!lj_char_isxdigit(ls->c)) goto err_xesc;\r\n\t  c += 9;\r\n\t}\r\n\tbreak;\r\n      case 'z':  /* Skip whitespace. */\r\n\tlex_next(ls);\r\n\twhile (lj_char_isspace(ls->c))\r\n\t  if (lex_iseol(ls)) lex_newline(ls); else lex_next(ls);\r\n\tcontinue;\r\n      case '\\n': case '\\r': lex_save(ls, '\\n'); lex_newline(ls); continue;\r\n      case '\\\\': case '\\\"': case '\\'': break;\r\n      case LEX_EOF: continue;\r\n      default:\r\n\tif (!lj_char_isdigit(c))\r\n\t  goto err_xesc;\r\n\tc -= '0';  /* Decimal escape '\\ddd'. */\r\n\tif (lj_char_isdigit(lex_next(ls))) {\r\n\t  c = c*10 + (ls->c - '0');\r\n\t  if (lj_char_isdigit(lex_next(ls))) {\r\n\t    c = c*10 + (ls->c - '0');\r\n\t    if (c > 255) {\r\n\t    err_xesc:\r\n\t      lj_lex_error(ls, TK_string, LJ_ERR_XESC);\r\n\t    }\r\n\t    lex_next(ls);\r\n\t  }\r\n\t}\r\n\tlex_save(ls, c);\r\n\tcontinue;\r\n      }\r\n      lex_save(ls, c);\r\n      lex_next(ls);\r\n      continue;\r\n      }\r\n    default:\r\n      lex_savenext(ls);\r\n      break;\r\n    }\r\n  }\r\n  lex_savenext(ls);  /* Skip trailing delimiter. */\r\n  setstrV(ls->L, tv,\r\n\t  lj_parse_keepstr(ls, sbufB(&ls->sb)+1, sbuflen(&ls->sb)-2));\r\n}\r\n\r\n/* -- Main lexical scanner ------------------------------------------------ */\r\n\r\n/* Get next lexical token. */\r\nstatic LexToken lex_scan(LexState *ls, TValue *tv)\r\n{\r\n  lj_buf_reset(&ls->sb);\r\n  for (;;) {\r\n    if (lj_char_isident(ls->c)) {\r\n      GCstr *s;\r\n      if (lj_char_isdigit(ls->c)) {  /* Numeric literal. */\r\n\tlex_number(ls, tv);\r\n\treturn TK_number;\r\n      }\r\n      /* Identifier or reserved word. */\r\n      do {\r\n\tlex_savenext(ls);\r\n      } while (lj_char_isident(ls->c));\r\n      s = lj_parse_keepstr(ls, sbufB(&ls->sb), sbuflen(&ls->sb));\r\n      setstrV(ls->L, tv, s);\r\n      if (s->reserved > 0)  /* Reserved word? */\r\n\treturn TK_OFS + s->reserved;\r\n      return TK_name;\r\n    }\r\n    switch (ls->c) {\r\n    case '\\n':\r\n    case '\\r':\r\n      lex_newline(ls);\r\n      continue;\r\n    case ' ':\r\n    case '\\t':\r\n    case '\\v':\r\n    case '\\f':\r\n      lex_next(ls);\r\n      continue;\r\n    case '-':\r\n      lex_next(ls);\r\n      if (ls->c != '-') return '-';\r\n      lex_next(ls);\r\n      if (ls->c == '[') {  /* Long comment \"--[=*[...]=*]\". */\r\n\tint sep = lex_skipeq(ls);\r\n\tlj_buf_reset(&ls->sb);  /* `lex_skipeq' may dirty the buffer */\r\n\tif (sep >= 0) {\r\n\t  lex_longstring(ls, NULL, sep);\r\n\t  lj_buf_reset(&ls->sb);\r\n\t  continue;\r\n\t}\r\n      }\r\n      /* Short comment \"--.*\\n\". */\r\n      while (!lex_iseol(ls) && ls->c != LEX_EOF)\r\n\tlex_next(ls);\r\n      continue;\r\n    case '[': {\r\n      int sep = lex_skipeq(ls);\r\n      if (sep >= 0) {\r\n\tlex_longstring(ls, tv, sep);\r\n\treturn TK_string;\r\n      } else if (sep == -1) {\r\n\treturn '[';\r\n      } else {\r\n\tlj_lex_error(ls, TK_string, LJ_ERR_XLDELIM);\r\n\tcontinue;\r\n      }\r\n      }\r\n    case '=':\r\n      lex_next(ls);\r\n      if (ls->c != '=') return '='; else { lex_next(ls); return TK_eq; }\r\n    case '<':\r\n      lex_next(ls);\r\n      if (ls->c != '=') return '<'; else { lex_next(ls); return TK_le; }\r\n    case '>':\r\n      lex_next(ls);\r\n      if (ls->c != '=') return '>'; else { lex_next(ls); return TK_ge; }\r\n    case '~':\r\n      lex_next(ls);\r\n      if (ls->c != '=') return '~'; else { lex_next(ls); return TK_ne; }\r\n    case ':':\r\n      lex_next(ls);\r\n      if (ls->c != ':') return ':'; else { lex_next(ls); return TK_label; }\r\n    case '\"':\r\n    case '\\'':\r\n      lex_string(ls, tv);\r\n      return TK_string;\r\n    case '.':\r\n      if (lex_savenext(ls) == '.') {\r\n\tlex_next(ls);\r\n\tif (ls->c == '.') {\r\n\t  lex_next(ls);\r\n\t  return TK_dots;   /* ... */\r\n\t}\r\n\treturn TK_concat;   /* .. */\r\n      } else if (!lj_char_isdigit(ls->c)) {\r\n\treturn '.';\r\n      } else {\r\n\tlex_number(ls, tv);\r\n\treturn TK_number;\r\n      }\r\n    case LEX_EOF:\r\n      return TK_eof;\r\n    default: {\r\n      LexChar c = ls->c;\r\n      lex_next(ls);\r\n      return c;  /* Single-char tokens (+ - / ...). */\r\n    }\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Lexer API ----------------------------------------------------------- */\r\n\r\n/* Setup lexer state. */\r\nint lj_lex_setup(lua_State *L, LexState *ls)\r\n{\r\n  int header = 0;\r\n  ls->L = L;\r\n  ls->fs = NULL;\r\n  ls->pe = ls->p = NULL;\r\n  ls->vstack = NULL;\r\n  ls->sizevstack = 0;\r\n  ls->vtop = 0;\r\n  ls->bcstack = NULL;\r\n  ls->sizebcstack = 0;\r\n  ls->tok = 0;\r\n  ls->lookahead = TK_eof;  /* No look-ahead token. */\r\n  ls->linenumber = 1;\r\n  ls->lastline = 1;\r\n  lex_next(ls);  /* Read-ahead first char. */\r\n  if (ls->c == 0xef && ls->p + 2 <= ls->pe && (uint8_t)ls->p[0] == 0xbb &&\r\n      (uint8_t)ls->p[1] == 0xbf) {  /* Skip UTF-8 BOM (if buffered). */\r\n    ls->p += 2;\r\n    lex_next(ls);\r\n    header = 1;\r\n  }\r\n  if (ls->c == '#') {  /* Skip POSIX #! header line. */\r\n    do {\r\n      lex_next(ls);\r\n      if (ls->c == LEX_EOF) return 0;\r\n    } while (!lex_iseol(ls));\r\n    lex_newline(ls);\r\n    header = 1;\r\n  }\r\n  if (ls->c == LUA_SIGNATURE[0]) {  /* Bytecode dump. */\r\n    if (header) {\r\n      /*\r\n      ** Loading bytecode with an extra header is disabled for security\r\n      ** reasons. This may circumvent the usual check for bytecode vs.\r\n      ** Lua code by looking at the first char. Since this is a potential\r\n      ** security violation no attempt is made to echo the chunkname either.\r\n      */\r\n      setstrV(L, L->top++, lj_err_str(L, LJ_ERR_BCBAD));\r\n      lj_err_throw(L, LUA_ERRSYNTAX);\r\n    }\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Cleanup lexer state. */\r\nvoid lj_lex_cleanup(lua_State *L, LexState *ls)\r\n{\r\n  global_State *g = G(L);\r\n  lj_mem_freevec(g, ls->bcstack, ls->sizebcstack, BCInsLine);\r\n  lj_mem_freevec(g, ls->vstack, ls->sizevstack, VarInfo);\r\n  lj_buf_free(g, &ls->sb);\r\n}\r\n\r\n/* Return next lexical token. */\r\nvoid lj_lex_next(LexState *ls)\r\n{\r\n  ls->lastline = ls->linenumber;\r\n  if (LJ_LIKELY(ls->lookahead == TK_eof)) {  /* No lookahead token? */\r\n    ls->tok = lex_scan(ls, &ls->tokval);  /* Get next token. */\r\n  } else {  /* Otherwise return lookahead token. */\r\n    ls->tok = ls->lookahead;\r\n    ls->lookahead = TK_eof;\r\n    ls->tokval = ls->lookaheadval;\r\n  }\r\n}\r\n\r\n/* Look ahead for the next token. */\r\nLexToken lj_lex_lookahead(LexState *ls)\r\n{\r\n  lua_assert(ls->lookahead == TK_eof);\r\n  ls->lookahead = lex_scan(ls, &ls->lookaheadval);\r\n  return ls->lookahead;\r\n}\r\n\r\n/* Convert token to string. */\r\nconst char *lj_lex_token2str(LexState *ls, LexToken tok)\r\n{\r\n  if (tok > TK_OFS)\r\n    return tokennames[tok-TK_OFS-1];\r\n  else if (!lj_char_iscntrl(tok))\r\n    return lj_strfmt_pushf(ls->L, \"%c\", tok);\r\n  else\r\n    return lj_strfmt_pushf(ls->L, \"char(%d)\", tok);\r\n}\r\n\r\n/* Lexer error. */\r\nvoid lj_lex_error(LexState *ls, LexToken tok, ErrMsg em, ...)\r\n{\r\n  const char *tokstr;\r\n  va_list argp;\r\n  if (tok == 0) {\r\n    tokstr = NULL;\r\n  } else if (tok == TK_name || tok == TK_string || tok == TK_number) {\r\n    lex_save(ls, '\\0');\r\n    tokstr = sbufB(&ls->sb);\r\n  } else {\r\n    tokstr = lj_lex_token2str(ls, tok);\r\n  }\r\n  va_start(argp, em);\r\n  lj_err_lex(ls->L, ls->chunkname, tokstr, ls->linenumber, em, argp);\r\n  va_end(argp);\r\n}\r\n\r\n/* Initialize strings for reserved words. */\r\nvoid lj_lex_init(lua_State *L)\r\n{\r\n  uint32_t i;\r\n  for (i = 0; i < TK_RESERVED; i++) {\r\n    GCstr *s = lj_str_newz(L, tokennames[i]);\r\n    fixstring(s);  /* Reserved words are never collected. */\r\n    s->reserved = (uint8_t)(i+1);\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_lex.h",
    "content": "/*\r\n** Lexical analyzer.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_LEX_H\r\n#define _LJ_LEX_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_err.h\"\r\n\r\n/* Lua lexer tokens. */\r\n#define TKDEF(_, __) \\\r\n  _(and) _(break) _(do) _(else) _(elseif) _(end) _(false) \\\r\n  _(for) _(function) _(goto) _(if) _(in) _(local) _(nil) _(not) _(or) \\\r\n  _(repeat) _(return) _(then) _(true) _(until) _(while) \\\r\n  __(concat, ..) __(dots, ...) __(eq, ==) __(ge, >=) __(le, <=) __(ne, ~=) \\\r\n  __(label, ::) __(number, <number>) __(name, <name>) __(string, <string>) \\\r\n  __(eof, <eof>)\r\n\r\nenum {\r\n  TK_OFS = 256,\r\n#define TKENUM1(name)\t\tTK_##name,\r\n#define TKENUM2(name, sym)\tTK_##name,\r\nTKDEF(TKENUM1, TKENUM2)\r\n#undef TKENUM1\r\n#undef TKENUM2\r\n  TK_RESERVED = TK_while - TK_OFS\r\n};\r\n\r\ntypedef int LexChar;\t/* Lexical character. Unsigned ext. from char. */\r\ntypedef int LexToken;\t/* Lexical token. */\r\n\r\n/* Combined bytecode ins/line. Only used during bytecode generation. */\r\ntypedef struct BCInsLine {\r\n  BCIns ins;\t\t/* Bytecode instruction. */\r\n  BCLine line;\t\t/* Line number for this bytecode. */\r\n} BCInsLine;\r\n\r\n/* Info for local variables. Only used during bytecode generation. */\r\ntypedef struct VarInfo {\r\n  GCRef name;\t\t/* Local variable name or goto/label name. */\r\n  BCPos startpc;\t/* First point where the local variable is active. */\r\n  BCPos endpc;\t\t/* First point where the local variable is dead. */\r\n  uint8_t slot;\t\t/* Variable slot. */\r\n  uint8_t info;\t\t/* Variable/goto/label info. */\r\n} VarInfo;\r\n\r\n/* Lua lexer state. */\r\ntypedef struct LexState {\r\n  struct FuncState *fs;\t/* Current FuncState. Defined in lj_parse.c. */\r\n  struct lua_State *L;\t/* Lua state. */\r\n  TValue tokval;\t/* Current token value. */\r\n  TValue lookaheadval;\t/* Lookahead token value. */\r\n  const char *p;\t/* Current position in input buffer. */\r\n  const char *pe;\t/* End of input buffer. */\r\n  LexChar c;\t\t/* Current character. */\r\n  LexToken tok;\t\t/* Current token. */\r\n  LexToken lookahead;\t/* Lookahead token. */\r\n  SBuf sb;\t\t/* String buffer for tokens. */\r\n  lua_Reader rfunc;\t/* Reader callback. */\r\n  void *rdata;\t\t/* Reader callback data. */\r\n  BCLine linenumber;\t/* Input line counter. */\r\n  BCLine lastline;\t/* Line of last token. */\r\n  GCstr *chunkname;\t/* Current chunk name (interned string). */\r\n  const char *chunkarg;\t/* Chunk name argument. */\r\n  const char *mode;\t/* Allow loading bytecode (b) and/or source text (t). */\r\n  VarInfo *vstack;\t/* Stack for names and extents of local variables. */\r\n  MSize sizevstack;\t/* Size of variable stack. */\r\n  MSize vtop;\t\t/* Top of variable stack. */\r\n  BCInsLine *bcstack;\t/* Stack for bytecode instructions/line numbers. */\r\n  MSize sizebcstack;\t/* Size of bytecode stack. */\r\n  uint32_t level;\t/* Syntactical nesting level. */\r\n} LexState;\r\n\r\nLJ_FUNC int lj_lex_setup(lua_State *L, LexState *ls);\r\nLJ_FUNC void lj_lex_cleanup(lua_State *L, LexState *ls);\r\nLJ_FUNC void lj_lex_next(LexState *ls);\r\nLJ_FUNC LexToken lj_lex_lookahead(LexState *ls);\r\nLJ_FUNC const char *lj_lex_token2str(LexState *ls, LexToken tok);\r\nLJ_FUNC_NORET void lj_lex_error(LexState *ls, LexToken tok, ErrMsg em, ...);\r\nLJ_FUNC void lj_lex_init(lua_State *L);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_lib.c",
    "content": "/*\r\n** Library function support.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_lib_c\r\n#define LUA_CORE\r\n\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- Library initialization ---------------------------------------------- */\r\n\r\nstatic GCtab *lib_create_table(lua_State *L, const char *libname, int hsize)\r\n{\r\n  if (libname) {\r\n    luaL_findtable(L, LUA_REGISTRYINDEX, \"_LOADED\", 16);\r\n    lua_getfield(L, -1, libname);\r\n    if (!tvistab(L->top-1)) {\r\n      L->top--;\r\n      if (luaL_findtable(L, LUA_GLOBALSINDEX, libname, hsize) != NULL)\r\n\tlj_err_callerv(L, LJ_ERR_BADMODN, libname);\r\n      settabV(L, L->top, tabV(L->top-1));\r\n      L->top++;\r\n      lua_setfield(L, -3, libname);  /* _LOADED[libname] = new table */\r\n    }\r\n    L->top--;\r\n    settabV(L, L->top-1, tabV(L->top));\r\n  } else {\r\n    lua_createtable(L, 0, hsize);\r\n  }\r\n  return tabV(L->top-1);\r\n}\r\n\r\nstatic const uint8_t *lib_read_lfunc(lua_State *L, const uint8_t *p, GCtab *tab)\r\n{\r\n  int len = *p++;\r\n  GCstr *name = lj_str_new(L, (const char *)p, len);\r\n  LexState ls;\r\n  GCproto *pt;\r\n  GCfunc *fn;\r\n  memset(&ls, 0, sizeof(ls));\r\n  ls.L = L;\r\n  ls.p = (const char *)(p+len);\r\n  ls.pe = (const char *)~(uintptr_t)0;\r\n  ls.c = -1;\r\n  ls.level = (BCDUMP_F_STRIP|(LJ_BE*BCDUMP_F_BE));\r\n  ls.chunkname = name;\r\n  pt = lj_bcread_proto(&ls);\r\n  pt->firstline = ~(BCLine)0;\r\n  fn = lj_func_newL_empty(L, pt, tabref(L->env));\r\n  /* NOBARRIER: See below for common barrier. */\r\n  setfuncV(L, lj_tab_setstr(L, tab, name), fn);\r\n  return (const uint8_t *)ls.p;\r\n}\r\n\r\nvoid lj_lib_register(lua_State *L, const char *libname,\r\n\t\t     const uint8_t *p, const lua_CFunction *cf)\r\n{\r\n  GCtab *env = tabref(L->env);\r\n  GCfunc *ofn = NULL;\r\n  int ffid = *p++;\r\n  BCIns *bcff = &L2GG(L)->bcff[*p++];\r\n  GCtab *tab = lib_create_table(L, libname, *p++);\r\n  ptrdiff_t tpos = L->top - L->base;\r\n\r\n  /* Avoid barriers further down. */\r\n  lj_gc_anybarriert(L, tab);\r\n  tab->nomm = 0;\r\n\r\n  for (;;) {\r\n    uint32_t tag = *p++;\r\n    MSize len = tag & LIBINIT_LENMASK;\r\n    tag &= LIBINIT_TAGMASK;\r\n    if (tag != LIBINIT_STRING) {\r\n      const char *name;\r\n      MSize nuv = (MSize)(L->top - L->base - tpos);\r\n      GCfunc *fn = lj_func_newC(L, nuv, env);\r\n      if (nuv) {\r\n\tL->top = L->base + tpos;\r\n\tmemcpy(fn->c.upvalue, L->top, sizeof(TValue)*nuv);\r\n      }\r\n      fn->c.ffid = (uint8_t)(ffid++);\r\n      name = (const char *)p;\r\n      p += len;\r\n      if (tag == LIBINIT_CF)\r\n\tsetmref(fn->c.pc, &G(L)->bc_cfunc_int);\r\n      else\r\n\tsetmref(fn->c.pc, bcff++);\r\n      if (tag == LIBINIT_ASM_)\r\n\tfn->c.f = ofn->c.f;  /* Copy handler from previous function. */\r\n      else\r\n\tfn->c.f = *cf++;  /* Get cf or handler from C function table. */\r\n      if (len) {\r\n\t/* NOBARRIER: See above for common barrier. */\r\n\tsetfuncV(L, lj_tab_setstr(L, tab, lj_str_new(L, name, len)), fn);\r\n      }\r\n      ofn = fn;\r\n    } else {\r\n      switch (tag | len) {\r\n      case LIBINIT_LUA:\r\n\tp = lib_read_lfunc(L, p, tab);\r\n\tbreak;\r\n      case LIBINIT_SET:\r\n\tL->top -= 2;\r\n\tif (tvisstr(L->top+1) && strV(L->top+1)->len == 0)\r\n\t  env = tabV(L->top);\r\n\telse  /* NOBARRIER: See above for common barrier. */\r\n\t  copyTV(L, lj_tab_set(L, tab, L->top+1), L->top);\r\n\tbreak;\r\n      case LIBINIT_NUMBER:\r\n\tmemcpy(&L->top->n, p, sizeof(double));\r\n\tL->top++;\r\n\tp += sizeof(double);\r\n\tbreak;\r\n      case LIBINIT_COPY:\r\n\tcopyTV(L, L->top, L->top - *p++);\r\n\tL->top++;\r\n\tbreak;\r\n      case LIBINIT_LASTCL:\r\n\tsetfuncV(L, L->top++, ofn);\r\n\tbreak;\r\n      case LIBINIT_FFID:\r\n\tffid++;\r\n\tbreak;\r\n      case LIBINIT_END:\r\n\treturn;\r\n      default:\r\n\tsetstrV(L, L->top++, lj_str_new(L, (const char *)p, len));\r\n\tp += len;\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Push internal function on the stack. */\r\nGCfunc *lj_lib_pushcc(lua_State *L, lua_CFunction f, int id, int n)\r\n{\r\n  GCfunc *fn;\r\n  lua_pushcclosure(L, f, n);\r\n  fn = funcV(L->top-1);\r\n  fn->c.ffid = (uint8_t)id;\r\n  setmref(fn->c.pc, &G(L)->bc_cfunc_int);\r\n  return fn;\r\n}\r\n\r\nvoid lj_lib_prereg(lua_State *L, const char *name, lua_CFunction f, GCtab *env)\r\n{\r\n  luaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\", 4);\r\n  lua_pushcfunction(L, f);\r\n  /* NOBARRIER: The function is new (marked white). */\r\n  setgcref(funcV(L->top-1)->c.env, obj2gco(env));\r\n  lua_setfield(L, -2, name);\r\n  L->top--;\r\n}\r\n\r\nint lj_lib_postreg(lua_State *L, lua_CFunction cf, int id, const char *name)\r\n{\r\n  GCfunc *fn = lj_lib_pushcf(L, cf, id);\r\n  GCtab *t = tabref(curr_func(L)->c.env);  /* Reference to parent table. */\r\n  setfuncV(L, lj_tab_setstr(L, t, lj_str_newz(L, name)), fn);\r\n  lj_gc_anybarriert(L, t);\r\n  setfuncV(L, L->top++, fn);\r\n  return 1;\r\n}\r\n\r\n/* -- Type checks --------------------------------------------------------- */\r\n\r\nTValue *lj_lib_checkany(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o >= L->top)\r\n    lj_err_arg(L, narg, LJ_ERR_NOVAL);\r\n  return o;\r\n}\r\n\r\nGCstr *lj_lib_checkstr(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o < L->top) {\r\n    if (LJ_LIKELY(tvisstr(o))) {\r\n      return strV(o);\r\n    } else if (tvisnumber(o)) {\r\n      GCstr *s = lj_strfmt_number(L, o);\r\n      setstrV(L, o, s);\r\n      return s;\r\n    }\r\n  }\r\n  lj_err_argt(L, narg, LUA_TSTRING);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nGCstr *lj_lib_optstr(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  return (o < L->top && !tvisnil(o)) ? lj_lib_checkstr(L, narg) : NULL;\r\n}\r\n\r\n#if LJ_DUALNUM\r\nvoid lj_lib_checknumber(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n}\r\n#endif\r\n\r\nlua_Number lj_lib_checknum(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top &&\r\n\t(tvisnumber(o) || (tvisstr(o) && lj_strscan_num(strV(o), o)))))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_UNLIKELY(tvisint(o))) {\r\n    lua_Number n = (lua_Number)intV(o);\r\n    setnumV(o, n);\r\n    return n;\r\n  } else {\r\n    return numV(o);\r\n  }\r\n}\r\n\r\nint32_t lj_lib_checkint(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && lj_strscan_numberobj(o)))\r\n    lj_err_argt(L, narg, LUA_TNUMBER);\r\n  if (LJ_LIKELY(tvisint(o))) {\r\n    return intV(o);\r\n  } else {\r\n    int32_t i = lj_num2int(numV(o));\r\n    if (LJ_DUALNUM) setintV(o, i);\r\n    return i;\r\n  }\r\n}\r\n\r\nint32_t lj_lib_optint(lua_State *L, int narg, int32_t def)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  return (o < L->top && !tvisnil(o)) ? lj_lib_checkint(L, narg) : def;\r\n}\r\n\r\nGCfunc *lj_lib_checkfunc(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tvisfunc(o)))\r\n    lj_err_argt(L, narg, LUA_TFUNCTION);\r\n  return funcV(o);\r\n}\r\n\r\nGCtab *lj_lib_checktab(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (!(o < L->top && tvistab(o)))\r\n    lj_err_argt(L, narg, LUA_TTABLE);\r\n  return tabV(o);\r\n}\r\n\r\nGCtab *lj_lib_checktabornil(lua_State *L, int narg)\r\n{\r\n  TValue *o = L->base + narg-1;\r\n  if (o < L->top) {\r\n    if (tvistab(o))\r\n      return tabV(o);\r\n    else if (tvisnil(o))\r\n      return NULL;\r\n  }\r\n  lj_err_arg(L, narg, LJ_ERR_NOTABN);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nint lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst)\r\n{\r\n  GCstr *s = def >= 0 ? lj_lib_optstr(L, narg) : lj_lib_checkstr(L, narg);\r\n  if (s) {\r\n    const char *opt = strdata(s);\r\n    MSize len = s->len;\r\n    int i;\r\n    for (i = 0; *(const uint8_t *)lst; i++) {\r\n      if (*(const uint8_t *)lst == len && memcmp(opt, lst+1, len) == 0)\r\n\treturn i;\r\n      lst += 1+*(const uint8_t *)lst;\r\n    }\r\n    lj_err_argv(L, narg, LJ_ERR_INVOPTM, opt);\r\n  }\r\n  return def;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_lib.h",
    "content": "/*\r\n** Library function support.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_LIB_H\r\n#define _LJ_LIB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/*\r\n** A fallback handler is called by the assembler VM if the fast path fails:\r\n**\r\n** - too few arguments:   unrecoverable.\r\n** - wrong argument type:   recoverable, if coercion succeeds.\r\n** - bad argument value:  unrecoverable.\r\n** - stack overflow:        recoverable, if stack reallocation succeeds.\r\n** - extra handling:        recoverable.\r\n**\r\n** The unrecoverable cases throw an error with lj_err_arg(), lj_err_argtype(),\r\n** lj_err_caller() or lj_err_callermsg().\r\n** The recoverable cases return 0 or the number of results + 1.\r\n** The assembler VM retries the fast path only if 0 is returned.\r\n** This time the fallback must not be called again or it gets stuck in a loop.\r\n*/\r\n\r\n/* Return values from fallback handler. */\r\n#define FFH_RETRY\t0\r\n#define FFH_UNREACHABLE\tFFH_RETRY\r\n#define FFH_RES(n)\t((n)+1)\r\n#define FFH_TAILCALL\t(-1)\r\n\r\nLJ_FUNC TValue *lj_lib_checkany(lua_State *L, int narg);\r\nLJ_FUNC GCstr *lj_lib_checkstr(lua_State *L, int narg);\r\nLJ_FUNC GCstr *lj_lib_optstr(lua_State *L, int narg);\r\n#if LJ_DUALNUM\r\nLJ_FUNC void lj_lib_checknumber(lua_State *L, int narg);\r\n#else\r\n#define lj_lib_checknumber(L, narg)\tlj_lib_checknum((L), (narg))\r\n#endif\r\nLJ_FUNC lua_Number lj_lib_checknum(lua_State *L, int narg);\r\nLJ_FUNC int32_t lj_lib_checkint(lua_State *L, int narg);\r\nLJ_FUNC int32_t lj_lib_optint(lua_State *L, int narg, int32_t def);\r\nLJ_FUNC GCfunc *lj_lib_checkfunc(lua_State *L, int narg);\r\nLJ_FUNC GCtab *lj_lib_checktab(lua_State *L, int narg);\r\nLJ_FUNC GCtab *lj_lib_checktabornil(lua_State *L, int narg);\r\nLJ_FUNC int lj_lib_checkopt(lua_State *L, int narg, int def, const char *lst);\r\n\r\n/* Avoid including lj_frame.h. */\r\n#if LJ_GC64\r\n#define lj_lib_upvalue(L, n) \\\r\n  (&gcval(L->base-2)->fn.c.upvalue[(n)-1])\r\n#elif LJ_FR2\r\n#define lj_lib_upvalue(L, n) \\\r\n  (&gcref((L->base-2)->gcr)->fn.c.upvalue[(n)-1])\r\n#else\r\n#define lj_lib_upvalue(L, n) \\\r\n  (&gcref((L->base-1)->fr.func)->fn.c.upvalue[(n)-1])\r\n#endif\r\n\r\n#if LJ_TARGET_WINDOWS\r\n#define lj_lib_checkfpu(L) \\\r\n  do { setnumV(L->top++, (lua_Number)1437217655); \\\r\n    if (lua_tointeger(L, -1) != 1437217655) lj_err_caller(L, LJ_ERR_BADFPU); \\\r\n    L->top--; } while (0)\r\n#else\r\n#define lj_lib_checkfpu(L)\tUNUSED(L)\r\n#endif\r\n\r\nLJ_FUNC GCfunc *lj_lib_pushcc(lua_State *L, lua_CFunction f, int id, int n);\r\n#define lj_lib_pushcf(L, fn, id)\t(lj_lib_pushcc(L, (fn), (id), 0))\r\n\r\n/* Library function declarations. Scanned by buildvm. */\r\n#define LJLIB_CF(name)\t\tstatic int lj_cf_##name(lua_State *L)\r\n#define LJLIB_ASM(name)\t\tstatic int lj_ffh_##name(lua_State *L)\r\n#define LJLIB_ASM_(name)\r\n#define LJLIB_LUA(name)\r\n#define LJLIB_SET(name)\r\n#define LJLIB_PUSH(arg)\r\n#define LJLIB_REC(handler)\r\n#define LJLIB_NOREGUV\r\n#define LJLIB_NOREG\r\n\r\n#define LJ_LIB_REG(L, regname, name) \\\r\n  lj_lib_register(L, regname, lj_lib_init_##name, lj_lib_cf_##name)\r\n\r\nLJ_FUNC void lj_lib_register(lua_State *L, const char *libname,\r\n\t\t\t     const uint8_t *init, const lua_CFunction *cf);\r\nLJ_FUNC void lj_lib_prereg(lua_State *L, const char *name, lua_CFunction f,\r\n\t\t\t   GCtab *env);\r\nLJ_FUNC int lj_lib_postreg(lua_State *L, lua_CFunction cf, int id,\r\n\t\t\t   const char *name);\r\n\r\n/* Library init data tags. */\r\n#define LIBINIT_LENMASK\t0x3f\r\n#define LIBINIT_TAGMASK\t0xc0\r\n#define LIBINIT_CF\t0x00\r\n#define LIBINIT_ASM\t0x40\r\n#define LIBINIT_ASM_\t0x80\r\n#define LIBINIT_STRING\t0xc0\r\n#define LIBINIT_MAXSTR\t0x38\r\n#define LIBINIT_LUA\t0xf9\r\n#define LIBINIT_SET\t0xfa\r\n#define LIBINIT_NUMBER\t0xfb\r\n#define LIBINIT_COPY\t0xfc\r\n#define LIBINIT_LASTCL\t0xfd\r\n#define LIBINIT_FFID\t0xfe\r\n#define LIBINIT_END\t0xff\r\n\r\n/* Exported library functions. */\r\n\r\ntypedef struct RandomState RandomState;\r\nLJ_FUNC uint64_t LJ_FASTCALL lj_math_random_step(RandomState *rs);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_load.c",
    "content": "/*\r\n** Load and dump code.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <errno.h>\r\n#include <stdio.h>\r\n\r\n#define lj_load_c\r\n#define LUA_CORE\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_bcdump.h\"\r\n#include \"lj_parse.h\"\r\n\r\n/* -- Load Lua source code and bytecode ----------------------------------- */\r\n\r\nstatic TValue *cpparser(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  LexState *ls = (LexState *)ud;\r\n  GCproto *pt;\r\n  GCfunc *fn;\r\n  int bc;\r\n  UNUSED(dummy);\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  bc = lj_lex_setup(L, ls);\r\n  if (ls->mode && !strchr(ls->mode, bc ? 'b' : 't')) {\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_XMODE));\r\n    lj_err_throw(L, LUA_ERRSYNTAX);\r\n  }\r\n  pt = bc ? lj_bcread(ls) : lj_parse(ls);\r\n  fn = lj_func_newL_empty(L, pt, tabref(L->env));\r\n  /* Don't combine above/below into one statement. */\r\n  setfuncV(L, L->top++, fn);\r\n  return NULL;\r\n}\r\n\r\nLUA_API int lua_loadx(lua_State *L, lua_Reader reader, void *data,\r\n\t\t      const char *chunkname, const char *mode)\r\n{\r\n  LexState ls;\r\n  int status;\r\n  ls.rfunc = reader;\r\n  ls.rdata = data;\r\n  ls.chunkarg = chunkname ? chunkname : \"?\";\r\n  ls.mode = mode;\r\n  lj_buf_init(L, &ls.sb);\r\n  status = lj_vm_cpcall(L, NULL, &ls, cpparser);\r\n  lj_lex_cleanup(L, &ls);\r\n  lj_gc_check(L);\r\n  return status;\r\n}\r\n\r\nLUA_API int lua_load(lua_State *L, lua_Reader reader, void *data,\r\n\t\t     const char *chunkname)\r\n{\r\n  return lua_loadx(L, reader, data, chunkname, NULL);\r\n}\r\n\r\ntypedef struct FileReaderCtx {\r\n  FILE *fp;\r\n  char buf[LUAL_BUFFERSIZE];\r\n} FileReaderCtx;\r\n\r\nstatic const char *reader_file(lua_State *L, void *ud, size_t *size)\r\n{\r\n  FileReaderCtx *ctx = (FileReaderCtx *)ud;\r\n  UNUSED(L);\r\n  if (feof(ctx->fp)) return NULL;\r\n  *size = fread(ctx->buf, 1, sizeof(ctx->buf), ctx->fp);\r\n  return *size > 0 ? ctx->buf : NULL;\r\n}\r\n\r\nLUALIB_API int luaL_loadfilex(lua_State *L, const char *filename,\r\n\t\t\t      const char *mode)\r\n{\r\n  FileReaderCtx ctx;\r\n  int status;\r\n  const char *chunkname;\r\n  if (filename) {\r\n    ctx.fp = fopen(filename, \"rb\");\r\n    if (ctx.fp == NULL) {\r\n      lua_pushfstring(L, \"cannot open %s: %s\", filename, strerror(errno));\r\n      return LUA_ERRFILE;\r\n    }\r\n    chunkname = lua_pushfstring(L, \"@%s\", filename);\r\n  } else {\r\n    ctx.fp = stdin;\r\n    chunkname = \"=stdin\";\r\n  }\r\n  status = lua_loadx(L, reader_file, &ctx, chunkname, mode);\r\n  if (ferror(ctx.fp)) {\r\n    L->top -= filename ? 2 : 1;\r\n    lua_pushfstring(L, \"cannot read %s: %s\", chunkname+1, strerror(errno));\r\n    if (filename)\r\n      fclose(ctx.fp);\r\n    return LUA_ERRFILE;\r\n  }\r\n  if (filename) {\r\n    L->top--;\r\n    copyTV(L, L->top-1, L->top);\r\n    fclose(ctx.fp);\r\n  }\r\n  return status;\r\n}\r\n\r\nLUALIB_API int luaL_loadfile(lua_State *L, const char *filename)\r\n{\r\n  return luaL_loadfilex(L, filename, NULL);\r\n}\r\n\r\ntypedef struct StringReaderCtx {\r\n  const char *str;\r\n  size_t size;\r\n} StringReaderCtx;\r\n\r\nstatic const char *reader_string(lua_State *L, void *ud, size_t *size)\r\n{\r\n  StringReaderCtx *ctx = (StringReaderCtx *)ud;\r\n  UNUSED(L);\r\n  if (ctx->size == 0) return NULL;\r\n  *size = ctx->size;\r\n  ctx->size = 0;\r\n  return ctx->str;\r\n}\r\n\r\nLUALIB_API int luaL_loadbufferx(lua_State *L, const char *buf, size_t size,\r\n\t\t\t\tconst char *name, const char *mode)\r\n{\r\n  StringReaderCtx ctx;\r\n  ctx.str = buf;\r\n  ctx.size = size;\r\n  return lua_loadx(L, reader_string, &ctx, name, mode);\r\n}\r\n\r\nLUALIB_API int luaL_loadbuffer(lua_State *L, const char *buf, size_t size,\r\n\t\t\t       const char *name)\r\n{\r\n  return luaL_loadbufferx(L, buf, size, name, NULL);\r\n}\r\n\r\nLUALIB_API int luaL_loadstring(lua_State *L, const char *s)\r\n{\r\n  return luaL_loadbuffer(L, s, strlen(s), s);\r\n}\r\n\r\n/* -- Dump bytecode ------------------------------------------------------- */\r\n\r\nLUA_API int lua_dump(lua_State *L, lua_Writer writer, void *data)\r\n{\r\n  cTValue *o = L->top-1;\r\n  api_check(L, L->top > L->base);\r\n  if (tvisfunc(o) && isluafunc(funcV(o)))\r\n    return lj_bcwrite(L, funcproto(funcV(o)), writer, data, 0);\r\n  else\r\n    return 1;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_mcode.c",
    "content": "/*\r\n** Machine code management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_mcode_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#endif\r\n#if LJ_HASJIT || LJ_HASFFI\r\n#include \"lj_vm.h\"\r\n#endif\r\n\r\n/* -- OS-specific functions ----------------------------------------------- */\r\n\r\n#if LJ_HASJIT || LJ_HASFFI\r\n\r\n/* Define this if you want to run LuaJIT with Valgrind. */\r\n#ifdef LUAJIT_USE_VALGRIND\r\n#include <valgrind/valgrind.h>\r\n#endif\r\n\r\n#if LJ_TARGET_IOS\r\nvoid sys_icache_invalidate(void *start, size_t len);\r\n#endif\r\n\r\n/* Synchronize data/instruction cache. */\r\nvoid lj_mcode_sync(void *start, void *end)\r\n{\r\n#ifdef LUAJIT_USE_VALGRIND\r\n  VALGRIND_DISCARD_TRANSLATIONS(start, (char *)end-(char *)start);\r\n#endif\r\n#if LJ_TARGET_X86ORX64\r\n  UNUSED(start); UNUSED(end);\r\n#elif LJ_TARGET_IOS\r\n  sys_icache_invalidate(start, (char *)end-(char *)start);\r\n#elif LJ_TARGET_PPC\r\n  lj_vm_cachesync(start, end);\r\n#elif defined(__GNUC__)\r\n  __clear_cache(start, end);\r\n#else\r\n#error \"Missing builtin to flush instruction cache\"\r\n#endif\r\n}\r\n\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n\r\n#if LJ_TARGET_WINDOWS\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n\r\n#define MCPROT_RW\tPAGE_READWRITE\r\n#define MCPROT_RX\tPAGE_EXECUTE_READ\r\n#define MCPROT_RWX\tPAGE_EXECUTE_READWRITE\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, DWORD prot)\r\n{\r\n  void *p = VirtualAlloc((void *)hint, sz,\r\n\t\t\t MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, prot);\r\n  if (!p && !hint)\r\n    lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n  return p;\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  UNUSED(J); UNUSED(sz);\r\n  VirtualFree(p, 0, MEM_RELEASE);\r\n}\r\n\r\nstatic int mcode_setprot(void *p, size_t sz, DWORD prot)\r\n{\r\n  DWORD oprot;\r\n  return !VirtualProtect(p, sz, prot, &oprot);\r\n}\r\n\r\n#elif LJ_TARGET_POSIX\r\n\r\n#include <sys/mman.h>\r\n\r\n#ifndef MAP_ANONYMOUS\r\n#define MAP_ANONYMOUS\tMAP_ANON\r\n#endif\r\n\r\n#define MCPROT_RW\t(PROT_READ|PROT_WRITE)\r\n#define MCPROT_RX\t(PROT_READ|PROT_EXEC)\r\n#define MCPROT_RWX\t(PROT_READ|PROT_WRITE|PROT_EXEC)\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, int prot)\r\n{\r\n  void *p = mmap((void *)hint, sz, prot, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);\r\n  if (p == MAP_FAILED) {\r\n    if (!hint) lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n    p = NULL;\r\n  }\r\n  return p;\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  UNUSED(J);\r\n  munmap(p, sz);\r\n}\r\n\r\nstatic int mcode_setprot(void *p, size_t sz, int prot)\r\n{\r\n  return mprotect(p, sz, prot);\r\n}\r\n\r\n#elif LJ_64\r\n\r\n#error \"Missing OS support for explicit placement of executable memory\"\r\n\r\n#else\r\n\r\n/* Fallback allocator. This will fail if memory is not executable by default. */\r\n#define LUAJIT_UNPROTECT_MCODE\r\n#define MCPROT_RW\t0\r\n#define MCPROT_RX\t0\r\n#define MCPROT_RWX\t0\r\n\r\nstatic void *mcode_alloc_at(jit_State *J, uintptr_t hint, size_t sz, int prot)\r\n{\r\n  UNUSED(hint); UNUSED(prot);\r\n  return lj_mem_new(J->L, sz);\r\n}\r\n\r\nstatic void mcode_free(jit_State *J, void *p, size_t sz)\r\n{\r\n  lj_mem_free(J2G(J), p, sz);\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area protection ----------------------------------------------- */\r\n\r\n/* Define this ONLY if page protection twiddling becomes a bottleneck. */\r\n#ifdef LUAJIT_UNPROTECT_MCODE\r\n\r\n/* It's generally considered to be a potential security risk to have\r\n** pages with simultaneous write *and* execute access in a process.\r\n**\r\n** Do not even think about using this mode for server processes or\r\n** apps handling untrusted external data (such as a browser).\r\n**\r\n** The security risk is not in LuaJIT itself -- but if an adversary finds\r\n** any *other* flaw in your C application logic, then any RWX memory page\r\n** simplifies writing an exploit considerably.\r\n*/\r\n#define MCPROT_GEN\tMCPROT_RWX\r\n#define MCPROT_RUN\tMCPROT_RWX\r\n\r\nstatic void mcode_protect(jit_State *J, int prot)\r\n{\r\n  UNUSED(J); UNUSED(prot);\r\n}\r\n\r\n#else\r\n\r\n/* This is the default behaviour and much safer:\r\n**\r\n** Most of the time the memory pages holding machine code are executable,\r\n** but NONE of them is writable.\r\n**\r\n** The current memory area is marked read-write (but NOT executable) only\r\n** during the short time window while the assembler generates machine code.\r\n*/\r\n#define MCPROT_GEN\tMCPROT_RW\r\n#define MCPROT_RUN\tMCPROT_RX\r\n\r\n/* Protection twiddling failed. Probably due to kernel security. */\r\nstatic LJ_NOINLINE void mcode_protfail(jit_State *J)\r\n{\r\n  lua_CFunction panic = J2G(J)->panic;\r\n  if (panic) {\r\n    lua_State *L = J->L;\r\n    setstrV(L, L->top++, lj_err_str(L, LJ_ERR_JITPROT));\r\n    panic(L);\r\n  }\r\n}\r\n\r\n/* Change protection of MCode area. */\r\nstatic void mcode_protect(jit_State *J, int prot)\r\n{\r\n  if (J->mcprot != prot) {\r\n    if (LJ_UNLIKELY(mcode_setprot(J->mcarea, J->szmcarea, prot)))\r\n      mcode_protfail(J);\r\n    J->mcprot = prot;\r\n  }\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area allocation ----------------------------------------------- */\r\n\r\n#if LJ_TARGET_X64\r\n#define mcode_validptr(p)\t((p) && (uintptr_t)(p) < (uintptr_t)1<<47)\r\n#else\r\n#define mcode_validptr(p)\t((p) && (uintptr_t)(p) < 0xffff0000)\r\n#endif\r\n\r\n#ifdef LJ_TARGET_JUMPRANGE\r\n\r\n/* Get memory within relative jump distance of our code in 64 bit mode. */\r\nstatic void *mcode_alloc(jit_State *J, size_t sz)\r\n{\r\n  /* Target an address in the static assembler code (64K aligned).\r\n  ** Try addresses within a distance of target-range/2+1MB..target+range/2-1MB.\r\n  ** Use half the jump range so every address in the range can reach any other.\r\n  */\r\n#if LJ_TARGET_MIPS\r\n  /* Use the middle of the 256MB-aligned region. */\r\n  uintptr_t target = ((uintptr_t)(void *)lj_vm_exit_handler & 0xf0000000u) +\r\n\t\t     0x08000000u;\r\n#else\r\n  uintptr_t target = (uintptr_t)(void *)lj_vm_exit_handler & ~(uintptr_t)0xffff;\r\n#endif\r\n  const uintptr_t range = (1u << (LJ_TARGET_JUMPRANGE-1)) - (1u << 21);\r\n  /* First try a contiguous area below the last one. */\r\n  uintptr_t hint = J->mcarea ? (uintptr_t)J->mcarea - sz : 0;\r\n  int i;\r\n  for (i = 0; i < 32; i++) {  /* 32 attempts ought to be enough ... */\r\n    if (mcode_validptr(hint)) {\r\n      void *p = mcode_alloc_at(J, hint, sz, MCPROT_GEN);\r\n\r\n      if (mcode_validptr(p) &&\r\n\t  ((uintptr_t)p + sz - target < range || target - (uintptr_t)p < range))\r\n\treturn p;\r\n      if (p) mcode_free(J, p, sz);  /* Free badly placed area. */\r\n    }\r\n    /* Next try probing pseudo-random addresses. */\r\n    do {\r\n      hint = (0x78fb ^ LJ_PRNG_BITS(J, 15)) << 16;  /* 64K aligned. */\r\n    } while (!(hint + sz < range));\r\n    hint = target + hint - (range>>1);\r\n  }\r\n  lj_trace_err(J, LJ_TRERR_MCODEAL);  /* Give up. OS probably ignores hints? */\r\n  return NULL;\r\n}\r\n\r\n#else\r\n\r\n/* All memory addresses are reachable by relative jumps. */\r\nstatic void *mcode_alloc(jit_State *J, size_t sz)\r\n{\r\n#ifdef __OpenBSD__\r\n  /* Allow better executable memory allocation for OpenBSD W^X mode. */\r\n  void *p = mcode_alloc_at(J, 0, sz, MCPROT_RUN);\r\n  if (p && mcode_setprot(p, sz, MCPROT_GEN)) {\r\n    mcode_free(J, p, sz);\r\n    return NULL;\r\n  }\r\n  return p;\r\n#else\r\n  return mcode_alloc_at(J, 0, sz, MCPROT_GEN);\r\n#endif\r\n}\r\n\r\n#endif\r\n\r\n/* -- MCode area management ----------------------------------------------- */\r\n\r\n/* Linked list of MCode areas. */\r\ntypedef struct MCLink {\r\n  MCode *next;\t\t/* Next area. */\r\n  size_t size;\t\t/* Size of current area. */\r\n} MCLink;\r\n\r\n/* Allocate a new MCode area. */\r\nstatic void mcode_allocarea(jit_State *J)\r\n{\r\n  MCode *oldarea = J->mcarea;\r\n  size_t sz = (size_t)J->param[JIT_P_sizemcode] << 10;\r\n  sz = (sz + LJ_PAGESIZE-1) & ~(size_t)(LJ_PAGESIZE - 1);\r\n  J->mcarea = (MCode *)mcode_alloc(J, sz);\r\n  J->szmcarea = sz;\r\n  J->mcprot = MCPROT_GEN;\r\n  J->mctop = (MCode *)((char *)J->mcarea + J->szmcarea);\r\n  J->mcbot = (MCode *)((char *)J->mcarea + sizeof(MCLink));\r\n  ((MCLink *)J->mcarea)->next = oldarea;\r\n  ((MCLink *)J->mcarea)->size = sz;\r\n  J->szallmcarea += sz;\r\n}\r\n\r\n/* Free all MCode areas. */\r\nvoid lj_mcode_free(jit_State *J)\r\n{\r\n  MCode *mc = J->mcarea;\r\n  J->mcarea = NULL;\r\n  J->szallmcarea = 0;\r\n  while (mc) {\r\n    MCode *next = ((MCLink *)mc)->next;\r\n    mcode_free(J, mc, ((MCLink *)mc)->size);\r\n    mc = next;\r\n  }\r\n}\r\n\r\n/* -- MCode transactions -------------------------------------------------- */\r\n\r\n/* Reserve the remainder of the current MCode area. */\r\nMCode *lj_mcode_reserve(jit_State *J, MCode **lim)\r\n{\r\n  if (!J->mcarea)\r\n    mcode_allocarea(J);\r\n  else\r\n    mcode_protect(J, MCPROT_GEN);\r\n  *lim = J->mcbot;\r\n  return J->mctop;\r\n}\r\n\r\n/* Commit the top part of the current MCode area. */\r\nvoid lj_mcode_commit(jit_State *J, MCode *top)\r\n{\r\n  J->mctop = top;\r\n  mcode_protect(J, MCPROT_RUN);\r\n}\r\n\r\n/* Abort the reservation. */\r\nvoid lj_mcode_abort(jit_State *J)\r\n{\r\n  if (J->mcarea)\r\n    mcode_protect(J, MCPROT_RUN);\r\n}\r\n\r\n/* Set/reset protection to allow patching of MCode areas. */\r\nMCode *lj_mcode_patch(jit_State *J, MCode *ptr, int finish)\r\n{\r\n#ifdef LUAJIT_UNPROTECT_MCODE\r\n  UNUSED(J); UNUSED(ptr); UNUSED(finish);\r\n  return NULL;\r\n#else\r\n  if (finish) {\r\n    if (J->mcarea == ptr)\r\n      mcode_protect(J, MCPROT_RUN);\r\n    else if (LJ_UNLIKELY(mcode_setprot(ptr, ((MCLink *)ptr)->size, MCPROT_RUN)))\r\n      mcode_protfail(J);\r\n    return NULL;\r\n  } else {\r\n    MCode *mc = J->mcarea;\r\n    /* Try current area first to use the protection cache. */\r\n    if (ptr >= mc && ptr < (MCode *)((char *)mc + J->szmcarea)) {\r\n      mcode_protect(J, MCPROT_GEN);\r\n      return mc;\r\n    }\r\n    /* Otherwise search through the list of MCode areas. */\r\n    for (;;) {\r\n      mc = ((MCLink *)mc)->next;\r\n      lua_assert(mc != NULL);\r\n      if (ptr >= mc && ptr < (MCode *)((char *)mc + ((MCLink *)mc)->size)) {\r\n\tif (LJ_UNLIKELY(mcode_setprot(mc, ((MCLink *)mc)->size, MCPROT_GEN)))\r\n\t  mcode_protfail(J);\r\n\treturn mc;\r\n      }\r\n    }\r\n  }\r\n#endif\r\n}\r\n\r\n/* Limit of MCode reservation reached. */\r\nvoid lj_mcode_limiterr(jit_State *J, size_t need)\r\n{\r\n  size_t sizemcode, maxmcode;\r\n  lj_mcode_abort(J);\r\n  sizemcode = (size_t)J->param[JIT_P_sizemcode] << 10;\r\n  sizemcode = (sizemcode + LJ_PAGESIZE-1) & ~(size_t)(LJ_PAGESIZE - 1);\r\n  maxmcode = (size_t)J->param[JIT_P_maxmcode] << 10;\r\n  if ((size_t)need > sizemcode)\r\n    lj_trace_err(J, LJ_TRERR_MCODEOV);  /* Too long for any area. */\r\n  if (J->szallmcarea + sizemcode > maxmcode)\r\n    lj_trace_err(J, LJ_TRERR_MCODEAL);\r\n  mcode_allocarea(J);\r\n  lj_trace_err(J, LJ_TRERR_MCODELM);  /* Retry with new area. */\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_mcode.h",
    "content": "/*\r\n** Machine code management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_MCODE_H\r\n#define _LJ_MCODE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT || LJ_HASFFI\r\nLJ_FUNC void lj_mcode_sync(void *start, void *end);\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_jit.h\"\r\n\r\nLJ_FUNC void lj_mcode_free(jit_State *J);\r\nLJ_FUNC MCode *lj_mcode_reserve(jit_State *J, MCode **lim);\r\nLJ_FUNC void lj_mcode_commit(jit_State *J, MCode *m);\r\nLJ_FUNC void lj_mcode_abort(jit_State *J);\r\nLJ_FUNC MCode *lj_mcode_patch(jit_State *J, MCode *ptr, int finish);\r\nLJ_FUNC_NORET void lj_mcode_limiterr(jit_State *J, size_t need);\r\n\r\n#define lj_mcode_commitbot(J, m)\t(J->mcbot = (m))\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_meta.c",
    "content": "/*\r\n** Metamethod handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_meta_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lib.h\"\r\n\r\n/* -- Metamethod handling ------------------------------------------------- */\r\n\r\n/* String interning of metamethod names for fast indexing. */\r\nvoid lj_meta_init(lua_State *L)\r\n{\r\n#define MMNAME(name)\t\"__\" #name\r\n  const char *metanames = MMDEF(MMNAME);\r\n#undef MMNAME\r\n  global_State *g = G(L);\r\n  const char *p, *q;\r\n  uint32_t mm;\r\n  for (mm = 0, p = metanames; *p; mm++, p = q) {\r\n    GCstr *s;\r\n    for (q = p+2; *q && *q != '_'; q++) ;\r\n    s = lj_str_new(L, p, (size_t)(q-p));\r\n    /* NOBARRIER: g->gcroot[] is a GC root. */\r\n    setgcref(g->gcroot[GCROOT_MMNAME+mm], obj2gco(s));\r\n  }\r\n}\r\n\r\n/* Negative caching of a few fast metamethods. See the lj_meta_fast() macro. */\r\ncTValue *lj_meta_cache(GCtab *mt, MMS mm, GCstr *name)\r\n{\r\n  cTValue *mo = lj_tab_getstr(mt, name);\r\n  lua_assert(mm <= MM_FAST);\r\n  if (!mo || tvisnil(mo)) {  /* No metamethod? */\r\n    mt->nomm |= (uint8_t)(1u<<mm);  /* Set negative cache flag. */\r\n    return NULL;\r\n  }\r\n  return mo;\r\n}\r\n\r\n/* Lookup metamethod for object. */\r\ncTValue *lj_meta_lookup(lua_State *L, cTValue *o, MMS mm)\r\n{\r\n  GCtab *mt;\r\n  if (tvistab(o))\r\n    mt = tabref(tabV(o)->metatable);\r\n  else if (tvisudata(o))\r\n    mt = tabref(udataV(o)->metatable);\r\n  else\r\n    mt = tabref(basemt_obj(G(L), o));\r\n  if (mt) {\r\n    cTValue *mo = lj_tab_getstr(mt, mmname_str(G(L), mm));\r\n    if (mo)\r\n      return mo;\r\n  }\r\n  return niltv(L);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Tailcall from C function. */\r\nint lj_meta_tailcall(lua_State *L, cTValue *tv)\r\n{\r\n  TValue *base = L->base;\r\n  TValue *top = L->top;\r\n  const BCIns *pc = frame_pc(base-1);  /* Preserve old PC from frame. */\r\n  copyTV(L, base-1-LJ_FR2, tv);  /* Replace frame with new object. */\r\n  if (LJ_FR2)\r\n    (top++)->u64 = LJ_CONT_TAILCALL;\r\n  else\r\n    top->u32.lo = LJ_CONT_TAILCALL;\r\n  setframe_pc(top++, pc);\r\n  if (LJ_FR2) top++;\r\n  setframe_gc(top, obj2gco(L), LJ_TTHREAD);  /* Dummy frame object. */\r\n  setframe_ftsz(top, ((char *)(top+1) - (char *)base) + FRAME_CONT);\r\n  L->base = L->top = top+1;\r\n  /*\r\n  ** before:   [old_mo|PC]    [... ...]\r\n  **                         ^base     ^top\r\n  ** after:    [new_mo|itype] [... ...] [NULL|PC] [dummy|delta]\r\n  **                                                           ^base/top\r\n  ** tailcall: [new_mo|PC]    [... ...]\r\n  **                         ^base     ^top\r\n  */\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* Setup call to metamethod to be run by Assembler VM. */\r\nstatic TValue *mmcall(lua_State *L, ASMFunction cont, cTValue *mo,\r\n\t\t    cTValue *a, cTValue *b)\r\n{\r\n  /*\r\n  **           |-- framesize -> top       top+1       top+2 top+3\r\n  ** before:   [func slots ...]\r\n  ** mm setup: [func slots ...] [cont|?]  [mo|tmtype] [a]   [b]\r\n  ** in asm:   [func slots ...] [cont|PC] [mo|delta]  [a]   [b]\r\n  **           ^-- func base                          ^-- mm base\r\n  ** after mm: [func slots ...]           [result]\r\n  **                ^-- copy to base[PC_RA] --/     for lj_cont_ra\r\n  **                          istruecond + branch   for lj_cont_cond*\r\n  **                                       ignore   for lj_cont_nop\r\n  ** next PC:  [func slots ...]\r\n  */\r\n  TValue *top = L->top;\r\n  if (curr_funcisL(L)) top = curr_topL(L);\r\n  setcont(top++, cont);  /* Assembler VM stores PC in upper word or FR2. */\r\n  if (LJ_FR2) setnilV(top++);\r\n  copyTV(L, top++, mo);  /* Store metamethod and two arguments. */\r\n  if (LJ_FR2) setnilV(top++);\r\n  copyTV(L, top, a);\r\n  copyTV(L, top+1, b);\r\n  return top;  /* Return new base. */\r\n}\r\n\r\n/* -- C helpers for some instructions, called from assembler VM ----------- */\r\n\r\n/* Helper for TGET*. __index chain and metamethod. */\r\ncTValue *lj_meta_tget(lua_State *L, cTValue *o, cTValue *k)\r\n{\r\n  int loop;\r\n  for (loop = 0; loop < LJ_MAX_IDXCHAIN; loop++) {\r\n    cTValue *mo;\r\n    if (LJ_LIKELY(tvistab(o))) {\r\n      GCtab *t = tabV(o);\r\n      cTValue *tv = lj_tab_get(L, t, k);\r\n      if (!tvisnil(tv) ||\r\n\t  !(mo = lj_meta_fast(L, tabref(t->metatable), MM_index)))\r\n\treturn tv;\r\n    } else if (tvisnil(mo = lj_meta_lookup(L, o, MM_index))) {\r\n      lj_err_optype(L, o, LJ_ERR_OPINDEX);\r\n      return NULL;  /* unreachable */\r\n    }\r\n    if (tvisfunc(mo)) {\r\n      L->top = mmcall(L, lj_cont_ra, mo, o, k);\r\n      return NULL;  /* Trigger metamethod call. */\r\n    }\r\n    o = mo;\r\n  }\r\n  lj_err_msg(L, LJ_ERR_GETLOOP);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\n/* Helper for TSET*. __newindex chain and metamethod. */\r\nTValue *lj_meta_tset(lua_State *L, cTValue *o, cTValue *k)\r\n{\r\n  TValue tmp;\r\n  int loop;\r\n  for (loop = 0; loop < LJ_MAX_IDXCHAIN; loop++) {\r\n    cTValue *mo;\r\n    if (LJ_LIKELY(tvistab(o))) {\r\n      GCtab *t = tabV(o);\r\n      cTValue *tv = lj_tab_get(L, t, k);\r\n      if (LJ_LIKELY(!tvisnil(tv))) {\r\n\tt->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n\tlj_gc_anybarriert(L, t);\r\n\treturn (TValue *)tv;\r\n      } else if (!(mo = lj_meta_fast(L, tabref(t->metatable), MM_newindex))) {\r\n\tt->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n\tlj_gc_anybarriert(L, t);\r\n\tif (tv != niltv(L))\r\n\t  return (TValue *)tv;\r\n\tif (tvisnil(k)) lj_err_msg(L, LJ_ERR_NILIDX);\r\n\telse if (tvisint(k)) { setnumV(&tmp, (lua_Number)intV(k)); k = &tmp; }\r\n\telse if (tvisnum(k) && tvisnan(k)) lj_err_msg(L, LJ_ERR_NANIDX);\r\n\treturn lj_tab_newkey(L, t, k);\r\n      }\r\n    } else if (tvisnil(mo = lj_meta_lookup(L, o, MM_newindex))) {\r\n      lj_err_optype(L, o, LJ_ERR_OPINDEX);\r\n      return NULL;  /* unreachable */\r\n    }\r\n    if (tvisfunc(mo)) {\r\n      L->top = mmcall(L, lj_cont_nop, mo, o, k);\r\n      /* L->top+2 = v filled in by caller. */\r\n      return NULL;  /* Trigger metamethod call. */\r\n    }\r\n    copyTV(L, &tmp, mo);\r\n    o = &tmp;\r\n  }\r\n  lj_err_msg(L, LJ_ERR_SETLOOP);\r\n  return NULL;  /* unreachable */\r\n}\r\n\r\nstatic cTValue *str2num(cTValue *o, TValue *n)\r\n{\r\n  if (tvisnum(o))\r\n    return o;\r\n  else if (tvisint(o))\r\n    return (setnumV(n, (lua_Number)intV(o)), n);\r\n  else if (tvisstr(o) && lj_strscan_num(strV(o), n))\r\n    return n;\r\n  else\r\n    return NULL;\r\n}\r\n\r\n/* Helper for arithmetic instructions. Coercion, metamethod. */\r\nTValue *lj_meta_arith(lua_State *L, TValue *ra, cTValue *rb, cTValue *rc,\r\n\t\t      BCReg op)\r\n{\r\n  MMS mm = bcmode_mm(op);\r\n  TValue tempb, tempc;\r\n  cTValue *b, *c;\r\n  if ((b = str2num(rb, &tempb)) != NULL &&\r\n      (c = str2num(rc, &tempc)) != NULL) {  /* Try coercion first. */\r\n    setnumV(ra, lj_vm_foldarith(numV(b), numV(c), (int)mm-MM_add));\r\n    return NULL;\r\n  } else {\r\n    cTValue *mo = lj_meta_lookup(L, rb, mm);\r\n    if (tvisnil(mo)) {\r\n      mo = lj_meta_lookup(L, rc, mm);\r\n      if (tvisnil(mo)) {\r\n\tif (str2num(rb, &tempb) == NULL) rc = rb;\r\n\tlj_err_optype(L, rc, LJ_ERR_OPARITH);\r\n\treturn NULL;  /* unreachable */\r\n      }\r\n    }\r\n    return mmcall(L, lj_cont_ra, mo, rb, rc);\r\n  }\r\n}\r\n\r\n/* Helper for CAT. Coercion, iterative concat, __concat metamethod. */\r\nTValue *lj_meta_cat(lua_State *L, TValue *top, int left)\r\n{\r\n  int fromc = 0;\r\n  if (left < 0) { left = -left; fromc = 1; }\r\n  do {\r\n    if (!(tvisstr(top) || tvisnumber(top)) ||\r\n\t!(tvisstr(top-1) || tvisnumber(top-1))) {\r\n      cTValue *mo = lj_meta_lookup(L, top-1, MM_concat);\r\n      if (tvisnil(mo)) {\r\n\tmo = lj_meta_lookup(L, top, MM_concat);\r\n\tif (tvisnil(mo)) {\r\n\t  if (tvisstr(top-1) || tvisnumber(top-1)) top++;\r\n\t  lj_err_optype(L, top-1, LJ_ERR_OPCAT);\r\n\t  return NULL;  /* unreachable */\r\n\t}\r\n      }\r\n      /* One of the top two elements is not a string, call __cat metamethod:\r\n      **\r\n      ** before:    [...][CAT stack .........................]\r\n      **                                 top-1     top         top+1 top+2\r\n      ** pick two:  [...][CAT stack ...] [o1]      [o2]\r\n      ** setup mm:  [...][CAT stack ...] [cont|?]  [mo|tmtype] [o1]  [o2]\r\n      ** in asm:    [...][CAT stack ...] [cont|PC] [mo|delta]  [o1]  [o2]\r\n      **            ^-- func base                              ^-- mm base\r\n      ** after mm:  [...][CAT stack ...] <--push-- [result]\r\n      ** next step: [...][CAT stack .............]\r\n      */\r\n      copyTV(L, top+2*LJ_FR2+2, top);  /* Carefully ordered stack copies! */\r\n      copyTV(L, top+2*LJ_FR2+1, top-1);\r\n      copyTV(L, top+LJ_FR2, mo);\r\n      setcont(top-1, lj_cont_cat);\r\n      if (LJ_FR2) { setnilV(top); setnilV(top+2); top += 2; }\r\n      return top+1;  /* Trigger metamethod call. */\r\n    } else {\r\n      /* Pick as many strings as possible from the top and concatenate them:\r\n      **\r\n      ** before:    [...][CAT stack ...........................]\r\n      ** pick str:  [...][CAT stack ...] [...... strings ......]\r\n      ** concat:    [...][CAT stack ...] [result]\r\n      ** next step: [...][CAT stack ............]\r\n      */\r\n      TValue *e, *o = top;\r\n      uint64_t tlen = tvisstr(o) ? strV(o)->len : STRFMT_MAXBUF_NUM;\r\n      char *p, *buf;\r\n      do {\r\n\to--; tlen += tvisstr(o) ? strV(o)->len : STRFMT_MAXBUF_NUM;\r\n      } while (--left > 0 && (tvisstr(o-1) || tvisnumber(o-1)));\r\n      if (tlen >= LJ_MAX_STR) lj_err_msg(L, LJ_ERR_STROV);\r\n      p = buf = lj_buf_tmp(L, (MSize)tlen);\r\n      for (e = top, top = o; o <= e; o++) {\r\n\tif (tvisstr(o)) {\r\n\t  GCstr *s = strV(o);\r\n\t  MSize len = s->len;\r\n\t  p = lj_buf_wmem(p, strdata(s), len);\r\n\t} else if (tvisint(o)) {\r\n\t  p = lj_strfmt_wint(p, intV(o));\r\n\t} else {\r\n\t  lua_assert(tvisnum(o));\r\n\t  p = lj_strfmt_wnum(p, o);\r\n\t}\r\n      }\r\n      setstrV(L, top, lj_str_new(L, buf, (size_t)(p-buf)));\r\n    }\r\n  } while (left >= 1);\r\n  if (LJ_UNLIKELY(G(L)->gc.total >= G(L)->gc.threshold)) {\r\n    if (!fromc) L->top = curr_topL(L);\r\n    lj_gc_step(L);\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Helper for LEN. __len metamethod. */\r\nTValue * LJ_FASTCALL lj_meta_len(lua_State *L, cTValue *o)\r\n{\r\n  cTValue *mo = lj_meta_lookup(L, o, MM_len);\r\n  if (tvisnil(mo)) {\r\n    if (LJ_52 && tvistab(o))\r\n      tabref(tabV(o)->metatable)->nomm |= (uint8_t)(1u<<MM_len);\r\n    else\r\n      lj_err_optype(L, o, LJ_ERR_OPLEN);\r\n    return NULL;\r\n  }\r\n  return mmcall(L, lj_cont_ra, mo, o, LJ_52 ? o : niltv(L));\r\n}\r\n\r\n/* Helper for equality comparisons. __eq metamethod. */\r\nTValue *lj_meta_equal(lua_State *L, GCobj *o1, GCobj *o2, int ne)\r\n{\r\n  /* Field metatable must be at same offset for GCtab and GCudata! */\r\n  cTValue *mo = lj_meta_fast(L, tabref(o1->gch.metatable), MM_eq);\r\n  if (mo) {\r\n    TValue *top;\r\n    uint32_t it;\r\n    if (tabref(o1->gch.metatable) != tabref(o2->gch.metatable)) {\r\n      cTValue *mo2 = lj_meta_fast(L, tabref(o2->gch.metatable), MM_eq);\r\n      if (mo2 == NULL || !lj_obj_equal(mo, mo2))\r\n\treturn (TValue *)(intptr_t)ne;\r\n    }\r\n    top = curr_top(L);\r\n    setcont(top++, ne ? lj_cont_condf : lj_cont_condt);\r\n    if (LJ_FR2) setnilV(top++);\r\n    copyTV(L, top++, mo);\r\n    if (LJ_FR2) setnilV(top++);\r\n    it = ~(uint32_t)o1->gch.gct;\r\n    setgcV(L, top, o1, it);\r\n    setgcV(L, top+1, o2, it);\r\n    return top;  /* Trigger metamethod call. */\r\n  }\r\n  return (TValue *)(intptr_t)ne;\r\n}\r\n\r\n#if LJ_HASFFI\r\nTValue * LJ_FASTCALL lj_meta_equal_cd(lua_State *L, BCIns ins)\r\n{\r\n  ASMFunction cont = (bc_op(ins) & 1) ? lj_cont_condf : lj_cont_condt;\r\n  int op = (int)bc_op(ins) & ~1;\r\n  TValue tv;\r\n  cTValue *mo, *o2, *o1 = &L->base[bc_a(ins)];\r\n  cTValue *o1mm = o1;\r\n  if (op == BC_ISEQV) {\r\n    o2 = &L->base[bc_d(ins)];\r\n    if (!tviscdata(o1mm)) o1mm = o2;\r\n  } else if (op == BC_ISEQS) {\r\n    setstrV(L, &tv, gco2str(proto_kgc(curr_proto(L), ~(ptrdiff_t)bc_d(ins))));\r\n    o2 = &tv;\r\n  } else if (op == BC_ISEQN) {\r\n    o2 = &mref(curr_proto(L)->k, cTValue)[bc_d(ins)];\r\n  } else {\r\n    lua_assert(op == BC_ISEQP);\r\n    setpriV(&tv, ~bc_d(ins));\r\n    o2 = &tv;\r\n  }\r\n  mo = lj_meta_lookup(L, o1mm, MM_eq);\r\n  if (LJ_LIKELY(!tvisnil(mo)))\r\n    return mmcall(L, cont, mo, o1, o2);\r\n  else\r\n    return (TValue *)(intptr_t)(bc_op(ins) & 1);\r\n}\r\n#endif\r\n\r\n/* Helper for ordered comparisons. String compare, __lt/__le metamethods. */\r\nTValue *lj_meta_comp(lua_State *L, cTValue *o1, cTValue *o2, int op)\r\n{\r\n  if (LJ_HASFFI && (tviscdata(o1) || tviscdata(o2))) {\r\n    ASMFunction cont = (op & 1) ? lj_cont_condf : lj_cont_condt;\r\n    MMS mm = (op & 2) ? MM_le : MM_lt;\r\n    cTValue *mo = lj_meta_lookup(L, tviscdata(o1) ? o1 : o2, mm);\r\n    if (LJ_UNLIKELY(tvisnil(mo))) goto err;\r\n    return mmcall(L, cont, mo, o1, o2);\r\n  } else if (LJ_52 || itype(o1) == itype(o2)) {\r\n    /* Never called with two numbers. */\r\n    if (tvisstr(o1) && tvisstr(o2)) {\r\n      int32_t res = lj_str_cmp(strV(o1), strV(o2));\r\n      return (TValue *)(intptr_t)(((op&2) ? res <= 0 : res < 0) ^ (op&1));\r\n    } else {\r\n    trymt:\r\n      while (1) {\r\n\tASMFunction cont = (op & 1) ? lj_cont_condf : lj_cont_condt;\r\n\tMMS mm = (op & 2) ? MM_le : MM_lt;\r\n\tcTValue *mo = lj_meta_lookup(L, o1, mm);\r\n#if LJ_52\r\n\tif (tvisnil(mo) && tvisnil((mo = lj_meta_lookup(L, o2, mm))))\r\n#else\r\n\tcTValue *mo2 = lj_meta_lookup(L, o2, mm);\r\n\tif (tvisnil(mo) || !lj_obj_equal(mo, mo2))\r\n#endif\r\n\t{\r\n\t  if (op & 2) {  /* MM_le not found: retry with MM_lt. */\r\n\t    cTValue *ot = o1; o1 = o2; o2 = ot;  /* Swap operands. */\r\n\t    op ^= 3;  /* Use LT and flip condition. */\r\n\t    continue;\r\n\t  }\r\n\t  goto err;\r\n\t}\r\n\treturn mmcall(L, cont, mo, o1, o2);\r\n      }\r\n    }\r\n  } else if (tvisbool(o1) && tvisbool(o2)) {\r\n    goto trymt;\r\n  } else {\r\n  err:\r\n    lj_err_comp(L, o1, o2);\r\n    return NULL;\r\n  }\r\n}\r\n\r\n/* Helper for ISTYPE and ISNUM. Implicit coercion or error. */\r\nvoid lj_meta_istype(lua_State *L, BCReg ra, BCReg tp)\r\n{\r\n  L->top = curr_topL(L);\r\n  ra++; tp--;\r\n  lua_assert(LJ_DUALNUM || tp != ~LJ_TNUMX);  /* ISTYPE -> ISNUM broken. */\r\n  if (LJ_DUALNUM && tp == ~LJ_TNUMX) lj_lib_checkint(L, ra);\r\n  else if (tp == ~LJ_TNUMX+1) lj_lib_checknum(L, ra);\r\n  else if (tp == ~LJ_TSTR) lj_lib_checkstr(L, ra);\r\n  else lj_err_argtype(L, ra, lj_obj_itypename[tp]);\r\n}\r\n\r\n/* Helper for calls. __call metamethod. */\r\nvoid lj_meta_call(lua_State *L, TValue *func, TValue *top)\r\n{\r\n  cTValue *mo = lj_meta_lookup(L, func, MM_call);\r\n  TValue *p;\r\n  if (!tvisfunc(mo))\r\n    lj_err_optype_call(L, func);\r\n  for (p = top; p > func+2*LJ_FR2; p--) copyTV(L, p, p-1);\r\n  if (LJ_FR2) copyTV(L, func+2, func);\r\n  copyTV(L, func, mo);\r\n}\r\n\r\n/* Helper for FORI. Coercion. */\r\nvoid LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o)\r\n{\r\n  if (!lj_strscan_numberobj(o)) lj_err_msg(L, LJ_ERR_FORINIT);\r\n  if (!lj_strscan_numberobj(o+1)) lj_err_msg(L, LJ_ERR_FORLIM);\r\n  if (!lj_strscan_numberobj(o+2)) lj_err_msg(L, LJ_ERR_FORSTEP);\r\n  if (LJ_DUALNUM) {\r\n    /* Ensure all slots are integers or all slots are numbers. */\r\n    int32_t k[3];\r\n    int nint = 0;\r\n    ptrdiff_t i;\r\n    for (i = 0; i <= 2; i++) {\r\n      if (tvisint(o+i)) {\r\n\tk[i] = intV(o+i); nint++;\r\n      } else {\r\n\tk[i] = lj_num2int(numV(o+i)); nint += ((lua_Number)k[i] == numV(o+i));\r\n      }\r\n    }\r\n    if (nint == 3) {  /* Narrow to integers. */\r\n      setintV(o, k[0]);\r\n      setintV(o+1, k[1]);\r\n      setintV(o+2, k[2]);\r\n    } else if (nint != 0) {  /* Widen to numbers. */\r\n      if (tvisint(o)) setnumV(o, (lua_Number)intV(o));\r\n      if (tvisint(o+1)) setnumV(o+1, (lua_Number)intV(o+1));\r\n      if (tvisint(o+2)) setnumV(o+2, (lua_Number)intV(o+2));\r\n    }\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_meta.h",
    "content": "/*\r\n** Metamethod handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_META_H\r\n#define _LJ_META_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Metamethod handling */\r\nLJ_FUNC void lj_meta_init(lua_State *L);\r\nLJ_FUNC cTValue *lj_meta_cache(GCtab *mt, MMS mm, GCstr *name);\r\nLJ_FUNC cTValue *lj_meta_lookup(lua_State *L, cTValue *o, MMS mm);\r\n#if LJ_HASFFI\r\nLJ_FUNC int lj_meta_tailcall(lua_State *L, cTValue *tv);\r\n#endif\r\n\r\n#define lj_meta_fastg(g, mt, mm) \\\r\n  ((mt) == NULL ? NULL : ((mt)->nomm & (1u<<(mm))) ? NULL : \\\r\n   lj_meta_cache(mt, mm, mmname_str(g, mm)))\r\n#define lj_meta_fast(L, mt, mm)\tlj_meta_fastg(G(L), mt, mm)\r\n\r\n/* C helpers for some instructions, called from assembler VM. */\r\nLJ_FUNCA cTValue *lj_meta_tget(lua_State *L, cTValue *o, cTValue *k);\r\nLJ_FUNCA TValue *lj_meta_tset(lua_State *L, cTValue *o, cTValue *k);\r\nLJ_FUNCA TValue *lj_meta_arith(lua_State *L, TValue *ra, cTValue *rb,\r\n\t\t\t       cTValue *rc, BCReg op);\r\nLJ_FUNCA TValue *lj_meta_cat(lua_State *L, TValue *top, int left);\r\nLJ_FUNCA TValue * LJ_FASTCALL lj_meta_len(lua_State *L, cTValue *o);\r\nLJ_FUNCA TValue *lj_meta_equal(lua_State *L, GCobj *o1, GCobj *o2, int ne);\r\nLJ_FUNCA TValue * LJ_FASTCALL lj_meta_equal_cd(lua_State *L, BCIns ins);\r\nLJ_FUNCA TValue *lj_meta_comp(lua_State *L, cTValue *o1, cTValue *o2, int op);\r\nLJ_FUNCA void lj_meta_istype(lua_State *L, BCReg ra, BCReg tp);\r\nLJ_FUNCA void lj_meta_call(lua_State *L, TValue *func, TValue *top);\r\nLJ_FUNCA void LJ_FASTCALL lj_meta_for(lua_State *L, TValue *o);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_obj.c",
    "content": "/*\r\n** Miscellaneous object handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_obj_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Object type names. */\r\nLJ_DATADEF const char *const lj_obj_typename[] = {  /* ORDER LUA_T */\r\n  \"no value\", \"nil\", \"boolean\", \"userdata\", \"number\", \"string\",\r\n  \"table\", \"function\", \"userdata\", \"thread\", \"proto\", \"cdata\"\r\n};\r\n\r\nLJ_DATADEF const char *const lj_obj_itypename[] = {  /* ORDER LJ_T */\r\n  \"nil\", \"boolean\", \"boolean\", \"userdata\", \"string\", \"upval\", \"thread\",\r\n  \"proto\", \"function\", \"trace\", \"cdata\", \"table\", \"userdata\", \"number\"\r\n};\r\n\r\n/* Compare two objects without calling metamethods. */\r\nint LJ_FASTCALL lj_obj_equal(cTValue *o1, cTValue *o2)\r\n{\r\n  if (itype(o1) == itype(o2)) {\r\n    if (tvispri(o1))\r\n      return 1;\r\n    if (!tvisnum(o1))\r\n      return gcrefeq(o1->gcr, o2->gcr);\r\n  } else if (!tvisnumber(o1) || !tvisnumber(o2)) {\r\n    return 0;\r\n  }\r\n  return numberVnum(o1) == numberVnum(o2);\r\n}\r\n\r\n/* Return pointer to object or its object data. */\r\nconst void * LJ_FASTCALL lj_obj_ptr(cTValue *o)\r\n{\r\n  if (tvisudata(o))\r\n    return uddata(udataV(o));\r\n  else if (tvislightud(o))\r\n    return lightudV(o);\r\n  else if (LJ_HASFFI && tviscdata(o))\r\n    return cdataptr(cdataV(o));\r\n  else if (tvisgcv(o))\r\n    return gcV(o);\r\n  else\r\n    return NULL;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_obj.h",
    "content": "/*\r\n** LuaJIT VM tags, values and objects.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#ifndef _LJ_OBJ_H\r\n#define _LJ_OBJ_H\r\n\r\n#include \"lua.h\"\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* -- Memory references (32 bit address space) ---------------------------- */\r\n\r\n/* Memory and GC object sizes. */\r\ntypedef uint32_t MSize;\r\n#if LJ_GC64\r\ntypedef uint64_t GCSize;\r\n#else\r\ntypedef uint32_t GCSize;\r\n#endif\r\n\r\n/* Memory reference */\r\ntypedef struct MRef {\r\n#if LJ_GC64\r\n  uint64_t ptr64;\t/* True 64 bit pointer. */\r\n#else\r\n  uint32_t ptr32;\t/* Pseudo 32 bit pointer. */\r\n#endif\r\n} MRef;\r\n\r\n#if LJ_GC64\r\n#define mref(r, t)\t((t *)(void *)(r).ptr64)\r\n\r\n#define setmref(r, p)\t((r).ptr64 = (uint64_t)(void *)(p))\r\n#define setmrefr(r, v)\t((r).ptr64 = (v).ptr64)\r\n#else\r\n#define mref(r, t)\t((t *)(void *)(uintptr_t)(r).ptr32)\r\n\r\n#define setmref(r, p)\t((r).ptr32 = (uint32_t)(uintptr_t)(void *)(p))\r\n#define setmrefr(r, v)\t((r).ptr32 = (v).ptr32)\r\n#endif\r\n\r\n/* -- GC object references (32 bit address space) ------------------------- */\r\n\r\n/* GCobj reference */\r\ntypedef struct GCRef {\r\n#if LJ_GC64\r\n  uint64_t gcptr64;\t/* True 64 bit pointer. */\r\n#else\r\n  uint32_t gcptr32;\t/* Pseudo 32 bit pointer. */\r\n#endif\r\n} GCRef;\r\n\r\n/* Common GC header for all collectable objects. */\r\n#define GCHeader\tGCRef nextgc; uint8_t marked; uint8_t gct\r\n/* This occupies 6 bytes, so use the next 2 bytes for non-32 bit fields. */\r\n\r\n#if LJ_GC64\r\n#define gcref(r)\t((GCobj *)(r).gcptr64)\r\n#define gcrefp(r, t)\t((t *)(void *)(r).gcptr64)\r\n#define gcrefu(r)\t((r).gcptr64)\r\n#define gcrefeq(r1, r2)\t((r1).gcptr64 == (r2).gcptr64)\r\n\r\n#define setgcref(r, gc)\t((r).gcptr64 = (uint64_t)&(gc)->gch)\r\n#define setgcreft(r, gc, it) \\\r\n  (r).gcptr64 = (uint64_t)&(gc)->gch | (((uint64_t)(it)) << 47)\r\n#define setgcrefp(r, p)\t((r).gcptr64 = (uint64_t)(p))\r\n#define setgcrefnull(r)\t((r).gcptr64 = 0)\r\n#define setgcrefr(r, v)\t((r).gcptr64 = (v).gcptr64)\r\n#else\r\n#define gcref(r)\t((GCobj *)(uintptr_t)(r).gcptr32)\r\n#define gcrefp(r, t)\t((t *)(void *)(uintptr_t)(r).gcptr32)\r\n#define gcrefu(r)\t((r).gcptr32)\r\n#define gcrefeq(r1, r2)\t((r1).gcptr32 == (r2).gcptr32)\r\n\r\n#define setgcref(r, gc)\t((r).gcptr32 = (uint32_t)(uintptr_t)&(gc)->gch)\r\n#define setgcrefp(r, p)\t((r).gcptr32 = (uint32_t)(uintptr_t)(p))\r\n#define setgcrefnull(r)\t((r).gcptr32 = 0)\r\n#define setgcrefr(r, v)\t((r).gcptr32 = (v).gcptr32)\r\n#endif\r\n\r\n#define gcnext(gc)\t(gcref((gc)->gch.nextgc))\r\n\r\n/* IMPORTANT NOTE:\r\n**\r\n** All uses of the setgcref* macros MUST be accompanied with a write barrier.\r\n**\r\n** This is to ensure the integrity of the incremental GC. The invariant\r\n** to preserve is that a black object never points to a white object.\r\n** I.e. never store a white object into a field of a black object.\r\n**\r\n** It's ok to LEAVE OUT the write barrier ONLY in the following cases:\r\n** - The source is not a GC object (NULL).\r\n** - The target is a GC root. I.e. everything in global_State.\r\n** - The target is a lua_State field (threads are never black).\r\n** - The target is a stack slot, see setgcV et al.\r\n** - The target is an open upvalue, i.e. pointing to a stack slot.\r\n** - The target is a newly created object (i.e. marked white). But make\r\n**   sure nothing invokes the GC inbetween.\r\n** - The target and the source are the same object (self-reference).\r\n** - The target already contains the object (e.g. moving elements around).\r\n**\r\n** The most common case is a store to a stack slot. All other cases where\r\n** a barrier has been omitted are annotated with a NOBARRIER comment.\r\n**\r\n** The same logic applies for stores to table slots (array part or hash\r\n** part). ALL uses of lj_tab_set* require a barrier for the stored value\r\n** *and* the stored key, based on the above rules. In practice this means\r\n** a barrier is needed if *either* of the key or value are a GC object.\r\n**\r\n** It's ok to LEAVE OUT the write barrier in the following special cases:\r\n** - The stored value is nil. The key doesn't matter because it's either\r\n**   not resurrected or lj_tab_newkey() will take care of the key barrier.\r\n** - The key doesn't matter if the *previously* stored value is guaranteed\r\n**   to be non-nil (because the key is kept alive in the table).\r\n** - The key doesn't matter if it's guaranteed not to be part of the table,\r\n**   since lj_tab_newkey() takes care of the key barrier. This applies\r\n**   trivially to new tables, but watch out for resurrected keys. Storing\r\n**   a nil value leaves the key in the table!\r\n**\r\n** In case of doubt use lj_gc_anybarriert() as it's rather cheap. It's used\r\n** by the interpreter for all table stores.\r\n**\r\n** Note: In contrast to Lua's GC, LuaJIT's GC does *not* specially mark\r\n** dead keys in tables. The reference is left in, but it's guaranteed to\r\n** be never dereferenced as long as the value is nil. It's ok if the key is\r\n** freed or if any object subsequently gets the same address.\r\n**\r\n** Not destroying dead keys helps to keep key hash slots stable. This avoids\r\n** specialization back-off for HREFK when a value flips between nil and\r\n** non-nil and the GC gets in the way. It also allows safely hoisting\r\n** HREF/HREFK across GC steps. Dead keys are only removed if a table is\r\n** resized (i.e. by NEWREF) and xREF must not be CSEd across a resize.\r\n**\r\n** The trade-off is that a write barrier for tables must take the key into\r\n** account, too. Implicitly resurrecting the key by storing a non-nil value\r\n** may invalidate the incremental GC invariant.\r\n*/\r\n\r\n/* -- Common type definitions --------------------------------------------- */\r\n\r\n/* Types for handling bytecodes. Need this here, details in lj_bc.h. */\r\ntypedef uint32_t BCIns;  /* Bytecode instruction. */\r\ntypedef uint32_t BCPos;  /* Bytecode position. */\r\ntypedef uint32_t BCReg;  /* Bytecode register. */\r\ntypedef int32_t BCLine;  /* Bytecode line number. */\r\n\r\n/* Internal assembler functions. Never call these directly from C. */\r\ntypedef void (*ASMFunction)(void);\r\n\r\n/* Resizable string buffer. Need this here, details in lj_buf.h. */\r\ntypedef struct SBuf {\r\n  MRef p;\t\t/* String buffer pointer. */\r\n  MRef e;\t\t/* String buffer end pointer. */\r\n  MRef b;\t\t/* String buffer base. */\r\n  MRef L;\t\t/* lua_State, used for buffer resizing. */\r\n} SBuf;\r\n\r\n/* -- Tags and values ----------------------------------------------------- */\r\n\r\n/* Frame link. */\r\ntypedef union {\r\n  int32_t ftsz;\t\t/* Frame type and size of previous frame. */\r\n  MRef pcr;\t\t/* Or PC for Lua frames. */\r\n} FrameLink;\r\n\r\n/* Tagged value. */\r\ntypedef LJ_ALIGN(8) union TValue {\r\n  uint64_t u64;\t\t/* 64 bit pattern overlaps number. */\r\n  lua_Number n;\t\t/* Number object overlaps split tag/value object. */\r\n#if LJ_GC64\r\n  GCRef gcr;\t\t/* GCobj reference with tag. */\r\n  int64_t it64;\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      int32_t i;\t/* Integer value. */\r\n    , uint32_t it;\t/* Internal object tag. Must overlap MSW of number. */\r\n    )\r\n  };\r\n#else\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      union {\r\n\tGCRef gcr;\t/* GCobj reference (if any). */\r\n\tint32_t i;\t/* Integer value. */\r\n      };\r\n    , uint32_t it;\t/* Internal object tag. Must overlap MSW of number. */\r\n    )\r\n  };\r\n#endif\r\n#if LJ_FR2\r\n  int64_t ftsz;\t\t/* Frame type and size of previous frame, or PC. */\r\n#else\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      GCRef func;\t/* Function for next frame (or dummy L). */\r\n    , FrameLink tp;\t/* Link to previous frame. */\r\n    )\r\n  } fr;\r\n#endif\r\n  struct {\r\n    LJ_ENDIAN_LOHI(\r\n      uint32_t lo;\t/* Lower 32 bits of number. */\r\n    , uint32_t hi;\t/* Upper 32 bits of number. */\r\n    )\r\n  } u32;\r\n} TValue;\r\n\r\ntypedef const TValue cTValue;\r\n\r\n#define tvref(r)\t(mref(r, TValue))\r\n\r\n/* More external and GCobj tags for internal objects. */\r\n#define LAST_TT\t\tLUA_TTHREAD\r\n#define LUA_TPROTO\t(LAST_TT+1)\r\n#define LUA_TCDATA\t(LAST_TT+2)\r\n\r\n/* Internal object tags.\r\n**\r\n** Format for 32 bit GC references (!LJ_GC64):\r\n**\r\n** Internal tags overlap the MSW of a number object (must be a double).\r\n** Interpreted as a double these are special NaNs. The FPU only generates\r\n** one type of NaN (0xfff8_0000_0000_0000). So MSWs > 0xfff80000 are available\r\n** for use as internal tags. Small negative numbers are used to shorten the\r\n** encoding of type comparisons (reg/mem against sign-ext. 8 bit immediate).\r\n**\r\n**                  ---MSW---.---LSW---\r\n** primitive types |  itype  |         |\r\n** lightuserdata   |  itype  |  void * |  (32 bit platforms)\r\n** lightuserdata   |ffff|    void *    |  (64 bit platforms, 47 bit pointers)\r\n** GC objects      |  itype  |  GCRef  |\r\n** int (LJ_DUALNUM)|  itype  |   int   |\r\n** number           -------double------\r\n**\r\n** Format for 64 bit GC references (LJ_GC64):\r\n**\r\n** The upper 13 bits must be 1 (0xfff8...) for a special NaN. The next\r\n** 4 bits hold the internal tag. The lowest 47 bits either hold a pointer,\r\n** a zero-extended 32 bit integer or all bits set to 1 for primitive types.\r\n**\r\n**                     ------MSW------.------LSW------\r\n** primitive types    |1..1|itype|1..................1|\r\n** GC objects/lightud |1..1|itype|-------GCRef--------|\r\n** int (LJ_DUALNUM)   |1..1|itype|0..0|-----int-------|\r\n** number              ------------double-------------\r\n**\r\n** ORDER LJ_T\r\n** Primitive types nil/false/true must be first, lightuserdata next.\r\n** GC objects are at the end, table/userdata must be lowest.\r\n** Also check lj_ir.h for similar ordering constraints.\r\n*/\r\n#define LJ_TNIL\t\t\t(~0u)\r\n#define LJ_TFALSE\t\t(~1u)\r\n#define LJ_TTRUE\t\t(~2u)\r\n#define LJ_TLIGHTUD\t\t(~3u)\r\n#define LJ_TSTR\t\t\t(~4u)\r\n#define LJ_TUPVAL\t\t(~5u)\r\n#define LJ_TTHREAD\t\t(~6u)\r\n#define LJ_TPROTO\t\t(~7u)\r\n#define LJ_TFUNC\t\t(~8u)\r\n#define LJ_TTRACE\t\t(~9u)\r\n#define LJ_TCDATA\t\t(~10u)\r\n#define LJ_TTAB\t\t\t(~11u)\r\n#define LJ_TUDATA\t\t(~12u)\r\n/* This is just the canonical number type used in some places. */\r\n#define LJ_TNUMX\t\t(~13u)\r\n\r\n/* Integers have itype == LJ_TISNUM doubles have itype < LJ_TISNUM */\r\n#if LJ_64 && !LJ_GC64\r\n#define LJ_TISNUM\t\t0xfffeffffu\r\n#else\r\n#define LJ_TISNUM\t\tLJ_TNUMX\r\n#endif\r\n#define LJ_TISTRUECOND\t\tLJ_TFALSE\r\n#define LJ_TISPRI\t\tLJ_TTRUE\r\n#define LJ_TISGCV\t\t(LJ_TSTR+1)\r\n#define LJ_TISTABUD\t\tLJ_TTAB\r\n\r\n#if LJ_GC64\r\n#define LJ_GCVMASK\t\t(((uint64_t)1 << 47) - 1)\r\n#endif\r\n\r\n/* -- String object ------------------------------------------------------- */\r\n\r\n/* String object header. String payload follows. */\r\ntypedef struct GCstr {\r\n  GCHeader;\r\n  uint8_t reserved;\t/* Used by lexer for fast lookup of reserved words. */\r\n  uint8_t unused;\r\n  MSize hash;\t\t/* Hash of string. */\r\n  MSize len;\t\t/* Size of string. */\r\n} GCstr;\r\n\r\n#define strref(r)\t(&gcref((r))->str)\r\n#define strdata(s)\t((const char *)((s)+1))\r\n#define strdatawr(s)\t((char *)((s)+1))\r\n#define strVdata(o)\tstrdata(strV(o))\r\n#define sizestring(s)\t(sizeof(struct GCstr)+(s)->len+1)\r\n\r\n/* -- Userdata object ----------------------------------------------------- */\r\n\r\n/* Userdata object. Payload follows. */\r\ntypedef struct GCudata {\r\n  GCHeader;\r\n  uint8_t udtype;\t/* Userdata type. */\r\n  uint8_t unused2;\r\n  GCRef env;\t\t/* Should be at same offset in GCfunc. */\r\n  MSize len;\t\t/* Size of payload. */\r\n  GCRef metatable;\t/* Must be at same offset in GCtab. */\r\n  uint32_t align1;\t/* To force 8 byte alignment of the payload. */\r\n} GCudata;\r\n\r\n/* Userdata types. */\r\nenum {\r\n  UDTYPE_USERDATA,\t/* Regular userdata. */\r\n  UDTYPE_IO_FILE,\t/* I/O library FILE. */\r\n  UDTYPE_FFI_CLIB,\t/* FFI C library namespace. */\r\n  UDTYPE__MAX\r\n};\r\n\r\n#define uddata(u)\t((void *)((u)+1))\r\n#define sizeudata(u)\t(sizeof(struct GCudata)+(u)->len)\r\n\r\n/* -- C data object ------------------------------------------------------- */\r\n\r\n/* C data object. Payload follows. */\r\ntypedef struct GCcdata {\r\n  GCHeader;\r\n  uint16_t ctypeid;\t/* C type ID. */\r\n} GCcdata;\r\n\r\n/* Prepended to variable-sized or realigned C data objects. */\r\ntypedef struct GCcdataVar {\r\n  uint16_t offset;\t/* Offset to allocated memory (relative to GCcdata). */\r\n  uint16_t extra;\t/* Extra space allocated (incl. GCcdata + GCcdatav). */\r\n  MSize len;\t\t/* Size of payload. */\r\n} GCcdataVar;\r\n\r\n#define cdataptr(cd)\t((void *)((cd)+1))\r\n#define cdataisv(cd)\t((cd)->marked & 0x80)\r\n#define cdatav(cd)\t((GCcdataVar *)((char *)(cd) - sizeof(GCcdataVar)))\r\n#define cdatavlen(cd)\tcheck_exp(cdataisv(cd), cdatav(cd)->len)\r\n#define sizecdatav(cd)\t(cdatavlen(cd) + cdatav(cd)->extra)\r\n#define memcdatav(cd)\t((void *)((char *)(cd) - cdatav(cd)->offset))\r\n\r\n/* -- Prototype object ---------------------------------------------------- */\r\n\r\n#define SCALE_NUM_GCO\t((int32_t)sizeof(lua_Number)/sizeof(GCRef))\r\n#define round_nkgc(n)\t(((n) + SCALE_NUM_GCO-1) & ~(SCALE_NUM_GCO-1))\r\n\r\ntypedef struct GCproto {\r\n  GCHeader;\r\n  uint8_t numparams;\t/* Number of parameters. */\r\n  uint8_t framesize;\t/* Fixed frame size. */\r\n  MSize sizebc;\t\t/* Number of bytecode instructions. */\r\n#if LJ_GC64\r\n  uint32_t unused_gc64;\r\n#endif\r\n  GCRef gclist;\r\n  MRef k;\t\t/* Split constant array (points to the middle). */\r\n  MRef uv;\t\t/* Upvalue list. local slot|0x8000 or parent uv idx. */\r\n  MSize sizekgc;\t/* Number of collectable constants. */\r\n  MSize sizekn;\t\t/* Number of lua_Number constants. */\r\n  MSize sizept;\t\t/* Total size including colocated arrays. */\r\n  uint8_t sizeuv;\t/* Number of upvalues. */\r\n  uint8_t flags;\t/* Miscellaneous flags (see below). */\r\n  uint16_t trace;\t/* Anchor for chain of root traces. */\r\n  /* ------ The following fields are for debugging/tracebacks only ------ */\r\n  GCRef chunkname;\t/* Name of the chunk this function was defined in. */\r\n  BCLine firstline;\t/* First line of the function definition. */\r\n  BCLine numline;\t/* Number of lines for the function definition. */\r\n  MRef lineinfo;\t/* Compressed map from bytecode ins. to source line. */\r\n  MRef uvinfo;\t\t/* Upvalue names. */\r\n  MRef varinfo;\t\t/* Names and compressed extents of local variables. */\r\n} GCproto;\r\n\r\n/* Flags for prototype. */\r\n#define PROTO_CHILD\t\t0x01\t/* Has child prototypes. */\r\n#define PROTO_VARARG\t\t0x02\t/* Vararg function. */\r\n#define PROTO_FFI\t\t0x04\t/* Uses BC_KCDATA for FFI datatypes. */\r\n#define PROTO_NOJIT\t\t0x08\t/* JIT disabled for this function. */\r\n#define PROTO_ILOOP\t\t0x10\t/* Patched bytecode with ILOOP etc. */\r\n/* Only used during parsing. */\r\n#define PROTO_HAS_RETURN\t0x20\t/* Already emitted a return. */\r\n#define PROTO_FIXUP_RETURN\t0x40\t/* Need to fixup emitted returns. */\r\n/* Top bits used for counting created closures. */\r\n#define PROTO_CLCOUNT\t\t0x20\t/* Base of saturating 3 bit counter. */\r\n#define PROTO_CLC_BITS\t\t3\r\n#define PROTO_CLC_POLY\t\t(3*PROTO_CLCOUNT)  /* Polymorphic threshold. */\r\n\r\n#define PROTO_UV_LOCAL\t\t0x8000\t/* Upvalue for local slot. */\r\n#define PROTO_UV_IMMUTABLE\t0x4000\t/* Immutable upvalue. */\r\n\r\n#define proto_kgc(pt, idx) \\\r\n  check_exp((uintptr_t)(intptr_t)(idx) >= (uintptr_t)-(intptr_t)(pt)->sizekgc, \\\r\n\t    gcref(mref((pt)->k, GCRef)[(idx)]))\r\n#define proto_knumtv(pt, idx) \\\r\n  check_exp((uintptr_t)(idx) < (pt)->sizekn, &mref((pt)->k, TValue)[(idx)])\r\n#define proto_bc(pt)\t\t((BCIns *)((char *)(pt) + sizeof(GCproto)))\r\n#define proto_bcpos(pt, pc)\t((BCPos)((pc) - proto_bc(pt)))\r\n#define proto_uv(pt)\t\t(mref((pt)->uv, uint16_t))\r\n\r\n#define proto_chunkname(pt)\t(strref((pt)->chunkname))\r\n#define proto_chunknamestr(pt)\t(strdata(proto_chunkname((pt))))\r\n#define proto_lineinfo(pt)\t(mref((pt)->lineinfo, const void))\r\n#define proto_uvinfo(pt)\t(mref((pt)->uvinfo, const uint8_t))\r\n#define proto_varinfo(pt)\t(mref((pt)->varinfo, const uint8_t))\r\n\r\n/* -- Upvalue object ------------------------------------------------------ */\r\n\r\ntypedef struct GCupval {\r\n  GCHeader;\r\n  uint8_t closed;\t/* Set if closed (i.e. uv->v == &uv->u.value). */\r\n  uint8_t immutable;\t/* Immutable value. */\r\n  union {\r\n    TValue tv;\t\t/* If closed: the value itself. */\r\n    struct {\t\t/* If open: double linked list, anchored at thread. */\r\n      GCRef prev;\r\n      GCRef next;\r\n    };\r\n  };\r\n  MRef v;\t\t/* Points to stack slot (open) or above (closed). */\r\n  uint32_t dhash;\t/* Disambiguation hash: dh1 != dh2 => cannot alias. */\r\n} GCupval;\r\n\r\n#define uvprev(uv_)\t(&gcref((uv_)->prev)->uv)\r\n#define uvnext(uv_)\t(&gcref((uv_)->next)->uv)\r\n#define uvval(uv_)\t(mref((uv_)->v, TValue))\r\n\r\n/* -- Function object (closures) ------------------------------------------ */\r\n\r\n/* Common header for functions. env should be at same offset in GCudata. */\r\n#define GCfuncHeader \\\r\n  GCHeader; uint8_t ffid; uint8_t nupvalues; \\\r\n  GCRef env; GCRef gclist; MRef pc\r\n\r\ntypedef struct GCfuncC {\r\n  GCfuncHeader;\r\n  lua_CFunction f;\t/* C function to be called. */\r\n  TValue upvalue[1];\t/* Array of upvalues (TValue). */\r\n} GCfuncC;\r\n\r\ntypedef struct GCfuncL {\r\n  GCfuncHeader;\r\n  GCRef uvptr[1];\t/* Array of _pointers_ to upvalue objects (GCupval). */\r\n} GCfuncL;\r\n\r\ntypedef union GCfunc {\r\n  GCfuncC c;\r\n  GCfuncL l;\r\n} GCfunc;\r\n\r\n#define FF_LUA\t\t0\r\n#define FF_C\t\t1\r\n#define isluafunc(fn)\t((fn)->c.ffid == FF_LUA)\r\n#define iscfunc(fn)\t((fn)->c.ffid == FF_C)\r\n#define isffunc(fn)\t((fn)->c.ffid > FF_C)\r\n#define funcproto(fn) \\\r\n  check_exp(isluafunc(fn), (GCproto *)(mref((fn)->l.pc, char)-sizeof(GCproto)))\r\n#define sizeCfunc(n)\t(sizeof(GCfuncC)-sizeof(TValue)+sizeof(TValue)*(n))\r\n#define sizeLfunc(n)\t(sizeof(GCfuncL)-sizeof(GCRef)+sizeof(GCRef)*(n))\r\n\r\n/* -- Table object -------------------------------------------------------- */\r\n\r\n/* Hash node. */\r\ntypedef struct Node {\r\n  TValue val;\t\t/* Value object. Must be first field. */\r\n  TValue key;\t\t/* Key object. */\r\n  MRef next;\t\t/* Hash chain. */\r\n#if !LJ_GC64\r\n  MRef freetop;\t\t/* Top of free elements (stored in t->node[0]). */\r\n#endif\r\n} Node;\r\n\r\nLJ_STATIC_ASSERT(offsetof(Node, val) == 0);\r\n\r\ntypedef struct GCtab {\r\n  GCHeader;\r\n  uint8_t nomm;\t\t/* Negative cache for fast metamethods. */\r\n  int8_t colo;\t\t/* Array colocation. */\r\n  MRef array;\t\t/* Array part. */\r\n  GCRef gclist;\r\n  GCRef metatable;\t/* Must be at same offset in GCudata. */\r\n  MRef node;\t\t/* Hash part. */\r\n  uint32_t asize;\t/* Size of array part (keys [0, asize-1]). */\r\n  uint32_t hmask;\t/* Hash part mask (size of hash part - 1). */\r\n#if LJ_GC64\r\n  MRef freetop;\t\t/* Top of free elements. */\r\n#endif\r\n} GCtab;\r\n\r\n#define sizetabcolo(n)\t((n)*sizeof(TValue) + sizeof(GCtab))\r\n#define tabref(r)\t(&gcref((r))->tab)\r\n#define noderef(r)\t(mref((r), Node))\r\n#define nextnode(n)\t(mref((n)->next, Node))\r\n#if LJ_GC64\r\n#define getfreetop(t, n)\t(noderef((t)->freetop))\r\n#define setfreetop(t, n, v)\t(setmref((t)->freetop, (v)))\r\n#else\r\n#define getfreetop(t, n)\t(noderef((n)->freetop))\r\n#define setfreetop(t, n, v)\t(setmref((n)->freetop, (v)))\r\n#endif\r\n\r\n/* -- State objects ------------------------------------------------------- */\r\n\r\n/* VM states. */\r\nenum {\r\n  LJ_VMST_INTERP,\t/* Interpreter. */\r\n  LJ_VMST_C,\t\t/* C function. */\r\n  LJ_VMST_GC,\t\t/* Garbage collector. */\r\n  LJ_VMST_EXIT,\t\t/* Trace exit handler. */\r\n  LJ_VMST_RECORD,\t/* Trace recorder. */\r\n  LJ_VMST_OPT,\t\t/* Optimizer. */\r\n  LJ_VMST_ASM,\t\t/* Assembler. */\r\n  LJ_VMST__MAX\r\n};\r\n\r\n#define setvmstate(g, st)\t((g)->vmstate = ~LJ_VMST_##st)\r\n\r\n/* Metamethods. ORDER MM */\r\n#ifdef LJ_HASFFI\r\n#define MMDEF_FFI(_) _(new)\r\n#else\r\n#define MMDEF_FFI(_)\r\n#endif\r\n\r\n#if LJ_52 || LJ_HASFFI\r\n#define MMDEF_PAIRS(_) _(pairs) _(ipairs)\r\n#else\r\n#define MMDEF_PAIRS(_)\r\n#define MM_pairs\t255\r\n#define MM_ipairs\t255\r\n#endif\r\n\r\n#define MMDEF(_) \\\r\n  _(index) _(newindex) _(gc) _(mode) _(eq) _(len) \\\r\n  /* Only the above (fast) metamethods are negative cached (max. 8). */ \\\r\n  _(lt) _(le) _(concat) _(call) \\\r\n  /* The following must be in ORDER ARITH. */ \\\r\n  _(add) _(sub) _(mul) _(div) _(mod) _(pow) _(unm) \\\r\n  /* The following are used in the standard libraries. */ \\\r\n  _(metatable) _(tostring) MMDEF_FFI(_) MMDEF_PAIRS(_)\r\n\r\ntypedef enum {\r\n#define MMENUM(name)\tMM_##name,\r\nMMDEF(MMENUM)\r\n#undef MMENUM\r\n  MM__MAX,\r\n  MM____ = MM__MAX,\r\n  MM_FAST = MM_len\r\n} MMS;\r\n\r\n/* GC root IDs. */\r\ntypedef enum {\r\n  GCROOT_MMNAME,\t/* Metamethod names. */\r\n  GCROOT_MMNAME_LAST = GCROOT_MMNAME + MM__MAX-1,\r\n  GCROOT_BASEMT,\t/* Metatables for base types. */\r\n  GCROOT_BASEMT_NUM = GCROOT_BASEMT + ~LJ_TNUMX,\r\n  GCROOT_IO_INPUT,\t/* Userdata for default I/O input file. */\r\n  GCROOT_IO_OUTPUT,\t/* Userdata for default I/O output file. */\r\n  GCROOT_MAX\r\n} GCRootID;\r\n\r\n#define basemt_it(g, it)\t((g)->gcroot[GCROOT_BASEMT+~(it)])\r\n#define basemt_obj(g, o)\t((g)->gcroot[GCROOT_BASEMT+itypemap(o)])\r\n#define mmname_str(g, mm)\t(strref((g)->gcroot[GCROOT_MMNAME+(mm)]))\r\n\r\ntypedef struct GCState {\r\n  GCSize total;\t\t/* Memory currently allocated. */\r\n  GCSize threshold;\t/* Memory threshold. */\r\n  uint8_t currentwhite;\t/* Current white color. */\r\n  uint8_t state;\t/* GC state. */\r\n  uint8_t nocdatafin;\t/* No cdata finalizer called. */\r\n  uint8_t unused2;\r\n  MSize sweepstr;\t/* Sweep position in string table. */\r\n  GCRef root;\t\t/* List of all collectable objects. */\r\n  MRef sweep;\t\t/* Sweep position in root list. */\r\n  GCRef gray;\t\t/* List of gray objects. */\r\n  GCRef grayagain;\t/* List of objects for atomic traversal. */\r\n  GCRef weak;\t\t/* List of weak tables (to be cleared). */\r\n  GCRef mmudata;\t/* List of userdata (to be finalized). */\r\n  GCSize debt;\t\t/* Debt (how much GC is behind schedule). */\r\n  GCSize estimate;\t/* Estimate of memory actually in use. */\r\n  MSize stepmul;\t/* Incremental GC step granularity. */\r\n  MSize pause;\t\t/* Pause between successive GC cycles. */\r\n} GCState;\r\n\r\n/* Global state, shared by all threads of a Lua universe. */\r\ntypedef struct global_State {\r\n  GCRef *strhash;\t/* String hash table (hash chain anchors). */\r\n  MSize strmask;\t/* String hash mask (size of hash table - 1). */\r\n  MSize strnum;\t\t/* Number of strings in hash table. */\r\n  lua_Alloc allocf;\t/* Memory allocator. */\r\n  void *allocd;\t\t/* Memory allocator data. */\r\n  GCState gc;\t\t/* Garbage collector. */\r\n  volatile int32_t vmstate;  /* VM state or current JIT code trace number. */\r\n  SBuf tmpbuf;\t\t/* Temporary string buffer. */\r\n  GCstr strempty;\t/* Empty string. */\r\n  uint8_t stremptyz;\t/* Zero terminator of empty string. */\r\n  uint8_t hookmask;\t/* Hook mask. */\r\n  uint8_t dispatchmode;\t/* Dispatch mode. */\r\n  uint8_t vmevmask;\t/* VM event mask. */\r\n  GCRef mainthref;\t/* Link to main thread. */\r\n  TValue registrytv;\t/* Anchor for registry. */\r\n  TValue tmptv, tmptv2;\t/* Temporary TValues. */\r\n  Node nilnode;\t\t/* Fallback 1-element hash part (nil key and value). */\r\n  GCupval uvhead;\t/* Head of double-linked list of all open upvalues. */\r\n  int32_t hookcount;\t/* Instruction hook countdown. */\r\n  int32_t hookcstart;\t/* Start count for instruction hook counter. */\r\n  lua_Hook hookf;\t/* Hook function. */\r\n  lua_CFunction wrapf;\t/* Wrapper for C function calls. */\r\n  lua_CFunction panic;\t/* Called as a last resort for errors. */\r\n  BCIns bc_cfunc_int;\t/* Bytecode for internal C function calls. */\r\n  BCIns bc_cfunc_ext;\t/* Bytecode for external C function calls. */\r\n  GCRef cur_L;\t\t/* Currently executing lua_State. */\r\n  MRef jit_base;\t/* Current JIT code L->base or NULL. */\r\n  MRef ctype_state;\t/* Pointer to C type state. */\r\n  GCRef gcroot[GCROOT_MAX];  /* GC roots. */\r\n} global_State;\r\n\r\n#define mainthread(g)\t(&gcref(g->mainthref)->th)\r\n#define niltv(L) \\\r\n  check_exp(tvisnil(&G(L)->nilnode.val), &G(L)->nilnode.val)\r\n#define niltvg(g) \\\r\n  check_exp(tvisnil(&(g)->nilnode.val), &(g)->nilnode.val)\r\n\r\n/* Hook management. Hook event masks are defined in lua.h. */\r\n#define HOOK_EVENTMASK\t\t0x0f\r\n#define HOOK_ACTIVE\t\t0x10\r\n#define HOOK_ACTIVE_SHIFT\t4\r\n#define HOOK_VMEVENT\t\t0x20\r\n#define HOOK_GC\t\t\t0x40\r\n#define HOOK_PROFILE\t\t0x80\r\n#define hook_active(g)\t\t((g)->hookmask & HOOK_ACTIVE)\r\n#define hook_enter(g)\t\t((g)->hookmask |= HOOK_ACTIVE)\r\n#define hook_entergc(g)\t\t((g)->hookmask |= (HOOK_ACTIVE|HOOK_GC))\r\n#define hook_vmevent(g)\t\t((g)->hookmask |= (HOOK_ACTIVE|HOOK_VMEVENT))\r\n#define hook_leave(g)\t\t((g)->hookmask &= ~HOOK_ACTIVE)\r\n#define hook_save(g)\t\t((g)->hookmask & ~HOOK_EVENTMASK)\r\n#define hook_restore(g, h) \\\r\n  ((g)->hookmask = ((g)->hookmask & HOOK_EVENTMASK) | (h))\r\n\r\n/* Per-thread state object. */\r\nstruct lua_State {\r\n  GCHeader;\r\n  uint8_t dummy_ffid;\t/* Fake FF_C for curr_funcisL() on dummy frames. */\r\n  uint8_t status;\t/* Thread status. */\r\n  MRef glref;\t\t/* Link to global state. */\r\n  GCRef gclist;\t\t/* GC chain. */\r\n  TValue *base;\t\t/* Base of currently executing function. */\r\n  TValue *top;\t\t/* First free slot in the stack. */\r\n  MRef maxstack;\t/* Last free slot in the stack. */\r\n  MRef stack;\t\t/* Stack base. */\r\n  GCRef openupval;\t/* List of open upvalues in the stack. */\r\n  GCRef env;\t\t/* Thread environment (table of globals). */\r\n  void *cframe;\t\t/* End of C stack frame chain. */\r\n  MSize stacksize;\t/* True stack size (incl. LJ_STACK_EXTRA). */\r\n};\r\n\r\n#define G(L)\t\t\t(mref(L->glref, global_State))\r\n#define registry(L)\t\t(&G(L)->registrytv)\r\n\r\n/* Macros to access the currently executing (Lua) function. */\r\n#if LJ_GC64\r\n#define curr_func(L)\t\t(&gcval(L->base-2)->fn)\r\n#elif LJ_FR2\r\n#define curr_func(L)\t\t(&gcref((L->base-2)->gcr)->fn)\r\n#else\r\n#define curr_func(L)\t\t(&gcref((L->base-1)->fr.func)->fn)\r\n#endif\r\n#define curr_funcisL(L)\t\t(isluafunc(curr_func(L)))\r\n#define curr_proto(L)\t\t(funcproto(curr_func(L)))\r\n#define curr_topL(L)\t\t(L->base + curr_proto(L)->framesize)\r\n#define curr_top(L)\t\t(curr_funcisL(L) ? curr_topL(L) : L->top)\r\n\r\n/* -- GC object definition and conversions -------------------------------- */\r\n\r\n/* GC header for generic access to common fields of GC objects. */\r\ntypedef struct GChead {\r\n  GCHeader;\r\n  uint8_t unused1;\r\n  uint8_t unused2;\r\n  GCRef env;\r\n  GCRef gclist;\r\n  GCRef metatable;\r\n} GChead;\r\n\r\n/* The env field SHOULD be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, env) == offsetof(GCfuncL, env));\r\nLJ_STATIC_ASSERT(offsetof(GChead, env) == offsetof(GCudata, env));\r\n\r\n/* The metatable field MUST be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, metatable) == offsetof(GCtab, metatable));\r\nLJ_STATIC_ASSERT(offsetof(GChead, metatable) == offsetof(GCudata, metatable));\r\n\r\n/* The gclist field MUST be at the same offset for all GC objects. */\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(lua_State, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCproto, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCfuncL, gclist));\r\nLJ_STATIC_ASSERT(offsetof(GChead, gclist) == offsetof(GCtab, gclist));\r\n\r\ntypedef union GCobj {\r\n  GChead gch;\r\n  GCstr str;\r\n  GCupval uv;\r\n  lua_State th;\r\n  GCproto pt;\r\n  GCfunc fn;\r\n  GCcdata cd;\r\n  GCtab tab;\r\n  GCudata ud;\r\n} GCobj;\r\n\r\n/* Macros to convert a GCobj pointer into a specific value. */\r\n#define gco2str(o)\tcheck_exp((o)->gch.gct == ~LJ_TSTR, &(o)->str)\r\n#define gco2uv(o)\tcheck_exp((o)->gch.gct == ~LJ_TUPVAL, &(o)->uv)\r\n#define gco2th(o)\tcheck_exp((o)->gch.gct == ~LJ_TTHREAD, &(o)->th)\r\n#define gco2pt(o)\tcheck_exp((o)->gch.gct == ~LJ_TPROTO, &(o)->pt)\r\n#define gco2func(o)\tcheck_exp((o)->gch.gct == ~LJ_TFUNC, &(o)->fn)\r\n#define gco2cd(o)\tcheck_exp((o)->gch.gct == ~LJ_TCDATA, &(o)->cd)\r\n#define gco2tab(o)\tcheck_exp((o)->gch.gct == ~LJ_TTAB, &(o)->tab)\r\n#define gco2ud(o)\tcheck_exp((o)->gch.gct == ~LJ_TUDATA, &(o)->ud)\r\n\r\n/* Macro to convert any collectable object into a GCobj pointer. */\r\n#define obj2gco(v)\t((GCobj *)(v))\r\n\r\n/* -- TValue getters/setters ---------------------------------------------- */\r\n\r\n#ifdef LUA_USE_ASSERT\r\n#include \"lj_gc.h\"\r\n#endif\r\n\r\n/* Macros to test types. */\r\n#if LJ_GC64\r\n#define itype(o)\t((uint32_t)((o)->it64 >> 47))\r\n#define tvisnil(o)\t((o)->it64 == -1)\r\n#else\r\n#define itype(o)\t((o)->it)\r\n#define tvisnil(o)\t(itype(o) == LJ_TNIL)\r\n#endif\r\n#define tvisfalse(o)\t(itype(o) == LJ_TFALSE)\r\n#define tvistrue(o)\t(itype(o) == LJ_TTRUE)\r\n#define tvisbool(o)\t(tvisfalse(o) || tvistrue(o))\r\n#if LJ_64 && !LJ_GC64\r\n#define tvislightud(o)\t(((int32_t)itype(o) >> 15) == -2)\r\n#else\r\n#define tvislightud(o)\t(itype(o) == LJ_TLIGHTUD)\r\n#endif\r\n#define tvisstr(o)\t(itype(o) == LJ_TSTR)\r\n#define tvisfunc(o)\t(itype(o) == LJ_TFUNC)\r\n#define tvisthread(o)\t(itype(o) == LJ_TTHREAD)\r\n#define tvisproto(o)\t(itype(o) == LJ_TPROTO)\r\n#define tviscdata(o)\t(itype(o) == LJ_TCDATA)\r\n#define tvistab(o)\t(itype(o) == LJ_TTAB)\r\n#define tvisudata(o)\t(itype(o) == LJ_TUDATA)\r\n#define tvisnumber(o)\t(itype(o) <= LJ_TISNUM)\r\n#define tvisint(o)\t(LJ_DUALNUM && itype(o) == LJ_TISNUM)\r\n#define tvisnum(o)\t(itype(o) < LJ_TISNUM)\r\n\r\n#define tvistruecond(o)\t(itype(o) < LJ_TISTRUECOND)\r\n#define tvispri(o)\t(itype(o) >= LJ_TISPRI)\r\n#define tvistabud(o)\t(itype(o) <= LJ_TISTABUD)  /* && !tvisnum() */\r\n#define tvisgcv(o)\t((itype(o) - LJ_TISGCV) > (LJ_TNUMX - LJ_TISGCV))\r\n\r\n/* Special macros to test numbers for NaN, +0, -0, +1 and raw equality. */\r\n#define tvisnan(o)\t((o)->n != (o)->n)\r\n#if LJ_64\r\n#define tviszero(o)\t(((o)->u64 << 1) == 0)\r\n#else\r\n#define tviszero(o)\t(((o)->u32.lo | ((o)->u32.hi << 1)) == 0)\r\n#endif\r\n#define tvispzero(o)\t((o)->u64 == 0)\r\n#define tvismzero(o)\t((o)->u64 == U64x(80000000,00000000))\r\n#define tvispone(o)\t((o)->u64 == U64x(3ff00000,00000000))\r\n#define rawnumequal(o1, o2)\t((o1)->u64 == (o2)->u64)\r\n\r\n/* Macros to convert type ids. */\r\n#if LJ_64 && !LJ_GC64\r\n#define itypemap(o) \\\r\n  (tvisnumber(o) ? ~LJ_TNUMX : tvislightud(o) ? ~LJ_TLIGHTUD : ~itype(o))\r\n#else\r\n#define itypemap(o)\t(tvisnumber(o) ? ~LJ_TNUMX : ~itype(o))\r\n#endif\r\n\r\n/* Macros to get tagged values. */\r\n#if LJ_GC64\r\n#define gcval(o)\t((GCobj *)(gcrefu((o)->gcr) & LJ_GCVMASK))\r\n#else\r\n#define gcval(o)\t(gcref((o)->gcr))\r\n#endif\r\n#define boolV(o)\tcheck_exp(tvisbool(o), (LJ_TFALSE - itype(o)))\r\n#if LJ_64\r\n#define lightudV(o) \\\r\n  check_exp(tvislightud(o), (void *)((o)->u64 & U64x(00007fff,ffffffff)))\r\n#else\r\n#define lightudV(o)\tcheck_exp(tvislightud(o), gcrefp((o)->gcr, void))\r\n#endif\r\n#define gcV(o)\t\tcheck_exp(tvisgcv(o), gcval(o))\r\n#define strV(o)\t\tcheck_exp(tvisstr(o), &gcval(o)->str)\r\n#define funcV(o)\tcheck_exp(tvisfunc(o), &gcval(o)->fn)\r\n#define threadV(o)\tcheck_exp(tvisthread(o), &gcval(o)->th)\r\n#define protoV(o)\tcheck_exp(tvisproto(o), &gcval(o)->pt)\r\n#define cdataV(o)\tcheck_exp(tviscdata(o), &gcval(o)->cd)\r\n#define tabV(o)\t\tcheck_exp(tvistab(o), &gcval(o)->tab)\r\n#define udataV(o)\tcheck_exp(tvisudata(o), &gcval(o)->ud)\r\n#define numV(o)\t\tcheck_exp(tvisnum(o), (o)->n)\r\n#define intV(o)\t\tcheck_exp(tvisint(o), (int32_t)(o)->i)\r\n\r\n/* Macros to set tagged values. */\r\n#if LJ_GC64\r\n#define setitype(o, i)\t\t((o)->it = ((i) << 15))\r\n#define setnilV(o)\t\t((o)->it64 = -1)\r\n#define setpriV(o, x)\t\t((o)->it64 = (int64_t)~((uint64_t)~(x)<<47))\r\n#define setboolV(o, x)\t\t((o)->it64 = (int64_t)~((uint64_t)((x)+1)<<47))\r\n#else\r\n#define setitype(o, i)\t\t((o)->it = (i))\r\n#define setnilV(o)\t\t((o)->it = LJ_TNIL)\r\n#define setboolV(o, x)\t\t((o)->it = LJ_TFALSE-(uint32_t)(x))\r\n#define setpriV(o, i)\t\t(setitype((o), (i)))\r\n#endif\r\n\r\nstatic LJ_AINLINE void setlightudV(TValue *o, void *p)\r\n{\r\n#if LJ_GC64\r\n  o->u64 = (uint64_t)p | (((uint64_t)LJ_TLIGHTUD) << 47);\r\n#elif LJ_64\r\n  o->u64 = (uint64_t)p | (((uint64_t)0xffff) << 48);\r\n#else\r\n  setgcrefp(o->gcr, p); setitype(o, LJ_TLIGHTUD);\r\n#endif\r\n}\r\n\r\n#if LJ_64\r\n#define checklightudptr(L, p) \\\r\n  (((uint64_t)(p) >> 47) ? (lj_err_msg(L, LJ_ERR_BADLU), NULL) : (p))\r\n#else\r\n#define checklightudptr(L, p)\t(p)\r\n#endif\r\n\r\n#if LJ_FR2\r\n#define setcont(o, f)\t\t((o)->u64 = (uint64_t)(uintptr_t)(void *)(f))\r\n#elif LJ_64\r\n#define setcont(o, f) \\\r\n  ((o)->u64 = (uint64_t)(void *)(f) - (uint64_t)lj_vm_asm_begin)\r\n#else\r\n#define setcont(o, f)\t\tsetlightudV((o), (void *)(f))\r\n#endif\r\n\r\n#define tvchecklive(L, o) \\\r\n  UNUSED(L), lua_assert(!tvisgcv(o) || \\\r\n  ((~itype(o) == gcval(o)->gch.gct) && !isdead(G(L), gcval(o))))\r\n\r\nstatic LJ_AINLINE void setgcVraw(TValue *o, GCobj *v, uint32_t itype)\r\n{\r\n#if LJ_GC64\r\n  setgcreft(o->gcr, v, itype);\r\n#else\r\n  setgcref(o->gcr, v); setitype(o, itype);\r\n#endif\r\n}\r\n\r\nstatic LJ_AINLINE void setgcV(lua_State *L, TValue *o, GCobj *v, uint32_t it)\r\n{\r\n  setgcVraw(o, v, it); tvchecklive(L, o);\r\n}\r\n\r\n#define define_setV(name, type, tag) \\\r\nstatic LJ_AINLINE void name(lua_State *L, TValue *o, type *v) \\\r\n{ \\\r\n  setgcV(L, o, obj2gco(v), tag); \\\r\n}\r\ndefine_setV(setstrV, GCstr, LJ_TSTR)\r\ndefine_setV(setthreadV, lua_State, LJ_TTHREAD)\r\ndefine_setV(setprotoV, GCproto, LJ_TPROTO)\r\ndefine_setV(setfuncV, GCfunc, LJ_TFUNC)\r\ndefine_setV(setcdataV, GCcdata, LJ_TCDATA)\r\ndefine_setV(settabV, GCtab, LJ_TTAB)\r\ndefine_setV(setudataV, GCudata, LJ_TUDATA)\r\n\r\n#define setnumV(o, x)\t\t((o)->n = (x))\r\n#define setnanV(o)\t\t((o)->u64 = U64x(fff80000,00000000))\r\n#define setpinfV(o)\t\t((o)->u64 = U64x(7ff00000,00000000))\r\n#define setminfV(o)\t\t((o)->u64 = U64x(fff00000,00000000))\r\n\r\nstatic LJ_AINLINE void setintV(TValue *o, int32_t i)\r\n{\r\n#if LJ_DUALNUM\r\n  o->i = (uint32_t)i; setitype(o, LJ_TISNUM);\r\n#else\r\n  o->n = (lua_Number)i;\r\n#endif\r\n}\r\n\r\nstatic LJ_AINLINE void setint64V(TValue *o, int64_t i)\r\n{\r\n  if (LJ_DUALNUM && LJ_LIKELY(i == (int64_t)(int32_t)i))\r\n    setintV(o, (int32_t)i);\r\n  else\r\n    setnumV(o, (lua_Number)i);\r\n}\r\n\r\n#if LJ_64\r\n#define setintptrV(o, i)\tsetint64V((o), (i))\r\n#else\r\n#define setintptrV(o, i)\tsetintV((o), (i))\r\n#endif\r\n\r\n/* Copy tagged values. */\r\nstatic LJ_AINLINE void copyTV(lua_State *L, TValue *o1, const TValue *o2)\r\n{\r\n  *o1 = *o2; tvchecklive(L, o1);\r\n}\r\n\r\n/* -- Number to integer conversion ---------------------------------------- */\r\n\r\n#if LJ_SOFTFP\r\nLJ_ASMF int32_t lj_vm_tobit(double x);\r\n#endif\r\n\r\nstatic LJ_AINLINE int32_t lj_num2bit(lua_Number n)\r\n{\r\n#if LJ_SOFTFP\r\n  return lj_vm_tobit(n);\r\n#else\r\n  TValue o;\r\n  o.n = n + 6755399441055744.0;  /* 2^52 + 2^51 */\r\n  return (int32_t)o.u32.lo;\r\n#endif\r\n}\r\n\r\n#define lj_num2int(n)   ((int32_t)(n))\r\n\r\nstatic LJ_AINLINE uint64_t lj_num2u64(lua_Number n)\r\n{\r\n#ifdef _MSC_VER\r\n  if (n >= 9223372036854775808.0)  /* They think it's a feature. */\r\n    return (uint64_t)(int64_t)(n - 18446744073709551616.0);\r\n  else\r\n#endif\r\n    return (uint64_t)n;\r\n}\r\n\r\nstatic LJ_AINLINE int32_t numberVint(cTValue *o)\r\n{\r\n  if (LJ_LIKELY(tvisint(o)))\r\n    return intV(o);\r\n  else\r\n    return lj_num2int(numV(o));\r\n}\r\n\r\nstatic LJ_AINLINE lua_Number numberVnum(cTValue *o)\r\n{\r\n  if (LJ_UNLIKELY(tvisint(o)))\r\n    return (lua_Number)intV(o);\r\n  else\r\n    return numV(o);\r\n}\r\n\r\n/* -- Miscellaneous object handling --------------------------------------- */\r\n\r\n/* Names and maps for internal and external object tags. */\r\nLJ_DATA const char *const lj_obj_typename[1+LUA_TCDATA+1];\r\nLJ_DATA const char *const lj_obj_itypename[~LJ_TNUMX+1];\r\n\r\n#define lj_typename(o)\t(lj_obj_itypename[itypemap(o)])\r\n\r\n/* Compare two objects without calling metamethods. */\r\nLJ_FUNC int LJ_FASTCALL lj_obj_equal(cTValue *o1, cTValue *o2);\r\nLJ_FUNC const void * LJ_FASTCALL lj_obj_ptr(cTValue *o);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_dce.c",
    "content": "/*\r\n** DCE: Dead Code Elimination. Pre-LOOP only -- ASM already performs DCE.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_dce_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Scan through all snapshots and mark all referenced instructions. */\r\nstatic void dce_marksnap(jit_State *J)\r\n{\r\n  SnapNo i, nsnap = J->cur.nsnap;\r\n  for (i = 0; i < nsnap; i++) {\r\n    SnapShot *snap = &J->cur.snap[i];\r\n    SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n    MSize n, nent = snap->nent;\r\n    for (n = 0; n < nent; n++) {\r\n      IRRef ref = snap_ref(map[n]);\r\n      if (ref >= REF_FIRST)\r\n\tirt_setmark(IR(ref)->t);\r\n    }\r\n  }\r\n}\r\n\r\n/* Backwards propagate marks. Replace unused instructions with NOPs. */\r\nstatic void dce_propagate(jit_State *J)\r\n{\r\n  IRRef1 *pchain[IR__MAX];\r\n  IRRef ins;\r\n  uint32_t i;\r\n  for (i = 0; i < IR__MAX; i++) pchain[i] = &J->chain[i];\r\n  for (ins = J->cur.nins-1; ins >= REF_FIRST; ins--) {\r\n    IRIns *ir = IR(ins);\r\n    if (irt_ismarked(ir->t)) {\r\n      irt_clearmark(ir->t);\r\n      pchain[ir->o] = &ir->prev;\r\n    } else if (!ir_sideeff(ir)) {\r\n      *pchain[ir->o] = ir->prev;  /* Reroute original instruction chain. */\r\n      ir->t.irt = IRT_NIL;\r\n      ir->o = IR_NOP;  /* Replace instruction with NOP. */\r\n      ir->op1 = ir->op2 = 0;\r\n      ir->prev = 0;\r\n      continue;\r\n    }\r\n    if (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t);\r\n    if (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t);\r\n  }\r\n}\r\n\r\n/* Dead Code Elimination.\r\n**\r\n** First backpropagate marks for all used instructions. Then replace\r\n** the unused ones with a NOP. Note that compressing the IR to eliminate\r\n** the NOPs does not pay off.\r\n*/\r\nvoid lj_opt_dce(jit_State *J)\r\n{\r\n  if ((J->flags & JIT_F_OPT_DCE)) {\r\n    dce_marksnap(J);\r\n    dce_propagate(J);\r\n    memset(J->bpropcache, 0, sizeof(J->bpropcache));  /* Invalidate cache. */\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_fold.c",
    "content": "/*\r\n** FOLD: Constant Folding, Algebraic Simplifications and Reassociation.\r\n** ABCelim: Array Bounds Check Elimination.\r\n** CSE: Common-Subexpression Elimination.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_fold_c\r\n#define LUA_CORE\r\n\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_carith.h\"\r\n#endif\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* Here's a short description how the FOLD engine processes instructions:\r\n**\r\n** The FOLD engine receives a single instruction stored in fins (J->fold.ins).\r\n** The instruction and its operands are used to select matching fold rules.\r\n** These are applied iteratively until a fixed point is reached.\r\n**\r\n** The 8 bit opcode of the instruction itself plus the opcodes of the\r\n** two instructions referenced by its operands form a 24 bit key\r\n** 'ins left right' (unused operands -> 0, literals -> lowest 8 bits).\r\n**\r\n** This key is used for partial matching against the fold rules. The\r\n** left/right operand fields of the key are successively masked with\r\n** the 'any' wildcard, from most specific to least specific:\r\n**\r\n**   ins left right\r\n**   ins any  right\r\n**   ins left any\r\n**   ins any  any\r\n**\r\n** The masked key is used to lookup a matching fold rule in a semi-perfect\r\n** hash table. If a matching rule is found, the related fold function is run.\r\n** Multiple rules can share the same fold function. A fold rule may return\r\n** one of several special values:\r\n**\r\n** - NEXTFOLD means no folding was applied, because an additional test\r\n**   inside the fold function failed. Matching continues against less\r\n**   specific fold rules. Finally the instruction is passed on to CSE.\r\n**\r\n** - RETRYFOLD means the instruction was modified in-place. Folding is\r\n**   retried as if this instruction had just been received.\r\n**\r\n** All other return values are terminal actions -- no further folding is\r\n** applied:\r\n**\r\n** - INTFOLD(i) returns a reference to the integer constant i.\r\n**\r\n** - LEFTFOLD and RIGHTFOLD return the left/right operand reference\r\n**   without emitting an instruction.\r\n**\r\n** - CSEFOLD and EMITFOLD pass the instruction directly to CSE or emit\r\n**   it without passing through any further optimizations.\r\n**\r\n** - FAILFOLD, DROPFOLD and CONDFOLD only apply to instructions which have\r\n**   no result (e.g. guarded assertions): FAILFOLD means the guard would\r\n**   always fail, i.e. the current trace is pointless. DROPFOLD means\r\n**   the guard is always true and has been eliminated. CONDFOLD is a\r\n**   shortcut for FAILFOLD + cond (i.e. drop if true, otherwise fail).\r\n**\r\n** - Any other return value is interpreted as an IRRef or TRef. This\r\n**   can be a reference to an existing or a newly created instruction.\r\n**   Only the least-significant 16 bits (IRRef1) are used to form a TRef\r\n**   which is finally returned to the caller.\r\n**\r\n** The FOLD engine receives instructions both from the trace recorder and\r\n** substituted instructions from LOOP unrolling. This means all types\r\n** of instructions may end up here, even though the recorder bypasses\r\n** FOLD in some cases. Thus all loads, stores and allocations must have\r\n** an any/any rule to avoid being passed on to CSE.\r\n**\r\n** Carefully read the following requirements before adding or modifying\r\n** any fold rules:\r\n**\r\n** Requirement #1: All fold rules must preserve their destination type.\r\n**\r\n** Consistently use INTFOLD() (KINT result) or lj_ir_knum() (KNUM result).\r\n** Never use lj_ir_knumint() which can have either a KINT or KNUM result.\r\n**\r\n** Requirement #2: Fold rules should not create *new* instructions which\r\n** reference operands *across* PHIs.\r\n**\r\n** E.g. a RETRYFOLD with 'fins->op1 = fleft->op1' is invalid if the\r\n** left operand is a PHI. Then fleft->op1 would point across the PHI\r\n** frontier to an invariant instruction. Adding a PHI for this instruction\r\n** would be counterproductive. The solution is to add a barrier which\r\n** prevents folding across PHIs, i.e. 'PHIBARRIER(fleft)' in this case.\r\n** The only exception is for recurrences with high latencies like\r\n** repeated int->num->int conversions.\r\n**\r\n** One could relax this condition a bit if the referenced instruction is\r\n** a PHI, too. But this often leads to worse code due to excessive\r\n** register shuffling.\r\n**\r\n** Note: returning *existing* instructions (e.g. LEFTFOLD) is ok, though.\r\n** Even returning fleft->op1 would be ok, because a new PHI will added,\r\n** if needed. But again, this leads to excessive register shuffling and\r\n** should be avoided.\r\n**\r\n** Requirement #3: The set of all fold rules must be monotonic to guarantee\r\n** termination.\r\n**\r\n** The goal is optimization, so one primarily wants to add strength-reducing\r\n** rules. This means eliminating an instruction or replacing an instruction\r\n** with one or more simpler instructions. Don't add fold rules which point\r\n** into the other direction.\r\n**\r\n** Some rules (like commutativity) do not directly reduce the strength of\r\n** an instruction, but enable other fold rules (e.g. by moving constants\r\n** to the right operand). These rules must be made unidirectional to avoid\r\n** cycles.\r\n**\r\n** Rule of thumb: the trace recorder expands the IR and FOLD shrinks it.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t(&J->fold.ins)\r\n#define fleft\t\t(&J->fold.left)\r\n#define fright\t\t(&J->fold.right)\r\n#define knumleft\t(ir_knum(fleft)->n)\r\n#define knumright\t(ir_knum(fright)->n)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Fold function type. Fastcall on x86 significantly reduces their size. */\r\ntypedef IRRef (LJ_FASTCALL *FoldFunc)(jit_State *J);\r\n\r\n/* Macros for the fold specs, so buildvm can recognize them. */\r\n#define LJFOLD(x)\r\n#define LJFOLDX(x)\r\n#define LJFOLDF(name)\tstatic TRef LJ_FASTCALL fold_##name(jit_State *J)\r\n/* Note: They must be at the start of a line or buildvm ignores them! */\r\n\r\n/* Barrier to prevent using operands across PHIs. */\r\n#define PHIBARRIER(ir)\tif (irt_isphi((ir)->t)) return NEXTFOLD\r\n\r\n/* Barrier to prevent folding across a GC step.\r\n** GC steps can only happen at the head of a trace and at LOOP.\r\n** And the GC is only driven forward if there's at least one allocation.\r\n*/\r\n#define gcstep_barrier(J, ref) \\\r\n  ((ref) < J->chain[IR_LOOP] && \\\r\n   (J->chain[IR_SNEW] || J->chain[IR_XSNEW] || \\\r\n    J->chain[IR_TNEW] || J->chain[IR_TDUP] || \\\r\n    J->chain[IR_CNEW] || J->chain[IR_CNEWI] || \\\r\n    J->chain[IR_BUFSTR] || J->chain[IR_TOSTR] || J->chain[IR_CALLA]))\r\n\r\n/* -- Constant folding for FP numbers ------------------------------------- */\r\n\r\nLJFOLD(ADD KNUM KNUM)\r\nLJFOLD(SUB KNUM KNUM)\r\nLJFOLD(MUL KNUM KNUM)\r\nLJFOLD(DIV KNUM KNUM)\r\nLJFOLD(NEG KNUM KNUM)\r\nLJFOLD(ABS KNUM KNUM)\r\nLJFOLD(ATAN2 KNUM KNUM)\r\nLJFOLD(LDEXP KNUM KNUM)\r\nLJFOLD(MIN KNUM KNUM)\r\nLJFOLD(MAX KNUM KNUM)\r\nLJFOLDF(kfold_numarith)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number b = knumright;\r\n  lua_Number y = lj_vm_foldarith(a, b, fins->o - IR_ADD);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\nLJFOLD(LDEXP KNUM KINT)\r\nLJFOLDF(kfold_ldexp)\r\n{\r\n#if LJ_TARGET_X86ORX64\r\n  UNUSED(J);\r\n  return NEXTFOLD;\r\n#else\r\n  return lj_ir_knum(J, ldexp(knumleft, fright->i));\r\n#endif\r\n}\r\n\r\nLJFOLD(FPMATH KNUM any)\r\nLJFOLDF(kfold_fpmath)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number y = lj_vm_foldfpm(a, fins->op2);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\nLJFOLD(POW KNUM KINT)\r\nLJFOLDF(kfold_numpow)\r\n{\r\n  lua_Number a = knumleft;\r\n  lua_Number b = (lua_Number)fright->i;\r\n  lua_Number y = lj_vm_foldarith(a, b, IR_POW - IR_ADD);\r\n  return lj_ir_knum(J, y);\r\n}\r\n\r\n/* Must not use kfold_kref for numbers (could be NaN). */\r\nLJFOLD(EQ KNUM KNUM)\r\nLJFOLD(NE KNUM KNUM)\r\nLJFOLD(LT KNUM KNUM)\r\nLJFOLD(GE KNUM KNUM)\r\nLJFOLD(LE KNUM KNUM)\r\nLJFOLD(GT KNUM KNUM)\r\nLJFOLD(ULT KNUM KNUM)\r\nLJFOLD(UGE KNUM KNUM)\r\nLJFOLD(ULE KNUM KNUM)\r\nLJFOLD(UGT KNUM KNUM)\r\nLJFOLDF(kfold_numcomp)\r\n{\r\n  return CONDFOLD(lj_ir_numcmp(knumleft, knumright, (IROp)fins->o));\r\n}\r\n\r\n/* -- Constant folding for 32 bit integers -------------------------------- */\r\n\r\nstatic int32_t kfold_intop(int32_t k1, int32_t k2, IROp op)\r\n{\r\n  switch (op) {\r\n  case IR_ADD: k1 += k2; break;\r\n  case IR_SUB: k1 -= k2; break;\r\n  case IR_MUL: k1 *= k2; break;\r\n  case IR_MOD: k1 = lj_vm_modi(k1, k2); break;\r\n  case IR_NEG: k1 = -k1; break;\r\n  case IR_BAND: k1 &= k2; break;\r\n  case IR_BOR: k1 |= k2; break;\r\n  case IR_BXOR: k1 ^= k2; break;\r\n  case IR_BSHL: k1 <<= (k2 & 31); break;\r\n  case IR_BSHR: k1 = (int32_t)((uint32_t)k1 >> (k2 & 31)); break;\r\n  case IR_BSAR: k1 >>= (k2 & 31); break;\r\n  case IR_BROL: k1 = (int32_t)lj_rol((uint32_t)k1, (k2 & 31)); break;\r\n  case IR_BROR: k1 = (int32_t)lj_ror((uint32_t)k1, (k2 & 31)); break;\r\n  case IR_MIN: k1 = k1 < k2 ? k1 : k2; break;\r\n  case IR_MAX: k1 = k1 > k2 ? k1 : k2; break;\r\n  default: lua_assert(0); break;\r\n  }\r\n  return k1;\r\n}\r\n\r\nLJFOLD(ADD KINT KINT)\r\nLJFOLD(SUB KINT KINT)\r\nLJFOLD(MUL KINT KINT)\r\nLJFOLD(MOD KINT KINT)\r\nLJFOLD(NEG KINT KINT)\r\nLJFOLD(BAND KINT KINT)\r\nLJFOLD(BOR KINT KINT)\r\nLJFOLD(BXOR KINT KINT)\r\nLJFOLD(BSHL KINT KINT)\r\nLJFOLD(BSHR KINT KINT)\r\nLJFOLD(BSAR KINT KINT)\r\nLJFOLD(BROL KINT KINT)\r\nLJFOLD(BROR KINT KINT)\r\nLJFOLD(MIN KINT KINT)\r\nLJFOLD(MAX KINT KINT)\r\nLJFOLDF(kfold_intarith)\r\n{\r\n  return INTFOLD(kfold_intop(fleft->i, fright->i, (IROp)fins->o));\r\n}\r\n\r\nLJFOLD(ADDOV KINT KINT)\r\nLJFOLD(SUBOV KINT KINT)\r\nLJFOLD(MULOV KINT KINT)\r\nLJFOLDF(kfold_intovarith)\r\n{\r\n  lua_Number n = lj_vm_foldarith((lua_Number)fleft->i, (lua_Number)fright->i,\r\n\t\t\t\t fins->o - IR_ADDOV);\r\n  int32_t k = lj_num2int(n);\r\n  if (n != (lua_Number)k)\r\n    return FAILFOLD;\r\n  return INTFOLD(k);\r\n}\r\n\r\nLJFOLD(BNOT KINT)\r\nLJFOLDF(kfold_bnot)\r\n{\r\n  return INTFOLD(~fleft->i);\r\n}\r\n\r\nLJFOLD(BSWAP KINT)\r\nLJFOLDF(kfold_bswap)\r\n{\r\n  return INTFOLD((int32_t)lj_bswap((uint32_t)fleft->i));\r\n}\r\n\r\nLJFOLD(LT KINT KINT)\r\nLJFOLD(GE KINT KINT)\r\nLJFOLD(LE KINT KINT)\r\nLJFOLD(GT KINT KINT)\r\nLJFOLD(ULT KINT KINT)\r\nLJFOLD(UGE KINT KINT)\r\nLJFOLD(ULE KINT KINT)\r\nLJFOLD(UGT KINT KINT)\r\nLJFOLD(ABC KINT KINT)\r\nLJFOLDF(kfold_intcomp)\r\n{\r\n  int32_t a = fleft->i, b = fright->i;\r\n  switch ((IROp)fins->o) {\r\n  case IR_LT: return CONDFOLD(a < b);\r\n  case IR_GE: return CONDFOLD(a >= b);\r\n  case IR_LE: return CONDFOLD(a <= b);\r\n  case IR_GT: return CONDFOLD(a > b);\r\n  case IR_ULT: return CONDFOLD((uint32_t)a < (uint32_t)b);\r\n  case IR_UGE: return CONDFOLD((uint32_t)a >= (uint32_t)b);\r\n  case IR_ULE: return CONDFOLD((uint32_t)a <= (uint32_t)b);\r\n  case IR_ABC:\r\n  case IR_UGT: return CONDFOLD((uint32_t)a > (uint32_t)b);\r\n  default: lua_assert(0); return FAILFOLD;\r\n  }\r\n}\r\n\r\nLJFOLD(UGE any KINT)\r\nLJFOLDF(kfold_intcomp0)\r\n{\r\n  if (fright->i == 0)\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding for 64 bit integers -------------------------------- */\r\n\r\nstatic uint64_t kfold_int64arith(uint64_t k1, uint64_t k2, IROp op)\r\n{\r\n  switch (op) {\r\n#if LJ_HASFFI\r\n  case IR_ADD: k1 += k2; break;\r\n  case IR_SUB: k1 -= k2; break;\r\n  case IR_MUL: k1 *= k2; break;\r\n  case IR_BAND: k1 &= k2; break;\r\n  case IR_BOR: k1 |= k2; break;\r\n  case IR_BXOR: k1 ^= k2; break;\r\n#endif\r\n  default: UNUSED(k2); lua_assert(0); break;\r\n  }\r\n  return k1;\r\n}\r\n\r\nLJFOLD(ADD KINT64 KINT64)\r\nLJFOLD(SUB KINT64 KINT64)\r\nLJFOLD(MUL KINT64 KINT64)\r\nLJFOLD(BAND KINT64 KINT64)\r\nLJFOLD(BOR KINT64 KINT64)\r\nLJFOLD(BXOR KINT64 KINT64)\r\nLJFOLDF(kfold_int64arith)\r\n{\r\n  return INT64FOLD(kfold_int64arith(ir_k64(fleft)->u64,\r\n\t\t\t\t    ir_k64(fright)->u64, (IROp)fins->o));\r\n}\r\n\r\nLJFOLD(DIV KINT64 KINT64)\r\nLJFOLD(MOD KINT64 KINT64)\r\nLJFOLD(POW KINT64 KINT64)\r\nLJFOLDF(kfold_int64arith2)\r\n{\r\n#if LJ_HASFFI\r\n  uint64_t k1 = ir_k64(fleft)->u64, k2 = ir_k64(fright)->u64;\r\n  if (irt_isi64(fins->t)) {\r\n    k1 = fins->o == IR_DIV ? lj_carith_divi64((int64_t)k1, (int64_t)k2) :\r\n\t fins->o == IR_MOD ? lj_carith_modi64((int64_t)k1, (int64_t)k2) :\r\n\t\t\t     lj_carith_powi64((int64_t)k1, (int64_t)k2);\r\n  } else {\r\n    k1 = fins->o == IR_DIV ? lj_carith_divu64(k1, k2) :\r\n\t fins->o == IR_MOD ? lj_carith_modu64(k1, k2) :\r\n\t\t\t     lj_carith_powu64(k1, k2);\r\n  }\r\n  return INT64FOLD(k1);\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BSHL KINT64 KINT)\r\nLJFOLD(BSHR KINT64 KINT)\r\nLJFOLD(BSAR KINT64 KINT)\r\nLJFOLD(BROL KINT64 KINT)\r\nLJFOLD(BROR KINT64 KINT)\r\nLJFOLDF(kfold_int64shift)\r\n{\r\n#if LJ_HASFFI\r\n  uint64_t k = ir_k64(fleft)->u64;\r\n  int32_t sh = (fright->i & 63);\r\n  return INT64FOLD(lj_carith_shift64(k, sh, fins->o - IR_BSHL));\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BNOT KINT64)\r\nLJFOLDF(kfold_bnot64)\r\n{\r\n#if LJ_HASFFI\r\n  return INT64FOLD(~ir_k64(fleft)->u64);\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(BSWAP KINT64)\r\nLJFOLDF(kfold_bswap64)\r\n{\r\n#if LJ_HASFFI\r\n  return INT64FOLD(lj_bswap64(ir_k64(fleft)->u64));\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(LT KINT64 KINT64)\r\nLJFOLD(GE KINT64 KINT64)\r\nLJFOLD(LE KINT64 KINT64)\r\nLJFOLD(GT KINT64 KINT64)\r\nLJFOLD(ULT KINT64 KINT64)\r\nLJFOLD(UGE KINT64 KINT64)\r\nLJFOLD(ULE KINT64 KINT64)\r\nLJFOLD(UGT KINT64 KINT64)\r\nLJFOLDF(kfold_int64comp)\r\n{\r\n#if LJ_HASFFI\r\n  uint64_t a = ir_k64(fleft)->u64, b = ir_k64(fright)->u64;\r\n  switch ((IROp)fins->o) {\r\n  case IR_LT: return CONDFOLD(a < b);\r\n  case IR_GE: return CONDFOLD(a >= b);\r\n  case IR_LE: return CONDFOLD(a <= b);\r\n  case IR_GT: return CONDFOLD(a > b);\r\n  case IR_ULT: return CONDFOLD((uint64_t)a < (uint64_t)b);\r\n  case IR_UGE: return CONDFOLD((uint64_t)a >= (uint64_t)b);\r\n  case IR_ULE: return CONDFOLD((uint64_t)a <= (uint64_t)b);\r\n  case IR_UGT: return CONDFOLD((uint64_t)a > (uint64_t)b);\r\n  default: lua_assert(0); return FAILFOLD;\r\n  }\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(UGE any KINT64)\r\nLJFOLDF(kfold_int64comp0)\r\n{\r\n#if LJ_HASFFI\r\n  if (ir_k64(fright)->u64 == 0)\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\n/* -- Constant folding for strings ---------------------------------------- */\r\n\r\nLJFOLD(SNEW KKPTR KINT)\r\nLJFOLDF(kfold_snew_kptr)\r\n{\r\n  GCstr *s = lj_str_new(J->L, (const char *)ir_kptr(fleft), (size_t)fright->i);\r\n  return lj_ir_kstr(J, s);\r\n}\r\n\r\nLJFOLD(SNEW any KINT)\r\nLJFOLDF(kfold_snew_empty)\r\n{\r\n  if (fright->i == 0)\r\n    return lj_ir_kstr(J, &J2G(J)->strempty);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(STRREF KGC KINT)\r\nLJFOLDF(kfold_strref)\r\n{\r\n  GCstr *str = ir_kstr(fleft);\r\n  lua_assert((MSize)fright->i <= str->len);\r\n  return lj_ir_kkptr(J, (char *)strdata(str) + fright->i);\r\n}\r\n\r\nLJFOLD(STRREF SNEW any)\r\nLJFOLDF(kfold_strref_snew)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if (irref_isk(fins->op2) && fright->i == 0) {\r\n    return fleft->op1;  /* strref(snew(ptr, len), 0) ==> ptr */\r\n  } else {\r\n    /* Reassociate: strref(snew(strref(str, a), len), b) ==> strref(str, a+b) */\r\n    IRIns *ir = IR(fleft->op1);\r\n    if (ir->o == IR_STRREF) {\r\n      IRRef1 str = ir->op1;  /* IRIns * is not valid across emitir. */\r\n      PHIBARRIER(ir);\r\n      fins->op2 = emitir(IRTI(IR_ADD), ir->op2, fins->op2); /* Clobbers fins! */\r\n      fins->op1 = str;\r\n      fins->ot = IRT(IR_STRREF, IRT_P32);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CALLN CARG IRCALL_lj_str_cmp)\r\nLJFOLDF(kfold_strcmp)\r\n{\r\n  if (irref_isk(fleft->op1) && irref_isk(fleft->op2)) {\r\n    GCstr *a = ir_kstr(IR(fleft->op1));\r\n    GCstr *b = ir_kstr(IR(fleft->op2));\r\n    return INTFOLD(lj_str_cmp(a, b));\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding and forwarding for buffers ------------------------- */\r\n\r\n/*\r\n** Buffer ops perform stores, but their effect is limited to the buffer\r\n** itself. Also, buffer ops are chained: a use of an op implies a use of\r\n** all other ops up the chain. Conversely, if an op is unused, all ops\r\n** up the chain can go unsed. This largely eliminates the need to treat\r\n** them as stores.\r\n**\r\n** Alas, treating them as normal (IRM_N) ops doesn't work, because they\r\n** cannot be CSEd in isolation. CSE for IRM_N is implicitly done in LOOP\r\n** or if FOLD is disabled.\r\n**\r\n** The compromise is to declare them as loads, emit them like stores and\r\n** CSE whole chains manually when the BUFSTR is to be emitted. Any chain\r\n** fragments left over from CSE are eliminated by DCE.\r\n*/\r\n\r\n/* BUFHDR is emitted like a store, see below. */\r\n\r\nLJFOLD(BUFPUT BUFHDR BUFSTR)\r\nLJFOLDF(bufput_append)\r\n{\r\n  /* New buffer, no other buffer op inbetween and same buffer? */\r\n  if ((J->flags & JIT_F_OPT_FWD) &&\r\n      !(fleft->op2 & IRBUFHDR_APPEND) &&\r\n      fleft->prev == fright->op2 &&\r\n      fleft->op1 == IR(fright->op2)->op1) {\r\n    IRRef ref = fins->op1;\r\n    IR(ref)->op2 = (fleft->op2 | IRBUFHDR_APPEND);  /* Modify BUFHDR. */\r\n    IR(ref)->op1 = fright->op1;\r\n    return ref;\r\n  }\r\n  return EMITFOLD;  /* Always emit, CSE later. */\r\n}\r\n\r\nLJFOLD(BUFPUT any any)\r\nLJFOLDF(bufput_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && fright->o == IR_KGC) {\r\n    GCstr *s2 = ir_kstr(fright);\r\n    if (s2->len == 0) {  /* Empty string? */\r\n      return LEFTFOLD;\r\n    } else {\r\n      if (fleft->o == IR_BUFPUT && irref_isk(fleft->op2) &&\r\n\t  !irt_isphi(fleft->t)) {  /* Join two constant string puts in a row. */\r\n\tGCstr *s1 = ir_kstr(IR(fleft->op2));\r\n\tIRRef kref = lj_ir_kstr(J, lj_buf_cat2str(J->L, s1, s2));\r\n\t/* lj_ir_kstr() may realloc the IR and invalidates any IRIns *. */\r\n\tIR(fins->op1)->op2 = kref;  /* Modify previous BUFPUT. */\r\n\treturn fins->op1;\r\n      }\r\n    }\r\n  }\r\n  return EMITFOLD;  /* Always emit, CSE later. */\r\n}\r\n\r\nLJFOLD(BUFSTR any any)\r\nLJFOLDF(bufstr_kfold_cse)\r\n{\r\n  lua_assert(fleft->o == IR_BUFHDR || fleft->o == IR_BUFPUT ||\r\n\t     fleft->o == IR_CALLL);\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD)) {\r\n    if (fleft->o == IR_BUFHDR) {  /* No put operations? */\r\n      if (!(fleft->op2 & IRBUFHDR_APPEND))  /* Empty buffer? */\r\n\treturn lj_ir_kstr(J, &J2G(J)->strempty);\r\n      fins->op1 = fleft->op1;\r\n      fins->op2 = fleft->prev;  /* Relies on checks in bufput_append. */\r\n      return CSEFOLD;\r\n    } else if (fleft->o == IR_BUFPUT) {\r\n      IRIns *irb = IR(fleft->op1);\r\n      if (irb->o == IR_BUFHDR && !(irb->op2 & IRBUFHDR_APPEND))\r\n\treturn fleft->op2;  /* Shortcut for a single put operation. */\r\n    }\r\n  }\r\n  /* Try to CSE the whole chain. */\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    IRRef ref = J->chain[IR_BUFSTR];\r\n    while (ref) {\r\n      IRIns *irs = IR(ref), *ira = fleft, *irb = IR(irs->op1);\r\n      while (ira->o == irb->o && ira->op2 == irb->op2) {\r\n\tlua_assert(ira->o == IR_BUFHDR || ira->o == IR_BUFPUT ||\r\n\t\t   ira->o == IR_CALLL || ira->o == IR_CARG);\r\n\tif (ira->o == IR_BUFHDR && !(ira->op2 & IRBUFHDR_APPEND))\r\n\t  return ref;  /* CSE succeeded. */\r\n\tif (ira->o == IR_CALLL && ira->op2 == IRCALL_lj_buf_puttab)\r\n\t  break;\r\n\tira = IR(ira->op1);\r\n\tirb = IR(irb->op1);\r\n      }\r\n      ref = irs->prev;\r\n    }\r\n  }\r\n  return EMITFOLD;  /* No CSE possible. */\r\n}\r\n\r\nLJFOLD(CALLL CARG IRCALL_lj_buf_putstr_reverse)\r\nLJFOLD(CALLL CARG IRCALL_lj_buf_putstr_upper)\r\nLJFOLD(CALLL CARG IRCALL_lj_buf_putstr_lower)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putquoted)\r\nLJFOLDF(bufput_kfold_op)\r\n{\r\n  if (irref_isk(fleft->op2)) {\r\n    const CCallInfo *ci = &lj_ir_callinfo[fins->op2];\r\n    SBuf *sb = lj_buf_tmp_(J->L);\r\n    sb = ((SBuf * (LJ_FASTCALL *)(SBuf *, GCstr *))ci->func)(sb,\r\n\t\t\t\t\t\t       ir_kstr(IR(fleft->op2)));\r\n    fins->o = IR_BUFPUT;\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = lj_ir_kstr(J, lj_buf_tostr(sb));\r\n    return RETRYFOLD;\r\n  }\r\n  return EMITFOLD;  /* Always emit, CSE later. */\r\n}\r\n\r\nLJFOLD(CALLL CARG IRCALL_lj_buf_putstr_rep)\r\nLJFOLDF(bufput_kfold_rep)\r\n{\r\n  if (irref_isk(fleft->op2)) {\r\n    IRIns *irc = IR(fleft->op1);\r\n    if (irref_isk(irc->op2)) {\r\n      SBuf *sb = lj_buf_tmp_(J->L);\r\n      sb = lj_buf_putstr_rep(sb, ir_kstr(IR(irc->op2)), IR(fleft->op2)->i);\r\n      fins->o = IR_BUFPUT;\r\n      fins->op1 = irc->op1;\r\n      fins->op2 = lj_ir_kstr(J, lj_buf_tostr(sb));\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return EMITFOLD;  /* Always emit, CSE later. */\r\n}\r\n\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfxint)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfnum_int)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfnum_uint)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfnum)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfstr)\r\nLJFOLD(CALLL CARG IRCALL_lj_strfmt_putfchar)\r\nLJFOLDF(bufput_kfold_fmt)\r\n{\r\n  IRIns *irc = IR(fleft->op1);\r\n  lua_assert(irref_isk(irc->op2));  /* SFormat must be const. */\r\n  if (irref_isk(fleft->op2)) {\r\n    SFormat sf = (SFormat)IR(irc->op2)->i;\r\n    IRIns *ira = IR(fleft->op2);\r\n    SBuf *sb = lj_buf_tmp_(J->L);\r\n    switch (fins->op2) {\r\n    case IRCALL_lj_strfmt_putfxint:\r\n      sb = lj_strfmt_putfxint(sb, sf, ir_k64(ira)->u64);\r\n      break;\r\n    case IRCALL_lj_strfmt_putfstr:\r\n      sb = lj_strfmt_putfstr(sb, sf, ir_kstr(ira));\r\n      break;\r\n    case IRCALL_lj_strfmt_putfchar:\r\n      sb = lj_strfmt_putfchar(sb, sf, ira->i);\r\n      break;\r\n    case IRCALL_lj_strfmt_putfnum_int:\r\n    case IRCALL_lj_strfmt_putfnum_uint:\r\n    case IRCALL_lj_strfmt_putfnum:\r\n    default: {\r\n      const CCallInfo *ci = &lj_ir_callinfo[fins->op2];\r\n      sb = ((SBuf * (*)(SBuf *, SFormat, lua_Number))ci->func)(sb, sf,\r\n\t\t\t\t\t\t\t ir_knum(ira)->n);\r\n      break;\r\n      }\r\n    }\r\n    fins->o = IR_BUFPUT;\r\n    fins->op1 = irc->op1;\r\n    fins->op2 = lj_ir_kstr(J, lj_buf_tostr(sb));\r\n    return RETRYFOLD;\r\n  }\r\n  return EMITFOLD;  /* Always emit, CSE later. */\r\n}\r\n\r\n/* -- Constant folding of pointer arithmetic ------------------------------ */\r\n\r\nLJFOLD(ADD KGC KINT)\r\nLJFOLD(ADD KGC KINT64)\r\nLJFOLDF(kfold_add_kgc)\r\n{\r\n  GCobj *o = ir_kgc(fleft);\r\n#if LJ_64\r\n  ptrdiff_t ofs = (ptrdiff_t)ir_kint64(fright)->u64;\r\n#else\r\n  ptrdiff_t ofs = fright->i;\r\n#endif\r\n#if LJ_HASFFI\r\n  if (irt_iscdata(fleft->t)) {\r\n    CType *ct = ctype_raw(ctype_ctsG(J2G(J)), gco2cd(o)->ctypeid);\r\n    if (ctype_isnum(ct->info) || ctype_isenum(ct->info) ||\r\n\tctype_isptr(ct->info) || ctype_isfunc(ct->info) ||\r\n\tctype_iscomplex(ct->info) || ctype_isvector(ct->info))\r\n      return lj_ir_kkptr(J, (char *)o + ofs);\r\n  }\r\n#endif\r\n  return lj_ir_kptr(J, (char *)o + ofs);\r\n}\r\n\r\nLJFOLD(ADD KPTR KINT)\r\nLJFOLD(ADD KPTR KINT64)\r\nLJFOLD(ADD KKPTR KINT)\r\nLJFOLD(ADD KKPTR KINT64)\r\nLJFOLDF(kfold_add_kptr)\r\n{\r\n  void *p = ir_kptr(fleft);\r\n#if LJ_64\r\n  ptrdiff_t ofs = (ptrdiff_t)ir_kint64(fright)->u64;\r\n#else\r\n  ptrdiff_t ofs = fright->i;\r\n#endif\r\n  return lj_ir_kptr_(J, fleft->o, (char *)p + ofs);\r\n}\r\n\r\nLJFOLD(ADD any KGC)\r\nLJFOLD(ADD any KPTR)\r\nLJFOLD(ADD any KKPTR)\r\nLJFOLDF(kfold_add_kright)\r\n{\r\n  if (fleft->o == IR_KINT || fleft->o == IR_KINT64) {\r\n    IRRef1 tmp = fins->op1; fins->op1 = fins->op2; fins->op2 = tmp;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Constant folding of conversions ------------------------------------- */\r\n\r\nLJFOLD(TOBIT KNUM KNUM)\r\nLJFOLDF(kfold_tobit)\r\n{\r\n  return INTFOLD(lj_num2bit(knumleft));\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_NUM_INT)\r\nLJFOLDF(kfold_conv_kint_num)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_NUM_U32)\r\nLJFOLDF(kfold_conv_kintu32_num)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)(uint32_t)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_INT_I8)\r\nLJFOLD(CONV KINT IRCONV_INT_U8)\r\nLJFOLD(CONV KINT IRCONV_INT_I16)\r\nLJFOLD(CONV KINT IRCONV_INT_U16)\r\nLJFOLDF(kfold_conv_kint_ext)\r\n{\r\n  int32_t k = fleft->i;\r\n  if ((fins->op2 & IRCONV_SRCMASK) == IRT_I8) k = (int8_t)k;\r\n  else if ((fins->op2 & IRCONV_SRCMASK) == IRT_U8) k = (uint8_t)k;\r\n  else if ((fins->op2 & IRCONV_SRCMASK) == IRT_I16) k = (int16_t)k;\r\n  else k = (uint16_t)k;\r\n  return INTFOLD(k);\r\n}\r\n\r\nLJFOLD(CONV KINT IRCONV_I64_INT)\r\nLJFOLD(CONV KINT IRCONV_U64_INT)\r\nLJFOLD(CONV KINT IRCONV_I64_U32)\r\nLJFOLD(CONV KINT IRCONV_U64_U32)\r\nLJFOLDF(kfold_conv_kint_i64)\r\n{\r\n  if ((fins->op2 & IRCONV_SEXT))\r\n    return INT64FOLD((uint64_t)(int64_t)fleft->i);\r\n  else\r\n    return INT64FOLD((uint64_t)(int64_t)(uint32_t)fleft->i);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_NUM_I64)\r\nLJFOLDF(kfold_conv_kint64_num_i64)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)(int64_t)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_NUM_U64)\r\nLJFOLDF(kfold_conv_kint64_num_u64)\r\n{\r\n  return lj_ir_knum(J, (lua_Number)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KINT64 IRCONV_INT_I64)\r\nLJFOLD(CONV KINT64 IRCONV_U32_I64)\r\nLJFOLDF(kfold_conv_kint64_int_i64)\r\n{\r\n  return INTFOLD((int32_t)ir_kint64(fleft)->u64);\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_INT_NUM)\r\nLJFOLDF(kfold_conv_knum_int_num)\r\n{\r\n  lua_Number n = knumleft;\r\n  int32_t k = lj_num2int(n);\r\n  if (irt_isguard(fins->t) && n != (lua_Number)k) {\r\n    /* We're about to create a guard which always fails, like CONV +1.5.\r\n    ** Some pathological loops cause this during LICM, e.g.:\r\n    **   local x,k,t = 0,1.5,{1,[1.5]=2}\r\n    **   for i=1,200 do x = x+ t[k]; k = k == 1 and 1.5 or 1 end\r\n    **   assert(x == 300)\r\n    */\r\n    return FAILFOLD;\r\n  }\r\n  return INTFOLD(k);\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_U32_NUM)\r\nLJFOLDF(kfold_conv_knum_u32_num)\r\n{\r\n#ifdef _MSC_VER\r\n  {  /* Workaround for MSVC bug. */\r\n    volatile uint32_t u = (uint32_t)knumleft;\r\n    return INTFOLD((int32_t)u);\r\n  }\r\n#else\r\n  return INTFOLD((int32_t)(uint32_t)knumleft);\r\n#endif\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_I64_NUM)\r\nLJFOLDF(kfold_conv_knum_i64_num)\r\n{\r\n  return INT64FOLD((uint64_t)(int64_t)knumleft);\r\n}\r\n\r\nLJFOLD(CONV KNUM IRCONV_U64_NUM)\r\nLJFOLDF(kfold_conv_knum_u64_num)\r\n{\r\n  return INT64FOLD(lj_num2u64(knumleft));\r\n}\r\n\r\nLJFOLD(TOSTR KNUM any)\r\nLJFOLDF(kfold_tostr_knum)\r\n{\r\n  return lj_ir_kstr(J, lj_strfmt_num(J->L, ir_knum(fleft)));\r\n}\r\n\r\nLJFOLD(TOSTR KINT any)\r\nLJFOLDF(kfold_tostr_kint)\r\n{\r\n  return lj_ir_kstr(J, fins->op2 == IRTOSTR_INT ?\r\n\t\t       lj_strfmt_int(J->L, fleft->i) :\r\n\t\t       lj_strfmt_char(J->L, fleft->i));\r\n}\r\n\r\nLJFOLD(STRTO KGC)\r\nLJFOLDF(kfold_strto)\r\n{\r\n  TValue n;\r\n  if (lj_strscan_num(ir_kstr(fleft), &n))\r\n    return lj_ir_knum(J, numV(&n));\r\n  return FAILFOLD;\r\n}\r\n\r\n/* -- Constant folding of equality checks --------------------------------- */\r\n\r\n/* Don't constant-fold away FLOAD checks against KNULL. */\r\nLJFOLD(EQ FLOAD KNULL)\r\nLJFOLD(NE FLOAD KNULL)\r\nLJFOLDX(lj_opt_cse)\r\n\r\n/* But fold all other KNULL compares, since only KNULL is equal to KNULL. */\r\nLJFOLD(EQ any KNULL)\r\nLJFOLD(NE any KNULL)\r\nLJFOLD(EQ KNULL any)\r\nLJFOLD(NE KNULL any)\r\nLJFOLD(EQ KINT KINT)  /* Constants are unique, so same refs <==> same value. */\r\nLJFOLD(NE KINT KINT)\r\nLJFOLD(EQ KINT64 KINT64)\r\nLJFOLD(NE KINT64 KINT64)\r\nLJFOLD(EQ KGC KGC)\r\nLJFOLD(NE KGC KGC)\r\nLJFOLDF(kfold_kref)\r\n{\r\n  return CONDFOLD((fins->op1 == fins->op2) ^ (fins->o == IR_NE));\r\n}\r\n\r\n/* -- Algebraic shortcuts ------------------------------------------------- */\r\n\r\nLJFOLD(FPMATH FPMATH IRFPM_FLOOR)\r\nLJFOLD(FPMATH FPMATH IRFPM_CEIL)\r\nLJFOLD(FPMATH FPMATH IRFPM_TRUNC)\r\nLJFOLDF(shortcut_round)\r\n{\r\n  IRFPMathOp op = (IRFPMathOp)fleft->op2;\r\n  if (op == IRFPM_FLOOR || op == IRFPM_CEIL || op == IRFPM_TRUNC)\r\n    return LEFTFOLD;  /* round(round_left(x)) = round_left(x) */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ABS ABS KNUM)\r\nLJFOLDF(shortcut_left)\r\n{\r\n  return LEFTFOLD;  /* f(g(x)) ==> g(x) */\r\n}\r\n\r\nLJFOLD(ABS NEG KNUM)\r\nLJFOLDF(shortcut_dropleft)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op1 = fleft->op1;  /* abs(neg(x)) ==> abs(x) */\r\n  return RETRYFOLD;\r\n}\r\n\r\n/* Note: no safe shortcuts with STRTO and TOSTR (\"1e2\" ==> +100 ==> \"100\"). */\r\nLJFOLD(NEG NEG any)\r\nLJFOLD(BNOT BNOT)\r\nLJFOLD(BSWAP BSWAP)\r\nLJFOLDF(shortcut_leftleft)\r\n{\r\n  PHIBARRIER(fleft);  /* See above. Fold would be ok, but not beneficial. */\r\n  return fleft->op1;  /* f(g(x)) ==> x */\r\n}\r\n\r\n/* -- FP algebraic simplifications ---------------------------------------- */\r\n\r\n/* FP arithmetic is tricky -- there's not much to simplify.\r\n** Please note the following common pitfalls before sending \"improvements\":\r\n**   x+0 ==> x  is INVALID for x=-0\r\n**   0-x ==> -x is INVALID for x=+0\r\n**   x*0 ==> 0  is INVALID for x=-0, x=+-Inf or x=NaN\r\n*/\r\n\r\nLJFOLD(ADD NEG any)\r\nLJFOLDF(simplify_numadd_negx)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->o = IR_SUB;  /* (-a) + b ==> b - a */\r\n  fins->op1 = fins->op2;\r\n  fins->op2 = fleft->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(ADD any NEG)\r\nLJFOLDF(simplify_numadd_xneg)\r\n{\r\n  PHIBARRIER(fright);\r\n  fins->o = IR_SUB;  /* a + (-b) ==> a - b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KNUM)\r\nLJFOLDF(simplify_numsub_k)\r\n{\r\n  lua_Number n = knumright;\r\n  if (n == 0.0)  /* x - (+-0) ==> x */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB NEG KNUM)\r\nLJFOLDF(simplify_numsub_negk)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op2 = fleft->op1;  /* (-x) - k ==> (-k) - x */\r\n  fins->op1 = (IRRef1)lj_ir_knum(J, -knumright);\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB any NEG)\r\nLJFOLDF(simplify_numsub_xneg)\r\n{\r\n  PHIBARRIER(fright);\r\n  fins->o = IR_ADD;  /* a - (-b) ==> a + b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KNUM)\r\nLJFOLD(DIV any KNUM)\r\nLJFOLDF(simplify_nummuldiv_k)\r\n{\r\n  lua_Number n = knumright;\r\n  if (n == 1.0) {  /* x o 1 ==> x */\r\n    return LEFTFOLD;\r\n  } else if (n == -1.0) {  /* x o -1 ==> -x */\r\n    fins->o = IR_NEG;\r\n    fins->op2 = (IRRef1)lj_ir_knum_neg(J);\r\n    return RETRYFOLD;\r\n  } else if (fins->o == IR_MUL && n == 2.0) {  /* x * 2 ==> x + x */\r\n    fins->o = IR_ADD;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  } else if (fins->o == IR_DIV) {  /* x / 2^k ==> x * 2^-k */\r\n    uint64_t u = ir_knum(fright)->u64;\r\n    uint32_t ex = ((uint32_t)(u >> 52) & 0x7ff);\r\n    if ((u & U64x(000fffff,ffffffff)) == 0 && ex - 1 < 0x7fd) {\r\n      u = (u & ((uint64_t)1 << 63)) | ((uint64_t)(0x7fe - ex) << 52);\r\n      fins->o = IR_MUL;  /* Multiply by exact reciprocal. */\r\n      fins->op2 = lj_ir_knum_u64(J, u);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL NEG KNUM)\r\nLJFOLD(DIV NEG KNUM)\r\nLJFOLDF(simplify_nummuldiv_negk)\r\n{\r\n  PHIBARRIER(fleft);\r\n  fins->op1 = fleft->op1;  /* (-a) o k ==> a o (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_knum(J, -knumright);\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(MUL NEG NEG)\r\nLJFOLD(DIV NEG NEG)\r\nLJFOLDF(simplify_nummuldiv_negneg)\r\n{\r\n  PHIBARRIER(fleft);\r\n  PHIBARRIER(fright);\r\n  fins->op1 = fleft->op1;  /* (-a) o (-b) ==> a o b */\r\n  fins->op2 = fright->op1;\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(POW any KINT)\r\nLJFOLDF(simplify_numpow_xk)\r\n{\r\n  int32_t k = fright->i;\r\n  TRef ref = fins->op1;\r\n  if (k == 0)  /* x ^ 0 ==> 1 */\r\n    return lj_ir_knum_one(J);  /* Result must be a number, not an int. */\r\n  if (k == 1)  /* x ^ 1 ==> x */\r\n    return LEFTFOLD;\r\n  if ((uint32_t)(k+65536) > 2*65536u)  /* Limit code explosion. */\r\n    return NEXTFOLD;\r\n  if (k < 0) {  /* x ^ (-k) ==> (1/x) ^ k. */\r\n    ref = emitir(IRTN(IR_DIV), lj_ir_knum_one(J), ref);\r\n    k = -k;\r\n  }\r\n  /* Unroll x^k for 1 <= k <= 65536. */\r\n  for (; (k & 1) == 0; k >>= 1)  /* Handle leading zeros. */\r\n    ref = emitir(IRTN(IR_MUL), ref, ref);\r\n  if ((k >>= 1) != 0) {  /* Handle trailing bits. */\r\n    TRef tmp = emitir(IRTN(IR_MUL), ref, ref);\r\n    for (; k != 1; k >>= 1) {\r\n      if (k & 1)\r\n\tref = emitir(IRTN(IR_MUL), ref, tmp);\r\n      tmp = emitir(IRTN(IR_MUL), tmp, tmp);\r\n    }\r\n    ref = emitir(IRTN(IR_MUL), ref, tmp);\r\n  }\r\n  return ref;\r\n}\r\n\r\nLJFOLD(POW KNUM any)\r\nLJFOLDF(simplify_numpow_kx)\r\n{\r\n  lua_Number n = knumleft;\r\n  if (n == 2.0) {  /* 2.0 ^ i ==> ldexp(1.0, tonum(i)) */\r\n    fins->o = IR_CONV;\r\n#if LJ_TARGET_X86ORX64\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = IRCONV_NUM_INT;\r\n    fins->op2 = (IRRef1)lj_opt_fold(J);\r\n#endif\r\n    fins->op1 = (IRRef1)lj_ir_knum_one(J);\r\n    fins->o = IR_LDEXP;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Simplify conversions ------------------------------------------------ */\r\n\r\nLJFOLD(CONV CONV IRCONV_NUM_INT)  /* _NUM */\r\nLJFOLDF(shortcut_conv_num_int)\r\n{\r\n  PHIBARRIER(fleft);\r\n  /* Only safe with a guarded conversion to int. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_NUM && irt_isguard(fleft->t))\r\n    return fleft->op1;  /* f(g(x)) ==> x */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_INT_NUM)  /* _INT */\r\nLJFOLD(CONV CONV IRCONV_U32_NUM)  /* _U32*/\r\nLJFOLDF(simplify_conv_int_num)\r\n{\r\n  /* Fold even across PHI to avoid expensive num->int conversions in loop. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) ==\r\n      ((fins->op2 & IRCONV_DSTMASK) >> IRCONV_DSH))\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_I64_NUM)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U64_NUM)  /* _INT or _U32 */\r\nLJFOLDF(simplify_conv_i64_num)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    /* Reduce to a sign-extension. */\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = ((IRT_I64<<5)|IRT_INT|IRCONV_SEXT);\r\n    return RETRYFOLD;\r\n  } else if ((fleft->op2 & IRCONV_SRCMASK) == IRT_U32) {\r\n#if LJ_TARGET_X64\r\n    return fleft->op1;\r\n#else\r\n    /* Reduce to a zero-extension. */\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRT_I64<<5)|IRT_U32;\r\n    return RETRYFOLD;\r\n#endif\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_INT_I64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_INT_U64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U32_I64)  /* _INT or _U32 */\r\nLJFOLD(CONV CONV IRCONV_U32_U64)  /* _INT or _U32 */\r\nLJFOLDF(simplify_conv_int_i64)\r\n{\r\n  int src;\r\n  PHIBARRIER(fleft);\r\n  src = (fleft->op2 & IRCONV_SRCMASK);\r\n  if (src == IRT_INT || src == IRT_U32) {\r\n    if (src == ((fins->op2 & IRCONV_DSTMASK) >> IRCONV_DSH)) {\r\n      return fleft->op1;\r\n    } else {\r\n      fins->op2 = ((fins->op2 & IRCONV_DSTMASK) | src);\r\n      fins->op1 = fleft->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(CONV CONV IRCONV_FLOAT_NUM)  /* _FLOAT */\r\nLJFOLDF(simplify_conv_flt_num)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_FLOAT)\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Shortcut TOBIT + IRT_NUM <- IRT_INT/IRT_U32 conversion. */\r\nLJFOLD(TOBIT CONV KNUM)\r\nLJFOLDF(simplify_tobit_conv)\r\n{\r\n  /* Fold even across PHI to avoid expensive num->int conversions in loop. */\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    lua_assert(irt_isnum(fleft->t));\r\n    return fleft->op1;\r\n  } else if ((fleft->op2 & IRCONV_SRCMASK) == IRT_U32) {\r\n    lua_assert(irt_isnum(fleft->t));\r\n    fins->o = IR_CONV;\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRT_INT<<5)|IRT_U32;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Shortcut floor/ceil/round + IRT_NUM <- IRT_INT/IRT_U32 conversion. */\r\nLJFOLD(FPMATH CONV IRFPM_FLOOR)\r\nLJFOLD(FPMATH CONV IRFPM_CEIL)\r\nLJFOLD(FPMATH CONV IRFPM_TRUNC)\r\nLJFOLDF(simplify_floor_conv)\r\n{\r\n  if ((fleft->op2 & IRCONV_SRCMASK) == IRT_INT ||\r\n      (fleft->op2 & IRCONV_SRCMASK) == IRT_U32)\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Strength reduction of widening. */\r\nLJFOLD(CONV any IRCONV_I64_INT)\r\nLJFOLD(CONV any IRCONV_U64_INT)\r\nLJFOLDF(simplify_conv_sext)\r\n{\r\n  IRRef ref = fins->op1;\r\n  int64_t ofs = 0;\r\n  if (!(fins->op2 & IRCONV_SEXT))\r\n    return NEXTFOLD;\r\n  PHIBARRIER(fleft);\r\n  if (fleft->o == IR_XLOAD && (irt_isu8(fleft->t) || irt_isu16(fleft->t)))\r\n    goto ok_reduce;\r\n  if (fleft->o == IR_ADD && irref_isk(fleft->op2)) {\r\n    ofs = (int64_t)IR(fleft->op2)->i;\r\n    ref = fleft->op1;\r\n  }\r\n  /* Use scalar evolution analysis results to strength-reduce sign-extension. */\r\n  if (ref == J->scev.idx) {\r\n    IRRef lo = J->scev.dir ? J->scev.start : J->scev.stop;\r\n    lua_assert(irt_isint(J->scev.t));\r\n    if (lo && IR(lo)->i + ofs >= 0) {\r\n    ok_reduce:\r\n#if LJ_TARGET_X64\r\n      /* Eliminate widening. All 32 bit ops do an implicit zero-extension. */\r\n      return LEFTFOLD;\r\n#else\r\n      /* Reduce to a (cheaper) zero-extension. */\r\n      fins->op2 &= ~IRCONV_SEXT;\r\n      return RETRYFOLD;\r\n#endif\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Strength reduction of narrowing. */\r\nLJFOLD(CONV ADD IRCONV_INT_I64)\r\nLJFOLD(CONV SUB IRCONV_INT_I64)\r\nLJFOLD(CONV MUL IRCONV_INT_I64)\r\nLJFOLD(CONV ADD IRCONV_INT_U64)\r\nLJFOLD(CONV SUB IRCONV_INT_U64)\r\nLJFOLD(CONV MUL IRCONV_INT_U64)\r\nLJFOLD(CONV ADD IRCONV_U32_I64)\r\nLJFOLD(CONV SUB IRCONV_U32_I64)\r\nLJFOLD(CONV MUL IRCONV_U32_I64)\r\nLJFOLD(CONV ADD IRCONV_U32_U64)\r\nLJFOLD(CONV SUB IRCONV_U32_U64)\r\nLJFOLD(CONV MUL IRCONV_U32_U64)\r\nLJFOLDF(simplify_conv_narrow)\r\n{\r\n  IROp op = (IROp)fleft->o;\r\n  IRType t = irt_type(fins->t);\r\n  IRRef op1 = fleft->op1, op2 = fleft->op2, mode = fins->op2;\r\n  PHIBARRIER(fleft);\r\n  op1 = emitir(IRTI(IR_CONV), op1, mode);\r\n  op2 = emitir(IRTI(IR_CONV), op2, mode);\r\n  fins->ot = IRT(op, t);\r\n  fins->op1 = op1;\r\n  fins->op2 = op2;\r\n  return RETRYFOLD;\r\n}\r\n\r\n/* Special CSE rule for CONV. */\r\nLJFOLD(CONV any any)\r\nLJFOLDF(cse_conv)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    IRRef op1 = fins->op1, op2 = (fins->op2 & IRCONV_MODEMASK);\r\n    uint8_t guard = irt_isguard(fins->t);\r\n    IRRef ref = J->chain[IR_CONV];\r\n    while (ref > op1) {\r\n      IRIns *ir = IR(ref);\r\n      /* Commoning with stronger checks is ok. */\r\n      if (ir->op1 == op1 && (ir->op2 & IRCONV_MODEMASK) == op2 &&\r\n\t  irt_isguard(ir->t) >= guard)\r\n\treturn ref;\r\n      ref = ir->prev;\r\n    }\r\n  }\r\n  return EMITFOLD;  /* No fallthrough to regular CSE. */\r\n}\r\n\r\n/* FP conversion narrowing. */\r\nLJFOLD(TOBIT ADD KNUM)\r\nLJFOLD(TOBIT SUB KNUM)\r\nLJFOLD(CONV ADD IRCONV_INT_NUM)\r\nLJFOLD(CONV SUB IRCONV_INT_NUM)\r\nLJFOLD(CONV ADD IRCONV_I64_NUM)\r\nLJFOLD(CONV SUB IRCONV_I64_NUM)\r\nLJFOLDF(narrow_convert)\r\n{\r\n  PHIBARRIER(fleft);\r\n  /* Narrowing ignores PHIs and repeating it inside the loop is not useful. */\r\n  if (J->chain[IR_LOOP])\r\n    return NEXTFOLD;\r\n  lua_assert(fins->o != IR_CONV || (fins->op2&IRCONV_CONVMASK) != IRCONV_TOBIT);\r\n  return lj_opt_narrow_convert(J);\r\n}\r\n\r\n/* -- Integer algebraic simplifications ----------------------------------- */\r\n\r\nLJFOLD(ADD any KINT)\r\nLJFOLD(ADDOV any KINT)\r\nLJFOLD(SUBOV any KINT)\r\nLJFOLDF(simplify_intadd_k)\r\n{\r\n  if (fright->i == 0)  /* i o 0 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MULOV any KINT)\r\nLJFOLDF(simplify_intmul_k)\r\n{\r\n  if (fright->i == 0)  /* i * 0 ==> 0 */\r\n    return RIGHTFOLD;\r\n  if (fright->i == 1)  /* i * 1 ==> i */\r\n    return LEFTFOLD;\r\n  if (fright->i == 2) {  /* i * 2 ==> i + i */\r\n    fins->o = IR_ADDOV;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KINT)\r\nLJFOLDF(simplify_intsub_k)\r\n{\r\n  if (fright->i == 0)  /* i - 0 ==> i */\r\n    return LEFTFOLD;\r\n  fins->o = IR_ADD;  /* i - k ==> i + (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_kint(J, -fright->i);  /* Overflow for -2^31 ok. */\r\n  return RETRYFOLD;\r\n}\r\n\r\nLJFOLD(SUB KINT any)\r\nLJFOLD(SUB KINT64 any)\r\nLJFOLDF(simplify_intsub_kleft)\r\n{\r\n  if (fleft->o == IR_KINT ? (fleft->i == 0) : (ir_kint64(fleft)->u64 == 0)) {\r\n    fins->o = IR_NEG;  /* 0 - i ==> -i */\r\n    fins->op1 = fins->op2;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ADD any KINT64)\r\nLJFOLDF(simplify_intadd_k64)\r\n{\r\n  if (ir_kint64(fright)->u64 == 0)  /* i + 0 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any KINT64)\r\nLJFOLDF(simplify_intsub_k64)\r\n{\r\n  uint64_t k = ir_kint64(fright)->u64;\r\n  if (k == 0)  /* i - 0 ==> i */\r\n    return LEFTFOLD;\r\n  fins->o = IR_ADD;  /* i - k ==> i + (-k) */\r\n  fins->op2 = (IRRef1)lj_ir_kint64(J, (uint64_t)-(int64_t)k);\r\n  return RETRYFOLD;\r\n}\r\n\r\nstatic TRef simplify_intmul_k(jit_State *J, int32_t k)\r\n{\r\n  /* Note: many more simplifications are possible, e.g. 2^k1 +- 2^k2.\r\n  ** But this is mainly intended for simple address arithmetic.\r\n  ** Also it's easier for the backend to optimize the original multiplies.\r\n  */\r\n  if (k == 0) {  /* i * 0 ==> 0 */\r\n    return RIGHTFOLD;\r\n  } else if (k == 1) {  /* i * 1 ==> i */\r\n    return LEFTFOLD;\r\n  } else if ((k & (k-1)) == 0) {  /* i * 2^k ==> i << k */\r\n    fins->o = IR_BSHL;\r\n    fins->op2 = lj_ir_kint(J, lj_fls((uint32_t)k));\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KINT)\r\nLJFOLDF(simplify_intmul_k32)\r\n{\r\n  if (fright->i >= 0)\r\n    return simplify_intmul_k(J, fright->i);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MUL any KINT64)\r\nLJFOLDF(simplify_intmul_k64)\r\n{\r\n#if LJ_HASFFI\r\n  if (ir_kint64(fright)->u64 < 0x80000000u)\r\n    return simplify_intmul_k(J, (int32_t)ir_kint64(fright)->u64);\r\n  return NEXTFOLD;\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(MOD any KINT)\r\nLJFOLDF(simplify_intmod_k)\r\n{\r\n  int32_t k = fright->i;\r\n  lua_assert(k != 0);\r\n  if (k > 0 && (k & (k-1)) == 0) {  /* i % (2^k) ==> i & (2^k-1) */\r\n    fins->o = IR_BAND;\r\n    fins->op2 = lj_ir_kint(J, k-1);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MOD KINT any)\r\nLJFOLDF(simplify_intmod_kleft)\r\n{\r\n  if (fleft->i == 0)\r\n    return INTFOLD(0);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any any)\r\nLJFOLD(SUBOV any any)\r\nLJFOLDF(simplify_intsub)\r\n{\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))  /* i - i ==> 0 */\r\n    return irt_is64(fins->t) ? INT64FOLD(0) : INTFOLD(0);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB ADD any)\r\nLJFOLDF(simplify_intsubadd_leftcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    if (fins->op2 == fleft->op1)  /* (i + j) - i ==> j */\r\n      return fleft->op2;\r\n    if (fins->op2 == fleft->op2)  /* (i + j) - j ==> i */\r\n      return fleft->op1;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB SUB any)\r\nLJFOLDF(simplify_intsubsub_leftcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    if (fins->op2 == fleft->op1) {  /* (i - j) - i ==> 0 - j */\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      fins->op2 = fleft->op2;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any SUB)\r\nLJFOLDF(simplify_intsubsub_rightcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fright);\r\n    if (fins->op1 == fright->op1)  /* i - (i - j) ==> j */\r\n      return fright->op2;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB any ADD)\r\nLJFOLDF(simplify_intsubadd_rightcancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fright);\r\n    if (fins->op1 == fright->op1) {  /* i - (i + j) ==> 0 - j */\r\n      fins->op2 = fright->op2;\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      return RETRYFOLD;\r\n    }\r\n    if (fins->op1 == fright->op2) {  /* i - (j + i) ==> 0 - j */\r\n      fins->op2 = fright->op1;\r\n      fins->op1 = (IRRef1)lj_ir_kint(J, 0);\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(SUB ADD ADD)\r\nLJFOLDF(simplify_intsubaddadd_cancel)\r\n{\r\n  if (!irt_isnum(fins->t)) {\r\n    PHIBARRIER(fleft);\r\n    PHIBARRIER(fright);\r\n    if (fleft->op1 == fright->op1) {  /* (i + j1) - (i + j2) ==> j1 - j2 */\r\n      fins->op1 = fleft->op2;\r\n      fins->op2 = fright->op2;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op1 == fright->op2) {  /* (i + j1) - (j2 + i) ==> j1 - j2 */\r\n      fins->op1 = fleft->op2;\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op2 == fright->op1) {  /* (j1 + i) - (i + j2) ==> j1 - j2 */\r\n      fins->op1 = fleft->op1;\r\n      fins->op2 = fright->op2;\r\n      return RETRYFOLD;\r\n    }\r\n    if (fleft->op2 == fright->op2) {  /* (j1 + i) - (j2 + i) ==> j1 - j2 */\r\n      fins->op1 = fleft->op1;\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND any KINT)\r\nLJFOLD(BAND any KINT64)\r\nLJFOLDF(simplify_band_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i & 0 ==> 0 */\r\n    return RIGHTFOLD;\r\n  if (k == -1)  /* i & -1 ==> i */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BOR any KINT)\r\nLJFOLD(BOR any KINT64)\r\nLJFOLDF(simplify_bor_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i | 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == -1)  /* i | -1 ==> -1 */\r\n    return RIGHTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BXOR any KINT)\r\nLJFOLD(BXOR any KINT64)\r\nLJFOLDF(simplify_bxor_k)\r\n{\r\n  int64_t k = fright->o == IR_KINT ? (int64_t)fright->i :\r\n\t\t\t\t     (int64_t)ir_k64(fright)->u64;\r\n  if (k == 0)  /* i xor 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == -1) {  /* i xor -1 ==> ~i */\r\n    fins->o = IR_BNOT;\r\n    fins->op2 = 0;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL any KINT)\r\nLJFOLD(BSHR any KINT)\r\nLJFOLD(BSAR any KINT)\r\nLJFOLD(BROL any KINT)\r\nLJFOLD(BROR any KINT)\r\nLJFOLDF(simplify_shift_ik)\r\n{\r\n  int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n  int32_t k = (fright->i & mask);\r\n  if (k == 0)  /* i o 0 ==> i */\r\n    return LEFTFOLD;\r\n  if (k == 1 && fins->o == IR_BSHL) {  /* i << 1 ==> i + i */\r\n    fins->o = IR_ADD;\r\n    fins->op2 = fins->op1;\r\n    return RETRYFOLD;\r\n  }\r\n  if (k != fright->i) {  /* i o k ==> i o (k & mask) */\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;\r\n  }\r\n#ifndef LJ_TARGET_UNIFYROT\r\n  if (fins->o == IR_BROR) {  /* bror(i, k) ==> brol(i, (-k)&mask) */\r\n    fins->o = IR_BROL;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, (-k)&mask);\r\n    return RETRYFOLD;\r\n  }\r\n#endif\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL any BAND)\r\nLJFOLD(BSHR any BAND)\r\nLJFOLD(BSAR any BAND)\r\nLJFOLD(BROL any BAND)\r\nLJFOLD(BROR any BAND)\r\nLJFOLDF(simplify_shift_andk)\r\n{\r\n  IRIns *irk = IR(fright->op2);\r\n  PHIBARRIER(fright);\r\n  if ((fins->o < IR_BROL ? LJ_TARGET_MASKSHIFT : LJ_TARGET_MASKROT) &&\r\n      irk->o == IR_KINT) {  /* i o (j & mask) ==> i o j */\r\n    int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n    int32_t k = irk->i & mask;\r\n    if (k == mask) {\r\n      fins->op2 = fright->op1;\r\n      return RETRYFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL KINT any)\r\nLJFOLD(BSHR KINT any)\r\nLJFOLD(BSHL KINT64 any)\r\nLJFOLD(BSHR KINT64 any)\r\nLJFOLDF(simplify_shift1_ki)\r\n{\r\n  int64_t k = fleft->o == IR_KINT ? (int64_t)fleft->i :\r\n\t\t\t\t    (int64_t)ir_k64(fleft)->u64;\r\n  if (k == 0)  /* 0 o i ==> 0 */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSAR KINT any)\r\nLJFOLD(BROL KINT any)\r\nLJFOLD(BROR KINT any)\r\nLJFOLD(BSAR KINT64 any)\r\nLJFOLD(BROL KINT64 any)\r\nLJFOLD(BROR KINT64 any)\r\nLJFOLDF(simplify_shift2_ki)\r\n{\r\n  int64_t k = fleft->o == IR_KINT ? (int64_t)fleft->i :\r\n\t\t\t\t    (int64_t)ir_k64(fleft)->u64;\r\n  if (k == 0 || k == -1)  /* 0 o i ==> 0; -1 o i ==> -1 */\r\n    return LEFTFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL BAND KINT)\r\nLJFOLD(BSHR BAND KINT)\r\nLJFOLD(BROL BAND KINT)\r\nLJFOLD(BROR BAND KINT)\r\nLJFOLDF(simplify_shiftk_andk)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  PHIBARRIER(fleft);\r\n  if (irk->o == IR_KINT) {  /* (i & k1) o k2 ==> (i o k2) & (k1 o k2) */\r\n    int32_t k = kfold_intop(irk->i, fright->i, (IROp)fins->o);\r\n    fins->op1 = fleft->op1;\r\n    fins->op1 = (IRRef1)lj_opt_fold(J);\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    fins->ot = IRTI(IR_BAND);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND BSHL KINT)\r\nLJFOLD(BAND BSHR KINT)\r\nLJFOLDF(simplify_andk_shiftk)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT &&\r\n      kfold_intop(-1, irk->i, (IROp)fleft->o) == fright->i)\r\n    return LEFTFOLD;  /* (i o k1) & k2 ==> i, if (-1 o k1) == k2 */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Reassociation ------------------------------------------------------- */\r\n\r\nLJFOLD(ADD ADD KINT)\r\nLJFOLD(MUL MUL KINT)\r\nLJFOLD(BAND BAND KINT)\r\nLJFOLD(BOR BOR KINT)\r\nLJFOLD(BXOR BXOR KINT)\r\nLJFOLDF(reassoc_intarith_k)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT) {\r\n    int32_t k = kfold_intop(irk->i, fright->i, (IROp)fins->o);\r\n    if (k == irk->i)  /* (i o k1) o k2 ==> i o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;  /* (i o k1) o k2 ==> i o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(ADD ADD KINT64)\r\nLJFOLD(MUL MUL KINT64)\r\nLJFOLD(BAND BAND KINT64)\r\nLJFOLD(BOR BOR KINT64)\r\nLJFOLD(BXOR BXOR KINT64)\r\nLJFOLDF(reassoc_intarith_k64)\r\n{\r\n#if LJ_HASFFI\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KINT64) {\r\n    uint64_t k = kfold_int64arith(ir_k64(irk)->u64,\r\n\t\t\t\t  ir_k64(fright)->u64, (IROp)fins->o);\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint64(J, k);\r\n    return RETRYFOLD;  /* (i o k1) o k2 ==> i o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n#else\r\n  UNUSED(J); lua_assert(0); return FAILFOLD;\r\n#endif\r\n}\r\n\r\nLJFOLD(MIN MIN any)\r\nLJFOLD(MAX MAX any)\r\nLJFOLD(BAND BAND any)\r\nLJFOLD(BOR BOR any)\r\nLJFOLDF(reassoc_dup)\r\n{\r\n  if (fins->op2 == fleft->op1 || fins->op2 == fleft->op2)\r\n    return LEFTFOLD;  /* (a o b) o a ==> a o b; (a o b) o b ==> a o b */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BXOR BXOR any)\r\nLJFOLDF(reassoc_bxor)\r\n{\r\n  PHIBARRIER(fleft);\r\n  if (fins->op2 == fleft->op1)  /* (a xor b) xor a ==> b */\r\n    return fleft->op2;\r\n  if (fins->op2 == fleft->op2)  /* (a xor b) xor b ==> a */\r\n    return fleft->op1;\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BSHL BSHL KINT)\r\nLJFOLD(BSHR BSHR KINT)\r\nLJFOLD(BSAR BSAR KINT)\r\nLJFOLD(BROL BROL KINT)\r\nLJFOLD(BROR BROR KINT)\r\nLJFOLDF(reassoc_shift)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  PHIBARRIER(fleft);  /* The (shift any KINT) rule covers k2 == 0 and more. */\r\n  if (irk->o == IR_KINT) {  /* (i o k1) o k2 ==> i o (k1 + k2) */\r\n    int32_t mask = irt_is64(fins->t) ? 63 : 31;\r\n    int32_t k = (irk->i & mask) + (fright->i & mask);\r\n    if (k > mask) {  /* Combined shift too wide? */\r\n      if (fins->o == IR_BSHL || fins->o == IR_BSHR)\r\n\treturn mask == 31 ? INTFOLD(0) : INT64FOLD(0);\r\n      else if (fins->o == IR_BSAR)\r\n\tk = mask;\r\n      else\r\n\tk &= mask;\r\n    }\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, k);\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN MIN KNUM)\r\nLJFOLD(MAX MAX KNUM)\r\nLJFOLD(MIN MIN KINT)\r\nLJFOLD(MAX MAX KINT)\r\nLJFOLDF(reassoc_minmax_k)\r\n{\r\n  IRIns *irk = IR(fleft->op2);\r\n  if (irk->o == IR_KNUM) {\r\n    lua_Number a = ir_knum(irk)->n;\r\n    lua_Number y = lj_vm_foldarith(a, knumright, fins->o - IR_ADD);\r\n    if (a == y)  /* (x o k1) o k2 ==> x o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_knum(J, y);\r\n    return RETRYFOLD;  /* (x o k1) o k2 ==> x o (k1 o k2) */\r\n  } else if (irk->o == IR_KINT) {\r\n    int32_t a = irk->i;\r\n    int32_t y = kfold_intop(a, fright->i, fins->o);\r\n    if (a == y)  /* (x o k1) o k2 ==> x o k1, if (k1 o k2) == k1. */\r\n      return LEFTFOLD;\r\n    PHIBARRIER(fleft);\r\n    fins->op1 = fleft->op1;\r\n    fins->op2 = (IRRef1)lj_ir_kint(J, y);\r\n    return RETRYFOLD;  /* (x o k1) o k2 ==> x o (k1 o k2) */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN MAX any)\r\nLJFOLD(MAX MIN any)\r\nLJFOLDF(reassoc_minmax_left)\r\n{\r\n  if (fins->op2 == fleft->op1 || fins->op2 == fleft->op2)\r\n    return RIGHTFOLD;  /* (b o1 a) o2 b ==> b; (a o1 b) o2 b ==> b */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(MIN any MAX)\r\nLJFOLD(MAX any MIN)\r\nLJFOLDF(reassoc_minmax_right)\r\n{\r\n  if (fins->op1 == fright->op1 || fins->op1 == fright->op2)\r\n    return LEFTFOLD;  /* a o2 (a o1 b) ==> a; a o2 (b o1 a) ==> a */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Array bounds check elimination -------------------------------------- */\r\n\r\n/* Eliminate ABC across PHIs to handle t[i-1] forwarding case.\r\n** ABC(asize, (i+k)+(-k)) ==> ABC(asize, i), but only if it already exists.\r\n** Could be generalized to (i+k1)+k2 ==> i+(k1+k2), but needs better disambig.\r\n*/\r\nLJFOLD(ABC any ADD)\r\nLJFOLDF(abc_fwd)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_ABC)) {\r\n    if (irref_isk(fright->op2)) {\r\n      IRIns *add2 = IR(fright->op1);\r\n      if (add2->o == IR_ADD && irref_isk(add2->op2) &&\r\n\t  IR(fright->op2)->i == -IR(add2->op2)->i) {\r\n\tIRRef ref = J->chain[IR_ABC];\r\n\tIRRef lim = add2->op1;\r\n\tif (fins->op1 > lim) lim = fins->op1;\r\n\twhile (ref > lim) {\r\n\t  IRIns *ir = IR(ref);\r\n\t  if (ir->op1 == fins->op1 && ir->op2 == add2->op1)\r\n\t    return DROPFOLD;\r\n\t  ref = ir->prev;\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Eliminate ABC for constants.\r\n** ABC(asize, k1), ABC(asize k2) ==> ABC(asize, max(k1, k2))\r\n** Drop second ABC if k2 is lower. Otherwise patch first ABC with k2.\r\n*/\r\nLJFOLD(ABC any KINT)\r\nLJFOLDF(abc_k)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_ABC)) {\r\n    IRRef ref = J->chain[IR_ABC];\r\n    IRRef asize = fins->op1;\r\n    while (ref > asize) {\r\n      IRIns *ir = IR(ref);\r\n      if (ir->op1 == asize && irref_isk(ir->op2)) {\r\n\tint32_t k = IR(ir->op2)->i;\r\n\tif (fright->i > k)\r\n\t  ir->op2 = fins->op2;\r\n\treturn DROPFOLD;\r\n      }\r\n      ref = ir->prev;\r\n    }\r\n    return EMITFOLD;  /* Already performed CSE. */\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Eliminate invariant ABC inside loop. */\r\nLJFOLD(ABC any any)\r\nLJFOLDF(abc_invar)\r\n{\r\n  /* Invariant ABC marked as PTR. Drop if op1 is invariant, too. */\r\n  if (!irt_isint(fins->t) && fins->op1 < J->chain[IR_LOOP] &&\r\n      !irt_isphi(IR(fins->op1)->t))\r\n    return DROPFOLD;\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Commutativity ------------------------------------------------------- */\r\n\r\n/* The refs of commutative ops are canonicalized. Lower refs go to the right.\r\n** Rationale behind this:\r\n** - It (also) moves constants to the right.\r\n** - It reduces the number of FOLD rules (e.g. (BOR any KINT) suffices).\r\n** - It helps CSE to find more matches.\r\n** - The assembler generates better code with constants at the right.\r\n*/\r\n\r\nLJFOLD(ADD any any)\r\nLJFOLD(MUL any any)\r\nLJFOLD(ADDOV any any)\r\nLJFOLD(MULOV any any)\r\nLJFOLDF(comm_swap)\r\n{\r\n  if (fins->op1 < fins->op2) {  /* Move lower ref to the right. */\r\n    IRRef1 tmp = fins->op1;\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = tmp;\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(EQ any any)\r\nLJFOLD(NE any any)\r\nLJFOLDF(comm_equal)\r\n{\r\n  /* For non-numbers only: x == x ==> drop; x ~= x ==> fail */\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))\r\n    return CONDFOLD(fins->o == IR_EQ);\r\n  return fold_comm_swap(J);\r\n}\r\n\r\nLJFOLD(LT any any)\r\nLJFOLD(GE any any)\r\nLJFOLD(LE any any)\r\nLJFOLD(GT any any)\r\nLJFOLD(ULT any any)\r\nLJFOLD(UGE any any)\r\nLJFOLD(ULE any any)\r\nLJFOLD(UGT any any)\r\nLJFOLDF(comm_comp)\r\n{\r\n  /* For non-numbers only: x <=> x ==> drop; x <> x ==> fail */\r\n  if (fins->op1 == fins->op2 && !irt_isnum(fins->t))\r\n    return CONDFOLD((fins->o ^ (fins->o >> 1)) & 1);\r\n  if (fins->op1 < fins->op2) {  /* Move lower ref to the right. */\r\n    IRRef1 tmp = fins->op1;\r\n    fins->op1 = fins->op2;\r\n    fins->op2 = tmp;\r\n    fins->o ^= 3; /* GT <-> LT, GE <-> LE, does not affect U */\r\n    return RETRYFOLD;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(BAND any any)\r\nLJFOLD(BOR any any)\r\nLJFOLD(MIN any any)\r\nLJFOLD(MAX any any)\r\nLJFOLDF(comm_dup)\r\n{\r\n  if (fins->op1 == fins->op2)  /* x o x ==> x */\r\n    return LEFTFOLD;\r\n  return fold_comm_swap(J);\r\n}\r\n\r\nLJFOLD(BXOR any any)\r\nLJFOLDF(comm_bxor)\r\n{\r\n  if (fins->op1 == fins->op2)  /* i xor i ==> 0 */\r\n    return irt_is64(fins->t) ? INT64FOLD(0) : INTFOLD(0);\r\n  return fold_comm_swap(J);\r\n}\r\n\r\n/* -- Simplification of compound expressions ------------------------------ */\r\n\r\nstatic TRef kfold_xload(jit_State *J, IRIns *ir, const void *p)\r\n{\r\n  int32_t k;\r\n  switch (irt_type(ir->t)) {\r\n  case IRT_NUM: return lj_ir_knum_u64(J, *(uint64_t *)p);\r\n  case IRT_I8: k = (int32_t)*(int8_t *)p; break;\r\n  case IRT_U8: k = (int32_t)*(uint8_t *)p; break;\r\n  case IRT_I16: k = (int32_t)(int16_t)lj_getu16(p); break;\r\n  case IRT_U16: k = (int32_t)(uint16_t)lj_getu16(p); break;\r\n  case IRT_INT: case IRT_U32: k = (int32_t)lj_getu32(p); break;\r\n  case IRT_I64: case IRT_U64: return lj_ir_kint64(J, *(uint64_t *)p);\r\n  default: return 0;\r\n  }\r\n  return lj_ir_kint(J, k);\r\n}\r\n\r\n/* Turn: string.sub(str, a, b) == kstr\r\n** into: string.byte(str, a) == string.byte(kstr, 1) etc.\r\n** Note: this creates unaligned XLOADs on x86/x64.\r\n*/\r\nLJFOLD(EQ SNEW KGC)\r\nLJFOLD(NE SNEW KGC)\r\nLJFOLDF(merge_eqne_snew_kgc)\r\n{\r\n  GCstr *kstr = ir_kstr(fright);\r\n  int32_t len = (int32_t)kstr->len;\r\n  lua_assert(irt_isstr(fins->t));\r\n\r\n#if LJ_TARGET_UNALIGNED\r\n#define FOLD_SNEW_MAX_LEN\t4  /* Handle string lengths 0, 1, 2, 3, 4. */\r\n#define FOLD_SNEW_TYPE8\t\tIRT_I8\t/* Creates shorter immediates. */\r\n#else\r\n#define FOLD_SNEW_MAX_LEN\t1  /* Handle string lengths 0 or 1. */\r\n#define FOLD_SNEW_TYPE8\t\tIRT_U8  /* Prefer unsigned loads. */\r\n#endif\r\n\r\n  PHIBARRIER(fleft);\r\n  if (len <= FOLD_SNEW_MAX_LEN) {\r\n    IROp op = (IROp)fins->o;\r\n    IRRef strref = fleft->op1;\r\n    if (IR(strref)->o != IR_STRREF)\r\n      return NEXTFOLD;\r\n    if (op == IR_EQ) {\r\n      emitir(IRTGI(IR_EQ), fleft->op2, lj_ir_kint(J, len));\r\n      /* Caveat: fins/fleft/fright is no longer valid after emitir. */\r\n    } else {\r\n      /* NE is not expanded since this would need an OR of two conds. */\r\n      if (!irref_isk(fleft->op2))  /* Only handle the constant length case. */\r\n\treturn NEXTFOLD;\r\n      if (IR(fleft->op2)->i != len)\r\n\treturn DROPFOLD;\r\n    }\r\n    if (len > 0) {\r\n      /* A 4 byte load for length 3 is ok -- all strings have an extra NUL. */\r\n      uint16_t ot = (uint16_t)(len == 1 ? IRT(IR_XLOAD, FOLD_SNEW_TYPE8) :\r\n\t\t\t       len == 2 ? IRT(IR_XLOAD, IRT_U16) :\r\n\t\t\t       IRTI(IR_XLOAD));\r\n      TRef tmp = emitir(ot, strref,\r\n\t\t\tIRXLOAD_READONLY | (len > 1 ? IRXLOAD_UNALIGNED : 0));\r\n      TRef val = kfold_xload(J, IR(tref_ref(tmp)), strdata(kstr));\r\n      if (len == 3)\r\n\ttmp = emitir(IRTI(IR_BAND), tmp,\r\n\t\t     lj_ir_kint(J, LJ_ENDIAN_SELECT(0x00ffffff, 0xffffff00)));\r\n      fins->op1 = (IRRef1)tmp;\r\n      fins->op2 = (IRRef1)val;\r\n      fins->ot = (IROpT)IRTGI(op);\r\n      return RETRYFOLD;\r\n    } else {\r\n      return DROPFOLD;\r\n    }\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Loads --------------------------------------------------------------- */\r\n\r\n/* Loads cannot be folded or passed on to CSE in general.\r\n** Alias analysis is needed to check for forwarding opportunities.\r\n**\r\n** Caveat: *all* loads must be listed here or they end up at CSE!\r\n*/\r\n\r\nLJFOLD(ALOAD any)\r\nLJFOLDX(lj_opt_fwd_aload)\r\n\r\n/* From HREF fwd (see below). Must eliminate, not supported by fwd/backend. */\r\nLJFOLD(HLOAD KKPTR)\r\nLJFOLDF(kfold_hload_kkptr)\r\n{\r\n  UNUSED(J);\r\n  lua_assert(ir_kptr(fleft) == niltvg(J2G(J)));\r\n  return TREF_NIL;\r\n}\r\n\r\nLJFOLD(HLOAD any)\r\nLJFOLDX(lj_opt_fwd_hload)\r\n\r\nLJFOLD(ULOAD any)\r\nLJFOLDX(lj_opt_fwd_uload)\r\n\r\nLJFOLD(CALLL any IRCALL_lj_tab_len)\r\nLJFOLDX(lj_opt_fwd_tab_len)\r\n\r\n/* Upvalue refs are really loads, but there are no corresponding stores.\r\n** So CSE is ok for them, except for UREFO across a GC step (see below).\r\n** If the referenced function is const, its upvalue addresses are const, too.\r\n** This can be used to improve CSE by looking for the same address,\r\n** even if the upvalues originate from a different function.\r\n*/\r\nLJFOLD(UREFO KGC any)\r\nLJFOLD(UREFC KGC any)\r\nLJFOLDF(cse_uref)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    IRRef ref = J->chain[fins->o];\r\n    GCfunc *fn = ir_kfunc(fleft);\r\n    GCupval *uv = gco2uv(gcref(fn->l.uvptr[(fins->op2 >> 8)]));\r\n    while (ref > 0) {\r\n      IRIns *ir = IR(ref);\r\n      if (irref_isk(ir->op1)) {\r\n\tGCfunc *fn2 = ir_kfunc(IR(ir->op1));\r\n\tif (gco2uv(gcref(fn2->l.uvptr[(ir->op2 >> 8)])) == uv) {\r\n\t  if (fins->o == IR_UREFO && gcstep_barrier(J, ref))\r\n\t    break;\r\n\t  return ref;\r\n\t}\r\n      }\r\n      ref = ir->prev;\r\n    }\r\n  }\r\n  return EMITFOLD;\r\n}\r\n\r\nLJFOLD(HREFK any any)\r\nLJFOLDX(lj_opt_fwd_hrefk)\r\n\r\nLJFOLD(HREF TNEW any)\r\nLJFOLDF(fwd_href_tnew)\r\n{\r\n  if (lj_opt_fwd_href_nokey(J))\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(HREF TDUP KPRI)\r\nLJFOLD(HREF TDUP KGC)\r\nLJFOLD(HREF TDUP KNUM)\r\nLJFOLDF(fwd_href_tdup)\r\n{\r\n  TValue keyv;\r\n  lj_ir_kvalue(J->L, &keyv, fright);\r\n  if (lj_tab_get(J->L, ir_ktab(IR(fleft->op1)), &keyv) == niltvg(J2G(J)) &&\r\n      lj_opt_fwd_href_nokey(J))\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* We can safely FOLD/CSE array/hash refs and field loads, since there\r\n** are no corresponding stores. But we need to check for any NEWREF with\r\n** an aliased table, as it may invalidate all of the pointers and fields.\r\n** Only HREF needs the NEWREF check -- AREF and HREFK already depend on\r\n** FLOADs. And NEWREF itself is treated like a store (see below).\r\n** LREF is constant (per trace) since coroutine switches are not inlined.\r\n*/\r\nLJFOLD(FLOAD TNEW IRFL_TAB_ASIZE)\r\nLJFOLDF(fload_tab_tnew_asize)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD(fleft->op1);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TNEW IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_tnew_hmask)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((1 << fleft->op2)-1);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TDUP IRFL_TAB_ASIZE)\r\nLJFOLDF(fload_tab_tdup_asize)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((int32_t)ir_ktab(IR(fleft->op1))->asize);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TDUP IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_tdup_hmask)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && lj_opt_fwd_tptr(J, fins->op1))\r\n    return INTFOLD((int32_t)ir_ktab(IR(fleft->op1))->hmask);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(HREF any any)\r\nLJFOLD(FLOAD any IRFL_TAB_ARRAY)\r\nLJFOLD(FLOAD any IRFL_TAB_NODE)\r\nLJFOLD(FLOAD any IRFL_TAB_ASIZE)\r\nLJFOLD(FLOAD any IRFL_TAB_HMASK)\r\nLJFOLDF(fload_tab_ah)\r\n{\r\n  TRef tr = lj_opt_cse(J);\r\n  return lj_opt_fwd_tptr(J, tref_ref(tr)) ? tr : EMITFOLD;\r\n}\r\n\r\n/* Strings are immutable, so we can safely FOLD/CSE the related FLOAD. */\r\nLJFOLD(FLOAD KGC IRFL_STR_LEN)\r\nLJFOLDF(fload_str_len_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return INTFOLD((int32_t)ir_kstr(fleft)->len);\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD SNEW IRFL_STR_LEN)\r\nLJFOLDF(fload_str_len_snew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD)) {\r\n    PHIBARRIER(fleft);\r\n    return fleft->op2;\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD TOSTR IRFL_STR_LEN)\r\nLJFOLDF(fload_str_len_tostr)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD) && fleft->op2 == IRTOSTR_CHAR)\r\n    return INTFOLD(1);\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* The C type ID of cdata objects is immutable. */\r\nLJFOLD(FLOAD KGC IRFL_CDATA_CTYPEID)\r\nLJFOLDF(fload_cdata_typeid_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return INTFOLD((int32_t)ir_kcdata(fleft)->ctypeid);\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Get the contents of immutable cdata objects. */\r\nLJFOLD(FLOAD KGC IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD KGC IRFL_CDATA_INT)\r\nLJFOLD(FLOAD KGC IRFL_CDATA_INT64)\r\nLJFOLDF(fload_cdata_int64_kgc)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD)) {\r\n    void *p = cdataptr(ir_kcdata(fleft));\r\n    if (irt_is64(fins->t))\r\n      return INT64FOLD(*(uint64_t *)p);\r\n    else\r\n      return INTFOLD(*(int32_t *)p);\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD CNEW IRFL_CDATA_CTYPEID)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_CTYPEID)\r\nLJFOLDF(fload_cdata_typeid_cnew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return fleft->op1;  /* No PHI barrier needed. CNEW/CNEWI op1 is const. */\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* Pointer, int and int64 cdata objects are immutable. */\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_INT)\r\nLJFOLD(FLOAD CNEWI IRFL_CDATA_INT64)\r\nLJFOLDF(fload_cdata_ptr_int64_cnew)\r\n{\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_FOLD))\r\n    return fleft->op2;  /* Fold even across PHI to avoid allocations. */\r\n  return NEXTFOLD;\r\n}\r\n\r\nLJFOLD(FLOAD any IRFL_STR_LEN)\r\nLJFOLD(FLOAD any IRFL_FUNC_ENV)\r\nLJFOLD(FLOAD any IRFL_THREAD_ENV)\r\nLJFOLD(FLOAD any IRFL_CDATA_CTYPEID)\r\nLJFOLD(FLOAD any IRFL_CDATA_PTR)\r\nLJFOLD(FLOAD any IRFL_CDATA_INT)\r\nLJFOLD(FLOAD any IRFL_CDATA_INT64)\r\nLJFOLD(VLOAD any any)  /* Vararg loads have no corresponding stores. */\r\nLJFOLDX(lj_opt_cse)\r\n\r\n/* All other field loads need alias analysis. */\r\nLJFOLD(FLOAD any any)\r\nLJFOLDX(lj_opt_fwd_fload)\r\n\r\n/* This is for LOOP only. Recording handles SLOADs internally. */\r\nLJFOLD(SLOAD any any)\r\nLJFOLDF(fwd_sload)\r\n{\r\n  if ((fins->op2 & IRSLOAD_FRAME)) {\r\n    TRef tr = lj_opt_cse(J);\r\n    return tref_ref(tr) < J->chain[IR_RETF] ? EMITFOLD : tr;\r\n  } else {\r\n    lua_assert(J->slot[fins->op1] != 0);\r\n    return J->slot[fins->op1];\r\n  }\r\n}\r\n\r\n/* Only fold for KKPTR. The pointer _and_ the contents must be const. */\r\nLJFOLD(XLOAD KKPTR any)\r\nLJFOLDF(xload_kptr)\r\n{\r\n  TRef tr = kfold_xload(J, fins, ir_kptr(fleft));\r\n  return tr ? tr : NEXTFOLD;\r\n}\r\n\r\nLJFOLD(XLOAD any any)\r\nLJFOLDX(lj_opt_fwd_xload)\r\n\r\n/* -- Write barriers ------------------------------------------------------ */\r\n\r\n/* Write barriers are amenable to CSE, but not across any incremental\r\n** GC steps.\r\n**\r\n** The same logic applies to open upvalue references, because a stack\r\n** may be resized during a GC step (not the current stack, but maybe that\r\n** of a coroutine).\r\n*/\r\nLJFOLD(TBAR any)\r\nLJFOLD(OBAR any any)\r\nLJFOLD(UREFO any any)\r\nLJFOLDF(barrier_tab)\r\n{\r\n  TRef tr = lj_opt_cse(J);\r\n  if (gcstep_barrier(J, tref_ref(tr)))  /* CSE across GC step? */\r\n    return EMITFOLD;  /* Raw emit. Assumes fins is left intact by CSE. */\r\n  return tr;\r\n}\r\n\r\nLJFOLD(TBAR TNEW)\r\nLJFOLD(TBAR TDUP)\r\nLJFOLDF(barrier_tnew_tdup)\r\n{\r\n  /* New tables are always white and never need a barrier. */\r\n  if (fins->op1 < J->chain[IR_LOOP])  /* Except across a GC step. */\r\n    return NEXTFOLD;\r\n  return DROPFOLD;\r\n}\r\n\r\n/* -- Profiling ----------------------------------------------------------- */\r\n\r\nLJFOLD(PROF any any)\r\nLJFOLDF(prof)\r\n{\r\n  IRRef ref = J->chain[IR_PROF];\r\n  if (ref+1 == J->cur.nins)  /* Drop neighbouring IR_PROF. */\r\n    return ref;\r\n  return EMITFOLD;\r\n}\r\n\r\n/* -- Stores and allocations ---------------------------------------------- */\r\n\r\n/* Stores and allocations cannot be folded or passed on to CSE in general.\r\n** But some stores can be eliminated with dead-store elimination (DSE).\r\n**\r\n** Caveat: *all* stores and allocs must be listed here or they end up at CSE!\r\n*/\r\n\r\nLJFOLD(ASTORE any any)\r\nLJFOLD(HSTORE any any)\r\nLJFOLDX(lj_opt_dse_ahstore)\r\n\r\nLJFOLD(USTORE any any)\r\nLJFOLDX(lj_opt_dse_ustore)\r\n\r\nLJFOLD(FSTORE any any)\r\nLJFOLDX(lj_opt_dse_fstore)\r\n\r\nLJFOLD(XSTORE any any)\r\nLJFOLDX(lj_opt_dse_xstore)\r\n\r\nLJFOLD(NEWREF any any)  /* Treated like a store. */\r\nLJFOLD(CALLA any any)\r\nLJFOLD(CALLL any any)  /* Safeguard fallback. */\r\nLJFOLD(CALLS any any)\r\nLJFOLD(CALLXS any any)\r\nLJFOLD(XBAR)\r\nLJFOLD(RETF any any)  /* Modifies BASE. */\r\nLJFOLD(TNEW any any)\r\nLJFOLD(TDUP any)\r\nLJFOLD(CNEW any any)\r\nLJFOLD(XSNEW any any)\r\nLJFOLD(BUFHDR any any)\r\nLJFOLDX(lj_ir_emit)\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Every entry in the generated hash table is a 32 bit pattern:\r\n**\r\n** xxxxxxxx iiiiiii lllllll rrrrrrrrrr\r\n**\r\n**   xxxxxxxx = 8 bit index into fold function table\r\n**    iiiiiii = 7 bit folded instruction opcode\r\n**    lllllll = 7 bit left instruction opcode\r\n** rrrrrrrrrr = 8 bit right instruction opcode or 10 bits from literal field\r\n*/\r\n\r\n#include \"lj_folddef.h\"\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n/* Fold IR instruction. */\r\nTRef LJ_FASTCALL lj_opt_fold(jit_State *J)\r\n{\r\n  uint32_t key, any;\r\n  IRRef ref;\r\n\r\n  if (LJ_UNLIKELY((J->flags & JIT_F_OPT_MASK) != JIT_F_OPT_DEFAULT)) {\r\n    lua_assert(((JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE|JIT_F_OPT_DSE) |\r\n\t\tJIT_F_OPT_DEFAULT) == JIT_F_OPT_DEFAULT);\r\n    /* Folding disabled? Chain to CSE, but not for loads/stores/allocs. */\r\n    if (!(J->flags & JIT_F_OPT_FOLD) && irm_kind(lj_ir_mode[fins->o]) == IRM_N)\r\n      return lj_opt_cse(J);\r\n\r\n    /* No FOLD, forwarding or CSE? Emit raw IR for loads, except for SLOAD. */\r\n    if ((J->flags & (JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE)) !=\r\n\t\t    (JIT_F_OPT_FOLD|JIT_F_OPT_FWD|JIT_F_OPT_CSE) &&\r\n\tirm_kind(lj_ir_mode[fins->o]) == IRM_L && fins->o != IR_SLOAD)\r\n      return lj_ir_emit(J);\r\n\r\n    /* No FOLD or DSE? Emit raw IR for stores. */\r\n    if ((J->flags & (JIT_F_OPT_FOLD|JIT_F_OPT_DSE)) !=\r\n\t\t    (JIT_F_OPT_FOLD|JIT_F_OPT_DSE) &&\r\n\tirm_kind(lj_ir_mode[fins->o]) == IRM_S)\r\n      return lj_ir_emit(J);\r\n  }\r\n\r\n  /* Fold engine start/retry point. */\r\nretry:\r\n  /* Construct key from opcode and operand opcodes (unless literal/none). */\r\n  key = ((uint32_t)fins->o << 17);\r\n  if (fins->op1 >= J->cur.nk) {\r\n    key += (uint32_t)IR(fins->op1)->o << 10;\r\n    *fleft = *IR(fins->op1);\r\n  }\r\n  if (fins->op2 >= J->cur.nk) {\r\n    key += (uint32_t)IR(fins->op2)->o;\r\n    *fright = *IR(fins->op2);\r\n  } else {\r\n    key += (fins->op2 & 0x3ffu);  /* Literal mask. Must include IRCONV_*MASK. */\r\n  }\r\n\r\n  /* Check for a match in order from most specific to least specific. */\r\n  any = 0;\r\n  for (;;) {\r\n    uint32_t k = key | (any & 0x1ffff);\r\n    uint32_t h = fold_hashkey(k);\r\n    uint32_t fh = fold_hash[h];  /* Lookup key in semi-perfect hash table. */\r\n    if ((fh & 0xffffff) == k || (fh = fold_hash[h+1], (fh & 0xffffff) == k)) {\r\n      ref = (IRRef)tref_ref(fold_func[fh >> 24](J));\r\n      if (ref != NEXTFOLD)\r\n\tbreak;\r\n    }\r\n    if (any == 0xfffff)  /* Exhausted folding. Pass on to CSE. */\r\n      return lj_opt_cse(J);\r\n    any = (any | (any >> 10)) ^ 0xffc00;\r\n  }\r\n\r\n  /* Return value processing, ordered by frequency. */\r\n  if (LJ_LIKELY(ref >= MAX_FOLD))\r\n    return TREF(ref, irt_t(IR(ref)->t));\r\n  if (ref == RETRYFOLD)\r\n    goto retry;\r\n  if (ref == KINTFOLD)\r\n    return lj_ir_kint(J, fins->i);\r\n  if (ref == FAILFOLD)\r\n    lj_trace_err(J, LJ_TRERR_GFAIL);\r\n  lua_assert(ref == DROPFOLD);\r\n  return REF_DROP;\r\n}\r\n\r\n/* -- Common-Subexpression Elimination ------------------------------------ */\r\n\r\n/* CSE an IR instruction. This is very fast due to the skip-list chains. */\r\nTRef LJ_FASTCALL lj_opt_cse(jit_State *J)\r\n{\r\n  /* Avoid narrow to wide store-to-load forwarding stall */\r\n  IRRef2 op12 = (IRRef2)fins->op1 + ((IRRef2)fins->op2 << 16);\r\n  IROp op = fins->o;\r\n  if (LJ_LIKELY(J->flags & JIT_F_OPT_CSE)) {\r\n    /* Limited search for same operands in per-opcode chain. */\r\n    IRRef ref = J->chain[op];\r\n    IRRef lim = fins->op1;\r\n    if (fins->op2 > lim) lim = fins->op2;  /* Relies on lit < REF_BIAS. */\r\n    while (ref > lim) {\r\n      if (IR(ref)->op12 == op12)\r\n\treturn TREF(ref, irt_t(IR(ref)->t));  /* Common subexpression found. */\r\n      ref = IR(ref)->prev;\r\n    }\r\n  }\r\n  /* Otherwise emit IR (inlined for speed). */\r\n  {\r\n    IRRef ref = lj_ir_nextins(J);\r\n    IRIns *ir = IR(ref);\r\n    ir->prev = J->chain[op];\r\n    ir->op12 = op12;\r\n    J->chain[op] = (IRRef1)ref;\r\n    ir->o = fins->o;\r\n    J->guardemit.irt |= fins->t.irt;\r\n    return TREF(ref, irt_t((ir->t = fins->t)));\r\n  }\r\n}\r\n\r\n/* CSE with explicit search limit. */\r\nTRef LJ_FASTCALL lj_opt_cselim(jit_State *J, IRRef lim)\r\n{\r\n  IRRef ref = J->chain[fins->o];\r\n  IRRef2 op12 = (IRRef2)fins->op1 + ((IRRef2)fins->op2 << 16);\r\n  while (ref > lim) {\r\n    if (IR(ref)->op12 == op12)\r\n      return ref;\r\n    ref = IR(ref)->prev;\r\n  }\r\n  return lj_ir_emit(J);\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#undef IR\r\n#undef fins\r\n#undef fleft\r\n#undef fright\r\n#undef knumleft\r\n#undef knumright\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_loop.c",
    "content": "/*\r\n** LOOP: Loop Optimizations.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_loop_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Loop optimization:\r\n**\r\n** Traditional Loop-Invariant Code Motion (LICM) splits the instructions\r\n** of a loop into invariant and variant instructions. The invariant\r\n** instructions are hoisted out of the loop and only the variant\r\n** instructions remain inside the loop body.\r\n**\r\n** Unfortunately LICM is mostly useless for compiling dynamic languages.\r\n** The IR has many guards and most of the subsequent instructions are\r\n** control-dependent on them. The first non-hoistable guard would\r\n** effectively prevent hoisting of all subsequent instructions.\r\n**\r\n** That's why we use a special form of unrolling using copy-substitution,\r\n** combined with redundancy elimination:\r\n**\r\n** The recorded instruction stream is re-emitted to the compiler pipeline\r\n** with substituted operands. The substitution table is filled with the\r\n** refs returned by re-emitting each instruction. This can be done\r\n** on-the-fly, because the IR is in strict SSA form, where every ref is\r\n** defined before its use.\r\n**\r\n** This aproach generates two code sections, separated by the LOOP\r\n** instruction:\r\n**\r\n** 1. The recorded instructions form a kind of pre-roll for the loop. It\r\n** contains a mix of invariant and variant instructions and performs\r\n** exactly one loop iteration (but not necessarily the 1st iteration).\r\n**\r\n** 2. The loop body contains only the variant instructions and performs\r\n** all remaining loop iterations.\r\n**\r\n** On first sight that looks like a waste of space, because the variant\r\n** instructions are present twice. But the key insight is that the\r\n** pre-roll honors the control-dependencies for *both* the pre-roll itself\r\n** *and* the loop body!\r\n**\r\n** It also means one doesn't have to explicitly model control-dependencies\r\n** (which, BTW, wouldn't help LICM much). And it's much easier to\r\n** integrate sparse snapshotting with this approach.\r\n**\r\n** One of the nicest aspects of this approach is that all of the\r\n** optimizations of the compiler pipeline (FOLD, CSE, FWD, etc.) can be\r\n** reused with only minor restrictions (e.g. one should not fold\r\n** instructions across loop-carried dependencies).\r\n**\r\n** But in general all optimizations can be applied which only need to look\r\n** backwards into the generated instruction stream. At any point in time\r\n** during the copy-substitution process this contains both a static loop\r\n** iteration (the pre-roll) and a dynamic one (from the to-be-copied\r\n** instruction up to the end of the partial loop body).\r\n**\r\n** Since control-dependencies are implicitly kept, CSE also applies to all\r\n** kinds of guards. The major advantage is that all invariant guards can\r\n** be hoisted, too.\r\n**\r\n** Load/store forwarding works across loop iterations, too. This is\r\n** important if loop-carried dependencies are kept in upvalues or tables.\r\n** E.g. 'self.idx = self.idx + 1' deep down in some OO-style method may\r\n** become a forwarded loop-recurrence after inlining.\r\n**\r\n** Since the IR is in SSA form, loop-carried dependencies have to be\r\n** modeled with PHI instructions. The potential candidates for PHIs are\r\n** collected on-the-fly during copy-substitution. After eliminating the\r\n** redundant ones, PHI instructions are emitted *below* the loop body.\r\n**\r\n** Note that this departure from traditional SSA form doesn't change the\r\n** semantics of the PHI instructions themselves. But it greatly simplifies\r\n** on-the-fly generation of the IR and the machine code.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- PHI elimination ----------------------------------------------------- */\r\n\r\n/* Emit or eliminate collected PHIs. */\r\nstatic void loop_emit_phi(jit_State *J, IRRef1 *subst, IRRef1 *phi, IRRef nphi,\r\n\t\t\t  SnapNo onsnap)\r\n{\r\n  int passx = 0;\r\n  IRRef i, j, nslots;\r\n  IRRef invar = J->chain[IR_LOOP];\r\n  /* Pass #1: mark redundant and potentially redundant PHIs. */\r\n  for (i = 0, j = 0; i < nphi; i++) {\r\n    IRRef lref = phi[i];\r\n    IRRef rref = subst[lref];\r\n    if (lref == rref || rref == REF_DROP) {  /* Invariants are redundant. */\r\n      irt_clearphi(IR(lref)->t);\r\n    } else {\r\n      phi[j++] = (IRRef1)lref;\r\n      if (!(IR(rref)->op1 == lref || IR(rref)->op2 == lref)) {\r\n\t/* Quick check for simple recurrences failed, need pass2. */\r\n\tirt_setmark(IR(lref)->t);\r\n\tpassx = 1;\r\n      }\r\n    }\r\n  }\r\n  nphi = j;\r\n  /* Pass #2: traverse variant part and clear marks of non-redundant PHIs. */\r\n  if (passx) {\r\n    SnapNo s;\r\n    for (i = J->cur.nins-1; i > invar; i--) {\r\n      IRIns *ir = IR(i);\r\n      if (!irref_isk(ir->op2)) irt_clearmark(IR(ir->op2)->t);\r\n      if (!irref_isk(ir->op1)) {\r\n\tirt_clearmark(IR(ir->op1)->t);\r\n\tif (ir->op1 < invar &&\r\n\t    ir->o >= IR_CALLN && ir->o <= IR_CARG) {  /* ORDER IR */\r\n\t  ir = IR(ir->op1);\r\n\t  while (ir->o == IR_CARG) {\r\n\t    if (!irref_isk(ir->op2)) irt_clearmark(IR(ir->op2)->t);\r\n\t    if (irref_isk(ir->op1)) break;\r\n\t    ir = IR(ir->op1);\r\n\t    irt_clearmark(ir->t);\r\n\t  }\r\n\t}\r\n      }\r\n    }\r\n    for (s = J->cur.nsnap-1; s >= onsnap; s--) {\r\n      SnapShot *snap = &J->cur.snap[s];\r\n      SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n      MSize n, nent = snap->nent;\r\n      for (n = 0; n < nent; n++) {\r\n\tIRRef ref = snap_ref(map[n]);\r\n\tif (!irref_isk(ref)) irt_clearmark(IR(ref)->t);\r\n      }\r\n    }\r\n  }\r\n  /* Pass #3: add PHIs for variant slots without a corresponding SLOAD. */\r\n  nslots = J->baseslot+J->maxslot;\r\n  for (i = 1; i < nslots; i++) {\r\n    IRRef ref = tref_ref(J->slot[i]);\r\n    while (!irref_isk(ref) && ref != subst[ref]) {\r\n      IRIns *ir = IR(ref);\r\n      irt_clearmark(ir->t);  /* Unmark potential uses, too. */\r\n      if (irt_isphi(ir->t) || irt_ispri(ir->t))\r\n\tbreak;\r\n      irt_setphi(ir->t);\r\n      if (nphi >= LJ_MAX_PHI)\r\n\tlj_trace_err(J, LJ_TRERR_PHIOV);\r\n      phi[nphi++] = (IRRef1)ref;\r\n      ref = subst[ref];\r\n      if (ref > invar)\r\n\tbreak;\r\n    }\r\n  }\r\n  /* Pass #4: propagate non-redundant PHIs. */\r\n  while (passx) {\r\n    passx = 0;\r\n    for (i = 0; i < nphi; i++) {\r\n      IRRef lref = phi[i];\r\n      IRIns *ir = IR(lref);\r\n      if (!irt_ismarked(ir->t)) {  /* Propagate only from unmarked PHIs. */\r\n\tIRIns *irr = IR(subst[lref]);\r\n\tif (irt_ismarked(irr->t)) {  /* Right ref points to other PHI? */\r\n\t  irt_clearmark(irr->t);  /* Mark that PHI as non-redundant. */\r\n\t  passx = 1;  /* Retry. */\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  /* Pass #5: emit PHI instructions or eliminate PHIs. */\r\n  for (i = 0; i < nphi; i++) {\r\n    IRRef lref = phi[i];\r\n    IRIns *ir = IR(lref);\r\n    if (!irt_ismarked(ir->t)) {  /* Emit PHI if not marked. */\r\n      IRRef rref = subst[lref];\r\n      if (rref > invar)\r\n\tirt_setphi(IR(rref)->t);\r\n      emitir_raw(IRT(IR_PHI, irt_type(ir->t)), lref, rref);\r\n    } else {  /* Otherwise eliminate PHI. */\r\n      irt_clearmark(ir->t);\r\n      irt_clearphi(ir->t);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Loop unrolling using copy-substitution ------------------------------ */\r\n\r\n/* Copy-substitute snapshot. */\r\nstatic void loop_subst_snap(jit_State *J, SnapShot *osnap,\r\n\t\t\t    SnapEntry *loopmap, IRRef1 *subst)\r\n{\r\n  SnapEntry *nmap, *omap = &J->cur.snapmap[osnap->mapofs];\r\n  SnapEntry *nextmap = &J->cur.snapmap[snap_nextofs(&J->cur, osnap)];\r\n  MSize nmapofs;\r\n  MSize on, ln, nn, onent = osnap->nent;\r\n  BCReg nslots = osnap->nslots;\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap];\r\n  if (irt_isguard(J->guardemit)) {  /* Guard inbetween? */\r\n    nmapofs = J->cur.nsnapmap;\r\n    J->cur.nsnap++;  /* Add new snapshot. */\r\n  } else {  /* Otherwise overwrite previous snapshot. */\r\n    snap--;\r\n    nmapofs = snap->mapofs;\r\n  }\r\n  J->guardemit.irt = 0;\r\n  /* Setup new snapshot. */\r\n  snap->mapofs = (uint16_t)nmapofs;\r\n  snap->ref = (IRRef1)J->cur.nins;\r\n  snap->nslots = nslots;\r\n  snap->topslot = osnap->topslot;\r\n  snap->count = 0;\r\n  nmap = &J->cur.snapmap[nmapofs];\r\n  /* Substitute snapshot slots. */\r\n  on = ln = nn = 0;\r\n  while (on < onent) {\r\n    SnapEntry osn = omap[on], lsn = loopmap[ln];\r\n    if (snap_slot(lsn) < snap_slot(osn)) {  /* Copy slot from loop map. */\r\n      nmap[nn++] = lsn;\r\n      ln++;\r\n    } else {  /* Copy substituted slot from snapshot map. */\r\n      if (snap_slot(lsn) == snap_slot(osn)) ln++;  /* Shadowed loop slot. */\r\n      if (!irref_isk(snap_ref(osn)))\r\n\tosn = snap_setref(osn, subst[snap_ref(osn)]);\r\n      nmap[nn++] = osn;\r\n      on++;\r\n    }\r\n  }\r\n  while (snap_slot(loopmap[ln]) < nslots)  /* Copy remaining loop slots. */\r\n    nmap[nn++] = loopmap[ln++];\r\n  snap->nent = (uint8_t)nn;\r\n  omap += onent;\r\n  nmap += nn;\r\n  while (omap < nextmap)  /* Copy PC + frame links. */\r\n    *nmap++ = *omap++;\r\n  J->cur.nsnapmap = (uint16_t)(nmap - J->cur.snapmap);\r\n}\r\n\r\ntypedef struct LoopState {\r\n  jit_State *J;\r\n  IRRef1 *subst;\r\n  MSize sizesubst;\r\n} LoopState;\r\n\r\n/* Unroll loop. */\r\nstatic void loop_unroll(LoopState *lps)\r\n{\r\n  jit_State *J = lps->J;\r\n  IRRef1 phi[LJ_MAX_PHI];\r\n  uint32_t nphi = 0;\r\n  IRRef1 *subst;\r\n  SnapNo onsnap;\r\n  SnapShot *osnap, *loopsnap;\r\n  SnapEntry *loopmap, *psentinel;\r\n  IRRef ins, invar;\r\n\r\n  /* Allocate substitution table.\r\n  ** Only non-constant refs in [REF_BIAS,invar) are valid indexes.\r\n  */\r\n  invar = J->cur.nins;\r\n  lps->sizesubst = invar - REF_BIAS;\r\n  lps->subst = lj_mem_newvec(J->L, lps->sizesubst, IRRef1);\r\n  subst = lps->subst - REF_BIAS;\r\n  subst[REF_BASE] = REF_BASE;\r\n\r\n  /* LOOP separates the pre-roll from the loop body. */\r\n  emitir_raw(IRTG(IR_LOOP, IRT_NIL), 0, 0);\r\n\r\n  /* Grow snapshot buffer and map for copy-substituted snapshots.\r\n  ** Need up to twice the number of snapshots minus #0 and loop snapshot.\r\n  ** Need up to twice the number of entries plus fallback substitutions\r\n  ** from the loop snapshot entries for each new snapshot.\r\n  ** Caveat: both calls may reallocate J->cur.snap and J->cur.snapmap!\r\n  */\r\n  onsnap = J->cur.nsnap;\r\n  lj_snap_grow_buf(J, 2*onsnap-2);\r\n  lj_snap_grow_map(J, J->cur.nsnapmap*2+(onsnap-2)*J->cur.snap[onsnap-1].nent);\r\n\r\n  /* The loop snapshot is used for fallback substitutions. */\r\n  loopsnap = &J->cur.snap[onsnap-1];\r\n  loopmap = &J->cur.snapmap[loopsnap->mapofs];\r\n  /* The PC of snapshot #0 and the loop snapshot must match. */\r\n  psentinel = &loopmap[loopsnap->nent];\r\n  lua_assert(*psentinel == J->cur.snapmap[J->cur.snap[0].nent]);\r\n  *psentinel = SNAP(255, 0, 0);  /* Replace PC with temporary sentinel. */\r\n\r\n  /* Start substitution with snapshot #1 (#0 is empty for root traces). */\r\n  osnap = &J->cur.snap[1];\r\n\r\n  /* Copy and substitute all recorded instructions and snapshots. */\r\n  for (ins = REF_FIRST; ins < invar; ins++) {\r\n    IRIns *ir;\r\n    IRRef op1, op2;\r\n\r\n    if (ins >= osnap->ref)  /* Instruction belongs to next snapshot? */\r\n      loop_subst_snap(J, osnap++, loopmap, subst);  /* Copy-substitute it. */\r\n\r\n    /* Substitute instruction operands. */\r\n    ir = IR(ins);\r\n    op1 = ir->op1;\r\n    if (!irref_isk(op1)) op1 = subst[op1];\r\n    op2 = ir->op2;\r\n    if (!irref_isk(op2)) op2 = subst[op2];\r\n    if (irm_kind(lj_ir_mode[ir->o]) == IRM_N &&\r\n\top1 == ir->op1 && op2 == ir->op2) {  /* Regular invariant ins? */\r\n      subst[ins] = (IRRef1)ins;  /* Shortcut. */\r\n    } else {\r\n      /* Re-emit substituted instruction to the FOLD/CSE/etc. pipeline. */\r\n      IRType1 t = ir->t;  /* Get this first, since emitir may invalidate ir. */\r\n      IRRef ref = tref_ref(emitir(ir->ot & ~IRT_ISPHI, op1, op2));\r\n      subst[ins] = (IRRef1)ref;\r\n      if (ref != ins) {\r\n\tIRIns *irr = IR(ref);\r\n\tif (ref < invar) {  /* Loop-carried dependency? */\r\n\t  /* Potential PHI? */\r\n\t  if (!irref_isk(ref) && !irt_isphi(irr->t) && !irt_ispri(irr->t)) {\r\n\t    irt_setphi(irr->t);\r\n\t    if (nphi >= LJ_MAX_PHI)\r\n\t      lj_trace_err(J, LJ_TRERR_PHIOV);\r\n\t    phi[nphi++] = (IRRef1)ref;\r\n\t  }\r\n\t  /* Check all loop-carried dependencies for type instability. */\r\n\t  if (!irt_sametype(t, irr->t)) {\r\n\t    if (irt_isinteger(t) && irt_isinteger(irr->t))\r\n\t      continue;\r\n\t    else if (irt_isnum(t) && irt_isinteger(irr->t))  /* Fix int->num. */\r\n\t      ref = tref_ref(emitir(IRTN(IR_CONV), ref, IRCONV_NUM_INT));\r\n\t    else if (irt_isnum(irr->t) && irt_isinteger(t))  /* Fix num->int. */\r\n\t      ref = tref_ref(emitir(IRTGI(IR_CONV), ref,\r\n\t\t\t\t    IRCONV_INT_NUM|IRCONV_CHECK));\r\n\t    else\r\n\t      lj_trace_err(J, LJ_TRERR_TYPEINS);\r\n\t    subst[ins] = (IRRef1)ref;\r\n\t    irr = IR(ref);\r\n\t    goto phiconv;\r\n\t  }\r\n\t} else if (ref != REF_DROP && irr->o == IR_CONV &&\r\n\t\t   ref > invar && irr->op1 < invar) {\r\n\t  /* May need an extra PHI for a CONV. */\r\n\t  ref = irr->op1;\r\n\t  irr = IR(ref);\r\n\tphiconv:\r\n\t  if (ref < invar && !irref_isk(ref) && !irt_isphi(irr->t)) {\r\n\t    irt_setphi(irr->t);\r\n\t    if (nphi >= LJ_MAX_PHI)\r\n\t      lj_trace_err(J, LJ_TRERR_PHIOV);\r\n\t    phi[nphi++] = (IRRef1)ref;\r\n\t  }\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  if (!irt_isguard(J->guardemit))  /* Drop redundant snapshot. */\r\n    J->cur.nsnapmap = (uint16_t)J->cur.snap[--J->cur.nsnap].mapofs;\r\n  lua_assert(J->cur.nsnapmap <= J->sizesnapmap);\r\n  *psentinel = J->cur.snapmap[J->cur.snap[0].nent];  /* Restore PC. */\r\n\r\n  loop_emit_phi(J, subst, phi, nphi, onsnap);\r\n}\r\n\r\n/* Undo any partial changes made by the loop optimization. */\r\nstatic void loop_undo(jit_State *J, IRRef ins, SnapNo nsnap, MSize nsnapmap)\r\n{\r\n  ptrdiff_t i;\r\n  SnapShot *snap = &J->cur.snap[nsnap-1];\r\n  SnapEntry *map = J->cur.snapmap;\r\n  map[snap->mapofs + snap->nent] = map[J->cur.snap[0].nent];  /* Restore PC. */\r\n  J->cur.nsnapmap = (uint16_t)nsnapmap;\r\n  J->cur.nsnap = nsnap;\r\n  J->guardemit.irt = 0;\r\n  lj_ir_rollback(J, ins);\r\n  for (i = 0; i < BPROP_SLOTS; i++) {  /* Remove backprop. cache entries. */\r\n    BPropEntry *bp = &J->bpropcache[i];\r\n    if (bp->val >= ins)\r\n      bp->key = 0;\r\n  }\r\n  for (ins--; ins >= REF_FIRST; ins--) {  /* Remove flags. */\r\n    IRIns *ir = IR(ins);\r\n    irt_clearphi(ir->t);\r\n    irt_clearmark(ir->t);\r\n  }\r\n}\r\n\r\n/* Protected callback for loop optimization. */\r\nstatic TValue *cploop_opt(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  UNUSED(L); UNUSED(dummy);\r\n  loop_unroll((LoopState *)ud);\r\n  return NULL;\r\n}\r\n\r\n/* Loop optimization. */\r\nint lj_opt_loop(jit_State *J)\r\n{\r\n  IRRef nins = J->cur.nins;\r\n  SnapNo nsnap = J->cur.nsnap;\r\n  MSize nsnapmap = J->cur.nsnapmap;\r\n  LoopState lps;\r\n  int errcode;\r\n  lps.J = J;\r\n  lps.subst = NULL;\r\n  lps.sizesubst = 0;\r\n  errcode = lj_vm_cpcall(J->L, NULL, &lps, cploop_opt);\r\n  lj_mem_freevec(J2G(J), lps.subst, lps.sizesubst, IRRef1);\r\n  if (LJ_UNLIKELY(errcode)) {\r\n    lua_State *L = J->L;\r\n    if (errcode == LUA_ERRRUN && tvisnumber(L->top-1)) {  /* Trace error? */\r\n      int32_t e = numberVint(L->top-1);\r\n      switch ((TraceError)e) {\r\n      case LJ_TRERR_TYPEINS:  /* Type instability. */\r\n      case LJ_TRERR_GFAIL:  /* Guard would always fail. */\r\n\t/* Unrolling via recording fixes many cases, e.g. a flipped boolean. */\r\n\tif (--J->instunroll < 0)  /* But do not unroll forever. */\r\n\t  break;\r\n\tL->top--;  /* Remove error object. */\r\n\tloop_undo(J, nins, nsnap, nsnapmap);\r\n\treturn 1;  /* Loop optimization failed, continue recording. */\r\n      default:\r\n\tbreak;\r\n      }\r\n    }\r\n    lj_err_throw(L, errcode);  /* Propagate all other errors. */\r\n  }\r\n  return 0;  /* Loop optimization is ok. */\r\n}\r\n\r\n#undef IR\r\n#undef emitir\r\n#undef emitir_raw\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_mem.c",
    "content": "/*\r\n** Memory access optimizations.\r\n** AA: Alias Analysis using high-level semantic disambiguation.\r\n** FWD: Load Forwarding (L2L) + Store Forwarding (S2L).\r\n** DSE: Dead-Store Elimination.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_mem_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_tab.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_ircall.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t(&J->fold.ins)\r\n#define fleft\t\t(&J->fold.left)\r\n#define fright\t\t(&J->fold.right)\r\n\r\n/*\r\n** Caveat #1: return value is not always a TRef -- only use with tref_ref().\r\n** Caveat #2: FWD relies on active CSE for xREF operands -- see lj_opt_fold().\r\n*/\r\n\r\n/* Return values from alias analysis. */\r\ntypedef enum {\r\n  ALIAS_NO,\t/* The two refs CANNOT alias (exact). */\r\n  ALIAS_MAY,\t/* The two refs MAY alias (inexact). */\r\n  ALIAS_MUST\t/* The two refs MUST alias (exact). */\r\n} AliasRet;\r\n\r\n/* -- ALOAD/HLOAD forwarding and ASTORE/HSTORE elimination ---------------- */\r\n\r\n/* Simplified escape analysis: check for intervening stores. */\r\nstatic AliasRet aa_escape(jit_State *J, IRIns *ir, IRIns *stop)\r\n{\r\n  IRRef ref = (IRRef)(ir - J->cur.ir);  /* The ref that might be stored. */\r\n  for (ir++; ir < stop; ir++)\r\n    if (ir->op2 == ref &&\r\n\t(ir->o == IR_ASTORE || ir->o == IR_HSTORE ||\r\n\t ir->o == IR_USTORE || ir->o == IR_FSTORE))\r\n      return ALIAS_MAY;  /* Reference was stored and might alias. */\r\n  return ALIAS_NO;  /* Reference was not stored. */\r\n}\r\n\r\n/* Alias analysis for two different table references. */\r\nstatic AliasRet aa_table(jit_State *J, IRRef ta, IRRef tb)\r\n{\r\n  IRIns *taba = IR(ta), *tabb = IR(tb);\r\n  int newa, newb;\r\n  lua_assert(ta != tb);\r\n  lua_assert(irt_istab(taba->t) && irt_istab(tabb->t));\r\n  /* Disambiguate new allocations. */\r\n  newa = (taba->o == IR_TNEW || taba->o == IR_TDUP);\r\n  newb = (tabb->o == IR_TNEW || tabb->o == IR_TDUP);\r\n  if (newa && newb)\r\n    return ALIAS_NO;  /* Two different allocations never alias. */\r\n  if (newb) {  /* At least one allocation? */\r\n    IRIns *tmp = taba; taba = tabb; tabb = tmp;\r\n  } else if (!newa) {\r\n    return ALIAS_MAY;  /* Anything else: we just don't know. */\r\n  }\r\n  return aa_escape(J, taba, tabb);\r\n}\r\n\r\n/* Alias analysis for array and hash access using key-based disambiguation. */\r\nstatic AliasRet aa_ahref(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  IRRef ka = refa->op2;\r\n  IRRef kb = refb->op2;\r\n  IRIns *keya, *keyb;\r\n  IRRef ta, tb;\r\n  if (refa == refb)\r\n    return ALIAS_MUST;  /* Shortcut for same refs. */\r\n  keya = IR(ka);\r\n  if (keya->o == IR_KSLOT) { ka = keya->op1; keya = IR(ka); }\r\n  keyb = IR(kb);\r\n  if (keyb->o == IR_KSLOT) { kb = keyb->op1; keyb = IR(kb); }\r\n  ta = (refa->o==IR_HREFK || refa->o==IR_AREF) ? IR(refa->op1)->op1 : refa->op1;\r\n  tb = (refb->o==IR_HREFK || refb->o==IR_AREF) ? IR(refb->op1)->op1 : refb->op1;\r\n  if (ka == kb) {\r\n    /* Same key. Check for same table with different ref (NEWREF vs. HREF). */\r\n    if (ta == tb)\r\n      return ALIAS_MUST;  /* Same key, same table. */\r\n    else\r\n      return aa_table(J, ta, tb);  /* Same key, possibly different table. */\r\n  }\r\n  if (irref_isk(ka) && irref_isk(kb))\r\n    return ALIAS_NO;  /* Different constant keys. */\r\n  if (refa->o == IR_AREF) {\r\n    /* Disambiguate array references based on index arithmetic. */\r\n    int32_t ofsa = 0, ofsb = 0;\r\n    IRRef basea = ka, baseb = kb;\r\n    lua_assert(refb->o == IR_AREF);\r\n    /* Gather base and offset from t[base] or t[base+-ofs]. */\r\n    if (keya->o == IR_ADD && irref_isk(keya->op2)) {\r\n      basea = keya->op1;\r\n      ofsa = IR(keya->op2)->i;\r\n      if (basea == kb && ofsa != 0)\r\n\treturn ALIAS_NO;  /* t[base+-ofs] vs. t[base]. */\r\n    }\r\n    if (keyb->o == IR_ADD && irref_isk(keyb->op2)) {\r\n      baseb = keyb->op1;\r\n      ofsb = IR(keyb->op2)->i;\r\n      if (ka == baseb && ofsb != 0)\r\n\treturn ALIAS_NO;  /* t[base] vs. t[base+-ofs]. */\r\n    }\r\n    if (basea == baseb && ofsa != ofsb)\r\n      return ALIAS_NO;  /* t[base+-o1] vs. t[base+-o2] and o1 != o2. */\r\n  } else {\r\n    /* Disambiguate hash references based on the type of their keys. */\r\n    lua_assert((refa->o==IR_HREF || refa->o==IR_HREFK || refa->o==IR_NEWREF) &&\r\n\t       (refb->o==IR_HREF || refb->o==IR_HREFK || refb->o==IR_NEWREF));\r\n    if (!irt_sametype(keya->t, keyb->t))\r\n      return ALIAS_NO;  /* Different key types. */\r\n  }\r\n  if (ta == tb)\r\n    return ALIAS_MAY;  /* Same table, cannot disambiguate keys. */\r\n  else\r\n    return aa_table(J, ta, tb);  /* Try to disambiguate tables. */\r\n}\r\n\r\n/* Array and hash load forwarding. */\r\nstatic TRef fwd_ahload(jit_State *J, IRRef xref)\r\n{\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[fins->o+IRDELTA_L2S];\r\n  while (ref > xref) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_ahref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* No conflicting store (yet): const-fold loads from allocations. */\r\n  {\r\n    IRIns *ir = (xr->o == IR_HREFK || xr->o == IR_AREF) ? IR(xr->op1) : xr;\r\n    IRRef tab = ir->op1;\r\n    ir = IR(tab);\r\n    if (ir->o == IR_TNEW || (ir->o == IR_TDUP && irref_isk(xr->op2))) {\r\n      /* A NEWREF with a number key may end up pointing to the array part.\r\n      ** But it's referenced from HSTORE and not found in the ASTORE chain.\r\n      ** For now simply consider this a conflict without forwarding anything.\r\n      */\r\n      if (xr->o == IR_AREF) {\r\n\tIRRef ref2 = J->chain[IR_NEWREF];\r\n\twhile (ref2 > tab) {\r\n\t  IRIns *newref = IR(ref2);\r\n\t  if (irt_isnum(IR(newref->op2)->t))\r\n\t    goto cselim;\r\n\t  ref2 = newref->prev;\r\n\t}\r\n      }\r\n      /* NEWREF inhibits CSE for HREF, and dependent FLOADs from HREFK/AREF.\r\n      ** But the above search for conflicting stores was limited by xref.\r\n      ** So continue searching, limited by the TNEW/TDUP. Store forwarding\r\n      ** is ok, too. A conflict does NOT limit the search for a matching load.\r\n      */\r\n      while (ref > tab) {\r\n\tIRIns *store = IR(ref);\r\n\tswitch (aa_ahref(J, xr, IR(store->op1))) {\r\n\tcase ALIAS_NO:   break;  /* Continue searching. */\r\n\tcase ALIAS_MAY:  goto cselim;  /* Conflicting store. */\r\n\tcase ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n\t}\r\n\tref = store->prev;\r\n      }\r\n      lua_assert(ir->o != IR_TNEW || irt_isnil(fins->t));\r\n      if (irt_ispri(fins->t)) {\r\n\treturn TREF_PRI(irt_type(fins->t));\r\n      } else if (irt_isnum(fins->t) || (LJ_DUALNUM && irt_isint(fins->t)) ||\r\n\t\t irt_isstr(fins->t)) {\r\n\tTValue keyv;\r\n\tcTValue *tv;\r\n\tIRIns *key = IR(xr->op2);\r\n\tif (key->o == IR_KSLOT) key = IR(key->op1);\r\n\tlj_ir_kvalue(J->L, &keyv, key);\r\n\ttv = lj_tab_get(J->L, ir_ktab(IR(ir->op1)), &keyv);\r\n\tlua_assert(itype2irt(tv) == irt_type(fins->t));\r\n\tif (irt_isnum(fins->t))\r\n\t  return lj_ir_knum_u64(J, tv->u64);\r\n\telse if (LJ_DUALNUM && irt_isint(fins->t))\r\n\t  return lj_ir_kint(J, intV(tv));\r\n\telse\r\n\t  return lj_ir_kstr(J, strV(tv));\r\n      }\r\n      /* Othwerwise: don't intern as a constant. */\r\n    }\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  ref = J->chain[fins->o];\r\n  while (ref > lim) {\r\n    IRIns *load = IR(ref);\r\n    if (load->op1 == xref)\r\n      return ref;  /* Load forwarding. */\r\n    ref = load->prev;\r\n  }\r\n  return 0;  /* Conflict or no match. */\r\n}\r\n\r\n/* Reassociate ALOAD across PHIs to handle t[i-1] forwarding case. */\r\nstatic TRef fwd_aload_reassoc(jit_State *J)\r\n{\r\n  IRIns *irx = IR(fins->op1);\r\n  IRIns *key = IR(irx->op2);\r\n  if (key->o == IR_ADD && irref_isk(key->op2)) {\r\n    IRIns *add2 = IR(key->op1);\r\n    if (add2->o == IR_ADD && irref_isk(add2->op2) &&\r\n\tIR(key->op2)->i == -IR(add2->op2)->i) {\r\n      IRRef ref = J->chain[IR_AREF];\r\n      IRRef lim = add2->op1;\r\n      if (irx->op1 > lim) lim = irx->op1;\r\n      while (ref > lim) {\r\n\tIRIns *ir = IR(ref);\r\n\tif (ir->op1 == irx->op1 && ir->op2 == add2->op1)\r\n\t  return fwd_ahload(J, ref);\r\n\tref = ir->prev;\r\n      }\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* ALOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_aload(jit_State *J)\r\n{\r\n  IRRef ref;\r\n  if ((ref = fwd_ahload(J, fins->op1)) ||\r\n      (ref = fwd_aload_reassoc(J)))\r\n    return ref;\r\n  return EMITFOLD;\r\n}\r\n\r\n/* HLOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_hload(jit_State *J)\r\n{\r\n  IRRef ref = fwd_ahload(J, fins->op1);\r\n  if (ref)\r\n    return ref;\r\n  return EMITFOLD;\r\n}\r\n\r\n/* HREFK forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_hrefk(jit_State *J)\r\n{\r\n  IRRef tab = fleft->op1;\r\n  IRRef ref = J->chain[IR_NEWREF];\r\n  while (ref > tab) {\r\n    IRIns *newref = IR(ref);\r\n    if (tab == newref->op1) {\r\n      if (fright->op1 == newref->op2)\r\n\treturn ref;  /* Forward from NEWREF. */\r\n      else\r\n\tgoto docse;\r\n    } else if (aa_table(J, tab, newref->op1) != ALIAS_NO) {\r\n      goto docse;\r\n    }\r\n    ref = newref->prev;\r\n  }\r\n  /* No conflicting NEWREF: key location unchanged for HREFK of TDUP. */\r\n  if (IR(tab)->o == IR_TDUP)\r\n    fins->t.irt &= ~IRT_GUARD;  /* Drop HREFK guard. */\r\ndocse:\r\n  return CSEFOLD;\r\n}\r\n\r\n/* Check whether HREF of TNEW/TDUP can be folded to niltv. */\r\nint LJ_FASTCALL lj_opt_fwd_href_nokey(jit_State *J)\r\n{\r\n  IRRef lim = fins->op1;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* The key for an ASTORE may end up in the hash part after a NEWREF. */\r\n  if (irt_isnum(fright->t) && J->chain[IR_NEWREF] > lim) {\r\n    ref = J->chain[IR_ASTORE];\r\n    while (ref > lim) {\r\n      if (ref < J->chain[IR_NEWREF])\r\n\treturn 0;  /* Conflict. */\r\n      ref = IR(ref)->prev;\r\n    }\r\n  }\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_HSTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    if (aa_ahref(J, fins, IR(store->op1)) != ALIAS_NO)\r\n      return 0;  /* Conflict. */\r\n    ref = store->prev;\r\n  }\r\n\r\n  return 1;  /* No conflict. Can fold to niltv. */\r\n}\r\n\r\n/* Check whether there's no aliasing table.clear. */\r\nstatic int fwd_aa_tab_clear(jit_State *J, IRRef lim, IRRef ta)\r\n{\r\n  IRRef ref = J->chain[IR_CALLS];\r\n  while (ref > lim) {\r\n    IRIns *calls = IR(ref);\r\n    if (calls->op2 == IRCALL_lj_tab_clear &&\r\n\t(ta == calls->op1 || aa_table(J, ta, calls->op1) != ALIAS_NO))\r\n      return 0;  /* Conflict. */\r\n    ref = calls->prev;\r\n  }\r\n  return 1;  /* No conflict. Can safely FOLD/CSE. */\r\n}\r\n\r\n/* Check whether there's no aliasing NEWREF/table.clear for the left operand. */\r\nint LJ_FASTCALL lj_opt_fwd_tptr(jit_State *J, IRRef lim)\r\n{\r\n  IRRef ta = fins->op1;\r\n  IRRef ref = J->chain[IR_NEWREF];\r\n  while (ref > lim) {\r\n    IRIns *newref = IR(ref);\r\n    if (ta == newref->op1 || aa_table(J, ta, newref->op1) != ALIAS_NO)\r\n      return 0;  /* Conflict. */\r\n    ref = newref->prev;\r\n  }\r\n  return fwd_aa_tab_clear(J, lim, ta);\r\n}\r\n\r\n/* ASTORE/HSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_ahstore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;  /* xREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(xref);\r\n  IRRef1 *refp = &J->chain[fins->o];\r\n  IRRef ref = *refp;\r\n  while (ref > xref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_ahref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\t/* Store to MAYBE the same location. */\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\t/* Store to the same location. */\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards (includes conflicting loads). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || ir->o == IR_CALLL)\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- ULOAD forwarding ---------------------------------------------------- */\r\n\r\n/* The current alias analysis for upvalues is very simplistic. It only\r\n** disambiguates between the unique upvalues of the same function.\r\n** This is good enough for now, since most upvalues are read-only.\r\n**\r\n** A more precise analysis would be feasible with the help of the parser:\r\n** generate a unique key for every upvalue, even across all prototypes.\r\n** Lacking a realistic use-case, it's unclear whether this is beneficial.\r\n*/\r\nstatic AliasRet aa_uref(IRIns *refa, IRIns *refb)\r\n{\r\n  if (refa->o != refb->o)\r\n    return ALIAS_NO;  /* Different UREFx type. */\r\n  if (refa->op1 == refb->op1) {  /* Same function. */\r\n    if (refa->op2 == refb->op2)\r\n      return ALIAS_MUST;  /* Same function, same upvalue idx. */\r\n    else\r\n      return ALIAS_NO;  /* Same function, different upvalue idx. */\r\n  } else {  /* Different functions, check disambiguation hash values. */\r\n    if (((refa->op2 ^ refb->op2) & 0xff))\r\n      return ALIAS_NO;  /* Upvalues with different hash values cannot alias. */\r\n    else\r\n      return ALIAS_MAY;  /* No conclusion can be drawn for same hash value. */\r\n  }\r\n}\r\n\r\n/* ULOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_uload(jit_State *J)\r\n{\r\n  IRRef uref = fins->op1;\r\n  IRRef lim = REF_BASE;  /* Search limit. */\r\n  IRIns *xr = IR(uref);\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_USTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_uref(xr, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n\r\n  ref = J->chain[IR_ULOAD];\r\n  while (ref > lim) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->op1 == uref ||\r\n\t(IR(ir->op1)->op12 == IR(uref)->op12 && IR(ir->op1)->o == IR(uref)->o))\r\n      return ref;  /* Match for identical or equal UREFx (non-CSEable UREFO). */\r\n    ref = ir->prev;\r\n  }\r\n  return lj_ir_emit(J);\r\n}\r\n\r\n/* USTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_ustore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;  /* xREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(xref);\r\n  IRRef1 *refp = &J->chain[IR_USTORE];\r\n  IRRef ref = *refp;\r\n  while (ref > xref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_uref(xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\t/* Store to MAYBE the same location. */\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\t/* Store to the same location. */\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards (includes conflicting loads). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t))\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\tif (ref+1 < J->cur.nins &&\r\n\t    store[1].o == IR_OBAR && store[1].op1 == xref) {\r\n\t  IRRef1 *bp = &J->chain[IR_OBAR];\r\n\t  IRIns *obar;\r\n\t  for (obar = IR(*bp); *bp > ref+1; obar = IR(*bp))\r\n\t    bp = &obar->prev;\r\n\t  /* Remove OBAR, too. */\r\n\t  *bp = obar->prev;\r\n\t  obar->o = IR_NOP;\r\n\t  obar->t.irt = IRT_NIL;\r\n\t  obar->op1 = obar->op2 = 0;\r\n\t  obar->prev = 0;\r\n\t}\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- FLOAD forwarding and FSTORE elimination ----------------------------- */\r\n\r\n/* Alias analysis for field access.\r\n** Field loads are cheap and field stores are rare.\r\n** Simple disambiguation based on field types is good enough.\r\n*/\r\nstatic AliasRet aa_fref(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  if (refa->op2 != refb->op2)\r\n    return ALIAS_NO;  /* Different fields. */\r\n  if (refa->op1 == refb->op1)\r\n    return ALIAS_MUST;  /* Same field, same object. */\r\n  else if (refa->op2 >= IRFL_TAB_META && refa->op2 <= IRFL_TAB_NOMM)\r\n    return aa_table(J, refa->op1, refb->op1);  /* Disambiguate tables. */\r\n  else\r\n    return ALIAS_MAY;  /* Same field, possibly different object. */\r\n}\r\n\r\n/* Only the loads for mutable fields end up here (see FOLD). */\r\nTRef LJ_FASTCALL lj_opt_fwd_fload(jit_State *J)\r\n{\r\n  IRRef oref = fins->op1;  /* Object reference. */\r\n  IRRef fid = fins->op2;  /* Field ID. */\r\n  IRRef lim = oref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_FSTORE];\r\n  while (ref > oref) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_fref(J, fins, IR(store->op1))) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST: return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* No conflicting store: const-fold field loads from allocations. */\r\n  if (fid == IRFL_TAB_META) {\r\n    IRIns *ir = IR(oref);\r\n    if (ir->o == IR_TNEW || ir->o == IR_TDUP)\r\n      return lj_ir_knull(J, IRT_TAB);\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  return lj_opt_cselim(J, lim);\r\n}\r\n\r\n/* FSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_fstore(jit_State *J)\r\n{\r\n  IRRef fref = fins->op1;  /* FREF reference. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRIns *xr = IR(fref);\r\n  IRRef1 *refp = &J->chain[IR_FSTORE];\r\n  IRRef ref = *refp;\r\n  while (ref > fref) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_fref(J, xr, IR(store->op1))) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards or conflicting loads. */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || (ir->o == IR_FLOAD && ir->op2 == xr->op2))\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- XLOAD forwarding and XSTORE elimination ----------------------------- */\r\n\r\n/* Find cdata allocation for a reference (if any). */\r\nstatic IRIns *aa_findcnew(jit_State *J, IRIns *ir)\r\n{\r\n  while (ir->o == IR_ADD) {\r\n    if (!irref_isk(ir->op1)) {\r\n      IRIns *ir1 = aa_findcnew(J, IR(ir->op1));  /* Left-recursion. */\r\n      if (ir1) return ir1;\r\n    }\r\n    if (irref_isk(ir->op2)) return NULL;\r\n    ir = IR(ir->op2);  /* Flatten right-recursion. */\r\n  }\r\n  return ir->o == IR_CNEW ? ir : NULL;\r\n}\r\n\r\n/* Alias analysis for two cdata allocations. */\r\nstatic AliasRet aa_cnew(jit_State *J, IRIns *refa, IRIns *refb)\r\n{\r\n  IRIns *cnewa = aa_findcnew(J, refa);\r\n  IRIns *cnewb = aa_findcnew(J, refb);\r\n  if (cnewa == cnewb)\r\n    return ALIAS_MAY;  /* Same allocation or neither is an allocation. */\r\n  if (cnewa && cnewb)\r\n    return ALIAS_NO;  /* Two different allocations never alias. */\r\n  if (cnewb) { cnewa = cnewb; refb = refa; }\r\n  return aa_escape(J, cnewa, refb);\r\n}\r\n\r\n/* Alias analysis for XLOAD/XSTORE. */\r\nstatic AliasRet aa_xref(jit_State *J, IRIns *refa, IRIns *xa, IRIns *xb)\r\n{\r\n  ptrdiff_t ofsa = 0, ofsb = 0;\r\n  IRIns *refb = IR(xb->op1);\r\n  IRIns *basea = refa, *baseb = refb;\r\n  if (refa == refb && irt_sametype(xa->t, xb->t))\r\n    return ALIAS_MUST;  /* Shortcut for same refs with identical type. */\r\n  /* Offset-based disambiguation. */\r\n  if (refa->o == IR_ADD && irref_isk(refa->op2)) {\r\n    IRIns *irk = IR(refa->op2);\r\n    basea = IR(refa->op1);\r\n    ofsa = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t    (ptrdiff_t)irk->i;\r\n  }\r\n  if (refb->o == IR_ADD && irref_isk(refb->op2)) {\r\n    IRIns *irk = IR(refb->op2);\r\n    baseb = IR(refb->op1);\r\n    ofsb = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t    (ptrdiff_t)irk->i;\r\n  }\r\n  /* Treat constified pointers like base vs. base+offset. */\r\n  if (basea->o == IR_KPTR && baseb->o == IR_KPTR) {\r\n    ofsb += (char *)ir_kptr(baseb) - (char *)ir_kptr(basea);\r\n    baseb = basea;\r\n  }\r\n  /* This implements (very) strict aliasing rules.\r\n  ** Different types do NOT alias, except for differences in signedness.\r\n  ** Type punning through unions is allowed (but forces a reload).\r\n  */\r\n  if (basea == baseb) {\r\n    ptrdiff_t sza = irt_size(xa->t), szb = irt_size(xb->t);\r\n    if (ofsa == ofsb) {\r\n      if (sza == szb && irt_isfp(xa->t) == irt_isfp(xb->t))\r\n\treturn ALIAS_MUST;  /* Same-sized, same-kind. May need to convert. */\r\n    } else if (ofsa + sza <= ofsb || ofsb + szb <= ofsa) {\r\n      return ALIAS_NO;  /* Non-overlapping base+-o1 vs. base+-o2. */\r\n    }\r\n    /* NYI: extract, extend or reinterpret bits (int <-> fp). */\r\n    return ALIAS_MAY;  /* Overlapping or type punning: force reload. */\r\n  }\r\n  if (!irt_sametype(xa->t, xb->t) &&\r\n      !(irt_typerange(xa->t, IRT_I8, IRT_U64) &&\r\n\t((xa->t.irt - IRT_I8) ^ (xb->t.irt - IRT_I8)) == 1))\r\n    return ALIAS_NO;\r\n  /* NYI: structural disambiguation. */\r\n  return aa_cnew(J, basea, baseb);  /* Try to disambiguate allocations. */\r\n}\r\n\r\n/* Return CSEd reference or 0. Caveat: swaps lower ref to the right! */\r\nstatic IRRef reassoc_trycse(jit_State *J, IROp op, IRRef op1, IRRef op2)\r\n{\r\n  IRRef ref = J->chain[op];\r\n  IRRef lim = op1;\r\n  if (op2 > lim) { lim = op2; op2 = op1; op1 = lim; }\r\n  while (ref > lim) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->op1 == op1 && ir->op2 == op2)\r\n      return ref;\r\n    ref = ir->prev;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Reassociate index references. */\r\nstatic IRRef reassoc_xref(jit_State *J, IRIns *ir)\r\n{\r\n  ptrdiff_t ofs = 0;\r\n  if (ir->o == IR_ADD && irref_isk(ir->op2)) {  /* Get constant offset. */\r\n    IRIns *irk = IR(ir->op2);\r\n    ofs = (LJ_64 && irk->o == IR_KINT64) ? (ptrdiff_t)ir_k64(irk)->u64 :\r\n\t\t\t\t\t   (ptrdiff_t)irk->i;\r\n    ir = IR(ir->op1);\r\n  }\r\n  if (ir->o == IR_ADD) {  /* Add of base + index. */\r\n    /* Index ref > base ref for loop-carried dependences. Only check op1. */\r\n    IRIns *ir2, *ir1 = IR(ir->op1);\r\n    int32_t shift = 0;\r\n    IRRef idxref;\r\n    /* Determine index shifts. Don't bother with IR_MUL here. */\r\n    if (ir1->o == IR_BSHL && irref_isk(ir1->op2))\r\n      shift = IR(ir1->op2)->i;\r\n    else if (ir1->o == IR_ADD && ir1->op1 == ir1->op2)\r\n      shift = 1;\r\n    else\r\n      ir1 = ir;\r\n    ir2 = IR(ir1->op1);\r\n    /* A non-reassociated add. Must be a loop-carried dependence. */\r\n    if (ir2->o == IR_ADD && irt_isint(ir2->t) && irref_isk(ir2->op2))\r\n      ofs += (ptrdiff_t)IR(ir2->op2)->i << shift;\r\n    else\r\n      return 0;\r\n    idxref = ir2->op1;\r\n    /* Try to CSE the reassociated chain. Give up if not found. */\r\n    if (ir1 != ir &&\r\n\t!(idxref = reassoc_trycse(J, ir1->o, idxref,\r\n\t\t\t\t  ir1->o == IR_BSHL ? ir1->op2 : idxref)))\r\n      return 0;\r\n    if (!(idxref = reassoc_trycse(J, IR_ADD, idxref, ir->op2)))\r\n      return 0;\r\n    if (ofs != 0) {\r\n      IRRef refk = tref_ref(lj_ir_kintp(J, ofs));\r\n      if (!(idxref = reassoc_trycse(J, IR_ADD, idxref, refk)))\r\n\treturn 0;\r\n    }\r\n    return idxref;  /* Success, found a reassociated index reference. Phew. */\r\n  }\r\n  return 0;  /* Failure. */\r\n}\r\n\r\n/* XLOAD forwarding. */\r\nTRef LJ_FASTCALL lj_opt_fwd_xload(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  if ((fins->op2 & IRXLOAD_READONLY))\r\n    goto cselim;\r\n  if ((fins->op2 & IRXLOAD_VOLATILE))\r\n    goto doemit;\r\n\r\n  /* Search for conflicting stores. */\r\n  ref = J->chain[IR_XSTORE];\r\nretry:\r\n  if (J->chain[IR_CALLXS] > lim) lim = J->chain[IR_CALLXS];\r\n  if (J->chain[IR_XBAR] > lim) lim = J->chain[IR_XBAR];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    switch (aa_xref(J, xr, fins, store)) {\r\n    case ALIAS_NO:   break;  /* Continue searching. */\r\n    case ALIAS_MAY:  lim = ref; goto cselim;  /* Limit search for load. */\r\n    case ALIAS_MUST:\r\n      /* Emit conversion if the loaded type doesn't match the forwarded type. */\r\n      if (!irt_sametype(fins->t, IR(store->op2)->t)) {\r\n\tIRType dt = irt_type(fins->t), st = irt_type(IR(store->op2)->t);\r\n\tif (dt == IRT_I8 || dt == IRT_I16) {  /* Trunc + sign-extend. */\r\n\t  st = dt | IRCONV_SEXT;\r\n\t  dt = IRT_INT;\r\n\t} else if (dt == IRT_U8 || dt == IRT_U16) {  /* Trunc + zero-extend. */\r\n\t  st = dt;\r\n\t  dt = IRT_INT;\r\n\t}\r\n\tfins->ot = IRT(IR_CONV, dt);\r\n\tfins->op1 = store->op2;\r\n\tfins->op2 = (dt<<5)|st;\r\n\treturn RETRYFOLD;\r\n      }\r\n      return store->op2;  /* Store forwarding. */\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\ncselim:\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  ref = J->chain[IR_XLOAD];\r\n  while (ref > lim) {\r\n    /* CSE for XLOAD depends on the type, but not on the IRXLOAD_* flags. */\r\n    if (IR(ref)->op1 == xref && irt_sametype(IR(ref)->t, fins->t))\r\n      return ref;\r\n    ref = IR(ref)->prev;\r\n  }\r\n\r\n  /* Reassociate XLOAD across PHIs to handle a[i-1] forwarding case. */\r\n  if (!(fins->op2 & IRXLOAD_READONLY) && J->chain[IR_LOOP] &&\r\n      xref == fins->op1 && (xref = reassoc_xref(J, xr)) != 0) {\r\n    ref = J->chain[IR_XSTORE];\r\n    while (ref > lim)  /* Skip stores that have already been checked. */\r\n      ref = IR(ref)->prev;\r\n    lim = xref;\r\n    xr = IR(xref);\r\n    goto retry;  /* Retry with the reassociated reference. */\r\n  }\r\ndoemit:\r\n  return EMITFOLD;\r\n}\r\n\r\n/* XSTORE elimination. */\r\nTRef LJ_FASTCALL lj_opt_dse_xstore(jit_State *J)\r\n{\r\n  IRRef xref = fins->op1;\r\n  IRIns *xr = IR(xref);\r\n  IRRef lim = xref;  /* Search limit. */\r\n  IRRef val = fins->op2;  /* Stored value reference. */\r\n  IRRef1 *refp = &J->chain[IR_XSTORE];\r\n  IRRef ref = *refp;\r\n  if (J->chain[IR_CALLXS] > lim) lim = J->chain[IR_CALLXS];\r\n  if (J->chain[IR_XBAR] > lim) lim = J->chain[IR_XBAR];\r\n  if (J->chain[IR_XSNEW] > lim) lim = J->chain[IR_XSNEW];\r\n  while (ref > lim) {  /* Search for redundant or conflicting stores. */\r\n    IRIns *store = IR(ref);\r\n    switch (aa_xref(J, xr, fins, store)) {\r\n    case ALIAS_NO:\r\n      break;  /* Continue searching. */\r\n    case ALIAS_MAY:\r\n      if (store->op2 != val)  /* Conflict if the value is different. */\r\n\tgoto doemit;\r\n      break;  /* Otherwise continue searching. */\r\n    case ALIAS_MUST:\r\n      if (store->op2 == val)  /* Same value: drop the new store. */\r\n\treturn DROPFOLD;\r\n      /* Different value: try to eliminate the redundant store. */\r\n      if (ref > J->chain[IR_LOOP]) {  /* Quick check to avoid crossing LOOP. */\r\n\tIRIns *ir;\r\n\t/* Check for any intervening guards or any XLOADs (no AA performed). */\r\n\tfor (ir = IR(J->cur.nins-1); ir > store; ir--)\r\n\t  if (irt_isguard(ir->t) || ir->o == IR_XLOAD)\r\n\t    goto doemit;  /* No elimination possible. */\r\n\t/* Remove redundant store from chain and replace with NOP. */\r\n\t*refp = store->prev;\r\n\tstore->o = IR_NOP;\r\n\tstore->t.irt = IRT_NIL;\r\n\tstore->op1 = store->op2 = 0;\r\n\tstore->prev = 0;\r\n\t/* Now emit the new store instead. */\r\n      }\r\n      goto doemit;\r\n    }\r\n    ref = *(refp = &store->prev);\r\n  }\r\ndoemit:\r\n  return EMITFOLD;  /* Otherwise we have a conflict or simply no match. */\r\n}\r\n\r\n/* -- Forwarding of lj_tab_len -------------------------------------------- */\r\n\r\n/* This is rather simplistic right now, but better than nothing. */\r\nTRef LJ_FASTCALL lj_opt_fwd_tab_len(jit_State *J)\r\n{\r\n  IRRef tab = fins->op1;  /* Table reference. */\r\n  IRRef lim = tab;  /* Search limit. */\r\n  IRRef ref;\r\n\r\n  /* Any ASTORE is a conflict and limits the search. */\r\n  if (J->chain[IR_ASTORE] > lim) lim = J->chain[IR_ASTORE];\r\n\r\n  /* Search for conflicting HSTORE with numeric key. */\r\n  ref = J->chain[IR_HSTORE];\r\n  while (ref > lim) {\r\n    IRIns *store = IR(ref);\r\n    IRIns *href = IR(store->op1);\r\n    IRIns *key = IR(href->op2);\r\n    if (irt_isnum(key->o == IR_KSLOT ? IR(key->op1)->t : key->t)) {\r\n      lim = ref;  /* Conflicting store found, limits search for TLEN. */\r\n      break;\r\n    }\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* Search for aliasing table.clear. */\r\n  if (!fwd_aa_tab_clear(J, lim, tab))\r\n    return lj_ir_emit(J);\r\n\r\n  /* Try to find a matching load. Below the conflicting store, if any. */\r\n  return lj_opt_cselim(J, lim);\r\n}\r\n\r\n/* -- ASTORE/HSTORE previous type analysis -------------------------------- */\r\n\r\n/* Check whether the previous value for a table store is non-nil.\r\n** This can be derived either from a previous store or from a previous\r\n** load (because all loads from tables perform a type check).\r\n**\r\n** The result of the analysis can be used to avoid the metatable check\r\n** and the guard against HREF returning niltv. Both of these are cheap,\r\n** so let's not spend too much effort on the analysis.\r\n**\r\n** A result of 1 is exact: previous value CANNOT be nil.\r\n** A result of 0 is inexact: previous value MAY be nil.\r\n*/\r\nint lj_opt_fwd_wasnonnil(jit_State *J, IROpT loadop, IRRef xref)\r\n{\r\n  /* First check stores. */\r\n  IRRef ref = J->chain[loadop+IRDELTA_L2S];\r\n  while (ref > xref) {\r\n    IRIns *store = IR(ref);\r\n    if (store->op1 == xref) {  /* Same xREF. */\r\n      /* A nil store MAY alias, but a non-nil store MUST alias. */\r\n      return !irt_isnil(store->t);\r\n    } else if (irt_isnil(store->t)) {  /* Must check any nil store. */\r\n      IRRef skref = IR(store->op1)->op2;\r\n      IRRef xkref = IR(xref)->op2;\r\n      /* Same key type MAY alias. Need ALOAD check due to multiple int types. */\r\n      if (loadop == IR_ALOAD || irt_sametype(IR(skref)->t, IR(xkref)->t)) {\r\n\tif (skref == xkref || !irref_isk(skref) || !irref_isk(xkref))\r\n\t  return 0;  /* A nil store with same const key or var key MAY alias. */\r\n\t/* Different const keys CANNOT alias. */\r\n      }  /* Different key types CANNOT alias. */\r\n    }  /* Other non-nil stores MAY alias. */\r\n    ref = store->prev;\r\n  }\r\n\r\n  /* Check loads since nothing could be derived from stores. */\r\n  ref = J->chain[loadop];\r\n  while (ref > xref) {\r\n    IRIns *load = IR(ref);\r\n    if (load->op1 == xref) {  /* Same xREF. */\r\n      /* A nil load MAY alias, but a non-nil load MUST alias. */\r\n      return !irt_isnil(load->t);\r\n    }  /* Other non-nil loads MAY alias. */\r\n    ref = load->prev;\r\n  }\r\n  return 0;  /* Nothing derived at all, previous value MAY be nil. */\r\n}\r\n\r\n/* ------------------------------------------------------------------------ */\r\n\r\n#undef IR\r\n#undef fins\r\n#undef fleft\r\n#undef fright\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_narrow.c",
    "content": "/*\r\n** NARROW: Narrowing of numbers to integers (double to int32_t).\r\n** STRIPOV: Stripping of overflow checks.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_narrow_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* Rationale for narrowing optimizations:\r\n**\r\n** Lua has only a single number type and this is a FP double by default.\r\n** Narrowing doubles to integers does not pay off for the interpreter on a\r\n** current-generation x86/x64 machine. Most FP operations need the same\r\n** amount of execution resources as their integer counterparts, except\r\n** with slightly longer latencies. Longer latencies are a non-issue for\r\n** the interpreter, since they are usually hidden by other overhead.\r\n**\r\n** The total CPU execution bandwidth is the sum of the bandwidth of the FP\r\n** and the integer units, because they execute in parallel. The FP units\r\n** have an equal or higher bandwidth than the integer units. Not using\r\n** them means losing execution bandwidth. Moving work away from them to\r\n** the already quite busy integer units is a losing proposition.\r\n**\r\n** The situation for JIT-compiled code is a bit different: the higher code\r\n** density makes the extra latencies much more visible. Tight loops expose\r\n** the latencies for updating the induction variables. Array indexing\r\n** requires narrowing conversions with high latencies and additional\r\n** guards (to check that the index is really an integer). And many common\r\n** optimizations only work on integers.\r\n**\r\n** One solution would be speculative, eager narrowing of all number loads.\r\n** This causes many problems, like losing -0 or the need to resolve type\r\n** mismatches between traces. It also effectively forces the integer type\r\n** to have overflow-checking semantics. This impedes many basic\r\n** optimizations and requires adding overflow checks to all integer\r\n** arithmetic operations (whereas FP arithmetics can do without).\r\n**\r\n** Always replacing an FP op with an integer op plus an overflow check is\r\n** counter-productive on a current-generation super-scalar CPU. Although\r\n** the overflow check branches are highly predictable, they will clog the\r\n** execution port for the branch unit and tie up reorder buffers. This is\r\n** turning a pure data-flow dependency into a different data-flow\r\n** dependency (with slightly lower latency) *plus* a control dependency.\r\n** In general, you don't want to do this since latencies due to data-flow\r\n** dependencies can be well hidden by out-of-order execution.\r\n**\r\n** A better solution is to keep all numbers as FP values and only narrow\r\n** when it's beneficial to do so. LuaJIT uses predictive narrowing for\r\n** induction variables and demand-driven narrowing for index expressions,\r\n** integer arguments and bit operations. Additionally it can eliminate or\r\n** hoist most of the resulting overflow checks. Regular arithmetic\r\n** computations are never narrowed to integers.\r\n**\r\n** The integer type in the IR has convenient wrap-around semantics and\r\n** ignores overflow. Extra operations have been added for\r\n** overflow-checking arithmetic (ADDOV/SUBOV) instead of an extra type.\r\n** Apart from reducing overall complexity of the compiler, this also\r\n** nicely solves the problem where you want to apply algebraic\r\n** simplifications to ADD, but not to ADDOV. And the x86/x64 assembler can\r\n** use lea instead of an add for integer ADD, but not for ADDOV (lea does\r\n** not affect the flags, but it helps to avoid register moves).\r\n**\r\n**\r\n** All of the above has to be reconsidered for architectures with slow FP\r\n** operations or without a hardware FPU. The dual-number mode of LuaJIT\r\n** addresses this issue. Arithmetic operations are performed on integers\r\n** as far as possible and overflow checks are added as needed.\r\n**\r\n** This implies that narrowing for integer arguments and bit operations\r\n** should also strip overflow checks, e.g. replace ADDOV with ADD. The\r\n** original overflow guards are weak and can be eliminated by DCE, if\r\n** there's no other use.\r\n**\r\n** A slight twist is that it's usually beneficial to use overflow-checked\r\n** integer arithmetics if all inputs are already integers. This is the only\r\n** change that affects the single-number mode, too.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n#define fins\t\t\t(&J->fold.ins)\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Elimination of narrowing type conversions --------------------------- */\r\n\r\n/* Narrowing of index expressions and bit operations is demand-driven. The\r\n** trace recorder emits a narrowing type conversion (CONV.int.num or TOBIT)\r\n** in all of these cases (e.g. array indexing or string indexing). FOLD\r\n** already takes care of eliminating simple redundant conversions like\r\n** CONV.int.num(CONV.num.int(x)) ==> x.\r\n**\r\n** But the surrounding code is FP-heavy and arithmetic operations are\r\n** performed on FP numbers (for the single-number mode). Consider a common\r\n** example such as 'x=t[i+1]', with 'i' already an integer (due to induction\r\n** variable narrowing). The index expression would be recorded as\r\n**   CONV.int.num(ADD(CONV.num.int(i), 1))\r\n** which is clearly suboptimal.\r\n**\r\n** One can do better by recursively backpropagating the narrowing type\r\n** conversion across FP arithmetic operations. This turns FP ops into\r\n** their corresponding integer counterparts. Depending on the semantics of\r\n** the conversion they also need to check for overflow. Currently only ADD\r\n** and SUB are supported.\r\n**\r\n** The above example can be rewritten as\r\n**   ADDOV(CONV.int.num(CONV.num.int(i)), 1)\r\n** and then into ADDOV(i, 1) after folding of the conversions. The original\r\n** FP ops remain in the IR and are eliminated by DCE since all references to\r\n** them are gone.\r\n**\r\n** [In dual-number mode the trace recorder already emits ADDOV etc., but\r\n** this can be further reduced. See below.]\r\n**\r\n** Special care has to be taken to avoid narrowing across an operation\r\n** which is potentially operating on non-integral operands. One obvious\r\n** case is when an expression contains a non-integral constant, but ends\r\n** up as an integer index at runtime (like t[x+1.5] with x=0.5).\r\n**\r\n** Operations with two non-constant operands illustrate a similar problem\r\n** (like t[a+b] with a=1.5 and b=2.5). Backpropagation has to stop there,\r\n** unless it can be proven that either operand is integral (e.g. by CSEing\r\n** a previous conversion). As a not-so-obvious corollary this logic also\r\n** applies for a whole expression tree (e.g. t[(a+1)+(b+1)]).\r\n**\r\n** Correctness of the transformation is guaranteed by avoiding to expand\r\n** the tree by adding more conversions than the one we would need to emit\r\n** if not backpropagating. TOBIT employs a more optimistic rule, because\r\n** the conversion has special semantics, designed to make the life of the\r\n** compiler writer easier. ;-)\r\n**\r\n** Using on-the-fly backpropagation of an expression tree doesn't work\r\n** because it's unknown whether the transform is correct until the end.\r\n** This either requires IR rollback and cache invalidation for every\r\n** subtree or a two-pass algorithm. The former didn't work out too well,\r\n** so the code now combines a recursive collector with a stack-based\r\n** emitter.\r\n**\r\n** [A recursive backpropagation algorithm with backtracking, employing\r\n** skip-list lookup and round-robin caching, emitting stack operations\r\n** on-the-fly for a stack-based interpreter -- and all of that in a meager\r\n** kilobyte? Yep, compilers are a great treasure chest. Throw away your\r\n** textbooks and read the codebase of a compiler today!]\r\n**\r\n** There's another optimization opportunity for array indexing: it's\r\n** always accompanied by an array bounds-check. The outermost overflow\r\n** check may be delegated to the ABC operation. This works because ABC is\r\n** an unsigned comparison and wrap-around due to overflow creates negative\r\n** numbers.\r\n**\r\n** But this optimization is only valid for constants that cannot overflow\r\n** an int32_t into the range of valid array indexes [0..2^27+1). A check\r\n** for +-2^30 is safe since -2^31 - 2^30 wraps to 2^30 and 2^31-1 + 2^30\r\n** wraps to -2^30-1.\r\n**\r\n** It's also good enough in practice, since e.g. t[i+1] or t[i-10] are\r\n** quite common. So the above example finally ends up as ADD(i, 1)!\r\n**\r\n** Later on, the assembler is able to fuse the whole array reference and\r\n** the ADD into the memory operands of loads and other instructions. This\r\n** is why LuaJIT is able to generate very pretty (and fast) machine code\r\n** for array indexing. And that, my dear, concludes another story about\r\n** one of the hidden secrets of LuaJIT ...\r\n*/\r\n\r\n/* Maximum backpropagation depth and maximum stack size. */\r\n#define NARROW_MAX_BACKPROP\t100\r\n#define NARROW_MAX_STACK\t256\r\n\r\n/* The stack machine has a 32 bit instruction format: [IROpT | IRRef1]\r\n** The lower 16 bits hold a reference (or 0). The upper 16 bits hold\r\n** the IR opcode + type or one of the following special opcodes:\r\n*/\r\nenum {\r\n  NARROW_REF,\t\t/* Push ref. */\r\n  NARROW_CONV,\t\t/* Push conversion of ref. */\r\n  NARROW_SEXT,\t\t/* Push sign-extension of ref. */\r\n  NARROW_INT\t\t/* Push KINT ref. The next code holds an int32_t. */\r\n};\r\n\r\ntypedef uint32_t NarrowIns;\r\n\r\n#define NARROWINS(op, ref)\t(((op) << 16) + (ref))\r\n#define narrow_op(ins)\t\t((IROpT)((ins) >> 16))\r\n#define narrow_ref(ins)\t\t((IRRef1)(ins))\r\n\r\n/* Context used for narrowing of type conversions. */\r\ntypedef struct NarrowConv {\r\n  jit_State *J;\t\t/* JIT compiler state. */\r\n  NarrowIns *sp;\t/* Current stack pointer. */\r\n  NarrowIns *maxsp;\t/* Maximum stack pointer minus redzone. */\r\n  IRRef mode;\t\t/* Conversion mode (IRCONV_*). */\r\n  IRType t;\t\t/* Destination type: IRT_INT or IRT_I64. */\r\n  NarrowIns stack[NARROW_MAX_STACK];  /* Stack holding stack-machine code. */\r\n} NarrowConv;\r\n\r\n/* Lookup a reference in the backpropagation cache. */\r\nstatic BPropEntry *narrow_bpc_get(jit_State *J, IRRef1 key, IRRef mode)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < BPROP_SLOTS; i++) {\r\n    BPropEntry *bp = &J->bpropcache[i];\r\n    /* Stronger checks are ok, too. */\r\n    if (bp->key == key && bp->mode >= mode &&\r\n\t((bp->mode ^ mode) & IRCONV_MODEMASK) == 0)\r\n      return bp;\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Add an entry to the backpropagation cache. */\r\nstatic void narrow_bpc_set(jit_State *J, IRRef1 key, IRRef1 val, IRRef mode)\r\n{\r\n  uint32_t slot = J->bpropslot;\r\n  BPropEntry *bp = &J->bpropcache[slot];\r\n  J->bpropslot = (slot + 1) & (BPROP_SLOTS-1);\r\n  bp->key = key;\r\n  bp->val = val;\r\n  bp->mode = mode;\r\n}\r\n\r\n/* Backpropagate overflow stripping. */\r\nstatic void narrow_stripov_backprop(NarrowConv *nc, IRRef ref, int depth)\r\n{\r\n  jit_State *J = nc->J;\r\n  IRIns *ir = IR(ref);\r\n  if (ir->o == IR_ADDOV || ir->o == IR_SUBOV ||\r\n      (ir->o == IR_MULOV && (nc->mode & IRCONV_CONVMASK) == IRCONV_ANY)) {\r\n    BPropEntry *bp = narrow_bpc_get(nc->J, ref, IRCONV_TOBIT);\r\n    if (bp) {\r\n      ref = bp->val;\r\n    } else if (++depth < NARROW_MAX_BACKPROP && nc->sp < nc->maxsp) {\r\n      NarrowIns *savesp = nc->sp;\r\n      narrow_stripov_backprop(nc, ir->op1, depth);\r\n      if (nc->sp < nc->maxsp) {\r\n\tnarrow_stripov_backprop(nc, ir->op2, depth);\r\n\tif (nc->sp < nc->maxsp) {\r\n\t  *nc->sp++ = NARROWINS(IRT(ir->o - IR_ADDOV + IR_ADD, IRT_INT), ref);\r\n\t  return;\r\n\t}\r\n      }\r\n      nc->sp = savesp;  /* Path too deep, need to backtrack. */\r\n    }\r\n  }\r\n  *nc->sp++ = NARROWINS(NARROW_REF, ref);\r\n}\r\n\r\n/* Backpropagate narrowing conversion. Return number of needed conversions. */\r\nstatic int narrow_conv_backprop(NarrowConv *nc, IRRef ref, int depth)\r\n{\r\n  jit_State *J = nc->J;\r\n  IRIns *ir = IR(ref);\r\n  IRRef cref;\r\n\r\n  if (nc->sp >= nc->maxsp) return 10;  /* Path too deep. */\r\n\r\n  /* Check the easy cases first. */\r\n  if (ir->o == IR_CONV && (ir->op2 & IRCONV_SRCMASK) == IRT_INT) {\r\n    if ((nc->mode & IRCONV_CONVMASK) <= IRCONV_ANY)\r\n      narrow_stripov_backprop(nc, ir->op1, depth+1);\r\n    else\r\n      *nc->sp++ = NARROWINS(NARROW_REF, ir->op1);  /* Undo conversion. */\r\n    if (nc->t == IRT_I64)\r\n      *nc->sp++ = NARROWINS(NARROW_SEXT, 0);  /* Sign-extend integer. */\r\n    return 0;\r\n  } else if (ir->o == IR_KNUM) {  /* Narrow FP constant. */\r\n    lua_Number n = ir_knum(ir)->n;\r\n    if ((nc->mode & IRCONV_CONVMASK) == IRCONV_TOBIT) {\r\n      /* Allows a wider range of constants. */\r\n      int64_t k64 = (int64_t)n;\r\n      if (n == (lua_Number)k64) {  /* Only if const doesn't lose precision. */\r\n\t*nc->sp++ = NARROWINS(NARROW_INT, 0);\r\n\t*nc->sp++ = (NarrowIns)k64;  /* But always truncate to 32 bits. */\r\n\treturn 0;\r\n      }\r\n    } else {\r\n      int32_t k = lj_num2int(n);\r\n      /* Only if constant is a small integer. */\r\n      if (checki16(k) && n == (lua_Number)k) {\r\n\t*nc->sp++ = NARROWINS(NARROW_INT, 0);\r\n\t*nc->sp++ = (NarrowIns)k;\r\n\treturn 0;\r\n      }\r\n    }\r\n    return 10;  /* Never narrow other FP constants (this is rare). */\r\n  }\r\n\r\n  /* Try to CSE the conversion. Stronger checks are ok, too. */\r\n  cref = J->chain[fins->o];\r\n  while (cref > ref) {\r\n    IRIns *cr = IR(cref);\r\n    if (cr->op1 == ref &&\r\n\t(fins->o == IR_TOBIT ||\r\n\t ((cr->op2 & IRCONV_MODEMASK) == (nc->mode & IRCONV_MODEMASK) &&\r\n\t  irt_isguard(cr->t) >= irt_isguard(fins->t)))) {\r\n      *nc->sp++ = NARROWINS(NARROW_REF, cref);\r\n      return 0;  /* Already there, no additional conversion needed. */\r\n    }\r\n    cref = cr->prev;\r\n  }\r\n\r\n  /* Backpropagate across ADD/SUB. */\r\n  if (ir->o == IR_ADD || ir->o == IR_SUB) {\r\n    /* Try cache lookup first. */\r\n    IRRef mode = nc->mode;\r\n    BPropEntry *bp;\r\n    /* Inner conversions need a stronger check. */\r\n    if ((mode & IRCONV_CONVMASK) == IRCONV_INDEX && depth > 0)\r\n      mode += IRCONV_CHECK-IRCONV_INDEX;\r\n    bp = narrow_bpc_get(nc->J, (IRRef1)ref, mode);\r\n    if (bp) {\r\n      *nc->sp++ = NARROWINS(NARROW_REF, bp->val);\r\n      return 0;\r\n    } else if (nc->t == IRT_I64) {\r\n      /* Try sign-extending from an existing (checked) conversion to int. */\r\n      mode = (IRT_INT<<5)|IRT_NUM|IRCONV_INDEX;\r\n      bp = narrow_bpc_get(nc->J, (IRRef1)ref, mode);\r\n      if (bp) {\r\n\t*nc->sp++ = NARROWINS(NARROW_REF, bp->val);\r\n\t*nc->sp++ = NARROWINS(NARROW_SEXT, 0);\r\n\treturn 0;\r\n      }\r\n    }\r\n    if (++depth < NARROW_MAX_BACKPROP && nc->sp < nc->maxsp) {\r\n      NarrowIns *savesp = nc->sp;\r\n      int count = narrow_conv_backprop(nc, ir->op1, depth);\r\n      count += narrow_conv_backprop(nc, ir->op2, depth);\r\n      if (count <= 1) {  /* Limit total number of conversions. */\r\n\t*nc->sp++ = NARROWINS(IRT(ir->o, nc->t), ref);\r\n\treturn count;\r\n      }\r\n      nc->sp = savesp;  /* Too many conversions, need to backtrack. */\r\n    }\r\n  }\r\n\r\n  /* Otherwise add a conversion. */\r\n  *nc->sp++ = NARROWINS(NARROW_CONV, ref);\r\n  return 1;\r\n}\r\n\r\n/* Emit the conversions collected during backpropagation. */\r\nstatic IRRef narrow_conv_emit(jit_State *J, NarrowConv *nc)\r\n{\r\n  /* The fins fields must be saved now -- emitir() overwrites them. */\r\n  IROpT guardot = irt_isguard(fins->t) ? IRTG(IR_ADDOV-IR_ADD, 0) : 0;\r\n  IROpT convot = fins->ot;\r\n  IRRef1 convop2 = fins->op2;\r\n  NarrowIns *next = nc->stack;  /* List of instructions from backpropagation. */\r\n  NarrowIns *last = nc->sp;\r\n  NarrowIns *sp = nc->stack;  /* Recycle the stack to store operands. */\r\n  while (next < last) {  /* Simple stack machine to process the ins. list. */\r\n    NarrowIns ref = *next++;\r\n    IROpT op = narrow_op(ref);\r\n    if (op == NARROW_REF) {\r\n      *sp++ = ref;\r\n    } else if (op == NARROW_CONV) {\r\n      *sp++ = emitir_raw(convot, ref, convop2);  /* Raw emit avoids a loop. */\r\n    } else if (op == NARROW_SEXT) {\r\n      lua_assert(sp >= nc->stack+1);\r\n      sp[-1] = emitir(IRT(IR_CONV, IRT_I64), sp[-1],\r\n\t\t      (IRT_I64<<5)|IRT_INT|IRCONV_SEXT);\r\n    } else if (op == NARROW_INT) {\r\n      lua_assert(next < last);\r\n      *sp++ = nc->t == IRT_I64 ?\r\n\t      lj_ir_kint64(J, (int64_t)(int32_t)*next++) :\r\n\t      lj_ir_kint(J, *next++);\r\n    } else {  /* Regular IROpT. Pops two operands and pushes one result. */\r\n      IRRef mode = nc->mode;\r\n      lua_assert(sp >= nc->stack+2);\r\n      sp--;\r\n      /* Omit some overflow checks for array indexing. See comments above. */\r\n      if ((mode & IRCONV_CONVMASK) == IRCONV_INDEX) {\r\n\tif (next == last && irref_isk(narrow_ref(sp[0])) &&\r\n\t  (uint32_t)IR(narrow_ref(sp[0]))->i + 0x40000000u < 0x80000000u)\r\n\t  guardot = 0;\r\n\telse  /* Otherwise cache a stronger check. */\r\n\t  mode += IRCONV_CHECK-IRCONV_INDEX;\r\n      }\r\n      sp[-1] = emitir(op+guardot, sp[-1], sp[0]);\r\n      /* Add to cache. */\r\n      if (narrow_ref(ref))\r\n\tnarrow_bpc_set(J, narrow_ref(ref), narrow_ref(sp[-1]), mode);\r\n    }\r\n  }\r\n  lua_assert(sp == nc->stack+1);\r\n  return nc->stack[0];\r\n}\r\n\r\n/* Narrow a type conversion of an arithmetic operation. */\r\nTRef LJ_FASTCALL lj_opt_narrow_convert(jit_State *J)\r\n{\r\n  if ((J->flags & JIT_F_OPT_NARROW)) {\r\n    NarrowConv nc;\r\n    nc.J = J;\r\n    nc.sp = nc.stack;\r\n    nc.maxsp = &nc.stack[NARROW_MAX_STACK-4];\r\n    nc.t = irt_type(fins->t);\r\n    if (fins->o == IR_TOBIT) {\r\n      nc.mode = IRCONV_TOBIT;  /* Used only in the backpropagation cache. */\r\n    } else {\r\n      nc.mode = fins->op2;\r\n    }\r\n    if (narrow_conv_backprop(&nc, fins->op1, 0) <= 1)\r\n      return narrow_conv_emit(J, &nc);\r\n  }\r\n  return NEXTFOLD;\r\n}\r\n\r\n/* -- Narrowing of implicit conversions ----------------------------------- */\r\n\r\n/* Recursively strip overflow checks. */\r\nstatic TRef narrow_stripov(jit_State *J, TRef tr, int lastop, IRRef mode)\r\n{\r\n  IRRef ref = tref_ref(tr);\r\n  IRIns *ir = IR(ref);\r\n  int op = ir->o;\r\n  if (op >= IR_ADDOV && op <= lastop) {\r\n    BPropEntry *bp = narrow_bpc_get(J, ref, mode);\r\n    if (bp) {\r\n      return TREF(bp->val, irt_t(IR(bp->val)->t));\r\n    } else {\r\n      IRRef op1 = ir->op1, op2 = ir->op2;  /* The IR may be reallocated. */\r\n      op1 = narrow_stripov(J, op1, lastop, mode);\r\n      op2 = narrow_stripov(J, op2, lastop, mode);\r\n      tr = emitir(IRT(op - IR_ADDOV + IR_ADD,\r\n\t\t      ((mode & IRCONV_DSTMASK) >> IRCONV_DSH)), op1, op2);\r\n      narrow_bpc_set(J, ref, tref_ref(tr), mode);\r\n    }\r\n  } else if (LJ_64 && (mode & IRCONV_SEXT) && !irt_is64(ir->t)) {\r\n    tr = emitir(IRT(IR_CONV, IRT_INTP), tr, mode);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Narrow array index. */\r\nTRef LJ_FASTCALL lj_opt_narrow_index(jit_State *J, TRef tr)\r\n{\r\n  IRIns *ir;\r\n  lua_assert(tref_isnumber(tr));\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTGI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_INDEX);\r\n  /* Omit some overflow checks for array indexing. See comments above. */\r\n  ir = IR(tref_ref(tr));\r\n  if ((ir->o == IR_ADDOV || ir->o == IR_SUBOV) && irref_isk(ir->op2) &&\r\n      (uint32_t)IR(ir->op2)->i + 0x40000000u < 0x80000000u)\r\n    return emitir(IRTI(ir->o - IR_ADDOV + IR_ADD), ir->op1, ir->op2);\r\n  return tr;\r\n}\r\n\r\n/* Narrow conversion to integer operand (overflow undefined). */\r\nTRef LJ_FASTCALL lj_opt_narrow_toint(jit_State *J, TRef tr)\r\n{\r\n  if (tref_isstr(tr))\r\n    tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTI(IR_CONV), tr, IRCONV_INT_NUM|IRCONV_ANY);\r\n  if (!tref_isinteger(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /*\r\n  ** Undefined overflow semantics allow stripping of ADDOV, SUBOV and MULOV.\r\n  ** Use IRCONV_TOBIT for the cache entries, since the semantics are the same.\r\n  */\r\n  return narrow_stripov(J, tr, IR_MULOV, (IRT_INT<<5)|IRT_INT|IRCONV_TOBIT);\r\n}\r\n\r\n/* Narrow conversion to bitop operand (overflow wrapped). */\r\nTRef LJ_FASTCALL lj_opt_narrow_tobit(jit_State *J, TRef tr)\r\n{\r\n  if (tref_isstr(tr))\r\n    tr = emitir(IRTG(IR_STRTO, IRT_NUM), tr, 0);\r\n  if (tref_isnum(tr))  /* Conversion may be narrowed, too. See above. */\r\n    return emitir(IRTI(IR_TOBIT), tr, lj_ir_knum_tobit(J));\r\n  if (!tref_isinteger(tr))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /*\r\n  ** Wrapped overflow semantics allow stripping of ADDOV and SUBOV.\r\n  ** MULOV cannot be stripped due to precision widening.\r\n  */\r\n  return narrow_stripov(J, tr, IR_SUBOV, (IRT_INT<<5)|IRT_INT|IRCONV_TOBIT);\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Narrow C array index (overflow undefined). */\r\nTRef LJ_FASTCALL lj_opt_narrow_cindex(jit_State *J, TRef tr)\r\n{\r\n  lua_assert(tref_isnumber(tr));\r\n  if (tref_isnum(tr))\r\n    return emitir(IRT(IR_CONV, IRT_INTP), tr, (IRT_INTP<<5)|IRT_NUM|IRCONV_ANY);\r\n  /* Undefined overflow semantics allow stripping of ADDOV, SUBOV and MULOV. */\r\n  return narrow_stripov(J, tr, IR_MULOV,\r\n\t\t\tLJ_64 ? ((IRT_INTP<<5)|IRT_INT|IRCONV_SEXT) :\r\n\t\t\t\t((IRT_INTP<<5)|IRT_INT|IRCONV_TOBIT));\r\n}\r\n#endif\r\n\r\n/* -- Narrowing of arithmetic operators ----------------------------------- */\r\n\r\n/* Check whether a number fits into an int32_t (-0 is ok, too). */\r\nstatic int numisint(lua_Number n)\r\n{\r\n  return (n == (lua_Number)lj_num2int(n));\r\n}\r\n\r\n/* Narrowing of arithmetic operations. */\r\nTRef lj_opt_narrow_arith(jit_State *J, TRef rb, TRef rc,\r\n\t\t\t TValue *vb, TValue *vc, IROp op)\r\n{\r\n  if (tref_isstr(rb)) {\r\n    rb = emitir(IRTG(IR_STRTO, IRT_NUM), rb, 0);\r\n    lj_strscan_num(strV(vb), vb);\r\n  }\r\n  if (tref_isstr(rc)) {\r\n    rc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n    lj_strscan_num(strV(vc), vc);\r\n  }\r\n  /* Must not narrow MUL in non-DUALNUM variant, because it loses -0. */\r\n  if ((op >= IR_ADD && op <= (LJ_DUALNUM ? IR_MUL : IR_SUB)) &&\r\n      tref_isinteger(rb) && tref_isinteger(rc) &&\r\n      numisint(lj_vm_foldarith(numberVnum(vb), numberVnum(vc),\r\n\t\t\t       (int)op - (int)IR_ADD)))\r\n    return emitir(IRTGI((int)op - (int)IR_ADD + (int)IR_ADDOV), rb, rc);\r\n  if (!tref_isnum(rb)) rb = emitir(IRTN(IR_CONV), rb, IRCONV_NUM_INT);\r\n  if (!tref_isnum(rc)) rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n  return emitir(IRTN(op), rb, rc);\r\n}\r\n\r\n/* Narrowing of unary minus operator. */\r\nTRef lj_opt_narrow_unm(jit_State *J, TRef rc, TValue *vc)\r\n{\r\n  if (tref_isstr(rc)) {\r\n    rc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n    lj_strscan_num(strV(vc), vc);\r\n  }\r\n  if (tref_isinteger(rc)) {\r\n    if ((uint32_t)numberVint(vc) != 0x80000000u)\r\n      return emitir(IRTGI(IR_SUBOV), lj_ir_kint(J, 0), rc);\r\n    rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n  }\r\n  return emitir(IRTN(IR_NEG), rc, lj_ir_knum_neg(J));\r\n}\r\n\r\n/* Narrowing of modulo operator. */\r\nTRef lj_opt_narrow_mod(jit_State *J, TRef rb, TRef rc, TValue *vc)\r\n{\r\n  TRef tmp;\r\n  if (tvisstr(vc) && !lj_strscan_num(strV(vc), vc))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  if ((LJ_DUALNUM || (J->flags & JIT_F_OPT_NARROW)) &&\r\n      tref_isinteger(rb) && tref_isinteger(rc) &&\r\n      (tvisint(vc) ? intV(vc) != 0 : !tviszero(vc))) {\r\n    emitir(IRTGI(IR_NE), rc, lj_ir_kint(J, 0));\r\n    return emitir(IRTI(IR_MOD), rb, rc);\r\n  }\r\n  /* b % c ==> b - floor(b/c)*c */\r\n  rb = lj_ir_tonum(J, rb);\r\n  rc = lj_ir_tonum(J, rc);\r\n  tmp = emitir(IRTN(IR_DIV), rb, rc);\r\n  tmp = emitir(IRTN(IR_FPMATH), tmp, IRFPM_FLOOR);\r\n  tmp = emitir(IRTN(IR_MUL), tmp, rc);\r\n  return emitir(IRTN(IR_SUB), rb, tmp);\r\n}\r\n\r\n/* Narrowing of power operator or math.pow. */\r\nTRef lj_opt_narrow_pow(jit_State *J, TRef rb, TRef rc, TValue *vc)\r\n{\r\n  if (tvisstr(vc) && !lj_strscan_num(strV(vc), vc))\r\n    lj_trace_err(J, LJ_TRERR_BADTYPE);\r\n  /* Narrowing must be unconditional to preserve (-x)^i semantics. */\r\n  if (tvisint(vc) || numisint(numV(vc))) {\r\n    int checkrange = 0;\r\n    /* Split pow is faster for bigger exponents. But do this only for (+k)^i. */\r\n    if (tref_isk(rb) && (int32_t)ir_knum(IR(tref_ref(rb)))->u32.hi >= 0) {\r\n      int32_t k = numberVint(vc);\r\n      if (!(k >= -65536 && k <= 65536)) goto split_pow;\r\n      checkrange = 1;\r\n    }\r\n    if (!tref_isinteger(rc)) {\r\n      if (tref_isstr(rc))\r\n\trc = emitir(IRTG(IR_STRTO, IRT_NUM), rc, 0);\r\n      /* Guarded conversion to integer! */\r\n      rc = emitir(IRTGI(IR_CONV), rc, IRCONV_INT_NUM|IRCONV_CHECK);\r\n    }\r\n    if (checkrange && !tref_isk(rc)) {  /* Range guard: -65536 <= i <= 65536 */\r\n      TRef tmp = emitir(IRTI(IR_ADD), rc, lj_ir_kint(J, 65536));\r\n      emitir(IRTGI(IR_ULE), tmp, lj_ir_kint(J, 2*65536));\r\n    }\r\n    return emitir(IRTN(IR_POW), rb, rc);\r\n  }\r\nsplit_pow:\r\n  /* FOLD covers most cases, but some are easier to do here. */\r\n  if (tref_isk(rb) && tvispone(ir_knum(IR(tref_ref(rb)))))\r\n    return rb;  /* 1 ^ x ==> 1 */\r\n  rc = lj_ir_tonum(J, rc);\r\n  if (tref_isk(rc) && ir_knum(IR(tref_ref(rc)))->n == 0.5)\r\n    return emitir(IRTN(IR_FPMATH), rb, IRFPM_SQRT);  /* x ^ 0.5 ==> sqrt(x) */\r\n  /* Split up b^c into exp2(c*log2(b)). Assembler may rejoin later. */\r\n  rb = emitir(IRTN(IR_FPMATH), rb, IRFPM_LOG2);\r\n  rc = emitir(IRTN(IR_MUL), rb, rc);\r\n  return emitir(IRTN(IR_FPMATH), rc, IRFPM_EXP2);\r\n}\r\n\r\n/* -- Predictive narrowing of induction variables ------------------------- */\r\n\r\n/* Narrow a single runtime value. */\r\nstatic int narrow_forl(jit_State *J, cTValue *o)\r\n{\r\n  if (tvisint(o)) return 1;\r\n  if (LJ_DUALNUM || (J->flags & JIT_F_OPT_NARROW)) return numisint(numV(o));\r\n  return 0;\r\n}\r\n\r\n/* Narrow the FORL index type by looking at the runtime values. */\r\nIRType lj_opt_narrow_forl(jit_State *J, cTValue *tv)\r\n{\r\n  lua_assert(tvisnumber(&tv[FORL_IDX]) &&\r\n\t     tvisnumber(&tv[FORL_STOP]) &&\r\n\t     tvisnumber(&tv[FORL_STEP]));\r\n  /* Narrow only if the runtime values of start/stop/step are all integers. */\r\n  if (narrow_forl(J, &tv[FORL_IDX]) &&\r\n      narrow_forl(J, &tv[FORL_STOP]) &&\r\n      narrow_forl(J, &tv[FORL_STEP])) {\r\n    /* And if the loop index can't possibly overflow. */\r\n    lua_Number step = numberVnum(&tv[FORL_STEP]);\r\n    lua_Number sum = numberVnum(&tv[FORL_STOP]) + step;\r\n    if (0 <= step ? (sum <= 2147483647.0) : (sum >= -2147483648.0))\r\n      return IRT_INT;\r\n  }\r\n  return IRT_NUM;\r\n}\r\n\r\n#undef IR\r\n#undef fins\r\n#undef emitir\r\n#undef emitir_raw\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_sink.c",
    "content": "/*\r\n** SINK: Allocation Sinking and Store Sinking.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_sink_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_target.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Check whether the store ref points to an eligible allocation. */\r\nstatic IRIns *sink_checkalloc(jit_State *J, IRIns *irs)\r\n{\r\n  IRIns *ir = IR(irs->op1);\r\n  if (!irref_isk(ir->op2))\r\n    return NULL;  /* Non-constant key. */\r\n  if (ir->o == IR_HREFK || ir->o == IR_AREF)\r\n    ir = IR(ir->op1);\r\n  else if (!(ir->o == IR_HREF || ir->o == IR_NEWREF ||\r\n\t     ir->o == IR_FREF || ir->o == IR_ADD))\r\n    return NULL;  /* Unhandled reference type (for XSTORE). */\r\n  ir = IR(ir->op1);\r\n  if (!(ir->o == IR_TNEW || ir->o == IR_TDUP || ir->o == IR_CNEW))\r\n    return NULL;  /* Not an allocation. */\r\n  return ir;  /* Return allocation. */\r\n}\r\n\r\n/* Recursively check whether a value depends on a PHI. */\r\nstatic int sink_phidep(jit_State *J, IRRef ref)\r\n{\r\n  IRIns *ir = IR(ref);\r\n  if (irt_isphi(ir->t)) return 1;\r\n  if (ir->op1 >= REF_FIRST && sink_phidep(J, ir->op1)) return 1;\r\n  if (ir->op2 >= REF_FIRST && sink_phidep(J, ir->op2)) return 1;\r\n  return 0;\r\n}\r\n\r\n/* Check whether a value is a sinkable PHI or loop-invariant. */\r\nstatic int sink_checkphi(jit_State *J, IRIns *ira, IRRef ref)\r\n{\r\n  if (ref >= REF_FIRST) {\r\n    IRIns *ir = IR(ref);\r\n    if (irt_isphi(ir->t) || (ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT &&\r\n\t\t\t     irt_isphi(IR(ir->op1)->t))) {\r\n      ira->prev++;\r\n      return 1;  /* Sinkable PHI. */\r\n    }\r\n    /* Otherwise the value must be loop-invariant. */\r\n    return ref < J->loopref && !sink_phidep(J, ref);\r\n  }\r\n  return 1;  /* Constant (non-PHI). */\r\n}\r\n\r\n/* Mark non-sinkable allocations using single-pass backward propagation.\r\n**\r\n** Roots for the marking process are:\r\n** - Some PHIs or snapshots (see below).\r\n** - Non-PHI, non-constant values stored to PHI allocations.\r\n** - All guards.\r\n** - Any remaining loads not eliminated by store-to-load forwarding.\r\n** - Stores with non-constant keys.\r\n** - All stored values.\r\n*/\r\nstatic void sink_mark_ins(jit_State *J)\r\n{\r\n  IRIns *ir, *irlast = IR(J->cur.nins-1);\r\n  for (ir = irlast ; ; ir--) {\r\n    switch (ir->o) {\r\n    case IR_BASE:\r\n      return;  /* Finished. */\r\n    case IR_CALLL:  /* IRCALL_lj_tab_len */\r\n    case IR_ALOAD: case IR_HLOAD: case IR_XLOAD: case IR_TBAR:\r\n      irt_setmark(IR(ir->op1)->t);  /* Mark ref for remaining loads. */\r\n      break;\r\n    case IR_FLOAD:\r\n      if (irt_ismarked(ir->t) || ir->op2 == IRFL_TAB_META)\r\n\tirt_setmark(IR(ir->op1)->t);  /* Mark table for remaining loads. */\r\n      break;\r\n    case IR_ASTORE: case IR_HSTORE: case IR_FSTORE: case IR_XSTORE: {\r\n      IRIns *ira = sink_checkalloc(J, ir);\r\n      if (!ira || (irt_isphi(ira->t) && !sink_checkphi(J, ira, ir->op2)))\r\n\tirt_setmark(IR(ir->op1)->t);  /* Mark ineligible ref. */\r\n      irt_setmark(IR(ir->op2)->t);  /* Mark stored value. */\r\n      break;\r\n      }\r\n#if LJ_HASFFI\r\n    case IR_CNEWI:\r\n      if (irt_isphi(ir->t) &&\r\n\t  (!sink_checkphi(J, ir, ir->op2) ||\r\n\t   (LJ_32 && ir+1 < irlast && (ir+1)->o == IR_HIOP &&\r\n\t    !sink_checkphi(J, ir, (ir+1)->op2))))\r\n\tirt_setmark(ir->t);  /* Mark ineligible allocation. */\r\n      /* fallthrough */\r\n#endif\r\n    case IR_USTORE:\r\n      irt_setmark(IR(ir->op2)->t);  /* Mark stored value. */\r\n      break;\r\n#if LJ_HASFFI\r\n    case IR_CALLXS:\r\n#endif\r\n    case IR_CALLS:\r\n      irt_setmark(IR(ir->op1)->t);  /* Mark (potentially) stored values. */\r\n      break;\r\n    case IR_PHI: {\r\n      IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n      irl->prev = irr->prev = 0;  /* Clear PHI value counts. */\r\n      if (irl->o == irr->o &&\r\n\t  (irl->o == IR_TNEW || irl->o == IR_TDUP ||\r\n\t   (LJ_HASFFI && (irl->o == IR_CNEW || irl->o == IR_CNEWI))))\r\n\tbreak;\r\n      irt_setmark(irl->t);\r\n      irt_setmark(irr->t);\r\n      break;\r\n      }\r\n    default:\r\n      if (irt_ismarked(ir->t) || irt_isguard(ir->t)) {  /* Propagate mark. */\r\n\tif (ir->op1 >= REF_FIRST) irt_setmark(IR(ir->op1)->t);\r\n\tif (ir->op2 >= REF_FIRST) irt_setmark(IR(ir->op2)->t);\r\n      }\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Mark all instructions referenced by a snapshot. */\r\nstatic void sink_mark_snap(jit_State *J, SnapShot *snap)\r\n{\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    IRRef ref = snap_ref(map[n]);\r\n    if (!irref_isk(ref))\r\n      irt_setmark(IR(ref)->t);\r\n  }\r\n}\r\n\r\n/* Iteratively remark PHI refs with differing marks or PHI value counts. */\r\nstatic void sink_remark_phi(jit_State *J)\r\n{\r\n  IRIns *ir;\r\n  int remark;\r\n  do {\r\n    remark = 0;\r\n    for (ir = IR(J->cur.nins-1); ir->o == IR_PHI; ir--) {\r\n      IRIns *irl = IR(ir->op1), *irr = IR(ir->op2);\r\n      if (((irl->t.irt ^ irr->t.irt) & IRT_MARK))\r\n\tremark = 1;\r\n      else if (irl->prev == irr->prev)\r\n\tcontinue;\r\n      irt_setmark(IR(ir->op1)->t);\r\n      irt_setmark(IR(ir->op2)->t);\r\n    }\r\n  } while (remark);\r\n}\r\n\r\n/* Sweep instructions and tag sunken allocations and stores. */\r\nstatic void sink_sweep_ins(jit_State *J)\r\n{\r\n  IRIns *ir, *irfirst = IR(J->cur.nk);\r\n  for (ir = IR(J->cur.nins-1) ; ir >= irfirst; ir--) {\r\n    switch (ir->o) {\r\n    case IR_ASTORE: case IR_HSTORE: case IR_FSTORE: case IR_XSTORE: {\r\n      IRIns *ira = sink_checkalloc(J, ir);\r\n      if (ira && !irt_ismarked(ira->t)) {\r\n\tint delta = (int)(ir - ira);\r\n\tir->prev = REGSP(RID_SINK, delta > 255 ? 255 : delta);\r\n      } else {\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n      }\r\n    case IR_NEWREF:\r\n      if (!irt_ismarked(IR(ir->op1)->t)) {\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n      } else {\r\n\tirt_clearmark(ir->t);\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n#if LJ_HASFFI\r\n    case IR_CNEW: case IR_CNEWI:\r\n#endif\r\n    case IR_TNEW: case IR_TDUP:\r\n      if (!irt_ismarked(ir->t)) {\r\n\tir->t.irt &= ~IRT_GUARD;\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n\tJ->cur.sinktags = 1;  /* Signal present SINK tags to assembler. */\r\n      } else {\r\n\tirt_clearmark(ir->t);\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n    case IR_PHI: {\r\n      IRIns *ira = IR(ir->op2);\r\n      if (!irt_ismarked(ira->t) &&\r\n\t  (ira->o == IR_TNEW || ira->o == IR_TDUP ||\r\n\t   (LJ_HASFFI && (ira->o == IR_CNEW || ira->o == IR_CNEWI)))) {\r\n\tir->prev = REGSP(RID_SINK, 0);\r\n      } else {\r\n\tir->prev = REGSP_INIT;\r\n      }\r\n      break;\r\n      }\r\n    default:\r\n      irt_clearmark(ir->t);\r\n      ir->prev = REGSP_INIT;\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Allocation sinking and store sinking.\r\n**\r\n** 1. Mark all non-sinkable allocations.\r\n** 2. Then sink all remaining allocations and the related stores.\r\n*/\r\nvoid lj_opt_sink(jit_State *J)\r\n{\r\n  const uint32_t need = (JIT_F_OPT_SINK|JIT_F_OPT_FWD|\r\n\t\t\t JIT_F_OPT_DCE|JIT_F_OPT_CSE|JIT_F_OPT_FOLD);\r\n  if ((J->flags & need) == need &&\r\n      (J->chain[IR_TNEW] || J->chain[IR_TDUP] ||\r\n       (LJ_HASFFI && (J->chain[IR_CNEW] || J->chain[IR_CNEWI])))) {\r\n    if (!J->loopref)\r\n      sink_mark_snap(J, &J->cur.snap[J->cur.nsnap-1]);\r\n    sink_mark_ins(J);\r\n    if (J->loopref)\r\n      sink_remark_phi(J);\r\n    sink_sweep_ins(J);\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_opt_split.c",
    "content": "/*\r\n** SPLIT: Split 64 bit IR instructions into 32 bit IR instructions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_opt_split_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT && (LJ_SOFTFP || (LJ_32 && LJ_HASFFI))\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* SPLIT pass:\r\n**\r\n** This pass splits up 64 bit IR instructions into multiple 32 bit IR\r\n** instructions. It's only active for soft-float targets or for 32 bit CPUs\r\n** which lack native 64 bit integer operations (the FFI is currently the\r\n** only emitter for 64 bit integer instructions).\r\n**\r\n** Splitting the IR in a separate pass keeps each 32 bit IR assembler\r\n** backend simple. Only a small amount of extra functionality needs to be\r\n** implemented. This is much easier than adding support for allocating\r\n** register pairs to each backend (believe me, I tried). A few simple, but\r\n** important optimizations can be performed by the SPLIT pass, which would\r\n** be tedious to do in the backend.\r\n**\r\n** The basic idea is to replace each 64 bit IR instruction with its 32 bit\r\n** equivalent plus an extra HIOP instruction. The splitted IR is not passed\r\n** through FOLD or any other optimizations, so each HIOP is guaranteed to\r\n** immediately follow it's counterpart. The actual functionality of HIOP is\r\n** inferred from the previous instruction.\r\n**\r\n** The operands of HIOP hold the hiword input references. The output of HIOP\r\n** is the hiword output reference, which is also used to hold the hiword\r\n** register or spill slot information. The register allocator treats this\r\n** instruction independently of any other instruction, which improves code\r\n** quality compared to using fixed register pairs.\r\n**\r\n** It's easier to split up some instructions into two regular 32 bit\r\n** instructions. E.g. XLOAD is split up into two XLOADs with two different\r\n** addresses. Obviously 64 bit constants need to be split up into two 32 bit\r\n** constants, too. Some hiword instructions can be entirely omitted, e.g.\r\n** when zero-extending a 32 bit value to 64 bits. 64 bit arguments for calls\r\n** are split up into two 32 bit arguments each.\r\n**\r\n** On soft-float targets, floating-point instructions are directly converted\r\n** to soft-float calls by the SPLIT pass (except for comparisons and MIN/MAX).\r\n** HIOP for number results has the type IRT_SOFTFP (\"sfp\" in -jdump).\r\n**\r\n** Here's the IR and x64 machine code for 'x.b = x.a + 1' for a struct with\r\n** two int64_t fields:\r\n**\r\n** 0100    p32 ADD    base  +8\r\n** 0101    i64 XLOAD  0100\r\n** 0102    i64 ADD    0101  +1\r\n** 0103    p32 ADD    base  +16\r\n** 0104    i64 XSTORE 0103  0102\r\n**\r\n**         mov rax, [esi+0x8]\r\n**         add rax, +0x01\r\n**         mov [esi+0x10], rax\r\n**\r\n** Here's the transformed IR and the x86 machine code after the SPLIT pass:\r\n**\r\n** 0100    p32 ADD    base  +8\r\n** 0101    int XLOAD  0100\r\n** 0102    p32 ADD    base  +12\r\n** 0103    int XLOAD  0102\r\n** 0104    int ADD    0101  +1\r\n** 0105    int HIOP   0103  +0\r\n** 0106    p32 ADD    base  +16\r\n** 0107    int XSTORE 0106  0104\r\n** 0108    int HIOP   0106  0105\r\n**\r\n**         mov eax, [esi+0x8]\r\n**         mov ecx, [esi+0xc]\r\n**         add eax, +0x01\r\n**         adc ecx, +0x00\r\n**         mov [esi+0x10], eax\r\n**         mov [esi+0x14], ecx\r\n**\r\n** You may notice the reassociated hiword address computation, which is\r\n** later fused into the mov operands by the assembler.\r\n*/\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Directly emit the transformed IR without updating chains etc. */\r\nstatic IRRef split_emit(jit_State *J, uint16_t ot, IRRef1 op1, IRRef1 op2)\r\n{\r\n  IRRef nref = lj_ir_nextins(J);\r\n  IRIns *ir = IR(nref);\r\n  ir->ot = ot;\r\n  ir->op1 = op1;\r\n  ir->op2 = op2;\r\n  return nref;\r\n}\r\n\r\n#if LJ_SOFTFP\r\n/* Emit a (checked) number to integer conversion. */\r\nstatic IRRef split_num2int(jit_State *J, IRRef lo, IRRef hi, int check)\r\n{\r\n  IRRef tmp, res;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), lo, hi);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hi, lo);\r\n#endif\r\n  res = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_softfp_d2i);\r\n  if (check) {\r\n    tmp = split_emit(J, IRTI(IR_CALLN), res, IRCALL_softfp_i2d);\r\n    split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n    split_emit(J, IRTGI(IR_EQ), tmp, lo);\r\n    split_emit(J, IRTG(IR_HIOP, IRT_SOFTFP), tmp+1, hi);\r\n  }\r\n  return res;\r\n}\r\n\r\n/* Emit a CALLN with one split 64 bit argument. */\r\nstatic IRRef split_call_l(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t  IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n}\r\n#endif\r\n\r\n/* Emit a CALLN with one split 64 bit argument and a 32 bit argument. */\r\nstatic IRRef split_call_li(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t   IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1, op2 = ir->op2;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n}\r\n\r\n/* Emit a CALLN with two split 64 bit arguments. */\r\nstatic IRRef split_call_ll(jit_State *J, IRRef1 *hisubst, IRIns *oir,\r\n\t\t\t   IRIns *ir, IRCallID id)\r\n{\r\n  IRRef tmp, op1 = ir->op1, op2 = ir->op2;\r\n  J->cur.nins--;\r\n#if LJ_LE\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, hisubst[op2]);\r\n#else\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, hisubst[op2]);\r\n  tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, oir[op2].prev);\r\n#endif\r\n  ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, id);\r\n  return split_emit(J,\r\n    IRT(IR_HIOP, (LJ_SOFTFP && irt_isnum(ir->t)) ? IRT_SOFTFP : IRT_INT),\r\n    tmp, tmp);\r\n}\r\n\r\n/* Get a pointer to the other 32 bit word (LE: hiword, BE: loword). */\r\nstatic IRRef split_ptr(jit_State *J, IRIns *oir, IRRef ref)\r\n{\r\n  IRRef nref = oir[ref].prev;\r\n  IRIns *ir = IR(nref);\r\n  int32_t ofs = 4;\r\n  if (ir->o == IR_KPTR)\r\n    return lj_ir_kptr(J, (char *)ir_kptr(ir) + ofs);\r\n  if (ir->o == IR_ADD && irref_isk(ir->op2) && !irt_isphi(oir[ref].t)) {\r\n    /* Reassociate address. */\r\n    ofs += IR(ir->op2)->i;\r\n    nref = ir->op1;\r\n    if (ofs == 0) return nref;\r\n  }\r\n  return split_emit(J, IRTI(IR_ADD), nref, lj_ir_kint(J, ofs));\r\n}\r\n\r\n#if LJ_HASFFI\r\nstatic IRRef split_bitshift(jit_State *J, IRRef1 *hisubst,\r\n\t\t\t    IRIns *oir, IRIns *nir, IRIns *ir)\r\n{\r\n  IROp op = ir->o;\r\n  IRRef kref = nir->op2;\r\n  if (irref_isk(kref)) {  /* Optimize constant shifts. */\r\n    int32_t k = (IR(kref)->i & 63);\r\n    IRRef lo = nir->op1, hi = hisubst[ir->op1];\r\n    if (op == IR_BROL || op == IR_BROR) {\r\n      if (op == IR_BROR) k = (-k & 63);\r\n      if (k >= 32) { IRRef t = lo; lo = hi; hi = t; k -= 32; }\r\n      if (k == 0) {\r\n      passthrough:\r\n\tJ->cur.nins--;\r\n\tir->prev = lo;\r\n\treturn hi;\r\n      } else {\r\n\tTRef k1, k2;\r\n\tIRRef t1, t2, t3, t4;\r\n\tJ->cur.nins--;\r\n\tk1 = lj_ir_kint(J, k);\r\n\tk2 = lj_ir_kint(J, (-k & 31));\r\n\tt1 = split_emit(J, IRTI(IR_BSHL), lo, k1);\r\n\tt2 = split_emit(J, IRTI(IR_BSHL), hi, k1);\r\n\tt3 = split_emit(J, IRTI(IR_BSHR), lo, k2);\r\n\tt4 = split_emit(J, IRTI(IR_BSHR), hi, k2);\r\n\tir->prev = split_emit(J, IRTI(IR_BOR), t1, t4);\r\n\treturn split_emit(J, IRTI(IR_BOR), t2, t3);\r\n      }\r\n    } else if (k == 0) {\r\n      goto passthrough;\r\n    } else if (k < 32) {\r\n      if (op == IR_BSHL) {\r\n\tIRRef t1 = split_emit(J, IRTI(IR_BSHL), hi, kref);\r\n\tIRRef t2 = split_emit(J, IRTI(IR_BSHR), lo, lj_ir_kint(J, (-k&31)));\r\n\treturn split_emit(J, IRTI(IR_BOR), t1, t2);\r\n      } else {\r\n\tIRRef t1 = ir->prev, t2;\r\n\tlua_assert(op == IR_BSHR || op == IR_BSAR);\r\n\tnir->o = IR_BSHR;\r\n\tt2 = split_emit(J, IRTI(IR_BSHL), hi, lj_ir_kint(J, (-k&31)));\r\n\tir->prev = split_emit(J, IRTI(IR_BOR), t1, t2);\r\n\treturn split_emit(J, IRTI(op), hi, kref);\r\n      }\r\n    } else {\r\n      if (op == IR_BSHL) {\r\n\tif (k == 32)\r\n\t  J->cur.nins--;\r\n\telse\r\n\t  lo = ir->prev;\r\n\tir->prev = lj_ir_kint(J, 0);\r\n\treturn lo;\r\n      } else {\r\n\tlua_assert(op == IR_BSHR || op == IR_BSAR);\r\n\tif (k == 32) {\r\n\t  J->cur.nins--;\r\n\t  ir->prev = hi;\r\n\t} else {\r\n\t  nir->op1 = hi;\r\n\t}\r\n\tif (op == IR_BSHR)\r\n\t  return lj_ir_kint(J, 0);\r\n\telse\r\n\t  return split_emit(J, IRTI(IR_BSAR), hi, lj_ir_kint(J, 31));\r\n      }\r\n    }\r\n  }\r\n  return split_call_li(J, hisubst, oir, ir,\r\n\t\t       op - IR_BSHL + IRCALL_lj_carith_shl64);\r\n}\r\n\r\nstatic IRRef split_bitop(jit_State *J, IRRef1 *hisubst,\r\n\t\t\t IRIns *nir, IRIns *ir)\r\n{\r\n  IROp op = ir->o;\r\n  IRRef hi, kref = nir->op2;\r\n  if (irref_isk(kref)) {  /* Optimize bit operations with lo constant. */\r\n    int32_t k = IR(kref)->i;\r\n    if (k == 0 || k == -1) {\r\n      if (op == IR_BAND) k = ~k;\r\n      if (k == 0) {\r\n\tJ->cur.nins--;\r\n\tir->prev = nir->op1;\r\n      } else if (op == IR_BXOR) {\r\n\tnir->o = IR_BNOT;\r\n\tnir->op2 = 0;\r\n      } else {\r\n\tJ->cur.nins--;\r\n\tir->prev = kref;\r\n      }\r\n    }\r\n  }\r\n  hi = hisubst[ir->op1];\r\n  kref = hisubst[ir->op2];\r\n  if (irref_isk(kref)) {  /* Optimize bit operations with hi constant. */\r\n    int32_t k = IR(kref)->i;\r\n    if (k == 0 || k == -1) {\r\n      if (op == IR_BAND) k = ~k;\r\n      if (k == 0) {\r\n\treturn hi;\r\n      } else if (op == IR_BXOR) {\r\n\treturn split_emit(J, IRTI(IR_BNOT), hi, 0);\r\n      } else {\r\n\treturn kref;\r\n      }\r\n    }\r\n  }\r\n  return split_emit(J, IRTI(op), hi, kref);\r\n}\r\n#endif\r\n\r\n/* Substitute references of a snapshot. */\r\nstatic void split_subst_snap(jit_State *J, SnapShot *snap, IRIns *oir)\r\n{\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    IRIns *ir = &oir[snap_ref(sn)];\r\n    if (!(LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && irref_isk(snap_ref(sn))))\r\n      map[n] = ((sn & 0xffff0000) | ir->prev);\r\n  }\r\n}\r\n\r\n/* Transform the old IR to the new IR. */\r\nstatic void split_ir(jit_State *J)\r\n{\r\n  IRRef nins = J->cur.nins, nk = J->cur.nk;\r\n  MSize irlen = nins - nk;\r\n  MSize need = (irlen+1)*(sizeof(IRIns) + sizeof(IRRef1));\r\n  IRIns *oir = (IRIns *)lj_buf_tmp(J->L, need);\r\n  IRRef1 *hisubst;\r\n  IRRef ref, snref;\r\n  SnapShot *snap;\r\n\r\n  /* Copy old IR to buffer. */\r\n  memcpy(oir, IR(nk), irlen*sizeof(IRIns));\r\n  /* Bias hiword substitution table and old IR. Loword kept in field prev. */\r\n  hisubst = (IRRef1 *)&oir[irlen] - nk;\r\n  oir -= nk;\r\n\r\n  /* Remove all IR instructions, but retain IR constants. */\r\n  J->cur.nins = REF_FIRST;\r\n  J->loopref = 0;\r\n\r\n  /* Process constants and fixed references. */\r\n  for (ref = nk; ref <= REF_BASE; ref++) {\r\n    IRIns *ir = &oir[ref];\r\n    if ((LJ_SOFTFP && ir->o == IR_KNUM) || ir->o == IR_KINT64) {\r\n      /* Split up 64 bit constant. */\r\n      TValue tv = *ir_k64(ir);\r\n      ir->prev = lj_ir_kint(J, (int32_t)tv.u32.lo);\r\n      hisubst[ref] = lj_ir_kint(J, (int32_t)tv.u32.hi);\r\n    } else {\r\n      ir->prev = ref;  /* Identity substitution for loword. */\r\n      hisubst[ref] = 0;\r\n    }\r\n  }\r\n\r\n  /* Process old IR instructions. */\r\n  snap = J->cur.snap;\r\n  snref = snap->ref;\r\n  for (ref = REF_FIRST; ref < nins; ref++) {\r\n    IRIns *ir = &oir[ref];\r\n    IRRef nref = lj_ir_nextins(J);\r\n    IRIns *nir = IR(nref);\r\n    IRRef hi = 0;\r\n\r\n    if (ref >= snref) {\r\n      snap->ref = nref;\r\n      split_subst_snap(J, snap++, oir);\r\n      snref = snap < &J->cur.snap[J->cur.nsnap] ? snap->ref : ~(IRRef)0;\r\n    }\r\n\r\n    /* Copy-substitute old instruction to new instruction. */\r\n    nir->op1 = ir->op1 < nk ? ir->op1 : oir[ir->op1].prev;\r\n    nir->op2 = ir->op2 < nk ? ir->op2 : oir[ir->op2].prev;\r\n    ir->prev = nref;  /* Loword substitution. */\r\n    nir->o = ir->o;\r\n    nir->t.irt = ir->t.irt & ~(IRT_MARK|IRT_ISPHI);\r\n    hisubst[ref] = 0;\r\n\r\n    /* Split 64 bit instructions. */\r\n#if LJ_SOFTFP\r\n    if (irt_isnum(ir->t)) {\r\n      nir->t.irt = IRT_INT | (nir->t.irt & IRT_GUARD);  /* Turn into INT op. */\r\n      /* Note: hi ref = lo ref + 1! Required for SNAP_SOFTFPNUM logic. */\r\n      switch (ir->o) {\r\n      case IR_ADD:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_add);\r\n\tbreak;\r\n      case IR_SUB:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_sub);\r\n\tbreak;\r\n      case IR_MUL:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_mul);\r\n\tbreak;\r\n      case IR_DIV:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_softfp_div);\r\n\tbreak;\r\n      case IR_POW:\r\n\thi = split_call_li(J, hisubst, oir, ir, IRCALL_lj_vm_powi);\r\n\tbreak;\r\n      case IR_FPMATH:\r\n\t/* Try to rejoin pow from EXP2, MUL and LOG2. */\r\n\tif (nir->op2 == IRFPM_EXP2 && nir->op1 > J->loopref) {\r\n\t  IRIns *irp = IR(nir->op1);\r\n\t  if (irp->o == IR_CALLN && irp->op2 == IRCALL_softfp_mul) {\r\n\t    IRIns *irm4 = IR(irp->op1);\r\n\t    IRIns *irm3 = IR(irm4->op1);\r\n\t    IRIns *irm12 = IR(irm3->op1);\r\n\t    IRIns *irl1 = IR(irm12->op1);\r\n\t    if (irm12->op1 > J->loopref && irl1->o == IR_CALLN &&\r\n\t\tirl1->op2 == IRCALL_lj_vm_log2) {\r\n\t      IRRef tmp = irl1->op1;  /* Recycle first two args from LOG2. */\r\n\t      IRRef arg3 = irm3->op2, arg4 = irm4->op2;\r\n\t      J->cur.nins--;\r\n\t      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, arg3);\r\n\t      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), tmp, arg4);\r\n\t      ir->prev = tmp = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_pow);\r\n\t      hi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), tmp, tmp);\r\n\t      break;\r\n\t    }\r\n\t  }\r\n\t}\r\n\thi = split_call_l(J, hisubst, oir, ir, IRCALL_lj_vm_floor + ir->op2);\r\n\tbreak;\r\n      case IR_ATAN2:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_atan2);\r\n\tbreak;\r\n      case IR_LDEXP:\r\n\thi = split_call_li(J, hisubst, oir, ir, IRCALL_ldexp);\r\n\tbreak;\r\n      case IR_NEG: case IR_ABS:\r\n\tnir->o = IR_CONV;  /* Pass through loword. */\r\n\tnir->op2 = (IRT_INT << 5) | IRT_INT;\r\n\thi = split_emit(J, IRT(ir->o == IR_NEG ? IR_BXOR : IR_BAND, IRT_SOFTFP),\r\n\t\t\thisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_SLOAD:\r\n\tif ((nir->op2 & IRSLOAD_CONVERT)) {  /* Convert from int to number. */\r\n\t  nir->op2 &= ~IRSLOAD_CONVERT;\r\n\t  ir->prev = nref = split_emit(J, IRTI(IR_CALLN), nref,\r\n\t\t\t\t       IRCALL_softfp_i2d);\r\n\t  hi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\t  break;\r\n\t}\r\n\t/* fallthrough */\r\n      case IR_ALOAD: case IR_HLOAD: case IR_ULOAD: case IR_VLOAD:\r\n      case IR_STRTO:\r\n\thi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tbreak;\r\n      case IR_XLOAD: {\r\n\tIRIns inslo = *nir;  /* Save/undo the emit of the lo XLOAD. */\r\n\tJ->cur.nins--;\r\n\thi = split_ptr(J, oir, ir->op1);  /* Insert the hiref ADD. */\r\n\tnref = lj_ir_nextins(J);\r\n\tnir = IR(nref);\r\n\t*nir = inslo;  /* Re-emit lo XLOAD immediately before hi XLOAD. */\r\n\thi = split_emit(J, IRT(IR_XLOAD, IRT_SOFTFP), hi, ir->op2);\r\n#if LJ_LE\r\n\tir->prev = nref;\r\n#else\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n\t}\r\n      case IR_ASTORE: case IR_HSTORE: case IR_USTORE: case IR_XSTORE:\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nir->op1, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_CONV: {  /* Conversion to number. Others handled below. */\r\n\tIRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n\tUNUSED(st);\r\n#if LJ_32 && LJ_HASFFI\r\n\tif (st == IRT_I64 || st == IRT_U64) {\r\n\t  hi = split_call_l(J, hisubst, oir, ir,\r\n\t\t st == IRT_I64 ? IRCALL_fp64_l2d : IRCALL_fp64_ul2d);\r\n\t  break;\r\n\t}\r\n#endif\r\n\tlua_assert(st == IRT_INT ||\r\n\t\t   (LJ_32 && LJ_HASFFI && (st == IRT_U32 || st == IRT_FLOAT)));\r\n\tnir->o = IR_CALLN;\r\n#if LJ_32 && LJ_HASFFI\r\n\tnir->op2 = st == IRT_INT ? IRCALL_softfp_i2d :\r\n\t\t   st == IRT_FLOAT ? IRCALL_softfp_f2d :\r\n\t\t   IRCALL_softfp_ui2d;\r\n#else\r\n\tnir->op2 = IRCALL_softfp_i2d;\r\n#endif\r\n\thi = split_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tbreak;\r\n\t}\r\n      case IR_CALLN:\r\n      case IR_CALLL:\r\n      case IR_CALLS:\r\n      case IR_CALLXS:\r\n\tgoto split_call;\r\n      case IR_PHI:\r\n\tif (nir->op1 == nir->op2)\r\n\t  J->cur.nins--;  /* Drop useless PHIs. */\r\n\tif (hisubst[ir->op1] != hisubst[ir->op2])\r\n\t  split_emit(J, IRT(IR_PHI, IRT_SOFTFP),\r\n\t\t     hisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_HIOP:\r\n\tJ->cur.nins--;  /* Drop joining HIOP. */\r\n\tir->prev = nir->op1;\r\n\thi = nir->op2;\r\n\tbreak;\r\n      default:\r\n\tlua_assert(ir->o <= IR_NE || ir->o == IR_MIN || ir->o == IR_MAX);\r\n\thi = split_emit(J, IRTG(IR_HIOP, IRT_SOFTFP),\r\n\t\t\thisubst[ir->op1], hisubst[ir->op2]);\r\n\tbreak;\r\n      }\r\n    } else\r\n#endif\r\n#if LJ_32 && LJ_HASFFI\r\n    if (irt_isint64(ir->t)) {\r\n      IRRef hiref = hisubst[ir->op1];\r\n      nir->t.irt = IRT_INT | (nir->t.irt & IRT_GUARD);  /* Turn into INT op. */\r\n      switch (ir->o) {\r\n      case IR_ADD:\r\n      case IR_SUB:\r\n\t/* Use plain op for hiword if loword cannot produce a carry/borrow. */\r\n\tif (irref_isk(nir->op2) && IR(nir->op2)->i == 0) {\r\n\t  ir->prev = nir->op1;  /* Pass through loword. */\r\n\t  nir->op1 = hiref; nir->op2 = hisubst[ir->op2];\r\n\t  hi = nref;\r\n\t  break;\r\n\t}\r\n\t/* fallthrough */\r\n      case IR_NEG:\r\n\thi = split_emit(J, IRTI(IR_HIOP), hiref, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_MUL:\r\n\thi = split_call_ll(J, hisubst, oir, ir, IRCALL_lj_carith_mul64);\r\n\tbreak;\r\n      case IR_DIV:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_divi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_divu64);\r\n\tbreak;\r\n      case IR_MOD:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_modi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_modu64);\r\n\tbreak;\r\n      case IR_POW:\r\n\thi = split_call_ll(J, hisubst, oir, ir,\r\n\t\t\t   irt_isi64(ir->t) ? IRCALL_lj_carith_powi64 :\r\n\t\t\t\t\t      IRCALL_lj_carith_powu64);\r\n\tbreak;\r\n      case IR_BNOT:\r\n\thi = split_emit(J, IRTI(IR_BNOT), hiref, 0);\r\n\tbreak;\r\n      case IR_BSWAP:\r\n\tir->prev = split_emit(J, IRTI(IR_BSWAP), hiref, 0);\r\n\thi = nref;\r\n\tbreak;\r\n      case IR_BAND: case IR_BOR: case IR_BXOR:\r\n\thi = split_bitop(J, hisubst, nir, ir);\r\n\tbreak;\r\n      case IR_BSHL: case IR_BSHR: case IR_BSAR: case IR_BROL: case IR_BROR:\r\n\thi = split_bitshift(J, hisubst, oir, nir, ir);\r\n\tbreak;\r\n      case IR_FLOAD:\r\n\tlua_assert(ir->op2 == IRFL_CDATA_INT64);\r\n\thi = split_emit(J, IRTI(IR_FLOAD), nir->op1, IRFL_CDATA_INT64_4);\r\n#if LJ_BE\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n      case IR_XLOAD:\r\n\thi = split_emit(J, IRTI(IR_XLOAD), split_ptr(J, oir, ir->op1), ir->op2);\r\n#if LJ_BE\r\n\tir->prev = hi; hi = nref;\r\n#endif\r\n\tbreak;\r\n      case IR_XSTORE:\r\n\tsplit_emit(J, IRTI(IR_HIOP), nir->op1, hisubst[ir->op2]);\r\n\tbreak;\r\n      case IR_CONV: {  /* Conversion to 64 bit integer. Others handled below. */\r\n\tIRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if LJ_SOFTFP\r\n\tif (st == IRT_NUM) {  /* NUM to 64 bit int conv. */\r\n\t  hi = split_call_l(J, hisubst, oir, ir,\r\n\t\t irt_isi64(ir->t) ? IRCALL_fp64_d2l : IRCALL_fp64_d2ul);\r\n\t} else if (st == IRT_FLOAT) {  /* FLOAT to 64 bit int conv. */\r\n\t  nir->o = IR_CALLN;\r\n\t  nir->op2 = irt_isi64(ir->t) ? IRCALL_fp64_f2l : IRCALL_fp64_f2ul;\r\n\t  hi = split_emit(J, IRTI(IR_HIOP), nref, nref);\r\n\t}\r\n#else\r\n\tif (st == IRT_NUM || st == IRT_FLOAT) {  /* FP to 64 bit int conv. */\r\n\t  hi = split_emit(J, IRTI(IR_HIOP), nir->op1, nref);\r\n\t}\r\n#endif\r\n\telse if (st == IRT_I64 || st == IRT_U64) {  /* 64/64 bit cast. */\r\n\t  /* Drop cast, since assembler doesn't care. */\r\n\t  goto fwdlo;\r\n\t} else if ((ir->op2 & IRCONV_SEXT)) {  /* Sign-extend to 64 bit. */\r\n\t  IRRef k31 = lj_ir_kint(J, 31);\r\n\t  nir = IR(nref);  /* May have been reallocated. */\r\n\t  ir->prev = nir->op1;  /* Pass through loword. */\r\n\t  nir->o = IR_BSAR;  /* hi = bsar(lo, 31). */\r\n\t  nir->op2 = k31;\r\n\t  hi = nref;\r\n\t} else {  /* Zero-extend to 64 bit. */\r\n\t  hi = lj_ir_kint(J, 0);\r\n\t  goto fwdlo;\r\n\t}\r\n\tbreak;\r\n\t}\r\n      case IR_CALLXS:\r\n\tgoto split_call;\r\n      case IR_PHI: {\r\n\tIRRef hiref2;\r\n\tif ((irref_isk(nir->op1) && irref_isk(nir->op2)) ||\r\n\t    nir->op1 == nir->op2)\r\n\t  J->cur.nins--;  /* Drop useless PHIs. */\r\n\thiref2 = hisubst[ir->op2];\r\n\tif (!((irref_isk(hiref) && irref_isk(hiref2)) || hiref == hiref2))\r\n\t  split_emit(J, IRTI(IR_PHI), hiref, hiref2);\r\n\tbreak;\r\n\t}\r\n      case IR_HIOP:\r\n\tJ->cur.nins--;  /* Drop joining HIOP. */\r\n\tir->prev = nir->op1;\r\n\thi = nir->op2;\r\n\tbreak;\r\n      default:\r\n\tlua_assert(ir->o <= IR_NE);  /* Comparisons. */\r\n\tsplit_emit(J, IRTGI(IR_HIOP), hiref, hisubst[ir->op2]);\r\n\tbreak;\r\n      }\r\n    } else\r\n#endif\r\n#if LJ_SOFTFP\r\n    if (ir->o == IR_SLOAD) {\r\n      if ((nir->op2 & IRSLOAD_CONVERT)) {  /* Convert from number to int. */\r\n\tnir->op2 &= ~IRSLOAD_CONVERT;\r\n\tif (!(nir->op2 & IRSLOAD_TYPECHECK))\r\n\t  nir->t.irt = IRT_INT;  /* Drop guard. */\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_SOFTFP), nref, nref);\r\n\tir->prev = split_num2int(J, nref, nref+1, irt_isguard(ir->t));\r\n      }\r\n    } else if (ir->o == IR_TOBIT) {\r\n      IRRef tmp, op1 = ir->op1;\r\n      J->cur.nins--;\r\n#if LJ_LE\r\n      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), oir[op1].prev, hisubst[op1]);\r\n#else\r\n      tmp = split_emit(J, IRT(IR_CARG, IRT_NIL), hisubst[op1], oir[op1].prev);\r\n#endif\r\n      ir->prev = split_emit(J, IRTI(IR_CALLN), tmp, IRCALL_lj_vm_tobit);\r\n    } else if (ir->o == IR_TOSTR) {\r\n      if (hisubst[ir->op1]) {\r\n\tif (irref_isk(ir->op1))\r\n\t  nir->op1 = ir->op1;\r\n\telse\r\n\t  split_emit(J, IRT(IR_HIOP, IRT_NIL), hisubst[ir->op1], nref);\r\n      }\r\n    } else if (ir->o == IR_HREF || ir->o == IR_NEWREF) {\r\n      if (irref_isk(ir->op2) && hisubst[ir->op2])\r\n\tnir->op2 = ir->op2;\r\n    } else\r\n#endif\r\n    if (ir->o == IR_CONV) {  /* See above, too. */\r\n      IRType st = (IRType)(ir->op2 & IRCONV_SRCMASK);\r\n#if LJ_32 && LJ_HASFFI\r\n      if (st == IRT_I64 || st == IRT_U64) {  /* Conversion from 64 bit int. */\r\n#if LJ_SOFTFP\r\n\tif (irt_isfloat(ir->t)) {\r\n\t  split_call_l(J, hisubst, oir, ir,\r\n\t\t       st == IRT_I64 ? IRCALL_fp64_l2f : IRCALL_fp64_ul2f);\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t}\r\n#else\r\n\tif (irt_isfp(ir->t)) {  /* 64 bit integer to FP conversion. */\r\n\t  ir->prev = split_emit(J, IRT(IR_HIOP, irt_type(ir->t)),\r\n\t\t\t\thisubst[ir->op1], nref);\r\n\t}\r\n#endif\r\n\telse {  /* Truncate to lower 32 bits. */\r\n\tfwdlo:\r\n\t  ir->prev = nir->op1;  /* Forward loword. */\r\n\t  /* Replace with NOP to avoid messing up the snapshot logic. */\r\n\t  nir->ot = IRT(IR_NOP, IRT_NIL);\r\n\t  nir->op1 = nir->op2 = 0;\r\n\t}\r\n      }\r\n#endif\r\n#if LJ_SOFTFP && LJ_32 && LJ_HASFFI\r\n      else if (irt_isfloat(ir->t)) {\r\n\tif (st == IRT_NUM) {\r\n\t  split_call_l(J, hisubst, oir, ir, IRCALL_softfp_d2f);\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t} else {\r\n\t  nir->o = IR_CALLN;\r\n\t  nir->op2 = st == IRT_INT ? IRCALL_softfp_i2f : IRCALL_softfp_ui2f;\r\n\t}\r\n      } else if (st == IRT_FLOAT) {\r\n\tnir->o = IR_CALLN;\r\n\tnir->op2 = irt_isint(ir->t) ? IRCALL_softfp_f2i : IRCALL_softfp_f2ui;\r\n      } else\r\n#endif\r\n#if LJ_SOFTFP\r\n      if (st == IRT_NUM || (LJ_32 && LJ_HASFFI && st == IRT_FLOAT)) {\r\n\tif (irt_isguard(ir->t)) {\r\n\t  lua_assert(st == IRT_NUM && irt_isint(ir->t));\r\n\t  J->cur.nins--;\r\n\t  ir->prev = split_num2int(J, nir->op1, hisubst[ir->op1], 1);\r\n\t} else {\r\n\t  split_call_l(J, hisubst, oir, ir,\r\n#if LJ_32 && LJ_HASFFI\r\n\t    st == IRT_NUM ?\r\n\t      (irt_isint(ir->t) ? IRCALL_softfp_d2i : IRCALL_softfp_d2ui) :\r\n\t      (irt_isint(ir->t) ? IRCALL_softfp_f2i : IRCALL_softfp_f2ui)\r\n#else\r\n\t    IRCALL_softfp_d2i\r\n#endif\r\n\t  );\r\n\t  J->cur.nins--;  /* Drop unused HIOP. */\r\n\t}\r\n      }\r\n#endif\r\n    } else if (ir->o == IR_CALLXS) {\r\n      IRRef hiref;\r\n    split_call:\r\n      hiref = hisubst[ir->op1];\r\n      if (hiref) {\r\n\tIROpT ot = nir->ot;\r\n\tIRRef op2 = nir->op2;\r\n\tnir->ot = IRT(IR_CARG, IRT_NIL);\r\n#if LJ_LE\r\n\tnir->op2 = hiref;\r\n#else\r\n\tnir->op2 = nir->op1; nir->op1 = hiref;\r\n#endif\r\n\tir->prev = nref = split_emit(J, ot, nref, op2);\r\n      }\r\n      if (LJ_SOFTFP ? irt_is64(ir->t) : irt_isint64(ir->t))\r\n\thi = split_emit(J,\r\n\t  IRT(IR_HIOP, (LJ_SOFTFP && irt_isnum(ir->t)) ? IRT_SOFTFP : IRT_INT),\r\n\t  nref, nref);\r\n    } else if (ir->o == IR_CARG) {\r\n      IRRef hiref = hisubst[ir->op1];\r\n      if (hiref) {\r\n\tIRRef op2 = nir->op2;\r\n#if LJ_LE\r\n\tnir->op2 = hiref;\r\n#else\r\n\tnir->op2 = nir->op1; nir->op1 = hiref;\r\n#endif\r\n\tir->prev = nref = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, op2);\r\n\tnir = IR(nref);\r\n      }\r\n      hiref = hisubst[ir->op2];\r\n      if (hiref) {\r\n#if !LJ_TARGET_X86\r\n\tint carg = 0;\r\n\tIRIns *cir;\r\n\tfor (cir = IR(nir->op1); cir->o == IR_CARG; cir = IR(cir->op1))\r\n\t  carg++;\r\n\tif ((carg & 1) == 0) {  /* Align 64 bit arguments. */\r\n\t  IRRef op2 = nir->op2;\r\n\t  nir->op2 = REF_NIL;\r\n\t  nref = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, op2);\r\n\t  nir = IR(nref);\r\n\t}\r\n#endif\r\n#if LJ_BE\r\n\t{ IRRef tmp = nir->op2; nir->op2 = hiref; hiref = tmp; }\r\n#endif\r\n\tir->prev = split_emit(J, IRT(IR_CARG, IRT_NIL), nref, hiref);\r\n      }\r\n    } else if (ir->o == IR_CNEWI) {\r\n      if (hisubst[ir->op2])\r\n\tsplit_emit(J, IRT(IR_HIOP, IRT_NIL), nref, hisubst[ir->op2]);\r\n    } else if (ir->o == IR_LOOP) {\r\n      J->loopref = nref;  /* Needed by assembler. */\r\n    }\r\n    hisubst[ref] = hi;  /* Store hiword substitution. */\r\n  }\r\n  if (snref == nins) {  /* Substitution for last snapshot. */\r\n    snap->ref = J->cur.nins;\r\n    split_subst_snap(J, snap, oir);\r\n  }\r\n\r\n  /* Add PHI marks. */\r\n  for (ref = J->cur.nins-1; ref >= REF_FIRST; ref--) {\r\n    IRIns *ir = IR(ref);\r\n    if (ir->o != IR_PHI) break;\r\n    if (!irref_isk(ir->op1)) irt_setphi(IR(ir->op1)->t);\r\n    if (ir->op2 > J->loopref) irt_setphi(IR(ir->op2)->t);\r\n  }\r\n}\r\n\r\n/* Protected callback for split pass. */\r\nstatic TValue *cpsplit(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  split_ir(J);\r\n  UNUSED(L); UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\n#if defined(LUA_USE_ASSERT) || LJ_SOFTFP\r\n/* Slow, but sure way to check whether a SPLIT pass is needed. */\r\nstatic int split_needsplit(jit_State *J)\r\n{\r\n  IRIns *ir, *irend;\r\n  IRRef ref;\r\n  for (ir = IR(REF_FIRST), irend = IR(J->cur.nins); ir < irend; ir++)\r\n    if (LJ_SOFTFP ? irt_is64orfp(ir->t) : irt_isint64(ir->t))\r\n      return 1;\r\n  if (LJ_SOFTFP) {\r\n    for (ref = J->chain[IR_SLOAD]; ref; ref = IR(ref)->prev)\r\n      if ((IR(ref)->op2 & IRSLOAD_CONVERT))\r\n\treturn 1;\r\n    if (J->chain[IR_TOBIT])\r\n      return 1;\r\n  }\r\n  for (ref = J->chain[IR_CONV]; ref; ref = IR(ref)->prev) {\r\n    IRType st = (IR(ref)->op2 & IRCONV_SRCMASK);\r\n    if ((LJ_SOFTFP && (st == IRT_NUM || st == IRT_FLOAT)) ||\r\n\tst == IRT_I64 || st == IRT_U64)\r\n      return 1;\r\n  }\r\n  return 0;  /* Nope. */\r\n}\r\n#endif\r\n\r\n/* SPLIT pass. */\r\nvoid lj_opt_split(jit_State *J)\r\n{\r\n#if LJ_SOFTFP\r\n  if (!J->needsplit)\r\n    J->needsplit = split_needsplit(J);\r\n#else\r\n  lua_assert(J->needsplit >= split_needsplit(J));  /* Verify flag. */\r\n#endif\r\n  if (J->needsplit) {\r\n    int errcode = lj_vm_cpcall(J->L, NULL, J, cpsplit);\r\n    if (errcode) {\r\n      /* Completely reset the trace to avoid inconsistent dump on abort. */\r\n      J->cur.nins = J->cur.nk = REF_BASE;\r\n      J->cur.nsnap = 0;\r\n      lj_err_throw(J->L, errcode);  /* Propagate errors. */\r\n    }\r\n  }\r\n}\r\n\r\n#undef IR\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_parse.c",
    "content": "/*\r\n** Lua parser (source code -> bytecode).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_parse_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_strfmt.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_parse.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n\r\n/* -- Parser structures and definitions ----------------------------------- */\r\n\r\n/* Expression kinds. */\r\ntypedef enum {\r\n  /* Constant expressions must be first and in this order: */\r\n  VKNIL,\r\n  VKFALSE,\r\n  VKTRUE,\r\n  VKSTR,\t/* sval = string value */\r\n  VKNUM,\t/* nval = number value */\r\n  VKLAST = VKNUM,\r\n  VKCDATA,\t/* nval = cdata value, not treated as a constant expression */\r\n  /* Non-constant expressions follow: */\r\n  VLOCAL,\t/* info = local register, aux = vstack index */\r\n  VUPVAL,\t/* info = upvalue index, aux = vstack index */\r\n  VGLOBAL,\t/* sval = string value */\r\n  VINDEXED,\t/* info = table register, aux = index reg/byte/string const */\r\n  VJMP,\t\t/* info = instruction PC */\r\n  VRELOCABLE,\t/* info = instruction PC */\r\n  VNONRELOC,\t/* info = result register */\r\n  VCALL,\t/* info = instruction PC, aux = base */\r\n  VVOID\r\n} ExpKind;\r\n\r\n/* Expression descriptor. */\r\ntypedef struct ExpDesc {\r\n  union {\r\n    struct {\r\n      uint32_t info;\t/* Primary info. */\r\n      uint32_t aux;\t/* Secondary info. */\r\n    } s;\r\n    TValue nval;\t/* Number value. */\r\n    GCstr *sval;\t/* String value. */\r\n  } u;\r\n  ExpKind k;\r\n  BCPos t;\t\t/* True condition jump list. */\r\n  BCPos f;\t\t/* False condition jump list. */\r\n} ExpDesc;\r\n\r\n/* Macros for expressions. */\r\n#define expr_hasjump(e)\t\t((e)->t != (e)->f)\r\n\r\n#define expr_isk(e)\t\t((e)->k <= VKLAST)\r\n#define expr_isk_nojump(e)\t(expr_isk(e) && !expr_hasjump(e))\r\n#define expr_isnumk(e)\t\t((e)->k == VKNUM)\r\n#define expr_isnumk_nojump(e)\t(expr_isnumk(e) && !expr_hasjump(e))\r\n#define expr_isstrk(e)\t\t((e)->k == VKSTR)\r\n\r\n#define expr_numtv(e)\t\tcheck_exp(expr_isnumk((e)), &(e)->u.nval)\r\n#define expr_numberV(e)\t\tnumberVnum(expr_numtv((e)))\r\n\r\n/* Initialize expression. */\r\nstatic LJ_AINLINE void expr_init(ExpDesc *e, ExpKind k, uint32_t info)\r\n{\r\n  e->k = k;\r\n  e->u.s.info = info;\r\n  e->f = e->t = NO_JMP;\r\n}\r\n\r\n/* Check number constant for +-0. */\r\nstatic int expr_numiszero(ExpDesc *e)\r\n{\r\n  TValue *o = expr_numtv(e);\r\n  return tvisint(o) ? (intV(o) == 0) : tviszero(o);\r\n}\r\n\r\n/* Per-function linked list of scope blocks. */\r\ntypedef struct FuncScope {\r\n  struct FuncScope *prev;\t/* Link to outer scope. */\r\n  MSize vstart;\t\t\t/* Start of block-local variables. */\r\n  uint8_t nactvar;\t\t/* Number of active vars outside the scope. */\r\n  uint8_t flags;\t\t/* Scope flags. */\r\n} FuncScope;\r\n\r\n#define FSCOPE_LOOP\t\t0x01\t/* Scope is a (breakable) loop. */\r\n#define FSCOPE_BREAK\t\t0x02\t/* Break used in scope. */\r\n#define FSCOPE_GOLA\t\t0x04\t/* Goto or label used in scope. */\r\n#define FSCOPE_UPVAL\t\t0x08\t/* Upvalue in scope. */\r\n#define FSCOPE_NOCLOSE\t\t0x10\t/* Do not close upvalues. */\r\n\r\n#define NAME_BREAK\t\t((GCstr *)(uintptr_t)1)\r\n\r\n/* Index into variable stack. */\r\ntypedef uint16_t VarIndex;\r\n#define LJ_MAX_VSTACK\t\t(65536 - LJ_MAX_UPVAL)\r\n\r\n/* Variable/goto/label info. */\r\n#define VSTACK_VAR_RW\t\t0x01\t/* R/W variable. */\r\n#define VSTACK_GOTO\t\t0x02\t/* Pending goto. */\r\n#define VSTACK_LABEL\t\t0x04\t/* Label. */\r\n\r\n/* Per-function state. */\r\ntypedef struct FuncState {\r\n  GCtab *kt;\t\t\t/* Hash table for constants. */\r\n  LexState *ls;\t\t\t/* Lexer state. */\r\n  lua_State *L;\t\t\t/* Lua state. */\r\n  FuncScope *bl;\t\t/* Current scope. */\r\n  struct FuncState *prev;\t/* Enclosing function. */\r\n  BCPos pc;\t\t\t/* Next bytecode position. */\r\n  BCPos lasttarget;\t\t/* Bytecode position of last jump target. */\r\n  BCPos jpc;\t\t\t/* Pending jump list to next bytecode. */\r\n  BCReg freereg;\t\t/* First free register. */\r\n  BCReg nactvar;\t\t/* Number of active local variables. */\r\n  BCReg nkn, nkgc;\t\t/* Number of lua_Number/GCobj constants */\r\n  BCLine linedefined;\t\t/* First line of the function definition. */\r\n  BCInsLine *bcbase;\t\t/* Base of bytecode stack. */\r\n  BCPos bclim;\t\t\t/* Limit of bytecode stack. */\r\n  MSize vbase;\t\t\t/* Base of variable stack for this function. */\r\n  uint8_t flags;\t\t/* Prototype flags. */\r\n  uint8_t numparams;\t\t/* Number of parameters. */\r\n  uint8_t framesize;\t\t/* Fixed frame size. */\r\n  uint8_t nuv;\t\t\t/* Number of upvalues */\r\n  VarIndex varmap[LJ_MAX_LOCVAR];  /* Map from register to variable idx. */\r\n  VarIndex uvmap[LJ_MAX_UPVAL];\t/* Map from upvalue to variable idx. */\r\n  VarIndex uvtmp[LJ_MAX_UPVAL];\t/* Temporary upvalue map. */\r\n} FuncState;\r\n\r\n/* Binary and unary operators. ORDER OPR */\r\ntypedef enum BinOpr {\r\n  OPR_ADD, OPR_SUB, OPR_MUL, OPR_DIV, OPR_MOD, OPR_POW,  /* ORDER ARITH */\r\n  OPR_CONCAT,\r\n  OPR_NE, OPR_EQ,\r\n  OPR_LT, OPR_GE, OPR_LE, OPR_GT,\r\n  OPR_AND, OPR_OR,\r\n  OPR_NOBINOPR\r\n} BinOpr;\r\n\r\nLJ_STATIC_ASSERT((int)BC_ISGE-(int)BC_ISLT == (int)OPR_GE-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_ISLE-(int)BC_ISLT == (int)OPR_LE-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_ISGT-(int)BC_ISLT == (int)OPR_GT-(int)OPR_LT);\r\nLJ_STATIC_ASSERT((int)BC_SUBVV-(int)BC_ADDVV == (int)OPR_SUB-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_MULVV-(int)BC_ADDVV == (int)OPR_MUL-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_DIVVV-(int)BC_ADDVV == (int)OPR_DIV-(int)OPR_ADD);\r\nLJ_STATIC_ASSERT((int)BC_MODVV-(int)BC_ADDVV == (int)OPR_MOD-(int)OPR_ADD);\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\nLJ_NORET LJ_NOINLINE static void err_syntax(LexState *ls, ErrMsg em)\r\n{\r\n  lj_lex_error(ls, ls->tok, em);\r\n}\r\n\r\nLJ_NORET LJ_NOINLINE static void err_token(LexState *ls, LexToken tok)\r\n{\r\n  lj_lex_error(ls, ls->tok, LJ_ERR_XTOKEN, lj_lex_token2str(ls, tok));\r\n}\r\n\r\nLJ_NORET static void err_limit(FuncState *fs, uint32_t limit, const char *what)\r\n{\r\n  if (fs->linedefined == 0)\r\n    lj_lex_error(fs->ls, 0, LJ_ERR_XLIMM, limit, what);\r\n  else\r\n    lj_lex_error(fs->ls, 0, LJ_ERR_XLIMF, fs->linedefined, limit, what);\r\n}\r\n\r\n#define checklimit(fs, v, l, m)\t\tif ((v) >= (l)) err_limit(fs, l, m)\r\n#define checklimitgt(fs, v, l, m)\tif ((v) > (l)) err_limit(fs, l, m)\r\n#define checkcond(ls, c, em)\t\t{ if (!(c)) err_syntax(ls, em); }\r\n\r\n/* -- Management of constants --------------------------------------------- */\r\n\r\n/* Return bytecode encoding for primitive constant. */\r\n#define const_pri(e)\t\tcheck_exp((e)->k <= VKTRUE, (e)->k)\r\n\r\n#define tvhaskslot(o)\t((o)->u32.hi == 0)\r\n#define tvkslot(o)\t((o)->u32.lo)\r\n\r\n/* Add a number constant. */\r\nstatic BCReg const_num(FuncState *fs, ExpDesc *e)\r\n{\r\n  lua_State *L = fs->L;\r\n  TValue *o;\r\n  lua_assert(expr_isnumk(e));\r\n  o = lj_tab_set(L, fs->kt, &e->u.nval);\r\n  if (tvhaskslot(o))\r\n    return tvkslot(o);\r\n  o->u64 = fs->nkn;\r\n  return fs->nkn++;\r\n}\r\n\r\n/* Add a GC object constant. */\r\nstatic BCReg const_gc(FuncState *fs, GCobj *gc, uint32_t itype)\r\n{\r\n  lua_State *L = fs->L;\r\n  TValue key, *o;\r\n  setgcV(L, &key, gc, itype);\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  o = lj_tab_set(L, fs->kt, &key);\r\n  if (tvhaskslot(o))\r\n    return tvkslot(o);\r\n  o->u64 = fs->nkgc;\r\n  return fs->nkgc++;\r\n}\r\n\r\n/* Add a string constant. */\r\nstatic BCReg const_str(FuncState *fs, ExpDesc *e)\r\n{\r\n  lua_assert(expr_isstrk(e) || e->k == VGLOBAL);\r\n  return const_gc(fs, obj2gco(e->u.sval), LJ_TSTR);\r\n}\r\n\r\n/* Anchor string constant to avoid GC. */\r\nGCstr *lj_parse_keepstr(LexState *ls, const char *str, size_t len)\r\n{\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  lua_State *L = ls->L;\r\n  GCstr *s = lj_str_new(L, str, len);\r\n  TValue *tv = lj_tab_setstr(L, ls->fs->kt, s);\r\n  if (tvisnil(tv)) setboolV(tv, 1);\r\n  lj_gc_check(L);\r\n  return s;\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Anchor cdata to avoid GC. */\r\nvoid lj_parse_keepcdata(LexState *ls, TValue *tv, GCcdata *cd)\r\n{\r\n  /* NOBARRIER: the key is new or kept alive. */\r\n  lua_State *L = ls->L;\r\n  setcdataV(L, tv, cd);\r\n  setboolV(lj_tab_set(L, ls->fs->kt, tv), 1);\r\n}\r\n#endif\r\n\r\n/* -- Jump list handling -------------------------------------------------- */\r\n\r\n/* Get next element in jump list. */\r\nstatic BCPos jmp_next(FuncState *fs, BCPos pc)\r\n{\r\n  ptrdiff_t delta = bc_j(fs->bcbase[pc].ins);\r\n  if ((BCPos)delta == NO_JMP)\r\n    return NO_JMP;\r\n  else\r\n    return (BCPos)(((ptrdiff_t)pc+1)+delta);\r\n}\r\n\r\n/* Check if any of the instructions on the jump list produce no value. */\r\nstatic int jmp_novalue(FuncState *fs, BCPos list)\r\n{\r\n  for (; list != NO_JMP; list = jmp_next(fs, list)) {\r\n    BCIns p = fs->bcbase[list >= 1 ? list-1 : list].ins;\r\n    if (!(bc_op(p) == BC_ISTC || bc_op(p) == BC_ISFC || bc_a(p) == NO_REG))\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Patch register of test instructions. */\r\nstatic int jmp_patchtestreg(FuncState *fs, BCPos pc, BCReg reg)\r\n{\r\n  BCInsLine *ilp = &fs->bcbase[pc >= 1 ? pc-1 : pc];\r\n  BCOp op = bc_op(ilp->ins);\r\n  if (op == BC_ISTC || op == BC_ISFC) {\r\n    if (reg != NO_REG && reg != bc_d(ilp->ins)) {\r\n      setbc_a(&ilp->ins, reg);\r\n    } else {  /* Nothing to store or already in the right register. */\r\n      setbc_op(&ilp->ins, op+(BC_IST-BC_ISTC));\r\n      setbc_a(&ilp->ins, 0);\r\n    }\r\n  } else if (bc_a(ilp->ins) == NO_REG) {\r\n    if (reg == NO_REG) {\r\n      ilp->ins = BCINS_AJ(BC_JMP, bc_a(fs->bcbase[pc].ins), 0);\r\n    } else {\r\n      setbc_a(&ilp->ins, reg);\r\n      if (reg >= bc_a(ilp[1].ins))\r\n\tsetbc_a(&ilp[1].ins, reg+1);\r\n    }\r\n  } else {\r\n    return 0;  /* Cannot patch other instructions. */\r\n  }\r\n  return 1;\r\n}\r\n\r\n/* Drop values for all instructions on jump list. */\r\nstatic void jmp_dropval(FuncState *fs, BCPos list)\r\n{\r\n  for (; list != NO_JMP; list = jmp_next(fs, list))\r\n    jmp_patchtestreg(fs, list, NO_REG);\r\n}\r\n\r\n/* Patch jump instruction to target. */\r\nstatic void jmp_patchins(FuncState *fs, BCPos pc, BCPos dest)\r\n{\r\n  BCIns *jmp = &fs->bcbase[pc].ins;\r\n  BCPos offset = dest-(pc+1)+BCBIAS_J;\r\n  lua_assert(dest != NO_JMP);\r\n  if (offset > BCMAX_D)\r\n    err_syntax(fs->ls, LJ_ERR_XJUMP);\r\n  setbc_d(jmp, offset);\r\n}\r\n\r\n/* Append to jump list. */\r\nstatic void jmp_append(FuncState *fs, BCPos *l1, BCPos l2)\r\n{\r\n  if (l2 == NO_JMP) {\r\n    return;\r\n  } else if (*l1 == NO_JMP) {\r\n    *l1 = l2;\r\n  } else {\r\n    BCPos list = *l1;\r\n    BCPos next;\r\n    while ((next = jmp_next(fs, list)) != NO_JMP)  /* Find last element. */\r\n      list = next;\r\n    jmp_patchins(fs, list, l2);\r\n  }\r\n}\r\n\r\n/* Patch jump list and preserve produced values. */\r\nstatic void jmp_patchval(FuncState *fs, BCPos list, BCPos vtarget,\r\n\t\t\t BCReg reg, BCPos dtarget)\r\n{\r\n  while (list != NO_JMP) {\r\n    BCPos next = jmp_next(fs, list);\r\n    if (jmp_patchtestreg(fs, list, reg))\r\n      jmp_patchins(fs, list, vtarget);  /* Jump to target with value. */\r\n    else\r\n      jmp_patchins(fs, list, dtarget);  /* Jump to default target. */\r\n    list = next;\r\n  }\r\n}\r\n\r\n/* Jump to following instruction. Append to list of pending jumps. */\r\nstatic void jmp_tohere(FuncState *fs, BCPos list)\r\n{\r\n  fs->lasttarget = fs->pc;\r\n  jmp_append(fs, &fs->jpc, list);\r\n}\r\n\r\n/* Patch jump list to target. */\r\nstatic void jmp_patch(FuncState *fs, BCPos list, BCPos target)\r\n{\r\n  if (target == fs->pc) {\r\n    jmp_tohere(fs, list);\r\n  } else {\r\n    lua_assert(target < fs->pc);\r\n    jmp_patchval(fs, list, target, NO_REG, target);\r\n  }\r\n}\r\n\r\n/* -- Bytecode register allocator ----------------------------------------- */\r\n\r\n/* Bump frame size. */\r\nstatic void bcreg_bump(FuncState *fs, BCReg n)\r\n{\r\n  BCReg sz = fs->freereg + n;\r\n  if (sz > fs->framesize) {\r\n    if (sz >= LJ_MAX_SLOTS)\r\n      err_syntax(fs->ls, LJ_ERR_XSLOTS);\r\n    fs->framesize = (uint8_t)sz;\r\n  }\r\n}\r\n\r\n/* Reserve registers. */\r\nstatic void bcreg_reserve(FuncState *fs, BCReg n)\r\n{\r\n  bcreg_bump(fs, n);\r\n  fs->freereg += n;\r\n}\r\n\r\n/* Free register. */\r\nstatic void bcreg_free(FuncState *fs, BCReg reg)\r\n{\r\n  if (reg >= fs->nactvar) {\r\n    fs->freereg--;\r\n    lua_assert(reg == fs->freereg);\r\n  }\r\n}\r\n\r\n/* Free register for expression. */\r\nstatic void expr_free(FuncState *fs, ExpDesc *e)\r\n{\r\n  if (e->k == VNONRELOC)\r\n    bcreg_free(fs, e->u.s.info);\r\n}\r\n\r\n/* -- Bytecode emitter ---------------------------------------------------- */\r\n\r\n/* Emit bytecode instruction. */\r\nstatic BCPos bcemit_INS(FuncState *fs, BCIns ins)\r\n{\r\n  BCPos pc = fs->pc;\r\n  LexState *ls = fs->ls;\r\n  jmp_patchval(fs, fs->jpc, pc, NO_REG, pc);\r\n  fs->jpc = NO_JMP;\r\n  if (LJ_UNLIKELY(pc >= fs->bclim)) {\r\n    ptrdiff_t base = fs->bcbase - ls->bcstack;\r\n    checklimit(fs, ls->sizebcstack, LJ_MAX_BCINS, \"bytecode instructions\");\r\n    lj_mem_growvec(fs->L, ls->bcstack, ls->sizebcstack, LJ_MAX_BCINS,BCInsLine);\r\n    fs->bclim = (BCPos)(ls->sizebcstack - base);\r\n    fs->bcbase = ls->bcstack + base;\r\n  }\r\n  fs->bcbase[pc].ins = ins;\r\n  fs->bcbase[pc].line = ls->lastline;\r\n  fs->pc = pc+1;\r\n  return pc;\r\n}\r\n\r\n#define bcemit_ABC(fs, o, a, b, c)\tbcemit_INS(fs, BCINS_ABC(o, a, b, c))\r\n#define bcemit_AD(fs, o, a, d)\t\tbcemit_INS(fs, BCINS_AD(o, a, d))\r\n#define bcemit_AJ(fs, o, a, j)\t\tbcemit_INS(fs, BCINS_AJ(o, a, j))\r\n\r\n#define bcptr(fs, e)\t\t\t(&(fs)->bcbase[(e)->u.s.info].ins)\r\n\r\n/* -- Bytecode emitter for expressions ------------------------------------ */\r\n\r\n/* Discharge non-constant expression to any register. */\r\nstatic void expr_discharge(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCIns ins;\r\n  if (e->k == VUPVAL) {\r\n    ins = BCINS_AD(BC_UGET, 0, e->u.s.info);\r\n  } else if (e->k == VGLOBAL) {\r\n    ins = BCINS_AD(BC_GGET, 0, const_str(fs, e));\r\n  } else if (e->k == VINDEXED) {\r\n    BCReg rc = e->u.s.aux;\r\n    if ((int32_t)rc < 0) {\r\n      ins = BCINS_ABC(BC_TGETS, 0, e->u.s.info, ~rc);\r\n    } else if (rc > BCMAX_C) {\r\n      ins = BCINS_ABC(BC_TGETB, 0, e->u.s.info, rc-(BCMAX_C+1));\r\n    } else {\r\n      bcreg_free(fs, rc);\r\n      ins = BCINS_ABC(BC_TGETV, 0, e->u.s.info, rc);\r\n    }\r\n    bcreg_free(fs, e->u.s.info);\r\n  } else if (e->k == VCALL) {\r\n    e->u.s.info = e->u.s.aux;\r\n    e->k = VNONRELOC;\r\n    return;\r\n  } else if (e->k == VLOCAL) {\r\n    e->k = VNONRELOC;\r\n    return;\r\n  } else {\r\n    return;\r\n  }\r\n  e->u.s.info = bcemit_INS(fs, ins);\r\n  e->k = VRELOCABLE;\r\n}\r\n\r\n/* Emit bytecode to set a range of registers to nil. */\r\nstatic void bcemit_nil(FuncState *fs, BCReg from, BCReg n)\r\n{\r\n  if (fs->pc > fs->lasttarget) {  /* No jumps to current position? */\r\n    BCIns *ip = &fs->bcbase[fs->pc-1].ins;\r\n    BCReg pto, pfrom = bc_a(*ip);\r\n    switch (bc_op(*ip)) {  /* Try to merge with the previous instruction. */\r\n    case BC_KPRI:\r\n      if (bc_d(*ip) != ~LJ_TNIL) break;\r\n      if (from == pfrom) {\r\n\tif (n == 1) return;\r\n      } else if (from == pfrom+1) {\r\n\tfrom = pfrom;\r\n\tn++;\r\n      } else {\r\n\tbreak;\r\n      }\r\n      *ip = BCINS_AD(BC_KNIL, from, from+n-1);  /* Replace KPRI. */\r\n      return;\r\n    case BC_KNIL:\r\n      pto = bc_d(*ip);\r\n      if (pfrom <= from && from <= pto+1) {  /* Can we connect both ranges? */\r\n\tif (from+n-1 > pto)\r\n\t  setbc_d(ip, from+n-1);  /* Patch previous instruction range. */\r\n\treturn;\r\n      }\r\n      break;\r\n    default:\r\n      break;\r\n    }\r\n  }\r\n  /* Emit new instruction or replace old instruction. */\r\n  bcemit_INS(fs, n == 1 ? BCINS_AD(BC_KPRI, from, VKNIL) :\r\n\t\t\t  BCINS_AD(BC_KNIL, from, from+n-1));\r\n}\r\n\r\n/* Discharge an expression to a specific register. Ignore branches. */\r\nstatic void expr_toreg_nobranch(FuncState *fs, ExpDesc *e, BCReg reg)\r\n{\r\n  BCIns ins;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKSTR) {\r\n    ins = BCINS_AD(BC_KSTR, reg, const_str(fs, e));\r\n  } else if (e->k == VKNUM) {\r\n#if LJ_DUALNUM\r\n    cTValue *tv = expr_numtv(e);\r\n    if (tvisint(tv) && checki16(intV(tv)))\r\n      ins = BCINS_AD(BC_KSHORT, reg, (BCReg)(uint16_t)intV(tv));\r\n    else\r\n#else\r\n    lua_Number n = expr_numberV(e);\r\n    int32_t k = lj_num2int(n);\r\n    if (checki16(k) && n == (lua_Number)k)\r\n      ins = BCINS_AD(BC_KSHORT, reg, (BCReg)(uint16_t)k);\r\n    else\r\n#endif\r\n      ins = BCINS_AD(BC_KNUM, reg, const_num(fs, e));\r\n#if LJ_HASFFI\r\n  } else if (e->k == VKCDATA) {\r\n    fs->flags |= PROTO_FFI;\r\n    ins = BCINS_AD(BC_KCDATA, reg,\r\n\t\t   const_gc(fs, obj2gco(cdataV(&e->u.nval)), LJ_TCDATA));\r\n#endif\r\n  } else if (e->k == VRELOCABLE) {\r\n    setbc_a(bcptr(fs, e), reg);\r\n    goto noins;\r\n  } else if (e->k == VNONRELOC) {\r\n    if (reg == e->u.s.info)\r\n      goto noins;\r\n    ins = BCINS_AD(BC_MOV, reg, e->u.s.info);\r\n  } else if (e->k == VKNIL) {\r\n    bcemit_nil(fs, reg, 1);\r\n    goto noins;\r\n  } else if (e->k <= VKTRUE) {\r\n    ins = BCINS_AD(BC_KPRI, reg, const_pri(e));\r\n  } else {\r\n    lua_assert(e->k == VVOID || e->k == VJMP);\r\n    return;\r\n  }\r\n  bcemit_INS(fs, ins);\r\nnoins:\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic BCPos bcemit_jmp(FuncState *fs);\r\n\r\n/* Discharge an expression to a specific register. */\r\nstatic void expr_toreg(FuncState *fs, ExpDesc *e, BCReg reg)\r\n{\r\n  expr_toreg_nobranch(fs, e, reg);\r\n  if (e->k == VJMP)\r\n    jmp_append(fs, &e->t, e->u.s.info);  /* Add it to the true jump list. */\r\n  if (expr_hasjump(e)) {  /* Discharge expression with branches. */\r\n    BCPos jend, jfalse = NO_JMP, jtrue = NO_JMP;\r\n    if (jmp_novalue(fs, e->t) || jmp_novalue(fs, e->f)) {\r\n      BCPos jval = (e->k == VJMP) ? NO_JMP : bcemit_jmp(fs);\r\n      jfalse = bcemit_AD(fs, BC_KPRI, reg, VKFALSE);\r\n      bcemit_AJ(fs, BC_JMP, fs->freereg, 1);\r\n      jtrue = bcemit_AD(fs, BC_KPRI, reg, VKTRUE);\r\n      jmp_tohere(fs, jval);\r\n    }\r\n    jend = fs->pc;\r\n    fs->lasttarget = jend;\r\n    jmp_patchval(fs, e->f, jend, reg, jfalse);\r\n    jmp_patchval(fs, e->t, jend, reg, jtrue);\r\n  }\r\n  e->f = e->t = NO_JMP;\r\n  e->u.s.info = reg;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* Discharge an expression to the next free register. */\r\nstatic void expr_tonextreg(FuncState *fs, ExpDesc *e)\r\n{\r\n  expr_discharge(fs, e);\r\n  expr_free(fs, e);\r\n  bcreg_reserve(fs, 1);\r\n  expr_toreg(fs, e, fs->freereg - 1);\r\n}\r\n\r\n/* Discharge an expression to any register. */\r\nstatic BCReg expr_toanyreg(FuncState *fs, ExpDesc *e)\r\n{\r\n  expr_discharge(fs, e);\r\n  if (e->k == VNONRELOC) {\r\n    if (!expr_hasjump(e)) return e->u.s.info;  /* Already in a register. */\r\n    if (e->u.s.info >= fs->nactvar) {\r\n      expr_toreg(fs, e, e->u.s.info);  /* Discharge to temp. register. */\r\n      return e->u.s.info;\r\n    }\r\n  }\r\n  expr_tonextreg(fs, e);  /* Discharge to next register. */\r\n  return e->u.s.info;\r\n}\r\n\r\n/* Partially discharge expression to a value. */\r\nstatic void expr_toval(FuncState *fs, ExpDesc *e)\r\n{\r\n  if (expr_hasjump(e))\r\n    expr_toanyreg(fs, e);\r\n  else\r\n    expr_discharge(fs, e);\r\n}\r\n\r\n/* Emit store for LHS expression. */\r\nstatic void bcemit_store(FuncState *fs, ExpDesc *var, ExpDesc *e)\r\n{\r\n  BCIns ins;\r\n  if (var->k == VLOCAL) {\r\n    fs->ls->vstack[var->u.s.aux].info |= VSTACK_VAR_RW;\r\n    expr_free(fs, e);\r\n    expr_toreg(fs, e, var->u.s.info);\r\n    return;\r\n  } else if (var->k == VUPVAL) {\r\n    fs->ls->vstack[var->u.s.aux].info |= VSTACK_VAR_RW;\r\n    expr_toval(fs, e);\r\n    if (e->k <= VKTRUE)\r\n      ins = BCINS_AD(BC_USETP, var->u.s.info, const_pri(e));\r\n    else if (e->k == VKSTR)\r\n      ins = BCINS_AD(BC_USETS, var->u.s.info, const_str(fs, e));\r\n    else if (e->k == VKNUM)\r\n      ins = BCINS_AD(BC_USETN, var->u.s.info, const_num(fs, e));\r\n    else\r\n      ins = BCINS_AD(BC_USETV, var->u.s.info, expr_toanyreg(fs, e));\r\n  } else if (var->k == VGLOBAL) {\r\n    BCReg ra = expr_toanyreg(fs, e);\r\n    ins = BCINS_AD(BC_GSET, ra, const_str(fs, var));\r\n  } else {\r\n    BCReg ra, rc;\r\n    lua_assert(var->k == VINDEXED);\r\n    ra = expr_toanyreg(fs, e);\r\n    rc = var->u.s.aux;\r\n    if ((int32_t)rc < 0) {\r\n      ins = BCINS_ABC(BC_TSETS, ra, var->u.s.info, ~rc);\r\n    } else if (rc > BCMAX_C) {\r\n      ins = BCINS_ABC(BC_TSETB, ra, var->u.s.info, rc-(BCMAX_C+1));\r\n    } else {\r\n      /* Free late alloced key reg to avoid assert on free of value reg. */\r\n      /* This can only happen when called from expr_table(). */\r\n      lua_assert(e->k != VNONRELOC || ra < fs->nactvar ||\r\n\t\t rc < ra || (bcreg_free(fs, rc),1));\r\n      ins = BCINS_ABC(BC_TSETV, ra, var->u.s.info, rc);\r\n    }\r\n  }\r\n  bcemit_INS(fs, ins);\r\n  expr_free(fs, e);\r\n}\r\n\r\n/* Emit method lookup expression. */\r\nstatic void bcemit_method(FuncState *fs, ExpDesc *e, ExpDesc *key)\r\n{\r\n  BCReg idx, func, obj = expr_toanyreg(fs, e);\r\n  expr_free(fs, e);\r\n  func = fs->freereg;\r\n  bcemit_AD(fs, BC_MOV, func+1+LJ_FR2, obj);  /* Copy object to 1st argument. */\r\n  lua_assert(expr_isstrk(key));\r\n  idx = const_str(fs, key);\r\n  if (idx <= BCMAX_C) {\r\n    bcreg_reserve(fs, 2+LJ_FR2);\r\n    bcemit_ABC(fs, BC_TGETS, func, obj, idx);\r\n  } else {\r\n    bcreg_reserve(fs, 3+LJ_FR2);\r\n    bcemit_AD(fs, BC_KSTR, func+2+LJ_FR2, idx);\r\n    bcemit_ABC(fs, BC_TGETV, func, obj, func+2+LJ_FR2);\r\n    fs->freereg--;\r\n  }\r\n  e->u.s.info = func;\r\n  e->k = VNONRELOC;\r\n}\r\n\r\n/* -- Bytecode emitter for branches --------------------------------------- */\r\n\r\n/* Emit unconditional branch. */\r\nstatic BCPos bcemit_jmp(FuncState *fs)\r\n{\r\n  BCPos jpc = fs->jpc;\r\n  BCPos j = fs->pc - 1;\r\n  BCIns *ip = &fs->bcbase[j].ins;\r\n  fs->jpc = NO_JMP;\r\n  if ((int32_t)j >= (int32_t)fs->lasttarget && bc_op(*ip) == BC_UCLO) {\r\n    setbc_j(ip, NO_JMP);\r\n    fs->lasttarget = j+1;\r\n  } else {\r\n    j = bcemit_AJ(fs, BC_JMP, fs->freereg, NO_JMP);\r\n  }\r\n  jmp_append(fs, &j, jpc);\r\n  return j;\r\n}\r\n\r\n/* Invert branch condition of bytecode instruction. */\r\nstatic void invertcond(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCIns *ip = &fs->bcbase[e->u.s.info - 1].ins;\r\n  setbc_op(ip, bc_op(*ip)^1);\r\n}\r\n\r\n/* Emit conditional branch. */\r\nstatic BCPos bcemit_branch(FuncState *fs, ExpDesc *e, int cond)\r\n{\r\n  BCPos pc;\r\n  if (e->k == VRELOCABLE) {\r\n    BCIns *ip = bcptr(fs, e);\r\n    if (bc_op(*ip) == BC_NOT) {\r\n      *ip = BCINS_AD(cond ? BC_ISF : BC_IST, 0, bc_d(*ip));\r\n      return bcemit_jmp(fs);\r\n    }\r\n  }\r\n  if (e->k != VNONRELOC) {\r\n    bcreg_reserve(fs, 1);\r\n    expr_toreg_nobranch(fs, e, fs->freereg-1);\r\n  }\r\n  bcemit_AD(fs, cond ? BC_ISTC : BC_ISFC, NO_REG, e->u.s.info);\r\n  pc = bcemit_jmp(fs);\r\n  expr_free(fs, e);\r\n  return pc;\r\n}\r\n\r\n/* Emit branch on true condition. */\r\nstatic void bcemit_branch_t(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCPos pc;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKSTR || e->k == VKNUM || e->k == VKTRUE)\r\n    pc = NO_JMP;  /* Never jump. */\r\n  else if (e->k == VJMP)\r\n    invertcond(fs, e), pc = e->u.s.info;\r\n  else if (e->k == VKFALSE || e->k == VKNIL)\r\n    expr_toreg_nobranch(fs, e, NO_REG), pc = bcemit_jmp(fs);\r\n  else\r\n    pc = bcemit_branch(fs, e, 0);\r\n  jmp_append(fs, &e->f, pc);\r\n  jmp_tohere(fs, e->t);\r\n  e->t = NO_JMP;\r\n}\r\n\r\n/* Emit branch on false condition. */\r\nstatic void bcemit_branch_f(FuncState *fs, ExpDesc *e)\r\n{\r\n  BCPos pc;\r\n  expr_discharge(fs, e);\r\n  if (e->k == VKNIL || e->k == VKFALSE)\r\n    pc = NO_JMP;  /* Never jump. */\r\n  else if (e->k == VJMP)\r\n    pc = e->u.s.info;\r\n  else if (e->k == VKSTR || e->k == VKNUM || e->k == VKTRUE)\r\n    expr_toreg_nobranch(fs, e, NO_REG), pc = bcemit_jmp(fs);\r\n  else\r\n    pc = bcemit_branch(fs, e, 1);\r\n  jmp_append(fs, &e->t, pc);\r\n  jmp_tohere(fs, e->f);\r\n  e->f = NO_JMP;\r\n}\r\n\r\n/* -- Bytecode emitter for operators -------------------------------------- */\r\n\r\n/* Try constant-folding of arithmetic operators. */\r\nstatic int foldarith(BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  TValue o;\r\n  lua_Number n;\r\n  if (!expr_isnumk_nojump(e1) || !expr_isnumk_nojump(e2)) return 0;\r\n  n = lj_vm_foldarith(expr_numberV(e1), expr_numberV(e2), (int)opr-OPR_ADD);\r\n  setnumV(&o, n);\r\n  if (tvisnan(&o) || tvismzero(&o)) return 0;  /* Avoid NaN and -0 as consts. */\r\n  if (LJ_DUALNUM) {\r\n    int32_t k = lj_num2int(n);\r\n    if ((lua_Number)k == n) {\r\n      setintV(&e1->u.nval, k);\r\n      return 1;\r\n    }\r\n  }\r\n  setnumV(&e1->u.nval, n);\r\n  return 1;\r\n}\r\n\r\n/* Emit arithmetic operator. */\r\nstatic void bcemit_arith(FuncState *fs, BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  BCReg rb, rc, t;\r\n  uint32_t op;\r\n  if (foldarith(opr, e1, e2))\r\n    return;\r\n  if (opr == OPR_POW) {\r\n    op = BC_POW;\r\n    rc = expr_toanyreg(fs, e2);\r\n    rb = expr_toanyreg(fs, e1);\r\n  } else {\r\n    op = opr-OPR_ADD+BC_ADDVV;\r\n    /* Must discharge 2nd operand first since VINDEXED might free regs. */\r\n    expr_toval(fs, e2);\r\n    if (expr_isnumk(e2) && (rc = const_num(fs, e2)) <= BCMAX_C)\r\n      op -= BC_ADDVV-BC_ADDVN;\r\n    else\r\n      rc = expr_toanyreg(fs, e2);\r\n    /* 1st operand discharged by bcemit_binop_left, but need KNUM/KSHORT. */\r\n    lua_assert(expr_isnumk(e1) || e1->k == VNONRELOC);\r\n    expr_toval(fs, e1);\r\n    /* Avoid two consts to satisfy bytecode constraints. */\r\n    if (expr_isnumk(e1) && !expr_isnumk(e2) &&\r\n\t(t = const_num(fs, e1)) <= BCMAX_B) {\r\n      rb = rc; rc = t; op -= BC_ADDVV-BC_ADDNV;\r\n    } else {\r\n      rb = expr_toanyreg(fs, e1);\r\n    }\r\n  }\r\n  /* Using expr_free might cause asserts if the order is wrong. */\r\n  if (e1->k == VNONRELOC && e1->u.s.info >= fs->nactvar) fs->freereg--;\r\n  if (e2->k == VNONRELOC && e2->u.s.info >= fs->nactvar) fs->freereg--;\r\n  e1->u.s.info = bcemit_ABC(fs, op, 0, rb, rc);\r\n  e1->k = VRELOCABLE;\r\n}\r\n\r\n/* Emit comparison operator. */\r\nstatic void bcemit_comp(FuncState *fs, BinOpr opr, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  ExpDesc *eret = e1;\r\n  BCIns ins;\r\n  expr_toval(fs, e1);\r\n  if (opr == OPR_EQ || opr == OPR_NE) {\r\n    BCOp op = opr == OPR_EQ ? BC_ISEQV : BC_ISNEV;\r\n    BCReg ra;\r\n    if (expr_isk(e1)) { e1 = e2; e2 = eret; }  /* Need constant in 2nd arg. */\r\n    ra = expr_toanyreg(fs, e1);  /* First arg must be in a reg. */\r\n    expr_toval(fs, e2);\r\n    switch (e2->k) {\r\n    case VKNIL: case VKFALSE: case VKTRUE:\r\n      ins = BCINS_AD(op+(BC_ISEQP-BC_ISEQV), ra, const_pri(e2));\r\n      break;\r\n    case VKSTR:\r\n      ins = BCINS_AD(op+(BC_ISEQS-BC_ISEQV), ra, const_str(fs, e2));\r\n      break;\r\n    case VKNUM:\r\n      ins = BCINS_AD(op+(BC_ISEQN-BC_ISEQV), ra, const_num(fs, e2));\r\n      break;\r\n    default:\r\n      ins = BCINS_AD(op, ra, expr_toanyreg(fs, e2));\r\n      break;\r\n    }\r\n  } else {\r\n    uint32_t op = opr-OPR_LT+BC_ISLT;\r\n    BCReg ra, rd;\r\n    if ((op-BC_ISLT) & 1) {  /* GT -> LT, GE -> LE */\r\n      e1 = e2; e2 = eret;  /* Swap operands. */\r\n      op = ((op-BC_ISLT)^3)+BC_ISLT;\r\n      expr_toval(fs, e1);\r\n    }\r\n    rd = expr_toanyreg(fs, e2);\r\n    ra = expr_toanyreg(fs, e1);\r\n    ins = BCINS_AD(op, ra, rd);\r\n  }\r\n  /* Using expr_free might cause asserts if the order is wrong. */\r\n  if (e1->k == VNONRELOC && e1->u.s.info >= fs->nactvar) fs->freereg--;\r\n  if (e2->k == VNONRELOC && e2->u.s.info >= fs->nactvar) fs->freereg--;\r\n  bcemit_INS(fs, ins);\r\n  eret->u.s.info = bcemit_jmp(fs);\r\n  eret->k = VJMP;\r\n}\r\n\r\n/* Fixup left side of binary operator. */\r\nstatic void bcemit_binop_left(FuncState *fs, BinOpr op, ExpDesc *e)\r\n{\r\n  if (op == OPR_AND) {\r\n    bcemit_branch_t(fs, e);\r\n  } else if (op == OPR_OR) {\r\n    bcemit_branch_f(fs, e);\r\n  } else if (op == OPR_CONCAT) {\r\n    expr_tonextreg(fs, e);\r\n  } else if (op == OPR_EQ || op == OPR_NE) {\r\n    if (!expr_isk_nojump(e)) expr_toanyreg(fs, e);\r\n  } else {\r\n    if (!expr_isnumk_nojump(e)) expr_toanyreg(fs, e);\r\n  }\r\n}\r\n\r\n/* Emit binary operator. */\r\nstatic void bcemit_binop(FuncState *fs, BinOpr op, ExpDesc *e1, ExpDesc *e2)\r\n{\r\n  if (op <= OPR_POW) {\r\n    bcemit_arith(fs, op, e1, e2);\r\n  } else if (op == OPR_AND) {\r\n    lua_assert(e1->t == NO_JMP);  /* List must be closed. */\r\n    expr_discharge(fs, e2);\r\n    jmp_append(fs, &e2->f, e1->f);\r\n    *e1 = *e2;\r\n  } else if (op == OPR_OR) {\r\n    lua_assert(e1->f == NO_JMP);  /* List must be closed. */\r\n    expr_discharge(fs, e2);\r\n    jmp_append(fs, &e2->t, e1->t);\r\n    *e1 = *e2;\r\n  } else if (op == OPR_CONCAT) {\r\n    expr_toval(fs, e2);\r\n    if (e2->k == VRELOCABLE && bc_op(*bcptr(fs, e2)) == BC_CAT) {\r\n      lua_assert(e1->u.s.info == bc_b(*bcptr(fs, e2))-1);\r\n      expr_free(fs, e1);\r\n      setbc_b(bcptr(fs, e2), e1->u.s.info);\r\n      e1->u.s.info = e2->u.s.info;\r\n    } else {\r\n      expr_tonextreg(fs, e2);\r\n      expr_free(fs, e2);\r\n      expr_free(fs, e1);\r\n      e1->u.s.info = bcemit_ABC(fs, BC_CAT, 0, e1->u.s.info, e2->u.s.info);\r\n    }\r\n    e1->k = VRELOCABLE;\r\n  } else {\r\n    lua_assert(op == OPR_NE || op == OPR_EQ ||\r\n\t       op == OPR_LT || op == OPR_GE || op == OPR_LE || op == OPR_GT);\r\n    bcemit_comp(fs, op, e1, e2);\r\n  }\r\n}\r\n\r\n/* Emit unary operator. */\r\nstatic void bcemit_unop(FuncState *fs, BCOp op, ExpDesc *e)\r\n{\r\n  if (op == BC_NOT) {\r\n    /* Swap true and false lists. */\r\n    { BCPos temp = e->f; e->f = e->t; e->t = temp; }\r\n    jmp_dropval(fs, e->f);\r\n    jmp_dropval(fs, e->t);\r\n    expr_discharge(fs, e);\r\n    if (e->k == VKNIL || e->k == VKFALSE) {\r\n      e->k = VKTRUE;\r\n      return;\r\n    } else if (expr_isk(e) || (LJ_HASFFI && e->k == VKCDATA)) {\r\n      e->k = VKFALSE;\r\n      return;\r\n    } else if (e->k == VJMP) {\r\n      invertcond(fs, e);\r\n      return;\r\n    } else if (e->k == VRELOCABLE) {\r\n      bcreg_reserve(fs, 1);\r\n      setbc_a(bcptr(fs, e), fs->freereg-1);\r\n      e->u.s.info = fs->freereg-1;\r\n      e->k = VNONRELOC;\r\n    } else {\r\n      lua_assert(e->k == VNONRELOC);\r\n    }\r\n  } else {\r\n    lua_assert(op == BC_UNM || op == BC_LEN);\r\n    if (op == BC_UNM && !expr_hasjump(e)) {  /* Constant-fold negations. */\r\n#if LJ_HASFFI\r\n      if (e->k == VKCDATA) {  /* Fold in-place since cdata is not interned. */\r\n\tGCcdata *cd = cdataV(&e->u.nval);\r\n\tint64_t *p = (int64_t *)cdataptr(cd);\r\n\tif (cd->ctypeid == CTID_COMPLEX_DOUBLE)\r\n\t  p[1] ^= (int64_t)U64x(80000000,00000000);\r\n\telse\r\n\t  *p = -*p;\r\n\treturn;\r\n      } else\r\n#endif\r\n      if (expr_isnumk(e) && !expr_numiszero(e)) {  /* Avoid folding to -0. */\r\n\tTValue *o = expr_numtv(e);\r\n\tif (tvisint(o)) {\r\n\t  int32_t k = intV(o);\r\n\t  if (k == -k)\r\n\t    setnumV(o, -(lua_Number)k);\r\n\t  else\r\n\t    setintV(o, -k);\r\n\t  return;\r\n\t} else {\r\n\t  o->u64 ^= U64x(80000000,00000000);\r\n\t  return;\r\n\t}\r\n      }\r\n    }\r\n    expr_toanyreg(fs, e);\r\n  }\r\n  expr_free(fs, e);\r\n  e->u.s.info = bcemit_AD(fs, op, 0, e->u.s.info);\r\n  e->k = VRELOCABLE;\r\n}\r\n\r\n/* -- Lexer support ------------------------------------------------------- */\r\n\r\n/* Check and consume optional token. */\r\nstatic int lex_opt(LexState *ls, LexToken tok)\r\n{\r\n  if (ls->tok == tok) {\r\n    lj_lex_next(ls);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check and consume token. */\r\nstatic void lex_check(LexState *ls, LexToken tok)\r\n{\r\n  if (ls->tok != tok)\r\n    err_token(ls, tok);\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Check for matching token. */\r\nstatic void lex_match(LexState *ls, LexToken what, LexToken who, BCLine line)\r\n{\r\n  if (!lex_opt(ls, what)) {\r\n    if (line == ls->linenumber) {\r\n      err_token(ls, what);\r\n    } else {\r\n      const char *swhat = lj_lex_token2str(ls, what);\r\n      const char *swho = lj_lex_token2str(ls, who);\r\n      lj_lex_error(ls, ls->tok, LJ_ERR_XMATCH, swhat, swho, line);\r\n    }\r\n  }\r\n}\r\n\r\n/* Check for string token. */\r\nstatic GCstr *lex_str(LexState *ls)\r\n{\r\n  GCstr *s;\r\n  if (ls->tok != TK_name && (LJ_52 || ls->tok != TK_goto))\r\n    err_token(ls, TK_name);\r\n  s = strV(&ls->tokval);\r\n  lj_lex_next(ls);\r\n  return s;\r\n}\r\n\r\n/* -- Variable handling --------------------------------------------------- */\r\n\r\n#define var_get(ls, fs, i)\t((ls)->vstack[(fs)->varmap[(i)]])\r\n\r\n/* Define a new local variable. */\r\nstatic void var_new(LexState *ls, BCReg n, GCstr *name)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  MSize vtop = ls->vtop;\r\n  checklimit(fs, fs->nactvar+n, LJ_MAX_LOCVAR, \"local variables\");\r\n  if (LJ_UNLIKELY(vtop >= ls->sizevstack)) {\r\n    if (ls->sizevstack >= LJ_MAX_VSTACK)\r\n      lj_lex_error(ls, 0, LJ_ERR_XLIMC, LJ_MAX_VSTACK);\r\n    lj_mem_growvec(ls->L, ls->vstack, ls->sizevstack, LJ_MAX_VSTACK, VarInfo);\r\n  }\r\n  lua_assert((uintptr_t)name < VARNAME__MAX ||\r\n\t     lj_tab_getstr(fs->kt, name) != NULL);\r\n  /* NOBARRIER: name is anchored in fs->kt and ls->vstack is not a GCobj. */\r\n  setgcref(ls->vstack[vtop].name, obj2gco(name));\r\n  fs->varmap[fs->nactvar+n] = (uint16_t)vtop;\r\n  ls->vtop = vtop+1;\r\n}\r\n\r\n#define var_new_lit(ls, n, v) \\\r\n  var_new(ls, (n), lj_parse_keepstr(ls, \"\" v, sizeof(v)-1))\r\n\r\n#define var_new_fixed(ls, n, vn) \\\r\n  var_new(ls, (n), (GCstr *)(uintptr_t)(vn))\r\n\r\n/* Add local variables. */\r\nstatic void var_add(LexState *ls, BCReg nvars)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg nactvar = fs->nactvar;\r\n  while (nvars--) {\r\n    VarInfo *v = &var_get(ls, fs, nactvar);\r\n    v->startpc = fs->pc;\r\n    v->slot = nactvar++;\r\n    v->info = 0;\r\n  }\r\n  fs->nactvar = nactvar;\r\n}\r\n\r\n/* Remove local variables. */\r\nstatic void var_remove(LexState *ls, BCReg tolevel)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  while (fs->nactvar > tolevel)\r\n    var_get(ls, fs, --fs->nactvar).endpc = fs->pc;\r\n}\r\n\r\n/* Lookup local variable name. */\r\nstatic BCReg var_lookup_local(FuncState *fs, GCstr *n)\r\n{\r\n  int i;\r\n  for (i = fs->nactvar-1; i >= 0; i--) {\r\n    if (n == strref(var_get(fs->ls, fs, i).name))\r\n      return (BCReg)i;\r\n  }\r\n  return (BCReg)-1;  /* Not found. */\r\n}\r\n\r\n/* Lookup or add upvalue index. */\r\nstatic MSize var_lookup_uv(FuncState *fs, MSize vidx, ExpDesc *e)\r\n{\r\n  MSize i, n = fs->nuv;\r\n  for (i = 0; i < n; i++)\r\n    if (fs->uvmap[i] == vidx)\r\n      return i;  /* Already exists. */\r\n  /* Otherwise create a new one. */\r\n  checklimit(fs, fs->nuv, LJ_MAX_UPVAL, \"upvalues\");\r\n  lua_assert(e->k == VLOCAL || e->k == VUPVAL);\r\n  fs->uvmap[n] = (uint16_t)vidx;\r\n  fs->uvtmp[n] = (uint16_t)(e->k == VLOCAL ? vidx : LJ_MAX_VSTACK+e->u.s.info);\r\n  fs->nuv = n+1;\r\n  return n;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void fscope_uvmark(FuncState *fs, BCReg level);\r\n\r\n/* Recursively lookup variables in enclosing functions. */\r\nstatic MSize var_lookup_(FuncState *fs, GCstr *name, ExpDesc *e, int first)\r\n{\r\n  if (fs) {\r\n    BCReg reg = var_lookup_local(fs, name);\r\n    if ((int32_t)reg >= 0) {  /* Local in this function? */\r\n      expr_init(e, VLOCAL, reg);\r\n      if (!first)\r\n\tfscope_uvmark(fs, reg);  /* Scope now has an upvalue. */\r\n      return (MSize)(e->u.s.aux = (uint32_t)fs->varmap[reg]);\r\n    } else {\r\n      MSize vidx = var_lookup_(fs->prev, name, e, 0);  /* Var in outer func? */\r\n      if ((int32_t)vidx >= 0) {  /* Yes, make it an upvalue here. */\r\n\te->u.s.info = (uint8_t)var_lookup_uv(fs, vidx, e);\r\n\te->k = VUPVAL;\r\n\treturn vidx;\r\n      }\r\n    }\r\n  } else {  /* Not found in any function, must be a global. */\r\n    expr_init(e, VGLOBAL, 0);\r\n    e->u.sval = name;\r\n  }\r\n  return (MSize)-1;  /* Global. */\r\n}\r\n\r\n/* Lookup variable name. */\r\n#define var_lookup(ls, e) \\\r\n  var_lookup_((ls)->fs, lex_str(ls), (e), 1)\r\n\r\n/* -- Goto an label handling ---------------------------------------------- */\r\n\r\n/* Add a new goto or label. */\r\nstatic MSize gola_new(LexState *ls, GCstr *name, uint8_t info, BCPos pc)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  MSize vtop = ls->vtop;\r\n  if (LJ_UNLIKELY(vtop >= ls->sizevstack)) {\r\n    if (ls->sizevstack >= LJ_MAX_VSTACK)\r\n      lj_lex_error(ls, 0, LJ_ERR_XLIMC, LJ_MAX_VSTACK);\r\n    lj_mem_growvec(ls->L, ls->vstack, ls->sizevstack, LJ_MAX_VSTACK, VarInfo);\r\n  }\r\n  lua_assert(name == NAME_BREAK || lj_tab_getstr(fs->kt, name) != NULL);\r\n  /* NOBARRIER: name is anchored in fs->kt and ls->vstack is not a GCobj. */\r\n  setgcref(ls->vstack[vtop].name, obj2gco(name));\r\n  ls->vstack[vtop].startpc = pc;\r\n  ls->vstack[vtop].slot = (uint8_t)fs->nactvar;\r\n  ls->vstack[vtop].info = info;\r\n  ls->vtop = vtop+1;\r\n  return vtop;\r\n}\r\n\r\n#define gola_isgoto(v)\t\t((v)->info & VSTACK_GOTO)\r\n#define gola_islabel(v)\t\t((v)->info & VSTACK_LABEL)\r\n#define gola_isgotolabel(v)\t((v)->info & (VSTACK_GOTO|VSTACK_LABEL))\r\n\r\n/* Patch goto to jump to label. */\r\nstatic void gola_patch(LexState *ls, VarInfo *vg, VarInfo *vl)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos pc = vg->startpc;\r\n  setgcrefnull(vg->name);  /* Invalidate pending goto. */\r\n  setbc_a(&fs->bcbase[pc].ins, vl->slot);\r\n  jmp_patch(fs, pc, vl->startpc);\r\n}\r\n\r\n/* Patch goto to close upvalues. */\r\nstatic void gola_close(LexState *ls, VarInfo *vg)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos pc = vg->startpc;\r\n  BCIns *ip = &fs->bcbase[pc].ins;\r\n  lua_assert(gola_isgoto(vg));\r\n  lua_assert(bc_op(*ip) == BC_JMP || bc_op(*ip) == BC_UCLO);\r\n  setbc_a(ip, vg->slot);\r\n  if (bc_op(*ip) == BC_JMP) {\r\n    BCPos next = jmp_next(fs, pc);\r\n    if (next != NO_JMP) jmp_patch(fs, next, pc);  /* Jump to UCLO. */\r\n    setbc_op(ip, BC_UCLO);  /* Turn into UCLO. */\r\n    setbc_j(ip, NO_JMP);\r\n  }\r\n}\r\n\r\n/* Resolve pending forward gotos for label. */\r\nstatic void gola_resolve(LexState *ls, FuncScope *bl, MSize idx)\r\n{\r\n  VarInfo *vg = ls->vstack + bl->vstart;\r\n  VarInfo *vl = ls->vstack + idx;\r\n  for (; vg < vl; vg++)\r\n    if (gcrefeq(vg->name, vl->name) && gola_isgoto(vg)) {\r\n      if (vg->slot < vl->slot) {\r\n\tGCstr *name = strref(var_get(ls, ls->fs, vg->slot).name);\r\n\tlua_assert((uintptr_t)name >= VARNAME__MAX);\r\n\tls->linenumber = ls->fs->bcbase[vg->startpc].line;\r\n\tlua_assert(strref(vg->name) != NAME_BREAK);\r\n\tlj_lex_error(ls, 0, LJ_ERR_XGSCOPE,\r\n\t\t     strdata(strref(vg->name)), strdata(name));\r\n      }\r\n      gola_patch(ls, vg, vl);\r\n    }\r\n}\r\n\r\n/* Fixup remaining gotos and labels for scope. */\r\nstatic void gola_fixup(LexState *ls, FuncScope *bl)\r\n{\r\n  VarInfo *v = ls->vstack + bl->vstart;\r\n  VarInfo *ve = ls->vstack + ls->vtop;\r\n  for (; v < ve; v++) {\r\n    GCstr *name = strref(v->name);\r\n    if (name != NULL) {  /* Only consider remaining valid gotos/labels. */\r\n      if (gola_islabel(v)) {\r\n\tVarInfo *vg;\r\n\tsetgcrefnull(v->name);  /* Invalidate label that goes out of scope. */\r\n\tfor (vg = v+1; vg < ve; vg++)  /* Resolve pending backward gotos. */\r\n\t  if (strref(vg->name) == name && gola_isgoto(vg)) {\r\n\t    if ((bl->flags&FSCOPE_UPVAL) && vg->slot > v->slot)\r\n\t      gola_close(ls, vg);\r\n\t    gola_patch(ls, vg, v);\r\n\t  }\r\n      } else if (gola_isgoto(v)) {\r\n\tif (bl->prev) {  /* Propagate goto or break to outer scope. */\r\n\t  bl->prev->flags |= name == NAME_BREAK ? FSCOPE_BREAK : FSCOPE_GOLA;\r\n\t  v->slot = bl->nactvar;\r\n\t  if ((bl->flags & FSCOPE_UPVAL))\r\n\t    gola_close(ls, v);\r\n\t} else {  /* No outer scope: undefined goto label or no loop. */\r\n\t  ls->linenumber = ls->fs->bcbase[v->startpc].line;\r\n\t  if (name == NAME_BREAK)\r\n\t    lj_lex_error(ls, 0, LJ_ERR_XBREAK);\r\n\t  else\r\n\t    lj_lex_error(ls, 0, LJ_ERR_XLUNDEF, strdata(name));\r\n\t}\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Find existing label. */\r\nstatic VarInfo *gola_findlabel(LexState *ls, GCstr *name)\r\n{\r\n  VarInfo *v = ls->vstack + ls->fs->bl->vstart;\r\n  VarInfo *ve = ls->vstack + ls->vtop;\r\n  for (; v < ve; v++)\r\n    if (strref(v->name) == name && gola_islabel(v))\r\n      return v;\r\n  return NULL;\r\n}\r\n\r\n/* -- Scope handling ------------------------------------------------------ */\r\n\r\n/* Begin a scope. */\r\nstatic void fscope_begin(FuncState *fs, FuncScope *bl, int flags)\r\n{\r\n  bl->nactvar = (uint8_t)fs->nactvar;\r\n  bl->flags = flags;\r\n  bl->vstart = fs->ls->vtop;\r\n  bl->prev = fs->bl;\r\n  fs->bl = bl;\r\n  lua_assert(fs->freereg == fs->nactvar);\r\n}\r\n\r\n/* End a scope. */\r\nstatic void fscope_end(FuncState *fs)\r\n{\r\n  FuncScope *bl = fs->bl;\r\n  LexState *ls = fs->ls;\r\n  fs->bl = bl->prev;\r\n  var_remove(ls, bl->nactvar);\r\n  fs->freereg = fs->nactvar;\r\n  lua_assert(bl->nactvar == fs->nactvar);\r\n  if ((bl->flags & (FSCOPE_UPVAL|FSCOPE_NOCLOSE)) == FSCOPE_UPVAL)\r\n    bcemit_AJ(fs, BC_UCLO, bl->nactvar, 0);\r\n  if ((bl->flags & FSCOPE_BREAK)) {\r\n    if ((bl->flags & FSCOPE_LOOP)) {\r\n      MSize idx = gola_new(ls, NAME_BREAK, VSTACK_LABEL, fs->pc);\r\n      ls->vtop = idx;  /* Drop break label immediately. */\r\n      gola_resolve(ls, bl, idx);\r\n      return;\r\n    }  /* else: need the fixup step to propagate the breaks. */\r\n  } else if (!(bl->flags & FSCOPE_GOLA)) {\r\n    return;\r\n  }\r\n  gola_fixup(ls, bl);\r\n}\r\n\r\n/* Mark scope as having an upvalue. */\r\nstatic void fscope_uvmark(FuncState *fs, BCReg level)\r\n{\r\n  FuncScope *bl;\r\n  for (bl = fs->bl; bl && bl->nactvar > level; bl = bl->prev)\r\n    ;\r\n  if (bl)\r\n    bl->flags |= FSCOPE_UPVAL;\r\n}\r\n\r\n/* -- Function state management ------------------------------------------- */\r\n\r\n/* Fixup bytecode for prototype. */\r\nstatic void fs_fixup_bc(FuncState *fs, GCproto *pt, BCIns *bc, MSize n)\r\n{\r\n  BCInsLine *base = fs->bcbase;\r\n  MSize i;\r\n  pt->sizebc = n;\r\n  bc[0] = BCINS_AD((fs->flags & PROTO_VARARG) ? BC_FUNCV : BC_FUNCF,\r\n\t\t   fs->framesize, 0);\r\n  for (i = 1; i < n; i++)\r\n    bc[i] = base[i].ins;\r\n}\r\n\r\n/* Fixup upvalues for child prototype, step #2. */\r\nstatic void fs_fixup_uv2(FuncState *fs, GCproto *pt)\r\n{\r\n  VarInfo *vstack = fs->ls->vstack;\r\n  uint16_t *uv = proto_uv(pt);\r\n  MSize i, n = pt->sizeuv;\r\n  for (i = 0; i < n; i++) {\r\n    VarIndex vidx = uv[i];\r\n    if (vidx >= LJ_MAX_VSTACK)\r\n      uv[i] = vidx - LJ_MAX_VSTACK;\r\n    else if ((vstack[vidx].info & VSTACK_VAR_RW))\r\n      uv[i] = vstack[vidx].slot | PROTO_UV_LOCAL;\r\n    else\r\n      uv[i] = vstack[vidx].slot | PROTO_UV_LOCAL | PROTO_UV_IMMUTABLE;\r\n  }\r\n}\r\n\r\n/* Fixup constants for prototype. */\r\nstatic void fs_fixup_k(FuncState *fs, GCproto *pt, void *kptr)\r\n{\r\n  GCtab *kt;\r\n  TValue *array;\r\n  Node *node;\r\n  MSize i, hmask;\r\n  checklimitgt(fs, fs->nkn, BCMAX_D+1, \"constants\");\r\n  checklimitgt(fs, fs->nkgc, BCMAX_D+1, \"constants\");\r\n  setmref(pt->k, kptr);\r\n  pt->sizekn = fs->nkn;\r\n  pt->sizekgc = fs->nkgc;\r\n  kt = fs->kt;\r\n  array = tvref(kt->array);\r\n  for (i = 0; i < kt->asize; i++)\r\n    if (tvhaskslot(&array[i])) {\r\n      TValue *tv = &((TValue *)kptr)[tvkslot(&array[i])];\r\n      if (LJ_DUALNUM)\r\n\tsetintV(tv, (int32_t)i);\r\n      else\r\n\tsetnumV(tv, (lua_Number)i);\r\n    }\r\n  node = noderef(kt->node);\r\n  hmask = kt->hmask;\r\n  for (i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    if (tvhaskslot(&n->val)) {\r\n      ptrdiff_t kidx = (ptrdiff_t)tvkslot(&n->val);\r\n      lua_assert(!tvisint(&n->key));\r\n      if (tvisnum(&n->key)) {\r\n\tTValue *tv = &((TValue *)kptr)[kidx];\r\n\tif (LJ_DUALNUM) {\r\n\t  lua_Number nn = numV(&n->key);\r\n\t  int32_t k = lj_num2int(nn);\r\n\t  lua_assert(!tvismzero(&n->key));\r\n\t  if ((lua_Number)k == nn)\r\n\t    setintV(tv, k);\r\n\t  else\r\n\t    *tv = n->key;\r\n\t} else {\r\n\t  *tv = n->key;\r\n\t}\r\n      } else {\r\n\tGCobj *o = gcV(&n->key);\r\n\tsetgcref(((GCRef *)kptr)[~kidx], o);\r\n\tlj_gc_objbarrier(fs->L, pt, o);\r\n\tif (tvisproto(&n->key))\r\n\t  fs_fixup_uv2(fs, gco2pt(o));\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Fixup upvalues for prototype, step #1. */\r\nstatic void fs_fixup_uv1(FuncState *fs, GCproto *pt, uint16_t *uv)\r\n{\r\n  setmref(pt->uv, uv);\r\n  pt->sizeuv = fs->nuv;\r\n  memcpy(uv, fs->uvtmp, fs->nuv*sizeof(VarIndex));\r\n}\r\n\r\n#ifndef LUAJIT_DISABLE_DEBUGINFO\r\n/* Prepare lineinfo for prototype. */\r\nstatic size_t fs_prep_line(FuncState *fs, BCLine numline)\r\n{\r\n  return (fs->pc-1) << (numline < 256 ? 0 : numline < 65536 ? 1 : 2);\r\n}\r\n\r\n/* Fixup lineinfo for prototype. */\r\nstatic void fs_fixup_line(FuncState *fs, GCproto *pt,\r\n\t\t\t  void *lineinfo, BCLine numline)\r\n{\r\n  BCInsLine *base = fs->bcbase + 1;\r\n  BCLine first = fs->linedefined;\r\n  MSize i = 0, n = fs->pc-1;\r\n  pt->firstline = fs->linedefined;\r\n  pt->numline = numline;\r\n  setmref(pt->lineinfo, lineinfo);\r\n  if (LJ_LIKELY(numline < 256)) {\r\n    uint8_t *li = (uint8_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0 && delta < 256);\r\n      li[i] = (uint8_t)delta;\r\n    } while (++i < n);\r\n  } else if (LJ_LIKELY(numline < 65536)) {\r\n    uint16_t *li = (uint16_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0 && delta < 65536);\r\n      li[i] = (uint16_t)delta;\r\n    } while (++i < n);\r\n  } else {\r\n    uint32_t *li = (uint32_t *)lineinfo;\r\n    do {\r\n      BCLine delta = base[i].line - first;\r\n      lua_assert(delta >= 0);\r\n      li[i] = (uint32_t)delta;\r\n    } while (++i < n);\r\n  }\r\n}\r\n\r\n/* Prepare variable info for prototype. */\r\nstatic size_t fs_prep_var(LexState *ls, FuncState *fs, size_t *ofsvar)\r\n{\r\n  VarInfo *vs =ls->vstack, *ve;\r\n  MSize i, n;\r\n  BCPos lastpc;\r\n  lj_buf_reset(&ls->sb);  /* Copy to temp. string buffer. */\r\n  /* Store upvalue names. */\r\n  for (i = 0, n = fs->nuv; i < n; i++) {\r\n    GCstr *s = strref(vs[fs->uvmap[i]].name);\r\n    MSize len = s->len+1;\r\n    char *p = lj_buf_more(&ls->sb, len);\r\n    p = lj_buf_wmem(p, strdata(s), len);\r\n    setsbufP(&ls->sb, p);\r\n  }\r\n  *ofsvar = sbuflen(&ls->sb);\r\n  lastpc = 0;\r\n  /* Store local variable names and compressed ranges. */\r\n  for (ve = vs + ls->vtop, vs += fs->vbase; vs < ve; vs++) {\r\n    if (!gola_isgotolabel(vs)) {\r\n      GCstr *s = strref(vs->name);\r\n      BCPos startpc;\r\n      char *p;\r\n      if ((uintptr_t)s < VARNAME__MAX) {\r\n\tp = lj_buf_more(&ls->sb, 1 + 2*5);\r\n\t*p++ = (char)(uintptr_t)s;\r\n      } else {\r\n\tMSize len = s->len+1;\r\n\tp = lj_buf_more(&ls->sb, len + 2*5);\r\n\tp = lj_buf_wmem(p, strdata(s), len);\r\n      }\r\n      startpc = vs->startpc;\r\n      p = lj_strfmt_wuleb128(p, startpc-lastpc);\r\n      p = lj_strfmt_wuleb128(p, vs->endpc-startpc);\r\n      setsbufP(&ls->sb, p);\r\n      lastpc = startpc;\r\n    }\r\n  }\r\n  lj_buf_putb(&ls->sb, '\\0');  /* Terminator for varinfo. */\r\n  return sbuflen(&ls->sb);\r\n}\r\n\r\n/* Fixup variable info for prototype. */\r\nstatic void fs_fixup_var(LexState *ls, GCproto *pt, uint8_t *p, size_t ofsvar)\r\n{\r\n  setmref(pt->uvinfo, p);\r\n  setmref(pt->varinfo, (char *)p + ofsvar);\r\n  memcpy(p, sbufB(&ls->sb), sbuflen(&ls->sb));  /* Copy from temp. buffer. */\r\n}\r\n#else\r\n\r\n/* Initialize with empty debug info, if disabled. */\r\n#define fs_prep_line(fs, numline)\t\t(UNUSED(numline), 0)\r\n#define fs_fixup_line(fs, pt, li, numline) \\\r\n  pt->firstline = pt->numline = 0, setmref((pt)->lineinfo, NULL)\r\n#define fs_prep_var(ls, fs, ofsvar)\t\t(UNUSED(ofsvar), 0)\r\n#define fs_fixup_var(ls, pt, p, ofsvar) \\\r\n  setmref((pt)->uvinfo, NULL), setmref((pt)->varinfo, NULL)\r\n\r\n#endif\r\n\r\n/* Check if bytecode op returns. */\r\nstatic int bcopisret(BCOp op)\r\n{\r\n  switch (op) {\r\n  case BC_CALLMT: case BC_CALLT:\r\n  case BC_RETM: case BC_RET: case BC_RET0: case BC_RET1:\r\n    return 1;\r\n  default:\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Fixup return instruction for prototype. */\r\nstatic void fs_fixup_ret(FuncState *fs)\r\n{\r\n  BCPos lastpc = fs->pc;\r\n  if (lastpc <= fs->lasttarget || !bcopisret(bc_op(fs->bcbase[lastpc-1].ins))) {\r\n    if ((fs->bl->flags & FSCOPE_UPVAL))\r\n      bcemit_AJ(fs, BC_UCLO, 0, 0);\r\n    bcemit_AD(fs, BC_RET0, 0, 1);  /* Need final return. */\r\n  }\r\n  fs->bl->flags |= FSCOPE_NOCLOSE;  /* Handled above. */\r\n  fscope_end(fs);\r\n  lua_assert(fs->bl == NULL);\r\n  /* May need to fixup returns encoded before first function was created. */\r\n  if (fs->flags & PROTO_FIXUP_RETURN) {\r\n    BCPos pc;\r\n    for (pc = 1; pc < lastpc; pc++) {\r\n      BCIns ins = fs->bcbase[pc].ins;\r\n      BCPos offset;\r\n      switch (bc_op(ins)) {\r\n      case BC_CALLMT: case BC_CALLT:\r\n      case BC_RETM: case BC_RET: case BC_RET0: case BC_RET1:\r\n\toffset = bcemit_INS(fs, ins);  /* Copy original instruction. */\r\n\tfs->bcbase[offset].line = fs->bcbase[pc].line;\r\n\toffset = offset-(pc+1)+BCBIAS_J;\r\n\tif (offset > BCMAX_D)\r\n\t  err_syntax(fs->ls, LJ_ERR_XFIXUP);\r\n\t/* Replace with UCLO plus branch. */\r\n\tfs->bcbase[pc].ins = BCINS_AD(BC_UCLO, 0, offset);\r\n\tbreak;\r\n      case BC_UCLO:\r\n\treturn;  /* We're done. */\r\n      default:\r\n\tbreak;\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/* Finish a FuncState and return the new prototype. */\r\nstatic GCproto *fs_finish(LexState *ls, BCLine line)\r\n{\r\n  lua_State *L = ls->L;\r\n  FuncState *fs = ls->fs;\r\n  BCLine numline = line - fs->linedefined;\r\n  size_t sizept, ofsk, ofsuv, ofsli, ofsdbg, ofsvar;\r\n  GCproto *pt;\r\n\r\n  /* Apply final fixups. */\r\n  fs_fixup_ret(fs);\r\n\r\n  /* Calculate total size of prototype including all colocated arrays. */\r\n  sizept = sizeof(GCproto) + fs->pc*sizeof(BCIns) + fs->nkgc*sizeof(GCRef);\r\n  sizept = (sizept + sizeof(TValue)-1) & ~(sizeof(TValue)-1);\r\n  ofsk = sizept; sizept += fs->nkn*sizeof(TValue);\r\n  ofsuv = sizept; sizept += ((fs->nuv+1)&~1)*2;\r\n  ofsli = sizept; sizept += fs_prep_line(fs, numline);\r\n  ofsdbg = sizept; sizept += fs_prep_var(ls, fs, &ofsvar);\r\n\r\n  /* Allocate prototype and initialize its fields. */\r\n  pt = (GCproto *)lj_mem_newgco(L, (MSize)sizept);\r\n  pt->gct = ~LJ_TPROTO;\r\n  pt->sizept = (MSize)sizept;\r\n  pt->trace = 0;\r\n  pt->flags = (uint8_t)(fs->flags & ~(PROTO_HAS_RETURN|PROTO_FIXUP_RETURN));\r\n  pt->numparams = fs->numparams;\r\n  pt->framesize = fs->framesize;\r\n  setgcref(pt->chunkname, obj2gco(ls->chunkname));\r\n\r\n  /* Close potentially uninitialized gap between bc and kgc. */\r\n  *(uint32_t *)((char *)pt + ofsk - sizeof(GCRef)*(fs->nkgc+1)) = 0;\r\n  fs_fixup_bc(fs, pt, (BCIns *)((char *)pt + sizeof(GCproto)), fs->pc);\r\n  fs_fixup_k(fs, pt, (void *)((char *)pt + ofsk));\r\n  fs_fixup_uv1(fs, pt, (uint16_t *)((char *)pt + ofsuv));\r\n  fs_fixup_line(fs, pt, (void *)((char *)pt + ofsli), numline);\r\n  fs_fixup_var(ls, pt, (uint8_t *)((char *)pt + ofsdbg), ofsvar);\r\n\r\n  lj_vmevent_send(L, BC,\r\n    setprotoV(L, L->top++, pt);\r\n  );\r\n\r\n  L->top--;  /* Pop table of constants. */\r\n  ls->vtop = fs->vbase;  /* Reset variable stack. */\r\n  ls->fs = fs->prev;\r\n  lua_assert(ls->fs != NULL || ls->tok == TK_eof);\r\n  return pt;\r\n}\r\n\r\n/* Initialize a new FuncState. */\r\nstatic void fs_init(LexState *ls, FuncState *fs)\r\n{\r\n  lua_State *L = ls->L;\r\n  fs->prev = ls->fs; ls->fs = fs;  /* Append to list. */\r\n  fs->ls = ls;\r\n  fs->vbase = ls->vtop;\r\n  fs->L = L;\r\n  fs->pc = 0;\r\n  fs->lasttarget = 0;\r\n  fs->jpc = NO_JMP;\r\n  fs->freereg = 0;\r\n  fs->nkgc = 0;\r\n  fs->nkn = 0;\r\n  fs->nactvar = 0;\r\n  fs->nuv = 0;\r\n  fs->bl = NULL;\r\n  fs->flags = 0;\r\n  fs->framesize = 1;  /* Minimum frame size. */\r\n  fs->kt = lj_tab_new(L, 0, 0);\r\n  /* Anchor table of constants in stack to avoid being collected. */\r\n  settabV(L, L->top, fs->kt);\r\n  incr_top(L);\r\n}\r\n\r\n/* -- Expressions --------------------------------------------------------- */\r\n\r\n/* Forward declaration. */\r\nstatic void expr(LexState *ls, ExpDesc *v);\r\n\r\n/* Return string expression. */\r\nstatic void expr_str(LexState *ls, ExpDesc *e)\r\n{\r\n  expr_init(e, VKSTR, 0);\r\n  e->u.sval = lex_str(ls);\r\n}\r\n\r\n/* Return index expression. */\r\nstatic void expr_index(FuncState *fs, ExpDesc *t, ExpDesc *e)\r\n{\r\n  /* Already called: expr_toval(fs, e). */\r\n  t->k = VINDEXED;\r\n  if (expr_isnumk(e)) {\r\n#if LJ_DUALNUM\r\n    if (tvisint(expr_numtv(e))) {\r\n      int32_t k = intV(expr_numtv(e));\r\n      if (checku8(k)) {\r\n\tt->u.s.aux = BCMAX_C+1+(uint32_t)k;  /* 256..511: const byte key */\r\n\treturn;\r\n      }\r\n    }\r\n#else\r\n    lua_Number n = expr_numberV(e);\r\n    int32_t k = lj_num2int(n);\r\n    if (checku8(k) && n == (lua_Number)k) {\r\n      t->u.s.aux = BCMAX_C+1+(uint32_t)k;  /* 256..511: const byte key */\r\n      return;\r\n    }\r\n#endif\r\n  } else if (expr_isstrk(e)) {\r\n    BCReg idx = const_str(fs, e);\r\n    if (idx <= BCMAX_C) {\r\n      t->u.s.aux = ~idx;  /* -256..-1: const string key */\r\n      return;\r\n    }\r\n  }\r\n  t->u.s.aux = expr_toanyreg(fs, e);  /* 0..255: register */\r\n}\r\n\r\n/* Parse index expression with named field. */\r\nstatic void expr_field(LexState *ls, ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc key;\r\n  expr_toanyreg(fs, v);\r\n  lj_lex_next(ls);  /* Skip dot or colon. */\r\n  expr_str(ls, &key);\r\n  expr_index(fs, v, &key);\r\n}\r\n\r\n/* Parse index expression with brackets. */\r\nstatic void expr_bracket(LexState *ls, ExpDesc *v)\r\n{\r\n  lj_lex_next(ls);  /* Skip '['. */\r\n  expr(ls, v);\r\n  expr_toval(ls->fs, v);\r\n  lex_check(ls, ']');\r\n}\r\n\r\n/* Get value of constant expression. */\r\nstatic void expr_kvalue(TValue *v, ExpDesc *e)\r\n{\r\n  if (e->k <= VKTRUE) {\r\n    setpriV(v, ~(uint32_t)e->k);\r\n  } else if (e->k == VKSTR) {\r\n    setgcVraw(v, obj2gco(e->u.sval), LJ_TSTR);\r\n  } else {\r\n    lua_assert(tvisnumber(expr_numtv(e)));\r\n    *v = *expr_numtv(e);\r\n  }\r\n}\r\n\r\n/* Parse table constructor expression. */\r\nstatic void expr_table(LexState *ls, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCLine line = ls->linenumber;\r\n  GCtab *t = NULL;\r\n  int vcall = 0, needarr = 0, fixt = 0;\r\n  uint32_t narr = 1;  /* First array index. */\r\n  uint32_t nhash = 0;  /* Number of hash entries. */\r\n  BCReg freg = fs->freereg;\r\n  BCPos pc = bcemit_AD(fs, BC_TNEW, freg, 0);\r\n  expr_init(e, VNONRELOC, freg);\r\n  bcreg_reserve(fs, 1);\r\n  freg++;\r\n  lex_check(ls, '{');\r\n  while (ls->tok != '}') {\r\n    ExpDesc key, val;\r\n    vcall = 0;\r\n    if (ls->tok == '[') {\r\n      expr_bracket(ls, &key);  /* Already calls expr_toval. */\r\n      if (!expr_isk(&key)) expr_index(fs, e, &key);\r\n      if (expr_isnumk(&key) && expr_numiszero(&key)) needarr = 1; else nhash++;\r\n      lex_check(ls, '=');\r\n    } else if ((ls->tok == TK_name || (!LJ_52 && ls->tok == TK_goto)) &&\r\n\t       lj_lex_lookahead(ls) == '=') {\r\n      expr_str(ls, &key);\r\n      lex_check(ls, '=');\r\n      nhash++;\r\n    } else {\r\n      expr_init(&key, VKNUM, 0);\r\n      setintV(&key.u.nval, (int)narr);\r\n      narr++;\r\n      needarr = vcall = 1;\r\n    }\r\n    expr(ls, &val);\r\n    if (expr_isk(&key) && key.k != VKNIL &&\r\n\t(key.k == VKSTR || expr_isk_nojump(&val))) {\r\n      TValue k, *v;\r\n      if (!t) {  /* Create template table on demand. */\r\n\tBCReg kidx;\r\n\tt = lj_tab_new(fs->L, needarr ? narr : 0, hsize2hbits(nhash));\r\n\tkidx = const_gc(fs, obj2gco(t), LJ_TTAB);\r\n\tfs->bcbase[pc].ins = BCINS_AD(BC_TDUP, freg-1, kidx);\r\n      }\r\n      vcall = 0;\r\n      expr_kvalue(&k, &key);\r\n      v = lj_tab_set(fs->L, t, &k);\r\n      lj_gc_anybarriert(fs->L, t);\r\n      if (expr_isk_nojump(&val)) {  /* Add const key/value to template table. */\r\n\texpr_kvalue(v, &val);\r\n      } else {  /* Otherwise create dummy string key (avoids lj_tab_newkey). */\r\n\tsettabV(fs->L, v, t);  /* Preserve key with table itself as value. */\r\n\tfixt = 1;   /* Fix this later, after all resizes. */\r\n\tgoto nonconst;\r\n      }\r\n    } else {\r\n    nonconst:\r\n      if (val.k != VCALL) { expr_toanyreg(fs, &val); vcall = 0; }\r\n      if (expr_isk(&key)) expr_index(fs, e, &key);\r\n      bcemit_store(fs, e, &val);\r\n    }\r\n    fs->freereg = freg;\r\n    if (!lex_opt(ls, ',') && !lex_opt(ls, ';')) break;\r\n  }\r\n  lex_match(ls, '}', '{', line);\r\n  if (vcall) {\r\n    BCInsLine *ilp = &fs->bcbase[fs->pc-1];\r\n    ExpDesc en;\r\n    lua_assert(bc_a(ilp->ins) == freg &&\r\n\t       bc_op(ilp->ins) == (narr > 256 ? BC_TSETV : BC_TSETB));\r\n    expr_init(&en, VKNUM, 0);\r\n    en.u.nval.u32.lo = narr-1;\r\n    en.u.nval.u32.hi = 0x43300000;  /* Biased integer to avoid denormals. */\r\n    if (narr > 256) { fs->pc--; ilp--; }\r\n    ilp->ins = BCINS_AD(BC_TSETM, freg, const_num(fs, &en));\r\n    setbc_b(&ilp[-1].ins, 0);\r\n  }\r\n  if (pc == fs->pc-1) {  /* Make expr relocable if possible. */\r\n    e->u.s.info = pc;\r\n    fs->freereg--;\r\n    e->k = VRELOCABLE;\r\n  } else {\r\n    e->k = VNONRELOC;  /* May have been changed by expr_index. */\r\n  }\r\n  if (!t) {  /* Construct TNEW RD: hhhhhaaaaaaaaaaa. */\r\n    BCIns *ip = &fs->bcbase[pc].ins;\r\n    if (!needarr) narr = 0;\r\n    else if (narr < 3) narr = 3;\r\n    else if (narr > 0x7ff) narr = 0x7ff;\r\n    setbc_d(ip, narr|(hsize2hbits(nhash)<<11));\r\n  } else {\r\n    if (needarr && t->asize < narr)\r\n      lj_tab_reasize(fs->L, t, narr-1);\r\n    if (fixt) {  /* Fix value for dummy keys in template table. */\r\n      Node *node = noderef(t->node);\r\n      uint32_t i, hmask = t->hmask;\r\n      for (i = 0; i <= hmask; i++) {\r\n\tNode *n = &node[i];\r\n\tif (tvistab(&n->val)) {\r\n\t  lua_assert(tabV(&n->val) == t);\r\n\t  setnilV(&n->val);  /* Turn value into nil. */\r\n\t}\r\n      }\r\n    }\r\n    lj_gc_check(fs->L);\r\n  }\r\n}\r\n\r\n/* Parse function parameters. */\r\nstatic BCReg parse_params(LexState *ls, int needself)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg nparams = 0;\r\n  lex_check(ls, '(');\r\n  if (needself)\r\n    var_new_lit(ls, nparams++, \"self\");\r\n  if (ls->tok != ')') {\r\n    do {\r\n      if (ls->tok == TK_name || (!LJ_52 && ls->tok == TK_goto)) {\r\n\tvar_new(ls, nparams++, lex_str(ls));\r\n      } else if (ls->tok == TK_dots) {\r\n\tlj_lex_next(ls);\r\n\tfs->flags |= PROTO_VARARG;\r\n\tbreak;\r\n      } else {\r\n\terr_syntax(ls, LJ_ERR_XPARAM);\r\n      }\r\n    } while (lex_opt(ls, ','));\r\n  }\r\n  var_add(ls, nparams);\r\n  lua_assert(fs->nactvar == nparams);\r\n  bcreg_reserve(fs, nparams);\r\n  lex_check(ls, ')');\r\n  return nparams;\r\n}\r\n\r\n/* Forward declaration. */\r\nstatic void parse_chunk(LexState *ls);\r\n\r\n/* Parse body of a function. */\r\nstatic void parse_body(LexState *ls, ExpDesc *e, int needself, BCLine line)\r\n{\r\n  FuncState fs, *pfs = ls->fs;\r\n  FuncScope bl;\r\n  GCproto *pt;\r\n  ptrdiff_t oldbase = pfs->bcbase - ls->bcstack;\r\n  fs_init(ls, &fs);\r\n  fscope_begin(&fs, &bl, 0);\r\n  fs.linedefined = line;\r\n  fs.numparams = (uint8_t)parse_params(ls, needself);\r\n  fs.bcbase = pfs->bcbase + pfs->pc;\r\n  fs.bclim = pfs->bclim - pfs->pc;\r\n  bcemit_AD(&fs, BC_FUNCF, 0, 0);  /* Placeholder. */\r\n  parse_chunk(ls);\r\n  if (ls->tok != TK_end) lex_match(ls, TK_end, TK_function, line);\r\n  pt = fs_finish(ls, (ls->lastline = ls->linenumber));\r\n  pfs->bcbase = ls->bcstack + oldbase;  /* May have been reallocated. */\r\n  pfs->bclim = (BCPos)(ls->sizebcstack - oldbase);\r\n  /* Store new prototype in the constant array of the parent. */\r\n  expr_init(e, VRELOCABLE,\r\n\t    bcemit_AD(pfs, BC_FNEW, 0, const_gc(pfs, obj2gco(pt), LJ_TPROTO)));\r\n#if LJ_HASFFI\r\n  pfs->flags |= (fs.flags & PROTO_FFI);\r\n#endif\r\n  if (!(pfs->flags & PROTO_CHILD)) {\r\n    if (pfs->flags & PROTO_HAS_RETURN)\r\n      pfs->flags |= PROTO_FIXUP_RETURN;\r\n    pfs->flags |= PROTO_CHILD;\r\n  }\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Parse expression list. Last expression is left open. */\r\nstatic BCReg expr_list(LexState *ls, ExpDesc *v)\r\n{\r\n  BCReg n = 1;\r\n  expr(ls, v);\r\n  while (lex_opt(ls, ',')) {\r\n    expr_tonextreg(ls->fs, v);\r\n    expr(ls, v);\r\n    n++;\r\n  }\r\n  return n;\r\n}\r\n\r\n/* Parse function argument list. */\r\nstatic void parse_args(LexState *ls, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc args;\r\n  BCIns ins;\r\n  BCReg base;\r\n  BCLine line = ls->linenumber;\r\n  if (ls->tok == '(') {\r\n#if !LJ_52\r\n    if (line != ls->lastline)\r\n      err_syntax(ls, LJ_ERR_XAMBIG);\r\n#endif\r\n    lj_lex_next(ls);\r\n    if (ls->tok == ')') {  /* f(). */\r\n      args.k = VVOID;\r\n    } else {\r\n      expr_list(ls, &args);\r\n      if (args.k == VCALL)  /* f(a, b, g()) or f(a, b, ...). */\r\n\tsetbc_b(bcptr(fs, &args), 0);  /* Pass on multiple results. */\r\n    }\r\n    lex_match(ls, ')', '(', line);\r\n  } else if (ls->tok == '{') {\r\n    expr_table(ls, &args);\r\n  } else if (ls->tok == TK_string) {\r\n    expr_init(&args, VKSTR, 0);\r\n    args.u.sval = strV(&ls->tokval);\r\n    lj_lex_next(ls);\r\n  } else {\r\n    err_syntax(ls, LJ_ERR_XFUNARG);\r\n    return;  /* Silence compiler. */\r\n  }\r\n  lua_assert(e->k == VNONRELOC);\r\n  base = e->u.s.info;  /* Base register for call. */\r\n  if (args.k == VCALL) {\r\n    ins = BCINS_ABC(BC_CALLM, base, 2, args.u.s.aux - base - 1 - LJ_FR2);\r\n  } else {\r\n    if (args.k != VVOID)\r\n      expr_tonextreg(fs, &args);\r\n    ins = BCINS_ABC(BC_CALL, base, 2, fs->freereg - base - LJ_FR2);\r\n  }\r\n  expr_init(e, VCALL, bcemit_INS(fs, ins));\r\n  e->u.s.aux = base;\r\n  fs->bcbase[fs->pc - 1].line = line;\r\n  fs->freereg = base+1;  /* Leave one result by default. */\r\n}\r\n\r\n/* Parse primary expression. */\r\nstatic void expr_primary(LexState *ls, ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  /* Parse prefix expression. */\r\n  if (ls->tok == '(') {\r\n    BCLine line = ls->linenumber;\r\n    lj_lex_next(ls);\r\n    expr(ls, v);\r\n    lex_match(ls, ')', '(', line);\r\n    expr_discharge(ls->fs, v);\r\n  } else if (ls->tok == TK_name || (!LJ_52 && ls->tok == TK_goto)) {\r\n    var_lookup(ls, v);\r\n  } else {\r\n    err_syntax(ls, LJ_ERR_XSYMBOL);\r\n  }\r\n  for (;;) {  /* Parse multiple expression suffixes. */\r\n    if (ls->tok == '.') {\r\n      expr_field(ls, v);\r\n    } else if (ls->tok == '[') {\r\n      ExpDesc key;\r\n      expr_toanyreg(fs, v);\r\n      expr_bracket(ls, &key);\r\n      expr_index(fs, v, &key);\r\n    } else if (ls->tok == ':') {\r\n      ExpDesc key;\r\n      lj_lex_next(ls);\r\n      expr_str(ls, &key);\r\n      bcemit_method(fs, v, &key);\r\n      parse_args(ls, v);\r\n    } else if (ls->tok == '(' || ls->tok == TK_string || ls->tok == '{') {\r\n      expr_tonextreg(fs, v);\r\n      if (LJ_FR2) bcreg_reserve(fs, 1);\r\n      parse_args(ls, v);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n}\r\n\r\n/* Parse simple expression. */\r\nstatic void expr_simple(LexState *ls, ExpDesc *v)\r\n{\r\n  switch (ls->tok) {\r\n  case TK_number:\r\n    expr_init(v, (LJ_HASFFI && tviscdata(&ls->tokval)) ? VKCDATA : VKNUM, 0);\r\n    copyTV(ls->L, &v->u.nval, &ls->tokval);\r\n    break;\r\n  case TK_string:\r\n    expr_init(v, VKSTR, 0);\r\n    v->u.sval = strV(&ls->tokval);\r\n    break;\r\n  case TK_nil:\r\n    expr_init(v, VKNIL, 0);\r\n    break;\r\n  case TK_true:\r\n    expr_init(v, VKTRUE, 0);\r\n    break;\r\n  case TK_false:\r\n    expr_init(v, VKFALSE, 0);\r\n    break;\r\n  case TK_dots: {  /* Vararg. */\r\n    FuncState *fs = ls->fs;\r\n    BCReg base;\r\n    checkcond(ls, fs->flags & PROTO_VARARG, LJ_ERR_XDOTS);\r\n    bcreg_reserve(fs, 1);\r\n    base = fs->freereg-1;\r\n    expr_init(v, VCALL, bcemit_ABC(fs, BC_VARG, base, 2, fs->numparams));\r\n    v->u.s.aux = base;\r\n    break;\r\n  }\r\n  case '{':  /* Table constructor. */\r\n    expr_table(ls, v);\r\n    return;\r\n  case TK_function:\r\n    lj_lex_next(ls);\r\n    parse_body(ls, v, 0, ls->linenumber);\r\n    return;\r\n  default:\r\n    expr_primary(ls, v);\r\n    return;\r\n  }\r\n  lj_lex_next(ls);\r\n}\r\n\r\n/* Manage syntactic levels to avoid blowing up the stack. */\r\nstatic void synlevel_begin(LexState *ls)\r\n{\r\n  if (++ls->level >= LJ_MAX_XLEVEL)\r\n    lj_lex_error(ls, 0, LJ_ERR_XLEVELS);\r\n}\r\n\r\n#define synlevel_end(ls)\t((ls)->level--)\r\n\r\n/* Convert token to binary operator. */\r\nstatic BinOpr token2binop(LexToken tok)\r\n{\r\n  switch (tok) {\r\n  case '+':\treturn OPR_ADD;\r\n  case '-':\treturn OPR_SUB;\r\n  case '*':\treturn OPR_MUL;\r\n  case '/':\treturn OPR_DIV;\r\n  case '%':\treturn OPR_MOD;\r\n  case '^':\treturn OPR_POW;\r\n  case TK_concat: return OPR_CONCAT;\r\n  case TK_ne:\treturn OPR_NE;\r\n  case TK_eq:\treturn OPR_EQ;\r\n  case '<':\treturn OPR_LT;\r\n  case TK_le:\treturn OPR_LE;\r\n  case '>':\treturn OPR_GT;\r\n  case TK_ge:\treturn OPR_GE;\r\n  case TK_and:\treturn OPR_AND;\r\n  case TK_or:\treturn OPR_OR;\r\n  default:\treturn OPR_NOBINOPR;\r\n  }\r\n}\r\n\r\n/* Priorities for each binary operator. ORDER OPR. */\r\nstatic const struct {\r\n  uint8_t left;\t\t/* Left priority. */\r\n  uint8_t right;\t/* Right priority. */\r\n} priority[] = {\r\n  {6,6}, {6,6}, {7,7}, {7,7}, {7,7},\t/* ADD SUB MUL DIV MOD */\r\n  {10,9}, {5,4},\t\t\t/* POW CONCAT (right associative) */\r\n  {3,3}, {3,3},\t\t\t\t/* EQ NE */\r\n  {3,3}, {3,3}, {3,3}, {3,3},\t\t/* LT GE GT LE */\r\n  {2,2}, {1,1}\t\t\t\t/* AND OR */\r\n};\r\n\r\n#define UNARY_PRIORITY\t\t8  /* Priority for unary operators. */\r\n\r\n/* Forward declaration. */\r\nstatic BinOpr expr_binop(LexState *ls, ExpDesc *v, uint32_t limit);\r\n\r\n/* Parse unary expression. */\r\nstatic void expr_unop(LexState *ls, ExpDesc *v)\r\n{\r\n  BCOp op;\r\n  if (ls->tok == TK_not) {\r\n    op = BC_NOT;\r\n  } else if (ls->tok == '-') {\r\n    op = BC_UNM;\r\n  } else if (ls->tok == '#') {\r\n    op = BC_LEN;\r\n  } else {\r\n    expr_simple(ls, v);\r\n    return;\r\n  }\r\n  lj_lex_next(ls);\r\n  expr_binop(ls, v, UNARY_PRIORITY);\r\n  bcemit_unop(ls->fs, op, v);\r\n}\r\n\r\n/* Parse binary expressions with priority higher than the limit. */\r\nstatic BinOpr expr_binop(LexState *ls, ExpDesc *v, uint32_t limit)\r\n{\r\n  BinOpr op;\r\n  synlevel_begin(ls);\r\n  expr_unop(ls, v);\r\n  op = token2binop(ls->tok);\r\n  while (op != OPR_NOBINOPR && priority[op].left > limit) {\r\n    ExpDesc v2;\r\n    BinOpr nextop;\r\n    lj_lex_next(ls);\r\n    bcemit_binop_left(ls->fs, op, v);\r\n    /* Parse binary expression with higher priority. */\r\n    nextop = expr_binop(ls, &v2, priority[op].right);\r\n    bcemit_binop(ls->fs, op, v, &v2);\r\n    op = nextop;\r\n  }\r\n  synlevel_end(ls);\r\n  return op;  /* Return unconsumed binary operator (if any). */\r\n}\r\n\r\n/* Parse expression. */\r\nstatic void expr(LexState *ls, ExpDesc *v)\r\n{\r\n  expr_binop(ls, v, 0);  /* Priority 0: parse whole expression. */\r\n}\r\n\r\n/* Assign expression to the next register. */\r\nstatic void expr_next(LexState *ls)\r\n{\r\n  ExpDesc e;\r\n  expr(ls, &e);\r\n  expr_tonextreg(ls->fs, &e);\r\n}\r\n\r\n/* Parse conditional expression. */\r\nstatic BCPos expr_cond(LexState *ls)\r\n{\r\n  ExpDesc v;\r\n  expr(ls, &v);\r\n  if (v.k == VKNIL) v.k = VKFALSE;\r\n  bcemit_branch_t(ls->fs, &v);\r\n  return v.f;\r\n}\r\n\r\n/* -- Assignments --------------------------------------------------------- */\r\n\r\n/* List of LHS variables. */\r\ntypedef struct LHSVarList {\r\n  ExpDesc v;\t\t\t/* LHS variable. */\r\n  struct LHSVarList *prev;\t/* Link to previous LHS variable. */\r\n} LHSVarList;\r\n\r\n/* Eliminate write-after-read hazards for local variable assignment. */\r\nstatic void assign_hazard(LexState *ls, LHSVarList *lh, const ExpDesc *v)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg reg = v->u.s.info;  /* Check against this variable. */\r\n  BCReg tmp = fs->freereg;  /* Rename to this temp. register (if needed). */\r\n  int hazard = 0;\r\n  for (; lh; lh = lh->prev) {\r\n    if (lh->v.k == VINDEXED) {\r\n      if (lh->v.u.s.info == reg) {  /* t[i], t = 1, 2 */\r\n\thazard = 1;\r\n\tlh->v.u.s.info = tmp;\r\n      }\r\n      if (lh->v.u.s.aux == reg) {  /* t[i], i = 1, 2 */\r\n\thazard = 1;\r\n\tlh->v.u.s.aux = tmp;\r\n      }\r\n    }\r\n  }\r\n  if (hazard) {\r\n    bcemit_AD(fs, BC_MOV, tmp, reg);  /* Rename conflicting variable. */\r\n    bcreg_reserve(fs, 1);\r\n  }\r\n}\r\n\r\n/* Adjust LHS/RHS of an assignment. */\r\nstatic void assign_adjust(LexState *ls, BCReg nvars, BCReg nexps, ExpDesc *e)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  int32_t extra = (int32_t)nvars - (int32_t)nexps;\r\n  if (e->k == VCALL) {\r\n    extra++;  /* Compensate for the VCALL itself. */\r\n    if (extra < 0) extra = 0;\r\n    setbc_b(bcptr(fs, e), extra+1);  /* Fixup call results. */\r\n    if (extra > 1) bcreg_reserve(fs, (BCReg)extra-1);\r\n  } else {\r\n    if (e->k != VVOID)\r\n      expr_tonextreg(fs, e);  /* Close last expression. */\r\n    if (extra > 0) {  /* Leftover LHS are set to nil. */\r\n      BCReg reg = fs->freereg;\r\n      bcreg_reserve(fs, (BCReg)extra);\r\n      bcemit_nil(fs, reg, (BCReg)extra);\r\n    }\r\n  }\r\n}\r\n\r\n/* Recursively parse assignment statement. */\r\nstatic void parse_assignment(LexState *ls, LHSVarList *lh, BCReg nvars)\r\n{\r\n  ExpDesc e;\r\n  checkcond(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED, LJ_ERR_XSYNTAX);\r\n  if (lex_opt(ls, ',')) {  /* Collect LHS list and recurse upwards. */\r\n    LHSVarList vl;\r\n    vl.prev = lh;\r\n    expr_primary(ls, &vl.v);\r\n    if (vl.v.k == VLOCAL)\r\n      assign_hazard(ls, lh, &vl.v);\r\n    checklimit(ls->fs, ls->level + nvars, LJ_MAX_XLEVEL, \"variable names\");\r\n    parse_assignment(ls, &vl, nvars+1);\r\n  } else {  /* Parse RHS. */\r\n    BCReg nexps;\r\n    lex_check(ls, '=');\r\n    nexps = expr_list(ls, &e);\r\n    if (nexps == nvars) {\r\n      if (e.k == VCALL) {\r\n\tif (bc_op(*bcptr(ls->fs, &e)) == BC_VARG) {  /* Vararg assignment. */\r\n\t  ls->fs->freereg--;\r\n\t  e.k = VRELOCABLE;\r\n\t} else {  /* Multiple call results. */\r\n\t  e.u.s.info = e.u.s.aux;  /* Base of call is not relocatable. */\r\n\t  e.k = VNONRELOC;\r\n\t}\r\n      }\r\n      bcemit_store(ls->fs, &lh->v, &e);\r\n      return;\r\n    }\r\n    assign_adjust(ls, nvars, nexps, &e);\r\n    if (nexps > nvars)\r\n      ls->fs->freereg -= nexps - nvars;  /* Drop leftover regs. */\r\n  }\r\n  /* Assign RHS to LHS and recurse downwards. */\r\n  expr_init(&e, VNONRELOC, ls->fs->freereg-1);\r\n  bcemit_store(ls->fs, &lh->v, &e);\r\n}\r\n\r\n/* Parse call statement or assignment. */\r\nstatic void parse_call_assign(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  LHSVarList vl;\r\n  expr_primary(ls, &vl.v);\r\n  if (vl.v.k == VCALL) {  /* Function call statement. */\r\n    setbc_b(bcptr(fs, &vl.v), 1);  /* No results. */\r\n  } else {  /* Start of an assignment. */\r\n    vl.prev = NULL;\r\n    parse_assignment(ls, &vl, 1);\r\n  }\r\n}\r\n\r\n/* Parse 'local' statement. */\r\nstatic void parse_local(LexState *ls)\r\n{\r\n  if (lex_opt(ls, TK_function)) {  /* Local function declaration. */\r\n    ExpDesc v, b;\r\n    FuncState *fs = ls->fs;\r\n    var_new(ls, 0, lex_str(ls));\r\n    expr_init(&v, VLOCAL, fs->freereg);\r\n    v.u.s.aux = fs->varmap[fs->freereg];\r\n    bcreg_reserve(fs, 1);\r\n    var_add(ls, 1);\r\n    parse_body(ls, &b, 0, ls->linenumber);\r\n    /* bcemit_store(fs, &v, &b) without setting VSTACK_VAR_RW. */\r\n    expr_free(fs, &b);\r\n    expr_toreg(fs, &b, v.u.s.info);\r\n    /* The upvalue is in scope, but the local is only valid after the store. */\r\n    var_get(ls, fs, fs->nactvar - 1).startpc = fs->pc;\r\n  } else {  /* Local variable declaration. */\r\n    ExpDesc e;\r\n    BCReg nexps, nvars = 0;\r\n    do {  /* Collect LHS. */\r\n      var_new(ls, nvars++, lex_str(ls));\r\n    } while (lex_opt(ls, ','));\r\n    if (lex_opt(ls, '=')) {  /* Optional RHS. */\r\n      nexps = expr_list(ls, &e);\r\n    } else {  /* Or implicitly set to nil. */\r\n      e.k = VVOID;\r\n      nexps = 0;\r\n    }\r\n    assign_adjust(ls, nvars, nexps, &e);\r\n    var_add(ls, nvars);\r\n  }\r\n}\r\n\r\n/* Parse 'function' statement. */\r\nstatic void parse_func(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs;\r\n  ExpDesc v, b;\r\n  int needself = 0;\r\n  lj_lex_next(ls);  /* Skip 'function'. */\r\n  /* Parse function name. */\r\n  var_lookup(ls, &v);\r\n  while (ls->tok == '.')  /* Multiple dot-separated fields. */\r\n    expr_field(ls, &v);\r\n  if (ls->tok == ':') {  /* Optional colon to signify method call. */\r\n    needself = 1;\r\n    expr_field(ls, &v);\r\n  }\r\n  parse_body(ls, &b, needself, line);\r\n  fs = ls->fs;\r\n  bcemit_store(fs, &v, &b);\r\n  fs->bcbase[fs->pc - 1].line = line;  /* Set line for the store. */\r\n}\r\n\r\n/* -- Control transfer statements ----------------------------------------- */\r\n\r\n/* Check for end of block. */\r\nstatic int parse_isend(LexToken tok)\r\n{\r\n  switch (tok) {\r\n  case TK_else: case TK_elseif: case TK_end: case TK_until: case TK_eof:\r\n    return 1;\r\n  default:\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* Parse 'return' statement. */\r\nstatic void parse_return(LexState *ls)\r\n{\r\n  BCIns ins;\r\n  FuncState *fs = ls->fs;\r\n  lj_lex_next(ls);  /* Skip 'return'. */\r\n  fs->flags |= PROTO_HAS_RETURN;\r\n  if (parse_isend(ls->tok) || ls->tok == ';') {  /* Bare return. */\r\n    ins = BCINS_AD(BC_RET0, 0, 1);\r\n  } else {  /* Return with one or more values. */\r\n    ExpDesc e;  /* Receives the _last_ expression in the list. */\r\n    BCReg nret = expr_list(ls, &e);\r\n    if (nret == 1) {  /* Return one result. */\r\n      if (e.k == VCALL) {  /* Check for tail call. */\r\n\tBCIns *ip = bcptr(fs, &e);\r\n\t/* It doesn't pay off to add BC_VARGT just for 'return ...'. */\r\n\tif (bc_op(*ip) == BC_VARG) goto notailcall;\r\n\tfs->pc--;\r\n\tins = BCINS_AD(bc_op(*ip)-BC_CALL+BC_CALLT, bc_a(*ip), bc_c(*ip));\r\n      } else {  /* Can return the result from any register. */\r\n\tins = BCINS_AD(BC_RET1, expr_toanyreg(fs, &e), 2);\r\n      }\r\n    } else {\r\n      if (e.k == VCALL) {  /* Append all results from a call. */\r\n      notailcall:\r\n\tsetbc_b(bcptr(fs, &e), 0);\r\n\tins = BCINS_AD(BC_RETM, fs->nactvar, e.u.s.aux - fs->nactvar);\r\n      } else {\r\n\texpr_tonextreg(fs, &e);  /* Force contiguous registers. */\r\n\tins = BCINS_AD(BC_RET, fs->nactvar, nret+1);\r\n      }\r\n    }\r\n  }\r\n  if (fs->flags & PROTO_CHILD)\r\n    bcemit_AJ(fs, BC_UCLO, 0, 0);  /* May need to close upvalues first. */\r\n  bcemit_INS(fs, ins);\r\n}\r\n\r\n/* Parse 'break' statement. */\r\nstatic void parse_break(LexState *ls)\r\n{\r\n  ls->fs->bl->flags |= FSCOPE_BREAK;\r\n  gola_new(ls, NAME_BREAK, VSTACK_GOTO, bcemit_jmp(ls->fs));\r\n}\r\n\r\n/* Parse 'goto' statement. */\r\nstatic void parse_goto(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *name = lex_str(ls);\r\n  VarInfo *vl = gola_findlabel(ls, name);\r\n  if (vl)  /* Treat backwards goto within same scope like a loop. */\r\n    bcemit_AJ(fs, BC_LOOP, vl->slot, -1);  /* No BC range check. */\r\n  fs->bl->flags |= FSCOPE_GOLA;\r\n  gola_new(ls, name, VSTACK_GOTO, bcemit_jmp(fs));\r\n}\r\n\r\n/* Parse label. */\r\nstatic void parse_label(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *name;\r\n  MSize idx;\r\n  fs->lasttarget = fs->pc;\r\n  fs->bl->flags |= FSCOPE_GOLA;\r\n  lj_lex_next(ls);  /* Skip '::'. */\r\n  name = lex_str(ls);\r\n  if (gola_findlabel(ls, name))\r\n    lj_lex_error(ls, 0, LJ_ERR_XLDUP, strdata(name));\r\n  idx = gola_new(ls, name, VSTACK_LABEL, fs->pc);\r\n  lex_check(ls, TK_label);\r\n  /* Recursively parse trailing statements: labels and ';' (Lua 5.2 only). */\r\n  for (;;) {\r\n    if (ls->tok == TK_label) {\r\n      synlevel_begin(ls);\r\n      parse_label(ls);\r\n      synlevel_end(ls);\r\n    } else if (LJ_52 && ls->tok == ';') {\r\n      lj_lex_next(ls);\r\n    } else {\r\n      break;\r\n    }\r\n  }\r\n  /* Trailing label is considered to be outside of scope. */\r\n  if (parse_isend(ls->tok) && ls->tok != TK_until)\r\n    ls->vstack[idx].slot = fs->bl->nactvar;\r\n  gola_resolve(ls, fs->bl, idx);\r\n}\r\n\r\n/* -- Blocks, loops and conditional statements ---------------------------- */\r\n\r\n/* Parse a block. */\r\nstatic void parse_block(LexState *ls)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  FuncScope bl;\r\n  fscope_begin(fs, &bl, 0);\r\n  parse_chunk(ls);\r\n  fscope_end(fs);\r\n}\r\n\r\n/* Parse 'while' statement. */\r\nstatic void parse_while(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos start, loop, condexit;\r\n  FuncScope bl;\r\n  lj_lex_next(ls);  /* Skip 'while'. */\r\n  start = fs->lasttarget = fs->pc;\r\n  condexit = expr_cond(ls);\r\n  fscope_begin(fs, &bl, FSCOPE_LOOP);\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AD(fs, BC_LOOP, fs->nactvar, 0);\r\n  parse_block(ls);\r\n  jmp_patch(fs, bcemit_jmp(fs), start);\r\n  lex_match(ls, TK_end, TK_while, line);\r\n  fscope_end(fs);\r\n  jmp_tohere(fs, condexit);\r\n  jmp_patchins(fs, loop, fs->pc);\r\n}\r\n\r\n/* Parse 'repeat' statement. */\r\nstatic void parse_repeat(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos loop = fs->lasttarget = fs->pc;\r\n  BCPos condexit;\r\n  FuncScope bl1, bl2;\r\n  fscope_begin(fs, &bl1, FSCOPE_LOOP);  /* Breakable loop scope. */\r\n  fscope_begin(fs, &bl2, 0);  /* Inner scope. */\r\n  lj_lex_next(ls);  /* Skip 'repeat'. */\r\n  bcemit_AD(fs, BC_LOOP, fs->nactvar, 0);\r\n  parse_chunk(ls);\r\n  lex_match(ls, TK_until, TK_repeat, line);\r\n  condexit = expr_cond(ls);  /* Parse condition (still inside inner scope). */\r\n  if (!(bl2.flags & FSCOPE_UPVAL)) {  /* No upvalues? Just end inner scope. */\r\n    fscope_end(fs);\r\n  } else {  /* Otherwise generate: cond: UCLO+JMP out, !cond: UCLO+JMP loop. */\r\n    parse_break(ls);  /* Break from loop and close upvalues. */\r\n    jmp_tohere(fs, condexit);\r\n    fscope_end(fs);  /* End inner scope and close upvalues. */\r\n    condexit = bcemit_jmp(fs);\r\n  }\r\n  jmp_patch(fs, condexit, loop);  /* Jump backwards if !cond. */\r\n  jmp_patchins(fs, loop, fs->pc);\r\n  fscope_end(fs);  /* End loop scope. */\r\n}\r\n\r\n/* Parse numeric 'for'. */\r\nstatic void parse_for_num(LexState *ls, GCstr *varname, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCReg base = fs->freereg;\r\n  FuncScope bl;\r\n  BCPos loop, loopend;\r\n  /* Hidden control variables. */\r\n  var_new_fixed(ls, FORL_IDX, VARNAME_FOR_IDX);\r\n  var_new_fixed(ls, FORL_STOP, VARNAME_FOR_STOP);\r\n  var_new_fixed(ls, FORL_STEP, VARNAME_FOR_STEP);\r\n  /* Visible copy of index variable. */\r\n  var_new(ls, FORL_EXT, varname);\r\n  lex_check(ls, '=');\r\n  expr_next(ls);\r\n  lex_check(ls, ',');\r\n  expr_next(ls);\r\n  if (lex_opt(ls, ',')) {\r\n    expr_next(ls);\r\n  } else {\r\n    bcemit_AD(fs, BC_KSHORT, fs->freereg, 1);  /* Default step is 1. */\r\n    bcreg_reserve(fs, 1);\r\n  }\r\n  var_add(ls, 3);  /* Hidden control variables. */\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AJ(fs, BC_FORI, base, NO_JMP);\r\n  fscope_begin(fs, &bl, 0);  /* Scope for visible variables. */\r\n  var_add(ls, 1);\r\n  bcreg_reserve(fs, 1);\r\n  parse_block(ls);\r\n  fscope_end(fs);\r\n  /* Perform loop inversion. Loop control instructions are at the end. */\r\n  loopend = bcemit_AJ(fs, BC_FORL, base, NO_JMP);\r\n  fs->bcbase[loopend].line = line;  /* Fix line for control ins. */\r\n  jmp_patchins(fs, loopend, loop+1);\r\n  jmp_patchins(fs, loop, fs->pc);\r\n}\r\n\r\n/* Try to predict whether the iterator is next() and specialize the bytecode.\r\n** Detecting next() and pairs() by name is simplistic, but quite effective.\r\n** The interpreter backs off if the check for the closure fails at runtime.\r\n*/\r\nstatic int predict_next(LexState *ls, FuncState *fs, BCPos pc)\r\n{\r\n  BCIns ins = fs->bcbase[pc].ins;\r\n  GCstr *name;\r\n  cTValue *o;\r\n  switch (bc_op(ins)) {\r\n  case BC_MOV:\r\n    name = gco2str(gcref(var_get(ls, fs, bc_d(ins)).name));\r\n    break;\r\n  case BC_UGET:\r\n    name = gco2str(gcref(ls->vstack[fs->uvmap[bc_d(ins)]].name));\r\n    break;\r\n  case BC_GGET:\r\n    /* There's no inverse index (yet), so lookup the strings. */\r\n    o = lj_tab_getstr(fs->kt, lj_str_newlit(ls->L, \"pairs\"));\r\n    if (o && tvhaskslot(o) && tvkslot(o) == bc_d(ins))\r\n      return 1;\r\n    o = lj_tab_getstr(fs->kt, lj_str_newlit(ls->L, \"next\"));\r\n    if (o && tvhaskslot(o) && tvkslot(o) == bc_d(ins))\r\n      return 1;\r\n    return 0;\r\n  default:\r\n    return 0;\r\n  }\r\n  return (name->len == 5 && !strcmp(strdata(name), \"pairs\")) ||\r\n\t (name->len == 4 && !strcmp(strdata(name), \"next\"));\r\n}\r\n\r\n/* Parse 'for' iterator. */\r\nstatic void parse_for_iter(LexState *ls, GCstr *indexname)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  ExpDesc e;\r\n  BCReg nvars = 0;\r\n  BCLine line;\r\n  BCReg base = fs->freereg + 3;\r\n  BCPos loop, loopend, exprpc = fs->pc;\r\n  FuncScope bl;\r\n  int isnext;\r\n  /* Hidden control variables. */\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_GEN);\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_STATE);\r\n  var_new_fixed(ls, nvars++, VARNAME_FOR_CTL);\r\n  /* Visible variables returned from iterator. */\r\n  var_new(ls, nvars++, indexname);\r\n  while (lex_opt(ls, ','))\r\n    var_new(ls, nvars++, lex_str(ls));\r\n  lex_check(ls, TK_in);\r\n  line = ls->linenumber;\r\n  assign_adjust(ls, 3, expr_list(ls, &e), &e);\r\n  /* The iterator needs another 3 [4] slots (func [pc] | state ctl). */\r\n  bcreg_bump(fs, 3+LJ_FR2);\r\n  isnext = (nvars <= 5 && predict_next(ls, fs, exprpc));\r\n  var_add(ls, 3);  /* Hidden control variables. */\r\n  lex_check(ls, TK_do);\r\n  loop = bcemit_AJ(fs, isnext ? BC_ISNEXT : BC_JMP, base, NO_JMP);\r\n  fscope_begin(fs, &bl, 0);  /* Scope for visible variables. */\r\n  var_add(ls, nvars-3);\r\n  bcreg_reserve(fs, nvars-3);\r\n  parse_block(ls);\r\n  fscope_end(fs);\r\n  /* Perform loop inversion. Loop control instructions are at the end. */\r\n  jmp_patchins(fs, loop, fs->pc);\r\n  bcemit_ABC(fs, isnext ? BC_ITERN : BC_ITERC, base, nvars-3+1, 2+1);\r\n  loopend = bcemit_AJ(fs, BC_ITERL, base, NO_JMP);\r\n  fs->bcbase[loopend-1].line = line;  /* Fix line for control ins. */\r\n  fs->bcbase[loopend].line = line;\r\n  jmp_patchins(fs, loopend, loop+1);\r\n}\r\n\r\n/* Parse 'for' statement. */\r\nstatic void parse_for(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  GCstr *varname;\r\n  FuncScope bl;\r\n  fscope_begin(fs, &bl, FSCOPE_LOOP);\r\n  lj_lex_next(ls);  /* Skip 'for'. */\r\n  varname = lex_str(ls);  /* Get first variable name. */\r\n  if (ls->tok == '=')\r\n    parse_for_num(ls, varname, line);\r\n  else if (ls->tok == ',' || ls->tok == TK_in)\r\n    parse_for_iter(ls, varname);\r\n  else\r\n    err_syntax(ls, LJ_ERR_XFOR);\r\n  lex_match(ls, TK_end, TK_for, line);\r\n  fscope_end(fs);  /* Resolve break list. */\r\n}\r\n\r\n/* Parse condition and 'then' block. */\r\nstatic BCPos parse_then(LexState *ls)\r\n{\r\n  BCPos condexit;\r\n  lj_lex_next(ls);  /* Skip 'if' or 'elseif'. */\r\n  condexit = expr_cond(ls);\r\n  lex_check(ls, TK_then);\r\n  parse_block(ls);\r\n  return condexit;\r\n}\r\n\r\n/* Parse 'if' statement. */\r\nstatic void parse_if(LexState *ls, BCLine line)\r\n{\r\n  FuncState *fs = ls->fs;\r\n  BCPos flist;\r\n  BCPos escapelist = NO_JMP;\r\n  flist = parse_then(ls);\r\n  while (ls->tok == TK_elseif) {  /* Parse multiple 'elseif' blocks. */\r\n    jmp_append(fs, &escapelist, bcemit_jmp(fs));\r\n    jmp_tohere(fs, flist);\r\n    flist = parse_then(ls);\r\n  }\r\n  if (ls->tok == TK_else) {  /* Parse optional 'else' block. */\r\n    jmp_append(fs, &escapelist, bcemit_jmp(fs));\r\n    jmp_tohere(fs, flist);\r\n    lj_lex_next(ls);  /* Skip 'else'. */\r\n    parse_block(ls);\r\n  } else {\r\n    jmp_append(fs, &escapelist, flist);\r\n  }\r\n  jmp_tohere(fs, escapelist);\r\n  lex_match(ls, TK_end, TK_if, line);\r\n}\r\n\r\n/* -- Parse statements ---------------------------------------------------- */\r\n\r\n/* Parse a statement. Returns 1 if it must be the last one in a chunk. */\r\nstatic int parse_stmt(LexState *ls)\r\n{\r\n  BCLine line = ls->linenumber;\r\n  switch (ls->tok) {\r\n  case TK_if:\r\n    parse_if(ls, line);\r\n    break;\r\n  case TK_while:\r\n    parse_while(ls, line);\r\n    break;\r\n  case TK_do:\r\n    lj_lex_next(ls);\r\n    parse_block(ls);\r\n    lex_match(ls, TK_end, TK_do, line);\r\n    break;\r\n  case TK_for:\r\n    parse_for(ls, line);\r\n    break;\r\n  case TK_repeat:\r\n    parse_repeat(ls, line);\r\n    break;\r\n  case TK_function:\r\n    parse_func(ls, line);\r\n    break;\r\n  case TK_local:\r\n    lj_lex_next(ls);\r\n    parse_local(ls);\r\n    break;\r\n  case TK_return:\r\n    parse_return(ls);\r\n    return 1;  /* Must be last. */\r\n  case TK_break:\r\n    lj_lex_next(ls);\r\n    parse_break(ls);\r\n    return !LJ_52;  /* Must be last in Lua 5.1. */\r\n#if LJ_52\r\n  case ';':\r\n    lj_lex_next(ls);\r\n    break;\r\n#endif\r\n  case TK_label:\r\n    parse_label(ls);\r\n    break;\r\n  case TK_goto:\r\n    if (LJ_52 || lj_lex_lookahead(ls) == TK_name) {\r\n      lj_lex_next(ls);\r\n      parse_goto(ls);\r\n      break;\r\n    }  /* else: fallthrough */\r\n  default:\r\n    parse_call_assign(ls);\r\n    break;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* A chunk is a list of statements optionally separated by semicolons. */\r\nstatic void parse_chunk(LexState *ls)\r\n{\r\n  int islast = 0;\r\n  synlevel_begin(ls);\r\n  while (!islast && !parse_isend(ls->tok)) {\r\n    islast = parse_stmt(ls);\r\n    lex_opt(ls, ';');\r\n    lua_assert(ls->fs->framesize >= ls->fs->freereg &&\r\n\t       ls->fs->freereg >= ls->fs->nactvar);\r\n    ls->fs->freereg = ls->fs->nactvar;  /* Free registers after each stmt. */\r\n  }\r\n  synlevel_end(ls);\r\n}\r\n\r\n/* Entry point of bytecode parser. */\r\nGCproto *lj_parse(LexState *ls)\r\n{\r\n  FuncState fs;\r\n  FuncScope bl;\r\n  GCproto *pt;\r\n  lua_State *L = ls->L;\r\n#ifdef LUAJIT_DISABLE_DEBUGINFO\r\n  ls->chunkname = lj_str_newlit(L, \"=\");\r\n#else\r\n  ls->chunkname = lj_str_newz(L, ls->chunkarg);\r\n#endif\r\n  setstrV(L, L->top, ls->chunkname);  /* Anchor chunkname string. */\r\n  incr_top(L);\r\n  ls->level = 0;\r\n  fs_init(ls, &fs);\r\n  fs.linedefined = 0;\r\n  fs.numparams = 0;\r\n  fs.bcbase = NULL;\r\n  fs.bclim = 0;\r\n  fs.flags |= PROTO_VARARG;  /* Main chunk is always a vararg func. */\r\n  fscope_begin(&fs, &bl, 0);\r\n  bcemit_AD(&fs, BC_FUNCV, 0, 0);  /* Placeholder. */\r\n  lj_lex_next(ls);  /* Read-ahead first token. */\r\n  parse_chunk(ls);\r\n  if (ls->tok != TK_eof)\r\n    err_token(ls, TK_eof);\r\n  pt = fs_finish(ls, ls->linenumber);\r\n  L->top--;  /* Drop chunkname. */\r\n  lua_assert(fs.prev == NULL);\r\n  lua_assert(ls->fs == NULL);\r\n  lua_assert(pt->sizeuv == 0);\r\n  return pt;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_parse.h",
    "content": "/*\r\n** Lua parser (source code -> bytecode).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_PARSE_H\r\n#define _LJ_PARSE_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_lex.h\"\r\n\r\nLJ_FUNC GCproto *lj_parse(LexState *ls);\r\nLJ_FUNC GCstr *lj_parse_keepstr(LexState *ls, const char *str, size_t l);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_parse_keepcdata(LexState *ls, TValue *tv, GCcdata *cd);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_profile.c",
    "content": "/*\r\n** Low-overhead profiling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_profile_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASPROFILE\r\n\r\n#include \"lj_buf.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_dispatch.h\"\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#include \"lj_trace.h\"\r\n#endif\r\n#include \"lj_profile.h\"\r\n\r\n#include \"luajit.h\"\r\n\r\n#if LJ_PROFILE_SIGPROF\r\n\r\n#include <sys/time.h>\r\n#include <signal.h>\r\n#define profile_lock(ps)\tUNUSED(ps)\r\n#define profile_unlock(ps)\tUNUSED(ps)\r\n\r\n#elif LJ_PROFILE_PTHREAD\r\n\r\n#include <pthread.h>\r\n#include <time.h>\r\n#if LJ_TARGET_PS3\r\n#include <sys/timer.h>\r\n#endif\r\n#define profile_lock(ps)\tpthread_mutex_lock(&ps->lock)\r\n#define profile_unlock(ps)\tpthread_mutex_unlock(&ps->lock)\r\n\r\n#elif LJ_PROFILE_WTHREAD\r\n\r\n#define WIN32_LEAN_AND_MEAN\r\n#if LJ_TARGET_XBOX360\r\n#include <xtl.h>\r\n#include <xbox.h>\r\n#else\r\n#include <windows.h>\r\n#endif\r\ntypedef unsigned int (WINAPI *WMM_TPFUNC)(unsigned int);\r\n#define profile_lock(ps)\tEnterCriticalSection(&ps->lock)\r\n#define profile_unlock(ps)\tLeaveCriticalSection(&ps->lock)\r\n\r\n#endif\r\n\r\n/* Profiler state. */\r\ntypedef struct ProfileState {\r\n  global_State *g;\t\t/* VM state that started the profiler. */\r\n  luaJIT_profile_callback cb;\t/* Profiler callback. */\r\n  void *data;\t\t\t/* Profiler callback data. */\r\n  SBuf sb;\t\t\t/* String buffer for stack dumps. */\r\n  int interval;\t\t\t/* Sample interval in milliseconds. */\r\n  int samples;\t\t\t/* Number of samples for next callback. */\r\n  int vmstate;\t\t\t/* VM state when profile timer triggered. */\r\n#if LJ_PROFILE_SIGPROF\r\n  struct sigaction oldsa;\t/* Previous SIGPROF state. */\r\n#elif LJ_PROFILE_PTHREAD\r\n  pthread_mutex_t lock;\t\t/* g->hookmask update lock. */\r\n  pthread_t thread;\t\t/* Timer thread. */\r\n  int abort;\t\t\t/* Abort timer thread. */\r\n#elif LJ_PROFILE_WTHREAD\r\n#if LJ_TARGET_WINDOWS\r\n  HINSTANCE wmm;\t\t/* WinMM library handle. */\r\n  WMM_TPFUNC wmm_tbp;\t\t/* WinMM timeBeginPeriod function. */\r\n  WMM_TPFUNC wmm_tep;\t\t/* WinMM timeEndPeriod function. */\r\n#endif\r\n  CRITICAL_SECTION lock;\t/* g->hookmask update lock. */\r\n  HANDLE thread;\t\t/* Timer thread. */\r\n  int abort;\t\t\t/* Abort timer thread. */\r\n#endif\r\n} ProfileState;\r\n\r\n/* Sadly, we have to use a static profiler state.\r\n**\r\n** The SIGPROF variant needs a static pointer to the global state, anyway.\r\n** And it would be hard to extend for multiple threads. You can still use\r\n** multiple VMs in multiple threads, but only profile one at a time.\r\n*/\r\nstatic ProfileState profile_state;\r\n\r\n/* Default sample interval in milliseconds. */\r\n#define LJ_PROFILE_INTERVAL_DEFAULT\t10\r\n\r\n/* -- Profiler/hook interaction ------------------------------------------- */\r\n\r\n#if !LJ_PROFILE_SIGPROF\r\nvoid LJ_FASTCALL lj_profile_hook_enter(global_State *g)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  if (ps->g) {\r\n    profile_lock(ps);\r\n    hook_enter(g);\r\n    profile_unlock(ps);\r\n  } else {\r\n    hook_enter(g);\r\n  }\r\n}\r\n\r\nvoid LJ_FASTCALL lj_profile_hook_leave(global_State *g)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  if (ps->g) {\r\n    profile_lock(ps);\r\n    hook_leave(g);\r\n    profile_unlock(ps);\r\n  } else {\r\n    hook_leave(g);\r\n  }\r\n}\r\n#endif\r\n\r\n/* -- Profile callbacks --------------------------------------------------- */\r\n\r\n/* Callback from profile hook (HOOK_PROFILE already cleared). */\r\nvoid LJ_FASTCALL lj_profile_interpreter(lua_State *L)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  global_State *g = G(L);\r\n  uint8_t mask;\r\n  profile_lock(ps);\r\n  mask = (g->hookmask & ~HOOK_PROFILE);\r\n  if (!(mask & HOOK_VMEVENT)) {\r\n    int samples = ps->samples;\r\n    ps->samples = 0;\r\n    g->hookmask = HOOK_VMEVENT;\r\n    lj_dispatch_update(g);\r\n    profile_unlock(ps);\r\n    ps->cb(ps->data, L, samples, ps->vmstate);  /* Invoke user callback. */\r\n    profile_lock(ps);\r\n    mask |= (g->hookmask & HOOK_PROFILE);\r\n  }\r\n  g->hookmask = mask;\r\n  lj_dispatch_update(g);\r\n  profile_unlock(ps);\r\n}\r\n\r\n/* Trigger profile hook. Asynchronous call from OS-specific profile timer. */\r\nstatic void profile_trigger(ProfileState *ps)\r\n{\r\n  global_State *g = ps->g;\r\n  uint8_t mask;\r\n  profile_lock(ps);\r\n  ps->samples++;  /* Always increment number of samples. */\r\n  mask = g->hookmask;\r\n  if (!(mask & (HOOK_PROFILE|HOOK_VMEVENT))) {  /* Set profile hook. */\r\n    int st = g->vmstate;\r\n    ps->vmstate = st >= 0 ? 'N' :\r\n\t\t  st == ~LJ_VMST_INTERP ? 'I' :\r\n\t\t  st == ~LJ_VMST_C ? 'C' :\r\n\t\t  st == ~LJ_VMST_GC ? 'G' : 'J';\r\n    g->hookmask = (mask | HOOK_PROFILE);\r\n    lj_dispatch_update(g);\r\n  }\r\n  profile_unlock(ps);\r\n}\r\n\r\n/* -- OS-specific profile timer handling ---------------------------------- */\r\n\r\n#if LJ_PROFILE_SIGPROF\r\n\r\n/* SIGPROF handler. */\r\nstatic void profile_signal(int sig)\r\n{\r\n  UNUSED(sig);\r\n  profile_trigger(&profile_state);\r\n}\r\n\r\n/* Start profiling timer. */\r\nstatic void profile_timer_start(ProfileState *ps)\r\n{\r\n  int interval = ps->interval;\r\n  struct itimerval tm;\r\n  struct sigaction sa;\r\n  tm.it_value.tv_sec = tm.it_interval.tv_sec = interval / 1000;\r\n  tm.it_value.tv_usec = tm.it_interval.tv_usec = (interval % 1000) * 1000;\r\n  setitimer(ITIMER_PROF, &tm, NULL);\r\n  sa.sa_flags = SA_RESTART;\r\n  sa.sa_handler = profile_signal;\r\n  sigemptyset(&sa.sa_mask);\r\n  sigaction(SIGPROF, &sa, &ps->oldsa);\r\n}\r\n\r\n/* Stop profiling timer. */\r\nstatic void profile_timer_stop(ProfileState *ps)\r\n{\r\n  struct itimerval tm;\r\n  tm.it_value.tv_sec = tm.it_interval.tv_sec = 0;\r\n  tm.it_value.tv_usec = tm.it_interval.tv_usec = 0;\r\n  setitimer(ITIMER_PROF, &tm, NULL);\r\n  sigaction(SIGPROF, &ps->oldsa, NULL);\r\n}\r\n\r\n#elif LJ_PROFILE_PTHREAD\r\n\r\n/* POSIX timer thread. */\r\nstatic void *profile_thread(ProfileState *ps)\r\n{\r\n  int interval = ps->interval;\r\n#if !LJ_TARGET_PS3\r\n  struct timespec ts;\r\n  ts.tv_sec = interval / 1000;\r\n  ts.tv_nsec = (interval % 1000) * 1000000;\r\n#endif\r\n  while (1) {\r\n#if LJ_TARGET_PS3\r\n    sys_timer_usleep(interval * 1000);\r\n#else\r\n    nanosleep(&ts, NULL);\r\n#endif\r\n    if (ps->abort) break;\r\n    profile_trigger(ps);\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Start profiling timer thread. */\r\nstatic void profile_timer_start(ProfileState *ps)\r\n{\r\n  pthread_mutex_init(&ps->lock, 0);\r\n  ps->abort = 0;\r\n  pthread_create(&ps->thread, NULL, (void *(*)(void *))profile_thread, ps);\r\n}\r\n\r\n/* Stop profiling timer thread. */\r\nstatic void profile_timer_stop(ProfileState *ps)\r\n{\r\n  ps->abort = 1;\r\n  pthread_join(ps->thread, NULL);\r\n  pthread_mutex_destroy(&ps->lock);\r\n}\r\n\r\n#elif LJ_PROFILE_WTHREAD\r\n\r\n/* Windows timer thread. */\r\nstatic DWORD WINAPI profile_thread(void *psx)\r\n{\r\n  ProfileState *ps = (ProfileState *)psx;\r\n  int interval = ps->interval;\r\n#if LJ_TARGET_WINDOWS\r\n  ps->wmm_tbp(interval);\r\n#endif\r\n  while (1) {\r\n    Sleep(interval);\r\n    if (ps->abort) break;\r\n    profile_trigger(ps);\r\n  }\r\n#if LJ_TARGET_WINDOWS\r\n  ps->wmm_tep(interval);\r\n#endif\r\n  return 0;\r\n}\r\n\r\n/* Start profiling timer thread. */\r\nstatic void profile_timer_start(ProfileState *ps)\r\n{\r\n#if LJ_TARGET_WINDOWS\r\n  if (!ps->wmm) {  /* Load WinMM library on-demand. */\r\n    ps->wmm = LoadLibraryExA(\"winmm.dll\", NULL, 0);\r\n    if (ps->wmm) {\r\n      ps->wmm_tbp = (WMM_TPFUNC)GetProcAddress(ps->wmm, \"timeBeginPeriod\");\r\n      ps->wmm_tep = (WMM_TPFUNC)GetProcAddress(ps->wmm, \"timeEndPeriod\");\r\n      if (!ps->wmm_tbp || !ps->wmm_tep) {\r\n\tps->wmm = NULL;\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n#endif\r\n  InitializeCriticalSection(&ps->lock);\r\n  ps->abort = 0;\r\n  ps->thread = CreateThread(NULL, 0, profile_thread, ps, 0, NULL);\r\n}\r\n\r\n/* Stop profiling timer thread. */\r\nstatic void profile_timer_stop(ProfileState *ps)\r\n{\r\n  ps->abort = 1;\r\n  WaitForSingleObject(ps->thread, INFINITE);\r\n  DeleteCriticalSection(&ps->lock);\r\n}\r\n\r\n#endif\r\n\r\n/* -- Public profiling API ------------------------------------------------ */\r\n\r\n/* Start profiling. */\r\nLUA_API void luaJIT_profile_start(lua_State *L, const char *mode,\r\n\t\t\t\t  luaJIT_profile_callback cb, void *data)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  int interval = LJ_PROFILE_INTERVAL_DEFAULT;\r\n  while (*mode) {\r\n    int m = *mode++;\r\n    switch (m) {\r\n    case 'i':\r\n      interval = 0;\r\n      while (*mode >= '0' && *mode <= '9')\r\n\tinterval = interval * 10 + (*mode++ - '0');\r\n      if (interval <= 0) interval = 1;\r\n      break;\r\n#if LJ_HASJIT\r\n    case 'l': case 'f':\r\n      L2J(L)->prof_mode = m;\r\n      lj_trace_flushall(L);\r\n      break;\r\n#endif\r\n    default:  /* Ignore unknown mode chars. */\r\n      break;\r\n    }\r\n  }\r\n  if (ps->g) {\r\n    luaJIT_profile_stop(L);\r\n    if (ps->g) return;  /* Profiler in use by another VM. */\r\n  }\r\n  ps->g = G(L);\r\n  ps->interval = interval;\r\n  ps->cb = cb;\r\n  ps->data = data;\r\n  ps->samples = 0;\r\n  lj_buf_init(L, &ps->sb);\r\n  profile_timer_start(ps);\r\n}\r\n\r\n/* Stop profiling. */\r\nLUA_API void luaJIT_profile_stop(lua_State *L)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  global_State *g = ps->g;\r\n  if (G(L) == g) {  /* Only stop profiler if started by this VM. */\r\n    profile_timer_stop(ps);\r\n    g->hookmask &= ~HOOK_PROFILE;\r\n    lj_dispatch_update(g);\r\n#if LJ_HASJIT\r\n    G2J(g)->prof_mode = 0;\r\n    lj_trace_flushall(L);\r\n#endif\r\n    lj_buf_free(g, &ps->sb);\r\n    setmref(ps->sb.b, NULL);\r\n    setmref(ps->sb.e, NULL);\r\n    ps->g = NULL;\r\n  }\r\n}\r\n\r\n/* Return a compact stack dump. */\r\nLUA_API const char *luaJIT_profile_dumpstack(lua_State *L, const char *fmt,\r\n\t\t\t\t\t     int depth, size_t *len)\r\n{\r\n  ProfileState *ps = &profile_state;\r\n  SBuf *sb = &ps->sb;\r\n  setsbufL(sb, L);\r\n  lj_buf_reset(sb);\r\n  lj_debug_dumpstack(L, sb, fmt, depth);\r\n  *len = (size_t)sbuflen(sb);\r\n  return sbufB(sb);\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_profile.h",
    "content": "/*\r\n** Low-overhead profiling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_PROFILE_H\r\n#define _LJ_PROFILE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASPROFILE\r\n\r\nLJ_FUNC void LJ_FASTCALL lj_profile_interpreter(lua_State *L);\r\n#if !LJ_PROFILE_SIGPROF\r\nLJ_FUNC void LJ_FASTCALL lj_profile_hook_enter(global_State *g);\r\nLJ_FUNC void LJ_FASTCALL lj_profile_hook_leave(global_State *g);\r\n#endif\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_record.c",
    "content": "/*\r\n** Trace recorder (bytecode -> SSA IR).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_record_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_bc.h\"\r\n#include \"lj_ff.h\"\r\n#if LJ_HASPROFILE\r\n#include \"lj_debug.h\"\r\n#endif\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_ircall.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_ffrecord.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Sanity checks ------------------------------------------------------- */\r\n\r\n#ifdef LUA_USE_ASSERT\r\n/* Sanity check the whole IR -- sloooow. */\r\nstatic void rec_check_ir(jit_State *J)\r\n{\r\n  IRRef i, nins = J->cur.nins, nk = J->cur.nk;\r\n  lua_assert(nk <= REF_BIAS && nins >= REF_BIAS && nins < 65536);\r\n  for (i = nins-1; i >= nk; i--) {\r\n    IRIns *ir = IR(i);\r\n    uint32_t mode = lj_ir_mode[ir->o];\r\n    IRRef op1 = ir->op1;\r\n    IRRef op2 = ir->op2;\r\n    switch (irm_op1(mode)) {\r\n    case IRMnone: lua_assert(op1 == 0); break;\r\n    case IRMref: lua_assert(op1 >= nk);\r\n      lua_assert(i >= REF_BIAS ? op1 < i : op1 > i); break;\r\n    case IRMlit: break;\r\n    case IRMcst: lua_assert(i < REF_BIAS); continue;\r\n    }\r\n    switch (irm_op2(mode)) {\r\n    case IRMnone: lua_assert(op2 == 0); break;\r\n    case IRMref: lua_assert(op2 >= nk);\r\n      lua_assert(i >= REF_BIAS ? op2 < i : op2 > i); break;\r\n    case IRMlit: break;\r\n    case IRMcst: lua_assert(0); break;\r\n    }\r\n    if (ir->prev) {\r\n      lua_assert(ir->prev >= nk);\r\n      lua_assert(i >= REF_BIAS ? ir->prev < i : ir->prev > i);\r\n      lua_assert(ir->o == IR_NOP || IR(ir->prev)->o == ir->o);\r\n    }\r\n  }\r\n}\r\n\r\n/* Compare stack slots and frames of the recorder and the VM. */\r\nstatic void rec_check_slots(jit_State *J)\r\n{\r\n  BCReg s, nslots = J->baseslot + J->maxslot;\r\n  int32_t depth = 0;\r\n  cTValue *base = J->L->base - J->baseslot;\r\n  lua_assert(J->baseslot >= 1 && J->baseslot < LJ_MAX_JSLOTS);\r\n  lua_assert(J->baseslot == 1 || (J->slot[J->baseslot-1] & TREF_FRAME));\r\n  lua_assert(nslots < LJ_MAX_JSLOTS);\r\n  for (s = 0; s < nslots; s++) {\r\n    TRef tr = J->slot[s];\r\n    if (tr) {\r\n      cTValue *tv = &base[s];\r\n      IRRef ref = tref_ref(tr);\r\n      IRIns *ir;\r\n      lua_assert(ref >= J->cur.nk && ref < J->cur.nins);\r\n      ir = IR(ref);\r\n      lua_assert(irt_t(ir->t) == tref_t(tr));\r\n      if (s == 0) {\r\n\tlua_assert(tref_isfunc(tr));\r\n      } else if ((tr & TREF_FRAME)) {\r\n\tGCfunc *fn = gco2func(frame_gc(tv));\r\n\tBCReg delta = (BCReg)(tv - frame_prev(tv));\r\n\tlua_assert(tref_isfunc(tr));\r\n\tif (tref_isk(tr)) lua_assert(fn == ir_kfunc(ir));\r\n\tlua_assert(s > delta ? (J->slot[s-delta] & TREF_FRAME) : (s == delta));\r\n\tdepth++;\r\n      } else if ((tr & TREF_CONT)) {\r\n\tlua_assert(ir_kptr(ir) == gcrefp(tv->gcr, void));\r\n\tlua_assert((J->slot[s+1] & TREF_FRAME));\r\n\tdepth++;\r\n      } else {\r\n\tif (tvisnumber(tv))\r\n\t  lua_assert(tref_isnumber(tr));  /* Could be IRT_INT etc., too. */\r\n\telse\r\n\t  lua_assert(itype2irt(tv) == tref_type(tr));\r\n\tif (tref_isk(tr)) {  /* Compare constants. */\r\n\t  TValue tvk;\r\n\t  lj_ir_kvalue(J->L, &tvk, ir);\r\n\t  if (!(tvisnum(&tvk) && tvisnan(&tvk)))\r\n\t    lua_assert(lj_obj_equal(tv, &tvk));\r\n\t  else\r\n\t    lua_assert(tvisnum(tv) && tvisnan(tv));\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  lua_assert(J->framedepth == depth);\r\n}\r\n#endif\r\n\r\n/* -- Type handling and specialization ------------------------------------ */\r\n\r\n/* Note: these functions return tagged references (TRef). */\r\n\r\n/* Specialize a slot to a specific type. Note: slot can be negative! */\r\nstatic TRef sloadt(jit_State *J, int32_t slot, IRType t, int mode)\r\n{\r\n  /* Caller may set IRT_GUARD in t. */\r\n  TRef ref = emitir_raw(IRT(IR_SLOAD, t), (int32_t)J->baseslot+slot, mode);\r\n  J->base[slot] = ref;\r\n  return ref;\r\n}\r\n\r\n/* Specialize a slot to the runtime type. Note: slot can be negative! */\r\nstatic TRef sload(jit_State *J, int32_t slot)\r\n{\r\n  IRType t = itype2irt(&J->L->base[slot]);\r\n  TRef ref = emitir_raw(IRTG(IR_SLOAD, t), (int32_t)J->baseslot+slot,\r\n\t\t\tIRSLOAD_TYPECHECK);\r\n  if (irtype_ispri(t)) ref = TREF_PRI(t);  /* Canonicalize primitive refs. */\r\n  J->base[slot] = ref;\r\n  return ref;\r\n}\r\n\r\n/* Get TRef from slot. Load slot and specialize if not done already. */\r\n#define getslot(J, s)\t(J->base[(s)] ? J->base[(s)] : sload(J, (int32_t)(s)))\r\n\r\n/* Get TRef for current function. */\r\nstatic TRef getcurrf(jit_State *J)\r\n{\r\n  if (J->base[-1])\r\n    return J->base[-1];\r\n  lua_assert(J->baseslot == 1);\r\n  return sloadt(J, -1, IRT_FUNC, IRSLOAD_READONLY);\r\n}\r\n\r\n/* Compare for raw object equality.\r\n** Returns 0 if the objects are the same.\r\n** Returns 1 if they are different, but the same type.\r\n** Returns 2 for two different types.\r\n** Comparisons between primitives always return 1 -- no caller cares about it.\r\n*/\r\nint lj_record_objcmp(jit_State *J, TRef a, TRef b, cTValue *av, cTValue *bv)\r\n{\r\n  int diff = !lj_obj_equal(av, bv);\r\n  if (!tref_isk2(a, b)) {  /* Shortcut, also handles primitives. */\r\n    IRType ta = tref_isinteger(a) ? IRT_INT : tref_type(a);\r\n    IRType tb = tref_isinteger(b) ? IRT_INT : tref_type(b);\r\n    if (ta != tb) {\r\n      /* Widen mixed number/int comparisons to number/number comparison. */\r\n      if (ta == IRT_INT && tb == IRT_NUM) {\r\n\ta = emitir(IRTN(IR_CONV), a, IRCONV_NUM_INT);\r\n\tta = IRT_NUM;\r\n      } else if (ta == IRT_NUM && tb == IRT_INT) {\r\n\tb = emitir(IRTN(IR_CONV), b, IRCONV_NUM_INT);\r\n      } else {\r\n\treturn 2;  /* Two different types are never equal. */\r\n      }\r\n    }\r\n    emitir(IRTG(diff ? IR_NE : IR_EQ, ta), a, b);\r\n  }\r\n  return diff;\r\n}\r\n\r\n/* Constify a value. Returns 0 for non-representable object types. */\r\nTRef lj_record_constify(jit_State *J, cTValue *o)\r\n{\r\n  if (tvisgcv(o))\r\n    return lj_ir_kgc(J, gcV(o), itype2irt(o));\r\n  else if (tvisint(o))\r\n    return lj_ir_kint(J, intV(o));\r\n  else if (tvisnum(o))\r\n    return lj_ir_knumint(J, numV(o));\r\n  else if (tvisbool(o))\r\n    return TREF_PRI(itype2irt(o));\r\n  else\r\n    return 0;  /* Can't represent lightuserdata (pointless). */\r\n}\r\n\r\n/* -- Record loop ops ----------------------------------------------------- */\r\n\r\n/* Loop event. */\r\ntypedef enum {\r\n  LOOPEV_LEAVE,\t\t/* Loop is left or not entered. */\r\n  LOOPEV_ENTERLO,\t/* Loop is entered with a low iteration count left. */\r\n  LOOPEV_ENTER\t\t/* Loop is entered. */\r\n} LoopEvent;\r\n\r\n/* Canonicalize slots: convert integers to numbers. */\r\nstatic void canonicalize_slots(jit_State *J)\r\n{\r\n  BCReg s;\r\n  if (LJ_DUALNUM) return;\r\n  for (s = J->baseslot+J->maxslot-1; s >= 1; s--) {\r\n    TRef tr = J->slot[s];\r\n    if (tref_isinteger(tr)) {\r\n      IRIns *ir = IR(tref_ref(tr));\r\n      if (!(ir->o == IR_SLOAD && (ir->op2 & IRSLOAD_READONLY)))\r\n\tJ->slot[s] = emitir(IRTN(IR_CONV), tr, IRCONV_NUM_INT);\r\n    }\r\n  }\r\n}\r\n\r\n/* Stop recording. */\r\nvoid lj_record_stop(jit_State *J, TraceLink linktype, TraceNo lnk)\r\n{\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n  if (J->retryrec)\r\n    lj_trace_err(J, LJ_TRERR_RETRY);\r\n#endif\r\n  lj_trace_end(J);\r\n  J->cur.linktype = (uint8_t)linktype;\r\n  J->cur.link = (uint16_t)lnk;\r\n  /* Looping back at the same stack level? */\r\n  if (lnk == J->cur.traceno && J->framedepth + J->retdepth == 0) {\r\n    if ((J->flags & JIT_F_OPT_LOOP))  /* Shall we try to create a loop? */\r\n      goto nocanon;  /* Do not canonicalize or we lose the narrowing. */\r\n    if (J->cur.root)  /* Otherwise ensure we always link to the root trace. */\r\n      J->cur.link = J->cur.root;\r\n  }\r\n  canonicalize_slots(J);\r\nnocanon:\r\n  /* Note: all loop ops must set J->pc to the following instruction! */\r\n  lj_snap_add(J);  /* Add loop snapshot. */\r\n  J->needsnap = 0;\r\n  J->mergesnap = 1;  /* In case recording continues. */\r\n}\r\n\r\n/* Search bytecode backwards for a int/num constant slot initializer. */\r\nstatic TRef find_kinit(jit_State *J, const BCIns *endpc, BCReg slot, IRType t)\r\n{\r\n  /* This algorithm is rather simplistic and assumes quite a bit about\r\n  ** how the bytecode is generated. It works fine for FORI initializers,\r\n  ** but it won't necessarily work in other cases (e.g. iterator arguments).\r\n  ** It doesn't do anything fancy, either (like backpropagating MOVs).\r\n  */\r\n  const BCIns *pc, *startpc = proto_bc(J->pt);\r\n  for (pc = endpc-1; pc > startpc; pc--) {\r\n    BCIns ins = *pc;\r\n    BCOp op = bc_op(ins);\r\n    /* First try to find the last instruction that stores to this slot. */\r\n    if (bcmode_a(op) == BCMbase && bc_a(ins) <= slot) {\r\n      return 0;  /* Multiple results, e.g. from a CALL or KNIL. */\r\n    } else if (bcmode_a(op) == BCMdst && bc_a(ins) == slot) {\r\n      if (op == BC_KSHORT || op == BC_KNUM) {  /* Found const. initializer. */\r\n\t/* Now try to verify there's no forward jump across it. */\r\n\tconst BCIns *kpc = pc;\r\n\tfor (; pc > startpc; pc--)\r\n\t  if (bc_op(*pc) == BC_JMP) {\r\n\t    const BCIns *target = pc+bc_j(*pc)+1;\r\n\t    if (target > kpc && target <= endpc)\r\n\t      return 0;  /* Conditional assignment. */\r\n\t  }\r\n\tif (op == BC_KSHORT) {\r\n\t  int32_t k = (int32_t)(int16_t)bc_d(ins);\r\n\t  return t == IRT_INT ? lj_ir_kint(J, k) : lj_ir_knum(J, (lua_Number)k);\r\n\t} else {\r\n\t  cTValue *tv = proto_knumtv(J->pt, bc_d(ins));\r\n\t  if (t == IRT_INT) {\r\n\t    int32_t k = numberVint(tv);\r\n\t    if (tvisint(tv) || numV(tv) == (lua_Number)k)  /* -0 is ok here. */\r\n\t      return lj_ir_kint(J, k);\r\n\t    return 0;  /* Type mismatch. */\r\n\t  } else {\r\n\t    return lj_ir_knum(J, numberVnum(tv));\r\n\t  }\r\n\t}\r\n      }\r\n      return 0;  /* Non-constant initializer. */\r\n    }\r\n  }\r\n  return 0;  /* No assignment to this slot found? */\r\n}\r\n\r\n/* Load and optionally convert a FORI argument from a slot. */\r\nstatic TRef fori_load(jit_State *J, BCReg slot, IRType t, int mode)\r\n{\r\n  int conv = (tvisint(&J->L->base[slot]) != (t==IRT_INT)) ? IRSLOAD_CONVERT : 0;\r\n  return sloadt(J, (int32_t)slot,\r\n\t\tt + (((mode & IRSLOAD_TYPECHECK) ||\r\n\t\t      (conv && t == IRT_INT && !(mode >> 16))) ?\r\n\t\t     IRT_GUARD : 0),\r\n\t\tmode + conv);\r\n}\r\n\r\n/* Peek before FORI to find a const initializer. Otherwise load from slot. */\r\nstatic TRef fori_arg(jit_State *J, const BCIns *fori, BCReg slot,\r\n\t\t     IRType t, int mode)\r\n{\r\n  TRef tr = J->base[slot];\r\n  if (!tr) {\r\n    tr = find_kinit(J, fori, slot, t);\r\n    if (!tr)\r\n      tr = fori_load(J, slot, t, mode);\r\n  }\r\n  return tr;\r\n}\r\n\r\n/* Return the direction of the FOR loop iterator.\r\n** It's important to exactly reproduce the semantics of the interpreter.\r\n*/\r\nstatic int rec_for_direction(cTValue *o)\r\n{\r\n  return (tvisint(o) ? intV(o) : (int32_t)o->u32.hi) >= 0;\r\n}\r\n\r\n/* Simulate the runtime behavior of the FOR loop iterator. */\r\nstatic LoopEvent rec_for_iter(IROp *op, cTValue *o, int isforl)\r\n{\r\n  lua_Number stopv = numberVnum(&o[FORL_STOP]);\r\n  lua_Number idxv = numberVnum(&o[FORL_IDX]);\r\n  lua_Number stepv = numberVnum(&o[FORL_STEP]);\r\n  if (isforl)\r\n    idxv += stepv;\r\n  if (rec_for_direction(&o[FORL_STEP])) {\r\n    if (idxv <= stopv) {\r\n      *op = IR_LE;\r\n      return idxv + 2*stepv > stopv ? LOOPEV_ENTERLO : LOOPEV_ENTER;\r\n    }\r\n    *op = IR_GT; return LOOPEV_LEAVE;\r\n  } else {\r\n    if (stopv <= idxv) {\r\n      *op = IR_GE;\r\n      return idxv + 2*stepv < stopv ? LOOPEV_ENTERLO : LOOPEV_ENTER;\r\n    }\r\n    *op = IR_LT; return LOOPEV_LEAVE;\r\n  }\r\n}\r\n\r\n/* Record checks for FOR loop overflow and step direction. */\r\nstatic void rec_for_check(jit_State *J, IRType t, int dir,\r\n\t\t\t  TRef stop, TRef step, int init)\r\n{\r\n  if (!tref_isk(step)) {\r\n    /* Non-constant step: need a guard for the direction. */\r\n    TRef zero = (t == IRT_INT) ? lj_ir_kint(J, 0) : lj_ir_knum_zero(J);\r\n    emitir(IRTG(dir ? IR_GE : IR_LT, t), step, zero);\r\n    /* Add hoistable overflow checks for a narrowed FORL index. */\r\n    if (init && t == IRT_INT) {\r\n      if (tref_isk(stop)) {\r\n\t/* Constant stop: optimize check away or to a range check for step. */\r\n\tint32_t k = IR(tref_ref(stop))->i;\r\n\tif (dir) {\r\n\t  if (k > 0)\r\n\t    emitir(IRTGI(IR_LE), step, lj_ir_kint(J, (int32_t)0x7fffffff-k));\r\n\t} else {\r\n\t  if (k < 0)\r\n\t    emitir(IRTGI(IR_GE), step, lj_ir_kint(J, (int32_t)0x80000000-k));\r\n\t}\r\n      } else {\r\n\t/* Stop+step variable: need full overflow check. */\r\n\tTRef tr = emitir(IRTGI(IR_ADDOV), step, stop);\r\n\temitir(IRTI(IR_USE), tr, 0);  /* ADDOV is weak. Avoid dead result. */\r\n      }\r\n    }\r\n  } else if (init && t == IRT_INT && !tref_isk(stop)) {\r\n    /* Constant step: optimize overflow check to a range check for stop. */\r\n    int32_t k = IR(tref_ref(step))->i;\r\n    k = (int32_t)(dir ? 0x7fffffff : 0x80000000) - k;\r\n    emitir(IRTGI(dir ? IR_LE : IR_GE), stop, lj_ir_kint(J, k));\r\n  }\r\n}\r\n\r\n/* Record a FORL instruction. */\r\nstatic void rec_for_loop(jit_State *J, const BCIns *fori, ScEvEntry *scev,\r\n\t\t\t int init)\r\n{\r\n  BCReg ra = bc_a(*fori);\r\n  cTValue *tv = &J->L->base[ra];\r\n  TRef idx = J->base[ra+FORL_IDX];\r\n  IRType t = idx ? tref_type(idx) :\r\n\t     (init || LJ_DUALNUM) ? lj_opt_narrow_forl(J, tv) : IRT_NUM;\r\n  int mode = IRSLOAD_INHERIT +\r\n    ((!LJ_DUALNUM || tvisint(tv) == (t == IRT_INT)) ? IRSLOAD_READONLY : 0);\r\n  TRef stop = fori_arg(J, fori, ra+FORL_STOP, t, mode);\r\n  TRef step = fori_arg(J, fori, ra+FORL_STEP, t, mode);\r\n  int tc, dir = rec_for_direction(&tv[FORL_STEP]);\r\n  lua_assert(bc_op(*fori) == BC_FORI || bc_op(*fori) == BC_JFORI);\r\n  scev->t.irt = t;\r\n  scev->dir = dir;\r\n  scev->stop = tref_ref(stop);\r\n  scev->step = tref_ref(step);\r\n  rec_for_check(J, t, dir, stop, step, init);\r\n  scev->start = tref_ref(find_kinit(J, fori, ra+FORL_IDX, IRT_INT));\r\n  tc = (LJ_DUALNUM &&\r\n\t!(scev->start && irref_isk(scev->stop) && irref_isk(scev->step) &&\r\n\t  tvisint(&tv[FORL_IDX]) == (t == IRT_INT))) ?\r\n\tIRSLOAD_TYPECHECK : 0;\r\n  if (tc) {\r\n    J->base[ra+FORL_STOP] = stop;\r\n    J->base[ra+FORL_STEP] = step;\r\n  }\r\n  if (!idx)\r\n    idx = fori_load(J, ra+FORL_IDX, t,\r\n\t\t    IRSLOAD_INHERIT + tc + (J->scev.start << 16));\r\n  if (!init)\r\n    J->base[ra+FORL_IDX] = idx = emitir(IRT(IR_ADD, t), idx, step);\r\n  J->base[ra+FORL_EXT] = idx;\r\n  scev->idx = tref_ref(idx);\r\n  setmref(scev->pc, fori);\r\n  J->maxslot = ra+FORL_EXT+1;\r\n}\r\n\r\n/* Record FORL/JFORL or FORI/JFORI. */\r\nstatic LoopEvent rec_for(jit_State *J, const BCIns *fori, int isforl)\r\n{\r\n  BCReg ra = bc_a(*fori);\r\n  TValue *tv = &J->L->base[ra];\r\n  TRef *tr = &J->base[ra];\r\n  IROp op;\r\n  LoopEvent ev;\r\n  TRef stop;\r\n  IRType t;\r\n  if (isforl) {  /* Handle FORL/JFORL opcodes. */\r\n    TRef idx = tr[FORL_IDX];\r\n    if (mref(J->scev.pc, const BCIns) == fori && tref_ref(idx) == J->scev.idx) {\r\n      t = J->scev.t.irt;\r\n      stop = J->scev.stop;\r\n      idx = emitir(IRT(IR_ADD, t), idx, J->scev.step);\r\n      tr[FORL_EXT] = tr[FORL_IDX] = idx;\r\n    } else {\r\n      ScEvEntry scev;\r\n      rec_for_loop(J, fori, &scev, 0);\r\n      t = scev.t.irt;\r\n      stop = scev.stop;\r\n    }\r\n  } else {  /* Handle FORI/JFORI opcodes. */\r\n    BCReg i;\r\n    lj_meta_for(J->L, tv);\r\n    t = (LJ_DUALNUM || tref_isint(tr[FORL_IDX])) ? lj_opt_narrow_forl(J, tv) :\r\n\t\t\t\t\t\t   IRT_NUM;\r\n    for (i = FORL_IDX; i <= FORL_STEP; i++) {\r\n      if (!tr[i]) sload(J, ra+i);\r\n      lua_assert(tref_isnumber_str(tr[i]));\r\n      if (tref_isstr(tr[i]))\r\n\ttr[i] = emitir(IRTG(IR_STRTO, IRT_NUM), tr[i], 0);\r\n      if (t == IRT_INT) {\r\n\tif (!tref_isinteger(tr[i]))\r\n\t  tr[i] = emitir(IRTGI(IR_CONV), tr[i], IRCONV_INT_NUM|IRCONV_CHECK);\r\n      } else {\r\n\tif (!tref_isnum(tr[i]))\r\n\t  tr[i] = emitir(IRTN(IR_CONV), tr[i], IRCONV_NUM_INT);\r\n      }\r\n    }\r\n    tr[FORL_EXT] = tr[FORL_IDX];\r\n    stop = tr[FORL_STOP];\r\n    rec_for_check(J, t, rec_for_direction(&tv[FORL_STEP]),\r\n\t\t  stop, tr[FORL_STEP], 1);\r\n  }\r\n\r\n  ev = rec_for_iter(&op, tv, isforl);\r\n  if (ev == LOOPEV_LEAVE) {\r\n    J->maxslot = ra+FORL_EXT+1;\r\n    J->pc = fori+1;\r\n  } else {\r\n    J->maxslot = ra;\r\n    J->pc = fori+bc_j(*fori)+1;\r\n  }\r\n  lj_snap_add(J);\r\n\r\n  emitir(IRTG(op, t), tr[FORL_IDX], stop);\r\n\r\n  if (ev == LOOPEV_LEAVE) {\r\n    J->maxslot = ra;\r\n    J->pc = fori+bc_j(*fori)+1;\r\n  } else {\r\n    J->maxslot = ra+FORL_EXT+1;\r\n    J->pc = fori+1;\r\n  }\r\n  J->needsnap = 1;\r\n  return ev;\r\n}\r\n\r\n/* Record ITERL/JITERL. */\r\nstatic LoopEvent rec_iterl(jit_State *J, const BCIns iterins)\r\n{\r\n  BCReg ra = bc_a(iterins);\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n  if (!tref_isnil(getslot(J, ra))) {  /* Looping back? */\r\n    J->base[ra-1] = J->base[ra];  /* Copy result of ITERC to control var. */\r\n    J->maxslot = ra-1+bc_b(J->pc[-1]);\r\n    J->pc += bc_j(iterins)+1;\r\n    return LOOPEV_ENTER;\r\n  } else {\r\n    J->maxslot = ra-3;\r\n    J->pc++;\r\n    return LOOPEV_LEAVE;\r\n  }\r\n}\r\n\r\n/* Record LOOP/JLOOP. Now, that was easy. */\r\nstatic LoopEvent rec_loop(jit_State *J, BCReg ra)\r\n{\r\n  if (ra < J->maxslot) J->maxslot = ra;\r\n  J->pc++;\r\n  return LOOPEV_ENTER;\r\n}\r\n\r\n/* Check if a loop repeatedly failed to trace because it didn't loop back. */\r\nstatic int innerloopleft(jit_State *J, const BCIns *pc)\r\n{\r\n  ptrdiff_t i;\r\n  for (i = 0; i < PENALTY_SLOTS; i++)\r\n    if (mref(J->penalty[i].pc, const BCIns) == pc) {\r\n      if ((J->penalty[i].reason == LJ_TRERR_LLEAVE ||\r\n\t   J->penalty[i].reason == LJ_TRERR_LINNER) &&\r\n\t  J->penalty[i].val >= 2*PENALTY_MIN)\r\n\treturn 1;\r\n      break;\r\n    }\r\n  return 0;\r\n}\r\n\r\n/* Handle the case when an interpreted loop op is hit. */\r\nstatic void rec_loop_interp(jit_State *J, const BCIns *pc, LoopEvent ev)\r\n{\r\n  if (J->parent == 0 && J->exitno == 0) {\r\n    if (pc == J->startpc && J->framedepth + J->retdepth == 0) {\r\n      /* Same loop? */\r\n      if (ev == LOOPEV_LEAVE)  /* Must loop back to form a root trace. */\r\n\tlj_trace_err(J, LJ_TRERR_LLEAVE);\r\n      lj_record_stop(J, LJ_TRLINK_LOOP, J->cur.traceno);  /* Looping trace. */\r\n    } else if (ev != LOOPEV_LEAVE) {  /* Entering inner loop? */\r\n      /* It's usually better to abort here and wait until the inner loop\r\n      ** is traced. But if the inner loop repeatedly didn't loop back,\r\n      ** this indicates a low trip count. In this case try unrolling\r\n      ** an inner loop even in a root trace. But it's better to be a bit\r\n      ** more conservative here and only do it for very short loops.\r\n      */\r\n      if (bc_j(*pc) != -1 && !innerloopleft(J, pc))\r\n\tlj_trace_err(J, LJ_TRERR_LINNER);  /* Root trace hit an inner loop. */\r\n      if ((ev != LOOPEV_ENTERLO &&\r\n\t   J->loopref && J->cur.nins - J->loopref > 24) || --J->loopunroll < 0)\r\n\tlj_trace_err(J, LJ_TRERR_LUNROLL);  /* Limit loop unrolling. */\r\n      J->loopref = J->cur.nins;\r\n    }\r\n  } else if (ev != LOOPEV_LEAVE) {  /* Side trace enters an inner loop. */\r\n    J->loopref = J->cur.nins;\r\n    if (--J->loopunroll < 0)\r\n      lj_trace_err(J, LJ_TRERR_LUNROLL);  /* Limit loop unrolling. */\r\n  }  /* Side trace continues across a loop that's left or not entered. */\r\n}\r\n\r\n/* Handle the case when an already compiled loop op is hit. */\r\nstatic void rec_loop_jit(jit_State *J, TraceNo lnk, LoopEvent ev)\r\n{\r\n  if (J->parent == 0 && J->exitno == 0) {  /* Root trace hit an inner loop. */\r\n    /* Better let the inner loop spawn a side trace back here. */\r\n    lj_trace_err(J, LJ_TRERR_LINNER);\r\n  } else if (ev != LOOPEV_LEAVE) {  /* Side trace enters a compiled loop. */\r\n    J->instunroll = 0;  /* Cannot continue across a compiled loop op. */\r\n    if (J->pc == J->startpc && J->framedepth + J->retdepth == 0)\r\n      lj_record_stop(J, LJ_TRLINK_LOOP, J->cur.traceno);  /* Form extra loop. */\r\n    else\r\n      lj_record_stop(J, LJ_TRLINK_ROOT, lnk);  /* Link to the loop. */\r\n  }  /* Side trace continues across a loop that's left or not entered. */\r\n}\r\n\r\n/* -- Record profiler hook checks ----------------------------------------- */\r\n\r\n#if LJ_HASPROFILE\r\n\r\n/* Need to insert profiler hook check? */\r\nstatic int rec_profile_need(jit_State *J, GCproto *pt, const BCIns *pc)\r\n{\r\n  GCproto *ppt;\r\n  lua_assert(J->prof_mode == 'f' || J->prof_mode == 'l');\r\n  if (!pt)\r\n    return 0;\r\n  ppt = J->prev_pt;\r\n  J->prev_pt = pt;\r\n  if (pt != ppt && ppt) {\r\n    J->prev_line = -1;\r\n    return 1;\r\n  }\r\n  if (J->prof_mode == 'l') {\r\n    BCLine line = lj_debug_line(pt, proto_bcpos(pt, pc));\r\n    BCLine pline = J->prev_line;\r\n    J->prev_line = line;\r\n    if (pline != line)\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic void rec_profile_ins(jit_State *J, const BCIns *pc)\r\n{\r\n  if (J->prof_mode && rec_profile_need(J, J->pt, pc)) {\r\n    emitir(IRTG(IR_PROF, IRT_NIL), 0, 0);\r\n    lj_snap_add(J);\r\n  }\r\n}\r\n\r\nstatic void rec_profile_ret(jit_State *J)\r\n{\r\n  if (J->prof_mode == 'f') {\r\n    emitir(IRTG(IR_PROF, IRT_NIL), 0, 0);\r\n    J->prev_pt = NULL;\r\n    lj_snap_add(J);\r\n  }\r\n}\r\n\r\n#endif\r\n\r\n/* -- Record calls and returns -------------------------------------------- */\r\n\r\n/* Specialize to the runtime value of the called function or its prototype. */\r\nstatic TRef rec_call_specialize(jit_State *J, GCfunc *fn, TRef tr)\r\n{\r\n  TRef kfunc;\r\n  if (isluafunc(fn)) {\r\n    GCproto *pt = funcproto(fn);\r\n    /* Too many closures created? Probably not a monomorphic function. */\r\n    if (pt->flags >= PROTO_CLC_POLY) {  /* Specialize to prototype instead. */\r\n      TRef trpt = emitir(IRT(IR_FLOAD, IRT_P32), tr, IRFL_FUNC_PC);\r\n      emitir(IRTG(IR_EQ, IRT_P32), trpt, lj_ir_kptr(J, proto_bc(pt)));\r\n      (void)lj_ir_kgc(J, obj2gco(pt), IRT_PROTO);  /* Prevent GC of proto. */\r\n      return tr;\r\n    }\r\n  } else {\r\n    /* Don't specialize to non-monomorphic builtins. */\r\n    switch (fn->c.ffid) {\r\n    case FF_coroutine_wrap_aux:\r\n    case FF_string_gmatch_aux:\r\n      /* NYI: io_file_iter doesn't have an ffid, yet. */\r\n      {  /* Specialize to the ffid. */\r\n\tTRef trid = emitir(IRT(IR_FLOAD, IRT_U8), tr, IRFL_FUNC_FFID);\r\n\temitir(IRTG(IR_EQ, IRT_INT), trid, lj_ir_kint(J, fn->c.ffid));\r\n      }\r\n      return tr;\r\n    default:\r\n      /* NYI: don't specialize to non-monomorphic C functions. */\r\n      break;\r\n    }\r\n  }\r\n  /* Otherwise specialize to the function (closure) value itself. */\r\n  kfunc = lj_ir_kfunc(J, fn);\r\n  emitir(IRTG(IR_EQ, IRT_FUNC), tr, kfunc);\r\n  return kfunc;\r\n}\r\n\r\n/* Record call setup. */\r\nstatic void rec_call_setup(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  RecordIndex ix;\r\n  TValue *functv = &J->L->base[func];\r\n  TRef *fbase = &J->base[func];\r\n  ptrdiff_t i;\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n  for (i = 0; i <= nargs; i++)\r\n    (void)getslot(J, func+i);  /* Ensure func and all args have a reference. */\r\n  if (!tref_isfunc(fbase[0])) {  /* Resolve __call metamethod. */\r\n    ix.tab = fbase[0];\r\n    copyTV(J->L, &ix.tabv, functv);\r\n    if (!lj_record_mm_lookup(J, &ix, MM_call) || !tref_isfunc(ix.mobj))\r\n      lj_trace_err(J, LJ_TRERR_NOMM);\r\n    for (i = ++nargs; i > 0; i--)  /* Shift arguments up. */\r\n      fbase[i] = fbase[i-1];\r\n    fbase[0] = ix.mobj;  /* Replace function. */\r\n    functv = &ix.mobjv;\r\n  }\r\n  fbase[0] = TREF_FRAME | rec_call_specialize(J, funcV(functv), fbase[0]);\r\n  J->maxslot = (BCReg)nargs;\r\n}\r\n\r\n/* Record call. */\r\nvoid lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  rec_call_setup(J, func, nargs);\r\n  /* Bump frame. */\r\n  J->framedepth++;\r\n  J->base += func+1;\r\n  J->baseslot += func+1;\r\n}\r\n\r\n/* Record tail call. */\r\nvoid lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs)\r\n{\r\n  rec_call_setup(J, func, nargs);\r\n  if (frame_isvarg(J->L->base - 1)) {\r\n    BCReg cbase = (BCReg)frame_delta(J->L->base - 1);\r\n    if (--J->framedepth < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    func += cbase;\r\n  }\r\n  /* Move func + args down. */\r\n  memmove(&J->base[-1], &J->base[func], sizeof(TRef)*(J->maxslot+1));\r\n  /* Note: the new TREF_FRAME is now at J->base[-1] (even for slot #0). */\r\n  /* Tailcalls can form a loop, so count towards the loop unroll limit. */\r\n  if (++J->tailcalled > J->loopunroll)\r\n    lj_trace_err(J, LJ_TRERR_LUNROLL);\r\n}\r\n\r\n/* Check unroll limits for down-recursion. */\r\nstatic int check_downrec_unroll(jit_State *J, GCproto *pt)\r\n{\r\n  IRRef ptref;\r\n  for (ptref = J->chain[IR_KGC]; ptref; ptref = IR(ptref)->prev)\r\n    if (ir_kgc(IR(ptref)) == obj2gco(pt)) {\r\n      int count = 0;\r\n      IRRef ref;\r\n      for (ref = J->chain[IR_RETF]; ref; ref = IR(ref)->prev)\r\n\tif (IR(ref)->op1 == ptref)\r\n\t  count++;\r\n      if (count) {\r\n\tif (J->pc == J->startpc) {\r\n\t  if (count + J->tailcalled > J->param[JIT_P_recunroll])\r\n\t    return 1;\r\n\t} else {\r\n\t  lj_trace_err(J, LJ_TRERR_DOWNREC);\r\n\t}\r\n      }\r\n    }\r\n  return 0;\r\n}\r\n\r\nstatic TRef rec_cat(jit_State *J, BCReg baseslot, BCReg topslot);\r\n\r\n/* Record return. */\r\nvoid lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults)\r\n{\r\n  TValue *frame = J->L->base - 1;\r\n  ptrdiff_t i;\r\n  for (i = 0; i < gotresults; i++)\r\n    (void)getslot(J, rbase+i);  /* Ensure all results have a reference. */\r\n  while (frame_ispcall(frame)) {  /* Immediately resolve pcall() returns. */\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if (--J->framedepth < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    lua_assert(J->baseslot > 1);\r\n    gotresults++;\r\n    rbase += cbase;\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    J->base[--rbase] = TREF_TRUE;  /* Prepend true to results. */\r\n    frame = frame_prevd(frame);\r\n  }\r\n  /* Return to lower frame via interpreter for unhandled cases. */\r\n  if (J->framedepth == 0 && J->pt && bc_isret(bc_op(*J->pc)) &&\r\n       (!frame_islua(frame) ||\r\n\t(J->parent == 0 && J->exitno == 0 &&\r\n\t !bc_isret(bc_op(J->cur.startins))))) {\r\n    /* NYI: specialize to frame type and return directly, not via RET*. */\r\n    for (i = 0; i < (ptrdiff_t)rbase; i++)\r\n      J->base[i] = 0;  /* Purge dead slots. */\r\n    J->maxslot = rbase + (BCReg)gotresults;\r\n    lj_record_stop(J, LJ_TRLINK_RETURN, 0);  /* Return to interpreter. */\r\n    return;\r\n  }\r\n  if (frame_isvarg(frame)) {\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if (--J->framedepth < 0)  /* NYI: return of vararg func to lower frame. */\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    lua_assert(J->baseslot > 1);\r\n    rbase += cbase;\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    frame = frame_prevd(frame);\r\n  }\r\n  if (frame_islua(frame)) {  /* Return to Lua frame. */\r\n    BCIns callins = *(frame_pc(frame)-1);\r\n    ptrdiff_t nresults = bc_b(callins) ? (ptrdiff_t)bc_b(callins)-1 :gotresults;\r\n    BCReg cbase = bc_a(callins);\r\n    GCproto *pt = funcproto(frame_func(frame - (cbase+1-LJ_FR2)));\r\n    lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame teardown. */\r\n    if ((pt->flags & PROTO_NOJIT))\r\n      lj_trace_err(J, LJ_TRERR_CJITOFF);\r\n    if (J->framedepth == 0 && J->pt && frame == J->L->base - 1) {\r\n      if (check_downrec_unroll(J, pt)) {\r\n\tJ->maxslot = (BCReg)(rbase + gotresults);\r\n\tlj_snap_purge(J);\r\n\tlj_record_stop(J, LJ_TRLINK_DOWNREC, J->cur.traceno);  /* Down-rec. */\r\n\treturn;\r\n      }\r\n      lj_snap_add(J);\r\n    }\r\n    for (i = 0; i < nresults; i++)  /* Adjust results. */\r\n      J->base[i-1] = i < gotresults ? J->base[rbase+i] : TREF_NIL;\r\n    J->maxslot = cbase+(BCReg)nresults;\r\n    if (J->framedepth > 0) {  /* Return to a frame that is part of the trace. */\r\n      J->framedepth--;\r\n      lua_assert(J->baseslot > cbase+1);\r\n      J->baseslot -= cbase+1;\r\n      J->base -= cbase+1;\r\n    } else if (J->parent == 0 && J->exitno == 0 &&\r\n\t       !bc_isret(bc_op(J->cur.startins))) {\r\n      /* Return to lower frame would leave the loop in a root trace. */\r\n      lj_trace_err(J, LJ_TRERR_LLEAVE);\r\n    } else if (J->needsnap) {  /* Tailcalled to ff with side-effects. */\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);  /* No way to insert snapshot here. */\r\n    } else {  /* Return to lower frame. Guard for the target we return to. */\r\n      TRef trpt = lj_ir_kgc(J, obj2gco(pt), IRT_PROTO);\r\n      TRef trpc = lj_ir_kptr(J, (void *)frame_pc(frame));\r\n      emitir(IRTG(IR_RETF, IRT_P32), trpt, trpc);\r\n      J->retdepth++;\r\n      J->needsnap = 1;\r\n      lua_assert(J->baseslot == 1);\r\n      /* Shift result slots up and clear the slots of the new frame below. */\r\n      memmove(J->base + cbase, J->base-1, sizeof(TRef)*nresults);\r\n      memset(J->base-1, 0, sizeof(TRef)*(cbase+1));\r\n    }\r\n  } else if (frame_iscont(frame)) {  /* Return to continuation frame. */\r\n    ASMFunction cont = frame_contf(frame);\r\n    BCReg cbase = (BCReg)frame_delta(frame);\r\n    if ((J->framedepth -= 2) < 0)\r\n      lj_trace_err(J, LJ_TRERR_NYIRETL);\r\n    J->baseslot -= (BCReg)cbase;\r\n    J->base -= cbase;\r\n    J->maxslot = cbase-2;\r\n    if (cont == lj_cont_ra) {\r\n      /* Copy result to destination slot. */\r\n      BCReg dst = bc_a(*(frame_contpc(frame)-1));\r\n      J->base[dst] = gotresults ? J->base[cbase+rbase] : TREF_NIL;\r\n      if (dst >= J->maxslot) J->maxslot = dst+1;\r\n    } else if (cont == lj_cont_nop) {\r\n      /* Nothing to do here. */\r\n    } else if (cont == lj_cont_cat) {\r\n      BCReg bslot = bc_b(*(frame_contpc(frame)-1));\r\n      TRef tr = gotresults ? J->base[cbase+rbase] : TREF_NIL;\r\n      if (bslot != cbase-2) {  /* Concatenate the remainder. */\r\n\tTValue *b = J->L->base, save;  /* Simulate lower frame and result. */\r\n\tJ->base[cbase-2] = tr;\r\n\tcopyTV(J->L, &save, b-2);\r\n\tif (gotresults) copyTV(J->L, b-2, b+rbase); else setnilV(b-2);\r\n\tJ->L->base = b - cbase;\r\n\ttr = rec_cat(J, bslot, cbase-2);\r\n\tb = J->L->base + cbase;  /* Undo. */\r\n\tJ->L->base = b;\r\n\tcopyTV(J->L, b-2, &save);\r\n      }\r\n      if (tr) {  /* Store final result. */\r\n\tBCReg dst = bc_a(*(frame_contpc(frame)-1));\r\n\tJ->base[dst] = tr;\r\n\tif (dst >= J->maxslot) J->maxslot = dst+1;\r\n      }  /* Otherwise continue with another __concat call. */\r\n    } else {\r\n      /* Result type already specialized. */\r\n      lua_assert(cont == lj_cont_condf || cont == lj_cont_condt);\r\n    }\r\n  } else {\r\n    lj_trace_err(J, LJ_TRERR_NYIRETL);  /* NYI: handle return to C frame. */\r\n  }\r\n  lua_assert(J->baseslot >= 1);\r\n}\r\n\r\n/* -- Metamethod handling ------------------------------------------------- */\r\n\r\n/* Prepare to record call to metamethod. */\r\nstatic BCReg rec_mm_prep(jit_State *J, ASMFunction cont)\r\n{\r\n  BCReg s, top = cont == lj_cont_cat ? J->maxslot : curr_proto(J->L)->framesize;\r\n#if LJ_64\r\n  TRef trcont = lj_ir_kptr(J, (void *)((int64_t)cont-(int64_t)lj_vm_asm_begin));\r\n#else\r\n  TRef trcont = lj_ir_kptr(J, (void *)cont);\r\n#endif\r\n  J->base[top] = trcont | TREF_CONT;\r\n  J->framedepth++;\r\n  for (s = J->maxslot; s < top; s++)\r\n    J->base[s] = 0;  /* Clear frame gap to avoid resurrecting previous refs. */\r\n  return top+1;\r\n}\r\n\r\n/* Record metamethod lookup. */\r\nint lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm)\r\n{\r\n  RecordIndex mix;\r\n  GCtab *mt;\r\n  if (tref_istab(ix->tab)) {\r\n    mt = tabref(tabV(&ix->tabv)->metatable);\r\n    mix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_TAB_META);\r\n  } else if (tref_isudata(ix->tab)) {\r\n    int udtype = udataV(&ix->tabv)->udtype;\r\n    mt = tabref(udataV(&ix->tabv)->metatable);\r\n    /* The metatables of special userdata objects are treated as immutable. */\r\n    if (udtype != UDTYPE_USERDATA) {\r\n      cTValue *mo;\r\n      if (LJ_HASFFI && udtype == UDTYPE_FFI_CLIB) {\r\n\t/* Specialize to the C library namespace object. */\r\n\temitir(IRTG(IR_EQ, IRT_P32), ix->tab, lj_ir_kptr(J, udataV(&ix->tabv)));\r\n      } else {\r\n\t/* Specialize to the type of userdata. */\r\n\tTRef tr = emitir(IRT(IR_FLOAD, IRT_U8), ix->tab, IRFL_UDATA_UDTYPE);\r\n\temitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, udtype));\r\n      }\r\n  immutable_mt:\r\n      mo = lj_tab_getstr(mt, mmname_str(J2G(J), mm));\r\n      if (!mo || tvisnil(mo))\r\n\treturn 0;  /* No metamethod. */\r\n      /* Treat metamethod or index table as immutable, too. */\r\n      if (!(tvisfunc(mo) || tvistab(mo)))\r\n\tlj_trace_err(J, LJ_TRERR_BADTYPE);\r\n      copyTV(J->L, &ix->mobjv, mo);\r\n      ix->mobj = lj_ir_kgc(J, gcV(mo), tvisfunc(mo) ? IRT_FUNC : IRT_TAB);\r\n      ix->mtv = mt;\r\n      ix->mt = TREF_NIL;  /* Dummy value for comparison semantics. */\r\n      return 1;  /* Got metamethod or index table. */\r\n    }\r\n    mix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_UDATA_META);\r\n  } else {\r\n    /* Specialize to base metatable. Must flush mcode in lua_setmetatable(). */\r\n    mt = tabref(basemt_obj(J2G(J), &ix->tabv));\r\n    if (mt == NULL) {\r\n      ix->mt = TREF_NIL;\r\n      return 0;  /* No metamethod. */\r\n    }\r\n    /* The cdata metatable is treated as immutable. */\r\n    if (LJ_HASFFI && tref_iscdata(ix->tab)) goto immutable_mt;\r\n    ix->mt = mix.tab = lj_ir_ktab(J, mt);\r\n    goto nocheck;\r\n  }\r\n  ix->mt = mt ? mix.tab : TREF_NIL;\r\n  emitir(IRTG(mt ? IR_NE : IR_EQ, IRT_TAB), mix.tab, lj_ir_knull(J, IRT_TAB));\r\nnocheck:\r\n  if (mt) {\r\n    GCstr *mmstr = mmname_str(J2G(J), mm);\r\n    cTValue *mo = lj_tab_getstr(mt, mmstr);\r\n    if (mo && !tvisnil(mo))\r\n      copyTV(J->L, &ix->mobjv, mo);\r\n    ix->mtv = mt;\r\n    settabV(J->L, &mix.tabv, mt);\r\n    setstrV(J->L, &mix.keyv, mmstr);\r\n    mix.key = lj_ir_kstr(J, mmstr);\r\n    mix.val = 0;\r\n    mix.idxchain = 0;\r\n    ix->mobj = lj_record_idx(J, &mix);\r\n    return !tref_isnil(ix->mobj);  /* 1 if metamethod found, 0 if not. */\r\n  }\r\n  return 0;  /* No metamethod. */\r\n}\r\n\r\n/* Record call to arithmetic metamethod. */\r\nstatic TRef rec_mm_arith(jit_State *J, RecordIndex *ix, MMS mm)\r\n{\r\n  /* Set up metamethod call first to save ix->tab and ix->tabv. */\r\n  BCReg func = rec_mm_prep(J, mm == MM_concat ? lj_cont_cat : lj_cont_ra);\r\n  TRef *base = J->base + func;\r\n  TValue *basev = J->L->base + func;\r\n  base[1] = ix->tab; base[2] = ix->key;\r\n  copyTV(J->L, basev+1, &ix->tabv);\r\n  copyTV(J->L, basev+2, &ix->keyv);\r\n  if (!lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n    if (mm != MM_unm) {\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, &ix->keyv);\r\n      if (lj_record_mm_lookup(J, ix, mm))  /* Lookup mm on 2nd operand. */\r\n\tgoto ok;\r\n    }\r\n    lj_trace_err(J, LJ_TRERR_NOMM);\r\n  }\r\nok:\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n  base[0] = ix->mobj;\r\n  copyTV(J->L, basev+0, &ix->mobjv);\r\n  lj_record_call(J, func, 2);\r\n  return 0;  /* No result yet. */\r\n}\r\n\r\n/* Record call to __len metamethod. */\r\nstatic TRef rec_mm_len(jit_State *J, TRef tr, TValue *tv)\r\n{\r\n  RecordIndex ix;\r\n  ix.tab = tr;\r\n  copyTV(J->L, &ix.tabv, tv);\r\n  if (lj_record_mm_lookup(J, &ix, MM_len)) {\r\n    BCReg func = rec_mm_prep(J, lj_cont_ra);\r\n    TRef *base = J->base + func;\r\n    TValue *basev = J->L->base + func;\r\n    lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n    base[0] = ix.mobj; copyTV(J->L, basev+0, &ix.mobjv);\r\n    base[1] = tr; copyTV(J->L, basev+1, tv);\r\n#if LJ_52\r\n    base[2] = tr; copyTV(J->L, basev+2, tv);\r\n#else\r\n    base[2] = TREF_NIL; setnilV(basev+2);\r\n#endif\r\n    lj_record_call(J, func, 2);\r\n  } else {\r\n    if (LJ_52 && tref_istab(tr))\r\n      return lj_ir_call(J, IRCALL_lj_tab_len, tr);\r\n    lj_trace_err(J, LJ_TRERR_NOMM);\r\n  }\r\n  return 0;  /* No result yet. */\r\n}\r\n\r\n/* Call a comparison metamethod. */\r\nstatic void rec_mm_callcomp(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  BCReg func = rec_mm_prep(J, (op&1) ? lj_cont_condf : lj_cont_condt);\r\n  TRef *base = J->base + func;\r\n  TValue *tv = J->L->base + func;\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n  base[0] = ix->mobj; base[1] = ix->val; base[2] = ix->key;\r\n  copyTV(J->L, tv+0, &ix->mobjv);\r\n  copyTV(J->L, tv+1, &ix->valv);\r\n  copyTV(J->L, tv+2, &ix->keyv);\r\n  lj_record_call(J, func, 2);\r\n}\r\n\r\n/* Record call to equality comparison metamethod (for tab and udata only). */\r\nstatic void rec_mm_equal(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  ix->tab = ix->val;\r\n  copyTV(J->L, &ix->tabv, &ix->valv);\r\n  if (lj_record_mm_lookup(J, ix, MM_eq)) {  /* Lookup mm on 1st operand. */\r\n    cTValue *bv;\r\n    TRef mo1 = ix->mobj;\r\n    TValue mo1v;\r\n    copyTV(J->L, &mo1v, &ix->mobjv);\r\n    /* Avoid the 2nd lookup and the objcmp if the metatables are equal. */\r\n    bv = &ix->keyv;\r\n    if (tvistab(bv) && tabref(tabV(bv)->metatable) == ix->mtv) {\r\n      TRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_TAB_META);\r\n      emitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n    } else if (tvisudata(bv) && tabref(udataV(bv)->metatable) == ix->mtv) {\r\n      TRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_UDATA_META);\r\n      emitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n    } else {  /* Lookup metamethod on 2nd operand and compare both. */\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, bv);\r\n      if (!lj_record_mm_lookup(J, ix, MM_eq) ||\r\n\t  lj_record_objcmp(J, mo1, ix->mobj, &mo1v, &ix->mobjv))\r\n\treturn;\r\n    }\r\n    rec_mm_callcomp(J, ix, op);\r\n  }\r\n}\r\n\r\n/* Record call to ordered comparison metamethods (for arbitrary objects). */\r\nstatic void rec_mm_comp(jit_State *J, RecordIndex *ix, int op)\r\n{\r\n  ix->tab = ix->val;\r\n  copyTV(J->L, &ix->tabv, &ix->valv);\r\n  while (1) {\r\n    MMS mm = (op & 2) ? MM_le : MM_lt;  /* Try __le + __lt or only __lt. */\r\n#if LJ_52\r\n    if (!lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n      ix->tab = ix->key;\r\n      copyTV(J->L, &ix->tabv, &ix->keyv);\r\n      if (!lj_record_mm_lookup(J, ix, mm))  /* Lookup mm on 2nd operand. */\r\n\tgoto nomatch;\r\n    }\r\n    rec_mm_callcomp(J, ix, op);\r\n    return;\r\n#else\r\n    if (lj_record_mm_lookup(J, ix, mm)) {  /* Lookup mm on 1st operand. */\r\n      cTValue *bv;\r\n      TRef mo1 = ix->mobj;\r\n      TValue mo1v;\r\n      copyTV(J->L, &mo1v, &ix->mobjv);\r\n      /* Avoid the 2nd lookup and the objcmp if the metatables are equal. */\r\n      bv = &ix->keyv;\r\n      if (tvistab(bv) && tabref(tabV(bv)->metatable) == ix->mtv) {\r\n\tTRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_TAB_META);\r\n\temitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n      } else if (tvisudata(bv) && tabref(udataV(bv)->metatable) == ix->mtv) {\r\n\tTRef mt2 = emitir(IRT(IR_FLOAD, IRT_TAB), ix->key, IRFL_UDATA_META);\r\n\temitir(IRTG(IR_EQ, IRT_TAB), mt2, ix->mt);\r\n      } else {  /* Lookup metamethod on 2nd operand and compare both. */\r\n\tix->tab = ix->key;\r\n\tcopyTV(J->L, &ix->tabv, bv);\r\n\tif (!lj_record_mm_lookup(J, ix, mm) ||\r\n\t    lj_record_objcmp(J, mo1, ix->mobj, &mo1v, &ix->mobjv))\r\n\t  goto nomatch;\r\n      }\r\n      rec_mm_callcomp(J, ix, op);\r\n      return;\r\n    }\r\n#endif\r\n  nomatch:\r\n    /* Lookup failed. Retry with  __lt and swapped operands. */\r\n    if (!(op & 2)) break;  /* Already at __lt. Interpreter will throw. */\r\n    ix->tab = ix->key; ix->key = ix->val; ix->val = ix->tab;\r\n    copyTV(J->L, &ix->tabv, &ix->keyv);\r\n    copyTV(J->L, &ix->keyv, &ix->valv);\r\n    copyTV(J->L, &ix->valv, &ix->tabv);\r\n    op ^= 3;\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Setup call to cdata comparison metamethod. */\r\nstatic void rec_mm_comp_cdata(jit_State *J, RecordIndex *ix, int op, MMS mm)\r\n{\r\n  lj_snap_add(J);\r\n  if (tref_iscdata(ix->val)) {\r\n    ix->tab = ix->val;\r\n    copyTV(J->L, &ix->tabv, &ix->valv);\r\n  } else {\r\n    lua_assert(tref_iscdata(ix->key));\r\n    ix->tab = ix->key;\r\n    copyTV(J->L, &ix->tabv, &ix->keyv);\r\n  }\r\n  lj_record_mm_lookup(J, ix, mm);\r\n  rec_mm_callcomp(J, ix, op);\r\n}\r\n#endif\r\n\r\n/* -- Indexed access ------------------------------------------------------ */\r\n\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n/* Bump table allocations in bytecode when they grow during recording. */\r\nstatic void rec_idx_bump(jit_State *J, RecordIndex *ix)\r\n{\r\n  RBCHashEntry *rbc = &J->rbchash[(ix->tab & (RBCHASH_SLOTS-1))];\r\n  if (tref_ref(ix->tab) == rbc->ref) {\r\n    const BCIns *pc = mref(rbc->pc, const BCIns);\r\n    GCtab *tb = tabV(&ix->tabv);\r\n    uint32_t nhbits;\r\n    IRIns *ir;\r\n    if (!tvisnil(&ix->keyv))\r\n      (void)lj_tab_set(J->L, tb, &ix->keyv);  /* Grow table right now. */\r\n    nhbits = tb->hmask > 0 ? lj_fls(tb->hmask)+1 : 0;\r\n    ir = IR(tref_ref(ix->tab));\r\n    if (ir->o == IR_TNEW) {\r\n      uint32_t ah = bc_d(*pc);\r\n      uint32_t asize = ah & 0x7ff, hbits = ah >> 11;\r\n      if (nhbits > hbits) hbits = nhbits;\r\n      if (tb->asize > asize) {\r\n\tasize = tb->asize <= 0x7ff ? tb->asize : 0x7ff;\r\n      }\r\n      if ((asize | (hbits<<11)) != ah) {  /* Has the size changed? */\r\n\t/* Patch bytecode, but continue recording (for more patching). */\r\n\tsetbc_d(pc, (asize | (hbits<<11)));\r\n\t/* Patching TNEW operands is only safe if the trace is aborted. */\r\n\tir->op1 = asize; ir->op2 = hbits;\r\n\tJ->retryrec = 1;  /* Abort the trace at the end of recording. */\r\n      }\r\n    } else if (ir->o == IR_TDUP) {\r\n      GCtab *tpl = gco2tab(proto_kgc(&gcref(rbc->pt)->pt, ~(ptrdiff_t)bc_d(*pc)));\r\n      /* Grow template table, but preserve keys with nil values. */\r\n      if ((tb->asize > tpl->asize && (1u << nhbits)-1 == tpl->hmask) ||\r\n\t  (tb->asize == tpl->asize && (1u << nhbits)-1 > tpl->hmask)) {\r\n\tNode *node = noderef(tpl->node);\r\n\tuint32_t i, hmask = tpl->hmask, asize;\r\n\tTValue *array;\r\n\tfor (i = 0; i <= hmask; i++) {\r\n\t  if (!tvisnil(&node[i].key) && tvisnil(&node[i].val))\r\n\t    settabV(J->L, &node[i].val, tpl);\r\n\t}\r\n\tif (!tvisnil(&ix->keyv) && tref_isk(ix->key)) {\r\n\t  TValue *o = lj_tab_set(J->L, tpl, &ix->keyv);\r\n\t  if (tvisnil(o)) settabV(J->L, o, tpl);\r\n\t}\r\n\tlj_tab_resize(J->L, tpl, tb->asize, nhbits);\r\n\tnode = noderef(tpl->node);\r\n\thmask = tpl->hmask;\r\n\tfor (i = 0; i <= hmask; i++) {\r\n\t  /* This is safe, since template tables only hold immutable values. */\r\n\t  if (tvistab(&node[i].val))\r\n\t    setnilV(&node[i].val);\r\n\t}\r\n\t/* The shape of the table may have changed. Clean up array part, too. */\r\n\tasize = tpl->asize;\r\n\tarray = tvref(tpl->array);\r\n\tfor (i = 0; i < asize; i++) {\r\n\t  if (tvistab(&array[i]))\r\n\t    setnilV(&array[i]);\r\n\t}\r\n\tJ->retryrec = 1;  /* Abort the trace at the end of recording. */\r\n      }\r\n    }\r\n  }\r\n}\r\n#endif\r\n\r\n/* Record bounds-check. */\r\nstatic void rec_idx_abc(jit_State *J, TRef asizeref, TRef ikey, uint32_t asize)\r\n{\r\n  /* Try to emit invariant bounds checks. */\r\n  if ((J->flags & (JIT_F_OPT_LOOP|JIT_F_OPT_ABC)) ==\r\n      (JIT_F_OPT_LOOP|JIT_F_OPT_ABC)) {\r\n    IRRef ref = tref_ref(ikey);\r\n    IRIns *ir = IR(ref);\r\n    int32_t ofs = 0;\r\n    IRRef ofsref = 0;\r\n    /* Handle constant offsets. */\r\n    if (ir->o == IR_ADD && irref_isk(ir->op2)) {\r\n      ofsref = ir->op2;\r\n      ofs = IR(ofsref)->i;\r\n      ref = ir->op1;\r\n      ir = IR(ref);\r\n    }\r\n    /* Got scalar evolution analysis results for this reference? */\r\n    if (ref == J->scev.idx) {\r\n      int32_t stop;\r\n      lua_assert(irt_isint(J->scev.t) && ir->o == IR_SLOAD);\r\n      stop = numberVint(&(J->L->base - J->baseslot)[ir->op1 + FORL_STOP]);\r\n      /* Runtime value for stop of loop is within bounds? */\r\n      if ((uint64_t)stop + ofs < (uint64_t)asize) {\r\n\t/* Emit invariant bounds check for stop. */\r\n\temitir(IRTG(IR_ABC, IRT_P32), asizeref, ofs == 0 ? J->scev.stop :\r\n\t       emitir(IRTI(IR_ADD), J->scev.stop, ofsref));\r\n\t/* Emit invariant bounds check for start, if not const or negative. */\r\n\tif (!(J->scev.dir && J->scev.start &&\r\n\t      (int64_t)IR(J->scev.start)->i + ofs >= 0))\r\n\t  emitir(IRTG(IR_ABC, IRT_P32), asizeref, ikey);\r\n\treturn;\r\n      }\r\n    }\r\n  }\r\n  emitir(IRTGI(IR_ABC), asizeref, ikey);  /* Emit regular bounds check. */\r\n}\r\n\r\n/* Record indexed key lookup. */\r\nstatic TRef rec_idx_key(jit_State *J, RecordIndex *ix, IRRef *rbref)\r\n{\r\n  TRef key;\r\n  GCtab *t = tabV(&ix->tabv);\r\n  ix->oldv = lj_tab_get(J->L, t, &ix->keyv);  /* Lookup previous value. */\r\n  *rbref = 0;\r\n\r\n  /* Integer keys are looked up in the array part first. */\r\n  key = ix->key;\r\n  if (tref_isnumber(key)) {\r\n    int32_t k = numberVint(&ix->keyv);\r\n    if (!tvisint(&ix->keyv) && numV(&ix->keyv) != (lua_Number)k)\r\n      k = LJ_MAX_ASIZE;\r\n    if ((MSize)k < LJ_MAX_ASIZE) {  /* Potential array key? */\r\n      TRef ikey = lj_opt_narrow_index(J, key);\r\n      TRef asizeref = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_ASIZE);\r\n      if ((MSize)k < t->asize) {  /* Currently an array key? */\r\n\tTRef arrayref;\r\n\trec_idx_abc(J, asizeref, ikey, t->asize);\r\n\tarrayref = emitir(IRT(IR_FLOAD, IRT_P32), ix->tab, IRFL_TAB_ARRAY);\r\n\treturn emitir(IRT(IR_AREF, IRT_P32), arrayref, ikey);\r\n      } else {  /* Currently not in array (may be an array extension)? */\r\n\temitir(IRTGI(IR_ULE), asizeref, ikey);  /* Inv. bounds check. */\r\n\tif (k == 0 && tref_isk(key))\r\n\t  key = lj_ir_knum_zero(J);  /* Canonicalize 0 or +-0.0 to +0.0. */\r\n\t/* And continue with the hash lookup. */\r\n      }\r\n    } else if (!tref_isk(key)) {\r\n      /* We can rule out const numbers which failed the integerness test\r\n      ** above. But all other numbers are potential array keys.\r\n      */\r\n      if (t->asize == 0) {  /* True sparse tables have an empty array part. */\r\n\t/* Guard that the array part stays empty. */\r\n\tTRef tmp = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_ASIZE);\r\n\temitir(IRTGI(IR_EQ), tmp, lj_ir_kint(J, 0));\r\n      } else {\r\n\tlj_trace_err(J, LJ_TRERR_NYITMIX);\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Otherwise the key is located in the hash part. */\r\n  if (t->hmask == 0) {  /* Shortcut for empty hash part. */\r\n    /* Guard that the hash part stays empty. */\r\n    TRef tmp = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_HMASK);\r\n    emitir(IRTGI(IR_EQ), tmp, lj_ir_kint(J, 0));\r\n    return lj_ir_kkptr(J, niltvg(J2G(J)));\r\n  }\r\n  if (tref_isinteger(key))  /* Hash keys are based on numbers, not ints. */\r\n    key = emitir(IRTN(IR_CONV), key, IRCONV_NUM_INT);\r\n  if (tref_isk(key)) {\r\n    /* Optimize lookup of constant hash keys. */\r\n    MSize hslot = (MSize)((char *)ix->oldv - (char *)&noderef(t->node)[0].val);\r\n    if (t->hmask > 0 && hslot <= t->hmask*(MSize)sizeof(Node) &&\r\n\thslot <= 65535*(MSize)sizeof(Node)) {\r\n      TRef node, kslot, hm;\r\n      *rbref = J->cur.nins;  /* Mark possible rollback point. */\r\n      hm = emitir(IRTI(IR_FLOAD), ix->tab, IRFL_TAB_HMASK);\r\n      emitir(IRTGI(IR_EQ), hm, lj_ir_kint(J, (int32_t)t->hmask));\r\n      node = emitir(IRT(IR_FLOAD, IRT_P32), ix->tab, IRFL_TAB_NODE);\r\n      kslot = lj_ir_kslot(J, key, hslot / sizeof(Node));\r\n      return emitir(IRTG(IR_HREFK, IRT_P32), node, kslot);\r\n    }\r\n  }\r\n  /* Fall back to a regular hash lookup. */\r\n  return emitir(IRT(IR_HREF, IRT_P32), ix->tab, key);\r\n}\r\n\r\n/* Determine whether a key is NOT one of the fast metamethod names. */\r\nstatic int nommstr(jit_State *J, TRef key)\r\n{\r\n  if (tref_isstr(key)) {\r\n    if (tref_isk(key)) {\r\n      GCstr *str = ir_kstr(IR(tref_ref(key)));\r\n      uint32_t mm;\r\n      for (mm = 0; mm <= MM_FAST; mm++)\r\n\tif (mmname_str(J2G(J), mm) == str)\r\n\t  return 0;  /* MUST be one the fast metamethod names. */\r\n    } else {\r\n      return 0;  /* Variable string key MAY be a metamethod name. */\r\n    }\r\n  }\r\n  return 1;  /* CANNOT be a metamethod name. */\r\n}\r\n\r\n/* Record indexed load/store. */\r\nTRef lj_record_idx(jit_State *J, RecordIndex *ix)\r\n{\r\n  TRef xref;\r\n  IROp xrefop, loadop;\r\n  IRRef rbref;\r\n  cTValue *oldv;\r\n\r\n  while (!tref_istab(ix->tab)) { /* Handle non-table lookup. */\r\n    /* Never call raw lj_record_idx() on non-table. */\r\n    lua_assert(ix->idxchain != 0);\r\n    if (!lj_record_mm_lookup(J, ix, ix->val ? MM_newindex : MM_index))\r\n      lj_trace_err(J, LJ_TRERR_NOMM);\r\n  handlemm:\r\n    if (tref_isfunc(ix->mobj)) {  /* Handle metamethod call. */\r\n      BCReg func = rec_mm_prep(J, ix->val ? lj_cont_nop : lj_cont_ra);\r\n      TRef *base = J->base + func;\r\n      TValue *tv = J->L->base + func;\r\n      lua_assert(!LJ_FR2);  /* TODO_FR2: handle different frame setup. */\r\n      base[0] = ix->mobj; base[1] = ix->tab; base[2] = ix->key;\r\n      setfuncV(J->L, tv+0, funcV(&ix->mobjv));\r\n      copyTV(J->L, tv+1, &ix->tabv);\r\n      copyTV(J->L, tv+2, &ix->keyv);\r\n      if (ix->val) {\r\n\tbase[3] = ix->val;\r\n\tcopyTV(J->L, tv+3, &ix->valv);\r\n\tlj_record_call(J, func, 3);  /* mobj(tab, key, val) */\r\n\treturn 0;\r\n      } else {\r\n\tlj_record_call(J, func, 2);  /* res = mobj(tab, key) */\r\n\treturn 0;  /* No result yet. */\r\n      }\r\n    }\r\n    /* Otherwise retry lookup with metaobject. */\r\n    ix->tab = ix->mobj;\r\n    copyTV(J->L, &ix->tabv, &ix->mobjv);\r\n    if (--ix->idxchain == 0)\r\n      lj_trace_err(J, LJ_TRERR_IDXLOOP);\r\n  }\r\n\r\n  /* First catch nil and NaN keys for tables. */\r\n  if (tvisnil(&ix->keyv) || (tvisnum(&ix->keyv) && tvisnan(&ix->keyv))) {\r\n    if (ix->val)  /* Better fail early. */\r\n      lj_trace_err(J, LJ_TRERR_STORENN);\r\n    if (tref_isk(ix->key)) {\r\n      if (ix->idxchain && lj_record_mm_lookup(J, ix, MM_index))\r\n\tgoto handlemm;\r\n      return TREF_NIL;\r\n    }\r\n  }\r\n\r\n  /* Record the key lookup. */\r\n  xref = rec_idx_key(J, ix, &rbref);\r\n  xrefop = IR(tref_ref(xref))->o;\r\n  loadop = xrefop == IR_AREF ? IR_ALOAD : IR_HLOAD;\r\n  /* The lj_meta_tset() inconsistency is gone, but better play safe. */\r\n  oldv = xrefop == IR_KKPTR ? (cTValue *)ir_kptr(IR(tref_ref(xref))) : ix->oldv;\r\n\r\n  if (ix->val == 0) {  /* Indexed load */\r\n    IRType t = itype2irt(oldv);\r\n    TRef res;\r\n    if (oldv == niltvg(J2G(J))) {\r\n      emitir(IRTG(IR_EQ, IRT_P32), xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      res = TREF_NIL;\r\n    } else {\r\n      res = emitir(IRTG(loadop, t), xref, 0);\r\n    }\r\n    if (tref_ref(res) < rbref)  /* HREFK + load forwarded? */\r\n      lj_ir_rollback(J, rbref);  /* Rollback to eliminate hmask guard. */\r\n    if (t == IRT_NIL && ix->idxchain && lj_record_mm_lookup(J, ix, MM_index))\r\n      goto handlemm;\r\n    if (irtype_ispri(t)) res = TREF_PRI(t);  /* Canonicalize primitives. */\r\n    return res;\r\n  } else {  /* Indexed store. */\r\n    GCtab *mt = tabref(tabV(&ix->tabv)->metatable);\r\n    int keybarrier = tref_isgcv(ix->key) && !tref_isnil(ix->val);\r\n    if (tref_ref(xref) < rbref)  /* HREFK forwarded? */\r\n      lj_ir_rollback(J, rbref);  /* Rollback to eliminate hmask guard. */\r\n    if (tvisnil(oldv)) {  /* Previous value was nil? */\r\n      /* Need to duplicate the hasmm check for the early guards. */\r\n      int hasmm = 0;\r\n      if (ix->idxchain && mt) {\r\n\tcTValue *mo = lj_tab_getstr(mt, mmname_str(J2G(J), MM_newindex));\r\n\thasmm = mo && !tvisnil(mo);\r\n      }\r\n      if (hasmm)\r\n\temitir(IRTG(loadop, IRT_NIL), xref, 0);  /* Guard for nil value. */\r\n      else if (xrefop == IR_HREF)\r\n\temitir(IRTG(oldv == niltvg(J2G(J)) ? IR_EQ : IR_NE, IRT_P32),\r\n\t       xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      if (ix->idxchain && lj_record_mm_lookup(J, ix, MM_newindex)) {\r\n\tlua_assert(hasmm);\r\n\tgoto handlemm;\r\n      }\r\n      lua_assert(!hasmm);\r\n      if (oldv == niltvg(J2G(J))) {  /* Need to insert a new key. */\r\n\tTRef key = ix->key;\r\n\tif (tref_isinteger(key))  /* NEWREF needs a TValue as a key. */\r\n\t  key = emitir(IRTN(IR_CONV), key, IRCONV_NUM_INT);\r\n\txref = emitir(IRT(IR_NEWREF, IRT_P32), ix->tab, key);\r\n\tkeybarrier = 0;  /* NEWREF already takes care of the key barrier. */\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n\tif ((J->flags & JIT_F_OPT_SINK))  /* Avoid a separate flag. */\r\n\t  rec_idx_bump(J, ix);\r\n#endif\r\n      }\r\n    } else if (!lj_opt_fwd_wasnonnil(J, loadop, tref_ref(xref))) {\r\n      /* Cannot derive that the previous value was non-nil, must do checks. */\r\n      if (xrefop == IR_HREF)  /* Guard against store to niltv. */\r\n\temitir(IRTG(IR_NE, IRT_P32), xref, lj_ir_kkptr(J, niltvg(J2G(J))));\r\n      if (ix->idxchain) {  /* Metamethod lookup required? */\r\n\t/* A check for NULL metatable is cheaper (hoistable) than a load. */\r\n\tif (!mt) {\r\n\t  TRef mtref = emitir(IRT(IR_FLOAD, IRT_TAB), ix->tab, IRFL_TAB_META);\r\n\t  emitir(IRTG(IR_EQ, IRT_TAB), mtref, lj_ir_knull(J, IRT_TAB));\r\n\t} else {\r\n\t  IRType t = itype2irt(oldv);\r\n\t  emitir(IRTG(loadop, t), xref, 0);  /* Guard for non-nil value. */\r\n\t}\r\n      }\r\n    } else {\r\n      keybarrier = 0;  /* Previous non-nil value kept the key alive. */\r\n    }\r\n    /* Convert int to number before storing. */\r\n    if (!LJ_DUALNUM && tref_isinteger(ix->val))\r\n      ix->val = emitir(IRTN(IR_CONV), ix->val, IRCONV_NUM_INT);\r\n    emitir(IRT(loadop+IRDELTA_L2S, tref_type(ix->val)), xref, ix->val);\r\n    if (keybarrier || tref_isgcv(ix->val))\r\n      emitir(IRT(IR_TBAR, IRT_NIL), ix->tab, 0);\r\n    /* Invalidate neg. metamethod cache for stores with certain string keys. */\r\n    if (!nommstr(J, ix->key)) {\r\n      TRef fref = emitir(IRT(IR_FREF, IRT_P32), ix->tab, IRFL_TAB_NOMM);\r\n      emitir(IRT(IR_FSTORE, IRT_U8), fref, lj_ir_kint(J, 0));\r\n    }\r\n    J->needsnap = 1;\r\n    return 0;\r\n  }\r\n}\r\n\r\nstatic void rec_tsetm(jit_State *J, BCReg ra, BCReg rn, int32_t i)\r\n{\r\n  RecordIndex ix;\r\n  cTValue *basev = J->L->base;\r\n  GCtab *t = tabV(&basev[ra-1]);\r\n  settabV(J->L, &ix.tabv, t);\r\n  ix.tab = getslot(J, ra-1);\r\n  ix.idxchain = 0;\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n  if ((J->flags & JIT_F_OPT_SINK)) {\r\n    if (t->asize < i+rn-ra)\r\n      lj_tab_reasize(J->L, t, i+rn-ra);\r\n    setnilV(&ix.keyv);\r\n    rec_idx_bump(J, &ix);\r\n  }\r\n#endif\r\n  for (; ra < rn; i++, ra++) {\r\n    setintV(&ix.keyv, i);\r\n    ix.key = lj_ir_kint(J, i);\r\n    copyTV(J->L, &ix.valv, &basev[ra]);\r\n    ix.val = getslot(J, ra);\r\n    lj_record_idx(J, &ix);\r\n  }\r\n}\r\n\r\n/* -- Upvalue access ------------------------------------------------------ */\r\n\r\n/* Check whether upvalue is immutable and ok to constify. */\r\nstatic int rec_upvalue_constify(jit_State *J, GCupval *uvp)\r\n{\r\n  if (uvp->immutable) {\r\n    cTValue *o = uvval(uvp);\r\n    /* Don't constify objects that may retain large amounts of memory. */\r\n#if LJ_HASFFI\r\n    if (tviscdata(o)) {\r\n      GCcdata *cd = cdataV(o);\r\n      if (!cdataisv(cd) && !(cd->marked & LJ_GC_CDATA_FIN)) {\r\n\tCType *ct = ctype_raw(ctype_ctsG(J2G(J)), cd->ctypeid);\r\n\tif (!ctype_hassize(ct->info) || ct->size <= 16)\r\n\t  return 1;\r\n      }\r\n      return 0;\r\n    }\r\n#else\r\n    UNUSED(J);\r\n#endif\r\n    if (!(tvistab(o) || tvisudata(o) || tvisthread(o)))\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Record upvalue load/store. */\r\nstatic TRef rec_upvalue(jit_State *J, uint32_t uv, TRef val)\r\n{\r\n  GCupval *uvp = &gcref(J->fn->l.uvptr[uv])->uv;\r\n  TRef fn = getcurrf(J);\r\n  IRRef uref;\r\n  int needbarrier = 0;\r\n  if (rec_upvalue_constify(J, uvp)) {  /* Try to constify immutable upvalue. */\r\n    TRef tr, kfunc;\r\n    lua_assert(val == 0);\r\n    if (!tref_isk(fn)) {  /* Late specialization of current function. */\r\n      if (J->pt->flags >= PROTO_CLC_POLY)\r\n\tgoto noconstify;\r\n      kfunc = lj_ir_kfunc(J, J->fn);\r\n      emitir(IRTG(IR_EQ, IRT_FUNC), fn, kfunc);\r\n      J->base[-1] = TREF_FRAME | kfunc;\r\n      fn = kfunc;\r\n    }\r\n    tr = lj_record_constify(J, uvval(uvp));\r\n    if (tr)\r\n      return tr;\r\n  }\r\nnoconstify:\r\n  /* Note: this effectively limits LJ_MAX_UPVAL to 127. */\r\n  uv = (uv << 8) | (hashrot(uvp->dhash, uvp->dhash + HASH_BIAS) & 0xff);\r\n  if (!uvp->closed) {\r\n    /* In current stack? */\r\n    if (uvval(uvp) >= tvref(J->L->stack) &&\r\n\tuvval(uvp) < tvref(J->L->maxstack)) {\r\n      int32_t slot = (int32_t)(uvval(uvp) - (J->L->base - J->baseslot));\r\n      if (slot >= 0) {  /* Aliases an SSA slot? */\r\n\tslot -= (int32_t)J->baseslot;  /* Note: slot number may be negative! */\r\n\t/* NYI: add IR to guard that it's still aliasing the same slot. */\r\n\tif (val == 0) {\r\n\t  return getslot(J, slot);\r\n\t} else {\r\n\t  J->base[slot] = val;\r\n\t  if (slot >= (int32_t)J->maxslot) J->maxslot = (BCReg)(slot+1);\r\n\t  return 0;\r\n\t}\r\n      }\r\n    }\r\n    uref = tref_ref(emitir(IRTG(IR_UREFO, IRT_P32), fn, uv));\r\n  } else {\r\n    needbarrier = 1;\r\n    uref = tref_ref(emitir(IRTG(IR_UREFC, IRT_P32), fn, uv));\r\n  }\r\n  if (val == 0) {  /* Upvalue load */\r\n    IRType t = itype2irt(uvval(uvp));\r\n    TRef res = emitir(IRTG(IR_ULOAD, t), uref, 0);\r\n    if (irtype_ispri(t)) res = TREF_PRI(t);  /* Canonicalize primitive refs. */\r\n    return res;\r\n  } else {  /* Upvalue store. */\r\n    /* Convert int to number before storing. */\r\n    if (!LJ_DUALNUM && tref_isinteger(val))\r\n      val = emitir(IRTN(IR_CONV), val, IRCONV_NUM_INT);\r\n    emitir(IRT(IR_USTORE, tref_type(val)), uref, val);\r\n    if (needbarrier && tref_isgcv(val))\r\n      emitir(IRT(IR_OBAR, IRT_NIL), uref, val);\r\n    J->needsnap = 1;\r\n    return 0;\r\n  }\r\n}\r\n\r\n/* -- Record calls to Lua functions --------------------------------------- */\r\n\r\n/* Check unroll limits for calls. */\r\nstatic void check_call_unroll(jit_State *J, TraceNo lnk)\r\n{\r\n  cTValue *frame = J->L->base - 1;\r\n  void *pc = mref(frame_func(frame)->l.pc, void);\r\n  int32_t depth = J->framedepth;\r\n  int32_t count = 0;\r\n  if ((J->pt->flags & PROTO_VARARG)) depth--;  /* Vararg frame still missing. */\r\n  for (; depth > 0; depth--) {  /* Count frames with same prototype. */\r\n    if (frame_iscont(frame)) depth--;\r\n    frame = frame_prev(frame);\r\n    if (mref(frame_func(frame)->l.pc, void) == pc)\r\n      count++;\r\n  }\r\n  if (J->pc == J->startpc) {\r\n    if (count + J->tailcalled > J->param[JIT_P_recunroll]) {\r\n      J->pc++;\r\n      if (J->framedepth + J->retdepth == 0)\r\n\tlj_record_stop(J, LJ_TRLINK_TAILREC, J->cur.traceno);  /* Tail-rec. */\r\n      else\r\n\tlj_record_stop(J, LJ_TRLINK_UPREC, J->cur.traceno);  /* Up-recursion. */\r\n    }\r\n  } else {\r\n    if (count > J->param[JIT_P_callunroll]) {\r\n      if (lnk) {  /* Possible tail- or up-recursion. */\r\n\tlj_trace_flush(J, lnk);  /* Flush trace that only returns. */\r\n\t/* Set a small, pseudo-random hotcount for a quick retry of JFUNC*. */\r\n\thotcount_set(J2GG(J), J->pc+1, LJ_PRNG_BITS(J, 4));\r\n      }\r\n      lj_trace_err(J, LJ_TRERR_CUNROLL);\r\n    }\r\n  }\r\n}\r\n\r\n/* Record Lua function setup. */\r\nstatic void rec_func_setup(jit_State *J)\r\n{\r\n  GCproto *pt = J->pt;\r\n  BCReg s, numparams = pt->numparams;\r\n  if ((pt->flags & PROTO_NOJIT))\r\n    lj_trace_err(J, LJ_TRERR_CJITOFF);\r\n  if (J->baseslot + pt->framesize >= LJ_MAX_JSLOTS)\r\n    lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  /* Fill up missing parameters with nil. */\r\n  for (s = J->maxslot; s < numparams; s++)\r\n    J->base[s] = TREF_NIL;\r\n  /* The remaining slots should never be read before they are written. */\r\n  J->maxslot = numparams;\r\n}\r\n\r\n/* Record Lua vararg function setup. */\r\nstatic void rec_func_vararg(jit_State *J)\r\n{\r\n  GCproto *pt = J->pt;\r\n  BCReg s, fixargs, vframe = J->maxslot+1;\r\n  lua_assert((pt->flags & PROTO_VARARG));\r\n  if (J->baseslot + vframe + pt->framesize >= LJ_MAX_JSLOTS)\r\n    lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  J->base[vframe-1] = J->base[-1];  /* Copy function up. */\r\n  /* Copy fixarg slots up and set their original slots to nil. */\r\n  fixargs = pt->numparams < J->maxslot ? pt->numparams : J->maxslot;\r\n  for (s = 0; s < fixargs; s++) {\r\n    J->base[vframe+s] = J->base[s];\r\n    J->base[s] = TREF_NIL;\r\n  }\r\n  J->maxslot = fixargs;\r\n  J->framedepth++;\r\n  J->base += vframe;\r\n  J->baseslot += vframe;\r\n}\r\n\r\n/* Record entry to a Lua function. */\r\nstatic void rec_func_lua(jit_State *J)\r\n{\r\n  rec_func_setup(J);\r\n  check_call_unroll(J, 0);\r\n}\r\n\r\n/* Record entry to an already compiled function. */\r\nstatic void rec_func_jit(jit_State *J, TraceNo lnk)\r\n{\r\n  GCtrace *T;\r\n  rec_func_setup(J);\r\n  T = traceref(J, lnk);\r\n  if (T->linktype == LJ_TRLINK_RETURN) {  /* Trace returns to interpreter? */\r\n    check_call_unroll(J, lnk);\r\n    /* Temporarily unpatch JFUNC* to continue recording across function. */\r\n    J->patchins = *J->pc;\r\n    J->patchpc = (BCIns *)J->pc;\r\n    *J->patchpc = T->startins;\r\n    return;\r\n  }\r\n  J->instunroll = 0;  /* Cannot continue across a compiled function. */\r\n  if (J->pc == J->startpc && J->framedepth + J->retdepth == 0)\r\n    lj_record_stop(J, LJ_TRLINK_TAILREC, J->cur.traceno);  /* Extra tail-rec. */\r\n  else\r\n    lj_record_stop(J, LJ_TRLINK_ROOT, lnk);  /* Link to the function. */\r\n}\r\n\r\n/* -- Vararg handling ----------------------------------------------------- */\r\n\r\n/* Detect y = select(x, ...) idiom. */\r\nstatic int select_detect(jit_State *J)\r\n{\r\n  BCIns ins = J->pc[1];\r\n  if (bc_op(ins) == BC_CALLM && bc_b(ins) == 2 && bc_c(ins) == 1) {\r\n    cTValue *func = &J->L->base[bc_a(ins)];\r\n    if (tvisfunc(func) && funcV(func)->c.ffid == FF_select)\r\n      return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Record vararg instruction. */\r\nstatic void rec_varg(jit_State *J, BCReg dst, ptrdiff_t nresults)\r\n{\r\n  int32_t numparams = J->pt->numparams;\r\n  ptrdiff_t nvararg = frame_delta(J->L->base-1) - numparams - 1;\r\n  lua_assert(frame_isvarg(J->L->base-1));\r\n  if (J->framedepth > 0) {  /* Simple case: varargs defined on-trace. */\r\n    ptrdiff_t i;\r\n    if (nvararg < 0) nvararg = 0;\r\n    if (nresults == -1) {\r\n      nresults = nvararg;\r\n      J->maxslot = dst + (BCReg)nvararg;\r\n    } else if (dst + nresults > J->maxslot) {\r\n      J->maxslot = dst + (BCReg)nresults;\r\n    }\r\n    for (i = 0; i < nresults; i++)\r\n      J->base[dst+i] = i < nvararg ? getslot(J, i - nvararg - 1) : TREF_NIL;\r\n  } else {  /* Unknown number of varargs passed to trace. */\r\n    TRef fr = emitir(IRTI(IR_SLOAD), 0, IRSLOAD_READONLY|IRSLOAD_FRAME);\r\n    int32_t frofs = 8*(1+numparams)+FRAME_VARG;\r\n    if (nresults >= 0) {  /* Known fixed number of results. */\r\n      ptrdiff_t i;\r\n      if (nvararg > 0) {\r\n\tptrdiff_t nload = nvararg >= nresults ? nresults : nvararg;\r\n\tTRef vbase;\r\n\tif (nvararg >= nresults)\r\n\t  emitir(IRTGI(IR_GE), fr, lj_ir_kint(J, frofs+8*(int32_t)nresults));\r\n\telse\r\n\t  emitir(IRTGI(IR_EQ), fr,\r\n\t\t lj_ir_kint(J, (int32_t)frame_ftsz(J->L->base-1)));\r\n\tvbase = emitir(IRTI(IR_SUB), REF_BASE, fr);\r\n\tvbase = emitir(IRT(IR_ADD, IRT_P32), vbase, lj_ir_kint(J, frofs-8));\r\n\tfor (i = 0; i < nload; i++) {\r\n\t  IRType t = itype2irt(&J->L->base[i-1-nvararg]);\r\n\t  TRef aref = emitir(IRT(IR_AREF, IRT_P32),\r\n\t\t\t     vbase, lj_ir_kint(J, (int32_t)i));\r\n\t  TRef tr = emitir(IRTG(IR_VLOAD, t), aref, 0);\r\n\t  if (irtype_ispri(t)) tr = TREF_PRI(t);  /* Canonicalize primitives. */\r\n\t  J->base[dst+i] = tr;\r\n\t}\r\n      } else {\r\n\temitir(IRTGI(IR_LE), fr, lj_ir_kint(J, frofs));\r\n\tnvararg = 0;\r\n      }\r\n      for (i = nvararg; i < nresults; i++)\r\n\tJ->base[dst+i] = TREF_NIL;\r\n      if (dst + (BCReg)nresults > J->maxslot)\r\n\tJ->maxslot = dst + (BCReg)nresults;\r\n    } else if (select_detect(J)) {  /* y = select(x, ...) */\r\n      TRef tridx = J->base[dst-1];\r\n      TRef tr = TREF_NIL;\r\n      ptrdiff_t idx = lj_ffrecord_select_mode(J, tridx, &J->L->base[dst-1]);\r\n      if (idx < 0) goto nyivarg;\r\n      if (idx != 0 && !tref_isinteger(tridx))\r\n\ttridx = emitir(IRTGI(IR_CONV), tridx, IRCONV_INT_NUM|IRCONV_INDEX);\r\n      if (idx != 0 && tref_isk(tridx)) {\r\n\temitir(IRTGI(idx <= nvararg ? IR_GE : IR_LT),\r\n\t       fr, lj_ir_kint(J, frofs+8*(int32_t)idx));\r\n\tfrofs -= 8;  /* Bias for 1-based index. */\r\n      } else if (idx <= nvararg) {  /* Compute size. */\r\n\tTRef tmp = emitir(IRTI(IR_ADD), fr, lj_ir_kint(J, -frofs));\r\n\tif (numparams)\r\n\t  emitir(IRTGI(IR_GE), tmp, lj_ir_kint(J, 0));\r\n\ttr = emitir(IRTI(IR_BSHR), tmp, lj_ir_kint(J, 3));\r\n\tif (idx != 0) {\r\n\t  tridx = emitir(IRTI(IR_ADD), tridx, lj_ir_kint(J, -1));\r\n\t  rec_idx_abc(J, tr, tridx, (uint32_t)nvararg);\r\n\t}\r\n      } else {\r\n\tTRef tmp = lj_ir_kint(J, frofs);\r\n\tif (idx != 0) {\r\n\t  TRef tmp2 = emitir(IRTI(IR_BSHL), tridx, lj_ir_kint(J, 3));\r\n\t  tmp = emitir(IRTI(IR_ADD), tmp2, tmp);\r\n\t} else {\r\n\t  tr = lj_ir_kint(J, 0);\r\n\t}\r\n\temitir(IRTGI(IR_LT), fr, tmp);\r\n      }\r\n      if (idx != 0 && idx <= nvararg) {\r\n\tIRType t;\r\n\tTRef aref, vbase = emitir(IRTI(IR_SUB), REF_BASE, fr);\r\n\tvbase = emitir(IRT(IR_ADD, IRT_P32), vbase, lj_ir_kint(J, frofs-8));\r\n\tt = itype2irt(&J->L->base[idx-2-nvararg]);\r\n\taref = emitir(IRT(IR_AREF, IRT_P32), vbase, tridx);\r\n\ttr = emitir(IRTG(IR_VLOAD, t), aref, 0);\r\n\tif (irtype_ispri(t)) tr = TREF_PRI(t);  /* Canonicalize primitives. */\r\n      }\r\n      J->base[dst-2] = tr;\r\n      J->maxslot = dst-1;\r\n      J->bcskip = 2;  /* Skip CALLM + select. */\r\n    } else {\r\n    nyivarg:\r\n      setintV(&J->errinfo, BC_VARG);\r\n      lj_trace_err_info(J, LJ_TRERR_NYIBC);\r\n    }\r\n  }\r\n}\r\n\r\n/* -- Record allocations -------------------------------------------------- */\r\n\r\nstatic TRef rec_tnew(jit_State *J, uint32_t ah)\r\n{\r\n  uint32_t asize = ah & 0x7ff;\r\n  uint32_t hbits = ah >> 11;\r\n  TRef tr;\r\n  if (asize == 0x7ff) asize = 0x801;\r\n  tr = emitir(IRTG(IR_TNEW, IRT_TAB), asize, hbits);\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n  J->rbchash[(tr & (RBCHASH_SLOTS-1))].ref = tref_ref(tr);\r\n  setmref(J->rbchash[(tr & (RBCHASH_SLOTS-1))].pc, J->pc);\r\n  setgcref(J->rbchash[(tr & (RBCHASH_SLOTS-1))].pt, obj2gco(J->pt));\r\n#endif\r\n  return tr;\r\n}\r\n\r\n/* -- Concatenation ------------------------------------------------------- */\r\n\r\nstatic TRef rec_cat(jit_State *J, BCReg baseslot, BCReg topslot)\r\n{\r\n  TRef *top = &J->base[topslot];\r\n  TValue savetv[5];\r\n  BCReg s;\r\n  RecordIndex ix;\r\n  lua_assert(baseslot < topslot);\r\n  for (s = baseslot; s <= topslot; s++)\r\n    (void)getslot(J, s);  /* Ensure all arguments have a reference. */\r\n  if (tref_isnumber_str(top[0]) && tref_isnumber_str(top[-1])) {\r\n    TRef tr, hdr, *trp, *xbase, *base = &J->base[baseslot];\r\n    /* First convert numbers to strings. */\r\n    for (trp = top; trp >= base; trp--) {\r\n      if (tref_isnumber(*trp))\r\n\t*trp = emitir(IRT(IR_TOSTR, IRT_STR), *trp,\r\n\t\t      tref_isnum(*trp) ? IRTOSTR_NUM : IRTOSTR_INT);\r\n      else if (!tref_isstr(*trp))\r\n\tbreak;\r\n    }\r\n    xbase = ++trp;\r\n    tr = hdr = emitir(IRT(IR_BUFHDR, IRT_P32),\r\n\t\t      lj_ir_kptr(J, &J2G(J)->tmpbuf), IRBUFHDR_RESET);\r\n    do {\r\n      tr = emitir(IRT(IR_BUFPUT, IRT_P32), tr, *trp++);\r\n    } while (trp <= top);\r\n    tr = emitir(IRT(IR_BUFSTR, IRT_STR), tr, hdr);\r\n    J->maxslot = (BCReg)(xbase - J->base);\r\n    if (xbase == base) return tr;  /* Return simple concatenation result. */\r\n    /* Pass partial result. */\r\n    topslot = J->maxslot--;\r\n    *xbase = tr;\r\n    top = xbase;\r\n    setstrV(J->L, &ix.keyv, &J2G(J)->strempty);  /* Simulate string result. */\r\n  } else {\r\n    J->maxslot = topslot-1;\r\n    copyTV(J->L, &ix.keyv, &J->L->base[topslot]);\r\n  }\r\n  copyTV(J->L, &ix.tabv, &J->L->base[topslot-1]);\r\n  ix.tab = top[-1];\r\n  ix.key = top[0];\r\n  memcpy(savetv, &J->L->base[topslot-1], sizeof(savetv));  /* Save slots. */\r\n  rec_mm_arith(J, &ix, MM_concat);  /* Call __concat metamethod. */\r\n  memcpy(&J->L->base[topslot-1], savetv, sizeof(savetv));  /* Restore slots. */\r\n  return 0;  /* No result yet. */\r\n}\r\n\r\n/* -- Record bytecode ops ------------------------------------------------- */\r\n\r\n/* Prepare for comparison. */\r\nstatic void rec_comp_prep(jit_State *J)\r\n{\r\n  /* Prevent merging with snapshot #0 (GC exit) since we fixup the PC. */\r\n  if (J->cur.nsnap == 1 && J->cur.snap[0].ref == J->cur.nins)\r\n    emitir_raw(IRT(IR_NOP, IRT_NIL), 0, 0);\r\n  lj_snap_add(J);\r\n}\r\n\r\n/* Fixup comparison. */\r\nstatic void rec_comp_fixup(jit_State *J, const BCIns *pc, int cond)\r\n{\r\n  BCIns jmpins = pc[1];\r\n  const BCIns *npc = pc + 2 + (cond ? bc_j(jmpins) : 0);\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n  /* Set PC to opposite target to avoid re-recording the comp. in side trace. */\r\n  J->cur.snapmap[snap->mapofs + snap->nent] = SNAP_MKPC(npc);\r\n  J->needsnap = 1;\r\n  if (bc_a(jmpins) < J->maxslot) J->maxslot = bc_a(jmpins);\r\n  lj_snap_shrink(J);  /* Shrink last snapshot if possible. */\r\n}\r\n\r\n/* Record the next bytecode instruction (_before_ it's executed). */\r\nvoid lj_record_ins(jit_State *J)\r\n{\r\n  cTValue *lbase;\r\n  RecordIndex ix;\r\n  const BCIns *pc;\r\n  BCIns ins;\r\n  BCOp op;\r\n  TRef ra, rb, rc;\r\n\r\n  /* Perform post-processing action before recording the next instruction. */\r\n  if (LJ_UNLIKELY(J->postproc != LJ_POST_NONE)) {\r\n    switch (J->postproc) {\r\n    case LJ_POST_FIXCOMP:  /* Fixup comparison. */\r\n      pc = (const BCIns *)(uintptr_t)J2G(J)->tmptv.u64;\r\n      rec_comp_fixup(J, pc, (!tvistruecond(&J2G(J)->tmptv2) ^ (bc_op(*pc)&1)));\r\n      /* fallthrough */\r\n    case LJ_POST_FIXGUARD:  /* Fixup and emit pending guard. */\r\n    case LJ_POST_FIXGUARDSNAP:  /* Fixup and emit pending guard and snapshot. */\r\n      if (!tvistruecond(&J2G(J)->tmptv2)) {\r\n\tJ->fold.ins.o ^= 1;  /* Flip guard to opposite. */\r\n\tif (J->postproc == LJ_POST_FIXGUARDSNAP) {\r\n\t  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n\t  J->cur.snapmap[snap->mapofs+snap->nent-1]--;  /* False -> true. */\r\n\t}\r\n      }\r\n      lj_opt_fold(J);  /* Emit pending guard. */\r\n      /* fallthrough */\r\n    case LJ_POST_FIXBOOL:\r\n      if (!tvistruecond(&J2G(J)->tmptv2)) {\r\n\tBCReg s;\r\n\tTValue *tv = J->L->base;\r\n\tfor (s = 0; s < J->maxslot; s++)  /* Fixup stack slot (if any). */\r\n\t  if (J->base[s] == TREF_TRUE && tvisfalse(&tv[s])) {\r\n\t    J->base[s] = TREF_FALSE;\r\n\t    break;\r\n\t  }\r\n      }\r\n      break;\r\n    case LJ_POST_FIXCONST:\r\n      {\r\n\tBCReg s;\r\n\tTValue *tv = J->L->base;\r\n\tfor (s = 0; s < J->maxslot; s++)  /* Constify stack slots (if any). */\r\n\t  if (J->base[s] == TREF_NIL && !tvisnil(&tv[s]))\r\n\t    J->base[s] = lj_record_constify(J, &tv[s]);\r\n      }\r\n      break;\r\n    case LJ_POST_FFRETRY:  /* Suppress recording of retried fast function. */\r\n      if (bc_op(*J->pc) >= BC__MAX)\r\n\treturn;\r\n      break;\r\n    default: lua_assert(0); break;\r\n    }\r\n    J->postproc = LJ_POST_NONE;\r\n  }\r\n\r\n  /* Need snapshot before recording next bytecode (e.g. after a store). */\r\n  if (J->needsnap) {\r\n    J->needsnap = 0;\r\n    lj_snap_purge(J);\r\n    lj_snap_add(J);\r\n    J->mergesnap = 1;\r\n  }\r\n\r\n  /* Skip some bytecodes. */\r\n  if (LJ_UNLIKELY(J->bcskip > 0)) {\r\n    J->bcskip--;\r\n    return;\r\n  }\r\n\r\n  /* Record only closed loops for root traces. */\r\n  pc = J->pc;\r\n  if (J->framedepth == 0 &&\r\n     (MSize)((char *)pc - (char *)J->bc_min) >= J->bc_extent)\r\n    lj_trace_err(J, LJ_TRERR_LLEAVE);\r\n\r\n#ifdef LUA_USE_ASSERT\r\n  rec_check_slots(J);\r\n  rec_check_ir(J);\r\n#endif\r\n\r\n#if LJ_HASPROFILE\r\n  rec_profile_ins(J, pc);\r\n#endif\r\n\r\n  /* Keep a copy of the runtime values of var/num/str operands. */\r\n#define rav\t(&ix.valv)\r\n#define rbv\t(&ix.tabv)\r\n#define rcv\t(&ix.keyv)\r\n\r\n  lbase = J->L->base;\r\n  ins = *pc;\r\n  op = bc_op(ins);\r\n  ra = bc_a(ins);\r\n  ix.val = 0;\r\n  switch (bcmode_a(op)) {\r\n  case BCMvar:\r\n    copyTV(J->L, rav, &lbase[ra]); ix.val = ra = getslot(J, ra); break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n  rb = bc_b(ins);\r\n  rc = bc_c(ins);\r\n  switch (bcmode_b(op)) {\r\n  case BCMnone: rb = 0; rc = bc_d(ins); break;  /* Upgrade rc to 'rd'. */\r\n  case BCMvar:\r\n    copyTV(J->L, rbv, &lbase[rb]); ix.tab = rb = getslot(J, rb); break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n  switch (bcmode_c(op)) {\r\n  case BCMvar:\r\n    copyTV(J->L, rcv, &lbase[rc]); ix.key = rc = getslot(J, rc); break;\r\n  case BCMpri: setpriV(rcv, ~rc); ix.key = rc = TREF_PRI(IRT_NIL+rc); break;\r\n  case BCMnum: { cTValue *tv = proto_knumtv(J->pt, rc);\r\n    copyTV(J->L, rcv, tv); ix.key = rc = tvisint(tv) ? lj_ir_kint(J, intV(tv)) :\r\n    lj_ir_knumint(J, numV(tv)); } break;\r\n  case BCMstr: { GCstr *s = gco2str(proto_kgc(J->pt, ~(ptrdiff_t)rc));\r\n    setstrV(J->L, rcv, s); ix.key = rc = lj_ir_kstr(J, s); } break;\r\n  default: break;  /* Handled later. */\r\n  }\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n#if LJ_HASFFI\r\n    if (tref_iscdata(ra) || tref_iscdata(rc)) {\r\n      rec_mm_comp_cdata(J, &ix, op, ((int)op & 2) ? MM_le : MM_lt);\r\n      break;\r\n    }\r\n#endif\r\n    /* Emit nothing for two numeric or string consts. */\r\n    if (!(tref_isk2(ra,rc) && tref_isnumber_str(ra) && tref_isnumber_str(rc))) {\r\n      IRType ta = tref_isinteger(ra) ? IRT_INT : tref_type(ra);\r\n      IRType tc = tref_isinteger(rc) ? IRT_INT : tref_type(rc);\r\n      int irop;\r\n      if (ta != tc) {\r\n\t/* Widen mixed number/int comparisons to number/number comparison. */\r\n\tif (ta == IRT_INT && tc == IRT_NUM) {\r\n\t  ra = emitir(IRTN(IR_CONV), ra, IRCONV_NUM_INT);\r\n\t  ta = IRT_NUM;\r\n\t} else if (ta == IRT_NUM && tc == IRT_INT) {\r\n\t  rc = emitir(IRTN(IR_CONV), rc, IRCONV_NUM_INT);\r\n\t} else if (LJ_52) {\r\n\t  ta = IRT_NIL;  /* Force metamethod for different types. */\r\n\t} else if (!((ta == IRT_FALSE || ta == IRT_TRUE) &&\r\n\t\t     (tc == IRT_FALSE || tc == IRT_TRUE))) {\r\n\t  break;  /* Interpreter will throw for two different types. */\r\n\t}\r\n      }\r\n      rec_comp_prep(J);\r\n      irop = (int)op - (int)BC_ISLT + (int)IR_LT;\r\n      if (ta == IRT_NUM) {\r\n\tif ((irop & 1)) irop ^= 4;  /* ISGE/ISGT are unordered. */\r\n\tif (!lj_ir_numcmp(numberVnum(rav), numberVnum(rcv), (IROp)irop))\r\n\t  irop ^= 5;\r\n      } else if (ta == IRT_INT) {\r\n\tif (!lj_ir_numcmp(numberVnum(rav), numberVnum(rcv), (IROp)irop))\r\n\t  irop ^= 1;\r\n      } else if (ta == IRT_STR) {\r\n\tif (!lj_ir_strcmp(strV(rav), strV(rcv), (IROp)irop)) irop ^= 1;\r\n\tra = lj_ir_call(J, IRCALL_lj_str_cmp, ra, rc);\r\n\trc = lj_ir_kint(J, 0);\r\n\tta = IRT_INT;\r\n      } else {\r\n\trec_mm_comp(J, &ix, (int)op);\r\n\tbreak;\r\n      }\r\n      emitir(IRTG(irop, ta), ra, rc);\r\n      rec_comp_fixup(J, J->pc, ((int)op ^ irop) & 1);\r\n    }\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n  case BC_ISEQS: case BC_ISNES:\r\n  case BC_ISEQN: case BC_ISNEN:\r\n  case BC_ISEQP: case BC_ISNEP:\r\n#if LJ_HASFFI\r\n    if (tref_iscdata(ra) || tref_iscdata(rc)) {\r\n      rec_mm_comp_cdata(J, &ix, op, MM_eq);\r\n      break;\r\n    }\r\n#endif\r\n    /* Emit nothing for two non-table, non-udata consts. */\r\n    if (!(tref_isk2(ra, rc) && !(tref_istab(ra) || tref_isudata(ra)))) {\r\n      int diff;\r\n      rec_comp_prep(J);\r\n      diff = lj_record_objcmp(J, ra, rc, rav, rcv);\r\n      if (diff == 2 || !(tref_istab(ra) || tref_isudata(ra)))\r\n\trec_comp_fixup(J, J->pc, ((int)op & 1) == !diff);\r\n      else if (diff == 1)  /* Only check __eq if different, but same type. */\r\n\trec_mm_equal(J, &ix, (int)op);\r\n    }\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC:\r\n    if ((op & 1) == tref_istruecond(rc))\r\n      rc = 0;  /* Don't store if condition is not true. */\r\n    /* fallthrough */\r\n  case BC_IST: case BC_ISF:  /* Type specialization suffices. */\r\n    if (bc_a(pc[1]) < J->maxslot)\r\n      J->maxslot = bc_a(pc[1]);  /* Shrink used slots. */\r\n    break;\r\n\r\n  case BC_ISTYPE: case BC_ISNUM:\r\n    /* These coercions need to correspond with lj_meta_istype(). */\r\n    if (LJ_DUALNUM && rc == ~LJ_TNUMX+1)\r\n      ra = lj_opt_narrow_toint(J, ra);\r\n    else if (rc == ~LJ_TNUMX+2)\r\n      ra = lj_ir_tonum(J, ra);\r\n    else if (rc == ~LJ_TSTR+1)\r\n      ra = lj_ir_tostr(J, ra);\r\n    /* else: type specialization suffices. */\r\n    J->base[bc_a(ins)] = ra;\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_NOT:\r\n    /* Type specialization already forces const result. */\r\n    rc = tref_istruecond(rc) ? TREF_FALSE : TREF_TRUE;\r\n    break;\r\n\r\n  case BC_LEN:\r\n    if (tref_isstr(rc))\r\n      rc = emitir(IRTI(IR_FLOAD), rc, IRFL_STR_LEN);\r\n    else if (!LJ_52 && tref_istab(rc))\r\n      rc = lj_ir_call(J, IRCALL_lj_tab_len, rc);\r\n    else\r\n      rc = rec_mm_len(J, rc, rcv);\r\n    break;\r\n\r\n  /* -- Arithmetic ops ---------------------------------------------------- */\r\n\r\n  case BC_UNM:\r\n    if (tref_isnumber_str(rc)) {\r\n      rc = lj_opt_narrow_unm(J, rc, rcv);\r\n    } else {\r\n      ix.tab = rc;\r\n      copyTV(J->L, &ix.tabv, rcv);\r\n      rc = rec_mm_arith(J, &ix, MM_unm);\r\n    }\r\n    break;\r\n\r\n  case BC_ADDNV: case BC_SUBNV: case BC_MULNV: case BC_DIVNV: case BC_MODNV:\r\n    /* Swap rb/rc and rbv/rcv. rav is temp. */\r\n    ix.tab = rc; ix.key = rc = rb; rb = ix.tab;\r\n    copyTV(J->L, rav, rbv);\r\n    copyTV(J->L, rbv, rcv);\r\n    copyTV(J->L, rcv, rav);\r\n    if (op == BC_MODNV)\r\n      goto recmod;\r\n    /* fallthrough */\r\n  case BC_ADDVN: case BC_SUBVN: case BC_MULVN: case BC_DIVVN:\r\n  case BC_ADDVV: case BC_SUBVV: case BC_MULVV: case BC_DIVVV: {\r\n    MMS mm = bcmode_mm(op);\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_arith(J, rb, rc, rbv, rcv,\r\n\t\t\t       (int)mm - (int)MM_add + (int)IR_ADD);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, mm);\r\n    break;\r\n    }\r\n\r\n  case BC_MODVN: case BC_MODVV:\r\n  recmod:\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_mod(J, rb, rc, rcv);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, MM_mod);\r\n    break;\r\n\r\n  case BC_POW:\r\n    if (tref_isnumber_str(rb) && tref_isnumber_str(rc))\r\n      rc = lj_opt_narrow_pow(J, lj_ir_tonum(J, rb), rc, rcv);\r\n    else\r\n      rc = rec_mm_arith(J, &ix, MM_pow);\r\n    break;\r\n\r\n  /* -- Miscellaneous ops ------------------------------------------------- */\r\n\r\n  case BC_CAT:\r\n    rc = rec_cat(J, rb, rc);\r\n    break;\r\n\r\n  /* -- Constant and move ops --------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    /* Clear gap of method call to avoid resurrecting previous refs. */\r\n    if (ra > J->maxslot) J->base[ra-1] = 0;\r\n    break;\r\n  case BC_KSTR: case BC_KNUM: case BC_KPRI:\r\n    break;\r\n  case BC_KSHORT:\r\n    rc = lj_ir_kint(J, (int32_t)(int16_t)rc);\r\n    break;\r\n  case BC_KNIL:\r\n    while (ra <= rc)\r\n      J->base[ra++] = TREF_NIL;\r\n    if (rc >= J->maxslot) J->maxslot = rc+1;\r\n    break;\r\n#if LJ_HASFFI\r\n  case BC_KCDATA:\r\n    rc = lj_ir_kgc(J, proto_kgc(J->pt, ~(ptrdiff_t)rc), IRT_CDATA);\r\n    break;\r\n#endif\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    rc = rec_upvalue(J, rc, 0);\r\n    break;\r\n  case BC_USETV: case BC_USETS: case BC_USETN: case BC_USETP:\r\n    rec_upvalue(J, ra, rc);\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_GGET: case BC_GSET:\r\n    settabV(J->L, &ix.tabv, tabref(J->fn->l.env));\r\n    ix.tab = emitir(IRT(IR_FLOAD, IRT_TAB), getcurrf(J), IRFL_FUNC_ENV);\r\n    ix.idxchain = LJ_MAX_IDXCHAIN;\r\n    rc = lj_record_idx(J, &ix);\r\n    break;\r\n\r\n  case BC_TGETB: case BC_TSETB:\r\n    setintV(&ix.keyv, (int32_t)rc);\r\n    ix.key = lj_ir_kint(J, (int32_t)rc);\r\n    /* fallthrough */\r\n  case BC_TGETV: case BC_TGETS: case BC_TSETV: case BC_TSETS:\r\n    ix.idxchain = LJ_MAX_IDXCHAIN;\r\n    rc = lj_record_idx(J, &ix);\r\n    break;\r\n  case BC_TGETR: case BC_TSETR:\r\n    ix.idxchain = 0;\r\n    rc = lj_record_idx(J, &ix);\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    rec_tsetm(J, ra, (BCReg)(J->L->top - J->L->base), (int32_t)rcv->u32.lo);\r\n    break;\r\n\r\n  case BC_TNEW:\r\n    rc = rec_tnew(J, rc);\r\n    break;\r\n  case BC_TDUP:\r\n    rc = emitir(IRTG(IR_TDUP, IRT_TAB),\r\n\t\tlj_ir_ktab(J, gco2tab(proto_kgc(J->pt, ~(ptrdiff_t)rc))), 0);\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n    J->rbchash[(rc & (RBCHASH_SLOTS-1))].ref = tref_ref(rc);\r\n    setmref(J->rbchash[(rc & (RBCHASH_SLOTS-1))].pc, pc);\r\n    setgcref(J->rbchash[(rc & (RBCHASH_SLOTS-1))].pt, obj2gco(J->pt));\r\n#endif\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_ITERC:\r\n    J->base[ra] = getslot(J, ra-3-LJ_FR2);\r\n    J->base[ra+1] = getslot(J, ra-2-LJ_FR2);\r\n    J->base[ra+2] = getslot(J, ra-1-LJ_FR2);\r\n    { /* Do the actual copy now because lj_record_call needs the values. */\r\n      TValue *b = &J->L->base[ra];\r\n      copyTV(J->L, b, b-3-LJ_FR2);\r\n      copyTV(J->L, b+1, b-2-LJ_FR2);\r\n      copyTV(J->L, b+2, b-1-LJ_FR2);\r\n    }\r\n    lj_record_call(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  /* L->top is set to L->base+ra+rc+NARGS-1+1. See lj_dispatch_ins(). */\r\n  case BC_CALLM:\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra - LJ_FR2;\r\n    /* fallthrough */\r\n  case BC_CALL:\r\n    lj_record_call(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra - LJ_FR2;\r\n    /* fallthrough */\r\n  case BC_CALLT:\r\n    lj_record_tailcall(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  case BC_VARG:\r\n    rec_varg(J, ra, (ptrdiff_t)rb-1);\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    /* L->top is set to L->base+ra+rc+NRESULTS-1, see lj_dispatch_ins(). */\r\n    rc = (BCReg)(J->L->top - J->L->base) - ra + 1;\r\n    /* fallthrough */\r\n  case BC_RET: case BC_RET0: case BC_RET1:\r\n#if LJ_HASPROFILE\r\n    rec_profile_ret(J);\r\n#endif\r\n    lj_record_ret(J, ra, (ptrdiff_t)rc-1);\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORI:\r\n    if (rec_for(J, pc, 0) != LOOPEV_LEAVE)\r\n      J->loopref = J->cur.nins;\r\n    break;\r\n  case BC_JFORI:\r\n    lua_assert(bc_op(pc[(ptrdiff_t)rc-BCBIAS_J]) == BC_JFORL);\r\n    if (rec_for(J, pc, 0) != LOOPEV_LEAVE)  /* Link to existing loop. */\r\n      lj_record_stop(J, LJ_TRLINK_ROOT, bc_d(pc[(ptrdiff_t)rc-BCBIAS_J]));\r\n    /* Continue tracing if the loop is not entered. */\r\n    break;\r\n\r\n  case BC_FORL:\r\n    rec_loop_interp(J, pc, rec_for(J, pc+((ptrdiff_t)rc-BCBIAS_J), 1));\r\n    break;\r\n  case BC_ITERL:\r\n    rec_loop_interp(J, pc, rec_iterl(J, *pc));\r\n    break;\r\n  case BC_LOOP:\r\n    rec_loop_interp(J, pc, rec_loop(J, ra));\r\n    break;\r\n\r\n  case BC_JFORL:\r\n    rec_loop_jit(J, rc, rec_for(J, pc+bc_j(traceref(J, rc)->startins), 1));\r\n    break;\r\n  case BC_JITERL:\r\n    rec_loop_jit(J, rc, rec_iterl(J, traceref(J, rc)->startins));\r\n    break;\r\n  case BC_JLOOP:\r\n    rec_loop_jit(J, rc, rec_loop(J, ra));\r\n    break;\r\n\r\n  case BC_IFORL:\r\n  case BC_IITERL:\r\n  case BC_ILOOP:\r\n  case BC_IFUNCF:\r\n  case BC_IFUNCV:\r\n    lj_trace_err(J, LJ_TRERR_BLACKL);\r\n    break;\r\n\r\n  case BC_JMP:\r\n    if (ra < J->maxslot)\r\n      J->maxslot = ra;  /* Shrink used slots. */\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    rec_func_lua(J);\r\n    break;\r\n  case BC_JFUNCF:\r\n    rec_func_jit(J, rc);\r\n    break;\r\n\r\n  case BC_FUNCV:\r\n    rec_func_vararg(J);\r\n    rec_func_lua(J);\r\n    break;\r\n  case BC_JFUNCV:\r\n    lua_assert(0);  /* Cannot happen. No hotcall counting for varag funcs. */\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    lj_ffrecord_func(J);\r\n    break;\r\n\r\n  default:\r\n    if (op >= BC__MAX) {\r\n      lj_ffrecord_func(J);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case BC_ITERN:\r\n  case BC_ISNEXT:\r\n  case BC_UCLO:\r\n  case BC_FNEW:\r\n    setintV(&J->errinfo, (int32_t)op);\r\n    lj_trace_err_info(J, LJ_TRERR_NYIBC);\r\n    break;\r\n  }\r\n\r\n  /* rc == 0 if we have no result yet, e.g. pending __index metamethod call. */\r\n  if (bcmode_a(op) == BCMdst && rc) {\r\n    J->base[ra] = rc;\r\n    if (ra >= J->maxslot) J->maxslot = ra+1;\r\n  }\r\n\r\n#undef rav\r\n#undef rbv\r\n#undef rcv\r\n\r\n  /* Limit the number of recorded IR instructions. */\r\n  if (J->cur.nins > REF_FIRST+(IRRef)J->param[JIT_P_maxrecord])\r\n    lj_trace_err(J, LJ_TRERR_TRACEOV);\r\n}\r\n\r\n/* -- Recording setup ----------------------------------------------------- */\r\n\r\n/* Setup recording for a root trace started by a hot loop. */\r\nstatic const BCIns *rec_setup_root(jit_State *J)\r\n{\r\n  /* Determine the next PC and the bytecode range for the loop. */\r\n  const BCIns *pcj, *pc = J->pc;\r\n  BCIns ins = *pc;\r\n  BCReg ra = bc_a(ins);\r\n  switch (bc_op(ins)) {\r\n  case BC_FORL:\r\n    J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    pc += 1+bc_j(ins);\r\n    J->bc_min = pc;\r\n    break;\r\n  case BC_ITERL:\r\n    lua_assert(bc_op(pc[-1]) == BC_ITERC);\r\n    J->maxslot = ra + bc_b(pc[-1]) - 1;\r\n    J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    pc += 1+bc_j(ins);\r\n    lua_assert(bc_op(pc[-1]) == BC_JMP);\r\n    J->bc_min = pc;\r\n    break;\r\n  case BC_LOOP:\r\n    /* Only check BC range for real loops, but not for \"repeat until true\". */\r\n    pcj = pc + bc_j(ins);\r\n    ins = *pcj;\r\n    if (bc_op(ins) == BC_JMP && bc_j(ins) < 0) {\r\n      J->bc_min = pcj+1 + bc_j(ins);\r\n      J->bc_extent = (MSize)(-bc_j(ins))*sizeof(BCIns);\r\n    }\r\n    J->maxslot = ra;\r\n    pc++;\r\n    break;\r\n  case BC_RET:\r\n  case BC_RET0:\r\n  case BC_RET1:\r\n    /* No bytecode range check for down-recursive root traces. */\r\n    J->maxslot = ra + bc_d(ins) - 1;\r\n    break;\r\n  case BC_FUNCF:\r\n    /* No bytecode range check for root traces started by a hot call. */\r\n    J->maxslot = J->pt->numparams;\r\n    pc++;\r\n    break;\r\n  case BC_CALLM:\r\n  case BC_CALL:\r\n  case BC_ITERC:\r\n    /* No bytecode range check for stitched traces. */\r\n    pc++;\r\n    break;\r\n  default:\r\n    lua_assert(0);\r\n    break;\r\n  }\r\n  return pc;\r\n}\r\n\r\n/* Setup for recording a new trace. */\r\nvoid lj_record_setup(jit_State *J)\r\n{\r\n  uint32_t i;\r\n\r\n  /* Initialize state related to current trace. */\r\n  memset(J->slot, 0, sizeof(J->slot));\r\n  memset(J->chain, 0, sizeof(J->chain));\r\n#ifdef LUAJIT_ENABLE_TABLE_BUMP\r\n  memset(J->rbchash, 0, sizeof(J->rbchash));\r\n#endif\r\n  memset(J->bpropcache, 0, sizeof(J->bpropcache));\r\n  J->scev.idx = REF_NIL;\r\n  setmref(J->scev.pc, NULL);\r\n\r\n  J->baseslot = 1;  /* Invoking function is at base[-1]. */\r\n  J->base = J->slot + J->baseslot;\r\n  J->maxslot = 0;\r\n  J->framedepth = 0;\r\n  J->retdepth = 0;\r\n\r\n  J->instunroll = J->param[JIT_P_instunroll];\r\n  J->loopunroll = J->param[JIT_P_loopunroll];\r\n  J->tailcalled = 0;\r\n  J->loopref = 0;\r\n\r\n  J->bc_min = NULL;  /* Means no limit. */\r\n  J->bc_extent = ~(MSize)0;\r\n\r\n  /* Emit instructions for fixed references. Also triggers initial IR alloc. */\r\n  emitir_raw(IRT(IR_BASE, IRT_P32), J->parent, J->exitno);\r\n  for (i = 0; i <= 2; i++) {\r\n    IRIns *ir = IR(REF_NIL-i);\r\n    ir->i = 0;\r\n    ir->t.irt = (uint8_t)(IRT_NIL+i);\r\n    ir->o = IR_KPRI;\r\n    ir->prev = 0;\r\n  }\r\n  J->cur.nk = REF_TRUE;\r\n\r\n  J->startpc = J->pc;\r\n  setmref(J->cur.startpc, J->pc);\r\n  if (J->parent) {  /* Side trace. */\r\n    GCtrace *T = traceref(J, J->parent);\r\n    TraceNo root = T->root ? T->root : J->parent;\r\n    J->cur.root = (uint16_t)root;\r\n    J->cur.startins = BCINS_AD(BC_JMP, 0, 0);\r\n    /* Check whether we could at least potentially form an extra loop. */\r\n    if (J->exitno == 0 && T->snap[0].nent == 0) {\r\n      /* We can narrow a FORL for some side traces, too. */\r\n      if (J->pc > proto_bc(J->pt) && bc_op(J->pc[-1]) == BC_JFORI &&\r\n\t  bc_d(J->pc[bc_j(J->pc[-1])-1]) == root) {\r\n\tlj_snap_add(J);\r\n\trec_for_loop(J, J->pc-1, &J->scev, 1);\r\n\tgoto sidecheck;\r\n      }\r\n    } else {\r\n      J->startpc = NULL;  /* Prevent forming an extra loop. */\r\n    }\r\n    lj_snap_replay(J, T);\r\n  sidecheck:\r\n    if (traceref(J, J->cur.root)->nchild >= J->param[JIT_P_maxside] ||\r\n\tT->snap[J->exitno].count >= J->param[JIT_P_hotexit] +\r\n\t\t\t\t    J->param[JIT_P_tryside]) {\r\n      lj_record_stop(J, LJ_TRLINK_INTERP, 0);\r\n    }\r\n  } else {  /* Root trace. */\r\n    J->cur.root = 0;\r\n    J->cur.startins = *J->pc;\r\n    J->pc = rec_setup_root(J);\r\n    /* Note: the loop instruction itself is recorded at the end and not\r\n    ** at the start! So snapshot #0 needs to point to the *next* instruction.\r\n    */\r\n    lj_snap_add(J);\r\n    if (bc_op(J->cur.startins) == BC_FORL)\r\n      rec_for_loop(J, J->pc-1, &J->scev, 1);\r\n    else if (bc_op(J->cur.startins) == BC_ITERC)\r\n      J->startpc = NULL;\r\n    if (1 + J->pt->framesize >= LJ_MAX_JSLOTS)\r\n      lj_trace_err(J, LJ_TRERR_STACKOV);\r\n  }\r\n#if LJ_HASPROFILE\r\n  J->prev_pt = NULL;\r\n  J->prev_line = -1;\r\n#endif\r\n#ifdef LUAJIT_ENABLE_CHECKHOOK\r\n  /* Regularly check for instruction/line hooks from compiled code and\r\n  ** exit to the interpreter if the hooks are set.\r\n  **\r\n  ** This is a compile-time option and disabled by default, since the\r\n  ** hook checks may be quite expensive in tight loops.\r\n  **\r\n  ** Note this is only useful if hooks are *not* set most of the time.\r\n  ** Use this only if you want to *asynchronously* interrupt the execution.\r\n  **\r\n  ** You can set the instruction hook via lua_sethook() with a count of 1\r\n  ** from a signal handler or another native thread. Please have a look\r\n  ** at the first few functions in luajit.c for an example (Ctrl-C handler).\r\n  */\r\n  {\r\n    TRef tr = emitir(IRT(IR_XLOAD, IRT_U8),\r\n\t\t     lj_ir_kptr(J, &J2G(J)->hookmask), IRXLOAD_VOLATILE);\r\n    tr = emitir(IRTI(IR_BAND), tr, lj_ir_kint(J, (LUA_MASKLINE|LUA_MASKCOUNT)));\r\n    emitir(IRTGI(IR_EQ), tr, lj_ir_kint(J, 0));\r\n  }\r\n#endif\r\n}\r\n\r\n#undef IR\r\n#undef emitir_raw\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_record.h",
    "content": "/*\r\n** Trace recorder (bytecode -> SSA IR).\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_RECORD_H\r\n#define _LJ_RECORD_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\n/* Context for recording an indexed load/store. */\r\ntypedef struct RecordIndex {\r\n  TValue tabv;\t\t/* Runtime value of table (or indexed object). */\r\n  TValue keyv;\t\t/* Runtime value of key. */\r\n  TValue valv;\t\t/* Runtime value of stored value. */\r\n  TValue mobjv;\t\t/* Runtime value of metamethod object. */\r\n  GCtab *mtv;\t\t/* Runtime value of metatable object. */\r\n  cTValue *oldv;\t/* Runtime value of previously stored value. */\r\n  TRef tab;\t\t/* Table (or indexed object) reference. */\r\n  TRef key;\t\t/* Key reference. */\r\n  TRef val;\t\t/* Value reference for a store or 0 for a load. */\r\n  TRef mt;\t\t/* Metatable reference. */\r\n  TRef mobj;\t\t/* Metamethod object reference. */\r\n  int idxchain;\t\t/* Index indirections left or 0 for raw lookup. */\r\n} RecordIndex;\r\n\r\nLJ_FUNC int lj_record_objcmp(jit_State *J, TRef a, TRef b,\r\n\t\t\t     cTValue *av, cTValue *bv);\r\nLJ_FUNC void lj_record_stop(jit_State *J, TraceLink linktype, TraceNo lnk);\r\nLJ_FUNC TRef lj_record_constify(jit_State *J, cTValue *o);\r\n\r\nLJ_FUNC void lj_record_call(jit_State *J, BCReg func, ptrdiff_t nargs);\r\nLJ_FUNC void lj_record_tailcall(jit_State *J, BCReg func, ptrdiff_t nargs);\r\nLJ_FUNC void lj_record_ret(jit_State *J, BCReg rbase, ptrdiff_t gotresults);\r\n\r\nLJ_FUNC int lj_record_mm_lookup(jit_State *J, RecordIndex *ix, MMS mm);\r\nLJ_FUNC TRef lj_record_idx(jit_State *J, RecordIndex *ix);\r\n\r\nLJ_FUNC void lj_record_ins(jit_State *J);\r\nLJ_FUNC void lj_record_setup(jit_State *J);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_snap.c",
    "content": "/*\r\n** Snapshot handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_snap_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_target.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#include \"lj_cdata.h\"\r\n#endif\r\n\r\n/* Some local macros to save typing. Undef'd at the end. */\r\n#define IR(ref)\t\t(&J->cur.ir[(ref)])\r\n\r\n/* Pass IR on to next optimization in chain (FOLD). */\r\n#define emitir(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_opt_fold(J))\r\n\r\n/* Emit raw IR without passing through optimizations. */\r\n#define emitir_raw(ot, a, b)\t(lj_ir_set(J, (ot), (a), (b)), lj_ir_emit(J))\r\n\r\n/* -- Snapshot buffer allocation ------------------------------------------ */\r\n\r\n/* Grow snapshot buffer. */\r\nvoid lj_snap_grow_buf_(jit_State *J, MSize need)\r\n{\r\n  MSize maxsnap = (MSize)J->param[JIT_P_maxsnap];\r\n  if (need > maxsnap)\r\n    lj_trace_err(J, LJ_TRERR_SNAPOV);\r\n  lj_mem_growvec(J->L, J->snapbuf, J->sizesnap, maxsnap, SnapShot);\r\n  J->cur.snap = J->snapbuf;\r\n}\r\n\r\n/* Grow snapshot map buffer. */\r\nvoid lj_snap_grow_map_(jit_State *J, MSize need)\r\n{\r\n  if (need < 2*J->sizesnapmap)\r\n    need = 2*J->sizesnapmap;\r\n  else if (need < 64)\r\n    need = 64;\r\n  J->snapmapbuf = (SnapEntry *)lj_mem_realloc(J->L, J->snapmapbuf,\r\n\t\t    J->sizesnapmap*sizeof(SnapEntry), need*sizeof(SnapEntry));\r\n  J->cur.snapmap = J->snapmapbuf;\r\n  J->sizesnapmap = need;\r\n}\r\n\r\n/* -- Snapshot generation ------------------------------------------------- */\r\n\r\n/* Add all modified slots to the snapshot. */\r\nstatic MSize snapshot_slots(jit_State *J, SnapEntry *map, BCReg nslots)\r\n{\r\n  IRRef retf = J->chain[IR_RETF];  /* Limits SLOAD restore elimination. */\r\n  BCReg s;\r\n  MSize n = 0;\r\n  for (s = 0; s < nslots; s++) {\r\n    TRef tr = J->slot[s];\r\n    IRRef ref = tref_ref(tr);\r\n    if (ref) {\r\n      SnapEntry sn = SNAP_TR(s, tr);\r\n      IRIns *ir = IR(ref);\r\n      if (!(sn & (SNAP_CONT|SNAP_FRAME)) &&\r\n\t  ir->o == IR_SLOAD && ir->op1 == s && ref > retf) {\r\n\t/* No need to snapshot unmodified non-inherited slots. */\r\n\tif (!(ir->op2 & IRSLOAD_INHERIT))\r\n\t  continue;\r\n\t/* No need to restore readonly slots and unmodified non-parent slots. */\r\n\tif (!(LJ_DUALNUM && (ir->op2 & IRSLOAD_CONVERT)) &&\r\n\t    (ir->op2 & (IRSLOAD_READONLY|IRSLOAD_PARENT)) != IRSLOAD_PARENT)\r\n\t  sn |= SNAP_NORESTORE;\r\n      }\r\n      if (LJ_SOFTFP && irt_isnum(ir->t))\r\n\tsn |= SNAP_SOFTFPNUM;\r\n      map[n++] = sn;\r\n    }\r\n  }\r\n  return n;\r\n}\r\n\r\n/* Add frame links at the end of the snapshot. */\r\nstatic BCReg snapshot_framelinks(jit_State *J, SnapEntry *map)\r\n{\r\n  cTValue *frame = J->L->base - 1;\r\n  cTValue *lim = J->L->base - J->baseslot;\r\n  GCfunc *fn = frame_func(frame);\r\n  cTValue *ftop = isluafunc(fn) ? (frame+funcproto(fn)->framesize) : J->L->top;\r\n  MSize f = 0;\r\n  lua_assert(!LJ_FR2);  /* TODO_FR2: store 64 bit PCs. */\r\n  map[f++] = SNAP_MKPC(J->pc);  /* The current PC is always the first entry. */\r\n  while (frame > lim) {  /* Backwards traversal of all frames above base. */\r\n    if (frame_islua(frame)) {\r\n      map[f++] = SNAP_MKPC(frame_pc(frame));\r\n      frame = frame_prevl(frame);\r\n    } else if (frame_iscont(frame)) {\r\n      map[f++] = SNAP_MKFTSZ(frame_ftsz(frame));\r\n      map[f++] = SNAP_MKPC(frame_contpc(frame));\r\n      frame = frame_prevd(frame);\r\n    } else {\r\n      lua_assert(!frame_isc(frame));\r\n      map[f++] = SNAP_MKFTSZ(frame_ftsz(frame));\r\n      frame = frame_prevd(frame);\r\n      continue;\r\n    }\r\n    if (frame + funcproto(frame_func(frame))->framesize > ftop)\r\n      ftop = frame + funcproto(frame_func(frame))->framesize;\r\n  }\r\n  lua_assert(f == (MSize)(1 + J->framedepth));\r\n  return (BCReg)(ftop - lim);\r\n}\r\n\r\n/* Take a snapshot of the current stack. */\r\nstatic void snapshot_stack(jit_State *J, SnapShot *snap, MSize nsnapmap)\r\n{\r\n  BCReg nslots = J->baseslot + J->maxslot;\r\n  MSize nent;\r\n  SnapEntry *p;\r\n  /* Conservative estimate. */\r\n  lj_snap_grow_map(J, nsnapmap + nslots + (MSize)J->framedepth+1);\r\n  p = &J->cur.snapmap[nsnapmap];\r\n  nent = snapshot_slots(J, p, nslots);\r\n  snap->topslot = (uint8_t)snapshot_framelinks(J, p + nent);\r\n  snap->mapofs = (uint16_t)nsnapmap;\r\n  snap->ref = (IRRef1)J->cur.nins;\r\n  snap->nent = (uint8_t)nent;\r\n  snap->nslots = (uint8_t)nslots;\r\n  snap->count = 0;\r\n  J->cur.nsnapmap = (uint16_t)(nsnapmap + nent + 1 + J->framedepth);\r\n}\r\n\r\n/* Add or merge a snapshot. */\r\nvoid lj_snap_add(jit_State *J)\r\n{\r\n  MSize nsnap = J->cur.nsnap;\r\n  MSize nsnapmap = J->cur.nsnapmap;\r\n  /* Merge if no ins. inbetween or if requested and no guard inbetween. */\r\n  if (J->mergesnap ? !irt_isguard(J->guardemit) :\r\n      (nsnap > 0 && J->cur.snap[nsnap-1].ref == J->cur.nins)) {\r\n    if (nsnap == 1) {  /* But preserve snap #0 PC. */\r\n      emitir_raw(IRT(IR_NOP, IRT_NIL), 0, 0);\r\n      goto nomerge;\r\n    }\r\n    nsnapmap = J->cur.snap[--nsnap].mapofs;\r\n  } else {\r\n  nomerge:\r\n    lj_snap_grow_buf(J, nsnap+1);\r\n    J->cur.nsnap = (uint16_t)(nsnap+1);\r\n  }\r\n  J->mergesnap = 0;\r\n  J->guardemit.irt = 0;\r\n  snapshot_stack(J, &J->cur.snap[nsnap], nsnapmap);\r\n}\r\n\r\n/* -- Snapshot modification ----------------------------------------------- */\r\n\r\n#define SNAP_USEDEF_SLOTS\t(LJ_MAX_JSLOTS+LJ_STACK_EXTRA)\r\n\r\n/* Find unused slots with reaching-definitions bytecode data-flow analysis. */\r\nstatic BCReg snap_usedef(jit_State *J, uint8_t *udf,\r\n\t\t\t const BCIns *pc, BCReg maxslot)\r\n{\r\n  BCReg s;\r\n  GCobj *o;\r\n\r\n  if (maxslot == 0) return 0;\r\n#ifdef LUAJIT_USE_VALGRIND\r\n  /* Avoid errors for harmless reads beyond maxslot. */\r\n  memset(udf, 1, SNAP_USEDEF_SLOTS);\r\n#else\r\n  memset(udf, 1, maxslot);\r\n#endif\r\n\r\n  /* Treat open upvalues as used. */\r\n  o = gcref(J->L->openupval);\r\n  while (o) {\r\n    if (uvval(gco2uv(o)) < J->L->base) break;\r\n    udf[uvval(gco2uv(o)) - J->L->base] = 0;\r\n    o = gcref(o->gch.nextgc);\r\n  }\r\n\r\n#define USE_SLOT(s)\t\tudf[(s)] &= ~1\r\n#define DEF_SLOT(s)\t\tudf[(s)] *= 3\r\n\r\n  /* Scan through following bytecode and check for uses/defs. */\r\n  lua_assert(pc >= proto_bc(J->pt) && pc < proto_bc(J->pt) + J->pt->sizebc);\r\n  for (;;) {\r\n    BCIns ins = *pc++;\r\n    BCOp op = bc_op(ins);\r\n    switch (bcmode_b(op)) {\r\n    case BCMvar: USE_SLOT(bc_b(ins)); break;\r\n    default: break;\r\n    }\r\n    switch (bcmode_c(op)) {\r\n    case BCMvar: USE_SLOT(bc_c(ins)); break;\r\n    case BCMrbase:\r\n      lua_assert(op == BC_CAT);\r\n      for (s = bc_b(ins); s <= bc_c(ins); s++) USE_SLOT(s);\r\n      for (; s < maxslot; s++) DEF_SLOT(s);\r\n      break;\r\n    case BCMjump:\r\n    handle_jump: {\r\n      BCReg minslot = bc_a(ins);\r\n      if (op >= BC_FORI && op <= BC_JFORL) minslot += FORL_EXT;\r\n      else if (op >= BC_ITERL && op <= BC_JITERL) minslot += bc_b(pc[-2])-1;\r\n      else if (op == BC_UCLO) { pc += bc_j(ins); break; }\r\n      for (s = minslot; s < maxslot; s++) DEF_SLOT(s);\r\n      return minslot < maxslot ? minslot : maxslot;\r\n      }\r\n    case BCMlit:\r\n      if (op == BC_JFORL || op == BC_JITERL || op == BC_JLOOP) {\r\n\tgoto handle_jump;\r\n      } else if (bc_isret(op)) {\r\n\tBCReg top = op == BC_RETM ? maxslot : (bc_a(ins) + bc_d(ins)-1);\r\n\tfor (s = 0; s < bc_a(ins); s++) DEF_SLOT(s);\r\n\tfor (; s < top; s++) USE_SLOT(s);\r\n\tfor (; s < maxslot; s++) DEF_SLOT(s);\r\n\treturn 0;\r\n      }\r\n      break;\r\n    case BCMfunc: return maxslot;  /* NYI: will abort, anyway. */\r\n    default: break;\r\n    }\r\n    switch (bcmode_a(op)) {\r\n    case BCMvar: USE_SLOT(bc_a(ins)); break;\r\n    case BCMdst:\r\n       if (!(op == BC_ISTC || op == BC_ISFC)) DEF_SLOT(bc_a(ins));\r\n       break;\r\n    case BCMbase:\r\n      if (op >= BC_CALLM && op <= BC_VARG) {\r\n\tBCReg top = (op == BC_CALLM || op == BC_CALLMT || bc_c(ins) == 0) ?\r\n\t\t    maxslot : (bc_a(ins) + bc_c(ins)+LJ_FR2);\r\n\tif (LJ_FR2) DEF_SLOT(bc_a(ins)+1);\r\n\ts = bc_a(ins) - ((op == BC_ITERC || op == BC_ITERN) ? 3 : 0);\r\n\tfor (; s < top; s++) USE_SLOT(s);\r\n\tfor (; s < maxslot; s++) DEF_SLOT(s);\r\n\tif (op == BC_CALLT || op == BC_CALLMT) {\r\n\t  for (s = 0; s < bc_a(ins); s++) DEF_SLOT(s);\r\n\t  return 0;\r\n\t}\r\n      } else if (op == BC_KNIL) {\r\n\tfor (s = bc_a(ins); s <= bc_d(ins); s++) DEF_SLOT(s);\r\n      } else if (op == BC_TSETM) {\r\n\tfor (s = bc_a(ins)-1; s < maxslot; s++) USE_SLOT(s);\r\n      }\r\n      break;\r\n    default: break;\r\n    }\r\n    lua_assert(pc >= proto_bc(J->pt) && pc < proto_bc(J->pt) + J->pt->sizebc);\r\n  }\r\n\r\n#undef USE_SLOT\r\n#undef DEF_SLOT\r\n\r\n  return 0;  /* unreachable */\r\n}\r\n\r\n/* Purge dead slots before the next snapshot. */\r\nvoid lj_snap_purge(jit_State *J)\r\n{\r\n  uint8_t udf[SNAP_USEDEF_SLOTS];\r\n  BCReg maxslot = J->maxslot;\r\n  BCReg s = snap_usedef(J, udf, J->pc, maxslot);\r\n  for (; s < maxslot; s++)\r\n    if (udf[s] != 0)\r\n      J->base[s] = 0;  /* Purge dead slots. */\r\n}\r\n\r\n/* Shrink last snapshot. */\r\nvoid lj_snap_shrink(jit_State *J)\r\n{\r\n  SnapShot *snap = &J->cur.snap[J->cur.nsnap-1];\r\n  SnapEntry *map = &J->cur.snapmap[snap->mapofs];\r\n  MSize n, m, nlim, nent = snap->nent;\r\n  uint8_t udf[SNAP_USEDEF_SLOTS];\r\n  BCReg maxslot = J->maxslot;\r\n  BCReg minslot = snap_usedef(J, udf, snap_pc(map[nent]), maxslot);\r\n  BCReg baseslot = J->baseslot;\r\n  maxslot += baseslot;\r\n  minslot += baseslot;\r\n  snap->nslots = (uint8_t)maxslot;\r\n  for (n = m = 0; n < nent; n++) {  /* Remove unused slots from snapshot. */\r\n    BCReg s = snap_slot(map[n]);\r\n    if (s < minslot || (s < maxslot && udf[s-baseslot] == 0))\r\n      map[m++] = map[n];  /* Only copy used slots. */\r\n  }\r\n  snap->nent = (uint8_t)m;\r\n  nlim = J->cur.nsnapmap - snap->mapofs - 1;\r\n  while (n <= nlim) map[m++] = map[n++];  /* Move PC + frame links down. */\r\n  J->cur.nsnapmap = (uint16_t)(snap->mapofs + m);  /* Free up space in map. */\r\n}\r\n\r\n/* -- Snapshot access ----------------------------------------------------- */\r\n\r\n/* Initialize a Bloom Filter with all renamed refs.\r\n** There are very few renames (often none), so the filter has\r\n** very few bits set. This makes it suitable for negative filtering.\r\n*/\r\nstatic BloomFilter snap_renamefilter(GCtrace *T, SnapNo lim)\r\n{\r\n  BloomFilter rfilt = 0;\r\n  IRIns *ir;\r\n  for (ir = &T->ir[T->nins-1]; ir->o == IR_RENAME; ir--)\r\n    if (ir->op2 <= lim)\r\n      bloomset(rfilt, ir->op1);\r\n  return rfilt;\r\n}\r\n\r\n/* Process matching renames to find the original RegSP. */\r\nstatic RegSP snap_renameref(GCtrace *T, SnapNo lim, IRRef ref, RegSP rs)\r\n{\r\n  IRIns *ir;\r\n  for (ir = &T->ir[T->nins-1]; ir->o == IR_RENAME; ir--)\r\n    if (ir->op1 == ref && ir->op2 <= lim)\r\n      rs = ir->prev;\r\n  return rs;\r\n}\r\n\r\n/* Copy RegSP from parent snapshot to the parent links of the IR. */\r\nIRIns *lj_snap_regspmap(GCtrace *T, SnapNo snapno, IRIns *ir)\r\n{\r\n  SnapShot *snap = &T->snap[snapno];\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  BloomFilter rfilt = snap_renamefilter(T, snapno);\r\n  MSize n = 0;\r\n  IRRef ref = 0;\r\n  for ( ; ; ir++) {\r\n    uint32_t rs;\r\n    if (ir->o == IR_SLOAD) {\r\n      if (!(ir->op2 & IRSLOAD_PARENT)) break;\r\n      for ( ; ; n++) {\r\n\tlua_assert(n < snap->nent);\r\n\tif (snap_slot(map[n]) == ir->op1) {\r\n\t  ref = snap_ref(map[n++]);\r\n\t  break;\r\n\t}\r\n      }\r\n    } else if (LJ_SOFTFP && ir->o == IR_HIOP) {\r\n      ref++;\r\n    } else if (ir->o == IR_PVAL) {\r\n      ref = ir->op1 + REF_BIAS;\r\n    } else {\r\n      break;\r\n    }\r\n    rs = T->ir[ref].prev;\r\n    if (bloomtest(rfilt, ref))\r\n      rs = snap_renameref(T, snapno, ref, rs);\r\n    ir->prev = (uint16_t)rs;\r\n    lua_assert(regsp_used(rs));\r\n  }\r\n  return ir;\r\n}\r\n\r\n/* -- Snapshot replay ----------------------------------------------------- */\r\n\r\n/* Replay constant from parent trace. */\r\nstatic TRef snap_replay_const(jit_State *J, IRIns *ir)\r\n{\r\n  /* Only have to deal with constants that can occur in stack slots. */\r\n  switch ((IROp)ir->o) {\r\n  case IR_KPRI: return TREF_PRI(irt_type(ir->t));\r\n  case IR_KINT: return lj_ir_kint(J, ir->i);\r\n  case IR_KGC: return lj_ir_kgc(J, ir_kgc(ir), irt_t(ir->t));\r\n  case IR_KNUM: return lj_ir_k64(J, IR_KNUM, ir_knum(ir));\r\n  case IR_KINT64: return lj_ir_k64(J, IR_KINT64, ir_kint64(ir));\r\n  case IR_KPTR: return lj_ir_kptr(J, ir_kptr(ir));  /* Continuation. */\r\n  default: lua_assert(0); return TREF_NIL; break;\r\n  }\r\n}\r\n\r\n/* De-duplicate parent reference. */\r\nstatic TRef snap_dedup(jit_State *J, SnapEntry *map, MSize nmax, IRRef ref)\r\n{\r\n  MSize j;\r\n  for (j = 0; j < nmax; j++)\r\n    if (snap_ref(map[j]) == ref)\r\n      return J->slot[snap_slot(map[j])] & ~(SNAP_CONT|SNAP_FRAME);\r\n  return 0;\r\n}\r\n\r\n/* Emit parent reference with de-duplication. */\r\nstatic TRef snap_pref(jit_State *J, GCtrace *T, SnapEntry *map, MSize nmax,\r\n\t\t      BloomFilter seen, IRRef ref)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  TRef tr;\r\n  if (irref_isk(ref))\r\n    tr = snap_replay_const(J, ir);\r\n  else if (!regsp_used(ir->prev))\r\n    tr = 0;\r\n  else if (!bloomtest(seen, ref) || (tr = snap_dedup(J, map, nmax, ref)) == 0)\r\n    tr = emitir(IRT(IR_PVAL, irt_type(ir->t)), ref - REF_BIAS, 0);\r\n  return tr;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. Slow path. */\r\nstatic int snap_sunk_store2(jit_State *J, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n      irs->o == IR_FSTORE || irs->o == IR_XSTORE) {\r\n    IRIns *irk = IR(irs->op1);\r\n    if (irk->o == IR_AREF || irk->o == IR_HREFK)\r\n      irk = IR(irk->op1);\r\n    return (IR(irk->op1) == ira);\r\n  }\r\n  return 0;\r\n}\r\n\r\n/* Check whether a sunk store corresponds to an allocation. Fast path. */\r\nstatic LJ_AINLINE int snap_sunk_store(jit_State *J, IRIns *ira, IRIns *irs)\r\n{\r\n  if (irs->s != 255)\r\n    return (ira + irs->s == irs);  /* Fast check. */\r\n  return snap_sunk_store2(J, ira, irs);\r\n}\r\n\r\n/* Replay snapshot state to setup side trace. */\r\nvoid lj_snap_replay(jit_State *J, GCtrace *T)\r\n{\r\n  SnapShot *snap = &T->snap[J->exitno];\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  MSize n, nent = snap->nent;\r\n  BloomFilter seen = 0;\r\n  int pass23 = 0;\r\n  J->framedepth = 0;\r\n  /* Emit IR for slots inherited from parent snapshot. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    BCReg s = snap_slot(sn);\r\n    IRRef ref = snap_ref(sn);\r\n    IRIns *ir = &T->ir[ref];\r\n    TRef tr;\r\n    /* The bloom filter avoids O(nent^2) overhead for de-duping slots. */\r\n    if (bloomtest(seen, ref) && (tr = snap_dedup(J, map, n, ref)) != 0)\r\n      goto setslot;\r\n    bloomset(seen, ref);\r\n    if (irref_isk(ref)) {\r\n      tr = snap_replay_const(J, ir);\r\n    } else if (!regsp_used(ir->prev)) {\r\n      pass23 = 1;\r\n      lua_assert(s != 0);\r\n      tr = s;\r\n    } else {\r\n      IRType t = irt_type(ir->t);\r\n      uint32_t mode = IRSLOAD_INHERIT|IRSLOAD_PARENT;\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM)) t = IRT_NUM;\r\n      if (ir->o == IR_SLOAD) mode |= (ir->op2 & IRSLOAD_READONLY);\r\n      tr = emitir_raw(IRT(IR_SLOAD, t), s, mode);\r\n    }\r\n  setslot:\r\n    J->slot[s] = tr | (sn&(SNAP_CONT|SNAP_FRAME));  /* Same as TREF_* flags. */\r\n    J->framedepth += ((sn & (SNAP_CONT|SNAP_FRAME)) && s);\r\n    if ((sn & SNAP_FRAME))\r\n      J->baseslot = s+1;\r\n  }\r\n  if (pass23) {\r\n    IRIns *irlast = &T->ir[snap->ref];\r\n    pass23 = 0;\r\n    /* Emit dependent PVALs. */\r\n    for (n = 0; n < nent; n++) {\r\n      SnapEntry sn = map[n];\r\n      IRRef refp = snap_ref(sn);\r\n      IRIns *ir = &T->ir[refp];\r\n      if (regsp_reg(ir->r) == RID_SUNK) {\r\n\tif (J->slot[snap_slot(sn)] != snap_slot(sn)) continue;\r\n\tpass23 = 1;\r\n\tlua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP ||\r\n\t\t   ir->o == IR_CNEW || ir->o == IR_CNEWI);\r\n\tif (ir->op1 >= T->nk) snap_pref(J, T, map, nent, seen, ir->op1);\r\n\tif (ir->op2 >= T->nk) snap_pref(J, T, map, nent, seen, ir->op2);\r\n\tif (LJ_HASFFI && ir->o == IR_CNEWI) {\r\n\t  if (LJ_32 && refp+1 < T->nins && (ir+1)->o == IR_HIOP)\r\n\t    snap_pref(J, T, map, nent, seen, (ir+1)->op2);\r\n\t} else {\r\n\t  IRIns *irs;\r\n\t  for (irs = ir+1; irs < irlast; irs++)\r\n\t    if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t      if (snap_pref(J, T, map, nent, seen, irs->op2) == 0)\r\n\t\tsnap_pref(J, T, map, nent, seen, T->ir[irs->op2].op1);\r\n\t      else if ((LJ_SOFTFP || (LJ_32 && LJ_HASFFI)) &&\r\n\t\t       irs+1 < irlast && (irs+1)->o == IR_HIOP)\r\n\t\tsnap_pref(J, T, map, nent, seen, (irs+1)->op2);\r\n\t    }\r\n\t}\r\n      } else if (!irref_isk(refp) && !regsp_used(ir->prev)) {\r\n\tlua_assert(ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n\tJ->slot[snap_slot(sn)] = snap_pref(J, T, map, nent, seen, ir->op1);\r\n      }\r\n    }\r\n    /* Replay sunk instructions. */\r\n    for (n = 0; pass23 && n < nent; n++) {\r\n      SnapEntry sn = map[n];\r\n      IRRef refp = snap_ref(sn);\r\n      IRIns *ir = &T->ir[refp];\r\n      if (regsp_reg(ir->r) == RID_SUNK) {\r\n\tTRef op1, op2;\r\n\tif (J->slot[snap_slot(sn)] != snap_slot(sn)) {  /* De-dup allocs. */\r\n\t  J->slot[snap_slot(sn)] = J->slot[J->slot[snap_slot(sn)]];\r\n\t  continue;\r\n\t}\r\n\top1 = ir->op1;\r\n\tif (op1 >= T->nk) op1 = snap_pref(J, T, map, nent, seen, op1);\r\n\top2 = ir->op2;\r\n\tif (op2 >= T->nk) op2 = snap_pref(J, T, map, nent, seen, op2);\r\n\tif (LJ_HASFFI && ir->o == IR_CNEWI) {\r\n\t  if (LJ_32 && refp+1 < T->nins && (ir+1)->o == IR_HIOP) {\r\n\t    lj_needsplit(J);  /* Emit joining HIOP. */\r\n\t    op2 = emitir_raw(IRT(IR_HIOP, IRT_I64), op2,\r\n\t\t\t     snap_pref(J, T, map, nent, seen, (ir+1)->op2));\r\n\t  }\r\n\t  J->slot[snap_slot(sn)] = emitir(ir->ot, op1, op2);\r\n\t} else {\r\n\t  IRIns *irs;\r\n\t  TRef tr = emitir(ir->ot, op1, op2);\r\n\t  J->slot[snap_slot(sn)] = tr;\r\n\t  for (irs = ir+1; irs < irlast; irs++)\r\n\t    if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t      IRIns *irr = &T->ir[irs->op1];\r\n\t      TRef val, key = irr->op2, tmp = tr;\r\n\t      if (irr->o != IR_FREF) {\r\n\t\tIRIns *irk = &T->ir[key];\r\n\t\tif (irr->o == IR_HREFK)\r\n\t\t  key = lj_ir_kslot(J, snap_replay_const(J, &T->ir[irk->op1]),\r\n\t\t\t\t    irk->op2);\r\n\t\telse\r\n\t\t  key = snap_replay_const(J, irk);\r\n\t\tif (irr->o == IR_HREFK || irr->o == IR_AREF) {\r\n\t\t  IRIns *irf = &T->ir[irr->op1];\r\n\t\t  tmp = emitir(irf->ot, tmp, irf->op2);\r\n\t\t}\r\n\t      }\r\n\t      tmp = emitir(irr->ot, tmp, key);\r\n\t      val = snap_pref(J, T, map, nent, seen, irs->op2);\r\n\t      if (val == 0) {\r\n\t\tIRIns *irc = &T->ir[irs->op2];\r\n\t\tlua_assert(irc->o == IR_CONV && irc->op2 == IRCONV_NUM_INT);\r\n\t\tval = snap_pref(J, T, map, nent, seen, irc->op1);\r\n\t\tval = emitir(IRTN(IR_CONV), val, IRCONV_NUM_INT);\r\n\t      } else if ((LJ_SOFTFP || (LJ_32 && LJ_HASFFI)) &&\r\n\t\t\t irs+1 < irlast && (irs+1)->o == IR_HIOP) {\r\n\t\tIRType t = IRT_I64;\r\n\t\tif (LJ_SOFTFP && irt_type((irs+1)->t) == IRT_SOFTFP)\r\n\t\t  t = IRT_NUM;\r\n\t\tlj_needsplit(J);\r\n\t\tif (irref_isk(irs->op2) && irref_isk((irs+1)->op2)) {\r\n\t\t  uint64_t k = (uint32_t)T->ir[irs->op2].i +\r\n\t\t\t       ((uint64_t)T->ir[(irs+1)->op2].i << 32);\r\n\t\t  val = lj_ir_k64(J, t == IRT_I64 ? IR_KINT64 : IR_KNUM,\r\n\t\t\t\t  lj_ir_k64_find(J, k));\r\n\t\t} else {\r\n\t\t  val = emitir_raw(IRT(IR_HIOP, t), val,\r\n\t\t\t  snap_pref(J, T, map, nent, seen, (irs+1)->op2));\r\n\t\t}\r\n\t\ttmp = emitir(IRT(irs->o, t), tmp, val);\r\n\t\tcontinue;\r\n\t      }\r\n\t      tmp = emitir(irs->ot, tmp, val);\r\n\t    } else if (LJ_HASFFI && irs->o == IR_XBAR && ir->o == IR_CNEW) {\r\n\t      emitir(IRT(IR_XBAR, IRT_NIL), 0, 0);\r\n\t    }\r\n\t}\r\n      }\r\n    }\r\n  }\r\n  J->base = J->slot + J->baseslot;\r\n  J->maxslot = snap->nslots - J->baseslot;\r\n  lj_snap_add(J);\r\n  if (pass23)  /* Need explicit GC step _after_ initial snapshot. */\r\n    emitir_raw(IRTG(IR_GCSTEP, IRT_NIL), 0, 0);\r\n}\r\n\r\n/* -- Snapshot restore ---------------------------------------------------- */\r\n\r\nstatic void snap_unsink(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\tSnapNo snapno, BloomFilter rfilt,\r\n\t\t\tIRIns *ir, TValue *o);\r\n\r\n/* Restore a value from the trace exit state. */\r\nstatic void snap_restoreval(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\t    SnapNo snapno, BloomFilter rfilt,\r\n\t\t\t    IRRef ref, TValue *o)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  IRType1 t = ir->t;\r\n  RegSP rs = ir->prev;\r\n  if (irref_isk(ref)) {  /* Restore constant slot. */\r\n    lj_ir_kvalue(J->L, o, ir);\r\n    return;\r\n  }\r\n  if (LJ_UNLIKELY(bloomtest(rfilt, ref)))\r\n    rs = snap_renameref(T, snapno, ref, rs);\r\n  lua_assert(!LJ_GC64);  /* TODO_GC64: handle 64 bit references. */\r\n  if (ra_hasspill(regsp_spill(rs))) {  /* Restore from spill slot. */\r\n    int32_t *sps = &ex->spill[regsp_spill(rs)];\r\n    if (irt_isinteger(t)) {\r\n      setintV(o, *sps);\r\n#if !LJ_SOFTFP\r\n    } else if (irt_isnum(t)) {\r\n      o->u64 = *(uint64_t *)sps;\r\n#endif\r\n    } else if (LJ_64 && irt_islightud(t)) {\r\n      /* 64 bit lightuserdata which may escape already has the tag bits. */\r\n      o->u64 = *(uint64_t *)sps;\r\n    } else {\r\n      lua_assert(!irt_ispri(t));  /* PRI refs never have a spill slot. */\r\n      setgcV(J->L, o, (GCobj *)(uintptr_t)*(GCSize *)sps, irt_toitype(t));\r\n    }\r\n  } else {  /* Restore from register. */\r\n    Reg r = regsp_reg(rs);\r\n    if (ra_noreg(r)) {\r\n      lua_assert(ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n      snap_restoreval(J, T, ex, snapno, rfilt, ir->op1, o);\r\n      if (LJ_DUALNUM) setnumV(o, (lua_Number)intV(o));\r\n      return;\r\n    } else if (irt_isinteger(t)) {\r\n      setintV(o, (int32_t)ex->gpr[r-RID_MIN_GPR]);\r\n#if !LJ_SOFTFP\r\n    } else if (irt_isnum(t)) {\r\n      setnumV(o, ex->fpr[r-RID_MIN_FPR]);\r\n#endif\r\n    } else if (LJ_64 && irt_islightud(t)) {\r\n      /* 64 bit lightuserdata which may escape already has the tag bits. */\r\n      o->u64 = ex->gpr[r-RID_MIN_GPR];\r\n    } else if (irt_ispri(t)) {\r\n      setpriV(o, irt_toitype(t));\r\n    } else {\r\n      setgcV(J->L, o, (GCobj *)ex->gpr[r-RID_MIN_GPR], irt_toitype(t));\r\n    }\r\n  }\r\n}\r\n\r\n#if LJ_HASFFI\r\n/* Restore raw data from the trace exit state. */\r\nstatic void snap_restoredata(GCtrace *T, ExitState *ex,\r\n\t\t\t     SnapNo snapno, BloomFilter rfilt,\r\n\t\t\t     IRRef ref, void *dst, CTSize sz)\r\n{\r\n  IRIns *ir = &T->ir[ref];\r\n  RegSP rs = ir->prev;\r\n  int32_t *src;\r\n  uint64_t tmp;\r\n  if (irref_isk(ref)) {\r\n    if (ir->o == IR_KNUM || ir->o == IR_KINT64) {\r\n      src = mref(ir->ptr, int32_t);\r\n    } else if (sz == 8) {\r\n      tmp = (uint64_t)(uint32_t)ir->i;\r\n      src = (int32_t *)&tmp;\r\n    } else {\r\n      src = &ir->i;\r\n    }\r\n  } else {\r\n    if (LJ_UNLIKELY(bloomtest(rfilt, ref)))\r\n      rs = snap_renameref(T, snapno, ref, rs);\r\n    if (ra_hasspill(regsp_spill(rs))) {\r\n      src = &ex->spill[regsp_spill(rs)];\r\n      if (sz == 8 && !irt_is64(ir->t)) {\r\n\ttmp = (uint64_t)(uint32_t)*src;\r\n\tsrc = (int32_t *)&tmp;\r\n      }\r\n    } else {\r\n      Reg r = regsp_reg(rs);\r\n      if (ra_noreg(r)) {\r\n\t/* Note: this assumes CNEWI is never used for SOFTFP split numbers. */\r\n\tlua_assert(sz == 8 && ir->o == IR_CONV && ir->op2 == IRCONV_NUM_INT);\r\n\tsnap_restoredata(T, ex, snapno, rfilt, ir->op1, dst, 4);\r\n\t*(lua_Number *)dst = (lua_Number)*(int32_t *)dst;\r\n\treturn;\r\n      }\r\n      src = (int32_t *)&ex->gpr[r-RID_MIN_GPR];\r\n#if !LJ_SOFTFP\r\n      if (r >= RID_MAX_GPR) {\r\n\tsrc = (int32_t *)&ex->fpr[r-RID_MIN_FPR];\r\n#if LJ_TARGET_PPC\r\n\tif (sz == 4) {  /* PPC FPRs are always doubles. */\r\n\t  *(float *)dst = (float)*(double *)src;\r\n\t  return;\r\n\t}\r\n#else\r\n\tif (LJ_BE && sz == 4) src++;\r\n#endif\r\n      }\r\n#endif\r\n    }\r\n  }\r\n  lua_assert(sz == 1 || sz == 2 || sz == 4 || sz == 8);\r\n  if (sz == 4) *(int32_t *)dst = *src;\r\n  else if (sz == 8) *(int64_t *)dst = *(int64_t *)src;\r\n  else if (sz == 1) *(int8_t *)dst = (int8_t)*src;\r\n  else *(int16_t *)dst = (int16_t)*src;\r\n}\r\n#endif\r\n\r\n/* Unsink allocation from the trace exit state. Unsink sunk stores. */\r\nstatic void snap_unsink(jit_State *J, GCtrace *T, ExitState *ex,\r\n\t\t\tSnapNo snapno, BloomFilter rfilt,\r\n\t\t\tIRIns *ir, TValue *o)\r\n{\r\n  lua_assert(ir->o == IR_TNEW || ir->o == IR_TDUP ||\r\n\t     ir->o == IR_CNEW || ir->o == IR_CNEWI);\r\n#if LJ_HASFFI\r\n  if (ir->o == IR_CNEW || ir->o == IR_CNEWI) {\r\n    CTState *cts = ctype_cts(J->L);\r\n    CTypeID id = (CTypeID)T->ir[ir->op1].i;\r\n    CTSize sz = lj_ctype_size(cts, id);\r\n    GCcdata *cd = lj_cdata_new(cts, id, sz);\r\n    setcdataV(J->L, o, cd);\r\n    if (ir->o == IR_CNEWI) {\r\n      uint8_t *p = (uint8_t *)cdataptr(cd);\r\n      lua_assert(sz == 4 || sz == 8);\r\n      if (LJ_32 && sz == 8 && ir+1 < T->ir + T->nins && (ir+1)->o == IR_HIOP) {\r\n\tsnap_restoredata(T, ex, snapno, rfilt, (ir+1)->op2, LJ_LE?p+4:p, 4);\r\n\tif (LJ_BE) p += 4;\r\n\tsz = 4;\r\n      }\r\n      snap_restoredata(T, ex, snapno, rfilt, ir->op2, p, sz);\r\n    } else {\r\n      IRIns *irs, *irlast = &T->ir[T->snap[snapno].ref];\r\n      for (irs = ir+1; irs < irlast; irs++)\r\n\tif (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\t  IRIns *iro = &T->ir[T->ir[irs->op1].op2];\r\n\t  uint8_t *p = (uint8_t *)cd;\r\n\t  CTSize szs;\r\n\t  lua_assert(irs->o == IR_XSTORE && T->ir[irs->op1].o == IR_ADD);\r\n\t  lua_assert(iro->o == IR_KINT || iro->o == IR_KINT64);\r\n\t  if (irt_is64(irs->t)) szs = 8;\r\n\t  else if (irt_isi8(irs->t) || irt_isu8(irs->t)) szs = 1;\r\n\t  else if (irt_isi16(irs->t) || irt_isu16(irs->t)) szs = 2;\r\n\t  else szs = 4;\r\n\t  if (LJ_64 && iro->o == IR_KINT64)\r\n\t    p += (int64_t)ir_k64(iro)->u64;\r\n\t  else\r\n\t    p += iro->i;\r\n\t  lua_assert(p >= (uint8_t *)cdataptr(cd) &&\r\n\t\t     p + szs <= (uint8_t *)cdataptr(cd) + sz);\r\n\t  if (LJ_32 && irs+1 < T->ir + T->nins && (irs+1)->o == IR_HIOP) {\r\n\t    lua_assert(szs == 4);\r\n\t    snap_restoredata(T, ex, snapno, rfilt, (irs+1)->op2, LJ_LE?p+4:p,4);\r\n\t    if (LJ_BE) p += 4;\r\n\t  }\r\n\t  snap_restoredata(T, ex, snapno, rfilt, irs->op2, p, szs);\r\n\t}\r\n    }\r\n  } else\r\n#endif\r\n  {\r\n    IRIns *irs, *irlast;\r\n    GCtab *t = ir->o == IR_TNEW ? lj_tab_new(J->L, ir->op1, ir->op2) :\r\n\t\t\t\t  lj_tab_dup(J->L, ir_ktab(&T->ir[ir->op1]));\r\n    settabV(J->L, o, t);\r\n    irlast = &T->ir[T->snap[snapno].ref];\r\n    for (irs = ir+1; irs < irlast; irs++)\r\n      if (irs->r == RID_SINK && snap_sunk_store(J, ir, irs)) {\r\n\tIRIns *irk = &T->ir[irs->op1];\r\n\tTValue tmp, *val;\r\n\tlua_assert(irs->o == IR_ASTORE || irs->o == IR_HSTORE ||\r\n\t\t   irs->o == IR_FSTORE);\r\n\tif (irk->o == IR_FREF) {\r\n\t  lua_assert(irk->op2 == IRFL_TAB_META);\r\n\t  snap_restoreval(J, T, ex, snapno, rfilt, irs->op2, &tmp);\r\n\t  /* NOBARRIER: The table is new (marked white). */\r\n\t  setgcref(t->metatable, obj2gco(tabV(&tmp)));\r\n\t} else {\r\n\t  irk = &T->ir[irk->op2];\r\n\t  if (irk->o == IR_KSLOT) irk = &T->ir[irk->op1];\r\n\t  lj_ir_kvalue(J->L, &tmp, irk);\r\n\t  val = lj_tab_set(J->L, t, &tmp);\r\n\t  /* NOBARRIER: The table is new (marked white). */\r\n\t  snap_restoreval(J, T, ex, snapno, rfilt, irs->op2, val);\r\n\t  if (LJ_SOFTFP && irs+1 < T->ir + T->nins && (irs+1)->o == IR_HIOP) {\r\n\t    snap_restoreval(J, T, ex, snapno, rfilt, (irs+1)->op2, &tmp);\r\n\t    val->u32.hi = tmp.u32.lo;\r\n\t  }\r\n\t}\r\n      }\r\n  }\r\n}\r\n\r\n/* Restore interpreter state from exit state with the help of a snapshot. */\r\nconst BCIns *lj_snap_restore(jit_State *J, void *exptr)\r\n{\r\n  ExitState *ex = (ExitState *)exptr;\r\n  SnapNo snapno = J->exitno;  /* For now, snapno == exitno. */\r\n  GCtrace *T = traceref(J, J->parent);\r\n  SnapShot *snap = &T->snap[snapno];\r\n  MSize n, nent = snap->nent;\r\n  SnapEntry *map = &T->snapmap[snap->mapofs];\r\n  SnapEntry *flinks = &T->snapmap[snap_nextofs(T, snap)-1];\r\n  ptrdiff_t ftsz0;\r\n  TValue *frame;\r\n  BloomFilter rfilt = snap_renamefilter(T, snapno);\r\n  const BCIns *pc = snap_pc(map[nent]);\r\n  lua_State *L = J->L;\r\n\r\n  /* Set interpreter PC to the next PC to get correct error messages. */\r\n  setcframe_pc(cframe_raw(L->cframe), pc+1);\r\n\r\n  /* Make sure the stack is big enough for the slots from the snapshot. */\r\n  if (LJ_UNLIKELY(L->base + snap->topslot >= tvref(L->maxstack))) {\r\n    L->top = curr_topL(L);\r\n    lj_state_growstack(L, snap->topslot - curr_proto(L)->framesize);\r\n  }\r\n\r\n  /* Fill stack slots with data from the registers and spill slots. */\r\n  frame = L->base-1;\r\n  ftsz0 = frame_ftsz(frame);  /* Preserve link to previous frame in slot #0. */\r\n  for (n = 0; n < nent; n++) {\r\n    SnapEntry sn = map[n];\r\n    if (!(sn & SNAP_NORESTORE)) {\r\n      TValue *o = &frame[snap_slot(sn)];\r\n      IRRef ref = snap_ref(sn);\r\n      IRIns *ir = &T->ir[ref];\r\n      if (ir->r == RID_SUNK) {\r\n\tMSize j;\r\n\tfor (j = 0; j < n; j++)\r\n\t  if (snap_ref(map[j]) == ref) {  /* De-duplicate sunk allocations. */\r\n\t    copyTV(L, o, &frame[snap_slot(map[j])]);\r\n\t    goto dupslot;\r\n\t  }\r\n\tsnap_unsink(J, T, ex, snapno, rfilt, ir, o);\r\n      dupslot:\r\n\tcontinue;\r\n      }\r\n      snap_restoreval(J, T, ex, snapno, rfilt, ref, o);\r\n      if (LJ_SOFTFP && (sn & SNAP_SOFTFPNUM) && tvisint(o)) {\r\n\tTValue tmp;\r\n\tsnap_restoreval(J, T, ex, snapno, rfilt, ref+1, &tmp);\r\n\to->u32.hi = tmp.u32.lo;\r\n      } else if ((sn & (SNAP_CONT|SNAP_FRAME))) {\r\n\tlua_assert(!LJ_FR2);  /* TODO_FR2: store 64 bit PCs. */\r\n\t/* Overwrite tag with frame link. */\r\n\tsetframe_ftsz(o, snap_slot(sn) != 0 ? (int32_t)*flinks-- : ftsz0);\r\n\tL->base = o+1;\r\n      }\r\n    }\r\n  }\r\n  lua_assert(map + nent == flinks);\r\n\r\n  /* Compute current stack top. */\r\n  switch (bc_op(*pc)) {\r\n  default:\r\n    if (bc_op(*pc) < BC_FUNCF) {\r\n      L->top = curr_topL(L);\r\n      break;\r\n    }\r\n    /* fallthrough */\r\n  case BC_CALLM: case BC_CALLMT: case BC_RETM: case BC_TSETM:\r\n    L->top = frame + snap->nslots;\r\n    break;\r\n  }\r\n  return pc;\r\n}\r\n\r\n#undef IR\r\n#undef emitir_raw\r\n#undef emitir\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_snap.h",
    "content": "/*\r\n** Snapshot handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_SNAP_H\r\n#define _LJ_SNAP_H\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_jit.h\"\r\n\r\n#if LJ_HASJIT\r\nLJ_FUNC void lj_snap_add(jit_State *J);\r\nLJ_FUNC void lj_snap_purge(jit_State *J);\r\nLJ_FUNC void lj_snap_shrink(jit_State *J);\r\nLJ_FUNC IRIns *lj_snap_regspmap(GCtrace *T, SnapNo snapno, IRIns *ir);\r\nLJ_FUNC void lj_snap_replay(jit_State *J, GCtrace *T);\r\nLJ_FUNC const BCIns *lj_snap_restore(jit_State *J, void *exptr);\r\nLJ_FUNC void lj_snap_grow_buf_(jit_State *J, MSize need);\r\nLJ_FUNC void lj_snap_grow_map_(jit_State *J, MSize need);\r\n\r\nstatic LJ_AINLINE void lj_snap_grow_buf(jit_State *J, MSize need)\r\n{\r\n  if (LJ_UNLIKELY(need > J->sizesnap)) lj_snap_grow_buf_(J, need);\r\n}\r\n\r\nstatic LJ_AINLINE void lj_snap_grow_map(jit_State *J, MSize need)\r\n{\r\n  if (LJ_UNLIKELY(need > J->sizesnapmap)) lj_snap_grow_map_(J, need);\r\n}\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_state.c",
    "content": "/*\r\n** State and stack handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_state_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_func.h\"\r\n#include \"lj_meta.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_frame.h\"\r\n#if LJ_HASFFI\r\n#include \"lj_ctype.h\"\r\n#endif\r\n#include \"lj_trace.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_lex.h\"\r\n#include \"lj_alloc.h\"\r\n#include \"luajit.h\"\r\n\r\n/* -- Stack handling ------------------------------------------------------ */\r\n\r\n/* Stack sizes. */\r\n#define LJ_STACK_MIN\tLUA_MINSTACK\t/* Min. stack size. */\r\n#define LJ_STACK_MAX\tLUAI_MAXSTACK\t/* Max. stack size. */\r\n#define LJ_STACK_START\t(2*LJ_STACK_MIN)\t/* Starting stack size. */\r\n#define LJ_STACK_MAXEX\t(LJ_STACK_MAX + 1 + LJ_STACK_EXTRA)\r\n\r\n/* Explanation of LJ_STACK_EXTRA:\r\n**\r\n** Calls to metamethods store their arguments beyond the current top\r\n** without checking for the stack limit. This avoids stack resizes which\r\n** would invalidate passed TValue pointers. The stack check is performed\r\n** later by the function header. This can safely resize the stack or raise\r\n** an error. Thus we need some extra slots beyond the current stack limit.\r\n**\r\n** Most metamethods need 4 slots above top (cont, mobj, arg1, arg2) plus\r\n** one extra slot if mobj is not a function. Only lj_meta_tset needs 5\r\n** slots above top, but then mobj is always a function. So we can get by\r\n** with 5 extra slots.\r\n** LJ_FR2: We need 2 more slots for the frame PC and the continuation PC.\r\n*/\r\n\r\n/* Resize stack slots and adjust pointers in state. */\r\nstatic void resizestack(lua_State *L, MSize n)\r\n{\r\n  TValue *st, *oldst = tvref(L->stack);\r\n  ptrdiff_t delta;\r\n  MSize oldsize = L->stacksize;\r\n  MSize realsize = n + 1 + LJ_STACK_EXTRA;\r\n  GCobj *up;\r\n  lua_assert((MSize)(tvref(L->maxstack)-oldst)==L->stacksize-LJ_STACK_EXTRA-1);\r\n  st = (TValue *)lj_mem_realloc(L, tvref(L->stack),\r\n\t\t\t\t(MSize)(oldsize*sizeof(TValue)),\r\n\t\t\t\t(MSize)(realsize*sizeof(TValue)));\r\n  setmref(L->stack, st);\r\n  delta = (char *)st - (char *)oldst;\r\n  setmref(L->maxstack, st + n);\r\n  while (oldsize < realsize)  /* Clear new slots. */\r\n    setnilV(st + oldsize++);\r\n  L->stacksize = realsize;\r\n  if ((size_t)(mref(G(L)->jit_base, char) - (char *)oldst) < oldsize)\r\n    setmref(G(L)->jit_base, mref(G(L)->jit_base, char) + delta);\r\n  L->base = (TValue *)((char *)L->base + delta);\r\n  L->top = (TValue *)((char *)L->top + delta);\r\n  for (up = gcref(L->openupval); up != NULL; up = gcnext(up))\r\n    setmref(gco2uv(up)->v, (TValue *)((char *)uvval(gco2uv(up)) + delta));\r\n}\r\n\r\n/* Relimit stack after error, in case the limit was overdrawn. */\r\nvoid lj_state_relimitstack(lua_State *L)\r\n{\r\n  if (L->stacksize > LJ_STACK_MAXEX && L->top-tvref(L->stack) < LJ_STACK_MAX-1)\r\n    resizestack(L, LJ_STACK_MAX);\r\n}\r\n\r\n/* Try to shrink the stack (called from GC). */\r\nvoid lj_state_shrinkstack(lua_State *L, MSize used)\r\n{\r\n  if (L->stacksize > LJ_STACK_MAXEX)\r\n    return;  /* Avoid stack shrinking while handling stack overflow. */\r\n  if (4*used < L->stacksize &&\r\n      2*(LJ_STACK_START+LJ_STACK_EXTRA) < L->stacksize &&\r\n      /* Don't shrink stack of live trace. */\r\n      (tvref(G(L)->jit_base) == NULL || obj2gco(L) != gcref(G(L)->cur_L)))\r\n    resizestack(L, L->stacksize >> 1);\r\n}\r\n\r\n/* Try to grow stack. */\r\nvoid LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need)\r\n{\r\n  MSize n;\r\n  if (L->stacksize > LJ_STACK_MAXEX)  /* Overflow while handling overflow? */\r\n    lj_err_throw(L, LUA_ERRERR);\r\n  n = L->stacksize + need;\r\n  if (n > LJ_STACK_MAX) {\r\n    n += 2*LUA_MINSTACK;\r\n  } else if (n < 2*L->stacksize) {\r\n    n = 2*L->stacksize;\r\n    if (n >= LJ_STACK_MAX)\r\n      n = LJ_STACK_MAX;\r\n  }\r\n  resizestack(L, n);\r\n  if (L->stacksize > LJ_STACK_MAXEX)\r\n    lj_err_msg(L, LJ_ERR_STKOV);\r\n}\r\n\r\nvoid LJ_FASTCALL lj_state_growstack1(lua_State *L)\r\n{\r\n  lj_state_growstack(L, 1);\r\n}\r\n\r\n/* Allocate basic stack for new state. */\r\nstatic void stack_init(lua_State *L1, lua_State *L)\r\n{\r\n  TValue *stend, *st = lj_mem_newvec(L, LJ_STACK_START+LJ_STACK_EXTRA, TValue);\r\n  setmref(L1->stack, st);\r\n  L1->stacksize = LJ_STACK_START + LJ_STACK_EXTRA;\r\n  stend = st + L1->stacksize;\r\n  setmref(L1->maxstack, stend - LJ_STACK_EXTRA - 1);\r\n  setthreadV(L1, st++, L1);  /* Needed for curr_funcisL() on empty stack. */\r\n  if (LJ_FR2) setnilV(st++);\r\n  L1->base = L1->top = st;\r\n  while (st < stend)  /* Clear new slots. */\r\n    setnilV(st++);\r\n}\r\n\r\n/* -- State handling ------------------------------------------------------ */\r\n\r\n/* Open parts that may cause memory-allocation errors. */\r\nstatic TValue *cpluaopen(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  global_State *g = G(L);\r\n  UNUSED(dummy);\r\n  UNUSED(ud);\r\n  stack_init(L, L);\r\n  /* NOBARRIER: State initialization, all objects are white. */\r\n  setgcref(L->env, obj2gco(lj_tab_new(L, 0, LJ_MIN_GLOBAL)));\r\n  settabV(L, registry(L), lj_tab_new(L, 0, LJ_MIN_REGISTRY));\r\n  lj_str_resize(L, LJ_MIN_STRTAB-1);\r\n  lj_meta_init(L);\r\n  lj_lex_init(L);\r\n  fixstring(lj_err_str(L, LJ_ERR_ERRMEM));  /* Preallocate memory error msg. */\r\n  g->gc.threshold = 4*g->gc.total;\r\n  lj_trace_initstate(g);\r\n  return NULL;\r\n}\r\n\r\nstatic void close_state(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lj_gc_freeall(g);\r\n  lua_assert(gcref(g->gc.root) == obj2gco(L));\r\n  lua_assert(g->strnum == 0);\r\n  lj_trace_freestate(g);\r\n#if LJ_HASFFI\r\n  lj_ctype_freestate(g);\r\n#endif\r\n  lj_mem_freevec(g, g->strhash, g->strmask+1, GCRef);\r\n  lj_buf_free(g, &g->tmpbuf);\r\n  lj_mem_freevec(g, tvref(L->stack), L->stacksize, TValue);\r\n  lua_assert(g->gc.total == sizeof(GG_State));\r\n#ifndef LUAJIT_USE_SYSMALLOC\r\n  if (g->allocf == lj_alloc_f)\r\n    lj_alloc_destroy(g->allocd);\r\n  else\r\n#endif\r\n    g->allocf(g->allocd, G2GG(g), sizeof(GG_State), 0);\r\n}\r\n\r\n#if LJ_64 && !(defined(LUAJIT_USE_VALGRIND) && defined(LUAJIT_USE_SYSMALLOC))\r\nlua_State *lj_state_newstate(lua_Alloc f, void *ud)\r\n#else\r\nLUA_API lua_State *lua_newstate(lua_Alloc f, void *ud)\r\n#endif\r\n{\r\n  GG_State *GG = (GG_State *)f(ud, NULL, 0, sizeof(GG_State));\r\n  lua_State *L = &GG->L;\r\n  global_State *g = &GG->g;\r\n  if (GG == NULL || !checkptrGC(GG)) return NULL;\r\n  memset(GG, 0, sizeof(GG_State));\r\n  L->gct = ~LJ_TTHREAD;\r\n  L->marked = LJ_GC_WHITE0 | LJ_GC_FIXED | LJ_GC_SFIXED;  /* Prevent free. */\r\n  L->dummy_ffid = FF_C;\r\n  setmref(L->glref, g);\r\n  g->gc.currentwhite = LJ_GC_WHITE0 | LJ_GC_FIXED;\r\n  g->strempty.marked = LJ_GC_WHITE0;\r\n  g->strempty.gct = ~LJ_TSTR;\r\n  g->allocf = f;\r\n  g->allocd = ud;\r\n  setgcref(g->mainthref, obj2gco(L));\r\n  setgcref(g->uvhead.prev, obj2gco(&g->uvhead));\r\n  setgcref(g->uvhead.next, obj2gco(&g->uvhead));\r\n  g->strmask = ~(MSize)0;\r\n  setnilV(registry(L));\r\n  setnilV(&g->nilnode.val);\r\n  setnilV(&g->nilnode.key);\r\n#if !LJ_GC64\r\n  setmref(g->nilnode.freetop, &g->nilnode);\r\n#endif\r\n  lj_buf_init(NULL, &g->tmpbuf);\r\n  g->gc.state = GCSpause;\r\n  setgcref(g->gc.root, obj2gco(L));\r\n  setmref(g->gc.sweep, &g->gc.root);\r\n  g->gc.total = sizeof(GG_State);\r\n  g->gc.pause = LUAI_GCPAUSE;\r\n  g->gc.stepmul = LUAI_GCMUL;\r\n  lj_dispatch_init((GG_State *)L);\r\n  L->status = LUA_ERRERR+1;  /* Avoid touching the stack upon memory error. */\r\n  if (lj_vm_cpcall(L, NULL, NULL, cpluaopen) != 0) {\r\n    /* Memory allocation error: free partial state. */\r\n    close_state(L);\r\n    return NULL;\r\n  }\r\n  L->status = 0;\r\n  return L;\r\n}\r\n\r\nstatic TValue *cpfinalize(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  UNUSED(dummy);\r\n  UNUSED(ud);\r\n  lj_gc_finalize_cdata(L);\r\n  lj_gc_finalize_udata(L);\r\n  /* Frame pop omitted. */\r\n  return NULL;\r\n}\r\n\r\nLUA_API void lua_close(lua_State *L)\r\n{\r\n  global_State *g = G(L);\r\n  int i;\r\n  L = mainthread(g);  /* Only the main thread can be closed. */\r\n#if LJ_HASPROFILE\r\n  luaJIT_profile_stop(L);\r\n#endif\r\n  setgcrefnull(g->cur_L);\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lj_gc_separateudata(g, 1);  /* Separate udata which have GC metamethods. */\r\n#if LJ_HASJIT\r\n  G2J(g)->flags &= ~JIT_F_ON;\r\n  G2J(g)->state = LJ_TRACE_IDLE;\r\n  lj_dispatch_update(g);\r\n#endif\r\n  for (i = 0;;) {\r\n    hook_enter(g);\r\n    L->status = 0;\r\n    L->base = L->top = tvref(L->stack) + 1 + LJ_FR2;\r\n    L->cframe = NULL;\r\n    if (lj_vm_cpcall(L, NULL, NULL, cpfinalize) == 0) {\r\n      if (++i >= 10) break;\r\n      lj_gc_separateudata(g, 1);  /* Separate udata again. */\r\n      if (gcref(g->gc.mmudata) == NULL)  /* Until nothing is left to do. */\r\n\tbreak;\r\n    }\r\n  }\r\n  close_state(L);\r\n}\r\n\r\nlua_State *lj_state_new(lua_State *L)\r\n{\r\n  lua_State *L1 = lj_mem_newobj(L, lua_State);\r\n  L1->gct = ~LJ_TTHREAD;\r\n  L1->dummy_ffid = FF_C;\r\n  L1->status = 0;\r\n  L1->stacksize = 0;\r\n  setmref(L1->stack, NULL);\r\n  L1->cframe = NULL;\r\n  /* NOBARRIER: The lua_State is new (marked white). */\r\n  setgcrefnull(L1->openupval);\r\n  setmrefr(L1->glref, L->glref);\r\n  setgcrefr(L1->env, L->env);\r\n  stack_init(L1, L);  /* init stack */\r\n  lua_assert(iswhite(obj2gco(L1)));\r\n  return L1;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_state_free(global_State *g, lua_State *L)\r\n{\r\n  lua_assert(L != mainthread(g));\r\n  if (obj2gco(L) == gcref(g->cur_L))\r\n    setgcrefnull(g->cur_L);\r\n  lj_func_closeuv(L, tvref(L->stack));\r\n  lua_assert(gcref(L->openupval) == NULL);\r\n  lj_mem_freevec(g, tvref(L->stack), L->stacksize, TValue);\r\n  lj_mem_freet(g, L);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_state.h",
    "content": "/*\r\n** State and stack handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STATE_H\r\n#define _LJ_STATE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#define incr_top(L) \\\r\n  (++L->top >= tvref(L->maxstack) && (lj_state_growstack1(L), 0))\r\n\r\n#define savestack(L, p)\t\t((char *)(p) - mref(L->stack, char))\r\n#define restorestack(L, n)\t((TValue *)(mref(L->stack, char) + (n)))\r\n\r\nLJ_FUNC void lj_state_relimitstack(lua_State *L);\r\nLJ_FUNC void lj_state_shrinkstack(lua_State *L, MSize used);\r\nLJ_FUNCA void LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need);\r\nLJ_FUNC void LJ_FASTCALL lj_state_growstack1(lua_State *L);\r\n\r\nstatic LJ_AINLINE void lj_state_checkstack(lua_State *L, MSize need)\r\n{\r\n  if ((mref(L->maxstack, char) - (char *)L->top) <=\r\n      (ptrdiff_t)need*(ptrdiff_t)sizeof(TValue))\r\n    lj_state_growstack(L, need);\r\n}\r\n\r\nLJ_FUNC lua_State *lj_state_new(lua_State *L);\r\nLJ_FUNC void LJ_FASTCALL lj_state_free(global_State *g, lua_State *L);\r\n#if LJ_64\r\nLJ_FUNC lua_State *lj_state_newstate(lua_Alloc f, void *ud);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_str.c",
    "content": "/*\r\n** String handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_str_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_char.h\"\r\n\r\n/* -- String helpers ------------------------------------------------------ */\r\n\r\n/* Ordered compare of strings. Assumes string data is 4-byte aligned. */\r\nint32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b)\r\n{\r\n  MSize i, n = a->len > b->len ? b->len : a->len;\r\n  for (i = 0; i < n; i += 4) {\r\n    /* Note: innocuous access up to end of string + 3. */\r\n    uint32_t va = *(const uint32_t *)(strdata(a)+i);\r\n    uint32_t vb = *(const uint32_t *)(strdata(b)+i);\r\n    if (va != vb) {\r\n#if LJ_LE\r\n      va = lj_bswap(va); vb = lj_bswap(vb);\r\n#endif\r\n      i -= n;\r\n      if ((int32_t)i >= -3) {\r\n\tva >>= 32+(i<<3); vb >>= 32+(i<<3);\r\n\tif (va == vb) break;\r\n      }\r\n      return va < vb ? -1 : 1;\r\n    }\r\n  }\r\n  return (int32_t)(a->len - b->len);\r\n}\r\n\r\n/* Fast string data comparison. Caveat: unaligned access to 1st string! */\r\nstatic LJ_AINLINE int str_fastcmp(const char *a, const char *b, MSize len)\r\n{\r\n  MSize i = 0;\r\n  lua_assert(len > 0);\r\n  lua_assert((((uintptr_t)a+len-1) & (LJ_PAGESIZE-1)) <= LJ_PAGESIZE-4);\r\n  do {  /* Note: innocuous access up to end of string + 3. */\r\n    uint32_t v = lj_getu32(a+i) ^ *(const uint32_t *)(b+i);\r\n    if (v) {\r\n      i -= len;\r\n#if LJ_LE\r\n      return (int32_t)i >= -3 ? (v << (32+(i<<3))) : 1;\r\n#else\r\n      return (int32_t)i >= -3 ? (v >> (32+(i<<3))) : 1;\r\n#endif\r\n    }\r\n    i += 4;\r\n  } while (i < len);\r\n  return 0;\r\n}\r\n\r\n/* Find fixed string p inside string s. */\r\nconst char *lj_str_find(const char *s, const char *p, MSize slen, MSize plen)\r\n{\r\n  if (plen <= slen) {\r\n    if (plen == 0) {\r\n      return s;\r\n    } else {\r\n      int c = *(const uint8_t *)p++;\r\n      plen--; slen -= plen;\r\n      while (slen) {\r\n\tconst char *q = (const char *)memchr(s, c, slen);\r\n\tif (!q) break;\r\n\tif (memcmp(q+1, p, plen) == 0) return q;\r\n\tq++; slen -= (MSize)(q-s); s = q;\r\n      }\r\n    }\r\n  }\r\n  return NULL;\r\n}\r\n\r\n/* Check whether a string has a pattern matching character. */\r\nint lj_str_haspattern(GCstr *s)\r\n{\r\n  const char *p = strdata(s), *q = p + s->len;\r\n  while (p < q) {\r\n    int c = *(const uint8_t *)p++;\r\n    if (lj_char_ispunct(c) && strchr(\"^$*+?.([%-\", c))\r\n      return 1;  /* Found a pattern matching char. */\r\n  }\r\n  return 0;  /* No pattern matching chars found. */\r\n}\r\n\r\n/* -- String interning ---------------------------------------------------- */\r\n\r\n/* Resize the string hash table (grow and shrink). */\r\nvoid lj_str_resize(lua_State *L, MSize newmask)\r\n{\r\n  global_State *g = G(L);\r\n  GCRef *newhash;\r\n  MSize i;\r\n  if (g->gc.state == GCSsweepstring || newmask >= LJ_MAX_STRTAB-1)\r\n    return;  /* No resizing during GC traversal or if already too big. */\r\n  newhash = lj_mem_newvec(L, newmask+1, GCRef);\r\n  memset(newhash, 0, (newmask+1)*sizeof(GCRef));\r\n  for (i = g->strmask; i != ~(MSize)0; i--) {  /* Rehash old table. */\r\n    GCobj *p = gcref(g->strhash[i]);\r\n    while (p) {  /* Follow each hash chain and reinsert all strings. */\r\n      MSize h = gco2str(p)->hash & newmask;\r\n      GCobj *next = gcnext(p);\r\n      /* NOBARRIER: The string table is a GC root. */\r\n      setgcrefr(p->gch.nextgc, newhash[h]);\r\n      setgcref(newhash[h], p);\r\n      p = next;\r\n    }\r\n  }\r\n  lj_mem_freevec(g, g->strhash, g->strmask+1, GCRef);\r\n  g->strmask = newmask;\r\n  g->strhash = newhash;\r\n}\r\n\r\n/* Intern a string and return string object. */\r\nGCstr *lj_str_new(lua_State *L, const char *str, size_t lenx)\r\n{\r\n  global_State *g;\r\n  GCstr *s;\r\n  GCobj *o;\r\n  MSize len = (MSize)lenx;\r\n  MSize a, b, h = len;\r\n  if (lenx >= LJ_MAX_STR)\r\n    lj_err_msg(L, LJ_ERR_STROV);\r\n  g = G(L);\r\n  /* Compute string hash. Constants taken from lookup3 hash by Bob Jenkins. */\r\n  if (len >= 4) {  /* Caveat: unaligned access! */\r\n    a = lj_getu32(str);\r\n    h ^= lj_getu32(str+len-4);\r\n    b = lj_getu32(str+(len>>1)-2);\r\n    h ^= b; h -= lj_rol(b, 14);\r\n    b += lj_getu32(str+(len>>2)-1);\r\n  } else if (len > 0) {\r\n    a = *(const uint8_t *)str;\r\n    h ^= *(const uint8_t *)(str+len-1);\r\n    b = *(const uint8_t *)(str+(len>>1));\r\n    h ^= b; h -= lj_rol(b, 14);\r\n  } else {\r\n    return &g->strempty;\r\n  }\r\n  a ^= h; a -= lj_rol(h, 11);\r\n  b ^= a; b -= lj_rol(a, 25);\r\n  h ^= b; h -= lj_rol(b, 16);\r\n  /* Check if the string has already been interned. */\r\n  o = gcref(g->strhash[h & g->strmask]);\r\n  if (LJ_LIKELY((((uintptr_t)str+len-1) & (LJ_PAGESIZE-1)) <= LJ_PAGESIZE-4)) {\r\n    while (o != NULL) {\r\n      GCstr *sx = gco2str(o);\r\n      if (sx->len == len && str_fastcmp(str, strdata(sx), len) == 0) {\r\n\t/* Resurrect if dead. Can only happen with fixstring() (keywords). */\r\n\tif (isdead(g, o)) flipwhite(o);\r\n\treturn sx;  /* Return existing string. */\r\n      }\r\n      o = gcnext(o);\r\n    }\r\n  } else {  /* Slow path: end of string is too close to a page boundary. */\r\n    while (o != NULL) {\r\n      GCstr *sx = gco2str(o);\r\n      if (sx->len == len && memcmp(str, strdata(sx), len) == 0) {\r\n\t/* Resurrect if dead. Can only happen with fixstring() (keywords). */\r\n\tif (isdead(g, o)) flipwhite(o);\r\n\treturn sx;  /* Return existing string. */\r\n      }\r\n      o = gcnext(o);\r\n    }\r\n  }\r\n  /* Nope, create a new string. */\r\n  s = lj_mem_newt(L, sizeof(GCstr)+len+1, GCstr);\r\n  newwhite(g, s);\r\n  s->gct = ~LJ_TSTR;\r\n  s->len = len;\r\n  s->hash = h;\r\n  s->reserved = 0;\r\n  memcpy(strdatawr(s), str, len);\r\n  strdatawr(s)[len] = '\\0';  /* Zero-terminate string. */\r\n  /* Add it to string hash table. */\r\n  h &= g->strmask;\r\n  s->nextgc = g->strhash[h];\r\n  /* NOBARRIER: The string table is a GC root. */\r\n  setgcref(g->strhash[h], obj2gco(s));\r\n  if (g->strnum++ > g->strmask)  /* Allow a 100% load factor. */\r\n    lj_str_resize(L, (g->strmask<<1)+1);  /* Grow string table. */\r\n  return s;  /* Return newly interned string. */\r\n}\r\n\r\nvoid LJ_FASTCALL lj_str_free(global_State *g, GCstr *s)\r\n{\r\n  g->strnum--;\r\n  lj_mem_free(g, s, sizestring(s));\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_str.h",
    "content": "/*\r\n** String handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STR_H\r\n#define _LJ_STR_H\r\n\r\n#include <stdarg.h>\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* String helpers. */\r\nLJ_FUNC int32_t LJ_FASTCALL lj_str_cmp(GCstr *a, GCstr *b);\r\nLJ_FUNC const char *lj_str_find(const char *s, const char *f,\r\n\t\t\t\tMSize slen, MSize flen);\r\nLJ_FUNC int lj_str_haspattern(GCstr *s);\r\n\r\n/* String interning. */\r\nLJ_FUNC void lj_str_resize(lua_State *L, MSize newmask);\r\nLJ_FUNCA GCstr *lj_str_new(lua_State *L, const char *str, size_t len);\r\nLJ_FUNC void LJ_FASTCALL lj_str_free(global_State *g, GCstr *s);\r\n\r\n#define lj_str_newz(L, s)\t(lj_str_new(L, s, strlen(s)))\r\n#define lj_str_newlit(L, s)\t(lj_str_new(L, \"\" s, sizeof(s)-1))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_strfmt.c",
    "content": "/*\r\n** String formatting.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lj_strfmt_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_buf.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strfmt.h\"\r\n\r\n/* -- Format parser ------------------------------------------------------- */\r\n\r\nstatic const uint8_t strfmt_map[('x'-'A')+1] = {\r\n  STRFMT_A,0,0,0,STRFMT_E,0,STRFMT_G,0,0,0,0,0,0,\r\n  0,0,0,0,0,0,0,0,0,0,STRFMT_X,0,0,\r\n  0,0,0,0,0,0,\r\n  STRFMT_A,0,STRFMT_C,STRFMT_D,STRFMT_E,STRFMT_F,STRFMT_G,0,STRFMT_I,0,0,0,0,\r\n  0,STRFMT_O,STRFMT_P,STRFMT_Q,0,STRFMT_S,0,STRFMT_U,0,0,STRFMT_X\r\n};\r\n\r\nSFormat LJ_FASTCALL lj_strfmt_parse(FormatState *fs)\r\n{\r\n  const uint8_t *p = fs->p, *e = fs->e;\r\n  fs->str = (const char *)p;\r\n  for (; p < e; p++) {\r\n    if (*p == '%') {  /* Escape char? */\r\n      if (p[1] == '%') {  /* '%%'? */\r\n\tfs->p = ++p+1;\r\n\tgoto retlit;\r\n      } else {\r\n\tSFormat sf = 0;\r\n\tuint32_t c;\r\n\tif (p != (const uint8_t *)fs->str)\r\n\t  break;\r\n\tfor (p++; (uint32_t)*p - ' ' <= (uint32_t)('0' - ' '); p++) {\r\n\t  /* Parse flags. */\r\n\t  if (*p == '-') sf |= STRFMT_F_LEFT;\r\n\t  else if (*p == '+') sf |= STRFMT_F_PLUS;\r\n\t  else if (*p == '0') sf |= STRFMT_F_ZERO;\r\n\t  else if (*p == ' ') sf |= STRFMT_F_SPACE;\r\n\t  else if (*p == '#') sf |= STRFMT_F_ALT;\r\n\t  else break;\r\n\t}\r\n\tif ((uint32_t)*p - '0' < 10) {  /* Parse width. */\r\n\t  uint32_t width = (uint32_t)*p++ - '0';\r\n\t  if ((uint32_t)*p - '0' < 10)\r\n\t    width = (uint32_t)*p++ - '0' + width*10;\r\n\t  sf |= (width << STRFMT_SH_WIDTH);\r\n\t}\r\n\tif (*p == '.') {  /* Parse precision. */\r\n\t  uint32_t prec = 0;\r\n\t  p++;\r\n\t  if ((uint32_t)*p - '0' < 10) {\r\n\t    prec = (uint32_t)*p++ - '0';\r\n\t    if ((uint32_t)*p - '0' < 10)\r\n\t      prec = (uint32_t)*p++ - '0' + prec*10;\r\n\t  }\r\n\t  sf |= ((prec+1) << STRFMT_SH_PREC);\r\n\t}\r\n\t/* Parse conversion. */\r\n\tc = (uint32_t)*p - 'A';\r\n\tif (LJ_LIKELY(c <= (uint32_t)('x' - 'A'))) {\r\n\t  uint32_t sx = strfmt_map[c];\r\n\t  if (sx) {\r\n\t    fs->p = p+1;\r\n\t    return (sf | sx | ((c & 0x20) ? 0 : STRFMT_F_UPPER));\r\n\t  }\r\n\t}\r\n\t/* Return error location. */\r\n\tif (*p >= 32) p++;\r\n\tfs->len = (MSize)(p - (const uint8_t *)fs->str);\r\n\tfs->p = fs->e;\r\n\treturn STRFMT_ERR;\r\n      }\r\n    }\r\n  }\r\n  fs->p = p;\r\nretlit:\r\n  fs->len = (MSize)(p - (const uint8_t *)fs->str);\r\n  return fs->len ? STRFMT_LIT : STRFMT_EOF;\r\n}\r\n\r\n/* -- Raw conversions ----------------------------------------------------- */\r\n\r\n/* Write number to bufer. */\r\nchar * LJ_FASTCALL lj_strfmt_wnum(char *p, cTValue *o)\r\n{\r\n  if (LJ_LIKELY((o->u32.hi << 1) < 0xffe00000)) {  /* Finite? */\r\n#if __BIONIC__\r\n    if (tvismzero(o)) { *p++ = '-'; *p++ = '0'; return p; }\r\n#endif\r\n    return p + lua_number2str(p, o->n);\r\n  } else if (((o->u32.hi & 0x000fffff) | o->u32.lo) != 0) {\r\n    *p++ = 'n'; *p++ = 'a'; *p++ = 'n';\r\n  } else if ((o->u32.hi & 0x80000000) == 0) {\r\n    *p++ = 'i'; *p++ = 'n'; *p++ = 'f';\r\n  } else {\r\n    *p++ = '-'; *p++ = 'i'; *p++ = 'n'; *p++ = 'f';\r\n  }\r\n  return p;\r\n}\r\n\r\n#define WINT_R(x, sh, sc) \\\r\n  { uint32_t d = (x*(((1<<sh)+sc-1)/sc))>>sh; x -= d*sc; *p++ = (char)('0'+d); }\r\n\r\n/* Write integer to buffer. */\r\nchar * LJ_FASTCALL lj_strfmt_wint(char *p, int32_t k)\r\n{\r\n  uint32_t u = (uint32_t)k;\r\n  if (k < 0) { u = (uint32_t)-k; *p++ = '-'; }\r\n  if (u < 10000) {\r\n    if (u < 10) goto dig1; if (u < 100) goto dig2; if (u < 1000) goto dig3;\r\n  } else {\r\n    uint32_t v = u / 10000; u -= v * 10000;\r\n    if (v < 10000) {\r\n      if (v < 10) goto dig5; if (v < 100) goto dig6; if (v < 1000) goto dig7;\r\n    } else {\r\n      uint32_t w = v / 10000; v -= w * 10000;\r\n      if (w >= 10) WINT_R(w, 10, 10)\r\n      *p++ = (char)('0'+w);\r\n    }\r\n    WINT_R(v, 23, 1000)\r\n    dig7: WINT_R(v, 12, 100)\r\n    dig6: WINT_R(v, 10, 10)\r\n    dig5: *p++ = (char)('0'+v);\r\n  }\r\n  WINT_R(u, 23, 1000)\r\n  dig3: WINT_R(u, 12, 100)\r\n  dig2: WINT_R(u, 10, 10)\r\n  dig1: *p++ = (char)('0'+u);\r\n  return p;\r\n}\r\n#undef WINT_R\r\n\r\n/* Write pointer to buffer. */\r\nchar * LJ_FASTCALL lj_strfmt_wptr(char *p, const void *v)\r\n{\r\n  ptrdiff_t x = (ptrdiff_t)v;\r\n  MSize i, n = STRFMT_MAXBUF_PTR;\r\n  if (x == 0) {\r\n    *p++ = 'N'; *p++ = 'U'; *p++ = 'L'; *p++ = 'L';\r\n    return p;\r\n  }\r\n#if LJ_64\r\n  /* Shorten output for 64 bit pointers. */\r\n  n = 2+2*4+((x >> 32) ? 2+2*(lj_fls((uint32_t)(x >> 32))>>3) : 0);\r\n#endif\r\n  p[0] = '0';\r\n  p[1] = 'x';\r\n  for (i = n-1; i >= 2; i--, x >>= 4)\r\n    p[i] = \"0123456789abcdef\"[(x & 15)];\r\n  return p+n;\r\n}\r\n\r\n/* Write ULEB128 to buffer. */\r\nchar * LJ_FASTCALL lj_strfmt_wuleb128(char *p, uint32_t v)\r\n{\r\n  for (; v >= 0x80; v >>= 7)\r\n    *p++ = (char)((v & 0x7f) | 0x80);\r\n  *p++ = (char)v;\r\n  return p;\r\n}\r\n\r\n/* Return string or write number to buffer and return pointer to start. */\r\nconst char *lj_strfmt_wstrnum(char *buf, cTValue *o, MSize *lenp)\r\n{\r\n  if (tvisstr(o)) {\r\n    *lenp = strV(o)->len;\r\n    return strVdata(o);\r\n  } else if (tvisint(o)) {\r\n    *lenp = (MSize)(lj_strfmt_wint(buf, intV(o)) - buf);\r\n    return buf;\r\n  } else if (tvisnum(o)) {\r\n    *lenp = (MSize)(lj_strfmt_wnum(buf, o) - buf);\r\n    return buf;\r\n  } else {\r\n    return NULL;\r\n  }\r\n}\r\n\r\n/* -- Unformatted conversions to buffer ----------------------------------- */\r\n\r\n/* Add integer to buffer. */\r\nSBuf * LJ_FASTCALL lj_strfmt_putint(SBuf *sb, int32_t k)\r\n{\r\n  setsbufP(sb, lj_strfmt_wint(lj_buf_more(sb, STRFMT_MAXBUF_INT), k));\r\n  return sb;\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Add number to buffer. */\r\nSBuf * LJ_FASTCALL lj_strfmt_putnum(SBuf *sb, cTValue *o)\r\n{\r\n  setsbufP(sb, lj_strfmt_wnum(lj_buf_more(sb, STRFMT_MAXBUF_NUM), o));\r\n  return sb;\r\n}\r\n#endif\r\n\r\nSBuf * LJ_FASTCALL lj_strfmt_putptr(SBuf *sb, const void *v)\r\n{\r\n  setsbufP(sb, lj_strfmt_wptr(lj_buf_more(sb, STRFMT_MAXBUF_PTR), v));\r\n  return sb;\r\n}\r\n\r\n/* Add quoted string to buffer. */\r\nSBuf * LJ_FASTCALL lj_strfmt_putquoted(SBuf *sb, GCstr *str)\r\n{\r\n  const char *s = strdata(str);\r\n  MSize len = str->len;\r\n  lj_buf_putb(sb, '\"');\r\n  while (len--) {\r\n    uint32_t c = (uint32_t)(uint8_t)*s++;\r\n    char *p = lj_buf_more(sb, 4);\r\n    if (c == '\"' || c == '\\\\' || c == '\\n') {\r\n      *p++ = '\\\\';\r\n    } else if (lj_char_iscntrl(c)) {  /* This can only be 0-31 or 127. */\r\n      uint32_t d;\r\n      *p++ = '\\\\';\r\n      if (c >= 100 || lj_char_isdigit((uint8_t)*s)) {\r\n\t*p++ = (char)('0'+(c >= 100)); if (c >= 100) c -= 100;\r\n\tgoto tens;\r\n      } else if (c >= 10) {\r\n      tens:\r\n\td = (c * 205) >> 11; c -= d * 10; *p++ = (char)('0'+d);\r\n      }\r\n      c += '0';\r\n    }\r\n    *p++ = (char)c;\r\n    setsbufP(sb, p);\r\n  }\r\n  lj_buf_putb(sb, '\"');\r\n  return sb;\r\n}\r\n\r\n/* -- Formatted conversions to buffer ------------------------------------- */\r\n\r\n/* Add formatted char to buffer. */\r\nSBuf *lj_strfmt_putfchar(SBuf *sb, SFormat sf, int32_t c)\r\n{\r\n  MSize width = STRFMT_WIDTH(sf);\r\n  char *p = lj_buf_more(sb, width > 1 ? width : 1);\r\n  if ((sf & STRFMT_F_LEFT)) *p++ = (char)c;\r\n  while (width-- > 1) *p++ = ' ';\r\n  if (!(sf & STRFMT_F_LEFT)) *p++ = (char)c;\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\n/* Add formatted string to buffer. */\r\nSBuf *lj_strfmt_putfstr(SBuf *sb, SFormat sf, GCstr *str)\r\n{\r\n  MSize len = str->len <= STRFMT_PREC(sf) ? str->len : STRFMT_PREC(sf);\r\n  MSize width = STRFMT_WIDTH(sf);\r\n  char *p = lj_buf_more(sb, width > len ? width : len);\r\n  if ((sf & STRFMT_F_LEFT)) p = lj_buf_wmem(p, strdata(str), len);\r\n  while (width-- > len) *p++ = ' ';\r\n  if (!(sf & STRFMT_F_LEFT)) p = lj_buf_wmem(p, strdata(str), len);\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\n/* Add formatted signed/unsigned integer to buffer. */\r\nSBuf *lj_strfmt_putfxint(SBuf *sb, SFormat sf, uint64_t k)\r\n{\r\n  char buf[STRFMT_MAXBUF_XINT], *q = buf + sizeof(buf), *p;\r\n#ifdef LUA_USE_ASSERT\r\n  char *ps;\r\n#endif\r\n  MSize prefix = 0, len, prec, pprec, width, need;\r\n\r\n  /* Figure out signed prefixes. */\r\n  if (STRFMT_TYPE(sf) == STRFMT_INT) {\r\n    if ((int64_t)k < 0) {\r\n      k = (uint64_t)-(int64_t)k;\r\n      prefix = 256 + '-';\r\n    } else if ((sf & STRFMT_F_PLUS)) {\r\n      prefix = 256 + '+';\r\n    } else if ((sf & STRFMT_F_SPACE)) {\r\n      prefix = 256 + ' ';\r\n    }\r\n  }\r\n\r\n  /* Convert number and store to fixed-size buffer in reverse order. */\r\n  prec = STRFMT_PREC(sf);\r\n  if ((int32_t)prec >= 0) sf &= ~STRFMT_F_ZERO;\r\n  if (k == 0) {  /* Special-case zero argument. */\r\n    if (prec != 0 ||\r\n\t(sf & (STRFMT_T_OCT|STRFMT_F_ALT)) == (STRFMT_T_OCT|STRFMT_F_ALT))\r\n      *--q = '0';\r\n  } else if (!(sf & (STRFMT_T_HEX|STRFMT_T_OCT))) {  /* Decimal. */\r\n    uint32_t k2;\r\n    while ((k >> 32)) { *--q = (char)('0' + k % 10); k /= 10; }\r\n    k2 = (uint32_t)k;\r\n    do { *--q = (char)('0' + k2 % 10); k2 /= 10; } while (k2);\r\n  } else if ((sf & STRFMT_T_HEX)) {  /* Hex. */\r\n    const char *hexdig = (sf & STRFMT_F_UPPER) ? \"0123456789ABCDEF\" :\r\n\t\t\t\t\t\t \"0123456789abcdef\";\r\n    do { *--q = hexdig[(k & 15)]; k >>= 4; } while (k);\r\n    if ((sf & STRFMT_F_ALT)) prefix = 512 + ((sf & STRFMT_F_UPPER) ? 'X' : 'x');\r\n  } else {  /* Octal. */\r\n    do { *--q = (char)('0' + (uint32_t)(k & 7)); k >>= 3; } while (k);\r\n    if ((sf & STRFMT_F_ALT)) *--q = '0';\r\n  }\r\n\r\n  /* Calculate sizes. */\r\n  len = (MSize)(buf + sizeof(buf) - q);\r\n  if ((int32_t)len >= (int32_t)prec) prec = len;\r\n  width = STRFMT_WIDTH(sf);\r\n  pprec = prec + (prefix >> 8);\r\n  need = width > pprec ? width : pprec;\r\n  p = lj_buf_more(sb, need);\r\n#ifdef LUA_USE_ASSERT\r\n  ps = p;\r\n#endif\r\n\r\n  /* Format number with leading/trailing whitespace and zeros. */\r\n  if ((sf & (STRFMT_F_LEFT|STRFMT_F_ZERO)) == 0)\r\n    while (width-- > pprec) *p++ = ' ';\r\n  if (prefix) {\r\n    if ((char)prefix >= 'X') *p++ = '0';\r\n    *p++ = (char)prefix;\r\n  }\r\n  if ((sf & (STRFMT_F_LEFT|STRFMT_F_ZERO)) == STRFMT_F_ZERO)\r\n    while (width-- > pprec) *p++ = '0';\r\n  while (prec-- > len) *p++ = '0';\r\n  while (q < buf + sizeof(buf)) *p++ = *q++;  /* Add number itself. */\r\n  if ((sf & STRFMT_F_LEFT))\r\n    while (width-- > pprec) *p++ = ' ';\r\n\r\n  lua_assert(need == (MSize)(p - ps));\r\n  setsbufP(sb, p);\r\n  return sb;\r\n}\r\n\r\n/* Add number formatted as signed integer to buffer. */\r\nSBuf *lj_strfmt_putfnum_int(SBuf *sb, SFormat sf, lua_Number n)\r\n{\r\n  int64_t k = (int64_t)n;\r\n  if (checki32(k) && sf == STRFMT_INT)\r\n    return lj_strfmt_putint(sb, (int32_t)k);  /* Shortcut for plain %d. */\r\n  else\r\n    return lj_strfmt_putfxint(sb, sf, (uint64_t)k);\r\n}\r\n\r\n/* Add number formatted as unsigned integer to buffer. */\r\nSBuf *lj_strfmt_putfnum_uint(SBuf *sb, SFormat sf, lua_Number n)\r\n{\r\n  int64_t k;\r\n  if (n >= 9223372036854775808.0)\r\n    k = (int64_t)(n - 18446744073709551616.0);\r\n  else\r\n    k = (int64_t)n;\r\n  return lj_strfmt_putfxint(sb, sf, (uint64_t)k);\r\n}\r\n\r\n/* Max. sprintf buffer size needed. At least #string.format(\"%.99f\", -1e308). */\r\n#define STRFMT_FMTNUMBUF\t512\r\n\r\n/* Add formatted floating-point number to buffer. */\r\nSBuf *lj_strfmt_putfnum(SBuf *sb, SFormat sf, lua_Number n)\r\n{\r\n  TValue tv;\r\n  tv.n = n;\r\n  if (LJ_UNLIKELY((tv.u32.hi << 1) >= 0xffe00000)) {\r\n    /* Canonicalize output of non-finite values. */\r\n    MSize width = STRFMT_WIDTH(sf), len = 3;\r\n    int prefix = 0, ch = (sf & STRFMT_F_UPPER) ? 0x202020 : 0;\r\n    char *p;\r\n    if (((tv.u32.hi & 0x000fffff) | tv.u32.lo) != 0) {\r\n      ch ^= ('n' << 16) | ('a' << 8) | 'n';\r\n      if ((sf & STRFMT_F_SPACE)) prefix = ' ';\r\n    } else {\r\n      ch ^= ('i' << 16) | ('n' << 8) | 'f';\r\n      if ((tv.u32.hi & 0x80000000)) prefix = '-';\r\n      else if ((sf & STRFMT_F_PLUS)) prefix = '+';\r\n      else if ((sf & STRFMT_F_SPACE)) prefix = ' ';\r\n    }\r\n    if (prefix) len = 4;\r\n    p = lj_buf_more(sb, width > len ? width : len);\r\n    if (!(sf & STRFMT_F_LEFT)) while (width-- > len) *p++ = ' ';\r\n    if (prefix) *p++ = prefix;\r\n    *p++ = (char)(ch >> 16); *p++ = (char)(ch >> 8); *p++ = (char)ch;\r\n    if ((sf & STRFMT_F_LEFT)) while (width-- > len) *p++ = ' ';\r\n    setsbufP(sb, p);\r\n  } else {  /* Delegate to sprintf() for now. */\r\n    uint8_t width = (uint8_t)STRFMT_WIDTH(sf), prec = (uint8_t)STRFMT_PREC(sf);\r\n    char fmt[1+5+2+3+1+1], *p = fmt;\r\n    *p++ = '%';\r\n    if ((sf & STRFMT_F_LEFT)) *p++ = '-';\r\n    if ((sf & STRFMT_F_PLUS)) *p++ = '+';\r\n    if ((sf & STRFMT_F_ZERO)) *p++ = '0';\r\n    if ((sf & STRFMT_F_SPACE)) *p++ = ' ';\r\n    if ((sf & STRFMT_F_ALT)) *p++ = '#';\r\n    if (width) {\r\n      uint8_t x = width / 10, y = width % 10;\r\n      if (x) *p++ = '0' + x;\r\n      *p++ = '0' + y;\r\n    }\r\n    if (prec != 255) {\r\n      uint8_t x = prec / 10, y = prec % 10;\r\n      *p++ = '.';\r\n      if (x) *p++ = '0' + x;\r\n      *p++ = '0' + y;\r\n    }\r\n    *p++ = (0x67666561 >> (STRFMT_FP(sf)<<3)) ^ ((sf & STRFMT_F_UPPER)?0x20:0);\r\n    *p = '\\0';\r\n    p = lj_buf_more(sb, STRFMT_FMTNUMBUF);\r\n    setsbufP(sb, p + sprintf(p, fmt, n));\r\n  }\r\n  return sb;\r\n}\r\n\r\n/* -- Conversions to strings ---------------------------------------------- */\r\n\r\n/* Convert integer to string. */\r\nGCstr * LJ_FASTCALL lj_strfmt_int(lua_State *L, int32_t k)\r\n{\r\n  char buf[STRFMT_MAXBUF_INT];\r\n  MSize len = (MSize)(lj_strfmt_wint(buf, k) - buf);\r\n  return lj_str_new(L, buf, len);\r\n}\r\n\r\n/* Convert number to string. */\r\nGCstr * LJ_FASTCALL lj_strfmt_num(lua_State *L, cTValue *o)\r\n{\r\n  char buf[STRFMT_MAXBUF_NUM];\r\n  MSize len = (MSize)(lj_strfmt_wnum(buf, o) - buf);\r\n  return lj_str_new(L, buf, len);\r\n}\r\n\r\n/* Convert integer or number to string. */\r\nGCstr * LJ_FASTCALL lj_strfmt_number(lua_State *L, cTValue *o)\r\n{\r\n  return tvisint(o) ? lj_strfmt_int(L, intV(o)) : lj_strfmt_num(L, o);\r\n}\r\n\r\n#if LJ_HASJIT\r\n/* Convert char value to string. */\r\nGCstr * LJ_FASTCALL lj_strfmt_char(lua_State *L, int c)\r\n{\r\n  char buf[1];\r\n  buf[0] = c;\r\n  return lj_str_new(L, buf, 1);\r\n}\r\n#endif\r\n\r\n/* Raw conversion of object to string. */\r\nGCstr * LJ_FASTCALL lj_strfmt_obj(lua_State *L, cTValue *o)\r\n{\r\n  if (tvisstr(o)) {\r\n    return strV(o);\r\n  } else if (tvisnumber(o)) {\r\n    return lj_strfmt_number(L, o);\r\n  } else if (tvisnil(o)) {\r\n    return lj_str_newlit(L, \"nil\");\r\n  } else if (tvisfalse(o)) {\r\n    return lj_str_newlit(L, \"false\");\r\n  } else if (tvistrue(o)) {\r\n    return lj_str_newlit(L, \"true\");\r\n  } else {\r\n    char buf[8+2+2+16], *p = buf;\r\n    p = lj_buf_wmem(p, lj_typename(o), (MSize)strlen(lj_typename(o)));\r\n    *p++ = ':'; *p++ = ' ';\r\n    if (tvisfunc(o) && isffunc(funcV(o))) {\r\n      p = lj_buf_wmem(p, \"builtin#\", 8);\r\n      p = lj_strfmt_wint(p, funcV(o)->c.ffid);\r\n    } else {\r\n      p = lj_strfmt_wptr(p, lj_obj_ptr(o));\r\n    }\r\n    return lj_str_new(L, buf, (size_t)(p - buf));\r\n  }\r\n}\r\n\r\n/* -- Internal string formatting ------------------------------------------ */\r\n\r\n/*\r\n** These functions are only used for lua_pushfstring(), lua_pushvfstring()\r\n** and for internal string formatting (e.g. error messages). Caveat: unlike\r\n** string.format(), only a limited subset of formats and flags are supported!\r\n**\r\n** LuaJIT has support for a couple more formats than Lua 5.1/5.2:\r\n** - %d %u %o %x with full formatting, 32 bit integers only.\r\n** - %f and other FP formats are really %.14g.\r\n** - %s %c %p without formatting.\r\n*/\r\n\r\n/* Push formatted message as a string object to Lua stack. va_list variant. */\r\nconst char *lj_strfmt_pushvf(lua_State *L, const char *fmt, va_list argp)\r\n{\r\n  SBuf *sb = lj_buf_tmp_(L);\r\n  FormatState fs;\r\n  SFormat sf;\r\n  GCstr *str;\r\n  lj_strfmt_init(&fs, fmt, (MSize)strlen(fmt));\r\n  while ((sf = lj_strfmt_parse(&fs)) != STRFMT_EOF) {\r\n    switch (STRFMT_TYPE(sf)) {\r\n    case STRFMT_LIT:\r\n      lj_buf_putmem(sb, fs.str, fs.len);\r\n      break;\r\n    case STRFMT_INT:\r\n      lj_strfmt_putfxint(sb, sf, va_arg(argp, int32_t));\r\n      break;\r\n    case STRFMT_UINT:\r\n      lj_strfmt_putfxint(sb, sf, va_arg(argp, uint32_t));\r\n      break;\r\n    case STRFMT_NUM: {\r\n      TValue tv;\r\n      tv.n = va_arg(argp, lua_Number);\r\n      setsbufP(sb, lj_strfmt_wnum(lj_buf_more(sb, STRFMT_MAXBUF_NUM), &tv));\r\n      break;\r\n      }\r\n    case STRFMT_STR: {\r\n      const char *s = va_arg(argp, char *);\r\n      if (s == NULL) s = \"(null)\";\r\n      lj_buf_putmem(sb, s, (MSize)strlen(s));\r\n      break;\r\n      }\r\n    case STRFMT_CHAR:\r\n      lj_buf_putb(sb, va_arg(argp, int));\r\n      break;\r\n    case STRFMT_PTR:\r\n      lj_strfmt_putptr(sb, va_arg(argp, void *));\r\n      break;\r\n    case STRFMT_ERR:\r\n    default:\r\n      lj_buf_putb(sb, '?');\r\n      lua_assert(0);\r\n      break;\r\n    }\r\n  }\r\n  str = lj_buf_str(L, sb);\r\n  setstrV(L, L->top, str);\r\n  incr_top(L);\r\n  return strdata(str);\r\n}\r\n\r\n/* Push formatted message as a string object to Lua stack. Vararg variant. */\r\nconst char *lj_strfmt_pushf(lua_State *L, const char *fmt, ...)\r\n{\r\n  const char *msg;\r\n  va_list argp;\r\n  va_start(argp, fmt);\r\n  msg = lj_strfmt_pushvf(L, fmt, argp);\r\n  va_end(argp);\r\n  return msg;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_strfmt.h",
    "content": "/*\r\n** String formatting.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STRFMT_H\r\n#define _LJ_STRFMT_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\ntypedef uint32_t SFormat;  /* Format indicator. */\r\n\r\n/* Format parser state. */\r\ntypedef struct FormatState {\r\n  const uint8_t *p;\t/* Current format string pointer. */\r\n  const uint8_t *e;\t/* End of format string. */\r\n  const char *str;\t/* Returned literal string. */\r\n  MSize len;\t\t/* Size of literal string. */\r\n} FormatState;\r\n\r\n/* Format types (max. 16). */\r\ntypedef enum FormatType {\r\n  STRFMT_EOF, STRFMT_ERR, STRFMT_LIT,\r\n  STRFMT_INT, STRFMT_UINT, STRFMT_NUM, STRFMT_STR, STRFMT_CHAR, STRFMT_PTR\r\n} FormatType;\r\n\r\n/* Format subtypes (bits are reused). */\r\n#define STRFMT_T_HEX\t0x0010\t/* STRFMT_UINT */\r\n#define STRFMT_T_OCT\t0x0020\t/* STRFMT_UINT */\r\n#define STRFMT_T_FP_A\t0x0000\t/* STRFMT_NUM */\r\n#define STRFMT_T_FP_E\t0x0010\t/* STRFMT_NUM */\r\n#define STRFMT_T_FP_F\t0x0020\t/* STRFMT_NUM */\r\n#define STRFMT_T_FP_G\t0x0030\t/* STRFMT_NUM */\r\n#define STRFMT_T_QUOTED\t0x0010\t/* STRFMT_STR */\r\n\r\n/* Format flags. */\r\n#define STRFMT_F_LEFT\t0x0100\r\n#define STRFMT_F_PLUS\t0x0200\r\n#define STRFMT_F_ZERO\t0x0400\r\n#define STRFMT_F_SPACE\t0x0800\r\n#define STRFMT_F_ALT\t0x1000\r\n#define STRFMT_F_UPPER\t0x2000\r\n\r\n/* Format indicator fields. */\r\n#define STRFMT_SH_WIDTH\t16\r\n#define STRFMT_SH_PREC\t24\r\n\r\n#define STRFMT_TYPE(sf)\t\t((FormatType)((sf) & 15))\r\n#define STRFMT_WIDTH(sf)\t(((sf) >> STRFMT_SH_WIDTH) & 255u)\r\n#define STRFMT_PREC(sf)\t\t((((sf) >> STRFMT_SH_PREC) & 255u) - 1u)\r\n#define STRFMT_FP(sf)\t\t(((sf) >> 4) & 3)\r\n\r\n/* Formats for conversion characters. */\r\n#define STRFMT_A\t(STRFMT_NUM|STRFMT_T_FP_A)\r\n#define STRFMT_C\t(STRFMT_CHAR)\r\n#define STRFMT_D\t(STRFMT_INT)\r\n#define STRFMT_E\t(STRFMT_NUM|STRFMT_T_FP_E)\r\n#define STRFMT_F\t(STRFMT_NUM|STRFMT_T_FP_F)\r\n#define STRFMT_G\t(STRFMT_NUM|STRFMT_T_FP_G)\r\n#define STRFMT_I\tSTRFMT_D\r\n#define STRFMT_O\t(STRFMT_UINT|STRFMT_T_OCT)\r\n#define STRFMT_P\t(STRFMT_PTR)\r\n#define STRFMT_Q\t(STRFMT_STR|STRFMT_T_QUOTED)\r\n#define STRFMT_S\t(STRFMT_STR)\r\n#define STRFMT_U\t(STRFMT_UINT)\r\n#define STRFMT_X\t(STRFMT_UINT|STRFMT_T_HEX)\r\n\r\n/* Maximum buffer sizes for conversions. */\r\n#define STRFMT_MAXBUF_XINT\t(1+22)  /* '0' prefix + uint64_t in octal. */\r\n#define STRFMT_MAXBUF_INT\t(1+10)  /* Sign + int32_t in decimal. */\r\n#define STRFMT_MAXBUF_NUM\tLUAI_MAXNUMBER2STR\r\n#define STRFMT_MAXBUF_PTR\t(2+2*sizeof(ptrdiff_t))  /* \"0x\" + hex ptr. */\r\n\r\n/* Format parser. */\r\nLJ_FUNC SFormat LJ_FASTCALL lj_strfmt_parse(FormatState *fs);\r\n\r\nstatic LJ_AINLINE void lj_strfmt_init(FormatState *fs, const char *p, MSize len)\r\n{\r\n  fs->p = (const uint8_t *)p;\r\n  fs->e = (const uint8_t *)p + len;\r\n  lua_assert(*fs->e == 0);  /* Must be NUL-terminated (may have NULs inside). */\r\n}\r\n\r\n/* Raw conversions. */\r\nLJ_FUNC char * LJ_FASTCALL lj_strfmt_wint(char *p, int32_t k);\r\nLJ_FUNC char * LJ_FASTCALL lj_strfmt_wnum(char *p, cTValue *o);\r\nLJ_FUNC char * LJ_FASTCALL lj_strfmt_wptr(char *p, const void *v);\r\nLJ_FUNC char * LJ_FASTCALL lj_strfmt_wuleb128(char *p, uint32_t v);\r\nLJ_FUNC const char *lj_strfmt_wstrnum(char *buf, cTValue *o, MSize *lenp);\r\n\r\n/* Unformatted conversions to buffer. */\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putint(SBuf *sb, int32_t k);\r\n#if LJ_HASJIT\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putnum(SBuf *sb, cTValue *o);\r\n#endif\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putptr(SBuf *sb, const void *v);\r\nLJ_FUNC SBuf * LJ_FASTCALL lj_strfmt_putquoted(SBuf *sb, GCstr *str);\r\n\r\n/* Formatted conversions to buffer. */\r\nLJ_FUNC SBuf *lj_strfmt_putfxint(SBuf *sb, SFormat sf, uint64_t k);\r\nLJ_FUNC SBuf *lj_strfmt_putfnum_int(SBuf *sb, SFormat sf, lua_Number n);\r\nLJ_FUNC SBuf *lj_strfmt_putfnum_uint(SBuf *sb, SFormat sf, lua_Number n);\r\nLJ_FUNC SBuf *lj_strfmt_putfnum(SBuf *sb, SFormat, lua_Number n);\r\nLJ_FUNC SBuf *lj_strfmt_putfchar(SBuf *sb, SFormat, int32_t c);\r\nLJ_FUNC SBuf *lj_strfmt_putfstr(SBuf *sb, SFormat, GCstr *str);\r\n\r\n/* Conversions to strings. */\r\nLJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_int(lua_State *L, int32_t k);\r\nLJ_FUNCA GCstr * LJ_FASTCALL lj_strfmt_num(lua_State *L, cTValue *o);\r\nLJ_FUNCA GCstr * LJ_FASTCALL lj_strfmt_number(lua_State *L, cTValue *o);\r\n#if LJ_HASJIT\r\nLJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_char(lua_State *L, int c);\r\n#endif\r\nLJ_FUNC GCstr * LJ_FASTCALL lj_strfmt_obj(lua_State *L, cTValue *o);\r\n\r\n/* Internal string formatting. */\r\nLJ_FUNC const char *lj_strfmt_pushvf(lua_State *L, const char *fmt,\r\n\t\t\t\t     va_list argp);\r\nLJ_FUNC const char *lj_strfmt_pushf(lua_State *L, const char *fmt, ...)\r\n#ifdef __GNUC__\r\n  __attribute__ ((format (printf, 2, 3)))\r\n#endif\r\n  ;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_strscan.c",
    "content": "/*\r\n** String scanning.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <math.h>\r\n\r\n#define lj_strscan_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_char.h\"\r\n#include \"lj_strscan.h\"\r\n\r\n/* -- Scanning numbers ---------------------------------------------------- */\r\n\r\n/*\r\n** Rationale for the builtin string to number conversion library:\r\n**\r\n** It removes a dependency on libc's strtod(), which is a true portability\r\n** nightmare. Mainly due to the plethora of supported OS and toolchain\r\n** combinations. Sadly, the various implementations\r\n** a) are often buggy, incomplete (no hex floats) and/or imprecise,\r\n** b) sometimes crash or hang on certain inputs,\r\n** c) return non-standard NaNs that need to be filtered out, and\r\n** d) fail if the locale-specific decimal separator is not a dot,\r\n**    which can only be fixed with atrocious workarounds.\r\n**\r\n** Also, most of the strtod() implementations are hopelessly bloated,\r\n** which is not just an I-cache hog, but a problem for static linkage\r\n** on embedded systems, too.\r\n**\r\n** OTOH the builtin conversion function is very compact. Even though it\r\n** does a lot more, like parsing long longs, octal or imaginary numbers\r\n** and returning the result in different formats:\r\n** a) It needs less than 3 KB (!) of machine code (on x64 with -Os),\r\n** b) it doesn't perform any dynamic allocation and,\r\n** c) it needs only around 600 bytes of stack space.\r\n**\r\n** The builtin function is faster than strtod() for typical inputs, e.g.\r\n** \"123\", \"1.5\" or \"1e6\". Arguably, it's slower for very large exponents,\r\n** which are not very common (this could be fixed, if needed).\r\n**\r\n** And most importantly, the builtin function is equally precise on all\r\n** platforms. It correctly converts and rounds any input to a double.\r\n** If this is not the case, please send a bug report -- but PLEASE verify\r\n** that the implementation you're comparing to is not the culprit!\r\n**\r\n** The implementation quickly pre-scans the entire string first and\r\n** handles simple integers on-the-fly. Otherwise, it dispatches to the\r\n** base-specific parser. Hex and octal is straightforward.\r\n**\r\n** Decimal to binary conversion uses a fixed-length circular buffer in\r\n** base 100. Some simple cases are handled directly. For other cases, the\r\n** number in the buffer is up-scaled or down-scaled until the integer part\r\n** is in the proper range. Then the integer part is rounded and converted\r\n** to a double which is finally rescaled to the result. Denormals need\r\n** special treatment to prevent incorrect 'double rounding'.\r\n*/\r\n\r\n/* Definitions for circular decimal digit buffer (base 100 = 2 digits/byte). */\r\n#define STRSCAN_DIG\t1024\r\n#define STRSCAN_MAXDIG\t800\t\t/* 772 + extra are sufficient. */\r\n#define STRSCAN_DDIG\t(STRSCAN_DIG/2)\r\n#define STRSCAN_DMASK\t(STRSCAN_DDIG-1)\r\n\r\n/* Helpers for circular buffer. */\r\n#define DNEXT(a)\t(((a)+1) & STRSCAN_DMASK)\r\n#define DPREV(a)\t(((a)-1) & STRSCAN_DMASK)\r\n#define DLEN(lo, hi)\t((int32_t)(((lo)-(hi)) & STRSCAN_DMASK))\r\n\r\n#define casecmp(c, k)\t(((c) | 0x20) == k)\r\n\r\n/* Final conversion to double. */\r\nstatic void strscan_double(uint64_t x, TValue *o, int32_t ex2, int32_t neg)\r\n{\r\n  double n;\r\n\r\n  /* Avoid double rounding for denormals. */\r\n  if (LJ_UNLIKELY(ex2 <= -1075 && x != 0)) {\r\n    /* NYI: all of this generates way too much code on 32 bit CPUs. */\r\n#if defined(__GNUC__) && LJ_64\r\n    int32_t b = (int32_t)(__builtin_clzll(x)^63);\r\n#else\r\n    int32_t b = (x>>32) ? 32+(int32_t)lj_fls((uint32_t)(x>>32)) :\r\n\t\t\t  (int32_t)lj_fls((uint32_t)x);\r\n#endif\r\n    if ((int32_t)b + ex2 <= -1023 && (int32_t)b + ex2 >= -1075) {\r\n      uint64_t rb = (uint64_t)1 << (-1075-ex2);\r\n      if ((x & rb) && ((x & (rb+rb+rb-1)))) x += rb+rb;\r\n      x = (x & ~(rb+rb-1));\r\n    }\r\n  }\r\n\r\n  /* Convert to double using a signed int64_t conversion, then rescale. */\r\n  lua_assert((int64_t)x >= 0);\r\n  n = (double)(int64_t)x;\r\n  if (neg) n = -n;\r\n  if (ex2) n = ldexp(n, ex2);\r\n  o->n = n;\r\n}\r\n\r\n/* Parse hexadecimal number. */\r\nstatic StrScanFmt strscan_hex(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, uint32_t opt,\r\n\t\t\t      int32_t ex2, int32_t neg, uint32_t dig)\r\n{\r\n  uint64_t x = 0;\r\n  uint32_t i;\r\n\r\n  /* Scan hex digits. */\r\n  for (i = dig > 16 ? 16 : dig ; i; i--, p++) {\r\n    uint32_t d = (*p != '.' ? *p : *++p); if (d > '9') d += 9;\r\n    x = (x << 4) + (d & 15);\r\n  }\r\n\r\n  /* Summarize rounding-effect of excess digits. */\r\n  for (i = 16; i < dig; i++, p++)\r\n    x |= ((*p != '.' ? *p : *++p) != '0'), ex2 += 4;\r\n\r\n  /* Format-specific handling. */\r\n  switch (fmt) {\r\n  case STRSCAN_INT:\r\n    if (!(opt & STRSCAN_OPT_TONUM) && x < 0x80000000u+neg) {\r\n      o->i = neg ? -(int32_t)x : (int32_t)x;\r\n      return STRSCAN_INT;  /* Fast path for 32 bit integers. */\r\n    }\r\n    if (!(opt & STRSCAN_OPT_C)) { fmt = STRSCAN_NUM; break; }\r\n    /* fallthrough */\r\n  case STRSCAN_U32:\r\n    if (dig > 8) return STRSCAN_ERROR;\r\n    o->i = neg ? -(int32_t)x : (int32_t)x;\r\n    return STRSCAN_U32;\r\n  case STRSCAN_I64:\r\n  case STRSCAN_U64:\r\n    if (dig > 16) return STRSCAN_ERROR;\r\n    o->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n    return fmt;\r\n  default:\r\n    break;\r\n  }\r\n\r\n  /* Reduce range, then convert to double. */\r\n  if ((x & U64x(c0000000,0000000))) { x = (x >> 2) | (x & 3); ex2 += 2; }\r\n  strscan_double(x, o, ex2, neg);\r\n  return fmt;\r\n}\r\n\r\n/* Parse octal number. */\r\nstatic StrScanFmt strscan_oct(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, int32_t neg, uint32_t dig)\r\n{\r\n  uint64_t x = 0;\r\n\r\n  /* Scan octal digits. */\r\n  if (dig > 22 || (dig == 22 && *p > '1')) return STRSCAN_ERROR;\r\n  while (dig-- > 0) {\r\n    if (!(*p >= '0' && *p <= '7')) return STRSCAN_ERROR;\r\n    x = (x << 3) + (*p++ & 7);\r\n  }\r\n\r\n  /* Format-specific handling. */\r\n  switch (fmt) {\r\n  case STRSCAN_INT:\r\n    if (x >= 0x80000000u+neg) fmt = STRSCAN_U32;\r\n    /* fallthrough */\r\n  case STRSCAN_U32:\r\n    if ((x >> 32)) return STRSCAN_ERROR;\r\n    o->i = neg ? -(int32_t)x : (int32_t)x;\r\n    break;\r\n  default:\r\n  case STRSCAN_I64:\r\n  case STRSCAN_U64:\r\n    o->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n    break;\r\n  }\r\n  return fmt;\r\n}\r\n\r\n/* Parse decimal number. */\r\nstatic StrScanFmt strscan_dec(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, uint32_t opt,\r\n\t\t\t      int32_t ex10, int32_t neg, uint32_t dig)\r\n{\r\n  uint8_t xi[STRSCAN_DDIG], *xip = xi;\r\n\r\n  if (dig) {\r\n    uint32_t i = dig;\r\n    if (i > STRSCAN_MAXDIG) {\r\n      ex10 += (int32_t)(i - STRSCAN_MAXDIG);\r\n      i = STRSCAN_MAXDIG;\r\n    }\r\n    /* Scan unaligned leading digit. */\r\n    if (((ex10^i) & 1))\r\n      *xip++ = ((*p != '.' ? *p : *++p) & 15), i--, p++;\r\n    /* Scan aligned double-digits. */\r\n    for ( ; i > 1; i -= 2) {\r\n      uint32_t d = 10 * ((*p != '.' ? *p : *++p) & 15); p++;\r\n      *xip++ = d + ((*p != '.' ? *p : *++p) & 15); p++;\r\n    }\r\n    /* Scan and realign trailing digit. */\r\n    if (i) *xip++ = 10 * ((*p != '.' ? *p : *++p) & 15), ex10--, dig++, p++;\r\n\r\n    /* Summarize rounding-effect of excess digits. */\r\n    if (dig > STRSCAN_MAXDIG) {\r\n      do {\r\n\tif ((*p != '.' ? *p : *++p) != '0') { xip[-1] |= 1; break; }\r\n\tp++;\r\n      } while (--dig > STRSCAN_MAXDIG);\r\n      dig = STRSCAN_MAXDIG;\r\n    } else {  /* Simplify exponent. */\r\n      while (ex10 > 0 && dig <= 18) *xip++ = 0, ex10 -= 2, dig += 2;\r\n    }\r\n  } else {  /* Only got zeros. */\r\n    ex10 = 0;\r\n    xi[0] = 0;\r\n  }\r\n\r\n  /* Fast path for numbers in integer format (but handles e.g. 1e6, too). */\r\n  if (dig <= 20 && ex10 == 0) {\r\n    uint8_t *xis;\r\n    uint64_t x = xi[0];\r\n    double n;\r\n    for (xis = xi+1; xis < xip; xis++) x = x * 100 + *xis;\r\n    if (!(dig == 20 && (xi[0] > 18 || (int64_t)x >= 0))) {  /* No overflow? */\r\n      /* Format-specific handling. */\r\n      switch (fmt) {\r\n      case STRSCAN_INT:\r\n\tif (!(opt & STRSCAN_OPT_TONUM) && x < 0x80000000u+neg) {\r\n\t  o->i = neg ? -(int32_t)x : (int32_t)x;\r\n\t  return STRSCAN_INT;  /* Fast path for 32 bit integers. */\r\n\t}\r\n\tif (!(opt & STRSCAN_OPT_C)) { fmt = STRSCAN_NUM; goto plainnumber; }\r\n\t/* fallthrough */\r\n      case STRSCAN_U32:\r\n\tif ((x >> 32) != 0) return STRSCAN_ERROR;\r\n\to->i = neg ? -(int32_t)x : (int32_t)x;\r\n\treturn STRSCAN_U32;\r\n      case STRSCAN_I64:\r\n      case STRSCAN_U64:\r\n\to->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n\treturn fmt;\r\n      default:\r\n      plainnumber:  /* Fast path for plain numbers < 2^63. */\r\n\tif ((int64_t)x < 0) break;\r\n\tn = (double)(int64_t)x;\r\n\tif (neg) n = -n;\r\n\to->n = n;\r\n\treturn fmt;\r\n      }\r\n    }\r\n  }\r\n\r\n  /* Slow non-integer path. */\r\n  if (fmt == STRSCAN_INT) {\r\n    if ((opt & STRSCAN_OPT_C)) return STRSCAN_ERROR;\r\n    fmt = STRSCAN_NUM;\r\n  } else if (fmt > STRSCAN_INT) {\r\n    return STRSCAN_ERROR;\r\n  }\r\n  {\r\n    uint32_t hi = 0, lo = (uint32_t)(xip-xi);\r\n    int32_t ex2 = 0, idig = (int32_t)lo + (ex10 >> 1);\r\n\r\n    lua_assert(lo > 0 && (ex10 & 1) == 0);\r\n\r\n    /* Handle simple overflow/underflow. */\r\n    if (idig > 310/2) { if (neg) setminfV(o); else setpinfV(o); return fmt; }\r\n    else if (idig < -326/2) { o->n = neg ? -0.0 : 0.0; return fmt; }\r\n\r\n    /* Scale up until we have at least 17 or 18 integer part digits. */\r\n    while (idig < 9 && idig < DLEN(lo, hi)) {\r\n      uint32_t i, cy = 0;\r\n      ex2 -= 6;\r\n      for (i = DPREV(lo); ; i = DPREV(i)) {\r\n\tuint32_t d = (xi[i] << 6) + cy;\r\n\tcy = (((d >> 2) * 5243) >> 17); d = d - cy * 100;  /* Div/mod 100. */\r\n\txi[i] = (uint8_t)d;\r\n\tif (i == hi) break;\r\n\tif (d == 0 && i == DPREV(lo)) lo = i;\r\n      }\r\n      if (cy) {\r\n\thi = DPREV(hi);\r\n\tif (xi[DPREV(lo)] == 0) lo = DPREV(lo);\r\n\telse if (hi == lo) { lo = DPREV(lo); xi[DPREV(lo)] |= xi[lo]; }\r\n\txi[hi] = (uint8_t)cy; idig++;\r\n      }\r\n    }\r\n\r\n    /* Scale down until no more than 17 or 18 integer part digits remain. */\r\n    while (idig > 9) {\r\n      uint32_t i = hi, cy = 0;\r\n      ex2 += 6;\r\n      do {\r\n\tcy += xi[i];\r\n\txi[i] = (cy >> 6);\r\n\tcy = 100 * (cy & 0x3f);\r\n\tif (xi[i] == 0 && i == hi) hi = DNEXT(hi), idig--;\r\n\ti = DNEXT(i);\r\n      } while (i != lo);\r\n      while (cy) {\r\n\tif (hi == lo) { xi[DPREV(lo)] |= 1; break; }\r\n\txi[lo] = (cy >> 6); lo = DNEXT(lo);\r\n\tcy = 100 * (cy & 0x3f);\r\n      }\r\n    }\r\n\r\n    /* Collect integer part digits and convert to rescaled double. */\r\n    {\r\n      uint64_t x = xi[hi];\r\n      uint32_t i;\r\n      for (i = DNEXT(hi); --idig > 0 && i != lo; i = DNEXT(i))\r\n\tx = x * 100 + xi[i];\r\n      if (i == lo) {\r\n\twhile (--idig >= 0) x = x * 100;\r\n      } else {  /* Gather round bit from remaining digits. */\r\n\tx <<= 1; ex2--;\r\n\tdo {\r\n\t  if (xi[i]) { x |= 1; break; }\r\n\t  i = DNEXT(i);\r\n\t} while (i != lo);\r\n      }\r\n      strscan_double(x, o, ex2, neg);\r\n    }\r\n  }\r\n  return fmt;\r\n}\r\n\r\n/* Parse binary number. */\r\nstatic StrScanFmt strscan_bin(const uint8_t *p, TValue *o,\r\n\t\t\t      StrScanFmt fmt, uint32_t opt,\r\n\t\t\t      int32_t ex2, int32_t neg, uint32_t dig)\r\n{\r\n  uint64_t x = 0;\r\n  uint32_t i;\r\n\r\n  if (ex2 || dig > 64) return STRSCAN_ERROR;\r\n\r\n  /* Scan binary digits. */\r\n  for (i = dig; i; i--, p++) {\r\n    if ((*p & ~1) != '0') return STRSCAN_ERROR;\r\n    x = (x << 1) | (*p & 1);\r\n  }\r\n\r\n  /* Format-specific handling. */\r\n  switch (fmt) {\r\n  case STRSCAN_INT:\r\n    if (!(opt & STRSCAN_OPT_TONUM) && x < 0x80000000u+neg) {\r\n      o->i = neg ? -(int32_t)x : (int32_t)x;\r\n      return STRSCAN_INT;  /* Fast path for 32 bit integers. */\r\n    }\r\n    if (!(opt & STRSCAN_OPT_C)) { fmt = STRSCAN_NUM; break; }\r\n    /* fallthrough */\r\n  case STRSCAN_U32:\r\n    if (dig > 32) return STRSCAN_ERROR;\r\n    o->i = neg ? -(int32_t)x : (int32_t)x;\r\n    return STRSCAN_U32;\r\n  case STRSCAN_I64:\r\n  case STRSCAN_U64:\r\n    o->u64 = neg ? (uint64_t)-(int64_t)x : x;\r\n    return fmt;\r\n  default:\r\n    break;\r\n  }\r\n\r\n  /* Reduce range, then convert to double. */\r\n  if ((x & U64x(c0000000,0000000))) { x = (x >> 2) | (x & 3); ex2 += 2; }\r\n  strscan_double(x, o, ex2, neg);\r\n  return fmt;\r\n}\r\n\r\n/* Scan string containing a number. Returns format. Returns value in o. */\r\nStrScanFmt lj_strscan_scan(const uint8_t *p, TValue *o, uint32_t opt)\r\n{\r\n  int32_t neg = 0;\r\n\r\n  /* Remove leading space, parse sign and non-numbers. */\r\n  if (LJ_UNLIKELY(!lj_char_isdigit(*p))) {\r\n    while (lj_char_isspace(*p)) p++;\r\n    if (*p == '+' || *p == '-') neg = (*p++ == '-');\r\n    if (LJ_UNLIKELY(*p >= 'A')) {  /* Parse \"inf\", \"infinity\" or \"nan\". */\r\n      TValue tmp;\r\n      setnanV(&tmp);\r\n      if (casecmp(p[0],'i') && casecmp(p[1],'n') && casecmp(p[2],'f')) {\r\n\tif (neg) setminfV(&tmp); else setpinfV(&tmp);\r\n\tp += 3;\r\n\tif (casecmp(p[0],'i') && casecmp(p[1],'n') && casecmp(p[2],'i') &&\r\n\t    casecmp(p[3],'t') && casecmp(p[4],'y')) p += 5;\r\n      } else if (casecmp(p[0],'n') && casecmp(p[1],'a') && casecmp(p[2],'n')) {\r\n\tp += 3;\r\n      }\r\n      while (lj_char_isspace(*p)) p++;\r\n      if (*p) return STRSCAN_ERROR;\r\n      o->u64 = tmp.u64;\r\n      return STRSCAN_NUM;\r\n    }\r\n  }\r\n\r\n  /* Parse regular number. */\r\n  {\r\n    StrScanFmt fmt = STRSCAN_INT;\r\n    int cmask = LJ_CHAR_DIGIT;\r\n    int base = (opt & STRSCAN_OPT_C) && *p == '0' ? 0 : 10;\r\n    const uint8_t *sp, *dp = NULL;\r\n    uint32_t dig = 0, hasdig = 0, x = 0;\r\n    int32_t ex = 0;\r\n\r\n    /* Determine base and skip leading zeros. */\r\n    if (LJ_UNLIKELY(*p <= '0')) {\r\n      if (*p == '0') {\r\n\tif (casecmp(p[1], 'x'))\r\n\t  base = 16, cmask = LJ_CHAR_XDIGIT, p += 2;\r\n\telse if (casecmp(p[1], 'b'))\r\n\t  base = 2, cmask = LJ_CHAR_DIGIT, p += 2;\r\n      }\r\n      for ( ; ; p++) {\r\n\tif (*p == '0') {\r\n\t  hasdig = 1;\r\n\t} else if (*p == '.') {\r\n\t  if (dp) return STRSCAN_ERROR;\r\n\t  dp = p;\r\n\t} else {\r\n\t  break;\r\n\t}\r\n      }\r\n    }\r\n\r\n    /* Preliminary digit and decimal point scan. */\r\n    for (sp = p; ; p++) {\r\n      if (LJ_LIKELY(lj_char_isa(*p, cmask))) {\r\n\tx = x * 10 + (*p & 15);  /* For fast path below. */\r\n\tdig++;\r\n      } else if (*p == '.') {\r\n\tif (dp) return STRSCAN_ERROR;\r\n\tdp = p;\r\n      } else {\r\n\tbreak;\r\n      }\r\n    }\r\n    if (!(hasdig | dig)) return STRSCAN_ERROR;\r\n\r\n    /* Handle decimal point. */\r\n    if (dp) {\r\n      fmt = STRSCAN_NUM;\r\n      if (dig) {\r\n\tex = (int32_t)(dp-(p-1)); dp = p-1;\r\n\twhile (ex < 0 && *dp-- == '0') ex++, dig--;  /* Skip trailing zeros. */\r\n\tif (base == 16) ex *= 4;\r\n      }\r\n    }\r\n\r\n    /* Parse exponent. */\r\n    if (base >= 10 && casecmp(*p, (uint32_t)(base == 16 ? 'p' : 'e'))) {\r\n      uint32_t xx;\r\n      int negx = 0;\r\n      fmt = STRSCAN_NUM; p++;\r\n      if (*p == '+' || *p == '-') negx = (*p++ == '-');\r\n      if (!lj_char_isdigit(*p)) return STRSCAN_ERROR;\r\n      xx = (*p++ & 15);\r\n      while (lj_char_isdigit(*p)) {\r\n\tif (xx < 65536) xx = xx * 10 + (*p & 15);\r\n\tp++;\r\n      }\r\n      ex += negx ? -(int32_t)xx : (int32_t)xx;\r\n    }\r\n\r\n    /* Parse suffix. */\r\n    if (*p) {\r\n      /* I (IMAG), U (U32), LL (I64), ULL/LLU (U64), L (long), UL/LU (ulong). */\r\n      /* NYI: f (float). Not needed until cp_number() handles non-integers. */\r\n      if (casecmp(*p, 'i')) {\r\n\tif (!(opt & STRSCAN_OPT_IMAG)) return STRSCAN_ERROR;\r\n\tp++; fmt = STRSCAN_IMAG;\r\n      } else if (fmt == STRSCAN_INT) {\r\n\tif (casecmp(*p, 'u')) p++, fmt = STRSCAN_U32;\r\n\tif (casecmp(*p, 'l')) {\r\n\t  p++;\r\n\t  if (casecmp(*p, 'l')) p++, fmt += STRSCAN_I64 - STRSCAN_INT;\r\n\t  else if (!(opt & STRSCAN_OPT_C)) return STRSCAN_ERROR;\r\n\t  else if (sizeof(long) == 8) fmt += STRSCAN_I64 - STRSCAN_INT;\r\n\t}\r\n\tif (casecmp(*p, 'u') && (fmt == STRSCAN_INT || fmt == STRSCAN_I64))\r\n\t  p++, fmt += STRSCAN_U32 - STRSCAN_INT;\r\n\tif ((fmt == STRSCAN_U32 && !(opt & STRSCAN_OPT_C)) ||\r\n\t    (fmt >= STRSCAN_I64 && !(opt & STRSCAN_OPT_LL)))\r\n\t  return STRSCAN_ERROR;\r\n      }\r\n      while (lj_char_isspace(*p)) p++;\r\n      if (*p) return STRSCAN_ERROR;\r\n    }\r\n\r\n    /* Fast path for decimal 32 bit integers. */\r\n    if (fmt == STRSCAN_INT && base == 10 &&\r\n\t(dig < 10 || (dig == 10 && *sp <= '2' && x < 0x80000000u+neg))) {\r\n      int32_t y = neg ? -(int32_t)x : (int32_t)x;\r\n      if ((opt & STRSCAN_OPT_TONUM)) {\r\n\to->n = (double)y;\r\n\treturn STRSCAN_NUM;\r\n      } else {\r\n\to->i = y;\r\n\treturn STRSCAN_INT;\r\n      }\r\n    }\r\n\r\n    /* Dispatch to base-specific parser. */\r\n    if (base == 0 && !(fmt == STRSCAN_NUM || fmt == STRSCAN_IMAG))\r\n      return strscan_oct(sp, o, fmt, neg, dig);\r\n    if (base == 16)\r\n      fmt = strscan_hex(sp, o, fmt, opt, ex, neg, dig);\r\n    else if (base == 2)\r\n      fmt = strscan_bin(sp, o, fmt, opt, ex, neg, dig);\r\n    else\r\n      fmt = strscan_dec(sp, o, fmt, opt, ex, neg, dig);\r\n\r\n    /* Try to convert number to integer, if requested. */\r\n    if (fmt == STRSCAN_NUM && (opt & STRSCAN_OPT_TOINT)) {\r\n      double n = o->n;\r\n      int32_t i = lj_num2int(n);\r\n      if (n == (lua_Number)i) { o->i = i; return STRSCAN_INT; }\r\n    }\r\n    return fmt;\r\n  }\r\n}\r\n\r\nint LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o)\r\n{\r\n  StrScanFmt fmt = lj_strscan_scan((const uint8_t *)strdata(str), o,\r\n\t\t\t\t   STRSCAN_OPT_TONUM);\r\n  lua_assert(fmt == STRSCAN_ERROR || fmt == STRSCAN_NUM);\r\n  return (fmt != STRSCAN_ERROR);\r\n}\r\n\r\n#if LJ_DUALNUM\r\nint LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o)\r\n{\r\n  StrScanFmt fmt = lj_strscan_scan((const uint8_t *)strdata(str), o,\r\n\t\t\t\t   STRSCAN_OPT_TOINT);\r\n  lua_assert(fmt == STRSCAN_ERROR || fmt == STRSCAN_NUM || fmt == STRSCAN_INT);\r\n  if (fmt == STRSCAN_INT) setitype(o, LJ_TISNUM);\r\n  return (fmt != STRSCAN_ERROR);\r\n}\r\n#endif\r\n\r\n#undef DNEXT\r\n#undef DPREV\r\n#undef DLEN\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_strscan.h",
    "content": "/*\r\n** String scanning.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_STRSCAN_H\r\n#define _LJ_STRSCAN_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Options for accepted/returned formats. */\r\n#define STRSCAN_OPT_TOINT\t0x01  /* Convert to int32_t, if possible. */\r\n#define STRSCAN_OPT_TONUM\t0x02  /* Always convert to double. */\r\n#define STRSCAN_OPT_IMAG\t0x04\r\n#define STRSCAN_OPT_LL\t\t0x08\r\n#define STRSCAN_OPT_C\t\t0x10\r\n\r\n/* Returned format. */\r\ntypedef enum {\r\n  STRSCAN_ERROR,\r\n  STRSCAN_NUM, STRSCAN_IMAG,\r\n  STRSCAN_INT, STRSCAN_U32, STRSCAN_I64, STRSCAN_U64,\r\n} StrScanFmt;\r\n\r\nLJ_FUNC StrScanFmt lj_strscan_scan(const uint8_t *p, TValue *o, uint32_t opt);\r\nLJ_FUNC int LJ_FASTCALL lj_strscan_num(GCstr *str, TValue *o);\r\n#if LJ_DUALNUM\r\nLJ_FUNC int LJ_FASTCALL lj_strscan_number(GCstr *str, TValue *o);\r\n#else\r\n#define lj_strscan_number(s, o)\t\tlj_strscan_num((s), (o))\r\n#endif\r\n\r\n/* Check for number or convert string to number/int in-place (!). */\r\nstatic LJ_AINLINE int lj_strscan_numberobj(TValue *o)\r\n{\r\n  return tvisnumber(o) || (tvisstr(o) && lj_strscan_number(strV(o), o));\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_tab.c",
    "content": "/*\r\n** Table handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#define lj_tab_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_tab.h\"\r\n\r\n/* -- Object hashing ------------------------------------------------------ */\r\n\r\n/* Hash values are masked with the table hash mask and used as an index. */\r\nstatic LJ_AINLINE Node *hashmask(const GCtab *t, uint32_t hash)\r\n{\r\n  Node *n = noderef(t->node);\r\n  return &n[hash & t->hmask];\r\n}\r\n\r\n/* String hashes are precomputed when they are interned. */\r\n#define hashstr(t, s)\t\thashmask(t, (s)->hash)\r\n\r\n#define hashlohi(t, lo, hi)\thashmask((t), hashrot((lo), (hi)))\r\n#define hashnum(t, o)\t\thashlohi((t), (o)->u32.lo, ((o)->u32.hi << 1))\r\n#define hashptr(t, p)\t\thashlohi((t), u32ptr(p), u32ptr(p) + HASH_BIAS)\r\n#if LJ_GC64\r\n#define hashgcref(t, r) \\\r\n  hashlohi((t), (uint32_t)gcrefu(r), (uint32_t)(gcrefu(r) >> 32))\r\n#else\r\n#define hashgcref(t, r)\t\thashlohi((t), gcrefu(r), gcrefu(r) + HASH_BIAS)\r\n#endif\r\n\r\n/* Hash an arbitrary key and return its anchor position in the hash table. */\r\nstatic Node *hashkey(const GCtab *t, cTValue *key)\r\n{\r\n  lua_assert(!tvisint(key));\r\n  if (tvisstr(key))\r\n    return hashstr(t, strV(key));\r\n  else if (tvisnum(key))\r\n    return hashnum(t, key);\r\n  else if (tvisbool(key))\r\n    return hashmask(t, boolV(key));\r\n  else\r\n    return hashgcref(t, key->gcr);\r\n  /* Only hash 32 bits of lightuserdata on a 64 bit CPU. Good enough? */\r\n}\r\n\r\n/* -- Table creation and destruction -------------------------------------- */\r\n\r\n/* Create new hash part for table. */\r\nstatic LJ_AINLINE void newhpart(lua_State *L, GCtab *t, uint32_t hbits)\r\n{\r\n  uint32_t hsize;\r\n  Node *node;\r\n  lua_assert(hbits != 0);\r\n  if (hbits > LJ_MAX_HBITS)\r\n    lj_err_msg(L, LJ_ERR_TABOV);\r\n  hsize = 1u << hbits;\r\n  node = lj_mem_newvec(L, hsize, Node);\r\n  setmref(t->node, node);\r\n  setfreetop(t, node, &node[hsize]);\r\n  t->hmask = hsize-1;\r\n}\r\n\r\n/*\r\n** Q: Why all of these copies of t->hmask, t->node etc. to local variables?\r\n** A: Because alias analysis for C is _really_ tough.\r\n**    Even state-of-the-art C compilers won't produce good code without this.\r\n*/\r\n\r\n/* Clear hash part of table. */\r\nstatic LJ_AINLINE void clearhpart(GCtab *t)\r\n{\r\n  uint32_t i, hmask = t->hmask;\r\n  Node *node = noderef(t->node);\r\n  lua_assert(t->hmask != 0);\r\n  for (i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    setmref(n->next, NULL);\r\n    setnilV(&n->key);\r\n    setnilV(&n->val);\r\n  }\r\n}\r\n\r\n/* Clear array part of table. */\r\nstatic LJ_AINLINE void clearapart(GCtab *t)\r\n{\r\n  uint32_t i, asize = t->asize;\r\n  TValue *array = tvref(t->array);\r\n  for (i = 0; i < asize; i++)\r\n    setnilV(&array[i]);\r\n}\r\n\r\n/* Create a new table. Note: the slots are not initialized (yet). */\r\nstatic GCtab *newtab(lua_State *L, uint32_t asize, uint32_t hbits)\r\n{\r\n  GCtab *t;\r\n  /* First try to colocate the array part. */\r\n  if (LJ_MAX_COLOSIZE != 0 && asize > 0 && asize <= LJ_MAX_COLOSIZE) {\r\n    Node *nilnode;\r\n    lua_assert((sizeof(GCtab) & 7) == 0);\r\n    t = (GCtab *)lj_mem_newgco(L, sizetabcolo(asize));\r\n    t->gct = ~LJ_TTAB;\r\n    t->nomm = (uint8_t)~0;\r\n    t->colo = (int8_t)asize;\r\n    setmref(t->array, (TValue *)((char *)t + sizeof(GCtab)));\r\n    setgcrefnull(t->metatable);\r\n    t->asize = asize;\r\n    t->hmask = 0;\r\n    nilnode = &G(L)->nilnode;\r\n    setmref(t->node, nilnode);\r\n#if LJ_GC64\r\n    setmref(t->freetop, nilnode);\r\n#endif\r\n  } else {  /* Otherwise separately allocate the array part. */\r\n    Node *nilnode;\r\n    t = lj_mem_newobj(L, GCtab);\r\n    t->gct = ~LJ_TTAB;\r\n    t->nomm = (uint8_t)~0;\r\n    t->colo = 0;\r\n    setmref(t->array, NULL);\r\n    setgcrefnull(t->metatable);\r\n    t->asize = 0;  /* In case the array allocation fails. */\r\n    t->hmask = 0;\r\n    nilnode = &G(L)->nilnode;\r\n    setmref(t->node, nilnode);\r\n#if LJ_GC64\r\n    setmref(t->freetop, nilnode);\r\n#endif\r\n    if (asize > 0) {\r\n      if (asize > LJ_MAX_ASIZE)\r\n\tlj_err_msg(L, LJ_ERR_TABOV);\r\n      setmref(t->array, lj_mem_newvec(L, asize, TValue));\r\n      t->asize = asize;\r\n    }\r\n  }\r\n  if (hbits)\r\n    newhpart(L, t, hbits);\r\n  return t;\r\n}\r\n\r\n/* Create a new table.\r\n**\r\n** IMPORTANT NOTE: The API differs from lua_createtable()!\r\n**\r\n** The array size is non-inclusive. E.g. asize=128 creates array slots\r\n** for 0..127, but not for 128. If you need slots 1..128, pass asize=129\r\n** (slot 0 is wasted in this case).\r\n**\r\n** The hash size is given in hash bits. hbits=0 means no hash part.\r\n** hbits=1 creates 2 hash slots, hbits=2 creates 4 hash slots and so on.\r\n*/\r\nGCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits)\r\n{\r\n  GCtab *t = newtab(L, asize, hbits);\r\n  clearapart(t);\r\n  if (t->hmask > 0) clearhpart(t);\r\n  return t;\r\n}\r\n\r\n/* The API of this function conforms to lua_createtable(). */\r\nGCtab *lj_tab_new_ah(lua_State *L, int32_t a, int32_t h)\r\n{\r\n  return lj_tab_new(L, (uint32_t)(a > 0 ? a+1 : 0), hsize2hbits(h));\r\n}\r\n\r\n#if LJ_HASJIT\r\nGCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize)\r\n{\r\n  GCtab *t = newtab(L, ahsize & 0xffffff, ahsize >> 24);\r\n  clearapart(t);\r\n  if (t->hmask > 0) clearhpart(t);\r\n  return t;\r\n}\r\n#endif\r\n\r\n/* Duplicate a table. */\r\nGCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt)\r\n{\r\n  GCtab *t;\r\n  uint32_t asize, hmask;\r\n  t = newtab(L, kt->asize, kt->hmask > 0 ? lj_fls(kt->hmask)+1 : 0);\r\n  lua_assert(kt->asize == t->asize && kt->hmask == t->hmask);\r\n  t->nomm = 0;  /* Keys with metamethod names may be present. */\r\n  asize = kt->asize;\r\n  if (asize > 0) {\r\n    TValue *array = tvref(t->array);\r\n    TValue *karray = tvref(kt->array);\r\n    if (asize < 64) {  /* An inlined loop beats memcpy for < 512 bytes. */\r\n      uint32_t i;\r\n      for (i = 0; i < asize; i++)\r\n\tcopyTV(L, &array[i], &karray[i]);\r\n    } else {\r\n      memcpy(array, karray, asize*sizeof(TValue));\r\n    }\r\n  }\r\n  hmask = kt->hmask;\r\n  if (hmask > 0) {\r\n    uint32_t i;\r\n    Node *node = noderef(t->node);\r\n    Node *knode = noderef(kt->node);\r\n    ptrdiff_t d = (char *)node - (char *)knode;\r\n    setfreetop(t, node, (Node *)((char *)getfreetop(kt, knode) + d));\r\n    for (i = 0; i <= hmask; i++) {\r\n      Node *kn = &knode[i];\r\n      Node *n = &node[i];\r\n      Node *next = nextnode(kn);\r\n      /* Don't use copyTV here, since it asserts on a copy of a dead key. */\r\n      n->val = kn->val; n->key = kn->key;\r\n      setmref(n->next, next == NULL? next : (Node *)((char *)next + d));\r\n    }\r\n  }\r\n  return t;\r\n}\r\n\r\n/* Clear a table. */\r\nvoid LJ_FASTCALL lj_tab_clear(GCtab *t)\r\n{\r\n  clearapart(t);\r\n  if (t->hmask > 0) {\r\n    Node *node = noderef(t->node);\r\n    setfreetop(t, node, &node[t->hmask+1]);\r\n    clearhpart(t);\r\n  }\r\n}\r\n\r\n/* Free a table. */\r\nvoid LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t)\r\n{\r\n  if (t->hmask > 0)\r\n    lj_mem_freevec(g, noderef(t->node), t->hmask+1, Node);\r\n  if (t->asize > 0 && LJ_MAX_COLOSIZE != 0 && t->colo <= 0)\r\n    lj_mem_freevec(g, tvref(t->array), t->asize, TValue);\r\n  if (LJ_MAX_COLOSIZE != 0 && t->colo)\r\n    lj_mem_free(g, t, sizetabcolo((uint32_t)t->colo & 0x7f));\r\n  else\r\n    lj_mem_freet(g, t);\r\n}\r\n\r\n/* -- Table resizing ------------------------------------------------------ */\r\n\r\n/* Resize a table to fit the new array/hash part sizes. */\r\nvoid lj_tab_resize(lua_State *L, GCtab *t, uint32_t asize, uint32_t hbits)\r\n{\r\n  Node *oldnode = noderef(t->node);\r\n  uint32_t oldasize = t->asize;\r\n  uint32_t oldhmask = t->hmask;\r\n  if (asize > oldasize) {  /* Array part grows? */\r\n    TValue *array;\r\n    uint32_t i;\r\n    if (asize > LJ_MAX_ASIZE)\r\n      lj_err_msg(L, LJ_ERR_TABOV);\r\n    if (LJ_MAX_COLOSIZE != 0 && t->colo > 0) {\r\n      /* A colocated array must be separated and copied. */\r\n      TValue *oarray = tvref(t->array);\r\n      array = lj_mem_newvec(L, asize, TValue);\r\n      t->colo = (int8_t)(t->colo | 0x80);  /* Mark as separated (colo < 0). */\r\n      for (i = 0; i < oldasize; i++)\r\n\tcopyTV(L, &array[i], &oarray[i]);\r\n    } else {\r\n      array = (TValue *)lj_mem_realloc(L, tvref(t->array),\r\n\t\t\t  oldasize*sizeof(TValue), asize*sizeof(TValue));\r\n    }\r\n    setmref(t->array, array);\r\n    t->asize = asize;\r\n    for (i = oldasize; i < asize; i++)  /* Clear newly allocated slots. */\r\n      setnilV(&array[i]);\r\n  }\r\n  /* Create new (empty) hash part. */\r\n  if (hbits) {\r\n    newhpart(L, t, hbits);\r\n    clearhpart(t);\r\n  } else {\r\n    global_State *g = G(L);\r\n    setmref(t->node, &g->nilnode);\r\n#if LJ_GC64\r\n    setmref(t->freetop, &g->nilnode);\r\n#endif\r\n    t->hmask = 0;\r\n  }\r\n  if (asize < oldasize) {  /* Array part shrinks? */\r\n    TValue *array = tvref(t->array);\r\n    uint32_t i;\r\n    t->asize = asize;  /* Note: This 'shrinks' even colocated arrays. */\r\n    for (i = asize; i < oldasize; i++)  /* Reinsert old array values. */\r\n      if (!tvisnil(&array[i]))\r\n\tcopyTV(L, lj_tab_setinth(L, t, (int32_t)i), &array[i]);\r\n    /* Physically shrink only separated arrays. */\r\n    if (LJ_MAX_COLOSIZE != 0 && t->colo <= 0)\r\n      setmref(t->array, lj_mem_realloc(L, array,\r\n\t      oldasize*sizeof(TValue), asize*sizeof(TValue)));\r\n  }\r\n  if (oldhmask > 0) {  /* Reinsert pairs from old hash part. */\r\n    global_State *g;\r\n    uint32_t i;\r\n    for (i = 0; i <= oldhmask; i++) {\r\n      Node *n = &oldnode[i];\r\n      if (!tvisnil(&n->val))\r\n\tcopyTV(L, lj_tab_set(L, t, &n->key), &n->val);\r\n    }\r\n    g = G(L);\r\n    lj_mem_freevec(g, oldnode, oldhmask+1, Node);\r\n  }\r\n}\r\n\r\nstatic uint32_t countint(cTValue *key, uint32_t *bins)\r\n{\r\n  lua_assert(!tvisint(key));\r\n  if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if ((uint32_t)k < LJ_MAX_ASIZE && nk == (lua_Number)k) {\r\n      bins[(k > 2 ? lj_fls((uint32_t)(k-1)) : 0)]++;\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic uint32_t countarray(const GCtab *t, uint32_t *bins)\r\n{\r\n  uint32_t na, b, i;\r\n  if (t->asize == 0) return 0;\r\n  for (na = i = b = 0; b < LJ_MAX_ABITS; b++) {\r\n    uint32_t n, top = 2u << b;\r\n    TValue *array;\r\n    if (top >= t->asize) {\r\n      top = t->asize-1;\r\n      if (i > top)\r\n\tbreak;\r\n    }\r\n    array = tvref(t->array);\r\n    for (n = 0; i <= top; i++)\r\n      if (!tvisnil(&array[i]))\r\n\tn++;\r\n    bins[b] += n;\r\n    na += n;\r\n  }\r\n  return na;\r\n}\r\n\r\nstatic uint32_t counthash(const GCtab *t, uint32_t *bins, uint32_t *narray)\r\n{\r\n  uint32_t total, na, i, hmask = t->hmask;\r\n  Node *node = noderef(t->node);\r\n  for (total = na = 0, i = 0; i <= hmask; i++) {\r\n    Node *n = &node[i];\r\n    if (!tvisnil(&n->val)) {\r\n      na += countint(&n->key, bins);\r\n      total++;\r\n    }\r\n  }\r\n  *narray += na;\r\n  return total;\r\n}\r\n\r\nstatic uint32_t bestasize(uint32_t bins[], uint32_t *narray)\r\n{\r\n  uint32_t b, sum, na = 0, sz = 0, nn = *narray;\r\n  for (b = 0, sum = 0; 2*nn > (1u<<b) && sum != nn; b++)\r\n    if (bins[b] > 0 && 2*(sum += bins[b]) > (1u<<b)) {\r\n      sz = (2u<<b)+1;\r\n      na = sum;\r\n    }\r\n  *narray = sz;\r\n  return na;\r\n}\r\n\r\nstatic void rehashtab(lua_State *L, GCtab *t, cTValue *ek)\r\n{\r\n  uint32_t bins[LJ_MAX_ABITS];\r\n  uint32_t total, asize, na, i;\r\n  for (i = 0; i < LJ_MAX_ABITS; i++) bins[i] = 0;\r\n  asize = countarray(t, bins);\r\n  total = 1 + asize;\r\n  total += counthash(t, bins, &asize);\r\n  asize += countint(ek, bins);\r\n  na = bestasize(bins, &asize);\r\n  total -= na;\r\n  lj_tab_resize(L, t, asize, hsize2hbits(total));\r\n}\r\n\r\n#if LJ_HASFFI\r\nvoid lj_tab_rehash(lua_State *L, GCtab *t)\r\n{\r\n  rehashtab(L, t, niltv(L));\r\n}\r\n#endif\r\n\r\nvoid lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize)\r\n{\r\n  lj_tab_resize(L, t, nasize+1, t->hmask > 0 ? lj_fls(t->hmask)+1 : 0);\r\n}\r\n\r\n/* -- Table getters ------------------------------------------------------- */\r\n\r\ncTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key)\r\n{\r\n  TValue k;\r\n  Node *n;\r\n  k.n = (lua_Number)key;\r\n  n = hashnum(t, &k);\r\n  do {\r\n    if (tvisnum(&n->key) && n->key.n == k.n)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return NULL;\r\n}\r\n\r\ncTValue *lj_tab_getstr(GCtab *t, GCstr *key)\r\n{\r\n  Node *n = hashstr(t, key);\r\n  do {\r\n    if (tvisstr(&n->key) && strV(&n->key) == key)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return NULL;\r\n}\r\n\r\ncTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  if (tvisstr(key)) {\r\n    cTValue *tv = lj_tab_getstr(t, strV(key));\r\n    if (tv)\r\n      return tv;\r\n  } else if (tvisint(key)) {\r\n    cTValue *tv = lj_tab_getint(t, intV(key));\r\n    if (tv)\r\n      return tv;\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if (nk == (lua_Number)k) {\r\n      cTValue *tv = lj_tab_getint(t, k);\r\n      if (tv)\r\n\treturn tv;\r\n    } else {\r\n      goto genlookup;  /* Else use the generic lookup. */\r\n    }\r\n  } else if (!tvisnil(key)) {\r\n    Node *n;\r\n  genlookup:\r\n    n = hashkey(t, key);\r\n    do {\r\n      if (lj_obj_equal(&n->key, key))\r\n\treturn &n->val;\r\n    } while ((n = nextnode(n)));\r\n  }\r\n  return niltv(L);\r\n}\r\n\r\n/* -- Table setters ------------------------------------------------------- */\r\n\r\n/* Insert new key. Use Brent's variation to optimize the chain length. */\r\nTValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  Node *n = hashkey(t, key);\r\n  if (!tvisnil(&n->val) || t->hmask == 0) {\r\n    Node *nodebase = noderef(t->node);\r\n    Node *collide, *freenode = getfreetop(t, nodebase);\r\n    lua_assert(freenode >= nodebase && freenode <= nodebase+t->hmask+1);\r\n    do {\r\n      if (freenode == nodebase) {  /* No free node found? */\r\n\trehashtab(L, t, key);  /* Rehash table. */\r\n\treturn lj_tab_set(L, t, key);  /* Retry key insertion. */\r\n      }\r\n    } while (!tvisnil(&(--freenode)->key));\r\n    setfreetop(t, nodebase, freenode);\r\n    lua_assert(freenode != &G(L)->nilnode);\r\n    collide = hashkey(t, &n->key);\r\n    if (collide != n) {  /* Colliding node not the main node? */\r\n      while (noderef(collide->next) != n)  /* Find predecessor. */\r\n\tcollide = nextnode(collide);\r\n      setmref(collide->next, freenode);  /* Relink chain. */\r\n      /* Copy colliding node into free node and free main node. */\r\n      freenode->val = n->val;\r\n      freenode->key = n->key;\r\n      freenode->next = n->next;\r\n      setmref(n->next, NULL);\r\n      setnilV(&n->val);\r\n      /* Rechain pseudo-resurrected string keys with colliding hashes. */\r\n      while (nextnode(freenode)) {\r\n\tNode *nn = nextnode(freenode);\r\n\tif (tvisstr(&nn->key) && !tvisnil(&nn->val) &&\r\n\t    hashstr(t, strV(&nn->key)) == n) {\r\n\t  freenode->next = nn->next;\r\n\t  nn->next = n->next;\r\n\t  setmref(n->next, nn);\r\n\t} else {\r\n\t  freenode = nn;\r\n\t}\r\n      }\r\n    } else {  /* Otherwise use free node. */\r\n      setmrefr(freenode->next, n->next);  /* Insert into chain. */\r\n      setmref(n->next, freenode);\r\n      n = freenode;\r\n    }\r\n  }\r\n  n->key.u64 = key->u64;\r\n  if (LJ_UNLIKELY(tvismzero(&n->key)))\r\n    n->key.u64 = 0;\r\n  lj_gc_anybarriert(L, t);\r\n  lua_assert(tvisnil(&n->val));\r\n  return &n->val;\r\n}\r\n\r\nTValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key)\r\n{\r\n  TValue k;\r\n  Node *n;\r\n  k.n = (lua_Number)key;\r\n  n = hashnum(t, &k);\r\n  do {\r\n    if (tvisnum(&n->key) && n->key.n == k.n)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return lj_tab_newkey(L, t, &k);\r\n}\r\n\r\nTValue *lj_tab_setstr(lua_State *L, GCtab *t, GCstr *key)\r\n{\r\n  TValue k;\r\n  Node *n = hashstr(t, key);\r\n  do {\r\n    if (tvisstr(&n->key) && strV(&n->key) == key)\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  setstrV(L, &k, key);\r\n  return lj_tab_newkey(L, t, &k);\r\n}\r\n\r\nTValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  Node *n;\r\n  t->nomm = 0;  /* Invalidate negative metamethod cache. */\r\n  if (tvisstr(key)) {\r\n    return lj_tab_setstr(L, t, strV(key));\r\n  } else if (tvisint(key)) {\r\n    return lj_tab_setint(L, t, intV(key));\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if (nk == (lua_Number)k)\r\n      return lj_tab_setint(L, t, k);\r\n    if (tvisnan(key))\r\n      lj_err_msg(L, LJ_ERR_NANIDX);\r\n    /* Else use the generic lookup. */\r\n  } else if (tvisnil(key)) {\r\n    lj_err_msg(L, LJ_ERR_NILIDX);\r\n  }\r\n  n = hashkey(t, key);\r\n  do {\r\n    if (lj_obj_equal(&n->key, key))\r\n      return &n->val;\r\n  } while ((n = nextnode(n)));\r\n  return lj_tab_newkey(L, t, key);\r\n}\r\n\r\n/* -- Table traversal ----------------------------------------------------- */\r\n\r\n/* Get the traversal index of a key. */\r\nstatic uint32_t keyindex(lua_State *L, GCtab *t, cTValue *key)\r\n{\r\n  TValue tmp;\r\n  if (tvisint(key)) {\r\n    int32_t k = intV(key);\r\n    if ((uint32_t)k < t->asize)\r\n      return (uint32_t)k;  /* Array key indexes: [0..t->asize-1] */\r\n    setnumV(&tmp, (lua_Number)k);\r\n    key = &tmp;\r\n  } else if (tvisnum(key)) {\r\n    lua_Number nk = numV(key);\r\n    int32_t k = lj_num2int(nk);\r\n    if ((uint32_t)k < t->asize && nk == (lua_Number)k)\r\n      return (uint32_t)k;  /* Array key indexes: [0..t->asize-1] */\r\n  }\r\n  if (!tvisnil(key)) {\r\n    Node *n = hashkey(t, key);\r\n    do {\r\n      if (lj_obj_equal(&n->key, key))\r\n\treturn t->asize + (uint32_t)(n - noderef(t->node));\r\n\t/* Hash key indexes: [t->asize..t->asize+t->nmask] */\r\n    } while ((n = nextnode(n)));\r\n    if (key->u32.hi == 0xfffe7fff)  /* ITERN was despecialized while running. */\r\n      return key->u32.lo - 1;\r\n    lj_err_msg(L, LJ_ERR_NEXTIDX);\r\n    return 0;  /* unreachable */\r\n  }\r\n  return ~0u;  /* A nil key starts the traversal. */\r\n}\r\n\r\n/* Advance to the next step in a table traversal. */\r\nint lj_tab_next(lua_State *L, GCtab *t, TValue *key)\r\n{\r\n  uint32_t i = keyindex(L, t, key);  /* Find predecessor key index. */\r\n  for (i++; i < t->asize; i++)  /* First traverse the array keys. */\r\n    if (!tvisnil(arrayslot(t, i))) {\r\n      setintV(key, i);\r\n      copyTV(L, key+1, arrayslot(t, i));\r\n      return 1;\r\n    }\r\n  for (i -= t->asize; i <= t->hmask; i++) {  /* Then traverse the hash keys. */\r\n    Node *n = &noderef(t->node)[i];\r\n    if (!tvisnil(&n->val)) {\r\n      copyTV(L, key, &n->key);\r\n      copyTV(L, key+1, &n->val);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* End of traversal. */\r\n}\r\n\r\n/* -- Table length calculation -------------------------------------------- */\r\n\r\nstatic MSize unbound_search(GCtab *t, MSize j)\r\n{\r\n  cTValue *tv;\r\n  MSize i = j;  /* i is zero or a present index */\r\n  j++;\r\n  /* find `i' and `j' such that i is present and j is not */\r\n  while ((tv = lj_tab_getint(t, (int32_t)j)) && !tvisnil(tv)) {\r\n    i = j;\r\n    j *= 2;\r\n    if (j > (MSize)(INT_MAX-2)) {  /* overflow? */\r\n      /* table was built with bad purposes: resort to linear search */\r\n      i = 1;\r\n      while ((tv = lj_tab_getint(t, (int32_t)i)) && !tvisnil(tv)) i++;\r\n      return i - 1;\r\n    }\r\n  }\r\n  /* now do a binary search between them */\r\n  while (j - i > 1) {\r\n    MSize m = (i+j)/2;\r\n    cTValue *tvb = lj_tab_getint(t, (int32_t)m);\r\n    if (tvb && !tvisnil(tvb)) i = m; else j = m;\r\n  }\r\n  return i;\r\n}\r\n\r\n/*\r\n** Try to find a boundary in table `t'. A `boundary' is an integer index\r\n** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil).\r\n*/\r\nMSize LJ_FASTCALL lj_tab_len(GCtab *t)\r\n{\r\n  MSize j = (MSize)t->asize;\r\n  if (j > 1 && tvisnil(arrayslot(t, j-1))) {\r\n    MSize i = 1;\r\n    while (j - i > 1) {\r\n      MSize m = (i+j)/2;\r\n      if (tvisnil(arrayslot(t, m-1))) j = m; else i = m;\r\n    }\r\n    return i-1;\r\n  }\r\n  if (j) j--;\r\n  if (t->hmask <= 0)\r\n    return j;\r\n  return unbound_search(t, j);\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_tab.h",
    "content": "/*\r\n** Table handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TAB_H\r\n#define _LJ_TAB_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Hash constants. Tuned using a brute force search. */\r\n#define HASH_BIAS\t(-0x04c11db7)\r\n#define HASH_ROT1\t14\r\n#define HASH_ROT2\t5\r\n#define HASH_ROT3\t13\r\n\r\n/* Scramble the bits of numbers and pointers. */\r\nstatic LJ_AINLINE uint32_t hashrot(uint32_t lo, uint32_t hi)\r\n{\r\n#if LJ_TARGET_X86ORX64\r\n  /* Prefer variant that compiles well for a 2-operand CPU. */\r\n  lo ^= hi; hi = lj_rol(hi, HASH_ROT1);\r\n  lo -= hi; hi = lj_rol(hi, HASH_ROT2);\r\n  hi ^= lo; hi -= lj_rol(lo, HASH_ROT3);\r\n#else\r\n  lo ^= hi;\r\n  lo = lo - lj_rol(hi, HASH_ROT1);\r\n  hi = lo ^ lj_rol(hi, HASH_ROT1 + HASH_ROT2);\r\n  hi = hi - lj_rol(lo, HASH_ROT3);\r\n#endif\r\n  return hi;\r\n}\r\n\r\n#define hsize2hbits(s)\t((s) ? ((s)==1 ? 1 : 1+lj_fls((uint32_t)((s)-1))) : 0)\r\n\r\nLJ_FUNCA GCtab *lj_tab_new(lua_State *L, uint32_t asize, uint32_t hbits);\r\nLJ_FUNC GCtab *lj_tab_new_ah(lua_State *L, int32_t a, int32_t h);\r\n#if LJ_HASJIT\r\nLJ_FUNC GCtab * LJ_FASTCALL lj_tab_new1(lua_State *L, uint32_t ahsize);\r\n#endif\r\nLJ_FUNCA GCtab * LJ_FASTCALL lj_tab_dup(lua_State *L, const GCtab *kt);\r\nLJ_FUNC void LJ_FASTCALL lj_tab_clear(GCtab *t);\r\nLJ_FUNC void LJ_FASTCALL lj_tab_free(global_State *g, GCtab *t);\r\n#if LJ_HASFFI\r\nLJ_FUNC void lj_tab_rehash(lua_State *L, GCtab *t);\r\n#endif\r\nLJ_FUNC void lj_tab_resize(lua_State *L, GCtab *t, uint32_t asize, uint32_t hbits);\r\nLJ_FUNCA void lj_tab_reasize(lua_State *L, GCtab *t, uint32_t nasize);\r\n\r\n/* Caveat: all getters except lj_tab_get() can return NULL! */\r\n\r\nLJ_FUNCA cTValue * LJ_FASTCALL lj_tab_getinth(GCtab *t, int32_t key);\r\nLJ_FUNC cTValue *lj_tab_getstr(GCtab *t, GCstr *key);\r\nLJ_FUNCA cTValue *lj_tab_get(lua_State *L, GCtab *t, cTValue *key);\r\n\r\n/* Caveat: all setters require a write barrier for the stored value. */\r\n\r\nLJ_FUNCA TValue *lj_tab_newkey(lua_State *L, GCtab *t, cTValue *key);\r\nLJ_FUNCA TValue *lj_tab_setinth(lua_State *L, GCtab *t, int32_t key);\r\nLJ_FUNC TValue *lj_tab_setstr(lua_State *L, GCtab *t, GCstr *key);\r\nLJ_FUNC TValue *lj_tab_set(lua_State *L, GCtab *t, cTValue *key);\r\n\r\n#define inarray(t, key)\t\t((MSize)(key) < (MSize)(t)->asize)\r\n#define arrayslot(t, i)\t\t(&tvref((t)->array)[(i)])\r\n#define lj_tab_getint(t, key) \\\r\n  (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_getinth((t), (key)))\r\n#define lj_tab_setint(L, t, key) \\\r\n  (inarray((t), (key)) ? arrayslot((t), (key)) : lj_tab_setinth(L, (t), (key)))\r\n\r\nLJ_FUNCA int lj_tab_next(lua_State *L, GCtab *t, TValue *key);\r\nLJ_FUNCA MSize LJ_FASTCALL lj_tab_len(GCtab *t);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target.h",
    "content": "/*\r\n** Definitions for target CPU.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_H\r\n#define _LJ_TARGET_H\r\n\r\n#include \"lj_def.h\"\r\n#include \"lj_arch.h\"\r\n\r\n/* -- Registers and spill slots ------------------------------------------- */\r\n\r\n/* Register type (uint8_t in ir->r). */\r\ntypedef uint32_t Reg;\r\n\r\n/* The hi-bit is NOT set for an allocated register. This means the value\r\n** can be directly used without masking. The hi-bit is set for a register\r\n** allocation hint or for RID_INIT, RID_SINK or RID_SUNK.\r\n*/\r\n#define RID_NONE\t\t0x80\r\n#define RID_MASK\t\t0x7f\r\n#define RID_INIT\t\t(RID_NONE|RID_MASK)\r\n#define RID_SINK\t\t(RID_INIT-1)\r\n#define RID_SUNK\t\t(RID_INIT-2)\r\n\r\n#define ra_noreg(r)\t\t((r) & RID_NONE)\r\n#define ra_hasreg(r)\t\t(!((r) & RID_NONE))\r\n\r\n/* The ra_hashint() macro assumes a previous test for ra_noreg(). */\r\n#define ra_hashint(r)\t\t((r) < RID_SUNK)\r\n#define ra_gethint(r)\t\t((Reg)((r) & RID_MASK))\r\n#define ra_sethint(rr, r)\trr = (uint8_t)((r)|RID_NONE)\r\n#define ra_samehint(r1, r2)\t(ra_gethint((r1)^(r2)) == 0)\r\n\r\n/* Spill slot 0 means no spill slot has been allocated. */\r\n#define SPS_NONE\t\t0\r\n\r\n#define ra_hasspill(s)\t\t((s) != SPS_NONE)\r\n\r\n/* Combined register and spill slot (uint16_t in ir->prev). */\r\ntypedef uint32_t RegSP;\r\n\r\n#define REGSP(r, s)\t\t((r) + ((s) << 8))\r\n#define REGSP_HINT(r)\t\t((r)|RID_NONE)\r\n#define REGSP_INIT\t\tREGSP(RID_INIT, 0)\r\n\r\n#define regsp_reg(rs)\t\t((rs) & 255)\r\n#define regsp_spill(rs)\t\t((rs) >> 8)\r\n#define regsp_used(rs) \\\r\n  (((rs) & ~REGSP(RID_MASK, 0)) != REGSP(RID_NONE, 0))\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Bitset for registers. 32 registers suffice for most architectures.\r\n** Note that one set holds bits for both GPRs and FPRs.\r\n*/\r\n#if LJ_TARGET_PPC || LJ_TARGET_MIPS\r\ntypedef uint64_t RegSet;\r\n#else\r\ntypedef uint32_t RegSet;\r\n#endif\r\n\r\n#define RID2RSET(r)\t\t(((RegSet)1) << (r))\r\n#define RSET_EMPTY\t\t((RegSet)0)\r\n#define RSET_RANGE(lo, hi)\t((RID2RSET((hi)-(lo))-1) << (lo))\r\n\r\n#define rset_test(rs, r)\t((int)((rs) >> (r)) & 1)\r\n#define rset_set(rs, r)\t\t(rs |= RID2RSET(r))\r\n#define rset_clear(rs, r)\t(rs &= ~RID2RSET(r))\r\n#define rset_exclude(rs, r)\t(rs & ~RID2RSET(r))\r\n#if LJ_TARGET_PPC || LJ_TARGET_MIPS\r\n#define rset_picktop(rs)\t((Reg)(__builtin_clzll(rs)^63))\r\n#define rset_pickbot(rs)\t((Reg)__builtin_ctzll(rs))\r\n#else\r\n#define rset_picktop(rs)\t((Reg)lj_fls(rs))\r\n#define rset_pickbot(rs)\t((Reg)lj_ffs(rs))\r\n#endif\r\n\r\n/* -- Register allocation cost -------------------------------------------- */\r\n\r\n/* The register allocation heuristic keeps track of the cost for allocating\r\n** a specific register:\r\n**\r\n** A free register (obviously) has a cost of 0 and a 1-bit in the free mask.\r\n**\r\n** An already allocated register has the (non-zero) IR reference in the lowest\r\n** bits and the result of a blended cost-model in the higher bits.\r\n**\r\n** The allocator first checks the free mask for a hit. Otherwise an (unrolled)\r\n** linear search for the minimum cost is used. The search doesn't need to\r\n** keep track of the position of the minimum, which makes it very fast.\r\n** The lowest bits of the minimum cost show the desired IR reference whose\r\n** register is the one to evict.\r\n**\r\n** Without the cost-model this degenerates to the standard heuristics for\r\n** (reverse) linear-scan register allocation. Since code generation is done\r\n** in reverse, a live interval extends from the last use to the first def.\r\n** For an SSA IR the IR reference is the first (and only) def and thus\r\n** trivially marks the end of the interval. The LSRA heuristics says to pick\r\n** the register whose live interval has the furthest extent, i.e. the lowest\r\n** IR reference in our case.\r\n**\r\n** A cost-model should take into account other factors, like spill-cost and\r\n** restore- or rematerialization-cost, which depend on the kind of instruction.\r\n** E.g. constants have zero spill costs, variant instructions have higher\r\n** costs than invariants and PHIs should preferably never be spilled.\r\n**\r\n** Here's a first cut at simple, but effective blended cost-model for R-LSRA:\r\n** - Due to careful design of the IR, constants already have lower IR\r\n**   references than invariants and invariants have lower IR references\r\n**   than variants.\r\n** - The cost in the upper 16 bits is the sum of the IR reference and a\r\n**   weighted score. The score currently only takes into account whether\r\n**   the IRT_ISPHI bit is set in the instruction type.\r\n** - The PHI weight is the minimum distance (in IR instructions) a PHI\r\n**   reference has to be further apart from a non-PHI reference to be spilled.\r\n** - It should be a power of two (for speed) and must be between 2 and 32768.\r\n**   Good values for the PHI weight seem to be between 40 and 150.\r\n** - Further study is required.\r\n*/\r\n#define REGCOST_PHI_WEIGHT\t64\r\n\r\n/* Cost for allocating a specific register. */\r\ntypedef uint32_t RegCost;\r\n\r\n/* Note: assumes 16 bit IRRef1. */\r\n#define REGCOST(cost, ref)\t((RegCost)(ref) + ((RegCost)(cost) << 16))\r\n#define regcost_ref(rc)\t\t((IRRef1)(rc))\r\n\r\n#define REGCOST_T(t) \\\r\n  ((RegCost)((t)&IRT_ISPHI) * (((RegCost)(REGCOST_PHI_WEIGHT)<<16)/IRT_ISPHI))\r\n#define REGCOST_REF_T(ref, t)\t(REGCOST((ref), (ref)) + REGCOST_T((t)))\r\n\r\n/* -- Target-specific definitions ----------------------------------------- */\r\n\r\n#if LJ_TARGET_X86ORX64\r\n#include \"lj_target_x86.h\"\r\n#elif LJ_TARGET_ARM\r\n#include \"lj_target_arm.h\"\r\n#elif LJ_TARGET_ARM64\r\n#include \"lj_target_arm64.h\"\r\n#elif LJ_TARGET_PPC\r\n#include \"lj_target_ppc.h\"\r\n#elif LJ_TARGET_MIPS\r\n#include \"lj_target_mips.h\"\r\n#else\r\n#error \"Missing include for target CPU\"\r\n#endif\r\n\r\n#ifdef EXITSTUBS_PER_GROUP\r\n/* Return the address of an exit stub. */\r\nstatic LJ_AINLINE char *exitstub_addr_(char **group, uint32_t exitno)\r\n{\r\n  lua_assert(group[exitno / EXITSTUBS_PER_GROUP] != NULL);\r\n  return (char *)group[exitno / EXITSTUBS_PER_GROUP] +\r\n\t EXITSTUB_SPACING*(exitno % EXITSTUBS_PER_GROUP);\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_addr(J, exitno) \\\r\n  ((MCode *)exitstub_addr_((char **)((J)->exitstubgroup), (exitno)))\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target_arm.h",
    "content": "/*\r\n** Definitions for ARM CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_ARM_H\r\n#define _LJ_TARGET_ARM_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(R1) _(R2) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(SP) _(LR) _(PC)\r\n#if LJ_SOFTFP\r\n#define FPRDEF(_)\r\n#else\r\n#define FPRDEF(_) \\\r\n  _(D0) _(D1) _(D2) _(D3) _(D4) _(D5) _(D6) _(D7) \\\r\n  _(D8) _(D9) _(D10) _(D11) _(D12) _(D13) _(D14) _(D15)\r\n#endif\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_TMP = RID_LR,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R0,\r\n  RID_RETLO = RID_R0,\r\n  RID_RETHI = RID_R1,\r\n#if LJ_SOFTFP\r\n  RID_FPRET = RID_R0,\r\n#else\r\n  RID_FPRET = RID_D0,\r\n#endif\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R9,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R6,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R7,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R8,\t\t/* Interpreter L. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_PC+1,\r\n  RID_MIN_FPR = RID_MAX_GPR,\r\n#if LJ_SOFTFP\r\n  RID_MAX_FPR = RID_MIN_FPR,\r\n#else\r\n  RID_MAX_FPR = RID_D15+1,\r\n#endif\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except sp, lr and pc. */\r\n#define RSET_GPR\t\t(RSET_RANGE(RID_MIN_GPR, RID_R12+1))\r\n#define RSET_GPREVEN \\\r\n  (RID2RSET(RID_R0)|RID2RSET(RID_R2)|RID2RSET(RID_R4)|RID2RSET(RID_R6)| \\\r\n   RID2RSET(RID_R8)|RID2RSET(RID_R10))\r\n#define RSET_GPRODD \\\r\n  (RID2RSET(RID_R1)|RID2RSET(RID_R3)|RID2RSET(RID_R5)|RID2RSET(RID_R7)| \\\r\n   RID2RSET(RID_R9)|RID2RSET(RID_R11))\r\n#if LJ_SOFTFP\r\n#define RSET_FPR\t\t0\r\n#else\r\n#define RSET_FPR\t\t(RSET_RANGE(RID_MIN_FPR, RID_MAX_FPR))\r\n#endif\r\n#define RSET_ALL\t\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\t\tRSET_ALL\r\n\r\n/* ABI-specific register sets. lr is an implicit scratch register. */\r\n#define RSET_SCRATCH_GPR_\t(RSET_RANGE(RID_R0, RID_R3+1)|RID2RSET(RID_R12))\r\n#ifdef __APPLE__\r\n#define RSET_SCRATCH_GPR\t(RSET_SCRATCH_GPR_|RID2RSET(RID_R9))\r\n#else\r\n#define RSET_SCRATCH_GPR\tRSET_SCRATCH_GPR_\r\n#endif\r\n#if LJ_SOFTFP\r\n#define RSET_SCRATCH_FPR\t0\r\n#else\r\n#define RSET_SCRATCH_FPR\t(RSET_RANGE(RID_D0, RID_D7+1))\r\n#endif\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R0\r\n#define REGARG_LASTGPR\t\tRID_R3\r\n#define REGARG_NUMGPR\t\t4\r\n#if LJ_ABI_SOFTFP\r\n#define REGARG_FIRSTFPR\t\t0\r\n#define REGARG_LASTFPR\t\t0\r\n#define REGARG_NUMFPR\t\t0\r\n#else\r\n#define REGARG_FIRSTFPR\t\tRID_D0\r\n#define REGARG_LASTFPR\t\tRID_D7\r\n#define REGARG_NUMFPR\t\t8\r\n#endif\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use. Reserve min. two 32 bit slots.\r\n*/\r\n#define SPS_FIXED\t2\r\n#define SPS_FIRST\t2\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 1) & ~1)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n#if !LJ_SOFTFP\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n#endif\r\n  int32_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* PC after instruction that caused an exit. Used to find the trace number. */\r\n#define EXITSTATE_PCREG\t\tRID_PC\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n#define EXITSTUB_SPACING        4\r\n#define EXITSTUBS_PER_GROUP     32\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define ARMF_CC(ai, cc)\t(((ai) ^ ARMI_CCAL) | ((cc) << 28))\r\n#define ARMF_N(r)\t((r) << 16)\r\n#define ARMF_D(r)\t((r) << 12)\r\n#define ARMF_S(r)\t((r) << 8)\r\n#define ARMF_M(r)\t(r)\r\n#define ARMF_SH(sh, n)\t(((sh) << 5) | ((n) << 7))\r\n#define ARMF_RSH(sh, r)\t(0x10 | ((sh) << 5) | ARMF_S(r))\r\n\r\ntypedef enum ARMIns {\r\n  ARMI_CCAL = 0xe0000000,\r\n  ARMI_S = 0x000100000,\r\n  ARMI_K12 = 0x02000000,\r\n  ARMI_KNEG = 0x00200000,\r\n  ARMI_LS_W = 0x00200000,\r\n  ARMI_LS_U = 0x00800000,\r\n  ARMI_LS_P = 0x01000000,\r\n  ARMI_LS_R = 0x02000000,\r\n  ARMI_LSX_I = 0x00400000,\r\n\r\n  ARMI_AND = 0xe0000000,\r\n  ARMI_EOR = 0xe0200000,\r\n  ARMI_SUB = 0xe0400000,\r\n  ARMI_RSB = 0xe0600000,\r\n  ARMI_ADD = 0xe0800000,\r\n  ARMI_ADC = 0xe0a00000,\r\n  ARMI_SBC = 0xe0c00000,\r\n  ARMI_RSC = 0xe0e00000,\r\n  ARMI_TST = 0xe1100000,\r\n  ARMI_TEQ = 0xe1300000,\r\n  ARMI_CMP = 0xe1500000,\r\n  ARMI_CMN = 0xe1700000,\r\n  ARMI_ORR = 0xe1800000,\r\n  ARMI_MOV = 0xe1a00000,\r\n  ARMI_BIC = 0xe1c00000,\r\n  ARMI_MVN = 0xe1e00000,\r\n\r\n  ARMI_NOP = 0xe1a00000,\r\n\r\n  ARMI_MUL = 0xe0000090,\r\n  ARMI_SMULL = 0xe0c00090,\r\n\r\n  ARMI_LDR = 0xe4100000,\r\n  ARMI_LDRB = 0xe4500000,\r\n  ARMI_LDRH = 0xe01000b0,\r\n  ARMI_LDRSB = 0xe01000d0,\r\n  ARMI_LDRSH = 0xe01000f0,\r\n  ARMI_LDRD = 0xe00000d0,\r\n  ARMI_STR = 0xe4000000,\r\n  ARMI_STRB = 0xe4400000,\r\n  ARMI_STRH = 0xe00000b0,\r\n  ARMI_STRD = 0xe00000f0,\r\n  ARMI_PUSH = 0xe92d0000,\r\n\r\n  ARMI_B = 0xea000000,\r\n  ARMI_BL = 0xeb000000,\r\n  ARMI_BLX = 0xfa000000,\r\n  ARMI_BLXr = 0xe12fff30,\r\n\r\n  /* ARMv6 */\r\n  ARMI_REV = 0xe6bf0f30,\r\n  ARMI_SXTB = 0xe6af0070,\r\n  ARMI_SXTH = 0xe6bf0070,\r\n  ARMI_UXTB = 0xe6ef0070,\r\n  ARMI_UXTH = 0xe6ff0070,\r\n\r\n  /* ARMv6T2 */\r\n  ARMI_MOVW = 0xe3000000,\r\n  ARMI_MOVT = 0xe3400000,\r\n\r\n  /* VFP */\r\n  ARMI_VMOV_D = 0xeeb00b40,\r\n  ARMI_VMOV_S = 0xeeb00a40,\r\n  ARMI_VMOVI_D = 0xeeb00b00,\r\n\r\n  ARMI_VMOV_R_S = 0xee100a10,\r\n  ARMI_VMOV_S_R = 0xee000a10,\r\n  ARMI_VMOV_RR_D = 0xec500b10,\r\n  ARMI_VMOV_D_RR = 0xec400b10,\r\n\r\n  ARMI_VADD_D = 0xee300b00,\r\n  ARMI_VSUB_D = 0xee300b40,\r\n  ARMI_VMUL_D = 0xee200b00,\r\n  ARMI_VMLA_D = 0xee000b00,\r\n  ARMI_VMLS_D = 0xee000b40,\r\n  ARMI_VNMLS_D = 0xee100b00,\r\n  ARMI_VDIV_D = 0xee800b00,\r\n\r\n  ARMI_VABS_D = 0xeeb00bc0,\r\n  ARMI_VNEG_D = 0xeeb10b40,\r\n  ARMI_VSQRT_D = 0xeeb10bc0,\r\n\r\n  ARMI_VCMP_D = 0xeeb40b40,\r\n  ARMI_VCMPZ_D = 0xeeb50b40,\r\n\r\n  ARMI_VMRS = 0xeef1fa10,\r\n\r\n  ARMI_VCVT_S32_F32 = 0xeebd0ac0,\r\n  ARMI_VCVT_S32_F64 = 0xeebd0bc0,\r\n  ARMI_VCVT_U32_F32 = 0xeebc0ac0,\r\n  ARMI_VCVT_U32_F64 = 0xeebc0bc0,\r\n  ARMI_VCVT_F32_S32 = 0xeeb80ac0,\r\n  ARMI_VCVT_F64_S32 = 0xeeb80bc0,\r\n  ARMI_VCVT_F32_U32 = 0xeeb80a40,\r\n  ARMI_VCVT_F64_U32 = 0xeeb80b40,\r\n  ARMI_VCVT_F32_F64 = 0xeeb70bc0,\r\n  ARMI_VCVT_F64_F32 = 0xeeb70ac0,\r\n\r\n  ARMI_VLDR_S = 0xed100a00,\r\n  ARMI_VLDR_D = 0xed100b00,\r\n  ARMI_VSTR_S = 0xed000a00,\r\n  ARMI_VSTR_D = 0xed000b00,\r\n} ARMIns;\r\n\r\ntypedef enum ARMShift {\r\n  ARMSH_LSL, ARMSH_LSR, ARMSH_ASR, ARMSH_ROR\r\n} ARMShift;\r\n\r\n/* ARM condition codes. */\r\ntypedef enum ARMCC {\r\n  CC_EQ, CC_NE, CC_CS, CC_CC, CC_MI, CC_PL, CC_VS, CC_VC,\r\n  CC_HI, CC_LS, CC_GE, CC_LT, CC_GT, CC_LE, CC_AL,\r\n  CC_HS = CC_CS, CC_LO = CC_CC\r\n} ARMCC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target_arm64.h",
    "content": "/*\r\n** Definitions for ARM64 CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_ARM64_H\r\n#define _LJ_TARGET_ARM64_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(X0) _(X1) _(X2) _(X3) _(X4) _(X5) _(X6) _(X7) \\\r\n  _(X8) _(X9) _(X10) _(X11) _(X12) _(X13) _(X14) _(X15) \\\r\n  _(X16) _(X17) _(X18) _(X19) _(X20) _(X21) _(X22) _(X23) \\\r\n  _(X24) _(X25) _(X26) _(X27) _(X28) _(FP) _(LR) _(SP)\r\n#define FPRDEF(_) \\\r\n  _(D0) _(D1) _(D2) _(D3) _(D4) _(D5) _(D6) _(D7) \\\r\n  _(D8) _(D9) _(D10) _(D11) _(D12) _(D13) _(D14) _(D15) \\\r\n  _(D16) _(D17) _(D18) _(D19) _(D20) _(D21) _(D22) _(D23) \\\r\n  _(D24) _(D25) _(D26) _(D27) _(D28) _(D29) _(D30) _(D31)\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_TMP = RID_LR,\r\n  RID_ZERO = RID_SP,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_X0,\r\n  RID_FPRET = RID_D0,\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_X19,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_X21,\t\t/* Interpreter PC. */\r\n  RID_GL = RID_X22,\t\t/* Interpreter GL. */\r\n  RID_LREG = RID_X23,\t\t/* Interpreter L. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_X0,\r\n  RID_MAX_GPR = RID_SP+1,\r\n  RID_MIN_FPR = RID_MAX_GPR,\r\n  RID_MAX_FPR = RID_D31+1,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_X0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except for x18, fp, lr and sp. */\r\n#define RSET_FIXED \\\r\n  (RID2RSET(RID_X18)|RID2RSET(RID_FP)|RID2RSET(RID_LR)|RID2RSET(RID_SP))\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR) - RSET_FIXED)\r\n#define RSET_FPR\tRSET_RANGE(RID_MIN_FPR, RID_MAX_FPR)\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n/* lr is an implicit scratch register. */\r\n#define RSET_SCRATCH_GPR\t(RSET_RANGE(RID_X0, RID_X17+1))\r\n#define RSET_SCRATCH_FPR \\\r\n  (RSET_RANGE(RID_D0, RID_D7+1)|RSET_RANGE(RID_D16, RID_D31+1))\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_X0\r\n#define REGARG_LASTGPR\t\tRID_X7\r\n#define REGARG_NUMGPR\t\t8\r\n#define REGARG_FIRSTFPR\t\tRID_D0\r\n#define REGARG_LASTFPR\t\tRID_D7\r\n#define REGARG_NUMFPR\t\t8\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define A64F_D(r)\t(r)\r\n#define A64F_N(r)       ((r) << 5)\r\n#define A64F_A(r)       ((r) << 10)\r\n#define A64F_M(r)       ((r) << 16)\r\n#define A64F_U16(x)\t((x) << 5)\r\n#define A64F_S26(x)\t(x)\r\n#define A64F_S19(x)\t((x) << 5)\r\n\r\ntypedef enum A64Ins {\r\n  A64I_MOVZw = 0x52800000,\r\n  A64I_MOVZx = 0xd2800000,\r\n  A64I_LDRLw = 0x18000000,\r\n  A64I_LDRLx = 0x58000000,\r\n  A64I_NOP = 0xd503201f,\r\n  A64I_B = 0x14000000,\r\n  A64I_BR = 0xd61f0000,\r\n} A64Ins;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target_mips.h",
    "content": "/*\r\n** Definitions for MIPS CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_MIPS_H\r\n#define _LJ_TARGET_MIPS_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(R1) _(R2) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(R13) _(R14) _(R15) \\\r\n  _(R16) _(R17) _(R18) _(R19) _(R20) _(R21) _(R22) _(R23) \\\r\n  _(R24) _(R25) _(SYS1) _(SYS2) _(R28) _(SP) _(R30) _(RA)\r\n#define FPRDEF(_) \\\r\n  _(F0) _(F1) _(F2) _(F3) _(F4) _(F5) _(F6) _(F7) \\\r\n  _(F8) _(F9) _(F10) _(F11) _(F12) _(F13) _(F14) _(F15) \\\r\n  _(F16) _(F17) _(F18) _(F19) _(F20) _(F21) _(F22) _(F23) \\\r\n  _(F24) _(F25) _(F26) _(F27) _(F28) _(F29) _(F30) _(F31)\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_ZERO = RID_R0,\r\n  RID_TMP = RID_RA,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R2,\r\n#if LJ_LE\r\n  RID_RETHI = RID_R3,\r\n  RID_RETLO = RID_R2,\r\n#else\r\n  RID_RETHI = RID_R2,\r\n  RID_RETLO = RID_R3,\r\n#endif\r\n  RID_FPRET = RID_F0,\r\n  RID_CFUNCADDR = RID_R25,\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R16,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R18,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R19,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R20,\t\t/* Interpreter L. */\r\n  RID_JGL = RID_R30,\t\t/* On-trace: global_State + 32768. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_RA+1,\r\n  RID_MIN_FPR = RID_F0,\r\n  RID_MAX_FPR = RID_F31+1,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\t/* Only even regs are used. */\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except ZERO, TMP, SP, SYS1, SYS2 and JGL. */\r\n#define RSET_FIXED \\\r\n  (RID2RSET(RID_ZERO)|RID2RSET(RID_TMP)|RID2RSET(RID_SP)|\\\r\n   RID2RSET(RID_SYS1)|RID2RSET(RID_SYS2)|RID2RSET(RID_JGL))\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR) - RSET_FIXED)\r\n#define RSET_FPR \\\r\n  (RID2RSET(RID_F0)|RID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(RID_F6)|\\\r\n   RID2RSET(RID_F8)|RID2RSET(RID_F10)|RID2RSET(RID_F12)|RID2RSET(RID_F14)|\\\r\n   RID2RSET(RID_F16)|RID2RSET(RID_F18)|RID2RSET(RID_F20)|RID2RSET(RID_F22)|\\\r\n   RID2RSET(RID_F24)|RID2RSET(RID_F26)|RID2RSET(RID_F28)|RID2RSET(RID_F30))\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#define RSET_SCRATCH_GPR \\\r\n  (RSET_RANGE(RID_R1, RID_R15+1)|\\\r\n   RID2RSET(RID_R24)|RID2RSET(RID_R25)|RID2RSET(RID_R28))\r\n#define RSET_SCRATCH_FPR \\\r\n  (RID2RSET(RID_F0)|RID2RSET(RID_F2)|RID2RSET(RID_F4)|RID2RSET(RID_F6)|\\\r\n   RID2RSET(RID_F8)|RID2RSET(RID_F10)|RID2RSET(RID_F12)|RID2RSET(RID_F14)|\\\r\n   RID2RSET(RID_F16)|RID2RSET(RID_F18))\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R4\r\n#define REGARG_LASTGPR\t\tRID_R7\r\n#define REGARG_NUMGPR\t\t4\r\n#define REGARG_FIRSTFPR\t\tRID_F12\r\n#define REGARG_LASTFPR\t\tRID_F14\r\n#define REGARG_NUMFPR\t\t2\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use.\r\n*/\r\n#define SPS_FIXED\t5\r\n#define SPS_FIRST\t4\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 1) & ~1)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  int32_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n/* Return the address of a per-trace exit stub. */\r\nstatic LJ_AINLINE uint32_t *exitstub_trace_addr_(uint32_t *p)\r\n{\r\n  while (*p == 0x00000000) p++;  /* Skip MIPSI_NOP. */\r\n  return p;\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_trace_addr(T, exitno) \\\r\n  exitstub_trace_addr_((MCode *)((char *)(T)->mcode + (T)->szmcode))\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define MIPSF_S(r)\t((r) << 21)\r\n#define MIPSF_T(r)\t((r) << 16)\r\n#define MIPSF_D(r)\t((r) << 11)\r\n#define MIPSF_R(r)\t((r) << 21)\r\n#define MIPSF_H(r)\t((r) << 16)\r\n#define MIPSF_G(r)\t((r) << 11)\r\n#define MIPSF_F(r)\t((r) << 6)\r\n#define MIPSF_A(n)\t((n) << 6)\r\n#define MIPSF_M(n)\t((n) << 11)\r\n\r\ntypedef enum MIPSIns {\r\n  /* Integer instructions. */\r\n  MIPSI_MOVE = 0x00000021,\r\n  MIPSI_NOP = 0x00000000,\r\n\r\n  MIPSI_LI = 0x24000000,\r\n  MIPSI_LU = 0x34000000,\r\n  MIPSI_LUI = 0x3c000000,\r\n\r\n  MIPSI_ADDIU = 0x24000000,\r\n  MIPSI_ANDI = 0x30000000,\r\n  MIPSI_ORI = 0x34000000,\r\n  MIPSI_XORI = 0x38000000,\r\n  MIPSI_SLTI = 0x28000000,\r\n  MIPSI_SLTIU = 0x2c000000,\r\n\r\n  MIPSI_ADDU = 0x00000021,\r\n  MIPSI_SUBU = 0x00000023,\r\n  MIPSI_MUL = 0x70000002,\r\n  MIPSI_AND = 0x00000024,\r\n  MIPSI_OR = 0x00000025,\r\n  MIPSI_XOR = 0x00000026,\r\n  MIPSI_NOR = 0x00000027,\r\n  MIPSI_SLT = 0x0000002a,\r\n  MIPSI_SLTU = 0x0000002b,\r\n  MIPSI_MOVZ = 0x0000000a,\r\n  MIPSI_MOVN = 0x0000000b,\r\n  MIPSI_MFHI = 0x00000010,\r\n  MIPSI_MFLO = 0x00000012,\r\n  MIPSI_MULT = 0x00000018,\r\n\r\n  MIPSI_SLL = 0x00000000,\r\n  MIPSI_SRL = 0x00000002,\r\n  MIPSI_SRA = 0x00000003,\r\n  MIPSI_ROTR = 0x00200002,\t/* MIPS32R2 */\r\n  MIPSI_SLLV = 0x00000004,\r\n  MIPSI_SRLV = 0x00000006,\r\n  MIPSI_SRAV = 0x00000007,\r\n  MIPSI_ROTRV = 0x00000046,\t/* MIPS32R2 */\r\n\r\n  MIPSI_SEB = 0x7c000420,\t/* MIPS32R2 */\r\n  MIPSI_SEH = 0x7c000620,\t/* MIPS32R2 */\r\n  MIPSI_WSBH = 0x7c0000a0,\t/* MIPS32R2 */\r\n\r\n  MIPSI_B = 0x10000000,\r\n  MIPSI_J = 0x08000000,\r\n  MIPSI_JAL = 0x0c000000,\r\n  MIPSI_JR = 0x00000008,\r\n  MIPSI_JALR = 0x0000f809,\r\n\r\n  MIPSI_BEQ = 0x10000000,\r\n  MIPSI_BNE = 0x14000000,\r\n  MIPSI_BLEZ = 0x18000000,\r\n  MIPSI_BGTZ = 0x1c000000,\r\n  MIPSI_BLTZ = 0x04000000,\r\n  MIPSI_BGEZ = 0x04010000,\r\n\r\n  /* Load/store instructions. */\r\n  MIPSI_LW = 0x8c000000,\r\n  MIPSI_SW = 0xac000000,\r\n  MIPSI_LB = 0x80000000,\r\n  MIPSI_SB = 0xa0000000,\r\n  MIPSI_LH = 0x84000000,\r\n  MIPSI_SH = 0xa4000000,\r\n  MIPSI_LBU = 0x90000000,\r\n  MIPSI_LHU = 0x94000000,\r\n  MIPSI_LWC1 = 0xc4000000,\r\n  MIPSI_SWC1 = 0xe4000000,\r\n  MIPSI_LDC1 = 0xd4000000,\r\n  MIPSI_SDC1 = 0xf4000000,\r\n\r\n  /* FP instructions. */\r\n  MIPSI_MOV_S = 0x46000006,\r\n  MIPSI_MOV_D = 0x46200006,\r\n  MIPSI_MOVT_D = 0x46210011,\r\n  MIPSI_MOVF_D = 0x46200011,\r\n\r\n  MIPSI_ABS_D = 0x46200005,\r\n  MIPSI_NEG_D = 0x46200007,\r\n\r\n  MIPSI_ADD_D = 0x46200000,\r\n  MIPSI_SUB_D = 0x46200001,\r\n  MIPSI_MUL_D = 0x46200002,\r\n  MIPSI_DIV_D = 0x46200003,\r\n  MIPSI_SQRT_D = 0x46200004,\r\n\r\n  MIPSI_ADD_S = 0x46000000,\r\n  MIPSI_SUB_S = 0x46000001,\r\n\r\n  MIPSI_CVT_D_S = 0x46000021,\r\n  MIPSI_CVT_W_S = 0x46000024,\r\n  MIPSI_CVT_S_D = 0x46200020,\r\n  MIPSI_CVT_W_D = 0x46200024,\r\n  MIPSI_CVT_S_W = 0x46800020,\r\n  MIPSI_CVT_D_W = 0x46800021,\r\n\r\n  MIPSI_TRUNC_W_S = 0x4600000d,\r\n  MIPSI_TRUNC_W_D = 0x4620000d,\r\n  MIPSI_FLOOR_W_S = 0x4600000f,\r\n  MIPSI_FLOOR_W_D = 0x4620000f,\r\n\r\n  MIPSI_MFC1 = 0x44000000,\r\n  MIPSI_MTC1 = 0x44800000,\r\n\r\n  MIPSI_BC1F = 0x45000000,\r\n  MIPSI_BC1T = 0x45010000,\r\n\r\n  MIPSI_C_EQ_D = 0x46200032,\r\n  MIPSI_C_OLT_D = 0x46200034,\r\n  MIPSI_C_ULT_D = 0x46200035,\r\n  MIPSI_C_OLE_D = 0x46200036,\r\n  MIPSI_C_ULE_D = 0x46200037,\r\n\r\n} MIPSIns;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target_ppc.h",
    "content": "/*\r\n** Definitions for PPC CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_PPC_H\r\n#define _LJ_TARGET_PPC_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#define GPRDEF(_) \\\r\n  _(R0) _(SP) _(SYS1) _(R3) _(R4) _(R5) _(R6) _(R7) \\\r\n  _(R8) _(R9) _(R10) _(R11) _(R12) _(SYS2) _(R14) _(R15) \\\r\n  _(R16) _(R17) _(R18) _(R19) _(R20) _(R21) _(R22) _(R23) \\\r\n  _(R24) _(R25) _(R26) _(R27) _(R28) _(R29) _(R30) _(R31)\r\n#define FPRDEF(_) \\\r\n  _(F0) _(F1) _(F2) _(F3) _(F4) _(F5) _(F6) _(F7) \\\r\n  _(F8) _(F9) _(F10) _(F11) _(F12) _(F13) _(F14) _(F15) \\\r\n  _(F16) _(F17) _(F18) _(F19) _(F20) _(F21) _(F22) _(F23) \\\r\n  _(F24) _(F25) _(F26) _(F27) _(F28) _(F29) _(F30) _(F31)\r\n#define VRIDDEF(_)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_TMP = RID_R0,\r\n\r\n  /* Calling conventions. */\r\n  RID_RET = RID_R3,\r\n  RID_RETHI = RID_R3,\r\n  RID_RETLO = RID_R4,\r\n  RID_FPRET = RID_F1,\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_R14,\t\t/* Interpreter BASE. */\r\n  RID_LPC = RID_R16,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R17,\t/* Interpreter DISPATCH table. */\r\n  RID_LREG = RID_R18,\t\t/* Interpreter L. */\r\n  RID_JGL = RID_R31,\t\t/* On-trace: global_State + 32768. */\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_R0,\r\n  RID_MAX_GPR = RID_R31+1,\r\n  RID_MIN_FPR = RID_F0,\r\n  RID_MAX_FPR = RID_F31+1,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR\r\n};\r\n\r\n#define RID_NUM_KREF\t\tRID_NUM_GPR\r\n#define RID_MIN_KREF\t\tRID_R0\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except TMP, SP, SYS1, SYS2 and JGL. */\r\n#define RSET_FIXED \\\r\n  (RID2RSET(RID_TMP)|RID2RSET(RID_SP)|RID2RSET(RID_SYS1)|\\\r\n   RID2RSET(RID_SYS2)|RID2RSET(RID_JGL))\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR) - RSET_FIXED)\r\n#define RSET_FPR\tRSET_RANGE(RID_MIN_FPR, RID_MAX_FPR)\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#define RSET_SCRATCH_GPR\t(RSET_RANGE(RID_R3, RID_R12+1))\r\n#define RSET_SCRATCH_FPR\t(RSET_RANGE(RID_F0, RID_F13+1))\r\n#define RSET_SCRATCH\t\t(RSET_SCRATCH_GPR|RSET_SCRATCH_FPR)\r\n#define REGARG_FIRSTGPR\t\tRID_R3\r\n#define REGARG_LASTGPR\t\tRID_R10\r\n#define REGARG_NUMGPR\t\t8\r\n#define REGARG_FIRSTFPR\t\tRID_F1\r\n#define REGARG_LASTFPR\t\tRID_F8\r\n#define REGARG_NUMFPR\t\t8\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use.\r\n** [sp+12] tmplo word \\\r\n** [sp+ 8] tmphi word / tmp dword, parameter area for callee\r\n** [sp+ 4] tmpw, LR of callee\r\n** [sp+ 0] stack chain\r\n*/\r\n#define SPS_FIXED\t7\r\n#define SPS_FIRST\t4\r\n\r\n/* Stack offsets for temporary slots. Used for FP<->int conversions etc. */\r\n#define SPOFS_TMPW\t4\r\n#define SPOFS_TMP\t8\r\n#define SPOFS_TMPHI\t8\r\n#define SPOFS_TMPLO\t12\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 3) & ~3)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  intptr_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Highest exit + 1 indicates stack check. */\r\n#define EXITSTATE_CHECKEXIT\t1\r\n\r\n/* Return the address of a per-trace exit stub. */\r\nstatic LJ_AINLINE uint32_t *exitstub_trace_addr_(uint32_t *p, uint32_t exitno)\r\n{\r\n  while (*p == 0x60000000) p++;  /* Skip PPCI_NOP. */\r\n  return p + 3 + exitno;\r\n}\r\n/* Avoid dependence on lj_jit.h if only including lj_target.h. */\r\n#define exitstub_trace_addr(T, exitno) \\\r\n  exitstub_trace_addr_((MCode *)((char *)(T)->mcode + (T)->szmcode), (exitno))\r\n\r\n/* -- Instructions -------------------------------------------------------- */\r\n\r\n/* Instruction fields. */\r\n#define PPCF_CC(cc)\t((((cc) & 3) << 16) | (((cc) & 4) << 22))\r\n#define PPCF_T(r)\t((r) << 21)\r\n#define PPCF_A(r)\t((r) << 16)\r\n#define PPCF_B(r)\t((r) << 11)\r\n#define PPCF_C(r)\t((r) << 6)\r\n#define PPCF_MB(n)\t((n) << 6)\r\n#define PPCF_ME(n)\t((n) << 1)\r\n#define PPCF_Y\t\t0x00200000\r\n#define PPCF_DOT\t0x00000001\r\n\r\ntypedef enum PPCIns {\r\n  /* Integer instructions. */\r\n  PPCI_MR = 0x7c000378,\r\n  PPCI_NOP = 0x60000000,\r\n\r\n  PPCI_LI = 0x38000000,\r\n  PPCI_LIS = 0x3c000000,\r\n\r\n  PPCI_ADD = 0x7c000214,\r\n  PPCI_ADDC = 0x7c000014,\r\n  PPCI_ADDO = 0x7c000614,\r\n  PPCI_ADDE = 0x7c000114,\r\n  PPCI_ADDZE = 0x7c000194,\r\n  PPCI_ADDME = 0x7c0001d4,\r\n  PPCI_ADDI = 0x38000000,\r\n  PPCI_ADDIS = 0x3c000000,\r\n  PPCI_ADDIC = 0x30000000,\r\n  PPCI_ADDICDOT = 0x34000000,\r\n\r\n  PPCI_SUBF = 0x7c000050,\r\n  PPCI_SUBFC = 0x7c000010,\r\n  PPCI_SUBFO = 0x7c000450,\r\n  PPCI_SUBFE = 0x7c000110,\r\n  PPCI_SUBFZE = 0x7c000190,\r\n  PPCI_SUBFME = 0x7c0001d0,\r\n  PPCI_SUBFIC = 0x20000000,\r\n\r\n  PPCI_NEG = 0x7c0000d0,\r\n\r\n  PPCI_AND = 0x7c000038,\r\n  PPCI_ANDC = 0x7c000078,\r\n  PPCI_NAND = 0x7c0003b8,\r\n  PPCI_ANDIDOT = 0x70000000,\r\n  PPCI_ANDISDOT = 0x74000000,\r\n\r\n  PPCI_OR = 0x7c000378,\r\n  PPCI_NOR = 0x7c0000f8,\r\n  PPCI_ORI = 0x60000000,\r\n  PPCI_ORIS = 0x64000000,\r\n\r\n  PPCI_XOR = 0x7c000278,\r\n  PPCI_EQV = 0x7c000238,\r\n  PPCI_XORI = 0x68000000,\r\n  PPCI_XORIS = 0x6c000000,\r\n\r\n  PPCI_CMPW = 0x7c000000,\r\n  PPCI_CMPLW = 0x7c000040,\r\n  PPCI_CMPWI = 0x2c000000,\r\n  PPCI_CMPLWI = 0x28000000,\r\n\r\n  PPCI_MULLW = 0x7c0001d6,\r\n  PPCI_MULLI = 0x1c000000,\r\n  PPCI_MULLWO = 0x7c0005d6,\r\n\r\n  PPCI_EXTSB = 0x7c000774,\r\n  PPCI_EXTSH = 0x7c000734,\r\n\r\n  PPCI_SLW = 0x7c000030,\r\n  PPCI_SRW = 0x7c000430,\r\n  PPCI_SRAW = 0x7c000630,\r\n  PPCI_SRAWI = 0x7c000670,\r\n\r\n  PPCI_RLWNM = 0x5c000000,\r\n  PPCI_RLWINM = 0x54000000,\r\n  PPCI_RLWIMI = 0x50000000,\r\n\r\n  PPCI_B = 0x48000000,\r\n  PPCI_BL = 0x48000001,\r\n  PPCI_BC = 0x40800000,\r\n  PPCI_BCL = 0x40800001,\r\n  PPCI_BCTR = 0x4e800420,\r\n  PPCI_BCTRL = 0x4e800421,\r\n\r\n  PPCI_CRANDC = 0x4c000102,\r\n  PPCI_CRXOR = 0x4c000182,\r\n  PPCI_CRAND = 0x4c000202,\r\n  PPCI_CREQV = 0x4c000242,\r\n  PPCI_CRORC = 0x4c000342,\r\n  PPCI_CROR = 0x4c000382,\r\n\r\n  PPCI_MFLR = 0x7c0802a6,\r\n  PPCI_MTCTR = 0x7c0903a6,\r\n\r\n  PPCI_MCRXR = 0x7c000400,\r\n\r\n  /* Load/store instructions. */\r\n  PPCI_LWZ = 0x80000000,\r\n  PPCI_LBZ = 0x88000000,\r\n  PPCI_STW = 0x90000000,\r\n  PPCI_STB = 0x98000000,\r\n  PPCI_LHZ = 0xa0000000,\r\n  PPCI_LHA = 0xa8000000,\r\n  PPCI_STH = 0xb0000000,\r\n\r\n  PPCI_STWU = 0x94000000,\r\n\r\n  PPCI_LFS = 0xc0000000,\r\n  PPCI_LFD = 0xc8000000,\r\n  PPCI_STFS = 0xd0000000,\r\n  PPCI_STFD = 0xd8000000,\r\n\r\n  PPCI_LWZX = 0x7c00002e,\r\n  PPCI_LBZX = 0x7c0000ae,\r\n  PPCI_STWX = 0x7c00012e,\r\n  PPCI_STBX = 0x7c0001ae,\r\n  PPCI_LHZX = 0x7c00022e,\r\n  PPCI_LHAX = 0x7c0002ae,\r\n  PPCI_STHX = 0x7c00032e,\r\n\r\n  PPCI_LWBRX = 0x7c00042c,\r\n  PPCI_STWBRX = 0x7c00052c,\r\n\r\n  PPCI_LFSX = 0x7c00042e,\r\n  PPCI_LFDX = 0x7c0004ae,\r\n  PPCI_STFSX = 0x7c00052e,\r\n  PPCI_STFDX = 0x7c0005ae,\r\n\r\n  /* FP instructions. */\r\n  PPCI_FMR = 0xfc000090,\r\n  PPCI_FNEG = 0xfc000050,\r\n  PPCI_FABS = 0xfc000210,\r\n\r\n  PPCI_FRSP = 0xfc000018,\r\n  PPCI_FCTIWZ = 0xfc00001e,\r\n\r\n  PPCI_FADD = 0xfc00002a,\r\n  PPCI_FSUB = 0xfc000028,\r\n  PPCI_FMUL = 0xfc000032,\r\n  PPCI_FDIV = 0xfc000024,\r\n  PPCI_FSQRT = 0xfc00002c,\r\n\r\n  PPCI_FMADD = 0xfc00003a,\r\n  PPCI_FMSUB = 0xfc000038,\r\n  PPCI_FNMSUB = 0xfc00003c,\r\n\r\n  PPCI_FCMPU = 0xfc000000,\r\n  PPCI_FSEL = 0xfc00002e,\r\n} PPCIns;\r\n\r\ntypedef enum PPCCC {\r\n  CC_GE, CC_LE, CC_NE, CC_NS, CC_LT, CC_GT, CC_EQ, CC_SO\r\n} PPCCC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_target_x86.h",
    "content": "/*\r\n** Definitions for x86 and x64 CPUs.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TARGET_X86_H\r\n#define _LJ_TARGET_X86_H\r\n\r\n/* -- Registers IDs ------------------------------------------------------- */\r\n\r\n#if LJ_64\r\n#define GPRDEF(_) \\\r\n  _(EAX) _(ECX) _(EDX) _(EBX) _(ESP) _(EBP) _(ESI) _(EDI) \\\r\n  _(R8D) _(R9D) _(R10D) _(R11D) _(R12D) _(R13D) _(R14D) _(R15D)\r\n#define FPRDEF(_) \\\r\n  _(XMM0) _(XMM1) _(XMM2) _(XMM3) _(XMM4) _(XMM5) _(XMM6) _(XMM7) \\\r\n  _(XMM8) _(XMM9) _(XMM10) _(XMM11) _(XMM12) _(XMM13) _(XMM14) _(XMM15)\r\n#else\r\n#define GPRDEF(_) \\\r\n  _(EAX) _(ECX) _(EDX) _(EBX) _(ESP) _(EBP) _(ESI) _(EDI)\r\n#define FPRDEF(_) \\\r\n  _(XMM0) _(XMM1) _(XMM2) _(XMM3) _(XMM4) _(XMM5) _(XMM6) _(XMM7)\r\n#endif\r\n#define VRIDDEF(_) \\\r\n  _(MRM)\r\n\r\n#define RIDENUM(name)\tRID_##name,\r\n\r\nenum {\r\n  GPRDEF(RIDENUM)\t\t/* General-purpose registers (GPRs). */\r\n  FPRDEF(RIDENUM)\t\t/* Floating-point registers (FPRs). */\r\n  RID_MAX,\r\n  RID_MRM = RID_MAX,\t\t/* Pseudo-id for ModRM operand. */\r\n\r\n  /* Calling conventions. */\r\n  RID_SP = RID_ESP,\r\n  RID_RET = RID_EAX,\r\n#if LJ_64\r\n  RID_FPRET = RID_XMM0,\r\n#else\r\n  RID_RETLO = RID_EAX,\r\n  RID_RETHI = RID_EDX,\r\n#endif\r\n\r\n  /* These definitions must match with the *.dasc file(s): */\r\n  RID_BASE = RID_EDX,\t\t/* Interpreter BASE. */\r\n#if LJ_64 && !LJ_ABI_WIN\r\n  RID_LPC = RID_EBX,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_R14D,\t/* Interpreter DISPATCH table. */\r\n#else\r\n  RID_LPC = RID_ESI,\t\t/* Interpreter PC. */\r\n  RID_DISPATCH = RID_EBX,\t/* Interpreter DISPATCH table. */\r\n#endif\r\n\r\n  /* Register ranges [min, max) and number of registers. */\r\n  RID_MIN_GPR = RID_EAX,\r\n  RID_MIN_FPR = RID_XMM0,\r\n  RID_MAX_GPR = RID_MIN_FPR,\r\n  RID_MAX_FPR = RID_MAX,\r\n  RID_NUM_GPR = RID_MAX_GPR - RID_MIN_GPR,\r\n  RID_NUM_FPR = RID_MAX_FPR - RID_MIN_FPR,\r\n};\r\n\r\n/* -- Register sets ------------------------------------------------------- */\r\n\r\n/* Make use of all registers, except the stack pointer. */\r\n#define RSET_GPR\t(RSET_RANGE(RID_MIN_GPR, RID_MAX_GPR)-RID2RSET(RID_ESP))\r\n#define RSET_FPR\t(RSET_RANGE(RID_MIN_FPR, RID_MAX_FPR))\r\n#define RSET_ALL\t(RSET_GPR|RSET_FPR)\r\n#define RSET_INIT\tRSET_ALL\r\n\r\n#if LJ_64\r\n/* Note: this requires the use of FORCE_REX! */\r\n#define RSET_GPR8\tRSET_GPR\r\n#else\r\n#define RSET_GPR8\t(RSET_RANGE(RID_EAX, RID_EBX+1))\r\n#endif\r\n\r\n/* ABI-specific register sets. */\r\n#define RSET_ACD\t(RID2RSET(RID_EAX)|RID2RSET(RID_ECX)|RID2RSET(RID_EDX))\r\n#if LJ_64\r\n#if LJ_ABI_WIN\r\n/* Windows x64 ABI. */\r\n#define RSET_SCRATCH \\\r\n  (RSET_ACD|RSET_RANGE(RID_R8D, RID_R11D+1)|RSET_RANGE(RID_XMM0, RID_XMM5+1))\r\n#define REGARG_GPRS \\\r\n  (RID_ECX|((RID_EDX|((RID_R8D|(RID_R9D<<5))<<5))<<5))\r\n#define REGARG_NUMGPR\t4\r\n#define REGARG_NUMFPR\t4\r\n#define REGARG_FIRSTFPR\tRID_XMM0\r\n#define REGARG_LASTFPR\tRID_XMM3\r\n#define STACKARG_OFS\t(4*8)\r\n#else\r\n/* The rest of the civilized x64 world has a common ABI. */\r\n#define RSET_SCRATCH \\\r\n  (RSET_ACD|RSET_RANGE(RID_ESI, RID_R11D+1)|RSET_FPR)\r\n#define REGARG_GPRS \\\r\n  (RID_EDI|((RID_ESI|((RID_EDX|((RID_ECX|((RID_R8D|(RID_R9D \\\r\n   <<5))<<5))<<5))<<5))<<5))\r\n#define REGARG_NUMGPR\t6\r\n#define REGARG_NUMFPR\t8\r\n#define REGARG_FIRSTFPR\tRID_XMM0\r\n#define REGARG_LASTFPR\tRID_XMM7\r\n#define STACKARG_OFS\t0\r\n#endif\r\n#else\r\n/* Common x86 ABI. */\r\n#define RSET_SCRATCH\t(RSET_ACD|RSET_FPR)\r\n#define REGARG_GPRS\t(RID_ECX|(RID_EDX<<5))  /* Fastcall only. */\r\n#define REGARG_NUMGPR\t2  /* Fastcall only. */\r\n#define REGARG_NUMFPR\t0\r\n#define STACKARG_OFS\t0\r\n#endif\r\n\r\n#if LJ_64\r\n/* Prefer the low 8 regs of each type to reduce REX prefixes. */\r\n#undef rset_picktop\r\n#define rset_picktop(rs)\t(lj_fls(lj_bswap(rs)) ^ 0x18)\r\n#endif\r\n\r\n/* -- Spill slots --------------------------------------------------------- */\r\n\r\n/* Spill slots are 32 bit wide. An even/odd pair is used for FPRs.\r\n**\r\n** SPS_FIXED: Available fixed spill slots in interpreter frame.\r\n** This definition must match with the *.dasc file(s).\r\n**\r\n** SPS_FIRST: First spill slot for general use. Reserve min. two 32 bit slots.\r\n*/\r\n#if LJ_64\r\n#if LJ_ABI_WIN\r\n#define SPS_FIXED\t(4*2)\r\n#define SPS_FIRST\t(4*2)\t/* Don't use callee register save area. */\r\n#else\r\n#if LJ_GC64\r\n#define SPS_FIXED\t2\r\n#else\r\n#define SPS_FIXED\t4\r\n#endif\r\n#define SPS_FIRST\t2\r\n#endif\r\n#else\r\n#define SPS_FIXED\t6\r\n#define SPS_FIRST\t2\r\n#endif\r\n\r\n#define SPOFS_TMP\t0\r\n\r\n#define sps_scale(slot)\t\t(4 * (int32_t)(slot))\r\n#define sps_align(slot)\t\t(((slot) - SPS_FIXED + 3) & ~3)\r\n\r\n/* -- Exit state ---------------------------------------------------------- */\r\n\r\n/* This definition must match with the *.dasc file(s). */\r\ntypedef struct {\r\n  lua_Number fpr[RID_NUM_FPR];\t/* Floating-point registers. */\r\n  intptr_t gpr[RID_NUM_GPR];\t/* General-purpose registers. */\r\n  int32_t spill[256];\t\t/* Spill slots. */\r\n} ExitState;\r\n\r\n/* Limited by the range of a short fwd jump (127): (2+2)*(32-1)-2 = 122. */\r\n#define EXITSTUB_SPACING\t(2+2)\r\n#define EXITSTUBS_PER_GROUP\t32\r\n\r\n/* -- x86 ModRM operand encoding ------------------------------------------ */\r\n\r\ntypedef enum {\r\n  XM_OFS0 = 0x00, XM_OFS8 = 0x40, XM_OFS32 = 0x80, XM_REG = 0xc0,\r\n  XM_SCALE1 = 0x00, XM_SCALE2 = 0x40, XM_SCALE4 = 0x80, XM_SCALE8 = 0xc0,\r\n  XM_MASK = 0xc0\r\n} x86Mode;\r\n\r\n/* Structure to hold variable ModRM operand. */\r\ntypedef struct {\r\n  int32_t ofs;\t\t/* Offset. */\r\n  uint8_t base;\t\t/* Base register or RID_NONE. */\r\n  uint8_t idx;\t\t/* Index register or RID_NONE. */\r\n  uint8_t scale;\t/* Index scale (XM_SCALE1 .. XM_SCALE8). */\r\n} x86ModRM;\r\n\r\n/* -- Opcodes ------------------------------------------------------------- */\r\n\r\n/* Macros to construct variable-length x86 opcodes. -(len+1) is in LSB. */\r\n#define XO_(o)\t\t((uint32_t)(0x0000fe + (0x##o<<24)))\r\n#define XO_FPU(a,b)\t((uint32_t)(0x00fd + (0x##a<<16)+(0x##b<<24)))\r\n#define XO_0f(o)\t((uint32_t)(0x0f00fd + (0x##o<<24)))\r\n#define XO_66(o)\t((uint32_t)(0x6600fd + (0x##o<<24)))\r\n#define XO_660f(o)\t((uint32_t)(0x0f66fc + (0x##o<<24)))\r\n#define XO_f20f(o)\t((uint32_t)(0x0ff2fc + (0x##o<<24)))\r\n#define XO_f30f(o)\t((uint32_t)(0x0ff3fc + (0x##o<<24)))\r\n\r\n/* This list of x86 opcodes is not intended to be complete. Opcodes are only\r\n** included when needed. Take a look at DynASM or jit.dis_x86 to see the\r\n** whole mess.\r\n*/\r\ntypedef enum {\r\n  /* Fixed length opcodes. XI_* prefix. */\r\n  XI_NOP =\t0x90,\r\n  XI_XCHGa =\t0x90,\r\n  XI_CALL =\t0xe8,\r\n  XI_JMP =\t0xe9,\r\n  XI_JMPs =\t0xeb,\r\n  XI_PUSH =\t0x50, /* Really 50+r. */\r\n  XI_JCCs =\t0x70, /* Really 7x. */\r\n  XI_JCCn =\t0x80, /* Really 0f8x. */\r\n  XI_LEA =\t0x8d,\r\n  XI_MOVrib =\t0xb0, /* Really b0+r. */\r\n  XI_MOVri =\t0xb8, /* Really b8+r. */\r\n  XI_ARITHib =\t0x80,\r\n  XI_ARITHi =\t0x81,\r\n  XI_ARITHi8 =\t0x83,\r\n  XI_PUSHi8 =\t0x6a,\r\n  XI_TESTb =\t0x84,\r\n  XI_TEST =\t0x85,\r\n  XI_MOVmi =\t0xc7,\r\n  XI_GROUP5 =\t0xff,\r\n\r\n  /* Note: little-endian byte-order! */\r\n  XI_FLDZ =\t0xeed9,\r\n  XI_FLD1 =\t0xe8d9,\r\n  XI_FLDLG2 =\t0xecd9,\r\n  XI_FLDLN2 =\t0xedd9,\r\n  XI_FDUP =\t0xc0d9,  /* Really fld st0. */\r\n  XI_FPOP =\t0xd8dd,  /* Really fstp st0. */\r\n  XI_FPOP1 =\t0xd9dd,  /* Really fstp st1. */\r\n  XI_FRNDINT =\t0xfcd9,\r\n  XI_FSIN =\t0xfed9,\r\n  XI_FCOS =\t0xffd9,\r\n  XI_FPTAN =\t0xf2d9,\r\n  XI_FPATAN =\t0xf3d9,\r\n  XI_FSCALE =\t0xfdd9,\r\n  XI_FYL2X =\t0xf1d9,\r\n\r\n  /* Variable-length opcodes. XO_* prefix. */\r\n  XO_MOV =\tXO_(8b),\r\n  XO_MOVto =\tXO_(89),\r\n  XO_MOVtow =\tXO_66(89),\r\n  XO_MOVtob =\tXO_(88),\r\n  XO_MOVmi =\tXO_(c7),\r\n  XO_MOVmib =\tXO_(c6),\r\n  XO_LEA =\tXO_(8d),\r\n  XO_ARITHib =\tXO_(80),\r\n  XO_ARITHi =\tXO_(81),\r\n  XO_ARITHi8 =\tXO_(83),\r\n  XO_ARITHiw8 =\tXO_66(83),\r\n  XO_SHIFTi =\tXO_(c1),\r\n  XO_SHIFT1 =\tXO_(d1),\r\n  XO_SHIFTcl =\tXO_(d3),\r\n  XO_IMUL =\tXO_0f(af),\r\n  XO_IMULi =\tXO_(69),\r\n  XO_IMULi8 =\tXO_(6b),\r\n  XO_CMP =\tXO_(3b),\r\n  XO_TESTb =\tXO_(84),\r\n  XO_TEST =\tXO_(85),\r\n  XO_GROUP3b =\tXO_(f6),\r\n  XO_GROUP3 =\tXO_(f7),\r\n  XO_GROUP5b =\tXO_(fe),\r\n  XO_GROUP5 =\tXO_(ff),\r\n  XO_MOVZXb =\tXO_0f(b6),\r\n  XO_MOVZXw =\tXO_0f(b7),\r\n  XO_MOVSXb =\tXO_0f(be),\r\n  XO_MOVSXw =\tXO_0f(bf),\r\n  XO_MOVSXd =\tXO_(63),\r\n  XO_BSWAP =\tXO_0f(c8),\r\n  XO_CMOV =\tXO_0f(40),\r\n\r\n  XO_MOVSD =\tXO_f20f(10),\r\n  XO_MOVSDto =\tXO_f20f(11),\r\n  XO_MOVSS =\tXO_f30f(10),\r\n  XO_MOVSSto =\tXO_f30f(11),\r\n  XO_MOVLPD =\tXO_660f(12),\r\n  XO_MOVAPS =\tXO_0f(28),\r\n  XO_XORPS =\tXO_0f(57),\r\n  XO_ANDPS =\tXO_0f(54),\r\n  XO_ADDSD =\tXO_f20f(58),\r\n  XO_SUBSD =\tXO_f20f(5c),\r\n  XO_MULSD =\tXO_f20f(59),\r\n  XO_DIVSD =\tXO_f20f(5e),\r\n  XO_SQRTSD =\tXO_f20f(51),\r\n  XO_MINSD =\tXO_f20f(5d),\r\n  XO_MAXSD =\tXO_f20f(5f),\r\n  XO_ROUNDSD =\t0x0b3a0ffc,  /* Really 66 0f 3a 0b. See asm_fpmath. */\r\n  XO_UCOMISD =\tXO_660f(2e),\r\n  XO_CVTSI2SD =\tXO_f20f(2a),\r\n  XO_CVTTSD2SI=\tXO_f20f(2c),\r\n  XO_CVTSI2SS =\tXO_f30f(2a),\r\n  XO_CVTTSS2SI=\tXO_f30f(2c),\r\n  XO_CVTSS2SD =\tXO_f30f(5a),\r\n  XO_CVTSD2SS =\tXO_f20f(5a),\r\n  XO_ADDSS =\tXO_f30f(58),\r\n  XO_MOVD =\tXO_660f(6e),\r\n  XO_MOVDto =\tXO_660f(7e),\r\n\r\n  XO_FLDd =\tXO_(d9), XOg_FLDd = 0,\r\n  XO_FLDq =\tXO_(dd), XOg_FLDq = 0,\r\n  XO_FILDd =\tXO_(db), XOg_FILDd = 0,\r\n  XO_FILDq =\tXO_(df), XOg_FILDq = 5,\r\n  XO_FSTPd =\tXO_(d9), XOg_FSTPd = 3,\r\n  XO_FSTPq =\tXO_(dd), XOg_FSTPq = 3,\r\n  XO_FISTPq =\tXO_(df), XOg_FISTPq = 7,\r\n  XO_FISTTPq =\tXO_(dd), XOg_FISTTPq = 1,\r\n  XO_FADDq =\tXO_(dc), XOg_FADDq = 0,\r\n  XO_FLDCW =\tXO_(d9), XOg_FLDCW = 5,\r\n  XO_FNSTCW =\tXO_(d9), XOg_FNSTCW = 7\r\n} x86Op;\r\n\r\n/* x86 opcode groups. */\r\ntypedef uint32_t x86Group;\r\n\r\n#define XG_(i8, i, g)\t((x86Group)(((i8) << 16) + ((i) << 8) + (g)))\r\n#define XG_ARITHi(g)\tXG_(XI_ARITHi8, XI_ARITHi, g)\r\n#define XG_TOXOi(xg)\t((x86Op)(0x000000fe + (((xg)<<16) & 0xff000000)))\r\n#define XG_TOXOi8(xg)\t((x86Op)(0x000000fe + (((xg)<<8) & 0xff000000)))\r\n\r\n#define XO_ARITH(a)\t((x86Op)(0x030000fe + ((a)<<27)))\r\n#define XO_ARITHw(a)\t((x86Op)(0x036600fd + ((a)<<27)))\r\n\r\ntypedef enum {\r\n  XOg_ADD, XOg_OR, XOg_ADC, XOg_SBB, XOg_AND, XOg_SUB, XOg_XOR, XOg_CMP,\r\n  XOg_X_IMUL\r\n} x86Arith;\r\n\r\ntypedef enum {\r\n  XOg_ROL, XOg_ROR, XOg_RCL, XOg_RCR, XOg_SHL, XOg_SHR, XOg_SAL, XOg_SAR\r\n} x86Shift;\r\n\r\ntypedef enum {\r\n  XOg_TEST, XOg_TEST_, XOg_NOT, XOg_NEG, XOg_MUL, XOg_IMUL, XOg_DIV, XOg_IDIV\r\n} x86Group3;\r\n\r\ntypedef enum {\r\n  XOg_INC, XOg_DEC, XOg_CALL, XOg_CALLfar, XOg_JMP, XOg_JMPfar, XOg_PUSH\r\n} x86Group5;\r\n\r\n/* x86 condition codes. */\r\ntypedef enum {\r\n  CC_O, CC_NO, CC_B, CC_NB, CC_E, CC_NE, CC_BE, CC_NBE,\r\n  CC_S, CC_NS, CC_P, CC_NP, CC_L, CC_NL, CC_LE, CC_NLE,\r\n  CC_C = CC_B, CC_NAE = CC_C, CC_NC = CC_NB, CC_AE = CC_NB,\r\n  CC_Z = CC_E, CC_NZ = CC_NE, CC_NA = CC_BE, CC_A = CC_NBE,\r\n  CC_PE = CC_P, CC_PO = CC_NP, CC_NGE = CC_L, CC_GE = CC_NL,\r\n  CC_NG = CC_LE, CC_G = CC_NLE\r\n} x86CC;\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_trace.c",
    "content": "/*\r\n** Trace management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_trace_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n\r\n#include \"lj_gc.h\"\r\n#include \"lj_err.h\"\r\n#include \"lj_debug.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_frame.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_bc.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_jit.h\"\r\n#include \"lj_iropt.h\"\r\n#include \"lj_mcode.h\"\r\n#include \"lj_trace.h\"\r\n#include \"lj_snap.h\"\r\n#include \"lj_gdbjit.h\"\r\n#include \"lj_record.h\"\r\n#include \"lj_asm.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n#include \"lj_target.h\"\r\n\r\n/* -- Error handling ------------------------------------------------------ */\r\n\r\n/* Synchronous abort with error message. */\r\nvoid lj_trace_err(jit_State *J, TraceError e)\r\n{\r\n  setnilV(&J->errinfo);  /* No error info. */\r\n  setintV(J->L->top++, (int32_t)e);\r\n  lj_err_throw(J->L, LUA_ERRRUN);\r\n}\r\n\r\n/* Synchronous abort with error message and error info. */\r\nvoid lj_trace_err_info(jit_State *J, TraceError e)\r\n{\r\n  setintV(J->L->top++, (int32_t)e);\r\n  lj_err_throw(J->L, LUA_ERRRUN);\r\n}\r\n\r\n/* -- Trace management ---------------------------------------------------- */\r\n\r\n/* The current trace is first assembled in J->cur. The variable length\r\n** arrays point to shared, growable buffers (J->irbuf etc.). When trace\r\n** recording ends successfully, the current trace and its data structures\r\n** are copied to a new (compact) GCtrace object.\r\n*/\r\n\r\n/* Find a free trace number. */\r\nstatic TraceNo trace_findfree(jit_State *J)\r\n{\r\n  MSize osz, lim;\r\n  if (J->freetrace == 0)\r\n    J->freetrace = 1;\r\n  for (; J->freetrace < J->sizetrace; J->freetrace++)\r\n    if (traceref(J, J->freetrace) == NULL)\r\n      return J->freetrace++;\r\n  /* Need to grow trace array. */\r\n  lim = (MSize)J->param[JIT_P_maxtrace] + 1;\r\n  if (lim < 2) lim = 2; else if (lim > 65535) lim = 65535;\r\n  osz = J->sizetrace;\r\n  if (osz >= lim)\r\n    return 0;  /* Too many traces. */\r\n  lj_mem_growvec(J->L, J->trace, J->sizetrace, lim, GCRef);\r\n  for (; osz < J->sizetrace; osz++)\r\n    setgcrefnull(J->trace[osz]);\r\n  return J->freetrace;\r\n}\r\n\r\n#define TRACE_APPENDVEC(field, szfield, tp) \\\r\n  T->field = (tp *)p; \\\r\n  memcpy(p, J->cur.field, J->cur.szfield*sizeof(tp)); \\\r\n  p += J->cur.szfield*sizeof(tp);\r\n\r\n#ifdef LUAJIT_USE_PERFTOOLS\r\n/*\r\n** Create symbol table of JIT-compiled code. For use with Linux perf tools.\r\n** Example usage:\r\n**   perf record -f -e cycles luajit test.lua\r\n**   perf report -s symbol\r\n**   rm perf.data /tmp/perf-*.map\r\n*/\r\n#include <stdio.h>\r\n#include <unistd.h>\r\n\r\nstatic void perftools_addtrace(GCtrace *T)\r\n{\r\n  static FILE *fp;\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  const BCIns *startpc = mref(T->startpc, const BCIns);\r\n  const char *name = proto_chunknamestr(pt);\r\n  BCLine lineno;\r\n  if (name[0] == '@' || name[0] == '=')\r\n    name++;\r\n  else\r\n    name = \"(string)\";\r\n  lua_assert(startpc >= proto_bc(pt) && startpc < proto_bc(pt) + pt->sizebc);\r\n  lineno = lj_debug_line(pt, proto_bcpos(pt, startpc));\r\n  if (!fp) {\r\n    char fname[40];\r\n    sprintf(fname, \"/tmp/perf-%d.map\", getpid());\r\n    if (!(fp = fopen(fname, \"w\"))) return;\r\n    setlinebuf(fp);\r\n  }\r\n  fprintf(fp, \"%lx %x TRACE_%d::%s:%u\\n\",\r\n\t  (long)T->mcode, T->szmcode, T->traceno, name, lineno);\r\n}\r\n#endif\r\n\r\n/* Allocate space for copy of trace. */\r\nstatic GCtrace *trace_save_alloc(jit_State *J)\r\n{\r\n  size_t sztr = ((sizeof(GCtrace)+7)&~7);\r\n  size_t szins = (J->cur.nins-J->cur.nk)*sizeof(IRIns);\r\n  size_t sz = sztr + szins +\r\n\t      J->cur.nsnap*sizeof(SnapShot) +\r\n\t      J->cur.nsnapmap*sizeof(SnapEntry);\r\n  return lj_mem_newt(J->L, (MSize)sz, GCtrace);\r\n}\r\n\r\n/* Save current trace by copying and compacting it. */\r\nstatic void trace_save(jit_State *J, GCtrace *T)\r\n{\r\n  size_t sztr = ((sizeof(GCtrace)+7)&~7);\r\n  size_t szins = (J->cur.nins-J->cur.nk)*sizeof(IRIns);\r\n  char *p = (char *)T + sztr;\r\n  memcpy(T, &J->cur, sizeof(GCtrace));\r\n  setgcrefr(T->nextgc, J2G(J)->gc.root);\r\n  setgcrefp(J2G(J)->gc.root, T);\r\n  newwhite(J2G(J), T);\r\n  T->gct = ~LJ_TTRACE;\r\n  T->ir = (IRIns *)p - J->cur.nk;\r\n  memcpy(p, J->cur.ir+J->cur.nk, szins);\r\n  p += szins;\r\n  TRACE_APPENDVEC(snap, nsnap, SnapShot)\r\n  TRACE_APPENDVEC(snapmap, nsnapmap, SnapEntry)\r\n  J->cur.traceno = 0;\r\n  setgcrefp(J->trace[T->traceno], T);\r\n  lj_gc_barriertrace(J2G(J), T->traceno);\r\n  lj_gdbjit_addtrace(J, T);\r\n#ifdef LUAJIT_USE_PERFTOOLS\r\n  perftools_addtrace(T);\r\n#endif\r\n}\r\n\r\nvoid LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T)\r\n{\r\n  jit_State *J = G2J(g);\r\n  if (T->traceno) {\r\n    lj_gdbjit_deltrace(J, T);\r\n    if (T->traceno < J->freetrace)\r\n      J->freetrace = T->traceno;\r\n    setgcrefnull(J->trace[T->traceno]);\r\n  }\r\n  lj_mem_free(g, T,\r\n    ((sizeof(GCtrace)+7)&~7) + (T->nins-T->nk)*sizeof(IRIns) +\r\n    T->nsnap*sizeof(SnapShot) + T->nsnapmap*sizeof(SnapEntry));\r\n}\r\n\r\n/* Re-enable compiling a prototype by unpatching any modified bytecode. */\r\nvoid lj_trace_reenableproto(GCproto *pt)\r\n{\r\n  if ((pt->flags & PROTO_ILOOP)) {\r\n    BCIns *bc = proto_bc(pt);\r\n    BCPos i, sizebc = pt->sizebc;;\r\n    pt->flags &= ~PROTO_ILOOP;\r\n    if (bc_op(bc[0]) == BC_IFUNCF)\r\n      setbc_op(&bc[0], BC_FUNCF);\r\n    for (i = 1; i < sizebc; i++) {\r\n      BCOp op = bc_op(bc[i]);\r\n      if (op == BC_IFORL || op == BC_IITERL || op == BC_ILOOP)\r\n\tsetbc_op(&bc[i], (int)op+(int)BC_LOOP-(int)BC_ILOOP);\r\n    }\r\n  }\r\n}\r\n\r\n/* Unpatch the bytecode modified by a root trace. */\r\nstatic void trace_unpatch(jit_State *J, GCtrace *T)\r\n{\r\n  BCOp op = bc_op(T->startins);\r\n  BCIns *pc = mref(T->startpc, BCIns);\r\n  UNUSED(J);\r\n  if (op == BC_JMP)\r\n    return;  /* No need to unpatch branches in parent traces (yet). */\r\n  switch (bc_op(*pc)) {\r\n  case BC_JFORL:\r\n    lua_assert(traceref(J, bc_d(*pc)) == T);\r\n    *pc = T->startins;\r\n    pc += bc_j(T->startins);\r\n    lua_assert(bc_op(*pc) == BC_JFORI);\r\n    setbc_op(pc, BC_FORI);\r\n    break;\r\n  case BC_JITERL:\r\n  case BC_JLOOP:\r\n    lua_assert(op == BC_ITERL || op == BC_LOOP || bc_isret(op));\r\n    *pc = T->startins;\r\n    break;\r\n  case BC_JMP:\r\n    lua_assert(op == BC_ITERL);\r\n    pc += bc_j(*pc)+2;\r\n    if (bc_op(*pc) == BC_JITERL) {\r\n      lua_assert(traceref(J, bc_d(*pc)) == T);\r\n      *pc = T->startins;\r\n    }\r\n    break;\r\n  case BC_JFUNCF:\r\n    lua_assert(op == BC_FUNCF);\r\n    *pc = T->startins;\r\n    break;\r\n  default:  /* Already unpatched. */\r\n    break;\r\n  }\r\n}\r\n\r\n/* Flush a root trace. */\r\nstatic void trace_flushroot(jit_State *J, GCtrace *T)\r\n{\r\n  GCproto *pt = &gcref(T->startpt)->pt;\r\n  lua_assert(T->root == 0 && pt != NULL);\r\n  /* First unpatch any modified bytecode. */\r\n  trace_unpatch(J, T);\r\n  /* Unlink root trace from chain anchored in prototype. */\r\n  if (pt->trace == T->traceno) {  /* Trace is first in chain. Easy. */\r\n    pt->trace = T->nextroot;\r\n  } else if (pt->trace) {  /* Otherwise search in chain of root traces. */\r\n    GCtrace *T2 = traceref(J, pt->trace);\r\n    if (T2) {\r\n      for (; T2->nextroot; T2 = traceref(J, T2->nextroot))\r\n\tif (T2->nextroot == T->traceno) {\r\n\t  T2->nextroot = T->nextroot;  /* Unlink from chain. */\r\n\t  break;\r\n\t}\r\n    }\r\n  }\r\n}\r\n\r\n/* Flush a trace. Only root traces are considered. */\r\nvoid lj_trace_flush(jit_State *J, TraceNo traceno)\r\n{\r\n  if (traceno > 0 && traceno < J->sizetrace) {\r\n    GCtrace *T = traceref(J, traceno);\r\n    if (T && T->root == 0)\r\n      trace_flushroot(J, T);\r\n  }\r\n}\r\n\r\n/* Flush all traces associated with a prototype. */\r\nvoid lj_trace_flushproto(global_State *g, GCproto *pt)\r\n{\r\n  while (pt->trace != 0)\r\n    trace_flushroot(G2J(g), traceref(G2J(g), pt->trace));\r\n}\r\n\r\n/* Flush all traces. */\r\nint lj_trace_flushall(lua_State *L)\r\n{\r\n  jit_State *J = L2J(L);\r\n  ptrdiff_t i;\r\n  if ((J2G(J)->hookmask & HOOK_GC))\r\n    return 1;\r\n  for (i = (ptrdiff_t)J->sizetrace-1; i > 0; i--) {\r\n    GCtrace *T = traceref(J, i);\r\n    if (T) {\r\n      if (T->root == 0)\r\n\ttrace_flushroot(J, T);\r\n      lj_gdbjit_deltrace(J, T);\r\n      T->traceno = 0;\r\n      setgcrefnull(J->trace[i]);\r\n    }\r\n  }\r\n  J->cur.traceno = 0;\r\n  J->freetrace = 0;\r\n  /* Clear penalty cache. */\r\n  memset(J->penalty, 0, sizeof(J->penalty));\r\n  /* Free the whole machine code and invalidate all exit stub groups. */\r\n  lj_mcode_free(J);\r\n  memset(J->exitstubgroup, 0, sizeof(J->exitstubgroup));\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"flush\"));\r\n  );\r\n  return 0;\r\n}\r\n\r\n/* Initialize JIT compiler state. */\r\nvoid lj_trace_initstate(global_State *g)\r\n{\r\n  jit_State *J = G2J(g);\r\n  TValue *tv;\r\n  /* Initialize SIMD constants. */\r\n  tv = LJ_KSIMD(J, LJ_KSIMD_ABS);\r\n  tv[0].u64 = U64x(7fffffff,ffffffff);\r\n  tv[1].u64 = U64x(7fffffff,ffffffff);\r\n  tv = LJ_KSIMD(J, LJ_KSIMD_NEG);\r\n  tv[0].u64 = U64x(80000000,00000000);\r\n  tv[1].u64 = U64x(80000000,00000000);\r\n}\r\n\r\n/* Free everything associated with the JIT compiler state. */\r\nvoid lj_trace_freestate(global_State *g)\r\n{\r\n  jit_State *J = G2J(g);\r\n#ifdef LUA_USE_ASSERT\r\n  {  /* This assumes all traces have already been freed. */\r\n    ptrdiff_t i;\r\n    for (i = 1; i < (ptrdiff_t)J->sizetrace; i++)\r\n      lua_assert(i == (ptrdiff_t)J->cur.traceno || traceref(J, i) == NULL);\r\n  }\r\n#endif\r\n  lj_mcode_free(J);\r\n  lj_ir_k64_freeall(J);\r\n  lj_mem_freevec(g, J->snapmapbuf, J->sizesnapmap, SnapEntry);\r\n  lj_mem_freevec(g, J->snapbuf, J->sizesnap, SnapShot);\r\n  lj_mem_freevec(g, J->irbuf + J->irbotlim, J->irtoplim - J->irbotlim, IRIns);\r\n  lj_mem_freevec(g, J->trace, J->sizetrace, GCRef);\r\n}\r\n\r\n/* -- Penalties and blacklisting ------------------------------------------ */\r\n\r\n/* Blacklist a bytecode instruction. */\r\nstatic void blacklist_pc(GCproto *pt, BCIns *pc)\r\n{\r\n  setbc_op(pc, (int)bc_op(*pc)+(int)BC_ILOOP-(int)BC_LOOP);\r\n  pt->flags |= PROTO_ILOOP;\r\n}\r\n\r\n/* Penalize a bytecode instruction. */\r\nstatic void penalty_pc(jit_State *J, GCproto *pt, BCIns *pc, TraceError e)\r\n{\r\n  uint32_t i, val = PENALTY_MIN;\r\n  for (i = 0; i < PENALTY_SLOTS; i++)\r\n    if (mref(J->penalty[i].pc, const BCIns) == pc) {  /* Cache slot found? */\r\n      /* First try to bump its hotcount several times. */\r\n      val = ((uint32_t)J->penalty[i].val << 1) +\r\n\t    LJ_PRNG_BITS(J, PENALTY_RNDBITS);\r\n      if (val > PENALTY_MAX) {\r\n\tblacklist_pc(pt, pc);  /* Blacklist it, if that didn't help. */\r\n\treturn;\r\n      }\r\n      goto setpenalty;\r\n    }\r\n  /* Assign a new penalty cache slot. */\r\n  i = J->penaltyslot;\r\n  J->penaltyslot = (J->penaltyslot + 1) & (PENALTY_SLOTS-1);\r\n  setmref(J->penalty[i].pc, pc);\r\nsetpenalty:\r\n  J->penalty[i].val = (uint16_t)val;\r\n  J->penalty[i].reason = e;\r\n  hotcount_set(J2GG(J), pc+1, val);\r\n}\r\n\r\n/* -- Trace compiler state machine ---------------------------------------- */\r\n\r\n/* Start tracing. */\r\nstatic void trace_start(jit_State *J)\r\n{\r\n  lua_State *L;\r\n  TraceNo traceno;\r\n\r\n  if ((J->pt->flags & PROTO_NOJIT)) {  /* JIT disabled for this proto? */\r\n    if (J->parent == 0 && J->exitno == 0) {\r\n      /* Lazy bytecode patching to disable hotcount events. */\r\n      lua_assert(bc_op(*J->pc) == BC_FORL || bc_op(*J->pc) == BC_ITERL ||\r\n\t\t bc_op(*J->pc) == BC_LOOP || bc_op(*J->pc) == BC_FUNCF);\r\n      setbc_op(J->pc, (int)bc_op(*J->pc)+(int)BC_ILOOP-(int)BC_LOOP);\r\n      J->pt->flags |= PROTO_ILOOP;\r\n    }\r\n    J->state = LJ_TRACE_IDLE;  /* Silently ignored. */\r\n    return;\r\n  }\r\n\r\n  /* Get a new trace number. */\r\n  traceno = trace_findfree(J);\r\n  if (LJ_UNLIKELY(traceno == 0)) {  /* No free trace? */\r\n    lua_assert((J2G(J)->hookmask & HOOK_GC) == 0);\r\n    lj_trace_flushall(J->L);\r\n    J->state = LJ_TRACE_IDLE;  /* Silently ignored. */\r\n    return;\r\n  }\r\n  setgcrefp(J->trace[traceno], &J->cur);\r\n\r\n  /* Setup enough of the current trace to be able to send the vmevent. */\r\n  memset(&J->cur, 0, sizeof(GCtrace));\r\n  J->cur.traceno = traceno;\r\n  J->cur.nins = J->cur.nk = REF_BASE;\r\n  J->cur.ir = J->irbuf;\r\n  J->cur.snap = J->snapbuf;\r\n  J->cur.snapmap = J->snapmapbuf;\r\n  J->mergesnap = 0;\r\n  J->needsnap = 0;\r\n  J->bcskip = 0;\r\n  J->guardemit.irt = 0;\r\n  J->postproc = LJ_POST_NONE;\r\n  lj_resetsplit(J);\r\n  J->retryrec = 0;\r\n  setgcref(J->cur.startpt, obj2gco(J->pt));\r\n\r\n  L = J->L;\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"start\"));\r\n    setintV(L->top++, traceno);\r\n    setfuncV(L, L->top++, J->fn);\r\n    setintV(L->top++, proto_bcpos(J->pt, J->pc));\r\n    if (J->parent) {\r\n      setintV(L->top++, J->parent);\r\n      setintV(L->top++, J->exitno);\r\n    }\r\n  );\r\n  lj_record_setup(J);\r\n}\r\n\r\n/* Stop tracing. */\r\nstatic void trace_stop(jit_State *J)\r\n{\r\n  BCIns *pc = mref(J->cur.startpc, BCIns);\r\n  BCOp op = bc_op(J->cur.startins);\r\n  GCproto *pt = &gcref(J->cur.startpt)->pt;\r\n  TraceNo traceno = J->cur.traceno;\r\n  GCtrace *T = trace_save_alloc(J);  /* Do this first. May throw OOM. */\r\n  lua_State *L;\r\n\r\n  switch (op) {\r\n  case BC_FORL:\r\n    setbc_op(pc+bc_j(J->cur.startins), BC_JFORI);  /* Patch FORI, too. */\r\n    /* fallthrough */\r\n  case BC_LOOP:\r\n  case BC_ITERL:\r\n  case BC_FUNCF:\r\n    /* Patch bytecode of starting instruction in root trace. */\r\n    setbc_op(pc, (int)op+(int)BC_JLOOP-(int)BC_LOOP);\r\n    setbc_d(pc, traceno);\r\n  addroot:\r\n    /* Add to root trace chain in prototype. */\r\n    J->cur.nextroot = pt->trace;\r\n    pt->trace = (TraceNo1)traceno;\r\n    break;\r\n  case BC_RET:\r\n  case BC_RET0:\r\n  case BC_RET1:\r\n    *pc = BCINS_AD(BC_JLOOP, J->cur.snap[0].nslots, traceno);\r\n    goto addroot;\r\n  case BC_JMP:\r\n    /* Patch exit branch in parent to side trace entry. */\r\n    lua_assert(J->parent != 0 && J->cur.root != 0);\r\n    lj_asm_patchexit(J, traceref(J, J->parent), J->exitno, J->cur.mcode);\r\n    /* Avoid compiling a side trace twice (stack resizing uses parent exit). */\r\n    traceref(J, J->parent)->snap[J->exitno].count = SNAPCOUNT_DONE;\r\n    /* Add to side trace chain in root trace. */\r\n    {\r\n      GCtrace *root = traceref(J, J->cur.root);\r\n      root->nchild++;\r\n      J->cur.nextside = root->nextside;\r\n      root->nextside = (TraceNo1)traceno;\r\n    }\r\n    break;\r\n  case BC_CALLM:\r\n  case BC_CALL:\r\n  case BC_ITERC:\r\n    /* Trace stitching: patch link of previous trace. */\r\n    traceref(J, J->exitno)->link = traceno;\r\n    break;\r\n  default:\r\n    lua_assert(0);\r\n    break;\r\n  }\r\n\r\n  /* Commit new mcode only after all patching is done. */\r\n  lj_mcode_commit(J, J->cur.mcode);\r\n  J->postproc = LJ_POST_NONE;\r\n  trace_save(J, T);\r\n\r\n  L = J->L;\r\n  lj_vmevent_send(L, TRACE,\r\n    setstrV(L, L->top++, lj_str_newlit(L, \"stop\"));\r\n    setintV(L->top++, traceno);\r\n    setfuncV(L, L->top++, J->fn);\r\n  );\r\n}\r\n\r\n/* Start a new root trace for down-recursion. */\r\nstatic int trace_downrec(jit_State *J)\r\n{\r\n  /* Restart recording at the return instruction. */\r\n  lua_assert(J->pt != NULL);\r\n  lua_assert(bc_isret(bc_op(*J->pc)));\r\n  if (bc_op(*J->pc) == BC_RETM)\r\n    return 0;  /* NYI: down-recursion with RETM. */\r\n  J->parent = 0;\r\n  J->exitno = 0;\r\n  J->state = LJ_TRACE_RECORD;\r\n  trace_start(J);\r\n  return 1;\r\n}\r\n\r\n/* Abort tracing. */\r\nstatic int trace_abort(jit_State *J)\r\n{\r\n  lua_State *L = J->L;\r\n  TraceError e = LJ_TRERR_RECERR;\r\n  TraceNo traceno;\r\n\r\n  J->postproc = LJ_POST_NONE;\r\n  lj_mcode_abort(J);\r\n  if (tvisnumber(L->top-1))\r\n    e = (TraceError)numberVint(L->top-1);\r\n  if (e == LJ_TRERR_MCODELM) {\r\n    L->top--;  /* Remove error object */\r\n    J->state = LJ_TRACE_ASM;\r\n    return 1;  /* Retry ASM with new MCode area. */\r\n  }\r\n  /* Penalize or blacklist starting bytecode instruction. */\r\n  if (J->parent == 0 && !bc_isret(bc_op(J->cur.startins))) {\r\n    if (J->exitno == 0) {\r\n      BCIns *startpc = mref(J->cur.startpc, BCIns);\r\n      if (e == LJ_TRERR_RETRY)\r\n\thotcount_set(J2GG(J), startpc+1, 1);  /* Immediate retry. */\r\n      else\r\n\tpenalty_pc(J, &gcref(J->cur.startpt)->pt, startpc, e);\r\n    } else {\r\n      traceref(J, J->exitno)->link = J->exitno;  /* Self-link is blacklisted. */\r\n    }\r\n  }\r\n\r\n  /* Is there anything to abort? */\r\n  traceno = J->cur.traceno;\r\n  if (traceno) {\r\n    ptrdiff_t errobj = savestack(L, L->top-1);  /* Stack may be resized. */\r\n    J->cur.link = 0;\r\n    J->cur.linktype = LJ_TRLINK_NONE;\r\n    lj_vmevent_send(L, TRACE,\r\n      TValue *frame;\r\n      const BCIns *pc;\r\n      GCfunc *fn;\r\n      setstrV(L, L->top++, lj_str_newlit(L, \"abort\"));\r\n      setintV(L->top++, traceno);\r\n      /* Find original Lua function call to generate a better error message. */\r\n      frame = J->L->base-1;\r\n      pc = J->pc;\r\n      while (!isluafunc(frame_func(frame))) {\r\n\tpc = (frame_iscont(frame) ? frame_contpc(frame) : frame_pc(frame)) - 1;\r\n\tframe = frame_prev(frame);\r\n      }\r\n      fn = frame_func(frame);\r\n      setfuncV(L, L->top++, fn);\r\n      setintV(L->top++, proto_bcpos(funcproto(fn), pc));\r\n      copyTV(L, L->top++, restorestack(L, errobj));\r\n      copyTV(L, L->top++, &J->errinfo);\r\n    );\r\n    /* Drop aborted trace after the vmevent (which may still access it). */\r\n    setgcrefnull(J->trace[traceno]);\r\n    if (traceno < J->freetrace)\r\n      J->freetrace = traceno;\r\n    J->cur.traceno = 0;\r\n  }\r\n  L->top--;  /* Remove error object */\r\n  if (e == LJ_TRERR_DOWNREC)\r\n    return trace_downrec(J);\r\n  else if (e == LJ_TRERR_MCODEAL)\r\n    lj_trace_flushall(L);\r\n  return 0;\r\n}\r\n\r\n/* Perform pending re-patch of a bytecode instruction. */\r\nstatic LJ_AINLINE void trace_pendpatch(jit_State *J, int force)\r\n{\r\n  if (LJ_UNLIKELY(J->patchpc)) {\r\n    if (force || J->bcskip == 0) {\r\n      *J->patchpc = J->patchins;\r\n      J->patchpc = NULL;\r\n    } else {\r\n      J->bcskip = 0;\r\n    }\r\n  }\r\n}\r\n\r\n/* State machine for the trace compiler. Protected callback. */\r\nstatic TValue *trace_state(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  jit_State *J = (jit_State *)ud;\r\n  UNUSED(dummy);\r\n  do {\r\n  retry:\r\n    switch (J->state) {\r\n    case LJ_TRACE_START:\r\n      J->state = LJ_TRACE_RECORD;  /* trace_start() may change state. */\r\n      trace_start(J);\r\n      lj_dispatch_update(J2G(J));\r\n      break;\r\n\r\n    case LJ_TRACE_RECORD:\r\n      trace_pendpatch(J, 0);\r\n      setvmstate(J2G(J), RECORD);\r\n      lj_vmevent_send_(L, RECORD,\r\n\t/* Save/restore tmptv state for trace recorder. */\r\n\tTValue savetv = J2G(J)->tmptv;\r\n\tTValue savetv2 = J2G(J)->tmptv2;\r\n\tsetintV(L->top++, J->cur.traceno);\r\n\tsetfuncV(L, L->top++, J->fn);\r\n\tsetintV(L->top++, J->pt ? (int32_t)proto_bcpos(J->pt, J->pc) : -1);\r\n\tsetintV(L->top++, J->framedepth);\r\n      ,\r\n\tJ2G(J)->tmptv = savetv;\r\n\tJ2G(J)->tmptv2 = savetv2;\r\n      );\r\n      lj_record_ins(J);\r\n      break;\r\n\r\n    case LJ_TRACE_END:\r\n      trace_pendpatch(J, 1);\r\n      J->loopref = 0;\r\n      if ((J->flags & JIT_F_OPT_LOOP) &&\r\n\t  J->cur.link == J->cur.traceno && J->framedepth + J->retdepth == 0) {\r\n\tsetvmstate(J2G(J), OPT);\r\n\tlj_opt_dce(J);\r\n\tif (lj_opt_loop(J)) {  /* Loop optimization failed? */\r\n\t  J->cur.link = 0;\r\n\t  J->cur.linktype = LJ_TRLINK_NONE;\r\n\t  J->loopref = J->cur.nins;\r\n\t  J->state = LJ_TRACE_RECORD;  /* Try to continue recording. */\r\n\t  break;\r\n\t}\r\n\tJ->loopref = J->chain[IR_LOOP];  /* Needed by assembler. */\r\n      }\r\n      lj_opt_split(J);\r\n      lj_opt_sink(J);\r\n      if (!J->loopref) J->cur.snap[J->cur.nsnap-1].count = SNAPCOUNT_DONE;\r\n      J->state = LJ_TRACE_ASM;\r\n      break;\r\n\r\n    case LJ_TRACE_ASM:\r\n      setvmstate(J2G(J), ASM);\r\n      lj_asm_trace(J, &J->cur);\r\n      trace_stop(J);\r\n      setvmstate(J2G(J), INTERP);\r\n      J->state = LJ_TRACE_IDLE;\r\n      lj_dispatch_update(J2G(J));\r\n      return NULL;\r\n\r\n    default:  /* Trace aborted asynchronously. */\r\n      setintV(L->top++, (int32_t)LJ_TRERR_RECERR);\r\n      /* fallthrough */\r\n    case LJ_TRACE_ERR:\r\n      trace_pendpatch(J, 1);\r\n      if (trace_abort(J))\r\n\tgoto retry;\r\n      setvmstate(J2G(J), INTERP);\r\n      J->state = LJ_TRACE_IDLE;\r\n      lj_dispatch_update(J2G(J));\r\n      return NULL;\r\n    }\r\n  } while (J->state > LJ_TRACE_RECORD);\r\n  return NULL;\r\n}\r\n\r\n/* -- Event handling ------------------------------------------------------ */\r\n\r\n/* A bytecode instruction is about to be executed. Record it. */\r\nvoid lj_trace_ins(jit_State *J, const BCIns *pc)\r\n{\r\n  /* Note: J->L must already be set. pc is the true bytecode PC here. */\r\n  J->pc = pc;\r\n  J->fn = curr_func(J->L);\r\n  J->pt = isluafunc(J->fn) ? funcproto(J->fn) : NULL;\r\n  while (lj_vm_cpcall(J->L, NULL, (void *)J, trace_state) != 0)\r\n    J->state = LJ_TRACE_ERR;\r\n}\r\n\r\n/* A hotcount triggered. Start recording a root trace. */\r\nvoid LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc)\r\n{\r\n  /* Note: pc is the interpreter bytecode PC here. It's offset by 1. */\r\n  ERRNO_SAVE\r\n  /* Reset hotcount. */\r\n  hotcount_set(J2GG(J), pc, J->param[JIT_P_hotloop]*HOTCOUNT_LOOP);\r\n  /* Only start a new trace if not recording or inside __gc call or vmevent. */\r\n  if (J->state == LJ_TRACE_IDLE &&\r\n      !(J2G(J)->hookmask & (HOOK_GC|HOOK_VMEVENT))) {\r\n    J->parent = 0;  /* Root trace. */\r\n    J->exitno = 0;\r\n    J->state = LJ_TRACE_START;\r\n    lj_trace_ins(J, pc-1);\r\n  }\r\n  ERRNO_RESTORE\r\n}\r\n\r\n/* Check for a hot side exit. If yes, start recording a side trace. */\r\nstatic void trace_hotside(jit_State *J, const BCIns *pc)\r\n{\r\n  SnapShot *snap = &traceref(J, J->parent)->snap[J->exitno];\r\n  if (!(J2G(J)->hookmask & (HOOK_GC|HOOK_VMEVENT)) &&\r\n      isluafunc(curr_func(J->L)) &&\r\n      snap->count != SNAPCOUNT_DONE &&\r\n      ++snap->count >= J->param[JIT_P_hotexit]) {\r\n    lua_assert(J->state == LJ_TRACE_IDLE);\r\n    /* J->parent is non-zero for a side trace. */\r\n    J->state = LJ_TRACE_START;\r\n    lj_trace_ins(J, pc);\r\n  }\r\n}\r\n\r\n/* Stitch a new trace to the previous trace. */\r\nvoid LJ_FASTCALL lj_trace_stitch(jit_State *J, const BCIns *pc)\r\n{\r\n  /* Only start a new trace if not recording or inside __gc call or vmevent. */\r\n  if (J->state == LJ_TRACE_IDLE &&\r\n      !(J2G(J)->hookmask & (HOOK_GC|HOOK_VMEVENT))) {\r\n    J->parent = 0;  /* Have to treat it like a root trace. */\r\n    /* J->exitno is set to the invoking trace. */\r\n    J->state = LJ_TRACE_START;\r\n    lj_trace_ins(J, pc);\r\n  }\r\n}\r\n\r\n\r\n/* Tiny struct to pass data to protected call. */\r\ntypedef struct ExitDataCP {\r\n  jit_State *J;\r\n  void *exptr;\t\t/* Pointer to exit state. */\r\n  const BCIns *pc;\t/* Restart interpreter at this PC. */\r\n} ExitDataCP;\r\n\r\n/* Need to protect lj_snap_restore because it may throw. */\r\nstatic TValue *trace_exit_cp(lua_State *L, lua_CFunction dummy, void *ud)\r\n{\r\n  ExitDataCP *exd = (ExitDataCP *)ud;\r\n  cframe_errfunc(L->cframe) = -1;  /* Inherit error function. */\r\n  exd->pc = lj_snap_restore(exd->J, exd->exptr);\r\n  UNUSED(dummy);\r\n  return NULL;\r\n}\r\n\r\n#ifndef LUAJIT_DISABLE_VMEVENT\r\n/* Push all registers from exit state. */\r\nstatic void trace_exit_regs(lua_State *L, ExitState *ex)\r\n{\r\n  int32_t i;\r\n  setintV(L->top++, RID_NUM_GPR);\r\n  setintV(L->top++, RID_NUM_FPR);\r\n  for (i = 0; i < RID_NUM_GPR; i++) {\r\n    if (sizeof(ex->gpr[i]) == sizeof(int32_t))\r\n      setintV(L->top++, (int32_t)ex->gpr[i]);\r\n    else\r\n      setnumV(L->top++, (lua_Number)ex->gpr[i]);\r\n  }\r\n#if !LJ_SOFTFP\r\n  for (i = 0; i < RID_NUM_FPR; i++) {\r\n    setnumV(L->top, ex->fpr[i]);\r\n    if (LJ_UNLIKELY(tvisnan(L->top)))\r\n      setnanV(L->top);\r\n    L->top++;\r\n  }\r\n#endif\r\n}\r\n#endif\r\n\r\n#ifdef EXITSTATE_PCREG\r\n/* Determine trace number from pc of exit instruction. */\r\nstatic TraceNo trace_exit_find(jit_State *J, MCode *pc)\r\n{\r\n  TraceNo traceno;\r\n  for (traceno = 1; traceno < J->sizetrace; traceno++) {\r\n    GCtrace *T = traceref(J, traceno);\r\n    if (T && pc >= T->mcode && pc < (MCode *)((char *)T->mcode + T->szmcode))\r\n      return traceno;\r\n  }\r\n  lua_assert(0);\r\n  return 0;\r\n}\r\n#endif\r\n\r\n/* A trace exited. Restore interpreter state. */\r\nint LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr)\r\n{\r\n  ERRNO_SAVE\r\n  lua_State *L = J->L;\r\n  ExitState *ex = (ExitState *)exptr;\r\n  ExitDataCP exd;\r\n  int errcode;\r\n  const BCIns *pc;\r\n  void *cf;\r\n  GCtrace *T;\r\n#ifdef EXITSTATE_PCREG\r\n  J->parent = trace_exit_find(J, (MCode *)(intptr_t)ex->gpr[EXITSTATE_PCREG]);\r\n#endif\r\n  T = traceref(J, J->parent); UNUSED(T);\r\n#ifdef EXITSTATE_CHECKEXIT\r\n  if (J->exitno == T->nsnap) {  /* Treat stack check like a parent exit. */\r\n    lua_assert(T->root != 0);\r\n    J->exitno = T->ir[REF_BASE].op2;\r\n    J->parent = T->ir[REF_BASE].op1;\r\n    T = traceref(J, J->parent);\r\n  }\r\n#endif\r\n  lua_assert(T != NULL && J->exitno < T->nsnap);\r\n  exd.J = J;\r\n  exd.exptr = exptr;\r\n  errcode = lj_vm_cpcall(L, NULL, &exd, trace_exit_cp);\r\n  if (errcode)\r\n    return -errcode;  /* Return negated error code. */\r\n\r\n  if (!(LJ_HASPROFILE && (G(L)->hookmask & HOOK_PROFILE)))\r\n    lj_vmevent_send(L, TEXIT,\r\n      lj_state_checkstack(L, 4+RID_NUM_GPR+RID_NUM_FPR+LUA_MINSTACK);\r\n      setintV(L->top++, J->parent);\r\n      setintV(L->top++, J->exitno);\r\n      trace_exit_regs(L, ex);\r\n    );\r\n\r\n  pc = exd.pc;\r\n  cf = cframe_raw(L->cframe);\r\n  setcframe_pc(cf, pc);\r\n  if (LJ_HASPROFILE && (G(L)->hookmask & HOOK_PROFILE)) {\r\n    /* Just exit to interpreter. */\r\n  } else if (G(L)->gc.state == GCSatomic || G(L)->gc.state == GCSfinalize) {\r\n    if (!(G(L)->hookmask & HOOK_GC))\r\n      lj_gc_step(L);  /* Exited because of GC: drive GC forward. */\r\n  } else {\r\n    trace_hotside(J, pc);\r\n  }\r\n  if (bc_op(*pc) == BC_JLOOP) {\r\n    BCIns *retpc = &traceref(J, bc_d(*pc))->startins;\r\n    if (bc_isret(bc_op(*retpc))) {\r\n      if (J->state == LJ_TRACE_RECORD) {\r\n\tJ->patchins = *pc;\r\n\tJ->patchpc = (BCIns *)pc;\r\n\t*J->patchpc = *retpc;\r\n\tJ->bcskip = 1;\r\n      } else {\r\n\tpc = retpc;\r\n\tsetcframe_pc(cf, pc);\r\n      }\r\n    }\r\n  }\r\n  /* Return MULTRES or 0. */\r\n  ERRNO_RESTORE\r\n  switch (bc_op(*pc)) {\r\n  case BC_CALLM: case BC_CALLMT:\r\n    return (int)((BCReg)(L->top - L->base) - bc_a(*pc) - bc_c(*pc) + LJ_FR2);\r\n  case BC_RETM:\r\n    return (int)((BCReg)(L->top - L->base) + 1 - bc_a(*pc) - bc_d(*pc));\r\n  case BC_TSETM:\r\n    return (int)((BCReg)(L->top - L->base) + 1 - bc_a(*pc));\r\n  default:\r\n    if (bc_op(*pc) >= BC_FUNCF)\r\n      return (int)((BCReg)(L->top - L->base) + 1);\r\n    return 0;\r\n  }\r\n}\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_trace.h",
    "content": "/*\r\n** Trace management.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_TRACE_H\r\n#define _LJ_TRACE_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n#if LJ_HASJIT\r\n#include \"lj_jit.h\"\r\n#include \"lj_dispatch.h\"\r\n\r\n/* Trace errors. */\r\ntypedef enum {\r\n#define TREDEF(name, msg)\tLJ_TRERR_##name,\r\n#include \"lj_traceerr.h\"\r\n  LJ_TRERR__MAX\r\n} TraceError;\r\n\r\nLJ_FUNC_NORET void lj_trace_err(jit_State *J, TraceError e);\r\nLJ_FUNC_NORET void lj_trace_err_info(jit_State *J, TraceError e);\r\n\r\n/* Trace management. */\r\nLJ_FUNC void LJ_FASTCALL lj_trace_free(global_State *g, GCtrace *T);\r\nLJ_FUNC void lj_trace_reenableproto(GCproto *pt);\r\nLJ_FUNC void lj_trace_flushproto(global_State *g, GCproto *pt);\r\nLJ_FUNC void lj_trace_flush(jit_State *J, TraceNo traceno);\r\nLJ_FUNC int lj_trace_flushall(lua_State *L);\r\nLJ_FUNC void lj_trace_initstate(global_State *g);\r\nLJ_FUNC void lj_trace_freestate(global_State *g);\r\n\r\n/* Event handling. */\r\nLJ_FUNC void lj_trace_ins(jit_State *J, const BCIns *pc);\r\nLJ_FUNCA void LJ_FASTCALL lj_trace_hot(jit_State *J, const BCIns *pc);\r\nLJ_FUNCA void LJ_FASTCALL lj_trace_stitch(jit_State *J, const BCIns *pc);\r\nLJ_FUNCA int LJ_FASTCALL lj_trace_exit(jit_State *J, void *exptr);\r\n\r\n/* Signal asynchronous abort of trace or end of trace. */\r\n#define lj_trace_abort(g)\t(G2J(g)->state &= ~LJ_TRACE_ACTIVE)\r\n#define lj_trace_end(J)\t\t(J->state = LJ_TRACE_END)\r\n\r\n#else\r\n\r\n#define lj_trace_flushall(L)\t(UNUSED(L), 0)\r\n#define lj_trace_initstate(g)\tUNUSED(g)\r\n#define lj_trace_freestate(g)\tUNUSED(g)\r\n#define lj_trace_abort(g)\tUNUSED(g)\r\n#define lj_trace_end(J)\t\tUNUSED(J)\r\n\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_traceerr.h",
    "content": "/*\r\n** Trace compiler error messages.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/* This file may be included multiple times with different TREDEF macros. */\r\n\r\n/* Recording. */\r\nTREDEF(RECERR,\t\"error thrown or hook called during recording\")\r\nTREDEF(TRACEUV,\t\"trace too short\")\r\nTREDEF(TRACEOV,\t\"trace too long\")\r\nTREDEF(STACKOV,\t\"trace too deep\")\r\nTREDEF(SNAPOV,\t\"too many snapshots\")\r\nTREDEF(BLACKL,\t\"blacklisted\")\r\nTREDEF(RETRY,\t\"retry recording\")\r\nTREDEF(NYIBC,\t\"NYI: bytecode %d\")\r\n\r\n/* Recording loop ops. */\r\nTREDEF(LLEAVE,\t\"leaving loop in root trace\")\r\nTREDEF(LINNER,\t\"inner loop in root trace\")\r\nTREDEF(LUNROLL,\t\"loop unroll limit reached\")\r\n\r\n/* Recording calls/returns. */\r\nTREDEF(BADTYPE,\t\"bad argument type\")\r\nTREDEF(CJITOFF,\t\"JIT compilation disabled for function\")\r\nTREDEF(CUNROLL,\t\"call unroll limit reached\")\r\nTREDEF(DOWNREC,\t\"down-recursion, restarting\")\r\nTREDEF(NYICF,\t\"NYI: C function %s\")\r\nTREDEF(NYIFF,\t\"NYI: FastFunc %s\")\r\nTREDEF(NYIFFU,\t\"NYI: unsupported variant of FastFunc %s\")\r\nTREDEF(NYIRETL,\t\"NYI: return to lower frame\")\r\n\r\n/* Recording indexed load/store. */\r\nTREDEF(STORENN,\t\"store with nil or NaN key\")\r\nTREDEF(NOMM,\t\"missing metamethod\")\r\nTREDEF(IDXLOOP,\t\"looping index lookup\")\r\nTREDEF(NYITMIX,\t\"NYI: mixed sparse/dense table\")\r\n\r\n/* Recording C data operations. */\r\nTREDEF(NOCACHE,\t\"symbol not in cache\")\r\nTREDEF(NYICONV,\t\"NYI: unsupported C type conversion\")\r\nTREDEF(NYICALL,\t\"NYI: unsupported C function type\")\r\n\r\n/* Optimizations. */\r\nTREDEF(GFAIL,\t\"guard would always fail\")\r\nTREDEF(PHIOV,\t\"too many PHIs\")\r\nTREDEF(TYPEINS,\t\"persistent type instability\")\r\n\r\n/* Assembler. */\r\nTREDEF(MCODEAL,\t\"failed to allocate mcode memory\")\r\nTREDEF(MCODEOV,\t\"machine code too long\")\r\nTREDEF(MCODELM,\t\"hit mcode limit (retrying)\")\r\nTREDEF(SPILLOV,\t\"too many spill slots\")\r\nTREDEF(BADRA,\t\"inconsistent register allocation\")\r\nTREDEF(NYIIR,\t\"NYI: cannot assemble IR instruction %d\")\r\nTREDEF(NYIPHI,\t\"NYI: PHI shuffling too complex\")\r\nTREDEF(NYICOAL,\t\"NYI: register coalescing too complex\")\r\n\r\n#undef TREDEF\r\n\r\n/* Detecting unused error messages:\r\n   awk -F, '/^TREDEF/ { gsub(/TREDEF./, \"\"); printf \"grep -q LJ_TRERR_%s *.[ch] || echo %s\\n\", $1, $1}' lj_traceerr.h | sh\r\n*/\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_udata.c",
    "content": "/*\r\n** Userdata handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_udata_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_gc.h\"\r\n#include \"lj_udata.h\"\r\n\r\nGCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env)\r\n{\r\n  GCudata *ud = lj_mem_newt(L, sizeof(GCudata) + sz, GCudata);\r\n  global_State *g = G(L);\r\n  newwhite(g, ud);  /* Not finalized. */\r\n  ud->gct = ~LJ_TUDATA;\r\n  ud->udtype = UDTYPE_USERDATA;\r\n  ud->len = sz;\r\n  /* NOBARRIER: The GCudata is new (marked white). */\r\n  setgcrefnull(ud->metatable);\r\n  setgcref(ud->env, obj2gco(env));\r\n  /* Chain to userdata list (after main thread). */\r\n  setgcrefr(ud->nextgc, mainthread(g)->nextgc);\r\n  setgcref(mainthread(g)->nextgc, obj2gco(ud));\r\n  return ud;\r\n}\r\n\r\nvoid LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud)\r\n{\r\n  lj_mem_free(g, ud, sizeudata(ud));\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_udata.h",
    "content": "/*\r\n** Userdata handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_UDATA_H\r\n#define _LJ_UDATA_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\nLJ_FUNC GCudata *lj_udata_new(lua_State *L, MSize sz, GCtab *env);\r\nLJ_FUNC void LJ_FASTCALL lj_udata_free(global_State *g, GCudata *ud);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_vm.h",
    "content": "/*\r\n** Assembler VM interface definitions.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_VM_H\r\n#define _LJ_VM_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Entry points for ASM parts of VM. */\r\nLJ_ASMF void lj_vm_call(lua_State *L, TValue *base, int nres1);\r\nLJ_ASMF int lj_vm_pcall(lua_State *L, TValue *base, int nres1, ptrdiff_t ef);\r\ntypedef TValue *(*lua_CPFunction)(lua_State *L, lua_CFunction func, void *ud);\r\nLJ_ASMF int lj_vm_cpcall(lua_State *L, lua_CFunction func, void *ud,\r\n\t\t\t lua_CPFunction cp);\r\nLJ_ASMF int lj_vm_resume(lua_State *L, TValue *base, int nres1, ptrdiff_t ef);\r\nLJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_c(void *cframe, int errcode);\r\nLJ_ASMF_NORET void LJ_FASTCALL lj_vm_unwind_ff(void *cframe);\r\nLJ_ASMF void lj_vm_unwind_c_eh(void);\r\nLJ_ASMF void lj_vm_unwind_ff_eh(void);\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF void lj_vm_unwind_rethrow(void);\r\n#endif\r\n\r\n/* Miscellaneous functions. */\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF int lj_vm_cpuid(uint32_t f, uint32_t res[4]);\r\n#endif\r\n#if LJ_TARGET_PPC\r\nvoid lj_vm_cachesync(void *start, void *end);\r\n#endif\r\nLJ_ASMF double lj_vm_foldarith(double x, double y, int op);\r\n#if LJ_HASJIT\r\nLJ_ASMF double lj_vm_foldfpm(double x, int op);\r\n#endif\r\n#if !LJ_ARCH_HASFPU\r\n/* Declared in lj_obj.h: LJ_ASMF int32_t lj_vm_tobit(double x); */\r\n#endif\r\n\r\n/* Dispatch targets for recording and hooks. */\r\nLJ_ASMF void lj_vm_record(void);\r\nLJ_ASMF void lj_vm_inshook(void);\r\nLJ_ASMF void lj_vm_rethook(void);\r\nLJ_ASMF void lj_vm_callhook(void);\r\nLJ_ASMF void lj_vm_profhook(void);\r\n\r\n/* Trace exit handling. */\r\nLJ_ASMF void lj_vm_exit_handler(void);\r\nLJ_ASMF void lj_vm_exit_interp(void);\r\n\r\n/* Internal math helper functions. */\r\n#if LJ_TARGET_PPC || LJ_TARGET_ARM64\r\n#define lj_vm_floor\tfloor\r\n#define lj_vm_ceil\tceil\r\n#else\r\nLJ_ASMF double lj_vm_floor(double);\r\nLJ_ASMF double lj_vm_ceil(double);\r\n#if LJ_TARGET_ARM\r\nLJ_ASMF double lj_vm_floor_sf(double);\r\nLJ_ASMF double lj_vm_ceil_sf(double);\r\n#endif\r\n#endif\r\n#ifdef LUAJIT_NO_LOG2\r\nLJ_ASMF double lj_vm_log2(double);\r\n#else\r\n#define lj_vm_log2\tlog2\r\n#endif\r\n\r\n#if LJ_HASJIT\r\n#if LJ_TARGET_X86ORX64\r\nLJ_ASMF void lj_vm_floor_sse(void);\r\nLJ_ASMF void lj_vm_ceil_sse(void);\r\nLJ_ASMF void lj_vm_trunc_sse(void);\r\nLJ_ASMF void lj_vm_powi_sse(void);\r\n#define lj_vm_powi\tNULL\r\n#else\r\nLJ_ASMF double lj_vm_powi(double, int32_t);\r\n#endif\r\n#if LJ_TARGET_PPC || LJ_TARGET_ARM64\r\n#define lj_vm_trunc\ttrunc\r\n#else\r\nLJ_ASMF double lj_vm_trunc(double);\r\n#if LJ_TARGET_ARM\r\nLJ_ASMF double lj_vm_trunc_sf(double);\r\n#endif\r\n#endif\r\n#ifdef LUAJIT_NO_EXP2\r\nLJ_ASMF double lj_vm_exp2(double);\r\n#else\r\n#define lj_vm_exp2\texp2\r\n#endif\r\nLJ_ASMF int32_t LJ_FASTCALL lj_vm_modi(int32_t, int32_t);\r\n#if LJ_HASFFI\r\nLJ_ASMF int lj_vm_errno(void);\r\n#endif\r\n#endif\r\n\r\n/* Continuations for metamethods. */\r\nLJ_ASMF void lj_cont_cat(void);  /* Continue with concatenation. */\r\nLJ_ASMF void lj_cont_ra(void);  /* Store result in RA from instruction. */\r\nLJ_ASMF void lj_cont_nop(void);  /* Do nothing, just continue execution. */\r\nLJ_ASMF void lj_cont_condt(void);  /* Branch if result is true. */\r\nLJ_ASMF void lj_cont_condf(void);  /* Branch if result is false. */\r\nLJ_ASMF void lj_cont_hook(void);  /* Continue from hook yield. */\r\nLJ_ASMF void lj_cont_stitch(void);  /* Trace stitching. */\r\n\r\n/* Start of the ASM code. */\r\nLJ_ASMF char lj_vm_asm_begin[];\r\n\r\n/* Bytecode offsets are relative to lj_vm_asm_begin. */\r\n#define makeasmfunc(ofs)\t((ASMFunction)(lj_vm_asm_begin + (ofs)))\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_vmevent.c",
    "content": "/*\r\n** VM event handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#include <stdio.h>\r\n\r\n#define lj_vmevent_c\r\n#define LUA_CORE\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_str.h\"\r\n#include \"lj_tab.h\"\r\n#include \"lj_state.h\"\r\n#include \"lj_dispatch.h\"\r\n#include \"lj_vm.h\"\r\n#include \"lj_vmevent.h\"\r\n\r\nptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev)\r\n{\r\n  global_State *g = G(L);\r\n  GCstr *s = lj_str_newlit(L, LJ_VMEVENTS_REGKEY);\r\n  cTValue *tv = lj_tab_getstr(tabV(registry(L)), s);\r\n  if (tvistab(tv)) {\r\n    int hash = VMEVENT_HASH(ev);\r\n    tv = lj_tab_getint(tabV(tv), hash);\r\n    if (tv && tvisfunc(tv)) {\r\n      lj_state_checkstack(L, LUA_MINSTACK);\r\n      setfuncV(L, L->top++, funcV(tv));\r\n      if (LJ_FR2) setnilV(L->top++);\r\n      return savestack(L, L->top);\r\n    }\r\n  }\r\n  g->vmevmask &= ~VMEVENT_MASK(ev);  /* No handler: cache this fact. */\r\n  return 0;\r\n}\r\n\r\nvoid lj_vmevent_call(lua_State *L, ptrdiff_t argbase)\r\n{\r\n  global_State *g = G(L);\r\n  uint8_t oldmask = g->vmevmask;\r\n  uint8_t oldh = hook_save(g);\r\n  int status;\r\n  g->vmevmask = 0;  /* Disable all events. */\r\n  hook_vmevent(g);\r\n  status = lj_vm_pcall(L, restorestack(L, argbase), 0+1, 0);\r\n  if (LJ_UNLIKELY(status)) {\r\n    /* Really shouldn't use stderr here, but where else to complain? */\r\n    L->top--;\r\n    fputs(\"VM handler failed: \", stderr);\r\n    fputs(tvisstr(L->top) ? strVdata(L->top) : \"?\", stderr);\r\n    fputc('\\n', stderr);\r\n  }\r\n  hook_restore(g, oldh);\r\n  if (g->vmevmask != VMEVENT_NOCACHE)\r\n    g->vmevmask = oldmask;  /* Restore event mask, but not if not modified. */\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_vmevent.h",
    "content": "/*\r\n** VM event handling.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LJ_VMEVENT_H\r\n#define _LJ_VMEVENT_H\r\n\r\n#include \"lj_obj.h\"\r\n\r\n/* Registry key for VM event handler table. */\r\n#define LJ_VMEVENTS_REGKEY\t\"_VMEVENTS\"\r\n#define LJ_VMEVENTS_HSIZE\t4\r\n\r\n#define VMEVENT_MASK(ev)\t((uint8_t)1 << ((int)(ev) & 7))\r\n#define VMEVENT_HASH(ev)\t((int)(ev) & ~7)\r\n#define VMEVENT_HASHIDX(h)\t((int)(h) << 3)\r\n#define VMEVENT_NOCACHE\t\t255\r\n\r\n#define VMEVENT_DEF(name, hash) \\\r\n  LJ_VMEVENT_##name##_, \\\r\n  LJ_VMEVENT_##name = ((LJ_VMEVENT_##name##_) & 7)|((hash) << 3)\r\n\r\n/* VM event IDs. */\r\ntypedef enum {\r\n  VMEVENT_DEF(BC,\t0x00003883),\r\n  VMEVENT_DEF(TRACE,\t0xb2d91467),\r\n  VMEVENT_DEF(RECORD,\t0x9284bf4f),\r\n  VMEVENT_DEF(TEXIT,\t0xb29df2b0),\r\n  LJ_VMEVENT__MAX\r\n} VMEvent;\r\n\r\n#ifdef LUAJIT_DISABLE_VMEVENT\r\n#define lj_vmevent_send(L, ev, args)\t\tUNUSED(L)\r\n#define lj_vmevent_send_(L, ev, args, post)\tUNUSED(L)\r\n#else\r\n#define lj_vmevent_send(L, ev, args) \\\r\n  if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \\\r\n    ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \\\r\n    if (argbase) { \\\r\n      args \\\r\n      lj_vmevent_call(L, argbase); \\\r\n    } \\\r\n  }\r\n#define lj_vmevent_send_(L, ev, args, post) \\\r\n  if (G(L)->vmevmask & VMEVENT_MASK(LJ_VMEVENT_##ev)) { \\\r\n    ptrdiff_t argbase = lj_vmevent_prepare(L, LJ_VMEVENT_##ev); \\\r\n    if (argbase) { \\\r\n      args \\\r\n      lj_vmevent_call(L, argbase); \\\r\n      post \\\r\n    } \\\r\n  }\r\n\r\nLJ_FUNC ptrdiff_t lj_vmevent_prepare(lua_State *L, VMEvent ev);\r\nLJ_FUNC void lj_vmevent_call(lua_State *L, ptrdiff_t argbase);\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lj_vmmath.c",
    "content": "/*\r\n** Math helper functions for assembler VM.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#define lj_vmmath_c\r\n#define LUA_CORE\r\n\r\n#include <errno.h>\r\n#include <math.h>\r\n\r\n#include \"lj_obj.h\"\r\n#include \"lj_ir.h\"\r\n#include \"lj_vm.h\"\r\n\r\n/* -- Wrapper functions --------------------------------------------------- */\r\n\r\n#if LJ_TARGET_X86 && __ELF__ && __PIC__\r\n/* Wrapper functions to deal with the ELF/x86 PIC disaster. */\r\nLJ_FUNCA double lj_wrap_log(double x) { return log(x); }\r\nLJ_FUNCA double lj_wrap_log10(double x) { return log10(x); }\r\nLJ_FUNCA double lj_wrap_exp(double x) { return exp(x); }\r\nLJ_FUNCA double lj_wrap_sin(double x) { return sin(x); }\r\nLJ_FUNCA double lj_wrap_cos(double x) { return cos(x); }\r\nLJ_FUNCA double lj_wrap_tan(double x) { return tan(x); }\r\nLJ_FUNCA double lj_wrap_asin(double x) { return asin(x); }\r\nLJ_FUNCA double lj_wrap_acos(double x) { return acos(x); }\r\nLJ_FUNCA double lj_wrap_atan(double x) { return atan(x); }\r\nLJ_FUNCA double lj_wrap_sinh(double x) { return sinh(x); }\r\nLJ_FUNCA double lj_wrap_cosh(double x) { return cosh(x); }\r\nLJ_FUNCA double lj_wrap_tanh(double x) { return tanh(x); }\r\nLJ_FUNCA double lj_wrap_atan2(double x, double y) { return atan2(x, y); }\r\nLJ_FUNCA double lj_wrap_pow(double x, double y) { return pow(x, y); }\r\nLJ_FUNCA double lj_wrap_fmod(double x, double y) { return fmod(x, y); }\r\n#endif\r\n\r\n/* -- Helper functions for generated machine code ------------------------- */\r\n\r\ndouble lj_vm_foldarith(double x, double y, int op)\r\n{\r\n  switch (op) {\r\n  case IR_ADD - IR_ADD: return x+y; break;\r\n  case IR_SUB - IR_ADD: return x-y; break;\r\n  case IR_MUL - IR_ADD: return x*y; break;\r\n  case IR_DIV - IR_ADD: return x/y; break;\r\n  case IR_MOD - IR_ADD: return x-lj_vm_floor(x/y)*y; break;\r\n  case IR_POW - IR_ADD: return pow(x, y); break;\r\n  case IR_NEG - IR_ADD: return -x; break;\r\n  case IR_ABS - IR_ADD: return fabs(x); break;\r\n#if LJ_HASJIT\r\n  case IR_ATAN2 - IR_ADD: return atan2(x, y); break;\r\n  case IR_LDEXP - IR_ADD: return ldexp(x, (int)y); break;\r\n  case IR_MIN - IR_ADD: return x > y ? y : x; break;\r\n  case IR_MAX - IR_ADD: return x < y ? y : x; break;\r\n#endif\r\n  default: return x;\r\n  }\r\n}\r\n\r\n#if LJ_HASJIT\r\n\r\n#ifdef LUAJIT_NO_LOG2\r\ndouble lj_vm_log2(double a)\r\n{\r\n  return log(a) * 1.4426950408889634074;\r\n}\r\n#endif\r\n\r\n#ifdef LUAJIT_NO_EXP2\r\ndouble lj_vm_exp2(double a)\r\n{\r\n  return exp(a * 0.6931471805599453);\r\n}\r\n#endif\r\n\r\n#if !(LJ_TARGET_ARM || LJ_TARGET_ARM64 || LJ_TARGET_PPC)\r\nint32_t LJ_FASTCALL lj_vm_modi(int32_t a, int32_t b)\r\n{\r\n  uint32_t y, ua, ub;\r\n  lua_assert(b != 0);  /* This must be checked before using this function. */\r\n  ua = a < 0 ? (uint32_t)-a : (uint32_t)a;\r\n  ub = b < 0 ? (uint32_t)-b : (uint32_t)b;\r\n  y = ua % ub;\r\n  if (y != 0 && (a^b) < 0) y = y - ub;\r\n  if (((int32_t)y^b) < 0) y = (uint32_t)-(int32_t)y;\r\n  return (int32_t)y;\r\n}\r\n#endif\r\n\r\n#if !LJ_TARGET_X86ORX64\r\n/* Unsigned x^k. */\r\nstatic double lj_vm_powui(double x, uint32_t k)\r\n{\r\n  double y;\r\n  lua_assert(k != 0);\r\n  for (; (k & 1) == 0; k >>= 1) x *= x;\r\n  y = x;\r\n  if ((k >>= 1) != 0) {\r\n    for (;;) {\r\n      x *= x;\r\n      if (k == 1) break;\r\n      if (k & 1) y *= x;\r\n      k >>= 1;\r\n    }\r\n    y *= x;\r\n  }\r\n  return y;\r\n}\r\n\r\n/* Signed x^k. */\r\ndouble lj_vm_powi(double x, int32_t k)\r\n{\r\n  if (k > 1)\r\n    return lj_vm_powui(x, (uint32_t)k);\r\n  else if (k == 1)\r\n    return x;\r\n  else if (k == 0)\r\n    return 1.0;\r\n  else\r\n    return 1.0 / lj_vm_powui(x, (uint32_t)-k);\r\n}\r\n#endif\r\n\r\n/* Computes fpm(x) for extended math functions. */\r\ndouble lj_vm_foldfpm(double x, int fpm)\r\n{\r\n  switch (fpm) {\r\n  case IRFPM_FLOOR: return lj_vm_floor(x);\r\n  case IRFPM_CEIL: return lj_vm_ceil(x);\r\n  case IRFPM_TRUNC: return lj_vm_trunc(x);\r\n  case IRFPM_SQRT: return sqrt(x);\r\n  case IRFPM_EXP: return exp(x);\r\n  case IRFPM_EXP2: return lj_vm_exp2(x);\r\n  case IRFPM_LOG: return log(x);\r\n  case IRFPM_LOG2: return lj_vm_log2(x);\r\n  case IRFPM_LOG10: return log10(x);\r\n  case IRFPM_SIN: return sin(x);\r\n  case IRFPM_COS: return cos(x);\r\n  case IRFPM_TAN: return tan(x);\r\n  default: lua_assert(0);\r\n  }\r\n  return 0;\r\n}\r\n\r\n#if LJ_HASFFI\r\nint lj_vm_errno(void)\r\n{\r\n  return errno;\r\n}\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/ljamalg.c",
    "content": "/*\r\n** LuaJIT core and libraries amalgamation.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n/*\r\n+--------------------------------------------------------------------------+\r\n| WARNING: Compiling the amalgamation needs a lot of virtual memory        |\r\n| (around 300 MB with GCC 4.x)! If you don't have enough physical memory   |\r\n| your machine will start swapping to disk and the compile will not finish |\r\n| within a reasonable amount of time.                                      |\r\n| So either compile on a bigger machine or use the non-amalgamated build.  |\r\n+--------------------------------------------------------------------------+\r\n*/\r\n\r\n#define ljamalg_c\r\n#define LUA_CORE\r\n\r\n/* To get the mremap prototype. Must be defined before any system includes. */\r\n#if defined(__linux__) && !defined(_GNU_SOURCE)\r\n#define _GNU_SOURCE\r\n#endif\r\n\r\n#ifndef WINVER\r\n#define WINVER 0x0501\r\n#endif\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n\r\n#include \"lj_gc.c\"\r\n#include \"lj_err.c\"\r\n#include \"lj_char.c\"\r\n#include \"lj_bc.c\"\r\n#include \"lj_obj.c\"\r\n#include \"lj_buf.c\"\r\n#include \"lj_str.c\"\r\n#include \"lj_tab.c\"\r\n#include \"lj_func.c\"\r\n#include \"lj_udata.c\"\r\n#include \"lj_meta.c\"\r\n#include \"lj_debug.c\"\r\n#include \"lj_state.c\"\r\n#include \"lj_dispatch.c\"\r\n#include \"lj_vmevent.c\"\r\n#include \"lj_vmmath.c\"\r\n#include \"lj_strscan.c\"\r\n#include \"lj_strfmt.c\"\r\n#include \"lj_api.c\"\r\n#include \"lj_profile.c\"\r\n#include \"lj_lex.c\"\r\n#include \"lj_parse.c\"\r\n#include \"lj_bcread.c\"\r\n#include \"lj_bcwrite.c\"\r\n#include \"lj_load.c\"\r\n#include \"lj_ctype.c\"\r\n#include \"lj_cdata.c\"\r\n#include \"lj_cconv.c\"\r\n#include \"lj_ccall.c\"\r\n#include \"lj_ccallback.c\"\r\n#include \"lj_carith.c\"\r\n#include \"lj_clib.c\"\r\n#include \"lj_cparse.c\"\r\n#include \"lj_lib.c\"\r\n#include \"lj_ir.c\"\r\n#include \"lj_opt_mem.c\"\r\n#include \"lj_opt_fold.c\"\r\n#include \"lj_opt_narrow.c\"\r\n#include \"lj_opt_dce.c\"\r\n#include \"lj_opt_loop.c\"\r\n#include \"lj_opt_split.c\"\r\n#include \"lj_opt_sink.c\"\r\n#include \"lj_mcode.c\"\r\n#include \"lj_snap.c\"\r\n#include \"lj_record.c\"\r\n#include \"lj_crecord.c\"\r\n#include \"lj_ffrecord.c\"\r\n#include \"lj_asm.c\"\r\n#include \"lj_trace.c\"\r\n#include \"lj_gdbjit.c\"\r\n#include \"lj_alloc.c\"\r\n\r\n#include \"lib_aux.c\"\r\n#include \"lib_base.c\"\r\n#include \"lib_math.c\"\r\n#include \"lib_string.c\"\r\n#include \"lib_table.c\"\r\n#include \"lib_io.c\"\r\n#include \"lib_os.c\"\r\n#include \"lib_package.c\"\r\n#include \"lib_debug.c\"\r\n#include \"lib_bit.c\"\r\n#include \"lib_jit.c\"\r\n#include \"lib_ffi.c\"\r\n#include \"lib_init.c\"\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lua.h",
    "content": "/*\r\n** $Id: lua.h,v 1.218.1.5 2008/08/06 13:30:12 roberto Exp $\r\n** Lua - An Extensible Extension Language\r\n** Lua.org, PUC-Rio, Brazil (http://www.lua.org)\r\n** See Copyright Notice at the end of this file\r\n*/\r\n\r\n\r\n#ifndef lua_h\r\n#define lua_h\r\n\r\n#include <stdarg.h>\r\n#include <stddef.h>\r\n\r\n\r\n#include \"luaconf.h\"\r\n\r\n\r\n#define LUA_VERSION\t\"Lua 5.1\"\r\n#define LUA_RELEASE\t\"Lua 5.1.4\"\r\n#define LUA_VERSION_NUM\t501\r\n#define LUA_COPYRIGHT\t\"Copyright (C) 1994-2008 Lua.org, PUC-Rio\"\r\n#define LUA_AUTHORS\t\"R. Ierusalimschy, L. H. de Figueiredo & W. Celes\"\r\n\r\n\r\n/* mark for precompiled code (`<esc>Lua') */\r\n#define\tLUA_SIGNATURE\t\"\\033Lua\"\r\n\r\n/* option for multiple returns in `lua_pcall' and `lua_call' */\r\n#define LUA_MULTRET\t(-1)\r\n\r\n\r\n/*\r\n** pseudo-indices\r\n*/\r\n#define LUA_REGISTRYINDEX\t(-10000)\r\n#define LUA_ENVIRONINDEX\t(-10001)\r\n#define LUA_GLOBALSINDEX\t(-10002)\r\n#define lua_upvalueindex(i)\t(LUA_GLOBALSINDEX-(i))\r\n\r\n\r\n/* thread status; 0 is OK */\r\n#define LUA_YIELD\t1\r\n#define LUA_ERRRUN\t2\r\n#define LUA_ERRSYNTAX\t3\r\n#define LUA_ERRMEM\t4\r\n#define LUA_ERRERR\t5\r\n\r\n\r\ntypedef struct lua_State lua_State;\r\n\r\ntypedef int (*lua_CFunction) (lua_State *L);\r\n\r\n\r\n/*\r\n** functions that read/write blocks when loading/dumping Lua chunks\r\n*/\r\ntypedef const char * (*lua_Reader) (lua_State *L, void *ud, size_t *sz);\r\n\r\ntypedef int (*lua_Writer) (lua_State *L, const void* p, size_t sz, void* ud);\r\n\r\n\r\n/*\r\n** prototype for memory-allocation functions\r\n*/\r\ntypedef void * (*lua_Alloc) (void *ud, void *ptr, size_t osize, size_t nsize);\r\n\r\n\r\n/*\r\n** basic types\r\n*/\r\n#define LUA_TNONE\t\t(-1)\r\n\r\n#define LUA_TNIL\t\t0\r\n#define LUA_TBOOLEAN\t\t1\r\n#define LUA_TLIGHTUSERDATA\t2\r\n#define LUA_TNUMBER\t\t3\r\n#define LUA_TSTRING\t\t4\r\n#define LUA_TTABLE\t\t5\r\n#define LUA_TFUNCTION\t\t6\r\n#define LUA_TUSERDATA\t\t7\r\n#define LUA_TTHREAD\t\t8\r\n\r\n\r\n\r\n/* minimum Lua stack available to a C function */\r\n#define LUA_MINSTACK\t20\r\n\r\n\r\n/*\r\n** generic extra include file\r\n*/\r\n#if defined(LUA_USER_H)\r\n#include LUA_USER_H\r\n#endif\r\n\r\n\r\n/* type of numbers in Lua */\r\ntypedef LUA_NUMBER lua_Number;\r\n\r\n\r\n/* type for integer functions */\r\ntypedef LUA_INTEGER lua_Integer;\r\n\r\n\r\n\r\n/*\r\n** state manipulation\r\n*/\r\nLUA_API lua_State *(lua_newstate) (lua_Alloc f, void *ud);\r\nLUA_API void       (lua_close) (lua_State *L);\r\nLUA_API lua_State *(lua_newthread) (lua_State *L);\r\n\r\nLUA_API lua_CFunction (lua_atpanic) (lua_State *L, lua_CFunction panicf);\r\n\r\n\r\n/*\r\n** basic stack manipulation\r\n*/\r\nLUA_API int   (lua_gettop) (lua_State *L);\r\nLUA_API void  (lua_settop) (lua_State *L, int idx);\r\nLUA_API void  (lua_pushvalue) (lua_State *L, int idx);\r\nLUA_API void  (lua_remove) (lua_State *L, int idx);\r\nLUA_API void  (lua_insert) (lua_State *L, int idx);\r\nLUA_API void  (lua_replace) (lua_State *L, int idx);\r\nLUA_API int   (lua_checkstack) (lua_State *L, int sz);\r\n\r\nLUA_API void  (lua_xmove) (lua_State *from, lua_State *to, int n);\r\n\r\n\r\n/*\r\n** access functions (stack -> C)\r\n*/\r\n\r\nLUA_API int             (lua_isnumber) (lua_State *L, int idx);\r\nLUA_API int             (lua_isstring) (lua_State *L, int idx);\r\nLUA_API int             (lua_iscfunction) (lua_State *L, int idx);\r\nLUA_API int             (lua_isuserdata) (lua_State *L, int idx);\r\nLUA_API int             (lua_type) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_typename) (lua_State *L, int tp);\r\n\r\nLUA_API int            (lua_equal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_rawequal) (lua_State *L, int idx1, int idx2);\r\nLUA_API int            (lua_lessthan) (lua_State *L, int idx1, int idx2);\r\n\r\nLUA_API lua_Number      (lua_tonumber) (lua_State *L, int idx);\r\nLUA_API lua_Integer     (lua_tointeger) (lua_State *L, int idx);\r\nLUA_API int             (lua_toboolean) (lua_State *L, int idx);\r\nLUA_API const char     *(lua_tolstring) (lua_State *L, int idx, size_t *len);\r\nLUA_API size_t          (lua_objlen) (lua_State *L, int idx);\r\nLUA_API lua_CFunction   (lua_tocfunction) (lua_State *L, int idx);\r\nLUA_API void\t       *(lua_touserdata) (lua_State *L, int idx);\r\nLUA_API lua_State      *(lua_tothread) (lua_State *L, int idx);\r\nLUA_API const void     *(lua_topointer) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** push functions (C -> stack)\r\n*/\r\nLUA_API void  (lua_pushnil) (lua_State *L);\r\nLUA_API void  (lua_pushnumber) (lua_State *L, lua_Number n);\r\nLUA_API void  (lua_pushinteger) (lua_State *L, lua_Integer n);\r\nLUA_API void  (lua_pushlstring) (lua_State *L, const char *s, size_t l);\r\nLUA_API void  (lua_pushstring) (lua_State *L, const char *s);\r\nLUA_API const char *(lua_pushvfstring) (lua_State *L, const char *fmt,\r\n                                                      va_list argp);\r\nLUA_API const char *(lua_pushfstring) (lua_State *L, const char *fmt, ...);\r\nLUA_API void  (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);\r\nLUA_API void  (lua_pushboolean) (lua_State *L, int b);\r\nLUA_API void  (lua_pushlightuserdata) (lua_State *L, void *p);\r\nLUA_API int   (lua_pushthread) (lua_State *L);\r\n\r\n\r\n/*\r\n** get functions (Lua -> stack)\r\n*/\r\nLUA_API void  (lua_gettable) (lua_State *L, int idx);\r\nLUA_API void  (lua_getfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawget) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawgeti) (lua_State *L, int idx, int n);\r\nLUA_API void  (lua_createtable) (lua_State *L, int narr, int nrec);\r\nLUA_API void *(lua_newuserdata) (lua_State *L, size_t sz);\r\nLUA_API int   (lua_getmetatable) (lua_State *L, int objindex);\r\nLUA_API void  (lua_getfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** set functions (stack -> Lua)\r\n*/\r\nLUA_API void  (lua_settable) (lua_State *L, int idx);\r\nLUA_API void  (lua_setfield) (lua_State *L, int idx, const char *k);\r\nLUA_API void  (lua_rawset) (lua_State *L, int idx);\r\nLUA_API void  (lua_rawseti) (lua_State *L, int idx, int n);\r\nLUA_API int   (lua_setmetatable) (lua_State *L, int objindex);\r\nLUA_API int   (lua_setfenv) (lua_State *L, int idx);\r\n\r\n\r\n/*\r\n** `load' and `call' functions (load and run Lua code)\r\n*/\r\nLUA_API void  (lua_call) (lua_State *L, int nargs, int nresults);\r\nLUA_API int   (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);\r\nLUA_API int   (lua_cpcall) (lua_State *L, lua_CFunction func, void *ud);\r\nLUA_API int   (lua_load) (lua_State *L, lua_Reader reader, void *dt,\r\n                                        const char *chunkname);\r\n\r\nLUA_API int (lua_dump) (lua_State *L, lua_Writer writer, void *data);\r\n\r\n\r\n/*\r\n** coroutine functions\r\n*/\r\nLUA_API int  (lua_yield) (lua_State *L, int nresults);\r\nLUA_API int  (lua_resume) (lua_State *L, int narg);\r\nLUA_API int  (lua_status) (lua_State *L);\r\n\r\n/*\r\n** garbage-collection function and options\r\n*/\r\n\r\n#define LUA_GCSTOP\t\t0\r\n#define LUA_GCRESTART\t\t1\r\n#define LUA_GCCOLLECT\t\t2\r\n#define LUA_GCCOUNT\t\t3\r\n#define LUA_GCCOUNTB\t\t4\r\n#define LUA_GCSTEP\t\t5\r\n#define LUA_GCSETPAUSE\t\t6\r\n#define LUA_GCSETSTEPMUL\t7\r\n\r\nLUA_API int (lua_gc) (lua_State *L, int what, int data);\r\n\r\n\r\n/*\r\n** miscellaneous functions\r\n*/\r\n\r\nLUA_API int   (lua_error) (lua_State *L);\r\n\r\nLUA_API int   (lua_next) (lua_State *L, int idx);\r\n\r\nLUA_API void  (lua_concat) (lua_State *L, int n);\r\n\r\nLUA_API lua_Alloc (lua_getallocf) (lua_State *L, void **ud);\r\nLUA_API void lua_setallocf (lua_State *L, lua_Alloc f, void *ud);\r\n\r\n\r\n\r\n/*\r\n** ===============================================================\r\n** some useful macros\r\n** ===============================================================\r\n*/\r\n\r\n#define lua_pop(L,n)\t\tlua_settop(L, -(n)-1)\r\n\r\n#define lua_newtable(L)\t\tlua_createtable(L, 0, 0)\r\n\r\n#define lua_register(L,n,f) (lua_pushcfunction(L, (f)), lua_setglobal(L, (n)))\r\n\r\n#define lua_pushcfunction(L,f)\tlua_pushcclosure(L, (f), 0)\r\n\r\n#define lua_strlen(L,i)\t\tlua_objlen(L, (i))\r\n\r\n#define lua_isfunction(L,n)\t(lua_type(L, (n)) == LUA_TFUNCTION)\r\n#define lua_istable(L,n)\t(lua_type(L, (n)) == LUA_TTABLE)\r\n#define lua_islightuserdata(L,n)\t(lua_type(L, (n)) == LUA_TLIGHTUSERDATA)\r\n#define lua_isnil(L,n)\t\t(lua_type(L, (n)) == LUA_TNIL)\r\n#define lua_isboolean(L,n)\t(lua_type(L, (n)) == LUA_TBOOLEAN)\r\n#define lua_isthread(L,n)\t(lua_type(L, (n)) == LUA_TTHREAD)\r\n#define lua_isnone(L,n)\t\t(lua_type(L, (n)) == LUA_TNONE)\r\n#define lua_isnoneornil(L, n)\t(lua_type(L, (n)) <= 0)\r\n\r\n#define lua_pushliteral(L, s)\t\\\r\n\tlua_pushlstring(L, \"\" s, (sizeof(s)/sizeof(char))-1)\r\n\r\n#define lua_setglobal(L,s)\tlua_setfield(L, LUA_GLOBALSINDEX, (s))\r\n#define lua_getglobal(L,s)\tlua_getfield(L, LUA_GLOBALSINDEX, (s))\r\n\r\n#define lua_tostring(L,i)\tlua_tolstring(L, (i), NULL)\r\n\r\n\r\n\r\n/*\r\n** compatibility macros and functions\r\n*/\r\n\r\n#define lua_open()\tluaL_newstate()\r\n\r\n#define lua_getregistry(L)\tlua_pushvalue(L, LUA_REGISTRYINDEX)\r\n\r\n#define lua_getgccount(L)\tlua_gc(L, LUA_GCCOUNT, 0)\r\n\r\n#define lua_Chunkreader\t\tlua_Reader\r\n#define lua_Chunkwriter\t\tlua_Writer\r\n\r\n\r\n/* hack */\r\nLUA_API void lua_setlevel\t(lua_State *from, lua_State *to);\r\n\r\n\r\n/*\r\n** {======================================================================\r\n** Debug API\r\n** =======================================================================\r\n*/\r\n\r\n\r\n/*\r\n** Event codes\r\n*/\r\n#define LUA_HOOKCALL\t0\r\n#define LUA_HOOKRET\t1\r\n#define LUA_HOOKLINE\t2\r\n#define LUA_HOOKCOUNT\t3\r\n#define LUA_HOOKTAILRET 4\r\n\r\n\r\n/*\r\n** Event masks\r\n*/\r\n#define LUA_MASKCALL\t(1 << LUA_HOOKCALL)\r\n#define LUA_MASKRET\t(1 << LUA_HOOKRET)\r\n#define LUA_MASKLINE\t(1 << LUA_HOOKLINE)\r\n#define LUA_MASKCOUNT\t(1 << LUA_HOOKCOUNT)\r\n\r\ntypedef struct lua_Debug lua_Debug;  /* activation record */\r\n\r\n\r\n/* Functions to be called by the debuger in specific events */\r\ntypedef void (*lua_Hook) (lua_State *L, lua_Debug *ar);\r\n\r\n\r\nLUA_API int lua_getstack (lua_State *L, int level, lua_Debug *ar);\r\nLUA_API int lua_getinfo (lua_State *L, const char *what, lua_Debug *ar);\r\nLUA_API const char *lua_getlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_setlocal (lua_State *L, const lua_Debug *ar, int n);\r\nLUA_API const char *lua_getupvalue (lua_State *L, int funcindex, int n);\r\nLUA_API const char *lua_setupvalue (lua_State *L, int funcindex, int n);\r\nLUA_API int lua_sethook (lua_State *L, lua_Hook func, int mask, int count);\r\nLUA_API lua_Hook lua_gethook (lua_State *L);\r\nLUA_API int lua_gethookmask (lua_State *L);\r\nLUA_API int lua_gethookcount (lua_State *L);\r\n\r\n/* From Lua 5.2. */\r\nLUA_API void *lua_upvalueid (lua_State *L, int idx, int n);\r\nLUA_API void lua_upvaluejoin (lua_State *L, int idx1, int n1, int idx2, int n2);\r\nLUA_API int lua_loadx (lua_State *L, lua_Reader reader, void *dt,\r\n\t\t       const char *chunkname, const char *mode);\r\n\r\n\r\nstruct lua_Debug {\r\n  int event;\r\n  const char *name;\t/* (n) */\r\n  const char *namewhat;\t/* (n) `global', `local', `field', `method' */\r\n  const char *what;\t/* (S) `Lua', `C', `main', `tail' */\r\n  const char *source;\t/* (S) */\r\n  int currentline;\t/* (l) */\r\n  int nups;\t\t/* (u) number of upvalues */\r\n  int linedefined;\t/* (S) */\r\n  int lastlinedefined;\t/* (S) */\r\n  char short_src[LUA_IDSIZE]; /* (S) */\r\n  /* private part */\r\n  int i_ci;  /* active function */\r\n};\r\n\r\n/* }====================================================================== */\r\n\r\n\r\n/******************************************************************************\r\n* Copyright (C) 1994-2008 Lua.org, PUC-Rio.  All rights reserved.\r\n*\r\n* Permission is hereby granted, free of charge, to any person obtaining\r\n* a copy of this software and associated documentation files (the\r\n* \"Software\"), to deal in the Software without restriction, including\r\n* without limitation the rights to use, copy, modify, merge, publish,\r\n* distribute, sublicense, and/or sell copies of the Software, and to\r\n* permit persons to whom the Software is furnished to do so, subject to\r\n* the following conditions:\r\n*\r\n* The above copyright notice and this permission notice shall be\r\n* included in all copies or substantial portions of the Software.\r\n*\r\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n******************************************************************************/\r\n\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lua.hpp",
    "content": "// C++ wrapper for LuaJIT header files.\r\n\r\nextern \"C\" {\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n#include \"luajit.h\"\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/luaconf.h",
    "content": "/*\r\n** Configuration header.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef luaconf_h\r\n#define luaconf_h\r\n\r\n#ifndef WINVER\r\n#define WINVER 0x0501\r\n#endif\r\n#include <limits.h>\r\n#include <stddef.h>\r\n\r\n/* Default path for loading Lua and C modules with require(). */\r\n#if defined(_WIN32)\r\n/*\r\n** In Windows, any exclamation mark ('!') in the path is replaced by the\r\n** path of the directory of the executable file of the current process.\r\n*/\r\n#define LUA_LDIR\t\"!\\\\lua\\\\\"\r\n#define LUA_CDIR\t\"!\\\\\"\r\n#define LUA_PATH_DEFAULT \\\r\n  \".\\\\?.lua;\" LUA_LDIR\"?.lua;\" LUA_LDIR\"?\\\\init.lua;\"\r\n#define LUA_CPATH_DEFAULT \\\r\n  \".\\\\?.dll;\" LUA_CDIR\"?.dll;\" LUA_CDIR\"loadall.dll\"\r\n#else\r\n/*\r\n** Note to distribution maintainers: do NOT patch the following lines!\r\n** Please read ../doc/install.html#distro and pass PREFIX=/usr instead.\r\n*/\r\n#ifndef LUA_MULTILIB\r\n#define LUA_MULTILIB\t\"lib\"\r\n#endif\r\n#ifndef LUA_LMULTILIB\r\n#define LUA_LMULTILIB\t\"lib\"\r\n#endif\r\n#define LUA_LROOT\t\"/usr/local\"\r\n#define LUA_LUADIR\t\"/lua/5.1/\"\r\n#define LUA_LJDIR\t\"/luajit-2.1.0-beta1/\"\r\n\r\n#ifdef LUA_ROOT\r\n#define LUA_JROOT\tLUA_ROOT\r\n#define LUA_RLDIR\tLUA_ROOT \"/share\" LUA_LUADIR\r\n#define LUA_RCDIR\tLUA_ROOT \"/\" LUA_MULTILIB LUA_LUADIR\r\n#define LUA_RLPATH\t\";\" LUA_RLDIR \"?.lua;\" LUA_RLDIR \"?/init.lua\"\r\n#define LUA_RCPATH\t\";\" LUA_RCDIR \"?.so\"\r\n#else\r\n#define LUA_JROOT\tLUA_LROOT\r\n#define LUA_RLPATH\r\n#define LUA_RCPATH\r\n#endif\r\n\r\n#define LUA_JPATH\t\";\" LUA_JROOT \"/share\" LUA_LJDIR \"?.lua\"\r\n#define LUA_LLDIR\tLUA_LROOT \"/share\" LUA_LUADIR\r\n#define LUA_LCDIR\tLUA_LROOT \"/\" LUA_LMULTILIB LUA_LUADIR\r\n#define LUA_LLPATH\t\";\" LUA_LLDIR \"?.lua;\" LUA_LLDIR \"?/init.lua\"\r\n#define LUA_LCPATH1\t\";\" LUA_LCDIR \"?.so\"\r\n#define LUA_LCPATH2\t\";\" LUA_LCDIR \"loadall.so\"\r\n\r\n#define LUA_PATH_DEFAULT\t\"./?.lua\" LUA_JPATH LUA_LLPATH LUA_RLPATH\r\n#define LUA_CPATH_DEFAULT\t\"./?.so\" LUA_LCPATH1 LUA_RCPATH LUA_LCPATH2\r\n#endif\r\n\r\n/* Environment variable names for path overrides and initialization code. */\r\n#define LUA_PATH\t\"LUA_PATH\"\r\n#define LUA_CPATH\t\"LUA_CPATH\"\r\n#define LUA_INIT\t\"LUA_INIT\"\r\n\r\n/* Special file system characters. */\r\n#if defined(_WIN32)\r\n#define LUA_DIRSEP\t\"\\\\\"\r\n#else\r\n#define LUA_DIRSEP\t\"/\"\r\n#endif\r\n#define LUA_PATHSEP\t\";\"\r\n#define LUA_PATH_MARK\t\"?\"\r\n#define LUA_EXECDIR\t\"!\"\r\n#define LUA_IGMARK\t\"-\"\r\n#define LUA_PATH_CONFIG \\\r\n  LUA_DIRSEP \"\\n\" LUA_PATHSEP \"\\n\" LUA_PATH_MARK \"\\n\" \\\r\n  LUA_EXECDIR \"\\n\" LUA_IGMARK\r\n\r\n/* Quoting in error messages. */\r\n#define LUA_QL(x)\t\"'\" x \"'\"\r\n#define LUA_QS\t\tLUA_QL(\"%s\")\r\n\r\n/* Various tunables. */\r\n#define LUAI_MAXSTACK\t65500\t/* Max. # of stack slots for a thread (<64K). */\r\n#define LUAI_MAXCSTACK\t8000\t/* Max. # of stack slots for a C func (<10K). */\r\n#define LUAI_GCPAUSE\t200\t/* Pause GC until memory is at 200%. */\r\n#define LUAI_GCMUL\t200\t/* Run GC at 200% of allocation speed. */\r\n#define LUA_MAXCAPTURES\t32\t/* Max. pattern captures. */\r\n\r\n/* Compatibility with older library function names. */\r\n#define LUA_COMPAT_MOD\t\t/* OLD: math.mod, NEW: math.fmod */\r\n#define LUA_COMPAT_GFIND\t/* OLD: string.gfind, NEW: string.gmatch */\r\n\r\n/* Configuration for the frontend (the luajit executable). */\r\n#if defined(luajit_c)\r\n#define LUA_PROGNAME\t\"luajit\"  /* Fallback frontend name. */\r\n#define LUA_PROMPT\t\"> \"\t/* Interactive prompt. */\r\n#define LUA_PROMPT2\t\">> \"\t/* Continuation prompt. */\r\n#define LUA_MAXINPUT\t512\t/* Max. input line length. */\r\n#endif\r\n\r\n/* Note: changing the following defines breaks the Lua 5.1 ABI. */\r\n#define LUA_INTEGER\tptrdiff_t\r\n#define LUA_IDSIZE\t150\t/* Size of lua_Debug.short_src. */\r\n/*\r\n** Size of lauxlib and io.* on-stack buffers. Weird workaround to avoid using\r\n** unreasonable amounts of stack space, but still retain ABI compatibility.\r\n** Blame Lua for depending on BUFSIZ in the ABI, blame **** for wrecking it.\r\n*/\r\n#define LUAL_BUFFERSIZE\t(BUFSIZ > 16384 ? 8192 : BUFSIZ)\r\n\r\n/* The following defines are here only for compatibility with luaconf.h\r\n** from the standard Lua distribution. They must not be changed for LuaJIT.\r\n*/\r\n#define LUA_NUMBER_DOUBLE\r\n#define LUA_NUMBER\t\tdouble\r\n#define LUAI_UACNUMBER\t\tdouble\r\n#define LUA_NUMBER_SCAN\t\t\"%lf\"\r\n#define LUA_NUMBER_FMT\t\t\"%.14g\"\r\n#define lua_number2str(s, n)\tsprintf((s), LUA_NUMBER_FMT, (n))\r\n#define LUAI_MAXNUMBER2STR\t32\r\n#define LUA_INTFRMLEN\t\t\"l\"\r\n#define LUA_INTFRM_T\t\tlong\r\n\r\n/* Linkage of public API functions. */\r\n#if defined(LUA_BUILD_AS_DLL)\r\n#if defined(LUA_CORE) || defined(LUA_LIB)\r\n#define LUA_API\t\t__declspec(dllexport)\r\n#else\r\n#define LUA_API\t\t__declspec(dllimport)\r\n#endif\r\n#else\r\n#define LUA_API\t\textern\r\n#endif\r\n\r\n#define LUALIB_API\tLUA_API\r\n\r\n/* Support for internal assertions. */\r\n#if defined(LUA_USE_ASSERT) || defined(LUA_USE_APICHECK)\r\n#include <assert.h>\r\n#endif\r\n#ifdef LUA_USE_ASSERT\r\n#define lua_assert(x)\t\tassert(x)\r\n#endif\r\n#ifdef LUA_USE_APICHECK\r\n#define luai_apicheck(L, o)\t{ (void)L; assert(o); }\r\n#else\r\n#define luai_apicheck(L, o)\t{ (void)L; }\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/luajit.c",
    "content": "/*\r\n** LuaJIT frontend. Runs commands, scripts, read-eval-print (REPL) etc.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n**\r\n** Major portions taken verbatim or adapted from the Lua interpreter.\r\n** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h\r\n*/\r\n\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n#define luajit_c\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include \"lualib.h\"\r\n#include \"luajit.h\"\r\n\r\n#include \"lj_arch.h\"\r\n\r\n#if LJ_TARGET_POSIX\r\n#include <unistd.h>\r\n#define lua_stdin_is_tty()\tisatty(0)\r\n#elif LJ_TARGET_WINDOWS\r\n#include <io.h>\r\n#ifdef __BORLANDC__\r\n#define lua_stdin_is_tty()\tisatty(_fileno(stdin))\r\n#else\r\n#define lua_stdin_is_tty()\t_isatty(_fileno(stdin))\r\n#endif\r\n#else\r\n#define lua_stdin_is_tty()\t1\r\n#endif\r\n\r\n#if !LJ_TARGET_CONSOLE\r\n#include <signal.h>\r\n#endif\r\n\r\nstatic lua_State *globalL = NULL;\r\nstatic const char *progname = LUA_PROGNAME;\r\n\r\n#if !LJ_TARGET_CONSOLE\r\nstatic void lstop(lua_State *L, lua_Debug *ar)\r\n{\r\n  (void)ar;  /* unused arg. */\r\n  lua_sethook(L, NULL, 0, 0);\r\n  /* Avoid luaL_error -- a C hook doesn't add an extra frame. */\r\n  luaL_where(L, 0);\r\n  lua_pushfstring(L, \"%sinterrupted!\", lua_tostring(L, -1));\r\n  lua_error(L);\r\n}\r\n\r\nstatic void laction(int i)\r\n{\r\n  signal(i, SIG_DFL); /* if another SIGINT happens before lstop,\r\n\t\t\t terminate process (default action) */\r\n  lua_sethook(globalL, lstop, LUA_MASKCALL | LUA_MASKRET | LUA_MASKCOUNT, 1);\r\n}\r\n#endif\r\n\r\nstatic void print_usage(void)\r\n{\r\n  fputs(\"usage: \", stderr);\r\n  fputs(progname, stderr);\r\n  fputs(\" [options]... [script [args]...].\\n\"\r\n  \"Available options are:\\n\"\r\n  \"  -e chunk  Execute string \" LUA_QL(\"chunk\") \".\\n\"\r\n  \"  -l name   Require library \" LUA_QL(\"name\") \".\\n\"\r\n  \"  -b ...    Save or list bytecode.\\n\"\r\n  \"  -j cmd    Perform LuaJIT control command.\\n\"\r\n  \"  -O[opt]   Control LuaJIT optimizations.\\n\"\r\n  \"  -i        Enter interactive mode after executing \" LUA_QL(\"script\") \".\\n\"\r\n  \"  -v        Show version information.\\n\"\r\n  \"  -E        Ignore environment variables.\\n\"\r\n  \"  --        Stop handling options.\\n\"\r\n  \"  -         Execute stdin and stop handling options.\\n\", stderr);\r\n  fflush(stderr);\r\n}\r\n\r\nstatic void l_message(const char *pname, const char *msg)\r\n{\r\n  if (pname) { fputs(pname, stderr); fputc(':', stderr); fputc(' ', stderr); }\r\n  fputs(msg, stderr); fputc('\\n', stderr);\r\n  fflush(stderr);\r\n}\r\n\r\nstatic int report(lua_State *L, int status)\r\n{\r\n  if (status && !lua_isnil(L, -1)) {\r\n    const char *msg = lua_tostring(L, -1);\r\n    if (msg == NULL) msg = \"(error object is not a string)\";\r\n    l_message(progname, msg);\r\n    lua_pop(L, 1);\r\n  }\r\n  return status;\r\n}\r\n\r\nstatic int traceback(lua_State *L)\r\n{\r\n  if (!lua_isstring(L, 1)) { /* Non-string error object? Try metamethod. */\r\n    if (lua_isnoneornil(L, 1) ||\r\n\t!luaL_callmeta(L, 1, \"__tostring\") ||\r\n\t!lua_isstring(L, -1))\r\n      return 1;  /* Return non-string error object. */\r\n    lua_remove(L, 1);  /* Replace object by result of __tostring metamethod. */\r\n  }\r\n  luaL_traceback(L, L, lua_tostring(L, 1), 1);\r\n  return 1;\r\n}\r\n\r\nstatic int docall(lua_State *L, int narg, int clear)\r\n{\r\n  int status;\r\n  int base = lua_gettop(L) - narg;  /* function index */\r\n  lua_pushcfunction(L, traceback);  /* push traceback function */\r\n  lua_insert(L, base);  /* put it under chunk and args */\r\n#if !LJ_TARGET_CONSOLE\r\n  signal(SIGINT, laction);\r\n#endif\r\n  status = lua_pcall(L, narg, (clear ? 0 : LUA_MULTRET), base);\r\n#if !LJ_TARGET_CONSOLE\r\n  signal(SIGINT, SIG_DFL);\r\n#endif\r\n  lua_remove(L, base);  /* remove traceback function */\r\n  /* force a complete garbage collection in case of errors */\r\n  if (status != 0) lua_gc(L, LUA_GCCOLLECT, 0);\r\n  return status;\r\n}\r\n\r\nstatic void print_version(void)\r\n{\r\n  fputs(LUAJIT_VERSION \" -- \" LUAJIT_COPYRIGHT \". \" LUAJIT_URL \"\\n\", stdout);\r\n}\r\n\r\nstatic void print_jit_status(lua_State *L)\r\n{\r\n  int n;\r\n  const char *s;\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit\");  /* Get jit.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_getfield(L, -1, \"status\");\r\n  lua_remove(L, -2);\r\n  n = lua_gettop(L);\r\n  lua_call(L, 0, LUA_MULTRET);\r\n  fputs(lua_toboolean(L, n) ? \"JIT: ON\" : \"JIT: OFF\", stdout);\r\n  for (n++; (s = lua_tostring(L, n)); n++) {\r\n    putc(' ', stdout);\r\n    fputs(s, stdout);\r\n  }\r\n  putc('\\n', stdout);\r\n}\r\n\r\nstatic int getargs(lua_State *L, char **argv, int n)\r\n{\r\n  int narg;\r\n  int i;\r\n  int argc = 0;\r\n  while (argv[argc]) argc++;  /* count total number of arguments */\r\n  narg = argc - (n + 1);  /* number of arguments to the script */\r\n  luaL_checkstack(L, narg + 3, \"too many arguments to script\");\r\n  for (i = n+1; i < argc; i++)\r\n    lua_pushstring(L, argv[i]);\r\n  lua_createtable(L, narg, n + 1);\r\n  for (i = 0; i < argc; i++) {\r\n    lua_pushstring(L, argv[i]);\r\n    lua_rawseti(L, -2, i - n);\r\n  }\r\n  return narg;\r\n}\r\n\r\nstatic int dofile(lua_State *L, const char *name)\r\n{\r\n  int status = luaL_loadfile(L, name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\nstatic int dostring(lua_State *L, const char *s, const char *name)\r\n{\r\n  int status = luaL_loadbuffer(L, s, strlen(s), name) || docall(L, 0, 1);\r\n  return report(L, status);\r\n}\r\n\r\nstatic int dolibrary(lua_State *L, const char *name)\r\n{\r\n  lua_getglobal(L, \"require\");\r\n  lua_pushstring(L, name);\r\n  return report(L, docall(L, 1, 1));\r\n}\r\n\r\nstatic void write_prompt(lua_State *L, int firstline)\r\n{\r\n  const char *p;\r\n  lua_getfield(L, LUA_GLOBALSINDEX, firstline ? \"_PROMPT\" : \"_PROMPT2\");\r\n  p = lua_tostring(L, -1);\r\n  if (p == NULL) p = firstline ? LUA_PROMPT : LUA_PROMPT2;\r\n  fputs(p, stdout);\r\n  fflush(stdout);\r\n  lua_pop(L, 1);  /* remove global */\r\n}\r\n\r\nstatic int incomplete(lua_State *L, int status)\r\n{\r\n  if (status == LUA_ERRSYNTAX) {\r\n    size_t lmsg;\r\n    const char *msg = lua_tolstring(L, -1, &lmsg);\r\n    const char *tp = msg + lmsg - (sizeof(LUA_QL(\"<eof>\")) - 1);\r\n    if (strstr(msg, LUA_QL(\"<eof>\")) == tp) {\r\n      lua_pop(L, 1);\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;  /* else... */\r\n}\r\n\r\nstatic int pushline(lua_State *L, int firstline)\r\n{\r\n  char buf[LUA_MAXINPUT];\r\n  write_prompt(L, firstline);\r\n  if (fgets(buf, LUA_MAXINPUT, stdin)) {\r\n    size_t len = strlen(buf);\r\n    if (len > 0 && buf[len-1] == '\\n')\r\n      buf[len-1] = '\\0';\r\n    if (firstline && buf[0] == '=')\r\n      lua_pushfstring(L, \"return %s\", buf+1);\r\n    else\r\n      lua_pushstring(L, buf);\r\n    return 1;\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int loadline(lua_State *L)\r\n{\r\n  int status;\r\n  lua_settop(L, 0);\r\n  if (!pushline(L, 1))\r\n    return -1;  /* no input */\r\n  for (;;) {  /* repeat until gets a complete line */\r\n    status = luaL_loadbuffer(L, lua_tostring(L, 1), lua_strlen(L, 1), \"=stdin\");\r\n    if (!incomplete(L, status)) break;  /* cannot try to add lines? */\r\n    if (!pushline(L, 0))  /* no more input? */\r\n      return -1;\r\n    lua_pushliteral(L, \"\\n\");  /* add a new line... */\r\n    lua_insert(L, -2);  /* ...between the two lines */\r\n    lua_concat(L, 3);  /* join them */\r\n  }\r\n  lua_remove(L, 1);  /* remove line */\r\n  return status;\r\n}\r\n\r\nstatic void dotty(lua_State *L)\r\n{\r\n  int status;\r\n  const char *oldprogname = progname;\r\n  progname = NULL;\r\n  while ((status = loadline(L)) != -1) {\r\n    if (status == 0) status = docall(L, 0, 0);\r\n    report(L, status);\r\n    if (status == 0 && lua_gettop(L) > 0) {  /* any result to print? */\r\n      lua_getglobal(L, \"print\");\r\n      lua_insert(L, 1);\r\n      if (lua_pcall(L, lua_gettop(L)-1, 0, 0) != 0)\r\n\tl_message(progname,\r\n\t  lua_pushfstring(L, \"error calling \" LUA_QL(\"print\") \" (%s)\",\r\n\t\t\t      lua_tostring(L, -1)));\r\n    }\r\n  }\r\n  lua_settop(L, 0);  /* clear stack */\r\n  fputs(\"\\n\", stdout);\r\n  fflush(stdout);\r\n  progname = oldprogname;\r\n}\r\n\r\nstatic int handle_script(lua_State *L, char **argv, int n)\r\n{\r\n  int status;\r\n  const char *fname;\r\n  int narg = getargs(L, argv, n);  /* collect arguments */\r\n  lua_setglobal(L, \"arg\");\r\n  fname = argv[n];\r\n  if (strcmp(fname, \"-\") == 0 && strcmp(argv[n-1], \"--\") != 0)\r\n    fname = NULL;  /* stdin */\r\n  status = luaL_loadfile(L, fname);\r\n  lua_insert(L, -(narg+1));\r\n  if (status == 0)\r\n    status = docall(L, narg, 0);\r\n  else\r\n    lua_pop(L, narg);\r\n  return report(L, status);\r\n}\r\n\r\n/* Load add-on module. */\r\nstatic int loadjitmodule(lua_State *L)\r\n{\r\n  lua_getglobal(L, \"require\");\r\n  lua_pushliteral(L, \"jit.\");\r\n  lua_pushvalue(L, -3);\r\n  lua_concat(L, 2);\r\n  if (lua_pcall(L, 1, 1, 0)) {\r\n    const char *msg = lua_tostring(L, -1);\r\n    if (msg && !strncmp(msg, \"module \", 7))\r\n      goto nomodule;\r\n    return report(L, 1);\r\n  }\r\n  lua_getfield(L, -1, \"start\");\r\n  if (lua_isnil(L, -1)) {\r\n  nomodule:\r\n    l_message(progname,\r\n\t      \"unknown luaJIT command or jit.* modules not installed\");\r\n    return 1;\r\n  }\r\n  lua_remove(L, -2);  /* Drop module table. */\r\n  return 0;\r\n}\r\n\r\n/* Run command with options. */\r\nstatic int runcmdopt(lua_State *L, const char *opt)\r\n{\r\n  int narg = 0;\r\n  if (opt && *opt) {\r\n    for (;;) {  /* Split arguments. */\r\n      const char *p = strchr(opt, ',');\r\n      narg++;\r\n      if (!p) break;\r\n      if (p == opt)\r\n\tlua_pushnil(L);\r\n      else\r\n\tlua_pushlstring(L, opt, (size_t)(p - opt));\r\n      opt = p + 1;\r\n    }\r\n    if (*opt)\r\n      lua_pushstring(L, opt);\r\n    else\r\n      lua_pushnil(L);\r\n  }\r\n  return report(L, lua_pcall(L, narg, 0, 0));\r\n}\r\n\r\n/* JIT engine control command: try jit library first or load add-on module. */\r\nstatic int dojitcmd(lua_State *L, const char *cmd)\r\n{\r\n  const char *opt = strchr(cmd, '=');\r\n  lua_pushlstring(L, cmd, opt ? (size_t)(opt - cmd) : strlen(cmd));\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit\");  /* Get jit.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_pushvalue(L, -2);\r\n  lua_gettable(L, -2);  /* Lookup library function. */\r\n  if (!lua_isfunction(L, -1)) {\r\n    lua_pop(L, 2);  /* Drop non-function and jit.* table, keep module name. */\r\n    if (loadjitmodule(L))\r\n      return 1;\r\n  } else {\r\n    lua_remove(L, -2);  /* Drop jit.* table. */\r\n  }\r\n  lua_remove(L, -2);  /* Drop module name. */\r\n  return runcmdopt(L, opt ? opt+1 : opt);\r\n}\r\n\r\n/* Optimization flags. */\r\nstatic int dojitopt(lua_State *L, const char *opt)\r\n{\r\n  lua_getfield(L, LUA_REGISTRYINDEX, \"_LOADED\");\r\n  lua_getfield(L, -1, \"jit.opt\");  /* Get jit.opt.* module table. */\r\n  lua_remove(L, -2);\r\n  lua_getfield(L, -1, \"start\");\r\n  lua_remove(L, -2);\r\n  return runcmdopt(L, opt);\r\n}\r\n\r\n/* Save or list bytecode. */\r\nstatic int dobytecode(lua_State *L, char **argv)\r\n{\r\n  int narg = 0;\r\n  lua_pushliteral(L, \"bcsave\");\r\n  if (loadjitmodule(L))\r\n    return 1;\r\n  if (argv[0][2]) {\r\n    narg++;\r\n    argv[0][1] = '-';\r\n    lua_pushstring(L, argv[0]+1);\r\n  }\r\n  for (argv++; *argv != NULL; narg++, argv++)\r\n    lua_pushstring(L, *argv);\r\n  return report(L, lua_pcall(L, narg, 0, 0));\r\n}\r\n\r\n/* check that argument has no extra characters at the end */\r\n#define notail(x)\t{if ((x)[2] != '\\0') return -1;}\r\n\r\n#define FLAGS_INTERACTIVE\t1\r\n#define FLAGS_VERSION\t\t2\r\n#define FLAGS_EXEC\t\t4\r\n#define FLAGS_OPTION\t\t8\r\n#define FLAGS_NOENV\t\t16\r\n\r\nstatic int collectargs(char **argv, int *flags)\r\n{\r\n  int i;\r\n  for (i = 1; argv[i] != NULL; i++) {\r\n    if (argv[i][0] != '-')  /* Not an option? */\r\n      return i;\r\n    switch (argv[i][1]) {  /* Check option. */\r\n    case '-':\r\n      notail(argv[i]);\r\n      return (argv[i+1] != NULL ? i+1 : 0);\r\n    case '\\0':\r\n      return i;\r\n    case 'i':\r\n      notail(argv[i]);\r\n      *flags |= FLAGS_INTERACTIVE;\r\n      /* fallthrough */\r\n    case 'v':\r\n      notail(argv[i]);\r\n      *flags |= FLAGS_VERSION;\r\n      break;\r\n    case 'e':\r\n      *flags |= FLAGS_EXEC;\r\n    case 'j':  /* LuaJIT extension */\r\n    case 'l':\r\n      *flags |= FLAGS_OPTION;\r\n      if (argv[i][2] == '\\0') {\r\n\ti++;\r\n\tif (argv[i] == NULL) return -1;\r\n      }\r\n      break;\r\n    case 'O': break;  /* LuaJIT extension */\r\n    case 'b':  /* LuaJIT extension */\r\n      if (*flags) return -1;\r\n      *flags |= FLAGS_EXEC;\r\n      return 0;\r\n    case 'E':\r\n      *flags |= FLAGS_NOENV;\r\n      break;\r\n    default: return -1;  /* invalid option */\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int runargs(lua_State *L, char **argv, int n)\r\n{\r\n  int i;\r\n  for (i = 1; i < n; i++) {\r\n    if (argv[i] == NULL) continue;\r\n    lua_assert(argv[i][0] == '-');\r\n    switch (argv[i][1]) {  /* option */\r\n    case 'e': {\r\n      const char *chunk = argv[i] + 2;\r\n      if (*chunk == '\\0') chunk = argv[++i];\r\n      lua_assert(chunk != NULL);\r\n      if (dostring(L, chunk, \"=(command line)\") != 0)\r\n\treturn 1;\r\n      break;\r\n      }\r\n    case 'l': {\r\n      const char *filename = argv[i] + 2;\r\n      if (*filename == '\\0') filename = argv[++i];\r\n      lua_assert(filename != NULL);\r\n      if (dolibrary(L, filename))\r\n\treturn 1;  /* stop if file fails */\r\n      break;\r\n      }\r\n    case 'j': {  /* LuaJIT extension */\r\n      const char *cmd = argv[i] + 2;\r\n      if (*cmd == '\\0') cmd = argv[++i];\r\n      lua_assert(cmd != NULL);\r\n      if (dojitcmd(L, cmd))\r\n\treturn 1;\r\n      break;\r\n      }\r\n    case 'O':  /* LuaJIT extension */\r\n      if (dojitopt(L, argv[i] + 2))\r\n\treturn 1;\r\n      break;\r\n    case 'b':  /* LuaJIT extension */\r\n      return dobytecode(L, argv+i);\r\n    default: break;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nstatic int handle_luainit(lua_State *L)\r\n{\r\n#if LJ_TARGET_CONSOLE\r\n  const char *init = NULL;\r\n#else\r\n  const char *init = getenv(LUA_INIT);\r\n#endif\r\n  if (init == NULL)\r\n    return 0;  /* status OK */\r\n  else if (init[0] == '@')\r\n    return dofile(L, init+1);\r\n  else\r\n    return dostring(L, init, \"=\" LUA_INIT);\r\n}\r\n\r\nstatic struct Smain {\r\n  char **argv;\r\n  int argc;\r\n  int status;\r\n} smain;\r\n\r\nstatic int pmain(lua_State *L)\r\n{\r\n  struct Smain *s = &smain;\r\n  char **argv = s->argv;\r\n  int script;\r\n  int flags = 0;\r\n  globalL = L;\r\n  if (argv[0] && argv[0][0]) progname = argv[0];\r\n  LUAJIT_VERSION_SYM();  /* linker-enforced version check */\r\n  script = collectargs(argv, &flags);\r\n  if (script < 0) {  /* invalid args? */\r\n    print_usage();\r\n    s->status = 1;\r\n    return 0;\r\n  }\r\n  if ((flags & FLAGS_NOENV)) {\r\n    lua_pushboolean(L, 1);\r\n    lua_setfield(L, LUA_REGISTRYINDEX, \"LUA_NOENV\");\r\n  }\r\n  lua_gc(L, LUA_GCSTOP, 0);  /* stop collector during initialization */\r\n  luaL_openlibs(L);  /* open libraries */\r\n  lua_gc(L, LUA_GCRESTART, -1);\r\n  if (!(flags & FLAGS_NOENV)) {\r\n    s->status = handle_luainit(L);\r\n    if (s->status != 0) return 0;\r\n  }\r\n  if ((flags & FLAGS_VERSION)) print_version();\r\n  s->status = runargs(L, argv, (script > 0) ? script : s->argc);\r\n  if (s->status != 0) return 0;\r\n  if (script) {\r\n    s->status = handle_script(L, argv, script);\r\n    if (s->status != 0) return 0;\r\n  }\r\n  if ((flags & FLAGS_INTERACTIVE)) {\r\n    print_jit_status(L);\r\n    dotty(L);\r\n  } else if (script == 0 && !(flags & (FLAGS_EXEC|FLAGS_VERSION))) {\r\n    if (lua_stdin_is_tty()) {\r\n      print_version();\r\n      print_jit_status(L);\r\n      dotty(L);\r\n    } else {\r\n      dofile(L, NULL);  /* executes stdin as a file */\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n  int status;\r\n  lua_State *L = lua_open();  /* create state */\r\n  if (L == NULL) {\r\n    l_message(argv[0], \"cannot create state: not enough memory\");\r\n    return EXIT_FAILURE;\r\n  }\r\n  smain.argc = argc;\r\n  smain.argv = argv;\r\n  status = lua_cpcall(L, pmain, NULL);\r\n  report(L, status);\r\n  lua_close(L);\r\n  return (status || smain.status) ? EXIT_FAILURE : EXIT_SUCCESS;\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/luajit.h",
    "content": "/*\r\n** LuaJIT -- a Just-In-Time Compiler for Lua. http://luajit.org/\r\n**\r\n** Copyright (C) 2005-2015 Mike Pall. All rights reserved.\r\n**\r\n** Permission is hereby granted, free of charge, to any person obtaining\r\n** a copy of this software and associated documentation files (the\r\n** \"Software\"), to deal in the Software without restriction, including\r\n** without limitation the rights to use, copy, modify, merge, publish,\r\n** distribute, sublicense, and/or sell copies of the Software, and to\r\n** permit persons to whom the Software is furnished to do so, subject to\r\n** the following conditions:\r\n**\r\n** The above copyright notice and this permission notice shall be\r\n** included in all copies or substantial portions of the Software.\r\n**\r\n** THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\r\n** EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n** MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\r\n** IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\r\n** CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\r\n** TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\r\n** SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n**\r\n** [ MIT license: http://www.opensource.org/licenses/mit-license.php ]\r\n*/\r\n\r\n#ifndef _LUAJIT_H\r\n#define _LUAJIT_H\r\n\r\n#include \"lua.h\"\r\n\r\n#define LUAJIT_VERSION\t\t\"LuaJIT 2.1.0-beta1\"\r\n#define LUAJIT_VERSION_NUM\t20100  /* Version 2.1.0 = 02.01.00. */\r\n#define LUAJIT_VERSION_SYM\tluaJIT_version_2_1_0_beta1\r\n#define LUAJIT_COPYRIGHT\t\"Copyright (C) 2005-2015 Mike Pall\"\r\n#define LUAJIT_URL\t\t\"http://luajit.org/\"\r\n\r\n/* Modes for luaJIT_setmode. */\r\n#define LUAJIT_MODE_MASK\t0x00ff\r\n\r\nenum {\r\n  LUAJIT_MODE_ENGINE,\t\t/* Set mode for whole JIT engine. */\r\n  LUAJIT_MODE_DEBUG,\t\t/* Set debug mode (idx = level). */\r\n\r\n  LUAJIT_MODE_FUNC,\t\t/* Change mode for a function. */\r\n  LUAJIT_MODE_ALLFUNC,\t\t/* Recurse into subroutine protos. */\r\n  LUAJIT_MODE_ALLSUBFUNC,\t/* Change only the subroutines. */\r\n\r\n  LUAJIT_MODE_TRACE,\t\t/* Flush a compiled trace. */\r\n\r\n  LUAJIT_MODE_WRAPCFUNC = 0x10,\t/* Set wrapper mode for C function calls. */\r\n\r\n  LUAJIT_MODE_MAX\r\n};\r\n\r\n/* Flags or'ed in to the mode. */\r\n#define LUAJIT_MODE_OFF\t\t0x0000\t/* Turn feature off. */\r\n#define LUAJIT_MODE_ON\t\t0x0100\t/* Turn feature on. */\r\n#define LUAJIT_MODE_FLUSH\t0x0200\t/* Flush JIT-compiled code. */\r\n\r\n/* LuaJIT public C API. */\r\n\r\n/* Control the JIT engine. */\r\nLUA_API int luaJIT_setmode(lua_State *L, int idx, int mode);\r\n\r\n/* Low-overhead profiling API. */\r\ntypedef void (*luaJIT_profile_callback)(void *data, lua_State *L,\r\n\t\t\t\t\tint samples, int vmstate);\r\nLUA_API void luaJIT_profile_start(lua_State *L, const char *mode,\r\n\t\t\t\t  luaJIT_profile_callback cb, void *data);\r\nLUA_API void luaJIT_profile_stop(lua_State *L);\r\nLUA_API const char *luaJIT_profile_dumpstack(lua_State *L, const char *fmt,\r\n\t\t\t\t\t     int depth, size_t *len);\r\n\r\n/* Enforce (dynamic) linker error for version mismatches. Call from main. */\r\nLUA_API void LUAJIT_VERSION_SYM(void);\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/lualib.h",
    "content": "/*\r\n** Standard library header.\r\n** Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n*/\r\n\r\n#ifndef _LUALIB_H\r\n#define _LUALIB_H\r\n\r\n#include \"lua.h\"\r\n\r\n#define LUA_FILEHANDLE\t\"FILE*\"\r\n\r\n#define LUA_COLIBNAME\t\"coroutine\"\r\n#define LUA_MATHLIBNAME\t\"math\"\r\n#define LUA_STRLIBNAME\t\"string\"\r\n#define LUA_TABLIBNAME\t\"table\"\r\n#define LUA_IOLIBNAME\t\"io\"\r\n#define LUA_OSLIBNAME\t\"os\"\r\n#define LUA_LOADLIBNAME\t\"package\"\r\n#define LUA_DBLIBNAME\t\"debug\"\r\n#define LUA_BITLIBNAME\t\"bit\"\r\n#define LUA_JITLIBNAME\t\"jit\"\r\n#define LUA_FFILIBNAME\t\"ffi\"\r\n\r\nLUALIB_API int luaopen_base(lua_State *L);\r\nLUALIB_API int luaopen_math(lua_State *L);\r\nLUALIB_API int luaopen_string(lua_State *L);\r\nLUALIB_API int luaopen_table(lua_State *L);\r\nLUALIB_API int luaopen_io(lua_State *L);\r\nLUALIB_API int luaopen_os(lua_State *L);\r\nLUALIB_API int luaopen_package(lua_State *L);\r\nLUALIB_API int luaopen_debug(lua_State *L);\r\nLUALIB_API int luaopen_bit(lua_State *L);\r\nLUALIB_API int luaopen_jit(lua_State *L);\r\nLUALIB_API int luaopen_ffi(lua_State *L);\r\n\r\nLUALIB_API void luaL_openlibs(lua_State *L);\r\n\r\n#ifndef lua_assert\r\n#define lua_assert(x)\t((void)0)\r\n#endif\r\n\r\n#endif\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/msvcbuild.bat",
    "content": "@rem Script to build LuaJIT with MSVC.\r\n@rem Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n@rem\r\n@rem Either open a \"Visual Studio .NET Command Prompt\"\r\n@rem (Note that the Express Edition does not contain an x64 compiler)\r\n@rem -or-\r\n@rem Open a \"Windows SDK Command Shell\" and set the compiler environment:\r\n@rem     setenv /release /x86\r\n@rem   -or-\r\n@rem     setenv /release /x64\r\n@rem\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n\r\n@setlocal\r\n@set LJCOMPILE=cl /nologo /c /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set LJLIB=lib /nologo /nodefaultlib\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set LJDLLNAME=lua51.dll\r\n@set LJLIBNAME=lua51.lib\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@set DASMFLAGS=-D WIN -D JIT -D FFI -D P64\r\n@set LJARCH=x64\r\n@minilua\r\n@if errorlevel 8 goto :X64\r\n@set DASMFLAGS=-D WIN -D JIT -D FFI\r\n@set LJARCH=x86\r\n@set LJCOMPILE=%LJCOMPILE% /arch:SSE2\r\n:X64\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_x86.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m peobj -o lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% /Zi\r\n@set LJLINK=%LJLINK% /debug\r\n:NODEBUG\r\n@if \"%1\"==\"amalg\" goto :AMALGDLL\r\n@if \"%1\"==\"static\" goto :STATIC\r\n%LJCOMPILE% /MT /DLUA_BUILD_AS_DLL lj_*.c lib_*.c slua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /DLL /out:%LJDLLNAME% lj_*.obj lib_*.obj slua.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :MTDLL\r\n:STATIC\r\n%LJCOMPILE% lj_*.c lib_*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:%LJLIBNAME% lj_*.obj lib_*.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :MTDLL\r\n:AMALGDLL\r\n%LJCOMPILE% /MT /DLUA_BUILD_AS_DLL ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /DLL /out:%LJDLLNAME% ljamalg.obj lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\n:MTDLL\r\nif exist %LJDLLNAME%.manifest^\r\n  %LJMT% -manifest %LJDLLNAME%.manifest -outputresource:%LJDLLNAME%;2\r\n\r\n%LJCOMPILE% luajit.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:luajit.exe luajit.obj %LJLIBNAME%\r\n@if errorlevel 1 goto :BAD\r\nif exist luajit.exe.manifest^\r\n  %LJMT% -manifest luajit.exe.manifest -outputresource:luajit.exe\r\n\r\n@del *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for Windows/%LJARCH% ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo You must open a \"Visual Studio .NET Command Prompt\" to run this script\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/ps4build.bat",
    "content": "@rem Script to build LuaJIT with the PS4 SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (64 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined SCE_ORBIS_SDK_DIR goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Check for 64 bit host compiler.\r\n@minilua\r\n@if not errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D P64 -D NO_UNWIND\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_x86.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_X64 -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLUAJIT_NO_UNWIND host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m elfasm -o lj_vm.s\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%SCE_ORBIS_SDK_DIR%\\host_tools\\bin\\orbis-clang\" -c -Wall -DLUAJIT_DISABLE_FFI\r\n@set LJLIB=\"%SCE_ORBIS_SDK_DIR%\\host_tools\\bin\\orbis-ar\" rcus\r\n@set INCLUDE=\"\"\r\n\r\norbis-as -o lj_vm.o lj_vm.s\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% -g -O0\r\n@set TARGETLIB=libluajitD.a\r\ngoto :BUILD\r\n:NODEBUG\r\n@set LJCOMPILE=%LJCOMPILE% -O2\r\n@set TARGETLIB=libluajit.a\r\n:BUILD\r\ndel %TARGETLIB%\r\n@if \"%1\"==\"amalg\" goto :AMALG\r\nfor %%f in (lj_*.c lib_*.c) do (\r\n  %LJCOMPILE% %%f\r\n  @if errorlevel 1 goto :BAD\r\n)\r\n\r\n%LJLIB% %TARGETLIB% lj_*.o lib_*.o\r\n@if errorlevel 1 goto :BAD\r\n@goto :NOAMALG\r\n:AMALG\r\n%LJCOMPILE% ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% %TARGETLIB% ljamalg.o lj_vm.o\r\n@if errorlevel 1 goto :BAD\r\n:NOAMALG\r\n\r\n@del *.o *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for PS4 ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (64 bit host compiler). The PS4 Orbis SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/psvitabuild.bat",
    "content": "@rem Script to build LuaJIT with the PS Vita SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (32 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined SCE_PSP2_SDK_DIR goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Check for 32 bit host compiler.\r\n@minilua\r\n@if errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D FPU -D HFABI\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_arm.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% -DLUAJIT_TARGET=LUAJIT_ARCH_ARM -DLUAJIT_OS=LUAJIT_OS_OTHER -DLUAJIT_DISABLE_JIT -DLUAJIT_DISABLE_FFI -DLJ_TARGET_PSVITA=1 host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m elfasm -o lj_vm.s\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2snc\" -c -w -DLUAJIT_DISABLE_FFI -DLUAJIT_USE_SYSMALLOC\r\n@set LJLIB=\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2ld32\" -r --output=\r\n@set INCLUDE=\"\"\r\n\r\n\"%SCE_PSP2_SDK_DIR%\\host_tools\\build\\bin\\psp2as\" -o lj_vm.o lj_vm.s\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set LJCOMPILE=%LJCOMPILE% -g -O0\r\n@set TARGETLIB=libluajitD.a\r\ngoto :BUILD\r\n:NODEBUG\r\n@set LJCOMPILE=%LJCOMPILE% -O2\r\n@set TARGETLIB=libluajit.a\r\n:BUILD\r\ndel %TARGETLIB%\r\n\r\n%LJCOMPILE% ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB%%TARGETLIB% ljamalg.o lj_vm.o\r\n@if errorlevel 1 goto :BAD\r\n\r\n@del *.o *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for PS Vita ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (32 bit host compiler). The PS Vita SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_arm.dasc",
    "content": "|// Low-level VM code for ARM CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch arm\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|\r\n|// The following must be C callee-save.\r\n|.define MASKR8,\tr4\t// 255*8 constant for fast bytecode decoding.\r\n|.define KBASE,\t\tr5\t// Constants of current Lua function.\r\n|.define PC,\t\tr6\t// Next PC.\r\n|.define DISPATCH,\tr7\t// Opcode dispatch table.\r\n|.define LREG,\t\tr8\t// Register holding lua_State (also in SAVE_L).\r\n|\r\n|// C callee-save in EABI, but often refetched. Temporary in iOS 3.0+.\r\n|.define BASE,\t\tr9\t// Base of current Lua stack frame.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA/RC.\r\n|.define RA,\t\tr10\t// Callee-save.\r\n|.define RC,\t\tr11\t// Callee-save.\r\n|.define RB,\t\tr12\r\n|.define OP,\t\tr12\t// Overlaps RB, must not be lr.\r\n|.define INS,\t\tlr\r\n|\r\n|// Calling conventions. Also used as temporaries.\r\n|.define CARG1,\t\tr0\r\n|.define CARG2,\t\tr1\r\n|.define CARG3,\t\tr2\r\n|.define CARG4,\t\tr3\r\n|.define CARG12,\tr0\t// For 1st soft-fp double.\r\n|.define CARG34,\tr2\t// For 2nd soft-fp double.\r\n|\r\n|.define CRET1,\t\tr0\r\n|.define CRET2,\t\tr1\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.define SAVE_R4,\t[sp, #28]\r\n|.define CFRAME_SPACE,\t#28\r\n|.define SAVE_ERRF,\t[sp, #24]\r\n|.define SAVE_NRES,\t[sp, #20]\r\n|.define SAVE_CFRAME,\t[sp, #16]\r\n|.define SAVE_L,\t[sp, #12]\r\n|.define SAVE_PC,\t[sp, #8]\r\n|.define SAVE_MULTRES,\t[sp, #4]\r\n|.define ARG5,\t\t[sp]\r\n|\r\n|.define TMPDhi,\t[sp, #4]\r\n|.define TMPDlo,\t[sp]\r\n|.define TMPD,\t\t[sp]\r\n|.define TMPDp,\t\tsp\r\n|\r\n|.if FPU\r\n|.macro saveregs\r\n|  push {r5, r6, r7, r8, r9, r10, r11, lr}\r\n|  vpush {d8-d15}\r\n|  sub sp, sp, CFRAME_SPACE+4\r\n|  str r4, SAVE_R4\r\n|.endmacro\r\n|.macro restoreregs_ret\r\n|  ldr r4, SAVE_R4\r\n|  add sp, sp, CFRAME_SPACE+4\r\n|  vpop {d8-d15}\r\n|  pop {r5, r6, r7, r8, r9, r10, r11, pc}\r\n|.endmacro\r\n|.else\r\n|.macro saveregs\r\n|  push {r4, r5, r6, r7, r8, r9, r10, r11, lr}\r\n|  sub sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro restoreregs_ret\r\n|  add sp, sp, CFRAME_SPACE\r\n|  pop {r4, r5, r6, r7, r8, r9, r10, r11, pc}\r\n|.endmacro\r\n|.endif\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; ud; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_FUNC,\t#-8\r\n|.define FRAME_PC,\t#-4\r\n|\r\n|.macro decode_RA8, dst, ins; and dst, MASKR8, ins, lsr #5; .endmacro\r\n|.macro decode_RB8, dst, ins; and dst, MASKR8, ins, lsr #21; .endmacro\r\n|.macro decode_RC8, dst, ins; and dst, MASKR8, ins, lsr #13; .endmacro\r\n|.macro decode_RD, dst, ins; lsr dst, ins, #16; .endmacro\r\n|.macro decode_OP, dst, ins; and dst, ins, #255; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  ldrb OP, [PC]\r\n|.endmacro\r\n|.macro ins_NEXT2\r\n|   ldr INS, [PC], #4\r\n|.endmacro\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT3\r\n|  ldr OP, [DISPATCH, OP, lsl #2]\r\n|   decode_RA8 RA, INS\r\n|   decode_RD RC, INS\r\n|  bx OP\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|  ins_NEXT3\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|  .define ins_next3, ins_NEXT3\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|  .endmacro\r\n|  .macro ins_next3\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Avoid register name substitution for field name.\r\n#define field_pc\tpc\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  ldr PC, LFUNC:CARG3->field_pc\r\n|  ldrb OP, [PC]  // STALL: load PC. early PC.\r\n|   ldr INS, [PC], #4\r\n|  ldr OP, [DISPATCH, OP, lsl #2]  // STALL: load OP. early OP.\r\n|   decode_RA8 RA, INS\r\n|   add RA, RA, BASE\r\n|  bx OP\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  str PC, [BASE, FRAME_PC]\r\n|  ins_callt  // STALL: locked PC.\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checktp, reg, tp; cmn reg, #-tp; .endmacro\r\n|.macro checktpeq, reg, tp; cmneq reg, #-tp; .endmacro\r\n|.macro checktpne, reg, tp; cmnne reg, #-tp; .endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR; bne target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB; bne target; .endmacro\r\n|.macro checkfunc, reg, target; checktp reg, LJ_TFUNC; bne target; .endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotcheck, delta\r\n|  lsr CARG1, PC, #1\r\n|  and CARG1, CARG1, #126\r\n|  sub CARG1, CARG1, #-GG_DISP2HOT\r\n|  ldrh CARG2, [DISPATCH, CARG1]\r\n|  subs CARG2, CARG2, #delta\r\n|  strh CARG2, [DISPATCH, CARG1]\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP\r\n|  blo ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL\r\n|  blo ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro mv_vmstate, reg, st; mvn reg, #LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate, reg; str reg, [DISPATCH, #DISPATCH_GL(vmstate)]; .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  ldr tmp, [DISPATCH, #DISPATCH_GL(gc.grayagain)]\r\n|   bic mark, mark, #LJ_GC_BLACK\t\t// black2gray(tab)\r\n|  str tab, [DISPATCH, #DISPATCH_GL(gc.grayagain)]\r\n|   strb mark, tab->marked\r\n|  str tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|.macro .IOS, a, b\r\n|.if IOS\r\n|  a, b\r\n|.endif\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n#if !LJ_DUALNUM\r\n#error \"Only dual-number mode supported for ARM target\"\r\n#endif\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: RB = previous base.\r\n  |  tst PC, #FRAME_P\r\n  |  beq ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  ldr PC, [RB, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |   mvn CARG2, #~LJ_TTRUE\r\n  |  mov BASE, RB\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   str CARG2, [RA, FRAME_PC]\t\t// Prepend true to results.\r\n  |  sub RA, RA, #8\r\n  |\r\n  |->vm_returnc:\r\n  |  adds RC, RC, #8\t\t\t// RC = (nresults+1)*8.\r\n  |  mov CRET1, #LUA_YIELD\r\n  |  beq ->vm_unwind_c_eh\r\n  |  str RC, SAVE_MULTRES\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |  beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RC/MULTRES = (nresults+1)*8, PC = return\r\n  |  // CARG1 = PC & FRAME_TYPE\r\n  |  bic RB, PC, #FRAME_TYPEP\r\n  |   cmp CARG1, #FRAME_C\r\n  |  sub RB, BASE, RB\t\t\t// RB = previous base.\r\n  |   bne ->vm_returnp\r\n  |\r\n  |  str RB, L->base\r\n  |   ldr KBASE, SAVE_NRES\r\n  |    mv_vmstate CARG4, C\r\n  |   sub BASE, BASE, #8\r\n  |  subs CARG3, RC, #8\r\n  |   lsl KBASE, KBASE, #3\t\t// KBASE = (nresults_wanted+1)*8\r\n  |    st_vmstate CARG4\r\n  |  beq >2\r\n  |1:\r\n  |  subs CARG3, CARG3, #8\r\n  |   ldrd CARG12, [RA], #8\r\n  |   strd CARG12, [BASE], #8\r\n  |  bne <1\r\n  |2:\r\n  |  cmp KBASE, RC\t\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  str BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  ldr RC, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   mov CRET1, #0\t\t\t// Ok return status for vm_pcall.\r\n  |  str RC, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs_ret\r\n  |\r\n  |6:\r\n  |  blt >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  ldr CARG3, L->maxstack\r\n  |   mvn CARG2, #~LJ_TNIL\r\n  |  cmp BASE, CARG3\r\n  |  bhs >8\r\n  |   str CARG2, [BASE, #4]\r\n  |  add RC, RC, #8\r\n  |  add BASE, BASE, #8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  sub CARG1, RC, KBASE\r\n  |  cmp KBASE, #0\t\t\t// LUA_MULTRET+1 case?\r\n  |  subne BASE, BASE, CARG1\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  str BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |  lsr CARG2, KBASE, #3\r\n  |  mov CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mov sp, CARG1\r\n  |  mov CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |   mv_vmstate CARG4, C\r\n  |  ldr GL:CARG3, L->glref\r\n  |   str CARG4, GL:CARG3->vmstate\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  bic CARG1, CARG1, #~CFRAME_RAWMASK\t// Use two steps: bic sp is deprecated.\r\n  |  mov sp, CARG1\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |   mov MASKR8, #255\r\n  |    mov RC, #16\t\t\t// 2 results: false + error message.\r\n  |   lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |  ldr BASE, L->base\r\n  |   ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |    mvn CARG1, #~LJ_TFALSE\r\n  |  sub RA, BASE, #8\t\t\t// Results start at BASE-8.\r\n  |  ldr PC, [BASE, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |   add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |   mv_vmstate CARG2, INTERP\r\n  |    str CARG1, [BASE, #-4]\t\t// Prepend false to error message.\r\n  |   st_vmstate CARG2\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  // CARG1 = L\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |    mov CARG1, L\r\n  |  str BASE, L->base\r\n  |   add PC, PC, #4\t\t\t// Must point after first instruction.\r\n  |  str RC, L->top\r\n  |   lsr CARG2, RA, #3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->base\r\n  |   ldr RC, L->top\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |    ldr DISPATCH, L:CARG1->glref\t// Setup pointer to dispatch table.\r\n  |  mov BASE, CARG2\r\n  |    add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |   str L, SAVE_L\r\n  |  mov PC, #FRAME_CP\r\n  |   str CARG3, SAVE_NRES\r\n  |    add CARG2, sp, #CFRAME_RESUME\r\n  |  ldrb CARG1, L->status\r\n  |   str CARG3, SAVE_ERRF\r\n  |   str L, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   str CARG3, SAVE_CFRAME\r\n  |  cmp CARG1, #0\r\n  |    str CARG2, L->cframe\r\n  |  beq >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  str L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n  |  mov RA, BASE\r\n  |   ldr BASE, L->base\r\n  |   ldr CARG1, L->top\r\n  |    mov MASKR8, #255\r\n  |     strb CARG3, L->status\r\n  |   sub RC, CARG1, BASE\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |     mv_vmstate CARG2, INTERP\r\n  |   add RC, RC, #8\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |     st_vmstate CARG2\r\n  |   str RC, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_CP\r\n  |  str CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  ldr RC, L:CARG1->cframe\r\n  |   str CARG3, SAVE_NRES\r\n  |    mov L, CARG1\r\n  |   str CARG1, SAVE_L\r\n  |    ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     mov BASE, CARG2\r\n  |   str CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  str RC, SAVE_CFRAME\r\n  |    add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |  str sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  str L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n  |  ldr RB, L->base\t\t\t// RB = old base (for vmeta_call).\r\n  |   ldr CARG1, L->top\r\n  |    mov MASKR8, #255\r\n  |  add PC, PC, BASE\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |  sub PC, PC, RB\t\t\t// PC = frame delta + frame type\r\n  |    mv_vmstate CARG2, INTERP\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |    st_vmstate CARG2\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // RB = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  ldrd CARG34, [BASE, FRAME_FUNC]\r\n  |  checkfunc CARG4, ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, CARG3 = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |   ldr RA, L:CARG1->stack\r\n  |  str CARG1, SAVE_L\r\n  |    ldr DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   ldr RB, L->top\r\n  |  str CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |  ldr RC, L->cframe\r\n  |    add DISPATCH, DISPATCH, #GG_G2DISP\r\n  |   sub RA, RA, RB\t\t\t// Compute -savestack(L, L->top).\r\n  |  mov RB, #0\r\n  |   str RA, SAVE_NRES\t\t\t// Neg. delta means cframe w/o frame.\r\n  |  str RB, SAVE_ERRF\t\t\t// No error function.\r\n  |  str RC, SAVE_CFRAME\r\n  |  str sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    str L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n  |  blx CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |  movs BASE, CRET1\r\n  |   mov PC, #FRAME_CP\r\n  |  bne <3\t\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RC = (nresults+1)*8\r\n  |  ldr LFUNC:CARG3, [RB, FRAME_FUNC]\r\n  |    ldr CARG1, [BASE, #-16]\t\t// Get continuation.\r\n  |   mov CARG4, BASE\r\n  |   mov BASE, RB\t\t\t// Restore caller BASE.\r\n  |.if FFI\r\n  |    cmp CARG1, #1\r\n  |.endif\r\n  |   ldr PC, [CARG4, #-12]\t\t// Restore PC from [cont|PC].\r\n  |  ldr CARG3, LFUNC:CARG3->field_pc\r\n  |    mvn INS, #~LJ_TNIL\r\n  |    add CARG2, RA, RC\r\n  |    str INS, [CARG2, #-4]\t\t// Ensure one valid arg.\r\n  |.if FFI\r\n  |    bls >1\r\n  |.endif\r\n  |  ldr KBASE, [CARG3, #PC2PROTO(k)]\r\n  |  // BASE = base, RA = resultptr, CARG4 = meta base\r\n  |    bx CARG1\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  beq ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |  sub CARG4, CARG4, #16\r\n  |  sub RC, CARG4, BASE\r\n  |  b ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, CARG4 = meta base\r\n  |  ldr INS, [PC, #-4]\r\n  |   sub CARG2, CARG4, #16\r\n  |   ldrd CARG34, [RA]\r\n  |     str BASE, L->base\r\n  |  decode_RB8 RC, INS\r\n  |   decode_RA8 RA, INS\r\n  |  add CARG1, BASE, RC\r\n  |  subs CARG1, CARG2, CARG1\r\n  |   strdne CARG34, [CARG2]\r\n  |   movne CARG3, CARG1\r\n  |  bne ->BC_CAT_Z\r\n  |   strd CARG34, [BASE, RA]\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  add CARG2, BASE, RB\r\n  |  b >2\r\n  |\r\n  |->vmeta_tgets:\r\n  |  sub CARG2, DISPATCH, #-DISPATCH_GL(tmptv)\r\n  |   mvn CARG4, #~LJ_TTAB\r\n  |  str TAB:RB, [CARG2]\r\n  |   str CARG4, [CARG2, #4]\r\n  |2:\r\n  |   mvn CARG4, #~LJ_TSTR\r\n  |  str STR:RC, TMPDlo\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// RC = index\r\n  |  decode_RB8 RB, INS\r\n  |   str RC, TMPDlo\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |  add CARG2, BASE, RB\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  beq >3\r\n  |  ldrd CARG34, [CRET1]\r\n  |   ins_next1\r\n  |   ins_next2\r\n  |  strd CARG34, [BASE, RA]\r\n  |   ins_next3\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |   rsb CARG1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #16\t\t// 2 args for func(t, k).\r\n  |    str PC, [BASE, #-12]\t\t// [cont|PC]\r\n  |   add PC, CARG1, BASE\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  .IOS mov RC, BASE\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  .IOS mov BASE, RC\r\n  |  cmp CRET1, #0\r\n  |  ldrdne CARG12, [CRET1]\r\n  |  mvneq CARG2, #~LJ_TNIL\r\n  |  b ->BC_TGETR_Z\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  add CARG2, BASE, RB\r\n  |  b >2\r\n  |\r\n  |->vmeta_tsets:\r\n  |  sub CARG2, DISPATCH, #-DISPATCH_GL(tmptv)\r\n  |   mvn CARG4, #~LJ_TTAB\r\n  |  str TAB:RB, [CARG2]\r\n  |   str CARG4, [CARG2, #4]\r\n  |2:\r\n  |   mvn CARG4, #~LJ_TSTR\r\n  |  str STR:RC, TMPDlo\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// RC = index\r\n  |  decode_RB8 RB, INS\r\n  |   str RC, TMPDlo\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |  add CARG2, BASE, RB\r\n  |   str CARG4, TMPDhi\r\n  |  mov CARG3, TMPDp\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |   ldrd CARG34, [BASE, RA]\r\n  |  beq >3\r\n  |   ins_next1\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  strd CARG34, [CRET1]\r\n  |   ins_next2\r\n  |   ins_next3\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |   rsb CARG1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #24\t\t// 3 args for func(t, k, v).\r\n  |   strd CARG34, [BASE, #16]\t\t// Copy value to third argument.\r\n  |    str PC, [BASE, #-12]\t\t// [cont|PC]\r\n  |   add PC, CARG1, BASE\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tsetr:\r\n  |  str BASE, L->base\r\n  |  .IOS mov RC, BASE\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |  // Returns TValue *.\r\n  |  .IOS mov BASE, RC\r\n  |  b ->BC_TSETR_Z\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  mov CARG1, L\r\n  |   sub PC, PC, #4\r\n  |  mov CARG2, RA\r\n  |   str BASE, L->base\r\n  |  mov CARG3, RC\r\n  |   str PC, SAVE_PC\r\n  |  decode_OP CARG4, INS\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #1\r\n  |  bhi ->vmeta_binop\r\n  |4:\r\n  |  ldrh RB, [PC, #2]\r\n  |   add PC, PC, #4\r\n  |  add RB, PC, RB, lsl #2\r\n  |  subhs PC, RB, #0x20000\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  ldr INS, [PC, #-4]\r\n  |   ldrd CARG12, [RA]\r\n  |  decode_RA8 CARG3, INS\r\n  |   strd CARG12, [BASE, CARG3]\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  ldr CARG2, [RA, #4]\r\n  |   mvn CARG1, #~LJ_TTRUE\r\n  |  cmp CARG1, CARG2\t\t\t// Branch if result is true.\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  ldr CARG2, [RA, #4]\r\n  |  checktp CARG2, LJ_TFALSE\t\t// Branch if result is false.\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |   mov CARG2, INS\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal_cd\t\t// (lua_State *L, BCIns op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |   lsr CARG2, RA, #3\r\n  |   mov CARG3, RC\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |  .IOS ldr BASE, L->base\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG3, BASE, RB\r\n  |   add CARG4, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG4, BASE, RB\r\n  |   add CARG3, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_unm:\r\n  |  ldr INS, [PC, #-8]\r\n  |   sub PC, PC, #4\r\n  |  add CARG3, BASE, RC\r\n  |  add CARG4, BASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG3, BASE, RB\r\n  |   add CARG4, BASE, RC\r\n  |1:\r\n  |  decode_OP OP, INS\r\n  |   add CARG2, BASE, RA\r\n  |    str BASE, L->base\r\n  |   mov CARG1, L\r\n  |    str PC, SAVE_PC\r\n  |  str OP, ARG5\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  beq ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub CARG2, CRET1, BASE\r\n  |   str PC, [CRET1, #-12]\t\t// [cont|PC]\r\n  |  add PC, CARG2, #FRAME_CONT\r\n  |   mov BASE, CRET1\r\n  |    mov NARGS8:RC, #16\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  add CARG2, BASE, RC\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n  |  .IOS ldr BASE, L->base\r\n#if LJ_52\r\n  |  cmp CRET1, #0\r\n  |  bne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  ldr TAB:CARG1, [BASE, RC]\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // RB = old base, BASE = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str RB, L->base\t\t\t// This is the callers base!\r\n  |  sub CARG2, BASE, #8\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, BASE, NARGS8:RC\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  .IOS mov BASE, RA\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  sub CARG2, RA, #8\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, RA, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  .IOS ldr BASE, L->base\r\n  |  ldr LFUNC:CARG3, [RA, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |    add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  b ->BC_CALLT2_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, RA\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |  .IOS ldr BASE, L->base\r\n  |.if JIT\r\n  |   ldrb OP, [PC, #-4]\r\n  |.endif\r\n  |  ldr INS, [PC, #-4]\r\n  |.if JIT\r\n  |   cmp OP, #BC_JFORI\r\n  |.endif\r\n  |  decode_RA8 RA, INS\r\n  |  decode_RD RC, INS\r\n  |.if JIT\r\n  |   beq =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  ldrd CARG12, [BASE]\r\n  |   ldrd CARG34, [BASE, #8]\r\n  |    cmp NARGS8:RC, #16\r\n  |    blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc_1 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc_2 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmnlo CARG4, #-LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_d, name\r\n  |  .ffunc name\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\r\n  |  vldr d0, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_dd, name\r\n  |  .ffunc name\r\n  |  ldr CARG2, [BASE, #4]\r\n  |  ldr CARG4, [BASE, #12]\r\n  |   cmp NARGS8:RC, #16\r\n  |  vldr d0, [BASE]\r\n  |  vldr d1, [BASE, #8]\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmnlo CARG4, #-LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses CARG1 and CARG2.\r\n  |.macro ffgccheck\r\n  |  ldr CARG1, [DISPATCH, #DISPATCH_GL(gc.total)]\r\n  |  ldr CARG2, [DISPATCH, #DISPATCH_GL(gc.threshold)]\r\n  |  cmp CARG1, CARG2\r\n  |  blge ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  checktp CARG2, LJ_TTRUE\r\n  |  bhi ->fff_fallback\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |  mov RB, BASE\r\n  |  subs RA, NARGS8:RC, #8\r\n  |   add RC, NARGS8:RC, #8\t\t// Compute (nresults+1)*8.\r\n  |  beq ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |1:\r\n  |   ldrd CARG12, [RB, #8]\r\n  |  subs RA, RA, #8\r\n  |   strd CARG12, [RB], #8\r\n  |  bne <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc type\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  mvnlo CARG2, #~LJ_TISNUM\r\n  |  rsb CARG4, CARG2, #(int)(offsetof(GCfuncC, upvalue)>>3)-1\r\n  |  lsl CARG4, CARG4, #3\r\n  |  ldrd CARG12, [CFUNC:CARG3, CARG4]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  checktp CARG2, LJ_TTAB\r\n  |  cmnne CARG2, #-LJ_TUDATA\r\n  |  bne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n  |2:\r\n  |   mvn CARG2, #~LJ_TNIL\r\n  |   ldr STR:RC, [DISPATCH, #DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])]\r\n  |  cmp TAB:RB, #0\r\n  |  beq ->fff_restv\r\n  |  ldr CARG3, TAB:RB->hmask\r\n  |   ldr CARG4, STR:RC->hash\r\n  |    ldr NODE:INS, TAB:RB->node\r\n  |  and CARG3, CARG3, CARG4\t\t// idx = str->hash & tab->hmask\r\n  |  add CARG3, CARG3, CARG3, lsl #1\r\n  |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  ldrd CARG34, NODE:INS->key  // STALL: early NODE:INS.\r\n  |   ldrd CARG12, NODE:INS->val\r\n  |    ldr NODE:INS, NODE:INS->next\r\n  |  checktp CARG4, LJ_TSTR\r\n  |  cmpeq CARG3, STR:RC\r\n  |  beq >5\r\n  |  cmp NODE:INS, #0\r\n  |  bne <3\r\n  |4:\r\n  |  mov CARG1, RB\t\t\t// Use metatable as default result.\r\n  |  mvn CARG2, #~LJ_TTAB\r\n  |  b ->fff_restv\r\n  |5:\r\n  |  checktp CARG2, LJ_TNIL\r\n  |  bne ->fff_restv\r\n  |  b <4\r\n  |\r\n  |6:\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  mvnhs CARG2, CARG2\r\n  |  movlo CARG2, #~LJ_TISNUM\r\n  |  add CARG4, DISPATCH, CARG2, lsl #2\r\n  |  ldr TAB:RB, [CARG4, #DISPATCH_GL(gcroot[GCROOT_BASEMT])]\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  checktp CARG2, LJ_TTAB\r\n  |   ldreq TAB:RB, TAB:CARG1->metatable\r\n  |  checktpeq CARG4, LJ_TTAB\r\n  |    ldrbeq CARG4, TAB:CARG1->marked\r\n  |   cmpeq TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n  |    tst CARG4, #LJ_GC_BLACK\t\t// isblack(table)\r\n  |     str TAB:CARG3, TAB:CARG1->metatable\r\n  |    beq ->fff_restv\r\n  |  barrierback TAB:CARG1, CARG4, CARG3\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  ldrd CARG34, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |   mov CARG2, CARG3\r\n  |  checktab CARG4, ->fff_fallback\r\n  |   mov CARG1, L\r\n  |   add CARG3, BASE, #8\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  .IOS mov BASE, RA\r\n  |  ldrd CARG12, [CRET1]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   bne ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bls ->fff_restv\r\n  |  b ->fff_fallback\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  checktp CARG2, LJ_TSTR\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq ->fff_restv\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  ldr CARG4, [DISPATCH, #DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])]\r\n  |   str BASE, L->base\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  cmpls CARG4, #0\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  bhi ->fff_fallback\r\n  |  ffgccheck\r\n  |  mov CARG1, L\r\n  |  mov CARG2, BASE\r\n  |  bl extern lj_strfmt_number\t\t// (lua_State *L, cTValue *o)\r\n  |  // Returns GCstr *.\r\n  |  ldr BASE, L->base\r\n  |  mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |   mvn CARG4, #~LJ_TNIL\r\n  |  checktab CARG2, ->fff_fallback\r\n  |   strd CARG34, [BASE, NARGS8:RC]\t// Set missing 2nd arg to nil.\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  mov CARG2, CARG1\r\n  |    str BASE, L->base\t\t// Add frame since C call can throw.\r\n  |  mov CARG1, L\r\n  |    str BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  add CARG3, BASE, #8\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  .IOS ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |  mvneq CRET2, #~LJ_TNIL\r\n  |  beq ->fff_restv\t\t\t// End of traversal: return nil.\r\n  |  ldrd CARG12, [BASE, #8]\t\t// Copy key and value to results.\r\n  |   ldrd CARG34, [BASE, #16]\r\n  |    mov RC, #(2+1)*8\r\n  |  strd CARG12, [BASE, #-8]\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktab CARG2, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n#endif\r\n  |   ldrd CFUNC:CARG34, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cmp TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n#endif\r\n  |  mvn CARG2, #~LJ_TNIL\r\n  |    mov RC, #(3+1)*8\r\n  |   strd CFUNC:CARG34, [BASE, #-8]\r\n  |  str CARG2, [BASE, #12]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  checktp CARG2, LJ_TTAB\r\n  |  checktpeq CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  ldr RB, TAB:CARG1->asize\r\n  |   ldr RC, TAB:CARG1->array\r\n  |  add CARG3, CARG3, #1\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  cmp CARG3, RB\r\n  |   add RC, RC, CARG3, lsl #3\r\n  |  strd CARG34, [BASE, #-8]\r\n  |   ldrdlo CARG12, [RC]\r\n  |   mov RC, #(0+1)*8\r\n  |  bhs >2\t\t\t\t// Not in array part?\r\n  |1:\r\n  |   checktp CARG2, LJ_TNIL\r\n  |   movne RC, #(2+1)*8\r\n  |   strdne CARG12, [BASE]\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  ldr RB, TAB:CARG1->hmask\r\n  |   mov CARG2, CARG3\r\n  |  cmp RB, #0\r\n  |  beq ->fff_res\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  .IOS mov BASE, RA\r\n  |  cmp CRET1, #0\r\n  |  beq ->fff_res\r\n  |  ldrd CARG12, [CRET1]\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktab CARG2, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n#endif\r\n  |   ldrd CFUNC:CARG34, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cmp TAB:RB, #0\r\n  |  bne ->fff_fallback\r\n#endif\r\n  |  mov CARG1, #0\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |    mov RC, #(3+1)*8\r\n  |   strd CFUNC:CARG34, [BASE, #-8]\r\n  |  strd CARG12, [BASE, #8]\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  ldrb RA, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |  tst RA, #HOOK_ACTIVE\t\t// Remember active hook before pcall.\r\n  |   mov RB, BASE\r\n  |   add BASE, BASE, #8\r\n  |  moveq PC, #8+FRAME_PCALL\r\n  |  movne PC, #8+FRAME_PCALLH\r\n  |   sub NARGS8:RC, NARGS8:RC, #8\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  ldrb RA, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  checkfunc CARG4, ->fff_fallback\t// Traceback must be a function.\r\n  |   mov RB, BASE\r\n  |  strd CARG12, [BASE, #8]\t\t// Swap function and traceback.\r\n  |   strd CARG34, [BASE]\r\n  |  tst RA, #HOOK_ACTIVE\t\t// Remember active hook before pcall.\r\n  |   add BASE, BASE, #16\r\n  |  moveq PC, #16+FRAME_PCALL\r\n  |  movne PC, #16+FRAME_PCALLH\r\n  |   sub NARGS8:RC, NARGS8:RC, #16\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  checktp CARG2, LJ_TTHREAD\r\n  |  bne ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  ldr L:CARG1, CFUNC:CARG3->upvalue[0].gcr\r\n  |.endif\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |     str BASE, L->base\r\n  |  ldr CARG2, L:CARG1->top\r\n  |   ldrb RA, L:CARG1->status\r\n  |    ldr RB, L:CARG1->base\r\n  |  add CARG3, CARG2, NARGS8:RC\r\n  |  add CARG4, CARG2, RA\r\n  |   str PC, SAVE_PC\r\n  |  cmp CARG4, RB\r\n  |  beq ->fff_fallback\r\n  |   ldr CARG4, L:CARG1->maxstack\r\n  |    ldr RB, L:CARG1->cframe\r\n  |   cmp RA, #LUA_YIELD\r\n  |   cmpls CARG3, CARG4\r\n  |    cmpls RB, #0\r\n  |    bhi ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  sub CARG3, CARG3, #8\t\t// Keep resumed thread in stack for GC.\r\n  |  add BASE, BASE, #8\r\n  |  sub NARGS8:RC, NARGS8:RC, #8\r\n  |.endif\r\n  |  str CARG3, L:CARG1->top\r\n  |  str BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |   ldrd CARG34, [BASE, RB]\r\n  |  cmp RB, NARGS8:RC\r\n  |   strdne CARG34, [CARG2, RB]\r\n  |  add RB, RB, #8\r\n  |  bne <2\r\n  |\r\n  |  mov CARG3, #0\r\n  |   mov L:RA, L:CARG1\r\n  |  mov CARG4, #0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  ldr CARG3, L:RA->base\r\n  |    mv_vmstate CARG2, INTERP\r\n  |  ldr CARG4, L:RA->top\r\n  |   cmp CRET1, #LUA_YIELD\r\n  |  ldr BASE, L->base\r\n  |    str L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n  |    st_vmstate CARG2\r\n  |   bhi >8\r\n  |  subs RC, CARG4, CARG3\r\n  |   ldr CARG1, L->maxstack\r\n  |   add CARG2, BASE, RC\r\n  |  beq >6\t\t\t\t// No results?\r\n  |  cmp CARG2, CARG1\r\n  |   mov RB, #0\r\n  |  bhi >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  sub CARG4, RC, #8\r\n  |   str CARG3, L:RA->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |   ldrd CARG12, [CARG3, RB]\r\n  |  cmp RB, CARG4\r\n  |   strd CARG12, [BASE, RB]\r\n  |  add RB, RB, #8\r\n  |  bne <5\r\n  |6:\r\n  |.if resume\r\n  |  mvn CARG3, #~LJ_TTRUE\r\n  |   add RC, RC, #16\r\n  |7:\r\n  |  str CARG3, [BASE, #-4]\t\t// Prepend true/false to results.\r\n  |   sub RA, BASE, #8\r\n  |.else\r\n  |   mov RA, BASE\r\n  |   add RC, RC, #8\r\n  |.endif\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   str PC, SAVE_PC\r\n  |   str RC, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  ldrd CARG12, [CARG4, #-8]!\r\n  |   mvn CARG3, #~LJ_TFALSE\r\n  |    mov RC, #(2+1)*8\r\n  |  str CARG4, L:RA->top\t\t// Remove error from coroutine stack.\r\n  |  strd CARG12, [BASE]\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mov CARG1, L\r\n  |  mov CARG2, L:RA\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |  // Never returns.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mov CARG1, L\r\n  |  lsr CARG2, RC, #3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov CRET1, #0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  ldr CARG1, L->cframe\r\n  |   add CARG2, BASE, NARGS8:RC\r\n  |   str BASE, L->base\r\n  |  tst CARG1, #CFRAME_RESUME\r\n  |   str CARG2, L->top\r\n  |    mov CRET1, #LUA_YIELD\r\n  |   mov CARG3, #0\r\n  |  beq ->fff_fallback\r\n  |   str CARG3, L->cframe\r\n  |    strb CRET1, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_1 math_ .. func\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  beq ->fff_restv\r\n  |  bhi ->fff_fallback\r\n  |  // Round FP value and normalize result.\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  bpl >2\t\t\t\t// |x| < 1?\r\n  |  mvn CARG4, #0x3e0\r\n  |    subs RB, CARG4, RB, asr #21\r\n  |  lsl CARG4, CARG2, #11\r\n  |   lsl CARG3, CARG1, #11\r\n  |  orr CARG4, CARG4, #0x80000000\r\n  |   rsb INS, RB, #32\r\n  |  orr CARG4, CARG4, CARG1, lsr #21\r\n  |    bls >3\t\t\t\t// |x| >= 2^31?\r\n  |   orr CARG3, CARG3, CARG4, lsl INS\r\n  |  lsr CARG1, CARG4, RB\r\n  |.if \"func\" == \"floor\"\r\n  |   tst CARG3, CARG2, asr #31\r\n  |   addne CARG1, CARG1, #1\r\n  |.else\r\n  |   bics CARG3, CARG3, CARG2, asr #31\r\n  |   addsne CARG1, CARG1, #1\r\n  |   ldrdvs CARG12, >9\r\n  |   bvs ->fff_restv\r\n  |.endif\r\n  |    cmp CARG2, #0\r\n  |    rsblt CARG1, CARG1, #0\r\n  |1:\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |2:  // |x| < 1\r\n  |  bcs ->fff_restv\t\t\t// |x| is not finite.\r\n  |  orr CARG3, CARG3, CARG1\t\t// ztest = abs(hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  tst CARG3, CARG2, asr #31\t\t// return (ztest & sign) == 0 ? 0 : -1\r\n  |  moveq CARG1, #0\r\n  |  mvnne CARG1, #0\r\n  |.else\r\n  |  bics CARG3, CARG3, CARG2, asr #31\t// return (ztest & ~sign) == 0 ? 0 : 1\r\n  |  moveq CARG1, #0\r\n  |  movne CARG1, #1\r\n  |.endif\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |3:  // |x| >= 2^31. Check for x == -(2^31).\r\n  |  cmpeq CARG4, #0x80000000\r\n  |.if \"func\" == \"floor\"\r\n  |  cmpeq CARG3, #0\r\n  |.endif\r\n  |  bne >4\r\n  |  cmp CARG2, #0\r\n  |  movmi CARG1, #0x80000000\r\n  |  bmi <1\r\n  |4:\r\n  |  bl ->vm_..func.._sf\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.align 8\r\n  |9:\r\n  |  .long 0x00000000, 0x41e00000\t// 2^31.\r\n  |\r\n  |.ffunc_1 math_abs\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhi ->fff_fallback\r\n  |  bicne CARG2, CARG2, #0x80000000\r\n  |  bne ->fff_restv\r\n  |  cmp CARG1, #0\r\n  |  rsbslt CARG1, CARG1, #0\r\n  |  ldrdvs CARG12, <9\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG12 = TValue result.\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |->fff_res1:\r\n  |  // PC = return.\r\n  |  mov RC, #(1+1)*8\r\n  |->fff_res:\r\n  |  // RC = (nresults+1)*8, PC = return.\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |  ldreq INS, [PC, #-4]\r\n  |   str RC, SAVE_MULTRES\r\n  |  sub RA, BASE, #8\r\n  |  bne ->vm_return\r\n  |  decode_RB8 RB, INS\r\n  |5:\r\n  |  cmp RB, RC\t\t\t\t// More results expected?\r\n  |  bhi >6\r\n  |  decode_RA8 CARG1, INS\r\n  |   ins_next1\r\n  |   ins_next2\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  sub BASE, RA, CARG1\r\n  |   ins_next3\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  add CARG2, RA, RC\r\n  |  mvn CARG1, #~LJ_TNIL\r\n  |   add RC, RC, #8\r\n  |  str CARG1, [CARG2, #-4]\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |.if HFABI\r\n  |  .ffunc_d math_ .. func\r\n  |.else\r\n  |  .ffunc_n math_ .. func\r\n  |.endif\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern func\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |.if HFABI\r\n  |  .ffunc_dd math_ .. func\r\n  |.else\r\n  |  .ffunc_nn math_ .. func\r\n  |.endif\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern func\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.if FPU\r\n  |  .ffunc_d math_sqrt\r\n  |  vsqrt.f64 d0, d0\r\n  |->fff_resd:\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  vstr d0, [BASE, #-8]\r\n  |  b ->fff_res1\r\n  |.else\r\n  |  math_extern sqrt\r\n  |.endif\r\n  |\r\n  |.ffunc math_log\r\n  |.if HFABI\r\n  |  ldr CARG2, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |  vldr d0, [BASE]\r\n  |   bne ->fff_fallback\r\n  |.else\r\n  |  ldrd CARG12, [BASE]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |   bne ->fff_fallback\r\n  |.endif\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern log\r\n  |  .IOS mov BASE, RA\r\n  |.if HFABI\r\n  |  b ->fff_resd\r\n  |.else\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.if HFABI\r\n  |  .ffunc math_ldexp\r\n  |  ldr CARG4, [BASE, #4]\r\n  |  ldrd CARG12, [BASE, #8]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  vldr d0, [BASE]\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern ldexp\t\t\t// (double x, int exp)\r\n  |  .IOS mov BASE, RA\r\n  |  b ->fff_resd\r\n  |.else\r\n  |.ffunc_2 math_ldexp\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  bhs ->fff_fallback\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern ldexp\t\t\t// (double x, int exp)\r\n  |  .IOS mov BASE, RA\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |\r\n  |.if HFABI\r\n  |.ffunc_d math_frexp\r\n  |  mov CARG1, sp\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern frexp\r\n  |  .IOS mov BASE, RA\r\n  |   ldr CARG3, [sp]\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  vstr d0, [BASE, #-8]\r\n  |    mov RC, #(2+1)*8\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |.else\r\n  |.ffunc_n math_frexp\r\n  |  mov CARG3, sp\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern frexp\r\n  |  .IOS mov BASE, RA\r\n  |   ldr CARG3, [sp]\r\n  |   mvn CARG4, #~LJ_TISNUM\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG12, [BASE, #-8]\r\n  |    mov RC, #(2+1)*8\r\n  |   strd CARG34, [BASE]\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.if HFABI\r\n  |.ffunc_d math_modf\r\n  |  sub CARG1, BASE, #8\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern modf\r\n  |  .IOS mov BASE, RA\r\n  |   mov RC, #(2+1)*8\r\n  |  vstr d0, [BASE]\r\n  |  b ->fff_res\r\n  |.else\r\n  |.ffunc_n math_modf\r\n  |  sub CARG3, BASE, #8\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  .IOS mov RA, BASE\r\n  |  bl extern modf\r\n  |  .IOS mov BASE, RA\r\n  |   mov RC, #(2+1)*8\r\n  |  strd CARG12, [BASE]\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.macro math_minmax, name, cond, fcond\r\n  |.if FPU\r\n  |  .ffunc_1 name\r\n  |   add RB, BASE, RC\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |   add RA, BASE, #8\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  ldrd CARG34, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne >3\r\n  |  cmp CARG1, CARG3\r\n  |   add RA, RA, #8\r\n  |  mov..cond CARG1, CARG3\r\n  |  b <1\r\n  |3:  // Convert intermediate result to number and continue below.\r\n  |  vmov s4, CARG1\r\n  |  bhi ->fff_fallback\r\n  |  vldr d1, [RA]\r\n  |  vcvt.f64.s32 d0, s4\r\n  |  b >6\r\n  |\r\n  |4:\r\n  |  vldr d0, [BASE]\r\n  |  bhi ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  ldrd CARG34, [RA]\r\n  |  vldr d1, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_resd\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs >7\r\n  |6:\r\n  |  vcmp.f64 d0, d1\r\n  |  vmrs\r\n  |   add RA, RA, #8\r\n  |  vmov..fcond.f64 d0, d1\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |  vmov s4, CARG3\r\n  |  bhi ->fff_fallback\r\n  |  vcvt.f64.s32 d1, s4\r\n  |  b <6\r\n  |\r\n  |.else\r\n  |\r\n  |  .ffunc_1 name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |   mov RA, #8\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |   cmp RA, RC\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bne >3\r\n  |  cmp CARG1, CARG3\r\n  |   add RA, RA, #8\r\n  |  mov..cond CARG1, CARG3\r\n  |  b <1\r\n  |3:  // Convert intermediate result to number and continue below.\r\n  |  bhi ->fff_fallback\r\n  |  bl extern __aeabi_i2d\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |  b >6\r\n  |\r\n  |4:\r\n  |  bhi ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  ldrd CARG34, [BASE, RA]\r\n  |   cmp RA, RC\r\n  |   bhs ->fff_restv\r\n  |  checktp CARG4, LJ_TISNUM\r\n  |  bhs >7\r\n  |6:\r\n  |  bl extern __aeabi_cdcmple\r\n  |   add RA, RA, #8\r\n  |  mov..fcond CARG1, CARG3\r\n  |  mov..fcond CARG2, CARG4\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |  bhi ->fff_fallback\r\n  |  strd CARG12, TMPD\r\n  |  mov CARG1, CARG3\r\n  |  bl extern __aeabi_i2d\r\n  |  ldrd CARG34, TMPD\r\n  |  b <6\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, gt, hi\r\n  |  math_minmax math_max, lt, lo\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  ldrd CARG12, [BASE]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |   cmp NARGS8:RC, #8\r\n  |   checktpeq CARG2, LJ_TSTR\t\t// Need exactly 1 argument.\r\n  |   bne ->fff_fallback\r\n  |  ldr CARG3, STR:CARG1->len\r\n  |   ldrb CARG1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  cmp CARG3, #0\r\n  |  moveq RC, #(0+1)*8\r\n  |  movne RC, #(1+1)*8\r\n  |   strd CARG12, [BASE, #-8]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |   cmp NARGS8:RC, #8\t\t\t// Need exactly 1 argument.\r\n  |   checktpeq CARG2, LJ_TISNUM\r\n  |   bicseq CARG4, CARG1, #255\r\n  |  mov CARG3, #1\r\n  |   bne ->fff_fallback\r\n  |  str CARG1, TMPD\r\n  |  mov CARG2, TMPDp\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  // CARG2 = str, CARG3 = len.\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |->fff_resstr:\r\n  |  // Returns GCstr *.\r\n  |  ldr BASE, L->base\r\n  |   mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  ldrd CARG12, [BASE]\r\n  |   ldrd CARG34, [BASE, #16]\r\n  |    cmp NARGS8:RC, #16\r\n  |     mvn RB, #0\r\n  |    beq >1\r\n  |    blo ->fff_fallback\r\n  |   checktp CARG4, LJ_TISNUM\r\n  |    mov RB, CARG3\r\n  |   bne ->fff_fallback\r\n  |1:\r\n  |  ldrd CARG34, [BASE, #8]\r\n  |  checktp CARG2, LJ_TSTR\r\n  |   ldreq CARG2, STR:CARG1->len\r\n  |  checktpeq CARG4, LJ_TISNUM\r\n  |  bne ->fff_fallback\r\n  |  // CARG1 = str, CARG2 = str->len, CARG3 = start, RB = end\r\n  |  add CARG4, CARG2, #1\r\n  |  cmp CARG3, #0\t\t\t// if (start < 0) start += len+1\r\n  |  addlt CARG3, CARG3, CARG4\r\n  |  cmp CARG3, #1\t\t\t// if (start < 1) start = 1\r\n  |  movlt CARG3, #1\r\n  |  cmp RB, #0\t\t\t\t// if (end < 0) end += len+1\r\n  |  addlt RB, RB, CARG4\r\n  |  bic RB, RB, RB, asr #31\t\t// if (end < 0) end = 0\r\n  |  cmp RB, CARG2\t\t\t// if (end > len) end = len\r\n  |   add CARG1, STR:CARG1, #sizeof(GCstr)-1\r\n  |  movgt RB, CARG2\r\n  |   add CARG2, CARG1, CARG3\r\n  |  subs CARG3, RB, CARG3\t\t// len = end - start\r\n  |   add CARG3, CARG3, #1\t\t// len += 1\r\n  |  bge ->fff_newstr\r\n  |->fff_emptystr:\r\n  |  sub STR:CARG1, DISPATCH, #-DISPATCH_GL(strempty)\r\n  |  mvn CARG2, #~LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc string_ .. name\r\n  |  ffgccheck\r\n  |  ldr CARG3, [BASE, #4]\r\n  |   cmp NARGS8:RC, #8\r\n  |  ldr STR:CARG2, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  sub SBUF:CARG1, DISPATCH, #-DISPATCH_GL(tmpbuf)\r\n  |  checkstr CARG3, ->fff_fallback\r\n  |  ldr CARG4, SBUF:CARG1->b\r\n  |   str BASE, L->base\r\n  |   str PC, SAVE_PC\r\n  |   str L, SBUF:CARG1->L\r\n  |  str CARG4, SBUF:CARG1->p\r\n  |  bl extern lj_buf_putstr_ .. name\r\n  |  bl extern lj_buf_tostr\r\n  |  b ->fff_resstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |// FP number to bit conversion for soft-float. Clobbers r0-r3.\r\n  |->vm_tobit_fb:\r\n  |  bhi ->fff_fallback\r\n  |->vm_tobit:\r\n  |  lsl RB, CARG2, #1\r\n  |  adds RB, RB, #0x00200000\r\n  |  movpl CARG1, #0\t\t\t// |x| < 1?\r\n  |  bxpl lr\r\n  |  mvn CARG4, #0x3e0\r\n  |  subs RB, CARG4, RB, asr #21\r\n  |  bmi >1\t\t\t\t// |x| >= 2^32?\r\n  |  lsl CARG4, CARG2, #11\r\n  |  orr CARG4, CARG4, #0x80000000\r\n  |  orr CARG4, CARG4, CARG1, lsr #21\r\n  |   cmp CARG2, #0\r\n  |  lsr CARG1, CARG4, RB\r\n  |   rsblt CARG1, CARG1, #0\r\n  |  bx lr\r\n  |1:\r\n  |  add RB, RB, #21\r\n  |  lsr CARG4, CARG1, RB\r\n  |  rsb RB, RB, #20\r\n  |  lsl CARG1, CARG2, #12\r\n  |   cmp CARG2, #0\r\n  |  orr CARG1, CARG4, CARG1, lsl RB\r\n  |   rsblt CARG1, CARG1, #0\r\n  |  bx lr\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_1 bit_..name\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit tobit\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  mov CARG3, CARG1\r\n  |  mov RA, #8\r\n  |1:\r\n  |  ldrd CARG12, [BASE, RA]\r\n  |   cmp RA, NARGS8:RC\r\n  |    add RA, RA, #8\r\n  |   bge >2\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |  ins CARG3, CARG3, CARG1\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, orr\r\n  |.ffunc_bit_op bxor, eor\r\n  |\r\n  |2:\r\n  |  mvn CARG4, #~LJ_TISNUM\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  strd CARG34, [BASE, #-8]\r\n  |  b ->fff_res1\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  eor CARG3, CARG1, CARG1, ror #16\r\n  |  bic CARG3, CARG3, #0x00ff0000\r\n  |  ror CARG1, CARG1, #8\r\n  |   mvn CARG2, #~LJ_TISNUM\r\n  |  eor CARG1, CARG1, CARG3, lsr #8\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  mvn CARG1, CARG1\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc bit_..name\r\n  |  ldrd CARG12, [BASE, #8]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |.if shmod == 0\r\n  |  and RA, CARG1, #31\r\n  |.else\r\n  |  rsb RA, CARG1, #0\r\n  |.endif\r\n  |  ldrd CARG12, [BASE]\r\n  |  checktp CARG2, LJ_TISNUM\r\n  |  blne ->vm_tobit_fb\r\n  |  ins CARG1, CARG1, RA\r\n  |  mvn CARG2, #~LJ_TISNUM\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, lsl, 0\r\n  |.ffunc_bit_sh rshift, lsr, 0\r\n  |.ffunc_bit_sh arshift, asr, 0\r\n  |.ffunc_bit_sh rol, ror, 1\r\n  |.ffunc_bit_sh ror, ror, 0\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |   ldr CARG3, [BASE, FRAME_FUNC]\r\n  |  ldr CARG2, L->maxstack\r\n  |  add CARG1, BASE, NARGS8:RC\r\n  |    ldr PC, [BASE, FRAME_PC]\t\t// Fallback may overwrite PC.\r\n  |  str CARG1, L->top\r\n  |   ldr CARG3, CFUNC:CARG3->f\r\n  |    str BASE, L->base\r\n  |  add CARG1, CARG1, #8*LUA_MINSTACK\r\n  |    str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  cmp CARG1, CARG2\r\n  |   mov CARG1, L\r\n  |  bhi >5\t\t\t\t// Need to grow stack.\r\n  |   blx CARG3\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |   ldr BASE, L->base\r\n  |  cmp CRET1, #0\r\n  |   lsl RC, CRET1, #3\r\n  |   sub RA, BASE, #8\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |   ldr CARG1, L->top\r\n  |    ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   bic CARG2, PC, #FRAME_TYPEP\r\n  |  ldreq INS, [PC, #-4]\r\n  |  andeq CARG2, MASKR8, INS, lsr #5\t// Conditional decode_RA8.\r\n  |  addeq CARG2, CARG2, #8\r\n  |  sub RB, BASE, CARG2\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->base\r\n  |  cmp CARG1, CARG1\t\t\t// Set zero-flag to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  mov RA, lr\r\n  |   str BASE, L->base\r\n  |  add CARG2, BASE, NARGS8:RC\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  str CARG2, L->top\r\n  |  mov CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |   ldr BASE, L->base\r\n  |  mov lr, RA\t\t\t\t// Help return address predictor.\r\n  |   ldr CFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |  bx lr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  tst CARG1, #HOOK_VMEVENT\t\t// No recording while in vmevent.\r\n  |  bne >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |   ldr CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  tst CARG1, #HOOK_ACTIVE\r\n  |  bne >1\r\n  |   sub CARG2, CARG2, #1\r\n  |  tst CARG1, #LUA_MASKLINE|LUA_MASKCOUNT\r\n  |   strne CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |  tst CARG1, #HOOK_ACTIVE\t\t// Hook already active?\r\n  |  beq >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |  decode_OP OP, INS\r\n  |  add OP, DISPATCH, OP, lsl #2\r\n  |  ldr pc, [OP, #GG_DISP2STATIC]\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  ldrb CARG1, [DISPATCH, #DISPATCH_GL(hookmask)]\r\n  |   ldr CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |  tst CARG1, #HOOK_ACTIVE\t\t// Hook already active?\r\n  |  bne <5\r\n  |  tst CARG1, #LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beq <5\r\n  |   subs CARG2, CARG2, #1\r\n  |   str CARG2, [DISPATCH, #DISPATCH_GL(hookcount)]\r\n  |   beq >1\r\n  |  tst CARG1, #LUA_MASKLINE\r\n  |  beq <5\r\n  |1:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, PC\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  ldr BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  ldrb OP, [PC, #-4]\r\n  |   ldr INS, [PC, #-4]\r\n  |  add OP, DISPATCH, OP, lsl #2\r\n  |  ldr OP, [OP, #GG_DISP2STATIC]\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RD RC, INS\r\n  |  bx OP\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  ldr CARG1, [CARG4, #-24]\r\n  |   add PC, PC, #4\r\n  |  str CARG1, SAVE_MULTRES\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Same as curr_topL(L).\r\n  |   sub CARG1, DISPATCH, #-GG_DISP2J\r\n  |   str PC, SAVE_PC\r\n  |  ldr CARG3, LFUNC:CARG3->field_pc\r\n  |   mov CARG2, PC\r\n  |   str L, [DISPATCH, #DISPATCH_J(L)]\r\n  |  ldrb CARG3, [CARG3, #PC2PROTO(framesize)]\r\n  |   str BASE, L->base\r\n  |  add CARG3, BASE, CARG3, lsl #3\r\n  |  str CARG3, L->top\r\n  |  bl extern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  orr CARG2, PC, #1\r\n  |1:\r\n  |.endif\r\n  |  add CARG4, BASE, RC\r\n  |   str PC, SAVE_PC\r\n  |    mov CARG1, L\r\n  |   str BASE, L->base\r\n  |    sub RA, RA, BASE\r\n  |  str CARG4, L->top\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  ldr BASE, L->base\r\n  |   ldr CARG4, L->top\r\n  |    mov CARG2, #0\r\n  |  add RA, BASE, RA\r\n  |   sub NARGS8:RC, CARG4, BASE\r\n  |    str CARG2, SAVE_PC\t\t// Invalidate for subsequent line hook.\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   ldr INS, [PC, #-4]\r\n  |  bx CRET1\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |.if JIT\r\n  |  // RA = resultptr, CARG4 = meta base\r\n  |   ldr RB, SAVE_MULTRES\r\n  |  ldr INS, [PC, #-4]\r\n  |    ldr CARG3, [CARG4, #-24]\t\t// Save previous trace number.\r\n  |   subs RB, RB, #8\r\n  |  decode_RA8 RC, INS\t\t\t// Call base.\r\n  |   beq >2\r\n  |1:  // Move results down.\r\n  |  ldrd CARG12, [RA]\r\n  |    add RA, RA, #8\r\n  |   subs RB, RB, #8\r\n  |  strd CARG12, [BASE, RC]\r\n  |    add RC, RC, #8\r\n  |   bne <1\r\n  |2:\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RB8 RB, INS\r\n  |   add RA, RA, RB\r\n  |  ldr CARG1, [DISPATCH, #DISPATCH_J(trace)]\r\n  |3:\r\n  |   cmp RA, RC\r\n  |  mvn CARG2, #~LJ_TNIL\r\n  |   bhi >9\t\t\t\t// More results wanted?\r\n  |\r\n  |  ldr TRACE:RA, [CARG1, CARG3, lsl #2]\r\n  |  cmp TRACE:RA, #0\r\n  |  beq ->cont_nop\r\n  |  ldrh RC, TRACE:RA->link\r\n  |  cmp RC, CARG3\r\n  |  beq ->cont_nop\t\t\t// Blacklisted.\r\n  |  cmp RC, #0\r\n  |  bne =>BC_JLOOP\t\t\t// Jump to stitched trace.\r\n  |\r\n  |  // Stitch a new trace to the previous trace.\r\n  |  str CARG3, [DISPATCH, #DISPATCH_J(exitno)]\r\n  |  str L, [DISPATCH, #DISPATCH_J(L)]\r\n  |  str BASE, L->base\r\n  |  sub CARG1, DISPATCH, #-GG_DISP2J\r\n  |  mov CARG2, PC\r\n  |  bl extern lj_dispatch_stitch\t// (jit_State *J, const BCIns *pc)\r\n  |  ldr BASE, L->base\r\n  |  b ->cont_nop\r\n  |\r\n  |9:  // Fill up results with nil.\r\n  |  strd CARG12, [BASE, RC]\r\n  |  add RC, RC, #8\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, PC\r\n  |  bl extern lj_dispatch_profile\t// (lua_State *L, const BCIns *pc)\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  ldr BASE, L->base\r\n  |  sub PC, PC, #4\r\n  |  b ->cont_nop\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  sub sp, sp, #12\r\n  |  push {r0,r1,r2,r3,r4,r5,r6,r7,r8,r9,r10,r11,r12}\r\n  |  ldr CARG1, [sp, #64]\t// Load original value of lr.\r\n  |   ldr DISPATCH, [lr]\t// Load DISPATCH.\r\n  |    add CARG3, sp, #64\t// Recompute original value of sp.\r\n  |   mv_vmstate CARG4, EXIT\r\n  |    str CARG3, [sp, #52]\t// Store sp in RID_SP\r\n  |   st_vmstate CARG4\r\n  |  ldr CARG2, [CARG1, #-4]!\t// Get exit instruction.\r\n  |   str CARG1, [sp, #56]\t// Store exit pc in RID_LR and RID_PC.\r\n  |   str CARG1, [sp, #60]\r\n  |.if FPU\r\n  |  vpush {d0-d15}\r\n  |.endif\r\n  |  lsl CARG2, CARG2, #8\r\n  |  add CARG1, CARG1, CARG2, asr #6\r\n  |   ldr CARG2, [lr, #4]\t// Load exit stub group offset.\r\n  |   sub CARG1, CARG1, lr\r\n  |  ldr L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n  |   add CARG1, CARG2, CARG1, lsr #2\t// Compute exit number.\r\n  |    ldr BASE, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n  |   str CARG1, [DISPATCH, #DISPATCH_J(exitno)]\r\n  |   mov CARG4, #0\r\n  |    str BASE, L->base\r\n  |  str L, [DISPATCH, #DISPATCH_J(L)]\r\n  |   str CARG4, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n  |  sub CARG1, DISPATCH, #-GG_DISP2J\r\n  |  mov CARG2, sp\r\n  |  bl extern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  ldr CARG2, L->cframe\r\n  |   ldr BASE, L->base\r\n  |  bic CARG2, CARG2, #~CFRAME_RAWMASK\t// Use two steps: bic sp is deprecated.\r\n  |  mov sp, CARG2\r\n  |   ldr PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  str L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |  b >1\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |  // CARG1 = MULTRES or negated error code, BASE, PC and DISPATCH set.\r\n  |.if JIT\r\n  |  ldr L, SAVE_L\r\n  |1:\r\n  |  cmp CARG1, #0\r\n  |  blt >9\t\t\t\t// Check for error from exit.\r\n  |   lsl RC, CARG1, #3\r\n  |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n  |   str RC, SAVE_MULTRES\r\n  |   mov CARG3, #0\r\n  |   str BASE, L->base\r\n  |  ldr CARG2, LFUNC:CARG2->field_pc\r\n  |   str CARG3, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n  |    mv_vmstate CARG4, INTERP\r\n  |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  ldrb OP, [PC]\r\n  |     mov MASKR8, #255\r\n  |   ldr INS, [PC], #4\r\n  |     lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |    st_vmstate CARG4\r\n  |  cmp OP, #BC_FUNCC+2\t\t// Fast function?\r\n  |  bhs >4\r\n  |2:\r\n  |  cmp OP, #BC_FUNCF\t\t\t// Function header?\r\n  |  ldr OP, [DISPATCH, OP, lsl #2]\r\n  |   decode_RA8 RA, INS\r\n  |   lsrlo RC, INS, #16\t// No: Decode operands A*8 and D.\r\n  |   subhs RC, RC, #8\r\n  |   addhs RA, RA, BASE\t// Yes: RA = BASE+framesize*8, RC = nargs*8\r\n  |   ldrhs CARG3, [BASE, FRAME_FUNC]\r\n  |  bx OP\r\n  |\r\n  |4:  // Check frame below fast function.\r\n  |  ldr CARG1, [BASE, FRAME_PC]\r\n  |  ands CARG2, CARG1, #FRAME_TYPE\r\n  |  bne <2\t\t\t// Trace stitching continuation?\r\n  |  // Otherwise set KBASE for Lua function below fast function.\r\n  |  ldr CARG3, [CARG1, #-4]\r\n  |  decode_RA8 CARG1, CARG3\r\n  |  sub CARG2, BASE, CARG1\r\n  |  ldr LFUNC:CARG3, [CARG2, #-16]\r\n  |  ldr CARG3, LFUNC:CARG3->field_pc\r\n  |  ldr KBASE, [CARG3, #PC2PROTO(k)]\r\n  |  b <2\r\n  |\r\n  |9:  // Rethrow error from the right C frame.\r\n  |  rsb CARG2, CARG1, #0\r\n  |  mov CARG1, L\r\n  |  bl extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called from JIT code.\r\n  |//\r\n  |// double lj_vm_floor/ceil/trunc(double x);\r\n  |.macro vm_round, func, hf\r\n  |.if hf == 1\r\n  |  vmov CARG1, CARG2, d0\r\n  |.endif\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  bpl >2\t\t\t\t// |x| < 1?\r\n  |  mvn CARG4, #0x3cc\r\n  |  subs RB, CARG4, RB, asr #21\t// 2^0: RB = 51, 2^51: RB = 0.\r\n  |  bxlo lr\t\t\t\t// |x| >= 2^52: done.\r\n  |  mvn CARG4, #1\r\n  |   bic CARG3, CARG1, CARG4, lsl RB\t// ztest = lo & ~lomask\r\n  |  and CARG1, CARG1, CARG4, lsl RB\t// lo &= lomask\r\n  |  subs RB, RB, #32\r\n  |   bicpl CARG4, CARG2, CARG4, lsl RB\t// |x| <= 2^20: ztest |= hi & ~himask\r\n  |   orrpl CARG3, CARG3, CARG4\r\n  |   mvnpl CARG4, #1\r\n  |  andpl CARG2, CARG2, CARG4, lsl RB\t// |x| <= 2^20: hi &= himask\r\n  |.if \"func\" == \"floor\"\r\n  |   tst CARG3, CARG2, asr #31\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\r\n  |   bics CARG3, CARG3, CARG2, asr #31\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |.if hf == 1\r\n  |  vmoveq d0, CARG1, CARG2\r\n  |.endif\r\n  |  bxeq lr\t\t\t\t// iszero: done.\r\n  |  mvn CARG4, #1\r\n  |  cmp RB, #0\r\n  |  lslpl CARG3, CARG4, RB\r\n  |  mvnmi CARG3, #0\r\n  |  add RB, RB, #32\r\n  |  subs CARG1, CARG1, CARG4, lsl RB\t// lo = lo-lomask\r\n  |  sbc CARG2, CARG2, CARG3\t\t// hi = hi-himask+carry\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |\r\n  |2:  // |x| < 1:\r\n  |  bxcs lr\t\t\t\t// |x| is not finite.\r\n  |  orr CARG3, CARG3, CARG1\t\t// ztest = (2*hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  tst CARG3, CARG2, asr #31\t\t// iszero = ((ztest & signmask) == 0)\r\n  |.else\r\n  |  bics CARG3, CARG3, CARG2, asr #31\t// iszero = ((ztest & ~signmask) == 0)\r\n  |.endif\r\n  |  mov CARG1, #0\t\t\t// lo = 0\r\n  |  and CARG2, CARG2, #0x80000000\r\n  |  ldrne CARG4, <9\t\t\t// hi = sign(x) | (iszero ? 0.0 : 1.0)\r\n  |  orrne CARG2, CARG2, CARG4\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |.endmacro\r\n  |\r\n  |9:\r\n  |  .long 0x3ff00000\t\t\t// hiword(+1.0)\r\n  |\r\n  |->vm_floor:\r\n  |.if HFABI\r\n  |  vm_round floor, 1\r\n  |.endif\r\n  |->vm_floor_sf:\r\n  |  vm_round floor, 0\r\n  |\r\n  |->vm_ceil:\r\n  |.if HFABI\r\n  |  vm_round ceil, 1\r\n  |.endif\r\n  |->vm_ceil_sf:\r\n  |  vm_round ceil, 0\r\n  |\r\n  |.macro vm_trunc, hf\r\n  |.if JIT\r\n  |.if hf == 1\r\n  |  vmov CARG1, CARG2, d0\r\n  |.endif\r\n  |  lsl CARG3, CARG2, #1\r\n  |  adds RB, CARG3, #0x00200000\r\n  |  andpl CARG2, CARG2, #0x80000000\t// |x| < 1? hi = sign(x), lo = 0.\r\n  |  movpl CARG1, #0\r\n  |.if hf == 1\r\n  |  vmovpl d0, CARG1, CARG2\r\n  |.endif\r\n  |  bxpl lr\r\n  |  mvn CARG4, #0x3cc\r\n  |  subs RB, CARG4, RB, asr #21\t// 2^0: RB = 51, 2^51: RB = 0.\r\n  |  bxlo lr\t\t\t\t// |x| >= 2^52: already done.\r\n  |  mvn CARG4, #1\r\n  |  and CARG1, CARG1, CARG4, lsl RB\t// lo &= lomask\r\n  |  subs RB, RB, #32\r\n  |  andpl CARG2, CARG2, CARG4, lsl RB\t// |x| <= 2^20: hi &= himask\r\n  |.if hf == 1\r\n  |  vmov d0, CARG1, CARG2\r\n  |.endif\r\n  |  bx lr\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |->vm_trunc:\r\n  |.if HFABI\r\n  |  vm_trunc 1\r\n  |.endif\r\n  |->vm_trunc_sf:\r\n  |  vm_trunc 0\r\n  |\r\n  |  // double lj_vm_mod(double dividend, double divisor);\r\n  |->vm_mod:\r\n  |.if FPU\r\n  |  // Special calling convention. Also, RC (r11) is not preserved.\r\n  |  vdiv.f64 d0, d6, d7\r\n  |   mov RC, lr\r\n  |  vmov CARG1, CARG2, d0\r\n  |  bl ->vm_floor_sf\r\n  |  vmov d0, CARG1, CARG2\r\n  |  vmul.f64 d0, d0, d7\r\n  |   mov lr, RC\r\n  |  vsub.f64 d6, d6, d0\r\n  |  bx lr\r\n  |.else\r\n  |  push {r0, r1, r2, r3, r4, lr}\r\n  |  bl extern __aeabi_ddiv\r\n  |  bl ->vm_floor_sf\r\n  |  ldrd CARG34, [sp, #8]\r\n  |  bl extern __aeabi_dmul\r\n  |  ldrd CARG34, [sp]\r\n  |  eor CARG2, CARG2, #0x80000000\r\n  |  bl extern __aeabi_dadd\r\n  |  add sp, sp, #20\r\n  |  pop {pc}\r\n  |.endif\r\n  |\r\n  |  // int lj_vm_modi(int dividend, int divisor);\r\n  |->vm_modi:\r\n  |  ands RB, CARG1, #0x80000000\r\n  |  rsbmi CARG1, CARG1, #0\t\t// a = |dividend|\r\n  |  eor RB, RB, CARG2, asr #1\t\t// Keep signdiff and sign(divisor).\r\n  |  cmp CARG2, #0\r\n  |  rsbmi CARG2, CARG2, #0\t\t// b = |divisor|\r\n  |  subs CARG4, CARG2, #1\r\n  |  cmpne CARG1, CARG2\r\n  |  moveq CARG1, #0\t\t\t// if (b == 1 || a == b) a = 0\r\n  |  tsthi CARG2, CARG4\r\n  |  andeq CARG1, CARG1, CARG4\t\t// else if ((b & (b-1)) == 0) a &= b-1\r\n  |  bls >1\r\n  |  // Use repeated subtraction to get the remainder.\r\n  |  clz CARG3, CARG1\r\n  |  clz CARG4, CARG2\r\n  |  sub CARG4, CARG4, CARG3\r\n  |  rsbs CARG3, CARG4, #31\t\t// entry = (31-(clz(b)-clz(a)))*8\r\n  |  addne pc, pc, CARG3, lsl #3\t// Duff's device.\r\n  |  nop\r\n  {\r\n    int i;\r\n    for (i = 31; i >= 0; i--) {\r\n      |  cmp CARG1, CARG2, lsl #i\r\n      |  subhs CARG1, CARG1, CARG2, lsl #i\r\n    }\r\n  }\r\n  |1:\r\n  |  cmp CARG1, #0\r\n  |  cmpne RB, #0\r\n  |  submi CARG1, CARG1, CARG2\t\t// if (y != 0 && signdiff) y = y - b\r\n  |  eors CARG2, CARG1, RB, lsl #1\r\n  |  rsbmi CARG1, CARG1, #0\t\t// if (sign(divisor) != sign(y)) y = -y\r\n  |  bx lr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions.\r\n  |// Saveregs already performed. Callback slot number in [sp], g in r12.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  ldr CTSTATE, GL:r12->ctype_state\r\n  |   add DISPATCH, r12, #GG_G2DISP\r\n  |.if FPU\r\n  |  str r4, SAVE_R4\r\n  |  add r4, sp, CFRAME_SPACE+4+8*8\r\n  |  vstmdb r4!, {d8-d15}\r\n  |.endif\r\n  |.if HFABI\r\n  |  add r12, CTSTATE, #offsetof(CTState, cb.fpr[8])\r\n  |.endif\r\n  |  strd CARG34, CTSTATE->cb.gpr[2]\r\n  |  strd CARG12, CTSTATE->cb.gpr[0]\r\n  |.if HFABI\r\n  |  vstmdb r12!, {d0-d7}\r\n  |.endif\r\n  |  ldr CARG4, [sp]\r\n  |   add CARG3, sp, #CFRAME_SIZE\r\n  |    mov CARG1, CTSTATE\r\n  |  lsr CARG4, CARG4, #3\r\n  |   str CARG3, CTSTATE->cb.stack\r\n  |    mov CARG2, sp\r\n  |  str CARG4, CTSTATE->cb.slot\r\n  |  str CTSTATE, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  bl extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // Returns lua_State *.\r\n  |  ldr BASE, L:CRET1->base\r\n  |    mv_vmstate CARG2, INTERP\r\n  |  ldr RC, L:CRET1->top\r\n  |    mov MASKR8, #255\r\n  |   ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |    mov L, CRET1\r\n  |  sub RC, RC, BASE\r\n  |    lsl MASKR8, MASKR8, #3\t\t// MASKR8 = 255*8.\r\n  |    st_vmstate CARG2\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  ldr CTSTATE, [DISPATCH, #DISPATCH_GL(ctype_state)]\r\n  |   str BASE, L->base\r\n  |   str CARG4, L->top\r\n  |  str L, CTSTATE->L\r\n  |  mov CARG1, CTSTATE\r\n  |  mov CARG2, RA\r\n  |  bl extern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |  ldrd CARG12, CTSTATE->cb.gpr[0]\r\n  |.if HFABI\r\n  |  vldr d0, CTSTATE->cb.fpr[0]\r\n  |.endif\r\n  |  b ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, r4\r\n  |  push {CCSTATE, r5, r11, lr}\r\n  |  mov CCSTATE, CARG1\r\n  |  ldr CARG1, CCSTATE:CARG1->spadj\r\n  |   ldrb CARG2, CCSTATE->nsp\r\n  |    add CARG3, CCSTATE, #offsetof(CCallState, stack)\r\n  |.if HFABI\r\n  |  add RB, CCSTATE, #offsetof(CCallState, fpr[0])\r\n  |.endif\r\n  |  mov r11, sp\r\n  |  sub sp, sp, CARG1\t\t\t// Readjust stack.\r\n  |   subs CARG2, CARG2, #1\r\n  |.if HFABI\r\n  |  vldm RB, {d0-d7}\r\n  |.endif\r\n  |    ldr RB, CCSTATE->func\r\n  |   bmi >2\r\n  |1:  // Copy stack slots.\r\n  |  ldr CARG4, [CARG3, CARG2, lsl #2]\r\n  |  str CARG4, [sp, CARG2, lsl #2]\r\n  |  subs CARG2, CARG2, #1\r\n  |  bpl <1\r\n  |2:\r\n  |  ldrd CARG12, CCSTATE->gpr[0]\r\n  |  ldrd CARG34, CCSTATE->gpr[2]\r\n  |  blx RB\r\n  |  mov sp, r11\r\n  |.if HFABI\r\n  |  add r12, CCSTATE, #offsetof(CCallState, fpr[4])\r\n  |.endif\r\n  |  strd CRET1, CCSTATE->gpr[0]\r\n  |.if HFABI\r\n  |  vstmdb r12!, {d0-d3}\r\n  |.endif\r\n  |  pop {CCSTATE, r5, r11, pc}\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RC = src2, JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, BASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bne >3\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  bne >4\r\n    |  cmp CARG1, CARG3\r\n    if (op == BC_ISLT) {\r\n      |  sublt PC, RB, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subge PC, RB, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  suble PC, RB, #0x20000\r\n    } else {\r\n      |  subgt PC, RB, #0x20000\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |3: // CARG12 is not an integer.\r\n    |.if FPU\r\n    |   vldr d0, [RA]\r\n    |  bhi ->vmeta_comp\r\n    |  // d0 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |   vldr d1, [RC]\r\n    |  blo >5\r\n    |  bhi ->vmeta_comp\r\n    |  // d0 is a number, CARG3 is an integer.\r\n    |  vmov s4, CARG3\r\n    |  vcvt.f64.s32 d1, s4\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, CARG34 is not an integer.\r\n    |   vldr d1, [RC]\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG1 is an integer, d1 is a number.\r\n    |  vmov s4, CARG1\r\n    |  vcvt.f64.s32 d0, s4\r\n    |5:  // d0 and d1 are numbers.\r\n    |  vcmp.f64 d0, d1\r\n    |  vmrs\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    if (op == BC_ISLT) {\r\n      |  sublo PC, RB, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subhs PC, RB, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  subls PC, RB, #0x20000\r\n    } else {\r\n      |  subhi PC, RB, #0x20000\r\n    }\r\n    |  b <1\r\n    |.else\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG12 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  movlo RA, RB\t\t\t// Save RB.\r\n    |  blo >5\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG12 is a number, CARG3 is an integer.\r\n    |  mov CARG1, CARG3\r\n    |  mov RC, RA\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  mov CARG3, CARG1\r\n    |  mov CARG4, CARG2\r\n    |  ldrd CARG12, [RC]\t\t// Restore first operand.\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, CARG34 is not an integer.\r\n    |  bhi ->vmeta_comp\r\n    |  // CARG1 is an integer, CARG34 is a number.\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  ldrd CARG34, [RC]\t\t// Restore second operand.\r\n    |5:  // CARG12 and CARG34 are numbers.\r\n    |  bl extern __aeabi_cdcmple\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    if (op == BC_ISLT) {\r\n      |  sublo PC, RA, #0x20000\r\n    } else if (op == BC_ISGE) {\r\n      |  subhs PC, RA, #0x20000\r\n    } else if (op == BC_ISLE) {\r\n      |  subls PC, RA, #0x20000\r\n    } else {\r\n      |  subhi PC, RA, #0x20000\r\n    }\r\n    |  b <1\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RC = src2, JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, BASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  cmnls CARG4, #-LJ_TISNUM\r\n    if (vk) {\r\n      |  bls ->BC_ISEQN_Z\r\n    } else {\r\n      |  bls ->BC_ISNEN_Z\r\n    }\r\n    |  // Either or both types are not numbers.\r\n    |.if FFI\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  checktpne CARG4, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG2, CARG4\t\t\t// Compare types.\r\n    |  bne >2\t\t\t\t// Not the same type?\r\n    |  checktp CARG2, LJ_TISPRI\r\n    |  bhs >1\t\t\t\t// Same type and primitive type?\r\n    |\r\n    |  // Same types and not a primitive type. Compare GCobj or pvalue.\r\n    |  cmp CARG1, CARG3\r\n    if (vk) {\r\n      |  bne >3\t\t\t\t// Different GCobjs or pvalues?\r\n      |1:  // Branch if same.\r\n      |  sub PC, RB, #0x20000\r\n      |2:  // Different.\r\n      |  ins_next\r\n      |3:\r\n      |  checktp CARG2, LJ_TISTABUD\r\n      |  bhi <2\t\t\t\t// Different objects and not table/ud?\r\n    } else {\r\n      |  beq >1\t\t\t\t// Same GCobjs or pvalues?\r\n      |  checktp CARG2, LJ_TISTABUD\r\n      |  bhi >2\t\t\t\t// Different objects and not table/ud?\r\n    }\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    if (vk) {\r\n      |  beq <2\t\t\t// No metatable?\r\n    } else {\r\n      |  beq >2\t\t\t// No metatable?\r\n    }\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |   mov CARG4, #1-vk\t\t// ne = 0 or 1.\r\n    |   mov CARG2, CARG1\r\n    |  tst RA, #1<<MM_eq\r\n    |  beq ->vmeta_equal\t\t// 'no __eq' flag not set?\r\n    if (vk) {\r\n      |  b <2\r\n    } else {\r\n      |2:  // Branch if different.\r\n      |  sub PC, RB, #0x20000\r\n      |1:  // Same.\r\n      |  ins_next\r\n    }\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RC = str_const (~), JMP with RC = target\r\n    |   mvn RC, RC\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldr STR:CARG3, [KBASE, RC, lsl #2]\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TSTR\r\n    |.if FFI\r\n    |  bne >7\r\n    |  cmp CARG1, CARG3\r\n    |.else\r\n    |  cmpeq CARG1, CARG3\r\n    |.endif\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n      |1:\r\n    } else {\r\n      |1:\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  ins_next\r\n    |\r\n    |.if FFI\r\n    |7:\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  bne <1\r\n    |  b ->vmeta_equal_cd\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RC = num_const (~), JMP with RC = target\r\n    |   lsl RC, RC, #3\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    |    ldrh RB, [PC, #2]\r\n    |   ldrd CARG34, [RC, KBASE]!\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:\r\n    } else {\r\n      |->BC_ISNEN_Z:\r\n    }\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bne >3\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  bne >4\r\n    |  cmp CARG1, CARG3\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n      |1:\r\n    } else {\r\n      |1:\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // CARG12 is not an integer.\r\n    |.if FFI\r\n    |  bhi >7\r\n    |.else\r\n    if (!vk) {\r\n      |  subhi PC, RB, #0x20000\r\n    }\r\n    |  bhi <2\r\n    |.endif\r\n    |.if FPU\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  vmov s4, CARG3\r\n    |   vldr d0, [RA]\r\n    |  vldrlo d1, [RC]\r\n    |  vcvths.f64.s32 d1, s4\r\n    |  b >5\r\n    |4:  // CARG1 is an integer, d1 is a number.\r\n    |  vmov s4, CARG1\r\n    |   vldr d1, [RC]\r\n    |  vcvt.f64.s32 d0, s4\r\n    |5:  // d0 and d1 are numbers.\r\n    |  vcmp.f64 d0, d1\r\n    |  vmrs\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n    } else {\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  b <2\r\n    |.else\r\n    |  // CARG12 is a number.\r\n    |  checktp CARG4, LJ_TISNUM\r\n    |  movlo RA, RB\t\t\t// Save RB.\r\n    |  blo >5\r\n    |  // CARG12 is a number, CARG3 is an integer.\r\n    |  mov CARG1, CARG3\r\n    |  mov RC, RA\r\n    |4:  // CARG1 is an integer, CARG34 is a number.\r\n    |  mov RA, RB\t\t\t// Save RB.\r\n    |  bl extern __aeabi_i2d\r\n    |  ldrd CARG34, [RC]\t\t// Restore other operand.\r\n    |5:  // CARG12 and CARG34 are numbers.\r\n    |  bl extern __aeabi_cdcmpeq\r\n    if (vk) {\r\n      |  subeq PC, RA, #0x20000\r\n    } else {\r\n      |  subne PC, RA, #0x20000\r\n    }\r\n    |  b <2\r\n    |.endif\r\n    |\r\n    |.if FFI\r\n    |7:\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  bne <1\r\n    |  b ->vmeta_equal_cd\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RC = primitive_type (~), JMP with RC = target\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |   ldrh RB, [PC, #2]\r\n    |   add PC, PC, #4\r\n    |  mvn RC, RC\r\n    |   add RB, PC, RB, lsl #2\r\n    |.if FFI\r\n    |  checktp CARG2, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG2, RC\r\n    if (vk) {\r\n      |  subeq PC, RB, #0x20000\r\n    } else {\r\n      |  subne PC, RB, #0x20000\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RC = src, JMP with RC = target\r\n    |  add RC, BASE, RC, lsl #3\r\n    |   ldrh RB, [PC, #2]\r\n    |  ldrd CARG12, [RC]\r\n    |   add PC, PC, #4\r\n    |   add RB, PC, RB, lsl #2\r\n    |  checktp CARG2, LJ_TTRUE\r\n    if (op == BC_ISTC || op == BC_IST) {\r\n      |  subls PC, RB, #0x20000\r\n      if (op == BC_ISTC) {\r\n\t|  strdls CARG12, [BASE, RA]\r\n      }\r\n    } else {\r\n      |  subhi PC, RB, #0x20000\r\n      if (op == BC_ISFC) {\r\n\t|  strdhi CARG12, [BASE, RA]\r\n      }\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  // RA = src*8, RC = -type\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |   ins_next1\r\n    |  cmn CARG2, RC\r\n    |   ins_next2\r\n    |  bne ->vmeta_istype\r\n    |   ins_next3\r\n    break;\r\n  case BC_ISNUM:\r\n    |  // RA = src*8, RC = -(TISNUM-1)\r\n    |  ldrd CARG12, [BASE, RA]\r\n    |   ins_next1\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |   ins_next2\r\n    |  bhs ->vmeta_istype\r\n    |   ins_next3\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |   ins_next1\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RC = src\r\n    |  add RC, BASE, RC, lsl #3\r\n    |   ins_next1\r\n    |  ldr CARG1, [RC, #4]\r\n    |   add RA, BASE, RA\r\n    |   ins_next2\r\n    |  checktp CARG1, LJ_TTRUE\r\n    |  mvnls CARG2, #~LJ_TFALSE\r\n    |  mvnhi CARG2, #~LJ_TTRUE\r\n    |  str CARG2, [RA, #4]\r\n    |   ins_next3\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  checktp CARG2, LJ_TISNUM\r\n    |  bhi ->vmeta_unm\r\n    |  eorne CARG2, CARG2, #0x80000000\r\n    |  bne >5\r\n    |  rsbseq CARG1, CARG1, #0\r\n    |  ldrdvs CARG12, >9\r\n    |5:\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |.align 8\r\n    |9:\r\n    |  .long 0x00000000, 0x41e00000\t// 2^31.\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RC = src\r\n    |  lsl RC, RC, #3\r\n    |  ldrd CARG12, [BASE, RC]\r\n    |  checkstr CARG2, >2\r\n    |  ldr CARG1, STR:CARG1->len\r\n    |1:\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |2:\r\n    |  checktab CARG2, ->vmeta_len\r\n#if LJ_52\r\n    |  ldr TAB:CARG3, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG3, #0\r\n    |  bne >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  .IOS mov RC, BASE\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  .IOS mov BASE, RC\r\n    |  b <1\r\n#if LJ_52\r\n    |9:\r\n    |  ldrb CARG4, TAB:CARG3->nomm\r\n    |  tst CARG4, #1<<MM_len\r\n    |  bne <3\t\t\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithcheck, cond, ncond, target\r\n    ||if (vk == 1) {\r\n    |   cmn CARG4, #-LJ_TISNUM\r\n    |    cmn..cond CARG2, #-LJ_TISNUM\r\n    ||} else {\r\n    |   cmn CARG2, #-LJ_TISNUM\r\n    |    cmn..cond CARG4, #-LJ_TISNUM\r\n    ||}\r\n    |  b..ncond target\r\n    |.endmacro\r\n    |.macro ins_arithcheck_int, target\r\n    |  ins_arithcheck eq, ne, target\r\n    |.endmacro\r\n    |.macro ins_arithcheck_num, target\r\n    |  ins_arithcheck lo, hs, target\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpre\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   .if FPU\r\n    |   ldrd CARG12, [RB, BASE]!\r\n    |    ldrd CARG34, [RC, KBASE]!\r\n    |   .else\r\n    |   ldrd CARG12, [BASE, RB]\r\n    |    ldrd CARG34, [KBASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||case 1:\r\n    |   .if FPU\r\n    |   ldrd CARG34, [RB, BASE]!\r\n    |    ldrd CARG12, [RC, KBASE]!\r\n    |   .else\r\n    |   ldrd CARG34, [BASE, RB]\r\n    |    ldrd CARG12, [KBASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||default:\r\n    |   .if FPU\r\n    |   ldrd CARG12, [RB, BASE]!\r\n    |    ldrd CARG34, [RC, BASE]!\r\n    |   .else\r\n    |   ldrd CARG12, [BASE, RB]\r\n    |    ldrd CARG34, [BASE, RC]\r\n    |   .endif\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpre_fpu, reg1, reg2\r\n    |.if FPU\r\n    ||if (vk == 1) {\r\n    |  vldr reg2, [RB]\r\n    |  vldr reg1, [RC]\r\n    ||} else {\r\n    |  vldr reg1, [RB]\r\n    |  vldr reg2, [RC]\r\n    ||}\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpost_fpu, reg\r\n    |   ins_next1\r\n    |  add RA, BASE, RA\r\n    |   ins_next2\r\n    |  vstr reg, [RA]\r\n    |   ins_next3\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfallback, ins\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ins ->vmeta_arith_vn\r\n    ||  break;\r\n    ||case 1:\r\n    |   ins ->vmeta_arith_nv\r\n    ||  break;\r\n    ||default:\r\n    |   ins ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins, fpins, fpcall\r\n    |  ins_arithpre\r\n    |.if \"intins\" ~= \"vm_modi\" and not FPU\r\n    |   ins_next1\r\n    |.endif\r\n    |  ins_arithcheck_int >5\r\n    |.if \"intins\" == \"smull\"\r\n    |  smull CARG1, RC, CARG3, CARG1\r\n    |  cmp RC, CARG1, asr #31\r\n    |  ins_arithfallback bne\r\n    |.elif \"intins\" == \"vm_modi\"\r\n    |  movs CARG2, CARG3\r\n    |  ins_arithfallback beq\r\n    |  bl ->vm_modi\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |.else\r\n    |  intins CARG1, CARG1, CARG3\r\n    |  ins_arithfallback bvs\r\n    |.endif\r\n    |4:\r\n    |.if \"intins\" == \"vm_modi\" or FPU\r\n    |   ins_next1\r\n    |.endif\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |5:  // FP variant.\r\n    |  ins_arithpre_fpu d6, d7\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |.if FPU\r\n    |.if \"intins\" == \"vm_modi\"\r\n    |  bl fpcall\r\n    |.else\r\n    |  fpins d6, d6, d7\r\n    |.endif\r\n    |  ins_arithpost_fpu d6\r\n    |.else\r\n    |  bl fpcall\r\n    |.if \"intins\" ~= \"vm_modi\"\r\n    |  ins_next1\r\n    |.endif\r\n    |  b <4\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfp, fpins, fpcall\r\n    |  ins_arithpre\r\n    |.if \"fpins\" ~= \"extern\" or HFABI\r\n    |  ins_arithpre_fpu d0, d1\r\n    |.endif\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |.if \"fpins\" == \"extern\"\r\n    |  .IOS mov RC, BASE\r\n    |  bl fpcall\r\n    |  .IOS mov BASE, RC\r\n    |.elif FPU\r\n    |  fpins d0, d0, d1\r\n    |.else\r\n    |  bl fpcall\r\n    |.endif\r\n    |.if (\"fpins\" ~= \"extern\" or HFABI) and FPU\r\n    |  ins_arithpost_fpu d0\r\n    |.else\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arithdn adds, vadd.f64, extern __aeabi_dadd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arithdn subs, vsub.f64, extern __aeabi_dsub\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arithdn smull, vmul.f64, extern __aeabi_dmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arithfp vdiv.f64, extern __aeabi_ddiv\r\n    break;\r\n  case BC_MODVN: case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithdn vm_modi, vm_mod, ->vm_mod\r\n    break;\r\n  case BC_POW:\r\n    |  // NYI: (partial) integer arithmetic.\r\n    |  ins_arithfp extern, extern pow\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  decode_RB8 RC, INS\r\n    |   decode_RC8 RB, INS\r\n    |  // RA = dst*8, RC = src_start*8, RB = src_end*8  (note: RB/RC swapped!)\r\n    |  sub CARG3, RB, RC\r\n    |   str BASE, L->base\r\n    |  add CARG2, BASE, RB\r\n    |->BC_CAT_Z:\r\n    |  // RA = dst*8, RC = src_start*8, CARG2 = top-1\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  lsr CARG3, CARG3, #3\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  ldr BASE, L->base\r\n    |  cmp CRET1, #0\r\n    |  bne ->vmeta_binop\r\n    |  ldrd CARG34, [BASE, RC]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\t\t// Copy result to RA.\r\n    |   ins_next3\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |  ldr CARG1, [KBASE, RC, lsl #2]\r\n    |  mvn CARG2, #~LJ_TSTR\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RC = cdata_const (~)\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |  ldr CARG1, [KBASE, RC, lsl #2]\r\n    |  mvn CARG2, #~LJ_TCDATA\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, (RC = int16_literal)\r\n    |  mov CARG1, INS, asr #16\t\t\t// Refetch sign-extended reg.\r\n    |  mvn CARG2, #~LJ_TISNUM\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RC = num_const\r\n    |  lsl RC, RC, #3\r\n    |   ins_next1\r\n    |  ldrd CARG12, [KBASE, RC]\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RC = primitive_type (~)\r\n    |  add RA, BASE, RA\r\n    |  mvn RC, RC\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  str RC, [RA, #4]\r\n    |   ins_next3\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RC = end\r\n    |  add RA, BASE, RA\r\n    |   add RC, BASE, RC, lsl #3\r\n    |  mvn CARG1, #~LJ_TNIL\r\n    |  str CARG1, [RA, #4]\r\n    |   add RA, RA, #8\r\n    |1:\r\n    |  str CARG1, [RA, #4]\r\n    |  cmp RA, RC\r\n    |   add RA, RA, #8\r\n    |  blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RC = uvnum\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsl RC, RC, #2\r\n    |   add RC, RC, #offsetof(GCfuncL, uvptr)\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RC]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |  ldrd CARG34, [CARG2]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RC = src\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    lsl RC, RC, #3\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldrd CARG34, [BASE, RC]\r\n    |  ldrb RB, UPVAL:CARG2->marked\r\n    |  ldrb RC, UPVAL:CARG2->closed\r\n    |    ldr CARG2, UPVAL:CARG2->v\r\n    |  tst RB, #LJ_GC_BLACK\t\t// isblack(uv)\r\n    |   add RB, CARG4, #-LJ_TISGCV\r\n    |  cmpne RC, #0\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >2\t\t\t\t// Upvalue is closed and black?\r\n    |1:\r\n    |   ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  cmn RB, #-(LJ_TNUMX - LJ_TISGCV)\r\n    |   ldrbhi RC, GCOBJ:CARG3->gch.marked\r\n    |  bls <1\t\t\t\t// tvisgcv(v)\r\n    |    sub CARG1, DISPATCH, #-GG_DISP2G\r\n    |   tst RC, #LJ_GC_WHITES\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if IOS\r\n    |  beq <1\r\n    |  mov RC, BASE\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RC\r\n    |.else\r\n    |  blne extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.endif\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RC = str_const (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    mvn RC, RC\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldr STR:CARG3, [KBASE, RC, lsl #2]\r\n    |  ldrb RB, UPVAL:CARG2->marked\r\n    |     ldrb RC, UPVAL:CARG2->closed\r\n    |   ldr CARG2, UPVAL:CARG2->v\r\n    |    mvn CARG4, #~LJ_TSTR\r\n    |  tst RB, #LJ_GC_BLACK\t\t// isblack(uv)\r\n    |    ldrb RB, STR:CARG3->marked\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >2\r\n    |1:\r\n    |   ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  tst RB, #LJ_GC_WHITES\t\t// iswhite(str)\r\n    |  cmpne RC, #0\r\n    |   sub CARG1, DISPATCH, #-GG_DISP2G\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if IOS\r\n    |  beq <1\r\n    |  mov RC, BASE\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RC\r\n    |.else\r\n    |  blne extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.endif\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RC = num_const\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |    lsl RC, RC, #3\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |    ldrd CARG34, [KBASE, RC]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [CARG2]\r\n    |   ins_next3\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RC = primitive_type (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   lsr RA, RA, #1\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA]\r\n    |   mvn RC, RC\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  str RC, [CARG2, #4]\r\n    |   ins_next3\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RC = target\r\n    |  ldr CARG3, L->openupval\r\n    |   add RC, PC, RC, lsl #2\r\n    |   str BASE, L->base\r\n    |  cmp CARG3, #0\r\n    |   sub PC, RC, #0x20000\r\n    |  beq >1\r\n    |   mov CARG1, L\r\n    |   add CARG2, BASE, RA\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  ldr BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RC = proto_const (~) (holding function prototype)\r\n    |  mvn RC, RC\r\n    |   str BASE, L->base\r\n    |  ldr CARG2, [KBASE, RC, lsl #2]\r\n    |   str PC, SAVE_PC\r\n    |  ldr CARG3, [BASE, FRAME_FUNC]\r\n    |   mov CARG1, L\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  ldr BASE, L->base\r\n    |  mvn CARG2, #~LJ_TFUNC\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RC = (hbits|asize) | tab_const (~)\r\n    if (op == BC_TDUP) {\r\n      |  mvn RC, RC\r\n    }\r\n    |  ldr CARG3, [DISPATCH, #DISPATCH_GL(gc.total)]\r\n    |   ldr CARG4, [DISPATCH, #DISPATCH_GL(gc.threshold)]\r\n    |    str BASE, L->base\r\n    |    str PC, SAVE_PC\r\n    |  cmp CARG3, CARG4\r\n    |   mov CARG1, L\r\n    |  bhs >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  lsl CARG2, RC, #21\r\n      |   lsr CARG3, RC, #11\r\n      |  asr RC, CARG2, #21\r\n      |  lsr CARG2, CARG2, #21\r\n      |  cmn RC, #1\r\n      |  addeq CARG2, CARG2, #2\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns GCtab *.\r\n    } else {\r\n      |  ldr CARG2, [KBASE, RC, lsl #2]\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns GCtab *.\r\n    }\r\n    |  ldr BASE, L->base\r\n    |  mvn CARG2, #~LJ_TTAB\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    |5:\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mov CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n  case BC_GSET:\r\n    |  // RA = dst*8, RC = str_const (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   mvn RC, RC\r\n    |  ldr TAB:CARG1, LFUNC:CARG2->env\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  ldrd TAB:CARG12, [BASE, RB]\r\n    |   ldrd CARG34, [BASE, RC]\r\n    |  checktab CARG2, ->vmeta_tgetv  // STALL: load CARG12.\r\n    |   checktp CARG4, LJ_TISNUM\t// Integer key?\r\n    |  ldreq CARG4, TAB:CARG1->array\r\n    |    ldreq CARG2, TAB:CARG1->asize\r\n    |   bne >9\r\n    |\r\n    |  add CARG4, CARG4, CARG3, lsl #3\r\n    |    cmp CARG3, CARG2\t\t// In array part?\r\n    |  ldrdlo CARG34, [CARG4]\r\n    |    bhs ->vmeta_tgetv\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  beq >5\r\n    |1:\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG2, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG2, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG2->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  decode_RB8 RB, INS\t\t// Restore RB.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |9:\r\n    |  checktp CARG4, LJ_TSTR\t\t// String key?\r\n    |   moveq STR:RC, CARG3\r\n    |  beq ->BC_TGETS_Z\r\n    |  b ->vmeta_tgetv\r\n    break;\r\n  case BC_TGETS:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst*8, RB = table*8, RC = str_const (~)\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]  // STALL: early RC.\r\n    |  checktab CARG2, ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // (TAB:RB =) TAB:CARG1 = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  ldr CARG3, TAB:CARG1->hmask\r\n    |   ldr CARG4, STR:RC->hash\r\n    |    ldr NODE:INS, TAB:CARG1->node\r\n    |     mov TAB:RB, TAB:CARG1\r\n    |  and CARG3, CARG3, CARG4\t\t\t// idx = str->hash & tab->hmask\r\n    |  add CARG3, CARG3, CARG3, lsl #1\r\n    |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n    |1:\r\n    |  ldrd CARG12, NODE:INS->key  // STALL: early NODE:INS.\r\n    |   ldrd CARG34, NODE:INS->val\r\n    |    ldr NODE:INS, NODE:INS->next\r\n    |  checktp CARG2, LJ_TSTR\r\n    |  cmpeq CARG1, STR:RC\r\n    |  bne >4\r\n    |   checktp CARG4, LJ_TNIL\r\n    |   beq >5\r\n    |3:\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  cmp NODE:INS, #0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |   mov CARG3, #0  // Optional clear of undef. value (during load stall).\r\n    |   mvn CARG4, #~LJ_TNIL\r\n    |  cmp TAB:CARG1, #0\r\n    |  beq <3\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG1->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst*8, RB = table*8, RC = index\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |  checktab CARG2, ->vmeta_tgetb  // STALL: load CARG12.\r\n    |   ldr CARG3, TAB:CARG1->asize\r\n    |  ldr CARG4, TAB:CARG1->array\r\n    |  lsl CARG2, RC, #3\r\n    |   cmp RC, CARG3\r\n    |  ldrdlo CARG34, [CARG4, CARG2]\r\n    |   bhs ->vmeta_tgetb\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  beq >5\r\n    |1:\r\n    |   ins_next2\r\n    |  strd CARG34, [BASE, RA]\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG2, TAB:CARG1->metatable\r\n    |  cmp TAB:CARG2, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG2, TAB:CARG2->nomm\r\n    |  tst CARG2, #1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\r\n    break;\r\n  case BC_TGETR:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  ldr TAB:CARG1, [BASE, RB]\r\n    |   ldr CARG2, [BASE, RC]\r\n    |  ldr CARG4, TAB:CARG1->array\r\n    |    ldr CARG3, TAB:CARG1->asize\r\n    |  add CARG4, CARG4, CARG2, lsl #3\r\n    |    cmp CARG2, CARG3\t\t// In array part?\r\n    |    bhs ->vmeta_tgetr\r\n    |  ldrd CARG12, [CARG4]\r\n    |->BC_TGETR_Z:\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, [BASE, RA]\r\n    |   ins_next3\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  ldrd TAB:CARG12, [BASE, RB]\r\n    |   ldrd CARG34, [BASE, RC]\r\n    |  checktab CARG2, ->vmeta_tsetv  // STALL: load CARG12.\r\n    |   checktp CARG4, LJ_TISNUM\t// Integer key?\r\n    |  ldreq CARG2, TAB:CARG1->array\r\n    |    ldreq CARG4, TAB:CARG1->asize\r\n    |   bne >9\r\n    |\r\n    |  add CARG2, CARG2, CARG3, lsl #3\r\n    |    cmp CARG3, CARG4\t\t// In array part?\r\n    |  ldrlo INS, [CARG2, #4]\r\n    |    bhs ->vmeta_tsetv\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp INS, LJ_TNIL\r\n    |  ldrb INS, TAB:CARG1->marked\r\n    |   ldrd CARG34, [BASE, RA]\r\n    |  beq >5\r\n    |1:\r\n    |  tst INS, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |   strd CARG34, [CARG2]\r\n    |  bne >7\r\n    |2:\r\n    |   ins_next2\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |  tst RA, #1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  ldr INS, [PC, #-4]\t\t// Restore RA and RB.\r\n    |  decode_RB8 RB, INS\r\n    |  decode_RA8 RA, INS\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG1, INS, CARG3\r\n    |  b <2\r\n    |\r\n    |9:\r\n    |  checktp CARG4, LJ_TSTR\t\t// String key?\r\n    |   moveq STR:RC, CARG3\r\n    |  beq ->BC_TSETS_Z\r\n    |  b ->vmeta_tsetv\r\n    break;\r\n  case BC_TSETS:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src*8, RB = table*8, RC = str_const (~)\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #2]  // STALL: early RC.\r\n    |  checktab CARG2, ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // (TAB:RB =) TAB:CARG1 = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  ldr CARG3, TAB:CARG1->hmask\r\n    |   ldr CARG4, STR:RC->hash\r\n    |    ldr NODE:INS, TAB:CARG1->node\r\n    |     mov TAB:RB, TAB:CARG1\r\n    |  and CARG3, CARG3, CARG4\t\t\t// idx = str->hash & tab->hmask\r\n    |  add CARG3, CARG3, CARG3, lsl #1\r\n    |   mov CARG4, #0\r\n    |    add NODE:INS, NODE:INS, CARG3, lsl #3\t// node = tab->node + idx*3*8\r\n    |   strb CARG4, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |1:\r\n    |  ldrd CARG12, NODE:INS->key\r\n    |   ldr CARG4, NODE:INS->val.it\r\n    |    ldr NODE:CARG3, NODE:INS->next\r\n    |  checktp CARG2, LJ_TSTR\r\n    |  cmpeq CARG1, STR:RC\r\n    |  bne >5\r\n    |  ldrb CARG2, TAB:RB->marked\r\n    |   checktp CARG4, LJ_TNIL\t\t// Key found, but nil value?\r\n    |    ldrd CARG34, [BASE, RA]\r\n    |   beq >4\r\n    |2:\r\n    |  tst CARG2, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |    strd CARG34, NODE:INS->val\r\n    |  bne >7\r\n    |3:\r\n    |   ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |  cmp TAB:CARG1, #0\r\n    |  beq <2\t\t\t\t// No metatable: done.\r\n    |  ldrb CARG1, TAB:CARG1->nomm\r\n    |  tst CARG1, #1<<MM_newindex\r\n    |  bne <2\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  movs NODE:INS, NODE:CARG3\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  ldr TAB:CARG1, TAB:RB->metatable\r\n    |   mov CARG3, TMPDp\r\n    |   str PC, SAVE_PC\r\n    |  cmp TAB:CARG1, #0\t\t// No metatable: continue.\r\n    |   str BASE, L->base\r\n    |  ldrbne CARG2, TAB:CARG1->nomm\r\n    |   mov CARG1, L\r\n    |  beq >6\r\n    |  tst CARG2, #1<<MM_newindex\r\n    |  beq ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mvn CARG4, #~LJ_TSTR\r\n    |   str STR:RC, TMPDlo\r\n    |   mov CARG2, TAB:RB\r\n    |  str CARG4, TMPDhi\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  ldr BASE, L->base\r\n    |  ldrd CARG34, [BASE, RA]\r\n    |  strd CARG34, [CRET1]\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, CARG2, CARG3\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  decode_RB8 RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src*8, RB = table*8, RC = index\r\n    |  ldrd CARG12, [BASE, RB]\r\n    |  checktab CARG2, ->vmeta_tsetb  // STALL: load CARG12.\r\n    |   ldr CARG3, TAB:CARG1->asize\r\n    |  ldr RB, TAB:CARG1->array\r\n    |  lsl CARG2, RC, #3\r\n    |   cmp RC, CARG3\r\n    |  ldrdlo CARG34, [CARG2, RB]!\r\n    |   bhs ->vmeta_tsetb\r\n    |   ins_next1  // Overwrites RB!\r\n    |  checktp CARG4, LJ_TNIL\r\n    |  ldrb INS, TAB:CARG1->marked\r\n    |   ldrd CARG34, [BASE, RA]\r\n    |  beq >5\r\n    |1:\r\n    |  tst INS, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |    strd CARG34, [CARG2]\r\n    |  bne >7\r\n    |2:\r\n    |   ins_next2\r\n    |   ins_next3\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:RA, TAB:CARG1->metatable\r\n    |  cmp TAB:RA, #0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  ldrb RA, TAB:RA->nomm\r\n    |  tst RA, #1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  ldr INS, [PC, #-4]\t\t// Restore INS.\r\n    |  decode_RA8 RA, INS\r\n    |  b ->vmeta_tsetb\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG1, INS, CARG3\r\n    |  b <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  ldr TAB:CARG2, [BASE, RB]\r\n    |   ldr CARG3, [BASE, RC]\r\n    |     ldrb INS, TAB:CARG2->marked\r\n    |  ldr CARG1, TAB:CARG2->array\r\n    |    ldr CARG4, TAB:CARG2->asize\r\n    |     tst INS, #LJ_GC_BLACK\t\t// isblack(table)\r\n    |  add CARG1, CARG1, CARG3, lsl #3\r\n    |     bne >7\r\n    |2:\r\n    |    cmp CARG3, CARG4\t\t// In array part?\r\n    |    bhs ->vmeta_tsetr\r\n    |->BC_TSETR_Z:\r\n    |  ldrd CARG34, [BASE, RA]\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG34, [CARG1]\r\n    |   ins_next3\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, INS, RB\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RC = num_const (start index)\r\n    |  add RA, BASE, RA\r\n    |1:\r\n    |   ldr RB, SAVE_MULTRES\r\n    |  ldr TAB:CARG2, [RA, #-8]\t\t// Guaranteed to be a table.\r\n    |  ldr CARG1, [KBASE, RC, lsl #3]\t// Integer constant is in lo-word.\r\n    |   subs RB, RB, #8\r\n    |  ldr CARG4, TAB:CARG2->asize\r\n    |   beq >4\t\t\t\t// Nothing to copy?\r\n    |  add CARG3, CARG1, RB, lsr #3\r\n    |  cmp CARG3, CARG4\r\n    |   ldr CARG4, TAB:CARG2->array\r\n    |    add RB, RA, RB\r\n    |  bhi >5\r\n    |   add INS, CARG4, CARG1, lsl #3\r\n    |    ldrb CARG1, TAB:CARG2->marked\r\n    |3:  // Copy result slots to table.\r\n    |   ldrd CARG34, [RA], #8\r\n    |   strd CARG34, [INS], #8\r\n    |  cmp RA, RB\r\n    |  blo <3\r\n    |    tst CARG1, #LJ_GC_BLACK\t// isblack(table)\r\n    |    bne >7\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   str BASE, L->base\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  .IOS ldr BASE, L->base\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, CARG1, CARG3\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = nresults+1,) RC = extra_nargs\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |  decode_RC8 NARGS8:RC, INS\r\n    |  add NARGS8:RC, NARGS8:RC, CARG1\r\n    |  b ->BC_CALL_Z\r\n    break;\r\n  case BC_CALL:\r\n    |  decode_RC8 NARGS8:RC, INS\r\n    |  // RA = base*8, (RB = nresults+1,) RC = (nargs+1)*8\r\n    |->BC_CALL_Z:\r\n    |  mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |  ldrd CARG34, [BASE, RA]!\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add BASE, BASE, #8\r\n    |  checkfunc CARG4, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |  add NARGS8:RC, CARG1, RC, lsl #3\r\n    |  b ->BC_CALLT1_Z\r\n    break;\r\n  case BC_CALLT:\r\n    |  lsl NARGS8:RC, RC, #3\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |->BC_CALLT1_Z:\r\n    |  ldrd LFUNC:CARG34, [RA, BASE]!\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add RA, RA, #8\r\n    |  checkfunc CARG4, ->vmeta_callt\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |->BC_CALLT2_Z:\r\n    |   mov RB, #0\r\n    |   ldrb CARG4, LFUNC:CARG3->ffid\r\n    |  tst PC, #FRAME_TYPE\r\n    |  bne >7\r\n    |1:\r\n    |  str LFUNC:CARG3, [BASE, FRAME_FUNC]  // Copy function down, but keep PC.\r\n    |  cmp NARGS8:RC, #0\r\n    |  beq >3\r\n    |2:\r\n    |  ldrd CARG12, [RA, RB]\r\n    |   add INS, RB, #8\r\n    |   cmp INS, NARGS8:RC\r\n    |  strd CARG12, [BASE, RB]\r\n    |    mov RB, INS\r\n    |   bne <2\r\n    |3:\r\n    |  cmp CARG4, #1\t\t\t// (> FF_C) Calling a fast function?\r\n    |  bhi >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  ldr INS, [PC, #-4]\r\n    |  decode_RA8 RA, INS\r\n    |  sub CARG1, BASE, RA\r\n    |  ldr LFUNC:CARG1, [CARG1, #-16]\r\n    |  ldr CARG1, LFUNC:CARG1->field_pc\r\n    |  ldr KBASE, [CARG1, #PC2PROTO(k)]\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  eor PC, PC, #FRAME_VARG\r\n    |  tst PC, #FRAME_TYPEP\t\t// Vararg frame below?\r\n    |  movne CARG4, #0\t\t\t// Clear ffid if no Lua function below.\r\n    |  bne <1\r\n    |  sub BASE, BASE, PC\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  tst PC, #FRAME_TYPE\r\n    |  movne CARG4, #0\t\t\t// Clear ffid if no Lua function below.\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |  add RA, BASE, RA\r\n    |   mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |  ldrd CARG34, [RA, #-16]\r\n    |   ldrd CARG12, [RA, #-8]\r\n    |    add BASE, RA, #8\r\n    |  strd CARG34, [RA, #8]\t\t// Copy state.\r\n    |   strd CARG12, [RA, #16]\t\t// Copy control var.\r\n    |  // STALL: locked CARG34.\r\n    |  ldrd LFUNC:CARG34, [RA, #-24]\r\n    |    mov NARGS8:RC, #16\t\t// Iterators get 2 arguments.\r\n    |  // STALL: load CARG34.\r\n    |  strd LFUNC:CARG34, [RA]\t\t// Copy callable.\r\n    |  checkfunc CARG4, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA\r\n    |  ldr TAB:RB, [RA, #-16]\r\n    |  ldr CARG1, [RA, #-8]\t\t// Get index from control var.\r\n    |  ldr INS, TAB:RB->asize\r\n    |   ldr CARG2, TAB:RB->array\r\n    |    add PC, PC, #4\r\n    |1:  // Traverse array part.\r\n    |  subs RC, CARG1, INS\r\n    |   add CARG3, CARG2, CARG1, lsl #3\r\n    |  bhs >5\t\t\t\t// Index points after array part?\r\n    |   ldrd CARG34, [CARG3]\r\n    |   checktp CARG4, LJ_TNIL\r\n    |   addeq CARG1, CARG1, #1\t\t// Skip holes in array part.\r\n    |   beq <1\r\n    |  ldrh RC, [PC, #-2]\r\n    |   mvn CARG2, #~LJ_TISNUM\r\n    |    strd CARG34, [RA, #8]\r\n    |  add RC, PC, RC, lsl #2\r\n    |    add RB, CARG1, #1\r\n    |   strd CARG12, [RA]\r\n    |  sub PC, RC, #0x20000\r\n    |    str RB, [RA, #-8]\t\t// Update control var.\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  ldr CARG4, TAB:RB->hmask\r\n    |   ldr NODE:RB, TAB:RB->node\r\n    |6:\r\n    |   add CARG1, RC, RC, lsl #1\r\n    |  cmp RC, CARG4\t\t\t// End of iteration? Branch to ITERL+1.\r\n    |   add NODE:CARG3, NODE:RB, CARG1, lsl #3  // node = tab->node + idx*3*8\r\n    |  bhi <3\r\n    |   ldrd CARG12, NODE:CARG3->val\r\n    |   checktp CARG2, LJ_TNIL\r\n    |   add RC, RC, #1\r\n    |   beq <6\t\t\t\t// Skip holes in hash part.\r\n    |  ldrh RB, [PC, #-2]\r\n    |   add RC, RC, INS\r\n    |    ldrd CARG34, NODE:CARG3->key\r\n    |   str RC, [RA, #-8]\t\t// Update control var.\r\n    |   strd CARG12, [RA, #8]\r\n    |  add RC, PC, RB, lsl #2\r\n    |  sub PC, RC, #0x20000\r\n    |    strd CARG34, [RA]\r\n    |  b <3\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RC = target (points to ITERN)\r\n    |  add RA, BASE, RA\r\n    |     add RC, PC, RC, lsl #2\r\n    |  ldrd CFUNC:CARG12, [RA, #-24]\r\n    |   ldr CARG3, [RA, #-12]\r\n    |    ldr CARG4, [RA, #-4]\r\n    |  checktp CARG2, LJ_TFUNC\r\n    |  ldrbeq CARG1, CFUNC:CARG1->ffid\r\n    |   checktpeq CARG3, LJ_TTAB\r\n    |    checktpeq CARG4, LJ_TNIL\r\n    |  cmpeq CARG1, #FF_next_N\r\n    |     subeq PC, RC, #0x20000\r\n    |  bne >5\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  mov CARG1, #0\r\n    |  mvn CARG2, #0x00018000\r\n    |  strd CARG1, [RA, #-8]\t\t// Initialize control var.\r\n    |1:\r\n    |   ins_next3\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov CARG1, #BC_JMP\r\n    |   mov OP, #BC_ITERC\r\n    |  strb CARG1, [PC, #-4]\r\n    |   sub PC, RC, #0x20000\r\n    |   strb OP, [PC]\t\t\t// Subsumes ins_next1.\r\n    |   ins_next2\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  decode_RB8 RB, INS\r\n    |   decode_RC8 RC, INS\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  ldr CARG1, [BASE, FRAME_PC]\r\n    |  add RC, BASE, RC\r\n    |   add RA, BASE, RA\r\n    |  add RC, RC, #FRAME_VARG\r\n    |   add CARG4, RA, RB\r\n    |  sub CARG3, BASE, #8\t\t// CARG3 = vtop\r\n    |  sub RC, RC, CARG1\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  cmp RB, #0\r\n    |   sub CARG1, CARG3, RC\r\n    |  beq >5\t\t\t\t// Copy all varargs?\r\n    |   sub CARG4, CARG4, #16\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  cmp RC, CARG3\r\n    |  ldrdlo CARG12, [RC], #8\r\n    |  mvnhs CARG2, #~LJ_TNIL\r\n    |   cmp RA, CARG4\r\n    |  strd CARG12, [RA], #8\r\n    |   blo <1\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  ldr CARG4, L->maxstack\r\n    |   cmp CARG1, #0\r\n    |   movle RB, #8\t\t\t// MULTRES = (0+1)*8\r\n    |   addgt RB, CARG1, #8\r\n    |  add CARG2, RA, CARG1\r\n    |   str RB, SAVE_MULTRES\r\n    |   ble <2\r\n    |  cmp CARG2, CARG4\r\n    |  bhi >7\r\n    |6:\r\n    |   ldrd CARG12, [RC], #8\r\n    |   strd CARG12, [RA], #8\r\n    |  cmp RC, CARG3\r\n    |  blo <6\r\n    |  b <2\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  lsr CARG2, CARG1, #3\r\n    |   str RA, L->top\r\n    |  mov CARG1, L\r\n    |   str BASE, L->base\r\n    |  sub RC, RC, BASE\t\t\t// Need delta, because BASE may change.\r\n    |   str PC, SAVE_PC\r\n    |  sub RA, RA, BASE\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  ldr BASE, L->base\r\n    |  add RA, BASE, RA\r\n    |  add RC, BASE, RC\r\n    |  sub CARG3, BASE, #8\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RC = extra results\r\n    |  ldr CARG1, SAVE_MULTRES\r\n    |   ldr PC, [BASE, FRAME_PC]\r\n    |    add RA, BASE, RA\r\n    |  add RC, CARG1, RC, lsl #3\r\n    |  b ->BC_RETM_Z\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |    add RA, BASE, RA\r\n    |->BC_RETM_Z:\r\n    |   str RC, SAVE_MULTRES\r\n    |1:\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |  bne ->BC_RETV2_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RC = (nresults+1)*8, PC = return\r\n    |  ldr INS, [PC, #-4]\r\n    |  subs CARG4, RC, #8\r\n    |   sub CARG3, BASE, #8\r\n    |  beq >3\r\n    |2:\r\n    |  ldrd CARG12, [RA], #8\r\n    |   add BASE, BASE, #8\r\n    |   subs CARG4, CARG4, #8\r\n    |  strd CARG12, [BASE, #-16]\r\n    |   bne <2\r\n    |3:\r\n    |  decode_RA8 RA, INS\r\n    |  sub CARG4, CARG3, RA\r\n    |   decode_RB8 RB, INS\r\n    |  ldr LFUNC:CARG1, [CARG4, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RB, RC\t\t\t// More results expected?\r\n    |  bhi >6\r\n    |  mov BASE, CARG4\r\n    |  ldr CARG2, LFUNC:CARG1->field_pc\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |   ins_next3\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  mvn CARG2, #~LJ_TNIL\r\n    |  add BASE, BASE, #8\r\n    |   add RC, RC, #8\r\n    |  str CARG2, [BASE, #-12]\r\n    |  b <5\r\n    |\r\n    |->BC_RETV1_Z:  // Non-standard return case.\r\n    |  add RA, BASE, RA\r\n    |->BC_RETV2_Z:\r\n    |  tst CARG2, #FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, CARG2\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |   str RC, SAVE_MULTRES\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |   ldreq INS, [PC, #-4]\r\n    |  bne ->BC_RETV1_Z\r\n    if (op == BC_RET1) {\r\n      |  ldrd CARG12, [BASE, RA]\r\n    }\r\n    |  sub CARG4, BASE, #8\r\n    |   decode_RA8 RA, INS\r\n    if (op == BC_RET1) {\r\n      |  strd CARG12, [CARG4]\r\n    }\r\n    |  sub BASE, CARG4, RA\r\n    |   decode_RB8 RB, INS\r\n    |  ldr LFUNC:CARG1, [BASE, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RB, RC\r\n    |  bhi >6\r\n    |  ldr CARG2, LFUNC:CARG1->field_pc\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |   ins_next3\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  sub CARG2, CARG4, #4\r\n    |  mvn CARG3, #~LJ_TNIL\r\n    |  str CARG3, [CARG2, RC]\r\n    |  add RC, RC, #8\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA];      .define FOR_TIDX,  [RA, #4]\r\n  |.define FOR_STOP, [RA, #8];  .define FOR_TSTOP, [RA, #12]\r\n  |.define FOR_STEP, [RA, #16]; .define FOR_TSTEP, [RA, #20]\r\n  |.define FOR_EXT,  [RA, #24]; .define FOR_TEXT,  [RA, #28]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RC = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    if (op != BC_JFORL) {\r\n      |   add RC, PC, RC, lsl #2\r\n    }\r\n    if (!vk) {\r\n      |  ldrd CARG34, FOR_STOP\r\n      |   checktp CARG2, LJ_TISNUM\r\n      |  ldr RB, FOR_TSTEP\r\n      |   bne >5\r\n      |  checktp CARG4, LJ_TISNUM\r\n      |   ldr CARG4, FOR_STEP\r\n      |  checktpeq RB, LJ_TISNUM\r\n      |  bne ->vmeta_for\r\n      |  cmp CARG4, #0\r\n      |  blt >4\r\n      |  cmp CARG1, CARG3\r\n    } else {\r\n      |  ldrd CARG34, FOR_STEP\r\n      |   checktp CARG2, LJ_TISNUM\r\n      |   bne >5\r\n      |  adds CARG1, CARG1, CARG3\r\n      |   ldr CARG4, FOR_STOP\r\n      if (op == BC_IFORL) {\r\n\t|  addvs RC, PC, #0x20000\t\t// Overflow: prevent branch.\r\n      } else {\r\n\t|  bvs >2\t\t\t\t// Overflow: do not enter mcode.\r\n      }\r\n      |  cmp CARG3, #0\r\n      |  blt >4\r\n      |  cmp CARG1, CARG4\r\n    }\r\n    |1:\r\n    if (op == BC_FORI) {\r\n      |  subgt PC, RC, #0x20000\r\n    } else if (op == BC_JFORI) {\r\n      |  sub PC, RC, #0x20000\r\n      |  ldrhle RC, [PC, #-2]\r\n    } else if (op == BC_IFORL) {\r\n      |  suble PC, RC, #0x20000\r\n    }\r\n    if (vk) {\r\n      |  strd CARG12, FOR_IDX\r\n    }\r\n    |2:\r\n    |   ins_next1\r\n    |   ins_next2\r\n    |  strd CARG12, FOR_EXT\r\n    if (op == BC_JFORI || op == BC_JFORL) {\r\n      |  ble =>BC_JLOOP\r\n    }\r\n    |3:\r\n    |   ins_next3\r\n    |\r\n    |4:  // Invert check for negative step.\r\n    if (!vk) {\r\n      |  cmp CARG3, CARG1\r\n    } else {\r\n      |  cmp CARG4, CARG1\r\n    }\r\n    |  b <1\r\n    |\r\n    |5:  // FP loop.\r\n    if (!vk) {\r\n      |  cmnlo CARG4, #-LJ_TISNUM\r\n      |  cmnlo RB, #-LJ_TISNUM\r\n      |  bhs ->vmeta_for\r\n      |.if FPU\r\n      |  vldr d0, FOR_IDX\r\n      |  vldr d1, FOR_STOP\r\n      |  cmp RB, #0\r\n      |  vstr d0, FOR_EXT\r\n      |.else\r\n      |  cmp RB, #0\r\n      |   strd CARG12, FOR_EXT\r\n      |  blt >8\r\n      |.endif\r\n    } else {\r\n      |.if FPU\r\n      |  vldr d0, FOR_IDX\r\n      |  vldr d2, FOR_STEP\r\n      |  vldr d1, FOR_STOP\r\n      |  cmp CARG4, #0\r\n      |  vadd.f64 d0, d0, d2\r\n      |.else\r\n      |  cmp CARG4, #0\r\n      |  blt >8\r\n      |  bl extern __aeabi_dadd\r\n      |   strd CARG12, FOR_IDX\r\n      |  ldrd CARG34, FOR_STOP\r\n      |   strd CARG12, FOR_EXT\r\n      |.endif\r\n    }\r\n    |6:\r\n    |.if FPU\r\n    |  vcmpge.f64 d0, d1\r\n    |  vcmplt.f64 d1, d0\r\n    |  vmrs\r\n    |.else\r\n    |  bl extern __aeabi_cdcmple\r\n    |.endif\r\n    if (vk) {\r\n      |.if FPU\r\n      |  vstr d0, FOR_IDX\r\n      |  vstr d0, FOR_EXT\r\n      |.endif\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  subhi PC, RC, #0x20000\r\n    } else if (op == BC_JFORI) {\r\n      |  sub PC, RC, #0x20000\r\n      |  ldrhls RC, [PC, #-2]\r\n      |  bls =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |  subls PC, RC, #0x20000\r\n    } else {\r\n      |  bls =>BC_JLOOP\r\n    }\r\n    |  ins_next1\r\n    |  ins_next2\r\n    |  b <3\r\n    |\r\n    |.if not FPU\r\n    |8:  // Invert check for negative step.\r\n    if (vk) {\r\n      |  bl extern __aeabi_dadd\r\n      |  strd CARG12, FOR_IDX\r\n      |  strd CARG12, FOR_EXT\r\n    }\r\n    |  mov CARG3, CARG1\r\n    |  mov CARG4, CARG2\r\n    |  ldrd CARG12, FOR_STOP\r\n    |  b <6\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RC = target\r\n    |  ldrd CARG12, [RA, BASE]!\r\n    if (op == BC_JITERL) {\r\n      |  cmn CARG2, #-LJ_TNIL\t\t// Stop if iterator returned nil.\r\n      |  strdne CARG12, [RA, #-8]\r\n      |  bne =>BC_JLOOP\r\n    } else {\r\n      |   add RC, PC, RC, lsl #2\r\n      |  // STALL: load CARG12.\r\n      |  cmn CARG2, #-LJ_TNIL\t\t// Stop if iterator returned nil.\r\n      |  subne PC, RC, #0x20000\t\t// Otherwise save control var + branch.\r\n      |  strdne CARG12, [RA, #-8]\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RC = target (loop extent)\r\n    |  // Note: RA/RC is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RC = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base (ignored), RC = traceno\r\n    |  ldr CARG1, [DISPATCH, #DISPATCH_J(trace)]\r\n    |   mov CARG2, #0  // Traces on ARM don't store the trace number, so use 0.\r\n    |  ldr TRACE:RC, [CARG1, RC, lsl #2]\r\n    |   st_vmstate CARG2\r\n    |  ldr RA, TRACE:RC->mcode\r\n    |   str BASE, [DISPATCH, #DISPATCH_GL(jit_base)]\r\n    |   str L, [DISPATCH, #DISPATCH_GL(tmpbuf.L)]\r\n    |  bx RA\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RC = target\r\n    |  add RC, PC, RC, lsl #2\r\n    |  sub PC, RC, #0x20000\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   ldrb CARG2, [PC, #-4+PC2PROTO(numparams)]\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |  bhi ->vm_growstack_l\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n      |  ins_next2\r\n    }\r\n    |2:\r\n    |  cmp NARGS8:RC, CARG2, lsl #3\t// Check for missing parameters.\r\n    |   mvn CARG4, #~LJ_TNIL\r\n    |  blo >3\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD RC, INS\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  ins_next3\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  strd CARG34, [BASE, NARGS8:RC]\r\n    |  add NARGS8:RC, NARGS8:RC, #8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   add CARG4, BASE, RC\r\n    |  add RA, RA, RC\r\n    |   str LFUNC:CARG3, [CARG4]\t// Store copy of LFUNC.\r\n    |   add CARG2, RC, #8+FRAME_VARG\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |   str CARG2, [CARG4, #4]\t\t// Store delta + FRAME_VARG.\r\n    |  bhs ->vm_growstack_l\r\n    |  ldrb RB, [PC, #-4+PC2PROTO(numparams)]\r\n    |   mov RA, BASE\r\n    |   mov RC, CARG4\r\n    |  cmp RB, #0\r\n    |   add BASE, CARG4, #8\r\n    |  beq >3\r\n    |  mvn CARG3, #~LJ_TNIL\r\n    |1:\r\n    |  cmp RA, RC\t\t\t// Less args than parameters?\r\n    |   ldrdlo CARG12, [RA], #8\r\n    |   movhs CARG2, CARG3\r\n    |    strlo CARG3, [RA, #-4]\t\t// Clear old fixarg slot (help the GC).\r\n    |2:\r\n    |  subs RB, RB, #1\r\n    |   strd CARG12, [CARG4, #8]!\r\n    |  bne <1\r\n    |3:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  ldr CARG4, CFUNC:CARG3->f\r\n    } else {\r\n      |  ldr CARG4, [DISPATCH, #DISPATCH_GL(wrapf)]\r\n    }\r\n    |   add CARG2, RA, NARGS8:RC\r\n    |   ldr CARG1, L->maxstack\r\n    |  add RC, BASE, NARGS8:RC\r\n    |    str BASE, L->base\r\n    |   cmp CARG2, CARG1\r\n    |  str RC, L->top\r\n    if (op == BC_FUNCCW) {\r\n      |  ldr CARG2, CFUNC:CARG3->f\r\n    }\r\n    |    mv_vmstate CARG3, C\r\n    |  mov CARG1, L\r\n    |   bhi ->vm_growstack_c\t\t// Need to grow stack.\r\n    |    st_vmstate CARG3\r\n    |  blx CARG4\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  ldr BASE, L->base\r\n    |    mv_vmstate CARG3, INTERP\r\n    |   ldr CRET2, L->top\r\n    |    str L, [DISPATCH, #DISPATCH_GL(cur_L)]\r\n    |   lsl RC, CRET1, #3\r\n    |    st_vmstate CARG3\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   sub RA, CRET2, RC\t\t// RA = L->top - nresults*8\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",%%progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 0xe\\n\"\t\t\t\t/* Return address is in lr. */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 0xd\\n\\t.uleb128 0\\n\"\t/* def_cfa sp */\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 1\\n\",\t\t/* offset lr */\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 11; i >= (LJ_ARCH_HASFPU ? 5 : 4); i--)  /* offset r4-r11 */\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 2+(11-i));\r\n#if LJ_ARCH_HASFPU\r\n    for (i = 15; i >= 8; i--)  /* offset d8-d15 */\r\n      fprintf(ctx->fp, \"\\t.byte 5\\n\\t.uleb128 %d, %d\\n\",\r\n\t64+2*i, 10+2*(15-i));\r\n    fprintf(ctx->fp, \"\\t.byte 0x84\\n\\t.uleb128 %d\\n\", 25);  /* offset r4 */\r\n#endif\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 1\\n\"\t\t/* offset lr */\r\n\t\"\\t.byte 0x8b\\n\\t.uleb128 2\\n\"\t\t/* offset r11 */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 3\\n\"\t\t/* offset r5 */\r\n\t\"\\t.byte 0x84\\n\\t.uleb128 4\\n\"\t\t/* offset r4 */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xb\\n\"\t\t/* def_cfa_register r11 */\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_arm64.dasc",
    "content": "|// Low-level VM code for ARM64 CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch arm64\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// ARM64 registers and the AAPCS64 ABI 1.0 at a glance:\r\n|//\r\n|// x0-x17 temp, x19-x28 callee-saved, x29 fp, x30 lr\r\n|// x18 is reserved on most platforms. Don't use it, save it or restore it.\r\n|// x31 doesn't exist. Register number 31 either means xzr/wzr (zero) or sp,\r\n|// depending on the instruction.\r\n|// v0-v7 temp, v8-v15 callee-saved (only d8-d15 preserved), v16-v31 temp\r\n|//\r\n|// x0-x7/v0-v7 hold parameters and results.\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|\r\n|// The following must be C callee-save.\r\n|.define BASE,\t\tx19\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tx20\t// Constants of current Lua function.\r\n|.define PC,\t\tx21\t// Next PC.\r\n|.define GLREG,\t\tx22\t// Global state.\r\n|.define LREG,\t\tx23\t// Register holding lua_State (also in SAVE_L).\r\n|.define TISNUM,\tx24\t// Constant LJ_TISNUM << 47.\r\n|.define TISNUMhi,\tx25\t// Constant LJ_TISNUM << 15.\r\n|.define TISNIL,\tx26\t// Constant -1LL.\r\n|.define fp,\t\tx29\t// Yes, we have to maintain a frame pointer.\r\n|\r\n|.define ST_INTERP,\tw26\t// Constant -1.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA/RC.\r\n|.define RA,\t\tx27\r\n|.define RC,\t\tx28\r\n|.define RB,\t\tx17\r\n|.define RAw,\t\tw27\r\n|.define RCw,\t\tw28\r\n|.define RBw,\t\tw17\r\n|.define INS,\t\tx16\r\n|.define INSw,\t\tw16\r\n|.define ITYPE,\t\tx15\r\n|.define TMP0,\t\tx8\r\n|.define TMP1,\t\tx9\r\n|.define TMP2,\t\tx10\r\n|.define TMP3,\t\tx11\r\n|.define TMP0w,\t\tw8\r\n|.define TMP1w,\t\tw9\r\n|.define TMP2w,\t\tw10\r\n|.define TMP3w,\t\tw11\r\n|\r\n|// Calling conventions. Also used as temporaries.\r\n|.define CARG1,\t\tx0\r\n|.define CARG2,\t\tx1\r\n|.define CARG3,\t\tx2\r\n|.define CARG4,\t\tx3\r\n|.define CARG5,\t\tx4\r\n|.define CARG1w,\tw0\r\n|.define CARG2w,\tw1\r\n|.define CARG3w,\tw2\r\n|.define CARG4w,\tw3\r\n|.define CARG5w,\tw4\r\n|\r\n|.define FARG1,\t\td0\r\n|.define FARG2,\t\td1\r\n|\r\n|.define CRET1,\t\tx0\r\n|.define CRET1w,\tw0\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|\r\n|.define CFRAME_SPACE,\t208\r\n|//----- 16 byte aligned, <-- sp entering interpreter\r\n|// Unused\t\t[sp, #204]\t// 32 bit values\r\n|.define SAVE_NRES,\t[sp, #200]\r\n|.define SAVE_ERRF,\t[sp, #196]\r\n|.define SAVE_MULTRES,\t[sp, #192]\r\n|.define TMPD,\t\t[sp, #184]\t// 64 bit values\r\n|.define SAVE_L,\t[sp, #176]\r\n|.define SAVE_PC,\t[sp, #168]\r\n|.define SAVE_CFRAME,\t[sp, #160]\r\n|.define SAVE_FPR_,\t96\t\t// 96+8*8: 64 bit FPR saves\r\n|.define SAVE_GPR_,\t16\t\t// 16+10*8: 64 bit GPR saves\r\n|.define SAVE_LR,\t[sp, #8]\r\n|.define SAVE_FP,\t[sp]\r\n|//----- 16 byte aligned, <-- sp while in interpreter.\r\n|\r\n|.define TMPDofs,\t#184\r\n|\r\n|.macro save_, gpr1, gpr2, fpr1, fpr2\r\n|  stp d..fpr1, d..fpr2, [sp, # SAVE_FPR_+(fpr1-8)*8]\r\n|  stp x..gpr1, x..gpr2, [sp, # SAVE_GPR_+(gpr1-19)*8]\r\n|.endmacro\r\n|.macro rest_, gpr1, gpr2, fpr1, fpr2\r\n|  ldp d..fpr1, d..fpr2, [sp, # SAVE_FPR_+(fpr1-8)*8]\r\n|  ldp x..gpr1, x..gpr2, [sp, # SAVE_GPR_+(gpr1-19)*8]\r\n|.endmacro\r\n|\r\n|.macro saveregs\r\n|  stp fp, lr, [sp, #-CFRAME_SPACE]!\r\n|  add fp, sp, #0\r\n|  stp x19, x20, [sp, # SAVE_GPR_]\r\n|  save_ 21, 22, 8, 9\r\n|  save_ 23, 24, 10, 11\r\n|  save_ 25, 26, 12, 13\r\n|  save_ 27, 28, 14, 15\r\n|.endmacro\r\n|.macro restoreregs\r\n|  ldp x19, x20, [sp, # SAVE_GPR_]\r\n|  rest_ 21, 22, 8, 9\r\n|  rest_ 23, 24, 10, 11\r\n|  rest_ 25, 26, 12, 13\r\n|  rest_ 27, 28, 14, 15\r\n|  ldp fp, lr, [sp], # CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State,\tGLREG\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; brk; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_FUNC,\t#-16\r\n|.define FRAME_PC,\t#-8\r\n|\r\n|.macro decode_RA, dst, ins; ubfx dst, ins, #8, #8; .endmacro\r\n|.macro decode_RB, dst, ins; ubfx dst, ins, #24, #8; .endmacro\r\n|.macro decode_RC, dst, ins; ubfx dst, ins, #16, #8; .endmacro\r\n|.macro decode_RD, dst, ins; ubfx dst, ins, #16, #16; .endmacro\r\n|.macro decode_RC8RD, dst, src; ubfiz dst, src, #3, #8; .endmacro\r\n|\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT\r\n|  ldr INSw, [PC], #4\r\n|  add TMP1, GL, INS, uxtb #3\r\n|   decode_RA RA, INS\r\n|  ldr TMP0, [TMP1, #GG_G2DISP]\r\n|   decode_RD RC, INS\r\n|  br TMP0\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  ldr PC, LFUNC:CARG3->pc\r\n|  ldr INSw, [PC], #4\r\n|  add TMP1, GL, INS, uxtb #3\r\n|   decode_RA RA, INS\r\n|  ldr TMP0, [TMP1, #GG_G2DISP]\r\n|   add RA, BASE, RA, lsl #3\r\n|  br TMP0\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, CARG3 = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  str PC, [BASE, FRAME_PC]\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to check the TValue type and extract the GCobj. Branch on failure.\r\n|.macro checktp, reg, tp, target\r\n|  asr ITYPE, reg, #47\r\n|  cmn ITYPE, #-tp\r\n|   and reg, reg, #LJ_GCVMASK\r\n|  bne target\r\n|.endmacro\r\n|.macro checktp, dst, reg, tp, target\r\n|  asr ITYPE, reg, #47\r\n|  cmn ITYPE, #-tp\r\n|   and dst, reg, #LJ_GCVMASK\r\n|  bne target\r\n|.endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR, target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB, target; .endmacro\r\n|.macro checkfunc, reg, target; checktp reg, LJ_TFUNC, target; .endmacro\r\n|.macro checkint, reg, target\r\n|  cmp TISNUMhi, reg, lsr #32\r\n|  bne target\r\n|.endmacro\r\n|.macro checknum, reg, target\r\n|  cmp TISNUMhi, reg, lsr #32\r\n|  bls target\r\n|.endmacro\r\n|.macro checknumber, reg, target\r\n|  cmp TISNUMhi, reg, lsr #32\r\n|  blo target\r\n|.endmacro\r\n|\r\n|.macro mov_false, reg; movn reg, #0x8000, lsl #32; .endmacro\r\n|.macro mov_true, reg; movn reg, #0x0001, lsl #48; .endmacro\r\n|\r\n#define GL_J(field)\t(GG_OFS(J) + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotcheck, delta\r\n|  NYI\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP\r\n|  blo ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL\r\n|  blo ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro mv_vmstate, reg, st; movn reg, #LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate, reg; str reg, GL->vmstate; .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  ldr tmp, GL->gc.grayagain\r\n|   and mark, mark, #~LJ_GC_BLACK\t// black2gray(tab)\r\n|  str tab, GL->gc.grayagain\r\n|   strb mark, tab->marked\r\n|  str tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n#if !LJ_DUALNUM\r\n#error \"Only dual-number mode supported for ARM64 target\"\r\n#endif\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: RB = previous base.\r\n  |  tbz PC, #2, ->cont_dispatch\t// (PC & FRAME_P) == 0?\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  ldr PC, [RB, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |   mov_true TMP0\r\n  |  mov BASE, RB\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   str TMP0, [RA, #-8]!\t\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  adds RC, RC, #8\t\t\t// RC = (nresults+1)*8.\r\n  |  mov CRET1, #LUA_YIELD\r\n  |  beq ->vm_unwind_c_eh\r\n  |  str RCw, SAVE_MULTRES\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |  beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RC/MULTRES = (nresults+1)*8, PC = return\r\n  |  // CARG1 = PC & FRAME_TYPE\r\n  |  and RB, PC, #~FRAME_TYPEP\r\n  |   cmp CARG1, #FRAME_C\r\n  |  sub RB, BASE, RB\t\t\t// RB = previous base.\r\n  |   bne ->vm_returnp\r\n  |\r\n  |  str RB, L->base\r\n  |   ldrsw CARG2, SAVE_NRES\t\t// CARG2 = nresults+1.\r\n  |    mv_vmstate TMP0w, C\r\n  |   sub BASE, BASE, #16\r\n  |  subs TMP2, RC, #8\r\n  |    st_vmstate TMP0w\r\n  |  beq >2\r\n  |1:\r\n  |  subs TMP2, TMP2, #8\r\n  |   ldr TMP0, [RA], #8\r\n  |   str TMP0, [BASE], #8\r\n  |  bne <1\r\n  |2:\r\n  |  cmp RC, CARG2, lsl #3\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  str BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  ldr RC, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   mov CRET1, #0\t\t\t// Ok return status for vm_pcall.\r\n  |  str RC, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  ret\r\n  |\r\n  |6:\r\n  |  bgt >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  ldr CARG3, L->maxstack\r\n  |  cmp BASE, CARG3\r\n  |  bhs >8\r\n  |   str TISNIL, [BASE], #8\r\n  |  add RC, RC, #8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  cbz CARG2, <3\t\t\t// LUA_MULTRET+1 case?\r\n  |  sub CARG1, RC, CARG2, lsl #3\r\n  |  sub BASE, BASE, CARG1\t\t// Shrink top.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  str BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |  mov CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  ldrsw CARG2, SAVE_NRES\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mov sp, CARG1\r\n  |  mov CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |   mv_vmstate TMP0w, C\r\n  |  ldr GL, L->glref\r\n  |   st_vmstate TMP0w\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  and sp, CARG1, #CFRAME_RAWMASK\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  ldr L, SAVE_L\r\n  |    movz TISNUM, #(LJ_TISNUM>>1)&0xffff, lsl #48\r\n  |    movz TISNUMhi, #(LJ_TISNUM>>1)&0xffff, lsl #16\r\n  |    movn TISNIL, #0\r\n  |    mov RC, #16\t\t\t// 2 results: false + error message.\r\n  |  ldr BASE, L->base\r\n  |   ldr GL, L->glref\t\t\t// Setup pointer to global state.\r\n  |    mov_false TMP0\r\n  |  sub RA, BASE, #8\t\t\t// Results start at BASE-8.\r\n  |  ldr PC, [BASE, FRAME_PC]\t\t// Fetch PC of previous frame.\r\n  |    str TMP0, [BASE, #-8]\t\t// Prepend false to error message.\r\n  |   st_vmstate ST_INTERP\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  // CARG1 = L\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |    mov CARG1, L\r\n  |  stp BASE, RC, L->base\r\n  |   add PC, PC, #4\t\t\t// Must point after first instruction.\r\n  |   lsr CARG2, RA, #3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldp BASE, RC, L->base\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, RC, BASE\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |    ldr GL, L->glref\t\t\t// Setup pointer to global state.\r\n  |  mov BASE, CARG2\r\n  |   str L, SAVE_L\r\n  |  mov PC, #FRAME_CP\r\n  |   str wzr, SAVE_NRES\r\n  |    add TMP0, sp, #CFRAME_RESUME\r\n  |  ldrb TMP1w, L->status\r\n  |   str wzr, SAVE_ERRF\r\n  |   str L, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   str xzr, SAVE_CFRAME\r\n  |    str TMP0, L->cframe\r\n  |  cbz TMP1w, >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  str L, GL->cur_L\r\n  |  mov RA, BASE\r\n  |   ldp BASE, CARG1, L->base\r\n  |    movz TISNUM, #(LJ_TISNUM>>1)&0xffff, lsl #48\r\n  |    movz TISNUMhi, #(LJ_TISNUM>>1)&0xffff, lsl #16\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |     strb wzr, L->status\r\n  |    movn TISNIL, #0\r\n  |   sub RC, CARG1, BASE\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   add RC, RC, #8\r\n  |     st_vmstate ST_INTERP\r\n  |   str RCw, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_CP\r\n  |  str CARG4w, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PC, #FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  ldr RC, L:CARG1->cframe\r\n  |   str CARG3w, SAVE_NRES\r\n  |    mov L, CARG1\r\n  |   str CARG1, SAVE_L\r\n  |    ldr GL, L->glref\t\t\t// Setup pointer to global state.\r\n  |     mov BASE, CARG2\r\n  |   str CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  str RC, SAVE_CFRAME\r\n  |  str fp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  str L, GL->cur_L\r\n  |  ldp RB, CARG1, L->base\t\t// RB = old base (for vmeta_call).\r\n  |    movz TISNUM, #(LJ_TISNUM>>1)&0xffff, lsl #48\r\n  |    movz TISNUMhi, #(LJ_TISNUM>>1)&0xffff, lsl #16\r\n  |  add PC, PC, BASE\r\n  |    movn TISNIL, #0\r\n  |  sub PC, PC, RB\t\t\t// PC = frame delta + frame type\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |    st_vmstate ST_INTERP\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // RB = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  ldr CARG3, [BASE, FRAME_FUNC]\r\n  |  checkfunc CARG3, ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, CARG3 = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mov L, CARG1\r\n  |   ldr RA, L:CARG1->stack\r\n  |  str CARG1, SAVE_L\r\n  |    ldr GL, L->glref\t\t\t// Setup pointer to global state.\r\n  |   ldr RB, L->top\r\n  |  str CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |  ldr RC, L->cframe\r\n  |   sub RA, RA, RB\t\t\t// Compute -savestack(L, L->top).\r\n  |   str RAw, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  str wzr, SAVE_ERRF\t\t\t// No error function.\r\n  |  str RC, SAVE_CFRAME\r\n  |  str fp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |    str L, GL->cur_L\r\n  |  blr CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |  mov BASE, CRET1\r\n  |   mov PC, #FRAME_CP\r\n  |  cbnz BASE, <3\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RC = (nresults+1)*8\r\n  |  ldr LFUNC:CARG3, [RB, FRAME_FUNC]\r\n  |    ldr CARG1, [BASE, #-32]\t\t// Get continuation.\r\n  |   mov CARG4, BASE\r\n  |   mov BASE, RB\t\t\t// Restore caller BASE.\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |.if FFI\r\n  |    cmp CARG1, #1\r\n  |.endif\r\n  |   ldr PC, [CARG4, #-24]\t\t// Restore PC from [cont|PC].\r\n  |  ldr CARG3, LFUNC:CARG3->pc\r\n  |    add TMP0, RA, RC\r\n  |    str TISNIL, [TMP0, #-8]\t\t// Ensure one valid arg.\r\n  |.if FFI\r\n  |    bls >1\r\n  |.endif\r\n  |  ldr KBASE, [CARG3, #PC2PROTO(k)]\r\n  |  // BASE = base, RA = resultptr, CARG4 = meta base\r\n  |    br CARG1\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  beq ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |   sub CARG4, CARG4, #32\r\n  |   sub RC, CARG4, BASE\r\n  |  b ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, CARG4 = meta base\r\n  |  ldr INSw, [PC, #-4]\r\n  |   sub CARG2, CARG4, #32\r\n  |   ldr TMP0, [RA]\r\n  |     str BASE, L->base\r\n  |  decode_RB RB, INS\r\n  |   decode_RA RA, INS\r\n  |  add TMP1, BASE, RB, lsl #3\r\n  |  subs TMP1, CARG2, TMP1\r\n  |  beq >1\r\n  |   str TMP0, [CARG2]\r\n  |  lsr CARG3, TMP1, #3\r\n  |  b ->BC_CAT_Z\r\n  |\r\n  |1:\r\n  |   str TMP0, [BASE, RA, lsl #3]\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  movn CARG4, #~LJ_TSTR\r\n  |   add CARG2, BASE, RB, lsl #3\r\n  |  add CARG4, STR:RC, CARG4, lsl #47\r\n  |  b >2\r\n  |\r\n  |->vmeta_tgets:\r\n  |  movk CARG2, #(LJ_TTAB>>1)&0xffff, lsl #48\r\n  |  str CARG2, GL->tmptv\r\n  |  add CARG2, GL, #offsetof(global_State, tmptv)\r\n  |2:\r\n  |   add CARG3, sp, TMPDofs\r\n  |  str CARG4, TMPD\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// RB = table, RC = index\r\n  |  add RC, RC, TISNUM\r\n  |   add CARG2, BASE, RB, lsl #3\r\n  |   add CARG3, sp, TMPDofs\r\n  |  str RC, TMPD\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\t\t\t// RB = table, RC = key\r\n  |  add CARG2, BASE, RB, lsl #3\r\n  |   add CARG3, BASE, RC, lsl #3\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cbz CRET1, >3\r\n  |  ldr TMP0, [CRET1]\r\n  |  str TMP0, [BASE, RA, lsl #3]\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |   sub TMP1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #16\t\t// 2 args for func(t, k).\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |    str PC, [BASE, #-24]\t\t// [cont|PC]\r\n  |   sub PC, BASE, TMP1\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  sxtw CARG2, TMP1w\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  mov TMP0, TISNIL\r\n  |  cbz CRET1, ->BC_TGETR_Z\r\n  |  ldr TMP0, [CRET1]\r\n  |  b ->BC_TGETR_Z\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  movn CARG4, #~LJ_TSTR\r\n  |   add CARG2, BASE, RB, lsl #3\r\n  |  add CARG4, STR:RC, CARG4, lsl #47\r\n  |  b >2\r\n  |\r\n  |->vmeta_tsets:\r\n  |  movk CARG2, #(LJ_TTAB>>1)&0xffff, lsl #48\r\n  |  str CARG2, GL->tmptv\r\n  |  add CARG2, GL, #offsetof(global_State, tmptv)\r\n  |2:\r\n  |   add CARG3, sp, TMPDofs\r\n  |  str CARG4, TMPD\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// RB = table, RC = index\r\n  |  add RC, RC, TISNUM\r\n  |   add CARG2, BASE, RB, lsl #3\r\n  |   add CARG3, sp, TMPDofs\r\n  |  str RC, TMPD\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  add CARG2, BASE, RB, lsl #3\r\n  |   add CARG3, BASE, RC, lsl #3\r\n  |1:\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |   ldr TMP0, [BASE, RA, lsl #3]\r\n  |  cbz CRET1, >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |   str TMP0, [CRET1]\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |   sub TMP1, BASE, #FRAME_CONT\r\n  |  ldr BASE, L->top\r\n  |    mov NARGS8:RC, #24\t\t// 3 args for func(t, k, v).\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   str TMP0, [BASE, #16]\t\t// Copy value to third argument.\r\n  |    str PC, [BASE, #-24]\t\t// [cont|PC]\r\n  |   sub PC, BASE, TMP1\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tsetr:\r\n  |  sxtw CARG3, TMP1w\r\n  |  str BASE, L->base\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |  // Returns TValue *.\r\n  |  b ->BC_TSETR_Z\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  add CARG2, BASE, RA, lsl #3\r\n  |   sub PC, PC, #4\r\n  |  add CARG3, BASE, RC, lsl #3\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  uxtb CARG4w, INSw\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  cmp CRET1, #1\r\n  |  bhi ->vmeta_binop\r\n  |4:\r\n  |   ldrh RBw, [PC, #2]\r\n  |    add PC, PC, #4\r\n  |   add RB, PC, RB, lsl #2\r\n  |   sub RB, RB, #0x20000\r\n  |  csel PC, PC, RB, lo\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  ldr INSw, [PC, #-4]\r\n  |   ldr TMP0, [RA]\r\n  |  decode_RA TMP1, INS\r\n  |   str TMP0, [BASE, TMP1, lsl #3]\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  ldr TMP0, [RA]\r\n  |   mov_true TMP1\r\n  |  cmp TMP1, TMP0\t\t\t// Branch if result is true.\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  ldr TMP0, [RA]\r\n  |   mov_false TMP1\r\n  |  cmp TMP0, TMP1\t\t\t// Branch if result is false.\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  and TAB:CARG3, CARG3, #LJ_GCVMASK\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |   mov CARG2, INS\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_equal_cd\t\t// (lua_State *L, BCIns op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |  sub PC, PC, #4\r\n  |   str BASE, L->base\r\n  |   mov CARG1, L\r\n  |   mov CARG2, RA\r\n  |   mov CARG3, RC\r\n  |  str PC, SAVE_PC\r\n  |  bl extern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  add CARG3, BASE, RB, lsl #3\r\n  |   add CARG4, KBASE, RC, lsl #3\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  add CARG4, BASE, RB, lsl #3\r\n  |   add CARG3, KBASE, RC, lsl #3\r\n  |  b >1\r\n  |\r\n  |->vmeta_unm:\r\n  |  add CARG3, BASE, RC, lsl #3\r\n  |  mov CARG4, CARG3\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  add CARG3, BASE, RB, lsl #3\r\n  |   add CARG4, BASE, RC, lsl #3\r\n  |1:\r\n  |  uxtb CARG5w, INSw\r\n  |   add CARG2, BASE, RA, lsl #3\r\n  |    str BASE, L->base\r\n  |   mov CARG1, L\r\n  |    str PC, SAVE_PC\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  cbz CRET1, ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub TMP1, CRET1, BASE\r\n  |   str PC, [CRET1, #-24]\t\t// [cont|PC]\r\n  |  add PC, TMP1, #FRAME_CONT\r\n  |  mov BASE, CRET1\r\n  |   mov NARGS8:RC, #16\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  add CARG2, BASE, RC, lsl #3\r\n#if LJ_52\r\n  |  mov TAB:RC, TAB:CARG1\t\t// Save table (ignored for other types).\r\n#endif\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  cbnz CRET1, ->vmeta_binop\t\t// Binop call for compatibility.\r\n  |  mov TAB:CARG1, TAB:RC\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // RB = old base, BASE = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str RB, L->base\t\t\t// This is the callers base!\r\n  |  sub CARG2, BASE, #16\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, BASE, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]  // Guaranteed to be a function here.\r\n  |   add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  sub CARG2, RA, #16\r\n  |   str PC, SAVE_PC\r\n  |  add CARG3, RA, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  ldr TMP1, [RA, FRAME_FUNC]\t\t// Guaranteed to be a function here.\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |   add NARGS8:RC, NARGS8:RC, #8\t// Got one more argument now.\r\n  |  and LFUNC:CARG3, TMP1, #LJ_GCVMASK\r\n  |  b ->BC_CALLT2_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, RA\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |  ldr INSw, [PC, #-4]\r\n  |.if JIT\r\n  |   uxtb TMP0, INS\r\n  |.endif\r\n  |  decode_RA RA, INS\r\n  |  decode_RD RC, INS\r\n  |.if JIT\r\n  |   cmp TMP0, #BC_JFORI\r\n  |   beq =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  ldr CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  ldp CARG1, CARG2, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc name\r\n  |  ldr CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |  ldr FARG1, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  checknum CARG1, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc name\r\n  |  ldp CARG1, CARG2, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |  ldp FARG1, FARG2, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  checknum CARG1, ->fff_fallback\r\n  |  checknum CARG2, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses CARG1 and CARG2.\r\n  |.macro ffgccheck\r\n  |  ldp CARG1, CARG2, GL->gc.total\t// Assumes threshold follows total.\r\n  |  cmp CARG1, CARG2\r\n  |  blt >1\r\n  |  bl ->fff_gcstep\r\n  |1:\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  mov_false TMP1\r\n  |  cmp CARG1, TMP1\r\n  |  bhs ->fff_fallback\r\n  |  str CARG1, [BASE, #-16]\r\n  |  sub RB, BASE, #8\r\n  |  subs RA, NARGS8:RC, #8\r\n  |   add RC, NARGS8:RC, #8\t\t// Compute (nresults+1)*8.\r\n  |  cbz RA, ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |1:\r\n  |   ldr CARG1, [RB, #16]\r\n  |  sub RA, RA, #8\r\n  |   str CARG1, [RB], #8\r\n  |  cbnz RA, <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 type\r\n  |  mov TMP0, #~LJ_TISNUM\r\n  |  asr ITYPE, CARG1, #47\r\n  |  cmn ITYPE, #~LJ_TISNUM\r\n  |  csinv TMP1, TMP0, ITYPE, lo\r\n  |  add TMP1, TMP1, #offsetof(GCfuncC, upvalue)/8\r\n  |  ldr CARG1, [CFUNC:CARG3, TMP1, lsl #3]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  asr ITYPE, CARG1, #47\r\n  |  cmn ITYPE, #-LJ_TTAB\r\n  |  ccmn ITYPE, #-LJ_TUDATA, #4, ne\r\n  |   and TAB:CARG1, CARG1, #LJ_GCVMASK\r\n  |  bne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  ldr TAB:RB, TAB:CARG1->metatable\r\n  |2:\r\n  |   mov CARG1, TISNIL\r\n  |   ldr STR:RC, GL->gcroot[GCROOT_MMNAME+MM_metatable]\r\n  |  cbz TAB:RB, ->fff_restv\r\n  |  ldr TMP1w, TAB:RB->hmask\r\n  |   ldr TMP2w, STR:RC->hash\r\n  |    ldr NODE:CARG3, TAB:RB->node\r\n  |  and TMP1w, TMP1w, TMP2w\t\t// idx = str->hash & tab->hmask\r\n  |  add TMP1, TMP1, TMP1, lsl #1\r\n  |  movn CARG4, #~LJ_TSTR\r\n  |    add NODE:CARG3, NODE:CARG3, TMP1, lsl #3  // node = tab->node + idx*3*8\r\n  |  add CARG4, STR:RC, CARG4, lsl #47\t// Tagged key to look for.\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  ldp CARG1, TMP0, NODE:CARG3->val\r\n  |   ldr NODE:CARG3, NODE:CARG3->next\r\n  |  cmp TMP0, CARG4\r\n  |  beq >5\r\n  |  cbnz NODE:CARG3, <3\r\n  |4:\r\n  |  mov CARG1, RB\t\t\t// Use metatable as default result.\r\n  |  movk CARG1, #(LJ_TTAB>>1)&0xffff, lsl #48\r\n  |  b ->fff_restv\r\n  |5:\r\n  |  cmp TMP0, TISNIL\r\n  |  bne ->fff_restv\r\n  |  b <4\r\n  |\r\n  |6:\r\n  |  movn TMP0, #~LJ_TISNUM\r\n  |  cmp ITYPE, TMP0\r\n  |  csel ITYPE, ITYPE, TMP0, hs\r\n  |  sub TMP1, GL, ITYPE, lsl #3\r\n  |  ldr TAB:RB, [TMP1, #offsetof(global_State, gcroot[GCROOT_BASEMT])-8]\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  checktp TMP1, CARG1, LJ_TTAB, ->fff_fallback\r\n  |   ldr TAB:TMP0, TAB:TMP1->metatable\r\n  |  asr ITYPE, CARG2, #47\r\n  |   ldrb TMP2w, TAB:TMP1->marked\r\n  |  cmn ITYPE, #-LJ_TTAB\r\n  |    and TAB:CARG2, CARG2, #LJ_GCVMASK\r\n  |  ccmp TAB:TMP0, #0, #0, eq\r\n  |  bne ->fff_fallback\r\n  |    str TAB:CARG2, TAB:TMP1->metatable\r\n  |   tbz TMP2w, #2, ->fff_restv\t// isblack(table)\r\n  |  barrierback TAB:TMP1, TMP2w, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  ldr CARG2, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  checktab CARG2, ->fff_fallback\r\n  |   mov CARG1, L\r\n  |   add CARG3, BASE, #8\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  ldr CARG1, [CRET1]\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  ldr CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |   bne ->fff_fallback\r\n  |  checknumber CARG1, ->fff_fallback\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  asr ITYPE, CARG1, #47\r\n  |  cmn ITYPE, #-LJ_TSTR\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq ->fff_restv\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  ldr TMP1, GL->gcroot[GCROOT_BASEMT_NUM]\r\n  |   str BASE, L->base\r\n  |  cmn ITYPE, #-LJ_TISNUM\r\n  |  ccmp TMP1, #0, #0, ls\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  bne ->fff_fallback\r\n  |  ffgccheck\r\n  |  mov CARG1, L\r\n  |  mov CARG2, BASE\r\n  |  bl extern lj_strfmt_number\t\t// (lua_State *L, cTValue *o)\r\n  |  // Returns GCstr *.\r\n  |   movn TMP1, #~LJ_TSTR\r\n  |  ldr BASE, L->base\r\n  |   add CARG1, CARG1, TMP1, lsl #47\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |  checktp CARG2, CARG1, LJ_TTAB, ->fff_fallback\r\n  |  str TISNIL, [BASE, NARGS8:RC]\t// Set missing 2nd arg to nil.\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |   stp BASE, BASE, L->base\t\t// Add frame since C call can throw.\r\n  |  mov CARG1, L\r\n  |  add CARG3, BASE, #8\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  str TISNIL, [BASE, #-16]\r\n  |  cbz CRET1, ->fff_res1\t\t// End of traversal: return nil.\r\n  |  ldp CARG1, CARG2, [BASE, #8]\t// Copy key and value to results.\r\n  |    mov RC, #(2+1)*8\r\n  |  stp CARG1, CARG2, [BASE, #-16]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktp TMP1, CARG1, LJ_TTAB, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:CARG2, TAB:TMP1->metatable\r\n#endif\r\n  |   ldr CFUNC:CARG4, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cbnz TAB:CARG2, ->fff_fallback\r\n#endif\r\n  |  mov RC, #(3+1)*8\r\n  |  stp CARG1, TISNIL, [BASE, #-8]\r\n  |   str CFUNC:CARG4, [BASE, #-16]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  checktab CARG1, ->fff_fallback\r\n  |   checkint CARG2, ->fff_fallback\r\n  |  ldr TMP1w, TAB:CARG1->asize\r\n  |   ldr CARG3, TAB:CARG1->array\r\n  |    ldr TMP0w, TAB:CARG1->hmask\r\n  |  add CARG2w, CARG2w, #1\r\n  |  cmp CARG2w, TMP1w\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |     add TMP2, CARG2, TISNUM\r\n  |   mov RC, #(0+1)*8\r\n  |     str TMP2, [BASE, #-16]\r\n  |  bhs >2\t\t\t\t// Not in array part?\r\n  |  ldr TMP0, [CARG3, CARG2, lsl #3]\r\n  |1:\r\n  |   mov TMP1, #(2+1)*8\r\n  |   cmp TMP0, TISNIL\r\n  |  str TMP0, [BASE, #-8]\r\n  |   csel RC, RC, TMP1, eq\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  cbz TMP0w, ->fff_res\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  cbz CRET1, ->fff_res\r\n  |  ldr TMP0, [CRET1]\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktp TMP1, CARG1, LJ_TTAB, ->fff_fallback\r\n#if LJ_52\r\n  |  ldr TAB:CARG2, TAB:TMP1->metatable\r\n#endif\r\n  |   ldr CFUNC:CARG4, CFUNC:CARG3->upvalue[0]\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n#if LJ_52\r\n  |  cbnz TAB:CARG2, ->fff_fallback\r\n#endif\r\n  |  mov RC, #(3+1)*8\r\n  |  stp CARG1, TISNUM, [BASE, #-8]\r\n  |   str CFUNC:CARG4, [BASE, #-16]\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  ldrb TMP0w, GL->hookmask\r\n  |   subs NARGS8:RC, NARGS8:RC, #8\r\n  |   blo ->fff_fallback\r\n  |    mov RB, BASE\r\n  |    add BASE, BASE, #16\r\n  |  ubfx TMP0w, TMP0w, #HOOK_ACTIVE_SHIFT, #1\r\n  |  add PC, TMP0, #16+FRAME_PCALL\r\n  |   beq ->vm_call_dispatch\r\n  |1:\r\n  |   add TMP2, BASE, NARGS8:RC\r\n  |2:\r\n  |   ldr TMP0, [TMP2, #-16]\r\n  |   str TMP0, [TMP2, #-8]!\r\n  |  cmp TMP2, BASE\r\n  |  bne <2\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc xpcall\r\n  |     ldp CARG1, CARG2, [BASE]\r\n  |  ldrb TMP0w, GL->hookmask\r\n  |   subs NARGS8:RC, NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |    mov RB, BASE\r\n  |    add BASE, BASE, #24\r\n  |     asr ITYPE, CARG2, #47\r\n  |  ubfx TMP0w, TMP0w, #HOOK_ACTIVE_SHIFT, #1\r\n  |     cmn ITYPE, #-LJ_TFUNC\r\n  |  add PC, TMP0, #24+FRAME_PCALL\r\n  |     bne ->fff_fallback\t\t// Traceback must be a function.\r\n  |     stp CARG2, CARG1, [RB]\t\t// Swap function and traceback.\r\n  |   cbz NARGS8:RC, ->vm_call_dispatch\r\n  |  b <1\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  checktp CARG1, LJ_TTHREAD, ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  ldr L:CARG1, CFUNC:CARG3->upvalue[0].gcr\r\n  |  and L:CARG1, CARG1, #LJ_GCVMASK\r\n  |.endif\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |     str BASE, L->base\r\n  |  ldp RB, CARG2, L:CARG1->base\r\n  |   ldrb TMP1w, L:CARG1->status\r\n  |  add TMP0, CARG2, TMP1\r\n  |   str PC, SAVE_PC\r\n  |  cmp TMP0, RB\r\n  |  beq ->fff_fallback\r\n  |   cmp TMP1, #LUA_YIELD\r\n  |    add TMP0, CARG2, #8\r\n  |   csel CARG2, CARG2, TMP0, hs\r\n  |   ldr CARG4, L:CARG1->maxstack\r\n  |   add CARG3, CARG2, NARGS8:RC\r\n  |    ldr RB, L:CARG1->cframe\r\n  |   ccmp CARG3, CARG4, #2, ls\r\n  |    ccmp RB, #0, #2, ls\r\n  |    bhi ->fff_fallback\r\n  |.if resume\r\n  |  sub CARG3, CARG3, #8\t\t// Keep resumed thread in stack for GC.\r\n  |  add BASE, BASE, #8\r\n  |  sub NARGS8:RC, NARGS8:RC, #8\r\n  |.endif\r\n  |  str CARG3, L:CARG1->top\r\n  |  str BASE, L->top\r\n  |  cbz NARGS8:RC, >3\r\n  |2:  // Move args to coroutine.\r\n  |   ldr TMP0, [BASE, RB]\r\n  |  cmp RB, NARGS8:RC\r\n  |   str TMP0, [CARG2, RB]\r\n  |   add RB, RB, #8\r\n  |  bne <2\r\n  |3:\r\n  |  mov CARG3, #0\r\n  |   mov L:RA, L:CARG1\r\n  |  mov CARG4, #0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  ldp CARG3, CARG4, L:RA->base\r\n  |   cmp CRET1, #LUA_YIELD\r\n  |  ldr BASE, L->base\r\n  |    str L, GL->cur_L\r\n  |    st_vmstate ST_INTERP\r\n  |   bhi >8\r\n  |  sub RC, CARG4, CARG3\r\n  |   ldr CARG1, L->maxstack\r\n  |   add CARG2, BASE, RC\r\n  |  cbz RC, >6\t\t\t\t// No results?\r\n  |  cmp CARG2, CARG1\r\n  |   mov RB, #0\r\n  |  bhi >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  sub CARG4, RC, #8\r\n  |   str CARG3, L:RA->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |   ldr TMP0, [CARG3, RB]\r\n  |  cmp RB, CARG4\r\n  |   str TMP0, [BASE, RB]\r\n  |   add RB, RB, #8\r\n  |  bne <5\r\n  |6:\r\n  |.if resume\r\n  |  mov_true TMP1\r\n  |   add RC, RC, #16\r\n  |7:\r\n  |  str TMP1, [BASE, #-8]\t\t// Prepend true/false to results.\r\n  |   sub RA, BASE, #8\r\n  |.else\r\n  |   mov RA, BASE\r\n  |   add RC, RC, #8\r\n  |.endif\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   str PC, SAVE_PC\r\n  |   str RCw, SAVE_MULTRES\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  ldr TMP0, [CARG4, #-8]!\r\n  |   mov_false TMP1\r\n  |    mov RC, #(2+1)*8\r\n  |  str CARG4, L:RA->top\t\t// Remove error from coroutine stack.\r\n  |  str TMP0, [BASE]\t\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mov CARG1, L\r\n  |  mov CARG2, L:RA\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |  // Never returns.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mov CARG1, L\r\n  |  lsr CARG2, RC, #3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov CRET1, #0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  ldr TMP0, L->cframe\r\n  |   add TMP1, BASE, NARGS8:RC\r\n  |    mov CRET1, #LUA_YIELD\r\n  |   stp BASE, TMP1, L->base\r\n  |  tbz TMP0, #0, ->fff_fallback\r\n  |   str xzr, L->cframe\r\n  |    strb CRET1w, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.macro math_round, func, round\r\n  |  .ffunc math_ .. func\r\n  |  ldr CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |  ldr d0, [BASE]\r\n  |   blo ->fff_fallback\r\n  |  cmp TISNUMhi, CARG1, lsr #32\r\n  |  beq ->fff_restv\r\n  |  blo ->fff_fallback\r\n  |  round d0, d0\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |  math_round floor, frintm\r\n  |  math_round ceil, frintp\r\n  |\r\n  |.ffunc_1 math_abs\r\n  |  checknumber CARG1, ->fff_fallback\r\n  |  and CARG1, CARG1, #U64x(7fffffff,ffffffff)\r\n  |  bne ->fff_restv\r\n  |  eor CARG2w, CARG1w, CARG1w, asr #31\r\n  |   movz CARG3, #0x41e0, lsl #48\t// 2^31.\r\n  |  subs CARG1w, CARG2w, CARG1w, asr #31\r\n  |   add CARG1, CARG1, TISNUM\r\n  |  csel CARG1, CARG1, CARG3, pl\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG1 = TValue result.\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  str CARG1, [BASE, #-16]\r\n  |->fff_res1:\r\n  |  // PC = return.\r\n  |  mov RC, #(1+1)*8\r\n  |->fff_res:\r\n  |  // RC = (nresults+1)*8, PC = return.\r\n  |  ands CARG1, PC, #FRAME_TYPE\r\n  |   str RCw, SAVE_MULTRES\r\n  |   sub RA, BASE, #16\r\n  |  bne ->vm_return\r\n  |  ldr INSw, [PC, #-4]\r\n  |  decode_RB RB, INS\r\n  |5:\r\n  |  cmp RC, RB, lsl #3\t\t\t// More results expected?\r\n  |  blo >6\r\n  |  decode_RA TMP1, INS\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  sub BASE, RA, TMP1, lsl #3\r\n  |  ins_next\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  add TMP1, RA, RC\r\n  |   add RC, RC, #8\r\n  |  str TISNIL, [TMP1, #-8]\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc_n math_ .. func\r\n  |  bl extern func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |  bl extern func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.ffunc_n math_sqrt\r\n  |  fsqrt d0, d0\r\n  |->fff_resn:\r\n  |  ldr PC, [BASE, FRAME_PC]\r\n  |  str d0, [BASE, #-16]\r\n  |  b ->fff_res1\r\n  |\r\n  |.ffunc math_log\r\n  |  ldr CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |  ldr FARG1, [BASE]\r\n  |   bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |  checknum CARG1, ->fff_fallback\r\n  |  bl extern log\r\n  |  b ->fff_resn\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.ffunc_2 math_ldexp\r\n  |  ldr FARG1, [BASE]\r\n  |  checknum CARG1, ->fff_fallback\r\n  |  checkint CARG2, ->fff_fallback\r\n  |  sxtw CARG1, CARG2w\r\n  |  bl extern ldexp\t\t\t// (double x, int exp)\r\n  |  b ->fff_resn\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |  add CARG1, sp, TMPDofs\r\n  |  bl extern frexp\r\n  |   ldr CARG2w, TMPD\r\n  |    ldr PC, [BASE, FRAME_PC]\r\n  |  str d0, [BASE, #-16]\r\n  |    mov RC, #(2+1)*8\r\n  |   add CARG2, CARG2, TISNUM\r\n  |   str CARG2, [BASE, #-8]\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_n math_modf\r\n  |  sub CARG1, BASE, #16\r\n  |   ldr PC, [BASE, FRAME_PC]\r\n  |  bl extern modf\r\n  |   mov RC, #(2+1)*8\r\n  |  str d0, [BASE, #-8]\r\n  |  b ->fff_res\r\n  |\r\n  |.macro math_minmax, name, cond, fcond\r\n  |  .ffunc_1 name\r\n  |   add RB, BASE, RC\r\n  |   add RA, BASE, #8\r\n  |  checkint CARG1, >4\r\n  |1:  // Handle integers.\r\n  |  ldr CARG2, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_restv\r\n  |  checkint CARG2, >3\r\n  |  cmp CARG1w, CARG2w\r\n  |   add RA, RA, #8\r\n  |  csel CARG1, CARG2, CARG1, cond\r\n  |  b <1\r\n  |3:  // Convert intermediate result to number and continue below.\r\n  |  scvtf d0, CARG1w\r\n  |  blo ->fff_fallback\r\n  |  ldr d1, [RA]\r\n  |  b >6\r\n  |\r\n  |4:\r\n  |  ldr d0, [BASE]\r\n  |  blo ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  ldr CARG2, [RA]\r\n  |  ldr d1, [RA]\r\n  |   cmp RA, RB\r\n  |   bhs ->fff_resn\r\n  |  checknum CARG2, >7\r\n  |6:\r\n  |  fcmp d0, d1\r\n  |   add RA, RA, #8\r\n  |  fcsel d0, d1, d0, fcond\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |  scvtf d1, CARG2w\r\n  |  blo ->fff_fallback\r\n  |  b <6\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, gt, hi\r\n  |  math_minmax math_max, lt, lo\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  ldp PC, CARG1, [BASE, FRAME_PC]\r\n  |   cmp NARGS8:RC, #8\r\n  |  asr ITYPE, CARG1, #47\r\n  |  ccmn ITYPE, #-LJ_TSTR, #0, eq\r\n  |   and STR:CARG1, CARG1, #LJ_GCVMASK\r\n  |  bne ->fff_fallback\r\n  |  ldrb TMP0w, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   ldr CARG3w, STR:CARG1->len\r\n  |  add TMP0, TMP0, TISNUM\r\n  |  str TMP0, [BASE, #-16]\r\n  |  mov RC, #(0+1)*8\r\n  |   cbz CARG3, ->fff_res\r\n  |  b ->fff_res1\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  ldp PC, CARG1, [BASE, FRAME_PC]\r\n  |  cmp CARG1w, #255\r\n  |   ccmp NARGS8:RC, #8, #0, ls\t\t// Need exactly 1 argument.\r\n  |  bne ->fff_fallback\r\n  |  checkint CARG1, ->fff_fallback\r\n  |  mov CARG3, #1\r\n  |  mov CARG2, BASE\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  // CARG2 = str, CARG3 = len.\r\n  |   str BASE, L->base\r\n  |  mov CARG1, L\r\n  |   str PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |->fff_resstr:\r\n  |  // Returns GCstr *.\r\n  |  ldr BASE, L->base\r\n  |   movn TMP1, #~LJ_TSTR\r\n  |  add CARG1, CARG1, TMP1, lsl #47\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  ldr CARG1, [BASE]\r\n  |    ldr CARG3, [BASE, #16]\r\n  |   cmp NARGS8:RC, #16\r\n  |    movn RB, #0\r\n  |   beq >1\r\n  |   blo ->fff_fallback\r\n  |    checkint CARG3, ->fff_fallback\r\n  |    sxtw RB, CARG3w\r\n  |1:\r\n  |  ldr CARG2, [BASE, #8]\r\n  |  checkstr CARG1, ->fff_fallback\r\n  |   ldr TMP1w, STR:CARG1->len\r\n  |  checkint CARG2, ->fff_fallback\r\n  |  sxtw CARG2, CARG2w\r\n  |  // CARG1 = str, TMP1 = str->len, CARG2 = start, RB = end\r\n  |   add TMP2, RB, TMP1\r\n  |   cmp RB, #0\r\n  |  add TMP0, CARG2, TMP1\r\n  |   csinc RB, RB, TMP2, ge\t\t// if (end < 0) end += len+1\r\n  |  cmp CARG2, #0\r\n  |  csinc CARG2, CARG2, TMP0, ge\t// if (start < 0) start += len+1\r\n  |   cmp RB, #0\r\n  |   csel RB, RB, xzr, ge\t\t// if (end < 0) end = 0\r\n  |  cmp CARG2, #1\r\n  |  csinc CARG2, CARG2, xzr, ge\t// if (start < 1) start = 1\r\n  |   cmp RB, TMP1\r\n  |   csel RB, RB, TMP1, le\t\t// if (end > len) end = len\r\n  |  add CARG1, STR:CARG1, #sizeof(GCstr)-1\r\n  |   subs CARG3, RB, CARG2\t\t// len = end - start\r\n  |  add CARG2, CARG1, CARG2\r\n  |   add CARG3, CARG3, #1\t\t// len += 1\r\n  |   bge ->fff_newstr\r\n  |  add STR:CARG1, GL, #offsetof(global_State, strempty)\r\n  |   movn TMP1, #~LJ_TSTR\r\n  |  add CARG1, CARG1, TMP1, lsl #47\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc string_ .. name\r\n  |  ffgccheck\r\n  |  ldr CARG2, [BASE]\r\n  |   cmp NARGS8:RC, #8\r\n  |  asr ITYPE, CARG2, #47\r\n  |  ccmn ITYPE, #-LJ_TSTR, #0, hs\r\n  |   and STR:CARG2, CARG2, #LJ_GCVMASK\r\n  |  bne ->fff_fallback\r\n  |  ldr TMP0, GL->tmpbuf.b\r\n  |   add SBUF:CARG1, GL, #offsetof(global_State, tmpbuf)\r\n  |   str BASE, L->base\r\n  |   str PC, SAVE_PC\r\n  |   str L, GL->tmpbuf.L\r\n  |  str TMP0, GL->tmpbuf.p\r\n  |  bl extern lj_buf_putstr_ .. name\r\n  |  bl extern lj_buf_tostr\r\n  |  b ->fff_resstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |// FP number to bit conversion for soft-float. Clobbers CARG1-CARG3\r\n  |->vm_tobit_fb:\r\n  |  bls ->fff_fallback\r\n  |  add CARG2, CARG1, CARG1\r\n  |  mov CARG3, #1076\r\n  |  sub CARG3, CARG3, CARG2, lsr #53\r\n  |  cmp CARG3, #53\r\n  |  bhi >1\r\n  |  and CARG2, CARG2, #U64x(001fffff,ffffffff)\r\n  |  orr CARG2, CARG2, #U64x(00200000,00000000)\r\n  |   cmp CARG1, #0\r\n  |  lsr CARG2, CARG2, CARG3\r\n  |   cneg CARG1w, CARG2w, mi\r\n  |  br lr\r\n  |1:\r\n  |  mov CARG1w, #0\r\n  |  br lr\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_1 bit_..name\r\n  |  adr lr, >1\r\n  |  checkint CARG1, ->vm_tobit_fb\r\n  |1:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  mov RA, #8\r\n  |  mov TMP0w, CARG1w\r\n  |  adr lr, >2\r\n  |1:\r\n  |  ldr CARG1, [BASE, RA]\r\n  |   cmp RA, NARGS8:RC\r\n  |    add RA, RA, #8\r\n  |   bge >9\r\n  |  checkint CARG1, ->vm_tobit_fb\r\n  |2:\r\n  |  ins TMP0w, TMP0w, CARG1w\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, orr\r\n  |.ffunc_bit_op bxor, eor\r\n  |\r\n  |.ffunc_bit tobit\r\n  |  mov TMP0w, CARG1w\r\n  |9:  // Label reused by .ffunc_bit_op users.\r\n  |  add CARG1, TMP0, TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  rev TMP0w, CARG1w\r\n  |  add CARG1, TMP0, TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  mvn TMP0w, CARG1w\r\n  |  add CARG1, TMP0, TISNUM\r\n  |  b ->fff_restv\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc bit_..name\r\n  |  ldp TMP0, CARG1, [BASE]\r\n  |   cmp NARGS8:RC, #16\r\n  |   blo ->fff_fallback\r\n  |  adr lr, >1\r\n  |  checkint CARG1, ->vm_tobit_fb\r\n  |1:\r\n  |.if shmod == 0\r\n  |  mov TMP1, CARG1\r\n  |.else\r\n  |  neg TMP1, CARG1\r\n  |.endif\r\n  |  mov CARG1, TMP0\r\n  |  adr lr, >2\r\n  |  checkint CARG1, ->vm_tobit_fb\r\n  |2:\r\n  |  ins TMP0w, CARG1w, TMP1w\r\n  |  add CARG1, TMP0, TISNUM\r\n  |  b ->fff_restv\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, lsl, 0\r\n  |.ffunc_bit_sh rshift, lsr, 0\r\n  |.ffunc_bit_sh arshift, asr, 0\r\n  |.ffunc_bit_sh rol, ror, 1\r\n  |.ffunc_bit_sh ror, ror, 0\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |   ldp CFUNC:CARG3, PC, [BASE, FRAME_FUNC]\t// Fallback may overwrite PC.\r\n  |  ldr TMP2, L->maxstack\r\n  |  add TMP1, BASE, NARGS8:RC\r\n  |  stp BASE, TMP1, L->base\r\n  |   and CFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  add TMP1, TMP1, #8*LUA_MINSTACK\r\n  |   ldr CARG3, CFUNC:CARG3->f\r\n  |    str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  cmp TMP1, TMP2\r\n  |   mov CARG1, L\r\n  |  bhi >5\t\t\t\t// Need to grow stack.\r\n  |   blr CARG3\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |   ldr BASE, L->base\r\n  |  cmp CRET1w, #0\r\n  |   lsl RC, CRET1, #3\r\n  |   sub RA, BASE, #16\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |   ldr CARG1, L->top\r\n  |    ldr CFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |   sub NARGS8:RC, CARG1, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |    and CFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  ands TMP0, PC, #FRAME_TYPE\r\n  |   and TMP1, PC, #~FRAME_TYPEP\r\n  |  bne >3\r\n  |  ldrb RAw, [PC, #-3]\r\n  |  lsl RA, RA, #3\r\n  |  add TMP1, RA, #16\r\n  |3:\r\n  |  sub RB, BASE, TMP1\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov CARG2, #LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  ldr BASE, L->base\r\n  |  cmp CARG1, CARG1\t\t\t// Set zero-flag to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |   add CARG2, BASE, NARGS8:RC\t// Calculate L->top.\r\n  |  mov RA, lr\r\n  |   stp BASE, CARG2, L->base\r\n  |   str PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  mov CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |  ldp BASE, CARG2, L->base\r\n  |   ldr CFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |  mov lr, RA\t\t\t\t// Help return address predictor.\r\n  |  sub NARGS8:RC, CARG2, BASE\t\t// Calculate nargs*8.\r\n  |   and CFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |  NYI\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  ldrb TMP2w, GL->hookmask\r\n  |  tbz TMP2w, #HOOK_ACTIVE_SHIFT, >1\t// Hook already active?\r\n  |5:  // Re-dispatch to static ins.\r\n  |  ldr TMP0, [TMP1, #GG_G2DISP+GG_DISP2STATIC]\r\n  |  br TMP0\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  ldrb TMP2w, GL->hookmask\r\n  |   ldr TMP3w, GL->hookcount\r\n  |  tbnz TMP2w, #HOOK_ACTIVE_SHIFT, <5\t// Hook already active?\r\n  |  tst TMP2w, #LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beq <5\r\n  |   sub TMP3w, TMP3w, #1\r\n  |   str TMP3w, GL->hookcount\r\n  |   cbz TMP3w, >1\r\n  |  tbz TMP2w, #LUA_HOOKLINE, <5\r\n  |1:\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, PC\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  ldr BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  ldr INSw, [PC, #-4]\r\n  |  add TMP1, GL, INS, uxtb #3\r\n  |   decode_RA RA, INS\r\n  |  ldr TMP0, [TMP1, #GG_G2DISP+GG_DISP2STATIC]\r\n  |   decode_RD RC, INS\r\n  |  br TMP0\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  ldr CARG1, [CARG4, #-40]\r\n  |   add PC, PC, #4\r\n  |  str CARG1w, SAVE_MULTRES\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |  NYI\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  orr CARG2, PC, #1\r\n  |1:\r\n  |.endif\r\n  |  add TMP1, BASE, NARGS8:RC\r\n  |   str PC, SAVE_PC\r\n  |   mov CARG1, L\r\n  |   sub RA, RA, BASE\r\n  |  stp BASE, TMP1, L->base\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  ldp BASE, TMP1, L->base\r\n  |   str xzr, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |  add RA, BASE, RA\r\n  |  sub NARGS8:RC, TMP1, BASE\r\n  |   ldr INSw, [PC, #-4]\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  br CRET1\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |  NYI\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  mov CARG1, L\r\n  |   str BASE, L->base\r\n  |  mov CARG2, PC\r\n  |  bl extern lj_dispatch_profile\t// (lua_State *L, const BCIns *pc)\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  ldr BASE, L->base\r\n  |  sub PC, PC, #4\r\n  |  b ->cont_nop\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_exit_handler:\r\n  |  NYI\r\n  |->vm_exit_interp:\r\n  |  NYI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |  // int lj_vm_modi(int dividend, int divisor);\r\n  |->vm_modi:\r\n  |    eor CARG4w, CARG1w, CARG2w\r\n  |    cmp CARG4w, #0\r\n  |  eor CARG3w, CARG1w, CARG1w, asr #31\r\n  |   eor CARG4w, CARG2w, CARG2w, asr #31\r\n  |  sub CARG3w, CARG3w, CARG1w, asr #31\r\n  |   sub CARG4w, CARG4w, CARG2w, asr #31\r\n  |  udiv CARG1w, CARG3w, CARG4w\r\n  |  msub CARG1w, CARG1w, CARG4w, CARG3w\r\n  |    ccmp CARG1w, #0, #4, mi\r\n  |    sub CARG3w, CARG1w, CARG4w\r\n  |    csel CARG1w, CARG1w, CARG3w, eq\r\n  |  eor CARG3w, CARG1w, CARG2w\r\n  |  cmp CARG3w, #0\r\n  |  cneg CARG1w, CARG1w, mi\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions.\r\n  |// Saveregs already performed. Callback slot number in [sp], g in r12.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs\r\n  |  ldr CTSTATE, GL:x10->ctype_state\r\n  |  mov GL, x10\r\n  |    add x10, sp, # CFRAME_SPACE\r\n  |  str w9, CTSTATE->cb.slot\r\n  |  stp x0, x1, CTSTATE->cb.gpr[0]\r\n  |   stp d0, d1, CTSTATE->cb.fpr[0]\r\n  |  stp x2, x3, CTSTATE->cb.gpr[2]\r\n  |   stp d2, d3, CTSTATE->cb.fpr[2]\r\n  |  stp x4, x5, CTSTATE->cb.gpr[4]\r\n  |   stp d4, d5, CTSTATE->cb.fpr[4]\r\n  |  stp x6, x7, CTSTATE->cb.gpr[6]\r\n  |   stp d6, d7, CTSTATE->cb.fpr[6]\r\n  |    str x10, CTSTATE->cb.stack\r\n  |  mov CARG1, CTSTATE\r\n  |   str CTSTATE, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  mov CARG2, sp\r\n  |  bl extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // Returns lua_State *.\r\n  |  ldp BASE, RC, L:CRET1->base\r\n  |   movz TISNUM, #(LJ_TISNUM>>1)&0xffff, lsl #48\r\n  |   movz TISNUMhi, #(LJ_TISNUM>>1)&0xffff, lsl #16\r\n  |   movn TISNIL, #0\r\n  |   mov L, CRET1\r\n  |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n  |  sub RC, RC, BASE\r\n  |   st_vmstate ST_INTERP\r\n  |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  ldr CTSTATE, GL->ctype_state\r\n  |   stp BASE, CARG4, L->base\r\n  |  str L, CTSTATE->L\r\n  |  mov CARG1, CTSTATE\r\n  |  mov CARG2, RA\r\n  |  bl extern lj_ccallback_leave       // (CTState *cts, TValue *o)\r\n  |  ldp x0, x1, CTSTATE->cb.gpr[0]\r\n  |   ldp d0, d1, CTSTATE->cb.fpr[0]\r\n  |  b ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, x19\r\n  |  stp fp, lr, [sp, #-32]!\r\n  |  add fp, sp, #0\r\n  |  str CCSTATE, [sp, #16]\r\n  |  mov CCSTATE, x0\r\n  |  ldr TMP0w, CCSTATE:x0->spadj\r\n  |   ldrb TMP1w, CCSTATE->nsp\r\n  |    add TMP2, CCSTATE, #offsetof(CCallState, stack)\r\n  |   subs TMP1, TMP1, #1\r\n  |    ldr TMP3, CCSTATE->func\r\n  |  sub sp, fp, TMP0\r\n  |   bmi >2\r\n  |1:  // Copy stack slots\r\n  |  ldr TMP0, [TMP2, TMP1, lsl #3]\r\n  |  str TMP0, [sp, TMP1, lsl #3]\r\n  |  subs TMP1, TMP1, #1\r\n  |  bpl <1\r\n  |2:\r\n  |  ldp x0, x1, CCSTATE->gpr[0]\r\n  |   ldp d0, d1, CCSTATE->fpr[0]\r\n  |  ldp x2, x3, CCSTATE->gpr[2]\r\n  |   ldp d2, d3, CCSTATE->fpr[2]\r\n  |  ldp x4, x5, CCSTATE->gpr[4]\r\n  |   ldp d4, d5, CCSTATE->fpr[4]\r\n  |  ldp x6, x7, CCSTATE->gpr[6]\r\n  |   ldp d6, d7, CCSTATE->fpr[6]\r\n  |  ldr x8, CCSTATE->retp\r\n  |  blr TMP3\r\n  |  mov sp, fp\r\n  |  stp x0, x1, CCSTATE->gpr[0]\r\n  |   stp d0, d1, CCSTATE->fpr[0]\r\n  |   stp d2, d3, CCSTATE->fpr[2]\r\n  |  ldr CCSTATE, [sp, #16]\r\n  |  ldp fp, lr, [sp], #32\r\n  |  ret\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1, RC = src2, JMP with RC = target\r\n    |  ldr CARG1, [BASE, RA, lsl #3]\r\n    |    ldrh RBw, [PC, #2]\r\n    |   ldr CARG2, [BASE, RC, lsl #3]\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |    sub RB, RB, #0x20000\r\n    |  checkint CARG1, >3\r\n    |   checkint CARG2, >4\r\n    |  cmp CARG1w, CARG2w\r\n    if (op == BC_ISLT) {\r\n      |  csel PC, RB, PC, lt\r\n    } else if (op == BC_ISGE) {\r\n      |  csel PC, RB, PC, ge\r\n    } else if (op == BC_ISLE) {\r\n      |  csel PC, RB, PC, le\r\n    } else {\r\n      |  csel PC, RB, PC, gt\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |3:  // RA not int.\r\n    |    ldr FARG1, [BASE, RA, lsl #3]\r\n    |  blo ->vmeta_comp\r\n    |    ldr FARG2, [BASE, RC, lsl #3]\r\n    |   cmp TISNUMhi, CARG2, lsr #32\r\n    |   bhi >5\r\n    |   bne ->vmeta_comp\r\n    |  // RA number, RC int.\r\n    |  scvtf FARG2, CARG2w\r\n    |  b >5\r\n    |\r\n    |4:  // RA int, RC not int\r\n    |    ldr FARG2, [BASE, RC, lsl #3]\r\n    |   blo ->vmeta_comp\r\n    |  // RA int, RC number.\r\n    |  scvtf FARG1, CARG1w\r\n    |\r\n    |5:  // RA number, RC number\r\n    |  fcmp FARG1, FARG2\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    if (op == BC_ISLT) {\r\n      |  csel PC, RB, PC, lo\r\n    } else if (op == BC_ISGE) {\r\n      |  csel PC, RB, PC, hs\r\n    } else if (op == BC_ISLE) {\r\n      |  csel PC, RB, PC, ls\r\n    } else {\r\n      |  csel PC, RB, PC, hi\r\n    }\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1, RC = src2, JMP with RC = target\r\n    |  ldr CARG1, [BASE, RA, lsl #3]\r\n    |   add RC, BASE, RC, lsl #3\r\n    |    ldrh RBw, [PC, #2]\r\n    |   ldr CARG3, [RC]\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |    sub RB, RB, #0x20000\r\n    |  asr ITYPE, CARG3, #47\r\n    |  cmn ITYPE, #-LJ_TISNUM\r\n    if (vk) {\r\n      |  bls ->BC_ISEQN_Z\r\n    } else {\r\n      |  bls ->BC_ISNEN_Z\r\n    }\r\n    |  // RC is not a number.\r\n    |   asr TMP0, CARG1, #47\r\n    |.if FFI\r\n    |  // Check if RC or RA is a cdata.\r\n    |  cmn ITYPE, #-LJ_TCDATA\r\n    |   ccmn TMP0, #-LJ_TCDATA, #4, ne\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG1, CARG3\r\n    |  bne >2\r\n    |  // Tag and value are equal.\r\n    if (vk) {\r\n      |->BC_ISEQV_Z:\r\n      |  mov PC, RB\t\t\t// Perform branch.\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if the tags are the same and it's a table or userdata.\r\n    |  cmp ITYPE, TMP0\r\n    |  ccmn ITYPE, #-LJ_TISTABUD, #2, eq\r\n    if (vk) {\r\n      |  bhi <1\r\n    } else {\r\n      |  bhi ->BC_ISEQV_Z\t\t// Reuse code from opposite instruction.\r\n    }\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  and TAB:CARG2, CARG1, #LJ_GCVMASK\r\n    |  ldr TAB:TMP2, TAB:CARG2->metatable\r\n    if (vk) {\r\n      |  cbz TAB:TMP2, <1\t\t// No metatable?\r\n      |  ldrb TMP1w, TAB:TMP2->nomm\r\n      |   mov CARG4, #0\t\t\t// ne = 0\r\n      |  tbnz TMP1w, #MM_eq, <1\t\t// 'no __eq' flag set: done.\r\n    } else {\r\n      |  cbz TAB:TMP2, ->BC_ISEQV_Z\t// No metatable?\r\n      |  ldrb TMP1w, TAB:TMP2->nomm\r\n      |   mov CARG4, #1\t\t\t// ne = 1.\r\n      |  tbnz TMP1w, #MM_eq, ->BC_ISEQV_Z\t// 'no __eq' flag set: done.\r\n    }\r\n    |  b ->vmeta_equal\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src, RC = str_const (~), JMP with RC = target\r\n    |  ldr CARG1, [BASE, RA, lsl #3]\r\n    |   mvn RC, RC\r\n    |    ldrh RBw, [PC, #2]\r\n    |   ldr CARG2, [KBASE, RC, lsl #3]\r\n    |    add PC, PC, #4\r\n    |   movn TMP0, #~LJ_TSTR\r\n    |.if FFI\r\n    |  asr ITYPE, CARG1, #47\r\n    |.endif\r\n    |    add RB, PC, RB, lsl #2\r\n    |   add CARG2, CARG2, TMP0, lsl #47\r\n    |    sub RB, RB, #0x20000\r\n    |.if FFI\r\n    |  cmn ITYPE, #-LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  cmp CARG1, CARG2\r\n    if (vk) {\r\n      |  csel PC, RB, PC, eq\r\n    } else {\r\n      |  csel PC, RB, PC, ne\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src, RC = num_const (~), JMP with RC = target\r\n    |  ldr CARG1, [BASE, RA, lsl #3]\r\n    |   add RC, KBASE, RC, lsl #3\r\n    |    ldrh RBw, [PC, #2]\r\n    |   ldr CARG3, [RC]\r\n    |    add PC, PC, #4\r\n    |    add RB, PC, RB, lsl #2\r\n    |    sub RB, RB, #0x20000\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:\r\n    } else {\r\n      |->BC_ISNEN_Z:\r\n    }\r\n    |  checkint CARG1, >4\r\n    |   checkint CARG3, >6\r\n    |  cmp CARG1w, CARG3w\r\n    |1:\r\n    if (vk) {\r\n      |  csel PC, RB, PC, eq\r\n      |2:\r\n    } else {\r\n      |2:\r\n      |  csel PC, RB, PC, ne\r\n    }\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // RA not int.\r\n    |.if FFI\r\n    |  blo >7\r\n    |.else\r\n    |  blo <2\r\n    |.endif\r\n    |    ldr FARG1, [BASE, RA, lsl #3]\r\n    |    ldr FARG2, [RC]\r\n    |   cmp TISNUMhi, CARG3, lsr #32\r\n    |   bne >5\r\n    |  // RA number, RC int.\r\n    |  scvtf FARG2, CARG3w\r\n    |5:\r\n    |  // RA number, RC number.\r\n    |  fcmp FARG1, FARG2\r\n    |  b <1\r\n    |\r\n    |6:  // RA int, RC number\r\n    |  ldr FARG2, [RC]\r\n    |  scvtf FARG1, CARG1w\r\n    |  fcmp FARG1, FARG2\r\n    |  b <1\r\n    |\r\n    |.if FFI\r\n    |7:\r\n    |  asr ITYPE, CARG1, #47\r\n    |  cmn ITYPE, #-LJ_TCDATA\r\n    |  bne <2\r\n    |  b ->vmeta_equal_cd\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src, RC = primitive_type (~), JMP with RC = target\r\n    |  ldr TMP0, [BASE, RA, lsl #3]\r\n    |   ldrh RBw, [PC, #2]\r\n    |   add PC, PC, #4\r\n    |  add RC, RC, #1\r\n    |   add RB, PC, RB, lsl #2\r\n    |.if FFI\r\n    |  asr ITYPE, TMP0, #47\r\n    |  cmn ITYPE, #-LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |  cmn RC, ITYPE\r\n    |.else\r\n    |  cmn RC, TMP0, asr #47\r\n    |.endif\r\n    |   sub RB, RB, #0x20000\r\n    if (vk) {\r\n      |  csel PC, RB, PC, eq\r\n    } else {\r\n      |  csel PC, RB, PC, ne\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst or unused, RC = src, JMP with RC = target\r\n    |   ldrh RBw, [PC, #2]\r\n    |  ldr TMP0, [BASE, RC, lsl #3]\r\n    |   add PC, PC, #4\r\n    |  mov_false TMP1\r\n    |   add RB, PC, RB, lsl #2\r\n    |  cmp TMP0, TMP1\r\n    |   sub RB, RB, #0x20000\r\n    if (op == BC_ISTC || op == BC_IST) {\r\n      if (op == BC_ISTC) {\r\n\t|  csel RA, RA, RC, lo\r\n      }\r\n      |  csel PC, RB, PC, lo\r\n    } else {\r\n      if (op == BC_ISFC) {\r\n\t|  csel RA, RA, RC, hs\r\n      }\r\n      |  csel PC, RB, PC, hs\r\n    }\r\n    if (op == BC_ISTC || op == BC_ISFC) {\r\n      |  str TMP0, [BASE, RA, lsl #3]\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  // RA = src, RC = -type\r\n    |  ldr TMP0, [BASE, RA, lsl #3]\r\n    |  cmn RC, TMP0, asr #47\r\n    |  bne ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n  case BC_ISNUM:\r\n    |  // RA = src, RC = -(TISNUM-1)\r\n    |  ldr TMP0, [BASE, RA]\r\n    |  checknum TMP0, ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst, RC = src\r\n    |  ldr TMP0, [BASE, RC, lsl #3]\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst, RC = src\r\n    |  ldr TMP0, [BASE, RC, lsl #3]\r\n    |   mov_false TMP1\r\n    |   mov_true TMP2\r\n    |  cmp TMP0, TMP1\r\n    |  csel TMP0, TMP1, TMP2, lo\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst, RC = src\r\n    |  ldr TMP0, [BASE, RC, lsl #3]\r\n    |  asr ITYPE, TMP0, #47\r\n    |  cmn ITYPE, #-LJ_TISNUM\r\n    |  bhi ->vmeta_unm\r\n    |  eor TMP0, TMP0, #U64x(80000000,00000000)\r\n    |  bne >5\r\n    |  negs TMP0w, TMP0w\r\n    |   movz CARG3, #0x41e0, lsl #48\t// 2^31.\r\n    |   add TMP0, TMP0, TISNUM\r\n    |  csel TMP0, TMP0, CARG3, vc\r\n    |5:\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst, RC = src\r\n    |  ldr CARG1, [BASE, RC, lsl #3]\r\n    |  asr ITYPE, CARG1, #47\r\n    |  cmn ITYPE, #-LJ_TSTR\r\n    |   and CARG1, CARG1, #LJ_GCVMASK\r\n    |  bne >2\r\n    |  ldr CARG1w, STR:CARG1->len\r\n    |1:\r\n    |  add CARG1, CARG1, TISNUM\r\n    |  str CARG1, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |\r\n    |2:\r\n    |  cmn ITYPE, #-LJ_TTAB\r\n    |  bne ->vmeta_len\r\n#if LJ_52\r\n    |  ldr TAB:CARG2, TAB:CARG1->metatable\r\n    |  cbnz TAB:CARG2, >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n    |\r\n#if LJ_52\r\n    |9:\r\n    |  ldrb TMP1w, TAB:CARG2->nomm\r\n    |  tbnz TMP1w, #MM_len, <3\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithcheck_int, target\r\n    |  checkint CARG1, target\r\n    |  checkint CARG2, target\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithcheck_num, target\r\n    |  checknum CARG1, target\r\n    |  checknum CARG2, target\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithcheck_nzdiv, target\r\n    |  cbz CARG2w, target\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithhead\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||if (vk == 1) {\r\n    |   and RC, RC, #255\r\n    |    decode_RB RB, INS\r\n    ||} else {\r\n    |   decode_RB RB, INS\r\n    |    and RC, RC, #255\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithload, reg1, reg2\r\n    |  // RA = dst, RB = src1, RC = src2 | num_const\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ldr reg1, [BASE, RB, lsl #3]\r\n    |    ldr reg2, [KBASE, RC, lsl #3]\r\n    ||  break;\r\n    ||case 1:\r\n    |   ldr reg1, [KBASE, RC, lsl #3]\r\n    |    ldr reg2, [BASE, RB, lsl #3]\r\n    ||  break;\r\n    ||default:\r\n    |   ldr reg1, [BASE, RB, lsl #3]\r\n    |    ldr reg2, [BASE, RC, lsl #3]\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfallback, ins\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ins ->vmeta_arith_vn\r\n    ||  break;\r\n    ||case 1:\r\n    |   ins ->vmeta_arith_nv\r\n    ||  break;\r\n    ||default:\r\n    |   ins ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithmod, res, reg1, reg2\r\n    |  fdiv d2, reg1, reg2\r\n    |  frintm d2, d2\r\n    |  fmsub res, d2, reg2, reg1\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins, fpins\r\n    |  ins_arithhead\r\n    |  ins_arithload CARG1, CARG2\r\n    |  ins_arithcheck_int >5\r\n    |.if \"intins\" == \"smull\"\r\n    |  smull CARG1, CARG1w, CARG2w\r\n    |  cmp CARG1, CARG1, sxtw\r\n    |   mov CARG1w, CARG1w\r\n    |  ins_arithfallback bne\r\n    |.elif \"intins\" == \"ins_arithmodi\"\r\n    |  ins_arithfallback ins_arithcheck_nzdiv\r\n    |  bl ->vm_modi\r\n    |.else\r\n    |  intins CARG1w, CARG1w, CARG2w\r\n    |  ins_arithfallback bvs\r\n    |.endif\r\n    |  add CARG1, CARG1, TISNUM\r\n    |  str CARG1, [BASE, RA, lsl #3]\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // FP variant.\r\n    |  ins_arithload FARG1, FARG2\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |  fpins FARG1, FARG1, FARG2\r\n    |  str FARG1, [BASE, RA, lsl #3]\r\n    |  b <4\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfp, fpins\r\n    |  ins_arithhead\r\n    |  ins_arithload CARG1, CARG2\r\n    |  ins_arithload FARG1, FARG2\r\n    |  ins_arithfallback ins_arithcheck_num\r\n    |.if \"fpins\" == \"fpow\"\r\n    |  bl extern pow\r\n    |.else\r\n    |  fpins FARG1, FARG1, FARG2\r\n    |.endif\r\n    |  str FARG1, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arithdn adds, fadd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arithdn subs, fsub\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arithdn smull, fmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arithfp fdiv\r\n    break;\r\n  case BC_MODVN: case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithdn ins_arithmodi, ins_arithmod\r\n    break;\r\n  case BC_POW:\r\n    |  // NYI: (partial) integer arithmetic.\r\n    |  ins_arithfp fpow\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = src_start, RC = src_end\r\n    |   str BASE, L->base\r\n    |  sub CARG3, RC, RB\r\n    |  add CARG2, BASE, RC, lsl #3\r\n    |->BC_CAT_Z:\r\n    |  // RA = dst, CARG2 = top-1, CARG3 = left\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  ldrb RBw, [PC, #-1]\r\n    |   ldr BASE, L->base\r\n    |   cbnz CRET1, ->vmeta_binop\r\n    |  ldr TMP0, [BASE, RB, lsl #3]\r\n    |  str TMP0, [BASE, RA, lsl #3]\t// Copy result to RA.\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst, RC = str_const (~)\r\n    |  mvn RC, RC\r\n    |  ldr TMP0, [KBASE, RC, lsl #3]\r\n    |   movn TMP1, #~LJ_TSTR\r\n    |  add TMP0, TMP0, TMP1, lsl #47\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst, RC = cdata_const (~)\r\n    |  mvn RC, RC\r\n    |  ldr TMP0, [KBASE, RC, lsl #3]\r\n    |   movn TMP1, #~LJ_TCDATA\r\n    |  add TMP0, TMP0, TMP1, lsl #47\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst, RC = int16_literal\r\n    |  sxth RCw, RCw\r\n    |  add TMP0, RC, TISNUM\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst, RC = num_const\r\n    |  ldr TMP0, [KBASE, RC, lsl #3]\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst, RC = primitive_type (~)\r\n    |  mvn TMP0, RC, lsl #47\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base, RC = end\r\n    |  add RA, BASE, RA, lsl #3\r\n    |   add RC, BASE, RC, lsl #3\r\n    |  str TISNIL, [RA], #8\r\n    |1:\r\n    |   cmp RA, RC\r\n    |  str TISNIL, [RA], #8\r\n    |   blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst, RC = uvnum\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   add RC, RC, #offsetof(GCfuncL, uvptr)/8\r\n    |  and LFUNC:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RC, lsl #3]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |  ldr TMP0, [CARG2]\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum, RC = src\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)/8\r\n    |  and LFUNC:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr UPVAL:CARG1, [LFUNC:CARG2, RA, lsl #3]\r\n    |   ldr CARG3, [BASE, RC, lsl #3]\r\n    |    ldr CARG2, UPVAL:CARG1->v\r\n    |  ldrb TMP2w, UPVAL:CARG1->marked\r\n    |  ldrb TMP0w, UPVAL:CARG1->closed\r\n    |    asr ITYPE, CARG3, #47\r\n    |   str CARG3, [CARG2]\r\n    |    add ITYPE, ITYPE, #-LJ_TISGCV\r\n    |  tst TMP2w, #LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  ccmp TMP0w, #0, #4, ne\t\t// && uv->closed\r\n    |    ccmn ITYPE, #-(LJ_TNUMX - LJ_TISGCV), #0, ne\t// && tvisgcv(v)\r\n    |  bhi >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is white.\r\n    |  and GCOBJ:CARG3, CARG3, #LJ_GCVMASK\r\n    |  ldrb TMP1w, GCOBJ:CARG3->gch.marked\r\n    |  tst TMP1w, #LJ_GC_WHITES\t\t// iswhite(str)\r\n    |  beq <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  mov CARG1, GL\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum, RC = str_const (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)/8\r\n    |    mvn RC, RC\r\n    |  and LFUNC:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr UPVAL:CARG1, [LFUNC:CARG2, RA, lsl #3]\r\n    |   ldr STR:CARG3, [KBASE, RC, lsl #3]\r\n    |   movn TMP0, #~LJ_TSTR\r\n    |    ldr CARG2, UPVAL:CARG1->v\r\n    |  ldrb TMP2w, UPVAL:CARG1->marked\r\n    |   add TMP0, STR:CARG3, TMP0, lsl #47\r\n    |    ldrb TMP1w, STR:CARG3->marked\r\n    |   str TMP0, [CARG2]\r\n    |  tbnz TMP2w, #2, >2\t\t// isblack(uv)\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  ldrb TMP0w, UPVAL:CARG1->closed\r\n    |    tst TMP1w, #LJ_GC_WHITES\t// iswhite(str)\r\n    |  ccmp TMP0w, #0, #0, ne\r\n    |  beq <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  mov CARG1, GL\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum, RC = num_const\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)/8\r\n    |  and LFUNC:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA, lsl #3]\r\n    |   ldr TMP0, [KBASE, RC, lsl #3]\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   str TMP0, [CARG2]\r\n    |  ins_next\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum, RC = primitive_type (~)\r\n    |  ldr LFUNC:CARG2, [BASE, FRAME_FUNC]\r\n    |   add RA, RA, #offsetof(GCfuncL, uvptr)/8\r\n    |  and LFUNC:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr UPVAL:CARG2, [LFUNC:CARG2, RA, lsl #3]\r\n    |   mvn TMP0, RC, lsl #47\r\n    |  ldr CARG2, UPVAL:CARG2->v\r\n    |   str TMP0, [CARG2]\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level, RC = target\r\n    |  ldr CARG3, L->openupval\r\n    |   add RC, PC, RC, lsl #2\r\n    |    str BASE, L->base\r\n    |   sub PC, RC, #0x20000\r\n    |  cbz CARG3, >1\r\n    |  mov CARG1, L\r\n    |  add CARG2, BASE, RA, lsl #3\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  ldr BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst, RC = proto_const (~) (holding function prototype)\r\n    |  mvn RC, RC\r\n    |   str BASE, L->base\r\n    |  ldr LFUNC:CARG3, [BASE, FRAME_FUNC]\r\n    |    str PC, SAVE_PC\r\n    |   ldr CARG2, [KBASE, RC, lsl #3]\r\n    |    mov CARG1, L\r\n    |  and LFUNC:CARG3, CARG3, #LJ_GCVMASK\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  ldr BASE, L->base\r\n    |   movn TMP0, #~LJ_TFUNC\r\n    |   add CRET1, CRET1, TMP0, lsl #47\r\n    |  str CRET1, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst, RC = (hbits|asize) | tab_const (~)\r\n    |  ldp CARG3, CARG4, GL->gc.total\t// Assumes threshold follows total.\r\n    |   str BASE, L->base\r\n    |   str PC, SAVE_PC\r\n    |   mov CARG1, L\r\n    |  cmp CARG3, CARG4\r\n    |  bhs >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  and CARG2, RC, #0x7ff\r\n      |   lsr CARG3, RC, #11\r\n      |  cmp CARG2, #0x7ff\r\n      |  mov TMP0, #0x801\r\n      |  csel CARG2, CARG2, TMP0, ne\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns GCtab *.\r\n    } else {\r\n      |  mvn RC, RC\r\n      |  ldr CARG2, [KBASE, RC, lsl #3]\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns GCtab *.\r\n    }\r\n    |  ldr BASE, L->base\r\n    |   movk CRET1, #(LJ_TTAB>>1)&0xffff, lsl #48\r\n    |  str CRET1, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |\r\n    |5:\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mov CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst, RC = str_const (~)\r\n  case BC_GSET:\r\n    |  // RA = dst, RC = str_const (~)\r\n    |  ldr LFUNC:CARG1, [BASE, FRAME_FUNC]\r\n    |   mvn RC, RC\r\n    |  and LFUNC:CARG1, CARG1, #LJ_GCVMASK\r\n    |  ldr TAB:CARG2, LFUNC:CARG1->env\r\n    |   ldr STR:RC, [KBASE, RC, lsl #3]\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = table, RC = key\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |   ldr TMP1, [BASE, RC, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tgetv\r\n    |  checkint TMP1, >9\t\t// Integer key?\r\n    |  ldr CARG3, TAB:CARG2->array\r\n    |   ldr CARG1w, TAB:CARG2->asize\r\n    |  add CARG3, CARG3, TMP1, uxtw #3\r\n    |   cmp TMP1w, CARG1w\t\t// In array part?\r\n    |   bhs ->vmeta_tgetv\r\n    |  ldr TMP0, [CARG3]\r\n    |  cmp TMP0, TISNIL\r\n    |  beq >5\r\n    |1:\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <1\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_index, <1\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |9:\r\n    |  asr ITYPE, TMP1, #47\r\n    |  cmn ITYPE, #-LJ_TSTR\t\t// String key?\r\n    |  bne ->vmeta_tgetv\r\n    |   and STR:RC, TMP1, #LJ_GCVMASK\r\n    |  b ->BC_TGETS_Z\r\n    break;\r\n  case BC_TGETS:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = table, RC = str_const (~)\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:CARG2 = GCtab *, STR:RC = GCstr *, RA = dst\r\n    |  ldr TMP1w, TAB:CARG2->hmask\r\n    |   ldr TMP2w, STR:RC->hash\r\n    |    ldr NODE:CARG3, TAB:CARG2->node\r\n    |  and TMP1w, TMP1w, TMP2w\t\t// idx = str->hash & tab->hmask\r\n    |  add TMP1, TMP1, TMP1, lsl #1\r\n    |  movn CARG4, #~LJ_TSTR\r\n    |    add NODE:CARG3, NODE:CARG3, TMP1, lsl #3  // node = tab->node + idx*3*8\r\n    |  add CARG4, STR:RC, CARG4, lsl #47\t// Tagged key to look for.\r\n    |1:\r\n    |  ldp TMP0, CARG1, NODE:CARG3->val\r\n    |   ldr NODE:CARG3, NODE:CARG3->next\r\n    |  cmp CARG1, CARG4\r\n    |  bne >4\r\n    |  cmp TMP0, TISNIL\r\n    |  beq >5\r\n    |3:\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  cbnz NODE:CARG3, <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |   mov TMP0, TISNIL\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <3\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_index, <3\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = table, RC = index\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tgetb\r\n    |  ldr CARG3, TAB:CARG2->array\r\n    |   ldr CARG1w, TAB:CARG2->asize\r\n    |  add CARG3, CARG3, RC, lsl #3\r\n    |   cmp RCw, CARG1w\t\t\t// In array part?\r\n    |   bhs ->vmeta_tgetb\r\n    |  ldr TMP0, [CARG3]\r\n    |  cmp TMP0, TISNIL\r\n    |  beq >5\r\n    |1:\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <1\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_index, <1\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\r\n    break;\r\n  case BC_TGETR:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = table, RC = key\r\n    |  ldr CARG1, [BASE, RB, lsl #3]\r\n    |   ldr TMP1, [BASE, RC, lsl #3]\r\n    |  and TAB:CARG1, CARG1, #LJ_GCVMASK\r\n    |  ldr CARG3, TAB:CARG1->array\r\n    |   ldr TMP2w, TAB:CARG1->asize\r\n    |  add CARG3, CARG3, TMP1w, uxtw #3\r\n    |   cmp TMP1w, TMP2w\t\t// In array part?\r\n    |   bhs ->vmeta_tgetr\r\n    |  ldr TMP0, [CARG3]\r\n    |->BC_TGETR_Z:\r\n    |  str TMP0, [BASE, RA, lsl #3]\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src, RB = table, RC = key\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |   ldr TMP1, [BASE, RC, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tsetv\r\n    |  checkint TMP1, >9\t\t// Integer key?\r\n    |  ldr CARG3, TAB:CARG2->array\r\n    |   ldr CARG1w, TAB:CARG2->asize\r\n    |  add CARG3, CARG3, TMP1, uxtw #3\r\n    |   cmp TMP1w, CARG1w\t\t// In array part?\r\n    |   bhs ->vmeta_tsetv\r\n    |  ldr TMP1, [CARG3]\r\n    |   ldr TMP0, [BASE, RA, lsl #3]\r\n    |    ldrb TMP2w, TAB:CARG2->marked\r\n    |  cmp TMP1, TISNIL\t\t\t// Previous value is nil?\r\n    |  beq >5\r\n    |1:\r\n    |   str TMP0, [CARG3]\r\n    |    tbnz TMP2w, #2, >7\t\t// isblack(table)\r\n    |2:\r\n    |   ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <1\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_newindex, <1\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP2w, TMP1\r\n    |  b <2\r\n    |\r\n    |9:\r\n    |  asr ITYPE, TMP1, #47\r\n    |  cmn ITYPE, #-LJ_TSTR\t\t// String key?\r\n    |  bne ->vmeta_tsetv\r\n    |   and STR:RC, TMP1, #LJ_GCVMASK\r\n    |  b ->BC_TSETS_Z\r\n    break;\r\n  case BC_TSETS:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = dst, RB = table, RC = str_const (~)\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |   mvn RC, RC\r\n    |   ldr STR:RC, [KBASE, RC, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:CARG2 = GCtab *, STR:RC = GCstr *, RA = src\r\n    |  ldr TMP1w, TAB:CARG2->hmask\r\n    |   ldr TMP2w, STR:RC->hash\r\n    |    ldr NODE:CARG3, TAB:CARG2->node\r\n    |  and TMP1w, TMP1w, TMP2w\t\t// idx = str->hash & tab->hmask\r\n    |  add TMP1, TMP1, TMP1, lsl #1\r\n    |  movn CARG4, #~LJ_TSTR\r\n    |    add NODE:CARG3, NODE:CARG3, TMP1, lsl #3  // node = tab->node + idx*3*8\r\n    |  add CARG4, STR:RC, CARG4, lsl #47\t// Tagged key to look for.\r\n    |   strb wzr, TAB:CARG2->nomm\t// Clear metamethod cache.\r\n    |1:\r\n    |  ldp TMP1, CARG1, NODE:CARG3->val\r\n    |   ldr NODE:TMP3, NODE:CARG3->next\r\n    |    ldrb TMP2w, TAB:CARG2->marked\r\n    |  cmp CARG1, CARG4\r\n    |  bne >5\r\n    |   ldr TMP0, [BASE, RA, lsl #3]\r\n    |  cmp TMP1, TISNIL\t\t\t// Previous value is nil?\r\n    |  beq >4\r\n    |2:\r\n    |   str TMP0, NODE:CARG3->val\r\n    |    tbnz TMP2w, #2, >7\t\t// isblack(table)\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <2\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_newindex, <2\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  mov NODE:CARG3, NODE:TMP3\r\n    |  cbnz NODE:TMP3, <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, >6\t\t// No metatable: continue.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  // 'no __newindex' flag NOT set: check.\r\n    |  tbz TMP1w, #MM_newindex, ->vmeta_tsets\r\n    |6:\r\n    |  movn TMP1, #~LJ_TSTR\r\n    |   str PC, SAVE_PC\r\n    |  add TMP0, STR:RC, TMP1, lsl #47\r\n    |   str BASE, L->base\r\n    |   mov CARG1, L\r\n    |  str TMP0, TMPD\r\n    |   add CARG3, sp, TMPDofs\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  ldr BASE, L->base\r\n    |  ldr TMP0, [BASE, RA, lsl #3]\r\n    |  str TMP0, [CRET1]\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP2w, TMP1\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src, RB = table, RC = index\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |  checktab CARG2, ->vmeta_tsetb\r\n    |  ldr CARG3, TAB:CARG2->array\r\n    |   ldr CARG1w, TAB:CARG2->asize\r\n    |  add CARG3, CARG3, RC, lsl #3\r\n    |   cmp RCw, CARG1w\t\t\t// In array part?\r\n    |   bhs ->vmeta_tsetb\r\n    |  ldr TMP1, [CARG3]\r\n    |   ldr TMP0, [BASE, RA, lsl #3]\r\n    |    ldrb TMP2w, TAB:CARG2->marked\r\n    |  cmp TMP1, TISNIL\t\t\t// Previous value is nil?\r\n    |  beq >5\r\n    |1:\r\n    |   str TMP0, [CARG3]\r\n    |    tbnz TMP2w, #2, >7\t\t// isblack(table)\r\n    |2:\r\n    |   ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  ldr TAB:CARG1, TAB:CARG2->metatable\r\n    |  cbz TAB:CARG1, <1\t\t// No metatable: done.\r\n    |  ldrb TMP1w, TAB:CARG1->nomm\r\n    |  tbnz TMP1w, #MM_newindex, <1\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetb\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP2w, TMP1\r\n    |  b <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = src, RB = table, RC = key\r\n    |  ldr CARG2, [BASE, RB, lsl #3]\r\n    |   ldr TMP1, [BASE, RC, lsl #3]\r\n    |  and TAB:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr CARG1, TAB:CARG2->array\r\n    |    ldrb TMP2w, TAB:CARG2->marked\r\n    |   ldr CARG4w, TAB:CARG2->asize\r\n    |  add CARG1, CARG1, TMP1, uxtw #3\r\n    |    tbnz TMP2w, #2, >7\t\t// isblack(table)\r\n    |2:\r\n    |   cmp TMP1w, CARG4w\t\t// In array part?\r\n    |   bhs ->vmeta_tsetr\r\n    |->BC_TSETR_Z:\r\n    |   ldr TMP0, [BASE, RA, lsl #3]\r\n    |   str TMP0, [CARG1]\r\n    |   ins_next\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP2w, TMP0\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base (table at base-1), RC = num_const (start index)\r\n    |  add RA, BASE, RA, lsl #3\r\n    |1:\r\n    |   ldr RBw, SAVE_MULTRES\r\n    |  ldr TAB:CARG2, [RA, #-8]\t\t// Guaranteed to be a table.\r\n    |   ldr TMP1, [KBASE, RC, lsl #3]\t// Integer constant is in lo-word.\r\n    |    sub RB, RB, #8\r\n    |    cbz RB, >4\t\t\t// Nothing to copy?\r\n    |  and TAB:CARG2, CARG2, #LJ_GCVMASK\r\n    |  ldr CARG1w, TAB:CARG2->asize\r\n    |   add CARG3w, TMP1w, RBw, lsr #3\r\n    |   ldr CARG4, TAB:CARG2->array\r\n    |  cmp CARG3, CARG1\r\n    |    add RB, RA, RB\r\n    |  bhi >5\r\n    |   add TMP1, CARG4, TMP1w, uxtw #3\r\n    |    ldrb TMP2w, TAB:CARG2->marked\r\n    |3:  // Copy result slots to table.\r\n    |   ldr TMP0, [RA], #8\r\n    |   str TMP0, [TMP1], #8\r\n    |  cmp RA, RB\r\n    |  blo <3\r\n    |    tbnz TMP2w, #2, >7\t\t// isblack(table)\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   str BASE, L->base\r\n    |  mov CARG1, L\r\n    |   str PC, SAVE_PC\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP2w, TMP1\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base, (RB = nresults+1,) RC = extra_nargs\r\n    |  ldr TMP0w, SAVE_MULTRES\r\n    |  decode_RC8RD NARGS8:RC, RC\r\n    |  add NARGS8:RC, NARGS8:RC, TMP0\r\n    |  b ->BC_CALL_Z\r\n    break;\r\n  case BC_CALL:\r\n    |  decode_RC8RD NARGS8:RC, RC\r\n    |  // RA = base, (RB = nresults+1,) RC = (nargs+1)*8\r\n    |->BC_CALL_Z:\r\n    |  mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |  add BASE, BASE, RA, lsl #3\r\n    |  ldr CARG3, [BASE]\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add BASE, BASE, #16\r\n    |  checkfunc CARG3, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base, (RB = 0,) RC = extra_nargs\r\n    |  ldr TMP0w, SAVE_MULTRES\r\n    |  add NARGS8:RC, TMP0, RC, lsl #3\r\n    |  b ->BC_CALLT1_Z\r\n    break;\r\n  case BC_CALLT:\r\n    |  lsl NARGS8:RC, RC, #3\r\n    |  // RA = base, (RB = 0,) RC = (nargs+1)*8\r\n    |->BC_CALLT1_Z:\r\n    |  add RA, BASE, RA, lsl #3\r\n    |  ldr TMP1, [RA]\r\n    |   sub NARGS8:RC, NARGS8:RC, #8\r\n    |   add RA, RA, #16\r\n    |  checktp CARG3, TMP1, LJ_TFUNC, ->vmeta_callt\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |->BC_CALLT2_Z:\r\n    |   mov RB, #0\r\n    |   ldrb TMP2w, LFUNC:CARG3->ffid\r\n    |  tst PC, #FRAME_TYPE\r\n    |  bne >7\r\n    |1:\r\n    |  str TMP1, [BASE, FRAME_FUNC]\t// Copy function down, but keep PC.\r\n    |  cbz NARGS8:RC, >3\r\n    |2:\r\n    |  ldr TMP0, [RA, RB]\r\n    |   add TMP1, RB, #8\r\n    |   cmp TMP1, NARGS8:RC\r\n    |  str TMP0, [BASE, RB]\r\n    |    mov RB, TMP1\r\n    |   bne <2\r\n    |3:\r\n    |  cmp TMP2, #1\t\t\t// (> FF_C) Calling a fast function?\r\n    |  bhi >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  ldrb RAw, [PC, #-3]\r\n    |  sub CARG1, BASE, RA, lsl #3\r\n    |  ldr LFUNC:CARG1, [CARG1, #-32]\r\n    |  and LFUNC:CARG1, CARG1, #LJ_GCVMASK\r\n    |  ldr CARG1, LFUNC:CARG1->pc\r\n    |  ldr KBASE, [CARG1, #PC2PROTO(k)]\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  eor PC, PC, #FRAME_VARG\r\n    |  tst PC, #FRAME_TYPEP\t\t// Vararg frame below?\r\n    |  csel TMP2, RB, TMP2, ne\t\t// Clear ffid if no Lua function below.\r\n    |  bne <1\r\n    |  sub BASE, BASE, PC\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  tst PC, #FRAME_TYPE\r\n    |  csel TMP2, RB, TMP2, ne\t\t// Clear ffid if no Lua function below.\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |  add RA, BASE, RA, lsl #3\r\n    |  ldr CARG3, [RA, #-24]\r\n    |    mov RB, BASE\t\t\t// Save old BASE for vmeta_call.\r\n    |   ldp CARG1, CARG2, [RA, #-16]\r\n    |    add BASE, RA, #16\r\n    |    mov NARGS8:RC, #16\t\t// Iterators get 2 arguments.\r\n    |  str CARG3, [RA]\t\t\t// Copy callable.\r\n    |   stp CARG1, CARG2, [RA, #16]\t// Copy state and control var.\r\n    |  checkfunc CARG3, ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA, lsl #3\r\n    |  ldr TAB:RB, [RA, #-16]\r\n    |    ldrh TMP3w, [PC, #2]\r\n    |  ldr CARG1w, [RA, #-8]\t\t// Get index from control var.\r\n    |    add PC, PC, #4\r\n    |    add TMP3, PC, TMP3, lsl #2\r\n    |  and TAB:RB, RB, #LJ_GCVMASK\r\n    |    sub TMP3, TMP3, #0x20000\r\n    |  ldr TMP1w, TAB:RB->asize\r\n    |   ldr CARG2, TAB:RB->array\r\n    |1:  // Traverse array part.\r\n    |  subs RC, CARG1, TMP1\r\n    |   add CARG3, CARG2, CARG1, lsl #3\r\n    |  bhs >5\t\t\t\t// Index points after array part?\r\n    |   ldr TMP0, [CARG3]\r\n    |   cmp TMP0, TISNIL\r\n    |   cinc CARG1, CARG1, eq\t\t// Skip holes in array part.\r\n    |   beq <1\r\n    |   add CARG1, CARG1, TISNUM\r\n    |   stp CARG1, TMP0, [RA]\r\n    |    add CARG1, CARG1, #1\r\n    |3:\r\n    |    str CARG1w, [RA, #-8]\t\t// Update control var.\r\n    |  mov PC, TMP3\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  ldr TMP2w, TAB:RB->hmask\r\n    |   ldr NODE:RB, TAB:RB->node\r\n    |6:\r\n    |   add CARG1, RC, RC, lsl #1\r\n    |  cmp RC, TMP2\t\t\t// End of iteration? Branch to ITERN+1.\r\n    |   add NODE:CARG3, NODE:RB, CARG1, lsl #3  // node = tab->node + idx*3*8\r\n    |  bhi <4\r\n    |  ldp TMP0, CARG1, NODE:CARG3->val\r\n    |  cmp TMP0, TISNIL\r\n    |   add RC, RC, #1\r\n    |  beq <6\t\t\t\t// Skip holes in hash part.\r\n    |  stp CARG1, TMP0, [RA]\r\n    |  add CARG1, RC, TMP1\r\n    |  b <3\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base, RC = target (points to ITERN)\r\n    |  add RA, BASE, RA, lsl #3\r\n    |  ldr CFUNC:CARG1, [RA, #-24]\r\n    |     add RC, PC, RC, lsl #2\r\n    |   ldp TAB:CARG3, CARG4, [RA, #-16]\r\n    |     sub RC, RC, #0x20000\r\n    |  checkfunc CFUNC:CARG1, >5\r\n    |   asr TMP0, TAB:CARG3, #47\r\n    |  ldrb TMP1w, CFUNC:CARG1->ffid\r\n    |   cmn TMP0, #-LJ_TTAB\r\n    |   ccmp CARG4, TISNIL, #0, eq\r\n    |  ccmp TMP1w, #FF_next_N, #0, eq\r\n    |  bne >5\r\n    |  mov TMP0w, #0xfffe7fff\r\n    |  lsl TMP0, TMP0, #32\r\n    |  str TMP0, [RA, #-8]\t\t// Initialize control var.\r\n    |1:\r\n    |     mov PC, RC\r\n    |  ins_next\r\n    |\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov TMP0, #BC_JMP\r\n    |   mov TMP1, #BC_ITERC\r\n    |  strb TMP0w, [PC, #-4]\r\n    |   strb TMP1w, [RC]\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  decode_RB RB, INS\r\n    |   and RC, RC, #255\r\n    |  // RA = base, RB = (nresults+1), RC = numparams\r\n    |  ldr TMP1, [BASE, FRAME_PC]\r\n    |  add RC, BASE, RC, lsl #3\r\n    |   add RA, BASE, RA, lsl #3\r\n    |  add RC, RC, #FRAME_VARG\r\n    |   add TMP2, RA, RB, lsl #3\r\n    |  sub RC, RC, TMP1\t\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |   sub TMP3, BASE, #16\t\t// TMP3 = vtop\r\n    |  cbz RB, >5\r\n    |   sub TMP2, TMP2, #16\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  cmp RC, TMP3\r\n    |  ldr TMP0, [RC], #8\r\n    |  csel TMP0, TMP0, TISNIL, lo\r\n    |   cmp RA, TMP2\r\n    |  str TMP0, [RA], #8\r\n    |   blo <1\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  ldr TMP0, L->maxstack\r\n    |   subs TMP2, TMP3, RC\r\n    |   csel RB, xzr, TMP2, le\t\t// MULTRES = (max(vtop-vbase,0)+1)*8\r\n    |   add RB, RB, #8\r\n    |  add TMP1, RA, TMP2\r\n    |   str RBw, SAVE_MULTRES\r\n    |   ble <2\t\t\t\t// Nothing to copy.\r\n    |  cmp TMP1, TMP0\r\n    |  bhi >7\r\n    |6:\r\n    |  ldr TMP0, [RC], #8\r\n    |  str TMP0, [RA], #8\r\n    |  cmp RC, TMP3\r\n    |  blo <6\r\n    |  b <2\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  lsr CARG2, TMP2, #3\r\n    |   stp BASE, RA, L->base\r\n    |  mov CARG1, L\r\n    |  sub RC, RC, BASE\t\t\t// Need delta, because BASE may change.\r\n    |   str PC, SAVE_PC\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  ldp BASE, RA, L->base\r\n    |  add RC, BASE, RC\r\n    |  sub TMP3, BASE, #16\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results, RC = extra results\r\n    |  ldr TMP0w, SAVE_MULTRES\r\n    |   ldr PC, [BASE, FRAME_PC]\r\n    |    add RA, BASE, RA, lsl #3\r\n    |  add RC, TMP0, RC, lsl #3\r\n    |  b ->BC_RETM_Z\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |    add RA, BASE, RA, lsl #3\r\n    |->BC_RETM_Z:\r\n    |   str RCw, SAVE_MULTRES\r\n    |1:\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |  bne ->BC_RETV2_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RC = (nresults+1)*8, PC = return\r\n    |  ldr INSw, [PC, #-4]\r\n    |  subs TMP1, RC, #8\r\n    |   sub CARG3, BASE, #16\r\n    |  beq >3\r\n    |2:\r\n    |  ldr TMP0, [RA], #8\r\n    |   add BASE, BASE, #8\r\n    |   sub TMP1, TMP1, #8\r\n    |  str TMP0, [BASE, #-24]\r\n    |   cbnz TMP1, <2\r\n    |3:\r\n    |  decode_RA RA, INS\r\n    |  sub CARG4, CARG3, RA, lsl #3\r\n    |   decode_RB RB, INS\r\n    |  ldr LFUNC:CARG1, [CARG4, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RC, RB, lsl #3\t\t// More results expected?\r\n    |  blo >6\r\n    |  and LFUNC:CARG1, CARG1, #LJ_GCVMASK\r\n    |  mov BASE, CARG4\r\n    |  ldr CARG2, LFUNC:CARG1->pc\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |   ins_next\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  add BASE, BASE, #8\r\n    |   add RC, RC, #8\r\n    |  str TISNIL, [BASE, #-24]\r\n    |  b <5\r\n    |\r\n    |->BC_RETV1_Z:  // Non-standard return case.\r\n    |  add RA, BASE, RA, lsl #3\r\n    |->BC_RETV2_Z:\r\n    |  tst CARG2, #FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, CARG2\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results, RC = nresults+1\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   lsl RC, RC, #3\r\n    |   str RCw, SAVE_MULTRES\r\n    |  ands CARG1, PC, #FRAME_TYPE\r\n    |   eor CARG2, PC, #FRAME_VARG\r\n    |  bne ->BC_RETV1_Z\r\n    |   ldr INSw, [PC, #-4]\r\n    if (op == BC_RET1) {\r\n      |  ldr TMP0, [BASE, RA, lsl #3]\r\n    }\r\n    |  sub CARG4, BASE, #16\r\n    |   decode_RA RA, INS\r\n    |  sub BASE, CARG4, RA, lsl #3\r\n    if (op == BC_RET1) {\r\n      |  str TMP0, [CARG4], #8\r\n    }\r\n    |   decode_RB RB, INS\r\n    |  ldr LFUNC:CARG1, [BASE, FRAME_FUNC]\r\n    |5:\r\n    |  cmp RC, RB, lsl #3\r\n    |  blo >6\r\n    |  and LFUNC:CARG1, CARG1, #LJ_GCVMASK\r\n    |  ldr CARG2, LFUNC:CARG1->pc\r\n    |  ldr KBASE, [CARG2, #PC2PROTO(k)]\r\n    |  ins_next\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  add RC, RC, #8\r\n    |  str TISNIL, [CARG4], #8\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA];      .define FOR_TIDX,  [RA, #4]\r\n  |.define FOR_STOP, [RA, #8];  .define FOR_TSTOP, [RA, #12]\r\n  |.define FOR_STEP, [RA, #16]; .define FOR_TSTEP, [RA, #20]\r\n  |.define FOR_EXT,  [RA, #24]; .define FOR_TEXT,  [RA, #28]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base, RC = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  add RA, BASE, RA, lsl #3\r\n    |  ldp CARG1, CARG2, FOR_IDX\t\t// CARG1 = IDX, CARG2 = STOP\r\n    |   ldr CARG3, FOR_STEP\t\t\t// CARG3 = STEP\r\n    if (op != BC_JFORL) {\r\n      |   add RC, PC, RC, lsl #2\r\n      |   sub RC, RC, #0x20000\r\n    }\r\n    |  checkint CARG1, >5\r\n    if (!vk) {\r\n      |  checkint CARG2, ->vmeta_for\r\n      |   checkint CARG3, ->vmeta_for\r\n      |  tbnz CARG3w, #31, >4\r\n      |  cmp CARG1w, CARG2w\r\n    } else {\r\n      |  adds CARG1w, CARG1w, CARG3w\r\n      |  bvs >2\r\n      |   add TMP0, CARG1, TISNUM\r\n      |  tbnz CARG3w, #31, >4\r\n      |  cmp CARG1w, CARG2w\r\n    }\r\n    |1:\r\n    if (op == BC_FORI) {\r\n      |  csel PC, RC, PC, gt\r\n    } else if (op == BC_JFORI) {\r\n      |  ldrh RCw, [RC, #-2]\r\n    } else if (op == BC_IFORL) {\r\n      |  csel PC, RC, PC, le\r\n    }\r\n    if (vk) {\r\n      |   str TMP0, FOR_IDX\r\n      |   str TMP0, FOR_EXT\r\n    } else {\r\n      |  str CARG1, FOR_EXT\r\n    }\r\n    if (op == BC_JFORI || op == BC_JFORL) {\r\n      |  ble =>BC_JLOOP\r\n    }\r\n    |2:\r\n    |   ins_next\r\n    |\r\n    |4:  // Invert check for negative step.\r\n    |  cmp CARG2w, CARG1w\r\n    |  b <1\r\n    |\r\n    |5:  // FP loop.\r\n    |  ldp d0, d1, FOR_IDX\r\n    |  blo ->vmeta_for\r\n    if (!vk) {\r\n      |  checknum CARG2, ->vmeta_for\r\n      |   checknum CARG3, ->vmeta_for\r\n      |  str d0, FOR_EXT\r\n    } else {\r\n      |  ldr d2, FOR_STEP\r\n      |  fadd d0, d0, d2\r\n    }\r\n    |  tbnz CARG3, #63, >7\r\n    |  fcmp d0, d1\r\n    |6:\r\n    if (vk) {\r\n      |  str d0, FOR_IDX\r\n      |  str d0, FOR_EXT\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  csel PC, RC, PC, hi\r\n    } else if (op == BC_JFORI) {\r\n      |  ldrh RCw, [RC, #-2]\r\n      |  bls =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |  csel PC, RC, PC, ls\r\n    } else {\r\n      |  bls =>BC_JLOOP\r\n    }\r\n    |  b <2\r\n    |\r\n    |7:  // Invert check for negative step.\r\n    |  fcmp d1, d0\r\n    |  b <6\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base, RC = target\r\n    |  ldr CARG1, [BASE, RA, lsl #3]\r\n    |   add TMP1, BASE, RA, lsl #3\r\n    |  cmp CARG1, TISNIL\r\n    |  beq >1\t\t\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  str CARG1, [TMP1, #-8]\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  add TMP0, PC, RC, lsl #2\t// Otherwise save control var + branch.\r\n      |  sub PC, TMP0, #0x20000\r\n      |  str CARG1, [TMP1, #-8]\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base, RC = target (loop extent)\r\n    |  // Note: RA/RC is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base, RC = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  NYI\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base (only used by trace recorder), RC = target\r\n    |  add RC, PC, RC, lsl #2\r\n    |  sub PC, RC, #0x20000\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   ldrb TMP1w, [PC, #-4+PC2PROTO(numparams)]\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |  bhi ->vm_growstack_l\r\n    |2:\r\n    |  cmp NARGS8:RC, TMP1, lsl #3\t// Check for missing parameters.\r\n    |  blo >3\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD RC, INS\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  str TISNIL, [BASE, NARGS8:RC]\r\n    |  add NARGS8:RC, NARGS8:RC, #8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = LFUNC, RC = nargs*8\r\n    |  ldr CARG1, L->maxstack\r\n    |   add TMP2, BASE, RC\r\n    |  add RA, RA, RC\r\n    |   add TMP0, RC, #16+FRAME_VARG\r\n    |   str LFUNC:CARG3, [TMP2], #8\t// Store (untagged) copy of LFUNC.\r\n    |    ldr KBASE, [PC, #-4+PC2PROTO(k)]\r\n    |  cmp RA, CARG1\r\n    |   str TMP0, [TMP2], #8\t\t// Store delta + FRAME_VARG.\r\n    |  bhs ->vm_growstack_l\r\n    |   sub RC, TMP2, #16\r\n    |  ldrb TMP1w, [PC, #-4+PC2PROTO(numparams)]\r\n    |   mov RA, BASE\r\n    |   mov BASE, TMP2\r\n    |  cbz TMP1, >2\r\n    |1:\r\n    |  cmp RA, RC\t\t\t// Less args than parameters?\r\n    |  bhs >3\r\n    |   ldr TMP0, [RA]\r\n    |  sub TMP1, TMP1, #1\r\n    |    str TISNIL, [RA], #8\t\t// Clear old fixarg slot (help the GC).\r\n    |   str TMP0, [TMP2], #8\r\n    |  cbnz TMP1, <1\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:\r\n    |  sub TMP1, TMP1, #1\r\n    |   str TISNIL, [TMP2], #8\r\n    |  cbz TMP1, <2\r\n    |  b <3\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, CARG3 = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  ldr CARG4, CFUNC:CARG3->f\r\n    } else {\r\n      |  ldr CARG4, GL->wrapf\r\n    }\r\n    |   add CARG2, RA, NARGS8:RC\r\n    |   ldr CARG1, L->maxstack\r\n    |  add RC, BASE, NARGS8:RC\r\n    |   cmp CARG2, CARG1\r\n    |  stp BASE, RC, L->base\r\n    if (op == BC_FUNCCW) {\r\n      |  ldr CARG2, CFUNC:CARG3->f\r\n    }\r\n    |    mv_vmstate TMP0w, C\r\n    |  mov CARG1, L\r\n    |   bhi ->vm_growstack_c\t\t// Need to grow stack.\r\n    |    st_vmstate TMP0w\r\n    |  blr CARG4\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  ldp BASE, TMP1, L->base\r\n    |    str L, GL->cur_L\r\n    |   sbfiz RC, CRET1, #3, #32\r\n    |    st_vmstate ST_INTERP\r\n    |  ldr PC, [BASE, FRAME_PC]\r\n    |   sub RA, TMP1, RC\t\t// RA = L->top - nresults*8\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i, cf = CFRAME_SIZE >> 3;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",%%progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 30\\n\"\t\t\t\t/* Return address is in lr. */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 31\\n\\t.uleb128 0\\n\"\t/* def_cfa sp */\r\n\t\"\\t.align 3\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.quad .Lbegin\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x9d\\n\\t.uleb128 %d\\n\"\t\t/* offset fp */\r\n\t\"\\t.byte 0x9e\\n\\t.uleb128 %d\\n\",\t/* offset lr */\r\n\tfcofs, CFRAME_SIZE, cf, cf-1);\r\n    for (i = 19; i <= 28; i++)  /* offset x19-x28 */\r\n      fprintf(ctx->fp, \"\\t.byte 0x%x\\n\\t.uleb128 %d\\n\", 0x80+i, cf-i+17);\r\n    for (i = 8; i <= 15; i++)  /* offset d8-d15 */\r\n      fprintf(ctx->fp, \"\\t.byte 5\\n\\t.uleb128 0x%x\\n\\t.uleb128 %d\\n\",\r\n\t      64+i, cf-i-4);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 3\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.quad lj_vm_ffi_call\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 32\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x9d\\n\\t.uleb128 4\\n\"\t\t/* offset fp */\r\n\t\"\\t.byte 0x9e\\n\\t.uleb128 3\\n\"\t\t/* offset lr */\r\n\t\"\\t.byte 0x93\\n\\t.uleb128 2\\n\"\t\t/* offset x19 */\r\n\t\"\\t.align 3\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",%%progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 30\\n\"\t\t\t\t/* Return address is in lr. */\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 31\\n\\t.uleb128 0\\n\"\t/* def_cfa sp */\r\n\t\"\\t.align 3\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x9d\\n\\t.uleb128 %d\\n\"\t\t/* offset fp */\r\n\t\"\\t.byte 0x9e\\n\\t.uleb128 %d\\n\",\t/* offset lr */\r\n\tfcofs, CFRAME_SIZE, cf, cf-1);\r\n    for (i = 19; i <= 28; i++)  /* offset x19-x28 */\r\n      fprintf(ctx->fp, \"\\t.byte 0x%x\\n\\t.uleb128 %d\\n\", 0x80+i, cf-i+17);\r\n    for (i = 8; i <= 15; i++)  /* offset d8-d15 */\r\n      fprintf(ctx->fp, \"\\t.byte 5\\n\\t.uleb128 0x%x\\n\\t.uleb128 %d\\n\",\r\n\t      64+i, cf-i-4);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 3\\n\"\r\n\t\".LEFDE2:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 30\\n\"\t\t\t\t/* Return address is in lr. */\r\n\t\"\\t.uleb128 1\\n\"                        /* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"                        /* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 31\\n\\t.uleb128 0\\n\"\t/* def_cfa sp */\r\n\t\"\\t.align 3\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"                        /* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 32\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x9d\\n\\t.uleb128 4\\n\"\t\t/* offset fp */\r\n\t\"\\t.byte 0x9e\\n\\t.uleb128 3\\n\"\t\t/* offset lr */\r\n\t\"\\t.byte 0x93\\n\\t.uleb128 2\\n\"\t\t/* offset x19 */\r\n\t\"\\t.align 3\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_mips.dasc",
    "content": "|// Low-level VM code for MIPS CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch mips\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// Don't use: r0 = 0, r26/r27 = reserved, r28 = gp, r29 = sp, r31 = ra\r\n|\r\n|// The following must be C callee-save (but BASE is often refetched).\r\n|.define BASE,\t\tr16\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tr17\t// Constants of current Lua function.\r\n|.define PC,\t\tr18\t// Next PC.\r\n|.define DISPATCH,\tr19\t// Opcode dispatch table.\r\n|.define LREG,\t\tr20\t// Register holding lua_State (also in SAVE_L).\r\n|.define MULTRES,\tr21\t// Size of multi-result: (nresults+1)*8.\r\n|// NYI: r22 currently unused.\r\n|\r\n|.define JGL,\t\tr30\t// On-trace: global_State + 32768.\r\n|\r\n|// Constants for type-comparisons, stores and conversions. C callee-save.\r\n|.define TISNIL,\tr30\r\n|.define TOBIT,\t\tf30\t// 2^52 + 2^51.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA.\r\n|.define RA,\t\tr23\t// Callee-save.\r\n|.define RB,\t\tr8\r\n|.define RC,\t\tr9\r\n|.define RD,\t\tr10\r\n|.define INS,\t\tr11\r\n|\r\n|.define AT,\t\tr1\t// Assembler temporary.\r\n|.define TMP0,\t\tr12\r\n|.define TMP1,\t\tr13\r\n|.define TMP2,\t\tr14\r\n|.define TMP3,\t\tr15\r\n|\r\n|// Calling conventions.\r\n|.define CFUNCADDR,\tr25\r\n|.define CARG1,\t\tr4\r\n|.define CARG2,\t\tr5\r\n|.define CARG3,\t\tr6\r\n|.define CARG4,\t\tr7\r\n|\r\n|.define CRET1,\t\tr2\r\n|.define CRET2,\t\tr3\r\n|\r\n|.define FARG1,\t\tf12\r\n|.define FARG2,\t\tf14\r\n|\r\n|.define FRET1,\t\tf0\r\n|.define FRET2,\t\tf2\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.define CFRAME_SPACE,\t112\t// Delta for sp.\r\n|\r\n|.define SAVE_ERRF,\t124(sp)\t// 32 bit C frame info.\r\n|.define SAVE_NRES,\t120(sp)\r\n|.define SAVE_CFRAME,\t116(sp)\r\n|.define SAVE_L,\t112(sp)\r\n|//----- 8 byte aligned, ^^^^ 16 byte register save area, owned by interpreter.\r\n|.define SAVE_GPR_,\t72\t// .. 72+10*4: 32 bit GPR saves.\r\n|.define SAVE_FPR_,\t24\t// .. 24+6*8: 64 bit FPR saves.\r\n|.define SAVE_PC,\t20(sp)\r\n|.define ARG5,\t\t16(sp)\r\n|.define CSAVE_4,\t12(sp)\r\n|.define CSAVE_3,\t8(sp)\r\n|.define CSAVE_2,\t4(sp)\r\n|.define CSAVE_1,\t0(sp)\r\n|//----- 8 byte aligned, ^^^^ 16 byte register save area, owned by callee.\r\n|\r\n|.define ARG5_OFS,\t16\r\n|.define SAVE_MULTRES,\tARG5\r\n|\r\n|.macro saveregs\r\n|  addiu sp, sp, -CFRAME_SPACE\r\n|  sw ra, SAVE_GPR_+9*4(sp)\r\n|  sw r30, SAVE_GPR_+8*4(sp)\r\n|   sdc1 f30, SAVE_FPR_+5*8(sp)\r\n|  sw r23, SAVE_GPR_+7*4(sp)\r\n|  sw r22, SAVE_GPR_+6*4(sp)\r\n|   sdc1 f28, SAVE_FPR_+4*8(sp)\r\n|  sw r21, SAVE_GPR_+5*4(sp)\r\n|  sw r20, SAVE_GPR_+4*4(sp)\r\n|   sdc1 f26, SAVE_FPR_+3*8(sp)\r\n|  sw r19, SAVE_GPR_+3*4(sp)\r\n|  sw r18, SAVE_GPR_+2*4(sp)\r\n|   sdc1 f24, SAVE_FPR_+2*8(sp)\r\n|  sw r17, SAVE_GPR_+1*4(sp)\r\n|  sw r16, SAVE_GPR_+0*4(sp)\r\n|   sdc1 f22, SAVE_FPR_+1*8(sp)\r\n|   sdc1 f20, SAVE_FPR_+0*8(sp)\r\n|.endmacro\r\n|\r\n|.macro restoreregs_ret\r\n|  lw ra, SAVE_GPR_+9*4(sp)\r\n|  lw r30, SAVE_GPR_+8*4(sp)\r\n|   ldc1 f30, SAVE_FPR_+5*8(sp)\r\n|  lw r23, SAVE_GPR_+7*4(sp)\r\n|  lw r22, SAVE_GPR_+6*4(sp)\r\n|   ldc1 f28, SAVE_FPR_+4*8(sp)\r\n|  lw r21, SAVE_GPR_+5*4(sp)\r\n|  lw r20, SAVE_GPR_+4*4(sp)\r\n|   ldc1 f26, SAVE_FPR_+3*8(sp)\r\n|  lw r19, SAVE_GPR_+3*4(sp)\r\n|  lw r18, SAVE_GPR_+2*4(sp)\r\n|   ldc1 f24, SAVE_FPR_+2*8(sp)\r\n|  lw r17, SAVE_GPR_+1*4(sp)\r\n|  lw r16, SAVE_GPR_+0*4(sp)\r\n|   ldc1 f22, SAVE_FPR_+1*8(sp)\r\n|   ldc1 f20, SAVE_FPR_+0*8(sp)\r\n|  jr ra\r\n|  addiu sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; .long 0xf0f0f0f0; .endmacro\r\n|\r\n|// Macros to mark delay slots.\r\n|.macro ., a; a; .endmacro\r\n|.macro ., a,b; a,b; .endmacro\r\n|.macro ., a,b,c; a,b,c; .endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Endian-specific defines.\r\n|.define FRAME_PC,\tLJ_ENDIAN_SELECT(-4,-8)\r\n|.define FRAME_FUNC,\tLJ_ENDIAN_SELECT(-8,-4)\r\n|.define HI,\t\tLJ_ENDIAN_SELECT(4,0)\r\n|.define LO,\t\tLJ_ENDIAN_SELECT(0,4)\r\n|.define OFS_RD,\tLJ_ENDIAN_SELECT(2,0)\r\n|.define OFS_RA,\tLJ_ENDIAN_SELECT(1,2)\r\n|.define OFS_OP,\tLJ_ENDIAN_SELECT(0,3)\r\n|\r\n|// Instruction decode.\r\n|.macro decode_OP1, dst, ins; andi dst, ins, 0xff; .endmacro\r\n|.macro decode_OP4a, dst, ins; andi dst, ins, 0xff; .endmacro\r\n|.macro decode_OP4b, dst; sll dst, dst, 2; .endmacro\r\n|.macro decode_RC4a, dst, ins; srl dst, ins, 14; .endmacro\r\n|.macro decode_RC4b, dst; andi dst, dst, 0x3fc; .endmacro\r\n|.macro decode_RD4b, dst; sll dst, dst, 2; .endmacro\r\n|.macro decode_RA8a, dst, ins; srl dst, ins, 5; .endmacro\r\n|.macro decode_RA8b, dst; andi dst, dst, 0x7f8; .endmacro\r\n|.macro decode_RB8a, dst, ins; srl dst, ins, 21; .endmacro\r\n|.macro decode_RB8b, dst; andi dst, dst, 0x7f8; .endmacro\r\n|.macro decode_RD8a, dst, ins; srl dst, ins, 16; .endmacro\r\n|.macro decode_RD8b, dst; sll dst, dst, 3; .endmacro\r\n|.macro decode_RDtoRC8, dst, src; andi dst, src, 0x7f8; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  lw INS, 0(PC)\r\n|   addiu PC, PC, 4\r\n|.endmacro\r\n|// Instruction decode+dispatch.\r\n|.macro ins_NEXT2\r\n|  decode_OP4a TMP1, INS\r\n|  decode_OP4b TMP1\r\n|  addu TMP0, DISPATCH, TMP1\r\n|   decode_RD8a RD, INS\r\n|  lw AT, 0(TMP0)\r\n|   decode_RA8a RA, INS\r\n|   decode_RD8b RD\r\n|  jr AT\r\n|   decode_RA8b RA\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  lw PC, LFUNC:RB->pc\r\n|  lw INS, 0(PC)\r\n|   addiu PC, PC, 4\r\n|  decode_OP4a TMP1, INS\r\n|   decode_RA8a RA, INS\r\n|  decode_OP4b TMP1\r\n|   decode_RA8b RA\r\n|  addu TMP0, DISPATCH, TMP1\r\n|  lw TMP0, 0(TMP0)\r\n|  jr TMP0\r\n|   addu RA, RA, BASE\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  sw PC, FRAME_PC(BASE)\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|.macro branch_RD\r\n|  srl TMP0, RD, 1\r\n|  lui AT, (-(BCBIAS_J*4 >> 16) & 65535)\r\n|  addu TMP0, TMP0, AT\r\n|  addu PC, PC, TMP0\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n#define GG_DISP2GOT\t\t(GG_OFS(got) - GG_OFS(dispatch))\r\n#define DISPATCH_GOT(name)\t(GG_DISP2GOT + 4*LJ_GOT_##name)\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro load_got, func\r\n|  lw CFUNCADDR, DISPATCH_GOT(func)(DISPATCH)\r\n|.endmacro\r\n|// Much faster. Sadly, there's no easy way to force the required code layout.\r\n|// .macro call_intern, func; bal extern func; .endmacro\r\n|.macro call_intern, func; jalr CFUNCADDR; .endmacro\r\n|.macro call_extern; jalr CFUNCADDR; .endmacro\r\n|.macro jmp_extern; jr CFUNCADDR; .endmacro\r\n|\r\n|.macro hotcheck, delta, target\r\n|  srl TMP1, PC, 1\r\n|  andi TMP1, TMP1, 126\r\n|  addu TMP1, TMP1, DISPATCH\r\n|  lhu TMP2, GG_DISP2HOT(TMP1)\r\n|  addiu TMP2, TMP2, -delta\r\n|  bltz TMP2, target\r\n|.  sh TMP2, GG_DISP2HOT(TMP1)\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP, ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL, ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state. Uses TMP0.\r\n|.macro li_vmstate, st; li TMP0, ~LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate; sw TMP0, DISPATCH_GL(vmstate)(DISPATCH); .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp, target\r\n|  lw tmp, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   andi mark, mark, ~LJ_GC_BLACK & 255\t\t// black2gray(tab)\r\n|  sw tab, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   sb mark, tab->marked\r\n|  b target\r\n|.  sw tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: TMP2 = previous base.\r\n  |  andi AT, PC, FRAME_P\r\n  |  beqz AT, ->cont_dispatch\r\n  |.  li TMP1, LJ_TTRUE\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  lw PC, FRAME_PC(TMP2)\t\t// Fetch PC of previous frame.\r\n  |  move BASE, TMP2\t\t\t// Restore caller base.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   sw TMP1, FRAME_PC(RA)\t\t// Prepend true to results.\r\n  |   addiu RA, RA, -8\r\n  |\r\n  |->vm_returnc:\r\n  |   addiu RD, RD, 8\t\t\t// RD = (nresults+1)*8.\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |   beqz RD, ->vm_unwind_c_eh\r\n  |.   li CRET1, LUA_YIELD\r\n  |  beqz TMP0, ->BC_RET_Z\t\t// Handle regular return to Lua.\r\n  |.  move MULTRES, RD\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RD/MULTRES = (nresults+1)*8, PC = return\r\n  |  // TMP0 = PC & FRAME_TYPE\r\n  |   li TMP2, -8\r\n  |  xori AT, TMP0, FRAME_C\r\n  |   and TMP2, PC, TMP2\r\n  |  bnez AT, ->vm_returnp\r\n  |   subu TMP2, BASE, TMP2\t\t// TMP2 = previous base.\r\n  |\r\n  |  addiu TMP1, RD, -8\r\n  |   sw TMP2, L->base\r\n  |    li_vmstate C\r\n  |   lw TMP2, SAVE_NRES\r\n  |   addiu BASE, BASE, -8\r\n  |    st_vmstate\r\n  |  beqz TMP1, >2\r\n  |.   sll TMP2, TMP2, 3\r\n  |1:\r\n  |  addiu TMP1, TMP1, -8\r\n  |   ldc1 f0, 0(RA)\r\n  |    addiu RA, RA, 8\r\n  |   sdc1 f0, 0(BASE)\r\n  |  bnez TMP1, <1\r\n  |.  addiu BASE, BASE, 8\r\n  |\r\n  |2:\r\n  |  bne TMP2, RD, >6\r\n  |3:\r\n  |.  sw BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  lw TMP0, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   move CRET1, r0\t\t\t// Ok return status for vm_pcall.\r\n  |  sw TMP0, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs_ret\r\n  |\r\n  |6:\r\n  |  lw TMP1, L->maxstack\r\n  |  slt AT, TMP2, RD\r\n  |  bnez AT, >7\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |.  slt AT, BASE, TMP1\r\n  |  beqz AT, >8\r\n  |.  nop\r\n  |  sw TISNIL, HI(BASE)\r\n  |  addiu RD, RD, 8\r\n  |  b <2\r\n  |.  addiu BASE, BASE, 8\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  subu TMP0, RD, TMP2\r\n  |  subu TMP0, BASE, TMP0\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |.  movn BASE, TMP0, TMP2\t\t// LUA_MULTRET+1 case?\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  load_got lj_state_growstack\r\n  |   move MULTRES, RD\r\n  |  srl CARG2, TMP2, 3\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |    lw TMP2, SAVE_NRES\r\n  |  lw BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |   move RD, MULTRES\r\n  |  b <2\r\n  |.   sll TMP2, TMP2, 3\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  move sp, CARG1\r\n  |  move CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lw L, SAVE_L\r\n  |   li TMP0, ~LJ_VMST_C\r\n  |  lw GL:TMP1, L->glref\r\n  |  b ->vm_leave_unw\r\n  |.  sw TMP0, GL:TMP1->vmstate\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  li AT, -4\r\n  |  and sp, CARG1, AT\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lw L, SAVE_L\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |     li TISNIL, LJ_TNIL\r\n  |  lw BASE, L->base\r\n  |   lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     mtc1 TMP3, TOBIT\r\n  |  li TMP1, LJ_TFALSE\r\n  |    li_vmstate INTERP\r\n  |  lw PC, FRAME_PC(BASE)\t\t// Fetch PC of previous frame.\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |  addiu RA, BASE, -8\t\t\t// Results start at BASE-8.\r\n  |   addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |  sw TMP1, HI(RA)\t\t\t// Prepend false to error message.\r\n  |    st_vmstate\r\n  |  b ->vm_returnc\r\n  |.  li RD, 16\t\t\t\t// 2 results: false + error message.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  b >2\r\n  |.  li CARG2, LUA_MINSTACK\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  addu RC, BASE, RC\r\n  |   subu RA, RA, BASE\r\n  |  sw BASE, L->base\r\n  |   addiu PC, PC, 4\t\t\t// Must point after first instruction.\r\n  |  sw RC, L->top\r\n  |   srl CARG2, RA, 3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |  load_got lj_state_growstack\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  lw BASE, L->base\r\n  |  lw RC, L->top\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  subu RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  move L, CARG1\r\n  |    lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  move BASE, CARG2\r\n  |    lbu TMP1, L->status\r\n  |   sw L, SAVE_L\r\n  |  li PC, FRAME_CP\r\n  |  addiu TMP0, sp, CFRAME_RESUME\r\n  |    addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |   sw r0, SAVE_NRES\r\n  |   sw r0, SAVE_ERRF\r\n  |   sw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |   sw r0, SAVE_CFRAME\r\n  |    beqz TMP1, >3\r\n  |. sw TMP0, L->cframe\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  sw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  move RA, BASE\r\n  |   lw BASE, L->base\r\n  |   lw TMP1, L->top\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   subu RD, TMP1, BASE\r\n  |     mtc1 TMP3, TOBIT\r\n  |    sb r0, L->status\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |    li_vmstate INTERP\r\n  |   addiu RD, RD, 8\r\n  |    st_vmstate\r\n  |   move MULTRES, RD\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |  beqz TMP0, ->BC_RET_Z\r\n  |.    li TISNIL, LJ_TNIL\r\n  |  b ->vm_return\r\n  |.  nop\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  sw CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |.  li PC, FRAME_CP\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  li PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  lw TMP1, L:CARG1->cframe\r\n  |    move L, CARG1\r\n  |   sw CARG3, SAVE_NRES\r\n  |    lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   sw CARG1, SAVE_L\r\n  |     move BASE, CARG2\r\n  |    addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |   sw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  sw TMP1, SAVE_CFRAME\r\n  |  sw sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  sw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  lw TMP2, L->base\t\t\t// TMP2 = old base (used in vmeta_call).\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   lw TMP1, L->top\r\n  |     mtc1 TMP3, TOBIT\r\n  |  addu PC, PC, BASE\r\n  |   subu NARGS8:RC, TMP1, BASE\r\n  |  subu PC, PC, TMP2\t\t\t// PC = frame delta + frame type\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |    li_vmstate INTERP\r\n  |     li TISNIL, LJ_TNIL\r\n  |    st_vmstate\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  lw TMP0, FRAME_PC(BASE)\r\n  |  li AT, LJ_TFUNC\r\n  |  bne TMP0, AT, ->vmeta_call\r\n  |.  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  move L, CARG1\r\n  |   lw TMP0, L:CARG1->stack\r\n  |  sw CARG1, SAVE_L\r\n  |   lw TMP1, L->top\r\n  |     lw DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  sw CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   subu TMP0, TMP0, TMP1\t\t// Compute -savestack(L, L->top).\r\n  |    lw TMP1, L->cframe\r\n  |     addiu DISPATCH, DISPATCH, GG_G2DISP\r\n  |   sw TMP0, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  sw r0, SAVE_ERRF\t\t\t// No error function.\r\n  |    sw TMP1, SAVE_CFRAME\r\n  |    sw sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |     sw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  jalr CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.  move CFUNCADDR, CARG4\r\n  |  move BASE, CRET1\r\n  |  bnez CRET1, <3\t\t\t// Else continue with the call.\r\n  |.  li PC, FRAME_CP\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |.  nop\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// The lj_meta_* functions (except for lj_meta_cat) don't reallocate the\r\n  |// stack, so BASE doesn't need to be reloaded across these calls.\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RD = (nresults+1)*8\r\n  |  lw TMP0, -16+LO(BASE)\t\t// Continuation.\r\n  |   move RB, BASE\r\n  |   move BASE, TMP2\t\t\t// Restore caller BASE.\r\n  |    lw LFUNC:TMP1, FRAME_FUNC(TMP2)\r\n  |.if FFI\r\n  |  sltiu AT, TMP0, 2\r\n  |.endif\r\n  |     lw PC, -16+HI(RB)\t\t// Restore PC from [cont|PC].\r\n  |   addu TMP2, RA, RD\r\n  |    lw TMP1, LFUNC:TMP1->pc\r\n  |.if FFI\r\n  |  bnez AT, >1\r\n  |.endif\r\n  |.  sw TISNIL, -8+HI(TMP2)\t\t// Ensure one valid arg.\r\n  |  // BASE = base, RA = resultptr, RB = meta base\r\n  |  jr TMP0\t\t\t\t// Jump to continuation.\r\n  |.  lw KBASE, PC2PROTO(k)(TMP1)\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  bnez TMP0, ->cont_ffi_callback\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |.  addiu TMP1, RB, -16\r\n  |  b ->vm_call_tail\r\n  |.  subu RC, TMP1, BASE\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, RB = meta base\r\n  |  lw INS, -4(PC)\r\n  |   addiu CARG2, RB, -16\r\n  |   ldc1 f0, 0(RA)\r\n  |  decode_RB8a MULTRES, INS\r\n  |   decode_RA8a RA, INS\r\n  |  decode_RB8b MULTRES\r\n  |   decode_RA8b RA\r\n  |  addu TMP1, BASE, MULTRES\r\n  |   sw BASE, L->base\r\n  |   subu CARG3, CARG2, TMP1\r\n  |  bne TMP1, CARG2, ->BC_CAT_Z\r\n  |.  sdc1 f0, 0(CARG2)\r\n  |  addu RA, BASE, RA\r\n  |  b ->cont_nop\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TSTR\r\n  |  sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP0, HI(CARG3)\r\n  |\r\n  |->vmeta_tgets:\r\n  |  addiu CARG2, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TTAB\r\n  |  sw TAB:RB, LO(CARG2)\r\n  |   addiu CARG3, DISPATCH, DISPATCH_GL(tmptv2)\r\n  |  sw TMP0, HI(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP1, HI(CARG3)\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// TMP0 = index\r\n  |  mtc1 TMP0, f0\r\n  |  cvt.d.w f0, f0\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  sdc1 f0, 0(CARG3)\r\n  |\r\n  |->vmeta_tgetv:\r\n  |1:\r\n  |  load_got lj_meta_tget\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |.  move CARG1, L\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  beqz CRET1, >3\r\n  |.  addiu TMP1, BASE, -FRAME_CONT\r\n  |  ldc1 f0, 0(CRET1)\r\n  |  ins_next1\r\n  |   sdc1 f0, 0(RA)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  lw BASE, L->top\r\n  |  sw PC, -16+HI(BASE)\t\t// [cont|PC]\r\n  |   subu PC, BASE, TMP1\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |  b ->vm_call_dispatch_f\r\n  |.  li NARGS8:RC, 16\t\t\t// 2 args for func(t, k).\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  load_got lj_tab_getinth\r\n  |  call_intern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |.  nop\r\n  |  // Returns cTValue * or NULL.\r\n  |  beqz CRET1, >1\r\n  |.  nop\r\n  |  b ->BC_TGETR_Z\r\n  |.  ldc1 f0, 0(CRET1)\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TSTR\r\n  |  sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP0, HI(CARG3)\r\n  |\r\n  |->vmeta_tsets:\r\n  |  addiu CARG2, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  li TMP0, LJ_TTAB\r\n  |  sw TAB:RB, LO(CARG2)\r\n  |   addiu CARG3, DISPATCH, DISPATCH_GL(tmptv2)\r\n  |  sw TMP0, HI(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   sw STR:RC, LO(CARG3)\r\n  |  b >1\r\n  |.  sw TMP1, HI(CARG3)\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// TMP0 = index\r\n  |  mtc1 TMP0, f0\r\n  |  cvt.d.w f0, f0\r\n  |  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |  sdc1 f0, 0(CARG3)\r\n  |\r\n  |->vmeta_tsetv:\r\n  |1:\r\n  |  load_got lj_meta_tset\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |.  move CARG1, L\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  beqz CRET1, >3\r\n  |.  ldc1 f0, 0(RA)\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  ins_next1\r\n  |   sdc1 f0, 0(CRET1)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  addiu TMP1, BASE, -FRAME_CONT\r\n  |  lw BASE, L->top\r\n  |  sw PC, -16+HI(BASE)\t\t// [cont|PC]\r\n  |   subu PC, BASE, TMP1\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |  sdc1 f0, 16(BASE)\t\t\t// Copy value to third argument.\r\n  |  b ->vm_call_dispatch_f\r\n  |.  li NARGS8:RC, 24\t\t\t// 3 args for func(t, k, v)\r\n  |\r\n  |->vmeta_tsetr:\r\n  |  load_got lj_tab_setinth\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |.  move CARG1, L\r\n  |  // Returns TValue *.\r\n  |  b ->BC_TSETR_Z\r\n  |.  nop\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  // CARG2, CARG3 are already set by BC_ISLT/BC_ISGE/BC_ISLE/BC_ISGT.\r\n  |  load_got lj_meta_comp\r\n  |  addiu PC, PC, -4\r\n  |  sw BASE, L->base\r\n  |  sw PC, SAVE_PC\r\n  |  decode_OP1 CARG4, INS\r\n  |  call_intern lj_meta_comp\t// (lua_State *L, TValue *o1, *o2, int op)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  sltiu AT, CRET1, 2\r\n  |  beqz AT, ->vmeta_binop\r\n  |   negu TMP2, CRET1\r\n  |4:\r\n  |  lhu RD, OFS_RD(PC)\r\n  |   addiu PC, PC, 4\r\n  |   lui TMP1, (-(BCBIAS_J*4 >> 16) & 65535)\r\n  |  sll RD, RD, 2\r\n  |  addu RD, RD, TMP1\r\n  |  and RD, RD, TMP2\r\n  |  addu PC, PC, RD\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  lbu TMP1, -4+OFS_RA(PC)\r\n  |   ldc1 f0, 0(RA)\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, BASE, TMP1\r\n  |  b ->cont_nop\r\n  |.  sdc1 f0, 0(TMP1)\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  lw TMP0, HI(RA)\r\n  |  sltiu AT, TMP0, LJ_TISTRUECOND\r\n  |  b <4\r\n  |.  negu TMP2, AT\t\t\t// Branch if result is true.\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  lw TMP0, HI(RA)\r\n  |  sltiu AT, TMP0, LJ_TISTRUECOND\r\n  |  b <4\r\n  |.  addiu TMP2, AT, -1\t\t// Branch if result is false.\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  load_got lj_meta_equal\r\n  |  addiu PC, PC, -4\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.  nop\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  load_got lj_meta_equal_cd\r\n  |  move CARG2, INS\r\n  |  addiu PC, PC, -4\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_equal_cd\t// (lua_State *L, BCIns op)\r\n  |.  move CARG1, L\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.  nop\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |  load_got lj_meta_istype\r\n  |  addiu PC, PC, -4\r\n  |   sw BASE, L->base\r\n  |   srl CARG2, RA, 3\r\n  |   srl CARG3, RD, 3\r\n  |  sw PC, SAVE_PC\r\n  |  call_intern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |.  move CARG1, L\r\n  |  b ->cont_nop\r\n  |.  nop\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_unm:\r\n  |  move CARG4, CARG3\r\n  |\r\n  |->vmeta_arith:\r\n  |  load_got lj_meta_arith\r\n  |  decode_OP1 TMP0, INS\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  move CARG2, RA\r\n  |  sw TMP0, ARG5\r\n  |  call_intern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |.  move CARG1, L\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  beqz CRET1, ->cont_nop\r\n  |.  nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  subu TMP1, CRET1, BASE\r\n  |   sw PC, -16+HI(CRET1)\t\t// [cont|PC]\r\n  |   move TMP2, BASE\r\n  |  addiu PC, TMP1, FRAME_CONT\r\n  |   move BASE, CRET1\r\n  |  b ->vm_call_dispatch\r\n  |.  li NARGS8:RC, 16\t\t\t// 2 args for func(o1, o2).\r\n  |\r\n  |->vmeta_len:\r\n  |  // CARG2 already set by BC_LEN.\r\n#if LJ_52\r\n  |  move MULTRES, CARG1\r\n#endif\r\n  |  load_got lj_meta_len\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |.  move CARG1, L\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  bnez CRET1, ->vmeta_binop\t\t// Binop call for compatibility.\r\n  |.  nop\r\n  |  b ->BC_LEN_Z\r\n  |.  move CARG1, MULTRES\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |.  nop\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8\r\n  |  load_got lj_meta_call\r\n  |   sw TMP2, L->base\t\t\t// This is the callers base!\r\n  |  addiu CARG2, BASE, -8\r\n  |   sw PC, SAVE_PC\r\n  |  addu CARG3, BASE, RC\r\n  |   move MULTRES, NARGS8:RC\r\n  |  call_intern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |.  move CARG1, L\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   addiu NARGS8:RC, MULTRES, 8\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  load_got lj_meta_call\r\n  |   sw BASE, L->base\r\n  |  addiu CARG2, RA, -8\r\n  |   sw PC, SAVE_PC\r\n  |  addu CARG3, RA, RC\r\n  |   move MULTRES, NARGS8:RC\r\n  |  call_intern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |.  move CARG1, L\r\n  |  lw TMP1, FRAME_PC(BASE)\r\n  |   lw LFUNC:RB, FRAME_FUNC(RA)\t// Guaranteed to be a function here.\r\n  |  b ->BC_CALLT_Z\r\n  |.  addiu NARGS8:RC, MULTRES, 8\t// Got one more argument now.\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  load_got lj_meta_for\r\n  |   sw BASE, L->base\r\n  |  move CARG2, RA\r\n  |   sw PC, SAVE_PC\r\n  |  move MULTRES, INS\r\n  |  call_intern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |.  move CARG1, L\r\n  |.if JIT\r\n  |  decode_OP1 TMP0, MULTRES\r\n  |  li AT, BC_JFORI\r\n  |.endif\r\n  |  decode_RA8a RA, MULTRES\r\n  |   decode_RD8a RD, MULTRES\r\n  |  decode_RA8b RA\r\n  |.if JIT\r\n  |  beq TMP0, AT, =>BC_JFORI\r\n  |.  decode_RD8b RD\r\n  |  b =>BC_FORI\r\n  |.  nop\r\n  |.else\r\n  |  b =>BC_FORI\r\n  |.  decode_RD8b RD\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  lw CARG3, HI(BASE)\r\n  |    lw CARG1, LO(BASE)\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.   lw CARG4, 8+HI(BASE)\r\n  |   lw CARG1, LO(BASE)\r\n  |    lw CARG2, 8+LO(BASE)\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\t// Caveat: has delay slot!\r\n  |->ff_ .. name:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\t// Caveat: has delay slot!\r\n  |->ff_ .. name:\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.  lw CARG4, 8+HI(BASE)\r\n  |  ldc1 FARG1, 0(BASE)\r\n  |  ldc1 FARG2, 8(BASE)\r\n  |  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  sltiu TMP1, CARG4, LJ_TISNUM\r\n  |  and TMP0, TMP0, TMP1\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses TMP0 and TMP1 and has delay slot!\r\n  |.macro ffgccheck\r\n  |  lw TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n  |  lw TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n  |  subu AT, TMP0, TMP1\r\n  |  bgezal AT, ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  sltiu AT, CARG3, LJ_TISTRUECOND\r\n  |  beqz AT, ->fff_fallback\r\n  |.  addiu RA, BASE, -8\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  addiu RD, NARGS8:RC, 8\t\t// Compute (nresults+1)*8.\r\n  |  addu TMP2, RA, NARGS8:RC\r\n  |   sw CARG3, HI(RA)\r\n  |  addiu TMP1, BASE, 8\r\n  |  beq BASE, TMP2, ->fff_res\t\t// Done if exactly 1 argument.\r\n  |.  sw CARG1, LO(RA)\r\n  |1:\r\n  |  ldc1 f0, 0(TMP1)\r\n  |  sdc1 f0, -8(TMP1)\r\n  |  bne TMP1, TMP2, <1\r\n  |.  addiu TMP1, TMP1, 8\r\n  |  b ->fff_res\r\n  |.  nop\r\n  |\r\n  |.ffunc type\r\n  |  lw CARG3, HI(BASE)\r\n  |  li TMP1, LJ_TISNUM\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  movz TMP1, CARG3, TMP0\r\n  |  not TMP1, TMP1\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, CFUNC:RB, TMP1\r\n  |  b ->fff_resn\r\n  |.  ldc1 FRET1, CFUNC:TMP1->upvalue\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, >6\r\n  |.  li AT, LJ_TUDATA\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  lw TAB:CARG1, TAB:CARG1->metatable\r\n  |2:\r\n  |  lw STR:RC, DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])(DISPATCH)\r\n  |  beqz TAB:CARG1, ->fff_restv\r\n  |.  li CARG3, LJ_TNIL\r\n  |  lw TMP0, TAB:CARG1->hmask\r\n  |   li CARG3, LJ_TTAB\t\t\t// Use metatable as default result.\r\n  |  lw TMP1, STR:RC->hash\r\n  |  lw NODE:TMP2, TAB:CARG1->node\r\n  |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n  |  sll TMP0, TMP1, 5\r\n  |  sll TMP1, TMP1, 3\r\n  |  subu TMP1, TMP0, TMP1\r\n  |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n  |  li AT, LJ_TSTR\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  lw CARG4, offsetof(Node, key)+HI(NODE:TMP2)\r\n  |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n  |    lw NODE:TMP3, NODE:TMP2->next\r\n  |  bne CARG4, AT, >4\r\n  |.    lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n  |  beq TMP0, STR:RC, >5\r\n  |.    lw TMP1, offsetof(Node, val)+LO(NODE:TMP2)\r\n  |4:\r\n  |  beqz NODE:TMP3, ->fff_restv\t// Not found, keep default result.\r\n  |.  move NODE:TMP2, NODE:TMP3\r\n  |  b <3\r\n  |.  nop\r\n  |5:\r\n  |  beq CARG2, TISNIL, ->fff_restv\t// Ditto for nil value.\r\n  |.  nop\r\n  |  move CARG3, CARG2\t\t\t// Return value of mt.__metatable.\r\n  |  b ->fff_restv\r\n  |.  move CARG1, TMP1\r\n  |\r\n  |6:\r\n  |  beq CARG3, AT, <1\r\n  |.  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  li TMP1, LJ_TISNUM\r\n  |  movz TMP1, CARG3, TMP0\r\n  |  not TMP1, TMP1\r\n  |  sll TMP1, TMP1, 2\r\n  |  addu TMP1, DISPATCH, TMP1\r\n  |  b <2\r\n  |.  lw TAB:CARG1, DISPATCH_GL(gcroot[GCROOT_BASEMT])(TMP1)\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  addiu CARG4, CARG4, -LJ_TTAB\r\n  |  lw TAB:TMP1, TAB:CARG1->metatable\r\n  |   lbu TMP3, TAB:CARG1->marked\r\n  |  or AT, CARG4, TAB:TMP1\r\n  |  bnez AT, ->fff_fallback\r\n  |.  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n  |  beqz AT, ->fff_restv\r\n  |.  sw TAB:CARG2, TAB:CARG1->metatable\r\n  |  barrierback TAB:CARG1, TMP3, TMP0, ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  lw CARG4, HI(BASE)\r\n  |   sltiu AT, NARGS8:RC, 16\r\n  |    lw TAB:CARG2, LO(BASE)\r\n  |  load_got lj_tab_get\r\n  |  addiu CARG4, CARG4, -LJ_TTAB\r\n  |  or AT, AT, CARG4\r\n  |  bnez AT, ->fff_fallback\r\n  |   addiu CARG3, BASE, 8\r\n  |  call_intern lj_tab_get\t// (lua_State *L, GCtab *t, cTValue *key)\r\n  |.  move CARG1, L\r\n  |  // Returns cTValue *.\r\n  |  b ->fff_resn\r\n  |.  ldc1 FRET1, 0(CRET1)\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  lw CARG1, HI(BASE)\r\n  |  xori AT, NARGS8:RC, 8\r\n  |  sltiu CARG1, CARG1, LJ_TISNUM\r\n  |  movn CARG1, r0, AT\r\n  |  beqz CARG1, ->fff_fallback\t\t// Exactly one number argument.\r\n  |.  ldc1 FRET1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  li AT, LJ_TSTR\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq CARG3, AT, ->fff_restv\t\t\t// String key?\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |.  lw TMP1, DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])(DISPATCH)\r\n  |  sltiu TMP0, CARG3, LJ_TISNUM\r\n  |  sltiu TMP1, TMP1, 1\r\n  |  and TMP0, TMP0, TMP1\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.  sw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  ffgccheck\r\n  |.  sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  load_got lj_strfmt_num\r\n  |  move CARG1, L\r\n  |  call_intern lj_strfmt_num\t\t// (lua_State *L, lua_Number *np)\r\n  |.  move CARG2, BASE\r\n  |  // Returns GCstr *.\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |.  move CARG1, CRET1\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc next\r\n  |  lw CARG1, HI(BASE)\r\n  |   lw TAB:CARG2, LO(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  addu TMP2, BASE, NARGS8:RC\r\n  |  li AT, LJ_TTAB\r\n  |   sw TISNIL, HI(TMP2)\t\t// Set missing 2nd arg to nil.\r\n  |  bne CARG1, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |  load_got lj_tab_next\r\n  |   sw BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |   sw BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  addiu CARG3, BASE, 8\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_tab_next\t\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |.  move CARG1, L\r\n  |  // Returns 0 at end of traversal.\r\n  |  beqz CRET1, ->fff_restv\t\t// End of traversal: return nil.\r\n  |.  li CARG3, LJ_TNIL\r\n  |  ldc1 f0, 8(BASE)\t\t\t// Copy key and value to results.\r\n  |    addiu RA, BASE, -8\r\n  |   ldc1 f2, 16(BASE)\r\n  |    li RD, (2+1)*8\r\n  |  sdc1 f0, 0(RA)\r\n  |  b ->fff_res\r\n  |.  sdc1 f2, 8(RA)\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n#if LJ_52\r\n  |  lw TAB:TMP2, TAB:CARG1->metatable\r\n  |   ldc1 f0, CFUNC:RB->upvalue[0]\r\n  |  bnez TAB:TMP2, ->fff_fallback\r\n#else\r\n  |  ldc1 f0, CFUNC:RB->upvalue[0]\r\n#endif\r\n  |.  addiu RA, BASE, -8\r\n  |   sw TISNIL, 8+HI(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |.ffunc ipairs_aux\r\n  |  sltiu AT, NARGS8:RC, 16\r\n  |   lw CARG3, HI(BASE)\r\n  |    lw TAB:CARG1, LO(BASE)\r\n  |   lw CARG4, 8+HI(BASE)\r\n  |  bnez AT, ->fff_fallback\r\n  |.  ldc1 FARG2, 8(BASE)\r\n  |   addiu CARG3, CARG3, -LJ_TTAB\r\n  |  sltiu AT, CARG4, LJ_TISNUM\r\n  |   li TMP0, 1\r\n  |  movn AT, r0, CARG3\r\n  |   mtc1 TMP0, FARG1\r\n  |  beqz AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |   trunc.w.d FRET1, FARG2\r\n  |  cvt.d.w FARG1, FARG1\r\n  |   lw TMP0, TAB:CARG1->asize\r\n  |   lw TMP1, TAB:CARG1->array\r\n  |  mfc1 TMP2, FRET1\r\n  |   addiu RA, BASE, -8\r\n  |  add.d FARG2, FARG2, FARG1\r\n  |  addiu TMP2, TMP2, 1\r\n  |  sltu AT, TMP2, TMP0\r\n  |   sll TMP3, TMP2, 3\r\n  |   addu TMP3, TMP1, TMP3\r\n  |  beqz AT, >2\t\t\t// Not in array part?\r\n  |.  sdc1 FARG2, 0(RA)\r\n  |  lw TMP2, HI(TMP3)\r\n  |  ldc1 f0, 0(TMP3)\r\n  |1:\r\n  |  beq TMP2, TISNIL, ->fff_res\t// End of iteration, return 0 results.\r\n  |.  li RD, (0+1)*8\r\n  |   li RD, (2+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 8(RA)\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  lw TMP0, TAB:CARG1->hmask\r\n  |  load_got lj_tab_getinth\r\n  |  beqz TMP0, ->fff_res\r\n  |.  li RD, (0+1)*8\r\n  |  call_intern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |.  move CARG2, TMP2\r\n  |  // Returns cTValue * or NULL.\r\n  |  beqz CRET1, ->fff_res\r\n  |.  li RD, (0+1)*8\r\n  |  lw TMP2, HI(CRET1)\r\n  |  b <1\r\n  |.  ldc1 f0, 0(CRET1)\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  li AT, LJ_TTAB\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  lw PC, FRAME_PC(BASE)\r\n#if LJ_52\r\n  |  lw TAB:TMP2, TAB:CARG1->metatable\r\n  |   ldc1 f0, CFUNC:RB->upvalue[0]\r\n  |  bnez TAB:TMP2, ->fff_fallback\r\n#else\r\n  |  ldc1 f0, CFUNC:RB->upvalue[0]\r\n#endif\r\n  |.  addiu RA, BASE, -8\r\n  |   sw r0, 8+HI(BASE)\r\n  |   sw r0, 8+LO(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |   move TMP2, BASE\r\n  |   addiu BASE, BASE, 8\r\n  |  // Remember active hook before pcall.\r\n  |  srl TMP3, TMP3, HOOK_ACTIVE_SHIFT\r\n  |  andi TMP3, TMP3, 1\r\n  |  addiu PC, TMP3, 8+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n  |\r\n  |.ffunc xpcall\r\n  |    sltiu AT, NARGS8:RC, 16\r\n  |  lw CARG4, 8+HI(BASE)\r\n  |    bnez AT, ->fff_fallback\r\n  |.  ldc1 FARG2, 8(BASE)\r\n  |   ldc1 FARG1, 0(BASE)\r\n  |    lbu TMP1, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  li AT, LJ_TFUNC\r\n  |   move TMP2, BASE\r\n  |  bne CARG4, AT, ->fff_fallback  // Traceback must be a function.\r\n  |   addiu BASE, BASE, 16\r\n  |  // Remember active hook before pcall.\r\n  |  srl TMP3, TMP3, HOOK_ACTIVE_SHIFT\r\n  |   sdc1 FARG2, 0(TMP2)\t\t// Swap function and traceback.\r\n  |  andi TMP3, TMP3, 1\r\n  |   sdc1 FARG1, 8(TMP2)\r\n  |  addiu PC, TMP3, 16+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |.  addiu NARGS8:RC, NARGS8:RC, -16\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  li AT, LJ_TTHREAD\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  lw L:CARG1, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  lbu TMP0, L:CARG1->status\r\n  |   lw TMP1, L:CARG1->cframe\r\n  |    lw CARG2, L:CARG1->top\r\n  |    lw TMP2, L:CARG1->base\r\n  |  addiu TMP3, TMP0, -LUA_YIELD\r\n  |  bgtz TMP3, ->fff_fallback\t\t// st > LUA_YIELD?\r\n  |.   xor TMP2, TMP2, CARG2\r\n  |  bnez TMP1, ->fff_fallback\t\t// cframe != 0?\r\n  |.  or AT, TMP2, TMP0\r\n  |  lw TMP0, L:CARG1->maxstack\r\n  |  beqz AT, ->fff_fallback\t\t// base == top && st == 0?\r\n  |.  lw PC, FRAME_PC(BASE)\r\n  |  addu TMP2, CARG2, NARGS8:RC\r\n  |  sltu AT, TMP0, TMP2\r\n  |  bnez AT, ->fff_fallback\t\t// Stack overflow?\r\n  |.  sw PC, SAVE_PC\r\n  |   sw BASE, L->base\r\n  |1:\r\n  |.if resume\r\n  |  addiu BASE, BASE, 8\t\t// Keep resumed thread in stack for GC.\r\n  |  addiu NARGS8:RC, NARGS8:RC, -8\r\n  |  addiu TMP2, TMP2, -8\r\n  |.endif\r\n  |  sw TMP2, L:CARG1->top\r\n  |  addu TMP1, BASE, NARGS8:RC\r\n  |  move CARG3, CARG2\r\n  |  sw BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |   ldc1 f0, 0(BASE)\r\n  |  sltu AT, BASE, TMP1\r\n  |  beqz AT, >3\r\n  |.  addiu BASE, BASE, 8\r\n  |   sdc1 f0, 0(CARG3)\r\n  |  b <2\r\n  |.  addiu CARG3, CARG3, 8\r\n  |3:\r\n  |  bal ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |.  move L:RA, L:CARG1\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  lw TMP2, L:RA->base\r\n  |   sltiu AT, CRET1, LUA_YIELD+1\r\n  |  lw TMP3, L:RA->top\r\n  |    li_vmstate INTERP\r\n  |  lw BASE, L->base\r\n  |    sw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |    st_vmstate\r\n  |   beqz AT, >8\r\n  |. subu RD, TMP3, TMP2\r\n  |   lw TMP0, L->maxstack\r\n  |  beqz RD, >6\t\t\t// No results?\r\n  |.  addu TMP1, BASE, RD\r\n  |  sltu AT, TMP0, TMP1\r\n  |  bnez AT, >9\t\t\t// Need to grow stack?\r\n  |.  addu TMP3, TMP2, RD\r\n  |  sw TMP2, L:RA->top\t\t\t// Clear coroutine stack.\r\n  |  move TMP1, BASE\r\n  |5:  // Move results from coroutine.\r\n  |   ldc1 f0, 0(TMP2)\r\n  |  addiu TMP2, TMP2, 8\r\n  |  sltu AT, TMP2, TMP3\r\n  |   sdc1 f0, 0(TMP1)\r\n  |  bnez AT, <5\r\n  |.  addiu TMP1, TMP1, 8\r\n  |6:\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |.if resume\r\n  |  li TMP1, LJ_TTRUE\r\n  |   addiu RA, BASE, -8\r\n  |  sw TMP1, -8+HI(BASE)\t\t// Prepend true to results.\r\n  |  addiu RD, RD, 16\r\n  |.else\r\n  |  move RA, BASE\r\n  |  addiu RD, RD, 8\r\n  |.endif\r\n  |7:\r\n  |  sw PC, SAVE_PC\r\n  |  beqz TMP0, ->BC_RET_Z\r\n  |.  move MULTRES, RD\r\n  |  b ->vm_return\r\n  |.  nop\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  addiu TMP3, TMP3, -8\r\n  |   li TMP1, LJ_TFALSE\r\n  |  ldc1 f0, 0(TMP3)\r\n  |   sw TMP3, L:RA->top\t\t// Remove error from coroutine stack.\r\n  |    li RD, (2+1)*8\r\n  |   sw TMP1, -8+HI(BASE)\t\t// Prepend false to results.\r\n  |    addiu RA, BASE, -8\r\n  |  sdc1 f0, 0(BASE)\t\t\t// Copy error message.\r\n  |  b <7\r\n  |.  andi TMP0, PC, FRAME_TYPE\r\n  |.else\r\n  |  load_got lj_ffh_coroutine_wrap_err\r\n  |  move CARG2, L:RA\r\n  |  call_intern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |.  move CARG1, L\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  load_got lj_state_growstack\r\n  |  srl CARG2, RD, 3\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  b <4\r\n  |.  li CRET1, 0\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  lw TMP0, L->cframe\r\n  |   addu TMP1, BASE, NARGS8:RC\r\n  |   sw BASE, L->base\r\n  |  andi TMP0, TMP0, CFRAME_RESUME\r\n  |   sw TMP1, L->top\r\n  |  beqz TMP0, ->fff_fallback\r\n  |.   li CRET1, LUA_YIELD\r\n  |  sw r0, L->cframe\r\n  |  b ->vm_leave_unw\r\n  |.   sb CRET1, L->status\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.ffunc_n math_abs\r\n  |.  abs.d FRET1, FARG1\r\n  |->fff_resn:\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  addiu RA, BASE, -8\r\n  |  b ->fff_res1\r\n  |.  sdc1 FRET1, -8(BASE)\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG3/CARG1 = TValue result.\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |   sw CARG3, -8+HI(BASE)\r\n  |  addiu RA, BASE, -8\r\n  |   sw CARG1, -8+LO(BASE)\r\n  |->fff_res1:\r\n  |  // RA = results, PC = return.\r\n  |  li RD, (1+1)*8\r\n  |->fff_res:\r\n  |  // RA = results, RD = (nresults+1)*8, PC = return.\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |  bnez TMP0, ->vm_return\r\n  |.  move MULTRES, RD\r\n  |  lw INS, -4(PC)\r\n  |  decode_RB8a RB, INS\r\n  |  decode_RB8b RB\r\n  |5:\r\n  |  sltu AT, RD, RB\r\n  |  bnez AT, >6\t\t\t// More results expected?\r\n  |.  decode_RA8a TMP0, INS\r\n  |  decode_RA8b TMP0\r\n  |  ins_next1\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |   subu BASE, RA, TMP0\r\n  |  ins_next2\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  addu TMP1, RA, RD\r\n  |   addiu RD, RD, 8\r\n  |  b <5\r\n  |.  sw TISNIL, -8+HI(TMP1)\r\n  |\r\n  |.macro math_extern, func\r\n  |->ff_math_ .. func:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  load_got func\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  nop\r\n  |  call_extern\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |.  load_got func\r\n  |  call_extern\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_n math_ .. func\r\n  |.  nop\r\n  |  bal ->vm_ .. func\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.ffunc math_log\r\n  |  lw CARG3, HI(BASE)\r\n  |  li AT, 8\r\n  |  bne NARGS8:RC, AT, ->fff_fallback\t// Exactly 1 argument.\r\n  |.  load_got log\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  nop\r\n  |  call_extern\r\n  |.  ldc1 FARG1, 0(BASE)\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.ffunc_n math_sqrt\r\n  |.  sqrt.d FRET1, FARG1\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |.ffunc_nn math_ldexp\r\n  |  trunc.w.d FARG2, FARG2\r\n  |  load_got ldexp\r\n  |  mfc1 CARG3, FARG2\r\n  |  call_extern\r\n  |.  nop\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |  load_got frexp\r\n  |   lw PC, FRAME_PC(BASE)\r\n  |  call_extern\r\n  |.  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n  |   lw TMP1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  addiu RA, BASE, -8\r\n  |   mtc1 TMP1, FARG2\r\n  |  sdc1 FRET1, 0(RA)\r\n  |   cvt.d.w FARG2, FARG2\r\n  |   sdc1 FARG2, 8(RA)\r\n  |  b ->fff_res\r\n  |.  li RD, (2+1)*8\r\n  |\r\n  |.ffunc_n math_modf\r\n  |  load_got modf\r\n  |   lw PC, FRAME_PC(BASE)\r\n  |  call_extern\r\n  |.  addiu CARG3, BASE, -8\r\n  |  addiu RA, BASE, -8\r\n  |  sdc1 FRET1, 0(BASE)\r\n  |  b ->fff_res\r\n  |.  li RD, (2+1)*8\r\n  |\r\n  |.macro math_minmax, name, ismax\r\n  |->ff_ .. name:\r\n  |  lw CARG3, HI(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  ldc1 FRET1, 0(BASE)\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  addu TMP2, BASE, NARGS8:RC\r\n  |  addiu TMP1, BASE, 8\r\n  |  beq TMP1, TMP2, ->fff_resn\r\n  |1:\r\n  |.  lw CARG3, HI(TMP1)\r\n  |  ldc1 FARG1, 0(TMP1)\r\n  |   addiu TMP1, TMP1, 8\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.if ismax\r\n  |.  c.olt.d FARG1, FRET1\r\n  |.else\r\n  |.  c.olt.d FRET1, FARG1\r\n  |.endif\r\n  |  bne TMP1, TMP2, <1\r\n  |.  movf.d FRET1, FARG1\r\n  |  b ->fff_resn\r\n  |.  nop\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, 0\r\n  |  math_minmax math_max, 1\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  lw CARG3, HI(BASE)\r\n  |   lw STR:CARG1, LO(BASE)\r\n  |  xori AT, NARGS8:RC, 8\r\n  |  addiu CARG3, CARG3, -LJ_TSTR\r\n  |  or AT, AT, CARG3\r\n  |  bnez AT, ->fff_fallback\t\t// Need exactly 1 string argument.\r\n  |.  nop\r\n  |  lw TMP0, STR:CARG1->len\r\n  |   lbu TMP1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |    addiu RA, BASE, -8\r\n  |  sltu RD, r0, TMP0\r\n  |   mtc1 TMP1, f0\r\n  |  addiu RD, RD, 1\r\n  |   cvt.d.w f0, f0\r\n  |  lw PC, FRAME_PC(BASE)\r\n  |  sll RD, RD, 3\t\t\t// RD = ((str->len != 0)+1)*8\r\n  |  b ->fff_res\r\n  |.  sdc1 f0, 0(RA)\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  lw CARG3, HI(BASE)\r\n  |   ldc1 FARG1, 0(BASE)\r\n  |  li AT, 8\r\n  |  bne NARGS8:RC, AT, ->fff_fallback\t// Exactly 1 argument.\r\n  |.  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  li CARG3, 1\r\n  |   trunc.w.d FARG1, FARG1\r\n  |  addiu CARG2, sp, ARG5_OFS\r\n  |  sltiu AT, TMP0, 256\r\n  |   mfc1 TMP0, FARG1\r\n  |  beqz AT, ->fff_fallback\r\n  |.  sw TMP0, ARG5\r\n  |->fff_newstr:\r\n  |  load_got lj_str_new\r\n  |   sw BASE, L->base\r\n  |   sw PC, SAVE_PC\r\n  |  call_intern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |.  move CARG1, L\r\n  |  // Returns GCstr *.\r\n  |  lw BASE, L->base\r\n  |->fff_resstr:\r\n  |  move CARG1, CRET1\r\n  |  b ->fff_restv\r\n  |.  li CARG3, LJ_TSTR\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  addiu AT, NARGS8:RC, -16\r\n  |   lw CARG3, 16+HI(BASE)\r\n  |    ldc1 f0, 16(BASE)\r\n  |   lw TMP0, HI(BASE)\r\n  |    lw STR:CARG1, LO(BASE)\r\n  |  bltz AT, ->fff_fallback\r\n  |   lw CARG2, 8+HI(BASE)\r\n  |    ldc1 f2, 8(BASE)\r\n  |  beqz AT, >1\r\n  |.  li CARG4, -1\r\n  |   trunc.w.d f0, f0\r\n  |  sltiu AT, CARG3, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  mfc1 CARG4, f0\r\n  |1:\r\n  |  sltiu AT, CARG2, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |.  li AT, LJ_TSTR\r\n  |  trunc.w.d f2, f2\r\n  |  bne TMP0, AT, ->fff_fallback\r\n  |.  lw CARG2, STR:CARG1->len\r\n  |  mfc1 CARG3, f2\r\n  |  // STR:CARG1 = str, CARG2 = str->len, CARG3 = start, CARG4 = end\r\n  |  slt AT, CARG4, r0\r\n  |  addiu TMP0, CARG2, 1\r\n  |  addu TMP1, CARG4, TMP0\r\n  |   slt TMP3, CARG3, r0\r\n  |  movn CARG4, TMP1, AT\t\t// if (end < 0) end += len+1\r\n  |   addu TMP1, CARG3, TMP0\r\n  |   movn CARG3, TMP1, TMP3\t\t// if (start < 0) start += len+1\r\n  |   li TMP2, 1\r\n  |  slt AT, CARG4, r0\r\n  |   slt TMP3, r0, CARG3\r\n  |  movn CARG4, r0, AT\t\t\t// if (end < 0) end = 0\r\n  |   movz CARG3, TMP2, TMP3\t\t// if (start < 1) start = 1\r\n  |  slt AT, CARG2, CARG4\r\n  |  movn CARG4, CARG2, AT\t\t// if (end > len) end = len\r\n  |   addu CARG2, STR:CARG1, CARG3\r\n  |  subu CARG3, CARG4, CARG3\t\t// len = end - start\r\n  |   addiu CARG2, CARG2, sizeof(GCstr)-1\r\n  |  bgez CARG3, ->fff_newstr\r\n  |.  addiu CARG3, CARG3, 1\t\t// len++\r\n  |->fff_emptystr:  // Return empty string.\r\n  |  addiu STR:CARG1, DISPATCH, DISPATCH_GL(strempty)\r\n  |  b ->fff_restv\r\n  |.  li CARG3, LJ_TSTR\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc string_ .. name\r\n  |  ffgccheck\r\n  |  lw CARG3, HI(BASE)\r\n  |   lw STR:CARG2, LO(BASE)\r\n  |  beqz NARGS8:RC, ->fff_fallback\r\n  |.  li AT, LJ_TSTR\r\n  |  bne CARG3, AT, ->fff_fallback\r\n  |.  addiu SBUF:CARG1, DISPATCH, DISPATCH_GL(tmpbuf)\r\n  |  load_got lj_buf_putstr_ .. name\r\n  |  lw TMP0, SBUF:CARG1->b\r\n  |   sw L, SBUF:CARG1->L\r\n  |   sw BASE, L->base\r\n  |  sw TMP0, SBUF:CARG1->p\r\n  |  call_intern extern lj_buf_putstr_ .. name\r\n  |.  sw PC, SAVE_PC\r\n  |  load_got lj_buf_tostr\r\n  |  call_intern lj_buf_tostr\r\n  |.  move SBUF:CARG1, SBUF:CRET1\r\n  |  b ->fff_resstr\r\n  |.  lw BASE, L->base\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |  .ffunc_n bit_..name\r\n  |.  add.d FARG1, FARG1, TOBIT\r\n  |  mfc1 CRET1, FARG1\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  addiu TMP1, BASE, 8\r\n  |  addu TMP2, BASE, NARGS8:RC\r\n  |1:\r\n  |  lw CARG4, HI(TMP1)\r\n  |  beq TMP1, TMP2, ->fff_resi\r\n  |.  ldc1 FARG1, 0(TMP1)\r\n  |  sltiu AT, CARG4, LJ_TISNUM\r\n  |  beqz AT, ->fff_fallback\r\n  |  add.d FARG1, FARG1, TOBIT\r\n  |  mfc1 CARG2, FARG1\r\n  |  ins CRET1, CRET1, CARG2\r\n  |  b <1\r\n  |.  addiu TMP1, TMP1, 8\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, or\r\n  |.ffunc_bit_op bxor, xor\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  srl TMP0, CRET1, 24\r\n  |   srl TMP2, CRET1, 8\r\n  |  sll TMP1, CRET1, 24\r\n  |   andi TMP2, TMP2, 0xff00\r\n  |  or TMP0, TMP0, TMP1\r\n  |   andi CRET1, CRET1, 0xff00\r\n  |  or TMP0, TMP0, TMP2\r\n  |   sll CRET1, CRET1, 8\r\n  |  b ->fff_resi\r\n  |.  or CRET1, TMP0, CRET1\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  b ->fff_resi\r\n  |.  not CRET1, CRET1\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |  .ffunc_nn bit_..name\r\n  |.  add.d FARG1, FARG1, TOBIT\r\n  |  add.d FARG2, FARG2, TOBIT\r\n  |  mfc1 CARG1, FARG1\r\n  |  mfc1 CARG2, FARG2\r\n  |.if shmod == 1\r\n  |  li AT, 32\r\n  |  subu TMP0, AT, CARG2\r\n  |  sllv CARG2, CARG1, CARG2\r\n  |  srlv CARG1, CARG1, TMP0\r\n  |.elif shmod == 2\r\n  |  li AT, 32\r\n  |  subu TMP0, AT, CARG2\r\n  |  srlv CARG2, CARG1, CARG2\r\n  |  sllv CARG1, CARG1, TMP0\r\n  |.endif\r\n  |  b ->fff_resi\r\n  |.  ins CRET1, CARG1, CARG2\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, sllv, 0\r\n  |.ffunc_bit_sh rshift, srlv, 0\r\n  |.ffunc_bit_sh arshift, srav, 0\r\n  |// Can't use rotrv, since it's only in MIPS32R2.\r\n  |.ffunc_bit_sh rol, or, 1\r\n  |.ffunc_bit_sh ror, or, 2\r\n  |\r\n  |.ffunc_bit tobit\r\n  |->fff_resi:\r\n  |  mtc1 CRET1, FRET1\r\n  |  b ->fff_resn\r\n  |.  cvt.d.w FRET1, FRET1\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RB = CFUNC, RC = nargs*8\r\n  |  lw TMP3, CFUNC:RB->f\r\n  |    addu TMP1, BASE, NARGS8:RC\r\n  |   lw PC, FRAME_PC(BASE)\t\t// Fallback may overwrite PC.\r\n  |    addiu TMP0, TMP1, 8*LUA_MINSTACK\r\n  |     lw TMP2, L->maxstack\r\n  |   sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  sltu AT, TMP2, TMP0\r\n  |     sw BASE, L->base\r\n  |    sw TMP1, L->top\r\n  |  bnez AT, >5\t\t\t// Need to grow stack.\r\n  |.  move CFUNCADDR, TMP3\r\n  |  jalr TMP3\t\t\t\t// (lua_State *L)\r\n  |.  move CARG1, L\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  lw BASE, L->base\r\n  |   sll RD, CRET1, 3\r\n  |  bgtz CRET1, ->fff_res\t\t// Returned nresults+1?\r\n  |.  addiu RA, BASE, -8\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |  lw TMP0, L->top\r\n  |   lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  bnez CRET1, ->vm_call_tail\t\t// Returned -1?\r\n  |.  subu NARGS8:RC, TMP0, BASE\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  andi TMP0, PC, FRAME_TYPE\r\n  |   li AT, -4\r\n  |  bnez TMP0, >3\r\n  |.  and TMP1, PC, AT\r\n  |  lbu TMP1, OFS_RA(PC)\r\n  |  sll TMP1, TMP1, 3\r\n  |  addiu TMP1, TMP1, 8\r\n  |3:\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |.  subu TMP2, BASE, TMP1\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  load_got lj_state_growstack\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n  |.  move CARG1, L\r\n  |  lw BASE, L->base\r\n  |  b <1\r\n  |.  li CRET1, 0\t\t\t// Force retry.\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  move MULTRES, ra\r\n  |  load_got lj_gc_step\r\n  |   sw BASE, L->base\r\n  |  addu TMP0, BASE, NARGS8:RC\r\n  |   sw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  sw TMP0, L->top\r\n  |  call_intern lj_gc_step\t\t// (lua_State *L)\r\n  |.  move CARG1, L\r\n  |   lw BASE, L->base\r\n  |  move ra, MULTRES\r\n  |    lw TMP0, L->top\r\n  |  lw CFUNC:RB, FRAME_FUNC(BASE)\r\n  |  jr ra\r\n  |.  subu NARGS8:RC, TMP0, BASE\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_VMEVENT\t// No recording while in vmevent.\r\n  |  bnez AT, >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |.  lw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\r\n  |  bnez AT, >1\r\n  |.  addiu TMP2, TMP2, -1\r\n  |  andi AT, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqz AT, >1\r\n  |.  nop\r\n  |  b >1\r\n  |.  sw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  beqz AT, >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |.  lw AT, GG_DISP2STATIC(TMP0)\t// Assumes TMP0 holds DISPATCH+OP*4.\r\n  |  jr AT\r\n  |.  nop\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  lbu TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  lw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  bnez AT, <5\r\n  |.  andi AT, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqz AT, <5\r\n  |.  addiu TMP2, TMP2, -1\r\n  |  beqz TMP2, >1\r\n  |.  sw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andi AT, TMP3, LUA_MASKLINE\r\n  |  beqz AT, <5\r\n  |1:\r\n  |.  load_got lj_dispatch_ins\r\n  |   sw MULTRES, SAVE_MULTRES\r\n  |  move CARG2, PC\r\n  |   sw BASE, L->base\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  call_intern lj_dispatch_ins\t// (lua_State *L, const BCIns *pc)\r\n  |.  move CARG1, L\r\n  |3:\r\n  |  lw BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  lw INS, -4(PC)\r\n  |  decode_OP4a TMP1, INS\r\n  |  decode_OP4b TMP1\r\n  |  addu TMP0, DISPATCH, TMP1\r\n  |   decode_RD8a RD, INS\r\n  |  lw AT, GG_DISP2STATIC(TMP0)\r\n  |   decode_RA8a RA, INS\r\n  |   decode_RD8b RD\r\n  |  jr AT\r\n  |   decode_RA8b RA\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  addiu PC, PC, 4\r\n  |  b <4\r\n  |.  lw MULTRES, -24+LO(RB)\t\t// Restore MULTRES for *M ins.\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |   addiu CARG1, DISPATCH, GG_DISP2J\r\n  |   sw PC, SAVE_PC\r\n  |  lw TMP1, LFUNC:TMP1->pc\r\n  |   move CARG2, PC\r\n  |   sw L, DISPATCH_J(L)(DISPATCH)\r\n  |  lbu TMP1, PC2PROTO(framesize)(TMP1)\r\n  |  load_got lj_trace_hot\r\n  |   sw BASE, L->base\r\n  |  sll TMP1, TMP1, 3\r\n  |  addu TMP1, BASE, TMP1\r\n  |  call_intern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |.  sw TMP1, L->top\r\n  |  b <3\r\n  |.  nop\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |.  move CARG2, PC\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  ori CARG2, PC, 1\r\n  |1:\r\n  |.endif\r\n  |  load_got lj_dispatch_call\r\n  |  addu TMP0, BASE, RC\r\n  |   sw PC, SAVE_PC\r\n  |   sw BASE, L->base\r\n  |  subu RA, RA, BASE\r\n  |   sw TMP0, L->top\r\n  |  call_intern lj_dispatch_call\t// (lua_State *L, const BCIns *pc)\r\n  |.  move CARG1, L\r\n  |  // Returns ASMFunction.\r\n  |  lw BASE, L->base\r\n  |   lw TMP0, L->top\r\n  |   sw r0, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  subu NARGS8:RC, TMP0, BASE\r\n  |  addu RA, BASE, RA\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  jr CRET1\r\n  |.  lw INS, -4(PC)\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |.if JIT\r\n  |  // RA = resultptr, RB = meta base\r\n  |  lw INS, -4(PC)\r\n  |    lw TMP3, -24+LO(RB)\t\t// Save previous trace number.\r\n  |  decode_RA8a RC, INS\r\n  |   addiu AT, MULTRES, -8\r\n  |  decode_RA8b RC\r\n  |   beqz AT, >2\r\n  |. addu RC, BASE, RC\t\t\t// Call base.\r\n  |1:  // Move results down.\r\n  |  ldc1 f0, 0(RA)\r\n  |   addiu AT, AT, -8\r\n  |    addiu RA, RA, 8\r\n  |  sdc1 f0, 0(RC)\r\n  |   bnez AT, <1\r\n  |.   addiu RC, RC, 8\r\n  |2:\r\n  |   decode_RA8a RA, INS\r\n  |    decode_RB8a RB, INS\r\n  |   decode_RA8b RA\r\n  |    decode_RB8b RB\r\n  |   addu RA, RA, RB\r\n  |  lw TMP1, DISPATCH_J(trace)(DISPATCH)\r\n  |   addu RA, BASE, RA\r\n  |3:\r\n  |   sltu AT, RC, RA\r\n  |   bnez AT, >9\t\t\t// More results wanted?\r\n  |. sll TMP2, TMP3, 2\r\n  |\r\n  |  addu TMP2, TMP1, TMP2\r\n  |  lw TRACE:TMP2, 0(TMP2)\r\n  |  beqz TRACE:TMP2, ->cont_nop\r\n  |.  nop\r\n  |  lhu RD, TRACE:TMP2->link\r\n  |  beq RD, TMP3, ->cont_nop\t\t// Blacklisted.\r\n  |.  load_got lj_dispatch_stitch\r\n  |  bnez RD, =>BC_JLOOP\t\t// Jump to stitched trace.\r\n  |.  sll RD, RD, 3\r\n  |\r\n  |  // Stitch a new trace to the previous trace.\r\n  |  sw TMP3, DISPATCH_J(exitno)(DISPATCH)\r\n  |  sw L, DISPATCH_J(L)(DISPATCH)\r\n  |  sw BASE, L->base\r\n  |  addiu CARG1, DISPATCH, GG_DISP2J\r\n  |  call_intern lj_dispatch_stitch\t// (jit_State *J, const BCIns *pc)\r\n  |.  move CARG2, PC\r\n  |  b ->cont_nop\r\n  |.  lw BASE, L->base\r\n  |\r\n  |9:\r\n  |  sw TISNIL, HI(RC)\r\n  |  b <3\r\n  |.  addiu RC, RC, 8\r\n  |.endif\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  load_got lj_dispatch_profile\r\n  |   sw MULTRES, SAVE_MULTRES\r\n  |  move CARG2, PC\r\n  |   sw BASE, L->base\r\n  |  call_intern lj_dispatch_profile\t// (lua_State *L, const BCIns *pc)\r\n  |.  move CARG1, L\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  addiu PC, PC, -4\r\n  |  b ->cont_nop\r\n  |.  lw BASE, L->base\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro savex_, a, b\r\n  |  sdc1 f..a, 16+a*8(sp)\r\n  |  sw r..a, 16+32*8+a*4(sp)\r\n  |  sw r..b, 16+32*8+b*4(sp)\r\n  |.endmacro\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  addiu sp, sp, -(16+32*8+32*4)\r\n  |  savex_ 0, 1\r\n  |  savex_ 2, 3\r\n  |  savex_ 4, 5\r\n  |  savex_ 6, 7\r\n  |  savex_ 8, 9\r\n  |  savex_ 10, 11\r\n  |  savex_ 12, 13\r\n  |  savex_ 14, 15\r\n  |  savex_ 16, 17\r\n  |  savex_ 18, 19\r\n  |  savex_ 20, 21\r\n  |  savex_ 22, 23\r\n  |  savex_ 24, 25\r\n  |  savex_ 26, 27\r\n  |  sdc1 f28, 16+28*8(sp)\r\n  |  sw r28, 16+32*8+28*4(sp)\r\n  |  sdc1 f30, 16+30*8(sp)\r\n  |  sw r30, 16+32*8+30*4(sp)\r\n  |  sw r0, 16+32*8+31*4(sp)\t\t// Clear RID_TMP.\r\n  |  li_vmstate EXIT\r\n  |   addiu TMP2, sp, 16+32*8+32*4\t// Recompute original value of sp.\r\n  |  addiu DISPATCH, JGL, -GG_DISP2G-32768\r\n  |  lw TMP1, 0(TMP2)\t\t\t// Load exit number.\r\n  |  st_vmstate\r\n  |   sw TMP2, 16+32*8+29*4(sp)\t\t// Store sp in RID_SP.\r\n  |  lw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |   lw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  load_got lj_trace_exit\r\n  |  sw L, DISPATCH_J(L)(DISPATCH)\r\n  |  sw ra, DISPATCH_J(parent)(DISPATCH)  // Store trace number.\r\n  |   sw BASE, L->base\r\n  |  sw TMP1, DISPATCH_J(exitno)(DISPATCH)  // Store exit number.\r\n  |  addiu CARG1, DISPATCH, GG_DISP2J\r\n  |   sw r0, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  call_intern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |.  addiu CARG2, sp, 16\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  lw TMP1, L->cframe\r\n  |  li AT, -4\r\n  |   lw BASE, L->base\r\n  |  and sp, TMP1, AT\r\n  |   lw PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  b >1\r\n  |.  sw L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |.if JIT\r\n  |  // CRET1 = MULTRES or negated error code, BASE, PC and JGL set.\r\n  |  lw L, SAVE_L\r\n  |   addiu DISPATCH, JGL, -GG_DISP2G-32768\r\n  |  sw BASE, L->base\r\n  |1:\r\n  |  bltz CRET1, >9\t\t\t// Check for error from exit.\r\n  |.  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |    lui TMP3, 0x59c0\t\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  sll MULTRES, CRET1, 3\r\n  |    li TISNIL, LJ_TNIL\r\n  |  sw MULTRES, SAVE_MULTRES\r\n  |    mtc1 TMP3, TOBIT\r\n  |  lw TMP1, LFUNC:RB->pc\r\n  |   sw r0, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  lw KBASE, PC2PROTO(k)(TMP1)\r\n  |    cvt.d.s TOBIT, TOBIT\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  lw INS, 0(PC)\r\n  |   addiu PC, PC, 4\r\n  |    // Assumes TISNIL == ~LJ_VMST_INTERP == -1\r\n  |    sw TISNIL, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  decode_OP4a TMP1, INS\r\n  |  decode_OP4b TMP1\r\n  |    sltiu TMP2, TMP1, BC_FUNCF*4\t// Function header?\r\n  |  addu TMP0, DISPATCH, TMP1\r\n  |   decode_RD8a RD, INS\r\n  |  lw AT, 0(TMP0)\r\n  |   decode_RA8a RA, INS\r\n  |    beqz TMP2, >2\r\n  |.  decode_RA8b RA\r\n  |  jr AT\r\n  |.  decode_RD8b RD\r\n  |2:\r\n  |  sltiu TMP2, TMP1, (BC_FUNCC+2)*4\t// Fast function?\r\n  |  bnez TMP2, >3\r\n  |.  lw TMP1, FRAME_PC(BASE)\r\n  |  // Check frame below fast function.\r\n  |  andi TMP0, TMP1, FRAME_TYPE\r\n  |  bnez TMP0, >3\t\t\t// Trace stitching continuation?\r\n  |.  nop\r\n  |  // Otherwise set KBASE for Lua function below fast function.\r\n  |  lw TMP2, -4(TMP1)\r\n  |  decode_RA8a TMP0, TMP2\r\n  |  decode_RA8b TMP0\r\n  |  subu TMP1, BASE, TMP0\r\n  |  lw LFUNC:TMP2, -8+FRAME_FUNC(TMP1)\r\n  |  lw TMP1, LFUNC:TMP2->pc\r\n  |  lw KBASE, PC2PROTO(k)(TMP1)\r\n  |3:\r\n  |  addiu RC, MULTRES, -8\r\n  |  jr AT\r\n  |.  addu RA, RA, BASE\r\n  |\r\n  |9:  // Rethrow error from the right C frame.\r\n  |  load_got lj_err_throw\r\n  |  negu CARG2, CRET1\r\n  |  call_intern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.  move CARG1, L\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Modifies AT, TMP0, FRET1, FRET2, f4. Keeps all others incl. FARG1.\r\n  |.macro vm_round, func\r\n  |  lui TMP0, 0x4330\t\t\t// Hiword of 2^52 (double).\r\n  |  mtc1 r0, f4\r\n  |  mtc1 TMP0, f5\r\n  |  abs.d FRET2, FARG1\t\t\t// |x|\r\n  |    mfc1 AT, f13\r\n  |  c.olt.d 0, FRET2, f4\r\n  |   add.d FRET1, FRET2, f4\t\t// (|x| + 2^52) - 2^52\r\n  |  bc1f 0, >1\t\t\t\t// Truncate only if |x| < 2^52.\r\n  |.  sub.d FRET1, FRET1, f4\r\n  |    slt AT, AT, r0\r\n  |.if \"func\" == \"ceil\"\r\n  |   lui TMP0, 0xbff0\t\t\t// Hiword of -1 (double). Preserves -0.\r\n  |.else\r\n  |   lui TMP0, 0x3ff0\t\t\t// Hiword of +1 (double).\r\n  |.endif\r\n  |.if \"func\" == \"trunc\"\r\n  |   mtc1 TMP0, f5\r\n  |  c.olt.d 0, FRET2, FRET1\t\t// |x| < result?\r\n  |   sub.d FRET2, FRET1, f4\r\n  |  movt.d FRET1, FRET2, 0\t\t// If yes, subtract +1.\r\n  |  neg.d FRET2, FRET1\r\n  |  jr ra\r\n  |.  movn.d FRET1, FRET2, AT\t\t// Merge sign bit back in.\r\n  |.else\r\n  |  neg.d FRET2, FRET1\r\n  |   mtc1 TMP0, f5\r\n  |  movn.d FRET1, FRET2, AT\t\t// Merge sign bit back in.\r\n  |.if \"func\" == \"ceil\"\r\n  |  c.olt.d 0, FRET1, FARG1\t\t// x > result?\r\n  |.else\r\n  |  c.olt.d 0, FARG1, FRET1\t\t// x < result?\r\n  |.endif\r\n  |   sub.d FRET2, FRET1, f4\t\t// If yes, subtract +-1.\r\n  |  jr ra\r\n  |.  movt.d FRET1, FRET2, 0\r\n  |.endif\r\n  |1:\r\n  |  jr ra\r\n  |.  mov.d FRET1, FARG1\r\n  |.endmacro\r\n  |\r\n  |->vm_floor:\r\n  |  vm_round floor\r\n  |->vm_ceil:\r\n  |  vm_round ceil\r\n  |->vm_trunc:\r\n  |.if JIT\r\n  |  vm_round trunc\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in r1, g in r2.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs\r\n  |  lw CTSTATE, GL:r2->ctype_state\r\n  |   addiu DISPATCH, r2, GG_G2DISP\r\n  |  load_got lj_ccallback_enter\r\n  |  sw r1, CTSTATE->cb.slot\r\n  |  sw CARG1, CTSTATE->cb.gpr[0]\r\n  |  sw CARG2, CTSTATE->cb.gpr[1]\r\n  |   sdc1 FARG1, CTSTATE->cb.fpr[0]\r\n  |  sw CARG3, CTSTATE->cb.gpr[2]\r\n  |  sw CARG4, CTSTATE->cb.gpr[3]\r\n  |   sdc1 FARG2, CTSTATE->cb.fpr[1]\r\n  |  addiu TMP0, sp, CFRAME_SPACE+16\r\n  |  sw TMP0, CTSTATE->cb.stack\r\n  |  sw r0, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   move CARG2, sp\r\n  |  call_intern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |.  move CARG1, CTSTATE\r\n  |  // Returns lua_State *.\r\n  |  lw BASE, L:CRET1->base\r\n  |  lw RC, L:CRET1->top\r\n  |   move L, CRET1\r\n  |     lui TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n  |     mtc1 TMP3, TOBIT\r\n  |    li_vmstate INTERP\r\n  |     li TISNIL, LJ_TNIL\r\n  |  subu RC, RC, BASE\r\n  |    st_vmstate\r\n  |     cvt.d.s TOBIT, TOBIT\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  load_got lj_ccallback_leave\r\n  |  lw CTSTATE, DISPATCH_GL(ctype_state)(DISPATCH)\r\n  |   sw BASE, L->base\r\n  |   sw RB, L->top\r\n  |  sw L, CTSTATE->L\r\n  |  move CARG2, RA\r\n  |  call_intern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |.  move CARG1, CTSTATE\r\n  |  lw CRET1, CTSTATE->cb.gpr[0]\r\n  |   ldc1 FRET1, CTSTATE->cb.fpr[0]\r\n  |  lw CRET2, CTSTATE->cb.gpr[1]\r\n  |  b ->vm_leave_unw\r\n  |.  ldc1 FRET2, CTSTATE->cb.fpr[1]\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, CARG1\r\n  |  lw TMP1, CCSTATE->spadj\r\n  |   lbu CARG2, CCSTATE->nsp\r\n  |  move TMP2, sp\r\n  |  subu sp, sp, TMP1\r\n  |  sw ra, -4(TMP2)\r\n  |   sll CARG2, CARG2, 2\r\n  |  sw r16, -8(TMP2)\r\n  |  sw CCSTATE, -12(TMP2)\r\n  |  move r16, TMP2\r\n  |  addiu TMP1, CCSTATE, offsetof(CCallState, stack)\r\n  |  addiu TMP2, sp, 16\r\n  |  beqz CARG2, >2\r\n  |.  addu TMP3, TMP1, CARG2\r\n  |1:\r\n  |   lw TMP0, 0(TMP1)\r\n  |  addiu TMP1, TMP1, 4\r\n  |  sltu AT, TMP1, TMP3\r\n  |   sw TMP0, 0(TMP2)\r\n  |  bnez AT, <1\r\n  |.  addiu TMP2, TMP2, 4\r\n  |2:\r\n  |  lw CFUNCADDR, CCSTATE->func\r\n  |  lw CARG2, CCSTATE->gpr[1]\r\n  |  lw CARG3, CCSTATE->gpr[2]\r\n  |  lw CARG4, CCSTATE->gpr[3]\r\n  |  ldc1 FARG1, CCSTATE->fpr[0]\r\n  |  ldc1 FARG2, CCSTATE->fpr[1]\r\n  |  jalr CFUNCADDR\r\n  |.  lw CARG1, CCSTATE->gpr[0]\t\t// Do this last, since CCSTATE is CARG1.\r\n  |  lw CCSTATE:TMP1, -12(r16)\r\n  |  lw TMP2, -8(r16)\r\n  |  lw ra, -4(r16)\r\n  |  sw CRET1, CCSTATE:TMP1->gpr[0]\r\n  |  sw CRET2, CCSTATE:TMP1->gpr[1]\r\n  |  sdc1 FRET1, CCSTATE:TMP1->fpr[0]\r\n  |  sdc1 FRET2, CCSTATE:TMP1->fpr[1]\r\n  |  move sp, r16\r\n  |  jr ra\r\n  |.  move r16, TMP2\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  addu CARG2, BASE, RA\r\n    |   addu CARG3, BASE, RD\r\n    |  lw TMP0, HI(CARG2)\r\n    |   lw TMP1, HI(CARG3)\r\n    |   ldc1 f0, 0(CARG2)\r\n    |   ldc1 f2, 0(CARG3)\r\n    |  sltiu TMP0, TMP0, LJ_TISNUM\r\n    |   sltiu TMP1, TMP1, LJ_TISNUM\r\n    |    lhu TMP2, OFS_RD(PC)\r\n    |  and TMP0, TMP0, TMP1\r\n    |    addiu PC, PC, 4\r\n    |  beqz TMP0, ->vmeta_comp\r\n    |.   lui TMP1, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |    decode_RD4b TMP2\r\n    |    addu TMP2, TMP2, TMP1\r\n    if (op == BC_ISLT || op == BC_ISGE) {\r\n      |  c.olt.d f0, f2\r\n    } else {\r\n      |  c.ole.d f0, f2\r\n    }\r\n    if (op == BC_ISLT || op == BC_ISLE) {\r\n      |  movf TMP2, r0\r\n    } else {\r\n      |  movt TMP2, r0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   ldc1 f0, 0(RA)\r\n    |  addu RD, BASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |   lw TMP1, HI(RD)\r\n    |   ldc1 f2, 0(RD)\r\n    |    lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |  sltiu CARG1, TMP1, LJ_TISNUM\r\n    |    decode_RD4b TMP2\r\n    |  and AT, AT, CARG1\r\n    |  beqz AT, >5\r\n    |.   addu TMP2, TMP2, TMP3\r\n    |  c.eq.d f0, f2\r\n    if (vk) {\r\n      |  movf TMP2, r0\r\n    } else {\r\n      |  movt TMP2, r0\r\n    }\r\n    |1:\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    |5:  // Either or both types are not numbers.\r\n    |  lw CARG2, LO(RA)\r\n    |  lw CARG3, LO(RD)\r\n    |.if FFI\r\n    |  li TMP3, LJ_TCDATA\r\n    |  beq TMP0, TMP3, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  sltiu AT, TMP0, LJ_TISPRI\t\t// Not a primitive?\r\n    |.if FFI\r\n    |  beq TMP1, TMP3, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  xor TMP3, CARG2, CARG3\t\t\t// Same tv?\r\n    |  xor TMP1, TMP1, TMP0\t\t\t// Same type?\r\n    |  sltiu CARG1, TMP0, LJ_TISTABUD+1\t\t// Table or userdata?\r\n    |  movz TMP3, r0, AT\t\t\t// Ignore tv if primitive.\r\n    |  movn CARG1, r0, TMP1\t\t\t// Tab/ud and same type?\r\n    |  or AT, TMP1, TMP3\t\t\t// Same type && (pri||same tv).\r\n    |  movz CARG1, r0, AT\r\n    |  beqz CARG1, <1\t// Done if not tab/ud or not same type or same tv.\r\n    if (vk) {\r\n      |.  movn TMP2, r0, AT\r\n    } else {\r\n      |.  movz TMP2, r0, AT\r\n    }\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  lw TAB:TMP1, TAB:CARG2->metatable\r\n    |  beqz TAB:TMP1, <1\t\t// No metatable?\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP1->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_eq\r\n    |  bnez TMP1, <1\t\t\t// Or 'no __eq' flag set?\r\n    |.  nop\r\n    |  b ->vmeta_equal\t\t\t// Handle __eq metamethod.\r\n    |.  li CARG4, 1-vk\t\t\t// ne = 0 or 1.\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RD = str_const*8 (~), JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   srl RD, RD, 1\r\n    |  lw STR:TMP3, LO(RA)\r\n    |   subu RD, KBASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |.if FFI\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  lw STR:TMP1, -4(RD)\t\t// KBASE-4-str_const*4\r\n    |  addiu TMP0, TMP0, -LJ_TSTR\r\n    |   decode_RD4b TMP2\r\n    |  xor TMP1, STR:TMP1, STR:TMP3\r\n    |  or TMP0, TMP0, TMP1\r\n    |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |   addu TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  movn TMP2, r0, TMP0\r\n    } else {\r\n      |  movz TMP2, r0, TMP0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RD = num_const*8, JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   addiu PC, PC, 4\r\n    |  lw TMP0, HI(RA)\r\n    |   ldc1 f0, 0(RA)\r\n    |  addu RD, KBASE, RD\r\n    |    lhu TMP2, -4+OFS_RD(PC)\r\n    |   ldc1 f2, 0(RD)\r\n    |    lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |    decode_RD4b TMP2\r\n    |.if FFI\r\n    |  beqz AT, >5\r\n    |.else\r\n    |  beqz AT, >1\r\n    |.endif\r\n    |.   addu TMP2, TMP2, TMP3\r\n    |   c.eq.d f0, f2\r\n    if (vk) {\r\n      |  movf TMP2, r0\r\n      |  addu PC, PC, TMP2\r\n      |1:\r\n    } else {\r\n      |  movt TMP2, r0\r\n      |1:\r\n      |  addu PC, PC, TMP2\r\n    }\r\n    |  ins_next\r\n    |.if FFI\r\n    |5:\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.  nop\r\n    |  b <1\r\n    |.  nop\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RD = primitive_type*8 (~), JMP with RD = target\r\n    |  addu RA, BASE, RA\r\n    |   srl TMP1, RD, 3\r\n    |  lw TMP0, HI(RA)\r\n    |    lhu TMP2, OFS_RD(PC)\r\n    |   not TMP1, TMP1\r\n    |    addiu PC, PC, 4\r\n    |.if FFI\r\n    |  li AT, LJ_TCDATA\r\n    |  beq TMP0, AT, ->vmeta_equal_cd\r\n    |.endif\r\n    |.  xor TMP0, TMP0, TMP1\r\n    |  decode_RD4b TMP2\r\n    |  lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  addu TMP2, TMP2, TMP3\r\n    if (vk) {\r\n      |  movn TMP2, r0, TMP0\r\n    } else {\r\n      |  movz TMP2, r0, TMP0\r\n    }\r\n    |  addu PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RD = src*8, JMP with RD = target\r\n    |  addu RD, BASE, RD\r\n    |   lhu TMP2, OFS_RD(PC)\r\n    |  lw TMP0, HI(RD)\r\n    |   addiu PC, PC, 4\r\n    if (op == BC_IST || op == BC_ISF) {\r\n      |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n      |   decode_RD4b TMP2\r\n      |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n      |   addu TMP2, TMP2, TMP3\r\n      if (op == BC_IST) {\r\n\t|  movz TMP2, r0, TMP0\r\n      } else {\r\n\t|  movn TMP2, r0, TMP0\r\n      }\r\n      |  addu PC, PC, TMP2\r\n    } else {\r\n      |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n      |  ldc1 f0, 0(RD)\r\n      if (op == BC_ISTC) {\r\n\t|  beqz TMP0, >1\r\n      } else {\r\n\t|  bnez TMP0, >1\r\n      }\r\n      |.  addu RA, BASE, RA\r\n      |   decode_RD4b TMP2\r\n      |   lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n      |   addu TMP2, TMP2, TMP3\r\n      |  sdc1 f0, 0(RA)\r\n      |   addu PC, PC, TMP2\r\n      |1:\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  // RA = src*8, RD = -type*8\r\n    |  addu TMP2, BASE, RA\r\n    |  srl TMP1, RD, 3\r\n    |  lw TMP0, HI(TMP2)\r\n    |  ins_next1\r\n    |  addu AT, TMP0, TMP1\r\n    |  bnez AT, ->vmeta_istype\r\n    |.  ins_next2\r\n    break;\r\n  case BC_ISNUM:\r\n    |  // RA = src*8, RD = -(TISNUM-1)*8\r\n    |  addu TMP2, BASE, RA\r\n    |  lw TMP0, HI(TMP2)\r\n    |  ins_next1\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |  beqz AT, ->vmeta_istype\r\n    |.  ins_next2\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu RD, BASE, RD\r\n    |  addu RA, BASE, RA\r\n    |  ldc1 f0, 0(RD)\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu RD, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(RD)\r\n    |   li TMP1, LJ_TFALSE\r\n    |  sltiu TMP0, TMP0, LJ_TISTRUECOND\r\n    |  addiu TMP1, TMP0, LJ_TTRUE\r\n    |  ins_next1\r\n    |  sw TMP1, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu CARG3, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(CARG3)\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  sltiu AT, TMP0, LJ_TISNUM\r\n    |  beqz AT, ->vmeta_unm\r\n    |.  neg.d f0, f0\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  addu CARG2, BASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  lw TMP0, HI(CARG2)\r\n    |   lw CARG1, LO(CARG2)\r\n    |  li AT, LJ_TSTR\r\n    |  bne TMP0, AT, >2\r\n    |.  li AT, LJ_TTAB\r\n    |  lw CRET1, STR:CARG1->len\r\n    |1:\r\n    |  mtc1 CRET1, f0\r\n    |  cvt.d.w f0, f0\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |2:\r\n    |  bne TMP0, AT, ->vmeta_len\r\n    |.  nop\r\n#if LJ_52\r\n    |  lw TAB:TMP2, TAB:CARG1->metatable\r\n    |  bnez TAB:TMP2, >9\r\n    |.  nop\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  load_got lj_tab_len\r\n    |  call_intern lj_tab_len\t\t// (GCtab *t)\r\n    |.  nop\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n    |.  nop\r\n#if LJ_52\r\n    |9:\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_len\r\n    |  bnez TMP0, <3\t\t\t// 'no __len' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_len\r\n    |.  nop\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   addu CARG3, BASE, RB\r\n    |    addu CARG4, KBASE, RC\r\n    |   lw TMP1, HI(CARG3)\r\n    |   ldc1 f20, 0(CARG3)\r\n    |    ldc1 f22, 0(CARG4)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    ||  break;\r\n    ||case 1:\r\n    |   addu CARG4, BASE, RB\r\n    |    addu CARG3, KBASE, RC\r\n    |   lw TMP1, HI(CARG4)\r\n    |   ldc1 f22, 0(CARG4)\r\n    |    ldc1 f20, 0(CARG3)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    ||  break;\r\n    ||default:\r\n    |   addu CARG3, BASE, RB\r\n    |    addu CARG4, BASE, RC\r\n    |   lw TMP1, HI(CARG3)\r\n    |    lw TMP2, HI(CARG4)\r\n    |   ldc1 f20, 0(CARG3)\r\n    |    ldc1 f22, 0(CARG4)\r\n    |   sltiu AT, TMP1, LJ_TISNUM\r\n    |   sltiu TMP0, TMP2, LJ_TISNUM\r\n    |   and AT, AT, TMP0\r\n    ||  break;\r\n    ||}\r\n    |  beqz AT, ->vmeta_arith\r\n    |.  addu RA, BASE, RA\r\n    |.endmacro\r\n    |\r\n    |.macro fpmod, a, b, c\r\n    |->BC_MODVN_Z:\r\n    |  bal ->vm_floor\t\t\t// floor(b/c)\r\n    |.  div.d FARG1, b, c\r\n    |  mul.d a, FRET1, c\r\n    |  sub.d a, b, a\t\t\t// b - floor(b/c)*c\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, ins\r\n    |  ins_arithpre\r\n    |.if \"ins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.  nop\r\n    |.else\r\n    |  ins f0, f20, f22\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith add.d\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith sub.d\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith mul.d\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith div.d\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arith fpmod\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arith fpmod_\r\n    break;\r\n  case BC_POW:\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG3, BASE, RB\r\n    |   addu CARG4, BASE, RC\r\n    |  lw TMP1, HI(CARG3)\r\n    |   lw TMP2, HI(CARG4)\r\n    |  ldc1 FARG1, 0(CARG3)\r\n    |   ldc1 FARG2, 0(CARG4)\r\n    |  sltiu AT, TMP1, LJ_TISNUM\r\n    |  sltiu TMP0, TMP2, LJ_TISNUM\r\n    |  and AT, AT, TMP0\r\n    |  load_got pow\r\n    |  beqz AT, ->vmeta_arith\r\n    |.  addu RA, BASE, RA\r\n    |  call_extern\r\n    |.  nop\r\n    |  ins_next1\r\n    |  sdc1 FRET1, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  // RA = dst*8, RB = src_start*8, RC = src_end*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  subu CARG3, RC, RB\r\n    |   sw BASE, L->base\r\n    |  addu CARG2, BASE, RC\r\n    |  move MULTRES, RB\r\n    |->BC_CAT_Z:\r\n    |  load_got lj_meta_cat\r\n    |  srl CARG3, CARG3, 3\r\n    |   sw PC, SAVE_PC\r\n    |  call_intern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |.  move CARG1, L\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  bnez CRET1, ->vmeta_binop\r\n    |.  lw BASE, L->base\r\n    |  addu RB, BASE, MULTRES\r\n    |  ldc1 f0, 0(RB)\r\n    |   addu RA, BASE, RA\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\t\t\t// Copy result from RB to RA.\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n    |  srl TMP1, RD, 1\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  ins_next1\r\n    |  lw TMP0, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    |  addu RA, BASE, RA\r\n    |   li TMP2, LJ_TSTR\r\n    |  sw TMP0, LO(RA)\r\n    |   sw TMP2, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RD = cdata_const*8 (~)\r\n    |  srl TMP1, RD, 1\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  ins_next1\r\n    |  lw TMP0, -4(TMP1)\t\t// KBASE-4-cdata_const*4\r\n    |  addu RA, BASE, RA\r\n    |   li TMP2, LJ_TCDATA\r\n    |  sw TMP0, LO(RA)\r\n    |   sw TMP2, HI(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, RD = int16_literal*8\r\n    |  sra RD, INS, 16\r\n    |  mtc1 RD, f0\r\n    |  addu RA, BASE, RA\r\n    |  cvt.d.w f0, f0\r\n    |  ins_next1\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RD = num_const*8\r\n    |  addu RD, KBASE, RD\r\n    |   addu RA, BASE, RA\r\n    |  ldc1 f0, 0(RD)\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RD = primitive_type*8 (~)\r\n    |  srl TMP1, RD, 3\r\n    |   addu RA, BASE, RA\r\n    |  not TMP0, TMP1\r\n    |  ins_next1\r\n    |   sw TMP0, HI(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RD = end*8\r\n    |  addu RA, BASE, RA\r\n    |  sw TISNIL, HI(RA)\r\n    |   addiu RA, RA, 8\r\n    |  addu RD, BASE, RD\r\n    |1:\r\n    |  sw TISNIL, HI(RA)\r\n    |  slt AT, RA, RD\r\n    |  bnez AT, <1\r\n    |.  addiu RA, RA, 8\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RD = uvnum*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RD, RD, 1\r\n    |   addu RD, RD, LFUNC:RB\r\n    |  lw UPVAL:RB, LFUNC:RD->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  ldc1 f0, 0(TMP1)\r\n    |  addu RA, BASE, RA\r\n    |  sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RD = src*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srl RA, RA, 1\r\n    |   addu RD, BASE, RD\r\n    |    addu RA, RA, LFUNC:RB\r\n    |   ldc1 f0, 0(RD)\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  lbu TMP3, UPVAL:RB->marked\r\n    |   lw CARG2, UPVAL:RB->v\r\n    |  andi TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |  lbu TMP0, UPVAL:RB->closed\r\n    |   lw TMP2, HI(RD)\r\n    |   sdc1 f0, 0(CARG2)\r\n    |  li AT, LJ_GC_BLACK|1\r\n    |  or TMP3, TMP3, TMP0\r\n    |  beq TMP3, AT, >2\t\t\t// Upvalue is closed and black?\r\n    |.  addiu TMP2, TMP2, -(LJ_TNUMX+1)\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  sltiu AT, TMP2, LJ_TISGCV - (LJ_TNUMX+1)\r\n    |  beqz AT, <1\t\t\t// tvisgcv(v)\r\n    |.  lw TMP1, LO(RD)\r\n    |  lbu TMP3, GCOBJ:TMP1->gch.marked\r\n    |  andi TMP3, TMP3, LJ_GC_WHITES\t// iswhite(v)\r\n    |  beqz TMP3, <1\r\n    |.  load_got lj_gc_barrieruv\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  call_intern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.  addiu CARG1, DISPATCH, GG_DISP2G\r\n    |  b <1\r\n    |.  nop\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RD = str_const*8 (~)\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srl RA, RA, 1\r\n    |   srl TMP1, RD, 1\r\n    |    addu RA, RA, LFUNC:RB\r\n    |   subu TMP1, KBASE, TMP1\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |   lw STR:TMP1, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    |  lbu TMP2, UPVAL:RB->marked\r\n    |   lw CARG2, UPVAL:RB->v\r\n    |   lbu TMP3, STR:TMP1->marked\r\n    |  andi AT, TMP2, LJ_GC_BLACK\t// isblack(uv)\r\n    |   lbu TMP2, UPVAL:RB->closed\r\n    |   li TMP0, LJ_TSTR\r\n    |   sw STR:TMP1, LO(CARG2)\r\n    |  bnez AT, >2\r\n    |.  sw TMP0, HI(CARG2)\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  beqz TMP2, <1\r\n    |.  andi AT, TMP3, LJ_GC_WHITES\t// iswhite(str)\r\n    |  beqz AT, <1\r\n    |.  load_got lj_gc_barrieruv\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  call_intern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |.  addiu CARG1, DISPATCH, GG_DISP2G\r\n    |  b <1\r\n    |.  nop\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RD = num_const*8\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RA, RA, 1\r\n    |    addu RD, KBASE, RD\r\n    |   addu RA, RA, LFUNC:RB\r\n    |    ldc1 f0, 0(RD)\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  sdc1 f0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RD = primitive_type*8 (~)\r\n    |  lw LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srl RA, RA, 1\r\n    |    srl TMP0, RD, 3\r\n    |   addu RA, RA, LFUNC:RB\r\n    |    not TMP0, TMP0\r\n    |  lw UPVAL:RB, LFUNC:RA->uvptr\r\n    |  ins_next1\r\n    |  lw TMP1, UPVAL:RB->v\r\n    |  sw TMP0, HI(TMP1)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RD = target\r\n    |  lw TMP2, L->openupval\r\n    |  branch_RD\t\t\t// Do this first since RD is not saved.\r\n    |  load_got lj_func_closeuv\r\n    |   sw BASE, L->base\r\n    |  beqz TMP2, >1\r\n    |.  move CARG1, L\r\n    |  call_intern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |.  addu CARG2, BASE, RA\r\n    |  lw BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RD = proto_const*8 (~) (holding function prototype)\r\n    |  srl TMP1, RD, 1\r\n    |  load_got lj_func_newL_gc\r\n    |  subu TMP1, KBASE, TMP1\r\n    |  lw CARG3, FRAME_FUNC(BASE)\r\n    |  lw CARG2, -4(TMP1)\t\t// KBASE-4-tab_const*4\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  call_intern lj_func_newL_gc\r\n    |.  move CARG1, L\r\n    |  // Returns GCfuncL *.\r\n    |  lw BASE, L->base\r\n    |   li TMP0, LJ_TFUNC\r\n    |  ins_next1\r\n    |  addu RA, BASE, RA\r\n    |  sw TMP0, HI(RA)\r\n    |  sw LFUNC:CRET1, LO(RA)\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RD = (hbits|asize)*8 | tab_const*8 (~)\r\n    |  lw TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n    |  lw TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  load_got lj_tab_new\r\n      |  srl CARG2, RD, 3\r\n      |  andi CARG2, CARG2, 0x7ff\r\n      |  li TMP0, 0x801\r\n      |  addiu AT, CARG2, -0x7ff\r\n      |   srl CARG3, RD, 14\r\n      |  movz CARG2, TMP0, AT\r\n      |  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  call_intern lj_tab_new\r\n      |.  move CARG1, L\r\n      |  // Returns Table *.\r\n    } else {\r\n      |  load_got lj_tab_dup\r\n      |  srl TMP1, RD, 1\r\n      |  subu TMP1, KBASE, TMP1\r\n      |  move CARG1, L\r\n      |  call_intern lj_tab_dup\t\t// (lua_State *L, Table *kt)\r\n      |.  lw CARG2, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n      |  // Returns Table *.\r\n    }\r\n    |  lw BASE, L->base\r\n    |  ins_next1\r\n    |  addu RA, BASE, RA\r\n    |   li TMP0, LJ_TTAB\r\n    |  sw TAB:CRET1, LO(RA)\r\n    |   sw TMP0, HI(RA)\r\n    |  ins_next2\r\n    |5:\r\n    |  load_got lj_gc_step_fixtop\r\n    |  move MULTRES, RD\r\n    |  call_intern lj_gc_step_fixtop\t// (lua_State *L)\r\n    |.  move CARG1, L\r\n    |  b <1\r\n    |.  move RD, MULTRES\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n  case BC_GSET:\r\n    |  // RA = src*8, RD = str_const*8 (~)\r\n    |  lw LFUNC:TMP2, FRAME_FUNC(BASE)\r\n    |   srl TMP1, RD, 1\r\n    |   subu TMP1, KBASE, TMP1\r\n    |  lw TAB:RB, LFUNC:TMP2->env\r\n    |  lw STR:RC, -4(TMP1)\t\t// KBASE-4-str_const*4\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    |.  addu RA, BASE, RA\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG2, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |  lw TMP1, HI(CARG2)\r\n    |   lw TMP2, HI(CARG3)\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  bne TMP1, AT, ->vmeta_tgetv\r\n    |.  addu RA, BASE, RA\r\n    |  sltiu AT, TMP2, LJ_TISNUM\r\n    |  beqz AT, >5\r\n    |.  li AT, LJ_TSTR\r\n    |\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  cvt.w.d f2, f0\r\n    |   lw TMP0, TAB:RB->asize\r\n    |  mfc1 TMP2, f2\r\n    |  cvt.d.w f4, f2\r\n    |   lw TMP1, TAB:RB->array\r\n    |  c.eq.d f0, f4\r\n    |  sltu AT, TMP2, TMP0\r\n    |  movf AT, r0\r\n    |   sll TMP2, TMP2, 3\r\n    |  beqz AT, ->vmeta_tgetv\t\t// Integer key and in array part?\r\n    |.  addu TMP2, TMP1, TMP2\r\n    |  lw TMP0, HI(TMP2)\r\n    |  beq TMP0, TISNIL, >2\r\n    |.  ldc1 f0, 0(TMP2)\r\n    |1:\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_index\r\n    |  bnez TMP0, <1\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgetv\r\n    |.  nop\r\n    |\r\n    |5:\r\n    |  bne TMP2, AT, ->vmeta_tgetv\r\n    |.  lw STR:RC, LO(CARG3)\r\n    |  b ->BC_TGETS_Z\t\t\t// String key?\r\n    |.  nop\r\n    break;\r\n  case BC_TGETS:\r\n    |  // RA = dst*8, RB = table*8, RC = str_const*4 (~)\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RC4a RC, INS\r\n    |  lw TMP0, HI(CARG2)\r\n    |   decode_RC4b RC\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   subu CARG3, KBASE, RC\r\n    |   lw STR:RC, -4(CARG3)\t\t// KBASE-4-str_const*4\r\n    |  bne TMP0, AT, ->vmeta_tgets1\r\n    |.  addu RA, BASE, RA\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  lw TMP0, TAB:RB->hmask\r\n    |  lw TMP1, STR:RC->hash\r\n    |  lw NODE:TMP2, TAB:RB->node\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  sll TMP0, TMP1, 5\r\n    |  sll TMP1, TMP1, 3\r\n    |  subu TMP1, TMP0, TMP1\r\n    |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lw CARG1, offsetof(Node, key)+HI(NODE:TMP2)\r\n    |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n    |    lw NODE:TMP1, NODE:TMP2->next\r\n    |    lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n    |  addiu CARG1, CARG1, -LJ_TSTR\r\n    |   xor TMP0, TMP0, STR:RC\r\n    |  or AT, CARG1, TMP0\r\n    |  bnez AT, >4\r\n    |.  lw TAB:TMP3, TAB:RB->metatable\r\n    |    beq CARG2, TISNIL, >5\t\t// Key found, but nil value?\r\n    |.    lw CARG1, offsetof(Node, val)+LO(NODE:TMP2)\r\n    |3:\r\n    |  ins_next1\r\n    |    sw CARG2, HI(RA)\r\n    |     sw CARG1, LO(RA)\r\n    |  ins_next2\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  bnez NODE:TMP1, <1\r\n    |.  move NODE:TMP2, NODE:TMP1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  beqz TAB:TMP3, <3\t\t// No metatable: done.\r\n    |.  li CARG2, LJ_TNIL\r\n    |  lbu TMP0, TAB:TMP3->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_index\r\n    |  bnez TMP0, <3\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgets\r\n    |.  nop\r\n    break;\r\n  case BC_TGETB:\r\n    |  // RA = dst*8, RB = table*8, RC = index*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  lw CARG1, HI(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   addu RA, BASE, RA\r\n    |  bne CARG1, AT, ->vmeta_tgetb\r\n    |.  srl TMP0, RC, 3\r\n    |  lw TMP1, TAB:RB->asize\r\n    |   lw TMP2, TAB:RB->array\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, ->vmeta_tgetb\r\n    |.  addu RC, TMP2, RC\r\n    |  lw TMP1, HI(RC)\r\n    |  beq TMP1, TISNIL, >5\r\n    |.  ldc1 f0, 0(RC)\r\n    |1:\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP2->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_index\r\n    |  bnez TMP1, <1\t\t\t// 'no __index' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tgetb\t\t\t// Caveat: preserve TMP0!\r\n    |.  nop\r\n    break;\r\n  case BC_TGETR:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG2, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |    lw TAB:CARG1, LO(CARG2)\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  trunc.w.d f2, f0\r\n    |   lw TMP0, TAB:CARG1->asize\r\n    |  mfc1 CARG2, f2\r\n    |   lw TMP1, TAB:CARG1->array\r\n    |  sltu AT, CARG2, TMP0\r\n    |   sll TMP2, CARG2, 3\r\n    |  beqz AT, ->vmeta_tgetr\t\t// In array part?\r\n    |.  addu TMP2, TMP1, TMP2\r\n    |   ldc1 f0, 0(TMP2)\r\n    |->BC_TGETR_Z:\r\n    |   addu RA, BASE, RA\r\n    |  ins_next1\r\n    |   sdc1 f0, 0(RA)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG2, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |  lw TMP1, HI(CARG2)\r\n    |   lw TMP2, HI(CARG3)\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  bne TMP1, AT, ->vmeta_tsetv\r\n    |.  addu RA, BASE, RA\r\n    |  sltiu AT, TMP2, LJ_TISNUM\r\n    |  beqz AT, >5\r\n    |.  li AT, LJ_TSTR\r\n    |\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  cvt.w.d f2, f0\r\n    |   lw TMP0, TAB:RB->asize\r\n    |  mfc1 TMP2, f2\r\n    |  cvt.d.w f4, f2\r\n    |   lw TMP1, TAB:RB->array\r\n    |  c.eq.d f0, f4\r\n    |  sltu AT, TMP2, TMP0\r\n    |  movf AT, r0\r\n    |   sll TMP2, TMP2, 3\r\n    |  beqz AT, ->vmeta_tsetv\t\t// Integer key and in array part?\r\n    |.  addu TMP1, TMP1, TMP2\r\n    |   lbu TMP3, TAB:RB->marked\r\n    |  lw TMP0, HI(TMP1)\r\n    |  beq TMP0, TISNIL, >3\r\n    |.  ldc1 f0, 0(RA)\r\n    |1:\r\n    |   andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   bnez AT, >7\r\n    |.  sdc1 f0, 0(TMP1)\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP2, TAB:TMP2->nomm\r\n    |  andi TMP2, TMP2, 1<<MM_newindex\r\n    |  bnez TMP2, <1\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsetv\r\n    |.  nop\r\n    |\r\n    |5:\r\n    |  bne TMP2, AT, ->vmeta_tsetv\r\n    |.  lw STR:RC, LO(CARG3)\r\n    |  b ->BC_TSETS_Z\t\t\t// String key?\r\n    |.  nop\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  // RA = src*8, RB = table*8, RC = str_const*8 (~)\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RC4a RC, INS\r\n    |  lw TMP0, HI(CARG2)\r\n    |   decode_RC4b RC\r\n    |  li AT, LJ_TTAB\r\n    |   subu CARG3, KBASE, RC\r\n    |    lw TAB:RB, LO(CARG2)\r\n    |   lw STR:RC, -4(CARG3)\t\t// KBASE-4-str_const*4\r\n    |  bne TMP0, AT, ->vmeta_tsets1\r\n    |.  addu RA, BASE, RA\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = BASE+src*8\r\n    |  lw TMP0, TAB:RB->hmask\r\n    |  lw TMP1, STR:RC->hash\r\n    |  lw NODE:TMP2, TAB:RB->node\r\n    |   sb r0, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  sll TMP0, TMP1, 5\r\n    |  sll TMP1, TMP1, 3\r\n    |  subu TMP1, TMP0, TMP1\r\n    |  addu NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |   ldc1 f20, 0(RA)\r\n    |1:\r\n    |  lw CARG1, offsetof(Node, key)+HI(NODE:TMP2)\r\n    |   lw TMP0, offsetof(Node, key)+LO(NODE:TMP2)\r\n    |  li AT, LJ_TSTR\r\n    |    lw NODE:TMP1, NODE:TMP2->next\r\n    |  bne CARG1, AT, >5\r\n    |.   lw CARG2, offsetof(Node, val)+HI(NODE:TMP2)\r\n    |   bne TMP0, STR:RC, >5\r\n    |.    lbu TMP3, TAB:RB->marked\r\n    |    beq CARG2, TISNIL, >4\t\t// Key found, but nil value?\r\n    |.    lw TAB:TMP0, TAB:RB->metatable\r\n    |2:\r\n    |  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bnez AT, >7\r\n    |.  sdc1 f20, NODE:TMP2->val\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  beqz TAB:TMP0, <2\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP0, TAB:TMP0->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_newindex\r\n    |  bnez TMP0, <2\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsets\r\n    |.  nop\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  bnez NODE:TMP1, <1\r\n    |.  move NODE:TMP2, NODE:TMP1\r\n    |  // End of hash chain: key not found, add a new one\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, >6\t\t// No metatable: continue.\r\n    |.  addiu CARG3, DISPATCH, DISPATCH_GL(tmptv)\r\n    |  lbu TMP0, TAB:TMP2->nomm\r\n    |  andi TMP0, TMP0, 1<<MM_newindex\r\n    |  beqz TMP0, ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |.  li AT, LJ_TSTR\r\n    |6:\r\n    |  load_got lj_tab_newkey\r\n    |  sw STR:RC, LO(CARG3)\r\n    |  sw AT, HI(CARG3)\r\n    |   sw BASE, L->base\r\n    |  move CARG2, TAB:RB\r\n    |   sw PC, SAVE_PC\r\n    |  call_intern lj_tab_newkey\t// (lua_State *L, GCtab *t, TValue *k\r\n    |.  move CARG1, L\r\n    |  // Returns TValue *.\r\n    |  lw BASE, L->base\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |.  sdc1 f20, 0(CRET1)\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  // RA = src*8, RB = table*8, RC = index*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |  addu CARG2, BASE, RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  lw CARG1, HI(CARG2)\r\n    |  li AT, LJ_TTAB\r\n    |   lw TAB:RB, LO(CARG2)\r\n    |   addu RA, BASE, RA\r\n    |  bne CARG1, AT, ->vmeta_tsetb\r\n    |.  srl TMP0, RC, 3\r\n    |  lw TMP1, TAB:RB->asize\r\n    |   lw TMP2, TAB:RB->array\r\n    |  sltu AT, TMP0, TMP1\r\n    |  beqz AT, ->vmeta_tsetb\r\n    |.  addu RC, TMP2, RC\r\n    |  lw TMP1, HI(RC)\r\n    |   lbu TMP3, TAB:RB->marked\r\n    |  beq TMP1, TISNIL, >5\r\n    |.  ldc1 f0, 0(RA)\r\n    |1:\r\n    |  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bnez AT, >7\r\n    |.  sdc1 f0, 0(RC)\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  lw TAB:TMP2, TAB:RB->metatable\r\n    |  beqz TAB:TMP2, <1\t\t// No metatable: done.\r\n    |.  nop\r\n    |  lbu TMP1, TAB:TMP2->nomm\r\n    |  andi TMP1, TMP1, 1<<MM_newindex\r\n    |  bnez TMP1, <1\t\t\t// 'no __newindex' flag set: done.\r\n    |.  nop\r\n    |  b ->vmeta_tsetb\t\t\t// Caveat: preserve TMP0!\r\n    |.  nop\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  decode_RB8a RB, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RDtoRC8 RC, RD\r\n    |  addu CARG1, BASE, RB\r\n    |   addu CARG3, BASE, RC\r\n    |    lw TAB:CARG2, LO(CARG1)\r\n    |   ldc1 f0, 0(CARG3)\r\n    |  trunc.w.d f2, f0\r\n    |    lbu TMP3, TAB:CARG2->marked\r\n    |   lw TMP0, TAB:CARG2->asize\r\n    |  mfc1 CARG3, f2\r\n    |   lw TMP1, TAB:CARG2->array\r\n    |  andi AT, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bnez AT, >7\r\n    |.  addu RA, BASE, RA\r\n    |2:\r\n    |  sltu AT, CARG3, TMP0\r\n    |   sll TMP2, CARG3, 3\r\n    |  beqz AT, ->vmeta_tsetr\t\t// In array part?\r\n    |.  ldc1 f20, 0(RA)\r\n    |   addu CRET1, TMP1, TMP2\r\n    |->BC_TSETR_Z:\r\n    |  ins_next1\r\n    |   sdc1 f20, 0(CRET1)\r\n    |  ins_next2\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0, <2\r\n    break;\r\n\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RD = num_const*8 (start index)\r\n    |  addu RA, BASE, RA\r\n    |1:\r\n    |   addu TMP3, KBASE, RD\r\n    |  lw TAB:CARG2, -8+LO(RA)\t\t// Guaranteed to be a table.\r\n    |    addiu TMP0, MULTRES, -8\r\n    |   lw TMP3, LO(TMP3)\t\t// Integer constant is in lo-word.\r\n    |    beqz TMP0, >4\t\t\t// Nothing to copy?\r\n    |.    srl CARG3, TMP0, 3\r\n    |  addu CARG3, CARG3, TMP3\r\n    |  lw TMP2, TAB:CARG2->asize\r\n    |   sll TMP1, TMP3, 3\r\n    |    lbu TMP3, TAB:CARG2->marked\r\n    |   lw CARG1, TAB:CARG2->array\r\n    |  sltu AT, TMP2, CARG3\r\n    |  bnez AT, >5\r\n    |.  addu TMP2, RA, TMP0\r\n    |   addu TMP1, TMP1, CARG1\r\n    |  andi TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |3:  // Copy result slots to table.\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  sltu AT, RA, TMP2\r\n    |   sdc1 f0, 0(TMP1)\r\n    |  bnez AT, <3\r\n    |.   addiu TMP1, TMP1, 8\r\n    |  bnez TMP0, >7\r\n    |. nop\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |  load_got lj_tab_reasize\r\n    |   sw BASE, L->base\r\n    |   sw PC, SAVE_PC\r\n    |  move BASE, RD\r\n    |  call_intern lj_tab_reasize\t// (lua_State *L, GCtab *t, int nasize)\r\n    |.  move CARG1, L\r\n    |  // Must not reallocate the stack.\r\n    |  move RD, BASE\r\n    |  b <1\r\n    |.  lw BASE, L->base\t// Reload BASE for lack of a saved register.\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP0, <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = extra_nargs*8\r\n    |  decode_RDtoRC8 NARGS8:RC, RD\r\n    |  b ->BC_CALL_Z\r\n    |.  addu NARGS8:RC, NARGS8:RC, MULTRES\r\n    break;\r\n  case BC_CALL:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = (nargs+1)*8\r\n    |  decode_RDtoRC8 NARGS8:RC, RD\r\n    |->BC_CALL_Z:\r\n    |  move TMP2, BASE\r\n    |  addu BASE, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP0, HI(BASE)\r\n    |   lw LFUNC:RB, LO(BASE)\r\n    |   addiu BASE, BASE, 8\r\n    |  bne TMP0, AT, ->vmeta_call\r\n    |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs*8\r\n    |  addu NARGS8:RD, NARGS8:RD, MULTRES\t// BC_CALLT gets RC from RD.\r\n    |  // Fall through. Assumes BC_CALLT follows.\r\n    break;\r\n  case BC_CALLT:\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |  addu RA, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP0, HI(RA)\r\n    |   lw LFUNC:RB, LO(RA)\r\n    |   move NARGS8:RC, RD\r\n    |    lw TMP1, FRAME_PC(BASE)\r\n    |   addiu RA, RA, 8\r\n    |  bne TMP0, AT, ->vmeta_callt\r\n    |.  addiu NARGS8:RC, NARGS8:RC, -8\r\n    |->BC_CALLT_Z:\r\n    |  andi TMP0, TMP1, FRAME_TYPE\t// Caveat: preserve TMP0 until the 'or'.\r\n    |   lbu TMP3, LFUNC:RB->ffid\r\n    |  bnez TMP0, >7\r\n    |.  xori TMP2, TMP1, FRAME_VARG\r\n    |1:\r\n    |  sw LFUNC:RB, FRAME_FUNC(BASE)\t// Copy function down, but keep PC.\r\n    |  sltiu AT, TMP3, 2\t\t// (> FF_C) Calling a fast function?\r\n    |  move TMP2, BASE\r\n    |  beqz NARGS8:RC, >3\r\n    |.  move TMP3, NARGS8:RC\r\n    |2:\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  addiu TMP3, TMP3, -8\r\n    |   sdc1 f0, 0(TMP2)\r\n    |  bnez TMP3, <2\r\n    |.   addiu TMP2, TMP2, 8\r\n    |3:\r\n    |  or TMP0, TMP0, AT\r\n    |  beqz TMP0, >5\r\n    |.  nop\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  lw INS, -4(TMP1)\r\n    |  decode_RA8a RA, INS\r\n    |  decode_RA8b RA\r\n    |  subu TMP1, BASE, RA\r\n    |  lw LFUNC:TMP1, -8+FRAME_FUNC(TMP1)\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  b <4\r\n    |.  lw KBASE, PC2PROTO(k)(TMP1)\t// Need to prepare KBASE.\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  andi AT, TMP2, FRAME_TYPEP\r\n    |  bnez AT, <1\t\t\t// Vararg frame below?\r\n    |.  subu TMP2, BASE, TMP2\t\t// Relocate BASE down.\r\n    |  move BASE, TMP2\r\n    |  lw TMP1, FRAME_PC(TMP2)\r\n    |  b <1\r\n    |.  andi TMP0, TMP1, FRAME_TYPE\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 ((2+1)*8))\r\n    |  move TMP2, BASE\r\n    |  addu BASE, BASE, RA\r\n    |   li AT, LJ_TFUNC\r\n    |  lw TMP1, -24+HI(BASE)\r\n    |   lw LFUNC:RB, -24+LO(BASE)\r\n    |    ldc1 f2, -8(BASE)\r\n    |    ldc1 f0, -16(BASE)\r\n    |  sw TMP1, HI(BASE)\t\t// Copy callable.\r\n    |   sw LFUNC:RB, LO(BASE)\r\n    |    sdc1 f2, 16(BASE)\t\t// Copy control var.\r\n    |    sdc1 f0, 8(BASE)\t\t// Copy state.\r\n    |   addiu BASE, BASE, 8\r\n    |  bne TMP1, AT, ->vmeta_call\r\n    |.  li NARGS8:RC, 16\t\t// Iterators get 2 arguments.\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 (2+1)*8)\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  addu RA, BASE, RA\r\n    |  lw TAB:RB, -16+LO(RA)\r\n    |  lw RC, -8+LO(RA)\t\t\t// Get index from control var.\r\n    |  lw TMP0, TAB:RB->asize\r\n    |  lw TMP1, TAB:RB->array\r\n    |   addiu PC, PC, 4\r\n    |1:  // Traverse array part.\r\n    |  sltu AT, RC, TMP0\r\n    |  beqz AT, >5\t\t\t// Index points after array part?\r\n    |.  sll TMP3, RC, 3\r\n    |  addu TMP3, TMP1, TMP3\r\n    |  lw TMP2, HI(TMP3)\r\n    |   ldc1 f0, 0(TMP3)\r\n    |    mtc1 RC, f2\r\n    |     lhu RD, -4+OFS_RD(PC)\r\n    |  beq TMP2, TISNIL, <1\t\t// Skip holes in array part.\r\n    |.  addiu RC, RC, 1\r\n    |    cvt.d.w f2, f2\r\n    |     lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |   sdc1 f0, 8(RA)\r\n    |     decode_RD4b RD\r\n    |     addu RD, RD, TMP3\r\n    |   sw RC, -8+LO(RA)\t\t// Update control var.\r\n    |     addu PC, PC, RD\r\n    |    sdc1 f2, 0(RA)\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  lw TMP1, TAB:RB->hmask\r\n    |  subu RC, RC, TMP0\r\n    |   lw TMP2, TAB:RB->node\r\n    |6:\r\n    |  sltu AT, TMP1, RC\t\t// End of iteration? Branch to ITERL+1.\r\n    |  bnez AT, <3\r\n    |.  sll TMP3, RC, 5\r\n    |   sll RB, RC, 3\r\n    |   subu TMP3, TMP3, RB\r\n    |  addu NODE:TMP3, TMP3, TMP2\r\n    |  lw RB, HI(NODE:TMP3)\r\n    |  ldc1 f0, 0(NODE:TMP3)\r\n    |     lhu RD, -4+OFS_RD(PC)\r\n    |  beq RB, TISNIL, <6\t\t// Skip holes in hash part.\r\n    |.  addiu RC, RC, 1\r\n    |   ldc1 f2, NODE:TMP3->key\r\n    |     lui TMP3, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  sdc1 f0, 8(RA)\r\n    |    addu RC, RC, TMP0\r\n    |     decode_RD4b RD\r\n    |     addu RD, RD, TMP3\r\n    |   sdc1 f2, 0(RA)\r\n    |     addu PC, PC, RD\r\n    |  b <3\r\n    |.  sw RC, -8+LO(RA)\t\t// Update control var.\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RD = target (points to ITERN)\r\n    |  addu RA, BASE, RA\r\n    |  lw TMP0, -24+HI(RA)\r\n    |  lw CFUNC:TMP1, -24+LO(RA)\r\n    |   lw TMP2, -16+HI(RA)\r\n    |    lw TMP3, -8+HI(RA)\r\n    |  li AT, LJ_TFUNC\r\n    |  bne TMP0, AT, >5\r\n    |.  addiu TMP2, TMP2, -LJ_TTAB\r\n    |  lbu TMP1, CFUNC:TMP1->ffid\r\n    |  addiu TMP3, TMP3, -LJ_TNIL\r\n    |   srl TMP0, RD, 1\r\n    |  or TMP2, TMP2, TMP3\r\n    |  addiu TMP1, TMP1, -FF_next_N\r\n    |   addu TMP0, PC, TMP0\r\n    |  or TMP1, TMP1, TMP2\r\n    |  bnez TMP1, >5\r\n    |.  lui TMP2, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    |  addu PC, TMP0, TMP2\r\n    |  lui TMP1, 0xfffe\r\n    |  ori TMP1, TMP1, 0x7fff\r\n    |  sw r0, -8+LO(RA)\t\t\t// Initialize control var.\r\n    |  sw TMP1, -8+HI(RA)\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  li TMP3, BC_JMP\r\n    |   li TMP1, BC_ITERC\r\n    |  sb TMP3, -4+OFS_OP(PC)\r\n    |   addu PC, TMP0, TMP2\r\n    |  b <1\r\n    |.  sb TMP1, OFS_OP(PC)\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  lw TMP0, FRAME_PC(BASE)\r\n    |  decode_RDtoRC8 RC, RD\r\n    |   decode_RB8a RB, INS\r\n    |  addu RC, BASE, RC\r\n    |   decode_RB8b RB\r\n    |   addu RA, BASE, RA\r\n    |  addiu RC, RC, FRAME_VARG\r\n    |   addu TMP2, RA, RB\r\n    |  addiu TMP3, BASE, -8\t\t// TMP3 = vtop\r\n    |  subu RC, RC, TMP0\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  beqz RB, >5\t\t\t// Copy all varargs?\r\n    |.  subu TMP1, TMP3, RC\r\n    |  addiu TMP2, TMP2, -16\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  lw CARG1, HI(RC)\r\n    |  sltu AT, RC, TMP3\r\n    |   lw CARG2, LO(RC)\r\n    |    addiu RC, RC, 8\r\n    |  movz CARG1, TISNIL, AT\r\n    |  sw CARG1, HI(RA)\r\n    |   sw CARG2, LO(RA)\r\n    |  sltu AT, RA, TMP2\r\n    |  bnez AT, <1\r\n    |.   addiu RA, RA, 8\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  lw TMP0, L->maxstack\r\n    |  blez TMP1, <3\t\t\t// No vararg slots?\r\n    |.  li MULTRES, 8\t\t\t// MULTRES = (0+1)*8\r\n    |  addu TMP2, RA, TMP1\r\n    |  sltu AT, TMP0, TMP2\r\n    |  bnez AT, >7\r\n    |.  addiu MULTRES, TMP1, 8\r\n    |6:\r\n    |  ldc1 f0, 0(RC)\r\n    |   addiu RC, RC, 8\r\n    |  sdc1 f0, 0(RA)\r\n    |  sltu AT, RC, TMP3\r\n    |  bnez AT, <6\t\t\t// More vararg slots?\r\n    |.  addiu RA, RA, 8\r\n    |  b <3\r\n    |.  nop\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  load_got lj_state_growstack\r\n    |   sw RA, L->top\r\n    |  subu RA, RA, BASE\r\n    |   sw BASE, L->base\r\n    |  subu BASE, RC, BASE\t\t// Need delta, because BASE may change.\r\n    |   sw PC, SAVE_PC\r\n    |  srl CARG2, TMP1, 3\r\n    |  call_intern lj_state_growstack\t// (lua_State *L, int n)\r\n    |.  move CARG1, L\r\n    |  move RC, BASE\r\n    |  lw BASE, L->base\r\n    |  addu RA, BASE, RA\r\n    |  addu RC, BASE, RC\r\n    |  b <6\r\n    |.  addiu TMP3, BASE, -8\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RD = extra_nresults*8\r\n    |  addu RD, RD, MULTRES\t\t// MULTRES >= 8, so RD >= 8.\r\n    |  // Fall through. Assumes BC_RET follows.\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lw PC, FRAME_PC(BASE)\r\n    |   addu RA, BASE, RA\r\n    |    move MULTRES, RD\r\n    |1:\r\n    |  andi TMP0, PC, FRAME_TYPE\r\n    |  bnez TMP0, ->BC_RETV_Z\r\n    |.  xori TMP1, PC, FRAME_VARG\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RD = (nresults+1)*8, PC = return\r\n    |   lw INS, -4(PC)\r\n    |    addiu TMP2, BASE, -8\r\n    |    addiu RC, RD, -8\r\n    |  decode_RA8a TMP0, INS\r\n    |   decode_RB8a RB, INS\r\n    |  decode_RA8b TMP0\r\n    |   decode_RB8b RB\r\n    |   addu TMP3, TMP2, RB\r\n    |  beqz RC, >3\r\n    |.  subu BASE, TMP2, TMP0\r\n    |2:\r\n    |   ldc1 f0, 0(RA)\r\n    |    addiu RA, RA, 8\r\n    |  addiu RC, RC, -8\r\n    |   sdc1 f0, 0(TMP2)\r\n    |  bnez RC, <2\r\n    |.   addiu TMP2, TMP2, 8\r\n    |3:\r\n    |  addiu TMP3, TMP3, -8\r\n    |5:\r\n    |  sltu AT, TMP2, TMP3\r\n    |  bnez AT, >6\r\n    |.  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  lw KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  sw TISNIL, HI(TMP2)\r\n    |  b <5\r\n    |.  addiu TMP2, TMP2, 8\r\n    |\r\n    |->BC_RETV_Z:  // Non-standard return case.\r\n    |  andi TMP2, TMP1, FRAME_TYPEP\r\n    |  bnez TMP2, ->vm_return\r\n    |.  nop\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  subu BASE, BASE, TMP1\r\n    |  b <1\r\n    |.  lw PC, FRAME_PC(BASE)\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lw PC, FRAME_PC(BASE)\r\n    |   addu RA, BASE, RA\r\n    |    move MULTRES, RD\r\n    |  andi TMP0, PC, FRAME_TYPE\r\n    |  bnez TMP0, ->BC_RETV_Z\r\n    |.  xori TMP1, PC, FRAME_VARG\r\n    |\r\n    |  lw INS, -4(PC)\r\n    |   addiu TMP2, BASE, -8\r\n    if (op == BC_RET1) {\r\n      |  ldc1 f0, 0(RA)\r\n    }\r\n    |  decode_RB8a RB, INS\r\n    |   decode_RA8a RA, INS\r\n    |  decode_RB8b RB\r\n    |   decode_RA8b RA\r\n    if (op == BC_RET1) {\r\n      |  sdc1 f0, 0(TMP2)\r\n    }\r\n    |   subu BASE, TMP2, RA\r\n    |5:\r\n    |  sltu AT, RD, RB\r\n    |  bnez AT, >6\r\n    |.  lw LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lw TMP1, LFUNC:TMP1->pc\r\n    |  lw KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  addiu TMP2, TMP2, 8\r\n    |  addiu RD, RD, 8\r\n    |  b <5\r\n    if (op == BC_RET1) {\r\n      |.  sw TISNIL, HI(TMP2)\r\n    } else {\r\n      |.  sw TISNIL, -8+HI(TMP2)\r\n    }\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RD = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  addu RA, BASE, RA\r\n    if (vk) {\r\n      |  ldc1 f0, FORL_IDX*8(RA)\r\n      |  ldc1 f4, FORL_STEP*8(RA)\r\n      |  ldc1 f2, FORL_STOP*8(RA)\r\n      |   lw TMP3, FORL_STEP*8+HI(RA)\r\n      |  add.d f0, f0, f4\r\n      |  sdc1 f0, FORL_IDX*8(RA)\r\n    } else {\r\n      |  lw TMP1, FORL_IDX*8+HI(RA)\r\n      |  lw TMP3, FORL_STEP*8+HI(RA)\r\n      |  lw TMP2, FORL_STOP*8+HI(RA)\r\n      |  sltiu TMP1, TMP1, LJ_TISNUM\r\n      |  sltiu TMP0, TMP3, LJ_TISNUM\r\n      |  sltiu TMP2, TMP2, LJ_TISNUM\r\n      |  and TMP1, TMP1, TMP0\r\n      |  and TMP1, TMP1, TMP2\r\n      |   ldc1 f0, FORL_IDX*8(RA)\r\n      |  beqz TMP1, ->vmeta_for\r\n      |.  ldc1 f2, FORL_STOP*8(RA)\r\n    }\r\n    if (op != BC_JFORL) {\r\n      |  srl RD, RD, 1\r\n      |  lui TMP0, (-(BCBIAS_J*4 >> 16) & 65535)\r\n    }\r\n    |  c.le.d 0, f0, f2\r\n    |  c.le.d 1, f2, f0\r\n    |  sdc1 f0, FORL_EXT*8(RA)\r\n    if (op == BC_JFORI) {\r\n      |  li TMP1, 1\r\n      |  li TMP2, 1\r\n      |   addu TMP0, RD, TMP0\r\n      |  slt TMP3, TMP3, r0\r\n      |  movf TMP1, r0, 0\r\n      |   addu PC, PC, TMP0\r\n      |  movf TMP2, r0, 1\r\n      |   lhu RD, -4+OFS_RD(PC)\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  bnez TMP1, =>BC_JLOOP\r\n      |.  decode_RD8b RD\r\n    } else if (op == BC_JFORL) {\r\n      |  li TMP1, 1\r\n      |  li TMP2, 1\r\n      |  slt TMP3, TMP3, r0\r\n      |  movf TMP1, r0, 0\r\n      |  movf TMP2, r0, 1\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  bnez TMP1, =>BC_JLOOP\r\n      |.  nop\r\n    } else {\r\n      |  addu TMP1, RD, TMP0\r\n      |  slt TMP3, TMP3, r0\r\n      |  move TMP2, TMP1\r\n      if (op == BC_FORI) {\r\n\t|  movt TMP1, r0, 0\r\n\t|  movt TMP2, r0, 1\r\n      } else {\r\n\t|  movf TMP1, r0, 0\r\n\t|  movf TMP2, r0, 1\r\n      }\r\n      |  movn TMP1, TMP2, TMP3\r\n      |  addu PC, PC, TMP1\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RD = target\r\n    |  addu RA, BASE, RA\r\n    |  lw TMP1, HI(RA)\r\n    |  beq TMP1, TISNIL, >1\t\t// Stop if iterator returned nil.\r\n    |.  lw TMP2, LO(RA)\r\n    if (op == BC_JITERL) {\r\n      |  sw TMP1, -8+HI(RA)\r\n      |  b =>BC_JLOOP\r\n      |.  sw TMP2, -8+LO(RA)\r\n    } else {\r\n      |  branch_RD\t\t\t// Otherwise save control var + branch.\r\n      |  sw TMP1, -8+HI(RA)\r\n      |   sw TMP2, -8+LO(RA)\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base*8 (ignored), RD = traceno*8\r\n    |  lw TMP1, DISPATCH_J(trace)(DISPATCH)\r\n    |  srl RD, RD, 1\r\n    |   li AT, 0\r\n    |  addu TMP1, TMP1, RD\r\n    |  // Traces on MIPS don't store the trace number, so use 0.\r\n    |   sw AT, DISPATCH_GL(vmstate)(DISPATCH)\r\n    |  lw TRACE:TMP2, 0(TMP1)\r\n    |   sw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n    |  lw TMP2, TRACE:TMP2->mcode\r\n    |   sw L, DISPATCH_GL(tmpbuf.L)(DISPATCH)\r\n    |  jr TMP2\r\n    |.  addiu JGL, DISPATCH, GG_DISP2G+32768\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RD = target\r\n    |  branch_RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lw TMP2, L->maxstack\r\n    |   lbu TMP1, -4+PC2PROTO(numparams)(PC)\r\n    |    lw KBASE, -4+PC2PROTO(k)(PC)\r\n    |  sltu AT, TMP2, RA\r\n    |  bnez AT, ->vm_growstack_l\r\n    |.  sll TMP1, TMP1, 3\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n    }\r\n    |2:\r\n    |  sltu AT, NARGS8:RC, TMP1\t\t// Check for missing parameters.\r\n    |  bnez AT, >3\r\n    |.  addu AT, BASE, NARGS8:RC\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD8a RD, INS\r\n      |  b =>BC_JLOOP\r\n      |.  decode_RD8b RD\r\n    } else {\r\n      |  ins_next2\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  sw TISNIL, HI(AT)\r\n    |  b <2\r\n    |.  addiu NARGS8:RC, NARGS8:RC, 8\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |   addu TMP1, BASE, RC\r\n    |  lw TMP2, L->maxstack\r\n    |  addu TMP0, RA, RC\r\n    |   sw LFUNC:RB, LO(TMP1)\t\t// Store copy of LFUNC.\r\n    |   addiu TMP3, RC, 8+FRAME_VARG\r\n    |  sltu AT, TMP0, TMP2\r\n    |    lw KBASE, -4+PC2PROTO(k)(PC)\r\n    |  beqz AT, ->vm_growstack_l\r\n    |.  sw TMP3, HI(TMP1)\t\t// Store delta + FRAME_VARG.\r\n    |  lbu TMP2, -4+PC2PROTO(numparams)(PC)\r\n    |   move RA, BASE\r\n    |   move RC, TMP1\r\n    |  ins_next1\r\n    |  beqz TMP2, >3\r\n    |.  addiu BASE, TMP1, 8\r\n    |1:\r\n    |  lw TMP0, HI(RA)\r\n    |   lw TMP3, LO(RA)\r\n    |  sltu AT, RA, RC\t\t\t// Less args than parameters?\r\n    |  move CARG1, TMP0\r\n    |  movz TMP0, TISNIL, AT\t\t// Clear missing parameters.\r\n    |  movn CARG1, TISNIL, AT\t\t// Clear old fixarg slot (help the GC).\r\n    |   sw TMP3, 8+LO(TMP1)\r\n    |    addiu TMP2, TMP2, -1\r\n    |  sw TMP0, 8+HI(TMP1)\r\n    |    addiu TMP1, TMP1, 8\r\n    |  sw CARG1, HI(RA)\r\n    |  bnez TMP2, <1\r\n    |.   addiu RA, RA, 8\r\n    |3:\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  lw CFUNCADDR, CFUNC:RB->f\r\n    } else {\r\n      |  lw CFUNCADDR, DISPATCH_GL(wrapf)(DISPATCH)\r\n    }\r\n    |  addu TMP1, RA, NARGS8:RC\r\n    |  lw TMP2, L->maxstack\r\n    |   addu RC, BASE, NARGS8:RC\r\n    |  sw BASE, L->base\r\n    |  sltu AT, TMP2, TMP1\r\n    |   sw RC, L->top\r\n    |    li_vmstate C\r\n    if (op == BC_FUNCCW) {\r\n      |  lw CARG2, CFUNC:RB->f\r\n    }\r\n    |  bnez AT, ->vm_growstack_c\t// Need to grow stack.\r\n    |.  move CARG1, L\r\n    |  jalr CFUNCADDR\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |.   st_vmstate\r\n    |  // Returns nresults.\r\n    |  lw BASE, L->base\r\n    |   sll RD, CRET1, 3\r\n    |  lw TMP1, L->top\r\n    |    li_vmstate INTERP\r\n    |  lw PC, FRAME_PC(BASE)\t\t// Fetch PC of caller.\r\n    |   subu RA, TMP1, RD\t\t// RA = L->top - nresults*8\r\n    |    sw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n    |  b ->vm_returnc\r\n    |.   st_vmstate\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.4byte .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.4byte 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.4byte .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.4byte .Lframe0\\n\"\r\n\t\"\\t.4byte .Lbegin\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.sleb128 1\\n\"\r\n\t\"\\t.byte 0x9e\\n\\t.sleb128 2\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 23; i >= 16; i--)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 26-i);\r\n    for (i = 30; i >= 20; i -= 2)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+32+i, 42-i);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.4byte .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.4byte .Lframe0\\n\"\r\n\t\"\\t.4byte lj_vm_ffi_call\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.uleb128 1\\n\"\r\n\t\"\\t.byte 0x90\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x10\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"aw\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\"\\t.globl lj_err_unwind_dwarf\\n\"\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.4byte .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.4byte 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.4byte lj_err_unwind_dwarf\\n\"\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.4byte .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.4byte .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.4byte .Lbegin\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x9f\\n\\t.sleb128 1\\n\"\r\n\t\"\\t.byte 0x9e\\n\\t.sleb128 2\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 23; i >= 16; i--)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+i, 26-i);\r\n    for (i = 30; i >= 20; i -= 2)\r\n      fprintf(ctx->fp, \"\\t.byte %d\\n\\t.uleb128 %d\\n\", 0x80+32+i, 42-i);\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE2:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.4byte .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.4byte 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 31\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 29\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.4byte .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.4byte .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.4byte lj_vm_ffi_call\\n\"\r\n\t\"\\t.4byte %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x9f\\n\\t.uleb128 1\\n\"\r\n\t\"\\t.byte 0x90\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x10\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_ppc.dasc",
    "content": "|// Low-level VM code for PowerPC 32 bit or 32on64 bit mode.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch ppc\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|// Note: The ragged indentation of the instructions is intentional.\r\n|//       The starting columns indicate data dependencies.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// DynASM defines used by the PPC port:\r\n|//\r\n|// P64     64 bit pointers (only for GPR64 testing).\r\n|//         Note: see vm_ppc64.dasc for a full PPC64 _LP64 port.\r\n|// GPR64   64 bit registers (but possibly 32 bit pointers, e.g. PS3).\r\n|//         Affects reg saves, stack layout, carry/overflow/dot flags etc.\r\n|// FRAME32 Use 32 bit frame layout, even with GPR64 (Xbox 360).\r\n|// TOC     Need table of contents (64 bit or 32 bit variant, e.g. PS3).\r\n|//         Function pointers are really a struct: code, TOC, env (optional).\r\n|// TOCENV  Function pointers have an environment pointer, too (not on PS3).\r\n|// PPE     Power Processor Element of Cell (PS3) or Xenon (Xbox 360).\r\n|//         Must avoid (slow) micro-coded instructions.\r\n|\r\n|.if P64\r\n|.define TOC, 1\r\n|.define TOCENV, 1\r\n|.macro lpx, a, b, c; ldx a, b, c; .endmacro\r\n|.macro lp, a, b; ld a, b; .endmacro\r\n|.macro stp, a, b; std a, b; .endmacro\r\n|.define decode_OPP, decode_OP8\r\n|.if FFI\r\n|// Missing: Calling conventions, 64 bit regs, TOC.\r\n|.error lib_ffi not yet implemented for PPC64\r\n|.endif\r\n|.else\r\n|.macro lpx, a, b, c; lwzx a, b, c; .endmacro\r\n|.macro lp, a, b; lwz a, b; .endmacro\r\n|.macro stp, a, b; stw a, b; .endmacro\r\n|.define decode_OPP, decode_OP4\r\n|.endif\r\n|\r\n|// Convenience macros for TOC handling.\r\n|.if TOC\r\n|// Linker needs a TOC patch area for every external call relocation.\r\n|.macro blex, target; bl extern target@plt; nop; .endmacro\r\n|.macro .toc, a, b; a, b; .endmacro\r\n|.if P64\r\n|.define TOC_OFS,\t 8\r\n|.define ENV_OFS,\t16\r\n|.else\r\n|.define TOC_OFS,\t4\r\n|.define ENV_OFS,\t8\r\n|.endif\r\n|.else  // No TOC.\r\n|.macro blex, target; bl extern target@plt; .endmacro\r\n|.macro .toc, a, b; .endmacro\r\n|.endif\r\n|.macro .tocenv, a, b; .if TOCENV; a, b; .endif; .endmacro\r\n|\r\n|.macro .gpr64, a, b; .if GPR64; a, b; .endif; .endmacro\r\n|\r\n|.macro andix., y, a, i\r\n|.if PPE\r\n|  rlwinm y, a, 0, 31-lj_fls(i), 31-lj_ffs(i)\r\n|  cmpwi y, 0\r\n|.else\r\n|  andi. y, a, i\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro clrso, reg\r\n|.if PPE\r\n|  li reg, 0\r\n|  mtxer reg\r\n|.else\r\n|  mcrxr cr0\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro checkov, reg, noov\r\n|.if PPE\r\n|  mfxer reg\r\n|  add reg, reg, reg\r\n|  cmpwi reg, 0\r\n|   li reg, 0\r\n|   mtxer reg\r\n|  bgey noov\r\n|.else\r\n|  mcrxr cr0\r\n|  bley noov\r\n|.endif\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// Don't use: r1 = sp, r2 and r13 = reserved (TOC, TLS or SDATA)\r\n|\r\n|// The following must be C callee-save (but BASE is often refetched).\r\n|.define BASE,\t\tr14\t// Base of current Lua stack frame.\r\n|.define KBASE,\t\tr15\t// Constants of current Lua function.\r\n|.define PC,\t\tr16\t// Next PC.\r\n|.define DISPATCH,\tr17\t// Opcode dispatch table.\r\n|.define LREG,\t\tr18\t// Register holding lua_State (also in SAVE_L).\r\n|.define MULTRES,\tr19\t// Size of multi-result: (nresults+1)*8.\r\n|.define JGL,\t\tr31\t// On-trace: global_State + 32768.\r\n|\r\n|// Constants for type-comparisons, stores and conversions. C callee-save.\r\n|.define TISNUM,\tr22\r\n|.define TISNIL,\tr23\r\n|.define ZERO,\t\tr24\r\n|.define TOBIT,\t\tf30\t// 2^52 + 2^51.\r\n|.define TONUM,\t\tf31\t// 2^52 + 2^51 + 2^31.\r\n|\r\n|// The following temporaries are not saved across C calls, except for RA.\r\n|.define RA,\t\tr20\t// Callee-save.\r\n|.define RB,\t\tr10\r\n|.define RC,\t\tr11\r\n|.define RD,\t\tr12\r\n|.define INS,\t\tr7\t// Overlaps CARG5.\r\n|\r\n|.define TMP0,\t\tr0\r\n|.define TMP1,\t\tr8\r\n|.define TMP2,\t\tr9\r\n|.define TMP3,\t\tr6\t// Overlaps CARG4.\r\n|\r\n|// Saved temporaries.\r\n|.define SAVE0,\t\tr21\r\n|\r\n|// Calling conventions.\r\n|.define CARG1,\t\tr3\r\n|.define CARG2,\t\tr4\r\n|.define CARG3,\t\tr5\r\n|.define CARG4,\t\tr6\t// Overlaps TMP3.\r\n|.define CARG5,\t\tr7\t// Overlaps INS.\r\n|\r\n|.define FARG1,\t\tf1\r\n|.define FARG2,\t\tf2\r\n|\r\n|.define CRET1,\t\tr3\r\n|.define CRET2,\t\tr4\r\n|\r\n|.define TOCREG,\tr2\t// TOC register (only used by C code).\r\n|.define ENVREG,\tr11\t// Environment pointer (nested C functions).\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|.if GPR64\r\n|.if FRAME32\r\n|\r\n|//\t\t\t456(sp) // \\ 32/64 bit C frame info\r\n|.define TONUM_LO,\t452(sp) // |\r\n|.define TONUM_HI,\t448(sp) // |\r\n|.define TMPD_LO,\t444(sp) // |\r\n|.define TMPD_HI,\t440(sp) // |\r\n|.define SAVE_CR,\t432(sp) // | 64 bit CR save.\r\n|.define SAVE_ERRF,\t424(sp) //  > Parameter save area.\r\n|.define SAVE_NRES,\t420(sp) // |\r\n|.define SAVE_L,\t416(sp) // |\r\n|.define SAVE_PC,\t412(sp) // |\r\n|.define SAVE_MULTRES,\t408(sp) // |\r\n|.define SAVE_CFRAME,\t400(sp) // / 64 bit C frame chain.\r\n|//\t\t\t392(sp) // Reserved.\r\n|.define CFRAME_SPACE,\t384     // Delta for sp.\r\n|// Back chain for sp:\t384(sp) <-- sp entering interpreter\r\n|.define SAVE_LR,\t376(sp) // 32 bit LR stored in hi-part.\r\n|.define SAVE_GPR_,\t232     // .. 232+18*8: 64 bit GPR saves.\r\n|.define SAVE_FPR_,\t88      // .. 88+18*8: 64 bit FPR saves.\r\n|//\t\t\t80(sp) // Needed for 16 byte stack frame alignment.\r\n|//\t\t\t16(sp)  // Callee parameter save area (ABI mandated).\r\n|//\t\t\t8(sp)   // Reserved\r\n|// Back chain for sp:\t0(sp)   <-- sp while in interpreter\r\n|// 32 bit sp stored in hi-part of 0(sp).\r\n|\r\n|.define TMPD_BLO,\t447(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.else\r\n|\r\n|//\t\t\t508(sp) // \\ 32 bit C frame info.\r\n|.define SAVE_ERRF,\t472(sp) // |\r\n|.define SAVE_NRES,\t468(sp) // |\r\n|.define SAVE_L,\t464(sp) //  > Parameter save area.\r\n|.define SAVE_PC,\t460(sp) // |\r\n|.define SAVE_MULTRES,\t456(sp) // |\r\n|.define SAVE_CFRAME,\t448(sp) // / 64 bit C frame chain.\r\n|.define SAVE_LR,\t416(sp)\r\n|.define CFRAME_SPACE,\t400     // Delta for sp.\r\n|// Back chain for sp:\t400(sp) <-- sp entering interpreter\r\n|.define SAVE_FPR_,\t256     // .. 256+18*8: 64 bit FPR saves.\r\n|.define SAVE_GPR_,\t112     // .. 112+18*8: 64 bit GPR saves.\r\n|//\t\t\t48(sp)  // Callee parameter save area (ABI mandated).\r\n|.define SAVE_TOC,\t40(sp)  // TOC save area.\r\n|.define TMPD_LO,\t36(sp)  // \\ Link editor temp (ABI mandated).\r\n|.define TMPD_HI,\t32(sp)  // /\r\n|.define TONUM_LO,\t28(sp)  // \\ Compiler temp (ABI mandated).\r\n|.define TONUM_HI,\t24(sp)  // /\r\n|// Next frame lr:\t16(sp)\r\n|.define SAVE_CR,\t8(sp)  // 64 bit CR save.\r\n|// Back chain for sp:\t0(sp)\t<-- sp while in interpreter\r\n|\r\n|.define TMPD_BLO,\t39(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.endif\r\n|.else\r\n|\r\n|.define SAVE_LR,\t276(sp)\r\n|.define CFRAME_SPACE,\t272     // Delta for sp.\r\n|// Back chain for sp:\t272(sp) <-- sp entering interpreter\r\n|.define SAVE_FPR_,\t128     // .. 128+18*8: 64 bit FPR saves.\r\n|.define SAVE_GPR_,\t56      // .. 56+18*4: 32 bit GPR saves.\r\n|.define SAVE_CR,\t52(sp)  // 32 bit CR save.\r\n|.define SAVE_ERRF,\t48(sp)  // 32 bit C frame info.\r\n|.define SAVE_NRES,\t44(sp)\r\n|.define SAVE_CFRAME,\t40(sp)\r\n|.define SAVE_L,\t36(sp)\r\n|.define SAVE_PC,\t32(sp)\r\n|.define SAVE_MULTRES,\t28(sp)\r\n|.define UNUSED1,\t24(sp)\r\n|.define TMPD_LO,\t20(sp)\r\n|.define TMPD_HI,\t16(sp)\r\n|.define TONUM_LO,\t12(sp)\r\n|.define TONUM_HI,\t8(sp)\r\n|// Next frame lr:\t4(sp)\r\n|// Back chain for sp:\t0(sp)\t<-- sp while in interpreter\r\n|\r\n|.define TMPD_BLO,\t23(sp)\r\n|.define TMPD,\t\tTMPD_HI\r\n|.define TONUM_D,\tTONUM_HI\r\n|\r\n|.endif\r\n|\r\n|.macro save_, reg\r\n|.if GPR64\r\n|  std r..reg, SAVE_GPR_+(reg-14)*8(sp)\r\n|.else\r\n|  stw r..reg, SAVE_GPR_+(reg-14)*4(sp)\r\n|.endif\r\n|  stfd f..reg, SAVE_FPR_+(reg-14)*8(sp)\r\n|.endmacro\r\n|.macro rest_, reg\r\n|.if GPR64\r\n|  ld r..reg, SAVE_GPR_+(reg-14)*8(sp)\r\n|.else\r\n|  lwz r..reg, SAVE_GPR_+(reg-14)*4(sp)\r\n|.endif\r\n|  lfd f..reg, SAVE_FPR_+(reg-14)*8(sp)\r\n|.endmacro\r\n|\r\n|.macro saveregs\r\n|.if GPR64 and not FRAME32\r\n|  stdu sp, -CFRAME_SPACE(sp)\r\n|.else\r\n|  stwu sp, -CFRAME_SPACE(sp)\r\n|.endif\r\n|  save_ 14; save_ 15; save_ 16\r\n|  mflr r0\r\n|  save_ 17; save_ 18; save_ 19; save_ 20; save_ 21; save_ 22\r\n|.if GPR64 and not FRAME32\r\n|  std r0, SAVE_LR\r\n|.else\r\n|  stw r0, SAVE_LR\r\n|.endif\r\n|  save_ 23; save_ 24; save_ 25\r\n|  mfcr r0\r\n|  save_ 26; save_ 27; save_ 28; save_ 29; save_ 30; save_ 31\r\n|.if GPR64\r\n|  std r0, SAVE_CR\r\n|.else\r\n|  stw r0, SAVE_CR\r\n|.endif\r\n|  .toc std TOCREG, SAVE_TOC\r\n|.endmacro\r\n|\r\n|.macro restoreregs\r\n|.if GPR64 and not FRAME32\r\n|  ld r0, SAVE_LR\r\n|.else\r\n|  lwz r0, SAVE_LR\r\n|.endif\r\n|.if GPR64\r\n|  ld r12, SAVE_CR\r\n|.else\r\n|  lwz r12, SAVE_CR\r\n|.endif\r\n|  rest_ 14; rest_ 15; rest_ 16; rest_ 17; rest_ 18; rest_ 19\r\n|  mtlr r0;\r\n|.if PPE; mtocrf 0x20, r12; .else; mtcrf 0x38, r12; .endif\r\n|  rest_ 20; rest_ 21; rest_ 22; rest_ 23; rest_ 24; rest_ 25\r\n|.if PPE; mtocrf 0x10, r12; .endif\r\n|  rest_ 26; rest_ 27; rest_ 28; rest_ 29; rest_ 30; rest_ 31\r\n|.if PPE; mtocrf 0x08, r12; .endif\r\n|  addi sp, sp, CFRAME_SPACE\r\n|.endmacro\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State,\tLREG\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS8,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Trap for not-yet-implemented parts.\r\n|.macro NYI; tw 4, sp, sp; .endmacro\r\n|\r\n|// int/FP conversions.\r\n|.macro tonum_i, freg, reg\r\n|  xoris reg, reg, 0x8000\r\n|  stw reg, TONUM_LO\r\n|  lfd freg, TONUM_D\r\n|  fsub freg, freg, TONUM\r\n|.endmacro\r\n|\r\n|.macro tonum_u, freg, reg\r\n|  stw reg, TONUM_LO\r\n|  lfd freg, TONUM_D\r\n|  fsub freg, freg, TOBIT\r\n|.endmacro\r\n|\r\n|.macro toint, reg, freg, tmpfreg\r\n|  fctiwz tmpfreg, freg\r\n|  stfd tmpfreg, TMPD\r\n|  lwz reg, TMPD_LO\r\n|.endmacro\r\n|\r\n|.macro toint, reg, freg\r\n|  toint reg, freg, freg\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Access to frame relative to BASE.\r\n|.define FRAME_PC,\t-8\r\n|.define FRAME_FUNC,\t-4\r\n|\r\n|// Instruction decode.\r\n|.macro decode_OP4, dst, ins; rlwinm dst, ins, 2, 22, 29; .endmacro\r\n|.macro decode_OP8, dst, ins; rlwinm dst, ins, 3, 21, 28; .endmacro\r\n|.macro decode_RA8, dst, ins; rlwinm dst, ins, 27, 21, 28; .endmacro\r\n|.macro decode_RB8, dst, ins; rlwinm dst, ins, 11, 21, 28; .endmacro\r\n|.macro decode_RC8, dst, ins; rlwinm dst, ins, 19, 21, 28; .endmacro\r\n|.macro decode_RD8, dst, ins; rlwinm dst, ins, 19, 13, 28; .endmacro\r\n|\r\n|.macro decode_OP1, dst, ins; rlwinm dst, ins, 0, 24, 31; .endmacro\r\n|.macro decode_RD4, dst, ins; rlwinm dst, ins, 18, 14, 29; .endmacro\r\n|\r\n|// Instruction fetch.\r\n|.macro ins_NEXT1\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|.endmacro\r\n|// Instruction decode+dispatch. Note: optimized for e300!\r\n|.macro ins_NEXT2\r\n|  decode_OPP TMP1, INS\r\n|  lpx TMP0, DISPATCH, TMP1\r\n|  mtctr TMP0\r\n|   decode_RB8 RB, INS\r\n|   decode_RD8 RD, INS\r\n|   decode_RA8 RA, INS\r\n|   decode_RC8 RC, INS\r\n|  bctr\r\n|.endmacro\r\n|.macro ins_NEXT\r\n|  ins_NEXT1\r\n|  ins_NEXT2\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|  .define ins_next1, ins_NEXT1\r\n|  .define ins_next2, ins_NEXT2\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  .macro ins_next\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next1\r\n|  .endmacro\r\n|  .macro ins_next2\r\n|    b ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n|  lwz PC, LFUNC:RB->pc\r\n|  lwz INS, 0(PC)\r\n|   addi PC, PC, 4\r\n|  decode_OPP TMP1, INS\r\n|   decode_RA8 RA, INS\r\n|  lpx TMP0, DISPATCH, TMP1\r\n|   add RA, RA, BASE\r\n|  mtctr TMP0\r\n|  bctr\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, PC = caller PC\r\n|  stw PC, FRAME_PC(BASE)\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checknum, reg; cmplw reg, TISNUM; .endmacro\r\n|.macro checknum, cr, reg; cmplw cr, reg, TISNUM; .endmacro\r\n|.macro checkstr, reg; cmpwi reg, LJ_TSTR; .endmacro\r\n|.macro checktab, reg; cmpwi reg, LJ_TTAB; .endmacro\r\n|.macro checkfunc, reg; cmpwi reg, LJ_TFUNC; .endmacro\r\n|.macro checknil, reg; cmpwi reg, LJ_TNIL; .endmacro\r\n|\r\n|.macro branch_RD\r\n|  srwi TMP0, RD, 1\r\n|  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n|  add PC, PC, TMP0\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|.macro hotcheck, delta, target\r\n|  rlwinm TMP1, PC, 31, 25, 30\r\n|  addi TMP1, TMP1, GG_DISP2HOT\r\n|  lhzx TMP2, DISPATCH, TMP1\r\n|  addic. TMP2, TMP2, -delta\r\n|  sthx TMP2, DISPATCH, TMP1\r\n|  blt target\r\n|.endmacro\r\n|\r\n|.macro hotloop\r\n|  hotcheck HOTCOUNT_LOOP, ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall\r\n|  hotcheck HOTCOUNT_CALL, ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state. Uses TMP0.\r\n|.macro li_vmstate, st; li TMP0, ~LJ_VMST_..st; .endmacro\r\n|.macro st_vmstate; stw TMP0, DISPATCH_GL(vmstate)(DISPATCH); .endmacro\r\n|\r\n|// Move table write barrier back. Overwrites mark and tmp.\r\n|.macro barrierback, tab, mark, tmp\r\n|  lwz tmp, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|  // Assumes LJ_GC_BLACK is 0x04.\r\n|   rlwinm mark, mark, 0, 30, 28\t\t// black2gray(tab)\r\n|  stw tab, DISPATCH_GL(gc.grayagain)(DISPATCH)\r\n|   stb mark, tab->marked\r\n|  stw tmp, tab->gclist\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  // See vm_return. Also: TMP2 = previous base.\r\n  |  andix. TMP0, PC, FRAME_P\r\n  |   li TMP1, LJ_TTRUE\r\n  |  beq ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  lwz PC, FRAME_PC(TMP2)\t\t// Fetch PC of previous frame.\r\n  |  mr BASE, TMP2\t\t\t// Restore caller base.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |   stwu TMP1, FRAME_PC(RA)\t\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  addi RD, RD, 8\t\t\t// RD = (nresults+1)*8.\r\n  |   andix. TMP0, PC, FRAME_TYPE\r\n  |  cmpwi cr1, RD, 0\r\n  |  li CRET1, LUA_YIELD\r\n  |  beq cr1, ->vm_unwind_c_eh\r\n  |  mr MULTRES, RD\r\n  |   beq ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultptr, RD/MULTRES = (nresults+1)*8, PC = return\r\n  |  // TMP0 = PC & FRAME_TYPE\r\n  |  cmpwi TMP0, FRAME_C\r\n  |   rlwinm TMP2, PC, 0, 0, 28\r\n  |    li_vmstate C\r\n  |   sub TMP2, BASE, TMP2\t\t// TMP2 = previous base.\r\n  |  bney ->vm_returnp\r\n  |\r\n  |  addic. TMP1, RD, -8\r\n  |   stp TMP2, L->base\r\n  |   lwz TMP2, SAVE_NRES\r\n  |    subi BASE, BASE, 8\r\n  |    st_vmstate\r\n  |   slwi TMP2, TMP2, 3\r\n  |  beq >2\r\n  |1:\r\n  |  addic. TMP1, TMP1, -8\r\n  |   lfd f0, 0(RA)\r\n  |    addi RA, RA, 8\r\n  |   stfd f0, 0(BASE)\r\n  |    addi BASE, BASE, 8\r\n  |  bney <1\r\n  |\r\n  |2:\r\n  |  cmpw TMP2, RD\t\t\t// More/less results wanted?\r\n  |  bne >6\r\n  |3:\r\n  |  stp BASE, L->top\t\t\t// Store new top.\r\n  |\r\n  |->vm_leave_cp:\r\n  |  lp TMP0, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |   li CRET1, 0\t\t\t// Ok return status for vm_pcall.\r\n  |  stp TMP0, L->cframe\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  blr\r\n  |\r\n  |6:\r\n  |  ble >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  lwz TMP1, L->maxstack\r\n  |  cmplw BASE, TMP1\r\n  |  bge >8\r\n  |  stw TISNIL, 0(BASE)\r\n  |  addi RD, RD, 8\r\n  |  addi BASE, BASE, 8\r\n  |  b <2\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  subfic TMP3, TMP2, 0\t\t// LUA_MULTRET+1 case?\r\n  |   sub TMP0, RD, TMP2\r\n  |  subfe TMP1, TMP1, TMP1\t\t// TMP1 = TMP2 == 0 ? 0 : -1\r\n  |   and TMP0, TMP0, TMP1\r\n  |  sub BASE, BASE, TMP0\t\t// Either keep top or shrink it.\r\n  |  b <3\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  stp BASE, L->top\t\t\t// Save current top held in BASE (yes).\r\n  |   mr SAVE0, RD\r\n  |  srwi CARG2, TMP2, 3\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |    lwz TMP2, SAVE_NRES\r\n  |   mr RD, SAVE0\r\n  |    slwi TMP2, TMP2, 3\r\n  |  lp BASE, L->top\t\t\t// Need the (realloced) L->top in BASE.\r\n  |  b <2\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mr sp, CARG1\r\n  |  mr CRET1, CARG2\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |  .toc ld TOCREG, SAVE_TOC\r\n  |   li TMP0, ~LJ_VMST_C\r\n  |  lwz GL:TMP1, L->glref\r\n  |   stw TMP0, GL:TMP1->vmstate\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |.if GPR64\r\n  |  rldicr sp, CARG1, 0, 61\r\n  |.else\r\n  |  rlwinm sp, CARG1, 0, 0, 29\r\n  |.endif\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  lwz L, SAVE_L\r\n  |  .toc ld TOCREG, SAVE_TOC\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |  lp BASE, L->base\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |   lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |     li ZERO, 0\r\n  |     stw TMP3, TMPD\r\n  |  li TMP1, LJ_TFALSE\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     li TISNIL, LJ_TNIL\r\n  |    li_vmstate INTERP\r\n  |     lfs TOBIT, TMPD\r\n  |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of previous frame.\r\n  |  la RA, -8(BASE)\t\t\t// Results start at BASE-8.\r\n  |     stw TMP3, TMPD\r\n  |   addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  stw TMP1, 0(RA)\t\t\t// Prepend false to error message.\r\n  |  li RD, 16\t\t\t\t// 2 results: false + error message.\r\n  |    st_vmstate\r\n  |     lfs TONUM, TMPD\r\n  |  b ->vm_returnc\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  b >2\r\n  |\r\n  |->vm_growstack_l:\t\t\t// Grow stack for Lua function.\r\n  |  // BASE = new base, RA = BASE+framesize*8, RC = nargs*8, PC = first PC\r\n  |  add RC, BASE, RC\r\n  |   sub RA, RA, BASE\r\n  |  stp BASE, L->base\r\n  |   addi PC, PC, 4\t\t\t// Must point after first instruction.\r\n  |  stp RC, L->top\r\n  |   srwi CARG2, RA, 3\r\n  |2:\r\n  |  // L->base = new base, L->top = top\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lp BASE, L->base\r\n  |  lp RC, L->top\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub RC, RC, BASE\r\n  |  // BASE = new base, RB = LFUNC/CFUNC, RC = nargs*8, FRAME_PC(BASE) = PC\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  mr BASE, CARG2\r\n  |    lbz TMP1, L->status\r\n  |   stw L, SAVE_L\r\n  |  li PC, FRAME_CP\r\n  |  addi TMP0, sp, CFRAME_RESUME\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |   stw CARG3, SAVE_NRES\r\n  |    cmplwi TMP1, 0\r\n  |   stw CARG3, SAVE_ERRF\r\n  |   stp CARG3, SAVE_CFRAME\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  stp TMP0, L->cframe\r\n  |    beq >3\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  stw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  mr RA, BASE\r\n  |   lp BASE, L->base\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |   lp TMP1, L->top\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |    stb CARG3, L->status\r\n  |     stw TMP3, TMPD\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     lfs TOBIT, TMPD\r\n  |   sub RD, TMP1, BASE\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |   addi RD, RD, 8\r\n  |     stw TMP0, TONUM_HI\r\n  |    li_vmstate INTERP\r\n  |     li ZERO, 0\r\n  |    st_vmstate\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   mr MULTRES, RD\r\n  |     lfs TONUM, TMPD\r\n  |     li TISNIL, LJ_TNIL\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  li PC, FRAME_CP\r\n  |  stw CARG4, SAVE_ERRF\r\n  |  b >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  li PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  lp TMP1, L:CARG1->cframe\r\n  |    mr L, CARG1\r\n  |   stw CARG3, SAVE_NRES\r\n  |    lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |   stw CARG1, SAVE_L\r\n  |     mr BASE, CARG2\r\n  |    addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |   stw CARG1, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |  stp TMP1, SAVE_CFRAME\r\n  |  stp sp, L->cframe\t\t\t// Add our C frame to cframe chain.\r\n  |\r\n  |3:  // Entry point for vm_cpcall/vm_resume (BASE = base, PC = ftype).\r\n  |  stw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  lp TMP2, L->base\t\t\t// TMP2 = old base (used in vmeta_call).\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |   lp TMP1, L->top\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  add PC, PC, BASE\r\n  |     stw TMP3, TMPD\r\n  |     li ZERO, 0\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     lfs TOBIT, TMPD\r\n  |  sub PC, PC, TMP2\t\t\t// PC = frame delta + frame type\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |   sub NARGS8:RC, TMP1, BASE\r\n  |     stw TMP0, TONUM_HI\r\n  |    li_vmstate INTERP\r\n  |     lfs TONUM, TMPD\r\n  |     li TISNIL, LJ_TNIL\r\n  |    st_vmstate\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8, PC = caller PC\r\n  |  lwz TMP0, FRAME_PC(BASE)\r\n  |   lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  checkfunc TMP0; bne ->vmeta_call\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RC = nargs*8, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mr L, CARG1\r\n  |   lwz TMP0, L:CARG1->stack\r\n  |  stw CARG1, SAVE_L\r\n  |   lp TMP1, L->top\r\n  |     lwz DISPATCH, L->glref\t\t// Setup pointer to dispatch table.\r\n  |  stw CARG1, SAVE_PC\t\t\t// Any value outside of bytecode is ok.\r\n  |   sub TMP0, TMP0, TMP1\t\t// Compute -savestack(L, L->top).\r\n  |    lp TMP1, L->cframe\r\n  |     addi DISPATCH, DISPATCH, GG_G2DISP\r\n  |  .toc lp CARG4, 0(CARG4)\r\n  |  li TMP2, 0\r\n  |   stw TMP0, SAVE_NRES\t\t// Neg. delta means cframe w/o frame.\r\n  |  stw TMP2, SAVE_ERRF\t\t// No error function.\r\n  |    stp TMP1, SAVE_CFRAME\r\n  |    stp sp, L->cframe\t\t// Add our C frame to cframe chain.\r\n  |     stw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  mtctr CARG4\r\n  |  bctrl\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.if PPE\r\n  |  mr BASE, CRET1\r\n  |  cmpwi CRET1, 0\r\n  |.else\r\n  |  mr. BASE, CRET1\r\n  |.endif\r\n  |   li PC, FRAME_CP\r\n  |  bne <3\t\t\t\t// Else continue with the call.\r\n  |  b ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// The lj_meta_* functions (except for lj_meta_cat) don't reallocate the\r\n  |// stack, so BASE doesn't need to be reloaded across these calls.\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultptr, RD = (nresults+1)*8\r\n  |  lwz TMP0, -12(BASE)\t\t// Continuation.\r\n  |   mr RB, BASE\r\n  |   mr BASE, TMP2\t\t\t// Restore caller BASE.\r\n  |    lwz LFUNC:TMP1, FRAME_FUNC(TMP2)\r\n  |.if FFI\r\n  |  cmplwi TMP0, 1\r\n  |.endif\r\n  |     lwz PC, -16(RB)\t\t\t// Restore PC from [cont|PC].\r\n  |   subi TMP2, RD, 8\r\n  |    lwz TMP1, LFUNC:TMP1->pc\r\n  |   stwx TISNIL, RA, TMP2\t\t// Ensure one valid arg.\r\n  |.if FFI\r\n  |  ble >1\r\n  |.endif\r\n  |    lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |  // BASE = base, RA = resultptr, RB = meta base\r\n  |  mtctr TMP0\r\n  |  bctr\t\t\t\t// Jump to continuation.\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  beq ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: tailcall from C function.\r\n  |  subi TMP1, RB, 16\r\n  |  sub RC, TMP1, BASE\r\n  |  b ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// RA = resultptr, RB = meta base\r\n  |  lwz INS, -4(PC)\r\n  |   subi CARG2, RB, 16\r\n  |  decode_RB8 SAVE0, INS\r\n  |   lfd f0, 0(RA)\r\n  |  add TMP1, BASE, SAVE0\r\n  |   stp BASE, L->base\r\n  |  cmplw TMP1, CARG2\r\n  |   sub CARG3, CARG2, TMP1\r\n  |  decode_RA8 RA, INS\r\n  |   stfd f0, 0(CARG2)\r\n  |  bney ->BC_CAT_Z\r\n  |   stfdx f0, BASE, RA\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets1:\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TSTR\r\n  |   decode_RB8 RB, INS\r\n  |  stw STR:RC, 4(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  stw TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgets:\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TTAB\r\n  |  stw TAB:RB, 4(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |  stw TMP0, 0(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   stw STR:RC, 4(CARG3)\r\n  |   stw TMP1, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetb:\t\t\t// TMP0 = index\r\n  |.if not DUALNUM\r\n  |  tonum_u f0, TMP0\r\n  |.endif\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(CARG3)\r\n  |  stw TMP0, 4(CARG3)\r\n  |.else\r\n  |  stfd f0, 0(CARG3)\r\n  |.endif\r\n  |  b >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq >3\r\n  |   lfd f0, 0(CRET1)\r\n  |  ins_next1\r\n  |   stfdx f0, BASE, RA\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lp BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 16\t\t\t// 2 args for func(t, k).\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  cmplwi CRET1, 0\r\n  |  beq >1\r\n  |  lfd f14, 0(CRET1)\r\n  |  b ->BC_TGETR_Z\r\n  |1:\r\n  |  stwx TISNIL, BASE, RA\r\n  |  b ->cont_nop\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets1:\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TSTR\r\n  |   decode_RB8 RB, INS\r\n  |  stw STR:RC, 4(CARG3)\r\n  |   add CARG2, BASE, RB\r\n  |  stw TMP0, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsets:\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |  li TMP0, LJ_TTAB\r\n  |  stw TAB:RB, 4(CARG2)\r\n  |   la CARG3, DISPATCH_GL(tmptv2)(DISPATCH)\r\n  |  stw TMP0, 0(CARG2)\r\n  |   li TMP1, LJ_TSTR\r\n  |   stw STR:RC, 4(CARG3)\r\n  |   stw TMP1, 0(CARG3)\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetb:\t\t\t// TMP0 = index\r\n  |.if not DUALNUM\r\n  |  tonum_u f0, TMP0\r\n  |.endif\r\n  |   decode_RB8 RB, INS\r\n  |  la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   add CARG2, BASE, RB\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(CARG3)\r\n  |  stw TMP0, 4(CARG3)\r\n  |.else\r\n  |  stfd f0, 0(CARG3)\r\n  |.endif\r\n  |  b >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  decode_RB8 RB, INS\r\n  |   decode_RC8 RC, INS\r\n  |  add CARG2, BASE, RB\r\n  |   add CARG3, BASE, RC\r\n  |1:\r\n  |  stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // Returns TValue * (finished) or NULL (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |   lfdx f0, BASE, RA\r\n  |  beq >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  ins_next1\r\n  |   stfd f0, 0(CRET1)\r\n  |  ins_next2\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  subfic TMP1, BASE, FRAME_CONT\r\n  |  lp BASE, L->top\r\n  |  stw PC, -16(BASE)\t\t\t// [cont|PC]\r\n  |   add PC, TMP1, BASE\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   li NARGS8:RC, 24\t\t\t// 3 args for func(t, k, v)\r\n  |  stfd f0, 16(BASE)\t\t\t// Copy value to third argument.\r\n  |  b ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tsetr:\r\n  |  stp BASE, L->base\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |  // Returns TValue *.\r\n  |  stfd f14, 0(CRET1)\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  mr CARG1, L\r\n  |   subi PC, PC, 4\r\n  |.if DUALNUM\r\n  |  mr CARG2, RA\r\n  |.else\r\n  |  add CARG2, BASE, RA\r\n  |.endif\r\n  |   stw PC, SAVE_PC\r\n  |.if DUALNUM\r\n  |  mr CARG3, RD\r\n  |.else\r\n  |  add CARG3, BASE, RD\r\n  |.endif\r\n  |   stp BASE, L->base\r\n  |  decode_OP1 CARG4, INS\r\n  |  bl extern lj_meta_comp  // (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |3:\r\n  |  cmplwi CRET1, 1\r\n  |  bgt ->vmeta_binop\r\n  |  subfic CRET1, CRET1, 0\r\n  |4:\r\n  |  lwz INS, 0(PC)\r\n  |   addi PC, PC, 4\r\n  |  decode_RD4 TMP2, INS\r\n  |  addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n  |  and TMP2, TMP2, CRET1\r\n  |  add PC, PC, TMP2\r\n  |->cont_nop:\r\n  |  ins_next\r\n  |\r\n  |->cont_ra:\t\t\t\t// RA = resultptr\r\n  |  lwz INS, -4(PC)\r\n  |   lfd f0, 0(RA)\r\n  |  decode_RA8 TMP1, INS\r\n  |   stfdx f0, BASE, TMP1\r\n  |  b ->cont_nop\r\n  |\r\n  |->cont_condt:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |  .gpr64 extsw TMP0, TMP0\r\n  |  subfic TMP0, TMP0, LJ_TTRUE\t// Branch if result is true.\r\n  |  subfe CRET1, CRET1, CRET1\r\n  |  not CRET1, CRET1\r\n  |  b <4\r\n  |\r\n  |->cont_condf:\t\t\t// RA = resultptr\r\n  |  lwz TMP0, 0(RA)\r\n  |  .gpr64 extsw TMP0, TMP0\r\n  |  subfic TMP0, TMP0, LJ_TTRUE\t// Branch if result is false.\r\n  |  subfe CRET1, CRET1, CRET1\r\n  |  b <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  // CARG2, CARG3, CARG4 are already set by BC_ISEQV/BC_ISNEV.\r\n  |  subi PC, PC, 4\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_equal  // (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  mr CARG2, INS\r\n  |  subi PC, PC, 4\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_equal_cd\t\t// (lua_State *L, BCIns op)\r\n  |  // Returns 0/1 or TValue * (metamethod).\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |  subi PC, PC, 4\r\n  |   stp BASE, L->base\r\n  |   srwi CARG2, RA, 3\r\n  |   mr CARG1, L\r\n  |   srwi CARG3, RD, 3\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |  b ->cont_nop\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_nv:\r\n  |  add CARG3, KBASE, RC\r\n  |  add CARG4, BASE, RB\r\n  |  b >1\r\n  |->vmeta_arith_nv2:\r\n  |.if DUALNUM\r\n  |  mr CARG3, RC\r\n  |  mr CARG4, RB\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vmeta_unm:\r\n  |  mr CARG3, RD\r\n  |  mr CARG4, RD\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vn:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, KBASE, RC\r\n  |  b >1\r\n  |\r\n  |->vmeta_arith_vv:\r\n  |  add CARG3, BASE, RB\r\n  |  add CARG4, BASE, RC\r\n  |.if DUALNUM\r\n  |  b >1\r\n  |.endif\r\n  |->vmeta_arith_vn2:\r\n  |->vmeta_arith_vv2:\r\n  |.if DUALNUM\r\n  |  mr CARG3, RB\r\n  |  mr CARG4, RC\r\n  |.endif\r\n  |1:\r\n  |  add CARG2, BASE, RA\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  decode_OP1 CARG5, INS\t\t// Caveat: CARG5 overlaps INS.\r\n  |  bl extern lj_meta_arith  // (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // Returns NULL (finished) or TValue * (metamethod).\r\n  |  cmplwi CRET1, 0\r\n  |  beq ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = old base, CRET1 = new base, stack = cont/func/o1/o2\r\n  |  sub TMP1, CRET1, BASE\r\n  |   stw PC, -16(CRET1)\t\t// [cont|PC]\r\n  |   mr TMP2, BASE\r\n  |  addi PC, TMP1, FRAME_CONT\r\n  |   mr BASE, CRET1\r\n  |  li NARGS8:RC, 16\t\t\t// 2 args for func(o1, o2).\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n#if LJ_52\r\n  |  mr SAVE0, CARG1\r\n#endif\r\n  |  mr CARG2, RD\r\n  |   stp BASE, L->base\r\n  |  mr CARG1, L\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // Returns NULL (retry) or TValue * (metamethod base).\r\n#if LJ_52\r\n  |  cmplwi CRET1, 0\r\n  |  bne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  mr CARG1, SAVE0\r\n  |  b ->BC_LEN_Z\r\n#else\r\n  |  b ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // TMP2 = old base, BASE = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stp TMP2, L->base\t\t\t// This is the callers base!\r\n  |  subi CARG2, BASE, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, BASE, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\t// Guaranteed to be a function here.\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |  ins_call\r\n  |\r\n  |->vmeta_callt:\t\t\t// Resolve __call for BC_CALLT.\r\n  |  // BASE = old base, RA = new base, RC = nargs*8\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  subi CARG2, RA, 8\r\n  |   stw PC, SAVE_PC\r\n  |  add CARG3, RA, RC\r\n  |   mr SAVE0, NARGS8:RC\r\n  |  bl extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  lwz TMP1, FRAME_PC(BASE)\r\n  |   addi NARGS8:RC, SAVE0, 8\t\t// Got one more argument now.\r\n  |   lwz LFUNC:RB, FRAME_FUNC(RA)\t// Guaranteed to be a function here.\r\n  |  b ->BC_CALLT_Z\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  mr CARG2, RA\r\n  |   stw PC, SAVE_PC\r\n  |  mr SAVE0, INS\r\n  |  bl extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |.if JIT\r\n  |   decode_OP1 TMP0, SAVE0\r\n  |.endif\r\n  |  decode_RA8 RA, SAVE0\r\n  |.if JIT\r\n  |   cmpwi TMP0, BC_JFORI\r\n  |.endif\r\n  |  decode_RD8 RD, SAVE0\r\n  |.if JIT\r\n  |   beqy =>BC_JFORI\r\n  |.endif\r\n  |  b =>BC_FORI\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz CARG4, 8(BASE)\r\n  |   lwz CARG1, 4(BASE)\r\n  |    lwz CARG2, 12(BASE)\r\n  |  blt ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |->ff_ .. name:\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |    lfd FARG2, 8(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  checknum CARG4; bge ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses TMP0 and TMP1.\r\n  |.macro ffgccheck\r\n  |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n  |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n  |  cmplw TMP0, TMP1\r\n  |  bgel ->fff_gcstep\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  li TMP1, LJ_TFALSE\r\n  |   la RA, -8(BASE)\r\n  |  cmplw cr1, CARG3, TMP1\r\n  |    lwz PC, FRAME_PC(BASE)\r\n  |  bge cr1, ->fff_fallback\r\n  |   stw CARG3, 0(RA)\r\n  |  addi RD, NARGS8:RC, 8\t\t// Compute (nresults+1)*8.\r\n  |   stw CARG1, 4(RA)\r\n  |  beq ->fff_res\t\t\t// Done if exactly 1 argument.\r\n  |  li TMP1, 8\r\n  |  subi RC, RC, 8\r\n  |1:\r\n  |  cmplw TMP1, RC\r\n  |   lfdx f0, BASE, TMP1\r\n  |   stfdx f0, RA, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bney <1\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc type\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  .gpr64 extsw CARG1, CARG1\r\n  |  subfc TMP0, TISNUM, CARG1\r\n  |  subfe TMP2, CARG1, CARG1\r\n  |  orc TMP1, TMP2, TMP0\r\n  |  addi TMP1, TMP1, ~LJ_TISNUM+1\r\n  |  slwi TMP1, TMP1, 3\r\n  |   la TMP2, CFUNC:RB->upvalue\r\n  |  lfdx FARG1, TMP2, TMP1\r\n  |  b ->fff_resn\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  checktab CARG3; bne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  lwz TAB:CARG1, TAB:CARG1->metatable\r\n  |2:\r\n  |  li CARG3, LJ_TNIL\r\n  |   cmplwi TAB:CARG1, 0\r\n  |  lwz STR:RC, DISPATCH_GL(gcroot[GCROOT_MMNAME+MM_metatable])(DISPATCH)\r\n  |   beq ->fff_restv\r\n  |  lwz TMP0, TAB:CARG1->hmask\r\n  |   li CARG3, LJ_TTAB\t\t\t// Use metatable as default result.\r\n  |  lwz TMP1, STR:RC->hash\r\n  |  lwz NODE:TMP2, TAB:CARG1->node\r\n  |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n  |  slwi TMP0, TMP1, 5\r\n  |  slwi TMP1, TMP1, 3\r\n  |  sub TMP1, TMP0, TMP1\r\n  |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  lwz CARG4, NODE:TMP2->key\r\n  |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n  |    lwz CARG2, NODE:TMP2->val\r\n  |     lwz TMP1, 4+offsetof(Node, val)(NODE:TMP2)\r\n  |  checkstr CARG4; bne >4\r\n  |   cmpw TMP0, STR:RC; beq >5\r\n  |4:\r\n  |  lwz NODE:TMP2, NODE:TMP2->next\r\n  |  cmplwi NODE:TMP2, 0\r\n  |  beq ->fff_restv\t\t\t// Not found, keep default result.\r\n  |  b <3\r\n  |5:\r\n  |  checknil CARG2\r\n  |  beq ->fff_restv\t\t\t// Ditto for nil value.\r\n  |  mr CARG3, CARG2\t\t\t// Return value of mt.__metatable.\r\n  |  mr CARG1, TMP1\r\n  |  b ->fff_restv\r\n  |\r\n  |6:\r\n  |  cmpwi CARG3, LJ_TUDATA; beq <1\r\n  |  .gpr64 extsw CARG3, CARG3\r\n  |  subfc TMP0, TISNUM, CARG3\r\n  |  subfe TMP2, CARG3, CARG3\r\n  |  orc TMP1, TMP2, TMP0\r\n  |  addi TMP1, TMP1, ~LJ_TISNUM+1\r\n  |  slwi TMP1, TMP1, 2\r\n  |   la TMP2, DISPATCH_GL(gcroot[GCROOT_BASEMT])(DISPATCH)\r\n  |  lwzx TAB:CARG1, TMP2, TMP1\r\n  |  b <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |   checktab CARG3; bne ->fff_fallback\r\n  |  lwz TAB:TMP1, TAB:CARG1->metatable\r\n  |   checktab CARG4; bne ->fff_fallback\r\n  |  cmplwi TAB:TMP1, 0\r\n  |   lbz TMP3, TAB:CARG1->marked\r\n  |  bne ->fff_fallback\r\n  |   andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n  |    stw TAB:CARG2, TAB:CARG1->metatable\r\n  |   beq ->fff_restv\r\n  |  barrierback TAB:CARG1, TMP3, TMP0\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc rawget\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG4, 0(BASE)\r\n  |    lwz TAB:CARG2, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checktab CARG4; bne ->fff_fallback\r\n  |   la CARG3, 8(BASE)\r\n  |   mr CARG1, L\r\n  |  bl extern lj_tab_get  // (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // Returns cTValue *.\r\n  |  lfd FARG1, 0(CRET1)\r\n  |  b ->fff_resn\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly one argument.\r\n  |   checknum CARG1; bgt ->fff_fallback\r\n  |  b ->fff_resn\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  checkstr CARG3\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  beq ->fff_restv\t\t\t// String key?\r\n  |  // Handle numbers inline, unless a number base metatable is present.\r\n  |  lwz TMP0, DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])(DISPATCH)\r\n  |  checknum CARG3\r\n  |  cmplwi cr1, TMP0, 0\r\n  |   stp BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  crorc 4*cr0+eq, 4*cr0+gt, 4*cr1+eq\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  beq ->fff_fallback\r\n  |  ffgccheck\r\n  |  mr CARG1, L\r\n  |  mr CARG2, BASE\r\n  |.if DUALNUM\r\n  |  bl extern lj_strfmt_number\t\t// (lua_State *L, cTValue *o)\r\n  |.else\r\n  |  bl extern lj_strfmt_num\t\t// (lua_State *L, lua_Number *np)\r\n  |.endif\r\n  |  // Returns GCstr *.\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc next\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG1, 0(BASE)\r\n  |    lwz TAB:CARG2, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |   stwx TISNIL, BASE, NARGS8:RC\t// Set missing 2nd arg to nil.\r\n  |  checktab CARG1\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n  |   stp BASE, L->base\t\t\t// Add frame since C call can throw.\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->top\t\t\t// Dummy frame length is ok.\r\n  |  la CARG3, 8(BASE)\r\n  |   stw PC, SAVE_PC\r\n  |  bl extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Returns 0 at end of traversal.\r\n  |  cmplwi CRET1, 0\r\n  |   li CARG3, LJ_TNIL\r\n  |  beq ->fff_restv\t\t\t// End of traversal: return nil.\r\n  |  lfd f0, 8(BASE)\t\t\t// Copy key and value to results.\r\n  |   la RA, -8(BASE)\r\n  |  lfd f1, 16(BASE)\r\n  |  stfd f0, 0(RA)\r\n  |   li RD, (2+1)*8\r\n  |  stfd f1, 8(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  checktab CARG3\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |   stw TISNIL, 8(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc ipairs_aux\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz TAB:CARG1, 4(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP2, 12(BASE)\r\n  |.else\r\n  |    lfd FARG2, 8(BASE)\r\n  |.endif\r\n  |  blt ->fff_fallback\r\n  |  checktab CARG3\r\n  |  checknum cr1, CARG4\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |.if DUALNUM\r\n  |  bne ->fff_fallback\r\n  |  bne cr1, ->fff_fallback\r\n  |.else\r\n  |    lus TMP0, 0x3ff0\r\n  |    stw ZERO, TMPD_LO\r\n  |  bne ->fff_fallback\r\n  |    stw TMP0, TMPD_HI\r\n  |  bge cr1, ->fff_fallback\r\n  |    lfd FARG1, TMPD\r\n  |  toint TMP2, FARG2, f0\r\n  |.endif\r\n  |   lwz TMP0, TAB:CARG1->asize\r\n  |   lwz TMP1, TAB:CARG1->array\r\n  |.if not DUALNUM\r\n  |  fadd FARG2, FARG2, FARG1\r\n  |.endif\r\n  |  addi TMP2, TMP2, 1\r\n  |   la RA, -8(BASE)\r\n  |  cmplw TMP0, TMP2\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 0(RA)\r\n  |   slwi TMP3, TMP2, 3\r\n  |  stw TMP2, 4(RA)\r\n  |.else\r\n  |   slwi TMP3, TMP2, 3\r\n  |  stfd FARG2, 0(RA)\r\n  |.endif\r\n  |  ble >2\t\t\t\t// Not in array part?\r\n  |  lwzx TMP2, TMP1, TMP3\r\n  |  lfdx f0, TMP1, TMP3\r\n  |1:\r\n  |  checknil TMP2\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\t\t\t// End of iteration, return 0 results.\r\n  |   li RD, (2+1)*8\r\n  |  stfd f0, 8(RA)\r\n  |  b ->fff_res\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  lwz TMP0, TAB:CARG1->hmask\r\n  |  cmplwi TMP0, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |   mr CARG2, TMP2\r\n  |  bl extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // Returns cTValue * or NULL.\r\n  |  cmplwi CRET1, 0\r\n  |   li RD, (0+1)*8\r\n  |  beq ->fff_res\r\n  |  lwz TMP2, 0(CRET1)\r\n  |  lfd f0, 0(CRET1)\r\n  |  b <1\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  checktab CARG3\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  bne ->fff_fallback\r\n#if LJ_52\r\n  |   lwz TAB:TMP2, TAB:CARG1->metatable\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |   cmplwi TAB:TMP2, 0\r\n  |  la RA, -8(BASE)\r\n  |   bne ->fff_fallback\r\n#else\r\n  |  lfd f0, CFUNC:RB->upvalue[0]\r\n  |  la RA, -8(BASE)\r\n#endif\r\n  |.if DUALNUM\r\n  |  stw TISNUM, 8(BASE)\r\n  |.else\r\n  |  stw ZERO, 8(BASE)\r\n  |.endif\r\n  |   stw ZERO, 12(BASE)\r\n  |  li RD, (3+1)*8\r\n  |  stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc pcall\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  blt ->fff_fallback\r\n  |   mr TMP2, BASE\r\n  |   la BASE, 8(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP3, TMP3, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |   subi NARGS8:RC, NARGS8:RC, 8\r\n  |  addi PC, TMP3, 8+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |.ffunc xpcall\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG4, 8(BASE)\r\n  |    lfd FARG2, 8(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  blt ->fff_fallback\r\n  |  lbz TMP1, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |   mr TMP2, BASE\r\n  |  checkfunc CARG4; bne ->fff_fallback  // Traceback must be a function.\r\n  |   la BASE, 16(BASE)\r\n  |  // Remember active hook before pcall.\r\n  |  rlwinm TMP1, TMP1, 32-HOOK_ACTIVE_SHIFT, 31, 31\r\n  |    stfd FARG2, 0(TMP2)\t\t// Swap function and traceback.\r\n  |  subi NARGS8:RC, NARGS8:RC, 16\r\n  |    stfd FARG1, 8(TMP2)\r\n  |  addi PC, TMP1, 16+FRAME_PCALL\r\n  |  b ->vm_call_dispatch\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  cmpwi CARG3, LJ_TTHREAD; bne ->fff_fallback\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  lwz L:CARG1, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  lbz TMP0, L:CARG1->status\r\n  |   lp TMP1, L:CARG1->cframe\r\n  |    lp CARG2, L:CARG1->top\r\n  |  cmplwi cr0, TMP0, LUA_YIELD\r\n  |    lp TMP2, L:CARG1->base\r\n  |   cmplwi cr1, TMP1, 0\r\n  |   lwz TMP0, L:CARG1->maxstack\r\n  |    cmplw cr7, CARG2, TMP2\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  crorc 4*cr6+lt, 4*cr0+gt, 4*cr1+eq\t\t// st>LUA_YIELD || cframe!=0\r\n  |   add TMP2, CARG2, NARGS8:RC\r\n  |  crandc 4*cr6+gt, 4*cr7+eq, 4*cr0+eq\t// base==top && st!=LUA_YIELD\r\n  |   cmplw cr1, TMP2, TMP0\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr6+gt\r\n  |   stw PC, SAVE_PC\r\n  |  cror 4*cr6+lt, 4*cr6+lt, 4*cr1+gt\t\t// cond1 || cond2 || stackov\r\n  |   stp BASE, L->base\r\n  |  blt cr6, ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  addi BASE, BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |  subi NARGS8:RC, NARGS8:RC, 8\r\n  |  subi TMP2, TMP2, 8\r\n  |.endif\r\n  |  stp TMP2, L:CARG1->top\r\n  |  li TMP1, 0\r\n  |  stp BASE, L->top\r\n  |2:  // Move args to coroutine.\r\n  |  cmpw TMP1, NARGS8:RC\r\n  |   lfdx f0, BASE, TMP1\r\n  |  beq >3\r\n  |   stfdx f0, CARG2, TMP1\r\n  |  addi TMP1, TMP1, 8\r\n  |  b <2\r\n  |3:\r\n  |  li CARG3, 0\r\n  |   mr L:SAVE0, L:CARG1\r\n  |  li CARG4, 0\r\n  |  bl ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |  // Returns thread status.\r\n  |4:\r\n  |  lp TMP2, L:SAVE0->base\r\n  |   cmplwi CRET1, LUA_YIELD\r\n  |  lp TMP3, L:SAVE0->top\r\n  |    li_vmstate INTERP\r\n  |  lp BASE, L->base\r\n  |    stw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |    st_vmstate\r\n  |   bgt >8\r\n  |  sub RD, TMP3, TMP2\r\n  |   lwz TMP0, L->maxstack\r\n  |  cmplwi RD, 0\r\n  |   add TMP1, BASE, RD\r\n  |  beq >6\t\t\t\t// No results?\r\n  |  cmplw TMP1, TMP0\r\n  |   li TMP1, 0\r\n  |  bgt >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  subi TMP3, RD, 8\r\n  |   stp TMP2, L:SAVE0->top\t\t// Clear coroutine stack.\r\n  |5:  // Move results from coroutine.\r\n  |  cmplw TMP1, TMP3\r\n  |   lfdx f0, TMP2, TMP1\r\n  |   stfdx f0, BASE, TMP1\r\n  |    addi TMP1, TMP1, 8\r\n  |  bne <5\r\n  |6:\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |.if resume\r\n  |  li TMP1, LJ_TTRUE\r\n  |   la RA, -8(BASE)\r\n  |  stw TMP1, -8(BASE)\t\t\t// Prepend true to results.\r\n  |  addi RD, RD, 16\r\n  |.else\r\n  |  mr RA, BASE\r\n  |  addi RD, RD, 8\r\n  |.endif\r\n  |7:\r\n  |    stw PC, SAVE_PC\r\n  |   mr MULTRES, RD\r\n  |  beq ->BC_RET_Z\r\n  |  b ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |  la TMP3, -8(TMP3)\r\n  |   li TMP1, LJ_TFALSE\r\n  |  lfd f0, 0(TMP3)\r\n  |   stp TMP3, L:SAVE0->top\t\t// Remove error from coroutine stack.\r\n  |    li RD, (2+1)*8\r\n  |   stw TMP1, -8(BASE)\t\t// Prepend false to results.\r\n  |    la RA, -8(BASE)\r\n  |  stfd f0, 0(BASE)\t\t\t// Copy error message.\r\n  |  b <7\r\n  |.else\r\n  |  mr CARG1, L\r\n  |  mr CARG2, L:SAVE0\r\n  |  bl extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mr CARG1, L\r\n  |  srwi CARG2, RD, 3\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  li CRET1, 0\r\n  |  b <4\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  lp TMP0, L->cframe\r\n  |   add TMP1, BASE, NARGS8:RC\r\n  |   stp BASE, L->base\r\n  |  andix. TMP0, TMP0, CFRAME_RESUME\r\n  |   stp TMP1, L->top\r\n  |    li CRET1, LUA_YIELD\r\n  |  beq ->fff_fallback\r\n  |   stp ZERO, L->cframe\r\n  |    stb CRET1, L->status\r\n  |  b ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.ffunc_1 math_abs\r\n  |  checknum CARG3\r\n  |.if DUALNUM\r\n  |  bne >2\r\n  |  srawi TMP1, CARG1, 31\r\n  |  xor TMP2, TMP1, CARG1\r\n  |.if GPR64\r\n  |  lus TMP0, 0x8000\r\n  |  sub CARG1, TMP2, TMP1\r\n  |  cmplw CARG1, TMP0\r\n  |  beq >1\r\n  |.else\r\n  |  sub. CARG1, TMP2, TMP1\r\n  |  blt >1\r\n  |.endif\r\n  |->fff_resi:\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |  la RA, -8(BASE)\r\n  |  stw TISNUM, -8(BASE)\r\n  |  stw CRET1, -4(BASE)\r\n  |  b ->fff_res1\r\n  |1:\r\n  |  lus CARG3, 0x41e0\t// 2^31.\r\n  |  li CARG1, 0\r\n  |  b ->fff_restv\r\n  |2:\r\n  |.endif\r\n  |  bge ->fff_fallback\r\n  |  rlwinm CARG3, CARG3, 0, 1, 31\r\n  |  // Fallthrough.\r\n  |\r\n  |->fff_restv:\r\n  |  // CARG3/CARG1 = TValue result.\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |   stw CARG3, -8(BASE)\r\n  |  la RA, -8(BASE)\r\n  |   stw CARG1, -4(BASE)\r\n  |->fff_res1:\r\n  |  // RA = results, PC = return.\r\n  |  li RD, (1+1)*8\r\n  |->fff_res:\r\n  |  // RA = results, RD = (nresults+1)*8, PC = return.\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   mr MULTRES, RD\r\n  |  bney ->vm_return\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RB8 RB, INS\r\n  |5:\r\n  |  cmplw RB, RD\t\t\t// More results expected?\r\n  |   decode_RA8 TMP0, INS\r\n  |  bgt >6\r\n  |  ins_next1\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |   sub BASE, RA, TMP0\r\n  |  ins_next2\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  subi TMP1, RD, 8\r\n  |   addi RD, RD, 8\r\n  |  stwx TISNIL, RA, TMP1\r\n  |  b <5\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc_n math_ .. func\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc_1 math_ .. func\r\n  |   checknum CARG3; beqy ->fff_restv\r\n  |  rlwinm TMP2, CARG3, 12, 21, 31\r\n  |   bge ->fff_fallback\r\n  |  addic. TMP2, TMP2, -1023\t\t// exp = exponent(x) - 1023\r\n  |  cmplwi cr1, TMP2, 31\t\t// 0 <= exp < 31?\r\n  |   subfic TMP0, TMP2, 31\r\n  |  blt >3\r\n  |  slwi TMP1, CARG3, 11\r\n  |   srwi TMP3, CARG1, 21\r\n  |  oris TMP1, TMP1, 0x8000\r\n  |   addi TMP2, TMP2, 1\r\n  |  or TMP1, TMP1, TMP3\r\n  |   slwi CARG2, CARG1, 11\r\n  |  bge cr1, >4\r\n  |   slw TMP3, TMP1, TMP2\r\n  |  srw RD, TMP1, TMP0\r\n  |   or TMP3, TMP3, CARG2\r\n  |  srawi TMP2, CARG3, 31\r\n  |.if \"func\" == \"floor\"\r\n  |  and TMP1, TMP3, TMP2\r\n  |  addic TMP0, TMP1, -1\r\n  |  subfe TMP1, TMP0, TMP1\r\n  |  add CARG1, RD, TMP1\r\n  |  xor CARG1, CARG1, TMP2\r\n  |  sub CARG1, CARG1, TMP2\r\n  |  b ->fff_resi\r\n  |.else\r\n  |  andc TMP1, TMP3, TMP2\r\n  |  addic TMP0, TMP1, -1\r\n  |  subfe TMP1, TMP0, TMP1\r\n  |  add CARG1, RD, TMP1\r\n  |  cmpw CARG1, RD\r\n  |  xor CARG1, CARG1, TMP2\r\n  |  sub CARG1, CARG1, TMP2\r\n  |  bge ->fff_resi\r\n  |  // Overflow to 2^31.\r\n  |  lus CARG3, 0x41e0\t\t\t// 2^31.\r\n  |  li CARG1, 0\r\n  |  b ->fff_restv\r\n  |.endif\r\n  |3:  // |x| < 1\r\n  |  slwi TMP2, CARG3, 1\r\n  |   srawi TMP1, CARG3, 31\r\n  |  or TMP2, CARG1, TMP2\t\t// ztest = (hi+hi) | lo\r\n  |.if \"func\" == \"floor\"\r\n  |  and TMP1, TMP2, TMP1\t\t// (ztest & sign) == 0 ? 0 : -1\r\n  |  subfic TMP2, TMP1, 0\r\n  |  subfe CARG1, CARG1, CARG1\r\n  |.else\r\n  |  andc TMP1, TMP2, TMP1\t\t// (ztest & ~sign) == 0 ? 0 : 1\r\n  |  addic TMP2, TMP1, -1\r\n  |  subfe CARG1, TMP2, TMP1\r\n  |.endif\r\n  |  b ->fff_resi\r\n  |4:  // exp >= 31. Check for -(2^31).\r\n  |  xoris TMP1, TMP1, 0x8000\r\n  |  srawi TMP2, CARG3, 31\r\n  |.if \"func\" == \"floor\"\r\n  |  or TMP1, TMP1, CARG2\r\n  |.endif\r\n  |.if PPE\r\n  |  orc TMP1, TMP1, TMP2\r\n  |  cmpwi TMP1, 0\r\n  |.else\r\n  |  orc. TMP1, TMP1, TMP2\r\n  |.endif\r\n  |  crand 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n  |  lus CARG1, 0x8000\t\t\t// -(2^31).\r\n  |  beqy ->fff_resi\r\n  |5:\r\n  |  lfd FARG1, 0(BASE)\r\n  |  blex func\r\n  |  b ->fff_resn\r\n  |.endmacro\r\n  |\r\n  |.if DUALNUM\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |.else\r\n  |  // NYI: use internal implementation.\r\n  |  math_extern floor\r\n  |  math_extern ceil\r\n  |.endif\r\n  |\r\n  |.if SQRT\r\n  |.ffunc_n math_sqrt\r\n  |  fsqrt FARG1, FARG1\r\n  |  b ->fff_resn\r\n  |.else\r\n  |  math_extern sqrt\r\n  |.endif\r\n  |\r\n  |.ffunc math_log\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  blex log\r\n  |  b ->fff_resn\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.if DUALNUM\r\n  |.ffunc math_ldexp\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lfd FARG1, 0(BASE)\r\n  |   lwz CARG4, 8(BASE)\r\n  |.if GPR64\r\n  |    lwz CARG2, 12(BASE)\r\n  |.else\r\n  |    lwz CARG1, 12(BASE)\r\n  |.endif\r\n  |  blt ->fff_fallback\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  checknum CARG4; bne ->fff_fallback\r\n  |.else\r\n  |.ffunc_nn math_ldexp\r\n  |.if GPR64\r\n  |  toint CARG2, FARG2\r\n  |.else\r\n  |  toint CARG1, FARG2\r\n  |.endif\r\n  |.endif\r\n  |  blex ldexp\r\n  |  b ->fff_resn\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |.if GPR64\r\n  |  la CARG2, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |.else\r\n  |  la CARG1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |.endif\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  blex frexp\r\n  |   lwz TMP1, DISPATCH_GL(tmptv)(DISPATCH)\r\n  |   la RA, -8(BASE)\r\n  |.if not DUALNUM\r\n  |   tonum_i FARG2, TMP1\r\n  |.endif\r\n  |  stfd FARG1, 0(RA)\r\n  |  li RD, (2+1)*8\r\n  |.if DUALNUM\r\n  |   stw TISNUM, 8(RA)\r\n  |   stw TMP1, 12(RA)\r\n  |.else\r\n  |   stfd FARG2, 8(RA)\r\n  |.endif\r\n  |  b ->fff_res\r\n  |\r\n  |.ffunc_n math_modf\r\n  |.if GPR64\r\n  |  la CARG2, -8(BASE)\r\n  |.else\r\n  |  la CARG1, -8(BASE)\r\n  |.endif\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  blex modf\r\n  |   la RA, -8(BASE)\r\n  |  stfd FARG1, 0(BASE)\r\n  |  li RD, (2+1)*8\r\n  |  b ->fff_res\r\n  |\r\n  |.macro math_minmax, name, ismax\r\n  |.if DUALNUM\r\n  |  .ffunc_1 name\r\n  |  checknum CARG3\r\n  |   addi TMP1, BASE, 8\r\n  |   add TMP2, BASE, NARGS8:RC\r\n  |  bne >4\r\n  |1:  // Handle integers.\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |  lwz CARG2, 4(TMP1)\r\n  |   bge cr1, ->fff_resi\r\n  |  checknum CARG4\r\n  |   xoris TMP0, CARG1, 0x8000\r\n  |   xoris TMP3, CARG2, 0x8000\r\n  |  bne >3\r\n  |  subfc TMP3, TMP3, TMP0\r\n  |  subfe TMP0, TMP0, TMP0\r\n  |.if ismax\r\n  |  andc TMP3, TMP3, TMP0\r\n  |.else\r\n  |  and TMP3, TMP3, TMP0\r\n  |.endif\r\n  |  add CARG1, TMP3, CARG2\r\n  |.if GPR64\r\n  |  rldicl CARG1, CARG1, 0, 32\r\n  |.endif\r\n  |   addi TMP1, TMP1, 8\r\n  |  b <1\r\n  |3:\r\n  |  bge ->fff_fallback\r\n  |  // Convert intermediate result to number and continue below.\r\n  |  tonum_i FARG1, CARG1\r\n  |  lfd FARG2, 0(TMP1)\r\n  |  b >6\r\n  |4:\r\n  |   lfd FARG1, 0(BASE)\r\n  |  bge ->fff_fallback\r\n  |5:  // Handle numbers.\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |  lfd FARG2, 0(TMP1)\r\n  |   bge cr1, ->fff_resn\r\n  |  checknum CARG4; bge >7\r\n  |6:\r\n  |  fsub f0, FARG1, FARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |.if ismax\r\n  |  fsel FARG1, f0, FARG1, FARG2\r\n  |.else\r\n  |  fsel FARG1, f0, FARG2, FARG1\r\n  |.endif\r\n  |  b <5\r\n  |7:  // Convert integer to number and continue above.\r\n  |   lwz CARG2, 4(TMP1)\r\n  |  bne ->fff_fallback\r\n  |  tonum_i FARG2, CARG2\r\n  |  b <6\r\n  |.else\r\n  |  .ffunc_n name\r\n  |  li TMP1, 8\r\n  |1:\r\n  |   lwzx CARG2, BASE, TMP1\r\n  |   lfdx FARG2, BASE, TMP1\r\n  |  cmplw cr1, TMP1, NARGS8:RC\r\n  |   checknum CARG2\r\n  |  bge cr1, ->fff_resn\r\n  |   bge ->fff_fallback\r\n  |  fsub f0, FARG1, FARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |.if ismax\r\n  |  fsel FARG1, f0, FARG1, FARG2\r\n  |.else\r\n  |  fsel FARG1, f0, FARG2, FARG1\r\n  |.endif\r\n  |  b <1\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, 0\r\n  |  math_minmax math_max, 1\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Need exactly 1 argument.\r\n  |   checkstr CARG3\r\n  |   bne ->fff_fallback\r\n  |  lwz TMP0, STR:CARG1->len\r\n  |.if DUALNUM\r\n  |   lbz CARG1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |   li RD, (0+1)*8\r\n  |   lwz PC, FRAME_PC(BASE)\r\n  |  cmplwi TMP0, 0\r\n  |   la RA, -8(BASE)\r\n  |  beqy ->fff_res\r\n  |  b ->fff_resi\r\n  |.else\r\n  |   lbz TMP1, STR:CARG1[1]\t\t// Access is always ok (NUL at end).\r\n  |  addic TMP3, TMP0, -1\t\t// RD = ((str->len != 0)+1)*8\r\n  |  subfe RD, TMP3, TMP0\r\n  |   stw TMP1, TONUM_LO\t\t// Inlined tonum_u f0, TMP1.\r\n  |  addi RD, RD, 1\r\n  |   lfd f0, TONUM_D\r\n  |  la RA, -8(BASE)\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |   fsub f0, f0, TOBIT\r\n  |  slwi RD, RD, 3\r\n  |   stfd f0, 0(RA)\r\n  |  b ->fff_res\r\n  |.endif\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP0, 4(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 1 argument.\r\n  |  checknum CARG3; bne ->fff_fallback\r\n  |   la CARG2, 7(BASE)\r\n  |.else\r\n  |    lfd FARG1, 0(BASE)\r\n  |  bne ->fff_fallback\t\t\t// Exactly 1 argument.\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  toint TMP0, FARG1\r\n  |   la CARG2, TMPD_BLO\r\n  |.endif\r\n  |   li CARG3, 1\r\n  |  cmplwi TMP0, 255; bgt ->fff_fallback\r\n  |->fff_newstr:\r\n  |  mr CARG1, L\r\n  |  stp BASE, L->base\r\n  |  stw PC, SAVE_PC\r\n  |  bl extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |->fff_resstr:\r\n  |  // Returns GCstr *.\r\n  |  lp BASE, L->base\r\n  |  li CARG3, LJ_TSTR\r\n  |  b ->fff_restv\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 16\r\n  |   lwz CARG3, 16(BASE)\r\n  |.if not DUALNUM\r\n  |    lfd f0, 16(BASE)\r\n  |.endif\r\n  |   lwz TMP0, 0(BASE)\r\n  |    lwz STR:CARG1, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |   lwz CARG2, 8(BASE)\r\n  |.if DUALNUM\r\n  |    lwz TMP1, 12(BASE)\r\n  |.else\r\n  |    lfd f1, 8(BASE)\r\n  |.endif\r\n  |   li TMP2, -1\r\n  |  beq >1\r\n  |.if DUALNUM\r\n  |  checknum CARG3\r\n  |   lwz TMP2, 20(BASE)\r\n  |  bne ->fff_fallback\r\n  |1:\r\n  |  checknum CARG2; bne ->fff_fallback\r\n  |.else\r\n  |  checknum CARG3; bge ->fff_fallback\r\n  |  toint TMP2, f0\r\n  |1:\r\n  |  checknum CARG2; bge ->fff_fallback\r\n  |.endif\r\n  |  checkstr TMP0; bne ->fff_fallback\r\n  |.if not DUALNUM\r\n  |   toint TMP1, f1\r\n  |.endif\r\n  |   lwz TMP0, STR:CARG1->len\r\n  |  cmplw TMP0, TMP2\t\t\t// len < end? (unsigned compare)\r\n  |   addi TMP3, TMP2, 1\r\n  |  blt >5\r\n  |2:\r\n  |  cmpwi TMP1, 0\t\t\t// start <= 0?\r\n  |   add TMP3, TMP1, TMP0\r\n  |  ble >7\r\n  |3:\r\n  |  sub CARG3, TMP2, TMP1\r\n  |    addi CARG2, STR:CARG1, #STR-1\r\n  |  srawi TMP0, CARG3, 31\r\n  |   addi CARG3, CARG3, 1\r\n  |    add CARG2, CARG2, TMP1\r\n  |  andc CARG3, CARG3, TMP0\r\n  |.if GPR64\r\n  |  rldicl CARG2, CARG2, 0, 32\r\n  |  rldicl CARG3, CARG3, 0, 32\r\n  |.endif\r\n  |  b ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  cmpw TMP0, TMP2\t\t\t// len >= end? (signed compare)\r\n  |   add TMP2, TMP0, TMP3\t\t// Negative end: end = end+len+1.\r\n  |  bge <2\r\n  |   mr TMP2, TMP0\t\t\t// Overflow: end = len.\r\n  |  b <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |  .gpr64 extsw TMP1, TMP1\r\n  |  addic CARG3, TMP1, -1\r\n  |  subfe CARG3, CARG3, CARG3\r\n  |   srawi CARG2, TMP3, 31\t\t// Note: modifies carry.\r\n  |  andc TMP3, TMP3, CARG3\r\n  |   andc TMP1, TMP3, CARG2\r\n  |  addi TMP1, TMP1, 1\t\t\t// start = 1 + (start ? start+len : 0)\r\n  |  b <3\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc string_ .. name\r\n  |  ffgccheck\r\n  |  cmplwi NARGS8:RC, 8\r\n  |   lwz CARG3, 0(BASE)\r\n  |    lwz STR:CARG2, 4(BASE)\r\n  |  blt ->fff_fallback\r\n  |  checkstr CARG3\r\n  |   la SBUF:CARG1, DISPATCH_GL(tmpbuf)(DISPATCH)\r\n  |  bne ->fff_fallback\r\n  |   lwz TMP0, SBUF:CARG1->b\r\n  |  stw L, SBUF:CARG1->L\r\n  |  stp BASE, L->base\r\n  |  stw PC, SAVE_PC\r\n  |   stw TMP0, SBUF:CARG1->p\r\n  |  bl extern lj_buf_putstr_ .. name\r\n  |  bl extern lj_buf_tostr\r\n  |  b ->fff_resstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name\r\n  |.if DUALNUM\r\n  |  .ffunc_1 bit_..name\r\n  |  checknum CARG3; bnel ->fff_tobit_fb\r\n  |.else\r\n  |  .ffunc_n bit_..name\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |.endif\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name\r\n  |  addi TMP1, BASE, 8\r\n  |  add TMP2, BASE, NARGS8:RC\r\n  |1:\r\n  |  lwz CARG4, 0(TMP1)\r\n  |   cmplw cr1, TMP1, TMP2\r\n  |.if DUALNUM\r\n  |  lwz CARG2, 4(TMP1)\r\n  |.else\r\n  |  lfd FARG1, 0(TMP1)\r\n  |.endif\r\n  |   bgey cr1, ->fff_resi\r\n  |  checknum CARG4\r\n  |.if DUALNUM\r\n  |  bnel ->fff_bitop_fb\r\n  |.else\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  bge ->fff_fallback\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |.endif\r\n  |  ins CARG1, CARG1, CARG2\r\n  |   addi TMP1, TMP1, 8\r\n  |  b <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op band, and\r\n  |.ffunc_bit_op bor, or\r\n  |.ffunc_bit_op bxor, xor\r\n  |\r\n  |.ffunc_bit bswap\r\n  |  rotlwi TMP0, CARG1, 8\r\n  |  rlwimi TMP0, CARG1, 24, 0, 7\r\n  |  rlwimi TMP0, CARG1, 24, 16, 23\r\n  |  mr CRET1, TMP0\r\n  |  b ->fff_resi\r\n  |\r\n  |.ffunc_bit bnot\r\n  |  not CRET1, CARG1\r\n  |  b ->fff_resi\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins, shmod\r\n  |.if DUALNUM\r\n  |  .ffunc_2 bit_..name\r\n  |  checknum CARG3; bnel ->fff_tobit_fb\r\n  |  // Note: no inline conversion from number for 2nd argument!\r\n  |  checknum CARG4; bne ->fff_fallback\r\n  |.else\r\n  |  .ffunc_nn bit_..name\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  fadd FARG2, FARG2, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |  stfd FARG2, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |.endif\r\n  |.if shmod == 1\r\n  |  rlwinm CARG2, CARG2, 0, 27, 31\r\n  |.elif shmod == 2\r\n  |  neg CARG2, CARG2\r\n  |.endif\r\n  |  ins CRET1, CARG1, CARG2\r\n  |  b ->fff_resi\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh lshift, slw, 1\r\n  |.ffunc_bit_sh rshift, srw, 1\r\n  |.ffunc_bit_sh arshift, sraw, 1\r\n  |.ffunc_bit_sh rol, rotlw, 0\r\n  |.ffunc_bit_sh ror, rotlw, 2\r\n  |\r\n  |.ffunc_bit tobit\r\n  |.if DUALNUM\r\n  |  b ->fff_resi\r\n  |.else\r\n  |->fff_resi:\r\n  |  tonum_i FARG1, CRET1\r\n  |.endif\r\n  |->fff_resn:\r\n  |  lwz PC, FRAME_PC(BASE)\r\n  |  la RA, -8(BASE)\r\n  |  stfd FARG1, -8(BASE)\r\n  |  b ->fff_res1\r\n  |\r\n  |// Fallback FP number to bit conversion.\r\n  |->fff_tobit_fb:\r\n  |.if DUALNUM\r\n  |  lfd FARG1, 0(BASE)\r\n  |  bgt ->fff_fallback\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG1, TMPD_LO\r\n  |  blr\r\n  |.endif\r\n  |->fff_bitop_fb:\r\n  |.if DUALNUM\r\n  |  lfd FARG1, 0(TMP1)\r\n  |  bgt ->fff_fallback\r\n  |  fadd FARG1, FARG1, TOBIT\r\n  |  stfd FARG1, TMPD\r\n  |  lwz CARG2, TMPD_LO\r\n  |  blr\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RB = CFUNC, RC = nargs*8\r\n  |  lp TMP3, CFUNC:RB->f\r\n  |    add TMP1, BASE, NARGS8:RC\r\n  |   lwz PC, FRAME_PC(BASE)\t\t// Fallback may overwrite PC.\r\n  |    addi TMP0, TMP1, 8*LUA_MINSTACK\r\n  |     lwz TMP2, L->maxstack\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  .toc lp TMP3, 0(TMP3)\r\n  |  cmplw TMP0, TMP2\r\n  |     stp BASE, L->base\r\n  |    stp TMP1, L->top\r\n  |   mr CARG1, L\r\n  |  bgt >5\t\t\t\t// Need to grow stack.\r\n  |  mtctr TMP3\r\n  |  bctrl\t\t\t\t// (lua_State *L)\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  lp BASE, L->base\r\n  |  cmpwi CRET1, 0\r\n  |   slwi RD, CRET1, 3\r\n  |   la RA, -8(BASE)\r\n  |  bgt ->fff_res\t\t\t// Returned nresults+1?\r\n  |1:  // Returned 0 or -1: retry fast path.\r\n  |  lp TMP0, L->top\r\n  |   lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  bne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  andix. TMP0, PC, FRAME_TYPE\r\n  |   rlwinm TMP1, PC, 0, 0, 28\r\n  |  bne >3\r\n  |  lwz INS, -4(PC)\r\n  |  decode_RA8 TMP1, INS\r\n  |  addi TMP1, TMP1, 8\r\n  |3:\r\n  |  sub TMP2, BASE, TMP1\r\n  |  b ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  li CARG2, LUA_MINSTACK\r\n  |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  lp BASE, L->base\r\n  |  cmpw TMP0, TMP0\t\t\t// Set 4*cr0+eq to force retry.\r\n  |  b <1\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RC = nargs*8\r\n  |  mflr SAVE0\r\n  |   stp BASE, L->base\r\n  |  add TMP0, BASE, NARGS8:RC\r\n  |   stw PC, SAVE_PC\t\t\t// Redundant (but a defined value).\r\n  |  stp TMP0, L->top\r\n  |  mr CARG1, L\r\n  |  bl extern lj_gc_step\t\t// (lua_State *L)\r\n  |   lp BASE, L->base\r\n  |  mtlr SAVE0\r\n  |    lp TMP0, L->top\r\n  |   sub NARGS8:RC, TMP0, BASE\r\n  |   lwz CFUNC:RB, FRAME_FUNC(BASE)\r\n  |  blr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_VMEVENT\t// No recording while in vmevent.\r\n  |  bne >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |   lwz TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\r\n  |  bne >1\r\n  |   subi TMP2, TMP2, 1\r\n  |  andi. TMP0, TMP3, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  beqy >1\r\n  |   stw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |  beq >1\r\n  |5:  // Re-dispatch to static ins.\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\t// Assumes decode_OPP TMP1, INS.\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  lbz TMP3, DISPATCH_GL(hookmask)(DISPATCH)\r\n  |  lwz TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  andix. TMP0, TMP3, HOOK_ACTIVE\t// Hook already active?\r\n  |   rlwinm TMP0, TMP3, 31-LUA_HOOKLINE, 31, 0\r\n  |  bne <5\r\n  |\r\n  |   cmpwi cr1, TMP0, 0\r\n  |  addic. TMP2, TMP2, -1\r\n  |   beq cr1, <5\r\n  |  stw TMP2, DISPATCH_GL(hookcount)(DISPATCH)\r\n  |  beq >1\r\n  |   bge cr1, <5\r\n  |1:\r\n  |  mr CARG1, L\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  mr CARG2, PC\r\n  |   stp BASE, L->base\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  bl extern lj_dispatch_ins\t\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  lp BASE, L->base\r\n  |4:  // Re-dispatch to static ins.\r\n  |  lwz INS, -4(PC)\r\n  |  decode_OPP TMP1, INS\r\n  |   decode_RB8 RB, INS\r\n  |  addi TMP1, TMP1, GG_DISP2STATIC\r\n  |   decode_RD8 RD, INS\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RC8 RC, INS\r\n  |  mtctr TMP0\r\n  |  bctr\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  addi PC, PC, 4\r\n  |  lwz MULTRES, -20(RB)\t\t// Restore MULTRES for *M ins.\r\n  |  b <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n  |   addi CARG1, DISPATCH, GG_DISP2J\r\n  |   stw PC, SAVE_PC\r\n  |  lwz TMP1, LFUNC:TMP1->pc\r\n  |   mr CARG2, PC\r\n  |   stw L, DISPATCH_J(L)(DISPATCH)\r\n  |  lbz TMP1, PC2PROTO(framesize)(TMP1)\r\n  |   stp BASE, L->base\r\n  |  slwi TMP1, TMP1, 3\r\n  |  add TMP1, BASE, TMP1\r\n  |  stp TMP1, L->top\r\n  |  bl extern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mr CARG2, PC\r\n  |.if JIT\r\n  |  b >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  ori CARG2, PC, 1\r\n  |1:\r\n  |.endif\r\n  |  add TMP0, BASE, RC\r\n  |   stw PC, SAVE_PC\r\n  |  mr CARG1, L\r\n  |   stp BASE, L->base\r\n  |  sub RA, RA, BASE\r\n  |   stp TMP0, L->top\r\n  |  bl extern lj_dispatch_call\t\t// (lua_State *L, const BCIns *pc)\r\n  |  // Returns ASMFunction.\r\n  |  lp BASE, L->base\r\n  |   lp TMP0, L->top\r\n  |   stw ZERO, SAVE_PC\t\t\t// Invalidate for subsequent line hook.\r\n  |  sub NARGS8:RC, TMP0, BASE\r\n  |  add RA, BASE, RA\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |  lwz INS, -4(PC)\r\n  |  mtctr CRET1\r\n  |  bctr\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |.if JIT\r\n  |  // RA = resultptr, RB = meta base\r\n  |  lwz INS, -4(PC)\r\n  |    lwz TMP3, -20(RB)\t\t// Save previous trace number.\r\n  |   addic. TMP1, MULTRES, -8\r\n  |  decode_RA8 RC, INS\t\t\t// Call base.\r\n  |   beq >2\r\n  |1:  // Move results down.\r\n  |  lfd f0, 0(RA)\r\n  |   addic. TMP1, TMP1, -8\r\n  |    addi RA, RA, 8\r\n  |  stfdx f0, BASE, RC\r\n  |    addi RC, RC, 8\r\n  |   bne <1\r\n  |2:\r\n  |   decode_RA8 RA, INS\r\n  |   decode_RB8 RB, INS\r\n  |   add RA, RA, RB\r\n  |  lwz TMP1, DISPATCH_J(trace)(DISPATCH)\r\n  |3:\r\n  |   cmplw RA, RC\r\n  |   bgt >9\t\t\t\t// More results wanted?\r\n  |\r\n  |  slwi TMP2, TMP3, 2\r\n  |  lwzx TRACE:TMP2, TMP1, TMP2\r\n  |  cmpwi TRACE:TMP2, 0\r\n  |  beq ->cont_nop\r\n  |  lhz RD, TRACE:TMP2->link\r\n  |  cmpw RD, TMP3\r\n  |   cmpwi cr1, RD, 0\r\n  |  beq ->cont_nop\t\t\t// Blacklisted.\r\n  |    slwi RD, RD, 3\r\n  |   bne cr1, =>BC_JLOOP\t\t// Jump to stitched trace.\r\n  |\r\n  |  // Stitch a new trace to the previous trace.\r\n  |  stw TMP3, DISPATCH_J(exitno)(DISPATCH)\r\n  |  stp L, DISPATCH_J(L)(DISPATCH)\r\n  |  stp BASE, L->base\r\n  |  addi CARG1, DISPATCH, GG_DISP2J\r\n  |  mr CARG2, PC\r\n  |  bl extern lj_dispatch_stitch\t// (jit_State *J, const BCIns *pc)\r\n  |  lp BASE, L->base\r\n  |  b ->cont_nop\r\n  |\r\n  |9:\r\n  |  stwx TISNIL, BASE, RC\r\n  |  addi RC, RC, 8\r\n  |  b <3\r\n  |.endif\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  mr CARG1, L\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  mr CARG2, PC\r\n  |   stp BASE, L->base\r\n  |  bl extern lj_dispatch_profile\t// (lua_State *L, const BCIns *pc)\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  lp BASE, L->base\r\n  |  subi PC, PC, 4\r\n  |  b ->cont_nop\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro savex_, a, b, c, d\r\n  |  stfd f..a, 16+a*8(sp)\r\n  |  stfd f..b, 16+b*8(sp)\r\n  |  stfd f..c, 16+c*8(sp)\r\n  |  stfd f..d, 16+d*8(sp)\r\n  |.endmacro\r\n  |\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  addi sp, sp, -(16+32*8+32*4)\r\n  |  stmw r2, 16+32*8+2*4(sp)\r\n  |    addi DISPATCH, JGL, -GG_DISP2G-32768\r\n  |    li CARG2, ~LJ_VMST_EXIT\r\n  |   lwz CARG1, 16+32*8+32*4(sp)\t// Get stack chain.\r\n  |    stw CARG2, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  savex_ 0,1,2,3\r\n  |   stw CARG1, 0(sp)\t\t\t// Store extended stack chain.\r\n  |   clrso TMP1\r\n  |  savex_ 4,5,6,7\r\n  |   addi CARG2, sp, 16+32*8+32*4\t// Recompute original value of sp.\r\n  |  savex_ 8,9,10,11\r\n  |   stw CARG2, 16+32*8+1*4(sp)\t// Store sp in RID_SP.\r\n  |  savex_ 12,13,14,15\r\n  |   mflr CARG3\r\n  |   li TMP1, 0\r\n  |  savex_ 16,17,18,19\r\n  |   stw TMP1, 16+32*8+0*4(sp)\t\t// Clear RID_TMP.\r\n  |  savex_ 20,21,22,23\r\n  |   lhz CARG4, 2(CARG3)\t\t// Load trace number.\r\n  |  savex_ 24,25,26,27\r\n  |  lwz L, DISPATCH_GL(cur_L)(DISPATCH)\r\n  |  savex_ 28,29,30,31\r\n  |   sub CARG3, TMP0, CARG3\t\t// Compute exit number.\r\n  |  lp BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |   srwi CARG3, CARG3, 2\r\n  |  stp L, DISPATCH_J(L)(DISPATCH)\r\n  |   subi CARG3, CARG3, 2\r\n  |  stp BASE, L->base\r\n  |   stw CARG4, DISPATCH_J(parent)(DISPATCH)\r\n  |  stw TMP1, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  addi CARG1, DISPATCH, GG_DISP2J\r\n  |   stw CARG3, DISPATCH_J(exitno)(DISPATCH)\r\n  |  addi CARG2, sp, 16\r\n  |  bl extern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |  // Returns MULTRES (unscaled) or negated error code.\r\n  |  lp TMP1, L->cframe\r\n  |  lwz TMP2, 0(sp)\r\n  |   lp BASE, L->base\r\n  |.if GPR64\r\n  |  rldicr sp, TMP1, 0, 61\r\n  |.else\r\n  |  rlwinm sp, TMP1, 0, 0, 29\r\n  |.endif\r\n  |   lwz PC, SAVE_PC\t\t\t// Get SAVE_PC.\r\n  |  stw TMP2, 0(sp)\r\n  |  stw L, SAVE_L\t\t\t// Set SAVE_L (on-trace resume/yield).\r\n  |  b >1\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |.if JIT\r\n  |  // CARG1 = MULTRES or negated error code, BASE, PC and JGL set.\r\n  |  lwz L, SAVE_L\r\n  |  addi DISPATCH, JGL, -GG_DISP2G-32768\r\n  |  stp BASE, L->base\r\n  |1:\r\n  |  cmpwi CARG1, 0\r\n  |  blt >9\t\t\t\t// Check for error from exit.\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |   slwi MULTRES, CARG1, 3\r\n  |    li TMP2, 0\r\n  |   stw MULTRES, SAVE_MULTRES\r\n  |  lwz TMP1, LFUNC:RB->pc\r\n  |    stw TMP2, DISPATCH_GL(jit_base)(DISPATCH)\r\n  |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |  // Setup type comparison constants.\r\n  |  li TISNUM, LJ_TISNUM\r\n  |  lus TMP3, 0x59c0\t\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |  stw TMP3, TMPD\r\n  |  li ZERO, 0\r\n  |  ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |  lfs TOBIT, TMPD\r\n  |  stw TMP3, TMPD\r\n  |  lus TMP0, 0x4338\t\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |    li TISNIL, LJ_TNIL\r\n  |  stw TMP0, TONUM_HI\r\n  |  lfs TONUM, TMPD\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  lwz INS, 0(PC)\r\n  |   addi PC, PC, 4\r\n  |    // Assumes TISNIL == ~LJ_VMST_INTERP == -1.\r\n  |    stw TISNIL, DISPATCH_GL(vmstate)(DISPATCH)\r\n  |  decode_OPP TMP1, INS\r\n  |   decode_RA8 RA, INS\r\n  |  lpx TMP0, DISPATCH, TMP1\r\n  |  mtctr TMP0\r\n  |  cmplwi TMP1, BC_FUNCF*4\t\t// Function header?\r\n  |  bge >2\r\n  |   decode_RB8 RB, INS\r\n  |   decode_RD8 RD, INS\r\n  |   decode_RC8 RC, INS\r\n  |  bctr\r\n  |2:\r\n  |  cmplwi TMP1, (BC_FUNCC+2)*4\t// Fast function?\r\n  |  blt >3\r\n  |  // Check frame below fast function.\r\n  |  lwz TMP1, FRAME_PC(BASE)\r\n  |  andix. TMP0, TMP1, FRAME_TYPE\r\n  |  bney >3\t\t\t\t// Trace stitching continuation?\r\n  |  // Otherwise set KBASE for Lua function below fast function.\r\n  |  lwz TMP2, -4(TMP1)\r\n  |  decode_RA8 TMP0, TMP2\r\n  |  sub TMP1, BASE, TMP0\r\n  |  lwz LFUNC:TMP2, -12(TMP1)\r\n  |  lwz TMP1, LFUNC:TMP2->pc\r\n  |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n  |3:\r\n  |   subi RC, MULTRES, 8\r\n  |   add RA, RA, BASE\r\n  |  bctr\r\n  |\r\n  |9:  // Rethrow error from the right C frame.\r\n  |  neg CARG2, CARG1\r\n  |  mr CARG1, L\r\n  |  bl extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// NYI: Use internal implementations of floor, ceil, trunc.\r\n  |\r\n  |->vm_modi:\r\n  |  divwo. TMP0, CARG1, CARG2\r\n  |  bso >1\r\n  |.if GPR64\r\n  |   xor CARG3, CARG1, CARG2\r\n  |   cmpwi CARG3, 0\r\n  |.else\r\n  |   xor. CARG3, CARG1, CARG2\r\n  |.endif\r\n  |  mullw TMP0, TMP0, CARG2\r\n  |  sub CARG1, CARG1, TMP0\r\n  |   bgelr\r\n  |  cmpwi CARG1, 0; beqlr\r\n  |  add CARG1, CARG1, CARG2\r\n  |  blr\r\n  |1:\r\n  |  cmpwi CARG2, 0\r\n  |   li CARG1, 0\r\n  |  beqlr\r\n  |  clrso TMP0\t\t\t// Clear SO for -2147483648 % -1 and return 0.\r\n  |  blr\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// void lj_vm_cachesync(void *start, void *end)\r\n  |// Flush D-Cache and invalidate I-Cache. Assumes 32 byte cache line size.\r\n  |// This is a good lower bound, except for very ancient PPC models.\r\n  |->vm_cachesync:\r\n  |.if JIT or FFI\r\n  |  // Compute start of first cache line and number of cache lines.\r\n  |  rlwinm CARG1, CARG1, 0, 0, 26\r\n  |  sub CARG2, CARG2, CARG1\r\n  |  addi CARG2, CARG2, 31\r\n  |  rlwinm. CARG2, CARG2, 27, 5, 31\r\n  |  beqlr\r\n  |  mtctr CARG2\r\n  |  mr CARG3, CARG1\r\n  |1:  // Flush D-Cache.\r\n  |  dcbst r0, CARG1\r\n  |  addi CARG1, CARG1, 32\r\n  |  bdnz <1\r\n  |  sync\r\n  |  mtctr CARG2\r\n  |1:  // Invalidate I-Cache.\r\n  |  icbi r0, CARG3\r\n  |  addi CARG3, CARG3, 32\r\n  |  bdnz <1\r\n  |  isync\r\n  |  blr\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in r11, g in r12.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs\r\n  |  lwz CTSTATE, GL:r12->ctype_state\r\n  |   addi DISPATCH, r12, GG_G2DISP\r\n  |  stw r11, CTSTATE->cb.slot\r\n  |  stw r3, CTSTATE->cb.gpr[0]\r\n  |   stfd f1, CTSTATE->cb.fpr[0]\r\n  |  stw r4, CTSTATE->cb.gpr[1]\r\n  |   stfd f2, CTSTATE->cb.fpr[1]\r\n  |  stw r5, CTSTATE->cb.gpr[2]\r\n  |   stfd f3, CTSTATE->cb.fpr[2]\r\n  |  stw r6, CTSTATE->cb.gpr[3]\r\n  |   stfd f4, CTSTATE->cb.fpr[3]\r\n  |  stw r7, CTSTATE->cb.gpr[4]\r\n  |   stfd f5, CTSTATE->cb.fpr[4]\r\n  |  stw r8, CTSTATE->cb.gpr[5]\r\n  |   stfd f6, CTSTATE->cb.fpr[5]\r\n  |  stw r9, CTSTATE->cb.gpr[6]\r\n  |   stfd f7, CTSTATE->cb.fpr[6]\r\n  |  stw r10, CTSTATE->cb.gpr[7]\r\n  |   stfd f8, CTSTATE->cb.fpr[7]\r\n  |  addi TMP0, sp, CFRAME_SPACE+8\r\n  |  stw TMP0, CTSTATE->cb.stack\r\n  |   mr CARG1, CTSTATE\r\n  |  stw CTSTATE, SAVE_PC\t\t// Any value outside of bytecode is ok.\r\n  |   mr CARG2, sp\r\n  |  bl extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // Returns lua_State *.\r\n  |  lp BASE, L:CRET1->base\r\n  |     li TISNUM, LJ_TISNUM\t\t// Setup type comparison constants.\r\n  |  lp RC, L:CRET1->top\r\n  |     lus TMP3, 0x59c0\t\t// TOBIT = 2^52 + 2^51 (float).\r\n  |     li ZERO, 0\r\n  |   mr L, CRET1\r\n  |     stw TMP3, TMPD\r\n  |     lus TMP0, 0x4338\t\t// Hiword of 2^52 + 2^51 (double)\r\n  |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n  |     ori TMP3, TMP3, 0x0004\t\t// TONUM = 2^52 + 2^51 + 2^31 (float).\r\n  |     stw TMP0, TONUM_HI\r\n  |     li TISNIL, LJ_TNIL\r\n  |    li_vmstate INTERP\r\n  |     lfs TOBIT, TMPD\r\n  |     stw TMP3, TMPD\r\n  |  sub RC, RC, BASE\r\n  |    st_vmstate\r\n  |     lfs TONUM, TMPD\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  lwz CTSTATE, DISPATCH_GL(ctype_state)(DISPATCH)\r\n  |   stp BASE, L->base\r\n  |   stp RB, L->top\r\n  |  stp L, CTSTATE->L\r\n  |  mr CARG1, CTSTATE\r\n  |  mr CARG2, RA\r\n  |  bl extern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |  lwz CRET1, CTSTATE->cb.gpr[0]\r\n  |  lfd FARG1, CTSTATE->cb.fpr[0]\r\n  |  lwz CRET2, CTSTATE->cb.gpr[1]\r\n  |  b ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, CARG1\r\n  |  lwz TMP1, CCSTATE->spadj\r\n  |    mflr TMP0\r\n  |   lbz CARG2, CCSTATE->nsp\r\n  |   lbz CARG3, CCSTATE->nfpr\r\n  |  neg TMP1, TMP1\r\n  |    stw TMP0, 4(sp)\r\n  |   cmpwi cr1, CARG3, 0\r\n  |  mr TMP2, sp\r\n  |   addic. CARG2, CARG2, -1\r\n  |  stwux sp, sp, TMP1\r\n  |   crnot 4*cr1+eq, 4*cr1+eq\t\t// For vararg calls.\r\n  |  stw r14, -4(TMP2)\r\n  |  stw CCSTATE, -8(TMP2)\r\n  |  mr r14, TMP2\r\n  |  la TMP1, CCSTATE->stack\r\n  |   slwi CARG2, CARG2, 2\r\n  |   blty >2\r\n  |  la TMP2, 8(sp)\r\n  |1:\r\n  |  lwzx TMP0, TMP1, CARG2\r\n  |  stwx TMP0, TMP2, CARG2\r\n  |   addic. CARG2, CARG2, -4\r\n  |  bge <1\r\n  |2:\r\n  |  bney cr1, >3\r\n  |  lfd f1, CCSTATE->fpr[0]\r\n  |  lfd f2, CCSTATE->fpr[1]\r\n  |  lfd f3, CCSTATE->fpr[2]\r\n  |  lfd f4, CCSTATE->fpr[3]\r\n  |  lfd f5, CCSTATE->fpr[4]\r\n  |  lfd f6, CCSTATE->fpr[5]\r\n  |  lfd f7, CCSTATE->fpr[6]\r\n  |  lfd f8, CCSTATE->fpr[7]\r\n  |3:\r\n  |   lp TMP0, CCSTATE->func\r\n  |  lwz CARG2, CCSTATE->gpr[1]\r\n  |  lwz CARG3, CCSTATE->gpr[2]\r\n  |  lwz CARG4, CCSTATE->gpr[3]\r\n  |  lwz CARG5, CCSTATE->gpr[4]\r\n  |   mtctr TMP0\r\n  |  lwz r8, CCSTATE->gpr[5]\r\n  |  lwz r9, CCSTATE->gpr[6]\r\n  |  lwz r10, CCSTATE->gpr[7]\r\n  |  lwz CARG1, CCSTATE->gpr[0]\t\t// Do this last, since CCSTATE is CARG1.\r\n  |   bctrl\r\n  |  lwz CCSTATE:TMP1, -8(r14)\r\n  |  lwz TMP2, -4(r14)\r\n  |   lwz TMP0, 4(r14)\r\n  |  stw CARG1, CCSTATE:TMP1->gpr[0]\r\n  |  stfd FARG1, CCSTATE:TMP1->fpr[0]\r\n  |  stw CARG2, CCSTATE:TMP1->gpr[1]\r\n  |   mtlr TMP0\r\n  |  stw CARG3, CCSTATE:TMP1->gpr[2]\r\n  |   mr sp, r14\r\n  |  stw CARG4, CCSTATE:TMP1->gpr[3]\r\n  |   mr r14, TMP2\r\n  |  blr\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, BASE\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr0, TMP0\r\n    |   lwz CARG3, 4(RD)\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  checknum cr1, TMP1\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bne cr0, >7\r\n    |  bne cr1, >8\r\n    |   cmpw CARG2, CARG3\r\n    if (op == BC_ISLT) {\r\n      |  bge >2\r\n    } else if (op == BC_ISGE) {\r\n      |  blt >2\r\n    } else if (op == BC_ISLE) {\r\n      |  bgt >2\r\n    } else {\r\n      |  ble >2\r\n    }\r\n    |1:\r\n    |  add PC, PC, TMP2\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  bgt cr0, ->vmeta_comp\r\n    |  // RA is a number.\r\n    |   lfd f0, 0(RA)\r\n    |  bgt cr1, ->vmeta_comp\r\n    |  blt cr1, >4\r\n    |  // RA is a number, RD is an integer.\r\n    |  tonum_i f1, CARG3\r\n    |  b >5\r\n    |\r\n    |8: // RA is an integer, RD is not an integer.\r\n    |  bgt cr1, ->vmeta_comp\r\n    |  // RA is an integer, RD is a number.\r\n    |  tonum_i f0, CARG2\r\n    |4:\r\n    |  lfd f1, 0(RD)\r\n    |5:\r\n    |  fcmpu cr0, f0, f1\r\n    if (op == BC_ISLT) {\r\n      |  bge <2\r\n    } else if (op == BC_ISGE) {\r\n      |  blt <2\r\n    } else if (op == BC_ISLE) {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  bge <2\r\n    } else {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  blt <2\r\n    }\r\n    |  b <1\r\n    |.else\r\n    |  lwzx TMP0, BASE, RA\r\n    |    addi PC, PC, 4\r\n    |   lfdx f0, BASE, RA\r\n    |  lwzx TMP1, BASE, RD\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |   lfdx f1, BASE, RD\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  bge cr0, ->vmeta_comp\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge cr1, ->vmeta_comp\r\n    |  fcmpu cr0, f0, f1\r\n    if (op == BC_ISLT) {\r\n      |  bge >1\r\n    } else if (op == BC_ISGE) {\r\n      |  blt >1\r\n    } else if (op == BC_ISLE) {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  bge >1\r\n    } else {\r\n      |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+eq\r\n      |  blt >1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  // RA = src1*8, RD = src2*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, BASE\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |   lwz CARG3, 4(RD)\r\n    |  cror 4*cr7+gt, 4*cr0+gt, 4*cr1+gt\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    if (vk) {\r\n      |  ble cr7, ->BC_ISEQN_Z\r\n    } else {\r\n      |  ble cr7, ->BC_ISNEN_Z\r\n    }\r\n    |.else\r\n    |  lwzux TMP0, RA, BASE\r\n    |   lwz TMP2, 0(PC)\r\n    |    lfd f0, 0(RA)\r\n    |   addi PC, PC, 4\r\n    |  lwzux TMP1, RD, BASE\r\n    |  checknum cr0, TMP0\r\n    |   decode_RD4 TMP2, TMP2\r\n    |    lfd f1, 0(RD)\r\n    |  checknum cr1, TMP1\r\n    |   addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge cr0, >5\r\n    |  bge cr1, >5\r\n    |  fcmpu cr0, f0, f1\r\n    if (vk) {\r\n      |  bne >1\r\n      |  add PC, PC, TMP2\r\n    } else {\r\n      |  beq >1\r\n      |  add PC, PC, TMP2\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    |5:  // Either or both types are not numbers.\r\n    |.if not DUALNUM\r\n    |    lwz CARG2, 4(RA)\r\n    |    lwz CARG3, 4(RD)\r\n    |.endif\r\n    |.if FFI\r\n    |  cmpwi cr7, TMP0, LJ_TCDATA\r\n    |  cmpwi cr5, TMP1, LJ_TCDATA\r\n    |.endif\r\n    |   not TMP3, TMP0\r\n    |  cmplw TMP0, TMP1\r\n    |   cmplwi cr1, TMP3, ~LJ_TISPRI\t\t// Primitive?\r\n    |.if FFI\r\n    |  cror 4*cr7+eq, 4*cr7+eq, 4*cr5+eq\r\n    |.endif\r\n    |   cmplwi cr6, TMP3, ~LJ_TISTABUD\t\t// Table or userdata?\r\n    |.if FFI\r\n    |  beq cr7, ->vmeta_equal_cd\r\n    |.endif\r\n    |    cmplw cr5, CARG2, CARG3\r\n    |  crandc 4*cr0+gt, 4*cr0+eq, 4*cr1+gt\t// 2: Same type and primitive.\r\n    |  crorc 4*cr0+lt, 4*cr5+eq, 4*cr0+eq\t// 1: Same tv or different type.\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr5+eq\t// 0: Same type and same tv.\r\n    |   mr SAVE0, PC\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr0+gt\t// 0 or 2.\r\n    |  cror 4*cr0+lt, 4*cr0+lt, 4*cr0+gt\t// 1 or 2.\r\n    if (vk) {\r\n      |  bne cr0, >6\r\n      |  add PC, PC, TMP2\r\n      |6:\r\n    } else {\r\n      |  beq cr0, >6\r\n      |  add PC, PC, TMP2\r\n      |6:\r\n    }\r\n    |.if DUALNUM\r\n    |  bge cr0, >2\t\t\t// Done if 1 or 2.\r\n    |1:\r\n    |  ins_next\r\n    |2:\r\n    |.else\r\n    |  blt cr0, <1\t\t\t// Done if 1 or 2.\r\n    |.endif\r\n    |  blt cr6, <1\t\t\t// Done if not tab/ud.\r\n    |\r\n    |  // Different tables or userdatas. Need to check __eq metamethod.\r\n    |  // Field metatable must be at same offset for GCtab and GCudata!\r\n    |  lwz TAB:TMP2, TAB:CARG2->metatable\r\n    |   li CARG4, 1-vk\t\t\t// ne = 0 or 1.\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable?\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_eq\r\n    |  bne <1\t\t\t\t// Or 'no __eq' flag set?\r\n    |  mr PC, SAVE0\t\t\t// Restore old PC.\r\n    |  b ->vmeta_equal\t\t\t// Handle __eq metamethod.\r\n    break;\r\n\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  // RA = src*8, RD = str_const*8 (~), JMP with RD = target\r\n    |  lwzux TMP0, RA, BASE\r\n    |   srwi RD, RD, 1\r\n    |  lwz STR:TMP3, 4(RA)\r\n    |    lwz TMP2, 0(PC)\r\n    |   subfic RD, RD, -4\r\n    |    addi PC, PC, 4\r\n    |.if FFI\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |.endif\r\n    |   lwzx STR:TMP1, KBASE, RD\t// KBASE-4-str_const*4\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  subfic TMP0, TMP0, LJ_TSTR\r\n    |.if FFI\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |  sub TMP1, STR:TMP1, STR:TMP3\r\n    |  or TMP0, TMP0, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  subfic TMP0, TMP0, 0\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  subfe TMP1, TMP1, TMP1\r\n    if (vk) {\r\n      |  andc TMP2, TMP2, TMP1\r\n    } else {\r\n      |  and TMP2, TMP2, TMP1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  // RA = src*8, RD = num_const*8, JMP with RD = target\r\n    |.if DUALNUM\r\n    |  lwzux TMP0, RA, BASE\r\n    |    addi PC, PC, 4\r\n    |   lwz CARG2, 4(RA)\r\n    |  lwzux TMP1, RD, KBASE\r\n    |  checknum cr0, TMP0\r\n    |    lwz TMP2, -4(PC)\r\n    |  checknum cr1, TMP1\r\n    |    decode_RD4 TMP2, TMP2\r\n    |   lwz CARG3, 4(RD)\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:\r\n    } else {\r\n      |->BC_ISNEN_Z:\r\n    }\r\n    |  bne cr0, >7\r\n    |  bne cr1, >8\r\n    |   cmpw CARG2, CARG3\r\n    |4:\r\n    |.else\r\n    if (vk) {\r\n      |->BC_ISEQN_Z:  // Dummy label.\r\n    } else {\r\n      |->BC_ISNEN_Z:  // Dummy label.\r\n    }\r\n    |  lwzx TMP0, BASE, RA\r\n    |    addi PC, PC, 4\r\n    |   lfdx f0, BASE, RA\r\n    |    lwz TMP2, -4(PC)\r\n    |  lfdx f1, KBASE, RD\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  checknum TMP0\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  bge >3\r\n    |  fcmpu cr0, f0, f1\r\n    |.endif\r\n    if (vk) {\r\n      |  bne >1\r\n      |  add PC, PC, TMP2\r\n      |1:\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n    } else {\r\n      |  beq >2\r\n      |1:\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n      |  add PC, PC, TMP2\r\n      |2:\r\n    }\r\n    |  ins_next\r\n    |.if FFI\r\n    |3:\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |  beq ->vmeta_equal_cd\r\n    |  b <1\r\n    |.endif\r\n    |.if DUALNUM\r\n    |7:  // RA is not an integer.\r\n    |  bge cr0, <3\r\n    |  // RA is a number.\r\n    |   lfd f0, 0(RA)\r\n    |  blt cr1, >1\r\n    |  // RA is a number, RD is an integer.\r\n    |  tonum_i f1, CARG3\r\n    |  b >2\r\n    |\r\n    |8: // RA is an integer, RD is a number.\r\n    |  tonum_i f0, CARG2\r\n    |1:\r\n    |  lfd f1, 0(RD)\r\n    |2:\r\n    |  fcmpu cr0, f0, f1\r\n    |  b <4\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  // RA = src*8, RD = primitive_type*8 (~), JMP with RD = target\r\n    |  lwzx TMP0, BASE, RA\r\n    |   srwi TMP1, RD, 3\r\n    |    lwz TMP2, 0(PC)\r\n    |   not TMP1, TMP1\r\n    |    addi PC, PC, 4\r\n    |.if FFI\r\n    |  cmpwi TMP0, LJ_TCDATA\r\n    |.endif\r\n    |  sub TMP0, TMP0, TMP1\r\n    |.if FFI\r\n    |  beq ->vmeta_equal_cd\r\n    |.endif\r\n    |    decode_RD4 TMP2, TMP2\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  addic TMP0, TMP0, -1\r\n    |    addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n    |  subfe TMP1, TMP1, TMP1\r\n    if (vk) {\r\n      |  and TMP2, TMP2, TMP1\r\n    } else {\r\n      |  andc TMP2, TMP2, TMP1\r\n    }\r\n    |  add PC, PC, TMP2\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  // RA = dst*8 or unused, RD = src*8, JMP with RD = target\r\n    |  lwzx TMP0, BASE, RD\r\n    |   lwz INS, 0(PC)\r\n    |   addi PC, PC, 4\r\n    if (op == BC_IST || op == BC_ISF) {\r\n      |  .gpr64 extsw TMP0, TMP0\r\n      |  subfic TMP0, TMP0, LJ_TTRUE\r\n      |   decode_RD4 TMP2, INS\r\n      |  subfe TMP1, TMP1, TMP1\r\n      |   addis TMP2, TMP2, -(BCBIAS_J*4 >> 16)\r\n      if (op == BC_IST) {\r\n\t|  andc TMP2, TMP2, TMP1\r\n      } else {\r\n\t|  and TMP2, TMP2, TMP1\r\n      }\r\n      |  add PC, PC, TMP2\r\n    } else {\r\n      |  li TMP1, LJ_TFALSE\r\n      |   lfdx f0, BASE, RD\r\n      |  cmplw TMP0, TMP1\r\n      if (op == BC_ISTC) {\r\n\t|  bge >1\r\n      } else {\r\n\t|  blt >1\r\n      }\r\n      |  addis PC, PC, -(BCBIAS_J*4 >> 16)\r\n      |  decode_RD4 TMP2, INS\r\n      |   stfdx f0, BASE, RA\r\n      |  add PC, PC, TMP2\r\n      |1:\r\n    }\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  // RA = src*8, RD = -type*8\r\n    |  lwzx TMP0, BASE, RA\r\n    |  srwi TMP1, RD, 3\r\n    |  ins_next1\r\n    |.if not PPE and not GPR64\r\n    |  add. TMP0, TMP0, TMP1\r\n    |.else\r\n    |  neg TMP1, TMP1\r\n    |  cmpw TMP0, TMP1\r\n    |.endif\r\n    |  bne ->vmeta_istype\r\n    |  ins_next2\r\n    break;\r\n  case BC_ISNUM:\r\n    |  // RA = src*8, RD = -(TISNUM-1)*8\r\n    |  lwzx TMP0, BASE, RA\r\n    |  ins_next1\r\n    |  checknum TMP0\r\n    |  bge ->vmeta_istype\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  lfdx f0, BASE, RD\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_NOT:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  ins_next1\r\n    |  lwzx TMP0, BASE, RD\r\n    |  .gpr64 extsw TMP0, TMP0\r\n    |  subfic TMP1, TMP0, LJ_TTRUE\r\n    |  adde TMP0, TMP0, TMP1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_UNM:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  lwzux TMP1, RD, BASE\r\n    |   lwz TMP0, 4(RD)\r\n    |  checknum TMP1\r\n    |.if DUALNUM\r\n    |  bne >5\r\n    |.if GPR64\r\n    |  lus TMP2, 0x8000\r\n    |  neg TMP0, TMP0\r\n    |  cmplw TMP0, TMP2\r\n    |  beq >4\r\n    |.else\r\n    |  nego. TMP0, TMP0\r\n    |  bso >4\r\n    |1:\r\n    |.endif\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |   stw TMP0, 4(RA)\r\n    |3:\r\n    |  ins_next2\r\n    |4:\r\n    |.if not GPR64\r\n    |  // Potential overflow.\r\n    |  checkov TMP1, <1\t\t\t// Ignore unrelated overflow.\r\n    |.endif\r\n    |  lus TMP1, 0x41e0\t\t\t// 2^31.\r\n    |  li TMP0, 0\r\n    |  b >7\r\n    |.endif\r\n    |5:\r\n    |  bge ->vmeta_unm\r\n    |  xoris TMP1, TMP1, 0x8000\r\n    |7:\r\n    |  ins_next1\r\n    |  stwux TMP1, RA, BASE\r\n    |   stw TMP0, 4(RA)\r\n    |.if DUALNUM\r\n    |  b <3\r\n    |.else\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_LEN:\r\n    |  // RA = dst*8, RD = src*8\r\n    |  lwzux TMP0, RD, BASE\r\n    |   lwz CARG1, 4(RD)\r\n    |  checkstr TMP0; bne >2\r\n    |  lwz CRET1, STR:CARG1->len\r\n    |1:\r\n    |.if DUALNUM\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |   stw CRET1, 4(RA)\r\n    |.else\r\n    |  tonum_u f0, CRET1\t\t// Result is a non-negative integer.\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |.endif\r\n    |  ins_next2\r\n    |2:\r\n    |  checktab TMP0; bne ->vmeta_len\r\n#if LJ_52\r\n    |  lwz TAB:TMP2, TAB:CARG1->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  bne >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  bl extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Returns uint32_t (but less than 2^31).\r\n    |  b <1\r\n#if LJ_52\r\n    |9:\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_len\r\n    |  bne <3\t\t\t\t// 'no __len' flag set: done.\r\n    |  b ->vmeta_len\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   .if DUALNUM\r\n    |     lwzx TMP2, KBASE, RC\r\n    |   .endif\r\n    |    lfdx f14, BASE, RB\r\n    |    lfdx f15, KBASE, RC\r\n    |   .if DUALNUM\r\n    |     checknum cr0, TMP1\r\n    |     checknum cr1, TMP2\r\n    |     crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |     bge ->vmeta_arith_vn\r\n    |   .else\r\n    |     checknum TMP1; bge ->vmeta_arith_vn\r\n    |   .endif\r\n    ||  break;\r\n    ||case 1:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   .if DUALNUM\r\n    |     lwzx TMP2, KBASE, RC\r\n    |   .endif\r\n    |    lfdx f15, BASE, RB\r\n    |    lfdx f14, KBASE, RC\r\n    |   .if DUALNUM\r\n    |     checknum cr0, TMP1\r\n    |     checknum cr1, TMP2\r\n    |     crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |     bge ->vmeta_arith_nv\r\n    |   .else\r\n    |     checknum TMP1; bge ->vmeta_arith_nv\r\n    |   .endif\r\n    ||  break;\r\n    ||default:\r\n    |   lwzx TMP1, BASE, RB\r\n    |   lwzx TMP2, BASE, RC\r\n    |    lfdx f14, BASE, RB\r\n    |    lfdx f15, BASE, RC\r\n    |   checknum cr0, TMP1\r\n    |   checknum cr1, TMP2\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |   bge ->vmeta_arith_vv\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfallback, ins\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   ins ->vmeta_arith_vn2\r\n    ||  break;\r\n    ||case 1:\r\n    |   ins ->vmeta_arith_nv2\r\n    ||  break;\r\n    ||default:\r\n    |   ins ->vmeta_arith_vv2\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro intmod, a, b, c\r\n    |  bl ->vm_modi\r\n    |.endmacro\r\n    |\r\n    |.macro fpmod, a, b, c\r\n    |->BC_MODVN_Z:\r\n    |  fdiv FARG1, b, c\r\n    |  // NYI: Use internal implementation of floor.\r\n    |  blex floor\t\t\t// floor(b/c)\r\n    |  fmul a, FARG1, c\r\n    |  fsub a, b, a\t\t\t// b - floor(b/c)*c\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithfp, fpins\r\n    |  ins_arithpre\r\n    |.if \"fpins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.else\r\n    |  fpins f0, f14, f15\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins, fpins\r\n    |  // RA = dst*8, RB = src1*8, RC = src2*8 | num_const*8\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, KBASE\r\n    |    lwz CARG1, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG2, 4(RC)\r\n    ||  break;\r\n    ||case 1:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, KBASE\r\n    |    lwz CARG2, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG1, 4(RC)\r\n    ||  break;\r\n    ||default:\r\n    |   lwzux TMP1, RB, BASE\r\n    |   lwzux TMP2, RC, BASE\r\n    |    lwz CARG1, 4(RB)\r\n    |   checknum cr0, TMP1\r\n    |    lwz CARG2, 4(RC)\r\n    ||  break;\r\n    ||}\r\n    |  checknum cr1, TMP2\r\n    |  bne >5\r\n    |  bne cr1, >5\r\n    |  intins CARG1, CARG1, CARG2\r\n    |  bso >4\r\n    |1:\r\n    |  ins_next1\r\n    |  stwux TISNUM, RA, BASE\r\n    |  stw CARG1, 4(RA)\r\n    |2:\r\n    |  ins_next2\r\n    |4:  // Overflow.\r\n    |  checkov TMP0, <1\t\t\t// Ignore unrelated overflow.\r\n    |  ins_arithfallback b\r\n    |5:  // FP variant.\r\n    ||if (vk == 1) {\r\n    |  lfd f15, 0(RB)\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  lfd f14, 0(RC)\r\n    ||} else {\r\n    |  lfd f14, 0(RB)\r\n    |   crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  lfd f15, 0(RC)\r\n    ||}\r\n    |   ins_arithfallback bge\r\n    |.if \"fpins\" == \"fpmod_\"\r\n    |  b ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    |.else\r\n    |  fpins f0, f14, f15\r\n    |  ins_next1\r\n    |  stfdx f0, BASE, RA\r\n    |  b <2\r\n    |.endif\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, intins, fpins\r\n    |.if DUALNUM\r\n    |  ins_arithdn intins, fpins\r\n    |.else\r\n    |  ins_arithfp fpins\r\n    |.endif\r\n    |.endmacro\r\n\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |.if GPR64\r\n    |.macro addo32., y, a, b\r\n    |  // Need to check overflow for (a<<32) + (b<<32).\r\n    |  rldicr TMP0, a, 32, 31\r\n    |  rldicr TMP3, b, 32, 31\r\n    |  addo. TMP0, TMP0, TMP3\r\n    |  add y, a, b\r\n    |.endmacro\r\n    |  ins_arith addo32., fadd\r\n    |.else\r\n    |  ins_arith addo., fadd\r\n    |.endif\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |.if GPR64\r\n    |.macro subo32., y, a, b\r\n    |  // Need to check overflow for (a<<32) - (b<<32).\r\n    |  rldicr TMP0, a, 32, 31\r\n    |  rldicr TMP3, b, 32, 31\r\n    |  subo. TMP0, TMP0, TMP3\r\n    |  sub y, a, b\r\n    |.endmacro\r\n    |  ins_arith subo32., fsub\r\n    |.else\r\n    |  ins_arith subo., fsub\r\n    |.endif\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith mullwo., fmul\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arithfp fdiv\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arith intmod, fpmod\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arith intmod, fpmod_\r\n    break;\r\n  case BC_POW:\r\n    |  // NYI: (partial) integer arithmetic.\r\n    |  lwzx TMP1, BASE, RB\r\n    |   lfdx FARG1, BASE, RB\r\n    |  lwzx TMP2, BASE, RC\r\n    |   lfdx FARG2, BASE, RC\r\n    |  checknum cr0, TMP1\r\n    |  checknum cr1, TMP2\r\n    |  crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n    |  bge ->vmeta_arith_vv\r\n    |  blex pow\r\n    |  ins_next1\r\n    |  stfdx FARG1, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  // RA = dst*8, RB = src_start*8, RC = src_end*8\r\n    |  sub CARG3, RC, RB\r\n    |   stp BASE, L->base\r\n    |  add CARG2, BASE, RC\r\n    |  mr SAVE0, RB\r\n    |->BC_CAT_Z:\r\n    |   stw PC, SAVE_PC\r\n    |  mr CARG1, L\r\n    |  srwi CARG3, CARG3, 3\r\n    |  bl extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // Returns NULL (finished) or TValue * (metamethod).\r\n    |  cmplwi CRET1, 0\r\n    |   lp BASE, L->base\r\n    |  bne ->vmeta_binop\r\n    |  ins_next1\r\n    |  lfdx f0, BASE, SAVE0\t\t// Copy result from RB to RA.\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  ins_next1\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-str_const*4\r\n    |  li TMP2, LJ_TSTR\r\n    |  stwux TMP2, RA, BASE\r\n    |  stw TMP0, 4(RA)\r\n    |  ins_next2\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  // RA = dst*8, RD = cdata_const*8 (~)\r\n    |  srwi TMP1, RD, 1\r\n    |  subfic TMP1, TMP1, -4\r\n    |  ins_next1\r\n    |  lwzx TMP0, KBASE, TMP1\t\t// KBASE-4-cdata_const*4\r\n    |  li TMP2, LJ_TCDATA\r\n    |  stwux TMP2, RA, BASE\r\n    |  stw TMP0, 4(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  // RA = dst*8, RD = int16_literal*8\r\n    |.if DUALNUM\r\n    |  slwi RD, RD, 13\r\n    |  srawi RD, RD, 16\r\n    |  ins_next1\r\n    |   stwux TISNUM, RA, BASE\r\n    |   stw RD, 4(RA)\r\n    |  ins_next2\r\n    |.else\r\n    |  // The soft-float approach is faster.\r\n    |  slwi RD, RD, 13\r\n    |  srawi TMP1, RD, 31\r\n    |  xor TMP2, TMP1, RD\r\n    |  sub TMP2, TMP2, TMP1\t\t// TMP2 = abs(x)\r\n    |  cntlzw TMP3, TMP2\r\n    |  subfic TMP1, TMP3, 0x40d\t\t// TMP1 = exponent-1\r\n    |   slw TMP2, TMP2, TMP3\t\t// TMP2 = left aligned mantissa\r\n    |    subfic TMP3, RD, 0\r\n    |  slwi TMP1, TMP1, 20\r\n    |   rlwimi RD, TMP2, 21, 1, 31\t// hi = sign(x) | (mantissa>>11)\r\n    |    subfe TMP0, TMP0, TMP0\r\n    |   add RD, RD, TMP1\t\t// hi = hi + exponent-1\r\n    |    and RD, RD, TMP0\t\t// hi = x == 0 ? 0 : hi\r\n    |  ins_next1\r\n    |    stwux RD, RA, BASE\r\n    |    stw ZERO, 4(RA)\r\n    |  ins_next2\r\n    |.endif\r\n    break;\r\n  case BC_KNUM:\r\n    |  // RA = dst*8, RD = num_const*8\r\n    |  ins_next1\r\n    |  lfdx f0, KBASE, RD\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KPRI:\r\n    |  // RA = dst*8, RD = primitive_type*8 (~)\r\n    |  srwi TMP1, RD, 3\r\n    |  not TMP0, TMP1\r\n    |  ins_next1\r\n    |  stwx TMP0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_KNIL:\r\n    |  // RA = base*8, RD = end*8\r\n    |  stwx TISNIL, BASE, RA\r\n    |   addi RA, RA, 8\r\n    |1:\r\n    |  stwx TISNIL, BASE, RA\r\n    |  cmpw RA, RD\r\n    |   addi RA, RA, 8\r\n    |  blt <1\r\n    |  ins_next_\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  // RA = dst*8, RD = uvnum*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RD, RD, 1\r\n    |   addi RD, RD, offsetof(GCfuncL, uvptr)\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RD\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  lfd f0, 0(TMP1)\r\n    |  stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETV:\r\n    |  // RA = uvnum*8, RD = src*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |    srwi RA, RA, 1\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   lfdux f0, RD, BASE\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andix. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |    lbz TMP0, UPVAL:RB->closed\r\n    |   lwz TMP2, 0(RD)\r\n    |   stfd f0, 0(CARG2)\r\n    |    cmplwi cr1, TMP0, 0\r\n    |   lwz TMP1, 4(RD)\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   subi TMP2, TMP2, (LJ_TNUMX+1)\r\n    |  bne >2\t\t\t\t// Upvalue is closed and black?\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if new value is collectable.\r\n    |  cmplwi TMP2, LJ_TISGCV - (LJ_TNUMX+1)\r\n    |  bge <1\t\t\t\t// tvisgcv(v)\r\n    |  lbz TMP3, GCOBJ:TMP1->gch.marked\r\n    |  andix. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(v)\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETS:\r\n    |  // RA = uvnum*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |    srwi RA, RA, 1\r\n    |   subfic TMP1, TMP1, -4\r\n    |    addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |   lwzx STR:TMP1, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  lbz TMP3, UPVAL:RB->marked\r\n    |   lwz CARG2, UPVAL:RB->v\r\n    |  andix. TMP3, TMP3, LJ_GC_BLACK\t// isblack(uv)\r\n    |   lbz TMP3, STR:TMP1->marked\r\n    |   lbz TMP2, UPVAL:RB->closed\r\n    |   li TMP0, LJ_TSTR\r\n    |   stw STR:TMP1, 4(CARG2)\r\n    |   stw TMP0, 0(CARG2)\r\n    |  bne >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  andix. TMP3, TMP3, LJ_GC_WHITES\t// iswhite(str)\r\n    |   cmplwi cr1, TMP2, 0\r\n    |  cror 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n    |   la CARG1, GG_DISP2G(DISPATCH)\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  beq <1\r\n    |  bl extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  b <1\r\n    break;\r\n  case BC_USETN:\r\n    |  // RA = uvnum*8, RD = num_const*8\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    lfdx f0, KBASE, RD\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  stfd f0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n  case BC_USETP:\r\n    |  // RA = uvnum*8, RD = primitive_type*8 (~)\r\n    |  lwz LFUNC:RB, FRAME_FUNC(BASE)\r\n    |   srwi RA, RA, 1\r\n    |    srwi TMP0, RD, 3\r\n    |   addi RA, RA, offsetof(GCfuncL, uvptr)\r\n    |    not TMP0, TMP0\r\n    |  lwzx UPVAL:RB, LFUNC:RB, RA\r\n    |  ins_next1\r\n    |  lwz TMP1, UPVAL:RB->v\r\n    |  stw TMP0, 0(TMP1)\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_UCLO:\r\n    |  // RA = level*8, RD = target\r\n    |  lwz TMP1, L->openupval\r\n    |  branch_RD\t\t\t// Do this first since RD is not saved.\r\n    |   stp BASE, L->base\r\n    |  cmplwi TMP1, 0\r\n    |   mr CARG1, L\r\n    |  beq >1\r\n    |   add CARG2, BASE, RA\r\n    |  bl extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  lp BASE, L->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  // RA = dst*8, RD = proto_const*8 (~) (holding function prototype)\r\n    |  srwi TMP1, RD, 1\r\n    |   stp BASE, L->base\r\n    |  subfic TMP1, TMP1, -4\r\n    |   stw PC, SAVE_PC\r\n    |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n    |   mr CARG1, L\r\n    |  lwz CARG3, FRAME_FUNC(BASE)\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  bl extern lj_func_newL_gc\r\n    |  // Returns GCfuncL *.\r\n    |  lp BASE, L->base\r\n    |   li TMP0, LJ_TFUNC\r\n    |  stwux TMP0, RA, BASE\r\n    |  stw LFUNC:CRET1, 4(RA)\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n  case BC_TDUP:\r\n    |  // RA = dst*8, RD = (hbits|asize)*8 | tab_const*8 (~)\r\n    |  lwz TMP0, DISPATCH_GL(gc.total)(DISPATCH)\r\n    |   mr CARG1, L\r\n    |  lwz TMP1, DISPATCH_GL(gc.threshold)(DISPATCH)\r\n    |   stp BASE, L->base\r\n    |  cmplw TMP0, TMP1\r\n    |   stw PC, SAVE_PC\r\n    |  bge >5\r\n    |1:\r\n    if (op == BC_TNEW) {\r\n      |  rlwinm CARG2, RD, 29, 21, 31\r\n      |  rlwinm CARG3, RD, 18, 27, 31\r\n      |  cmpwi CARG2, 0x7ff; beq >3\r\n      |2:\r\n      |  bl extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n      |  // Returns Table *.\r\n    } else {\r\n      |  srwi TMP1, RD, 1\r\n      |  subfic TMP1, TMP1, -4\r\n      |  lwzx CARG2, KBASE, TMP1\t\t// KBASE-4-tab_const*4\r\n      |  bl extern lj_tab_dup  // (lua_State *L, Table *kt)\r\n      |  // Returns Table *.\r\n    }\r\n    |  lp BASE, L->base\r\n    |   li TMP0, LJ_TTAB\r\n    |  stwux TMP0, RA, BASE\r\n    |  stw TAB:CRET1, 4(RA)\r\n    |  ins_next\r\n    if (op == BC_TNEW) {\r\n      |3:\r\n      |  li CARG2, 0x801\r\n      |  b <2\r\n    }\r\n    |5:\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_gc_step_fixtop  // (lua_State *L)\r\n    |  mr RD, SAVE0\r\n    |  mr CARG1, L\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  // RA = dst*8, RD = str_const*8 (~)\r\n  case BC_GSET:\r\n    |  // RA = src*8, RD = str_const*8 (~)\r\n    |  lwz LFUNC:TMP2, FRAME_FUNC(BASE)\r\n    |   srwi TMP1, RD, 1\r\n    |  lwz TAB:RB, LFUNC:TMP2->env\r\n    |   subfic TMP1, TMP1, -4\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    if (op == BC_GGET) {\r\n      |  b ->BC_TGETS_Z\r\n    } else {\r\n      |  b ->BC_TSETS_Z\r\n    }\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |  lwzux CARG2, RC, BASE\r\n    |   lwz TAB:RB, 4(RB)\r\n    |.if DUALNUM\r\n    |   lwz RC, 4(RC)\r\n    |.else\r\n    |   lfd f0, 0(RC)\r\n    |.endif\r\n    |  checktab CARG1\r\n    |   checknum cr1, CARG2\r\n    |  bne ->vmeta_tgetv\r\n    |.if DUALNUM\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |   bne cr1, >5\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  cmplw TMP0, RC\r\n    |   slwi TMP2, RC, 3\r\n    |.else\r\n    |   bge cr1, >5\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  fctiwz f1, f0\r\n    |    fadd f2, f0, TOBIT\r\n    |  stfd f1, TMPD\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |    fsub f2, f2, TOBIT\r\n    |  lwz TMP2, TMPD_LO\r\n    |   lwz TMP1, TAB:RB->array\r\n    |    fcmpu cr1, f0, f2\r\n    |  cmplw cr0, TMP0, TMP2\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+eq\r\n    |   slwi TMP2, TMP2, 3\r\n    |.endif\r\n    |  ble ->vmeta_tgetv\t\t// Integer key and in array part?\r\n    |  lwzx TMP0, TMP1, TMP2\r\n    |   lfdx f14, TMP1, TMP2\r\n    |  checknil TMP0; beq >2\r\n    |1:\r\n    |  ins_next1\r\n    |   stfdx f14, BASE, RA\r\n    |  ins_next2\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetv\r\n    |\r\n    |5:\r\n    |  checkstr CARG2; bne ->vmeta_tgetv\r\n    |.if not DUALNUM\r\n    |  lwz STR:RC, 4(RC)\r\n    |.endif\r\n    |  b ->BC_TGETS_Z\t\t\t// String key?\r\n    break;\r\n  case BC_TGETS:\r\n    |  // RA = dst*8, RB = table*8, RC = str_const*8 (~)\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP1, RC, 1\r\n    |    lwz TAB:RB, 4(RB)\r\n    |   subfic TMP1, TMP1, -4\r\n    |  checktab CARG1\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  bne ->vmeta_tgets1\r\n    |->BC_TGETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = dst*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lwz CARG1, NODE:TMP2->key\r\n    |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n    |    lwz CARG2, NODE:TMP2->val\r\n    |     lwz TMP1, 4+offsetof(Node, val)(NODE:TMP2)\r\n    |  checkstr CARG1; bne >4\r\n    |   cmpw TMP0, STR:RC; bne >4\r\n    |    checknil CARG2; beq >5\t\t// Key found, but nil value?\r\n    |3:\r\n    |    stwux CARG2, RA, BASE\r\n    |     stw TMP1, 4(RA)\r\n    |  ins_next\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  lwz NODE:TMP2, NODE:TMP2->next\r\n    |  cmplwi NODE:TMP2, 0\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |   li CARG2, LJ_TNIL\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <3\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP2->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_index\r\n    |  bne <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgets\r\n    break;\r\n  case BC_TGETB:\r\n    |  // RA = dst*8, RB = table*8, RC = index*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP0, RC, 3\r\n    |   lwz TAB:RB, 4(RB)\r\n    |  checktab CARG1; bne ->vmeta_tgetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |  cmplw TMP0, TMP1; bge ->vmeta_tgetb\r\n    |  lwzx TMP1, TMP2, RC\r\n    |   lfdx f0, TMP2, RC\r\n    |  checknil TMP1; beq >5\r\n    |1:\r\n    |  ins_next1\r\n    |   stfdx f0, BASE, RA\r\n    |  ins_next2\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_index\r\n    |  bne <1\t\t\t\t// 'no __index' flag set: done.\r\n    |  b ->vmeta_tgetb\t\t\t// Caveat: preserve TMP0!\r\n    break;\r\n  case BC_TGETR:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  add RB, BASE, RB\r\n    |  lwz TAB:CARG1, 4(RB)\r\n    |.if DUALNUM\r\n    |  add RC, BASE, RC\r\n    |  lwz TMP0, TAB:CARG1->asize\r\n    |  lwz CARG2, 4(RC)\r\n    |   lwz TMP1, TAB:CARG1->array\r\n    |.else\r\n    |  lfdx f0, BASE, RC\r\n    |  lwz TMP0, TAB:CARG1->asize\r\n    |  toint CARG2, f0\r\n    |   lwz TMP1, TAB:CARG1->array\r\n    |.endif\r\n    |  cmplw TMP0, CARG2\r\n    |   slwi TMP2, CARG2, 3\r\n    |  ble ->vmeta_tgetr\t\t// In array part?\r\n    |   lfdx f14, TMP1, TMP2\r\n    |->BC_TGETR_Z:\r\n    |  ins_next1\r\n    |   stfdx f14, BASE, RA\r\n    |  ins_next2\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  // RA = src*8, RB = table*8, RC = key*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |  lwzux CARG2, RC, BASE\r\n    |   lwz TAB:RB, 4(RB)\r\n    |.if DUALNUM\r\n    |   lwz RC, 4(RC)\r\n    |.else\r\n    |   lfd f0, 0(RC)\r\n    |.endif\r\n    |  checktab CARG1\r\n    |   checknum cr1, CARG2\r\n    |  bne ->vmeta_tsetv\r\n    |.if DUALNUM\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |   bne cr1, >5\r\n    |   lwz TMP1, TAB:RB->array\r\n    |  cmplw TMP0, RC\r\n    |   slwi TMP0, RC, 3\r\n    |.else\r\n    |   bge cr1, >5\r\n    |  // Convert number key to integer, check for integerness and range.\r\n    |  fctiwz f1, f0\r\n    |    fadd f2, f0, TOBIT\r\n    |  stfd f1, TMPD\r\n    |   lwz TMP0, TAB:RB->asize\r\n    |    fsub f2, f2, TOBIT\r\n    |  lwz TMP2, TMPD_LO\r\n    |   lwz TMP1, TAB:RB->array\r\n    |    fcmpu cr1, f0, f2\r\n    |  cmplw cr0, TMP0, TMP2\r\n    |  crand 4*cr0+gt, 4*cr0+gt, 4*cr1+eq\r\n    |   slwi TMP0, TMP2, 3\r\n    |.endif\r\n    |  ble ->vmeta_tsetv\t\t// Integer key and in array part?\r\n    |   lwzx TMP2, TMP1, TMP0\r\n    |  lbz TMP3, TAB:RB->marked\r\n    |    lfdx f14, BASE, RA\r\n    |   checknil TMP2; beq >3\r\n    |1:\r\n    |  andix. TMP2, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |    stfdx f14, TMP1, TMP0\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP2, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP2, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP2, TAB:TMP2->nomm\r\n    |  andix. TMP2, TMP2, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetv\r\n    |\r\n    |5:\r\n    |  checkstr CARG2; bne ->vmeta_tsetv\r\n    |.if not DUALNUM\r\n    |  lwz STR:RC, 4(RC)\r\n    |.endif\r\n    |  b ->BC_TSETS_Z\t\t\t// String key?\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  // RA = src*8, RB = table*8, RC = str_const*8 (~)\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP1, RC, 1\r\n    |    lwz TAB:RB, 4(RB)\r\n    |   subfic TMP1, TMP1, -4\r\n    |  checktab CARG1\r\n    |   lwzx STR:RC, KBASE, TMP1\t// KBASE-4-str_const*4\r\n    |  bne ->vmeta_tsets1\r\n    |->BC_TSETS_Z:\r\n    |  // TAB:RB = GCtab *, STR:RC = GCstr *, RA = src*8\r\n    |  lwz TMP0, TAB:RB->hmask\r\n    |  lwz TMP1, STR:RC->hash\r\n    |  lwz NODE:TMP2, TAB:RB->node\r\n    |    stb ZERO, TAB:RB->nomm\t\t// Clear metamethod cache.\r\n    |  and TMP1, TMP1, TMP0\t\t// idx = str->hash & tab->hmask\r\n    |    lfdx f14, BASE, RA\r\n    |  slwi TMP0, TMP1, 5\r\n    |  slwi TMP1, TMP1, 3\r\n    |  sub TMP1, TMP0, TMP1\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  add NODE:TMP2, NODE:TMP2, TMP1\t// node = tab->node + (idx*32-idx*8)\r\n    |1:\r\n    |  lwz CARG1, NODE:TMP2->key\r\n    |   lwz TMP0, 4+offsetof(Node, key)(NODE:TMP2)\r\n    |    lwz CARG2, NODE:TMP2->val\r\n    |     lwz NODE:TMP1, NODE:TMP2->next\r\n    |  checkstr CARG1; bne >5\r\n    |   cmpw TMP0, STR:RC; bne >5\r\n    |    checknil CARG2; beq >4\t\t// Key found, but nil value?\r\n    |2:\r\n    |  andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |    stfd f14, NODE:TMP2->val\r\n    |  bne >7\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <2\t\t\t\t// No metatable: done.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_newindex\r\n    |  bne <2\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsets\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  cmplwi NODE:TMP1, 0\r\n    |   mr NODE:TMP2, NODE:TMP1\r\n    |  bne <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |   la CARG3, DISPATCH_GL(tmptv)(DISPATCH)\r\n    |   stw PC, SAVE_PC\r\n    |   mr CARG1, L\r\n    |  cmplwi TAB:TMP1, 0\r\n    |   stp BASE, L->base\r\n    |  beq >6\t\t\t\t// No metatable: continue.\r\n    |  lbz TMP0, TAB:TMP1->nomm\r\n    |  andix. TMP0, TMP0, 1<<MM_newindex\r\n    |  beq ->vmeta_tsets\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  li TMP0, LJ_TSTR\r\n    |   stw STR:RC, 4(CARG3)\r\n    |   mr CARG2, TAB:RB\r\n    |  stw TMP0, 0(CARG3)\r\n    |  bl extern lj_tab_newkey\t\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Returns TValue *.\r\n    |  lp BASE, L->base\r\n    |  stfd f14, 0(CRET1)\r\n    |  b <3\t\t\t\t// No 2nd write barrier needed.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  // RA = src*8, RB = table*8, RC = index*8\r\n    |  lwzux CARG1, RB, BASE\r\n    |   srwi TMP0, RC, 3\r\n    |   lwz TAB:RB, 4(RB)\r\n    |  checktab CARG1; bne ->vmeta_tsetb\r\n    |  lwz TMP1, TAB:RB->asize\r\n    |   lwz TMP2, TAB:RB->array\r\n    |    lbz TMP3, TAB:RB->marked\r\n    |  cmplw TMP0, TMP1\r\n    |   lfdx f14, BASE, RA\r\n    |  bge ->vmeta_tsetb\r\n    |  lwzx TMP1, TMP2, RC\r\n    |  checknil TMP1; beq >5\r\n    |1:\r\n    |  andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |   stfdx f14, TMP2, RC\r\n    |  bne >7\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |5:  // Check for __newindex if previous value is nil.\r\n    |  lwz TAB:TMP1, TAB:RB->metatable\r\n    |  cmplwi TAB:TMP1, 0\r\n    |  beq <1\t\t\t\t// No metatable: done.\r\n    |  lbz TMP1, TAB:TMP1->nomm\r\n    |  andix. TMP1, TMP1, 1<<MM_newindex\r\n    |  bne <1\t\t\t\t// 'no __newindex' flag set: done.\r\n    |  b ->vmeta_tsetb\t\t\t// Caveat: preserve TMP0!\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMP3, TMP0\r\n    |  b <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  // RA = dst*8, RB = table*8, RC = key*8\r\n    |  add RB, BASE, RB\r\n    |  lwz TAB:CARG2, 4(RB)\r\n    |.if DUALNUM\r\n    |  add RC, BASE, RC\r\n    |    lbz TMP3, TAB:CARG2->marked\r\n    |  lwz TMP0, TAB:CARG2->asize\r\n    |  lwz CARG3, 4(RC)\r\n    |   lwz TMP1, TAB:CARG2->array\r\n    |.else\r\n    |  lfdx f0, BASE, RC\r\n    |    lbz TMP3, TAB:CARG2->marked\r\n    |  lwz TMP0, TAB:CARG2->asize\r\n    |  toint CARG3, f0\r\n    |   lwz TMP1, TAB:CARG2->array\r\n    |.endif\r\n    |  andix. TMP2, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |  bne >7\r\n    |2:\r\n    |  cmplw TMP0, CARG3\r\n    |   slwi TMP2, CARG3, 3\r\n    |   lfdx f14, BASE, RA\r\n    |  ble ->vmeta_tsetr\t\t// In array part?\r\n    |  ins_next1\r\n    |   stfdx f14, TMP1, TMP2\r\n    |  ins_next2\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP2\r\n    |  b <2\r\n    break;\r\n\r\n\r\n  case BC_TSETM:\r\n    |  // RA = base*8 (table at base-1), RD = num_const*8 (start index)\r\n    |  add RA, BASE, RA\r\n    |1:\r\n    |   add TMP3, KBASE, RD\r\n    |  lwz TAB:CARG2, -4(RA)\t\t// Guaranteed to be a table.\r\n    |    addic. TMP0, MULTRES, -8\r\n    |   lwz TMP3, 4(TMP3)\t\t// Integer constant is in lo-word.\r\n    |    srwi CARG3, TMP0, 3\r\n    |    beq >4\t\t\t\t// Nothing to copy?\r\n    |  add CARG3, CARG3, TMP3\r\n    |  lwz TMP2, TAB:CARG2->asize\r\n    |   slwi TMP1, TMP3, 3\r\n    |    lbz TMP3, TAB:CARG2->marked\r\n    |  cmplw CARG3, TMP2\r\n    |   add TMP2, RA, TMP0\r\n    |   lwz TMP0, TAB:CARG2->array\r\n    |  bgt >5\r\n    |   add TMP1, TMP1, TMP0\r\n    |    andix. TMP0, TMP3, LJ_GC_BLACK\t// isblack(table)\r\n    |3:  // Copy result slots to table.\r\n    |   lfd f0, 0(RA)\r\n    |  addi RA, RA, 8\r\n    |  cmpw cr1, RA, TMP2\r\n    |   stfd f0, 0(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  blt cr1, <3\r\n    |  bne >7\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |   stp BASE, L->base\r\n    |  mr CARG1, L\r\n    |   stw PC, SAVE_PC\r\n    |  mr SAVE0, RD\r\n    |  bl extern lj_tab_reasize\t\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  // Must not reallocate the stack.\r\n    |  mr RD, SAVE0\r\n    |  b <1\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:CARG2, TMP3, TMP0\r\n    |  b <4\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALLM:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALL follows.\r\n    break;\r\n  case BC_CALL:\r\n    |  // RA = base*8, (RB = (nresults+1)*8,) RC = (nargs+1)*8\r\n    |  mr TMP2, BASE\r\n    |  lwzux TMP0, BASE, RA\r\n    |   lwz LFUNC:RB, 4(BASE)\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |   addi BASE, BASE, 8\r\n    |  checkfunc TMP0; bne ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  // RA = base*8, (RB = 0,) RC = extra_nargs*8\r\n    |  add NARGS8:RC, NARGS8:RC, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows.\r\n    break;\r\n  case BC_CALLT:\r\n    |  // RA = base*8, (RB = 0,) RC = (nargs+1)*8\r\n    |  lwzux TMP0, RA, BASE\r\n    |   lwz LFUNC:RB, 4(RA)\r\n    |    subi NARGS8:RC, NARGS8:RC, 8\r\n    |    lwz TMP1, FRAME_PC(BASE)\r\n    |  checkfunc TMP0\r\n    |   addi RA, RA, 8\r\n    |  bne ->vmeta_callt\r\n    |->BC_CALLT_Z:\r\n    |  andix. TMP0, TMP1, FRAME_TYPE\t// Caveat: preserve cr0 until the crand.\r\n    |   lbz TMP3, LFUNC:RB->ffid\r\n    |    xori TMP2, TMP1, FRAME_VARG\r\n    |    cmplwi cr1, NARGS8:RC, 0\r\n    |  bne >7\r\n    |1:\r\n    |  stw LFUNC:RB, FRAME_FUNC(BASE)\t// Copy function down, but keep PC.\r\n    |  li TMP2, 0\r\n    |   cmplwi cr7, TMP3, 1\t\t// (> FF_C) Calling a fast function?\r\n    |    beq cr1, >3\r\n    |2:\r\n    |  addi TMP3, TMP2, 8\r\n    |   lfdx f0, RA, TMP2\r\n    |  cmplw cr1, TMP3, NARGS8:RC\r\n    |   stfdx f0, BASE, TMP2\r\n    |  mr TMP2, TMP3\r\n    |  bne cr1, <2\r\n    |3:\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+gt\r\n    |  beq >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function with a Lua frame below.\r\n    |  lwz INS, -4(TMP1)\r\n    |  decode_RA8 RA, INS\r\n    |  sub TMP1, BASE, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC-8(TMP1)\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\t// Need to prepare KBASE.\r\n    |  b <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  andix. TMP0, TMP2, FRAME_TYPEP\r\n    |  bne <1\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, BASE, TMP2\t\t// Relocate BASE down.\r\n    |  lwz TMP1, FRAME_PC(BASE)\r\n    |  andix. TMP0, TMP1, FRAME_TYPE\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 ((2+1)*8))\r\n    |  mr TMP2, BASE\r\n    |  add BASE, BASE, RA\r\n    |  lwz TMP1, -24(BASE)\r\n    |   lwz LFUNC:RB, -20(BASE)\r\n    |    lfd f1, -8(BASE)\r\n    |    lfd f0, -16(BASE)\r\n    |  stw TMP1, 0(BASE)\t\t// Copy callable.\r\n    |   stw LFUNC:RB, 4(BASE)\r\n    |  checkfunc TMP1\r\n    |    stfd f1, 16(BASE)\t\t// Copy control var.\r\n    |     li NARGS8:RC, 16\t\t// Iterators get 2 arguments.\r\n    |    stfdu f0, 8(BASE)\t\t// Copy state.\r\n    |  bne ->vmeta_call\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  // RA = base*8, (RB = (nresults+1)*8, RC = (nargs+1)*8 (2+1)*8)\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  add RA, BASE, RA\r\n    |  lwz TAB:RB, -12(RA)\r\n    |  lwz RC, -4(RA)\t\t\t// Get index from control var.\r\n    |  lwz TMP0, TAB:RB->asize\r\n    |  lwz TMP1, TAB:RB->array\r\n    |   addi PC, PC, 4\r\n    |1:  // Traverse array part.\r\n    |  cmplw RC, TMP0\r\n    |   slwi TMP3, RC, 3\r\n    |  bge >5\t\t\t\t// Index points after array part?\r\n    |  lwzx TMP2, TMP1, TMP3\r\n    |   lfdx f0, TMP1, TMP3\r\n    |  checknil TMP2\r\n    |     lwz INS, -4(PC)\r\n    |  beq >4\r\n    |.if DUALNUM\r\n    |   stw RC, 4(RA)\r\n    |   stw TISNUM, 0(RA)\r\n    |.else\r\n    |   tonum_u f1, RC\r\n    |.endif\r\n    |    addi RC, RC, 1\r\n    |     addis TMP3, PC, -(BCBIAS_J*4 >> 16)\r\n    |  stfd f0, 8(RA)\r\n    |     decode_RD4 TMP1, INS\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |     add PC, TMP1, TMP3\r\n    |.if not DUALNUM\r\n    |   stfd f1, 0(RA)\r\n    |.endif\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  addi RC, RC, 1\r\n    |  b <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  lwz TMP1, TAB:RB->hmask\r\n    |  sub RC, RC, TMP0\r\n    |   lwz TMP2, TAB:RB->node\r\n    |6:\r\n    |  cmplw RC, TMP1\t\t\t// End of iteration? Branch to ITERL+1.\r\n    |   slwi TMP3, RC, 5\r\n    |  bgty <3\r\n    |   slwi RB, RC, 3\r\n    |   sub TMP3, TMP3, RB\r\n    |  lwzx RB, TMP2, TMP3\r\n    |  lfdx f0, TMP2, TMP3\r\n    |   add NODE:TMP3, TMP2, TMP3\r\n    |  checknil RB\r\n    |     lwz INS, -4(PC)\r\n    |  beq >7\r\n    |   lfd f1, NODE:TMP3->key\r\n    |     addis TMP2, PC, -(BCBIAS_J*4 >> 16)\r\n    |  stfd f0, 8(RA)\r\n    |    add RC, RC, TMP0\r\n    |     decode_RD4 TMP1, INS\r\n    |   stfd f1, 0(RA)\r\n    |    addi RC, RC, 1\r\n    |     add PC, TMP1, TMP2\r\n    |    stw RC, -4(RA)\t\t\t// Update control var.\r\n    |  b <3\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  addi RC, RC, 1\r\n    |  b <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  // RA = base*8, RD = target (points to ITERN)\r\n    |  add RA, BASE, RA\r\n    |  lwz TMP0, -24(RA)\r\n    |  lwz CFUNC:TMP1, -20(RA)\r\n    |   lwz TMP2, -16(RA)\r\n    |    lwz TMP3, -8(RA)\r\n    |   cmpwi cr0, TMP2, LJ_TTAB\r\n    |  cmpwi cr1, TMP0, LJ_TFUNC\r\n    |    cmpwi cr6, TMP3, LJ_TNIL\r\n    |  bne cr1, >5\r\n    |  lbz TMP1, CFUNC:TMP1->ffid\r\n    |   crand 4*cr0+eq, 4*cr0+eq, 4*cr6+eq\r\n    |  cmpwi cr7, TMP1, FF_next_N\r\n    |    srwi TMP0, RD, 1\r\n    |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+eq\r\n    |    add TMP3, PC, TMP0\r\n    |  bne cr0, >5\r\n    |  lus TMP1, 0xfffe\r\n    |  ori TMP1, TMP1, 0x7fff\r\n    |  stw ZERO, -4(RA)\t\t\t// Initialize control var.\r\n    |  stw TMP1, -8(RA)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  li TMP0, BC_JMP\r\n    |   li TMP1, BC_ITERC\r\n    |  stb TMP0, -1(PC)\r\n    |    addis PC, TMP3, -(BCBIAS_J*4 >> 16)\r\n    |   stb TMP1, 3(PC)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  // RA = base*8, RB = (nresults+1)*8, RC = numparams*8\r\n    |  lwz TMP0, FRAME_PC(BASE)\r\n    |  add RC, BASE, RC\r\n    |   add RA, BASE, RA\r\n    |  addi RC, RC, FRAME_VARG\r\n    |   add TMP2, RA, RB\r\n    |  subi TMP3, BASE, 8\t\t// TMP3 = vtop\r\n    |  sub RC, RC, TMP0\t\t\t// RC = vbase\r\n    |  // Note: RC may now be even _above_ BASE if nargs was < numparams.\r\n    |  cmplwi cr1, RB, 0\r\n    |.if PPE\r\n    |   sub TMP1, TMP3, RC\r\n    |   cmpwi TMP1, 0\r\n    |.else\r\n    |   sub. TMP1, TMP3, RC\r\n    |.endif\r\n    |  beq cr1, >5\t\t\t// Copy all varargs?\r\n    |   subi TMP2, TMP2, 16\r\n    |   ble >2\t\t\t\t// No vararg slots?\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  lfd f0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  stfd f0, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   cmplw cr1, RC, TMP3\r\n    |  bge >3\t\t\t\t// All destination slots filled?\r\n    |    addi RA, RA, 8\r\n    |   blt cr1, <1\t\t\t// More vararg slots?\r\n    |2:  // Fill up remainder with nil.\r\n    |  stw TISNIL, 0(RA)\r\n    |  cmplw RA, TMP2\r\n    |   addi RA, RA, 8\r\n    |  blt <2\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  lwz TMP0, L->maxstack\r\n    |   li MULTRES, 8\t\t\t// MULTRES = (0+1)*8\r\n    |  bley <3\t\t\t\t// No vararg slots?\r\n    |  add TMP2, RA, TMP1\r\n    |  cmplw TMP2, TMP0\r\n    |   addi MULTRES, TMP1, 8\r\n    |  bgt >7\r\n    |6:\r\n    |  lfd f0, 0(RC)\r\n    |   addi RC, RC, 8\r\n    |  stfd f0, 0(RA)\r\n    |  cmplw RC, TMP3\r\n    |   addi RA, RA, 8\r\n    |  blt <6\t\t\t\t// More vararg slots?\r\n    |  b <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mr CARG1, L\r\n    |   stp RA, L->top\r\n    |  sub SAVE0, RC, BASE\t\t// Need delta, because BASE may change.\r\n    |   stp BASE, L->base\r\n    |  sub RA, RA, BASE\r\n    |   stw PC, SAVE_PC\r\n    |  srwi CARG2, TMP1, 3\r\n    |  bl extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  lp BASE, L->base\r\n    |  add RA, BASE, RA\r\n    |  add RC, BASE, SAVE0\r\n    |  subi TMP3, BASE, 8\r\n    |  b <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  // RA = results*8, RD = extra_nresults*8\r\n    |  add RD, RD, MULTRES\t\t// MULTRES >= 8, so RD >= 8.\r\n    |  // Fall through. Assumes BC_RET follows.\r\n    break;\r\n\r\n  case BC_RET:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |1:\r\n    |  andix. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bne ->BC_RETV_Z\r\n    |\r\n    |->BC_RET_Z:\r\n    |  // BASE = base, RA = resultptr, RD = (nresults+1)*8, PC = return\r\n    |   lwz INS, -4(PC)\r\n    |  cmpwi RD, 8\r\n    |   subi TMP2, BASE, 8\r\n    |   subi RC, RD, 8\r\n    |   decode_RB8 RB, INS\r\n    |  beq >3\r\n    |   li TMP1, 0\r\n    |2:\r\n    |  addi TMP3, TMP1, 8\r\n    |   lfdx f0, RA, TMP1\r\n    |  cmpw TMP3, RC\r\n    |   stfdx f0, TMP2, TMP1\r\n    |  beq >3\r\n    |  addi TMP1, TMP3, 8\r\n    |   lfdx f1, RA, TMP3\r\n    |  cmpw TMP1, RC\r\n    |   stfdx f1, TMP2, TMP3\r\n    |  bne <2\r\n    |3:\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  stwx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    |\r\n    |->BC_RETV_Z:  // Non-standard return case.\r\n    |  andix. TMP2, TMP1, FRAME_TYPEP\r\n    |  bne ->vm_return\r\n    |  // Return from vararg function: relocate BASE down.\r\n    |  sub BASE, BASE, TMP1\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |  b <1\r\n    break;\r\n\r\n  case BC_RET0: case BC_RET1:\r\n    |  // RA = results*8, RD = (nresults+1)*8\r\n    |  lwz PC, FRAME_PC(BASE)\r\n    |   add RA, BASE, RA\r\n    |    mr MULTRES, RD\r\n    |  andix. TMP0, PC, FRAME_TYPE\r\n    |   xori TMP1, PC, FRAME_VARG\r\n    |  bney ->BC_RETV_Z\r\n    |\r\n    |  lwz INS, -4(PC)\r\n    |   subi TMP2, BASE, 8\r\n    |  decode_RB8 RB, INS\r\n    if (op == BC_RET1) {\r\n      |  lfd f0, 0(RA)\r\n      |  stfd f0, 0(TMP2)\r\n    }\r\n    |5:\r\n    |  cmplw RB, RD\r\n    |   decode_RA8 RA, INS\r\n    |  bgt >6\r\n    |   sub BASE, TMP2, RA\r\n    |  lwz LFUNC:TMP1, FRAME_FUNC(BASE)\r\n    |  ins_next1\r\n    |  lwz TMP1, LFUNC:TMP1->pc\r\n    |  lwz KBASE, PC2PROTO(k)(TMP1)\r\n    |  ins_next2\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    |  subi TMP1, RD, 8\r\n    |   addi RD, RD, 8\r\n    |  stwx TISNIL, TMP2, TMP1\r\n    |  b <5\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IFORL follows.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    |  // RA = base*8, RD = target (after end of loop or start of loop)\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |.if DUALNUM\r\n    |  // Integer loop.\r\n    |  lwzux TMP1, RA, BASE\r\n    |   lwz CARG1, FORL_IDX*8+4(RA)\r\n    |  cmplw cr0, TMP1, TISNUM\r\n    if (vk) {\r\n      |   lwz CARG3, FORL_STEP*8+4(RA)\r\n      |  bne >9\r\n      |.if GPR64\r\n      |  // Need to check overflow for (a<<32) + (b<<32).\r\n      |  rldicr TMP0, CARG1, 32, 31\r\n      |  rldicr TMP2, CARG3, 32, 31\r\n      |  add CARG1, CARG1, CARG3\r\n      |  addo. TMP0, TMP0, TMP2\r\n      |.else\r\n      |  addo. CARG1, CARG1, CARG3\r\n      |.endif\r\n      |    cmpwi cr6, CARG3, 0\r\n      |   lwz CARG2, FORL_STOP*8+4(RA)\r\n      |  bso >6\r\n      |4:\r\n      |  stw CARG1, FORL_IDX*8+4(RA)\r\n    } else {\r\n      |  lwz TMP3, FORL_STEP*8(RA)\r\n      |   lwz CARG3, FORL_STEP*8+4(RA)\r\n      |  lwz TMP2, FORL_STOP*8(RA)\r\n      |   lwz CARG2, FORL_STOP*8+4(RA)\r\n      |  cmplw cr7, TMP3, TISNUM\r\n      |  cmplw cr1, TMP2, TISNUM\r\n      |  crand 4*cr0+eq, 4*cr0+eq, 4*cr7+eq\r\n      |  crand 4*cr0+eq, 4*cr0+eq, 4*cr1+eq\r\n      |    cmpwi cr6, CARG3, 0\r\n      |  bne >9\r\n    }\r\n    |    blt cr6, >5\r\n    |  cmpw CARG1, CARG2\r\n    |1:\r\n    |   stw TISNUM, FORL_EXT*8(RA)\r\n    if (op != BC_JFORL) {\r\n      |  srwi RD, RD, 1\r\n    }\r\n    |   stw CARG1, FORL_EXT*8+4(RA)\r\n    if (op != BC_JFORL) {\r\n      |  add RD, PC, RD\r\n    }\r\n    if (op == BC_FORI) {\r\n      |  bgt >3  // See FP loop below.\r\n    } else if (op == BC_JFORI) {\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n      |  bley >7\r\n    } else if (op == BC_IFORL) {\r\n      |  bgt >2\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else {\r\n      |  bley =>BC_JLOOP\r\n    }\r\n    |2:\r\n    |  ins_next\r\n    |5:  // Invert check for negative step.\r\n    |  cmpw CARG2, CARG1\r\n    |  b <1\r\n    if (vk) {\r\n      |6:  // Potential overflow.\r\n      |  checkov TMP0, <4\t\t// Ignore unrelated overflow.\r\n      |  b <2\r\n    }\r\n    |.endif\r\n    if (vk) {\r\n      |.if DUALNUM\r\n      |9:  // FP loop.\r\n      |  lfd f1, FORL_IDX*8(RA)\r\n      |.else\r\n      |  lfdux f1, RA, BASE\r\n      |.endif\r\n      |  lfd f3, FORL_STEP*8(RA)\r\n      |  lfd f2, FORL_STOP*8(RA)\r\n      |   lwz TMP3, FORL_STEP*8(RA)\r\n      |  fadd f1, f1, f3\r\n      |  stfd f1, FORL_IDX*8(RA)\r\n    } else {\r\n      |.if DUALNUM\r\n      |9:  // FP loop.\r\n      |.else\r\n      |  lwzux TMP1, RA, BASE\r\n      |  lwz TMP3, FORL_STEP*8(RA)\r\n      |  lwz TMP2, FORL_STOP*8(RA)\r\n      |  cmplw cr0, TMP1, TISNUM\r\n      |  cmplw cr7, TMP3, TISNUM\r\n      |  cmplw cr1, TMP2, TISNUM\r\n      |.endif\r\n      |   lfd f1, FORL_IDX*8(RA)\r\n      |  crand 4*cr0+lt, 4*cr0+lt, 4*cr7+lt\r\n      |  crand 4*cr0+lt, 4*cr0+lt, 4*cr1+lt\r\n      |   lfd f2, FORL_STOP*8(RA)\r\n      |  bge ->vmeta_for\r\n    }\r\n    |  cmpwi cr6, TMP3, 0\r\n    if (op != BC_JFORL) {\r\n      |  srwi RD, RD, 1\r\n    }\r\n    |   stfd f1, FORL_EXT*8(RA)\r\n    if (op != BC_JFORL) {\r\n      |  add RD, PC, RD\r\n    }\r\n    |  fcmpu cr0, f1, f2\r\n    if (op == BC_JFORI) {\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    }\r\n    |  blt cr6, >5\r\n    if (op == BC_FORI) {\r\n      |  bgt >3\r\n    } else if (op == BC_IFORL) {\r\n      |.if DUALNUM\r\n      |  bgty <2\r\n      |.else\r\n      |  bgt >2\r\n      |.endif\r\n      |1:\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else if (op == BC_JFORI) {\r\n      |  bley >7\r\n    } else {\r\n      |  bley =>BC_JLOOP\r\n    }\r\n    |.if DUALNUM\r\n    |  b <2\r\n    |.else\r\n    |2:\r\n    |  ins_next\r\n    |.endif\r\n    |5:  // Negative step.\r\n    if (op == BC_FORI) {\r\n      |  bge <2\r\n      |3:  // Used by integer loop, too.\r\n      |  addis PC, RD, -(BCBIAS_J*4 >> 16)\r\n    } else if (op == BC_IFORL) {\r\n      |  bgey <1\r\n    } else if (op == BC_JFORI) {\r\n      |  bgey >7\r\n    } else {\r\n      |  bgey =>BC_JLOOP\r\n    }\r\n    |  b <2\r\n    if (op == BC_JFORI) {\r\n      |7:\r\n      |  lwz INS, -4(PC)\r\n      |  decode_RD8 RD, INS\r\n      |  b =>BC_JLOOP\r\n    }\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_IITERL follows.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  // RA = base*8, RD = target\r\n    |  lwzux TMP1, RA, BASE\r\n    |   lwz TMP2, 4(RA)\r\n    |  checknil TMP1; beq >1\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  stw TMP1, -8(RA)\r\n      |   stw TMP2, -4(RA)\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  branch_RD\t\t\t// Otherwise save control var + branch.\r\n      |  stw TMP1, -8(RA)\r\n      |   stw TMP2, -4(RA)\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop\r\n    |.endif\r\n    |  // Fall through. Assumes BC_ILOOP follows.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  // RA = base*8, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  // RA = base*8 (ignored), RD = traceno*8\r\n    |  lwz TMP1, DISPATCH_J(trace)(DISPATCH)\r\n    |  srwi RD, RD, 1\r\n    |  // Traces on PPC don't store the trace number, so use 0.\r\n    |   stw ZERO, DISPATCH_GL(vmstate)(DISPATCH)\r\n    |  lwzx TRACE:TMP2, TMP1, RD\r\n    |  clrso TMP1\r\n    |  lp TMP2, TRACE:TMP2->mcode\r\n    |   stw BASE, DISPATCH_GL(jit_base)(DISPATCH)\r\n    |  mtctr TMP2\r\n    |   addi JGL, DISPATCH, GG_DISP2G+32768\r\n    |   stw L, DISPATCH_GL(tmpbuf.L)(DISPATCH)\r\n    |  bctr\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  // RA = base*8 (only used by trace recorder), RD = target\r\n    |  branch_RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    |  // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   lbz TMP1, -4+PC2PROTO(numparams)(PC)\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw RA, TMP2\r\n    |   slwi TMP1, TMP1, 3\r\n    |  bgt ->vm_growstack_l\r\n    if (op != BC_JFUNCF) {\r\n      |  ins_next1\r\n    }\r\n    |2:\r\n    |  cmplw NARGS8:RC, TMP1\t\t// Check for missing parameters.\r\n    |  blt >3\r\n    if (op == BC_JFUNCF) {\r\n      |  decode_RD8 RD, INS\r\n      |  b =>BC_JLOOP\r\n    } else {\r\n      |  ins_next2\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  stwx TISNIL, BASE, NARGS8:RC\r\n    |  addi NARGS8:RC, NARGS8:RC, 8\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    |  NYI  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = LFUNC, RC = nargs*8\r\n    |  lwz TMP2, L->maxstack\r\n    |   add TMP1, BASE, RC\r\n    |  add TMP0, RA, RC\r\n    |   stw LFUNC:RB, 4(TMP1)\t\t// Store copy of LFUNC.\r\n    |   addi TMP3, RC, 8+FRAME_VARG\r\n    |    lwz KBASE, -4+PC2PROTO(k)(PC)\r\n    |  cmplw TMP0, TMP2\r\n    |   stw TMP3, 0(TMP1)\t\t// Store delta + FRAME_VARG.\r\n    |  bge ->vm_growstack_l\r\n    |  lbz TMP2, -4+PC2PROTO(numparams)(PC)\r\n    |   mr RA, BASE\r\n    |   mr RC, TMP1\r\n    |  ins_next1\r\n    |  cmpwi TMP2, 0\r\n    |   addi BASE, TMP1, 8\r\n    |  beq >3\r\n    |1:\r\n    |  cmplw RA, RC\t\t\t// Less args than parameters?\r\n    |   lwz TMP0, 0(RA)\r\n    |   lwz TMP3, 4(RA)\r\n    |  bge >4\r\n    |    stw TISNIL, 0(RA)\t\t// Clear old fixarg slot (help the GC).\r\n    |    addi RA, RA, 8\r\n    |2:\r\n    |  addic. TMP2, TMP2, -1\r\n    |   stw TMP0, 8(TMP1)\r\n    |   stw TMP3, 12(TMP1)\r\n    |    addi TMP1, TMP1, 8\r\n    |  bne <1\r\n    |3:\r\n    |  ins_next2\r\n    |\r\n    |4:  // Clear missing parameters.\r\n    |  li TMP0, LJ_TNIL\r\n    |  b <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  // BASE = new base, RA = BASE+framesize*8, RB = CFUNC, RC = nargs*8\r\n    if (op == BC_FUNCC) {\r\n      |  lp RD, CFUNC:RB->f\r\n    } else {\r\n      |  lp RD, DISPATCH_GL(wrapf)(DISPATCH)\r\n    }\r\n    |   add TMP1, RA, NARGS8:RC\r\n    |   lwz TMP2, L->maxstack\r\n    |  .toc lp TMP3, 0(RD)\r\n    |    add RC, BASE, NARGS8:RC\r\n    |   stp BASE, L->base\r\n    |   cmplw TMP1, TMP2\r\n    |    stp RC, L->top\r\n    |     li_vmstate C\r\n    |.if TOC\r\n    |  mtctr TMP3\r\n    |.else\r\n    |  mtctr RD\r\n    |.endif\r\n    if (op == BC_FUNCCW) {\r\n      |  lp CARG2, CFUNC:RB->f\r\n    }\r\n    |  mr CARG1, L\r\n    |   bgt ->vm_growstack_c\t\t// Need to grow stack.\r\n    |  .toc lp TOCREG, TOC_OFS(RD)\r\n    |  .tocenv lp ENVREG, ENV_OFS(RD)\r\n    |     st_vmstate\r\n    |  bctrl\t\t\t\t// (lua_State *L [, lua_CFunction f])\r\n    |  // Returns nresults.\r\n    |  lp BASE, L->base\r\n    |  .toc ld TOCREG, SAVE_TOC\r\n    |   slwi RD, CRET1, 3\r\n    |  lp TMP1, L->top\r\n    |    li_vmstate INTERP\r\n    |  lwz PC, FRAME_PC(BASE)\t\t// Fetch PC of caller.\r\n    |    stw L, DISPATCH_GL(cur_L)(DISPATCH)\r\n    |   sub RA, TMP1, RD\t\t// RA = L->top - nresults*8\r\n    |    st_vmstate\r\n    |  b ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n\r\n  dasm_growpc(Dst, BC__MAX);\r\n\r\n  build_subroutines(ctx);\r\n\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  int i;\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.uleb128 55\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 37+(31-i), 0x80+32+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE0:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_TARGET_PS3\r\n\t\"\\t.long .lj_vm_ffi_call\\n\"\r\n#else\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n#endif\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xe\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#if !LJ_NO_UNWIND\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x5\\n\\t.uleb128 70\\n\\t.uleb128 55\\n\",\r\n\tfcofs, CFRAME_SIZE);\r\n    for (i = 14; i <= 31; i++)\r\n      fprintf(ctx->fp,\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\"\r\n\t\"\\t.byte %d\\n\\t.uleb128 %d\\n\",\r\n\t0x80+i, 37+(31-i), 0x80+32+i, 2+2*(31-i));\r\n    fprintf(ctx->fp,\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE2:\\n\\n\");\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -4\\n\"\r\n\t\"\\t.byte 65\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 1\\n\\t.uleb128 0\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x11\\n\\t.uleb128 65\\n\\t.sleb128 -1\\n\"\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 2\\n\"\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0xe\\n\"\r\n\t\"\\t.align 2\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#endif\r\n    break;\r\n  default:\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_x64.dasc",
    "content": "|// Low-level VM code for x64 CPUs in LJ_GC64 mode.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.arch x64\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|.if WIN\r\n|.define X64WIN, 1\t\t\t// Windows/x64 calling conventions.\r\n|.endif\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// This is very fragile and has many dependencies. Caveat emptor.\r\n|.define BASE,\t\trdx\t\t// Not C callee-save, refetched anyway.\r\n|.if X64WIN\r\n|.define KBASE,\t\trdi\t\t// Must be C callee-save.\r\n|.define PC,\t\trsi\t\t// Must be C callee-save.\r\n|.define DISPATCH,\trbx\t\t// Must be C callee-save.\r\n|.define KBASEd,\tedi\r\n|.define PCd,\t\tesi\r\n|.define DISPATCHd,\tebx\r\n|.else\r\n|.define KBASE,\t\tr15\t\t// Must be C callee-save.\r\n|.define PC,\t\trbx\t\t// Must be C callee-save.\r\n|.define DISPATCH,\tr14\t\t// Must be C callee-save.\r\n|.define KBASEd,\tr15d\r\n|.define PCd,\t\tebx\r\n|.define DISPATCHd,\tr14d\r\n|.endif\r\n|\r\n|.define RA,\t\trcx\r\n|.define RAd,\t\tecx\r\n|.define RAH,\t\tch\r\n|.define RAL,\t\tcl\r\n|.define RB,\t\trbp\t\t// Must be rbp (C callee-save).\r\n|.define RBd,\t\tebp\r\n|.define RC,\t\trax\t\t// Must be rax.\r\n|.define RCd,\t\teax\r\n|.define RCW,\t\tax\r\n|.define RCH,\t\tah\r\n|.define RCL,\t\tal\r\n|.define OP,\t\tRBd\r\n|.define RD,\t\tRC\r\n|.define RDd,\t\tRCd\r\n|.define RDW,\t\tRCW\r\n|.define RDL,\t\tRCL\r\n|.define TMPR,\t\tr10\r\n|.define TMPRd,\t\tr10d\r\n|.define ITYPE,\t\tr11\r\n|.define ITYPEd,\tr11d\r\n|\r\n|.if X64WIN\r\n|.define CARG1,\t\trcx\t\t// x64/WIN64 C call arguments.\r\n|.define CARG2,\t\trdx\r\n|.define CARG3,\t\tr8\r\n|.define CARG4,\t\tr9\r\n|.define CARG1d,\tecx\r\n|.define CARG2d,\tedx\r\n|.define CARG3d,\tr8d\r\n|.define CARG4d,\tr9d\r\n|.else\r\n|.define CARG1,\t\trdi\t\t// x64/POSIX C call arguments.\r\n|.define CARG2,\t\trsi\r\n|.define CARG3,\t\trdx\r\n|.define CARG4,\t\trcx\r\n|.define CARG5,\t\tr8\r\n|.define CARG6,\t\tr9\r\n|.define CARG1d,\tedi\r\n|.define CARG2d,\tesi\r\n|.define CARG3d,\tedx\r\n|.define CARG4d,\tecx\r\n|.define CARG5d,\tr8d\r\n|.define CARG6d,\tr9d\r\n|.endif\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|//-----------------------------------------------------------------------\r\n|.if X64WIN\t\t// x64/Windows stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rdi; push rsi; push rbx\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|  pop rbx; pop rsi; pop rdi; pop rbp\r\n|.endmacro\r\n|\r\n|.define SAVE_CFRAME,\taword [rsp+aword*13]\r\n|.define SAVE_PC,\taword [rsp+aword*12]\r\n|.define SAVE_L,\taword [rsp+aword*11]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*21]\r\n|.define SAVE_NRES,\tdword [rsp+dword*20]\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by interpreter\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.define ARG5,\t\taword [rsp+aword*4]\r\n|.define CSAVE_4,\taword [rsp+aword*3]\r\n|.define CSAVE_3,\taword [rsp+aword*2]\r\n|.define CSAVE_2,\taword [rsp+aword*1]\r\n|.define CSAVE_1,\taword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by callee\r\n|\r\n|.define ARG5d,\t\tdword [rsp+dword*8]\r\n|.define TMP1,\t\tARG5\t\t\t// TMP1 overlaps ARG5\r\n|.define TMP1d,\t\tARG5d\r\n|.define TMP1hi,\tdword [rsp+dword*9]\r\n|.define MULTRES,\tTMP1d\t\t\t// MULTRES overlaps TMP1d.\r\n|\r\n|//-----------------------------------------------------------------------\r\n|.else\t\t\t// x64/POSIX stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rbx; push r15; push r14\r\n|.if NO_UNWIND\r\n|  push r13; push r12\r\n|.endif\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|.if NO_UNWIND\r\n|  pop r12; pop r13\r\n|.endif\r\n|  pop r14; pop r15; pop rbx; pop rbp\r\n|.endmacro\r\n|\r\n|//----- 16 byte aligned,\r\n|.if NO_UNWIND\r\n|.define SAVE_RET,\taword [rsp+aword*11]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*10]\r\n|.define SAVE_R3,\taword [rsp+aword*9]\r\n|.define SAVE_R2,\taword [rsp+aword*8]\r\n|.define SAVE_R1,\taword [rsp+aword*7]\r\n|.define SAVE_RU2,\taword [rsp+aword*6]\r\n|.define SAVE_RU1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.else\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.endif\r\n|.define SAVE_CFRAME,\taword [rsp+aword*4]\r\n|.define SAVE_PC,\taword [rsp+aword*3]\r\n|.define SAVE_L,\taword [rsp+aword*2]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*3]\r\n|.define SAVE_NRES,\tdword [rsp+dword*2]\r\n|.define TMP1,\t\taword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned\r\n|\r\n|.define TMP1d,\t\tdword [rsp]\r\n|.define TMP1hi,\tdword [rsp+dword*1]\r\n|.define MULTRES,\tTMP1d\t\t\t// MULTRES overlaps TMP1d.\r\n|\r\n|.endif\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Instruction headers.\r\n|.macro ins_A; .endmacro\r\n|.macro ins_AD; .endmacro\r\n|.macro ins_AJ; .endmacro\r\n|.macro ins_ABC; movzx RBd, RCH; movzx RCd, RCL; .endmacro\r\n|.macro ins_AB_; movzx RBd, RCH; .endmacro\r\n|.macro ins_A_C; movzx RCd, RCL; .endmacro\r\n|.macro ins_AND; not RD; .endmacro\r\n|\r\n|// Instruction decode+dispatch. Carefully tuned (nope, lodsd is not faster).\r\n|.macro ins_NEXT\r\n|  mov RCd, [PC]\r\n|  movzx RAd, RCH\r\n|  movzx OP, RCL\r\n|  add PC, 4\r\n|  shr RCd, 16\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  // Around 10%-30% slower on Core2, a lot more slower on P4.\r\n|  .macro ins_next\r\n|    jmp ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1, [BASE-8] = PC\r\n|  mov PC, LFUNC:RB->pc\r\n|  mov RAd, [PC]\r\n|  movzx OP, RAL\r\n|  movzx RAd, RAH\r\n|  add PC, 4\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n|  mov [BASE-8], PC\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to clear or set tags.\r\n|.macro cleartp, reg; shl reg, 17; shr reg, 17; .endmacro\r\n|.macro settp, reg, tp\r\n|  mov64 ITYPE, ((int64_t)tp<<47)\r\n|  or reg, ITYPE\r\n|.endmacro\r\n|.macro settp, dst, reg, tp\r\n|  mov64 dst, ((int64_t)tp<<47)\r\n|  or dst, reg\r\n|.endmacro\r\n|.macro setint, reg\r\n|  settp reg, LJ_TISNUM\r\n|.endmacro\r\n|.macro setint, dst, reg\r\n|  settp dst, reg, LJ_TISNUM\r\n|.endmacro\r\n|\r\n|// Macros to test operand types.\r\n|.macro checktp_nc, reg, tp, target\r\n|  mov ITYPE, reg\r\n|  sar ITYPE, 47\r\n|  cmp ITYPEd, tp\r\n|  jne target\r\n|.endmacro\r\n|.macro checktp, reg, tp, target\r\n|  mov ITYPE, reg\r\n|  cleartp reg\r\n|  sar ITYPE, 47\r\n|  cmp ITYPEd, tp\r\n|  jne target\r\n|.endmacro\r\n|.macro checktptp, src, tp, target\r\n|  mov ITYPE, src\r\n|  sar ITYPE, 47\r\n|  cmp ITYPEd, tp\r\n|  jne target\r\n|.endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR, target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB, target; .endmacro\r\n|.macro checkfunc, reg, target; checktp reg, LJ_TFUNC, target; .endmacro\r\n|\r\n|.macro checknumx, reg, target, jump\r\n|  mov ITYPE, reg\r\n|  sar ITYPE, 47\r\n|  cmp ITYPEd, LJ_TISNUM\r\n|  jump target\r\n|.endmacro\r\n|.macro checkint, reg, target; checknumx reg, target, jne; .endmacro\r\n|.macro checkinttp, src, target; checknumx src, target, jne; .endmacro\r\n|.macro checknum, reg, target; checknumx reg, target, jae; .endmacro\r\n|.macro checknumtp, src, target; checknumx src, target, jae; .endmacro\r\n|.macro checknumber, src, target; checknumx src, target, ja; .endmacro\r\n|\r\n|.macro mov_false, reg; mov64 reg, (int64_t)~((uint64_t)1<<47); .endmacro\r\n|.macro mov_true, reg; mov64 reg, (int64_t)~((uint64_t)2<<47); .endmacro\r\n|\r\n|// These operands must be used with movzx.\r\n|.define PC_OP, byte [PC-4]\r\n|.define PC_RA, byte [PC-3]\r\n|.define PC_RB, byte [PC-1]\r\n|.define PC_RC, byte [PC-2]\r\n|.define PC_RD, word [PC-2]\r\n|\r\n|.macro branchPC, reg\r\n|  lea PC, [PC+reg*4-BCBIAS_J*4]\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|// Decrement hashed hotcount and trigger trace recorder if zero.\r\n|.macro hotloop, reg\r\n|  mov reg, PCd\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_LOOP\r\n|  jb ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall, reg\r\n|  mov reg, PCd\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_CALL\r\n|  jb ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro set_vmstate, st\r\n|  mov dword [DISPATCH+DISPATCH_GL(vmstate)], ~LJ_VMST_..st\r\n|.endmacro\r\n|\r\n|.macro fpop1; fstp st1; .endmacro\r\n|\r\n|// Synthesize SSE FP constants.\r\n|.macro sseconst_abs, reg, tmp\t\t// Synthesize abs mask.\r\n|  mov64 tmp, U64x(7fffffff,ffffffff); movd reg, tmp\r\n|.endmacro\r\n|\r\n|.macro sseconst_hi, reg, tmp, val\t// Synthesize hi-32 bit const.\r\n|  mov64 tmp, U64x(val,00000000); movd reg, tmp\r\n|.endmacro\r\n|\r\n|.macro sseconst_sign, reg, tmp\t\t// Synthesize sign mask.\r\n|  sseconst_hi reg, tmp, 80000000\r\n|.endmacro\r\n|.macro sseconst_1, reg, tmp\t\t// Synthesize 1.0.\r\n|  sseconst_hi reg, tmp, 3ff00000\r\n|.endmacro\r\n|.macro sseconst_m1, reg, tmp\t\t// Synthesize -1.0.\r\n|  sseconst_hi reg, tmp, bff00000\r\n|.endmacro\r\n|.macro sseconst_2p52, reg, tmp\t\t// Synthesize 2^52.\r\n|  sseconst_hi reg, tmp, 43300000\r\n|.endmacro\r\n|.macro sseconst_tobit, reg, tmp\t// Synthesize 2^52 + 2^51.\r\n|  sseconst_hi reg, tmp, 43380000\r\n|.endmacro\r\n|\r\n|// Move table write barrier back. Overwrites reg.\r\n|.macro barrierback, tab, reg\r\n|  and byte tab->marked, (uint8_t)~LJ_GC_BLACK\t// black2gray(tab)\r\n|  mov reg, [DISPATCH+DISPATCH_GL(gc.grayagain)]\r\n|  mov [DISPATCH+DISPATCH_GL(gc.grayagain)], tab\r\n|  mov tab->gclist, reg\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  test PCd, FRAME_P\r\n  |  jz ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  and PC, -8\r\n  |  sub BASE, PC\t\t\t// Restore caller base.\r\n  |  lea RA, [RA+PC-8]\t\t\t// Rebase RA and prepend one result.\r\n  |  mov PC, [BASE-8]\t\t\t// Fetch PC of previous frame.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |  mov_true ITYPE\r\n  |  mov aword [BASE+RA], ITYPE\t\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  add RDd, 1\t\t\t\t// RD = nresults+1\r\n  |  jz ->vm_unwind_yield\r\n  |  mov MULTRES, RDd\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultofs, RD = nresults+1 (= MULTRES), PC = return\r\n  |  xor PC, FRAME_C\r\n  |  test PCd, FRAME_TYPE\r\n  |  jnz ->vm_returnp\r\n  |\r\n  |  // Return to C.\r\n  |  set_vmstate C\r\n  |  and PC, -8\r\n  |  sub PC, BASE\r\n  |  neg PC\t\t\t\t// Previous base = BASE - delta.\r\n  |\r\n  |  sub RDd, 1\r\n  |  jz >2\r\n  |1:  // Move results down.\r\n  |  mov RB, [BASE+RA]\r\n  |  mov [BASE-16], RB\r\n  |  add BASE, 8\r\n  |  sub RDd, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, PC\r\n  |3:\r\n  |  mov RDd, MULTRES\r\n  |  mov RAd, SAVE_NRES\t\t\t// RA = wanted nresults+1\r\n  |4:\r\n  |  cmp RAd, RDd\r\n  |  jne >6\t\t\t\t// More/less results wanted?\r\n  |5:\r\n  |  sub BASE, 16\r\n  |  mov L:RB->top, BASE\r\n  |\r\n  |->vm_leave_cp:\r\n  |  mov RA, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |  mov L:RB->cframe, RA\r\n  |  xor eax, eax\t\t\t// Ok return status for vm_pcall.\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  ret\r\n  |\r\n  |6:\r\n  |  jb >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  cmp BASE, L:RB->maxstack\r\n  |  ja >8\r\n  |  mov aword [BASE-16], LJ_TNIL\r\n  |  add BASE, 8\r\n  |  add RDd, 1\r\n  |  jmp <4\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  test RAd, RAd\r\n  |  jz <5\t\t\t\t// But check for LUA_MULTRET+1.\r\n  |  sub RA, RD\t\t\t\t// Negative result!\r\n  |  lea BASE, [BASE+RA*8]\t\t// Correct top.\r\n  |  jmp <5\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  mov L:RB->top, BASE\t\t// Save current top held in BASE (yes).\r\n  |  mov MULTRES, RDd\t\t\t// Need to fill only remainder with nil.\r\n  |  mov CARG2d, RAd\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->top\t\t// Need the (realloced) L->top in BASE.\r\n  |  jmp <3\r\n  |\r\n  |->vm_unwind_yield:\r\n  |  mov al, LUA_YIELD\r\n  |  jmp ->vm_unwind_c_eh\r\n  |\r\n  |->vm_unwind_c:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |  mov eax, CARG2d\t\t\t// Error return status for vm_pcall.\r\n  |  mov rsp, CARG1\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov GL:RB, L:RB->glref\r\n  |  mov dword GL:RB->vmstate, ~LJ_VMST_C\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_rethrow:\r\n  |.if not X64WIN\r\n  |  mov CARG1, SAVE_L\r\n  |  mov CARG2d, eax\r\n  |  restoreregs\r\n  |  jmp extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |->vm_unwind_ff:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |  and CARG1, CFRAME_RAWMASK\r\n  |  mov rsp, CARG1\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RDd, 1+1\t\t\t// Really 1+2 results, incr. later.\r\n  |  mov BASE, L:RB->base\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov PC, [BASE-8]\t\t\t// Fetch PC of previous frame.\r\n  |  mov_false RA\r\n  |  mov RB, [BASE]\r\n  |  mov [BASE-16], RA\t\t\t// Prepend false to error message.\r\n  |  mov [BASE-8], RB\r\n  |  mov RA, -16\t\t\t// Results start at BASE+RA = BASE-16.\r\n  |  set_vmstate INTERP\r\n  |  jmp ->vm_returnc\t\t\t// Increments RD/MULTRES and returns.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  mov CARG2d, LUA_MINSTACK\r\n  |  jmp >2\r\n  |\r\n  |->vm_growstack_v:\t\t\t// Grow stack for vararg Lua function.\r\n  |  sub RD, 8\r\n  |  jmp >1\r\n  |\r\n  |->vm_growstack_f:\t\t\t// Grow stack for fixarg Lua function.\r\n  |  // BASE = new base, RD = nargs+1, RB = L, PC = first PC\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |1:\r\n  |  movzx RAd, byte [PC-4+PC2PROTO(framesize)]\r\n  |  add PC, 4\t\t\t\t// Must point after first instruction.\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov SAVE_PC, PC\r\n  |  mov CARG2, RA\r\n  |2:\r\n  |  // RB = L, L->base = new base, L->top = top\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  mov LFUNC:RB, [BASE-16]\r\n  |  cleartp LFUNC:RB\r\n  |  sub RD, BASE\r\n  |  shr RDd, 3\r\n  |  add NARGS:RDd, 1\r\n  |  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |  mov L:RB, CARG1\t\t\t// Caveat: CARG1 may be RA.\r\n  |  mov SAVE_L, CARG1\r\n  |  mov RA, CARG2\r\n  |  mov PCd, FRAME_CP\r\n  |  xor RDd, RDd\r\n  |  lea KBASE, [esp+CFRAME_RESUME]\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov SAVE_PC, RD\t\t\t// Any value outside of bytecode is ok.\r\n  |  mov SAVE_CFRAME, RD\r\n  |  mov SAVE_NRES, RDd\r\n  |  mov SAVE_ERRF, RDd\r\n  |  mov L:RB->cframe, KBASE\r\n  |  cmp byte L:RB->status, RDL\r\n  |  je >2\t\t\t\t// Initial resume (like a call).\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |  mov byte L:RB->status, RDL\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr RDd, 3\r\n  |  add RDd, 1\t\t\t\t// RD = nresults+1\r\n  |  sub RA, BASE\t\t\t// RA = resultofs\r\n  |  mov PC, [BASE-8]\r\n  |  mov MULTRES, RDd\r\n  |  test PCd, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PCd, FRAME_CP\r\n  |  mov SAVE_ERRF, CARG4d\r\n  |  jmp >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PCd, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |  mov SAVE_NRES, CARG3d\r\n  |  mov L:RB, CARG1\t\t\t// Caveat: CARG1 may be RA.\r\n  |  mov SAVE_L, CARG1\r\n  |  mov RA, CARG2\r\n  |\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  mov KBASE, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASE\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov L:RB->cframe, rsp\r\n  |\r\n  |2:  // Entry point for vm_resume/vm_cpcall (RA = base, RB = L, PC = ftype).\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RB->base\t\t// BASE = old base (used in vmeta_call).\r\n  |  add PC, RA\r\n  |  sub PC, BASE\t\t\t// PC = frame delta + frame type\r\n  |\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr NARGS:RDd, 3\r\n  |  add NARGS:RDd, 1\t\t\t// RD = nargs+1\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  mov LFUNC:RB, [RA-16]\r\n  |  checkfunc LFUNC:RB, ->vmeta_call\t// Ensure KBASE defined and != BASE.\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  mov BASE, RA\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RD = nargs+1, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |  mov L:RB, CARG1\t\t\t// Caveat: CARG1 may be RA.\r\n  |  mov SAVE_L, CARG1\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |\r\n  |  mov KBASE, L:RB->stack\t\t// Compute -savestack(L, L->top).\r\n  |  sub KBASE, L:RB->top\r\n  |   mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  mov SAVE_ERRF, 0\t\t\t// No error function.\r\n  |  mov SAVE_NRES, KBASEd\t\t// Neg. delta means cframe w/o frame.\r\n  |   add DISPATCH, GG_G2DISP\r\n  |  // Handler may change cframe_nres(L->cframe) or cframe_errfunc(L->cframe).\r\n  |\r\n  |  mov KBASE, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASE\r\n  |  mov L:RB->cframe, rsp\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |\r\n  |  call CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |  // TValue * (new base) or NULL returned in eax (RC).\r\n  |  test RC, RC\r\n  |  jz ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |  mov RA, RC\r\n  |  mov PCd, FRAME_CP\r\n  |  jmp <2\t\t\t\t// Else continue with the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultofs, RD = nresults+1 (also in MULTRES)\r\n  |  add RA, BASE\r\n  |  and PC, -8\r\n  |  mov RB, BASE\r\n  |  sub BASE, PC\t\t\t// Restore caller BASE.\r\n  |  mov aword [RA+RD*8-8], LJ_TNIL\t// Ensure one valid arg.\r\n  |  mov RC, RA\t\t\t\t// ... in [RC]\r\n  |  mov PC, [RB-24]\t\t\t// Restore PC from [cont|PC].\r\n  |  mov RA, qword [RB-32]\t\t// May be negative on WIN64 with debug.\r\n  |.if FFI\r\n  |  cmp RA, 1\r\n  |  jbe >1\r\n  |.endif\r\n  |  mov LFUNC:KBASE, [BASE-16]\r\n  |  cleartp LFUNC:KBASE\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  // BASE = base, RC = result, RB = meta base\r\n  |  jmp RA\t\t\t\t// Jump to continuation.\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  je ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: Tail call from C function.\r\n  |  sub RB, BASE\r\n  |  shr RBd, 3\r\n  |  lea RDd, [RBd-3]\r\n  |  jmp ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// BASE = base, RC = result, RB = mbase\r\n  |  movzx RAd, PC_RB\r\n  |  sub RB, 32\r\n  |  lea RA, [BASE+RA*8]\r\n  |  sub RA, RB\r\n  |  je ->cont_ra\r\n  |  neg RA\r\n  |  shr RAd, 3\r\n  |.if X64WIN\r\n  |  mov CARG3d, RAd\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\r\n  |  mov RC, [RC]\r\n  |  mov [RB], RC\r\n  |  mov CARG2, RB\r\n  |.else\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\r\n  |  mov CARG3d, RAd\r\n  |  mov RA, [RC]\r\n  |  mov [RB], RA\r\n  |  mov CARG2, RB\r\n  |.endif\r\n  |  jmp ->BC_CAT_Z\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets:\r\n  |  settp STR:RC, LJ_TSTR\t\t// STR:RC = GCstr *\r\n  |  mov TMP1, STR:RC\r\n  |  lea RC, TMP1\r\n  |  cmp PC_OP, BC_GGET\r\n  |  jne >1\r\n  |  settp TAB:RA, TAB:RB, LJ_TTAB\t// TAB:RB = GCtab *\r\n  |  lea RB, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RB], TAB:RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tgetb:\r\n  |  movzx RCd, PC_RC\r\n  |.if DUALNUM\r\n  |  setint RC\r\n  |  mov TMP1, RC\r\n  |.else\r\n  |  cvtsi2sd xmm0, RCd\r\n  |  movsd TMP1, xmm0\r\n  |.endif\r\n  |  lea RC, TMP1\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  movzx RCd, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RBd, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\t\t// Caveat: CARG2/CARG3 may be BASE.\r\n  |  mov CARG2, RB\r\n  |  mov CARG3, RC\r\n  |  mov L:RB, L:CARG1\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |->cont_ra:\t\t\t\t// BASE = base, RC = result\r\n  |  movzx RAd, PC_RA\r\n  |  mov RB, [RC]\r\n  |  mov [BASE+RA*8], RB\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-24], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-16]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RDd, 2+1\t\t\t// 2 args for func(t, k).\r\n  |  cleartp LFUNC:RB\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  mov CARG1, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG2d, RCd\t\t\t// Caveat: CARG2 == BASE\r\n  |  call extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // cTValue * or NULL returned in eax (RC).\r\n  |  movzx RAd, PC_RA\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  test RC, RC\r\n  |  jnz ->BC_TGETR_Z\r\n  |  mov ITYPE, LJ_TNIL\r\n  |  jmp ->BC_TGETR2_Z\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets:\r\n  |  settp STR:RC, LJ_TSTR\t\t// STR:RC = GCstr *\r\n  |  mov TMP1, STR:RC\r\n  |  lea RC, TMP1\r\n  |  cmp PC_OP, BC_GSET\r\n  |  jne >1\r\n  |  settp TAB:RA, TAB:RB, LJ_TTAB\t// TAB:RB = GCtab *\r\n  |  lea RB, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RB], TAB:RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tsetb:\r\n  |  movzx RCd, PC_RC\r\n  |.if DUALNUM\r\n  |  setint RC\r\n  |  mov TMP1, RC\r\n  |.else\r\n  |  cvtsi2sd xmm0, RCd\r\n  |  movsd TMP1, xmm0\r\n  |.endif\r\n  |  lea RC, TMP1\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  movzx RCd, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RBd, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\t\t// Caveat: CARG2/CARG3 may be BASE.\r\n  |  mov CARG2, RB\r\n  |  mov CARG3, RC\r\n  |  mov L:RB, L:CARG1\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  movzx RAd, PC_RA\r\n  |  mov RB, [BASE+RA*8]\r\n  |  mov [RC], RB\r\n  |->cont_nop:\t\t\t\t// BASE = base, (RC = result)\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-24], PC\t\t\t// [cont|PC]\r\n  |  movzx RCd, PC_RA\r\n  |  // Copy value to third argument.\r\n  |  mov RB, [BASE+RC*8]\r\n  |  mov [RA+16], RB\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-16]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RDd, 3+1\t\t\t// 3 args for func(t, k, v).\r\n  |  cleartp LFUNC:RB\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tsetr:\r\n  |.if X64WIN\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov CARG3d, RCd\r\n  |  mov L:CARG1->base, BASE\r\n  |  xchg CARG2, TAB:RB\t\t\t// Caveat: CARG2 == BASE.\r\n  |.else\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov CARG2, TAB:RB\r\n  |  mov L:CARG1->base, BASE\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG3d, RCd\t\t\t// Caveat: CARG3 == BASE.\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |  // TValue * returned in eax (RC).\r\n  |  movzx RAd, PC_RA\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  jmp ->BC_TSETR_Z\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |  movzx RDd, PC_RD\r\n  |  movzx RAd, PC_RA\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2/CARG3 == BASE.\r\n  |.if X64WIN\r\n  |  lea CARG3, [BASE+RD*8]\r\n  |  lea CARG2, [BASE+RA*8]\r\n  |.else\r\n  |  lea CARG2, [BASE+RA*8]\r\n  |  lea CARG3, [BASE+RD*8]\r\n  |.endif\r\n  |  mov CARG1, L:RB\t\t\t// Caveat: CARG1/CARG4 == RA.\r\n  |  movzx CARG4d, PC_OP\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_comp\t// (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |  cmp RC, 1\r\n  |  ja ->vmeta_binop\r\n  |4:\r\n  |  lea PC, [PC+4]\r\n  |  jb >6\r\n  |5:\r\n  |  movzx RDd, PC_RD\r\n  |  branchPC RD\r\n  |6:\r\n  |  ins_next\r\n  |\r\n  |->cont_condt:\t\t\t// BASE = base, RC = result\r\n  |  add PC, 4\r\n  |  mov ITYPE, [RC]\r\n  |  sar ITYPE, 47\r\n  |  cmp ITYPEd, LJ_TISTRUECOND\t\t// Branch if result is true.\r\n  |  jb <5\r\n  |  jmp <6\r\n  |\r\n  |->cont_condf:\t\t\t// BASE = base, RC = result\r\n  |  mov ITYPE, [RC]\r\n  |  sar ITYPE, 47\r\n  |  cmp ITYPEd, LJ_TISTRUECOND\t\t// Branch if result is false.\r\n  |  jmp <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  cleartp TAB:RD\r\n  |  sub PC, 4\r\n  |.if X64WIN\r\n  |  mov CARG3, RD\r\n  |  mov CARG4d, RBd\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2 == BASE.\r\n  |  mov CARG2, RA\r\n  |  mov CARG1, L:RB\t\t\t// Caveat: CARG1 == RA.\r\n  |.else\r\n  |  mov CARG2, RA\r\n  |  mov CARG4d, RBd\t\t\t// Caveat: CARG4 == RA.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG3 == BASE.\r\n  |  mov CARG3, RD\r\n  |  mov CARG1, L:RB\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal\t// (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, 4\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG1, L:RB\r\n  |  mov CARG2d, dword [PC-4]\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal_cd\t// (lua_State *L, BCIns ins)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2/CARG3 may be BASE.\r\n  |  mov CARG2d, RAd\r\n  |  mov CARG3d, RDd\r\n  |  mov L:CARG1, L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <6\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vno:\r\n  |.if DUALNUM\r\n  |  movzx RBd, PC_RB\r\n  |  movzx RCd, PC_RC\r\n  |.endif\r\n  |->vmeta_arith_vn:\r\n  |  lea RC, [KBASE+RC*8]\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_arith_nvo:\r\n  |.if DUALNUM\r\n  |  movzx RBd, PC_RB\r\n  |  movzx RCd, PC_RC\r\n  |.endif\r\n  |->vmeta_arith_nv:\r\n  |  lea TMPR, [KBASE+RC*8]\r\n  |  lea RC, [BASE+RB*8]\r\n  |  mov RB, TMPR\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_unm:\r\n  |  lea RC, [BASE+RD*8]\r\n  |  mov RB, RC\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_arith_vvo:\r\n  |.if DUALNUM\r\n  |  movzx RBd, PC_RB\r\n  |  movzx RCd, PC_RC\r\n  |.endif\r\n  |->vmeta_arith_vv:\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |  lea RA, [BASE+RA*8]\r\n  |.if X64WIN\r\n  |  mov CARG3, RB\r\n  |  mov CARG4, RC\r\n  |  movzx RCd, PC_OP\r\n  |  mov ARG5d, RCd\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2 == BASE.\r\n  |  mov CARG2, RA\r\n  |  mov CARG1, L:RB\t\t\t// Caveat: CARG1 == RA.\r\n  |.else\r\n  |  movzx CARG5d, PC_OP\r\n  |  mov CARG2, RA\r\n  |  mov CARG4, RC\t\t\t// Caveat: CARG4 == RA.\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\t\t// Caveat: CARG3 == BASE.\r\n  |  mov CARG3, RB\r\n  |  mov L:RB, L:CARG1\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_arith\t// (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = base, RC = new base, stack = cont/func/o1/o2\r\n  |  mov RA, RC\r\n  |  sub RC, BASE\r\n  |  mov [RA-24], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RC+FRAME_CONT]\r\n  |  mov NARGS:RDd, 2+1\t\t\t// 2 args for func(o1, o2).\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  movzx RDd, PC_RD\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  lea CARG2, [BASE+RD*8]\t\t// Caveat: CARG2 == BASE\r\n  |  mov L:CARG1, L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_len\t\t// (lua_State *L, TValue *o)\r\n  |  // NULL (retry) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n#if LJ_52\r\n  |  test RC, RC\r\n  |  jne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  movzx RDd, PC_RD\r\n  |  mov TAB:CARG1, [BASE+RD*8]\r\n  |  cleartp TAB:CARG1\r\n  |  jmp ->BC_LEN_Z\r\n#else\r\n  |  jmp ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call_ra:\r\n  |  lea RA, [BASE+RA*8+16]\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // BASE = old base, RA = new base, RC = nargs+1, PC = return\r\n  |  mov TMP1d, NARGS:RDd\t\t// Save RA, RC for us.\r\n  |  mov RB, RA\r\n  |.if X64WIN\r\n  |  mov L:TMPR, SAVE_L\r\n  |  mov L:TMPR->base, BASE\t\t// Caveat: CARG2 is BASE.\r\n  |  lea CARG2, [RA-16]\r\n  |  lea CARG3, [RA+NARGS:RD*8-8]\r\n  |  mov CARG1, L:TMPR\t\t\t// Caveat: CARG1 is RA.\r\n  |.else\r\n  |  mov L:CARG1, SAVE_L\r\n  |  mov L:CARG1->base, BASE\t\t// Caveat: CARG3 is BASE.\r\n  |  lea CARG2, [RA-16]\r\n  |  lea CARG3, [RA+NARGS:RD*8-8]\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  mov RA, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov BASE, L:RB->base\r\n  |  mov NARGS:RDd, TMP1d\r\n  |  mov LFUNC:RB, [RA-16]\r\n  |  cleartp LFUNC:RB\r\n  |  add NARGS:RDd, 1\r\n  |  // This is fragile. L->base must not move, KBASE must always be defined.\r\n  |  cmp KBASE, BASE\t\t\t// Continue with CALLT if flag set.\r\n  |  je ->BC_CALLT_Z\r\n  |  mov BASE, RA\r\n  |  ins_call\t\t\t\t// Otherwise call resolved metamethod.\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG2, RA\t\t\t// Caveat: CARG2 == BASE\r\n  |  mov L:CARG1, L:RB\t\t\t// Caveat: CARG1 == RA\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_for\t// (lua_State *L, TValue *base)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RCd, [PC-4]\r\n  |  movzx RAd, RCH\r\n  |  movzx OP, RCL\r\n  |  shr RCd, 16\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Retry FORI or JFORI.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RDd, 1+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RDd, 2+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name, op\r\n  |  .ffunc_1 name\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  op xmm0, qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_n, name\r\n  |  .ffunc_n name, movsd\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nn, name\r\n  |  .ffunc_2 name\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  checknumtp [BASE+8], ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |  movsd xmm1, qword [BASE+8]\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses label 1.\r\n  |.macro ffgccheck\r\n  |  mov RB, [DISPATCH+DISPATCH_GL(gc.total)]\r\n  |  cmp RB, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n  |  jb >1\r\n  |  call ->fff_gcstep\r\n  |1:\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  mov ITYPE, [BASE]\r\n  |  mov RB, ITYPE\r\n  |  sar ITYPE, 47\r\n  |  cmp ITYPEd, LJ_TISTRUECOND; jae ->fff_fallback\r\n  |  mov PC, [BASE-8]\r\n  |  mov MULTRES, RDd\r\n  |  mov RB, [BASE]\r\n  |  mov [BASE-16], RB\r\n  |  sub RDd, 2\r\n  |  jz >2\r\n  |  mov RA, BASE\r\n  |1:\r\n  |  add RA, 8\r\n  |  mov RB, [RA]\r\n  |  mov [RA-16], RB\r\n  |  sub RDd, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov RDd, MULTRES\r\n  |  jmp ->fff_res_\r\n  |\r\n  |.ffunc_1 type\r\n  |  mov RC, [BASE]\r\n  |  sar RC, 47\r\n  |  mov RBd, LJ_TISNUM\r\n  |  cmp RCd, RBd\r\n  |  cmovb RCd, RBd\r\n  |  not RCd\r\n  |2:\r\n  |  mov CFUNC:RB, [BASE-16]\r\n  |  cleartp CFUNC:RB\r\n  |  mov STR:RC, [CFUNC:RB+RC*8+((char *)(&((GCfuncC *)0)->upvalue))]\r\n  |  mov PC, [BASE-8]\r\n  |  settp STR:RC, LJ_TSTR\r\n  |  mov [BASE-16], STR:RC\r\n  |  jmp ->fff_res1\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov PC, [BASE-8]\r\n  |  checktab TAB:RB, >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  mov TAB:RB, TAB:RB->metatable\r\n  |2:\r\n  |  test TAB:RB, TAB:RB\r\n  |  mov aword [BASE-16], LJ_TNIL\r\n  |  jz ->fff_res1\r\n  |  settp TAB:RC, TAB:RB, LJ_TTAB\r\n  |  mov [BASE-16], TAB:RC\t\t// Store metatable as default result.\r\n  |  mov STR:RC, [DISPATCH+DISPATCH_GL(gcroot)+8*(GCROOT_MMNAME+MM_metatable)]\r\n  |  mov RAd, TAB:RB->hmask\r\n  |  and RAd, STR:RC->hash\r\n  |  settp STR:RC, LJ_TSTR\r\n  |  imul RAd, #NODE\r\n  |  add NODE:RA, TAB:RB->node\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  cmp NODE:RA->key, STR:RC\r\n  |  je >5\r\n  |4:\r\n  |  mov NODE:RA, NODE:RA->next\r\n  |  test NODE:RA, NODE:RA\r\n  |  jnz <3\r\n  |  jmp ->fff_res1\t\t\t// Not found, keep default result.\r\n  |5:\r\n  |  mov RB, NODE:RA->val\r\n  |  cmp RB, LJ_TNIL; je ->fff_res1\t// Ditto for nil value.\r\n  |  mov [BASE-16], RB\t\t\t// Return value of mt.__metatable.\r\n  |  jmp ->fff_res1\r\n  |\r\n  |6:\r\n  |  cmp ITYPEd, LJ_TUDATA; je <1\r\n  |  cmp ITYPEd, LJ_TISNUM; ja >7\r\n  |  mov ITYPEd, LJ_TISNUM\r\n  |7:\r\n  |  not ITYPEd\r\n  |  mov TAB:RB, [DISPATCH+ITYPE*8+DISPATCH_GL(gcroot[GCROOT_BASEMT])]\r\n  |  jmp <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov TAB:TMPR, TAB:RB\r\n  |  checktab TAB:RB, ->fff_fallback\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  cmp aword TAB:RB->metatable, 0; jne ->fff_fallback\r\n  |  mov TAB:RA, [BASE+8]\r\n  |  checktab TAB:RA, ->fff_fallback\r\n  |  mov TAB:RB->metatable, TAB:RA\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], TAB:TMPR\t\t\t// Return original table.\r\n  |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n  |  jz >1\r\n  |  // Possible write barrier. Table is black, but skip iswhite(mt) check.\r\n  |  barrierback TAB:RB, RC\r\n  |1:\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_2 rawget\r\n  |.if X64WIN\r\n  |  mov TAB:RA, [BASE]\r\n  |  checktab TAB:RA, ->fff_fallback\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  lea CARG3, [BASE+8]\r\n  |  mov CARG2, TAB:RA\t\t\t// Caveat: CARG2 == BASE.\r\n  |  mov CARG1, SAVE_L\r\n  |.else\r\n  |  mov TAB:CARG2, [BASE]\r\n  |  checktab TAB:CARG2, ->fff_fallback\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  lea CARG3, [BASE+8]\t\t// Caveat: CARG3 == BASE.\r\n  |  mov CARG1, SAVE_L\r\n  |.endif\r\n  |  call extern lj_tab_get\t// (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // cTValue * returned in eax (RD).\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  // Copy table slot.\r\n  |  mov RB, [RD]\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], RB\r\n  |  jmp ->fff_res1\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmp NARGS:RDd, 1+1;  jne ->fff_fallback\t// Exactly one argument.\r\n  |  mov RB, [BASE]\r\n  |  checknumber RB, ->fff_fallback\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], RB\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  mov PC, [BASE-8]\r\n  |  mov STR:RB, [BASE]\r\n  |  checktp_nc STR:RB, LJ_TSTR, >3\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |2:\r\n  |  mov [BASE-16], STR:RB\r\n  |  jmp ->fff_res1\r\n  |3:  // Handle numbers inline, unless a number base metatable is present.\r\n  |  cmp ITYPEd, LJ_TISNUM;  ja ->fff_fallback_1\r\n  |  cmp aword [DISPATCH+DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])], 0\r\n  |  jne ->fff_fallback\r\n  |  ffgccheck\t\t\t\t// Caveat: uses label 1.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |.if not X64WIN\r\n  |  mov CARG2, BASE\t\t\t// Otherwise: CARG2 == BASE\r\n  |.endif\r\n  |  mov L:CARG1, L:RB\r\n  |.if DUALNUM\r\n  |  call extern lj_strfmt_number\t// (lua_State *L, cTValue *o)\r\n  |.else\r\n  |  call extern lj_strfmt_num\t\t// (lua_State *L, lua_Number *np)\r\n  |.endif\r\n  |  // GCstr returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  settp STR:RB, RD, LJ_TSTR\r\n  |  jmp <2\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |  je >2\t\t\t\t// Missing 2nd arg?\r\n  |1:\r\n  |.if X64WIN\r\n  |  mov RA, [BASE]\r\n  |  checktab RA, ->fff_fallback\r\n  |.else\r\n  |  mov CARG2, [BASE]\r\n  |  checktab CARG2, ->fff_fallback\r\n  |.endif\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov L:RB->top, BASE\t\t// Dummy frame length is ok.\r\n  |  mov PC, [BASE-8]\r\n  |.if X64WIN\r\n  |  lea CARG3, [BASE+8]\r\n  |  mov CARG2, RA\t\t\t// Caveat: CARG2 == BASE.\r\n  |  mov CARG1, L:RB\r\n  |.else\r\n  |  lea CARG3, [BASE+8]\t\t// Caveat: CARG3 == BASE.\r\n  |  mov CARG1, L:RB\r\n  |.endif\r\n  |  mov SAVE_PC, PC\t\t\t// Needed for ITERN fallback.\r\n  |  call extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Flag returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  test RDd, RDd;  jz >3\t\t// End of traversal?\r\n  |  // Copy key and value to results.\r\n  |  mov RB, [BASE+8]\r\n  |  mov RD, [BASE+16]\r\n  |  mov [BASE-16], RB\r\n  |  mov [BASE-8], RD\r\n  |->fff_res2:\r\n  |  mov RDd, 1+2\r\n  |  jmp ->fff_res\r\n  |2:  // Set missing 2nd arg to nil.\r\n  |  mov aword [BASE+8], LJ_TNIL\r\n  |  jmp <1\r\n  |3:  // End of traversal: return nil.\r\n  |  mov aword [BASE-16], LJ_TNIL\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov TMPR, TAB:RB\r\n  |  checktab TAB:RB, ->fff_fallback\r\n#if LJ_52\r\n  |  cmp aword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RD, [BASE-16]\r\n  |  cleartp CFUNC:RD\r\n  |  mov CFUNC:RD, CFUNC:RD->upvalue[0]\r\n  |  settp CFUNC:RD, LJ_TFUNC\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], CFUNC:RD\r\n  |  mov [BASE-8], TMPR\r\n  |  mov aword [BASE], LJ_TNIL\r\n  |  mov RDd, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  mov TAB:RB, [BASE]\r\n  |  checktab TAB:RB, ->fff_fallback\r\n  |.if DUALNUM\r\n  |  mov RA, [BASE+8]\r\n  |  checkint RA, ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE+8], ->fff_fallback\r\n  |  movsd xmm0, qword [BASE+8]\r\n  |.endif\r\n  |  mov PC, [BASE-8]\r\n  |.if DUALNUM\r\n  |  add RAd, 1\r\n  |  setint ITYPE, RA\r\n  |  mov [BASE-16], ITYPE\r\n  |.else\r\n  |  sseconst_1 xmm1, TMPR\r\n  |  addsd xmm0, xmm1\r\n  |  cvttsd2si RAd, xmm0\r\n  |  movsd qword [BASE-16], xmm0\r\n  |.endif\r\n  |  cmp RAd, TAB:RB->asize;  jae >2\t// Not in array part?\r\n  |  mov RD, TAB:RB->array\r\n  |  lea RD, [RD+RA*8]\r\n  |1:\r\n  |  cmp aword [RD], LJ_TNIL;  je ->fff_res0\r\n  |  // Copy array slot.\r\n  |  mov RB, [RD]\r\n  |  mov [BASE-8], RB\r\n  |  jmp ->fff_res2\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  cmp dword TAB:RB->hmask, 0; je ->fff_res0\r\n  |.if X64WIN\r\n  |  mov TMPR, BASE\r\n  |  mov CARG2d, RAd\r\n  |  mov CARG1, TAB:RB\r\n  |  mov RB, TMPR\r\n  |.else\r\n  |  mov CARG1, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG2d, RAd\t\t\t// Caveat: CARG2 == BASE\r\n  |.endif\r\n  |  call extern lj_tab_getinth\t\t// (GCtab *t, int32_t key)\r\n  |  // cTValue * or NULL returned in eax (RD).\r\n  |  mov BASE, RB\r\n  |  test RD, RD\r\n  |  jnz <1\r\n  |->fff_res0:\r\n  |  mov RDd, 1+0\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov TMPR, TAB:RB\r\n  |  checktab TAB:RB, ->fff_fallback\r\n#if LJ_52\r\n  |  cmp aword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RD, [BASE-16]\r\n  |  cleartp CFUNC:RD\r\n  |  mov CFUNC:RD, CFUNC:RD->upvalue[0]\r\n  |  settp CFUNC:RD, LJ_TFUNC\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], CFUNC:RD\r\n  |  mov [BASE-8], TMPR\r\n  |.if DUALNUM\r\n  |  mov64 RD, ((int64_t)LJ_TISNUM<<47)\r\n  |  mov [BASE], RD\r\n  |.else\r\n  |  mov qword [BASE], 0\r\n  |.endif\r\n  |  mov RDd, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc_1 pcall\r\n  |  lea RA, [BASE+16]\r\n  |  sub NARGS:RDd, 1\r\n  |  mov PCd, 16+FRAME_PCALL\r\n  |1:\r\n  |  movzx RBd, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  shr RB, HOOK_ACTIVE_SHIFT\r\n  |  and RB, 1\r\n  |  add PC, RB\t\t\t\t// Remember active hook before pcall.\r\n  |  // Note: this does a (harmless) copy of the function to the PC slot, too.\r\n  |  mov KBASE, RD\r\n  |2:\r\n  |  mov RB, [RA+KBASE*8-24]\r\n  |  mov [RA+KBASE*8-16], RB\r\n  |  sub KBASE, 1\r\n  |  ja <2\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  mov LFUNC:RA, [BASE+8]\r\n  |  checktp_nc LFUNC:RA, LJ_TFUNC, ->fff_fallback\r\n  |  mov LFUNC:RB, [BASE]\t\t// Swap function and traceback.\r\n  |  mov [BASE], LFUNC:RA\r\n  |  mov [BASE+8], LFUNC:RB\r\n  |  lea RA, [BASE+24]\r\n  |  sub NARGS:RDd, 2\r\n  |  mov PCd, 24+FRAME_PCALL\r\n  |  jmp <1\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  mov L:RB, [BASE]\r\n  |  cleartp L:RB\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  mov CFUNC:RB, [BASE-16]\r\n  |  cleartp CFUNC:RB\r\n  |  mov L:RB, CFUNC:RB->upvalue[0].gcr\r\n  |  cleartp L:RB\r\n  |.endif\r\n  |  mov PC, [BASE-8]\r\n  |  mov SAVE_PC, PC\r\n  |  mov TMP1, L:RB\r\n  |.if resume\r\n  |  checktptp [BASE], LJ_TTHREAD, ->fff_fallback\r\n  |.endif\r\n  |  cmp aword L:RB->cframe, 0; jne ->fff_fallback\r\n  |  cmp byte L:RB->status, LUA_YIELD;  ja ->fff_fallback\r\n  |  mov RA, L:RB->top\r\n  |  je >1\t\t\t\t// Status != LUA_YIELD (i.e. 0)?\r\n  |  cmp RA, L:RB->base\t\t\t// Check for presence of initial func.\r\n  |  je ->fff_fallback\r\n  |  mov PC, [RA-8]\t\t\t// Move initial function up.\r\n  |  mov [RA], PC\r\n  |  add RA, 8\r\n  |1:\r\n  |.if resume\r\n  |  lea PC, [RA+NARGS:RD*8-16]\t\t// Check stack space (-1-thread).\r\n  |.else\r\n  |  lea PC, [RA+NARGS:RD*8-8]\t\t// Check stack space (-1).\r\n  |.endif\r\n  |  cmp PC, L:RB->maxstack; ja ->fff_fallback\r\n  |  mov L:RB->top, PC\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |.if resume\r\n  |  add BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |.endif\r\n  |  mov L:RB->top, BASE\r\n  |.if resume\r\n  |  lea RB, [BASE+NARGS:RD*8-24]\t// RB = end of source for stack move.\r\n  |.else\r\n  |  lea RB, [BASE+NARGS:RD*8-16]\t// RB = end of source for stack move.\r\n  |.endif\r\n  |  sub RB, PC\t\t\t// Relative to PC.\r\n  |\r\n  |  cmp PC, RA\r\n  |  je >3\r\n  |2:  // Move args to coroutine.\r\n  |  mov RC, [PC+RB]\r\n  |  mov [PC-8], RC\r\n  |  sub PC, 8\r\n  |  cmp PC, RA\r\n  |  jne <2\r\n  |3:\r\n  |  mov CARG2, RA\r\n  |  mov CARG1, TMP1\r\n  |  call ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:PC, TMP1\r\n  |  mov BASE, L:RB->base\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |\r\n  |  cmp eax, LUA_YIELD\r\n  |  ja >8\r\n  |4:\r\n  |  mov RA, L:PC->base\r\n  |  mov KBASE, L:PC->top\r\n  |  mov L:PC->top, RA\t\t\t// Clear coroutine stack.\r\n  |  mov PC, KBASE\r\n  |  sub PC, RA\r\n  |  je >6\t\t\t\t// No results?\r\n  |  lea RD, [BASE+PC]\r\n  |  shr PCd, 3\r\n  |  cmp RD, L:RB->maxstack\r\n  |  ja >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  mov RB, BASE\r\n  |  sub RB, RA\r\n  |5:  // Move results from coroutine.\r\n  |  mov RD, [RA]\r\n  |  mov [RA+RB], RD\r\n  |  add RA, 8\r\n  |  cmp RA, KBASE\r\n  |  jne <5\r\n  |6:\r\n  |.if resume\r\n  |  lea RDd, [PCd+2]\t\t\t// nresults+1 = 1 + true + results.\r\n  |  mov_true ITYPE\t\t\t// Prepend true to results.\r\n  |  mov [BASE-8], ITYPE\r\n  |.else\r\n  |  lea RDd, [PCd+1]\t\t\t// nresults+1 = 1 + results.\r\n  |.endif\r\n  |7:\r\n  |  mov PC, SAVE_PC\r\n  |  mov MULTRES, RDd\r\n  |.if resume\r\n  |  mov RA, -8\r\n  |.else\r\n  |  xor RAd, RAd\r\n  |.endif\r\n  |  test PCd, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  mov_false ITYPE\t\t\t// Prepend false to results.\r\n  |  mov [BASE-8], ITYPE\r\n  |  mov RA, L:PC->top\r\n  |  sub RA, 8\r\n  |  mov L:PC->top, RA\t\t\t// Clear error from coroutine stack.\r\n  |  // Copy error message.\r\n  |  mov RD, [RA]\r\n  |  mov [BASE], RD\r\n  |  mov RDd, 1+2\t\t\t// nresults+1 = 1 + false + error.\r\n  |  jmp <7\r\n  |.else\r\n  |  mov CARG2, L:PC\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_ffh_coroutine_wrap_err  // (lua_State *L, lua_State *co)\r\n  |  // Error function does not return.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |  mov L:RA, TMP1\r\n  |  mov L:RA->top, KBASE\t\t// Undo coroutine stack clearing.\r\n  |  mov CARG2, PC\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov L:PC, TMP1\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <4\t\t\t\t// Retry the stack move.\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  mov L:RB, SAVE_L\r\n  |  test aword L:RB->cframe, CFRAME_RESUME\r\n  |  jz ->fff_fallback\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB->top, RD\r\n  |  xor RDd, RDd\r\n  |  mov aword L:RB->cframe, RD\r\n  |  mov al, LUA_YIELD\r\n  |  mov byte L:RB->status, al\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |  .ffunc_1 math_abs\r\n  |  mov RB, [BASE]\r\n  |.if DUALNUM\r\n  |  checkint RB, >3\r\n  |  cmp RBd, 0; jns ->fff_resi\r\n  |  neg RBd; js >2\r\n  |->fff_resbit:\r\n  |->fff_resi:\r\n  |  setint RB\r\n  |->fff_resRB:\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], RB\r\n  |  jmp ->fff_res1\r\n  |2:\r\n  |  mov64 RB, U64x(41e00000,00000000)  // 2^31.\r\n  |  jmp ->fff_resRB\r\n  |3:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  checknum RB, ->fff_fallback\r\n  |.endif\r\n  |  shl RB, 1\r\n  |  shr RB, 1\r\n  |  mov PC, [BASE-8]\r\n  |  mov [BASE-16], RB\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_n math_sqrt, sqrtsd\r\n  |->fff_resxmm0:\r\n  |  mov PC, [BASE-8]\r\n  |  movsd qword [BASE-16], xmm0\r\n  |  // fallthrough\r\n  |\r\n  |->fff_res1:\r\n  |  mov RDd, 1+1\r\n  |->fff_res:\r\n  |  mov MULTRES, RDd\r\n  |->fff_res_:\r\n  |  test PCd, FRAME_TYPE\r\n  |  jnz >7\r\n  |5:\r\n  |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n  |  ja >6\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  movzx RAd, PC_RA\r\n  |  neg RA\r\n  |  lea BASE, [BASE+RA*8-16]\t\t// base = base - (RA+2)*8\r\n  |  ins_next\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  mov aword [BASE+RD*8-24], LJ_TNIL\r\n  |  add RD, 1\r\n  |  jmp <5\r\n  |\r\n  |7:  // Non-standard return case.\r\n  |  mov RA, -16\t\t\t// Results start at BASE+RA = BASE-16.\r\n  |  jmp ->vm_return\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc math_ .. func\r\n  |.if DUALNUM\r\n  |  mov RB, [BASE]\r\n  |  checknumx RB, ->fff_resRB, je\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |.endif\r\n  |  movsd xmm0, qword [BASE]\r\n  |  call ->vm_ .. func .. _sse\r\n  |.if DUALNUM\r\n  |  cvttsd2si RBd, xmm0\r\n  |  cmp RBd, 0x80000000\r\n  |  jne ->fff_resi\r\n  |  cvtsi2sd xmm1, RBd\r\n  |  ucomisd xmm0, xmm1\r\n  |  jp ->fff_resxmm0\r\n  |  je ->fff_resi\r\n  |.endif\r\n  |  jmp ->fff_resxmm0\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.ffunc math_log\r\n  |  cmp NARGS:RDd, 1+1; jne ->fff_fallback\t// Exactly one argument.\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |  mov RB, BASE\r\n  |  call extern log\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resxmm0\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc_n math_ .. func\r\n  |  mov RB, BASE\r\n  |  call extern func\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resxmm0\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nn math_ .. func\r\n  |  mov RB, BASE\r\n  |  call extern func\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resxmm0\r\n  |.endmacro\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.ffunc_2 math_ldexp\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  checknumtp [BASE+8], ->fff_fallback\r\n  |  fld qword [BASE+8]\r\n  |  fld qword [BASE]\r\n  |  fscale\r\n  |  fpop1\r\n  |  mov PC, [BASE-8]\r\n  |  fstp qword [BASE-16]\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_n math_frexp\r\n  |  lea CARG1, TMP1\r\n  |  mov RB, BASE\r\n  |  call extern frexp\r\n  |  mov BASE, RB\r\n  |  mov RBd, TMP1d\r\n  |  mov PC, [BASE-8]\r\n  |  movsd qword [BASE-16], xmm0\r\n  |.if DUALNUM\r\n  |  setint RB\r\n  |  mov [BASE-8], RB\r\n  |.else\r\n  |  cvtsi2sd xmm1, RBd\r\n  |  movsd qword [BASE-8], xmm1\r\n  |.endif\r\n  |  mov RDd, 1+2\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_n math_modf\r\n  |  lea CARG1, [BASE-16]\r\n  |  mov PC, [BASE-8]\r\n  |  mov RB, BASE\r\n  |  call extern modf\r\n  |  mov BASE, RB\r\n  |  mov PC, [BASE-8]\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  mov RDd, 1+2\r\n  |  jmp ->fff_res\r\n  |\r\n  |.macro math_minmax, name, cmovop, sseop\r\n  |  .ffunc name\r\n  |  mov RAd, 2\r\n  |.if DUALNUM\r\n  |  mov RB, [BASE]\r\n  |  checkint RB, >4\r\n  |1:  // Handle integers.\r\n  |  cmp RAd, RDd; jae ->fff_resRB\r\n  |  mov TMPR, [BASE+RA*8-8]\r\n  |  checkint TMPR, >3\r\n  |  cmp RBd, TMPRd\r\n  |  cmovop RB, TMPR\r\n  |  add RAd, 1\r\n  |  jmp <1\r\n  |3:\r\n  |  ja ->fff_fallback\r\n  |  // Convert intermediate result to number and continue below.\r\n  |  cvtsi2sd xmm0, RBd\r\n  |  jmp >6\r\n  |4:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |.endif\r\n  |\r\n  |  movsd xmm0, qword [BASE]\r\n  |5:  // Handle numbers or integers.\r\n  |  cmp RAd, RDd; jae ->fff_resxmm0\r\n  |.if DUALNUM\r\n  |  mov RB, [BASE+RA*8-8]\r\n  |  checknumx RB, >6, jb\r\n  |  ja ->fff_fallback\r\n  |  cvtsi2sd xmm1, RBd\r\n  |  jmp >7\r\n  |.else\r\n  |  checknumtp [BASE+RA*8-8], ->fff_fallback\r\n  |.endif\r\n  |6:\r\n  |  movsd xmm1, qword [BASE+RA*8-8]\r\n  |7:\r\n  |  sseop xmm0, xmm1\r\n  |  add RAd, 1\r\n  |  jmp <5\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, cmovg, minsd\r\n  |  math_minmax math_max, cmovl, maxsd\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmp NARGS:RDd, 1+1;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |  checkstr STR:RB, ->fff_fallback\r\n  |  mov PC, [BASE-8]\r\n  |  cmp dword STR:RB->len, 1\r\n  |  jb ->fff_res0\t\t\t// Return no results for empty string.\r\n  |  movzx RBd, byte STR:RB[1]\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resi\r\n  |.else\r\n  |  cvtsi2sd xmm0, RBd; jmp ->fff_resxmm0\r\n  |.endif\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmp NARGS:RDd, 1+1;  jne ->fff_fallback\t// *Exactly* 1 arg.\r\n  |.if DUALNUM\r\n  |  mov RB, [BASE]\r\n  |  checkint RB, ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  cvttsd2si RBd, qword [BASE]\r\n  |.endif\r\n  |  cmp RBd, 255;  ja ->fff_fallback\r\n  |  mov TMP1d, RBd\r\n  |  mov TMPRd, 1\r\n  |  lea RD, TMP1\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG3d, TMPRd\t\t\t// Zero-extended to size_t.\r\n  |  mov CARG2, RD\r\n  |  mov CARG1, L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |->fff_resstr:\r\n  |  // GCstr * returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [BASE-8]\r\n  |  settp STR:RD, LJ_TSTR\r\n  |  mov [BASE-16], STR:RD\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  mov TMPRd, -1\r\n  |  cmp NARGS:RDd, 1+2;  jb ->fff_fallback\r\n  |  jna >1\r\n  |.if DUALNUM\r\n  |  mov TMPR, [BASE+16]\r\n  |  checkint TMPR, ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE+16], ->fff_fallback\r\n  |  cvttsd2si TMPRd, qword [BASE+16]\r\n  |.endif\r\n  |1:\r\n  |  mov STR:RB, [BASE]\r\n  |  checkstr STR:RB, ->fff_fallback\r\n  |.if DUALNUM\r\n  |  mov ITYPE, [BASE+8]\r\n  |  mov RAd, ITYPEd\t\t\t// Must clear hiword for lea below.\r\n  |  sar ITYPE, 47\r\n  |  cmp ITYPEd, LJ_TISNUM\r\n  |  jne ->fff_fallback\r\n  |.else\r\n  |  checknumtp [BASE+8], ->fff_fallback\r\n  |  cvttsd2si RAd, qword [BASE+8]\r\n  |.endif\r\n  |  mov RCd, STR:RB->len\r\n  |  cmp RCd, TMPRd\t\t\t// len < end? (unsigned compare)\r\n  |  jb >5\r\n  |2:\r\n  |  test RAd, RAd\t\t\t// start <= 0?\r\n  |  jle >7\r\n  |3:\r\n  |  sub TMPRd, RAd\t\t\t// start > end?\r\n  |  jl ->fff_emptystr\r\n  |  lea RD, [STR:RB+RAd+#STR-1]\r\n  |  add TMPRd, 1\r\n  |4:\r\n  |  jmp ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  jl >6\r\n  |  lea TMPRd, [TMPRd+RCd+1]\t\t// end = end+(len+1)\r\n  |  jmp <2\r\n  |6:  // Overflow.\r\n  |  mov TMPRd, RCd\t\t\t// end = len\r\n  |  jmp <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |  je >8\r\n  |  add RAd, RCd\t\t\t// start = start+(len+1)\r\n  |  add RAd, 1\r\n  |  jg <3\t\t\t\t// start > 0?\r\n  |8:  // Underflow.\r\n  |  mov RAd, 1\t\t\t\t// start = 1\r\n  |  jmp <3\r\n  |\r\n  |->fff_emptystr:  // Range underflow.\r\n  |  xor TMPRd, TMPRd\t\t\t// Zero length. Any ptr in RD is ok.\r\n  |  jmp <4\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc_1 string_ .. name\r\n  |  ffgccheck\r\n  |.if X64WIN\r\n  |  mov STR:TMPR, [BASE]\r\n  |  checkstr STR:TMPR, ->fff_fallback\r\n  |.else\r\n  |  mov STR:CARG2, [BASE]\r\n  |  checkstr STR:CARG2, ->fff_fallback\r\n  |.endif\r\n  |  mov L:RB, SAVE_L\r\n  |   lea SBUF:CARG1, [DISPATCH+DISPATCH_GL(tmpbuf)]\r\n  |  mov L:RB->base, BASE\r\n  |.if X64WIN\r\n  |  mov STR:CARG2, STR:TMPR\t\t// Caveat: CARG2 == BASE\r\n  |.endif\r\n  |   mov RC, SBUF:CARG1->b\r\n  |   mov SBUF:CARG1->L, L:RB\r\n  |   mov SBUF:CARG1->p, RC\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_buf_putstr_ .. name\r\n  |  mov CARG1, rax\r\n  |  call extern lj_buf_tostr\r\n  |  jmp ->fff_resstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name, kind, fdef\r\n  |  fdef name\r\n  |.if kind == 2\r\n  |  sseconst_tobit xmm1, RB\r\n  |.endif\r\n  |.if DUALNUM\r\n  |  mov RB, [BASE]\r\n  |  checkint RB, >1\r\n  |.if kind > 0\r\n  |  jmp >2\r\n  |.else\r\n  |  jmp ->fff_resbit\r\n  |.endif\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |  movd xmm0, RB\r\n  |.else\r\n  |  checknumtp [BASE], ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |.endif\r\n  |.if kind < 2\r\n  |  sseconst_tobit xmm1, RB\r\n  |.endif\r\n  |  addsd xmm0, xmm1\r\n  |  movd RBd, xmm0\r\n  |2:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit, name, kind\r\n  |  .ffunc_bit name, kind, .ffunc_1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit bit_tobit, 0\r\n  |  jmp ->fff_resbit\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name, 2\r\n  |  mov TMPRd, NARGS:RDd\t\t// Save for fallback.\r\n  |  lea RD, [BASE+NARGS:RD*8-16]\r\n  |1:\r\n  |  cmp RD, BASE\r\n  |  jbe ->fff_resbit\r\n  |.if DUALNUM\r\n  |  mov RA, [RD]\r\n  |  checkint RA, >2\r\n  |  ins RBd, RAd\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |2:\r\n  |  ja ->fff_fallback_bit_op\r\n  |  movd xmm0, RA\r\n  |.else\r\n  |  checknumtp [RD], ->fff_fallback_bit_op\r\n  |  movsd xmm0, qword [RD]\r\n  |.endif\r\n  |  addsd xmm0, xmm1\r\n  |  movd RAd, xmm0\r\n  |  ins RBd, RAd\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op bit_band, and\r\n  |.ffunc_bit_op bit_bor, or\r\n  |.ffunc_bit_op bit_bxor, xor\r\n  |\r\n  |.ffunc_bit bit_bswap, 1\r\n  |  bswap RBd\r\n  |  jmp ->fff_resbit\r\n  |\r\n  |.ffunc_bit bit_bnot, 1\r\n  |  not RBd\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resbit\r\n  |.else\r\n  |->fff_resbit:\r\n  |  cvtsi2sd xmm0, RBd\r\n  |  jmp ->fff_resxmm0\r\n  |.endif\r\n  |\r\n  |->fff_fallback_bit_op:\r\n  |  mov NARGS:RDd, TMPRd\t\t// Restore for fallback\r\n  |  jmp ->fff_fallback\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins\r\n  |.if DUALNUM\r\n  |  .ffunc_bit name, 1, .ffunc_2\r\n  |  // Note: no inline conversion from number for 2nd argument!\r\n  |  mov RA, [BASE+8]\r\n  |  checkint RA, ->fff_fallback\r\n  |.else\r\n  |  .ffunc_nn name\r\n  |  sseconst_tobit xmm2, RB\r\n  |  addsd xmm0, xmm2\r\n  |  addsd xmm1, xmm2\r\n  |  movd RBd, xmm0\r\n  |  movd RAd, xmm1\r\n  |.endif\r\n  |  ins RBd, cl\t\t\t// Assumes RA is ecx.\r\n  |  jmp ->fff_resbit\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh bit_lshift, shl\r\n  |.ffunc_bit_sh bit_rshift, shr\r\n  |.ffunc_bit_sh bit_arshift, sar\r\n  |.ffunc_bit_sh bit_rol, rol\r\n  |.ffunc_bit_sh bit_ror, ror\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback_2:\r\n  |  mov NARGS:RDd, 1+2\t\t\t// Other args are ignored, anyway.\r\n  |  jmp ->fff_fallback\r\n  |->fff_fallback_1:\r\n  |  mov NARGS:RDd, 1+1\t\t\t// Other args are ignored, anyway.\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  mov L:RB, SAVE_L\r\n  |  mov PC, [BASE-8]\t\t\t// Fallback may overwrite PC.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  lea RA, [RD+8*LUA_MINSTACK]\t// Ensure enough space for handler.\r\n  |  mov L:RB->top, RD\r\n  |  mov CFUNC:RD, [BASE-16]\r\n  |  cleartp CFUNC:RD\r\n  |  cmp RA, L:RB->maxstack\r\n  |  ja >5\t\t\t\t// Need to grow stack.\r\n  |  mov CARG1, L:RB\r\n  |  call aword CFUNC:RD->f\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  test RDd, RDd; jg ->fff_res\t// Returned nresults+1?\r\n  |1:\r\n  |  mov RA, L:RB->top\r\n  |  sub RA, BASE\r\n  |  shr RAd, 3\r\n  |  test RDd, RDd\r\n  |  lea NARGS:RDd, [RAd+1]\r\n  |  mov LFUNC:RB, [BASE-16]\r\n  |  jne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  cleartp LFUNC:RB\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  mov RA, BASE\r\n  |  test PCd, FRAME_TYPE\r\n  |  jnz >3\r\n  |  movzx RBd, PC_RA\r\n  |  neg RB\r\n  |  lea BASE, [BASE+RB*8-16]\t\t// base = base - (RB+2)*8\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |3:\r\n  |  mov RB, PC\r\n  |  and RB, -8\r\n  |  sub BASE, RB\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov CARG2d, LUA_MINSTACK\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_state_growstack\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  xor RDd, RDd\t\t\t// Simulate a return 0.\r\n  |  jmp <1\t\t\t\t// Dumb retry (goes through ff first).\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  pop RB\t\t\t\t// Must keep stack at same level.\r\n  |  mov TMP1, RB\t\t\t// Save return address\r\n  |  mov L:RB, SAVE_L\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov CARG1, L:RB\r\n  |  mov L:RB->top, RD\r\n  |  call extern lj_gc_step\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  shr RDd, 3\r\n  |  add NARGS:RDd, 1\r\n  |  mov RB, TMP1\r\n  |  push RB\t\t\t\t// Restore return address.\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  movzx RDd, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_VMEVENT\t\t// No recording while in vmevent.\r\n  |  jnz >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |  test RDL, HOOK_ACTIVE\r\n  |  jnz >1\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >1\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  movzx RDd, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |  jmp >1\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  movzx RDd, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >5\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jz >1\r\n  |  test RDL, LUA_MASKLINE\r\n  |  jz >5\r\n  |1:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG2, PC\t\t\t// Caveat: CARG2 == BASE\r\n  |  mov CARG1, L:RB\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  call extern lj_dispatch_ins\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |4:\r\n  |  movzx RAd, PC_RA\r\n  |5:\r\n  |  movzx OP, PC_OP\r\n  |  movzx RDd, PC_RD\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Re-dispatch to static ins.\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  add PC, 4\r\n  |  mov RA, [RB-40]\r\n  |  mov MULTRES, RAd\t\t\t// Restore MULTRES for *M ins.\r\n  |  jmp <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  mov LFUNC:RB, [BASE-16]\t\t// Same as curr_topL(L).\r\n  |  cleartp LFUNC:RB\r\n  |  mov RB, LFUNC:RB->pc\r\n  |  movzx RDd, byte [RB+PC2PROTO(framesize)]\r\n  |  lea RD, [BASE+RD*8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov CARG2, PC\r\n  |  lea CARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_trace_hot\t\t// (jit_State *J, const BCIns *pc)\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov SAVE_PC, PC\r\n  |.if JIT\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  mov SAVE_PC, PC\r\n  |  or PC, 1\t\t\t\t// Marker for hot call.\r\n  |1:\r\n  |.endif\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov CARG2, PC\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_dispatch_call\t// (lua_State *L, const BCIns *pc)\r\n  |  // ASMFunction returned in eax/rax (RD).\r\n  |  mov SAVE_PC, 0\t\t\t// Invalidate for subsequent line hook.\r\n  |.if JIT\r\n  |  and PC, -2\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  mov RA, RD\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  mov RB, RA\r\n  |  movzx RAd, PC_RA\r\n  |  shr RDd, 3\r\n  |  add NARGS:RDd, 1\r\n  |  jmp RB\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |.if JIT\r\n  |  // BASE = base, RC = result, RB = mbase\r\n  |  mov ITYPEd, [RB-24]\t\t// Save previous trace number.\r\n  |  mov TMPRd, MULTRES\r\n  |  movzx RAd, PC_RA\r\n  |  lea RA, [BASE+RA*8]\t\t// Call base.\r\n  |  sub TMPRd, 1\r\n  |  jz >2\r\n  |1:  // Move results down.\r\n  |  mov RB, [RC]\r\n  |  mov [RA], RB\r\n  |  add RC, 8\r\n  |  add RA, 8\r\n  |  sub TMPRd, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  movzx RCd, PC_RA\r\n  |  movzx RBd, PC_RB\r\n  |  add RC, RB\r\n  |  lea RC, [BASE+RC*8-8]\r\n  |3:\r\n  |  cmp RC, RA\r\n  |  ja >9\t\t\t\t// More results wanted?\r\n  |\r\n  |  mov RA, [DISPATCH+DISPATCH_J(trace)]\r\n  |  mov TRACE:RD, [RA+ITYPE*8]\r\n  |  test TRACE:RD, TRACE:RD\r\n  |  jz ->cont_nop\r\n  |  movzx RDd, word TRACE:RD->link\r\n  |  cmp RDd, RBd\r\n  |  je ->cont_nop\t\t\t// Blacklisted.\r\n  |  test RDd, RDd\r\n  |  jne =>BC_JLOOP\t\t\t// Jump to stitched trace.\r\n  |\r\n  |  // Stitch a new trace to the previous trace.\r\n  |  mov [DISPATCH+DISPATCH_J(exitno)], RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG2, PC\r\n  |  lea CARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RB\r\n  |  call extern lj_dispatch_stitch\t// (jit_State *J, const BCIns *pc)\r\n  |  mov BASE, L:RB->base\r\n  |  jmp ->cont_nop\r\n  |\r\n  |9:  // Fill up results with nil.\r\n  |  mov aword [RA], LJ_TNIL\r\n  |  add RA, 8\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov CARG2, PC\t\t\t// Caveat: CARG2 == BASE\r\n  |  mov CARG1, L:RB\r\n  |  call extern lj_dispatch_profile\t// (lua_State *L, const BCIns *pc)\r\n  |  mov BASE, L:RB->base\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  sub PC, 4\r\n  |  jmp ->cont_nop\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Called from an exit stub with the exit number on the stack.\r\n  |// The 16 bit exit number is stored with two (sign-extended) push imm8.\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |  push r13; push r12\r\n  |  push r11; push r10; push r9; push r8\r\n  |  push rdi; push rsi; push rbp; lea rbp, [rsp+88]; push rbp\r\n  |  push rbx; push rdx; push rcx; push rax\r\n  |  movzx RCd, byte [rbp-8]\t\t// Reconstruct exit number.\r\n  |  mov RCH, byte [rbp-16]\r\n  |  mov [rbp-8], r15; mov [rbp-16], r14\r\n  |  // Caveat: DISPATCH is rbx.\r\n  |  mov DISPATCH, [ebp]\r\n  |  mov RA, [DISPATCH+DISPATCH_GL(vmstate)]\t// Get trace number.\r\n  |  set_vmstate EXIT\r\n  |  mov [DISPATCH+DISPATCH_J(exitno)], RC\r\n  |  mov [DISPATCH+DISPATCH_J(parent)], RA\r\n  |.if X64WIN\r\n  |  sub rsp, 16*8+4*8\t\t\t// Room for SSE regs + save area.\r\n  |.else\r\n  |  sub rsp, 16*8\t\t\t// Room for SSE regs.\r\n  |.endif\r\n  |  add rbp, -128\r\n  |  movsd qword [rbp-8],   xmm15; movsd qword [rbp-16],  xmm14\r\n  |  movsd qword [rbp-24],  xmm13; movsd qword [rbp-32],  xmm12\r\n  |  movsd qword [rbp-40],  xmm11; movsd qword [rbp-48],  xmm10\r\n  |  movsd qword [rbp-56],  xmm9;  movsd qword [rbp-64],  xmm8\r\n  |  movsd qword [rbp-72],  xmm7;  movsd qword [rbp-80],  xmm6\r\n  |  movsd qword [rbp-88],  xmm5;  movsd qword [rbp-96],  xmm4\r\n  |  movsd qword [rbp-104], xmm3;  movsd qword [rbp-112], xmm2\r\n  |  movsd qword [rbp-120], xmm1;  movsd qword [rbp-128], xmm0\r\n  |  // Caveat: RB is rbp.\r\n  |  mov L:RB, [DISPATCH+DISPATCH_GL(cur_L)]\r\n  |  mov BASE, [DISPATCH+DISPATCH_GL(jit_base)]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.if X64WIN\r\n  |  lea CARG2, [rsp+4*8]\r\n  |.else\r\n  |  mov CARG2, rsp\r\n  |.endif\r\n  |  lea CARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_base)], 0\r\n  |  call extern lj_trace_exit\t\t// (jit_State *J, ExitState *ex)\r\n  |  // MULTRES or negated error code returned in eax (RD).\r\n  |  mov RA, L:RB->cframe\r\n  |  and RA, CFRAME_RAWMASK\r\n  |  mov [RA+CFRAME_OFS_L], L:RB\t// Set SAVE_L (on-trace resume/yield).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [RA+CFRAME_OFS_PC]\t// Get SAVE_PC.\r\n  |  jmp >1\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |  // RD = MULTRES or negated error code, BASE, PC and DISPATCH set.\r\n  |.if JIT\r\n  |  // Restore additional callee-save registers only used in compiled code.\r\n  |.if X64WIN\r\n  |  lea RA, [rsp+10*16+4*8]\r\n  |1:\r\n  |  movdqa xmm15, [RA-10*16]\r\n  |  movdqa xmm14, [RA-9*16]\r\n  |  movdqa xmm13, [RA-8*16]\r\n  |  movdqa xmm12, [RA-7*16]\r\n  |  movdqa xmm11, [RA-6*16]\r\n  |  movdqa xmm10, [RA-5*16]\r\n  |  movdqa xmm9, [RA-4*16]\r\n  |  movdqa xmm8, [RA-3*16]\r\n  |  movdqa xmm7, [RA-2*16]\r\n  |  mov rsp, RA\t\t\t// Reposition stack to C frame.\r\n  |  movdqa xmm6, [RA-1*16]\r\n  |  mov r15, CSAVE_1\r\n  |  mov r14, CSAVE_2\r\n  |  mov r13, CSAVE_3\r\n  |  mov r12, CSAVE_4\r\n  |.else\r\n  |  lea RA, [rsp+16]\r\n  |1:\r\n  |  mov r13, [RA-8]\r\n  |  mov r12, [RA]\r\n  |  mov rsp, RA\t\t\t// Reposition stack to C frame.\r\n  |.endif\r\n  |  test RDd, RDd; js >9\t\t// Check for error from exit.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov MULTRES, RDd\r\n  |  mov LFUNC:KBASE, [BASE-16]\r\n  |  cleartp LFUNC:KBASE\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  mov L:RB->base, BASE\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_base)], 0\r\n  |  set_vmstate INTERP\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  mov RCd, [PC]\r\n  |  movzx RAd, RCH\r\n  |  movzx OP, RCL\r\n  |  add PC, 4\r\n  |  shr RCd, 16\r\n  |  cmp OP, BC_FUNCF\t\t\t// Function header?\r\n  |  jb >3\r\n  |  cmp OP, BC_FUNCC+2\t\t\t// Fast function?\r\n  |  jae >4\r\n  |2:\r\n  |  mov RCd, MULTRES\t\t\t// RC/RD holds nres+1.\r\n  |3:\r\n  |  jmp aword [DISPATCH+OP*8]\r\n  |\r\n  |4:  // Check frame below fast function.\r\n  |  mov RC, [BASE-8]\r\n  |  test RCd, FRAME_TYPE\r\n  |  jnz <2\t\t\t\t// Trace stitching continuation?\r\n  |  // Otherwise set KBASE for Lua function below fast function.\r\n  |  movzx RCd, byte [RC-3]\r\n  |  neg RC\r\n  |  mov LFUNC:KBASE, [BASE+RC*8-24]\r\n  |  cleartp LFUNC:KBASE\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  jmp <2\r\n  |\r\n  |9:  // Rethrow error from the right C frame.\r\n  |  neg RD\r\n  |  mov CARG1, L:RB\r\n  |  mov CARG2, RD\r\n  |  call extern lj_err_throw\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called by math.floor/math.ceil fast functions\r\n  |// and from JIT code. arg/ret is xmm0. xmm0-xmm3 and RD (eax) modified.\r\n  |.macro vm_round, name, mode, cond\r\n  |->name:\r\n  |->name .. _sse:\r\n  |  sseconst_abs xmm2, RD\r\n  |  sseconst_2p52 xmm3, RD\r\n  |  movaps xmm1, xmm0\r\n  |  andpd xmm1, xmm2\t\t\t// |x|\r\n  |  ucomisd xmm3, xmm1\t\t\t// No truncation if 2^52 <= |x|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |.if mode == 2\t\t// trunc(x)?\r\n  |  movaps xmm0, xmm1\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  sseconst_1 xmm3, RD\r\n  |  cmpsd xmm0, xmm1, 1\t\t// |x| < result?\r\n  |  andpd xmm0, xmm3\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract -1.\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |.else\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |  .if mode == 1\t\t// ceil(x)?\r\n  |    sseconst_m1 xmm2, RD\t\t// Must subtract -1 to preserve -0.\r\n  |    cmpsd xmm0, xmm1, 6\t\t// x > result?\r\n  |  .else\t\t\t// floor(x)?\r\n  |    sseconst_1 xmm2, RD\r\n  |    cmpsd xmm0, xmm1, 1\t\t// x < result?\r\n  |  .endif\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract +-1.\r\n  |.endif\r\n  |  movaps xmm0, xmm1\r\n  |1:\r\n  |  ret\r\n  |.endmacro\r\n  |\r\n  |  vm_round vm_floor, 0, 1\r\n  |  vm_round vm_ceil,  1, JIT\r\n  |  vm_round vm_trunc, 2, JIT\r\n  |\r\n  |// FP modulo x%y. Called by BC_MOD* and vm_arith.\r\n  |->vm_mod:\r\n  |// Args in xmm0/xmm1, return value in xmm0.\r\n  |// Caveat: xmm0-xmm5 and RC (eax) modified!\r\n  |  movaps xmm5, xmm0\r\n  |  divsd xmm0, xmm1\r\n  |  sseconst_abs xmm2, RD\r\n  |  sseconst_2p52 xmm3, RD\r\n  |  movaps xmm4, xmm0\r\n  |  andpd xmm4, xmm2\t\t\t// |x/y|\r\n  |  ucomisd xmm3, xmm4\t\t\t// No truncation if 2^52 <= |x/y|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |  addsd xmm4, xmm3\t\t\t// (|x/y| + 2^52) - 2^52\r\n  |  subsd xmm4, xmm3\r\n  |  orpd xmm4, xmm2\t\t\t// Merge sign bit back in.\r\n  |  sseconst_1 xmm2, RD\r\n  |  cmpsd xmm0, xmm4, 1\t\t// x/y < result?\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm4, xmm0\t\t\t// If yes, subtract 1.0.\r\n  |  movaps xmm0, xmm5\r\n  |  mulsd xmm1, xmm4\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |1:\r\n  |  mulsd xmm1, xmm0\r\n  |  movaps xmm0, xmm5\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |\r\n  |// Args in xmm0/eax. Ret in xmm0. xmm0-xmm1 and eax modified.\r\n  |->vm_powi_sse:\r\n  |  cmp eax, 1; jle >6\t\t\t// i<=1?\r\n  |  // Now 1 < (unsigned)i <= 0x80000000.\r\n  |1:  // Handle leading zeros.\r\n  |  test eax, 1; jnz >2\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1\r\n  |  jmp <1\r\n  |2:\r\n  |  shr eax, 1; jz >5\r\n  |  movaps xmm1, xmm0\r\n  |3:  // Handle trailing bits.\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1; jz >4\r\n  |  jnc <3\r\n  |  mulsd xmm1, xmm0\r\n  |  jmp <3\r\n  |4:\r\n  |  mulsd xmm0, xmm1\r\n  |5:\r\n  |  ret\r\n  |6:\r\n  |  je <5\t\t\t\t// x^1 ==> x\r\n  |  jb >7\t\t\t\t// x^0 ==> 1\r\n  |  neg eax\r\n  |  call <1\r\n  |  sseconst_1 xmm1, RD\r\n  |  divsd xmm1, xmm0\r\n  |  movaps xmm0, xmm1\r\n  |  ret\r\n  |7:\r\n  |  sseconst_1 xmm0, RD\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// int lj_vm_cpuid(uint32_t f, uint32_t res[4])\r\n  |->vm_cpuid:\r\n  |  mov eax, CARG1d\r\n  |  .if X64WIN; push rsi; mov rsi, CARG2; .endif\r\n  |  push rbx\r\n  |  cpuid\r\n  |  mov [rsi], eax\r\n  |  mov [rsi+4], ebx\r\n  |  mov [rsi+8], ecx\r\n  |  mov [rsi+12], edx\r\n  |  pop rbx\r\n  |  .if X64WIN; pop rsi; .endif\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Assertions ---------------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->assert_bad_for_arg_type:\r\n#ifdef LUA_USE_ASSERT\r\n  |  int3\r\n#endif\r\n  |  int3\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in ah/al.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |  saveregs_\t// ebp/rbp already saved. ebp now holds global_State *.\r\n  |  lea DISPATCH, [ebp+GG_G2DISP]\r\n  |  mov CTSTATE, GL:ebp->ctype_state\r\n  |  movzx eax, ax\r\n  |  mov CTSTATE->cb.slot, eax\r\n  |  mov CTSTATE->cb.gpr[0], CARG1\r\n  |  mov CTSTATE->cb.gpr[1], CARG2\r\n  |  mov CTSTATE->cb.gpr[2], CARG3\r\n  |  mov CTSTATE->cb.gpr[3], CARG4\r\n  |  movsd qword CTSTATE->cb.fpr[0], xmm0\r\n  |  movsd qword CTSTATE->cb.fpr[1], xmm1\r\n  |  movsd qword CTSTATE->cb.fpr[2], xmm2\r\n  |  movsd qword CTSTATE->cb.fpr[3], xmm3\r\n  |.if X64WIN\r\n  |  lea rax, [rsp+CFRAME_SIZE+4*8]\r\n  |.else\r\n  |  lea rax, [rsp+CFRAME_SIZE]\r\n  |  mov CTSTATE->cb.gpr[4], CARG5\r\n  |  mov CTSTATE->cb.gpr[5], CARG6\r\n  |  movsd qword CTSTATE->cb.fpr[4], xmm4\r\n  |  movsd qword CTSTATE->cb.fpr[5], xmm5\r\n  |  movsd qword CTSTATE->cb.fpr[6], xmm6\r\n  |  movsd qword CTSTATE->cb.fpr[7], xmm7\r\n  |.endif\r\n  |  mov CTSTATE->cb.stack, rax\r\n  |  mov CARG2, rsp\r\n  |  mov SAVE_PC, CTSTATE\t\t// Any value outside of bytecode is ok.\r\n  |  mov CARG1, CTSTATE\r\n  |  call extern lj_ccallback_enter\t// (CTState *cts, void *cf)\r\n  |  // lua_State * returned in eax (RD).\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RD->base\r\n  |  mov RD, L:RD->top\r\n  |  sub RD, BASE\r\n  |  mov LFUNC:RB, [BASE-16]\r\n  |  cleartp LFUNC:RB\r\n  |  shr RD, 3\r\n  |  add RD, 1\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  mov L:RA, SAVE_L\r\n  |  mov CTSTATE, [DISPATCH+DISPATCH_GL(ctype_state)]\r\n  |  mov aword CTSTATE->L, L:RA\r\n  |  mov L:RA->base, BASE\r\n  |  mov L:RA->top, RB\r\n  |  mov CARG1, CTSTATE\r\n  |  mov CARG2, RC\r\n  |  call extern lj_ccallback_leave\t// (CTState *cts, TValue *o)\r\n  |  mov rax, CTSTATE->cb.gpr[0]\r\n  |  movsd xmm0, qword CTSTATE->cb.fpr[0]\r\n  |  jmp ->vm_leave_unw\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |  .type CCSTATE, CCallState, rbx\r\n  |  push rbp; mov rbp, rsp; push rbx; mov CCSTATE, CARG1\r\n  |\r\n  |  // Readjust stack.\r\n  |  mov eax, CCSTATE->spadj\r\n  |  sub rsp, rax\r\n  |\r\n  |  // Copy stack slots.\r\n  |  movzx ecx, byte CCSTATE->nsp\r\n  |  sub ecx, 1\r\n  |  js >2\r\n  |1:\r\n  |  mov rax, [CCSTATE+rcx*8+offsetof(CCallState, stack)]\r\n  |  mov [rsp+rcx*8+CCALL_SPS_EXTRA*8], rax\r\n  |  sub ecx, 1\r\n  |  jns <1\r\n  |2:\r\n  |\r\n  |  movzx eax, byte CCSTATE->nfpr\r\n  |  mov CARG1, CCSTATE->gpr[0]\r\n  |  mov CARG2, CCSTATE->gpr[1]\r\n  |  mov CARG3, CCSTATE->gpr[2]\r\n  |  mov CARG4, CCSTATE->gpr[3]\r\n  |.if not X64WIN\r\n  |  mov CARG5, CCSTATE->gpr[4]\r\n  |  mov CARG6, CCSTATE->gpr[5]\r\n  |.endif\r\n  |  test eax, eax; jz >5\r\n  |  movaps xmm0, CCSTATE->fpr[0]\r\n  |  movaps xmm1, CCSTATE->fpr[1]\r\n  |  movaps xmm2, CCSTATE->fpr[2]\r\n  |  movaps xmm3, CCSTATE->fpr[3]\r\n  |.if not X64WIN\r\n  |  cmp eax, 4; jbe >5\r\n  |  movaps xmm4, CCSTATE->fpr[4]\r\n  |  movaps xmm5, CCSTATE->fpr[5]\r\n  |  movaps xmm6, CCSTATE->fpr[6]\r\n  |  movaps xmm7, CCSTATE->fpr[7]\r\n  |.endif\r\n  |5:\r\n  |\r\n  |  call aword CCSTATE->func\r\n  |\r\n  |  mov CCSTATE->gpr[0], rax\r\n  |  movaps CCSTATE->fpr[0], xmm0\r\n  |.if not X64WIN\r\n  |  mov CCSTATE->gpr[1], rdx\r\n  |  movaps CCSTATE->fpr[1], xmm1\r\n  |.endif\r\n  |\r\n  |  mov rbx, [rbp-8]; leave; ret\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |// Note: aligning all instructions does not pay off.\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  |.macro jmp_comp, lt, ge, le, gt, target\r\n  ||switch (op) {\r\n  ||case BC_ISLT:\r\n  |   lt target\r\n  ||break;\r\n  ||case BC_ISGE:\r\n  |   ge target\r\n  ||break;\r\n  ||case BC_ISLE:\r\n  |   le target\r\n  ||break;\r\n  ||case BC_ISGT:\r\n  |   gt target\r\n  ||break;\r\n  ||default: break;  /* Shut up GCC. */\r\n  ||}\r\n  |.endmacro\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1, RD = src2, JMP with RD = target\r\n    |  ins_AD\r\n    |  mov ITYPE, [BASE+RA*8]\r\n    |  mov RB, [BASE+RD*8]\r\n    |  mov RA, ITYPE\r\n    |  mov RD, RB\r\n    |  sar ITYPE, 47\r\n    |  sar RB, 47\r\n    |.if DUALNUM\r\n    |  cmp ITYPEd, LJ_TISNUM; jne >7\r\n    |  cmp RBd, LJ_TISNUM; jne >8\r\n    |  add PC, 4\r\n    |  cmp RAd, RDd\r\n    |  jmp_comp jge, jl, jg, jle, >9\r\n    |6:\r\n    |  movzx RDd, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is a number.\r\n    |  cmp RBd, LJ_TISNUM; jb >1; jne ->vmeta_comp\r\n    |  // RA is a number, RD is an integer.\r\n    |  cvtsi2sd xmm0, RDd\r\n    |  jmp >2\r\n    |\r\n    |8:  // RA is an integer, RD is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is an integer, RD is a number.\r\n    |  cvtsi2sd xmm1, RAd\r\n    |  movd xmm0, RD\r\n    |  jmp >3\r\n    |.else\r\n    |  cmp ITYPEd, LJ_TISNUM; jae ->vmeta_comp\r\n    |  cmp RBd, LJ_TISNUM; jae ->vmeta_comp\r\n    |.endif\r\n    |1:\r\n    |  movd xmm0, RD\r\n    |2:\r\n    |  movd xmm1, RA\r\n    |3:\r\n    |  add PC, 4\r\n    |  ucomisd xmm0, xmm1\r\n    |  // Unordered: all of ZF CF PF set, ordered: PF clear.\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    |.if DUALNUM\r\n    |  jmp_comp jbe, ja, jb, jae, <9\r\n    |  jmp <6\r\n    |.else\r\n    |  jmp_comp jbe, ja, jb, jae, >1\r\n    |  movzx RDd, PC_RD\r\n    |  branchPC RD\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  ins_AD\t// RA = src1, RD = src2, JMP with RD = target\r\n    |  mov RB, [BASE+RD*8]\r\n    |  mov ITYPE, [BASE+RA*8]\r\n    |  add PC, 4\r\n    |  mov RD, RB\r\n    |  mov RA, ITYPE\r\n    |  sar RB, 47\r\n    |  sar ITYPE, 47\r\n    |.if DUALNUM\r\n    |  cmp RBd, LJ_TISNUM; jne >7\r\n    |  cmp ITYPEd, LJ_TISNUM; jne >8\r\n    |  cmp RDd, RAd\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RDd, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RD is not an integer.\r\n    |  ja >5\r\n    |  // RD is a number.\r\n    |  movd xmm1, RD\r\n    |  cmp ITYPEd, LJ_TISNUM; jb >1; jne >5\r\n    |  // RD is a number, RA is an integer.\r\n    |  cvtsi2sd xmm0, RAd\r\n    |  jmp >2\r\n    |\r\n    |8:  // RD is an integer, RA is not an integer.\r\n    |  ja >5\r\n    |  // RD is an integer, RA is a number.\r\n    |  cvtsi2sd xmm1, RDd\r\n    |  jmp >1\r\n    |\r\n    |.else\r\n    |  cmp RBd, LJ_TISNUM; jae >5\r\n    |  cmp ITYPEd, LJ_TISNUM; jae >5\r\n    |  movd xmm1, RD\r\n    |.endif\r\n    |1:\r\n    |  movd xmm0, RA\r\n    |2:\r\n    |  ucomisd xmm0, xmm1\r\n    |4:\r\n  iseqne_fp:\r\n    if (vk) {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  jne >2\r\n    } else {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  je >1\r\n    }\r\n  iseqne_end:\r\n    if (vk) {\r\n      |1:\t\t\t\t// EQ: Branch to the target.\r\n      |  movzx RDd, PC_RD\r\n      |  branchPC RD\r\n      |2:\t\t\t\t// NE: Fallthrough to next instruction.\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n    } else {\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n      |2:\t\t\t\t// NE: Branch to the target.\r\n      |  movzx RDd, PC_RD\r\n      |  branchPC RD\r\n      |1:\t\t\t\t// EQ: Fallthrough to next instruction.\r\n    }\r\n    if (LJ_DUALNUM && (op == BC_ISEQV || op == BC_ISNEV ||\r\n\t\t       op == BC_ISEQN || op == BC_ISNEN)) {\r\n      |  jmp <9\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    if (op == BC_ISEQV || op == BC_ISNEV) {\r\n      |5:  // Either or both types are not numbers.\r\n      |.if FFI\r\n      |  cmp RBd, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  cmp ITYPEd, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |.endif\r\n      |  cmp RA, RD\r\n      |  je <1\t\t\t\t// Same GCobjs or pvalues?\r\n      |  cmp RBd, ITYPEd\r\n      |  jne <2\t\t\t\t// Not the same type?\r\n      |  cmp RBd, LJ_TISTABUD\r\n      |  ja <2\t\t\t\t// Different objects and not table/ud?\r\n      |\r\n      |  // Different tables or userdatas. Need to check __eq metamethod.\r\n      |  // Field metatable must be at same offset for GCtab and GCudata!\r\n      |  cleartp TAB:RA\r\n      |  mov TAB:RB, TAB:RA->metatable\r\n      |  test TAB:RB, TAB:RB\r\n      |  jz <2\t\t\t\t// No metatable?\r\n      |  test byte TAB:RB->nomm, 1<<MM_eq\r\n      |  jnz <2\t\t\t\t// Or 'no __eq' flag set?\r\n      if (vk) {\r\n\t|  xor RBd, RBd\t\t\t// ne = 0\r\n      } else {\r\n\t|  mov RBd, 1\t\t\t// ne = 1\r\n      }\r\n      |  jmp ->vmeta_equal\t\t// Handle __eq metamethod.\r\n    } else {\r\n      |.if FFI\r\n      |3:\r\n      |  cmp ITYPEd, LJ_TCDATA\r\n      if (LJ_DUALNUM && vk) {\r\n\t|  jne <9\r\n      } else {\r\n\t|  jne <2\r\n      }\r\n      |  jmp ->vmeta_equal_cd\r\n      |.endif\r\n    }\r\n    break;\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  ins_AND\t// RA = src, RD = str const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8]\r\n    |  add PC, 4\r\n    |  checkstr RB, >3\r\n    |  cmp RB, [KBASE+RD*8]\r\n  iseqne_test:\r\n    if (vk) {\r\n      |  jne >2\r\n    } else {\r\n      |  je >1\r\n    }\r\n    goto iseqne_end;\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  ins_AD\t// RA = src, RD = num const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8]\r\n    |  add PC, 4\r\n    |.if DUALNUM\r\n    |  checkint RB, >7\r\n    |  mov RD, [KBASE+RD*8]\r\n    |  checkint RD, >8\r\n    |  cmp RBd, RDd\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RDd, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja >3\r\n    |  // RA is a number.\r\n    |  mov RD, [KBASE+RD*8]\r\n    |  checkint RD, >1\r\n    |  // RA is a number, RD is an integer.\r\n    |  cvtsi2sd xmm0, RDd\r\n    |  jmp >2\r\n    |\r\n    |8:  // RA is an integer, RD is a number.\r\n    |  cvtsi2sd xmm0, RBd\r\n    |  movd xmm1, RD\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp >4\r\n    |1:\r\n    |  movd xmm0, RD\r\n    |.else\r\n    |  checknum RB, >3\r\n    |1:\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |.endif\r\n    |2:\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |4:\r\n    goto iseqne_fp;\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  ins_AND\t// RA = src, RD = primitive type (~), JMP with RD = target\r\n    |  mov RB, [BASE+RA*8]\r\n    |  sar RB, 47\r\n    |  add PC, 4\r\n    |  cmp RBd, RDd\r\n    if (!LJ_HASFFI) goto iseqne_test;\r\n    if (vk) {\r\n      |  jne >3\r\n      |  movzx RDd, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n      |3:\r\n      |  cmp RBd, LJ_TCDATA; jne <2\r\n      |  jmp ->vmeta_equal_cd\r\n    } else {\r\n      |  je >2\r\n      |  cmp RBd, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  movzx RDd, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n    }\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  ins_AD\t// RA = dst or unused, RD = src, JMP with RD = target\r\n    |  mov ITYPE, [BASE+RD*8]\r\n    |  add PC, 4\r\n    if (op == BC_ISTC || op == BC_ISFC) {\r\n      |  mov RB, ITYPE\r\n    }\r\n    |  sar ITYPE, 47\r\n    |  cmp ITYPEd, LJ_TISTRUECOND\r\n    if (op == BC_IST || op == BC_ISTC) {\r\n      |  jae >1\r\n    } else {\r\n      |  jb >1\r\n    }\r\n    if (op == BC_ISTC || op == BC_ISFC) {\r\n      |  mov [BASE+RA*8], RB\r\n    }\r\n    |  movzx RDd, PC_RD\r\n    |  branchPC RD\r\n    |1:\t\t\t\t\t// Fallthrough to the next instruction.\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  ins_AD\t// RA = src, RD = -type\r\n    |  mov RB, [BASE+RA*8]\r\n    |  sar RB, 47\r\n    |  add RBd, RDd\r\n    |  jne ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n  case BC_ISNUM:\r\n    |  ins_AD\t// RA = src, RD = -(TISNUM-1)\r\n    |  checknumtp [BASE+RA*8], ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  mov RB, [BASE+RD*8]\r\n    |  mov [BASE+RA*8], RB\r\n    |  ins_next_\r\n    break;\r\n  case BC_NOT:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  mov RB, [BASE+RD*8]\r\n    |  sar RB, 47\r\n    |  mov RCd, 2\r\n    |  cmp RB, LJ_TISTRUECOND\r\n    |  sbb RCd, 0\r\n    |  shl RC, 47\r\n    |  not RC\r\n    |  mov [BASE+RA*8], RC\r\n    |  ins_next\r\n    break;\r\n  case BC_UNM:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  mov RB, [BASE+RD*8]\r\n    |.if DUALNUM\r\n    |  checkint RB, >5\r\n    |  neg RBd\r\n    |  jo >4\r\n    |  setint RB\r\n    |9:\r\n    |  mov [BASE+RA*8], RB\r\n    |  ins_next\r\n    |4:\r\n    |  mov64 RB, U64x(41e00000,00000000)  // 2^31.\r\n    |  jmp <9\r\n    |5:\r\n    |  ja ->vmeta_unm\r\n    |.else\r\n    |  checknum RB, ->vmeta_unm\r\n    |.endif\r\n    |  mov64 RD, U64x(80000000,00000000)\r\n    |  xor RB, RD\r\n    |.if DUALNUM\r\n    |  jmp <9\r\n    |.else\r\n    |  mov [BASE+RA*8], RB\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_LEN:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  mov RD, [BASE+RD*8]\r\n    |  checkstr RD, >2\r\n    |.if DUALNUM\r\n    |  mov RDd, dword STR:RD->len\r\n    |1:\r\n    |  setint RD\r\n    |  mov [BASE+RA*8], RD\r\n    |.else\r\n    |  xorps xmm0, xmm0\r\n    |  cvtsi2sd xmm0, dword STR:RD->len\r\n    |1:\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  ins_next\r\n    |2:\r\n    |  cmp ITYPEd, LJ_TTAB; jne ->vmeta_len\r\n    |  mov TAB:CARG1, TAB:RD\r\n#if LJ_52\r\n    |  mov TAB:RB, TAB:RD->metatable\r\n    |  cmp TAB:RB, 0\r\n    |  jnz >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |  call extern lj_tab_len\t\t// (GCtab *t)\r\n    |  // Length of table returned in eax (RD).\r\n    |.if DUALNUM\r\n    |  // Nothing to do.\r\n    |.else\r\n    |  cvtsi2sd xmm0, RDd\r\n    |.endif\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  movzx RAd, PC_RA\r\n    |  jmp <1\r\n#if LJ_52\r\n    |9:  // Check for __len.\r\n    |  test byte TAB:RB->nomm, 1<<MM_len\r\n    |  jnz <3\r\n    |  jmp ->vmeta_len\t\t\t// 'no __len' flag NOT set: check.\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre, sseins, ssereg\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   checknumtp [BASE+RB*8], ->vmeta_arith_vn\r\n    |   .if DUALNUM\r\n    |     checknumtp [KBASE+RC*8], ->vmeta_arith_vn\r\n    |   .endif\r\n    |   movsd xmm0, qword [BASE+RB*8]\r\n    |   sseins ssereg, qword [KBASE+RC*8]\r\n    ||  break;\r\n    ||case 1:\r\n    |   checknumtp [BASE+RB*8], ->vmeta_arith_nv\r\n    |   .if DUALNUM\r\n    |     checknumtp [KBASE+RC*8], ->vmeta_arith_nv\r\n    |   .endif\r\n    |   movsd xmm0, qword [KBASE+RC*8]\r\n    |   sseins ssereg, qword [BASE+RB*8]\r\n    ||  break;\r\n    ||default:\r\n    |   checknumtp [BASE+RB*8], ->vmeta_arith_vv\r\n    |   checknumtp [BASE+RC*8], ->vmeta_arith_vv\r\n    |   movsd xmm0, qword [BASE+RB*8]\r\n    |   sseins ssereg, qword [BASE+RC*8]\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   mov RB, [BASE+RB*8]\r\n    |   mov RC, [KBASE+RC*8]\r\n    |   checkint RB, ->vmeta_arith_vno\r\n    |   checkint RC, ->vmeta_arith_vno\r\n    |   intins RBd, RCd; jo ->vmeta_arith_vno\r\n    ||  break;\r\n    ||case 1:\r\n    |   mov RB, [BASE+RB*8]\r\n    |   mov RC, [KBASE+RC*8]\r\n    |   checkint RB, ->vmeta_arith_nvo\r\n    |   checkint RC, ->vmeta_arith_nvo\r\n    |   intins RCd, RBd; jo ->vmeta_arith_nvo\r\n    ||  break;\r\n    ||default:\r\n    |   mov RB, [BASE+RB*8]\r\n    |   mov RC, [BASE+RC*8]\r\n    |   checkint RB, ->vmeta_arith_vvo\r\n    |   checkint RC, ->vmeta_arith_vvo\r\n    |   intins RBd, RCd; jo ->vmeta_arith_vvo\r\n    ||  break;\r\n    ||}\r\n    ||if (vk == 1) {\r\n    |   setint RC\r\n    |   mov [BASE+RA*8], RC\r\n    ||} else {\r\n    |   setint RB\r\n    |   mov [BASE+RA*8], RB\r\n    ||}\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpost\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, sseins\r\n    |  ins_arithpre sseins, xmm0\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, intins, sseins\r\n    |.if DUALNUM\r\n    |  ins_arithdn intins\r\n    |.else\r\n    |  ins_arith, sseins\r\n    |.endif\r\n    |.endmacro\r\n\r\n    |  // RA = dst, RB = src1 or num const, RC = src2 or num const\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith add, addsd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith sub, subsd\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith imul, mulsd\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith divsd\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arithpre movsd, xmm1\r\n    |->BC_MODVN_Z:\r\n    |  call ->vm_mod\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithpre movsd, xmm1\r\n    |  jmp ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    break;\r\n  case BC_POW:\r\n    |  ins_arithpre movsd, xmm1\r\n    |  mov RB, BASE\r\n    |  call extern pow\r\n    |  movzx RAd, PC_RA\r\n    |  mov BASE, RB\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  ins_ABC\t// RA = dst, RB = src_start, RC = src_end\r\n    |  mov L:CARG1, SAVE_L\r\n    |  mov L:CARG1->base, BASE\r\n    |  lea CARG2, [BASE+RC*8]\r\n    |  mov CARG3d, RCd\r\n    |  sub CARG3d, RBd\r\n    |->BC_CAT_Z:\r\n    |  mov L:RB, L:CARG1\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  test RC, RC\r\n    |  jnz ->vmeta_binop\r\n    |  movzx RBd, PC_RB\t\t\t// Copy result to Stk[RA] from Stk[RB].\r\n    |  movzx RAd, PC_RA\r\n    |  mov RC, [BASE+RB*8]\r\n    |  mov [BASE+RA*8], RC\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov RD, [KBASE+RD*8]\r\n    |  settp RD, LJ_TSTR\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  ins_AND\t// RA = dst, RD = cdata const (~)\r\n    |  mov RD, [KBASE+RD*8]\r\n    |  settp RD, LJ_TCDATA\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  ins_AD\t// RA = dst, RD = signed int16 literal\r\n    |.if DUALNUM\r\n    |  movsx RDd, RDW\r\n    |  setint RD\r\n    |  mov [BASE+RA*8], RD\r\n    |.else\r\n    |  movsx RDd, RDW\t\t\t// Sign-extend literal.\r\n    |  cvtsi2sd xmm0, RDd\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_KNUM:\r\n    |  ins_AD\t// RA = dst, RD = num const\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |  ins_next\r\n    break;\r\n  case BC_KPRI:\r\n    |  ins_AD\t// RA = dst, RD = primitive type (~)\r\n    |  shl RD, 47\r\n    |  not RD\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KNIL:\r\n    |  ins_AD\t// RA = dst_start, RD = dst_end\r\n    |  lea RA, [BASE+RA*8+8]\r\n    |  lea RD, [BASE+RD*8]\r\n    |  mov RB, LJ_TNIL\r\n    |  mov [RA-8], RB\t\t\t// Sets minimum 2 slots.\r\n    |1:\r\n    |  mov [RA], RB\r\n    |  add RA, 8\r\n    |  cmp RA, RD\r\n    |  jbe <1\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  ins_AD\t// RA = dst, RD = upvalue #\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov UPVAL:RB, [LFUNC:RB+RD*8+offsetof(GCfuncL, uvptr)]\r\n    |  mov RB, UPVAL:RB->v\r\n    |  mov RD, [RB]\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_USETV:\r\n#define TV2MARKOFS \\\r\n ((int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv))\r\n    |  ins_AD\t// RA = upvalue #, RD = src\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*8+offsetof(GCfuncL, uvptr)]\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  mov RB, UPVAL:RB->v\r\n    |  mov RA, [BASE+RD*8]\r\n    |  mov [RB], RA\r\n    |  jz >1\r\n    |  // Check barrier for closed upvalue.\r\n    |  test byte [RB+TV2MARKOFS], LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Upvalue is black. Check if new value is collectable and white.\r\n    |  mov RD, RA\r\n    |  sar RD, 47\r\n    |  sub RDd, LJ_TISGCV\r\n    |  cmp RDd, LJ_TNUMX - LJ_TISGCV\t\t\t// tvisgcv(v)\r\n    |  jbe <1\r\n    |  cleartp GCOBJ:RA\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(v)\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if not X64WIN\r\n    |  mov CARG2, RB\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |.else\r\n    |  xchg CARG2, RB\t\t\t// Save BASE (CARG2 == BASE).\r\n    |.endif\r\n    |  lea GL:CARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n#undef TV2MARKOFS\r\n  case BC_USETS:\r\n    |  ins_AND\t// RA = upvalue #, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*8+offsetof(GCfuncL, uvptr)]\r\n    |  mov STR:RA, [KBASE+RD*8]\r\n    |  mov RD, UPVAL:RB->v\r\n    |  settp STR:ITYPE, STR:RA, LJ_TSTR\r\n    |  mov [RD], STR:ITYPE\r\n    |  test byte UPVAL:RB->marked, LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(str)\r\n    |  jz <1\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  mov RB, BASE\t\t\t// Save BASE (CARG2 == BASE).\r\n    |  mov CARG2, RD\r\n    |  lea GL:CARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n  case BC_USETN:\r\n    |  ins_AD\t// RA = upvalue #, RD = num const\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*8+offsetof(GCfuncL, uvptr)]\r\n    |  mov RA, UPVAL:RB->v\r\n    |  movsd qword [RA], xmm0\r\n    |  ins_next\r\n    break;\r\n  case BC_USETP:\r\n    |  ins_AD\t// RA = upvalue #, RD = primitive type (~)\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*8+offsetof(GCfuncL, uvptr)]\r\n    |  shl RD, 47\r\n    |  not RD\r\n    |  mov RA, UPVAL:RB->v\r\n    |  mov [RA], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_UCLO:\r\n    |  ins_AD\t// RA = level, RD = target\r\n    |  branchPC RD\t\t\t// Do this first to free RD.\r\n    |  mov L:RB, SAVE_L\r\n    |  cmp dword L:RB->openupval, 0\r\n    |  je >1\r\n    |  mov L:RB->base, BASE\r\n    |  lea CARG2, [BASE+RA*8]\t\t// Caveat: CARG2 == BASE\r\n    |  mov L:CARG1, L:RB\t\t// Caveat: CARG1 == RA\r\n    |  call extern lj_func_closeuv\t// (lua_State *L, TValue *level)\r\n    |  mov BASE, L:RB->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  ins_AND\t// RA = dst, RD = proto const (~) (holding function prototype)\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\t\t// Caveat: CARG2/CARG3 may be BASE.\r\n    |  mov CARG3, [BASE-16]\r\n    |  cleartp CARG3\r\n    |  mov CARG2, [KBASE+RD*8]\t\t// Fetch GCproto *.\r\n    |  mov CARG1, L:RB\r\n    |  mov SAVE_PC, PC\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  call extern lj_func_newL_gc\r\n    |  // GCfuncL * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RAd, PC_RA\r\n    |  settp LFUNC:RC, LJ_TFUNC\r\n    |  mov [BASE+RA*8], LFUNC:RC\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n    |  ins_AD\t// RA = dst, RD = hbits|asize\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov SAVE_PC, PC\r\n    |  jae >5\r\n    |1:\r\n    |  mov CARG3d, RDd\r\n    |  and RDd, 0x7ff\r\n    |  shr CARG3d, 11\r\n    |  cmp RDd, 0x7ff\r\n    |  je >3\r\n    |2:\r\n    |  mov L:CARG1, L:RB\r\n    |  mov CARG2d, RDd\r\n    |  call extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RAd, PC_RA\r\n    |  settp TAB:RC, LJ_TTAB\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  ins_next\r\n    |3:  // Turn 0x7ff into 0x801.\r\n    |  mov RDd, 0x801\r\n    |  jmp <2\r\n    |5:\r\n    |  mov L:CARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop\t// (lua_State *L)\r\n    |  movzx RDd, PC_RD\r\n    |  jmp <1\r\n    break;\r\n  case BC_TDUP:\r\n    |  ins_AND\t// RA = dst, RD = table const (~) (holding template table)\r\n    |  mov L:RB, SAVE_L\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  mov SAVE_PC, PC\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov L:RB->base, BASE\r\n    |  jae >3\r\n    |2:\r\n    |  mov TAB:CARG2, [KBASE+RD*8]\t// Caveat: CARG2 == BASE\r\n    |  mov L:CARG1, L:RB\t\t// Caveat: CARG1 == RA\r\n    |  call extern lj_tab_dup\t\t// (lua_State *L, Table *kt)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RAd, PC_RA\r\n    |  settp TAB:RC, LJ_TTAB\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  ins_next\r\n    |3:\r\n    |  mov L:CARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop\t// (lua_State *L)\r\n    |  movzx RDd, PC_RD\t\t\t// Need to reload RD.\r\n    |  not RD\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*8]\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_GSET:\r\n    |  ins_AND\t// RA = src, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |  cleartp LFUNC:RB\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*8]\r\n    |  jmp ->BC_TSETS_Z\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  mov RC, [BASE+RC*8]\r\n    |  checktab TAB:RB, ->vmeta_tgetv\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |  movd xmm0, RC\r\n    |  cvttsd2si RCd, xmm0\r\n    |  cvtsi2sd xmm1, RCd\r\n    |  ucomisd xmm0, xmm1\r\n    |  jne ->vmeta_tgetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RCd, TAB:RB->asize\t\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tgetv\t\t// Not in array part? Use fallback.\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Get array slot.\r\n    |  mov ITYPE, [RC]\r\n    |  cmp ITYPE, LJ_TNIL\t\t// Avoid overwriting RB in fastpath.\r\n    |  je >2\r\n    |1:\r\n    |  mov [BASE+RA*8], ITYPE\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz <1\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetv\t\t\t// 'no __index' flag NOT set: check.\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  cmp ITYPEd, LJ_TSTR; jne ->vmeta_tgetv\r\n    |  cleartp STR:RC\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_TGETS:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = str const (~)\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  not RC\r\n    |  mov STR:RC, [KBASE+RC*8]\r\n    |  checktab TAB:RB, ->vmeta_tgets\r\n    |->BC_TGETS_Z:\t// RB = GCtab *, RC = GCstr *\r\n    |  mov TMPRd, TAB:RB->hmask\r\n    |  and TMPRd, STR:RC->hash\r\n    |  imul TMPRd, #NODE\r\n    |  add NODE:TMPR, TAB:RB->node\r\n    |  settp ITYPE, STR:RC, LJ_TSTR\r\n    |1:\r\n    |  cmp NODE:TMPR->key, ITYPE\r\n    |  jne >4\r\n    |  // Get node value.\r\n    |  mov ITYPE, NODE:TMPR->val\r\n    |  cmp ITYPE, LJ_TNIL\r\n    |  je >5\t\t\t\t// Key found, but nil value?\r\n    |2:\r\n    |  mov [BASE+RA*8], ITYPE\r\n    |  ins_next\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  mov NODE:TMPR, NODE:TMPR->next\r\n    |  test NODE:TMPR, NODE:TMPR\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |  mov ITYPE, LJ_TNIL\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz <2\t\t\t\t// No metatable: done.\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_index\r\n    |  jnz <2\t\t\t\t// 'no __index' flag set: done.\r\n    |  jmp ->vmeta_tgets\t\t// Caveat: preserve STR:RC.\r\n    break;\r\n  case BC_TGETB:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = byte literal\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  checktab TAB:RB, ->vmeta_tgetb\r\n    |  cmp RCd, TAB:RB->asize\r\n    |  jae ->vmeta_tgetb\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Get array slot.\r\n    |  mov ITYPE, [RC]\r\n    |  cmp ITYPE, LJ_TNIL\r\n    |  je >2\r\n    |1:\r\n    |  mov [BASE+RA*8], ITYPE\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz <1\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetb\t\t\t// 'no __index' flag NOT set: check.\r\n    |  jmp <1\r\n    break;\r\n  case BC_TGETR:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cleartp TAB:RB\r\n    |.if DUALNUM\r\n    |  mov RCd, dword [BASE+RC*8]\r\n    |.else\r\n    |  cvttsd2si RCd, qword [BASE+RC*8]\r\n    |.endif\r\n    |  cmp RCd, TAB:RB->asize\r\n    |  jae ->vmeta_tgetr\t\t// Not in array part? Use fallback.\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Get array slot.\r\n    |->BC_TGETR_Z:\r\n    |  mov ITYPE, [RC]\r\n    |->BC_TGETR2_Z:\r\n    |  mov [BASE+RA*8], ITYPE\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  mov RC, [BASE+RC*8]\r\n    |  checktab TAB:RB, ->vmeta_tsetv\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |  movd xmm0, RC\r\n    |  cvttsd2si RCd, xmm0\r\n    |  cvtsi2sd xmm1, RCd\r\n    |  ucomisd xmm0, xmm1\r\n    |  jne ->vmeta_tsetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RCd, TAB:RB->asize\t\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tsetv\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp aword [RC], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:  // Set array slot.\r\n    |  mov RB, [BASE+RA*8]\r\n    |  mov [RC], RB\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz <1\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetv\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  cmp ITYPEd, LJ_TSTR; jne ->vmeta_tsetv\r\n    |  cleartp STR:RC\r\n    |  jmp ->BC_TSETS_Z\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMPR\r\n    |  jmp <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = str const (~)\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  not RC\r\n    |  mov STR:RC, [KBASE+RC*8]\r\n    |  checktab TAB:RB, ->vmeta_tsets\r\n    |->BC_TSETS_Z:\t// RB = GCtab *, RC = GCstr *\r\n    |  mov TMPRd, TAB:RB->hmask\r\n    |  and TMPRd, STR:RC->hash\r\n    |  imul TMPRd, #NODE\r\n    |  mov byte TAB:RB->nomm, 0\t\t// Clear metamethod cache.\r\n    |  add NODE:TMPR, TAB:RB->node\r\n    |  settp ITYPE, STR:RC, LJ_TSTR\r\n    |1:\r\n    |  cmp NODE:TMPR->key, ITYPE\r\n    |  jne >5\r\n    |  // Ok, key found. Assumes: offsetof(Node, val) == 0\r\n    |  cmp aword [TMPR], LJ_TNIL\r\n    |  je >4\t\t\t\t// Previous value is nil?\r\n    |2:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |3:  // Set node value.\r\n    |  mov ITYPE, [BASE+RA*8]\r\n    |  mov [TMPR], ITYPE\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  mov TAB:ITYPE, TAB:RB->metatable\r\n    |  test TAB:ITYPE, TAB:ITYPE\r\n    |  jz <2\r\n    |  test byte TAB:ITYPE->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  jmp <2\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  mov NODE:TMPR, NODE:TMPR->next\r\n    |  test NODE:TMPR, NODE:TMPR\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz >6\t\t\t\t// No metatable: continue.\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mov TMP1, ITYPE\r\n    |  mov L:CARG1, SAVE_L\r\n    |  mov L:CARG1->base, BASE\r\n    |  lea CARG3, TMP1\r\n    |  mov CARG2, TAB:RB\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_newkey\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Handles write barrier for the new key. TValue * returned in eax (RC).\r\n    |  mov L:CARG1, SAVE_L\r\n    |  mov BASE, L:CARG1->base\r\n    |  mov TMPR, rax\r\n    |  movzx RAd, PC_RA\r\n    |  jmp <2\t\t\t\t// Must check write barrier for value.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, ITYPE\r\n    |  jmp <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = byte literal\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  checktab TAB:RB, ->vmeta_tsetb\r\n    |  cmp RCd, TAB:RB->asize\r\n    |  jae ->vmeta_tsetb\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp aword [RC], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\t // Set array slot.\r\n    |  mov ITYPE, [BASE+RA*8]\r\n    |  mov [RC], ITYPE\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  mov TAB:TMPR, TAB:RB->metatable\r\n    |  test TAB:TMPR, TAB:TMPR\r\n    |  jz <1\r\n    |  test byte TAB:TMPR->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetb\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  jmp <1\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMPR\r\n    |  jmp <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cleartp TAB:RB\r\n    |.if DUALNUM\r\n    |  mov RC, [BASE+RC*8]\r\n    |.else\r\n    |  cvttsd2si RCd, qword [BASE+RC*8]\r\n    |.endif\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\r\n    |  cmp RCd, TAB:RB->asize\r\n    |  jae ->vmeta_tsetr\r\n    |  shl RCd, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Set array slot.\r\n    |->BC_TSETR_Z:\r\n    |  mov ITYPE, [BASE+RA*8]\r\n    |  mov [RC], ITYPE\r\n    |  ins_next\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, TMPR\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  ins_AD\t// RA = base (table at base-1), RD = num const (start index)\r\n    |1:\r\n    |  mov TMPRd, dword [KBASE+RD*8]\t// Integer constant is in lo-word.\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov TAB:RB, [RA-8]\t\t// Guaranteed to be a table.\r\n    |  cleartp TAB:RB\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\r\n    |  mov RDd, MULTRES\r\n    |  sub RDd, 1\r\n    |  jz >4\t\t\t\t// Nothing to copy?\r\n    |  add RDd, TMPRd\t\t\t// Compute needed size.\r\n    |  cmp RDd, TAB:RB->asize\r\n    |  ja >5\t\t\t\t// Doesn't fit into array part?\r\n    |  sub RDd, TMPRd\r\n    |  shl TMPRd, 3\r\n    |  add TMPR, TAB:RB->array\r\n    |3:  // Copy result slots to table.\r\n    |  mov RB, [RA]\r\n    |  add RA, 8\r\n    |  mov [TMPR], RB\r\n    |  add TMPR, 8\r\n    |  sub RDd, 1\r\n    |  jnz <3\r\n    |4:\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |  mov L:CARG1, SAVE_L\r\n    |  mov L:CARG1->base, BASE\t\t// Caveat: CARG2/CARG3 may be BASE.\r\n    |  mov CARG2, TAB:RB\r\n    |  mov CARG3d, RDd\r\n    |  mov L:RB, L:CARG1\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_reasize\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RAd, PC_RA\t\t\t// Restore RA.\r\n    |  movzx RDd, PC_RD\t\t\t// Restore RD.\r\n    |  jmp <1\t\t\t\t// Retry.\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RD\r\n    |  jmp <2\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALL: case BC_CALLM:\r\n    |  ins_A_C\t// RA = base, (RB = nresults+1,) RC = nargs+1 | extra_nargs\r\n    if (op == BC_CALLM) {\r\n      |  add NARGS:RDd, MULTRES\r\n    }\r\n    |  mov LFUNC:RB, [BASE+RA*8]\r\n    |  checkfunc LFUNC:RB, ->vmeta_call_ra\r\n    |  lea BASE, [BASE+RA*8+16]\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  ins_AD\t// RA = base, RD = extra_nargs\r\n    |  add NARGS:RDd, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows and ins_AD is a no-op.\r\n    break;\r\n  case BC_CALLT:\r\n    |  ins_AD\t// RA = base, RD = nargs+1\r\n    |  lea RA, [BASE+RA*8+16]\r\n    |  mov KBASE, BASE\t\t\t// Use KBASE for move + vmeta_call hint.\r\n    |  mov LFUNC:RB, [RA-16]\r\n    |  checktp_nc LFUNC:RB, LJ_TFUNC, ->vmeta_call\r\n    |->BC_CALLT_Z:\r\n    |  mov PC, [BASE-8]\r\n    |  test PCd, FRAME_TYPE\r\n    |  jnz >7\r\n    |1:\r\n    |  mov [BASE-16], LFUNC:RB\t\t// Copy func+tag down, reloaded below.\r\n    |  mov MULTRES, NARGS:RDd\r\n    |  sub NARGS:RDd, 1\r\n    |  jz >3\r\n    |2:  // Move args down.\r\n    |  mov RB, [RA]\r\n    |  add RA, 8\r\n    |  mov [KBASE], RB\r\n    |  add KBASE, 8\r\n    |  sub NARGS:RDd, 1\r\n    |  jnz <2\r\n    |\r\n    |  mov LFUNC:RB, [BASE-16]\r\n    |3:\r\n    |  cleartp LFUNC:RB\r\n    |  mov NARGS:RDd, MULTRES\r\n    |  cmp byte LFUNC:RB->ffid, 1\t// (> FF_C) Calling a fast function?\r\n    |  ja >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function.\r\n    |  test PCd, FRAME_TYPE\t\t// Lua frame below?\r\n    |  jnz <4\r\n    |  movzx RAd, PC_RA\r\n    |  neg RA\r\n    |  mov LFUNC:KBASE, [BASE+RA*8-32]\t// Need to prepare KBASE.\r\n    |  cleartp LFUNC:KBASE\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  jmp <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  sub PC, FRAME_VARG\r\n    |  test PCd, FRAME_TYPEP\r\n    |  jnz >8\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, PC\t\t\t// Need to relocate BASE/KBASE down.\r\n    |  mov KBASE, BASE\r\n    |  mov PC, [BASE-8]\r\n    |  jmp <1\r\n    |8:\r\n    |  add PCd, FRAME_VARG\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  ins_A\t// RA = base, (RB = nresults+1,) RC = nargs+1 (2+1)\r\n    |  lea RA, [BASE+RA*8+16]\t\t// fb = base+2\r\n    |  mov RB, [RA-32]\t\t\t// Copy state. fb[0] = fb[-4].\r\n    |  mov RC, [RA-24]\t\t\t// Copy control var. fb[1] = fb[-3].\r\n    |  mov [RA], RB\r\n    |  mov [RA+8], RC\r\n    |  mov LFUNC:RB, [RA-40]\t\t// Copy callable. fb[-1] = fb[-5]\r\n    |  mov [RA-16], LFUNC:RB\r\n    |  mov NARGS:RDd, 2+1\t\t// Handle like a regular 2-arg call.\r\n    |  checkfunc LFUNC:RB, ->vmeta_call\r\n    |  mov BASE, RA\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  ins_A\t// RA = base, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  mov TAB:RB, [BASE+RA*8-16]\r\n    |  cleartp TAB:RB\r\n    |  mov RCd, [BASE+RA*8-8]\t\t// Get index from control var.\r\n    |  mov TMPRd, TAB:RB->asize\r\n    |  add PC, 4\r\n    |  mov ITYPE, TAB:RB->array\r\n    |1:  // Traverse array part.\r\n    |  cmp RCd, TMPRd; jae >5\t\t// Index points after array part?\r\n    |  cmp aword [ITYPE+RC*8], LJ_TNIL; je >4\r\n    |.if not DUALNUM\r\n    |  cvtsi2sd xmm0, RCd\r\n    |.endif\r\n    |  // Copy array slot to returned value.\r\n    |  mov RB, [ITYPE+RC*8]\r\n    |  mov [BASE+RA*8+8], RB\r\n    |  // Return array index as a numeric key.\r\n    |.if DUALNUM\r\n    |  setint ITYPE, RC\r\n    |  mov [BASE+RA*8], ITYPE\r\n    |.else\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  add RCd, 1\r\n    |  mov [BASE+RA*8-8], RCd\t\t// Update control var.\r\n    |2:\r\n    |  movzx RDd, PC_RD\t\t\t// Get target from ITERL.\r\n    |  branchPC RD\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  add RCd, 1\r\n    |  jmp <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  sub RCd, TMPRd\r\n    |6:\r\n    |  cmp RCd, TAB:RB->hmask; ja <3\t// End of iteration? Branch to ITERL+1.\r\n    |  imul ITYPEd, RCd, #NODE\r\n    |  add NODE:ITYPE, TAB:RB->node\r\n    |  cmp aword NODE:ITYPE->val, LJ_TNIL; je >7\r\n    |  lea TMPRd, [RCd+TMPRd+1]\r\n    |  // Copy key and value from hash slot.\r\n    |  mov RB, NODE:ITYPE->key\r\n    |  mov RC, NODE:ITYPE->val\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+8], RC\r\n    |  mov [BASE+RA*8-8], TMPRd\r\n    |  jmp <2\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  add RCd, 1\r\n    |  jmp <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  ins_AD\t// RA = base, RD = target (points to ITERN)\r\n    |  mov CFUNC:RB, [BASE+RA*8-24]\r\n    |  checkfunc CFUNC:RB, >5\r\n    |  checktptp [BASE+RA*8-16], LJ_TTAB, >5\r\n    |  cmp aword [BASE+RA*8-8], LJ_TNIL; jne >5\r\n    |  cmp byte CFUNC:RB->ffid, FF_next_N; jne >5\r\n    |  branchPC RD\r\n    |  mov64 TMPR, U64x(fffe7fff, 00000000)\r\n    |  mov [BASE+RA*8-8], TMPR\t\t// Initialize control var.\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov PC_OP, BC_JMP\r\n    |  branchPC RD\r\n    |  mov byte [PC], BC_ITERC\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  ins_ABC\t// RA = base, RB = nresults+1, RC = numparams\r\n    |  lea TMPR, [BASE+RC*8+(16+FRAME_VARG)]\r\n    |  lea RA, [BASE+RA*8]\r\n    |  sub TMPR, [BASE-8]\r\n    |  // Note: TMPR may now be even _above_ BASE if nargs was < numparams.\r\n    |  test RB, RB\r\n    |  jz >5\t\t\t\t// Copy all varargs?\r\n    |  lea RB, [RA+RB*8-8]\r\n    |  cmp TMPR, BASE\t\t\t// No vararg slots?\r\n    |  jnb >2\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |  mov RC, [TMPR-16]\r\n    |  add TMPR, 8\r\n    |  mov [RA], RC\r\n    |  add RA, 8\r\n    |  cmp RA, RB\t\t\t// All destination slots filled?\r\n    |  jnb >3\r\n    |  cmp TMPR, BASE\t\t\t// No more vararg slots?\r\n    |  jb <1\r\n    |2:  // Fill up remainder with nil.\r\n    |  mov aword [RA], LJ_TNIL\r\n    |  add RA, 8\r\n    |  cmp RA, RB\r\n    |  jb <2\r\n    |3:\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  mov MULTRES, 1\t\t\t// MULTRES = 0+1\r\n    |  mov RC, BASE\r\n    |  sub RC, TMPR\r\n    |  jbe <3\t\t\t\t// No vararg slots?\r\n    |  mov RBd, RCd\r\n    |  shr RBd, 3\r\n    |  add RBd, 1\r\n    |  mov MULTRES, RBd\t\t\t// MULTRES = #varargs+1\r\n    |  mov L:RB, SAVE_L\r\n    |  add RC, RA\r\n    |  cmp RC, L:RB->maxstack\r\n    |  ja >7\t\t\t\t// Need to grow stack?\r\n    |6:  // Copy all vararg slots.\r\n    |  mov RC, [TMPR-16]\r\n    |  add TMPR, 8\r\n    |  mov [RA], RC\r\n    |  add RA, 8\r\n    |  cmp TMPR, BASE\t\t\t// No more vararg slots?\r\n    |  jb <6\r\n    |  jmp <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mov L:RB->base, BASE\r\n    |  mov L:RB->top, RA\r\n    |  mov SAVE_PC, PC\r\n    |  sub TMPR, BASE\t\t\t// Need delta, because BASE may change.\r\n    |  mov TMP1hi, TMPRd\r\n    |  mov CARG2d, MULTRES\r\n    |  sub CARG2d, 1\r\n    |  mov CARG1, L:RB\r\n    |  call extern lj_state_growstack\t// (lua_State *L, int n)\r\n    |  mov BASE, L:RB->base\r\n    |  movsxd TMPR, TMP1hi\r\n    |  mov RA, L:RB->top\r\n    |  add TMPR, BASE\r\n    |  jmp <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  ins_AD\t// RA = results, RD = extra_nresults\r\n    |  add RDd, MULTRES\t\t\t// MULTRES >=1, so RD >=1.\r\n    |  // Fall through. Assumes BC_RET follows and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_RET: case BC_RET0: case BC_RET1:\r\n    |  ins_AD\t// RA = results, RD = nresults+1\r\n    if (op != BC_RET0) {\r\n      |  shl RAd, 3\r\n    }\r\n    |1:\r\n    |  mov PC, [BASE-8]\r\n    |  mov MULTRES, RDd\t\t\t// Save nresults+1.\r\n    |  test PCd, FRAME_TYPE\t\t// Check frame type marker.\r\n    |  jnz >7\t\t\t\t// Not returning to a fixarg Lua func?\r\n    switch (op) {\r\n    case BC_RET:\r\n      |->BC_RET_Z:\r\n      |  mov KBASE, BASE\t\t// Use KBASE for result move.\r\n      |  sub RDd, 1\r\n      |  jz >3\r\n      |2:  // Move results down.\r\n      |  mov RB, [KBASE+RA]\r\n      |  mov [KBASE-16], RB\r\n      |  add KBASE, 8\r\n      |  sub RDd, 1\r\n      |  jnz <2\r\n      |3:\r\n      |  mov RDd, MULTRES\t\t// Note: MULTRES may be >255.\r\n      |  movzx RBd, PC_RB\t\t// So cannot compare with RDL!\r\n      |5:\r\n      |  cmp RBd, RDd\t\t\t// More results expected?\r\n      |  ja >6\r\n      break;\r\n    case BC_RET1:\r\n      |  mov RB, [BASE+RA]\r\n      |  mov [BASE-16], RB\r\n      /* fallthrough */\r\n    case BC_RET0:\r\n      |5:\r\n      |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n      |  ja >6\r\n    default:\r\n      break;\r\n    }\r\n    |  movzx RAd, PC_RA\r\n    |  neg RA\r\n    |  lea BASE, [BASE+RA*8-16]\t\t// base = base - (RA+2)*8\r\n    |  mov LFUNC:KBASE, [BASE-16]\r\n    |  cleartp LFUNC:KBASE\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  ins_next\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    if (op == BC_RET) {\r\n      |  mov aword [KBASE-16], LJ_TNIL\t// Note: relies on shifted base.\r\n      |  add KBASE, 8\r\n    } else {\r\n      |  mov aword [BASE+RD*8-24], LJ_TNIL\r\n    }\r\n    |  add RD, 1\r\n    |  jmp <5\r\n    |\r\n    |7:  // Non-standard return case.\r\n    |  lea RB, [PC-FRAME_VARG]\r\n    |  test RBd, FRAME_TYPEP\r\n    |  jnz ->vm_return\r\n    |  // Return from vararg function: relocate BASE down and RA up.\r\n    |  sub BASE, RB\r\n    if (op != BC_RET0) {\r\n      |  add RA, RB\r\n    }\r\n    |  jmp <1\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA]\r\n  |.define FOR_STOP, [RA+8]\r\n  |.define FOR_STEP, [RA+16]\r\n  |.define FOR_EXT,  [RA+24]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop RBd\r\n    |.endif\r\n    | // Fall through. Assumes BC_IFORL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  ins_AJ\t// RA = base, RD = target (after end of loop or start of loop)\r\n    |  lea RA, [BASE+RA*8]\r\n    if (LJ_DUALNUM) {\r\n      |  mov RB, FOR_IDX\r\n      |  checkint RB, >9\r\n      |  mov TMPR, FOR_STOP\r\n      if (!vk) {\r\n\t|  checkint TMPR, ->vmeta_for\r\n\t|  mov ITYPE, FOR_STEP\r\n\t|  test ITYPEd, ITYPEd; js >5\r\n\t|  sar ITYPE, 47;\r\n\t|  cmp ITYPEd, LJ_TISNUM; jne ->vmeta_for\r\n      } else {\r\n#ifdef LUA_USE_ASSERT\r\n\t|  checkinttp FOR_STOP, ->assert_bad_for_arg_type\r\n\t|  checkinttp FOR_STEP, ->assert_bad_for_arg_type\r\n#endif\r\n\t|  mov ITYPE, FOR_STEP\r\n\t|  test ITYPEd, ITYPEd; js >5\r\n\t|  add RBd, ITYPEd; jo >1\r\n\t|  setint RB\r\n\t|  mov FOR_IDX, RB\r\n      }\r\n      |  cmp RBd, TMPRd\r\n      |  mov FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jle >7\r\n\t|1:\r\n\t|6:\r\n\t|  branchPC RD\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RDd, PC_RD\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      } else if (op == BC_IFORL) {\r\n\t|  jg >7\r\n\t|6:\r\n\t|  branchPC RD\r\n\t|1:\r\n      } else {\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      }\r\n      |7:\r\n      |  ins_next\r\n      |\r\n      |5:  // Invert check for negative step.\r\n      if (!vk) {\r\n\t|  sar ITYPE, 47;\r\n\t|  cmp ITYPEd, LJ_TISNUM; jne ->vmeta_for\r\n      } else {\r\n\t|  add RBd, ITYPEd; jo <1\r\n\t|  setint RB\r\n\t|  mov FOR_IDX, RB\r\n      }\r\n      |  cmp RBd, TMPRd\r\n      |  mov FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jge <7\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RDd, PC_RD\r\n\t|  jge =>BC_JLOOP\r\n      } else if (op == BC_IFORL) {\r\n\t|  jl <7\r\n      } else {\r\n\t|  jge =>BC_JLOOP\r\n      }\r\n      |  jmp <6\r\n      |9:  // Fallback to FP variant.\r\n      if (!vk) {\r\n\t|  jae ->vmeta_for\r\n      }\r\n    } else if (!vk) {\r\n      |  checknumtp FOR_IDX, ->vmeta_for\r\n    }\r\n    if (!vk) {\r\n      |  checknumtp FOR_STOP, ->vmeta_for\r\n    } else {\r\n#ifdef LUA_USE_ASSERT\r\n      |  checknumtp FOR_STOP, ->assert_bad_for_arg_type\r\n      |  checknumtp FOR_STEP, ->assert_bad_for_arg_type\r\n#endif\r\n    }\r\n    |  mov RB, FOR_STEP\r\n    if (!vk) {\r\n      |  checknum RB, ->vmeta_for\r\n    }\r\n    |  movsd xmm0, qword FOR_IDX\r\n    |  movsd xmm1, qword FOR_STOP\r\n    if (vk) {\r\n      |  addsd xmm0, qword FOR_STEP\r\n      |  movsd qword FOR_IDX, xmm0\r\n      |  test RB, RB; js >3\r\n    } else {\r\n      |  jl >3\r\n    }\r\n    |  ucomisd xmm1, xmm0\r\n    |1:\r\n    |  movsd qword FOR_EXT, xmm0\r\n    if (op == BC_FORI) {\r\n      |.if DUALNUM\r\n      |  jnb <7\r\n      |.else\r\n      |  jnb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else if (op == BC_JFORI) {\r\n      |  branchPC RD\r\n      |  movzx RDd, PC_RD\r\n      |  jnb =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |.if DUALNUM\r\n      |  jb <7\r\n      |.else\r\n      |  jb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else {\r\n      |  jnb =>BC_JLOOP\r\n    }\r\n    |.if DUALNUM\r\n    |  jmp <6\r\n    |.else\r\n    |2:\r\n    |  ins_next\r\n    |.endif\r\n    |\r\n    |3:  // Invert comparison if step is negative.\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop RBd\r\n    |.endif\r\n    | // Fall through. Assumes BC_IITERL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  ins_AJ\t// RA = base, RD = target\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov RB, [RA]\r\n    |  cmp RB, LJ_TNIL; je >1\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  mov [RA-8], RB\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  branchPC RD\t\t\t// Otherwise save control var + branch.\r\n      |  mov [RA-8], RB\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop RBd\r\n    |.endif\r\n    | // Fall through. Assumes BC_ILOOP follows and ins_A is a no-op.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  ins_AD\t// RA = base (ignored), RD = traceno\r\n    |  mov RA, [DISPATCH+DISPATCH_J(trace)]\r\n    |  mov TRACE:RD, [RA+RD*8]\r\n    |  mov RD, TRACE:RD->mcode\r\n    |  mov L:RB, SAVE_L\r\n    |  mov [DISPATCH+DISPATCH_GL(jit_base)], BASE\r\n    |  mov [DISPATCH+DISPATCH_GL(tmpbuf.L)], L:RB\r\n    |  // Save additional callee-save registers only used in compiled code.\r\n    |.if X64WIN\r\n    |  mov CSAVE_4, r12\r\n    |  mov CSAVE_3, r13\r\n    |  mov CSAVE_2, r14\r\n    |  mov CSAVE_1, r15\r\n    |  mov RA, rsp\r\n    |  sub rsp, 10*16+4*8\r\n    |  movdqa [RA-1*16], xmm6\r\n    |  movdqa [RA-2*16], xmm7\r\n    |  movdqa [RA-3*16], xmm8\r\n    |  movdqa [RA-4*16], xmm9\r\n    |  movdqa [RA-5*16], xmm10\r\n    |  movdqa [RA-6*16], xmm11\r\n    |  movdqa [RA-7*16], xmm12\r\n    |  movdqa [RA-8*16], xmm13\r\n    |  movdqa [RA-9*16], xmm14\r\n    |  movdqa [RA-10*16], xmm15\r\n    |.else\r\n    |  sub rsp, 16\r\n    |  mov [rsp+16], r12\r\n    |  mov [rsp+8], r13\r\n    |.endif\r\n    |  jmp RD\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  ins_AJ\t// RA = unused, RD = target\r\n    |  branchPC RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n   /*\r\n   ** Reminder: A function may be called with func/args above L->maxstack,\r\n   ** i.e. occupying EXTRA_STACK slots. And vmeta_call may add one extra slot,\r\n   ** too. This means all FUNC* ops (including fast functions) must check\r\n   ** for stack overflow _before_ adding more slots!\r\n   */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall RBd\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    | // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [BASE+RA*8]\t\t// Top of frame.\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_f\r\n    |  movzx RAd, byte [PC-4+PC2PROTO(numparams)]\r\n    |  cmp NARGS:RDd, RAd\t\t// Check for missing parameters.\r\n    |  jbe >3\r\n    |2:\r\n    if (op == BC_JFUNCF) {\r\n      |  movzx RDd, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov aword [BASE+NARGS:RD*8-8], LJ_TNIL\r\n    |  add NARGS:RDd, 1\r\n    |  cmp NARGS:RDd, RAd\r\n    |  jbe <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    | int3  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  lea RBd, [NARGS:RD*8+FRAME_VARG+8]\r\n    |  lea RD, [BASE+NARGS:RD*8+8]\r\n    |  mov LFUNC:KBASE, [BASE-16]\r\n    |  mov [RD-8], RB\t\t\t// Store delta + FRAME_VARG.\r\n    |  mov [RD-16], LFUNC:KBASE\t\t// Store copy of LFUNC.\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [RD+RA*8]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_v\t\t// Need to grow stack.\r\n    |  mov RA, BASE\r\n    |  mov BASE, RD\r\n    |  movzx RBd, byte [PC-4+PC2PROTO(numparams)]\r\n    |  test RBd, RBd\r\n    |  jz >2\r\n    |  add RA, 8\r\n    |1:  // Copy fixarg slots up to new frame.\r\n    |  add RA, 8\r\n    |  cmp RA, BASE\r\n    |  jnb >3\t\t\t\t// Less args than parameters?\r\n    |  mov KBASE, [RA-16]\r\n    |  mov [RD], KBASE\r\n    |  add RD, 8\r\n    |  mov aword [RA-16], LJ_TNIL\t// Clear old fixarg slot (help the GC).\r\n    |  sub RBd, 1\r\n    |  jnz <1\r\n    |2:\r\n    if (op == BC_JFUNCV) {\r\n      |  movzx RDd, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov aword [RD], LJ_TNIL\r\n    |  add RD, 8\r\n    |  sub RBd, 1\r\n    |  jnz <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  ins_AD  // BASE = new base, RA = ins RA|RD (unused), RD = nargs+1\r\n    |  mov CFUNC:RB, [BASE-16]\r\n    |  cleartp CFUNC:RB\r\n    |  mov KBASE, CFUNC:RB->f\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RD, [BASE+NARGS:RD*8-8]\r\n    |  mov L:RB->base, BASE\r\n    |  lea RA, [RD+8*LUA_MINSTACK]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  mov L:RB->top, RD\r\n    if (op == BC_FUNCC) {\r\n      |  mov CARG1, L:RB\t\t// Caveat: CARG1 may be RA.\r\n    } else {\r\n      |  mov CARG2, KBASE\r\n      |  mov CARG1, L:RB\t\t// Caveat: CARG1 may be RA.\r\n    }\r\n    |  ja ->vm_growstack_c\t\t// Need to grow stack.\r\n    |  set_vmstate C\r\n    if (op == BC_FUNCC) {\r\n      |  call KBASE\t\t\t// (lua_State *L)\r\n    } else {\r\n      |  // (lua_State *L, lua_CFunction f)\r\n      |  call aword [DISPATCH+DISPATCH_GL(wrapf)]\r\n    }\r\n    |  // nresults returned in eax (RD).\r\n    |  mov BASE, L:RB->base\r\n    |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n    |  set_vmstate INTERP\r\n    |  lea RA, [BASE+RD*8]\r\n    |  neg RA\r\n    |  add RA, L:RB->top\t\t// RA = (L->top-(L->base+nresults))*8\r\n    |  mov PC, [BASE-8]\t\t\t// Fetch PC of caller.\r\n    |  jmp ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n  dasm_growpc(Dst, BC__MAX);\r\n  build_subroutines(ctx);\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 0x10\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 0x7\\n\\t.uleb128 8\\n\"\r\n\t\"\\t.byte 0x80+0x10\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align 8\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.quad .Lbegin\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n#if LJ_NO_UNWIND\r\n\t\"\\t.byte 0x8d\\n\\t.uleb128 0x6\\n\"\t/* offset r13 */\r\n\t\"\\t.byte 0x8c\\n\\t.uleb128 0x7\\n\"\t/* offset r12 */\r\n#endif\r\n\t\"\\t.align 8\\n\"\r\n\t\".LEFDE0:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n\t\"\\t.quad lj_vm_ffi_call\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.align 8\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#if !LJ_NO_UNWIND\r\n#if (defined(__sun__) && defined(__svr4__))\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@unwind\\n\");\r\n#else\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n#endif\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 0x10\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 0x7\\n\\t.uleb128 8\\n\"\r\n\t\"\\t.byte 0x80+0x10\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align 8\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n\t\"\\t.align 8\\n\"\r\n\t\".LEFDE2:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -8\\n\"\r\n\t\"\\t.byte 0x10\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 0x7\\n\\t.uleb128 8\\n\"\r\n\t\"\\t.byte 0x80+0x10\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align 8\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.align 8\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#endif\r\n    break;\r\n#if !LJ_NO_UNWIND\r\n  /* Mental note: never let Apple design an assembler.\r\n  ** Or a linker. Or a plastic case. But I digress.\r\n  */\r\n  case BUILD_machasm: {\r\n#if LJ_HASFFI\r\n    int fcsize = 0;\r\n#endif\r\n    int i;\r\n    fprintf(ctx->fp, \"\\t.section __TEXT,__eh_frame,coalesced,no_toc+strip_static_syms+live_support\\n\");\r\n    fprintf(ctx->fp,\r\n\t\"EH_frame1:\\n\"\r\n\t\"\\t.set L$set$x,LECIEX-LSCIEX\\n\"\r\n\t\"\\t.long L$set$x\\n\"\r\n\t\"LSCIEX:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.ascii \\\"zPR\\\\0\\\"\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.byte 128-8\\n\"\r\n\t\"\\t.byte 0x10\\n\"\r\n\t\"\\t.byte 6\\n\"\t\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x9b\\n\"\t\t\t/* indirect|pcrel|sdata4 */\r\n\t\"\\t.long _lj_err_unwind_dwarf+4@GOTPCREL\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.byte 0x7\\n\\t.byte 8\\n\"\r\n\t\"\\t.byte 0x80+0x10\\n\\t.byte 0x1\\n\"\r\n\t\"\\t.align 3\\n\"\r\n\t\"LECIEX:\\n\\n\");\r\n    for (i = 0; i < ctx->nsym; i++) {\r\n      const char *name = ctx->sym[i].name;\r\n      int32_t size = ctx->sym[i+1].ofs - ctx->sym[i].ofs;\r\n      if (size == 0) continue;\r\n#if LJ_HASFFI\r\n      if (!strcmp(name, \"_lj_vm_ffi_call\")) { fcsize = size; continue; }\r\n#endif\r\n      fprintf(ctx->fp,\r\n\t  \"%s.eh:\\n\"\r\n\t  \"LSFDE%d:\\n\"\r\n\t  \"\\t.set L$set$%d,LEFDE%d-LASFDE%d\\n\"\r\n\t  \"\\t.long L$set$%d\\n\"\r\n\t  \"LASFDE%d:\\n\"\r\n\t  \"\\t.long LASFDE%d-EH_frame1\\n\"\r\n\t  \"\\t.long %s-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n\t  \"\\t.byte 0xe\\n\\t.byte %d\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n\t  \"\\t.byte 0x8f\\n\\t.byte 0x4\\n\"\t\t/* offset r15 */\r\n\t  \"\\t.byte 0x8e\\n\\t.byte 0x5\\n\"\t\t/* offset r14 */\r\n\t  \"\\t.align 3\\n\"\r\n\t  \"LEFDE%d:\\n\\n\",\r\n\t  name, i, i, i, i, i, i, i, name, size, CFRAME_SIZE, i);\r\n    }\r\n#if LJ_HASFFI\r\n    if (fcsize) {\r\n      fprintf(ctx->fp,\r\n\t  \"EH_frame2:\\n\"\r\n\t  \"\\t.set L$set$y,LECIEY-LSCIEY\\n\"\r\n\t  \"\\t.long L$set$y\\n\"\r\n\t  \"LSCIEY:\\n\"\r\n\t  \"\\t.long 0\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.ascii \\\"zR\\\\0\\\"\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.byte 128-8\\n\"\r\n\t  \"\\t.byte 0x10\\n\"\r\n\t  \"\\t.byte 1\\n\"\t\t\t\t/* augmentation length */\r\n\t  \"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t  \"\\t.byte 0xc\\n\\t.byte 0x7\\n\\t.byte 8\\n\"\r\n\t  \"\\t.byte 0x80+0x10\\n\\t.byte 0x1\\n\"\r\n\t  \"\\t.align 3\\n\"\r\n\t  \"LECIEY:\\n\\n\");\r\n      fprintf(ctx->fp,\r\n\t  \"_lj_vm_ffi_call.eh:\\n\"\r\n\t  \"LSFDEY:\\n\"\r\n\t  \"\\t.set L$set$yy,LEFDEY-LASFDEY\\n\"\r\n\t  \"\\t.long L$set$yy\\n\"\r\n\t  \"LASFDEY:\\n\"\r\n\t  \"\\t.long LASFDEY-EH_frame2\\n\"\r\n\t  \"\\t.long _lj_vm_ffi_call-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n\t  \"\\t.byte 0xe\\n\\t.byte 16\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0xd\\n\\t.byte 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n\t  \"\\t.align 3\\n\"\r\n\t  \"LEFDEY:\\n\\n\", fcsize);\r\n    }\r\n#endif\r\n    fprintf(ctx->fp, \".subsections_via_symbols\\n\");\r\n    }\r\n    break;\r\n#endif\r\n  default:  /* Difficult for other modes. */\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/vm_x86.dasc",
    "content": "|// Low-level VM code for x86 CPUs.\r\n|// Bytecode interpreter, fast functions and helper functions.\r\n|// Copyright (C) 2005-2015 Mike Pall. See Copyright Notice in luajit.h\r\n|\r\n|.if P64\r\n|.arch x64\r\n|.else\r\n|.arch x86\r\n|.endif\r\n|.section code_op, code_sub\r\n|\r\n|.actionlist build_actionlist\r\n|.globals GLOB_\r\n|.globalnames globnames\r\n|.externnames extnames\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|.if P64\r\n|.define X64, 1\r\n|.if WIN\r\n|.define X64WIN, 1\r\n|.endif\r\n|.endif\r\n|\r\n|// Fixed register assignments for the interpreter.\r\n|// This is very fragile and has many dependencies. Caveat emptor.\r\n|.define BASE,\t\tedx\t\t// Not C callee-save, refetched anyway.\r\n|.if not X64\r\n|.define KBASE,\t\tedi\t\t// Must be C callee-save.\r\n|.define KBASEa,\tKBASE\r\n|.define PC,\t\tesi\t\t// Must be C callee-save.\r\n|.define PCa,\t\tPC\r\n|.define DISPATCH,\tebx\t\t// Must be C callee-save.\r\n|.elif X64WIN\r\n|.define KBASE,\t\tedi\t\t// Must be C callee-save.\r\n|.define KBASEa,\trdi\r\n|.define PC,\t\tesi\t\t// Must be C callee-save.\r\n|.define PCa,\t\trsi\r\n|.define DISPATCH,\tebx\t\t// Must be C callee-save.\r\n|.else\r\n|.define KBASE,\t\tr15d\t\t// Must be C callee-save.\r\n|.define KBASEa,\tr15\r\n|.define PC,\t\tebx\t\t// Must be C callee-save.\r\n|.define PCa,\t\trbx\r\n|.define DISPATCH,\tr14d\t\t// Must be C callee-save.\r\n|.endif\r\n|\r\n|.define RA,\t\tecx\r\n|.define RAH,\t\tch\r\n|.define RAL,\t\tcl\r\n|.define RB,\t\tebp\t\t// Must be ebp (C callee-save).\r\n|.define RC,\t\teax\t\t// Must be eax.\r\n|.define RCW,\t\tax\r\n|.define RCH,\t\tah\r\n|.define RCL,\t\tal\r\n|.define OP,\t\tRB\r\n|.define RD,\t\tRC\r\n|.define RDW,\t\tRCW\r\n|.define RDL,\t\tRCL\r\n|.if X64\r\n|.define RAa, rcx\r\n|.define RBa, rbp\r\n|.define RCa, rax\r\n|.define RDa, rax\r\n|.else\r\n|.define RAa, RA\r\n|.define RBa, RB\r\n|.define RCa, RC\r\n|.define RDa, RD\r\n|.endif\r\n|\r\n|.if not X64\r\n|.define FCARG1,\tecx\t\t// x86 fastcall arguments.\r\n|.define FCARG2,\tedx\r\n|.elif X64WIN\r\n|.define CARG1,\t\trcx\t\t// x64/WIN64 C call arguments.\r\n|.define CARG2,\t\trdx\r\n|.define CARG3,\t\tr8\r\n|.define CARG4,\t\tr9\r\n|.define CARG1d,\tecx\r\n|.define CARG2d,\tedx\r\n|.define CARG3d,\tr8d\r\n|.define CARG4d,\tr9d\r\n|.define FCARG1,\tCARG1d\t\t// Upwards compatible to x86 fastcall.\r\n|.define FCARG2,\tCARG2d\r\n|.else\r\n|.define CARG1,\t\trdi\t\t// x64/POSIX C call arguments.\r\n|.define CARG2,\t\trsi\r\n|.define CARG3,\t\trdx\r\n|.define CARG4,\t\trcx\r\n|.define CARG5,\t\tr8\r\n|.define CARG6,\t\tr9\r\n|.define CARG1d,\tedi\r\n|.define CARG2d,\tesi\r\n|.define CARG3d,\tedx\r\n|.define CARG4d,\tecx\r\n|.define CARG5d,\tr8d\r\n|.define CARG6d,\tr9d\r\n|.define FCARG1,\tCARG1d\t\t// Simulate x86 fastcall.\r\n|.define FCARG2,\tCARG2d\r\n|.endif\r\n|\r\n|// Type definitions. Some of these are only used for documentation.\r\n|.type L,\t\tlua_State\r\n|.type GL,\t\tglobal_State\r\n|.type TVALUE,\t\tTValue\r\n|.type GCOBJ,\t\tGCobj\r\n|.type STR,\t\tGCstr\r\n|.type TAB,\t\tGCtab\r\n|.type LFUNC,\t\tGCfuncL\r\n|.type CFUNC,\t\tGCfuncC\r\n|.type PROTO,\t\tGCproto\r\n|.type UPVAL,\t\tGCupval\r\n|.type NODE,\t\tNode\r\n|.type NARGS,\t\tint\r\n|.type TRACE,\t\tGCtrace\r\n|.type SBUF,\t\tSBuf\r\n|\r\n|// Stack layout while in interpreter. Must match with lj_frame.h.\r\n|//-----------------------------------------------------------------------\r\n|.if not X64\t\t// x86 stack layout.\r\n|\r\n|.define CFRAME_SPACE,\taword*7\t\t\t// Delta for esp (see <--).\r\n|.macro saveregs_\r\n|  push edi; push esi; push ebx\r\n|  sub esp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push ebp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add esp, CFRAME_SPACE\r\n|  pop ebx; pop esi; pop edi; pop ebp\r\n|.endmacro\r\n|\r\n|.define SAVE_ERRF,\taword [esp+aword*15]\t// vm_pcall/vm_cpcall only.\r\n|.define SAVE_NRES,\taword [esp+aword*14]\r\n|.define SAVE_CFRAME,\taword [esp+aword*13]\r\n|.define SAVE_L,\taword [esp+aword*12]\r\n|//----- 16 byte aligned, ^^^ arguments from C caller\r\n|.define SAVE_RET,\taword [esp+aword*11]\t//<-- esp entering interpreter.\r\n|.define SAVE_R4,\taword [esp+aword*10]\r\n|.define SAVE_R3,\taword [esp+aword*9]\r\n|.define SAVE_R2,\taword [esp+aword*8]\r\n|//----- 16 byte aligned\r\n|.define SAVE_R1,\taword [esp+aword*7]\t//<-- esp after register saves.\r\n|.define SAVE_PC,\taword [esp+aword*6]\r\n|.define TMP2,\t\taword [esp+aword*5]\r\n|.define TMP1,\t\taword [esp+aword*4]\r\n|//----- 16 byte aligned\r\n|.define ARG4,\t\taword [esp+aword*3]\r\n|.define ARG3,\t\taword [esp+aword*2]\r\n|.define ARG2,\t\taword [esp+aword*1]\r\n|.define ARG1,\t\taword [esp]\t\t//<-- esp while in interpreter.\r\n|//----- 16 byte aligned, ^^^ arguments for C callee\r\n|\r\n|// FPARGx overlaps ARGx and ARG(x+1) on x86.\r\n|.define FPARG3,\tqword [esp+qword*1]\r\n|.define FPARG1,\tqword [esp]\r\n|// TMPQ overlaps TMP1/TMP2. ARG5/MULTRES overlap TMP1/TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [esp+aword*4]\r\n|.define TMP3,\t\tARG4\r\n|.define ARG5,\t\tTMP1\r\n|.define TMPa,\t\tTMP1\r\n|.define MULTRES,\tTMP2\r\n|\r\n|// Arguments for vm_call and vm_pcall.\r\n|.define INARG_BASE,\tSAVE_CFRAME\t\t// Overwritten by SAVE_CFRAME!\r\n|\r\n|// Arguments for vm_cpcall.\r\n|.define INARG_CP_CALL,\tSAVE_ERRF\r\n|.define INARG_CP_UD,\tSAVE_NRES\r\n|.define INARG_CP_FUNC,\tSAVE_CFRAME\r\n|\r\n|//-----------------------------------------------------------------------\r\n|.elif X64WIN\t\t// x64/Windows stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rdi; push rsi; push rbx\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|  pop rbx; pop rsi; pop rdi; pop rbp\r\n|.endmacro\r\n|\r\n|.define SAVE_CFRAME,\taword [rsp+aword*13]\r\n|.define SAVE_PC,\tdword [rsp+dword*25]\r\n|.define SAVE_L,\tdword [rsp+dword*24]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*23]\r\n|.define SAVE_NRES,\tdword [rsp+dword*22]\r\n|.define TMP2,\t\tdword [rsp+dword*21]\r\n|.define TMP1,\t\tdword [rsp+dword*20]\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by interpreter\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.define ARG5,\t\taword [rsp+aword*4]\r\n|.define CSAVE_4,\taword [rsp+aword*3]\r\n|.define CSAVE_3,\taword [rsp+aword*2]\r\n|.define CSAVE_2,\taword [rsp+aword*1]\r\n|.define CSAVE_1,\taword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned, ^^^ 32 byte register save area, owned by callee\r\n|\r\n|// TMPQ overlaps TMP1/TMP2. MULTRES overlaps TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [rsp+aword*10]\r\n|.define MULTRES,\tTMP2\r\n|.define TMPa,\t\tARG5\r\n|.define ARG5d,\t\tdword [rsp+aword*4]\r\n|.define TMP3,\t\tARG5d\r\n|\r\n|//-----------------------------------------------------------------------\r\n|.else\t\t\t// x64/POSIX stack layout\r\n|\r\n|.define CFRAME_SPACE,\taword*5\t\t\t// Delta for rsp (see <--).\r\n|.macro saveregs_\r\n|  push rbx; push r15; push r14\r\n|.if NO_UNWIND\r\n|  push r13; push r12\r\n|.endif\r\n|  sub rsp, CFRAME_SPACE\r\n|.endmacro\r\n|.macro saveregs\r\n|  push rbp; saveregs_\r\n|.endmacro\r\n|.macro restoreregs\r\n|  add rsp, CFRAME_SPACE\r\n|.if NO_UNWIND\r\n|  pop r12; pop r13\r\n|.endif\r\n|  pop r14; pop r15; pop rbx; pop rbp\r\n|.endmacro\r\n|\r\n|//----- 16 byte aligned,\r\n|.if NO_UNWIND\r\n|.define SAVE_RET,\taword [rsp+aword*11]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*10]\r\n|.define SAVE_R3,\taword [rsp+aword*9]\r\n|.define SAVE_R2,\taword [rsp+aword*8]\r\n|.define SAVE_R1,\taword [rsp+aword*7]\r\n|.define SAVE_RU2,\taword [rsp+aword*6]\r\n|.define SAVE_RU1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.else\r\n|.define SAVE_RET,\taword [rsp+aword*9]\t//<-- rsp entering interpreter.\r\n|.define SAVE_R4,\taword [rsp+aword*8]\r\n|.define SAVE_R3,\taword [rsp+aword*7]\r\n|.define SAVE_R2,\taword [rsp+aword*6]\r\n|.define SAVE_R1,\taword [rsp+aword*5]\t//<-- rsp after register saves.\r\n|.endif\r\n|.define SAVE_CFRAME,\taword [rsp+aword*4]\r\n|.define SAVE_PC,\tdword [rsp+dword*7]\r\n|.define SAVE_L,\tdword [rsp+dword*6]\r\n|.define SAVE_ERRF,\tdword [rsp+dword*5]\r\n|.define SAVE_NRES,\tdword [rsp+dword*4]\r\n|.define TMPa,\t\taword [rsp+aword*1]\r\n|.define TMP2,\t\tdword [rsp+dword*1]\r\n|.define TMP1,\t\tdword [rsp]\t\t//<-- rsp while in interpreter.\r\n|//----- 16 byte aligned\r\n|\r\n|// TMPQ overlaps TMP1/TMP2. MULTRES overlaps TMP2 (and TMPQ).\r\n|.define TMPQ,\t\tqword [rsp]\r\n|.define TMP3,\t\tdword [rsp+aword*1]\r\n|.define MULTRES,\tTMP2\r\n|\r\n|.endif\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Instruction headers.\r\n|.macro ins_A; .endmacro\r\n|.macro ins_AD; .endmacro\r\n|.macro ins_AJ; .endmacro\r\n|.macro ins_ABC; movzx RB, RCH; movzx RC, RCL; .endmacro\r\n|.macro ins_AB_; movzx RB, RCH; .endmacro\r\n|.macro ins_A_C; movzx RC, RCL; .endmacro\r\n|.macro ins_AND; not RDa; .endmacro\r\n|\r\n|// Instruction decode+dispatch. Carefully tuned (nope, lodsd is not faster).\r\n|.macro ins_NEXT\r\n|  mov RC, [PC]\r\n|  movzx RA, RCH\r\n|  movzx OP, RCL\r\n|  add PC, 4\r\n|  shr RC, 16\r\n|.if X64\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.else\r\n|  jmp aword [DISPATCH+OP*4]\r\n|.endif\r\n|.endmacro\r\n|\r\n|// Instruction footer.\r\n|.if 1\r\n|  // Replicated dispatch. Less unpredictable branches, but higher I-Cache use.\r\n|  .define ins_next, ins_NEXT\r\n|  .define ins_next_, ins_NEXT\r\n|.else\r\n|  // Common dispatch. Lower I-Cache use, only one (very) unpredictable branch.\r\n|  // Affects only certain kinds of benchmarks (and only with -j off).\r\n|  // Around 10%-30% slower on Core2, a lot more slower on P4.\r\n|  .macro ins_next\r\n|    jmp ->ins_next\r\n|  .endmacro\r\n|  .macro ins_next_\r\n|  ->ins_next:\r\n|    ins_NEXT\r\n|  .endmacro\r\n|.endif\r\n|\r\n|// Call decode and dispatch.\r\n|.macro ins_callt\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1, [BASE-4] = PC\r\n|  mov PC, LFUNC:RB->pc\r\n|  mov RA, [PC]\r\n|  movzx OP, RAL\r\n|  movzx RA, RAH\r\n|  add PC, 4\r\n|.if X64\r\n|  jmp aword [DISPATCH+OP*8]\r\n|.else\r\n|  jmp aword [DISPATCH+OP*4]\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro ins_call\r\n|  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n|  mov [BASE-4], PC\r\n|  ins_callt\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n|\r\n|// Macros to test operand types.\r\n|.macro checktp, reg, tp;  cmp dword [BASE+reg*8+4], tp; .endmacro\r\n|.macro checknum, reg, target; checktp reg, LJ_TISNUM; jae target; .endmacro\r\n|.macro checkint, reg, target; checktp reg, LJ_TISNUM; jne target; .endmacro\r\n|.macro checkstr, reg, target; checktp reg, LJ_TSTR; jne target; .endmacro\r\n|.macro checktab, reg, target; checktp reg, LJ_TTAB; jne target; .endmacro\r\n|\r\n|// These operands must be used with movzx.\r\n|.define PC_OP, byte [PC-4]\r\n|.define PC_RA, byte [PC-3]\r\n|.define PC_RB, byte [PC-1]\r\n|.define PC_RC, byte [PC-2]\r\n|.define PC_RD, word [PC-2]\r\n|\r\n|.macro branchPC, reg\r\n|  lea PC, [PC+reg*4-BCBIAS_J*4]\r\n|.endmacro\r\n|\r\n|// Assumes DISPATCH is relative to GL.\r\n#define DISPATCH_GL(field)\t(GG_DISP2G + (int)offsetof(global_State, field))\r\n#define DISPATCH_J(field)\t(GG_DISP2J + (int)offsetof(jit_State, field))\r\n|\r\n#define PC2PROTO(field)  ((int)offsetof(GCproto, field)-(int)sizeof(GCproto))\r\n|\r\n|// Decrement hashed hotcount and trigger trace recorder if zero.\r\n|.macro hotloop, reg\r\n|  mov reg, PC\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_LOOP\r\n|  jb ->vm_hotloop\r\n|.endmacro\r\n|\r\n|.macro hotcall, reg\r\n|  mov reg, PC\r\n|  shr reg, 1\r\n|  and reg, HOTCOUNT_PCMASK\r\n|  sub word [DISPATCH+reg+GG_DISP2HOT], HOTCOUNT_CALL\r\n|  jb ->vm_hotcall\r\n|.endmacro\r\n|\r\n|// Set current VM state.\r\n|.macro set_vmstate, st\r\n|  mov dword [DISPATCH+DISPATCH_GL(vmstate)], ~LJ_VMST_..st\r\n|.endmacro\r\n|\r\n|// x87 compares.\r\n|.macro fcomparepp\t\t\t// Compare and pop st0 >< st1.\r\n|  fucomip st1\r\n|  fpop\r\n|.endmacro\r\n|\r\n|.macro fpop1; fstp st1; .endmacro\r\n|\r\n|// Synthesize SSE FP constants.\r\n|.macro sseconst_abs, reg, tmp\t\t// Synthesize abs mask.\r\n|.if X64\r\n|  mov64 tmp, U64x(7fffffff,ffffffff); movd reg, tmp\r\n|.else\r\n|  pxor reg, reg; pcmpeqd reg, reg; psrlq reg, 1\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro sseconst_hi, reg, tmp, val\t// Synthesize hi-32 bit const.\r\n|.if X64\r\n|  mov64 tmp, U64x(val,00000000); movd reg, tmp\r\n|.else\r\n|  mov tmp, 0x .. val; movd reg, tmp; pshufd reg, reg, 0x51\r\n|.endif\r\n|.endmacro\r\n|\r\n|.macro sseconst_sign, reg, tmp\t\t// Synthesize sign mask.\r\n|  sseconst_hi reg, tmp, 80000000\r\n|.endmacro\r\n|.macro sseconst_1, reg, tmp\t\t// Synthesize 1.0.\r\n|  sseconst_hi reg, tmp, 3ff00000\r\n|.endmacro\r\n|.macro sseconst_m1, reg, tmp\t\t// Synthesize -1.0.\r\n|  sseconst_hi reg, tmp, bff00000\r\n|.endmacro\r\n|.macro sseconst_2p52, reg, tmp\t\t// Synthesize 2^52.\r\n|  sseconst_hi reg, tmp, 43300000\r\n|.endmacro\r\n|.macro sseconst_tobit, reg, tmp\t// Synthesize 2^52 + 2^51.\r\n|  sseconst_hi reg, tmp, 43380000\r\n|.endmacro\r\n|\r\n|// Move table write barrier back. Overwrites reg.\r\n|.macro barrierback, tab, reg\r\n|  and byte tab->marked, (uint8_t)~LJ_GC_BLACK\t// black2gray(tab)\r\n|  mov reg, [DISPATCH+DISPATCH_GL(gc.grayagain)]\r\n|  mov [DISPATCH+DISPATCH_GL(gc.grayagain)], tab\r\n|  mov tab->gclist, reg\r\n|.endmacro\r\n|\r\n|//-----------------------------------------------------------------------\r\n\r\n/* Generate subroutines used by opcodes and other parts of the VM. */\r\n/* The .code_sub section should be last to help static branch prediction. */\r\nstatic void build_subroutines(BuildCtx *ctx)\r\n{\r\n  |.code_sub\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Return handling ----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_returnp:\r\n  |  test PC, FRAME_P\r\n  |  jz ->cont_dispatch\r\n  |\r\n  |  // Return from pcall or xpcall fast func.\r\n  |  and PC, -8\r\n  |  sub BASE, PC\t\t\t// Restore caller base.\r\n  |  lea RAa, [RA+PC-8]\t\t\t// Rebase RA and prepend one result.\r\n  |  mov PC, [BASE-4]\t\t\t// Fetch PC of previous frame.\r\n  |  // Prepending may overwrite the pcall frame, so do it at the end.\r\n  |  mov dword [BASE+RA+4], LJ_TTRUE\t// Prepend true to results.\r\n  |\r\n  |->vm_returnc:\r\n  |  add RD, 1\t\t\t\t// RD = nresults+1\r\n  |  jz ->vm_unwind_yield\r\n  |  mov MULTRES, RD\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\t\t\t// Handle regular return to Lua.\r\n  |\r\n  |->vm_return:\r\n  |  // BASE = base, RA = resultofs, RD = nresults+1 (= MULTRES), PC = return\r\n  |  xor PC, FRAME_C\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz ->vm_returnp\r\n  |\r\n  |  // Return to C.\r\n  |  set_vmstate C\r\n  |  and PC, -8\r\n  |  sub PC, BASE\r\n  |  neg PC\t\t\t\t// Previous base = BASE - delta.\r\n  |\r\n  |  sub RD, 1\r\n  |  jz >2\r\n  |1:  // Move results down.\r\n  |.if X64\r\n  |  mov RBa, [BASE+RA]\r\n  |  mov [BASE-8], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RA]\r\n  |  mov [BASE-8], RB\r\n  |  mov RB, [BASE+RA+4]\r\n  |  mov [BASE-4], RB\r\n  |.endif\r\n  |  add BASE, 8\r\n  |  sub RD, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, PC\r\n  |3:\r\n  |  mov RD, MULTRES\r\n  |  mov RA, SAVE_NRES\t\t\t// RA = wanted nresults+1\r\n  |4:\r\n  |  cmp RA, RD\r\n  |  jne >6\t\t\t\t// More/less results wanted?\r\n  |5:\r\n  |  sub BASE, 8\r\n  |  mov L:RB->top, BASE\r\n  |\r\n  |->vm_leave_cp:\r\n  |  mov RAa, SAVE_CFRAME\t\t// Restore previous C frame.\r\n  |  mov L:RB->cframe, RAa\r\n  |  xor eax, eax\t\t\t// Ok return status for vm_pcall.\r\n  |\r\n  |->vm_leave_unw:\r\n  |  restoreregs\r\n  |  ret\r\n  |\r\n  |6:\r\n  |  jb >7\t\t\t\t// Less results wanted?\r\n  |  // More results wanted. Check stack size and fill up results with nil.\r\n  |  cmp BASE, L:RB->maxstack\r\n  |  ja >8\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  add BASE, 8\r\n  |  add RD, 1\r\n  |  jmp <4\r\n  |\r\n  |7:  // Less results wanted.\r\n  |  test RA, RA\r\n  |  jz <5\t\t\t\t// But check for LUA_MULTRET+1.\r\n  |  sub RA, RD\t\t\t\t// Negative result!\r\n  |  lea BASE, [BASE+RA*8]\t\t// Correct top.\r\n  |  jmp <5\r\n  |\r\n  |8:  // Corner case: need to grow stack for filling up results.\r\n  |  // This can happen if:\r\n  |  // - A C function grows the stack (a lot).\r\n  |  // - The GC shrinks the stack in between.\r\n  |  // - A return back from a lua_call() with (high) nresults adjustment.\r\n  |  mov L:RB->top, BASE\t\t// Save current top held in BASE (yes).\r\n  |  mov MULTRES, RD\t\t\t// Need to fill only remainder with nil.\r\n  |  mov FCARG2, RA\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->top\t\t// Need the (realloced) L->top in BASE.\r\n  |  jmp <3\r\n  |\r\n  |->vm_unwind_yield:\r\n  |  mov al, LUA_YIELD\r\n  |  jmp ->vm_unwind_c_eh\r\n  |\r\n  |->vm_unwind_c@8:\t\t\t// Unwind C stack, return from vm_pcall.\r\n  |  // (void *cframe, int errcode)\r\n  |.if X64\r\n  |  mov eax, CARG2d\t\t\t// Error return status for vm_pcall.\r\n  |  mov rsp, CARG1\r\n  |.else\r\n  |  mov eax, FCARG2\t\t\t// Error return status for vm_pcall.\r\n  |  mov esp, FCARG1\r\n  |.endif\r\n  |->vm_unwind_c_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov GL:RB, L:RB->glref\r\n  |  mov dword GL:RB->vmstate, ~LJ_VMST_C\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |->vm_unwind_rethrow:\r\n  |.if X64 and not X64WIN\r\n  |  mov FCARG1, SAVE_L\r\n  |  mov FCARG2, eax\r\n  |  restoreregs\r\n  |  jmp extern lj_err_throw@8\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |->vm_unwind_ff@4:\t\t\t// Unwind C stack, return from ff pcall.\r\n  |  // (void *cframe)\r\n  |.if X64\r\n  |  and CARG1, CFRAME_RAWMASK\r\n  |  mov rsp, CARG1\r\n  |.else\r\n  |  and FCARG1, CFRAME_RAWMASK\r\n  |  mov esp, FCARG1\r\n  |.endif\r\n  |->vm_unwind_ff_eh:\t\t\t// Landing pad for external unwinder.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RAa, -8\t\t\t// Results start at BASE+RA = BASE-8.\r\n  |  mov RD, 1+1\t\t\t// Really 1+2 results, incr. later.\r\n  |  mov BASE, L:RB->base\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov PC, [BASE-4]\t\t\t// Fetch PC of previous frame.\r\n  |  mov dword [BASE-4], LJ_TFALSE\t// Prepend false to error message.\r\n  |  set_vmstate INTERP\r\n  |  jmp ->vm_returnc\t\t\t// Increments RD/MULTRES and returns.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Grow stack for calls -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_growstack_c:\t\t\t// Grow stack for C function.\r\n  |  mov FCARG2, LUA_MINSTACK\r\n  |  jmp >2\r\n  |\r\n  |->vm_growstack_v:\t\t\t// Grow stack for vararg Lua function.\r\n  |  sub RD, 8\r\n  |  jmp >1\r\n  |\r\n  |->vm_growstack_f:\t\t\t// Grow stack for fixarg Lua function.\r\n  |  // BASE = new base, RD = nargs+1, RB = L, PC = first PC\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |1:\r\n  |  movzx RA, byte [PC-4+PC2PROTO(framesize)]\r\n  |  add PC, 4\t\t\t\t// Must point after first instruction.\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov SAVE_PC, PC\r\n  |  mov FCARG2, RA\r\n  |2:\r\n  |  // RB = L, L->base = new base, L->top = top\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  sub RD, BASE\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  // BASE = new base, RB = LFUNC, RD = nargs+1\r\n  |  ins_callt\t\t\t\t// Just retry the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Entry points into the assembler VM ---------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_resume:\t\t\t\t// Setup C frame and resume thread.\r\n  |  // (lua_State *L, TValue *base, int nres1 = 0, ptrdiff_t ef = 0)\r\n  |  saveregs\r\n  |.if X64\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |  mov RA, CARG2d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RA, INARG_BASE\t\t\t// Caveat: overlaps SAVE_CFRAME!\r\n  |.endif\r\n  |  mov PC, FRAME_CP\r\n  |  xor RD, RD\r\n  |  lea KBASEa, [esp+CFRAME_RESUME]\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |  mov SAVE_PC, RD\t\t\t// Any value outside of bytecode is ok.\r\n  |  mov SAVE_CFRAME, RDa\r\n  |.if X64\r\n  |  mov SAVE_NRES, RD\r\n  |  mov SAVE_ERRF, RD\r\n  |.endif\r\n  |  mov L:RB->cframe, KBASEa\r\n  |  cmp byte L:RB->status, RDL\r\n  |  je >2\t\t\t\t// Initial resume (like a call).\r\n  |\r\n  |  // Resume after yield (like a return).\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |  mov byte L:RB->status, RDL\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr RD, 3\r\n  |  add RD, 1\t\t\t\t// RD = nresults+1\r\n  |  sub RA, BASE\t\t\t// RA = resultofs\r\n  |  mov PC, [BASE-4]\r\n  |  mov MULTRES, RD\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |->vm_pcall:\t\t\t\t// Setup protected C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1, ptrdiff_t ef)\r\n  |  saveregs\r\n  |  mov PC, FRAME_CP\r\n  |.if X64\r\n  |  mov SAVE_ERRF, CARG4d\r\n  |.endif\r\n  |  jmp >1\r\n  |\r\n  |->vm_call:\t\t\t\t// Setup C frame and enter VM.\r\n  |  // (lua_State *L, TValue *base, int nres1)\r\n  |  saveregs\r\n  |  mov PC, FRAME_C\r\n  |\r\n  |1:  // Entry point for vm_pcall above (PC = ftype).\r\n  |.if X64\r\n  |  mov SAVE_NRES, CARG3d\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |  mov RA, CARG2d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov RA, INARG_BASE\t\t\t// Caveat: overlaps SAVE_CFRAME!\r\n  |.endif\r\n  |\r\n  |  mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  mov KBASEa, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASEa\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |  add DISPATCH, GG_G2DISP\r\n  |.if X64\r\n  |  mov L:RB->cframe, rsp\r\n  |.else\r\n  |  mov L:RB->cframe, esp\r\n  |.endif\r\n  |\r\n  |2:  // Entry point for vm_resume/vm_cpcall (RA = base, RB = L, PC = ftype).\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RB->base\t\t// BASE = old base (used in vmeta_call).\r\n  |  add PC, RA\r\n  |  sub PC, BASE\t\t\t// PC = frame delta + frame type\r\n  |\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, RA\r\n  |  shr NARGS:RD, 3\r\n  |  add NARGS:RD, 1\t\t\t// RD = nargs+1\r\n  |\r\n  |->vm_call_dispatch:\r\n  |  mov LFUNC:RB, [RA-8]\r\n  |  cmp dword [RA-4], LJ_TFUNC\r\n  |  jne ->vmeta_call\t\t\t// Ensure KBASE defined and != BASE.\r\n  |\r\n  |->vm_call_dispatch_f:\r\n  |  mov BASE, RA\r\n  |  ins_call\r\n  |  // BASE = new base, RB = func, RD = nargs+1, PC = caller PC\r\n  |\r\n  |->vm_cpcall:\t\t\t\t// Setup protected C frame, call C.\r\n  |  // (lua_State *L, lua_CFunction func, void *ud, lua_CPFunction cp)\r\n  |  saveregs\r\n  |.if X64\r\n  |  mov L:RB, CARG1d\t\t\t// Caveat: CARG1d may be RA.\r\n  |  mov SAVE_L, CARG1d\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  // Caveat: INARG_CP_* and SAVE_CFRAME/SAVE_NRES/SAVE_ERRF overlap!\r\n  |  mov RC, INARG_CP_UD\t\t// Get args before they are overwritten.\r\n  |  mov RA, INARG_CP_FUNC\r\n  |  mov BASE, INARG_CP_CALL\r\n  |.endif\r\n  |  mov SAVE_PC, L:RB\t\t\t// Any value outside of bytecode is ok.\r\n  |\r\n  |  mov KBASE, L:RB->stack\t\t// Compute -savestack(L, L->top).\r\n  |  sub KBASE, L:RB->top\r\n  |   mov DISPATCH, L:RB->glref\t\t// Setup pointer to dispatch table.\r\n  |  mov SAVE_ERRF, 0\t\t\t// No error function.\r\n  |  mov SAVE_NRES, KBASE\t\t// Neg. delta means cframe w/o frame.\r\n  |   add DISPATCH, GG_G2DISP\r\n  |  // Handler may change cframe_nres(L->cframe) or cframe_errfunc(L->cframe).\r\n  |\r\n  |.if X64\r\n  |  mov KBASEa, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASEa\r\n  |  mov L:RB->cframe, rsp\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |\r\n  |  call CARG4\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.else\r\n  |  mov ARG3, RC\t\t\t// Have to copy args downwards.\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |\r\n  |  mov KBASE, L:RB->cframe\t\t// Add our C frame to cframe chain.\r\n  |  mov SAVE_CFRAME, KBASE\r\n  |  mov L:RB->cframe, esp\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |\r\n  |  call BASE\t\t\t// (lua_State *L, lua_CFunction func, void *ud)\r\n  |.endif\r\n  |  // TValue * (new base) or NULL returned in eax (RC).\r\n  |  test RC, RC\r\n  |  jz ->vm_leave_cp\t\t\t// No base? Just remove C frame.\r\n  |  mov RA, RC\r\n  |  mov PC, FRAME_CP\r\n  |  jmp <2\t\t\t\t// Else continue with the call.\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Metamethod handling ------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |//-- Continuation dispatch ----------------------------------------------\r\n  |\r\n  |->cont_dispatch:\r\n  |  // BASE = meta base, RA = resultofs, RD = nresults+1 (also in MULTRES)\r\n  |  add RA, BASE\r\n  |  and PC, -8\r\n  |  mov RB, BASE\r\n  |  sub BASE, PC\t\t\t// Restore caller BASE.\r\n  |  mov dword [RA+RD*8-4], LJ_TNIL\t// Ensure one valid arg.\r\n  |  mov RC, RA\t\t\t\t// ... in [RC]\r\n  |  mov PC, [RB-12]\t\t\t// Restore PC from [cont|PC].\r\n  |.if X64\r\n  |  movsxd RAa, dword [RB-16]\t\t// May be negative on WIN64 with debug.\r\n  |.if FFI\r\n  |  cmp RA, 1\r\n  |  jbe >1\r\n  |.endif\r\n  |  lea KBASEa, qword [=>0]\r\n  |  add RAa, KBASEa\r\n  |.else\r\n  |  mov RA, dword [RB-16]\r\n  |.if FFI\r\n  |  cmp RA, 1\r\n  |  jbe >1\r\n  |.endif\r\n  |.endif\r\n  |  mov LFUNC:KBASE, [BASE-8]\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  // BASE = base, RC = result, RB = meta base\r\n  |  jmp RAa\t\t\t\t// Jump to continuation.\r\n  |\r\n  |.if FFI\r\n  |1:\r\n  |  je ->cont_ffi_callback\t\t// cont = 1: return from FFI callback.\r\n  |  // cont = 0: Tail call from C function.\r\n  |  sub RB, BASE\r\n  |  shr RB, 3\r\n  |  lea RD, [RB-1]\r\n  |  jmp ->vm_call_tail\r\n  |.endif\r\n  |\r\n  |->cont_cat:\t\t\t\t// BASE = base, RC = result, RB = mbase\r\n  |  movzx RA, PC_RB\r\n  |  sub RB, 16\r\n  |  lea RA, [BASE+RA*8]\r\n  |  sub RA, RB\r\n  |  je ->cont_ra\r\n  |  neg RA\r\n  |  shr RA, 3\r\n  |.if X64WIN\r\n  |  mov CARG3d, RA\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\r\n  |  mov RCa, [RC]\r\n  |  mov [RB], RCa\r\n  |  mov CARG2d, RB\r\n  |.elif X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\r\n  |  mov CARG3d, RA\r\n  |  mov RAa, [RC]\r\n  |  mov [RB], RAa\r\n  |  mov CARG2d, RB\r\n  |.else\r\n  |  mov ARG3, RA\r\n  |  mov RA, [RC+4]\r\n  |  mov RC, [RC]\r\n  |  mov [RB+4], RA\r\n  |  mov [RB], RC\r\n  |  mov ARG2, RB\r\n  |.endif\r\n  |  jmp ->BC_CAT_Z\r\n  |\r\n  |//-- Table indexing metamethods -----------------------------------------\r\n  |\r\n  |->vmeta_tgets:\r\n  |  mov TMP1, RC\t\t\t// RC = GCstr *\r\n  |  mov TMP2, LJ_TSTR\r\n  |  lea RCa, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n  |  cmp PC_OP, BC_GGET\r\n  |  jne >1\r\n  |  lea RA, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RA], TAB:RB\t\t\t// RB = GCtab *\r\n  |  mov dword [RA+4], LJ_TTAB\r\n  |  mov RB, RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tgetb:\r\n  |  movzx RC, PC_RC\r\n  |.if DUALNUM\r\n  |  mov TMP2, LJ_TISNUM\r\n  |  mov TMP1, RC\r\n  |.else\r\n  |  cvtsi2sd xmm0, RC\r\n  |  movsd TMPQ, xmm0\r\n  |.endif\r\n  |  lea RCa, TMPQ\t\t\t// Store temp. TValue in TMPQ.\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tgetv:\r\n  |  movzx RC, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RB, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |.if X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RB\r\n  |  mov CARG3, RCa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG2, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tget\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |->cont_ra:\t\t\t\t// BASE = base, RC = result\r\n  |  movzx RA, PC_RA\r\n  |.if X64\r\n  |  mov RBa, [RC]\r\n  |  mov [BASE+RA*8], RBa\r\n  |.else\r\n  |  mov RB, [RC+4]\r\n  |  mov RC, [RC]\r\n  |  mov [BASE+RA*8+4], RB\r\n  |  mov [BASE+RA*8], RC\r\n  |.endif\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __index metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-8]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RD, 2+1\t\t\t// 2 args for func(t, k).\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tgetr:\r\n  |  mov FCARG1, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov FCARG2, RC\t\t\t// Caveat: FCARG2 == BASE\r\n  |  call extern lj_tab_getinth@8\t// (GCtab *t, int32_t key)\r\n  |  // cTValue * or NULL returned in eax (RC).\r\n  |  movzx RA, PC_RA\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  test RC, RC\r\n  |  jnz ->BC_TGETR_Z\r\n  |  mov dword [BASE+RA*8+4], LJ_TNIL\r\n  |  jmp ->BC_TGETR2_Z\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vmeta_tsets:\r\n  |  mov TMP1, RC\t\t\t// RC = GCstr *\r\n  |  mov TMP2, LJ_TSTR\r\n  |  lea RCa, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n  |  cmp PC_OP, BC_GSET\r\n  |  jne >1\r\n  |  lea RA, [DISPATCH+DISPATCH_GL(tmptv)]  // Store fn->l.env in g->tmptv.\r\n  |  mov [RA], TAB:RB\t\t\t// RB = GCtab *\r\n  |  mov dword [RA+4], LJ_TTAB\r\n  |  mov RB, RA\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_tsetb:\r\n  |  movzx RC, PC_RC\r\n  |.if DUALNUM\r\n  |  mov TMP2, LJ_TISNUM\r\n  |  mov TMP1, RC\r\n  |.else\r\n  |  cvtsi2sd xmm0, RC\r\n  |  movsd TMPQ, xmm0\r\n  |.endif\r\n  |  lea RCa, TMPQ\t\t\t// Store temp. TValue in TMPQ.\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_tsetv:\r\n  |  movzx RC, PC_RC\t\t\t// Reload TValue *k from RC.\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  movzx RB, PC_RB\t\t\t// Reload TValue *t from RB.\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |.if X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RB\r\n  |  mov CARG3, RCa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG2, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_tset\t\t// (lua_State *L, TValue *o, TValue *k)\r\n  |  // TValue * (finished) or NULL (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz >3\r\n  |  // NOBARRIER: lj_meta_tset ensures the table is not black.\r\n  |  movzx RA, PC_RA\r\n  |.if X64\r\n  |  mov RBa, [BASE+RA*8]\r\n  |  mov [RC], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RA*8+4]\r\n  |  mov RA, [BASE+RA*8]\r\n  |  mov [RC+4], RB\r\n  |  mov [RC], RA\r\n  |.endif\r\n  |->cont_nop:\t\t\t\t// BASE = base, (RC = result)\r\n  |  ins_next\r\n  |\r\n  |3:  // Call __newindex metamethod.\r\n  |  // BASE = base, L->top = new base, stack = cont/func/t/k/(v)\r\n  |  mov RA, L:RB->top\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  movzx RC, PC_RA\r\n  |  // Copy value to third argument.\r\n  |.if X64\r\n  |  mov RBa, [BASE+RC*8]\r\n  |  mov [RA+16], RBa\r\n  |.else\r\n  |  mov RB, [BASE+RC*8+4]\r\n  |  mov RC, [BASE+RC*8]\r\n  |  mov [RA+20], RB\r\n  |  mov [RA+16], RC\r\n  |.endif\r\n  |  lea PC, [RA+FRAME_CONT]\r\n  |  sub PC, BASE\r\n  |  mov LFUNC:RB, [RA-8]\t\t// Guaranteed to be a function here.\r\n  |  mov NARGS:RD, 3+1\t\t\t// 3 args for func(t, k, v).\r\n  |  jmp ->vm_call_dispatch_f\r\n  |\r\n  |->vmeta_tsetr:\r\n  |.if X64WIN\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov CARG3d, RC\r\n  |  mov L:CARG1d->base, BASE\r\n  |  xchg CARG2d, TAB:RB\t\t// Caveat: CARG2d == BASE.\r\n  |.elif X64\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov CARG2d, TAB:RB\r\n  |  mov L:CARG1d->base, BASE\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG3d, RC\t\t\t// Caveat: CARG3d == BASE.\r\n  |.else\r\n  |  mov L:RA, SAVE_L\r\n  |  mov ARG2, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RA\r\n  |  mov L:RA->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_tab_setinth  // (lua_State *L, GCtab *t, int32_t key)\r\n  |  // TValue * returned in eax (RC).\r\n  |  movzx RA, PC_RA\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  jmp ->BC_TSETR_Z\r\n  |\r\n  |//-- Comparison metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_comp:\r\n  |.if X64\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d == BASE.\r\n  |.if X64WIN\r\n  |  lea CARG3d, [BASE+RD*8]\r\n  |  lea CARG2d, [BASE+RA*8]\r\n  |.else\r\n  |  lea CARG2d, [BASE+RA*8]\r\n  |  lea CARG3d, [BASE+RD*8]\r\n  |.endif\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d/CARG4d == RA.\r\n  |  movzx CARG4d, PC_OP\r\n  |.else\r\n  |  movzx RB, PC_OP\r\n  |  lea RD, [BASE+RD*8]\r\n  |  lea RA, [BASE+RA*8]\r\n  |  mov ARG4, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RD\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_comp\t// (lua_State *L, TValue *o1, *o2, int op)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |  cmp RC, 1\r\n  |  ja ->vmeta_binop\r\n  |4:\r\n  |  lea PC, [PC+4]\r\n  |  jb >6\r\n  |5:\r\n  |  movzx RD, PC_RD\r\n  |  branchPC RD\r\n  |6:\r\n  |  ins_next\r\n  |\r\n  |->cont_condt:\t\t\t// BASE = base, RC = result\r\n  |  add PC, 4\r\n  |  cmp dword [RC+4], LJ_TISTRUECOND\t// Branch if result is true.\r\n  |  jb <5\r\n  |  jmp <6\r\n  |\r\n  |->cont_condf:\t\t\t// BASE = base, RC = result\r\n  |  cmp dword [RC+4], LJ_TISTRUECOND\t// Branch if result is false.\r\n  |  jmp <4\r\n  |\r\n  |->vmeta_equal:\r\n  |  sub PC, 4\r\n  |.if X64WIN\r\n  |  mov CARG3d, RD\r\n  |  mov CARG4d, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d == RA.\r\n  |.elif X64\r\n  |  mov CARG2d, RA\r\n  |  mov CARG4d, RB\t\t\t// Caveat: CARG4d == RA.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG3d, RD\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG4, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RD\r\n  |  mov ARG2, RA\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal\t// (lua_State *L, GCobj *o1, *o2, int ne)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |\r\n  |->vmeta_equal_cd:\r\n  |.if FFI\r\n  |  sub PC, 4\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG1, L:RB\r\n  |  mov FCARG2, dword [PC-4]\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_equal_cd@8\t// (lua_State *L, BCIns ins)\r\n  |  // 0/1 or TValue * (metamethod) returned in eax (RC).\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vmeta_istype:\r\n  |.if X64\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RA\r\n  |  movzx CARG3d, PC_RD\r\n  |  mov L:CARG1d, L:RB\r\n  |.else\r\n  |  movzx RD, PC_RD\r\n  |  mov ARG2, RA\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG3, RD\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_istype  // (lua_State *L, BCReg ra, BCReg tp)\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <6\r\n  |\r\n  |//-- Arithmetic metamethods ---------------------------------------------\r\n  |\r\n  |->vmeta_arith_vno:\r\n  |.if DUALNUM\r\n  |  movzx RB, PC_RB\r\n  |.endif\r\n  |->vmeta_arith_vn:\r\n  |  lea RC, [KBASE+RC*8]\r\n  |  jmp >1\r\n  |\r\n  |->vmeta_arith_nvo:\r\n  |.if DUALNUM\r\n  |  movzx RC, PC_RC\r\n  |.endif\r\n  |->vmeta_arith_nv:\r\n  |  lea RC, [KBASE+RC*8]\r\n  |  lea RB, [BASE+RB*8]\r\n  |  xchg RB, RC\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_unm:\r\n  |  lea RC, [BASE+RD*8]\r\n  |  mov RB, RC\r\n  |  jmp >2\r\n  |\r\n  |->vmeta_arith_vvo:\r\n  |.if DUALNUM\r\n  |  movzx RB, PC_RB\r\n  |.endif\r\n  |->vmeta_arith_vv:\r\n  |  lea RC, [BASE+RC*8]\r\n  |1:\r\n  |  lea RB, [BASE+RB*8]\r\n  |2:\r\n  |  lea RA, [BASE+RA*8]\r\n  |.if X64WIN\r\n  |  mov CARG3d, RB\r\n  |  mov CARG4d, RC\r\n  |  movzx RC, PC_OP\r\n  |  mov ARG5d, RC\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d == RA.\r\n  |.elif X64\r\n  |  movzx CARG5d, PC_OP\r\n  |  mov CARG2d, RA\r\n  |  mov CARG4d, RC\t\t\t// Caveat: CARG4d == RA.\r\n  |  mov L:CARG1d, SAVE_L\r\n  |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG3d, RB\r\n  |  mov L:RB, L:CARG1d\r\n  |.else\r\n  |  mov ARG3, RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG4, RC\r\n  |  movzx RC, PC_OP\r\n  |  mov ARG2, RA\r\n  |  mov ARG5, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_arith\t// (lua_State *L, TValue *ra,*rb,*rc, BCReg op)\r\n  |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n  |  test RC, RC\r\n  |  jz ->cont_nop\r\n  |\r\n  |  // Call metamethod for binary op.\r\n  |->vmeta_binop:\r\n  |  // BASE = base, RC = new base, stack = cont/func/o1/o2\r\n  |  mov RA, RC\r\n  |  sub RC, BASE\r\n  |  mov [RA-12], PC\t\t\t// [cont|PC]\r\n  |  lea PC, [RC+FRAME_CONT]\r\n  |  mov NARGS:RD, 2+1\t\t\t// 2 args for func(o1, o2).\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |->vmeta_len:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  lea FCARG2, [BASE+RD*8]\t\t// Caveat: FCARG2 == BASE\r\n  |  mov L:FCARG1, L:RB\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_len@8\t\t// (lua_State *L, TValue *o)\r\n  |  // NULL (retry) or TValue * (metamethod) returned in eax (RC).\r\n  |  mov BASE, L:RB->base\r\n#if LJ_52\r\n  |  test RC, RC\r\n  |  jne ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n  |  movzx RD, PC_RD\r\n  |  mov TAB:FCARG1, [BASE+RD*8]\r\n  |  jmp ->BC_LEN_Z\r\n#else\r\n  |  jmp ->vmeta_binop\t\t\t// Binop call for compatibility.\r\n#endif\r\n  |\r\n  |//-- Call metamethod ----------------------------------------------------\r\n  |\r\n  |->vmeta_call_ra:\r\n  |  lea RA, [BASE+RA*8+8]\r\n  |->vmeta_call:\t\t\t// Resolve and call __call metamethod.\r\n  |  // BASE = old base, RA = new base, RC = nargs+1, PC = return\r\n  |  mov TMP2, RA\t\t\t// Save RA, RC for us.\r\n  |  mov TMP1, NARGS:RD\r\n  |  sub RA, 8\r\n  |.if X64\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n  |  mov CARG2d, RA\r\n  |  lea CARG3d, [RA+NARGS:RD*8]\r\n  |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n  |.else\r\n  |  lea RC, [RA+NARGS:RD*8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG2, RA\r\n  |  mov ARG3, RC\r\n  |  mov ARG1, L:RB\r\n  |  mov L:RB->base, BASE\t\t// This is the callers base!\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_call\t// (lua_State *L, TValue *func, TValue *top)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RA, TMP2\r\n  |  mov NARGS:RD, TMP1\r\n  |  mov LFUNC:RB, [RA-8]\r\n  |  add NARGS:RD, 1\r\n  |  // This is fragile. L->base must not move, KBASE must always be defined.\r\n  |  cmp KBASE, BASE\t\t\t// Continue with CALLT if flag set.\r\n  |  je ->BC_CALLT_Z\r\n  |  mov BASE, RA\r\n  |  ins_call\t\t\t\t// Otherwise call resolved metamethod.\r\n  |\r\n  |//-- Argument coercion for 'for' statement ------------------------------\r\n  |\r\n  |->vmeta_for:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, RA\t\t\t// Caveat: FCARG2 == BASE\r\n  |  mov L:FCARG1, L:RB\t\t\t// Caveat: FCARG1 == RA\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_meta_for@8\t// (lua_State *L, TValue *base)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RC, [PC-4]\r\n  |  movzx RA, RCH\r\n  |  movzx OP, RCL\r\n  |  shr RC, 16\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Retry FORI or JFORI.\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4+GG_DISP2STATIC]\t// Retry FORI or JFORI.\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Fast functions -----------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |.macro .ffunc, name\r\n  |->ff_ .. name:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_1, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RD, 1+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_2, name\r\n  |->ff_ .. name:\r\n  |  cmp NARGS:RD, 2+1;  jb ->fff_fallback\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nsse, name, op\r\n  |  .ffunc_1 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  op xmm0, qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nsse, name\r\n  |  .ffunc_nsse name, movsd\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nnsse, name\r\n  |  .ffunc_2 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM;  jae ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |  movsd xmm1, qword [BASE+8]\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_nnr, name\r\n  |  .ffunc_2 name\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  jae ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM;  jae ->fff_fallback\r\n  |  fld qword [BASE+8]\r\n  |  fld qword [BASE]\r\n  |.endmacro\r\n  |\r\n  |// Inlined GC threshold check. Caveat: uses label 1.\r\n  |.macro ffgccheck\r\n  |  mov RB, [DISPATCH+DISPATCH_GL(gc.total)]\r\n  |  cmp RB, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n  |  jb >1\r\n  |  call ->fff_gcstep\r\n  |1:\r\n  |.endmacro\r\n  |\r\n  |//-- Base library: checks -----------------------------------------------\r\n  |\r\n  |.ffunc_1 assert\r\n  |  mov RB, [BASE+4]\r\n  |  cmp RB, LJ_TISTRUECOND;  jae ->fff_fallback\r\n  |  mov PC, [BASE-4]\r\n  |  mov MULTRES, RD\r\n  |  mov [BASE-4], RB\r\n  |  mov RB, [BASE]\r\n  |  mov [BASE-8], RB\r\n  |  sub RD, 2\r\n  |  jz >2\r\n  |  mov RA, BASE\r\n  |1:\r\n  |  add RA, 8\r\n  |.if X64\r\n  |  mov RBa, [RA]\r\n  |  mov [RA-8], RBa\r\n  |.else\r\n  |  mov RB, [RA+4]\r\n  |  mov [RA-4], RB\r\n  |  mov RB, [RA]\r\n  |  mov [RA-8], RB\r\n  |.endif\r\n  |  sub RD, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  mov RD, MULTRES\r\n  |  jmp ->fff_res_\r\n  |\r\n  |.ffunc_1 type\r\n  |  mov RB, [BASE+4]\r\n  |.if X64\r\n  |  mov RA, RB\r\n  |  sar RA, 15\r\n  |  cmp RA, -2\r\n  |  je >3\r\n  |.endif\r\n  |  mov RC, ~LJ_TNUMX\r\n  |  not RB\r\n  |  cmp RC, RB\r\n  |  cmova RC, RB\r\n  |2:\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov STR:RC, [CFUNC:RB+RC*8+((char *)(&((GCfuncC *)0)->upvalue))]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RC\r\n  |  jmp ->fff_res1\r\n  |.if X64\r\n  |3:\r\n  |  mov RC, ~LJ_TLIGHTUD\r\n  |  jmp <2\r\n  |.endif\r\n  |\r\n  |//-- Base library: getters and setters ---------------------------------\r\n  |\r\n  |.ffunc_1 getmetatable\r\n  |  mov RB, [BASE+4]\r\n  |  mov PC, [BASE-4]\r\n  |  cmp RB, LJ_TTAB;  jne >6\r\n  |1:  // Field metatable must be at same offset for GCtab and GCudata!\r\n  |  mov TAB:RB, [BASE]\r\n  |  mov TAB:RB, TAB:RB->metatable\r\n  |2:\r\n  |  test TAB:RB, TAB:RB\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  jz ->fff_res1\r\n  |  mov STR:RC, [DISPATCH+DISPATCH_GL(gcroot)+4*(GCROOT_MMNAME+MM_metatable)]\r\n  |  mov dword [BASE-4], LJ_TTAB\t// Store metatable as default result.\r\n  |  mov [BASE-8], TAB:RB\r\n  |  mov RA, TAB:RB->hmask\r\n  |  and RA, STR:RC->hash\r\n  |  imul RA, #NODE\r\n  |  add NODE:RA, TAB:RB->node\r\n  |3:  // Rearranged logic, because we expect _not_ to find the key.\r\n  |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n  |  jne >4\r\n  |  cmp dword NODE:RA->key.gcr, STR:RC\r\n  |  je >5\r\n  |4:\r\n  |  mov NODE:RA, NODE:RA->next\r\n  |  test NODE:RA, NODE:RA\r\n  |  jnz <3\r\n  |  jmp ->fff_res1\t\t\t// Not found, keep default result.\r\n  |5:\r\n  |  mov RB, [RA+4]\r\n  |  cmp RB, LJ_TNIL;  je ->fff_res1\t// Ditto for nil value.\r\n  |  mov RC, [RA]\r\n  |  mov [BASE-4], RB\t\t\t// Return value of mt.__metatable.\r\n  |  mov [BASE-8], RC\r\n  |  jmp ->fff_res1\r\n  |\r\n  |6:\r\n  |  cmp RB, LJ_TUDATA;  je <1\r\n  |.if X64\r\n  |  cmp RB, LJ_TNUMX;  ja >8\r\n  |  cmp RB, LJ_TISNUM;  jbe >7\r\n  |  mov RB, LJ_TLIGHTUD\r\n  |  jmp >8\r\n  |7:\r\n  |.else\r\n  |  cmp RB, LJ_TISNUM;  ja >8\r\n  |.endif\r\n  |  mov RB, LJ_TNUMX\r\n  |8:\r\n  |  not RB\r\n  |  mov TAB:RB, [DISPATCH+RB*4+DISPATCH_GL(gcroot[GCROOT_BASEMT])]\r\n  |  jmp <2\r\n  |\r\n  |.ffunc_2 setmetatable\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  // Fast path: no mt for table yet and not clearing the mt.\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword TAB:RB->metatable, 0;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TTAB;  jne ->fff_fallback\r\n  |  mov TAB:RC, [BASE+8]\r\n  |  mov TAB:RB->metatable, TAB:RC\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TTAB\t\t// Return original table.\r\n  |  mov [BASE-8], TAB:RB\r\n  |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n  |  jz >1\r\n  |  // Possible write barrier. Table is black, but skip iswhite(mt) check.\r\n  |  barrierback TAB:RB, RC\r\n  |1:\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_2 rawget\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |.if X64WIN\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  lea CARG3d, [BASE+8]\r\n  |  mov CARG2d, [BASE]\t\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG1d, SAVE_L\r\n  |.elif X64\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov CARG2d, [BASE]\r\n  |  lea CARG3d, [BASE+8]\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG1d, SAVE_L\r\n  |.else\r\n  |  mov TAB:RD, [BASE]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov ARG2, TAB:RD\r\n  |  mov ARG1, L:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  add BASE, 8\r\n  |  mov ARG3, BASE\r\n  |.endif\r\n  |  call extern lj_tab_get\t// (lua_State *L, GCtab *t, cTValue *key)\r\n  |  // cTValue * returned in eax (RD).\r\n  |  mov BASE, RB\t\t\t// Restore BASE.\r\n  |  // Copy table slot.\r\n  |.if X64\r\n  |  mov RBa, [RD]\r\n  |  mov PC, [BASE-4]\r\n  |  mov [BASE-8], RBa\r\n  |.else\r\n  |  mov RB, [RD]\r\n  |  mov RD, [RD+4]\r\n  |  mov PC, [BASE-4]\r\n  |  mov [BASE-8], RB\r\n  |  mov [BASE-4], RD\r\n  |.endif\r\n  |  jmp ->fff_res1\r\n  |\r\n  |//-- Base library: conversions ------------------------------------------\r\n  |\r\n  |.ffunc tonumber\r\n  |  // Only handles the number case inline (without a base argument).\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\t// Exactly one argument.\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >1\r\n  |  mov RB, dword [BASE]; jmp ->fff_resi\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  movsd xmm0, qword [BASE]; jmp ->fff_resxmm0\r\n  |\r\n  |.ffunc_1 tostring\r\n  |  // Only handles the string or number case inline.\r\n  |  mov PC, [BASE-4]\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne >3\r\n  |  // A __tostring method in the string base metatable is ignored.\r\n  |  mov STR:RD, [BASE]\r\n  |2:\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RD\r\n  |  jmp ->fff_res1\r\n  |3:  // Handle numbers inline, unless a number base metatable is present.\r\n  |  cmp dword [BASE+4], LJ_TISNUM;  ja ->fff_fallback\r\n  |  cmp dword [DISPATCH+DISPATCH_GL(gcroot[GCROOT_BASEMT_NUM])], 0\r\n  |  jne ->fff_fallback\r\n  |  ffgccheck\t\t\t\t// Caveat: uses label 1.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |.if X64 and not X64WIN\r\n  |  mov FCARG2, BASE\t\t\t// Otherwise: FCARG2 == BASE\r\n  |.endif\r\n  |  mov L:FCARG1, L:RB\r\n  |.if DUALNUM\r\n  |  call extern lj_strfmt_number@8\t// (lua_State *L, cTValue *o)\r\n  |.else\r\n  |  call extern lj_strfmt_num@8\t// (lua_State *L, lua_Number *np)\r\n  |.endif\r\n  |  // GCstr returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <2\r\n  |\r\n  |//-- Base library: iterators -------------------------------------------\r\n  |\r\n  |.ffunc_1 next\r\n  |  je >2\t\t\t\t// Missing 2nd arg?\r\n  |1:\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\t\t// Add frame since C call can throw.\r\n  |  mov L:RB->top, BASE\t\t// Dummy frame length is ok.\r\n  |  mov PC, [BASE-4]\r\n  |.if X64WIN\r\n  |  lea CARG3d, [BASE+8]\r\n  |  mov CARG2d, [BASE]\t\t\t// Caveat: CARG2d == BASE.\r\n  |  mov CARG1d, L:RB\r\n  |.elif X64\r\n  |  mov CARG2d, [BASE]\r\n  |  lea CARG3d, [BASE+8]\t\t// Caveat: CARG3d == BASE.\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov TAB:RD, [BASE]\r\n  |  mov ARG2, TAB:RD\r\n  |  mov ARG1, L:RB\r\n  |  add BASE, 8\r\n  |  mov ARG3, BASE\r\n  |.endif\r\n  |  mov SAVE_PC, PC\t\t\t// Needed for ITERN fallback.\r\n  |  call extern lj_tab_next\t// (lua_State *L, GCtab *t, TValue *key)\r\n  |  // Flag returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  test RD, RD;  jz >3\t\t// End of traversal?\r\n  |  // Copy key and value to results.\r\n  |.if X64\r\n  |  mov RBa, [BASE+8]\r\n  |  mov RDa, [BASE+16]\r\n  |  mov [BASE-8], RBa\r\n  |  mov [BASE], RDa\r\n  |.else\r\n  |  mov RB, [BASE+8]\r\n  |  mov RD, [BASE+12]\r\n  |  mov [BASE-8], RB\r\n  |  mov [BASE-4], RD\r\n  |  mov RB, [BASE+16]\r\n  |  mov RD, [BASE+20]\r\n  |  mov [BASE], RB\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |->fff_res2:\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |2:  // Set missing 2nd arg to nil.\r\n  |  mov dword [BASE+12], LJ_TNIL\r\n  |  jmp <1\r\n  |3:  // End of traversal: return nil.\r\n  |  mov dword [BASE-4], LJ_TNIL\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc_1 pairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n#if LJ_52\r\n  |  cmp dword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov CFUNC:RD, CFUNC:RB->upvalue[0]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TFUNC\r\n  |  mov [BASE-8], CFUNC:RD\r\n  |  mov dword [BASE+12], LJ_TNIL\r\n  |  mov RD, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_2 ipairs_aux\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  mov PC, [BASE-4]\r\n  |.if DUALNUM\r\n  |  mov RD, dword [BASE+8]\r\n  |  add RD, 1\r\n  |  mov dword [BASE-4], LJ_TISNUM\r\n  |  mov dword [BASE-8], RD\r\n  |.else\r\n  |  movsd xmm0, qword [BASE+8]\r\n  |  sseconst_1 xmm1, RBa\r\n  |  addsd xmm0, xmm1\r\n  |  cvttsd2si RD, xmm0\r\n  |  movsd qword [BASE-8], xmm0\r\n  |.endif\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp RD, TAB:RB->asize;  jae >2\t// Not in array part?\r\n  |  shl RD, 3\r\n  |  add RD, TAB:RB->array\r\n  |1:\r\n  |  cmp dword [RD+4], LJ_TNIL;  je ->fff_res0\r\n  |  // Copy array slot.\r\n  |.if X64\r\n  |  mov RBa, [RD]\r\n  |  mov [BASE], RBa\r\n  |.else\r\n  |  mov RB, [RD]\r\n  |  mov RD, [RD+4]\r\n  |  mov [BASE], RB\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |  jmp ->fff_res2\r\n  |2:  // Check for empty hash part first. Otherwise call C function.\r\n  |  cmp dword TAB:RB->hmask, 0; je ->fff_res0\r\n  |  mov FCARG1, TAB:RB\r\n  |  mov RB, BASE\t\t\t// Save BASE.\r\n  |  mov FCARG2, RD\t\t\t// Caveat: FCARG2 == BASE\r\n  |  call extern lj_tab_getinth@8\t// (GCtab *t, int32_t key)\r\n  |  // cTValue * or NULL returned in eax (RD).\r\n  |  mov BASE, RB\r\n  |  test RD, RD\r\n  |  jnz <1\r\n  |->fff_res0:\r\n  |  mov RD, 1+0\r\n  |  jmp ->fff_res\r\n  |\r\n  |.ffunc_1 ipairs\r\n  |  mov TAB:RB, [BASE]\r\n  |  cmp dword [BASE+4], LJ_TTAB;  jne ->fff_fallback\r\n#if LJ_52\r\n  |  cmp dword TAB:RB->metatable, 0; jne ->fff_fallback\r\n#endif\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov CFUNC:RD, CFUNC:RB->upvalue[0]\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TFUNC\r\n  |  mov [BASE-8], CFUNC:RD\r\n  |.if DUALNUM\r\n  |  mov dword [BASE+12], LJ_TISNUM\r\n  |  mov dword [BASE+8], 0\r\n  |.else\r\n  |  xorps xmm0, xmm0\r\n  |  movsd qword [BASE+8], xmm0\r\n  |.endif\r\n  |  mov RD, 1+3\r\n  |  jmp ->fff_res\r\n  |\r\n  |//-- Base library: catch errors ----------------------------------------\r\n  |\r\n  |.ffunc_1 pcall\r\n  |  lea RA, [BASE+8]\r\n  |  sub NARGS:RD, 1\r\n  |  mov PC, 8+FRAME_PCALL\r\n  |1:\r\n  |  movzx RB, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  shr RB, HOOK_ACTIVE_SHIFT\r\n  |  and RB, 1\r\n  |  add PC, RB\t\t\t\t// Remember active hook before pcall.\r\n  |  jmp ->vm_call_dispatch\r\n  |\r\n  |.ffunc_2 xpcall\r\n  |  cmp dword [BASE+12], LJ_TFUNC;  jne ->fff_fallback\r\n  |  mov RB, [BASE+4]\t\t\t// Swap function and traceback.\r\n  |  mov [BASE+12], RB\r\n  |  mov dword [BASE+4], LJ_TFUNC\r\n  |  mov LFUNC:RB, [BASE]\r\n  |  mov PC, [BASE+8]\r\n  |  mov [BASE+8], LFUNC:RB\r\n  |  mov [BASE], PC\r\n  |  lea RA, [BASE+16]\r\n  |  sub NARGS:RD, 2\r\n  |  mov PC, 16+FRAME_PCALL\r\n  |  jmp <1\r\n  |\r\n  |//-- Coroutine library --------------------------------------------------\r\n  |\r\n  |.macro coroutine_resume_wrap, resume\r\n  |.if resume\r\n  |.ffunc_1 coroutine_resume\r\n  |  mov L:RB, [BASE]\r\n  |.else\r\n  |.ffunc coroutine_wrap_aux\r\n  |  mov CFUNC:RB, [BASE-8]\r\n  |  mov L:RB, CFUNC:RB->upvalue[0].gcr\r\n  |.endif\r\n  |  mov PC, [BASE-4]\r\n  |  mov SAVE_PC, PC\r\n  |.if X64\r\n  |  mov TMP1, L:RB\r\n  |.else\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |.if resume\r\n  |  cmp dword [BASE+4], LJ_TTHREAD;  jne ->fff_fallback\r\n  |.endif\r\n  |  cmp aword L:RB->cframe, 0; jne ->fff_fallback\r\n  |  cmp byte L:RB->status, LUA_YIELD;  ja ->fff_fallback\r\n  |  mov RA, L:RB->top\r\n  |  je >1\t\t\t\t// Status != LUA_YIELD (i.e. 0)?\r\n  |  cmp RA, L:RB->base\t\t\t// Check for presence of initial func.\r\n  |  je ->fff_fallback\r\n  |1:\r\n  |.if resume\r\n  |  lea PC, [RA+NARGS:RD*8-16]\t\t// Check stack space (-1-thread).\r\n  |.else\r\n  |  lea PC, [RA+NARGS:RD*8-8]\t\t// Check stack space (-1).\r\n  |.endif\r\n  |  cmp PC, L:RB->maxstack; ja ->fff_fallback\r\n  |  mov L:RB->top, PC\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |.if resume\r\n  |  add BASE, 8\t\t\t// Keep resumed thread in stack for GC.\r\n  |.endif\r\n  |  mov L:RB->top, BASE\r\n  |.if resume\r\n  |  lea RB, [BASE+NARGS:RD*8-24]\t// RB = end of source for stack move.\r\n  |.else\r\n  |  lea RB, [BASE+NARGS:RD*8-16]\t// RB = end of source for stack move.\r\n  |.endif\r\n  |  sub RBa, PCa\t\t\t// Relative to PC.\r\n  |\r\n  |  cmp PC, RA\r\n  |  je >3\r\n  |2:  // Move args to coroutine.\r\n  |.if X64\r\n  |  mov RCa, [PC+RB]\r\n  |  mov [PC-8], RCa\r\n  |.else\r\n  |  mov RC, [PC+RB+4]\r\n  |  mov [PC-4], RC\r\n  |  mov RC, [PC+RB]\r\n  |  mov [PC-8], RC\r\n  |.endif\r\n  |  sub PC, 8\r\n  |  cmp PC, RA\r\n  |  jne <2\r\n  |3:\r\n  |.if X64\r\n  |  mov CARG2d, RA\r\n  |  mov CARG1d, TMP1\r\n  |.else\r\n  |  mov ARG2, RA\r\n  |  xor RA, RA\r\n  |  mov ARG4, RA\r\n  |  mov ARG3, RA\r\n  |.endif\r\n  |  call ->vm_resume\t\t\t// (lua_State *L, TValue *base, 0, 0)\r\n  |\r\n  |  mov L:RB, SAVE_L\r\n  |.if X64\r\n  |  mov L:PC, TMP1\r\n  |.else\r\n  |  mov L:PC, ARG1\t\t\t// The callee doesn't modify SAVE_L.\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n  |  set_vmstate INTERP\r\n  |\r\n  |  cmp eax, LUA_YIELD\r\n  |  ja >8\r\n  |4:\r\n  |  mov RA, L:PC->base\r\n  |  mov KBASE, L:PC->top\r\n  |  mov L:PC->top, RA\t\t\t// Clear coroutine stack.\r\n  |  mov PC, KBASE\r\n  |  sub PC, RA\r\n  |  je >6\t\t\t\t// No results?\r\n  |  lea RD, [BASE+PC]\r\n  |  shr PC, 3\r\n  |  cmp RD, L:RB->maxstack\r\n  |  ja >9\t\t\t\t// Need to grow stack?\r\n  |\r\n  |  mov RB, BASE\r\n  |  sub RBa, RAa\r\n  |5:  // Move results from coroutine.\r\n  |.if X64\r\n  |  mov RDa, [RA]\r\n  |  mov [RA+RB], RDa\r\n  |.else\r\n  |  mov RD, [RA]\r\n  |  mov [RA+RB], RD\r\n  |  mov RD, [RA+4]\r\n  |  mov [RA+RB+4], RD\r\n  |.endif\r\n  |  add RA, 8\r\n  |  cmp RA, KBASE\r\n  |  jne <5\r\n  |6:\r\n  |.if resume\r\n  |  lea RD, [PC+2]\t\t\t// nresults+1 = 1 + true + results.\r\n  |  mov dword [BASE-4], LJ_TTRUE\t// Prepend true to results.\r\n  |.else\r\n  |  lea RD, [PC+1]\t\t\t// nresults+1 = 1 + results.\r\n  |.endif\r\n  |7:\r\n  |  mov PC, SAVE_PC\r\n  |  mov MULTRES, RD\r\n  |.if resume\r\n  |  mov RAa, -8\r\n  |.else\r\n  |  xor RA, RA\r\n  |.endif\r\n  |  test PC, FRAME_TYPE\r\n  |  jz ->BC_RET_Z\r\n  |  jmp ->vm_return\r\n  |\r\n  |8:  // Coroutine returned with error (at co->top-1).\r\n  |.if resume\r\n  |  mov dword [BASE-4], LJ_TFALSE\t// Prepend false to results.\r\n  |  mov RA, L:PC->top\r\n  |  sub RA, 8\r\n  |  mov L:PC->top, RA\t\t\t// Clear error from coroutine stack.\r\n  |  // Copy error message.\r\n  |.if X64\r\n  |  mov RDa, [RA]\r\n  |  mov [BASE], RDa\r\n  |.else\r\n  |  mov RD, [RA]\r\n  |  mov [BASE], RD\r\n  |  mov RD, [RA+4]\r\n  |  mov [BASE+4], RD\r\n  |.endif\r\n  |  mov RD, 1+2\t\t\t// nresults+1 = 1 + false + error.\r\n  |  jmp <7\r\n  |.else\r\n  |  mov FCARG2, L:PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_ffh_coroutine_wrap_err@8  // (lua_State *L, lua_State *co)\r\n  |  // Error function does not return.\r\n  |.endif\r\n  |\r\n  |9:  // Handle stack expansion on return from yield.\r\n  |.if X64\r\n  |  mov L:RA, TMP1\r\n  |.else\r\n  |  mov L:RA, ARG1\t\t\t// The callee doesn't modify SAVE_L.\r\n  |.endif\r\n  |  mov L:RA->top, KBASE\t\t// Undo coroutine stack clearing.\r\n  |  mov FCARG2, PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |.if X64\r\n  |  mov L:PC, TMP1\r\n  |.else\r\n  |  mov L:PC, ARG1\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  jmp <4\t\t\t\t// Retry the stack move.\r\n  |.endmacro\r\n  |\r\n  |  coroutine_resume_wrap 1\t\t// coroutine.resume\r\n  |  coroutine_resume_wrap 0\t\t// coroutine.wrap\r\n  |\r\n  |.ffunc coroutine_yield\r\n  |  mov L:RB, SAVE_L\r\n  |  test aword L:RB->cframe, CFRAME_RESUME\r\n  |  jz ->fff_fallback\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB->top, RD\r\n  |  xor RD, RD\r\n  |  mov aword L:RB->cframe, RDa\r\n  |  mov al, LUA_YIELD\r\n  |  mov byte L:RB->status, al\r\n  |  jmp ->vm_leave_unw\r\n  |\r\n  |//-- Math library -------------------------------------------------------\r\n  |\r\n  |.if not DUALNUM\r\n  |->fff_resi:  // Dummy.\r\n  |.endif\r\n  |\r\n  |->fff_resn:\r\n  |  mov PC, [BASE-4]\r\n  |  fstp qword [BASE-8]\r\n  |  jmp ->fff_res1\r\n  |\r\n  |  .ffunc_1 math_abs\r\n  |.if DUALNUM\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jne >2\r\n  |  mov RB, dword [BASE]\r\n  |  cmp RB, 0; jns ->fff_resi\r\n  |  neg RB; js >1\r\n  |->fff_resbit:\r\n  |->fff_resi:\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TISNUM\r\n  |  mov dword [BASE-8], RB\r\n  |  jmp ->fff_res1\r\n  |1:\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], 0x41e00000  // 2^31.\r\n  |  mov dword [BASE-8], 0\r\n  |  jmp ->fff_res1\r\n  |2:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |.endif\r\n  |  movsd xmm0, qword [BASE]\r\n  |  sseconst_abs xmm1, RDa\r\n  |  andps xmm0, xmm1\r\n  |->fff_resxmm0:\r\n  |  mov PC, [BASE-4]\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  // fallthrough\r\n  |\r\n  |->fff_res1:\r\n  |  mov RD, 1+1\r\n  |->fff_res:\r\n  |  mov MULTRES, RD\r\n  |->fff_res_:\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz >7\r\n  |5:\r\n  |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n  |  ja >6\r\n  |  // Adjust BASE. KBASE is assumed to be set for the calling frame.\r\n  |  movzx RA, PC_RA\r\n  |  not RAa\t\t\t\t// Note: ~RA = -(RA+1)\r\n  |  lea BASE, [BASE+RA*8]\t\t// base = base - (RA+1)*8\r\n  |  ins_next\r\n  |\r\n  |6:  // Fill up results with nil.\r\n  |  mov dword [BASE+RD*8-12], LJ_TNIL\r\n  |  add RD, 1\r\n  |  jmp <5\r\n  |\r\n  |7:  // Non-standard return case.\r\n  |  mov RAa, -8\t\t\t// Results start at BASE+RA = BASE-8.\r\n  |  jmp ->vm_return\r\n  |\r\n  |.if X64\r\n  |.define fff_resfp, fff_resxmm0\r\n  |.else\r\n  |.define fff_resfp, fff_resn\r\n  |.endif\r\n  |\r\n  |.macro math_round, func\r\n  |  .ffunc math_ .. func\r\n  |.if DUALNUM\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jne >1\r\n  |  mov RB, dword [BASE]; jmp ->fff_resi\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |.endif\r\n  |  movsd xmm0, qword [BASE]\r\n  |  call ->vm_ .. func .. _sse\r\n  |.if DUALNUM\r\n  |  cvttsd2si RB, xmm0\r\n  |  cmp RB, 0x80000000\r\n  |  jne ->fff_resi\r\n  |  cvtsi2sd xmm1, RB\r\n  |  ucomisd xmm0, xmm1\r\n  |  jp ->fff_resxmm0\r\n  |  je ->fff_resi\r\n  |.endif\r\n  |  jmp ->fff_resxmm0\r\n  |.endmacro\r\n  |\r\n  |  math_round floor\r\n  |  math_round ceil\r\n  |\r\n  |.ffunc_nsse math_sqrt, sqrtsd; jmp ->fff_resxmm0\r\n  |\r\n  |.ffunc math_log\r\n  |  cmp NARGS:RD, 1+1; jne ->fff_fallback\t// Exactly one argument.\r\n  |  cmp dword [BASE+4], LJ_TISNUM; jae ->fff_fallback\r\n  |  movsd xmm0, qword [BASE]\r\n  |.if not X64\r\n  |  movsd FPARG1, xmm0\r\n  |.endif\r\n  |  mov RB, BASE\r\n  |  call extern log\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resfp\r\n  |\r\n  |.macro math_extern, func\r\n  |  .ffunc_nsse math_ .. func\r\n  |.if not X64\r\n  |  movsd FPARG1, xmm0\r\n  |.endif\r\n  |  mov RB, BASE\r\n  |  call extern func\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resfp\r\n  |.endmacro\r\n  |\r\n  |.macro math_extern2, func\r\n  |  .ffunc_nnsse math_ .. func\r\n  |.if not X64\r\n  |  movsd FPARG1, xmm0\r\n  |  movsd FPARG3, xmm1\r\n  |.endif\r\n  |  mov RB, BASE\r\n  |  call extern func\r\n  |  mov BASE, RB\r\n  |  jmp ->fff_resfp\r\n  |.endmacro\r\n  |\r\n  |  math_extern log10\r\n  |  math_extern exp\r\n  |  math_extern sin\r\n  |  math_extern cos\r\n  |  math_extern tan\r\n  |  math_extern asin\r\n  |  math_extern acos\r\n  |  math_extern atan\r\n  |  math_extern sinh\r\n  |  math_extern cosh\r\n  |  math_extern tanh\r\n  |  math_extern2 pow\r\n  |  math_extern2 atan2\r\n  |  math_extern2 fmod\r\n  |\r\n  |.ffunc_nnr math_ldexp;\tfscale; fpop1;\tjmp ->fff_resn\r\n  |\r\n  |.ffunc_1 math_frexp\r\n  |  mov RB, [BASE+4]\r\n  |  cmp RB, LJ_TISNUM;  jae ->fff_fallback\r\n  |  mov PC, [BASE-4]\r\n  |  mov RC, [BASE]\r\n  |  mov [BASE-4], RB; mov [BASE-8], RC\r\n  |  shl RB, 1; cmp RB, 0xffe00000; jae >3\r\n  |  or RC, RB; jz >3\r\n  |  mov RC, 1022\r\n  |  cmp RB, 0x00200000; jb >4\r\n  |1:\r\n  |  shr RB, 21; sub RB, RC\t\t// Extract and unbias exponent.\r\n  |  cvtsi2sd xmm0, RB\r\n  |  mov RB, [BASE-4]\r\n  |  and RB, 0x800fffff\t\t\t// Mask off exponent.\r\n  |  or RB, 0x3fe00000\t\t\t// Put mantissa in range [0.5,1) or 0.\r\n  |  mov [BASE-4], RB\r\n  |2:\r\n  |  movsd qword [BASE], xmm0\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |3:  // Return +-0, +-Inf, NaN unmodified and an exponent of 0.\r\n  |  xorps xmm0, xmm0; jmp <2\r\n  |4:  // Handle denormals by multiplying with 2^54 and adjusting the bias.\r\n  |  movsd xmm0, qword [BASE]\r\n  |  sseconst_hi xmm1, RBa, 43500000  // 2^54.\r\n  |  mulsd xmm0, xmm1\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  mov RB, [BASE-4]; mov RC, 1076; shl RB, 1; jmp <1\r\n  |\r\n  |.ffunc_nsse math_modf\r\n  |  mov RB, [BASE+4]\r\n  |  mov PC, [BASE-4]\r\n  |  shl RB, 1; cmp RB, 0xffe00000; je >4\t// +-Inf?\r\n  |  movaps xmm4, xmm0\r\n  |  call ->vm_trunc_sse\r\n  |  subsd xmm4, xmm0\r\n  |1:\r\n  |  movsd qword [BASE-8], xmm0\r\n  |  movsd qword [BASE], xmm4\r\n  |  mov RC, [BASE-4]; mov RB, [BASE+4]\r\n  |  xor RC, RB; js >3\t\t\t\t// Need to adjust sign?\r\n  |2:\r\n  |  mov RD, 1+2\r\n  |  jmp ->fff_res\r\n  |3:\r\n  |  xor RB, 0x80000000; mov [BASE+4], RB\t// Flip sign of fraction.\r\n  |  jmp <2\r\n  |4:\r\n  |  xorps xmm4, xmm4; jmp <1\t\t\t// Return +-Inf and +-0.\r\n  |\r\n  |.macro math_minmax, name, cmovop, sseop\r\n  |  .ffunc name\r\n  |  mov RA, 2\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >4\r\n  |  mov RB, dword [BASE]\r\n  |1:  // Handle integers.\r\n  |  cmp RA, RD; jae ->fff_resi\r\n  |  cmp dword [BASE+RA*8-4], LJ_TISNUM; jne >3\r\n  |  cmp RB, dword [BASE+RA*8-8]\r\n  |  cmovop RB, dword [BASE+RA*8-8]\r\n  |  add RA, 1\r\n  |  jmp <1\r\n  |3:\r\n  |  ja ->fff_fallback\r\n  |  // Convert intermediate result to number and continue below.\r\n  |  cvtsi2sd xmm0, RB\r\n  |  jmp >6\r\n  |4:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |\r\n  |  movsd xmm0, qword [BASE]\r\n  |5:  // Handle numbers or integers.\r\n  |  cmp RA, RD; jae ->fff_resxmm0\r\n  |  cmp dword [BASE+RA*8-4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jb >6\r\n  |  ja ->fff_fallback\r\n  |  cvtsi2sd xmm1, dword [BASE+RA*8-8]\r\n  |  jmp >7\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |6:\r\n  |  movsd xmm1, qword [BASE+RA*8-8]\r\n  |7:\r\n  |  sseop xmm0, xmm1\r\n  |  add RA, 1\r\n  |  jmp <5\r\n  |.endmacro\r\n  |\r\n  |  math_minmax math_min, cmovg, minsd\r\n  |  math_minmax math_max, cmovl, maxsd\r\n  |\r\n  |//-- String library -----------------------------------------------------\r\n  |\r\n  |.ffunc string_byte\t\t\t// Only handle the 1-arg case here.\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov STR:RB, [BASE]\r\n  |  mov PC, [BASE-4]\r\n  |  cmp dword STR:RB->len, 1\r\n  |  jb ->fff_res0\t\t\t// Return no results for empty string.\r\n  |  movzx RB, byte STR:RB[1]\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resi\r\n  |.else\r\n  |  cvtsi2sd xmm0, RB; jmp ->fff_resxmm0\r\n  |.endif\r\n  |\r\n  |.ffunc string_char\t\t\t// Only handle the 1-arg case here.\r\n  |  ffgccheck\r\n  |  cmp NARGS:RD, 1+1;  jne ->fff_fallback\t// *Exactly* 1 arg.\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |  mov RB, dword [BASE]\r\n  |  cmp RB, 255;  ja ->fff_fallback\r\n  |  mov TMP2, RB\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |  cvttsd2si RB, qword [BASE]\r\n  |  cmp RB, 255;  ja ->fff_fallback\r\n  |  mov TMP2, RB\r\n  |.endif\r\n  |.if X64\r\n  |  mov TMP3, 1\r\n  |.else\r\n  |  mov ARG3, 1\r\n  |.endif\r\n  |  lea RDa, TMP2\t\t\t// Points to stack. Little-endian.\r\n  |->fff_newstr:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |.if X64\r\n  |  mov CARG3d, TMP3\t\t\t// Zero-extended to size_t.\r\n  |  mov CARG2, RDa\t\t\t// May be 64 bit ptr to stack.\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG2, RD\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_str_new\t\t// (lua_State *L, char *str, size_t l)\r\n  |->fff_resstr:\r\n  |  // GCstr * returned in eax (RD).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [BASE-4]\r\n  |  mov dword [BASE-4], LJ_TSTR\r\n  |  mov [BASE-8], STR:RD\r\n  |  jmp ->fff_res1\r\n  |\r\n  |.ffunc string_sub\r\n  |  ffgccheck\r\n  |  mov TMP2, -1\r\n  |  cmp NARGS:RD, 1+2;  jb ->fff_fallback\r\n  |  jna >1\r\n  |  cmp dword [BASE+20], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |  mov RB, dword [BASE+16]\r\n  |  mov TMP2, RB\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |  cvttsd2si RB, qword [BASE+16]\r\n  |  mov TMP2, RB\r\n  |.endif\r\n  |1:\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  cmp dword [BASE+12], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  mov STR:RB, [BASE]\r\n  |  mov TMP3, STR:RB\r\n  |  mov RB, STR:RB->len\r\n  |.if DUALNUM\r\n  |  mov RA, dword [BASE+8]\r\n  |.else\r\n  |  cvttsd2si RA, qword [BASE+8]\r\n  |.endif\r\n  |  mov RC, TMP2\r\n  |  cmp RB, RC\t\t\t\t// len < end? (unsigned compare)\r\n  |  jb >5\r\n  |2:\r\n  |  test RA, RA\t\t\t// start <= 0?\r\n  |  jle >7\r\n  |3:\r\n  |  mov STR:RB, TMP3\r\n  |  sub RC, RA\t\t\t\t// start > end?\r\n  |  jl ->fff_emptystr\r\n  |  lea RB, [STR:RB+RA+#STR-1]\r\n  |  add RC, 1\r\n  |4:\r\n  |.if X64\r\n  |  mov TMP3, RC\r\n  |.else\r\n  |  mov ARG3, RC\r\n  |.endif\r\n  |  mov RD, RB\r\n  |  jmp ->fff_newstr\r\n  |\r\n  |5:  // Negative end or overflow.\r\n  |  jl >6\r\n  |  lea RC, [RC+RB+1]\t\t\t// end = end+(len+1)\r\n  |  jmp <2\r\n  |6:  // Overflow.\r\n  |  mov RC, RB\t\t\t\t// end = len\r\n  |  jmp <2\r\n  |\r\n  |7:  // Negative start or underflow.\r\n  |  je >8\r\n  |  add RA, RB\t\t\t\t// start = start+(len+1)\r\n  |  add RA, 1\r\n  |  jg <3\t\t\t\t// start > 0?\r\n  |8:  // Underflow.\r\n  |  mov RA, 1\t\t\t\t// start = 1\r\n  |  jmp <3\r\n  |\r\n  |->fff_emptystr:  // Range underflow.\r\n  |  xor RC, RC\t\t\t\t// Zero length. Any ptr in RB is ok.\r\n  |  jmp <4\r\n  |\r\n  |.macro ffstring_op, name\r\n  |  .ffunc_1 string_ .. name\r\n  |  ffgccheck\r\n  |  cmp dword [BASE+4], LJ_TSTR;  jne ->fff_fallback\r\n  |  mov L:RB, SAVE_L\r\n  |   lea SBUF:FCARG1, [DISPATCH+DISPATCH_GL(tmpbuf)]\r\n  |  mov L:RB->base, BASE\r\n  |  mov STR:FCARG2, [BASE]\t\t// Caveat: FCARG2 == BASE\r\n  |   mov RC, SBUF:FCARG1->b\r\n  |   mov SBUF:FCARG1->L, L:RB\r\n  |   mov SBUF:FCARG1->p, RC\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_buf_putstr_ .. name .. @8\r\n  |  mov FCARG1, eax\r\n  |  call extern lj_buf_tostr@4\r\n  |  jmp ->fff_resstr\r\n  |.endmacro\r\n  |\r\n  |ffstring_op reverse\r\n  |ffstring_op lower\r\n  |ffstring_op upper\r\n  |\r\n  |//-- Bit library --------------------------------------------------------\r\n  |\r\n  |.macro .ffunc_bit, name, kind, fdef\r\n  |  fdef name\r\n  |.if kind == 2\r\n  |  sseconst_tobit xmm1, RBa\r\n  |.endif\r\n  |  cmp dword [BASE+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >1\r\n  |  mov RB, dword [BASE]\r\n  |.if kind > 0\r\n  |  jmp >2\r\n  |.else\r\n  |  jmp ->fff_resbit\r\n  |.endif\r\n  |1:\r\n  |  ja ->fff_fallback\r\n  |.else\r\n  |  jae ->fff_fallback\r\n  |.endif\r\n  |  movsd xmm0, qword [BASE]\r\n  |.if kind < 2\r\n  |  sseconst_tobit xmm1, RBa\r\n  |.endif\r\n  |  addsd xmm0, xmm1\r\n  |  movd RB, xmm0\r\n  |2:\r\n  |.endmacro\r\n  |\r\n  |.macro .ffunc_bit, name, kind\r\n  |  .ffunc_bit name, kind, .ffunc_1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit bit_tobit, 0\r\n  |  jmp ->fff_resbit\r\n  |\r\n  |.macro .ffunc_bit_op, name, ins\r\n  |  .ffunc_bit name, 2\r\n  |  mov TMP2, NARGS:RD\t\t\t// Save for fallback.\r\n  |  lea RD, [BASE+NARGS:RD*8-16]\r\n  |1:\r\n  |  cmp RD, BASE\r\n  |  jbe ->fff_resbit\r\n  |  cmp dword [RD+4], LJ_TISNUM\r\n  |.if DUALNUM\r\n  |  jne >2\r\n  |  ins RB, dword [RD]\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |2:\r\n  |  ja ->fff_fallback_bit_op\r\n  |.else\r\n  |  jae ->fff_fallback_bit_op\r\n  |.endif\r\n  |  movsd xmm0, qword [RD]\r\n  |  addsd xmm0, xmm1\r\n  |  movd RA, xmm0\r\n  |  ins RB, RA\r\n  |  sub RD, 8\r\n  |  jmp <1\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_op bit_band, and\r\n  |.ffunc_bit_op bit_bor, or\r\n  |.ffunc_bit_op bit_bxor, xor\r\n  |\r\n  |.ffunc_bit bit_bswap, 1\r\n  |  bswap RB\r\n  |  jmp ->fff_resbit\r\n  |\r\n  |.ffunc_bit bit_bnot, 1\r\n  |  not RB\r\n  |.if DUALNUM\r\n  |  jmp ->fff_resbit\r\n  |.else\r\n  |->fff_resbit:\r\n  |  cvtsi2sd xmm0, RB\r\n  |  jmp ->fff_resxmm0\r\n  |.endif\r\n  |\r\n  |->fff_fallback_bit_op:\r\n  |  mov NARGS:RD, TMP2\t\t\t// Restore for fallback\r\n  |  jmp ->fff_fallback\r\n  |\r\n  |.macro .ffunc_bit_sh, name, ins\r\n  |.if DUALNUM\r\n  |  .ffunc_bit name, 1, .ffunc_2\r\n  |  // Note: no inline conversion from number for 2nd argument!\r\n  |  cmp dword [BASE+12], LJ_TISNUM; jne ->fff_fallback\r\n  |  mov RA, dword [BASE+8]\r\n  |.else\r\n  |  .ffunc_nnsse name\r\n  |  sseconst_tobit xmm2, RBa\r\n  |  addsd xmm0, xmm2\r\n  |  addsd xmm1, xmm2\r\n  |  movd RB, xmm0\r\n  |  movd RA, xmm1\r\n  |.endif\r\n  |  ins RB, cl\t\t\t\t// Assumes RA is ecx.\r\n  |  jmp ->fff_resbit\r\n  |.endmacro\r\n  |\r\n  |.ffunc_bit_sh bit_lshift, shl\r\n  |.ffunc_bit_sh bit_rshift, shr\r\n  |.ffunc_bit_sh bit_arshift, sar\r\n  |.ffunc_bit_sh bit_rol, rol\r\n  |.ffunc_bit_sh bit_ror, ror\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->fff_fallback_2:\r\n  |  mov NARGS:RD, 1+2\t\t\t// Other args are ignored, anyway.\r\n  |  jmp ->fff_fallback\r\n  |->fff_fallback_1:\r\n  |  mov NARGS:RD, 1+1\t\t\t// Other args are ignored, anyway.\r\n  |->fff_fallback:\t\t\t// Call fast function fallback handler.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  mov L:RB, SAVE_L\r\n  |  mov PC, [BASE-4]\t\t\t// Fallback may overwrite PC.\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  lea RA, [RD+8*LUA_MINSTACK]\t// Ensure enough space for handler.\r\n  |  mov L:RB->top, RD\r\n  |  mov CFUNC:RD, [BASE-8]\r\n  |  cmp RA, L:RB->maxstack\r\n  |  ja >5\t\t\t\t// Need to grow stack.\r\n  |.if X64\r\n  |  mov CARG1d, L:RB\r\n  |.else\r\n  |  mov ARG1, L:RB\r\n  |.endif\r\n  |  call aword CFUNC:RD->f\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  // Either throws an error, or recovers and returns -1, 0 or nresults+1.\r\n  |  test RD, RD;  jg ->fff_res\t\t// Returned nresults+1?\r\n  |1:\r\n  |  mov RA, L:RB->top\r\n  |  sub RA, BASE\r\n  |  shr RA, 3\r\n  |  test RD, RD\r\n  |  lea NARGS:RD, [RA+1]\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  jne ->vm_call_tail\t\t\t// Returned -1?\r\n  |  ins_callt\t\t\t\t// Returned 0: retry fast path.\r\n  |\r\n  |// Reconstruct previous base for vmeta_call during tailcall.\r\n  |->vm_call_tail:\r\n  |  mov RA, BASE\r\n  |  test PC, FRAME_TYPE\r\n  |  jnz >3\r\n  |  movzx RB, PC_RA\r\n  |  not RBa\t\t\t\t// Note: ~RB = -(RB+1)\r\n  |  lea BASE, [BASE+RB*8]\t\t// base = base - (RB+1)*8\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |3:\r\n  |  mov RB, PC\r\n  |  and RB, -8\r\n  |  sub BASE, RB\r\n  |  jmp ->vm_call_dispatch\t\t// Resolve again for tailcall.\r\n  |\r\n  |5:  // Grow stack for fallback handler.\r\n  |  mov FCARG2, LUA_MINSTACK\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n  |  mov BASE, L:RB->base\r\n  |  xor RD, RD\t\t\t\t// Simulate a return 0.\r\n  |  jmp <1\t\t\t\t// Dumb retry (goes through ff first).\r\n  |\r\n  |->fff_gcstep:\t\t\t// Call GC step function.\r\n  |  // BASE = new base, RD = nargs+1\r\n  |  pop RBa\t\t\t\t// Must keep stack at same level.\r\n  |  mov TMPa, RBa\t\t\t// Save return address\r\n  |  mov L:RB, SAVE_L\r\n  |  mov SAVE_PC, PC\t\t\t// Redundant (but a defined value).\r\n  |  mov L:RB->base, BASE\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov FCARG1, L:RB\r\n  |  mov L:RB->top, RD\r\n  |  call extern lj_gc_step@4\t\t// (lua_State *L)\r\n  |  mov BASE, L:RB->base\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  mov RBa, TMPa\r\n  |  push RBa\t\t\t\t// Restore return address.\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Special dispatch targets -------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->vm_record:\t\t\t\t// Dispatch target for recording phase.\r\n  |.if JIT\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_VMEVENT\t\t// No recording while in vmevent.\r\n  |  jnz >5\r\n  |  // Decrement the hookcount for consistency, but always do the call.\r\n  |  test RDL, HOOK_ACTIVE\r\n  |  jnz >1\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >1\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_rethook:\t\t\t// Dispatch target for return hooks.\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |  jmp >1\r\n  |\r\n  |->vm_inshook:\t\t\t// Dispatch target for instr/line hooks.\r\n  |  movzx RD, byte [DISPATCH+DISPATCH_GL(hookmask)]\r\n  |  test RDL, HOOK_ACTIVE\t\t// Hook already active?\r\n  |  jnz >5\r\n  |\r\n  |  test RDL, LUA_MASKLINE|LUA_MASKCOUNT\r\n  |  jz >5\r\n  |  dec dword [DISPATCH+DISPATCH_GL(hookcount)]\r\n  |  jz >1\r\n  |  test RDL, LUA_MASKLINE\r\n  |  jz >5\r\n  |1:\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, PC\t\t\t// Caveat: FCARG2 == BASE\r\n  |  mov FCARG1, L:RB\r\n  |  // SAVE_PC must hold the _previous_ PC. The callee updates it with PC.\r\n  |  call extern lj_dispatch_ins@8\t// (lua_State *L, const BCIns *pc)\r\n  |3:\r\n  |  mov BASE, L:RB->base\r\n  |4:\r\n  |  movzx RA, PC_RA\r\n  |5:\r\n  |  movzx OP, PC_OP\r\n  |  movzx RD, PC_RD\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8+GG_DISP2STATIC]\t// Re-dispatch to static ins.\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4+GG_DISP2STATIC]\t// Re-dispatch to static ins.\r\n  |.endif\r\n  |\r\n  |->cont_hook:\t\t\t\t// Continue from hook yield.\r\n  |  add PC, 4\r\n  |  mov RA, [RB-24]\r\n  |  mov MULTRES, RA\t\t\t// Restore MULTRES for *M ins.\r\n  |  jmp <4\r\n  |\r\n  |->vm_hotloop:\t\t\t// Hot loop counter underflow.\r\n  |.if JIT\r\n  |  mov LFUNC:RB, [BASE-8]\t\t// Same as curr_topL(L).\r\n  |  mov RB, LFUNC:RB->pc\r\n  |  movzx RD, byte [RB+PC2PROTO(framesize)]\r\n  |  lea RD, [BASE+RD*8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov FCARG2, PC\r\n  |  lea FCARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RBa\r\n  |  mov SAVE_PC, PC\r\n  |  call extern lj_trace_hot@8\t\t// (jit_State *J, const BCIns *pc)\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vm_callhook:\t\t\t// Dispatch target for call hooks.\r\n  |  mov SAVE_PC, PC\r\n  |.if JIT\r\n  |  jmp >1\r\n  |.endif\r\n  |\r\n  |->vm_hotcall:\t\t\t// Hot call counter underflow.\r\n  |.if JIT\r\n  |  mov SAVE_PC, PC\r\n  |  or PC, 1\t\t\t\t// Marker for hot call.\r\n  |1:\r\n  |.endif\r\n  |  lea RD, [BASE+NARGS:RD*8-8]\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov L:RB->top, RD\r\n  |  mov FCARG2, PC\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_dispatch_call@8\t// (lua_State *L, const BCIns *pc)\r\n  |  // ASMFunction returned in eax/rax (RDa).\r\n  |  mov SAVE_PC, 0\t\t\t// Invalidate for subsequent line hook.\r\n  |.if JIT\r\n  |  and PC, -2\r\n  |.endif\r\n  |  mov BASE, L:RB->base\r\n  |  mov RAa, RDa\r\n  |  mov RD, L:RB->top\r\n  |  sub RD, BASE\r\n  |  mov RBa, RAa\r\n  |  movzx RA, PC_RA\r\n  |  shr RD, 3\r\n  |  add NARGS:RD, 1\r\n  |  jmp RBa\r\n  |\r\n  |->cont_stitch:\t\t\t// Trace stitching.\r\n  |.if JIT\r\n  |  // BASE = base, RC = result, RB = mbase\r\n  |  mov RA, [RB-24]\t\t\t// Save previous trace number.\r\n  |  mov TMP1, RA\r\n  |  mov TMP3, DISPATCH\t\t\t// Need one more register.\r\n  |  mov DISPATCH, MULTRES\r\n  |  movzx RA, PC_RA\r\n  |  lea RA, [BASE+RA*8]\t\t// Call base.\r\n  |  sub DISPATCH, 1\r\n  |  jz >2\r\n  |1:  // Move results down.\r\n  |.if X64\r\n  |  mov RBa, [RC]\r\n  |  mov [RA], RBa\r\n  |.else\r\n  |  mov RB, [RC]\r\n  |  mov [RA], RB\r\n  |  mov RB, [RC+4]\r\n  |  mov [RA+4], RB\r\n  |.endif\r\n  |  add RC, 8\r\n  |  add RA, 8\r\n  |  sub DISPATCH, 1\r\n  |  jnz <1\r\n  |2:\r\n  |  movzx RC, PC_RA\r\n  |  movzx RB, PC_RB\r\n  |  add RC, RB\r\n  |  lea RC, [BASE+RC*8-8]\r\n  |3:\r\n  |  cmp RC, RA\r\n  |  ja >9\t\t\t\t// More results wanted?\r\n  |\r\n  |  mov DISPATCH, TMP3\r\n  |  mov RB, TMP1\t\t\t// Get previous trace number.\r\n  |  mov RA, [DISPATCH+DISPATCH_J(trace)]\r\n  |  mov TRACE:RD, [RA+RB*4]\r\n  |  test TRACE:RD, TRACE:RD\r\n  |  jz ->cont_nop\r\n  |  movzx RD, word TRACE:RD->link\r\n  |  cmp RD, RB\r\n  |  je ->cont_nop\t\t\t// Blacklisted.\r\n  |  test RD, RD\r\n  |  jne =>BC_JLOOP\t\t\t// Jump to stitched trace.\r\n  |\r\n  |  // Stitch a new trace to the previous trace.\r\n  |  mov [DISPATCH+DISPATCH_J(exitno)], RB\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, PC\r\n  |  lea FCARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RBa\r\n  |  call extern lj_dispatch_stitch@8\t// (jit_State *J, const BCIns *pc)\r\n  |  mov BASE, L:RB->base\r\n  |  jmp ->cont_nop\r\n  |\r\n  |9:  // Fill up results with nil.\r\n  |  mov dword [RA+4], LJ_TNIL\r\n  |  add RA, 8\r\n  |  jmp <3\r\n  |.endif\r\n  |\r\n  |->vm_profhook:\t\t\t// Dispatch target for profiler hook.\r\n#if LJ_HASPROFILE\r\n  |  mov L:RB, SAVE_L\r\n  |  mov L:RB->base, BASE\r\n  |  mov FCARG2, PC\t\t\t// Caveat: FCARG2 == BASE\r\n  |  mov FCARG1, L:RB\r\n  |  call extern lj_dispatch_profile@8\t// (lua_State *L, const BCIns *pc)\r\n  |  mov BASE, L:RB->base\r\n  |  // HOOK_PROFILE is off again, so re-dispatch to dynamic instruction.\r\n  |  sub PC, 4\r\n  |  jmp ->cont_nop\r\n#endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Trace exit handler -------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Called from an exit stub with the exit number on the stack.\r\n  |// The 16 bit exit number is stored with two (sign-extended) push imm8.\r\n  |->vm_exit_handler:\r\n  |.if JIT\r\n  |.if X64\r\n  |  push r13; push r12\r\n  |  push r11; push r10; push r9; push r8\r\n  |  push rdi; push rsi; push rbp; lea rbp, [rsp+88]; push rbp\r\n  |  push rbx; push rdx; push rcx; push rax\r\n  |  movzx RC, byte [rbp-8]\t\t// Reconstruct exit number.\r\n  |  mov RCH, byte [rbp-16]\r\n  |  mov [rbp-8], r15; mov [rbp-16], r14\r\n  |.else\r\n  |  push ebp; lea ebp, [esp+12]; push ebp\r\n  |  push ebx; push edx; push ecx; push eax\r\n  |  movzx RC, byte [ebp-4]\t\t// Reconstruct exit number.\r\n  |  mov RCH, byte [ebp-8]\r\n  |  mov [ebp-4], edi; mov [ebp-8], esi\r\n  |.endif\r\n  |  // Caveat: DISPATCH is ebx.\r\n  |  mov DISPATCH, [ebp]\r\n  |  mov RA, [DISPATCH+DISPATCH_GL(vmstate)]\t// Get trace number.\r\n  |  set_vmstate EXIT\r\n  |  mov [DISPATCH+DISPATCH_J(exitno)], RC\r\n  |  mov [DISPATCH+DISPATCH_J(parent)], RA\r\n  |.if X64\r\n  |.if X64WIN\r\n  |  sub rsp, 16*8+4*8\t\t\t// Room for SSE regs + save area.\r\n  |.else\r\n  |  sub rsp, 16*8\t\t\t// Room for SSE regs.\r\n  |.endif\r\n  |  add rbp, -128\r\n  |  movsd qword [rbp-8],   xmm15; movsd qword [rbp-16],  xmm14\r\n  |  movsd qword [rbp-24],  xmm13; movsd qword [rbp-32],  xmm12\r\n  |  movsd qword [rbp-40],  xmm11; movsd qword [rbp-48],  xmm10\r\n  |  movsd qword [rbp-56],  xmm9;  movsd qword [rbp-64],  xmm8\r\n  |  movsd qword [rbp-72],  xmm7;  movsd qword [rbp-80],  xmm6\r\n  |  movsd qword [rbp-88],  xmm5;  movsd qword [rbp-96],  xmm4\r\n  |  movsd qword [rbp-104], xmm3;  movsd qword [rbp-112], xmm2\r\n  |  movsd qword [rbp-120], xmm1;  movsd qword [rbp-128], xmm0\r\n  |.else\r\n  |  sub esp, 8*8+16\t\t\t// Room for SSE regs + args.\r\n  |  movsd qword [ebp-40], xmm7; movsd qword [ebp-48], xmm6\r\n  |  movsd qword [ebp-56], xmm5; movsd qword [ebp-64], xmm4\r\n  |  movsd qword [ebp-72], xmm3; movsd qword [ebp-80], xmm2\r\n  |  movsd qword [ebp-88], xmm1; movsd qword [ebp-96], xmm0\r\n  |.endif\r\n  |  // Caveat: RB is ebp.\r\n  |  mov L:RB, [DISPATCH+DISPATCH_GL(cur_L)]\r\n  |  mov BASE, [DISPATCH+DISPATCH_GL(jit_base)]\r\n  |  mov aword [DISPATCH+DISPATCH_J(L)], L:RBa\r\n  |  mov L:RB->base, BASE\r\n  |.if X64WIN\r\n  |  lea CARG2, [rsp+4*8]\r\n  |.elif X64\r\n  |  mov CARG2, rsp\r\n  |.else\r\n  |  lea FCARG2, [esp+16]\r\n  |.endif\r\n  |  lea FCARG1, [DISPATCH+GG_DISP2J]\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_base)], 0\r\n  |  call extern lj_trace_exit@8\t// (jit_State *J, ExitState *ex)\r\n  |  // MULTRES or negated error code returned in eax (RD).\r\n  |  mov RAa, L:RB->cframe\r\n  |  and RAa, CFRAME_RAWMASK\r\n  |.if X64WIN\r\n  |  // Reposition stack later.\r\n  |.elif X64\r\n  |  mov rsp, RAa\t\t\t// Reposition stack to C frame.\r\n  |.else\r\n  |  mov esp, RAa\t\t\t// Reposition stack to C frame.\r\n  |.endif\r\n  |  mov [RAa+CFRAME_OFS_L], L:RB\t// Set SAVE_L (on-trace resume/yield).\r\n  |  mov BASE, L:RB->base\r\n  |  mov PC, [RAa+CFRAME_OFS_PC]\t// Get SAVE_PC.\r\n  |.if X64\r\n  |  jmp >1\r\n  |.endif\r\n  |.endif\r\n  |->vm_exit_interp:\r\n  |  // RD = MULTRES or negated error code, BASE, PC and DISPATCH set.\r\n  |.if JIT\r\n  |.if X64\r\n  |  // Restore additional callee-save registers only used in compiled code.\r\n  |.if X64WIN\r\n  |  lea RAa, [rsp+9*16+4*8]\r\n  |1:\r\n  |  movdqa xmm15, [RAa-9*16]\r\n  |  movdqa xmm14, [RAa-8*16]\r\n  |  movdqa xmm13, [RAa-7*16]\r\n  |  movdqa xmm12, [RAa-6*16]\r\n  |  movdqa xmm11, [RAa-5*16]\r\n  |  movdqa xmm10, [RAa-4*16]\r\n  |  movdqa xmm9, [RAa-3*16]\r\n  |  movdqa xmm8, [RAa-2*16]\r\n  |  movdqa xmm7, [RAa-1*16]\r\n  |  mov rsp, RAa\t\t\t// Reposition stack to C frame.\r\n  |  movdqa xmm6, [RAa]\r\n  |  mov r15, CSAVE_3\r\n  |  mov r14, CSAVE_4\r\n  |.else\r\n  |  add rsp, 16\t\t\t// Reposition stack to C frame.\r\n  |1:\r\n  |.endif\r\n  |  mov r13, TMPa\r\n  |  mov r12, TMPQ\r\n  |.endif\r\n  |  test RD, RD; js >9\t\t\t// Check for error from exit.\r\n  |  mov L:RB, SAVE_L\r\n  |  mov MULTRES, RD\r\n  |  mov LFUNC:KBASE, [BASE-8]\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  mov L:RB->base, BASE\r\n  |  mov dword [DISPATCH+DISPATCH_GL(jit_base)], 0\r\n  |  set_vmstate INTERP\r\n  |  // Modified copy of ins_next which handles function header dispatch, too.\r\n  |  mov RC, [PC]\r\n  |  movzx RA, RCH\r\n  |  movzx OP, RCL\r\n  |  add PC, 4\r\n  |  shr RC, 16\r\n  |  cmp OP, BC_FUNCF\t\t\t// Function header?\r\n  |  jb >3\r\n  |  cmp OP, BC_FUNCC+2\t\t\t// Fast function?\r\n  |  jae >4\r\n  |2:\r\n  |  mov RC, MULTRES\t\t\t// RC/RD holds nres+1.\r\n  |3:\r\n  |.if X64\r\n  |  jmp aword [DISPATCH+OP*8]\r\n  |.else\r\n  |  jmp aword [DISPATCH+OP*4]\r\n  |.endif\r\n  |\r\n  |4:  // Check frame below fast function.\r\n  |  mov RC, [BASE-4]\r\n  |  test RC, FRAME_TYPE\r\n  |  jnz <2\t\t\t\t// Trace stitching continuation?\r\n  |  // Otherwise set KBASE for Lua function below fast function.\r\n  |  movzx RC, byte [RC-3]\r\n  |  not RCa\r\n  |  mov LFUNC:KBASE, [BASE+RC*8-8]\r\n  |  mov KBASE, LFUNC:KBASE->pc\r\n  |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n  |  jmp <2\r\n  |\r\n  |9:  // Rethrow error from the right C frame.\r\n  |  neg RD\r\n  |  mov FCARG1, L:RB\r\n  |  mov FCARG2, RD\r\n  |  call extern lj_err_throw@8\t\t// (lua_State *L, int errcode)\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Math helper functions ----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// FP value rounding. Called by math.floor/math.ceil fast functions\r\n  |// and from JIT code. arg/ret is xmm0. xmm0-xmm3 and RD (eax) modified.\r\n  |.macro vm_round, name, mode, cond\r\n  |->name:\r\n  |.if not X64 and cond\r\n  |  movsd xmm0, qword [esp+4]\r\n  |  call ->name .. _sse\r\n  |  movsd qword [esp+4], xmm0  // Overwrite callee-owned arg.\r\n  |  fld qword [esp+4]\r\n  |  ret\r\n  |.endif\r\n  |\r\n  |->name .. _sse:\r\n  |  sseconst_abs xmm2, RDa\r\n  |  sseconst_2p52 xmm3, RDa\r\n  |  movaps xmm1, xmm0\r\n  |  andpd xmm1, xmm2\t\t\t// |x|\r\n  |  ucomisd xmm3, xmm1\t\t\t// No truncation if 2^52 <= |x|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |.if mode == 2\t\t// trunc(x)?\r\n  |  movaps xmm0, xmm1\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  sseconst_1 xmm3, RDa\r\n  |  cmpsd xmm0, xmm1, 1\t\t// |x| < result?\r\n  |  andpd xmm0, xmm3\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract -1.\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |.else\r\n  |  addsd xmm1, xmm3\t\t\t// (|x| + 2^52) - 2^52\r\n  |  subsd xmm1, xmm3\r\n  |  orpd xmm1, xmm2\t\t\t// Merge sign bit back in.\r\n  |  .if mode == 1\t\t// ceil(x)?\r\n  |    sseconst_m1 xmm2, RDa\t\t// Must subtract -1 to preserve -0.\r\n  |    cmpsd xmm0, xmm1, 6\t\t// x > result?\r\n  |  .else\t\t\t// floor(x)?\r\n  |    sseconst_1 xmm2, RDa\r\n  |    cmpsd xmm0, xmm1, 1\t\t// x < result?\r\n  |  .endif\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm1, xmm0\t\t\t// If yes, subtract +-1.\r\n  |.endif\r\n  |  movaps xmm0, xmm1\r\n  |1:\r\n  |  ret\r\n  |.endmacro\r\n  |\r\n  |  vm_round vm_floor, 0, 1\r\n  |  vm_round vm_ceil,  1, JIT\r\n  |  vm_round vm_trunc, 2, JIT\r\n  |\r\n  |// FP modulo x%y. Called by BC_MOD* and vm_arith.\r\n  |->vm_mod:\r\n  |// Args in xmm0/xmm1, return value in xmm0.\r\n  |// Caveat: xmm0-xmm5 and RC (eax) modified!\r\n  |  movaps xmm5, xmm0\r\n  |  divsd xmm0, xmm1\r\n  |  sseconst_abs xmm2, RDa\r\n  |  sseconst_2p52 xmm3, RDa\r\n  |  movaps xmm4, xmm0\r\n  |  andpd xmm4, xmm2\t\t\t// |x/y|\r\n  |  ucomisd xmm3, xmm4\t\t\t// No truncation if 2^52 <= |x/y|.\r\n  |  jbe >1\r\n  |  andnpd xmm2, xmm0\t\t\t// Isolate sign bit.\r\n  |  addsd xmm4, xmm3\t\t\t// (|x/y| + 2^52) - 2^52\r\n  |  subsd xmm4, xmm3\r\n  |  orpd xmm4, xmm2\t\t\t// Merge sign bit back in.\r\n  |  sseconst_1 xmm2, RDa\r\n  |  cmpsd xmm0, xmm4, 1\t\t// x/y < result?\r\n  |  andpd xmm0, xmm2\r\n  |  subsd xmm4, xmm0\t\t\t// If yes, subtract 1.0.\r\n  |  movaps xmm0, xmm5\r\n  |  mulsd xmm1, xmm4\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |1:\r\n  |  mulsd xmm1, xmm0\r\n  |  movaps xmm0, xmm5\r\n  |  subsd xmm0, xmm1\r\n  |  ret\r\n  |\r\n  |// Args in xmm0/eax. Ret in xmm0. xmm0-xmm1 and eax modified.\r\n  |->vm_powi_sse:\r\n  |  cmp eax, 1; jle >6\t\t\t// i<=1?\r\n  |  // Now 1 < (unsigned)i <= 0x80000000.\r\n  |1:  // Handle leading zeros.\r\n  |  test eax, 1; jnz >2\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1\r\n  |  jmp <1\r\n  |2:\r\n  |  shr eax, 1; jz >5\r\n  |  movaps xmm1, xmm0\r\n  |3:  // Handle trailing bits.\r\n  |  mulsd xmm0, xmm0\r\n  |  shr eax, 1; jz >4\r\n  |  jnc <3\r\n  |  mulsd xmm1, xmm0\r\n  |  jmp <3\r\n  |4:\r\n  |  mulsd xmm0, xmm1\r\n  |5:\r\n  |  ret\r\n  |6:\r\n  |  je <5\t\t\t\t// x^1 ==> x\r\n  |  jb >7\t\t\t\t// x^0 ==> 1\r\n  |  neg eax\r\n  |  call <1\r\n  |  sseconst_1 xmm1, RDa\r\n  |  divsd xmm1, xmm0\r\n  |  movaps xmm0, xmm1\r\n  |  ret\r\n  |7:\r\n  |  sseconst_1 xmm0, RDa\r\n  |  ret\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Miscellaneous functions --------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// int lj_vm_cpuid(uint32_t f, uint32_t res[4])\r\n  |->vm_cpuid:\r\n  |.if X64\r\n  |  mov eax, CARG1d\r\n  |  .if X64WIN; push rsi; mov rsi, CARG2; .endif\r\n  |  push rbx\r\n  |  cpuid\r\n  |  mov [rsi], eax\r\n  |  mov [rsi+4], ebx\r\n  |  mov [rsi+8], ecx\r\n  |  mov [rsi+12], edx\r\n  |  pop rbx\r\n  |  .if X64WIN; pop rsi; .endif\r\n  |  ret\r\n  |.else\r\n  |  pushfd\r\n  |  pop edx\r\n  |  mov ecx, edx\r\n  |  xor edx, 0x00200000\t\t// Toggle ID bit in flags.\r\n  |  push edx\r\n  |  popfd\r\n  |  pushfd\r\n  |  pop edx\r\n  |  xor eax, eax\t\t\t// Zero means no features supported.\r\n  |  cmp ecx, edx\r\n  |  jz >1\t\t\t\t// No ID toggle means no CPUID support.\r\n  |  mov eax, [esp+4]\t\t\t// Argument 1 is function number.\r\n  |  push edi\r\n  |  push ebx\r\n  |  cpuid\r\n  |  mov edi, [esp+16]\t\t\t// Argument 2 is result area.\r\n  |  mov [edi], eax\r\n  |  mov [edi+4], ebx\r\n  |  mov [edi+8], ecx\r\n  |  mov [edi+12], edx\r\n  |  pop ebx\r\n  |  pop edi\r\n  |1:\r\n  |  ret\r\n  |.endif\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- Assertions ---------------------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |->assert_bad_for_arg_type:\r\n#ifdef LUA_USE_ASSERT\r\n  |  int3\r\n#endif\r\n  |  int3\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n  |//-- FFI helper functions -----------------------------------------------\r\n  |//-----------------------------------------------------------------------\r\n  |\r\n  |// Handler for callback functions. Callback slot number in ah/al.\r\n  |->vm_ffi_callback:\r\n  |.if FFI\r\n  |.type CTSTATE, CTState, PC\r\n  |.if not X64\r\n  |  sub esp, 16\t\t\t// Leave room for SAVE_ERRF etc.\r\n  |.endif\r\n  |  saveregs_\t// ebp/rbp already saved. ebp now holds global_State *.\r\n  |  lea DISPATCH, [ebp+GG_G2DISP]\r\n  |  mov CTSTATE, GL:ebp->ctype_state\r\n  |  movzx eax, ax\r\n  |  mov CTSTATE->cb.slot, eax\r\n  |.if X64\r\n  |  mov CTSTATE->cb.gpr[0], CARG1\r\n  |  mov CTSTATE->cb.gpr[1], CARG2\r\n  |  mov CTSTATE->cb.gpr[2], CARG3\r\n  |  mov CTSTATE->cb.gpr[3], CARG4\r\n  |  movsd qword CTSTATE->cb.fpr[0], xmm0\r\n  |  movsd qword CTSTATE->cb.fpr[1], xmm1\r\n  |  movsd qword CTSTATE->cb.fpr[2], xmm2\r\n  |  movsd qword CTSTATE->cb.fpr[3], xmm3\r\n  |.if X64WIN\r\n  |  lea rax, [rsp+CFRAME_SIZE+4*8]\r\n  |.else\r\n  |  lea rax, [rsp+CFRAME_SIZE]\r\n  |  mov CTSTATE->cb.gpr[4], CARG5\r\n  |  mov CTSTATE->cb.gpr[5], CARG6\r\n  |  movsd qword CTSTATE->cb.fpr[4], xmm4\r\n  |  movsd qword CTSTATE->cb.fpr[5], xmm5\r\n  |  movsd qword CTSTATE->cb.fpr[6], xmm6\r\n  |  movsd qword CTSTATE->cb.fpr[7], xmm7\r\n  |.endif\r\n  |  mov CTSTATE->cb.stack, rax\r\n  |  mov CARG2, rsp\r\n  |.else\r\n  |  lea eax, [esp+CFRAME_SIZE+16]\r\n  |  mov CTSTATE->cb.gpr[0], FCARG1\r\n  |  mov CTSTATE->cb.gpr[1], FCARG2\r\n  |  mov CTSTATE->cb.stack, eax\r\n  |  mov FCARG1, [esp+CFRAME_SIZE+12]\t// Move around misplaced retaddr/ebp.\r\n  |  mov FCARG2, [esp+CFRAME_SIZE+8]\r\n  |  mov SAVE_RET, FCARG1\r\n  |  mov SAVE_R4, FCARG2\r\n  |  mov FCARG2, esp\r\n  |.endif\r\n  |  mov SAVE_PC, CTSTATE\t\t// Any value outside of bytecode is ok.\r\n  |  mov FCARG1, CTSTATE\r\n  |  call extern lj_ccallback_enter@8\t// (CTState *cts, void *cf)\r\n  |  // lua_State * returned in eax (RD).\r\n  |  set_vmstate INTERP\r\n  |  mov BASE, L:RD->base\r\n  |  mov RD, L:RD->top\r\n  |  sub RD, BASE\r\n  |  mov LFUNC:RB, [BASE-8]\r\n  |  shr RD, 3\r\n  |  add RD, 1\r\n  |  ins_callt\r\n  |.endif\r\n  |\r\n  |->cont_ffi_callback:\t\t\t// Return from FFI callback.\r\n  |.if FFI\r\n  |  mov L:RA, SAVE_L\r\n  |  mov CTSTATE, [DISPATCH+DISPATCH_GL(ctype_state)]\r\n  |  mov aword CTSTATE->L, L:RAa\r\n  |  mov L:RA->base, BASE\r\n  |  mov L:RA->top, RB\r\n  |  mov FCARG1, CTSTATE\r\n  |  mov FCARG2, RC\r\n  |  call extern lj_ccallback_leave@8\t// (CTState *cts, TValue *o)\r\n  |.if X64\r\n  |  mov rax, CTSTATE->cb.gpr[0]\r\n  |  movsd xmm0, qword CTSTATE->cb.fpr[0]\r\n  |  jmp ->vm_leave_unw\r\n  |.else\r\n  |  mov L:RB, SAVE_L\r\n  |  mov eax, CTSTATE->cb.gpr[0]\r\n  |  mov edx, CTSTATE->cb.gpr[1]\r\n  |  cmp dword CTSTATE->cb.gpr[2], 1\r\n  |  jb >7\r\n  |  je >6\r\n  |  fld qword CTSTATE->cb.fpr[0].d\r\n  |  jmp >7\r\n  |6:\r\n  |  fld dword CTSTATE->cb.fpr[0].f\r\n  |7:\r\n  |  mov ecx, L:RB->top\r\n  |  movzx ecx, word [ecx+6]\t\t// Get stack adjustment and copy up.\r\n  |  mov SAVE_L, ecx\t\t\t// Must be one slot above SAVE_RET\r\n  |  restoreregs\r\n  |  pop ecx\t\t\t\t// Move return addr from SAVE_RET.\r\n  |  add esp, [esp]\t\t\t// Adjust stack.\r\n  |  add esp, 16\r\n  |  push ecx\r\n  |  ret\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |->vm_ffi_call@4:\t\t\t// Call C function via FFI.\r\n  |  // Caveat: needs special frame unwinding, see below.\r\n  |.if FFI\r\n  |.if X64\r\n  |  .type CCSTATE, CCallState, rbx\r\n  |  push rbp; mov rbp, rsp; push rbx; mov CCSTATE, CARG1\r\n  |.else\r\n  |  .type CCSTATE, CCallState, ebx\r\n  |  push ebp; mov ebp, esp; push ebx; mov CCSTATE, FCARG1\r\n  |.endif\r\n  |\r\n  |  // Readjust stack.\r\n  |.if X64\r\n  |  mov eax, CCSTATE->spadj\r\n  |  sub rsp, rax\r\n  |.else\r\n  |  sub esp, CCSTATE->spadj\r\n  |.if WIN\r\n  |  mov CCSTATE->spadj, esp\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |  // Copy stack slots.\r\n  |  movzx ecx, byte CCSTATE->nsp\r\n  |  sub ecx, 1\r\n  |  js >2\r\n  |1:\r\n  |.if X64\r\n  |  mov rax, [CCSTATE+rcx*8+offsetof(CCallState, stack)]\r\n  |  mov [rsp+rcx*8+CCALL_SPS_EXTRA*8], rax\r\n  |.else\r\n  |  mov eax, [CCSTATE+ecx*4+offsetof(CCallState, stack)]\r\n  |  mov [esp+ecx*4], eax\r\n  |.endif\r\n  |  sub ecx, 1\r\n  |  jns <1\r\n  |2:\r\n  |\r\n  |.if X64\r\n  |  movzx eax, byte CCSTATE->nfpr\r\n  |  mov CARG1, CCSTATE->gpr[0]\r\n  |  mov CARG2, CCSTATE->gpr[1]\r\n  |  mov CARG3, CCSTATE->gpr[2]\r\n  |  mov CARG4, CCSTATE->gpr[3]\r\n  |.if not X64WIN\r\n  |  mov CARG5, CCSTATE->gpr[4]\r\n  |  mov CARG6, CCSTATE->gpr[5]\r\n  |.endif\r\n  |  test eax, eax; jz >5\r\n  |  movaps xmm0, CCSTATE->fpr[0]\r\n  |  movaps xmm1, CCSTATE->fpr[1]\r\n  |  movaps xmm2, CCSTATE->fpr[2]\r\n  |  movaps xmm3, CCSTATE->fpr[3]\r\n  |.if not X64WIN\r\n  |  cmp eax, 4; jbe >5\r\n  |  movaps xmm4, CCSTATE->fpr[4]\r\n  |  movaps xmm5, CCSTATE->fpr[5]\r\n  |  movaps xmm6, CCSTATE->fpr[6]\r\n  |  movaps xmm7, CCSTATE->fpr[7]\r\n  |.endif\r\n  |5:\r\n  |.else\r\n  |  mov FCARG1, CCSTATE->gpr[0]\r\n  |  mov FCARG2, CCSTATE->gpr[1]\r\n  |.endif\r\n  |\r\n  |  call aword CCSTATE->func\r\n  |\r\n  |.if X64\r\n  |  mov CCSTATE->gpr[0], rax\r\n  |  movaps CCSTATE->fpr[0], xmm0\r\n  |.if not X64WIN\r\n  |  mov CCSTATE->gpr[1], rdx\r\n  |  movaps CCSTATE->fpr[1], xmm1\r\n  |.endif\r\n  |.else\r\n  |  mov CCSTATE->gpr[0], eax\r\n  |  mov CCSTATE->gpr[1], edx\r\n  |  cmp byte CCSTATE->resx87, 1\r\n  |  jb >7\r\n  |  je >6\r\n  |  fstp qword CCSTATE->fpr[0].d[0]\r\n  |  jmp >7\r\n  |6:\r\n  |  fstp dword CCSTATE->fpr[0].f[0]\r\n  |7:\r\n  |.if WIN\r\n  |  sub CCSTATE->spadj, esp\r\n  |.endif\r\n  |.endif\r\n  |\r\n  |.if X64\r\n  |  mov rbx, [rbp-8]; leave; ret\r\n  |.else\r\n  |  mov ebx, [ebp-4]; leave; ret\r\n  |.endif\r\n  |.endif\r\n  |// Note: vm_ffi_call must be the last function in this object file!\r\n  |\r\n  |//-----------------------------------------------------------------------\r\n}\r\n\r\n/* Generate the code for a single instruction. */\r\nstatic void build_ins(BuildCtx *ctx, BCOp op, int defop)\r\n{\r\n  int vk = 0;\r\n  |// Note: aligning all instructions does not pay off.\r\n  |=>defop:\r\n\r\n  switch (op) {\r\n\r\n  /* -- Comparison ops ---------------------------------------------------- */\r\n\r\n  /* Remember: all ops branch for a true comparison, fall through otherwise. */\r\n\r\n  |.macro jmp_comp, lt, ge, le, gt, target\r\n  ||switch (op) {\r\n  ||case BC_ISLT:\r\n  |   lt target\r\n  ||break;\r\n  ||case BC_ISGE:\r\n  |   ge target\r\n  ||break;\r\n  ||case BC_ISLE:\r\n  |   le target\r\n  ||break;\r\n  ||case BC_ISGT:\r\n  |   gt target\r\n  ||break;\r\n  ||default: break;  /* Shut up GCC. */\r\n  ||}\r\n  |.endmacro\r\n\r\n  case BC_ISLT: case BC_ISGE: case BC_ISLE: case BC_ISGT:\r\n    |  // RA = src1, RD = src2, JMP with RD = target\r\n    |  ins_AD\r\n    |.if DUALNUM\r\n    |  checkint RA, >7\r\n    |  checkint RD, >8\r\n    |  mov RB, dword [BASE+RA*8]\r\n    |  add PC, 4\r\n    |  cmp RB, dword [BASE+RD*8]\r\n    |  jmp_comp jge, jl, jg, jle, >9\r\n    |6:\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is a number.\r\n    |  cmp dword [BASE+RD*8+4], LJ_TISNUM; jb >1; jne ->vmeta_comp\r\n    |  // RA is a number, RD is an integer.\r\n    |  cvtsi2sd xmm0, dword [BASE+RD*8]\r\n    |  jmp >2\r\n    |\r\n    |8:  // RA is an integer, RD is not an integer.\r\n    |  ja ->vmeta_comp\r\n    |  // RA is an integer, RD is a number.\r\n    |  cvtsi2sd xmm1, dword [BASE+RA*8]\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |  add PC, 4\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp_comp jbe, ja, jb, jae, <9\r\n    |  jmp <6\r\n    |.else\r\n    |  checknum RA, ->vmeta_comp\r\n    |  checknum RD, ->vmeta_comp\r\n    |.endif\r\n    |1:\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |2:\r\n    |  add PC, 4\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |3:\r\n    |  // Unordered: all of ZF CF PF set, ordered: PF clear.\r\n    |  // To preserve NaN semantics GE/GT branch on unordered, but LT/LE don't.\r\n    |.if DUALNUM\r\n    |  jmp_comp jbe, ja, jb, jae, <9\r\n    |  jmp <6\r\n    |.else\r\n    |  jmp_comp jbe, ja, jb, jae, >1\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |1:\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n\r\n  case BC_ISEQV: case BC_ISNEV:\r\n    vk = op == BC_ISEQV;\r\n    |  ins_AD\t// RA = src1, RD = src2, JMP with RD = target\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  add PC, 4\r\n    |.if DUALNUM\r\n    |  cmp RB, LJ_TISNUM; jne >7\r\n    |  checkint RA, >8\r\n    |  mov RB, dword [BASE+RD*8]\r\n    |  cmp RB, dword [BASE+RA*8]\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RD is not an integer.\r\n    |  ja >5\r\n    |  // RD is a number.\r\n    |  cmp dword [BASE+RA*8+4], LJ_TISNUM; jb >1; jne >5\r\n    |  // RD is a number, RA is an integer.\r\n    |  cvtsi2sd xmm0, dword [BASE+RA*8]\r\n    |  jmp >2\r\n    |\r\n    |8:  // RD is an integer, RA is not an integer.\r\n    |  ja >5\r\n    |  // RD is an integer, RA is a number.\r\n    |  cvtsi2sd xmm0, dword [BASE+RD*8]\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |  jmp >4\r\n    |\r\n    |.else\r\n    |  cmp RB, LJ_TISNUM; jae >5\r\n    |  checknum RA, >5\r\n    |.endif\r\n    |1:\r\n    |  movsd xmm0, qword [BASE+RA*8]\r\n    |2:\r\n    |  ucomisd xmm0, qword [BASE+RD*8]\r\n    |4:\r\n  iseqne_fp:\r\n    if (vk) {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  jne >2\r\n    } else {\r\n      |  jp >2\t\t\t\t// Unordered means not equal.\r\n      |  je >1\r\n    }\r\n  iseqne_end:\r\n    if (vk) {\r\n      |1:\t\t\t\t// EQ: Branch to the target.\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\t\t\t\t// NE: Fallthrough to next instruction.\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n    } else {\r\n      |.if not FFI\r\n      |3:\r\n      |.endif\r\n      |2:\t\t\t\t// NE: Branch to the target.\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |1:\t\t\t\t// EQ: Fallthrough to next instruction.\r\n    }\r\n    if (LJ_DUALNUM && (op == BC_ISEQV || op == BC_ISNEV ||\r\n\t\t       op == BC_ISEQN || op == BC_ISNEN)) {\r\n      |  jmp <9\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    if (op == BC_ISEQV || op == BC_ISNEV) {\r\n      |5:  // Either or both types are not numbers.\r\n      |.if FFI\r\n      |  cmp RB, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  checktp RA, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |.endif\r\n      |  checktp RA, RB\t\t\t// Compare types.\r\n      |  jne <2\t\t\t\t// Not the same type?\r\n      |  cmp RB, LJ_TISPRI\r\n      |  jae <1\t\t\t\t// Same type and primitive type?\r\n      |\r\n      |  // Same types and not a primitive type. Compare GCobj or pvalue.\r\n      |  mov RA, [BASE+RA*8]\r\n      |  mov RD, [BASE+RD*8]\r\n      |  cmp RA, RD\r\n      |  je <1\t\t\t\t// Same GCobjs or pvalues?\r\n      |  cmp RB, LJ_TISTABUD\r\n      |  ja <2\t\t\t\t// Different objects and not table/ud?\r\n      |.if X64\r\n      |  cmp RB, LJ_TUDATA\t\t// And not 64 bit lightuserdata.\r\n      |  jb <2\r\n      |.endif\r\n      |\r\n      |  // Different tables or userdatas. Need to check __eq metamethod.\r\n      |  // Field metatable must be at same offset for GCtab and GCudata!\r\n      |  mov TAB:RB, TAB:RA->metatable\r\n      |  test TAB:RB, TAB:RB\r\n      |  jz <2\t\t\t\t// No metatable?\r\n      |  test byte TAB:RB->nomm, 1<<MM_eq\r\n      |  jnz <2\t\t\t\t// Or 'no __eq' flag set?\r\n      if (vk) {\r\n\t|  xor RB, RB\t\t\t// ne = 0\r\n      } else {\r\n\t|  mov RB, 1\t\t\t// ne = 1\r\n      }\r\n      |  jmp ->vmeta_equal\t\t// Handle __eq metamethod.\r\n    } else {\r\n      |.if FFI\r\n      |3:\r\n      |  cmp RB, LJ_TCDATA\r\n      if (LJ_DUALNUM && vk) {\r\n\t|  jne <9\r\n      } else {\r\n\t|  jne <2\r\n      }\r\n      |  jmp ->vmeta_equal_cd\r\n      |.endif\r\n    }\r\n    break;\r\n  case BC_ISEQS: case BC_ISNES:\r\n    vk = op == BC_ISEQS;\r\n    |  ins_AND\t// RA = src, RD = str const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, LJ_TSTR; jne >3\r\n    |  mov RA, [BASE+RA*8]\r\n    |  cmp RA, [KBASE+RD*4]\r\n  iseqne_test:\r\n    if (vk) {\r\n      |  jne >2\r\n    } else {\r\n      |  je >1\r\n    }\r\n    goto iseqne_end;\r\n  case BC_ISEQN: case BC_ISNEN:\r\n    vk = op == BC_ISEQN;\r\n    |  ins_AD\t// RA = src, RD = num const, JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |.if DUALNUM\r\n    |  cmp RB, LJ_TISNUM; jne >7\r\n    |  cmp dword [KBASE+RD*8+4], LJ_TISNUM; jne >8\r\n    |  mov RB, dword [KBASE+RD*8]\r\n    |  cmp RB, dword [BASE+RA*8]\r\n    if (vk) {\r\n      |  jne >9\r\n    } else {\r\n      |  je >9\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |9:\r\n    |  ins_next\r\n    |\r\n    |7:  // RA is not an integer.\r\n    |  ja >3\r\n    |  // RA is a number.\r\n    |  cmp dword [KBASE+RD*8+4], LJ_TISNUM; jb >1\r\n    |  // RA is a number, RD is an integer.\r\n    |  cvtsi2sd xmm0, dword [KBASE+RD*8]\r\n    |  jmp >2\r\n    |\r\n    |8:  // RA is an integer, RD is a number.\r\n    |  cvtsi2sd xmm0, dword [BASE+RA*8]\r\n    |  ucomisd xmm0, qword [KBASE+RD*8]\r\n    |  jmp >4\r\n    |.else\r\n    |  cmp RB, LJ_TISNUM; jae >3\r\n    |.endif\r\n    |1:\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |2:\r\n    |  ucomisd xmm0, qword [BASE+RA*8]\r\n    |4:\r\n    goto iseqne_fp;\r\n  case BC_ISEQP: case BC_ISNEP:\r\n    vk = op == BC_ISEQP;\r\n    |  ins_AND\t// RA = src, RD = primitive type (~), JMP with RD = target\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, RD\r\n    if (!LJ_HASFFI) goto iseqne_test;\r\n    if (vk) {\r\n      |  jne >3\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n      |3:\r\n      |  cmp RB, LJ_TCDATA; jne <2\r\n      |  jmp ->vmeta_equal_cd\r\n    } else {\r\n      |  je >2\r\n      |  cmp RB, LJ_TCDATA; je ->vmeta_equal_cd\r\n      |  movzx RD, PC_RD\r\n      |  branchPC RD\r\n      |2:\r\n      |  ins_next\r\n    }\r\n    break;\r\n\r\n  /* -- Unary test and copy ops ------------------------------------------- */\r\n\r\n  case BC_ISTC: case BC_ISFC: case BC_IST: case BC_ISF:\r\n    |  ins_AD\t// RA = dst or unused, RD = src, JMP with RD = target\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  add PC, 4\r\n    |  cmp RB, LJ_TISTRUECOND\r\n    if (op == BC_IST || op == BC_ISTC) {\r\n      |  jae >1\r\n    } else {\r\n      |  jb >1\r\n    }\r\n    if (op == BC_ISTC || op == BC_ISFC) {\r\n      |  mov [BASE+RA*8+4], RB\r\n      |  mov RB, [BASE+RD*8]\r\n      |  mov [BASE+RA*8], RB\r\n    }\r\n    |  movzx RD, PC_RD\r\n    |  branchPC RD\r\n    |1:\t\t\t\t\t// Fallthrough to the next instruction.\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_ISTYPE:\r\n    |  ins_AD\t// RA = src, RD = -type\r\n    |  add RD, [BASE+RA*8+4]\r\n    |  jne ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n  case BC_ISNUM:\r\n    |  ins_AD\t// RA = src, RD = -(TISNUM-1)\r\n    |  checknum RA, ->vmeta_istype\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Unary ops --------------------------------------------------------- */\r\n\r\n  case BC_MOV:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |.if X64\r\n    |  mov RBa, [BASE+RD*8]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RD*8+4]\r\n    |  mov RD, [BASE+RD*8]\r\n    |  mov [BASE+RA*8+4], RB\r\n    |  mov [BASE+RA*8], RD\r\n    |.endif\r\n    |  ins_next_\r\n    break;\r\n  case BC_NOT:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  xor RB, RB\r\n    |  checktp RD, LJ_TISTRUECOND\r\n    |  adc RB, LJ_TTRUE\r\n    |  mov [BASE+RA*8+4], RB\r\n    |  ins_next\r\n    break;\r\n  case BC_UNM:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |.if DUALNUM\r\n    |  checkint RD, >5\r\n    |  mov RB, [BASE+RD*8]\r\n    |  neg RB\r\n    |  jo >4\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RB\r\n    |9:\r\n    |  ins_next\r\n    |4:\r\n    |  mov dword [BASE+RA*8+4], 0x41e00000  // 2^31.\r\n    |  mov dword [BASE+RA*8], 0\r\n    |  jmp <9\r\n    |5:\r\n    |  ja ->vmeta_unm\r\n    |.else\r\n    |  checknum RD, ->vmeta_unm\r\n    |.endif\r\n    |  movsd xmm0, qword [BASE+RD*8]\r\n    |  sseconst_sign xmm1, RDa\r\n    |  xorps xmm0, xmm1\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.if DUALNUM\r\n    |  jmp <9\r\n    |.else\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_LEN:\r\n    |  ins_AD\t// RA = dst, RD = src\r\n    |  checkstr RD, >2\r\n    |  mov STR:RD, [BASE+RD*8]\r\n    |.if DUALNUM\r\n    |  mov RD, dword STR:RD->len\r\n    |1:\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RD\r\n    |.else\r\n    |  xorps xmm0, xmm0\r\n    |  cvtsi2sd xmm0, dword STR:RD->len\r\n    |1:\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  ins_next\r\n    |2:\r\n    |  checktab RD, ->vmeta_len\r\n    |  mov TAB:FCARG1, [BASE+RD*8]\r\n#if LJ_52\r\n    |  mov TAB:RB, TAB:FCARG1->metatable\r\n    |  cmp TAB:RB, 0\r\n    |  jnz >9\r\n    |3:\r\n#endif\r\n    |->BC_LEN_Z:\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |  call extern lj_tab_len@4\t\t// (GCtab *t)\r\n    |  // Length of table returned in eax (RD).\r\n    |.if DUALNUM\r\n    |  // Nothing to do.\r\n    |.else\r\n    |  cvtsi2sd xmm0, RD\r\n    |.endif\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  movzx RA, PC_RA\r\n    |  jmp <1\r\n#if LJ_52\r\n    |9:  // Check for __len.\r\n    |  test byte TAB:RB->nomm, 1<<MM_len\r\n    |  jnz <3\r\n    |  jmp ->vmeta_len\t\t\t// 'no __len' flag NOT set: check.\r\n#endif\r\n    break;\r\n\r\n  /* -- Binary ops -------------------------------------------------------- */\r\n\r\n    |.macro ins_arithpre, sseins, ssereg\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   checknum RB, ->vmeta_arith_vn\r\n    |   .if DUALNUM\r\n    |     cmp dword [KBASE+RC*8+4], LJ_TISNUM; jae ->vmeta_arith_vn\r\n    |   .endif\r\n    |   movsd xmm0, qword [BASE+RB*8]\r\n    |   sseins ssereg, qword [KBASE+RC*8]\r\n    ||  break;\r\n    ||case 1:\r\n    |   checknum RB, ->vmeta_arith_nv\r\n    |   .if DUALNUM\r\n    |     cmp dword [KBASE+RC*8+4], LJ_TISNUM; jae ->vmeta_arith_nv\r\n    |   .endif\r\n    |   movsd xmm0, qword [KBASE+RC*8]\r\n    |   sseins ssereg, qword [BASE+RB*8]\r\n    ||  break;\r\n    ||default:\r\n    |   checknum RB, ->vmeta_arith_vv\r\n    |   checknum RC, ->vmeta_arith_vv\r\n    |   movsd xmm0, qword [BASE+RB*8]\r\n    |   sseins ssereg, qword [BASE+RC*8]\r\n    ||  break;\r\n    ||}\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithdn, intins\r\n    |  ins_ABC\r\n    ||vk = ((int)op - BC_ADDVN) / (BC_ADDNV-BC_ADDVN);\r\n    ||switch (vk) {\r\n    ||case 0:\r\n    |   checkint RB, ->vmeta_arith_vn\r\n    |   cmp dword [KBASE+RC*8+4], LJ_TISNUM; jne ->vmeta_arith_vn\r\n    |   mov RB, [BASE+RB*8]\r\n    |   intins RB, [KBASE+RC*8]; jo ->vmeta_arith_vno\r\n    ||  break;\r\n    ||case 1:\r\n    |   checkint RB, ->vmeta_arith_nv\r\n    |   cmp dword [KBASE+RC*8+4], LJ_TISNUM; jne ->vmeta_arith_nv\r\n    |   mov RC, [KBASE+RC*8]\r\n    |   intins RC, [BASE+RB*8]; jo ->vmeta_arith_nvo\r\n    ||  break;\r\n    ||default:\r\n    |   checkint RB, ->vmeta_arith_vv\r\n    |   checkint RC, ->vmeta_arith_vv\r\n    |   mov RB, [BASE+RB*8]\r\n    |   intins RB, [BASE+RC*8]; jo ->vmeta_arith_vvo\r\n    ||  break;\r\n    ||}\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    ||if (vk == 1) {\r\n    |   mov dword [BASE+RA*8], RC\r\n    ||} else {\r\n    |   mov dword [BASE+RA*8], RB\r\n    ||}\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arithpost\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, sseins\r\n    |  ins_arithpre sseins, xmm0\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    |.endmacro\r\n    |\r\n    |.macro ins_arith, intins, sseins\r\n    |.if DUALNUM\r\n    |  ins_arithdn intins\r\n    |.else\r\n    |  ins_arith, sseins\r\n    |.endif\r\n    |.endmacro\r\n\r\n    |  // RA = dst, RB = src1 or num const, RC = src2 or num const\r\n  case BC_ADDVN: case BC_ADDNV: case BC_ADDVV:\r\n    |  ins_arith add, addsd\r\n    break;\r\n  case BC_SUBVN: case BC_SUBNV: case BC_SUBVV:\r\n    |  ins_arith sub, subsd\r\n    break;\r\n  case BC_MULVN: case BC_MULNV: case BC_MULVV:\r\n    |  ins_arith imul, mulsd\r\n    break;\r\n  case BC_DIVVN: case BC_DIVNV: case BC_DIVVV:\r\n    |  ins_arith divsd\r\n    break;\r\n  case BC_MODVN:\r\n    |  ins_arithpre movsd, xmm1\r\n    |->BC_MODVN_Z:\r\n    |  call ->vm_mod\r\n    |  ins_arithpost\r\n    |  ins_next\r\n    break;\r\n  case BC_MODNV: case BC_MODVV:\r\n    |  ins_arithpre movsd, xmm1\r\n    |  jmp ->BC_MODVN_Z\t\t\t// Avoid 3 copies. It's slow anyway.\r\n    break;\r\n  case BC_POW:\r\n    |  ins_arithpre movsd, xmm1\r\n    |  mov RB, BASE\r\n    |.if not X64\r\n    |  movsd FPARG1, xmm0\r\n    |  movsd FPARG3, xmm1\r\n    |.endif\r\n    |  call extern pow\r\n    |  movzx RA, PC_RA\r\n    |  mov BASE, RB\r\n    |.if X64\r\n    |  ins_arithpost\r\n    |.else\r\n    |  fstp qword [BASE+RA*8]\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_CAT:\r\n    |  ins_ABC\t// RA = dst, RB = src_start, RC = src_end\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\r\n    |  lea CARG2d, [BASE+RC*8]\r\n    |  mov CARG3d, RC\r\n    |  sub CARG3d, RB\r\n    |->BC_CAT_Z:\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  lea RA, [BASE+RC*8]\r\n    |  sub RC, RB\r\n    |  mov ARG2, RA\r\n    |  mov ARG3, RC\r\n    |->BC_CAT_Z:\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_meta_cat\t\t// (lua_State *L, TValue *top, int left)\r\n    |  // NULL (finished) or TValue * (metamethod) returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  test RC, RC\r\n    |  jnz ->vmeta_binop\r\n    |  movzx RB, PC_RB\t\t\t// Copy result to Stk[RA] from Stk[RB].\r\n    |  movzx RA, PC_RA\r\n    |.if X64\r\n    |  mov RCa, [BASE+RB*8]\r\n    |  mov [BASE+RA*8], RCa\r\n    |.else\r\n    |  mov RC, [BASE+RB*8+4]\r\n    |  mov RB, [BASE+RB*8]\r\n    |  mov [BASE+RA*8+4], RC\r\n    |  mov [BASE+RA*8], RB\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Constant ops ------------------------------------------------------ */\r\n\r\n  case BC_KSTR:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov RD, [KBASE+RD*4]\r\n    |  mov dword [BASE+RA*8+4], LJ_TSTR\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KCDATA:\r\n    |.if FFI\r\n    |  ins_AND\t// RA = dst, RD = cdata const (~)\r\n    |  mov RD, [KBASE+RD*4]\r\n    |  mov dword [BASE+RA*8+4], LJ_TCDATA\r\n    |  mov [BASE+RA*8], RD\r\n    |  ins_next\r\n    |.endif\r\n    break;\r\n  case BC_KSHORT:\r\n    |  ins_AD\t// RA = dst, RD = signed int16 literal\r\n    |.if DUALNUM\r\n    |  movsx RD, RDW\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RD\r\n    |.else\r\n    |  movsx RD, RDW\t\t\t// Sign-extend literal.\r\n    |  cvtsi2sd xmm0, RD\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_KNUM:\r\n    |  ins_AD\t// RA = dst, RD = num const\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |  ins_next\r\n    break;\r\n  case BC_KPRI:\r\n    |  ins_AND\t// RA = dst, RD = primitive type (~)\r\n    |  mov [BASE+RA*8+4], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_KNIL:\r\n    |  ins_AD\t// RA = dst_start, RD = dst_end\r\n    |  lea RA, [BASE+RA*8+12]\r\n    |  lea RD, [BASE+RD*8+4]\r\n    |  mov RB, LJ_TNIL\r\n    |  mov [RA-8], RB\t\t\t// Sets minimum 2 slots.\r\n    |1:\r\n    |  mov [RA], RB\r\n    |  add RA, 8\r\n    |  cmp RA, RD\r\n    |  jbe <1\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Upvalue and function ops ------------------------------------------ */\r\n\r\n  case BC_UGET:\r\n    |  ins_AD\t// RA = dst, RD = upvalue #\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RD*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RB, UPVAL:RB->v\r\n    |.if X64\r\n    |  mov RDa, [RB]\r\n    |  mov [BASE+RA*8], RDa\r\n    |.else\r\n    |  mov RD, [RB+4]\r\n    |  mov RB, [RB]\r\n    |  mov [BASE+RA*8+4], RD\r\n    |  mov [BASE+RA*8], RB\r\n    |.endif\r\n    |  ins_next\r\n    break;\r\n  case BC_USETV:\r\n#define TV2MARKOFS \\\r\n ((int32_t)offsetof(GCupval, marked)-(int32_t)offsetof(GCupval, tv))\r\n    |  ins_AD\t// RA = upvalue #, RD = src\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  mov RB, UPVAL:RB->v\r\n    |  mov RA, [BASE+RD*8]\r\n    |  mov RD, [BASE+RD*8+4]\r\n    |  mov [RB], RA\r\n    |  mov [RB+4], RD\r\n    |  jz >1\r\n    |  // Check barrier for closed upvalue.\r\n    |  test byte [RB+TV2MARKOFS], LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Upvalue is black. Check if new value is collectable and white.\r\n    |  sub RD, LJ_TISGCV\r\n    |  cmp RD, LJ_TNUMX - LJ_TISGCV\t\t\t// tvisgcv(v)\r\n    |  jbe <1\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(v)\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |.if X64 and not X64WIN\r\n    |  mov FCARG2, RB\r\n    |  mov RB, BASE\t\t\t// Save BASE.\r\n    |.else\r\n    |  xchg FCARG2, RB\t\t\t// Save BASE (FCARG2 == BASE).\r\n    |.endif\r\n    |  lea GL:FCARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv@8\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n#undef TV2MARKOFS\r\n  case BC_USETS:\r\n    |  ins_AND\t// RA = upvalue #, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov GCOBJ:RA, [KBASE+RD*4]\r\n    |  mov RD, UPVAL:RB->v\r\n    |  mov [RD], GCOBJ:RA\r\n    |  mov dword [RD+4], LJ_TSTR\r\n    |  test byte UPVAL:RB->marked, LJ_GC_BLACK\t\t// isblack(uv)\r\n    |  jnz >2\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check if string is white and ensure upvalue is closed.\r\n    |  test byte GCOBJ:RA->gch.marked, LJ_GC_WHITES\t// iswhite(str)\r\n    |  jz <1\r\n    |  cmp byte UPVAL:RB->closed, 0\r\n    |  jz <1\r\n    |  // Crossed a write barrier. Move the barrier forward.\r\n    |  mov RB, BASE\t\t\t// Save BASE (FCARG2 == BASE).\r\n    |  mov FCARG2, RD\r\n    |  lea GL:FCARG1, [DISPATCH+GG_DISP2G]\r\n    |  call extern lj_gc_barrieruv@8\t// (global_State *g, TValue *tv)\r\n    |  mov BASE, RB\t\t\t// Restore BASE.\r\n    |  jmp <1\r\n    break;\r\n  case BC_USETN:\r\n    |  ins_AD\t// RA = upvalue #, RD = num const\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  movsd xmm0, qword [KBASE+RD*8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RA, UPVAL:RB->v\r\n    |  movsd qword [RA], xmm0\r\n    |  ins_next\r\n    break;\r\n  case BC_USETP:\r\n    |  ins_AND\t// RA = upvalue #, RD = primitive type (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov UPVAL:RB, [LFUNC:RB+RA*4+offsetof(GCfuncL, uvptr)]\r\n    |  mov RA, UPVAL:RB->v\r\n    |  mov [RA+4], RD\r\n    |  ins_next\r\n    break;\r\n  case BC_UCLO:\r\n    |  ins_AD\t// RA = level, RD = target\r\n    |  branchPC RD\t\t\t// Do this first to free RD.\r\n    |  mov L:RB, SAVE_L\r\n    |  cmp dword L:RB->openupval, 0\r\n    |  je >1\r\n    |  mov L:RB->base, BASE\r\n    |  lea FCARG2, [BASE+RA*8]\t\t// Caveat: FCARG2 == BASE\r\n    |  mov L:FCARG1, L:RB\t\t// Caveat: FCARG1 == RA\r\n    |  call extern lj_func_closeuv@8\t// (lua_State *L, TValue *level)\r\n    |  mov BASE, L:RB->base\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_FNEW:\r\n    |  ins_AND\t// RA = dst, RD = proto const (~) (holding function prototype)\r\n    |.if X64\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n    |  mov CARG3d, [BASE-8]\r\n    |  mov CARG2d, [KBASE+RD*4]\t\t// Fetch GCproto *.\r\n    |  mov CARG1d, L:RB\r\n    |.else\r\n    |  mov LFUNC:RA, [BASE-8]\r\n    |  mov PROTO:RD, [KBASE+RD*4]\t// Fetch GCproto *.\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG3, LFUNC:RA\r\n    |  mov ARG2, PROTO:RD\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  // (lua_State *L, GCproto *pt, GCfuncL *parent)\r\n    |  call extern lj_func_newL_gc\r\n    |  // GCfuncL * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], LFUNC:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TFUNC\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Table ops --------------------------------------------------------- */\r\n\r\n  case BC_TNEW:\r\n    |  ins_AD\t// RA = dst, RD = hbits|asize\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov SAVE_PC, PC\r\n    |  jae >5\r\n    |1:\r\n    |.if X64\r\n    |  mov CARG3d, RD\r\n    |  and RD, 0x7ff\r\n    |  shr CARG3d, 11\r\n    |.else\r\n    |  mov RA, RD\r\n    |  and RD, 0x7ff\r\n    |  shr RA, 11\r\n    |  mov ARG3, RA\r\n    |.endif\r\n    |  cmp RD, 0x7ff\r\n    |  je >3\r\n    |2:\r\n    |.if X64\r\n    |  mov L:CARG1d, L:RB\r\n    |  mov CARG2d, RD\r\n    |.else\r\n    |  mov ARG1, L:RB\r\n    |  mov ARG2, RD\r\n    |.endif\r\n    |  call extern lj_tab_new  // (lua_State *L, int32_t asize, uint32_t hbits)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TTAB\r\n    |  ins_next\r\n    |3:  // Turn 0x7ff into 0x801.\r\n    |  mov RD, 0x801\r\n    |  jmp <2\r\n    |5:\r\n    |  mov L:FCARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop@4\t// (lua_State *L)\r\n    |  movzx RD, PC_RD\r\n    |  jmp <1\r\n    break;\r\n  case BC_TDUP:\r\n    |  ins_AND\t// RA = dst, RD = table const (~) (holding template table)\r\n    |  mov L:RB, SAVE_L\r\n    |  mov RA, [DISPATCH+DISPATCH_GL(gc.total)]\r\n    |  mov SAVE_PC, PC\r\n    |  cmp RA, [DISPATCH+DISPATCH_GL(gc.threshold)]\r\n    |  mov L:RB->base, BASE\r\n    |  jae >3\r\n    |2:\r\n    |  mov TAB:FCARG2, [KBASE+RD*4]\t// Caveat: FCARG2 == BASE\r\n    |  mov L:FCARG1, L:RB\t\t// Caveat: FCARG1 == RA\r\n    |  call extern lj_tab_dup@8\t\t// (lua_State *L, Table *kt)\r\n    |  // Table * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\r\n    |  mov [BASE+RA*8], TAB:RC\r\n    |  mov dword [BASE+RA*8+4], LJ_TTAB\r\n    |  ins_next\r\n    |3:\r\n    |  mov L:FCARG1, L:RB\r\n    |  call extern lj_gc_step_fixtop@4\t// (lua_State *L)\r\n    |  movzx RD, PC_RD\t\t\t// Need to reload RD.\r\n    |  not RDa\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_GGET:\r\n    |  ins_AND\t// RA = dst, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*4]\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_GSET:\r\n    |  ins_AND\t// RA = src, RD = str const (~)\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |  mov TAB:RB, LFUNC:RB->env\r\n    |  mov STR:RC, [KBASE+RD*4]\r\n    |  jmp ->BC_TSETS_Z\r\n    break;\r\n\r\n  case BC_TGETV:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = key\r\n    |  checktab RB, ->vmeta_tgetv\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |  movsd xmm0, qword [BASE+RC*8]\r\n    |  cvttsd2si RC, xmm0\r\n    |  cvtsi2sd xmm1, RC\r\n    |  ucomisd xmm0, xmm1\r\n    |  jne ->vmeta_tgetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RC, TAB:RB->asize\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tgetv\t\t// Not in array part? Use fallback.\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >2\r\n    |  // Get array slot.\r\n    |.if X64\r\n    |  mov RBa, [RC]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [RC]\r\n    |  mov RC, [RC+4]\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |.endif\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz >3\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetv\t\t\t// 'no __index' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |3:\r\n    |  mov dword [BASE+RA*8+4], LJ_TNIL\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  checkstr RC, ->vmeta_tgetv\r\n    |  mov STR:RC, [BASE+RC*8]\r\n    |  jmp ->BC_TGETS_Z\r\n    break;\r\n  case BC_TGETS:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = str const (~)\r\n    |  not RCa\r\n    |  mov STR:RC, [KBASE+RC*4]\r\n    |  checktab RB, ->vmeta_tgets\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |->BC_TGETS_Z:\t// RB = GCtab *, RC = GCstr *, refetches PC_RA.\r\n    |  mov RA, TAB:RB->hmask\r\n    |  and RA, STR:RC->hash\r\n    |  imul RA, #NODE\r\n    |  add NODE:RA, TAB:RB->node\r\n    |1:\r\n    |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n    |  jne >4\r\n    |  cmp dword NODE:RA->key.gcr, STR:RC\r\n    |  jne >4\r\n    |  // Ok, key found. Assumes: offsetof(Node, val) == 0\r\n    |  cmp dword [RA+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >5\t\t\t\t// Key found, but nil value?\r\n    |  movzx RC, PC_RA\r\n    |  // Get node value.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  mov [BASE+RC*8], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov RA, [RA+4]\r\n    |  mov [BASE+RC*8], RB\r\n    |  mov [BASE+RC*8+4], RA\r\n    |.endif\r\n    |2:\r\n    |  ins_next\r\n    |\r\n    |3:\r\n    |  movzx RC, PC_RA\r\n    |  mov dword [BASE+RC*8+4], LJ_TNIL\r\n    |  jmp <2\r\n    |\r\n    |4:  // Follow hash chain.\r\n    |  mov NODE:RA, NODE:RA->next\r\n    |  test NODE:RA, NODE:RA\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, nil result.\r\n    |\r\n    |5:  // Check for __index if table value is nil.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test TAB:RA, TAB:RA\r\n    |  jz <3\t\t\t\t// No metatable: done.\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jnz <3\t\t\t\t// 'no __index' flag set: done.\r\n    |  jmp ->vmeta_tgets\t\t// Caveat: preserve STR:RC.\r\n    break;\r\n  case BC_TGETB:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = byte literal\r\n    |  checktab RB, ->vmeta_tgetb\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tgetb\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\t// Avoid overwriting RB in fastpath.\r\n    |  je >2\r\n    |  // Get array slot.\r\n    |.if X64\r\n    |  mov RBa, [RC]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [RC]\r\n    |  mov RC, [RC+4]\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |.endif\r\n    |1:\r\n    |  ins_next\r\n    |\r\n    |2:  // Check for __index if table value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz >3\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_index\r\n    |  jz ->vmeta_tgetb\t\t\t// 'no __index' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |3:\r\n    |  mov dword [BASE+RA*8+4], LJ_TNIL\r\n    |  jmp <1\r\n    break;\r\n  case BC_TGETR:\r\n    |  ins_ABC\t// RA = dst, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |.if DUALNUM\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  cvttsd2si RC, qword [BASE+RC*8]\r\n    |.endif\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tgetr\t\t// Not in array part? Use fallback.\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Get array slot.\r\n    |->BC_TGETR_Z:\r\n    |.if X64\r\n    |  mov RBa, [RC]\r\n    |  mov [BASE+RA*8], RBa\r\n    |.else\r\n    |  mov RB, [RC]\r\n    |  mov RC, [RC+4]\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |.endif\r\n    |->BC_TGETR2_Z:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_TSETV:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = key\r\n    |  checktab RB, ->vmeta_tsetv\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |\r\n    |  // Integer key?\r\n    |.if DUALNUM\r\n    |  checkint RC, >5\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  // Convert number to int and back and compare.\r\n    |  checknum RC, >5\r\n    |  movsd xmm0, qword [BASE+RC*8]\r\n    |  cvttsd2si RC, xmm0\r\n    |  cvtsi2sd xmm1, RC\r\n    |  ucomisd xmm0, xmm1\r\n    |  jne ->vmeta_tsetv\t\t// Generic numeric key? Use fallback.\r\n    |.endif\r\n    |  cmp RC, TAB:RB->asize\t\t// Takes care of unordered, too.\r\n    |  jae ->vmeta_tsetv\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:  // Set array slot.\r\n    |.if X64\r\n    |  mov RBa, [BASE+RA*8]\r\n    |  mov [RC], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  mov RA, [BASE+RA*8]\r\n    |  mov [RC+4], RB\r\n    |  mov [RC], RA\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <1\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetv\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\r\n    |\r\n    |5:  // String key?\r\n    |  checkstr RC, ->vmeta_tsetv\r\n    |  mov STR:RC, [BASE+RC*8]\r\n    |  jmp ->BC_TSETS_Z\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RA\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    break;\r\n  case BC_TSETS:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = str const (~)\r\n    |  not RCa\r\n    |  mov STR:RC, [KBASE+RC*4]\r\n    |  checktab RB, ->vmeta_tsets\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |->BC_TSETS_Z:\t// RB = GCtab *, RC = GCstr *, refetches PC_RA.\r\n    |  mov RA, TAB:RB->hmask\r\n    |  and RA, STR:RC->hash\r\n    |  imul RA, #NODE\r\n    |  mov byte TAB:RB->nomm, 0\t\t// Clear metamethod cache.\r\n    |  add NODE:RA, TAB:RB->node\r\n    |1:\r\n    |  cmp dword NODE:RA->key.it, LJ_TSTR\r\n    |  jne >5\r\n    |  cmp dword NODE:RA->key.gcr, STR:RC\r\n    |  jne >5\r\n    |  // Ok, key found. Assumes: offsetof(Node, val) == 0\r\n    |  cmp dword [RA+4], LJ_TNIL\r\n    |  je >4\t\t\t\t// Previous value is nil?\r\n    |2:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |3:  // Set node value.\r\n    |  movzx RC, PC_RA\r\n    |.if X64\r\n    |  mov RBa, [BASE+RC*8]\r\n    |  mov [RA], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RC*8+4]\r\n    |  mov RC, [BASE+RC*8]\r\n    |  mov [RA+4], RB\r\n    |  mov [RA], RC\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |4:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <2\r\n    |  mov TMP1, RA\t\t\t// Save RA.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  mov RA, TMP1\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    |\r\n    |5:  // Follow hash chain.\r\n    |  mov NODE:RA, NODE:RA->next\r\n    |  test NODE:RA, NODE:RA\r\n    |  jnz <1\r\n    |  // End of hash chain: key not found, add a new one.\r\n    |\r\n    |  // But check for __newindex first.\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test TAB:RA, TAB:RA\r\n    |  jz >6\t\t\t\t// No metatable: continue.\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsets\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |6:\r\n    |  mov TMP1, STR:RC\r\n    |  mov TMP2, LJ_TSTR\r\n    |  mov TMP3, TAB:RB\t\t\t// Save TAB:RB for us.\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\r\n    |  lea CARG3, TMP1\r\n    |  mov CARG2d, TAB:RB\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  lea RC, TMP1\t\t\t// Store temp. TValue in TMP1/TMP2.\r\n    |  mov ARG2, TAB:RB\r\n    |  mov L:RB, SAVE_L\r\n    |  mov ARG3, RC\r\n    |  mov ARG1, L:RB\r\n    |  mov L:RB->base, BASE\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_newkey\t// (lua_State *L, GCtab *t, TValue *k)\r\n    |  // Handles write barrier for the new key. TValue * returned in eax (RC).\r\n    |  mov BASE, L:RB->base\r\n    |  mov TAB:RB, TMP3\t\t\t// Need TAB:RB for barrier.\r\n    |  mov RA, eax\r\n    |  jmp <2\t\t\t\t// Must check write barrier for value.\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RC\t\t// Destroys STR:RC.\r\n    |  jmp <3\r\n    break;\r\n  case BC_TSETB:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = byte literal\r\n    |  checktab RB, ->vmeta_tsetb\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tsetb\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  cmp dword [RC+4], LJ_TNIL\r\n    |  je >3\t\t\t\t// Previous value is nil?\r\n    |1:\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\t // Set array slot.\r\n    |.if X64\r\n    |  mov RAa, [BASE+RA*8]\r\n    |  mov [RC], RAa\r\n    |.else\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  mov RA, [BASE+RA*8]\r\n    |  mov [RC+4], RB\r\n    |  mov [RC], RA\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |3:  // Check for __newindex if previous value is nil.\r\n    |  cmp dword TAB:RB->metatable, 0\t// Shouldn't overwrite RA for fastpath.\r\n    |  jz <1\r\n    |  mov TAB:RA, TAB:RB->metatable\r\n    |  test byte TAB:RA->nomm, 1<<MM_newindex\r\n    |  jz ->vmeta_tsetb\t\t\t// 'no __newindex' flag NOT set: check.\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RA\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    break;\r\n  case BC_TSETR:\r\n    |  ins_ABC\t// RA = src, RB = table, RC = key\r\n    |  mov TAB:RB, [BASE+RB*8]\r\n    |.if DUALNUM\r\n    |  mov RC, dword [BASE+RC*8]\r\n    |.else\r\n    |  cvttsd2si RC, qword [BASE+RC*8]\r\n    |.endif\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\r\n    |  cmp RC, TAB:RB->asize\r\n    |  jae ->vmeta_tsetr\r\n    |  shl RC, 3\r\n    |  add RC, TAB:RB->array\r\n    |  // Set array slot.\r\n    |->BC_TSETR_Z:\r\n    |.if X64\r\n    |  mov RBa, [BASE+RA*8]\r\n    |  mov [RC], RBa\r\n    |.else\r\n    |  mov RB, [BASE+RA*8+4]\r\n    |  mov RA, [BASE+RA*8]\r\n    |  mov [RC+4], RB\r\n    |  mov [RC], RA\r\n    |.endif\r\n    |  ins_next\r\n    |\r\n    |7:  // Possible table write barrier for the value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RA\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_TSETM:\r\n    |  ins_AD\t// RA = base (table at base-1), RD = num const (start index)\r\n    |  mov TMP1, KBASE\t\t\t// Need one more free register.\r\n    |  mov KBASE, dword [KBASE+RD*8]\t// Integer constant is in lo-word.\r\n    |1:\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov TAB:RB, [RA-8]\t\t// Guaranteed to be a table.\r\n    |  test byte TAB:RB->marked, LJ_GC_BLACK\t// isblack(table)\r\n    |  jnz >7\r\n    |2:\r\n    |  mov RD, MULTRES\r\n    |  sub RD, 1\r\n    |  jz >4\t\t\t\t// Nothing to copy?\r\n    |  add RD, KBASE\t\t\t// Compute needed size.\r\n    |  cmp RD, TAB:RB->asize\r\n    |  ja >5\t\t\t\t// Doesn't fit into array part?\r\n    |  sub RD, KBASE\r\n    |  shl KBASE, 3\r\n    |  add KBASE, TAB:RB->array\r\n    |3:  // Copy result slots to table.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  add RA, 8\r\n    |  mov [KBASE], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov [KBASE], RB\r\n    |  mov RB, [RA+4]\r\n    |  add RA, 8\r\n    |  mov [KBASE+4], RB\r\n    |.endif\r\n    |  add KBASE, 8\r\n    |  sub RD, 1\r\n    |  jnz <3\r\n    |4:\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |5:  // Need to resize array part.\r\n    |.if X64\r\n    |  mov L:CARG1d, SAVE_L\r\n    |  mov L:CARG1d->base, BASE\t\t// Caveat: CARG2d/CARG3d may be BASE.\r\n    |  mov CARG2d, TAB:RB\r\n    |  mov CARG3d, RD\r\n    |  mov L:RB, L:CARG1d\r\n    |.else\r\n    |  mov ARG2, TAB:RB\r\n    |  mov L:RB, SAVE_L\r\n    |  mov L:RB->base, BASE\r\n    |  mov ARG3, RD\r\n    |  mov ARG1, L:RB\r\n    |.endif\r\n    |  mov SAVE_PC, PC\r\n    |  call extern lj_tab_reasize\t// (lua_State *L, GCtab *t, int nasize)\r\n    |  mov BASE, L:RB->base\r\n    |  movzx RA, PC_RA\t\t\t// Restore RA.\r\n    |  jmp <1\t\t\t\t// Retry.\r\n    |\r\n    |7:  // Possible table write barrier for any value. Skip valiswhite check.\r\n    |  barrierback TAB:RB, RD\r\n    |  jmp <2\r\n    break;\r\n\r\n  /* -- Calls and vararg handling ----------------------------------------- */\r\n\r\n  case BC_CALL: case BC_CALLM:\r\n    |  ins_A_C\t// RA = base, (RB = nresults+1,) RC = nargs+1 | extra_nargs\r\n    if (op == BC_CALLM) {\r\n      |  add NARGS:RD, MULTRES\r\n    }\r\n    |  cmp dword [BASE+RA*8+4], LJ_TFUNC\r\n    |  mov LFUNC:RB, [BASE+RA*8]\r\n    |  jne ->vmeta_call_ra\r\n    |  lea BASE, [BASE+RA*8+8]\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_CALLMT:\r\n    |  ins_AD\t// RA = base, RD = extra_nargs\r\n    |  add NARGS:RD, MULTRES\r\n    |  // Fall through. Assumes BC_CALLT follows and ins_AD is a no-op.\r\n    break;\r\n  case BC_CALLT:\r\n    |  ins_AD\t// RA = base, RD = nargs+1\r\n    |  lea RA, [BASE+RA*8+8]\r\n    |  mov KBASE, BASE\t\t\t// Use KBASE for move + vmeta_call hint.\r\n    |  mov LFUNC:RB, [RA-8]\r\n    |  cmp dword [RA-4], LJ_TFUNC\r\n    |  jne ->vmeta_call\r\n    |->BC_CALLT_Z:\r\n    |  mov PC, [BASE-4]\r\n    |  test PC, FRAME_TYPE\r\n    |  jnz >7\r\n    |1:\r\n    |  mov [BASE-8], LFUNC:RB\t\t// Copy function down, reloaded below.\r\n    |  mov MULTRES, NARGS:RD\r\n    |  sub NARGS:RD, 1\r\n    |  jz >3\r\n    |2:  // Move args down.\r\n    |.if X64\r\n    |  mov RBa, [RA]\r\n    |  add RA, 8\r\n    |  mov [KBASE], RBa\r\n    |.else\r\n    |  mov RB, [RA]\r\n    |  mov [KBASE], RB\r\n    |  mov RB, [RA+4]\r\n    |  add RA, 8\r\n    |  mov [KBASE+4], RB\r\n    |.endif\r\n    |  add KBASE, 8\r\n    |  sub NARGS:RD, 1\r\n    |  jnz <2\r\n    |\r\n    |  mov LFUNC:RB, [BASE-8]\r\n    |3:\r\n    |  mov NARGS:RD, MULTRES\r\n    |  cmp byte LFUNC:RB->ffid, 1\t// (> FF_C) Calling a fast function?\r\n    |  ja >5\r\n    |4:\r\n    |  ins_callt\r\n    |\r\n    |5:  // Tailcall to a fast function.\r\n    |  test PC, FRAME_TYPE\t\t// Lua frame below?\r\n    |  jnz <4\r\n    |  movzx RA, PC_RA\r\n    |  not RAa\r\n    |  mov LFUNC:KBASE, [BASE+RA*8-8]\t// Need to prepare KBASE.\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  jmp <4\r\n    |\r\n    |7:  // Tailcall from a vararg function.\r\n    |  sub PC, FRAME_VARG\r\n    |  test PC, FRAME_TYPEP\r\n    |  jnz >8\t\t\t\t// Vararg frame below?\r\n    |  sub BASE, PC\t\t\t// Need to relocate BASE/KBASE down.\r\n    |  mov KBASE, BASE\r\n    |  mov PC, [BASE-4]\r\n    |  jmp <1\r\n    |8:\r\n    |  add PC, FRAME_VARG\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_ITERC:\r\n    |  ins_A\t// RA = base, (RB = nresults+1,) RC = nargs+1 (2+1)\r\n    |  lea RA, [BASE+RA*8+8]\t\t// fb = base+1\r\n    |.if X64\r\n    |  mov RBa, [RA-24]\t\t\t// Copy state. fb[0] = fb[-3].\r\n    |  mov RCa, [RA-16]\t\t\t// Copy control var. fb[1] = fb[-2].\r\n    |  mov [RA], RBa\r\n    |  mov [RA+8], RCa\r\n    |.else\r\n    |  mov RB, [RA-24]\t\t\t// Copy state. fb[0] = fb[-3].\r\n    |  mov RC, [RA-20]\r\n    |  mov [RA], RB\r\n    |  mov [RA+4], RC\r\n    |  mov RB, [RA-16]\t\t\t// Copy control var. fb[1] = fb[-2].\r\n    |  mov RC, [RA-12]\r\n    |  mov [RA+8], RB\r\n    |  mov [RA+12], RC\r\n    |.endif\r\n    |  mov LFUNC:RB, [RA-32]\t\t// Copy callable. fb[-1] = fb[-4]\r\n    |  mov RC, [RA-28]\r\n    |  mov [RA-8], LFUNC:RB\r\n    |  mov [RA-4], RC\r\n    |  cmp RC, LJ_TFUNC\t\t\t// Handle like a regular 2-arg call.\r\n    |  mov NARGS:RD, 2+1\r\n    |  jne ->vmeta_call\r\n    |  mov BASE, RA\r\n    |  ins_call\r\n    break;\r\n\r\n  case BC_ITERN:\r\n    |  ins_A\t// RA = base, (RB = nresults+1, RC = nargs+1 (2+1))\r\n    |.if JIT\r\n    |  // NYI: add hotloop, record BC_ITERN.\r\n    |.endif\r\n    |  mov TMP1, KBASE\t\t\t// Need two more free registers.\r\n    |  mov TMP2, DISPATCH\r\n    |  mov TAB:RB, [BASE+RA*8-16]\r\n    |  mov RC, [BASE+RA*8-8]\t\t// Get index from control var.\r\n    |  mov DISPATCH, TAB:RB->asize\r\n    |  add PC, 4\r\n    |  mov KBASE, TAB:RB->array\r\n    |1:  // Traverse array part.\r\n    |  cmp RC, DISPATCH; jae >5\t\t// Index points after array part?\r\n    |  cmp dword [KBASE+RC*8+4], LJ_TNIL; je >4\r\n    |.if DUALNUM\r\n    |  mov dword [BASE+RA*8+4], LJ_TISNUM\r\n    |  mov dword [BASE+RA*8], RC\r\n    |.else\r\n    |  cvtsi2sd xmm0, RC\r\n    |.endif\r\n    |  // Copy array slot to returned value.\r\n    |.if X64\r\n    |  mov RBa, [KBASE+RC*8]\r\n    |  mov [BASE+RA*8+8], RBa\r\n    |.else\r\n    |  mov RB, [KBASE+RC*8+4]\r\n    |  mov [BASE+RA*8+12], RB\r\n    |  mov RB, [KBASE+RC*8]\r\n    |  mov [BASE+RA*8+8], RB\r\n    |.endif\r\n    |  add RC, 1\r\n    |  // Return array index as a numeric key.\r\n    |.if DUALNUM\r\n    |  // See above.\r\n    |.else\r\n    |  movsd qword [BASE+RA*8], xmm0\r\n    |.endif\r\n    |  mov [BASE+RA*8-8], RC\t\t// Update control var.\r\n    |2:\r\n    |  movzx RD, PC_RD\t\t\t// Get target from ITERL.\r\n    |  branchPC RD\r\n    |3:\r\n    |  mov DISPATCH, TMP2\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |4:  // Skip holes in array part.\r\n    |  add RC, 1\r\n    |  jmp <1\r\n    |\r\n    |5:  // Traverse hash part.\r\n    |  sub RC, DISPATCH\r\n    |6:\r\n    |  cmp RC, TAB:RB->hmask; ja <3\t// End of iteration? Branch to ITERL+1.\r\n    |  imul KBASE, RC, #NODE\r\n    |  add NODE:KBASE, TAB:RB->node\r\n    |  cmp dword NODE:KBASE->val.it, LJ_TNIL; je >7\r\n    |  lea DISPATCH, [RC+DISPATCH+1]\r\n    |  // Copy key and value from hash slot.\r\n    |.if X64\r\n    |  mov RBa, NODE:KBASE->key\r\n    |  mov RCa, NODE:KBASE->val\r\n    |  mov [BASE+RA*8], RBa\r\n    |  mov [BASE+RA*8+8], RCa\r\n    |.else\r\n    |  mov RB, NODE:KBASE->key.gcr\r\n    |  mov RC, NODE:KBASE->key.it\r\n    |  mov [BASE+RA*8], RB\r\n    |  mov [BASE+RA*8+4], RC\r\n    |  mov RB, NODE:KBASE->val.gcr\r\n    |  mov RC, NODE:KBASE->val.it\r\n    |  mov [BASE+RA*8+8], RB\r\n    |  mov [BASE+RA*8+12], RC\r\n    |.endif\r\n    |  mov [BASE+RA*8-8], DISPATCH\r\n    |  jmp <2\r\n    |\r\n    |7:  // Skip holes in hash part.\r\n    |  add RC, 1\r\n    |  jmp <6\r\n    break;\r\n\r\n  case BC_ISNEXT:\r\n    |  ins_AD\t// RA = base, RD = target (points to ITERN)\r\n    |  cmp dword [BASE+RA*8-20], LJ_TFUNC; jne >5\r\n    |  mov CFUNC:RB, [BASE+RA*8-24]\r\n    |  cmp dword [BASE+RA*8-12], LJ_TTAB; jne >5\r\n    |  cmp dword [BASE+RA*8-4], LJ_TNIL; jne >5\r\n    |  cmp byte CFUNC:RB->ffid, FF_next_N; jne >5\r\n    |  branchPC RD\r\n    |  mov dword [BASE+RA*8-8], 0\t// Initialize control var.\r\n    |  mov dword [BASE+RA*8-4], 0xfffe7fff\r\n    |1:\r\n    |  ins_next\r\n    |5:  // Despecialize bytecode if any of the checks fail.\r\n    |  mov PC_OP, BC_JMP\r\n    |  branchPC RD\r\n    |  mov byte [PC], BC_ITERC\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_VARG:\r\n    |  ins_ABC\t// RA = base, RB = nresults+1, RC = numparams\r\n    |  mov TMP1, KBASE\t\t\t// Need one more free register.\r\n    |  lea KBASE, [BASE+RC*8+(8+FRAME_VARG)]\r\n    |  lea RA, [BASE+RA*8]\r\n    |  sub KBASE, [BASE-4]\r\n    |  // Note: KBASE may now be even _above_ BASE if nargs was < numparams.\r\n    |  test RB, RB\r\n    |  jz >5\t\t\t\t// Copy all varargs?\r\n    |  lea RB, [RA+RB*8-8]\r\n    |  cmp KBASE, BASE\t\t\t// No vararg slots?\r\n    |  jnb >2\r\n    |1:  // Copy vararg slots to destination slots.\r\n    |.if X64\r\n    |  mov RCa, [KBASE-8]\r\n    |  add KBASE, 8\r\n    |  mov [RA], RCa\r\n    |.else\r\n    |  mov RC, [KBASE-8]\r\n    |  mov [RA], RC\r\n    |  mov RC, [KBASE-4]\r\n    |  add KBASE, 8\r\n    |  mov [RA+4], RC\r\n    |.endif\r\n    |  add RA, 8\r\n    |  cmp RA, RB\t\t\t// All destination slots filled?\r\n    |  jnb >3\r\n    |  cmp KBASE, BASE\t\t\t// No more vararg slots?\r\n    |  jb <1\r\n    |2:  // Fill up remainder with nil.\r\n    |  mov dword [RA+4], LJ_TNIL\r\n    |  add RA, 8\r\n    |  cmp RA, RB\r\n    |  jb <2\r\n    |3:\r\n    |  mov KBASE, TMP1\r\n    |  ins_next\r\n    |\r\n    |5:  // Copy all varargs.\r\n    |  mov MULTRES, 1\t\t\t// MULTRES = 0+1\r\n    |  mov RC, BASE\r\n    |  sub RC, KBASE\r\n    |  jbe <3\t\t\t\t// No vararg slots?\r\n    |  mov RB, RC\r\n    |  shr RB, 3\r\n    |  add RB, 1\r\n    |  mov MULTRES, RB\t\t\t// MULTRES = #varargs+1\r\n    |  mov L:RB, SAVE_L\r\n    |  add RC, RA\r\n    |  cmp RC, L:RB->maxstack\r\n    |  ja >7\t\t\t\t// Need to grow stack?\r\n    |6:  // Copy all vararg slots.\r\n    |.if X64\r\n    |  mov RCa, [KBASE-8]\r\n    |  add KBASE, 8\r\n    |  mov [RA], RCa\r\n    |.else\r\n    |  mov RC, [KBASE-8]\r\n    |  mov [RA], RC\r\n    |  mov RC, [KBASE-4]\r\n    |  add KBASE, 8\r\n    |  mov [RA+4], RC\r\n    |.endif\r\n    |  add RA, 8\r\n    |  cmp KBASE, BASE\t\t\t// No more vararg slots?\r\n    |  jb <6\r\n    |  jmp <3\r\n    |\r\n    |7:  // Grow stack for varargs.\r\n    |  mov L:RB->base, BASE\r\n    |  mov L:RB->top, RA\r\n    |  mov SAVE_PC, PC\r\n    |  sub KBASE, BASE\t\t\t// Need delta, because BASE may change.\r\n    |  mov FCARG2, MULTRES\r\n    |  sub FCARG2, 1\r\n    |  mov FCARG1, L:RB\r\n    |  call extern lj_state_growstack@8\t// (lua_State *L, int n)\r\n    |  mov BASE, L:RB->base\r\n    |  mov RA, L:RB->top\r\n    |  add KBASE, BASE\r\n    |  jmp <6\r\n    break;\r\n\r\n  /* -- Returns ----------------------------------------------------------- */\r\n\r\n  case BC_RETM:\r\n    |  ins_AD\t// RA = results, RD = extra_nresults\r\n    |  add RD, MULTRES\t\t\t// MULTRES >=1, so RD >=1.\r\n    |  // Fall through. Assumes BC_RET follows and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_RET: case BC_RET0: case BC_RET1:\r\n    |  ins_AD\t// RA = results, RD = nresults+1\r\n    if (op != BC_RET0) {\r\n      |  shl RA, 3\r\n    }\r\n    |1:\r\n    |  mov PC, [BASE-4]\r\n    |  mov MULTRES, RD\t\t\t// Save nresults+1.\r\n    |  test PC, FRAME_TYPE\t\t// Check frame type marker.\r\n    |  jnz >7\t\t\t\t// Not returning to a fixarg Lua func?\r\n    switch (op) {\r\n    case BC_RET:\r\n      |->BC_RET_Z:\r\n      |  mov KBASE, BASE\t\t// Use KBASE for result move.\r\n      |  sub RD, 1\r\n      |  jz >3\r\n      |2:  // Move results down.\r\n      |.if X64\r\n      |  mov RBa, [KBASE+RA]\r\n      |  mov [KBASE-8], RBa\r\n      |.else\r\n      |  mov RB, [KBASE+RA]\r\n      |  mov [KBASE-8], RB\r\n      |  mov RB, [KBASE+RA+4]\r\n      |  mov [KBASE-4], RB\r\n      |.endif\r\n      |  add KBASE, 8\r\n      |  sub RD, 1\r\n      |  jnz <2\r\n      |3:\r\n      |  mov RD, MULTRES\t\t// Note: MULTRES may be >255.\r\n      |  movzx RB, PC_RB\t\t// So cannot compare with RDL!\r\n      |5:\r\n      |  cmp RB, RD\t\t\t// More results expected?\r\n      |  ja >6\r\n      break;\r\n    case BC_RET1:\r\n      |.if X64\r\n      |  mov RBa, [BASE+RA]\r\n      |  mov [BASE-8], RBa\r\n      |.else\r\n      |  mov RB, [BASE+RA+4]\r\n      |  mov [BASE-4], RB\r\n      |  mov RB, [BASE+RA]\r\n      |  mov [BASE-8], RB\r\n      |.endif\r\n      /* fallthrough */\r\n    case BC_RET0:\r\n      |5:\r\n      |  cmp PC_RB, RDL\t\t\t// More results expected?\r\n      |  ja >6\r\n    default:\r\n      break;\r\n    }\r\n    |  movzx RA, PC_RA\r\n    |  not RAa\t\t\t\t// Note: ~RA = -(RA+1)\r\n    |  lea BASE, [BASE+RA*8]\t\t// base = base - (RA+1)*8\r\n    |  mov LFUNC:KBASE, [BASE-8]\r\n    |  mov KBASE, LFUNC:KBASE->pc\r\n    |  mov KBASE, [KBASE+PC2PROTO(k)]\r\n    |  ins_next\r\n    |\r\n    |6:  // Fill up results with nil.\r\n    if (op == BC_RET) {\r\n      |  mov dword [KBASE-4], LJ_TNIL\t// Note: relies on shifted base.\r\n      |  add KBASE, 8\r\n    } else {\r\n      |  mov dword [BASE+RD*8-12], LJ_TNIL\r\n    }\r\n    |  add RD, 1\r\n    |  jmp <5\r\n    |\r\n    |7:  // Non-standard return case.\r\n    |  lea RB, [PC-FRAME_VARG]\r\n    |  test RB, FRAME_TYPEP\r\n    |  jnz ->vm_return\r\n    |  // Return from vararg function: relocate BASE down and RA up.\r\n    |  sub BASE, RB\r\n    if (op != BC_RET0) {\r\n      |  add RA, RB\r\n    }\r\n    |  jmp <1\r\n    break;\r\n\r\n  /* -- Loops and branches ------------------------------------------------ */\r\n\r\n  |.define FOR_IDX,  [RA];    .define FOR_TIDX,  dword [RA+4]\r\n  |.define FOR_STOP, [RA+8];  .define FOR_TSTOP, dword [RA+12]\r\n  |.define FOR_STEP, [RA+16]; .define FOR_TSTEP, dword [RA+20]\r\n  |.define FOR_EXT,  [RA+24]; .define FOR_TEXT,  dword [RA+28]\r\n\r\n  case BC_FORL:\r\n    |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_IFORL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JFORI:\r\n  case BC_JFORL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_FORI:\r\n  case BC_IFORL:\r\n    vk = (op == BC_IFORL || op == BC_JFORL);\r\n    |  ins_AJ\t// RA = base, RD = target (after end of loop or start of loop)\r\n    |  lea RA, [BASE+RA*8]\r\n    if (LJ_DUALNUM) {\r\n      |  cmp FOR_TIDX, LJ_TISNUM; jne >9\r\n      if (!vk) {\r\n\t|  cmp FOR_TSTOP, LJ_TISNUM; jne ->vmeta_for\r\n\t|  cmp FOR_TSTEP, LJ_TISNUM; jne ->vmeta_for\r\n\t|  mov RB, dword FOR_IDX\r\n\t|  cmp dword FOR_STEP, 0; jl >5\r\n      } else {\r\n#ifdef LUA_USE_ASSERT\r\n\t|  cmp FOR_TSTOP, LJ_TISNUM; jne ->assert_bad_for_arg_type\r\n\t|  cmp FOR_TSTEP, LJ_TISNUM; jne ->assert_bad_for_arg_type\r\n#endif\r\n\t|  mov RB, dword FOR_STEP\r\n\t|  test RB, RB; js >5\r\n\t|  add RB, dword FOR_IDX; jo >1\r\n\t|  mov dword FOR_IDX, RB\r\n      }\r\n      |  cmp RB, dword FOR_STOP\r\n      |  mov FOR_TEXT, LJ_TISNUM\r\n      |  mov dword FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jle >7\r\n\t|1:\r\n\t|6:\r\n\t|  branchPC RD\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RD, PC_RD\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      } else if (op == BC_IFORL) {\r\n\t|  jg >7\r\n\t|6:\r\n\t|  branchPC RD\r\n\t|1:\r\n      } else {\r\n\t|  jle =>BC_JLOOP\r\n\t|1:\r\n\t|6:\r\n      }\r\n      |7:\r\n      |  ins_next\r\n      |\r\n      |5:  // Invert check for negative step.\r\n      if (vk) {\r\n\t|  add RB, dword FOR_IDX; jo <1\r\n\t|  mov dword FOR_IDX, RB\r\n      }\r\n      |  cmp RB, dword FOR_STOP\r\n      |  mov FOR_TEXT, LJ_TISNUM\r\n      |  mov dword FOR_EXT, RB\r\n      if (op == BC_FORI) {\r\n\t|  jge <7\r\n      } else if (op == BC_JFORI) {\r\n\t|  branchPC RD\r\n\t|  movzx RD, PC_RD\r\n\t|  jge =>BC_JLOOP\r\n      } else if (op == BC_IFORL) {\r\n\t|  jl <7\r\n      } else {\r\n\t|  jge =>BC_JLOOP\r\n      }\r\n      |  jmp <6\r\n      |9:  // Fallback to FP variant.\r\n    } else if (!vk) {\r\n      |  cmp FOR_TIDX, LJ_TISNUM\r\n    }\r\n    if (!vk) {\r\n      |  jae ->vmeta_for\r\n      |  cmp FOR_TSTOP, LJ_TISNUM; jae ->vmeta_for\r\n    } else {\r\n#ifdef LUA_USE_ASSERT\r\n      |  cmp FOR_TSTOP, LJ_TISNUM; jae ->assert_bad_for_arg_type\r\n      |  cmp FOR_TSTEP, LJ_TISNUM; jae ->assert_bad_for_arg_type\r\n#endif\r\n    }\r\n    |  mov RB, FOR_TSTEP\t\t// Load type/hiword of for step.\r\n    if (!vk) {\r\n      |  cmp RB, LJ_TISNUM; jae ->vmeta_for\r\n    }\r\n    |  movsd xmm0, qword FOR_IDX\r\n    |  movsd xmm1, qword FOR_STOP\r\n    if (vk) {\r\n      |  addsd xmm0, qword FOR_STEP\r\n      |  movsd qword FOR_IDX, xmm0\r\n      |  test RB, RB; js >3\r\n    } else {\r\n      |  jl >3\r\n    }\r\n    |  ucomisd xmm1, xmm0\r\n    |1:\r\n    |  movsd qword FOR_EXT, xmm0\r\n    if (op == BC_FORI) {\r\n      |.if DUALNUM\r\n      |  jnb <7\r\n      |.else\r\n      |  jnb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else if (op == BC_JFORI) {\r\n      |  branchPC RD\r\n      |  movzx RD, PC_RD\r\n      |  jnb =>BC_JLOOP\r\n    } else if (op == BC_IFORL) {\r\n      |.if DUALNUM\r\n      |  jb <7\r\n      |.else\r\n      |  jb >2\r\n      |  branchPC RD\r\n      |.endif\r\n    } else {\r\n      |  jnb =>BC_JLOOP\r\n    }\r\n    |.if DUALNUM\r\n    |  jmp <6\r\n    |.else\r\n    |2:\r\n    |  ins_next\r\n    |.endif\r\n    |\r\n    |3:  // Invert comparison if step is negative.\r\n    |  ucomisd xmm0, xmm1\r\n    |  jmp <1\r\n    break;\r\n\r\n  case BC_ITERL:\r\n    |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_IITERL follows and ins_AJ is a no-op.\r\n    break;\r\n\r\n  case BC_JITERL:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IITERL:\r\n    |  ins_AJ\t// RA = base, RD = target\r\n    |  lea RA, [BASE+RA*8]\r\n    |  mov RB, [RA+4]\r\n    |  cmp RB, LJ_TNIL; je >1\t\t// Stop if iterator returned nil.\r\n    if (op == BC_JITERL) {\r\n      |  mov [RA-4], RB\r\n      |  mov RB, [RA]\r\n      |  mov [RA-8], RB\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  branchPC RD\t\t\t// Otherwise save control var + branch.\r\n      |  mov RD, [RA]\r\n      |  mov [RA-4], RB\r\n      |  mov [RA-8], RD\r\n    }\r\n    |1:\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_LOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  // Note: RA/RD is only used by trace recorder to determine scope/extent\r\n    |  // This opcode does NOT jump, it's only purpose is to detect a hot loop.\r\n    |.if JIT\r\n    |  hotloop RB\r\n    |.endif\r\n    | // Fall through. Assumes BC_ILOOP follows and ins_A is a no-op.\r\n    break;\r\n\r\n  case BC_ILOOP:\r\n    |  ins_A\t// RA = base, RD = target (loop extent)\r\n    |  ins_next\r\n    break;\r\n\r\n  case BC_JLOOP:\r\n    |.if JIT\r\n    |  ins_AD\t// RA = base (ignored), RD = traceno\r\n    |  mov RA, [DISPATCH+DISPATCH_J(trace)]\r\n    |  mov TRACE:RD, [RA+RD*4]\r\n    |  mov RDa, TRACE:RD->mcode\r\n    |  mov L:RB, SAVE_L\r\n    |  mov [DISPATCH+DISPATCH_GL(jit_base)], BASE\r\n    |  mov [DISPATCH+DISPATCH_GL(tmpbuf.L)], L:RB\r\n    |  // Save additional callee-save registers only used in compiled code.\r\n    |.if X64WIN\r\n    |  mov TMPQ, r12\r\n    |  mov TMPa, r13\r\n    |  mov CSAVE_4, r14\r\n    |  mov CSAVE_3, r15\r\n    |  mov RAa, rsp\r\n    |  sub rsp, 9*16+4*8\r\n    |  movdqa [RAa], xmm6\r\n    |  movdqa [RAa-1*16], xmm7\r\n    |  movdqa [RAa-2*16], xmm8\r\n    |  movdqa [RAa-3*16], xmm9\r\n    |  movdqa [RAa-4*16], xmm10\r\n    |  movdqa [RAa-5*16], xmm11\r\n    |  movdqa [RAa-6*16], xmm12\r\n    |  movdqa [RAa-7*16], xmm13\r\n    |  movdqa [RAa-8*16], xmm14\r\n    |  movdqa [RAa-9*16], xmm15\r\n    |.elif X64\r\n    |  mov TMPQ, r12\r\n    |  mov TMPa, r13\r\n    |  sub rsp, 16\r\n    |.endif\r\n    |  jmp RDa\r\n    |.endif\r\n    break;\r\n\r\n  case BC_JMP:\r\n    |  ins_AJ\t// RA = unused, RD = target\r\n    |  branchPC RD\r\n    |  ins_next\r\n    break;\r\n\r\n  /* -- Function headers -------------------------------------------------- */\r\n\r\n   /*\r\n   ** Reminder: A function may be called with func/args above L->maxstack,\r\n   ** i.e. occupying EXTRA_STACK slots. And vmeta_call may add one extra slot,\r\n   ** too. This means all FUNC* ops (including fast functions) must check\r\n   ** for stack overflow _before_ adding more slots!\r\n   */\r\n\r\n  case BC_FUNCF:\r\n    |.if JIT\r\n    |  hotcall RB\r\n    |.endif\r\n  case BC_FUNCV:  /* NYI: compiled vararg functions. */\r\n    | // Fall through. Assumes BC_IFUNCF/BC_IFUNCV follow and ins_AD is a no-op.\r\n    break;\r\n\r\n  case BC_JFUNCF:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n  case BC_IFUNCF:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [BASE+RA*8]\t\t// Top of frame.\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_f\r\n    |  movzx RA, byte [PC-4+PC2PROTO(numparams)]\r\n    |  cmp NARGS:RD, RA\t\t\t// Check for missing parameters.\r\n    |  jbe >3\r\n    |2:\r\n    if (op == BC_JFUNCF) {\r\n      |  movzx RD, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov dword [BASE+NARGS:RD*8-4], LJ_TNIL\r\n    |  add NARGS:RD, 1\r\n    |  cmp NARGS:RD, RA\r\n    |  jbe <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_JFUNCV:\r\n#if !LJ_HASJIT\r\n    break;\r\n#endif\r\n    | int3  // NYI: compiled vararg functions\r\n    break;  /* NYI: compiled vararg functions. */\r\n\r\n  case BC_IFUNCV:\r\n    |  ins_AD  // BASE = new base, RA = framesize, RD = nargs+1\r\n    |  lea RB, [NARGS:RD*8+FRAME_VARG]\r\n    |  lea RD, [BASE+NARGS:RD*8]\r\n    |  mov LFUNC:KBASE, [BASE-8]\r\n    |  mov [RD-4], RB\t\t\t// Store delta + FRAME_VARG.\r\n    |  mov [RD-8], LFUNC:KBASE\t\t// Store copy of LFUNC.\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RA, [RD+RA*8]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  ja ->vm_growstack_v\t\t// Need to grow stack.\r\n    |  mov RA, BASE\r\n    |  mov BASE, RD\r\n    |  movzx RB, byte [PC-4+PC2PROTO(numparams)]\r\n    |  test RB, RB\r\n    |  jz >2\r\n    |1:  // Copy fixarg slots up to new frame.\r\n    |  add RA, 8\r\n    |  cmp RA, BASE\r\n    |  jnb >3\t\t\t\t// Less args than parameters?\r\n    |  mov KBASE, [RA-8]\r\n    |  mov [RD], KBASE\r\n    |  mov KBASE, [RA-4]\r\n    |  mov [RD+4], KBASE\r\n    |  add RD, 8\r\n    |  mov dword [RA-4], LJ_TNIL\t// Clear old fixarg slot (help the GC).\r\n    |  sub RB, 1\r\n    |  jnz <1\r\n    |2:\r\n    if (op == BC_JFUNCV) {\r\n      |  movzx RD, PC_RD\r\n      |  jmp =>BC_JLOOP\r\n    } else {\r\n      |  mov KBASE, [PC-4+PC2PROTO(k)]\r\n      |  ins_next\r\n    }\r\n    |\r\n    |3:  // Clear missing parameters.\r\n    |  mov dword [RD+4], LJ_TNIL\r\n    |  add RD, 8\r\n    |  sub RB, 1\r\n    |  jnz <3\r\n    |  jmp <2\r\n    break;\r\n\r\n  case BC_FUNCC:\r\n  case BC_FUNCCW:\r\n    |  ins_AD  // BASE = new base, RA = ins RA|RD (unused), RD = nargs+1\r\n    |  mov CFUNC:RB, [BASE-8]\r\n    |  mov KBASEa, CFUNC:RB->f\r\n    |  mov L:RB, SAVE_L\r\n    |  lea RD, [BASE+NARGS:RD*8-8]\r\n    |  mov L:RB->base, BASE\r\n    |  lea RA, [RD+8*LUA_MINSTACK]\r\n    |  cmp RA, L:RB->maxstack\r\n    |  mov L:RB->top, RD\r\n    if (op == BC_FUNCC) {\r\n      |.if X64\r\n      |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n      |.else\r\n      |  mov ARG1, L:RB\r\n      |.endif\r\n    } else {\r\n      |.if X64\r\n      |  mov CARG2, KBASEa\r\n      |  mov CARG1d, L:RB\t\t\t// Caveat: CARG1d may be RA.\r\n      |.else\r\n      |  mov ARG2, KBASEa\r\n      |  mov ARG1, L:RB\r\n      |.endif\r\n    }\r\n    |  ja ->vm_growstack_c\t\t// Need to grow stack.\r\n    |  set_vmstate C\r\n    if (op == BC_FUNCC) {\r\n      |  call KBASEa\t\t\t// (lua_State *L)\r\n    } else {\r\n      |  // (lua_State *L, lua_CFunction f)\r\n      |  call aword [DISPATCH+DISPATCH_GL(wrapf)]\r\n    }\r\n    |  // nresults returned in eax (RD).\r\n    |  mov BASE, L:RB->base\r\n    |  mov [DISPATCH+DISPATCH_GL(cur_L)], L:RB\r\n    |  set_vmstate INTERP\r\n    |  lea RA, [BASE+RD*8]\r\n    |  neg RA\r\n    |  add RA, L:RB->top\t\t// RA = (L->top-(L->base+nresults))*8\r\n    |  mov PC, [BASE-4]\t\t\t// Fetch PC of caller.\r\n    |  jmp ->vm_returnc\r\n    break;\r\n\r\n  /* ---------------------------------------------------------------------- */\r\n\r\n  default:\r\n    fprintf(stderr, \"Error: undefined opcode BC_%s\\n\", bc_names[op]);\r\n    exit(2);\r\n    break;\r\n  }\r\n}\r\n\r\nstatic int build_backend(BuildCtx *ctx)\r\n{\r\n  int op;\r\n  dasm_growpc(Dst, BC__MAX);\r\n  build_subroutines(ctx);\r\n  |.code_op\r\n  for (op = 0; op < BC__MAX; op++)\r\n    build_ins(ctx, (BCOp)op, op);\r\n  return BC__MAX;\r\n}\r\n\r\n/* Emit pseudo frame-info for all assembler functions. */\r\nstatic void emit_asm_debug(BuildCtx *ctx)\r\n{\r\n  int fcofs = (int)((uint8_t *)ctx->glob[GLOB_vm_ffi_call] - ctx->code);\r\n#if LJ_64\r\n#define SZPTR\t\"8\"\r\n#define BSZPTR\t\"3\"\r\n#define REG_SP\t\"0x7\"\r\n#define REG_RA\t\"0x10\"\r\n#else\r\n#define SZPTR\t\"4\"\r\n#define BSZPTR\t\"2\"\r\n#define REG_SP\t\"0x4\"\r\n#define REG_RA\t\"0x8\"\r\n#endif\r\n  switch (ctx->mode) {\r\n  case BUILD_elfasm:\r\n    fprintf(ctx->fp, \"\\t.section .debug_frame,\\\"\\\",@progbits\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".Lframe0:\\n\"\r\n\t\"\\t.long .LECIE0-.LSCIE0\\n\"\r\n\t\".LSCIE0:\\n\"\r\n\t\"\\t.long 0xffffffff\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE0:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE0:\\n\"\r\n\t\"\\t.long .LEFDE0-.LASFDE0\\n\"\r\n\t\".LASFDE0:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_64\r\n\t\"\\t.quad .Lbegin\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n#if LJ_NO_UNWIND\r\n\t\"\\t.byte 0x8d\\n\\t.uleb128 0x6\\n\"\t/* offset r13 */\r\n\t\"\\t.byte 0x8c\\n\\t.uleb128 0x7\\n\"\t/* offset r12 */\r\n#endif\r\n#else\r\n\t\"\\t.long .Lbegin\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0x87\\n\\t.uleb128 0x3\\n\"\t/* offset edi */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x4\\n\"\t/* offset esi */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x5\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE0:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE1:\\n\"\r\n\t\"\\t.long .LEFDE1-.LASFDE1\\n\"\r\n\t\".LASFDE1:\\n\"\r\n\t\"\\t.long .Lframe0\\n\"\r\n#if LJ_64\r\n\t\"\\t.quad lj_vm_ffi_call\\n\"\r\n\t\"\\t.quad %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n#else\r\n\t\"\\t.long lj_vm_ffi_call\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 8\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x5\\n\"\t\t/* def_cfa_register ebp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE1:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#if !LJ_NO_UNWIND\r\n#if (defined(__sun__) && defined(__svr4__))\r\n#if LJ_64\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@unwind\\n\");\r\n#else\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"aw\\\",@progbits\\n\");\r\n#endif\r\n#else\r\n    fprintf(ctx->fp, \"\\t.section .eh_frame,\\\"a\\\",@progbits\\n\");\r\n#endif\r\n    fprintf(ctx->fp,\r\n\t\".Lframe1:\\n\"\r\n\t\"\\t.long .LECIE1-.LSCIE1\\n\"\r\n\t\".LSCIE1:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zPR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.uleb128 6\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.long lj_err_unwind_dwarf-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE1:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE2:\\n\"\r\n\t\"\\t.long .LEFDE2-.LASFDE2\\n\"\r\n\t\".LASFDE2:\\n\"\r\n\t\"\\t.long .LASFDE2-.Lframe1\\n\"\r\n\t\"\\t.long .Lbegin-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 %d\\n\"\t\t/* def_cfa_offset */\r\n#if LJ_64\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n\t\"\\t.byte 0x8f\\n\\t.uleb128 0x4\\n\"\t/* offset r15 */\r\n\t\"\\t.byte 0x8e\\n\\t.uleb128 0x5\\n\"\t/* offset r14 */\r\n#else\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0x87\\n\\t.uleb128 0x3\\n\"\t/* offset edi */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x4\\n\"\t/* offset esi */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x5\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE2:\\n\\n\", fcofs, CFRAME_SIZE);\r\n#if LJ_HASFFI\r\n    fprintf(ctx->fp,\r\n\t\".Lframe2:\\n\"\r\n\t\"\\t.long .LECIE2-.LSCIE2\\n\"\r\n\t\".LSCIE2:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.string \\\"zR\\\"\\n\"\r\n\t\"\\t.uleb128 0x1\\n\"\r\n\t\"\\t.sleb128 -\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.uleb128 1\\n\"\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.uleb128 \" REG_SP \"\\n\\t.uleb128 \" SZPTR \"\\n\"\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.uleb128 0x1\\n\"\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LECIE2:\\n\\n\");\r\n    fprintf(ctx->fp,\r\n\t\".LSFDE3:\\n\"\r\n\t\"\\t.long .LEFDE3-.LASFDE3\\n\"\r\n\t\".LASFDE3:\\n\"\r\n\t\"\\t.long .LASFDE3-.Lframe2\\n\"\r\n\t\"\\t.long lj_vm_ffi_call-.\\n\"\r\n\t\"\\t.long %d\\n\"\r\n\t\"\\t.uleb128 0\\n\"\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 16\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x86\\n\\t.uleb128 0x2\\n\"\t/* offset rbp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset rbx */\r\n#else\r\n\t\"\\t.byte 0xe\\n\\t.uleb128 8\\n\"\t\t/* def_cfa_offset */\r\n\t\"\\t.byte 0x85\\n\\t.uleb128 0x2\\n\"\t/* offset ebp */\r\n\t\"\\t.byte 0xd\\n\\t.uleb128 0x5\\n\"\t\t/* def_cfa_register ebp */\r\n\t\"\\t.byte 0x83\\n\\t.uleb128 0x3\\n\"\t/* offset ebx */\r\n#endif\r\n\t\"\\t.align \" SZPTR \"\\n\"\r\n\t\".LEFDE3:\\n\\n\", (int)ctx->codesz - fcofs);\r\n#endif\r\n#endif\r\n    break;\r\n#if !LJ_NO_UNWIND\r\n  /* Mental note: never let Apple design an assembler.\r\n  ** Or a linker. Or a plastic case. But I digress.\r\n  */\r\n  case BUILD_machasm: {\r\n#if LJ_HASFFI\r\n    int fcsize = 0;\r\n#endif\r\n    int i;\r\n    fprintf(ctx->fp, \"\\t.section __TEXT,__eh_frame,coalesced,no_toc+strip_static_syms+live_support\\n\");\r\n    fprintf(ctx->fp,\r\n\t\"EH_frame1:\\n\"\r\n\t\"\\t.set L$set$x,LECIEX-LSCIEX\\n\"\r\n\t\"\\t.long L$set$x\\n\"\r\n\t\"LSCIEX:\\n\"\r\n\t\"\\t.long 0\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.ascii \\\"zPR\\\\0\\\"\\n\"\r\n\t\"\\t.byte 0x1\\n\"\r\n\t\"\\t.byte 128-\" SZPTR \"\\n\"\r\n\t\"\\t.byte \" REG_RA \"\\n\"\r\n\t\"\\t.byte 6\\n\"\t\t\t\t/* augmentation length */\r\n\t\"\\t.byte 0x9b\\n\"\t\t\t/* indirect|pcrel|sdata4 */\r\n#if LJ_64\r\n\t\"\\t.long _lj_err_unwind_dwarf+4@GOTPCREL\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.byte \" REG_SP \"\\n\\t.byte \" SZPTR \"\\n\"\r\n#else\r\n\t\"\\t.long L_lj_err_unwind_dwarf$non_lazy_ptr-.\\n\"\r\n\t\"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t\"\\t.byte 0xc\\n\\t.byte 0x5\\n\\t.byte 0x4\\n\"  /* esp=5 on 32 bit MACH-O. */\r\n#endif\r\n\t\"\\t.byte 0x80+\" REG_RA \"\\n\\t.byte 0x1\\n\"\r\n\t\"\\t.align \" BSZPTR \"\\n\"\r\n\t\"LECIEX:\\n\\n\");\r\n    for (i = 0; i < ctx->nsym; i++) {\r\n      const char *name = ctx->sym[i].name;\r\n      int32_t size = ctx->sym[i+1].ofs - ctx->sym[i].ofs;\r\n      if (size == 0) continue;\r\n#if LJ_HASFFI\r\n      if (!strcmp(name, \"_lj_vm_ffi_call\")) { fcsize = size; continue; }\r\n#endif\r\n      fprintf(ctx->fp,\r\n\t  \"%s.eh:\\n\"\r\n\t  \"LSFDE%d:\\n\"\r\n\t  \"\\t.set L$set$%d,LEFDE%d-LASFDE%d\\n\"\r\n\t  \"\\t.long L$set$%d\\n\"\r\n\t  \"LASFDE%d:\\n\"\r\n\t  \"\\t.long LASFDE%d-EH_frame1\\n\"\r\n\t  \"\\t.long %s-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n\t  \"\\t.byte 0xe\\n\\t.byte %d\\n\"\t\t/* def_cfa_offset */\r\n#if LJ_64\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n\t  \"\\t.byte 0x8f\\n\\t.byte 0x4\\n\"\t\t/* offset r15 */\r\n\t  \"\\t.byte 0x8e\\n\\t.byte 0x5\\n\"\t\t/* offset r14 */\r\n#else\r\n\t  \"\\t.byte 0x84\\n\\t.byte 0x2\\n\"\t\t/* offset ebp (4 for MACH-O)*/\r\n\t  \"\\t.byte 0x87\\n\\t.byte 0x3\\n\"\t\t/* offset edi */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x4\\n\"\t\t/* offset esi */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x5\\n\"\t\t/* offset ebx */\r\n#endif\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LEFDE%d:\\n\\n\",\r\n\t  name, i, i, i, i, i, i, i, name, size, CFRAME_SIZE, i);\r\n    }\r\n#if LJ_HASFFI\r\n    if (fcsize) {\r\n      fprintf(ctx->fp,\r\n\t  \"EH_frame2:\\n\"\r\n\t  \"\\t.set L$set$y,LECIEY-LSCIEY\\n\"\r\n\t  \"\\t.long L$set$y\\n\"\r\n\t  \"LSCIEY:\\n\"\r\n\t  \"\\t.long 0\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.ascii \\\"zR\\\\0\\\"\\n\"\r\n\t  \"\\t.byte 0x1\\n\"\r\n\t  \"\\t.byte 128-\" SZPTR \"\\n\"\r\n\t  \"\\t.byte \" REG_RA \"\\n\"\r\n\t  \"\\t.byte 1\\n\"\t\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t  \"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t  \"\\t.byte 0xc\\n\\t.byte \" REG_SP \"\\n\\t.byte \" SZPTR \"\\n\"\r\n#else\r\n\t  \"\\t.byte 0x1b\\n\"\t\t\t/* pcrel|sdata4 */\r\n\t  \"\\t.byte 0xc\\n\\t.byte 0x5\\n\\t.byte 0x4\\n\"  /* esp=5 on 32 bit MACH. */\r\n#endif\r\n\t  \"\\t.byte 0x80+\" REG_RA \"\\n\\t.byte 0x1\\n\"\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LECIEY:\\n\\n\");\r\n      fprintf(ctx->fp,\r\n\t  \"_lj_vm_ffi_call.eh:\\n\"\r\n\t  \"LSFDEY:\\n\"\r\n\t  \"\\t.set L$set$yy,LEFDEY-LASFDEY\\n\"\r\n\t  \"\\t.long L$set$yy\\n\"\r\n\t  \"LASFDEY:\\n\"\r\n\t  \"\\t.long LASFDEY-EH_frame2\\n\"\r\n\t  \"\\t.long _lj_vm_ffi_call-.\\n\"\r\n\t  \"\\t.long %d\\n\"\r\n\t  \"\\t.byte 0\\n\"\t\t\t\t/* augmentation length */\r\n#if LJ_64\r\n\t  \"\\t.byte 0xe\\n\\t.byte 16\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x86\\n\\t.byte 0x2\\n\"\t\t/* offset rbp */\r\n\t  \"\\t.byte 0xd\\n\\t.byte 0x6\\n\"\t\t/* def_cfa_register rbp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset rbx */\r\n#else\r\n\t  \"\\t.byte 0xe\\n\\t.byte 8\\n\"\t\t/* def_cfa_offset */\r\n\t  \"\\t.byte 0x84\\n\\t.byte 0x2\\n\"\t\t/* offset ebp (4 for MACH-O)*/\r\n\t  \"\\t.byte 0xd\\n\\t.byte 0x4\\n\"\t\t/* def_cfa_register ebp */\r\n\t  \"\\t.byte 0x83\\n\\t.byte 0x3\\n\"\t\t/* offset ebx */\r\n#endif\r\n\t  \"\\t.align \" BSZPTR \"\\n\"\r\n\t  \"LEFDEY:\\n\\n\", fcsize);\r\n    }\r\n#endif\r\n#if !LJ_64\r\n    fprintf(ctx->fp,\r\n      \"\\t.non_lazy_symbol_pointer\\n\"\r\n      \"L_lj_err_unwind_dwarf$non_lazy_ptr:\\n\"\r\n      \".indirect_symbol _lj_err_unwind_dwarf\\n\"\r\n      \".long 0\\n\\n\");\r\n    fprintf(ctx->fp, \"\\t.section __IMPORT,__jump_table,symbol_stubs,pure_instructions+self_modifying_code,5\\n\");\r\n    {\r\n      const char *const *xn;\r\n      for (xn = ctx->extnames; *xn; xn++)\r\n\tif (strncmp(*xn, LABEL_PREFIX, sizeof(LABEL_PREFIX)-1))\r\n\t  fprintf(ctx->fp, \"L_%s$stub:\\n\\t.indirect_symbol _%s\\n\\t.ascii \\\"\\\\364\\\\364\\\\364\\\\364\\\\364\\\"\\n\", *xn, *xn);\r\n    }\r\n#endif\r\n    fprintf(ctx->fp, \".subsections_via_symbols\\n\");\r\n    }\r\n    break;\r\n#endif\r\n  default:  /* Difficult for other modes. */\r\n    break;\r\n  }\r\n}\r\n\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/xb1build.bat",
    "content": "@rem Script to build LuaJIT with the Xbox One SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (64 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined DurangoXDK goto :FAIL\r\n\r\n@setlocal\r\n@echo ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE /DLUAJIT_ENABLE_GC64\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Error out for 64 bit host compiler\r\n@minilua\r\n@if not errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D WIN -D FFI -D P64\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_x64.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% /D_DURANGO host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m peobj -o lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@echo ---- Cross compiler ----\r\n\r\n@set CWD=%cd%\r\n@call \"%DurangoXDK%\\xdk\\DurangoVars.cmd\" XDK\r\n@cd /D \"%CWD%\"\r\n@shift\r\n\r\n@set LJCOMPILE=\"cl\" /nologo /c /W3 /GF /Gm- /GR- /GS- /Gy /openmp- /D_CRT_SECURE_NO_DEPRECATE /D_LIB /D_UNICODE /D_DURANGO\r\n@set LJLIB=\"lib\" /nologo\r\n\r\n@if \"%1\"==\"debug\" (\r\n  @shift\r\n  @set LJCOMPILE=%LJCOMPILE% /Zi /MDd /Od\r\n  @set LJLINK=%LJLINK% /debug \r\n) else (\r\n  @set LJCOMPILE=%LJCOMPILE% /MD /O2 /DNDEBUG\r\n)\r\n\r\n@if \"%1\"==\"amalg\" goto :AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL lj_*.c lib_*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit.lib lj_*.obj lib_*.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :NOAMALG\r\n:AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit.lib ljamalg.obj lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\n:NOAMALG\r\n\r\n@del *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for Xbox One ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (64 bit host compiler). The Xbox One SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-2.1.0/src/xedkbuild.bat",
    "content": "@rem Script to build LuaJIT with the Xbox 360 SDK.\r\n@rem Donated to the public domain.\r\n@rem\r\n@rem Open a \"Visual Studio .NET Command Prompt\" (32 bit host compiler)\r\n@rem Then cd to this directory and run this script.\r\n\r\n@if not defined INCLUDE goto :FAIL\r\n@if not defined XEDK goto :FAIL\r\n\r\n@setlocal\r\n@rem ---- Host compiler ----\r\n@set LJCOMPILE=cl /nologo /c /MD /O2 /W3 /D_CRT_SECURE_NO_DEPRECATE\r\n@set LJLINK=link /nologo\r\n@set LJMT=mt /nologo\r\n@set DASMDIR=..\\dynasm\r\n@set DASM=%DASMDIR%\\dynasm.lua\r\n@set ALL_LIB=lib_base.c lib_math.c lib_bit.c lib_string.c lib_table.c lib_io.c lib_os.c lib_package.c lib_debug.c lib_jit.c lib_ffi.c\r\n\r\n%LJCOMPILE% host\\minilua.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:minilua.exe minilua.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist minilua.exe.manifest^\r\n  %LJMT% -manifest minilua.exe.manifest -outputresource:minilua.exe\r\n\r\n@rem Error out for 64 bit host compiler\r\n@minilua\r\n@if errorlevel 8 goto :FAIL\r\n\r\n@set DASMFLAGS=-D GPR64 -D FRAME32 -D PPE -D SQRT -D DUALNUM\r\nminilua %DASM% -LN %DASMFLAGS% -o host\\buildvm_arch.h vm_ppc.dasc\r\n@if errorlevel 1 goto :BAD\r\n\r\n%LJCOMPILE% /I \".\" /I %DASMDIR% /D_XBOX_VER=200 /DLUAJIT_TARGET=LUAJIT_ARCH_PPC  host\\buildvm*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLINK% /out:buildvm.exe buildvm*.obj\r\n@if errorlevel 1 goto :BAD\r\nif exist buildvm.exe.manifest^\r\n  %LJMT% -manifest buildvm.exe.manifest -outputresource:buildvm.exe\r\n\r\nbuildvm -m peobj -o lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m bcdef -o lj_bcdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m ffdef -o lj_ffdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m libdef -o lj_libdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m recdef -o lj_recdef.h %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m vmdef -o jit\\vmdef.lua %ALL_LIB%\r\n@if errorlevel 1 goto :BAD\r\nbuildvm -m folddef -o lj_folddef.h lj_opt_fold.c\r\n@if errorlevel 1 goto :BAD\r\n\r\n@rem ---- Cross compiler ----\r\n@set LJCOMPILE=\"%XEDK%\\bin\\win32\\cl\" /nologo /c /MT /O2 /W3 /GF /Gm- /GR- /GS- /Gy /openmp- /D_CRT_SECURE_NO_DEPRECATE /DNDEBUG /D_XBOX /D_LIB /DLUAJIT_USE_SYSMALLOC\r\n@set LJLIB=\"%XEDK%\\bin\\win32\\lib\" /nologo\r\n@set \"INCLUDE=%XEDK%\\include\\xbox\"\r\n\r\n@if \"%1\" neq \"debug\" goto :NODEBUG\r\n@shift\r\n@set \"LJCOMPILE=%LJCOMPILE% /Zi\"\r\n:NODEBUG\r\n@if \"%1\"==\"amalg\" goto :AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL lj_*.c lib_*.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit20.lib lj_*.obj lib_*.obj\r\n@if errorlevel 1 goto :BAD\r\n@goto :NOAMALG\r\n:AMALG\r\n%LJCOMPILE% /DLUA_BUILD_AS_DLL ljamalg.c\r\n@if errorlevel 1 goto :BAD\r\n%LJLIB% /OUT:luajit20.lib ljamalg.obj lj_vm.obj\r\n@if errorlevel 1 goto :BAD\r\n:NOAMALG\r\n\r\n@del *.obj *.manifest minilua.exe buildvm.exe\r\n@echo.\r\n@echo === Successfully built LuaJIT for Xbox 360 ===\r\n\r\n@goto :END\r\n:BAD\r\n@echo.\r\n@echo *******************************************************\r\n@echo *** Build FAILED -- Please check the error messages ***\r\n@echo *******************************************************\u0007\r\n@goto :END\r\n:FAIL\r\n@echo To run this script you must open a \"Visual Studio .NET Command Prompt\"\r\n@echo (32 bit host compiler). The Xbox 360 SDK must be installed, too.\r\n:END\r\n"
  },
  {
    "path": "build/luajit-osx/slua/Info.plist",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>CFBundleDevelopmentRegion</key>\r\n\t<string>en</string>\r\n\t<key>CFBundleExecutable</key>\r\n\t<string>$(EXECUTABLE_NAME)</string>\r\n\t<key>CFBundleIdentifier</key>\r\n\t<string>com.sineysoft.$(PRODUCT_NAME:rfc1034identifier)</string>\r\n\t<key>CFBundleInfoDictionaryVersion</key>\r\n\t<string>6.0</string>\r\n\t<key>CFBundleName</key>\r\n\t<string>$(PRODUCT_NAME)</string>\r\n\t<key>CFBundlePackageType</key>\r\n\t<string>BNDL</string>\r\n\t<key>CFBundleShortVersionString</key>\r\n\t<string>1.0</string>\r\n\t<key>CFBundleSignature</key>\r\n\t<string>????</string>\r\n\t<key>CFBundleVersion</key>\r\n\t<string>1</string>\r\n\t<key>NSHumanReadableCopyright</key>\r\n\t<string>Copyright © 2015年 Pang Weiwei. All rights reserved.</string>\r\n\t<key>NSPrincipalClass</key>\r\n\t<string></string>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/luajit-osx/slua/main.c",
    "content": ""
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/project.pbxproj",
    "content": "// !$*UTF8*$!\r\n{\r\n\tarchiveVersion = 1;\r\n\tclasses = {\r\n\t};\r\n\tobjectVersion = 46;\r\n\tobjects = {\r\n\r\n/* Begin PBXBuildFile section */\r\n\t\t4942CE831B9D9D7100858CB0 /* libluajit_x86_64.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 4942CE811B9D9D7100858CB0 /* libluajit_x86_64.a */; };\r\n\t\t4942CE841B9D9D7100858CB0 /* libluajit_x86.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 4942CE821B9D9D7100858CB0 /* libluajit_x86.a */; };\r\n\t\t49A357121BA0392800A0FA50 /* main.c in Sources */ = {isa = PBXBuildFile; fileRef = 49A357111BA0392800A0FA50 /* main.c */; };\r\n/* End PBXBuildFile section */\r\n\r\n/* Begin PBXFileReference section */\r\n\t\t4942CE811B9D9D7100858CB0 /* libluajit_x86_64.a */ = {isa = PBXFileReference; lastKnownFileType = archive.ar; path = libluajit_x86_64.a; sourceTree = \"<group>\"; };\r\n\t\t4942CE821B9D9D7100858CB0 /* libluajit_x86.a */ = {isa = PBXFileReference; lastKnownFileType = archive.ar; path = libluajit_x86.a; sourceTree = \"<group>\"; };\r\n\t\t49A357111BA0392800A0FA50 /* main.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = main.c; sourceTree = \"<group>\"; };\r\n\t\tE80919D41B745519008FED27 /* slua.bundle */ = {isa = PBXFileReference; explicitFileType = wrapper.cfbundle; includeInIndex = 0; path = slua.bundle; sourceTree = BUILT_PRODUCTS_DIR; };\r\n\t\tE80919D81B745519008FED27 /* Info.plist */ = {isa = PBXFileReference; lastKnownFileType = text.plist.xml; path = Info.plist; sourceTree = \"<group>\"; };\r\n/* End PBXFileReference section */\r\n\r\n/* Begin PBXFrameworksBuildPhase section */\r\n\t\tE80919D11B745519008FED27 /* Frameworks */ = {\r\n\t\t\tisa = PBXFrameworksBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t\t4942CE831B9D9D7100858CB0 /* libluajit_x86_64.a in Frameworks */,\r\n\t\t\t\t4942CE841B9D9D7100858CB0 /* libluajit_x86.a in Frameworks */,\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXFrameworksBuildPhase section */\r\n\r\n/* Begin PBXGroup section */\r\n\t\tE80919CB1B745519008FED27 = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\t4942CE811B9D9D7100858CB0 /* libluajit_x86_64.a */,\r\n\t\t\t\t4942CE821B9D9D7100858CB0 /* libluajit_x86.a */,\r\n\t\t\t\tE80919D61B745519008FED27 /* slua */,\r\n\t\t\t\tE80919D51B745519008FED27 /* Products */,\r\n\t\t\t);\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D51B745519008FED27 /* Products */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D41B745519008FED27 /* slua.bundle */,\r\n\t\t\t);\r\n\t\t\tname = Products;\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D61B745519008FED27 /* slua */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D71B745519008FED27 /* Supporting Files */,\r\n\t\t\t\t49A357111BA0392800A0FA50 /* main.c */,\r\n\t\t\t);\r\n\t\t\tpath = slua;\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n\t\tE80919D71B745519008FED27 /* Supporting Files */ = {\r\n\t\t\tisa = PBXGroup;\r\n\t\t\tchildren = (\r\n\t\t\t\tE80919D81B745519008FED27 /* Info.plist */,\r\n\t\t\t);\r\n\t\t\tname = \"Supporting Files\";\r\n\t\t\tsourceTree = \"<group>\";\r\n\t\t};\r\n/* End PBXGroup section */\r\n\r\n/* Begin PBXNativeTarget section */\r\n\t\tE80919D31B745519008FED27 /* slua */ = {\r\n\t\t\tisa = PBXNativeTarget;\r\n\t\t\tbuildConfigurationList = E80919DB1B745519008FED27 /* Build configuration list for PBXNativeTarget \"slua\" */;\r\n\t\t\tbuildPhases = (\r\n\t\t\t\tE80919D01B745519008FED27 /* Sources */,\r\n\t\t\t\tE80919D11B745519008FED27 /* Frameworks */,\r\n\t\t\t\tE80919D21B745519008FED27 /* Resources */,\r\n\t\t\t);\r\n\t\t\tbuildRules = (\r\n\t\t\t);\r\n\t\t\tdependencies = (\r\n\t\t\t);\r\n\t\t\tname = slua;\r\n\t\t\tproductName = slua;\r\n\t\t\tproductReference = E80919D41B745519008FED27 /* slua.bundle */;\r\n\t\t\tproductType = \"com.apple.product-type.bundle\";\r\n\t\t};\r\n/* End PBXNativeTarget section */\r\n\r\n/* Begin PBXProject section */\r\n\t\tE80919CC1B745519008FED27 /* Project object */ = {\r\n\t\t\tisa = PBXProject;\r\n\t\t\tattributes = {\r\n\t\t\t\tLastUpgradeCheck = 0640;\r\n\t\t\t\tORGANIZATIONNAME = \"Pang Weiwei\";\r\n\t\t\t\tTargetAttributes = {\r\n\t\t\t\t\tE80919D31B745519008FED27 = {\r\n\t\t\t\t\t\tCreatedOnToolsVersion = 6.4;\r\n\t\t\t\t\t};\r\n\t\t\t\t};\r\n\t\t\t};\r\n\t\t\tbuildConfigurationList = E80919CF1B745519008FED27 /* Build configuration list for PBXProject \"slua\" */;\r\n\t\t\tcompatibilityVersion = \"Xcode 3.2\";\r\n\t\t\tdevelopmentRegion = English;\r\n\t\t\thasScannedForEncodings = 0;\r\n\t\t\tknownRegions = (\r\n\t\t\t\ten,\r\n\t\t\t);\r\n\t\t\tmainGroup = E80919CB1B745519008FED27;\r\n\t\t\tproductRefGroup = E80919D51B745519008FED27 /* Products */;\r\n\t\t\tprojectDirPath = \"\";\r\n\t\t\tprojectRoot = \"\";\r\n\t\t\ttargets = (\r\n\t\t\t\tE80919D31B745519008FED27 /* slua */,\r\n\t\t\t);\r\n\t\t};\r\n/* End PBXProject section */\r\n\r\n/* Begin PBXResourcesBuildPhase section */\r\n\t\tE80919D21B745519008FED27 /* Resources */ = {\r\n\t\t\tisa = PBXResourcesBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXResourcesBuildPhase section */\r\n\r\n/* Begin PBXSourcesBuildPhase section */\r\n\t\tE80919D01B745519008FED27 /* Sources */ = {\r\n\t\t\tisa = PBXSourcesBuildPhase;\r\n\t\t\tbuildActionMask = 2147483647;\r\n\t\t\tfiles = (\r\n\t\t\t\t49A357121BA0392800A0FA50 /* main.c in Sources */,\r\n\t\t\t);\r\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\r\n\t\t};\r\n/* End PBXSourcesBuildPhase section */\r\n\r\n/* Begin XCBuildConfiguration section */\r\n\t\tE80919D91B745519008FED27 /* Debug */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\r\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\r\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\r\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\r\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\r\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\r\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\r\n\t\t\t\tCOPY_PHASE_STRIP = NO;\r\n\t\t\t\tDEBUG_INFORMATION_FORMAT = dwarf;\r\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\r\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\r\n\t\t\t\tGCC_DYNAMIC_NO_PIC = NO;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\r\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\r\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\r\n\t\t\t\t\t\"DEBUG=1\",\r\n\t\t\t\t\t\"$(inherited)\",\r\n\t\t\t\t);\r\n\t\t\t\tGCC_SYMBOLS_PRIVATE_EXTERN = NO;\r\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\r\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\r\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\r\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\r\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\r\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\r\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.10;\r\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = YES;\r\n\t\t\t\tONLY_ACTIVE_ARCH = YES;\r\n\t\t\t\tSDKROOT = macosx;\r\n\t\t\t};\r\n\t\t\tname = Debug;\r\n\t\t};\r\n\t\tE80919DA1B745519008FED27 /* Release */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\r\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\r\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\r\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\r\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\r\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\r\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\r\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\r\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\r\n\t\t\t\tCOPY_PHASE_STRIP = NO;\r\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\r\n\t\t\t\tENABLE_NS_ASSERTIONS = NO;\r\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\r\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\r\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\r\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\r\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\r\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\r\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\r\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\r\n\t\t\t\tMACOSX_DEPLOYMENT_TARGET = 10.10;\r\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = NO;\r\n\t\t\t\tSDKROOT = macosx;\r\n\t\t\t};\r\n\t\t\tname = Release;\r\n\t\t};\r\n\t\tE80919DC1B745519008FED27 /* Debug */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tARCHS = \"$(ARCHS_STANDARD_32_64_BIT)\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = NO;\r\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = NO;\r\n\t\t\t\tINFOPLIST_FILE = slua/Info.plist;\r\n\t\t\t\tINSTALL_PATH = \"$(LOCAL_LIBRARY_DIR)/Bundles\";\r\n\t\t\t\tLIBRARY_SEARCH_PATHS = (\r\n\t\t\t\t\t\"$(inherited)\",\r\n\t\t\t\t\t\"$(PROJECT_DIR)\",\r\n\t\t\t\t);\r\n\t\t\t\tONLY_ACTIVE_ARCH = NO;\r\n\t\t\t\tOTHER_LDFLAGS = \"-all_load\";\r\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\r\n\t\t\t\tSKIP_INSTALL = YES;\r\n\t\t\t\tSTRIP_INSTALLED_PRODUCT = YES;\r\n\t\t\t\tUSER_HEADER_SEARCH_PATHS = \"../luajit-2.1.0/src\";\r\n\t\t\t\tWRAPPER_EXTENSION = bundle;\r\n\t\t\t};\r\n\t\t\tname = Debug;\r\n\t\t};\r\n\t\tE80919DD1B745519008FED27 /* Release */ = {\r\n\t\t\tisa = XCBuildConfiguration;\r\n\t\t\tbuildSettings = {\r\n\t\t\t\tARCHS = \"$(ARCHS_STANDARD_32_64_BIT)\";\r\n\t\t\t\tCLANG_ENABLE_MODULES = NO;\r\n\t\t\t\tCOMBINE_HIDPI_IMAGES = YES;\r\n\t\t\t\tCOPY_PHASE_STRIP = YES;\r\n\t\t\t\tGCC_NO_COMMON_BLOCKS = NO;\r\n\t\t\t\tINFOPLIST_FILE = slua/Info.plist;\r\n\t\t\t\tINSTALL_PATH = \"$(LOCAL_LIBRARY_DIR)/Bundles\";\r\n\t\t\t\tLIBRARY_SEARCH_PATHS = (\r\n\t\t\t\t\t\"$(inherited)\",\r\n\t\t\t\t\t\"$(PROJECT_DIR)\",\r\n\t\t\t\t);\r\n\t\t\t\tOTHER_LDFLAGS = \"-all_load\";\r\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\r\n\t\t\t\tSKIP_INSTALL = YES;\r\n\t\t\t\tSTRIP_INSTALLED_PRODUCT = YES;\r\n\t\t\t\tUSER_HEADER_SEARCH_PATHS = \"../luajit-2.1.0/src\";\r\n\t\t\t\tWRAPPER_EXTENSION = bundle;\r\n\t\t\t};\r\n\t\t\tname = Release;\r\n\t\t};\r\n/* End XCBuildConfiguration section */\r\n\r\n/* Begin XCConfigurationList section */\r\n\t\tE80919CF1B745519008FED27 /* Build configuration list for PBXProject \"slua\" */ = {\r\n\t\t\tisa = XCConfigurationList;\r\n\t\t\tbuildConfigurations = (\r\n\t\t\t\tE80919D91B745519008FED27 /* Debug */,\r\n\t\t\t\tE80919DA1B745519008FED27 /* Release */,\r\n\t\t\t);\r\n\t\t\tdefaultConfigurationIsVisible = 0;\r\n\t\t\tdefaultConfigurationName = Release;\r\n\t\t};\r\n\t\tE80919DB1B745519008FED27 /* Build configuration list for PBXNativeTarget \"slua\" */ = {\r\n\t\t\tisa = XCConfigurationList;\r\n\t\t\tbuildConfigurations = (\r\n\t\t\t\tE80919DC1B745519008FED27 /* Debug */,\r\n\t\t\t\tE80919DD1B745519008FED27 /* Release */,\r\n\t\t\t);\r\n\t\t\tdefaultConfigurationIsVisible = 0;\r\n\t\t\tdefaultConfigurationName = Release;\r\n\t\t};\r\n/* End XCConfigurationList section */\r\n\t};\r\n\trootObject = E80919CC1B745519008FED27 /* Project object */;\r\n}\r\n"
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/project.xcworkspace/contents.xcworkspacedata",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<Workspace\r\n   version = \"1.0\">\r\n   <FileRef\r\n      location = \"self:slua.xcodeproj\">\r\n   </FileRef>\r\n</Workspace>\r\n"
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/project.xcworkspace/xcshareddata/slua.xccheckout",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>IDESourceControlProjectFavoriteDictionaryKey</key>\r\n\t<false/>\r\n\t<key>IDESourceControlProjectIdentifier</key>\r\n\t<string>EE253B8E-7C08-46A7-A34D-8C5A95EB8495</string>\r\n\t<key>IDESourceControlProjectName</key>\r\n\t<string>slua</string>\r\n\t<key>IDESourceControlProjectOriginsDictionary</key>\r\n\t<dict>\r\n\t\t<key>16BCFA1EB47C537A4254C08C32590AD083A3938E</key>\r\n\t\t<string>https://github.com/pangweiwei/slua.git</string>\r\n\t</dict>\r\n\t<key>IDESourceControlProjectPath</key>\r\n\t<string>build/luajit-osx/slua.xcodeproj</string>\r\n\t<key>IDESourceControlProjectRelativeInstallPathDictionary</key>\r\n\t<dict>\r\n\t\t<key>16BCFA1EB47C537A4254C08C32590AD083A3938E</key>\r\n\t\t<string>../../../..</string>\r\n\t</dict>\r\n\t<key>IDESourceControlProjectURL</key>\r\n\t<string>https://github.com/pangweiwei/slua.git</string>\r\n\t<key>IDESourceControlProjectVersion</key>\r\n\t<integer>111</integer>\r\n\t<key>IDESourceControlProjectWCCIdentifier</key>\r\n\t<string>16BCFA1EB47C537A4254C08C32590AD083A3938E</string>\r\n\t<key>IDESourceControlProjectWCConfigurations</key>\r\n\t<array>\r\n\t\t<dict>\r\n\t\t\t<key>IDESourceControlRepositoryExtensionIdentifierKey</key>\r\n\t\t\t<string>public.vcs.git</string>\r\n\t\t\t<key>IDESourceControlWCCIdentifierKey</key>\r\n\t\t\t<string>16BCFA1EB47C537A4254C08C32590AD083A3938E</string>\r\n\t\t\t<key>IDESourceControlWCCName</key>\r\n\t\t\t<string>slua</string>\r\n\t\t</dict>\r\n\t</array>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/project.xcworkspace/xcuserdata/sineysan.xcuserdatad/WorkspaceSettings.xcsettings",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>BuildLocationStyle</key>\r\n\t<string>CustomLocation</string>\r\n\t<key>CustomBuildIntermediatesPath</key>\r\n\t<string>Build/Intermediates</string>\r\n\t<key>CustomBuildLocationType</key>\r\n\t<string>RelativeToWorkspace</string>\r\n\t<key>CustomBuildProductsPath</key>\r\n\t<string>Build</string>\r\n\t<key>DerivedDataLocationStyle</key>\r\n\t<string>Default</string>\r\n\t<key>IssueFilterStyle</key>\r\n\t<string>ShowActiveSchemeOnly</string>\r\n\t<key>LiveSourceIssuesEnabled</key>\r\n\t<true/>\r\n\t<key>SnapshotAutomaticallyBeforeSignificantChanges</key>\r\n\t<true/>\r\n\t<key>SnapshotLocationStyle</key>\r\n\t<string>Default</string>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/xcuserdata/yongkangchen.xcuserdatad/xcschemes/slua.xcscheme",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<Scheme\r\n   LastUpgradeVersion = \"0640\"\r\n   version = \"1.3\">\r\n   <BuildAction\r\n      parallelizeBuildables = \"YES\"\r\n      buildImplicitDependencies = \"YES\">\r\n      <BuildActionEntries>\r\n         <BuildActionEntry\r\n            buildForTesting = \"YES\"\r\n            buildForRunning = \"YES\"\r\n            buildForProfiling = \"YES\"\r\n            buildForArchiving = \"YES\"\r\n            buildForAnalyzing = \"YES\">\r\n            <BuildableReference\r\n               BuildableIdentifier = \"primary\"\r\n               BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n               BuildableName = \"slua.bundle\"\r\n               BlueprintName = \"slua\"\r\n               ReferencedContainer = \"container:slua.xcodeproj\">\r\n            </BuildableReference>\r\n         </BuildActionEntry>\r\n      </BuildActionEntries>\r\n   </BuildAction>\r\n   <TestAction\r\n      selectedDebuggerIdentifier = \"Xcode.DebuggerFoundation.Debugger.LLDB\"\r\n      selectedLauncherIdentifier = \"Xcode.DebuggerFoundation.Launcher.LLDB\"\r\n      shouldUseLaunchSchemeArgsEnv = \"YES\"\r\n      buildConfiguration = \"Debug\">\r\n      <Testables>\r\n      </Testables>\r\n   </TestAction>\r\n   <LaunchAction\r\n      selectedDebuggerIdentifier = \"Xcode.DebuggerFoundation.Debugger.LLDB\"\r\n      selectedLauncherIdentifier = \"Xcode.DebuggerFoundation.Launcher.LLDB\"\r\n      launchStyle = \"0\"\r\n      useCustomWorkingDirectory = \"NO\"\r\n      buildConfiguration = \"Debug\"\r\n      ignoresPersistentStateOnLaunch = \"NO\"\r\n      debugDocumentVersioning = \"YES\"\r\n      allowLocationSimulation = \"YES\">\r\n      <MacroExpansion>\r\n         <BuildableReference\r\n            BuildableIdentifier = \"primary\"\r\n            BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n            BuildableName = \"slua.bundle\"\r\n            BlueprintName = \"slua\"\r\n            ReferencedContainer = \"container:slua.xcodeproj\">\r\n         </BuildableReference>\r\n      </MacroExpansion>\r\n      <AdditionalOptions>\r\n      </AdditionalOptions>\r\n   </LaunchAction>\r\n   <ProfileAction\r\n      shouldUseLaunchSchemeArgsEnv = \"YES\"\r\n      savedToolIdentifier = \"\"\r\n      useCustomWorkingDirectory = \"NO\"\r\n      buildConfiguration = \"Release\"\r\n      debugDocumentVersioning = \"YES\">\r\n      <MacroExpansion>\r\n         <BuildableReference\r\n            BuildableIdentifier = \"primary\"\r\n            BlueprintIdentifier = \"E80919D31B745519008FED27\"\r\n            BuildableName = \"slua.bundle\"\r\n            BlueprintName = \"slua\"\r\n            ReferencedContainer = \"container:slua.xcodeproj\">\r\n         </BuildableReference>\r\n      </MacroExpansion>\r\n   </ProfileAction>\r\n   <AnalyzeAction\r\n      buildConfiguration = \"Debug\">\r\n   </AnalyzeAction>\r\n   <ArchiveAction\r\n      buildConfiguration = \"Release\"\r\n      revealArchiveInOrganizer = \"YES\">\r\n   </ArchiveAction>\r\n</Scheme>\r\n"
  },
  {
    "path": "build/luajit-osx/slua.xcodeproj/xcuserdata/yongkangchen.xcuserdatad/xcschemes/xcschememanagement.plist",
    "content": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\r\n<!DOCTYPE plist PUBLIC \"-//Apple//DTD PLIST 1.0//EN\" \"http://www.apple.com/DTDs/PropertyList-1.0.dtd\">\r\n<plist version=\"1.0\">\r\n<dict>\r\n\t<key>SchemeUserState</key>\r\n\t<dict>\r\n\t\t<key>slua.xcscheme</key>\r\n\t\t<dict>\r\n\t\t\t<key>orderHint</key>\r\n\t\t\t<integer>0</integer>\r\n\t\t</dict>\r\n\t</dict>\r\n\t<key>SuppressBuildableAutocreation</key>\r\n\t<dict>\r\n\t\t<key>E80919D31B745519008FED27</key>\r\n\t\t<dict>\r\n\t\t\t<key>primary</key>\r\n\t\t\t<true/>\r\n\t\t</dict>\r\n\t</dict>\r\n</dict>\r\n</plist>\r\n"
  },
  {
    "path": "build/make_android.sh",
    "content": "#!/usr/bin/env bash\r\ncd \"$( dirname \"${BASH_SOURCE[0]}\" )\"\r\ncp slua.c luajit-2.0.4/src/\r\ncd luajit-2.0.4\r\nSRCDIR=$(pwd)\r\nDIR=$(pwd)\r\n\r\nNDK=/Users/sineysan/android-ndk-r10  \r\nNDKABI=8  \r\nNDKVER=$NDK/toolchains/arm-linux-androideabi-4.8  \r\nNDKP=$NDKVER/prebuilt/darwin-x86_64/bin/arm-linux-androideabi-  \r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\n  \r\n# # Android/ARM, armeabi (ARMv5TE soft-float), Android 2.2+ (Froyo)  \r\n# DESTDIR=$DIR/android/armeabi  \r\n# mkdir -p $DESTDIR\r\n# rm -rf \"$DESTDIR\"/*.a  \r\n# make clean  \r\n# make HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_SYS=Linux TARGET_FLAGS=\"$NDKF\"  \r\n  \r\n# if [ -f $SRCDIR/src/libluajit.so ]; then  \r\n#     mv $SRCDIR/src/libluajit.so $DESTDIR/libslua.so\r\n# fi;  \r\n  \r\n# Android/ARM, armeabi-v7a (ARMv7 VFP), Android 4.0+ (ICS)  \r\nNDKARCH=\"-march=armv7-a -mfloat-abi=softfp -Wl,--fix-cortex-a8\"  \r\nNDKABI=14 \r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-arm\"\r\nDESTDIR=$DIR/android/armeabi-v7a\r\nmkdir -p $DESTDIR  \r\nrm -rf \"$DESTDIR\"/*.a  \r\nmake clean  \r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_SYS=Linux TARGET_FLAGS=\"$NDKF $NDKARCH\" TARGET_SONAME=libslua.so BUILDMODE=dynamic\r\n  \r\nif [ -f $SRCDIR/src/libluajit.so ]; then  \r\n    cp $SRCDIR/src/libluajit.so ../../Assets/Plugins/Android/libs/armeabi-v7a/libslua.so\r\nfi;  \r\n  \r\n# Android/x86, x86 (i686 SSE3), Android 4.0+ (ICS)  \r\nNDKABI=14  \r\nDESTDIR=$DIR/android/x86\r\nmkdir -p $DESTDIR \r\nNDKVER=$NDK/toolchains/x86-4.8  \r\nNDKP=$NDKVER/prebuilt/darwin-x86_64/bin/i686-linux-android-  \r\nNDKF=\"--sysroot $NDK/platforms/android-$NDKABI/arch-x86\"  \r\nrm -rf \"$DESTDIR\"/*.a  \r\nmake clean  \r\nmake HOST_CC=\"gcc -m32\" CROSS=$NDKP TARGET_SYS=Linux TARGET_FLAGS=\"$NDKF\"  \r\n  \r\nif [ -f $SRCDIR/src/libluajit.so ]; then  \r\n    cp $SRCDIR/src/libluajit.so ../../Assets/Plugins/Android/libs/x86/libslua.so\r\nfi;   \r\n  \r\n# make clean  \r\n"
  },
  {
    "path": "build/make_ios.sh",
    "content": "#!/usr/bin/env bash\r\ncd \"$( dirname \"${BASH_SOURCE[0]}\" )\"\r\ncp slua.c luajit-2.1.0/src/\r\ncd luajit-2.1.0\r\nLIPO=\"xcrun -sdk iphoneos lipo\"\r\nSTRIP=\"xcrun -sdk iphoneos strip\"\r\n\r\nIXCODE=`xcode-select -print-path`\r\nISDK=$IXCODE/Platforms/iPhoneOS.platform/Developer\r\nISDKVER=iPhoneOS.sdk\r\nISDKP=$IXCODE/usr/bin/\r\n\r\nif [ ! -e $ISDKP/ar ]; then \r\n  sudo cp /usr/bin/ar $ISDKP\r\nfi\r\n\r\nif [ ! -e $ISDKP/ranlib ]; then\r\n  sudo cp /usr/bin/ranlib $ISDKP\r\nfi\r\n\r\nif [ ! -e $ISDKP/strip ]; then\r\n  sudo cp /usr/bin/strip $ISDKP\r\nfi\r\n\r\nmake clean\r\nISDKF=\"-arch armv7 -isysroot $ISDK/SDKs/$ISDKVER\"\r\nmake HOST_CC=\"gcc -m32 -std=c99\" CROSS=\"$ISDKP\" TARGET_FLAGS=\"$ISDKF\" TARGET=armv7 TARGET_SYS=iOS LUAJIT_A=libsluav7.a\r\n\r\n\r\nmake clean\r\nISDKF=\"-arch armv7s -isysroot $ISDK/SDKs/$ISDKVER\"\r\nmake HOST_CC=\"gcc -m32 -std=c99\" CROSS=\"$ISDKP\" TARGET_FLAGS=\"$ISDKF\" TARGET=armv7s TARGET_SYS=iOS LUAJIT_A=libsluav7s.a\r\n\r\nmake clean\r\nISDKF=\"-arch arm64 -isysroot $ISDK/SDKs/$ISDKVER\"\r\nmake HOST_CC=\"gcc -std=c99\" CROSS=\"$ISDKP\" TARGET_FLAGS=\"$ISDKF\" TARGET=arm64 TARGET_SYS=iOS LUAJIT_A=libslua64.a\r\n\r\ncd src\r\nlipo libsluav7.a -create libsluav7s.a libslua64.a -output libslua.a\r\ncp libslua.a ../../../Assets/Plugins/iOS/\r\ncd ..\r\n\r\n"
  },
  {
    "path": "build/make_osx.sh",
    "content": "#!/usr/bin/env bash\r\ncd \"$( dirname \"${BASH_SOURCE[0]}\" )\"\r\n\r\ncd lua-5.1.5/slua\r\nxcodebuild\r\ncp -r Build/Release/slua.bundle ../../../Assets/Plugins/\r\n\r\ncd -"
  },
  {
    "path": "build/make_osx_jit.sh",
    "content": "#!/usr/bin/env bash\r\n\r\ncd \"$( dirname \"${BASH_SOURCE[0]}\" )\"\r\ncp slua.c luajit-2.1.0/src/\r\n\r\ncd luajit-2.1.0\r\nmake clean\r\nmake CC=\"gcc -m32\" BUILDMODE=static\r\ncp src/libluajit.a ../luajit-osx/libluajit_x86.a\r\n\r\nmake clean\r\nmake CC=\"gcc\" BUILDMODE=static\r\ncp src/libluajit.a ../luajit-osx/libluajit_x86_64.a\r\n\r\ncd ../luajit-osx/\r\nxcodebuild -configuration=Release\r\ncp -r Build/Release/slua.bundle ../../Assets/Plugins/\r\n"
  },
  {
    "path": "build/make_win_with_2013.bat",
    "content": "@echo off\r\ncopy /Y slua.c luajit-2.0.4\\src\\ \r\nif exist \"%VS120COMNTOOLS%\" (\r\n\tset VCVARS=\"%VS120COMNTOOLS%..\\..\\VC\\bin\\\"\r\n\tgoto build\r\n\t) \r\nelse (goto check2012)\r\n\r\n:check2012\r\nif exist \"%VS110COMNTOOLS%\" (set VCVARS=\"%VS110COMNTOOLS%..\\..\\VC\\bin\\\") else (goto missing)\r\n\r\n:build\r\n\r\n@set ENV32=\"%VCVARS%vcvars32.bat\"\r\n@set ENV64=\"%VCVARS%amd64\\vcvars64.bat\"\r\n\r\ncall \"%ENV32%\"\r\necho Swtich to x86 build env\r\ncd luajit-2.0.4\\src\r\ncall msvcbuild.bat\r\ncopy /Y lua51.dll ..\\..\\..\\Assets\\Plugins\\x86\\slua.dll\r\ncd ..\\..\r\n\r\ncall \"%ENV64%\"\r\necho Swtich to x64 build env\r\ncd luajit-2.0.4\\src\r\ncall msvcbuild.bat\r\ncopy /Y lua51.dll ..\\..\\..\\Assets\\Plugins\\x64\\slua.dll\r\ncd ..\\..\r\n\r\n\r\ngoto :eof\r\n\r\n:missing\r\necho Can't find Visual Studio 2013.\r\ngoto :eof"
  },
  {
    "path": "build/slua.c",
    "content": "// The MIT License (MIT)\r\n\r\n// Copyright 2015 Siney/Pangweiwei siney@yeah.net\r\n// \r\n// Permission is hereby granted, free of charge, to any person obtaining a copy\r\n// of this software and associated documentation files (the \"Software\"), to deal\r\n// in the Software without restriction, including without limitation the rights\r\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n// copies of the Software, and to permit persons to whom the Software is\r\n// furnished to do so, subject to the following conditions:\r\n// \r\n// The above copyright notice and this permission notice shall be included in\r\n// all copies or substantial portions of the Software.\r\n// \r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n// THE SOFTWARE.\r\n\r\n\r\n#define MT_VEC2 1\r\n#define MT_VEC3 2\r\n#define MT_VEC4 3\r\n#define MT_Q\t4\r\n#define MT_COLOR\t5\r\n\r\n#define LUA_LIB\r\n\r\n#include \"lua.h\"\r\n#include \"lauxlib.h\"\r\n#include <stdio.h>\r\n#include <string.h>\r\n\r\n#ifdef _WIN32\r\n#include <float.h>\r\n#define isnan _isnan\r\n#define snprintf _snprintf\r\n#else\r\n#include <math.h>\r\n#endif\r\n\r\nstatic const luaL_Reg s_lib_preload[] = {\r\n\t// { \"lpeg\", luaopen_lpeg },\r\n\t// { \"pb\",    luaopen_pb }, // any 3rd lualibs added here\r\n\t\t{ NULL, NULL }\r\n};\r\n\r\n#if LUA_VERSION_NUM >= 503\r\n\r\nstatic const char *luaL_findtable(lua_State *L, int idx,\r\n\tconst char *fname, int szhint) {\r\n\tconst char *e;\r\n\tif (idx) lua_pushvalue(L, idx);\r\n\tdo {\r\n\t\te = strchr(fname, '.');\r\n\t\tif (e == NULL) e = fname + strlen(fname);\r\n\t\tlua_pushlstring(L, fname, e - fname);\r\n\t\tif (lua_rawget(L, -2) == LUA_TNIL) {  /* no such field? */\r\n\t\t\tlua_pop(L, 1);  /* remove this nil */\r\n\t\t\tlua_createtable(L, 0, (*e == '.' ? 1 : szhint)); /* new table for field */\r\n\t\t\tlua_pushlstring(L, fname, e - fname);\r\n\t\t\tlua_pushvalue(L, -2);\r\n\t\t\tlua_settable(L, -4);  /* set new table into field */\r\n\t\t}\r\n\t\telse if (!lua_istable(L, -1)) {  /* field has a non-table value? */\r\n\t\t\tlua_pop(L, 2);  /* remove table and value */\r\n\t\t\treturn fname;  /* return problematic part of the name */\r\n\t\t}\r\n\t\tlua_remove(L, -2);  /* remove previous table */\r\n\t\tfname = e + 1;\r\n\t} while (*e == '.');\r\n\treturn NULL;\r\n}\r\n\r\n#else\r\n\r\nstatic int lua_absindex(lua_State *L, int index) {\r\n\treturn index > 0 ? index : lua_gettop(L) + index + 1;\r\n}\r\n\r\n#endif\r\n\r\n\r\n\r\nLUA_API void luaS_openextlibs(lua_State *L) {\r\n\tconst luaL_Reg *lib;\r\n\r\n\tluaL_findtable(L, LUA_REGISTRYINDEX, \"_PRELOAD\",\r\n\t\tsizeof(s_lib_preload) / sizeof(s_lib_preload[0]) - 1);\r\n\r\n\tfor (lib = s_lib_preload; lib->func; lib++) {\r\n\t\tlua_pushcfunction(L, lib->func);\r\n\t\tlua_setfield(L, -2, lib->name);\r\n\t}\r\n\r\n\tlua_pop(L, 1);\r\n}\r\n\r\nLUA_API void luaS_newuserdata(lua_State *L, int val)\r\n{\r\n\tint* pointer = (int*)lua_newuserdata(L, sizeof(int));\r\n\t*pointer = val;\r\n}\r\n\r\nLUA_API int luaS_rawnetobj(lua_State *L, int index)\r\n{\r\n\tint *ud;\r\n\r\n\tif (lua_istable(L, index))\r\n\t{\r\n\t\tlua_pushvalue(L, index);\r\n\t\twhile (lua_istable(L, -1))\r\n\t\t{\r\n\t\t\tlua_pushstring(L, \"__base\");\r\n\t\t\tlua_rawget(L, -2);\r\n\t\t\tlua_remove(L, -2);\r\n\t\t}\r\n\t\tif (lua_isuserdata(L, -1) > 0)\r\n\t\t\tlua_replace(L, index);\r\n\t\telse\r\n\t\t\treturn -1;\r\n\t}\r\n\r\n\tud = lua_touserdata(L, index);\r\n\treturn (ud != NULL)?*ud:-1;\r\n}\r\n\r\nLUA_API void luaS_pushuserdata(lua_State *L, void* ptr)\r\n{\r\n\tvoid** pointer = (void**)lua_newuserdata(L, sizeof(void*));\r\n\t*pointer = ptr;\r\n}\r\n\r\n\r\nLUA_API const char* luaS_tolstring32(lua_State *L, int index, int* len) {\r\n\tsize_t l;\r\n\tconst char* ret = lua_tolstring(L, index, &l);\r\n\t*len = (int)l;\r\n\treturn ret;\r\n}\r\n\r\n#if LUA_VERSION_NUM>=503\r\nstatic int k(lua_State *L, int status, lua_KContext ctx) {\r\n\treturn status;\r\n}\r\n\r\nLUA_API int luaS_yield(lua_State *L, int nrets) {\r\n\treturn k(L, lua_yieldk(L, nrets, 0, k), 0);\r\n}\r\n\r\nLUA_API int luaS_pcall(lua_State *L, int nargs, int nresults, int err) {\r\n\treturn k(L, lua_pcallk(L, nargs, nresults, err, 0, k), 0);\r\n}\r\n#endif\r\n\r\n\r\n\r\nstatic void getmetatable(lua_State *L, const char* key) {\r\n\tchar ns[256];\r\n\tsnprintf(ns, 256, \"UnityEngine.%s.Instance\", key);\r\n\r\n\tlua_getglobal(L, ns);\r\n}\r\n\r\nstatic void setmetatable(lua_State *L, int p, int what) {\r\n\r\n\tint ref;\r\n\t\r\n#if LUA_VERSION_NUM>=503\r\n\tlua_pushglobaltable(L);\r\n\tlua_rawgeti(L, -1, what);\r\n\tlua_remove(L, -2);\r\n#else\r\n\tlua_rawgeti(L, LUA_GLOBALSINDEX, what);\r\n#endif\r\n\tif (!lua_isnil(L, -1)) {\r\n\t\tref = (int)lua_tointeger(L, -1);\r\n\t\tlua_pop(L, 1);\r\n\t\tif (ref != LUA_REFNIL)\r\n\t\t{\r\n\t\t\tlua_rawgeti(L, LUA_REGISTRYINDEX, ref);\r\n\t\t}\r\n\t}\r\n\telse {\r\n\t\tlua_pop(L, 1);\r\n\r\n\t\tswitch (what) {\r\n\t\tcase MT_VEC2:\r\n\t\t\tgetmetatable(L, \"Vector2\");\r\n\t\t\tbreak;\r\n\t\tcase MT_VEC3:\r\n\t\t\tgetmetatable(L, \"Vector3\");\r\n\t\t\tbreak;\r\n\t\tcase MT_VEC4:\r\n\t\t\tgetmetatable(L, \"Vector4\");\r\n\t\t\tbreak;\r\n\t\tcase MT_Q:\r\n\t\t\tgetmetatable(L, \"Quaternion\");\r\n\t\t\tbreak;\r\n\t\tcase MT_COLOR:\r\n\t\t\tgetmetatable(L, \"Color\");\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tlua_pushvalue(L, -1);\r\n\t\tref = luaL_ref(L, LUA_REGISTRYINDEX);\r\n#if LUA_VERSION_NUM >= 503\r\n\t\tlua_pushglobaltable(L);\r\n\t\tlua_pushinteger(L, ref);\r\n\t\tlua_rawseti(L, -2, what);\r\n\t\tlua_pop(L, 1);\r\n#else\r\n\t\tlua_pushinteger(L, ref);\r\n\t\tlua_rawseti(L, LUA_GLOBALSINDEX, what);\r\n#endif\r\n\t}\r\n\r\n\tlua_setmetatable(L, p);\r\n}\r\n\r\n\r\n\r\nLUA_API int luaS_checkluatype(lua_State *L, int p, const char *t) {\r\n\tint top;\r\n\tconst char* b;\r\n\r\n\tp=lua_absindex(L,p);\r\n\tif (lua_type(L, p) != LUA_TTABLE)\r\n\t\treturn 0;\r\n\ttop = lua_gettop(L);\r\n\tif (lua_getmetatable(L, p) == 0)\r\n\t\treturn 0;\r\n\r\n\tlua_pushstring(L, \"__typename\");\r\n\tlua_rawget(L, -2);\r\n\tif (lua_isnil(L, -1))\r\n\t{\r\n\t\tlua_settop(L, top);\r\n\t\treturn 0;\r\n\t}\r\n\tif (t != NULL) {\r\n\t\tb = lua_tostring(L, -1);\r\n\t\tlua_settop(L, top);\r\n\t\treturn strcmp(t, b) == 0;\r\n\t}\r\n\tlua_settop(L, top);\r\n\treturn 1;\r\n}\r\n\r\n\r\nLUA_API int luaS_checkVector4(lua_State *L, int p, float* x, float *y, float *z, float *w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector4(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_VEC4);\r\n}\r\n\r\nLUA_API int luaS_checkVector3(lua_State *L, int p, float* x, float *y, float *z) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tluaL_checktype(L, p, LUA_TTABLE);\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 3);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector3(lua_State *L, float x, float y, float z) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tsetmetatable(L, -2, MT_VEC3);\r\n}\r\n\r\nLUA_API int luaS_checkVector2(lua_State *L, int p, float* x, float *y) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 2);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushVector2(lua_State *L, float x, float y) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tsetmetatable(L, -2, MT_VEC2);\r\n}\r\n\r\nLUA_API int luaS_checkQuaternion(lua_State *L, int p, float* x, float *y, float *z, float* w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API int luaS_checkColor(lua_State *L, int p, float* x, float *y, float *z, float* w) {\r\n\tp=lua_absindex(L,p);\r\n\tif(lua_type(L,p)!=LUA_TTABLE)\r\n\t\treturn -1;\r\n\tlua_rawgeti(L, p, 1);\r\n\t*x = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 2);\r\n\t*y = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 3);\r\n\t*z = (float)lua_tonumber(L, -1);\r\n\tlua_rawgeti(L, p, 4);\r\n\t*w = (float)lua_tonumber(L, -1);\r\n\tlua_pop(L, 4);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API void luaS_pushQuaternion(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_Q);\r\n}\r\n\r\nLUA_API void luaS_pushColor(lua_State *L, float x, float y, float z, float w) {\r\n\tlua_newtable(L);\r\n\tlua_pushnumber(L, x);\r\n\tlua_rawseti(L, -2, 1);\r\n\tlua_pushnumber(L, y);\r\n\tlua_rawseti(L, -2, 2);\r\n\tlua_pushnumber(L, z);\r\n\tlua_rawseti(L, -2, 3);\r\n\tlua_pushnumber(L, w);\r\n\tlua_rawseti(L, -2, 4);\r\n\tsetmetatable(L, -2, MT_COLOR);\r\n}\r\n\r\n\r\n\r\nstatic void setelement(lua_State* L, int p, float v, const char* key) {\r\n\tif (!isnan(v)) {\r\n\t\tlua_pushstring(L, key);\r\n\t\tlua_pushnumber(L, v);\r\n\t\tlua_settable(L, p);\r\n\t}\r\n}\r\n\r\n\r\nstatic void setelementid(lua_State* L, int p, float v, int id) {\r\n\tif (!isnan(v)) {\r\n\t\tlua_pushnumber(L, v);\r\n\t\tlua_rawseti(L, p, id);\r\n\t}\r\n}\r\n\r\nLUA_API void luaS_setDataVec(lua_State *L, int p, float x, float y, float z, float w) {\r\n\tp=lua_absindex(L,p);\r\n\tsetelementid(L, p, x, 1);\r\n\tsetelementid(L, p, y, 2);\r\n\tsetelementid(L, p, z, 3);\r\n\tsetelementid(L, p, w, 4);\r\n}\r\n\r\nLUA_API void luaS_setColor(lua_State *L, int p, float x, float y, float z, float w) {\r\n\tp=lua_absindex(L,p);\r\n\tsetelement(L, p, x, \"r\");\r\n\tsetelement(L, p, y, \"g\");\r\n\tsetelement(L, p, z, \"b\");\r\n\tsetelement(L, p, w, \"a\");\r\n}\r\n\r\nstatic void cacheud(lua_State *l, int index, int cref) {\r\n\tlua_rawgeti(l, LUA_REGISTRYINDEX, cref);\r\n\tlua_pushvalue(l, -2);\r\n\tlua_rawseti(l, -2, index);\r\n\tlua_pop(l, 1);\r\n}\r\n\r\n\r\nLUA_API int luaS_pushobject(lua_State *l, int index, const char* t, int gco, int cref) {\r\n\r\n\tint is_reflect = 0;\r\n\r\n\tluaS_newuserdata(l, index);\r\n\tif (gco) cacheud(l, index, cref);\r\n\r\n\r\n\tluaL_getmetatable(l, t);\r\n\tif (lua_isnil(l, -1))\r\n\t{\r\n\t\tlua_pop(l, 1);\r\n\t\tluaL_getmetatable(l, \"LuaVarObject\");\r\n\t\tis_reflect = 1;\r\n\t}\r\n\r\n\tlua_setmetatable(l, -2);\r\n\treturn is_reflect;\r\n}\r\n\r\nLUA_API int luaS_getcacheud(lua_State *l, int index, int cref) {\r\n\tlua_rawgeti(l, LUA_REGISTRYINDEX, cref);\r\n\tlua_rawgeti(l, -1, index);\r\n\tif (!lua_isnil(l, -1))\r\n\t{\r\n\t\tlua_remove(l, -2);\r\n\t\treturn 1;\r\n\t}\r\n\tlua_pop(l, 2);\r\n\treturn 0;\r\n}\r\n\r\nLUA_API int luaS_subclassof(lua_State *l, int p, const char* t) {\r\n\r\n\tconst char* tname;\r\n\tint ok;\r\n\tint top = lua_gettop(l);\r\n\r\n\tlua_pushvalue(l, p);\r\n\twhile (lua_istable(l, -1))\r\n\t{\r\n\t\tlua_pushstring(l, \"__base\");\r\n\t\tlua_rawget(l, -2);\r\n\t}\r\n\r\n\tif (lua_isnil(l, -1)) {\r\n\t\tlua_settop(l, top);\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tif (t != NULL) {\r\n\t\tlua_getmetatable(l, -1);\r\n\t\tlua_getfield(l, -1, \"__typename\");\r\n\t\ttname = lua_tostring(l, -1);\r\n\t\tok = strcmp(tname, t);\r\n\t\tlua_settop(l, top);\r\n\t\treturn ok == 0;\r\n\t}\r\n\treturn 1;\r\n}\r\n\r\n\r\n#if LUA_VERSION_NUM>=502\r\nLUALIB_API int luaS_rawlen(lua_State *L, int idx)\r\n{\r\n\tsize_t ret = lua_rawlen(L, idx);\r\n\treturn (int)ret;\r\n}\r\n#else\r\nLUALIB_API int luaS_objlen(lua_State *L, int idx)\r\n{\r\n\tsize_t ret = lua_objlen(L, idx);\r\n\treturn (int)ret;\r\n}\r\n#endif\r\n\r\n\r\nLUALIB_API void  luaS_pushlstring(lua_State *L, const char *s, int l)\r\n{\r\n\tlua_pushlstring(L, s, (size_t)l);\r\n}\r\n\r\nLUALIB_API int luaLS_loadbuffer(lua_State *L, const char *buff, int sz, const char *name)\r\n{\r\n\treturn luaL_loadbuffer(L, buff, (size_t)sz, name);\r\n}\r\n\r\n"
  },
  {
    "path": "debugger/README.txt",
    "content": "Source code located at https://github.com/pangweiwei/sluadbg"
  },
  {
    "path": "debugger/mac/runldb.sh",
    "content": "#!/bin/sh\r\nexport workDir=`pwd`\r\nosascript -e \"tell app \\\"Terminal\\\" \r\nactivate\r\ndo script \\\"$workDir/ldb -host $1 -port $2 \\\"\r\nend tell\"\r\n"
  },
  {
    "path": "uLui.CSharp.Editor.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\r\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\r\n  <PropertyGroup>\r\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\r\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\r\n    <ProductVersion>10.0.20506</ProductVersion>\r\n    <SchemaVersion>2.0</SchemaVersion>\r\n    <ProjectGuid>{55159930-8D4A-5B28-6310-5E3BFF6FA19C}</ProjectGuid>\r\n    <OutputType>Library</OutputType>\r\n    <AssemblyName>Assembly-CSharp-Editor</AssemblyName>\r\n    <FileAlignment>512</FileAlignment>\r\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\r\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\r\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\r\n    <TargetFrameworkProfile>Unity Full v3.5</TargetFrameworkProfile>\r\n    <CompilerResponseFile></CompilerResponseFile>\r\n    <UnityProjectType>Editor:5</UnityProjectType>\r\n    <UnityBuildTarget>Android:13</UnityBuildTarget>\r\n    <UnityVersion>5.3.4f1</UnityVersion>\r\n    <RootNamespace></RootNamespace>\r\n    <LangVersion Condition=\" '$(VisualStudioVersion)' != '10.0' \">4</LangVersion>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <ItemGroup>\r\n    <Reference Include=\"mscorlib\" />\r\n    <Reference Include=\"System\" />\r\n    <Reference Include=\"System.XML\" />\r\n    <Reference Include=\"System.Core\" />\r\n    <Reference Include=\"Boo.Lang\" />\r\n    <Reference Include=\"UnityScript.Lang\" />\r\n    <Reference Include=\"System.Runtime.Serialization\" />\r\n    <Reference Include=\"System.Xml.Linq\" />\r\n    <Reference Include=\"UnityEngine\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.Advertisements\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Advertisements.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"nunit.framework\">\r\n      <HintPath>Library\\UnityAssemblies\\nunit.framework.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.EditorTestsRunner\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.EditorTestsRunner.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.UI\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.UI\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.UI.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.Networking\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.Networking\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Networking.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.TreeEditor\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.TreeEditor.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.Graphs\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Graphs.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.Android.Extensions\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Android.Extensions.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.WebGL.Extensions\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.WebGL.Extensions.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor.WindowsStandalone.Extensions\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.WindowsStandalone.Extensions.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"SyntaxTree.VisualStudio.Unity.Bridge\">\r\n      <HintPath>Library\\UnityAssemblies\\SyntaxTree.VisualStudio.Unity.Bridge.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"ICSharpCode.SharpZipLib\">\r\n      <HintPath>Assets\\Plugins\\ICSharpCode.SharpZipLib.dll</HintPath>\r\n    </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <ProjectReference Include=\"uLui.CSharp.Plugins.csproj\">\r\n      <Project>{8D66828F-FF89-BD29-7CED-0BC136C2EE57}</Project>\r\n      <Name>uLui.CSharp.Plugins</Name>\r\n    </ProjectReference>\r\n    <ProjectReference Include=\"uLui.CSharp.csproj\">\r\n      <Project>{DC438CA0-3401-5A36-0F91-D659DEA86D24}</Project>\r\n      <Name>uLui.CSharp</Name>\r\n    </ProjectReference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportAssetBundles.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportConfigWindow.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFont.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFontReader.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMGlyph.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmBetterList.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmByteReader.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmFontEditor.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\Helper.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\I18nExporter\\I18nExporter.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\MakeDebugFile.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\TexturePackerImporter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\Editor\\CustomEditor.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\Editor\\CustomExport.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\Editor\\LuaCodeGen.cs\" />\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\r\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\r\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\r\n  </ItemGroup>\r\n  <Import Project=\"$(MSBuildExtensionsPath)\\SyntaxTree\\UnityVS\\2015\\UnityVS.CSharp.targets\" />\r\n</Project>\r\n"
  },
  {
    "path": "uLui.CSharp.Plugins.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\r\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\r\n  <PropertyGroup>\r\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\r\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\r\n    <ProductVersion>10.0.20506</ProductVersion>\r\n    <SchemaVersion>2.0</SchemaVersion>\r\n    <ProjectGuid>{8D66828F-FF89-BD29-7CED-0BC136C2EE57}</ProjectGuid>\r\n    <OutputType>Library</OutputType>\r\n    <AssemblyName>Assembly-CSharp-firstpass</AssemblyName>\r\n    <FileAlignment>512</FileAlignment>\r\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\r\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\r\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\r\n    <TargetFrameworkProfile>Unity Subset v3.5</TargetFrameworkProfile>\r\n    <CompilerResponseFile></CompilerResponseFile>\r\n    <UnityProjectType>GamePlugins:3</UnityProjectType>\r\n    <UnityBuildTarget>Android:13</UnityBuildTarget>\r\n    <UnityVersion>5.3.4f1</UnityVersion>\r\n    <RootNamespace></RootNamespace>\r\n    <LangVersion Condition=\" '$(VisualStudioVersion)' != '10.0' \">4</LangVersion>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <ItemGroup>\r\n    <Reference Include=\"mscorlib\" />\r\n    <Reference Include=\"System\" />\r\n    <Reference Include=\"System.XML\" />\r\n    <Reference Include=\"System.Core\" />\r\n    <Reference Include=\"Boo.Lang\" />\r\n    <Reference Include=\"UnityScript.Lang\" />\r\n    <Reference Include=\"System.Runtime.Serialization\" />\r\n    <Reference Include=\"System.Xml.Linq\" />\r\n    <Reference Include=\"UnityEngine\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.UI\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.Networking\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"ICSharpCode.SharpZipLib\">\r\n      <HintPath>Assets\\Plugins\\ICSharpCode.SharpZipLib.dll</HintPath>\r\n    </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <Compile Include=\"Assets\\Plugins\\ILeanTween.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\LTDescr.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\LeanAudio.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\LeanTest.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\LeanTween.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ByteArray.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Coroutine.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Debugger\\DebugInterface.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Debugger\\SLuaDebug.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Helper.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\CjsonLib.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\LuasocketLib.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\PbcLib.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\SprotoLib.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\SqliteLib.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Logger.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdDLL.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdMeta.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaArray.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLL.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLLWrapper.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_basetype.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_overload.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaState.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvr.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvrGameObject.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaValueType.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaVarObject.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ObjectCache.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\SLuaSetting.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Timer.cs\" />\r\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\WeakDictionary.cs\" />\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\r\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\r\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\r\n  </ItemGroup>\r\n  <Import Project=\"$(MSBuildExtensionsPath)\\SyntaxTree\\UnityVS\\2015\\UnityVS.CSharp.targets\" />\r\n</Project>\r\n"
  },
  {
    "path": "uLui.CSharp.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\r\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\r\n  <PropertyGroup>\r\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\r\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\r\n    <ProductVersion>10.0.20506</ProductVersion>\r\n    <SchemaVersion>2.0</SchemaVersion>\r\n    <ProjectGuid>{DC438CA0-3401-5A36-0F91-D659DEA86D24}</ProjectGuid>\r\n    <OutputType>Library</OutputType>\r\n    <AssemblyName>Assembly-CSharp</AssemblyName>\r\n    <FileAlignment>512</FileAlignment>\r\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\r\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\r\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\r\n    <TargetFrameworkProfile>Unity Subset v3.5</TargetFrameworkProfile>\r\n    <CompilerResponseFile></CompilerResponseFile>\r\n    <UnityProjectType>Game:1</UnityProjectType>\r\n    <UnityBuildTarget>Android:13</UnityBuildTarget>\r\n    <UnityVersion>5.3.4f1</UnityVersion>\r\n    <RootNamespace></RootNamespace>\r\n    <LangVersion Condition=\" '$(VisualStudioVersion)' != '10.0' \">4</LangVersion>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\r\n    <DebugType>pdbonly</DebugType>\r\n    <Optimize>false</Optimize>\r\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\r\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\r\n    <ErrorReport>prompt</ErrorReport>\r\n    <WarningLevel>4</WarningLevel>\r\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_3_4;UNITY_5_3;UNITY_5;ENABLE_NEW_BUGREPORTER;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_FRAME_DEBUGGER;ENABLE_GENERICS;ENABLE_HOME_SCREEN;ENABLE_IMAGEEFFECTS;ENABLE_LIGHT_PROBES_LEGACY;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_PLUGIN_INSPECTOR;ENABLE_SHADOWS;ENABLE_SINGLE_INSTANCE_BUILD_SETTING;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_SPRITE_POLYGON;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_UNITYEVENTS;ENABLE_VR;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;INCLUDE_IL2CPP;INCLUDE_DIRECTX12;PLATFORM_SUPPORTS_MONO;ENABLE_LOCALIZATION;ENABLE_ANDROID_ATLAS_ETC1_COMPRESSION;ENABLE_EDITOR_TESTS_RUNNER;UNITY_ANDROID;UNITY_ANDROID_API;ENABLE_SUBSTANCE;UNITY_ANDROID_API;ENABLE_TEXTUREID_MAP;ENABLE_EGL;ENABLE_NETWORK;ENABLE_RUNTIME_GI;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_LOG_MIXED_STACKTRACE;ENABLE_UNITYWEBREQUEST;PLATFORM_SUPPORTS_ADS_ID;ENABLE_UNITYADS_RUNTIME;UNITY_UNITYADS_API;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;CROSS_PLATFORM_INPUT;MOBILE_INPUT</DefineConstants>\r\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\r\n  </PropertyGroup>\r\n  <ItemGroup>\r\n    <Reference Include=\"mscorlib\" />\r\n    <Reference Include=\"System\" />\r\n    <Reference Include=\"System.XML\" />\r\n    <Reference Include=\"System.Core\" />\r\n    <Reference Include=\"Boo.Lang\" />\r\n    <Reference Include=\"UnityScript.Lang\" />\r\n    <Reference Include=\"System.Runtime.Serialization\" />\r\n    <Reference Include=\"System.Xml.Linq\" />\r\n    <Reference Include=\"UnityEngine\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.UI\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEngine.Networking\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"UnityEditor\">\r\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\r\n    </Reference>\r\n    <Reference Include=\"ICSharpCode.SharpZipLib\">\r\n      <HintPath>Assets\\Plugins\\ICSharpCode.SharpZipLib.dll</HintPath>\r\n    </Reference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <ProjectReference Include=\"uLui.CSharp.Plugins.csproj\">\r\n      <Project>{8D66828F-FF89-BD29-7CED-0BC136C2EE57}</Project>\r\n      <Name>uLui.CSharp.Plugins</Name>\r\n    </ProjectReference>\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\Firstui.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\Secondui.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\WindowGridView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\Game.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LArchiveBin.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LArchiveBinFile.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LGameConfig.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLoadBundle.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaBehaviourBase.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaBehaviourInterface.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaTable.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LResUpdate.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LUtil.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LButton.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LControlView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LDragView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LExpandListView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LExpandNode.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LFPSView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LGridPageView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LGridView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LHUDSort.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LHUDView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LLabelAtlas.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LListView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LMacros.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LMovieClip.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LPageView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LPickMark.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LProgress.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LRichText.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LScrollView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LSlider.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LTableView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LTouchView.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWindow\\LWindowBase.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWindow\\LWindowManager.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\Network.cs\" />\r\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\Reactor.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\BindCustom.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaDelegate_Deleg_GetBundleInfoDelegate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaDelegate_Deleg_SimpleDelegate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaDelegate_System_Action.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_LTEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_System_Object.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Color.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Vector2.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Vector3.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_bool.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_float.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_System_UInt16_SLua_ByteArray.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_float_System_Object.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_float_float.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_int_Dictionary_System_Int32_object_.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_int_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Comparison_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Func_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Func_3_int_string_bool.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Predicate_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_EventSystems_PointerEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_GameObject.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_Vector2.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_Vector3.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_float.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_2_int_UnityEngine_GameObject.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_2_string_Dictionary_System_String_System_String_.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_3_float_float_bool.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEvent_int_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_AbsClass.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Custom.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Deleg.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_FloatEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Game.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_HelloWorld.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LDragView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LGameConfig.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LHUDSort.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LHUDView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LLoadBundle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LProgress.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LResUpdate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LSlider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LUtil.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LWindowBase.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LWindowManager.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LeanTween.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_ListViewEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LButton.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LControlView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LExpandListView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LExpandNode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LGridPageView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LGridView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LLabelAtlas.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LListView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LMovieClip.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LPageView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LRichText.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LScrollView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LTableView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LTouchView.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Network.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_SLuaTest.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_Collections_Generic_Dictionary_2_int_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_Collections_Generic_List_1_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_String.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_XXList.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_foostruct.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\BindUnity.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\BindUnityUI.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Application_AdvertisingIdentifierCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Application_LogCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioClip_PCMReaderCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioClip_PCMSetPositionCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioSettings_AudioConfigurationChangeHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Camera_CameraCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Canvas_WillRenderCanvases.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_CullingGroup_StateChanged.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Display_DisplaysUpdatedDelegate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Events_UnityAction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Font_FontTextureRebuildCallback.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_RectTransform_ReapplyDrivenProperties.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_UI_InputField_OnValidateInput.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaSystem_Func_1_bool.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaSystem_Func_2_UnityEngine_UI_ILayoutElement_float.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IBeginDragHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ICancelHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDeselectHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDragHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDropHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IEndDragHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IInitializePotentialDragHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IMoveHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerClickHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerDownHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerEnterHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerExitHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerUpHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IScrollHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ISelectHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ISubmitHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IUpdateSelectedHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_UnityEngine_EventSystems_BaseEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_UnityEngine_Vector2.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_bool.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_float.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_int.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_string.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_JetBrains_Annotations_ImplicitUseKindFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_JetBrains_Annotations_ImplicitUseTargetFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AccelerationEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnchoredJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Animation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationBlendMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationClip.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationClipPair.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationCullingType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationCurve.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationPlayMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Animator.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorClipInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorControllerParameter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorControllerParameterType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorCullingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorOverrideController.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorRecorderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorStateInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorTransitionInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorUpdateMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnisotropicFiltering.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Application.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ApplicationInstallMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ApplicationSandboxType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AreaEffector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_Assert.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_AssertionException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_Comparers_FloatComparer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleCreateRequest.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleManifest.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleRequest.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AsyncOperation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioChorusFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioClip.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioClipLoadType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioCompressionFormat.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioConfiguration.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioDataLoadState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioDistortionFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioEchoFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioHighPassFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioListener.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioLowPassFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbPreset.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbZone.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioRolloffMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSource.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSourceCurveType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSpeakerMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioVelocityUpdateMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixerGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixerSnapshot.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Avatar.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarBuilder.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarIKGoal.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarIKHint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarTarget.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Behaviour.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BillboardAsset.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BillboardRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BlendWeights.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoneWeight.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoundingSphere.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Bounds.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoxCollider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoxCollider2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BuoyancyEffector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Caching.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Camera.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CameraClearFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CameraType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Canvas.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CanvasGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CanvasRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CapsuleCollider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterController.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterJoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CircleCollider2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Cloth.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ClothSkinningCoefficient.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ClothSphereColliderPair.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collider2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collision.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collision2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionDetectionMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionDetectionMode2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Color.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Color32.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ColorSpace.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ColorUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CombineInstance.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Compass.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Component.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeBuffer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeBufferType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeShader.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConfigurableJoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConfigurableJointMotion.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConstantForce.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConstantForce2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ContactPoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ContactPoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ControllerColliderHit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CrashReport.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Cubemap.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CubemapFace.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CullingGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CullingGroupEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CustomYieldInstruction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Debug.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DepthTextureMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DeviceOrientation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DeviceType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Display.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DistanceJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DrivenRectTransformTracker.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DrivenTransformProperties.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DynamicGI.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EdgeCollider2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Effector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EffectorForceMode2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EffectorSelection2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EllipsoidParticleEmitter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Event.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_AbstractEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_AxisEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseInputModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseRaycaster.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventHandle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventSystem.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTriggerType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger_Entry.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger_TriggerEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_ExecuteEvents.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_MoveDirection.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_Physics2DRaycaster.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PhysicsRaycaster.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData_FramePressState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData_InputButton.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerInputModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerInputModule_MouseButtonEventData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_RaycastResult.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_StandaloneInputModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_UIBehaviour.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_PersistentListenerMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEventBase.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEventCallState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationClipPlayable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationMixerPlayable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationPlayable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimatorControllerPlayable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_DirectorPlayer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_DirectorUpdateMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_FrameData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_PlayState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_Playable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FilterMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FixedJoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FixedJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Flare.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FlareLayer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FocusType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FogMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Font.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ForceMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ForceMode2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FrictionJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GL.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GameObject.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GeometryUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Gradient.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GradientAlphaKey.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GradientColorKey.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Graphics.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Gyroscope.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Hash128.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HideFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HingeJoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HingeJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HorizontalWrapMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanBodyBones.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanBone.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanDescription.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanLimit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanPose.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanPoseHandler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanTrait.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_IMECompositionMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImageEffectOpaque.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImageEffectTransformsToLDR.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImagePosition.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Input.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Joint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Joint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointAngleLimits2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointDrive.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointLimitState2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointLimits.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointMotor.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointMotor2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointProjectionMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointSpring.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointSuspension2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointTranslationLimits2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JsonUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_KeyCode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Keyframe.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LOD.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LODFadeMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LODGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LayerMask.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LensFlare.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Light.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbes.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightRenderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightShadows.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapsMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapsModeLegacy.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LineRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationService.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationServiceStatus.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LogType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Logger.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MatchTargetWeightMask.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Material.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MaterialGlobalIlluminationFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MaterialPropertyBlock.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Mathf.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Matrix4x4.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Mesh.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshCollider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshFilter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshParticleEmitter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshTopology.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Microphone.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MissingComponentException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MissingReferenceException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MonoBehaviour.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Motion.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NPOTSupport.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMesh.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshAgent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshHit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshObstacle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshObstacleShape.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshPath.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshPathStatus.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NavMeshTriangulation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Object.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ObstacleAvoidanceType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OcclusionArea.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OcclusionPortal.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OffMeshLink.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OffMeshLinkData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OffMeshLinkType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Particle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleAnimator.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleCollisionEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleEmitter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticlePhysicsExtensions.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleRenderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemAnimationType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionQuality.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCurveMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemEmissionType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemGradientMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemInheritVelocityMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemMeshShapeType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderSpace.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemScalingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemShapeType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSimulationSpace.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSortMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_Burst.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_CollisionModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ColorBySpeedModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ColorOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_EmissionModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_EmitParams.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ExternalForcesModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ForceOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_InheritVelocityModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_LimitVelocityOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_MinMaxCurve.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_MinMaxGradient.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_Particle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_RotationBySpeedModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_RotationOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ShapeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SizeBySpeedModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SizeOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SubEmittersModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_TextureSheetAnimationModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_VelocityOverLifetimeModule.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicMaterial.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicMaterialCombine.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Physics.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Physics2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicsMaterial2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicsUpdateBehaviour2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Plane.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlatformEffector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayerPrefs.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayerPrefsException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PointEffector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PolygonCollider2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PrimitiveType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralCacheSize.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralLoadingBehavior.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralMaterial.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralOutputType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralProcessorUsage.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralPropertyDescription.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralPropertyType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralTexture.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Profiler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Projector.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QualitySettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Quaternion.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QueryTriggerInteraction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QueueMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Random.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Ray.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Ray2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RaycastHit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RaycastHit2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rect.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectOffset.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransformUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform_Axis.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform_Edge.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ReflectionProbe.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RelativeJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderBuffer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTargetSetup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTexture.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTextureFormat.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTextureReadWrite.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Renderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderingPath.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_AmbientMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BlendMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BlendOp.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinRenderTextureType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinShaderMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinShaderType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CameraEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ColorWriteMask.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CommandBuffer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CompareFunction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CullMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_DefaultReflectionMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_GraphicsDeviceType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_GraphicsSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_LightEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_OpaqueSortMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_PassType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionCubemapCompression.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeBlendInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeClearFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeRefreshMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeTimeSlicingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeUsage.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderBufferLoadAction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderBufferStoreAction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderTargetIdentifier.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ShadowCastingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ShadowSamplingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_SphericalHarmonicsL2.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_StencilOp.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Resolution.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ResourceRequest.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Resources.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rigidbody.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rigidbody2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyConstraints.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyConstraints2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyInterpolation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyInterpolation2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodySleepMode2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RotationDriveMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimeAnimatorController.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimeInitializeLoadType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimePlatform.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScaleMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_LoadSceneMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_Scene.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_SceneManager.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Screen.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScreenOrientation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScriptableObject.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Security.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SendMessageOptions.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Shader.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ShadowProjection.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkeletonBone.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkinQuality.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkinnedMeshRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Skybox.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SleepTimeout.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SliderJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SoftJointLimit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SoftJointLimitSpring.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SortingLayer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Space.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SparseTexture.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SphereCollider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpringJoint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpringJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Sprite.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteAlignment.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteMeshType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpritePackingMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpritePackingRotation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Sprites_DataUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StackTraceLogType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StackTraceUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StateMachineBehaviour.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StaticBatchingUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SurfaceEffector2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SystemInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SystemLanguage.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TargetJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TexGenMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextAnchor.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextAsset.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextGenerationSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextMesh.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture3D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextureFormat.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextureWrapMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ThreadPriority.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Time.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Touch.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TouchPhase.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TouchType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TrailRenderer.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Transform.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TransparencySortMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UICharInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UILineInfo.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UIVertex.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AnimationTriggers.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AspectRatioFitter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AspectRatioFitter_AspectMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_BaseMeshEffect.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Button.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Button_ButtonClickedEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_ScaleMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_ScreenMatchMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_Unit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasUpdate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasUpdateRegistry.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ClipperRegistry.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Clipping.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ColorBlock.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ContentSizeFitter.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ContentSizeFitter_FitMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_DefaultControls.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_DefaultControls_Resources.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_DropdownEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_OptionData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_OptionDataList.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_FontData.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_FontUpdateTracker.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Graphic.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRaycaster.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRaycaster_BlockingObjects.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRegistry.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Axis.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Constraint.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Corner.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_HorizontalLayoutGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_HorizontalOrVerticalLayoutGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_FillMethod.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin180.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin360.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin90.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_OriginHorizontal.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_OriginVertical.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Type.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_CharacterValidation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_ContentType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_InputType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_LineType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_OnChangeEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_SubmitEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutElement.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutRebuilder.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutUtility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Mask.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskUtilities.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskableGraphic.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskableGraphic_CullStateChangedEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Navigation.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Navigation_Mode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Outline.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_PositionAsUV1.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_RawImage.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_RectMask2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_MovementType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_ScrollRectEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_ScrollbarVisibility.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar_Direction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar_ScrollEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Selectable.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Selectable_Transition.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Shadow.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider_Direction.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider_SliderEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_SpriteState.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_StencilMaterial.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Text.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ToggleGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle_ToggleEvent.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle_ToggleTransition.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_VertexHelper.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_VerticalLayoutGroup.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnassignedReferenceException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnityEventQueueSystem.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnityException.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UserAuthorization.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_InputTracking.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRDevice.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRDeviceType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRNode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRSettings.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector2.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector3.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector4.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VerticalWrapMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WWW.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WWWForm.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForEndOfFrame.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForFixedUpdate.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForSeconds.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitUntil.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitWhile.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamDevice.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamFlags.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamTexture.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelCollider.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelFrictionCurve.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelHit.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelJoint2D.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WindZone.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WindZoneMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WrapMode.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\Circle.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\Custom.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\Deleg.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\HelloWorld.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\Main.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\Perf.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\ValueType.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\VarObj.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\test\\TestLua.cs\" />\r\n    <Compile Include=\"Assets\\Slua\\example\\test\\test.cs\" />\r\n  </ItemGroup>\r\n  <ItemGroup>\r\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\r\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\r\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\r\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\r\n  </ItemGroup>\r\n  <Import Project=\"$(MSBuildExtensionsPath)\\SyntaxTree\\UnityVS\\2015\\UnityVS.CSharp.targets\" />\r\n</Project>\r\n"
  },
  {
    "path": "uLui.Editor.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\n  <PropertyGroup>\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\n    <ProductVersion>10.0.20506</ProductVersion>\n    <SchemaVersion>2.0</SchemaVersion>\n    <ProjectGuid>{5CD529F8-08DD-1EE9-C43F-E00D2147F38D}</ProjectGuid>\n    <OutputType>Library</OutputType>\n    <AssemblyName>Assembly-CSharp-Editor</AssemblyName>\n    <FileAlignment>512</FileAlignment>\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\n    <TargetFrameworkProfile>Unity Full v3.5</TargetFrameworkProfile>\n    <CompilerResponseFile></CompilerResponseFile>\n    <UnityProjectType>Editor:5</UnityProjectType>\n    <UnityBuildTarget>StandaloneWindows:5</UnityBuildTarget>\n    <UnityVersion>5.5.0f3</UnityVersion>\n    <RootNamespace></RootNamespace>\n    <LangVersion>4</LangVersion>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <ItemGroup>\n    <Reference Include=\"mscorlib\" />\n    <Reference Include=\"System\" />\n    <Reference Include=\"System.XML\" />\n    <Reference Include=\"System.Core\" />\n    <Reference Include=\"Boo.Lang\" />\n    <Reference Include=\"UnityScript.Lang\" />\n    <Reference Include=\"System.Runtime.Serialization\" />\n    <Reference Include=\"System.Xml.Linq\" />\n    <Reference Include=\"UnityEngine\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Advertisements\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Advertisements.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.Advertisements\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Advertisements.dll</HintPath>\n    </Reference>\n    <Reference Include=\"nunit.framework\">\n      <HintPath>Library\\UnityAssemblies\\nunit.framework.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.EditorTestsRunner\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.EditorTestsRunner.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.UI\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.UI\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.UI.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Networking\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.Networking\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Networking.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.PlaymodeTestsRunner\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.PlaymodeTestsRunner.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.PlaymodeTestsRunner\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.PlaymodeTestsRunner.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.TreeEditor\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.TreeEditor.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Analytics\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Analytics.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.Analytics\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Analytics.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.HoloLens\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.HoloLens.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.HoloLens\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.HoloLens.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Purchasing\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Purchasing.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.VR\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.VR.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.VR\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.VR.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.Graphs\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Graphs.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.Android.Extensions\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.Android.Extensions.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor.WindowsStandalone.Extensions\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.WindowsStandalone.Extensions.dll</HintPath>\n    </Reference>\n    <Reference Include=\"SyntaxTree.VisualStudio.Unity.Bridge\">\n      <HintPath>Library\\UnityAssemblies\\SyntaxTree.VisualStudio.Unity.Bridge.dll</HintPath>\n    </Reference>\n  </ItemGroup>\n  <ItemGroup>\n    <ProjectReference Include=\"uLui.Plugins.csproj\">\n      <Project>{33F5C06A-C3A5-DA5A-6E16-82A6F0BD79CD}</Project>\n      <Name>uLui.Plugins</Name>\n    </ProjectReference>\n    <ProjectReference Include=\"uLui.csproj\">\n      <Project>{FADC2460-E91B-3BC6-1583-25B73971A390}</Project>\n      <Name>uLui</Name>\n    </ProjectReference>\n  </ItemGroup>\n  <ItemGroup>\n    <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportAssetBundles.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\AssetBundleMaker\\ExportConfigWindow.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFont.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMFontReader.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BMGlyph.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmBetterList.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmByteReader.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\BmfontMaker\\BmFontEditor.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\Helper.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\I18nExporter\\I18nExporter.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\MakeDebugFile.cs\" />\n    <Compile Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\TexturePackerImporter.cs\" />\n    <Compile Include=\"Assets\\Slua\\Editor\\CustomEditor.cs\" />\n    <Compile Include=\"Assets\\Slua\\Editor\\CustomExport.cs\" />\n    <Compile Include=\"Assets\\Slua\\Editor\\LuaCodeGen.cs\" />\n  </ItemGroup>\n  <ItemGroup>\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\n  </ItemGroup>\n  <Import Project=\"$(MSBuildToolsPath)\\Microsoft.CSharp.targets\" />\n  <Target Name=\"GenerateTargetFrameworkMonikerAttribute\" />\n</Project>\n"
  },
  {
    "path": "uLui.Plugins.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\n  <PropertyGroup>\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\n    <ProductVersion>10.0.20506</ProductVersion>\n    <SchemaVersion>2.0</SchemaVersion>\n    <ProjectGuid>{33F5C06A-C3A5-DA5A-6E16-82A6F0BD79CD}</ProjectGuid>\n    <OutputType>Library</OutputType>\n    <AssemblyName>Assembly-CSharp-firstpass</AssemblyName>\n    <FileAlignment>512</FileAlignment>\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\n    <TargetFrameworkProfile>Unity Subset v3.5</TargetFrameworkProfile>\n    <CompilerResponseFile></CompilerResponseFile>\n    <UnityProjectType>GamePlugins:3</UnityProjectType>\n    <UnityBuildTarget>StandaloneWindows:5</UnityBuildTarget>\n    <UnityVersion>5.5.0f3</UnityVersion>\n    <RootNamespace></RootNamespace>\n    <LangVersion>4</LangVersion>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <ItemGroup>\n    <Reference Include=\"mscorlib\" />\n    <Reference Include=\"System\" />\n    <Reference Include=\"System.XML\" />\n    <Reference Include=\"System.Core\" />\n    <Reference Include=\"Boo.Lang\" />\n    <Reference Include=\"UnityScript.Lang\" />\n    <Reference Include=\"System.Runtime.Serialization\" />\n    <Reference Include=\"System.Xml.Linq\" />\n    <Reference Include=\"UnityEngine\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Advertisements\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Advertisements.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.UI\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Networking\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.PlaymodeTestsRunner\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.PlaymodeTestsRunner.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Analytics\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Analytics.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.HoloLens\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.HoloLens.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Purchasing\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Purchasing.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.VR\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.VR.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\n    </Reference>\n  </ItemGroup>\n  <ItemGroup>\n    <Compile Include=\"Assets\\Plugins\\ILeanTween.cs\" />\n    <Compile Include=\"Assets\\Plugins\\LTDescr.cs\" />\n    <Compile Include=\"Assets\\Plugins\\LeanAudio.cs\" />\n    <Compile Include=\"Assets\\Plugins\\LeanTween.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ByteArray.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Coroutine.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Helper.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\CjsonLib.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\LuasocketLib.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\PbcLib.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\SprotoLib.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lib3rd\\SqliteLib.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Logger.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdDLL.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Lua3rdMeta.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaArray.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLL.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaDLLWrapper.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_basetype.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaObject_overload.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaState.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvr.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaSvrGameObject.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaValueType.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\LuaVarObject.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\ObjectCache.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\SLuaSetting.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\Timer.cs\" />\n    <Compile Include=\"Assets\\Plugins\\Slua_Managed\\WeakDictionary.cs\" />\n  </ItemGroup>\n  <ItemGroup>\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\n  </ItemGroup>\n  <Import Project=\"$(MSBuildToolsPath)\\Microsoft.CSharp.targets\" />\n  <Target Name=\"GenerateTargetFrameworkMonikerAttribute\" />\n</Project>\n"
  },
  {
    "path": "uLui.csproj",
    "content": "﻿<?xml version=\"1.0\" encoding=\"utf-8\"?>\n<Project ToolsVersion=\"4.0\" DefaultTargets=\"Build\" xmlns=\"http://schemas.microsoft.com/developer/msbuild/2003\">\n  <PropertyGroup>\n    <Configuration Condition=\" '$(Configuration)' == '' \">Debug</Configuration>\n    <Platform Condition=\" '$(Platform)' == '' \">AnyCPU</Platform>\n    <ProductVersion>10.0.20506</ProductVersion>\n    <SchemaVersion>2.0</SchemaVersion>\n    <ProjectGuid>{FADC2460-E91B-3BC6-1583-25B73971A390}</ProjectGuid>\n    <OutputType>Library</OutputType>\n    <AssemblyName>Assembly-CSharp</AssemblyName>\n    <FileAlignment>512</FileAlignment>\n    <ProjectTypeGuids>{E097FAD1-6243-4DAD-9C02-E9B9EFC3FFC1};{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}</ProjectTypeGuids>\n    <TargetFrameworkIdentifier>.NETFramework</TargetFrameworkIdentifier>\n    <TargetFrameworkVersion>v3.5</TargetFrameworkVersion>\n    <TargetFrameworkProfile>Unity Subset v3.5</TargetFrameworkProfile>\n    <CompilerResponseFile></CompilerResponseFile>\n    <UnityProjectType>Game:1</UnityProjectType>\n    <UnityBuildTarget>StandaloneWindows:5</UnityBuildTarget>\n    <UnityVersion>5.5.0f3</UnityVersion>\n    <RootNamespace></RootNamespace>\n    <LangVersion>4</LangVersion>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Debug\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Debug\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>DEBUG;TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <PropertyGroup Condition=\" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' \">\n    <DebugType>pdbonly</DebugType>\n    <Optimize>false</Optimize>\n    <OutputPath>Temp\\UnityVS_bin\\Release\\</OutputPath>\n    <IntermediateOutputPath>Temp\\UnityVS_obj\\Release\\</IntermediateOutputPath>\n    <ErrorReport>prompt</ErrorReport>\n    <WarningLevel>4</WarningLevel>\n    <DefineConstants>TRACE;UNITY_5_3_OR_NEWER;UNITY_5_4_OR_NEWER;UNITY_5_5_OR_NEWER;UNITY_5_5_0;UNITY_5_5;UNITY_5;ENABLE_AUDIO;ENABLE_CACHING;ENABLE_CLOTH;ENABLE_DUCK_TYPING;ENABLE_GENERICS;ENABLE_MICROPHONE;ENABLE_MULTIPLE_DISPLAYS;ENABLE_PHYSICS;ENABLE_SPRITERENDERER_FLIPPING;ENABLE_SPRITES;ENABLE_TERRAIN;ENABLE_RAKNET;ENABLE_UNET;ENABLE_LZMA;ENABLE_UNITYEVENTS;ENABLE_WEBCAM;ENABLE_WWW;ENABLE_CLOUD_SERVICES_COLLAB;ENABLE_CLOUD_SERVICES_ADS;ENABLE_CLOUD_HUB;ENABLE_CLOUD_PROJECT_ID;ENABLE_CLOUD_SERVICES_UNET;ENABLE_CLOUD_SERVICES_BUILD;ENABLE_CLOUD_LICENSE;ENABLE_EDITOR_METRICS;ENABLE_EDITOR_METRICS_CACHING;INCLUDE_DYNAMIC_GI;INCLUDE_GI;PLATFORM_SUPPORTS_MONO;RENDER_SOFTWARE_CURSOR;INCLUDE_PUBNUB;ENABLE_PLAYMODE_TESTS_RUNNER;ENABLE_SCRIPTING_NEW_CSHARP_COMPILER;UNITY_STANDALONE_WIN;UNITY_STANDALONE;ENABLE_SUBSTANCE;ENABLE_RUNTIME_GI;ENABLE_MOVIES;ENABLE_NETWORK;ENABLE_CRUNCH_TEXTURE_COMPRESSION;ENABLE_UNITYWEBREQUEST;ENABLE_CLOUD_SERVICES;ENABLE_CLOUD_SERVICES_ANALYTICS;ENABLE_CLOUD_SERVICES_PURCHASING;ENABLE_CLOUD_SERVICES_CRASH_REPORTING;ENABLE_EVENT_QUEUE;ENABLE_CLUSTERINPUT;ENABLE_VIDEO;ENABLE_VR;ENABLE_WEBSOCKET_HOST;ENABLE_MONO;ENABLE_PROFILER;DEBUG;TRACE;UNITY_ASSERTIONS;UNITY_EDITOR;UNITY_EDITOR_64;UNITY_EDITOR_WIN;UNITY_TEAM_LICENSE;ENABLE_VSTU;CROSS_PLATFORM_INPUT</DefineConstants>\n    <AllowUnsafeBlocks>false</AllowUnsafeBlocks>\n  </PropertyGroup>\n  <ItemGroup>\n    <Reference Include=\"mscorlib\" />\n    <Reference Include=\"System\" />\n    <Reference Include=\"System.XML\" />\n    <Reference Include=\"System.Core\" />\n    <Reference Include=\"Boo.Lang\" />\n    <Reference Include=\"UnityScript.Lang\" />\n    <Reference Include=\"System.Runtime.Serialization\" />\n    <Reference Include=\"System.Xml.Linq\" />\n    <Reference Include=\"UnityEngine\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Advertisements\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Advertisements.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.UI\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.UI.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Networking\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Networking.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.PlaymodeTestsRunner\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.PlaymodeTestsRunner.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Analytics\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Analytics.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.HoloLens\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.HoloLens.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.Purchasing\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.Purchasing.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEngine.VR\">\n      <HintPath>Library\\UnityAssemblies\\UnityEngine.VR.dll</HintPath>\n    </Reference>\n    <Reference Include=\"UnityEditor\">\n      <HintPath>Library\\UnityAssemblies\\UnityEditor.dll</HintPath>\n    </Reference>\n  </ItemGroup>\n  <ItemGroup>\n    <ProjectReference Include=\"uLui.Plugins.csproj\">\n      <Project>{33F5C06A-C3A5-DA5A-6E16-82A6F0BD79CD}</Project>\n      <Name>uLui.Plugins</Name>\n    </ProjectReference>\n  </ItemGroup>\n  <ItemGroup>\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\Firstui.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\Secondui.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Demo\\WindowGridView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\Game.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LArchiveBin.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LArchiveBinFile.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LGameConfig.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLoadBundle.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaBehaviourBase.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaBehaviourInterface.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LLuaTable.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LResUpdate.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LBase\\LUtil.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LButton.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LControlView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LDragView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LExpandListView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LExpandNode.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LFPSView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LGridPageView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LGridView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LHUDSort.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LHUDView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LLabelAtlas.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LListView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LMacros.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LMovieClip.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LPageView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LPickMark.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LProgress.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LRichText.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LScrollView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LSlider.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LTableView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWidget\\LTouchView.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWindow\\LWindowBase.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\LWindow\\LWindowManager.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\Network.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\NetworkInterface.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\Reactor.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\ServerProxy.cs\" />\n    <Compile Include=\"Assets\\Game\\Resources\\Scripts\\Net\\TCPClientWorker.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\BindCustom.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaDelegate_LResUpdate_HandleUnzipProgress.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaDelegate_System_Action.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_LTEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_System_Object.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Color.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Vector2.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_UnityEngine_Vector3.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_bool.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_float.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_UnityEngine_Vector3_System_Object.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_float_System_Object.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_float_float.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_int_Dictionary_System_Int32_object_.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_2_int_string.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Action_3_int_SLua_ByteArray_bool.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Comparison_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Func_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaSystem_Predicate_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_EventSystems_PointerEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_GameObject.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_Vector2.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_UnityEngine_Vector3.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_float.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_1_string.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_2_int_UnityEngine_GameObject.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_2_string_Dictionary_System_String_System_String_.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_3_float_float_bool.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\LuaUnityEngine_Events_UnityAction_3_string_string_UnityEngine_LogType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Game.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LDragView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LGameConfig.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LHUDSort.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LHUDView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LLoadBundle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LLuaBehaviourBase.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LNetwork.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LPickMark.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LProgress.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LResUpdate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LSlider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LTDescrImpl.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LUtil.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LWindowBase.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LWindowManager.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_LeanTween.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LButton.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LControlView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LExpandListView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LExpandNode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LGridPageView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LGridView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LLabelAtlas.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LListView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LMovieClip.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LPageView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LRichText.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LScrollView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LTableView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_Lui_LTouchView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_ProgressLabStyle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_Collections_Generic_Dictionary_2_int_string.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_Collections_Generic_List_1_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_System_String.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_WindowDispose.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Custom\\Lua_WindowHierarchy.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\BindUnity.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\BindUnityUI.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Application_AdvertisingIdentifierCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Application_LogCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioClip_PCMReaderCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioClip_PCMSetPositionCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_AudioSettings_AudioConfigurationChangeHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Camera_CameraCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Canvas_WillRenderCanvases.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_CullingGroup_StateChanged.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Display_DisplaysUpdatedDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Events_UnityAction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Font_FontTextureRebuildCallback.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_RectTransform_ReapplyDrivenProperties.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_RemoteSettings_UpdatedEventHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_UI_InputField_OnValidateInput.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_DictationRecognizer_DictationCompletedDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_DictationRecognizer_DictationErrorHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_DictationRecognizer_DictationHypothesisDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_DictationRecognizer_DictationResultDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_PhraseRecognitionSystem_ErrorDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_PhraseRecognitionSystem_StatusDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaDelegate_UnityEngine_Windows_Speech_PhraseRecognizer_PhraseRecognizedDelegate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaSystem_Func_1_bool.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaSystem_Func_2_UnityEngine_UI_ILayoutElement_float.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IBeginDragHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ICancelHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDeselectHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDragHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IDropHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IEndDragHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IInitializePotentialDragHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IMoveHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerClickHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerDownHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerEnterHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerExitHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IPointerUpHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IScrollHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ISelectHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_ISubmitHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEngine_EventSystems_ExecuteEvents_EventFunction_1_UnityEngine_EventSystems_IUpdateSelectedHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_UnityEngine_EventSystems_BaseEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_UnityEngine_Vector2.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_bool.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_float.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_int.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\LuaUnityEvent_string.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_JetBrains_Annotations_ImplicitUseKindFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_JetBrains_Annotations_ImplicitUseTargetFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMesh.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshAgent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshHit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshObstacle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshObstacleShape.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshPath.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshPathStatus.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_NavMeshTriangulation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_ObstacleAvoidanceType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_OffMeshLink.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_OffMeshLinkData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AI_OffMeshLinkType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AccelerationEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Analytics_Analytics.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Analytics_AnalyticsResult.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Analytics_Gender.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnchoredJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Animation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationBlendMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationClip.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationClipPair.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationCullingType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationCurve.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationPlayMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimationState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Animator.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorClipInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorControllerParameter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorControllerParameterType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorCullingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorOverrideController.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorRecorderMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorStateInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorTransitionInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorUpdateMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnimatorUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AnisotropicFiltering.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Application.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ApplicationInstallMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ApplicationSandboxType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AreaEffector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_Assert.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_AssertionException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Assertions_Comparers_FloatComparer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleCreateRequest.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleManifest.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AssetBundleRequest.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AsyncOperation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioChorusFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioClip.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioClipLoadType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioCompressionFormat.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioConfiguration.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioDataLoadState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioDistortionFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioEchoFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioHighPassFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioListener.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioLowPassFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbPreset.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioReverbZone.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioRolloffMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSource.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSourceCurveType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioSpeakerMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AudioVelocityUpdateMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixerGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixerSnapshot.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Audio_AudioMixerUpdateMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Avatar.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarBuilder.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarIKGoal.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarIKHint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_AvatarTarget.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Behaviour.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BillboardAsset.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BillboardRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BlendWeights.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoneWeight.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoundingSphere.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Bounds.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoxCollider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BoxCollider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_BuoyancyEffector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Caching.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Camera.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CameraClearFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CameraType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Camera_MonoOrStereoscopicEye.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Camera_StereoscopicEye.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Canvas.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CanvasGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CanvasRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CapsuleCollider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CapsuleCollider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CapsuleDirection2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterController.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CharacterJoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CircleCollider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Cloth.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ClothSkinningCoefficient.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ClothSphereColliderPair.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collision.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Collision2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionDetectionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionDetectionMode2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CollisionFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Color.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Color32.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ColorSpace.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ColorUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CombineInstance.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Compass.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Component.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeBuffer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeBufferType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ComputeShader.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConfigurableJoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConfigurableJointMotion.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConstantForce.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ConstantForce2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ContactPoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ContactPoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ControllerColliderHit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CrashReport.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CrashReportHandler_CrashReportHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Cubemap.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CubemapArray.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CubemapFace.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CullingGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CullingGroupEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_CustomYieldInstruction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Debug.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DefaultExecutionOrder.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DepthTextureMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DeviceOrientation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DeviceType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Diagnostics_PlayerConnection.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Display.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DistanceJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DrivenRectTransformTracker.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DrivenTransformProperties.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_DynamicGI.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EdgeCollider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Effector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EffectorForceMode2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EffectorSelection2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Event.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_AbstractEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_AxisEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseInput.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseInputModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_BaseRaycaster.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventHandle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventSystem.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTriggerType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger_Entry.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_EventTrigger_TriggerEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_ExecuteEvents.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_MoveDirection.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_Physics2DRaycaster.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PhysicsRaycaster.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData_FramePressState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerEventData_InputButton.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerInputModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_PointerInputModule_MouseButtonEventData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_RaycastResult.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_StandaloneInputModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_EventSystems_UIBehaviour.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_PersistentListenerMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEventBase.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Events_UnityEventCallState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationClipPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationMixerPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimationPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_AnimatorControllerPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_CustomAnimationPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_DirectorPlayer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_DirectorUpdateMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_FrameData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_GenericMixerPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_PlayState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_Playable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Experimental_Director_ScriptPlayable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FilterMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FixedJoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FixedJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Flare.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FlareLayer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FocusType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FogMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Font.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ForceMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ForceMode2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_FrictionJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GL.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GameObject.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GeometryUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Gradient.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GradientAlphaKey.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GradientColorKey.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_GradientMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Gyroscope.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Hash128.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HideFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HingeJoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HingeJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HorizontalWrapMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanBodyBones.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanBone.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanDescription.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanLimit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanPose.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanPoseHandler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_HumanTrait.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_IMECompositionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImageEffectAllowedInSceneView.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImageEffectOpaque.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImageEffectTransformsToLDR.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ImagePosition.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Input.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Joint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Joint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointAngleLimits2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointDrive.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointLimitState2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointLimits.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointMotor.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointMotor2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointProjectionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointSpring.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointSuspension2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JointTranslationLimits2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_JsonUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_KeyCode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Keyframe.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LOD.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LODFadeMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LODGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LayerMask.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LensFlare.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Light.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeProxyVolume.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeProxyVolume_BoundingBoxMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeProxyVolume_ProbePositionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeProxyVolume_RefreshMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbeProxyVolume_ResolutionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightProbes.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightRenderMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightShadows.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmappingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapsMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LightmapsModeLegacy.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LineRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LineTextureMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationService.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LocationServiceStatus.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_LogType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Logger.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MatchTargetWeightMask.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Material.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MaterialGlobalIlluminationFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MaterialPropertyBlock.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Mathf.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Matrix4x4.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Mesh.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshCollider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshFilter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MeshTopology.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Microphone.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MissingComponentException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MissingReferenceException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MonoBehaviour.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Motion.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_MotionVectorGenerationMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_NPOTSupport.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Object.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OcclusionArea.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OcclusionPortal.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_OperatingSystemFamily.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleCollisionEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticlePhysicsExtensions.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemAnimationType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionQuality.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCollisionType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCurveMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemCustomData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemGradientMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemInheritVelocityMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemMeshShapeType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemNoiseQuality.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemOverlapAction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderSpace.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemScalingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemShapeType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSimulationSpace.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSortMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemStopBehavior.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSubEmitterProperties.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemSubEmitterType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemTrailTextureMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystemVertexStreams.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_Burst.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_CollisionModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ColorBySpeedModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ColorOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_EmissionModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_EmitParams.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ExternalForcesModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ForceOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_InheritVelocityModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_LightsModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_LimitVelocityOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_MainModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_MinMaxCurve.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_MinMaxGradient.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_NoiseModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_Particle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_RotationBySpeedModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_RotationOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_ShapeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SizeBySpeedModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SizeOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_SubEmittersModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_TextureSheetAnimationModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_TrailModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_TriggerModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ParticleSystem_VelocityOverLifetimeModule.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicMaterial.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicMaterialCombine.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Physics.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Physics2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicsMaterial2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PhysicsUpdateBehaviour2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Plane.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlatformEffector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayerPrefs.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PlayerPrefsException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PointEffector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PolygonCollider2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PreferBinarySerialization.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_PrimitiveType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralCacheSize.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralLoadingBehavior.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralMaterial.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralOutputType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralProcessorUsage.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralPropertyDescription.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralPropertyType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ProceduralTexture.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Profiling_Profiler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Projector.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QualitySettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Quaternion.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QueryTriggerInteraction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_QueueMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Random.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Random_State.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Ray.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Ray2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RaycastHit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RaycastHit2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rect.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectOffset.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransformUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform_Axis.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RectTransform_Edge.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ReflectionProbe.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RelativeJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RemoteSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderBuffer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTargetSetup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTexture.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTextureFormat.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderTextureReadWrite.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Renderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RenderingPath.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_AmbientMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BlendMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BlendOp.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinRenderTextureType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinShaderMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_BuiltinShaderType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CameraEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ColorWriteMask.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CommandBuffer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CompareFunction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CopyTextureSupport.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_CullMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_DefaultReflectionMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_LightEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_LightProbeUsage.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_LightShadowResolution.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_OpaqueSortMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_PassType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionCubemapCompression.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeBlendInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeClearFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeRefreshMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeTimeSlicingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ReflectionProbeUsage.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderBufferLoadAction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderBufferStoreAction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderQueue.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_RenderTargetIdentifier.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ShadowCastingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_ShadowSamplingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_SphericalHarmonicsL2.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_SplashScreen.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_StencilOp.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_TextureDimension.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rendering_UVChannelFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Resolution.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ResourceRequest.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Resources.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rigidbody.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Rigidbody2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyConstraints.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyConstraints2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyInterpolation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyInterpolation2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodySleepMode2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RigidbodyType2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RotationDriveMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimeAnimatorController.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimeInitializeLoadType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_RuntimePlatform.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScaleMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_LoadSceneMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_Scene.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_SceneManager.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SceneManagement_SceneUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Screen.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScreenOrientation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ScriptableObject.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Security.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SendMessageOptions.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Shader.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ShadowProjection.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ShadowQuality.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ShadowResolution.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkeletonBone.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkinQuality.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SkinnedMeshRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Skybox.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SleepTimeout.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SliderJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SoftJointLimit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SoftJointLimitSpring.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SortingLayer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Space.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SparseTexture.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SphereCollider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpringJoint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpringJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Sprite.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteAlignment.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteMeshType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpritePackingMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpritePackingRotation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SpriteRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Sprites_DataUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StackTraceLogType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StackTraceUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StateMachineBehaviour.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StaticBatchingUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_StereoTargetEyeMask.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SurfaceEffector2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SystemInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_SystemLanguage.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TargetJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TexGenMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextAnchor.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextAsset.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextGenerationSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextMesh.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture2DArray.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Texture3D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextureFormat.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TextureWrapMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_ThreadPriority.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Time.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Touch.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TouchPhase.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TouchType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TrailRenderer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Transform.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_TransparencySortMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UICharInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UILineInfo.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UIVertex.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AnimationTriggers.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AspectRatioFitter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_AspectRatioFitter_AspectMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_BaseMeshEffect.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Button.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Button_ButtonClickedEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_ScaleMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_ScreenMatchMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasScaler_Unit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasUpdate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_CanvasUpdateRegistry.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ClipperRegistry.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Clipping.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ColorBlock.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ContentSizeFitter.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ContentSizeFitter_FitMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_DefaultControls.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_DefaultControls_Resources.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_DropdownEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_OptionData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Dropdown_OptionDataList.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_FontData.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_FontUpdateTracker.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Graphic.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRaycaster.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRaycaster_BlockingObjects.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GraphicRegistry.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Axis.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Constraint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_GridLayoutGroup_Corner.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_HorizontalLayoutGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_HorizontalOrVerticalLayoutGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_FillMethod.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin180.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin360.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Origin90.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_OriginHorizontal.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_OriginVertical.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Image_Type.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_CharacterValidation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_ContentType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_InputType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_LineType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_OnChangeEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_InputField_SubmitEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutElement.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutRebuilder.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_LayoutUtility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Mask.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskUtilities.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskableGraphic.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_MaskableGraphic_CullStateChangedEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Navigation.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Navigation_Mode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Outline.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_PositionAsUV1.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_RawImage.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_RectMask2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_MovementType.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_ScrollRectEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ScrollRect_ScrollbarVisibility.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar_Direction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Scrollbar_ScrollEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Selectable.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Selectable_Transition.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Shadow.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider_Direction.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Slider_SliderEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_SpriteState.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_StencilMaterial.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Text.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_ToggleGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle_ToggleEvent.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_Toggle_ToggleTransition.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_VertexHelper.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UI_VerticalLayoutGroup.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnassignedReferenceException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnityEventQueueSystem.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UnityException.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_UserAuthorization.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_InputTracking.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRDevice.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRNode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRSettings.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VR_VRStats.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector2.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector3.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Vector4.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_VerticalWrapMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WWW.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WWWForm.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForEndOfFrame.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForFixedUpdate.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForSeconds.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitForSecondsRealtime.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitUntil.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WaitWhile.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamDevice.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamFlags.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WebCamTexture.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelCollider.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelFrictionCurve.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelHit.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WheelJoint2D.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WindZone.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WindZoneMode.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_ConfidenceLevel.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_DictationCompletionCause.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_DictationRecognizer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_DictationTopicConstraint.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_GrammarRecognizer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_KeywordRecognizer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_PhraseRecognitionSystem.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_PhraseRecognizedEventArgs.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_PhraseRecognizer.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_SemanticMeaning.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_SpeechError.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_Windows_Speech_SpeechSystemStatus.cs\" />\n    <Compile Include=\"Assets\\Slua\\LuaObject\\Unity\\Lua_UnityEngine_WrapMode.cs\" />\n  </ItemGroup>\n  <ItemGroup>\n    <None Include=\"Assets\\Game\\Editor\\TexturePackerImporter\\SettingsTexturePackerImporter.txt\" />\n    <None Include=\"Assets\\Game\\Models\\CubeMap.shader\" />\n    <None Include=\"Assets\\Game\\Resources\\config.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\circle\\circle.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\custom.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\delegate.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\main.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\module\\some.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\perf.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\valuetype.txt\" />\n    <None Include=\"Assets\\Slua\\Resources\\varobj.txt\" />\n  </ItemGroup>\n  <Import Project=\"$(MSBuildToolsPath)\\Microsoft.CSharp.targets\" />\n  <Target Name=\"GenerateTargetFrameworkMonikerAttribute\" />\n</Project>\n"
  }
]